From be257ca6a32716d4bbad12696acb95bf79d7d1b6 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 16 Oct 2021 10:18:11 -0300
Subject: [PATCH 01/34] first commit - job

---
 .../.github/ISSUE_TEMPLATE/bug_report.md      |   24 +
 .../.github/ISSUE_TEMPLATE/crash_report.md    |   20 +
 .../.github/ISSUE_TEMPLATE/feature_request.md |   24 +
 .../.github/ISSUE_TEMPLATE/other_stuff.md     |    8 +
 .../.github/ISSUE_TEMPLATE/question.md        |   21 +
 redis-stable/.github/workflows/ci.yml         |   60 +
 redis-stable/.github/workflows/daily.yml      |  308 +
 redis-stable/.gitignore                       |   40 +
 redis-stable/00-RELEASENOTES                  |  692 ++
 redis-stable/BUGS                             |    1 +
 redis-stable/CONDUCT                          |   96 +
 redis-stable/CONTRIBUTING                     |   74 +
 redis-stable/COPYING                          |   10 +
 redis-stable/INSTALL                          |    1 +
 redis-stable/MANIFESTO                        |  106 +
 redis-stable/Makefile                         |   11 +
 redis-stable/README.md                        |  487 +
 redis-stable/TLS.md                           |   87 +
 redis-stable/deps/Makefile                    |   94 +
 redis-stable/deps/README.md                   |   82 +
 redis-stable/deps/hdr_histogram/COPYING.txt   |  121 +
 redis-stable/deps/hdr_histogram/LICENSE.txt   |   41 +
 redis-stable/deps/hdr_histogram/Makefile      |   20 +
 redis-stable/deps/hdr_histogram/README.md     |   10 +
 redis-stable/deps/hdr_histogram/hdr_atomic.h  |  146 +
 .../deps/hdr_histogram/hdr_histogram.c        | 1155 ++
 .../deps/hdr_histogram/hdr_histogram.h        |  509 +
 redis-stable/deps/hiredis/.gitignore          |    9 +
 redis-stable/deps/hiredis/.travis.yml         |  131 +
 redis-stable/deps/hiredis/CHANGELOG.md        |  345 +
 redis-stable/deps/hiredis/CMakeLists.txt      |  165 +
 redis-stable/deps/hiredis/COPYING             |   29 +
 redis-stable/deps/hiredis/Makefile            |  313 +
 redis-stable/deps/hiredis/README.md           |  658 ++
 redis-stable/deps/hiredis/adapters/ae.h       |  130 +
 redis-stable/deps/hiredis/adapters/glib.h     |  156 +
 redis-stable/deps/hiredis/adapters/ivykis.h   |   84 +
 redis-stable/deps/hiredis/adapters/libev.h    |  179 +
 redis-stable/deps/hiredis/adapters/libevent.h |  175 +
 redis-stable/deps/hiredis/adapters/libuv.h    |  117 +
 redis-stable/deps/hiredis/adapters/macosx.h   |  115 +
 redis-stable/deps/hiredis/adapters/qt.h       |  135 +
 redis-stable/deps/hiredis/alloc.c             |   86 +
 redis-stable/deps/hiredis/alloc.h             |   91 +
 redis-stable/deps/hiredis/appveyor.yml        |   24 +
 redis-stable/deps/hiredis/async.c             |  887 ++
 redis-stable/deps/hiredis/async.h             |  147 +
 redis-stable/deps/hiredis/async_private.h     |   75 +
 redis-stable/deps/hiredis/dict.c              |  352 +
 redis-stable/deps/hiredis/dict.h              |  126 +
 .../deps/hiredis/examples/CMakeLists.txt      |   49 +
 .../deps/hiredis/examples/example-ae.c        |   62 +
 .../deps/hiredis/examples/example-glib.c      |   73 +
 .../deps/hiredis/examples/example-ivykis.c    |   60 +
 .../deps/hiredis/examples/example-libev.c     |   54 +
 .../hiredis/examples/example-libevent-ssl.c   |   90 +
 .../deps/hiredis/examples/example-libevent.c  |   67 +
 .../deps/hiredis/examples/example-libuv.c     |   56 +
 .../deps/hiredis/examples/example-macosx.c    |   66 +
 .../deps/hiredis/examples/example-push.c      |  160 +
 .../deps/hiredis/examples/example-qt.cpp      |   46 +
 .../deps/hiredis/examples/example-qt.h        |   32 +
 .../deps/hiredis/examples/example-ssl.c       |  110 +
 redis-stable/deps/hiredis/examples/example.c  |   91 +
 redis-stable/deps/hiredis/fmacros.h           |   12 +
 .../deps/hiredis/hiredis-config.cmake.in      |   13 +
 redis-stable/deps/hiredis/hiredis.c           | 1175 ++
 redis-stable/deps/hiredis/hiredis.h           |  336 +
 redis-stable/deps/hiredis/hiredis.pc.in       |   12 +
 .../deps/hiredis/hiredis_ssl-config.cmake.in  |   13 +
 redis-stable/deps/hiredis/hiredis_ssl.h       |  127 +
 redis-stable/deps/hiredis/hiredis_ssl.pc.in   |   12 +
 redis-stable/deps/hiredis/net.c               |  612 ++
 redis-stable/deps/hiredis/net.h               |   56 +
 redis-stable/deps/hiredis/read.c              |  739 ++
 redis-stable/deps/hiredis/read.h              |  129 +
 redis-stable/deps/hiredis/sds.c               | 1289 +++
 redis-stable/deps/hiredis/sds.h               |  278 +
 redis-stable/deps/hiredis/sdsalloc.h          |   44 +
 redis-stable/deps/hiredis/sdscompat.h         |   94 +
 redis-stable/deps/hiredis/sockcompat.c        |  248 +
 redis-stable/deps/hiredis/sockcompat.h        |   92 +
 redis-stable/deps/hiredis/ssl.c               |  526 +
 redis-stable/deps/hiredis/test.c              | 1425 +++
 redis-stable/deps/hiredis/test.sh             |   78 +
 redis-stable/deps/hiredis/win32.h             |   56 +
 redis-stable/deps/jemalloc/.appveyor.yml      |   42 +
 redis-stable/deps/jemalloc/.autom4te.cfg      |    3 +
 redis-stable/deps/jemalloc/.gitattributes     |    1 +
 redis-stable/deps/jemalloc/.gitignore         |   93 +
 redis-stable/deps/jemalloc/.travis.yml        |  156 +
 redis-stable/deps/jemalloc/COPYING            |   27 +
 redis-stable/deps/jemalloc/ChangeLog          | 1382 +++
 redis-stable/deps/jemalloc/INSTALL.md         |  423 +
 redis-stable/deps/jemalloc/Makefile.in        |  569 +
 redis-stable/deps/jemalloc/README             |   20 +
 redis-stable/deps/jemalloc/TUNING.md          |  129 +
 redis-stable/deps/jemalloc/autogen.sh         |   17 +
 .../deps/jemalloc/bin/jemalloc-config.in      |   83 +
 redis-stable/deps/jemalloc/bin/jemalloc.sh.in |    9 +
 redis-stable/deps/jemalloc/bin/jeprof.in      | 5624 ++++++++++
 .../deps/jemalloc/build-aux/config.guess      | 1462 +++
 .../deps/jemalloc/build-aux/config.sub        | 1825 ++++
 .../deps/jemalloc/build-aux/install-sh        |  250 +
 redis-stable/deps/jemalloc/config.stamp.in    |    0
 redis-stable/deps/jemalloc/configure.ac       | 2294 ++++
 redis-stable/deps/jemalloc/doc/html.xsl.in    |    5 +
 .../deps/jemalloc/doc/jemalloc.xml.in         | 3379 ++++++
 .../deps/jemalloc/doc/manpages.xsl.in         |    4 +
 redis-stable/deps/jemalloc/doc/stylesheet.xsl |   10 +
 .../include/jemalloc/internal/arena_externs.h |   94 +
 .../jemalloc/internal/arena_inlines_a.h       |   57 +
 .../jemalloc/internal/arena_inlines_b.h       |  354 +
 .../include/jemalloc/internal/arena_stats.h   |  237 +
 .../jemalloc/internal/arena_structs_a.h       |   11 +
 .../jemalloc/internal/arena_structs_b.h       |  229 +
 .../include/jemalloc/internal/arena_types.h   |   43 +
 .../include/jemalloc/internal/assert.h        |   56 +
 .../include/jemalloc/internal/atomic.h        |   77 +
 .../include/jemalloc/internal/atomic_c11.h    |   97 +
 .../jemalloc/internal/atomic_gcc_atomic.h     |  127 +
 .../jemalloc/internal/atomic_gcc_sync.h       |  191 +
 .../include/jemalloc/internal/atomic_msvc.h   |  158 +
 .../internal/background_thread_externs.h      |   33 +
 .../internal/background_thread_inlines.h      |   57 +
 .../internal/background_thread_structs.h      |   53 +
 .../include/jemalloc/internal/base_externs.h  |   22 +
 .../include/jemalloc/internal/base_inlines.h  |   13 +
 .../include/jemalloc/internal/base_structs.h  |   59 +
 .../include/jemalloc/internal/base_types.h    |   33 +
 .../jemalloc/include/jemalloc/internal/bin.h  |  106 +
 .../include/jemalloc/internal/bin_stats.h     |   51 +
 .../include/jemalloc/internal/bit_util.h      |  165 +
 .../include/jemalloc/internal/bitmap.h        |  369 +
 .../include/jemalloc/internal/cache_bin.h     |  114 +
 .../jemalloc/include/jemalloc/internal/ckh.h  |  101 +
 .../jemalloc/include/jemalloc/internal/ctl.h  |  131 +
 .../jemalloc/include/jemalloc/internal/div.h  |   41 +
 .../include/jemalloc/internal/emitter.h       |  435 +
 .../include/jemalloc/internal/extent_dss.h    |   26 +
 .../jemalloc/internal/extent_externs.h        |   73 +
 .../jemalloc/internal/extent_inlines.h        |  433 +
 .../include/jemalloc/internal/extent_mmap.h   |   10 +
 .../jemalloc/internal/extent_structs.h        |  219 +
 .../include/jemalloc/internal/extent_types.h  |   17 +
 .../jemalloc/include/jemalloc/internal/hash.h |  318 +
 .../include/jemalloc/internal/hooks.h         |   19 +
 .../internal/jemalloc_internal_decls.h        |   91 +
 .../internal/jemalloc_internal_defs.h.in      |  366 +
 .../internal/jemalloc_internal_externs.h      |   53 +
 .../internal/jemalloc_internal_includes.h     |   94 +
 .../internal/jemalloc_internal_inlines_a.h    |  172 +
 .../internal/jemalloc_internal_inlines_b.h    |   86 +
 .../internal/jemalloc_internal_inlines_c.h    |  257 +
 .../internal/jemalloc_internal_macros.h       |   43 +
 .../internal/jemalloc_internal_types.h        |  185 +
 .../jemalloc/internal/jemalloc_preamble.h.in  |  194 +
 .../include/jemalloc/internal/large_externs.h |   26 +
 .../jemalloc/include/jemalloc/internal/log.h  |  115 +
 .../include/jemalloc/internal/malloc_io.h     |  102 +
 .../include/jemalloc/internal/mutex.h         |  248 +
 .../include/jemalloc/internal/mutex_pool.h    |   94 +
 .../include/jemalloc/internal/mutex_prof.h    |   99 +
 .../include/jemalloc/internal/nstime.h        |   34 +
 .../include/jemalloc/internal/pages.h         |   88 +
 .../jemalloc/include/jemalloc/internal/ph.h   |  391 +
 .../jemalloc/internal/private_namespace.sh    |    5 +
 .../jemalloc/internal/private_symbols.sh      |   51 +
 .../jemalloc/include/jemalloc/internal/prng.h |  185 +
 .../include/jemalloc/internal/prof_externs.h  |   92 +
 .../jemalloc/internal/prof_inlines_a.h        |   83 +
 .../jemalloc/internal/prof_inlines_b.h        |  206 +
 .../include/jemalloc/internal/prof_structs.h  |  201 +
 .../include/jemalloc/internal/prof_types.h    |   56 +
 .../jemalloc/internal/public_namespace.sh     |    6 +
 .../jemalloc/internal/public_unnamespace.sh   |    6 +
 .../jemalloc/include/jemalloc/internal/ql.h   |   88 +
 .../jemalloc/include/jemalloc/internal/qr.h   |   72 +
 .../jemalloc/include/jemalloc/internal/rb.h   | 1006 ++
 .../include/jemalloc/internal/rtree.h         |  492 +
 .../include/jemalloc/internal/rtree_tsd.h     |   50 +
 .../include/jemalloc/internal/size_classes.sh |  361 +
 .../include/jemalloc/internal/smoothstep.h    |  232 +
 .../include/jemalloc/internal/smoothstep.sh   |  101 +
 .../jemalloc/include/jemalloc/internal/spin.h |   40 +
 .../include/jemalloc/internal/stats.h         |   30 +
 .../jemalloc/include/jemalloc/internal/sz.h   |  317 +
 .../jemalloc/internal/tcache_externs.h        |   55 +
 .../jemalloc/internal/tcache_inlines.h        |  223 +
 .../jemalloc/internal/tcache_structs.h        |   61 +
 .../include/jemalloc/internal/tcache_types.h  |   56 +
 .../include/jemalloc/internal/ticker.h        |   78 +
 .../jemalloc/include/jemalloc/internal/tsd.h  |  326 +
 .../include/jemalloc/internal/tsd_generic.h   |  157 +
 .../internal/tsd_malloc_thread_cleanup.h      |   60 +
 .../include/jemalloc/internal/tsd_tls.h       |   59 +
 .../include/jemalloc/internal/tsd_types.h     |   10 +
 .../include/jemalloc/internal/tsd_win.h       |  139 +
 .../jemalloc/include/jemalloc/internal/util.h |   67 +
 .../include/jemalloc/internal/witness.h       |  346 +
 .../jemalloc/include/jemalloc/jemalloc.sh     |   27 +
 .../include/jemalloc/jemalloc_defs.h.in       |   45 +
 .../include/jemalloc/jemalloc_macros.h.in     |  126 +
 .../include/jemalloc/jemalloc_mangle.sh       |   45 +
 .../include/jemalloc/jemalloc_protos.h.in     |   66 +
 .../include/jemalloc/jemalloc_rename.sh       |   22 +
 .../include/jemalloc/jemalloc_typedefs.h.in   |   77 +
 .../include/msvc_compat/C99/stdbool.h         |   20 +
 .../jemalloc/include/msvc_compat/C99/stdint.h |  247 +
 .../jemalloc/include/msvc_compat/strings.h    |   58 +
 .../include/msvc_compat/windows_extra.h       |    6 +
 redis-stable/deps/jemalloc/jemalloc.pc.in     |   12 +
 .../deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4 |  562 +
 redis-stable/deps/jemalloc/msvc/ReadMe.txt    |   23 +
 .../deps/jemalloc/msvc/jemalloc_vc2015.sln    |   63 +
 .../deps/jemalloc/msvc/jemalloc_vc2017.sln    |   63 +
 .../projects/vc2015/jemalloc/jemalloc.vcxproj |  348 +
 .../vc2015/jemalloc/jemalloc.vcxproj.filters  |  101 +
 .../vc2015/test_threads/test_threads.vcxproj  |  327 +
 .../test_threads/test_threads.vcxproj.filters |   26 +
 .../projects/vc2017/jemalloc/jemalloc.vcxproj |  347 +
 .../vc2017/jemalloc/jemalloc.vcxproj.filters  |  101 +
 .../vc2017/test_threads/test_threads.vcxproj  |  326 +
 .../test_threads/test_threads.vcxproj.filters |   26 +
 .../msvc/test_threads/test_threads.cpp        |   88 +
 .../jemalloc/msvc/test_threads/test_threads.h |    3 +
 .../msvc/test_threads/test_threads_main.cpp   |   11 +
 redis-stable/deps/jemalloc/run_tests.sh       |    1 +
 .../deps/jemalloc/scripts/gen_run_tests.py    |  112 +
 .../deps/jemalloc/scripts/gen_travis.py       |  107 +
 redis-stable/deps/jemalloc/src/arena.c        | 2043 ++++
 .../deps/jemalloc/src/background_thread.c     |  915 ++
 redis-stable/deps/jemalloc/src/base.c         |  514 +
 redis-stable/deps/jemalloc/src/bin.c          |   50 +
 redis-stable/deps/jemalloc/src/bitmap.c       |  121 +
 redis-stable/deps/jemalloc/src/ckh.c          |  569 +
 redis-stable/deps/jemalloc/src/ctl.c          | 2883 +++++
 redis-stable/deps/jemalloc/src/div.c          |   55 +
 redis-stable/deps/jemalloc/src/extent.c       | 2177 ++++
 redis-stable/deps/jemalloc/src/extent_dss.c   |  270 +
 redis-stable/deps/jemalloc/src/extent_mmap.c  |   42 +
 redis-stable/deps/jemalloc/src/hash.c         |    3 +
 redis-stable/deps/jemalloc/src/hooks.c        |   12 +
 redis-stable/deps/jemalloc/src/jemalloc.c     | 3335 ++++++
 .../deps/jemalloc/src/jemalloc_cpp.cpp        |  141 +
 redis-stable/deps/jemalloc/src/large.c        |  371 +
 redis-stable/deps/jemalloc/src/log.c          |   78 +
 redis-stable/deps/jemalloc/src/malloc_io.c    |  676 ++
 redis-stable/deps/jemalloc/src/mutex.c        |  224 +
 redis-stable/deps/jemalloc/src/mutex_pool.c   |   18 +
 redis-stable/deps/jemalloc/src/nstime.c       |  170 +
 redis-stable/deps/jemalloc/src/pages.c        |  606 ++
 redis-stable/deps/jemalloc/src/prng.c         |    3 +
 redis-stable/deps/jemalloc/src/prof.c         | 2473 +++++
 redis-stable/deps/jemalloc/src/rtree.c        |  320 +
 redis-stable/deps/jemalloc/src/stats.c        | 1286 +++
 redis-stable/deps/jemalloc/src/sz.c           |  107 +
 redis-stable/deps/jemalloc/src/tcache.c       |  717 ++
 redis-stable/deps/jemalloc/src/ticker.c       |    3 +
 redis-stable/deps/jemalloc/src/tsd.c          |  351 +
 redis-stable/deps/jemalloc/src/witness.c      |  100 +
 redis-stable/deps/jemalloc/src/zone.c         |  469 +
 .../jemalloc/test/include/test/SFMT-alti.h    |  186 +
 .../jemalloc/test/include/test/SFMT-params.h  |  132 +
 .../test/include/test/SFMT-params11213.h      |   81 +
 .../test/include/test/SFMT-params1279.h       |   81 +
 .../test/include/test/SFMT-params132049.h     |   81 +
 .../test/include/test/SFMT-params19937.h      |   81 +
 .../test/include/test/SFMT-params216091.h     |   81 +
 .../test/include/test/SFMT-params2281.h       |   81 +
 .../test/include/test/SFMT-params4253.h       |   81 +
 .../test/include/test/SFMT-params44497.h      |   81 +
 .../test/include/test/SFMT-params607.h        |   81 +
 .../test/include/test/SFMT-params86243.h      |   81 +
 .../jemalloc/test/include/test/SFMT-sse2.h    |  157 +
 .../deps/jemalloc/test/include/test/SFMT.h    |  146 +
 .../deps/jemalloc/test/include/test/btalloc.h |   30 +
 .../jemalloc/test/include/test/extent_hooks.h |  289 +
 .../test/include/test/jemalloc_test.h.in      |  173 +
 .../test/include/test/jemalloc_test_defs.h.in |    9 +
 .../deps/jemalloc/test/include/test/math.h    |  306 +
 .../deps/jemalloc/test/include/test/mq.h      |  107 +
 .../deps/jemalloc/test/include/test/mtx.h     |   23 +
 .../deps/jemalloc/test/include/test/test.h    |  338 +
 .../deps/jemalloc/test/include/test/thd.h     |    9 +
 .../deps/jemalloc/test/include/test/timer.h   |   11 +
 .../jemalloc/test/integration/MALLOCX_ARENA.c |   66 +
 .../jemalloc/test/integration/aligned_alloc.c |  133 +
 .../jemalloc/test/integration/allocated.c     |  124 +
 .../deps/jemalloc/test/integration/extent.c   |  248 +
 .../deps/jemalloc/test/integration/extent.sh  |    5 +
 .../deps/jemalloc/test/integration/mallocx.c  |  228 +
 .../deps/jemalloc/test/integration/mallocx.sh |    5 +
 .../deps/jemalloc/test/integration/overflow.c |   46 +
 .../test/integration/posix_memalign.c         |  127 +
 .../deps/jemalloc/test/integration/rallocx.c  |  245 +
 .../deps/jemalloc/test/integration/sdallocx.c |   55 +
 .../jemalloc/test/integration/thread_arena.c  |   86 +
 .../test/integration/thread_tcache_enabled.c  |   87 +
 .../deps/jemalloc/test/integration/xallocx.c  |  384 +
 .../deps/jemalloc/test/integration/xallocx.sh |    5 +
 redis-stable/deps/jemalloc/test/src/SFMT.c    |  719 ++
 redis-stable/deps/jemalloc/test/src/btalloc.c |    6 +
 .../deps/jemalloc/test/src/btalloc_0.c        |    3 +
 .../deps/jemalloc/test/src/btalloc_1.c        |    3 +
 redis-stable/deps/jemalloc/test/src/math.c    |    2 +
 redis-stable/deps/jemalloc/test/src/mq.c      |   27 +
 redis-stable/deps/jemalloc/test/src/mtx.c     |   68 +
 redis-stable/deps/jemalloc/test/src/test.c    |  217 +
 redis-stable/deps/jemalloc/test/src/thd.c     |   34 +
 redis-stable/deps/jemalloc/test/src/timer.c   |   56 +
 .../deps/jemalloc/test/stress/microbench.c    |  165 +
 redis-stable/deps/jemalloc/test/test.sh.in    |   80 +
 redis-stable/deps/jemalloc/test/unit/SFMT.c   | 1599 +++
 redis-stable/deps/jemalloc/test/unit/a0.c     |   16 +
 .../deps/jemalloc/test/unit/arena_reset.c     |  344 +
 .../jemalloc/test/unit/arena_reset_prof.c     |    4 +
 .../jemalloc/test/unit/arena_reset_prof.sh    |    3 +
 redis-stable/deps/jemalloc/test/unit/atomic.c |  229 +
 .../jemalloc/test/unit/background_thread.c    |  119 +
 .../test/unit/background_thread_enable.c      |   83 +
 redis-stable/deps/jemalloc/test/unit/base.c   |  234 +
 .../deps/jemalloc/test/unit/bit_util.c        |   57 +
 redis-stable/deps/jemalloc/test/unit/bitmap.c |  431 +
 redis-stable/deps/jemalloc/test/unit/ckh.c    |  211 +
 redis-stable/deps/jemalloc/test/unit/decay.c  |  599 ++
 redis-stable/deps/jemalloc/test/unit/decay.sh |    3 +
 redis-stable/deps/jemalloc/test/unit/div.c    |   29 +
 .../deps/jemalloc/test/unit/emitter.c         |  413 +
 .../deps/jemalloc/test/unit/extent_quantize.c |  141 +
 redis-stable/deps/jemalloc/test/unit/fork.c   |  141 +
 redis-stable/deps/jemalloc/test/unit/hash.c   |  173 +
 redis-stable/deps/jemalloc/test/unit/hooks.c  |   38 +
 redis-stable/deps/jemalloc/test/unit/junk.c   |  141 +
 redis-stable/deps/jemalloc/test/unit/junk.sh  |    5 +
 .../deps/jemalloc/test/unit/junk_alloc.c      |    1 +
 .../deps/jemalloc/test/unit/junk_alloc.sh     |    5 +
 .../deps/jemalloc/test/unit/junk_free.c       |    1 +
 .../deps/jemalloc/test/unit/junk_free.sh      |    5 +
 redis-stable/deps/jemalloc/test/unit/log.c    |  193 +
 .../deps/jemalloc/test/unit/mallctl.c         |  805 ++
 .../deps/jemalloc/test/unit/malloc_io.c       |  258 +
 redis-stable/deps/jemalloc/test/unit/math.c   |  390 +
 redis-stable/deps/jemalloc/test/unit/mq.c     |   89 +
 redis-stable/deps/jemalloc/test/unit/mtx.c    |   57 +
 redis-stable/deps/jemalloc/test/unit/nstime.c |  249 +
 redis-stable/deps/jemalloc/test/unit/pack.c   |  166 +
 redis-stable/deps/jemalloc/test/unit/pack.sh  |    4 +
 redis-stable/deps/jemalloc/test/unit/pages.c  |   29 +
 redis-stable/deps/jemalloc/test/unit/ph.c     |  318 +
 redis-stable/deps/jemalloc/test/unit/prng.c   |  237 +
 .../deps/jemalloc/test/unit/prof_accum.c      |   81 +
 .../deps/jemalloc/test/unit/prof_accum.sh     |    5 +
 .../deps/jemalloc/test/unit/prof_active.c     |  117 +
 .../deps/jemalloc/test/unit/prof_active.sh    |    5 +
 .../deps/jemalloc/test/unit/prof_gdump.c      |   74 +
 .../deps/jemalloc/test/unit/prof_gdump.sh     |    6 +
 .../deps/jemalloc/test/unit/prof_idump.c      |   42 +
 .../deps/jemalloc/test/unit/prof_idump.sh     |    8 +
 .../deps/jemalloc/test/unit/prof_reset.c      |  286 +
 .../deps/jemalloc/test/unit/prof_reset.sh     |    5 +
 .../deps/jemalloc/test/unit/prof_tctx.c       |   46 +
 .../deps/jemalloc/test/unit/prof_tctx.sh      |    5 +
 .../jemalloc/test/unit/prof_thread_name.c     |  120 +
 .../jemalloc/test/unit/prof_thread_name.sh    |    5 +
 redis-stable/deps/jemalloc/test/unit/ql.c     |  204 +
 redis-stable/deps/jemalloc/test/unit/qr.c     |  243 +
 redis-stable/deps/jemalloc/test/unit/rb.c     |  355 +
 .../deps/jemalloc/test/unit/retained.c        |  181 +
 redis-stable/deps/jemalloc/test/unit/rtree.c  |  227 +
 .../deps/jemalloc/test/unit/size_classes.c    |  183 +
 redis-stable/deps/jemalloc/test/unit/slab.c   |   32 +
 .../deps/jemalloc/test/unit/smoothstep.c      |  102 +
 redis-stable/deps/jemalloc/test/unit/spin.c   |   18 +
 redis-stable/deps/jemalloc/test/unit/stats.c  |  368 +
 .../deps/jemalloc/test/unit/stats_print.c     |  999 ++
 redis-stable/deps/jemalloc/test/unit/ticker.c |   73 +
 redis-stable/deps/jemalloc/test/unit/tsd.c    |  139 +
 .../deps/jemalloc/test/unit/witness.c         |  280 +
 redis-stable/deps/jemalloc/test/unit/zero.c   |   59 +
 redis-stable/deps/jemalloc/test/unit/zero.sh  |    5 +
 redis-stable/deps/linenoise/.gitignore        |    3 +
 redis-stable/deps/linenoise/Makefile          |   21 +
 redis-stable/deps/linenoise/README.markdown   |  247 +
 redis-stable/deps/linenoise/example.c         |   79 +
 redis-stable/deps/linenoise/linenoise.c       | 1225 +++
 redis-stable/deps/linenoise/linenoise.h       |   75 +
 redis-stable/deps/lua/COPYRIGHT               |   34 +
 redis-stable/deps/lua/HISTORY                 |  183 +
 redis-stable/deps/lua/INSTALL                 |   99 +
 redis-stable/deps/lua/Makefile                |  128 +
 redis-stable/deps/lua/README                  |   37 +
 redis-stable/deps/lua/doc/contents.html       |  497 +
 redis-stable/deps/lua/doc/cover.png           |  Bin 0 -> 3305 bytes
 redis-stable/deps/lua/doc/logo.gif            |  Bin 0 -> 4232 bytes
 redis-stable/deps/lua/doc/lua.1               |  163 +
 redis-stable/deps/lua/doc/lua.css             |   83 +
 redis-stable/deps/lua/doc/lua.html            |  172 +
 redis-stable/deps/lua/doc/luac.1              |  136 +
 redis-stable/deps/lua/doc/luac.html           |  145 +
 redis-stable/deps/lua/doc/manual.css          |   24 +
 redis-stable/deps/lua/doc/manual.html         | 8804 +++++++++++++++
 redis-stable/deps/lua/doc/readme.html         |   40 +
 redis-stable/deps/lua/etc/Makefile            |   44 +
 redis-stable/deps/lua/etc/README              |   37 +
 redis-stable/deps/lua/etc/all.c               |   38 +
 redis-stable/deps/lua/etc/lua.hpp             |    9 +
 redis-stable/deps/lua/etc/lua.ico             |  Bin 0 -> 1078 bytes
 redis-stable/deps/lua/etc/lua.pc              |   31 +
 redis-stable/deps/lua/etc/luavs.bat           |   28 +
 redis-stable/deps/lua/etc/min.c               |   39 +
 redis-stable/deps/lua/etc/noparser.c          |   50 +
 redis-stable/deps/lua/etc/strict.lua          |   41 +
 redis-stable/deps/lua/src/Makefile            |  183 +
 redis-stable/deps/lua/src/fpconv.c            |  205 +
 redis-stable/deps/lua/src/fpconv.h            |   22 +
 redis-stable/deps/lua/src/lapi.c              | 1087 ++
 redis-stable/deps/lua/src/lapi.h              |   16 +
 redis-stable/deps/lua/src/lauxlib.c           |  652 ++
 redis-stable/deps/lua/src/lauxlib.h           |  174 +
 redis-stable/deps/lua/src/lbaselib.c          |  653 ++
 redis-stable/deps/lua/src/lcode.c             |  831 ++
 redis-stable/deps/lua/src/lcode.h             |   76 +
 redis-stable/deps/lua/src/ldblib.c            |  398 +
 redis-stable/deps/lua/src/ldebug.c            |  638 ++
 redis-stable/deps/lua/src/ldebug.h            |   33 +
 redis-stable/deps/lua/src/ldo.c               |  519 +
 redis-stable/deps/lua/src/ldo.h               |   57 +
 redis-stable/deps/lua/src/ldump.c             |  164 +
 redis-stable/deps/lua/src/lfunc.c             |  174 +
 redis-stable/deps/lua/src/lfunc.h             |   34 +
 redis-stable/deps/lua/src/lgc.c               |  710 ++
 redis-stable/deps/lua/src/lgc.h               |  110 +
 redis-stable/deps/lua/src/linit.c             |   38 +
 redis-stable/deps/lua/src/liolib.c            |  556 +
 redis-stable/deps/lua/src/llex.c              |  463 +
 redis-stable/deps/lua/src/llex.h              |   81 +
 redis-stable/deps/lua/src/llimits.h           |  128 +
 redis-stable/deps/lua/src/lmathlib.c          |  263 +
 redis-stable/deps/lua/src/lmem.c              |   86 +
 redis-stable/deps/lua/src/lmem.h              |   49 +
 redis-stable/deps/lua/src/loadlib.c           |  666 ++
 redis-stable/deps/lua/src/lobject.c           |  214 +
 redis-stable/deps/lua/src/lobject.h           |  381 +
 redis-stable/deps/lua/src/lopcodes.c          |  102 +
 redis-stable/deps/lua/src/lopcodes.h          |  268 +
 redis-stable/deps/lua/src/loslib.c            |  243 +
 redis-stable/deps/lua/src/lparser.c           | 1339 +++
 redis-stable/deps/lua/src/lparser.h           |   82 +
 redis-stable/deps/lua/src/lstate.c            |  214 +
 redis-stable/deps/lua/src/lstate.h            |  169 +
 redis-stable/deps/lua/src/lstring.c           |  111 +
 redis-stable/deps/lua/src/lstring.h           |   31 +
 redis-stable/deps/lua/src/lstrlib.c           |  871 ++
 redis-stable/deps/lua/src/ltable.c            |  588 +
 redis-stable/deps/lua/src/ltable.h            |   40 +
 redis-stable/deps/lua/src/ltablib.c           |  287 +
 redis-stable/deps/lua/src/ltm.c               |   75 +
 redis-stable/deps/lua/src/ltm.h               |   54 +
 redis-stable/deps/lua/src/lua.c               |  392 +
 redis-stable/deps/lua/src/lua.h               |  388 +
 redis-stable/deps/lua/src/lua_bit.c           |  189 +
 redis-stable/deps/lua/src/lua_cjson.c         | 1427 +++
 redis-stable/deps/lua/src/lua_cmsgpack.c      |  977 ++
 redis-stable/deps/lua/src/lua_struct.c        |  429 +
 redis-stable/deps/lua/src/luac.c              |  200 +
 redis-stable/deps/lua/src/luaconf.h           |  763 ++
 redis-stable/deps/lua/src/lualib.h            |   53 +
 redis-stable/deps/lua/src/lundump.c           |  227 +
 redis-stable/deps/lua/src/lundump.h           |   36 +
 redis-stable/deps/lua/src/lvm.c               |  767 ++
 redis-stable/deps/lua/src/lvm.h               |   36 +
 redis-stable/deps/lua/src/lzio.c              |   82 +
 redis-stable/deps/lua/src/lzio.h              |   67 +
 redis-stable/deps/lua/src/print.c             |  227 +
 redis-stable/deps/lua/src/strbuf.c            |  251 +
 redis-stable/deps/lua/src/strbuf.h            |  154 +
 redis-stable/deps/lua/test/README             |   26 +
 redis-stable/deps/lua/test/bisect.lua         |   27 +
 redis-stable/deps/lua/test/cf.lua             |   16 +
 redis-stable/deps/lua/test/echo.lua           |    5 +
 redis-stable/deps/lua/test/env.lua            |    7 +
 redis-stable/deps/lua/test/factorial.lua      |   32 +
 redis-stable/deps/lua/test/fib.lua            |   40 +
 redis-stable/deps/lua/test/fibfor.lua         |   13 +
 redis-stable/deps/lua/test/globals.lua        |   13 +
 redis-stable/deps/lua/test/hello.lua          |    3 +
 redis-stable/deps/lua/test/life.lua           |  111 +
 redis-stable/deps/lua/test/luac.lua           |    7 +
 redis-stable/deps/lua/test/printf.lua         |    7 +
 redis-stable/deps/lua/test/readonly.lua       |   12 +
 redis-stable/deps/lua/test/sieve.lua          |   29 +
 redis-stable/deps/lua/test/sort.lua           |   66 +
 redis-stable/deps/lua/test/table.lua          |   12 +
 redis-stable/deps/lua/test/trace-calls.lua    |   32 +
 redis-stable/deps/lua/test/trace-globals.lua  |   38 +
 redis-stable/deps/lua/test/xd.lua             |   14 +
 redis-stable/deps/update-jemalloc.sh          |    9 +
 redis-stable/redis.conf                       | 2051 ++++
 redis-stable/runtest                          |   14 +
 redis-stable/runtest-cluster                  |   14 +
 redis-stable/runtest-moduleapi                |   39 +
 redis-stable/runtest-sentinel                 |   14 +
 redis-stable/sentinel.conf                    |  341 +
 redis-stable/src/.gitignore                   |    5 +
 redis-stable/src/Makefile                     |  443 +
 redis-stable/src/acl.c                        | 2292 ++++
 redis-stable/src/adlist.c                     |  378 +
 redis-stable/src/adlist.h                     |   96 +
 redis-stable/src/ae.c                         |  503 +
 redis-stable/src/ae.h                         |  135 +
 redis-stable/src/ae_epoll.c                   |  136 +
 redis-stable/src/ae_evport.c                  |  323 +
 redis-stable/src/ae_kqueue.c                  |  187 +
 redis-stable/src/ae_select.c                  |  106 +
 redis-stable/src/anet.c                       |  595 ++
 redis-stable/src/anet.h                       |   76 +
 redis-stable/src/aof.c                        | 2010 ++++
 redis-stable/src/asciilogo.h                  |   47 +
 redis-stable/src/atomicvar.h                  |  158 +
 redis-stable/src/bio.c                        |  309 +
 redis-stable/src/bio.h                        |   51 +
 redis-stable/src/bitops.c                     | 1165 ++
 redis-stable/src/blocked.c                    |  768 ++
 redis-stable/src/childinfo.c                  |  173 +
 redis-stable/src/cli_common.c                 |  194 +
 redis-stable/src/cli_common.h                 |   50 +
 redis-stable/src/cluster.c                    | 6032 +++++++++++
 redis-stable/src/cluster.h                    |  296 +
 redis-stable/src/config.c                     | 2624 +++++
 redis-stable/src/config.h                     |  267 +
 redis-stable/src/connection.c                 |  433 +
 redis-stable/src/connection.h                 |  237 +
 redis-stable/src/connhelpers.h                |   88 +
 redis-stable/src/crc16.c                      |   88 +
 redis-stable/src/crc16_slottable.h            |  835 ++
 redis-stable/src/crc64.c                      |  161 +
 redis-stable/src/crc64.h                      |   13 +
 redis-stable/src/crcspeed.c                   |  282 +
 redis-stable/src/crcspeed.h                   |   60 +
 redis-stable/src/db.c                         | 2009 ++++
 redis-stable/src/debug.c                      | 1988 ++++
 redis-stable/src/debugmacro.h                 |   41 +
 redis-stable/src/defrag.c                     | 1215 +++
 redis-stable/src/dict.c                       | 1315 +++
 redis-stable/src/dict.h                       |  208 +
 redis-stable/src/endianconv.c                 |  129 +
 redis-stable/src/endianconv.h                 |   78 +
 redis-stable/src/evict.c                      |  710 ++
 redis-stable/src/expire.c                     |  612 ++
 redis-stable/src/fmacros.h                    |   66 +
 redis-stable/src/geo.c                        |  998 ++
 redis-stable/src/geo.h                        |   22 +
 redis-stable/src/geohash.c                    |  299 +
 redis-stable/src/geohash.h                    |  137 +
 redis-stable/src/geohash_helper.c             |  263 +
 redis-stable/src/geohash_helper.h             |   66 +
 redis-stable/src/gopher.c                     |   97 +
 redis-stable/src/help.h                       | 1438 +++
 redis-stable/src/hyperloglog.c                | 1595 +++
 redis-stable/src/intset.c                     |  547 +
 redis-stable/src/intset.h                     |   55 +
 redis-stable/src/latency.c                    |  658 ++
 redis-stable/src/latency.h                    |   94 +
 redis-stable/src/lazyfree.c                   |  231 +
 redis-stable/src/listpack.c                   |  965 ++
 redis-stable/src/listpack.h                   |   66 +
 redis-stable/src/listpack_malloc.h            |   46 +
 redis-stable/src/localtime.c                  |  123 +
 redis-stable/src/lolwut.c                     |  188 +
 redis-stable/src/lolwut.h                     |   55 +
 redis-stable/src/lolwut5.c                    |  177 +
 redis-stable/src/lolwut6.c                    |  201 +
 redis-stable/src/lzf.h                        |  100 +
 redis-stable/src/lzfP.h                       |  189 +
 redis-stable/src/lzf_c.c                      |  291 +
 redis-stable/src/lzf_d.c                      |  191 +
 redis-stable/src/memtest.c                    |  365 +
 redis-stable/src/mkreleasehdr.sh              |   14 +
 redis-stable/src/module.c                     | 9506 +++++++++++++++++
 redis-stable/src/modules/.gitignore           |    2 +
 redis-stable/src/modules/Makefile             |   62 +
 redis-stable/src/modules/gendoc.rb            |  174 +
 redis-stable/src/modules/helloacl.c           |  191 +
 redis-stable/src/modules/helloblock.c         |  219 +
 redis-stable/src/modules/hellocluster.c       |  118 +
 redis-stable/src/modules/hellodict.c          |  132 +
 redis-stable/src/modules/hellohook.c          |   93 +
 redis-stable/src/modules/hellotimer.c         |   76 +
 redis-stable/src/modules/hellotype.c          |  362 +
 redis-stable/src/modules/helloworld.c         |  621 ++
 redis-stable/src/monotonic.c                  |  170 +
 redis-stable/src/monotonic.h                  |   52 +
 redis-stable/src/mt19937-64.c                 |  187 +
 redis-stable/src/mt19937-64.h                 |   87 +
 redis-stable/src/multi.c                      |  439 +
 redis-stable/src/networking.c                 | 3772 +++++++
 redis-stable/src/notify.c                     |  142 +
 redis-stable/src/object.c                     | 1472 +++
 redis-stable/src/pqsort.c                     |  185 +
 redis-stable/src/pqsort.h                     |   40 +
 redis-stable/src/pubsub.c                     |  469 +
 redis-stable/src/quicklist.c                  | 2785 +++++
 redis-stable/src/quicklist.h                  |  209 +
 redis-stable/src/rand.c                       |   93 +
 redis-stable/src/rand.h                       |   38 +
 redis-stable/src/rax.c                        | 1948 ++++
 redis-stable/src/rax.h                        |  216 +
 redis-stable/src/rax_malloc.h                 |   44 +
 redis-stable/src/rdb.c                        | 3070 ++++++
 redis-stable/src/rdb.h                        |  170 +
 redis-stable/src/redis-benchmark.c            | 1982 ++++
 redis-stable/src/redis-check-aof.c            |  235 +
 redis-stable/src/redis-check-rdb.c            |  395 +
 redis-stable/src/redis-cli.c                  | 8472 +++++++++++++++
 redis-stable/src/redis-trib.rb                |  129 +
 redis-stable/src/redisassert.h                |   49 +
 redis-stable/src/redismodule.h                | 1137 ++
 redis-stable/src/release.c                    |   66 +
 redis-stable/src/replication.c                | 3790 +++++++
 redis-stable/src/rio.c                        |  448 +
 redis-stable/src/rio.h                        |  178 +
 redis-stable/src/scripting.c                  | 2835 +++++
 redis-stable/src/sds.c                        | 1462 +++
 redis-stable/src/sds.h                        |  284 +
 redis-stable/src/sdsalloc.h                   |   54 +
 redis-stable/src/sentinel.c                   | 5112 +++++++++
 redis-stable/src/server.c                     | 6406 +++++++++++
 redis-stable/src/server.h                     | 2759 +++++
 redis-stable/src/setcpuaffinity.c             |  155 +
 redis-stable/src/setproctitle.c               |  331 +
 redis-stable/src/sha1.c                       |  228 +
 redis-stable/src/sha1.h                       |   24 +
 redis-stable/src/sha256.c                     |  158 +
 redis-stable/src/sha256.h                     |   35 +
 redis-stable/src/siphash.c                    |  361 +
 redis-stable/src/slowlog.c                    |  196 +
 redis-stable/src/slowlog.h                    |   54 +
 redis-stable/src/solarisfixes.h               |   54 +
 redis-stable/src/sort.c                       |  597 ++
 redis-stable/src/sparkline.c                  |  176 +
 redis-stable/src/sparkline.h                  |   56 +
 redis-stable/src/stream.h                     |  132 +
 redis-stable/src/syncio.c                     |  145 +
 redis-stable/src/t_hash.c                     | 1209 +++
 redis-stable/src/t_list.c                     | 1032 ++
 redis-stable/src/t_set.c                      | 1196 +++
 redis-stable/src/t_stream.c                   | 3668 +++++++
 redis-stable/src/t_string.c                   |  956 ++
 redis-stable/src/t_zset.c                     | 4233 ++++++++
 redis-stable/src/testhelp.h                   |   57 +
 redis-stable/src/timeout.c                    |  190 +
 redis-stable/src/tls.c                        | 1021 ++
 redis-stable/src/tracking.c                   |  604 ++
 redis-stable/src/util.c                       |  959 ++
 redis-stable/src/util.h                       |   72 +
 redis-stable/src/valgrind.sup                 |   26 +
 redis-stable/src/version.h                    |    2 +
 redis-stable/src/ziplist.c                    | 2582 +++++
 redis-stable/src/ziplist.h                    |   74 +
 redis-stable/src/zipmap.c                     |  542 +
 redis-stable/src/zipmap.h                     |   54 +
 redis-stable/src/zmalloc.c                    |  699 ++
 redis-stable/src/zmalloc.h                    |  141 +
 .../tests/assets/corrupt_empty_keys.rdb       |  Bin 0 -> 261 bytes
 redis-stable/tests/assets/corrupt_ziplist.rdb |  Bin 0 -> 1415 bytes
 redis-stable/tests/assets/default.conf        |   27 +
 redis-stable/tests/assets/encodings.rdb       |  Bin 0 -> 667 bytes
 redis-stable/tests/assets/hash-zipmap.rdb     |  Bin 0 -> 35 bytes
 redis-stable/tests/assets/minimal.conf        |    5 +
 redis-stable/tests/assets/nodefaultuser.acl   |    2 +
 redis-stable/tests/assets/user.acl            |    3 +
 redis-stable/tests/cluster/cluster.tcl        |  177 +
 redis-stable/tests/cluster/run.tcl            |   29 +
 redis-stable/tests/cluster/tests/00-base.tcl  |   59 +
 .../tests/cluster/tests/01-faildet.tcl        |   38 +
 .../tests/cluster/tests/02-failover.tcl       |   65 +
 .../tests/cluster/tests/03-failover-loop.tcl  |  115 +
 .../tests/cluster/tests/04-resharding.tcl     |  194 +
 .../cluster/tests/05-slave-selection.tcl      |  171 +
 .../cluster/tests/06-slave-stop-cond.tcl      |   73 +
 .../cluster/tests/07-replica-migration.tcl    |  103 +
 .../tests/cluster/tests/08-update-msg.tcl     |   90 +
 .../tests/cluster/tests/09-pubsub.tcl         |   40 +
 .../cluster/tests/10-manual-failover.tcl      |  192 +
 .../cluster/tests/11-manual-takeover.tcl      |   59 +
 .../cluster/tests/12-replica-migration-2.tcl  |   74 +
 .../tests/12.1-replica-migration-3.tcl        |   71 +
 .../cluster/tests/13-no-failover-option.tcl   |   61 +
 .../cluster/tests/14-consistency-check.tcl    |  117 +
 .../tests/cluster/tests/15-cluster-slots.tcl  |   63 +
 .../tests/16-transactions-on-replica.tcl      |   71 +
 .../cluster/tests/17-diskless-load-swapdb.tcl |   86 +
 redis-stable/tests/cluster/tests/18-info.tcl  |   45 +
 .../cluster/tests/19-cluster-nodes-slots.tcl  |   71 +
 .../cluster/tests/20-half-migrated-slot.tcl   |   98 +
 .../cluster/tests/21-many-slot-migration.tcl  |   64 +
 .../tests/cluster/tests/helpers/onlydots.tcl  |   16 +
 .../cluster/tests/includes/init-tests.tcl     |   70 +
 .../tests/cluster/tests/includes/utils.tcl    |   25 +
 redis-stable/tests/cluster/tmp/.gitignore     |    2 +
 redis-stable/tests/helpers/bg_block_op.tcl    |   55 +
 .../tests/helpers/bg_complex_data.tcl         |   13 +
 .../tests/helpers/fake_redis_node.tcl         |   58 +
 redis-stable/tests/helpers/gen_write_load.tcl |   18 +
 redis-stable/tests/instances.tcl              |  673 ++
 redis-stable/tests/integration/aof-race.tcl   |   36 +
 redis-stable/tests/integration/aof.tcl        |  298 +
 redis-stable/tests/integration/block-repl.tcl |   51 +
 .../convert-zipmap-hash-on-load.tcl           |   35 +
 .../tests/integration/corrupt-dump-fuzzer.tcl |  208 +
 .../tests/integration/corrupt-dump.tcl        |  702 ++
 redis-stable/tests/integration/failover.tcl   |  294 +
 redis-stable/tests/integration/logging.tcl    |   51 +
 .../tests/integration/psync2-pingoff.tcl      |  244 +
 redis-stable/tests/integration/psync2-reg.tcl |   82 +
 redis-stable/tests/integration/psync2.tcl     |  373 +
 redis-stable/tests/integration/rdb.tcl        |  314 +
 .../tests/integration/redis-benchmark.tcl     |  168 +
 redis-stable/tests/integration/redis-cli.tcl  |  374 +
 .../tests/integration/replication-2.tcl       |   92 +
 .../tests/integration/replication-3.tcl       |  134 +
 .../tests/integration/replication-4.tcl       |  143 +
 .../tests/integration/replication-psync.tcl   |  141 +
 .../tests/integration/replication.tcl         |  928 ++
 redis-stable/tests/modules/Makefile           |   60 +
 redis-stable/tests/modules/auth.c             |   90 +
 redis-stable/tests/modules/basics.c           |  539 +
 redis-stable/tests/modules/blockedclient.c    |  209 +
 .../tests/modules/blockonbackground.c         |  291 +
 redis-stable/tests/modules/blockonkeys.c      |  505 +
 redis-stable/tests/modules/commandfilter.c    |  154 +
 redis-stable/tests/modules/datatype.c         |  217 +
 redis-stable/tests/modules/defragtest.c       |  234 +
 redis-stable/tests/modules/fork.c             |   94 +
 redis-stable/tests/modules/getkeys.c          |  122 +
 redis-stable/tests/modules/hash.c             |   90 +
 redis-stable/tests/modules/hooks.c            |  334 +
 redis-stable/tests/modules/infotest.c         |  119 +
 redis-stable/tests/modules/keyspace_events.c  |  293 +
 redis-stable/tests/modules/misc.c             |  327 +
 redis-stable/tests/modules/propagate.c        |  256 +
 redis-stable/tests/modules/scan.c             |  121 +
 redis-stable/tests/modules/stream.c           |  258 +
 redis-stable/tests/modules/test_lazyfree.c    |  196 +
 redis-stable/tests/modules/testrdb.c          |  301 +
 redis-stable/tests/modules/timer.c            |  103 +
 redis-stable/tests/modules/zset.c             |   30 +
 redis-stable/tests/sentinel/run.tcl           |   27 +
 redis-stable/tests/sentinel/tests/00-base.tcl |  126 +
 .../tests/sentinel/tests/01-conf-update.tcl   |   39 +
 .../tests/sentinel/tests/02-slaves-reconf.tcl |   84 +
 .../sentinel/tests/03-runtime-reconf.tcl      |    1 +
 .../sentinel/tests/04-slave-selection.tcl     |    5 +
 .../tests/sentinel/tests/05-manual.tcl        |   45 +
 .../tests/sentinel/tests/06-ckquorum.tcl      |   35 +
 .../sentinel/tests/07-down-conditions.tcl     |   80 +
 .../tests/sentinel/tests/08-hostname-conf.tcl |   67 +
 .../tests/sentinel/tests/09-acl-support.tcl   |   50 +
 .../sentinel/tests/10-replica-priority.tcl    |   73 +
 .../tests/helpers/check_leaked_fds.tcl        |   79 +
 .../sentinel/tests/includes/init-tests.tcl    |   80 +
 .../sentinel/tests/includes/sentinel.conf     |   11 +
 .../tests/includes/start-init-tests.tcl       |   18 +
 redis-stable/tests/sentinel/tmp/.gitignore    |    2 +
 redis-stable/tests/support/benchmark.tcl      |   19 +
 redis-stable/tests/support/cli.tcl            |   19 +
 redis-stable/tests/support/cluster.tcl        |  363 +
 redis-stable/tests/support/redis.tcl          |  368 +
 redis-stable/tests/support/server.tcl         |  623 ++
 redis-stable/tests/support/test.tcl           |  210 +
 redis-stable/tests/support/tmpfile.tcl        |   15 +
 redis-stable/tests/support/util.tcl           |  773 ++
 redis-stable/tests/test_helper.tcl            |  822 ++
 redis-stable/tests/unit/acl.tcl               |  631 ++
 redis-stable/tests/unit/aofrw.tcl             |  206 +
 redis-stable/tests/unit/auth.tcl              |   84 +
 redis-stable/tests/unit/bitfield.tcl          |  232 +
 redis-stable/tests/unit/bitops.tcl            |  379 +
 redis-stable/tests/unit/dump.tcl              |  379 +
 redis-stable/tests/unit/expire.tcl            |  414 +
 redis-stable/tests/unit/geo.tcl               |  693 ++
 redis-stable/tests/unit/hyperloglog.tcl       |  213 +
 redis-stable/tests/unit/info.tcl              |  175 +
 redis-stable/tests/unit/introspection-2.tcl   |   79 +
 redis-stable/tests/unit/introspection.tcl     |  251 +
 redis-stable/tests/unit/keyspace.tcl          |  482 +
 redis-stable/tests/unit/latency-monitor.tcl   |   79 +
 redis-stable/tests/unit/lazyfree.tcl          |   39 +
 redis-stable/tests/unit/limits.tcl            |   21 +
 redis-stable/tests/unit/maxmemory.tcl         |  326 +
 redis-stable/tests/unit/memefficiency.tcl     |  496 +
 redis-stable/tests/unit/moduleapi/auth.tcl    |   71 +
 redis-stable/tests/unit/moduleapi/basics.tcl  |   12 +
 .../tests/unit/moduleapi/blockedclient.tcl    |   93 +
 .../unit/moduleapi/blockonbackground.tcl      |  117 +
 .../tests/unit/moduleapi/blockonkeys.tcl      |  239 +
 .../tests/unit/moduleapi/commandfilter.tcl    |   84 +
 .../tests/unit/moduleapi/datatype.tcl         |   58 +
 redis-stable/tests/unit/moduleapi/defrag.tcl  |   46 +
 redis-stable/tests/unit/moduleapi/fork.tcl    |   31 +
 redis-stable/tests/unit/moduleapi/getkeys.tcl |   44 +
 redis-stable/tests/unit/moduleapi/hash.tcl    |   23 +
 redis-stable/tests/unit/moduleapi/hooks.tcl   |  163 +
 .../tests/unit/moduleapi/infotest.tcl         |   94 +
 .../tests/unit/moduleapi/keyspace_events.tcl  |   86 +
 redis-stable/tests/unit/moduleapi/misc.tcl    |  118 +
 .../tests/unit/moduleapi/propagate.tcl        |  268 +
 redis-stable/tests/unit/moduleapi/scan.tcl    |   52 +
 redis-stable/tests/unit/moduleapi/stream.tcl  |  155 +
 .../tests/unit/moduleapi/test_lazyfree.tcl    |   32 +
 redis-stable/tests/unit/moduleapi/testrdb.tcl |  132 +
 redis-stable/tests/unit/moduleapi/timer.tcl   |   57 +
 redis-stable/tests/unit/moduleapi/zset.tcl    |   16 +
 redis-stable/tests/unit/multi.tcl             |  646 ++
 redis-stable/tests/unit/networking.tcl        |   36 +
 redis-stable/tests/unit/obuf-limits.tcl       |  186 +
 redis-stable/tests/unit/oom-score-adj.tcl     |   77 +
 redis-stable/tests/unit/other.tcl             |  370 +
 redis-stable/tests/unit/pause.tcl             |  251 +
 redis-stable/tests/unit/pendingquerybuf.tcl   |   36 +
 redis-stable/tests/unit/printver.tcl          |    6 +
 redis-stable/tests/unit/protocol.tcl          |  209 +
 redis-stable/tests/unit/pubsub.tcl            |  360 +
 redis-stable/tests/unit/quit.tcl              |   40 +
 redis-stable/tests/unit/scan.tcl              |  330 +
 redis-stable/tests/unit/scripting.tcl         |  940 ++
 redis-stable/tests/unit/shutdown.tcl          |   57 +
 redis-stable/tests/unit/slowlog.tcl           |  177 +
 redis-stable/tests/unit/sort.tcl              |  318 +
 redis-stable/tests/unit/tls.tcl               |  158 +
 redis-stable/tests/unit/tracking.tcl          |  591 +
 redis-stable/tests/unit/type/hash.tcl         |  797 ++
 redis-stable/tests/unit/type/incr.tcl         |  164 +
 redis-stable/tests/unit/type/list-2.tcl       |   47 +
 redis-stable/tests/unit/type/list-3.tcl       |  122 +
 redis-stable/tests/unit/type/list-common.tcl  |    5 +
 redis-stable/tests/unit/type/list.tcl         | 1157 ++
 redis-stable/tests/unit/type/set.tcl          |  886 ++
 .../tests/unit/type/stream-cgroups.tcl        |  662 ++
 redis-stable/tests/unit/type/stream.tcl       |  710 ++
 redis-stable/tests/unit/type/string.tcl       |  577 +
 redis-stable/tests/unit/type/zset.tcl         | 1870 ++++
 redis-stable/tests/unit/violations.tcl        |  156 +
 redis-stable/tests/unit/wait.tcl              |   58 +
 redis-stable/utils/build-static-symbols.tcl   |   22 +
 redis-stable/utils/cluster_fail_time.tcl      |   50 +
 redis-stable/utils/corrupt_rdb.c              |   45 +
 redis-stable/utils/create-cluster/.gitignore  |    5 +
 redis-stable/utils/create-cluster/README      |   27 +
 .../utils/create-cluster/create-cluster       |  118 +
 redis-stable/utils/gen-test-certs.sh          |   58 +
 redis-stable/utils/generate-command-help.rb   |  123 +
 .../utils/graphs/commits-over-time/README.md  |   16 +
 .../graphs/commits-over-time/genhtml.tcl      |   96 +
 redis-stable/utils/hashtable/README           |   13 +
 redis-stable/utils/hashtable/rehashing.c      |  143 +
 redis-stable/utils/hyperloglog/.gitignore     |    1 +
 redis-stable/utils/hyperloglog/hll-err.rb     |   27 +
 .../utils/hyperloglog/hll-gnuplot-graph.rb    |   88 +
 redis-stable/utils/install_server.sh          |  291 +
 redis-stable/utils/lru/README                 |   19 +
 redis-stable/utils/lru/lfu-simulation.c       |  158 +
 redis-stable/utils/lru/test-lru.rb            |  223 +
 redis-stable/utils/redis-copy.rb              |   35 +
 redis-stable/utils/redis-sha1.rb              |   52 +
 redis-stable/utils/redis_init_script          |   50 +
 redis-stable/utils/redis_init_script.tpl      |   44 +
 .../utils/releasetools/01_create_tarball.sh   |   14 +
 .../utils/releasetools/02_upload_tarball.sh   |   23 +
 .../utils/releasetools/03_test_release.sh     |   28 +
 .../utils/releasetools/04_release_hash.sh     |   13 +
 redis-stable/utils/releasetools/changelog.tcl |   35 +
 redis-stable/utils/speed-regression.tcl       |  130 +
 redis-stable/utils/srandmember/README.md      |   14 +
 redis-stable/utils/srandmember/showdist.rb    |   33 +
 redis-stable/utils/srandmember/showfreq.rb    |   23 +
 .../systemd-redis_multiple_servers@.service   |   37 +
 .../utils/systemd-redis_server.service        |   43 +
 redis-stable/utils/tracking_collisions.c      |   76 +
 redis-stable/utils/whatisdoing.sh             |   24 +
 881 files changed, 289103 insertions(+)
 create mode 100644 redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
 create mode 100644 redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
 create mode 100644 redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
 create mode 100644 redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
 create mode 100644 redis-stable/.github/ISSUE_TEMPLATE/question.md
 create mode 100644 redis-stable/.github/workflows/ci.yml
 create mode 100644 redis-stable/.github/workflows/daily.yml
 create mode 100644 redis-stable/.gitignore
 create mode 100644 redis-stable/00-RELEASENOTES
 create mode 100644 redis-stable/BUGS
 create mode 100644 redis-stable/CONDUCT
 create mode 100644 redis-stable/CONTRIBUTING
 create mode 100644 redis-stable/COPYING
 create mode 100644 redis-stable/INSTALL
 create mode 100644 redis-stable/MANIFESTO
 create mode 100644 redis-stable/Makefile
 create mode 100644 redis-stable/README.md
 create mode 100644 redis-stable/TLS.md
 create mode 100644 redis-stable/deps/Makefile
 create mode 100644 redis-stable/deps/README.md
 create mode 100644 redis-stable/deps/hdr_histogram/COPYING.txt
 create mode 100644 redis-stable/deps/hdr_histogram/LICENSE.txt
 create mode 100644 redis-stable/deps/hdr_histogram/Makefile
 create mode 100644 redis-stable/deps/hdr_histogram/README.md
 create mode 100644 redis-stable/deps/hdr_histogram/hdr_atomic.h
 create mode 100644 redis-stable/deps/hdr_histogram/hdr_histogram.c
 create mode 100644 redis-stable/deps/hdr_histogram/hdr_histogram.h
 create mode 100644 redis-stable/deps/hiredis/.gitignore
 create mode 100644 redis-stable/deps/hiredis/.travis.yml
 create mode 100644 redis-stable/deps/hiredis/CHANGELOG.md
 create mode 100644 redis-stable/deps/hiredis/CMakeLists.txt
 create mode 100644 redis-stable/deps/hiredis/COPYING
 create mode 100644 redis-stable/deps/hiredis/Makefile
 create mode 100644 redis-stable/deps/hiredis/README.md
 create mode 100644 redis-stable/deps/hiredis/adapters/ae.h
 create mode 100644 redis-stable/deps/hiredis/adapters/glib.h
 create mode 100644 redis-stable/deps/hiredis/adapters/ivykis.h
 create mode 100644 redis-stable/deps/hiredis/adapters/libev.h
 create mode 100644 redis-stable/deps/hiredis/adapters/libevent.h
 create mode 100644 redis-stable/deps/hiredis/adapters/libuv.h
 create mode 100644 redis-stable/deps/hiredis/adapters/macosx.h
 create mode 100644 redis-stable/deps/hiredis/adapters/qt.h
 create mode 100644 redis-stable/deps/hiredis/alloc.c
 create mode 100644 redis-stable/deps/hiredis/alloc.h
 create mode 100644 redis-stable/deps/hiredis/appveyor.yml
 create mode 100644 redis-stable/deps/hiredis/async.c
 create mode 100644 redis-stable/deps/hiredis/async.h
 create mode 100644 redis-stable/deps/hiredis/async_private.h
 create mode 100644 redis-stable/deps/hiredis/dict.c
 create mode 100644 redis-stable/deps/hiredis/dict.h
 create mode 100644 redis-stable/deps/hiredis/examples/CMakeLists.txt
 create mode 100644 redis-stable/deps/hiredis/examples/example-ae.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-glib.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-ivykis.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-libev.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-libevent-ssl.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-libevent.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-libuv.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-macosx.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-push.c
 create mode 100644 redis-stable/deps/hiredis/examples/example-qt.cpp
 create mode 100644 redis-stable/deps/hiredis/examples/example-qt.h
 create mode 100644 redis-stable/deps/hiredis/examples/example-ssl.c
 create mode 100644 redis-stable/deps/hiredis/examples/example.c
 create mode 100644 redis-stable/deps/hiredis/fmacros.h
 create mode 100644 redis-stable/deps/hiredis/hiredis-config.cmake.in
 create mode 100644 redis-stable/deps/hiredis/hiredis.c
 create mode 100644 redis-stable/deps/hiredis/hiredis.h
 create mode 100644 redis-stable/deps/hiredis/hiredis.pc.in
 create mode 100644 redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
 create mode 100644 redis-stable/deps/hiredis/hiredis_ssl.h
 create mode 100644 redis-stable/deps/hiredis/hiredis_ssl.pc.in
 create mode 100644 redis-stable/deps/hiredis/net.c
 create mode 100644 redis-stable/deps/hiredis/net.h
 create mode 100644 redis-stable/deps/hiredis/read.c
 create mode 100644 redis-stable/deps/hiredis/read.h
 create mode 100644 redis-stable/deps/hiredis/sds.c
 create mode 100644 redis-stable/deps/hiredis/sds.h
 create mode 100644 redis-stable/deps/hiredis/sdsalloc.h
 create mode 100644 redis-stable/deps/hiredis/sdscompat.h
 create mode 100644 redis-stable/deps/hiredis/sockcompat.c
 create mode 100644 redis-stable/deps/hiredis/sockcompat.h
 create mode 100644 redis-stable/deps/hiredis/ssl.c
 create mode 100644 redis-stable/deps/hiredis/test.c
 create mode 100755 redis-stable/deps/hiredis/test.sh
 create mode 100644 redis-stable/deps/hiredis/win32.h
 create mode 100644 redis-stable/deps/jemalloc/.appveyor.yml
 create mode 100644 redis-stable/deps/jemalloc/.autom4te.cfg
 create mode 100644 redis-stable/deps/jemalloc/.gitattributes
 create mode 100644 redis-stable/deps/jemalloc/.gitignore
 create mode 100644 redis-stable/deps/jemalloc/.travis.yml
 create mode 100644 redis-stable/deps/jemalloc/COPYING
 create mode 100644 redis-stable/deps/jemalloc/ChangeLog
 create mode 100644 redis-stable/deps/jemalloc/INSTALL.md
 create mode 100644 redis-stable/deps/jemalloc/Makefile.in
 create mode 100644 redis-stable/deps/jemalloc/README
 create mode 100644 redis-stable/deps/jemalloc/TUNING.md
 create mode 100755 redis-stable/deps/jemalloc/autogen.sh
 create mode 100644 redis-stable/deps/jemalloc/bin/jemalloc-config.in
 create mode 100644 redis-stable/deps/jemalloc/bin/jemalloc.sh.in
 create mode 100644 redis-stable/deps/jemalloc/bin/jeprof.in
 create mode 100755 redis-stable/deps/jemalloc/build-aux/config.guess
 create mode 100755 redis-stable/deps/jemalloc/build-aux/config.sub
 create mode 100755 redis-stable/deps/jemalloc/build-aux/install-sh
 create mode 100644 redis-stable/deps/jemalloc/config.stamp.in
 create mode 100644 redis-stable/deps/jemalloc/configure.ac
 create mode 100644 redis-stable/deps/jemalloc/doc/html.xsl.in
 create mode 100644 redis-stable/deps/jemalloc/doc/jemalloc.xml.in
 create mode 100644 redis-stable/deps/jemalloc/doc/manpages.xsl.in
 create mode 100644 redis-stable/deps/jemalloc/doc/stylesheet.xsl
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
 create mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
 create mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
 create mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
 create mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
 create mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/strings.h
 create mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
 create mode 100644 redis-stable/deps/jemalloc/jemalloc.pc.in
 create mode 100644 redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
 create mode 100644 redis-stable/deps/jemalloc/msvc/ReadMe.txt
 create mode 100644 redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
 create mode 100644 redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
 create mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
 create mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
 create mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
 create mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
 create mode 100755 redis-stable/deps/jemalloc/run_tests.sh
 create mode 100755 redis-stable/deps/jemalloc/scripts/gen_run_tests.py
 create mode 100755 redis-stable/deps/jemalloc/scripts/gen_travis.py
 create mode 100644 redis-stable/deps/jemalloc/src/arena.c
 create mode 100644 redis-stable/deps/jemalloc/src/background_thread.c
 create mode 100644 redis-stable/deps/jemalloc/src/base.c
 create mode 100644 redis-stable/deps/jemalloc/src/bin.c
 create mode 100644 redis-stable/deps/jemalloc/src/bitmap.c
 create mode 100644 redis-stable/deps/jemalloc/src/ckh.c
 create mode 100644 redis-stable/deps/jemalloc/src/ctl.c
 create mode 100644 redis-stable/deps/jemalloc/src/div.c
 create mode 100644 redis-stable/deps/jemalloc/src/extent.c
 create mode 100644 redis-stable/deps/jemalloc/src/extent_dss.c
 create mode 100644 redis-stable/deps/jemalloc/src/extent_mmap.c
 create mode 100644 redis-stable/deps/jemalloc/src/hash.c
 create mode 100644 redis-stable/deps/jemalloc/src/hooks.c
 create mode 100644 redis-stable/deps/jemalloc/src/jemalloc.c
 create mode 100644 redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
 create mode 100644 redis-stable/deps/jemalloc/src/large.c
 create mode 100644 redis-stable/deps/jemalloc/src/log.c
 create mode 100644 redis-stable/deps/jemalloc/src/malloc_io.c
 create mode 100644 redis-stable/deps/jemalloc/src/mutex.c
 create mode 100644 redis-stable/deps/jemalloc/src/mutex_pool.c
 create mode 100644 redis-stable/deps/jemalloc/src/nstime.c
 create mode 100644 redis-stable/deps/jemalloc/src/pages.c
 create mode 100644 redis-stable/deps/jemalloc/src/prng.c
 create mode 100644 redis-stable/deps/jemalloc/src/prof.c
 create mode 100644 redis-stable/deps/jemalloc/src/rtree.c
 create mode 100644 redis-stable/deps/jemalloc/src/stats.c
 create mode 100644 redis-stable/deps/jemalloc/src/sz.c
 create mode 100644 redis-stable/deps/jemalloc/src/tcache.c
 create mode 100644 redis-stable/deps/jemalloc/src/ticker.c
 create mode 100644 redis-stable/deps/jemalloc/src/tsd.c
 create mode 100644 redis-stable/deps/jemalloc/src/witness.c
 create mode 100644 redis-stable/deps/jemalloc/src/zone.c
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/btalloc.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/math.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/mq.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/mtx.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/test.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/thd.h
 create mode 100644 redis-stable/deps/jemalloc/test/include/test/timer.h
 create mode 100644 redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/allocated.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/extent.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/extent.sh
 create mode 100644 redis-stable/deps/jemalloc/test/integration/mallocx.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/mallocx.sh
 create mode 100644 redis-stable/deps/jemalloc/test/integration/overflow.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/posix_memalign.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/rallocx.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/sdallocx.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/thread_arena.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/xallocx.c
 create mode 100644 redis-stable/deps/jemalloc/test/integration/xallocx.sh
 create mode 100644 redis-stable/deps/jemalloc/test/src/SFMT.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/btalloc.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/btalloc_0.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/btalloc_1.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/math.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/mq.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/mtx.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/test.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/thd.c
 create mode 100644 redis-stable/deps/jemalloc/test/src/timer.c
 create mode 100644 redis-stable/deps/jemalloc/test/stress/microbench.c
 create mode 100644 redis-stable/deps/jemalloc/test/test.sh.in
 create mode 100644 redis-stable/deps/jemalloc/test/unit/SFMT.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/a0.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/atomic.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/background_thread.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/base.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/bit_util.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/bitmap.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/ckh.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/decay.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/decay.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/div.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/emitter.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/extent_quantize.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/fork.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/hash.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/hooks.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk_alloc.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk_free.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/junk_free.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/log.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/mallctl.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/malloc_io.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/math.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/mq.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/mtx.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/nstime.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/pack.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/pack.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/pages.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/ph.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prng.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_accum.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_accum.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_active.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_active.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_gdump.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_idump.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_idump.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_reset.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_reset.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_tctx.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
 create mode 100644 redis-stable/deps/jemalloc/test/unit/ql.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/qr.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/rb.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/retained.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/rtree.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/size_classes.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/slab.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/smoothstep.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/spin.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/stats.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/stats_print.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/ticker.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/tsd.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/witness.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/zero.c
 create mode 100644 redis-stable/deps/jemalloc/test/unit/zero.sh
 create mode 100644 redis-stable/deps/linenoise/.gitignore
 create mode 100644 redis-stable/deps/linenoise/Makefile
 create mode 100644 redis-stable/deps/linenoise/README.markdown
 create mode 100644 redis-stable/deps/linenoise/example.c
 create mode 100644 redis-stable/deps/linenoise/linenoise.c
 create mode 100644 redis-stable/deps/linenoise/linenoise.h
 create mode 100644 redis-stable/deps/lua/COPYRIGHT
 create mode 100644 redis-stable/deps/lua/HISTORY
 create mode 100644 redis-stable/deps/lua/INSTALL
 create mode 100644 redis-stable/deps/lua/Makefile
 create mode 100644 redis-stable/deps/lua/README
 create mode 100644 redis-stable/deps/lua/doc/contents.html
 create mode 100644 redis-stable/deps/lua/doc/cover.png
 create mode 100644 redis-stable/deps/lua/doc/logo.gif
 create mode 100644 redis-stable/deps/lua/doc/lua.1
 create mode 100644 redis-stable/deps/lua/doc/lua.css
 create mode 100644 redis-stable/deps/lua/doc/lua.html
 create mode 100644 redis-stable/deps/lua/doc/luac.1
 create mode 100644 redis-stable/deps/lua/doc/luac.html
 create mode 100644 redis-stable/deps/lua/doc/manual.css
 create mode 100644 redis-stable/deps/lua/doc/manual.html
 create mode 100644 redis-stable/deps/lua/doc/readme.html
 create mode 100644 redis-stable/deps/lua/etc/Makefile
 create mode 100644 redis-stable/deps/lua/etc/README
 create mode 100644 redis-stable/deps/lua/etc/all.c
 create mode 100644 redis-stable/deps/lua/etc/lua.hpp
 create mode 100644 redis-stable/deps/lua/etc/lua.ico
 create mode 100644 redis-stable/deps/lua/etc/lua.pc
 create mode 100644 redis-stable/deps/lua/etc/luavs.bat
 create mode 100644 redis-stable/deps/lua/etc/min.c
 create mode 100644 redis-stable/deps/lua/etc/noparser.c
 create mode 100644 redis-stable/deps/lua/etc/strict.lua
 create mode 100644 redis-stable/deps/lua/src/Makefile
 create mode 100644 redis-stable/deps/lua/src/fpconv.c
 create mode 100644 redis-stable/deps/lua/src/fpconv.h
 create mode 100644 redis-stable/deps/lua/src/lapi.c
 create mode 100644 redis-stable/deps/lua/src/lapi.h
 create mode 100644 redis-stable/deps/lua/src/lauxlib.c
 create mode 100644 redis-stable/deps/lua/src/lauxlib.h
 create mode 100644 redis-stable/deps/lua/src/lbaselib.c
 create mode 100644 redis-stable/deps/lua/src/lcode.c
 create mode 100644 redis-stable/deps/lua/src/lcode.h
 create mode 100644 redis-stable/deps/lua/src/ldblib.c
 create mode 100644 redis-stable/deps/lua/src/ldebug.c
 create mode 100644 redis-stable/deps/lua/src/ldebug.h
 create mode 100644 redis-stable/deps/lua/src/ldo.c
 create mode 100644 redis-stable/deps/lua/src/ldo.h
 create mode 100644 redis-stable/deps/lua/src/ldump.c
 create mode 100644 redis-stable/deps/lua/src/lfunc.c
 create mode 100644 redis-stable/deps/lua/src/lfunc.h
 create mode 100644 redis-stable/deps/lua/src/lgc.c
 create mode 100644 redis-stable/deps/lua/src/lgc.h
 create mode 100644 redis-stable/deps/lua/src/linit.c
 create mode 100644 redis-stable/deps/lua/src/liolib.c
 create mode 100644 redis-stable/deps/lua/src/llex.c
 create mode 100644 redis-stable/deps/lua/src/llex.h
 create mode 100644 redis-stable/deps/lua/src/llimits.h
 create mode 100644 redis-stable/deps/lua/src/lmathlib.c
 create mode 100644 redis-stable/deps/lua/src/lmem.c
 create mode 100644 redis-stable/deps/lua/src/lmem.h
 create mode 100644 redis-stable/deps/lua/src/loadlib.c
 create mode 100644 redis-stable/deps/lua/src/lobject.c
 create mode 100644 redis-stable/deps/lua/src/lobject.h
 create mode 100644 redis-stable/deps/lua/src/lopcodes.c
 create mode 100644 redis-stable/deps/lua/src/lopcodes.h
 create mode 100644 redis-stable/deps/lua/src/loslib.c
 create mode 100644 redis-stable/deps/lua/src/lparser.c
 create mode 100644 redis-stable/deps/lua/src/lparser.h
 create mode 100644 redis-stable/deps/lua/src/lstate.c
 create mode 100644 redis-stable/deps/lua/src/lstate.h
 create mode 100644 redis-stable/deps/lua/src/lstring.c
 create mode 100644 redis-stable/deps/lua/src/lstring.h
 create mode 100644 redis-stable/deps/lua/src/lstrlib.c
 create mode 100644 redis-stable/deps/lua/src/ltable.c
 create mode 100644 redis-stable/deps/lua/src/ltable.h
 create mode 100644 redis-stable/deps/lua/src/ltablib.c
 create mode 100644 redis-stable/deps/lua/src/ltm.c
 create mode 100644 redis-stable/deps/lua/src/ltm.h
 create mode 100644 redis-stable/deps/lua/src/lua.c
 create mode 100644 redis-stable/deps/lua/src/lua.h
 create mode 100644 redis-stable/deps/lua/src/lua_bit.c
 create mode 100644 redis-stable/deps/lua/src/lua_cjson.c
 create mode 100644 redis-stable/deps/lua/src/lua_cmsgpack.c
 create mode 100644 redis-stable/deps/lua/src/lua_struct.c
 create mode 100644 redis-stable/deps/lua/src/luac.c
 create mode 100644 redis-stable/deps/lua/src/luaconf.h
 create mode 100644 redis-stable/deps/lua/src/lualib.h
 create mode 100644 redis-stable/deps/lua/src/lundump.c
 create mode 100644 redis-stable/deps/lua/src/lundump.h
 create mode 100644 redis-stable/deps/lua/src/lvm.c
 create mode 100644 redis-stable/deps/lua/src/lvm.h
 create mode 100644 redis-stable/deps/lua/src/lzio.c
 create mode 100644 redis-stable/deps/lua/src/lzio.h
 create mode 100644 redis-stable/deps/lua/src/print.c
 create mode 100644 redis-stable/deps/lua/src/strbuf.c
 create mode 100644 redis-stable/deps/lua/src/strbuf.h
 create mode 100644 redis-stable/deps/lua/test/README
 create mode 100644 redis-stable/deps/lua/test/bisect.lua
 create mode 100644 redis-stable/deps/lua/test/cf.lua
 create mode 100644 redis-stable/deps/lua/test/echo.lua
 create mode 100644 redis-stable/deps/lua/test/env.lua
 create mode 100644 redis-stable/deps/lua/test/factorial.lua
 create mode 100644 redis-stable/deps/lua/test/fib.lua
 create mode 100644 redis-stable/deps/lua/test/fibfor.lua
 create mode 100644 redis-stable/deps/lua/test/globals.lua
 create mode 100644 redis-stable/deps/lua/test/hello.lua
 create mode 100644 redis-stable/deps/lua/test/life.lua
 create mode 100644 redis-stable/deps/lua/test/luac.lua
 create mode 100644 redis-stable/deps/lua/test/printf.lua
 create mode 100644 redis-stable/deps/lua/test/readonly.lua
 create mode 100644 redis-stable/deps/lua/test/sieve.lua
 create mode 100644 redis-stable/deps/lua/test/sort.lua
 create mode 100644 redis-stable/deps/lua/test/table.lua
 create mode 100644 redis-stable/deps/lua/test/trace-calls.lua
 create mode 100644 redis-stable/deps/lua/test/trace-globals.lua
 create mode 100644 redis-stable/deps/lua/test/xd.lua
 create mode 100755 redis-stable/deps/update-jemalloc.sh
 create mode 100644 redis-stable/redis.conf
 create mode 100755 redis-stable/runtest
 create mode 100755 redis-stable/runtest-cluster
 create mode 100755 redis-stable/runtest-moduleapi
 create mode 100755 redis-stable/runtest-sentinel
 create mode 100644 redis-stable/sentinel.conf
 create mode 100644 redis-stable/src/.gitignore
 create mode 100644 redis-stable/src/Makefile
 create mode 100644 redis-stable/src/acl.c
 create mode 100644 redis-stable/src/adlist.c
 create mode 100644 redis-stable/src/adlist.h
 create mode 100644 redis-stable/src/ae.c
 create mode 100644 redis-stable/src/ae.h
 create mode 100644 redis-stable/src/ae_epoll.c
 create mode 100644 redis-stable/src/ae_evport.c
 create mode 100644 redis-stable/src/ae_kqueue.c
 create mode 100644 redis-stable/src/ae_select.c
 create mode 100644 redis-stable/src/anet.c
 create mode 100644 redis-stable/src/anet.h
 create mode 100644 redis-stable/src/aof.c
 create mode 100644 redis-stable/src/asciilogo.h
 create mode 100644 redis-stable/src/atomicvar.h
 create mode 100644 redis-stable/src/bio.c
 create mode 100644 redis-stable/src/bio.h
 create mode 100644 redis-stable/src/bitops.c
 create mode 100644 redis-stable/src/blocked.c
 create mode 100644 redis-stable/src/childinfo.c
 create mode 100644 redis-stable/src/cli_common.c
 create mode 100644 redis-stable/src/cli_common.h
 create mode 100644 redis-stable/src/cluster.c
 create mode 100644 redis-stable/src/cluster.h
 create mode 100644 redis-stable/src/config.c
 create mode 100644 redis-stable/src/config.h
 create mode 100644 redis-stable/src/connection.c
 create mode 100644 redis-stable/src/connection.h
 create mode 100644 redis-stable/src/connhelpers.h
 create mode 100644 redis-stable/src/crc16.c
 create mode 100644 redis-stable/src/crc16_slottable.h
 create mode 100644 redis-stable/src/crc64.c
 create mode 100644 redis-stable/src/crc64.h
 create mode 100644 redis-stable/src/crcspeed.c
 create mode 100644 redis-stable/src/crcspeed.h
 create mode 100644 redis-stable/src/db.c
 create mode 100644 redis-stable/src/debug.c
 create mode 100644 redis-stable/src/debugmacro.h
 create mode 100644 redis-stable/src/defrag.c
 create mode 100644 redis-stable/src/dict.c
 create mode 100644 redis-stable/src/dict.h
 create mode 100644 redis-stable/src/endianconv.c
 create mode 100644 redis-stable/src/endianconv.h
 create mode 100644 redis-stable/src/evict.c
 create mode 100644 redis-stable/src/expire.c
 create mode 100644 redis-stable/src/fmacros.h
 create mode 100644 redis-stable/src/geo.c
 create mode 100644 redis-stable/src/geo.h
 create mode 100644 redis-stable/src/geohash.c
 create mode 100644 redis-stable/src/geohash.h
 create mode 100644 redis-stable/src/geohash_helper.c
 create mode 100644 redis-stable/src/geohash_helper.h
 create mode 100644 redis-stable/src/gopher.c
 create mode 100644 redis-stable/src/help.h
 create mode 100644 redis-stable/src/hyperloglog.c
 create mode 100644 redis-stable/src/intset.c
 create mode 100644 redis-stable/src/intset.h
 create mode 100644 redis-stable/src/latency.c
 create mode 100644 redis-stable/src/latency.h
 create mode 100644 redis-stable/src/lazyfree.c
 create mode 100644 redis-stable/src/listpack.c
 create mode 100644 redis-stable/src/listpack.h
 create mode 100644 redis-stable/src/listpack_malloc.h
 create mode 100644 redis-stable/src/localtime.c
 create mode 100644 redis-stable/src/lolwut.c
 create mode 100644 redis-stable/src/lolwut.h
 create mode 100644 redis-stable/src/lolwut5.c
 create mode 100644 redis-stable/src/lolwut6.c
 create mode 100644 redis-stable/src/lzf.h
 create mode 100644 redis-stable/src/lzfP.h
 create mode 100644 redis-stable/src/lzf_c.c
 create mode 100644 redis-stable/src/lzf_d.c
 create mode 100644 redis-stable/src/memtest.c
 create mode 100755 redis-stable/src/mkreleasehdr.sh
 create mode 100644 redis-stable/src/module.c
 create mode 100644 redis-stable/src/modules/.gitignore
 create mode 100644 redis-stable/src/modules/Makefile
 create mode 100644 redis-stable/src/modules/gendoc.rb
 create mode 100644 redis-stable/src/modules/helloacl.c
 create mode 100644 redis-stable/src/modules/helloblock.c
 create mode 100644 redis-stable/src/modules/hellocluster.c
 create mode 100644 redis-stable/src/modules/hellodict.c
 create mode 100644 redis-stable/src/modules/hellohook.c
 create mode 100644 redis-stable/src/modules/hellotimer.c
 create mode 100644 redis-stable/src/modules/hellotype.c
 create mode 100644 redis-stable/src/modules/helloworld.c
 create mode 100644 redis-stable/src/monotonic.c
 create mode 100644 redis-stable/src/monotonic.h
 create mode 100644 redis-stable/src/mt19937-64.c
 create mode 100644 redis-stable/src/mt19937-64.h
 create mode 100644 redis-stable/src/multi.c
 create mode 100644 redis-stable/src/networking.c
 create mode 100644 redis-stable/src/notify.c
 create mode 100644 redis-stable/src/object.c
 create mode 100644 redis-stable/src/pqsort.c
 create mode 100644 redis-stable/src/pqsort.h
 create mode 100644 redis-stable/src/pubsub.c
 create mode 100644 redis-stable/src/quicklist.c
 create mode 100644 redis-stable/src/quicklist.h
 create mode 100644 redis-stable/src/rand.c
 create mode 100644 redis-stable/src/rand.h
 create mode 100644 redis-stable/src/rax.c
 create mode 100644 redis-stable/src/rax.h
 create mode 100644 redis-stable/src/rax_malloc.h
 create mode 100644 redis-stable/src/rdb.c
 create mode 100644 redis-stable/src/rdb.h
 create mode 100644 redis-stable/src/redis-benchmark.c
 create mode 100644 redis-stable/src/redis-check-aof.c
 create mode 100644 redis-stable/src/redis-check-rdb.c
 create mode 100644 redis-stable/src/redis-cli.c
 create mode 100755 redis-stable/src/redis-trib.rb
 create mode 100644 redis-stable/src/redisassert.h
 create mode 100644 redis-stable/src/redismodule.h
 create mode 100644 redis-stable/src/release.c
 create mode 100644 redis-stable/src/replication.c
 create mode 100644 redis-stable/src/rio.c
 create mode 100644 redis-stable/src/rio.h
 create mode 100644 redis-stable/src/scripting.c
 create mode 100644 redis-stable/src/sds.c
 create mode 100644 redis-stable/src/sds.h
 create mode 100644 redis-stable/src/sdsalloc.h
 create mode 100644 redis-stable/src/sentinel.c
 create mode 100644 redis-stable/src/server.c
 create mode 100644 redis-stable/src/server.h
 create mode 100644 redis-stable/src/setcpuaffinity.c
 create mode 100644 redis-stable/src/setproctitle.c
 create mode 100644 redis-stable/src/sha1.c
 create mode 100644 redis-stable/src/sha1.h
 create mode 100644 redis-stable/src/sha256.c
 create mode 100644 redis-stable/src/sha256.h
 create mode 100644 redis-stable/src/siphash.c
 create mode 100644 redis-stable/src/slowlog.c
 create mode 100644 redis-stable/src/slowlog.h
 create mode 100644 redis-stable/src/solarisfixes.h
 create mode 100644 redis-stable/src/sort.c
 create mode 100644 redis-stable/src/sparkline.c
 create mode 100644 redis-stable/src/sparkline.h
 create mode 100644 redis-stable/src/stream.h
 create mode 100644 redis-stable/src/syncio.c
 create mode 100644 redis-stable/src/t_hash.c
 create mode 100644 redis-stable/src/t_list.c
 create mode 100644 redis-stable/src/t_set.c
 create mode 100644 redis-stable/src/t_stream.c
 create mode 100644 redis-stable/src/t_string.c
 create mode 100644 redis-stable/src/t_zset.c
 create mode 100644 redis-stable/src/testhelp.h
 create mode 100644 redis-stable/src/timeout.c
 create mode 100644 redis-stable/src/tls.c
 create mode 100644 redis-stable/src/tracking.c
 create mode 100644 redis-stable/src/util.c
 create mode 100644 redis-stable/src/util.h
 create mode 100644 redis-stable/src/valgrind.sup
 create mode 100644 redis-stable/src/version.h
 create mode 100644 redis-stable/src/ziplist.c
 create mode 100644 redis-stable/src/ziplist.h
 create mode 100644 redis-stable/src/zipmap.c
 create mode 100644 redis-stable/src/zipmap.h
 create mode 100644 redis-stable/src/zmalloc.c
 create mode 100644 redis-stable/src/zmalloc.h
 create mode 100644 redis-stable/tests/assets/corrupt_empty_keys.rdb
 create mode 100644 redis-stable/tests/assets/corrupt_ziplist.rdb
 create mode 100644 redis-stable/tests/assets/default.conf
 create mode 100644 redis-stable/tests/assets/encodings.rdb
 create mode 100644 redis-stable/tests/assets/hash-zipmap.rdb
 create mode 100644 redis-stable/tests/assets/minimal.conf
 create mode 100644 redis-stable/tests/assets/nodefaultuser.acl
 create mode 100644 redis-stable/tests/assets/user.acl
 create mode 100644 redis-stable/tests/cluster/cluster.tcl
 create mode 100644 redis-stable/tests/cluster/run.tcl
 create mode 100644 redis-stable/tests/cluster/tests/00-base.tcl
 create mode 100644 redis-stable/tests/cluster/tests/01-faildet.tcl
 create mode 100644 redis-stable/tests/cluster/tests/02-failover.tcl
 create mode 100644 redis-stable/tests/cluster/tests/03-failover-loop.tcl
 create mode 100644 redis-stable/tests/cluster/tests/04-resharding.tcl
 create mode 100644 redis-stable/tests/cluster/tests/05-slave-selection.tcl
 create mode 100644 redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
 create mode 100644 redis-stable/tests/cluster/tests/07-replica-migration.tcl
 create mode 100644 redis-stable/tests/cluster/tests/08-update-msg.tcl
 create mode 100644 redis-stable/tests/cluster/tests/09-pubsub.tcl
 create mode 100644 redis-stable/tests/cluster/tests/10-manual-failover.tcl
 create mode 100644 redis-stable/tests/cluster/tests/11-manual-takeover.tcl
 create mode 100644 redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
 create mode 100644 redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
 create mode 100644 redis-stable/tests/cluster/tests/13-no-failover-option.tcl
 create mode 100644 redis-stable/tests/cluster/tests/14-consistency-check.tcl
 create mode 100644 redis-stable/tests/cluster/tests/15-cluster-slots.tcl
 create mode 100644 redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
 create mode 100644 redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
 create mode 100644 redis-stable/tests/cluster/tests/18-info.tcl
 create mode 100644 redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
 create mode 100644 redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
 create mode 100644 redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
 create mode 100644 redis-stable/tests/cluster/tests/helpers/onlydots.tcl
 create mode 100644 redis-stable/tests/cluster/tests/includes/init-tests.tcl
 create mode 100644 redis-stable/tests/cluster/tests/includes/utils.tcl
 create mode 100644 redis-stable/tests/cluster/tmp/.gitignore
 create mode 100644 redis-stable/tests/helpers/bg_block_op.tcl
 create mode 100644 redis-stable/tests/helpers/bg_complex_data.tcl
 create mode 100644 redis-stable/tests/helpers/fake_redis_node.tcl
 create mode 100644 redis-stable/tests/helpers/gen_write_load.tcl
 create mode 100644 redis-stable/tests/instances.tcl
 create mode 100644 redis-stable/tests/integration/aof-race.tcl
 create mode 100644 redis-stable/tests/integration/aof.tcl
 create mode 100644 redis-stable/tests/integration/block-repl.tcl
 create mode 100644 redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
 create mode 100644 redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
 create mode 100644 redis-stable/tests/integration/corrupt-dump.tcl
 create mode 100644 redis-stable/tests/integration/failover.tcl
 create mode 100644 redis-stable/tests/integration/logging.tcl
 create mode 100644 redis-stable/tests/integration/psync2-pingoff.tcl
 create mode 100644 redis-stable/tests/integration/psync2-reg.tcl
 create mode 100644 redis-stable/tests/integration/psync2.tcl
 create mode 100644 redis-stable/tests/integration/rdb.tcl
 create mode 100644 redis-stable/tests/integration/redis-benchmark.tcl
 create mode 100644 redis-stable/tests/integration/redis-cli.tcl
 create mode 100644 redis-stable/tests/integration/replication-2.tcl
 create mode 100644 redis-stable/tests/integration/replication-3.tcl
 create mode 100644 redis-stable/tests/integration/replication-4.tcl
 create mode 100644 redis-stable/tests/integration/replication-psync.tcl
 create mode 100644 redis-stable/tests/integration/replication.tcl
 create mode 100644 redis-stable/tests/modules/Makefile
 create mode 100644 redis-stable/tests/modules/auth.c
 create mode 100644 redis-stable/tests/modules/basics.c
 create mode 100644 redis-stable/tests/modules/blockedclient.c
 create mode 100644 redis-stable/tests/modules/blockonbackground.c
 create mode 100644 redis-stable/tests/modules/blockonkeys.c
 create mode 100644 redis-stable/tests/modules/commandfilter.c
 create mode 100644 redis-stable/tests/modules/datatype.c
 create mode 100644 redis-stable/tests/modules/defragtest.c
 create mode 100644 redis-stable/tests/modules/fork.c
 create mode 100644 redis-stable/tests/modules/getkeys.c
 create mode 100644 redis-stable/tests/modules/hash.c
 create mode 100644 redis-stable/tests/modules/hooks.c
 create mode 100644 redis-stable/tests/modules/infotest.c
 create mode 100644 redis-stable/tests/modules/keyspace_events.c
 create mode 100644 redis-stable/tests/modules/misc.c
 create mode 100644 redis-stable/tests/modules/propagate.c
 create mode 100644 redis-stable/tests/modules/scan.c
 create mode 100644 redis-stable/tests/modules/stream.c
 create mode 100644 redis-stable/tests/modules/test_lazyfree.c
 create mode 100644 redis-stable/tests/modules/testrdb.c
 create mode 100644 redis-stable/tests/modules/timer.c
 create mode 100644 redis-stable/tests/modules/zset.c
 create mode 100644 redis-stable/tests/sentinel/run.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/00-base.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/01-conf-update.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/04-slave-selection.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/05-manual.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/06-ckquorum.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/07-down-conditions.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/09-acl-support.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/10-replica-priority.tcl
 create mode 100755 redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/includes/init-tests.tcl
 create mode 100644 redis-stable/tests/sentinel/tests/includes/sentinel.conf
 create mode 100644 redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
 create mode 100644 redis-stable/tests/sentinel/tmp/.gitignore
 create mode 100644 redis-stable/tests/support/benchmark.tcl
 create mode 100644 redis-stable/tests/support/cli.tcl
 create mode 100644 redis-stable/tests/support/cluster.tcl
 create mode 100644 redis-stable/tests/support/redis.tcl
 create mode 100644 redis-stable/tests/support/server.tcl
 create mode 100644 redis-stable/tests/support/test.tcl
 create mode 100644 redis-stable/tests/support/tmpfile.tcl
 create mode 100644 redis-stable/tests/support/util.tcl
 create mode 100644 redis-stable/tests/test_helper.tcl
 create mode 100644 redis-stable/tests/unit/acl.tcl
 create mode 100644 redis-stable/tests/unit/aofrw.tcl
 create mode 100644 redis-stable/tests/unit/auth.tcl
 create mode 100644 redis-stable/tests/unit/bitfield.tcl
 create mode 100644 redis-stable/tests/unit/bitops.tcl
 create mode 100644 redis-stable/tests/unit/dump.tcl
 create mode 100644 redis-stable/tests/unit/expire.tcl
 create mode 100644 redis-stable/tests/unit/geo.tcl
 create mode 100644 redis-stable/tests/unit/hyperloglog.tcl
 create mode 100644 redis-stable/tests/unit/info.tcl
 create mode 100644 redis-stable/tests/unit/introspection-2.tcl
 create mode 100644 redis-stable/tests/unit/introspection.tcl
 create mode 100644 redis-stable/tests/unit/keyspace.tcl
 create mode 100644 redis-stable/tests/unit/latency-monitor.tcl
 create mode 100644 redis-stable/tests/unit/lazyfree.tcl
 create mode 100644 redis-stable/tests/unit/limits.tcl
 create mode 100644 redis-stable/tests/unit/maxmemory.tcl
 create mode 100644 redis-stable/tests/unit/memefficiency.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/auth.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/basics.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/blockedclient.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/blockonbackground.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/blockonkeys.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/commandfilter.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/datatype.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/defrag.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/fork.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/getkeys.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/hash.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/hooks.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/infotest.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/keyspace_events.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/misc.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/propagate.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/scan.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/stream.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/testrdb.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/timer.tcl
 create mode 100644 redis-stable/tests/unit/moduleapi/zset.tcl
 create mode 100644 redis-stable/tests/unit/multi.tcl
 create mode 100644 redis-stable/tests/unit/networking.tcl
 create mode 100644 redis-stable/tests/unit/obuf-limits.tcl
 create mode 100644 redis-stable/tests/unit/oom-score-adj.tcl
 create mode 100644 redis-stable/tests/unit/other.tcl
 create mode 100644 redis-stable/tests/unit/pause.tcl
 create mode 100644 redis-stable/tests/unit/pendingquerybuf.tcl
 create mode 100644 redis-stable/tests/unit/printver.tcl
 create mode 100644 redis-stable/tests/unit/protocol.tcl
 create mode 100644 redis-stable/tests/unit/pubsub.tcl
 create mode 100644 redis-stable/tests/unit/quit.tcl
 create mode 100644 redis-stable/tests/unit/scan.tcl
 create mode 100644 redis-stable/tests/unit/scripting.tcl
 create mode 100644 redis-stable/tests/unit/shutdown.tcl
 create mode 100644 redis-stable/tests/unit/slowlog.tcl
 create mode 100644 redis-stable/tests/unit/sort.tcl
 create mode 100644 redis-stable/tests/unit/tls.tcl
 create mode 100644 redis-stable/tests/unit/tracking.tcl
 create mode 100644 redis-stable/tests/unit/type/hash.tcl
 create mode 100644 redis-stable/tests/unit/type/incr.tcl
 create mode 100644 redis-stable/tests/unit/type/list-2.tcl
 create mode 100644 redis-stable/tests/unit/type/list-3.tcl
 create mode 100644 redis-stable/tests/unit/type/list-common.tcl
 create mode 100644 redis-stable/tests/unit/type/list.tcl
 create mode 100644 redis-stable/tests/unit/type/set.tcl
 create mode 100644 redis-stable/tests/unit/type/stream-cgroups.tcl
 create mode 100644 redis-stable/tests/unit/type/stream.tcl
 create mode 100644 redis-stable/tests/unit/type/string.tcl
 create mode 100644 redis-stable/tests/unit/type/zset.tcl
 create mode 100644 redis-stable/tests/unit/violations.tcl
 create mode 100644 redis-stable/tests/unit/wait.tcl
 create mode 100644 redis-stable/utils/build-static-symbols.tcl
 create mode 100644 redis-stable/utils/cluster_fail_time.tcl
 create mode 100644 redis-stable/utils/corrupt_rdb.c
 create mode 100644 redis-stable/utils/create-cluster/.gitignore
 create mode 100644 redis-stable/utils/create-cluster/README
 create mode 100755 redis-stable/utils/create-cluster/create-cluster
 create mode 100755 redis-stable/utils/gen-test-certs.sh
 create mode 100755 redis-stable/utils/generate-command-help.rb
 create mode 100644 redis-stable/utils/graphs/commits-over-time/README.md
 create mode 100755 redis-stable/utils/graphs/commits-over-time/genhtml.tcl
 create mode 100644 redis-stable/utils/hashtable/README
 create mode 100644 redis-stable/utils/hashtable/rehashing.c
 create mode 100644 redis-stable/utils/hyperloglog/.gitignore
 create mode 100644 redis-stable/utils/hyperloglog/hll-err.rb
 create mode 100644 redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
 create mode 100755 redis-stable/utils/install_server.sh
 create mode 100644 redis-stable/utils/lru/README
 create mode 100644 redis-stable/utils/lru/lfu-simulation.c
 create mode 100644 redis-stable/utils/lru/test-lru.rb
 create mode 100644 redis-stable/utils/redis-copy.rb
 create mode 100644 redis-stable/utils/redis-sha1.rb
 create mode 100755 redis-stable/utils/redis_init_script
 create mode 100755 redis-stable/utils/redis_init_script.tpl
 create mode 100755 redis-stable/utils/releasetools/01_create_tarball.sh
 create mode 100755 redis-stable/utils/releasetools/02_upload_tarball.sh
 create mode 100755 redis-stable/utils/releasetools/03_test_release.sh
 create mode 100755 redis-stable/utils/releasetools/04_release_hash.sh
 create mode 100755 redis-stable/utils/releasetools/changelog.tcl
 create mode 100755 redis-stable/utils/speed-regression.tcl
 create mode 100644 redis-stable/utils/srandmember/README.md
 create mode 100644 redis-stable/utils/srandmember/showdist.rb
 create mode 100644 redis-stable/utils/srandmember/showfreq.rb
 create mode 100644 redis-stable/utils/systemd-redis_multiple_servers@.service
 create mode 100644 redis-stable/utils/systemd-redis_server.service
 create mode 100644 redis-stable/utils/tracking_collisions.c
 create mode 100755 redis-stable/utils/whatisdoing.sh

diff --git a/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md b/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
new file mode 100644
index 00000000..00f21a81
--- /dev/null
+++ b/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
@@ -0,0 +1,24 @@
+---
+name: Bug report
+about: Help us improve Redis by reporting a bug
+title: '[BUG]'
+labels: ''
+assignees: ''
+
+---
+
+**Describe the bug**
+
+A short description of the bug.
+
+**To reproduce**
+
+Steps to reproduce the behavior and/or a minimal code sample.
+
+**Expected behavior**
+
+A description of what you expected to happen.
+
+**Additional information**
+
+Any additional information that is relevant to the problem.
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md b/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
new file mode 100644
index 00000000..c608ccdc
--- /dev/null
+++ b/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
@@ -0,0 +1,20 @@
+---
+name: Crash report
+about: Submit a crash report
+title: '[CRASH]'
+labels: ''
+assignees: ''
+
+---
+
+**Crash report**
+
+Paste the complete crash log between the quotes below. Please include a few lines from the log preceding the crash report to provide some context.
+
+```
+```
+
+**Aditional information**
+
+1. OS distribution and version
+2. Steps to reproduce (if any)
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md b/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
new file mode 100644
index 00000000..732dc647
--- /dev/null
+++ b/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
@@ -0,0 +1,24 @@
+---
+name: Feature request
+about: Suggest a feature for Redis
+title: '[NEW]'
+labels: ''
+assignees: ''
+
+---
+
+**The problem/use-case that the feature addresses**
+
+A description of the problem that the feature will solve, or the use-case with which the feature will be used.
+
+**Description of the feature**
+
+A description of what you want to happen.
+
+**Alternatives you've considered**
+
+Any alternative solutions or features you've considered, including references to existing open and closed feature requests in this repository.
+
+**Additional information**
+
+Any additional information that is relevant to the feature request.
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md b/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
new file mode 100644
index 00000000..e82cf002
--- /dev/null
+++ b/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
@@ -0,0 +1,8 @@
+---
+name: Other
+about: Can't find the right issue type? Use this one!
+title: ''
+labels: ''
+assignees: ''
+
+---
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/question.md b/redis-stable/.github/ISSUE_TEMPLATE/question.md
new file mode 100644
index 00000000..6acde0d0
--- /dev/null
+++ b/redis-stable/.github/ISSUE_TEMPLATE/question.md
@@ -0,0 +1,21 @@
+---
+name: Question
+about: Ask the Redis developers
+title: '[QUESTION]'
+labels: ''
+assignees: ''
+
+---
+
+Please keep in mind that this issue tracker should be used for reporting bugs or proposing improvements to the Redis server.
+
+Generally, questions about using Redis should be directed to the [community](https://redis.io/community):
+
+* [the mailing list](https://groups.google.com/forum/#!forum/redis-db)
+* [the `redis` tag at StackOverflow](http://stackoverflow.com/questions/tagged/redis)
+* [/r/redis subreddit](http://www.reddit.com/r/redis)
+* [the irc channel #redis](http://webchat.freenode.net/?channels=redis) on freenode
+
+It is also possible that your question was already asked here, so please do a quick issues search before submitting. Lastly, if your question is about one of Redis' [clients](https://redis.io/clients), you may to contact your client's developers for help.
+
+That said, please feel free to replace all this with your question :)
\ No newline at end of file
diff --git a/redis-stable/.github/workflows/ci.yml b/redis-stable/.github/workflows/ci.yml
new file mode 100644
index 00000000..39b332a1
--- /dev/null
+++ b/redis-stable/.github/workflows/ci.yml
@@ -0,0 +1,60 @@
+name: CI
+
+on: [push, pull_request]
+
+jobs:
+
+  test-ubuntu-latest:
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      # Fail build if there are warnings
+      # build with TLS just for compilation coverage
+      run: make REDIS_CFLAGS='-Werror' BUILD_TLS=yes
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6
+        ./runtest --verbose
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+
+  build-ubuntu-old:
+    runs-on: ubuntu-16.04
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make REDIS_CFLAGS='-Werror'
+
+  build-macos-latest:
+    runs-on: macos-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make REDIS_CFLAGS='-Werror'
+
+  build-32bit:
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        sudo apt-get update && sudo apt-get install libc6-dev-i386
+        make REDIS_CFLAGS='-Werror' 32bit
+
+  build-libc-malloc:
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make REDIS_CFLAGS='-Werror' MALLOC=libc
+
+  build-centos7-jemalloc:
+    runs-on: ubuntu-latest
+    container: centos:7
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        yum -y install gcc make
+        make REDIS_CFLAGS='-Werror'
diff --git a/redis-stable/.github/workflows/daily.yml b/redis-stable/.github/workflows/daily.yml
new file mode 100644
index 00000000..432971a9
--- /dev/null
+++ b/redis-stable/.github/workflows/daily.yml
@@ -0,0 +1,308 @@
+name: Daily
+
+on:
+  pull_request:
+    branches:
+      # any PR to a release branch.
+      - '[0-9].[0-9]'
+  schedule:
+    - cron: '0 0 * * *'
+
+jobs:
+
+  test-ubuntu-jemalloc:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make REDIS_CFLAGS='-Werror -DREDIS_TEST'
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+    - name: unittest
+      run: ./src/redis-server test all
+
+  test-ubuntu-libc-malloc:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make MALLOC=libc
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+
+  test-ubuntu-no-malloc-usable-size:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make MALLOC=libc CFLAGS=-DNO_MALLOC_USABLE_SIZE
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+
+  test-ubuntu-32bit:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        sudo apt-get update && sudo apt-get install libc6-dev-i386
+        make 32bit REDIS_CFLAGS='-Werror -DREDIS_TEST'
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: |
+        make -C tests/modules 32bit # the script below doesn't have an argument, we must build manually ahead of time
+        ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+    - name: unittest
+      run: ./src/redis-server test all
+
+  test-ubuntu-tls:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        make BUILD_TLS=yes
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6 tcl-tls
+        ./utils/gen-test-certs.sh
+        ./runtest --accurate --verbose --tls --dump-logs
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: |
+        ./runtest-moduleapi --verbose --tls
+        ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: |
+        ./runtest-sentinel --tls
+        ./runtest-sentinel
+    - name: cluster tests
+      run: |
+        ./runtest-cluster --tls
+        ./runtest-cluster
+
+  test-ubuntu-io-threads:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        make
+    - name: test
+      run: |
+        sudo apt-get install tcl8.6 tcl-tls
+        ./runtest --config io-threads 4 --config io-threads-do-reads yes --accurate --verbose --tags network --dump-logs
+    - name: cluster tests
+      run: |
+        ./runtest-cluster --config io-threads 4 --config io-threads-do-reads yes
+
+  test-valgrind:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make valgrind REDIS_CFLAGS='-Werror -DREDIS_TEST'
+    - name: test
+      run: |
+        sudo apt-get update
+        sudo apt-get install tcl8.6 valgrind -y
+        ./runtest --valgrind --verbose --clients 1 --tags -large-memory --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --valgrind --no-latency --verbose --clients 1
+    - name: unittest
+      run: |
+        valgrind --track-origins=yes --suppressions=./src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full --log-file=err.txt ./src/redis-server test all
+        if grep -q 0x err.txt; then cat err.txt; exit 1; fi
+
+  test-valgrind-no-malloc-usable-size:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make valgrind CFLAGS="-DNO_MALLOC_USABLE_SIZE"
+    - name: test
+      run: |
+        sudo apt-get update
+        sudo apt-get install tcl8.6 valgrind -y
+        ./runtest --valgrind --verbose --clients 1 --tags -large-memory --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --valgrind --no-latency --verbose --clients 1
+
+  test-centos7-jemalloc:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    container: centos:7
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        yum -y install gcc make
+        make
+    - name: test
+      run: |
+        yum -y install which tcl
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+
+  test-centos7-tls:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    container: centos:7
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+        yum -y install centos-release-scl epel-release
+        yum -y install devtoolset-7 openssl-devel openssl
+        scl enable devtoolset-7 "make BUILD_TLS=yes"
+    - name: test
+      run: |
+        yum -y install tcl tcltls
+        ./utils/gen-test-certs.sh
+        ./runtest --accurate --verbose --tls --dump-logs
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: |
+        ./runtest-moduleapi --verbose --tls
+        ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: |
+        ./runtest-sentinel --tls
+        ./runtest-sentinel
+    - name: cluster tests
+      run: |
+        ./runtest-cluster --tls
+        ./runtest-cluster
+
+  test-macos-latest:
+    runs-on: macos-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: make
+    - name: test
+      run: |
+        ./runtest --accurate --verbose --no-latency --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+
+  test-freebsd:
+    runs-on: macos-latest
+    if: github.repository == 'redis/redis'
+    timeout-minutes: 14400
+    steps:
+    - uses: actions/checkout@v2
+    - name: test
+      uses: vmactions/freebsd-vm@v0.1.4
+      with:
+        usesh: true
+        sync: rsync
+        prepare: pkg install -y bash gmake lang/tcl86
+        run: >
+          gmake &&
+          ./runtest --accurate --verbose --no-latency --tags -large-memory --dump-logs &&
+          MAKE=gmake ./runtest-moduleapi --verbose &&
+          ./runtest-sentinel &&
+          ./runtest-cluster
+
+  test-alpine-jemalloc:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    container: alpine:latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+          apk add build-base
+          make REDIS_CFLAGS='-Werror'
+    - name: test
+      run: |
+        apk add tcl procps
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
+
+  test-alpine-libc-malloc:
+    runs-on: ubuntu-latest
+    if: github.repository == 'redis/redis'
+    container: alpine:latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: make
+      run: |
+          apk add build-base
+          make REDIS_CFLAGS='-Werror' USE_JEMALLOC=no CFLAGS=-DUSE_MALLOC_USABLE_SIZE
+    - name: test
+      run: |
+        apk add tcl procps
+        ./runtest --accurate --verbose --dump-logs
+    - name: module api test
+      run: ./runtest-moduleapi --verbose
+    - name: sentinel tests
+      run: ./runtest-sentinel
+    - name: cluster tests
+      run: ./runtest-cluster
diff --git a/redis-stable/.gitignore b/redis-stable/.gitignore
new file mode 100644
index 00000000..dd9d4b80
--- /dev/null
+++ b/redis-stable/.gitignore
@@ -0,0 +1,40 @@
+.*.swp
+*.o
+*.xo
+*.so
+*.d
+*.log
+dump.rdb
+redis-benchmark
+redis-check-aof
+redis-check-rdb
+redis-check-dump
+redis-cli
+redis-sentinel
+redis-server
+doc-tools
+release
+misc/*
+src/release.h
+appendonly.aof
+SHORT_TERM_TODO
+release.h
+src/transfer.sh
+src/configs
+redis.ds
+src/redis.conf
+src/nodes.conf
+deps/lua/src/lua
+deps/lua/src/luac
+deps/lua/src/liblua.a
+tests/tls/*
+.make-*
+.prerequisites
+*.dSYM
+Makefile.dep
+.vscode/*
+.idea/*
+.ccls
+.ccls-cache/*
+compile_commands.json
+redis.code-workspace
diff --git a/redis-stable/00-RELEASENOTES b/redis-stable/00-RELEASENOTES
new file mode 100644
index 00000000..62d1def1
--- /dev/null
+++ b/redis-stable/00-RELEASENOTES
@@ -0,0 +1,692 @@
+Redis 6.2 release notes
+=======================
+
+--------------------------------------------------------------------------------
+Upgrade urgency levels:
+
+LOW:      No need to upgrade unless there are new features you want to use.
+MODERATE: Program an upgrade of the server, but it's not urgent.
+HIGH:     There is a critical bug that may affect a subset of users. Upgrade!
+CRITICAL: There is a critical bug affecting MOST USERS. Upgrade ASAP.
+SECURITY: There are security fixes in the release.
+--------------------------------------------------------------------------------
+
+================================================================================
+Redis 6.2.6 Released Mon Oct 4 12:00:00 IDT 2021
+================================================================================
+
+Upgrade urgency: SECURITY, contains fixes to security issues.
+
+Security Fixes:
+* (CVE-2021-41099) Integer to heap buffer overflow handling certain string
+  commands and network payloads, when proto-max-bulk-len is manually configured
+  to a non-default, very large value [reported by yiyuaner].
+* (CVE-2021-32762) Integer to heap buffer overflow issue in redis-cli and
+  redis-sentinel parsing large multi-bulk replies on some older and less common
+  platforms [reported by Microsoft Vulnerability Research].
+* (CVE-2021-32687) Integer to heap buffer overflow with intsets, when
+  set-max-intset-entries is manually configured to a non-default, very large
+  value [reported by Pawel Wieczorkiewicz, AWS].
+* (CVE-2021-32675) Denial Of Service when processing RESP request payloads with
+  a large number of elements on many connections.
+* (CVE-2021-32672) Random heap reading issue with Lua Debugger [reported by
+  Meir Shpilraien].
+* (CVE-2021-32628) Integer to heap buffer overflow handling ziplist-encoded
+  data types, when configuring a large, non-default value for
+  hash-max-ziplist-entries, hash-max-ziplist-value, zset-max-ziplist-entries
+  or zset-max-ziplist-value [reported by sundb].
+* (CVE-2021-32627) Integer to heap buffer overflow issue with streams, when
+  configuring a non-default, large value for proto-max-bulk-len and
+  client-query-buffer-limit [reported by sundb].
+* (CVE-2021-32626) Specially crafted Lua scripts may result with Heap buffer
+  overflow [reported by Meir Shpilraien].
+
+Bug fixes that involve behavior changes:
+* GEO* STORE with empty source key deletes the destination key and return 0 (#9271)
+  Previously it would have returned an empty array like the non-STORE variant.
+* PUBSUB NUMPAT replies with number of patterns rather than number of subscriptions (#9209)
+  This actually changed in 6.2.0 but was overlooked and omitted from the release notes.
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* Fix CLIENT PAUSE, used an old timeout from previous PAUSE (#9477)
+* Fix CLIENT PAUSE in a replica would mess the replication offset (#9448)
+* Add some missing error statistics in INFO errorstats (#9328)
+
+Other bug fixes:
+* Fix incorrect reply of COMMAND command key positions for MIGRATE command (#9455)
+* Fix appendfsync to always guarantee fsync before reply, on MacOS and FreeBSD (kqueue) (#9416)
+* Fix the wrong mis-detection of sync_file_range system call, affecting performance (#9371)
+
+CLI tools:
+* When redis-cli received ASK response, it didn't handle it (#8930)
+
+Improvements:
+* Add latency monitor sample when key is deleted via lazy expire (#9317)
+* Sanitize corrupt payload improvements (#9321, #9399)
+* Delete empty keys when loading RDB file or handling a RESTORE command (#9297, #9349)
+
+================================================================================
+Redis 6.2.5 Released Wed Jul 21 16:32:19 IDT 2021
+================================================================================
+
+Upgrade urgency: SECURITY, contains fixes to security issues that affect
+authenticated client connections on 32-bit versions. MODERATE otherwise.
+
+Fix integer overflow in BITFIELD on 32-bit versions (CVE-2021-32761).
+An integer overflow bug in Redis version 2.2 or newer can be exploited using the
+BITFIELD command to corrupt the heap and potentially result with remote code
+execution.
+
+Bug fixes that involve behavior changes:
+* Change reply type for ZPOPMAX/MIN with count in RESP3 to nested array (#8981).
+  Was using a flat array like in RESP2 instead of a nested array like ZRANGE does.
+* Fix reply type for HRANDFIELD and ZRANDMEMBER when key is missing (#9178).
+  Was using a null array instead of an empty array.
+* Fix reply type for ZRANGESTORE when source key is missing (#9089).
+  Was using an empty array like ZRANGE instead of 0 (used in the STORE variant).
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* ZRANDMEMBER WITHSCORES with negative COUNT may return bad score (#9162)
+* Fix crash after CLIENT UNPAUSE when threaded I/O config is enabled (#9041)
+* Fix XTRIM or XADD with LIMIT may delete more entries than the limit (#9048)
+* Fix build issue with OpenSSL 1.1.0 (#9233)
+
+Other bug fixes:
+* Fail EXEC command in case a watched key is expired (#9194)
+* Fix SMOVE not to invalidate dest key (WATCH and tracking) when member already exists (#9244)
+* Fix SINTERSTORE not to delete dest key when getting a wrong type error (#9032)
+* Fix overflows on 32-bit versions in GETBIT, SETBIT, BITCOUNT, BITPOS, and BITFIELD (#9191)
+* Improve MEMORY USAGE on stream keys (#9164)
+* Set TCP keepalive on inbound cluster bus connections (#9230)
+* Fix diskless replica loading to recover from RDB short read on module AUX data (#9199)
+* Fix race in client side tracking (#9116)
+* Fix ziplist length updates on big-endian platforms (#2080)
+
+CLI tools:
+* redis-cli cluster import command may issue wrong MIGRATE command, sending COPY instead of REPLACE (#8945)
+* redis-cli --rdb fixes when using "-" to write to stdout (#9136, #9135)
+* redis-cli support for RESP3 set type in CSV and RAW output (#7338)
+
+Modules:
+* Module API for getting current command name (#8792)
+* Fix RM_StringTruncate when newlen is 0 (#3718)
+* Fix CLIENT UNBLOCK crashing modules without timeout callback (#9167)
+
+================================================================================
+Redis 6.2.4 Released Tue June 1 12:00:00 IST 2021
+================================================================================
+
+Upgrade urgency: SECURITY, Contains fixes to security issues that affect
+authenticated client connections. MODERATE otherwise.
+
+Fix integer overflow in STRALGO LCS (CVE-2021-32625)
+An integer overflow bug in Redis version 6.0 or newer can be exploited using the
+STRALGO LCS command to corrupt the heap and potentially result with remote code
+execution. This is a result of an incomplete fix by CVE-2021-29477.
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* Fix crash after a diskless replication fork child is terminated (#8991)
+* Fix redis-benchmark crash on unsupported configs (#8916)
+
+Other bug fixes:
+* Fix crash in UNLINK on a stream key with deleted consumer groups (#8932)
+* SINTERSTORE: Add missing keyspace del event when none of the sources exist (#8949)
+* Sentinel: Fix CONFIG SET of empty string sentinel-user/sentinel-pass configs (#8958)
+* Enforce client output buffer soft limit when no traffic (#8833)
+
+Improvements:
+* Hide AUTH passwords in MIGRATE command from slowlog (#8859)
+
+================================================================================
+Redis 6.2.3 Released Mon May 3 19:00:00 IST 2021
+================================================================================
+
+Upgrade urgency: SECURITY, Contains fixes to security issues that affect
+authenticated client connections. LOW otherwise.
+
+Integer overflow in STRALGO LCS command (CVE-2021-29477):
+An integer overflow bug in Redis version 6.0 or newer could be exploited using
+the STRALGO LCS command to corrupt the heap and potentially result in remote
+code execution. The integer overflow bug exists in all versions of Redis
+starting with 6.0.
+
+Integer overflow in COPY command for large intsets (CVE-2021-29478):
+An integer overflow bug in Redis 6.2 could be exploited to corrupt the heap and
+potentially result with remote code execution. The vulnerability involves
+changing the default set-max-intset-entries configuration value, creating a
+large set key that consists of integer values and using the COPY command to
+duplicate it. The integer overflow bug exists in all versions of Redis starting
+with 2.6, where it could result with a corrupted RDB or DUMP payload, but not
+exploited through COPY (which did not exist before 6.2).
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* Fix memory leak in moduleDefragGlobals (#8853)
+* Fix memory leak when doing lazy freeing client tracking table (#8822)
+* Block abusive replicas from sending command that could assert and crash redis (#8868)
+
+Other bug fixes:
+* Use a monotonic clock to check for Lua script timeout (#8812)
+* redis-cli: Do not use unix socket when we got redirected in cluster mode (#8870)
+
+Modules:
+* Fix RM_GetClusterNodeInfo() to correctly populate master id (#8846)
+
+================================================================================
+Redis 6.2.2 Released Mon April 19 19:00:00 IST 2021
+================================================================================
+
+Upgrade urgency: HIGH, if you're using ACL and pub/sub, CONFIG REWRITE, or
+suffering from performance regression. see below.
+
+Bug fixes for regressions in previous releases of Redis 6.2:
+* Fix BGSAVE, AOFRW, and replication slowdown due to child reporting CoW (#8645)
+* Fix short busy loop when timer event is about to fire (#8764)
+* Fix default user, overwritten and reset users losing pubsub channel permissions (#8723)
+* Fix config rewrite with an empty `save` config resulsing in default `save` values (#8719)
+* Fix not starting on alpine/libmusl without IPv6 (#8655)
+* Fix issues with propagation and MULTI/EXEC in modules (#8617)
+  Several issues around nested calls and thread safe contexts
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* ACL Pub/Sub channels permission handling for save/load scenario (#8794)
+* Fix early rejection of PUBLISH inside MULTI-EXEC transaction (#8534)
+* Fix missing SLOWLOG records for blocked commands (#8632)
+* Allow RESET command during busy scripts (#8629)
+* Fix some error replies were not counted on stats (#8659)
+
+Bug fixes:
+* Add a timeout mechanism for replicas stuck in fullsync (#8762)
+* Process HELLO command even if the default user has no permissions (#8633)
+* Client issuing a long running script and using a pipeline, got disconnected (#8715)
+* Fix script kill to work also on scripts that use `pcall` (#8661)
+* Fix list-compress-depth may compress more node than required (#8311)
+* Fix redis-cli handling of rediss:// URL scheme (#8705)
+* Cluster: Skip unnecessary check which may prevent failure detection (#8585)
+* Cluster: Fix hang manual failover when replica just started (#8651)
+* Sentinel: Fix info-refresh time field before sentinel get first response (#8567)
+* Sentinel: Fix possible crash on failed connection attempt (#8627)
+* Systemd: Send the readiness notification when a replica is ready to accept connections (#8409)
+
+Command behavior changes:
+* ZADD: fix wrong reply when INCR used with GT/LT which blocked the update (#8717)
+  It was responding with the incremented value rather than nil
+* XAUTOCLAIM: fix response to return the next available id as the cursor (#8725)
+  Previous behavior was retuning the last one which was already scanned
+* XAUTOCLAIM: fix JUSTID to prevent incrementing delivery_count (#8724)
+
+New config options:
+* Add cluster-allow-replica-migration config option (#5285)
+* Add replica-announced config option (#8653)
+* Add support for plaintext clients in TLS cluster (#8587)
+* Add support for reading encrypted keyfiles (#8644)
+
+Improvements:
+* Fix performance regression in BRPOP on Redis 6.0 (#8689)
+* Avoid adding slowlog entries for config with sensitive data (#8584)
+* Improve redis-cli non-binary safe string handling (#8566)
+* Optimize CLUSTER SLOTS reply (#8541)
+* Handle remaining fsync errors (#8419)
+
+Info fields and introspection changes:
+* Strip % sign from current_fork_perc info field (#8628)
+* Fix RSS memory info on FreeBSD (#8620)
+* Fix client_recent_max_input/output_buffer in 'INFO CLIENTS' when all clients drop (#8588)
+* Fix invalid master_link_down_since_seconds in info replication (#8785)
+
+Platform and deployment-related changes:
+* Fix FreeBSD <12.x builds (#8603)
+
+Modules:
+* Add macros for RedisModule_log logging levels (#4246)
+* Add RedisModule_GetAbsExpire / RedisModule_SetAbsExpire (#8564)
+* Add a module type for key space notification (#8759)
+* Set module eviction context flag only in masters (#8631)
+* Fix unusable RedisModule_IsAOFClient API (#8596)
+* Fix missing EXEC on modules propagation after failed EVAL execution (#8654)
+* Fix edge-case when a module client is unblocked (#8618)
+
+================================================================================
+Redis 6.2.1 Released Mon Mar  1 17:51:36 IST 2021
+================================================================================
+
+Upgrade urgency: LOW.
+
+Here is a comprehensive list of changes in this release compared to 6.2.0,
+each one includes the PR number that added it, so you can get more details
+at https://github.com/redis/redis/pull/<number>
+
+Bug fixes:
+* Fix sanitize-dump-payload for stream with deleted records (#8568)
+* Prevent client-query-buffer-limit config from being set to lower than 1mb (#8557)
+
+Improvements:
+* Make port, tls-port and bind config options modifiable at runtime (#8510)
+
+Platform and deployment-related changes:
+* Fix compilation error on non-glibc systems if jemalloc is not used (#8533)
+* Improved memory consumption and memory usage tracking on FreeBSD (#8545)
+* Fix compilation on ARM64 MacOS with jemalloc (#8458)
+
+Modules:
+* New Module API for getting user name of a client (#8508)
+* Optimize RM_Call by utilizing a shared reusable client (#8516)
+* Fix crash running CLIENT INFO via RM_Call (#8560)
+
+================================================================================
+Redis 6.2.0 GA  Released Tue Feb 22 14:00:00 IST 2021
+================================================================================
+
+Upgrade urgency: SECURITY if you use 32bit build of redis (see bellow), MODERATE
+if you used earlier versions of Redis 6.2, LOW otherwise.
+
+Integer overflow on 32-bit systems (CVE-2021-21309):
+Redis 4.0 or newer uses a configurable limit for the maximum supported bulk
+input size. By default, it is 512MB which is a safe value for all platforms.
+If the limit is significantly increased, receiving a large request from a client
+may trigger several integer overflow scenarios, which would result with buffer
+overflow and heap corruption.
+
+Here is a comprehensive list of changes in this release compared to 6.2 RC3,
+each one includes the PR number that added it, so you can get more details
+at https://github.com/redis/redis/pull/<number>
+
+Bug fixes:
+* Avoid 32-bit overflows when proto-max-bulk-len is set high (#8522)
+* Fix broken protocol in client tracking tracking-redir-broken message (#8456)
+* Avoid unsafe field name characters in INFO commandstats, errorstats, modules (#8492)
+* XINFO able to access expired keys during CLIENT PAUSE WRITE (#8436)
+* Fix allowed length for REPLCONF ip-address, needed due to Sentinel's support for hostnames (#8517)
+* Fix broken protocol in redis-benchmark when used with -a or --dbnum (#8486)
+* XADD counts deleted records too when considering switching to a new listpack (#8390)
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* Fixes in GEOSEARCH bybox (accuracy and mismatch between width and height) (#8445)
+* Fix risk of OOM panic in HRANDFIELD, ZRANDMEMBER commands with huge negative count (#8429)
+* Fix duplicate replicas issue in Sentinel, needed due to hostname support (#8481)
+* Fix Sentinel configuration rewrite, an improvement of #8271 (#8480)
+
+Command behavior changes:
+* SRANDMEMBER uses RESP3 array type instead of set type (#8504)
+* EXPIRE, EXPIREAT, SETEX, GETEX: Return error when provided expire time overflows (#8287)
+
+Other behavior changes:
+* Remove ACL subcommand validation if fully added command exists. (#8483)
+
+Improvements:
+* Optimize sorting in GEORADIUS / GEOSEARCH with COUNT (#8326)
+* Optimize HRANDFIELD and ZRANDMEMBER case 4 when ziplist encoded (#8444)
+* Optimize in-place replacement of elements in HSET, HINCRBY, LSET (#8493)
+* Remove redundant list to store pubsub patterns (#8472)
+* Add --insecure option to command line tools (#8416)
+
+Info fields and introspection changes:
+* Add INFO fields to track progress of BGSAVE, AOFRW, replication (#8414)
+
+Modules:
+* RM_ZsetRem: Delete key if empty, the bug could leave empty zset keys (#8453)
+* RM_HashSet: Add COUNT_ALL flag and set errno (#8446)
+
+================================================================================
+Redis 6.2 RC3   Released Tue Feb 1 14:00:00 IST 2021
+================================================================================
+
+Upgrade urgency LOW: This is the third Release Candidate of Redis 6.2.
+
+Here is a comprehensive list of changes in this release compared to 6.2 RC2,
+each one includes the PR number that added it, so you can get more details
+at https://github.com/redis/redis/pull/<number>
+
+New commands / args:
+* Add HRANDFIELD and ZRANDMEMBER commands (#8297)
+* Add FAILOVER command (#8315)
+* Add GETEX, GETDEL commands (#8327)
+* Add PXAT/EXAT arguments to SET command (#8327)
+* Add SYNC arg to FLUSHALL and FLUSHDB, and ASYNC/SYNC arg to SCRIPT FLUSH (#8258)
+
+Sentinel:
+* Add hostname support to Sentinel (#8282)
+* Prevent file descriptors from leaking into Sentinel scripts (#8242)
+* Fix config file line order dependency and config rewrite sequence (#8271)
+
+New configuration options:
+* Add set-proc-title config option to disable changes to the process title (#3623)
+* Add proc-title-template option to control what's shown in the process title (#8397)
+* Add lazyfree-lazy-user-flush config option to control FLUSHALL, FLUSHDB and SCRIPT FLUSH (#8258)
+
+Bug fixes:
+* AOF: recover from last write error by turning on/off appendonly config (#8030)
+* Exit on fsync error when the AOF fsync policy is 'always' (#8347)
+* Avoid assertions (on older kernels) when testing arm64 CoW bug (#8405)
+* CONFIG REWRITE should honor umask settings (#8371)
+* Fix firstkey,lastkey,step in COMMAND command for some commands (#8367)
+
+Special considerations:
+* Fix misleading description of the save configuration directive (#8337)
+
+Improvements:
+* A way to get RDB file via replication without excessive replication buffers (#8303)
+* Optimize performance of clusterGenNodesDescription for large clusters (#8182)
+
+Info fields and introspection changes:
+* SLOWLOG and LATENCY monitor include unblocking time of blocked commands (#7491)
+
+Modules:
+* Add modules API for streams (#8288)
+* Add event for fork child birth and termination (#8289)
+* Add RM_BlockedClientMeasureTime* etc, to track background processing in commandstats (#7491)
+* Fix bug in v6.2, wrong value passed to the new unlink callback (#8381)
+* Fix bug in v6.2, modules blocked on keys unblock on commands like LPUSH (#8356)
+
+================================================================================
+Redis 6.2 RC2   Released Tue Jan 12 16:17:20 IST 2021
+================================================================================
+
+Upgrade urgency LOW: This is the second Release Candidate of Redis 6.2.
+
+IMPORTANT: If you're running Redis on ARM64 or a big-endian system, upgrade may
+have significant implications. Please be sure to read the notes below.
+
+Here is a comprehensive list of changes in this release compared to 6.2 RC1,
+each one includes the PR number that added it, so you can get more details
+at https://github.com/redis/redis/pull/<number>
+
+New commands / args:
+* Add the REV, BYLEX and BYSCORE arguments to ZRANGE, and the ZRANGESTORE command (#7844)
+* Add the XAUTOCLAIM command (#7973)
+* Add the MINID trimming strategy and the LIMIT argument to XADD and XTRIM (#8169)
+* Add the ANY argument to GEOSEARCH and GEORADIUS (#8259)
+* Add the CH, NX, XX arguments to GEOADD (#8227)
+* Add the COUNT argument to LPOP and RPOP (#8179)
+* Add the WRITE argument to CLIENT PAUSE for pausing write commands exclusively (#8170)
+* Change the proto-ver argument of HELLO to optional (#7377)
+* Add the CLIENT TRACKINGINFO subcommand (#7309)
+
+Command behavior changes:
+* CLIENT TRACKING yields an error when given overlapping BCAST prefixes (#8176)
+* SWAPDB invalidates WATCHed keys (#8239)
+* SORT command behaves differently when used on a writable replica (#8283)
+
+Other behavior changes:
+* Avoid propagating MULTI/EXEC for read-only transactions (#8216)
+* Remove the read-only flag from TIME, ECHO, ROLE, LASTSAVE (#8216)
+* Fix the command flags of PFDEBUG (#8222)
+* Tracking clients will no longer receive unnecessary key invalidation messages after FLUSHDB (#8039)
+* Sentinel: Fix missing updates to the config file after SENTINEL SET command (#8229)
+
+Bug fixes with compatibility implications (bugs introduced in Redis 6.0):
+* Fix RDB CRC64 checksum on big-endian systems (#8270)
+  If you're using big-endian please consider the compatibility implications with
+  RESTORE, replication and persistence.
+* Fix wrong order of key/value in Lua's map response (#8266)
+  If your scripts use redis.setresp() or return a map (new in Redis 6.0), please
+  consider the implications.
+
+Bug fixes that are only applicable to previous releases of Redis 6.2:
+* Resolve rare assertions in active defragmentation while loading (#8284, #8281)
+
+Bug fixes:
+* Fix the selection of a random element from large hash tables (#8133)
+* Fix an issue where a forked process deletes the parent's pidfile (#8231)
+* Fix crashes when enabling io-threads-do-reads (#8230)
+* Fix a crash in redis-cli after executing cluster backup (#8267)
+* Fix redis-benchmark to use an IP address for the first cluster node (#8154)
+* Fix saving of strings larger than 2GB into RDB files (#8306)
+
+Additional improvements:
+* Improve replication handshake time (#8214)
+* Release client tracking table memory asynchronously in cases where the DB is also freed asynchronously (#8039)
+* Avoid wasteful transient memory allocation in certain cases (#8286, #5954)
+* Handle binary string values by the 'requirepass' and 'masterauth' configs (#8200)
+
+Platform and deployment-related changes:
+* Install redis-check-rdb and redis-check-aof as symlinks to redis-server (#5745)
+* Add a check for an ARM64 Linux kernel bug (#8224)
+  Due to the potential severity of this issue, Redis will refuse to run on
+  affected platforms by default.
+
+Info fields and introspection changes:
+* Add the errorstats section to the INFO command (#8217)
+* Add the failed_calls and rejected_calls fields INFO's commandstats section (#8217)
+* Report child copy-on-write metrics continuously (#8264)
+
+Module API changes:
+* Add the RedisModule_SendChildCOWInfo API (#8264)
+* Add the may-replicate command flag (#8170)
+
+================================================================================
+Redis 6.2 RC1   Released Mon Dec 14 11:50:00 IST 2020
+================================================================================
+
+Upgrade urgency LOW: This is the first Release Candidate of Redis 6.2.
+
+Introduction to the Redis 6.2 release
+=====================================
+
+This release is the first significant Redis release managed by the core team
+under the new project governance model.
+
+Redis 6.2 includes many new commands and improvements, but no big features. It
+mainly makes Redis more complete and addresses issues that have been requested
+by many users frequently or for a long time.
+
+Many of these changes were not eligible for 6.0.x for several reasons:
+
+1. They are not backward compatible, which is always the case with new or
+   extended commands (that cannot be replicated to an older replica).
+2. They require a longer release-candidate test cycle.
+
+
+Here is a comprehensive list of changes in this release compared to 6.0.9,
+each one includes the PR number that added it, so you can get more details
+at https://github.com/redis/redis/pull/<number>
+
+New commands / args:
+* Add SMISMEMBER command that checks multiple members (#7615)
+* Add ZMSCORE command that returns an array of scores (#7593)
+* Add LMOVE and BLMOVE commands that pop and push arbitrarily (#6929)
+* Add RESET command that resets client connection state (#7982)
+* Add COPY command that copies keys (#7953)
+* Add ZDIFF and ZDIFFSTORE commands (#7961)
+* Add ZINTER and ZUNION commands (#7794)
+* Add GEOSEARCH/GEOSEARCHSTORE commands for bounding box spatial queries (#8094)
+* Add GET parameter to SET command, for more powerful GETSET (#7852)
+* Add exclusive range query to XPENDING (#8130)
+* Add exclusive range query to X[REV]RANGE (#8072)
+* Add GT and LT options to ZADD for conditional score updates (#7818)
+* Add CLIENT INFO and CLIENT LIST for specific ids (#8113)
+* Add IDLE argument to XPENDING command (#7972)
+* Add local address to CLIENT LIST, and a CLIENT KILL filter. (#7913)
+* Add NOMKSTREAM option to XADD command (#7910)
+* Add command introspection to Sentinel (#7940)
+* Add SENTINEL MYID subcommand (#7858)
+
+New features:
+* Dump payload sanitization: prevent corrupt payload causing crashes (#7807)
+  Has flags to enable full O(N) validation (disabled by default).
+* ACL patterns for Pub/Sub channels (#7993)
+* Support ACL for Sentinel mode (#7888)
+* Support getting configuration from both stdin and file at the same time (#7893)
+  Lets you avoid storing secrets on the disk.
+
+New features in CLI tools:
+* redis-cli RESP3 push support (#7609)
+* redis-cli cluster import support source and target that require auth (#7994)
+* redis-cli URIs able to provide user name in addition to password (#8048)
+* redis-cli/redis-benchmark allow specifying the prefered ciphers/ciphersuites (#8005)
+* redis-cli add -e option to exit with code when command execution fails (#8136)
+
+Command behavior changes:
+* EXISTS should not alter LRU (#8016)
+  In Redis 5.0 and 6.0 it would have touched the LRU/LFU of the key.
+* OBJECT should not reveal logically expired keys (#8016)
+  Will now behave the same TYPE or any other non-DEBUG command.
+* Improve db id range check for SELECT and MOVE (#8085)
+  Changes the error message text on a wrong db index.
+* Modify AUTH / HELLO error message (#7648)
+  Changes the error message text when the user isn't found or is disabled.
+* BITOPS length limited to proto_max_bulk_len rather than 512MB (#8096)
+  The limit is now configurable like in SETRANGE, and APPEND.
+* GEORADIUS[BYMEMBER] can fail with -OOM if Redis is over the memory limit (#8107)
+
+Other behavior changes:
+* Optionally (default) fail to start if requested bind address is not available (#7936)
+  If you rely on Redis starting successfully even if one of the bind addresses
+  is not available, you'll need to tune the new config.
+* Limit the main db dictionaries expansion to prevent key eviction (#7954)
+  In the past big dictionary rehashing could result in massive data eviction.
+  Now this rehashing is delayed (up to a limit), which can result in performance
+  loss due to hash collisions.
+* CONFIG REWRITE is atomic and safer, but requires write access to the config file's folder (#7824, #8051)
+  This change was already present in 6.0.9, but was missing from the release
+  notes.
+* A new incremental eviction mechanism that reduces latency on eviction spikes (#7653)
+  In pathological cases this can cause memory to grow uncontrolled and may require
+  specific tuning.
+* Not resetting "save" config when Redis is started with command line arguments. (#7092)
+  In case you provide command line arguments without "save" and count on it
+  being disabled, Now the defaults "save" config will kick in.
+* Update memory metrics for INFO during loading (#7690)
+* When "supervised" config is enabled, it takes precedence over "daemonize". (#8036)
+* Assertion and panic, print crash log without generating SIGSEGV (#7585)
+* Added crash log report on SIGABRT, instead of silently exiting (#8004)
+* Disable THP (Transparent Huge Pages) if enabled (#7381)
+  If you deliberately enabled it, you'll need to config Redis to keep it.
+
+Bug fixes:
+* Handle output buffer limits for module blocked clients (#8141)
+  Could result in a module sending reply to a blocked client to go beyond the
+  limit.
+* Fix setproctitle related crashes. (#8150, #8088)
+  Caused various crashes on startup, mainly on Apple M1 chips or under
+  instrumentation.
+* A module doing RM_Call could cause replicas to get nested MULTI (#8097).
+* Backup/restore cluster mode keys to slots map for repl-diskless-load=swapdb (#8108)
+  In cluster mode with repl-diskless-load, when loading failed, slot map
+  wouldn't have been restored.
+* Fix oom-score-adj-values range, and bug when used in config file (#8046)
+  Enabling setting this in the config file in a line after enabling it, would
+  have been buggy.
+* Reset average ttl when empty databases (#8106)
+  Just causing misleading metric in INFO
+* Disable rehash when Redis has child process (#8007)
+  This could have caused excessive CoW during BGSAVE, replication or AOFRW.
+* Further improved ACL algorithm for picking categories (#7966)
+  Output of ACL GETUSER is now more similar to the one provided by ACL SETUSER.
+* Fix bug with module GIL being released prematurely (#8061)
+  Could in theory (and rarely) cause multi-threaded modules to corrupt memory.
+* Fix cluster redirect for module command with no firstkey. (#7539)
+* Reduce effect of client tracking causing feedback loop in key eviction (#8100)
+* Kill disk-based fork child when all replicas drop and 'save' is not enabled (#7819)
+* Rewritten commands (modified for propagation) are logged as their original command (#8006)
+* Fix cluster access to unaligned memory (SIGBUS on old ARM) #7958
+* If diskless repl child is killed, make sure to reap the child pid (#7742)
+* Broadcast a PONG message when slot's migration is over, may reduce MOVED responses (#7571)
+
+Other improvements:
+* TLS Support in redis-benchmark (#7959)
+* Accelerate diskless master connections, and general re-connections (#6271)
+* Run active defrag while blocked / loading (#7726)
+* Performance and memory reporting improvement - sds take control of its internal fragmentation (#7875)
+* Speedup cluster failover. (#7948)
+
+Platform / toolchain support related improvements:
+* Optionally (not by default) use H/W Monotonic clock for faster time sampling (#7644)
+* Remove the requirements for C11 and _Atomic supporting compiler (#7707)
+  This would allow to more easily build and use Redis on older systems and
+  compilers again.
+* Fix crash log registers output on ARM. (#8020)
+* Raspberry build fix. (#8095)
+* Setting process title support for Haiku. (#8060)
+* DragonFlyBSD RSS memory sampling support. (#8023)
+
+New configuration options:
+* Enable configuring OpenSSL using the standard openssl.cnf (#8143)
+* oom-score-adj-values config can now take absolute values (besides relative ones) (#8046)
+* TLS: Add different client cert support. (#8076)
+* Note that a few other changes listed above added their config options.
+
+Info fields and introspection changes:
+* Add INFO fields to track diskless and disk-based replication progress (#7981)
+* Add INFO field for main thread cpu time, and scrape system time. (#8132)
+* Add total_forks to INFO STATS (#8155)
+* Add maxclients and cluster_connections to INFO CLIENTS (#7979)
+* Add tracking bcast flag and client redirection in client list (#7995)
+* Fixed INFO client_recent_max_input_buffer includes argv array (#8065, see #7874)
+* Note that a few other changes listed above added their info fields.
+
+Module API changes:
+* Add CTX_FLAGS_DENY_BLOCKING as a unified the way to know if blocking is allowed (#8025)
+* Add data type callbacks for lazy free effort, and unlink (#7912)
+* Add data type callback for COPY command (#8112)
+* Add callbacks for defrag support. (#8149)
+* Add module event for repl-diskless-load swapdb (#8153)
+
+Module related fixes:
+* Moved RMAPI_FUNC_SUPPORTED so that it's usable (#8037)
+* Improve timer accuracy (#7987)
+* Allow '\0' inside of result of RM_CreateStringPrintf (#6260)
+
+
+Thanks to all the users and developers who made this release possible.
+We'll follow up with more RC releases, until the code looks production ready
+and we don't get reports of serious issues for a while.
+
+A special thank you for the amount of work put into this release by:
+- Oran Agra
+- Yossi Gottlieb
+- Viktor Söderqvist
+- Yang Bodong
+- Filipe Oliveira
+- Guy Benoish
+- Itamar Haber
+- Madelyn Olson
+- Wang Yuan
+- Felipe Machado
+- Wen Hui
+- Tatsuya Arisawa
+- Jonah H. Harris
+- Raghav Muddur
+- Jim Brunner
+- Yaacov Hazan
+- Allen Farris
+- Chen Yang
+- Nitai Caro
+- sundb
+- Meir Shpilraien
+- maohuazhu
+- Valentino Geron
+- Zhao Zhao
+- Qu Chen
+- George Prekas
+- Tyson Andre
+- Uri Yagelnik
+- Michael Grunder
+- Huang Zw
+- alexronke-channeladvisor
+- Andy Pan
+- Wu Yunlong
+- Wei Kukey
+- Yoav Steinberg
+- Greg Femec
+- Uri Shachar
+- Nykolas Laurentino de Lima
+- xhe
+- zhenwei pi
+- David CARLIER
+
+Migrating from 6.0 to 6.2
+=========================
+
+Redis 6.2 is mostly a strict superset of 6.0, you should not have any problem
+upgrading your application from 6.0 to 6.2. However there are some small changes
+of behavior listed above, please make sure you are not badly affected by any of
+them.
+
+Specifically these sections:
+* Command behavior changes
+* Other behavior changes
+
+--------------------------------------------------------------------------------
+
+Cheers,
+The Redis team
diff --git a/redis-stable/BUGS b/redis-stable/BUGS
new file mode 100644
index 00000000..7af25934
--- /dev/null
+++ b/redis-stable/BUGS
@@ -0,0 +1 @@
+Please check https://github.com/redis/redis/issues
diff --git a/redis-stable/CONDUCT b/redis-stable/CONDUCT
new file mode 100644
index 00000000..e0e15e26
--- /dev/null
+++ b/redis-stable/CONDUCT
@@ -0,0 +1,96 @@
+Contributor Covenant Code of Conduct
+Our Pledge
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, religion, or sexual identity
+and orientation.
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+Our Standards
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes,
+and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the
+overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others’ private information, such as a physical or email
+address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+professional setting
+
+Enforcement Responsibilities
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+Scope
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+Enforcement
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+this email address: redis@redis.io.
+All complaints will be reviewed and investigated promptly and fairly.
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+Enforcement Guidelines
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+1. Correction
+Community Impact: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+Consequence: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+2. Warning
+Community Impact: A violation through a single incident or series
+of actions.
+Consequence: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or
+permanent ban.
+3. Temporary Ban
+Community Impact: A serious violation of community standards, including
+sustained inappropriate behavior.
+Consequence: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+4. Permanent Ban
+Community Impact: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior,  harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+Consequence: A permanent ban from any sort of public interaction within
+the community.
+Attribution
+This Code of Conduct is adapted from the Contributor Covenant,
+version 2.0, available at
+https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+Community Impact Guidelines were inspired by Mozilla’s code of conduct
+enforcement ladder.
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at
+https://www.contributor-covenant.org/translations.
\ No newline at end of file
diff --git a/redis-stable/CONTRIBUTING b/redis-stable/CONTRIBUTING
new file mode 100644
index 00000000..50d56786
--- /dev/null
+++ b/redis-stable/CONTRIBUTING
@@ -0,0 +1,74 @@
+Note: by contributing code to the Redis project in any form, including sending
+a pull request via Github, a code fragment or patch via private email or
+public discussion groups, you agree to release your code under the terms
+of the BSD license that you can find in the COPYING file included in the Redis
+source distribution. You will include BSD license in the COPYING file within
+each source file that you contribute.
+
+# IMPORTANT: HOW TO USE REDIS GITHUB ISSUES
+
+Github issues SHOULD ONLY BE USED to report bugs, and for DETAILED feature
+requests. Everything else belongs to the Redis Google Group:
+      
+    https://groups.google.com/forum/m/#!forum/Redis-db
+
+PLEASE DO NOT POST GENERAL QUESTIONS that are not about bugs or suspected
+bugs in the Github issues system. We'll be very happy to help you and provide
+all the support in the mailing list.
+
+There is also an active community of Redis users at Stack Overflow:
+
+    http://stackoverflow.com/questions/tagged/redis
+
+# Reporting Security Bugs
+
+*If you are reporting a security bug*, please contact the core team privately
+by emailing redis@redis.io. Your report will be acknowledged by a core team
+member and once the report has been reviewed you will receive a more detailed
+response including next steps.
+
+If you do not receive a reply you can escalate to the Redis Google Group,
+linked above. Because this group is a public space please do not disclose the
+issue in detail, only say that you are trying to reach the core team for a
+security issue.
+
+Redis follows a responsible disclosure process:
+
+1. Reports are reviewed and analyzed privately
+2. Patches are prepared for supported versions of Redis
+3. Vendor lists are notified with an embargo date to reduce the public impact
+4. We push a fix release and your bug can be posted publicly with credit in
+   release notes and the version history (and our thanks!)
+
+  Issues and pull requests for documentation belong on the redis-doc repo:
+
+      https://github.com/redis/redis-doc
+
+# How to provide a patch for a new feature
+
+1. If it is a major feature or a semantical change, please don't start coding
+straight away: if your feature is not a conceptual fit you'll lose a lot of
+time writing the code without any reason. Start by posting in the mailing list
+and creating an issue at Github with the description of, exactly, what you want
+to accomplish and why. Use cases are important for features to be accepted.
+Here you'll see if there is consensus about your idea.
+
+2. If in step 1 you get an acknowledgment from the project leaders, use the
+   following procedure to submit a patch:
+
+    a. Fork Redis on github ( http://help.github.com/fork-a-repo/ )
+    b. Create a topic branch (git checkout -b my_branch)
+    c. Push to your branch (git push origin my_branch)
+    d. Initiate a pull request on github ( https://help.github.com/articles/creating-a-pull-request/ )
+    e. Done :)
+
+3. Keep in mind that we are very overloaded, so issues and PRs sometimes wait
+for a *very* long time. However this is not lack of interest, as the project
+gets more and more users, we find ourselves in a constant need to prioritize
+certain issues/PRs over others. If you think your issue/PR is very important
+try to popularize it, have other users commenting and sharing their point of
+view and so forth. This helps.
+
+4. For minor fixes just open a pull request on Github.
+
+Thanks!
diff --git a/redis-stable/COPYING b/redis-stable/COPYING
new file mode 100644
index 00000000..a381681a
--- /dev/null
+++ b/redis-stable/COPYING
@@ -0,0 +1,10 @@
+Copyright (c) 2006-2020, Salvatore Sanfilippo
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+    * Neither the name of Redis nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/INSTALL b/redis-stable/INSTALL
new file mode 100644
index 00000000..3083f1af
--- /dev/null
+++ b/redis-stable/INSTALL
@@ -0,0 +1 @@
+See README
diff --git a/redis-stable/MANIFESTO b/redis-stable/MANIFESTO
new file mode 100644
index 00000000..37278946
--- /dev/null
+++ b/redis-stable/MANIFESTO
@@ -0,0 +1,106 @@
+[Note: this is the Redis manifesto, for general information about
+       installing and running Redis read the README file instead.]
+
+Redis Manifesto
+===============
+
+1 - A DSL for Abstract Data Types. Redis is a DSL (Domain Specific Language)
+    that manipulates abstract data types and implemented as a TCP daemon.
+    Commands manipulate a key space where keys are binary-safe strings and
+    values are different kinds of abstract data types. Every data type
+    represents an abstract version of a fundamental data structure. For instance
+    Redis Lists are an abstract representation of linked lists. In Redis, the
+    essence of a data type isn't just the kind of operations that the data types
+    support, but also the space and time complexity of the data type and the
+    operations performed upon it.
+
+2 - Memory storage is #1. The Redis data set, composed of defined key-value
+    pairs, is primarily stored in the computer's memory. The amount of memory in
+    all kinds of computers, including entry-level servers, is increasing
+    significantly each year. Memory is fast, and allows Redis to have very
+    predictable performance. Datasets composed of 10k or 40 millions keys will
+    perform similarly. Complex data types like Redis Sorted Sets are easy to
+    implement and manipulate in memory with good performance, making Redis very
+    simple. Redis will continue to explore alternative options (where data can
+    be optionally stored on disk, say) but the main goal of the project remains
+    the development of an in-memory database.
+
+3 - Fundamental data structures for a fundamental API. The Redis API is a direct
+    consequence of fundamental data structures. APIs can often be arbitrary but
+    not an API that resembles the nature of fundamental data structures. If we
+    ever meet intelligent life forms from another part of the universe, they'll
+    likely know, understand and recognize the same basic data structures we have
+    in our computer science books. Redis will avoid intermediate layers in API,
+    so that the complexity is obvious and more complex operations can be
+    performed as the sum of the basic operations.
+
+4 - We believe in code efficiency. Computers get faster and faster, yet we
+    believe that abusing computing capabilities is not wise: the amount of
+    operations you can do for a given amount of energy remains anyway a
+    significant parameter: it allows to do more with less computers and, at
+    the same time, having a smaller environmental impact. Similarly Redis is
+    able to "scale down" to smaller devices. It is perfectly usable in a
+    Raspberry Pi and other small ARM based computers. Faster code having
+    just the layers of abstractions that are really needed will also result,
+    often, in more predictable performances. We think likewise about memory
+    usage, one of the fundamental goals of the Redis project is to
+    incrementally build more and more memory efficient data structures, so that
+    problems that were not approachable in RAM in the past will be perfectly
+    fine to handle in the future.
+
+5 - Code is like a poem; it's not just something we write to reach some
+    practical result. Sometimes people that are far from the Redis philosophy
+    suggest using other code written by other authors (frequently in other
+    languages) in order to implement something Redis currently lacks. But to us
+    this is like if Shakespeare decided to end Enrico IV using the Paradiso from
+    the Divina Commedia. Is using any external code a bad idea? Not at all. Like
+    in "One Thousand and One Nights" smaller self contained stories are embedded
+    in a bigger story, we'll be happy to use beautiful self contained libraries
+    when needed. At the same time, when writing the Redis story we're trying to
+    write smaller stories that will fit in to other code.
+
+6 - We're against complexity. We believe designing systems is a fight against
+    complexity. We'll accept to fight the complexity when it's worthwhile but
+    we'll try hard to recognize when a small feature is not worth 1000s of lines
+    of code. Most of the time the best way to fight complexity is by not
+    creating it at all. Complexity is also a form of lock-in: code that is
+    very hard to understand cannot be modified by users in an independent way
+    regardless of the license. One of the main Redis goals is to remain
+    understandable, enough for a single programmer to have a clear idea of how
+    it works in detail just reading the source code for a couple of weeks.
+
+7 - Threading is not a silver bullet. Instead of making Redis threaded we
+    believe on the idea of an efficient (mostly) single threaded Redis core.
+    Multiple of such cores, that may run in the same computer or may run
+    in multiple computers, are abstracted away as a single big system by
+    higher order protocols and features: Redis Cluster and the upcoming
+    Redis Proxy are our main goals. A shared nothing approach is not just
+    much simpler (see the previous point in this document), is also optimal
+    in NUMA systems. In the specific case of Redis it allows for each instance
+    to have a more limited amount of data, making the Redis persist-by-fork
+    approach more sounding. In the future we may explore parallelism only for
+    I/O, which is the low hanging fruit: minimal complexity could provide an
+    improved single process experience.
+
+8 - Two levels of API. The Redis API has two levels: 1) a subset of the API fits
+    naturally into a distributed version of Redis and 2) a more complex API that
+    supports multi-key operations. Both are useful if used judiciously but
+    there's no way to make the more complex multi-keys API distributed in an
+    opaque way without violating our other principles. We don't want to provide
+    the illusion of something that will work magically when actually it can't in
+    all cases. Instead we'll provide commands to quickly migrate keys from one
+    instance to another to perform multi-key operations and expose the
+    trade-offs to the user.
+
+9 - We optimize for joy. We believe writing code is a lot of hard work, and the
+    only way it can be worth is by enjoying it. When there is no longer joy in
+    writing code, the best thing to do is stop. To prevent this, we'll avoid
+    taking paths that will make Redis less of a joy to develop.
+
+10 - All the above points are put together in what we call opportunistic
+     programming: trying to get the most for the user with minimal increases
+     in complexity (hanging fruits). Solve 95% of the problem with 5% of the
+     code when it is acceptable. Avoid a fixed schedule but follow the flow of
+     user requests, inspiration, Redis internal readiness for certain features
+     (sometimes many past changes reach a critical point making a previously
+     complex feature very easy to obtain).
diff --git a/redis-stable/Makefile b/redis-stable/Makefile
new file mode 100644
index 00000000..e614ede8
--- /dev/null
+++ b/redis-stable/Makefile
@@ -0,0 +1,11 @@
+# Top level makefile, the real shit is at src/Makefile
+
+default: all
+
+.DEFAULT:
+	cd src && $(MAKE) $@
+
+install:
+	cd src && $(MAKE) $@
+
+.PHONY: install
diff --git a/redis-stable/README.md b/redis-stable/README.md
new file mode 100644
index 00000000..87225b34
--- /dev/null
+++ b/redis-stable/README.md
@@ -0,0 +1,487 @@
+This README is just a fast *quick start* document. You can find more detailed documentation at [redis.io](https://redis.io).
+
+What is Redis?
+--------------
+
+Redis is often referred to as a *data structures* server. What this means is that Redis provides access to mutable data structures via a set of commands, which are sent using a *server-client* model with TCP sockets and a simple protocol. So different processes can query and modify the same data structures in a shared way.
+
+Data structures implemented into Redis have a few special properties:
+
+* Redis cares to store them on disk, even if they are always served and modified into the server memory. This means that Redis is fast, but that it is also non-volatile.
+* The implementation of data structures emphasizes memory efficiency, so data structures inside Redis will likely use less memory compared to the same data structure modelled using a high-level programming language.
+* Redis offers a number of features that are natural to find in a database, like replication, tunable levels of durability, clustering, and high availability.
+
+Another good example is to think of Redis as a more complex version of memcached, where the operations are not just SETs and GETs, but operations that work with complex data types like Lists, Sets, ordered data structures, and so forth.
+
+If you want to know more, this is a list of selected starting points:
+
+* Introduction to Redis data types. https://redis.io/topics/data-types-intro
+* Try Redis directly inside your browser. http://try.redis.io
+* The full list of Redis commands. https://redis.io/commands
+* There is much more inside the official Redis documentation. https://redis.io/documentation
+
+Building Redis
+--------------
+
+Redis can be compiled and used on Linux, OSX, OpenBSD, NetBSD, FreeBSD.
+We support big endian and little endian architectures, and both 32 bit
+and 64 bit systems.
+
+It may compile on Solaris derived systems (for instance SmartOS) but our
+support for this platform is *best effort* and Redis is not guaranteed to
+work as well as in Linux, OSX, and \*BSD.
+
+It is as simple as:
+
+    % make
+
+To build with TLS support, you'll need OpenSSL development libraries (e.g.
+libssl-dev on Debian/Ubuntu) and run:
+
+    % make BUILD_TLS=yes
+
+To build with systemd support, you'll need systemd development libraries (such 
+as libsystemd-dev on Debian/Ubuntu or systemd-devel on CentOS) and run:
+
+    % make USE_SYSTEMD=yes
+
+To append a suffix to Redis program names, use:
+
+    % make PROG_SUFFIX="-alt"
+
+You can build a 32 bit Redis binary using:
+
+    % make 32bit
+
+After building Redis, it is a good idea to test it using:
+
+    % make test
+
+If TLS is built, running the tests with TLS enabled (you will need `tcl-tls`
+installed):
+
+    % ./utils/gen-test-certs.sh
+    % ./runtest --tls
+
+
+Fixing build problems with dependencies or cached build options
+---------
+
+Redis has some dependencies which are included in the `deps` directory.
+`make` does not automatically rebuild dependencies even if something in
+the source code of dependencies changes.
+
+When you update the source code with `git pull` or when code inside the
+dependencies tree is modified in any other way, make sure to use the following
+command in order to really clean everything and rebuild from scratch:
+
+    make distclean
+
+This will clean: jemalloc, lua, hiredis, linenoise.
+
+Also if you force certain build options like 32bit target, no C compiler
+optimizations (for debugging purposes), and other similar build time options,
+those options are cached indefinitely until you issue a `make distclean`
+command.
+
+Fixing problems building 32 bit binaries
+---------
+
+If after building Redis with a 32 bit target you need to rebuild it
+with a 64 bit target, or the other way around, you need to perform a
+`make distclean` in the root directory of the Redis distribution.
+
+In case of build errors when trying to build a 32 bit binary of Redis, try
+the following steps:
+
+* Install the package libc6-dev-i386 (also try g++-multilib).
+* Try using the following command line instead of `make 32bit`:
+  `make CFLAGS="-m32 -march=native" LDFLAGS="-m32"`
+
+Allocator
+---------
+
+Selecting a non-default memory allocator when building Redis is done by setting
+the `MALLOC` environment variable. Redis is compiled and linked against libc
+malloc by default, with the exception of jemalloc being the default on Linux
+systems. This default was picked because jemalloc has proven to have fewer
+fragmentation problems than libc malloc.
+
+To force compiling against libc malloc, use:
+
+    % make MALLOC=libc
+
+To compile against jemalloc on Mac OS X systems, use:
+
+    % make MALLOC=jemalloc
+
+Monotonic clock
+---------------
+
+By default, Redis will build using the POSIX clock_gettime function as the
+monotonic clock source.  On most modern systems, the internal processor clock
+can be used to improve performance.  Cautions can be found here: 
+    http://oliveryang.net/2015/09/pitfalls-of-TSC-usage/
+
+To build with support for the processor's internal instruction clock, use:
+
+    % make CFLAGS="-DUSE_PROCESSOR_CLOCK"
+
+Verbose build
+-------------
+
+Redis will build with a user-friendly colorized output by default.
+If you want to see a more verbose output, use the following:
+
+    % make V=1
+
+Running Redis
+-------------
+
+To run Redis with the default configuration, just type:
+
+    % cd src
+    % ./redis-server
+
+If you want to provide your redis.conf, you have to run it using an additional
+parameter (the path of the configuration file):
+
+    % cd src
+    % ./redis-server /path/to/redis.conf
+
+It is possible to alter the Redis configuration by passing parameters directly
+as options using the command line. Examples:
+
+    % ./redis-server --port 9999 --replicaof 127.0.0.1 6379
+    % ./redis-server /etc/redis/6379.conf --loglevel debug
+
+All the options in redis.conf are also supported as options using the command
+line, with exactly the same name.
+
+Running Redis with TLS:
+------------------
+
+Please consult the [TLS.md](TLS.md) file for more information on
+how to use Redis with TLS.
+
+Playing with Redis
+------------------
+
+You can use redis-cli to play with Redis. Start a redis-server instance,
+then in another terminal try the following:
+
+    % cd src
+    % ./redis-cli
+    redis> ping
+    PONG
+    redis> set foo bar
+    OK
+    redis> get foo
+    "bar"
+    redis> incr mycounter
+    (integer) 1
+    redis> incr mycounter
+    (integer) 2
+    redis>
+
+You can find the list of all the available commands at https://redis.io/commands.
+
+Installing Redis
+-----------------
+
+In order to install Redis binaries into /usr/local/bin, just use:
+
+    % make install
+
+You can use `make PREFIX=/some/other/directory install` if you wish to use a
+different destination.
+
+Make install will just install binaries in your system, but will not configure
+init scripts and configuration files in the appropriate place. This is not
+needed if you just want to play a bit with Redis, but if you are installing
+it the proper way for a production system, we have a script that does this
+for Ubuntu and Debian systems:
+
+    % cd utils
+    % ./install_server.sh
+
+_Note_: `install_server.sh` will not work on Mac OSX; it is built for Linux only.
+
+The script will ask you a few questions and will setup everything you need
+to run Redis properly as a background daemon that will start again on
+system reboots.
+
+You'll be able to stop and start Redis using the script named
+`/etc/init.d/redis_<portnumber>`, for instance `/etc/init.d/redis_6379`.
+
+Code contributions
+-----------------
+
+Note: By contributing code to the Redis project in any form, including sending
+a pull request via Github, a code fragment or patch via private email or
+public discussion groups, you agree to release your code under the terms
+of the BSD license that you can find in the [COPYING][1] file included in the Redis
+source distribution.
+
+Please see the [CONTRIBUTING][2] file in this source distribution for more
+information, including details on our process for security bugs/vulnerabilities.
+
+[1]: https://github.com/redis/redis/blob/unstable/COPYING
+[2]: https://github.com/redis/redis/blob/unstable/CONTRIBUTING
+
+Redis internals
+===
+
+If you are reading this README you are likely in front of a Github page
+or you just untarred the Redis distribution tar ball. In both the cases
+you are basically one step away from the source code, so here we explain
+the Redis source code layout, what is in each file as a general idea, the
+most important functions and structures inside the Redis server and so forth.
+We keep all the discussion at a high level without digging into the details
+since this document would be huge otherwise and our code base changes
+continuously, but a general idea should be a good starting point to
+understand more. Moreover most of the code is heavily commented and easy
+to follow.
+
+Source code layout
+---
+
+The Redis root directory just contains this README, the Makefile which
+calls the real Makefile inside the `src` directory and an example
+configuration for Redis and Sentinel. You can find a few shell
+scripts that are used in order to execute the Redis, Redis Cluster and
+Redis Sentinel unit tests, which are implemented inside the `tests`
+directory.
+
+Inside the root are the following important directories:
+
+* `src`: contains the Redis implementation, written in C.
+* `tests`: contains the unit tests, implemented in Tcl.
+* `deps`: contains libraries Redis uses. Everything needed to compile Redis is inside this directory; your system just needs to provide `libc`, a POSIX compatible interface and a C compiler. Notably `deps` contains a copy of `jemalloc`, which is the default allocator of Redis under Linux. Note that under `deps` there are also things which started with the Redis project, but for which the main repository is not `redis/redis`.
+
+There are a few more directories but they are not very important for our goals
+here. We'll focus mostly on `src`, where the Redis implementation is contained,
+exploring what there is inside each file. The order in which files are
+exposed is the logical one to follow in order to disclose different layers
+of complexity incrementally.
+
+Note: lately Redis was refactored quite a bit. Function names and file
+names have been changed, so you may find that this documentation reflects the
+`unstable` branch more closely. For instance, in Redis 3.0 the `server.c`
+and `server.h` files were named `redis.c` and `redis.h`. However the overall
+structure is the same. Keep in mind that all the new developments and pull
+requests should be performed against the `unstable` branch.
+
+server.h
+---
+
+The simplest way to understand how a program works is to understand the
+data structures it uses. So we'll start from the main header file of
+Redis, which is `server.h`.
+
+All the server configuration and in general all the shared state is
+defined in a global structure called `server`, of type `struct redisServer`.
+A few important fields in this structure are:
+
+* `server.db` is an array of Redis databases, where data is stored.
+* `server.commands` is the command table.
+* `server.clients` is a linked list of clients connected to the server.
+* `server.master` is a special client, the master, if the instance is a replica.
+
+There are tons of other fields. Most fields are commented directly inside
+the structure definition.
+
+Another important Redis data structure is the one defining a client.
+In the past it was called `redisClient`, now just `client`. The structure
+has many fields, here we'll just show the main ones:
+```c
+struct client {
+    int fd;
+    sds querybuf;
+    int argc;
+    robj **argv;
+    redisDb *db;
+    int flags;
+    list *reply;
+    char buf[PROTO_REPLY_CHUNK_BYTES];
+    // ... many other fields ...
+}
+```
+The client structure defines a *connected client*:
+
+* The `fd` field is the client socket file descriptor.
+* `argc` and `argv` are populated with the command the client is executing, so that functions implementing a given Redis command can read the arguments.
+* `querybuf` accumulates the requests from the client, which are parsed by the Redis server according to the Redis protocol and executed by calling the implementations of the commands the client is executing.
+* `reply` and `buf` are dynamic and static buffers that accumulate the replies the server sends to the client. These buffers are incrementally written to the socket as soon as the file descriptor is writeable.
+
+As you can see in the client structure above, arguments in a command
+are described as `robj` structures. The following is the full `robj`
+structure, which defines a *Redis object*:
+
+    typedef struct redisObject {
+        unsigned type:4;
+        unsigned encoding:4;
+        unsigned lru:LRU_BITS; /* lru time (relative to server.lruclock) */
+        int refcount;
+        void *ptr;
+    } robj;
+
+Basically this structure can represent all the basic Redis data types like
+strings, lists, sets, sorted sets and so forth. The interesting thing is that
+it has a `type` field, so that it is possible to know what type a given
+object has, and a `refcount`, so that the same object can be referenced
+in multiple places without allocating it multiple times. Finally the `ptr`
+field points to the actual representation of the object, which might vary
+even for the same type, depending on the `encoding` used.
+
+Redis objects are used extensively in the Redis internals, however in order
+to avoid the overhead of indirect accesses, recently in many places
+we just use plain dynamic strings not wrapped inside a Redis object.
+
+server.c
+---
+
+This is the entry point of the Redis server, where the `main()` function
+is defined. The following are the most important steps in order to startup
+the Redis server.
+
+* `initServerConfig()` sets up the default values of the `server` structure.
+* `initServer()` allocates the data structures needed to operate, setup the listening socket, and so forth.
+* `aeMain()` starts the event loop which listens for new connections.
+
+There are two special functions called periodically by the event loop:
+
+1. `serverCron()` is called periodically (according to `server.hz` frequency), and performs tasks that must be performed from time to time, like checking for timed out clients.
+2. `beforeSleep()` is called every time the event loop fired, Redis served a few requests, and is returning back into the event loop.
+
+Inside server.c you can find code that handles other vital things of the Redis server:
+
+* `call()` is used in order to call a given command in the context of a given client.
+* `activeExpireCycle()` handles eviction of keys with a time to live set via the `EXPIRE` command.
+* `performEvictions()` is called when a new write command should be performed but Redis is out of memory according to the `maxmemory` directive.
+* The global variable `redisCommandTable` defines all the Redis commands, specifying the name of the command, the function implementing the command, the number of arguments required, and other properties of each command.
+
+networking.c
+---
+
+This file defines all the I/O functions with clients, masters and replicas
+(which in Redis are just special clients):
+
+* `createClient()` allocates and initializes a new client.
+* the `addReply*()` family of functions are used by command implementations in order to append data to the client structure, that will be transmitted to the client as a reply for a given command executed.
+* `writeToClient()` transmits the data pending in the output buffers to the client and is called by the *writable event handler* `sendReplyToClient()`.
+* `readQueryFromClient()` is the *readable event handler* and accumulates data read from the client into the query buffer.
+* `processInputBuffer()` is the entry point in order to parse the client query buffer according to the Redis protocol. Once commands are ready to be processed, it calls `processCommand()` which is defined inside `server.c` in order to actually execute the command.
+* `freeClient()` deallocates, disconnects and removes a client.
+
+aof.c and rdb.c
+---
+
+As you can guess from the names, these files implement the RDB and AOF
+persistence for Redis. Redis uses a persistence model based on the `fork()`
+system call in order to create a thread with the same (shared) memory
+content of the main Redis thread. This secondary thread dumps the content
+of the memory on disk. This is used by `rdb.c` to create the snapshots
+on disk and by `aof.c` in order to perform the AOF rewrite when the
+append only file gets too big.
+
+The implementation inside `aof.c` has additional functions in order to
+implement an API that allows commands to append new commands into the AOF
+file as clients execute them.
+
+The `call()` function defined inside `server.c` is responsible for calling
+the functions that in turn will write the commands into the AOF.
+
+db.c
+---
+
+Certain Redis commands operate on specific data types; others are general.
+Examples of generic commands are `DEL` and `EXPIRE`. They operate on keys
+and not on their values specifically. All those generic commands are
+defined inside `db.c`.
+
+Moreover `db.c` implements an API in order to perform certain operations
+on the Redis dataset without directly accessing the internal data structures.
+
+The most important functions inside `db.c` which are used in many command
+implementations are the following:
+
+* `lookupKeyRead()` and `lookupKeyWrite()` are used in order to get a pointer to the value associated to a given key, or `NULL` if the key does not exist.
+* `dbAdd()` and its higher level counterpart `setKey()` create a new key in a Redis database.
+* `dbDelete()` removes a key and its associated value.
+* `emptyDb()` removes an entire single database or all the databases defined.
+
+The rest of the file implements the generic commands exposed to the client.
+
+object.c
+---
+
+The `robj` structure defining Redis objects was already described. Inside
+`object.c` there are all the functions that operate with Redis objects at
+a basic level, like functions to allocate new objects, handle the reference
+counting and so forth. Notable functions inside this file:
+
+* `incrRefCount()` and `decrRefCount()` are used in order to increment or decrement an object reference count. When it drops to 0 the object is finally freed.
+* `createObject()` allocates a new object. There are also specialized functions to allocate string objects having a specific content, like `createStringObjectFromLongLong()` and similar functions.
+
+This file also implements the `OBJECT` command.
+
+replication.c
+---
+
+This is one of the most complex files inside Redis, it is recommended to
+approach it only after getting a bit familiar with the rest of the code base.
+In this file there is the implementation of both the master and replica role
+of Redis.
+
+One of the most important functions inside this file is `replicationFeedSlaves()` that writes commands to the clients representing replica instances connected
+to our master, so that the replicas can get the writes performed by the clients:
+this way their data set will remain synchronized with the one in the master.
+
+This file also implements both the `SYNC` and `PSYNC` commands that are
+used in order to perform the first synchronization between masters and
+replicas, or to continue the replication after a disconnection.
+
+Other C files
+---
+
+* `t_hash.c`, `t_list.c`, `t_set.c`, `t_string.c`, `t_zset.c` and `t_stream.c` contains the implementation of the Redis data types. They implement both an API to access a given data type, and the client command implementations for these data types.
+* `ae.c` implements the Redis event loop, it's a self contained library which is simple to read and understand.
+* `sds.c` is the Redis string library, check http://github.com/antirez/sds for more information.
+* `anet.c` is a library to use POSIX networking in a simpler way compared to the raw interface exposed by the kernel.
+* `dict.c` is an implementation of a non-blocking hash table which rehashes incrementally.
+* `scripting.c` implements Lua scripting. It is completely self-contained and isolated from the rest of the Redis implementation and is simple enough to understand if you are familiar with the Lua API.
+* `cluster.c` implements the Redis Cluster. Probably a good read only after being very familiar with the rest of the Redis code base. If you want to read `cluster.c` make sure to read the [Redis Cluster specification][3].
+
+[3]: https://redis.io/topics/cluster-spec
+
+Anatomy of a Redis command
+---
+
+All the Redis commands are defined in the following way:
+
+    void foobarCommand(client *c) {
+        printf("%s",c->argv[1]->ptr); /* Do something with the argument. */
+        addReply(c,shared.ok); /* Reply something to the client. */
+    }
+
+The command is then referenced inside `server.c` in the command table:
+
+    {"foobar",foobarCommand,2,"rtF",0,NULL,0,0,0,0,0},
+
+In the above example `2` is the number of arguments the command takes,
+while `"rtF"` are the command flags, as documented in the command table
+top comment inside `server.c`.
+
+After the command operates in some way, it returns a reply to the client,
+usually using `addReply()` or a similar function defined inside `networking.c`.
+
+There are tons of command implementations inside the Redis source code
+that can serve as examples of actual commands implementations. Writing
+a few toy commands can be a good exercise to get familiar with the code base.
+
+There are also many other files not described here, but it is useless to
+cover everything. We just want to help you with the first steps.
+Eventually you'll find your way inside the Redis code base :-)
+
+Enjoy!
diff --git a/redis-stable/TLS.md b/redis-stable/TLS.md
new file mode 100644
index 00000000..2d020d0c
--- /dev/null
+++ b/redis-stable/TLS.md
@@ -0,0 +1,87 @@
+TLS Support
+===========
+
+Getting Started
+---------------
+
+### Building
+
+To build with TLS support you'll need OpenSSL development libraries (e.g.
+libssl-dev on Debian/Ubuntu).
+
+Run `make BUILD_TLS=yes`.
+
+### Tests
+
+To run Redis test suite with TLS, you'll need TLS support for TCL (i.e.
+`tcl-tls` package on Debian/Ubuntu).
+
+1. Run `./utils/gen-test-certs.sh` to generate a root CA and a server
+   certificate.
+
+2. Run `./runtest --tls` or `./runtest-cluster --tls` to run Redis and Redis
+   Cluster tests in TLS mode.
+
+### Running manually
+
+To manually run a Redis server with TLS mode (assuming `gen-test-certs.sh` was
+invoked so sample certificates/keys are available):
+
+    ./src/redis-server --tls-port 6379 --port 0 \
+        --tls-cert-file ./tests/tls/redis.crt \
+        --tls-key-file ./tests/tls/redis.key \
+        --tls-ca-cert-file ./tests/tls/ca.crt
+
+To connect to this Redis server with `redis-cli`:
+
+    ./src/redis-cli --tls \
+        --cert ./tests/tls/redis.crt \
+        --key ./tests/tls/redis.key \
+        --cacert ./tests/tls/ca.crt
+
+This will disable TCP and enable TLS on port 6379. It's also possible to have
+both TCP and TLS available, but you'll need to assign different ports.
+
+To make a Replica connect to the master using TLS, use `--tls-replication yes`,
+and to make Redis Cluster use TLS across nodes use `--tls-cluster yes`.
+
+Connections
+-----------
+
+All socket operations now go through a connection abstraction layer that hides
+I/O and read/write event handling from the caller.
+
+**Multi-threading I/O is not currently supported for TLS**, as a TLS connection
+needs to do its own manipulation of AE events which is not thread safe. The
+solution is probably to manage independent AE loops for I/O threads and longer
+term association of connections with threads. This may potentially improve
+overall performance as well.
+
+Sync IO for TLS is currently implemented in a hackish way, i.e. making the
+socket blocking and configuring socket-level timeout.  This means the timeout
+value may not be so accurate, and there would be a lot of syscall overhead.
+However I believe that getting rid of syncio completely in favor of pure async
+work is probably a better move than trying to fix that. For replication it would
+probably not be so hard. For cluster keys migration it might be more difficult,
+but there are probably other good reasons to improve that part anyway.
+
+To-Do List
+----------
+
+- [ ] redis-benchmark support. The current implementation is a mix of using
+  hiredis for parsing and basic networking (establishing connections), but
+  directly manipulating sockets for most actions. This will need to be cleaned
+  up for proper TLS support. The best approach is probably to migrate to hiredis
+  async mode.
+- [ ] redis-cli `--slave` and `--rdb` support.
+
+Multi-port
+----------
+
+Consider the implications of allowing TLS to be configured on a separate port,
+making Redis listening on multiple ports:
+
+1. Startup banner port notification
+2. Proctitle
+3. How slaves announce themselves
+4. Cluster bus port calculation
diff --git a/redis-stable/deps/Makefile b/redis-stable/deps/Makefile
new file mode 100644
index 00000000..ff16ee9e
--- /dev/null
+++ b/redis-stable/deps/Makefile
@@ -0,0 +1,94 @@
+# Redis dependency Makefile
+
+uname_S:= $(shell sh -c 'uname -s 2>/dev/null || echo not')
+
+CCCOLOR="\033[34m"
+LINKCOLOR="\033[34;1m"
+SRCCOLOR="\033[33m"
+BINCOLOR="\033[37;1m"
+MAKECOLOR="\033[32;1m"
+ENDCOLOR="\033[0m"
+
+default:
+	@echo "Explicit target required"
+
+.PHONY: default
+
+# Prerequisites target
+.make-prerequisites:
+	@touch $@
+
+# Clean everything when CFLAGS is different
+ifneq ($(shell sh -c '[ -f .make-cflags ] && cat .make-cflags || echo none'), $(CFLAGS))
+.make-cflags: distclean
+	-(echo "$(CFLAGS)" > .make-cflags)
+.make-prerequisites: .make-cflags
+endif
+
+# Clean everything when LDFLAGS is different
+ifneq ($(shell sh -c '[ -f .make-ldflags ] && cat .make-ldflags || echo none'), $(LDFLAGS))
+.make-ldflags: distclean
+	-(echo "$(LDFLAGS)" > .make-ldflags)
+.make-prerequisites: .make-ldflags
+endif
+
+distclean:
+	-(cd hiredis && $(MAKE) clean) > /dev/null || true
+	-(cd linenoise && $(MAKE) clean) > /dev/null || true
+	-(cd lua && $(MAKE) clean) > /dev/null || true
+	-(cd jemalloc && [ -f Makefile ] && $(MAKE) distclean) > /dev/null || true
+	-(cd hdr_histogram && $(MAKE) clean) > /dev/null || true
+	-(rm -f .make-*)
+
+.PHONY: distclean
+
+ifeq ($(BUILD_TLS),yes)
+    HIREDIS_MAKE_FLAGS = USE_SSL=1
+endif
+
+hiredis: .make-prerequisites
+	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
+	cd hiredis && $(MAKE) static $(HIREDIS_MAKE_FLAGS)
+
+.PHONY: hiredis
+
+linenoise: .make-prerequisites
+	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
+	cd linenoise && $(MAKE)
+
+.PHONY: linenoise
+
+hdr_histogram: .make-prerequisites
+	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
+	cd hdr_histogram && $(MAKE)
+
+.PHONY: hdr_histogram
+
+ifeq ($(uname_S),SunOS)
+	# Make isinf() available
+	LUA_CFLAGS= -D__C99FEATURES__=1
+endif
+
+LUA_CFLAGS+= -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC='' -DLUA_USE_MKSTEMP $(CFLAGS)
+LUA_LDFLAGS+= $(LDFLAGS)
+# lua's Makefile defines AR="ar rcu", which is unusual, and makes it more
+# challenging to cross-compile lua (and redis).  These defines make it easier
+# to fit redis into cross-compilation environments, which typically set AR.
+AR=ar
+ARFLAGS=rc
+
+lua: .make-prerequisites
+	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
+	cd lua/src && $(MAKE) all CFLAGS="$(LUA_CFLAGS)" MYLDFLAGS="$(LUA_LDFLAGS)" AR="$(AR) $(ARFLAGS)"
+
+.PHONY: lua
+
+JEMALLOC_CFLAGS= -std=gnu99 -Wall -pipe -g3 -O3 -funroll-loops $(CFLAGS)
+JEMALLOC_LDFLAGS= $(LDFLAGS)
+
+jemalloc: .make-prerequisites
+	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
+	cd jemalloc && ./configure --with-version=5.1.0-0-g0 --with-lg-quantum=3 --with-jemalloc-prefix=je_ CFLAGS="$(JEMALLOC_CFLAGS)" LDFLAGS="$(JEMALLOC_LDFLAGS)"
+	cd jemalloc && $(MAKE) CFLAGS="$(JEMALLOC_CFLAGS)" LDFLAGS="$(JEMALLOC_LDFLAGS)" lib/libjemalloc.a
+
+.PHONY: jemalloc
diff --git a/redis-stable/deps/README.md b/redis-stable/deps/README.md
new file mode 100644
index 00000000..c3ec424b
--- /dev/null
+++ b/redis-stable/deps/README.md
@@ -0,0 +1,82 @@
+This directory contains all Redis dependencies, except for the libc that
+should be provided by the operating system.
+
+* **Jemalloc** is our memory allocator, used as replacement for libc malloc on Linux by default. It has good performances and excellent fragmentation behavior. This component is upgraded from time to time.
+* **hiredis** is the official C client library for Redis. It is used by redis-cli, redis-benchmark and Redis Sentinel. It is part of the Redis official ecosystem but is developed externally from the Redis repository, so we just upgrade it as needed.
+* **linenoise** is a readline replacement. It is developed by the same authors of Redis but is managed as a separated project and updated as needed.
+* **lua** is Lua 5.1 with minor changes for security and additional libraries.
+
+How to upgrade the above dependencies
+===
+
+Jemalloc
+---
+
+Jemalloc is modified with changes that allow us to implement the Redis
+active defragmentation logic. However this feature of Redis is not mandatory
+and Redis is able to understand if the Jemalloc version it is compiled
+against supports such Redis-specific modifications. So in theory, if you
+are not interested in the active defragmentation, you can replace Jemalloc
+just following these steps:
+
+1. Remove the jemalloc directory.
+2. Substitute it with the new jemalloc source tree.
+3. Edit the Makefile located in the same directory as the README you are
+   reading, and change the --with-version in the Jemalloc configure script
+   options with the version you are using. This is required because otherwise
+   Jemalloc configuration script is broken and will not work nested in another
+   git repository.
+
+However note that we change Jemalloc settings via the `configure` script of Jemalloc using the `--with-lg-quantum` option, setting it to the value of 3 instead of 4. This provides us with more size classes that better suit the Redis data structures, in order to gain memory efficiency.
+
+If you want to upgrade Jemalloc while also providing support for
+active defragmentation, in addition to the above steps you need to perform
+the following additional steps:
+
+5. In Jemalloc tree, file `include/jemalloc/jemalloc_macros.h.in`, make sure
+   to add `#define JEMALLOC_FRAG_HINT`.
+6. Implement the function `je_get_defrag_hint()` inside `src/jemalloc.c`. You
+   can see how it is implemented in the current Jemalloc source tree shipped
+   with Redis, and rewrite it according to the new Jemalloc internals, if they
+   changed, otherwise you could just copy the old implementation if you are
+   upgrading just to a similar version of Jemalloc.
+
+Hiredis
+---
+
+Hiredis uses the SDS string library, that must be the same version used inside Redis itself. Hiredis is also very critical for Sentinel. Historically Redis often used forked versions of hiredis in a way or the other. In order to upgrade it is advised to take a lot of care:
+
+1. Check with diff if hiredis API changed and what impact it could have in Redis.
+2. Make sure that the SDS library inside Hiredis and inside Redis are compatible.
+3. After the upgrade, run the Redis Sentinel test.
+4. Check manually that redis-cli and redis-benchmark behave as expected, since we have no tests for CLI utilities currently.
+
+Linenoise
+---
+
+Linenoise is rarely upgraded as needed. The upgrade process is trivial since
+Redis uses a non modified version of linenoise, so to upgrade just do the
+following:
+
+1. Remove the linenoise directory.
+2. Substitute it with the new linenoise source tree.
+
+Lua
+---
+
+We use Lua 5.1 and no upgrade is planned currently, since we don't want to break
+Lua scripts for new Lua features: in the context of Redis Lua scripts the
+capabilities of 5.1 are usually more than enough, the release is rock solid,
+and we definitely don't want to break old scripts.
+
+So upgrading of Lua is up to the Redis project maintainers and should be a
+manual procedure performed by taking a diff between the different versions.
+
+Currently we have at least the following differences between official Lua 5.1
+and our version:
+
+1. Makefile is modified to allow a different compiler than GCC.
+2. We have the implementation source code, and directly link to the following external libraries: `lua_cjson.o`, `lua_struct.o`, `lua_cmsgpack.o` and `lua_bit.o`.
+3. There is a security fix in `ldo.c`, line 498: The check for `LUA_SIGNATURE[0]` is removed in order to avoid direct bytecode execution.
+
+
diff --git a/redis-stable/deps/hdr_histogram/COPYING.txt b/redis-stable/deps/hdr_histogram/COPYING.txt
new file mode 100644
index 00000000..0e259d42
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/COPYING.txt
@@ -0,0 +1,121 @@
+Creative Commons Legal Code
+
+CC0 1.0 Universal
+
+    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+    HEREUNDER.
+
+Statement of Purpose
+
+The laws of most jurisdictions throughout the world automatically confer
+exclusive Copyright and Related Rights (defined below) upon the creator
+and subsequent owner(s) (each and all, an "owner") of an original work of
+authorship and/or a database (each, a "Work").
+
+Certain owners wish to permanently relinquish those rights to a Work for
+the purpose of contributing to a commons of creative, cultural and
+scientific works ("Commons") that the public can reliably and without fear
+of later claims of infringement build upon, modify, incorporate in other
+works, reuse and redistribute as freely as possible in any form whatsoever
+and for any purposes, including without limitation commercial purposes.
+These owners may contribute to the Commons to promote the ideal of a free
+culture and the further production of creative, cultural and scientific
+works, or to gain reputation or greater distribution for their Work in
+part through the use and efforts of others.
+
+For these and/or other purposes and motivations, and without any
+expectation of additional consideration or compensation, the person
+associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+is an owner of Copyright and Related Rights in the Work, voluntarily
+elects to apply CC0 to the Work and publicly distribute the Work under its
+terms, with knowledge of his or her Copyright and Related Rights in the
+Work and the meaning and intended legal effect of CC0 on those rights.
+
+1. Copyright and Related Rights. A Work made available under CC0 may be
+protected by copyright and related or neighboring rights ("Copyright and
+Related Rights"). Copyright and Related Rights include, but are not
+limited to, the following:
+
+  i. the right to reproduce, adapt, distribute, perform, display,
+     communicate, and translate a Work;
+ ii. moral rights retained by the original author(s) and/or performer(s);
+iii. publicity and privacy rights pertaining to a person's image or
+     likeness depicted in a Work;
+ iv. rights protecting against unfair competition in regards to a Work,
+     subject to the limitations in paragraph 4(a), below;
+  v. rights protecting the extraction, dissemination, use and reuse of data
+     in a Work;
+ vi. database rights (such as those arising under Directive 96/9/EC of the
+     European Parliament and of the Council of 11 March 1996 on the legal
+     protection of databases, and under any national implementation
+     thereof, including any amended or successor version of such
+     directive); and
+vii. other similar, equivalent or corresponding rights throughout the
+     world based on applicable law or treaty, and any national
+     implementations thereof.
+
+2. Waiver. To the greatest extent permitted by, but not in contravention
+of, applicable law, Affirmer hereby overtly, fully, permanently,
+irrevocably and unconditionally waives, abandons, and surrenders all of
+Affirmer's Copyright and Related Rights and associated claims and causes
+of action, whether now known or unknown (including existing as well as
+future claims and causes of action), in the Work (i) in all territories
+worldwide, (ii) for the maximum duration provided by applicable law or
+treaty (including future time extensions), (iii) in any current or future
+medium and for any number of copies, and (iv) for any purpose whatsoever,
+including without limitation commercial, advertising or promotional
+purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+member of the public at large and to the detriment of Affirmer's heirs and
+successors, fully intending that such Waiver shall not be subject to
+revocation, rescission, cancellation, termination, or any other legal or
+equitable action to disrupt the quiet enjoyment of the Work by the public
+as contemplated by Affirmer's express Statement of Purpose.
+
+3. Public License Fallback. Should any part of the Waiver for any reason
+be judged legally invalid or ineffective under applicable law, then the
+Waiver shall be preserved to the maximum extent permitted taking into
+account Affirmer's express Statement of Purpose. In addition, to the
+extent the Waiver is so judged Affirmer hereby grants to each affected
+person a royalty-free, non transferable, non sublicensable, non exclusive,
+irrevocable and unconditional license to exercise Affirmer's Copyright and
+Related Rights in the Work (i) in all territories worldwide, (ii) for the
+maximum duration provided by applicable law or treaty (including future
+time extensions), (iii) in any current or future medium and for any number
+of copies, and (iv) for any purpose whatsoever, including without
+limitation commercial, advertising or promotional purposes (the
+"License"). The License shall be deemed effective as of the date CC0 was
+applied by Affirmer to the Work. Should any part of the License for any
+reason be judged legally invalid or ineffective under applicable law, such
+partial invalidity or ineffectiveness shall not invalidate the remainder
+of the License, and in such case Affirmer hereby affirms that he or she
+will not (i) exercise any of his or her remaining Copyright and Related
+Rights in the Work or (ii) assert any associated claims and causes of
+action with respect to the Work, in either case contrary to Affirmer's
+express Statement of Purpose.
+
+4. Limitations and Disclaimers.
+
+ a. No trademark or patent rights held by Affirmer are waived, abandoned,
+    surrendered, licensed or otherwise affected by this document.
+ b. Affirmer offers the Work as-is and makes no representations or
+    warranties of any kind concerning the Work, express, implied,
+    statutory or otherwise, including without limitation warranties of
+    title, merchantability, fitness for a particular purpose, non
+    infringement, or the absence of latent or other defects, accuracy, or
+    the present or absence of errors, whether or not discoverable, all to
+    the greatest extent permissible under applicable law.
+ c. Affirmer disclaims responsibility for clearing rights of other persons
+    that may apply to the Work or any use thereof, including without
+    limitation any person's Copyright and Related Rights in the Work.
+    Further, Affirmer disclaims responsibility for obtaining any necessary
+    consents, permissions or other rights required for any use of the
+    Work.
+ d. Affirmer understands and acknowledges that Creative Commons is not a
+    party to this document and has no duty or obligation with respect to
+    this CC0 or use of the Work.
diff --git a/redis-stable/deps/hdr_histogram/LICENSE.txt b/redis-stable/deps/hdr_histogram/LICENSE.txt
new file mode 100644
index 00000000..9b4e66ed
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/LICENSE.txt
@@ -0,0 +1,41 @@
+The code in this repository code was Written by Gil Tene, Michael Barker,
+and Matt Warren, and released to the public domain, as explained at
+http://creativecommons.org/publicdomain/zero/1.0/
+
+For users of this code who wish to consume it under the "BSD" license
+rather than under the public domain or CC0 contribution text mentioned
+above, the code found under this directory is *also* provided under the
+following license (commonly referred to as the BSD 2-Clause License). This
+license does not detract from the above stated release of the code into
+the public domain, and simply represents an additional license granted by
+the Author.
+
+-----------------------------------------------------------------------------
+** Beginning of "BSD 2-Clause License" text. **
+
+ Copyright (c) 2012, 2013, 2014 Gil Tene
+ Copyright (c) 2014 Michael Barker
+ Copyright (c) 2014 Matt Warren
+ All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ 1. Redistributions of source code must retain the above copyright notice,
+    this list of conditions and the following disclaimer.
+
+ 2. Redistributions in binary form must reproduce the above copyright notice,
+    this list of conditions and the following disclaimer in the documentation
+    and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/deps/hdr_histogram/Makefile b/redis-stable/deps/hdr_histogram/Makefile
new file mode 100644
index 00000000..83d3760a
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/Makefile
@@ -0,0 +1,20 @@
+STD=
+WARN= -Wall
+OPT= -Os
+
+R_CFLAGS= $(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS)
+R_LDFLAGS= $(LDFLAGS)
+DEBUG= -g
+
+R_CC=$(CC) $(R_CFLAGS)
+R_LD=$(CC) $(R_LDFLAGS)
+
+hdr_histogram.o: hdr_histogram.h hdr_histogram.c 
+
+.c.o:
+	$(R_CC) -c  $< 
+
+clean:
+	rm -f *.o
+
+
diff --git a/redis-stable/deps/hdr_histogram/README.md b/redis-stable/deps/hdr_histogram/README.md
new file mode 100644
index 00000000..5f62c234
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/README.md
@@ -0,0 +1,10 @@
+HdrHistogram_c v0.11.0
+
+----------------------------------------------
+
+This port contains a subset of the 'C' version of High Dynamic Range (HDR) Histogram available at [github.com/HdrHistogram/HdrHistogram_c](https://github.com/HdrHistogram/HdrHistogram_c).
+
+
+The code present on `hdr_histogram.c`, `hdr_histogram.h`, and `hdr_atomic.c` was Written by Gil Tene, Michael Barker,
+and Matt Warren, and released to the public domain, as explained at
+http://creativecommons.org/publicdomain/zero/1.0/.
\ No newline at end of file
diff --git a/redis-stable/deps/hdr_histogram/hdr_atomic.h b/redis-stable/deps/hdr_histogram/hdr_atomic.h
new file mode 100644
index 00000000..ae1056a8
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/hdr_atomic.h
@@ -0,0 +1,146 @@
+/**
+ * hdr_atomic.h
+ * Written by Philip Orwig and released to the public domain,
+ * as explained at http://creativecommons.org/publicdomain/zero/1.0/
+ */
+
+#ifndef HDR_ATOMIC_H__
+#define HDR_ATOMIC_H__
+
+
+#if defined(_MSC_VER)
+
+#include <stdint.h>
+#include <intrin.h>
+#include <stdbool.h>
+
+static void __inline * hdr_atomic_load_pointer(void** pointer)
+{
+	_ReadBarrier();
+	return *pointer;
+}
+
+static void hdr_atomic_store_pointer(void** pointer, void* value)
+{
+	_WriteBarrier();
+	*pointer = value;
+}
+
+static int64_t __inline hdr_atomic_load_64(int64_t* field)
+{ 
+	_ReadBarrier();
+	return *field;
+}
+
+static void __inline hdr_atomic_store_64(int64_t* field, int64_t value)
+{
+	_WriteBarrier();
+	*field = value;
+}
+
+static int64_t __inline hdr_atomic_exchange_64(volatile int64_t* field, int64_t value)
+{
+#if defined(_WIN64)
+    return _InterlockedExchange64(field, value);
+#else
+    int64_t comparand;
+    int64_t initial_value = *field;
+    do
+    {
+        comparand = initial_value;
+        initial_value = _InterlockedCompareExchange64(field, value, comparand);
+    }
+    while (comparand != initial_value);
+
+    return initial_value;
+#endif
+}
+
+static int64_t __inline hdr_atomic_add_fetch_64(volatile int64_t* field, int64_t value)
+{
+#if defined(_WIN64)
+	return _InterlockedExchangeAdd64(field, value) + value;
+#else
+    int64_t comparand;
+    int64_t initial_value = *field;
+    do
+    {
+        comparand = initial_value;
+        initial_value = _InterlockedCompareExchange64(field, comparand + value, comparand);
+    }
+    while (comparand != initial_value);
+
+    return initial_value + value;
+#endif
+}
+
+static bool __inline hdr_atomic_compare_exchange_64(volatile int64_t* field, int64_t* expected, int64_t desired)
+{
+    return *expected == _InterlockedCompareExchange64(field, desired, *expected);
+}
+
+#elif defined(__ATOMIC_SEQ_CST)
+
+#define hdr_atomic_load_pointer(x) __atomic_load_n(x, __ATOMIC_SEQ_CST)
+#define hdr_atomic_store_pointer(f,v) __atomic_store_n(f,v, __ATOMIC_SEQ_CST)
+#define hdr_atomic_load_64(x) __atomic_load_n(x, __ATOMIC_SEQ_CST)
+#define hdr_atomic_store_64(f,v) __atomic_store_n(f,v, __ATOMIC_SEQ_CST)
+#define hdr_atomic_exchange_64(f,i) __atomic_exchange_n(f,i, __ATOMIC_SEQ_CST)
+#define hdr_atomic_add_fetch_64(field, value) __atomic_add_fetch(field, value, __ATOMIC_SEQ_CST)
+#define hdr_atomic_compare_exchange_64(field, expected, desired) __atomic_compare_exchange_n(field, expected, desired, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST)
+
+#elif defined(__x86_64__)
+
+#include <stdint.h>
+#include <stdbool.h>
+
+static inline void* hdr_atomic_load_pointer(void** pointer)
+{
+   void* p =  *pointer;
+	asm volatile ("" ::: "memory");
+	return p;
+}
+
+static inline void hdr_atomic_store_pointer(void** pointer, void* value)
+{
+    asm volatile ("lock; xchgq %0, %1" : "+q" (value), "+m" (*pointer));
+}
+
+static inline int64_t hdr_atomic_load_64(int64_t* field)
+{
+    int64_t i = *field;
+	asm volatile ("" ::: "memory");
+	return i;
+}
+
+static inline void hdr_atomic_store_64(int64_t* field, int64_t value)
+{
+    asm volatile ("lock; xchgq %0, %1" : "+q" (value), "+m" (*field));
+}
+
+static inline int64_t hdr_atomic_exchange_64(volatile int64_t* field, int64_t value)
+{
+    int64_t result = 0;
+    asm volatile ("lock; xchgq %1, %2" : "=r" (result), "+q" (value), "+m" (*field));
+    return result;
+}
+
+static inline int64_t hdr_atomic_add_fetch_64(volatile int64_t* field, int64_t value)
+{
+    return __sync_add_and_fetch(field, value);
+}
+
+static inline bool hdr_atomic_compare_exchange_64(volatile int64_t* field, int64_t* expected, int64_t desired)
+{
+    int64_t original;
+    asm volatile( "lock; cmpxchgq %2, %1" : "=a"(original), "+m"(*field) : "q"(desired), "0"(*expected));
+    return original == *expected;
+}
+
+#else
+
+#error "Unable to determine atomic operations for your platform"
+
+#endif
+
+#endif /* HDR_ATOMIC_H__ */
diff --git a/redis-stable/deps/hdr_histogram/hdr_histogram.c b/redis-stable/deps/hdr_histogram/hdr_histogram.c
new file mode 100644
index 00000000..5f5286f2
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/hdr_histogram.c
@@ -0,0 +1,1155 @@
+/**
+ * hdr_histogram.c
+ * Written by Michael Barker and released to the public domain,
+ * as explained at http://creativecommons.org/publicdomain/zero/1.0/
+ */
+
+#include <stdlib.h>
+#include <stdbool.h>
+#include <math.h>
+#include <stdio.h>
+#include <string.h>
+#include <stdint.h>
+#include <errno.h>
+#include <inttypes.h>
+
+#include "hdr_histogram.h"
+#include "hdr_atomic.h"
+
+/*  ######   #######  ##     ## ##    ## ########  ######  */
+/* ##    ## ##     ## ##     ## ###   ##    ##    ##    ## */
+/* ##       ##     ## ##     ## ####  ##    ##    ##       */
+/* ##       ##     ## ##     ## ## ## ##    ##     ######  */
+/* ##       ##     ## ##     ## ##  ####    ##          ## */
+/* ##    ## ##     ## ##     ## ##   ###    ##    ##    ## */
+/*  ######   #######   #######  ##    ##    ##     ######  */
+
+static int32_t normalize_index(const struct hdr_histogram* h, int32_t index)
+{
+    int32_t normalized_index;
+    int32_t adjustment = 0;
+    if (h->normalizing_index_offset == 0)
+    {
+        return index;
+    }
+
+    normalized_index = index - h->normalizing_index_offset;
+
+    if (normalized_index < 0)
+    {
+        adjustment = h->counts_len;
+    }
+    else if (normalized_index >= h->counts_len)
+    {
+        adjustment = -h->counts_len;
+    }
+
+    return normalized_index + adjustment;
+}
+
+static int64_t counts_get_direct(const struct hdr_histogram* h, int32_t index)
+{
+    return h->counts[index];
+}
+
+static int64_t counts_get_normalised(const struct hdr_histogram* h, int32_t index)
+{
+    return counts_get_direct(h, normalize_index(h, index));
+}
+
+static void counts_inc_normalised(
+    struct hdr_histogram* h, int32_t index, int64_t value)
+{
+    int32_t normalised_index = normalize_index(h, index);
+    h->counts[normalised_index] += value;
+    h->total_count += value;
+}
+
+static void counts_inc_normalised_atomic(
+    struct hdr_histogram* h, int32_t index, int64_t value)
+{
+    int32_t normalised_index = normalize_index(h, index);
+
+    hdr_atomic_add_fetch_64(&h->counts[normalised_index], value);
+    hdr_atomic_add_fetch_64(&h->total_count, value);
+}
+
+static void update_min_max(struct hdr_histogram* h, int64_t value)
+{
+    h->min_value = (value < h->min_value && value != 0) ? value : h->min_value;
+    h->max_value = (value > h->max_value) ? value : h->max_value;
+}
+
+static void update_min_max_atomic(struct hdr_histogram* h, int64_t value)
+{
+    int64_t current_min_value;
+    int64_t current_max_value;
+    do
+    {
+        current_min_value = hdr_atomic_load_64(&h->min_value);
+
+        if (0 == value || current_min_value <= value)
+        {
+            break;
+        }
+    }
+    while (!hdr_atomic_compare_exchange_64(&h->min_value, &current_min_value, value));
+
+    do
+    {
+        current_max_value = hdr_atomic_load_64(&h->max_value);
+
+        if (value <= current_max_value)
+        {
+            break;
+        }
+    }
+    while (!hdr_atomic_compare_exchange_64(&h->max_value, &current_max_value, value));
+}
+
+
+/* ##     ## ######## #### ##       #### ######## ##    ## */
+/* ##     ##    ##     ##  ##        ##     ##     ##  ##  */
+/* ##     ##    ##     ##  ##        ##     ##      ####   */
+/* ##     ##    ##     ##  ##        ##     ##       ##    */
+/* ##     ##    ##     ##  ##        ##     ##       ##    */
+/* ##     ##    ##     ##  ##        ##     ##       ##    */
+/*  #######     ##    #### ######## ####    ##       ##    */
+
+static int64_t power(int64_t base, int64_t exp)
+{
+    int64_t result = 1;
+    while(exp)
+    {
+        result *= base; exp--;
+    }
+    return result;
+}
+
+#if defined(_MSC_VER)
+#   if defined(_WIN64)
+#       pragma intrinsic(_BitScanReverse64)
+#   else
+#       pragma intrinsic(_BitScanReverse)
+#   endif
+#endif
+
+static int32_t count_leading_zeros_64(int64_t value)
+{
+#if defined(_MSC_VER)
+    uint32_t leading_zero = 0;
+#if defined(_WIN64)
+    _BitScanReverse64(&leading_zero, value);
+#else
+    uint32_t high = value >> 32;
+    if  (_BitScanReverse(&leading_zero, high))
+    {
+        leading_zero += 32;
+    }
+    else
+    {
+        uint32_t low = value & 0x00000000FFFFFFFF;
+        _BitScanReverse(&leading_zero, low);
+    }
+#endif
+    return 63 - leading_zero; /* smallest power of 2 containing value */
+#else
+    return __builtin_clzll(value); /* smallest power of 2 containing value */
+#endif
+}
+
+static int32_t get_bucket_index(const struct hdr_histogram* h, int64_t value)
+{
+    int32_t pow2ceiling = 64 - count_leading_zeros_64(value | h->sub_bucket_mask); /* smallest power of 2 containing value */
+    return pow2ceiling - h->unit_magnitude - (h->sub_bucket_half_count_magnitude + 1);
+}
+
+static int32_t get_sub_bucket_index(int64_t value, int32_t bucket_index, int32_t unit_magnitude)
+{
+    return (int32_t)(value >> (bucket_index + unit_magnitude));
+}
+
+static int32_t counts_index(const struct hdr_histogram* h, int32_t bucket_index, int32_t sub_bucket_index)
+{
+    /* Calculate the index for the first entry in the bucket: */
+    /* (The following is the equivalent of ((bucket_index + 1) * subBucketHalfCount) ): */
+    int32_t bucket_base_index = (bucket_index + 1) << h->sub_bucket_half_count_magnitude;
+    /* Calculate the offset in the bucket: */
+    int32_t offset_in_bucket = sub_bucket_index - h->sub_bucket_half_count;
+    /* The following is the equivalent of ((sub_bucket_index  - subBucketHalfCount) + bucketBaseIndex; */
+    return bucket_base_index + offset_in_bucket;
+}
+
+static int64_t value_from_index(int32_t bucket_index, int32_t sub_bucket_index, int32_t unit_magnitude)
+{
+    return ((int64_t) sub_bucket_index) << (bucket_index + unit_magnitude);
+}
+
+int32_t counts_index_for(const struct hdr_histogram* h, int64_t value)
+{
+    int32_t bucket_index     = get_bucket_index(h, value);
+    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
+
+    return counts_index(h, bucket_index, sub_bucket_index);
+}
+
+int64_t hdr_value_at_index(const struct hdr_histogram *h, int32_t index)
+{
+    int32_t bucket_index = (index >> h->sub_bucket_half_count_magnitude) - 1;
+    int32_t sub_bucket_index = (index & (h->sub_bucket_half_count - 1)) + h->sub_bucket_half_count;
+
+    if (bucket_index < 0)
+    {
+        sub_bucket_index -= h->sub_bucket_half_count;
+        bucket_index = 0;
+    }
+
+    return value_from_index(bucket_index, sub_bucket_index, h->unit_magnitude);
+}
+
+int64_t hdr_size_of_equivalent_value_range(const struct hdr_histogram* h, int64_t value)
+{
+    int32_t bucket_index     = get_bucket_index(h, value);
+    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
+    int32_t adjusted_bucket  = (sub_bucket_index >= h->sub_bucket_count) ? (bucket_index + 1) : bucket_index;
+    return INT64_C(1) << (h->unit_magnitude + adjusted_bucket);
+}
+
+static int64_t lowest_equivalent_value(const struct hdr_histogram* h, int64_t value)
+{
+    int32_t bucket_index     = get_bucket_index(h, value);
+    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
+    return value_from_index(bucket_index, sub_bucket_index, h->unit_magnitude);
+}
+
+int64_t hdr_next_non_equivalent_value(const struct hdr_histogram *h, int64_t value)
+{
+    return lowest_equivalent_value(h, value) + hdr_size_of_equivalent_value_range(h, value);
+}
+
+static int64_t highest_equivalent_value(const struct hdr_histogram* h, int64_t value)
+{
+    return hdr_next_non_equivalent_value(h, value) - 1;
+}
+
+int64_t hdr_median_equivalent_value(const struct hdr_histogram *h, int64_t value)
+{
+    return lowest_equivalent_value(h, value) + (hdr_size_of_equivalent_value_range(h, value) >> 1);
+}
+
+static int64_t non_zero_min(const struct hdr_histogram* h)
+{
+    if (INT64_MAX == h->min_value)
+    {
+        return INT64_MAX;
+    }
+
+    return lowest_equivalent_value(h, h->min_value);
+}
+
+void hdr_reset_internal_counters(struct hdr_histogram* h)
+{
+    int min_non_zero_index = -1;
+    int max_index = -1;
+    int64_t observed_total_count = 0;
+    int i;
+
+    for (i = 0; i < h->counts_len; i++)
+    {
+        int64_t count_at_index;
+
+        if ((count_at_index = counts_get_direct(h, i)) > 0)
+        {
+            observed_total_count += count_at_index;
+            max_index = i;
+            if (min_non_zero_index == -1 && i != 0)
+            {
+                min_non_zero_index = i;
+            }
+        }
+    }
+
+    if (max_index == -1)
+    {
+        h->max_value = 0;
+    }
+    else
+    {
+        int64_t max_value = hdr_value_at_index(h, max_index);
+        h->max_value = highest_equivalent_value(h, max_value);
+    }
+
+    if (min_non_zero_index == -1)
+    {
+        h->min_value = INT64_MAX;
+    }
+    else
+    {
+        h->min_value = hdr_value_at_index(h, min_non_zero_index);
+    }
+
+    h->total_count = observed_total_count;
+}
+
+static int32_t buckets_needed_to_cover_value(int64_t value, int32_t sub_bucket_count, int32_t unit_magnitude)
+{
+    int64_t smallest_untrackable_value = ((int64_t) sub_bucket_count) << unit_magnitude;
+    int32_t buckets_needed = 1;
+    while (smallest_untrackable_value <= value)
+    {
+        if (smallest_untrackable_value > INT64_MAX / 2)
+        {
+            return buckets_needed + 1;
+        }
+        smallest_untrackable_value <<= 1;
+        buckets_needed++;
+    }
+
+    return buckets_needed;
+}
+
+/* ##     ## ######## ##     ##  #######  ########  ##    ## */
+/* ###   ### ##       ###   ### ##     ## ##     ##  ##  ##  */
+/* #### #### ##       #### #### ##     ## ##     ##   ####   */
+/* ## ### ## ######   ## ### ## ##     ## ########     ##    */
+/* ##     ## ##       ##     ## ##     ## ##   ##      ##    */
+/* ##     ## ##       ##     ## ##     ## ##    ##     ##    */
+/* ##     ## ######## ##     ##  #######  ##     ##    ##    */
+
+int hdr_calculate_bucket_config(
+        int64_t lowest_trackable_value,
+        int64_t highest_trackable_value,
+        int significant_figures,
+        struct hdr_histogram_bucket_config* cfg)
+{
+    int32_t sub_bucket_count_magnitude;
+    int64_t largest_value_with_single_unit_resolution;
+
+    if (lowest_trackable_value < 1 ||
+            significant_figures < 1 || 5 < significant_figures ||
+            lowest_trackable_value * 2 > highest_trackable_value)
+    {
+        return EINVAL;
+    }
+
+    cfg->lowest_trackable_value = lowest_trackable_value;
+    cfg->significant_figures = significant_figures;
+    cfg->highest_trackable_value = highest_trackable_value;
+
+    largest_value_with_single_unit_resolution = 2 * power(10, significant_figures);
+    sub_bucket_count_magnitude = (int32_t) ceil(log((double)largest_value_with_single_unit_resolution) / log(2));
+    cfg->sub_bucket_half_count_magnitude = ((sub_bucket_count_magnitude > 1) ? sub_bucket_count_magnitude : 1) - 1;
+
+    cfg->unit_magnitude = (int32_t) floor(log((double)lowest_trackable_value) / log(2));
+
+    cfg->sub_bucket_count      = (int32_t) pow(2, (cfg->sub_bucket_half_count_magnitude + 1));
+    cfg->sub_bucket_half_count = cfg->sub_bucket_count / 2;
+    cfg->sub_bucket_mask       = ((int64_t) cfg->sub_bucket_count - 1) << cfg->unit_magnitude;
+
+    if (cfg->unit_magnitude + cfg->sub_bucket_half_count_magnitude > 61)
+    {
+        return EINVAL;
+    }
+
+    cfg->bucket_count = buckets_needed_to_cover_value(highest_trackable_value, cfg->sub_bucket_count, (int32_t)cfg->unit_magnitude);
+    cfg->counts_len = (cfg->bucket_count + 1) * (cfg->sub_bucket_count / 2);
+
+    return 0;
+}
+
+void hdr_init_preallocated(struct hdr_histogram* h, struct hdr_histogram_bucket_config* cfg)
+{
+    h->lowest_trackable_value          = cfg->lowest_trackable_value;
+    h->highest_trackable_value         = cfg->highest_trackable_value;
+    h->unit_magnitude                  = (int32_t)cfg->unit_magnitude;
+    h->significant_figures             = (int32_t)cfg->significant_figures;
+    h->sub_bucket_half_count_magnitude = cfg->sub_bucket_half_count_magnitude;
+    h->sub_bucket_half_count           = cfg->sub_bucket_half_count;
+    h->sub_bucket_mask                 = cfg->sub_bucket_mask;
+    h->sub_bucket_count                = cfg->sub_bucket_count;
+    h->min_value                       = INT64_MAX;
+    h->max_value                       = 0;
+    h->normalizing_index_offset        = 0;
+    h->conversion_ratio                = 1.0;
+    h->bucket_count                    = cfg->bucket_count;
+    h->counts_len                      = cfg->counts_len;
+    h->total_count                     = 0;
+}
+
+int hdr_init(
+        int64_t lowest_trackable_value,
+        int64_t highest_trackable_value,
+        int significant_figures,
+        struct hdr_histogram** result)
+{
+    int64_t* counts;
+    struct hdr_histogram_bucket_config cfg;
+    struct hdr_histogram* histogram;
+
+    int r = hdr_calculate_bucket_config(lowest_trackable_value, highest_trackable_value, significant_figures, &cfg);
+    if (r)
+    {
+        return r;
+    }
+
+    counts = (int64_t*) calloc((size_t) cfg.counts_len, sizeof(int64_t));
+    if (!counts)
+    {
+        return ENOMEM;
+    }
+
+    histogram = (struct hdr_histogram*) calloc(1, sizeof(struct hdr_histogram));
+    if (!histogram)
+    {
+        free(counts);
+        return ENOMEM;
+    }
+
+    histogram->counts = counts;
+
+    hdr_init_preallocated(histogram, &cfg);
+    *result = histogram;
+
+    return 0;
+}
+
+void hdr_close(struct hdr_histogram* h)
+{
+    if (h) {
+	free(h->counts);
+	free(h);
+    }
+}
+
+int hdr_alloc(int64_t highest_trackable_value, int significant_figures, struct hdr_histogram** result)
+{
+    return hdr_init(1, highest_trackable_value, significant_figures, result);
+}
+
+/* reset a histogram to zero. */
+void hdr_reset(struct hdr_histogram *h)
+{
+     h->total_count=0;
+     h->min_value = INT64_MAX;
+     h->max_value = 0;
+     memset(h->counts, 0, (sizeof(int64_t) * h->counts_len));
+}
+
+size_t hdr_get_memory_size(struct hdr_histogram *h)
+{
+    return sizeof(struct hdr_histogram) + h->counts_len * sizeof(int64_t);
+}
+
+/* ##     ## ########  ########     ###    ######## ########  ######  */
+/* ##     ## ##     ## ##     ##   ## ##      ##    ##       ##    ## */
+/* ##     ## ##     ## ##     ##  ##   ##     ##    ##       ##       */
+/* ##     ## ########  ##     ## ##     ##    ##    ######    ######  */
+/* ##     ## ##        ##     ## #########    ##    ##             ## */
+/* ##     ## ##        ##     ## ##     ##    ##    ##       ##    ## */
+/*  #######  ##        ########  ##     ##    ##    ########  ######  */
+
+
+bool hdr_record_value(struct hdr_histogram* h, int64_t value)
+{
+    return hdr_record_values(h, value, 1);
+}
+
+bool hdr_record_value_atomic(struct hdr_histogram* h, int64_t value)
+{
+    return hdr_record_values_atomic(h, value, 1);
+}
+
+bool hdr_record_values(struct hdr_histogram* h, int64_t value, int64_t count)
+{
+    int32_t counts_index;
+
+    if (value < 0)
+    {
+        return false;
+    }
+
+    counts_index = counts_index_for(h, value);
+
+    if (counts_index < 0 || h->counts_len <= counts_index)
+    {
+        return false;
+    }
+
+    counts_inc_normalised(h, counts_index, count);
+    update_min_max(h, value);
+
+    return true;
+}
+
+bool hdr_record_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count)
+{
+    int32_t counts_index;
+
+    if (value < 0)
+    {
+        return false;
+    }
+
+    counts_index = counts_index_for(h, value);
+
+    if (counts_index < 0 || h->counts_len <= counts_index)
+    {
+        return false;
+    }
+
+    counts_inc_normalised_atomic(h, counts_index, count);
+    update_min_max_atomic(h, value);
+
+    return true;
+}
+
+bool hdr_record_corrected_value(struct hdr_histogram* h, int64_t value, int64_t expected_interval)
+{
+    return hdr_record_corrected_values(h, value, 1, expected_interval);
+}
+
+bool hdr_record_corrected_value_atomic(struct hdr_histogram* h, int64_t value, int64_t expected_interval)
+{
+    return hdr_record_corrected_values_atomic(h, value, 1, expected_interval);
+}
+
+bool hdr_record_corrected_values(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval)
+{
+    int64_t missing_value;
+
+    if (!hdr_record_values(h, value, count))
+    {
+        return false;
+    }
+
+    if (expected_interval <= 0 || value <= expected_interval)
+    {
+        return true;
+    }
+
+    missing_value = value - expected_interval;
+    for (; missing_value >= expected_interval; missing_value -= expected_interval)
+    {
+        if (!hdr_record_values(h, missing_value, count))
+        {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+bool hdr_record_corrected_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval)
+{
+    int64_t missing_value;
+
+    if (!hdr_record_values_atomic(h, value, count))
+    {
+        return false;
+    }
+
+    if (expected_interval <= 0 || value <= expected_interval)
+    {
+        return true;
+    }
+
+    missing_value = value - expected_interval;
+    for (; missing_value >= expected_interval; missing_value -= expected_interval)
+    {
+        if (!hdr_record_values_atomic(h, missing_value, count))
+        {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+int64_t hdr_add(struct hdr_histogram* h, const struct hdr_histogram* from)
+{
+    struct hdr_iter iter;
+    int64_t dropped = 0;
+    hdr_iter_recorded_init(&iter, from);
+
+    while (hdr_iter_next(&iter))
+    {
+        int64_t value = iter.value;
+        int64_t count = iter.count;
+
+        if (!hdr_record_values(h, value, count))
+        {
+            dropped += count;
+        }
+    }
+
+    return dropped;
+}
+
+int64_t hdr_add_while_correcting_for_coordinated_omission(
+        struct hdr_histogram* h, struct hdr_histogram* from, int64_t expected_interval)
+{
+    struct hdr_iter iter;
+    int64_t dropped = 0;
+    hdr_iter_recorded_init(&iter, from);
+
+    while (hdr_iter_next(&iter))
+    {
+        int64_t value = iter.value;
+        int64_t count = iter.count;
+
+        if (!hdr_record_corrected_values(h, value, count, expected_interval))
+        {
+            dropped += count;
+        }
+    }
+
+    return dropped;
+}
+
+
+
+/* ##     ##    ###    ##       ##     ## ########  ######  */
+/* ##     ##   ## ##   ##       ##     ## ##       ##    ## */
+/* ##     ##  ##   ##  ##       ##     ## ##       ##       */
+/* ##     ## ##     ## ##       ##     ## ######    ######  */
+/*  ##   ##  ######### ##       ##     ## ##             ## */
+/*   ## ##   ##     ## ##       ##     ## ##       ##    ## */
+/*    ###    ##     ## ########  #######  ########  ######  */
+
+
+int64_t hdr_max(const struct hdr_histogram* h)
+{
+    if (0 == h->max_value)
+    {
+        return 0;
+    }
+
+    return highest_equivalent_value(h, h->max_value);
+}
+
+int64_t hdr_min(const struct hdr_histogram* h)
+{
+    if (0 < hdr_count_at_index(h, 0))
+    {
+        return 0;
+    }
+
+    return non_zero_min(h);
+}
+
+int64_t hdr_value_at_percentile(const struct hdr_histogram* h, double percentile)
+{
+    struct hdr_iter iter;
+    int64_t total = 0;
+    double requested_percentile = percentile < 100.0 ? percentile : 100.0;
+    int64_t count_at_percentile =
+        (int64_t) (((requested_percentile / 100) * h->total_count) + 0.5);
+    count_at_percentile = count_at_percentile > 1 ? count_at_percentile : 1;
+
+    hdr_iter_init(&iter, h);
+
+    while (hdr_iter_next(&iter))
+    {
+        total += iter.count;
+
+        if (total >= count_at_percentile)
+        {
+            int64_t value_from_index = iter.value;
+            return highest_equivalent_value(h, value_from_index);
+        }
+    }
+
+    return 0;
+}
+
+double hdr_mean(const struct hdr_histogram* h)
+{
+    struct hdr_iter iter;
+    int64_t total = 0;
+
+    hdr_iter_init(&iter, h);
+
+    while (hdr_iter_next(&iter))
+    {
+        if (0 != iter.count)
+        {
+            total += iter.count * hdr_median_equivalent_value(h, iter.value);
+        }
+    }
+
+    return (total * 1.0) / h->total_count;
+}
+
+double hdr_stddev(const struct hdr_histogram* h)
+{
+    double mean = hdr_mean(h);
+    double geometric_dev_total = 0.0;
+
+    struct hdr_iter iter;
+    hdr_iter_init(&iter, h);
+
+    while (hdr_iter_next(&iter))
+    {
+        if (0 != iter.count)
+        {
+            double dev = (hdr_median_equivalent_value(h, iter.value) * 1.0) - mean;
+            geometric_dev_total += (dev * dev) * iter.count;
+        }
+    }
+
+    return sqrt(geometric_dev_total / h->total_count);
+}
+
+bool hdr_values_are_equivalent(const struct hdr_histogram* h, int64_t a, int64_t b)
+{
+    return lowest_equivalent_value(h, a) == lowest_equivalent_value(h, b);
+}
+
+int64_t hdr_lowest_equivalent_value(const struct hdr_histogram* h, int64_t value)
+{
+    return lowest_equivalent_value(h, value);
+}
+
+int64_t hdr_count_at_value(const struct hdr_histogram* h, int64_t value)
+{
+    return counts_get_normalised(h, counts_index_for(h, value));
+}
+
+int64_t hdr_count_at_index(const struct hdr_histogram* h, int32_t index)
+{
+    return counts_get_normalised(h, index);
+}
+
+
+/* #### ######## ######## ########     ###    ########  #######  ########   ######  */
+/*  ##     ##    ##       ##     ##   ## ##      ##    ##     ## ##     ## ##    ## */
+/*  ##     ##    ##       ##     ##  ##   ##     ##    ##     ## ##     ## ##       */
+/*  ##     ##    ######   ########  ##     ##    ##    ##     ## ########   ######  */
+/*  ##     ##    ##       ##   ##   #########    ##    ##     ## ##   ##         ## */
+/*  ##     ##    ##       ##    ##  ##     ##    ##    ##     ## ##    ##  ##    ## */
+/* ####    ##    ######## ##     ## ##     ##    ##     #######  ##     ##  ######  */
+
+
+static bool has_buckets(struct hdr_iter* iter)
+{
+    return iter->counts_index < iter->h->counts_len;
+}
+
+static bool has_next(struct hdr_iter* iter)
+{
+    return iter->cumulative_count < iter->total_count;
+}
+
+static bool move_next(struct hdr_iter* iter)
+{
+    iter->counts_index++;
+
+    if (!has_buckets(iter))
+    {
+        return false;
+    }
+
+    iter->count = counts_get_normalised(iter->h, iter->counts_index);
+    iter->cumulative_count += iter->count;
+
+    iter->value = hdr_value_at_index(iter->h, iter->counts_index);
+    iter->highest_equivalent_value = highest_equivalent_value(iter->h, iter->value);
+    iter->lowest_equivalent_value = lowest_equivalent_value(iter->h, iter->value);
+    iter->median_equivalent_value = hdr_median_equivalent_value(iter->h, iter->value);
+
+    return true;
+}
+
+static int64_t peek_next_value_from_index(struct hdr_iter* iter)
+{
+    return hdr_value_at_index(iter->h, iter->counts_index + 1);
+}
+
+static bool next_value_greater_than_reporting_level_upper_bound(
+    struct hdr_iter *iter, int64_t reporting_level_upper_bound)
+{
+    if (iter->counts_index >= iter->h->counts_len)
+    {
+        return false;
+    }
+
+    return peek_next_value_from_index(iter) > reporting_level_upper_bound;
+}
+
+static bool basic_iter_next(struct hdr_iter *iter)
+{
+    if (!has_next(iter) || iter->counts_index >= iter->h->counts_len)
+    {
+        return false;
+    }
+
+    move_next(iter);
+
+    return true;
+}
+
+static void update_iterated_values(struct hdr_iter* iter, int64_t new_value_iterated_to)
+{
+    iter->value_iterated_from = iter->value_iterated_to;
+    iter->value_iterated_to = new_value_iterated_to;
+}
+
+static bool all_values_iter_next(struct hdr_iter* iter)
+{
+    bool result = move_next(iter);
+
+    if (result)
+    {
+        update_iterated_values(iter, iter->value);
+    }
+
+    return result;
+}
+
+void hdr_iter_init(struct hdr_iter* iter, const struct hdr_histogram* h)
+{
+    iter->h = h;
+
+    iter->counts_index = -1;
+    iter->total_count = h->total_count;
+    iter->count = 0;
+    iter->cumulative_count = 0;
+    iter->value = 0;
+    iter->highest_equivalent_value = 0;
+    iter->value_iterated_from = 0;
+    iter->value_iterated_to = 0;
+
+    iter->_next_fp = all_values_iter_next;
+}
+
+bool hdr_iter_next(struct hdr_iter* iter)
+{
+    return iter->_next_fp(iter);
+}
+
+/* ########  ######## ########   ######  ######## ##    ## ######## #### ##       ########  ######  */
+/* ##     ## ##       ##     ## ##    ## ##       ###   ##    ##     ##  ##       ##       ##    ## */
+/* ##     ## ##       ##     ## ##       ##       ####  ##    ##     ##  ##       ##       ##       */
+/* ########  ######   ########  ##       ######   ## ## ##    ##     ##  ##       ######    ######  */
+/* ##        ##       ##   ##   ##       ##       ##  ####    ##     ##  ##       ##             ## */
+/* ##        ##       ##    ##  ##    ## ##       ##   ###    ##     ##  ##       ##       ##    ## */
+/* ##        ######## ##     ##  ######  ######## ##    ##    ##    #### ######## ########  ######  */
+
+static bool percentile_iter_next(struct hdr_iter* iter)
+{
+    int64_t temp, half_distance, percentile_reporting_ticks;
+
+    struct hdr_iter_percentiles* percentiles = &iter->specifics.percentiles;
+
+    if (!has_next(iter))
+    {
+        if (percentiles->seen_last_value)
+        {
+            return false;
+        }
+
+        percentiles->seen_last_value = true;
+        percentiles->percentile = 100.0;
+
+        return true;
+    }
+
+    if (iter->counts_index == -1 && !basic_iter_next(iter))
+    {
+        return false;
+    }
+
+    do
+    {
+        double current_percentile = (100.0 * (double) iter->cumulative_count) / iter->h->total_count;
+        if (iter->count != 0 &&
+                percentiles->percentile_to_iterate_to <= current_percentile)
+        {
+            update_iterated_values(iter, highest_equivalent_value(iter->h, iter->value));
+
+            percentiles->percentile = percentiles->percentile_to_iterate_to;
+            temp = (int64_t)(log(100 / (100.0 - (percentiles->percentile_to_iterate_to))) / log(2)) + 1;
+            half_distance = (int64_t) pow(2, (double) temp);
+            percentile_reporting_ticks = percentiles->ticks_per_half_distance * half_distance;
+            percentiles->percentile_to_iterate_to += 100.0 / percentile_reporting_ticks;
+
+            return true;
+        }
+    }
+    while (basic_iter_next(iter));
+
+    return true;
+}
+
+void hdr_iter_percentile_init(struct hdr_iter* iter, const struct hdr_histogram* h, int32_t ticks_per_half_distance)
+{
+    iter->h = h;
+
+    hdr_iter_init(iter, h);
+
+    iter->specifics.percentiles.seen_last_value          = false;
+    iter->specifics.percentiles.ticks_per_half_distance  = ticks_per_half_distance;
+    iter->specifics.percentiles.percentile_to_iterate_to = 0.0;
+    iter->specifics.percentiles.percentile               = 0.0;
+
+    iter->_next_fp = percentile_iter_next;
+}
+
+static void format_line_string(char* str, size_t len, int significant_figures, format_type format)
+{
+#if defined(_MSC_VER)
+#define snprintf _snprintf
+#pragma warning(push)
+#pragma warning(disable: 4996)
+#endif
+    const char* format_str = "%s%d%s";
+
+    switch (format)
+    {
+        case CSV:
+            snprintf(str, len, format_str, "%.", significant_figures, "f,%f,%d,%.2f\n");
+            break;
+        case CLASSIC:
+            snprintf(str, len, format_str, "%12.", significant_figures, "f %12f %12d %12.2f\n");
+            break;
+        default:
+            snprintf(str, len, format_str, "%12.", significant_figures, "f %12f %12d %12.2f\n");
+    }
+#if defined(_MSC_VER)
+#undef snprintf
+#pragma warning(pop)
+#endif
+}
+
+
+/* ########  ########  ######   #######  ########  ########  ######## ########   */
+/* ##     ## ##       ##    ## ##     ## ##     ## ##     ## ##       ##     ##  */
+/* ##     ## ##       ##       ##     ## ##     ## ##     ## ##       ##     ##  */
+/* ########  ######   ##       ##     ## ########  ##     ## ######   ##     ##  */
+/* ##   ##   ##       ##       ##     ## ##   ##   ##     ## ##       ##     ##  */
+/* ##    ##  ##       ##    ## ##     ## ##    ##  ##     ## ##       ##     ##  */
+/* ##     ## ########  ######   #######  ##     ## ########  ######## ########   */
+
+
+static bool recorded_iter_next(struct hdr_iter* iter)
+{
+    while (basic_iter_next(iter))
+    {
+        if (iter->count != 0)
+        {
+            update_iterated_values(iter, iter->value);
+
+            iter->specifics.recorded.count_added_in_this_iteration_step = iter->count;
+            return true;
+        }
+    }
+
+    return false;
+}
+
+void hdr_iter_recorded_init(struct hdr_iter* iter, const struct hdr_histogram* h)
+{
+    hdr_iter_init(iter, h);
+
+    iter->specifics.recorded.count_added_in_this_iteration_step = 0;
+
+    iter->_next_fp = recorded_iter_next;
+}
+
+/* ##       #### ##    ## ########    ###    ########  */
+/* ##        ##  ###   ## ##         ## ##   ##     ## */
+/* ##        ##  ####  ## ##        ##   ##  ##     ## */
+/* ##        ##  ## ## ## ######   ##     ## ########  */
+/* ##        ##  ##  #### ##       ######### ##   ##   */
+/* ##        ##  ##   ### ##       ##     ## ##    ##  */
+/* ######## #### ##    ## ######## ##     ## ##     ## */
+
+
+static bool iter_linear_next(struct hdr_iter* iter)
+{
+    struct hdr_iter_linear* linear = &iter->specifics.linear;
+
+    linear->count_added_in_this_iteration_step = 0;
+
+    if (has_next(iter) ||
+        next_value_greater_than_reporting_level_upper_bound(
+            iter, linear->next_value_reporting_level_lowest_equivalent))
+    {
+        do
+        {
+            if (iter->value >= linear->next_value_reporting_level_lowest_equivalent)
+            {
+                update_iterated_values(iter, linear->next_value_reporting_level);
+
+                linear->next_value_reporting_level += linear->value_units_per_bucket;
+                linear->next_value_reporting_level_lowest_equivalent =
+                    lowest_equivalent_value(iter->h, linear->next_value_reporting_level);
+
+                return true;
+            }
+
+            if (!move_next(iter))
+            {
+                return true;
+            }
+
+            linear->count_added_in_this_iteration_step += iter->count;
+        }
+        while (true);
+    }
+
+    return false;
+}
+
+
+void hdr_iter_linear_init(struct hdr_iter* iter, const struct hdr_histogram* h, int64_t value_units_per_bucket)
+{
+    hdr_iter_init(iter, h);
+
+    iter->specifics.linear.count_added_in_this_iteration_step = 0;
+    iter->specifics.linear.value_units_per_bucket = value_units_per_bucket;
+    iter->specifics.linear.next_value_reporting_level = value_units_per_bucket;
+    iter->specifics.linear.next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(h, value_units_per_bucket);
+
+    iter->_next_fp = iter_linear_next;
+}
+
+void hdr_iter_linear_set_value_units_per_bucket(struct hdr_iter* iter, int64_t value_units_per_bucket)
+{
+    iter->specifics.linear.value_units_per_bucket = value_units_per_bucket;
+}
+
+/* ##        #######   ######      ###    ########  #### ######## ##     ## ##     ## ####  ######  */
+/* ##       ##     ## ##    ##    ## ##   ##     ##  ##     ##    ##     ## ###   ###  ##  ##    ## */
+/* ##       ##     ## ##         ##   ##  ##     ##  ##     ##    ##     ## #### ####  ##  ##       */
+/* ##       ##     ## ##   #### ##     ## ########   ##     ##    ######### ## ### ##  ##  ##       */
+/* ##       ##     ## ##    ##  ######### ##   ##    ##     ##    ##     ## ##     ##  ##  ##       */
+/* ##       ##     ## ##    ##  ##     ## ##    ##   ##     ##    ##     ## ##     ##  ##  ##    ## */
+/* ########  #######   ######   ##     ## ##     ## ####    ##    ##     ## ##     ## ####  ######  */
+
+static bool log_iter_next(struct hdr_iter *iter)
+{
+    struct hdr_iter_log* logarithmic = &iter->specifics.log;
+
+    logarithmic->count_added_in_this_iteration_step = 0;
+
+    if (has_next(iter) ||
+        next_value_greater_than_reporting_level_upper_bound(
+            iter, logarithmic->next_value_reporting_level_lowest_equivalent))
+    {
+        do
+        {
+            if (iter->value >= logarithmic->next_value_reporting_level_lowest_equivalent)
+            {
+                update_iterated_values(iter, logarithmic->next_value_reporting_level);
+
+                logarithmic->next_value_reporting_level *= (int64_t)logarithmic->log_base;
+                logarithmic->next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(iter->h, logarithmic->next_value_reporting_level);
+
+                return true;
+            }
+
+            if (!move_next(iter))
+            {
+                return true;
+            }
+
+            logarithmic->count_added_in_this_iteration_step += iter->count;
+        }
+        while (true);
+    }
+
+    return false;
+}
+
+void hdr_iter_log_init(
+        struct hdr_iter* iter,
+        const struct hdr_histogram* h,
+        int64_t value_units_first_bucket,
+        double log_base)
+{
+    hdr_iter_init(iter, h);
+    iter->specifics.log.count_added_in_this_iteration_step = 0;
+    iter->specifics.log.log_base = log_base;
+    iter->specifics.log.next_value_reporting_level = value_units_first_bucket;
+    iter->specifics.log.next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(h, value_units_first_bucket);
+
+    iter->_next_fp = log_iter_next;
+}
+
+/* Printing. */
+
+static const char* format_head_string(format_type format)
+{
+    switch (format)
+    {
+        case CSV:
+            return "%s,%s,%s,%s\n";
+        case CLASSIC:
+        default:
+            return "%12s %12s %12s %12s\n\n";
+    }
+}
+
+static const char CLASSIC_FOOTER[] =
+    "#[Mean    = %12.3f, StdDeviation   = %12.3f]\n"
+    "#[Max     = %12.3f, Total count    = %12" PRIu64 "]\n"
+    "#[Buckets = %12d, SubBuckets     = %12d]\n";
+
+int hdr_percentiles_print(
+        struct hdr_histogram* h, FILE* stream, int32_t ticks_per_half_distance,
+        double value_scale, format_type format)
+{
+    char line_format[25];
+    const char* head_format;
+    int rc = 0;
+    struct hdr_iter iter;
+    struct hdr_iter_percentiles * percentiles;
+
+    format_line_string(line_format, 25, h->significant_figures, format);
+    head_format = format_head_string(format);
+
+    hdr_iter_percentile_init(&iter, h, ticks_per_half_distance);
+
+    if (fprintf(
+            stream, head_format,
+            "Value", "Percentile", "TotalCount", "1/(1-Percentile)") < 0)
+    {
+        rc = EIO;
+        goto cleanup;
+    }
+
+    percentiles = &iter.specifics.percentiles;
+    while (hdr_iter_next(&iter))
+    {
+        double  value               = iter.highest_equivalent_value / value_scale;
+        double  percentile          = percentiles->percentile / 100.0;
+        int64_t total_count         = iter.cumulative_count;
+        double  inverted_percentile = (1.0 / (1.0 - percentile));
+
+        if (fprintf(
+                stream, line_format, value, percentile, total_count, inverted_percentile) < 0)
+        {
+            rc = EIO;
+            goto cleanup;
+        }
+    }
+
+    if (CLASSIC == format)
+    {
+        double mean   = hdr_mean(h)   / value_scale;
+        double stddev = hdr_stddev(h) / value_scale;
+        double max    = hdr_max(h)    / value_scale;
+
+        if (fprintf(
+                stream, CLASSIC_FOOTER,  mean, stddev, max,
+                h->total_count, h->bucket_count, h->sub_bucket_count) < 0)
+        {
+            rc = EIO;
+            goto cleanup;
+        }
+    }
+
+    cleanup:
+    return rc;
+}
diff --git a/redis-stable/deps/hdr_histogram/hdr_histogram.h b/redis-stable/deps/hdr_histogram/hdr_histogram.h
new file mode 100644
index 00000000..c26c56b2
--- /dev/null
+++ b/redis-stable/deps/hdr_histogram/hdr_histogram.h
@@ -0,0 +1,509 @@
+/**
+ * hdr_histogram.h
+ * Written by Michael Barker and released to the public domain,
+ * as explained at http://creativecommons.org/publicdomain/zero/1.0/
+ *
+ * The source for the hdr_histogram utilises a few C99 constructs, specifically
+ * the use of stdint/stdbool and inline variable declaration.
+ */
+
+#ifndef HDR_HISTOGRAM_H
+#define HDR_HISTOGRAM_H 1
+
+#include <stdint.h>
+#include <stdbool.h>
+#include <stdio.h>
+
+struct hdr_histogram
+{
+    int64_t lowest_trackable_value;
+    int64_t highest_trackable_value;
+    int32_t unit_magnitude;
+    int32_t significant_figures;
+    int32_t sub_bucket_half_count_magnitude;
+    int32_t sub_bucket_half_count;
+    int64_t sub_bucket_mask;
+    int32_t sub_bucket_count;
+    int32_t bucket_count;
+    int64_t min_value;
+    int64_t max_value;
+    int32_t normalizing_index_offset;
+    double conversion_ratio;
+    int32_t counts_len;
+    int64_t total_count;
+    int64_t* counts;
+};
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * Allocate the memory and initialise the hdr_histogram.
+ *
+ * Due to the size of the histogram being the result of some reasonably
+ * involved math on the input parameters this function it is tricky to stack allocate.
+ * The histogram should be released with hdr_close
+ *
+ * @param lowest_trackable_value The smallest possible value to be put into the
+ * histogram.
+ * @param highest_trackable_value The largest possible value to be put into the
+ * histogram.
+ * @param significant_figures The level of precision for this histogram, i.e. the number
+ * of figures in a decimal number that will be maintained.  E.g. a value of 3 will mean
+ * the results from the histogram will be accurate up to the first three digits.  Must
+ * be a value between 1 and 5 (inclusive).
+ * @param result Output parameter to capture allocated histogram.
+ * @return 0 on success, EINVAL if lowest_trackable_value is < 1 or the
+ * significant_figure value is outside of the allowed range, ENOMEM if malloc
+ * failed.
+ */
+int hdr_init(
+    int64_t lowest_trackable_value,
+    int64_t highest_trackable_value,
+    int significant_figures,
+    struct hdr_histogram** result);
+
+/**
+ * Free the memory and close the hdr_histogram.
+ *
+ * @param h The histogram you want to close.
+ */
+void hdr_close(struct hdr_histogram* h);
+
+/**
+ * Allocate the memory and initialise the hdr_histogram.  This is the equivalent of calling
+ * hdr_init(1, highest_trackable_value, significant_figures, result);
+ *
+ * @deprecated use hdr_init.
+ */
+int hdr_alloc(int64_t highest_trackable_value, int significant_figures, struct hdr_histogram** result);
+
+
+/**
+ * Reset a histogram to zero - empty out a histogram and re-initialise it
+ *
+ * If you want to re-use an existing histogram, but reset everything back to zero, this
+ * is the routine to use.
+ *
+ * @param h The histogram you want to reset to empty.
+ *
+ */
+void hdr_reset(struct hdr_histogram* h);
+
+/**
+ * Get the memory size of the hdr_histogram.
+ *
+ * @param h "This" pointer
+ * @return The amount of memory used by the hdr_histogram in bytes
+ */
+size_t hdr_get_memory_size(struct hdr_histogram* h);
+
+/**
+ * Records a value in the histogram, will round this value of to a precision at or better
+ * than the significant_figure specified at construction time.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_value(struct hdr_histogram* h, int64_t value);
+
+/**
+ * Records a value in the histogram, will round this value of to a precision at or better
+ * than the significant_figure specified at construction time.
+ *
+ * Will record this value atomically, however the whole structure may appear inconsistent
+ * when read concurrently with this update.  Do NOT mix calls to this method with calls
+ * to non-atomic updates.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_value_atomic(struct hdr_histogram* h, int64_t value);
+
+/**
+ * Records count values in the histogram, will round this value of to a
+ * precision at or better than the significant_figure specified at construction
+ * time.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param count Number of 'value's to add to the histogram
+ * @return false if any value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_values(struct hdr_histogram* h, int64_t value, int64_t count);
+
+/**
+ * Records count values in the histogram, will round this value of to a
+ * precision at or better than the significant_figure specified at construction
+ * time.
+ *
+ * Will record this value atomically, however the whole structure may appear inconsistent
+ * when read concurrently with this update.  Do NOT mix calls to this method with calls
+ * to non-atomic updates.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param count Number of 'value's to add to the histogram
+ * @return false if any value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count);
+
+/**
+ * Record a value in the histogram and backfill based on an expected interval.
+ *
+ * Records a value in the histogram, will round this value of to a precision at or better
+ * than the significant_figure specified at contruction time.  This is specifically used
+ * for recording latency.  If the value is larger than the expected_interval then the
+ * latency recording system has experienced co-ordinated omission.  This method fills in the
+ * values that would have occured had the client providing the load not been blocked.
+
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param expected_interval The delay between recording values.
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_corrected_value(struct hdr_histogram* h, int64_t value, int64_t expexcted_interval);
+
+/**
+ * Record a value in the histogram and backfill based on an expected interval.
+ *
+ * Records a value in the histogram, will round this value of to a precision at or better
+ * than the significant_figure specified at contruction time.  This is specifically used
+ * for recording latency.  If the value is larger than the expected_interval then the
+ * latency recording system has experienced co-ordinated omission.  This method fills in the
+ * values that would have occured had the client providing the load not been blocked.
+ *
+ * Will record this value atomically, however the whole structure may appear inconsistent
+ * when read concurrently with this update.  Do NOT mix calls to this method with calls
+ * to non-atomic updates.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param expected_interval The delay between recording values.
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_corrected_value_atomic(struct hdr_histogram* h, int64_t value, int64_t expexcted_interval);
+
+/**
+ * Record a value in the histogram 'count' times.  Applies the same correcting logic
+ * as 'hdr_record_corrected_value'.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param count Number of 'value's to add to the histogram
+ * @param expected_interval The delay between recording values.
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_corrected_values(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval);
+
+/**
+ * Record a value in the histogram 'count' times.  Applies the same correcting logic
+ * as 'hdr_record_corrected_value'.
+ *
+ * Will record this value atomically, however the whole structure may appear inconsistent
+ * when read concurrently with this update.  Do NOT mix calls to this method with calls
+ * to non-atomic updates.
+ *
+ * @param h "This" pointer
+ * @param value Value to add to the histogram
+ * @param count Number of 'value's to add to the histogram
+ * @param expected_interval The delay between recording values.
+ * @return false if the value is larger than the highest_trackable_value and can't be recorded,
+ * true otherwise.
+ */
+bool hdr_record_corrected_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval);
+
+/**
+ * Adds all of the values from 'from' to 'this' histogram.  Will return the
+ * number of values that are dropped when copying.  Values will be dropped
+ * if they around outside of h.lowest_trackable_value and
+ * h.highest_trackable_value.
+ *
+ * @param h "This" pointer
+ * @param from Histogram to copy values from.
+ * @return The number of values dropped when copying.
+ */
+int64_t hdr_add(struct hdr_histogram* h, const struct hdr_histogram* from);
+
+/**
+ * Adds all of the values from 'from' to 'this' histogram.  Will return the
+ * number of values that are dropped when copying.  Values will be dropped
+ * if they around outside of h.lowest_trackable_value and
+ * h.highest_trackable_value.
+ *
+ * @param h "This" pointer
+ * @param from Histogram to copy values from.
+ * @return The number of values dropped when copying.
+ */
+int64_t hdr_add_while_correcting_for_coordinated_omission(
+    struct hdr_histogram* h, struct hdr_histogram* from, int64_t expected_interval);
+
+/**
+ * Get minimum value from the histogram.  Will return 2^63-1 if the histogram
+ * is empty.
+ *
+ * @param h "This" pointer
+ */
+int64_t hdr_min(const struct hdr_histogram* h);
+
+/**
+ * Get maximum value from the histogram.  Will return 0 if the histogram
+ * is empty.
+ *
+ * @param h "This" pointer
+ */
+int64_t hdr_max(const struct hdr_histogram* h);
+
+/**
+ * Get the value at a specific percentile.
+ *
+ * @param h "This" pointer.
+ * @param percentile The percentile to get the value for
+ */
+int64_t hdr_value_at_percentile(const struct hdr_histogram* h, double percentile);
+
+/**
+ * Gets the standard deviation for the values in the histogram.
+ *
+ * @param h "This" pointer
+ * @return The standard deviation
+ */
+double hdr_stddev(const struct hdr_histogram* h);
+
+/**
+ * Gets the mean for the values in the histogram.
+ *
+ * @param h "This" pointer
+ * @return The mean
+ */
+double hdr_mean(const struct hdr_histogram* h);
+
+/**
+ * Determine if two values are equivalent with the histogram's resolution.
+ * Where "equivalent" means that value samples recorded for any two
+ * equivalent values are counted in a common total count.
+ *
+ * @param h "This" pointer
+ * @param a first value to compare
+ * @param b second value to compare
+ * @return 'true' if values are equivalent with the histogram's resolution.
+ */
+bool hdr_values_are_equivalent(const struct hdr_histogram* h, int64_t a, int64_t b);
+
+/**
+ * Get the lowest value that is equivalent to the given value within the histogram's resolution.
+ * Where "equivalent" means that value samples recorded for any two
+ * equivalent values are counted in a common total count.
+ *
+ * @param h "This" pointer
+ * @param value The given value
+ * @return The lowest value that is equivalent to the given value within the histogram's resolution.
+ */
+int64_t hdr_lowest_equivalent_value(const struct hdr_histogram* h, int64_t value);
+
+/**
+ * Get the count of recorded values at a specific value
+ * (to within the histogram resolution at the value level).
+ *
+ * @param h "This" pointer
+ * @param value The value for which to provide the recorded count
+ * @return The total count of values recorded in the histogram within the value range that is
+ * {@literal >=} lowestEquivalentValue(<i>value</i>) and {@literal <=} highestEquivalentValue(<i>value</i>)
+ */
+int64_t hdr_count_at_value(const struct hdr_histogram* h, int64_t value);
+
+int64_t hdr_count_at_index(const struct hdr_histogram* h, int32_t index);
+
+int64_t hdr_value_at_index(const struct hdr_histogram* h, int32_t index);
+
+struct hdr_iter_percentiles
+{
+    bool seen_last_value;
+    int32_t ticks_per_half_distance;
+    double percentile_to_iterate_to;
+    double percentile;
+};
+
+struct hdr_iter_recorded
+{
+    int64_t count_added_in_this_iteration_step;
+};
+
+struct hdr_iter_linear
+{
+    int64_t value_units_per_bucket;
+    int64_t count_added_in_this_iteration_step;
+    int64_t next_value_reporting_level;
+    int64_t next_value_reporting_level_lowest_equivalent;
+};
+
+struct hdr_iter_log
+{
+    double log_base;
+    int64_t count_added_in_this_iteration_step;
+    int64_t next_value_reporting_level;
+    int64_t next_value_reporting_level_lowest_equivalent;
+};
+
+/**
+ * The basic iterator.  This is a generic structure
+ * that supports all of the types of iteration.  Use
+ * the appropriate initialiser to get the desired
+ * iteration.
+ *
+ * @
+ */
+struct hdr_iter
+{
+    const struct hdr_histogram* h;
+    /** raw index into the counts array */
+    int32_t counts_index;
+    /** snapshot of the length at the time the iterator is created */
+    int64_t total_count;
+    /** value directly from array for the current counts_index */
+    int64_t count;
+    /** sum of all of the counts up to and including the count at this index */
+    int64_t cumulative_count;
+    /** The current value based on counts_index */
+    int64_t value;
+    int64_t highest_equivalent_value;
+    int64_t lowest_equivalent_value;
+    int64_t median_equivalent_value;
+    int64_t value_iterated_from;
+    int64_t value_iterated_to;
+
+    union
+    {
+        struct hdr_iter_percentiles percentiles;
+        struct hdr_iter_recorded recorded;
+        struct hdr_iter_linear linear;
+        struct hdr_iter_log log;
+    } specifics;
+
+    bool (* _next_fp)(struct hdr_iter* iter);
+
+};
+
+/**
+ * Initalises the basic iterator.
+ *
+ * @param itr 'This' pointer
+ * @param h The histogram to iterate over
+ */
+void hdr_iter_init(struct hdr_iter* iter, const struct hdr_histogram* h);
+
+/**
+ * Initialise the iterator for use with percentiles.
+ */
+void hdr_iter_percentile_init(struct hdr_iter* iter, const struct hdr_histogram* h, int32_t ticks_per_half_distance);
+
+/**
+ * Initialise the iterator for use with recorded values.
+ */
+void hdr_iter_recorded_init(struct hdr_iter* iter, const struct hdr_histogram* h);
+
+/**
+ * Initialise the iterator for use with linear values.
+ */
+void hdr_iter_linear_init(
+    struct hdr_iter* iter,
+    const struct hdr_histogram* h,
+    int64_t value_units_per_bucket);
+
+/**
+ * Update the iterator value units per bucket
+ */
+void hdr_iter_linear_set_value_units_per_bucket(struct hdr_iter* iter, int64_t value_units_per_bucket);
+
+/**
+ * Initialise the iterator for use with logarithmic values
+ */
+void hdr_iter_log_init(
+    struct hdr_iter* iter,
+    const struct hdr_histogram* h,
+    int64_t value_units_first_bucket,
+    double log_base);
+
+/**
+ * Iterate to the next value for the iterator.  If there are no more values
+ * available return faluse.
+ *
+ * @param itr 'This' pointer
+ * @return 'false' if there are no values remaining for this iterator.
+ */
+bool hdr_iter_next(struct hdr_iter* iter);
+
+typedef enum
+{
+    CLASSIC,
+    CSV
+} format_type;
+
+/**
+ * Print out a percentile based histogram to the supplied stream.  Note that
+ * this call will not flush the FILE, this is left up to the user.
+ *
+ * @param h 'This' pointer
+ * @param stream The FILE to write the output to
+ * @param ticks_per_half_distance The number of iteration steps per half-distance to 100%
+ * @param value_scale Scale the output values by this amount
+ * @param format_type Format to use, e.g. CSV.
+ * @return 0 on success, error code on failure.  EIO if an error occurs writing
+ * the output.
+ */
+int hdr_percentiles_print(
+    struct hdr_histogram* h, FILE* stream, int32_t ticks_per_half_distance,
+    double value_scale, format_type format);
+
+/**
+* Internal allocation methods, used by hdr_dbl_histogram.
+*/
+struct hdr_histogram_bucket_config
+{
+    int64_t lowest_trackable_value;
+    int64_t highest_trackable_value;
+    int64_t unit_magnitude;
+    int64_t significant_figures;
+    int32_t sub_bucket_half_count_magnitude;
+    int32_t sub_bucket_half_count;
+    int64_t sub_bucket_mask;
+    int32_t sub_bucket_count;
+    int32_t bucket_count;
+    int32_t counts_len;
+};
+
+int hdr_calculate_bucket_config(
+    int64_t lowest_trackable_value,
+    int64_t highest_trackable_value,
+    int significant_figures,
+    struct hdr_histogram_bucket_config* cfg);
+
+void hdr_init_preallocated(struct hdr_histogram* h, struct hdr_histogram_bucket_config* cfg);
+
+int64_t hdr_size_of_equivalent_value_range(const struct hdr_histogram* h, int64_t value);
+
+int64_t hdr_next_non_equivalent_value(const struct hdr_histogram* h, int64_t value);
+
+int64_t hdr_median_equivalent_value(const struct hdr_histogram* h, int64_t value);
+
+/**
+ * Used to reset counters after importing data manuallying into the histogram, used by the logging code
+ * and other custom serialisation tools.
+ */
+void hdr_reset_internal_counters(struct hdr_histogram* h);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/redis-stable/deps/hiredis/.gitignore b/redis-stable/deps/hiredis/.gitignore
new file mode 100644
index 00000000..056959ff
--- /dev/null
+++ b/redis-stable/deps/hiredis/.gitignore
@@ -0,0 +1,9 @@
+/hiredis-test
+/examples/hiredis-example*
+/*.o
+/*.so
+/*.dylib
+/*.a
+/*.pc
+*.dSYM
+tags
diff --git a/redis-stable/deps/hiredis/.travis.yml b/redis-stable/deps/hiredis/.travis.yml
new file mode 100644
index 00000000..f9a9460f
--- /dev/null
+++ b/redis-stable/deps/hiredis/.travis.yml
@@ -0,0 +1,131 @@
+language: c
+compiler:
+  - gcc
+  - clang
+
+os:
+  - linux
+  - osx
+
+dist: bionic
+
+branches:
+  only:
+    - staging
+    - trying
+    - master
+    - /^release\/.*$/
+
+install:
+    - if [ "$BITS" == "64" ]; then
+        wget https://github.com/redis/redis/archive/6.0.6.tar.gz;
+        tar -xzvf 6.0.6.tar.gz;
+        pushd redis-6.0.6 && BUILD_TLS=yes make && export PATH=$PWD/src:$PATH && popd;
+      fi
+
+before_script:
+    - if [ "$TRAVIS_OS_NAME" == "osx" ]; then
+        curl -O https://distfiles.macports.org/MacPorts/MacPorts-2.6.2-10.13-HighSierra.pkg;
+        sudo installer -pkg MacPorts-2.6.2-10.13-HighSierra.pkg -target /;
+        export PATH=$PATH:/opt/local/bin && sudo port -v selfupdate;
+        sudo port -N install openssl redis;
+      fi;
+
+addons:
+  apt:
+    sources:
+    - sourceline: 'ppa:chris-lea/redis-server'
+    packages:
+    - libc6-dbg
+    - libc6-dev
+    - libc6:i386
+    - libc6-dev-i386
+    - libc6-dbg:i386
+    - gcc-multilib
+    - g++-multilib
+    - libssl-dev
+    - libssl-dev:i386
+    - valgrind
+    - redis
+
+env:
+  - BITS="32"
+  - BITS="64"
+
+script:
+  - EXTRA_CMAKE_OPTS="-DENABLE_EXAMPLES:BOOL=ON -DENABLE_SSL:BOOL=ON";
+    if [ "$BITS" == "64" ]; then
+      EXTRA_CMAKE_OPTS="$EXTRA_CMAKE_OPTS -DENABLE_SSL_TESTS:BOOL=ON";
+    fi;
+    if [ "$TRAVIS_OS_NAME" == "osx" ]; then
+      if [ "$BITS" == "32" ]; then
+        CFLAGS="-m32 -Werror";
+        CXXFLAGS="-m32 -Werror";
+        LDFLAGS="-m32";
+        EXTRA_CMAKE_OPTS=;
+      else
+        CFLAGS="-Werror";
+        CXXFLAGS="-Werror";
+      fi;
+    else
+      TEST_PREFIX="valgrind --track-origins=yes --leak-check=full";
+      if [ "$BITS" == "32" ]; then
+        CFLAGS="-m32 -Werror";
+        CXXFLAGS="-m32 -Werror";
+        LDFLAGS="-m32";
+        EXTRA_CMAKE_OPTS=;
+      else
+        CFLAGS="-Werror";
+        CXXFLAGS="-Werror";
+      fi;
+    fi;
+    export CFLAGS CXXFLAGS LDFLAGS TEST_PREFIX EXTRA_CMAKE_OPTS
+  - make && make clean;
+    if [ "$TRAVIS_OS_NAME" == "osx" ]; then
+      if [ "$BITS" == "64" ]; then
+        OPENSSL_PREFIX="$(ls -d /usr/local/Cellar/openssl@1.1/*)" USE_SSL=1 make;
+      fi;
+    else
+      USE_SSL=1 make;
+    fi;
+  - mkdir build/ && cd build/
+  - cmake .. ${EXTRA_CMAKE_OPTS}
+  - make VERBOSE=1
+  - if [ "$BITS" == "64" ]; then
+      TEST_SSL=1 SKIPS_AS_FAILS=1 ctest -V;
+    else
+      SKIPS_AS_FAILS=1 ctest -V;
+    fi;
+
+jobs:
+  include:
+    # Windows MinGW cross compile on Linux
+    - os: linux
+      dist: xenial
+      compiler: mingw
+      addons:
+        apt:
+          packages:
+            - ninja-build
+            - gcc-mingw-w64-x86-64
+            - g++-mingw-w64-x86-64
+      script:
+        - mkdir build && cd build
+        - CC=x86_64-w64-mingw32-gcc CXX=x86_64-w64-mingw32-g++ cmake .. -G Ninja -DCMAKE_BUILD_TYPE=Release -DCMAKE_BUILD_WITH_INSTALL_RPATH=on
+        - ninja -v
+
+    # Windows MSVC 2017
+    - os: windows
+      compiler: msvc
+      env:
+        - MATRIX_EVAL="CC=cl.exe && CXX=cl.exe"
+      before_install:
+        - eval "${MATRIX_EVAL}"
+      install:
+        - choco install ninja
+        - choco install -y memurai-developer
+      script:
+        - mkdir build && cd build
+        - cmd.exe //C 'C:\Program Files (x86)\Microsoft Visual Studio\2017\BuildTools\VC\Auxiliary\Build\vcvarsall.bat' amd64 '&&'
+          cmake .. -G Ninja -DCMAKE_BUILD_TYPE=Release -DENABLE_EXAMPLES=ON '&&' ninja -v
+        - ./hiredis-test.exe
diff --git a/redis-stable/deps/hiredis/CHANGELOG.md b/redis-stable/deps/hiredis/CHANGELOG.md
new file mode 100644
index 00000000..271f1fcf
--- /dev/null
+++ b/redis-stable/deps/hiredis/CHANGELOG.md
@@ -0,0 +1,345 @@
+## [1.0.0](https://github.com/redis/hiredis/tree/v1.0.0) - (2020-08-03)
+
+Announcing Hiredis v1.0.0, which adds support for RESP3, SSL connections, allocator injection, and better Windows support! :tada:
+
+_A big thanks to everyone who helped with this release.  The following list includes everyone who contributed at least five lines, sorted by lines contributed._ :sparkling_heart:
+
+[Michael Grunder](https://github.com/michael-grunder), [Yossi Gottlieb](https://github.com/yossigo),
+[Mark Nunberg](https://github.com/mnunberg), [Marcus Geelnard](https://github.com/mbitsnbites),
+[Justin Brewer](https://github.com/justinbrewer), [Valentino Geron](https://github.com/valentinogeron),
+[Minun Dragonation](https://github.com/dragonation), [Omri Steiner](https://github.com/OmriSteiner),
+[Sangmoon Yi](https://github.com/jman-krafton), [Jinjiazh](https://github.com/jinjiazhang),
+[Odin Hultgren Van Der Horst](https://github.com/Miniwoffer), [Muhammad Zahalqa](https://github.com/tryfinally),
+[Nick Rivera](https://github.com/heronr), [Qi Yang](https://github.com/movebean),
+[kevin1018](https://github.com/kevin1018)
+
+[Full Changelog](https://github.com/redis/hiredis/compare/v0.14.1...v1.0.0)
+
+**BREAKING CHANGES**:
+
+* `redisOptions` now has two timeout fields.  One for connecting, and one for commands.  If you're presently using `options->timeout` you will need to change it to use `options->connect_timeout`. (See [example](https://github.com/redis/hiredis/commit/38b5ae543f5c99eb4ccabbe277770fc6bc81226f#diff-86ba39d37aa829c8c82624cce4f049fbL36))
+
+* Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now protocol errors. This is consistent
+  with the RESP specification. On 32-bit platforms, the upper bound is lowered to `SIZE_MAX`.
+
+* `redisReplyObjectFunctions.createArray` now takes `size_t` for its length parameter.
+
+**New features:**
+- Support for RESP3
+  [\#697](https://github.com/redis/hiredis/pull/697),
+  [\#805](https://github.com/redis/hiredis/pull/805),
+  [\#819](https://github.com/redis/hiredis/pull/819),
+  [\#841](https://github.com/redis/hiredis/pull/841)
+  ([Yossi Gottlieb](https://github.com/yossigo), [Michael Grunder](https://github.com/michael-grunder))
+- Support for SSL connections
+  [\#645](https://github.com/redis/hiredis/pull/645),
+  [\#699](https://github.com/redis/hiredis/pull/699),
+  [\#702](https://github.com/redis/hiredis/pull/702),
+  [\#708](https://github.com/redis/hiredis/pull/708),
+  [\#711](https://github.com/redis/hiredis/pull/711),
+  [\#821](https://github.com/redis/hiredis/pull/821),
+  [more](https://github.com/redis/hiredis/pulls?q=is%3Apr+is%3Amerged+SSL)
+  ([Mark Nunberg](https://github.com/mnunberg), [Yossi Gottlieb](https://github.com/yossigo))
+- Run-time allocator injection
+  [\#800](https://github.com/redis/hiredis/pull/800)
+  ([Michael Grunder](https://github.com/michael-grunder))
+- Improved Windows support (including MinGW and Windows CI)
+  [\#652](https://github.com/redis/hiredis/pull/652),
+  [\#663](https://github.com/redis/hiredis/pull/663)
+  ([Marcus Geelnard](https://www.bitsnbites.eu/author/m/))
+- Adds support for distinct connect and command timeouts
+  [\#839](https://github.com/redis/hiredis/pull/839),
+  [\#829](https://github.com/redis/hiredis/pull/829)
+  ([Valentino Geron](https://github.com/valentinogeron))
+- Add generic pointer and destructor to `redisContext` that users can use for context.
+  [\#855](https://github.com/redis/hiredis/pull/855)
+  ([Michael Grunder](https://github.com/michael-grunder))
+
+**Closed issues (that involved code changes):**
+
+- Makefile does not install TLS libraries  [\#809](https://github.com/redis/hiredis/issues/809)
+- redisConnectWithOptions should not set command timeout [\#722](https://github.com/redis/hiredis/issues/722), [\#829](https://github.com/redis/hiredis/pull/829) ([valentinogeron](https://github.com/valentinogeron))
+- Fix integer overflow in `sdsrange` [\#827](https://github.com/redis/hiredis/issues/827)
+- INFO & CLUSTER commands failed when using RESP3 [\#802](https://github.com/redis/hiredis/issues/802)
+- Windows compatibility patches [\#687](https://github.com/redis/hiredis/issues/687), [\#838](https://github.com/redis/hiredis/issues/838), [\#842](https://github.com/redis/hiredis/issues/842)
+- RESP3 PUSH messages incorrectly use pending callback [\#825](https://github.com/redis/hiredis/issues/825)
+- Asynchronous PSUBSCRIBE command fails when using RESP3 [\#815](https://github.com/redis/hiredis/issues/815)
+- New SSL API [\#804](https://github.com/redis/hiredis/issues/804), [\#813](https://github.com/redis/hiredis/issues/813)
+- Hard-coded limit of nested reply depth [\#794](https://github.com/redis/hiredis/issues/794)
+- Fix TCP_NODELAY in Windows/OSX [\#679](https://github.com/redis/hiredis/issues/679), [\#690](https://github.com/redis/hiredis/issues/690), [\#779](https://github.com/redis/hiredis/issues/779), [\#785](https://github.com/redis/hiredis/issues/785),
+- Added timers to libev adapter.  [\#778](https://github.com/redis/hiredis/issues/778), [\#795](https://github.com/redis/hiredis/pull/795)
+- Initialization discards const qualifier [\#777](https://github.com/redis/hiredis/issues/777)
+- \[BUG\]\[MinGW64\] Error setting socket timeout  [\#775](https://github.com/redis/hiredis/issues/775)
+- undefined reference to hi_malloc [\#769](https://github.com/redis/hiredis/issues/769)
+- hiredis pkg-config file incorrectly ignores multiarch libdir spec'n [\#767](https://github.com/redis/hiredis/issues/767)
+- Don't use -G to build shared object on Solaris [\#757](https://github.com/redis/hiredis/issues/757)
+- error when make USE\_SSL=1 [\#748](https://github.com/redis/hiredis/issues/748)
+- Allow to change SSL Mode [\#646](https://github.com/redis/hiredis/issues/646)
+- hiredis/adapters/libevent.h memleak [\#618](https://github.com/redis/hiredis/issues/618)
+- redisLibuvPoll crash when server closes the connetion [\#545](https://github.com/redis/hiredis/issues/545)
+- about redisAsyncDisconnect question [\#518](https://github.com/redis/hiredis/issues/518)
+- hiredis adapters libuv error for help [\#508](https://github.com/redis/hiredis/issues/508)
+- API/ABI changes analysis [\#506](https://github.com/redis/hiredis/issues/506)
+- Memory leak patch in Redis [\#502](https://github.com/redis/hiredis/issues/502)
+- Remove the depth limitation [\#421](https://github.com/redis/hiredis/issues/421)
+
+**Merged pull requests:**
+
+- Move SSL management to a distinct private pointer [\#855](https://github.com/redis/hiredis/pull/855) ([michael-grunder](https://github.com/michael-grunder))
+- Move include to sockcompat.h to maintain style [\#850](https://github.com/redis/hiredis/pull/850) ([michael-grunder](https://github.com/michael-grunder))
+- Remove erroneous tag and add license to push example [\#849](https://github.com/redis/hiredis/pull/849) ([michael-grunder](https://github.com/michael-grunder))
+- fix windows compiling with mingw [\#848](https://github.com/redis/hiredis/pull/848) ([rmalizia44](https://github.com/rmalizia44))
+- Some Windows quality of life improvements. [\#846](https://github.com/redis/hiredis/pull/846) ([michael-grunder](https://github.com/michael-grunder))
+- Use \_WIN32 define instead of WIN32 [\#845](https://github.com/redis/hiredis/pull/845) ([michael-grunder](https://github.com/michael-grunder))
+- Non Linux CI fixes [\#844](https://github.com/redis/hiredis/pull/844) ([michael-grunder](https://github.com/michael-grunder))
+- Resp3 oob push support [\#841](https://github.com/redis/hiredis/pull/841) ([michael-grunder](https://github.com/michael-grunder))
+- fix \#785: defer TCP\_NODELAY in async tcp connections [\#836](https://github.com/redis/hiredis/pull/836) ([OmriSteiner](https://github.com/OmriSteiner))
+- sdsrange overflow fix [\#830](https://github.com/redis/hiredis/pull/830) ([michael-grunder](https://github.com/michael-grunder))
+- Use explicit pointer casting for c++ compatibility [\#826](https://github.com/redis/hiredis/pull/826) ([aureus1](https://github.com/aureus1))
+- Document allocator injection and completeness fix in test.c [\#824](https://github.com/redis/hiredis/pull/824) ([michael-grunder](https://github.com/michael-grunder))
+- Use unique names for allocator struct members [\#823](https://github.com/redis/hiredis/pull/823) ([michael-grunder](https://github.com/michael-grunder))
+- New SSL API to replace redisSecureConnection\(\). [\#821](https://github.com/redis/hiredis/pull/821) ([yossigo](https://github.com/yossigo))
+- Add logic to handle RESP3 push messages [\#819](https://github.com/redis/hiredis/pull/819) ([michael-grunder](https://github.com/michael-grunder))
+- Use standrad isxdigit instead of custom helper function. [\#814](https://github.com/redis/hiredis/pull/814) ([tryfinally](https://github.com/tryfinally))
+- Fix missing SSL build/install options. [\#812](https://github.com/redis/hiredis/pull/812) ([yossigo](https://github.com/yossigo))
+- Add link to ABI tracker [\#808](https://github.com/redis/hiredis/pull/808) ([michael-grunder](https://github.com/michael-grunder))
+- Resp3 verbatim string support [\#805](https://github.com/redis/hiredis/pull/805) ([michael-grunder](https://github.com/michael-grunder))
+- Allow users to replace allocator and handle OOM everywhere. [\#800](https://github.com/redis/hiredis/pull/800) ([michael-grunder](https://github.com/michael-grunder))
+- Remove nested depth limitation. [\#797](https://github.com/redis/hiredis/pull/797) ([michael-grunder](https://github.com/michael-grunder))
+- Attempt to fix compilation on Solaris [\#796](https://github.com/redis/hiredis/pull/796) ([michael-grunder](https://github.com/michael-grunder))
+- Support timeouts in libev adapater [\#795](https://github.com/redis/hiredis/pull/795) ([michael-grunder](https://github.com/michael-grunder))
+- Fix pkgconfig when installing to a custom lib dir [\#793](https://github.com/redis/hiredis/pull/793) ([michael-grunder](https://github.com/michael-grunder))
+- Fix USE\_SSL=1 make/cmake on OSX and CMake tests [\#789](https://github.com/redis/hiredis/pull/789) ([michael-grunder](https://github.com/michael-grunder))
+- Use correct libuv call on Windows [\#784](https://github.com/redis/hiredis/pull/784) ([michael-grunder](https://github.com/michael-grunder))
+- Added CMake package config and fixed hiredis\_ssl on Windows [\#783](https://github.com/redis/hiredis/pull/783) ([michael-grunder](https://github.com/michael-grunder))
+- CMake: Set hiredis\_ssl shared object version. [\#780](https://github.com/redis/hiredis/pull/780) ([yossigo](https://github.com/yossigo))
+- Win32 tests and timeout fix [\#776](https://github.com/redis/hiredis/pull/776) ([michael-grunder](https://github.com/michael-grunder))
+- Provides an optional cleanup callback for async data. [\#768](https://github.com/redis/hiredis/pull/768) ([heronr](https://github.com/heronr))
+- Housekeeping fixes [\#764](https://github.com/redis/hiredis/pull/764) ([michael-grunder](https://github.com/michael-grunder))
+- install alloc.h [\#756](https://github.com/redis/hiredis/pull/756) ([ch1aki](https://github.com/ch1aki))
+- fix spelling mistakes [\#746](https://github.com/redis/hiredis/pull/746) ([ShooterIT](https://github.com/ShooterIT))
+- Free the reply in redisGetReply when passed NULL [\#741](https://github.com/redis/hiredis/pull/741) ([michael-grunder](https://github.com/michael-grunder))
+- Fix dead code in sslLogCallback relating to should\_log variable. [\#737](https://github.com/redis/hiredis/pull/737) ([natoscott](https://github.com/natoscott))
+- Fix typo in dict.c. [\#731](https://github.com/redis/hiredis/pull/731) ([Kevin-Xi](https://github.com/Kevin-Xi))
+- Adding an option to DISABLE\_TESTS [\#727](https://github.com/redis/hiredis/pull/727) ([pbotros](https://github.com/pbotros))
+- Update README with SSL support. [\#720](https://github.com/redis/hiredis/pull/720) ([yossigo](https://github.com/yossigo))
+- Fixes leaks in unit tests [\#715](https://github.com/redis/hiredis/pull/715) ([michael-grunder](https://github.com/michael-grunder))
+- SSL Tests [\#711](https://github.com/redis/hiredis/pull/711) ([yossigo](https://github.com/yossigo))
+- SSL Reorganization [\#708](https://github.com/redis/hiredis/pull/708) ([yossigo](https://github.com/yossigo))
+- Fix MSVC build. [\#706](https://github.com/redis/hiredis/pull/706) ([yossigo](https://github.com/yossigo))
+- SSL: Properly report SSL\_connect\(\) errors. [\#702](https://github.com/redis/hiredis/pull/702) ([yossigo](https://github.com/yossigo))
+- Silent SSL trace to stdout by default. [\#699](https://github.com/redis/hiredis/pull/699) ([yossigo](https://github.com/yossigo))
+- Port RESP3 support from Redis. [\#697](https://github.com/redis/hiredis/pull/697) ([yossigo](https://github.com/yossigo))
+- Removed whitespace before newline [\#691](https://github.com/redis/hiredis/pull/691) ([Miniwoffer](https://github.com/Miniwoffer))
+- Add install adapters header files [\#688](https://github.com/redis/hiredis/pull/688) ([kevin1018](https://github.com/kevin1018))
+- Remove unnecessary null check before free [\#684](https://github.com/redis/hiredis/pull/684) ([qlyoung](https://github.com/qlyoung))
+- redisReaderGetReply leak memory [\#671](https://github.com/redis/hiredis/pull/671) ([movebean](https://github.com/movebean))
+- fix timeout code in windows [\#670](https://github.com/redis/hiredis/pull/670) ([jman-krafton](https://github.com/jman-krafton))
+- test: fix errstr matching for musl libc [\#665](https://github.com/redis/hiredis/pull/665) ([ghost](https://github.com/ghost))
+- Windows: MinGW fixes and Windows Travis builders [\#663](https://github.com/redis/hiredis/pull/663) ([mbitsnbites](https://github.com/mbitsnbites))
+- The setsockopt and getsockopt API diffs from BSD socket and WSA one [\#662](https://github.com/redis/hiredis/pull/662) ([dragonation](https://github.com/dragonation))
+- Fix Compile Error On Windows \(Visual Studio\) [\#658](https://github.com/redis/hiredis/pull/658) ([jinjiazhang](https://github.com/jinjiazhang))
+- Fix NXDOMAIN test case [\#653](https://github.com/redis/hiredis/pull/653) ([michael-grunder](https://github.com/michael-grunder))
+- Add MinGW support [\#652](https://github.com/redis/hiredis/pull/652) ([mbitsnbites](https://github.com/mbitsnbites))
+- SSL Support [\#645](https://github.com/redis/hiredis/pull/645) ([mnunberg](https://github.com/mnunberg))
+- Fix Invalid argument after redisAsyncConnectUnix [\#644](https://github.com/redis/hiredis/pull/644) ([codehz](https://github.com/codehz))
+- Makefile: use predefined AR [\#632](https://github.com/redis/hiredis/pull/632) ([Mic92](https://github.com/Mic92))
+- FreeBSD  build fix [\#628](https://github.com/redis/hiredis/pull/628) ([devnexen](https://github.com/devnexen))
+- Fix errors not propagating properly with libuv.h. [\#624](https://github.com/redis/hiredis/pull/624) ([yossigo](https://github.com/yossigo))
+- Update README.md [\#621](https://github.com/redis/hiredis/pull/621) ([Crunsher](https://github.com/Crunsher))
+- Fix redisBufferRead documentation [\#620](https://github.com/redis/hiredis/pull/620) ([hacst](https://github.com/hacst))
+- Add CPPFLAGS to REAL\_CFLAGS [\#614](https://github.com/redis/hiredis/pull/614) ([thomaslee](https://github.com/thomaslee))
+- Update createArray to take size\_t [\#597](https://github.com/redis/hiredis/pull/597) ([justinbrewer](https://github.com/justinbrewer))
+- fix common realloc mistake and add null check more [\#580](https://github.com/redis/hiredis/pull/580) ([charsyam](https://github.com/charsyam))
+- Proper error reporting for connect failures [\#578](https://github.com/redis/hiredis/pull/578) ([mnunberg](https://github.com/mnunberg))
+
+\* *This Changelog was automatically generated by [github_changelog_generator](https://github.com/github-changelog-generator/github-changelog-generator)*
+
+## [1.0.0-rc1](https://github.com/redis/hiredis/tree/v1.0.0-rc1) - (2020-07-29)
+
+_Note:  There were no changes to code between v1.0.0-rc1 and v1.0.0 so see v1.0.0 for changelog_
+
+### 0.14.1 (2020-03-13)
+
+* Adds safe allocation wrappers (CVE-2020-7105, #747, #752) (Michael Grunder)
+
+### 0.14.0 (2018-09-25)
+**BREAKING CHANGES**:
+
+* Change `redisReply.len` to `size_t`, as it denotes the the size of a string
+
+  User code should compare this to `size_t` values as well.
+  If it was used to compare to other values, casting might be necessary or can be removed, if casting was applied before.
+
+* Make string2ll static to fix conflict with Redis (Tom Lee [c3188b])
+* Use -dynamiclib instead of -shared for OSX (Ryan Schmidt [a65537])
+* Use string2ll from Redis w/added tests (Michael Grunder [7bef04, 60f622])
+* Makefile - OSX compilation fixes (Ryan Schmidt [881fcb, 0e9af8])
+* Remove redundant NULL checks (Justin Brewer [54acc8, 58e6b8])
+* Fix bulk and multi-bulk length truncation (Justin Brewer [109197])
+* Fix SIGSEGV in OpenBSD by checking for NULL before calling freeaddrinfo (Justin Brewer [546d94])
+* Several POSIX compatibility fixes (Justin Brewer [bbeab8, 49bbaa, d1c1b6])
+* Makefile - Compatibility fixes (Dimitri Vorobiev [3238cf, 12a9d1])
+* Makefile - Fix make install on FreeBSD (Zach Shipko [a2ef2b])
+* Makefile - don't assume $(INSTALL) is cp (Igor Gnatenko [725a96])
+* Separate side-effect causing function from assert and small cleanup (amallia [b46413, 3c3234])
+* Don't send negative values to `__redisAsyncCommand` (Frederik Deweerdt [706129])
+* Fix leak if setsockopt fails (Frederik Deweerdt [e21c9c])
+* Fix libevent leak (zfz [515228])
+* Clean up GCC warning (Ichito Nagata [2ec774])
+* Keep track of errno in `__redisSetErrorFromErrno()` as snprintf may use it (Jin Qing [25cd88])
+* Solaris compilation fix (Donald Whyte [41b07d])
+* Reorder linker arguments when building examples (Tustfarm-heart [06eedd])
+* Keep track of subscriptions in case of rapid subscribe/unsubscribe (Hyungjin Kim [073dc8, be76c5, d46999])
+* libuv use after free fix (Paul Scott [cbb956])
+* Properly close socket fd on reconnect attempt (WSL [64d1ec])
+* Skip valgrind in OSX tests (Jan-Erik Rediger [9deb78])
+* Various updates for Travis testing OSX (Ted Nyman [fa3774, 16a459, bc0ea5])
+* Update libevent (Chris Xin [386802])
+* Change sds.h for building in C++ projects (Ali Volkan ATLI [f5b32e])
+* Use proper format specifier in redisFormatSdsCommandArgv (Paulino Huerta, Jan-Erik Rediger [360a06, 8655a6])
+* Better handling of NULL reply in example code (Jan-Erik Rediger [1b8ed3])
+* Prevent overflow when formatting an error (Jan-Erik Rediger [0335cb])
+* Compatibility fix for strerror_r (Tom Lee [bb1747])
+* Properly detect integer parse/overflow errors (Justin Brewer [93421f])
+* Adds CI for Windows and cygwin fixes (owent, [6c53d6, 6c3e40])
+* Catch a buffer overflow when formatting the error message
+* Import latest upstream sds. This breaks applications that are linked against the old hiredis v0.13
+* Fix warnings, when compiled with -Wshadow
+* Make hiredis compile in Cygwin on Windows, now CI-tested
+* Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now
+  protocol errors. This is consistent with the RESP specification. On 32-bit
+  platforms, the upper bound is lowered to `SIZE_MAX`.
+
+* Remove backwards compatibility macro's
+
+This removes the following old function aliases, use the new name now:
+
+| Old                         | New                    |
+| --------------------------- | ---------------------- |
+| redisReplyReaderCreate      | redisReaderCreate      |
+| redisReplyReaderCreate      | redisReaderCreate      |
+| redisReplyReaderFree        | redisReaderFree        |
+| redisReplyReaderFeed        | redisReaderFeed        |
+| redisReplyReaderGetReply    | redisReaderGetReply    |
+| redisReplyReaderSetPrivdata | redisReaderSetPrivdata |
+| redisReplyReaderGetObject   | redisReaderGetObject   |
+| redisReplyReaderGetError    | redisReaderGetError    |
+
+* The `DEBUG` variable in the Makefile was renamed to `DEBUG_FLAGS`
+
+Previously it broke some builds for people that had `DEBUG` set to some arbitrary value,
+due to debugging other software.
+By renaming we avoid unintentional name clashes.
+
+Simply rename `DEBUG` to `DEBUG_FLAGS` in your environment to make it working again.
+
+### 0.13.3 (2015-09-16)
+
+* Revert "Clear `REDIS_CONNECTED` flag when connection is closed".
+* Make tests pass on FreeBSD (Thanks, Giacomo Olgeni)
+
+
+If the `REDIS_CONNECTED` flag is cleared,
+the async onDisconnect callback function will never be called.
+This causes problems as the disconnect is never reported back to the user.
+
+### 0.13.2 (2015-08-25)
+
+* Prevent crash on pending replies in async code (Thanks, @switch-st)
+* Clear `REDIS_CONNECTED` flag when connection is closed (Thanks, Jerry Jacobs)
+* Add MacOS X addapter (Thanks, @dizzus)
+* Add Qt adapter (Thanks, Pietro Cerutti)
+* Add Ivykis adapter (Thanks, Gergely Nagy)
+
+All adapters are provided as is and are only tested where possible.
+
+### 0.13.1 (2015-05-03)
+
+This is a bug fix release.
+The new `reconnect` method introduced new struct members, which clashed with pre-defined names in pre-C99 code.
+Another commit forced C99 compilation just to make it work, but of course this is not desirable for outside projects.
+Other non-C99 code can now use hiredis as usual again.
+Sorry for the inconvenience.
+
+* Fix memory leak in async reply handling (Salvatore Sanfilippo)
+* Rename struct member to avoid name clash with pre-c99 code (Alex Balashov, ncopa)
+
+### 0.13.0 (2015-04-16)
+
+This release adds a minimal Windows compatibility layer.
+The parser, standalone since v0.12.0, can now be compiled on Windows
+(and thus used in other client libraries as well)
+
+* Windows compatibility layer for parser code (tzickel)
+* Properly escape data printed to PKGCONF file (Dan Skorupski)
+* Fix tests when assert() undefined (Keith Bennett, Matt Stancliff)
+* Implement a reconnect method for the client context, this changes the structure of `redisContext` (Aaron Bedra)
+
+### 0.12.1 (2015-01-26)
+
+* Fix `make install`: DESTDIR support, install all required files, install PKGCONF in proper location
+* Fix `make test` as 32 bit build on 64 bit platform
+
+### 0.12.0 (2015-01-22)
+
+* Add optional KeepAlive support
+
+* Try again on EINTR errors
+
+* Add libuv adapter
+
+* Add IPv6 support
+
+* Remove possibility of multiple close on same fd
+
+* Add ability to bind source address on connect
+
+* Add redisConnectFd() and redisFreeKeepFd()
+
+* Fix getaddrinfo() memory leak
+
+* Free string if it is unused (fixes memory leak)
+
+* Improve redisAppendCommandArgv performance 2.5x
+
+* Add support for SO_REUSEADDR
+
+* Fix redisvFormatCommand format parsing
+
+* Add GLib 2.0 adapter
+
+* Refactor reading code into read.c
+
+* Fix errno error buffers to not clobber errors
+
+* Generate pkgconf during build
+
+* Silence _BSD_SOURCE warnings
+
+* Improve digit counting for multibulk creation
+
+
+### 0.11.0
+
+* Increase the maximum multi-bulk reply depth to 7.
+
+* Increase the read buffer size from 2k to 16k.
+
+* Use poll(2) instead of select(2) to support large fds (>= 1024).
+
+### 0.10.1
+
+* Makefile overhaul. Important to check out if you override one or more
+  variables using environment variables or via arguments to the "make" tool.
+
+* Issue #45: Fix potential memory leak for a multi bulk reply with 0 elements
+  being created by the default reply object functions.
+
+* Issue #43: Don't crash in an asynchronous context when Redis returns an error
+  reply after the connection has been made (this happens when the maximum
+  number of connections is reached).
+
+### 0.10.0
+
+* See commit log.
diff --git a/redis-stable/deps/hiredis/CMakeLists.txt b/redis-stable/deps/hiredis/CMakeLists.txt
new file mode 100644
index 00000000..f86c9b70
--- /dev/null
+++ b/redis-stable/deps/hiredis/CMakeLists.txt
@@ -0,0 +1,165 @@
+CMAKE_MINIMUM_REQUIRED(VERSION 3.4.0)
+INCLUDE(GNUInstallDirs)
+PROJECT(hiredis)
+
+OPTION(ENABLE_SSL "Build hiredis_ssl for SSL support" OFF)
+OPTION(DISABLE_TESTS "If tests should be compiled or not" OFF)
+OPTION(ENABLE_SSL_TESTS, "Should we test SSL connections" OFF)
+
+MACRO(getVersionBit name)
+  SET(VERSION_REGEX "^#define ${name} (.+)$")
+  FILE(STRINGS "${CMAKE_CURRENT_SOURCE_DIR}/hiredis.h"
+    VERSION_BIT REGEX ${VERSION_REGEX})
+  STRING(REGEX REPLACE ${VERSION_REGEX} "\\1" ${name} "${VERSION_BIT}")
+ENDMACRO(getVersionBit)
+
+getVersionBit(HIREDIS_MAJOR)
+getVersionBit(HIREDIS_MINOR)
+getVersionBit(HIREDIS_PATCH)
+getVersionBit(HIREDIS_SONAME)
+SET(VERSION "${HIREDIS_MAJOR}.${HIREDIS_MINOR}.${HIREDIS_PATCH}")
+MESSAGE("Detected version: ${VERSION}")
+
+PROJECT(hiredis VERSION "${VERSION}")
+
+SET(ENABLE_EXAMPLES OFF CACHE BOOL "Enable building hiredis examples")
+
+SET(hiredis_sources
+    alloc.c
+    async.c
+    dict.c
+    hiredis.c
+    net.c
+    read.c
+    sds.c
+    sockcompat.c)
+
+SET(hiredis_sources ${hiredis_sources})
+
+IF(WIN32)
+    ADD_COMPILE_DEFINITIONS(_CRT_SECURE_NO_WARNINGS WIN32_LEAN_AND_MEAN)
+ENDIF()
+
+ADD_LIBRARY(hiredis SHARED ${hiredis_sources})
+
+SET_TARGET_PROPERTIES(hiredis
+    PROPERTIES WINDOWS_EXPORT_ALL_SYMBOLS TRUE
+    VERSION "${HIREDIS_SONAME}")
+IF(WIN32 OR MINGW)
+    TARGET_LINK_LIBRARIES(hiredis PRIVATE ws2_32)
+ENDIF()
+
+TARGET_INCLUDE_DIRECTORIES(hiredis PUBLIC $<INSTALL_INTERFACE:.> $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
+
+CONFIGURE_FILE(hiredis.pc.in hiredis.pc @ONLY)
+
+INSTALL(TARGETS hiredis
+    EXPORT hiredis-targets
+    RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
+    LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
+    ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR})
+
+INSTALL(FILES hiredis.h read.h sds.h async.h alloc.h
+    DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
+    
+INSTALL(DIRECTORY adapters
+    DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
+    
+INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis.pc
+    DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig)
+
+export(EXPORT hiredis-targets
+    FILE "${CMAKE_CURRENT_BINARY_DIR}/hiredis-targets.cmake"
+    NAMESPACE hiredis::)
+
+SET(CMAKE_CONF_INSTALL_DIR share/hiredis)
+SET(INCLUDE_INSTALL_DIR include)
+include(CMakePackageConfigHelpers)
+configure_package_config_file(hiredis-config.cmake.in ${CMAKE_CURRENT_BINARY_DIR}/hiredis-config.cmake
+                              INSTALL_DESTINATION ${CMAKE_CONF_INSTALL_DIR}
+                              PATH_VARS INCLUDE_INSTALL_DIR)
+
+INSTALL(EXPORT hiredis-targets
+        FILE hiredis-targets.cmake
+        NAMESPACE hiredis::
+        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
+
+INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis-config.cmake
+        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
+
+
+IF(ENABLE_SSL)
+    IF (NOT OPENSSL_ROOT_DIR)
+        IF (APPLE)
+            SET(OPENSSL_ROOT_DIR "/usr/local/opt/openssl")
+        ENDIF()
+    ENDIF()
+    FIND_PACKAGE(OpenSSL REQUIRED)
+    SET(hiredis_ssl_sources 
+        ssl.c)
+    ADD_LIBRARY(hiredis_ssl SHARED
+            ${hiredis_ssl_sources})
+
+    IF (APPLE)
+        SET_PROPERTY(TARGET hiredis_ssl PROPERTY LINK_FLAGS "-Wl,-undefined -Wl,dynamic_lookup")
+    ENDIF()
+
+    SET_TARGET_PROPERTIES(hiredis_ssl
+        PROPERTIES
+        WINDOWS_EXPORT_ALL_SYMBOLS TRUE
+        VERSION "${HIREDIS_SONAME}")
+
+    TARGET_INCLUDE_DIRECTORIES(hiredis_ssl PRIVATE "${OPENSSL_INCLUDE_DIR}")
+    TARGET_LINK_LIBRARIES(hiredis_ssl PRIVATE ${OPENSSL_LIBRARIES})
+    IF (WIN32 OR MINGW)
+        TARGET_LINK_LIBRARIES(hiredis_ssl PRIVATE hiredis)
+    ENDIF()
+    CONFIGURE_FILE(hiredis_ssl.pc.in hiredis_ssl.pc @ONLY)
+
+    INSTALL(TARGETS hiredis_ssl
+        EXPORT hiredis_ssl-targets
+        RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
+        LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
+        ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR})
+
+    INSTALL(FILES hiredis_ssl.h
+        DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
+    
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl.pc
+        DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig)
+
+    export(EXPORT hiredis_ssl-targets
+           FILE "${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-targets.cmake"
+           NAMESPACE hiredis::)
+
+    SET(CMAKE_CONF_INSTALL_DIR share/hiredis_ssl)
+    configure_package_config_file(hiredis_ssl-config.cmake.in ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-config.cmake
+                                  INSTALL_DESTINATION ${CMAKE_CONF_INSTALL_DIR}
+                                  PATH_VARS INCLUDE_INSTALL_DIR)
+
+    INSTALL(EXPORT hiredis_ssl-targets
+        FILE hiredis_ssl-targets.cmake
+        NAMESPACE hiredis::
+        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
+
+    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-config.cmake
+        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
+ENDIF()
+
+IF(NOT DISABLE_TESTS)
+    ENABLE_TESTING()
+    ADD_EXECUTABLE(hiredis-test test.c)
+    IF(ENABLE_SSL_TESTS)
+        ADD_DEFINITIONS(-DHIREDIS_TEST_SSL=1)
+        TARGET_LINK_LIBRARIES(hiredis-test hiredis hiredis_ssl)
+    ELSE()
+        TARGET_LINK_LIBRARIES(hiredis-test hiredis)
+    ENDIF()
+    ADD_TEST(NAME hiredis-test
+        COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/test.sh)
+ENDIF()
+
+# Add examples
+IF(ENABLE_EXAMPLES)
+  ADD_SUBDIRECTORY(examples)
+ENDIF(ENABLE_EXAMPLES)
diff --git a/redis-stable/deps/hiredis/COPYING b/redis-stable/deps/hiredis/COPYING
new file mode 100644
index 00000000..a5fc9739
--- /dev/null
+++ b/redis-stable/deps/hiredis/COPYING
@@ -0,0 +1,29 @@
+Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice,
+  this list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of Redis nor the names of its contributors may be used
+  to endorse or promote products derived from this software without specific
+  prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/deps/hiredis/Makefile b/redis-stable/deps/hiredis/Makefile
new file mode 100644
index 00000000..7e41c97a
--- /dev/null
+++ b/redis-stable/deps/hiredis/Makefile
@@ -0,0 +1,313 @@
+# Hiredis Makefile
+# Copyright (C) 2010-2011 Salvatore Sanfilippo <antirez at gmail dot com>
+# Copyright (C) 2010-2011 Pieter Noordhuis <pcnoordhuis at gmail dot com>
+# This file is released under the BSD license, see the COPYING file
+
+OBJ=alloc.o net.o hiredis.o sds.o async.o read.o sockcompat.o
+SSL_OBJ=ssl.o
+EXAMPLES=hiredis-example hiredis-example-libevent hiredis-example-libev hiredis-example-glib hiredis-example-push
+ifeq ($(USE_SSL),1)
+EXAMPLES+=hiredis-example-ssl hiredis-example-libevent-ssl
+endif
+TESTS=hiredis-test
+LIBNAME=libhiredis
+PKGCONFNAME=hiredis.pc
+SSL_LIBNAME=libhiredis_ssl
+SSL_PKGCONFNAME=hiredis_ssl.pc
+
+HIREDIS_MAJOR=$(shell grep HIREDIS_MAJOR hiredis.h | awk '{print $$3}')
+HIREDIS_MINOR=$(shell grep HIREDIS_MINOR hiredis.h | awk '{print $$3}')
+HIREDIS_PATCH=$(shell grep HIREDIS_PATCH hiredis.h | awk '{print $$3}')
+HIREDIS_SONAME=$(shell grep HIREDIS_SONAME hiredis.h | awk '{print $$3}')
+
+# Installation related variables and target
+PREFIX?=/usr/local
+INCLUDE_PATH?=include/hiredis
+LIBRARY_PATH?=lib
+PKGCONF_PATH?=pkgconfig
+INSTALL_INCLUDE_PATH= $(DESTDIR)$(PREFIX)/$(INCLUDE_PATH)
+INSTALL_LIBRARY_PATH= $(DESTDIR)$(PREFIX)/$(LIBRARY_PATH)
+INSTALL_PKGCONF_PATH= $(INSTALL_LIBRARY_PATH)/$(PKGCONF_PATH)
+
+# redis-server configuration used for testing
+REDIS_PORT=56379
+REDIS_SERVER=redis-server
+define REDIS_TEST_CONFIG
+	daemonize yes
+	pidfile /tmp/hiredis-test-redis.pid
+	port $(REDIS_PORT)
+	bind 127.0.0.1
+	unixsocket /tmp/hiredis-test-redis.sock
+endef
+export REDIS_TEST_CONFIG
+
+# Fallback to gcc when $CC is not in $PATH.
+CC:=$(shell sh -c 'type $${CC%% *} >/dev/null 2>/dev/null && echo $(CC) || echo gcc')
+CXX:=$(shell sh -c 'type $${CXX%% *} >/dev/null 2>/dev/null && echo $(CXX) || echo g++')
+OPTIMIZATION?=-O3
+WARNINGS=-Wall -W -Wstrict-prototypes -Wwrite-strings -Wno-missing-field-initializers
+DEBUG_FLAGS?= -g -ggdb
+REAL_CFLAGS=$(OPTIMIZATION) -fPIC $(CPPFLAGS) $(CFLAGS) $(WARNINGS) $(DEBUG_FLAGS)
+REAL_LDFLAGS=$(LDFLAGS)
+
+DYLIBSUFFIX=so
+STLIBSUFFIX=a
+DYLIB_MINOR_NAME=$(LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_SONAME)
+DYLIB_MAJOR_NAME=$(LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_MAJOR)
+DYLIBNAME=$(LIBNAME).$(DYLIBSUFFIX)
+
+DYLIB_MAKE_CMD=$(CC) -shared -Wl,-soname,$(DYLIB_MINOR_NAME)
+STLIBNAME=$(LIBNAME).$(STLIBSUFFIX)
+STLIB_MAKE_CMD=$(AR) rcs
+
+SSL_DYLIB_MINOR_NAME=$(SSL_LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_SONAME)
+SSL_DYLIB_MAJOR_NAME=$(SSL_LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_MAJOR)
+SSL_DYLIBNAME=$(SSL_LIBNAME).$(DYLIBSUFFIX)
+SSL_STLIBNAME=$(SSL_LIBNAME).$(STLIBSUFFIX)
+SSL_DYLIB_MAKE_CMD=$(CC) -shared -Wl,-soname,$(SSL_DYLIB_MINOR_NAME)
+
+# Platform-specific overrides
+uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
+
+USE_SSL?=0
+
+# This is required for test.c only
+ifeq ($(USE_SSL),1)
+  CFLAGS+=-DHIREDIS_TEST_SSL
+endif
+
+ifeq ($(uname_S),Linux)
+  ifdef OPENSSL_PREFIX
+    CFLAGS+=-I$(OPENSSL_PREFIX)/include
+    SSL_LDFLAGS+=-L$(OPENSSL_PREFIX)/lib -lssl -lcrypto
+  else
+    SSL_LDFLAGS=-lssl -lcrypto
+  endif
+else
+  OPENSSL_PREFIX?=/usr/local/opt/openssl
+  CFLAGS+=-I$(OPENSSL_PREFIX)/include
+  SSL_LDFLAGS+=-L$(OPENSSL_PREFIX)/lib -lssl -lcrypto
+endif
+
+ifeq ($(uname_S),SunOS)
+  IS_SUN_CC=$(shell sh -c '$(CC) -V 2>&1 |egrep -i -c "sun|studio"')
+  ifeq ($(IS_SUN_CC),1)
+    SUN_SHARED_FLAG=-G
+  else
+    SUN_SHARED_FLAG=-shared
+  endif
+  REAL_LDFLAGS+= -ldl -lnsl -lsocket
+  DYLIB_MAKE_CMD=$(CC) $(SUN_SHARED_FLAG) -o $(DYLIBNAME) -h $(DYLIB_MINOR_NAME) $(LDFLAGS)
+  SSL_DYLIB_MAKE_CMD=$(CC) $(SUN_SHARED_FLAG) -o $(SSL_DYLIBNAME) -h $(SSL_DYLIB_MINOR_NAME) $(LDFLAGS) $(SSL_LDFLAGS)
+endif
+ifeq ($(uname_S),Darwin)
+  DYLIBSUFFIX=dylib
+  DYLIB_MINOR_NAME=$(LIBNAME).$(HIREDIS_SONAME).$(DYLIBSUFFIX)
+  DYLIB_MAKE_CMD=$(CC) -dynamiclib -Wl,-install_name,$(PREFIX)/$(LIBRARY_PATH)/$(DYLIB_MINOR_NAME) -o $(DYLIBNAME) $(LDFLAGS)
+  SSL_DYLIB_MAKE_CMD=$(CC) -dynamiclib -Wl,-install_name,$(PREFIX)/$(LIBRARY_PATH)/$(SSL_DYLIB_MINOR_NAME) -o $(SSL_DYLIBNAME) $(LDFLAGS) $(SSL_LDFLAGS)
+  DYLIB_PLUGIN=-Wl,-undefined -Wl,dynamic_lookup
+endif
+
+all: $(DYLIBNAME) $(STLIBNAME) hiredis-test $(PKGCONFNAME)
+ifeq ($(USE_SSL),1)
+all: $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(SSL_PKGCONFNAME)
+endif
+
+# Deps (use make dep to generate this)
+alloc.o: alloc.c fmacros.h alloc.h
+async.o: async.c fmacros.h alloc.h async.h hiredis.h read.h sds.h net.h dict.c dict.h win32.h async_private.h
+dict.o: dict.c fmacros.h alloc.h dict.h
+hiredis.o: hiredis.c fmacros.h hiredis.h read.h sds.h alloc.h net.h async.h win32.h
+net.o: net.c fmacros.h net.h hiredis.h read.h sds.h alloc.h sockcompat.h win32.h
+read.o: read.c fmacros.h alloc.h read.h sds.h win32.h
+sds.o: sds.c sds.h sdsalloc.h alloc.h
+sockcompat.o: sockcompat.c sockcompat.h
+ssl.o: ssl.c hiredis.h read.h sds.h alloc.h async.h win32.h async_private.h
+test.o: test.c fmacros.h hiredis.h read.h sds.h alloc.h net.h sockcompat.h win32.h
+
+$(DYLIBNAME): $(OBJ)
+	$(DYLIB_MAKE_CMD) -o $(DYLIBNAME) $(OBJ) $(REAL_LDFLAGS)
+
+$(STLIBNAME): $(OBJ)
+	$(STLIB_MAKE_CMD) $(STLIBNAME) $(OBJ)
+
+$(SSL_DYLIBNAME): $(SSL_OBJ)
+	$(SSL_DYLIB_MAKE_CMD) $(DYLIB_PLUGIN) -o $(SSL_DYLIBNAME) $(SSL_OBJ) $(REAL_LDFLAGS) $(LDFLAGS) $(SSL_LDFLAGS)
+
+$(SSL_STLIBNAME): $(SSL_OBJ)
+	$(STLIB_MAKE_CMD) $(SSL_STLIBNAME) $(SSL_OBJ)
+
+dynamic: $(DYLIBNAME)
+static: $(STLIBNAME)
+ifeq ($(USE_SSL),1)
+dynamic: $(SSL_DYLIBNAME)
+static: $(SSL_STLIBNAME)
+endif
+
+# Binaries:
+hiredis-example-libevent: examples/example-libevent.c adapters/libevent.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -levent $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-libevent-ssl: examples/example-libevent-ssl.c adapters/libevent.h $(STLIBNAME) $(SSL_STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -levent $(STLIBNAME) $(SSL_STLIBNAME) $(REAL_LDFLAGS) $(SSL_LDFLAGS)
+
+hiredis-example-libev: examples/example-libev.c adapters/libev.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -lev $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-glib: examples/example-glib.c adapters/glib.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(shell pkg-config --cflags --libs glib-2.0) $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-ivykis: examples/example-ivykis.c adapters/ivykis.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -livykis $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-macosx: examples/example-macosx.c adapters/macosx.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -framework CoreFoundation $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-ssl: examples/example-ssl.c $(STLIBNAME) $(SSL_STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(SSL_STLIBNAME) $(REAL_LDFLAGS) $(SSL_LDFLAGS)
+
+
+ifndef AE_DIR
+hiredis-example-ae:
+	@echo "Please specify AE_DIR (e.g. <redis repository>/src)"
+	@false
+else
+hiredis-example-ae: examples/example-ae.c adapters/ae.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) $(REAL_LDFLAGS) -I. -I$(AE_DIR) $< $(AE_DIR)/ae.o $(AE_DIR)/zmalloc.o $(AE_DIR)/../deps/jemalloc/lib/libjemalloc.a -pthread $(STLIBNAME)
+endif
+
+ifndef LIBUV_DIR
+hiredis-example-libuv:
+	@echo "Please specify LIBUV_DIR (e.g. ../libuv/)"
+	@false
+else
+hiredis-example-libuv: examples/example-libuv.c adapters/libuv.h $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. -I$(LIBUV_DIR)/include $< $(LIBUV_DIR)/.libs/libuv.a -lpthread -lrt $(STLIBNAME) $(REAL_LDFLAGS)
+endif
+
+ifeq ($(and $(QT_MOC),$(QT_INCLUDE_DIR),$(QT_LIBRARY_DIR)),)
+hiredis-example-qt:
+	@echo "Please specify QT_MOC, QT_INCLUDE_DIR AND QT_LIBRARY_DIR"
+	@false
+else
+hiredis-example-qt: examples/example-qt.cpp adapters/qt.h $(STLIBNAME)
+	$(QT_MOC) adapters/qt.h -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore | \
+	    $(CXX) -x c++ -o qt-adapter-moc.o -c - $(REAL_CFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore
+	$(QT_MOC) examples/example-qt.h -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore | \
+	    $(CXX) -x c++ -o qt-example-moc.o -c - $(REAL_CFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore
+	$(CXX) -o examples/$@ $(REAL_CFLAGS) $(REAL_LDFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore -L$(QT_LIBRARY_DIR) qt-adapter-moc.o qt-example-moc.o $< -pthread $(STLIBNAME) -lQtCore
+endif
+
+hiredis-example: examples/example.c $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(REAL_LDFLAGS)
+
+hiredis-example-push: examples/example-push.c $(STLIBNAME)
+	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(REAL_LDFLAGS)
+
+examples: $(EXAMPLES)
+
+TEST_LIBS = $(STLIBNAME)
+ifeq ($(USE_SSL),1)
+    TEST_LIBS += $(SSL_STLIBNAME)
+    TEST_LDFLAGS = $(SSL_LDFLAGS) -lssl -lcrypto -lpthread
+endif
+
+hiredis-test: test.o $(TEST_LIBS)
+	$(CC) -o $@ $(REAL_CFLAGS) -I. $^ $(REAL_LDFLAGS) $(TEST_LDFLAGS)
+
+hiredis-%: %.o $(STLIBNAME)
+	$(CC) $(REAL_CFLAGS) -o $@ $< $(TEST_LIBS) $(REAL_LDFLAGS)
+
+test: hiredis-test
+	./hiredis-test
+
+check: hiredis-test
+	TEST_SSL=$(USE_SSL) ./test.sh
+
+.c.o:
+	$(CC) -std=c99 -pedantic -c $(REAL_CFLAGS) $<
+
+clean:
+	rm -rf $(DYLIBNAME) $(STLIBNAME) $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(TESTS) $(PKGCONFNAME) examples/hiredis-example* *.o *.gcda *.gcno *.gcov
+
+dep:
+	$(CC) $(CPPFLAGS) $(CFLAGS) -MM *.c
+
+INSTALL?= cp -pPR
+
+$(PKGCONFNAME): hiredis.h
+	@echo "Generating $@ for pkgconfig..."
+	@echo prefix=$(PREFIX) > $@
+	@echo exec_prefix=\$${prefix} >> $@
+	@echo libdir=$(PREFIX)/$(LIBRARY_PATH) >> $@
+	@echo includedir=$(PREFIX)/$(INCLUDE_PATH) >> $@
+	@echo >> $@
+	@echo Name: hiredis >> $@
+	@echo Description: Minimalistic C client library for Redis. >> $@
+	@echo Version: $(HIREDIS_MAJOR).$(HIREDIS_MINOR).$(HIREDIS_PATCH) >> $@
+	@echo Libs: -L\$${libdir} -lhiredis >> $@
+	@echo Cflags: -I\$${includedir} -D_FILE_OFFSET_BITS=64 >> $@
+
+$(SSL_PKGCONFNAME): hiredis_ssl.h
+	@echo "Generating $@ for pkgconfig..."
+	@echo prefix=$(PREFIX) > $@
+	@echo exec_prefix=\$${prefix} >> $@
+	@echo libdir=$(PREFIX)/$(LIBRARY_PATH) >> $@
+	@echo includedir=$(PREFIX)/$(INCLUDE_PATH) >> $@
+	@echo >> $@
+	@echo Name: hiredis_ssl >> $@
+	@echo Description: SSL Support for hiredis. >> $@
+	@echo Version: $(HIREDIS_MAJOR).$(HIREDIS_MINOR).$(HIREDIS_PATCH) >> $@
+	@echo Requires: hiredis >> $@
+	@echo Libs: -L\$${libdir} -lhiredis_ssl >> $@
+	@echo Libs.private: -lssl -lcrypto >> $@
+
+install: $(DYLIBNAME) $(STLIBNAME) $(PKGCONFNAME)
+	mkdir -p $(INSTALL_INCLUDE_PATH) $(INSTALL_INCLUDE_PATH)/adapters $(INSTALL_LIBRARY_PATH)
+	$(INSTALL) hiredis.h async.h read.h sds.h alloc.h $(INSTALL_INCLUDE_PATH)
+	$(INSTALL) adapters/*.h $(INSTALL_INCLUDE_PATH)/adapters
+	$(INSTALL) $(DYLIBNAME) $(INSTALL_LIBRARY_PATH)/$(DYLIB_MINOR_NAME)
+	cd $(INSTALL_LIBRARY_PATH) && ln -sf $(DYLIB_MINOR_NAME) $(DYLIBNAME)
+	$(INSTALL) $(STLIBNAME) $(INSTALL_LIBRARY_PATH)
+	mkdir -p $(INSTALL_PKGCONF_PATH)
+	$(INSTALL) $(PKGCONFNAME) $(INSTALL_PKGCONF_PATH)
+
+ifeq ($(USE_SSL),1)
+install: install-ssl
+
+install-ssl: $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(SSL_PKGCONFNAME)
+	mkdir -p $(INSTALL_INCLUDE_PATH) $(INSTALL_LIBRARY_PATH)
+	$(INSTALL) hiredis_ssl.h $(INSTALL_INCLUDE_PATH)
+	$(INSTALL) $(SSL_DYLIBNAME) $(INSTALL_LIBRARY_PATH)/$(SSL_DYLIB_MINOR_NAME)
+	cd $(INSTALL_LIBRARY_PATH) && ln -sf $(SSL_DYLIB_MINOR_NAME) $(SSL_DYLIBNAME)
+	$(INSTALL) $(SSL_STLIBNAME) $(INSTALL_LIBRARY_PATH)
+	mkdir -p $(INSTALL_PKGCONF_PATH)
+	$(INSTALL) $(SSL_PKGCONFNAME) $(INSTALL_PKGCONF_PATH)
+endif
+
+32bit:
+	@echo ""
+	@echo "WARNING: if this fails under Linux you probably need to install libc6-dev-i386"
+	@echo ""
+	$(MAKE) CFLAGS="-m32" LDFLAGS="-m32"
+
+32bit-vars:
+	$(eval CFLAGS=-m32)
+	$(eval LDFLAGS=-m32)
+
+gprof:
+	$(MAKE) CFLAGS="-pg" LDFLAGS="-pg"
+
+gcov:
+	$(MAKE) CFLAGS="-fprofile-arcs -ftest-coverage" LDFLAGS="-fprofile-arcs"
+
+coverage: gcov
+	make check
+	mkdir -p tmp/lcov
+	lcov -d . -c -o tmp/lcov/hiredis.info
+	genhtml --legend -o tmp/lcov/report tmp/lcov/hiredis.info
+
+noopt:
+	$(MAKE) OPTIMIZATION=""
+
+.PHONY: all test check clean dep install 32bit 32bit-vars gprof gcov noopt
diff --git a/redis-stable/deps/hiredis/README.md b/redis-stable/deps/hiredis/README.md
new file mode 100644
index 00000000..3a22553e
--- /dev/null
+++ b/redis-stable/deps/hiredis/README.md
@@ -0,0 +1,658 @@
+[![Build Status](https://travis-ci.org/redis/hiredis.png)](https://travis-ci.org/redis/hiredis)
+
+**This Readme reflects the latest changed in the master branch. See [v1.0.0](https://github.com/redis/hiredis/tree/v1.0.0) for the Readme and documentation for the latest release ([API/ABI history](https://abi-laboratory.pro/?view=timeline&l=hiredis)).**
+
+# HIREDIS
+
+Hiredis is a minimalistic C client library for the [Redis](http://redis.io/) database.
+
+It is minimalistic because it just adds minimal support for the protocol, but
+at the same time it uses a high level printf-alike API in order to make it
+much higher level than otherwise suggested by its minimal code base and the
+lack of explicit bindings for every Redis command.
+
+Apart from supporting sending commands and receiving replies, it comes with
+a reply parser that is decoupled from the I/O layer. It
+is a stream parser designed for easy reusability, which can for instance be used
+in higher level language bindings for efficient reply parsing.
+
+Hiredis only supports the binary-safe Redis protocol, so you can use it with any
+Redis version >= 1.2.0.
+
+The library comes with multiple APIs. There is the
+*synchronous API*, the *asynchronous API* and the *reply parsing API*.
+
+## Upgrading to `1.0.0`
+
+Version 1.0.0 marks the first stable release of Hiredis.
+It includes some minor breaking changes, mostly to make the exposed API more uniform and self-explanatory.
+It also bundles the updated `sds` library, to sync up with upstream and Redis.
+For code changes see the [Changelog](CHANGELOG.md).
+
+_Note:  As described below, a few member names have been changed but most applications should be able to upgrade with minor code changes and recompiling._
+
+## IMPORTANT:  Breaking changes from `0.14.1` -> `1.0.0`
+
+* `redisContext` has two additional members (`free_privdata`, and `privctx`).
+* `redisOptions.timeout` has been renamed to `redisOptions.connect_timeout`, and we've added `redisOptions.command_timeout`.
+* `redisReplyObjectFunctions.createArray` now takes `size_t` instead of `int` for its length parameter.
+
+## IMPORTANT:  Breaking changes when upgrading from 0.13.x -> 0.14.x
+
+Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now
+protocol errors. This is consistent with the RESP specification. On 32-bit
+platforms, the upper bound is lowered to `SIZE_MAX`.
+
+Change `redisReply.len` to `size_t`, as it denotes the the size of a string
+
+User code should compare this to `size_t` values as well.  If it was used to
+compare to other values, casting might be necessary or can be removed, if
+casting was applied before.
+
+## Upgrading from `<0.9.0`
+
+Version 0.9.0 is a major overhaul of hiredis in every aspect. However, upgrading existing
+code using hiredis should not be a big pain. The key thing to keep in mind when
+upgrading is that hiredis >= 0.9.0 uses a `redisContext*` to keep state, in contrast to
+the stateless 0.0.1 that only has a file descriptor to work with.
+
+## Synchronous API
+
+To consume the synchronous API, there are only a few function calls that need to be introduced:
+
+```c
+redisContext *redisConnect(const char *ip, int port);
+void *redisCommand(redisContext *c, const char *format, ...);
+void freeReplyObject(void *reply);
+```
+
+### Connecting
+
+The function `redisConnect` is used to create a so-called `redisContext`. The
+context is where Hiredis holds state for a connection. The `redisContext`
+struct has an integer `err` field that is non-zero when the connection is in
+an error state. The field `errstr` will contain a string with a description of
+the error. More information on errors can be found in the **Errors** section.
+After trying to connect to Redis using `redisConnect` you should
+check the `err` field to see if establishing the connection was successful:
+```c
+redisContext *c = redisConnect("127.0.0.1", 6379);
+if (c == NULL || c->err) {
+    if (c) {
+        printf("Error: %s\n", c->errstr);
+        // handle error
+    } else {
+        printf("Can't allocate redis context\n");
+    }
+}
+```
+
+*Note: A `redisContext` is not thread-safe.*
+
+### Sending commands
+
+There are several ways to issue commands to Redis. The first that will be introduced is
+`redisCommand`. This function takes a format similar to printf. In the simplest form,
+it is used like this:
+```c
+reply = redisCommand(context, "SET foo bar");
+```
+
+The specifier `%s` interpolates a string in the command, and uses `strlen` to
+determine the length of the string:
+```c
+reply = redisCommand(context, "SET foo %s", value);
+```
+When you need to pass binary safe strings in a command, the `%b` specifier can be
+used. Together with a pointer to the string, it requires a `size_t` length argument
+of the string:
+```c
+reply = redisCommand(context, "SET foo %b", value, (size_t) valuelen);
+```
+Internally, Hiredis splits the command in different arguments and will
+convert it to the protocol used to communicate with Redis.
+One or more spaces separates arguments, so you can use the specifiers
+anywhere in an argument:
+```c
+reply = redisCommand(context, "SET key:%s %s", myid, value);
+```
+
+### Using replies
+
+The return value of `redisCommand` holds a reply when the command was
+successfully executed. When an error occurs, the return value is `NULL` and
+the `err` field in the context will be set (see section on **Errors**).
+Once an error is returned the context cannot be reused and you should set up
+a new connection.
+
+The standard replies that `redisCommand` are of the type `redisReply`. The
+`type` field in the `redisReply` should be used to test what kind of reply
+was received:
+
+### RESP2
+
+* **`REDIS_REPLY_STATUS`**:
+    * The command replied with a status reply. The status string can be accessed using `reply->str`.
+      The length of this string can be accessed using `reply->len`.
+
+* **`REDIS_REPLY_ERROR`**:
+    *  The command replied with an error. The error string can be accessed identical to `REDIS_REPLY_STATUS`.
+
+* **`REDIS_REPLY_INTEGER`**:
+    * The command replied with an integer. The integer value can be accessed using the
+      `reply->integer` field of type `long long`.
+
+* **`REDIS_REPLY_NIL`**:
+    * The command replied with a **nil** object. There is no data to access.
+
+* **`REDIS_REPLY_STRING`**:
+    * A bulk (string) reply. The value of the reply can be accessed using `reply->str`.
+      The length of this string can be accessed using `reply->len`.
+
+* **`REDIS_REPLY_ARRAY`**:
+    * A multi bulk reply. The number of elements in the multi bulk reply is stored in
+      `reply->elements`. Every element in the multi bulk reply is a `redisReply` object as well
+      and can be accessed via `reply->element[..index..]`.
+      Redis may reply with nested arrays but this is fully supported.
+
+### RESP3
+
+Hiredis also supports every new `RESP3` data type which are as follows.  For more information about the protocol see the `RESP3` [specification.](https://github.com/antirez/RESP3/blob/master/spec.md)
+
+* **`REDIS_REPLY_DOUBLE`**:
+    * The command replied with a double-precision floating point number.
+      The value is stored as a string in the `str` member, and can be converted with `strtod` or similar.
+
+* **`REDIS_REPLY_BOOL`**:
+    * A boolean true/false reply.
+      The value is stored in the `integer` member and will be either `0` or `1`.
+
+* **`REDIS_REPLY_MAP`**:
+    * An array with the added invariant that there will always be an even number of elements.
+      The MAP is functionally equivelant to `REDIS_REPLY_ARRAY` except for the previously mentioned invariant.
+
+* **`REDIS_REPLY_SET`**:
+    * An array response where each entry is unique.
+      Like the MAP type, the data is identical to an array response except there are no duplicate values.
+
+* **`REDIS_REPLY_PUSH`**:
+    * An array that can be generated spontaneously by Redis.
+      This array response will always contain at least two subelements.  The first contains the type of `PUSH` message (e.g. `message`, or `invalidate`), and the second being a sub-array with the `PUSH` payload itself.
+
+* **`REDIS_REPLY_ATTR`**:
+    * An array structurally identical to a `MAP` but intended as meta-data about a reply.
+      _As of Redis 6.0.6 this reply type is not used in Redis_
+
+* **`REDIS_REPLY_BIGNUM`**:
+    * A string representing an arbitrarily large signed or unsigned integer value.
+      The number will be encoded as a string in the `str` member of `redisReply`.
+
+* **`REDIS_REPLY_VERB`**:
+    * A verbatim string, intended to be presented to the user without modification.
+      The string payload is stored in the `str` memeber, and type data is stored in the `vtype` member (e.g. `txt` for raw text or `md` for markdown).
+
+Replies should be freed using the `freeReplyObject()` function.
+Note that this function will take care of freeing sub-reply objects
+contained in arrays and nested arrays, so there is no need for the user to
+free the sub replies (it is actually harmful and will corrupt the memory).
+
+**Important:** the current version of hiredis (1.0.0) frees replies when the
+asynchronous API is used. This means you should not call `freeReplyObject` when
+you use this API. The reply is cleaned up by hiredis _after_ the callback
+returns.  We may introduce a flag to make this configurable in future versions of the library.
+
+### Cleaning up
+
+To disconnect and free the context the following function can be used:
+```c
+void redisFree(redisContext *c);
+```
+This function immediately closes the socket and then frees the allocations done in
+creating the context.
+
+### Sending commands (cont'd)
+
+Together with `redisCommand`, the function `redisCommandArgv` can be used to issue commands.
+It has the following prototype:
+```c
+void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
+```
+It takes the number of arguments `argc`, an array of strings `argv` and the lengths of the
+arguments `argvlen`. For convenience, `argvlen` may be set to `NULL` and the function will
+use `strlen(3)` on every argument to determine its length. Obviously, when any of the arguments
+need to be binary safe, the entire array of lengths `argvlen` should be provided.
+
+The return value has the same semantic as `redisCommand`.
+
+### Pipelining
+
+To explain how Hiredis supports pipelining in a blocking connection, there needs to be
+understanding of the internal execution flow.
+
+When any of the functions in the `redisCommand` family is called, Hiredis first formats the
+command according to the Redis protocol. The formatted command is then put in the output buffer
+of the context. This output buffer is dynamic, so it can hold any number of commands.
+After the command is put in the output buffer, `redisGetReply` is called. This function has the
+following two execution paths:
+
+1. The input buffer is non-empty:
+    * Try to parse a single reply from the input buffer and return it
+    * If no reply could be parsed, continue at *2*
+2. The input buffer is empty:
+    * Write the **entire** output buffer to the socket
+    * Read from the socket until a single reply could be parsed
+
+The function `redisGetReply` is exported as part of the Hiredis API and can be used when a reply
+is expected on the socket. To pipeline commands, the only things that needs to be done is
+filling up the output buffer. For this cause, two commands can be used that are identical
+to the `redisCommand` family, apart from not returning a reply:
+```c
+void redisAppendCommand(redisContext *c, const char *format, ...);
+void redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
+```
+After calling either function one or more times, `redisGetReply` can be used to receive the
+subsequent replies. The return value for this function is either `REDIS_OK` or `REDIS_ERR`, where
+the latter means an error occurred while reading a reply. Just as with the other commands,
+the `err` field in the context can be used to find out what the cause of this error is.
+
+The following examples shows a simple pipeline (resulting in only a single call to `write(2)` and
+a single call to `read(2)`):
+```c
+redisReply *reply;
+redisAppendCommand(context,"SET foo bar");
+redisAppendCommand(context,"GET foo");
+redisGetReply(context,(void *)&reply); // reply for SET
+freeReplyObject(reply);
+redisGetReply(context,(void *)&reply); // reply for GET
+freeReplyObject(reply);
+```
+This API can also be used to implement a blocking subscriber:
+```c
+reply = redisCommand(context,"SUBSCRIBE foo");
+freeReplyObject(reply);
+while(redisGetReply(context,(void *)&reply) == REDIS_OK) {
+    // consume message
+    freeReplyObject(reply);
+}
+```
+### Errors
+
+When a function call is not successful, depending on the function either `NULL` or `REDIS_ERR` is
+returned. The `err` field inside the context will be non-zero and set to one of the
+following constants:
+
+* **`REDIS_ERR_IO`**:
+    There was an I/O error while creating the connection, trying to write
+    to the socket or read from the socket. If you included `errno.h` in your
+    application, you can use the global `errno` variable to find out what is
+    wrong.
+
+* **`REDIS_ERR_EOF`**:
+    The server closed the connection which resulted in an empty read.
+
+* **`REDIS_ERR_PROTOCOL`**:
+    There was an error while parsing the protocol.
+
+* **`REDIS_ERR_OTHER`**:
+    Any other error. Currently, it is only used when a specified hostname to connect
+    to cannot be resolved.
+
+In every case, the `errstr` field in the context will be set to hold a string representation
+of the error.
+
+## Asynchronous API
+
+Hiredis comes with an asynchronous API that works easily with any event library.
+Examples are bundled that show using Hiredis with [libev](http://software.schmorp.de/pkg/libev.html)
+and [libevent](http://monkey.org/~provos/libevent/).
+
+### Connecting
+
+The function `redisAsyncConnect` can be used to establish a non-blocking connection to
+Redis. It returns a pointer to the newly created `redisAsyncContext` struct. The `err` field
+should be checked after creation to see if there were errors creating the connection.
+Because the connection that will be created is non-blocking, the kernel is not able to
+instantly return if the specified host and port is able to accept a connection.
+
+*Note: A `redisAsyncContext` is not thread-safe.*
+
+```c
+redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+if (c->err) {
+    printf("Error: %s\n", c->errstr);
+    // handle error
+}
+```
+
+The asynchronous context can hold a disconnect callback function that is called when the
+connection is disconnected (either because of an error or per user request). This function should
+have the following prototype:
+```c
+void(const redisAsyncContext *c, int status);
+```
+On a disconnect, the `status` argument is set to `REDIS_OK` when disconnection was initiated by the
+user, or `REDIS_ERR` when the disconnection was caused by an error. When it is `REDIS_ERR`, the `err`
+field in the context can be accessed to find out the cause of the error.
+
+The context object is always freed after the disconnect callback fired. When a reconnect is needed,
+the disconnect callback is a good point to do so.
+
+Setting the disconnect callback can only be done once per context. For subsequent calls it will
+return `REDIS_ERR`. The function to set the disconnect callback has the following prototype:
+```c
+int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn);
+```
+`ac->data` may be used to pass user data to this callback, the same can be done for redisConnectCallback.
+### Sending commands and their callbacks
+
+In an asynchronous context, commands are automatically pipelined due to the nature of an event loop.
+Therefore, unlike the synchronous API, there is only a single way to send commands.
+Because commands are sent to Redis asynchronously, issuing a command requires a callback function
+that is called when the reply is received. Reply callbacks should have the following prototype:
+```c
+void(redisAsyncContext *c, void *reply, void *privdata);
+```
+The `privdata` argument can be used to curry arbitrary data to the callback from the point where
+the command is initially queued for execution.
+
+The functions that can be used to issue commands in an asynchronous context are:
+```c
+int redisAsyncCommand(
+  redisAsyncContext *ac, redisCallbackFn *fn, void *privdata,
+  const char *format, ...);
+int redisAsyncCommandArgv(
+  redisAsyncContext *ac, redisCallbackFn *fn, void *privdata,
+  int argc, const char **argv, const size_t *argvlen);
+```
+Both functions work like their blocking counterparts. The return value is `REDIS_OK` when the command
+was successfully added to the output buffer and `REDIS_ERR` otherwise. Example: when the connection
+is being disconnected per user-request, no new commands may be added to the output buffer and `REDIS_ERR` is
+returned on calls to the `redisAsyncCommand` family.
+
+If the reply for a command with a `NULL` callback is read, it is immediately freed. When the callback
+for a command is non-`NULL`, the memory is freed immediately following the callback: the reply is only
+valid for the duration of the callback.
+
+All pending callbacks are called with a `NULL` reply when the context encountered an error.
+
+### Disconnecting
+
+An asynchronous connection can be terminated using:
+```c
+void redisAsyncDisconnect(redisAsyncContext *ac);
+```
+When this function is called, the connection is **not** immediately terminated. Instead, new
+commands are no longer accepted and the connection is only terminated when all pending commands
+have been written to the socket, their respective replies have been read and their respective
+callbacks have been executed. After this, the disconnection callback is executed with the
+`REDIS_OK` status and the context object is freed.
+
+### Hooking it up to event library *X*
+
+There are a few hooks that need to be set on the context object after it is created.
+See the `adapters/` directory for bindings to *libev* and *libevent*.
+
+## Reply parsing API
+
+Hiredis comes with a reply parsing API that makes it easy for writing higher
+level language bindings.
+
+The reply parsing API consists of the following functions:
+```c
+redisReader *redisReaderCreate(void);
+void redisReaderFree(redisReader *reader);
+int redisReaderFeed(redisReader *reader, const char *buf, size_t len);
+int redisReaderGetReply(redisReader *reader, void **reply);
+```
+The same set of functions are used internally by hiredis when creating a
+normal Redis context, the above API just exposes it to the user for a direct
+usage.
+
+### Usage
+
+The function `redisReaderCreate` creates a `redisReader` structure that holds a
+buffer with unparsed data and state for the protocol parser.
+
+Incoming data -- most likely from a socket -- can be placed in the internal
+buffer of the `redisReader` using `redisReaderFeed`. This function will make a
+copy of the buffer pointed to by `buf` for `len` bytes. This data is parsed
+when `redisReaderGetReply` is called. This function returns an integer status
+and a reply object (as described above) via `void **reply`. The returned status
+can be either `REDIS_OK` or `REDIS_ERR`, where the latter means something went
+wrong (either a protocol error, or an out of memory error).
+
+The parser limits the level of nesting for multi bulk payloads to 7. If the
+multi bulk nesting level is higher than this, the parser returns an error.
+
+### Customizing replies
+
+The function `redisReaderGetReply` creates `redisReply` and makes the function
+argument `reply` point to the created `redisReply` variable. For instance, if
+the response of type `REDIS_REPLY_STATUS` then the `str` field of `redisReply`
+will hold the status as a vanilla C string. However, the functions that are
+responsible for creating instances of the `redisReply` can be customized by
+setting the `fn` field on the `redisReader` struct. This should be done
+immediately after creating the `redisReader`.
+
+For example, [hiredis-rb](https://github.com/pietern/hiredis-rb/blob/master/ext/hiredis_ext/reader.c)
+uses customized reply object functions to create Ruby objects.
+
+### Reader max buffer
+
+Both when using the Reader API directly or when using it indirectly via a
+normal Redis context, the redisReader structure uses a buffer in order to
+accumulate data from the server.
+Usually this buffer is destroyed when it is empty and is larger than 16
+KiB in order to avoid wasting memory in unused buffers
+
+However when working with very big payloads destroying the buffer may slow
+down performances considerably, so it is possible to modify the max size of
+an idle buffer changing the value of the `maxbuf` field of the reader structure
+to the desired value. The special value of 0 means that there is no maximum
+value for an idle buffer, so the buffer will never get freed.
+
+For instance if you have a normal Redis context you can set the maximum idle
+buffer to zero (unlimited) just with:
+```c
+context->reader->maxbuf = 0;
+```
+This should be done only in order to maximize performances when working with
+large payloads. The context should be set back to `REDIS_READER_MAX_BUF` again
+as soon as possible in order to prevent allocation of useless memory.
+
+### Reader max array elements
+
+By default the hiredis reply parser sets the maximum number of multi-bulk elements
+to 2^32 - 1 or 4,294,967,295 entries.  If you need to process multi-bulk replies
+with more than this many elements you can set the value higher or to zero, meaning
+unlimited with:
+```c
+context->reader->maxelements = 0;
+```
+
+## SSL/TLS Support
+
+### Building
+
+SSL/TLS support is not built by default and requires an explicit flag:
+
+    make USE_SSL=1
+
+This requires OpenSSL development package (e.g. including header files to be
+available.
+
+When enabled, SSL/TLS support is built into extra `libhiredis_ssl.a` and
+`libhiredis_ssl.so` static/dynamic libraries. This leaves the original libraries
+unaffected so no additional dependencies are introduced.
+
+### Using it
+
+First, you'll need to make sure you include the SSL header file:
+
+```c
+#include "hiredis.h"
+#include "hiredis_ssl.h"
+```
+
+You will also need to link against `libhiredis_ssl`, **in addition** to
+`libhiredis` and add `-lssl -lcrypto` to satisfy its dependencies.
+
+Hiredis implements SSL/TLS on top of its normal `redisContext` or
+`redisAsyncContext`, so you will need to establish a connection first and then
+initiate an SSL/TLS handshake.
+
+#### Hiredis OpenSSL Wrappers
+
+Before Hiredis can negotiate an SSL/TLS connection, it is necessary to
+initialize OpenSSL and create a context. You can do that in two ways:
+
+1. Work directly with the OpenSSL API to initialize the library's global context
+   and create `SSL_CTX *` and `SSL *` contexts. With an `SSL *` object you can
+   call `redisInitiateSSL()`.
+2. Work with a set of Hiredis-provided wrappers around OpenSSL, create a
+   `redisSSLContext` object to hold configuration and use
+   `redisInitiateSSLWithContext()` to initiate the SSL/TLS handshake.
+
+```c
+/* An Hiredis SSL context. It holds SSL configuration and can be reused across
+ * many contexts.
+ */
+redisSSLContext *ssl;
+
+/* An error variable to indicate what went wrong, if the context fails to
+ * initialize.
+ */
+redisSSLContextError ssl_error;
+
+/* Initialize global OpenSSL state.
+ *
+ * You should call this only once when your app initializes, and only if
+ * you don't explicitly or implicitly initialize OpenSSL it elsewhere.
+ */
+redisInitOpenSSL();
+
+/* Create SSL context */
+ssl = redisCreateSSLContext(
+    "cacertbundle.crt",     /* File name of trusted CA/ca bundle file, optional */
+    "/path/to/certs",       /* Path of trusted certificates, optional */
+    "client_cert.pem",      /* File name of client certificate file, optional */
+    "client_key.pem",       /* File name of client private key, optional */
+    "redis.mydomain.com",   /* Server name to request (SNI), optional */
+    &ssl_error
+    ) != REDIS_OK) {
+        printf("SSL error: %s\n", redisSSLContextGetError(ssl_error);
+        /* Abort... */
+    }
+
+/* Create Redis context and establish connection */
+c = redisConnect("localhost", 6443);
+if (c == NULL || c->err) {
+    /* Handle error and abort... */
+}
+
+/* Negotiate SSL/TLS */
+if (redisInitiateSSLWithContext(c, ssl) != REDIS_OK) {
+    /* Handle error, in c->err / c->errstr */
+}
+```
+
+## RESP3 PUSH replies
+Redis 6.0 introduced PUSH replies with the reply-type `>`.  These messages are generated spontaneously and can arrive at any time, so must be handled using callbacks.
+
+### Default behavior
+Hiredis installs handlers on `redisContext` and `redisAsyncContext` by default, which will intercept and free any PUSH replies detected.  This means existing code will work as-is after upgrading to Redis 6 and switching to `RESP3`.
+
+### Custom PUSH handler prototypes
+The callback prototypes differ between `redisContext` and `redisAsyncContext`.
+
+#### redisContext
+```c
+void my_push_handler(void *privdata, void *reply) {
+    /* Handle the reply */
+
+    /* Note: We need to free the reply in our custom handler for
+             blocking contexts.  This lets us keep the reply if
+             we want. */
+    freeReplyObject(reply);
+}
+```
+
+#### redisAsyncContext
+```c
+void my_async_push_handler(redisAsyncContext *ac, void *reply) {
+    /* Handle the reply */
+
+    /* Note:  Because async hiredis always frees replies, you should
+              not call freeReplyObject in an async push callback. */
+}
+```
+
+### Installing a custom handler
+There are two ways to set your own PUSH handlers.
+
+1. Set `push_cb` or `async_push_cb` in the `redisOptions` struct and connect with `redisConnectWithOptions` or `redisAsyncConnectWithOptions`.
+    ```c
+    redisOptions = {0};
+    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
+    options->push_cb = my_push_handler;
+    redisContext *context = redisConnectWithOptions(&options);
+    ```
+2.  Call `redisSetPushCallback` or `redisAsyncSetPushCallback` on a connected context.
+    ```c
+    redisContext *context = redisConnect("127.0.0.1", 6379);
+    redisSetPushCallback(context, my_push_handler);
+    ```
+
+    _Note `redisSetPushCallback` and `redisAsyncSetPushCallback` both return any currently configured handler,  making it easy to override and then return to the old value._
+
+### Specifying no handler
+If you have a unique use-case where you don't want hiredis to automatically intercept and free PUSH replies, you will want to configure no handler at all.  This can be done in two ways.
+1.  Set the `REDIS_OPT_NO_PUSH_AUTOFREE` flag in `redisOptions` and leave the callback function pointer `NULL`.
+    ```c
+    redisOptions = {0};
+    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
+    options->options |= REDIS_OPT_NO_PUSH_AUTOFREE;
+    redisContext *context = redisConnectWithOptions(&options);
+    ```
+3.  Call `redisSetPushCallback` with `NULL` once connected.
+    ```c
+    redisContext *context = redisConnect("127.0.0.1", 6379);
+    redisSetPushCallback(context, NULL);
+    ```
+
+    _Note:  With no handler configured, calls to `redisCommand` may generate more than one reply, so this strategy is only applicable when there's some kind of blocking`redisGetReply()` loop (e.g. `MONITOR` or `SUBSCRIBE` workloads)._
+
+## Allocator injection
+
+Hiredis uses a pass-thru structure of function pointers defined in [alloc.h](https://github.com/redis/hiredis/blob/f5d25850/alloc.h#L41) that contain the currently configured allocation and deallocation functions.  By default they just point to libc (`malloc`, `calloc`, `realloc`, etc).
+
+### Overriding
+
+One can override the allocators like so:
+
+```c
+hiredisAllocFuncs myfuncs = {
+    .mallocFn = my_malloc,
+    .callocFn = my_calloc,
+    .reallocFn = my_realloc,
+    .strdupFn = my_strdup,
+    .freeFn = my_free,
+};
+
+// Override allocators (function returns current allocators if needed)
+hiredisAllocFuncs orig = hiredisSetAllocators(&myfuncs);
+```
+
+To reset the allocators to their default libc function simply call:
+
+```c
+hiredisResetAllocators();
+```
+
+## AUTHORS
+
+Salvatore Sanfilippo (antirez at gmail),\
+Pieter Noordhuis (pcnoordhuis at gmail)\
+Michael Grunder (michael dot grunder at gmail)
+
+_Hiredis is released under the BSD license._
diff --git a/redis-stable/deps/hiredis/adapters/ae.h b/redis-stable/deps/hiredis/adapters/ae.h
new file mode 100644
index 00000000..660d82eb
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/ae.h
@@ -0,0 +1,130 @@
+/*
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_AE_H__
+#define __HIREDIS_AE_H__
+#include <sys/types.h>
+#include <ae.h>
+#include "../hiredis.h"
+#include "../async.h"
+
+typedef struct redisAeEvents {
+    redisAsyncContext *context;
+    aeEventLoop *loop;
+    int fd;
+    int reading, writing;
+} redisAeEvents;
+
+static void redisAeReadEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
+    ((void)el); ((void)fd); ((void)mask);
+
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAsyncHandleRead(e->context);
+}
+
+static void redisAeWriteEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
+    ((void)el); ((void)fd); ((void)mask);
+
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAsyncHandleWrite(e->context);
+}
+
+static void redisAeAddRead(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (!e->reading) {
+        e->reading = 1;
+        aeCreateFileEvent(loop,e->fd,AE_READABLE,redisAeReadEvent,e);
+    }
+}
+
+static void redisAeDelRead(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (e->reading) {
+        e->reading = 0;
+        aeDeleteFileEvent(loop,e->fd,AE_READABLE);
+    }
+}
+
+static void redisAeAddWrite(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (!e->writing) {
+        e->writing = 1;
+        aeCreateFileEvent(loop,e->fd,AE_WRITABLE,redisAeWriteEvent,e);
+    }
+}
+
+static void redisAeDelWrite(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (e->writing) {
+        e->writing = 0;
+        aeDeleteFileEvent(loop,e->fd,AE_WRITABLE);
+    }
+}
+
+static void redisAeCleanup(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAeDelRead(privdata);
+    redisAeDelWrite(privdata);
+    hi_free(e);
+}
+
+static int redisAeAttach(aeEventLoop *loop, redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisAeEvents *e;
+
+    /* Nothing should be attached when something is already attached */
+    if (ac->ev.data != NULL)
+        return REDIS_ERR;
+
+    /* Create container for context and r/w events */
+    e = (redisAeEvents*)hi_malloc(sizeof(*e));
+    if (e == NULL)
+        return REDIS_ERR;
+
+    e->context = ac;
+    e->loop = loop;
+    e->fd = c->fd;
+    e->reading = e->writing = 0;
+
+    /* Register functions to start/stop listening for events */
+    ac->ev.addRead = redisAeAddRead;
+    ac->ev.delRead = redisAeDelRead;
+    ac->ev.addWrite = redisAeAddWrite;
+    ac->ev.delWrite = redisAeDelWrite;
+    ac->ev.cleanup = redisAeCleanup;
+    ac->ev.data = e;
+
+    return REDIS_OK;
+}
+#endif
diff --git a/redis-stable/deps/hiredis/adapters/glib.h b/redis-stable/deps/hiredis/adapters/glib.h
new file mode 100644
index 00000000..ad59dd14
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/glib.h
@@ -0,0 +1,156 @@
+#ifndef __HIREDIS_GLIB_H__
+#define __HIREDIS_GLIB_H__
+
+#include <glib.h>
+
+#include "../hiredis.h"
+#include "../async.h"
+
+typedef struct
+{
+    GSource source;
+    redisAsyncContext *ac;
+    GPollFD poll_fd;
+} RedisSource;
+
+static void
+redis_source_add_read (gpointer data)
+{
+    RedisSource *source = (RedisSource *)data;
+    g_return_if_fail(source);
+    source->poll_fd.events |= G_IO_IN;
+    g_main_context_wakeup(g_source_get_context((GSource *)data));
+}
+
+static void
+redis_source_del_read (gpointer data)
+{
+    RedisSource *source = (RedisSource *)data;
+    g_return_if_fail(source);
+    source->poll_fd.events &= ~G_IO_IN;
+    g_main_context_wakeup(g_source_get_context((GSource *)data));
+}
+
+static void
+redis_source_add_write (gpointer data)
+{
+    RedisSource *source = (RedisSource *)data;
+    g_return_if_fail(source);
+    source->poll_fd.events |= G_IO_OUT;
+    g_main_context_wakeup(g_source_get_context((GSource *)data));
+}
+
+static void
+redis_source_del_write (gpointer data)
+{
+    RedisSource *source = (RedisSource *)data;
+    g_return_if_fail(source);
+    source->poll_fd.events &= ~G_IO_OUT;
+    g_main_context_wakeup(g_source_get_context((GSource *)data));
+}
+
+static void
+redis_source_cleanup (gpointer data)
+{
+    RedisSource *source = (RedisSource *)data;
+
+    g_return_if_fail(source);
+
+    redis_source_del_read(source);
+    redis_source_del_write(source);
+    /*
+     * It is not our responsibility to remove ourself from the
+     * current main loop. However, we will remove the GPollFD.
+     */
+    if (source->poll_fd.fd >= 0) {
+        g_source_remove_poll((GSource *)data, &source->poll_fd);
+        source->poll_fd.fd = -1;
+    }
+}
+
+static gboolean
+redis_source_prepare (GSource *source,
+                      gint    *timeout_)
+{
+    RedisSource *redis = (RedisSource *)source;
+    *timeout_ = -1;
+    return !!(redis->poll_fd.events & redis->poll_fd.revents);
+}
+
+static gboolean
+redis_source_check (GSource *source)
+{
+    RedisSource *redis = (RedisSource *)source;
+    return !!(redis->poll_fd.events & redis->poll_fd.revents);
+}
+
+static gboolean
+redis_source_dispatch (GSource      *source,
+                       GSourceFunc   callback,
+                       gpointer      user_data)
+{
+    RedisSource *redis = (RedisSource *)source;
+
+    if ((redis->poll_fd.revents & G_IO_OUT)) {
+        redisAsyncHandleWrite(redis->ac);
+        redis->poll_fd.revents &= ~G_IO_OUT;
+    }
+
+    if ((redis->poll_fd.revents & G_IO_IN)) {
+        redisAsyncHandleRead(redis->ac);
+        redis->poll_fd.revents &= ~G_IO_IN;
+    }
+
+    if (callback) {
+        return callback(user_data);
+    }
+
+    return TRUE;
+}
+
+static void
+redis_source_finalize (GSource *source)
+{
+    RedisSource *redis = (RedisSource *)source;
+
+    if (redis->poll_fd.fd >= 0) {
+        g_source_remove_poll(source, &redis->poll_fd);
+        redis->poll_fd.fd = -1;
+    }
+}
+
+static GSource *
+redis_source_new (redisAsyncContext *ac)
+{
+    static GSourceFuncs source_funcs = {
+        .prepare  = redis_source_prepare,
+        .check     = redis_source_check,
+        .dispatch = redis_source_dispatch,
+        .finalize = redis_source_finalize,
+    };
+    redisContext *c = &ac->c;
+    RedisSource *source;
+
+    g_return_val_if_fail(ac != NULL, NULL);
+
+    source = (RedisSource *)g_source_new(&source_funcs, sizeof *source);
+    if (source == NULL)
+        return NULL;
+
+    source->ac = ac;
+    source->poll_fd.fd = c->fd;
+    source->poll_fd.events = 0;
+    source->poll_fd.revents = 0;
+    g_source_add_poll((GSource *)source, &source->poll_fd);
+
+    ac->ev.addRead = redis_source_add_read;
+    ac->ev.delRead = redis_source_del_read;
+    ac->ev.addWrite = redis_source_add_write;
+    ac->ev.delWrite = redis_source_del_write;
+    ac->ev.cleanup = redis_source_cleanup;
+    ac->ev.data = source;
+
+    return (GSource *)source;
+}
+
+#endif /* __HIREDIS_GLIB_H__ */
diff --git a/redis-stable/deps/hiredis/adapters/ivykis.h b/redis-stable/deps/hiredis/adapters/ivykis.h
new file mode 100644
index 00000000..179f6ab5
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/ivykis.h
@@ -0,0 +1,84 @@
+#ifndef __HIREDIS_IVYKIS_H__
+#define __HIREDIS_IVYKIS_H__
+#include <iv.h>
+#include "../hiredis.h"
+#include "../async.h"
+
+typedef struct redisIvykisEvents {
+    redisAsyncContext *context;
+    struct iv_fd fd;
+} redisIvykisEvents;
+
+static void redisIvykisReadEvent(void *arg) {
+    redisAsyncContext *context = (redisAsyncContext *)arg;
+    redisAsyncHandleRead(context);
+}
+
+static void redisIvykisWriteEvent(void *arg) {
+    redisAsyncContext *context = (redisAsyncContext *)arg;
+    redisAsyncHandleWrite(context);
+}
+
+static void redisIvykisAddRead(void *privdata) {
+    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
+    iv_fd_set_handler_in(&e->fd, redisIvykisReadEvent);
+}
+
+static void redisIvykisDelRead(void *privdata) {
+    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
+    iv_fd_set_handler_in(&e->fd, NULL);
+}
+
+static void redisIvykisAddWrite(void *privdata) {
+    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
+    iv_fd_set_handler_out(&e->fd, redisIvykisWriteEvent);
+}
+
+static void redisIvykisDelWrite(void *privdata) {
+    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
+    iv_fd_set_handler_out(&e->fd, NULL);
+}
+
+static void redisIvykisCleanup(void *privdata) {
+    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
+
+    iv_fd_unregister(&e->fd);
+    hi_free(e);
+}
+
+static int redisIvykisAttach(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisIvykisEvents *e;
+
+    /* Nothing should be attached when something is already attached */
+    if (ac->ev.data != NULL)
+        return REDIS_ERR;
+
+    /* Create container for context and r/w events */
+    e = (redisIvykisEvents*)hi_malloc(sizeof(*e));
+    if (e == NULL)
+        return REDIS_ERR;
+
+    e->context = ac;
+
+    /* Register functions to start/stop listening for events */
+    ac->ev.addRead = redisIvykisAddRead;
+    ac->ev.delRead = redisIvykisDelRead;
+    ac->ev.addWrite = redisIvykisAddWrite;
+    ac->ev.delWrite = redisIvykisDelWrite;
+    ac->ev.cleanup = redisIvykisCleanup;
+    ac->ev.data = e;
+
+    /* Initialize and install read/write events */
+    IV_FD_INIT(&e->fd);
+    e->fd.fd = c->fd;
+    e->fd.handler_in = redisIvykisReadEvent;
+    e->fd.handler_out = redisIvykisWriteEvent;
+    e->fd.handler_err = NULL;
+    e->fd.cookie = e->context;
+
+    iv_fd_register(&e->fd);
+
+    return REDIS_OK;
+}
+#endif
diff --git a/redis-stable/deps/hiredis/adapters/libev.h b/redis-stable/deps/hiredis/adapters/libev.h
new file mode 100644
index 00000000..e1e7bbd9
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/libev.h
@@ -0,0 +1,179 @@
+/*
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_LIBEV_H__
+#define __HIREDIS_LIBEV_H__
+#include <stdlib.h>
+#include <sys/types.h>
+#include <ev.h>
+#include "../hiredis.h"
+#include "../async.h"
+
+typedef struct redisLibevEvents {
+    redisAsyncContext *context;
+    struct ev_loop *loop;
+    int reading, writing;
+    ev_io rev, wev;
+    ev_timer timer;
+} redisLibevEvents;
+
+static void redisLibevReadEvent(EV_P_ ev_io *watcher, int revents) {
+#if EV_MULTIPLICITY
+    ((void)loop);
+#endif
+    ((void)revents);
+
+    redisLibevEvents *e = (redisLibevEvents*)watcher->data;
+    redisAsyncHandleRead(e->context);
+}
+
+static void redisLibevWriteEvent(EV_P_ ev_io *watcher, int revents) {
+#if EV_MULTIPLICITY
+    ((void)loop);
+#endif
+    ((void)revents);
+
+    redisLibevEvents *e = (redisLibevEvents*)watcher->data;
+    redisAsyncHandleWrite(e->context);
+}
+
+static void redisLibevAddRead(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+    if (!e->reading) {
+        e->reading = 1;
+        ev_io_start(EV_A_ &e->rev);
+    }
+}
+
+static void redisLibevDelRead(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+    if (e->reading) {
+        e->reading = 0;
+        ev_io_stop(EV_A_ &e->rev);
+    }
+}
+
+static void redisLibevAddWrite(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+    if (!e->writing) {
+        e->writing = 1;
+        ev_io_start(EV_A_ &e->wev);
+    }
+}
+
+static void redisLibevDelWrite(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+    if (e->writing) {
+        e->writing = 0;
+        ev_io_stop(EV_A_ &e->wev);
+    }
+}
+
+static void redisLibevStopTimer(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+    ev_timer_stop(EV_A_ &e->timer);
+}
+
+static void redisLibevCleanup(void *privdata) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    redisLibevDelRead(privdata);
+    redisLibevDelWrite(privdata);
+    redisLibevStopTimer(privdata);
+    hi_free(e);
+}
+
+static void redisLibevTimeout(EV_P_ ev_timer *timer, int revents) {
+    ((void)revents);
+    redisLibevEvents *e = (redisLibevEvents*)timer->data;
+    redisAsyncHandleTimeout(e->context);
+}
+
+static void redisLibevSetTimeout(void *privdata, struct timeval tv) {
+    redisLibevEvents *e = (redisLibevEvents*)privdata;
+    struct ev_loop *loop = e->loop;
+    ((void)loop);
+
+    if (!ev_is_active(&e->timer)) {
+        ev_init(&e->timer, redisLibevTimeout);
+        e->timer.data = e;
+    }
+
+    e->timer.repeat = tv.tv_sec + tv.tv_usec / 1000000.00;
+    ev_timer_again(EV_A_ &e->timer);
+}
+
+static int redisLibevAttach(EV_P_ redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisLibevEvents *e;
+
+    /* Nothing should be attached when something is already attached */
+    if (ac->ev.data != NULL)
+        return REDIS_ERR;
+
+    /* Create container for context and r/w events */
+    e = (redisLibevEvents*)hi_calloc(1, sizeof(*e));
+    if (e == NULL)
+        return REDIS_ERR;
+
+    e->context = ac;
+#if EV_MULTIPLICITY
+    e->loop = loop;
+#else
+    e->loop = NULL;
+#endif
+    e->rev.data = e;
+    e->wev.data = e;
+
+    /* Register functions to start/stop listening for events */
+    ac->ev.addRead = redisLibevAddRead;
+    ac->ev.delRead = redisLibevDelRead;
+    ac->ev.addWrite = redisLibevAddWrite;
+    ac->ev.delWrite = redisLibevDelWrite;
+    ac->ev.cleanup = redisLibevCleanup;
+    ac->ev.scheduleTimer = redisLibevSetTimeout;
+    ac->ev.data = e;
+
+    /* Initialize read/write events */
+    ev_io_init(&e->rev,redisLibevReadEvent,c->fd,EV_READ);
+    ev_io_init(&e->wev,redisLibevWriteEvent,c->fd,EV_WRITE);
+    return REDIS_OK;
+}
+
+#endif
diff --git a/redis-stable/deps/hiredis/adapters/libevent.h b/redis-stable/deps/hiredis/adapters/libevent.h
new file mode 100644
index 00000000..9150979b
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/libevent.h
@@ -0,0 +1,175 @@
+/*
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_LIBEVENT_H__
+#define __HIREDIS_LIBEVENT_H__
+#include <event2/event.h>
+#include "../hiredis.h"
+#include "../async.h"
+
+#define REDIS_LIBEVENT_DELETED 0x01
+#define REDIS_LIBEVENT_ENTERED 0x02
+
+typedef struct redisLibeventEvents {
+    redisAsyncContext *context;
+    struct event *ev;
+    struct event_base *base;
+    struct timeval tv;
+    short flags;
+    short state;
+} redisLibeventEvents;
+
+static void redisLibeventDestroy(redisLibeventEvents *e) {
+    hi_free(e);
+}
+
+static void redisLibeventHandler(int fd, short event, void *arg) {
+    ((void)fd);
+    redisLibeventEvents *e = (redisLibeventEvents*)arg;
+    e->state |= REDIS_LIBEVENT_ENTERED;
+
+    #define CHECK_DELETED() if (e->state & REDIS_LIBEVENT_DELETED) {\
+        redisLibeventDestroy(e);\
+        return; \
+    }
+
+    if ((event & EV_TIMEOUT) && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
+        redisAsyncHandleTimeout(e->context);
+        CHECK_DELETED();
+    }
+
+    if ((event & EV_READ) && e->context && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
+        redisAsyncHandleRead(e->context);
+        CHECK_DELETED();
+    }
+
+    if ((event & EV_WRITE) && e->context && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
+        redisAsyncHandleWrite(e->context);
+        CHECK_DELETED();
+    }
+
+    e->state &= ~REDIS_LIBEVENT_ENTERED;
+    #undef CHECK_DELETED
+}
+
+static void redisLibeventUpdate(void *privdata, short flag, int isRemove) {
+    redisLibeventEvents *e = (redisLibeventEvents *)privdata;
+    const struct timeval *tv = e->tv.tv_sec || e->tv.tv_usec ? &e->tv : NULL;
+
+    if (isRemove) {
+        if ((e->flags & flag) == 0) {
+            return;
+        } else {
+            e->flags &= ~flag;
+        }
+    } else {
+        if (e->flags & flag) {
+            return;
+        } else {
+            e->flags |= flag;
+        }
+    }
+
+    event_del(e->ev);
+    event_assign(e->ev, e->base, e->context->c.fd, e->flags | EV_PERSIST,
+                 redisLibeventHandler, privdata);
+    event_add(e->ev, tv);
+}
+
+static void redisLibeventAddRead(void *privdata) {
+    redisLibeventUpdate(privdata, EV_READ, 0);
+}
+
+static void redisLibeventDelRead(void *privdata) {
+    redisLibeventUpdate(privdata, EV_READ, 1);
+}
+
+static void redisLibeventAddWrite(void *privdata) {
+    redisLibeventUpdate(privdata, EV_WRITE, 0);
+}
+
+static void redisLibeventDelWrite(void *privdata) {
+    redisLibeventUpdate(privdata, EV_WRITE, 1);
+}
+
+static void redisLibeventCleanup(void *privdata) {
+    redisLibeventEvents *e = (redisLibeventEvents*)privdata;
+    if (!e) {
+        return;
+    }
+    event_del(e->ev);
+    event_free(e->ev);
+    e->ev = NULL;
+
+    if (e->state & REDIS_LIBEVENT_ENTERED) {
+        e->state |= REDIS_LIBEVENT_DELETED;
+    } else {
+        redisLibeventDestroy(e);
+    }
+}
+
+static void redisLibeventSetTimeout(void *privdata, struct timeval tv) {
+    redisLibeventEvents *e = (redisLibeventEvents *)privdata;
+    short flags = e->flags;
+    e->flags = 0;
+    e->tv = tv;
+    redisLibeventUpdate(e, flags, 0);
+}
+
+static int redisLibeventAttach(redisAsyncContext *ac, struct event_base *base) {
+    redisContext *c = &(ac->c);
+    redisLibeventEvents *e;
+
+    /* Nothing should be attached when something is already attached */
+    if (ac->ev.data != NULL)
+        return REDIS_ERR;
+
+    /* Create container for context and r/w events */
+    e = (redisLibeventEvents*)hi_calloc(1, sizeof(*e));
+    if (e == NULL)
+        return REDIS_ERR;
+
+    e->context = ac;
+
+    /* Register functions to start/stop listening for events */
+    ac->ev.addRead = redisLibeventAddRead;
+    ac->ev.delRead = redisLibeventDelRead;
+    ac->ev.addWrite = redisLibeventAddWrite;
+    ac->ev.delWrite = redisLibeventDelWrite;
+    ac->ev.cleanup = redisLibeventCleanup;
+    ac->ev.scheduleTimer = redisLibeventSetTimeout;
+    ac->ev.data = e;
+
+    /* Initialize and install read/write events */
+    e->ev = event_new(base, c->fd, EV_READ | EV_WRITE, redisLibeventHandler, e);
+    e->base = base;
+    return REDIS_OK;
+}
+#endif
diff --git a/redis-stable/deps/hiredis/adapters/libuv.h b/redis-stable/deps/hiredis/adapters/libuv.h
new file mode 100644
index 00000000..c120b1b3
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/libuv.h
@@ -0,0 +1,117 @@
+#ifndef __HIREDIS_LIBUV_H__
+#define __HIREDIS_LIBUV_H__
+#include <stdlib.h>
+#include <uv.h>
+#include "../hiredis.h"
+#include "../async.h"
+#include <string.h>
+
+typedef struct redisLibuvEvents {
+  redisAsyncContext* context;
+  uv_poll_t          handle;
+  int                events;
+} redisLibuvEvents;
+
+
+static void redisLibuvPoll(uv_poll_t* handle, int status, int events) {
+  redisLibuvEvents* p = (redisLibuvEvents*)handle->data;
+  int ev = (status ? p->events : events);
+
+  if (p->context != NULL && (ev & UV_READABLE)) {
+    redisAsyncHandleRead(p->context);
+  }
+  if (p->context != NULL && (ev & UV_WRITABLE)) {
+    redisAsyncHandleWrite(p->context);
+  }
+}
+
+
+static void redisLibuvAddRead(void *privdata) {
+  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
+
+  p->events |= UV_READABLE;
+
+  uv_poll_start(&p->handle, p->events, redisLibuvPoll);
+}
+
+
+static void redisLibuvDelRead(void *privdata) {
+  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
+
+  p->events &= ~UV_READABLE;
+
+  if (p->events) {
+    uv_poll_start(&p->handle, p->events, redisLibuvPoll);
+  } else {
+    uv_poll_stop(&p->handle);
+  }
+}
+
+
+static void redisLibuvAddWrite(void *privdata) {
+  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
+
+  p->events |= UV_WRITABLE;
+
+  uv_poll_start(&p->handle, p->events, redisLibuvPoll);
+}
+
+
+static void redisLibuvDelWrite(void *privdata) {
+  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
+
+  p->events &= ~UV_WRITABLE;
+
+  if (p->events) {
+    uv_poll_start(&p->handle, p->events, redisLibuvPoll);
+  } else {
+    uv_poll_stop(&p->handle);
+  }
+}
+
+
+static void on_close(uv_handle_t* handle) {
+  redisLibuvEvents* p = (redisLibuvEvents*)handle->data;
+
+  hi_free(p);
+}
+
+
+static void redisLibuvCleanup(void *privdata) {
+  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
+
+  p->context = NULL; // indicate that context might no longer exist
+  uv_close((uv_handle_t*)&p->handle, on_close);
+}
+
+
+static int redisLibuvAttach(redisAsyncContext* ac, uv_loop_t* loop) {
+  redisContext *c = &(ac->c);
+
+  if (ac->ev.data != NULL) {
+    return REDIS_ERR;
+  }
+
+  ac->ev.addRead  = redisLibuvAddRead;
+  ac->ev.delRead  = redisLibuvDelRead;
+  ac->ev.addWrite = redisLibuvAddWrite;
+  ac->ev.delWrite = redisLibuvDelWrite;
+  ac->ev.cleanup  = redisLibuvCleanup;
+
+  redisLibuvEvents* p = (redisLibuvEvents*)hi_malloc(sizeof(*p));
+  if (p == NULL)
+      return REDIS_ERR;
+
+  memset(p, 0, sizeof(*p));
+
+  if (uv_poll_init_socket(loop, &p->handle, c->fd) != 0) {
+    return REDIS_ERR;
+  }
+
+  ac->ev.data    = p;
+  p->handle.data = p;
+  p->context     = ac;
+
+  return REDIS_OK;
+}
+#endif
diff --git a/redis-stable/deps/hiredis/adapters/macosx.h b/redis-stable/deps/hiredis/adapters/macosx.h
new file mode 100644
index 00000000..3c87f1b2
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/macosx.h
@@ -0,0 +1,115 @@
+//
+//  Created by Дмитрий Бахвалов on 13.07.15.
+//  Copyright (c) 2015 Dmitry Bakhvalov. All rights reserved.
+//
+
+#ifndef __HIREDIS_MACOSX_H__
+#define __HIREDIS_MACOSX_H__
+
+#include <CoreFoundation/CoreFoundation.h>
+
+#include "../hiredis.h"
+#include "../async.h"
+
+typedef struct {
+    redisAsyncContext *context;
+    CFSocketRef socketRef;
+    CFRunLoopSourceRef sourceRef;
+} RedisRunLoop;
+
+static int freeRedisRunLoop(RedisRunLoop* redisRunLoop) {
+    if( redisRunLoop != NULL ) {
+        if( redisRunLoop->sourceRef != NULL ) {
+            CFRunLoopSourceInvalidate(redisRunLoop->sourceRef);
+            CFRelease(redisRunLoop->sourceRef);
+        }
+        if( redisRunLoop->socketRef != NULL ) {
+            CFSocketInvalidate(redisRunLoop->socketRef);
+            CFRelease(redisRunLoop->socketRef);
+        }
+        hi_free(redisRunLoop);
+    }
+    return REDIS_ERR;
+}
+
+static void redisMacOSAddRead(void *privdata) {
+    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
+    CFSocketEnableCallBacks(redisRunLoop->socketRef, kCFSocketReadCallBack);
+}
+
+static void redisMacOSDelRead(void *privdata) {
+    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
+    CFSocketDisableCallBacks(redisRunLoop->socketRef, kCFSocketReadCallBack);
+}
+
+static void redisMacOSAddWrite(void *privdata) {
+    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
+    CFSocketEnableCallBacks(redisRunLoop->socketRef, kCFSocketWriteCallBack);
+}
+
+static void redisMacOSDelWrite(void *privdata) {
+    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
+    CFSocketDisableCallBacks(redisRunLoop->socketRef, kCFSocketWriteCallBack);
+}
+
+static void redisMacOSCleanup(void *privdata) {
+    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
+    freeRedisRunLoop(redisRunLoop);
+}
+
+static void redisMacOSAsyncCallback(CFSocketRef __unused s, CFSocketCallBackType callbackType, CFDataRef __unused address, const void __unused *data, void *info) {
+    redisAsyncContext* context = (redisAsyncContext*) info;
+
+    switch (callbackType) {
+        case kCFSocketReadCallBack:
+            redisAsyncHandleRead(context);
+            break;
+
+        case kCFSocketWriteCallBack:
+            redisAsyncHandleWrite(context);
+            break;
+
+        default:
+            break;
+    }
+}
+
+static int redisMacOSAttach(redisAsyncContext *redisAsyncCtx, CFRunLoopRef runLoop) {
+    redisContext *redisCtx = &(redisAsyncCtx->c);
+
+    /* Nothing should be attached when something is already attached */
+    if( redisAsyncCtx->ev.data != NULL ) return REDIS_ERR;
+
+    RedisRunLoop* redisRunLoop = (RedisRunLoop*) hi_calloc(1, sizeof(RedisRunLoop));
+    if (redisRunLoop == NULL)
+        return REDIS_ERR;
+
+    /* Setup redis stuff */
+    redisRunLoop->context = redisAsyncCtx;
+
+    redisAsyncCtx->ev.addRead  = redisMacOSAddRead;
+    redisAsyncCtx->ev.delRead  = redisMacOSDelRead;
+    redisAsyncCtx->ev.addWrite = redisMacOSAddWrite;
+    redisAsyncCtx->ev.delWrite = redisMacOSDelWrite;
+    redisAsyncCtx->ev.cleanup  = redisMacOSCleanup;
+    redisAsyncCtx->ev.data     = redisRunLoop;
+
+    /* Initialize and install read/write events */
+    CFSocketContext socketCtx = { 0, redisAsyncCtx, NULL, NULL, NULL };
+
+    redisRunLoop->socketRef = CFSocketCreateWithNative(NULL, redisCtx->fd,
+                                                       kCFSocketReadCallBack | kCFSocketWriteCallBack,
+                                                       redisMacOSAsyncCallback,
+                                                       &socketCtx);
+    if( !redisRunLoop->socketRef ) return freeRedisRunLoop(redisRunLoop);
+
+    redisRunLoop->sourceRef = CFSocketCreateRunLoopSource(NULL, redisRunLoop->socketRef, 0);
+    if( !redisRunLoop->sourceRef ) return freeRedisRunLoop(redisRunLoop);
+
+    CFRunLoopAddSource(runLoop, redisRunLoop->sourceRef, kCFRunLoopDefaultMode);
+
+    return REDIS_OK;
+}
+
+#endif
+
diff --git a/redis-stable/deps/hiredis/adapters/qt.h b/redis-stable/deps/hiredis/adapters/qt.h
new file mode 100644
index 00000000..5cc02e6c
--- /dev/null
+++ b/redis-stable/deps/hiredis/adapters/qt.h
@@ -0,0 +1,135 @@
+/*-
+ * Copyright (C) 2014 Pietro Cerutti <gahr@gahr.ch>
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_QT_H__
+#define __HIREDIS_QT_H__
+#include <QSocketNotifier>
+#include "../async.h"
+
+static void RedisQtAddRead(void *);
+static void RedisQtDelRead(void *);
+static void RedisQtAddWrite(void *);
+static void RedisQtDelWrite(void *);
+static void RedisQtCleanup(void *);
+
+class RedisQtAdapter : public QObject {
+
+    Q_OBJECT
+
+    friend
+    void RedisQtAddRead(void * adapter) {
+        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
+        a->addRead();
+    }
+
+    friend
+    void RedisQtDelRead(void * adapter) {
+        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
+        a->delRead();
+    }
+
+    friend
+    void RedisQtAddWrite(void * adapter) {
+        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
+        a->addWrite();
+    }
+
+    friend
+    void RedisQtDelWrite(void * adapter) {
+        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
+        a->delWrite();
+    }
+
+    friend
+    void RedisQtCleanup(void * adapter) {
+        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
+        a->cleanup();
+    }
+
+    public:
+        RedisQtAdapter(QObject * parent = 0)
+            : QObject(parent), m_ctx(0), m_read(0), m_write(0) { }
+
+        ~RedisQtAdapter() {
+            if (m_ctx != 0) {
+                m_ctx->ev.data = NULL;
+            }
+        }
+
+        int setContext(redisAsyncContext * ac) {
+            if (ac->ev.data != NULL) {
+                return REDIS_ERR;
+            }
+            m_ctx = ac;
+            m_ctx->ev.data = this;
+            m_ctx->ev.addRead = RedisQtAddRead;
+            m_ctx->ev.delRead = RedisQtDelRead;
+            m_ctx->ev.addWrite = RedisQtAddWrite;
+            m_ctx->ev.delWrite = RedisQtDelWrite;
+            m_ctx->ev.cleanup = RedisQtCleanup;
+            return REDIS_OK;
+        }
+
+    private:
+        void addRead() {
+            if (m_read) return;
+            m_read = new QSocketNotifier(m_ctx->c.fd, QSocketNotifier::Read, 0);
+            connect(m_read, SIGNAL(activated(int)), this, SLOT(read()));
+        }
+
+        void delRead() {
+            if (!m_read) return;
+            delete m_read;
+            m_read = 0;
+        }
+
+        void addWrite() {
+            if (m_write) return;
+            m_write = new QSocketNotifier(m_ctx->c.fd, QSocketNotifier::Write, 0);
+            connect(m_write, SIGNAL(activated(int)), this, SLOT(write()));
+        }
+
+        void delWrite() {
+            if (!m_write) return;
+            delete m_write;
+            m_write = 0;
+        }
+
+        void cleanup() {
+            delRead();
+            delWrite();
+        }
+
+    private slots:
+        void read() { redisAsyncHandleRead(m_ctx); }
+        void write() { redisAsyncHandleWrite(m_ctx); }
+
+    private:
+        redisAsyncContext * m_ctx;
+        QSocketNotifier * m_read;
+        QSocketNotifier * m_write;
+};
+
+#endif /* !__HIREDIS_QT_H__ */
diff --git a/redis-stable/deps/hiredis/alloc.c b/redis-stable/deps/hiredis/alloc.c
new file mode 100644
index 00000000..7fb6b35e
--- /dev/null
+++ b/redis-stable/deps/hiredis/alloc.c
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include "alloc.h"
+#include <string.h>
+#include <stdlib.h>
+
+hiredisAllocFuncs hiredisAllocFns = {
+    .mallocFn = malloc,
+    .callocFn = calloc,
+    .reallocFn = realloc,
+    .strdupFn = strdup,
+    .freeFn = free,
+};
+
+/* Override hiredis' allocators with ones supplied by the user */
+hiredisAllocFuncs hiredisSetAllocators(hiredisAllocFuncs *override) {
+    hiredisAllocFuncs orig = hiredisAllocFns;
+
+    hiredisAllocFns = *override;
+
+    return orig;
+}
+
+/* Reset allocators to use libc defaults */
+void hiredisResetAllocators(void) {
+    hiredisAllocFns = (hiredisAllocFuncs) {
+        .mallocFn = malloc,
+        .callocFn = calloc,
+        .reallocFn = realloc,
+        .strdupFn = strdup,
+        .freeFn = free,
+    };
+}
+
+#ifdef _WIN32
+
+void *hi_malloc(size_t size) {
+    return hiredisAllocFns.mallocFn(size);
+}
+
+void *hi_calloc(size_t nmemb, size_t size) {
+    return hiredisAllocFns.callocFn(nmemb, size);
+}
+
+void *hi_realloc(void *ptr, size_t size) {
+    return hiredisAllocFns.reallocFn(ptr, size);
+}
+
+char *hi_strdup(const char *str) {
+    return hiredisAllocFns.strdupFn(str);
+}
+
+void hi_free(void *ptr) {
+    hiredisAllocFns.freeFn(ptr);
+}
+
+#endif
diff --git a/redis-stable/deps/hiredis/alloc.h b/redis-stable/deps/hiredis/alloc.h
new file mode 100644
index 00000000..34a05f49
--- /dev/null
+++ b/redis-stable/deps/hiredis/alloc.h
@@ -0,0 +1,91 @@
+/*
+ * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef HIREDIS_ALLOC_H
+#define HIREDIS_ALLOC_H
+
+#include <stddef.h> /* for size_t */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Structure pointing to our actually configured allocators */
+typedef struct hiredisAllocFuncs {
+    void *(*mallocFn)(size_t);
+    void *(*callocFn)(size_t,size_t);
+    void *(*reallocFn)(void*,size_t);
+    char *(*strdupFn)(const char*);
+    void (*freeFn)(void*);
+} hiredisAllocFuncs;
+
+hiredisAllocFuncs hiredisSetAllocators(hiredisAllocFuncs *ha);
+void hiredisResetAllocators(void);
+
+#ifndef _WIN32
+
+/* Hiredis' configured allocator function pointer struct */
+extern hiredisAllocFuncs hiredisAllocFns;
+
+static inline void *hi_malloc(size_t size) {
+    return hiredisAllocFns.mallocFn(size);
+}
+
+static inline void *hi_calloc(size_t nmemb, size_t size) {
+    return hiredisAllocFns.callocFn(nmemb, size);
+}
+
+static inline void *hi_realloc(void *ptr, size_t size) {
+    return hiredisAllocFns.reallocFn(ptr, size);
+}
+
+static inline char *hi_strdup(const char *str) {
+    return hiredisAllocFns.strdupFn(str);
+}
+
+static inline void hi_free(void *ptr) {
+    hiredisAllocFns.freeFn(ptr);
+}
+
+#else
+
+void *hi_malloc(size_t size);
+void *hi_calloc(size_t nmemb, size_t size);
+void *hi_realloc(void *ptr, size_t size);
+char *hi_strdup(const char *str);
+void hi_free(void *ptr);
+
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* HIREDIS_ALLOC_H */
diff --git a/redis-stable/deps/hiredis/appveyor.yml b/redis-stable/deps/hiredis/appveyor.yml
new file mode 100644
index 00000000..5b43fdbe
--- /dev/null
+++ b/redis-stable/deps/hiredis/appveyor.yml
@@ -0,0 +1,24 @@
+# Appveyor configuration file for CI build of hiredis on Windows (under Cygwin)
+environment:
+    matrix:
+        - CYG_BASH: C:\cygwin64\bin\bash
+          CC: gcc
+        - CYG_BASH: C:\cygwin\bin\bash
+          CC: gcc
+          CFLAGS: -m32
+          CXXFLAGS: -m32
+          LDFLAGS: -m32
+
+clone_depth: 1
+
+# Attempt to ensure we don't try to convert line endings to Win32 CRLF as this will cause build to fail
+init:
+    - git config --global core.autocrlf input
+
+# Install needed build dependencies
+install:
+    - '%CYG_BASH% -lc "cygcheck -dc cygwin"'
+
+build_script:
+    - 'echo building...'
+    - '%CYG_BASH% -lc "cd $APPVEYOR_BUILD_FOLDER; exec 0</dev/null; mkdir build && cd build && cmake .. -G \"Unix Makefiles\" && make VERBOSE=1"'
diff --git a/redis-stable/deps/hiredis/async.c b/redis-stable/deps/hiredis/async.c
new file mode 100644
index 00000000..64ab601c
--- /dev/null
+++ b/redis-stable/deps/hiredis/async.c
@@ -0,0 +1,887 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include "alloc.h"
+#include <stdlib.h>
+#include <string.h>
+#ifndef _MSC_VER
+#include <strings.h>
+#endif
+#include <assert.h>
+#include <ctype.h>
+#include <errno.h>
+#include "async.h"
+#include "net.h"
+#include "dict.c"
+#include "sds.h"
+#include "win32.h"
+
+#include "async_private.h"
+
+/* Forward declarations of hiredis.c functions */
+int __redisAppendCommand(redisContext *c, const char *cmd, size_t len);
+void __redisSetError(redisContext *c, int type, const char *str);
+
+/* Functions managing dictionary of callbacks for pub/sub. */
+static unsigned int callbackHash(const void *key) {
+    return dictGenHashFunction((const unsigned char *)key,
+                               hi_sdslen((const hisds)key));
+}
+
+static void *callbackValDup(void *privdata, const void *src) {
+    ((void) privdata);
+    redisCallback *dup;
+
+    dup = hi_malloc(sizeof(*dup));
+    if (dup == NULL)
+        return NULL;
+
+    memcpy(dup,src,sizeof(*dup));
+    return dup;
+}
+
+static int callbackKeyCompare(void *privdata, const void *key1, const void *key2) {
+    int l1, l2;
+    ((void) privdata);
+
+    l1 = hi_sdslen((const hisds)key1);
+    l2 = hi_sdslen((const hisds)key2);
+    if (l1 != l2) return 0;
+    return memcmp(key1,key2,l1) == 0;
+}
+
+static void callbackKeyDestructor(void *privdata, void *key) {
+    ((void) privdata);
+    hi_sdsfree((hisds)key);
+}
+
+static void callbackValDestructor(void *privdata, void *val) {
+    ((void) privdata);
+    hi_free(val);
+}
+
+static dictType callbackDict = {
+    callbackHash,
+    NULL,
+    callbackValDup,
+    callbackKeyCompare,
+    callbackKeyDestructor,
+    callbackValDestructor
+};
+
+static redisAsyncContext *redisAsyncInitialize(redisContext *c) {
+    redisAsyncContext *ac;
+    dict *channels = NULL, *patterns = NULL;
+
+    channels = dictCreate(&callbackDict,NULL);
+    if (channels == NULL)
+        goto oom;
+
+    patterns = dictCreate(&callbackDict,NULL);
+    if (patterns == NULL)
+        goto oom;
+
+    ac = hi_realloc(c,sizeof(redisAsyncContext));
+    if (ac == NULL)
+        goto oom;
+
+    c = &(ac->c);
+
+    /* The regular connect functions will always set the flag REDIS_CONNECTED.
+     * For the async API, we want to wait until the first write event is
+     * received up before setting this flag, so reset it here. */
+    c->flags &= ~REDIS_CONNECTED;
+
+    ac->err = 0;
+    ac->errstr = NULL;
+    ac->data = NULL;
+    ac->dataCleanup = NULL;
+
+    ac->ev.data = NULL;
+    ac->ev.addRead = NULL;
+    ac->ev.delRead = NULL;
+    ac->ev.addWrite = NULL;
+    ac->ev.delWrite = NULL;
+    ac->ev.cleanup = NULL;
+    ac->ev.scheduleTimer = NULL;
+
+    ac->onConnect = NULL;
+    ac->onDisconnect = NULL;
+
+    ac->replies.head = NULL;
+    ac->replies.tail = NULL;
+    ac->sub.invalid.head = NULL;
+    ac->sub.invalid.tail = NULL;
+    ac->sub.channels = channels;
+    ac->sub.patterns = patterns;
+
+    return ac;
+oom:
+    if (channels) dictRelease(channels);
+    if (patterns) dictRelease(patterns);
+    return NULL;
+}
+
+/* We want the error field to be accessible directly instead of requiring
+ * an indirection to the redisContext struct. */
+static void __redisAsyncCopyError(redisAsyncContext *ac) {
+    if (!ac)
+        return;
+
+    redisContext *c = &(ac->c);
+    ac->err = c->err;
+    ac->errstr = c->errstr;
+}
+
+redisAsyncContext *redisAsyncConnectWithOptions(const redisOptions *options) {
+    redisOptions myOptions = *options;
+    redisContext *c;
+    redisAsyncContext *ac;
+
+    /* Clear any erroneously set sync callback and flag that we don't want to
+     * use freeReplyObject by default. */
+    myOptions.push_cb = NULL;
+    myOptions.options |= REDIS_OPT_NO_PUSH_AUTOFREE;
+
+    myOptions.options |= REDIS_OPT_NONBLOCK;
+    c = redisConnectWithOptions(&myOptions);
+    if (c == NULL) {
+        return NULL;
+    }
+
+    ac = redisAsyncInitialize(c);
+    if (ac == NULL) {
+        redisFree(c);
+        return NULL;
+    }
+
+    /* Set any configured async push handler */
+    redisAsyncSetPushCallback(ac, myOptions.async_push_cb);
+
+    __redisAsyncCopyError(ac);
+    return ac;
+}
+
+redisAsyncContext *redisAsyncConnect(const char *ip, int port) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    return redisAsyncConnectWithOptions(&options);
+}
+
+redisAsyncContext *redisAsyncConnectBind(const char *ip, int port,
+                                         const char *source_addr) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.endpoint.tcp.source_addr = source_addr;
+    return redisAsyncConnectWithOptions(&options);
+}
+
+redisAsyncContext *redisAsyncConnectBindWithReuse(const char *ip, int port,
+                                                  const char *source_addr) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.options |= REDIS_OPT_REUSEADDR;
+    options.endpoint.tcp.source_addr = source_addr;
+    return redisAsyncConnectWithOptions(&options);
+}
+
+redisAsyncContext *redisAsyncConnectUnix(const char *path) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_UNIX(&options, path);
+    return redisAsyncConnectWithOptions(&options);
+}
+
+int redisAsyncSetConnectCallback(redisAsyncContext *ac, redisConnectCallback *fn) {
+    if (ac->onConnect == NULL) {
+        ac->onConnect = fn;
+
+        /* The common way to detect an established connection is to wait for
+         * the first write event to be fired. This assumes the related event
+         * library functions are already set. */
+        _EL_ADD_WRITE(ac);
+        return REDIS_OK;
+    }
+    return REDIS_ERR;
+}
+
+int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn) {
+    if (ac->onDisconnect == NULL) {
+        ac->onDisconnect = fn;
+        return REDIS_OK;
+    }
+    return REDIS_ERR;
+}
+
+/* Helper functions to push/shift callbacks */
+static int __redisPushCallback(redisCallbackList *list, redisCallback *source) {
+    redisCallback *cb;
+
+    /* Copy callback from stack to heap */
+    cb = hi_malloc(sizeof(*cb));
+    if (cb == NULL)
+        return REDIS_ERR_OOM;
+
+    if (source != NULL) {
+        memcpy(cb,source,sizeof(*cb));
+        cb->next = NULL;
+    }
+
+    /* Store callback in list */
+    if (list->head == NULL)
+        list->head = cb;
+    if (list->tail != NULL)
+        list->tail->next = cb;
+    list->tail = cb;
+    return REDIS_OK;
+}
+
+static int __redisShiftCallback(redisCallbackList *list, redisCallback *target) {
+    redisCallback *cb = list->head;
+    if (cb != NULL) {
+        list->head = cb->next;
+        if (cb == list->tail)
+            list->tail = NULL;
+
+        /* Copy callback from heap to stack */
+        if (target != NULL)
+            memcpy(target,cb,sizeof(*cb));
+        hi_free(cb);
+        return REDIS_OK;
+    }
+    return REDIS_ERR;
+}
+
+static void __redisRunCallback(redisAsyncContext *ac, redisCallback *cb, redisReply *reply) {
+    redisContext *c = &(ac->c);
+    if (cb->fn != NULL) {
+        c->flags |= REDIS_IN_CALLBACK;
+        cb->fn(ac,reply,cb->privdata);
+        c->flags &= ~REDIS_IN_CALLBACK;
+    }
+}
+
+static void __redisRunPushCallback(redisAsyncContext *ac, redisReply *reply) {
+    if (ac->push_cb != NULL) {
+        ac->c.flags |= REDIS_IN_CALLBACK;
+        ac->push_cb(ac, reply);
+        ac->c.flags &= ~REDIS_IN_CALLBACK;
+    }
+}
+
+/* Helper function to free the context. */
+static void __redisAsyncFree(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisCallback cb;
+    dictIterator *it;
+    dictEntry *de;
+
+    /* Execute pending callbacks with NULL reply. */
+    while (__redisShiftCallback(&ac->replies,&cb) == REDIS_OK)
+        __redisRunCallback(ac,&cb,NULL);
+
+    /* Execute callbacks for invalid commands */
+    while (__redisShiftCallback(&ac->sub.invalid,&cb) == REDIS_OK)
+        __redisRunCallback(ac,&cb,NULL);
+
+    /* Run subscription callbacks with NULL reply */
+    if (ac->sub.channels) {
+        it = dictGetIterator(ac->sub.channels);
+        if (it != NULL) {
+            while ((de = dictNext(it)) != NULL)
+                __redisRunCallback(ac,dictGetEntryVal(de),NULL);
+            dictReleaseIterator(it);
+        }
+
+        dictRelease(ac->sub.channels);
+    }
+
+    if (ac->sub.patterns) {
+        it = dictGetIterator(ac->sub.patterns);
+        if (it != NULL) {
+            while ((de = dictNext(it)) != NULL)
+                __redisRunCallback(ac,dictGetEntryVal(de),NULL);
+            dictReleaseIterator(it);
+        }
+
+        dictRelease(ac->sub.patterns);
+    }
+
+    /* Signal event lib to clean up */
+    _EL_CLEANUP(ac);
+
+    /* Execute disconnect callback. When redisAsyncFree() initiated destroying
+     * this context, the status will always be REDIS_OK. */
+    if (ac->onDisconnect && (c->flags & REDIS_CONNECTED)) {
+        if (c->flags & REDIS_FREEING) {
+            ac->onDisconnect(ac,REDIS_OK);
+        } else {
+            ac->onDisconnect(ac,(ac->err == 0) ? REDIS_OK : REDIS_ERR);
+        }
+    }
+
+    if (ac->dataCleanup) {
+        ac->dataCleanup(ac->data);
+    }
+
+    /* Cleanup self */
+    redisFree(c);
+}
+
+/* Free the async context. When this function is called from a callback,
+ * control needs to be returned to redisProcessCallbacks() before actual
+ * free'ing. To do so, a flag is set on the context which is picked up by
+ * redisProcessCallbacks(). Otherwise, the context is immediately free'd. */
+void redisAsyncFree(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    c->flags |= REDIS_FREEING;
+    if (!(c->flags & REDIS_IN_CALLBACK))
+        __redisAsyncFree(ac);
+}
+
+/* Helper function to make the disconnect happen and clean up. */
+void __redisAsyncDisconnect(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+
+    /* Make sure error is accessible if there is any */
+    __redisAsyncCopyError(ac);
+
+    if (ac->err == 0) {
+        /* For clean disconnects, there should be no pending callbacks. */
+        int ret = __redisShiftCallback(&ac->replies,NULL);
+        assert(ret == REDIS_ERR);
+    } else {
+        /* Disconnection is caused by an error, make sure that pending
+         * callbacks cannot call new commands. */
+        c->flags |= REDIS_DISCONNECTING;
+    }
+
+    /* cleanup event library on disconnect.
+     * this is safe to call multiple times */
+    _EL_CLEANUP(ac);
+
+    /* For non-clean disconnects, __redisAsyncFree() will execute pending
+     * callbacks with a NULL-reply. */
+    if (!(c->flags & REDIS_NO_AUTO_FREE)) {
+      __redisAsyncFree(ac);
+    }
+}
+
+/* Tries to do a clean disconnect from Redis, meaning it stops new commands
+ * from being issued, but tries to flush the output buffer and execute
+ * callbacks for all remaining replies. When this function is called from a
+ * callback, there might be more replies and we can safely defer disconnecting
+ * to redisProcessCallbacks(). Otherwise, we can only disconnect immediately
+ * when there are no pending callbacks. */
+void redisAsyncDisconnect(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    c->flags |= REDIS_DISCONNECTING;
+
+    /** unset the auto-free flag here, because disconnect undoes this */
+    c->flags &= ~REDIS_NO_AUTO_FREE;
+    if (!(c->flags & REDIS_IN_CALLBACK) && ac->replies.head == NULL)
+        __redisAsyncDisconnect(ac);
+}
+
+static int __redisGetSubscribeCallback(redisAsyncContext *ac, redisReply *reply, redisCallback *dstcb) {
+    redisContext *c = &(ac->c);
+    dict *callbacks;
+    redisCallback *cb;
+    dictEntry *de;
+    int pvariant;
+    char *stype;
+    hisds sname;
+
+    /* Custom reply functions are not supported for pub/sub. This will fail
+     * very hard when they are used... */
+    if (reply->type == REDIS_REPLY_ARRAY || reply->type == REDIS_REPLY_PUSH) {
+        assert(reply->elements >= 2);
+        assert(reply->element[0]->type == REDIS_REPLY_STRING);
+        stype = reply->element[0]->str;
+        pvariant = (tolower(stype[0]) == 'p') ? 1 : 0;
+
+        if (pvariant)
+            callbacks = ac->sub.patterns;
+        else
+            callbacks = ac->sub.channels;
+
+        /* Locate the right callback */
+        assert(reply->element[1]->type == REDIS_REPLY_STRING);
+        sname = hi_sdsnewlen(reply->element[1]->str,reply->element[1]->len);
+        if (sname == NULL)
+            goto oom;
+
+        de = dictFind(callbacks,sname);
+        if (de != NULL) {
+            cb = dictGetEntryVal(de);
+
+            /* If this is an subscribe reply decrease pending counter. */
+            if (strcasecmp(stype+pvariant,"subscribe") == 0) {
+                cb->pending_subs -= 1;
+            }
+
+            memcpy(dstcb,cb,sizeof(*dstcb));
+
+            /* If this is an unsubscribe message, remove it. */
+            if (strcasecmp(stype+pvariant,"unsubscribe") == 0) {
+                if (cb->pending_subs == 0)
+                    dictDelete(callbacks,sname);
+
+                /* If this was the last unsubscribe message, revert to
+                 * non-subscribe mode. */
+                assert(reply->element[2]->type == REDIS_REPLY_INTEGER);
+
+                /* Unset subscribed flag only when no pipelined pending subscribe. */
+                if (reply->element[2]->integer == 0
+                    && dictSize(ac->sub.channels) == 0
+                    && dictSize(ac->sub.patterns) == 0)
+                    c->flags &= ~REDIS_SUBSCRIBED;
+            }
+        }
+        hi_sdsfree(sname);
+    } else {
+        /* Shift callback for invalid commands. */
+        __redisShiftCallback(&ac->sub.invalid,dstcb);
+    }
+    return REDIS_OK;
+oom:
+    __redisSetError(&(ac->c), REDIS_ERR_OOM, "Out of memory");
+    return REDIS_ERR;
+}
+
+#define redisIsSpontaneousPushReply(r) \
+    (redisIsPushReply(r) && !redisIsSubscribeReply(r))
+
+static int redisIsSubscribeReply(redisReply *reply) {
+    char *str;
+    size_t len, off;
+
+    /* We will always have at least one string with the subscribe/message type */
+    if (reply->elements < 1 || reply->element[0]->type != REDIS_REPLY_STRING ||
+        reply->element[0]->len < sizeof("message") - 1)
+    {
+        return 0;
+    }
+
+    /* Get the string/len moving past 'p' if needed */
+    off = tolower(reply->element[0]->str[0]) == 'p';
+    str = reply->element[0]->str + off;
+    len = reply->element[0]->len - off;
+
+    return !strncasecmp(str, "subscribe", len) ||
+           !strncasecmp(str, "message", len);
+
+}
+
+void redisProcessCallbacks(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisCallback cb = {NULL, NULL, 0, NULL};
+    void *reply = NULL;
+    int status;
+
+    while((status = redisGetReply(c,&reply)) == REDIS_OK) {
+        if (reply == NULL) {
+            /* When the connection is being disconnected and there are
+             * no more replies, this is the cue to really disconnect. */
+            if (c->flags & REDIS_DISCONNECTING && hi_sdslen(c->obuf) == 0
+                && ac->replies.head == NULL) {
+                __redisAsyncDisconnect(ac);
+                return;
+            }
+
+            /* If monitor mode, repush callback */
+            if(c->flags & REDIS_MONITORING) {
+                __redisPushCallback(&ac->replies,&cb);
+            }
+
+            /* When the connection is not being disconnected, simply stop
+             * trying to get replies and wait for the next loop tick. */
+            break;
+        }
+
+        /* Send any non-subscribe related PUSH messages to our PUSH handler
+         * while allowing subscribe related PUSH messages to pass through.
+         * This allows existing code to be backward compatible and work in
+         * either RESP2 or RESP3 mode. */
+        if (redisIsSpontaneousPushReply(reply)) {
+            __redisRunPushCallback(ac, reply);
+            c->reader->fn->freeObject(reply);
+            continue;
+        }
+
+        /* Even if the context is subscribed, pending regular
+         * callbacks will get a reply before pub/sub messages arrive. */
+        if (__redisShiftCallback(&ac->replies,&cb) != REDIS_OK) {
+            /*
+             * A spontaneous reply in a not-subscribed context can be the error
+             * reply that is sent when a new connection exceeds the maximum
+             * number of allowed connections on the server side.
+             *
+             * This is seen as an error instead of a regular reply because the
+             * server closes the connection after sending it.
+             *
+             * To prevent the error from being overwritten by an EOF error the
+             * connection is closed here. See issue #43.
+             *
+             * Another possibility is that the server is loading its dataset.
+             * In this case we also want to close the connection, and have the
+             * user wait until the server is ready to take our request.
+             */
+            if (((redisReply*)reply)->type == REDIS_REPLY_ERROR) {
+                c->err = REDIS_ERR_OTHER;
+                snprintf(c->errstr,sizeof(c->errstr),"%s",((redisReply*)reply)->str);
+                c->reader->fn->freeObject(reply);
+                __redisAsyncDisconnect(ac);
+                return;
+            }
+            /* No more regular callbacks and no errors, the context *must* be subscribed or monitoring. */
+            assert((c->flags & REDIS_SUBSCRIBED || c->flags & REDIS_MONITORING));
+            if(c->flags & REDIS_SUBSCRIBED)
+                __redisGetSubscribeCallback(ac,reply,&cb);
+        }
+
+        if (cb.fn != NULL) {
+            __redisRunCallback(ac,&cb,reply);
+            c->reader->fn->freeObject(reply);
+
+            /* Proceed with free'ing when redisAsyncFree() was called. */
+            if (c->flags & REDIS_FREEING) {
+                __redisAsyncFree(ac);
+                return;
+            }
+        } else {
+            /* No callback for this reply. This can either be a NULL callback,
+             * or there were no callbacks to begin with. Either way, don't
+             * abort with an error, but simply ignore it because the client
+             * doesn't know what the server will spit out over the wire. */
+            c->reader->fn->freeObject(reply);
+        }
+    }
+
+    /* Disconnect when there was an error reading the reply */
+    if (status != REDIS_OK)
+        __redisAsyncDisconnect(ac);
+}
+
+static void __redisAsyncHandleConnectFailure(redisAsyncContext *ac) {
+    if (ac->onConnect) ac->onConnect(ac, REDIS_ERR);
+    __redisAsyncDisconnect(ac);
+}
+
+/* Internal helper function to detect socket status the first time a read or
+ * write event fires. When connecting was not successful, the connect callback
+ * is called with a REDIS_ERR status and the context is free'd. */
+static int __redisAsyncHandleConnect(redisAsyncContext *ac) {
+    int completed = 0;
+    redisContext *c = &(ac->c);
+
+    if (redisCheckConnectDone(c, &completed) == REDIS_ERR) {
+        /* Error! */
+        redisCheckSocketError(c);
+        __redisAsyncHandleConnectFailure(ac);
+        return REDIS_ERR;
+    } else if (completed == 1) {
+        /* connected! */
+        if (c->connection_type == REDIS_CONN_TCP &&
+            redisSetTcpNoDelay(c) == REDIS_ERR) {
+            __redisAsyncHandleConnectFailure(ac);
+            return REDIS_ERR;
+        }
+
+        if (ac->onConnect) ac->onConnect(ac, REDIS_OK);
+        c->flags |= REDIS_CONNECTED;
+        return REDIS_OK;
+    } else {
+        return REDIS_OK;
+    }
+}
+
+void redisAsyncRead(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+
+    if (redisBufferRead(c) == REDIS_ERR) {
+        __redisAsyncDisconnect(ac);
+    } else {
+        /* Always re-schedule reads */
+        _EL_ADD_READ(ac);
+        redisProcessCallbacks(ac);
+    }
+}
+
+/* This function should be called when the socket is readable.
+ * It processes all replies that can be read and executes their callbacks.
+ */
+void redisAsyncHandleRead(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+
+    if (!(c->flags & REDIS_CONNECTED)) {
+        /* Abort connect was not successful. */
+        if (__redisAsyncHandleConnect(ac) != REDIS_OK)
+            return;
+        /* Try again later when the context is still not connected. */
+        if (!(c->flags & REDIS_CONNECTED))
+            return;
+    }
+
+    c->funcs->async_read(ac);
+}
+
+void redisAsyncWrite(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    int done = 0;
+
+    if (redisBufferWrite(c,&done) == REDIS_ERR) {
+        __redisAsyncDisconnect(ac);
+    } else {
+        /* Continue writing when not done, stop writing otherwise */
+        if (!done)
+            _EL_ADD_WRITE(ac);
+        else
+            _EL_DEL_WRITE(ac);
+
+        /* Always schedule reads after writes */
+        _EL_ADD_READ(ac);
+    }
+}
+
+void redisAsyncHandleWrite(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+
+    if (!(c->flags & REDIS_CONNECTED)) {
+        /* Abort connect was not successful. */
+        if (__redisAsyncHandleConnect(ac) != REDIS_OK)
+            return;
+        /* Try again later when the context is still not connected. */
+        if (!(c->flags & REDIS_CONNECTED))
+            return;
+    }
+
+    c->funcs->async_write(ac);
+}
+
+void redisAsyncHandleTimeout(redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisCallback cb;
+
+    if ((c->flags & REDIS_CONNECTED) && ac->replies.head == NULL) {
+        /* Nothing to do - just an idle timeout */
+        return;
+    }
+
+    if (!c->err) {
+        __redisSetError(c, REDIS_ERR_TIMEOUT, "Timeout");
+    }
+
+    if (!(c->flags & REDIS_CONNECTED) && ac->onConnect) {
+        ac->onConnect(ac, REDIS_ERR);
+    }
+
+    while (__redisShiftCallback(&ac->replies, &cb) == REDIS_OK) {
+        __redisRunCallback(ac, &cb, NULL);
+    }
+
+    /**
+     * TODO: Don't automatically sever the connection,
+     * rather, allow to ignore <x> responses before the queue is clear
+     */
+    __redisAsyncDisconnect(ac);
+}
+
+/* Sets a pointer to the first argument and its length starting at p. Returns
+ * the number of bytes to skip to get to the following argument. */
+static const char *nextArgument(const char *start, const char **str, size_t *len) {
+    const char *p = start;
+    if (p[0] != '$') {
+        p = strchr(p,'$');
+        if (p == NULL) return NULL;
+    }
+
+    *len = (int)strtol(p+1,NULL,10);
+    p = strchr(p,'\r');
+    assert(p);
+    *str = p+2;
+    return p+2+(*len)+2;
+}
+
+/* Helper function for the redisAsyncCommand* family of functions. Writes a
+ * formatted command to the output buffer and registers the provided callback
+ * function with the context. */
+static int __redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len) {
+    redisContext *c = &(ac->c);
+    redisCallback cb;
+    struct dict *cbdict;
+    dictEntry *de;
+    redisCallback *existcb;
+    int pvariant, hasnext;
+    const char *cstr, *astr;
+    size_t clen, alen;
+    const char *p;
+    hisds sname;
+    int ret;
+
+    /* Don't accept new commands when the connection is about to be closed. */
+    if (c->flags & (REDIS_DISCONNECTING | REDIS_FREEING)) return REDIS_ERR;
+
+    /* Setup callback */
+    cb.fn = fn;
+    cb.privdata = privdata;
+    cb.pending_subs = 1;
+
+    /* Find out which command will be appended. */
+    p = nextArgument(cmd,&cstr,&clen);
+    assert(p != NULL);
+    hasnext = (p[0] == '$');
+    pvariant = (tolower(cstr[0]) == 'p') ? 1 : 0;
+    cstr += pvariant;
+    clen -= pvariant;
+
+    if (hasnext && strncasecmp(cstr,"subscribe\r\n",11) == 0) {
+        c->flags |= REDIS_SUBSCRIBED;
+
+        /* Add every channel/pattern to the list of subscription callbacks. */
+        while ((p = nextArgument(p,&astr,&alen)) != NULL) {
+            sname = hi_sdsnewlen(astr,alen);
+            if (sname == NULL)
+                goto oom;
+
+            if (pvariant)
+                cbdict = ac->sub.patterns;
+            else
+                cbdict = ac->sub.channels;
+
+            de = dictFind(cbdict,sname);
+
+            if (de != NULL) {
+                existcb = dictGetEntryVal(de);
+                cb.pending_subs = existcb->pending_subs + 1;
+            }
+
+            ret = dictReplace(cbdict,sname,&cb);
+
+            if (ret == 0) hi_sdsfree(sname);
+        }
+    } else if (strncasecmp(cstr,"unsubscribe\r\n",13) == 0) {
+        /* It is only useful to call (P)UNSUBSCRIBE when the context is
+         * subscribed to one or more channels or patterns. */
+        if (!(c->flags & REDIS_SUBSCRIBED)) return REDIS_ERR;
+
+        /* (P)UNSUBSCRIBE does not have its own response: every channel or
+         * pattern that is unsubscribed will receive a message. This means we
+         * should not append a callback function for this command. */
+     } else if(strncasecmp(cstr,"monitor\r\n",9) == 0) {
+         /* Set monitor flag and push callback */
+         c->flags |= REDIS_MONITORING;
+         __redisPushCallback(&ac->replies,&cb);
+    } else {
+        if (c->flags & REDIS_SUBSCRIBED)
+            /* This will likely result in an error reply, but it needs to be
+             * received and passed to the callback. */
+            __redisPushCallback(&ac->sub.invalid,&cb);
+        else
+            __redisPushCallback(&ac->replies,&cb);
+    }
+
+    __redisAppendCommand(c,cmd,len);
+
+    /* Always schedule a write when the write buffer is non-empty */
+    _EL_ADD_WRITE(ac);
+
+    return REDIS_OK;
+oom:
+    __redisSetError(&(ac->c), REDIS_ERR_OOM, "Out of memory");
+    return REDIS_ERR;
+}
+
+int redisvAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, va_list ap) {
+    char *cmd;
+    int len;
+    int status;
+    len = redisvFormatCommand(&cmd,format,ap);
+
+    /* We don't want to pass -1 or -2 to future functions as a length. */
+    if (len < 0)
+        return REDIS_ERR;
+
+    status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
+    hi_free(cmd);
+    return status;
+}
+
+int redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, ...) {
+    va_list ap;
+    int status;
+    va_start(ap,format);
+    status = redisvAsyncCommand(ac,fn,privdata,format,ap);
+    va_end(ap);
+    return status;
+}
+
+int redisAsyncCommandArgv(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, int argc, const char **argv, const size_t *argvlen) {
+    hisds cmd;
+    int len;
+    int status;
+    len = redisFormatSdsCommandArgv(&cmd,argc,argv,argvlen);
+    if (len < 0)
+        return REDIS_ERR;
+    status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
+    hi_sdsfree(cmd);
+    return status;
+}
+
+int redisAsyncFormattedCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len) {
+    int status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
+    return status;
+}
+
+redisAsyncPushFn *redisAsyncSetPushCallback(redisAsyncContext *ac, redisAsyncPushFn *fn) {
+    redisAsyncPushFn *old = ac->push_cb;
+    ac->push_cb = fn;
+    return old;
+}
+
+int redisAsyncSetTimeout(redisAsyncContext *ac, struct timeval tv) {
+    if (!ac->c.command_timeout) {
+        ac->c.command_timeout = hi_calloc(1, sizeof(tv));
+        if (ac->c.command_timeout == NULL) {
+            __redisSetError(&ac->c, REDIS_ERR_OOM, "Out of memory");
+            __redisAsyncCopyError(ac);
+            return REDIS_ERR;
+        }
+    }
+
+    if (tv.tv_sec != ac->c.command_timeout->tv_sec ||
+        tv.tv_usec != ac->c.command_timeout->tv_usec)
+    {
+        *ac->c.command_timeout = tv;
+    }
+
+    return REDIS_OK;
+}
diff --git a/redis-stable/deps/hiredis/async.h b/redis-stable/deps/hiredis/async.h
new file mode 100644
index 00000000..b1d2cb26
--- /dev/null
+++ b/redis-stable/deps/hiredis/async.h
@@ -0,0 +1,147 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_ASYNC_H
+#define __HIREDIS_ASYNC_H
+#include "hiredis.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct redisAsyncContext; /* need forward declaration of redisAsyncContext */
+struct dict; /* dictionary header is included in async.c */
+
+/* Reply callback prototype and container */
+typedef void (redisCallbackFn)(struct redisAsyncContext*, void*, void*);
+typedef struct redisCallback {
+    struct redisCallback *next; /* simple singly linked list */
+    redisCallbackFn *fn;
+    int pending_subs;
+    void *privdata;
+} redisCallback;
+
+/* List of callbacks for either regular replies or pub/sub */
+typedef struct redisCallbackList {
+    redisCallback *head, *tail;
+} redisCallbackList;
+
+/* Connection callback prototypes */
+typedef void (redisDisconnectCallback)(const struct redisAsyncContext*, int status);
+typedef void (redisConnectCallback)(const struct redisAsyncContext*, int status);
+typedef void(redisTimerCallback)(void *timer, void *privdata);
+
+/* Context for an async connection to Redis */
+typedef struct redisAsyncContext {
+    /* Hold the regular context, so it can be realloc'ed. */
+    redisContext c;
+
+    /* Setup error flags so they can be used directly. */
+    int err;
+    char *errstr;
+
+    /* Not used by hiredis */
+    void *data;
+    void (*dataCleanup)(void *privdata);
+
+    /* Event library data and hooks */
+    struct {
+        void *data;
+
+        /* Hooks that are called when the library expects to start
+         * reading/writing. These functions should be idempotent. */
+        void (*addRead)(void *privdata);
+        void (*delRead)(void *privdata);
+        void (*addWrite)(void *privdata);
+        void (*delWrite)(void *privdata);
+        void (*cleanup)(void *privdata);
+        void (*scheduleTimer)(void *privdata, struct timeval tv);
+    } ev;
+
+    /* Called when either the connection is terminated due to an error or per
+     * user request. The status is set accordingly (REDIS_OK, REDIS_ERR). */
+    redisDisconnectCallback *onDisconnect;
+
+    /* Called when the first write event was received. */
+    redisConnectCallback *onConnect;
+
+    /* Regular command callbacks */
+    redisCallbackList replies;
+
+    /* Address used for connect() */
+    struct sockaddr *saddr;
+    size_t addrlen;
+
+    /* Subscription callbacks */
+    struct {
+        redisCallbackList invalid;
+        struct dict *channels;
+        struct dict *patterns;
+    } sub;
+
+    /* Any configured RESP3 PUSH handler */
+    redisAsyncPushFn *push_cb;
+} redisAsyncContext;
+
+/* Functions that proxy to hiredis */
+redisAsyncContext *redisAsyncConnectWithOptions(const redisOptions *options);
+redisAsyncContext *redisAsyncConnect(const char *ip, int port);
+redisAsyncContext *redisAsyncConnectBind(const char *ip, int port, const char *source_addr);
+redisAsyncContext *redisAsyncConnectBindWithReuse(const char *ip, int port,
+                                                  const char *source_addr);
+redisAsyncContext *redisAsyncConnectUnix(const char *path);
+int redisAsyncSetConnectCallback(redisAsyncContext *ac, redisConnectCallback *fn);
+int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn);
+
+redisAsyncPushFn *redisAsyncSetPushCallback(redisAsyncContext *ac, redisAsyncPushFn *fn);
+int redisAsyncSetTimeout(redisAsyncContext *ac, struct timeval tv);
+void redisAsyncDisconnect(redisAsyncContext *ac);
+void redisAsyncFree(redisAsyncContext *ac);
+
+/* Handle read/write events */
+void redisAsyncHandleRead(redisAsyncContext *ac);
+void redisAsyncHandleWrite(redisAsyncContext *ac);
+void redisAsyncHandleTimeout(redisAsyncContext *ac);
+void redisAsyncRead(redisAsyncContext *ac);
+void redisAsyncWrite(redisAsyncContext *ac);
+
+/* Command functions for an async context. Write the command to the
+ * output buffer and register the provided callback. */
+int redisvAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, va_list ap);
+int redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, ...);
+int redisAsyncCommandArgv(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, int argc, const char **argv, const size_t *argvlen);
+int redisAsyncFormattedCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/redis-stable/deps/hiredis/async_private.h b/redis-stable/deps/hiredis/async_private.h
new file mode 100644
index 00000000..ea0558d4
--- /dev/null
+++ b/redis-stable/deps/hiredis/async_private.h
@@ -0,0 +1,75 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_ASYNC_PRIVATE_H
+#define __HIREDIS_ASYNC_PRIVATE_H
+
+#define _EL_ADD_READ(ctx)                                         \
+    do {                                                          \
+        refreshTimeout(ctx);                                      \
+        if ((ctx)->ev.addRead) (ctx)->ev.addRead((ctx)->ev.data); \
+    } while (0)
+#define _EL_DEL_READ(ctx) do { \
+        if ((ctx)->ev.delRead) (ctx)->ev.delRead((ctx)->ev.data); \
+    } while(0)
+#define _EL_ADD_WRITE(ctx)                                          \
+    do {                                                            \
+        refreshTimeout(ctx);                                        \
+        if ((ctx)->ev.addWrite) (ctx)->ev.addWrite((ctx)->ev.data); \
+    } while (0)
+#define _EL_DEL_WRITE(ctx) do { \
+        if ((ctx)->ev.delWrite) (ctx)->ev.delWrite((ctx)->ev.data); \
+    } while(0)
+#define _EL_CLEANUP(ctx) do { \
+        if ((ctx)->ev.cleanup) (ctx)->ev.cleanup((ctx)->ev.data); \
+        ctx->ev.cleanup = NULL; \
+    } while(0)
+
+static inline void refreshTimeout(redisAsyncContext *ctx) {
+    #define REDIS_TIMER_ISSET(tvp) \
+        (tvp && ((tvp)->tv_sec || (tvp)->tv_usec))
+
+    #define REDIS_EL_TIMER(ac, tvp) \
+        if ((ac)->ev.scheduleTimer && REDIS_TIMER_ISSET(tvp)) { \
+            (ac)->ev.scheduleTimer((ac)->ev.data, *(tvp)); \
+        }
+
+    if (ctx->c.flags & REDIS_CONNECTED) {
+        REDIS_EL_TIMER(ctx, ctx->c.command_timeout);
+    } else {
+        REDIS_EL_TIMER(ctx, ctx->c.connect_timeout);
+    }
+}
+
+void __redisAsyncDisconnect(redisAsyncContext *ac);
+void redisProcessCallbacks(redisAsyncContext *ac);
+
+#endif  /* __HIREDIS_ASYNC_PRIVATE_H */
diff --git a/redis-stable/deps/hiredis/dict.c b/redis-stable/deps/hiredis/dict.c
new file mode 100644
index 00000000..34a33ead
--- /dev/null
+++ b/redis-stable/deps/hiredis/dict.c
@@ -0,0 +1,352 @@
+/* Hash table implementation.
+ *
+ * This file implements in memory hash tables with insert/del/replace/find/
+ * get-random-element operations. Hash tables will auto resize if needed
+ * tables of power of two in size are used, collisions are handled by
+ * chaining. See the source code for more information... :)
+ *
+ * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include "alloc.h"
+#include <stdlib.h>
+#include <assert.h>
+#include <limits.h>
+#include "dict.h"
+
+/* -------------------------- private prototypes ---------------------------- */
+
+static int _dictExpandIfNeeded(dict *ht);
+static unsigned long _dictNextPower(unsigned long size);
+static int _dictKeyIndex(dict *ht, const void *key);
+static int _dictInit(dict *ht, dictType *type, void *privDataPtr);
+
+/* -------------------------- hash functions -------------------------------- */
+
+/* Generic hash function (a popular one from Bernstein).
+ * I tested a few and this was the best. */
+static unsigned int dictGenHashFunction(const unsigned char *buf, int len) {
+    unsigned int hash = 5381;
+
+    while (len--)
+        hash = ((hash << 5) + hash) + (*buf++); /* hash * 33 + c */
+    return hash;
+}
+
+/* ----------------------------- API implementation ------------------------- */
+
+/* Reset an hashtable already initialized with ht_init().
+ * NOTE: This function should only called by ht_destroy(). */
+static void _dictReset(dict *ht) {
+    ht->table = NULL;
+    ht->size = 0;
+    ht->sizemask = 0;
+    ht->used = 0;
+}
+
+/* Create a new hash table */
+static dict *dictCreate(dictType *type, void *privDataPtr) {
+    dict *ht = hi_malloc(sizeof(*ht));
+    if (ht == NULL)
+        return NULL;
+
+    _dictInit(ht,type,privDataPtr);
+    return ht;
+}
+
+/* Initialize the hash table */
+static int _dictInit(dict *ht, dictType *type, void *privDataPtr) {
+    _dictReset(ht);
+    ht->type = type;
+    ht->privdata = privDataPtr;
+    return DICT_OK;
+}
+
+/* Expand or create the hashtable */
+static int dictExpand(dict *ht, unsigned long size) {
+    dict n; /* the new hashtable */
+    unsigned long realsize = _dictNextPower(size), i;
+
+    /* the size is invalid if it is smaller than the number of
+     * elements already inside the hashtable */
+    if (ht->used > size)
+        return DICT_ERR;
+
+    _dictInit(&n, ht->type, ht->privdata);
+    n.size = realsize;
+    n.sizemask = realsize-1;
+    n.table = hi_calloc(realsize,sizeof(dictEntry*));
+    if (n.table == NULL)
+        return DICT_ERR;
+
+    /* Copy all the elements from the old to the new table:
+     * note that if the old hash table is empty ht->size is zero,
+     * so dictExpand just creates an hash table. */
+    n.used = ht->used;
+    for (i = 0; i < ht->size && ht->used > 0; i++) {
+        dictEntry *he, *nextHe;
+
+        if (ht->table[i] == NULL) continue;
+
+        /* For each hash entry on this slot... */
+        he = ht->table[i];
+        while(he) {
+            unsigned int h;
+
+            nextHe = he->next;
+            /* Get the new element index */
+            h = dictHashKey(ht, he->key) & n.sizemask;
+            he->next = n.table[h];
+            n.table[h] = he;
+            ht->used--;
+            /* Pass to the next element */
+            he = nextHe;
+        }
+    }
+    assert(ht->used == 0);
+    hi_free(ht->table);
+
+    /* Remap the new hashtable in the old */
+    *ht = n;
+    return DICT_OK;
+}
+
+/* Add an element to the target hash table */
+static int dictAdd(dict *ht, void *key, void *val) {
+    int index;
+    dictEntry *entry;
+
+    /* Get the index of the new element, or -1 if
+     * the element already exists. */
+    if ((index = _dictKeyIndex(ht, key)) == -1)
+        return DICT_ERR;
+
+    /* Allocates the memory and stores key */
+    entry = hi_malloc(sizeof(*entry));
+    if (entry == NULL)
+        return DICT_ERR;
+
+    entry->next = ht->table[index];
+    ht->table[index] = entry;
+
+    /* Set the hash entry fields. */
+    dictSetHashKey(ht, entry, key);
+    dictSetHashVal(ht, entry, val);
+    ht->used++;
+    return DICT_OK;
+}
+
+/* Add an element, discarding the old if the key already exists.
+ * Return 1 if the key was added from scratch, 0 if there was already an
+ * element with such key and dictReplace() just performed a value update
+ * operation. */
+static int dictReplace(dict *ht, void *key, void *val) {
+    dictEntry *entry, auxentry;
+
+    /* Try to add the element. If the key
+     * does not exists dictAdd will succeed. */
+    if (dictAdd(ht, key, val) == DICT_OK)
+        return 1;
+    /* It already exists, get the entry */
+    entry = dictFind(ht, key);
+    if (entry == NULL)
+        return 0;
+
+    /* Free the old value and set the new one */
+    /* Set the new value and free the old one. Note that it is important
+     * to do that in this order, as the value may just be exactly the same
+     * as the previous one. In this context, think to reference counting,
+     * you want to increment (set), and then decrement (free), and not the
+     * reverse. */
+    auxentry = *entry;
+    dictSetHashVal(ht, entry, val);
+    dictFreeEntryVal(ht, &auxentry);
+    return 0;
+}
+
+/* Search and remove an element */
+static int dictDelete(dict *ht, const void *key) {
+    unsigned int h;
+    dictEntry *de, *prevde;
+
+    if (ht->size == 0)
+        return DICT_ERR;
+    h = dictHashKey(ht, key) & ht->sizemask;
+    de = ht->table[h];
+
+    prevde = NULL;
+    while(de) {
+        if (dictCompareHashKeys(ht,key,de->key)) {
+            /* Unlink the element from the list */
+            if (prevde)
+                prevde->next = de->next;
+            else
+                ht->table[h] = de->next;
+
+            dictFreeEntryKey(ht,de);
+            dictFreeEntryVal(ht,de);
+            hi_free(de);
+            ht->used--;
+            return DICT_OK;
+        }
+        prevde = de;
+        de = de->next;
+    }
+    return DICT_ERR; /* not found */
+}
+
+/* Destroy an entire hash table */
+static int _dictClear(dict *ht) {
+    unsigned long i;
+
+    /* Free all the elements */
+    for (i = 0; i < ht->size && ht->used > 0; i++) {
+        dictEntry *he, *nextHe;
+
+        if ((he = ht->table[i]) == NULL) continue;
+        while(he) {
+            nextHe = he->next;
+            dictFreeEntryKey(ht, he);
+            dictFreeEntryVal(ht, he);
+            hi_free(he);
+            ht->used--;
+            he = nextHe;
+        }
+    }
+    /* Free the table and the allocated cache structure */
+    hi_free(ht->table);
+    /* Re-initialize the table */
+    _dictReset(ht);
+    return DICT_OK; /* never fails */
+}
+
+/* Clear & Release the hash table */
+static void dictRelease(dict *ht) {
+    _dictClear(ht);
+    hi_free(ht);
+}
+
+static dictEntry *dictFind(dict *ht, const void *key) {
+    dictEntry *he;
+    unsigned int h;
+
+    if (ht->size == 0) return NULL;
+    h = dictHashKey(ht, key) & ht->sizemask;
+    he = ht->table[h];
+    while(he) {
+        if (dictCompareHashKeys(ht, key, he->key))
+            return he;
+        he = he->next;
+    }
+    return NULL;
+}
+
+static dictIterator *dictGetIterator(dict *ht) {
+    dictIterator *iter = hi_malloc(sizeof(*iter));
+    if (iter == NULL)
+        return NULL;
+
+    iter->ht = ht;
+    iter->index = -1;
+    iter->entry = NULL;
+    iter->nextEntry = NULL;
+    return iter;
+}
+
+static dictEntry *dictNext(dictIterator *iter) {
+    while (1) {
+        if (iter->entry == NULL) {
+            iter->index++;
+            if (iter->index >=
+                    (signed)iter->ht->size) break;
+            iter->entry = iter->ht->table[iter->index];
+        } else {
+            iter->entry = iter->nextEntry;
+        }
+        if (iter->entry) {
+            /* We need to save the 'next' here, the iterator user
+             * may delete the entry we are returning. */
+            iter->nextEntry = iter->entry->next;
+            return iter->entry;
+        }
+    }
+    return NULL;
+}
+
+static void dictReleaseIterator(dictIterator *iter) {
+    hi_free(iter);
+}
+
+/* ------------------------- private functions ------------------------------ */
+
+/* Expand the hash table if needed */
+static int _dictExpandIfNeeded(dict *ht) {
+    /* If the hash table is empty expand it to the initial size,
+     * if the table is "full" double its size. */
+    if (ht->size == 0)
+        return dictExpand(ht, DICT_HT_INITIAL_SIZE);
+    if (ht->used == ht->size)
+        return dictExpand(ht, ht->size*2);
+    return DICT_OK;
+}
+
+/* Our hash table capability is a power of two */
+static unsigned long _dictNextPower(unsigned long size) {
+    unsigned long i = DICT_HT_INITIAL_SIZE;
+
+    if (size >= LONG_MAX) return LONG_MAX;
+    while(1) {
+        if (i >= size)
+            return i;
+        i *= 2;
+    }
+}
+
+/* Returns the index of a free slot that can be populated with
+ * an hash entry for the given 'key'.
+ * If the key already exists, -1 is returned. */
+static int _dictKeyIndex(dict *ht, const void *key) {
+    unsigned int h;
+    dictEntry *he;
+
+    /* Expand the hashtable if needed */
+    if (_dictExpandIfNeeded(ht) == DICT_ERR)
+        return -1;
+    /* Compute the key hash value */
+    h = dictHashKey(ht, key) & ht->sizemask;
+    /* Search if this slot does not already contain the given key */
+    he = ht->table[h];
+    while(he) {
+        if (dictCompareHashKeys(ht, key, he->key))
+            return -1;
+        he = he->next;
+    }
+    return h;
+}
+
diff --git a/redis-stable/deps/hiredis/dict.h b/redis-stable/deps/hiredis/dict.h
new file mode 100644
index 00000000..95fcd280
--- /dev/null
+++ b/redis-stable/deps/hiredis/dict.h
@@ -0,0 +1,126 @@
+/* Hash table implementation.
+ *
+ * This file implements in memory hash tables with insert/del/replace/find/
+ * get-random-element operations. Hash tables will auto resize if needed
+ * tables of power of two in size are used, collisions are handled by
+ * chaining. See the source code for more information... :)
+ *
+ * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __DICT_H
+#define __DICT_H
+
+#define DICT_OK 0
+#define DICT_ERR 1
+
+/* Unused arguments generate annoying warnings... */
+#define DICT_NOTUSED(V) ((void) V)
+
+typedef struct dictEntry {
+    void *key;
+    void *val;
+    struct dictEntry *next;
+} dictEntry;
+
+typedef struct dictType {
+    unsigned int (*hashFunction)(const void *key);
+    void *(*keyDup)(void *privdata, const void *key);
+    void *(*valDup)(void *privdata, const void *obj);
+    int (*keyCompare)(void *privdata, const void *key1, const void *key2);
+    void (*keyDestructor)(void *privdata, void *key);
+    void (*valDestructor)(void *privdata, void *obj);
+} dictType;
+
+typedef struct dict {
+    dictEntry **table;
+    dictType *type;
+    unsigned long size;
+    unsigned long sizemask;
+    unsigned long used;
+    void *privdata;
+} dict;
+
+typedef struct dictIterator {
+    dict *ht;
+    int index;
+    dictEntry *entry, *nextEntry;
+} dictIterator;
+
+/* This is the initial size of every hash table */
+#define DICT_HT_INITIAL_SIZE     4
+
+/* ------------------------------- Macros ------------------------------------*/
+#define dictFreeEntryVal(ht, entry) \
+    if ((ht)->type->valDestructor) \
+        (ht)->type->valDestructor((ht)->privdata, (entry)->val)
+
+#define dictSetHashVal(ht, entry, _val_) do { \
+    if ((ht)->type->valDup) \
+        entry->val = (ht)->type->valDup((ht)->privdata, _val_); \
+    else \
+        entry->val = (_val_); \
+} while(0)
+
+#define dictFreeEntryKey(ht, entry) \
+    if ((ht)->type->keyDestructor) \
+        (ht)->type->keyDestructor((ht)->privdata, (entry)->key)
+
+#define dictSetHashKey(ht, entry, _key_) do { \
+    if ((ht)->type->keyDup) \
+        entry->key = (ht)->type->keyDup((ht)->privdata, _key_); \
+    else \
+        entry->key = (_key_); \
+} while(0)
+
+#define dictCompareHashKeys(ht, key1, key2) \
+    (((ht)->type->keyCompare) ? \
+        (ht)->type->keyCompare((ht)->privdata, key1, key2) : \
+        (key1) == (key2))
+
+#define dictHashKey(ht, key) (ht)->type->hashFunction(key)
+
+#define dictGetEntryKey(he) ((he)->key)
+#define dictGetEntryVal(he) ((he)->val)
+#define dictSlots(ht) ((ht)->size)
+#define dictSize(ht) ((ht)->used)
+
+/* API */
+static unsigned int dictGenHashFunction(const unsigned char *buf, int len);
+static dict *dictCreate(dictType *type, void *privDataPtr);
+static int dictExpand(dict *ht, unsigned long size);
+static int dictAdd(dict *ht, void *key, void *val);
+static int dictReplace(dict *ht, void *key, void *val);
+static int dictDelete(dict *ht, const void *key);
+static void dictRelease(dict *ht);
+static dictEntry * dictFind(dict *ht, const void *key);
+static dictIterator *dictGetIterator(dict *ht);
+static dictEntry *dictNext(dictIterator *iter);
+static void dictReleaseIterator(dictIterator *iter);
+
+#endif /* __DICT_H */
diff --git a/redis-stable/deps/hiredis/examples/CMakeLists.txt b/redis-stable/deps/hiredis/examples/CMakeLists.txt
new file mode 100644
index 00000000..1d5bc56e
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/CMakeLists.txt
@@ -0,0 +1,49 @@
+INCLUDE(FindPkgConfig)
+# Check for GLib
+
+PKG_CHECK_MODULES(GLIB2 glib-2.0)
+if (GLIB2_FOUND)
+    INCLUDE_DIRECTORIES(${GLIB2_INCLUDE_DIRS})
+    LINK_DIRECTORIES(${GLIB2_LIBRARY_DIRS})
+    ADD_EXECUTABLE(example-glib example-glib.c)
+    TARGET_LINK_LIBRARIES(example-glib hiredis ${GLIB2_LIBRARIES})
+ENDIF(GLIB2_FOUND)
+
+FIND_PATH(LIBEV ev.h
+    HINTS /usr/local /usr/opt/local
+    ENV LIBEV_INCLUDE_DIR)
+
+if (LIBEV)
+    # Just compile and link with libev
+    ADD_EXECUTABLE(example-libev example-libev.c)
+    TARGET_LINK_LIBRARIES(example-libev hiredis ev)
+ENDIF()
+
+FIND_PATH(LIBEVENT event.h)
+if (LIBEVENT)
+    ADD_EXECUTABLE(example-libevent example-libevent)
+    TARGET_LINK_LIBRARIES(example-libevent hiredis event)
+ENDIF()
+
+FIND_PATH(LIBUV uv.h)
+IF (LIBUV)
+    ADD_EXECUTABLE(example-libuv example-libuv.c)
+    TARGET_LINK_LIBRARIES(example-libuv hiredis uv)
+ENDIF()
+
+IF (APPLE)
+    FIND_LIBRARY(CF CoreFoundation)
+    ADD_EXECUTABLE(example-macosx example-macosx.c)
+    TARGET_LINK_LIBRARIES(example-macosx hiredis ${CF})
+ENDIF()
+
+IF (ENABLE_SSL)
+    ADD_EXECUTABLE(example-ssl example-ssl.c)
+    TARGET_LINK_LIBRARIES(example-ssl hiredis hiredis_ssl)
+ENDIF()
+
+ADD_EXECUTABLE(example example.c)
+TARGET_LINK_LIBRARIES(example hiredis)
+
+ADD_EXECUTABLE(example-push example-push.c)
+TARGET_LINK_LIBRARIES(example-push hiredis)
diff --git a/redis-stable/deps/hiredis/examples/example-ae.c b/redis-stable/deps/hiredis/examples/example-ae.c
new file mode 100644
index 00000000..8efa7306
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-ae.c
@@ -0,0 +1,62 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/ae.h>
+
+/* Put event loop in the global scope, so it can be explicitly stopped */
+static aeEventLoop *loop;
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        aeStop(loop);
+        return;
+    }
+
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        aeStop(loop);
+        return;
+    }
+
+    printf("Disconnected...\n");
+    aeStop(loop);
+}
+
+int main (int argc, char **argv) {
+    signal(SIGPIPE, SIG_IGN);
+
+    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    loop = aeCreateEventLoop(64);
+    redisAeAttach(loop, c);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+    aeMain(loop);
+    return 0;
+}
+
diff --git a/redis-stable/deps/hiredis/examples/example-glib.c b/redis-stable/deps/hiredis/examples/example-glib.c
new file mode 100644
index 00000000..d6e10f8e
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-glib.c
@@ -0,0 +1,73 @@
+#include <stdlib.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/glib.h>
+
+static GMainLoop *mainloop;
+
+static void
+connect_cb (const redisAsyncContext *ac G_GNUC_UNUSED,
+            int status)
+{
+    if (status != REDIS_OK) {
+        g_printerr("Failed to connect: %s\n", ac->errstr);
+        g_main_loop_quit(mainloop);
+    } else {
+        g_printerr("Connected...\n");
+    }
+}
+
+static void
+disconnect_cb (const redisAsyncContext *ac G_GNUC_UNUSED,
+               int status)
+{
+    if (status != REDIS_OK) {
+        g_error("Failed to disconnect: %s", ac->errstr);
+    } else {
+        g_printerr("Disconnected...\n");
+        g_main_loop_quit(mainloop);
+    }
+}
+
+static void
+command_cb(redisAsyncContext *ac,
+           gpointer r,
+           gpointer user_data G_GNUC_UNUSED)
+{
+    redisReply *reply = r;
+
+    if (reply) {
+        g_print("REPLY: %s\n", reply->str);
+    }
+
+    redisAsyncDisconnect(ac);
+}
+
+gint
+main (gint argc     G_GNUC_UNUSED,
+      gchar *argv[] G_GNUC_UNUSED)
+{
+    redisAsyncContext *ac;
+    GMainContext *context = NULL;
+    GSource *source;
+
+    ac = redisAsyncConnect("127.0.0.1", 6379);
+    if (ac->err) {
+        g_printerr("%s\n", ac->errstr);
+        exit(EXIT_FAILURE);
+    }
+
+    source = redis_source_new(ac);
+    mainloop = g_main_loop_new(context, FALSE);
+    g_source_attach(source, context);
+
+    redisAsyncSetConnectCallback(ac, connect_cb);
+    redisAsyncSetDisconnectCallback(ac, disconnect_cb);
+    redisAsyncCommand(ac, command_cb, NULL, "SET key 1234");
+    redisAsyncCommand(ac, command_cb, NULL, "GET key");
+
+    g_main_loop_run(mainloop);
+
+    return EXIT_SUCCESS;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-ivykis.c b/redis-stable/deps/hiredis/examples/example-ivykis.c
new file mode 100644
index 00000000..f57dc388
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-ivykis.c
@@ -0,0 +1,60 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/ivykis.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    iv_init();
+
+    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    redisIvykisAttach(c);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+
+    iv_main();
+
+    iv_deinit();
+
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-libev.c b/redis-stable/deps/hiredis/examples/example-libev.c
new file mode 100644
index 00000000..ec474306
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-libev.c
@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/libev.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    redisLibevAttach(EV_DEFAULT_ c);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+    ev_loop(EV_DEFAULT_ 0);
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-libevent-ssl.c b/redis-stable/deps/hiredis/examples/example-libevent-ssl.c
new file mode 100644
index 00000000..7d99af1b
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-libevent-ssl.c
@@ -0,0 +1,90 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <hiredis_ssl.h>
+#include <async.h>
+#include <adapters/libevent.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    struct event_base *base = event_base_new();
+    if (argc < 5) {
+        fprintf(stderr,
+                "Usage: %s <key> <host> <port> <cert> <certKey> [ca]\n", argv[0]);
+        exit(1);
+    }
+
+    const char *value = argv[1];
+    size_t nvalue = strlen(value);
+
+    const char *hostname = argv[2];
+    int port = atoi(argv[3]);
+
+    const char *cert = argv[4];
+    const char *certKey = argv[5];
+    const char *caCert = argc > 5 ? argv[6] : NULL;
+
+    redisSSLContext *ssl;
+    redisSSLContextError ssl_error;
+
+    redisInitOpenSSL();
+
+    ssl = redisCreateSSLContext(caCert, NULL,
+            cert, certKey, NULL, &ssl_error);
+    if (!ssl) {
+        printf("Error: %s\n", redisSSLContextGetError(ssl_error));
+        return 1;
+    }
+
+    redisAsyncContext *c = redisAsyncConnect(hostname, port);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+    if (redisInitiateSSLWithContext(&c->c, ssl) != REDIS_OK) {
+        printf("SSL Error!\n");
+        exit(1);
+    }
+
+    redisLibeventAttach(c,base);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", value, nvalue);
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+    event_base_dispatch(base);
+
+    redisFreeSSLContext(ssl);
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-libevent.c b/redis-stable/deps/hiredis/examples/example-libevent.c
new file mode 100644
index 00000000..49bddd0c
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-libevent.c
@@ -0,0 +1,67 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/libevent.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) {
+        if (c->errstr) {
+            printf("errstr: %s\n", c->errstr);
+        }
+        return;
+    }
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    struct event_base *base = event_base_new();
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
+    struct timeval tv = {0};
+    tv.tv_sec = 1;
+    options.connect_timeout = &tv;
+
+
+    redisAsyncContext *c = redisAsyncConnectWithOptions(&options);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    redisLibeventAttach(c,base);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+    event_base_dispatch(base);
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-libuv.c b/redis-stable/deps/hiredis/examples/example-libuv.c
new file mode 100644
index 00000000..cbde452b
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-libuv.c
@@ -0,0 +1,56 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/libuv.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+#ifndef _WIN32
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    uv_loop_t* loop = uv_default_loop();
+
+    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    redisLibuvAttach(c,loop);
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+    uv_run(loop, UV_RUN_DEFAULT);
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example-macosx.c b/redis-stable/deps/hiredis/examples/example-macosx.c
new file mode 100644
index 00000000..bc84ed5b
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-macosx.c
@@ -0,0 +1,66 @@
+//
+//  Created by Дмитрий Бахвалов on 13.07.15.
+//  Copyright (c) 2015 Dmitry Bakhvalov. All rights reserved.
+//
+
+#include <stdio.h>
+
+#include <hiredis.h>
+#include <async.h>
+#include <adapters/macosx.h>
+
+void getCallback(redisAsyncContext *c, void *r, void *privdata) {
+    redisReply *reply = r;
+    if (reply == NULL) return;
+    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
+
+    /* Disconnect after receiving the reply to GET */
+    redisAsyncDisconnect(c);
+}
+
+void connectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    printf("Connected...\n");
+}
+
+void disconnectCallback(const redisAsyncContext *c, int status) {
+    if (status != REDIS_OK) {
+        printf("Error: %s\n", c->errstr);
+        return;
+    }
+    CFRunLoopStop(CFRunLoopGetCurrent());
+    printf("Disconnected...\n");
+}
+
+int main (int argc, char **argv) {
+    signal(SIGPIPE, SIG_IGN);
+
+    CFRunLoopRef loop = CFRunLoopGetCurrent();
+    if( !loop ) {
+        printf("Error: Cannot get current run loop\n");
+        return 1;
+    }
+
+    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
+    if (c->err) {
+        /* Let *c leak for now... */
+        printf("Error: %s\n", c->errstr);
+        return 1;
+    }
+
+    redisMacOSAttach(c, loop);
+
+    redisAsyncSetConnectCallback(c,connectCallback);
+    redisAsyncSetDisconnectCallback(c,disconnectCallback);
+
+    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
+    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
+
+    CFRunLoopRun();
+
+    return 0;
+}
+
diff --git a/redis-stable/deps/hiredis/examples/example-push.c b/redis-stable/deps/hiredis/examples/example-push.c
new file mode 100644
index 00000000..2d4ab4dc
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-push.c
@@ -0,0 +1,160 @@
+/*
+ * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <hiredis.h>
+#include <win32.h>
+
+#define KEY_COUNT 5
+
+#define panicAbort(fmt, ...) \
+    do { \
+        fprintf(stderr, "%s:%d:%s(): " fmt, __FILE__, __LINE__, __func__, __VA_ARGS__); \
+        exit(-1); \
+    } while (0)
+
+static void assertReplyAndFree(redisContext *context, redisReply *reply, int type) {
+    if (reply == NULL)
+        panicAbort("NULL reply from server (error: %s)", context->errstr);
+
+    if (reply->type != type) {
+        if (reply->type == REDIS_REPLY_ERROR)
+            fprintf(stderr, "Redis Error: %s\n", reply->str);
+
+        panicAbort("Expected reply type %d but got type %d", type, reply->type);
+    }
+
+    freeReplyObject(reply);
+}
+
+/* Switch to the RESP3 protocol and enable client tracking */
+static void enableClientTracking(redisContext *c) {
+    redisReply *reply = redisCommand(c, "HELLO 3");
+    if (reply == NULL || c->err) {
+        panicAbort("NULL reply or server error (error: %s)", c->errstr);
+    }
+
+    if (reply->type != REDIS_REPLY_MAP) {
+        fprintf(stderr, "Error: Can't send HELLO 3 command.  Are you sure you're ");
+        fprintf(stderr, "connected to redis-server >= 6.0.0?\nRedis error: %s\n",
+                        reply->type == REDIS_REPLY_ERROR ? reply->str : "(unknown)");
+        exit(-1);
+    }
+
+    freeReplyObject(reply);
+
+    /* Enable client tracking */
+    reply = redisCommand(c, "CLIENT TRACKING ON");
+    assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
+}
+
+void pushReplyHandler(void *privdata, void *r) {
+    redisReply *reply = r;
+    int *invalidations = privdata;
+
+    /* Sanity check on the invalidation reply */
+    if (reply->type != REDIS_REPLY_PUSH || reply->elements != 2 ||
+        reply->element[1]->type != REDIS_REPLY_ARRAY ||
+        reply->element[1]->element[0]->type != REDIS_REPLY_STRING)
+    {
+        panicAbort("%s", "Can't parse PUSH message!");
+    }
+
+    /* Increment our invalidation count */
+    *invalidations += 1;
+
+    printf("pushReplyHandler(): INVALIDATE '%s' (invalidation count: %d)\n",
+           reply->element[1]->element[0]->str, *invalidations);
+
+    freeReplyObject(reply);
+}
+
+/* We aren't actually freeing anything here, but it is included to show that we can
+ * have hiredis call our data destructor when freeing the context */
+void privdata_dtor(void *privdata) {
+    unsigned int *icount = privdata;
+    printf("privdata_dtor():  In context privdata dtor (invalidations: %u)\n", *icount);
+}
+
+int main(int argc, char **argv) {
+    unsigned int j, invalidations = 0;
+    redisContext *c;
+    redisReply *reply;
+
+    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
+    int port = (argc > 2) ? atoi(argv[2]) : 6379;
+
+    redisOptions o = {0};
+    REDIS_OPTIONS_SET_TCP(&o, hostname, port);
+
+    /* Set our context privdata to the address of our invalidation counter.  Each
+     * time our PUSH handler is called, hiredis will pass the privdata for context.
+     *
+     * This could also be done after we create the context like so:
+     *
+     *    c->privdata = &invalidations;
+     *    c->free_privdata = privdata_dtor;
+     */
+    REDIS_OPTIONS_SET_PRIVDATA(&o, &invalidations, privdata_dtor);
+
+    /* Set our custom PUSH message handler */
+    o.push_cb = pushReplyHandler;
+
+    c = redisConnectWithOptions(&o);
+    if (c == NULL || c->err)
+        panicAbort("Connection error:  %s", c ? c->errstr : "OOM");
+
+    /* Enable RESP3 and turn on client tracking */
+    enableClientTracking(c);
+
+    /* Set some keys and then read them back.  Once we do that, Redis will deliver
+     * invalidation push messages whenever the key is modified */
+    for (j = 0; j < KEY_COUNT; j++) {
+        reply = redisCommand(c, "SET key:%d initial:%d", j, j);
+        assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
+
+        reply = redisCommand(c, "GET key:%d", j);
+        assertReplyAndFree(c, reply, REDIS_REPLY_STRING);
+    }
+
+    /* Trigger invalidation messages by updating keys we just read */
+    for (j = 0; j < KEY_COUNT; j++) {
+        printf("            main(): SET key:%d update:%d\n", j, j);
+        reply = redisCommand(c, "SET key:%d update:%d", j, j);
+        assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
+        printf("            main(): SET REPLY OK\n");
+    }
+
+    printf("\nTotal detected invalidations: %d, expected: %d\n", invalidations, KEY_COUNT);
+
+    /* PING server */
+    redisFree(c);
+}
diff --git a/redis-stable/deps/hiredis/examples/example-qt.cpp b/redis-stable/deps/hiredis/examples/example-qt.cpp
new file mode 100644
index 00000000..f524c3f3
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-qt.cpp
@@ -0,0 +1,46 @@
+#include <iostream>
+using namespace std;
+
+#include <QCoreApplication>
+#include <QTimer>
+
+#include "example-qt.h"
+
+void getCallback(redisAsyncContext *, void * r, void * privdata) {
+
+    redisReply * reply = static_cast<redisReply *>(r);
+    ExampleQt * ex = static_cast<ExampleQt *>(privdata);
+    if (reply == nullptr || ex == nullptr) return;
+
+    cout << "key: " << reply->str << endl;
+
+    ex->finish();
+}
+
+void ExampleQt::run() {
+
+    m_ctx = redisAsyncConnect("localhost", 6379);
+
+    if (m_ctx->err) {
+        cerr << "Error: " << m_ctx->errstr << endl;
+        redisAsyncFree(m_ctx);
+        emit finished();
+    }
+
+    m_adapter.setContext(m_ctx);
+
+    redisAsyncCommand(m_ctx, NULL, NULL, "SET key %s", m_value);
+    redisAsyncCommand(m_ctx, getCallback, this, "GET key");
+}
+
+int main (int argc, char **argv) {
+
+    QCoreApplication app(argc, argv);
+
+    ExampleQt example(argv[argc-1]);
+
+    QObject::connect(&example, SIGNAL(finished()), &app, SLOT(quit()));
+    QTimer::singleShot(0, &example, SLOT(run()));
+
+    return app.exec();
+}
diff --git a/redis-stable/deps/hiredis/examples/example-qt.h b/redis-stable/deps/hiredis/examples/example-qt.h
new file mode 100644
index 00000000..374f4766
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-qt.h
@@ -0,0 +1,32 @@
+#ifndef __HIREDIS_EXAMPLE_QT_H
+#define __HIREDIS_EXAMPLE_QT_H
+
+#include <adapters/qt.h>
+
+class ExampleQt : public QObject {
+
+    Q_OBJECT
+
+    public:
+        ExampleQt(const char * value, QObject * parent = 0)
+            : QObject(parent), m_value(value) {}
+
+    signals:
+        void finished();
+
+    public slots:
+        void run();
+
+    private:
+        void finish() { emit finished(); }
+
+    private:
+        const char * m_value;
+        redisAsyncContext * m_ctx;
+        RedisQtAdapter m_adapter;
+
+    friend
+    void getCallback(redisAsyncContext *, void *, void *);
+};
+
+#endif /* !__HIREDIS_EXAMPLE_QT_H */
diff --git a/redis-stable/deps/hiredis/examples/example-ssl.c b/redis-stable/deps/hiredis/examples/example-ssl.c
new file mode 100644
index 00000000..c754177c
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example-ssl.c
@@ -0,0 +1,110 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include <hiredis.h>
+#include <hiredis_ssl.h>
+#include <win32.h>
+
+int main(int argc, char **argv) {
+    unsigned int j;
+    redisSSLContext *ssl;
+    redisSSLContextError ssl_error;
+    redisContext *c;
+    redisReply *reply;
+    if (argc < 4) {
+        printf("Usage: %s <host> <port> <cert> <key> [ca]\n", argv[0]);
+        exit(1);
+    }
+    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
+    int port = atoi(argv[2]);
+    const char *cert = argv[3];
+    const char *key = argv[4];
+    const char *ca = argc > 4 ? argv[5] : NULL;
+
+    redisInitOpenSSL();
+    ssl = redisCreateSSLContext(ca, NULL, cert, key, NULL, &ssl_error);
+    if (!ssl) {
+        printf("SSL Context error: %s\n",
+                redisSSLContextGetError(ssl_error));
+        exit(1);
+    }
+
+    struct timeval tv = { 1, 500000 }; // 1.5 seconds
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, hostname, port);
+    options.connect_timeout = &tv;
+    c = redisConnectWithOptions(&options);
+
+    if (c == NULL || c->err) {
+        if (c) {
+            printf("Connection error: %s\n", c->errstr);
+            redisFree(c);
+        } else {
+            printf("Connection error: can't allocate redis context\n");
+        }
+        exit(1);
+    }
+
+    if (redisInitiateSSLWithContext(c, ssl) != REDIS_OK) {
+        printf("Couldn't initialize SSL!\n");
+        printf("Error: %s\n", c->errstr);
+        redisFree(c);
+        exit(1);
+    }
+
+    /* PING server */
+    reply = redisCommand(c,"PING");
+    printf("PING: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Set a key */
+    reply = redisCommand(c,"SET %s %s", "foo", "hello world");
+    printf("SET: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Set a key using binary safe API */
+    reply = redisCommand(c,"SET %b %b", "bar", (size_t) 3, "hello", (size_t) 5);
+    printf("SET (binary API): %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Try a GET and two INCR */
+    reply = redisCommand(c,"GET foo");
+    printf("GET foo: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    reply = redisCommand(c,"INCR counter");
+    printf("INCR counter: %lld\n", reply->integer);
+    freeReplyObject(reply);
+    /* again ... */
+    reply = redisCommand(c,"INCR counter");
+    printf("INCR counter: %lld\n", reply->integer);
+    freeReplyObject(reply);
+
+    /* Create a list of numbers, from 0 to 9 */
+    reply = redisCommand(c,"DEL mylist");
+    freeReplyObject(reply);
+    for (j = 0; j < 10; j++) {
+        char buf[64];
+
+        snprintf(buf,64,"%u",j);
+        reply = redisCommand(c,"LPUSH mylist element-%s", buf);
+        freeReplyObject(reply);
+    }
+
+    /* Let's check what we have inside the list */
+    reply = redisCommand(c,"LRANGE mylist 0 -1");
+    if (reply->type == REDIS_REPLY_ARRAY) {
+        for (j = 0; j < reply->elements; j++) {
+            printf("%u) %s\n", j, reply->element[j]->str);
+        }
+    }
+    freeReplyObject(reply);
+
+    /* Disconnects and frees the context */
+    redisFree(c);
+
+    redisFreeSSLContext(ssl);
+
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/examples/example.c b/redis-stable/deps/hiredis/examples/example.c
new file mode 100644
index 00000000..15dacbd1
--- /dev/null
+++ b/redis-stable/deps/hiredis/examples/example.c
@@ -0,0 +1,91 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <hiredis.h>
+#include <win32.h>
+
+int main(int argc, char **argv) {
+    unsigned int j, isunix = 0;
+    redisContext *c;
+    redisReply *reply;
+    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
+
+    if (argc > 2) {
+        if (*argv[2] == 'u' || *argv[2] == 'U') {
+            isunix = 1;
+            /* in this case, host is the path to the unix socket */
+            printf("Will connect to unix socket @%s\n", hostname);
+        }
+    }
+
+    int port = (argc > 2) ? atoi(argv[2]) : 6379;
+
+    struct timeval timeout = { 1, 500000 }; // 1.5 seconds
+    if (isunix) {
+        c = redisConnectUnixWithTimeout(hostname, timeout);
+    } else {
+        c = redisConnectWithTimeout(hostname, port, timeout);
+    }
+    if (c == NULL || c->err) {
+        if (c) {
+            printf("Connection error: %s\n", c->errstr);
+            redisFree(c);
+        } else {
+            printf("Connection error: can't allocate redis context\n");
+        }
+        exit(1);
+    }
+
+    /* PING server */
+    reply = redisCommand(c,"PING");
+    printf("PING: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Set a key */
+    reply = redisCommand(c,"SET %s %s", "foo", "hello world");
+    printf("SET: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Set a key using binary safe API */
+    reply = redisCommand(c,"SET %b %b", "bar", (size_t) 3, "hello", (size_t) 5);
+    printf("SET (binary API): %s\n", reply->str);
+    freeReplyObject(reply);
+
+    /* Try a GET and two INCR */
+    reply = redisCommand(c,"GET foo");
+    printf("GET foo: %s\n", reply->str);
+    freeReplyObject(reply);
+
+    reply = redisCommand(c,"INCR counter");
+    printf("INCR counter: %lld\n", reply->integer);
+    freeReplyObject(reply);
+    /* again ... */
+    reply = redisCommand(c,"INCR counter");
+    printf("INCR counter: %lld\n", reply->integer);
+    freeReplyObject(reply);
+
+    /* Create a list of numbers, from 0 to 9 */
+    reply = redisCommand(c,"DEL mylist");
+    freeReplyObject(reply);
+    for (j = 0; j < 10; j++) {
+        char buf[64];
+
+        snprintf(buf,64,"%u",j);
+        reply = redisCommand(c,"LPUSH mylist element-%s", buf);
+        freeReplyObject(reply);
+    }
+
+    /* Let's check what we have inside the list */
+    reply = redisCommand(c,"LRANGE mylist 0 -1");
+    if (reply->type == REDIS_REPLY_ARRAY) {
+        for (j = 0; j < reply->elements; j++) {
+            printf("%u) %s\n", j, reply->element[j]->str);
+        }
+    }
+    freeReplyObject(reply);
+
+    /* Disconnects and frees the context */
+    redisFree(c);
+
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/fmacros.h b/redis-stable/deps/hiredis/fmacros.h
new file mode 100644
index 00000000..3227faaf
--- /dev/null
+++ b/redis-stable/deps/hiredis/fmacros.h
@@ -0,0 +1,12 @@
+#ifndef __HIREDIS_FMACRO_H
+#define __HIREDIS_FMACRO_H
+
+#define _XOPEN_SOURCE 600
+#define _POSIX_C_SOURCE 200112L
+
+#if defined(__APPLE__) && defined(__MACH__)
+/* Enable TCP_KEEPALIVE */
+#define _DARWIN_C_SOURCE
+#endif
+
+#endif
diff --git a/redis-stable/deps/hiredis/hiredis-config.cmake.in b/redis-stable/deps/hiredis/hiredis-config.cmake.in
new file mode 100644
index 00000000..98851dce
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis-config.cmake.in
@@ -0,0 +1,13 @@
+@PACKAGE_INIT@
+
+set_and_check(hiredis_INCLUDEDIR "@PACKAGE_INCLUDE_INSTALL_DIR@")
+
+IF (NOT TARGET hiredis::hiredis)
+	INCLUDE(${CMAKE_CURRENT_LIST_DIR}/hiredis-targets.cmake)
+ENDIF()
+
+SET(hiredis_LIBRARIES hiredis::hiredis)
+SET(hiredis_INCLUDE_DIRS ${hiredis_INCLUDEDIR})
+
+check_required_components(hiredis)
+
diff --git a/redis-stable/deps/hiredis/hiredis.c b/redis-stable/deps/hiredis/hiredis.c
new file mode 100644
index 00000000..990f6196
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis.c
@@ -0,0 +1,1175 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
+ *                     Jan-Erik Rediger <janerik at fnordig dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include <string.h>
+#include <stdlib.h>
+#include <assert.h>
+#include <errno.h>
+#include <ctype.h>
+
+#include "hiredis.h"
+#include "net.h"
+#include "sds.h"
+#include "async.h"
+#include "win32.h"
+
+extern int redisContextUpdateConnectTimeout(redisContext *c, const struct timeval *timeout);
+extern int redisContextUpdateCommandTimeout(redisContext *c, const struct timeval *timeout);
+
+static redisContextFuncs redisContextDefaultFuncs = {
+    .free_privctx = NULL,
+    .async_read = redisAsyncRead,
+    .async_write = redisAsyncWrite,
+    .read = redisNetRead,
+    .write = redisNetWrite
+};
+
+static redisReply *createReplyObject(int type);
+static void *createStringObject(const redisReadTask *task, char *str, size_t len);
+static void *createArrayObject(const redisReadTask *task, size_t elements);
+static void *createIntegerObject(const redisReadTask *task, long long value);
+static void *createDoubleObject(const redisReadTask *task, double value, char *str, size_t len);
+static void *createNilObject(const redisReadTask *task);
+static void *createBoolObject(const redisReadTask *task, int bval);
+
+/* Default set of functions to build the reply. Keep in mind that such a
+ * function returning NULL is interpreted as OOM. */
+static redisReplyObjectFunctions defaultFunctions = {
+    createStringObject,
+    createArrayObject,
+    createIntegerObject,
+    createDoubleObject,
+    createNilObject,
+    createBoolObject,
+    freeReplyObject
+};
+
+/* Create a reply object */
+static redisReply *createReplyObject(int type) {
+    redisReply *r = hi_calloc(1,sizeof(*r));
+
+    if (r == NULL)
+        return NULL;
+
+    r->type = type;
+    return r;
+}
+
+/* Free a reply object */
+void freeReplyObject(void *reply) {
+    redisReply *r = reply;
+    size_t j;
+
+    if (r == NULL)
+        return;
+
+    switch(r->type) {
+    case REDIS_REPLY_INTEGER:
+        break; /* Nothing to free */
+    case REDIS_REPLY_ARRAY:
+    case REDIS_REPLY_MAP:
+    case REDIS_REPLY_SET:
+    case REDIS_REPLY_PUSH:
+        if (r->element != NULL) {
+            for (j = 0; j < r->elements; j++)
+                freeReplyObject(r->element[j]);
+            hi_free(r->element);
+        }
+        break;
+    case REDIS_REPLY_ERROR:
+    case REDIS_REPLY_STATUS:
+    case REDIS_REPLY_STRING:
+    case REDIS_REPLY_DOUBLE:
+    case REDIS_REPLY_VERB:
+        hi_free(r->str);
+        break;
+    }
+    hi_free(r);
+}
+
+static void *createStringObject(const redisReadTask *task, char *str, size_t len) {
+    redisReply *r, *parent;
+    char *buf;
+
+    r = createReplyObject(task->type);
+    if (r == NULL)
+        return NULL;
+
+    assert(task->type == REDIS_REPLY_ERROR  ||
+           task->type == REDIS_REPLY_STATUS ||
+           task->type == REDIS_REPLY_STRING ||
+           task->type == REDIS_REPLY_VERB);
+
+    /* Copy string value */
+    if (task->type == REDIS_REPLY_VERB) {
+        buf = hi_malloc(len-4+1); /* Skip 4 bytes of verbatim type header. */
+        if (buf == NULL) goto oom;
+
+        memcpy(r->vtype,str,3);
+        r->vtype[3] = '\0';
+        memcpy(buf,str+4,len-4);
+        buf[len-4] = '\0';
+        r->len = len - 4;
+    } else {
+        buf = hi_malloc(len+1);
+        if (buf == NULL) goto oom;
+
+        memcpy(buf,str,len);
+        buf[len] = '\0';
+        r->len = len;
+    }
+    r->str = buf;
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET ||
+               parent->type == REDIS_REPLY_PUSH);
+        parent->element[task->idx] = r;
+    }
+    return r;
+
+oom:
+    freeReplyObject(r);
+    return NULL;
+}
+
+static void *createArrayObject(const redisReadTask *task, size_t elements) {
+    redisReply *r, *parent;
+
+    r = createReplyObject(task->type);
+    if (r == NULL)
+        return NULL;
+
+    if (elements > 0) {
+        if (SIZE_MAX / sizeof(redisReply*) < elements) return NULL;  /* Don't overflow */
+        r->element = hi_calloc(elements,sizeof(redisReply*));
+        if (r->element == NULL) {
+            freeReplyObject(r);
+            return NULL;
+        }
+    }
+
+    r->elements = elements;
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET ||
+               parent->type == REDIS_REPLY_PUSH);
+        parent->element[task->idx] = r;
+    }
+    return r;
+}
+
+static void *createIntegerObject(const redisReadTask *task, long long value) {
+    redisReply *r, *parent;
+
+    r = createReplyObject(REDIS_REPLY_INTEGER);
+    if (r == NULL)
+        return NULL;
+
+    r->integer = value;
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET ||
+               parent->type == REDIS_REPLY_PUSH);
+        parent->element[task->idx] = r;
+    }
+    return r;
+}
+
+static void *createDoubleObject(const redisReadTask *task, double value, char *str, size_t len) {
+    redisReply *r, *parent;
+
+    r = createReplyObject(REDIS_REPLY_DOUBLE);
+    if (r == NULL)
+        return NULL;
+
+    r->dval = value;
+    r->str = hi_malloc(len+1);
+    if (r->str == NULL) {
+        freeReplyObject(r);
+        return NULL;
+    }
+
+    /* The double reply also has the original protocol string representing a
+     * double as a null terminated string. This way the caller does not need
+     * to format back for string conversion, especially since Redis does efforts
+     * to make the string more human readable avoiding the calssical double
+     * decimal string conversion artifacts. */
+    memcpy(r->str, str, len);
+    r->str[len] = '\0';
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET);
+        parent->element[task->idx] = r;
+    }
+    return r;
+}
+
+static void *createNilObject(const redisReadTask *task) {
+    redisReply *r, *parent;
+
+    r = createReplyObject(REDIS_REPLY_NIL);
+    if (r == NULL)
+        return NULL;
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET ||
+               parent->type == REDIS_REPLY_PUSH);
+        parent->element[task->idx] = r;
+    }
+    return r;
+}
+
+static void *createBoolObject(const redisReadTask *task, int bval) {
+    redisReply *r, *parent;
+
+    r = createReplyObject(REDIS_REPLY_BOOL);
+    if (r == NULL)
+        return NULL;
+
+    r->integer = bval != 0;
+
+    if (task->parent) {
+        parent = task->parent->obj;
+        assert(parent->type == REDIS_REPLY_ARRAY ||
+               parent->type == REDIS_REPLY_MAP ||
+               parent->type == REDIS_REPLY_SET);
+        parent->element[task->idx] = r;
+    }
+    return r;
+}
+
+/* Return the number of digits of 'v' when converted to string in radix 10.
+ * Implementation borrowed from link in redis/src/util.c:string2ll(). */
+static uint32_t countDigits(uint64_t v) {
+  uint32_t result = 1;
+  for (;;) {
+    if (v < 10) return result;
+    if (v < 100) return result + 1;
+    if (v < 1000) return result + 2;
+    if (v < 10000) return result + 3;
+    v /= 10000U;
+    result += 4;
+  }
+}
+
+/* Helper that calculates the bulk length given a certain string length. */
+static size_t bulklen(size_t len) {
+    return 1+countDigits(len)+2+len+2;
+}
+
+int redisvFormatCommand(char **target, const char *format, va_list ap) {
+    const char *c = format;
+    char *cmd = NULL; /* final command */
+    int pos; /* position in final command */
+    hisds curarg, newarg; /* current argument */
+    int touched = 0; /* was the current argument touched? */
+    char **curargv = NULL, **newargv = NULL;
+    int argc = 0;
+    int totlen = 0;
+    int error_type = 0; /* 0 = no error; -1 = memory error; -2 = format error */
+    int j;
+
+    /* Abort if there is not target to set */
+    if (target == NULL)
+        return -1;
+
+    /* Build the command string accordingly to protocol */
+    curarg = hi_sdsempty();
+    if (curarg == NULL)
+        return -1;
+
+    while(*c != '\0') {
+        if (*c != '%' || c[1] == '\0') {
+            if (*c == ' ') {
+                if (touched) {
+                    newargv = hi_realloc(curargv,sizeof(char*)*(argc+1));
+                    if (newargv == NULL) goto memory_err;
+                    curargv = newargv;
+                    curargv[argc++] = curarg;
+                    totlen += bulklen(hi_sdslen(curarg));
+
+                    /* curarg is put in argv so it can be overwritten. */
+                    curarg = hi_sdsempty();
+                    if (curarg == NULL) goto memory_err;
+                    touched = 0;
+                }
+            } else {
+                newarg = hi_sdscatlen(curarg,c,1);
+                if (newarg == NULL) goto memory_err;
+                curarg = newarg;
+                touched = 1;
+            }
+        } else {
+            char *arg;
+            size_t size;
+
+            /* Set newarg so it can be checked even if it is not touched. */
+            newarg = curarg;
+
+            switch(c[1]) {
+            case 's':
+                arg = va_arg(ap,char*);
+                size = strlen(arg);
+                if (size > 0)
+                    newarg = hi_sdscatlen(curarg,arg,size);
+                break;
+            case 'b':
+                arg = va_arg(ap,char*);
+                size = va_arg(ap,size_t);
+                if (size > 0)
+                    newarg = hi_sdscatlen(curarg,arg,size);
+                break;
+            case '%':
+                newarg = hi_sdscat(curarg,"%");
+                break;
+            default:
+                /* Try to detect printf format */
+                {
+                    static const char intfmts[] = "diouxX";
+                    static const char flags[] = "#0-+ ";
+                    char _format[16];
+                    const char *_p = c+1;
+                    size_t _l = 0;
+                    va_list _cpy;
+
+                    /* Flags */
+                    while (*_p != '\0' && strchr(flags,*_p) != NULL) _p++;
+
+                    /* Field width */
+                    while (*_p != '\0' && isdigit(*_p)) _p++;
+
+                    /* Precision */
+                    if (*_p == '.') {
+                        _p++;
+                        while (*_p != '\0' && isdigit(*_p)) _p++;
+                    }
+
+                    /* Copy va_list before consuming with va_arg */
+                    va_copy(_cpy,ap);
+
+                    /* Integer conversion (without modifiers) */
+                    if (strchr(intfmts,*_p) != NULL) {
+                        va_arg(ap,int);
+                        goto fmt_valid;
+                    }
+
+                    /* Double conversion (without modifiers) */
+                    if (strchr("eEfFgGaA",*_p) != NULL) {
+                        va_arg(ap,double);
+                        goto fmt_valid;
+                    }
+
+                    /* Size: char */
+                    if (_p[0] == 'h' && _p[1] == 'h') {
+                        _p += 2;
+                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
+                            va_arg(ap,int); /* char gets promoted to int */
+                            goto fmt_valid;
+                        }
+                        goto fmt_invalid;
+                    }
+
+                    /* Size: short */
+                    if (_p[0] == 'h') {
+                        _p += 1;
+                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
+                            va_arg(ap,int); /* short gets promoted to int */
+                            goto fmt_valid;
+                        }
+                        goto fmt_invalid;
+                    }
+
+                    /* Size: long long */
+                    if (_p[0] == 'l' && _p[1] == 'l') {
+                        _p += 2;
+                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
+                            va_arg(ap,long long);
+                            goto fmt_valid;
+                        }
+                        goto fmt_invalid;
+                    }
+
+                    /* Size: long */
+                    if (_p[0] == 'l') {
+                        _p += 1;
+                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
+                            va_arg(ap,long);
+                            goto fmt_valid;
+                        }
+                        goto fmt_invalid;
+                    }
+
+                fmt_invalid:
+                    va_end(_cpy);
+                    goto format_err;
+
+                fmt_valid:
+                    _l = (_p+1)-c;
+                    if (_l < sizeof(_format)-2) {
+                        memcpy(_format,c,_l);
+                        _format[_l] = '\0';
+                        newarg = hi_sdscatvprintf(curarg,_format,_cpy);
+
+                        /* Update current position (note: outer blocks
+                         * increment c twice so compensate here) */
+                        c = _p-1;
+                    }
+
+                    va_end(_cpy);
+                    break;
+                }
+            }
+
+            if (newarg == NULL) goto memory_err;
+            curarg = newarg;
+
+            touched = 1;
+            c++;
+        }
+        c++;
+    }
+
+    /* Add the last argument if needed */
+    if (touched) {
+        newargv = hi_realloc(curargv,sizeof(char*)*(argc+1));
+        if (newargv == NULL) goto memory_err;
+        curargv = newargv;
+        curargv[argc++] = curarg;
+        totlen += bulklen(hi_sdslen(curarg));
+    } else {
+        hi_sdsfree(curarg);
+    }
+
+    /* Clear curarg because it was put in curargv or was free'd. */
+    curarg = NULL;
+
+    /* Add bytes needed to hold multi bulk count */
+    totlen += 1+countDigits(argc)+2;
+
+    /* Build the command at protocol level */
+    cmd = hi_malloc(totlen+1);
+    if (cmd == NULL) goto memory_err;
+
+    pos = sprintf(cmd,"*%d\r\n",argc);
+    for (j = 0; j < argc; j++) {
+        pos += sprintf(cmd+pos,"$%zu\r\n",hi_sdslen(curargv[j]));
+        memcpy(cmd+pos,curargv[j],hi_sdslen(curargv[j]));
+        pos += hi_sdslen(curargv[j]);
+        hi_sdsfree(curargv[j]);
+        cmd[pos++] = '\r';
+        cmd[pos++] = '\n';
+    }
+    assert(pos == totlen);
+    cmd[pos] = '\0';
+
+    hi_free(curargv);
+    *target = cmd;
+    return totlen;
+
+format_err:
+    error_type = -2;
+    goto cleanup;
+
+memory_err:
+    error_type = -1;
+    goto cleanup;
+
+cleanup:
+    if (curargv) {
+        while(argc--)
+            hi_sdsfree(curargv[argc]);
+        hi_free(curargv);
+    }
+
+    hi_sdsfree(curarg);
+    hi_free(cmd);
+
+    return error_type;
+}
+
+/* Format a command according to the Redis protocol. This function
+ * takes a format similar to printf:
+ *
+ * %s represents a C null terminated string you want to interpolate
+ * %b represents a binary safe string
+ *
+ * When using %b you need to provide both the pointer to the string
+ * and the length in bytes as a size_t. Examples:
+ *
+ * len = redisFormatCommand(target, "GET %s", mykey);
+ * len = redisFormatCommand(target, "SET %s %b", mykey, myval, myvallen);
+ */
+int redisFormatCommand(char **target, const char *format, ...) {
+    va_list ap;
+    int len;
+    va_start(ap,format);
+    len = redisvFormatCommand(target,format,ap);
+    va_end(ap);
+
+    /* The API says "-1" means bad result, but we now also return "-2" in some
+     * cases.  Force the return value to always be -1. */
+    if (len < 0)
+        len = -1;
+
+    return len;
+}
+
+/* Format a command according to the Redis protocol using an hisds string and
+ * hi_sdscatfmt for the processing of arguments. This function takes the
+ * number of arguments, an array with arguments and an array with their
+ * lengths. If the latter is set to NULL, strlen will be used to compute the
+ * argument lengths.
+ */
+int redisFormatSdsCommandArgv(hisds *target, int argc, const char **argv,
+                              const size_t *argvlen)
+{
+    hisds cmd, aux;
+    unsigned long long totlen;
+    int j;
+    size_t len;
+
+    /* Abort on a NULL target */
+    if (target == NULL)
+        return -1;
+
+    /* Calculate our total size */
+    totlen = 1+countDigits(argc)+2;
+    for (j = 0; j < argc; j++) {
+        len = argvlen ? argvlen[j] : strlen(argv[j]);
+        totlen += bulklen(len);
+    }
+
+    /* Use an SDS string for command construction */
+    cmd = hi_sdsempty();
+    if (cmd == NULL)
+        return -1;
+
+    /* We already know how much storage we need */
+    aux = hi_sdsMakeRoomFor(cmd, totlen);
+    if (aux == NULL) {
+        hi_sdsfree(cmd);
+        return -1;
+    }
+
+    cmd = aux;
+
+    /* Construct command */
+    cmd = hi_sdscatfmt(cmd, "*%i\r\n", argc);
+    for (j=0; j < argc; j++) {
+        len = argvlen ? argvlen[j] : strlen(argv[j]);
+        cmd = hi_sdscatfmt(cmd, "$%u\r\n", len);
+        cmd = hi_sdscatlen(cmd, argv[j], len);
+        cmd = hi_sdscatlen(cmd, "\r\n", sizeof("\r\n")-1);
+    }
+
+    assert(hi_sdslen(cmd)==totlen);
+
+    *target = cmd;
+    return totlen;
+}
+
+void redisFreeSdsCommand(hisds cmd) {
+    hi_sdsfree(cmd);
+}
+
+/* Format a command according to the Redis protocol. This function takes the
+ * number of arguments, an array with arguments and an array with their
+ * lengths. If the latter is set to NULL, strlen will be used to compute the
+ * argument lengths.
+ */
+int redisFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen) {
+    char *cmd = NULL; /* final command */
+    int pos; /* position in final command */
+    size_t len;
+    int totlen, j;
+
+    /* Abort on a NULL target */
+    if (target == NULL)
+        return -1;
+
+    /* Calculate number of bytes needed for the command */
+    totlen = 1+countDigits(argc)+2;
+    for (j = 0; j < argc; j++) {
+        len = argvlen ? argvlen[j] : strlen(argv[j]);
+        totlen += bulklen(len);
+    }
+
+    /* Build the command at protocol level */
+    cmd = hi_malloc(totlen+1);
+    if (cmd == NULL)
+        return -1;
+
+    pos = sprintf(cmd,"*%d\r\n",argc);
+    for (j = 0; j < argc; j++) {
+        len = argvlen ? argvlen[j] : strlen(argv[j]);
+        pos += sprintf(cmd+pos,"$%zu\r\n",len);
+        memcpy(cmd+pos,argv[j],len);
+        pos += len;
+        cmd[pos++] = '\r';
+        cmd[pos++] = '\n';
+    }
+    assert(pos == totlen);
+    cmd[pos] = '\0';
+
+    *target = cmd;
+    return totlen;
+}
+
+void redisFreeCommand(char *cmd) {
+    hi_free(cmd);
+}
+
+void __redisSetError(redisContext *c, int type, const char *str) {
+    size_t len;
+
+    c->err = type;
+    if (str != NULL) {
+        len = strlen(str);
+        len = len < (sizeof(c->errstr)-1) ? len : (sizeof(c->errstr)-1);
+        memcpy(c->errstr,str,len);
+        c->errstr[len] = '\0';
+    } else {
+        /* Only REDIS_ERR_IO may lack a description! */
+        assert(type == REDIS_ERR_IO);
+        strerror_r(errno, c->errstr, sizeof(c->errstr));
+    }
+}
+
+redisReader *redisReaderCreate(void) {
+    return redisReaderCreateWithFunctions(&defaultFunctions);
+}
+
+static void redisPushAutoFree(void *privdata, void *reply) {
+    (void)privdata;
+    freeReplyObject(reply);
+}
+
+static redisContext *redisContextInit(void) {
+    redisContext *c;
+
+    c = hi_calloc(1, sizeof(*c));
+    if (c == NULL)
+        return NULL;
+
+    c->funcs = &redisContextDefaultFuncs;
+
+    c->obuf = hi_sdsempty();
+    c->reader = redisReaderCreate();
+    c->fd = REDIS_INVALID_FD;
+
+    if (c->obuf == NULL || c->reader == NULL) {
+        redisFree(c);
+        return NULL;
+    }
+
+    return c;
+}
+
+void redisFree(redisContext *c) {
+    if (c == NULL)
+        return;
+    redisNetClose(c);
+
+    hi_sdsfree(c->obuf);
+    redisReaderFree(c->reader);
+    hi_free(c->tcp.host);
+    hi_free(c->tcp.source_addr);
+    hi_free(c->unix_sock.path);
+    hi_free(c->connect_timeout);
+    hi_free(c->command_timeout);
+    hi_free(c->saddr);
+
+    if (c->privdata && c->free_privdata)
+        c->free_privdata(c->privdata);
+
+    if (c->funcs->free_privctx)
+        c->funcs->free_privctx(c->privctx);
+
+    memset(c, 0xff, sizeof(*c));
+    hi_free(c);
+}
+
+redisFD redisFreeKeepFd(redisContext *c) {
+    redisFD fd = c->fd;
+    c->fd = REDIS_INVALID_FD;
+    redisFree(c);
+    return fd;
+}
+
+int redisReconnect(redisContext *c) {
+    c->err = 0;
+    memset(c->errstr, '\0', strlen(c->errstr));
+
+    if (c->privctx && c->funcs->free_privctx) {
+        c->funcs->free_privctx(c->privctx);
+        c->privctx = NULL;
+    }
+
+    redisNetClose(c);
+
+    hi_sdsfree(c->obuf);
+    redisReaderFree(c->reader);
+
+    c->obuf = hi_sdsempty();
+    c->reader = redisReaderCreate();
+
+    if (c->obuf == NULL || c->reader == NULL) {
+        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+        return REDIS_ERR;
+    }
+
+    int ret = REDIS_ERR;
+    if (c->connection_type == REDIS_CONN_TCP) {
+        ret = redisContextConnectBindTcp(c, c->tcp.host, c->tcp.port,
+               c->connect_timeout, c->tcp.source_addr);
+    } else if (c->connection_type == REDIS_CONN_UNIX) {
+        ret = redisContextConnectUnix(c, c->unix_sock.path, c->connect_timeout);
+    } else {
+        /* Something bad happened here and shouldn't have. There isn't
+           enough information in the context to reconnect. */
+        __redisSetError(c,REDIS_ERR_OTHER,"Not enough information to reconnect");
+        ret = REDIS_ERR;
+    }
+
+    if (c->command_timeout != NULL && (c->flags & REDIS_BLOCK) && c->fd != REDIS_INVALID_FD) {
+        redisContextSetTimeout(c, *c->command_timeout);
+    }
+
+    return ret;
+}
+
+redisContext *redisConnectWithOptions(const redisOptions *options) {
+    redisContext *c = redisContextInit();
+    if (c == NULL) {
+        return NULL;
+    }
+    if (!(options->options & REDIS_OPT_NONBLOCK)) {
+        c->flags |= REDIS_BLOCK;
+    }
+    if (options->options & REDIS_OPT_REUSEADDR) {
+        c->flags |= REDIS_REUSEADDR;
+    }
+    if (options->options & REDIS_OPT_NOAUTOFREE) {
+        c->flags |= REDIS_NO_AUTO_FREE;
+    }
+
+    /* Set any user supplied RESP3 PUSH handler or use freeReplyObject
+     * as a default unless specifically flagged that we don't want one. */
+    if (options->push_cb != NULL)
+        redisSetPushCallback(c, options->push_cb);
+    else if (!(options->options & REDIS_OPT_NO_PUSH_AUTOFREE))
+        redisSetPushCallback(c, redisPushAutoFree);
+
+    c->privdata = options->privdata;
+    c->free_privdata = options->free_privdata;
+
+    if (redisContextUpdateConnectTimeout(c, options->connect_timeout) != REDIS_OK ||
+        redisContextUpdateCommandTimeout(c, options->command_timeout) != REDIS_OK) {
+        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+        return c;
+    }
+
+    if (options->type == REDIS_CONN_TCP) {
+        redisContextConnectBindTcp(c, options->endpoint.tcp.ip,
+                                   options->endpoint.tcp.port, options->connect_timeout,
+                                   options->endpoint.tcp.source_addr);
+    } else if (options->type == REDIS_CONN_UNIX) {
+        redisContextConnectUnix(c, options->endpoint.unix_socket,
+                                options->connect_timeout);
+    } else if (options->type == REDIS_CONN_USERFD) {
+        c->fd = options->endpoint.fd;
+        c->flags |= REDIS_CONNECTED;
+    } else {
+        // Unknown type - FIXME - FREE
+        return NULL;
+    }
+
+    if (options->command_timeout != NULL && (c->flags & REDIS_BLOCK) && c->fd != REDIS_INVALID_FD) {
+        redisContextSetTimeout(c, *options->command_timeout);
+    }
+
+    return c;
+}
+
+/* Connect to a Redis instance. On error the field error in the returned
+ * context will be set to the return value of the error function.
+ * When no set of reply functions is given, the default set will be used. */
+redisContext *redisConnect(const char *ip, int port) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectWithTimeout(const char *ip, int port, const struct timeval tv) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.connect_timeout = &tv;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectNonBlock(const char *ip, int port) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.options |= REDIS_OPT_NONBLOCK;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectBindNonBlock(const char *ip, int port,
+                                       const char *source_addr) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.endpoint.tcp.source_addr = source_addr;
+    options.options |= REDIS_OPT_NONBLOCK;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectBindNonBlockWithReuse(const char *ip, int port,
+                                                const char *source_addr) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, ip, port);
+    options.endpoint.tcp.source_addr = source_addr;
+    options.options |= REDIS_OPT_NONBLOCK|REDIS_OPT_REUSEADDR;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectUnix(const char *path) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_UNIX(&options, path);
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectUnixWithTimeout(const char *path, const struct timeval tv) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_UNIX(&options, path);
+    options.connect_timeout = &tv;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectUnixNonBlock(const char *path) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_UNIX(&options, path);
+    options.options |= REDIS_OPT_NONBLOCK;
+    return redisConnectWithOptions(&options);
+}
+
+redisContext *redisConnectFd(redisFD fd) {
+    redisOptions options = {0};
+    options.type = REDIS_CONN_USERFD;
+    options.endpoint.fd = fd;
+    return redisConnectWithOptions(&options);
+}
+
+/* Set read/write timeout on a blocking socket. */
+int redisSetTimeout(redisContext *c, const struct timeval tv) {
+    if (c->flags & REDIS_BLOCK)
+        return redisContextSetTimeout(c,tv);
+    return REDIS_ERR;
+}
+
+/* Enable connection KeepAlive. */
+int redisEnableKeepAlive(redisContext *c) {
+    if (redisKeepAlive(c, REDIS_KEEPALIVE_INTERVAL) != REDIS_OK)
+        return REDIS_ERR;
+    return REDIS_OK;
+}
+
+/* Set a user provided RESP3 PUSH handler and return any old one set. */
+redisPushFn *redisSetPushCallback(redisContext *c, redisPushFn *fn) {
+    redisPushFn *old = c->push_cb;
+    c->push_cb = fn;
+    return old;
+}
+
+/* Use this function to handle a read event on the descriptor. It will try
+ * and read some bytes from the socket and feed them to the reply parser.
+ *
+ * After this function is called, you may use redisGetReplyFromReader to
+ * see if there is a reply available. */
+int redisBufferRead(redisContext *c) {
+    char buf[1024*16];
+    int nread;
+
+    /* Return early when the context has seen an error. */
+    if (c->err)
+        return REDIS_ERR;
+
+    nread = c->funcs->read(c, buf, sizeof(buf));
+    if (nread > 0) {
+        if (redisReaderFeed(c->reader, buf, nread) != REDIS_OK) {
+            __redisSetError(c, c->reader->err, c->reader->errstr);
+            return REDIS_ERR;
+        } else {
+        }
+    } else if (nread < 0) {
+        return REDIS_ERR;
+    }
+    return REDIS_OK;
+}
+
+/* Write the output buffer to the socket.
+ *
+ * Returns REDIS_OK when the buffer is empty, or (a part of) the buffer was
+ * successfully written to the socket. When the buffer is empty after the
+ * write operation, "done" is set to 1 (if given).
+ *
+ * Returns REDIS_ERR if an error occurred trying to write and sets
+ * c->errstr to hold the appropriate error string.
+ */
+int redisBufferWrite(redisContext *c, int *done) {
+
+    /* Return early when the context has seen an error. */
+    if (c->err)
+        return REDIS_ERR;
+
+    if (hi_sdslen(c->obuf) > 0) {
+        ssize_t nwritten = c->funcs->write(c);
+        if (nwritten < 0) {
+            return REDIS_ERR;
+        } else if (nwritten > 0) {
+            if (nwritten == (ssize_t)hi_sdslen(c->obuf)) {
+                hi_sdsfree(c->obuf);
+                c->obuf = hi_sdsempty();
+                if (c->obuf == NULL)
+                    goto oom;
+            } else {
+                if (hi_sdsrange(c->obuf,nwritten,-1) < 0) goto oom;
+            }
+        }
+    }
+    if (done != NULL) *done = (hi_sdslen(c->obuf) == 0);
+    return REDIS_OK;
+
+oom:
+    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+    return REDIS_ERR;
+}
+
+/* Internal helper function to try and get a reply from the reader,
+ * or set an error in the context otherwise. */
+int redisGetReplyFromReader(redisContext *c, void **reply) {
+    if (redisReaderGetReply(c->reader,reply) == REDIS_ERR) {
+        __redisSetError(c,c->reader->err,c->reader->errstr);
+        return REDIS_ERR;
+    }
+
+    return REDIS_OK;
+}
+
+/* Internal helper that returns 1 if the reply was a RESP3 PUSH
+ * message and we handled it with a user-provided callback. */
+static int redisHandledPushReply(redisContext *c, void *reply) {
+    if (reply && c->push_cb && redisIsPushReply(reply)) {
+        c->push_cb(c->privdata, reply);
+        return 1;
+    }
+
+    return 0;
+}
+
+int redisGetReply(redisContext *c, void **reply) {
+    int wdone = 0;
+    void *aux = NULL;
+
+    /* Try to read pending replies */
+    if (redisGetReplyFromReader(c,&aux) == REDIS_ERR)
+        return REDIS_ERR;
+
+    /* For the blocking context, flush output buffer and read reply */
+    if (aux == NULL && c->flags & REDIS_BLOCK) {
+        /* Write until done */
+        do {
+            if (redisBufferWrite(c,&wdone) == REDIS_ERR)
+                return REDIS_ERR;
+        } while (!wdone);
+
+        /* Read until there is a reply */
+        do {
+            if (redisBufferRead(c) == REDIS_ERR)
+                return REDIS_ERR;
+
+            /* We loop here in case the user has specified a RESP3
+             * PUSH handler (e.g. for client tracking). */
+            do {
+                if (redisGetReplyFromReader(c,&aux) == REDIS_ERR)
+                    return REDIS_ERR;
+            } while (redisHandledPushReply(c, aux));
+        } while (aux == NULL);
+    }
+
+    /* Set reply or free it if we were passed NULL */
+    if (reply != NULL) {
+        *reply = aux;
+    } else {
+        freeReplyObject(aux);
+    }
+
+    return REDIS_OK;
+}
+
+
+/* Helper function for the redisAppendCommand* family of functions.
+ *
+ * Write a formatted command to the output buffer. When this family
+ * is used, you need to call redisGetReply yourself to retrieve
+ * the reply (or replies in pub/sub).
+ */
+int __redisAppendCommand(redisContext *c, const char *cmd, size_t len) {
+    hisds newbuf;
+
+    newbuf = hi_sdscatlen(c->obuf,cmd,len);
+    if (newbuf == NULL) {
+        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
+        return REDIS_ERR;
+    }
+
+    c->obuf = newbuf;
+    return REDIS_OK;
+}
+
+int redisAppendFormattedCommand(redisContext *c, const char *cmd, size_t len) {
+
+    if (__redisAppendCommand(c, cmd, len) != REDIS_OK) {
+        return REDIS_ERR;
+    }
+
+    return REDIS_OK;
+}
+
+int redisvAppendCommand(redisContext *c, const char *format, va_list ap) {
+    char *cmd;
+    int len;
+
+    len = redisvFormatCommand(&cmd,format,ap);
+    if (len == -1) {
+        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
+        return REDIS_ERR;
+    } else if (len == -2) {
+        __redisSetError(c,REDIS_ERR_OTHER,"Invalid format string");
+        return REDIS_ERR;
+    }
+
+    if (__redisAppendCommand(c,cmd,len) != REDIS_OK) {
+        hi_free(cmd);
+        return REDIS_ERR;
+    }
+
+    hi_free(cmd);
+    return REDIS_OK;
+}
+
+int redisAppendCommand(redisContext *c, const char *format, ...) {
+    va_list ap;
+    int ret;
+
+    va_start(ap,format);
+    ret = redisvAppendCommand(c,format,ap);
+    va_end(ap);
+    return ret;
+}
+
+int redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen) {
+    hisds cmd;
+    int len;
+
+    len = redisFormatSdsCommandArgv(&cmd,argc,argv,argvlen);
+    if (len == -1) {
+        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
+        return REDIS_ERR;
+    }
+
+    if (__redisAppendCommand(c,cmd,len) != REDIS_OK) {
+        hi_sdsfree(cmd);
+        return REDIS_ERR;
+    }
+
+    hi_sdsfree(cmd);
+    return REDIS_OK;
+}
+
+/* Helper function for the redisCommand* family of functions.
+ *
+ * Write a formatted command to the output buffer. If the given context is
+ * blocking, immediately read the reply into the "reply" pointer. When the
+ * context is non-blocking, the "reply" pointer will not be used and the
+ * command is simply appended to the write buffer.
+ *
+ * Returns the reply when a reply was successfully retrieved. Returns NULL
+ * otherwise. When NULL is returned in a blocking context, the error field
+ * in the context will be set.
+ */
+static void *__redisBlockForReply(redisContext *c) {
+    void *reply;
+
+    if (c->flags & REDIS_BLOCK) {
+        if (redisGetReply(c,&reply) != REDIS_OK)
+            return NULL;
+        return reply;
+    }
+    return NULL;
+}
+
+void *redisvCommand(redisContext *c, const char *format, va_list ap) {
+    if (redisvAppendCommand(c,format,ap) != REDIS_OK)
+        return NULL;
+    return __redisBlockForReply(c);
+}
+
+void *redisCommand(redisContext *c, const char *format, ...) {
+    va_list ap;
+    va_start(ap,format);
+    void *reply = redisvCommand(c,format,ap);
+    va_end(ap);
+    return reply;
+}
+
+void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen) {
+    if (redisAppendCommandArgv(c,argc,argv,argvlen) != REDIS_OK)
+        return NULL;
+    return __redisBlockForReply(c);
+}
diff --git a/redis-stable/deps/hiredis/hiredis.h b/redis-stable/deps/hiredis/hiredis.h
new file mode 100644
index 00000000..b597394d
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis.h
@@ -0,0 +1,336 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
+ *                     Jan-Erik Rediger <janerik at fnordig dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_H
+#define __HIREDIS_H
+#include "read.h"
+#include <stdarg.h> /* for va_list */
+#ifndef _MSC_VER
+#include <sys/time.h> /* for struct timeval */
+#else
+struct timeval; /* forward declaration */
+typedef long long ssize_t;
+#endif
+#include <stdint.h> /* uintXX_t, etc */
+#include "sds.h" /* for hisds */
+#include "alloc.h" /* for allocation wrappers */
+
+#define HIREDIS_MAJOR 1
+#define HIREDIS_MINOR 0
+#define HIREDIS_PATCH 0
+#define HIREDIS_SONAME 1.0.0
+
+/* Connection type can be blocking or non-blocking and is set in the
+ * least significant bit of the flags field in redisContext. */
+#define REDIS_BLOCK 0x1
+
+/* Connection may be disconnected before being free'd. The second bit
+ * in the flags field is set when the context is connected. */
+#define REDIS_CONNECTED 0x2
+
+/* The async API might try to disconnect cleanly and flush the output
+ * buffer and read all subsequent replies before disconnecting.
+ * This flag means no new commands can come in and the connection
+ * should be terminated once all replies have been read. */
+#define REDIS_DISCONNECTING 0x4
+
+/* Flag specific to the async API which means that the context should be clean
+ * up as soon as possible. */
+#define REDIS_FREEING 0x8
+
+/* Flag that is set when an async callback is executed. */
+#define REDIS_IN_CALLBACK 0x10
+
+/* Flag that is set when the async context has one or more subscriptions. */
+#define REDIS_SUBSCRIBED 0x20
+
+/* Flag that is set when monitor mode is active */
+#define REDIS_MONITORING 0x40
+
+/* Flag that is set when we should set SO_REUSEADDR before calling bind() */
+#define REDIS_REUSEADDR 0x80
+
+/**
+ * Flag that indicates the user does not want the context to
+ * be automatically freed upon error
+ */
+#define REDIS_NO_AUTO_FREE 0x200
+
+#define REDIS_KEEPALIVE_INTERVAL 15 /* seconds */
+
+/* number of times we retry to connect in the case of EADDRNOTAVAIL and
+ * SO_REUSEADDR is being used. */
+#define REDIS_CONNECT_RETRIES  10
+
+/* Forward declarations for structs defined elsewhere */
+struct redisAsyncContext;
+struct redisContext;
+
+/* RESP3 push helpers and callback prototypes */
+#define redisIsPushReply(r) (((redisReply*)(r))->type == REDIS_REPLY_PUSH)
+typedef void (redisPushFn)(void *, void *);
+typedef void (redisAsyncPushFn)(struct redisAsyncContext *, void *);
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* This is the reply object returned by redisCommand() */
+typedef struct redisReply {
+    int type; /* REDIS_REPLY_* */
+    long long integer; /* The integer when type is REDIS_REPLY_INTEGER */
+    double dval; /* The double when type is REDIS_REPLY_DOUBLE */
+    size_t len; /* Length of string */
+    char *str; /* Used for REDIS_REPLY_ERROR, REDIS_REPLY_STRING
+                  REDIS_REPLY_VERB, and REDIS_REPLY_DOUBLE (in additional to dval). */
+    char vtype[4]; /* Used for REDIS_REPLY_VERB, contains the null
+                      terminated 3 character content type, such as "txt". */
+    size_t elements; /* number of elements, for REDIS_REPLY_ARRAY */
+    struct redisReply **element; /* elements vector for REDIS_REPLY_ARRAY */
+} redisReply;
+
+redisReader *redisReaderCreate(void);
+
+/* Function to free the reply objects hiredis returns by default. */
+void freeReplyObject(void *reply);
+
+/* Functions to format a command according to the protocol. */
+int redisvFormatCommand(char **target, const char *format, va_list ap);
+int redisFormatCommand(char **target, const char *format, ...);
+int redisFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen);
+int redisFormatSdsCommandArgv(hisds *target, int argc, const char ** argv, const size_t *argvlen);
+void redisFreeCommand(char *cmd);
+void redisFreeSdsCommand(hisds cmd);
+
+enum redisConnectionType {
+    REDIS_CONN_TCP,
+    REDIS_CONN_UNIX,
+    REDIS_CONN_USERFD
+};
+
+struct redisSsl;
+
+#define REDIS_OPT_NONBLOCK 0x01
+#define REDIS_OPT_REUSEADDR 0x02
+
+/**
+ * Don't automatically free the async object on a connection failure,
+ * or other implicit conditions. Only free on an explicit call to disconnect() or free()
+ */
+#define REDIS_OPT_NOAUTOFREE 0x04
+
+/* Don't automatically intercept and free RESP3 PUSH replies. */
+#define REDIS_OPT_NO_PUSH_AUTOFREE 0x08
+
+/* In Unix systems a file descriptor is a regular signed int, with -1
+ * representing an invalid descriptor. In Windows it is a SOCKET
+ * (32- or 64-bit unsigned integer depending on the architecture), where
+ * all bits set (~0) is INVALID_SOCKET.  */
+#ifndef _WIN32
+typedef int redisFD;
+#define REDIS_INVALID_FD -1
+#else
+#ifdef _WIN64
+typedef unsigned long long redisFD; /* SOCKET = 64-bit UINT_PTR */
+#else
+typedef unsigned long redisFD;      /* SOCKET = 32-bit UINT_PTR */
+#endif
+#define REDIS_INVALID_FD ((redisFD)(~0)) /* INVALID_SOCKET */
+#endif
+
+typedef struct {
+    /*
+     * the type of connection to use. This also indicates which
+     * `endpoint` member field to use
+     */
+    int type;
+    /* bit field of REDIS_OPT_xxx */
+    int options;
+    /* timeout value for connect operation. If NULL, no timeout is used */
+    const struct timeval *connect_timeout;
+    /* timeout value for commands. If NULL, no timeout is used.  This can be
+     * updated at runtime with redisSetTimeout/redisAsyncSetTimeout. */
+    const struct timeval *command_timeout;
+    union {
+        /** use this field for tcp/ip connections */
+        struct {
+            const char *source_addr;
+            const char *ip;
+            int port;
+        } tcp;
+        /** use this field for unix domain sockets */
+        const char *unix_socket;
+        /**
+         * use this field to have hiredis operate an already-open
+         * file descriptor */
+        redisFD fd;
+    } endpoint;
+
+    /* Optional user defined data/destructor */
+    void *privdata;
+    void (*free_privdata)(void *);
+
+    /* A user defined PUSH message callback */
+    redisPushFn *push_cb;
+    redisAsyncPushFn *async_push_cb;
+} redisOptions;
+
+/**
+ * Helper macros to initialize options to their specified fields.
+ */
+#define REDIS_OPTIONS_SET_TCP(opts, ip_, port_) \
+    (opts)->type = REDIS_CONN_TCP; \
+    (opts)->endpoint.tcp.ip = ip_; \
+    (opts)->endpoint.tcp.port = port_;
+
+#define REDIS_OPTIONS_SET_UNIX(opts, path) \
+    (opts)->type = REDIS_CONN_UNIX;        \
+    (opts)->endpoint.unix_socket = path;
+
+#define REDIS_OPTIONS_SET_PRIVDATA(opts, data, dtor) \
+    (opts)->privdata = data;                         \
+    (opts)->free_privdata = dtor;                    \
+
+typedef struct redisContextFuncs {
+    void (*free_privctx)(void *);
+    void (*async_read)(struct redisAsyncContext *);
+    void (*async_write)(struct redisAsyncContext *);
+    ssize_t (*read)(struct redisContext *, char *, size_t);
+    ssize_t (*write)(struct redisContext *);
+} redisContextFuncs;
+
+/* Context for a connection to Redis */
+typedef struct redisContext {
+    const redisContextFuncs *funcs;   /* Function table */
+
+    int err; /* Error flags, 0 when there is no error */
+    char errstr[128]; /* String representation of error when applicable */
+    redisFD fd;
+    int flags;
+    char *obuf; /* Write buffer */
+    redisReader *reader; /* Protocol reader */
+
+    enum redisConnectionType connection_type;
+    struct timeval *connect_timeout;
+    struct timeval *command_timeout;
+
+    struct {
+        char *host;
+        char *source_addr;
+        int port;
+    } tcp;
+
+    struct {
+        char *path;
+    } unix_sock;
+
+    /* For non-blocking connect */
+    struct sockadr *saddr;
+    size_t addrlen;
+
+    /* Optional data and corresponding destructor users can use to provide
+     * context to a given redisContext.  Not used by hiredis. */
+    void *privdata;
+    void (*free_privdata)(void *);
+
+    /* Internal context pointer presently used by hiredis to manage
+     * SSL connections. */
+    void *privctx;
+
+    /* An optional RESP3 PUSH handler */
+    redisPushFn *push_cb;
+} redisContext;
+
+redisContext *redisConnectWithOptions(const redisOptions *options);
+redisContext *redisConnect(const char *ip, int port);
+redisContext *redisConnectWithTimeout(const char *ip, int port, const struct timeval tv);
+redisContext *redisConnectNonBlock(const char *ip, int port);
+redisContext *redisConnectBindNonBlock(const char *ip, int port,
+                                       const char *source_addr);
+redisContext *redisConnectBindNonBlockWithReuse(const char *ip, int port,
+                                                const char *source_addr);
+redisContext *redisConnectUnix(const char *path);
+redisContext *redisConnectUnixWithTimeout(const char *path, const struct timeval tv);
+redisContext *redisConnectUnixNonBlock(const char *path);
+redisContext *redisConnectFd(redisFD fd);
+
+/**
+ * Reconnect the given context using the saved information.
+ *
+ * This re-uses the exact same connect options as in the initial connection.
+ * host, ip (or path), timeout and bind address are reused,
+ * flags are used unmodified from the existing context.
+ *
+ * Returns REDIS_OK on successful connect or REDIS_ERR otherwise.
+ */
+int redisReconnect(redisContext *c);
+
+redisPushFn *redisSetPushCallback(redisContext *c, redisPushFn *fn);
+int redisSetTimeout(redisContext *c, const struct timeval tv);
+int redisEnableKeepAlive(redisContext *c);
+void redisFree(redisContext *c);
+redisFD redisFreeKeepFd(redisContext *c);
+int redisBufferRead(redisContext *c);
+int redisBufferWrite(redisContext *c, int *done);
+
+/* In a blocking context, this function first checks if there are unconsumed
+ * replies to return and returns one if so. Otherwise, it flushes the output
+ * buffer to the socket and reads until it has a reply. In a non-blocking
+ * context, it will return unconsumed replies until there are no more. */
+int redisGetReply(redisContext *c, void **reply);
+int redisGetReplyFromReader(redisContext *c, void **reply);
+
+/* Write a formatted command to the output buffer. Use these functions in blocking mode
+ * to get a pipeline of commands. */
+int redisAppendFormattedCommand(redisContext *c, const char *cmd, size_t len);
+
+/* Write a command to the output buffer. Use these functions in blocking mode
+ * to get a pipeline of commands. */
+int redisvAppendCommand(redisContext *c, const char *format, va_list ap);
+int redisAppendCommand(redisContext *c, const char *format, ...);
+int redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
+
+/* Issue a command to Redis. In a blocking context, it is identical to calling
+ * redisAppendCommand, followed by redisGetReply. The function will return
+ * NULL if there was an error in performing the request, otherwise it will
+ * return the reply. In a non-blocking context, it is identical to calling
+ * only redisAppendCommand and will always return NULL. */
+void *redisvCommand(redisContext *c, const char *format, va_list ap);
+void *redisCommand(redisContext *c, const char *format, ...);
+void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/redis-stable/deps/hiredis/hiredis.pc.in b/redis-stable/deps/hiredis/hiredis.pc.in
new file mode 100644
index 00000000..91b77318
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis.pc.in
@@ -0,0 +1,12 @@
+prefix=@CMAKE_INSTALL_PREFIX@
+install_libdir=@CMAKE_INSTALL_LIBDIR@
+exec_prefix=${prefix}
+libdir=${exec_prefix}/${install_libdir}
+includedir=${prefix}/include
+pkgincludedir=${includedir}/hiredis
+
+Name: hiredis
+Description: Minimalistic C client library for Redis.
+Version: @PROJECT_VERSION@
+Libs: -L${libdir} -lhiredis
+Cflags: -I${pkgincludedir} -D_FILE_OFFSET_BITS=64
diff --git a/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in b/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
new file mode 100644
index 00000000..9a283dfc
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
@@ -0,0 +1,13 @@
+@PACKAGE_INIT@
+
+set_and_check(hiredis_ssl_INCLUDEDIR "@PACKAGE_INCLUDE_INSTALL_DIR@")
+
+IF (NOT TARGET hiredis::hiredis_ssl)
+	INCLUDE(${CMAKE_CURRENT_LIST_DIR}/hiredis_ssl-targets.cmake)
+ENDIF()
+
+SET(hiredis_ssl_LIBRARIES hiredis::hiredis_ssl)
+SET(hiredis_ssl_INCLUDE_DIRS ${hiredis_ssl_INCLUDEDIR})
+
+check_required_components(hiredis_ssl)
+
diff --git a/redis-stable/deps/hiredis/hiredis_ssl.h b/redis-stable/deps/hiredis/hiredis_ssl.h
new file mode 100644
index 00000000..604efe0c
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis_ssl.h
@@ -0,0 +1,127 @@
+
+/*
+ * Copyright (c) 2019, Redis Labs
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __HIREDIS_SSL_H
+#define __HIREDIS_SSL_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* This is the underlying struct for SSL in ssl.h, which is not included to
+ * keep build dependencies short here.
+ */
+struct ssl_st;
+
+/* A wrapper around OpenSSL SSL_CTX to allow easy SSL use without directly
+ * calling OpenSSL.
+ */
+typedef struct redisSSLContext redisSSLContext;
+
+/**
+ * Initialization errors that redisCreateSSLContext() may return.
+ */
+
+typedef enum {
+    REDIS_SSL_CTX_NONE = 0,                     /* No Error */
+    REDIS_SSL_CTX_CREATE_FAILED,                /* Failed to create OpenSSL SSL_CTX */
+    REDIS_SSL_CTX_CERT_KEY_REQUIRED,            /* Client cert and key must both be specified or skipped */
+    REDIS_SSL_CTX_CA_CERT_LOAD_FAILED,          /* Failed to load CA Certificate or CA Path */
+    REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED,      /* Failed to load client certificate */
+    REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED       /* Failed to load private key */
+} redisSSLContextError;
+
+/**
+ * Return the error message corresponding with the specified error code.
+ */
+
+const char *redisSSLContextGetError(redisSSLContextError error);
+
+/**
+ * Helper function to initialize the OpenSSL library.
+ *
+ * OpenSSL requires one-time initialization before it can be used. Callers should
+ * call this function only once, and only if OpenSSL is not directly initialized
+ * elsewhere.
+ */
+int redisInitOpenSSL(void);
+
+/**
+ * Helper function to initialize an OpenSSL context that can be used
+ * to initiate SSL connections.
+ *
+ * cacert_filename is an optional name of a CA certificate/bundle file to load
+ * and use for validation.
+ *
+ * capath is an optional directory path where trusted CA certificate files are
+ * stored in an OpenSSL-compatible structure.
+ *
+ * cert_filename and private_key_filename are optional names of a client side
+ * certificate and private key files to use for authentication. They need to
+ * be both specified or omitted.
+ *
+ * server_name is an optional and will be used as a server name indication
+ * (SNI) TLS extension.
+ *
+ * If error is non-null, it will be populated in case the context creation fails
+ * (returning a NULL).
+ */
+
+redisSSLContext *redisCreateSSLContext(const char *cacert_filename, const char *capath,
+        const char *cert_filename, const char *private_key_filename,
+        const char *server_name, redisSSLContextError *error);
+
+/**
+ * Free a previously created OpenSSL context.
+ */
+void redisFreeSSLContext(redisSSLContext *redis_ssl_ctx);
+
+/**
+ * Initiate SSL on an existing redisContext.
+ *
+ * This is similar to redisInitiateSSL() but does not require the caller
+ * to directly interact with OpenSSL, and instead uses a redisSSLContext
+ * previously created using redisCreateSSLContext().
+ */
+
+int redisInitiateSSLWithContext(redisContext *c, redisSSLContext *redis_ssl_ctx);
+
+/**
+ * Initiate SSL/TLS negotiation on a provided OpenSSL SSL object.
+ */
+
+int redisInitiateSSL(redisContext *c, struct ssl_st *ssl);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif  /* __HIREDIS_SSL_H */
diff --git a/redis-stable/deps/hiredis/hiredis_ssl.pc.in b/redis-stable/deps/hiredis/hiredis_ssl.pc.in
new file mode 100644
index 00000000..588a978a
--- /dev/null
+++ b/redis-stable/deps/hiredis/hiredis_ssl.pc.in
@@ -0,0 +1,12 @@
+prefix=@CMAKE_INSTALL_PREFIX@
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+pkgincludedir=${includedir}/hiredis
+
+Name: hiredis_ssl
+Description: SSL Support for hiredis.
+Version: @PROJECT_VERSION@
+Requires: hiredis
+Libs: -L${libdir} -lhiredis_ssl
+Libs.private: -lssl -lcrypto
diff --git a/redis-stable/deps/hiredis/net.c b/redis-stable/deps/hiredis/net.c
new file mode 100644
index 00000000..88f9aff2
--- /dev/null
+++ b/redis-stable/deps/hiredis/net.c
@@ -0,0 +1,612 @@
+/* Extracted from anet.c to work properly with Hiredis error reporting.
+ *
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
+ *                     Jan-Erik Rediger <janerik at fnordig dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include <sys/types.h>
+#include <fcntl.h>
+#include <string.h>
+#include <errno.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <limits.h>
+#include <stdlib.h>
+
+#include "net.h"
+#include "sds.h"
+#include "sockcompat.h"
+#include "win32.h"
+
+/* Defined in hiredis.c */
+void __redisSetError(redisContext *c, int type, const char *str);
+
+void redisNetClose(redisContext *c) {
+    if (c && c->fd != REDIS_INVALID_FD) {
+        close(c->fd);
+        c->fd = REDIS_INVALID_FD;
+    }
+}
+
+ssize_t redisNetRead(redisContext *c, char *buf, size_t bufcap) {
+    ssize_t nread = recv(c->fd, buf, bufcap, 0);
+    if (nread == -1) {
+        if ((errno == EWOULDBLOCK && !(c->flags & REDIS_BLOCK)) || (errno == EINTR)) {
+            /* Try again later */
+            return 0;
+        } else if(errno == ETIMEDOUT && (c->flags & REDIS_BLOCK)) {
+            /* especially in windows */
+            __redisSetError(c, REDIS_ERR_TIMEOUT, "recv timeout");
+            return -1;
+        } else {
+            __redisSetError(c, REDIS_ERR_IO, NULL);
+            return -1;
+        }
+    } else if (nread == 0) {
+        __redisSetError(c, REDIS_ERR_EOF, "Server closed the connection");
+        return -1;
+    } else {
+        return nread;
+    }
+}
+
+ssize_t redisNetWrite(redisContext *c) {
+    ssize_t nwritten = send(c->fd, c->obuf, hi_sdslen(c->obuf), 0);
+    if (nwritten < 0) {
+        if ((errno == EWOULDBLOCK && !(c->flags & REDIS_BLOCK)) || (errno == EINTR)) {
+            /* Try again later */
+        } else {
+            __redisSetError(c, REDIS_ERR_IO, NULL);
+            return -1;
+        }
+    }
+    return nwritten;
+}
+
+static void __redisSetErrorFromErrno(redisContext *c, int type, const char *prefix) {
+    int errorno = errno;  /* snprintf() may change errno */
+    char buf[128] = { 0 };
+    size_t len = 0;
+
+    if (prefix != NULL)
+        len = snprintf(buf,sizeof(buf),"%s: ",prefix);
+    strerror_r(errorno, (char *)(buf + len), sizeof(buf) - len);
+    __redisSetError(c,type,buf);
+}
+
+static int redisSetReuseAddr(redisContext *c) {
+    int on = 1;
+    if (setsockopt(c->fd, SOL_SOCKET, SO_REUSEADDR, &on, sizeof(on)) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
+        redisNetClose(c);
+        return REDIS_ERR;
+    }
+    return REDIS_OK;
+}
+
+static int redisCreateSocket(redisContext *c, int type) {
+    redisFD s;
+    if ((s = socket(type, SOCK_STREAM, 0)) == REDIS_INVALID_FD) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
+        return REDIS_ERR;
+    }
+    c->fd = s;
+    if (type == AF_INET) {
+        if (redisSetReuseAddr(c) == REDIS_ERR) {
+            return REDIS_ERR;
+        }
+    }
+    return REDIS_OK;
+}
+
+static int redisSetBlocking(redisContext *c, int blocking) {
+#ifndef _WIN32
+    int flags;
+
+    /* Set the socket nonblocking.
+     * Note that fcntl(2) for F_GETFL and F_SETFL can't be
+     * interrupted by a signal. */
+    if ((flags = fcntl(c->fd, F_GETFL)) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"fcntl(F_GETFL)");
+        redisNetClose(c);
+        return REDIS_ERR;
+    }
+
+    if (blocking)
+        flags &= ~O_NONBLOCK;
+    else
+        flags |= O_NONBLOCK;
+
+    if (fcntl(c->fd, F_SETFL, flags) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"fcntl(F_SETFL)");
+        redisNetClose(c);
+        return REDIS_ERR;
+    }
+#else
+    u_long mode = blocking ? 0 : 1;
+    if (ioctl(c->fd, FIONBIO, &mode) == -1) {
+        __redisSetErrorFromErrno(c, REDIS_ERR_IO, "ioctl(FIONBIO)");
+        redisNetClose(c);
+        return REDIS_ERR;
+    }
+#endif /* _WIN32 */
+    return REDIS_OK;
+}
+
+int redisKeepAlive(redisContext *c, int interval) {
+    int val = 1;
+    redisFD fd = c->fd;
+
+    if (setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &val, sizeof(val)) == -1){
+        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
+        return REDIS_ERR;
+    }
+
+    val = interval;
+
+#if defined(__APPLE__) && defined(__MACH__)
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPALIVE, &val, sizeof(val)) < 0) {
+        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
+        return REDIS_ERR;
+    }
+#else
+#if defined(__GLIBC__) && !defined(__FreeBSD_kernel__)
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPIDLE, &val, sizeof(val)) < 0) {
+        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
+        return REDIS_ERR;
+    }
+
+    val = interval/3;
+    if (val == 0) val = 1;
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPINTVL, &val, sizeof(val)) < 0) {
+        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
+        return REDIS_ERR;
+    }
+
+    val = 3;
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPCNT, &val, sizeof(val)) < 0) {
+        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
+        return REDIS_ERR;
+    }
+#endif
+#endif
+
+    return REDIS_OK;
+}
+
+int redisSetTcpNoDelay(redisContext *c) {
+    int yes = 1;
+    if (setsockopt(c->fd, IPPROTO_TCP, TCP_NODELAY, &yes, sizeof(yes)) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(TCP_NODELAY)");
+        redisNetClose(c);
+        return REDIS_ERR;
+    }
+    return REDIS_OK;
+}
+
+#define __MAX_MSEC (((LONG_MAX) - 999) / 1000)
+
+static int redisContextTimeoutMsec(redisContext *c, long *result)
+{
+    const struct timeval *timeout = c->connect_timeout;
+    long msec = -1;
+
+    /* Only use timeout when not NULL. */
+    if (timeout != NULL) {
+        if (timeout->tv_usec > 1000000 || timeout->tv_sec > __MAX_MSEC) {
+            *result = msec;
+            return REDIS_ERR;
+        }
+
+        msec = (timeout->tv_sec * 1000) + ((timeout->tv_usec + 999) / 1000);
+
+        if (msec < 0 || msec > INT_MAX) {
+            msec = INT_MAX;
+        }
+    }
+
+    *result = msec;
+    return REDIS_OK;
+}
+
+static int redisContextWaitReady(redisContext *c, long msec) {
+    struct pollfd   wfd[1];
+
+    wfd[0].fd     = c->fd;
+    wfd[0].events = POLLOUT;
+
+    if (errno == EINPROGRESS) {
+        int res;
+
+        if ((res = poll(wfd, 1, msec)) == -1) {
+            __redisSetErrorFromErrno(c, REDIS_ERR_IO, "poll(2)");
+            redisNetClose(c);
+            return REDIS_ERR;
+        } else if (res == 0) {
+            errno = ETIMEDOUT;
+            __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
+            redisNetClose(c);
+            return REDIS_ERR;
+        }
+
+        if (redisCheckConnectDone(c, &res) != REDIS_OK || res == 0) {
+            redisCheckSocketError(c);
+            return REDIS_ERR;
+        }
+
+        return REDIS_OK;
+    }
+
+    __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
+    redisNetClose(c);
+    return REDIS_ERR;
+}
+
+int redisCheckConnectDone(redisContext *c, int *completed) {
+    int rc = connect(c->fd, (const struct sockaddr *)c->saddr, c->addrlen);
+    if (rc == 0) {
+        *completed = 1;
+        return REDIS_OK;
+    }
+    switch (errno) {
+    case EISCONN:
+        *completed = 1;
+        return REDIS_OK;
+    case EALREADY:
+    case EINPROGRESS:
+    case EWOULDBLOCK:
+        *completed = 0;
+        return REDIS_OK;
+    default:
+        return REDIS_ERR;
+    }
+}
+
+int redisCheckSocketError(redisContext *c) {
+    int err = 0, errno_saved = errno;
+    socklen_t errlen = sizeof(err);
+
+    if (getsockopt(c->fd, SOL_SOCKET, SO_ERROR, &err, &errlen) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"getsockopt(SO_ERROR)");
+        return REDIS_ERR;
+    }
+
+    if (err == 0) {
+        err = errno_saved;
+    }
+
+    if (err) {
+        errno = err;
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
+        return REDIS_ERR;
+    }
+
+    return REDIS_OK;
+}
+
+int redisContextSetTimeout(redisContext *c, const struct timeval tv) {
+    const void *to_ptr = &tv;
+    size_t to_sz = sizeof(tv);
+
+    if (setsockopt(c->fd,SOL_SOCKET,SO_RCVTIMEO,to_ptr,to_sz) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(SO_RCVTIMEO)");
+        return REDIS_ERR;
+    }
+    if (setsockopt(c->fd,SOL_SOCKET,SO_SNDTIMEO,to_ptr,to_sz) == -1) {
+        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(SO_SNDTIMEO)");
+        return REDIS_ERR;
+    }
+    return REDIS_OK;
+}
+
+int redisContextUpdateConnectTimeout(redisContext *c, const struct timeval *timeout) {
+    /* Same timeval struct, short circuit */
+    if (c->connect_timeout == timeout)
+        return REDIS_OK;
+
+    /* Allocate context timeval if we need to */
+    if (c->connect_timeout == NULL) {
+        c->connect_timeout = hi_malloc(sizeof(*c->connect_timeout));
+        if (c->connect_timeout == NULL)
+            return REDIS_ERR;
+    }
+
+    memcpy(c->connect_timeout, timeout, sizeof(*c->connect_timeout));
+    return REDIS_OK;
+}
+
+int redisContextUpdateCommandTimeout(redisContext *c, const struct timeval *timeout) {
+    /* Same timeval struct, short circuit */
+    if (c->command_timeout == timeout)
+        return REDIS_OK;
+
+    /* Allocate context timeval if we need to */
+    if (c->command_timeout == NULL) {
+        c->command_timeout = hi_malloc(sizeof(*c->command_timeout));
+        if (c->command_timeout == NULL)
+            return REDIS_ERR;
+    }
+
+    memcpy(c->command_timeout, timeout, sizeof(*c->command_timeout));
+    return REDIS_OK;
+}
+
+static int _redisContextConnectTcp(redisContext *c, const char *addr, int port,
+                                   const struct timeval *timeout,
+                                   const char *source_addr) {
+    redisFD s;
+    int rv, n;
+    char _port[6];  /* strlen("65535"); */
+    struct addrinfo hints, *servinfo, *bservinfo, *p, *b;
+    int blocking = (c->flags & REDIS_BLOCK);
+    int reuseaddr = (c->flags & REDIS_REUSEADDR);
+    int reuses = 0;
+    long timeout_msec = -1;
+
+    servinfo = NULL;
+    c->connection_type = REDIS_CONN_TCP;
+    c->tcp.port = port;
+
+    /* We need to take possession of the passed parameters
+     * to make them reusable for a reconnect.
+     * We also carefully check we don't free data we already own,
+     * as in the case of the reconnect method.
+     *
+     * This is a bit ugly, but atleast it works and doesn't leak memory.
+     **/
+    if (c->tcp.host != addr) {
+        hi_free(c->tcp.host);
+
+        c->tcp.host = hi_strdup(addr);
+        if (c->tcp.host == NULL)
+            goto oom;
+    }
+
+    if (timeout) {
+        if (redisContextUpdateConnectTimeout(c, timeout) == REDIS_ERR)
+            goto oom;
+    } else {
+        hi_free(c->connect_timeout);
+        c->connect_timeout = NULL;
+    }
+
+    if (redisContextTimeoutMsec(c, &timeout_msec) != REDIS_OK) {
+        __redisSetError(c, REDIS_ERR_IO, "Invalid timeout specified");
+        goto error;
+    }
+
+    if (source_addr == NULL) {
+        hi_free(c->tcp.source_addr);
+        c->tcp.source_addr = NULL;
+    } else if (c->tcp.source_addr != source_addr) {
+        hi_free(c->tcp.source_addr);
+        c->tcp.source_addr = hi_strdup(source_addr);
+    }
+
+    snprintf(_port, 6, "%d", port);
+    memset(&hints,0,sizeof(hints));
+    hints.ai_family = AF_INET;
+    hints.ai_socktype = SOCK_STREAM;
+
+    /* Try with IPv6 if no IPv4 address was found. We do it in this order since
+     * in a Redis client you can't afford to test if you have IPv6 connectivity
+     * as this would add latency to every connect. Otherwise a more sensible
+     * route could be: Use IPv6 if both addresses are available and there is IPv6
+     * connectivity. */
+    if ((rv = getaddrinfo(c->tcp.host,_port,&hints,&servinfo)) != 0) {
+         hints.ai_family = AF_INET6;
+         if ((rv = getaddrinfo(addr,_port,&hints,&servinfo)) != 0) {
+            __redisSetError(c,REDIS_ERR_OTHER,gai_strerror(rv));
+            return REDIS_ERR;
+        }
+    }
+    for (p = servinfo; p != NULL; p = p->ai_next) {
+addrretry:
+        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == REDIS_INVALID_FD)
+            continue;
+
+        c->fd = s;
+        if (redisSetBlocking(c,0) != REDIS_OK)
+            goto error;
+        if (c->tcp.source_addr) {
+            int bound = 0;
+            /* Using getaddrinfo saves us from self-determining IPv4 vs IPv6 */
+            if ((rv = getaddrinfo(c->tcp.source_addr, NULL, &hints, &bservinfo)) != 0) {
+                char buf[128];
+                snprintf(buf,sizeof(buf),"Can't get addr: %s",gai_strerror(rv));
+                __redisSetError(c,REDIS_ERR_OTHER,buf);
+                goto error;
+            }
+
+            if (reuseaddr) {
+                n = 1;
+                if (setsockopt(s, SOL_SOCKET, SO_REUSEADDR, (char*) &n,
+                               sizeof(n)) < 0) {
+                    freeaddrinfo(bservinfo);
+                    goto error;
+                }
+            }
+
+            for (b = bservinfo; b != NULL; b = b->ai_next) {
+                if (bind(s,b->ai_addr,b->ai_addrlen) != -1) {
+                    bound = 1;
+                    break;
+                }
+            }
+            freeaddrinfo(bservinfo);
+            if (!bound) {
+                char buf[128];
+                snprintf(buf,sizeof(buf),"Can't bind socket: %s",strerror(errno));
+                __redisSetError(c,REDIS_ERR_OTHER,buf);
+                goto error;
+            }
+        }
+
+        /* For repeat connection */
+        hi_free(c->saddr);
+        c->saddr = hi_malloc(p->ai_addrlen);
+        if (c->saddr == NULL)
+            goto oom;
+
+        memcpy(c->saddr, p->ai_addr, p->ai_addrlen);
+        c->addrlen = p->ai_addrlen;
+
+        if (connect(s,p->ai_addr,p->ai_addrlen) == -1) {
+            if (errno == EHOSTUNREACH) {
+                redisNetClose(c);
+                continue;
+            } else if (errno == EINPROGRESS) {
+                if (blocking) {
+                    goto wait_for_ready;
+                }
+                /* This is ok.
+                 * Note that even when it's in blocking mode, we unset blocking
+                 * for `connect()`
+                 */
+            } else if (errno == EADDRNOTAVAIL && reuseaddr) {
+                if (++reuses >= REDIS_CONNECT_RETRIES) {
+                    goto error;
+                } else {
+                    redisNetClose(c);
+                    goto addrretry;
+                }
+            } else {
+                wait_for_ready:
+                if (redisContextWaitReady(c,timeout_msec) != REDIS_OK)
+                    goto error;
+                if (redisSetTcpNoDelay(c) != REDIS_OK)
+                    goto error;
+            }
+        }
+        if (blocking && redisSetBlocking(c,1) != REDIS_OK)
+            goto error;
+
+        c->flags |= REDIS_CONNECTED;
+        rv = REDIS_OK;
+        goto end;
+    }
+    if (p == NULL) {
+        char buf[128];
+        snprintf(buf,sizeof(buf),"Can't create socket: %s",strerror(errno));
+        __redisSetError(c,REDIS_ERR_OTHER,buf);
+        goto error;
+    }
+
+oom:
+    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+error:
+    rv = REDIS_ERR;
+end:
+    if(servinfo) {
+        freeaddrinfo(servinfo);
+    }
+
+    return rv;  // Need to return REDIS_OK if alright
+}
+
+int redisContextConnectTcp(redisContext *c, const char *addr, int port,
+                           const struct timeval *timeout) {
+    return _redisContextConnectTcp(c, addr, port, timeout, NULL);
+}
+
+int redisContextConnectBindTcp(redisContext *c, const char *addr, int port,
+                               const struct timeval *timeout,
+                               const char *source_addr) {
+    return _redisContextConnectTcp(c, addr, port, timeout, source_addr);
+}
+
+int redisContextConnectUnix(redisContext *c, const char *path, const struct timeval *timeout) {
+#ifndef _WIN32
+    int blocking = (c->flags & REDIS_BLOCK);
+    struct sockaddr_un *sa;
+    long timeout_msec = -1;
+
+    if (redisCreateSocket(c,AF_UNIX) < 0)
+        return REDIS_ERR;
+    if (redisSetBlocking(c,0) != REDIS_OK)
+        return REDIS_ERR;
+
+    c->connection_type = REDIS_CONN_UNIX;
+    if (c->unix_sock.path != path) {
+        hi_free(c->unix_sock.path);
+
+        c->unix_sock.path = hi_strdup(path);
+        if (c->unix_sock.path == NULL)
+            goto oom;
+    }
+
+    if (timeout) {
+        if (redisContextUpdateConnectTimeout(c, timeout) == REDIS_ERR)
+            goto oom;
+    } else {
+        hi_free(c->connect_timeout);
+        c->connect_timeout = NULL;
+    }
+
+    if (redisContextTimeoutMsec(c,&timeout_msec) != REDIS_OK)
+        return REDIS_ERR;
+
+    /* Don't leak sockaddr if we're reconnecting */
+    if (c->saddr) hi_free(c->saddr);
+
+    sa = (struct sockaddr_un*)(c->saddr = hi_malloc(sizeof(struct sockaddr_un)));
+    if (sa == NULL)
+        goto oom;
+
+    c->addrlen = sizeof(struct sockaddr_un);
+    sa->sun_family = AF_UNIX;
+    strncpy(sa->sun_path, path, sizeof(sa->sun_path) - 1);
+    if (connect(c->fd, (struct sockaddr*)sa, sizeof(*sa)) == -1) {
+        if (errno == EINPROGRESS && !blocking) {
+            /* This is ok. */
+        } else {
+            if (redisContextWaitReady(c,timeout_msec) != REDIS_OK)
+                return REDIS_ERR;
+        }
+    }
+
+    /* Reset socket to be blocking after connect(2). */
+    if (blocking && redisSetBlocking(c,1) != REDIS_OK)
+        return REDIS_ERR;
+
+    c->flags |= REDIS_CONNECTED;
+    return REDIS_OK;
+#else
+    /* We currently do not support Unix sockets for Windows. */
+    /* TODO(m): https://devblogs.microsoft.com/commandline/af_unix-comes-to-windows/ */
+    errno = EPROTONOSUPPORT;
+    return REDIS_ERR;
+#endif /* _WIN32 */
+oom:
+    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+    return REDIS_ERR;
+}
diff --git a/redis-stable/deps/hiredis/net.h b/redis-stable/deps/hiredis/net.h
new file mode 100644
index 00000000..9f43283a
--- /dev/null
+++ b/redis-stable/deps/hiredis/net.h
@@ -0,0 +1,56 @@
+/* Extracted from anet.c to work properly with Hiredis error reporting.
+ *
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
+ *                     Jan-Erik Rediger <janerik at fnordig dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __NET_H
+#define __NET_H
+
+#include "hiredis.h"
+
+void redisNetClose(redisContext *c);
+ssize_t redisNetRead(redisContext *c, char *buf, size_t bufcap);
+ssize_t redisNetWrite(redisContext *c);
+
+int redisCheckSocketError(redisContext *c);
+int redisContextSetTimeout(redisContext *c, const struct timeval tv);
+int redisContextConnectTcp(redisContext *c, const char *addr, int port, const struct timeval *timeout);
+int redisContextConnectBindTcp(redisContext *c, const char *addr, int port,
+                               const struct timeval *timeout,
+                               const char *source_addr);
+int redisContextConnectUnix(redisContext *c, const char *path, const struct timeval *timeout);
+int redisKeepAlive(redisContext *c, int interval);
+int redisCheckConnectDone(redisContext *c, int *completed);
+
+int redisSetTcpNoDelay(redisContext *c);
+
+#endif
diff --git a/redis-stable/deps/hiredis/read.c b/redis-stable/deps/hiredis/read.c
new file mode 100644
index 00000000..682b9a6b
--- /dev/null
+++ b/redis-stable/deps/hiredis/read.c
@@ -0,0 +1,739 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include <string.h>
+#include <stdlib.h>
+#ifndef _MSC_VER
+#include <unistd.h>
+#include <strings.h>
+#endif
+#include <assert.h>
+#include <errno.h>
+#include <ctype.h>
+#include <limits.h>
+#include <math.h>
+
+#include "alloc.h"
+#include "read.h"
+#include "sds.h"
+#include "win32.h"
+
+/* Initial size of our nested reply stack and how much we grow it when needd */
+#define REDIS_READER_STACK_SIZE 9
+
+static void __redisReaderSetError(redisReader *r, int type, const char *str) {
+    size_t len;
+
+    if (r->reply != NULL && r->fn && r->fn->freeObject) {
+        r->fn->freeObject(r->reply);
+        r->reply = NULL;
+    }
+
+    /* Clear input buffer on errors. */
+    hi_sdsfree(r->buf);
+    r->buf = NULL;
+    r->pos = r->len = 0;
+
+    /* Reset task stack. */
+    r->ridx = -1;
+
+    /* Set error. */
+    r->err = type;
+    len = strlen(str);
+    len = len < (sizeof(r->errstr)-1) ? len : (sizeof(r->errstr)-1);
+    memcpy(r->errstr,str,len);
+    r->errstr[len] = '\0';
+}
+
+static size_t chrtos(char *buf, size_t size, char byte) {
+    size_t len = 0;
+
+    switch(byte) {
+    case '\\':
+    case '"':
+        len = snprintf(buf,size,"\"\\%c\"",byte);
+        break;
+    case '\n': len = snprintf(buf,size,"\"\\n\""); break;
+    case '\r': len = snprintf(buf,size,"\"\\r\""); break;
+    case '\t': len = snprintf(buf,size,"\"\\t\""); break;
+    case '\a': len = snprintf(buf,size,"\"\\a\""); break;
+    case '\b': len = snprintf(buf,size,"\"\\b\""); break;
+    default:
+        if (isprint(byte))
+            len = snprintf(buf,size,"\"%c\"",byte);
+        else
+            len = snprintf(buf,size,"\"\\x%02x\"",(unsigned char)byte);
+        break;
+    }
+
+    return len;
+}
+
+static void __redisReaderSetErrorProtocolByte(redisReader *r, char byte) {
+    char cbuf[8], sbuf[128];
+
+    chrtos(cbuf,sizeof(cbuf),byte);
+    snprintf(sbuf,sizeof(sbuf),
+        "Protocol error, got %s as reply type byte", cbuf);
+    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,sbuf);
+}
+
+static void __redisReaderSetErrorOOM(redisReader *r) {
+    __redisReaderSetError(r,REDIS_ERR_OOM,"Out of memory");
+}
+
+static char *readBytes(redisReader *r, unsigned int bytes) {
+    char *p;
+    if (r->len-r->pos >= bytes) {
+        p = r->buf+r->pos;
+        r->pos += bytes;
+        return p;
+    }
+    return NULL;
+}
+
+/* Find pointer to \r\n. */
+static char *seekNewline(char *s, size_t len) {
+    int pos = 0;
+    int _len = len-1;
+
+    /* Position should be < len-1 because the character at "pos" should be
+     * followed by a \n. Note that strchr cannot be used because it doesn't
+     * allow to search a limited length and the buffer that is being searched
+     * might not have a trailing NULL character. */
+    while (pos < _len) {
+        while(pos < _len && s[pos] != '\r') pos++;
+        if (pos==_len) {
+            /* Not found. */
+            return NULL;
+        } else {
+            if (s[pos+1] == '\n') {
+                /* Found. */
+                return s+pos;
+            } else {
+                /* Continue searching. */
+                pos++;
+            }
+        }
+    }
+    return NULL;
+}
+
+/* Convert a string into a long long. Returns REDIS_OK if the string could be
+ * parsed into a (non-overflowing) long long, REDIS_ERR otherwise. The value
+ * will be set to the parsed value when appropriate.
+ *
+ * Note that this function demands that the string strictly represents
+ * a long long: no spaces or other characters before or after the string
+ * representing the number are accepted, nor zeroes at the start if not
+ * for the string "0" representing the zero number.
+ *
+ * Because of its strictness, it is safe to use this function to check if
+ * you can convert a string into a long long, and obtain back the string
+ * from the number without any loss in the string representation. */
+static int string2ll(const char *s, size_t slen, long long *value) {
+    const char *p = s;
+    size_t plen = 0;
+    int negative = 0;
+    unsigned long long v;
+
+    if (plen == slen)
+        return REDIS_ERR;
+
+    /* Special case: first and only digit is 0. */
+    if (slen == 1 && p[0] == '0') {
+        if (value != NULL) *value = 0;
+        return REDIS_OK;
+    }
+
+    if (p[0] == '-') {
+        negative = 1;
+        p++; plen++;
+
+        /* Abort on only a negative sign. */
+        if (plen == slen)
+            return REDIS_ERR;
+    }
+
+    /* First digit should be 1-9, otherwise the string should just be 0. */
+    if (p[0] >= '1' && p[0] <= '9') {
+        v = p[0]-'0';
+        p++; plen++;
+    } else if (p[0] == '0' && slen == 1) {
+        *value = 0;
+        return REDIS_OK;
+    } else {
+        return REDIS_ERR;
+    }
+
+    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
+        if (v > (ULLONG_MAX / 10)) /* Overflow. */
+            return REDIS_ERR;
+        v *= 10;
+
+        if (v > (ULLONG_MAX - (p[0]-'0'))) /* Overflow. */
+            return REDIS_ERR;
+        v += p[0]-'0';
+
+        p++; plen++;
+    }
+
+    /* Return if not all bytes were used. */
+    if (plen < slen)
+        return REDIS_ERR;
+
+    if (negative) {
+        if (v > ((unsigned long long)(-(LLONG_MIN+1))+1)) /* Overflow. */
+            return REDIS_ERR;
+        if (value != NULL) *value = -v;
+    } else {
+        if (v > LLONG_MAX) /* Overflow. */
+            return REDIS_ERR;
+        if (value != NULL) *value = v;
+    }
+    return REDIS_OK;
+}
+
+static char *readLine(redisReader *r, int *_len) {
+    char *p, *s;
+    int len;
+
+    p = r->buf+r->pos;
+    s = seekNewline(p,(r->len-r->pos));
+    if (s != NULL) {
+        len = s-(r->buf+r->pos);
+        r->pos += len+2; /* skip \r\n */
+        if (_len) *_len = len;
+        return p;
+    }
+    return NULL;
+}
+
+static void moveToNextTask(redisReader *r) {
+    redisReadTask *cur, *prv;
+    while (r->ridx >= 0) {
+        /* Return a.s.a.p. when the stack is now empty. */
+        if (r->ridx == 0) {
+            r->ridx--;
+            return;
+        }
+
+        cur = r->task[r->ridx];
+        prv = r->task[r->ridx-1];
+        assert(prv->type == REDIS_REPLY_ARRAY ||
+               prv->type == REDIS_REPLY_MAP ||
+               prv->type == REDIS_REPLY_SET ||
+               prv->type == REDIS_REPLY_PUSH);
+        if (cur->idx == prv->elements-1) {
+            r->ridx--;
+        } else {
+            /* Reset the type because the next item can be anything */
+            assert(cur->idx < prv->elements);
+            cur->type = -1;
+            cur->elements = -1;
+            cur->idx++;
+            return;
+        }
+    }
+}
+
+static int processLineItem(redisReader *r) {
+    redisReadTask *cur = r->task[r->ridx];
+    void *obj;
+    char *p;
+    int len;
+
+    if ((p = readLine(r,&len)) != NULL) {
+        if (cur->type == REDIS_REPLY_INTEGER) {
+            if (r->fn && r->fn->createInteger) {
+                long long v;
+                if (string2ll(p, len, &v) == REDIS_ERR) {
+                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                            "Bad integer value");
+                    return REDIS_ERR;
+                }
+                obj = r->fn->createInteger(cur,v);
+            } else {
+                obj = (void*)REDIS_REPLY_INTEGER;
+            }
+        } else if (cur->type == REDIS_REPLY_DOUBLE) {
+            if (r->fn && r->fn->createDouble) {
+                char buf[326], *eptr;
+                double d;
+
+                if ((size_t)len >= sizeof(buf)) {
+                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                            "Double value is too large");
+                    return REDIS_ERR;
+                }
+
+                memcpy(buf,p,len);
+                buf[len] = '\0';
+
+                if (strcasecmp(buf,",inf") == 0) {
+                    d = INFINITY; /* Positive infinite. */
+                } else if (strcasecmp(buf,",-inf") == 0) {
+                    d = -INFINITY; /* Negative infinite. */
+                } else {
+                    d = strtod((char*)buf,&eptr);
+                    if (buf[0] == '\0' || eptr[0] != '\0' || isnan(d)) {
+                        __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                                "Bad double value");
+                        return REDIS_ERR;
+                    }
+                }
+                obj = r->fn->createDouble(cur,d,buf,len);
+            } else {
+                obj = (void*)REDIS_REPLY_DOUBLE;
+            }
+        } else if (cur->type == REDIS_REPLY_NIL) {
+            if (r->fn && r->fn->createNil)
+                obj = r->fn->createNil(cur);
+            else
+                obj = (void*)REDIS_REPLY_NIL;
+        } else if (cur->type == REDIS_REPLY_BOOL) {
+            int bval = p[0] == 't' || p[0] == 'T';
+            if (r->fn && r->fn->createBool)
+                obj = r->fn->createBool(cur,bval);
+            else
+                obj = (void*)REDIS_REPLY_BOOL;
+        } else {
+            /* Type will be error or status. */
+            if (r->fn && r->fn->createString)
+                obj = r->fn->createString(cur,p,len);
+            else
+                obj = (void*)(size_t)(cur->type);
+        }
+
+        if (obj == NULL) {
+            __redisReaderSetErrorOOM(r);
+            return REDIS_ERR;
+        }
+
+        /* Set reply if this is the root object. */
+        if (r->ridx == 0) r->reply = obj;
+        moveToNextTask(r);
+        return REDIS_OK;
+    }
+
+    return REDIS_ERR;
+}
+
+static int processBulkItem(redisReader *r) {
+    redisReadTask *cur = r->task[r->ridx];
+    void *obj = NULL;
+    char *p, *s;
+    long long len;
+    unsigned long bytelen;
+    int success = 0;
+
+    p = r->buf+r->pos;
+    s = seekNewline(p,r->len-r->pos);
+    if (s != NULL) {
+        p = r->buf+r->pos;
+        bytelen = s-(r->buf+r->pos)+2; /* include \r\n */
+
+        if (string2ll(p, bytelen - 2, &len) == REDIS_ERR) {
+            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                    "Bad bulk string length");
+            return REDIS_ERR;
+        }
+
+        if (len < -1 || (LLONG_MAX > SIZE_MAX && len > (long long)SIZE_MAX)) {
+            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                    "Bulk string length out of range");
+            return REDIS_ERR;
+        }
+
+        if (len == -1) {
+            /* The nil object can always be created. */
+            if (r->fn && r->fn->createNil)
+                obj = r->fn->createNil(cur);
+            else
+                obj = (void*)REDIS_REPLY_NIL;
+            success = 1;
+        } else {
+            /* Only continue when the buffer contains the entire bulk item. */
+            bytelen += len+2; /* include \r\n */
+            if (r->pos+bytelen <= r->len) {
+                if ((cur->type == REDIS_REPLY_VERB && len < 4) ||
+                    (cur->type == REDIS_REPLY_VERB && s[5] != ':'))
+                {
+                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                            "Verbatim string 4 bytes of content type are "
+                            "missing or incorrectly encoded.");
+                    return REDIS_ERR;
+                }
+                if (r->fn && r->fn->createString)
+                    obj = r->fn->createString(cur,s+2,len);
+                else
+                    obj = (void*)(long)cur->type;
+                success = 1;
+            }
+        }
+
+        /* Proceed when obj was created. */
+        if (success) {
+            if (obj == NULL) {
+                __redisReaderSetErrorOOM(r);
+                return REDIS_ERR;
+            }
+
+            r->pos += bytelen;
+
+            /* Set reply if this is the root object. */
+            if (r->ridx == 0) r->reply = obj;
+            moveToNextTask(r);
+            return REDIS_OK;
+        }
+    }
+
+    return REDIS_ERR;
+}
+
+static int redisReaderGrow(redisReader *r) {
+    redisReadTask **aux;
+    int newlen;
+
+    /* Grow our stack size */
+    newlen = r->tasks + REDIS_READER_STACK_SIZE;
+    aux = hi_realloc(r->task, sizeof(*r->task) * newlen);
+    if (aux == NULL)
+        goto oom;
+
+    r->task = aux;
+
+    /* Allocate new tasks */
+    for (; r->tasks < newlen; r->tasks++) {
+        r->task[r->tasks] = hi_calloc(1, sizeof(**r->task));
+        if (r->task[r->tasks] == NULL)
+            goto oom;
+    }
+
+    return REDIS_OK;
+oom:
+    __redisReaderSetErrorOOM(r);
+    return REDIS_ERR;
+}
+
+/* Process the array, map and set types. */
+static int processAggregateItem(redisReader *r) {
+    redisReadTask *cur = r->task[r->ridx];
+    void *obj;
+    char *p;
+    long long elements;
+    int root = 0, len;
+
+    /* Set error for nested multi bulks with depth > 7 */
+    if (r->ridx == r->tasks - 1) {
+        if (redisReaderGrow(r) == REDIS_ERR)
+            return REDIS_ERR;
+    }
+
+    if ((p = readLine(r,&len)) != NULL) {
+        if (string2ll(p, len, &elements) == REDIS_ERR) {
+            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                    "Bad multi-bulk length");
+            return REDIS_ERR;
+        }
+
+        root = (r->ridx == 0);
+
+        if (elements < -1 || (LLONG_MAX > SIZE_MAX && elements > SIZE_MAX) ||
+            (r->maxelements > 0 && elements > r->maxelements))
+        {
+            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
+                    "Multi-bulk length out of range");
+            return REDIS_ERR;
+        }
+
+        if (elements == -1) {
+            if (r->fn && r->fn->createNil)
+                obj = r->fn->createNil(cur);
+            else
+                obj = (void*)REDIS_REPLY_NIL;
+
+            if (obj == NULL) {
+                __redisReaderSetErrorOOM(r);
+                return REDIS_ERR;
+            }
+
+            moveToNextTask(r);
+        } else {
+            if (cur->type == REDIS_REPLY_MAP) elements *= 2;
+
+            if (r->fn && r->fn->createArray)
+                obj = r->fn->createArray(cur,elements);
+            else
+                obj = (void*)(long)cur->type;
+
+            if (obj == NULL) {
+                __redisReaderSetErrorOOM(r);
+                return REDIS_ERR;
+            }
+
+            /* Modify task stack when there are more than 0 elements. */
+            if (elements > 0) {
+                cur->elements = elements;
+                cur->obj = obj;
+                r->ridx++;
+                r->task[r->ridx]->type = -1;
+                r->task[r->ridx]->elements = -1;
+                r->task[r->ridx]->idx = 0;
+                r->task[r->ridx]->obj = NULL;
+                r->task[r->ridx]->parent = cur;
+                r->task[r->ridx]->privdata = r->privdata;
+            } else {
+                moveToNextTask(r);
+            }
+        }
+
+        /* Set reply if this is the root object. */
+        if (root) r->reply = obj;
+        return REDIS_OK;
+    }
+
+    return REDIS_ERR;
+}
+
+static int processItem(redisReader *r) {
+    redisReadTask *cur = r->task[r->ridx];
+    char *p;
+
+    /* check if we need to read type */
+    if (cur->type < 0) {
+        if ((p = readBytes(r,1)) != NULL) {
+            switch (p[0]) {
+            case '-':
+                cur->type = REDIS_REPLY_ERROR;
+                break;
+            case '+':
+                cur->type = REDIS_REPLY_STATUS;
+                break;
+            case ':':
+                cur->type = REDIS_REPLY_INTEGER;
+                break;
+            case ',':
+                cur->type = REDIS_REPLY_DOUBLE;
+                break;
+            case '_':
+                cur->type = REDIS_REPLY_NIL;
+                break;
+            case '$':
+                cur->type = REDIS_REPLY_STRING;
+                break;
+            case '*':
+                cur->type = REDIS_REPLY_ARRAY;
+                break;
+            case '%':
+                cur->type = REDIS_REPLY_MAP;
+                break;
+            case '~':
+                cur->type = REDIS_REPLY_SET;
+                break;
+            case '#':
+                cur->type = REDIS_REPLY_BOOL;
+                break;
+            case '=':
+                cur->type = REDIS_REPLY_VERB;
+                break;
+            case '>':
+                cur->type = REDIS_REPLY_PUSH;
+                break;
+            default:
+                __redisReaderSetErrorProtocolByte(r,*p);
+                return REDIS_ERR;
+            }
+        } else {
+            /* could not consume 1 byte */
+            return REDIS_ERR;
+        }
+    }
+
+    /* process typed item */
+    switch(cur->type) {
+    case REDIS_REPLY_ERROR:
+    case REDIS_REPLY_STATUS:
+    case REDIS_REPLY_INTEGER:
+    case REDIS_REPLY_DOUBLE:
+    case REDIS_REPLY_NIL:
+    case REDIS_REPLY_BOOL:
+        return processLineItem(r);
+    case REDIS_REPLY_STRING:
+    case REDIS_REPLY_VERB:
+        return processBulkItem(r);
+    case REDIS_REPLY_ARRAY:
+    case REDIS_REPLY_MAP:
+    case REDIS_REPLY_SET:
+    case REDIS_REPLY_PUSH:
+        return processAggregateItem(r);
+    default:
+        assert(NULL);
+        return REDIS_ERR; /* Avoid warning. */
+    }
+}
+
+redisReader *redisReaderCreateWithFunctions(redisReplyObjectFunctions *fn) {
+    redisReader *r;
+
+    r = hi_calloc(1,sizeof(redisReader));
+    if (r == NULL)
+        return NULL;
+
+    r->buf = hi_sdsempty();
+    if (r->buf == NULL)
+        goto oom;
+
+    r->task = hi_calloc(REDIS_READER_STACK_SIZE, sizeof(*r->task));
+    if (r->task == NULL)
+        goto oom;
+
+    for (; r->tasks < REDIS_READER_STACK_SIZE; r->tasks++) {
+        r->task[r->tasks] = hi_calloc(1, sizeof(**r->task));
+        if (r->task[r->tasks] == NULL)
+            goto oom;
+    }
+
+    r->fn = fn;
+    r->maxbuf = REDIS_READER_MAX_BUF;
+    r->maxelements = REDIS_READER_MAX_ARRAY_ELEMENTS;
+    r->ridx = -1;
+
+    return r;
+oom:
+    redisReaderFree(r);
+    return NULL;
+}
+
+void redisReaderFree(redisReader *r) {
+    if (r == NULL)
+        return;
+
+    if (r->reply != NULL && r->fn && r->fn->freeObject)
+        r->fn->freeObject(r->reply);
+
+    if (r->task) {
+        /* We know r->task[i] is allocated if i < r->tasks */
+        for (int i = 0; i < r->tasks; i++) {
+            hi_free(r->task[i]);
+        }
+
+        hi_free(r->task);
+    }
+
+    hi_sdsfree(r->buf);
+    hi_free(r);
+}
+
+int redisReaderFeed(redisReader *r, const char *buf, size_t len) {
+    hisds newbuf;
+
+    /* Return early when this reader is in an erroneous state. */
+    if (r->err)
+        return REDIS_ERR;
+
+    /* Copy the provided buffer. */
+    if (buf != NULL && len >= 1) {
+        /* Destroy internal buffer when it is empty and is quite large. */
+        if (r->len == 0 && r->maxbuf != 0 && hi_sdsavail(r->buf) > r->maxbuf) {
+            hi_sdsfree(r->buf);
+            r->buf = hi_sdsempty();
+            if (r->buf == 0) goto oom;
+
+            r->pos = 0;
+        }
+
+        newbuf = hi_sdscatlen(r->buf,buf,len);
+        if (newbuf == NULL) goto oom;
+
+        r->buf = newbuf;
+        r->len = hi_sdslen(r->buf);
+    }
+
+    return REDIS_OK;
+oom:
+    __redisReaderSetErrorOOM(r);
+    return REDIS_ERR;
+}
+
+int redisReaderGetReply(redisReader *r, void **reply) {
+    /* Default target pointer to NULL. */
+    if (reply != NULL)
+        *reply = NULL;
+
+    /* Return early when this reader is in an erroneous state. */
+    if (r->err)
+        return REDIS_ERR;
+
+    /* When the buffer is empty, there will never be a reply. */
+    if (r->len == 0)
+        return REDIS_OK;
+
+    /* Set first item to process when the stack is empty. */
+    if (r->ridx == -1) {
+        r->task[0]->type = -1;
+        r->task[0]->elements = -1;
+        r->task[0]->idx = -1;
+        r->task[0]->obj = NULL;
+        r->task[0]->parent = NULL;
+        r->task[0]->privdata = r->privdata;
+        r->ridx = 0;
+    }
+
+    /* Process items in reply. */
+    while (r->ridx >= 0)
+        if (processItem(r) != REDIS_OK)
+            break;
+
+    /* Return ASAP when an error occurred. */
+    if (r->err)
+        return REDIS_ERR;
+
+    /* Discard part of the buffer when we've consumed at least 1k, to avoid
+     * doing unnecessary calls to memmove() in sds.c. */
+    if (r->pos >= 1024) {
+        if (hi_sdsrange(r->buf,r->pos,-1) < 0) return REDIS_ERR;
+        r->pos = 0;
+        r->len = hi_sdslen(r->buf);
+    }
+
+    /* Emit a reply when there is one. */
+    if (r->ridx == -1) {
+        if (reply != NULL) {
+            *reply = r->reply;
+        } else if (r->reply != NULL && r->fn && r->fn->freeObject) {
+            r->fn->freeObject(r->reply);
+        }
+        r->reply = NULL;
+    }
+    return REDIS_OK;
+}
diff --git a/redis-stable/deps/hiredis/read.h b/redis-stable/deps/hiredis/read.h
new file mode 100644
index 00000000..2d74d77a
--- /dev/null
+++ b/redis-stable/deps/hiredis/read.h
@@ -0,0 +1,129 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#ifndef __HIREDIS_READ_H
+#define __HIREDIS_READ_H
+#include <stdio.h> /* for size_t */
+
+#define REDIS_ERR -1
+#define REDIS_OK 0
+
+/* When an error occurs, the err flag in a context is set to hold the type of
+ * error that occurred. REDIS_ERR_IO means there was an I/O error and you
+ * should use the "errno" variable to find out what is wrong.
+ * For other values, the "errstr" field will hold a description. */
+#define REDIS_ERR_IO 1 /* Error in read or write */
+#define REDIS_ERR_EOF 3 /* End of file */
+#define REDIS_ERR_PROTOCOL 4 /* Protocol error */
+#define REDIS_ERR_OOM 5 /* Out of memory */
+#define REDIS_ERR_TIMEOUT 6 /* Timed out */
+#define REDIS_ERR_OTHER 2 /* Everything else... */
+
+#define REDIS_REPLY_STRING 1
+#define REDIS_REPLY_ARRAY 2
+#define REDIS_REPLY_INTEGER 3
+#define REDIS_REPLY_NIL 4
+#define REDIS_REPLY_STATUS 5
+#define REDIS_REPLY_ERROR 6
+#define REDIS_REPLY_DOUBLE 7
+#define REDIS_REPLY_BOOL 8
+#define REDIS_REPLY_MAP 9
+#define REDIS_REPLY_SET 10
+#define REDIS_REPLY_ATTR 11
+#define REDIS_REPLY_PUSH 12
+#define REDIS_REPLY_BIGNUM 13
+#define REDIS_REPLY_VERB 14
+
+/* Default max unused reader buffer. */
+#define REDIS_READER_MAX_BUF (1024*16)
+
+/* Default multi-bulk element limit */
+#define REDIS_READER_MAX_ARRAY_ELEMENTS ((1LL<<32) - 1)
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct redisReadTask {
+    int type;
+    long long elements; /* number of elements in multibulk container */
+    int idx; /* index in parent (array) object */
+    void *obj; /* holds user-generated value for a read task */
+    struct redisReadTask *parent; /* parent task */
+    void *privdata; /* user-settable arbitrary field */
+} redisReadTask;
+
+typedef struct redisReplyObjectFunctions {
+    void *(*createString)(const redisReadTask*, char*, size_t);
+    void *(*createArray)(const redisReadTask*, size_t);
+    void *(*createInteger)(const redisReadTask*, long long);
+    void *(*createDouble)(const redisReadTask*, double, char*, size_t);
+    void *(*createNil)(const redisReadTask*);
+    void *(*createBool)(const redisReadTask*, int);
+    void (*freeObject)(void*);
+} redisReplyObjectFunctions;
+
+typedef struct redisReader {
+    int err; /* Error flags, 0 when there is no error */
+    char errstr[128]; /* String representation of error when applicable */
+
+    char *buf; /* Read buffer */
+    size_t pos; /* Buffer cursor */
+    size_t len; /* Buffer length */
+    size_t maxbuf; /* Max length of unused buffer */
+    long long maxelements; /* Max multi-bulk elements */
+
+    redisReadTask **task;
+    int tasks;
+
+    int ridx; /* Index of current read task */
+    void *reply; /* Temporary reply pointer */
+
+    redisReplyObjectFunctions *fn;
+    void *privdata;
+} redisReader;
+
+/* Public API for the protocol parser. */
+redisReader *redisReaderCreateWithFunctions(redisReplyObjectFunctions *fn);
+void redisReaderFree(redisReader *r);
+int redisReaderFeed(redisReader *r, const char *buf, size_t len);
+int redisReaderGetReply(redisReader *r, void **reply);
+
+#define redisReaderSetPrivdata(_r, _p) (int)(((redisReader*)(_r))->privdata = (_p))
+#define redisReaderGetObject(_r) (((redisReader*)(_r))->reply)
+#define redisReaderGetError(_r) (((redisReader*)(_r))->errstr)
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/redis-stable/deps/hiredis/sds.c b/redis-stable/deps/hiredis/sds.c
new file mode 100644
index 00000000..675e7649
--- /dev/null
+++ b/redis-stable/deps/hiredis/sds.c
@@ -0,0 +1,1289 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Oran Agra
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <assert.h>
+#include <limits.h>
+#include "sds.h"
+#include "sdsalloc.h"
+
+static inline int hi_sdsHdrSize(char type) {
+    switch(type&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            return sizeof(struct hisdshdr5);
+        case HI_SDS_TYPE_8:
+            return sizeof(struct hisdshdr8);
+        case HI_SDS_TYPE_16:
+            return sizeof(struct hisdshdr16);
+        case HI_SDS_TYPE_32:
+            return sizeof(struct hisdshdr32);
+        case HI_SDS_TYPE_64:
+            return sizeof(struct hisdshdr64);
+    }
+    return 0;
+}
+
+static inline char hi_sdsReqType(size_t string_size) {
+    if (string_size < 32)
+        return HI_SDS_TYPE_5;
+    if (string_size < 0xff)
+        return HI_SDS_TYPE_8;
+    if (string_size < 0xffff)
+        return HI_SDS_TYPE_16;
+    if (string_size < 0xffffffff)
+        return HI_SDS_TYPE_32;
+    return HI_SDS_TYPE_64;
+}
+
+/* Create a new hisds string with the content specified by the 'init' pointer
+ * and 'initlen'.
+ * If NULL is used for 'init' the string is initialized with zero bytes.
+ *
+ * The string is always null-termined (all the hisds strings are, always) so
+ * even if you create an hisds string with:
+ *
+ * mystring = hi_sdsnewlen("abc",3);
+ *
+ * You can print the string with printf() as there is an implicit \0 at the
+ * end of the string. However the string is binary safe and can contain
+ * \0 characters in the middle, as the length is stored in the hisds header. */
+hisds hi_sdsnewlen(const void *init, size_t initlen) {
+    void *sh;
+    hisds s;
+    char type = hi_sdsReqType(initlen);
+    /* Empty strings are usually created in order to append. Use type 8
+     * since type 5 is not good at this. */
+    if (type == HI_SDS_TYPE_5 && initlen == 0) type = HI_SDS_TYPE_8;
+    int hdrlen = hi_sdsHdrSize(type);
+    unsigned char *fp; /* flags pointer. */
+
+    sh = hi_s_malloc(hdrlen+initlen+1);
+    if (sh == NULL) return NULL;
+    if (!init)
+        memset(sh, 0, hdrlen+initlen+1);
+    s = (char*)sh+hdrlen;
+    fp = ((unsigned char*)s)-1;
+    switch(type) {
+        case HI_SDS_TYPE_5: {
+            *fp = type | (initlen << HI_SDS_TYPE_BITS);
+            break;
+        }
+        case HI_SDS_TYPE_8: {
+            HI_SDS_HDR_VAR(8,s);
+            sh->len = initlen;
+            sh->alloc = initlen;
+            *fp = type;
+            break;
+        }
+        case HI_SDS_TYPE_16: {
+            HI_SDS_HDR_VAR(16,s);
+            sh->len = initlen;
+            sh->alloc = initlen;
+            *fp = type;
+            break;
+        }
+        case HI_SDS_TYPE_32: {
+            HI_SDS_HDR_VAR(32,s);
+            sh->len = initlen;
+            sh->alloc = initlen;
+            *fp = type;
+            break;
+        }
+        case HI_SDS_TYPE_64: {
+            HI_SDS_HDR_VAR(64,s);
+            sh->len = initlen;
+            sh->alloc = initlen;
+            *fp = type;
+            break;
+        }
+    }
+    if (initlen && init)
+        memcpy(s, init, initlen);
+    s[initlen] = '\0';
+    return s;
+}
+
+/* Create an empty (zero length) hisds string. Even in this case the string
+ * always has an implicit null term. */
+hisds hi_sdsempty(void) {
+    return hi_sdsnewlen("",0);
+}
+
+/* Create a new hisds string starting from a null terminated C string. */
+hisds hi_sdsnew(const char *init) {
+    size_t initlen = (init == NULL) ? 0 : strlen(init);
+    return hi_sdsnewlen(init, initlen);
+}
+
+/* Duplicate an hisds string. */
+hisds hi_sdsdup(const hisds s) {
+    return hi_sdsnewlen(s, hi_sdslen(s));
+}
+
+/* Free an hisds string. No operation is performed if 's' is NULL. */
+void hi_sdsfree(hisds s) {
+    if (s == NULL) return;
+    hi_s_free((char*)s-hi_sdsHdrSize(s[-1]));
+}
+
+/* Set the hisds string length to the length as obtained with strlen(), so
+ * considering as content only up to the first null term character.
+ *
+ * This function is useful when the hisds string is hacked manually in some
+ * way, like in the following example:
+ *
+ * s = hi_sdsnew("foobar");
+ * s[2] = '\0';
+ * hi_sdsupdatelen(s);
+ * printf("%d\n", hi_sdslen(s));
+ *
+ * The output will be "2", but if we comment out the call to hi_sdsupdatelen()
+ * the output will be "6" as the string was modified but the logical length
+ * remains 6 bytes. */
+void hi_sdsupdatelen(hisds s) {
+    int reallen = strlen(s);
+    hi_sdssetlen(s, reallen);
+}
+
+/* Modify an hisds string in-place to make it empty (zero length).
+ * However all the existing buffer is not discarded but set as free space
+ * so that next append operations will not require allocations up to the
+ * number of bytes previously available. */
+void hi_sdsclear(hisds s) {
+    hi_sdssetlen(s, 0);
+    s[0] = '\0';
+}
+
+/* Enlarge the free space at the end of the hisds string so that the caller
+ * is sure that after calling this function can overwrite up to addlen
+ * bytes after the end of the string, plus one more byte for nul term.
+ *
+ * Note: this does not change the *length* of the hisds string as returned
+ * by hi_sdslen(), but only the free buffer space we have. */
+hisds hi_sdsMakeRoomFor(hisds s, size_t addlen) {
+    void *sh, *newsh;
+    size_t avail = hi_sdsavail(s);
+    size_t len, newlen;
+    char type, oldtype = s[-1] & HI_SDS_TYPE_MASK;
+    int hdrlen;
+
+    /* Return ASAP if there is enough space left. */
+    if (avail >= addlen) return s;
+
+    len = hi_sdslen(s);
+    sh = (char*)s-hi_sdsHdrSize(oldtype);
+    newlen = (len+addlen);
+    if (newlen < HI_SDS_MAX_PREALLOC)
+        newlen *= 2;
+    else
+        newlen += HI_SDS_MAX_PREALLOC;
+
+    type = hi_sdsReqType(newlen);
+
+    /* Don't use type 5: the user is appending to the string and type 5 is
+     * not able to remember empty space, so hi_sdsMakeRoomFor() must be called
+     * at every appending operation. */
+    if (type == HI_SDS_TYPE_5) type = HI_SDS_TYPE_8;
+
+    hdrlen = hi_sdsHdrSize(type);
+    if (oldtype==type) {
+        newsh = hi_s_realloc(sh, hdrlen+newlen+1);
+        if (newsh == NULL) return NULL;
+        s = (char*)newsh+hdrlen;
+    } else {
+        /* Since the header size changes, need to move the string forward,
+         * and can't use realloc */
+        newsh = hi_s_malloc(hdrlen+newlen+1);
+        if (newsh == NULL) return NULL;
+        memcpy((char*)newsh+hdrlen, s, len+1);
+        hi_s_free(sh);
+        s = (char*)newsh+hdrlen;
+        s[-1] = type;
+        hi_sdssetlen(s, len);
+    }
+    hi_sdssetalloc(s, newlen);
+    return s;
+}
+
+/* Reallocate the hisds string so that it has no free space at the end. The
+ * contained string remains not altered, but next concatenation operations
+ * will require a reallocation.
+ *
+ * After the call, the passed hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+hisds hi_sdsRemoveFreeSpace(hisds s) {
+    void *sh, *newsh;
+    char type, oldtype = s[-1] & HI_SDS_TYPE_MASK;
+    int hdrlen;
+    size_t len = hi_sdslen(s);
+    sh = (char*)s-hi_sdsHdrSize(oldtype);
+
+    type = hi_sdsReqType(len);
+    hdrlen = hi_sdsHdrSize(type);
+    if (oldtype==type) {
+        newsh = hi_s_realloc(sh, hdrlen+len+1);
+        if (newsh == NULL) return NULL;
+        s = (char*)newsh+hdrlen;
+    } else {
+        newsh = hi_s_malloc(hdrlen+len+1);
+        if (newsh == NULL) return NULL;
+        memcpy((char*)newsh+hdrlen, s, len+1);
+        hi_s_free(sh);
+        s = (char*)newsh+hdrlen;
+        s[-1] = type;
+        hi_sdssetlen(s, len);
+    }
+    hi_sdssetalloc(s, len);
+    return s;
+}
+
+/* Return the total size of the allocation of the specifed hisds string,
+ * including:
+ * 1) The hisds header before the pointer.
+ * 2) The string.
+ * 3) The free buffer at the end if any.
+ * 4) The implicit null term.
+ */
+size_t hi_sdsAllocSize(hisds s) {
+    size_t alloc = hi_sdsalloc(s);
+    return hi_sdsHdrSize(s[-1])+alloc+1;
+}
+
+/* Return the pointer of the actual SDS allocation (normally SDS strings
+ * are referenced by the start of the string buffer). */
+void *hi_sdsAllocPtr(hisds s) {
+    return (void*) (s-hi_sdsHdrSize(s[-1]));
+}
+
+/* Increment the hisds length and decrements the left free space at the
+ * end of the string according to 'incr'. Also set the null term
+ * in the new end of the string.
+ *
+ * This function is used in order to fix the string length after the
+ * user calls hi_sdsMakeRoomFor(), writes something after the end of
+ * the current string, and finally needs to set the new length.
+ *
+ * Note: it is possible to use a negative increment in order to
+ * right-trim the string.
+ *
+ * Usage example:
+ *
+ * Using hi_sdsIncrLen() and hi_sdsMakeRoomFor() it is possible to mount the
+ * following schema, to cat bytes coming from the kernel to the end of an
+ * hisds string without copying into an intermediate buffer:
+ *
+ * oldlen = hi_hi_sdslen(s);
+ * s = hi_sdsMakeRoomFor(s, BUFFER_SIZE);
+ * nread = read(fd, s+oldlen, BUFFER_SIZE);
+ * ... check for nread <= 0 and handle it ...
+ * hi_sdsIncrLen(s, nread);
+ */
+void hi_sdsIncrLen(hisds s, int incr) {
+    unsigned char flags = s[-1];
+    size_t len;
+    switch(flags&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5: {
+            unsigned char *fp = ((unsigned char*)s)-1;
+            unsigned char oldlen = HI_SDS_TYPE_5_LEN(flags);
+            assert((incr > 0 && oldlen+incr < 32) || (incr < 0 && oldlen >= (unsigned int)(-incr)));
+            *fp = HI_SDS_TYPE_5 | ((oldlen+incr) << HI_SDS_TYPE_BITS);
+            len = oldlen+incr;
+            break;
+        }
+        case HI_SDS_TYPE_8: {
+            HI_SDS_HDR_VAR(8,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case HI_SDS_TYPE_16: {
+            HI_SDS_HDR_VAR(16,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case HI_SDS_TYPE_32: {
+            HI_SDS_HDR_VAR(32,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= (unsigned int)incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case HI_SDS_TYPE_64: {
+            HI_SDS_HDR_VAR(64,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= (uint64_t)incr) || (incr < 0 && sh->len >= (uint64_t)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        default: len = 0; /* Just to avoid compilation warnings. */
+    }
+    s[len] = '\0';
+}
+
+/* Grow the hisds to have the specified length. Bytes that were not part of
+ * the original length of the hisds will be set to zero.
+ *
+ * if the specified length is smaller than the current length, no operation
+ * is performed. */
+hisds hi_sdsgrowzero(hisds s, size_t len) {
+    size_t curlen = hi_sdslen(s);
+
+    if (len <= curlen) return s;
+    s = hi_sdsMakeRoomFor(s,len-curlen);
+    if (s == NULL) return NULL;
+
+    /* Make sure added region doesn't contain garbage */
+    memset(s+curlen,0,(len-curlen+1)); /* also set trailing \0 byte */
+    hi_sdssetlen(s, len);
+    return s;
+}
+
+/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the
+ * end of the specified hisds string 's'.
+ *
+ * After the call, the passed hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+hisds hi_sdscatlen(hisds s, const void *t, size_t len) {
+    size_t curlen = hi_sdslen(s);
+
+    s = hi_sdsMakeRoomFor(s,len);
+    if (s == NULL) return NULL;
+    memcpy(s+curlen, t, len);
+    hi_sdssetlen(s, curlen+len);
+    s[curlen+len] = '\0';
+    return s;
+}
+
+/* Append the specified null termianted C string to the hisds string 's'.
+ *
+ * After the call, the passed hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+hisds hi_sdscat(hisds s, const char *t) {
+    return hi_sdscatlen(s, t, strlen(t));
+}
+
+/* Append the specified hisds 't' to the existing hisds 's'.
+ *
+ * After the call, the modified hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+hisds hi_sdscatsds(hisds s, const hisds t) {
+    return hi_sdscatlen(s, t, hi_sdslen(t));
+}
+
+/* Destructively modify the hisds string 's' to hold the specified binary
+ * safe string pointed by 't' of length 'len' bytes. */
+hisds hi_sdscpylen(hisds s, const char *t, size_t len) {
+    if (hi_sdsalloc(s) < len) {
+        s = hi_sdsMakeRoomFor(s,len-hi_sdslen(s));
+        if (s == NULL) return NULL;
+    }
+    memcpy(s, t, len);
+    s[len] = '\0';
+    hi_sdssetlen(s, len);
+    return s;
+}
+
+/* Like hi_sdscpylen() but 't' must be a null-termined string so that the length
+ * of the string is obtained with strlen(). */
+hisds hi_sdscpy(hisds s, const char *t) {
+    return hi_sdscpylen(s, t, strlen(t));
+}
+
+/* Helper for hi_sdscatlonglong() doing the actual number -> string
+ * conversion. 's' must point to a string with room for at least
+ * HI_SDS_LLSTR_SIZE bytes.
+ *
+ * The function returns the length of the null-terminated string
+ * representation stored at 's'. */
+#define HI_SDS_LLSTR_SIZE 21
+int hi_sdsll2str(char *s, long long value) {
+    char *p, aux;
+    unsigned long long v;
+    size_t l;
+
+    /* Generate the string representation, this method produces
+     * an reversed string. */
+    v = (value < 0) ? -value : value;
+    p = s;
+    do {
+        *p++ = '0'+(v%10);
+        v /= 10;
+    } while(v);
+    if (value < 0) *p++ = '-';
+
+    /* Compute length and add null term. */
+    l = p-s;
+    *p = '\0';
+
+    /* Reverse the string. */
+    p--;
+    while(s < p) {
+        aux = *s;
+        *s = *p;
+        *p = aux;
+        s++;
+        p--;
+    }
+    return l;
+}
+
+/* Identical hi_sdsll2str(), but for unsigned long long type. */
+int hi_sdsull2str(char *s, unsigned long long v) {
+    char *p, aux;
+    size_t l;
+
+    /* Generate the string representation, this method produces
+     * an reversed string. */
+    p = s;
+    do {
+        *p++ = '0'+(v%10);
+        v /= 10;
+    } while(v);
+
+    /* Compute length and add null term. */
+    l = p-s;
+    *p = '\0';
+
+    /* Reverse the string. */
+    p--;
+    while(s < p) {
+        aux = *s;
+        *s = *p;
+        *p = aux;
+        s++;
+        p--;
+    }
+    return l;
+}
+
+/* Create an hisds string from a long long value. It is much faster than:
+ *
+ * hi_sdscatprintf(hi_sdsempty(),"%lld\n", value);
+ */
+hisds hi_sdsfromlonglong(long long value) {
+    char buf[HI_SDS_LLSTR_SIZE];
+    int len = hi_sdsll2str(buf,value);
+
+    return hi_sdsnewlen(buf,len);
+}
+
+/* Like hi_sdscatprintf() but gets va_list instead of being variadic. */
+hisds hi_sdscatvprintf(hisds s, const char *fmt, va_list ap) {
+    va_list cpy;
+    char staticbuf[1024], *buf = staticbuf, *t;
+    size_t buflen = strlen(fmt)*2;
+
+    /* We try to start using a static buffer for speed.
+     * If not possible we revert to heap allocation. */
+    if (buflen > sizeof(staticbuf)) {
+        buf = hi_s_malloc(buflen);
+        if (buf == NULL) return NULL;
+    } else {
+        buflen = sizeof(staticbuf);
+    }
+
+    /* Try with buffers two times bigger every time we fail to
+     * fit the string in the current buffer size. */
+    while(1) {
+        buf[buflen-2] = '\0';
+        va_copy(cpy,ap);
+        vsnprintf(buf, buflen, fmt, cpy);
+        va_end(cpy);
+        if (buf[buflen-2] != '\0') {
+            if (buf != staticbuf) hi_s_free(buf);
+            buflen *= 2;
+            buf = hi_s_malloc(buflen);
+            if (buf == NULL) return NULL;
+            continue;
+        }
+        break;
+    }
+
+    /* Finally concat the obtained string to the SDS string and return it. */
+    t = hi_sdscat(s, buf);
+    if (buf != staticbuf) hi_s_free(buf);
+    return t;
+}
+
+/* Append to the hisds string 's' a string obtained using printf-alike format
+ * specifier.
+ *
+ * After the call, the modified hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call.
+ *
+ * Example:
+ *
+ * s = hi_sdsnew("Sum is: ");
+ * s = hi_sdscatprintf(s,"%d+%d = %d",a,b,a+b).
+ *
+ * Often you need to create a string from scratch with the printf-alike
+ * format. When this is the need, just use hi_sdsempty() as the target string:
+ *
+ * s = hi_sdscatprintf(hi_sdsempty(), "... your format ...", args);
+ */
+hisds hi_sdscatprintf(hisds s, const char *fmt, ...) {
+    va_list ap;
+    char *t;
+    va_start(ap, fmt);
+    t = hi_sdscatvprintf(s,fmt,ap);
+    va_end(ap);
+    return t;
+}
+
+/* This function is similar to hi_sdscatprintf, but much faster as it does
+ * not rely on sprintf() family functions implemented by the libc that
+ * are often very slow. Moreover directly handling the hisds string as
+ * new data is concatenated provides a performance improvement.
+ *
+ * However this function only handles an incompatible subset of printf-alike
+ * format specifiers:
+ *
+ * %s - C String
+ * %S - SDS string
+ * %i - signed int
+ * %I - 64 bit signed integer (long long, int64_t)
+ * %u - unsigned int
+ * %U - 64 bit unsigned integer (unsigned long long, uint64_t)
+ * %% - Verbatim "%" character.
+ */
+hisds hi_sdscatfmt(hisds s, char const *fmt, ...) {
+    const char *f = fmt;
+    int i;
+    va_list ap;
+
+    va_start(ap,fmt);
+    i = hi_sdslen(s); /* Position of the next byte to write to dest str. */
+    while(*f) {
+        char next, *str;
+        size_t l;
+        long long num;
+        unsigned long long unum;
+
+        /* Make sure there is always space for at least 1 char. */
+        if (hi_sdsavail(s)==0) {
+            s = hi_sdsMakeRoomFor(s,1);
+            if (s == NULL) goto fmt_error;
+        }
+
+        switch(*f) {
+        case '%':
+            next = *(f+1);
+            f++;
+            switch(next) {
+            case 's':
+            case 'S':
+                str = va_arg(ap,char*);
+                l = (next == 's') ? strlen(str) : hi_sdslen(str);
+                if (hi_sdsavail(s) < l) {
+                    s = hi_sdsMakeRoomFor(s,l);
+                    if (s == NULL) goto fmt_error;
+                }
+                memcpy(s+i,str,l);
+                hi_sdsinclen(s,l);
+                i += l;
+                break;
+            case 'i':
+            case 'I':
+                if (next == 'i')
+                    num = va_arg(ap,int);
+                else
+                    num = va_arg(ap,long long);
+                {
+                    char buf[HI_SDS_LLSTR_SIZE];
+                    l = hi_sdsll2str(buf,num);
+                    if (hi_sdsavail(s) < l) {
+                        s = hi_sdsMakeRoomFor(s,l);
+                        if (s == NULL) goto fmt_error;
+                    }
+                    memcpy(s+i,buf,l);
+                    hi_sdsinclen(s,l);
+                    i += l;
+                }
+                break;
+            case 'u':
+            case 'U':
+                if (next == 'u')
+                    unum = va_arg(ap,unsigned int);
+                else
+                    unum = va_arg(ap,unsigned long long);
+                {
+                    char buf[HI_SDS_LLSTR_SIZE];
+                    l = hi_sdsull2str(buf,unum);
+                    if (hi_sdsavail(s) < l) {
+                        s = hi_sdsMakeRoomFor(s,l);
+                        if (s == NULL) goto fmt_error;
+                    }
+                    memcpy(s+i,buf,l);
+                    hi_sdsinclen(s,l);
+                    i += l;
+                }
+                break;
+            default: /* Handle %% and generally %<unknown>. */
+                s[i++] = next;
+                hi_sdsinclen(s,1);
+                break;
+            }
+            break;
+        default:
+            s[i++] = *f;
+            hi_sdsinclen(s,1);
+            break;
+        }
+        f++;
+    }
+    va_end(ap);
+
+    /* Add null-term */
+    s[i] = '\0';
+    return s;
+
+fmt_error:
+    va_end(ap);
+    return NULL;
+}
+
+/* Remove the part of the string from left and from right composed just of
+ * contiguous characters found in 'cset', that is a null terminted C string.
+ *
+ * After the call, the modified hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call.
+ *
+ * Example:
+ *
+ * s = hi_sdsnew("AA...AA.a.aa.aHelloWorld     :::");
+ * s = hi_sdstrim(s,"Aa. :");
+ * printf("%s\n", s);
+ *
+ * Output will be just "Hello World".
+ */
+hisds hi_sdstrim(hisds s, const char *cset) {
+    char *start, *end, *sp, *ep;
+    size_t len;
+
+    sp = start = s;
+    ep = end = s+hi_sdslen(s)-1;
+    while(sp <= end && strchr(cset, *sp)) sp++;
+    while(ep > sp && strchr(cset, *ep)) ep--;
+    len = (sp > ep) ? 0 : ((ep-sp)+1);
+    if (s != sp) memmove(s, sp, len);
+    s[len] = '\0';
+    hi_sdssetlen(s,len);
+    return s;
+}
+
+/* Turn the string into a smaller (or equal) string containing only the
+ * substring specified by the 'start' and 'end' indexes.
+ *
+ * start and end can be negative, where -1 means the last character of the
+ * string, -2 the penultimate character, and so forth.
+ *
+ * The interval is inclusive, so the start and end characters will be part
+ * of the resulting string.
+ *
+ * The string is modified in-place.
+ *
+ * Return value:
+ * -1 (error) if hi_sdslen(s) is larger than maximum positive ssize_t value.
+ *  0 on success.
+ *
+ * Example:
+ *
+ * s = hi_sdsnew("Hello World");
+ * hi_sdsrange(s,1,-1); => "ello World"
+ */
+int hi_sdsrange(hisds s, ssize_t start, ssize_t end) {
+    size_t newlen, len = hi_sdslen(s);
+    if (len > SSIZE_MAX) return -1;
+
+    if (len == 0) return 0;
+    if (start < 0) {
+        start = len+start;
+        if (start < 0) start = 0;
+    }
+    if (end < 0) {
+        end = len+end;
+        if (end < 0) end = 0;
+    }
+    newlen = (start > end) ? 0 : (end-start)+1;
+    if (newlen != 0) {
+        if (start >= (ssize_t)len) {
+            newlen = 0;
+        } else if (end >= (ssize_t)len) {
+            end = len-1;
+            newlen = (start > end) ? 0 : (end-start)+1;
+        }
+    } else {
+        start = 0;
+    }
+    if (start && newlen) memmove(s, s+start, newlen);
+    s[newlen] = 0;
+    hi_sdssetlen(s,newlen);
+    return 0;
+}
+
+/* Apply tolower() to every character of the hisds string 's'. */
+void hi_sdstolower(hisds s) {
+    int len = hi_sdslen(s), j;
+
+    for (j = 0; j < len; j++) s[j] = tolower(s[j]);
+}
+
+/* Apply toupper() to every character of the hisds string 's'. */
+void hi_sdstoupper(hisds s) {
+    int len = hi_sdslen(s), j;
+
+    for (j = 0; j < len; j++) s[j] = toupper(s[j]);
+}
+
+/* Compare two hisds strings s1 and s2 with memcmp().
+ *
+ * Return value:
+ *
+ *     positive if s1 > s2.
+ *     negative if s1 < s2.
+ *     0 if s1 and s2 are exactly the same binary string.
+ *
+ * If two strings share exactly the same prefix, but one of the two has
+ * additional characters, the longer string is considered to be greater than
+ * the smaller one. */
+int hi_sdscmp(const hisds s1, const hisds s2) {
+    size_t l1, l2, minlen;
+    int cmp;
+
+    l1 = hi_sdslen(s1);
+    l2 = hi_sdslen(s2);
+    minlen = (l1 < l2) ? l1 : l2;
+    cmp = memcmp(s1,s2,minlen);
+    if (cmp == 0) return l1-l2;
+    return cmp;
+}
+
+/* Split 's' with separator in 'sep'. An array
+ * of hisds strings is returned. *count will be set
+ * by reference to the number of tokens returned.
+ *
+ * On out of memory, zero length string, zero length
+ * separator, NULL is returned.
+ *
+ * Note that 'sep' is able to split a string using
+ * a multi-character separator. For example
+ * hi_sdssplit("foo_-_bar","_-_"); will return two
+ * elements "foo" and "bar".
+ *
+ * This version of the function is binary-safe but
+ * requires length arguments. hi_sdssplit() is just the
+ * same function but for zero-terminated strings.
+ */
+hisds *hi_sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count) {
+    int elements = 0, slots = 5, start = 0, j;
+    hisds *tokens;
+
+    if (seplen < 1 || len < 0) return NULL;
+
+    tokens = hi_s_malloc(sizeof(hisds)*slots);
+    if (tokens == NULL) return NULL;
+
+    if (len == 0) {
+        *count = 0;
+        return tokens;
+    }
+    for (j = 0; j < (len-(seplen-1)); j++) {
+        /* make sure there is room for the next element and the final one */
+        if (slots < elements+2) {
+            hisds *newtokens;
+
+            slots *= 2;
+            newtokens = hi_s_realloc(tokens,sizeof(hisds)*slots);
+            if (newtokens == NULL) goto cleanup;
+            tokens = newtokens;
+        }
+        /* search the separator */
+        if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {
+            tokens[elements] = hi_sdsnewlen(s+start,j-start);
+            if (tokens[elements] == NULL) goto cleanup;
+            elements++;
+            start = j+seplen;
+            j = j+seplen-1; /* skip the separator */
+        }
+    }
+    /* Add the final element. We are sure there is room in the tokens array. */
+    tokens[elements] = hi_sdsnewlen(s+start,len-start);
+    if (tokens[elements] == NULL) goto cleanup;
+    elements++;
+    *count = elements;
+    return tokens;
+
+cleanup:
+    {
+        int i;
+        for (i = 0; i < elements; i++) hi_sdsfree(tokens[i]);
+        hi_s_free(tokens);
+        *count = 0;
+        return NULL;
+    }
+}
+
+/* Free the result returned by hi_sdssplitlen(), or do nothing if 'tokens' is NULL. */
+void hi_sdsfreesplitres(hisds *tokens, int count) {
+    if (!tokens) return;
+    while(count--)
+        hi_sdsfree(tokens[count]);
+    hi_s_free(tokens);
+}
+
+/* Append to the hisds string "s" an escaped string representation where
+ * all the non-printable characters (tested with isprint()) are turned into
+ * escapes in the form "\n\r\a...." or "\x<hex-number>".
+ *
+ * After the call, the modified hisds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+hisds hi_sdscatrepr(hisds s, const char *p, size_t len) {
+    s = hi_sdscatlen(s,"\"",1);
+    while(len--) {
+        switch(*p) {
+        case '\\':
+        case '"':
+            s = hi_sdscatprintf(s,"\\%c",*p);
+            break;
+        case '\n': s = hi_sdscatlen(s,"\\n",2); break;
+        case '\r': s = hi_sdscatlen(s,"\\r",2); break;
+        case '\t': s = hi_sdscatlen(s,"\\t",2); break;
+        case '\a': s = hi_sdscatlen(s,"\\a",2); break;
+        case '\b': s = hi_sdscatlen(s,"\\b",2); break;
+        default:
+            if (isprint(*p))
+                s = hi_sdscatprintf(s,"%c",*p);
+            else
+                s = hi_sdscatprintf(s,"\\x%02x",(unsigned char)*p);
+            break;
+        }
+        p++;
+    }
+    return hi_sdscatlen(s,"\"",1);
+}
+
+/* Helper function for hi_sdssplitargs() that converts a hex digit into an
+ * integer from 0 to 15 */
+static int hi_hex_digit_to_int(char c) {
+    switch(c) {
+    case '0': return 0;
+    case '1': return 1;
+    case '2': return 2;
+    case '3': return 3;
+    case '4': return 4;
+    case '5': return 5;
+    case '6': return 6;
+    case '7': return 7;
+    case '8': return 8;
+    case '9': return 9;
+    case 'a': case 'A': return 10;
+    case 'b': case 'B': return 11;
+    case 'c': case 'C': return 12;
+    case 'd': case 'D': return 13;
+    case 'e': case 'E': return 14;
+    case 'f': case 'F': return 15;
+    default: return 0;
+    }
+}
+
+/* Split a line into arguments, where every argument can be in the
+ * following programming-language REPL-alike form:
+ *
+ * foo bar "newline are supported\n" and "\xff\x00otherstuff"
+ *
+ * The number of arguments is stored into *argc, and an array
+ * of hisds is returned.
+ *
+ * The caller should free the resulting array of hisds strings with
+ * hi_sdsfreesplitres().
+ *
+ * Note that hi_sdscatrepr() is able to convert back a string into
+ * a quoted string in the same format hi_sdssplitargs() is able to parse.
+ *
+ * The function returns the allocated tokens on success, even when the
+ * input string is empty, or NULL if the input contains unbalanced
+ * quotes or closed quotes followed by non space characters
+ * as in: "foo"bar or "foo'
+ */
+hisds *hi_sdssplitargs(const char *line, int *argc) {
+    const char *p = line;
+    char *current = NULL;
+    char **vector = NULL;
+
+    *argc = 0;
+    while(1) {
+        /* skip blanks */
+        while(*p && isspace(*p)) p++;
+        if (*p) {
+            /* get a token */
+            int inq=0;  /* set to 1 if we are in "quotes" */
+            int insq=0; /* set to 1 if we are in 'single quotes' */
+            int done=0;
+
+            if (current == NULL) current = hi_sdsempty();
+            while(!done) {
+                if (inq) {
+                    if (*p == '\\' && *(p+1) == 'x' &&
+                                             isxdigit(*(p+2)) &&
+                                             isxdigit(*(p+3)))
+                    {
+                        unsigned char byte;
+
+                        byte = (hi_hex_digit_to_int(*(p+2))*16)+
+                                hi_hex_digit_to_int(*(p+3));
+                        current = hi_sdscatlen(current,(char*)&byte,1);
+                        p += 3;
+                    } else if (*p == '\\' && *(p+1)) {
+                        char c;
+
+                        p++;
+                        switch(*p) {
+                        case 'n': c = '\n'; break;
+                        case 'r': c = '\r'; break;
+                        case 't': c = '\t'; break;
+                        case 'b': c = '\b'; break;
+                        case 'a': c = '\a'; break;
+                        default: c = *p; break;
+                        }
+                        current = hi_sdscatlen(current,&c,1);
+                    } else if (*p == '"') {
+                        /* closing quote must be followed by a space or
+                         * nothing at all. */
+                        if (*(p+1) && !isspace(*(p+1))) goto err;
+                        done=1;
+                    } else if (!*p) {
+                        /* unterminated quotes */
+                        goto err;
+                    } else {
+                        current = hi_sdscatlen(current,p,1);
+                    }
+                } else if (insq) {
+                    if (*p == '\\' && *(p+1) == '\'') {
+                        p++;
+                        current = hi_sdscatlen(current,"'",1);
+                    } else if (*p == '\'') {
+                        /* closing quote must be followed by a space or
+                         * nothing at all. */
+                        if (*(p+1) && !isspace(*(p+1))) goto err;
+                        done=1;
+                    } else if (!*p) {
+                        /* unterminated quotes */
+                        goto err;
+                    } else {
+                        current = hi_sdscatlen(current,p,1);
+                    }
+                } else {
+                    switch(*p) {
+                    case ' ':
+                    case '\n':
+                    case '\r':
+                    case '\t':
+                    case '\0':
+                        done=1;
+                        break;
+                    case '"':
+                        inq=1;
+                        break;
+                    case '\'':
+                        insq=1;
+                        break;
+                    default:
+                        current = hi_sdscatlen(current,p,1);
+                        break;
+                    }
+                }
+                if (*p) p++;
+            }
+            /* add the token to the vector */
+            {
+                char **new_vector = hi_s_realloc(vector,((*argc)+1)*sizeof(char*));
+                if (new_vector == NULL) {
+                    hi_s_free(vector);
+                    return NULL;
+                }
+
+                vector = new_vector;
+                vector[*argc] = current;
+                (*argc)++;
+                current = NULL;
+            }
+        } else {
+            /* Even on empty input string return something not NULL. */
+            if (vector == NULL) vector = hi_s_malloc(sizeof(void*));
+            return vector;
+        }
+    }
+
+err:
+    while((*argc)--)
+        hi_sdsfree(vector[*argc]);
+    hi_s_free(vector);
+    if (current) hi_sdsfree(current);
+    *argc = 0;
+    return NULL;
+}
+
+/* Modify the string substituting all the occurrences of the set of
+ * characters specified in the 'from' string to the corresponding character
+ * in the 'to' array.
+ *
+ * For instance: hi_sdsmapchars(mystring, "ho", "01", 2)
+ * will have the effect of turning the string "hello" into "0ell1".
+ *
+ * The function returns the hisds string pointer, that is always the same
+ * as the input pointer since no resize is needed. */
+hisds hi_sdsmapchars(hisds s, const char *from, const char *to, size_t setlen) {
+    size_t j, i, l = hi_sdslen(s);
+
+    for (j = 0; j < l; j++) {
+        for (i = 0; i < setlen; i++) {
+            if (s[j] == from[i]) {
+                s[j] = to[i];
+                break;
+            }
+        }
+    }
+    return s;
+}
+
+/* Join an array of C strings using the specified separator (also a C string).
+ * Returns the result as an hisds string. */
+hisds hi_sdsjoin(char **argv, int argc, char *sep) {
+    hisds join = hi_sdsempty();
+    int j;
+
+    for (j = 0; j < argc; j++) {
+        join = hi_sdscat(join, argv[j]);
+        if (j != argc-1) join = hi_sdscat(join,sep);
+    }
+    return join;
+}
+
+/* Like hi_sdsjoin, but joins an array of SDS strings. */
+hisds hi_sdsjoinsds(hisds *argv, int argc, const char *sep, size_t seplen) {
+    hisds join = hi_sdsempty();
+    int j;
+
+    for (j = 0; j < argc; j++) {
+        join = hi_sdscatsds(join, argv[j]);
+        if (j != argc-1) join = hi_sdscatlen(join,sep,seplen);
+    }
+    return join;
+}
+
+/* Wrappers to the allocators used by SDS. Note that SDS will actually
+ * just use the macros defined into sdsalloc.h in order to avoid to pay
+ * the overhead of function calls. Here we define these wrappers only for
+ * the programs SDS is linked to, if they want to touch the SDS internals
+ * even if they use a different allocator. */
+void *hi_sds_malloc(size_t size) { return hi_s_malloc(size); }
+void *hi_sds_realloc(void *ptr, size_t size) { return hi_s_realloc(ptr,size); }
+void hi_sds_free(void *ptr) { hi_s_free(ptr); }
+
+#if defined(HI_SDS_TEST_MAIN)
+#include <stdio.h>
+#include "testhelp.h"
+#include "limits.h"
+
+#define UNUSED(x) (void)(x)
+int hi_sdsTest(void) {
+    {
+        hisds x = hi_sdsnew("foo"), y;
+
+        test_cond("Create a string and obtain the length",
+            hi_sdslen(x) == 3 && memcmp(x,"foo\0",4) == 0)
+
+        hi_sdsfree(x);
+        x = hi_sdsnewlen("foo",2);
+        test_cond("Create a string with specified length",
+            hi_sdslen(x) == 2 && memcmp(x,"fo\0",3) == 0)
+
+        x = hi_sdscat(x,"bar");
+        test_cond("Strings concatenation",
+            hi_sdslen(x) == 5 && memcmp(x,"fobar\0",6) == 0);
+
+        x = hi_sdscpy(x,"a");
+        test_cond("hi_sdscpy() against an originally longer string",
+            hi_sdslen(x) == 1 && memcmp(x,"a\0",2) == 0)
+
+        x = hi_sdscpy(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk");
+        test_cond("hi_sdscpy() against an originally shorter string",
+            hi_sdslen(x) == 33 &&
+            memcmp(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\0",33) == 0)
+
+        hi_sdsfree(x);
+        x = hi_sdscatprintf(hi_sdsempty(),"%d",123);
+        test_cond("hi_sdscatprintf() seems working in the base case",
+            hi_sdslen(x) == 3 && memcmp(x,"123\0",4) == 0)
+
+        hi_sdsfree(x);
+        x = hi_sdsnew("--");
+        x = hi_sdscatfmt(x, "Hello %s World %I,%I--", "Hi!", LLONG_MIN,LLONG_MAX);
+        test_cond("hi_sdscatfmt() seems working in the base case",
+            hi_sdslen(x) == 60 &&
+            memcmp(x,"--Hello Hi! World -9223372036854775808,"
+                     "9223372036854775807--",60) == 0)
+        printf("[%s]\n",x);
+
+        hi_sdsfree(x);
+        x = hi_sdsnew("--");
+        x = hi_sdscatfmt(x, "%u,%U--", UINT_MAX, ULLONG_MAX);
+        test_cond("hi_sdscatfmt() seems working with unsigned numbers",
+            hi_sdslen(x) == 35 &&
+            memcmp(x,"--4294967295,18446744073709551615--",35) == 0)
+
+        hi_sdsfree(x);
+        x = hi_sdsnew(" x ");
+        hi_sdstrim(x," x");
+        test_cond("hi_sdstrim() works when all chars match",
+            hi_sdslen(x) == 0)
+
+        hi_sdsfree(x);
+        x = hi_sdsnew(" x ");
+        hi_sdstrim(x," ");
+        test_cond("hi_sdstrim() works when a single char remains",
+            hi_sdslen(x) == 1 && x[0] == 'x')
+
+        hi_sdsfree(x);
+        x = hi_sdsnew("xxciaoyyy");
+        hi_sdstrim(x,"xy");
+        test_cond("hi_sdstrim() correctly trims characters",
+            hi_sdslen(x) == 4 && memcmp(x,"ciao\0",5) == 0)
+
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,1,1);
+        test_cond("hi_sdsrange(...,1,1)",
+            hi_sdslen(y) == 1 && memcmp(y,"i\0",2) == 0)
+
+        hi_sdsfree(y);
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,1,-1);
+        test_cond("hi_sdsrange(...,1,-1)",
+            hi_sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0)
+
+        hi_sdsfree(y);
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,-2,-1);
+        test_cond("hi_sdsrange(...,-2,-1)",
+            hi_sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0)
+
+        hi_sdsfree(y);
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,2,1);
+        test_cond("hi_sdsrange(...,2,1)",
+            hi_sdslen(y) == 0 && memcmp(y,"\0",1) == 0)
+
+        hi_sdsfree(y);
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,1,100);
+        test_cond("hi_sdsrange(...,1,100)",
+            hi_sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0)
+
+        hi_sdsfree(y);
+        y = hi_sdsdup(x);
+        hi_sdsrange(y,100,100);
+        test_cond("hi_sdsrange(...,100,100)",
+            hi_sdslen(y) == 0 && memcmp(y,"\0",1) == 0)
+
+        hi_sdsfree(y);
+        hi_sdsfree(x);
+        x = hi_sdsnew("foo");
+        y = hi_sdsnew("foa");
+        test_cond("hi_sdscmp(foo,foa)", hi_sdscmp(x,y) > 0)
+
+        hi_sdsfree(y);
+        hi_sdsfree(x);
+        x = hi_sdsnew("bar");
+        y = hi_sdsnew("bar");
+        test_cond("hi_sdscmp(bar,bar)", hi_sdscmp(x,y) == 0)
+
+        hi_sdsfree(y);
+        hi_sdsfree(x);
+        x = hi_sdsnew("aar");
+        y = hi_sdsnew("bar");
+        test_cond("hi_sdscmp(bar,bar)", hi_sdscmp(x,y) < 0)
+
+        hi_sdsfree(y);
+        hi_sdsfree(x);
+        x = hi_sdsnewlen("\a\n\0foo\r",7);
+        y = hi_sdscatrepr(hi_sdsempty(),x,hi_sdslen(x));
+        test_cond("hi_sdscatrepr(...data...)",
+            memcmp(y,"\"\\a\\n\\x00foo\\r\"",15) == 0)
+
+        {
+            unsigned int oldfree;
+            char *p;
+            int step = 10, j, i;
+
+            hi_sdsfree(x);
+            hi_sdsfree(y);
+            x = hi_sdsnew("0");
+            test_cond("hi_sdsnew() free/len buffers", hi_sdslen(x) == 1 && hi_sdsavail(x) == 0);
+
+            /* Run the test a few times in order to hit the first two
+             * SDS header types. */
+            for (i = 0; i < 10; i++) {
+                int oldlen = hi_sdslen(x);
+                x = hi_sdsMakeRoomFor(x,step);
+                int type = x[-1]&HI_SDS_TYPE_MASK;
+
+                test_cond("sdsMakeRoomFor() len", hi_sdslen(x) == oldlen);
+                if (type != HI_SDS_TYPE_5) {
+                    test_cond("hi_sdsMakeRoomFor() free", hi_sdsavail(x) >= step);
+                    oldfree = hi_sdsavail(x);
+                }
+                p = x+oldlen;
+                for (j = 0; j < step; j++) {
+                    p[j] = 'A'+j;
+                }
+                hi_sdsIncrLen(x,step);
+            }
+            test_cond("hi_sdsMakeRoomFor() content",
+                memcmp("0ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ",x,101) == 0);
+            test_cond("sdsMakeRoomFor() final length",hi_sdslen(x)==101);
+
+            hi_sdsfree(x);
+        }
+    }
+    test_report();
+    return 0;
+}
+#endif
+
+#ifdef HI_SDS_TEST_MAIN
+int main(void) {
+    return hi_sdsTest();
+}
+#endif
diff --git a/redis-stable/deps/hiredis/sds.h b/redis-stable/deps/hiredis/sds.h
new file mode 100644
index 00000000..573d6dd1
--- /dev/null
+++ b/redis-stable/deps/hiredis/sds.h
@@ -0,0 +1,278 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Oran Agra
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef HIREDIS_SDS_H
+#define HIREDIS_SDS_H
+
+#define HI_SDS_MAX_PREALLOC (1024*1024)
+#ifdef _MSC_VER
+#define __attribute__(x)
+typedef long long ssize_t;
+#define SSIZE_MAX (LLONG_MAX >> 1)
+#endif
+
+#include <sys/types.h>
+#include <stdarg.h>
+#include <stdint.h>
+
+typedef char *hisds;
+
+/* Note: sdshdr5 is never used, we just access the flags byte directly.
+ * However is here to document the layout of type 5 SDS strings. */
+struct __attribute__ ((__packed__)) hisdshdr5 {
+    unsigned char flags; /* 3 lsb of type, and 5 msb of string length */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) hisdshdr8 {
+    uint8_t len; /* used */
+    uint8_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) hisdshdr16 {
+    uint16_t len; /* used */
+    uint16_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) hisdshdr32 {
+    uint32_t len; /* used */
+    uint32_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) hisdshdr64 {
+    uint64_t len; /* used */
+    uint64_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+
+#define HI_SDS_TYPE_5  0
+#define HI_SDS_TYPE_8  1
+#define HI_SDS_TYPE_16 2
+#define HI_SDS_TYPE_32 3
+#define HI_SDS_TYPE_64 4
+#define HI_SDS_TYPE_MASK 7
+#define HI_SDS_TYPE_BITS 3
+#define HI_SDS_HDR_VAR(T,s) struct hisdshdr##T *sh = (struct hisdshdr##T *)((s)-(sizeof(struct hisdshdr##T)));
+#define HI_SDS_HDR(T,s) ((struct hisdshdr##T *)((s)-(sizeof(struct hisdshdr##T))))
+#define HI_SDS_TYPE_5_LEN(f) ((f)>>HI_SDS_TYPE_BITS)
+
+static inline size_t hi_sdslen(const hisds s) {
+    unsigned char flags = s[-1];
+    switch(flags & HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            return HI_SDS_TYPE_5_LEN(flags);
+        case HI_SDS_TYPE_8:
+            return HI_SDS_HDR(8,s)->len;
+        case HI_SDS_TYPE_16:
+            return HI_SDS_HDR(16,s)->len;
+        case HI_SDS_TYPE_32:
+            return HI_SDS_HDR(32,s)->len;
+        case HI_SDS_TYPE_64:
+            return HI_SDS_HDR(64,s)->len;
+    }
+    return 0;
+}
+
+static inline size_t hi_sdsavail(const hisds s) {
+    unsigned char flags = s[-1];
+    switch(flags&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5: {
+            return 0;
+        }
+        case HI_SDS_TYPE_8: {
+            HI_SDS_HDR_VAR(8,s);
+            return sh->alloc - sh->len;
+        }
+        case HI_SDS_TYPE_16: {
+            HI_SDS_HDR_VAR(16,s);
+            return sh->alloc - sh->len;
+        }
+        case HI_SDS_TYPE_32: {
+            HI_SDS_HDR_VAR(32,s);
+            return sh->alloc - sh->len;
+        }
+        case HI_SDS_TYPE_64: {
+            HI_SDS_HDR_VAR(64,s);
+            return sh->alloc - sh->len;
+        }
+    }
+    return 0;
+}
+
+static inline void hi_sdssetlen(hisds s, size_t newlen) {
+    unsigned char flags = s[-1];
+    switch(flags&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            {
+                unsigned char *fp = ((unsigned char*)s)-1;
+                *fp = (unsigned char)(HI_SDS_TYPE_5 | (newlen << HI_SDS_TYPE_BITS));
+            }
+            break;
+        case HI_SDS_TYPE_8:
+            HI_SDS_HDR(8,s)->len = (uint8_t)newlen;
+            break;
+        case HI_SDS_TYPE_16:
+            HI_SDS_HDR(16,s)->len = (uint16_t)newlen;
+            break;
+        case HI_SDS_TYPE_32:
+            HI_SDS_HDR(32,s)->len = (uint32_t)newlen;
+            break;
+        case HI_SDS_TYPE_64:
+            HI_SDS_HDR(64,s)->len = (uint64_t)newlen;
+            break;
+    }
+}
+
+static inline void hi_sdsinclen(hisds s, size_t inc) {
+    unsigned char flags = s[-1];
+    switch(flags&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            {
+                unsigned char *fp = ((unsigned char*)s)-1;
+                unsigned char newlen = HI_SDS_TYPE_5_LEN(flags)+(unsigned char)inc;
+                *fp = HI_SDS_TYPE_5 | (newlen << HI_SDS_TYPE_BITS);
+            }
+            break;
+        case HI_SDS_TYPE_8:
+            HI_SDS_HDR(8,s)->len += (uint8_t)inc;
+            break;
+        case HI_SDS_TYPE_16:
+            HI_SDS_HDR(16,s)->len += (uint16_t)inc;
+            break;
+        case HI_SDS_TYPE_32:
+            HI_SDS_HDR(32,s)->len += (uint32_t)inc;
+            break;
+        case HI_SDS_TYPE_64:
+            HI_SDS_HDR(64,s)->len += (uint64_t)inc;
+            break;
+    }
+}
+
+/* hi_sdsalloc() = hi_sdsavail() + hi_sdslen() */
+static inline size_t hi_sdsalloc(const hisds s) {
+    unsigned char flags = s[-1];
+    switch(flags & HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            return HI_SDS_TYPE_5_LEN(flags);
+        case HI_SDS_TYPE_8:
+            return HI_SDS_HDR(8,s)->alloc;
+        case HI_SDS_TYPE_16:
+            return HI_SDS_HDR(16,s)->alloc;
+        case HI_SDS_TYPE_32:
+            return HI_SDS_HDR(32,s)->alloc;
+        case HI_SDS_TYPE_64:
+            return HI_SDS_HDR(64,s)->alloc;
+    }
+    return 0;
+}
+
+static inline void hi_sdssetalloc(hisds s, size_t newlen) {
+    unsigned char flags = s[-1];
+    switch(flags&HI_SDS_TYPE_MASK) {
+        case HI_SDS_TYPE_5:
+            /* Nothing to do, this type has no total allocation info. */
+            break;
+        case HI_SDS_TYPE_8:
+            HI_SDS_HDR(8,s)->alloc = (uint8_t)newlen;
+            break;
+        case HI_SDS_TYPE_16:
+            HI_SDS_HDR(16,s)->alloc = (uint16_t)newlen;
+            break;
+        case HI_SDS_TYPE_32:
+            HI_SDS_HDR(32,s)->alloc = (uint32_t)newlen;
+            break;
+        case HI_SDS_TYPE_64:
+            HI_SDS_HDR(64,s)->alloc = (uint64_t)newlen;
+            break;
+    }
+}
+
+hisds hi_sdsnewlen(const void *init, size_t initlen);
+hisds hi_sdsnew(const char *init);
+hisds hi_sdsempty(void);
+hisds hi_sdsdup(const hisds s);
+void  hi_sdsfree(hisds s);
+hisds hi_sdsgrowzero(hisds s, size_t len);
+hisds hi_sdscatlen(hisds s, const void *t, size_t len);
+hisds hi_sdscat(hisds s, const char *t);
+hisds hi_sdscatsds(hisds s, const hisds t);
+hisds hi_sdscpylen(hisds s, const char *t, size_t len);
+hisds hi_sdscpy(hisds s, const char *t);
+
+hisds hi_sdscatvprintf(hisds s, const char *fmt, va_list ap);
+#ifdef __GNUC__
+hisds hi_sdscatprintf(hisds s, const char *fmt, ...)
+    __attribute__((format(printf, 2, 3)));
+#else
+hisds hi_sdscatprintf(hisds s, const char *fmt, ...);
+#endif
+
+hisds hi_sdscatfmt(hisds s, char const *fmt, ...);
+hisds hi_sdstrim(hisds s, const char *cset);
+int hi_sdsrange(hisds s, ssize_t start, ssize_t end);
+void hi_sdsupdatelen(hisds s);
+void hi_sdsclear(hisds s);
+int hi_sdscmp(const hisds s1, const hisds s2);
+hisds *hi_sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count);
+void hi_sdsfreesplitres(hisds *tokens, int count);
+void hi_sdstolower(hisds s);
+void hi_sdstoupper(hisds s);
+hisds hi_sdsfromlonglong(long long value);
+hisds hi_sdscatrepr(hisds s, const char *p, size_t len);
+hisds *hi_sdssplitargs(const char *line, int *argc);
+hisds hi_sdsmapchars(hisds s, const char *from, const char *to, size_t setlen);
+hisds hi_sdsjoin(char **argv, int argc, char *sep);
+hisds hi_sdsjoinsds(hisds *argv, int argc, const char *sep, size_t seplen);
+
+/* Low level functions exposed to the user API */
+hisds hi_sdsMakeRoomFor(hisds s, size_t addlen);
+void hi_sdsIncrLen(hisds s, int incr);
+hisds hi_sdsRemoveFreeSpace(hisds s);
+size_t hi_sdsAllocSize(hisds s);
+void *hi_sdsAllocPtr(hisds s);
+
+/* Export the allocator used by SDS to the program using SDS.
+ * Sometimes the program SDS is linked to, may use a different set of
+ * allocators, but may want to allocate or free things that SDS will
+ * respectively free or allocate. */
+void *hi_sds_malloc(size_t size);
+void *hi_sds_realloc(void *ptr, size_t size);
+void hi_sds_free(void *ptr);
+
+#ifdef REDIS_TEST
+int hi_sdsTest(int argc, char *argv[]);
+#endif
+
+#endif /* HIREDIS_SDS_H */
diff --git a/redis-stable/deps/hiredis/sdsalloc.h b/redis-stable/deps/hiredis/sdsalloc.h
new file mode 100644
index 00000000..c9dcc3df
--- /dev/null
+++ b/redis-stable/deps/hiredis/sdsalloc.h
@@ -0,0 +1,44 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Oran Agra
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* SDS allocator selection.
+ *
+ * This file is used in order to change the SDS allocator at compile time.
+ * Just define the following defines to what you want to use. Also add
+ * the include of your alternate allocator if needed (not needed in order
+ * to use the default libc allocator). */
+
+#include "alloc.h"
+
+#define hi_s_malloc hi_malloc
+#define hi_s_realloc hi_realloc
+#define hi_s_free hi_free
diff --git a/redis-stable/deps/hiredis/sdscompat.h b/redis-stable/deps/hiredis/sdscompat.h
new file mode 100644
index 00000000..e5a2574f
--- /dev/null
+++ b/redis-stable/deps/hiredis/sdscompat.h
@@ -0,0 +1,94 @@
+/*
+ * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*
+ * SDS compatibility header.
+ *
+ * This simple file maps sds types and calls to their unique hiredis symbol names.
+ * It's useful when we build Hiredis as a dependency of Redis and want to call
+ * Hiredis' sds symbols rather than the ones built into Redis, as the libraries
+ * have slightly diverged and could cause hard to track down ABI incompatibility
+ * bugs.
+ *
+ */
+
+#ifndef HIREDIS_SDS_COMPAT
+#define HIREDIS_SDS_COMPAT
+
+#define sds hisds
+
+#define sdslen hi_sdslen
+#define sdsavail hi_sdsavail
+#define sdssetlen hi_sdssetlen
+#define sdsinclen hi_sdsinclen
+#define sdsalloc hi_sdsalloc
+#define sdssetalloc hi_sdssetalloc
+
+#define sdsAllocPtr hi_sdsAllocPtr
+#define sdsAllocSize hi_sdsAllocSize
+#define sdscat hi_sdscat
+#define sdscatfmt hi_sdscatfmt
+#define sdscatlen hi_sdscatlen
+#define sdscatprintf hi_sdscatprintf
+#define sdscatrepr hi_sdscatrepr
+#define sdscatsds hi_sdscatsds
+#define sdscatvprintf hi_sdscatvprintf
+#define sdsclear hi_sdsclear
+#define sdscmp hi_sdscmp
+#define sdscpy hi_sdscpy
+#define sdscpylen hi_sdscpylen
+#define sdsdup hi_sdsdup
+#define sdsempty hi_sdsempty
+#define sds_free hi_sds_free
+#define sdsfree hi_sdsfree
+#define sdsfreesplitres hi_sdsfreesplitres
+#define sdsfromlonglong hi_sdsfromlonglong
+#define sdsgrowzero hi_sdsgrowzero
+#define sdsIncrLen hi_sdsIncrLen
+#define sdsjoin hi_sdsjoin
+#define sdsjoinsds hi_sdsjoinsds
+#define sdsll2str hi_sdsll2str
+#define sdsMakeRoomFor hi_sdsMakeRoomFor
+#define sds_malloc hi_sds_malloc
+#define sdsmapchars hi_sdsmapchars
+#define sdsnew hi_sdsnew
+#define sdsnewlen hi_sdsnewlen
+#define sdsrange hi_sdsrange
+#define sds_realloc hi_sds_realloc
+#define sdsRemoveFreeSpace hi_sdsRemoveFreeSpace
+#define sdssplitargs hi_sdssplitargs
+#define sdssplitlen hi_sdssplitlen
+#define sdstolower hi_sdstolower
+#define sdstoupper hi_sdstoupper
+#define sdstrim hi_sdstrim
+#define sdsull2str hi_sdsull2str
+#define sdsupdatelen hi_sdsupdatelen
+
+#endif /* HIREDIS_SDS_COMPAT */
diff --git a/redis-stable/deps/hiredis/sockcompat.c b/redis-stable/deps/hiredis/sockcompat.c
new file mode 100644
index 00000000..f99d14b0
--- /dev/null
+++ b/redis-stable/deps/hiredis/sockcompat.c
@@ -0,0 +1,248 @@
+/*
+ * Copyright (c) 2019, Marcus Geelnard <m at bitsnbites dot eu>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDIS_SOCKCOMPAT_IMPLEMENTATION
+#include "sockcompat.h"
+
+#ifdef _WIN32
+static int _wsaErrorToErrno(int err) {
+    switch (err) {
+        case WSAEWOULDBLOCK:
+            return EWOULDBLOCK;
+        case WSAEINPROGRESS:
+            return EINPROGRESS;
+        case WSAEALREADY:
+            return EALREADY;
+        case WSAENOTSOCK:
+            return ENOTSOCK;
+        case WSAEDESTADDRREQ:
+            return EDESTADDRREQ;
+        case WSAEMSGSIZE:
+            return EMSGSIZE;
+        case WSAEPROTOTYPE:
+            return EPROTOTYPE;
+        case WSAENOPROTOOPT:
+            return ENOPROTOOPT;
+        case WSAEPROTONOSUPPORT:
+            return EPROTONOSUPPORT;
+        case WSAEOPNOTSUPP:
+            return EOPNOTSUPP;
+        case WSAEAFNOSUPPORT:
+            return EAFNOSUPPORT;
+        case WSAEADDRINUSE:
+            return EADDRINUSE;
+        case WSAEADDRNOTAVAIL:
+            return EADDRNOTAVAIL;
+        case WSAENETDOWN:
+            return ENETDOWN;
+        case WSAENETUNREACH:
+            return ENETUNREACH;
+        case WSAENETRESET:
+            return ENETRESET;
+        case WSAECONNABORTED:
+            return ECONNABORTED;
+        case WSAECONNRESET:
+            return ECONNRESET;
+        case WSAENOBUFS:
+            return ENOBUFS;
+        case WSAEISCONN:
+            return EISCONN;
+        case WSAENOTCONN:
+            return ENOTCONN;
+        case WSAETIMEDOUT:
+            return ETIMEDOUT;
+        case WSAECONNREFUSED:
+            return ECONNREFUSED;
+        case WSAELOOP:
+            return ELOOP;
+        case WSAENAMETOOLONG:
+            return ENAMETOOLONG;
+        case WSAEHOSTUNREACH:
+            return EHOSTUNREACH;
+        case WSAENOTEMPTY:
+            return ENOTEMPTY;
+        default:
+            /* We just return a generic I/O error if we could not find a relevant error. */
+            return EIO;
+    }
+}
+
+static void _updateErrno(int success) {
+    errno = success ? 0 : _wsaErrorToErrno(WSAGetLastError());
+}
+
+static int _initWinsock() {
+    static int s_initialized = 0;
+    if (!s_initialized) {
+        static WSADATA wsadata;
+        int err = WSAStartup(MAKEWORD(2,2), &wsadata);
+        if (err != 0) {
+            errno = _wsaErrorToErrno(err);
+            return 0;
+        }
+        s_initialized = 1;
+    }
+    return 1;
+}
+
+int win32_getaddrinfo(const char *node, const char *service, const struct addrinfo *hints, struct addrinfo **res) {
+    /* Note: This function is likely to be called before other functions, so run init here. */
+    if (!_initWinsock()) {
+        return EAI_FAIL;
+    }
+
+    switch (getaddrinfo(node, service, hints, res)) {
+        case 0:                     return 0;
+        case WSATRY_AGAIN:          return EAI_AGAIN;
+        case WSAEINVAL:             return EAI_BADFLAGS;
+        case WSAEAFNOSUPPORT:       return EAI_FAMILY;
+        case WSA_NOT_ENOUGH_MEMORY: return EAI_MEMORY;
+        case WSAHOST_NOT_FOUND:     return EAI_NONAME;
+        case WSATYPE_NOT_FOUND:     return EAI_SERVICE;
+        case WSAESOCKTNOSUPPORT:    return EAI_SOCKTYPE;
+        default:                    return EAI_FAIL;     /* Including WSANO_RECOVERY */
+    }
+}
+
+const char *win32_gai_strerror(int errcode) {
+    switch (errcode) {
+        case 0:            errcode = 0;                     break;
+        case EAI_AGAIN:    errcode = WSATRY_AGAIN;          break;
+        case EAI_BADFLAGS: errcode = WSAEINVAL;             break;
+        case EAI_FAMILY:   errcode = WSAEAFNOSUPPORT;       break;
+        case EAI_MEMORY:   errcode = WSA_NOT_ENOUGH_MEMORY; break;
+        case EAI_NONAME:   errcode = WSAHOST_NOT_FOUND;     break;
+        case EAI_SERVICE:  errcode = WSATYPE_NOT_FOUND;     break;
+        case EAI_SOCKTYPE: errcode = WSAESOCKTNOSUPPORT;    break;
+        default:           errcode = WSANO_RECOVERY;        break; /* Including EAI_FAIL */
+    }
+    return gai_strerror(errcode);
+}
+
+void win32_freeaddrinfo(struct addrinfo *res) {
+    freeaddrinfo(res);
+}
+
+SOCKET win32_socket(int domain, int type, int protocol) {
+    SOCKET s;
+
+    /* Note: This function is likely to be called before other functions, so run init here. */
+    if (!_initWinsock()) {
+        return INVALID_SOCKET;
+    }
+
+    _updateErrno((s = socket(domain, type, protocol)) != INVALID_SOCKET);
+    return s;
+}
+
+int win32_ioctl(SOCKET fd, unsigned long request, unsigned long *argp) {
+    int ret = ioctlsocket(fd, (long)request, argp);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_bind(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen) {
+    int ret = bind(sockfd, addr, addrlen);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_connect(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen) {
+    int ret = connect(sockfd, addr, addrlen);
+    _updateErrno(ret != SOCKET_ERROR);
+
+    /* For Winsock connect(), the WSAEWOULDBLOCK error means the same thing as
+     * EINPROGRESS for POSIX connect(), so we do that translation to keep POSIX
+     * logic consistent. */
+    if (errno == EWOULDBLOCK) {
+        errno = EINPROGRESS;
+    }
+
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_getsockopt(SOCKET sockfd, int level, int optname, void *optval, socklen_t *optlen) {
+    int ret = 0;
+    if ((level == SOL_SOCKET) && ((optname == SO_RCVTIMEO) || (optname == SO_SNDTIMEO))) {
+        if (*optlen >= sizeof (struct timeval)) {
+            struct timeval *tv = optval;
+            DWORD timeout = 0;
+            socklen_t dwlen = 0;
+            ret = getsockopt(sockfd, level, optname, (char *)&timeout, &dwlen);
+            tv->tv_sec = timeout / 1000;
+            tv->tv_usec = (timeout * 1000) % 1000000;
+        } else {
+            ret = WSAEFAULT;
+        }
+        *optlen = sizeof (struct timeval);
+    } else {
+        ret = getsockopt(sockfd, level, optname, (char*)optval, optlen);
+    }
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_setsockopt(SOCKET sockfd, int level, int optname, const void *optval, socklen_t optlen) {
+    int ret = 0;
+    if ((level == SOL_SOCKET) && ((optname == SO_RCVTIMEO) || (optname == SO_SNDTIMEO))) {
+        const struct timeval *tv = optval;
+        DWORD timeout = tv->tv_sec * 1000 + tv->tv_usec / 1000;
+        ret = setsockopt(sockfd, level, optname, (const char*)&timeout, sizeof(DWORD));
+    } else {
+        ret = setsockopt(sockfd, level, optname, (const char*)optval, optlen);
+    }
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_close(SOCKET fd) {
+    int ret = closesocket(fd);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+ssize_t win32_recv(SOCKET sockfd, void *buf, size_t len, int flags) {
+    int ret = recv(sockfd, (char*)buf, (int)len, flags);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+ssize_t win32_send(SOCKET sockfd, const void *buf, size_t len, int flags) {
+    int ret = send(sockfd, (const char*)buf, (int)len, flags);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+
+int win32_poll(struct pollfd *fds, nfds_t nfds, int timeout) {
+    int ret = WSAPoll(fds, nfds, timeout);
+    _updateErrno(ret != SOCKET_ERROR);
+    return ret != SOCKET_ERROR ? ret : -1;
+}
+#endif /* _WIN32 */
diff --git a/redis-stable/deps/hiredis/sockcompat.h b/redis-stable/deps/hiredis/sockcompat.h
new file mode 100644
index 00000000..85810e84
--- /dev/null
+++ b/redis-stable/deps/hiredis/sockcompat.h
@@ -0,0 +1,92 @@
+/*
+ * Copyright (c) 2019, Marcus Geelnard <m at bitsnbites dot eu>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __SOCKCOMPAT_H
+#define __SOCKCOMPAT_H
+
+#ifndef _WIN32
+/* For POSIX systems we use the standard BSD socket API. */
+#include <unistd.h>
+#include <sys/socket.h>
+#include <sys/select.h>
+#include <sys/un.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <arpa/inet.h>
+#include <netdb.h>
+#include <poll.h>
+#else
+/* For Windows we use winsock. */
+#undef _WIN32_WINNT
+#define _WIN32_WINNT 0x0600 /* To get WSAPoll etc. */
+#include <winsock2.h>
+#include <ws2tcpip.h>
+#include <stddef.h>
+#include <errno.h>
+
+#ifdef _MSC_VER
+typedef long long ssize_t;
+#endif
+
+/* Emulate the parts of the BSD socket API that we need (override the winsock signatures). */
+int win32_getaddrinfo(const char *node, const char *service, const struct addrinfo *hints, struct addrinfo **res);
+const char *win32_gai_strerror(int errcode);
+void win32_freeaddrinfo(struct addrinfo *res);
+SOCKET win32_socket(int domain, int type, int protocol);
+int win32_ioctl(SOCKET fd, unsigned long request, unsigned long *argp);
+int win32_bind(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen);
+int win32_connect(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen);
+int win32_getsockopt(SOCKET sockfd, int level, int optname, void *optval, socklen_t *optlen);
+int win32_setsockopt(SOCKET sockfd, int level, int optname, const void *optval, socklen_t optlen);
+int win32_close(SOCKET fd);
+ssize_t win32_recv(SOCKET sockfd, void *buf, size_t len, int flags);
+ssize_t win32_send(SOCKET sockfd, const void *buf, size_t len, int flags);
+typedef ULONG nfds_t;
+int win32_poll(struct pollfd *fds, nfds_t nfds, int timeout);
+
+#ifndef REDIS_SOCKCOMPAT_IMPLEMENTATION
+#define getaddrinfo(node, service, hints, res) win32_getaddrinfo(node, service, hints, res)
+#undef gai_strerror
+#define gai_strerror(errcode) win32_gai_strerror(errcode)
+#define freeaddrinfo(res) win32_freeaddrinfo(res)
+#define socket(domain, type, protocol) win32_socket(domain, type, protocol)
+#define ioctl(fd, request, argp) win32_ioctl(fd, request, argp)
+#define bind(sockfd, addr, addrlen) win32_bind(sockfd, addr, addrlen)
+#define connect(sockfd, addr, addrlen) win32_connect(sockfd, addr, addrlen)
+#define getsockopt(sockfd, level, optname, optval, optlen) win32_getsockopt(sockfd, level, optname, optval, optlen)
+#define setsockopt(sockfd, level, optname, optval, optlen) win32_setsockopt(sockfd, level, optname, optval, optlen)
+#define close(fd) win32_close(fd)
+#define recv(sockfd, buf, len, flags) win32_recv(sockfd, buf, len, flags)
+#define send(sockfd, buf, len, flags) win32_send(sockfd, buf, len, flags)
+#define poll(fds, nfds, timeout) win32_poll(fds, nfds, timeout)
+#endif /* REDIS_SOCKCOMPAT_IMPLEMENTATION */
+#endif /* _WIN32 */
+
+#endif /* __SOCKCOMPAT_H */
diff --git a/redis-stable/deps/hiredis/ssl.c b/redis-stable/deps/hiredis/ssl.c
new file mode 100644
index 00000000..fe9a2fdc
--- /dev/null
+++ b/redis-stable/deps/hiredis/ssl.c
@@ -0,0 +1,526 @@
+/*
+ * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2019, Redis Labs
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "hiredis.h"
+#include "async.h"
+
+#include <assert.h>
+#include <errno.h>
+#include <string.h>
+#ifdef _WIN32
+#include <windows.h>
+#else
+#include <pthread.h>
+#endif
+
+#include <openssl/ssl.h>
+#include <openssl/err.h>
+
+#include "win32.h"
+#include "async_private.h"
+#include "hiredis_ssl.h"
+
+void __redisSetError(redisContext *c, int type, const char *str);
+
+struct redisSSLContext {
+    /* Associated OpenSSL SSL_CTX as created by redisCreateSSLContext() */
+    SSL_CTX *ssl_ctx;
+
+    /* Requested SNI, or NULL */
+    char *server_name;
+};
+
+/* The SSL connection context is attached to SSL/TLS connections as a privdata. */
+typedef struct redisSSL {
+    /**
+     * OpenSSL SSL object.
+     */
+    SSL *ssl;
+
+    /**
+     * SSL_write() requires to be called again with the same arguments it was
+     * previously called with in the event of an SSL_read/SSL_write situation
+     */
+    size_t lastLen;
+
+    /** Whether the SSL layer requires read (possibly before a write) */
+    int wantRead;
+
+    /**
+     * Whether a write was requested prior to a read. If set, the write()
+     * should resume whenever a read takes place, if possible
+     */
+    int pendingWrite;
+} redisSSL;
+
+/* Forward declaration */
+redisContextFuncs redisContextSSLFuncs;
+
+/**
+ * OpenSSL global initialization and locking handling callbacks.
+ * Note that this is only required for OpenSSL < 1.1.0.
+ */
+
+#if OPENSSL_VERSION_NUMBER < 0x10100000L
+#define HIREDIS_USE_CRYPTO_LOCKS
+#endif
+
+#ifdef HIREDIS_USE_CRYPTO_LOCKS
+#ifdef _WIN32
+typedef CRITICAL_SECTION sslLockType;
+static void sslLockInit(sslLockType* l) {
+    InitializeCriticalSection(l);
+}
+static void sslLockAcquire(sslLockType* l) {
+    EnterCriticalSection(l);
+}
+static void sslLockRelease(sslLockType* l) {
+    LeaveCriticalSection(l);
+}
+#else
+typedef pthread_mutex_t sslLockType;
+static void sslLockInit(sslLockType *l) {
+    pthread_mutex_init(l, NULL);
+}
+static void sslLockAcquire(sslLockType *l) {
+    pthread_mutex_lock(l);
+}
+static void sslLockRelease(sslLockType *l) {
+    pthread_mutex_unlock(l);
+}
+#endif
+
+static sslLockType* ossl_locks;
+
+static void opensslDoLock(int mode, int lkid, const char *f, int line) {
+    sslLockType *l = ossl_locks + lkid;
+
+    if (mode & CRYPTO_LOCK) {
+        sslLockAcquire(l);
+    } else {
+        sslLockRelease(l);
+    }
+
+    (void)f;
+    (void)line;
+}
+
+static int initOpensslLocks(void) {
+    unsigned ii, nlocks;
+    if (CRYPTO_get_locking_callback() != NULL) {
+        /* Someone already set the callback before us. Don't destroy it! */
+        return REDIS_OK;
+    }
+    nlocks = CRYPTO_num_locks();
+    ossl_locks = hi_malloc(sizeof(*ossl_locks) * nlocks);
+    if (ossl_locks == NULL)
+        return REDIS_ERR;
+
+    for (ii = 0; ii < nlocks; ii++) {
+        sslLockInit(ossl_locks + ii);
+    }
+    CRYPTO_set_locking_callback(opensslDoLock);
+    return REDIS_OK;
+}
+#endif /* HIREDIS_USE_CRYPTO_LOCKS */
+
+int redisInitOpenSSL(void)
+{
+    SSL_library_init();
+#ifdef HIREDIS_USE_CRYPTO_LOCKS
+    initOpensslLocks();
+#endif
+
+    return REDIS_OK;
+}
+
+/**
+ * redisSSLContext helper context destruction.
+ */
+
+const char *redisSSLContextGetError(redisSSLContextError error)
+{
+    switch (error) {
+        case REDIS_SSL_CTX_NONE:
+            return "No Error";
+        case REDIS_SSL_CTX_CREATE_FAILED:
+            return "Failed to create OpenSSL SSL_CTX";
+        case REDIS_SSL_CTX_CERT_KEY_REQUIRED:
+            return "Client cert and key must both be specified or skipped";
+        case REDIS_SSL_CTX_CA_CERT_LOAD_FAILED:
+            return "Failed to load CA Certificate or CA Path";
+        case REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED:
+            return "Failed to load client certificate";
+        case REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED:
+            return "Failed to load private key";
+        default:
+            return "Unknown error code";
+    }
+}
+
+void redisFreeSSLContext(redisSSLContext *ctx)
+{
+    if (!ctx)
+        return;
+
+    if (ctx->server_name) {
+        hi_free(ctx->server_name);
+        ctx->server_name = NULL;
+    }
+
+    if (ctx->ssl_ctx) {
+        SSL_CTX_free(ctx->ssl_ctx);
+        ctx->ssl_ctx = NULL;
+    }
+
+    hi_free(ctx);
+}
+
+
+/**
+ * redisSSLContext helper context initialization.
+ */
+
+redisSSLContext *redisCreateSSLContext(const char *cacert_filename, const char *capath,
+        const char *cert_filename, const char *private_key_filename,
+        const char *server_name, redisSSLContextError *error)
+{
+    redisSSLContext *ctx = hi_calloc(1, sizeof(redisSSLContext));
+    if (ctx == NULL)
+        goto error;
+
+    ctx->ssl_ctx = SSL_CTX_new(SSLv23_client_method());
+    if (!ctx->ssl_ctx) {
+        if (error) *error = REDIS_SSL_CTX_CREATE_FAILED;
+        goto error;
+    }
+
+    SSL_CTX_set_options(ctx->ssl_ctx, SSL_OP_NO_SSLv2 | SSL_OP_NO_SSLv3);
+    SSL_CTX_set_verify(ctx->ssl_ctx, SSL_VERIFY_PEER, NULL);
+
+    if ((cert_filename != NULL && private_key_filename == NULL) ||
+            (private_key_filename != NULL && cert_filename == NULL)) {
+        if (error) *error = REDIS_SSL_CTX_CERT_KEY_REQUIRED;
+        goto error;
+    }
+
+    if (capath || cacert_filename) {
+        if (!SSL_CTX_load_verify_locations(ctx->ssl_ctx, cacert_filename, capath)) {
+            if (error) *error = REDIS_SSL_CTX_CA_CERT_LOAD_FAILED;
+            goto error;
+        }
+    }
+
+    if (cert_filename) {
+        if (!SSL_CTX_use_certificate_chain_file(ctx->ssl_ctx, cert_filename)) {
+            if (error) *error = REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED;
+            goto error;
+        }
+        if (!SSL_CTX_use_PrivateKey_file(ctx->ssl_ctx, private_key_filename, SSL_FILETYPE_PEM)) {
+            if (error) *error = REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED;
+            goto error;
+        }
+    }
+
+    if (server_name)
+        ctx->server_name = hi_strdup(server_name);
+
+    return ctx;
+
+error:
+    redisFreeSSLContext(ctx);
+    return NULL;
+}
+
+/**
+ * SSL Connection initialization.
+ */
+
+
+static int redisSSLConnect(redisContext *c, SSL *ssl) {
+    if (c->privctx) {
+        __redisSetError(c, REDIS_ERR_OTHER, "redisContext was already associated");
+        return REDIS_ERR;
+    }
+
+    redisSSL *rssl = hi_calloc(1, sizeof(redisSSL));
+    if (rssl == NULL) {
+        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
+        return REDIS_ERR;
+    }
+
+    c->funcs = &redisContextSSLFuncs;
+    rssl->ssl = ssl;
+
+    SSL_set_mode(rssl->ssl, SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
+    SSL_set_fd(rssl->ssl, c->fd);
+    SSL_set_connect_state(rssl->ssl);
+
+    ERR_clear_error();
+    int rv = SSL_connect(rssl->ssl);
+    if (rv == 1) {
+        c->privctx = rssl;
+        return REDIS_OK;
+    }
+
+    rv = SSL_get_error(rssl->ssl, rv);
+    if (((c->flags & REDIS_BLOCK) == 0) &&
+        (rv == SSL_ERROR_WANT_READ || rv == SSL_ERROR_WANT_WRITE)) {
+        c->privctx = rssl;
+        return REDIS_OK;
+    }
+
+    if (c->err == 0) {
+        char err[512];
+        if (rv == SSL_ERROR_SYSCALL)
+            snprintf(err,sizeof(err)-1,"SSL_connect failed: %s",strerror(errno));
+        else {
+            unsigned long e = ERR_peek_last_error();
+            snprintf(err,sizeof(err)-1,"SSL_connect failed: %s",
+                    ERR_reason_error_string(e));
+        }
+        __redisSetError(c, REDIS_ERR_IO, err);
+    }
+
+    hi_free(rssl);
+    return REDIS_ERR;
+}
+
+/**
+ * A wrapper around redisSSLConnect() for users who manage their own context and
+ * create their own SSL object.
+ */
+
+int redisInitiateSSL(redisContext *c, SSL *ssl) {
+    return redisSSLConnect(c, ssl);
+}
+
+/**
+ * A wrapper around redisSSLConnect() for users who use redisSSLContext and don't
+ * manage their own SSL objects.
+ */
+
+int redisInitiateSSLWithContext(redisContext *c, redisSSLContext *redis_ssl_ctx)
+{
+    if (!c || !redis_ssl_ctx)
+        return REDIS_ERR;
+
+    /* We want to verify that redisSSLConnect() won't fail on this, as it will
+     * not own the SSL object in that case and we'll end up leaking.
+     */
+    if (c->privctx)
+        return REDIS_ERR;
+
+    SSL *ssl = SSL_new(redis_ssl_ctx->ssl_ctx);
+    if (!ssl) {
+        __redisSetError(c, REDIS_ERR_OTHER, "Couldn't create new SSL instance");
+        goto error;
+    }
+
+    if (redis_ssl_ctx->server_name) {
+        if (!SSL_set_tlsext_host_name(ssl, redis_ssl_ctx->server_name)) {
+            __redisSetError(c, REDIS_ERR_OTHER, "Failed to set server_name/SNI");
+            goto error;
+        }
+    }
+
+    return redisSSLConnect(c, ssl);
+
+error:
+    if (ssl)
+        SSL_free(ssl);
+    return REDIS_ERR;
+}
+
+static int maybeCheckWant(redisSSL *rssl, int rv) {
+    /**
+     * If the error is WANT_READ or WANT_WRITE, the appropriate flags are set
+     * and true is returned. False is returned otherwise
+     */
+    if (rv == SSL_ERROR_WANT_READ) {
+        rssl->wantRead = 1;
+        return 1;
+    } else if (rv == SSL_ERROR_WANT_WRITE) {
+        rssl->pendingWrite = 1;
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/**
+ * Implementation of redisContextFuncs for SSL connections.
+ */
+
+static void redisSSLFree(void *privctx){
+    redisSSL *rsc = privctx;
+
+    if (!rsc) return;
+    if (rsc->ssl) {
+        SSL_free(rsc->ssl);
+        rsc->ssl = NULL;
+    }
+    hi_free(rsc);
+}
+
+static ssize_t redisSSLRead(redisContext *c, char *buf, size_t bufcap) {
+    redisSSL *rssl = c->privctx;
+
+    int nread = SSL_read(rssl->ssl, buf, bufcap);
+    if (nread > 0) {
+        return nread;
+    } else if (nread == 0) {
+        __redisSetError(c, REDIS_ERR_EOF, "Server closed the connection");
+        return -1;
+    } else {
+        int err = SSL_get_error(rssl->ssl, nread);
+        if (c->flags & REDIS_BLOCK) {
+            /**
+             * In blocking mode, we should never end up in a situation where
+             * we get an error without it being an actual error, except
+             * in the case of EINTR, which can be spuriously received from
+             * debuggers or whatever.
+             */
+            if (errno == EINTR) {
+                return 0;
+            } else {
+                const char *msg = NULL;
+                if (errno == EAGAIN) {
+                    msg = "Resource temporarily unavailable";
+                }
+                __redisSetError(c, REDIS_ERR_IO, msg);
+                return -1;
+            }
+        }
+
+        /**
+         * We can very well get an EWOULDBLOCK/EAGAIN, however
+         */
+        if (maybeCheckWant(rssl, err)) {
+            return 0;
+        } else {
+            __redisSetError(c, REDIS_ERR_IO, NULL);
+            return -1;
+        }
+    }
+}
+
+static ssize_t redisSSLWrite(redisContext *c) {
+    redisSSL *rssl = c->privctx;
+
+    size_t len = rssl->lastLen ? rssl->lastLen : hi_sdslen(c->obuf);
+    int rv = SSL_write(rssl->ssl, c->obuf, len);
+
+    if (rv > 0) {
+        rssl->lastLen = 0;
+    } else if (rv < 0) {
+        rssl->lastLen = len;
+
+        int err = SSL_get_error(rssl->ssl, rv);
+        if ((c->flags & REDIS_BLOCK) == 0 && maybeCheckWant(rssl, err)) {
+            return 0;
+        } else {
+            __redisSetError(c, REDIS_ERR_IO, NULL);
+            return -1;
+        }
+    }
+    return rv;
+}
+
+static void redisSSLAsyncRead(redisAsyncContext *ac) {
+    int rv;
+    redisSSL *rssl = ac->c.privctx;
+    redisContext *c = &ac->c;
+
+    rssl->wantRead = 0;
+
+    if (rssl->pendingWrite) {
+        int done;
+
+        /* This is probably just a write event */
+        rssl->pendingWrite = 0;
+        rv = redisBufferWrite(c, &done);
+        if (rv == REDIS_ERR) {
+            __redisAsyncDisconnect(ac);
+            return;
+        } else if (!done) {
+            _EL_ADD_WRITE(ac);
+        }
+    }
+
+    rv = redisBufferRead(c);
+    if (rv == REDIS_ERR) {
+        __redisAsyncDisconnect(ac);
+    } else {
+        _EL_ADD_READ(ac);
+        redisProcessCallbacks(ac);
+    }
+}
+
+static void redisSSLAsyncWrite(redisAsyncContext *ac) {
+    int rv, done = 0;
+    redisSSL *rssl = ac->c.privctx;
+    redisContext *c = &ac->c;
+
+    rssl->pendingWrite = 0;
+    rv = redisBufferWrite(c, &done);
+    if (rv == REDIS_ERR) {
+        __redisAsyncDisconnect(ac);
+        return;
+    }
+
+    if (!done) {
+        if (rssl->wantRead) {
+            /* Need to read-before-write */
+            rssl->pendingWrite = 1;
+            _EL_DEL_WRITE(ac);
+        } else {
+            /* No extra reads needed, just need to write more */
+            _EL_ADD_WRITE(ac);
+        }
+    } else {
+        /* Already done! */
+        _EL_DEL_WRITE(ac);
+    }
+
+    /* Always reschedule a read */
+    _EL_ADD_READ(ac);
+}
+
+redisContextFuncs redisContextSSLFuncs = {
+    .free_privctx = redisSSLFree,
+    .async_read = redisSSLAsyncRead,
+    .async_write = redisSSLAsyncWrite,
+    .read = redisSSLRead,
+    .write = redisSSLWrite
+};
+
diff --git a/redis-stable/deps/hiredis/test.c b/redis-stable/deps/hiredis/test.c
new file mode 100644
index 00000000..bdff74e8
--- /dev/null
+++ b/redis-stable/deps/hiredis/test.c
@@ -0,0 +1,1425 @@
+#include "fmacros.h"
+#include "sockcompat.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#ifndef _WIN32
+#include <strings.h>
+#include <sys/time.h>
+#endif
+#include <assert.h>
+#include <signal.h>
+#include <errno.h>
+#include <limits.h>
+
+#include "hiredis.h"
+#include "async.h"
+#ifdef HIREDIS_TEST_SSL
+#include "hiredis_ssl.h"
+#endif
+#include "net.h"
+#include "win32.h"
+
+enum connection_type {
+    CONN_TCP,
+    CONN_UNIX,
+    CONN_FD,
+    CONN_SSL
+};
+
+struct config {
+    enum connection_type type;
+
+    struct {
+        const char *host;
+        int port;
+        struct timeval timeout;
+    } tcp;
+
+    struct {
+        const char *path;
+    } unix_sock;
+
+    struct {
+        const char *host;
+        int port;
+        const char *ca_cert;
+        const char *cert;
+        const char *key;
+    } ssl;
+};
+
+struct privdata {
+    int dtor_counter;
+};
+
+struct pushCounters {
+    int nil;
+    int str;
+};
+
+#ifdef HIREDIS_TEST_SSL
+redisSSLContext *_ssl_ctx = NULL;
+#endif
+
+/* The following lines make up our testing "framework" :) */
+static int tests = 0, fails = 0, skips = 0;
+#define test(_s) { printf("#%02d ", ++tests); printf(_s); }
+#define test_cond(_c) if(_c) printf("\033[0;32mPASSED\033[0;0m\n"); else {printf("\033[0;31mFAILED\033[0;0m\n"); fails++;}
+#define test_skipped() { printf("\033[01;33mSKIPPED\033[0;0m\n"); skips++; }
+
+static long long usec(void) {
+#ifndef _MSC_VER
+    struct timeval tv;
+    gettimeofday(&tv,NULL);
+    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
+#else
+    FILETIME ft;
+    GetSystemTimeAsFileTime(&ft);
+    return (((long long)ft.dwHighDateTime << 32) | ft.dwLowDateTime) / 10;
+#endif
+}
+
+/* The assert() calls below have side effects, so we need assert()
+ * even if we are compiling without asserts (-DNDEBUG). */
+#ifdef NDEBUG
+#undef assert
+#define assert(e) (void)(e)
+#endif
+
+/* Helper to extract Redis version information.  Aborts on any failure. */
+#define REDIS_VERSION_FIELD "redis_version:"
+void get_redis_version(redisContext *c, int *majorptr, int *minorptr) {
+    redisReply *reply;
+    char *eptr, *s, *e;
+    int major, minor;
+
+    reply = redisCommand(c, "INFO");
+    if (reply == NULL || c->err || reply->type != REDIS_REPLY_STRING)
+        goto abort;
+    if ((s = strstr(reply->str, REDIS_VERSION_FIELD)) == NULL)
+        goto abort;
+
+    s += strlen(REDIS_VERSION_FIELD);
+
+    /* We need a field terminator and at least 'x.y.z' (5) bytes of data */
+    if ((e = strstr(s, "\r\n")) == NULL || (e - s) < 5)
+        goto abort;
+
+    /* Extract version info */
+    major = strtol(s, &eptr, 10);
+    if (*eptr != '.') goto abort;
+    minor = strtol(eptr+1, NULL, 10);
+
+    /* Push info the caller wants */
+    if (majorptr) *majorptr = major;
+    if (minorptr) *minorptr = minor;
+
+    freeReplyObject(reply);
+    return;
+
+abort:
+    freeReplyObject(reply);
+    fprintf(stderr, "Error:  Cannot determine Redis version, aborting\n");
+    exit(1);
+}
+
+static redisContext *select_database(redisContext *c) {
+    redisReply *reply;
+
+    /* Switch to DB 9 for testing, now that we know we can chat. */
+    reply = redisCommand(c,"SELECT 9");
+    assert(reply != NULL);
+    freeReplyObject(reply);
+
+    /* Make sure the DB is emtpy */
+    reply = redisCommand(c,"DBSIZE");
+    assert(reply != NULL);
+    if (reply->type == REDIS_REPLY_INTEGER && reply->integer == 0) {
+        /* Awesome, DB 9 is empty and we can continue. */
+        freeReplyObject(reply);
+    } else {
+        printf("Database #9 is not empty, test can not continue\n");
+        exit(1);
+    }
+
+    return c;
+}
+
+/* Switch protocol */
+static void send_hello(redisContext *c, int version) {
+    redisReply *reply;
+    int expected;
+
+    reply = redisCommand(c, "HELLO %d", version);
+    expected = version == 3 ? REDIS_REPLY_MAP : REDIS_REPLY_ARRAY;
+    assert(reply != NULL && reply->type == expected);
+    freeReplyObject(reply);
+}
+
+/* Togggle client tracking */
+static void send_client_tracking(redisContext *c, const char *str) {
+    redisReply *reply;
+
+    reply = redisCommand(c, "CLIENT TRACKING %s", str);
+    assert(reply != NULL && reply->type == REDIS_REPLY_STATUS);
+    freeReplyObject(reply);
+}
+
+static int disconnect(redisContext *c, int keep_fd) {
+    redisReply *reply;
+
+    /* Make sure we're on DB 9. */
+    reply = redisCommand(c,"SELECT 9");
+    assert(reply != NULL);
+    freeReplyObject(reply);
+    reply = redisCommand(c,"FLUSHDB");
+    assert(reply != NULL);
+    freeReplyObject(reply);
+
+    /* Free the context as well, but keep the fd if requested. */
+    if (keep_fd)
+        return redisFreeKeepFd(c);
+    redisFree(c);
+    return -1;
+}
+
+static void do_ssl_handshake(redisContext *c) {
+#ifdef HIREDIS_TEST_SSL
+    redisInitiateSSLWithContext(c, _ssl_ctx);
+    if (c->err) {
+        printf("SSL error: %s\n", c->errstr);
+        redisFree(c);
+        exit(1);
+    }
+#else
+    (void) c;
+#endif
+}
+
+static redisContext *do_connect(struct config config) {
+    redisContext *c = NULL;
+
+    if (config.type == CONN_TCP) {
+        c = redisConnect(config.tcp.host, config.tcp.port);
+    } else if (config.type == CONN_SSL) {
+        c = redisConnect(config.ssl.host, config.ssl.port);
+    } else if (config.type == CONN_UNIX) {
+        c = redisConnectUnix(config.unix_sock.path);
+    } else if (config.type == CONN_FD) {
+        /* Create a dummy connection just to get an fd to inherit */
+        redisContext *dummy_ctx = redisConnectUnix(config.unix_sock.path);
+        if (dummy_ctx) {
+            int fd = disconnect(dummy_ctx, 1);
+            printf("Connecting to inherited fd %d\n", fd);
+            c = redisConnectFd(fd);
+        }
+    } else {
+        assert(NULL);
+    }
+
+    if (c == NULL) {
+        printf("Connection error: can't allocate redis context\n");
+        exit(1);
+    } else if (c->err) {
+        printf("Connection error: %s\n", c->errstr);
+        redisFree(c);
+        exit(1);
+    }
+
+    if (config.type == CONN_SSL) {
+        do_ssl_handshake(c);
+    }
+
+    return select_database(c);
+}
+
+static void do_reconnect(redisContext *c, struct config config) {
+    redisReconnect(c);
+
+    if (config.type == CONN_SSL) {
+        do_ssl_handshake(c);
+    }
+}
+
+static void test_format_commands(void) {
+    char *cmd;
+    int len;
+
+    test("Format command without interpolation: ");
+    len = redisFormatCommand(&cmd,"SET foo bar");
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
+    hi_free(cmd);
+
+    test("Format command with %%s string interpolation: ");
+    len = redisFormatCommand(&cmd,"SET %s %s","foo","bar");
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
+    hi_free(cmd);
+
+    test("Format command with %%s and an empty string: ");
+    len = redisFormatCommand(&cmd,"SET %s %s","foo","");
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$0\r\n\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(0+2));
+    hi_free(cmd);
+
+    test("Format command with an empty string in between proper interpolations: ");
+    len = redisFormatCommand(&cmd,"SET %s %s","","foo");
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$0\r\n\r\n$3\r\nfoo\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(0+2)+4+(3+2));
+    hi_free(cmd);
+
+    test("Format command with %%b string interpolation: ");
+    len = redisFormatCommand(&cmd,"SET %b %b","foo",(size_t)3,"b\0r",(size_t)3);
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nb\0r\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
+    hi_free(cmd);
+
+    test("Format command with %%b and an empty string: ");
+    len = redisFormatCommand(&cmd,"SET %b %b","foo",(size_t)3,"",(size_t)0);
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$0\r\n\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(0+2));
+    hi_free(cmd);
+
+    test("Format command with literal %%: ");
+    len = redisFormatCommand(&cmd,"SET %% %%");
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$1\r\n%\r\n$1\r\n%\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(1+2)+4+(1+2));
+    hi_free(cmd);
+
+    /* Vararg width depends on the type. These tests make sure that the
+     * width is correctly determined using the format and subsequent varargs
+     * can correctly be interpolated. */
+#define INTEGER_WIDTH_TEST(fmt, type) do {                                                \
+    type value = 123;                                                                     \
+    test("Format command with printf-delegation (" #type "): ");                          \
+    len = redisFormatCommand(&cmd,"key:%08" fmt " str:%s", value, "hello");               \
+    test_cond(strncmp(cmd,"*2\r\n$12\r\nkey:00000123\r\n$9\r\nstr:hello\r\n",len) == 0 && \
+        len == 4+5+(12+2)+4+(9+2));                                                       \
+    hi_free(cmd);                                                                         \
+} while(0)
+
+#define FLOAT_WIDTH_TEST(type) do {                                                       \
+    type value = 123.0;                                                                   \
+    test("Format command with printf-delegation (" #type "): ");                          \
+    len = redisFormatCommand(&cmd,"key:%08.3f str:%s", value, "hello");                   \
+    test_cond(strncmp(cmd,"*2\r\n$12\r\nkey:0123.000\r\n$9\r\nstr:hello\r\n",len) == 0 && \
+        len == 4+5+(12+2)+4+(9+2));                                                       \
+    hi_free(cmd);                                                                         \
+} while(0)
+
+    INTEGER_WIDTH_TEST("d", int);
+    INTEGER_WIDTH_TEST("hhd", char);
+    INTEGER_WIDTH_TEST("hd", short);
+    INTEGER_WIDTH_TEST("ld", long);
+    INTEGER_WIDTH_TEST("lld", long long);
+    INTEGER_WIDTH_TEST("u", unsigned int);
+    INTEGER_WIDTH_TEST("hhu", unsigned char);
+    INTEGER_WIDTH_TEST("hu", unsigned short);
+    INTEGER_WIDTH_TEST("lu", unsigned long);
+    INTEGER_WIDTH_TEST("llu", unsigned long long);
+    FLOAT_WIDTH_TEST(float);
+    FLOAT_WIDTH_TEST(double);
+
+    test("Format command with invalid printf format: ");
+    len = redisFormatCommand(&cmd,"key:%08p %b",(void*)1234,"foo",(size_t)3);
+    test_cond(len == -1);
+
+    const char *argv[3];
+    argv[0] = "SET";
+    argv[1] = "foo\0xxx";
+    argv[2] = "bar";
+    size_t lens[3] = { 3, 7, 3 };
+    int argc = 3;
+
+    test("Format command by passing argc/argv without lengths: ");
+    len = redisFormatCommandArgv(&cmd,argc,argv,NULL);
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
+    hi_free(cmd);
+
+    test("Format command by passing argc/argv with lengths: ");
+    len = redisFormatCommandArgv(&cmd,argc,argv,lens);
+    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$7\r\nfoo\0xxx\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(7+2)+4+(3+2));
+    hi_free(cmd);
+
+    hisds sds_cmd;
+
+    sds_cmd = NULL;
+    test("Format command into hisds by passing argc/argv without lengths: ");
+    len = redisFormatSdsCommandArgv(&sds_cmd,argc,argv,NULL);
+    test_cond(strncmp(sds_cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
+    hi_sdsfree(sds_cmd);
+
+    sds_cmd = NULL;
+    test("Format command into hisds by passing argc/argv with lengths: ");
+    len = redisFormatSdsCommandArgv(&sds_cmd,argc,argv,lens);
+    test_cond(strncmp(sds_cmd,"*3\r\n$3\r\nSET\r\n$7\r\nfoo\0xxx\r\n$3\r\nbar\r\n",len) == 0 &&
+        len == 4+4+(3+2)+4+(7+2)+4+(3+2));
+    hi_sdsfree(sds_cmd);
+}
+
+static void test_append_formatted_commands(struct config config) {
+    redisContext *c;
+    redisReply *reply;
+    char *cmd;
+    int len;
+
+    c = do_connect(config);
+
+    test("Append format command: ");
+
+    len = redisFormatCommand(&cmd, "SET foo bar");
+
+    test_cond(redisAppendFormattedCommand(c, cmd, len) == REDIS_OK);
+
+    assert(redisGetReply(c, (void*)&reply) == REDIS_OK);
+
+    hi_free(cmd);
+    freeReplyObject(reply);
+
+    disconnect(c, 0);
+}
+
+static void test_reply_reader(void) {
+    redisReader *reader;
+    void *reply, *root;
+    int ret;
+    int i;
+
+    test("Error handling in reply parser: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader,(char*)"@foo\r\n",6);
+    ret = redisReaderGetReply(reader,NULL);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Protocol error, got \"@\" as reply type byte") == 0);
+    redisReaderFree(reader);
+
+    /* when the reply already contains multiple items, they must be free'd
+     * on an error. valgrind will bark when this doesn't happen. */
+    test("Memory cleanup in reply parser: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader,(char*)"*2\r\n",4);
+    redisReaderFeed(reader,(char*)"$5\r\nhello\r\n",11);
+    redisReaderFeed(reader,(char*)"@foo\r\n",6);
+    ret = redisReaderGetReply(reader,NULL);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Protocol error, got \"@\" as reply type byte") == 0);
+    redisReaderFree(reader);
+
+    reader = redisReaderCreate();
+    test("Can handle arbitrarily nested multi-bulks: ");
+    for (i = 0; i < 128; i++) {
+        redisReaderFeed(reader,(char*)"*1\r\n", 4);
+    }
+    redisReaderFeed(reader,(char*)"$6\r\nLOLWUT\r\n",12);
+    ret = redisReaderGetReply(reader,&reply);
+    root = reply; /* Keep track of the root reply */
+    test_cond(ret == REDIS_OK &&
+        ((redisReply*)reply)->type == REDIS_REPLY_ARRAY &&
+        ((redisReply*)reply)->elements == 1);
+
+    test("Can parse arbitrarily nested multi-bulks correctly: ");
+    while(i--) {
+        assert(reply != NULL && ((redisReply*)reply)->type == REDIS_REPLY_ARRAY);
+        reply = ((redisReply*)reply)->element[0];
+    }
+    test_cond(((redisReply*)reply)->type == REDIS_REPLY_STRING &&
+        !memcmp(((redisReply*)reply)->str, "LOLWUT", 6));
+    freeReplyObject(root);
+    redisReaderFree(reader);
+
+    test("Correctly parses LLONG_MAX: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, ":9223372036854775807\r\n",22);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK &&
+            ((redisReply*)reply)->type == REDIS_REPLY_INTEGER &&
+            ((redisReply*)reply)->integer == LLONG_MAX);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Set error when > LLONG_MAX: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, ":9223372036854775808\r\n",22);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Bad integer value") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Correctly parses LLONG_MIN: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, ":-9223372036854775808\r\n",23);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK &&
+            ((redisReply*)reply)->type == REDIS_REPLY_INTEGER &&
+            ((redisReply*)reply)->integer == LLONG_MIN);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Set error when < LLONG_MIN: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, ":-9223372036854775809\r\n",23);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Bad integer value") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Set error when array < -1: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, "*-2\r\n+asdf\r\n",12);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Multi-bulk length out of range") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Set error when bulk < -1: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, "$-2\r\nasdf\r\n",11);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr,"Bulk string length out of range") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Can configure maximum multi-bulk elements: ");
+    reader = redisReaderCreate();
+    reader->maxelements = 1024;
+    redisReaderFeed(reader, "*1025\r\n", 7);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+              strcasecmp(reader->errstr, "Multi-bulk length out of range") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Multi-bulk never overflows regardless of maxelements: ");
+    size_t bad_mbulk_len = (SIZE_MAX / sizeof(void *)) + 3;
+    char bad_mbulk_reply[100];
+    snprintf(bad_mbulk_reply, sizeof(bad_mbulk_reply), "*%llu\r\n+asdf\r\n",
+        (unsigned long long) bad_mbulk_len);
+
+    reader = redisReaderCreate();
+    reader->maxelements = 0;    /* Don't rely on default limit */
+    redisReaderFeed(reader, bad_mbulk_reply, strlen(bad_mbulk_reply));
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR && strcasecmp(reader->errstr, "Out of memory") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+#if LLONG_MAX > SIZE_MAX
+    test("Set error when array > SIZE_MAX: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, "*9223372036854775807\r\n+asdf\r\n",29);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+            strcasecmp(reader->errstr,"Multi-bulk length out of range") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    test("Set error when bulk > SIZE_MAX: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader, "$9223372036854775807\r\nasdf\r\n",28);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR &&
+            strcasecmp(reader->errstr,"Bulk string length out of range") == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+#endif
+
+    test("Works with NULL functions for reply: ");
+    reader = redisReaderCreate();
+    reader->fn = NULL;
+    redisReaderFeed(reader,(char*)"+OK\r\n",5);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK && reply == (void*)REDIS_REPLY_STATUS);
+    redisReaderFree(reader);
+
+    test("Works when a single newline (\\r\\n) covers two calls to feed: ");
+    reader = redisReaderCreate();
+    reader->fn = NULL;
+    redisReaderFeed(reader,(char*)"+OK\r",4);
+    ret = redisReaderGetReply(reader,&reply);
+    assert(ret == REDIS_OK && reply == NULL);
+    redisReaderFeed(reader,(char*)"\n",1);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK && reply == (void*)REDIS_REPLY_STATUS);
+    redisReaderFree(reader);
+
+    test("Don't reset state after protocol error: ");
+    reader = redisReaderCreate();
+    reader->fn = NULL;
+    redisReaderFeed(reader,(char*)"x",1);
+    ret = redisReaderGetReply(reader,&reply);
+    assert(ret == REDIS_ERR);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_ERR && reply == NULL);
+    redisReaderFree(reader);
+
+    /* Regression test for issue #45 on GitHub. */
+    test("Don't do empty allocation for empty multi bulk: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader,(char*)"*0\r\n",4);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK &&
+        ((redisReply*)reply)->type == REDIS_REPLY_ARRAY &&
+        ((redisReply*)reply)->elements == 0);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    /* RESP3 verbatim strings (GitHub issue #802) */
+    test("Can parse RESP3 verbatim strings: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader,(char*)"=10\r\ntxt:LOLWUT\r\n",17);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK &&
+        ((redisReply*)reply)->type == REDIS_REPLY_VERB &&
+         !memcmp(((redisReply*)reply)->str,"LOLWUT", 6));
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+
+    /* RESP3 push messages (Github issue #815) */
+    test("Can parse RESP3 push messages: ");
+    reader = redisReaderCreate();
+    redisReaderFeed(reader,(char*)">2\r\n$6\r\nLOLWUT\r\n:42\r\n",21);
+    ret = redisReaderGetReply(reader,&reply);
+    test_cond(ret == REDIS_OK &&
+        ((redisReply*)reply)->type == REDIS_REPLY_PUSH &&
+        ((redisReply*)reply)->elements == 2 &&
+        ((redisReply*)reply)->element[0]->type == REDIS_REPLY_STRING &&
+        !memcmp(((redisReply*)reply)->element[0]->str,"LOLWUT",6) &&
+        ((redisReply*)reply)->element[1]->type == REDIS_REPLY_INTEGER &&
+        ((redisReply*)reply)->element[1]->integer == 42);
+    freeReplyObject(reply);
+    redisReaderFree(reader);
+}
+
+static void test_free_null(void) {
+    void *redisCtx = NULL;
+    void *reply = NULL;
+
+    test("Don't fail when redisFree is passed a NULL value: ");
+    redisFree(redisCtx);
+    test_cond(redisCtx == NULL);
+
+    test("Don't fail when freeReplyObject is passed a NULL value: ");
+    freeReplyObject(reply);
+    test_cond(reply == NULL);
+}
+
+static void *hi_malloc_fail(size_t size) {
+    (void)size;
+    return NULL;
+}
+
+static void *hi_calloc_fail(size_t nmemb, size_t size) {
+    (void)nmemb;
+    (void)size;
+    return NULL;
+}
+
+static void *hi_realloc_fail(void *ptr, size_t size) {
+    (void)ptr;
+    (void)size;
+    return NULL;
+}
+
+static void test_allocator_injection(void) {
+    hiredisAllocFuncs ha = {
+        .mallocFn = hi_malloc_fail,
+        .callocFn = hi_calloc_fail,
+        .reallocFn = hi_realloc_fail,
+        .strdupFn = strdup,
+        .freeFn = free,
+    };
+
+    // Override hiredis allocators
+    hiredisSetAllocators(&ha);
+
+    test("redisContext uses injected allocators: ");
+    redisContext *c = redisConnect("localhost", 6379);
+    test_cond(c == NULL);
+
+    test("redisReader uses injected allocators: ");
+    redisReader *reader = redisReaderCreate();
+    test_cond(reader == NULL);
+
+    // Return allocators to default
+    hiredisResetAllocators();
+}
+
+#define HIREDIS_BAD_DOMAIN "idontexist-noreally.com"
+static void test_blocking_connection_errors(void) {
+    redisContext *c;
+    struct addrinfo hints = {.ai_family = AF_INET};
+    struct addrinfo *ai_tmp = NULL;
+
+    int rv = getaddrinfo(HIREDIS_BAD_DOMAIN, "6379", &hints, &ai_tmp);
+    if (rv != 0) {
+        // Address does *not* exist
+        test("Returns error when host cannot be resolved: ");
+        // First see if this domain name *actually* resolves to NXDOMAIN
+        c = redisConnect(HIREDIS_BAD_DOMAIN, 6379);
+        test_cond(
+            c->err == REDIS_ERR_OTHER &&
+            (strcmp(c->errstr, "Name or service not known") == 0 ||
+             strcmp(c->errstr, "Can't resolve: " HIREDIS_BAD_DOMAIN) == 0 ||
+             strcmp(c->errstr, "Name does not resolve") == 0 ||
+             strcmp(c->errstr, "nodename nor servname provided, or not known") == 0 ||
+             strcmp(c->errstr, "No address associated with hostname") == 0 ||
+             strcmp(c->errstr, "Temporary failure in name resolution") == 0 ||
+             strcmp(c->errstr, "hostname nor servname provided, or not known") == 0 ||
+             strcmp(c->errstr, "no address associated with name") == 0 ||
+             strcmp(c->errstr, "No such host is known. ") == 0));
+        redisFree(c);
+    } else {
+        printf("Skipping NXDOMAIN test. Found evil ISP!\n");
+        freeaddrinfo(ai_tmp);
+    }
+
+#ifndef _WIN32
+    test("Returns error when the port is not open: ");
+    c = redisConnect((char*)"localhost", 1);
+    test_cond(c->err == REDIS_ERR_IO &&
+        strcmp(c->errstr,"Connection refused") == 0);
+    redisFree(c);
+
+    test("Returns error when the unix_sock socket path doesn't accept connections: ");
+    c = redisConnectUnix((char*)"/tmp/idontexist.sock");
+    test_cond(c->err == REDIS_ERR_IO); /* Don't care about the message... */
+    redisFree(c);
+#endif
+}
+
+/* Test push handler */
+void push_handler(void *privdata, void *r) {
+    struct pushCounters *pcounts = privdata;
+    redisReply *reply = r, *payload;
+
+    assert(reply && reply->type == REDIS_REPLY_PUSH && reply->elements == 2);
+
+    payload = reply->element[1];
+    if (payload->type == REDIS_REPLY_ARRAY) {
+        payload = payload->element[0];
+    }
+
+    if (payload->type == REDIS_REPLY_STRING) {
+        pcounts->str++;
+    } else if (payload->type == REDIS_REPLY_NIL) {
+        pcounts->nil++;
+    }
+
+    freeReplyObject(reply);
+}
+
+/* Dummy function just to test setting a callback with redisOptions */
+void push_handler_async(redisAsyncContext *ac, void *reply) {
+    (void)ac;
+    (void)reply;
+}
+
+static void test_resp3_push_handler(redisContext *c) {
+    struct pushCounters pc = {0};
+    redisPushFn *old = NULL;
+    redisReply *reply;
+    void *privdata;
+
+    /* Switch to RESP3 and turn on client tracking */
+    send_hello(c, 3);
+    send_client_tracking(c, "ON");
+    privdata = c->privdata;
+    c->privdata = &pc;
+
+    reply = redisCommand(c, "GET key:0");
+    assert(reply != NULL);
+    freeReplyObject(reply);
+
+    test("RESP3 PUSH messages are handled out of band by default: ");
+    reply = redisCommand(c, "SET key:0 val:0");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS);
+    freeReplyObject(reply);
+
+    assert((reply = redisCommand(c, "GET key:0")) != NULL);
+    freeReplyObject(reply);
+
+    old = redisSetPushCallback(c, push_handler);
+    test("We can set a custom RESP3 PUSH handler: ");
+    reply = redisCommand(c, "SET key:0 val:0");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && pc.str == 1);
+    freeReplyObject(reply);
+
+    test("We properly handle a NIL invalidation payload: ");
+    reply = redisCommand(c, "FLUSHDB");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && pc.nil == 1);
+    freeReplyObject(reply);
+
+    /* Unset the push callback and generate an invalidate message making
+     * sure it is not handled out of band. */
+    test("With no handler, PUSH replies come in-band: ");
+    redisSetPushCallback(c, NULL);
+    assert((reply = redisCommand(c, "GET key:0")) != NULL);
+    freeReplyObject(reply);
+    assert((reply = redisCommand(c, "SET key:0 invalid")) != NULL);
+    test_cond(reply->type == REDIS_REPLY_PUSH);
+    freeReplyObject(reply);
+
+    test("With no PUSH handler, no replies are lost: ");
+    assert(redisGetReply(c, (void**)&reply) == REDIS_OK);
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS);
+    freeReplyObject(reply);
+
+    /* Return to the originally set PUSH handler */
+    assert(old != NULL);
+    redisSetPushCallback(c, old);
+
+    /* Switch back to RESP2 and disable tracking */
+    c->privdata = privdata;
+    send_client_tracking(c, "OFF");
+    send_hello(c, 2);
+}
+
+redisOptions get_redis_tcp_options(struct config config) {
+    redisOptions options = {0};
+    REDIS_OPTIONS_SET_TCP(&options, config.tcp.host, config.tcp.port);
+    return options;
+}
+
+static void test_resp3_push_options(struct config config) {
+    redisAsyncContext *ac;
+    redisContext *c;
+    redisOptions options;
+
+    test("We set a default RESP3 handler for redisContext: ");
+    options = get_redis_tcp_options(config);
+    assert((c = redisConnectWithOptions(&options)) != NULL);
+    test_cond(c->push_cb != NULL);
+    redisFree(c);
+
+    test("We don't set a default RESP3 push handler for redisAsyncContext: ");
+    options = get_redis_tcp_options(config);
+    assert((ac = redisAsyncConnectWithOptions(&options)) != NULL);
+    test_cond(ac->c.push_cb == NULL);
+    redisAsyncFree(ac);
+
+    test("Our REDIS_OPT_NO_PUSH_AUTOFREE flag works: ");
+    options = get_redis_tcp_options(config);
+    options.options |= REDIS_OPT_NO_PUSH_AUTOFREE;
+    assert((c = redisConnectWithOptions(&options)) != NULL);
+    test_cond(c->push_cb == NULL);
+    redisFree(c);
+
+    test("We can use redisOptions to set a custom PUSH handler for redisContext: ");
+    options = get_redis_tcp_options(config);
+    options.push_cb = push_handler;
+    assert((c = redisConnectWithOptions(&options)) != NULL);
+    test_cond(c->push_cb == push_handler);
+    redisFree(c);
+
+    test("We can use redisOptions to set a custom PUSH handler for redisAsyncContext: ");
+    options = get_redis_tcp_options(config);
+    options.async_push_cb = push_handler_async;
+    assert((ac = redisAsyncConnectWithOptions(&options)) != NULL);
+    test_cond(ac->push_cb == push_handler_async);
+    redisAsyncFree(ac);
+}
+
+void free_privdata(void *privdata) {
+    struct privdata *data = privdata;
+    data->dtor_counter++;
+}
+
+static void test_privdata_hooks(struct config config) {
+    struct privdata data = {0};
+    redisOptions options;
+    redisContext *c;
+
+    test("We can use redisOptions to set privdata: ");
+    options = get_redis_tcp_options(config);
+    REDIS_OPTIONS_SET_PRIVDATA(&options, &data, free_privdata);
+    assert((c = redisConnectWithOptions(&options)) != NULL);
+    test_cond(c->privdata == &data);
+
+    test("Our privdata destructor fires when we free the context: ");
+    redisFree(c);
+    test_cond(data.dtor_counter == 1);
+}
+
+static void test_blocking_connection(struct config config) {
+    redisContext *c;
+    redisReply *reply;
+    int major;
+
+    c = do_connect(config);
+
+    test("Is able to deliver commands: ");
+    reply = redisCommand(c,"PING");
+    test_cond(reply->type == REDIS_REPLY_STATUS &&
+        strcasecmp(reply->str,"pong") == 0)
+    freeReplyObject(reply);
+
+    test("Is a able to send commands verbatim: ");
+    reply = redisCommand(c,"SET foo bar");
+    test_cond (reply->type == REDIS_REPLY_STATUS &&
+        strcasecmp(reply->str,"ok") == 0)
+    freeReplyObject(reply);
+
+    test("%%s String interpolation works: ");
+    reply = redisCommand(c,"SET %s %s","foo","hello world");
+    freeReplyObject(reply);
+    reply = redisCommand(c,"GET foo");
+    test_cond(reply->type == REDIS_REPLY_STRING &&
+        strcmp(reply->str,"hello world") == 0);
+    freeReplyObject(reply);
+
+    test("%%b String interpolation works: ");
+    reply = redisCommand(c,"SET %b %b","foo",(size_t)3,"hello\x00world",(size_t)11);
+    freeReplyObject(reply);
+    reply = redisCommand(c,"GET foo");
+    test_cond(reply->type == REDIS_REPLY_STRING &&
+        memcmp(reply->str,"hello\x00world",11) == 0)
+
+    test("Binary reply length is correct: ");
+    test_cond(reply->len == 11)
+    freeReplyObject(reply);
+
+    test("Can parse nil replies: ");
+    reply = redisCommand(c,"GET nokey");
+    test_cond(reply->type == REDIS_REPLY_NIL)
+    freeReplyObject(reply);
+
+    /* test 7 */
+    test("Can parse integer replies: ");
+    reply = redisCommand(c,"INCR mycounter");
+    test_cond(reply->type == REDIS_REPLY_INTEGER && reply->integer == 1)
+    freeReplyObject(reply);
+
+    test("Can parse multi bulk replies: ");
+    freeReplyObject(redisCommand(c,"LPUSH mylist foo"));
+    freeReplyObject(redisCommand(c,"LPUSH mylist bar"));
+    reply = redisCommand(c,"LRANGE mylist 0 -1");
+    test_cond(reply->type == REDIS_REPLY_ARRAY &&
+              reply->elements == 2 &&
+              !memcmp(reply->element[0]->str,"bar",3) &&
+              !memcmp(reply->element[1]->str,"foo",3))
+    freeReplyObject(reply);
+
+    /* m/e with multi bulk reply *before* other reply.
+     * specifically test ordering of reply items to parse. */
+    test("Can handle nested multi bulk replies: ");
+    freeReplyObject(redisCommand(c,"MULTI"));
+    freeReplyObject(redisCommand(c,"LRANGE mylist 0 -1"));
+    freeReplyObject(redisCommand(c,"PING"));
+    reply = (redisCommand(c,"EXEC"));
+    test_cond(reply->type == REDIS_REPLY_ARRAY &&
+              reply->elements == 2 &&
+              reply->element[0]->type == REDIS_REPLY_ARRAY &&
+              reply->element[0]->elements == 2 &&
+              !memcmp(reply->element[0]->element[0]->str,"bar",3) &&
+              !memcmp(reply->element[0]->element[1]->str,"foo",3) &&
+              reply->element[1]->type == REDIS_REPLY_STATUS &&
+              strcasecmp(reply->element[1]->str,"pong") == 0);
+    freeReplyObject(reply);
+
+    /* Make sure passing NULL to redisGetReply is safe */
+    test("Can pass NULL to redisGetReply: ");
+    assert(redisAppendCommand(c, "PING") == REDIS_OK);
+    test_cond(redisGetReply(c, NULL) == REDIS_OK);
+
+    get_redis_version(c, &major, NULL);
+    if (major >= 6) test_resp3_push_handler(c);
+    test_resp3_push_options(config);
+
+    test_privdata_hooks(config);
+
+    disconnect(c, 0);
+}
+
+/* Send DEBUG SLEEP 0 to detect if we have this command */
+static int detect_debug_sleep(redisContext *c) {
+    int detected;
+    redisReply *reply = redisCommand(c, "DEBUG SLEEP 0\r\n");
+
+    if (reply == NULL || c->err) {
+        const char *cause = c->err ? c->errstr : "(none)";
+        fprintf(stderr, "Error testing for DEBUG SLEEP (Redis error: %s), exiting\n", cause);
+        exit(-1);
+    }
+
+    detected = reply->type == REDIS_REPLY_STATUS;
+    freeReplyObject(reply);
+
+    return detected;
+}
+
+static void test_blocking_connection_timeouts(struct config config) {
+    redisContext *c;
+    redisReply *reply;
+    ssize_t s;
+    const char *sleep_cmd = "DEBUG SLEEP 3\r\n";
+    struct timeval tv;
+
+    c = do_connect(config);
+    test("Successfully completes a command when the timeout is not exceeded: ");
+    reply = redisCommand(c,"SET foo fast");
+    freeReplyObject(reply);
+    tv.tv_sec = 0;
+    tv.tv_usec = 10000;
+    redisSetTimeout(c, tv);
+    reply = redisCommand(c, "GET foo");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STRING && memcmp(reply->str, "fast", 4) == 0);
+    freeReplyObject(reply);
+    disconnect(c, 0);
+
+    c = do_connect(config);
+    test("Does not return a reply when the command times out: ");
+    if (detect_debug_sleep(c)) {
+        redisAppendFormattedCommand(c, sleep_cmd, strlen(sleep_cmd));
+        s = c->funcs->write(c);
+        tv.tv_sec = 0;
+        tv.tv_usec = 10000;
+        redisSetTimeout(c, tv);
+        reply = redisCommand(c, "GET foo");
+#ifndef _WIN32
+        test_cond(s > 0 && reply == NULL && c->err == REDIS_ERR_IO &&
+                  strcmp(c->errstr, "Resource temporarily unavailable") == 0);
+#else
+        test_cond(s > 0 && reply == NULL && c->err == REDIS_ERR_TIMEOUT &&
+                  strcmp(c->errstr, "recv timeout") == 0);
+#endif
+        freeReplyObject(reply);
+    } else {
+        test_skipped();
+    }
+
+    test("Reconnect properly reconnects after a timeout: ");
+    do_reconnect(c, config);
+    reply = redisCommand(c, "PING");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && strcmp(reply->str, "PONG") == 0);
+    freeReplyObject(reply);
+
+    test("Reconnect properly uses owned parameters: ");
+    config.tcp.host = "foo";
+    config.unix_sock.path = "foo";
+    do_reconnect(c, config);
+    reply = redisCommand(c, "PING");
+    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && strcmp(reply->str, "PONG") == 0);
+    freeReplyObject(reply);
+
+    disconnect(c, 0);
+}
+
+static void test_blocking_io_errors(struct config config) {
+    redisContext *c;
+    redisReply *reply;
+    void *_reply;
+    int major, minor;
+
+    /* Connect to target given by config. */
+    c = do_connect(config);
+    get_redis_version(c, &major, &minor);
+
+    test("Returns I/O error when the connection is lost: ");
+    reply = redisCommand(c,"QUIT");
+    if (major > 2 || (major == 2 && minor > 0)) {
+        /* > 2.0 returns OK on QUIT and read() should be issued once more
+         * to know the descriptor is at EOF. */
+        test_cond(strcasecmp(reply->str,"OK") == 0 &&
+            redisGetReply(c,&_reply) == REDIS_ERR);
+        freeReplyObject(reply);
+    } else {
+        test_cond(reply == NULL);
+    }
+
+#ifndef _WIN32
+    /* On 2.0, QUIT will cause the connection to be closed immediately and
+     * the read(2) for the reply on QUIT will set the error to EOF.
+     * On >2.0, QUIT will return with OK and another read(2) needed to be
+     * issued to find out the socket was closed by the server. In both
+     * conditions, the error will be set to EOF. */
+    assert(c->err == REDIS_ERR_EOF &&
+        strcmp(c->errstr,"Server closed the connection") == 0);
+#endif
+    redisFree(c);
+
+    c = do_connect(config);
+    test("Returns I/O error on socket timeout: ");
+    struct timeval tv = { 0, 1000 };
+    assert(redisSetTimeout(c,tv) == REDIS_OK);
+    int respcode = redisGetReply(c,&_reply);
+#ifndef _WIN32
+    test_cond(respcode == REDIS_ERR && c->err == REDIS_ERR_IO && errno == EAGAIN);
+#else
+    test_cond(respcode == REDIS_ERR && c->err == REDIS_ERR_TIMEOUT);
+#endif
+    redisFree(c);
+}
+
+static void test_invalid_timeout_errors(struct config config) {
+    redisContext *c;
+
+    test("Set error when an invalid timeout usec value is given to redisConnectWithTimeout: ");
+
+    config.tcp.timeout.tv_sec = 0;
+    config.tcp.timeout.tv_usec = 10000001;
+
+    c = redisConnectWithTimeout(config.tcp.host, config.tcp.port, config.tcp.timeout);
+
+    test_cond(c->err == REDIS_ERR_IO && strcmp(c->errstr, "Invalid timeout specified") == 0);
+    redisFree(c);
+
+    test("Set error when an invalid timeout sec value is given to redisConnectWithTimeout: ");
+
+    config.tcp.timeout.tv_sec = (((LONG_MAX) - 999) / 1000) + 1;
+    config.tcp.timeout.tv_usec = 0;
+
+    c = redisConnectWithTimeout(config.tcp.host, config.tcp.port, config.tcp.timeout);
+
+    test_cond(c->err == REDIS_ERR_IO && strcmp(c->errstr, "Invalid timeout specified") == 0);
+    redisFree(c);
+}
+
+/* Wrap malloc to abort on failure so OOM checks don't make the test logic
+ * harder to follow. */
+void *hi_malloc_safe(size_t size) {
+    void *ptr = hi_malloc(size);
+    if (ptr == NULL) {
+        fprintf(stderr, "Error:  Out of memory\n");
+        exit(-1);
+    }
+
+    return ptr;
+}
+
+static void test_throughput(struct config config) {
+    redisContext *c = do_connect(config);
+    redisReply **replies;
+    int i, num;
+    long long t1, t2;
+
+    test("Throughput:\n");
+    for (i = 0; i < 500; i++)
+        freeReplyObject(redisCommand(c,"LPUSH mylist foo"));
+
+    num = 1000;
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        replies[i] = redisCommand(c,"PING");
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_STATUS);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx PING: %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        replies[i] = redisCommand(c,"LRANGE mylist 0 499");
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_ARRAY);
+        assert(replies[i] != NULL && replies[i]->elements == 500);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx LRANGE with 500 elements: %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        replies[i] = redisCommand(c, "INCRBY incrkey %d", 1000000);
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_INTEGER);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx INCRBY: %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    num = 10000;
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    for (i = 0; i < num; i++)
+        redisAppendCommand(c,"PING");
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_STATUS);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx PING (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    for (i = 0; i < num; i++)
+        redisAppendCommand(c,"LRANGE mylist 0 499");
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_ARRAY);
+        assert(replies[i] != NULL && replies[i]->elements == 500);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx LRANGE with 500 elements (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    replies = hi_malloc_safe(sizeof(redisReply*)*num);
+    for (i = 0; i < num; i++)
+        redisAppendCommand(c,"INCRBY incrkey %d", 1000000);
+    t1 = usec();
+    for (i = 0; i < num; i++) {
+        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
+        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_INTEGER);
+    }
+    t2 = usec();
+    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
+    hi_free(replies);
+    printf("\t(%dx INCRBY (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
+
+    disconnect(c, 0);
+}
+
+// static long __test_callback_flags = 0;
+// static void __test_callback(redisContext *c, void *privdata) {
+//     ((void)c);
+//     /* Shift to detect execution order */
+//     __test_callback_flags <<= 8;
+//     __test_callback_flags |= (long)privdata;
+// }
+//
+// static void __test_reply_callback(redisContext *c, redisReply *reply, void *privdata) {
+//     ((void)c);
+//     /* Shift to detect execution order */
+//     __test_callback_flags <<= 8;
+//     __test_callback_flags |= (long)privdata;
+//     if (reply) freeReplyObject(reply);
+// }
+//
+// static redisContext *__connect_nonblock() {
+//     /* Reset callback flags */
+//     __test_callback_flags = 0;
+//     return redisConnectNonBlock("127.0.0.1", port, NULL);
+// }
+//
+// static void test_nonblocking_connection() {
+//     redisContext *c;
+//     int wdone = 0;
+//
+//     test("Calls command callback when command is issued: ");
+//     c = __connect_nonblock();
+//     redisSetCommandCallback(c,__test_callback,(void*)1);
+//     redisCommand(c,"PING");
+//     test_cond(__test_callback_flags == 1);
+//     redisFree(c);
+//
+//     test("Calls disconnect callback on redisDisconnect: ");
+//     c = __connect_nonblock();
+//     redisSetDisconnectCallback(c,__test_callback,(void*)2);
+//     redisDisconnect(c);
+//     test_cond(__test_callback_flags == 2);
+//     redisFree(c);
+//
+//     test("Calls disconnect callback and free callback on redisFree: ");
+//     c = __connect_nonblock();
+//     redisSetDisconnectCallback(c,__test_callback,(void*)2);
+//     redisSetFreeCallback(c,__test_callback,(void*)4);
+//     redisFree(c);
+//     test_cond(__test_callback_flags == ((2 << 8) | 4));
+//
+//     test("redisBufferWrite against empty write buffer: ");
+//     c = __connect_nonblock();
+//     test_cond(redisBufferWrite(c,&wdone) == REDIS_OK && wdone == 1);
+//     redisFree(c);
+//
+//     test("redisBufferWrite against not yet connected fd: ");
+//     c = __connect_nonblock();
+//     redisCommand(c,"PING");
+//     test_cond(redisBufferWrite(c,NULL) == REDIS_ERR &&
+//               strncmp(c->error,"write:",6) == 0);
+//     redisFree(c);
+//
+//     test("redisBufferWrite against closed fd: ");
+//     c = __connect_nonblock();
+//     redisCommand(c,"PING");
+//     redisDisconnect(c);
+//     test_cond(redisBufferWrite(c,NULL) == REDIS_ERR &&
+//               strncmp(c->error,"write:",6) == 0);
+//     redisFree(c);
+//
+//     test("Process callbacks in the right sequence: ");
+//     c = __connect_nonblock();
+//     redisCommandWithCallback(c,__test_reply_callback,(void*)1,"PING");
+//     redisCommandWithCallback(c,__test_reply_callback,(void*)2,"PING");
+//     redisCommandWithCallback(c,__test_reply_callback,(void*)3,"PING");
+//
+//     /* Write output buffer */
+//     wdone = 0;
+//     while(!wdone) {
+//         usleep(500);
+//         redisBufferWrite(c,&wdone);
+//     }
+//
+//     /* Read until at least one callback is executed (the 3 replies will
+//      * arrive in a single packet, causing all callbacks to be executed in
+//      * a single pass). */
+//     while(__test_callback_flags == 0) {
+//         assert(redisBufferRead(c) == REDIS_OK);
+//         redisProcessCallbacks(c);
+//     }
+//     test_cond(__test_callback_flags == 0x010203);
+//     redisFree(c);
+//
+//     test("redisDisconnect executes pending callbacks with NULL reply: ");
+//     c = __connect_nonblock();
+//     redisSetDisconnectCallback(c,__test_callback,(void*)1);
+//     redisCommandWithCallback(c,__test_reply_callback,(void*)2,"PING");
+//     redisDisconnect(c);
+//     test_cond(__test_callback_flags == 0x0201);
+//     redisFree(c);
+// }
+
+int main(int argc, char **argv) {
+    struct config cfg = {
+        .tcp = {
+            .host = "127.0.0.1",
+            .port = 6379
+        },
+        .unix_sock = {
+            .path = "/tmp/redis.sock"
+        }
+    };
+    int throughput = 1;
+    int test_inherit_fd = 1;
+    int skips_as_fails = 0;
+    int test_unix_socket;
+
+    /* Parse command line options. */
+    argv++; argc--;
+    while (argc) {
+        if (argc >= 2 && !strcmp(argv[0],"-h")) {
+            argv++; argc--;
+            cfg.tcp.host = argv[0];
+        } else if (argc >= 2 && !strcmp(argv[0],"-p")) {
+            argv++; argc--;
+            cfg.tcp.port = atoi(argv[0]);
+        } else if (argc >= 2 && !strcmp(argv[0],"-s")) {
+            argv++; argc--;
+            cfg.unix_sock.path = argv[0];
+        } else if (argc >= 1 && !strcmp(argv[0],"--skip-throughput")) {
+            throughput = 0;
+        } else if (argc >= 1 && !strcmp(argv[0],"--skip-inherit-fd")) {
+            test_inherit_fd = 0;
+        } else if (argc >= 1 && !strcmp(argv[0],"--skips-as-fails")) {
+            skips_as_fails = 1;
+#ifdef HIREDIS_TEST_SSL
+        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-port")) {
+            argv++; argc--;
+            cfg.ssl.port = atoi(argv[0]);
+        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-host")) {
+            argv++; argc--;
+            cfg.ssl.host = argv[0];
+        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-ca-cert")) {
+            argv++; argc--;
+            cfg.ssl.ca_cert  = argv[0];
+        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-cert")) {
+            argv++; argc--;
+            cfg.ssl.cert = argv[0];
+        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-key")) {
+            argv++; argc--;
+            cfg.ssl.key = argv[0];
+#endif
+        } else {
+            fprintf(stderr, "Invalid argument: %s\n", argv[0]);
+            exit(1);
+        }
+        argv++; argc--;
+    }
+
+#ifndef _WIN32
+    /* Ignore broken pipe signal (for I/O error tests). */
+    signal(SIGPIPE, SIG_IGN);
+
+    test_unix_socket = access(cfg.unix_sock.path, F_OK) == 0;
+
+#else
+    /* Unix sockets don't exist in Windows */
+    test_unix_socket = 0;
+#endif
+
+    test_allocator_injection();
+
+    test_format_commands();
+    test_reply_reader();
+    test_blocking_connection_errors();
+    test_free_null();
+
+    printf("\nTesting against TCP connection (%s:%d):\n", cfg.tcp.host, cfg.tcp.port);
+    cfg.type = CONN_TCP;
+    test_blocking_connection(cfg);
+    test_blocking_connection_timeouts(cfg);
+    test_blocking_io_errors(cfg);
+    test_invalid_timeout_errors(cfg);
+    test_append_formatted_commands(cfg);
+    if (throughput) test_throughput(cfg);
+
+    printf("\nTesting against Unix socket connection (%s): ", cfg.unix_sock.path);
+    if (test_unix_socket) {
+        printf("\n");
+        cfg.type = CONN_UNIX;
+        test_blocking_connection(cfg);
+        test_blocking_connection_timeouts(cfg);
+        test_blocking_io_errors(cfg);
+        if (throughput) test_throughput(cfg);
+    } else {
+        test_skipped();
+    }
+
+#ifdef HIREDIS_TEST_SSL
+    if (cfg.ssl.port && cfg.ssl.host) {
+
+        redisInitOpenSSL();
+        _ssl_ctx = redisCreateSSLContext(cfg.ssl.ca_cert, NULL, cfg.ssl.cert, cfg.ssl.key, NULL, NULL);
+        assert(_ssl_ctx != NULL);
+
+        printf("\nTesting against SSL connection (%s:%d):\n", cfg.ssl.host, cfg.ssl.port);
+        cfg.type = CONN_SSL;
+
+        test_blocking_connection(cfg);
+        test_blocking_connection_timeouts(cfg);
+        test_blocking_io_errors(cfg);
+        test_invalid_timeout_errors(cfg);
+        test_append_formatted_commands(cfg);
+        if (throughput) test_throughput(cfg);
+
+        redisFreeSSLContext(_ssl_ctx);
+        _ssl_ctx = NULL;
+    }
+#endif
+
+    if (test_inherit_fd) {
+        printf("\nTesting against inherited fd (%s): ", cfg.unix_sock.path);
+        if (test_unix_socket) {
+            printf("\n");
+            cfg.type = CONN_FD;
+            test_blocking_connection(cfg);
+        } else {
+            test_skipped();
+        }
+    }
+
+    if (fails || (skips_as_fails && skips)) {
+        printf("*** %d TESTS FAILED ***\n", fails);
+        if (skips) {
+            printf("*** %d TESTS SKIPPED ***\n", skips);
+        }
+        return 1;
+    }
+
+    printf("ALL TESTS PASSED (%d skipped)\n", skips);
+    return 0;
+}
diff --git a/redis-stable/deps/hiredis/test.sh b/redis-stable/deps/hiredis/test.sh
new file mode 100755
index 00000000..c72bcb0d
--- /dev/null
+++ b/redis-stable/deps/hiredis/test.sh
@@ -0,0 +1,78 @@
+#!/bin/sh -ue
+
+REDIS_SERVER=${REDIS_SERVER:-redis-server}
+REDIS_PORT=${REDIS_PORT:-56379}
+REDIS_SSL_PORT=${REDIS_SSL_PORT:-56443}
+TEST_SSL=${TEST_SSL:-0}
+SKIPS_AS_FAILS=${SKIPS_AS_FAILS-:0}
+SSL_TEST_ARGS=
+SKIPS_ARG=
+
+tmpdir=$(mktemp -d)
+PID_FILE=${tmpdir}/hiredis-test-redis.pid
+SOCK_FILE=${tmpdir}/hiredis-test-redis.sock
+
+if [ "$TEST_SSL" = "1" ]; then
+    SSL_CA_CERT=${tmpdir}/ca.crt
+    SSL_CA_KEY=${tmpdir}/ca.key
+    SSL_CERT=${tmpdir}/redis.crt
+    SSL_KEY=${tmpdir}/redis.key
+
+    openssl genrsa -out ${tmpdir}/ca.key 4096
+    openssl req \
+        -x509 -new -nodes -sha256 \
+        -key ${SSL_CA_KEY} \
+        -days 3650 \
+        -subj '/CN=Hiredis Test CA' \
+        -out ${SSL_CA_CERT}
+    openssl genrsa -out ${SSL_KEY} 2048
+    openssl req \
+        -new -sha256 \
+        -key ${SSL_KEY} \
+        -subj '/CN=Hiredis Test Cert' | \
+        openssl x509 \
+            -req -sha256 \
+            -CA ${SSL_CA_CERT} \
+            -CAkey ${SSL_CA_KEY} \
+            -CAserial ${tmpdir}/ca.txt \
+            -CAcreateserial \
+            -days 365 \
+            -out ${SSL_CERT}
+
+    SSL_TEST_ARGS="--ssl-host 127.0.0.1 --ssl-port ${REDIS_SSL_PORT} --ssl-ca-cert ${SSL_CA_CERT} --ssl-cert ${SSL_CERT} --ssl-key ${SSL_KEY}"
+fi
+
+cleanup() {
+  set +e
+  kill $(cat ${PID_FILE})
+  rm -rf ${tmpdir}
+}
+trap cleanup INT TERM EXIT
+
+cat > ${tmpdir}/redis.conf <<EOF
+daemonize yes
+pidfile ${PID_FILE}
+port ${REDIS_PORT}
+bind 127.0.0.1
+unixsocket ${SOCK_FILE}
+EOF
+
+if [ "$TEST_SSL" = "1" ]; then
+    cat >> ${tmpdir}/redis.conf <<EOF
+tls-port ${REDIS_SSL_PORT}
+tls-ca-cert-file ${SSL_CA_CERT}
+tls-cert-file ${SSL_CERT}
+tls-key-file ${SSL_KEY}
+EOF
+fi
+
+cat ${tmpdir}/redis.conf
+${REDIS_SERVER} ${tmpdir}/redis.conf
+
+# Wait until we detect the unix socket
+while [ ! -S "${SOCK_FILE}" ]; do sleep 1; done
+
+# Treat skips as failures if directed
+[ "$SKIPS_AS_FAILS" = 1 ] && SKIPS_ARG="--skips-as-fails"
+
+${TEST_PREFIX:-} ./hiredis-test -h 127.0.0.1 -p ${REDIS_PORT} -s ${SOCK_FILE} ${SSL_TEST_ARGS} ${SKIPS_ARG}
diff --git a/redis-stable/deps/hiredis/win32.h b/redis-stable/deps/hiredis/win32.h
new file mode 100644
index 00000000..04289c69
--- /dev/null
+++ b/redis-stable/deps/hiredis/win32.h
@@ -0,0 +1,56 @@
+#ifndef _WIN32_HELPER_INCLUDE
+#define _WIN32_HELPER_INCLUDE
+#ifdef _MSC_VER
+
+#include <winsock2.h> /* for struct timeval */
+
+#ifndef inline
+#define inline __inline
+#endif
+
+#ifndef strcasecmp
+#define strcasecmp stricmp
+#endif
+
+#ifndef strncasecmp
+#define strncasecmp strnicmp
+#endif
+
+#ifndef va_copy
+#define va_copy(d,s) ((d) = (s))
+#endif
+
+#ifndef snprintf
+#define snprintf c99_snprintf
+
+__inline int c99_vsnprintf(char* str, size_t size, const char* format, va_list ap)
+{
+    int count = -1;
+
+    if (size != 0)
+        count = _vsnprintf_s(str, size, _TRUNCATE, format, ap);
+    if (count == -1)
+        count = _vscprintf(format, ap);
+
+    return count;
+}
+
+__inline int c99_snprintf(char* str, size_t size, const char* format, ...)
+{
+    int count;
+    va_list ap;
+
+    va_start(ap, format);
+    count = c99_vsnprintf(str, size, format, ap);
+    va_end(ap);
+
+    return count;
+}
+#endif
+#endif /* _MSC_VER */
+
+#ifdef _WIN32
+#define strerror_r(errno,buf,len) strerror_s(buf,len,errno)
+#endif /* _WIN32 */
+
+#endif /* _WIN32_HELPER_INCLUDE */
diff --git a/redis-stable/deps/jemalloc/.appveyor.yml b/redis-stable/deps/jemalloc/.appveyor.yml
new file mode 100644
index 00000000..9a7d00a9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/.appveyor.yml
@@ -0,0 +1,42 @@
+version: '{build}'
+
+environment:
+  matrix:
+  - MSYSTEM: MINGW64
+    CPU: x86_64
+    MSVC: amd64
+  - MSYSTEM: MINGW32
+    CPU: i686
+    MSVC: x86
+  - MSYSTEM: MINGW64
+    CPU: x86_64
+  - MSYSTEM: MINGW32
+    CPU: i686
+  - MSYSTEM: MINGW64
+    CPU: x86_64
+    MSVC: amd64
+    CONFIG_FLAGS: --enable-debug
+  - MSYSTEM: MINGW32
+    CPU: i686
+    MSVC: x86
+    CONFIG_FLAGS: --enable-debug
+  - MSYSTEM: MINGW64
+    CPU: x86_64
+    CONFIG_FLAGS: --enable-debug
+  - MSYSTEM: MINGW32
+    CPU: i686
+    CONFIG_FLAGS: --enable-debug
+
+install:
+  - set PATH=c:\msys64\%MSYSTEM%\bin;c:\msys64\usr\bin;%PATH%
+  - if defined MSVC call "c:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\vcvarsall.bat" %MSVC%
+  - if defined MSVC pacman --noconfirm -Rsc mingw-w64-%CPU%-gcc gcc
+  - pacman --noconfirm -Suy mingw-w64-%CPU%-make
+
+build_script:
+  - bash -c "autoconf"
+  - bash -c "./configure $CONFIG_FLAGS"
+  - mingw32-make
+  - file lib/jemalloc.dll
+  - mingw32-make tests
+  - mingw32-make -k check
diff --git a/redis-stable/deps/jemalloc/.autom4te.cfg b/redis-stable/deps/jemalloc/.autom4te.cfg
new file mode 100644
index 00000000..fe2424db
--- /dev/null
+++ b/redis-stable/deps/jemalloc/.autom4te.cfg
@@ -0,0 +1,3 @@
+begin-language: "Autoconf-without-aclocal-m4"
+args: --no-cache
+end-language: "Autoconf-without-aclocal-m4"
diff --git a/redis-stable/deps/jemalloc/.gitattributes b/redis-stable/deps/jemalloc/.gitattributes
new file mode 100644
index 00000000..6313b56c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/.gitattributes
@@ -0,0 +1 @@
+* text=auto eol=lf
diff --git a/redis-stable/deps/jemalloc/.gitignore b/redis-stable/deps/jemalloc/.gitignore
new file mode 100644
index 00000000..19199ccb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/.gitignore
@@ -0,0 +1,93 @@
+/bin/jemalloc-config
+/bin/jemalloc.sh
+/bin/jeprof
+
+/config.stamp
+/config.log
+/config.status
+/configure
+
+/doc/html.xsl
+/doc/manpages.xsl
+/doc/jemalloc.xml
+/doc/jemalloc.html
+/doc/jemalloc.3
+
+/jemalloc.pc
+
+/lib/
+
+/Makefile
+
+/include/jemalloc/internal/jemalloc_preamble.h
+/include/jemalloc/internal/jemalloc_internal_defs.h
+/include/jemalloc/internal/private_namespace.gen.h
+/include/jemalloc/internal/private_namespace.h
+/include/jemalloc/internal/private_namespace_jet.gen.h
+/include/jemalloc/internal/private_namespace_jet.h
+/include/jemalloc/internal/private_symbols.awk
+/include/jemalloc/internal/private_symbols_jet.awk
+/include/jemalloc/internal/public_namespace.h
+/include/jemalloc/internal/public_symbols.txt
+/include/jemalloc/internal/public_unnamespace.h
+/include/jemalloc/internal/size_classes.h
+/include/jemalloc/jemalloc.h
+/include/jemalloc/jemalloc_defs.h
+/include/jemalloc/jemalloc_macros.h
+/include/jemalloc/jemalloc_mangle.h
+/include/jemalloc/jemalloc_mangle_jet.h
+/include/jemalloc/jemalloc_protos.h
+/include/jemalloc/jemalloc_protos_jet.h
+/include/jemalloc/jemalloc_rename.h
+/include/jemalloc/jemalloc_typedefs.h
+
+/src/*.[od]
+/src/*.sym
+
+/run_tests.out/
+
+/test/test.sh
+test/include/test/jemalloc_test.h
+test/include/test/jemalloc_test_defs.h
+
+/test/integration/[A-Za-z]*
+!/test/integration/[A-Za-z]*.*
+/test/integration/*.[od]
+/test/integration/*.out
+
+/test/integration/cpp/[A-Za-z]*
+!/test/integration/cpp/[A-Za-z]*.*
+/test/integration/cpp/*.[od]
+/test/integration/cpp/*.out
+
+/test/src/*.[od]
+
+/test/stress/[A-Za-z]*
+!/test/stress/[A-Za-z]*.*
+/test/stress/*.[od]
+/test/stress/*.out
+
+/test/unit/[A-Za-z]*
+!/test/unit/[A-Za-z]*.*
+/test/unit/*.[od]
+/test/unit/*.out
+
+/VERSION
+
+*.pdb
+*.sdf
+*.opendb
+*.VC.db
+*.opensdf
+*.cachefile
+*.suo
+*.user
+*.sln.docstates
+*.tmp
+.vs/
+/msvc/Win32/
+/msvc/x64/
+/msvc/projects/*/*/Debug*/
+/msvc/projects/*/*/Release*/
+/msvc/projects/*/*/Win32/
+/msvc/projects/*/*/x64/
diff --git a/redis-stable/deps/jemalloc/.travis.yml b/redis-stable/deps/jemalloc/.travis.yml
new file mode 100644
index 00000000..4cc116e5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/.travis.yml
@@ -0,0 +1,156 @@
+language: generic
+dist: precise
+
+matrix:
+  include:
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: osx
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary,percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+    - os: linux
+      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
+
+
+before_script:
+  - autoconf
+  - ./configure ${COMPILER_FLAGS:+       CC="$CC $COMPILER_FLAGS"       CXX="$CXX $COMPILER_FLAGS" }       $CONFIGURE_FLAGS
+  - make -j3
+  - make -j3 tests
+
+script:
+  - make check
+
diff --git a/redis-stable/deps/jemalloc/COPYING b/redis-stable/deps/jemalloc/COPYING
new file mode 100644
index 00000000..98458d97
--- /dev/null
+++ b/redis-stable/deps/jemalloc/COPYING
@@ -0,0 +1,27 @@
+Unless otherwise specified, files in the jemalloc source distribution are
+subject to the following license:
+--------------------------------------------------------------------------------
+Copyright (C) 2002-2018 Jason Evans <jasone@canonware.com>.
+All rights reserved.
+Copyright (C) 2007-2012 Mozilla Foundation.  All rights reserved.
+Copyright (C) 2009-2018 Facebook, Inc.  All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+1. Redistributions of source code must retain the above copyright notice(s),
+   this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright notice(s),
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+--------------------------------------------------------------------------------
diff --git a/redis-stable/deps/jemalloc/ChangeLog b/redis-stable/deps/jemalloc/ChangeLog
new file mode 100644
index 00000000..29a00fb7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/ChangeLog
@@ -0,0 +1,1382 @@
+Following are change highlights associated with official releases.  Important
+bug fixes are all mentioned, but some internal enhancements are omitted here for
+brevity.  Much more detail can be found in the git revision history:
+
+    https://github.com/jemalloc/jemalloc
+
+* 5.1.0 (May 4th, 2018)
+
+  This release is primarily about fine-tuning, ranging from several new features
+  to numerous notable performance and portability enhancements.  The release and
+  prior dev versions have been running in multiple large scale applications for
+  months, and the cumulative improvements are substantial in many cases.
+
+  Given the long and successful production runs, this release is likely a good
+  candidate for applications to upgrade, from both jemalloc 5.0 and before.  For
+  performance-critical applications, the newly added TUNING.md provides
+  guidelines on jemalloc tuning.
+
+  New features:
+  - Implement transparent huge page support for internal metadata.  (@interwq)
+  - Add opt.thp to allow enabling / disabling transparent huge pages for all
+    mappings.  (@interwq)
+  - Add maximum background thread count option.  (@djwatson)
+  - Allow prof_active to control opt.lg_prof_interval and prof.gdump.
+    (@interwq)
+  - Allow arena index lookup based on allocation addresses via mallctl.
+    (@lionkov)
+  - Allow disabling initial-exec TLS model.  (@davidtgoldblatt, @KenMacD)
+  - Add opt.lg_extent_max_active_fit to set the max ratio between the size of
+    the active extent selected (to split off from) and the size of the requested
+    allocation.  (@interwq, @davidtgoldblatt)
+  - Add retain_grow_limit to set the max size when growing virtual address
+    space.  (@interwq)
+  - Add mallctl interfaces:
+    + arena.<i>.retain_grow_limit  (@interwq)
+    + arenas.lookup  (@lionkov)
+    + max_background_threads  (@djwatson)
+    + opt.lg_extent_max_active_fit  (@interwq)
+    + opt.max_background_threads  (@djwatson)
+    + opt.metadata_thp  (@interwq)
+    + opt.thp  (@interwq)
+    + stats.metadata_thp  (@interwq)
+
+  Portability improvements:
+  - Support GNU/kFreeBSD configuration.  (@paravoid)
+  - Support m68k, nios2 and SH3 architectures.  (@paravoid)
+  - Fall back to FD_CLOEXEC when O_CLOEXEC is unavailable.  (@zonyitoo)
+  - Fix symbol listing for cross-compiling.  (@tamird)
+  - Fix high bits computation on ARM.  (@davidtgoldblatt, @paravoid)
+  - Disable the CPU_SPINWAIT macro for Power.  (@davidtgoldblatt, @marxin)
+  - Fix MSVC 2015 & 2017 builds.  (@rustyx)
+  - Improve RISC-V support.  (@EdSchouten)
+  - Set name mangling script in strict mode.  (@nicolov)
+  - Avoid MADV_HUGEPAGE on ARM.  (@marxin)
+  - Modify configure to determine return value of strerror_r.
+    (@davidtgoldblatt, @cferris1000)
+  - Make sure CXXFLAGS is tested with CPP compiler.  (@nehaljwani)
+  - Fix 32-bit build on MSVC.  (@rustyx)
+  - Fix external symbol on MSVC.  (@maksqwe)
+  - Avoid a printf format specifier warning.  (@jasone)
+  - Add configure option --disable-initial-exec-tls which can allow jemalloc to
+    be dynamically loaded after program startup.  (@davidtgoldblatt, @KenMacD)
+  - AArch64: Add ILP32 support.  (@cmuellner)
+  - Add --with-lg-vaddr configure option to support cross compiling.
+    (@cmuellner, @davidtgoldblatt)
+
+  Optimizations and refactors:
+  - Improve active extent fit with extent_max_active_fit.  This considerably
+    reduces fragmentation over time and improves virtual memory and metadata
+    usage.  (@davidtgoldblatt, @interwq)
+  - Eagerly coalesce large extents to reduce fragmentation.  (@interwq)
+  - sdallocx: only read size info when page aligned (i.e. possibly sampled),
+    which speeds up the sized deallocation path significantly.  (@interwq)
+  - Avoid attempting new mappings for in place expansion with retain, since
+    it rarely succeeds in practice and causes high overhead.  (@interwq)
+  - Refactor OOM handling in newImpl.  (@wqfish)
+  - Add internal fine-grained logging functionality for debugging use.
+    (@davidtgoldblatt)
+  - Refactor arena / tcache interactions.  (@davidtgoldblatt)
+  - Refactor extent management with dumpable flag.  (@davidtgoldblatt)
+  - Add runtime detection of lazy purging.  (@interwq)
+  - Use pairing heap instead of red-black tree for extents_avail.  (@djwatson)
+  - Use sysctl on startup in FreeBSD.  (@trasz)
+  - Use thread local prng state instead of atomic.  (@djwatson)
+  - Make decay to always purge one more extent than before, because in
+    practice large extents are usually the ones that cross the decay threshold.
+    Purging the additional extent helps save memory as well as reduce VM
+    fragmentation.  (@interwq)
+  - Fast division by dynamic values.  (@davidtgoldblatt)
+  - Improve the fit for aligned allocation.  (@interwq, @edwinsmith)
+  - Refactor extent_t bitpacking.  (@rkmisra)
+  - Optimize the generated assembly for ticker operations.  (@davidtgoldblatt)
+  - Convert stats printing to use a structured text emitter.  (@davidtgoldblatt)
+  - Remove preserve_lru feature for extents management.  (@djwatson)
+  - Consolidate two memory loads into one on the fast deallocation path.
+    (@davidtgoldblatt, @interwq)
+
+  Bug fixes (most of the issues are only relevant to jemalloc 5.0):
+  - Fix deadlock with multithreaded fork in OS X.  (@davidtgoldblatt)
+  - Validate returned file descriptor before use.  (@zonyitoo)
+  - Fix a few background thread initialization and shutdown issues.  (@interwq)
+  - Fix an extent coalesce + decay race by taking both coalescing extents off
+    the LRU list.  (@interwq)
+  - Fix potentially unbound increase during decay, caused by one thread keep
+    stashing memory to purge while other threads generating new pages.  The
+    number of pages to purge is checked to prevent this.  (@interwq)
+  - Fix a FreeBSD bootstrap assertion.  (@strejda, @interwq)
+  - Handle 32 bit mutex counters.  (@rkmisra)
+  - Fix a indexing bug when creating background threads.  (@davidtgoldblatt,
+    @binliu19)
+  - Fix arguments passed to extent_init.  (@yuleniwo, @interwq)
+  - Fix addresses used for ordering mutexes.  (@rkmisra)
+  - Fix abort_conf processing during bootstrap.  (@interwq)
+  - Fix include path order for out-of-tree builds.  (@cmuellner)
+
+  Incompatible changes:
+  - Remove --disable-thp.  (@interwq)
+  - Remove mallctl interfaces:
+    + config.thp  (@interwq)
+
+  Documentation:
+  - Add TUNING.md.  (@interwq, @davidtgoldblatt, @djwatson)
+
+* 5.0.1 (July 1, 2017)
+
+  This bugfix release fixes several issues, most of which are obscure enough
+  that typical applications are not impacted.
+
+  Bug fixes:
+  - Update decay->nunpurged before purging, in order to avoid potential update
+    races and subsequent incorrect purging volume.  (@interwq)
+  - Only abort on dlsym(3) error if the failure impacts an enabled feature (lazy
+    locking and/or background threads).  This mitigates an initialization
+    failure bug for which we still do not have a clear reproduction test case.
+    (@interwq)
+  - Modify tsd management so that it neither crashes nor leaks if a thread's
+    only allocation activity is to call free() after TLS destructors have been
+    executed.  This behavior was observed when operating with GNU libc, and is
+    unlikely to be an issue with other libc implementations.  (@interwq)
+  - Mask signals during background thread creation.  This prevents signals from
+    being inadvertently delivered to background threads.  (@jasone,
+    @davidtgoldblatt, @interwq)
+  - Avoid inactivity checks within background threads, in order to prevent
+    recursive mutex acquisition.  (@interwq)
+  - Fix extent_grow_retained() to use the specified hooks when the
+    arena.<i>.extent_hooks mallctl is used to override the default hooks.
+    (@interwq)
+  - Add missing reentrancy support for custom extent hooks which allocate.
+    (@interwq)
+  - Post-fork(2), re-initialize the list of tcaches associated with each arena
+    to contain no tcaches except the forking thread's.  (@interwq)
+  - Add missing post-fork(2) mutex reinitialization for extent_grow_mtx.  This
+    fixes potential deadlocks after fork(2).  (@interwq)
+  - Enforce minimum autoconf version (currently 2.68), since 2.63 is known to
+    generate corrupt configure scripts.  (@jasone)
+  - Ensure that the configured page size (--with-lg-page) is no larger than the
+    configured huge page size (--with-lg-hugepage).  (@jasone)
+
+* 5.0.0 (June 13, 2017)
+
+  Unlike all previous jemalloc releases, this release does not use naturally
+  aligned "chunks" for virtual memory management, and instead uses page-aligned
+  "extents".  This change has few externally visible effects, but the internal
+  impacts are... extensive.  Many other internal changes combine to make this
+  the most cohesively designed version of jemalloc so far, with ample
+  opportunity for further enhancements.
+
+  Continuous integration is now an integral aspect of development thanks to the
+  efforts of @davidtgoldblatt, and the dev branch tends to remain reasonably
+  stable on the tested platforms (Linux, FreeBSD, macOS, and Windows).  As a
+  side effect the official release frequency may decrease over time.
+
+  New features:
+  - Implement optional per-CPU arena support; threads choose which arena to use
+    based on current CPU rather than on fixed thread-->arena associations.
+    (@interwq)
+  - Implement two-phase decay of unused dirty pages.  Pages transition from
+    dirty-->muzzy-->clean, where the first phase transition relies on
+    madvise(... MADV_FREE) semantics, and the second phase transition discards
+    pages such that they are replaced with demand-zeroed pages on next access.
+    (@jasone)
+  - Increase decay time resolution from seconds to milliseconds.  (@jasone)
+  - Implement opt-in per CPU background threads, and use them for asynchronous
+    decay-driven unused dirty page purging.  (@interwq)
+  - Add mutex profiling, which collects a variety of statistics useful for
+    diagnosing overhead/contention issues.  (@interwq)
+  - Add C++ new/delete operator bindings.  (@djwatson)
+  - Support manually created arena destruction, such that all data and metadata
+    are discarded.  Add MALLCTL_ARENAS_DESTROYED for accessing merged stats
+    associated with destroyed arenas.  (@jasone)
+  - Add MALLCTL_ARENAS_ALL as a fixed index for use in accessing
+    merged/destroyed arena statistics via mallctl.  (@jasone)
+  - Add opt.abort_conf to optionally abort if invalid configuration options are
+    detected during initialization.  (@interwq)
+  - Add opt.stats_print_opts, so that e.g. JSON output can be selected for the
+    stats dumped during exit if opt.stats_print is true.  (@jasone)
+  - Add --with-version=VERSION for use when embedding jemalloc into another
+    project's git repository.  (@jasone)
+  - Add --disable-thp to support cross compiling.  (@jasone)
+  - Add --with-lg-hugepage to support cross compiling.  (@jasone)
+  - Add mallctl interfaces (various authors):
+    + background_thread
+    + opt.abort_conf
+    + opt.retain
+    + opt.percpu_arena
+    + opt.background_thread
+    + opt.{dirty,muzzy}_decay_ms
+    + opt.stats_print_opts
+    + arena.<i>.initialized
+    + arena.<i>.destroy
+    + arena.<i>.{dirty,muzzy}_decay_ms
+    + arena.<i>.extent_hooks
+    + arenas.{dirty,muzzy}_decay_ms
+    + arenas.bin.<i>.slab_size
+    + arenas.nlextents
+    + arenas.lextent.<i>.size
+    + arenas.create
+    + stats.background_thread.{num_threads,num_runs,run_interval}
+    + stats.mutexes.{ctl,background_thread,prof,reset}.
+      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
+      num_owner_switch}
+    + stats.arenas.<i>.{dirty,muzzy}_decay_ms
+    + stats.arenas.<i>.uptime
+    + stats.arenas.<i>.{pmuzzy,base,internal,resident}
+    + stats.arenas.<i>.{dirty,muzzy}_{npurge,nmadvise,purged}
+    + stats.arenas.<i>.bins.<j>.{nslabs,reslabs,curslabs}
+    + stats.arenas.<i>.bins.<j>.mutex.
+      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
+      num_owner_switch}
+    + stats.arenas.<i>.lextents.<j>.{nmalloc,ndalloc,nrequests,curlextents}
+    + stats.arenas.i.mutexes.{large,extent_avail,extents_dirty,extents_muzzy,
+      extents_retained,decay_dirty,decay_muzzy,base,tcache_list}.
+      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
+      num_owner_switch}
+
+  Portability improvements:
+  - Improve reentrant allocation support, such that deadlock is less likely if
+    e.g. a system library call in turn allocates memory.  (@davidtgoldblatt,
+    @interwq)
+  - Support static linking of jemalloc with glibc.  (@djwatson)
+
+  Optimizations and refactors:
+  - Organize virtual memory as "extents" of virtual memory pages, rather than as
+    naturally aligned "chunks", and store all metadata in arbitrarily distant
+    locations.  This reduces virtual memory external fragmentation, and will
+    interact better with huge pages (not yet explicitly supported).  (@jasone)
+  - Fold large and huge size classes together; only small and large size classes
+    remain.  (@jasone)
+  - Unify the allocation paths, and merge most fast-path branching decisions.
+    (@davidtgoldblatt, @interwq)
+  - Embed per thread automatic tcache into thread-specific data, which reduces
+    conditional branches and dereferences.  Also reorganize tcache to increase
+    fast-path data locality.  (@interwq)
+  - Rewrite atomics to closely model the C11 API, convert various
+    synchronization from mutex-based to atomic, and use the explicit memory
+    ordering control to resolve various hypothetical races without increasing
+    synchronization overhead.  (@davidtgoldblatt)
+  - Extensively optimize rtree via various methods:
+    + Add multiple layers of rtree lookup caching, since rtree lookups are now
+      part of fast-path deallocation.  (@interwq)
+    + Determine rtree layout at compile time.  (@jasone)
+    + Make the tree shallower for common configurations.  (@jasone)
+    + Embed the root node in the top-level rtree data structure, thus avoiding
+      one level of indirection.  (@jasone)
+    + Further specialize leaf elements as compared to internal node elements,
+      and directly embed extent metadata needed for fast-path deallocation.
+      (@jasone)
+    + Ignore leading always-zero address bits (architecture-specific).
+      (@jasone)
+  - Reorganize headers (ongoing work) to make them hermetic, and disentangle
+    various module dependencies.  (@davidtgoldblatt)
+  - Convert various internal data structures such as size class metadata from
+    boot-time-initialized to compile-time-initialized.  Propagate resulting data
+    structure simplifications, such as making arena metadata fixed-size.
+    (@jasone)
+  - Simplify size class lookups when constrained to size classes that are
+    multiples of the page size.  This speeds lookups, but the primary benefit is
+    complexity reduction in code that was the source of numerous regressions.
+    (@jasone)
+  - Lock individual extents when possible for localized extent operations,
+    rather than relying on a top-level arena lock.  (@davidtgoldblatt, @jasone)
+  - Use first fit layout policy instead of best fit, in order to improve
+    packing.  (@jasone)
+  - If munmap(2) is not in use, use an exponential series to grow each arena's
+    virtual memory, so that the number of disjoint virtual memory mappings
+    remains low.  (@jasone)
+  - Implement per arena base allocators, so that arenas never share any virtual
+    memory pages.  (@jasone)
+  - Automatically generate private symbol name mangling macros.  (@jasone)
+
+  Incompatible changes:
+  - Replace chunk hooks with an expanded/normalized set of extent hooks.
+    (@jasone)
+  - Remove ratio-based purging.  (@jasone)
+  - Remove --disable-tcache.  (@jasone)
+  - Remove --disable-tls.  (@jasone)
+  - Remove --enable-ivsalloc.  (@jasone)
+  - Remove --with-lg-size-class-group.  (@jasone)
+  - Remove --with-lg-tiny-min.  (@jasone)
+  - Remove --disable-cc-silence.  (@jasone)
+  - Remove --enable-code-coverage.  (@jasone)
+  - Remove --disable-munmap (replaced by opt.retain).  (@jasone)
+  - Remove Valgrind support.  (@jasone)
+  - Remove quarantine support.  (@jasone)
+  - Remove redzone support.  (@jasone)
+  - Remove mallctl interfaces (various authors):
+    + config.munmap
+    + config.tcache
+    + config.tls
+    + config.valgrind
+    + opt.lg_chunk
+    + opt.purge
+    + opt.lg_dirty_mult
+    + opt.decay_time
+    + opt.quarantine
+    + opt.redzone
+    + opt.thp
+    + arena.<i>.lg_dirty_mult
+    + arena.<i>.decay_time
+    + arena.<i>.chunk_hooks
+    + arenas.initialized
+    + arenas.lg_dirty_mult
+    + arenas.decay_time
+    + arenas.bin.<i>.run_size
+    + arenas.nlruns
+    + arenas.lrun.<i>.size
+    + arenas.nhchunks
+    + arenas.hchunk.<i>.size
+    + arenas.extend
+    + stats.cactive
+    + stats.arenas.<i>.lg_dirty_mult
+    + stats.arenas.<i>.decay_time
+    + stats.arenas.<i>.metadata.{mapped,allocated}
+    + stats.arenas.<i>.{npurge,nmadvise,purged}
+    + stats.arenas.<i>.huge.{allocated,nmalloc,ndalloc,nrequests}
+    + stats.arenas.<i>.bins.<j>.{nruns,reruns,curruns}
+    + stats.arenas.<i>.lruns.<j>.{nmalloc,ndalloc,nrequests,curruns}
+    + stats.arenas.<i>.hchunks.<j>.{nmalloc,ndalloc,nrequests,curhchunks}
+
+  Bug fixes:
+  - Improve interval-based profile dump triggering to dump only one profile when
+    a single allocation's size exceeds the interval.  (@jasone)
+  - Use prefixed function names (as controlled by --with-jemalloc-prefix) when
+    pruning backtrace frames in jeprof.  (@jasone)
+
+* 4.5.0 (February 28, 2017)
+
+  This is the first release to benefit from much broader continuous integration
+  testing, thanks to @davidtgoldblatt.  Had we had this testing infrastructure
+  in place for prior releases, it would have caught all of the most serious
+  regressions fixed by this release.
+
+  New features:
+  - Add --disable-thp and the opt.thp mallctl to provide opt-out mechanisms for
+    transparent huge page integration.  (@jasone)
+  - Update zone allocator integration to work with macOS 10.12.  (@glandium)
+  - Restructure *CFLAGS configuration, so that CFLAGS behaves typically, and
+    EXTRA_CFLAGS provides a way to specify e.g. -Werror during building, but not
+    during configuration.  (@jasone, @ronawho)
+
+  Bug fixes:
+  - Fix DSS (sbrk(2)-based) allocation.  This regression was first released in
+    4.3.0.  (@jasone)
+  - Handle race in per size class utilization computation.  This functionality
+    was first released in 4.0.0.  (@interwq)
+  - Fix lock order reversal during gdump.  (@jasone)
+  - Fix/refactor tcache synchronization.  This regression was first released in
+    4.0.0.  (@jasone)
+  - Fix various JSON-formatted malloc_stats_print() bugs.  This functionality
+    was first released in 4.3.0.  (@jasone)
+  - Fix huge-aligned allocation.  This regression was first released in 4.4.0.
+    (@jasone)
+  - When transparent huge page integration is enabled, detect what state pages
+    start in according to the kernel's current operating mode, and only convert
+    arena chunks to non-huge during purging if that is not their initial state.
+    This functionality was first released in 4.4.0.  (@jasone)
+  - Fix lg_chunk clamping for the --enable-cache-oblivious --disable-fill case.
+    This regression was first released in 4.0.0.  (@jasone, @428desmo)
+  - Properly detect sparc64 when building for Linux.  (@glaubitz)
+
+* 4.4.0 (December 3, 2016)
+
+  New features:
+  - Add configure support for *-*-linux-android.  (@cferris1000, @jasone)
+  - Add the --disable-syscall configure option, for use on systems that place
+    security-motivated limitations on syscall(2).  (@jasone)
+  - Add support for Debian GNU/kFreeBSD.  (@thesam)
+
+  Optimizations:
+  - Add extent serial numbers and use them where appropriate as a sort key that
+    is higher priority than address, so that the allocation policy prefers older
+    extents.  This tends to improve locality (decrease fragmentation) when
+    memory grows downward.  (@jasone)
+  - Refactor madvise(2) configuration so that MADV_FREE is detected and utilized
+    on Linux 4.5 and newer.  (@jasone)
+  - Mark partially purged arena chunks as non-huge-page.  This improves
+    interaction with Linux's transparent huge page functionality.  (@jasone)
+
+  Bug fixes:
+  - Fix size class computations for edge conditions involving extremely large
+    allocations.  This regression was first released in 4.0.0.  (@jasone,
+    @ingvarha)
+  - Remove overly restrictive assertions related to the cactive statistic.  This
+    regression was first released in 4.1.0.  (@jasone)
+  - Implement a more reliable detection scheme for os_unfair_lock on macOS.
+    (@jszakmeister)
+
+* 4.3.1 (November 7, 2016)
+
+  Bug fixes:
+  - Fix a severe virtual memory leak.  This regression was first released in
+    4.3.0.  (@interwq, @jasone)
+  - Refactor atomic and prng APIs to restore support for 32-bit platforms that
+    use pre-C11 toolchains, e.g. FreeBSD's mips.  (@jasone)
+
+* 4.3.0 (November 4, 2016)
+
+  This is the first release that passes the test suite for multiple Windows
+  configurations, thanks in large part to @glandium setting up continuous
+  integration via AppVeyor (and Travis CI for Linux and OS X).
+
+  New features:
+  - Add "J" (JSON) support to malloc_stats_print().  (@jasone)
+  - Add Cray compiler support.  (@ronawho)
+
+  Optimizations:
+  - Add/use adaptive spinning for bootstrapping and radix tree node
+    initialization.  (@jasone)
+
+  Bug fixes:
+  - Fix large allocation to search starting in the optimal size class heap,
+    which can substantially reduce virtual memory churn and fragmentation.  This
+    regression was first released in 4.0.0.  (@mjp41, @jasone)
+  - Fix stats.arenas.<i>.nthreads accounting.  (@interwq)
+  - Fix and simplify decay-based purging.  (@jasone)
+  - Make DSS (sbrk(2)-related) operations lockless, which resolves potential
+    deadlocks during thread exit.  (@jasone)
+  - Fix over-sized allocation of radix tree leaf nodes.  (@mjp41, @ogaun,
+    @jasone)
+  - Fix over-sized allocation of arena_t (plus associated stats) data
+    structures.  (@jasone, @interwq)
+  - Fix EXTRA_CFLAGS to not affect configuration.  (@jasone)
+  - Fix a Valgrind integration bug.  (@ronawho)
+  - Disallow 0x5a junk filling when running in Valgrind.  (@jasone)
+  - Fix a file descriptor leak on Linux.  This regression was first released in
+    4.2.0.  (@vsarunas, @jasone)
+  - Fix static linking of jemalloc with glibc.  (@djwatson)
+  - Use syscall(2) rather than {open,read,close}(2) during boot on Linux.  This
+    works around other libraries' system call wrappers performing reentrant
+    allocation.  (@kspinka, @Whissi, @jasone)
+  - Fix OS X default zone replacement to work with OS X 10.12.  (@glandium,
+    @jasone)
+  - Fix cached memory management to avoid needless commit/decommit operations
+    during purging, which resolves permanent virtual memory map fragmentation
+    issues on Windows.  (@mjp41, @jasone)
+  - Fix TSD fetches to avoid (recursive) allocation.  This is relevant to
+    non-TLS and Windows configurations.  (@jasone)
+  - Fix malloc_conf overriding to work on Windows.  (@jasone)
+  - Forcibly disable lazy-lock on Windows (was forcibly *enabled*).  (@jasone)
+
+* 4.2.1 (June 8, 2016)
+
+  Bug fixes:
+  - Fix bootstrapping issues for configurations that require allocation during
+    tsd initialization (e.g. --disable-tls).  (@cferris1000, @jasone)
+  - Fix gettimeofday() version of nstime_update().  (@ronawho)
+  - Fix Valgrind regressions in calloc() and chunk_alloc_wrapper().  (@ronawho)
+  - Fix potential VM map fragmentation regression.  (@jasone)
+  - Fix opt_zero-triggered in-place huge reallocation zeroing.  (@jasone)
+  - Fix heap profiling context leaks in reallocation edge cases.  (@jasone)
+
+* 4.2.0 (May 12, 2016)
+
+  New features:
+  - Add the arena.<i>.reset mallctl, which makes it possible to discard all of
+    an arena's allocations in a single operation.  (@jasone)
+  - Add the stats.retained and stats.arenas.<i>.retained statistics.  (@jasone)
+  - Add the --with-version configure option.  (@jasone)
+  - Support --with-lg-page values larger than actual page size.  (@jasone)
+
+  Optimizations:
+  - Use pairing heaps rather than red-black trees for various hot data
+    structures.  (@djwatson, @jasone)
+  - Streamline fast paths of rtree operations.  (@jasone)
+  - Optimize the fast paths of calloc() and [m,d,sd]allocx().  (@jasone)
+  - Decommit unused virtual memory if the OS does not overcommit.  (@jasone)
+  - Specify MAP_NORESERVE on Linux if [heuristic] overcommit is active, in order
+    to avoid unfortunate interactions during fork(2).  (@jasone)
+
+  Bug fixes:
+  - Fix chunk accounting related to triggering gdump profiles.  (@jasone)
+  - Link against librt for clock_gettime(2) if glibc < 2.17.  (@jasone)
+  - Scale leak report summary according to sampling probability.  (@jasone)
+
+* 4.1.1 (May 3, 2016)
+
+  This bugfix release resolves a variety of mostly minor issues, though the
+  bitmap fix is critical for 64-bit Windows.
+
+  Bug fixes:
+  - Fix the linear scan version of bitmap_sfu() to shift by the proper amount
+    even when sizeof(long) is not the same as sizeof(void *), as on 64-bit
+    Windows.  (@jasone)
+  - Fix hashing functions to avoid unaligned memory accesses (and resulting
+    crashes).  This is relevant at least to some ARM-based platforms.
+    (@rkmisra)
+  - Fix fork()-related lock rank ordering reversals.  These reversals were
+    unlikely to cause deadlocks in practice except when heap profiling was
+    enabled and active.  (@jasone)
+  - Fix various chunk leaks in OOM code paths.  (@jasone)
+  - Fix malloc_stats_print() to print opt.narenas correctly.  (@jasone)
+  - Fix MSVC-specific build/test issues.  (@rustyx, @yuslepukhin)
+  - Fix a variety of test failures that were due to test fragility rather than
+    core bugs.  (@jasone)
+
+* 4.1.0 (February 28, 2016)
+
+  This release is primarily about optimizations, but it also incorporates a lot
+  of portability-motivated refactoring and enhancements.  Many people worked on
+  this release, to an extent that even with the omission here of minor changes
+  (see git revision history), and of the people who reported and diagnosed
+  issues, so much of the work was contributed that starting with this release,
+  changes are annotated with author credits to help reflect the collaborative
+  effort involved.
+
+  New features:
+  - Implement decay-based unused dirty page purging, a major optimization with
+    mallctl API impact.  This is an alternative to the existing ratio-based
+    unused dirty page purging, and is intended to eventually become the sole
+    purging mechanism.  New mallctls:
+    + opt.purge
+    + opt.decay_time
+    + arena.<i>.decay
+    + arena.<i>.decay_time
+    + arenas.decay_time
+    + stats.arenas.<i>.decay_time
+    (@jasone, @cevans87)
+  - Add --with-malloc-conf, which makes it possible to embed a default
+    options string during configuration.  This was motivated by the desire to
+    specify --with-malloc-conf=purge:decay , since the default must remain
+    purge:ratio until the 5.0.0 release.  (@jasone)
+  - Add MS Visual Studio 2015 support.  (@rustyx, @yuslepukhin)
+  - Make *allocx() size class overflow behavior defined.  The maximum
+    size class is now less than PTRDIFF_MAX to protect applications against
+    numerical overflow, and all allocation functions are guaranteed to indicate
+    errors rather than potentially crashing if the request size exceeds the
+    maximum size class.  (@jasone)
+  - jeprof:
+    + Add raw heap profile support.  (@jasone)
+    + Add --retain and --exclude for backtrace symbol filtering.  (@jasone)
+
+  Optimizations:
+  - Optimize the fast path to combine various bootstrapping and configuration
+    checks and execute more streamlined code in the common case.  (@interwq)
+  - Use linear scan for small bitmaps (used for small object tracking).  In
+    addition to speeding up bitmap operations on 64-bit systems, this reduces
+    allocator metadata overhead by approximately 0.2%.  (@djwatson)
+  - Separate arena_avail trees, which substantially speeds up run tree
+    operations.  (@djwatson)
+  - Use memoization (boot-time-computed table) for run quantization.  Separate
+    arena_avail trees reduced the importance of this optimization.  (@jasone)
+  - Attempt mmap-based in-place huge reallocation.  This can dramatically speed
+    up incremental huge reallocation.  (@jasone)
+
+  Incompatible changes:
+  - Make opt.narenas unsigned rather than size_t.  (@jasone)
+
+  Bug fixes:
+  - Fix stats.cactive accounting regression.  (@rustyx, @jasone)
+  - Handle unaligned keys in hash().  This caused problems for some ARM systems.
+    (@jasone, @cferris1000)
+  - Refactor arenas array.  In addition to fixing a fork-related deadlock, this
+    makes arena lookups faster and simpler.  (@jasone)
+  - Move retained memory allocation out of the default chunk allocation
+    function, to a location that gets executed even if the application installs
+    a custom chunk allocation function.  This resolves a virtual memory leak.
+    (@buchgr)
+  - Fix a potential tsd cleanup leak.  (@cferris1000, @jasone)
+  - Fix run quantization.  In practice this bug had no impact unless
+    applications requested memory with alignment exceeding one page.
+    (@jasone, @djwatson)
+  - Fix LinuxThreads-specific bootstrapping deadlock.  (Cosmin Paraschiv)
+  - jeprof:
+    + Don't discard curl options if timeout is not defined.  (@djwatson)
+    + Detect failed profile fetches.  (@djwatson)
+  - Fix stats.arenas.<i>.{dss,lg_dirty_mult,decay_time,pactive,pdirty} for
+    --disable-stats case.  (@jasone)
+
+* 4.0.4 (October 24, 2015)
+
+  This bugfix release fixes another xallocx() regression.  No other regressions
+  have come to light in over a month, so this is likely a good starting point
+  for people who prefer to wait for "dot one" releases with all the major issues
+  shaken out.
+
+  Bug fixes:
+  - Fix xallocx(..., MALLOCX_ZERO to zero the last full trailing page of large
+    allocations that have been randomly assigned an offset of 0 when
+    --enable-cache-oblivious configure option is enabled.
+
+* 4.0.3 (September 24, 2015)
+
+  This bugfix release continues the trend of xallocx() and heap profiling fixes.
+
+  Bug fixes:
+  - Fix xallocx(..., MALLOCX_ZERO) to zero all trailing bytes of large
+    allocations when --enable-cache-oblivious configure option is enabled.
+  - Fix xallocx(..., MALLOCX_ZERO) to zero trailing bytes of huge allocations
+    when resizing from/to a size class that is not a multiple of the chunk size.
+  - Fix prof_tctx_dump_iter() to filter out nodes that were created after heap
+    profile dumping started.
+  - Work around a potentially bad thread-specific data initialization
+    interaction with NPTL (glibc's pthreads implementation).
+
+* 4.0.2 (September 21, 2015)
+
+  This bugfix release addresses a few bugs specific to heap profiling.
+
+  Bug fixes:
+  - Fix ixallocx_prof_sample() to never modify nor create sampled small
+    allocations.  xallocx() is in general incapable of moving small allocations,
+    so this fix removes buggy code without loss of generality.
+  - Fix irallocx_prof_sample() to always allocate large regions, even when
+    alignment is non-zero.
+  - Fix prof_alloc_rollback() to read tdata from thread-specific data rather
+    than dereferencing a potentially invalid tctx.
+
+* 4.0.1 (September 15, 2015)
+
+  This is a bugfix release that is somewhat high risk due to the amount of
+  refactoring required to address deep xallocx() problems.  As a side effect of
+  these fixes, xallocx() now tries harder to partially fulfill requests for
+  optional extra space.  Note that a couple of minor heap profiling
+  optimizations are included, but these are better thought of as performance
+  fixes that were integral to discovering most of the other bugs.
+
+  Optimizations:
+  - Avoid a chunk metadata read in arena_prof_tctx_set(), since it is in the
+    fast path when heap profiling is enabled.  Additionally, split a special
+    case out into arena_prof_tctx_reset(), which also avoids chunk metadata
+    reads.
+  - Optimize irallocx_prof() to optimistically update the sampler state.  The
+    prior implementation appears to have been a holdover from when
+    rallocx()/xallocx() functionality was combined as rallocm().
+
+  Bug fixes:
+  - Fix TLS configuration such that it is enabled by default for platforms on
+    which it works correctly.
+  - Fix arenas_cache_cleanup() and arena_get_hard() to handle
+    allocation/deallocation within the application's thread-specific data
+    cleanup functions even after arenas_cache is torn down.
+  - Fix xallocx() bugs related to size+extra exceeding HUGE_MAXCLASS.
+  - Fix chunk purge hook calls for in-place huge shrinking reallocation to
+    specify the old chunk size rather than the new chunk size.  This bug caused
+    no correctness issues for the default chunk purge function, but was
+    visible to custom functions set via the "arena.<i>.chunk_hooks" mallctl.
+  - Fix heap profiling bugs:
+    + Fix heap profiling to distinguish among otherwise identical sample sites
+      with interposed resets (triggered via the "prof.reset" mallctl).  This bug
+      could cause data structure corruption that would most likely result in a
+      segfault.
+    + Fix irealloc_prof() to prof_alloc_rollback() on OOM.
+    + Make one call to prof_active_get_unlocked() per allocation event, and use
+      the result throughout the relevant functions that handle an allocation
+      event.  Also add a missing check in prof_realloc().  These fixes protect
+      allocation events against concurrent prof_active changes.
+    + Fix ixallocx_prof() to pass usize_max and zero to ixallocx_prof_sample()
+      in the correct order.
+    + Fix prof_realloc() to call prof_free_sampled_object() after calling
+      prof_malloc_sample_object().  Prior to this fix, if tctx and old_tctx were
+      the same, the tctx could have been prematurely destroyed.
+  - Fix portability bugs:
+    + Don't bitshift by negative amounts when encoding/decoding run sizes in
+      chunk header maps.  This affected systems with page sizes greater than 8
+      KiB.
+    + Rename index_t to szind_t to avoid an existing type on Solaris.
+    + Add JEMALLOC_CXX_THROW to the memalign() function prototype, in order to
+      match glibc and avoid compilation errors when including both
+      jemalloc/jemalloc.h and malloc.h in C++ code.
+    + Don't assume that /bin/sh is appropriate when running size_classes.sh
+      during configuration.
+    + Consider __sparcv9 a synonym for __sparc64__ when defining LG_QUANTUM.
+    + Link tests to librt if it contains clock_gettime(2).
+
+* 4.0.0 (August 17, 2015)
+
+  This version contains many speed and space optimizations, both minor and
+  major.  The major themes are generalization, unification, and simplification.
+  Although many of these optimizations cause no visible behavior change, their
+  cumulative effect is substantial.
+
+  New features:
+  - Normalize size class spacing to be consistent across the complete size
+    range.  By default there are four size classes per size doubling, but this
+    is now configurable via the --with-lg-size-class-group option.  Also add the
+    --with-lg-page, --with-lg-page-sizes, --with-lg-quantum, and
+    --with-lg-tiny-min options, which can be used to tweak page and size class
+    settings.  Impacts:
+    + Worst case performance for incrementally growing/shrinking reallocation
+      is improved because there are far fewer size classes, and therefore
+      copying happens less often.
+    + Internal fragmentation is limited to 20% for all but the smallest size
+      classes (those less than four times the quantum).  (1B + 4 KiB)
+      and (1B + 4 MiB) previously suffered nearly 50% internal fragmentation.
+    + Chunk fragmentation tends to be lower because there are fewer distinct run
+      sizes to pack.
+  - Add support for explicit tcaches.  The "tcache.create", "tcache.flush", and
+    "tcache.destroy" mallctls control tcache lifetime and flushing, and the
+    MALLOCX_TCACHE(tc) and MALLOCX_TCACHE_NONE flags to the *allocx() API
+    control which tcache is used for each operation.
+  - Implement per thread heap profiling, as well as the ability to
+    enable/disable heap profiling on a per thread basis.  Add the "prof.reset",
+    "prof.lg_sample", "thread.prof.name", "thread.prof.active",
+    "opt.prof_thread_active_init", "prof.thread_active_init", and
+    "thread.prof.active" mallctls.
+  - Add support for per arena application-specified chunk allocators, configured
+    via the "arena.<i>.chunk_hooks" mallctl.
+  - Refactor huge allocation to be managed by arenas, so that arenas now
+    function as general purpose independent allocators.  This is important in
+    the context of user-specified chunk allocators, aside from the scalability
+    benefits.  Related new statistics:
+    + The "stats.arenas.<i>.huge.allocated", "stats.arenas.<i>.huge.nmalloc",
+      "stats.arenas.<i>.huge.ndalloc", and "stats.arenas.<i>.huge.nrequests"
+      mallctls provide high level per arena huge allocation statistics.
+    + The "arenas.nhchunks", "arenas.hchunk.<i>.size",
+      "stats.arenas.<i>.hchunks.<j>.nmalloc",
+      "stats.arenas.<i>.hchunks.<j>.ndalloc",
+      "stats.arenas.<i>.hchunks.<j>.nrequests", and
+      "stats.arenas.<i>.hchunks.<j>.curhchunks" mallctls provide per size class
+      statistics.
+  - Add the 'util' column to malloc_stats_print() output, which reports the
+    proportion of available regions that are currently in use for each small
+    size class.
+  - Add "alloc" and "free" modes for for junk filling (see the "opt.junk"
+    mallctl), so that it is possible to separately enable junk filling for
+    allocation versus deallocation.
+  - Add the jemalloc-config script, which provides information about how
+    jemalloc was configured, and how to integrate it into application builds.
+  - Add metadata statistics, which are accessible via the "stats.metadata",
+    "stats.arenas.<i>.metadata.mapped", and
+    "stats.arenas.<i>.metadata.allocated" mallctls.
+  - Add the "stats.resident" mallctl, which reports the upper limit of
+    physically resident memory mapped by the allocator.
+  - Add per arena control over unused dirty page purging, via the
+    "arenas.lg_dirty_mult", "arena.<i>.lg_dirty_mult", and
+    "stats.arenas.<i>.lg_dirty_mult" mallctls.
+  - Add the "prof.gdump" mallctl, which makes it possible to toggle the gdump
+    feature on/off during program execution.
+  - Add sdallocx(), which implements sized deallocation.  The primary
+    optimization over dallocx() is the removal of a metadata read, which often
+    suffers an L1 cache miss.
+  - Add missing header includes in jemalloc/jemalloc.h, so that applications
+    only have to #include <jemalloc/jemalloc.h>.
+  - Add support for additional platforms:
+    + Bitrig
+    + Cygwin
+    + DragonFlyBSD
+    + iOS
+    + OpenBSD
+    + OpenRISC/or1k
+
+  Optimizations:
+  - Maintain dirty runs in per arena LRUs rather than in per arena trees of
+    dirty-run-containing chunks.  In practice this change significantly reduces
+    dirty page purging volume.
+  - Integrate whole chunks into the unused dirty page purging machinery.  This
+    reduces the cost of repeated huge allocation/deallocation, because it
+    effectively introduces a cache of chunks.
+  - Split the arena chunk map into two separate arrays, in order to increase
+    cache locality for the frequently accessed bits.
+  - Move small run metadata out of runs, into arena chunk headers.  This reduces
+    run fragmentation, smaller runs reduce external fragmentation for small size
+    classes, and packed (less uniformly aligned) metadata layout improves CPU
+    cache set distribution.
+  - Randomly distribute large allocation base pointer alignment relative to page
+    boundaries in order to more uniformly utilize CPU cache sets.  This can be
+    disabled via the --disable-cache-oblivious configure option, and queried via
+    the "config.cache_oblivious" mallctl.
+  - Micro-optimize the fast paths for the public API functions.
+  - Refactor thread-specific data to reside in a single structure.  This assures
+    that only a single TLS read is necessary per call into the public API.
+  - Implement in-place huge allocation growing and shrinking.
+  - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
+    additional optimizations that reduce maximum lookup depth to one or two
+    levels.  This resolves what was a concurrency bottleneck for per arena huge
+    allocation, because a global data structure is critical for determining
+    which arenas own which huge allocations.
+
+  Incompatible changes:
+  - Replace --enable-cc-silence with --disable-cc-silence to suppress spurious
+    warnings by default.
+  - Assure that the constness of malloc_usable_size()'s return type matches that
+    of the system implementation.
+  - Change the heap profile dump format to support per thread heap profiling,
+    rename pprof to jeprof, and enhance it with the --thread=<n> option.  As a
+    result, the bundled jeprof must now be used rather than the upstream
+    (gperftools) pprof.
+  - Disable "opt.prof_final" by default, in order to avoid atexit(3), which can
+    internally deadlock on some platforms.
+  - Change the "arenas.nlruns" mallctl type from size_t to unsigned.
+  - Replace the "stats.arenas.<i>.bins.<j>.allocated" mallctl with
+    "stats.arenas.<i>.bins.<j>.curregs".
+  - Ignore MALLOC_CONF in set{uid,gid,cap} binaries.
+  - Ignore MALLOCX_ARENA(a) in dallocx(), in favor of using the
+    MALLOCX_TCACHE(tc) and MALLOCX_TCACHE_NONE flags to control tcache usage.
+
+  Removed features:
+  - Remove the *allocm() API, which is superseded by the *allocx() API.
+  - Remove the --enable-dss options, and make dss non-optional on all platforms
+    which support sbrk(2).
+  - Remove the "arenas.purge" mallctl, which was obsoleted by the
+    "arena.<i>.purge" mallctl in 3.1.0.
+  - Remove the unnecessary "opt.valgrind" mallctl; jemalloc automatically
+    detects whether it is running inside Valgrind.
+  - Remove the "stats.huge.allocated", "stats.huge.nmalloc", and
+    "stats.huge.ndalloc" mallctls.
+  - Remove the --enable-mremap option.
+  - Remove the "stats.chunks.current", "stats.chunks.total", and
+    "stats.chunks.high" mallctls.
+
+  Bug fixes:
+  - Fix the cactive statistic to decrease (rather than increase) when active
+    memory decreases.  This regression was first released in 3.5.0.
+  - Fix OOM handling in memalign() and valloc().  A variant of this bug existed
+    in all releases since 2.0.0, which introduced these functions.
+  - Fix an OOM-related regression in arena_tcache_fill_small(), which could
+    cause cache corruption on OOM.  This regression was present in all releases
+    from 2.2.0 through 3.6.0.
+  - Fix size class overflow handling for malloc(), posix_memalign(), memalign(),
+    calloc(), and realloc() when profiling is enabled.
+  - Fix the "arena.<i>.dss" mallctl to return an error if "primary" or
+    "secondary" precedence is specified, but sbrk(2) is not supported.
+  - Fix fallback lg_floor() implementations to handle extremely large inputs.
+  - Ensure the default purgeable zone is after the default zone on OS X.
+  - Fix latent bugs in atomic_*().
+  - Fix the "arena.<i>.dss" mallctl to handle read-only calls.
+  - Fix tls_model configuration to enable the initial-exec model when possible.
+  - Mark malloc_conf as a weak symbol so that the application can override it.
+  - Correctly detect glibc's adaptive pthread mutexes.
+  - Fix the --without-export configure option.
+
+* 3.6.0 (March 31, 2014)
+
+  This version contains a critical bug fix for a regression present in 3.5.0 and
+  3.5.1.
+
+  Bug fixes:
+  - Fix a regression in arena_chunk_alloc() that caused crashes during
+    small/large allocation if chunk allocation failed.  In the absence of this
+    bug, chunk allocation failure would result in allocation failure, e.g.  NULL
+    return from malloc().  This regression was introduced in 3.5.0.
+  - Fix backtracing for gcc intrinsics-based backtracing by specifying
+    -fno-omit-frame-pointer to gcc.  Note that the application (and all the
+    libraries it links to) must also be compiled with this option for
+    backtracing to be reliable.
+  - Use dss allocation precedence for huge allocations as well as small/large
+    allocations.
+  - Fix test assertion failure message formatting.  This bug did not manifest on
+    x86_64 systems because of implementation subtleties in va_list.
+  - Fix inconsequential test failures for hash and SFMT code.
+
+  New features:
+  - Support heap profiling on FreeBSD.  This feature depends on the proc
+    filesystem being mounted during heap profile dumping.
+
+* 3.5.1 (February 25, 2014)
+
+  This version primarily addresses minor bugs in test code.
+
+  Bug fixes:
+  - Configure Solaris/Illumos to use MADV_FREE.
+  - Fix junk filling for mremap(2)-based huge reallocation.  This is only
+    relevant if configuring with the --enable-mremap option specified.
+  - Avoid compilation failure if 'restrict' C99 keyword is not supported by the
+    compiler.
+  - Add a configure test for SSE2 rather than assuming it is usable on i686
+    systems.  This fixes test compilation errors, especially on 32-bit Linux
+    systems.
+  - Fix mallctl argument size mismatches (size_t vs. uint64_t) in the stats unit
+    test.
+  - Fix/remove flawed alignment-related overflow tests.
+  - Prevent compiler optimizations that could change backtraces in the
+    prof_accum unit test.
+
+* 3.5.0 (January 22, 2014)
+
+  This version focuses on refactoring and automated testing, though it also
+  includes some non-trivial heap profiling optimizations not mentioned below.
+
+  New features:
+  - Add the *allocx() API, which is a successor to the experimental *allocm()
+    API.  The *allocx() functions are slightly simpler to use because they have
+    fewer parameters, they directly return the results of primary interest, and
+    mallocx()/rallocx() avoid the strict aliasing pitfall that
+    allocm()/rallocm() share with posix_memalign().  Note that *allocm() is
+    slated for removal in the next non-bugfix release.
+  - Add support for LinuxThreads.
+
+  Bug fixes:
+  - Unless heap profiling is enabled, disable floating point code and don't link
+    with libm.  This, in combination with e.g. EXTRA_CFLAGS=-mno-sse on x64
+    systems, makes it possible to completely disable floating point register
+    use.  Some versions of glibc neglect to save/restore caller-saved floating
+    point registers during dynamic lazy symbol loading, and the symbol loading
+    code uses whatever malloc the application happens to have linked/loaded
+    with, the result being potential floating point register corruption.
+  - Report ENOMEM rather than EINVAL if an OOM occurs during heap profiling
+    backtrace creation in imemalign().  This bug impacted posix_memalign() and
+    aligned_alloc().
+  - Fix a file descriptor leak in a prof_dump_maps() error path.
+  - Fix prof_dump() to close the dump file descriptor for all relevant error
+    paths.
+  - Fix rallocm() to use the arena specified by the ALLOCM_ARENA(s) flag for
+    allocation, not just deallocation.
+  - Fix a data race for large allocation stats counters.
+  - Fix a potential infinite loop during thread exit.  This bug occurred on
+    Solaris, and could affect other platforms with similar pthreads TSD
+    implementations.
+  - Don't junk-fill reallocations unless usable size changes.  This fixes a
+    violation of the *allocx()/*allocm() semantics.
+  - Fix growing large reallocation to junk fill new space.
+  - Fix huge deallocation to junk fill when munmap is disabled.
+  - Change the default private namespace prefix from empty to je_, and change
+    --with-private-namespace-prefix so that it prepends an additional prefix
+    rather than replacing je_.  This reduces the likelihood of applications
+    which statically link jemalloc experiencing symbol name collisions.
+  - Add missing private namespace mangling (relevant when
+    --with-private-namespace is specified).
+  - Add and use JEMALLOC_INLINE_C so that static inline functions are marked as
+    static even for debug builds.
+  - Add a missing mutex unlock in a malloc_init_hard() error path.  In practice
+    this error path is never executed.
+  - Fix numerous bugs in malloc_strotumax() error handling/reporting.  These
+    bugs had no impact except for malformed inputs.
+  - Fix numerous bugs in malloc_snprintf().  These bugs were not exercised by
+    existing calls, so they had no impact.
+
+* 3.4.1 (October 20, 2013)
+
+  Bug fixes:
+  - Fix a race in the "arenas.extend" mallctl that could cause memory corruption
+    of internal data structures and subsequent crashes.
+  - Fix Valgrind integration flaws that caused Valgrind warnings about reads of
+    uninitialized memory in:
+    + arena chunk headers
+    + internal zero-initialized data structures (relevant to tcache and prof
+      code)
+  - Preserve errno during the first allocation.  A readlink(2) call during
+    initialization fails unless /etc/malloc.conf exists, so errno was typically
+    set during the first allocation prior to this fix.
+  - Fix compilation warnings reported by gcc 4.8.1.
+
+* 3.4.0 (June 2, 2013)
+
+  This version is essentially a small bugfix release, but the addition of
+  aarch64 support requires that the minor version be incremented.
+
+  Bug fixes:
+  - Fix race-triggered deadlocks in chunk_record().  These deadlocks were
+    typically triggered by multiple threads concurrently deallocating huge
+    objects.
+
+  New features:
+  - Add support for the aarch64 architecture.
+
+* 3.3.1 (March 6, 2013)
+
+  This version fixes bugs that are typically encountered only when utilizing
+  custom run-time options.
+
+  Bug fixes:
+  - Fix a locking order bug that could cause deadlock during fork if heap
+    profiling were enabled.
+  - Fix a chunk recycling bug that could cause the allocator to lose track of
+    whether a chunk was zeroed.  On FreeBSD, NetBSD, and OS X, it could cause
+    corruption if allocating via sbrk(2) (unlikely unless running with the
+    "dss:primary" option specified).  This was completely harmless on Linux
+    unless using mlockall(2) (and unlikely even then, unless the
+    --disable-munmap configure option or the "dss:primary" option was
+    specified).  This regression was introduced in 3.1.0 by the
+    mlockall(2)/madvise(2) interaction fix.
+  - Fix TLS-related memory corruption that could occur during thread exit if the
+    thread never allocated memory.  Only the quarantine and prof facilities were
+    susceptible.
+  - Fix two quarantine bugs:
+    + Internal reallocation of the quarantined object array leaked the old
+      array.
+    + Reallocation failure for internal reallocation of the quarantined object
+      array (very unlikely) resulted in memory corruption.
+  - Fix Valgrind integration to annotate all internally allocated memory in a
+    way that keeps Valgrind happy about internal data structure access.
+  - Fix building for s390 systems.
+
+* 3.3.0 (January 23, 2013)
+
+  This version includes a few minor performance improvements in addition to the
+  listed new features and bug fixes.
+
+  New features:
+  - Add clipping support to lg_chunk option processing.
+  - Add the --enable-ivsalloc option.
+  - Add the --without-export option.
+  - Add the --disable-zone-allocator option.
+
+  Bug fixes:
+  - Fix "arenas.extend" mallctl to output the number of arenas.
+  - Fix chunk_recycle() to unconditionally inform Valgrind that returned memory
+    is undefined.
+  - Fix build break on FreeBSD related to alloca.h.
+
+* 3.2.0 (November 9, 2012)
+
+  In addition to a couple of bug fixes, this version modifies page run
+  allocation and dirty page purging algorithms in order to better control
+  page-level virtual memory fragmentation.
+
+  Incompatible changes:
+  - Change the "opt.lg_dirty_mult" default from 5 to 3 (32:1 to 8:1).
+
+  Bug fixes:
+  - Fix dss/mmap allocation precedence code to use recyclable mmap memory only
+    after primary dss allocation fails.
+  - Fix deadlock in the "arenas.purge" mallctl.  This regression was introduced
+    in 3.1.0 by the addition of the "arena.<i>.purge" mallctl.
+
+* 3.1.0 (October 16, 2012)
+
+  New features:
+  - Auto-detect whether running inside Valgrind, thus removing the need to
+    manually specify MALLOC_CONF=valgrind:true.
+  - Add the "arenas.extend" mallctl, which allows applications to create
+    manually managed arenas.
+  - Add the ALLOCM_ARENA() flag for {,r,d}allocm().
+  - Add the "opt.dss", "arena.<i>.dss", and "stats.arenas.<i>.dss" mallctls,
+    which provide control over dss/mmap precedence.
+  - Add the "arena.<i>.purge" mallctl, which obsoletes "arenas.purge".
+  - Define LG_QUANTUM for hppa.
+
+  Incompatible changes:
+  - Disable tcache by default if running inside Valgrind, in order to avoid
+    making unallocated objects appear reachable to Valgrind.
+  - Drop const from malloc_usable_size() argument on Linux.
+
+  Bug fixes:
+  - Fix heap profiling crash if sampled object is freed via realloc(p, 0).
+  - Remove const from __*_hook variable declarations, so that glibc can modify
+    them during process forking.
+  - Fix mlockall(2)/madvise(2) interaction.
+  - Fix fork(2)-related deadlocks.
+  - Fix error return value for "thread.tcache.enabled" mallctl.
+
+* 3.0.0 (May 11, 2012)
+
+  Although this version adds some major new features, the primary focus is on
+  internal code cleanup that facilitates maintainability and portability, most
+  of which is not reflected in the ChangeLog.  This is the first release to
+  incorporate substantial contributions from numerous other developers, and the
+  result is a more broadly useful allocator (see the git revision history for
+  contribution details).  Note that the license has been unified, thanks to
+  Facebook granting a license under the same terms as the other copyright
+  holders (see COPYING).
+
+  New features:
+  - Implement Valgrind support, redzones, and quarantine.
+  - Add support for additional platforms:
+    + FreeBSD
+    + Mac OS X Lion
+    + MinGW
+    + Windows (no support yet for replacing the system malloc)
+  - Add support for additional architectures:
+    + MIPS
+    + SH4
+    + Tilera
+  - Add support for cross compiling.
+  - Add nallocm(), which rounds a request size up to the nearest size class
+    without actually allocating.
+  - Implement aligned_alloc() (blame C11).
+  - Add the "thread.tcache.enabled" mallctl.
+  - Add the "opt.prof_final" mallctl.
+  - Update pprof (from gperftools 2.0).
+  - Add the --with-mangling option.
+  - Add the --disable-experimental option.
+  - Add the --disable-munmap option, and make it the default on Linux.
+  - Add the --enable-mremap option, which disables use of mremap(2) by default.
+
+  Incompatible changes:
+  - Enable stats by default.
+  - Enable fill by default.
+  - Disable lazy locking by default.
+  - Rename the "tcache.flush" mallctl to "thread.tcache.flush".
+  - Rename the "arenas.pagesize" mallctl to "arenas.page".
+  - Change the "opt.lg_prof_sample" default from 0 to 19 (1 B to 512 KiB).
+  - Change the "opt.prof_accum" default from true to false.
+
+  Removed features:
+  - Remove the swap feature, including the "config.swap", "swap.avail",
+    "swap.prezeroed", "swap.nfds", and "swap.fds" mallctls.
+  - Remove highruns statistics, including the
+    "stats.arenas.<i>.bins.<j>.highruns" and
+    "stats.arenas.<i>.lruns.<j>.highruns" mallctls.
+  - As part of small size class refactoring, remove the "opt.lg_[qc]space_max",
+    "arenas.cacheline", "arenas.subpage", "arenas.[tqcs]space_{min,max}", and
+    "arenas.[tqcs]bins" mallctls.
+  - Remove the "arenas.chunksize" mallctl.
+  - Remove the "opt.lg_prof_tcmax" option.
+  - Remove the "opt.lg_prof_bt_max" option.
+  - Remove the "opt.lg_tcache_gc_sweep" option.
+  - Remove the --disable-tiny option, including the "config.tiny" mallctl.
+  - Remove the --enable-dynamic-page-shift configure option.
+  - Remove the --enable-sysv configure option.
+
+  Bug fixes:
+  - Fix a statistics-related bug in the "thread.arena" mallctl that could cause
+    invalid statistics and crashes.
+  - Work around TLS deallocation via free() on Linux.  This bug could cause
+    write-after-free memory corruption.
+  - Fix a potential deadlock that could occur during interval- and
+    growth-triggered heap profile dumps.
+  - Fix large calloc() zeroing bugs due to dropping chunk map unzeroed flags.
+  - Fix chunk_alloc_dss() to stop claiming memory is zeroed.  This bug could
+    cause memory corruption and crashes with --enable-dss specified.
+  - Fix fork-related bugs that could cause deadlock in children between fork
+    and exec.
+  - Fix malloc_stats_print() to honor 'b' and 'l' in the opts parameter.
+  - Fix realloc(p, 0) to act like free(p).
+  - Do not enforce minimum alignment in memalign().
+  - Check for NULL pointer in malloc_usable_size().
+  - Fix an off-by-one heap profile statistics bug that could be observed in
+    interval- and growth-triggered heap profiles.
+  - Fix the "epoch" mallctl to update cached stats even if the passed in epoch
+    is 0.
+  - Fix bin->runcur management to fix a layout policy bug.  This bug did not
+    affect correctness.
+  - Fix a bug in choose_arena_hard() that potentially caused more arenas to be
+    initialized than necessary.
+  - Add missing "opt.lg_tcache_max" mallctl implementation.
+  - Use glibc allocator hooks to make mixed allocator usage less likely.
+  - Fix build issues for --disable-tcache.
+  - Don't mangle pthread_create() when --with-private-namespace is specified.
+
+* 2.2.5 (November 14, 2011)
+
+  Bug fixes:
+  - Fix huge_ralloc() race when using mremap(2).  This is a serious bug that
+    could cause memory corruption and/or crashes.
+  - Fix huge_ralloc() to maintain chunk statistics.
+  - Fix malloc_stats_print(..., "a") output.
+
+* 2.2.4 (November 5, 2011)
+
+  Bug fixes:
+  - Initialize arenas_tsd before using it.  This bug existed for 2.2.[0-3], as
+    well as for --disable-tls builds in earlier releases.
+  - Do not assume a 4 KiB page size in test/rallocm.c.
+
+* 2.2.3 (August 31, 2011)
+
+  This version fixes numerous bugs related to heap profiling.
+
+  Bug fixes:
+  - Fix a prof-related race condition.  This bug could cause memory corruption,
+    but only occurred in non-default configurations (prof_accum:false).
+  - Fix off-by-one backtracing issues (make sure that prof_alloc_prep() is
+    excluded from backtraces).
+  - Fix a prof-related bug in realloc() (only triggered by OOM errors).
+  - Fix prof-related bugs in allocm() and rallocm().
+  - Fix prof_tdata_cleanup() for --disable-tls builds.
+  - Fix a relative include path, to fix objdir builds.
+
+* 2.2.2 (July 30, 2011)
+
+  Bug fixes:
+  - Fix a build error for --disable-tcache.
+  - Fix assertions in arena_purge() (for real this time).
+  - Add the --with-private-namespace option.  This is a workaround for symbol
+    conflicts that can inadvertently arise when using static libraries.
+
+* 2.2.1 (March 30, 2011)
+
+  Bug fixes:
+  - Implement atomic operations for x86/x64.  This fixes compilation failures
+    for versions of gcc that are still in wide use.
+  - Fix an assertion in arena_purge().
+
+* 2.2.0 (March 22, 2011)
+
+  This version incorporates several improvements to algorithms and data
+  structures that tend to reduce fragmentation and increase speed.
+
+  New features:
+  - Add the "stats.cactive" mallctl.
+  - Update pprof (from google-perftools 1.7).
+  - Improve backtracing-related configuration logic, and add the
+    --disable-prof-libgcc option.
+
+  Bug fixes:
+  - Change default symbol visibility from "internal", to "hidden", which
+    decreases the overhead of library-internal function calls.
+  - Fix symbol visibility so that it is also set on OS X.
+  - Fix a build dependency regression caused by the introduction of the .pic.o
+    suffix for PIC object files.
+  - Add missing checks for mutex initialization failures.
+  - Don't use libgcc-based backtracing except on x64, where it is known to work.
+  - Fix deadlocks on OS X that were due to memory allocation in
+    pthread_mutex_lock().
+  - Heap profiling-specific fixes:
+    + Fix memory corruption due to integer overflow in small region index
+      computation, when using a small enough sample interval that profiling
+      context pointers are stored in small run headers.
+    + Fix a bootstrap ordering bug that only occurred with TLS disabled.
+    + Fix a rallocm() rsize bug.
+    + Fix error detection bugs for aligned memory allocation.
+
+* 2.1.3 (March 14, 2011)
+
+  Bug fixes:
+  - Fix a cpp logic regression (due to the "thread.{de,}allocatedp" mallctl fix
+    for OS X in 2.1.2).
+  - Fix a "thread.arena" mallctl bug.
+  - Fix a thread cache stats merging bug.
+
+* 2.1.2 (March 2, 2011)
+
+  Bug fixes:
+  - Fix "thread.{de,}allocatedp" mallctl for OS X.
+  - Add missing jemalloc.a to build system.
+
+* 2.1.1 (January 31, 2011)
+
+  Bug fixes:
+  - Fix aligned huge reallocation (affected allocm()).
+  - Fix the ALLOCM_LG_ALIGN macro definition.
+  - Fix a heap dumping deadlock.
+  - Fix a "thread.arena" mallctl bug.
+
+* 2.1.0 (December 3, 2010)
+
+  This version incorporates some optimizations that can't quite be considered
+  bug fixes.
+
+  New features:
+  - Use Linux's mremap(2) for huge object reallocation when possible.
+  - Avoid locking in mallctl*() when possible.
+  - Add the "thread.[de]allocatedp" mallctl's.
+  - Convert the manual page source from roff to DocBook, and generate both roff
+    and HTML manuals.
+
+  Bug fixes:
+  - Fix a crash due to incorrect bootstrap ordering.  This only impacted
+    --enable-debug --enable-dss configurations.
+  - Fix a minor statistics bug for mallctl("swap.avail", ...).
+
+* 2.0.1 (October 29, 2010)
+
+  Bug fixes:
+  - Fix a race condition in heap profiling that could cause undefined behavior
+    if "opt.prof_accum" were disabled.
+  - Add missing mutex unlocks for some OOM error paths in the heap profiling
+    code.
+  - Fix a compilation error for non-C99 builds.
+
+* 2.0.0 (October 24, 2010)
+
+  This version focuses on the experimental *allocm() API, and on improved
+  run-time configuration/introspection.  Nonetheless, numerous performance
+  improvements are also included.
+
+  New features:
+  - Implement the experimental {,r,s,d}allocm() API, which provides a superset
+    of the functionality available via malloc(), calloc(), posix_memalign(),
+    realloc(), malloc_usable_size(), and free().  These functions can be used to
+    allocate/reallocate aligned zeroed memory, ask for optional extra memory
+    during reallocation, prevent object movement during reallocation, etc.
+  - Replace JEMALLOC_OPTIONS/JEMALLOC_PROF_PREFIX with MALLOC_CONF, which is
+    more human-readable, and more flexible.  For example:
+      JEMALLOC_OPTIONS=AJP
+    is now:
+      MALLOC_CONF=abort:true,fill:true,stats_print:true
+  - Port to Apple OS X.  Sponsored by Mozilla.
+  - Make it possible for the application to control thread-->arena mappings via
+    the "thread.arena" mallctl.
+  - Add compile-time support for all TLS-related functionality via pthreads TSD.
+    This is mainly of interest for OS X, which does not support TLS, but has a
+    TSD implementation with similar performance.
+  - Override memalign() and valloc() if they are provided by the system.
+  - Add the "arenas.purge" mallctl, which can be used to synchronously purge all
+    dirty unused pages.
+  - Make cumulative heap profiling data optional, so that it is possible to
+    limit the amount of memory consumed by heap profiling data structures.
+  - Add per thread allocation counters that can be accessed via the
+    "thread.allocated" and "thread.deallocated" mallctls.
+
+  Incompatible changes:
+  - Remove JEMALLOC_OPTIONS and malloc_options (see MALLOC_CONF above).
+  - Increase default backtrace depth from 4 to 128 for heap profiling.
+  - Disable interval-based profile dumps by default.
+
+  Bug fixes:
+  - Remove bad assertions in fork handler functions.  These assertions could
+    cause aborts for some combinations of configure settings.
+  - Fix strerror_r() usage to deal with non-standard semantics in GNU libc.
+  - Fix leak context reporting.  This bug tended to cause the number of contexts
+    to be underreported (though the reported number of objects and bytes were
+    correct).
+  - Fix a realloc() bug for large in-place growing reallocation.  This bug could
+    cause memory corruption, but it was hard to trigger.
+  - Fix an allocation bug for small allocations that could be triggered if
+    multiple threads raced to create a new run of backing pages.
+  - Enhance the heap profiler to trigger samples based on usable size, rather
+    than request size.
+  - Fix a heap profiling bug due to sometimes losing track of requested object
+    size for sampled objects.
+
+* 1.0.3 (August 12, 2010)
+
+  Bug fixes:
+  - Fix the libunwind-based implementation of stack backtracing (used for heap
+    profiling).  This bug could cause zero-length backtraces to be reported.
+  - Add a missing mutex unlock in library initialization code.  If multiple
+    threads raced to initialize malloc, some of them could end up permanently
+    blocked.
+
+* 1.0.2 (May 11, 2010)
+
+  Bug fixes:
+  - Fix junk filling of large objects, which could cause memory corruption.
+  - Add MAP_NORESERVE support for chunk mapping, because otherwise virtual
+    memory limits could cause swap file configuration to fail.  Contributed by
+    Jordan DeLong.
+
+* 1.0.1 (April 14, 2010)
+
+  Bug fixes:
+  - Fix compilation when --enable-fill is specified.
+  - Fix threads-related profiling bugs that affected accuracy and caused memory
+    to be leaked during thread exit.
+  - Fix dirty page purging race conditions that could cause crashes.
+  - Fix crash in tcache flushing code during thread destruction.
+
+* 1.0.0 (April 11, 2010)
+
+  This release focuses on speed and run-time introspection.  Numerous
+  algorithmic improvements make this release substantially faster than its
+  predecessors.
+
+  New features:
+  - Implement autoconf-based configuration system.
+  - Add mallctl*(), for the purposes of introspection and run-time
+    configuration.
+  - Make it possible for the application to manually flush a thread's cache, via
+    the "tcache.flush" mallctl.
+  - Base maximum dirty page count on proportion of active memory.
+  - Compute various additional run-time statistics, including per size class
+    statistics for large objects.
+  - Expose malloc_stats_print(), which can be called repeatedly by the
+    application.
+  - Simplify the malloc_message() signature to only take one string argument,
+    and incorporate an opaque data pointer argument for use by the application
+    in combination with malloc_stats_print().
+  - Add support for allocation backed by one or more swap files, and allow the
+    application to disable over-commit if swap files are in use.
+  - Implement allocation profiling and leak checking.
+
+  Removed features:
+  - Remove the dynamic arena rebalancing code, since thread-specific caching
+    reduces its utility.
+
+  Bug fixes:
+  - Modify chunk allocation to work when address space layout randomization
+    (ASLR) is in use.
+  - Fix thread cleanup bugs related to TLS destruction.
+  - Handle 0-size allocation requests in posix_memalign().
+  - Fix a chunk leak.  The leaked chunks were never touched, so this impacted
+    virtual memory usage, but not physical memory usage.
+
+* linux_2008082[78]a (August 27/28, 2008)
+
+  These snapshot releases are the simple result of incorporating Linux-specific
+  support into the FreeBSD malloc sources.
+
+--------------------------------------------------------------------------------
+vim:filetype=text:textwidth=80
diff --git a/redis-stable/deps/jemalloc/INSTALL.md b/redis-stable/deps/jemalloc/INSTALL.md
new file mode 100644
index 00000000..ef328c60
--- /dev/null
+++ b/redis-stable/deps/jemalloc/INSTALL.md
@@ -0,0 +1,423 @@
+Building and installing a packaged release of jemalloc can be as simple as
+typing the following while in the root directory of the source tree:
+
+    ./configure
+    make
+    make install
+
+If building from unpackaged developer sources, the simplest command sequence
+that might work is:
+
+    ./autogen.sh
+    make dist
+    make
+    make install
+
+Note that documentation is not built by the default target because doing so
+would create a dependency on xsltproc in packaged releases, hence the
+requirement to either run 'make dist' or avoid installing docs via the various
+install_* targets documented below.
+
+
+## Advanced configuration
+
+The 'configure' script supports numerous options that allow control of which
+functionality is enabled, where jemalloc is installed, etc.  Optionally, pass
+any of the following arguments (not a definitive list) to 'configure':
+
+* `--help`
+
+    Print a definitive list of options.
+
+* `--prefix=<install-root-dir>`
+
+    Set the base directory in which to install.  For example:
+
+        ./configure --prefix=/usr/local
+
+    will cause files to be installed into /usr/local/include, /usr/local/lib,
+    and /usr/local/man.
+
+* `--with-version=(<major>.<minor>.<bugfix>-<nrev>-g<gid>|VERSION)`
+
+    The VERSION file is mandatory for successful configuration, and the
+    following steps are taken to assure its presence:
+    1) If --with-version=<major>.<minor>.<bugfix>-<nrev>-g<gid> is specified,
+       generate VERSION using the specified value.
+    2) If --with-version is not specified in either form and the source
+       directory is inside a git repository, try to generate VERSION via 'git
+       describe' invocations that pattern-match release tags.
+    3) If VERSION is missing, generate it with a bogus version:
+       0.0.0-0-g0000000000000000000000000000000000000000
+
+    Note that --with-version=VERSION bypasses (1) and (2), which simplifies
+    VERSION configuration when embedding a jemalloc release into another
+    project's git repository.
+
+* `--with-rpath=<colon-separated-rpath>`
+
+    Embed one or more library paths, so that libjemalloc can find the libraries
+    it is linked to.  This works only on ELF-based systems.
+
+* `--with-mangling=<map>`
+
+    Mangle public symbols specified in <map> which is a comma-separated list of
+    name:mangled pairs.
+
+    For example, to use ld's --wrap option as an alternative method for
+    overriding libc's malloc implementation, specify something like:
+
+      --with-mangling=malloc:__wrap_malloc,free:__wrap_free[...]
+
+    Note that mangling happens prior to application of the prefix specified by
+    --with-jemalloc-prefix, and mangled symbols are then ignored when applying
+    the prefix.
+
+* `--with-jemalloc-prefix=<prefix>`
+
+    Prefix all public APIs with <prefix>.  For example, if <prefix> is
+    "prefix_", API changes like the following occur:
+
+      malloc()         --> prefix_malloc()
+      malloc_conf      --> prefix_malloc_conf
+      /etc/malloc.conf --> /etc/prefix_malloc.conf
+      MALLOC_CONF      --> PREFIX_MALLOC_CONF
+
+    This makes it possible to use jemalloc at the same time as the system
+    allocator, or even to use multiple copies of jemalloc simultaneously.
+
+    By default, the prefix is "", except on OS X, where it is "je_".  On OS X,
+    jemalloc overlays the default malloc zone, but makes no attempt to actually
+    replace the "malloc", "calloc", etc. symbols.
+
+* `--without-export`
+
+    Don't export public APIs.  This can be useful when building jemalloc as a
+    static library, or to avoid exporting public APIs when using the zone
+    allocator on OSX.
+
+* `--with-private-namespace=<prefix>`
+
+    Prefix all library-private APIs with <prefix>je_.  For shared libraries,
+    symbol visibility mechanisms prevent these symbols from being exported, but
+    for static libraries, naming collisions are a real possibility.  By
+    default, <prefix> is empty, which results in a symbol prefix of je_ .
+
+* `--with-install-suffix=<suffix>`
+
+    Append <suffix> to the base name of all installed files, such that multiple
+    versions of jemalloc can coexist in the same installation directory.  For
+    example, libjemalloc.so.0 becomes libjemalloc<suffix>.so.0.
+
+* `--with-malloc-conf=<malloc_conf>`
+
+    Embed `<malloc_conf>` as a run-time options string that is processed prior to
+    the malloc_conf global variable, the /etc/malloc.conf symlink, and the
+    MALLOC_CONF environment variable.  For example, to change the default decay
+    time to 30 seconds:
+
+      --with-malloc-conf=decay_ms:30000
+
+* `--enable-debug`
+
+    Enable assertions and validation code.  This incurs a substantial
+    performance hit, but is very useful during application development.
+
+* `--disable-stats`
+
+    Disable statistics gathering functionality.  See the "opt.stats_print"
+    option documentation for usage details.
+
+* `--enable-prof`
+
+    Enable heap profiling and leak detection functionality.  See the "opt.prof"
+    option documentation for usage details.  When enabled, there are several
+    approaches to backtracing, and the configure script chooses the first one
+    in the following list that appears to function correctly:
+
+    + libunwind      (requires --enable-prof-libunwind)
+    + libgcc         (unless --disable-prof-libgcc)
+    + gcc intrinsics (unless --disable-prof-gcc)
+
+* `--enable-prof-libunwind`
+
+    Use the libunwind library (http://www.nongnu.org/libunwind/) for stack
+    backtracing.
+
+* `--disable-prof-libgcc`
+
+    Disable the use of libgcc's backtracing functionality.
+
+* `--disable-prof-gcc`
+
+    Disable the use of gcc intrinsics for backtracing.
+
+* `--with-static-libunwind=<libunwind.a>`
+
+    Statically link against the specified libunwind.a rather than dynamically
+    linking with -lunwind.
+
+* `--disable-fill`
+
+    Disable support for junk/zero filling of memory.  See the "opt.junk" and
+    "opt.zero" option documentation for usage details.
+
+* `--disable-zone-allocator`
+
+    Disable zone allocator for Darwin.  This means jemalloc won't be hooked as
+    the default allocator on OSX/iOS.
+
+* `--enable-utrace`
+
+    Enable utrace(2)-based allocation tracing.  This feature is not broadly
+    portable (FreeBSD has it, but Linux and OS X do not).
+
+* `--enable-xmalloc`
+
+    Enable support for optional immediate termination due to out-of-memory
+    errors, as is commonly implemented by "xmalloc" wrapper function for malloc.
+    See the "opt.xmalloc" option documentation for usage details.
+
+* `--enable-lazy-lock`
+
+    Enable code that wraps pthread_create() to detect when an application
+    switches from single-threaded to multi-threaded mode, so that it can avoid
+    mutex locking/unlocking operations while in single-threaded mode.  In
+    practice, this feature usually has little impact on performance unless
+    thread-specific caching is disabled.
+
+* `--disable-cache-oblivious`
+
+    Disable cache-oblivious large allocation alignment for large allocation
+    requests with no alignment constraints.  If this feature is disabled, all
+    large allocations are page-aligned as an implementation artifact, which can
+    severely harm CPU cache utilization.  However, the cache-oblivious layout
+    comes at the cost of one extra page per large allocation, which in the
+    most extreme case increases physical memory usage for the 16 KiB size class
+    to 20 KiB.
+
+* `--disable-syscall`
+
+    Disable use of syscall(2) rather than {open,read,write,close}(2).  This is
+    intended as a workaround for systems that place security limitations on
+    syscall(2).
+
+* `--disable-cxx`
+
+    Disable C++ integration.  This will cause new and delete operator
+    implementations to be omitted.
+
+* `--with-xslroot=<path>`
+
+    Specify where to find DocBook XSL stylesheets when building the
+    documentation.
+
+* `--with-lg-page=<lg-page>`
+
+    Specify the base 2 log of the allocator page size, which must in turn be at
+    least as large as the system page size.  By default the configure script
+    determines the host's page size and sets the allocator page size equal to
+    the system page size, so this option need not be specified unless the
+    system page size may change between configuration and execution, e.g. when
+    cross compiling.
+
+* `--with-lg-page-sizes=<lg-page-sizes>`
+
+    Specify the comma-separated base 2 logs of the page sizes to support.  This
+    option may be useful when cross compiling in combination with
+    `--with-lg-page`, but its primary use case is for integration with FreeBSD's
+    libc, wherein jemalloc is embedded.
+
+* `--with-lg-hugepage=<lg-hugepage>`
+
+    Specify the base 2 log of the system huge page size.  This option is useful
+    when cross compiling, or when overriding the default for systems that do
+    not explicitly support huge pages.
+
+* `--with-lg-quantum=<lg-quantum>`
+
+    Specify the base 2 log of the minimum allocation alignment.  jemalloc needs
+    to know the minimum alignment that meets the following C standard
+    requirement (quoted from the April 12, 2011 draft of the C11 standard):
+
+    >  The pointer returned if the allocation succeeds is suitably aligned so
+      that it may be assigned to a pointer to any type of object with a
+      fundamental alignment requirement and then used to access such an object
+      or an array of such objects in the space allocated [...]
+
+    This setting is architecture-specific, and although jemalloc includes known
+    safe values for the most commonly used modern architectures, there is a
+    wrinkle related to GNU libc (glibc) that may impact your choice of
+    <lg-quantum>.  On most modern architectures, this mandates 16-byte
+    alignment (<lg-quantum>=4), but the glibc developers chose not to meet this
+    requirement for performance reasons.  An old discussion can be found at
+    <https://sourceware.org/bugzilla/show_bug.cgi?id=206> .  Unlike glibc,
+    jemalloc does follow the C standard by default (caveat: jemalloc
+    technically cheats for size classes smaller than the quantum), but the fact
+    that Linux systems already work around this allocator noncompliance means
+    that it is generally safe in practice to let jemalloc's minimum alignment
+    follow glibc's lead.  If you specify `--with-lg-quantum=3` during
+    configuration, jemalloc will provide additional size classes that are not
+    16-byte-aligned (24, 40, and 56).
+
+* `--with-lg-vaddr=<lg-vaddr>`
+
+    Specify the number of significant virtual address bits.  By default, the
+    configure script attempts to detect virtual address size on those platforms
+    where it knows how, and picks a default otherwise.  This option may be
+    useful when cross-compiling.
+
+* `--disable-initial-exec-tls`
+
+    Disable the initial-exec TLS model for jemalloc's internal thread-local
+    storage (on those platforms that support explicit settings).  This can allow
+    jemalloc to be dynamically loaded after program startup (e.g. using dlopen).
+    Note that in this case, there will be two malloc implementations operating
+    in the same process, which will almost certainly result in confusing runtime
+    crashes if pointers leak from one implementation to the other.
+
+The following environment variables (not a definitive list) impact configure's
+behavior:
+
+* `CFLAGS="?"`
+* `CXXFLAGS="?"`
+
+    Pass these flags to the C/C++ compiler.  Any flags set by the configure
+    script are prepended, which means explicitly set flags generally take
+    precedence.  Take care when specifying flags such as -Werror, because
+    configure tests may be affected in undesirable ways.
+
+* `EXTRA_CFLAGS="?"`
+* `EXTRA_CXXFLAGS="?"`
+
+    Append these flags to CFLAGS/CXXFLAGS, without passing them to the
+    compiler(s) during configuration.  This makes it possible to add flags such
+    as -Werror, while allowing the configure script to determine what other
+    flags are appropriate for the specified configuration.
+
+* `CPPFLAGS="?"`
+
+    Pass these flags to the C preprocessor.  Note that CFLAGS is not passed to
+    'cpp' when 'configure' is looking for include files, so you must use
+    CPPFLAGS instead if you need to help 'configure' find header files.
+
+* `LD_LIBRARY_PATH="?"`
+
+    'ld' uses this colon-separated list to find libraries.
+
+* `LDFLAGS="?"`
+
+    Pass these flags when linking.
+
+* `PATH="?"`
+
+    'configure' uses this to find programs.
+
+In some cases it may be necessary to work around configuration results that do
+not match reality.  For example, Linux 4.5 added support for the MADV_FREE flag
+to madvise(2), which can cause problems if building on a host with MADV_FREE
+support and deploying to a target without.  To work around this, use a cache
+file to override the relevant configuration variable defined in configure.ac,
+e.g.:
+
+    echo "je_cv_madv_free=no" > config.cache && ./configure -C
+
+
+## Advanced compilation
+
+To build only parts of jemalloc, use the following targets:
+
+    build_lib_shared
+    build_lib_static
+    build_lib
+    build_doc_html
+    build_doc_man
+    build_doc
+
+To install only parts of jemalloc, use the following targets:
+
+    install_bin
+    install_include
+    install_lib_shared
+    install_lib_static
+    install_lib_pc
+    install_lib
+    install_doc_html
+    install_doc_man
+    install_doc
+
+To clean up build results to varying degrees, use the following make targets:
+
+    clean
+    distclean
+    relclean
+
+
+## Advanced installation
+
+Optionally, define make variables when invoking make, including (not
+exclusively):
+
+* `INCLUDEDIR="?"`
+
+    Use this as the installation prefix for header files.
+
+* `LIBDIR="?"`
+
+    Use this as the installation prefix for libraries.
+
+* `MANDIR="?"`
+
+    Use this as the installation prefix for man pages.
+
+* `DESTDIR="?"`
+
+    Prepend DESTDIR to INCLUDEDIR, LIBDIR, DATADIR, and MANDIR.  This is useful
+    when installing to a different path than was specified via --prefix.
+
+* `CC="?"`
+
+    Use this to invoke the C compiler.
+
+* `CFLAGS="?"`
+
+    Pass these flags to the compiler.
+
+* `CPPFLAGS="?"`
+
+    Pass these flags to the C preprocessor.
+
+* `LDFLAGS="?"`
+
+    Pass these flags when linking.
+
+* `PATH="?"`
+
+    Use this to search for programs used during configuration and building.
+
+
+## Development
+
+If you intend to make non-trivial changes to jemalloc, use the 'autogen.sh'
+script rather than 'configure'.  This re-generates 'configure', enables
+configuration dependency rules, and enables re-generation of automatically
+generated source files.
+
+The build system supports using an object directory separate from the source
+tree.  For example, you can create an 'obj' directory, and from within that
+directory, issue configuration and build commands:
+
+    autoconf
+    mkdir obj
+    cd obj
+    ../configure --enable-autogen
+    make
+
+
+## Documentation
+
+The manual page is generated in both html and roff formats.  Any web browser
+can be used to view the html manual.  The roff manual page can be formatted
+prior to installation via the following command:
+
+    nroff -man -t doc/jemalloc.3
diff --git a/redis-stable/deps/jemalloc/Makefile.in b/redis-stable/deps/jemalloc/Makefile.in
new file mode 100644
index 00000000..9b9347ff
--- /dev/null
+++ b/redis-stable/deps/jemalloc/Makefile.in
@@ -0,0 +1,569 @@
+# Clear out all vpaths, then set just one (default vpath) for the main build
+# directory.
+vpath
+vpath % .
+
+# Clear the default suffixes, so that built-in rules are not used.
+.SUFFIXES :
+
+SHELL := /bin/sh
+
+CC := @CC@
+CXX := @CXX@
+
+# Configuration parameters.
+DESTDIR =
+BINDIR := $(DESTDIR)@BINDIR@
+INCLUDEDIR := $(DESTDIR)@INCLUDEDIR@
+LIBDIR := $(DESTDIR)@LIBDIR@
+DATADIR := $(DESTDIR)@DATADIR@
+MANDIR := $(DESTDIR)@MANDIR@
+srcroot := @srcroot@
+objroot := @objroot@
+abs_srcroot := @abs_srcroot@
+abs_objroot := @abs_objroot@
+
+# Build parameters.
+CPPFLAGS := @CPPFLAGS@ -I$(objroot)include -I$(srcroot)include
+CONFIGURE_CFLAGS := @CONFIGURE_CFLAGS@
+SPECIFIED_CFLAGS := @SPECIFIED_CFLAGS@
+EXTRA_CFLAGS := @EXTRA_CFLAGS@
+CFLAGS := $(strip $(CONFIGURE_CFLAGS) $(SPECIFIED_CFLAGS) $(EXTRA_CFLAGS))
+CONFIGURE_CXXFLAGS := @CONFIGURE_CXXFLAGS@
+SPECIFIED_CXXFLAGS := @SPECIFIED_CXXFLAGS@
+EXTRA_CXXFLAGS := @EXTRA_CXXFLAGS@
+CXXFLAGS := $(strip $(CONFIGURE_CXXFLAGS) $(SPECIFIED_CXXFLAGS) $(EXTRA_CXXFLAGS))
+LDFLAGS := @LDFLAGS@
+EXTRA_LDFLAGS := @EXTRA_LDFLAGS@
+LIBS := @LIBS@
+RPATH_EXTRA := @RPATH_EXTRA@
+SO := @so@
+IMPORTLIB := @importlib@
+O := @o@
+A := @a@
+EXE := @exe@
+LIBPREFIX := @libprefix@
+REV := @rev@
+install_suffix := @install_suffix@
+ABI := @abi@
+XSLTPROC := @XSLTPROC@
+AUTOCONF := @AUTOCONF@
+_RPATH = @RPATH@
+RPATH = $(if $(1),$(call _RPATH,$(1)))
+cfghdrs_in := $(addprefix $(srcroot),@cfghdrs_in@)
+cfghdrs_out := @cfghdrs_out@
+cfgoutputs_in := $(addprefix $(srcroot),@cfgoutputs_in@)
+cfgoutputs_out := @cfgoutputs_out@
+enable_autogen := @enable_autogen@
+enable_prof := @enable_prof@
+enable_zone_allocator := @enable_zone_allocator@
+MALLOC_CONF := @JEMALLOC_CPREFIX@MALLOC_CONF
+link_whole_archive := @link_whole_archive@
+DSO_LDFLAGS = @DSO_LDFLAGS@
+SOREV = @SOREV@
+PIC_CFLAGS = @PIC_CFLAGS@
+CTARGET = @CTARGET@
+LDTARGET = @LDTARGET@
+TEST_LD_MODE = @TEST_LD_MODE@
+MKLIB = @MKLIB@
+AR = @AR@
+ARFLAGS = @ARFLAGS@
+DUMP_SYMS = @DUMP_SYMS@
+AWK := @AWK@
+CC_MM = @CC_MM@
+LM := @LM@
+INSTALL = @INSTALL@
+
+ifeq (macho, $(ABI))
+TEST_LIBRARY_PATH := DYLD_FALLBACK_LIBRARY_PATH="$(objroot)lib"
+else
+ifeq (pecoff, $(ABI))
+TEST_LIBRARY_PATH := PATH="$(PATH):$(objroot)lib"
+else
+TEST_LIBRARY_PATH :=
+endif
+endif
+
+LIBJEMALLOC := $(LIBPREFIX)jemalloc$(install_suffix)
+
+# Lists of files.
+BINS := $(objroot)bin/jemalloc-config $(objroot)bin/jemalloc.sh $(objroot)bin/jeprof
+C_HDRS := $(objroot)include/jemalloc/jemalloc$(install_suffix).h
+C_SRCS := $(srcroot)src/jemalloc.c \
+	$(srcroot)src/arena.c \
+	$(srcroot)src/background_thread.c \
+	$(srcroot)src/base.c \
+	$(srcroot)src/bin.c \
+	$(srcroot)src/bitmap.c \
+	$(srcroot)src/ckh.c \
+	$(srcroot)src/ctl.c \
+	$(srcroot)src/div.c \
+	$(srcroot)src/extent.c \
+	$(srcroot)src/extent_dss.c \
+	$(srcroot)src/extent_mmap.c \
+	$(srcroot)src/hash.c \
+	$(srcroot)src/hooks.c \
+	$(srcroot)src/large.c \
+	$(srcroot)src/log.c \
+	$(srcroot)src/malloc_io.c \
+	$(srcroot)src/mutex.c \
+	$(srcroot)src/mutex_pool.c \
+	$(srcroot)src/nstime.c \
+	$(srcroot)src/pages.c \
+	$(srcroot)src/prng.c \
+	$(srcroot)src/prof.c \
+	$(srcroot)src/rtree.c \
+	$(srcroot)src/stats.c \
+	$(srcroot)src/sz.c \
+	$(srcroot)src/tcache.c \
+	$(srcroot)src/ticker.c \
+	$(srcroot)src/tsd.c \
+	$(srcroot)src/witness.c
+ifeq ($(enable_zone_allocator), 1)
+C_SRCS += $(srcroot)src/zone.c
+endif
+ifeq ($(IMPORTLIB),$(SO))
+STATIC_LIBS := $(objroot)lib/$(LIBJEMALLOC).$(A)
+endif
+ifdef PIC_CFLAGS
+STATIC_LIBS += $(objroot)lib/$(LIBJEMALLOC)_pic.$(A)
+else
+STATIC_LIBS += $(objroot)lib/$(LIBJEMALLOC)_s.$(A)
+endif
+DSOS := $(objroot)lib/$(LIBJEMALLOC).$(SOREV)
+ifneq ($(SOREV),$(SO))
+DSOS += $(objroot)lib/$(LIBJEMALLOC).$(SO)
+endif
+ifeq (1, $(link_whole_archive))
+LJEMALLOC := -Wl,--whole-archive -L$(objroot)lib -l$(LIBJEMALLOC) -Wl,--no-whole-archive
+else
+LJEMALLOC := $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
+endif
+PC := $(objroot)jemalloc.pc
+MAN3 := $(objroot)doc/jemalloc$(install_suffix).3
+DOCS_XML := $(objroot)doc/jemalloc$(install_suffix).xml
+DOCS_HTML := $(DOCS_XML:$(objroot)%.xml=$(objroot)%.html)
+DOCS_MAN3 := $(DOCS_XML:$(objroot)%.xml=$(objroot)%.3)
+DOCS := $(DOCS_HTML) $(DOCS_MAN3)
+C_TESTLIB_SRCS := $(srcroot)test/src/btalloc.c $(srcroot)test/src/btalloc_0.c \
+	$(srcroot)test/src/btalloc_1.c $(srcroot)test/src/math.c \
+	$(srcroot)test/src/mtx.c $(srcroot)test/src/mq.c \
+	$(srcroot)test/src/SFMT.c $(srcroot)test/src/test.c \
+	$(srcroot)test/src/thd.c $(srcroot)test/src/timer.c
+ifeq (1, $(link_whole_archive))
+C_UTIL_INTEGRATION_SRCS :=
+C_UTIL_CPP_SRCS :=
+else
+C_UTIL_INTEGRATION_SRCS := $(srcroot)src/nstime.c $(srcroot)src/malloc_io.c
+C_UTIL_CPP_SRCS := $(srcroot)src/nstime.c $(srcroot)src/malloc_io.c
+endif
+TESTS_UNIT := \
+	$(srcroot)test/unit/a0.c \
+	$(srcroot)test/unit/arena_reset.c \
+	$(srcroot)test/unit/atomic.c \
+	$(srcroot)test/unit/background_thread.c \
+	$(srcroot)test/unit/background_thread_enable.c \
+	$(srcroot)test/unit/base.c \
+	$(srcroot)test/unit/bitmap.c \
+	$(srcroot)test/unit/ckh.c \
+	$(srcroot)test/unit/decay.c \
+	$(srcroot)test/unit/div.c \
+	$(srcroot)test/unit/emitter.c \
+	$(srcroot)test/unit/extent_quantize.c \
+	$(srcroot)test/unit/fork.c \
+	$(srcroot)test/unit/hash.c \
+	$(srcroot)test/unit/hooks.c \
+	$(srcroot)test/unit/junk.c \
+	$(srcroot)test/unit/junk_alloc.c \
+	$(srcroot)test/unit/junk_free.c \
+	$(srcroot)test/unit/log.c \
+	$(srcroot)test/unit/mallctl.c \
+	$(srcroot)test/unit/malloc_io.c \
+	$(srcroot)test/unit/math.c \
+	$(srcroot)test/unit/mq.c \
+	$(srcroot)test/unit/mtx.c \
+	$(srcroot)test/unit/pack.c \
+	$(srcroot)test/unit/pages.c \
+	$(srcroot)test/unit/ph.c \
+	$(srcroot)test/unit/prng.c \
+	$(srcroot)test/unit/prof_accum.c \
+	$(srcroot)test/unit/prof_active.c \
+	$(srcroot)test/unit/prof_gdump.c \
+	$(srcroot)test/unit/prof_idump.c \
+	$(srcroot)test/unit/prof_reset.c \
+	$(srcroot)test/unit/prof_tctx.c \
+	$(srcroot)test/unit/prof_thread_name.c \
+	$(srcroot)test/unit/ql.c \
+	$(srcroot)test/unit/qr.c \
+	$(srcroot)test/unit/rb.c \
+	$(srcroot)test/unit/retained.c \
+	$(srcroot)test/unit/rtree.c \
+	$(srcroot)test/unit/SFMT.c \
+	$(srcroot)test/unit/size_classes.c \
+	$(srcroot)test/unit/slab.c \
+	$(srcroot)test/unit/smoothstep.c \
+	$(srcroot)test/unit/spin.c \
+	$(srcroot)test/unit/stats.c \
+	$(srcroot)test/unit/stats_print.c \
+	$(srcroot)test/unit/ticker.c \
+	$(srcroot)test/unit/nstime.c \
+	$(srcroot)test/unit/tsd.c \
+	$(srcroot)test/unit/witness.c \
+	$(srcroot)test/unit/zero.c
+ifeq (@enable_prof@, 1)
+TESTS_UNIT += \
+	$(srcroot)test/unit/arena_reset_prof.c
+endif
+TESTS_INTEGRATION := $(srcroot)test/integration/aligned_alloc.c \
+	$(srcroot)test/integration/allocated.c \
+	$(srcroot)test/integration/extent.c \
+	$(srcroot)test/integration/mallocx.c \
+	$(srcroot)test/integration/MALLOCX_ARENA.c \
+	$(srcroot)test/integration/overflow.c \
+	$(srcroot)test/integration/posix_memalign.c \
+	$(srcroot)test/integration/rallocx.c \
+	$(srcroot)test/integration/sdallocx.c \
+	$(srcroot)test/integration/thread_arena.c \
+	$(srcroot)test/integration/thread_tcache_enabled.c \
+	$(srcroot)test/integration/xallocx.c
+ifeq (@enable_cxx@, 1)
+CPP_SRCS := $(srcroot)src/jemalloc_cpp.cpp
+TESTS_INTEGRATION_CPP := $(srcroot)test/integration/cpp/basic.cpp
+else
+CPP_SRCS :=
+TESTS_INTEGRATION_CPP :=
+endif
+TESTS_STRESS := $(srcroot)test/stress/microbench.c
+
+TESTS := $(TESTS_UNIT) $(TESTS_INTEGRATION) $(TESTS_INTEGRATION_CPP) $(TESTS_STRESS)
+
+PRIVATE_NAMESPACE_HDRS := $(objroot)include/jemalloc/internal/private_namespace.h $(objroot)include/jemalloc/internal/private_namespace_jet.h
+PRIVATE_NAMESPACE_GEN_HDRS := $(PRIVATE_NAMESPACE_HDRS:%.h=%.gen.h)
+C_SYM_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.sym.$(O))
+C_SYMS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.sym)
+C_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.$(O))
+CPP_OBJS := $(CPP_SRCS:$(srcroot)%.cpp=$(objroot)%.$(O))
+C_PIC_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.pic.$(O))
+CPP_PIC_OBJS := $(CPP_SRCS:$(srcroot)%.cpp=$(objroot)%.pic.$(O))
+C_JET_SYM_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.sym.$(O))
+C_JET_SYMS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.sym)
+C_JET_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.$(O))
+C_TESTLIB_UNIT_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.unit.$(O))
+C_TESTLIB_INTEGRATION_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.integration.$(O))
+C_UTIL_INTEGRATION_OBJS := $(C_UTIL_INTEGRATION_SRCS:$(srcroot)%.c=$(objroot)%.integration.$(O))
+C_TESTLIB_STRESS_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.stress.$(O))
+C_TESTLIB_OBJS := $(C_TESTLIB_UNIT_OBJS) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(C_TESTLIB_STRESS_OBJS)
+
+TESTS_UNIT_OBJS := $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%.$(O))
+TESTS_INTEGRATION_OBJS := $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%.$(O))
+TESTS_INTEGRATION_CPP_OBJS := $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%.$(O))
+TESTS_STRESS_OBJS := $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%.$(O))
+TESTS_OBJS := $(TESTS_UNIT_OBJS) $(TESTS_INTEGRATION_OBJS) $(TESTS_STRESS_OBJS)
+TESTS_CPP_OBJS := $(TESTS_INTEGRATION_CPP_OBJS)
+
+.PHONY: all dist build_doc_html build_doc_man build_doc
+.PHONY: install_bin install_include install_lib
+.PHONY: install_doc_html install_doc_man install_doc install
+.PHONY: tests check clean distclean relclean
+
+.SECONDARY : $(PRIVATE_NAMESPACE_GEN_HDRS) $(TESTS_OBJS) $(TESTS_CPP_OBJS)
+
+# Default target.
+all: build_lib
+
+dist: build_doc
+
+$(objroot)doc/%.html : $(objroot)doc/%.xml $(srcroot)doc/stylesheet.xsl $(objroot)doc/html.xsl
+	$(XSLTPROC) -o $@ $(objroot)doc/html.xsl $<
+
+$(objroot)doc/%.3 : $(objroot)doc/%.xml $(srcroot)doc/stylesheet.xsl $(objroot)doc/manpages.xsl
+	$(XSLTPROC) -o $@ $(objroot)doc/manpages.xsl $<
+
+build_doc_html: $(DOCS_HTML)
+build_doc_man: $(DOCS_MAN3)
+build_doc: $(DOCS)
+
+#
+# Include generated dependency files.
+#
+ifdef CC_MM
+-include $(C_SYM_OBJS:%.$(O)=%.d)
+-include $(C_OBJS:%.$(O)=%.d)
+-include $(CPP_OBJS:%.$(O)=%.d)
+-include $(C_PIC_OBJS:%.$(O)=%.d)
+-include $(CPP_PIC_OBJS:%.$(O)=%.d)
+-include $(C_JET_SYM_OBJS:%.$(O)=%.d)
+-include $(C_JET_OBJS:%.$(O)=%.d)
+-include $(C_TESTLIB_OBJS:%.$(O)=%.d)
+-include $(TESTS_OBJS:%.$(O)=%.d)
+-include $(TESTS_CPP_OBJS:%.$(O)=%.d)
+endif
+
+$(C_SYM_OBJS): $(objroot)src/%.sym.$(O): $(srcroot)src/%.c
+$(C_SYM_OBJS): CPPFLAGS += -DJEMALLOC_NO_PRIVATE_NAMESPACE
+$(C_SYMS): $(objroot)src/%.sym: $(objroot)src/%.sym.$(O)
+$(C_OBJS): $(objroot)src/%.$(O): $(srcroot)src/%.c
+$(CPP_OBJS): $(objroot)src/%.$(O): $(srcroot)src/%.cpp
+$(C_PIC_OBJS): $(objroot)src/%.pic.$(O): $(srcroot)src/%.c
+$(C_PIC_OBJS): CFLAGS += $(PIC_CFLAGS)
+$(CPP_PIC_OBJS): $(objroot)src/%.pic.$(O): $(srcroot)src/%.cpp
+$(CPP_PIC_OBJS): CXXFLAGS += $(PIC_CFLAGS)
+$(C_JET_SYM_OBJS): $(objroot)src/%.jet.sym.$(O): $(srcroot)src/%.c
+$(C_JET_SYM_OBJS): CPPFLAGS += -DJEMALLOC_JET -DJEMALLOC_NO_PRIVATE_NAMESPACE
+$(C_JET_SYMS): $(objroot)src/%.jet.sym: $(objroot)src/%.jet.sym.$(O)
+$(C_JET_OBJS): $(objroot)src/%.jet.$(O): $(srcroot)src/%.c
+$(C_JET_OBJS): CPPFLAGS += -DJEMALLOC_JET
+$(C_TESTLIB_UNIT_OBJS): $(objroot)test/src/%.unit.$(O): $(srcroot)test/src/%.c
+$(C_TESTLIB_UNIT_OBJS): CPPFLAGS += -DJEMALLOC_UNIT_TEST
+$(C_TESTLIB_INTEGRATION_OBJS): $(objroot)test/src/%.integration.$(O): $(srcroot)test/src/%.c
+$(C_TESTLIB_INTEGRATION_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_TEST
+$(C_UTIL_INTEGRATION_OBJS): $(objroot)src/%.integration.$(O): $(srcroot)src/%.c
+$(C_TESTLIB_STRESS_OBJS): $(objroot)test/src/%.stress.$(O): $(srcroot)test/src/%.c
+$(C_TESTLIB_STRESS_OBJS): CPPFLAGS += -DJEMALLOC_STRESS_TEST -DJEMALLOC_STRESS_TESTLIB
+$(C_TESTLIB_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
+$(TESTS_UNIT_OBJS): CPPFLAGS += -DJEMALLOC_UNIT_TEST
+$(TESTS_INTEGRATION_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_TEST
+$(TESTS_INTEGRATION_CPP_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_CPP_TEST
+$(TESTS_STRESS_OBJS): CPPFLAGS += -DJEMALLOC_STRESS_TEST
+$(TESTS_OBJS): $(objroot)test/%.$(O): $(srcroot)test/%.c
+$(TESTS_CPP_OBJS): $(objroot)test/%.$(O): $(srcroot)test/%.cpp
+$(TESTS_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
+$(TESTS_CPP_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
+ifneq ($(IMPORTLIB),$(SO))
+$(CPP_OBJS) $(C_SYM_OBJS) $(C_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS): CPPFLAGS += -DDLLEXPORT
+endif
+
+# Dependencies.
+ifndef CC_MM
+HEADER_DIRS = $(srcroot)include/jemalloc/internal \
+	$(objroot)include/jemalloc $(objroot)include/jemalloc/internal
+HEADERS = $(filter-out $(PRIVATE_NAMESPACE_HDRS),$(wildcard $(foreach dir,$(HEADER_DIRS),$(dir)/*.h)))
+$(C_SYM_OBJS) $(C_OBJS) $(CPP_OBJS) $(C_PIC_OBJS) $(CPP_PIC_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS) $(C_TESTLIB_OBJS) $(TESTS_OBJS) $(TESTS_CPP_OBJS): $(HEADERS)
+$(TESTS_OBJS) $(TESTS_CPP_OBJS): $(objroot)test/include/test/jemalloc_test.h
+endif
+
+$(C_OBJS) $(CPP_OBJS) $(C_PIC_OBJS) $(CPP_PIC_OBJS) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(TESTS_INTEGRATION_OBJS) $(TESTS_INTEGRATION_CPP_OBJS): $(objroot)include/jemalloc/internal/private_namespace.h
+$(C_JET_OBJS) $(C_TESTLIB_UNIT_OBJS) $(C_TESTLIB_STRESS_OBJS) $(TESTS_UNIT_OBJS) $(TESTS_STRESS_OBJS): $(objroot)include/jemalloc/internal/private_namespace_jet.h
+
+$(C_SYM_OBJS) $(C_OBJS) $(C_PIC_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS) $(C_TESTLIB_OBJS) $(TESTS_OBJS): %.$(O):
+	@mkdir -p $(@D)
+	$(CC) $(CFLAGS) -c $(CPPFLAGS) $(CTARGET) $<
+ifdef CC_MM
+	@$(CC) -MM $(CPPFLAGS) -MT $@ -o $(@:%.$(O)=%.d) $<
+endif
+
+$(C_SYMS): %.sym:
+	@mkdir -p $(@D)
+	$(DUMP_SYMS) $< | $(AWK) -f $(objroot)include/jemalloc/internal/private_symbols.awk > $@
+
+$(C_JET_SYMS): %.sym:
+	@mkdir -p $(@D)
+	$(DUMP_SYMS) $< | $(AWK) -f $(objroot)include/jemalloc/internal/private_symbols_jet.awk > $@
+
+$(objroot)include/jemalloc/internal/private_namespace.gen.h: $(C_SYMS)
+	$(SHELL) $(srcroot)include/jemalloc/internal/private_namespace.sh $^ > $@
+
+$(objroot)include/jemalloc/internal/private_namespace_jet.gen.h: $(C_JET_SYMS)
+	$(SHELL) $(srcroot)include/jemalloc/internal/private_namespace.sh $^ > $@
+
+%.h: %.gen.h
+	@if ! `cmp -s $< $@` ; then echo "cp $< $<"; cp $< $@ ; fi
+
+$(CPP_OBJS) $(CPP_PIC_OBJS) $(TESTS_CPP_OBJS): %.$(O):
+	@mkdir -p $(@D)
+	$(CXX) $(CXXFLAGS) -c $(CPPFLAGS) $(CTARGET) $<
+ifdef CC_MM
+	@$(CXX) -MM $(CPPFLAGS) -MT $@ -o $(@:%.$(O)=%.d) $<
+endif
+
+ifneq ($(SOREV),$(SO))
+%.$(SO) : %.$(SOREV)
+	@mkdir -p $(@D)
+	ln -sf $(<F) $@
+endif
+
+$(objroot)lib/$(LIBJEMALLOC).$(SOREV) : $(if $(PIC_CFLAGS),$(C_PIC_OBJS),$(C_OBJS)) $(if $(PIC_CFLAGS),$(CPP_PIC_OBJS),$(CPP_OBJS))
+	@mkdir -p $(@D)
+	$(CC) $(DSO_LDFLAGS) $(call RPATH,$(RPATH_EXTRA)) $(LDTARGET) $+ $(LDFLAGS) $(LIBS) $(EXTRA_LDFLAGS)
+
+$(objroot)lib/$(LIBJEMALLOC)_pic.$(A) : $(C_PIC_OBJS) $(CPP_PIC_OBJS)
+$(objroot)lib/$(LIBJEMALLOC).$(A) : $(C_OBJS) $(CPP_OBJS)
+$(objroot)lib/$(LIBJEMALLOC)_s.$(A) : $(C_OBJS) $(CPP_OBJS)
+
+$(STATIC_LIBS):
+	@mkdir -p $(@D)
+	$(AR) $(ARFLAGS)@AROUT@ $+
+
+$(objroot)test/unit/%$(EXE): $(objroot)test/unit/%.$(O) $(C_JET_OBJS) $(C_TESTLIB_UNIT_OBJS)
+	@mkdir -p $(@D)
+	$(CC) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(LDFLAGS) $(filter-out -lm,$(LIBS)) $(LM) $(EXTRA_LDFLAGS)
+
+$(objroot)test/integration/%$(EXE): $(objroot)test/integration/%.$(O) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
+	@mkdir -p $(@D)
+	$(CC) $(TEST_LD_MODE) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(LJEMALLOC) $(LDFLAGS) $(filter-out -lm,$(filter -lrt -lpthread -lstdc++,$(LIBS))) $(LM) $(EXTRA_LDFLAGS)
+
+$(objroot)test/integration/cpp/%$(EXE): $(objroot)test/integration/cpp/%.$(O) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
+	@mkdir -p $(@D)
+	$(CXX) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB) $(LDFLAGS) $(filter-out -lm,$(LIBS)) -lm $(EXTRA_LDFLAGS)
+
+$(objroot)test/stress/%$(EXE): $(objroot)test/stress/%.$(O) $(C_JET_OBJS) $(C_TESTLIB_STRESS_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
+	@mkdir -p $(@D)
+	$(CC) $(TEST_LD_MODE) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB) $(LDFLAGS) $(filter-out -lm,$(LIBS)) $(LM) $(EXTRA_LDFLAGS)
+
+build_lib_shared: $(DSOS)
+build_lib_static: $(STATIC_LIBS)
+build_lib: build_lib_shared build_lib_static
+
+install_bin:
+	$(INSTALL) -d $(BINDIR)
+	@for b in $(BINS); do \
+	echo "$(INSTALL) -m 755 $$b $(BINDIR)"; \
+	$(INSTALL) -m 755 $$b $(BINDIR); \
+done
+
+install_include:
+	$(INSTALL) -d $(INCLUDEDIR)/jemalloc
+	@for h in $(C_HDRS); do \
+	echo "$(INSTALL) -m 644 $$h $(INCLUDEDIR)/jemalloc"; \
+	$(INSTALL) -m 644 $$h $(INCLUDEDIR)/jemalloc; \
+done
+
+install_lib_shared: $(DSOS)
+	$(INSTALL) -d $(LIBDIR)
+	$(INSTALL) -m 755 $(objroot)lib/$(LIBJEMALLOC).$(SOREV) $(LIBDIR)
+ifneq ($(SOREV),$(SO))
+	ln -sf $(LIBJEMALLOC).$(SOREV) $(LIBDIR)/$(LIBJEMALLOC).$(SO)
+endif
+
+install_lib_static: $(STATIC_LIBS)
+	$(INSTALL) -d $(LIBDIR)
+	@for l in $(STATIC_LIBS); do \
+	echo "$(INSTALL) -m 755 $$l $(LIBDIR)"; \
+	$(INSTALL) -m 755 $$l $(LIBDIR); \
+done
+
+install_lib_pc: $(PC)
+	$(INSTALL) -d $(LIBDIR)/pkgconfig
+	@for l in $(PC); do \
+	echo "$(INSTALL) -m 644 $$l $(LIBDIR)/pkgconfig"; \
+	$(INSTALL) -m 644 $$l $(LIBDIR)/pkgconfig; \
+done
+
+install_lib: install_lib_shared install_lib_static install_lib_pc
+
+install_doc_html:
+	$(INSTALL) -d $(DATADIR)/doc/jemalloc$(install_suffix)
+	@for d in $(DOCS_HTML); do \
+	echo "$(INSTALL) -m 644 $$d $(DATADIR)/doc/jemalloc$(install_suffix)"; \
+	$(INSTALL) -m 644 $$d $(DATADIR)/doc/jemalloc$(install_suffix); \
+done
+
+install_doc_man:
+	$(INSTALL) -d $(MANDIR)/man3
+	@for d in $(DOCS_MAN3); do \
+	echo "$(INSTALL) -m 644 $$d $(MANDIR)/man3"; \
+	$(INSTALL) -m 644 $$d $(MANDIR)/man3; \
+done
+
+install_doc: install_doc_html install_doc_man
+
+install: install_bin install_include install_lib install_doc
+
+tests_unit: $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%$(EXE))
+tests_integration: $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%$(EXE)) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%$(EXE))
+tests_stress: $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%$(EXE))
+tests: tests_unit tests_integration tests_stress
+
+check_unit_dir:
+	@mkdir -p $(objroot)test/unit
+check_integration_dir:
+	@mkdir -p $(objroot)test/integration
+stress_dir:
+	@mkdir -p $(objroot)test/stress
+check_dir: check_unit_dir check_integration_dir
+
+check_unit: tests_unit check_unit_dir
+	$(SHELL) $(objroot)test/test.sh $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%)
+check_integration_prof: tests_integration check_integration_dir
+ifeq ($(enable_prof), 1)
+	$(MALLOC_CONF)="prof:true" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
+	$(MALLOC_CONF)="prof:true,prof_active:false" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
+endif
+check_integration_decay: tests_integration check_integration_dir
+	$(MALLOC_CONF)="dirty_decay_ms:-1,muzzy_decay_ms:-1" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
+	$(MALLOC_CONF)="dirty_decay_ms:0,muzzy_decay_ms:0" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
+check_integration: tests_integration check_integration_dir
+	$(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
+stress: tests_stress stress_dir
+	$(SHELL) $(objroot)test/test.sh $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%)
+check: check_unit check_integration check_integration_decay check_integration_prof
+
+clean:
+	rm -f $(PRIVATE_NAMESPACE_HDRS)
+	rm -f $(PRIVATE_NAMESPACE_GEN_HDRS)
+	rm -f $(C_SYM_OBJS)
+	rm -f $(C_SYMS)
+	rm -f $(C_OBJS)
+	rm -f $(CPP_OBJS)
+	rm -f $(C_PIC_OBJS)
+	rm -f $(CPP_PIC_OBJS)
+	rm -f $(C_JET_SYM_OBJS)
+	rm -f $(C_JET_SYMS)
+	rm -f $(C_JET_OBJS)
+	rm -f $(C_TESTLIB_OBJS)
+	rm -f $(C_SYM_OBJS:%.$(O)=%.d)
+	rm -f $(C_OBJS:%.$(O)=%.d)
+	rm -f $(CPP_OBJS:%.$(O)=%.d)
+	rm -f $(C_PIC_OBJS:%.$(O)=%.d)
+	rm -f $(CPP_PIC_OBJS:%.$(O)=%.d)
+	rm -f $(C_JET_SYM_OBJS:%.$(O)=%.d)
+	rm -f $(C_JET_OBJS:%.$(O)=%.d)
+	rm -f $(C_TESTLIB_OBJS:%.$(O)=%.d)
+	rm -f $(TESTS_OBJS:%.$(O)=%$(EXE))
+	rm -f $(TESTS_OBJS)
+	rm -f $(TESTS_OBJS:%.$(O)=%.d)
+	rm -f $(TESTS_OBJS:%.$(O)=%.out)
+	rm -f $(TESTS_CPP_OBJS:%.$(O)=%$(EXE))
+	rm -f $(TESTS_CPP_OBJS)
+	rm -f $(TESTS_CPP_OBJS:%.$(O)=%.d)
+	rm -f $(TESTS_CPP_OBJS:%.$(O)=%.out)
+	rm -f $(DSOS) $(STATIC_LIBS)
+
+distclean: clean
+	rm -f $(objroot)bin/jemalloc-config
+	rm -f $(objroot)bin/jemalloc.sh
+	rm -f $(objroot)bin/jeprof
+	rm -f $(objroot)config.log
+	rm -f $(objroot)config.status
+	rm -f $(objroot)config.stamp
+	rm -f $(cfghdrs_out)
+	rm -f $(cfgoutputs_out)
+
+relclean: distclean
+	rm -f $(objroot)configure
+	rm -f $(objroot)VERSION
+	rm -f $(DOCS_HTML)
+	rm -f $(DOCS_MAN3)
+
+#===============================================================================
+# Re-configuration rules.
+
+ifeq ($(enable_autogen), 1)
+$(srcroot)configure : $(srcroot)configure.ac
+	cd ./$(srcroot) && $(AUTOCONF)
+
+$(objroot)config.status : $(srcroot)configure
+	./$(objroot)config.status --recheck
+
+$(srcroot)config.stamp.in : $(srcroot)configure.ac
+	echo stamp > $(srcroot)config.stamp.in
+
+$(objroot)config.stamp : $(cfgoutputs_in) $(cfghdrs_in) $(srcroot)configure
+	./$(objroot)config.status
+	@touch $@
+
+# There must be some action in order for make to re-read Makefile when it is
+# out of date.
+$(cfgoutputs_out) $(cfghdrs_out) : $(objroot)config.stamp
+	@true
+endif
diff --git a/redis-stable/deps/jemalloc/README b/redis-stable/deps/jemalloc/README
new file mode 100644
index 00000000..3a6e0d27
--- /dev/null
+++ b/redis-stable/deps/jemalloc/README
@@ -0,0 +1,20 @@
+jemalloc is a general purpose malloc(3) implementation that emphasizes
+fragmentation avoidance and scalable concurrency support.  jemalloc first came
+into use as the FreeBSD libc allocator in 2005, and since then it has found its
+way into numerous applications that rely on its predictable behavior.  In 2010
+jemalloc development efforts broadened to include developer support features
+such as heap profiling and extensive monitoring/tuning hooks.  Modern jemalloc
+releases continue to be integrated back into FreeBSD, and therefore versatility
+remains critical.  Ongoing development efforts trend toward making jemalloc
+among the best allocators for a broad range of demanding applications, and
+eliminating/mitigating weaknesses that have practical repercussions for real
+world applications.
+
+The COPYING file contains copyright and licensing information.
+
+The INSTALL file contains information on how to configure, build, and install
+jemalloc.
+
+The ChangeLog file contains a brief summary of changes for each release.
+
+URL: http://jemalloc.net/
diff --git a/redis-stable/deps/jemalloc/TUNING.md b/redis-stable/deps/jemalloc/TUNING.md
new file mode 100644
index 00000000..34fca05b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/TUNING.md
@@ -0,0 +1,129 @@
+This document summarizes the common approaches for performance fine tuning with
+jemalloc (as of 5.1.0).  The default configuration of jemalloc tends to work
+reasonably well in practice, and most applications should not have to tune any
+options. However, in order to cover a wide range of applications and avoid
+pathological cases, the default setting is sometimes kept conservative and
+suboptimal, even for many common workloads.  When jemalloc is properly tuned for
+a specific application / workload, it is common to improve system level metrics
+by a few percent, or make favorable trade-offs.
+
+
+## Notable runtime options for performance tuning
+
+Runtime options can be set via
+[malloc_conf](http://jemalloc.net/jemalloc.3.html#tuning).
+
+* [background_thread](http://jemalloc.net/jemalloc.3.html#background_thread)
+
+    Enabling jemalloc background threads generally improves the tail latency for
+    application threads, since unused memory purging is shifted to the dedicated
+    background threads.  In addition, unintended purging delay caused by
+    application inactivity is avoided with background threads.
+
+    Suggested: `background_thread:true` when jemalloc managed threads can be
+    allowed.
+
+* [metadata_thp](http://jemalloc.net/jemalloc.3.html#opt.metadata_thp)
+
+    Allowing jemalloc to utilize transparent huge pages for its internal
+    metadata usually reduces TLB misses significantly, especially for programs
+    with large memory footprint and frequent allocation / deallocation
+    activities.  Metadata memory usage may increase due to the use of huge
+    pages.
+
+    Suggested for allocation intensive programs: `metadata_thp:auto` or
+    `metadata_thp:always`, which is expected to improve CPU utilization at a
+    small memory cost.
+
+* [dirty_decay_ms](http://jemalloc.net/jemalloc.3.html#opt.dirty_decay_ms) and
+  [muzzy_decay_ms](http://jemalloc.net/jemalloc.3.html#opt.muzzy_decay_ms)
+
+    Decay time determines how fast jemalloc returns unused pages back to the
+    operating system, and therefore provides a fairly straightforward trade-off
+    between CPU and memory usage.  Shorter decay time purges unused pages faster
+    to reduces memory usage (usually at the cost of more CPU cycles spent on
+    purging), and vice versa.
+
+    Suggested: tune the values based on the desired trade-offs.
+
+* [narenas](http://jemalloc.net/jemalloc.3.html#opt.narenas)
+
+    By default jemalloc uses multiple arenas to reduce internal lock contention.
+    However high arena count may also increase overall memory fragmentation,
+    since arenas manage memory independently.  When high degree of parallelism
+    is not expected at the allocator level, lower number of arenas often
+    improves memory usage.
+
+    Suggested: if low parallelism is expected, try lower arena count while
+    monitoring CPU and memory usage.
+
+* [percpu_arena](http://jemalloc.net/jemalloc.3.html#opt.percpu_arena)
+
+    Enable dynamic thread to arena association based on running CPU.  This has
+    the potential to improve locality, e.g. when thread to CPU affinity is
+    present.
+    
+    Suggested: try `percpu_arena:percpu` or `percpu_arena:phycpu` if
+    thread migration between processors is expected to be infrequent.
+
+Examples:
+
+* High resource consumption application, prioritizing CPU utilization:
+
+    `background_thread:true,metadata_thp:auto` combined with relaxed decay time
+    (increased `dirty_decay_ms` and / or `muzzy_decay_ms`,
+    e.g. `dirty_decay_ms:30000,muzzy_decay_ms:30000`).
+
+* High resource consumption application, prioritizing memory usage:
+
+    `background_thread:true` combined with shorter decay time (decreased
+    `dirty_decay_ms` and / or `muzzy_decay_ms`,
+    e.g. `dirty_decay_ms:5000,muzzy_decay_ms:5000`), and lower arena count
+    (e.g. number of CPUs).
+
+* Low resource consumption application:
+
+    `narenas:1,lg_tcache_max:13` combined with shorter decay time (decreased
+    `dirty_decay_ms` and / or `muzzy_decay_ms`,e.g.
+    `dirty_decay_ms:1000,muzzy_decay_ms:0`).
+
+* Extremely conservative -- minimize memory usage at all costs, only suitable when
+allocation activity is very rare:
+
+    `narenas:1,tcache:false,dirty_decay_ms:0,muzzy_decay_ms:0`
+
+Note that it is recommended to combine the options with `abort_conf:true` which
+aborts immediately on illegal options.
+
+## Beyond runtime options
+
+In addition to the runtime options, there are a number of programmatic ways to
+improve application performance with jemalloc.
+
+* [Explicit arenas](http://jemalloc.net/jemalloc.3.html#arenas.create)
+
+    Manually created arenas can help performance in various ways, e.g. by
+    managing locality and contention for specific usages.  For example,
+    applications can explicitly allocate frequently accessed objects from a
+    dedicated arena with
+    [mallocx()](http://jemalloc.net/jemalloc.3.html#MALLOCX_ARENA) to improve
+    locality.  In addition, explicit arenas often benefit from individually
+    tuned options, e.g. relaxed [decay
+    time](http://jemalloc.net/jemalloc.3.html#arena.i.dirty_decay_ms) if
+    frequent reuse is expected.
+
+* [Extent hooks](http://jemalloc.net/jemalloc.3.html#arena.i.extent_hooks)
+
+    Extent hooks allow customization for managing underlying memory.  One use
+    case for performance purpose is to utilize huge pages -- for example,
+    [HHVM](https://github.com/facebook/hhvm/blob/master/hphp/util/alloc.cpp)
+    uses explicit arenas with customized extent hooks to manage 1GB huge pages
+    for frequently accessed data, which reduces TLB misses significantly.
+
+* [Explicit thread-to-arena
+  binding](http://jemalloc.net/jemalloc.3.html#thread.arena)
+
+    It is common for some threads in an application to have different memory
+    access / allocation patterns.  Threads with heavy workloads often benefit
+    from explicit binding, e.g. binding very active threads to dedicated arenas
+    may reduce contention at the allocator level.
diff --git a/redis-stable/deps/jemalloc/autogen.sh b/redis-stable/deps/jemalloc/autogen.sh
new file mode 100755
index 00000000..75f32da6
--- /dev/null
+++ b/redis-stable/deps/jemalloc/autogen.sh
@@ -0,0 +1,17 @@
+#!/bin/sh
+
+for i in autoconf; do
+    echo "$i"
+    $i
+    if [ $? -ne 0 ]; then
+	echo "Error $? in $i"
+	exit 1
+    fi
+done
+
+echo "./configure --enable-autogen $@"
+./configure --enable-autogen $@
+if [ $? -ne 0 ]; then
+    echo "Error $? in ./configure"
+    exit 1
+fi
diff --git a/redis-stable/deps/jemalloc/bin/jemalloc-config.in b/redis-stable/deps/jemalloc/bin/jemalloc-config.in
new file mode 100644
index 00000000..80eca2e6
--- /dev/null
+++ b/redis-stable/deps/jemalloc/bin/jemalloc-config.in
@@ -0,0 +1,83 @@
+#!/bin/sh
+
+usage() {
+	cat <<EOF
+Usage:
+  @BINDIR@/jemalloc-config <option>
+Options:
+  --help | -h  : Print usage.
+  --version    : Print jemalloc version.
+  --revision   : Print shared library revision number.
+  --config     : Print configure options used to build jemalloc.
+  --prefix     : Print installation directory prefix.
+  --bindir     : Print binary installation directory.
+  --datadir    : Print data installation directory.
+  --includedir : Print include installation directory.
+  --libdir     : Print library installation directory.
+  --mandir     : Print manual page installation directory.
+  --cc         : Print compiler used to build jemalloc.
+  --cflags     : Print compiler flags used to build jemalloc.
+  --cppflags   : Print preprocessor flags used to build jemalloc.
+  --cxxflags   : Print C++ compiler flags used to build jemalloc.
+  --ldflags    : Print library flags used to build jemalloc.
+  --libs       : Print libraries jemalloc was linked against.
+EOF
+}
+
+prefix="@prefix@"
+exec_prefix="@exec_prefix@"
+
+case "$1" in
+--help | -h)
+	usage
+	exit 0
+	;;
+--version)
+	echo "@jemalloc_version@"
+	;;
+--revision)
+	echo "@rev@"
+	;;
+--config)
+	echo "@CONFIG@"
+	;;
+--prefix)
+	echo "@PREFIX@"
+	;;
+--bindir)
+	echo "@BINDIR@"
+	;;
+--datadir)
+	echo "@DATADIR@"
+	;;
+--includedir)
+	echo "@INCLUDEDIR@"
+	;;
+--libdir)
+	echo "@LIBDIR@"
+	;;
+--mandir)
+	echo "@MANDIR@"
+	;;
+--cc)
+	echo "@CC@"
+	;;
+--cflags)
+	echo "@CFLAGS@"
+	;;
+--cppflags)
+	echo "@CPPFLAGS@"
+	;;
+--cxxflags)
+	echo "@CXXFLAGS@"
+	;;
+--ldflags)
+	echo "@LDFLAGS@ @EXTRA_LDFLAGS@"
+	;;
+--libs)
+	echo "@LIBS@"
+	;;
+*)
+	usage
+	exit 1
+esac
diff --git a/redis-stable/deps/jemalloc/bin/jemalloc.sh.in b/redis-stable/deps/jemalloc/bin/jemalloc.sh.in
new file mode 100644
index 00000000..cdf36737
--- /dev/null
+++ b/redis-stable/deps/jemalloc/bin/jemalloc.sh.in
@@ -0,0 +1,9 @@
+#!/bin/sh
+
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+
+@LD_PRELOAD_VAR@=${libdir}/libjemalloc.@SOREV@
+export @LD_PRELOAD_VAR@
+exec "$@"
diff --git a/redis-stable/deps/jemalloc/bin/jeprof.in b/redis-stable/deps/jemalloc/bin/jeprof.in
new file mode 100644
index 00000000..588c6b43
--- /dev/null
+++ b/redis-stable/deps/jemalloc/bin/jeprof.in
@@ -0,0 +1,5624 @@
+#! /usr/bin/env perl
+
+# Copyright (c) 1998-2007, Google Inc.
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are
+# met:
+#
+#     * Redistributions of source code must retain the above copyright
+# notice, this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above
+# copyright notice, this list of conditions and the following disclaimer
+# in the documentation and/or other materials provided with the
+# distribution.
+#     * Neither the name of Google Inc. nor the names of its
+# contributors may be used to endorse or promote products derived from
+# this software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# ---
+# Program for printing the profile generated by common/profiler.cc,
+# or by the heap profiler (common/debugallocation.cc)
+#
+# The profile contains a sequence of entries of the form:
+#       <count> <stack trace>
+# This program parses the profile, and generates user-readable
+# output.
+#
+# Examples:
+#
+# % tools/jeprof "program" "profile"
+#   Enters "interactive" mode
+#
+# % tools/jeprof --text "program" "profile"
+#   Generates one line per procedure
+#
+# % tools/jeprof --gv "program" "profile"
+#   Generates annotated call-graph and displays via "gv"
+#
+# % tools/jeprof --gv --focus=Mutex "program" "profile"
+#   Restrict to code paths that involve an entry that matches "Mutex"
+#
+# % tools/jeprof --gv --focus=Mutex --ignore=string "program" "profile"
+#   Restrict to code paths that involve an entry that matches "Mutex"
+#   and does not match "string"
+#
+# % tools/jeprof --list=IBF_CheckDocid "program" "profile"
+#   Generates disassembly listing of all routines with at least one
+#   sample that match the --list=<regexp> pattern.  The listing is
+#   annotated with the flat and cumulative sample counts at each line.
+#
+# % tools/jeprof --disasm=IBF_CheckDocid "program" "profile"
+#   Generates disassembly listing of all routines with at least one
+#   sample that match the --disasm=<regexp> pattern.  The listing is
+#   annotated with the flat and cumulative sample counts at each PC value.
+#
+# TODO: Use color to indicate files?
+
+use strict;
+use warnings;
+use Getopt::Long;
+use Cwd;
+
+my $JEPROF_VERSION = "@jemalloc_version@";
+my $PPROF_VERSION = "2.0";
+
+# These are the object tools we use which can come from a
+# user-specified location using --tools, from the JEPROF_TOOLS
+# environment variable, or from the environment.
+my %obj_tool_map = (
+  "objdump" => "objdump",
+  "nm" => "nm",
+  "addr2line" => "addr2line",
+  "c++filt" => "c++filt",
+  ## ConfigureObjTools may add architecture-specific entries:
+  #"nm_pdb" => "nm-pdb",       # for reading windows (PDB-format) executables
+  #"addr2line_pdb" => "addr2line-pdb",                                # ditto
+  #"otool" => "otool",         # equivalent of objdump on OS X
+);
+# NOTE: these are lists, so you can put in commandline flags if you want.
+my @DOT = ("dot");          # leave non-absolute, since it may be in /usr/local
+my @GV = ("gv");
+my @EVINCE = ("evince");    # could also be xpdf or perhaps acroread
+my @KCACHEGRIND = ("kcachegrind");
+my @PS2PDF = ("ps2pdf");
+# These are used for dynamic profiles
+my @URL_FETCHER = ("curl", "-s", "--fail");
+
+# These are the web pages that servers need to support for dynamic profiles
+my $HEAP_PAGE = "/pprof/heap";
+my $PROFILE_PAGE = "/pprof/profile";   # must support cgi-param "?seconds=#"
+my $PMUPROFILE_PAGE = "/pprof/pmuprofile(?:\\?.*)?"; # must support cgi-param
+                                                # ?seconds=#&event=x&period=n
+my $GROWTH_PAGE = "/pprof/growth";
+my $CONTENTION_PAGE = "/pprof/contention";
+my $WALL_PAGE = "/pprof/wall(?:\\?.*)?";  # accepts options like namefilter
+my $FILTEREDPROFILE_PAGE = "/pprof/filteredprofile(?:\\?.*)?";
+my $CENSUSPROFILE_PAGE = "/pprof/censusprofile(?:\\?.*)?"; # must support cgi-param
+                                                       # "?seconds=#",
+                                                       # "?tags_regexp=#" and
+                                                       # "?type=#".
+my $SYMBOL_PAGE = "/pprof/symbol";     # must support symbol lookup via POST
+my $PROGRAM_NAME_PAGE = "/pprof/cmdline";
+
+# These are the web pages that can be named on the command line.
+# All the alternatives must begin with /.
+my $PROFILES = "($HEAP_PAGE|$PROFILE_PAGE|$PMUPROFILE_PAGE|" .
+               "$GROWTH_PAGE|$CONTENTION_PAGE|$WALL_PAGE|" .
+               "$FILTEREDPROFILE_PAGE|$CENSUSPROFILE_PAGE)";
+
+# default binary name
+my $UNKNOWN_BINARY = "(unknown)";
+
+# There is a pervasive dependency on the length (in hex characters,
+# i.e., nibbles) of an address, distinguishing between 32-bit and
+# 64-bit profiles.  To err on the safe size, default to 64-bit here:
+my $address_length = 16;
+
+my $dev_null = "/dev/null";
+if (! -e $dev_null && $^O =~ /MSWin/) {    # $^O is the OS perl was built for
+  $dev_null = "nul";
+}
+
+# A list of paths to search for shared object files
+my @prefix_list = ();
+
+# Special routine name that should not have any symbols.
+# Used as separator to parse "addr2line -i" output.
+my $sep_symbol = '_fini';
+my $sep_address = undef;
+
+##### Argument parsing #####
+
+sub usage_string {
+  return <<EOF;
+Usage:
+jeprof [options] <program> <profiles>
+   <profiles> is a space separated list of profile names.
+jeprof [options] <symbolized-profiles>
+   <symbolized-profiles> is a list of profile files where each file contains
+   the necessary symbol mappings  as well as profile data (likely generated
+   with --raw).
+jeprof [options] <profile>
+   <profile> is a remote form.  Symbols are obtained from host:port$SYMBOL_PAGE
+
+   Each name can be:
+   /path/to/profile        - a path to a profile file
+   host:port[/<service>]   - a location of a service to get profile from
+
+   The /<service> can be $HEAP_PAGE, $PROFILE_PAGE, /pprof/pmuprofile,
+                         $GROWTH_PAGE, $CONTENTION_PAGE, /pprof/wall,
+                         $CENSUSPROFILE_PAGE, or /pprof/filteredprofile.
+   For instance:
+     jeprof http://myserver.com:80$HEAP_PAGE
+   If /<service> is omitted, the service defaults to $PROFILE_PAGE (cpu profiling).
+jeprof --symbols <program>
+   Maps addresses to symbol names.  In this mode, stdin should be a
+   list of library mappings, in the same format as is found in the heap-
+   and cpu-profile files (this loosely matches that of /proc/self/maps
+   on linux), followed by a list of hex addresses to map, one per line.
+
+   For more help with querying remote servers, including how to add the
+   necessary server-side support code, see this filename (or one like it):
+
+   /usr/doc/gperftools-$PPROF_VERSION/pprof_remote_servers.html
+
+Options:
+   --cum               Sort by cumulative data
+   --base=<base>       Subtract <base> from <profile> before display
+   --interactive       Run in interactive mode (interactive "help" gives help) [default]
+   --seconds=<n>       Length of time for dynamic profiles [default=30 secs]
+   --add_lib=<file>    Read additional symbols and line info from the given library
+   --lib_prefix=<dir>  Comma separated list of library path prefixes
+
+Reporting Granularity:
+   --addresses         Report at address level
+   --lines             Report at source line level
+   --functions         Report at function level [default]
+   --files             Report at source file level
+
+Output type:
+   --text              Generate text report
+   --callgrind         Generate callgrind format to stdout
+   --gv                Generate Postscript and display
+   --evince            Generate PDF and display
+   --web               Generate SVG and display
+   --list=<regexp>     Generate source listing of matching routines
+   --disasm=<regexp>   Generate disassembly of matching routines
+   --symbols           Print demangled symbol names found at given addresses
+   --dot               Generate DOT file to stdout
+   --ps                Generate Postcript to stdout
+   --pdf               Generate PDF to stdout
+   --svg               Generate SVG to stdout
+   --gif               Generate GIF to stdout
+   --raw               Generate symbolized jeprof data (useful with remote fetch)
+
+Heap-Profile Options:
+   --inuse_space       Display in-use (mega)bytes [default]
+   --inuse_objects     Display in-use objects
+   --alloc_space       Display allocated (mega)bytes
+   --alloc_objects     Display allocated objects
+   --show_bytes        Display space in bytes
+   --drop_negative     Ignore negative differences
+
+Contention-profile options:
+   --total_delay       Display total delay at each region [default]
+   --contentions       Display number of delays at each region
+   --mean_delay        Display mean delay at each region
+
+Call-graph Options:
+   --nodecount=<n>     Show at most so many nodes [default=80]
+   --nodefraction=<f>  Hide nodes below <f>*total [default=.005]
+   --edgefraction=<f>  Hide edges below <f>*total [default=.001]
+   --maxdegree=<n>     Max incoming/outgoing edges per node [default=8]
+   --focus=<regexp>    Focus on backtraces with nodes matching <regexp>
+   --thread=<n>        Show profile for thread <n>
+   --ignore=<regexp>   Ignore backtraces with nodes matching <regexp>
+   --scale=<n>         Set GV scaling [default=0]
+   --heapcheck         Make nodes with non-0 object counts
+                       (i.e. direct leak generators) more visible
+   --retain=<regexp>   Retain only nodes that match <regexp>
+   --exclude=<regexp>  Exclude all nodes that match <regexp>
+
+Miscellaneous:
+   --tools=<prefix or binary:fullpath>[,...]   \$PATH for object tool pathnames
+   --test              Run unit tests
+   --help              This message
+   --version           Version information
+
+Environment Variables:
+   JEPROF_TMPDIR        Profiles directory. Defaults to \$HOME/jeprof
+   JEPROF_TOOLS         Prefix for object tools pathnames
+
+Examples:
+
+jeprof /bin/ls ls.prof
+                       Enters "interactive" mode
+jeprof --text /bin/ls ls.prof
+                       Outputs one line per procedure
+jeprof --web /bin/ls ls.prof
+                       Displays annotated call-graph in web browser
+jeprof --gv /bin/ls ls.prof
+                       Displays annotated call-graph via 'gv'
+jeprof --gv --focus=Mutex /bin/ls ls.prof
+                       Restricts to code paths including a .*Mutex.* entry
+jeprof --gv --focus=Mutex --ignore=string /bin/ls ls.prof
+                       Code paths including Mutex but not string
+jeprof --list=getdir /bin/ls ls.prof
+                       (Per-line) annotated source listing for getdir()
+jeprof --disasm=getdir /bin/ls ls.prof
+                       (Per-PC) annotated disassembly for getdir()
+
+jeprof http://localhost:1234/
+                       Enters "interactive" mode
+jeprof --text localhost:1234
+                       Outputs one line per procedure for localhost:1234
+jeprof --raw localhost:1234 > ./local.raw
+jeprof --text ./local.raw
+                       Fetches a remote profile for later analysis and then
+                       analyzes it in text mode.
+EOF
+}
+
+sub version_string {
+  return <<EOF
+jeprof (part of jemalloc $JEPROF_VERSION)
+based on pprof (part of gperftools $PPROF_VERSION)
+
+Copyright 1998-2007 Google Inc.
+
+This is BSD licensed software; see the source for copying conditions
+and license information.
+There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE.
+EOF
+}
+
+sub usage {
+  my $msg = shift;
+  print STDERR "$msg\n\n";
+  print STDERR usage_string();
+  print STDERR "\nFATAL ERROR: $msg\n";    # just as a reminder
+  exit(1);
+}
+
+sub Init() {
+  # Setup tmp-file name and handler to clean it up.
+  # We do this in the very beginning so that we can use
+  # error() and cleanup() function anytime here after.
+  $main::tmpfile_sym = "/tmp/jeprof$$.sym";
+  $main::tmpfile_ps = "/tmp/jeprof$$";
+  $main::next_tmpfile = 0;
+  $SIG{'INT'} = \&sighandler;
+
+  # Cache from filename/linenumber to source code
+  $main::source_cache = ();
+
+  $main::opt_help = 0;
+  $main::opt_version = 0;
+
+  $main::opt_cum = 0;
+  $main::opt_base = '';
+  $main::opt_addresses = 0;
+  $main::opt_lines = 0;
+  $main::opt_functions = 0;
+  $main::opt_files = 0;
+  $main::opt_lib_prefix = "";
+
+  $main::opt_text = 0;
+  $main::opt_callgrind = 0;
+  $main::opt_list = "";
+  $main::opt_disasm = "";
+  $main::opt_symbols = 0;
+  $main::opt_gv = 0;
+  $main::opt_evince = 0;
+  $main::opt_web = 0;
+  $main::opt_dot = 0;
+  $main::opt_ps = 0;
+  $main::opt_pdf = 0;
+  $main::opt_gif = 0;
+  $main::opt_svg = 0;
+  $main::opt_raw = 0;
+
+  $main::opt_nodecount = 80;
+  $main::opt_nodefraction = 0.005;
+  $main::opt_edgefraction = 0.001;
+  $main::opt_maxdegree = 8;
+  $main::opt_focus = '';
+  $main::opt_thread = undef;
+  $main::opt_ignore = '';
+  $main::opt_scale = 0;
+  $main::opt_heapcheck = 0;
+  $main::opt_retain = '';
+  $main::opt_exclude = '';
+  $main::opt_seconds = 30;
+  $main::opt_lib = "";
+
+  $main::opt_inuse_space   = 0;
+  $main::opt_inuse_objects = 0;
+  $main::opt_alloc_space   = 0;
+  $main::opt_alloc_objects = 0;
+  $main::opt_show_bytes    = 0;
+  $main::opt_drop_negative = 0;
+  $main::opt_interactive   = 0;
+
+  $main::opt_total_delay = 0;
+  $main::opt_contentions = 0;
+  $main::opt_mean_delay = 0;
+
+  $main::opt_tools   = "";
+  $main::opt_debug   = 0;
+  $main::opt_test    = 0;
+
+  # These are undocumented flags used only by unittests.
+  $main::opt_test_stride = 0;
+
+  # Are we using $SYMBOL_PAGE?
+  $main::use_symbol_page = 0;
+
+  # Files returned by TempName.
+  %main::tempnames = ();
+
+  # Type of profile we are dealing with
+  # Supported types:
+  #     cpu
+  #     heap
+  #     growth
+  #     contention
+  $main::profile_type = '';     # Empty type means "unknown"
+
+  GetOptions("help!"          => \$main::opt_help,
+             "version!"       => \$main::opt_version,
+             "cum!"           => \$main::opt_cum,
+             "base=s"         => \$main::opt_base,
+             "seconds=i"      => \$main::opt_seconds,
+             "add_lib=s"      => \$main::opt_lib,
+             "lib_prefix=s"   => \$main::opt_lib_prefix,
+             "functions!"     => \$main::opt_functions,
+             "lines!"         => \$main::opt_lines,
+             "addresses!"     => \$main::opt_addresses,
+             "files!"         => \$main::opt_files,
+             "text!"          => \$main::opt_text,
+             "callgrind!"     => \$main::opt_callgrind,
+             "list=s"         => \$main::opt_list,
+             "disasm=s"       => \$main::opt_disasm,
+             "symbols!"       => \$main::opt_symbols,
+             "gv!"            => \$main::opt_gv,
+             "evince!"        => \$main::opt_evince,
+             "web!"           => \$main::opt_web,
+             "dot!"           => \$main::opt_dot,
+             "ps!"            => \$main::opt_ps,
+             "pdf!"           => \$main::opt_pdf,
+             "svg!"           => \$main::opt_svg,
+             "gif!"           => \$main::opt_gif,
+             "raw!"           => \$main::opt_raw,
+             "interactive!"   => \$main::opt_interactive,
+             "nodecount=i"    => \$main::opt_nodecount,
+             "nodefraction=f" => \$main::opt_nodefraction,
+             "edgefraction=f" => \$main::opt_edgefraction,
+             "maxdegree=i"    => \$main::opt_maxdegree,
+             "focus=s"        => \$main::opt_focus,
+             "thread=s"       => \$main::opt_thread,
+             "ignore=s"       => \$main::opt_ignore,
+             "scale=i"        => \$main::opt_scale,
+             "heapcheck"      => \$main::opt_heapcheck,
+             "retain=s"       => \$main::opt_retain,
+             "exclude=s"      => \$main::opt_exclude,
+             "inuse_space!"   => \$main::opt_inuse_space,
+             "inuse_objects!" => \$main::opt_inuse_objects,
+             "alloc_space!"   => \$main::opt_alloc_space,
+             "alloc_objects!" => \$main::opt_alloc_objects,
+             "show_bytes!"    => \$main::opt_show_bytes,
+             "drop_negative!" => \$main::opt_drop_negative,
+             "total_delay!"   => \$main::opt_total_delay,
+             "contentions!"   => \$main::opt_contentions,
+             "mean_delay!"    => \$main::opt_mean_delay,
+             "tools=s"        => \$main::opt_tools,
+             "test!"          => \$main::opt_test,
+             "debug!"         => \$main::opt_debug,
+             # Undocumented flags used only by unittests:
+             "test_stride=i"  => \$main::opt_test_stride,
+      ) || usage("Invalid option(s)");
+
+  # Deal with the standard --help and --version
+  if ($main::opt_help) {
+    print usage_string();
+    exit(0);
+  }
+
+  if ($main::opt_version) {
+    print version_string();
+    exit(0);
+  }
+
+  # Disassembly/listing/symbols mode requires address-level info
+  if ($main::opt_disasm || $main::opt_list || $main::opt_symbols) {
+    $main::opt_functions = 0;
+    $main::opt_lines = 0;
+    $main::opt_addresses = 1;
+    $main::opt_files = 0;
+  }
+
+  # Check heap-profiling flags
+  if ($main::opt_inuse_space +
+      $main::opt_inuse_objects +
+      $main::opt_alloc_space +
+      $main::opt_alloc_objects > 1) {
+    usage("Specify at most on of --inuse/--alloc options");
+  }
+
+  # Check output granularities
+  my $grains =
+      $main::opt_functions +
+      $main::opt_lines +
+      $main::opt_addresses +
+      $main::opt_files +
+      0;
+  if ($grains > 1) {
+    usage("Only specify one output granularity option");
+  }
+  if ($grains == 0) {
+    $main::opt_functions = 1;
+  }
+
+  # Check output modes
+  my $modes =
+      $main::opt_text +
+      $main::opt_callgrind +
+      ($main::opt_list eq '' ? 0 : 1) +
+      ($main::opt_disasm eq '' ? 0 : 1) +
+      ($main::opt_symbols == 0 ? 0 : 1) +
+      $main::opt_gv +
+      $main::opt_evince +
+      $main::opt_web +
+      $main::opt_dot +
+      $main::opt_ps +
+      $main::opt_pdf +
+      $main::opt_svg +
+      $main::opt_gif +
+      $main::opt_raw +
+      $main::opt_interactive +
+      0;
+  if ($modes > 1) {
+    usage("Only specify one output mode");
+  }
+  if ($modes == 0) {
+    if (-t STDOUT) {  # If STDOUT is a tty, activate interactive mode
+      $main::opt_interactive = 1;
+    } else {
+      $main::opt_text = 1;
+    }
+  }
+
+  if ($main::opt_test) {
+    RunUnitTests();
+    # Should not return
+    exit(1);
+  }
+
+  # Binary name and profile arguments list
+  $main::prog = "";
+  @main::pfile_args = ();
+
+  # Remote profiling without a binary (using $SYMBOL_PAGE instead)
+  if (@ARGV > 0) {
+    if (IsProfileURL($ARGV[0])) {
+      $main::use_symbol_page = 1;
+    } elsif (IsSymbolizedProfileFile($ARGV[0])) {
+      $main::use_symbolized_profile = 1;
+      $main::prog = $UNKNOWN_BINARY;  # will be set later from the profile file
+    }
+  }
+
+  if ($main::use_symbol_page || $main::use_symbolized_profile) {
+    # We don't need a binary!
+    my %disabled = ('--lines' => $main::opt_lines,
+                    '--disasm' => $main::opt_disasm);
+    for my $option (keys %disabled) {
+      usage("$option cannot be used without a binary") if $disabled{$option};
+    }
+    # Set $main::prog later...
+    scalar(@ARGV) || usage("Did not specify profile file");
+  } elsif ($main::opt_symbols) {
+    # --symbols needs a binary-name (to run nm on, etc) but not profiles
+    $main::prog = shift(@ARGV) || usage("Did not specify program");
+  } else {
+    $main::prog = shift(@ARGV) || usage("Did not specify program");
+    scalar(@ARGV) || usage("Did not specify profile file");
+  }
+
+  # Parse profile file/location arguments
+  foreach my $farg (@ARGV) {
+    if ($farg =~ m/(.*)\@([0-9]+)(|\/.*)$/ ) {
+      my $machine = $1;
+      my $num_machines = $2;
+      my $path = $3;
+      for (my $i = 0; $i < $num_machines; $i++) {
+        unshift(@main::pfile_args, "$i.$machine$path");
+      }
+    } else {
+      unshift(@main::pfile_args, $farg);
+    }
+  }
+
+  if ($main::use_symbol_page) {
+    unless (IsProfileURL($main::pfile_args[0])) {
+      error("The first profile should be a remote form to use $SYMBOL_PAGE\n");
+    }
+    CheckSymbolPage();
+    $main::prog = FetchProgramName();
+  } elsif (!$main::use_symbolized_profile) {  # may not need objtools!
+    ConfigureObjTools($main::prog)
+  }
+
+  # Break the opt_lib_prefix into the prefix_list array
+  @prefix_list = split (',', $main::opt_lib_prefix);
+
+  # Remove trailing / from the prefixes, in the list to prevent
+  # searching things like /my/path//lib/mylib.so
+  foreach (@prefix_list) {
+    s|/+$||;
+  }
+}
+
+sub FilterAndPrint {
+  my ($profile, $symbols, $libs, $thread) = @_;
+
+  # Get total data in profile
+  my $total = TotalProfile($profile);
+
+  # Remove uniniteresting stack items
+  $profile = RemoveUninterestingFrames($symbols, $profile);
+
+  # Focus?
+  if ($main::opt_focus ne '') {
+    $profile = FocusProfile($symbols, $profile, $main::opt_focus);
+  }
+
+  # Ignore?
+  if ($main::opt_ignore ne '') {
+    $profile = IgnoreProfile($symbols, $profile, $main::opt_ignore);
+  }
+
+  my $calls = ExtractCalls($symbols, $profile);
+
+  # Reduce profiles to required output granularity, and also clean
+  # each stack trace so a given entry exists at most once.
+  my $reduced = ReduceProfile($symbols, $profile);
+
+  # Get derived profiles
+  my $flat = FlatProfile($reduced);
+  my $cumulative = CumulativeProfile($reduced);
+
+  # Print
+  if (!$main::opt_interactive) {
+    if ($main::opt_disasm) {
+      PrintDisassembly($libs, $flat, $cumulative, $main::opt_disasm);
+    } elsif ($main::opt_list) {
+      PrintListing($total, $libs, $flat, $cumulative, $main::opt_list, 0);
+    } elsif ($main::opt_text) {
+      # Make sure the output is empty when have nothing to report
+      # (only matters when --heapcheck is given but we must be
+      # compatible with old branches that did not pass --heapcheck always):
+      if ($total != 0) {
+        printf("Total%s: %s %s\n",
+               (defined($thread) ? " (t$thread)" : ""),
+               Unparse($total), Units());
+      }
+      PrintText($symbols, $flat, $cumulative, -1);
+    } elsif ($main::opt_raw) {
+      PrintSymbolizedProfile($symbols, $profile, $main::prog);
+    } elsif ($main::opt_callgrind) {
+      PrintCallgrind($calls);
+    } else {
+      if (PrintDot($main::prog, $symbols, $profile, $flat, $cumulative, $total)) {
+        if ($main::opt_gv) {
+          RunGV(TempName($main::next_tmpfile, "ps"), "");
+        } elsif ($main::opt_evince) {
+          RunEvince(TempName($main::next_tmpfile, "pdf"), "");
+        } elsif ($main::opt_web) {
+          my $tmp = TempName($main::next_tmpfile, "svg");
+          RunWeb($tmp);
+          # The command we run might hand the file name off
+          # to an already running browser instance and then exit.
+          # Normally, we'd remove $tmp on exit (right now),
+          # but fork a child to remove $tmp a little later, so that the
+          # browser has time to load it first.
+          delete $main::tempnames{$tmp};
+          if (fork() == 0) {
+            sleep 5;
+            unlink($tmp);
+            exit(0);
+          }
+        }
+      } else {
+        cleanup();
+        exit(1);
+      }
+    }
+  } else {
+    InteractiveMode($profile, $symbols, $libs, $total);
+  }
+}
+
+sub Main() {
+  Init();
+  $main::collected_profile = undef;
+  @main::profile_files = ();
+  $main::op_time = time();
+
+  # Printing symbols is special and requires a lot less info that most.
+  if ($main::opt_symbols) {
+    PrintSymbols(*STDIN);   # Get /proc/maps and symbols output from stdin
+    return;
+  }
+
+  # Fetch all profile data
+  FetchDynamicProfiles();
+
+  # this will hold symbols that we read from the profile files
+  my $symbol_map = {};
+
+  # Read one profile, pick the last item on the list
+  my $data = ReadProfile($main::prog, pop(@main::profile_files));
+  my $profile = $data->{profile};
+  my $pcs = $data->{pcs};
+  my $libs = $data->{libs};   # Info about main program and shared libraries
+  $symbol_map = MergeSymbols($symbol_map, $data->{symbols});
+
+  # Add additional profiles, if available.
+  if (scalar(@main::profile_files) > 0) {
+    foreach my $pname (@main::profile_files) {
+      my $data2 = ReadProfile($main::prog, $pname);
+      $profile = AddProfile($profile, $data2->{profile});
+      $pcs = AddPcs($pcs, $data2->{pcs});
+      $symbol_map = MergeSymbols($symbol_map, $data2->{symbols});
+    }
+  }
+
+  # Subtract base from profile, if specified
+  if ($main::opt_base ne '') {
+    my $base = ReadProfile($main::prog, $main::opt_base);
+    $profile = SubtractProfile($profile, $base->{profile});
+    $pcs = AddPcs($pcs, $base->{pcs});
+    $symbol_map = MergeSymbols($symbol_map, $base->{symbols});
+  }
+
+  # Collect symbols
+  my $symbols;
+  if ($main::use_symbolized_profile) {
+    $symbols = FetchSymbols($pcs, $symbol_map);
+  } elsif ($main::use_symbol_page) {
+    $symbols = FetchSymbols($pcs);
+  } else {
+    # TODO(csilvers): $libs uses the /proc/self/maps data from profile1,
+    # which may differ from the data from subsequent profiles, especially
+    # if they were run on different machines.  Use appropriate libs for
+    # each pc somehow.
+    $symbols = ExtractSymbols($libs, $pcs);
+  }
+
+  if (!defined($main::opt_thread)) {
+    FilterAndPrint($profile, $symbols, $libs);
+  }
+  if (defined($data->{threads})) {
+    foreach my $thread (sort { $a <=> $b } keys(%{$data->{threads}})) {
+      if (defined($main::opt_thread) &&
+          ($main::opt_thread eq '*' || $main::opt_thread == $thread)) {
+        my $thread_profile = $data->{threads}{$thread};
+        FilterAndPrint($thread_profile, $symbols, $libs, $thread);
+      }
+    }
+  }
+
+  cleanup();
+  exit(0);
+}
+
+##### Entry Point #####
+
+Main();
+
+# Temporary code to detect if we're running on a Goobuntu system.
+# These systems don't have the right stuff installed for the special
+# Readline libraries to work, so as a temporary workaround, we default
+# to using the normal stdio code, rather than the fancier readline-based
+# code
+sub ReadlineMightFail {
+  if (-e '/lib/libtermcap.so.2') {
+    return 0;  # libtermcap exists, so readline should be okay
+  } else {
+    return 1;
+  }
+}
+
+sub RunGV {
+  my $fname = shift;
+  my $bg = shift;       # "" or " &" if we should run in background
+  if (!system(ShellEscape(@GV, "--version") . " >$dev_null 2>&1")) {
+    # Options using double dash are supported by this gv version.
+    # Also, turn on noantialias to better handle bug in gv for
+    # postscript files with large dimensions.
+    # TODO: Maybe we should not pass the --noantialias flag
+    # if the gv version is known to work properly without the flag.
+    system(ShellEscape(@GV, "--scale=$main::opt_scale", "--noantialias", $fname)
+           . $bg);
+  } else {
+    # Old gv version - only supports options that use single dash.
+    print STDERR ShellEscape(@GV, "-scale", $main::opt_scale) . "\n";
+    system(ShellEscape(@GV, "-scale", "$main::opt_scale", $fname) . $bg);
+  }
+}
+
+sub RunEvince {
+  my $fname = shift;
+  my $bg = shift;       # "" or " &" if we should run in background
+  system(ShellEscape(@EVINCE, $fname) . $bg);
+}
+
+sub RunWeb {
+  my $fname = shift;
+  print STDERR "Loading web page file:///$fname\n";
+
+  if (`uname` =~ /Darwin/) {
+    # OS X: open will use standard preference for SVG files.
+    system("/usr/bin/open", $fname);
+    return;
+  }
+
+  # Some kind of Unix; try generic symlinks, then specific browsers.
+  # (Stop once we find one.)
+  # Works best if the browser is already running.
+  my @alt = (
+    "/etc/alternatives/gnome-www-browser",
+    "/etc/alternatives/x-www-browser",
+    "google-chrome",
+    "firefox",
+  );
+  foreach my $b (@alt) {
+    if (system($b, $fname) == 0) {
+      return;
+    }
+  }
+
+  print STDERR "Could not load web browser.\n";
+}
+
+sub RunKcachegrind {
+  my $fname = shift;
+  my $bg = shift;       # "" or " &" if we should run in background
+  print STDERR "Starting '@KCACHEGRIND " . $fname . $bg . "'\n";
+  system(ShellEscape(@KCACHEGRIND, $fname) . $bg);
+}
+
+
+##### Interactive helper routines #####
+
+sub InteractiveMode {
+  $| = 1;  # Make output unbuffered for interactive mode
+  my ($orig_profile, $symbols, $libs, $total) = @_;
+
+  print STDERR "Welcome to jeprof!  For help, type 'help'.\n";
+
+  # Use ReadLine if it's installed and input comes from a console.
+  if ( -t STDIN &&
+       !ReadlineMightFail() &&
+       defined(eval {require Term::ReadLine}) ) {
+    my $term = new Term::ReadLine 'jeprof';
+    while ( defined ($_ = $term->readline('(jeprof) '))) {
+      $term->addhistory($_) if /\S/;
+      if (!InteractiveCommand($orig_profile, $symbols, $libs, $total, $_)) {
+        last;    # exit when we get an interactive command to quit
+      }
+    }
+  } else {       # don't have readline
+    while (1) {
+      print STDERR "(jeprof) ";
+      $_ = <STDIN>;
+      last if ! defined $_ ;
+      s/\r//g;         # turn windows-looking lines into unix-looking lines
+
+      # Save some flags that might be reset by InteractiveCommand()
+      my $save_opt_lines = $main::opt_lines;
+
+      if (!InteractiveCommand($orig_profile, $symbols, $libs, $total, $_)) {
+        last;    # exit when we get an interactive command to quit
+      }
+
+      # Restore flags
+      $main::opt_lines = $save_opt_lines;
+    }
+  }
+}
+
+# Takes two args: orig profile, and command to run.
+# Returns 1 if we should keep going, or 0 if we were asked to quit
+sub InteractiveCommand {
+  my($orig_profile, $symbols, $libs, $total, $command) = @_;
+  $_ = $command;                # just to make future m//'s easier
+  if (!defined($_)) {
+    print STDERR "\n";
+    return 0;
+  }
+  if (m/^\s*quit/) {
+    return 0;
+  }
+  if (m/^\s*help/) {
+    InteractiveHelpMessage();
+    return 1;
+  }
+  # Clear all the mode options -- mode is controlled by "$command"
+  $main::opt_text = 0;
+  $main::opt_callgrind = 0;
+  $main::opt_disasm = 0;
+  $main::opt_list = 0;
+  $main::opt_gv = 0;
+  $main::opt_evince = 0;
+  $main::opt_cum = 0;
+
+  if (m/^\s*(text|top)(\d*)\s*(.*)/) {
+    $main::opt_text = 1;
+
+    my $line_limit = ($2 ne "") ? int($2) : 10;
+
+    my $routine;
+    my $ignore;
+    ($routine, $ignore) = ParseInteractiveArgs($3);
+
+    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
+    my $reduced = ReduceProfile($symbols, $profile);
+
+    # Get derived profiles
+    my $flat = FlatProfile($reduced);
+    my $cumulative = CumulativeProfile($reduced);
+
+    PrintText($symbols, $flat, $cumulative, $line_limit);
+    return 1;
+  }
+  if (m/^\s*callgrind\s*([^ \n]*)/) {
+    $main::opt_callgrind = 1;
+
+    # Get derived profiles
+    my $calls = ExtractCalls($symbols, $orig_profile);
+    my $filename = $1;
+    if ( $1 eq '' ) {
+      $filename = TempName($main::next_tmpfile, "callgrind");
+    }
+    PrintCallgrind($calls, $filename);
+    if ( $1 eq '' ) {
+      RunKcachegrind($filename, " & ");
+      $main::next_tmpfile++;
+    }
+
+    return 1;
+  }
+  if (m/^\s*(web)?list\s*(.+)/) {
+    my $html = (defined($1) && ($1 eq "web"));
+    $main::opt_list = 1;
+
+    my $routine;
+    my $ignore;
+    ($routine, $ignore) = ParseInteractiveArgs($2);
+
+    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
+    my $reduced = ReduceProfile($symbols, $profile);
+
+    # Get derived profiles
+    my $flat = FlatProfile($reduced);
+    my $cumulative = CumulativeProfile($reduced);
+
+    PrintListing($total, $libs, $flat, $cumulative, $routine, $html);
+    return 1;
+  }
+  if (m/^\s*disasm\s*(.+)/) {
+    $main::opt_disasm = 1;
+
+    my $routine;
+    my $ignore;
+    ($routine, $ignore) = ParseInteractiveArgs($1);
+
+    # Process current profile to account for various settings
+    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
+    my $reduced = ReduceProfile($symbols, $profile);
+
+    # Get derived profiles
+    my $flat = FlatProfile($reduced);
+    my $cumulative = CumulativeProfile($reduced);
+
+    PrintDisassembly($libs, $flat, $cumulative, $routine);
+    return 1;
+  }
+  if (m/^\s*(gv|web|evince)\s*(.*)/) {
+    $main::opt_gv = 0;
+    $main::opt_evince = 0;
+    $main::opt_web = 0;
+    if ($1 eq "gv") {
+      $main::opt_gv = 1;
+    } elsif ($1 eq "evince") {
+      $main::opt_evince = 1;
+    } elsif ($1 eq "web") {
+      $main::opt_web = 1;
+    }
+
+    my $focus;
+    my $ignore;
+    ($focus, $ignore) = ParseInteractiveArgs($2);
+
+    # Process current profile to account for various settings
+    my $profile = ProcessProfile($total, $orig_profile, $symbols,
+                                 $focus, $ignore);
+    my $reduced = ReduceProfile($symbols, $profile);
+
+    # Get derived profiles
+    my $flat = FlatProfile($reduced);
+    my $cumulative = CumulativeProfile($reduced);
+
+    if (PrintDot($main::prog, $symbols, $profile, $flat, $cumulative, $total)) {
+      if ($main::opt_gv) {
+        RunGV(TempName($main::next_tmpfile, "ps"), " &");
+      } elsif ($main::opt_evince) {
+        RunEvince(TempName($main::next_tmpfile, "pdf"), " &");
+      } elsif ($main::opt_web) {
+        RunWeb(TempName($main::next_tmpfile, "svg"));
+      }
+      $main::next_tmpfile++;
+    }
+    return 1;
+  }
+  if (m/^\s*$/) {
+    return 1;
+  }
+  print STDERR "Unknown command: try 'help'.\n";
+  return 1;
+}
+
+
+sub ProcessProfile {
+  my $total_count = shift;
+  my $orig_profile = shift;
+  my $symbols = shift;
+  my $focus = shift;
+  my $ignore = shift;
+
+  # Process current profile to account for various settings
+  my $profile = $orig_profile;
+  printf("Total: %s %s\n", Unparse($total_count), Units());
+  if ($focus ne '') {
+    $profile = FocusProfile($symbols, $profile, $focus);
+    my $focus_count = TotalProfile($profile);
+    printf("After focusing on '%s': %s %s of %s (%0.1f%%)\n",
+           $focus,
+           Unparse($focus_count), Units(),
+           Unparse($total_count), ($focus_count*100.0) / $total_count);
+  }
+  if ($ignore ne '') {
+    $profile = IgnoreProfile($symbols, $profile, $ignore);
+    my $ignore_count = TotalProfile($profile);
+    printf("After ignoring '%s': %s %s of %s (%0.1f%%)\n",
+           $ignore,
+           Unparse($ignore_count), Units(),
+           Unparse($total_count),
+           ($ignore_count*100.0) / $total_count);
+  }
+
+  return $profile;
+}
+
+sub InteractiveHelpMessage {
+  print STDERR <<ENDOFHELP;
+Interactive jeprof mode
+
+Commands:
+  gv
+  gv [focus] [-ignore1] [-ignore2]
+      Show graphical hierarchical display of current profile.  Without
+      any arguments, shows all samples in the profile.  With the optional
+      "focus" argument, restricts the samples shown to just those where
+      the "focus" regular expression matches a routine name on the stack
+      trace.
+
+  web
+  web [focus] [-ignore1] [-ignore2]
+      Like GV, but displays profile in your web browser instead of using
+      Ghostview. Works best if your web browser is already running.
+      To change the browser that gets used:
+      On Linux, set the /etc/alternatives/gnome-www-browser symlink.
+      On OS X, change the Finder association for SVG files.
+
+  list [routine_regexp] [-ignore1] [-ignore2]
+      Show source listing of routines whose names match "routine_regexp"
+
+  weblist [routine_regexp] [-ignore1] [-ignore2]
+     Displays a source listing of routines whose names match "routine_regexp"
+     in a web browser.  You can click on source lines to view the
+     corresponding disassembly.
+
+  top [--cum] [-ignore1] [-ignore2]
+  top20 [--cum] [-ignore1] [-ignore2]
+  top37 [--cum] [-ignore1] [-ignore2]
+      Show top lines ordered by flat profile count, or cumulative count
+      if --cum is specified.  If a number is present after 'top', the
+      top K routines will be shown (defaults to showing the top 10)
+
+  disasm [routine_regexp] [-ignore1] [-ignore2]
+      Show disassembly of routines whose names match "routine_regexp",
+      annotated with sample counts.
+
+  callgrind
+  callgrind [filename]
+      Generates callgrind file. If no filename is given, kcachegrind is called.
+
+  help - This listing
+  quit or ^D - End jeprof
+
+For commands that accept optional -ignore tags, samples where any routine in
+the stack trace matches the regular expression in any of the -ignore
+parameters will be ignored.
+
+Further pprof details are available at this location (or one similar):
+
+ /usr/doc/gperftools-$PPROF_VERSION/cpu_profiler.html
+ /usr/doc/gperftools-$PPROF_VERSION/heap_profiler.html
+
+ENDOFHELP
+}
+sub ParseInteractiveArgs {
+  my $args = shift;
+  my $focus = "";
+  my $ignore = "";
+  my @x = split(/ +/, $args);
+  foreach $a (@x) {
+    if ($a =~ m/^(--|-)lines$/) {
+      $main::opt_lines = 1;
+    } elsif ($a =~ m/^(--|-)cum$/) {
+      $main::opt_cum = 1;
+    } elsif ($a =~ m/^-(.*)/) {
+      $ignore .= (($ignore ne "") ? "|" : "" ) . $1;
+    } else {
+      $focus .= (($focus ne "") ? "|" : "" ) . $a;
+    }
+  }
+  if ($ignore ne "") {
+    print STDERR "Ignoring samples in call stacks that match '$ignore'\n";
+  }
+  return ($focus, $ignore);
+}
+
+##### Output code #####
+
+sub TempName {
+  my $fnum = shift;
+  my $ext = shift;
+  my $file = "$main::tmpfile_ps.$fnum.$ext";
+  $main::tempnames{$file} = 1;
+  return $file;
+}
+
+# Print profile data in packed binary format (64-bit) to standard out
+sub PrintProfileData {
+  my $profile = shift;
+
+  # print header (64-bit style)
+  # (zero) (header-size) (version) (sample-period) (zero)
+  print pack('L*', 0, 0, 3, 0, 0, 0, 1, 0, 0, 0);
+
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    if ($#addrs >= 0) {
+      my $depth = $#addrs + 1;
+      # int(foo / 2**32) is the only reliable way to get rid of bottom
+      # 32 bits on both 32- and 64-bit systems.
+      print pack('L*', $count & 0xFFFFFFFF, int($count / 2**32));
+      print pack('L*', $depth & 0xFFFFFFFF, int($depth / 2**32));
+
+      foreach my $full_addr (@addrs) {
+        my $addr = $full_addr;
+        $addr =~ s/0x0*//;  # strip off leading 0x, zeroes
+        if (length($addr) > 16) {
+          print STDERR "Invalid address in profile: $full_addr\n";
+          next;
+        }
+        my $low_addr = substr($addr, -8);       # get last 8 hex chars
+        my $high_addr = substr($addr, -16, 8);  # get up to 8 more hex chars
+        print pack('L*', hex('0x' . $low_addr), hex('0x' . $high_addr));
+      }
+    }
+  }
+}
+
+# Print symbols and profile data
+sub PrintSymbolizedProfile {
+  my $symbols = shift;
+  my $profile = shift;
+  my $prog = shift;
+
+  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $symbol_marker = $&;
+
+  print '--- ', $symbol_marker, "\n";
+  if (defined($prog)) {
+    print 'binary=', $prog, "\n";
+  }
+  while (my ($pc, $name) = each(%{$symbols})) {
+    my $sep = ' ';
+    print '0x', $pc;
+    # We have a list of function names, which include the inlined
+    # calls.  They are separated (and terminated) by --, which is
+    # illegal in function names.
+    for (my $j = 2; $j <= $#{$name}; $j += 3) {
+      print $sep, $name->[$j];
+      $sep = '--';
+    }
+    print "\n";
+  }
+  print '---', "\n";
+
+  my $profile_marker;
+  if ($main::profile_type eq 'heap') {
+    $HEAP_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+    $profile_marker = $&;
+  } elsif ($main::profile_type eq 'growth') {
+    $GROWTH_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+    $profile_marker = $&;
+  } elsif ($main::profile_type eq 'contention') {
+    $CONTENTION_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+    $profile_marker = $&;
+  } else { # elsif ($main::profile_type eq 'cpu')
+    $PROFILE_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+    $profile_marker = $&;
+  }
+
+  print '--- ', $profile_marker, "\n";
+  if (defined($main::collected_profile)) {
+    # if used with remote fetch, simply dump the collected profile to output.
+    open(SRC, "<$main::collected_profile");
+    while (<SRC>) {
+      print $_;
+    }
+    close(SRC);
+  } else {
+    # --raw/http: For everything to work correctly for non-remote profiles, we
+    # would need to extend PrintProfileData() to handle all possible profile
+    # types, re-enable the code that is currently disabled in ReadCPUProfile()
+    # and FixCallerAddresses(), and remove the remote profile dumping code in
+    # the block above.
+    die "--raw/http: jeprof can only dump remote profiles for --raw\n";
+    # dump a cpu-format profile to standard out
+    PrintProfileData($profile);
+  }
+}
+
+# Print text output
+sub PrintText {
+  my $symbols = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $line_limit = shift;
+
+  my $total = TotalProfile($flat);
+
+  # Which profile to sort by?
+  my $s = $main::opt_cum ? $cumulative : $flat;
+
+  my $running_sum = 0;
+  my $lines = 0;
+  foreach my $k (sort { GetEntry($s, $b) <=> GetEntry($s, $a) || $a cmp $b }
+                 keys(%{$cumulative})) {
+    my $f = GetEntry($flat, $k);
+    my $c = GetEntry($cumulative, $k);
+    $running_sum += $f;
+
+    my $sym = $k;
+    if (exists($symbols->{$k})) {
+      $sym = $symbols->{$k}->[0] . " " . $symbols->{$k}->[1];
+      if ($main::opt_addresses) {
+        $sym = $k . " " . $sym;
+      }
+    }
+
+    if ($f != 0 || $c != 0) {
+      printf("%8s %6s %6s %8s %6s %s\n",
+             Unparse($f),
+             Percent($f, $total),
+             Percent($running_sum, $total),
+             Unparse($c),
+             Percent($c, $total),
+             $sym);
+    }
+    $lines++;
+    last if ($line_limit >= 0 && $lines >= $line_limit);
+  }
+}
+
+# Callgrind format has a compression for repeated function and file
+# names.  You show the name the first time, and just use its number
+# subsequently.  This can cut down the file to about a third or a
+# quarter of its uncompressed size.  $key and $val are the key/value
+# pair that would normally be printed by callgrind; $map is a map from
+# value to number.
+sub CompressedCGName {
+  my($key, $val, $map) = @_;
+  my $idx = $map->{$val};
+  # For very short keys, providing an index hurts rather than helps.
+  if (length($val) <= 3) {
+    return "$key=$val\n";
+  } elsif (defined($idx)) {
+    return "$key=($idx)\n";
+  } else {
+    # scalar(keys $map) gives the number of items in the map.
+    $idx = scalar(keys(%{$map})) + 1;
+    $map->{$val} = $idx;
+    return "$key=($idx) $val\n";
+  }
+}
+
+# Print the call graph in a way that's suiteable for callgrind.
+sub PrintCallgrind {
+  my $calls = shift;
+  my $filename;
+  my %filename_to_index_map;
+  my %fnname_to_index_map;
+
+  if ($main::opt_interactive) {
+    $filename = shift;
+    print STDERR "Writing callgrind file to '$filename'.\n"
+  } else {
+    $filename = "&STDOUT";
+  }
+  open(CG, ">$filename");
+  printf CG ("events: Hits\n\n");
+  foreach my $call ( map { $_->[0] }
+                     sort { $a->[1] cmp $b ->[1] ||
+                            $a->[2] <=> $b->[2] }
+                     map { /([^:]+):(\d+):([^ ]+)( -> ([^:]+):(\d+):(.+))?/;
+                           [$_, $1, $2] }
+                     keys %$calls ) {
+    my $count = int($calls->{$call});
+    $call =~ /([^:]+):(\d+):([^ ]+)( -> ([^:]+):(\d+):(.+))?/;
+    my ( $caller_file, $caller_line, $caller_function,
+         $callee_file, $callee_line, $callee_function ) =
+       ( $1, $2, $3, $5, $6, $7 );
+
+    # TODO(csilvers): for better compression, collect all the
+    # caller/callee_files and functions first, before printing
+    # anything, and only compress those referenced more than once.
+    printf CG CompressedCGName("fl", $caller_file, \%filename_to_index_map);
+    printf CG CompressedCGName("fn", $caller_function, \%fnname_to_index_map);
+    if (defined $6) {
+      printf CG CompressedCGName("cfl", $callee_file, \%filename_to_index_map);
+      printf CG CompressedCGName("cfn", $callee_function, \%fnname_to_index_map);
+      printf CG ("calls=$count $callee_line\n");
+    }
+    printf CG ("$caller_line $count\n\n");
+  }
+}
+
+# Print disassembly for all all routines that match $main::opt_disasm
+sub PrintDisassembly {
+  my $libs = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $disasm_opts = shift;
+
+  my $total = TotalProfile($flat);
+
+  foreach my $lib (@{$libs}) {
+    my $symbol_table = GetProcedureBoundaries($lib->[0], $disasm_opts);
+    my $offset = AddressSub($lib->[1], $lib->[3]);
+    foreach my $routine (sort ByName keys(%{$symbol_table})) {
+      my $start_addr = $symbol_table->{$routine}->[0];
+      my $end_addr = $symbol_table->{$routine}->[1];
+      # See if there are any samples in this routine
+      my $length = hex(AddressSub($end_addr, $start_addr));
+      my $addr = AddressAdd($start_addr, $offset);
+      for (my $i = 0; $i < $length; $i++) {
+        if (defined($cumulative->{$addr})) {
+          PrintDisassembledFunction($lib->[0], $offset,
+                                    $routine, $flat, $cumulative,
+                                    $start_addr, $end_addr, $total);
+          last;
+        }
+        $addr = AddressInc($addr);
+      }
+    }
+  }
+}
+
+# Return reference to array of tuples of the form:
+#       [start_address, filename, linenumber, instruction, limit_address]
+# E.g.,
+#       ["0x806c43d", "/foo/bar.cc", 131, "ret", "0x806c440"]
+sub Disassemble {
+  my $prog = shift;
+  my $offset = shift;
+  my $start_addr = shift;
+  my $end_addr = shift;
+
+  my $objdump = $obj_tool_map{"objdump"};
+  my $cmd = ShellEscape($objdump, "-C", "-d", "-l", "--no-show-raw-insn",
+                        "--start-address=0x$start_addr",
+                        "--stop-address=0x$end_addr", $prog);
+  open(OBJDUMP, "$cmd |") || error("$cmd: $!\n");
+  my @result = ();
+  my $filename = "";
+  my $linenumber = -1;
+  my $last = ["", "", "", ""];
+  while (<OBJDUMP>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    chop;
+    if (m|\s*([^:\s]+):(\d+)\s*$|) {
+      # Location line of the form:
+      #   <filename>:<linenumber>
+      $filename = $1;
+      $linenumber = $2;
+    } elsif (m/^ +([0-9a-f]+):\s*(.*)/) {
+      # Disassembly line -- zero-extend address to full length
+      my $addr = HexExtend($1);
+      my $k = AddressAdd($addr, $offset);
+      $last->[4] = $k;   # Store ending address for previous instruction
+      $last = [$k, $filename, $linenumber, $2, $end_addr];
+      push(@result, $last);
+    }
+  }
+  close(OBJDUMP);
+  return @result;
+}
+
+# The input file should contain lines of the form /proc/maps-like
+# output (same format as expected from the profiles) or that looks
+# like hex addresses (like "0xDEADBEEF").  We will parse all
+# /proc/maps output, and for all the hex addresses, we will output
+# "short" symbol names, one per line, in the same order as the input.
+sub PrintSymbols {
+  my $maps_and_symbols_file = shift;
+
+  # ParseLibraries expects pcs to be in a set.  Fine by us...
+  my @pclist = ();   # pcs in sorted order
+  my $pcs = {};
+  my $map = "";
+  foreach my $line (<$maps_and_symbols_file>) {
+    $line =~ s/\r//g;    # turn windows-looking lines into unix-looking lines
+    if ($line =~ /\b(0x[0-9a-f]+)\b/i) {
+      push(@pclist, HexExtend($1));
+      $pcs->{$pclist[-1]} = 1;
+    } else {
+      $map .= $line;
+    }
+  }
+
+  my $libs = ParseLibraries($main::prog, $map, $pcs);
+  my $symbols = ExtractSymbols($libs, $pcs);
+
+  foreach my $pc (@pclist) {
+    # ->[0] is the shortname, ->[2] is the full name
+    print(($symbols->{$pc}->[0] || "??") . "\n");
+  }
+}
+
+
+# For sorting functions by name
+sub ByName {
+  return ShortFunctionName($a) cmp ShortFunctionName($b);
+}
+
+# Print source-listing for all all routines that match $list_opts
+sub PrintListing {
+  my $total = shift;
+  my $libs = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $list_opts = shift;
+  my $html = shift;
+
+  my $output = \*STDOUT;
+  my $fname = "";
+
+  if ($html) {
+    # Arrange to write the output to a temporary file
+    $fname = TempName($main::next_tmpfile, "html");
+    $main::next_tmpfile++;
+    if (!open(TEMP, ">$fname")) {
+      print STDERR "$fname: $!\n";
+      return;
+    }
+    $output = \*TEMP;
+    print $output HtmlListingHeader();
+    printf $output ("<div class=\"legend\">%s<br>Total: %s %s</div>\n",
+                    $main::prog, Unparse($total), Units());
+  }
+
+  my $listed = 0;
+  foreach my $lib (@{$libs}) {
+    my $symbol_table = GetProcedureBoundaries($lib->[0], $list_opts);
+    my $offset = AddressSub($lib->[1], $lib->[3]);
+    foreach my $routine (sort ByName keys(%{$symbol_table})) {
+      # Print if there are any samples in this routine
+      my $start_addr = $symbol_table->{$routine}->[0];
+      my $end_addr = $symbol_table->{$routine}->[1];
+      my $length = hex(AddressSub($end_addr, $start_addr));
+      my $addr = AddressAdd($start_addr, $offset);
+      for (my $i = 0; $i < $length; $i++) {
+        if (defined($cumulative->{$addr})) {
+          $listed += PrintSource(
+            $lib->[0], $offset,
+            $routine, $flat, $cumulative,
+            $start_addr, $end_addr,
+            $html,
+            $output);
+          last;
+        }
+        $addr = AddressInc($addr);
+      }
+    }
+  }
+
+  if ($html) {
+    if ($listed > 0) {
+      print $output HtmlListingFooter();
+      close($output);
+      RunWeb($fname);
+    } else {
+      close($output);
+      unlink($fname);
+    }
+  }
+}
+
+sub HtmlListingHeader {
+  return <<'EOF';
+<DOCTYPE html>
+<html>
+<head>
+<title>Pprof listing</title>
+<style type="text/css">
+body {
+  font-family: sans-serif;
+}
+h1 {
+  font-size: 1.5em;
+  margin-bottom: 4px;
+}
+.legend {
+  font-size: 1.25em;
+}
+.line {
+  color: #aaaaaa;
+}
+.nop {
+  color: #aaaaaa;
+}
+.unimportant {
+  color: #cccccc;
+}
+.disasmloc {
+  color: #000000;
+}
+.deadsrc {
+  cursor: pointer;
+}
+.deadsrc:hover {
+  background-color: #eeeeee;
+}
+.livesrc {
+  color: #0000ff;
+  cursor: pointer;
+}
+.livesrc:hover {
+  background-color: #eeeeee;
+}
+.asm {
+  color: #008800;
+  display: none;
+}
+</style>
+<script type="text/javascript">
+function jeprof_toggle_asm(e) {
+  var target;
+  if (!e) e = window.event;
+  if (e.target) target = e.target;
+  else if (e.srcElement) target = e.srcElement;
+
+  if (target) {
+    var asm = target.nextSibling;
+    if (asm && asm.className == "asm") {
+      asm.style.display = (asm.style.display == "block" ? "" : "block");
+      e.preventDefault();
+      return false;
+    }
+  }
+}
+</script>
+</head>
+<body>
+EOF
+}
+
+sub HtmlListingFooter {
+  return <<'EOF';
+</body>
+</html>
+EOF
+}
+
+sub HtmlEscape {
+  my $text = shift;
+  $text =~ s/&/&amp;/g;
+  $text =~ s/</&lt;/g;
+  $text =~ s/>/&gt;/g;
+  return $text;
+}
+
+# Returns the indentation of the line, if it has any non-whitespace
+# characters.  Otherwise, returns -1.
+sub Indentation {
+  my $line = shift;
+  if (m/^(\s*)\S/) {
+    return length($1);
+  } else {
+    return -1;
+  }
+}
+
+# If the symbol table contains inlining info, Disassemble() may tag an
+# instruction with a location inside an inlined function.  But for
+# source listings, we prefer to use the location in the function we
+# are listing.  So use MapToSymbols() to fetch full location
+# information for each instruction and then pick out the first
+# location from a location list (location list contains callers before
+# callees in case of inlining).
+#
+# After this routine has run, each entry in $instructions contains:
+#   [0] start address
+#   [1] filename for function we are listing
+#   [2] line number for function we are listing
+#   [3] disassembly
+#   [4] limit address
+#   [5] most specific filename (may be different from [1] due to inlining)
+#   [6] most specific line number (may be different from [2] due to inlining)
+sub GetTopLevelLineNumbers {
+  my ($lib, $offset, $instructions) = @_;
+  my $pcs = [];
+  for (my $i = 0; $i <= $#{$instructions}; $i++) {
+    push(@{$pcs}, $instructions->[$i]->[0]);
+  }
+  my $symbols = {};
+  MapToSymbols($lib, $offset, $pcs, $symbols);
+  for (my $i = 0; $i <= $#{$instructions}; $i++) {
+    my $e = $instructions->[$i];
+    push(@{$e}, $e->[1]);
+    push(@{$e}, $e->[2]);
+    my $addr = $e->[0];
+    my $sym = $symbols->{$addr};
+    if (defined($sym)) {
+      if ($#{$sym} >= 2 && $sym->[1] =~ m/^(.*):(\d+)$/) {
+        $e->[1] = $1;  # File name
+        $e->[2] = $2;  # Line number
+      }
+    }
+  }
+}
+
+# Print source-listing for one routine
+sub PrintSource {
+  my $prog = shift;
+  my $offset = shift;
+  my $routine = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $start_addr = shift;
+  my $end_addr = shift;
+  my $html = shift;
+  my $output = shift;
+
+  # Disassemble all instructions (just to get line numbers)
+  my @instructions = Disassemble($prog, $offset, $start_addr, $end_addr);
+  GetTopLevelLineNumbers($prog, $offset, \@instructions);
+
+  # Hack 1: assume that the first source file encountered in the
+  # disassembly contains the routine
+  my $filename = undef;
+  for (my $i = 0; $i <= $#instructions; $i++) {
+    if ($instructions[$i]->[2] >= 0) {
+      $filename = $instructions[$i]->[1];
+      last;
+    }
+  }
+  if (!defined($filename)) {
+    print STDERR "no filename found in $routine\n";
+    return 0;
+  }
+
+  # Hack 2: assume that the largest line number from $filename is the
+  # end of the procedure.  This is typically safe since if P1 contains
+  # an inlined call to P2, then P2 usually occurs earlier in the
+  # source file.  If this does not work, we might have to compute a
+  # density profile or just print all regions we find.
+  my $lastline = 0;
+  for (my $i = 0; $i <= $#instructions; $i++) {
+    my $f = $instructions[$i]->[1];
+    my $l = $instructions[$i]->[2];
+    if (($f eq $filename) && ($l > $lastline)) {
+      $lastline = $l;
+    }
+  }
+
+  # Hack 3: assume the first source location from "filename" is the start of
+  # the source code.
+  my $firstline = 1;
+  for (my $i = 0; $i <= $#instructions; $i++) {
+    if ($instructions[$i]->[1] eq $filename) {
+      $firstline = $instructions[$i]->[2];
+      last;
+    }
+  }
+
+  # Hack 4: Extend last line forward until its indentation is less than
+  # the indentation we saw on $firstline
+  my $oldlastline = $lastline;
+  {
+    if (!open(FILE, "<$filename")) {
+      print STDERR "$filename: $!\n";
+      return 0;
+    }
+    my $l = 0;
+    my $first_indentation = -1;
+    while (<FILE>) {
+      s/\r//g;         # turn windows-looking lines into unix-looking lines
+      $l++;
+      my $indent = Indentation($_);
+      if ($l >= $firstline) {
+        if ($first_indentation < 0 && $indent >= 0) {
+          $first_indentation = $indent;
+          last if ($first_indentation == 0);
+        }
+      }
+      if ($l >= $lastline && $indent >= 0) {
+        if ($indent >= $first_indentation) {
+          $lastline = $l+1;
+        } else {
+          last;
+        }
+      }
+    }
+    close(FILE);
+  }
+
+  # Assign all samples to the range $firstline,$lastline,
+  # Hack 4: If an instruction does not occur in the range, its samples
+  # are moved to the next instruction that occurs in the range.
+  my $samples1 = {};        # Map from line number to flat count
+  my $samples2 = {};        # Map from line number to cumulative count
+  my $running1 = 0;         # Unassigned flat counts
+  my $running2 = 0;         # Unassigned cumulative counts
+  my $total1 = 0;           # Total flat counts
+  my $total2 = 0;           # Total cumulative counts
+  my %disasm = ();          # Map from line number to disassembly
+  my $running_disasm = "";  # Unassigned disassembly
+  my $skip_marker = "---\n";
+  if ($html) {
+    $skip_marker = "";
+    for (my $l = $firstline; $l <= $lastline; $l++) {
+      $disasm{$l} = "";
+    }
+  }
+  my $last_dis_filename = '';
+  my $last_dis_linenum = -1;
+  my $last_touched_line = -1;  # To detect gaps in disassembly for a line
+  foreach my $e (@instructions) {
+    # Add up counts for all address that fall inside this instruction
+    my $c1 = 0;
+    my $c2 = 0;
+    for (my $a = $e->[0]; $a lt $e->[4]; $a = AddressInc($a)) {
+      $c1 += GetEntry($flat, $a);
+      $c2 += GetEntry($cumulative, $a);
+    }
+
+    if ($html) {
+      my $dis = sprintf("      %6s %6s \t\t%8s: %s ",
+                        HtmlPrintNumber($c1),
+                        HtmlPrintNumber($c2),
+                        UnparseAddress($offset, $e->[0]),
+                        CleanDisassembly($e->[3]));
+
+      # Append the most specific source line associated with this instruction
+      if (length($dis) < 80) { $dis .= (' ' x (80 - length($dis))) };
+      $dis = HtmlEscape($dis);
+      my $f = $e->[5];
+      my $l = $e->[6];
+      if ($f ne $last_dis_filename) {
+        $dis .= sprintf("<span class=disasmloc>%s:%d</span>",
+                        HtmlEscape(CleanFileName($f)), $l);
+      } elsif ($l ne $last_dis_linenum) {
+        # De-emphasize the unchanged file name portion
+        $dis .= sprintf("<span class=unimportant>%s</span>" .
+                        "<span class=disasmloc>:%d</span>",
+                        HtmlEscape(CleanFileName($f)), $l);
+      } else {
+        # De-emphasize the entire location
+        $dis .= sprintf("<span class=unimportant>%s:%d</span>",
+                        HtmlEscape(CleanFileName($f)), $l);
+      }
+      $last_dis_filename = $f;
+      $last_dis_linenum = $l;
+      $running_disasm .= $dis;
+      $running_disasm .= "\n";
+    }
+
+    $running1 += $c1;
+    $running2 += $c2;
+    $total1 += $c1;
+    $total2 += $c2;
+    my $file = $e->[1];
+    my $line = $e->[2];
+    if (($file eq $filename) &&
+        ($line >= $firstline) &&
+        ($line <= $lastline)) {
+      # Assign all accumulated samples to this line
+      AddEntry($samples1, $line, $running1);
+      AddEntry($samples2, $line, $running2);
+      $running1 = 0;
+      $running2 = 0;
+      if ($html) {
+        if ($line != $last_touched_line && $disasm{$line} ne '') {
+          $disasm{$line} .= "\n";
+        }
+        $disasm{$line} .= $running_disasm;
+        $running_disasm = '';
+        $last_touched_line = $line;
+      }
+    }
+  }
+
+  # Assign any leftover samples to $lastline
+  AddEntry($samples1, $lastline, $running1);
+  AddEntry($samples2, $lastline, $running2);
+  if ($html) {
+    if ($lastline != $last_touched_line && $disasm{$lastline} ne '') {
+      $disasm{$lastline} .= "\n";
+    }
+    $disasm{$lastline} .= $running_disasm;
+  }
+
+  if ($html) {
+    printf $output (
+      "<h1>%s</h1>%s\n<pre onClick=\"jeprof_toggle_asm()\">\n" .
+      "Total:%6s %6s (flat / cumulative %s)\n",
+      HtmlEscape(ShortFunctionName($routine)),
+      HtmlEscape(CleanFileName($filename)),
+      Unparse($total1),
+      Unparse($total2),
+      Units());
+  } else {
+    printf $output (
+      "ROUTINE ====================== %s in %s\n" .
+      "%6s %6s Total %s (flat / cumulative)\n",
+      ShortFunctionName($routine),
+      CleanFileName($filename),
+      Unparse($total1),
+      Unparse($total2),
+      Units());
+  }
+  if (!open(FILE, "<$filename")) {
+    print STDERR "$filename: $!\n";
+    return 0;
+  }
+  my $l = 0;
+  while (<FILE>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    $l++;
+    if ($l >= $firstline - 5 &&
+        (($l <= $oldlastline + 5) || ($l <= $lastline))) {
+      chop;
+      my $text = $_;
+      if ($l == $firstline) { print $output $skip_marker; }
+      my $n1 = GetEntry($samples1, $l);
+      my $n2 = GetEntry($samples2, $l);
+      if ($html) {
+        # Emit a span that has one of the following classes:
+        #    livesrc -- has samples
+        #    deadsrc -- has disassembly, but with no samples
+        #    nop     -- has no matching disasembly
+        # Also emit an optional span containing disassembly.
+        my $dis = $disasm{$l};
+        my $asm = "";
+        if (defined($dis) && $dis ne '') {
+          $asm = "<span class=\"asm\">" . $dis . "</span>";
+        }
+        my $source_class = (($n1 + $n2 > 0)
+                            ? "livesrc"
+                            : (($asm ne "") ? "deadsrc" : "nop"));
+        printf $output (
+          "<span class=\"line\">%5d</span> " .
+          "<span class=\"%s\">%6s %6s %s</span>%s\n",
+          $l, $source_class,
+          HtmlPrintNumber($n1),
+          HtmlPrintNumber($n2),
+          HtmlEscape($text),
+          $asm);
+      } else {
+        printf $output(
+          "%6s %6s %4d: %s\n",
+          UnparseAlt($n1),
+          UnparseAlt($n2),
+          $l,
+          $text);
+      }
+      if ($l == $lastline)  { print $output $skip_marker; }
+    };
+  }
+  close(FILE);
+  if ($html) {
+    print $output "</pre>\n";
+  }
+  return 1;
+}
+
+# Return the source line for the specified file/linenumber.
+# Returns undef if not found.
+sub SourceLine {
+  my $file = shift;
+  my $line = shift;
+
+  # Look in cache
+  if (!defined($main::source_cache{$file})) {
+    if (100 < scalar keys(%main::source_cache)) {
+      # Clear the cache when it gets too big
+      $main::source_cache = ();
+    }
+
+    # Read all lines from the file
+    if (!open(FILE, "<$file")) {
+      print STDERR "$file: $!\n";
+      $main::source_cache{$file} = [];  # Cache the negative result
+      return undef;
+    }
+    my $lines = [];
+    push(@{$lines}, "");        # So we can use 1-based line numbers as indices
+    while (<FILE>) {
+      push(@{$lines}, $_);
+    }
+    close(FILE);
+
+    # Save the lines in the cache
+    $main::source_cache{$file} = $lines;
+  }
+
+  my $lines = $main::source_cache{$file};
+  if (($line < 0) || ($line > $#{$lines})) {
+    return undef;
+  } else {
+    return $lines->[$line];
+  }
+}
+
+# Print disassembly for one routine with interspersed source if available
+sub PrintDisassembledFunction {
+  my $prog = shift;
+  my $offset = shift;
+  my $routine = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $start_addr = shift;
+  my $end_addr = shift;
+  my $total = shift;
+
+  # Disassemble all instructions
+  my @instructions = Disassemble($prog, $offset, $start_addr, $end_addr);
+
+  # Make array of counts per instruction
+  my @flat_count = ();
+  my @cum_count = ();
+  my $flat_total = 0;
+  my $cum_total = 0;
+  foreach my $e (@instructions) {
+    # Add up counts for all address that fall inside this instruction
+    my $c1 = 0;
+    my $c2 = 0;
+    for (my $a = $e->[0]; $a lt $e->[4]; $a = AddressInc($a)) {
+      $c1 += GetEntry($flat, $a);
+      $c2 += GetEntry($cumulative, $a);
+    }
+    push(@flat_count, $c1);
+    push(@cum_count, $c2);
+    $flat_total += $c1;
+    $cum_total += $c2;
+  }
+
+  # Print header with total counts
+  printf("ROUTINE ====================== %s\n" .
+         "%6s %6s %s (flat, cumulative) %.1f%% of total\n",
+         ShortFunctionName($routine),
+         Unparse($flat_total),
+         Unparse($cum_total),
+         Units(),
+         ($cum_total * 100.0) / $total);
+
+  # Process instructions in order
+  my $current_file = "";
+  for (my $i = 0; $i <= $#instructions; ) {
+    my $e = $instructions[$i];
+
+    # Print the new file name whenever we switch files
+    if ($e->[1] ne $current_file) {
+      $current_file = $e->[1];
+      my $fname = $current_file;
+      $fname =~ s|^\./||;   # Trim leading "./"
+
+      # Shorten long file names
+      if (length($fname) >= 58) {
+        $fname = "..." . substr($fname, -55);
+      }
+      printf("-------------------- %s\n", $fname);
+    }
+
+    # TODO: Compute range of lines to print together to deal with
+    # small reorderings.
+    my $first_line = $e->[2];
+    my $last_line = $first_line;
+    my %flat_sum = ();
+    my %cum_sum = ();
+    for (my $l = $first_line; $l <= $last_line; $l++) {
+      $flat_sum{$l} = 0;
+      $cum_sum{$l} = 0;
+    }
+
+    # Find run of instructions for this range of source lines
+    my $first_inst = $i;
+    while (($i <= $#instructions) &&
+           ($instructions[$i]->[2] >= $first_line) &&
+           ($instructions[$i]->[2] <= $last_line)) {
+      $e = $instructions[$i];
+      $flat_sum{$e->[2]} += $flat_count[$i];
+      $cum_sum{$e->[2]} += $cum_count[$i];
+      $i++;
+    }
+    my $last_inst = $i - 1;
+
+    # Print source lines
+    for (my $l = $first_line; $l <= $last_line; $l++) {
+      my $line = SourceLine($current_file, $l);
+      if (!defined($line)) {
+        $line = "?\n";
+        next;
+      } else {
+        $line =~ s/^\s+//;
+      }
+      printf("%6s %6s %5d: %s",
+             UnparseAlt($flat_sum{$l}),
+             UnparseAlt($cum_sum{$l}),
+             $l,
+             $line);
+    }
+
+    # Print disassembly
+    for (my $x = $first_inst; $x <= $last_inst; $x++) {
+      my $e = $instructions[$x];
+      printf("%6s %6s    %8s: %6s\n",
+             UnparseAlt($flat_count[$x]),
+             UnparseAlt($cum_count[$x]),
+             UnparseAddress($offset, $e->[0]),
+             CleanDisassembly($e->[3]));
+    }
+  }
+}
+
+# Print DOT graph
+sub PrintDot {
+  my $prog = shift;
+  my $symbols = shift;
+  my $raw = shift;
+  my $flat = shift;
+  my $cumulative = shift;
+  my $overall_total = shift;
+
+  # Get total
+  my $local_total = TotalProfile($flat);
+  my $nodelimit = int($main::opt_nodefraction * $local_total);
+  my $edgelimit = int($main::opt_edgefraction * $local_total);
+  my $nodecount = $main::opt_nodecount;
+
+  # Find nodes to include
+  my @list = (sort { abs(GetEntry($cumulative, $b)) <=>
+                     abs(GetEntry($cumulative, $a))
+                     || $a cmp $b }
+              keys(%{$cumulative}));
+  my $last = $nodecount - 1;
+  if ($last > $#list) {
+    $last = $#list;
+  }
+  while (($last >= 0) &&
+         (abs(GetEntry($cumulative, $list[$last])) <= $nodelimit)) {
+    $last--;
+  }
+  if ($last < 0) {
+    print STDERR "No nodes to print\n";
+    return 0;
+  }
+
+  if ($nodelimit > 0 || $edgelimit > 0) {
+    printf STDERR ("Dropping nodes with <= %s %s; edges with <= %s abs(%s)\n",
+                   Unparse($nodelimit), Units(),
+                   Unparse($edgelimit), Units());
+  }
+
+  # Open DOT output file
+  my $output;
+  my $escaped_dot = ShellEscape(@DOT);
+  my $escaped_ps2pdf = ShellEscape(@PS2PDF);
+  if ($main::opt_gv) {
+    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "ps"));
+    $output = "| $escaped_dot -Tps2 >$escaped_outfile";
+  } elsif ($main::opt_evince) {
+    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "pdf"));
+    $output = "| $escaped_dot -Tps2 | $escaped_ps2pdf - $escaped_outfile";
+  } elsif ($main::opt_ps) {
+    $output = "| $escaped_dot -Tps2";
+  } elsif ($main::opt_pdf) {
+    $output = "| $escaped_dot -Tps2 | $escaped_ps2pdf - -";
+  } elsif ($main::opt_web || $main::opt_svg) {
+    # We need to post-process the SVG, so write to a temporary file always.
+    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "svg"));
+    $output = "| $escaped_dot -Tsvg >$escaped_outfile";
+  } elsif ($main::opt_gif) {
+    $output = "| $escaped_dot -Tgif";
+  } else {
+    $output = ">&STDOUT";
+  }
+  open(DOT, $output) || error("$output: $!\n");
+
+  # Title
+  printf DOT ("digraph \"%s; %s %s\" {\n",
+              $prog,
+              Unparse($overall_total),
+              Units());
+  if ($main::opt_pdf) {
+    # The output is more printable if we set the page size for dot.
+    printf DOT ("size=\"8,11\"\n");
+  }
+  printf DOT ("node [width=0.375,height=0.25];\n");
+
+  # Print legend
+  printf DOT ("Legend [shape=box,fontsize=24,shape=plaintext," .
+              "label=\"%s\\l%s\\l%s\\l%s\\l%s\\l\"];\n",
+              $prog,
+              sprintf("Total %s: %s", Units(), Unparse($overall_total)),
+              sprintf("Focusing on: %s", Unparse($local_total)),
+              sprintf("Dropped nodes with <= %s abs(%s)",
+                      Unparse($nodelimit), Units()),
+              sprintf("Dropped edges with <= %s %s",
+                      Unparse($edgelimit), Units())
+              );
+
+  # Print nodes
+  my %node = ();
+  my $nextnode = 1;
+  foreach my $a (@list[0..$last]) {
+    # Pick font size
+    my $f = GetEntry($flat, $a);
+    my $c = GetEntry($cumulative, $a);
+
+    my $fs = 8;
+    if ($local_total > 0) {
+      $fs = 8 + (50.0 * sqrt(abs($f * 1.0 / $local_total)));
+    }
+
+    $node{$a} = $nextnode++;
+    my $sym = $a;
+    $sym =~ s/\s+/\\n/g;
+    $sym =~ s/::/\\n/g;
+
+    # Extra cumulative info to print for non-leaves
+    my $extra = "";
+    if ($f != $c) {
+      $extra = sprintf("\\rof %s (%s)",
+                       Unparse($c),
+                       Percent($c, $local_total));
+    }
+    my $style = "";
+    if ($main::opt_heapcheck) {
+      if ($f > 0) {
+        # make leak-causing nodes more visible (add a background)
+        $style = ",style=filled,fillcolor=gray"
+      } elsif ($f < 0) {
+        # make anti-leak-causing nodes (which almost never occur)
+        # stand out as well (triple border)
+        $style = ",peripheries=3"
+      }
+    }
+
+    printf DOT ("N%d [label=\"%s\\n%s (%s)%s\\r" .
+                "\",shape=box,fontsize=%.1f%s];\n",
+                $node{$a},
+                $sym,
+                Unparse($f),
+                Percent($f, $local_total),
+                $extra,
+                $fs,
+                $style,
+               );
+  }
+
+  # Get edges and counts per edge
+  my %edge = ();
+  my $n;
+  my $fullname_to_shortname_map = {};
+  FillFullnameToShortnameMap($symbols, $fullname_to_shortname_map);
+  foreach my $k (keys(%{$raw})) {
+    # TODO: omit low %age edges
+    $n = $raw->{$k};
+    my @translated = TranslateStack($symbols, $fullname_to_shortname_map, $k);
+    for (my $i = 1; $i <= $#translated; $i++) {
+      my $src = $translated[$i];
+      my $dst = $translated[$i-1];
+      #next if ($src eq $dst);  # Avoid self-edges?
+      if (exists($node{$src}) && exists($node{$dst})) {
+        my $edge_label = "$src\001$dst";
+        if (!exists($edge{$edge_label})) {
+          $edge{$edge_label} = 0;
+        }
+        $edge{$edge_label} += $n;
+      }
+    }
+  }
+
+  # Print edges (process in order of decreasing counts)
+  my %indegree = ();   # Number of incoming edges added per node so far
+  my %outdegree = ();  # Number of outgoing edges added per node so far
+  foreach my $e (sort { $edge{$b} <=> $edge{$a} } keys(%edge)) {
+    my @x = split(/\001/, $e);
+    $n = $edge{$e};
+
+    # Initialize degree of kept incoming and outgoing edges if necessary
+    my $src = $x[0];
+    my $dst = $x[1];
+    if (!exists($outdegree{$src})) { $outdegree{$src} = 0; }
+    if (!exists($indegree{$dst})) { $indegree{$dst} = 0; }
+
+    my $keep;
+    if ($indegree{$dst} == 0) {
+      # Keep edge if needed for reachability
+      $keep = 1;
+    } elsif (abs($n) <= $edgelimit) {
+      # Drop if we are below --edgefraction
+      $keep = 0;
+    } elsif ($outdegree{$src} >= $main::opt_maxdegree ||
+             $indegree{$dst} >= $main::opt_maxdegree) {
+      # Keep limited number of in/out edges per node
+      $keep = 0;
+    } else {
+      $keep = 1;
+    }
+
+    if ($keep) {
+      $outdegree{$src}++;
+      $indegree{$dst}++;
+
+      # Compute line width based on edge count
+      my $fraction = abs($local_total ? (3 * ($n / $local_total)) : 0);
+      if ($fraction > 1) { $fraction = 1; }
+      my $w = $fraction * 2;
+      if ($w < 1 && ($main::opt_web || $main::opt_svg)) {
+        # SVG output treats line widths < 1 poorly.
+        $w = 1;
+      }
+
+      # Dot sometimes segfaults if given edge weights that are too large, so
+      # we cap the weights at a large value
+      my $edgeweight = abs($n) ** 0.7;
+      if ($edgeweight > 100000) { $edgeweight = 100000; }
+      $edgeweight = int($edgeweight);
+
+      my $style = sprintf("setlinewidth(%f)", $w);
+      if ($x[1] =~ m/\(inline\)/) {
+        $style .= ",dashed";
+      }
+
+      # Use a slightly squashed function of the edge count as the weight
+      printf DOT ("N%s -> N%s [label=%s, weight=%d, style=\"%s\"];\n",
+                  $node{$x[0]},
+                  $node{$x[1]},
+                  Unparse($n),
+                  $edgeweight,
+                  $style);
+    }
+  }
+
+  print DOT ("}\n");
+  close(DOT);
+
+  if ($main::opt_web || $main::opt_svg) {
+    # Rewrite SVG to be more usable inside web browser.
+    RewriteSvg(TempName($main::next_tmpfile, "svg"));
+  }
+
+  return 1;
+}
+
+sub RewriteSvg {
+  my $svgfile = shift;
+
+  open(SVG, $svgfile) || die "open temp svg: $!";
+  my @svg = <SVG>;
+  close(SVG);
+  unlink $svgfile;
+  my $svg = join('', @svg);
+
+  # Dot's SVG output is
+  #
+  #    <svg width="___" height="___"
+  #     viewBox="___" xmlns=...>
+  #    <g id="graph0" transform="...">
+  #    ...
+  #    </g>
+  #    </svg>
+  #
+  # Change it to
+  #
+  #    <svg width="100%" height="100%"
+  #     xmlns=...>
+  #    $svg_javascript
+  #    <g id="viewport" transform="translate(0,0)">
+  #    <g id="graph0" transform="...">
+  #    ...
+  #    </g>
+  #    </g>
+  #    </svg>
+
+  # Fix width, height; drop viewBox.
+  $svg =~ s/(?s)<svg width="[^"]+" height="[^"]+"(.*?)viewBox="[^"]+"/<svg width="100%" height="100%"$1/;
+
+  # Insert script, viewport <g> above first <g>
+  my $svg_javascript = SvgJavascript();
+  my $viewport = "<g id=\"viewport\" transform=\"translate(0,0)\">\n";
+  $svg =~ s/<g id="graph\d"/$svg_javascript$viewport$&/;
+
+  # Insert final </g> above </svg>.
+  $svg =~ s/(.*)(<\/svg>)/$1<\/g>$2/;
+  $svg =~ s/<g id="graph\d"(.*?)/<g id="viewport"$1/;
+
+  if ($main::opt_svg) {
+    # --svg: write to standard output.
+    print $svg;
+  } else {
+    # Write back to temporary file.
+    open(SVG, ">$svgfile") || die "open $svgfile: $!";
+    print SVG $svg;
+    close(SVG);
+  }
+}
+
+sub SvgJavascript {
+  return <<'EOF';
+<script type="text/ecmascript"><![CDATA[
+// SVGPan
+// http://www.cyberz.org/blog/2009/12/08/svgpan-a-javascript-svg-panzoomdrag-library/
+// Local modification: if(true || ...) below to force panning, never moving.
+
+/**
+ *  SVGPan library 1.2
+ * ====================
+ *
+ * Given an unique existing element with id "viewport", including the
+ * the library into any SVG adds the following capabilities:
+ *
+ *  - Mouse panning
+ *  - Mouse zooming (using the wheel)
+ *  - Object dargging
+ *
+ * Known issues:
+ *
+ *  - Zooming (while panning) on Safari has still some issues
+ *
+ * Releases:
+ *
+ * 1.2, Sat Mar 20 08:42:50 GMT 2010, Zeng Xiaohui
+ *	Fixed a bug with browser mouse handler interaction
+ *
+ * 1.1, Wed Feb  3 17:39:33 GMT 2010, Zeng Xiaohui
+ *	Updated the zoom code to support the mouse wheel on Safari/Chrome
+ *
+ * 1.0, Andrea Leofreddi
+ *	First release
+ *
+ * This code is licensed under the following BSD license:
+ *
+ * Copyright 2009-2010 Andrea Leofreddi <a.leofreddi@itcharm.com>. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ *
+ *    1. Redistributions of source code must retain the above copyright notice, this list of
+ *       conditions and the following disclaimer.
+ *
+ *    2. Redistributions in binary form must reproduce the above copyright notice, this list
+ *       of conditions and the following disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY Andrea Leofreddi ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Andrea Leofreddi OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * The views and conclusions contained in the software and documentation are those of the
+ * authors and should not be interpreted as representing official policies, either expressed
+ * or implied, of Andrea Leofreddi.
+ */
+
+var root = document.documentElement;
+
+var state = 'none', stateTarget, stateOrigin, stateTf;
+
+setupHandlers(root);
+
+/**
+ * Register handlers
+ */
+function setupHandlers(root){
+	setAttributes(root, {
+		"onmouseup" : "add(evt)",
+		"onmousedown" : "handleMouseDown(evt)",
+		"onmousemove" : "handleMouseMove(evt)",
+		"onmouseup" : "handleMouseUp(evt)",
+		//"onmouseout" : "handleMouseUp(evt)", // Decomment this to stop the pan functionality when dragging out of the SVG element
+	});
+
+	if(navigator.userAgent.toLowerCase().indexOf('webkit') >= 0)
+		window.addEventListener('mousewheel', handleMouseWheel, false); // Chrome/Safari
+	else
+		window.addEventListener('DOMMouseScroll', handleMouseWheel, false); // Others
+
+	var g = svgDoc.getElementById("svg");
+	g.width = "100%";
+	g.height = "100%";
+}
+
+/**
+ * Instance an SVGPoint object with given event coordinates.
+ */
+function getEventPoint(evt) {
+	var p = root.createSVGPoint();
+
+	p.x = evt.clientX;
+	p.y = evt.clientY;
+
+	return p;
+}
+
+/**
+ * Sets the current transform matrix of an element.
+ */
+function setCTM(element, matrix) {
+	var s = "matrix(" + matrix.a + "," + matrix.b + "," + matrix.c + "," + matrix.d + "," + matrix.e + "," + matrix.f + ")";
+
+	element.setAttribute("transform", s);
+}
+
+/**
+ * Dumps a matrix to a string (useful for debug).
+ */
+function dumpMatrix(matrix) {
+	var s = "[ " + matrix.a + ", " + matrix.c + ", " + matrix.e + "\n  " + matrix.b + ", " + matrix.d + ", " + matrix.f + "\n  0, 0, 1 ]";
+
+	return s;
+}
+
+/**
+ * Sets attributes of an element.
+ */
+function setAttributes(element, attributes){
+	for (i in attributes)
+		element.setAttributeNS(null, i, attributes[i]);
+}
+
+/**
+ * Handle mouse move event.
+ */
+function handleMouseWheel(evt) {
+	if(evt.preventDefault)
+		evt.preventDefault();
+
+	evt.returnValue = false;
+
+	var svgDoc = evt.target.ownerDocument;
+
+	var delta;
+
+	if(evt.wheelDelta)
+		delta = evt.wheelDelta / 3600; // Chrome/Safari
+	else
+		delta = evt.detail / -90; // Mozilla
+
+	var z = 1 + delta; // Zoom factor: 0.9/1.1
+
+	var g = svgDoc.getElementById("viewport");
+
+	var p = getEventPoint(evt);
+
+	p = p.matrixTransform(g.getCTM().inverse());
+
+	// Compute new scale matrix in current mouse position
+	var k = root.createSVGMatrix().translate(p.x, p.y).scale(z).translate(-p.x, -p.y);
+
+        setCTM(g, g.getCTM().multiply(k));
+
+	stateTf = stateTf.multiply(k.inverse());
+}
+
+/**
+ * Handle mouse move event.
+ */
+function handleMouseMove(evt) {
+	if(evt.preventDefault)
+		evt.preventDefault();
+
+	evt.returnValue = false;
+
+	var svgDoc = evt.target.ownerDocument;
+
+	var g = svgDoc.getElementById("viewport");
+
+	if(state == 'pan') {
+		// Pan mode
+		var p = getEventPoint(evt).matrixTransform(stateTf);
+
+		setCTM(g, stateTf.inverse().translate(p.x - stateOrigin.x, p.y - stateOrigin.y));
+	} else if(state == 'move') {
+		// Move mode
+		var p = getEventPoint(evt).matrixTransform(g.getCTM().inverse());
+
+		setCTM(stateTarget, root.createSVGMatrix().translate(p.x - stateOrigin.x, p.y - stateOrigin.y).multiply(g.getCTM().inverse()).multiply(stateTarget.getCTM()));
+
+		stateOrigin = p;
+	}
+}
+
+/**
+ * Handle click event.
+ */
+function handleMouseDown(evt) {
+	if(evt.preventDefault)
+		evt.preventDefault();
+
+	evt.returnValue = false;
+
+	var svgDoc = evt.target.ownerDocument;
+
+	var g = svgDoc.getElementById("viewport");
+
+	if(true || evt.target.tagName == "svg") {
+		// Pan mode
+		state = 'pan';
+
+		stateTf = g.getCTM().inverse();
+
+		stateOrigin = getEventPoint(evt).matrixTransform(stateTf);
+	} else {
+		// Move mode
+		state = 'move';
+
+		stateTarget = evt.target;
+
+		stateTf = g.getCTM().inverse();
+
+		stateOrigin = getEventPoint(evt).matrixTransform(stateTf);
+	}
+}
+
+/**
+ * Handle mouse button release event.
+ */
+function handleMouseUp(evt) {
+	if(evt.preventDefault)
+		evt.preventDefault();
+
+	evt.returnValue = false;
+
+	var svgDoc = evt.target.ownerDocument;
+
+	if(state == 'pan' || state == 'move') {
+		// Quit pan mode
+		state = '';
+	}
+}
+
+]]></script>
+EOF
+}
+
+# Provides a map from fullname to shortname for cases where the
+# shortname is ambiguous.  The symlist has both the fullname and
+# shortname for all symbols, which is usually fine, but sometimes --
+# such as overloaded functions -- two different fullnames can map to
+# the same shortname.  In that case, we use the address of the
+# function to disambiguate the two.  This function fills in a map that
+# maps fullnames to modified shortnames in such cases.  If a fullname
+# is not present in the map, the 'normal' shortname provided by the
+# symlist is the appropriate one to use.
+sub FillFullnameToShortnameMap {
+  my $symbols = shift;
+  my $fullname_to_shortname_map = shift;
+  my $shortnames_seen_once = {};
+  my $shortnames_seen_more_than_once = {};
+
+  foreach my $symlist (values(%{$symbols})) {
+    # TODO(csilvers): deal with inlined symbols too.
+    my $shortname = $symlist->[0];
+    my $fullname = $symlist->[2];
+    if ($fullname !~ /<[0-9a-fA-F]+>$/) {  # fullname doesn't end in an address
+      next;       # the only collisions we care about are when addresses differ
+    }
+    if (defined($shortnames_seen_once->{$shortname}) &&
+        $shortnames_seen_once->{$shortname} ne $fullname) {
+      $shortnames_seen_more_than_once->{$shortname} = 1;
+    } else {
+      $shortnames_seen_once->{$shortname} = $fullname;
+    }
+  }
+
+  foreach my $symlist (values(%{$symbols})) {
+    my $shortname = $symlist->[0];
+    my $fullname = $symlist->[2];
+    # TODO(csilvers): take in a list of addresses we care about, and only
+    # store in the map if $symlist->[1] is in that list.  Saves space.
+    next if defined($fullname_to_shortname_map->{$fullname});
+    if (defined($shortnames_seen_more_than_once->{$shortname})) {
+      if ($fullname =~ /<0*([^>]*)>$/) {   # fullname has address at end of it
+        $fullname_to_shortname_map->{$fullname} = "$shortname\@$1";
+      }
+    }
+  }
+}
+
+# Return a small number that identifies the argument.
+# Multiple calls with the same argument will return the same number.
+# Calls with different arguments will return different numbers.
+sub ShortIdFor {
+  my $key = shift;
+  my $id = $main::uniqueid{$key};
+  if (!defined($id)) {
+    $id = keys(%main::uniqueid) + 1;
+    $main::uniqueid{$key} = $id;
+  }
+  return $id;
+}
+
+# Translate a stack of addresses into a stack of symbols
+sub TranslateStack {
+  my $symbols = shift;
+  my $fullname_to_shortname_map = shift;
+  my $k = shift;
+
+  my @addrs = split(/\n/, $k);
+  my @result = ();
+  for (my $i = 0; $i <= $#addrs; $i++) {
+    my $a = $addrs[$i];
+
+    # Skip large addresses since they sometimes show up as fake entries on RH9
+    if (length($a) > 8 && $a gt "7fffffffffffffff") {
+      next;
+    }
+
+    if ($main::opt_disasm || $main::opt_list) {
+      # We want just the address for the key
+      push(@result, $a);
+      next;
+    }
+
+    my $symlist = $symbols->{$a};
+    if (!defined($symlist)) {
+      $symlist = [$a, "", $a];
+    }
+
+    # We can have a sequence of symbols for a particular entry
+    # (more than one symbol in the case of inlining).  Callers
+    # come before callees in symlist, so walk backwards since
+    # the translated stack should contain callees before callers.
+    for (my $j = $#{$symlist}; $j >= 2; $j -= 3) {
+      my $func = $symlist->[$j-2];
+      my $fileline = $symlist->[$j-1];
+      my $fullfunc = $symlist->[$j];
+      if (defined($fullname_to_shortname_map->{$fullfunc})) {
+        $func = $fullname_to_shortname_map->{$fullfunc};
+      }
+      if ($j > 2) {
+        $func = "$func (inline)";
+      }
+
+      # Do not merge nodes corresponding to Callback::Run since that
+      # causes confusing cycles in dot display.  Instead, we synthesize
+      # a unique name for this frame per caller.
+      if ($func =~ m/Callback.*::Run$/) {
+        my $caller = ($i > 0) ? $addrs[$i-1] : 0;
+        $func = "Run#" . ShortIdFor($caller);
+      }
+
+      if ($main::opt_addresses) {
+        push(@result, "$a $func $fileline");
+      } elsif ($main::opt_lines) {
+        if ($func eq '??' && $fileline eq '??:0') {
+          push(@result, "$a");
+        } else {
+          push(@result, "$func $fileline");
+        }
+      } elsif ($main::opt_functions) {
+        if ($func eq '??') {
+          push(@result, "$a");
+        } else {
+          push(@result, $func);
+        }
+      } elsif ($main::opt_files) {
+        if ($fileline eq '??:0' || $fileline eq '') {
+          push(@result, "$a");
+        } else {
+          my $f = $fileline;
+          $f =~ s/:\d+$//;
+          push(@result, $f);
+        }
+      } else {
+        push(@result, $a);
+        last;  # Do not print inlined info
+      }
+    }
+  }
+
+  # print join(",", @addrs), " => ", join(",", @result), "\n";
+  return @result;
+}
+
+# Generate percent string for a number and a total
+sub Percent {
+  my $num = shift;
+  my $tot = shift;
+  if ($tot != 0) {
+    return sprintf("%.1f%%", $num * 100.0 / $tot);
+  } else {
+    return ($num == 0) ? "nan" : (($num > 0) ? "+inf" : "-inf");
+  }
+}
+
+# Generate pretty-printed form of number
+sub Unparse {
+  my $num = shift;
+  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
+    if ($main::opt_inuse_objects || $main::opt_alloc_objects) {
+      return sprintf("%d", $num);
+    } else {
+      if ($main::opt_show_bytes) {
+        return sprintf("%d", $num);
+      } else {
+        return sprintf("%.1f", $num / 1048576.0);
+      }
+    }
+  } elsif ($main::profile_type eq 'contention' && !$main::opt_contentions) {
+    return sprintf("%.3f", $num / 1e9); # Convert nanoseconds to seconds
+  } else {
+    return sprintf("%d", $num);
+  }
+}
+
+# Alternate pretty-printed form: 0 maps to "."
+sub UnparseAlt {
+  my $num = shift;
+  if ($num == 0) {
+    return ".";
+  } else {
+    return Unparse($num);
+  }
+}
+
+# Alternate pretty-printed form: 0 maps to ""
+sub HtmlPrintNumber {
+  my $num = shift;
+  if ($num == 0) {
+    return "";
+  } else {
+    return Unparse($num);
+  }
+}
+
+# Return output units
+sub Units {
+  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
+    if ($main::opt_inuse_objects || $main::opt_alloc_objects) {
+      return "objects";
+    } else {
+      if ($main::opt_show_bytes) {
+        return "B";
+      } else {
+        return "MB";
+      }
+    }
+  } elsif ($main::profile_type eq 'contention' && !$main::opt_contentions) {
+    return "seconds";
+  } else {
+    return "samples";
+  }
+}
+
+##### Profile manipulation code #####
+
+# Generate flattened profile:
+# If count is charged to stack [a,b,c,d], in generated profile,
+# it will be charged to [a]
+sub FlatProfile {
+  my $profile = shift;
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    if ($#addrs >= 0) {
+      AddEntry($result, $addrs[0], $count);
+    }
+  }
+  return $result;
+}
+
+# Generate cumulative profile:
+# If count is charged to stack [a,b,c,d], in generated profile,
+# it will be charged to [a], [b], [c], [d]
+sub CumulativeProfile {
+  my $profile = shift;
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    foreach my $a (@addrs) {
+      AddEntry($result, $a, $count);
+    }
+  }
+  return $result;
+}
+
+# If the second-youngest PC on the stack is always the same, returns
+# that pc.  Otherwise, returns undef.
+sub IsSecondPcAlwaysTheSame {
+  my $profile = shift;
+
+  my $second_pc = undef;
+  foreach my $k (keys(%{$profile})) {
+    my @addrs = split(/\n/, $k);
+    if ($#addrs < 1) {
+      return undef;
+    }
+    if (not defined $second_pc) {
+      $second_pc = $addrs[1];
+    } else {
+      if ($second_pc ne $addrs[1]) {
+        return undef;
+      }
+    }
+  }
+  return $second_pc;
+}
+
+sub ExtractSymbolLocation {
+  my $symbols = shift;
+  my $address = shift;
+  # 'addr2line' outputs "??:0" for unknown locations; we do the
+  # same to be consistent.
+  my $location = "??:0:unknown";
+  if (exists $symbols->{$address}) {
+    my $file = $symbols->{$address}->[1];
+    if ($file eq "?") {
+      $file = "??:0"
+    }
+    $location = $file . ":" . $symbols->{$address}->[0];
+  }
+  return $location;
+}
+
+# Extracts a graph of calls.
+sub ExtractCalls {
+  my $symbols = shift;
+  my $profile = shift;
+
+  my $calls = {};
+  while( my ($stack_trace, $count) = each %$profile ) {
+    my @address = split(/\n/, $stack_trace);
+    my $destination = ExtractSymbolLocation($symbols, $address[0]);
+    AddEntry($calls, $destination, $count);
+    for (my $i = 1; $i <= $#address; $i++) {
+      my $source = ExtractSymbolLocation($symbols, $address[$i]);
+      my $call = "$source -> $destination";
+      AddEntry($calls, $call, $count);
+      $destination = $source;
+    }
+  }
+
+  return $calls;
+}
+
+sub FilterFrames {
+  my $symbols = shift;
+  my $profile = shift;
+
+  if ($main::opt_retain eq '' && $main::opt_exclude eq '') {
+    return $profile;
+  }
+
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    my @path = ();
+    foreach my $a (@addrs) {
+      my $sym;
+      if (exists($symbols->{$a})) {
+        $sym = $symbols->{$a}->[0];
+      } else {
+        $sym = $a;
+      }
+      if ($main::opt_retain ne '' && $sym !~ m/$main::opt_retain/) {
+        next;
+      }
+      if ($main::opt_exclude ne '' && $sym =~ m/$main::opt_exclude/) {
+        next;
+      }
+      push(@path, $a);
+    }
+    if (scalar(@path) > 0) {
+      my $reduced_path = join("\n", @path);
+      AddEntry($result, $reduced_path, $count);
+    }
+  }
+
+  return $result;
+}
+
+sub RemoveUninterestingFrames {
+  my $symbols = shift;
+  my $profile = shift;
+
+  # List of function names to skip
+  my %skip = ();
+  my $skip_regexp = 'NOMATCH';
+  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
+    foreach my $name ('@JEMALLOC_PREFIX@calloc',
+                      'cfree',
+                      '@JEMALLOC_PREFIX@malloc',
+                      'newImpl',
+                      'void* newImpl',
+                      '@JEMALLOC_PREFIX@free',
+                      '@JEMALLOC_PREFIX@memalign',
+                      '@JEMALLOC_PREFIX@posix_memalign',
+                      '@JEMALLOC_PREFIX@aligned_alloc',
+                      'pvalloc',
+                      '@JEMALLOC_PREFIX@valloc',
+                      '@JEMALLOC_PREFIX@realloc',
+                      '@JEMALLOC_PREFIX@mallocx',
+                      '@JEMALLOC_PREFIX@rallocx',
+                      '@JEMALLOC_PREFIX@xallocx',
+                      '@JEMALLOC_PREFIX@dallocx',
+                      '@JEMALLOC_PREFIX@sdallocx',
+                      'tc_calloc',
+                      'tc_cfree',
+                      'tc_malloc',
+                      'tc_free',
+                      'tc_memalign',
+                      'tc_posix_memalign',
+                      'tc_pvalloc',
+                      'tc_valloc',
+                      'tc_realloc',
+                      'tc_new',
+                      'tc_delete',
+                      'tc_newarray',
+                      'tc_deletearray',
+                      'tc_new_nothrow',
+                      'tc_newarray_nothrow',
+                      'do_malloc',
+                      '::do_malloc',   # new name -- got moved to an unnamed ns
+                      '::do_malloc_or_cpp_alloc',
+                      'DoSampledAllocation',
+                      'simple_alloc::allocate',
+                      '__malloc_alloc_template::allocate',
+                      '__builtin_delete',
+                      '__builtin_new',
+                      '__builtin_vec_delete',
+                      '__builtin_vec_new',
+                      'operator new',
+                      'operator new[]',
+                      # The entry to our memory-allocation routines on OS X
+                      'malloc_zone_malloc',
+                      'malloc_zone_calloc',
+                      'malloc_zone_valloc',
+                      'malloc_zone_realloc',
+                      'malloc_zone_memalign',
+                      'malloc_zone_free',
+                      # These mark the beginning/end of our custom sections
+                      '__start_google_malloc',
+                      '__stop_google_malloc',
+                      '__start_malloc_hook',
+                      '__stop_malloc_hook') {
+      $skip{$name} = 1;
+      $skip{"_" . $name} = 1;   # Mach (OS X) adds a _ prefix to everything
+    }
+    # TODO: Remove TCMalloc once everything has been
+    # moved into the tcmalloc:: namespace and we have flushed
+    # old code out of the system.
+    $skip_regexp = "TCMalloc|^tcmalloc::";
+  } elsif ($main::profile_type eq 'contention') {
+    foreach my $vname ('base::RecordLockProfileData',
+                       'base::SubmitMutexProfileData',
+                       'base::SubmitSpinLockProfileData',
+                       'Mutex::Unlock',
+                       'Mutex::UnlockSlow',
+                       'Mutex::ReaderUnlock',
+                       'MutexLock::~MutexLock',
+                       'SpinLock::Unlock',
+                       'SpinLock::SlowUnlock',
+                       'SpinLockHolder::~SpinLockHolder') {
+      $skip{$vname} = 1;
+    }
+  } elsif ($main::profile_type eq 'cpu') {
+    # Drop signal handlers used for CPU profile collection
+    # TODO(dpeng): this should not be necessary; it's taken
+    # care of by the general 2nd-pc mechanism below.
+    foreach my $name ('ProfileData::Add',           # historical
+                      'ProfileData::prof_handler',  # historical
+                      'CpuProfiler::prof_handler',
+                      '__FRAME_END__',
+                      '__pthread_sighandler',
+                      '__restore') {
+      $skip{$name} = 1;
+    }
+  } else {
+    # Nothing skipped for unknown types
+  }
+
+  if ($main::profile_type eq 'cpu') {
+    # If all the second-youngest program counters are the same,
+    # this STRONGLY suggests that it is an artifact of measurement,
+    # i.e., stack frames pushed by the CPU profiler signal handler.
+    # Hence, we delete them.
+    # (The topmost PC is read from the signal structure, not from
+    # the stack, so it does not get involved.)
+    while (my $second_pc = IsSecondPcAlwaysTheSame($profile)) {
+      my $result = {};
+      my $func = '';
+      if (exists($symbols->{$second_pc})) {
+        $second_pc = $symbols->{$second_pc}->[0];
+      }
+      print STDERR "Removing $second_pc from all stack traces.\n";
+      foreach my $k (keys(%{$profile})) {
+        my $count = $profile->{$k};
+        my @addrs = split(/\n/, $k);
+        splice @addrs, 1, 1;
+        my $reduced_path = join("\n", @addrs);
+        AddEntry($result, $reduced_path, $count);
+      }
+      $profile = $result;
+    }
+  }
+
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    my @path = ();
+    foreach my $a (@addrs) {
+      if (exists($symbols->{$a})) {
+        my $func = $symbols->{$a}->[0];
+        if ($skip{$func} || ($func =~ m/$skip_regexp/)) {
+          # Throw away the portion of the backtrace seen so far, under the
+          # assumption that previous frames were for functions internal to the
+          # allocator.
+          @path = ();
+          next;
+        }
+      }
+      push(@path, $a);
+    }
+    my $reduced_path = join("\n", @path);
+    AddEntry($result, $reduced_path, $count);
+  }
+
+  $result = FilterFrames($symbols, $result);
+
+  return $result;
+}
+
+# Reduce profile to granularity given by user
+sub ReduceProfile {
+  my $symbols = shift;
+  my $profile = shift;
+  my $result = {};
+  my $fullname_to_shortname_map = {};
+  FillFullnameToShortnameMap($symbols, $fullname_to_shortname_map);
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @translated = TranslateStack($symbols, $fullname_to_shortname_map, $k);
+    my @path = ();
+    my %seen = ();
+    $seen{''} = 1;      # So that empty keys are skipped
+    foreach my $e (@translated) {
+      # To avoid double-counting due to recursion, skip a stack-trace
+      # entry if it has already been seen
+      if (!$seen{$e}) {
+        $seen{$e} = 1;
+        push(@path, $e);
+      }
+    }
+    my $reduced_path = join("\n", @path);
+    AddEntry($result, $reduced_path, $count);
+  }
+  return $result;
+}
+
+# Does the specified symbol array match the regexp?
+sub SymbolMatches {
+  my $sym = shift;
+  my $re = shift;
+  if (defined($sym)) {
+    for (my $i = 0; $i < $#{$sym}; $i += 3) {
+      if ($sym->[$i] =~ m/$re/ || $sym->[$i+1] =~ m/$re/) {
+        return 1;
+      }
+    }
+  }
+  return 0;
+}
+
+# Focus only on paths involving specified regexps
+sub FocusProfile {
+  my $symbols = shift;
+  my $profile = shift;
+  my $focus = shift;
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    foreach my $a (@addrs) {
+      # Reply if it matches either the address/shortname/fileline
+      if (($a =~ m/$focus/) || SymbolMatches($symbols->{$a}, $focus)) {
+        AddEntry($result, $k, $count);
+        last;
+      }
+    }
+  }
+  return $result;
+}
+
+# Focus only on paths not involving specified regexps
+sub IgnoreProfile {
+  my $symbols = shift;
+  my $profile = shift;
+  my $ignore = shift;
+  my $result = {};
+  foreach my $k (keys(%{$profile})) {
+    my $count = $profile->{$k};
+    my @addrs = split(/\n/, $k);
+    my $matched = 0;
+    foreach my $a (@addrs) {
+      # Reply if it matches either the address/shortname/fileline
+      if (($a =~ m/$ignore/) || SymbolMatches($symbols->{$a}, $ignore)) {
+        $matched = 1;
+        last;
+      }
+    }
+    if (!$matched) {
+      AddEntry($result, $k, $count);
+    }
+  }
+  return $result;
+}
+
+# Get total count in profile
+sub TotalProfile {
+  my $profile = shift;
+  my $result = 0;
+  foreach my $k (keys(%{$profile})) {
+    $result += $profile->{$k};
+  }
+  return $result;
+}
+
+# Add A to B
+sub AddProfile {
+  my $A = shift;
+  my $B = shift;
+
+  my $R = {};
+  # add all keys in A
+  foreach my $k (keys(%{$A})) {
+    my $v = $A->{$k};
+    AddEntry($R, $k, $v);
+  }
+  # add all keys in B
+  foreach my $k (keys(%{$B})) {
+    my $v = $B->{$k};
+    AddEntry($R, $k, $v);
+  }
+  return $R;
+}
+
+# Merges symbol maps
+sub MergeSymbols {
+  my $A = shift;
+  my $B = shift;
+
+  my $R = {};
+  foreach my $k (keys(%{$A})) {
+    $R->{$k} = $A->{$k};
+  }
+  if (defined($B)) {
+    foreach my $k (keys(%{$B})) {
+      $R->{$k} = $B->{$k};
+    }
+  }
+  return $R;
+}
+
+
+# Add A to B
+sub AddPcs {
+  my $A = shift;
+  my $B = shift;
+
+  my $R = {};
+  # add all keys in A
+  foreach my $k (keys(%{$A})) {
+    $R->{$k} = 1
+  }
+  # add all keys in B
+  foreach my $k (keys(%{$B})) {
+    $R->{$k} = 1
+  }
+  return $R;
+}
+
+# Subtract B from A
+sub SubtractProfile {
+  my $A = shift;
+  my $B = shift;
+
+  my $R = {};
+  foreach my $k (keys(%{$A})) {
+    my $v = $A->{$k} - GetEntry($B, $k);
+    if ($v < 0 && $main::opt_drop_negative) {
+      $v = 0;
+    }
+    AddEntry($R, $k, $v);
+  }
+  if (!$main::opt_drop_negative) {
+    # Take care of when subtracted profile has more entries
+    foreach my $k (keys(%{$B})) {
+      if (!exists($A->{$k})) {
+        AddEntry($R, $k, 0 - $B->{$k});
+      }
+    }
+  }
+  return $R;
+}
+
+# Get entry from profile; zero if not present
+sub GetEntry {
+  my $profile = shift;
+  my $k = shift;
+  if (exists($profile->{$k})) {
+    return $profile->{$k};
+  } else {
+    return 0;
+  }
+}
+
+# Add entry to specified profile
+sub AddEntry {
+  my $profile = shift;
+  my $k = shift;
+  my $n = shift;
+  if (!exists($profile->{$k})) {
+    $profile->{$k} = 0;
+  }
+  $profile->{$k} += $n;
+}
+
+# Add a stack of entries to specified profile, and add them to the $pcs
+# list.
+sub AddEntries {
+  my $profile = shift;
+  my $pcs = shift;
+  my $stack = shift;
+  my $count = shift;
+  my @k = ();
+
+  foreach my $e (split(/\s+/, $stack)) {
+    my $pc = HexExtend($e);
+    $pcs->{$pc} = 1;
+    push @k, $pc;
+  }
+  AddEntry($profile, (join "\n", @k), $count);
+}
+
+##### Code to profile a server dynamically #####
+
+sub CheckSymbolPage {
+  my $url = SymbolPageURL();
+  my $command = ShellEscape(@URL_FETCHER, $url);
+  open(SYMBOL, "$command |") or error($command);
+  my $line = <SYMBOL>;
+  $line =~ s/\r//g;         # turn windows-looking lines into unix-looking lines
+  close(SYMBOL);
+  unless (defined($line)) {
+    error("$url doesn't exist\n");
+  }
+
+  if ($line =~ /^num_symbols:\s+(\d+)$/) {
+    if ($1 == 0) {
+      error("Stripped binary. No symbols available.\n");
+    }
+  } else {
+    error("Failed to get the number of symbols from $url\n");
+  }
+}
+
+sub IsProfileURL {
+  my $profile_name = shift;
+  if (-f $profile_name) {
+    printf STDERR "Using local file $profile_name.\n";
+    return 0;
+  }
+  return 1;
+}
+
+sub ParseProfileURL {
+  my $profile_name = shift;
+
+  if (!defined($profile_name) || $profile_name eq "") {
+    return ();
+  }
+
+  # Split profile URL - matches all non-empty strings, so no test.
+  $profile_name =~ m,^(https?://)?([^/]+)(.*?)(/|$PROFILES)?$,;
+
+  my $proto = $1 || "http://";
+  my $hostport = $2;
+  my $prefix = $3;
+  my $profile = $4 || "/";
+
+  my $host = $hostport;
+  $host =~ s/:.*//;
+
+  my $baseurl = "$proto$hostport$prefix";
+  return ($host, $baseurl, $profile);
+}
+
+# We fetch symbols from the first profile argument.
+sub SymbolPageURL {
+  my ($host, $baseURL, $path) = ParseProfileURL($main::pfile_args[0]);
+  return "$baseURL$SYMBOL_PAGE";
+}
+
+sub FetchProgramName() {
+  my ($host, $baseURL, $path) = ParseProfileURL($main::pfile_args[0]);
+  my $url = "$baseURL$PROGRAM_NAME_PAGE";
+  my $command_line = ShellEscape(@URL_FETCHER, $url);
+  open(CMDLINE, "$command_line |") or error($command_line);
+  my $cmdline = <CMDLINE>;
+  $cmdline =~ s/\r//g;   # turn windows-looking lines into unix-looking lines
+  close(CMDLINE);
+  error("Failed to get program name from $url\n") unless defined($cmdline);
+  $cmdline =~ s/\x00.+//;  # Remove argv[1] and latters.
+  $cmdline =~ s!\n!!g;  # Remove LFs.
+  return $cmdline;
+}
+
+# Gee, curl's -L (--location) option isn't reliable at least
+# with its 7.12.3 version.  Curl will forget to post data if
+# there is a redirection.  This function is a workaround for
+# curl.  Redirection happens on borg hosts.
+sub ResolveRedirectionForCurl {
+  my $url = shift;
+  my $command_line = ShellEscape(@URL_FETCHER, "--head", $url);
+  open(CMDLINE, "$command_line |") or error($command_line);
+  while (<CMDLINE>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    if (/^Location: (.*)/) {
+      $url = $1;
+    }
+  }
+  close(CMDLINE);
+  return $url;
+}
+
+# Add a timeout flat to URL_FETCHER.  Returns a new list.
+sub AddFetchTimeout {
+  my $timeout = shift;
+  my @fetcher = @_;
+  if (defined($timeout)) {
+    if (join(" ", @fetcher) =~ m/\bcurl -s/) {
+      push(@fetcher, "--max-time", sprintf("%d", $timeout));
+    } elsif (join(" ", @fetcher) =~ m/\brpcget\b/) {
+      push(@fetcher, sprintf("--deadline=%d", $timeout));
+    }
+  }
+  return @fetcher;
+}
+
+# Reads a symbol map from the file handle name given as $1, returning
+# the resulting symbol map.  Also processes variables relating to symbols.
+# Currently, the only variable processed is 'binary=<value>' which updates
+# $main::prog to have the correct program name.
+sub ReadSymbols {
+  my $in = shift;
+  my $map = {};
+  while (<$in>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    # Removes all the leading zeroes from the symbols, see comment below.
+    if (m/^0x0*([0-9a-f]+)\s+(.+)/) {
+      $map->{$1} = $2;
+    } elsif (m/^---/) {
+      last;
+    } elsif (m/^([a-z][^=]*)=(.*)$/ ) {
+      my ($variable, $value) = ($1, $2);
+      for ($variable, $value) {
+        s/^\s+//;
+        s/\s+$//;
+      }
+      if ($variable eq "binary") {
+        if ($main::prog ne $UNKNOWN_BINARY && $main::prog ne $value) {
+          printf STDERR ("Warning: Mismatched binary name '%s', using '%s'.\n",
+                         $main::prog, $value);
+        }
+        $main::prog = $value;
+      } else {
+        printf STDERR ("Ignoring unknown variable in symbols list: " .
+            "'%s' = '%s'\n", $variable, $value);
+      }
+    }
+  }
+  return $map;
+}
+
+sub URLEncode {
+  my $str = shift;
+  $str =~ s/([^A-Za-z0-9\-_.!~*'()])/ sprintf "%%%02x", ord $1 /eg;
+  return $str;
+}
+
+sub AppendSymbolFilterParams {
+  my $url = shift;
+  my @params = ();
+  if ($main::opt_retain ne '') {
+    push(@params, sprintf("retain=%s", URLEncode($main::opt_retain)));
+  }
+  if ($main::opt_exclude ne '') {
+    push(@params, sprintf("exclude=%s", URLEncode($main::opt_exclude)));
+  }
+  if (scalar @params > 0) {
+    $url = sprintf("%s?%s", $url, join("&", @params));
+  }
+  return $url;
+}
+
+# Fetches and processes symbols to prepare them for use in the profile output
+# code.  If the optional 'symbol_map' arg is not given, fetches symbols from
+# $SYMBOL_PAGE for all PC values found in profile.  Otherwise, the raw symbols
+# are assumed to have already been fetched into 'symbol_map' and are simply
+# extracted and processed.
+sub FetchSymbols {
+  my $pcset = shift;
+  my $symbol_map = shift;
+
+  my %seen = ();
+  my @pcs = grep { !$seen{$_}++ } keys(%$pcset);  # uniq
+
+  if (!defined($symbol_map)) {
+    my $post_data = join("+", sort((map {"0x" . "$_"} @pcs)));
+
+    open(POSTFILE, ">$main::tmpfile_sym");
+    print POSTFILE $post_data;
+    close(POSTFILE);
+
+    my $url = SymbolPageURL();
+
+    my $command_line;
+    if (join(" ", @URL_FETCHER) =~ m/\bcurl -s/) {
+      $url = ResolveRedirectionForCurl($url);
+      $url = AppendSymbolFilterParams($url);
+      $command_line = ShellEscape(@URL_FETCHER, "-d", "\@$main::tmpfile_sym",
+                                  $url);
+    } else {
+      $url = AppendSymbolFilterParams($url);
+      $command_line = (ShellEscape(@URL_FETCHER, "--post", $url)
+                       . " < " . ShellEscape($main::tmpfile_sym));
+    }
+    # We use c++filt in case $SYMBOL_PAGE gives us mangled symbols.
+    my $escaped_cppfilt = ShellEscape($obj_tool_map{"c++filt"});
+    open(SYMBOL, "$command_line | $escaped_cppfilt |") or error($command_line);
+    $symbol_map = ReadSymbols(*SYMBOL{IO});
+    close(SYMBOL);
+  }
+
+  my $symbols = {};
+  foreach my $pc (@pcs) {
+    my $fullname;
+    # For 64 bits binaries, symbols are extracted with 8 leading zeroes.
+    # Then /symbol reads the long symbols in as uint64, and outputs
+    # the result with a "0x%08llx" format which get rid of the zeroes.
+    # By removing all the leading zeroes in both $pc and the symbols from
+    # /symbol, the symbols match and are retrievable from the map.
+    my $shortpc = $pc;
+    $shortpc =~ s/^0*//;
+    # Each line may have a list of names, which includes the function
+    # and also other functions it has inlined.  They are separated (in
+    # PrintSymbolizedProfile), by --, which is illegal in function names.
+    my $fullnames;
+    if (defined($symbol_map->{$shortpc})) {
+      $fullnames = $symbol_map->{$shortpc};
+    } else {
+      $fullnames = "0x" . $pc;  # Just use addresses
+    }
+    my $sym = [];
+    $symbols->{$pc} = $sym;
+    foreach my $fullname (split("--", $fullnames)) {
+      my $name = ShortFunctionName($fullname);
+      push(@{$sym}, $name, "?", $fullname);
+    }
+  }
+  return $symbols;
+}
+
+sub BaseName {
+  my $file_name = shift;
+  $file_name =~ s!^.*/!!;  # Remove directory name
+  return $file_name;
+}
+
+sub MakeProfileBaseName {
+  my ($binary_name, $profile_name) = @_;
+  my ($host, $baseURL, $path) = ParseProfileURL($profile_name);
+  my $binary_shortname = BaseName($binary_name);
+  return sprintf("%s.%s.%s",
+                 $binary_shortname, $main::op_time, $host);
+}
+
+sub FetchDynamicProfile {
+  my $binary_name = shift;
+  my $profile_name = shift;
+  my $fetch_name_only = shift;
+  my $encourage_patience = shift;
+
+  if (!IsProfileURL($profile_name)) {
+    return $profile_name;
+  } else {
+    my ($host, $baseURL, $path) = ParseProfileURL($profile_name);
+    if ($path eq "" || $path eq "/") {
+      # Missing type specifier defaults to cpu-profile
+      $path = $PROFILE_PAGE;
+    }
+
+    my $profile_file = MakeProfileBaseName($binary_name, $profile_name);
+
+    my $url = "$baseURL$path";
+    my $fetch_timeout = undef;
+    if ($path =~ m/$PROFILE_PAGE|$PMUPROFILE_PAGE/) {
+      if ($path =~ m/[?]/) {
+        $url .= "&";
+      } else {
+        $url .= "?";
+      }
+      $url .= sprintf("seconds=%d", $main::opt_seconds);
+      $fetch_timeout = $main::opt_seconds * 1.01 + 60;
+      # Set $profile_type for consumption by PrintSymbolizedProfile.
+      $main::profile_type = 'cpu';
+    } else {
+      # For non-CPU profiles, we add a type-extension to
+      # the target profile file name.
+      my $suffix = $path;
+      $suffix =~ s,/,.,g;
+      $profile_file .= $suffix;
+      # Set $profile_type for consumption by PrintSymbolizedProfile.
+      if ($path =~ m/$HEAP_PAGE/) {
+        $main::profile_type = 'heap';
+      } elsif ($path =~ m/$GROWTH_PAGE/) {
+        $main::profile_type = 'growth';
+      } elsif ($path =~ m/$CONTENTION_PAGE/) {
+        $main::profile_type = 'contention';
+      }
+    }
+
+    my $profile_dir = $ENV{"JEPROF_TMPDIR"} || ($ENV{HOME} . "/jeprof");
+    if (! -d $profile_dir) {
+      mkdir($profile_dir)
+          || die("Unable to create profile directory $profile_dir: $!\n");
+    }
+    my $tmp_profile = "$profile_dir/.tmp.$profile_file";
+    my $real_profile = "$profile_dir/$profile_file";
+
+    if ($fetch_name_only > 0) {
+      return $real_profile;
+    }
+
+    my @fetcher = AddFetchTimeout($fetch_timeout, @URL_FETCHER);
+    my $cmd = ShellEscape(@fetcher, $url) . " > " . ShellEscape($tmp_profile);
+    if ($path =~ m/$PROFILE_PAGE|$PMUPROFILE_PAGE|$CENSUSPROFILE_PAGE/){
+      print STDERR "Gathering CPU profile from $url for $main::opt_seconds seconds to\n  ${real_profile}\n";
+      if ($encourage_patience) {
+        print STDERR "Be patient...\n";
+      }
+    } else {
+      print STDERR "Fetching $path profile from $url to\n  ${real_profile}\n";
+    }
+
+    (system($cmd) == 0) || error("Failed to get profile: $cmd: $!\n");
+    (system("mv", $tmp_profile, $real_profile) == 0) || error("Unable to rename profile\n");
+    print STDERR "Wrote profile to $real_profile\n";
+    $main::collected_profile = $real_profile;
+    return $main::collected_profile;
+  }
+}
+
+# Collect profiles in parallel
+sub FetchDynamicProfiles {
+  my $items = scalar(@main::pfile_args);
+  my $levels = log($items) / log(2);
+
+  if ($items == 1) {
+    $main::profile_files[0] = FetchDynamicProfile($main::prog, $main::pfile_args[0], 0, 1);
+  } else {
+    # math rounding issues
+    if ((2 ** $levels) < $items) {
+     $levels++;
+    }
+    my $count = scalar(@main::pfile_args);
+    for (my $i = 0; $i < $count; $i++) {
+      $main::profile_files[$i] = FetchDynamicProfile($main::prog, $main::pfile_args[$i], 1, 0);
+    }
+    print STDERR "Fetching $count profiles, Be patient...\n";
+    FetchDynamicProfilesRecurse($levels, 0, 0);
+    $main::collected_profile = join(" \\\n    ", @main::profile_files);
+  }
+}
+
+# Recursively fork a process to get enough processes
+# collecting profiles
+sub FetchDynamicProfilesRecurse {
+  my $maxlevel = shift;
+  my $level = shift;
+  my $position = shift;
+
+  if (my $pid = fork()) {
+    $position = 0 | ($position << 1);
+    TryCollectProfile($maxlevel, $level, $position);
+    wait;
+  } else {
+    $position = 1 | ($position << 1);
+    TryCollectProfile($maxlevel, $level, $position);
+    cleanup();
+    exit(0);
+  }
+}
+
+# Collect a single profile
+sub TryCollectProfile {
+  my $maxlevel = shift;
+  my $level = shift;
+  my $position = shift;
+
+  if ($level >= ($maxlevel - 1)) {
+    if ($position < scalar(@main::pfile_args)) {
+      FetchDynamicProfile($main::prog, $main::pfile_args[$position], 0, 0);
+    }
+  } else {
+    FetchDynamicProfilesRecurse($maxlevel, $level+1, $position);
+  }
+}
+
+##### Parsing code #####
+
+# Provide a small streaming-read module to handle very large
+# cpu-profile files.  Stream in chunks along a sliding window.
+# Provides an interface to get one 'slot', correctly handling
+# endian-ness differences.  A slot is one 32-bit or 64-bit word
+# (depending on the input profile).  We tell endianness and bit-size
+# for the profile by looking at the first 8 bytes: in cpu profiles,
+# the second slot is always 3 (we'll accept anything that's not 0).
+BEGIN {
+  package CpuProfileStream;
+
+  sub new {
+    my ($class, $file, $fname) = @_;
+    my $self = { file        => $file,
+                 base        => 0,
+                 stride      => 512 * 1024,   # must be a multiple of bitsize/8
+                 slots       => [],
+                 unpack_code => "",           # N for big-endian, V for little
+                 perl_is_64bit => 1,          # matters if profile is 64-bit
+    };
+    bless $self, $class;
+    # Let unittests adjust the stride
+    if ($main::opt_test_stride > 0) {
+      $self->{stride} = $main::opt_test_stride;
+    }
+    # Read the first two slots to figure out bitsize and endianness.
+    my $slots = $self->{slots};
+    my $str;
+    read($self->{file}, $str, 8);
+    # Set the global $address_length based on what we see here.
+    # 8 is 32-bit (8 hexadecimal chars); 16 is 64-bit (16 hexadecimal chars).
+    $address_length = ($str eq (chr(0)x8)) ? 16 : 8;
+    if ($address_length == 8) {
+      if (substr($str, 6, 2) eq chr(0)x2) {
+        $self->{unpack_code} = 'V';  # Little-endian.
+      } elsif (substr($str, 4, 2) eq chr(0)x2) {
+        $self->{unpack_code} = 'N';  # Big-endian
+      } else {
+        ::error("$fname: header size >= 2**16\n");
+      }
+      @$slots = unpack($self->{unpack_code} . "*", $str);
+    } else {
+      # If we're a 64-bit profile, check if we're a 64-bit-capable
+      # perl.  Otherwise, each slot will be represented as a float
+      # instead of an int64, losing precision and making all the
+      # 64-bit addresses wrong.  We won't complain yet, but will
+      # later if we ever see a value that doesn't fit in 32 bits.
+      my $has_q = 0;
+      eval { $has_q = pack("Q", "1") ? 1 : 1; };
+      if (!$has_q) {
+        $self->{perl_is_64bit} = 0;
+      }
+      read($self->{file}, $str, 8);
+      if (substr($str, 4, 4) eq chr(0)x4) {
+        # We'd love to use 'Q', but it's a) not universal, b) not endian-proof.
+        $self->{unpack_code} = 'V';  # Little-endian.
+      } elsif (substr($str, 0, 4) eq chr(0)x4) {
+        $self->{unpack_code} = 'N';  # Big-endian
+      } else {
+        ::error("$fname: header size >= 2**32\n");
+      }
+      my @pair = unpack($self->{unpack_code} . "*", $str);
+      # Since we know one of the pair is 0, it's fine to just add them.
+      @$slots = (0, $pair[0] + $pair[1]);
+    }
+    return $self;
+  }
+
+  # Load more data when we access slots->get(X) which is not yet in memory.
+  sub overflow {
+    my ($self) = @_;
+    my $slots = $self->{slots};
+    $self->{base} += $#$slots + 1;   # skip over data we're replacing
+    my $str;
+    read($self->{file}, $str, $self->{stride});
+    if ($address_length == 8) {      # the 32-bit case
+      # This is the easy case: unpack provides 32-bit unpacking primitives.
+      @$slots = unpack($self->{unpack_code} . "*", $str);
+    } else {
+      # We need to unpack 32 bits at a time and combine.
+      my @b32_values = unpack($self->{unpack_code} . "*", $str);
+      my @b64_values = ();
+      for (my $i = 0; $i < $#b32_values; $i += 2) {
+        # TODO(csilvers): if this is a 32-bit perl, the math below
+        #    could end up in a too-large int, which perl will promote
+        #    to a double, losing necessary precision.  Deal with that.
+        #    Right now, we just die.
+        my ($lo, $hi) = ($b32_values[$i], $b32_values[$i+1]);
+        if ($self->{unpack_code} eq 'N') {    # big-endian
+          ($lo, $hi) = ($hi, $lo);
+        }
+        my $value = $lo + $hi * (2**32);
+        if (!$self->{perl_is_64bit} &&   # check value is exactly represented
+            (($value % (2**32)) != $lo || int($value / (2**32)) != $hi)) {
+          ::error("Need a 64-bit perl to process this 64-bit profile.\n");
+        }
+        push(@b64_values, $value);
+      }
+      @$slots = @b64_values;
+    }
+  }
+
+  # Access the i-th long in the file (logically), or -1 at EOF.
+  sub get {
+    my ($self, $idx) = @_;
+    my $slots = $self->{slots};
+    while ($#$slots >= 0) {
+      if ($idx < $self->{base}) {
+        # The only time we expect a reference to $slots[$i - something]
+        # after referencing $slots[$i] is reading the very first header.
+        # Since $stride > |header|, that shouldn't cause any lookback
+        # errors.  And everything after the header is sequential.
+        print STDERR "Unexpected look-back reading CPU profile";
+        return -1;   # shrug, don't know what better to return
+      } elsif ($idx > $self->{base} + $#$slots) {
+        $self->overflow();
+      } else {
+        return $slots->[$idx - $self->{base}];
+      }
+    }
+    # If we get here, $slots is [], which means we've reached EOF
+    return -1;  # unique since slots is supposed to hold unsigned numbers
+  }
+}
+
+# Reads the top, 'header' section of a profile, and returns the last
+# line of the header, commonly called a 'header line'.  The header
+# section of a profile consists of zero or more 'command' lines that
+# are instructions to jeprof, which jeprof executes when reading the
+# header.  All 'command' lines start with a %.  After the command
+# lines is the 'header line', which is a profile-specific line that
+# indicates what type of profile it is, and perhaps other global
+# information about the profile.  For instance, here's a header line
+# for a heap profile:
+#   heap profile:     53:    38236 [  5525:  1284029] @ heapprofile
+# For historical reasons, the CPU profile does not contain a text-
+# readable header line.  If the profile looks like a CPU profile,
+# this function returns "".  If no header line could be found, this
+# function returns undef.
+#
+# The following commands are recognized:
+#   %warn -- emit the rest of this line to stderr, prefixed by 'WARNING:'
+#
+# The input file should be in binmode.
+sub ReadProfileHeader {
+  local *PROFILE = shift;
+  my $firstchar = "";
+  my $line = "";
+  read(PROFILE, $firstchar, 1);
+  seek(PROFILE, -1, 1);                    # unread the firstchar
+  if ($firstchar !~ /[[:print:]]/) {       # is not a text character
+    return "";
+  }
+  while (defined($line = <PROFILE>)) {
+    $line =~ s/\r//g;   # turn windows-looking lines into unix-looking lines
+    if ($line =~ /^%warn\s+(.*)/) {        # 'warn' command
+      # Note this matches both '%warn blah\n' and '%warn\n'.
+      print STDERR "WARNING: $1\n";        # print the rest of the line
+    } elsif ($line =~ /^%/) {
+      print STDERR "Ignoring unknown command from profile header: $line";
+    } else {
+      # End of commands, must be the header line.
+      return $line;
+    }
+  }
+  return undef;     # got to EOF without seeing a header line
+}
+
+sub IsSymbolizedProfileFile {
+  my $file_name = shift;
+  if (!(-e $file_name) || !(-r $file_name)) {
+    return 0;
+  }
+  # Check if the file contains a symbol-section marker.
+  open(TFILE, "<$file_name");
+  binmode TFILE;
+  my $firstline = ReadProfileHeader(*TFILE);
+  close(TFILE);
+  if (!$firstline) {
+    return 0;
+  }
+  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $symbol_marker = $&;
+  return $firstline =~ /^--- *$symbol_marker/;
+}
+
+# Parse profile generated by common/profiler.cc and return a reference
+# to a map:
+#      $result->{version}     Version number of profile file
+#      $result->{period}      Sampling period (in microseconds)
+#      $result->{profile}     Profile object
+#      $result->{threads}     Map of thread IDs to profile objects
+#      $result->{map}         Memory map info from profile
+#      $result->{pcs}         Hash of all PC values seen, key is hex address
+sub ReadProfile {
+  my $prog = shift;
+  my $fname = shift;
+  my $result;            # return value
+
+  $CONTENTION_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $contention_marker = $&;
+  $GROWTH_PAGE  =~ m,[^/]+$,;    # matches everything after the last slash
+  my $growth_marker = $&;
+  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $symbol_marker = $&;
+  $PROFILE_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $profile_marker = $&;
+  $HEAP_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
+  my $heap_marker = $&;
+
+  # Look at first line to see if it is a heap or a CPU profile.
+  # CPU profile may start with no header at all, and just binary data
+  # (starting with \0\0\0\0) -- in that case, don't try to read the
+  # whole firstline, since it may be gigabytes(!) of data.
+  open(PROFILE, "<$fname") || error("$fname: $!\n");
+  binmode PROFILE;      # New perls do UTF-8 processing
+  my $header = ReadProfileHeader(*PROFILE);
+  if (!defined($header)) {   # means "at EOF"
+    error("Profile is empty.\n");
+  }
+
+  my $symbols;
+  if ($header =~ m/^--- *$symbol_marker/o) {
+    # Verify that the user asked for a symbolized profile
+    if (!$main::use_symbolized_profile) {
+      # we have both a binary and symbolized profiles, abort
+      error("FATAL ERROR: Symbolized profile\n   $fname\ncannot be used with " .
+            "a binary arg. Try again without passing\n   $prog\n");
+    }
+    # Read the symbol section of the symbolized profile file.
+    $symbols = ReadSymbols(*PROFILE{IO});
+    # Read the next line to get the header for the remaining profile.
+    $header = ReadProfileHeader(*PROFILE) || "";
+  }
+
+  if ($header =~ m/^--- *($heap_marker|$growth_marker)/o) {
+    # Skip "--- ..." line for profile types that have their own headers.
+    $header = ReadProfileHeader(*PROFILE) || "";
+  }
+
+  $main::profile_type = '';
+
+  if ($header =~ m/^heap profile:.*$growth_marker/o) {
+    $main::profile_type = 'growth';
+    $result =  ReadHeapProfile($prog, *PROFILE, $header);
+  } elsif ($header =~ m/^heap profile:/) {
+    $main::profile_type = 'heap';
+    $result =  ReadHeapProfile($prog, *PROFILE, $header);
+  } elsif ($header =~ m/^heap/) {
+    $main::profile_type = 'heap';
+    $result = ReadThreadedHeapProfile($prog, $fname, $header);
+  } elsif ($header =~ m/^--- *$contention_marker/o) {
+    $main::profile_type = 'contention';
+    $result = ReadSynchProfile($prog, *PROFILE);
+  } elsif ($header =~ m/^--- *Stacks:/) {
+    print STDERR
+      "Old format contention profile: mistakenly reports " .
+      "condition variable signals as lock contentions.\n";
+    $main::profile_type = 'contention';
+    $result = ReadSynchProfile($prog, *PROFILE);
+  } elsif ($header =~ m/^--- *$profile_marker/) {
+    # the binary cpu profile data starts immediately after this line
+    $main::profile_type = 'cpu';
+    $result = ReadCPUProfile($prog, $fname, *PROFILE);
+  } else {
+    if (defined($symbols)) {
+      # a symbolized profile contains a format we don't recognize, bail out
+      error("$fname: Cannot recognize profile section after symbols.\n");
+    }
+    # no ascii header present -- must be a CPU profile
+    $main::profile_type = 'cpu';
+    $result = ReadCPUProfile($prog, $fname, *PROFILE);
+  }
+
+  close(PROFILE);
+
+  # if we got symbols along with the profile, return those as well
+  if (defined($symbols)) {
+    $result->{symbols} = $symbols;
+  }
+
+  return $result;
+}
+
+# Subtract one from caller pc so we map back to call instr.
+# However, don't do this if we're reading a symbolized profile
+# file, in which case the subtract-one was done when the file
+# was written.
+#
+# We apply the same logic to all readers, though ReadCPUProfile uses an
+# independent implementation.
+sub FixCallerAddresses {
+  my $stack = shift;
+  # --raw/http: Always subtract one from pc's, because PrintSymbolizedProfile()
+  # dumps unadjusted profiles.
+  {
+    $stack =~ /(\s)/;
+    my $delimiter = $1;
+    my @addrs = split(' ', $stack);
+    my @fixedaddrs;
+    $#fixedaddrs = $#addrs;
+    if ($#addrs >= 0) {
+      $fixedaddrs[0] = $addrs[0];
+    }
+    for (my $i = 1; $i <= $#addrs; $i++) {
+      $fixedaddrs[$i] = AddressSub($addrs[$i], "0x1");
+    }
+    return join $delimiter, @fixedaddrs;
+  }
+}
+
+# CPU profile reader
+sub ReadCPUProfile {
+  my $prog = shift;
+  my $fname = shift;       # just used for logging
+  local *PROFILE = shift;
+  my $version;
+  my $period;
+  my $i;
+  my $profile = {};
+  my $pcs = {};
+
+  # Parse string into array of slots.
+  my $slots = CpuProfileStream->new(*PROFILE, $fname);
+
+  # Read header.  The current header version is a 5-element structure
+  # containing:
+  #   0: header count (always 0)
+  #   1: header "words" (after this one: 3)
+  #   2: format version (0)
+  #   3: sampling period (usec)
+  #   4: unused padding (always 0)
+  if ($slots->get(0) != 0 ) {
+    error("$fname: not a profile file, or old format profile file\n");
+  }
+  $i = 2 + $slots->get(1);
+  $version = $slots->get(2);
+  $period = $slots->get(3);
+  # Do some sanity checking on these header values.
+  if ($version > (2**32) || $period > (2**32) || $i > (2**32) || $i < 5) {
+    error("$fname: not a profile file, or corrupted profile file\n");
+  }
+
+  # Parse profile
+  while ($slots->get($i) != -1) {
+    my $n = $slots->get($i++);
+    my $d = $slots->get($i++);
+    if ($d > (2**16)) {  # TODO(csilvers): what's a reasonable max-stack-depth?
+      my $addr = sprintf("0%o", $i * ($address_length == 8 ? 4 : 8));
+      print STDERR "At index $i (address $addr):\n";
+      error("$fname: stack trace depth >= 2**32\n");
+    }
+    if ($slots->get($i) == 0) {
+      # End of profile data marker
+      $i += $d;
+      last;
+    }
+
+    # Make key out of the stack entries
+    my @k = ();
+    for (my $j = 0; $j < $d; $j++) {
+      my $pc = $slots->get($i+$j);
+      # Subtract one from caller pc so we map back to call instr.
+      $pc--;
+      $pc = sprintf("%0*x", $address_length, $pc);
+      $pcs->{$pc} = 1;
+      push @k, $pc;
+    }
+
+    AddEntry($profile, (join "\n", @k), $n);
+    $i += $d;
+  }
+
+  # Parse map
+  my $map = '';
+  seek(PROFILE, $i * 4, 0);
+  read(PROFILE, $map, (stat PROFILE)[7]);
+
+  my $r = {};
+  $r->{version} = $version;
+  $r->{period} = $period;
+  $r->{profile} = $profile;
+  $r->{libs} = ParseLibraries($prog, $map, $pcs);
+  $r->{pcs} = $pcs;
+
+  return $r;
+}
+
+sub HeapProfileIndex {
+  my $index = 1;
+  if ($main::opt_inuse_space) {
+    $index = 1;
+  } elsif ($main::opt_inuse_objects) {
+    $index = 0;
+  } elsif ($main::opt_alloc_space) {
+    $index = 3;
+  } elsif ($main::opt_alloc_objects) {
+    $index = 2;
+  }
+  return $index;
+}
+
+sub ReadMappedLibraries {
+  my $fh = shift;
+  my $map = "";
+  # Read the /proc/self/maps data
+  while (<$fh>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    $map .= $_;
+  }
+  return $map;
+}
+
+sub ReadMemoryMap {
+  my $fh = shift;
+  my $map = "";
+  # Read /proc/self/maps data as formatted by DumpAddressMap()
+  my $buildvar = "";
+  while (<PROFILE>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    # Parse "build=<dir>" specification if supplied
+    if (m/^\s*build=(.*)\n/) {
+      $buildvar = $1;
+    }
+
+    # Expand "$build" variable if available
+    $_ =~ s/\$build\b/$buildvar/g;
+
+    $map .= $_;
+  }
+  return $map;
+}
+
+sub AdjustSamples {
+  my ($sample_adjustment, $sampling_algorithm, $n1, $s1, $n2, $s2) = @_;
+  if ($sample_adjustment) {
+    if ($sampling_algorithm == 2) {
+      # Remote-heap version 2
+      # The sampling frequency is the rate of a Poisson process.
+      # This means that the probability of sampling an allocation of
+      # size X with sampling rate Y is 1 - exp(-X/Y)
+      if ($n1 != 0) {
+        my $ratio = (($s1*1.0)/$n1)/($sample_adjustment);
+        my $scale_factor = 1/(1 - exp(-$ratio));
+        $n1 *= $scale_factor;
+        $s1 *= $scale_factor;
+      }
+      if ($n2 != 0) {
+        my $ratio = (($s2*1.0)/$n2)/($sample_adjustment);
+        my $scale_factor = 1/(1 - exp(-$ratio));
+        $n2 *= $scale_factor;
+        $s2 *= $scale_factor;
+      }
+    } else {
+      # Remote-heap version 1
+      my $ratio;
+      $ratio = (($s1*1.0)/$n1)/($sample_adjustment);
+      if ($ratio < 1) {
+        $n1 /= $ratio;
+        $s1 /= $ratio;
+      }
+      $ratio = (($s2*1.0)/$n2)/($sample_adjustment);
+      if ($ratio < 1) {
+        $n2 /= $ratio;
+        $s2 /= $ratio;
+      }
+    }
+  }
+  return ($n1, $s1, $n2, $s2);
+}
+
+sub ReadHeapProfile {
+  my $prog = shift;
+  local *PROFILE = shift;
+  my $header = shift;
+
+  my $index = HeapProfileIndex();
+
+  # Find the type of this profile.  The header line looks like:
+  #    heap profile:   1246:  8800744 [  1246:  8800744] @ <heap-url>/266053
+  # There are two pairs <count: size>, the first inuse objects/space, and the
+  # second allocated objects/space.  This is followed optionally by a profile
+  # type, and if that is present, optionally by a sampling frequency.
+  # For remote heap profiles (v1):
+  # The interpretation of the sampling frequency is that the profiler, for
+  # each sample, calculates a uniformly distributed random integer less than
+  # the given value, and records the next sample after that many bytes have
+  # been allocated.  Therefore, the expected sample interval is half of the
+  # given frequency.  By default, if not specified, the expected sample
+  # interval is 128KB.  Only remote-heap-page profiles are adjusted for
+  # sample size.
+  # For remote heap profiles (v2):
+  # The sampling frequency is the rate of a Poisson process. This means that
+  # the probability of sampling an allocation of size X with sampling rate Y
+  # is 1 - exp(-X/Y)
+  # For version 2, a typical header line might look like this:
+  # heap profile:   1922: 127792360 [  1922: 127792360] @ <heap-url>_v2/524288
+  # the trailing number (524288) is the sampling rate. (Version 1 showed
+  # double the 'rate' here)
+  my $sampling_algorithm = 0;
+  my $sample_adjustment = 0;
+  chomp($header);
+  my $type = "unknown";
+  if ($header =~ m"^heap profile:\s*(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\](\s*@\s*([^/]*)(/(\d+))?)?") {
+    if (defined($6) && ($6 ne '')) {
+      $type = $6;
+      my $sample_period = $8;
+      # $type is "heapprofile" for profiles generated by the
+      # heap-profiler, and either "heap" or "heap_v2" for profiles
+      # generated by sampling directly within tcmalloc.  It can also
+      # be "growth" for heap-growth profiles.  The first is typically
+      # found for profiles generated locally, and the others for
+      # remote profiles.
+      if (($type eq "heapprofile") || ($type !~ /heap/) ) {
+        # No need to adjust for the sampling rate with heap-profiler-derived data
+        $sampling_algorithm = 0;
+      } elsif ($type =~ /_v2/) {
+        $sampling_algorithm = 2;     # version 2 sampling
+        if (defined($sample_period) && ($sample_period ne '')) {
+          $sample_adjustment = int($sample_period);
+        }
+      } else {
+        $sampling_algorithm = 1;     # version 1 sampling
+        if (defined($sample_period) && ($sample_period ne '')) {
+          $sample_adjustment = int($sample_period)/2;
+        }
+      }
+    } else {
+      # We detect whether or not this is a remote-heap profile by checking
+      # that the total-allocated stats ($n2,$s2) are exactly the
+      # same as the in-use stats ($n1,$s1).  It is remotely conceivable
+      # that a non-remote-heap profile may pass this check, but it is hard
+      # to imagine how that could happen.
+      # In this case it's so old it's guaranteed to be remote-heap version 1.
+      my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4);
+      if (($n1 == $n2) && ($s1 == $s2)) {
+        # This is likely to be a remote-heap based sample profile
+        $sampling_algorithm = 1;
+      }
+    }
+  }
+
+  if ($sampling_algorithm > 0) {
+    # For remote-heap generated profiles, adjust the counts and sizes to
+    # account for the sample rate (we sample once every 128KB by default).
+    if ($sample_adjustment == 0) {
+      # Turn on profile adjustment.
+      $sample_adjustment = 128*1024;
+      print STDERR "Adjusting heap profiles for 1-in-128KB sampling rate\n";
+    } else {
+      printf STDERR ("Adjusting heap profiles for 1-in-%d sampling rate\n",
+                     $sample_adjustment);
+    }
+    if ($sampling_algorithm > 1) {
+      # We don't bother printing anything for the original version (version 1)
+      printf STDERR "Heap version $sampling_algorithm\n";
+    }
+  }
+
+  my $profile = {};
+  my $pcs = {};
+  my $map = "";
+
+  while (<PROFILE>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    if (/^MAPPED_LIBRARIES:/) {
+      $map .= ReadMappedLibraries(*PROFILE);
+      last;
+    }
+
+    if (/^--- Memory map:/) {
+      $map .= ReadMemoryMap(*PROFILE);
+      last;
+    }
+
+    # Read entry of the form:
+    #  <count1>: <bytes1> [<count2>: <bytes2>] @ a1 a2 a3 ... an
+    s/^\s*//;
+    s/\s*$//;
+    if (m/^\s*(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\]\s+@\s+(.*)$/) {
+      my $stack = $5;
+      my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4);
+      my @counts = AdjustSamples($sample_adjustment, $sampling_algorithm,
+                                 $n1, $s1, $n2, $s2);
+      AddEntries($profile, $pcs, FixCallerAddresses($stack), $counts[$index]);
+    }
+  }
+
+  my $r = {};
+  $r->{version} = "heap";
+  $r->{period} = 1;
+  $r->{profile} = $profile;
+  $r->{libs} = ParseLibraries($prog, $map, $pcs);
+  $r->{pcs} = $pcs;
+  return $r;
+}
+
+sub ReadThreadedHeapProfile {
+  my ($prog, $fname, $header) = @_;
+
+  my $index = HeapProfileIndex();
+  my $sampling_algorithm = 0;
+  my $sample_adjustment = 0;
+  chomp($header);
+  my $type = "unknown";
+  # Assuming a very specific type of header for now.
+  if ($header =~ m"^heap_v2/(\d+)") {
+    $type = "_v2";
+    $sampling_algorithm = 2;
+    $sample_adjustment = int($1);
+  }
+  if ($type ne "_v2" || !defined($sample_adjustment)) {
+    die "Threaded heap profiles require v2 sampling with a sample rate\n";
+  }
+
+  my $profile = {};
+  my $thread_profiles = {};
+  my $pcs = {};
+  my $map = "";
+  my $stack = "";
+
+  while (<PROFILE>) {
+    s/\r//g;
+    if (/^MAPPED_LIBRARIES:/) {
+      $map .= ReadMappedLibraries(*PROFILE);
+      last;
+    }
+
+    if (/^--- Memory map:/) {
+      $map .= ReadMemoryMap(*PROFILE);
+      last;
+    }
+
+    # Read entry of the form:
+    # @ a1 a2 ... an
+    #   t*: <count1>: <bytes1> [<count2>: <bytes2>]
+    #   t1: <count1>: <bytes1> [<count2>: <bytes2>]
+    #     ...
+    #   tn: <count1>: <bytes1> [<count2>: <bytes2>]
+    s/^\s*//;
+    s/\s*$//;
+    if (m/^@\s+(.*)$/) {
+      $stack = $1;
+    } elsif (m/^\s*(t(\*|\d+)):\s+(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\]$/) {
+      if ($stack eq "") {
+        # Still in the header, so this is just a per-thread summary.
+        next;
+      }
+      my $thread = $2;
+      my ($n1, $s1, $n2, $s2) = ($3, $4, $5, $6);
+      my @counts = AdjustSamples($sample_adjustment, $sampling_algorithm,
+                                 $n1, $s1, $n2, $s2);
+      if ($thread eq "*") {
+        AddEntries($profile, $pcs, FixCallerAddresses($stack), $counts[$index]);
+      } else {
+        if (!exists($thread_profiles->{$thread})) {
+          $thread_profiles->{$thread} = {};
+        }
+        AddEntries($thread_profiles->{$thread}, $pcs,
+                   FixCallerAddresses($stack), $counts[$index]);
+      }
+    }
+  }
+
+  my $r = {};
+  $r->{version} = "heap";
+  $r->{period} = 1;
+  $r->{profile} = $profile;
+  $r->{threads} = $thread_profiles;
+  $r->{libs} = ParseLibraries($prog, $map, $pcs);
+  $r->{pcs} = $pcs;
+  return $r;
+}
+
+sub ReadSynchProfile {
+  my $prog = shift;
+  local *PROFILE = shift;
+  my $header = shift;
+
+  my $map = '';
+  my $profile = {};
+  my $pcs = {};
+  my $sampling_period = 1;
+  my $cyclespernanosec = 2.8;   # Default assumption for old binaries
+  my $seen_clockrate = 0;
+  my $line;
+
+  my $index = 0;
+  if ($main::opt_total_delay) {
+    $index = 0;
+  } elsif ($main::opt_contentions) {
+    $index = 1;
+  } elsif ($main::opt_mean_delay) {
+    $index = 2;
+  }
+
+  while ( $line = <PROFILE> ) {
+    $line =~ s/\r//g;      # turn windows-looking lines into unix-looking lines
+    if ( $line =~ /^\s*(\d+)\s+(\d+) \@\s*(.*?)\s*$/ ) {
+      my ($cycles, $count, $stack) = ($1, $2, $3);
+
+      # Convert cycles to nanoseconds
+      $cycles /= $cyclespernanosec;
+
+      # Adjust for sampling done by application
+      $cycles *= $sampling_period;
+      $count *= $sampling_period;
+
+      my @values = ($cycles, $count, $cycles / $count);
+      AddEntries($profile, $pcs, FixCallerAddresses($stack), $values[$index]);
+
+    } elsif ( $line =~ /^(slow release).*thread \d+  \@\s*(.*?)\s*$/ ||
+              $line =~ /^\s*(\d+) \@\s*(.*?)\s*$/ ) {
+      my ($cycles, $stack) = ($1, $2);
+      if ($cycles !~ /^\d+$/) {
+        next;
+      }
+
+      # Convert cycles to nanoseconds
+      $cycles /= $cyclespernanosec;
+
+      # Adjust for sampling done by application
+      $cycles *= $sampling_period;
+
+      AddEntries($profile, $pcs, FixCallerAddresses($stack), $cycles);
+
+    } elsif ( $line =~ m/^([a-z][^=]*)=(.*)$/ ) {
+      my ($variable, $value) = ($1,$2);
+      for ($variable, $value) {
+        s/^\s+//;
+        s/\s+$//;
+      }
+      if ($variable eq "cycles/second") {
+        $cyclespernanosec = $value / 1e9;
+        $seen_clockrate = 1;
+      } elsif ($variable eq "sampling period") {
+        $sampling_period = $value;
+      } elsif ($variable eq "ms since reset") {
+        # Currently nothing is done with this value in jeprof
+        # So we just silently ignore it for now
+      } elsif ($variable eq "discarded samples") {
+        # Currently nothing is done with this value in jeprof
+        # So we just silently ignore it for now
+      } else {
+        printf STDERR ("Ignoring unnknown variable in /contention output: " .
+                       "'%s' = '%s'\n",$variable,$value);
+      }
+    } else {
+      # Memory map entry
+      $map .= $line;
+    }
+  }
+
+  if (!$seen_clockrate) {
+    printf STDERR ("No cycles/second entry in profile; Guessing %.1f GHz\n",
+                   $cyclespernanosec);
+  }
+
+  my $r = {};
+  $r->{version} = 0;
+  $r->{period} = $sampling_period;
+  $r->{profile} = $profile;
+  $r->{libs} = ParseLibraries($prog, $map, $pcs);
+  $r->{pcs} = $pcs;
+  return $r;
+}
+
+# Given a hex value in the form "0x1abcd" or "1abcd", return either
+# "0001abcd" or "000000000001abcd", depending on the current (global)
+# address length.
+sub HexExtend {
+  my $addr = shift;
+
+  $addr =~ s/^(0x)?0*//;
+  my $zeros_needed = $address_length - length($addr);
+  if ($zeros_needed < 0) {
+    printf STDERR "Warning: address $addr is longer than address length $address_length\n";
+    return $addr;
+  }
+  return ("0" x $zeros_needed) . $addr;
+}
+
+##### Symbol extraction #####
+
+# Aggressively search the lib_prefix values for the given library
+# If all else fails, just return the name of the library unmodified.
+# If the lib_prefix is "/my/path,/other/path" and $file is "/lib/dir/mylib.so"
+# it will search the following locations in this order, until it finds a file:
+#   /my/path/lib/dir/mylib.so
+#   /other/path/lib/dir/mylib.so
+#   /my/path/dir/mylib.so
+#   /other/path/dir/mylib.so
+#   /my/path/mylib.so
+#   /other/path/mylib.so
+#   /lib/dir/mylib.so              (returned as last resort)
+sub FindLibrary {
+  my $file = shift;
+  my $suffix = $file;
+
+  # Search for the library as described above
+  do {
+    foreach my $prefix (@prefix_list) {
+      my $fullpath = $prefix . $suffix;
+      if (-e $fullpath) {
+        return $fullpath;
+      }
+    }
+  } while ($suffix =~ s|^/[^/]+/|/|);
+  return $file;
+}
+
+# Return path to library with debugging symbols.
+# For libc libraries, the copy in /usr/lib/debug contains debugging symbols
+sub DebuggingLibrary {
+  my $file = shift;
+  if ($file =~ m|^/|) {
+      if (-f "/usr/lib/debug$file") {
+        return "/usr/lib/debug$file";
+      } elsif (-f "/usr/lib/debug$file.debug") {
+        return "/usr/lib/debug$file.debug";
+      }
+  }
+  return undef;
+}
+
+# Parse text section header of a library using objdump
+sub ParseTextSectionHeaderFromObjdump {
+  my $lib = shift;
+
+  my $size = undef;
+  my $vma;
+  my $file_offset;
+  # Get objdump output from the library file to figure out how to
+  # map between mapped addresses and addresses in the library.
+  my $cmd = ShellEscape($obj_tool_map{"objdump"}, "-h", $lib);
+  open(OBJDUMP, "$cmd |") || error("$cmd: $!\n");
+  while (<OBJDUMP>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    # Idx Name          Size      VMA       LMA       File off  Algn
+    #  10 .text         00104b2c  420156f0  420156f0  000156f0  2**4
+    # For 64-bit objects, VMA and LMA will be 16 hex digits, size and file
+    # offset may still be 8.  But AddressSub below will still handle that.
+    my @x = split;
+    if (($#x >= 6) && ($x[1] eq '.text')) {
+      $size = $x[2];
+      $vma = $x[3];
+      $file_offset = $x[5];
+      last;
+    }
+  }
+  close(OBJDUMP);
+
+  if (!defined($size)) {
+    return undef;
+  }
+
+  my $r = {};
+  $r->{size} = $size;
+  $r->{vma} = $vma;
+  $r->{file_offset} = $file_offset;
+
+  return $r;
+}
+
+# Parse text section header of a library using otool (on OS X)
+sub ParseTextSectionHeaderFromOtool {
+  my $lib = shift;
+
+  my $size = undef;
+  my $vma = undef;
+  my $file_offset = undef;
+  # Get otool output from the library file to figure out how to
+  # map between mapped addresses and addresses in the library.
+  my $command = ShellEscape($obj_tool_map{"otool"}, "-l", $lib);
+  open(OTOOL, "$command |") || error("$command: $!\n");
+  my $cmd = "";
+  my $sectname = "";
+  my $segname = "";
+  foreach my $line (<OTOOL>) {
+    $line =~ s/\r//g;      # turn windows-looking lines into unix-looking lines
+    # Load command <#>
+    #       cmd LC_SEGMENT
+    # [...]
+    # Section
+    #   sectname __text
+    #    segname __TEXT
+    #       addr 0x000009f8
+    #       size 0x00018b9e
+    #     offset 2552
+    #      align 2^2 (4)
+    # We will need to strip off the leading 0x from the hex addresses,
+    # and convert the offset into hex.
+    if ($line =~ /Load command/) {
+      $cmd = "";
+      $sectname = "";
+      $segname = "";
+    } elsif ($line =~ /Section/) {
+      $sectname = "";
+      $segname = "";
+    } elsif ($line =~ /cmd (\w+)/) {
+      $cmd = $1;
+    } elsif ($line =~ /sectname (\w+)/) {
+      $sectname = $1;
+    } elsif ($line =~ /segname (\w+)/) {
+      $segname = $1;
+    } elsif (!(($cmd eq "LC_SEGMENT" || $cmd eq "LC_SEGMENT_64") &&
+               $sectname eq "__text" &&
+               $segname eq "__TEXT")) {
+      next;
+    } elsif ($line =~ /\baddr 0x([0-9a-fA-F]+)/) {
+      $vma = $1;
+    } elsif ($line =~ /\bsize 0x([0-9a-fA-F]+)/) {
+      $size = $1;
+    } elsif ($line =~ /\boffset ([0-9]+)/) {
+      $file_offset = sprintf("%016x", $1);
+    }
+    if (defined($vma) && defined($size) && defined($file_offset)) {
+      last;
+    }
+  }
+  close(OTOOL);
+
+  if (!defined($vma) || !defined($size) || !defined($file_offset)) {
+     return undef;
+  }
+
+  my $r = {};
+  $r->{size} = $size;
+  $r->{vma} = $vma;
+  $r->{file_offset} = $file_offset;
+
+  return $r;
+}
+
+sub ParseTextSectionHeader {
+  # obj_tool_map("otool") is only defined if we're in a Mach-O environment
+  if (defined($obj_tool_map{"otool"})) {
+    my $r = ParseTextSectionHeaderFromOtool(@_);
+    if (defined($r)){
+      return $r;
+    }
+  }
+  # If otool doesn't work, or we don't have it, fall back to objdump
+  return ParseTextSectionHeaderFromObjdump(@_);
+}
+
+# Split /proc/pid/maps dump into a list of libraries
+sub ParseLibraries {
+  return if $main::use_symbol_page;  # We don't need libraries info.
+  my $prog = Cwd::abs_path(shift);
+  my $map = shift;
+  my $pcs = shift;
+
+  my $result = [];
+  my $h = "[a-f0-9]+";
+  my $zero_offset = HexExtend("0");
+
+  my $buildvar = "";
+  foreach my $l (split("\n", $map)) {
+    if ($l =~ m/^\s*build=(.*)$/) {
+      $buildvar = $1;
+    }
+
+    my $start;
+    my $finish;
+    my $offset;
+    my $lib;
+    if ($l =~ /^($h)-($h)\s+..x.\s+($h)\s+\S+:\S+\s+\d+\s+(\S+\.(so|dll|dylib|bundle)((\.\d+)+\w*(\.\d+){0,3})?)$/i) {
+      # Full line from /proc/self/maps.  Example:
+      #   40000000-40015000 r-xp 00000000 03:01 12845071   /lib/ld-2.3.2.so
+      $start = HexExtend($1);
+      $finish = HexExtend($2);
+      $offset = HexExtend($3);
+      $lib = $4;
+      $lib =~ s|\\|/|g;     # turn windows-style paths into unix-style paths
+    } elsif ($l =~ /^\s*($h)-($h):\s*(\S+\.so(\.\d+)*)/) {
+      # Cooked line from DumpAddressMap.  Example:
+      #   40000000-40015000: /lib/ld-2.3.2.so
+      $start = HexExtend($1);
+      $finish = HexExtend($2);
+      $offset = $zero_offset;
+      $lib = $3;
+    } elsif (($l =~ /^($h)-($h)\s+..x.\s+($h)\s+\S+:\S+\s+\d+\s+(\S+)$/i) && ($4 eq $prog)) {
+      # PIEs and address space randomization do not play well with our
+      # default assumption that main executable is at lowest
+      # addresses. So we're detecting main executable in
+      # /proc/self/maps as well.
+      $start = HexExtend($1);
+      $finish = HexExtend($2);
+      $offset = HexExtend($3);
+      $lib = $4;
+      $lib =~ s|\\|/|g;     # turn windows-style paths into unix-style paths
+    }
+    # FreeBSD 10.0 virtual memory map /proc/curproc/map as defined in
+    # function procfs_doprocmap (sys/fs/procfs/procfs_map.c)
+    #
+    # Example:
+    # 0x800600000 0x80061a000 26 0 0xfffff800035a0000 r-x 75 33 0x1004 COW NC vnode /libexec/ld-elf.s
+    # o.1 NCH -1
+    elsif ($l =~ /^(0x$h)\s(0x$h)\s\d+\s\d+\s0x$h\sr-x\s\d+\s\d+\s0x\d+\s(COW|NCO)\s(NC|NNC)\svnode\s(\S+\.so(\.\d+)*)/) {
+      $start = HexExtend($1);
+      $finish = HexExtend($2);
+      $offset = $zero_offset;
+      $lib = FindLibrary($5);
+
+    } else {
+      next;
+    }
+
+    # Expand "$build" variable if available
+    $lib =~ s/\$build\b/$buildvar/g;
+
+    $lib = FindLibrary($lib);
+
+    # Check for pre-relocated libraries, which use pre-relocated symbol tables
+    # and thus require adjusting the offset that we'll use to translate
+    # VM addresses into symbol table addresses.
+    # Only do this if we're not going to fetch the symbol table from a
+    # debugging copy of the library.
+    if (!DebuggingLibrary($lib)) {
+      my $text = ParseTextSectionHeader($lib);
+      if (defined($text)) {
+         my $vma_offset = AddressSub($text->{vma}, $text->{file_offset});
+         $offset = AddressAdd($offset, $vma_offset);
+      }
+    }
+
+    if($main::opt_debug) { printf STDERR "$start:$finish ($offset) $lib\n"; }
+    push(@{$result}, [$lib, $start, $finish, $offset]);
+  }
+
+  # Append special entry for additional library (not relocated)
+  if ($main::opt_lib ne "") {
+    my $text = ParseTextSectionHeader($main::opt_lib);
+    if (defined($text)) {
+       my $start = $text->{vma};
+       my $finish = AddressAdd($start, $text->{size});
+
+       push(@{$result}, [$main::opt_lib, $start, $finish, $start]);
+    }
+  }
+
+  # Append special entry for the main program.  This covers
+  # 0..max_pc_value_seen, so that we assume pc values not found in one
+  # of the library ranges will be treated as coming from the main
+  # program binary.
+  my $min_pc = HexExtend("0");
+  my $max_pc = $min_pc;          # find the maximal PC value in any sample
+  foreach my $pc (keys(%{$pcs})) {
+    if (HexExtend($pc) gt $max_pc) { $max_pc = HexExtend($pc); }
+  }
+  push(@{$result}, [$prog, $min_pc, $max_pc, $zero_offset]);
+
+  return $result;
+}
+
+# Add two hex addresses of length $address_length.
+# Run jeprof --test for unit test if this is changed.
+sub AddressAdd {
+  my $addr1 = shift;
+  my $addr2 = shift;
+  my $sum;
+
+  if ($address_length == 8) {
+    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
+    $sum = (hex($addr1)+hex($addr2)) % (0x10000000 * 16);
+    return sprintf("%08x", $sum);
+
+  } else {
+    # Do the addition in 7-nibble chunks to trivialize carry handling.
+
+    if ($main::opt_debug and $main::opt_test) {
+      print STDERR "AddressAdd $addr1 + $addr2 = ";
+    }
+
+    my $a1 = substr($addr1,-7);
+    $addr1 = substr($addr1,0,-7);
+    my $a2 = substr($addr2,-7);
+    $addr2 = substr($addr2,0,-7);
+    $sum = hex($a1) + hex($a2);
+    my $c = 0;
+    if ($sum > 0xfffffff) {
+      $c = 1;
+      $sum -= 0x10000000;
+    }
+    my $r = sprintf("%07x", $sum);
+
+    $a1 = substr($addr1,-7);
+    $addr1 = substr($addr1,0,-7);
+    $a2 = substr($addr2,-7);
+    $addr2 = substr($addr2,0,-7);
+    $sum = hex($a1) + hex($a2) + $c;
+    $c = 0;
+    if ($sum > 0xfffffff) {
+      $c = 1;
+      $sum -= 0x10000000;
+    }
+    $r = sprintf("%07x", $sum) . $r;
+
+    $sum = hex($addr1) + hex($addr2) + $c;
+    if ($sum > 0xff) { $sum -= 0x100; }
+    $r = sprintf("%02x", $sum) . $r;
+
+    if ($main::opt_debug and $main::opt_test) { print STDERR "$r\n"; }
+
+    return $r;
+  }
+}
+
+
+# Subtract two hex addresses of length $address_length.
+# Run jeprof --test for unit test if this is changed.
+sub AddressSub {
+  my $addr1 = shift;
+  my $addr2 = shift;
+  my $diff;
+
+  if ($address_length == 8) {
+    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
+    $diff = (hex($addr1)-hex($addr2)) % (0x10000000 * 16);
+    return sprintf("%08x", $diff);
+
+  } else {
+    # Do the addition in 7-nibble chunks to trivialize borrow handling.
+    # if ($main::opt_debug) { print STDERR "AddressSub $addr1 - $addr2 = "; }
+
+    my $a1 = hex(substr($addr1,-7));
+    $addr1 = substr($addr1,0,-7);
+    my $a2 = hex(substr($addr2,-7));
+    $addr2 = substr($addr2,0,-7);
+    my $b = 0;
+    if ($a2 > $a1) {
+      $b = 1;
+      $a1 += 0x10000000;
+    }
+    $diff = $a1 - $a2;
+    my $r = sprintf("%07x", $diff);
+
+    $a1 = hex(substr($addr1,-7));
+    $addr1 = substr($addr1,0,-7);
+    $a2 = hex(substr($addr2,-7)) + $b;
+    $addr2 = substr($addr2,0,-7);
+    $b = 0;
+    if ($a2 > $a1) {
+      $b = 1;
+      $a1 += 0x10000000;
+    }
+    $diff = $a1 - $a2;
+    $r = sprintf("%07x", $diff) . $r;
+
+    $a1 = hex($addr1);
+    $a2 = hex($addr2) + $b;
+    if ($a2 > $a1) { $a1 += 0x100; }
+    $diff = $a1 - $a2;
+    $r = sprintf("%02x", $diff) . $r;
+
+    # if ($main::opt_debug) { print STDERR "$r\n"; }
+
+    return $r;
+  }
+}
+
+# Increment a hex addresses of length $address_length.
+# Run jeprof --test for unit test if this is changed.
+sub AddressInc {
+  my $addr = shift;
+  my $sum;
+
+  if ($address_length == 8) {
+    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
+    $sum = (hex($addr)+1) % (0x10000000 * 16);
+    return sprintf("%08x", $sum);
+
+  } else {
+    # Do the addition in 7-nibble chunks to trivialize carry handling.
+    # We are always doing this to step through the addresses in a function,
+    # and will almost never overflow the first chunk, so we check for this
+    # case and exit early.
+
+    # if ($main::opt_debug) { print STDERR "AddressInc $addr1 = "; }
+
+    my $a1 = substr($addr,-7);
+    $addr = substr($addr,0,-7);
+    $sum = hex($a1) + 1;
+    my $r = sprintf("%07x", $sum);
+    if ($sum <= 0xfffffff) {
+      $r = $addr . $r;
+      # if ($main::opt_debug) { print STDERR "$r\n"; }
+      return HexExtend($r);
+    } else {
+      $r = "0000000";
+    }
+
+    $a1 = substr($addr,-7);
+    $addr = substr($addr,0,-7);
+    $sum = hex($a1) + 1;
+    $r = sprintf("%07x", $sum) . $r;
+    if ($sum <= 0xfffffff) {
+      $r = $addr . $r;
+      # if ($main::opt_debug) { print STDERR "$r\n"; }
+      return HexExtend($r);
+    } else {
+      $r = "00000000000000";
+    }
+
+    $sum = hex($addr) + 1;
+    if ($sum > 0xff) { $sum -= 0x100; }
+    $r = sprintf("%02x", $sum) . $r;
+
+    # if ($main::opt_debug) { print STDERR "$r\n"; }
+    return $r;
+  }
+}
+
+# Extract symbols for all PC values found in profile
+sub ExtractSymbols {
+  my $libs = shift;
+  my $pcset = shift;
+
+  my $symbols = {};
+
+  # Map each PC value to the containing library.  To make this faster,
+  # we sort libraries by their starting pc value (highest first), and
+  # advance through the libraries as we advance the pc.  Sometimes the
+  # addresses of libraries may overlap with the addresses of the main
+  # binary, so to make sure the libraries 'win', we iterate over the
+  # libraries in reverse order (which assumes the binary doesn't start
+  # in the middle of a library, which seems a fair assumption).
+  my @pcs = (sort { $a cmp $b } keys(%{$pcset}));  # pcset is 0-extended strings
+  foreach my $lib (sort {$b->[1] cmp $a->[1]} @{$libs}) {
+    my $libname = $lib->[0];
+    my $start = $lib->[1];
+    my $finish = $lib->[2];
+    my $offset = $lib->[3];
+
+    # Use debug library if it exists
+    my $debug_libname = DebuggingLibrary($libname);
+    if ($debug_libname) {
+        $libname = $debug_libname;
+    }
+
+    # Get list of pcs that belong in this library.
+    my $contained = [];
+    my ($start_pc_index, $finish_pc_index);
+    # Find smallest finish_pc_index such that $finish < $pc[$finish_pc_index].
+    for ($finish_pc_index = $#pcs + 1; $finish_pc_index > 0;
+         $finish_pc_index--) {
+      last if $pcs[$finish_pc_index - 1] le $finish;
+    }
+    # Find smallest start_pc_index such that $start <= $pc[$start_pc_index].
+    for ($start_pc_index = $finish_pc_index; $start_pc_index > 0;
+         $start_pc_index--) {
+      last if $pcs[$start_pc_index - 1] lt $start;
+    }
+    # This keeps PC values higher than $pc[$finish_pc_index] in @pcs,
+    # in case there are overlaps in libraries and the main binary.
+    @{$contained} = splice(@pcs, $start_pc_index,
+                           $finish_pc_index - $start_pc_index);
+    # Map to symbols
+    MapToSymbols($libname, AddressSub($start, $offset), $contained, $symbols);
+  }
+
+  return $symbols;
+}
+
+# Map list of PC values to symbols for a given image
+sub MapToSymbols {
+  my $image = shift;
+  my $offset = shift;
+  my $pclist = shift;
+  my $symbols = shift;
+
+  my $debug = 0;
+
+  # Ignore empty binaries
+  if ($#{$pclist} < 0) { return; }
+
+  # Figure out the addr2line command to use
+  my $addr2line = $obj_tool_map{"addr2line"};
+  my $cmd = ShellEscape($addr2line, "-f", "-C", "-e", $image);
+  if (exists $obj_tool_map{"addr2line_pdb"}) {
+    $addr2line = $obj_tool_map{"addr2line_pdb"};
+    $cmd = ShellEscape($addr2line, "--demangle", "-f", "-C", "-e", $image);
+  }
+
+  # If "addr2line" isn't installed on the system at all, just use
+  # nm to get what info we can (function names, but not line numbers).
+  if (system(ShellEscape($addr2line, "--help") . " >$dev_null 2>&1") != 0) {
+    MapSymbolsWithNM($image, $offset, $pclist, $symbols);
+    return;
+  }
+
+  # "addr2line -i" can produce a variable number of lines per input
+  # address, with no separator that allows us to tell when data for
+  # the next address starts.  So we find the address for a special
+  # symbol (_fini) and interleave this address between all real
+  # addresses passed to addr2line.  The name of this special symbol
+  # can then be used as a separator.
+  $sep_address = undef;  # May be filled in by MapSymbolsWithNM()
+  my $nm_symbols = {};
+  MapSymbolsWithNM($image, $offset, $pclist, $nm_symbols);
+  if (defined($sep_address)) {
+    # Only add " -i" to addr2line if the binary supports it.
+    # addr2line --help returns 0, but not if it sees an unknown flag first.
+    if (system("$cmd -i --help >$dev_null 2>&1") == 0) {
+      $cmd .= " -i";
+    } else {
+      $sep_address = undef;   # no need for sep_address if we don't support -i
+    }
+  }
+
+  # Make file with all PC values with intervening 'sep_address' so
+  # that we can reliably detect the end of inlined function list
+  open(ADDRESSES, ">$main::tmpfile_sym") || error("$main::tmpfile_sym: $!\n");
+  if ($debug) { print("---- $image ---\n"); }
+  for (my $i = 0; $i <= $#{$pclist}; $i++) {
+    # addr2line always reads hex addresses, and does not need '0x' prefix.
+    if ($debug) { printf STDERR ("%s\n", $pclist->[$i]); }
+    printf ADDRESSES ("%s\n", AddressSub($pclist->[$i], $offset));
+    if (defined($sep_address)) {
+      printf ADDRESSES ("%s\n", $sep_address);
+    }
+  }
+  close(ADDRESSES);
+  if ($debug) {
+    print("----\n");
+    system("cat", $main::tmpfile_sym);
+    print("----\n");
+    system("$cmd < " . ShellEscape($main::tmpfile_sym));
+    print("----\n");
+  }
+
+  open(SYMBOLS, "$cmd <" . ShellEscape($main::tmpfile_sym) . " |")
+      || error("$cmd: $!\n");
+  my $count = 0;   # Index in pclist
+  while (<SYMBOLS>) {
+    # Read fullfunction and filelineinfo from next pair of lines
+    s/\r?\n$//g;
+    my $fullfunction = $_;
+    $_ = <SYMBOLS>;
+    s/\r?\n$//g;
+    my $filelinenum = $_;
+
+    if (defined($sep_address) && $fullfunction eq $sep_symbol) {
+      # Terminating marker for data for this address
+      $count++;
+      next;
+    }
+
+    $filelinenum =~ s|\\|/|g; # turn windows-style paths into unix-style paths
+
+    my $pcstr = $pclist->[$count];
+    my $function = ShortFunctionName($fullfunction);
+    my $nms = $nm_symbols->{$pcstr};
+    if (defined($nms)) {
+      if ($fullfunction eq '??') {
+        # nm found a symbol for us.
+        $function = $nms->[0];
+        $fullfunction = $nms->[2];
+      } else {
+	# MapSymbolsWithNM tags each routine with its starting address,
+	# useful in case the image has multiple occurrences of this
+	# routine.  (It uses a syntax that resembles template paramters,
+	# that are automatically stripped out by ShortFunctionName().)
+	# addr2line does not provide the same information.  So we check
+	# if nm disambiguated our symbol, and if so take the annotated
+	# (nm) version of the routine-name.  TODO(csilvers): this won't
+	# catch overloaded, inlined symbols, which nm doesn't see.
+	# Better would be to do a check similar to nm's, in this fn.
+	if ($nms->[2] =~ m/^\Q$function\E/) {  # sanity check it's the right fn
+	  $function = $nms->[0];
+	  $fullfunction = $nms->[2];
+	}
+      }
+    }
+
+    # Prepend to accumulated symbols for pcstr
+    # (so that caller comes before callee)
+    my $sym = $symbols->{$pcstr};
+    if (!defined($sym)) {
+      $sym = [];
+      $symbols->{$pcstr} = $sym;
+    }
+    unshift(@{$sym}, $function, $filelinenum, $fullfunction);
+    if ($debug) { printf STDERR ("%s => [%s]\n", $pcstr, join(" ", @{$sym})); }
+    if (!defined($sep_address)) {
+      # Inlining is off, so this entry ends immediately
+      $count++;
+    }
+  }
+  close(SYMBOLS);
+}
+
+# Use nm to map the list of referenced PCs to symbols.  Return true iff we
+# are able to read procedure information via nm.
+sub MapSymbolsWithNM {
+  my $image = shift;
+  my $offset = shift;
+  my $pclist = shift;
+  my $symbols = shift;
+
+  # Get nm output sorted by increasing address
+  my $symbol_table = GetProcedureBoundaries($image, ".");
+  if (!%{$symbol_table}) {
+    return 0;
+  }
+  # Start addresses are already the right length (8 or 16 hex digits).
+  my @names = sort { $symbol_table->{$a}->[0] cmp $symbol_table->{$b}->[0] }
+    keys(%{$symbol_table});
+
+  if ($#names < 0) {
+    # No symbols: just use addresses
+    foreach my $pc (@{$pclist}) {
+      my $pcstr = "0x" . $pc;
+      $symbols->{$pc} = [$pcstr, "?", $pcstr];
+    }
+    return 0;
+  }
+
+  # Sort addresses so we can do a join against nm output
+  my $index = 0;
+  my $fullname = $names[0];
+  my $name = ShortFunctionName($fullname);
+  foreach my $pc (sort { $a cmp $b } @{$pclist}) {
+    # Adjust for mapped offset
+    my $mpc = AddressSub($pc, $offset);
+    while (($index < $#names) && ($mpc ge $symbol_table->{$fullname}->[1])){
+      $index++;
+      $fullname = $names[$index];
+      $name = ShortFunctionName($fullname);
+    }
+    if ($mpc lt $symbol_table->{$fullname}->[1]) {
+      $symbols->{$pc} = [$name, "?", $fullname];
+    } else {
+      my $pcstr = "0x" . $pc;
+      $symbols->{$pc} = [$pcstr, "?", $pcstr];
+    }
+  }
+  return 1;
+}
+
+sub ShortFunctionName {
+  my $function = shift;
+  while ($function =~ s/\([^()]*\)(\s*const)?//g) { }   # Argument types
+  while ($function =~ s/<[^<>]*>//g)  { }    # Remove template arguments
+  $function =~ s/^.*\s+(\w+::)/$1/;          # Remove leading type
+  return $function;
+}
+
+# Trim overly long symbols found in disassembler output
+sub CleanDisassembly {
+  my $d = shift;
+  while ($d =~ s/\([^()%]*\)(\s*const)?//g) { } # Argument types, not (%rax)
+  while ($d =~ s/(\w+)<[^<>]*>/$1/g)  { }       # Remove template arguments
+  return $d;
+}
+
+# Clean file name for display
+sub CleanFileName {
+  my ($f) = @_;
+  $f =~ s|^/proc/self/cwd/||;
+  $f =~ s|^\./||;
+  return $f;
+}
+
+# Make address relative to section and clean up for display
+sub UnparseAddress {
+  my ($offset, $address) = @_;
+  $address = AddressSub($address, $offset);
+  $address =~ s/^0x//;
+  $address =~ s/^0*//;
+  return $address;
+}
+
+##### Miscellaneous #####
+
+# Find the right versions of the above object tools to use.  The
+# argument is the program file being analyzed, and should be an ELF
+# 32-bit or ELF 64-bit executable file.  The location of the tools
+# is determined by considering the following options in this order:
+#   1) --tools option, if set
+#   2) JEPROF_TOOLS environment variable, if set
+#   3) the environment
+sub ConfigureObjTools {
+  my $prog_file = shift;
+
+  # Check for the existence of $prog_file because /usr/bin/file does not
+  # predictably return error status in prod.
+  (-e $prog_file)  || error("$prog_file does not exist.\n");
+
+  my $file_type = undef;
+  if (-e "/usr/bin/file") {
+    # Follow symlinks (at least for systems where "file" supports that).
+    my $escaped_prog_file = ShellEscape($prog_file);
+    $file_type = `/usr/bin/file -L $escaped_prog_file 2>$dev_null ||
+                  /usr/bin/file $escaped_prog_file`;
+  } elsif ($^O == "MSWin32") {
+    $file_type = "MS Windows";
+  } else {
+    print STDERR "WARNING: Can't determine the file type of $prog_file";
+  }
+
+  if ($file_type =~ /64-bit/) {
+    # Change $address_length to 16 if the program file is ELF 64-bit.
+    # We can't detect this from many (most?) heap or lock contention
+    # profiles, since the actual addresses referenced are generally in low
+    # memory even for 64-bit programs.
+    $address_length = 16;
+  }
+
+  if ($file_type =~ /MS Windows/) {
+    # For windows, we provide a version of nm and addr2line as part of
+    # the opensource release, which is capable of parsing
+    # Windows-style PDB executables.  It should live in the path, or
+    # in the same directory as jeprof.
+    $obj_tool_map{"nm_pdb"} = "nm-pdb";
+    $obj_tool_map{"addr2line_pdb"} = "addr2line-pdb";
+  }
+
+  if ($file_type =~ /Mach-O/) {
+    # OS X uses otool to examine Mach-O files, rather than objdump.
+    $obj_tool_map{"otool"} = "otool";
+    $obj_tool_map{"addr2line"} = "false";  # no addr2line
+    $obj_tool_map{"objdump"} = "false";  # no objdump
+  }
+
+  # Go fill in %obj_tool_map with the pathnames to use:
+  foreach my $tool (keys %obj_tool_map) {
+    $obj_tool_map{$tool} = ConfigureTool($obj_tool_map{$tool});
+  }
+}
+
+# Returns the path of a caller-specified object tool.  If --tools or
+# JEPROF_TOOLS are specified, then returns the full path to the tool
+# with that prefix.  Otherwise, returns the path unmodified (which
+# means we will look for it on PATH).
+sub ConfigureTool {
+  my $tool = shift;
+  my $path;
+
+  # --tools (or $JEPROF_TOOLS) is a comma separated list, where each
+  # item is either a) a pathname prefix, or b) a map of the form
+  # <tool>:<path>.  First we look for an entry of type (b) for our
+  # tool.  If one is found, we use it.  Otherwise, we consider all the
+  # pathname prefixes in turn, until one yields an existing file.  If
+  # none does, we use a default path.
+  my $tools = $main::opt_tools || $ENV{"JEPROF_TOOLS"} || "";
+  if ($tools =~ m/(,|^)\Q$tool\E:([^,]*)/) {
+    $path = $2;
+    # TODO(csilvers): sanity-check that $path exists?  Hard if it's relative.
+  } elsif ($tools ne '') {
+    foreach my $prefix (split(',', $tools)) {
+      next if ($prefix =~ /:/);    # ignore "tool:fullpath" entries in the list
+      if (-x $prefix . $tool) {
+        $path = $prefix . $tool;
+        last;
+      }
+    }
+    if (!$path) {
+      error("No '$tool' found with prefix specified by " .
+            "--tools (or \$JEPROF_TOOLS) '$tools'\n");
+    }
+  } else {
+    # ... otherwise use the version that exists in the same directory as
+    # jeprof.  If there's nothing there, use $PATH.
+    $0 =~ m,[^/]*$,;     # this is everything after the last slash
+    my $dirname = $`;    # this is everything up to and including the last slash
+    if (-x "$dirname$tool") {
+      $path = "$dirname$tool";
+    } else {
+      $path = $tool;
+    }
+  }
+  if ($main::opt_debug) { print STDERR "Using '$path' for '$tool'.\n"; }
+  return $path;
+}
+
+sub ShellEscape {
+  my @escaped_words = ();
+  foreach my $word (@_) {
+    my $escaped_word = $word;
+    if ($word =~ m![^a-zA-Z0-9/.,_=-]!) {  # check for anything not in whitelist
+      $escaped_word =~ s/'/'\\''/;
+      $escaped_word = "'$escaped_word'";
+    }
+    push(@escaped_words, $escaped_word);
+  }
+  return join(" ", @escaped_words);
+}
+
+sub cleanup {
+  unlink($main::tmpfile_sym);
+  unlink(keys %main::tempnames);
+
+  # We leave any collected profiles in $HOME/jeprof in case the user wants
+  # to look at them later.  We print a message informing them of this.
+  if ((scalar(@main::profile_files) > 0) &&
+      defined($main::collected_profile)) {
+    if (scalar(@main::profile_files) == 1) {
+      print STDERR "Dynamically gathered profile is in $main::collected_profile\n";
+    }
+    print STDERR "If you want to investigate this profile further, you can do:\n";
+    print STDERR "\n";
+    print STDERR "  jeprof \\\n";
+    print STDERR "    $main::prog \\\n";
+    print STDERR "    $main::collected_profile\n";
+    print STDERR "\n";
+  }
+}
+
+sub sighandler {
+  cleanup();
+  exit(1);
+}
+
+sub error {
+  my $msg = shift;
+  print STDERR $msg;
+  cleanup();
+  exit(1);
+}
+
+
+# Run $nm_command and get all the resulting procedure boundaries whose
+# names match "$regexp" and returns them in a hashtable mapping from
+# procedure name to a two-element vector of [start address, end address]
+sub GetProcedureBoundariesViaNm {
+  my $escaped_nm_command = shift;    # shell-escaped
+  my $regexp = shift;
+
+  my $symbol_table = {};
+  open(NM, "$escaped_nm_command |") || error("$escaped_nm_command: $!\n");
+  my $last_start = "0";
+  my $routine = "";
+  while (<NM>) {
+    s/\r//g;         # turn windows-looking lines into unix-looking lines
+    if (m/^\s*([0-9a-f]+) (.) (..*)/) {
+      my $start_val = $1;
+      my $type = $2;
+      my $this_routine = $3;
+
+      # It's possible for two symbols to share the same address, if
+      # one is a zero-length variable (like __start_google_malloc) or
+      # one symbol is a weak alias to another (like __libc_malloc).
+      # In such cases, we want to ignore all values except for the
+      # actual symbol, which in nm-speak has type "T".  The logic
+      # below does this, though it's a bit tricky: what happens when
+      # we have a series of lines with the same address, is the first
+      # one gets queued up to be processed.  However, it won't
+      # *actually* be processed until later, when we read a line with
+      # a different address.  That means that as long as we're reading
+      # lines with the same address, we have a chance to replace that
+      # item in the queue, which we do whenever we see a 'T' entry --
+      # that is, a line with type 'T'.  If we never see a 'T' entry,
+      # we'll just go ahead and process the first entry (which never
+      # got touched in the queue), and ignore the others.
+      if ($start_val eq $last_start && $type =~ /t/i) {
+        # We are the 'T' symbol at this address, replace previous symbol.
+        $routine = $this_routine;
+        next;
+      } elsif ($start_val eq $last_start) {
+        # We're not the 'T' symbol at this address, so ignore us.
+        next;
+      }
+
+      if ($this_routine eq $sep_symbol) {
+        $sep_address = HexExtend($start_val);
+      }
+
+      # Tag this routine with the starting address in case the image
+      # has multiple occurrences of this routine.  We use a syntax
+      # that resembles template parameters that are automatically
+      # stripped out by ShortFunctionName()
+      $this_routine .= "<$start_val>";
+
+      if (defined($routine) && $routine =~ m/$regexp/) {
+        $symbol_table->{$routine} = [HexExtend($last_start),
+                                     HexExtend($start_val)];
+      }
+      $last_start = $start_val;
+      $routine = $this_routine;
+    } elsif (m/^Loaded image name: (.+)/) {
+      # The win32 nm workalike emits information about the binary it is using.
+      if ($main::opt_debug) { print STDERR "Using Image $1\n"; }
+    } elsif (m/^PDB file name: (.+)/) {
+      # The win32 nm workalike emits information about the pdb it is using.
+      if ($main::opt_debug) { print STDERR "Using PDB $1\n"; }
+    }
+  }
+  close(NM);
+  # Handle the last line in the nm output.  Unfortunately, we don't know
+  # how big this last symbol is, because we don't know how big the file
+  # is.  For now, we just give it a size of 0.
+  # TODO(csilvers): do better here.
+  if (defined($routine) && $routine =~ m/$regexp/) {
+    $symbol_table->{$routine} = [HexExtend($last_start),
+                                 HexExtend($last_start)];
+  }
+  return $symbol_table;
+}
+
+# Gets the procedure boundaries for all routines in "$image" whose names
+# match "$regexp" and returns them in a hashtable mapping from procedure
+# name to a two-element vector of [start address, end address].
+# Will return an empty map if nm is not installed or not working properly.
+sub GetProcedureBoundaries {
+  my $image = shift;
+  my $regexp = shift;
+
+  # If $image doesn't start with /, then put ./ in front of it.  This works
+  # around an obnoxious bug in our probing of nm -f behavior.
+  # "nm -f $image" is supposed to fail on GNU nm, but if:
+  #
+  # a. $image starts with [BbSsPp] (for example, bin/foo/bar), AND
+  # b. you have a.out in your current directory (a not uncommon occurence)
+  #
+  # then "nm -f $image" succeeds because -f only looks at the first letter of
+  # the argument, which looks valid because it's [BbSsPp], and then since
+  # there's no image provided, it looks for a.out and finds it.
+  #
+  # This regex makes sure that $image starts with . or /, forcing the -f
+  # parsing to fail since . and / are not valid formats.
+  $image =~ s#^[^/]#./$&#;
+
+  # For libc libraries, the copy in /usr/lib/debug contains debugging symbols
+  my $debugging = DebuggingLibrary($image);
+  if ($debugging) {
+    $image = $debugging;
+  }
+
+  my $nm = $obj_tool_map{"nm"};
+  my $cppfilt = $obj_tool_map{"c++filt"};
+
+  # nm can fail for two reasons: 1) $image isn't a debug library; 2) nm
+  # binary doesn't support --demangle.  In addition, for OS X we need
+  # to use the -f flag to get 'flat' nm output (otherwise we don't sort
+  # properly and get incorrect results).  Unfortunately, GNU nm uses -f
+  # in an incompatible way.  So first we test whether our nm supports
+  # --demangle and -f.
+  my $demangle_flag = "";
+  my $cppfilt_flag = "";
+  my $to_devnull = ">$dev_null 2>&1";
+  if (system(ShellEscape($nm, "--demangle", "image") . $to_devnull) == 0) {
+    # In this mode, we do "nm --demangle <foo>"
+    $demangle_flag = "--demangle";
+    $cppfilt_flag = "";
+  } elsif (system(ShellEscape($cppfilt, $image) . $to_devnull) == 0) {
+    # In this mode, we do "nm <foo> | c++filt"
+    $cppfilt_flag = " | " . ShellEscape($cppfilt);
+  };
+  my $flatten_flag = "";
+  if (system(ShellEscape($nm, "-f", $image) . $to_devnull) == 0) {
+    $flatten_flag = "-f";
+  }
+
+  # Finally, in the case $imagie isn't a debug library, we try again with
+  # -D to at least get *exported* symbols.  If we can't use --demangle,
+  # we use c++filt instead, if it exists on this system.
+  my @nm_commands = (ShellEscape($nm, "-n", $flatten_flag, $demangle_flag,
+                                 $image) . " 2>$dev_null $cppfilt_flag",
+                     ShellEscape($nm, "-D", "-n", $flatten_flag, $demangle_flag,
+                                 $image) . " 2>$dev_null $cppfilt_flag",
+                     # 6nm is for Go binaries
+                     ShellEscape("6nm", "$image") . " 2>$dev_null | sort",
+                     );
+
+  # If the executable is an MS Windows PDB-format executable, we'll
+  # have set up obj_tool_map("nm_pdb").  In this case, we actually
+  # want to use both unix nm and windows-specific nm_pdb, since
+  # PDB-format executables can apparently include dwarf .o files.
+  if (exists $obj_tool_map{"nm_pdb"}) {
+    push(@nm_commands,
+         ShellEscape($obj_tool_map{"nm_pdb"}, "--demangle", $image)
+         . " 2>$dev_null");
+  }
+
+  foreach my $nm_command (@nm_commands) {
+    my $symbol_table = GetProcedureBoundariesViaNm($nm_command, $regexp);
+    return $symbol_table if (%{$symbol_table});
+  }
+  my $symbol_table = {};
+  return $symbol_table;
+}
+
+
+# The test vectors for AddressAdd/Sub/Inc are 8-16-nibble hex strings.
+# To make them more readable, we add underscores at interesting places.
+# This routine removes the underscores, producing the canonical representation
+# used by jeprof to represent addresses, particularly in the tested routines.
+sub CanonicalHex {
+  my $arg = shift;
+  return join '', (split '_',$arg);
+}
+
+
+# Unit test for AddressAdd:
+sub AddressAddUnitTest {
+  my $test_data_8 = shift;
+  my $test_data_16 = shift;
+  my $error_count = 0;
+  my $fail_count = 0;
+  my $pass_count = 0;
+  # print STDERR "AddressAddUnitTest: ", 1+$#{$test_data_8}, " tests\n";
+
+  # First a few 8-nibble addresses.  Note that this implementation uses
+  # plain old arithmetic, so a quick sanity check along with verifying what
+  # happens to overflow (we want it to wrap):
+  $address_length = 8;
+  foreach my $row (@{$test_data_8}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressAdd ($row->[0], $row->[1]);
+    if ($sum ne $row->[2]) {
+      printf STDERR "ERROR: %s != %s + %s = %s\n", $sum,
+             $row->[0], $row->[1], $row->[2];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressAdd 32-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count = $fail_count;
+  $fail_count = 0;
+  $pass_count = 0;
+
+  # Now 16-nibble addresses.
+  $address_length = 16;
+  foreach my $row (@{$test_data_16}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressAdd (CanonicalHex($row->[0]), CanonicalHex($row->[1]));
+    my $expected = join '', (split '_',$row->[2]);
+    if ($sum ne CanonicalHex($row->[2])) {
+      printf STDERR "ERROR: %s != %s + %s = %s\n", $sum,
+             $row->[0], $row->[1], $row->[2];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressAdd 64-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count += $fail_count;
+
+  return $error_count;
+}
+
+
+# Unit test for AddressSub:
+sub AddressSubUnitTest {
+  my $test_data_8 = shift;
+  my $test_data_16 = shift;
+  my $error_count = 0;
+  my $fail_count = 0;
+  my $pass_count = 0;
+  # print STDERR "AddressSubUnitTest: ", 1+$#{$test_data_8}, " tests\n";
+
+  # First a few 8-nibble addresses.  Note that this implementation uses
+  # plain old arithmetic, so a quick sanity check along with verifying what
+  # happens to overflow (we want it to wrap):
+  $address_length = 8;
+  foreach my $row (@{$test_data_8}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressSub ($row->[0], $row->[1]);
+    if ($sum ne $row->[3]) {
+      printf STDERR "ERROR: %s != %s - %s = %s\n", $sum,
+             $row->[0], $row->[1], $row->[3];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressSub 32-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count = $fail_count;
+  $fail_count = 0;
+  $pass_count = 0;
+
+  # Now 16-nibble addresses.
+  $address_length = 16;
+  foreach my $row (@{$test_data_16}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressSub (CanonicalHex($row->[0]), CanonicalHex($row->[1]));
+    if ($sum ne CanonicalHex($row->[3])) {
+      printf STDERR "ERROR: %s != %s - %s = %s\n", $sum,
+             $row->[0], $row->[1], $row->[3];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressSub 64-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count += $fail_count;
+
+  return $error_count;
+}
+
+
+# Unit test for AddressInc:
+sub AddressIncUnitTest {
+  my $test_data_8 = shift;
+  my $test_data_16 = shift;
+  my $error_count = 0;
+  my $fail_count = 0;
+  my $pass_count = 0;
+  # print STDERR "AddressIncUnitTest: ", 1+$#{$test_data_8}, " tests\n";
+
+  # First a few 8-nibble addresses.  Note that this implementation uses
+  # plain old arithmetic, so a quick sanity check along with verifying what
+  # happens to overflow (we want it to wrap):
+  $address_length = 8;
+  foreach my $row (@{$test_data_8}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressInc ($row->[0]);
+    if ($sum ne $row->[4]) {
+      printf STDERR "ERROR: %s != %s + 1 = %s\n", $sum,
+             $row->[0], $row->[4];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressInc 32-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count = $fail_count;
+  $fail_count = 0;
+  $pass_count = 0;
+
+  # Now 16-nibble addresses.
+  $address_length = 16;
+  foreach my $row (@{$test_data_16}) {
+    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
+    my $sum = AddressInc (CanonicalHex($row->[0]));
+    if ($sum ne CanonicalHex($row->[4])) {
+      printf STDERR "ERROR: %s != %s + 1 = %s\n", $sum,
+             $row->[0], $row->[4];
+      ++$fail_count;
+    } else {
+      ++$pass_count;
+    }
+  }
+  printf STDERR "AddressInc 64-bit tests: %d passes, %d failures\n",
+         $pass_count, $fail_count;
+  $error_count += $fail_count;
+
+  return $error_count;
+}
+
+
+# Driver for unit tests.
+# Currently just the address add/subtract/increment routines for 64-bit.
+sub RunUnitTests {
+  my $error_count = 0;
+
+  # This is a list of tuples [a, b, a+b, a-b, a+1]
+  my $unit_test_data_8 = [
+    [qw(aaaaaaaa 50505050 fafafafa 5a5a5a5a aaaaaaab)],
+    [qw(50505050 aaaaaaaa fafafafa a5a5a5a6 50505051)],
+    [qw(ffffffff aaaaaaaa aaaaaaa9 55555555 00000000)],
+    [qw(00000001 ffffffff 00000000 00000002 00000002)],
+    [qw(00000001 fffffff0 fffffff1 00000011 00000002)],
+  ];
+  my $unit_test_data_16 = [
+    # The implementation handles data in 7-nibble chunks, so those are the
+    # interesting boundaries.
+    [qw(aaaaaaaa 50505050
+        00_000000f_afafafa 00_0000005_a5a5a5a 00_000000a_aaaaaab)],
+    [qw(50505050 aaaaaaaa
+        00_000000f_afafafa ff_ffffffa_5a5a5a6 00_0000005_0505051)],
+    [qw(ffffffff aaaaaaaa
+        00_000001a_aaaaaa9 00_0000005_5555555 00_0000010_0000000)],
+    [qw(00000001 ffffffff
+        00_0000010_0000000 ff_ffffff0_0000002 00_0000000_0000002)],
+    [qw(00000001 fffffff0
+        00_000000f_ffffff1 ff_ffffff0_0000011 00_0000000_0000002)],
+
+    [qw(00_a00000a_aaaaaaa 50505050
+        00_a00000f_afafafa 00_a000005_a5a5a5a 00_a00000a_aaaaaab)],
+    [qw(0f_fff0005_0505050 aaaaaaaa
+        0f_fff000f_afafafa 0f_ffefffa_5a5a5a6 0f_fff0005_0505051)],
+    [qw(00_000000f_fffffff 01_800000a_aaaaaaa
+        01_800001a_aaaaaa9 fe_8000005_5555555 00_0000010_0000000)],
+    [qw(00_0000000_0000001 ff_fffffff_fffffff
+        00_0000000_0000000 00_0000000_0000002 00_0000000_0000002)],
+    [qw(00_0000000_0000001 ff_fffffff_ffffff0
+        ff_fffffff_ffffff1 00_0000000_0000011 00_0000000_0000002)],
+  ];
+
+  $error_count += AddressAddUnitTest($unit_test_data_8, $unit_test_data_16);
+  $error_count += AddressSubUnitTest($unit_test_data_8, $unit_test_data_16);
+  $error_count += AddressIncUnitTest($unit_test_data_8, $unit_test_data_16);
+  if ($error_count > 0) {
+    print STDERR $error_count, " errors: FAILED\n";
+  } else {
+    print STDERR "PASS\n";
+  }
+  exit ($error_count);
+}
diff --git a/redis-stable/deps/jemalloc/build-aux/config.guess b/redis-stable/deps/jemalloc/build-aux/config.guess
new file mode 100755
index 00000000..2e9ad7fe
--- /dev/null
+++ b/redis-stable/deps/jemalloc/build-aux/config.guess
@@ -0,0 +1,1462 @@
+#! /bin/sh
+# Attempt to guess a canonical system name.
+#   Copyright 1992-2016 Free Software Foundation, Inc.
+
+timestamp='2016-10-02'
+
+# This file 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; either version 3 of the License, or
+# (at your option) any later version.
+#
+# 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, see <http://www.gnu.org/licenses/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that
+# program.  This Exception is an additional permission under section 7
+# of the GNU General Public License, version 3 ("GPLv3").
+#
+# Originally written by Per Bothner; maintained since 2000 by Ben Elliston.
+#
+# You can get the latest version of this script from:
+# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+#
+# Please send patches to <config-patches@gnu.org>.
+
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION]
+
+Output the configuration name of the system \`$me' is run on.
+
+Operation modes:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.guess ($timestamp)
+
+Originally written by Per Bothner.
+Copyright 1992-2016 Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help" >&2
+       exit 1 ;;
+    * )
+       break ;;
+  esac
+done
+
+if test $# != 0; then
+  echo "$me: too many arguments$help" >&2
+  exit 1
+fi
+
+trap 'exit 1' 1 2 15
+
+# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
+# compiler to aid in system detection is discouraged as it requires
+# temporary files to be created and, as you can see below, it is a
+# headache to deal with in a portable fashion.
+
+# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
+# use `HOST_CC' if defined, but it is deprecated.
+
+# Portable tmp directory creation inspired by the Autoconf team.
+
+set_cc_for_build='
+trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
+trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
+: ${TMPDIR=/tmp} ;
+ { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
+ { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||
+ { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } ||
+ { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
+dummy=$tmp/dummy ;
+tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
+case $CC_FOR_BUILD,$HOST_CC,$CC in
+ ,,)    echo "int x;" > $dummy.c ;
+	for c in cc gcc c89 c99 ; do
+	  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
+	     CC_FOR_BUILD="$c"; break ;
+	  fi ;
+	done ;
+	if test x"$CC_FOR_BUILD" = x ; then
+	  CC_FOR_BUILD=no_compiler_found ;
+	fi
+	;;
+ ,,*)   CC_FOR_BUILD=$CC ;;
+ ,*,*)  CC_FOR_BUILD=$HOST_CC ;;
+esac ; set_cc_for_build= ;'
+
+# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
+# (ghazi@noc.rutgers.edu 1994-08-24)
+if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
+	PATH=$PATH:/.attbin ; export PATH
+fi
+
+UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
+UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
+UNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown
+UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown
+
+case "${UNAME_SYSTEM}" in
+Linux|GNU|GNU/*)
+	# If the system lacks a compiler, then just pick glibc.
+	# We could probably try harder.
+	LIBC=gnu
+
+	eval $set_cc_for_build
+	cat <<-EOF > $dummy.c
+	#include <features.h>
+	#if defined(__UCLIBC__)
+	LIBC=uclibc
+	#elif defined(__dietlibc__)
+	LIBC=dietlibc
+	#else
+	LIBC=gnu
+	#endif
+	EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`
+	;;
+esac
+
+# Note: order is significant - the case branches are not exclusive.
+
+case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
+    *:NetBSD:*:*)
+	# NetBSD (nbsd) targets should (where applicable) match one or
+	# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,
+	# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently
+	# switched to ELF, *-*-netbsd* would select the old
+	# object file format.  This provides both forward
+	# compatibility and a consistent mechanism for selecting the
+	# object file format.
+	#
+	# Note: NetBSD doesn't particularly care about the vendor
+	# portion of the name.  We always set it to "unknown".
+	sysctl="sysctl -n hw.machine_arch"
+	UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \
+	    /sbin/$sysctl 2>/dev/null || \
+	    /usr/sbin/$sysctl 2>/dev/null || \
+	    echo unknown)`
+	case "${UNAME_MACHINE_ARCH}" in
+	    armeb) machine=armeb-unknown ;;
+	    arm*) machine=arm-unknown ;;
+	    sh3el) machine=shl-unknown ;;
+	    sh3eb) machine=sh-unknown ;;
+	    sh5el) machine=sh5le-unknown ;;
+	    earmv*)
+		arch=`echo ${UNAME_MACHINE_ARCH} | sed -e 's,^e\(armv[0-9]\).*$,\1,'`
+		endian=`echo ${UNAME_MACHINE_ARCH} | sed -ne 's,^.*\(eb\)$,\1,p'`
+		machine=${arch}${endian}-unknown
+		;;
+	    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
+	esac
+	# The Operating System including object format, if it has switched
+	# to ELF recently (or will in the future) and ABI.
+	case "${UNAME_MACHINE_ARCH}" in
+	    earm*)
+		os=netbsdelf
+		;;
+	    arm*|i386|m68k|ns32k|sh3*|sparc|vax)
+		eval $set_cc_for_build
+		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
+			| grep -q __ELF__
+		then
+		    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
+		    # Return netbsd for either.  FIX?
+		    os=netbsd
+		else
+		    os=netbsdelf
+		fi
+		;;
+	    *)
+		os=netbsd
+		;;
+	esac
+	# Determine ABI tags.
+	case "${UNAME_MACHINE_ARCH}" in
+	    earm*)
+		expr='s/^earmv[0-9]/-eabi/;s/eb$//'
+		abi=`echo ${UNAME_MACHINE_ARCH} | sed -e "$expr"`
+		;;
+	esac
+	# The OS release
+	# Debian GNU/NetBSD machines have a different userland, and
+	# thus, need a distinct triplet. However, they do not need
+	# kernel version information, so it can be replaced with a
+	# suitable tag, in the style of linux-gnu.
+	case "${UNAME_VERSION}" in
+	    Debian*)
+		release='-gnu'
+		;;
+	    *)
+		release=`echo ${UNAME_RELEASE} | sed -e 's/[-_].*//' | cut -d. -f1,2`
+		;;
+	esac
+	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
+	# contains redundant information, the shorter form:
+	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
+	echo "${machine}-${os}${release}${abi}"
+	exit ;;
+    *:Bitrig:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE}
+	exit ;;
+    *:OpenBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
+	exit ;;
+    *:LibertyBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-libertybsd${UNAME_RELEASE}
+	exit ;;
+    *:ekkoBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
+	exit ;;
+    *:SolidBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
+	exit ;;
+    macppc:MirBSD:*:*)
+	echo powerpc-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+    *:MirBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+    *:Sortix:*:*)
+	echo ${UNAME_MACHINE}-unknown-sortix
+	exit ;;
+    alpha:OSF1:*:*)
+	case $UNAME_RELEASE in
+	*4.0)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
+		;;
+	*5.*)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
+		;;
+	esac
+	# According to Compaq, /usr/sbin/psrinfo has been available on
+	# OSF/1 and Tru64 systems produced since 1995.  I hope that
+	# covers most systems running today.  This code pipes the CPU
+	# types through head -n 1, so we only detect the type of CPU 0.
+	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \(.*\) processor.*$/\1/p' | head -n 1`
+	case "$ALPHA_CPU_TYPE" in
+	    "EV4 (21064)")
+		UNAME_MACHINE=alpha ;;
+	    "EV4.5 (21064)")
+		UNAME_MACHINE=alpha ;;
+	    "LCA4 (21066/21068)")
+		UNAME_MACHINE=alpha ;;
+	    "EV5 (21164)")
+		UNAME_MACHINE=alphaev5 ;;
+	    "EV5.6 (21164A)")
+		UNAME_MACHINE=alphaev56 ;;
+	    "EV5.6 (21164PC)")
+		UNAME_MACHINE=alphapca56 ;;
+	    "EV5.7 (21164PC)")
+		UNAME_MACHINE=alphapca57 ;;
+	    "EV6 (21264)")
+		UNAME_MACHINE=alphaev6 ;;
+	    "EV6.7 (21264A)")
+		UNAME_MACHINE=alphaev67 ;;
+	    "EV6.8CB (21264C)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.8AL (21264B)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.8CX (21264D)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.9A (21264/EV69A)")
+		UNAME_MACHINE=alphaev69 ;;
+	    "EV7 (21364)")
+		UNAME_MACHINE=alphaev7 ;;
+	    "EV7.9 (21364A)")
+		UNAME_MACHINE=alphaev79 ;;
+	esac
+	# A Pn.n version is a patched version.
+	# A Vn.n version is a released version.
+	# A Tn.n version is a released field test version.
+	# A Xn.n version is an unreleased experimental baselevel.
+	# 1.2 uses "1.2" for uname -r.
+	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
+	# Reset EXIT trap before exiting to avoid spurious non-zero exit code.
+	exitcode=$?
+	trap '' 0
+	exit $exitcode ;;
+    Alpha\ *:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# Should we change UNAME_MACHINE based on the output of uname instead
+	# of the specific Alpha model?
+	echo alpha-pc-interix
+	exit ;;
+    21064:Windows_NT:50:3)
+	echo alpha-dec-winnt3.5
+	exit ;;
+    Amiga*:UNIX_System_V:4.0:*)
+	echo m68k-unknown-sysv4
+	exit ;;
+    *:[Aa]miga[Oo][Ss]:*:*)
+	echo ${UNAME_MACHINE}-unknown-amigaos
+	exit ;;
+    *:[Mm]orph[Oo][Ss]:*:*)
+	echo ${UNAME_MACHINE}-unknown-morphos
+	exit ;;
+    *:OS/390:*:*)
+	echo i370-ibm-openedition
+	exit ;;
+    *:z/VM:*:*)
+	echo s390-ibm-zvmoe
+	exit ;;
+    *:OS400:*:*)
+	echo powerpc-ibm-os400
+	exit ;;
+    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
+	echo arm-acorn-riscix${UNAME_RELEASE}
+	exit ;;
+    arm*:riscos:*:*|arm*:RISCOS:*:*)
+	echo arm-unknown-riscos
+	exit ;;
+    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
+	echo hppa1.1-hitachi-hiuxmpp
+	exit ;;
+    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
+	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
+	if test "`(/bin/universe) 2>/dev/null`" = att ; then
+		echo pyramid-pyramid-sysv3
+	else
+		echo pyramid-pyramid-bsd
+	fi
+	exit ;;
+    NILE*:*:*:dcosx)
+	echo pyramid-pyramid-svr4
+	exit ;;
+    DRS?6000:unix:4.0:6*)
+	echo sparc-icl-nx6
+	exit ;;
+    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
+	case `/usr/bin/uname -p` in
+	    sparc) echo sparc-icl-nx7; exit ;;
+	esac ;;
+    s390x:SunOS:*:*)
+	echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4H:SunOS:5.*:*)
+	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
+	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)
+	echo i386-pc-auroraux${UNAME_RELEASE}
+	exit ;;
+    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)
+	eval $set_cc_for_build
+	SUN_ARCH=i386
+	# If there is a compiler, see if it is configured for 64-bit objects.
+	# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.
+	# This test works for both compilers.
+	if [ "$CC_FOR_BUILD" != no_compiler_found ]; then
+	    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \
+		(CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		grep IS_64BIT_ARCH >/dev/null
+	    then
+		SUN_ARCH=x86_64
+	    fi
+	fi
+	echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:6*:*)
+	# According to config.sub, this is the proper way to canonicalize
+	# SunOS6.  Hard to guess exactly what SunOS6 will be like, but
+	# it's likely to be more like Solaris than SunOS4.
+	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:*:*)
+	case "`/usr/bin/arch -k`" in
+	    Series*|S4*)
+		UNAME_RELEASE=`uname -v`
+		;;
+	esac
+	# Japanese Language versions have a version number like `4.1.3-JL'.
+	echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`
+	exit ;;
+    sun3*:SunOS:*:*)
+	echo m68k-sun-sunos${UNAME_RELEASE}
+	exit ;;
+    sun*:*:4.2BSD:*)
+	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
+	test "x${UNAME_RELEASE}" = x && UNAME_RELEASE=3
+	case "`/bin/arch`" in
+	    sun3)
+		echo m68k-sun-sunos${UNAME_RELEASE}
+		;;
+	    sun4)
+		echo sparc-sun-sunos${UNAME_RELEASE}
+		;;
+	esac
+	exit ;;
+    aushp:SunOS:*:*)
+	echo sparc-auspex-sunos${UNAME_RELEASE}
+	exit ;;
+    # The situation for MiNT is a little confusing.  The machine name
+    # can be virtually everything (everything which is not
+    # "atarist" or "atariste" at least should have a processor
+    # > m68000).  The system name ranges from "MiNT" over "FreeMiNT"
+    # to the lowercase version "mint" (or "freemint").  Finally
+    # the system name "TOS" denotes a system which is actually not
+    # MiNT.  But MiNT is downward compatible to TOS, so this should
+    # be no problem.
+    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
+	echo m68k-milan-mint${UNAME_RELEASE}
+	exit ;;
+    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
+	echo m68k-hades-mint${UNAME_RELEASE}
+	exit ;;
+    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
+	echo m68k-unknown-mint${UNAME_RELEASE}
+	exit ;;
+    m68k:machten:*:*)
+	echo m68k-apple-machten${UNAME_RELEASE}
+	exit ;;
+    powerpc:machten:*:*)
+	echo powerpc-apple-machten${UNAME_RELEASE}
+	exit ;;
+    RISC*:Mach:*:*)
+	echo mips-dec-mach_bsd4.3
+	exit ;;
+    RISC*:ULTRIX:*:*)
+	echo mips-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+    VAX*:ULTRIX*:*:*)
+	echo vax-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+    2020:CLIX:*:* | 2430:CLIX:*:*)
+	echo clipper-intergraph-clix${UNAME_RELEASE}
+	exit ;;
+    mips:*:*:UMIPS | mips:*:*:RISCos)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+#ifdef __cplusplus
+#include <stdio.h>  /* for printf() prototype */
+	int main (int argc, char *argv[]) {
+#else
+	int main (argc, argv) int argc; char *argv[]; {
+#endif
+	#if defined (host_mips) && defined (MIPSEB)
+	#if defined (SYSTYPE_SYSV)
+	  printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_SVR4)
+	  printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
+	  printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0);
+	#endif
+	#endif
+	  exit (-1);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c &&
+	  dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` &&
+	  SYSTEM_NAME=`$dummy $dummyarg` &&
+	    { echo "$SYSTEM_NAME"; exit; }
+	echo mips-mips-riscos${UNAME_RELEASE}
+	exit ;;
+    Motorola:PowerMAX_OS:*:*)
+	echo powerpc-motorola-powermax
+	exit ;;
+    Motorola:*:4.3:PL8-*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:Power_UNIX:*:*)
+	echo powerpc-harris-powerunix
+	exit ;;
+    m88k:CX/UX:7*:*)
+	echo m88k-harris-cxux7
+	exit ;;
+    m88k:*:4*:R4*)
+	echo m88k-motorola-sysv4
+	exit ;;
+    m88k:*:3*:R3*)
+	echo m88k-motorola-sysv3
+	exit ;;
+    AViiON:dgux:*:*)
+	# DG/UX returns AViiON for all architectures
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]
+	then
+	    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \
+	       [ ${TARGET_BINARY_INTERFACE}x = x ]
+	    then
+		echo m88k-dg-dgux${UNAME_RELEASE}
+	    else
+		echo m88k-dg-dguxbcs${UNAME_RELEASE}
+	    fi
+	else
+	    echo i586-dg-dgux${UNAME_RELEASE}
+	fi
+	exit ;;
+    M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
+	echo m88k-dolphin-sysv3
+	exit ;;
+    M88*:*:R3*:*)
+	# Delta 88k system running SVR3
+	echo m88k-motorola-sysv3
+	exit ;;
+    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
+	echo m88k-tektronix-sysv3
+	exit ;;
+    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
+	echo m68k-tektronix-bsd
+	exit ;;
+    *:IRIX*:*:*)
+	echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`
+	exit ;;
+    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
+	echo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id
+	exit ;;               # Note that: echo "'`uname -s`'" gives 'AIX '
+    i*86:AIX:*:*)
+	echo i386-ibm-aix
+	exit ;;
+    ia64:AIX:*:*)
+	if [ -x /usr/bin/oslevel ] ; then
+		IBM_REV=`/usr/bin/oslevel`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
+	exit ;;
+    *:AIX:2:3)
+	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
+		eval $set_cc_for_build
+		sed 's/^		//' << EOF >$dummy.c
+		#include <sys/systemcfg.h>
+
+		main()
+			{
+			if (!__power_pc())
+				exit(1);
+			puts("powerpc-ibm-aix3.2.5");
+			exit(0);
+			}
+EOF
+		if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
+		then
+			echo "$SYSTEM_NAME"
+		else
+			echo rs6000-ibm-aix3.2.5
+		fi
+	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
+		echo rs6000-ibm-aix3.2.4
+	else
+		echo rs6000-ibm-aix3.2
+	fi
+	exit ;;
+    *:AIX:*:[4567])
+	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
+	if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then
+		IBM_ARCH=rs6000
+	else
+		IBM_ARCH=powerpc
+	fi
+	if [ -x /usr/bin/lslpp ] ; then
+		IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc |
+			   awk -F: '{ print $3 }' | sed s/[0-9]*$/0/`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
+	exit ;;
+    *:AIX:*:*)
+	echo rs6000-ibm-aix
+	exit ;;
+    ibmrt:4.4BSD:*|romp-ibm:BSD:*)
+	echo romp-ibm-bsd4.4
+	exit ;;
+    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and
+	echo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to
+	exit ;;                             # report: romp-ibm BSD 4.3
+    *:BOSX:*:*)
+	echo rs6000-bull-bosx
+	exit ;;
+    DPX/2?00:B.O.S.:*:*)
+	echo m68k-bull-sysv3
+	exit ;;
+    9000/[34]??:4.3bsd:1.*:*)
+	echo m68k-hp-bsd
+	exit ;;
+    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)
+	echo m68k-hp-bsd4.4
+	exit ;;
+    9000/[34678]??:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
+	case "${UNAME_MACHINE}" in
+	    9000/31? )            HP_ARCH=m68000 ;;
+	    9000/[34]?? )         HP_ARCH=m68k ;;
+	    9000/[678][0-9][0-9])
+		if [ -x /usr/bin/getconf ]; then
+		    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
+		    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
+		    case "${sc_cpu_version}" in
+		      523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0
+		      528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1
+		      532)                      # CPU_PA_RISC2_0
+			case "${sc_kernel_bits}" in
+			  32) HP_ARCH=hppa2.0n ;;
+			  64) HP_ARCH=hppa2.0w ;;
+			  '') HP_ARCH=hppa2.0 ;;   # HP-UX 10.20
+			esac ;;
+		    esac
+		fi
+		if [ "${HP_ARCH}" = "" ]; then
+		    eval $set_cc_for_build
+		    sed 's/^		//' << EOF >$dummy.c
+
+		#define _HPUX_SOURCE
+		#include <stdlib.h>
+		#include <unistd.h>
+
+		int main ()
+		{
+		#if defined(_SC_KERNEL_BITS)
+		    long bits = sysconf(_SC_KERNEL_BITS);
+		#endif
+		    long cpu  = sysconf (_SC_CPU_VERSION);
+
+		    switch (cpu)
+			{
+			case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
+			case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
+			case CPU_PA_RISC2_0:
+		#if defined(_SC_KERNEL_BITS)
+			    switch (bits)
+				{
+				case 64: puts ("hppa2.0w"); break;
+				case 32: puts ("hppa2.0n"); break;
+				default: puts ("hppa2.0"); break;
+				} break;
+		#else  /* !defined(_SC_KERNEL_BITS) */
+			    puts ("hppa2.0"); break;
+		#endif
+			default: puts ("hppa1.0"); break;
+			}
+		    exit (0);
+		}
+EOF
+		    (CCOPTS="" $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
+		    test -z "$HP_ARCH" && HP_ARCH=hppa
+		fi ;;
+	esac
+	if [ ${HP_ARCH} = hppa2.0w ]
+	then
+	    eval $set_cc_for_build
+
+	    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
+	    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler
+	    # generating 64-bit code.  GNU and HP use different nomenclature:
+	    #
+	    # $ CC_FOR_BUILD=cc ./config.guess
+	    # => hppa2.0w-hp-hpux11.23
+	    # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
+	    # => hppa64-hp-hpux11.23
+
+	    if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) |
+		grep -q __LP64__
+	    then
+		HP_ARCH=hppa2.0w
+	    else
+		HP_ARCH=hppa64
+	    fi
+	fi
+	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
+	exit ;;
+    ia64:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
+	echo ia64-hp-hpux${HPUX_REV}
+	exit ;;
+    3050*:HI-UX:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#include <unistd.h>
+	int
+	main ()
+	{
+	  long cpu = sysconf (_SC_CPU_VERSION);
+	  /* The order matters, because CPU_IS_HP_MC68K erroneously returns
+	     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct
+	     results, however.  */
+	  if (CPU_IS_PA_RISC (cpu))
+	    {
+	      switch (cpu)
+		{
+		  case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
+		  default: puts ("hppa-hitachi-hiuxwe2"); break;
+		}
+	    }
+	  else if (CPU_IS_HP_MC68K (cpu))
+	    puts ("m68k-hitachi-hiuxwe2");
+	  else puts ("unknown-hitachi-hiuxwe2");
+	  exit (0);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
+		{ echo "$SYSTEM_NAME"; exit; }
+	echo unknown-hitachi-hiuxwe2
+	exit ;;
+    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* )
+	echo hppa1.1-hp-bsd
+	exit ;;
+    9000/8??:4.3bsd:*:*)
+	echo hppa1.0-hp-bsd
+	exit ;;
+    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
+	echo hppa1.0-hp-mpeix
+	exit ;;
+    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* )
+	echo hppa1.1-hp-osf
+	exit ;;
+    hp8??:OSF1:*:*)
+	echo hppa1.0-hp-osf
+	exit ;;
+    i*86:OSF1:*:*)
+	if [ -x /usr/sbin/sysversion ] ; then
+	    echo ${UNAME_MACHINE}-unknown-osf1mk
+	else
+	    echo ${UNAME_MACHINE}-unknown-osf1
+	fi
+	exit ;;
+    parisc*:Lites*:*:*)
+	echo hppa1.1-hp-lites
+	exit ;;
+    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
+	echo c1-convex-bsd
+	exit ;;
+    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
+	if getsysinfo -f scalar_acc
+	then echo c32-convex-bsd
+	else echo c2-convex-bsd
+	fi
+	exit ;;
+    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
+	echo c34-convex-bsd
+	exit ;;
+    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
+	echo c38-convex-bsd
+	exit ;;
+    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
+	echo c4-convex-bsd
+	exit ;;
+    CRAY*Y-MP:*:*:*)
+	echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*[A-Z]90:*:*:*)
+	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
+	| sed -e 's/CRAY.*\([A-Z]90\)/\1/' \
+	      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
+	      -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*TS:*:*:*)
+	echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*T3E:*:*:*)
+	echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*SV1:*:*:*)
+	echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    *:UNICOS/mp:*:*)
+	echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
+	FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`
+	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    5000:UNIX_System_V:4.*:*)
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'`
+	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
+	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
+	exit ;;
+    sparc*:BSD/OS:*:*)
+	echo sparc-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+    *:BSD/OS:*:*)
+	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+    *:FreeBSD:*:*)
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	case ${UNAME_PROCESSOR} in
+	    amd64)
+		echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
+	    *)
+		echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
+	esac
+	exit ;;
+    i*:CYGWIN*:*)
+	echo ${UNAME_MACHINE}-pc-cygwin
+	exit ;;
+    *:MINGW64*:*)
+	echo ${UNAME_MACHINE}-pc-mingw64
+	exit ;;
+    *:MINGW*:*)
+	echo ${UNAME_MACHINE}-pc-mingw32
+	exit ;;
+    *:MSYS*:*)
+	echo ${UNAME_MACHINE}-pc-msys
+	exit ;;
+    i*:windows32*:*)
+	# uname -m includes "-pc" on this system.
+	echo ${UNAME_MACHINE}-mingw32
+	exit ;;
+    i*:PW*:*)
+	echo ${UNAME_MACHINE}-pc-pw32
+	exit ;;
+    *:Interix*:*)
+	case ${UNAME_MACHINE} in
+	    x86)
+		echo i586-pc-interix${UNAME_RELEASE}
+		exit ;;
+	    authenticamd | genuineintel | EM64T)
+		echo x86_64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	    IA64)
+		echo ia64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	esac ;;
+    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)
+	echo i${UNAME_MACHINE}-pc-mks
+	exit ;;
+    8664:Windows_NT:*)
+	echo x86_64-pc-mks
+	exit ;;
+    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
+	# UNAME_MACHINE based on the output of uname instead of i386?
+	echo i586-pc-interix
+	exit ;;
+    i*:UWIN*:*)
+	echo ${UNAME_MACHINE}-pc-uwin
+	exit ;;
+    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
+	echo x86_64-unknown-cygwin
+	exit ;;
+    p*:CYGWIN*:*)
+	echo powerpcle-unknown-cygwin
+	exit ;;
+    prep*:SunOS:5.*:*)
+	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    *:GNU:*:*)
+	# the GNU system
+	echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`
+	exit ;;
+    *:GNU/*:*:*)
+	# other systems with GNU libc and userland
+	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr "[:upper:]" "[:lower:]"``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC}
+	exit ;;
+    i*86:Minix:*:*)
+	echo ${UNAME_MACHINE}-pc-minix
+	exit ;;
+    aarch64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    aarch64_be:Linux:*:*)
+	UNAME_MACHINE=aarch64_be
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    alpha:Linux:*:*)
+	case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in
+	  EV5)   UNAME_MACHINE=alphaev5 ;;
+	  EV56)  UNAME_MACHINE=alphaev56 ;;
+	  PCA56) UNAME_MACHINE=alphapca56 ;;
+	  PCA57) UNAME_MACHINE=alphapca56 ;;
+	  EV6)   UNAME_MACHINE=alphaev6 ;;
+	  EV67)  UNAME_MACHINE=alphaev67 ;;
+	  EV68*) UNAME_MACHINE=alphaev68 ;;
+	esac
+	objdump --private-headers /bin/sh | grep -q ld.so.1
+	if test "$?" = 0 ; then LIBC=gnulibc1 ; fi
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    arc:Linux:*:* | arceb:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    arm*:Linux:*:*)
+	eval $set_cc_for_build
+	if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \
+	    | grep -q __ARM_EABI__
+	then
+	    echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	else
+	    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
+		| grep -q __ARM_PCS_VFP
+	    then
+		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi
+	    else
+		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf
+	    fi
+	fi
+	exit ;;
+    avr32*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    cris:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
+	exit ;;
+    crisv32:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
+	exit ;;
+    e2k:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    frv:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    hexagon:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    i*86:Linux:*:*)
+	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
+	exit ;;
+    ia64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    k1om:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    m32r*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    m68*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    mips:Linux:*:* | mips64:Linux:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#undef CPU
+	#undef ${UNAME_MACHINE}
+	#undef ${UNAME_MACHINE}el
+	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
+	CPU=${UNAME_MACHINE}el
+	#else
+	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
+	CPU=${UNAME_MACHINE}
+	#else
+	CPU=
+	#endif
+	#endif
+EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`
+	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; }
+	;;
+    mips64el:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    openrisc*:Linux:*:*)
+	echo or1k-unknown-linux-${LIBC}
+	exit ;;
+    or32:Linux:*:* | or1k*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    padre:Linux:*:*)
+	echo sparc-unknown-linux-${LIBC}
+	exit ;;
+    parisc64:Linux:*:* | hppa64:Linux:*:*)
+	echo hppa64-unknown-linux-${LIBC}
+	exit ;;
+    parisc:Linux:*:* | hppa:Linux:*:*)
+	# Look for CPU level
+	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
+	  PA7*) echo hppa1.1-unknown-linux-${LIBC} ;;
+	  PA8*) echo hppa2.0-unknown-linux-${LIBC} ;;
+	  *)    echo hppa-unknown-linux-${LIBC} ;;
+	esac
+	exit ;;
+    ppc64:Linux:*:*)
+	echo powerpc64-unknown-linux-${LIBC}
+	exit ;;
+    ppc:Linux:*:*)
+	echo powerpc-unknown-linux-${LIBC}
+	exit ;;
+    ppc64le:Linux:*:*)
+	echo powerpc64le-unknown-linux-${LIBC}
+	exit ;;
+    ppcle:Linux:*:*)
+	echo powerpcle-unknown-linux-${LIBC}
+	exit ;;
+    riscv32:Linux:*:* | riscv64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    s390:Linux:*:* | s390x:Linux:*:*)
+	echo ${UNAME_MACHINE}-ibm-linux-${LIBC}
+	exit ;;
+    sh64*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    sh*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    sparc:Linux:*:* | sparc64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    tile*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    vax:Linux:*:*)
+	echo ${UNAME_MACHINE}-dec-linux-${LIBC}
+	exit ;;
+    x86_64:Linux:*:*)
+	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
+	exit ;;
+    xtensa*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
+	exit ;;
+    i*86:DYNIX/ptx:4*:*)
+	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
+	# earlier versions are messed up and put the nodename in both
+	# sysname and nodename.
+	echo i386-sequent-sysv4
+	exit ;;
+    i*86:UNIX_SV:4.2MP:2.*)
+	# Unixware is an offshoot of SVR4, but it has its own version
+	# number series starting with 2...
+	# I am not positive that other SVR4 systems won't match this,
+	# I just have to hope.  -- rms.
+	# Use sysv4.2uw... so that sysv4* matches it.
+	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
+	exit ;;
+    i*86:OS/2:*:*)
+	# If we were able to find `uname', then EMX Unix compatibility
+	# is probably installed.
+	echo ${UNAME_MACHINE}-pc-os2-emx
+	exit ;;
+    i*86:XTS-300:*:STOP)
+	echo ${UNAME_MACHINE}-unknown-stop
+	exit ;;
+    i*86:atheos:*:*)
+	echo ${UNAME_MACHINE}-unknown-atheos
+	exit ;;
+    i*86:syllable:*:*)
+	echo ${UNAME_MACHINE}-pc-syllable
+	exit ;;
+    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)
+	echo i386-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    i*86:*DOS:*:*)
+	echo ${UNAME_MACHINE}-pc-msdosdjgpp
+	exit ;;
+    i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)
+	UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'`
+	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
+		echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
+	else
+		echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
+	fi
+	exit ;;
+    i*86:*:5:[678]*)
+	# UnixWare 7.x, OpenUNIX and OpenServer 6.
+	case `/bin/uname -X | grep "^Machine"` in
+	    *486*)	     UNAME_MACHINE=i486 ;;
+	    *Pentium)	     UNAME_MACHINE=i586 ;;
+	    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
+	esac
+	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
+	exit ;;
+    i*86:*:3.2:*)
+	if test -f /usr/options/cb.name; then
+		UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
+		echo ${UNAME_MACHINE}-pc-isc$UNAME_REL
+	elif /bin/uname -X 2>/dev/null >/dev/null ; then
+		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
+		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
+		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
+			&& UNAME_MACHINE=i586
+		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
+	else
+		echo ${UNAME_MACHINE}-pc-sysv32
+	fi
+	exit ;;
+    pc:*:*:*)
+	# Left here for compatibility:
+	# uname -m prints for DJGPP always 'pc', but it prints nothing about
+	# the processor, so we play safe by assuming i586.
+	# Note: whatever this is, it MUST be the same as what config.sub
+	# prints for the "djgpp" host, or else GDB configure will decide that
+	# this is a cross-build.
+	echo i586-pc-msdosdjgpp
+	exit ;;
+    Intel:Mach:3*:*)
+	echo i386-pc-mach3
+	exit ;;
+    paragon:*:*:*)
+	echo i860-intel-osf1
+	exit ;;
+    i860:*:4.*:*) # i860-SVR4
+	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
+	  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
+	else # Add other i860-SVR4 vendors below as they are discovered.
+	  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4
+	fi
+	exit ;;
+    mini*:CTIX:SYS*5:*)
+	# "miniframe"
+	echo m68010-convergent-sysv
+	exit ;;
+    mc68k:UNIX:SYSTEM5:3.51m)
+	echo m68k-convergent-sysv
+	exit ;;
+    M680?0:D-NIX:5.3:*)
+	echo m68k-diab-dnix
+	exit ;;
+    M68*:*:R3V[5678]*:*)
+	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
+    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
+	OS_REL=''
+	test -r /etc/.relid \
+	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4; exit; } ;;
+    NCR*:*:4.2:* | MPRAS*:*:4.2:*)
+	OS_REL='.3'
+	test -r /etc/.relid \
+	    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	    && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \
+	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
+	echo m68k-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    mc68030:UNIX_System_V:4.*:*)
+	echo m68k-atari-sysv4
+	exit ;;
+    TSUNAMI:LynxOS:2.*:*)
+	echo sparc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    rs6000:LynxOS:2.*:*)
+	echo rs6000-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)
+	echo powerpc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    SM[BE]S:UNIX_SV:*:*)
+	echo mips-dde-sysv${UNAME_RELEASE}
+	exit ;;
+    RM*:ReliantUNIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    RM*:SINIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    *:SINIX-*:*:*)
+	if uname -p 2>/dev/null >/dev/null ; then
+		UNAME_MACHINE=`(uname -p) 2>/dev/null`
+		echo ${UNAME_MACHINE}-sni-sysv4
+	else
+		echo ns32k-sni-sysv
+	fi
+	exit ;;
+    PENTIUM:*:4.0*:*)	# Unisys `ClearPath HMP IX 4000' SVR4/MP effort
+			# says <Richard.M.Bartel@ccMail.Census.GOV>
+	echo i586-unisys-sysv4
+	exit ;;
+    *:UNIX_System_V:4*:FTX*)
+	# From Gerald Hewes <hewes@openmarket.com>.
+	# How about differentiating between stratus architectures? -djm
+	echo hppa1.1-stratus-sysv4
+	exit ;;
+    *:*:*:FTX*)
+	# From seanf@swdc.stratus.com.
+	echo i860-stratus-sysv4
+	exit ;;
+    i*86:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo ${UNAME_MACHINE}-stratus-vos
+	exit ;;
+    *:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo hppa1.1-stratus-vos
+	exit ;;
+    mc68*:A/UX:*:*)
+	echo m68k-apple-aux${UNAME_RELEASE}
+	exit ;;
+    news*:NEWS-OS:6*:*)
+	echo mips-sony-newsos6
+	exit ;;
+    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
+	if [ -d /usr/nec ]; then
+		echo mips-nec-sysv${UNAME_RELEASE}
+	else
+		echo mips-unknown-sysv${UNAME_RELEASE}
+	fi
+	exit ;;
+    BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
+	echo powerpc-be-beos
+	exit ;;
+    BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
+	echo powerpc-apple-beos
+	exit ;;
+    BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
+	echo i586-pc-beos
+	exit ;;
+    BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
+	echo i586-pc-haiku
+	exit ;;
+    x86_64:Haiku:*:*)
+	echo x86_64-unknown-haiku
+	exit ;;
+    SX-4:SUPER-UX:*:*)
+	echo sx4-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-5:SUPER-UX:*:*)
+	echo sx5-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-6:SUPER-UX:*:*)
+	echo sx6-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-7:SUPER-UX:*:*)
+	echo sx7-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-8:SUPER-UX:*:*)
+	echo sx8-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-8R:SUPER-UX:*:*)
+	echo sx8r-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-ACE:SUPER-UX:*:*)
+	echo sxace-nec-superux${UNAME_RELEASE}
+	exit ;;
+    Power*:Rhapsody:*:*)
+	echo powerpc-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+    *:Rhapsody:*:*)
+	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+    *:Darwin:*:*)
+	UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown
+	eval $set_cc_for_build
+	if test "$UNAME_PROCESSOR" = unknown ; then
+	    UNAME_PROCESSOR=powerpc
+	fi
+	if test `echo "$UNAME_RELEASE" | sed -e 's/\..*//'` -le 10 ; then
+	    if [ "$CC_FOR_BUILD" != no_compiler_found ]; then
+		if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \
+		    (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		    grep IS_64BIT_ARCH >/dev/null
+		then
+		    case $UNAME_PROCESSOR in
+			i386) UNAME_PROCESSOR=x86_64 ;;
+			powerpc) UNAME_PROCESSOR=powerpc64 ;;
+		    esac
+		fi
+	    fi
+	elif test "$UNAME_PROCESSOR" = i386 ; then
+	    # Avoid executing cc on OS X 10.9, as it ships with a stub
+	    # that puts up a graphical alert prompting to install
+	    # developer tools.  Any system running Mac OS X 10.7 or
+	    # later (Darwin 11 and later) is required to have a 64-bit
+	    # processor. This is not true of the ARM version of Darwin
+	    # that Apple uses in portable devices.
+	    UNAME_PROCESSOR=x86_64
+	fi
+	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
+	exit ;;
+    *:procnto*:*:* | *:QNX:[0123456789]*:*)
+	UNAME_PROCESSOR=`uname -p`
+	if test "$UNAME_PROCESSOR" = x86; then
+		UNAME_PROCESSOR=i386
+		UNAME_MACHINE=pc
+	fi
+	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
+	exit ;;
+    *:QNX:*:4*)
+	echo i386-pc-qnx
+	exit ;;
+    NEO-?:NONSTOP_KERNEL:*:*)
+	echo neo-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    NSE-*:NONSTOP_KERNEL:*:*)
+	echo nse-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    NSR-?:NONSTOP_KERNEL:*:*)
+	echo nsr-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    *:NonStop-UX:*:*)
+	echo mips-compaq-nonstopux
+	exit ;;
+    BS2000:POSIX*:*:*)
+	echo bs2000-siemens-sysv
+	exit ;;
+    DS/*:UNIX_System_V:*:*)
+	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
+	exit ;;
+    *:Plan9:*:*)
+	# "uname -m" is not consistent, so use $cputype instead. 386
+	# is converted to i386 for consistency with other x86
+	# operating systems.
+	if test "$cputype" = 386; then
+	    UNAME_MACHINE=i386
+	else
+	    UNAME_MACHINE="$cputype"
+	fi
+	echo ${UNAME_MACHINE}-unknown-plan9
+	exit ;;
+    *:TOPS-10:*:*)
+	echo pdp10-unknown-tops10
+	exit ;;
+    *:TENEX:*:*)
+	echo pdp10-unknown-tenex
+	exit ;;
+    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
+	echo pdp10-dec-tops20
+	exit ;;
+    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
+	echo pdp10-xkl-tops20
+	exit ;;
+    *:TOPS-20:*:*)
+	echo pdp10-unknown-tops20
+	exit ;;
+    *:ITS:*:*)
+	echo pdp10-unknown-its
+	exit ;;
+    SEI:*:*:SEIUX)
+	echo mips-sei-seiux${UNAME_RELEASE}
+	exit ;;
+    *:DragonFly:*:*)
+	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`
+	exit ;;
+    *:*VMS:*:*)
+	UNAME_MACHINE=`(uname -p) 2>/dev/null`
+	case "${UNAME_MACHINE}" in
+	    A*) echo alpha-dec-vms ; exit ;;
+	    I*) echo ia64-dec-vms ; exit ;;
+	    V*) echo vax-dec-vms ; exit ;;
+	esac ;;
+    *:XENIX:*:SysV)
+	echo i386-pc-xenix
+	exit ;;
+    i*86:skyos:*:*)
+	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE} | sed -e 's/ .*$//'`
+	exit ;;
+    i*86:rdos:*:*)
+	echo ${UNAME_MACHINE}-pc-rdos
+	exit ;;
+    i*86:AROS:*:*)
+	echo ${UNAME_MACHINE}-pc-aros
+	exit ;;
+    x86_64:VMkernel:*:*)
+	echo ${UNAME_MACHINE}-unknown-esx
+	exit ;;
+    amd64:Isilon\ OneFS:*:*)
+	echo x86_64-unknown-onefs
+	exit ;;
+esac
+
+cat >&2 <<EOF
+$0: unable to guess system type
+
+This script (version $timestamp), has failed to recognize the
+operating system you are using. If your script is old, overwrite
+config.guess and config.sub with the latest versions from:
+
+  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+and
+  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
+
+If $0 has already been updated, send the following data and any
+information you think might be pertinent to config-patches@gnu.org to
+provide the necessary information to handle your system.
+
+config.guess timestamp = $timestamp
+
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`
+
+hostinfo               = `(hostinfo) 2>/dev/null`
+/bin/universe          = `(/bin/universe) 2>/dev/null`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`
+/bin/arch              = `(/bin/arch) 2>/dev/null`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
+
+UNAME_MACHINE = ${UNAME_MACHINE}
+UNAME_RELEASE = ${UNAME_RELEASE}
+UNAME_SYSTEM  = ${UNAME_SYSTEM}
+UNAME_VERSION = ${UNAME_VERSION}
+EOF
+
+exit 1
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff --git a/redis-stable/deps/jemalloc/build-aux/config.sub b/redis-stable/deps/jemalloc/build-aux/config.sub
new file mode 100755
index 00000000..dd2ca93c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/build-aux/config.sub
@@ -0,0 +1,1825 @@
+#! /bin/sh
+# Configuration validation subroutine script.
+#   Copyright 1992-2016 Free Software Foundation, Inc.
+
+timestamp='2016-11-04'
+
+# This file 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; either version 3 of the License, or
+# (at your option) any later version.
+#
+# 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, see <http://www.gnu.org/licenses/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that
+# program.  This Exception is an additional permission under section 7
+# of the GNU General Public License, version 3 ("GPLv3").
+
+
+# Please send patches to <config-patches@gnu.org>.
+#
+# Configuration subroutine to validate and canonicalize a configuration type.
+# Supply the specified configuration type as an argument.
+# If it is invalid, we print an error message on stderr and exit with code 1.
+# Otherwise, we print the canonical config type on stdout and succeed.
+
+# You can get the latest version of this script from:
+# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
+
+# This file is supposed to be the same for all GNU packages
+# and recognize all the CPU types, system types and aliases
+# that are meaningful with *any* GNU software.
+# Each package is responsible for reporting which valid configurations
+# it does not support.  The user should be able to distinguish
+# a failure to support a valid configuration from a meaningless
+# configuration.
+
+# The goal of this file is to map all the various variations of a given
+# machine specification into a single specification in the form:
+#	CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
+# or in some cases, the newer four-part form:
+#	CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
+# It is wrong to echo any other type of specification.
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS
+
+Canonicalize a configuration name.
+
+Operation modes:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.sub ($timestamp)
+
+Copyright 1992-2016 Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help"
+       exit 1 ;;
+
+    *local*)
+       # First pass through any local machine types.
+       echo $1
+       exit ;;
+
+    * )
+       break ;;
+  esac
+done
+
+case $# in
+ 0) echo "$me: missing argument$help" >&2
+    exit 1;;
+ 1) ;;
+ *) echo "$me: too many arguments$help" >&2
+    exit 1;;
+esac
+
+# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).
+# Here we must recognize all the valid KERNEL-OS combinations.
+maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'`
+case $maybe_os in
+  nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \
+  linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
+  knetbsd*-gnu* | netbsd*-gnu* | netbsd*-eabi* | \
+  kopensolaris*-gnu* | cloudabi*-eabi* | \
+  storm-chaos* | os2-emx* | rtmk-nova*)
+    os=-$maybe_os
+    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`
+    ;;
+  android-linux)
+    os=-linux-android
+    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown
+    ;;
+  *)
+    basic_machine=`echo $1 | sed 's/-[^-]*$//'`
+    if [ $basic_machine != $1 ]
+    then os=`echo $1 | sed 's/.*-/-/'`
+    else os=; fi
+    ;;
+esac
+
+### Let's recognize common machines as not being operating systems so
+### that things like config.sub decstation-3100 work.  We also
+### recognize some manufacturers as not being operating systems, so we
+### can provide default operating systems below.
+case $os in
+	-sun*os*)
+		# Prevent following clause from handling this invalid input.
+		;;
+	-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \
+	-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \
+	-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \
+	-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\
+	-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \
+	-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \
+	-apple | -axis | -knuth | -cray | -microblaze*)
+		os=
+		basic_machine=$1
+		;;
+	-bluegene*)
+		os=-cnk
+		;;
+	-sim | -cisco | -oki | -wec | -winbond)
+		os=
+		basic_machine=$1
+		;;
+	-scout)
+		;;
+	-wrs)
+		os=-vxworks
+		basic_machine=$1
+		;;
+	-chorusos*)
+		os=-chorusos
+		basic_machine=$1
+		;;
+	-chorusrdb)
+		os=-chorusrdb
+		basic_machine=$1
+		;;
+	-hiux*)
+		os=-hiuxwe2
+		;;
+	-sco6)
+		os=-sco5v6
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco5)
+		os=-sco3.2v5
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco4)
+		os=-sco3.2v4
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco3.2.[4-9]*)
+		os=`echo $os | sed -e 's/sco3.2./sco3.2v/'`
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco3.2v[4-9]*)
+		# Don't forget version if it is 3.2v4 or newer.
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco5v6*)
+		# Don't forget version if it is 3.2v4 or newer.
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco*)
+		os=-sco3.2v2
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-udk*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-isc)
+		os=-isc2.2
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-clix*)
+		basic_machine=clipper-intergraph
+		;;
+	-isc*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-lynx*178)
+		os=-lynxos178
+		;;
+	-lynx*5)
+		os=-lynxos5
+		;;
+	-lynx*)
+		os=-lynxos
+		;;
+	-ptx*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`
+		;;
+	-windowsnt*)
+		os=`echo $os | sed -e 's/windowsnt/winnt/'`
+		;;
+	-psos*)
+		os=-psos
+		;;
+	-mint | -mint[0-9]*)
+		basic_machine=m68k-atari
+		os=-mint
+		;;
+esac
+
+# Decode aliases for certain CPU-COMPANY combinations.
+case $basic_machine in
+	# Recognize the basic CPU types without company name.
+	# Some are omitted here because they have special meanings below.
+	1750a | 580 \
+	| a29k \
+	| aarch64 | aarch64_be \
+	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
+	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
+	| am33_2.0 \
+	| arc | arceb \
+	| arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \
+	| avr | avr32 \
+	| ba \
+	| be32 | be64 \
+	| bfin \
+	| c4x | c8051 | clipper \
+	| d10v | d30v | dlx | dsp16xx \
+	| e2k | epiphany \
+	| fido | fr30 | frv | ft32 \
+	| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
+	| hexagon \
+	| i370 | i860 | i960 | ia64 \
+	| ip2k | iq2000 \
+	| k1om \
+	| le32 | le64 \
+	| lm32 \
+	| m32c | m32r | m32rle | m68000 | m68k | m88k \
+	| maxq | mb | microblaze | microblazeel | mcore | mep | metag \
+	| mips | mipsbe | mipseb | mipsel | mipsle \
+	| mips16 \
+	| mips64 | mips64el \
+	| mips64octeon | mips64octeonel \
+	| mips64orion | mips64orionel \
+	| mips64r5900 | mips64r5900el \
+	| mips64vr | mips64vrel \
+	| mips64vr4100 | mips64vr4100el \
+	| mips64vr4300 | mips64vr4300el \
+	| mips64vr5000 | mips64vr5000el \
+	| mips64vr5900 | mips64vr5900el \
+	| mipsisa32 | mipsisa32el \
+	| mipsisa32r2 | mipsisa32r2el \
+	| mipsisa32r6 | mipsisa32r6el \
+	| mipsisa64 | mipsisa64el \
+	| mipsisa64r2 | mipsisa64r2el \
+	| mipsisa64r6 | mipsisa64r6el \
+	| mipsisa64sb1 | mipsisa64sb1el \
+	| mipsisa64sr71k | mipsisa64sr71kel \
+	| mipsr5900 | mipsr5900el \
+	| mipstx39 | mipstx39el \
+	| mn10200 | mn10300 \
+	| moxie \
+	| mt \
+	| msp430 \
+	| nds32 | nds32le | nds32be \
+	| nios | nios2 | nios2eb | nios2el \
+	| ns16k | ns32k \
+	| open8 | or1k | or1knd | or32 \
+	| pdp10 | pdp11 | pj | pjl \
+	| powerpc | powerpc64 | powerpc64le | powerpcle \
+	| pru \
+	| pyramid \
+	| riscv32 | riscv64 \
+	| rl78 | rx \
+	| score \
+	| sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[234]eb | sheb | shbe | shle | sh[1234]le | sh3ele \
+	| sh64 | sh64le \
+	| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \
+	| sparcv8 | sparcv9 | sparcv9b | sparcv9v \
+	| spu \
+	| tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \
+	| ubicom32 \
+	| v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \
+	| visium \
+	| we32k \
+	| x86 | xc16x | xstormy16 | xtensa \
+	| z8k | z80)
+		basic_machine=$basic_machine-unknown
+		;;
+	c54x)
+		basic_machine=tic54x-unknown
+		;;
+	c55x)
+		basic_machine=tic55x-unknown
+		;;
+	c6x)
+		basic_machine=tic6x-unknown
+		;;
+	leon|leon[3-9])
+		basic_machine=sparc-$basic_machine
+		;;
+	m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip)
+		basic_machine=$basic_machine-unknown
+		os=-none
+		;;
+	m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)
+		;;
+	ms1)
+		basic_machine=mt-unknown
+		;;
+
+	strongarm | thumb | xscale)
+		basic_machine=arm-unknown
+		;;
+	xgate)
+		basic_machine=$basic_machine-unknown
+		os=-none
+		;;
+	xscaleeb)
+		basic_machine=armeb-unknown
+		;;
+
+	xscaleel)
+		basic_machine=armel-unknown
+		;;
+
+	# We use `pc' rather than `unknown'
+	# because (1) that's what they normally are, and
+	# (2) the word "unknown" tends to confuse beginning users.
+	i*86 | x86_64)
+	  basic_machine=$basic_machine-pc
+	  ;;
+	# Object if more than one company name word.
+	*-*-*)
+		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
+		exit 1
+		;;
+	# Recognize the basic CPU types with company name.
+	580-* \
+	| a29k-* \
+	| aarch64-* | aarch64_be-* \
+	| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \
+	| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \
+	| alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \
+	| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \
+	| avr-* | avr32-* \
+	| ba-* \
+	| be32-* | be64-* \
+	| bfin-* | bs2000-* \
+	| c[123]* | c30-* | [cjt]90-* | c4x-* \
+	| c8051-* | clipper-* | craynv-* | cydra-* \
+	| d10v-* | d30v-* | dlx-* \
+	| e2k-* | elxsi-* \
+	| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \
+	| h8300-* | h8500-* \
+	| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \
+	| hexagon-* \
+	| i*86-* | i860-* | i960-* | ia64-* \
+	| ip2k-* | iq2000-* \
+	| k1om-* \
+	| le32-* | le64-* \
+	| lm32-* \
+	| m32c-* | m32r-* | m32rle-* \
+	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
+	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* \
+	| microblaze-* | microblazeel-* \
+	| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \
+	| mips16-* \
+	| mips64-* | mips64el-* \
+	| mips64octeon-* | mips64octeonel-* \
+	| mips64orion-* | mips64orionel-* \
+	| mips64r5900-* | mips64r5900el-* \
+	| mips64vr-* | mips64vrel-* \
+	| mips64vr4100-* | mips64vr4100el-* \
+	| mips64vr4300-* | mips64vr4300el-* \
+	| mips64vr5000-* | mips64vr5000el-* \
+	| mips64vr5900-* | mips64vr5900el-* \
+	| mipsisa32-* | mipsisa32el-* \
+	| mipsisa32r2-* | mipsisa32r2el-* \
+	| mipsisa32r6-* | mipsisa32r6el-* \
+	| mipsisa64-* | mipsisa64el-* \
+	| mipsisa64r2-* | mipsisa64r2el-* \
+	| mipsisa64r6-* | mipsisa64r6el-* \
+	| mipsisa64sb1-* | mipsisa64sb1el-* \
+	| mipsisa64sr71k-* | mipsisa64sr71kel-* \
+	| mipsr5900-* | mipsr5900el-* \
+	| mipstx39-* | mipstx39el-* \
+	| mmix-* \
+	| mt-* \
+	| msp430-* \
+	| nds32-* | nds32le-* | nds32be-* \
+	| nios-* | nios2-* | nios2eb-* | nios2el-* \
+	| none-* | np1-* | ns16k-* | ns32k-* \
+	| open8-* \
+	| or1k*-* \
+	| orion-* \
+	| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \
+	| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \
+	| pru-* \
+	| pyramid-* \
+	| riscv32-* | riscv64-* \
+	| rl78-* | romp-* | rs6000-* | rx-* \
+	| sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \
+	| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \
+	| sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \
+	| sparclite-* \
+	| sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx*-* \
+	| tahoe-* \
+	| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \
+	| tile*-* \
+	| tron-* \
+	| ubicom32-* \
+	| v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \
+	| vax-* \
+	| visium-* \
+	| we32k-* \
+	| x86-* | x86_64-* | xc16x-* | xps100-* \
+	| xstormy16-* | xtensa*-* \
+	| ymp-* \
+	| z8k-* | z80-*)
+		;;
+	# Recognize the basic CPU types without company name, with glob match.
+	xtensa*)
+		basic_machine=$basic_machine-unknown
+		;;
+	# Recognize the various machine names and aliases which stand
+	# for a CPU type and a company and sometimes even an OS.
+	386bsd)
+		basic_machine=i386-unknown
+		os=-bsd
+		;;
+	3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)
+		basic_machine=m68000-att
+		;;
+	3b*)
+		basic_machine=we32k-att
+		;;
+	a29khif)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	abacus)
+		basic_machine=abacus-unknown
+		;;
+	adobe68k)
+		basic_machine=m68010-adobe
+		os=-scout
+		;;
+	alliant | fx80)
+		basic_machine=fx80-alliant
+		;;
+	altos | altos3068)
+		basic_machine=m68k-altos
+		;;
+	am29k)
+		basic_machine=a29k-none
+		os=-bsd
+		;;
+	amd64)
+		basic_machine=x86_64-pc
+		;;
+	amd64-*)
+		basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	amdahl)
+		basic_machine=580-amdahl
+		os=-sysv
+		;;
+	amiga | amiga-*)
+		basic_machine=m68k-unknown
+		;;
+	amigaos | amigados)
+		basic_machine=m68k-unknown
+		os=-amigaos
+		;;
+	amigaunix | amix)
+		basic_machine=m68k-unknown
+		os=-sysv4
+		;;
+	apollo68)
+		basic_machine=m68k-apollo
+		os=-sysv
+		;;
+	apollo68bsd)
+		basic_machine=m68k-apollo
+		os=-bsd
+		;;
+	aros)
+		basic_machine=i386-pc
+		os=-aros
+		;;
+	asmjs)
+		basic_machine=asmjs-unknown
+		;;
+	aux)
+		basic_machine=m68k-apple
+		os=-aux
+		;;
+	balance)
+		basic_machine=ns32k-sequent
+		os=-dynix
+		;;
+	blackfin)
+		basic_machine=bfin-unknown
+		os=-linux
+		;;
+	blackfin-*)
+		basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	bluegene*)
+		basic_machine=powerpc-ibm
+		os=-cnk
+		;;
+	c54x-*)
+		basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c55x-*)
+		basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c6x-*)
+		basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c90)
+		basic_machine=c90-cray
+		os=-unicos
+		;;
+	cegcc)
+		basic_machine=arm-unknown
+		os=-cegcc
+		;;
+	convex-c1)
+		basic_machine=c1-convex
+		os=-bsd
+		;;
+	convex-c2)
+		basic_machine=c2-convex
+		os=-bsd
+		;;
+	convex-c32)
+		basic_machine=c32-convex
+		os=-bsd
+		;;
+	convex-c34)
+		basic_machine=c34-convex
+		os=-bsd
+		;;
+	convex-c38)
+		basic_machine=c38-convex
+		os=-bsd
+		;;
+	cray | j90)
+		basic_machine=j90-cray
+		os=-unicos
+		;;
+	craynv)
+		basic_machine=craynv-cray
+		os=-unicosmp
+		;;
+	cr16 | cr16-*)
+		basic_machine=cr16-unknown
+		os=-elf
+		;;
+	crds | unos)
+		basic_machine=m68k-crds
+		;;
+	crisv32 | crisv32-* | etraxfs*)
+		basic_machine=crisv32-axis
+		;;
+	cris | cris-* | etrax*)
+		basic_machine=cris-axis
+		;;
+	crx)
+		basic_machine=crx-unknown
+		os=-elf
+		;;
+	da30 | da30-*)
+		basic_machine=m68k-da30
+		;;
+	decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)
+		basic_machine=mips-dec
+		;;
+	decsystem10* | dec10*)
+		basic_machine=pdp10-dec
+		os=-tops10
+		;;
+	decsystem20* | dec20*)
+		basic_machine=pdp10-dec
+		os=-tops20
+		;;
+	delta | 3300 | motorola-3300 | motorola-delta \
+	      | 3300-motorola | delta-motorola)
+		basic_machine=m68k-motorola
+		;;
+	delta88)
+		basic_machine=m88k-motorola
+		os=-sysv3
+		;;
+	dicos)
+		basic_machine=i686-pc
+		os=-dicos
+		;;
+	djgpp)
+		basic_machine=i586-pc
+		os=-msdosdjgpp
+		;;
+	dpx20 | dpx20-*)
+		basic_machine=rs6000-bull
+		os=-bosx
+		;;
+	dpx2* | dpx2*-bull)
+		basic_machine=m68k-bull
+		os=-sysv3
+		;;
+	e500v[12])
+		basic_machine=powerpc-unknown
+		os=$os"spe"
+		;;
+	e500v[12]-*)
+		basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=$os"spe"
+		;;
+	ebmon29k)
+		basic_machine=a29k-amd
+		os=-ebmon
+		;;
+	elxsi)
+		basic_machine=elxsi-elxsi
+		os=-bsd
+		;;
+	encore | umax | mmax)
+		basic_machine=ns32k-encore
+		;;
+	es1800 | OSE68k | ose68k | ose | OSE)
+		basic_machine=m68k-ericsson
+		os=-ose
+		;;
+	fx2800)
+		basic_machine=i860-alliant
+		;;
+	genix)
+		basic_machine=ns32k-ns
+		;;
+	gmicro)
+		basic_machine=tron-gmicro
+		os=-sysv
+		;;
+	go32)
+		basic_machine=i386-pc
+		os=-go32
+		;;
+	h3050r* | hiux*)
+		basic_machine=hppa1.1-hitachi
+		os=-hiuxwe2
+		;;
+	h8300hms)
+		basic_machine=h8300-hitachi
+		os=-hms
+		;;
+	h8300xray)
+		basic_machine=h8300-hitachi
+		os=-xray
+		;;
+	h8500hms)
+		basic_machine=h8500-hitachi
+		os=-hms
+		;;
+	harris)
+		basic_machine=m88k-harris
+		os=-sysv3
+		;;
+	hp300-*)
+		basic_machine=m68k-hp
+		;;
+	hp300bsd)
+		basic_machine=m68k-hp
+		os=-bsd
+		;;
+	hp300hpux)
+		basic_machine=m68k-hp
+		os=-hpux
+		;;
+	hp3k9[0-9][0-9] | hp9[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hp9k2[0-9][0-9] | hp9k31[0-9])
+		basic_machine=m68000-hp
+		;;
+	hp9k3[2-9][0-9])
+		basic_machine=m68k-hp
+		;;
+	hp9k6[0-9][0-9] | hp6[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hp9k7[0-79][0-9] | hp7[0-79][0-9])
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k78[0-9] | hp78[0-9])
+		# FIXME: really hppa2.0-hp
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)
+		# FIXME: really hppa2.0-hp
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[0-9][13679] | hp8[0-9][13679])
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[0-9][0-9] | hp8[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hppa-next)
+		os=-nextstep3
+		;;
+	hppaosf)
+		basic_machine=hppa1.1-hp
+		os=-osf
+		;;
+	hppro)
+		basic_machine=hppa1.1-hp
+		os=-proelf
+		;;
+	i370-ibm* | ibm*)
+		basic_machine=i370-ibm
+		;;
+	i*86v32)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv32
+		;;
+	i*86v4*)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv4
+		;;
+	i*86v)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv
+		;;
+	i*86sol2)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-solaris2
+		;;
+	i386mach)
+		basic_machine=i386-mach
+		os=-mach
+		;;
+	i386-vsta | vsta)
+		basic_machine=i386-unknown
+		os=-vsta
+		;;
+	iris | iris4d)
+		basic_machine=mips-sgi
+		case $os in
+		    -irix*)
+			;;
+		    *)
+			os=-irix4
+			;;
+		esac
+		;;
+	isi68 | isi)
+		basic_machine=m68k-isi
+		os=-sysv
+		;;
+	leon-*|leon[3-9]-*)
+		basic_machine=sparc-`echo $basic_machine | sed 's/-.*//'`
+		;;
+	m68knommu)
+		basic_machine=m68k-unknown
+		os=-linux
+		;;
+	m68knommu-*)
+		basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	m88k-omron*)
+		basic_machine=m88k-omron
+		;;
+	magnum | m3230)
+		basic_machine=mips-mips
+		os=-sysv
+		;;
+	merlin)
+		basic_machine=ns32k-utek
+		os=-sysv
+		;;
+	microblaze*)
+		basic_machine=microblaze-xilinx
+		;;
+	mingw64)
+		basic_machine=x86_64-pc
+		os=-mingw64
+		;;
+	mingw32)
+		basic_machine=i686-pc
+		os=-mingw32
+		;;
+	mingw32ce)
+		basic_machine=arm-unknown
+		os=-mingw32ce
+		;;
+	miniframe)
+		basic_machine=m68000-convergent
+		;;
+	*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)
+		basic_machine=m68k-atari
+		os=-mint
+		;;
+	mips3*-*)
+		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`
+		;;
+	mips3*)
+		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown
+		;;
+	monitor)
+		basic_machine=m68k-rom68k
+		os=-coff
+		;;
+	morphos)
+		basic_machine=powerpc-unknown
+		os=-morphos
+		;;
+	moxiebox)
+		basic_machine=moxie-unknown
+		os=-moxiebox
+		;;
+	msdos)
+		basic_machine=i386-pc
+		os=-msdos
+		;;
+	ms1-*)
+		basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`
+		;;
+	msys)
+		basic_machine=i686-pc
+		os=-msys
+		;;
+	mvs)
+		basic_machine=i370-ibm
+		os=-mvs
+		;;
+	nacl)
+		basic_machine=le32-unknown
+		os=-nacl
+		;;
+	ncr3000)
+		basic_machine=i486-ncr
+		os=-sysv4
+		;;
+	netbsd386)
+		basic_machine=i386-unknown
+		os=-netbsd
+		;;
+	netwinder)
+		basic_machine=armv4l-rebel
+		os=-linux
+		;;
+	news | news700 | news800 | news900)
+		basic_machine=m68k-sony
+		os=-newsos
+		;;
+	news1000)
+		basic_machine=m68030-sony
+		os=-newsos
+		;;
+	news-3600 | risc-news)
+		basic_machine=mips-sony
+		os=-newsos
+		;;
+	necv70)
+		basic_machine=v70-nec
+		os=-sysv
+		;;
+	next | m*-next )
+		basic_machine=m68k-next
+		case $os in
+		    -nextstep* )
+			;;
+		    -ns2*)
+		      os=-nextstep2
+			;;
+		    *)
+		      os=-nextstep3
+			;;
+		esac
+		;;
+	nh3000)
+		basic_machine=m68k-harris
+		os=-cxux
+		;;
+	nh[45]000)
+		basic_machine=m88k-harris
+		os=-cxux
+		;;
+	nindy960)
+		basic_machine=i960-intel
+		os=-nindy
+		;;
+	mon960)
+		basic_machine=i960-intel
+		os=-mon960
+		;;
+	nonstopux)
+		basic_machine=mips-compaq
+		os=-nonstopux
+		;;
+	np1)
+		basic_machine=np1-gould
+		;;
+	neo-tandem)
+		basic_machine=neo-tandem
+		;;
+	nse-tandem)
+		basic_machine=nse-tandem
+		;;
+	nsr-tandem)
+		basic_machine=nsr-tandem
+		;;
+	op50n-* | op60c-*)
+		basic_machine=hppa1.1-oki
+		os=-proelf
+		;;
+	openrisc | openrisc-*)
+		basic_machine=or32-unknown
+		;;
+	os400)
+		basic_machine=powerpc-ibm
+		os=-os400
+		;;
+	OSE68000 | ose68000)
+		basic_machine=m68000-ericsson
+		os=-ose
+		;;
+	os68k)
+		basic_machine=m68k-none
+		os=-os68k
+		;;
+	pa-hitachi)
+		basic_machine=hppa1.1-hitachi
+		os=-hiuxwe2
+		;;
+	paragon)
+		basic_machine=i860-intel
+		os=-osf
+		;;
+	parisc)
+		basic_machine=hppa-unknown
+		os=-linux
+		;;
+	parisc-*)
+		basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	pbd)
+		basic_machine=sparc-tti
+		;;
+	pbb)
+		basic_machine=m68k-tti
+		;;
+	pc532 | pc532-*)
+		basic_machine=ns32k-pc532
+		;;
+	pc98)
+		basic_machine=i386-pc
+		;;
+	pc98-*)
+		basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentium | p5 | k5 | k6 | nexgen | viac3)
+		basic_machine=i586-pc
+		;;
+	pentiumpro | p6 | 6x86 | athlon | athlon_*)
+		basic_machine=i686-pc
+		;;
+	pentiumii | pentium2 | pentiumiii | pentium3)
+		basic_machine=i686-pc
+		;;
+	pentium4)
+		basic_machine=i786-pc
+		;;
+	pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)
+		basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentiumpro-* | p6-* | 6x86-* | athlon-*)
+		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)
+		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentium4-*)
+		basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pn)
+		basic_machine=pn-gould
+		;;
+	power)	basic_machine=power-ibm
+		;;
+	ppc | ppcbe)	basic_machine=powerpc-unknown
+		;;
+	ppc-* | ppcbe-*)
+		basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppcle | powerpclittle)
+		basic_machine=powerpcle-unknown
+		;;
+	ppcle-* | powerpclittle-*)
+		basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppc64)	basic_machine=powerpc64-unknown
+		;;
+	ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppc64le | powerpc64little)
+		basic_machine=powerpc64le-unknown
+		;;
+	ppc64le-* | powerpc64little-*)
+		basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ps2)
+		basic_machine=i386-ibm
+		;;
+	pw32)
+		basic_machine=i586-unknown
+		os=-pw32
+		;;
+	rdos | rdos64)
+		basic_machine=x86_64-pc
+		os=-rdos
+		;;
+	rdos32)
+		basic_machine=i386-pc
+		os=-rdos
+		;;
+	rom68k)
+		basic_machine=m68k-rom68k
+		os=-coff
+		;;
+	rm[46]00)
+		basic_machine=mips-siemens
+		;;
+	rtpc | rtpc-*)
+		basic_machine=romp-ibm
+		;;
+	s390 | s390-*)
+		basic_machine=s390-ibm
+		;;
+	s390x | s390x-*)
+		basic_machine=s390x-ibm
+		;;
+	sa29200)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	sb1)
+		basic_machine=mipsisa64sb1-unknown
+		;;
+	sb1el)
+		basic_machine=mipsisa64sb1el-unknown
+		;;
+	sde)
+		basic_machine=mipsisa32-sde
+		os=-elf
+		;;
+	sei)
+		basic_machine=mips-sei
+		os=-seiux
+		;;
+	sequent)
+		basic_machine=i386-sequent
+		;;
+	sh)
+		basic_machine=sh-hitachi
+		os=-hms
+		;;
+	sh5el)
+		basic_machine=sh5le-unknown
+		;;
+	sh64)
+		basic_machine=sh64-unknown
+		;;
+	sparclite-wrs | simso-wrs)
+		basic_machine=sparclite-wrs
+		os=-vxworks
+		;;
+	sps7)
+		basic_machine=m68k-bull
+		os=-sysv2
+		;;
+	spur)
+		basic_machine=spur-unknown
+		;;
+	st2000)
+		basic_machine=m68k-tandem
+		;;
+	stratus)
+		basic_machine=i860-stratus
+		os=-sysv4
+		;;
+	strongarm-* | thumb-*)
+		basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	sun2)
+		basic_machine=m68000-sun
+		;;
+	sun2os3)
+		basic_machine=m68000-sun
+		os=-sunos3
+		;;
+	sun2os4)
+		basic_machine=m68000-sun
+		os=-sunos4
+		;;
+	sun3os3)
+		basic_machine=m68k-sun
+		os=-sunos3
+		;;
+	sun3os4)
+		basic_machine=m68k-sun
+		os=-sunos4
+		;;
+	sun4os3)
+		basic_machine=sparc-sun
+		os=-sunos3
+		;;
+	sun4os4)
+		basic_machine=sparc-sun
+		os=-sunos4
+		;;
+	sun4sol2)
+		basic_machine=sparc-sun
+		os=-solaris2
+		;;
+	sun3 | sun3-*)
+		basic_machine=m68k-sun
+		;;
+	sun4)
+		basic_machine=sparc-sun
+		;;
+	sun386 | sun386i | roadrunner)
+		basic_machine=i386-sun
+		;;
+	sv1)
+		basic_machine=sv1-cray
+		os=-unicos
+		;;
+	symmetry)
+		basic_machine=i386-sequent
+		os=-dynix
+		;;
+	t3e)
+		basic_machine=alphaev5-cray
+		os=-unicos
+		;;
+	t90)
+		basic_machine=t90-cray
+		os=-unicos
+		;;
+	tile*)
+		basic_machine=$basic_machine-unknown
+		os=-linux-gnu
+		;;
+	tx39)
+		basic_machine=mipstx39-unknown
+		;;
+	tx39el)
+		basic_machine=mipstx39el-unknown
+		;;
+	toad1)
+		basic_machine=pdp10-xkl
+		os=-tops20
+		;;
+	tower | tower-32)
+		basic_machine=m68k-ncr
+		;;
+	tpf)
+		basic_machine=s390x-ibm
+		os=-tpf
+		;;
+	udi29k)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	ultra3)
+		basic_machine=a29k-nyu
+		os=-sym1
+		;;
+	v810 | necv810)
+		basic_machine=v810-nec
+		os=-none
+		;;
+	vaxv)
+		basic_machine=vax-dec
+		os=-sysv
+		;;
+	vms)
+		basic_machine=vax-dec
+		os=-vms
+		;;
+	vpp*|vx|vx-*)
+		basic_machine=f301-fujitsu
+		;;
+	vxworks960)
+		basic_machine=i960-wrs
+		os=-vxworks
+		;;
+	vxworks68)
+		basic_machine=m68k-wrs
+		os=-vxworks
+		;;
+	vxworks29k)
+		basic_machine=a29k-wrs
+		os=-vxworks
+		;;
+	w65*)
+		basic_machine=w65-wdc
+		os=-none
+		;;
+	w89k-*)
+		basic_machine=hppa1.1-winbond
+		os=-proelf
+		;;
+	xbox)
+		basic_machine=i686-pc
+		os=-mingw32
+		;;
+	xps | xps100)
+		basic_machine=xps100-honeywell
+		;;
+	xscale-* | xscalee[bl]-*)
+		basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'`
+		;;
+	ymp)
+		basic_machine=ymp-cray
+		os=-unicos
+		;;
+	z8k-*-coff)
+		basic_machine=z8k-unknown
+		os=-sim
+		;;
+	z80-*-coff)
+		basic_machine=z80-unknown
+		os=-sim
+		;;
+	none)
+		basic_machine=none-none
+		os=-none
+		;;
+
+# Here we handle the default manufacturer of certain CPU types.  It is in
+# some cases the only manufacturer, in others, it is the most popular.
+	w89k)
+		basic_machine=hppa1.1-winbond
+		;;
+	op50n)
+		basic_machine=hppa1.1-oki
+		;;
+	op60c)
+		basic_machine=hppa1.1-oki
+		;;
+	romp)
+		basic_machine=romp-ibm
+		;;
+	mmix)
+		basic_machine=mmix-knuth
+		;;
+	rs6000)
+		basic_machine=rs6000-ibm
+		;;
+	vax)
+		basic_machine=vax-dec
+		;;
+	pdp10)
+		# there are many clones, so DEC is not a safe bet
+		basic_machine=pdp10-unknown
+		;;
+	pdp11)
+		basic_machine=pdp11-dec
+		;;
+	we32k)
+		basic_machine=we32k-att
+		;;
+	sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)
+		basic_machine=sh-unknown
+		;;
+	sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)
+		basic_machine=sparc-sun
+		;;
+	cydra)
+		basic_machine=cydra-cydrome
+		;;
+	orion)
+		basic_machine=orion-highlevel
+		;;
+	orion105)
+		basic_machine=clipper-highlevel
+		;;
+	mac | mpw | mac-mpw)
+		basic_machine=m68k-apple
+		;;
+	pmac | pmac-mpw)
+		basic_machine=powerpc-apple
+		;;
+	*-unknown)
+		# Make sure to match an already-canonicalized machine name.
+		;;
+	*)
+		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
+		exit 1
+		;;
+esac
+
+# Here we canonicalize certain aliases for manufacturers.
+case $basic_machine in
+	*-digital*)
+		basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`
+		;;
+	*-commodore*)
+		basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`
+		;;
+	*)
+		;;
+esac
+
+# Decode manufacturer-specific aliases for certain operating systems.
+
+if [ x"$os" != x"" ]
+then
+case $os in
+	# First match some system type aliases
+	# that might get confused with valid system types.
+	# -solaris* is a basic system type, with this one exception.
+	-auroraux)
+		os=-auroraux
+		;;
+	-solaris1 | -solaris1.*)
+		os=`echo $os | sed -e 's|solaris1|sunos4|'`
+		;;
+	-solaris)
+		os=-solaris2
+		;;
+	-svr4*)
+		os=-sysv4
+		;;
+	-unixware*)
+		os=-sysv4.2uw
+		;;
+	-gnu/linux*)
+		os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`
+		;;
+	# First accept the basic system types.
+	# The portable systems comes first.
+	# Each alternative MUST END IN A *, to match a version number.
+	# -sysv* is not here because it comes later, after sysvr4.
+	-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \
+	      | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\
+	      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \
+	      | -sym* | -kopensolaris* | -plan9* \
+	      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \
+	      | -aos* | -aros* | -cloudabi* | -sortix* \
+	      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \
+	      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \
+	      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \
+	      | -bitrig* | -openbsd* | -solidbsd* | -libertybsd* \
+	      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \
+	      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \
+	      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \
+	      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \
+	      | -chorusos* | -chorusrdb* | -cegcc* \
+	      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
+	      | -midipix* | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \
+	      | -linux-newlib* | -linux-musl* | -linux-uclibc* \
+	      | -uxpv* | -beos* | -mpeix* | -udk* | -moxiebox* \
+	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
+	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
+	      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \
+	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
+	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
+	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
+	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* \
+	      | -onefs* | -tirtos* | -phoenix* | -fuchsia*)
+	# Remember, each alternative MUST END IN *, to match a version number.
+		;;
+	-qnx*)
+		case $basic_machine in
+		    x86-* | i*86-*)
+			;;
+		    *)
+			os=-nto$os
+			;;
+		esac
+		;;
+	-nto-qnx*)
+		;;
+	-nto*)
+		os=`echo $os | sed -e 's|nto|nto-qnx|'`
+		;;
+	-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \
+	      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \
+	      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)
+		;;
+	-mac*)
+		os=`echo $os | sed -e 's|mac|macos|'`
+		;;
+	-linux-dietlibc)
+		os=-linux-dietlibc
+		;;
+	-linux*)
+		os=`echo $os | sed -e 's|linux|linux-gnu|'`
+		;;
+	-sunos5*)
+		os=`echo $os | sed -e 's|sunos5|solaris2|'`
+		;;
+	-sunos6*)
+		os=`echo $os | sed -e 's|sunos6|solaris3|'`
+		;;
+	-opened*)
+		os=-openedition
+		;;
+	-os400*)
+		os=-os400
+		;;
+	-wince*)
+		os=-wince
+		;;
+	-osfrose*)
+		os=-osfrose
+		;;
+	-osf*)
+		os=-osf
+		;;
+	-utek*)
+		os=-bsd
+		;;
+	-dynix*)
+		os=-bsd
+		;;
+	-acis*)
+		os=-aos
+		;;
+	-atheos*)
+		os=-atheos
+		;;
+	-syllable*)
+		os=-syllable
+		;;
+	-386bsd)
+		os=-bsd
+		;;
+	-ctix* | -uts*)
+		os=-sysv
+		;;
+	-nova*)
+		os=-rtmk-nova
+		;;
+	-ns2 )
+		os=-nextstep2
+		;;
+	-nsk*)
+		os=-nsk
+		;;
+	# Preserve the version number of sinix5.
+	-sinix5.*)
+		os=`echo $os | sed -e 's|sinix|sysv|'`
+		;;
+	-sinix*)
+		os=-sysv4
+		;;
+	-tpf*)
+		os=-tpf
+		;;
+	-triton*)
+		os=-sysv3
+		;;
+	-oss*)
+		os=-sysv3
+		;;
+	-svr4)
+		os=-sysv4
+		;;
+	-svr3)
+		os=-sysv3
+		;;
+	-sysvr4)
+		os=-sysv4
+		;;
+	# This must come after -sysvr4.
+	-sysv*)
+		;;
+	-ose*)
+		os=-ose
+		;;
+	-es1800*)
+		os=-ose
+		;;
+	-xenix)
+		os=-xenix
+		;;
+	-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
+		os=-mint
+		;;
+	-aros*)
+		os=-aros
+		;;
+	-zvmoe)
+		os=-zvmoe
+		;;
+	-dicos*)
+		os=-dicos
+		;;
+	-nacl*)
+		;;
+	-ios)
+		;;
+	-none)
+		;;
+	*)
+		# Get rid of the `-' at the beginning of $os.
+		os=`echo $os | sed 's/[^-]*-//'`
+		echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2
+		exit 1
+		;;
+esac
+else
+
+# Here we handle the default operating systems that come with various machines.
+# The value should be what the vendor currently ships out the door with their
+# machine or put another way, the most popular os provided with the machine.
+
+# Note that if you're going to try to match "-MANUFACTURER" here (say,
+# "-sun"), then you have to tell the case statement up towards the top
+# that MANUFACTURER isn't an operating system.  Otherwise, code above
+# will signal an error saying that MANUFACTURER isn't an operating
+# system, and we'll never get to this point.
+
+case $basic_machine in
+	score-*)
+		os=-elf
+		;;
+	spu-*)
+		os=-elf
+		;;
+	*-acorn)
+		os=-riscix1.2
+		;;
+	arm*-rebel)
+		os=-linux
+		;;
+	arm*-semi)
+		os=-aout
+		;;
+	c4x-* | tic4x-*)
+		os=-coff
+		;;
+	c8051-*)
+		os=-elf
+		;;
+	hexagon-*)
+		os=-elf
+		;;
+	tic54x-*)
+		os=-coff
+		;;
+	tic55x-*)
+		os=-coff
+		;;
+	tic6x-*)
+		os=-coff
+		;;
+	# This must come before the *-dec entry.
+	pdp10-*)
+		os=-tops20
+		;;
+	pdp11-*)
+		os=-none
+		;;
+	*-dec | vax-*)
+		os=-ultrix4.2
+		;;
+	m68*-apollo)
+		os=-domain
+		;;
+	i386-sun)
+		os=-sunos4.0.2
+		;;
+	m68000-sun)
+		os=-sunos3
+		;;
+	m68*-cisco)
+		os=-aout
+		;;
+	mep-*)
+		os=-elf
+		;;
+	mips*-cisco)
+		os=-elf
+		;;
+	mips*-*)
+		os=-elf
+		;;
+	or32-*)
+		os=-coff
+		;;
+	*-tti)	# must be before sparc entry or we get the wrong os.
+		os=-sysv3
+		;;
+	sparc-* | *-sun)
+		os=-sunos4.1.1
+		;;
+	*-be)
+		os=-beos
+		;;
+	*-haiku)
+		os=-haiku
+		;;
+	*-ibm)
+		os=-aix
+		;;
+	*-knuth)
+		os=-mmixware
+		;;
+	*-wec)
+		os=-proelf
+		;;
+	*-winbond)
+		os=-proelf
+		;;
+	*-oki)
+		os=-proelf
+		;;
+	*-hp)
+		os=-hpux
+		;;
+	*-hitachi)
+		os=-hiux
+		;;
+	i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)
+		os=-sysv
+		;;
+	*-cbm)
+		os=-amigaos
+		;;
+	*-dg)
+		os=-dgux
+		;;
+	*-dolphin)
+		os=-sysv3
+		;;
+	m68k-ccur)
+		os=-rtu
+		;;
+	m88k-omron*)
+		os=-luna
+		;;
+	*-next )
+		os=-nextstep
+		;;
+	*-sequent)
+		os=-ptx
+		;;
+	*-crds)
+		os=-unos
+		;;
+	*-ns)
+		os=-genix
+		;;
+	i370-*)
+		os=-mvs
+		;;
+	*-next)
+		os=-nextstep3
+		;;
+	*-gould)
+		os=-sysv
+		;;
+	*-highlevel)
+		os=-bsd
+		;;
+	*-encore)
+		os=-bsd
+		;;
+	*-sgi)
+		os=-irix
+		;;
+	*-siemens)
+		os=-sysv4
+		;;
+	*-masscomp)
+		os=-rtu
+		;;
+	f30[01]-fujitsu | f700-fujitsu)
+		os=-uxpv
+		;;
+	*-rom68k)
+		os=-coff
+		;;
+	*-*bug)
+		os=-coff
+		;;
+	*-apple)
+		os=-macos
+		;;
+	*-atari*)
+		os=-mint
+		;;
+	*)
+		os=-none
+		;;
+esac
+fi
+
+# Here we handle the case where we know the os, and the CPU type, but not the
+# manufacturer.  We pick the logical manufacturer.
+vendor=unknown
+case $basic_machine in
+	*-unknown)
+		case $os in
+			-riscix*)
+				vendor=acorn
+				;;
+			-sunos*)
+				vendor=sun
+				;;
+			-cnk*|-aix*)
+				vendor=ibm
+				;;
+			-beos*)
+				vendor=be
+				;;
+			-hpux*)
+				vendor=hp
+				;;
+			-mpeix*)
+				vendor=hp
+				;;
+			-hiux*)
+				vendor=hitachi
+				;;
+			-unos*)
+				vendor=crds
+				;;
+			-dgux*)
+				vendor=dg
+				;;
+			-luna*)
+				vendor=omron
+				;;
+			-genix*)
+				vendor=ns
+				;;
+			-mvs* | -opened*)
+				vendor=ibm
+				;;
+			-os400*)
+				vendor=ibm
+				;;
+			-ptx*)
+				vendor=sequent
+				;;
+			-tpf*)
+				vendor=ibm
+				;;
+			-vxsim* | -vxworks* | -windiss*)
+				vendor=wrs
+				;;
+			-aux*)
+				vendor=apple
+				;;
+			-hms*)
+				vendor=hitachi
+				;;
+			-mpw* | -macos*)
+				vendor=apple
+				;;
+			-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
+				vendor=atari
+				;;
+			-vos*)
+				vendor=stratus
+				;;
+		esac
+		basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"`
+		;;
+esac
+
+echo $basic_machine$os
+exit
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff --git a/redis-stable/deps/jemalloc/build-aux/install-sh b/redis-stable/deps/jemalloc/build-aux/install-sh
new file mode 100755
index 00000000..ebc66913
--- /dev/null
+++ b/redis-stable/deps/jemalloc/build-aux/install-sh
@@ -0,0 +1,250 @@
+#! /bin/sh
+#
+# install - install a program, script, or datafile
+# This comes from X11R5 (mit/util/scripts/install.sh).
+#
+# Copyright 1991 by the Massachusetts Institute of Technology
+#
+# Permission to use, copy, modify, distribute, and sell this software and its
+# documentation for any purpose is hereby granted without fee, provided that
+# the above copyright notice appear in all copies and that both that
+# copyright notice and this permission notice appear in supporting
+# documentation, and that the name of M.I.T. not be used in advertising or
+# publicity pertaining to distribution of the software without specific,
+# written prior permission.  M.I.T. makes no representations about the
+# suitability of this software for any purpose.  It is provided "as is"
+# without express or implied warranty.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# `make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.  It can only install one file at a time, a restriction
+# shared with many OS's install programs.
+
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit="${DOITPROG-}"
+
+
+# put in absolute paths if you don't have them in your path; or use env. vars.
+
+mvprog="${MVPROG-mv}"
+cpprog="${CPPROG-cp}"
+chmodprog="${CHMODPROG-chmod}"
+chownprog="${CHOWNPROG-chown}"
+chgrpprog="${CHGRPPROG-chgrp}"
+stripprog="${STRIPPROG-strip}"
+rmprog="${RMPROG-rm}"
+mkdirprog="${MKDIRPROG-mkdir}"
+
+transformbasename=""
+transform_arg=""
+instcmd="$mvprog"
+chmodcmd="$chmodprog 0755"
+chowncmd=""
+chgrpcmd=""
+stripcmd=""
+rmcmd="$rmprog -f"
+mvcmd="$mvprog"
+src=""
+dst=""
+dir_arg=""
+
+while [ x"$1" != x ]; do
+    case $1 in
+	-c) instcmd="$cpprog"
+	    shift
+	    continue;;
+
+	-d) dir_arg=true
+	    shift
+	    continue;;
+
+	-m) chmodcmd="$chmodprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-o) chowncmd="$chownprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-g) chgrpcmd="$chgrpprog $2"
+	    shift
+	    shift
+	    continue;;
+
+	-s) stripcmd="$stripprog"
+	    shift
+	    continue;;
+
+	-t=*) transformarg=`echo $1 | sed 's/-t=//'`
+	    shift
+	    continue;;
+
+	-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
+	    shift
+	    continue;;
+
+	*)  if [ x"$src" = x ]
+	    then
+		src=$1
+	    else
+		# this colon is to work around a 386BSD /bin/sh bug
+		:
+		dst=$1
+	    fi
+	    shift
+	    continue;;
+    esac
+done
+
+if [ x"$src" = x ]
+then
+	echo "install:	no input file specified"
+	exit 1
+else
+	true
+fi
+
+if [ x"$dir_arg" != x ]; then
+	dst=$src
+	src=""
+	
+	if [ -d $dst ]; then
+		instcmd=:
+	else
+		instcmd=mkdir
+	fi
+else
+
+# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
+# might cause directories to be created, which would be especially bad 
+# if $src (and thus $dsttmp) contains '*'.
+
+	if [ -f $src -o -d $src ]
+	then
+		true
+	else
+		echo "install:  $src does not exist"
+		exit 1
+	fi
+	
+	if [ x"$dst" = x ]
+	then
+		echo "install:	no destination specified"
+		exit 1
+	else
+		true
+	fi
+
+# If destination is a directory, append the input filename; if your system
+# does not like double slashes in filenames, you may need to add some logic
+
+	if [ -d $dst ]
+	then
+		dst="$dst"/`basename $src`
+	else
+		true
+	fi
+fi
+
+## this sed command emulates the dirname command
+dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`
+
+# Make sure that the destination directory exists.
+#  this part is taken from Noah Friedman's mkinstalldirs script
+
+# Skip lots of stat calls in the usual case.
+if [ ! -d "$dstdir" ]; then
+defaultIFS='	
+'
+IFS="${IFS-${defaultIFS}}"
+
+oIFS="${IFS}"
+# Some sh's can't handle IFS=/ for some reason.
+IFS='%'
+set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
+IFS="${oIFS}"
+
+pathcomp=''
+
+while [ $# -ne 0 ] ; do
+	pathcomp="${pathcomp}${1}"
+	shift
+
+	if [ ! -d "${pathcomp}" ] ;
+        then
+		$mkdirprog "${pathcomp}"
+	else
+		true
+	fi
+
+	pathcomp="${pathcomp}/"
+done
+fi
+
+if [ x"$dir_arg" != x ]
+then
+	$doit $instcmd $dst &&
+
+	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi &&
+	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi &&
+	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi &&
+	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi
+else
+
+# If we're going to rename the final executable, determine the name now.
+
+	if [ x"$transformarg" = x ] 
+	then
+		dstfile=`basename $dst`
+	else
+		dstfile=`basename $dst $transformbasename | 
+			sed $transformarg`$transformbasename
+	fi
+
+# don't allow the sed command to completely eliminate the filename
+
+	if [ x"$dstfile" = x ] 
+	then
+		dstfile=`basename $dst`
+	else
+		true
+	fi
+
+# Make a temp file name in the proper directory.
+
+	dsttmp=$dstdir/#inst.$$#
+
+# Move or copy the file name to the temp name
+
+	$doit $instcmd $src $dsttmp &&
+
+	trap "rm -f ${dsttmp}" 0 &&
+
+# and set any options; do chmod last to preserve setuid bits
+
+# If any of these fail, we abort the whole thing.  If we want to
+# ignore errors from any of these, just make sure not to ignore
+# errors from the above "$doit $instcmd $src $dsttmp" command.
+
+	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi &&
+	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi &&
+	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi &&
+	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi &&
+
+# Now rename the file to the real destination.
+
+	$doit $rmcmd -f $dstdir/$dstfile &&
+	$doit $mvcmd $dsttmp $dstdir/$dstfile 
+
+fi &&
+
+
+exit 0
diff --git a/redis-stable/deps/jemalloc/config.stamp.in b/redis-stable/deps/jemalloc/config.stamp.in
new file mode 100644
index 00000000..e69de29b
diff --git a/redis-stable/deps/jemalloc/configure.ac b/redis-stable/deps/jemalloc/configure.ac
new file mode 100644
index 00000000..afa5df80
--- /dev/null
+++ b/redis-stable/deps/jemalloc/configure.ac
@@ -0,0 +1,2294 @@
+dnl Process this file with autoconf to produce a configure script.
+AC_PREREQ(2.68)
+AC_INIT([Makefile.in])
+
+AC_CONFIG_AUX_DIR([build-aux])
+
+dnl ============================================================================
+dnl Custom macro definitions.
+
+dnl JE_CONCAT_VVV(r, a, b)
+dnl
+dnl Set $r to the concatenation of $a and $b, with a space separating them iff
+dnl both $a and $b are non-empty.
+AC_DEFUN([JE_CONCAT_VVV],
+if test "x[$]{$2}" = "x" -o "x[$]{$3}" = "x" ; then
+  $1="[$]{$2}[$]{$3}"
+else
+  $1="[$]{$2} [$]{$3}"
+fi
+)
+
+dnl JE_APPEND_VS(a, b)
+dnl
+dnl Set $a to the concatenation of $a and b, with a space separating them iff
+dnl both $a and b are non-empty.
+AC_DEFUN([JE_APPEND_VS],
+  T_APPEND_V=$2
+  JE_CONCAT_VVV($1, $1, T_APPEND_V)
+)
+
+CONFIGURE_CFLAGS=
+SPECIFIED_CFLAGS="${CFLAGS}"
+dnl JE_CFLAGS_ADD(cflag)
+dnl
+dnl CFLAGS is the concatenation of CONFIGURE_CFLAGS and SPECIFIED_CFLAGS
+dnl (ignoring EXTRA_CFLAGS, which does not impact configure tests.  This macro
+dnl appends to CONFIGURE_CFLAGS and regenerates CFLAGS.
+AC_DEFUN([JE_CFLAGS_ADD],
+[
+AC_MSG_CHECKING([whether compiler supports $1])
+T_CONFIGURE_CFLAGS="${CONFIGURE_CFLAGS}"
+JE_APPEND_VS(CONFIGURE_CFLAGS, $1)
+JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
+[[
+]], [[
+    return 0;
+]])],
+              [je_cv_cflags_added=$1]
+              AC_MSG_RESULT([yes]),
+              [je_cv_cflags_added=]
+              AC_MSG_RESULT([no])
+              [CONFIGURE_CFLAGS="${T_CONFIGURE_CFLAGS}"]
+)
+JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
+])
+
+dnl JE_CFLAGS_SAVE()
+dnl JE_CFLAGS_RESTORE()
+dnl
+dnl Save/restore CFLAGS.  Nesting is not supported.
+AC_DEFUN([JE_CFLAGS_SAVE],
+SAVED_CONFIGURE_CFLAGS="${CONFIGURE_CFLAGS}"
+)
+AC_DEFUN([JE_CFLAGS_RESTORE],
+CONFIGURE_CFLAGS="${SAVED_CONFIGURE_CFLAGS}"
+JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
+)
+
+CONFIGURE_CXXFLAGS=
+SPECIFIED_CXXFLAGS="${CXXFLAGS}"
+dnl JE_CXXFLAGS_ADD(cxxflag)
+AC_DEFUN([JE_CXXFLAGS_ADD],
+[
+AC_MSG_CHECKING([whether compiler supports $1])
+T_CONFIGURE_CXXFLAGS="${CONFIGURE_CXXFLAGS}"
+JE_APPEND_VS(CONFIGURE_CXXFLAGS, $1)
+JE_CONCAT_VVV(CXXFLAGS, CONFIGURE_CXXFLAGS, SPECIFIED_CXXFLAGS)
+AC_LANG_PUSH([C++])
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
+[[
+]], [[
+    return 0;
+]])],
+              [je_cv_cxxflags_added=$1]
+              AC_MSG_RESULT([yes]),
+              [je_cv_cxxflags_added=]
+              AC_MSG_RESULT([no])
+              [CONFIGURE_CXXFLAGS="${T_CONFIGURE_CXXFLAGS}"]
+)
+AC_LANG_POP([C++])
+JE_CONCAT_VVV(CXXFLAGS, CONFIGURE_CXXFLAGS, SPECIFIED_CXXFLAGS)
+])
+
+dnl JE_COMPILABLE(label, hcode, mcode, rvar)
+dnl
+dnl Use AC_LINK_IFELSE() rather than AC_COMPILE_IFELSE() so that linker errors
+dnl cause failure.
+AC_DEFUN([JE_COMPILABLE],
+[
+AC_CACHE_CHECK([whether $1 is compilable],
+               [$4],
+               [AC_LINK_IFELSE([AC_LANG_PROGRAM([$2],
+                                                [$3])],
+                               [$4=yes],
+                               [$4=no])])
+])
+
+dnl ============================================================================
+
+CONFIG=`echo ${ac_configure_args} | sed -e 's#'"'"'\([^ ]*\)'"'"'#\1#g'`
+AC_SUBST([CONFIG])
+
+dnl Library revision.
+rev=2
+AC_SUBST([rev])
+
+srcroot=$srcdir
+if test "x${srcroot}" = "x." ; then
+  srcroot=""
+else
+  srcroot="${srcroot}/"
+fi
+AC_SUBST([srcroot])
+abs_srcroot="`cd \"${srcdir}\"; pwd`/"
+AC_SUBST([abs_srcroot])
+
+objroot=""
+AC_SUBST([objroot])
+abs_objroot="`pwd`/"
+AC_SUBST([abs_objroot])
+
+dnl Munge install path variables.
+if test "x$prefix" = "xNONE" ; then
+  prefix="/usr/local"
+fi
+if test "x$exec_prefix" = "xNONE" ; then
+  exec_prefix=$prefix
+fi
+PREFIX=$prefix
+AC_SUBST([PREFIX])
+BINDIR=`eval echo $bindir`
+BINDIR=`eval echo $BINDIR`
+AC_SUBST([BINDIR])
+INCLUDEDIR=`eval echo $includedir`
+INCLUDEDIR=`eval echo $INCLUDEDIR`
+AC_SUBST([INCLUDEDIR])
+LIBDIR=`eval echo $libdir`
+LIBDIR=`eval echo $LIBDIR`
+AC_SUBST([LIBDIR])
+DATADIR=`eval echo $datadir`
+DATADIR=`eval echo $DATADIR`
+AC_SUBST([DATADIR])
+MANDIR=`eval echo $mandir`
+MANDIR=`eval echo $MANDIR`
+AC_SUBST([MANDIR])
+
+dnl Support for building documentation.
+AC_PATH_PROG([XSLTPROC], [xsltproc], [false], [$PATH])
+if test -d "/usr/share/xml/docbook/stylesheet/docbook-xsl" ; then
+  DEFAULT_XSLROOT="/usr/share/xml/docbook/stylesheet/docbook-xsl"
+elif test -d "/usr/share/sgml/docbook/xsl-stylesheets" ; then
+  DEFAULT_XSLROOT="/usr/share/sgml/docbook/xsl-stylesheets"
+else
+  dnl Documentation building will fail if this default gets used.
+  DEFAULT_XSLROOT=""
+fi
+AC_ARG_WITH([xslroot],
+  [AS_HELP_STRING([--with-xslroot=<path>], [XSL stylesheet root path])], [
+if test "x$with_xslroot" = "xno" ; then
+  XSLROOT="${DEFAULT_XSLROOT}"
+else
+  XSLROOT="${with_xslroot}"
+fi
+],
+  XSLROOT="${DEFAULT_XSLROOT}"
+)
+AC_SUBST([XSLROOT])
+
+dnl If CFLAGS isn't defined, set CFLAGS to something reasonable.  Otherwise,
+dnl just prevent autoconf from molesting CFLAGS.
+CFLAGS=$CFLAGS
+AC_PROG_CC
+
+if test "x$GCC" != "xyes" ; then
+  AC_CACHE_CHECK([whether compiler is MSVC],
+                 [je_cv_msvc],
+                 [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
+                                                     [
+#ifndef _MSC_VER
+  int fail[-1];
+#endif
+])],
+                               [je_cv_msvc=yes],
+                               [je_cv_msvc=no])])
+fi
+
+dnl check if a cray prgenv wrapper compiler is being used
+je_cv_cray_prgenv_wrapper=""
+if test "x${PE_ENV}" != "x" ; then
+  case "${CC}" in
+    CC|cc)
+	je_cv_cray_prgenv_wrapper="yes"
+	;;
+    *)
+       ;;
+  esac
+fi
+
+AC_CACHE_CHECK([whether compiler is cray],
+              [je_cv_cray],
+              [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
+                                                  [
+#ifndef _CRAYC
+  int fail[-1];
+#endif
+])],
+                            [je_cv_cray=yes],
+                            [je_cv_cray=no])])
+
+if test "x${je_cv_cray}" = "xyes" ; then
+  AC_CACHE_CHECK([whether cray compiler version is 8.4],
+                [je_cv_cray_84],
+                [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
+                                                      [
+#if !(_RELEASE_MAJOR == 8 && _RELEASE_MINOR == 4)
+  int fail[-1];
+#endif
+])],
+                              [je_cv_cray_84=yes],
+                              [je_cv_cray_84=no])])
+fi
+
+if test "x$GCC" = "xyes" ; then
+  JE_CFLAGS_ADD([-std=gnu11])
+  if test "x$je_cv_cflags_added" = "x-std=gnu11" ; then
+    AC_DEFINE_UNQUOTED([JEMALLOC_HAS_RESTRICT])
+  else
+    JE_CFLAGS_ADD([-std=gnu99])
+    if test "x$je_cv_cflags_added" = "x-std=gnu99" ; then
+      AC_DEFINE_UNQUOTED([JEMALLOC_HAS_RESTRICT])
+    fi
+  fi
+  JE_CFLAGS_ADD([-Wall])
+  JE_CFLAGS_ADD([-Wshorten-64-to-32])
+  JE_CFLAGS_ADD([-Wsign-compare])
+  JE_CFLAGS_ADD([-Wundef])
+  JE_CFLAGS_ADD([-Wno-format-zero-length])
+  JE_CFLAGS_ADD([-pipe])
+  JE_CFLAGS_ADD([-g3])
+elif test "x$je_cv_msvc" = "xyes" ; then
+  CC="$CC -nologo"
+  JE_CFLAGS_ADD([-Zi])
+  JE_CFLAGS_ADD([-MT])
+  JE_CFLAGS_ADD([-W3])
+  JE_CFLAGS_ADD([-FS])
+  JE_APPEND_VS(CPPFLAGS, -I${srcdir}/include/msvc_compat)
+fi
+if test "x$je_cv_cray" = "xyes" ; then
+  dnl cray compiler 8.4 has an inlining bug
+  if test "x$je_cv_cray_84" = "xyes" ; then
+    JE_CFLAGS_ADD([-hipa2])
+    JE_CFLAGS_ADD([-hnognu])
+  fi
+  dnl ignore unreachable code warning
+  JE_CFLAGS_ADD([-hnomessage=128])
+  dnl ignore redefinition of "malloc", "free", etc warning
+  JE_CFLAGS_ADD([-hnomessage=1357])
+fi
+AC_SUBST([CONFIGURE_CFLAGS])
+AC_SUBST([SPECIFIED_CFLAGS])
+AC_SUBST([EXTRA_CFLAGS])
+AC_PROG_CPP
+
+AC_ARG_ENABLE([cxx],
+  [AS_HELP_STRING([--disable-cxx], [Disable C++ integration])],
+if test "x$enable_cxx" = "xno" ; then
+  enable_cxx="0"
+else
+  enable_cxx="1"
+fi
+,
+enable_cxx="1"
+)
+if test "x$enable_cxx" = "x1" ; then
+  dnl Require at least c++14, which is the first version to support sized
+  dnl deallocation.  C++ support is not compiled otherwise.
+  m4_include([m4/ax_cxx_compile_stdcxx.m4])
+  AX_CXX_COMPILE_STDCXX([14], [noext], [optional])
+  if test "x${HAVE_CXX14}" = "x1" ; then
+    JE_CXXFLAGS_ADD([-Wall])
+    JE_CXXFLAGS_ADD([-g3])
+
+    SAVED_LIBS="${LIBS}"
+    JE_APPEND_VS(LIBS, -lstdc++)
+    JE_COMPILABLE([libstdc++ linkage], [
+#include <stdlib.h>
+], [[
+	int *arr = (int *)malloc(sizeof(int) * 42);
+	if (arr == NULL)
+		return 1;
+]], [je_cv_libstdcxx])
+    if test "x${je_cv_libstdcxx}" = "xno" ; then
+      LIBS="${SAVED_LIBS}"
+    fi
+  else
+    enable_cxx="0"
+  fi
+fi
+AC_SUBST([enable_cxx])
+AC_SUBST([CONFIGURE_CXXFLAGS])
+AC_SUBST([SPECIFIED_CXXFLAGS])
+AC_SUBST([EXTRA_CXXFLAGS])
+
+AC_C_BIGENDIAN([ac_cv_big_endian=1], [ac_cv_big_endian=0])
+if test "x${ac_cv_big_endian}" = "x1" ; then
+  AC_DEFINE_UNQUOTED([JEMALLOC_BIG_ENDIAN], [ ])
+fi
+
+if test "x${je_cv_msvc}" = "xyes" -a "x${ac_cv_header_inttypes_h}" = "xno"; then
+  JE_APPEND_VS(CPPFLAGS, -I${srcdir}/include/msvc_compat/C99)
+fi
+
+if test "x${je_cv_msvc}" = "xyes" ; then
+  LG_SIZEOF_PTR=LG_SIZEOF_PTR_WIN
+  AC_MSG_RESULT([Using a predefined value for sizeof(void *): 4 for 32-bit, 8 for 64-bit])
+else
+  AC_CHECK_SIZEOF([void *])
+  if test "x${ac_cv_sizeof_void_p}" = "x8" ; then
+    LG_SIZEOF_PTR=3
+  elif test "x${ac_cv_sizeof_void_p}" = "x4" ; then
+    LG_SIZEOF_PTR=2
+  else
+    AC_MSG_ERROR([Unsupported pointer size: ${ac_cv_sizeof_void_p}])
+  fi
+fi
+AC_DEFINE_UNQUOTED([LG_SIZEOF_PTR], [$LG_SIZEOF_PTR])
+
+AC_CHECK_SIZEOF([int])
+if test "x${ac_cv_sizeof_int}" = "x8" ; then
+  LG_SIZEOF_INT=3
+elif test "x${ac_cv_sizeof_int}" = "x4" ; then
+  LG_SIZEOF_INT=2
+else
+  AC_MSG_ERROR([Unsupported int size: ${ac_cv_sizeof_int}])
+fi
+AC_DEFINE_UNQUOTED([LG_SIZEOF_INT], [$LG_SIZEOF_INT])
+
+AC_CHECK_SIZEOF([long])
+if test "x${ac_cv_sizeof_long}" = "x8" ; then
+  LG_SIZEOF_LONG=3
+elif test "x${ac_cv_sizeof_long}" = "x4" ; then
+  LG_SIZEOF_LONG=2
+else
+  AC_MSG_ERROR([Unsupported long size: ${ac_cv_sizeof_long}])
+fi
+AC_DEFINE_UNQUOTED([LG_SIZEOF_LONG], [$LG_SIZEOF_LONG])
+
+AC_CHECK_SIZEOF([long long])
+if test "x${ac_cv_sizeof_long_long}" = "x8" ; then
+  LG_SIZEOF_LONG_LONG=3
+elif test "x${ac_cv_sizeof_long_long}" = "x4" ; then
+  LG_SIZEOF_LONG_LONG=2
+else
+  AC_MSG_ERROR([Unsupported long long size: ${ac_cv_sizeof_long_long}])
+fi
+AC_DEFINE_UNQUOTED([LG_SIZEOF_LONG_LONG], [$LG_SIZEOF_LONG_LONG])
+
+AC_CHECK_SIZEOF([intmax_t])
+if test "x${ac_cv_sizeof_intmax_t}" = "x16" ; then
+  LG_SIZEOF_INTMAX_T=4
+elif test "x${ac_cv_sizeof_intmax_t}" = "x8" ; then
+  LG_SIZEOF_INTMAX_T=3
+elif test "x${ac_cv_sizeof_intmax_t}" = "x4" ; then
+  LG_SIZEOF_INTMAX_T=2
+else
+  AC_MSG_ERROR([Unsupported intmax_t size: ${ac_cv_sizeof_intmax_t}])
+fi
+AC_DEFINE_UNQUOTED([LG_SIZEOF_INTMAX_T], [$LG_SIZEOF_INTMAX_T])
+
+AC_CANONICAL_HOST
+dnl CPU-specific settings.
+CPU_SPINWAIT=""
+case "${host_cpu}" in
+  i686|x86_64)
+	HAVE_CPU_SPINWAIT=1
+	if test "x${je_cv_msvc}" = "xyes" ; then
+	    AC_CACHE_VAL([je_cv_pause_msvc],
+	      [JE_COMPILABLE([pause instruction MSVC], [],
+					[[_mm_pause(); return 0;]],
+					[je_cv_pause_msvc])])
+	    if test "x${je_cv_pause_msvc}" = "xyes" ; then
+		CPU_SPINWAIT='_mm_pause()'
+	    fi
+	else
+	    AC_CACHE_VAL([je_cv_pause],
+	      [JE_COMPILABLE([pause instruction], [],
+					[[__asm__ volatile("pause"); return 0;]],
+					[je_cv_pause])])
+	    if test "x${je_cv_pause}" = "xyes" ; then
+		CPU_SPINWAIT='__asm__ volatile("pause")'
+	    fi
+	fi
+	;;
+  *)
+	HAVE_CPU_SPINWAIT=0
+	;;
+esac
+AC_DEFINE_UNQUOTED([HAVE_CPU_SPINWAIT], [$HAVE_CPU_SPINWAIT])
+AC_DEFINE_UNQUOTED([CPU_SPINWAIT], [$CPU_SPINWAIT])
+
+AC_ARG_WITH([lg_vaddr],
+  [AS_HELP_STRING([--with-lg-vaddr=<lg-vaddr>], [Number of significant virtual address bits])],
+  [LG_VADDR="$with_lg_vaddr"], [LG_VADDR="detect"])
+
+case "${host_cpu}" in
+  aarch64)
+    if test "x$LG_VADDR" = "xdetect"; then
+      AC_MSG_CHECKING([number of significant virtual address bits])
+      if test "x${LG_SIZEOF_PTR}" = "x2" ; then
+        #aarch64 ILP32
+        LG_VADDR=32
+      else
+        #aarch64 LP64
+        LG_VADDR=48
+      fi
+      AC_MSG_RESULT([$LG_VADDR])
+    fi
+    ;;
+  x86_64)
+    if test "x$LG_VADDR" = "xdetect"; then
+      AC_CACHE_CHECK([number of significant virtual address bits],
+                     [je_cv_lg_vaddr],
+                     AC_RUN_IFELSE([AC_LANG_PROGRAM(
+[[
+#include <stdio.h>
+#ifdef _WIN32
+#include <limits.h>
+#include <intrin.h>
+typedef unsigned __int32 uint32_t;
+#else
+#include <stdint.h>
+#endif
+]], [[
+	uint32_t r[[4]];
+	uint32_t eax_in = 0x80000008U;
+#ifdef _WIN32
+	__cpuid((int *)r, (int)eax_in);
+#else
+	asm volatile ("cpuid"
+	    : "=a" (r[[0]]), "=b" (r[[1]]), "=c" (r[[2]]), "=d" (r[[3]])
+	    : "a" (eax_in), "c" (0)
+	);
+#endif
+	uint32_t eax_out = r[[0]];
+	uint32_t vaddr = ((eax_out & 0x0000ff00U) >> 8);
+	FILE *f = fopen("conftest.out", "w");
+	if (f == NULL) {
+		return 1;
+	}
+	if (vaddr > (sizeof(void *) << 3)) {
+		vaddr = sizeof(void *) << 3;
+	}
+	fprintf(f, "%u", vaddr);
+	fclose(f);
+	return 0;
+]])],
+                   [je_cv_lg_vaddr=`cat conftest.out`],
+                   [je_cv_lg_vaddr=error],
+                   [je_cv_lg_vaddr=57]))
+      if test "x${je_cv_lg_vaddr}" != "x" ; then
+        LG_VADDR="${je_cv_lg_vaddr}"
+      fi
+      if test "x${LG_VADDR}" != "xerror" ; then
+        AC_DEFINE_UNQUOTED([LG_VADDR], [$LG_VADDR])
+      else
+        AC_MSG_ERROR([cannot determine number of significant virtual address bits])
+      fi
+    fi
+    ;;
+  *)
+    if test "x$LG_VADDR" = "xdetect"; then
+      AC_MSG_CHECKING([number of significant virtual address bits])
+      if test "x${LG_SIZEOF_PTR}" = "x3" ; then
+        LG_VADDR=64
+      elif test "x${LG_SIZEOF_PTR}" = "x2" ; then
+        LG_VADDR=32
+      elif test "x${LG_SIZEOF_PTR}" = "xLG_SIZEOF_PTR_WIN" ; then
+        LG_VADDR="(1U << (LG_SIZEOF_PTR_WIN+3))"
+      else
+        AC_MSG_ERROR([Unsupported lg(pointer size): ${LG_SIZEOF_PTR}])
+      fi
+      AC_MSG_RESULT([$LG_VADDR])
+    fi
+    ;;
+esac
+AC_DEFINE_UNQUOTED([LG_VADDR], [$LG_VADDR])
+
+LD_PRELOAD_VAR="LD_PRELOAD"
+so="so"
+importlib="${so}"
+o="$ac_objext"
+a="a"
+exe="$ac_exeext"
+libprefix="lib"
+link_whole_archive="0"
+DSO_LDFLAGS='-shared -Wl,-soname,$(@F)'
+RPATH='-Wl,-rpath,$(1)'
+SOREV="${so}.${rev}"
+PIC_CFLAGS='-fPIC -DPIC'
+CTARGET='-o $@'
+LDTARGET='-o $@'
+TEST_LD_MODE=
+EXTRA_LDFLAGS=
+ARFLAGS='crs'
+AROUT=' $@'
+CC_MM=1
+
+if test "x$je_cv_cray_prgenv_wrapper" = "xyes" ; then
+  TEST_LD_MODE='-dynamic'
+fi
+
+if test "x${je_cv_cray}" = "xyes" ; then
+  CC_MM=
+fi
+
+AN_MAKEVAR([AR], [AC_PROG_AR])
+AN_PROGRAM([ar], [AC_PROG_AR])
+AC_DEFUN([AC_PROG_AR], [AC_CHECK_TOOL(AR, ar, :)])
+AC_PROG_AR
+
+AN_MAKEVAR([NM], [AC_PROG_NM])
+AN_PROGRAM([nm], [AC_PROG_NM])
+AC_DEFUN([AC_PROG_NM], [AC_CHECK_TOOL(NM, nm, :)])
+AC_PROG_NM
+
+AC_PROG_AWK
+
+dnl Platform-specific settings.  abi and RPATH can probably be determined
+dnl programmatically, but doing so is error-prone, which makes it generally
+dnl not worth the trouble.
+dnl
+dnl Define cpp macros in CPPFLAGS, rather than doing AC_DEFINE(macro), since the
+dnl definitions need to be seen before any headers are included, which is a pain
+dnl to make happen otherwise.
+default_retain="0"
+maps_coalesce="1"
+DUMP_SYMS="${NM} -a"
+SYM_PREFIX=""
+case "${host}" in
+  *-*-darwin* | *-*-ios*)
+	abi="macho"
+	RPATH=""
+	LD_PRELOAD_VAR="DYLD_INSERT_LIBRARIES"
+	so="dylib"
+	importlib="${so}"
+	force_tls="0"
+	DSO_LDFLAGS='-shared -Wl,-install_name,$(LIBDIR)/$(@F)'
+	SOREV="${rev}.${so}"
+	sbrk_deprecated="1"
+	SYM_PREFIX="_"
+	;;
+  *-*-freebsd*)
+	abi="elf"
+	AC_DEFINE([JEMALLOC_SYSCTL_VM_OVERCOMMIT], [ ])
+	force_lazy_lock="1"
+	;;
+  *-*-dragonfly*)
+	abi="elf"
+	;;
+  *-*-openbsd*)
+	abi="elf"
+	force_tls="0"
+	;;
+  *-*-bitrig*)
+	abi="elf"
+	;;
+  *-*-linux-android)
+	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
+	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
+	abi="elf"
+	AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS], [ ])
+	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
+	AC_DEFINE([JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY], [ ])
+	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
+	AC_DEFINE([JEMALLOC_C11_ATOMICS])
+	force_tls="0"
+	if test "${LG_SIZEOF_PTR}" = "3"; then
+	  default_retain="1"
+	fi
+	;;
+  *-*-linux*)
+	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
+	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
+	abi="elf"
+	AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS], [ ])
+	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
+	AC_DEFINE([JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY], [ ])
+	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
+	AC_DEFINE([JEMALLOC_USE_CXX_THROW], [ ])
+	if test "${LG_SIZEOF_PTR}" = "3"; then
+	  default_retain="1"
+	fi
+	;;
+  *-*-kfreebsd*)
+	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
+	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
+	abi="elf"
+	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
+	AC_DEFINE([JEMALLOC_SYSCTL_VM_OVERCOMMIT], [ ])
+	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
+	AC_DEFINE([JEMALLOC_USE_CXX_THROW], [ ])
+	;;
+  *-*-netbsd*)
+	AC_MSG_CHECKING([ABI])
+        AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
+[[#ifdef __ELF__
+/* ELF */
+#else
+#error aout
+#endif
+]])],
+                          [abi="elf"],
+                          [abi="aout"])
+	AC_MSG_RESULT([$abi])
+	;;
+  *-*-solaris2*)
+	abi="elf"
+	RPATH='-Wl,-R,$(1)'
+	dnl Solaris needs this for sigwait().
+	JE_APPEND_VS(CPPFLAGS, -D_POSIX_PTHREAD_SEMANTICS)
+	JE_APPEND_VS(LIBS, -lposix4 -lsocket -lnsl)
+	;;
+  *-ibm-aix*)
+	if test "${LG_SIZEOF_PTR}" = "3"; then
+	  dnl 64bit AIX
+	  LD_PRELOAD_VAR="LDR_PRELOAD64"
+	else
+	  dnl 32bit AIX
+	  LD_PRELOAD_VAR="LDR_PRELOAD"
+	fi
+	abi="xcoff"
+	;;
+  *-*-mingw* | *-*-cygwin*)
+	abi="pecoff"
+	force_tls="0"
+	maps_coalesce="0"
+	RPATH=""
+	so="dll"
+	if test "x$je_cv_msvc" = "xyes" ; then
+	  importlib="lib"
+	  DSO_LDFLAGS="-LD"
+	  EXTRA_LDFLAGS="-link -DEBUG"
+	  CTARGET='-Fo$@'
+	  LDTARGET='-Fe$@'
+	  AR='lib'
+	  ARFLAGS='-nologo -out:'
+	  AROUT='$@'
+	  CC_MM=
+        else
+	  importlib="${so}"
+	  DSO_LDFLAGS="-shared"
+	  link_whole_archive="1"
+	fi
+	case "${host}" in
+	  *-*-cygwin*)
+	    DUMP_SYMS="dumpbin /SYMBOLS"
+	    ;;
+	  *)
+	    ;;
+	esac
+	a="lib"
+	libprefix=""
+	SOREV="${so}"
+	PIC_CFLAGS=""
+	;;
+  *)
+	AC_MSG_RESULT([Unsupported operating system: ${host}])
+	abi="elf"
+	;;
+esac
+
+JEMALLOC_USABLE_SIZE_CONST=const
+AC_CHECK_HEADERS([malloc.h], [
+  AC_MSG_CHECKING([whether malloc_usable_size definition can use const argument])
+  AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
+    [#include <malloc.h>
+     #include <stddef.h>
+    size_t malloc_usable_size(const void *ptr);
+    ],
+    [])],[
+                AC_MSG_RESULT([yes])
+         ],[
+                JEMALLOC_USABLE_SIZE_CONST=
+                AC_MSG_RESULT([no])
+         ])
+])
+AC_DEFINE_UNQUOTED([JEMALLOC_USABLE_SIZE_CONST], [$JEMALLOC_USABLE_SIZE_CONST])
+AC_SUBST([abi])
+AC_SUBST([RPATH])
+AC_SUBST([LD_PRELOAD_VAR])
+AC_SUBST([so])
+AC_SUBST([importlib])
+AC_SUBST([o])
+AC_SUBST([a])
+AC_SUBST([exe])
+AC_SUBST([libprefix])
+AC_SUBST([link_whole_archive])
+AC_SUBST([DSO_LDFLAGS])
+AC_SUBST([EXTRA_LDFLAGS])
+AC_SUBST([SOREV])
+AC_SUBST([PIC_CFLAGS])
+AC_SUBST([CTARGET])
+AC_SUBST([LDTARGET])
+AC_SUBST([TEST_LD_MODE])
+AC_SUBST([MKLIB])
+AC_SUBST([ARFLAGS])
+AC_SUBST([AROUT])
+AC_SUBST([DUMP_SYMS])
+AC_SUBST([CC_MM])
+
+dnl Determine whether libm must be linked to use e.g. log(3).
+AC_SEARCH_LIBS([log], [m], , [AC_MSG_ERROR([Missing math functions])])
+if test "x$ac_cv_search_log" != "xnone required" ; then
+  LM="$ac_cv_search_log"
+else
+  LM=
+fi
+AC_SUBST(LM)
+
+JE_COMPILABLE([__attribute__ syntax],
+              [static __attribute__((unused)) void foo(void){}],
+              [],
+              [je_cv_attribute])
+if test "x${je_cv_attribute}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_ATTR], [ ])
+  if test "x${GCC}" = "xyes" -a "x${abi}" = "xelf"; then
+    JE_CFLAGS_ADD([-fvisibility=hidden])
+    JE_CXXFLAGS_ADD([-fvisibility=hidden])
+  fi
+fi
+dnl Check for tls_model attribute support (clang 3.0 still lacks support).
+JE_CFLAGS_SAVE()
+JE_CFLAGS_ADD([-Werror])
+JE_CFLAGS_ADD([-herror_on_warning])
+JE_COMPILABLE([tls_model attribute], [],
+              [static __thread int
+               __attribute__((tls_model("initial-exec"), unused)) foo;
+               foo = 0;],
+              [je_cv_tls_model])
+JE_CFLAGS_RESTORE()
+dnl (Setting of JEMALLOC_TLS_MODEL is done later, after we've checked for
+dnl --disable-initial-exec-tls)
+
+dnl Check for alloc_size attribute support.
+JE_CFLAGS_SAVE()
+JE_CFLAGS_ADD([-Werror])
+JE_CFLAGS_ADD([-herror_on_warning])
+JE_COMPILABLE([alloc_size attribute], [#include <stdlib.h>],
+              [void *foo(size_t size) __attribute__((alloc_size(1)));],
+              [je_cv_alloc_size])
+JE_CFLAGS_RESTORE()
+if test "x${je_cv_alloc_size}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_ATTR_ALLOC_SIZE], [ ])
+fi
+dnl Check for format(gnu_printf, ...) attribute support.
+JE_CFLAGS_SAVE()
+JE_CFLAGS_ADD([-Werror])
+JE_CFLAGS_ADD([-herror_on_warning])
+JE_COMPILABLE([format(gnu_printf, ...) attribute], [#include <stdlib.h>],
+              [void *foo(const char *format, ...) __attribute__((format(gnu_printf, 1, 2)));],
+              [je_cv_format_gnu_printf])
+JE_CFLAGS_RESTORE()
+if test "x${je_cv_format_gnu_printf}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF], [ ])
+fi
+dnl Check for format(printf, ...) attribute support.
+JE_CFLAGS_SAVE()
+JE_CFLAGS_ADD([-Werror])
+JE_CFLAGS_ADD([-herror_on_warning])
+JE_COMPILABLE([format(printf, ...) attribute], [#include <stdlib.h>],
+              [void *foo(const char *format, ...) __attribute__((format(printf, 1, 2)));],
+              [je_cv_format_printf])
+JE_CFLAGS_RESTORE()
+if test "x${je_cv_format_printf}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_ATTR_FORMAT_PRINTF], [ ])
+fi
+
+dnl Support optional additions to rpath.
+AC_ARG_WITH([rpath],
+  [AS_HELP_STRING([--with-rpath=<rpath>], [Colon-separated rpath (ELF systems only)])],
+if test "x$with_rpath" = "xno" ; then
+  RPATH_EXTRA=
+else
+  RPATH_EXTRA="`echo $with_rpath | tr \":\" \" \"`"
+fi,
+  RPATH_EXTRA=
+)
+AC_SUBST([RPATH_EXTRA])
+
+dnl Disable rules that do automatic regeneration of configure output by default.
+AC_ARG_ENABLE([autogen],
+  [AS_HELP_STRING([--enable-autogen], [Automatically regenerate configure output])],
+if test "x$enable_autogen" = "xno" ; then
+  enable_autogen="0"
+else
+  enable_autogen="1"
+fi
+,
+enable_autogen="0"
+)
+AC_SUBST([enable_autogen])
+
+AC_PROG_INSTALL
+AC_PROG_RANLIB
+AC_PATH_PROG([LD], [ld], [false], [$PATH])
+AC_PATH_PROG([AUTOCONF], [autoconf], [false], [$PATH])
+
+dnl Perform no name mangling by default.
+AC_ARG_WITH([mangling],
+  [AS_HELP_STRING([--with-mangling=<map>], [Mangle symbols in <map>])],
+  [mangling_map="$with_mangling"], [mangling_map=""])
+
+dnl Do not prefix public APIs by default.
+AC_ARG_WITH([jemalloc_prefix],
+  [AS_HELP_STRING([--with-jemalloc-prefix=<prefix>], [Prefix to prepend to all public APIs])],
+  [JEMALLOC_PREFIX="$with_jemalloc_prefix"],
+  [if test "x$abi" != "xmacho" -a "x$abi" != "xpecoff"; then
+  JEMALLOC_PREFIX=""
+else
+  JEMALLOC_PREFIX="je_"
+fi]
+)
+if test "x$JEMALLOC_PREFIX" = "x" ; then
+  AC_DEFINE([JEMALLOC_IS_MALLOC])
+else
+  JEMALLOC_CPREFIX=`echo ${JEMALLOC_PREFIX} | tr "a-z" "A-Z"`
+  AC_DEFINE_UNQUOTED([JEMALLOC_PREFIX], ["$JEMALLOC_PREFIX"])
+  AC_DEFINE_UNQUOTED([JEMALLOC_CPREFIX], ["$JEMALLOC_CPREFIX"])
+fi
+AC_SUBST([JEMALLOC_PREFIX])
+AC_SUBST([JEMALLOC_CPREFIX])
+
+AC_ARG_WITH([export],
+  [AS_HELP_STRING([--without-export], [disable exporting jemalloc public APIs])],
+  [if test "x$with_export" = "xno"; then
+  AC_DEFINE([JEMALLOC_EXPORT],[])
+fi]
+)
+
+public_syms="aligned_alloc calloc dallocx free mallctl mallctlbymib mallctlnametomib malloc malloc_conf malloc_message malloc_stats_print malloc_usable_size mallocx nallocx posix_memalign rallocx realloc sallocx sdallocx xallocx"
+dnl Check for additional platform-specific public API functions.
+AC_CHECK_FUNC([memalign],
+	      [AC_DEFINE([JEMALLOC_OVERRIDE_MEMALIGN], [ ])
+	       public_syms="${public_syms} memalign"])
+AC_CHECK_FUNC([valloc],
+	      [AC_DEFINE([JEMALLOC_OVERRIDE_VALLOC], [ ])
+	       public_syms="${public_syms} valloc"])
+
+dnl Check for allocator-related functions that should be wrapped.
+wrap_syms=
+if test "x${JEMALLOC_PREFIX}" = "x" ; then
+  AC_CHECK_FUNC([__libc_calloc],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_CALLOC], [ ])
+		 wrap_syms="${wrap_syms} __libc_calloc"])
+  AC_CHECK_FUNC([__libc_free],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_FREE], [ ])
+		 wrap_syms="${wrap_syms} __libc_free"])
+  AC_CHECK_FUNC([__libc_malloc],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_MALLOC], [ ])
+		 wrap_syms="${wrap_syms} __libc_malloc"])
+  AC_CHECK_FUNC([__libc_memalign],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_MEMALIGN], [ ])
+		 wrap_syms="${wrap_syms} __libc_memalign"])
+  AC_CHECK_FUNC([__libc_realloc],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_REALLOC], [ ])
+		 wrap_syms="${wrap_syms} __libc_realloc"])
+  AC_CHECK_FUNC([__libc_valloc],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_VALLOC], [ ])
+		 wrap_syms="${wrap_syms} __libc_valloc"])
+  AC_CHECK_FUNC([__posix_memalign],
+		[AC_DEFINE([JEMALLOC_OVERRIDE___POSIX_MEMALIGN], [ ])
+		 wrap_syms="${wrap_syms} __posix_memalign"])
+fi
+
+case "${host}" in
+  *-*-mingw* | *-*-cygwin*)
+    wrap_syms="${wrap_syms} tls_callback"
+    ;;
+  *)
+    ;;
+esac
+
+dnl Mangle library-private APIs.
+AC_ARG_WITH([private_namespace],
+  [AS_HELP_STRING([--with-private-namespace=<prefix>], [Prefix to prepend to all library-private APIs])],
+  [JEMALLOC_PRIVATE_NAMESPACE="${with_private_namespace}je_"],
+  [JEMALLOC_PRIVATE_NAMESPACE="je_"]
+)
+AC_DEFINE_UNQUOTED([JEMALLOC_PRIVATE_NAMESPACE], [$JEMALLOC_PRIVATE_NAMESPACE])
+private_namespace="$JEMALLOC_PRIVATE_NAMESPACE"
+AC_SUBST([private_namespace])
+
+dnl Do not add suffix to installed files by default.
+AC_ARG_WITH([install_suffix],
+  [AS_HELP_STRING([--with-install-suffix=<suffix>], [Suffix to append to all installed files])],
+  [INSTALL_SUFFIX="$with_install_suffix"],
+  [INSTALL_SUFFIX=]
+)
+install_suffix="$INSTALL_SUFFIX"
+AC_SUBST([install_suffix])
+
+dnl Specify default malloc_conf.
+AC_ARG_WITH([malloc_conf],
+  [AS_HELP_STRING([--with-malloc-conf=<malloc_conf>], [config.malloc_conf options string])],
+  [JEMALLOC_CONFIG_MALLOC_CONF="$with_malloc_conf"],
+  [JEMALLOC_CONFIG_MALLOC_CONF=""]
+)
+config_malloc_conf="$JEMALLOC_CONFIG_MALLOC_CONF"
+AC_DEFINE_UNQUOTED([JEMALLOC_CONFIG_MALLOC_CONF], ["$config_malloc_conf"])
+
+dnl Substitute @je_@ in jemalloc_protos.h.in, primarily to make generation of
+dnl jemalloc_protos_jet.h easy.
+je_="je_"
+AC_SUBST([je_])
+
+cfgoutputs_in="Makefile.in"
+cfgoutputs_in="${cfgoutputs_in} jemalloc.pc.in"
+cfgoutputs_in="${cfgoutputs_in} doc/html.xsl.in"
+cfgoutputs_in="${cfgoutputs_in} doc/manpages.xsl.in"
+cfgoutputs_in="${cfgoutputs_in} doc/jemalloc.xml.in"
+cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_macros.h.in"
+cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_protos.h.in"
+cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_typedefs.h.in"
+cfgoutputs_in="${cfgoutputs_in} include/jemalloc/internal/jemalloc_preamble.h.in"
+cfgoutputs_in="${cfgoutputs_in} test/test.sh.in"
+cfgoutputs_in="${cfgoutputs_in} test/include/test/jemalloc_test.h.in"
+
+cfgoutputs_out="Makefile"
+cfgoutputs_out="${cfgoutputs_out} jemalloc.pc"
+cfgoutputs_out="${cfgoutputs_out} doc/html.xsl"
+cfgoutputs_out="${cfgoutputs_out} doc/manpages.xsl"
+cfgoutputs_out="${cfgoutputs_out} doc/jemalloc.xml"
+cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_macros.h"
+cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_protos.h"
+cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_typedefs.h"
+cfgoutputs_out="${cfgoutputs_out} include/jemalloc/internal/jemalloc_preamble.h"
+cfgoutputs_out="${cfgoutputs_out} test/test.sh"
+cfgoutputs_out="${cfgoutputs_out} test/include/test/jemalloc_test.h"
+
+cfgoutputs_tup="Makefile"
+cfgoutputs_tup="${cfgoutputs_tup} jemalloc.pc:jemalloc.pc.in"
+cfgoutputs_tup="${cfgoutputs_tup} doc/html.xsl:doc/html.xsl.in"
+cfgoutputs_tup="${cfgoutputs_tup} doc/manpages.xsl:doc/manpages.xsl.in"
+cfgoutputs_tup="${cfgoutputs_tup} doc/jemalloc.xml:doc/jemalloc.xml.in"
+cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_macros.h:include/jemalloc/jemalloc_macros.h.in"
+cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_protos.h:include/jemalloc/jemalloc_protos.h.in"
+cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_typedefs.h:include/jemalloc/jemalloc_typedefs.h.in"
+cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/internal/jemalloc_preamble.h"
+cfgoutputs_tup="${cfgoutputs_tup} test/test.sh:test/test.sh.in"
+cfgoutputs_tup="${cfgoutputs_tup} test/include/test/jemalloc_test.h:test/include/test/jemalloc_test.h.in"
+
+cfghdrs_in="include/jemalloc/jemalloc_defs.h.in"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/jemalloc_internal_defs.h.in"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/private_symbols.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/private_namespace.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/public_namespace.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/public_unnamespace.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/size_classes.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc_rename.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc_mangle.sh"
+cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc.sh"
+cfghdrs_in="${cfghdrs_in} test/include/test/jemalloc_test_defs.h.in"
+
+cfghdrs_out="include/jemalloc/jemalloc_defs.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc${install_suffix}.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/private_symbols.awk"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/private_symbols_jet.awk"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_symbols.txt"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_namespace.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_unnamespace.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/size_classes.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_protos_jet.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_rename.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_mangle.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_mangle_jet.h"
+cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/jemalloc_internal_defs.h"
+cfghdrs_out="${cfghdrs_out} test/include/test/jemalloc_test_defs.h"
+
+cfghdrs_tup="include/jemalloc/jemalloc_defs.h:include/jemalloc/jemalloc_defs.h.in"
+cfghdrs_tup="${cfghdrs_tup} include/jemalloc/internal/jemalloc_internal_defs.h:include/jemalloc/internal/jemalloc_internal_defs.h.in"
+cfghdrs_tup="${cfghdrs_tup} test/include/test/jemalloc_test_defs.h:test/include/test/jemalloc_test_defs.h.in"
+
+dnl Do not compile with debugging by default.
+AC_ARG_ENABLE([debug],
+  [AS_HELP_STRING([--enable-debug],
+                  [Build debugging code])],
+[if test "x$enable_debug" = "xno" ; then
+  enable_debug="0"
+else
+  enable_debug="1"
+fi
+],
+[enable_debug="0"]
+)
+if test "x$enable_debug" = "x1" ; then
+  AC_DEFINE([JEMALLOC_DEBUG], [ ])
+fi
+if test "x$enable_debug" = "x1" ; then
+  AC_DEFINE([JEMALLOC_DEBUG], [ ])
+fi
+AC_SUBST([enable_debug])
+
+dnl Only optimize if not debugging.
+if test "x$enable_debug" = "x0" ; then
+  if test "x$GCC" = "xyes" ; then
+    JE_CFLAGS_ADD([-O3])
+    JE_CXXFLAGS_ADD([-O3])
+    JE_CFLAGS_ADD([-funroll-loops])
+  elif test "x$je_cv_msvc" = "xyes" ; then
+    JE_CFLAGS_ADD([-O2])
+    JE_CXXFLAGS_ADD([-O2])
+  else
+    JE_CFLAGS_ADD([-O])
+    JE_CXXFLAGS_ADD([-O])
+  fi
+fi
+
+dnl Enable statistics calculation by default.
+AC_ARG_ENABLE([stats],
+  [AS_HELP_STRING([--disable-stats],
+                  [Disable statistics calculation/reporting])],
+[if test "x$enable_stats" = "xno" ; then
+  enable_stats="0"
+else
+  enable_stats="1"
+fi
+],
+[enable_stats="1"]
+)
+if test "x$enable_stats" = "x1" ; then
+  AC_DEFINE([JEMALLOC_STATS], [ ])
+fi
+AC_SUBST([enable_stats])
+
+dnl Do not enable profiling by default.
+AC_ARG_ENABLE([prof],
+  [AS_HELP_STRING([--enable-prof], [Enable allocation profiling])],
+[if test "x$enable_prof" = "xno" ; then
+  enable_prof="0"
+else
+  enable_prof="1"
+fi
+],
+[enable_prof="0"]
+)
+if test "x$enable_prof" = "x1" ; then
+  backtrace_method=""
+else
+  backtrace_method="N/A"
+fi
+
+AC_ARG_ENABLE([prof-libunwind],
+  [AS_HELP_STRING([--enable-prof-libunwind], [Use libunwind for backtracing])],
+[if test "x$enable_prof_libunwind" = "xno" ; then
+  enable_prof_libunwind="0"
+else
+  enable_prof_libunwind="1"
+fi
+],
+[enable_prof_libunwind="0"]
+)
+AC_ARG_WITH([static_libunwind],
+  [AS_HELP_STRING([--with-static-libunwind=<libunwind.a>],
+  [Path to static libunwind library; use rather than dynamically linking])],
+if test "x$with_static_libunwind" = "xno" ; then
+  LUNWIND="-lunwind"
+else
+  if test ! -f "$with_static_libunwind" ; then
+    AC_MSG_ERROR([Static libunwind not found: $with_static_libunwind])
+  fi
+  LUNWIND="$with_static_libunwind"
+fi,
+  LUNWIND="-lunwind"
+)
+if test "x$backtrace_method" = "x" -a "x$enable_prof_libunwind" = "x1" ; then
+  AC_CHECK_HEADERS([libunwind.h], , [enable_prof_libunwind="0"])
+  if test "x$LUNWIND" = "x-lunwind" ; then
+    AC_CHECK_LIB([unwind], [unw_backtrace], [JE_APPEND_VS(LIBS, $LUNWIND)],
+                 [enable_prof_libunwind="0"])
+  else
+    JE_APPEND_VS(LIBS, $LUNWIND)
+  fi
+  if test "x${enable_prof_libunwind}" = "x1" ; then
+    backtrace_method="libunwind"
+    AC_DEFINE([JEMALLOC_PROF_LIBUNWIND], [ ])
+  fi
+fi
+
+AC_ARG_ENABLE([prof-libgcc],
+  [AS_HELP_STRING([--disable-prof-libgcc],
+  [Do not use libgcc for backtracing])],
+[if test "x$enable_prof_libgcc" = "xno" ; then
+  enable_prof_libgcc="0"
+else
+  enable_prof_libgcc="1"
+fi
+],
+[enable_prof_libgcc="1"]
+)
+if test "x$backtrace_method" = "x" -a "x$enable_prof_libgcc" = "x1" \
+     -a "x$GCC" = "xyes" ; then
+  AC_CHECK_HEADERS([unwind.h], , [enable_prof_libgcc="0"])
+  if test "x${enable_prof_libgcc}" = "x1" ; then
+    AC_CHECK_LIB([gcc], [_Unwind_Backtrace], [JE_APPEND_VS(LIBS, -lgcc)], [enable_prof_libgcc="0"])
+  fi
+  if test "x${enable_prof_libgcc}" = "x1" ; then
+    backtrace_method="libgcc"
+    AC_DEFINE([JEMALLOC_PROF_LIBGCC], [ ])
+  fi
+else
+  enable_prof_libgcc="0"
+fi
+
+AC_ARG_ENABLE([prof-gcc],
+  [AS_HELP_STRING([--disable-prof-gcc],
+  [Do not use gcc intrinsics for backtracing])],
+[if test "x$enable_prof_gcc" = "xno" ; then
+  enable_prof_gcc="0"
+else
+  enable_prof_gcc="1"
+fi
+],
+[enable_prof_gcc="1"]
+)
+if test "x$backtrace_method" = "x" -a "x$enable_prof_gcc" = "x1" \
+     -a "x$GCC" = "xyes" ; then
+  JE_CFLAGS_ADD([-fno-omit-frame-pointer])
+  backtrace_method="gcc intrinsics"
+  AC_DEFINE([JEMALLOC_PROF_GCC], [ ])
+else
+  enable_prof_gcc="0"
+fi
+
+if test "x$backtrace_method" = "x" ; then
+  backtrace_method="none (disabling profiling)"
+  enable_prof="0"
+fi
+AC_MSG_CHECKING([configured backtracing method])
+AC_MSG_RESULT([$backtrace_method])
+if test "x$enable_prof" = "x1" ; then
+  dnl Heap profiling uses the log(3) function.
+  JE_APPEND_VS(LIBS, $LM)
+
+  AC_DEFINE([JEMALLOC_PROF], [ ])
+fi
+AC_SUBST([enable_prof])
+
+dnl Indicate whether adjacent virtual memory mappings automatically coalesce
+dnl (and fragment on demand).
+if test "x${maps_coalesce}" = "x1" ; then
+  AC_DEFINE([JEMALLOC_MAPS_COALESCE], [ ])
+fi
+
+dnl Indicate whether to retain memory (rather than using munmap()) by default.
+if test "x$default_retain" = "x1" ; then
+  AC_DEFINE([JEMALLOC_RETAIN], [ ])
+fi
+
+dnl Enable allocation from DSS if supported by the OS.
+have_dss="1"
+dnl Check whether the BSD/SUSv1 sbrk() exists.  If not, disable DSS support.
+AC_CHECK_FUNC([sbrk], [have_sbrk="1"], [have_sbrk="0"])
+if test "x$have_sbrk" = "x1" ; then
+  if test "x$sbrk_deprecated" = "x1" ; then
+    AC_MSG_RESULT([Disabling dss allocation because sbrk is deprecated])
+    have_dss="0"
+  fi
+else
+  have_dss="0"
+fi
+
+if test "x$have_dss" = "x1" ; then
+  AC_DEFINE([JEMALLOC_DSS], [ ])
+fi
+
+dnl Support the junk/zero filling option by default.
+AC_ARG_ENABLE([fill],
+  [AS_HELP_STRING([--disable-fill], [Disable support for junk/zero filling])],
+[if test "x$enable_fill" = "xno" ; then
+  enable_fill="0"
+else
+  enable_fill="1"
+fi
+],
+[enable_fill="1"]
+)
+if test "x$enable_fill" = "x1" ; then
+  AC_DEFINE([JEMALLOC_FILL], [ ])
+fi
+AC_SUBST([enable_fill])
+
+dnl Disable utrace(2)-based tracing by default.
+AC_ARG_ENABLE([utrace],
+  [AS_HELP_STRING([--enable-utrace], [Enable utrace(2)-based tracing])],
+[if test "x$enable_utrace" = "xno" ; then
+  enable_utrace="0"
+else
+  enable_utrace="1"
+fi
+],
+[enable_utrace="0"]
+)
+JE_COMPILABLE([utrace(2)], [
+#include <sys/types.h>
+#include <sys/param.h>
+#include <sys/time.h>
+#include <sys/uio.h>
+#include <sys/ktrace.h>
+], [
+	utrace((void *)0, 0);
+], [je_cv_utrace])
+if test "x${je_cv_utrace}" = "xno" ; then
+  enable_utrace="0"
+fi
+if test "x$enable_utrace" = "x1" ; then
+  AC_DEFINE([JEMALLOC_UTRACE], [ ])
+fi
+AC_SUBST([enable_utrace])
+
+dnl Do not support the xmalloc option by default.
+AC_ARG_ENABLE([xmalloc],
+  [AS_HELP_STRING([--enable-xmalloc], [Support xmalloc option])],
+[if test "x$enable_xmalloc" = "xno" ; then
+  enable_xmalloc="0"
+else
+  enable_xmalloc="1"
+fi
+],
+[enable_xmalloc="0"]
+)
+if test "x$enable_xmalloc" = "x1" ; then
+  AC_DEFINE([JEMALLOC_XMALLOC], [ ])
+fi
+AC_SUBST([enable_xmalloc])
+
+dnl Support cache-oblivious allocation alignment by default.
+AC_ARG_ENABLE([cache-oblivious],
+  [AS_HELP_STRING([--disable-cache-oblivious],
+                  [Disable support for cache-oblivious allocation alignment])],
+[if test "x$enable_cache_oblivious" = "xno" ; then
+  enable_cache_oblivious="0"
+else
+  enable_cache_oblivious="1"
+fi
+],
+[enable_cache_oblivious="1"]
+)
+if test "x$enable_cache_oblivious" = "x1" ; then
+  AC_DEFINE([JEMALLOC_CACHE_OBLIVIOUS], [ ])
+fi
+AC_SUBST([enable_cache_oblivious])
+
+dnl Do not log by default.
+AC_ARG_ENABLE([log],
+  [AS_HELP_STRING([--enable-log], [Support debug logging])],
+[if test "x$enable_log" = "xno" ; then
+  enable_log="0"
+else
+  enable_log="1"
+fi
+],
+[enable_log="0"]
+)
+if test "x$enable_log" = "x1" ; then
+  AC_DEFINE([JEMALLOC_LOG], [ ])
+fi
+AC_SUBST([enable_log])
+
+
+JE_COMPILABLE([a program using __builtin_unreachable], [
+void foo (void) {
+  __builtin_unreachable();
+}
+], [
+	{
+		foo();
+	}
+], [je_cv_gcc_builtin_unreachable])
+if test "x${je_cv_gcc_builtin_unreachable}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_INTERNAL_UNREACHABLE], [__builtin_unreachable])
+else
+  AC_DEFINE([JEMALLOC_INTERNAL_UNREACHABLE], [abort])
+fi
+
+dnl ============================================================================
+dnl Check for  __builtin_ffsl(), then ffsl(3), and fail if neither are found.
+dnl One of those two functions should (theoretically) exist on all platforms
+dnl that jemalloc currently has a chance of functioning on without modification.
+dnl We additionally assume ffs[ll]() or __builtin_ffs[ll]() are defined if
+dnl ffsl() or __builtin_ffsl() are defined, respectively.
+JE_COMPILABLE([a program using __builtin_ffsl], [
+#include <stdio.h>
+#include <strings.h>
+#include <string.h>
+], [
+	{
+		int rv = __builtin_ffsl(0x08);
+		printf("%d\n", rv);
+	}
+], [je_cv_gcc_builtin_ffsl])
+if test "x${je_cv_gcc_builtin_ffsl}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_INTERNAL_FFSLL], [__builtin_ffsll])
+  AC_DEFINE([JEMALLOC_INTERNAL_FFSL], [__builtin_ffsl])
+  AC_DEFINE([JEMALLOC_INTERNAL_FFS], [__builtin_ffs])
+else
+  JE_COMPILABLE([a program using ffsl], [
+  #include <stdio.h>
+  #include <strings.h>
+  #include <string.h>
+  ], [
+	{
+		int rv = ffsl(0x08);
+		printf("%d\n", rv);
+	}
+  ], [je_cv_function_ffsl])
+  if test "x${je_cv_function_ffsl}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_INTERNAL_FFSLL], [ffsll])
+    AC_DEFINE([JEMALLOC_INTERNAL_FFSL], [ffsl])
+    AC_DEFINE([JEMALLOC_INTERNAL_FFS], [ffs])
+  else
+    AC_MSG_ERROR([Cannot build without ffsl(3) or __builtin_ffsl()])
+  fi
+fi
+
+AC_ARG_WITH([lg_quantum],
+  [AS_HELP_STRING([--with-lg-quantum=<lg-quantum>],
+   [Base 2 log of minimum allocation alignment])],
+  [LG_QUANTA="$with_lg_quantum"],
+  [LG_QUANTA="3 4"])
+if test "x$with_lg_quantum" != "x" ; then
+  AC_DEFINE_UNQUOTED([LG_QUANTUM], [$with_lg_quantum])
+fi
+
+AC_ARG_WITH([lg_page],
+  [AS_HELP_STRING([--with-lg-page=<lg-page>], [Base 2 log of system page size])],
+  [LG_PAGE="$with_lg_page"], [LG_PAGE="detect"])
+if test "x$LG_PAGE" = "xdetect"; then
+  AC_CACHE_CHECK([LG_PAGE],
+               [je_cv_lg_page],
+               AC_RUN_IFELSE([AC_LANG_PROGRAM(
+[[
+#include <strings.h>
+#ifdef _WIN32
+#include <windows.h>
+#else
+#include <unistd.h>
+#endif
+#include <stdio.h>
+]],
+[[
+    int result;
+    FILE *f;
+
+#ifdef _WIN32
+    SYSTEM_INFO si;
+    GetSystemInfo(&si);
+    result = si.dwPageSize;
+#else
+    result = sysconf(_SC_PAGESIZE);
+#endif
+    if (result == -1) {
+	return 1;
+    }
+    result = JEMALLOC_INTERNAL_FFSL(result) - 1;
+
+    f = fopen("conftest.out", "w");
+    if (f == NULL) {
+	return 1;
+    }
+    fprintf(f, "%d", result);
+    fclose(f);
+
+    return 0;
+]])],
+                             [je_cv_lg_page=`cat conftest.out`],
+                             [je_cv_lg_page=undefined],
+                             [je_cv_lg_page=12]))
+fi
+if test "x${je_cv_lg_page}" != "x" ; then
+  LG_PAGE="${je_cv_lg_page}"
+fi
+if test "x${LG_PAGE}" != "xundefined" ; then
+   AC_DEFINE_UNQUOTED([LG_PAGE], [$LG_PAGE])
+else
+   AC_MSG_ERROR([cannot determine value for LG_PAGE])
+fi
+
+AC_ARG_WITH([lg_hugepage],
+  [AS_HELP_STRING([--with-lg-hugepage=<lg-hugepage>],
+   [Base 2 log of system huge page size])],
+  [je_cv_lg_hugepage="${with_lg_hugepage}"],
+  [je_cv_lg_hugepage=""])
+if test "x${je_cv_lg_hugepage}" = "x" ; then
+  dnl Look in /proc/meminfo (Linux-specific) for information on the default huge
+  dnl page size, if any.  The relevant line looks like:
+  dnl
+  dnl   Hugepagesize:       2048 kB
+  if test -e "/proc/meminfo" ; then
+    hpsk=[`cat /proc/meminfo 2>/dev/null | \
+          grep -e '^Hugepagesize:[[:space:]]\+[0-9]\+[[:space:]]kB$' | \
+          awk '{print $2}'`]
+    if test "x${hpsk}" != "x" ; then
+      je_cv_lg_hugepage=10
+      while test "${hpsk}" -gt 1 ; do
+        hpsk="$((hpsk / 2))"
+        je_cv_lg_hugepage="$((je_cv_lg_hugepage + 1))"
+      done
+    fi
+  fi
+
+  dnl Set default if unable to automatically configure.
+  if test "x${je_cv_lg_hugepage}" = "x" ; then
+    je_cv_lg_hugepage=21
+  fi
+fi
+if test "x${LG_PAGE}" != "xundefined" -a \
+        "${je_cv_lg_hugepage}" -lt "${LG_PAGE}" ; then
+  AC_MSG_ERROR([Huge page size (2^${je_cv_lg_hugepage}) must be at least page size (2^${LG_PAGE})])
+fi
+AC_DEFINE_UNQUOTED([LG_HUGEPAGE], [${je_cv_lg_hugepage}])
+
+AC_ARG_WITH([lg_page_sizes],
+  [AS_HELP_STRING([--with-lg-page-sizes=<lg-page-sizes>],
+   [Base 2 logs of system page sizes to support])],
+  [LG_PAGE_SIZES="$with_lg_page_sizes"], [LG_PAGE_SIZES="$LG_PAGE"])
+
+dnl ============================================================================
+dnl jemalloc configuration.
+dnl
+
+AC_ARG_WITH([version],
+  [AS_HELP_STRING([--with-version=<major>.<minor>.<bugfix>-<nrev>-g<gid>],
+   [Version string])],
+  [
+    echo "${with_version}" | grep ['^[0-9]\+\.[0-9]\+\.[0-9]\+-[0-9]\+-g[0-9a-f]\+$'] 2>&1 1>/dev/null
+    if test $? -eq 0 ; then
+      echo "$with_version" > "${objroot}VERSION"
+    else
+      echo "${with_version}" | grep ['^VERSION$'] 2>&1 1>/dev/null
+      if test $? -ne 0 ; then
+        AC_MSG_ERROR([${with_version} does not match <major>.<minor>.<bugfix>-<nrev>-g<gid> or VERSION])
+      fi
+    fi
+  ], [
+    dnl Set VERSION if source directory is inside a git repository.
+    if test "x`test ! \"${srcroot}\" && cd \"${srcroot}\"; git rev-parse --is-inside-work-tree 2>/dev/null`" = "xtrue" ; then
+      dnl Pattern globs aren't powerful enough to match both single- and
+      dnl double-digit version numbers, so iterate over patterns to support up
+      dnl to version 99.99.99 without any accidental matches.
+      for pattern in ['[0-9].[0-9].[0-9]' '[0-9].[0-9].[0-9][0-9]' \
+                     '[0-9].[0-9][0-9].[0-9]' '[0-9].[0-9][0-9].[0-9][0-9]' \
+                     '[0-9][0-9].[0-9].[0-9]' '[0-9][0-9].[0-9].[0-9][0-9]' \
+                     '[0-9][0-9].[0-9][0-9].[0-9]' \
+                     '[0-9][0-9].[0-9][0-9].[0-9][0-9]']; do
+        (test ! "${srcroot}" && cd "${srcroot}"; git describe --long --abbrev=40 --match="${pattern}") > "${objroot}VERSION.tmp" 2>/dev/null
+        if test $? -eq 0 ; then
+          mv "${objroot}VERSION.tmp" "${objroot}VERSION"
+          break
+        fi
+      done
+    fi
+    rm -f "${objroot}VERSION.tmp"
+  ])
+
+if test ! -e "${objroot}VERSION" ; then
+  if test ! -e "${srcroot}VERSION" ; then
+    AC_MSG_RESULT(
+      [Missing VERSION file, and unable to generate it; creating bogus VERSION])
+    echo "0.0.0-0-g0000000000000000000000000000000000000000" > "${objroot}VERSION"
+  else
+    cp ${srcroot}VERSION ${objroot}VERSION
+  fi
+fi
+jemalloc_version=`cat "${objroot}VERSION"`
+jemalloc_version_major=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]1}'`
+jemalloc_version_minor=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]2}'`
+jemalloc_version_bugfix=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]3}'`
+jemalloc_version_nrev=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]4}'`
+jemalloc_version_gid=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]5}'`
+AC_SUBST([jemalloc_version])
+AC_SUBST([jemalloc_version_major])
+AC_SUBST([jemalloc_version_minor])
+AC_SUBST([jemalloc_version_bugfix])
+AC_SUBST([jemalloc_version_nrev])
+AC_SUBST([jemalloc_version_gid])
+
+dnl ============================================================================
+dnl Configure pthreads.
+
+if test "x$abi" != "xpecoff" ; then
+  AC_DEFINE([JEMALLOC_HAVE_PTHREAD], [ ])
+  AC_CHECK_HEADERS([pthread.h], , [AC_MSG_ERROR([pthread.h is missing])])
+  dnl Some systems may embed pthreads functionality in libc; check for libpthread
+  dnl first, but try libc too before failing.
+  AC_CHECK_LIB([pthread], [pthread_create], [JE_APPEND_VS(LIBS, -lpthread)],
+               [AC_SEARCH_LIBS([pthread_create], , ,
+                               AC_MSG_ERROR([libpthread is missing]))])
+  wrap_syms="${wrap_syms} pthread_create"
+  have_pthread="1"
+  dnl Check if we have dlsym support.
+  have_dlsym="1"
+  AC_CHECK_HEADERS([dlfcn.h],
+    AC_CHECK_FUNC([dlsym], [],
+      [AC_CHECK_LIB([dl], [dlsym], [LIBS="$LIBS -ldl"], [have_dlsym="0"])]),
+    [have_dlsym="0"])
+  if test "x$have_dlsym" = "x1" ; then
+    AC_DEFINE([JEMALLOC_HAVE_DLSYM], [ ])
+  fi
+  JE_COMPILABLE([pthread_atfork(3)], [
+#include <pthread.h>
+], [
+  pthread_atfork((void *)0, (void *)0, (void *)0);
+], [je_cv_pthread_atfork])
+  if test "x${je_cv_pthread_atfork}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_HAVE_PTHREAD_ATFORK], [ ])
+  fi
+  dnl Check if pthread_setname_np is available with the expected API.
+  JE_COMPILABLE([pthread_setname_np(3)], [
+#include <pthread.h>
+], [
+  pthread_setname_np(pthread_self(), "setname_test");
+], [je_cv_pthread_setname_np])
+  if test "x${je_cv_pthread_setname_np}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_HAVE_PTHREAD_SETNAME_NP], [ ])
+  fi
+fi
+
+JE_APPEND_VS(CPPFLAGS, -D_REENTRANT)
+
+dnl Check whether clock_gettime(2) is in libc or librt.
+AC_SEARCH_LIBS([clock_gettime], [rt])
+
+dnl Cray wrapper compiler often adds `-lrt` when using `-static`. Check with
+dnl `-dynamic` as well in case a user tries to dynamically link in jemalloc
+if test "x$je_cv_cray_prgenv_wrapper" = "xyes" ; then
+  if test "$ac_cv_search_clock_gettime" != "-lrt"; then
+    JE_CFLAGS_SAVE()
+
+    unset ac_cv_search_clock_gettime
+    JE_CFLAGS_ADD([-dynamic])
+    AC_SEARCH_LIBS([clock_gettime], [rt])
+
+    JE_CFLAGS_RESTORE()
+  fi
+fi
+
+dnl check for CLOCK_MONOTONIC_COARSE (Linux-specific).
+JE_COMPILABLE([clock_gettime(CLOCK_MONOTONIC_COARSE, ...)], [
+#include <time.h>
+], [
+	struct timespec ts;
+
+	clock_gettime(CLOCK_MONOTONIC_COARSE, &ts);
+], [je_cv_clock_monotonic_coarse])
+if test "x${je_cv_clock_monotonic_coarse}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE])
+fi
+
+dnl check for CLOCK_MONOTONIC.
+JE_COMPILABLE([clock_gettime(CLOCK_MONOTONIC, ...)], [
+#include <unistd.h>
+#include <time.h>
+], [
+	struct timespec ts;
+
+	clock_gettime(CLOCK_MONOTONIC, &ts);
+#if !defined(_POSIX_MONOTONIC_CLOCK) || _POSIX_MONOTONIC_CLOCK < 0
+#  error _POSIX_MONOTONIC_CLOCK missing/invalid
+#endif
+], [je_cv_clock_monotonic])
+if test "x${je_cv_clock_monotonic}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_CLOCK_MONOTONIC])
+fi
+
+dnl Check for mach_absolute_time().
+JE_COMPILABLE([mach_absolute_time()], [
+#include <mach/mach_time.h>
+], [
+	mach_absolute_time();
+], [je_cv_mach_absolute_time])
+if test "x${je_cv_mach_absolute_time}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_MACH_ABSOLUTE_TIME])
+fi
+
+dnl Use syscall(2) (if available) by default.
+AC_ARG_ENABLE([syscall],
+  [AS_HELP_STRING([--disable-syscall], [Disable use of syscall(2)])],
+[if test "x$enable_syscall" = "xno" ; then
+  enable_syscall="0"
+else
+  enable_syscall="1"
+fi
+],
+[enable_syscall="1"]
+)
+if test "x$enable_syscall" = "x1" ; then
+  dnl Check if syscall(2) is usable.  Treat warnings as errors, so that e.g. OS
+  dnl X 10.12's deprecation warning prevents use.
+  JE_CFLAGS_SAVE()
+  JE_CFLAGS_ADD([-Werror])
+  JE_COMPILABLE([syscall(2)], [
+#include <sys/syscall.h>
+#include <unistd.h>
+], [
+	syscall(SYS_write, 2, "hello", 5);
+],
+                [je_cv_syscall])
+  JE_CFLAGS_RESTORE()
+  if test "x$je_cv_syscall" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_USE_SYSCALL], [ ])
+  fi
+fi
+
+dnl Check if the GNU-specific secure_getenv function exists.
+AC_CHECK_FUNC([secure_getenv],
+              [have_secure_getenv="1"],
+              [have_secure_getenv="0"]
+             )
+if test "x$have_secure_getenv" = "x1" ; then
+  AC_DEFINE([JEMALLOC_HAVE_SECURE_GETENV], [ ])
+fi
+
+dnl Check if the GNU-specific sched_getcpu function exists.
+AC_CHECK_FUNC([sched_getcpu],
+              [have_sched_getcpu="1"],
+              [have_sched_getcpu="0"]
+             )
+if test "x$have_sched_getcpu" = "x1" ; then
+  AC_DEFINE([JEMALLOC_HAVE_SCHED_GETCPU], [ ])
+fi
+
+dnl Check if the GNU-specific sched_setaffinity function exists.
+AC_CHECK_FUNC([sched_setaffinity],
+              [have_sched_setaffinity="1"],
+              [have_sched_setaffinity="0"]
+             )
+if test "x$have_sched_setaffinity" = "x1" ; then
+  AC_DEFINE([JEMALLOC_HAVE_SCHED_SETAFFINITY], [ ])
+fi
+
+dnl Check if the Solaris/BSD issetugid function exists.
+AC_CHECK_FUNC([issetugid],
+              [have_issetugid="1"],
+              [have_issetugid="0"]
+             )
+if test "x$have_issetugid" = "x1" ; then
+  AC_DEFINE([JEMALLOC_HAVE_ISSETUGID], [ ])
+fi
+
+dnl Check whether the BSD-specific _malloc_thread_cleanup() exists.  If so, use
+dnl it rather than pthreads TSD cleanup functions to support cleanup during
+dnl thread exit, in order to avoid pthreads library recursion during
+dnl bootstrapping.
+AC_CHECK_FUNC([_malloc_thread_cleanup],
+              [have__malloc_thread_cleanup="1"],
+              [have__malloc_thread_cleanup="0"]
+             )
+if test "x$have__malloc_thread_cleanup" = "x1" ; then
+  AC_DEFINE([JEMALLOC_MALLOC_THREAD_CLEANUP], [ ])
+  wrap_syms="${wrap_syms} _malloc_thread_cleanup"
+  force_tls="1"
+fi
+
+dnl Check whether the BSD-specific _pthread_mutex_init_calloc_cb() exists.  If
+dnl so, mutex initialization causes allocation, and we need to implement this
+dnl callback function in order to prevent recursive allocation.
+AC_CHECK_FUNC([_pthread_mutex_init_calloc_cb],
+              [have__pthread_mutex_init_calloc_cb="1"],
+              [have__pthread_mutex_init_calloc_cb="0"]
+             )
+if test "x$have__pthread_mutex_init_calloc_cb" = "x1" ; then
+  AC_DEFINE([JEMALLOC_MUTEX_INIT_CB])
+  wrap_syms="${wrap_syms} _malloc_prefork _malloc_postfork"
+fi
+
+dnl Disable lazy locking by default.
+AC_ARG_ENABLE([lazy_lock],
+  [AS_HELP_STRING([--enable-lazy-lock],
+  [Enable lazy locking (only lock when multi-threaded)])],
+[if test "x$enable_lazy_lock" = "xno" ; then
+  enable_lazy_lock="0"
+else
+  enable_lazy_lock="1"
+fi
+],
+[enable_lazy_lock=""]
+)
+if test "x${enable_lazy_lock}" = "x" ; then
+  if test "x${force_lazy_lock}" = "x1" ; then
+    AC_MSG_RESULT([Forcing lazy-lock to avoid allocator/threading bootstrap issues])
+    enable_lazy_lock="1"
+  else
+    enable_lazy_lock="0"
+  fi
+fi
+if test "x${enable_lazy_lock}" = "x1" -a "x${abi}" = "xpecoff" ; then
+  AC_MSG_RESULT([Forcing no lazy-lock because thread creation monitoring is unimplemented])
+  enable_lazy_lock="0"
+fi
+if test "x$enable_lazy_lock" = "x1" ; then
+  if test "x$have_dlsym" = "x1" ; then
+    AC_DEFINE([JEMALLOC_LAZY_LOCK], [ ])
+  else
+    AC_MSG_ERROR([Missing dlsym support: lazy-lock cannot be enabled.])
+  fi
+fi
+AC_SUBST([enable_lazy_lock])
+
+dnl Automatically configure TLS.
+if test "x${force_tls}" = "x1" ; then
+  enable_tls="1"
+elif test "x${force_tls}" = "x0" ; then
+  enable_tls="0"
+else
+  enable_tls="1"
+fi
+if test "x${enable_tls}" = "x1" ; then
+AC_MSG_CHECKING([for TLS])
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
+[[
+    __thread int x;
+]], [[
+    x = 42;
+
+    return 0;
+]])],
+              AC_MSG_RESULT([yes]),
+              AC_MSG_RESULT([no])
+              enable_tls="0")
+else
+  enable_tls="0"
+fi
+AC_SUBST([enable_tls])
+if test "x${enable_tls}" = "x1" ; then
+  AC_DEFINE_UNQUOTED([JEMALLOC_TLS], [ ])
+fi
+
+dnl ============================================================================
+dnl Check for C11 atomics.
+
+JE_COMPILABLE([C11 atomics], [
+#include <stdint.h>
+#if (__STDC_VERSION__ >= 201112L) && !defined(__STDC_NO_ATOMICS__)
+#include <stdatomic.h>
+#else
+#error Atomics not available
+#endif
+], [
+    uint64_t *p = (uint64_t *)0;
+    uint64_t x = 1;
+    volatile atomic_uint_least64_t *a = (volatile atomic_uint_least64_t *)p;
+    uint64_t r = atomic_fetch_add(a, x) + x;
+    return r == 0;
+], [je_cv_c11_atomics])
+if test "x${je_cv_c11_atomics}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_C11_ATOMICS])
+fi
+
+dnl ============================================================================
+dnl Check for GCC-style __atomic atomics.
+
+JE_COMPILABLE([GCC __atomic atomics], [
+], [
+    int x = 0;
+    int val = 1;
+    int y = __atomic_fetch_add(&x, val, __ATOMIC_RELAXED);
+    int after_add = x;
+    return after_add == 1;
+], [je_cv_gcc_atomic_atomics])
+if test "x${je_cv_gcc_atomic_atomics}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_GCC_ATOMIC_ATOMICS])
+fi
+
+dnl ============================================================================
+dnl Check for GCC-style __sync atomics.
+
+JE_COMPILABLE([GCC __sync atomics], [
+], [
+    int x = 0;
+    int before_add = __sync_fetch_and_add(&x, 1);
+    int after_add = x;
+    return (before_add == 0) && (after_add == 1);
+], [je_cv_gcc_sync_atomics])
+if test "x${je_cv_gcc_sync_atomics}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_GCC_SYNC_ATOMICS])
+fi
+
+dnl ============================================================================
+dnl Check for atomic(3) operations as provided on Darwin.
+dnl We need this not for the atomic operations (which are provided above), but
+dnl rather for the OSSpinLock type it exposes.
+
+JE_COMPILABLE([Darwin OSAtomic*()], [
+#include <libkern/OSAtomic.h>
+#include <inttypes.h>
+], [
+	{
+		int32_t x32 = 0;
+		volatile int32_t *x32p = &x32;
+		OSAtomicAdd32(1, x32p);
+	}
+	{
+		int64_t x64 = 0;
+		volatile int64_t *x64p = &x64;
+		OSAtomicAdd64(1, x64p);
+	}
+], [je_cv_osatomic])
+if test "x${je_cv_osatomic}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_OSATOMIC], [ ])
+fi
+
+dnl ============================================================================
+dnl Check for madvise(2).
+
+JE_COMPILABLE([madvise(2)], [
+#include <sys/mman.h>
+], [
+	madvise((void *)0, 0, 0);
+], [je_cv_madvise])
+if test "x${je_cv_madvise}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_MADVISE], [ ])
+
+  dnl Check for madvise(..., MADV_FREE).
+  JE_COMPILABLE([madvise(..., MADV_FREE)], [
+#include <sys/mman.h>
+], [
+	madvise((void *)0, 0, MADV_FREE);
+], [je_cv_madv_free])
+  if test "x${je_cv_madv_free}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_PURGE_MADVISE_FREE], [ ])
+  elif test "x${je_cv_madvise}" = "xyes" ; then
+    case "${host_cpu}" in i686|x86_64)
+        case "${host}" in *-*-linux*)
+            AC_DEFINE([JEMALLOC_PURGE_MADVISE_FREE], [ ])
+            AC_DEFINE([JEMALLOC_DEFINE_MADVISE_FREE], [ ])
+	    ;;
+        esac
+        ;;
+    esac
+  fi
+
+  dnl Check for madvise(..., MADV_DONTNEED).
+  JE_COMPILABLE([madvise(..., MADV_DONTNEED)], [
+#include <sys/mman.h>
+], [
+	madvise((void *)0, 0, MADV_DONTNEED);
+], [je_cv_madv_dontneed])
+  if test "x${je_cv_madv_dontneed}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED], [ ])
+  fi
+
+  dnl Check for madvise(..., MADV_DO[NT]DUMP).
+  JE_COMPILABLE([madvise(..., MADV_DO[[NT]]DUMP)], [
+#include <sys/mman.h>
+], [
+	madvise((void *)0, 0, MADV_DONTDUMP);
+	madvise((void *)0, 0, MADV_DODUMP);
+], [je_cv_madv_dontdump])
+  if test "x${je_cv_madv_dontdump}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_MADVISE_DONTDUMP], [ ])
+  fi
+ 
+  dnl Check for madvise(..., MADV_[NO]HUGEPAGE).
+  JE_COMPILABLE([madvise(..., MADV_[[NO]]HUGEPAGE)], [
+#include <sys/mman.h>
+], [
+	madvise((void *)0, 0, MADV_HUGEPAGE);
+	madvise((void *)0, 0, MADV_NOHUGEPAGE);
+], [je_cv_thp])
+case "${host_cpu}" in
+  arm*)
+    ;;
+  *)
+  if test "x${je_cv_thp}" = "xyes" ; then
+    AC_DEFINE([JEMALLOC_HAVE_MADVISE_HUGE], [ ])
+  fi
+  ;;
+esac
+fi
+
+dnl ============================================================================
+dnl Check whether __sync_{add,sub}_and_fetch() are available despite
+dnl __GCC_HAVE_SYNC_COMPARE_AND_SWAP_n macros being undefined.
+
+AC_DEFUN([JE_SYNC_COMPARE_AND_SWAP_CHECK],[
+  AC_CACHE_CHECK([whether to force $1-bit __sync_{add,sub}_and_fetch()],
+               [je_cv_sync_compare_and_swap_$2],
+               [AC_LINK_IFELSE([AC_LANG_PROGRAM([
+                                                 #include <stdint.h>
+                                                ],
+                                                [
+                                                 #ifndef __GCC_HAVE_SYNC_COMPARE_AND_SWAP_$2
+                                                 {
+                                                    uint$1_t x$1 = 0;
+                                                    __sync_add_and_fetch(&x$1, 42);
+                                                    __sync_sub_and_fetch(&x$1, 1);
+                                                 }
+                                                 #else
+                                                 #error __GCC_HAVE_SYNC_COMPARE_AND_SWAP_$2 is defined, no need to force
+                                                 #endif
+                                                ])],
+                               [je_cv_sync_compare_and_swap_$2=yes],
+                               [je_cv_sync_compare_and_swap_$2=no])])
+
+  if test "x${je_cv_sync_compare_and_swap_$2}" = "xyes" ; then
+    AC_DEFINE([JE_FORCE_SYNC_COMPARE_AND_SWAP_$2], [ ])
+  fi
+])
+
+if test "x${je_cv_atomic9}" != "xyes" -a "x${je_cv_osatomic}" != "xyes" ; then
+  JE_SYNC_COMPARE_AND_SWAP_CHECK(32, 4)
+  JE_SYNC_COMPARE_AND_SWAP_CHECK(64, 8)
+fi
+
+dnl ============================================================================
+dnl Check for __builtin_clz() and __builtin_clzl().
+
+AC_CACHE_CHECK([for __builtin_clz],
+               [je_cv_builtin_clz],
+               [AC_LINK_IFELSE([AC_LANG_PROGRAM([],
+                                                [
+                                                {
+                                                        unsigned x = 0;
+                                                        int y = __builtin_clz(x);
+                                                }
+                                                {
+                                                        unsigned long x = 0;
+                                                        int y = __builtin_clzl(x);
+                                                }
+                                                ])],
+                               [je_cv_builtin_clz=yes],
+                               [je_cv_builtin_clz=no])])
+
+if test "x${je_cv_builtin_clz}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_BUILTIN_CLZ], [ ])
+fi
+
+dnl ============================================================================
+dnl Check for os_unfair_lock operations as provided on Darwin.
+
+JE_COMPILABLE([Darwin os_unfair_lock_*()], [
+#include <os/lock.h>
+#include <AvailabilityMacros.h>
+], [
+	#if MAC_OS_X_VERSION_MIN_REQUIRED < 101200
+	#error "os_unfair_lock is not supported"
+	#else
+	os_unfair_lock lock = OS_UNFAIR_LOCK_INIT;
+	os_unfair_lock_lock(&lock);
+	os_unfair_lock_unlock(&lock);
+	#endif
+], [je_cv_os_unfair_lock])
+if test "x${je_cv_os_unfair_lock}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_OS_UNFAIR_LOCK], [ ])
+fi
+
+dnl ============================================================================
+dnl Check for spinlock(3) operations as provided on Darwin.
+
+JE_COMPILABLE([Darwin OSSpin*()], [
+#include <libkern/OSAtomic.h>
+#include <inttypes.h>
+], [
+	OSSpinLock lock = 0;
+	OSSpinLockLock(&lock);
+	OSSpinLockUnlock(&lock);
+], [je_cv_osspin])
+if test "x${je_cv_osspin}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_OSSPIN], [ ])
+fi
+
+dnl ============================================================================
+dnl Darwin-related configuration.
+
+AC_ARG_ENABLE([zone-allocator],
+  [AS_HELP_STRING([--disable-zone-allocator],
+                  [Disable zone allocator for Darwin])],
+[if test "x$enable_zone_allocator" = "xno" ; then
+  enable_zone_allocator="0"
+else
+  enable_zone_allocator="1"
+fi
+],
+[if test "x${abi}" = "xmacho"; then
+  enable_zone_allocator="1"
+fi
+]
+)
+AC_SUBST([enable_zone_allocator])
+
+if test "x${enable_zone_allocator}" = "x1" ; then
+  if test "x${abi}" != "xmacho"; then
+    AC_MSG_ERROR([--enable-zone-allocator is only supported on Darwin])
+  fi
+  AC_DEFINE([JEMALLOC_ZONE], [ ])
+fi
+
+dnl ============================================================================
+dnl Use initial-exec TLS by default.
+AC_ARG_ENABLE([initial-exec-tls],
+  [AS_HELP_STRING([--disable-initial-exec-tls],
+                  [Disable the initial-exec tls model])],
+[if test "x$enable_initial_exec_tls" = "xno" ; then
+  enable_initial_exec_tls="0"
+else
+  enable_initial_exec_tls="1"
+fi
+],
+[enable_initial_exec_tls="1"]
+)
+AC_SUBST([enable_initial_exec_tls])
+
+if test "x${je_cv_tls_model}" = "xyes" -a \
+       "x${enable_initial_exec_tls}" = "x1" ; then
+  AC_DEFINE([JEMALLOC_TLS_MODEL],
+            [__attribute__((tls_model("initial-exec")))])
+else
+  AC_DEFINE([JEMALLOC_TLS_MODEL], [ ])
+fi
+
+dnl ============================================================================
+dnl Enable background threads if possible.
+
+if test "x${have_pthread}" = "x1" -a "x${have_dlsym}" = "x1" \
+    -a "x${je_cv_os_unfair_lock}" != "xyes" \
+    -a "x${je_cv_osspin}" != "xyes" ; then
+  AC_DEFINE([JEMALLOC_BACKGROUND_THREAD])
+fi
+
+dnl ============================================================================
+dnl Check for glibc malloc hooks
+
+JE_COMPILABLE([glibc malloc hook], [
+#include <stddef.h>
+
+extern void (* __free_hook)(void *ptr);
+extern void *(* __malloc_hook)(size_t size);
+extern void *(* __realloc_hook)(void *ptr, size_t size);
+], [
+  void *ptr = 0L;
+  if (__malloc_hook) ptr = __malloc_hook(1);
+  if (__realloc_hook) ptr = __realloc_hook(ptr, 2);
+  if (__free_hook && ptr) __free_hook(ptr);
+], [je_cv_glibc_malloc_hook])
+if test "x${je_cv_glibc_malloc_hook}" = "xyes" ; then
+  if test "x${JEMALLOC_PREFIX}" = "x" ; then
+    AC_DEFINE([JEMALLOC_GLIBC_MALLOC_HOOK], [ ])
+    wrap_syms="${wrap_syms} __free_hook __malloc_hook __realloc_hook"
+  fi
+fi
+
+JE_COMPILABLE([glibc memalign hook], [
+#include <stddef.h>
+
+extern void *(* __memalign_hook)(size_t alignment, size_t size);
+], [
+  void *ptr = 0L;
+  if (__memalign_hook) ptr = __memalign_hook(16, 7);
+], [je_cv_glibc_memalign_hook])
+if test "x${je_cv_glibc_memalign_hook}" = "xyes" ; then
+  if test "x${JEMALLOC_PREFIX}" = "x" ; then
+    AC_DEFINE([JEMALLOC_GLIBC_MEMALIGN_HOOK], [ ])
+    wrap_syms="${wrap_syms} __memalign_hook"
+  fi
+fi
+
+JE_COMPILABLE([pthreads adaptive mutexes], [
+#include <pthread.h>
+], [
+  pthread_mutexattr_t attr;
+  pthread_mutexattr_init(&attr);
+  pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_ADAPTIVE_NP);
+  pthread_mutexattr_destroy(&attr);
+], [je_cv_pthread_mutex_adaptive_np])
+if test "x${je_cv_pthread_mutex_adaptive_np}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_HAVE_PTHREAD_MUTEX_ADAPTIVE_NP], [ ])
+fi
+
+JE_CFLAGS_SAVE()
+JE_CFLAGS_ADD([-D_GNU_SOURCE])
+JE_CFLAGS_ADD([-Werror])
+JE_CFLAGS_ADD([-herror_on_warning])
+JE_COMPILABLE([strerror_r returns char with gnu source], [
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+], [
+  char *buffer = (char *) malloc(100);
+  char *error = strerror_r(EINVAL, buffer, 100);
+  printf("%s\n", error);
+], [je_cv_strerror_r_returns_char_with_gnu_source])
+JE_CFLAGS_RESTORE()
+if test "x${je_cv_strerror_r_returns_char_with_gnu_source}" = "xyes" ; then
+  AC_DEFINE([JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE], [ ])
+fi
+
+dnl ============================================================================
+dnl Check for typedefs, structures, and compiler characteristics.
+AC_HEADER_STDBOOL
+
+dnl ============================================================================
+dnl Define commands that generate output files.
+
+AC_CONFIG_COMMANDS([include/jemalloc/internal/public_symbols.txt], [
+  f="${objroot}include/jemalloc/internal/public_symbols.txt"
+  mkdir -p "${objroot}include/jemalloc/internal"
+  cp /dev/null "${f}"
+  for nm in `echo ${mangling_map} |tr ',' ' '` ; do
+    n=`echo ${nm} |tr ':' ' ' |awk '{print $[]1}'`
+    m=`echo ${nm} |tr ':' ' ' |awk '{print $[]2}'`
+    echo "${n}:${m}" >> "${f}"
+    dnl Remove name from public_syms so that it isn't redefined later.
+    public_syms=`for sym in ${public_syms}; do echo "${sym}"; done |grep -v "^${n}\$" |tr '\n' ' '`
+  done
+  for sym in ${public_syms} ; do
+    n="${sym}"
+    m="${JEMALLOC_PREFIX}${sym}"
+    echo "${n}:${m}" >> "${f}"
+  done
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+  mangling_map="${mangling_map}"
+  public_syms="${public_syms}"
+  JEMALLOC_PREFIX="${JEMALLOC_PREFIX}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/internal/private_symbols.awk], [
+  f="${objroot}include/jemalloc/internal/private_symbols.awk"
+  mkdir -p "${objroot}include/jemalloc/internal"
+  export_syms=`for sym in ${public_syms}; do echo "${JEMALLOC_PREFIX}${sym}"; done; for sym in ${wrap_syms}; do echo "${sym}"; done;`
+  "${srcdir}/include/jemalloc/internal/private_symbols.sh" "${SYM_PREFIX}" ${export_syms} > "${objroot}include/jemalloc/internal/private_symbols.awk"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+  public_syms="${public_syms}"
+  wrap_syms="${wrap_syms}"
+  SYM_PREFIX="${SYM_PREFIX}"
+  JEMALLOC_PREFIX="${JEMALLOC_PREFIX}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/internal/private_symbols_jet.awk], [
+  f="${objroot}include/jemalloc/internal/private_symbols_jet.awk"
+  mkdir -p "${objroot}include/jemalloc/internal"
+  export_syms=`for sym in ${public_syms}; do echo "jet_${sym}"; done; for sym in ${wrap_syms}; do echo "${sym}"; done;`
+  "${srcdir}/include/jemalloc/internal/private_symbols.sh" "${SYM_PREFIX}" ${export_syms} > "${objroot}include/jemalloc/internal/private_symbols_jet.awk"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+  public_syms="${public_syms}"
+  wrap_syms="${wrap_syms}"
+  SYM_PREFIX="${SYM_PREFIX}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/internal/public_namespace.h], [
+  mkdir -p "${objroot}include/jemalloc/internal"
+  "${srcdir}/include/jemalloc/internal/public_namespace.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/internal/public_namespace.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/internal/public_unnamespace.h], [
+  mkdir -p "${objroot}include/jemalloc/internal"
+  "${srcdir}/include/jemalloc/internal/public_unnamespace.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/internal/public_unnamespace.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/internal/size_classes.h], [
+  mkdir -p "${objroot}include/jemalloc/internal"
+  "${SHELL}" "${srcdir}/include/jemalloc/internal/size_classes.sh" "${LG_QUANTA}" 3 "${LG_PAGE_SIZES}" 2 > "${objroot}include/jemalloc/internal/size_classes.h"
+], [
+  SHELL="${SHELL}"
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+  LG_QUANTA="${LG_QUANTA}"
+  LG_PAGE_SIZES="${LG_PAGE_SIZES}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_protos_jet.h], [
+  mkdir -p "${objroot}include/jemalloc"
+  cat "${srcdir}/include/jemalloc/jemalloc_protos.h.in" | sed -e 's/@je_@/jet_/g' > "${objroot}include/jemalloc/jemalloc_protos_jet.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_rename.h], [
+  mkdir -p "${objroot}include/jemalloc"
+  "${srcdir}/include/jemalloc/jemalloc_rename.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/jemalloc_rename.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_mangle.h], [
+  mkdir -p "${objroot}include/jemalloc"
+  "${srcdir}/include/jemalloc/jemalloc_mangle.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" je_ > "${objroot}include/jemalloc/jemalloc_mangle.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_mangle_jet.h], [
+  mkdir -p "${objroot}include/jemalloc"
+  "${srcdir}/include/jemalloc/jemalloc_mangle.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" jet_ > "${objroot}include/jemalloc/jemalloc_mangle_jet.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+])
+AC_CONFIG_COMMANDS([include/jemalloc/jemalloc.h], [
+  mkdir -p "${objroot}include/jemalloc"
+  "${srcdir}/include/jemalloc/jemalloc.sh" "${objroot}" > "${objroot}include/jemalloc/jemalloc${install_suffix}.h"
+], [
+  srcdir="${srcdir}"
+  objroot="${objroot}"
+  install_suffix="${install_suffix}"
+])
+
+dnl Process .in files.
+AC_SUBST([cfghdrs_in])
+AC_SUBST([cfghdrs_out])
+AC_CONFIG_HEADERS([$cfghdrs_tup])
+
+dnl ============================================================================
+dnl Generate outputs.
+
+AC_CONFIG_FILES([$cfgoutputs_tup config.stamp bin/jemalloc-config bin/jemalloc.sh bin/jeprof])
+AC_SUBST([cfgoutputs_in])
+AC_SUBST([cfgoutputs_out])
+AC_OUTPUT
+
+dnl ============================================================================
+dnl Print out the results of configuration.
+AC_MSG_RESULT([===============================================================================])
+AC_MSG_RESULT([jemalloc version   : ${jemalloc_version}])
+AC_MSG_RESULT([library revision   : ${rev}])
+AC_MSG_RESULT([])
+AC_MSG_RESULT([CONFIG             : ${CONFIG}])
+AC_MSG_RESULT([CC                 : ${CC}])
+AC_MSG_RESULT([CONFIGURE_CFLAGS   : ${CONFIGURE_CFLAGS}])
+AC_MSG_RESULT([SPECIFIED_CFLAGS   : ${SPECIFIED_CFLAGS}])
+AC_MSG_RESULT([EXTRA_CFLAGS       : ${EXTRA_CFLAGS}])
+AC_MSG_RESULT([CPPFLAGS           : ${CPPFLAGS}])
+AC_MSG_RESULT([CXX                : ${CXX}])
+AC_MSG_RESULT([CONFIGURE_CXXFLAGS : ${CONFIGURE_CXXFLAGS}])
+AC_MSG_RESULT([SPECIFIED_CXXFLAGS : ${SPECIFIED_CXXFLAGS}])
+AC_MSG_RESULT([EXTRA_CXXFLAGS     : ${EXTRA_CXXFLAGS}])
+AC_MSG_RESULT([LDFLAGS            : ${LDFLAGS}])
+AC_MSG_RESULT([EXTRA_LDFLAGS      : ${EXTRA_LDFLAGS}])
+AC_MSG_RESULT([DSO_LDFLAGS        : ${DSO_LDFLAGS}])
+AC_MSG_RESULT([LIBS               : ${LIBS}])
+AC_MSG_RESULT([RPATH_EXTRA        : ${RPATH_EXTRA}])
+AC_MSG_RESULT([])
+AC_MSG_RESULT([XSLTPROC           : ${XSLTPROC}])
+AC_MSG_RESULT([XSLROOT            : ${XSLROOT}])
+AC_MSG_RESULT([])
+AC_MSG_RESULT([PREFIX             : ${PREFIX}])
+AC_MSG_RESULT([BINDIR             : ${BINDIR}])
+AC_MSG_RESULT([DATADIR            : ${DATADIR}])
+AC_MSG_RESULT([INCLUDEDIR         : ${INCLUDEDIR}])
+AC_MSG_RESULT([LIBDIR             : ${LIBDIR}])
+AC_MSG_RESULT([MANDIR             : ${MANDIR}])
+AC_MSG_RESULT([])
+AC_MSG_RESULT([srcroot            : ${srcroot}])
+AC_MSG_RESULT([abs_srcroot        : ${abs_srcroot}])
+AC_MSG_RESULT([objroot            : ${objroot}])
+AC_MSG_RESULT([abs_objroot        : ${abs_objroot}])
+AC_MSG_RESULT([])
+AC_MSG_RESULT([JEMALLOC_PREFIX    : ${JEMALLOC_PREFIX}])
+AC_MSG_RESULT([JEMALLOC_PRIVATE_NAMESPACE])
+AC_MSG_RESULT([                   : ${JEMALLOC_PRIVATE_NAMESPACE}])
+AC_MSG_RESULT([install_suffix     : ${install_suffix}])
+AC_MSG_RESULT([malloc_conf        : ${config_malloc_conf}])
+AC_MSG_RESULT([autogen            : ${enable_autogen}])
+AC_MSG_RESULT([debug              : ${enable_debug}])
+AC_MSG_RESULT([stats              : ${enable_stats}])
+AC_MSG_RESULT([prof               : ${enable_prof}])
+AC_MSG_RESULT([prof-libunwind     : ${enable_prof_libunwind}])
+AC_MSG_RESULT([prof-libgcc        : ${enable_prof_libgcc}])
+AC_MSG_RESULT([prof-gcc           : ${enable_prof_gcc}])
+AC_MSG_RESULT([fill               : ${enable_fill}])
+AC_MSG_RESULT([utrace             : ${enable_utrace}])
+AC_MSG_RESULT([xmalloc            : ${enable_xmalloc}])
+AC_MSG_RESULT([log                : ${enable_log}])
+AC_MSG_RESULT([lazy_lock          : ${enable_lazy_lock}])
+AC_MSG_RESULT([cache-oblivious    : ${enable_cache_oblivious}])
+AC_MSG_RESULT([cxx                : ${enable_cxx}])
+AC_MSG_RESULT([===============================================================================])
diff --git a/redis-stable/deps/jemalloc/doc/html.xsl.in b/redis-stable/deps/jemalloc/doc/html.xsl.in
new file mode 100644
index 00000000..ec4fa655
--- /dev/null
+++ b/redis-stable/deps/jemalloc/doc/html.xsl.in
@@ -0,0 +1,5 @@
+<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
+  <xsl:import href="@XSLROOT@/html/docbook.xsl"/>
+  <xsl:import href="@abs_srcroot@doc/stylesheet.xsl"/>
+  <xsl:output method="xml" encoding="utf-8"/>
+</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/doc/jemalloc.xml.in b/redis-stable/deps/jemalloc/doc/jemalloc.xml.in
new file mode 100644
index 00000000..1e12fd3a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/doc/jemalloc.xml.in
@@ -0,0 +1,3379 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<?xml-stylesheet type="text/xsl"
+        href="http://docbook.sourceforge.net/release/xsl/current/manpages/docbook.xsl"?>
+<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.4//EN"
+        "http://www.oasis-open.org/docbook/xml/4.4/docbookx.dtd" [
+]>
+
+<refentry>
+  <refentryinfo>
+    <title>User Manual</title>
+    <productname>jemalloc</productname>
+    <releaseinfo role="version">@jemalloc_version@</releaseinfo>
+    <authorgroup>
+      <author>
+        <firstname>Jason</firstname>
+        <surname>Evans</surname>
+        <personblurb>Author</personblurb>
+      </author>
+    </authorgroup>
+  </refentryinfo>
+  <refmeta>
+    <refentrytitle>JEMALLOC</refentrytitle>
+    <manvolnum>3</manvolnum>
+  </refmeta>
+  <refnamediv>
+    <refdescriptor>jemalloc</refdescriptor>
+    <refname>jemalloc</refname>
+    <!-- Each refname causes a man page file to be created.  Only if this were
+         the system malloc(3) implementation would these files be appropriate.
+    <refname>malloc</refname>
+    <refname>calloc</refname>
+    <refname>posix_memalign</refname>
+    <refname>aligned_alloc</refname>
+    <refname>realloc</refname>
+    <refname>free</refname>
+    <refname>mallocx</refname>
+    <refname>rallocx</refname>
+    <refname>xallocx</refname>
+    <refname>sallocx</refname>
+    <refname>dallocx</refname>
+    <refname>sdallocx</refname>
+    <refname>nallocx</refname>
+    <refname>mallctl</refname>
+    <refname>mallctlnametomib</refname>
+    <refname>mallctlbymib</refname>
+    <refname>malloc_stats_print</refname>
+    <refname>malloc_usable_size</refname>
+    -->
+    <refpurpose>general purpose memory allocation functions</refpurpose>
+  </refnamediv>
+  <refsect1 id="library">
+    <title>LIBRARY</title>
+    <para>This manual describes jemalloc @jemalloc_version@.  More information
+    can be found at the <ulink
+    url="http://jemalloc.net/">jemalloc website</ulink>.</para>
+  </refsect1>
+  <refsynopsisdiv>
+    <title>SYNOPSIS</title>
+    <funcsynopsis>
+      <funcsynopsisinfo>#include &lt;<filename class="headerfile">jemalloc/jemalloc.h</filename>&gt;</funcsynopsisinfo>
+      <refsect2>
+        <title>Standard API</title>
+        <funcprototype>
+          <funcdef>void *<function>malloc</function></funcdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void *<function>calloc</function></funcdef>
+          <paramdef>size_t <parameter>number</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>int <function>posix_memalign</function></funcdef>
+          <paramdef>void **<parameter>ptr</parameter></paramdef>
+          <paramdef>size_t <parameter>alignment</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void *<function>aligned_alloc</function></funcdef>
+          <paramdef>size_t <parameter>alignment</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void *<function>realloc</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void <function>free</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+        </funcprototype>
+      </refsect2>
+      <refsect2>
+        <title>Non-standard API</title>
+        <funcprototype>
+          <funcdef>void *<function>mallocx</function></funcdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void *<function>rallocx</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>size_t <function>xallocx</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>extra</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>size_t <function>sallocx</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void <function>dallocx</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void <function>sdallocx</function></funcdef>
+          <paramdef>void *<parameter>ptr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>size_t <function>nallocx</function></funcdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>int <parameter>flags</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>int <function>mallctl</function></funcdef>
+          <paramdef>const char *<parameter>name</parameter></paramdef>
+          <paramdef>void *<parameter>oldp</parameter></paramdef>
+          <paramdef>size_t *<parameter>oldlenp</parameter></paramdef>
+          <paramdef>void *<parameter>newp</parameter></paramdef>
+          <paramdef>size_t <parameter>newlen</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>int <function>mallctlnametomib</function></funcdef>
+          <paramdef>const char *<parameter>name</parameter></paramdef>
+          <paramdef>size_t *<parameter>mibp</parameter></paramdef>
+          <paramdef>size_t *<parameter>miblenp</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>int <function>mallctlbymib</function></funcdef>
+          <paramdef>const size_t *<parameter>mib</parameter></paramdef>
+          <paramdef>size_t <parameter>miblen</parameter></paramdef>
+          <paramdef>void *<parameter>oldp</parameter></paramdef>
+          <paramdef>size_t *<parameter>oldlenp</parameter></paramdef>
+          <paramdef>void *<parameter>newp</parameter></paramdef>
+          <paramdef>size_t <parameter>newlen</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void <function>malloc_stats_print</function></funcdef>
+          <paramdef>void <parameter>(*write_cb)</parameter>
+            <funcparams>void *, const char *</funcparams>
+          </paramdef>
+          <paramdef>void *<parameter>cbopaque</parameter></paramdef>
+          <paramdef>const char *<parameter>opts</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>size_t <function>malloc_usable_size</function></funcdef>
+          <paramdef>const void *<parameter>ptr</parameter></paramdef>
+        </funcprototype>
+        <funcprototype>
+          <funcdef>void <function>(*malloc_message)</function></funcdef>
+          <paramdef>void *<parameter>cbopaque</parameter></paramdef>
+          <paramdef>const char *<parameter>s</parameter></paramdef>
+        </funcprototype>
+        <para><type>const char *</type><varname>malloc_conf</varname>;</para>
+      </refsect2>
+    </funcsynopsis>
+  </refsynopsisdiv>
+  <refsect1 id="description">
+    <title>DESCRIPTION</title>
+    <refsect2>
+      <title>Standard API</title>
+
+      <para>The <function>malloc()</function> function allocates
+      <parameter>size</parameter> bytes of uninitialized memory.  The allocated
+      space is suitably aligned (after possible pointer coercion) for storage
+      of any type of object.</para>
+
+      <para>The <function>calloc()</function> function allocates
+      space for <parameter>number</parameter> objects, each
+      <parameter>size</parameter> bytes in length.  The result is identical to
+      calling <function>malloc()</function> with an argument of
+      <parameter>number</parameter> * <parameter>size</parameter>, with the
+      exception that the allocated memory is explicitly initialized to zero
+      bytes.</para>
+
+      <para>The <function>posix_memalign()</function> function
+      allocates <parameter>size</parameter> bytes of memory such that the
+      allocation's base address is a multiple of
+      <parameter>alignment</parameter>, and returns the allocation in the value
+      pointed to by <parameter>ptr</parameter>.  The requested
+      <parameter>alignment</parameter> must be a power of 2 at least as large as
+      <code language="C">sizeof(<type>void *</type>)</code>.</para>
+
+      <para>The <function>aligned_alloc()</function> function
+      allocates <parameter>size</parameter> bytes of memory such that the
+      allocation's base address is a multiple of
+      <parameter>alignment</parameter>.  The requested
+      <parameter>alignment</parameter> must be a power of 2.  Behavior is
+      undefined if <parameter>size</parameter> is not an integral multiple of
+      <parameter>alignment</parameter>.</para>
+
+      <para>The <function>realloc()</function> function changes the
+      size of the previously allocated memory referenced by
+      <parameter>ptr</parameter> to <parameter>size</parameter> bytes.  The
+      contents of the memory are unchanged up to the lesser of the new and old
+      sizes.  If the new size is larger, the contents of the newly allocated
+      portion of the memory are undefined.  Upon success, the memory referenced
+      by <parameter>ptr</parameter> is freed and a pointer to the newly
+      allocated memory is returned.  Note that
+      <function>realloc()</function> may move the memory allocation,
+      resulting in a different return value than <parameter>ptr</parameter>.
+      If <parameter>ptr</parameter> is <constant>NULL</constant>, the
+      <function>realloc()</function> function behaves identically to
+      <function>malloc()</function> for the specified size.</para>
+
+      <para>The <function>free()</function> function causes the
+      allocated memory referenced by <parameter>ptr</parameter> to be made
+      available for future allocations.  If <parameter>ptr</parameter> is
+      <constant>NULL</constant>, no action occurs.</para>
+    </refsect2>
+    <refsect2>
+      <title>Non-standard API</title>
+      <para>The <function>mallocx()</function>,
+      <function>rallocx()</function>,
+      <function>xallocx()</function>,
+      <function>sallocx()</function>,
+      <function>dallocx()</function>,
+      <function>sdallocx()</function>, and
+      <function>nallocx()</function> functions all have a
+      <parameter>flags</parameter> argument that can be used to specify
+      options.  The functions only check the options that are contextually
+      relevant.  Use bitwise or (<code language="C">|</code>) operations to
+      specify one or more of the following:
+        <variablelist>
+          <varlistentry id="MALLOCX_LG_ALIGN">
+            <term><constant>MALLOCX_LG_ALIGN(<parameter>la</parameter>)
+            </constant></term>
+
+            <listitem><para>Align the memory allocation to start at an address
+            that is a multiple of <code language="C">(1 &lt;&lt;
+            <parameter>la</parameter>)</code>.  This macro does not validate
+            that <parameter>la</parameter> is within the valid
+            range.</para></listitem>
+          </varlistentry>
+          <varlistentry id="MALLOCX_ALIGN">
+            <term><constant>MALLOCX_ALIGN(<parameter>a</parameter>)
+            </constant></term>
+
+            <listitem><para>Align the memory allocation to start at an address
+            that is a multiple of <parameter>a</parameter>, where
+            <parameter>a</parameter> is a power of two.  This macro does not
+            validate that <parameter>a</parameter> is a power of 2.
+            </para></listitem>
+          </varlistentry>
+          <varlistentry id="MALLOCX_ZERO">
+            <term><constant>MALLOCX_ZERO</constant></term>
+
+            <listitem><para>Initialize newly allocated memory to contain zero
+            bytes.  In the growing reallocation case, the real size prior to
+            reallocation defines the boundary between untouched bytes and those
+            that are initialized to contain zero bytes.  If this macro is
+            absent, newly allocated memory is uninitialized.</para></listitem>
+          </varlistentry>
+          <varlistentry id="MALLOCX_TCACHE">
+            <term><constant>MALLOCX_TCACHE(<parameter>tc</parameter>)
+            </constant></term>
+
+            <listitem><para>Use the thread-specific cache (tcache) specified by
+            the identifier <parameter>tc</parameter>, which must have been
+            acquired via the <link
+            linkend="tcache.create"><mallctl>tcache.create</mallctl></link>
+            mallctl.  This macro does not validate that
+            <parameter>tc</parameter> specifies a valid
+            identifier.</para></listitem>
+          </varlistentry>
+          <varlistentry id="MALLOC_TCACHE_NONE">
+            <term><constant>MALLOCX_TCACHE_NONE</constant></term>
+
+            <listitem><para>Do not use a thread-specific cache (tcache).  Unless
+            <constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant> or
+            <constant>MALLOCX_TCACHE_NONE</constant> is specified, an
+            automatically managed tcache will be used under many circumstances.
+            This macro cannot be used in the same <parameter>flags</parameter>
+            argument as
+            <constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant>.</para></listitem>
+          </varlistentry>
+          <varlistentry id="MALLOCX_ARENA">
+            <term><constant>MALLOCX_ARENA(<parameter>a</parameter>)
+            </constant></term>
+
+            <listitem><para>Use the arena specified by the index
+            <parameter>a</parameter>.  This macro has no effect for regions that
+            were allocated via an arena other than the one specified.  This
+            macro does not validate that <parameter>a</parameter> specifies an
+            arena index in the valid range.</para></listitem>
+          </varlistentry>
+        </variablelist>
+      </para>
+
+      <para>The <function>mallocx()</function> function allocates at
+      least <parameter>size</parameter> bytes of memory, and returns a pointer
+      to the base address of the allocation.  Behavior is undefined if
+      <parameter>size</parameter> is <constant>0</constant>.</para>
+
+      <para>The <function>rallocx()</function> function resizes the
+      allocation at <parameter>ptr</parameter> to be at least
+      <parameter>size</parameter> bytes, and returns a pointer to the base
+      address of the resulting allocation, which may or may not have moved from
+      its original location.  Behavior is undefined if
+      <parameter>size</parameter> is <constant>0</constant>.</para>
+
+      <para>The <function>xallocx()</function> function resizes the
+      allocation at <parameter>ptr</parameter> in place to be at least
+      <parameter>size</parameter> bytes, and returns the real size of the
+      allocation.  If <parameter>extra</parameter> is non-zero, an attempt is
+      made to resize the allocation to be at least <code
+      language="C">(<parameter>size</parameter> +
+      <parameter>extra</parameter>)</code> bytes, though inability to allocate
+      the extra byte(s) will not by itself result in failure to resize.
+      Behavior is undefined if <parameter>size</parameter> is
+      <constant>0</constant>, or if <code
+      language="C">(<parameter>size</parameter> + <parameter>extra</parameter>
+      &gt; <constant>SIZE_T_MAX</constant>)</code>.</para>
+
+      <para>The <function>sallocx()</function> function returns the
+      real size of the allocation at <parameter>ptr</parameter>.</para>
+
+      <para>The <function>dallocx()</function> function causes the
+      memory referenced by <parameter>ptr</parameter> to be made available for
+      future allocations.</para>
+
+      <para>The <function>sdallocx()</function> function is an
+      extension of <function>dallocx()</function> with a
+      <parameter>size</parameter> parameter to allow the caller to pass in the
+      allocation size as an optimization.  The minimum valid input size is the
+      original requested size of the allocation, and the maximum valid input
+      size is the corresponding value returned by
+      <function>nallocx()</function> or
+      <function>sallocx()</function>.</para>
+
+      <para>The <function>nallocx()</function> function allocates no
+      memory, but it performs the same size computation as the
+      <function>mallocx()</function> function, and returns the real
+      size of the allocation that would result from the equivalent
+      <function>mallocx()</function> function call, or
+      <constant>0</constant> if the inputs exceed the maximum supported size
+      class and/or alignment.  Behavior is undefined if
+      <parameter>size</parameter> is <constant>0</constant>.</para>
+
+      <para>The <function>mallctl()</function> function provides a
+      general interface for introspecting the memory allocator, as well as
+      setting modifiable parameters and triggering actions.  The
+      period-separated <parameter>name</parameter> argument specifies a
+      location in a tree-structured namespace; see the <xref
+      linkend="mallctl_namespace" xrefstyle="template:%t"/> section for
+      documentation on the tree contents.  To read a value, pass a pointer via
+      <parameter>oldp</parameter> to adequate space to contain the value, and a
+      pointer to its length via <parameter>oldlenp</parameter>; otherwise pass
+      <constant>NULL</constant> and <constant>NULL</constant>.  Similarly, to
+      write a value, pass a pointer to the value via
+      <parameter>newp</parameter>, and its length via
+      <parameter>newlen</parameter>; otherwise pass <constant>NULL</constant>
+      and <constant>0</constant>.</para>
+
+      <para>The <function>mallctlnametomib()</function> function
+      provides a way to avoid repeated name lookups for applications that
+      repeatedly query the same portion of the namespace, by translating a name
+      to a <quote>Management Information Base</quote> (MIB) that can be passed
+      repeatedly to <function>mallctlbymib()</function>.  Upon
+      successful return from <function>mallctlnametomib()</function>,
+      <parameter>mibp</parameter> contains an array of
+      <parameter>*miblenp</parameter> integers, where
+      <parameter>*miblenp</parameter> is the lesser of the number of components
+      in <parameter>name</parameter> and the input value of
+      <parameter>*miblenp</parameter>.  Thus it is possible to pass a
+      <parameter>*miblenp</parameter> that is smaller than the number of
+      period-separated name components, which results in a partial MIB that can
+      be used as the basis for constructing a complete MIB.  For name
+      components that are integers (e.g. the 2 in
+      <link
+      linkend="arenas.bin.i.size"><mallctl>arenas.bin.2.size</mallctl></link>),
+      the corresponding MIB component will always be that integer.  Therefore,
+      it is legitimate to construct code like the following: <programlisting
+      language="C"><![CDATA[
+unsigned nbins, i;
+size_t mib[4];
+size_t len, miblen;
+
+len = sizeof(nbins);
+mallctl("arenas.nbins", &nbins, &len, NULL, 0);
+
+miblen = 4;
+mallctlnametomib("arenas.bin.0.size", mib, &miblen);
+for (i = 0; i < nbins; i++) {
+	size_t bin_size;
+
+	mib[2] = i;
+	len = sizeof(bin_size);
+	mallctlbymib(mib, miblen, (void *)&bin_size, &len, NULL, 0);
+	/* Do something with bin_size... */
+}]]></programlisting></para>
+
+      <varlistentry id="malloc_stats_print_opts">
+      </varlistentry>
+      <para>The <function>malloc_stats_print()</function> function writes
+      summary statistics via the <parameter>write_cb</parameter> callback
+      function pointer and <parameter>cbopaque</parameter> data passed to
+      <parameter>write_cb</parameter>, or <function>malloc_message()</function>
+      if <parameter>write_cb</parameter> is <constant>NULL</constant>.  The
+      statistics are presented in human-readable form unless <quote>J</quote> is
+      specified as a character within the <parameter>opts</parameter> string, in
+      which case the statistics are presented in <ulink
+      url="http://www.json.org/">JSON format</ulink>.  This function can be
+      called repeatedly.  General information that never changes during
+      execution can be omitted by specifying <quote>g</quote> as a character
+      within the <parameter>opts</parameter> string.  Note that
+      <function>malloc_message()</function> uses the
+      <function>mallctl*()</function> functions internally, so inconsistent
+      statistics can be reported if multiple threads use these functions
+      simultaneously.  If <option>--enable-stats</option> is specified during
+      configuration, <quote>m</quote>, <quote>d</quote>, and <quote>a</quote>
+      can be specified to omit merged arena, destroyed merged arena, and per
+      arena statistics, respectively; <quote>b</quote> and <quote>l</quote> can
+      be specified to omit per size class statistics for bins and large objects,
+      respectively; <quote>x</quote> can be specified to omit all mutex
+      statistics.  Unrecognized characters are silently ignored.  Note that
+      thread caching may prevent some statistics from being completely up to
+      date, since extra locking would be required to merge counters that track
+      thread cache operations.</para>
+
+      <para>The <function>malloc_usable_size()</function> function
+      returns the usable size of the allocation pointed to by
+      <parameter>ptr</parameter>.  The return value may be larger than the size
+      that was requested during allocation.  The
+      <function>malloc_usable_size()</function> function is not a
+      mechanism for in-place <function>realloc()</function>; rather
+      it is provided solely as a tool for introspection purposes.  Any
+      discrepancy between the requested allocation size and the size reported
+      by <function>malloc_usable_size()</function> should not be
+      depended on, since such behavior is entirely implementation-dependent.
+      </para>
+    </refsect2>
+  </refsect1>
+  <refsect1 id="tuning">
+    <title>TUNING</title>
+    <para>Once, when the first call is made to one of the memory allocation
+    routines, the allocator initializes its internals based in part on various
+    options that can be specified at compile- or run-time.</para>
+
+    <para>The string specified via <option>--with-malloc-conf</option>, the
+    string pointed to by the global variable <varname>malloc_conf</varname>, the
+    <quote>name</quote> of the file referenced by the symbolic link named
+    <filename class="symlink">/etc/malloc.conf</filename>, and the value of the
+    environment variable <envar>MALLOC_CONF</envar>, will be interpreted, in
+    that order, from left to right as options.  Note that
+    <varname>malloc_conf</varname> may be read before
+    <function>main()</function> is entered, so the declaration of
+    <varname>malloc_conf</varname> should specify an initializer that contains
+    the final value to be read by jemalloc.  <option>--with-malloc-conf</option>
+    and <varname>malloc_conf</varname> are compile-time mechanisms, whereas
+    <filename class="symlink">/etc/malloc.conf</filename> and
+    <envar>MALLOC_CONF</envar> can be safely set any time prior to program
+    invocation.</para>
+
+    <para>An options string is a comma-separated list of option:value pairs.
+    There is one key corresponding to each <link
+    linkend="opt.abort"><mallctl>opt.*</mallctl></link> mallctl (see the <xref
+    linkend="mallctl_namespace" xrefstyle="template:%t"/> section for options
+    documentation).  For example, <literal>abort:true,narenas:1</literal> sets
+    the <link linkend="opt.abort"><mallctl>opt.abort</mallctl></link> and <link
+    linkend="opt.narenas"><mallctl>opt.narenas</mallctl></link> options.  Some
+    options have boolean values (true/false), others have integer values (base
+    8, 10, or 16, depending on prefix), and yet others have raw string
+    values.</para>
+  </refsect1>
+  <refsect1 id="implementation_notes">
+    <title>IMPLEMENTATION NOTES</title>
+    <para>Traditionally, allocators have used
+    <citerefentry><refentrytitle>sbrk</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry> to obtain memory, which is
+    suboptimal for several reasons, including race conditions, increased
+    fragmentation, and artificial limitations on maximum usable memory.  If
+    <citerefentry><refentrytitle>sbrk</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry> is supported by the operating
+    system, this allocator uses both
+    <citerefentry><refentrytitle>mmap</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry> and
+    <citerefentry><refentrytitle>sbrk</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry>, in that order of preference;
+    otherwise only <citerefentry><refentrytitle>mmap</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry> is used.</para>
+
+    <para>This allocator uses multiple arenas in order to reduce lock
+    contention for threaded programs on multi-processor systems.  This works
+    well with regard to threading scalability, but incurs some costs.  There is
+    a small fixed per-arena overhead, and additionally, arenas manage memory
+    completely independently of each other, which means a small fixed increase
+    in overall memory fragmentation.  These overheads are not generally an
+    issue, given the number of arenas normally used.  Note that using
+    substantially more arenas than the default is not likely to improve
+    performance, mainly due to reduced cache performance.  However, it may make
+    sense to reduce the number of arenas if an application does not make much
+    use of the allocation functions.</para>
+
+    <para>In addition to multiple arenas, this allocator supports
+    thread-specific caching, in order to make it possible to completely avoid
+    synchronization for most allocation requests.  Such caching allows very fast
+    allocation in the common case, but it increases memory usage and
+    fragmentation, since a bounded number of objects can remain allocated in
+    each thread cache.</para>
+
+    <para>Memory is conceptually broken into extents.  Extents are always
+    aligned to multiples of the page size.  This alignment makes it possible to
+    find metadata for user objects quickly.  User objects are broken into two
+    categories according to size: small and large.  Contiguous small objects
+    comprise a slab, which resides within a single extent, whereas large objects
+    each have their own extents backing them.</para>
+
+    <para>Small objects are managed in groups by slabs.  Each slab maintains
+    a bitmap to track which regions are in use.  Allocation requests that are no
+    more than half the quantum (8 or 16, depending on architecture) are rounded
+    up to the nearest power of two that is at least <code
+    language="C">sizeof(<type>double</type>)</code>.  All other object size
+    classes are multiples of the quantum, spaced such that there are four size
+    classes for each doubling in size, which limits internal fragmentation to
+    approximately 20% for all but the smallest size classes.  Small size classes
+    are smaller than four times the page size, and large size classes extend
+    from four times the page size up to the largest size class that does not
+    exceed <constant>PTRDIFF_MAX</constant>.</para>
+
+    <para>Allocations are packed tightly together, which can be an issue for
+    multi-threaded applications.  If you need to assure that allocations do not
+    suffer from cacheline sharing, round your allocation requests up to the
+    nearest multiple of the cacheline size, or specify cacheline alignment when
+    allocating.</para>
+
+    <para>The <function>realloc()</function>,
+    <function>rallocx()</function>, and
+    <function>xallocx()</function> functions may resize allocations
+    without moving them under limited circumstances.  Unlike the
+    <function>*allocx()</function> API, the standard API does not
+    officially round up the usable size of an allocation to the nearest size
+    class, so technically it is necessary to call
+    <function>realloc()</function> to grow e.g. a 9-byte allocation to
+    16 bytes, or shrink a 16-byte allocation to 9 bytes.  Growth and shrinkage
+    trivially succeeds in place as long as the pre-size and post-size both round
+    up to the same size class.  No other API guarantees are made regarding
+    in-place resizing, but the current implementation also tries to resize large
+    allocations in place, as long as the pre-size and post-size are both large.
+    For shrinkage to succeed, the extent allocator must support splitting (see
+    <link
+    linkend="arena.i.extent_hooks"><mallctl>arena.&lt;i&gt;.extent_hooks</mallctl></link>).
+    Growth only succeeds if the trailing memory is currently available, and the
+    extent allocator supports merging.</para>
+
+    <para>Assuming 4 KiB pages and a 16-byte quantum on a 64-bit system, the
+    size classes in each category are as shown in <xref linkend="size_classes"
+    xrefstyle="template:Table %n"/>.</para>
+
+    <table xml:id="size_classes" frame="all">
+      <title>Size classes</title>
+      <tgroup cols="3" colsep="1" rowsep="1">
+      <colspec colname="c1" align="left"/>
+      <colspec colname="c2" align="right"/>
+      <colspec colname="c3" align="left"/>
+      <thead>
+        <row>
+          <entry>Category</entry>
+          <entry>Spacing</entry>
+          <entry>Size</entry>
+        </row>
+      </thead>
+      <tbody>
+        <row>
+          <entry morerows="8">Small</entry>
+          <entry>lg</entry>
+          <entry>[8]</entry>
+        </row>
+        <row>
+          <entry>16</entry>
+          <entry>[16, 32, 48, 64, 80, 96, 112, 128]</entry>
+        </row>
+        <row>
+          <entry>32</entry>
+          <entry>[160, 192, 224, 256]</entry>
+        </row>
+        <row>
+          <entry>64</entry>
+          <entry>[320, 384, 448, 512]</entry>
+        </row>
+        <row>
+          <entry>128</entry>
+          <entry>[640, 768, 896, 1024]</entry>
+        </row>
+        <row>
+          <entry>256</entry>
+          <entry>[1280, 1536, 1792, 2048]</entry>
+        </row>
+        <row>
+          <entry>512</entry>
+          <entry>[2560, 3072, 3584, 4096]</entry>
+        </row>
+        <row>
+          <entry>1 KiB</entry>
+          <entry>[5 KiB, 6 KiB, 7 KiB, 8 KiB]</entry>
+        </row>
+        <row>
+          <entry>2 KiB</entry>
+          <entry>[10 KiB, 12 KiB, 14 KiB]</entry>
+        </row>
+        <row>
+          <entry morerows="15">Large</entry>
+          <entry>2 KiB</entry>
+          <entry>[16 KiB]</entry>
+        </row>
+        <row>
+          <entry>4 KiB</entry>
+          <entry>[20 KiB, 24 KiB, 28 KiB, 32 KiB]</entry>
+        </row>
+        <row>
+          <entry>8 KiB</entry>
+          <entry>[40 KiB, 48 KiB, 54 KiB, 64 KiB]</entry>
+        </row>
+        <row>
+          <entry>16 KiB</entry>
+          <entry>[80 KiB, 96 KiB, 112 KiB, 128 KiB]</entry>
+        </row>
+        <row>
+          <entry>32 KiB</entry>
+          <entry>[160 KiB, 192 KiB, 224 KiB, 256 KiB]</entry>
+        </row>
+        <row>
+          <entry>64 KiB</entry>
+          <entry>[320 KiB, 384 KiB, 448 KiB, 512 KiB]</entry>
+        </row>
+        <row>
+          <entry>128 KiB</entry>
+          <entry>[640 KiB, 768 KiB, 896 KiB, 1 MiB]</entry>
+        </row>
+        <row>
+          <entry>256 KiB</entry>
+          <entry>[1280 KiB, 1536 KiB, 1792 KiB, 2 MiB]</entry>
+        </row>
+        <row>
+          <entry>512 KiB</entry>
+          <entry>[2560 KiB, 3 MiB, 3584 KiB, 4 MiB]</entry>
+        </row>
+        <row>
+          <entry>1 MiB</entry>
+          <entry>[5 MiB, 6 MiB, 7 MiB, 8 MiB]</entry>
+        </row>
+        <row>
+          <entry>2 MiB</entry>
+          <entry>[10 MiB, 12 MiB, 14 MiB, 16 MiB]</entry>
+        </row>
+        <row>
+          <entry>4 MiB</entry>
+          <entry>[20 MiB, 24 MiB, 28 MiB, 32 MiB]</entry>
+        </row>
+        <row>
+          <entry>8 MiB</entry>
+          <entry>[40 MiB, 48 MiB, 56 MiB, 64 MiB]</entry>
+        </row>
+        <row>
+          <entry>...</entry>
+          <entry>...</entry>
+        </row>
+        <row>
+          <entry>512 PiB</entry>
+          <entry>[2560 PiB, 3 EiB, 3584 PiB, 4 EiB]</entry>
+        </row>
+        <row>
+          <entry>1 EiB</entry>
+          <entry>[5 EiB, 6 EiB, 7 EiB]</entry>
+        </row>
+      </tbody>
+      </tgroup>
+    </table>
+  </refsect1>
+  <refsect1 id="mallctl_namespace">
+    <title>MALLCTL NAMESPACE</title>
+    <para>The following names are defined in the namespace accessible via the
+    <function>mallctl*()</function> functions.  Value types are specified in
+    parentheses, their readable/writable statuses are encoded as
+    <literal>rw</literal>, <literal>r-</literal>, <literal>-w</literal>, or
+    <literal>--</literal>, and required build configuration flags follow, if
+    any.  A name element encoded as <literal>&lt;i&gt;</literal> or
+    <literal>&lt;j&gt;</literal> indicates an integer component, where the
+    integer varies from 0 to some upper value that must be determined via
+    introspection.  In the case of <mallctl>stats.arenas.&lt;i&gt;.*</mallctl>
+    and <mallctl>arena.&lt;i&gt;.{initialized,purge,decay,dss}</mallctl>,
+    <literal>&lt;i&gt;</literal> equal to
+    <constant>MALLCTL_ARENAS_ALL</constant> can be used to operate on all arenas
+    or access the summation of statistics from all arenas; similarly
+    <literal>&lt;i&gt;</literal> equal to
+    <constant>MALLCTL_ARENAS_DESTROYED</constant> can be used to access the
+    summation of statistics from all destroyed arenas.  These constants can be
+    utilized either via <function>mallctlnametomib()</function> followed by
+    <function>mallctlbymib()</function>, or via code such as the following:
+    <programlisting language="C"><![CDATA[
+#define STRINGIFY_HELPER(x) #x
+#define STRINGIFY(x) STRINGIFY_HELPER(x)
+
+mallctl("arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".decay",
+    NULL, NULL, NULL, 0);]]></programlisting>
+    Take special note of the <link
+    linkend="epoch"><mallctl>epoch</mallctl></link> mallctl, which controls
+    refreshing of cached dynamic statistics.</para>
+
+    <variablelist>
+      <varlistentry id="version">
+        <term>
+          <mallctl>version</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Return the jemalloc version string.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="epoch">
+        <term>
+          <mallctl>epoch</mallctl>
+          (<type>uint64_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>If a value is passed in, refresh the data from which
+        the <function>mallctl*()</function> functions report values,
+        and increment the epoch.  Return the current epoch.  This is useful for
+        detecting whether another thread caused a refresh.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="background_thread">
+        <term>
+          <mallctl>background_thread</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Enable/disable internal background worker threads.  When
+        set to true, background threads are created on demand (the number of
+        background threads will be no more than the number of CPUs or active
+        arenas).  Threads run periodically, and handle <link
+        linkend="arena.i.decay">purging</link> asynchronously.  When switching
+        off, background threads are terminated synchronously.  Note that after
+        <citerefentry><refentrytitle>fork</refentrytitle><manvolnum>2</manvolnum></citerefentry>
+        function, the state in the child process will be disabled regardless
+        the state in parent process. See <link
+        linkend="stats.background_thread.num_threads"><mallctl>stats.background_thread</mallctl></link>
+        for related stats.  <link
+        linkend="opt.background_thread"><mallctl>opt.background_thread</mallctl></link>
+        can be used to set the default option.  This option is only available on
+        selected pthread-based platforms.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="max_background_threads">
+        <term>
+          <mallctl>max_background_threads</mallctl>
+          (<type>size_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Maximum number of background worker threads that will
+        be created.  This value is capped at <link
+        linkend="opt.max_background_threads"><mallctl>opt.max_background_threads</mallctl></link> at
+        startup.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.cache_oblivious">
+        <term>
+          <mallctl>config.cache_oblivious</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-cache-oblivious</option> was specified
+        during build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.debug">
+        <term>
+          <mallctl>config.debug</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-debug</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.fill">
+        <term>
+          <mallctl>config.fill</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-fill</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.lazy_lock">
+        <term>
+          <mallctl>config.lazy_lock</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-lazy-lock</option> was specified
+        during build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.malloc_conf">
+        <term>
+          <mallctl>config.malloc_conf</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Embedded configure-time-specified run-time options
+        string, empty unless <option>--with-malloc-conf</option> was specified
+        during build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.prof">
+        <term>
+          <mallctl>config.prof</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-prof</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.prof_libgcc">
+        <term>
+          <mallctl>config.prof_libgcc</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--disable-prof-libgcc</option> was not
+        specified during build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.prof_libunwind">
+        <term>
+          <mallctl>config.prof_libunwind</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-prof-libunwind</option> was specified
+        during build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.stats">
+        <term>
+          <mallctl>config.stats</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-stats</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+
+      <varlistentry id="config.utrace">
+        <term>
+          <mallctl>config.utrace</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-utrace</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="config.xmalloc">
+        <term>
+          <mallctl>config.xmalloc</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para><option>--enable-xmalloc</option> was specified during
+        build configuration.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.abort">
+        <term>
+          <mallctl>opt.abort</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Abort-on-warning enabled/disabled.  If true, most
+        warnings are fatal.  Note that runtime option warnings are not included
+        (see <link
+        linkend="opt.abort_conf"><mallctl>opt.abort_conf</mallctl></link> for
+        that). The process will call
+        <citerefentry><refentrytitle>abort</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> in these cases.  This option is
+        disabled by default unless <option>--enable-debug</option> is
+        specified during configuration, in which case it is enabled by default.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.abort_conf">
+        <term>
+          <mallctl>opt.abort_conf</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Abort-on-invalid-configuration enabled/disabled.  If
+        true, invalid runtime options are fatal.  The process will call
+        <citerefentry><refentrytitle>abort</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> in these cases.  This option is
+        disabled by default unless <option>--enable-debug</option> is
+        specified during configuration, in which case it is enabled by default.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.metadata_thp">
+        <term>
+          <mallctl>opt.metadata_thp</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Controls whether to allow jemalloc to use transparent
+        huge page (THP) for internal metadata (see <link
+        linkend="stats.metadata">stats.metadata</link>).  <quote>always</quote>
+        allows such usage.  <quote>auto</quote> uses no THP initially, but may
+        begin to do so when metadata usage reaches certain level.  The default
+        is <quote>disabled</quote>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.retain">
+        <term>
+          <mallctl>opt.retain</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>If true, retain unused virtual memory for later reuse
+        rather than discarding it by calling
+        <citerefentry><refentrytitle>munmap</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> or equivalent (see <link
+        linkend="stats.retained">stats.retained</link> for related details).
+        This option is disabled by default unless discarding virtual memory is
+        known to trigger
+        platform-specific performance problems, e.g. for [64-bit] Linux, which
+        has a quirk in its virtual memory allocation algorithm that causes
+        semi-permanent VM map holes under normal jemalloc operation.  Although
+        <citerefentry><refentrytitle>munmap</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> causes issues on 32-bit Linux as
+        well, retaining virtual memory for 32-bit Linux is disabled by default
+        due to the practical possibility of address space exhaustion.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.dss">
+        <term>
+          <mallctl>opt.dss</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>dss (<citerefentry><refentrytitle>sbrk</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry>) allocation precedence as
+        related to <citerefentry><refentrytitle>mmap</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> allocation.  The following
+        settings are supported if
+        <citerefentry><refentrytitle>sbrk</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> is supported by the operating
+        system: <quote>disabled</quote>, <quote>primary</quote>, and
+        <quote>secondary</quote>; otherwise only <quote>disabled</quote> is
+        supported.  The default is <quote>secondary</quote> if
+        <citerefentry><refentrytitle>sbrk</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> is supported by the operating
+        system; <quote>disabled</quote> otherwise.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.narenas">
+        <term>
+          <mallctl>opt.narenas</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum number of arenas to use for automatic
+        multiplexing of threads and arenas.  The default is four times the
+        number of CPUs, or one if there is a single CPU.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.percpu_arena">
+        <term>
+          <mallctl>opt.percpu_arena</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Per CPU arena mode.  Use the <quote>percpu</quote>
+        setting to enable this feature, which uses number of CPUs to determine
+        number of arenas, and bind threads to arenas dynamically based on the
+        CPU the thread runs on currently.  <quote>phycpu</quote> setting uses
+        one arena per physical CPU, which means the two hyper threads on the
+        same CPU share one arena.  Note that no runtime checking regarding the
+        availability of hyper threading is done at the moment.  When set to
+        <quote>disabled</quote>, narenas and thread to arena association will
+        not be impacted by this option.  The default is <quote>disabled</quote>.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.background_thread">
+        <term>
+          <mallctl>opt.background_thread</mallctl>
+          (<type>const bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Internal background worker threads enabled/disabled.
+        Because of potential circular dependencies, enabling background thread
+        using this option may cause crash or deadlock during initialization. For
+        a reliable way to use this feature, see <link
+        linkend="background_thread">background_thread</link> for dynamic control
+        options and details.  This option is disabled by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.max_background_threads">
+        <term>
+          <mallctl>opt.max_background_threads</mallctl>
+          (<type>const size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum number of background threads that will be created
+        if <link linkend="background_thread">background_thread</link> is set.
+        Defaults to number of cpus.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.dirty_decay_ms">
+        <term>
+          <mallctl>opt.dirty_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Approximate time in milliseconds from the creation of a
+        set of unused dirty pages until an equivalent set of unused dirty pages
+        is purged (i.e. converted to muzzy via e.g.
+        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>
+        if supported by the operating system, or converted to clean otherwise)
+        and/or reused.  Dirty pages are defined as previously having been
+        potentially written to by the application, and therefore consuming
+        physical memory, yet having no current use.  The pages are incrementally
+        purged according to a sigmoidal decay curve that starts and ends with
+        zero purge rate.  A decay time of 0 causes all unused dirty pages to be
+        purged immediately upon creation.  A decay time of -1 disables purging.
+        The default decay time is 10 seconds.  See <link
+        linkend="arenas.dirty_decay_ms"><mallctl>arenas.dirty_decay_ms</mallctl></link>
+        and <link
+        linkend="arena.i.dirty_decay_ms"><mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl></link>
+        for related dynamic control options.  See <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
+        for a description of muzzy pages.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.muzzy_decay_ms">
+        <term>
+          <mallctl>opt.muzzy_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Approximate time in milliseconds from the creation of a
+        set of unused muzzy pages until an equivalent set of unused muzzy pages
+        is purged (i.e. converted to clean) and/or reused.  Muzzy pages are
+        defined as previously having been unused dirty pages that were
+        subsequently purged in a manner that left them subject to the
+        reclamation whims of the operating system (e.g.
+        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>),
+        and therefore in an indeterminate state.  The pages are incrementally
+        purged according to a sigmoidal decay curve that starts and ends with
+        zero purge rate.  A decay time of 0 causes all unused muzzy pages to be
+        purged immediately upon creation.  A decay time of -1 disables purging.
+        The default decay time is 10 seconds.  See <link
+        linkend="arenas.muzzy_decay_ms"><mallctl>arenas.muzzy_decay_ms</mallctl></link>
+        and <link
+        linkend="arena.i.muzzy_decay_ms"><mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl></link>
+        for related dynamic control options.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.lg_extent_max_active_fit">
+        <term>
+          <mallctl>opt.lg_extent_max_active_fit</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>When reusing dirty extents, this determines the (log
+        base 2 of the) maximum ratio between the size of the active extent
+        selected (to split off from) and the size of the requested allocation.
+        This prevents the splitting of large active extents for smaller
+        allocations, which can reduce fragmentation over the long run
+        (especially for non-active extents).  Lower value may reduce
+        fragmentation, at the cost of extra active extents.  The default value
+        is 6, which gives a maximum ratio of 64 (2^6).</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.stats_print">
+        <term>
+          <mallctl>opt.stats_print</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Enable/disable statistics printing at exit.  If
+        enabled, the <function>malloc_stats_print()</function>
+        function is called at program exit via an
+        <citerefentry><refentrytitle>atexit</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> function.  <link
+        linkend="opt.stats_print_opts"><mallctl>opt.stats_print_opts</mallctl></link>
+        can be combined to specify output options. If
+        <option>--enable-stats</option> is specified during configuration, this
+        has the potential to cause deadlock for a multi-threaded process that
+        exits while one or more threads are executing in the memory allocation
+        functions.  Furthermore, <function>atexit()</function> may
+        allocate memory during application initialization and then deadlock
+        internally when jemalloc in turn calls
+        <function>atexit()</function>, so this option is not
+        universally usable (though the application can register its own
+        <function>atexit()</function> function with equivalent
+        functionality).  Therefore, this option should only be used with care;
+        it is primarily intended as a performance tuning aid during application
+        development.  This option is disabled by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.stats_print_opts">
+        <term>
+          <mallctl>opt.stats_print_opts</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Options (the <parameter>opts</parameter> string) to pass
+        to the <function>malloc_stats_print()</function> at exit (enabled
+        through <link
+        linkend="opt.stats_print"><mallctl>opt.stats_print</mallctl></link>). See
+        available options in <link
+        linkend="malloc_stats_print_opts"><function>malloc_stats_print()</function></link>.
+        Has no effect unless <link
+        linkend="opt.stats_print"><mallctl>opt.stats_print</mallctl></link> is
+        enabled.  The default is <quote></quote>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.junk">
+        <term>
+          <mallctl>opt.junk</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+          [<option>--enable-fill</option>]
+        </term>
+        <listitem><para>Junk filling.  If set to <quote>alloc</quote>, each byte
+        of uninitialized allocated memory will be initialized to
+        <literal>0xa5</literal>.  If set to <quote>free</quote>, all deallocated
+        memory will be initialized to <literal>0x5a</literal>.  If set to
+        <quote>true</quote>, both allocated and deallocated memory will be
+        initialized, and if set to <quote>false</quote>, junk filling be
+        disabled entirely.  This is intended for debugging and will impact
+        performance negatively.  This option is <quote>false</quote> by default
+        unless <option>--enable-debug</option> is specified during
+        configuration, in which case it is <quote>true</quote> by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.zero">
+        <term>
+          <mallctl>opt.zero</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-fill</option>]
+        </term>
+        <listitem><para>Zero filling enabled/disabled.  If enabled, each byte
+        of uninitialized allocated memory will be initialized to 0.  Note that
+        this initialization only happens once for each byte, so
+        <function>realloc()</function> and
+        <function>rallocx()</function> calls do not zero memory that
+        was previously allocated.  This is intended for debugging and will
+        impact performance negatively.  This option is disabled by default.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.utrace">
+        <term>
+          <mallctl>opt.utrace</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-utrace</option>]
+        </term>
+        <listitem><para>Allocation tracing based on
+        <citerefentry><refentrytitle>utrace</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> enabled/disabled.  This option
+        is disabled by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.xmalloc">
+        <term>
+          <mallctl>opt.xmalloc</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-xmalloc</option>]
+        </term>
+        <listitem><para>Abort-on-out-of-memory enabled/disabled.  If enabled,
+        rather than returning failure for any allocation function, display a
+        diagnostic message on <constant>STDERR_FILENO</constant> and cause the
+        program to drop core (using
+        <citerefentry><refentrytitle>abort</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry>).  If an application is
+        designed to depend on this behavior, set the option at compile time by
+        including the following in the source code:
+        <programlisting language="C"><![CDATA[
+malloc_conf = "xmalloc:true";]]></programlisting>
+        This option is disabled by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.tcache">
+        <term>
+          <mallctl>opt.tcache</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Thread-specific caching (tcache) enabled/disabled.  When
+        there are multiple threads, each thread uses a tcache for objects up to
+        a certain size.  Thread-specific caching allows many allocations to be
+        satisfied without performing any thread synchronization, at the cost of
+        increased memory use.  See the <link
+        linkend="opt.lg_tcache_max"><mallctl>opt.lg_tcache_max</mallctl></link>
+        option for related tuning information.  This option is enabled by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.lg_tcache_max">
+        <term>
+          <mallctl>opt.lg_tcache_max</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum size class (log base 2) to cache in the
+        thread-specific cache (tcache).  At a minimum, all small size classes
+        are cached, and at a maximum all large size classes are cached.  The
+        default maximum is 32 KiB (2^15).</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.thp">
+        <term>
+          <mallctl>opt.thp</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Transparent hugepage (THP) mode. Settings "always",
+        "never" and "default" are available if THP is supported by the operating
+        system.  The "always" setting enables transparent hugepage for all user
+        memory mappings with
+        <parameter><constant>MADV_HUGEPAGE</constant></parameter>; "never"
+        ensures no transparent hugepage with
+        <parameter><constant>MADV_NOHUGEPAGE</constant></parameter>; the default
+        setting "default" makes no changes.  Note that: this option does not
+        affect THP for jemalloc internal metadata (see <link
+        linkend="opt.metadata_thp"><mallctl>opt.metadata_thp</mallctl></link>);
+        in addition, for arenas with customized <link
+        linkend="arena.i.extent_hooks"><mallctl>extent_hooks</mallctl></link>,
+        this option is bypassed as it is implemented as part of the default
+        extent hooks.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof">
+        <term>
+          <mallctl>opt.prof</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Memory profiling enabled/disabled.  If enabled, profile
+        memory allocation activity.  See the <link
+        linkend="opt.prof_active"><mallctl>opt.prof_active</mallctl></link>
+        option for on-the-fly activation/deactivation.  See the <link
+        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>
+        option for probabilistic sampling control.  See the <link
+        linkend="opt.prof_accum"><mallctl>opt.prof_accum</mallctl></link>
+        option for control of cumulative sample reporting.  See the <link
+        linkend="opt.lg_prof_interval"><mallctl>opt.lg_prof_interval</mallctl></link>
+        option for information on interval-triggered profile dumping, the <link
+        linkend="opt.prof_gdump"><mallctl>opt.prof_gdump</mallctl></link>
+        option for information on high-water-triggered profile dumping, and the
+        <link linkend="opt.prof_final"><mallctl>opt.prof_final</mallctl></link>
+        option for final profile dumping.  Profile output is compatible with
+        the <command>jeprof</command> command, which is based on the
+        <command>pprof</command> that is developed as part of the <ulink
+        url="http://code.google.com/p/gperftools/">gperftools
+        package</ulink>.  See <link linkend="heap_profile_format">HEAP PROFILE
+        FORMAT</link> for heap profile format documentation.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_prefix">
+        <term>
+          <mallctl>opt.prof_prefix</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Filename prefix for profile dumps.  If the prefix is
+        set to the empty string, no automatic dumps will occur; this is
+        primarily useful for disabling the automatic final heap dump (which
+        also disables leak reporting, if enabled).  The default prefix is
+        <filename>jeprof</filename>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_active">
+        <term>
+          <mallctl>opt.prof_active</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Profiling activated/deactivated.  This is a secondary
+        control mechanism that makes it possible to start the application with
+        profiling enabled (see the <link
+        linkend="opt.prof"><mallctl>opt.prof</mallctl></link> option) but
+        inactive, then toggle profiling at any time during program execution
+        with the <link
+        linkend="prof.active"><mallctl>prof.active</mallctl></link> mallctl.
+        This option is enabled by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_thread_active_init">
+        <term>
+          <mallctl>opt.prof_thread_active_init</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Initial setting for <link
+        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
+        in newly created threads.  The initial setting for newly created threads
+        can also be changed during execution via the <link
+        linkend="prof.thread_active_init"><mallctl>prof.thread_active_init</mallctl></link>
+        mallctl.  This option is enabled by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.lg_prof_sample">
+        <term>
+          <mallctl>opt.lg_prof_sample</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Average interval (log base 2) between allocation
+        samples, as measured in bytes of allocation activity.  Increasing the
+        sampling interval decreases profile fidelity, but also decreases the
+        computational overhead.  The default sample interval is 512 KiB (2^19
+        B).</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_accum">
+        <term>
+          <mallctl>opt.prof_accum</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Reporting of cumulative object/byte counts in profile
+        dumps enabled/disabled.  If this option is enabled, every unique
+        backtrace must be stored for the duration of execution.  Depending on
+        the application, this can impose a large memory overhead, and the
+        cumulative counts are not always of interest.  This option is disabled
+        by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.lg_prof_interval">
+        <term>
+          <mallctl>opt.lg_prof_interval</mallctl>
+          (<type>ssize_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Average interval (log base 2) between memory profile
+        dumps, as measured in bytes of allocation activity.  The actual
+        interval between dumps may be sporadic because decentralized allocation
+        counters are used to avoid synchronization bottlenecks.  Profiles are
+        dumped to files named according to the pattern
+        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.i&lt;iseq&gt;.heap</filename>,
+        where <literal>&lt;prefix&gt;</literal> is controlled by the
+        <link
+        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
+        option.  By default, interval-triggered profile dumping is disabled
+        (encoded as -1).
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_gdump">
+        <term>
+          <mallctl>opt.prof_gdump</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Set the initial state of <link
+        linkend="prof.gdump"><mallctl>prof.gdump</mallctl></link>, which when
+        enabled triggers a memory profile dump every time the total virtual
+        memory exceeds the previous maximum.  This option is disabled by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_final">
+        <term>
+          <mallctl>opt.prof_final</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Use an
+        <citerefentry><refentrytitle>atexit</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> function to dump final memory
+        usage to a file named according to the pattern
+        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.f.heap</filename>,
+        where <literal>&lt;prefix&gt;</literal> is controlled by the <link
+        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
+        option.  Note that <function>atexit()</function> may allocate
+        memory during application initialization and then deadlock internally
+        when jemalloc in turn calls <function>atexit()</function>, so
+        this option is not universally usable (though the application can
+        register its own <function>atexit()</function> function with
+        equivalent functionality).  This option is disabled by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="opt.prof_leak">
+        <term>
+          <mallctl>opt.prof_leak</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Leak reporting enabled/disabled.  If enabled, use an
+        <citerefentry><refentrytitle>atexit</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> function to report memory leaks
+        detected by allocation sampling.  See the
+        <link linkend="opt.prof"><mallctl>opt.prof</mallctl></link> option for
+        information on analyzing heap profile output.  This option is disabled
+        by default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.arena">
+        <term>
+          <mallctl>thread.arena</mallctl>
+          (<type>unsigned</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Get or set the arena associated with the calling
+        thread.  If the specified arena was not initialized beforehand (see the
+        <link
+        linkend="arena.i.initialized"><mallctl>arena.i.initialized</mallctl></link>
+        mallctl), it will be automatically initialized as a side effect of
+        calling this interface.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.allocated">
+        <term>
+          <mallctl>thread.allocated</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Get the total number of bytes ever allocated by the
+        calling thread.  This counter has the potential to wrap around; it is
+        up to the application to appropriately interpret the counter in such
+        cases.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.allocatedp">
+        <term>
+          <mallctl>thread.allocatedp</mallctl>
+          (<type>uint64_t *</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Get a pointer to the the value that is returned by the
+        <link
+        linkend="thread.allocated"><mallctl>thread.allocated</mallctl></link>
+        mallctl.  This is useful for avoiding the overhead of repeated
+        <function>mallctl*()</function> calls.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.deallocated">
+        <term>
+          <mallctl>thread.deallocated</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Get the total number of bytes ever deallocated by the
+        calling thread.  This counter has the potential to wrap around; it is
+        up to the application to appropriately interpret the counter in such
+        cases.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.deallocatedp">
+        <term>
+          <mallctl>thread.deallocatedp</mallctl>
+          (<type>uint64_t *</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Get a pointer to the the value that is returned by the
+        <link
+        linkend="thread.deallocated"><mallctl>thread.deallocated</mallctl></link>
+        mallctl.  This is useful for avoiding the overhead of repeated
+        <function>mallctl*()</function> calls.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.tcache.enabled">
+        <term>
+          <mallctl>thread.tcache.enabled</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Enable/disable calling thread's tcache.  The tcache is
+        implicitly flushed as a side effect of becoming
+        disabled (see <link
+        linkend="thread.tcache.flush"><mallctl>thread.tcache.flush</mallctl></link>).
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.tcache.flush">
+        <term>
+          <mallctl>thread.tcache.flush</mallctl>
+          (<type>void</type>)
+          <literal>--</literal>
+        </term>
+        <listitem><para>Flush calling thread's thread-specific cache (tcache).
+        This interface releases all cached objects and internal data structures
+        associated with the calling thread's tcache.  Ordinarily, this interface
+        need not be called, since automatic periodic incremental garbage
+        collection occurs, and the thread cache is automatically discarded when
+        a thread exits.  However, garbage collection is triggered by allocation
+        activity, so it is possible for a thread that stops
+        allocating/deallocating to retain its cache indefinitely, in which case
+        the developer may find manual flushing useful.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.prof.name">
+        <term>
+          <mallctl>thread.prof.name</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal> or
+          <literal>-w</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Get/set the descriptive name associated with the calling
+        thread in memory profile dumps.  An internal copy of the name string is
+        created, so the input string need not be maintained after this interface
+        completes execution.  The output string of this interface should be
+        copied for non-ephemeral uses, because multiple implementation details
+        can cause asynchronous string deallocation.  Furthermore, each
+        invocation of this interface can only read or write; simultaneous
+        read/write is not supported due to string lifetime limitations.  The
+        name string must be nil-terminated and comprised only of characters in
+        the sets recognized
+        by <citerefentry><refentrytitle>isgraph</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry> and
+        <citerefentry><refentrytitle>isblank</refentrytitle>
+        <manvolnum>3</manvolnum></citerefentry>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="thread.prof.active">
+        <term>
+          <mallctl>thread.prof.active</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Control whether sampling is currently active for the
+        calling thread.  This is an activation mechanism in addition to <link
+        linkend="prof.active"><mallctl>prof.active</mallctl></link>; both must
+        be active for the calling thread to sample.  This flag is enabled by
+        default.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="tcache.create">
+        <term>
+          <mallctl>tcache.create</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Create an explicit thread-specific cache (tcache) and
+        return an identifier that can be passed to the <link
+        linkend="MALLOCX_TCACHE"><constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant></link>
+        macro to explicitly use the specified cache rather than the
+        automatically managed one that is used by default.  Each explicit cache
+        can be used by only one thread at a time; the application must assure
+        that this constraint holds.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="tcache.flush">
+        <term>
+          <mallctl>tcache.flush</mallctl>
+          (<type>unsigned</type>)
+          <literal>-w</literal>
+        </term>
+        <listitem><para>Flush the specified thread-specific cache (tcache).  The
+        same considerations apply to this interface as to <link
+        linkend="thread.tcache.flush"><mallctl>thread.tcache.flush</mallctl></link>,
+        except that the tcache will never be automatically discarded.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="tcache.destroy">
+        <term>
+          <mallctl>tcache.destroy</mallctl>
+          (<type>unsigned</type>)
+          <literal>-w</literal>
+        </term>
+        <listitem><para>Flush the specified thread-specific cache (tcache) and
+        make the identifier available for use during a future tcache creation.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.initialized">
+        <term>
+          <mallctl>arena.&lt;i&gt;.initialized</mallctl>
+          (<type>bool</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Get whether the specified arena's statistics are
+        initialized (i.e. the arena was initialized prior to the current epoch).
+        This interface can also be nominally used to query whether the merged
+        statistics corresponding to <constant>MALLCTL_ARENAS_ALL</constant> are
+        initialized (always true).</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.decay">
+        <term>
+          <mallctl>arena.&lt;i&gt;.decay</mallctl>
+          (<type>void</type>)
+          <literal>--</literal>
+        </term>
+        <listitem><para>Trigger decay-based purging of unused dirty/muzzy pages
+        for arena &lt;i&gt;, or for all arenas if &lt;i&gt; equals
+        <constant>MALLCTL_ARENAS_ALL</constant>.  The proportion of unused
+        dirty/muzzy pages to be purged depends on the current time; see <link
+        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
+        and <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzy_decay_ms</mallctl></link>
+        for details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.purge">
+        <term>
+          <mallctl>arena.&lt;i&gt;.purge</mallctl>
+          (<type>void</type>)
+          <literal>--</literal>
+        </term>
+        <listitem><para>Purge all unused dirty pages for arena &lt;i&gt;, or for
+        all arenas if &lt;i&gt; equals <constant>MALLCTL_ARENAS_ALL</constant>.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.reset">
+        <term>
+          <mallctl>arena.&lt;i&gt;.reset</mallctl>
+          (<type>void</type>)
+          <literal>--</literal>
+        </term>
+        <listitem><para>Discard all of the arena's extant allocations.  This
+        interface can only be used with arenas explicitly created via <link
+        linkend="arenas.create"><mallctl>arenas.create</mallctl></link>.  None
+        of the arena's discarded/cached allocations may accessed afterward.  As
+        part of this requirement, all thread caches which were used to
+        allocate/deallocate in conjunction with the arena must be flushed
+        beforehand.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.destroy">
+        <term>
+          <mallctl>arena.&lt;i&gt;.destroy</mallctl>
+          (<type>void</type>)
+          <literal>--</literal>
+        </term>
+        <listitem><para>Destroy the arena.  Discard all of the arena's extant
+        allocations using the same mechanism as for <link
+        linkend="arena.i.reset"><mallctl>arena.&lt;i&gt;.reset</mallctl></link>
+        (with all the same constraints and side effects), merge the arena stats
+        into those accessible at arena index
+        <constant>MALLCTL_ARENAS_DESTROYED</constant>, and then completely
+        discard all metadata associated with the arena.  Future calls to <link
+        linkend="arenas.create"><mallctl>arenas.create</mallctl></link> may
+        recycle the arena index.  Destruction will fail if any threads are
+        currently associated with the arena as a result of calls to <link
+        linkend="thread.arena"><mallctl>thread.arena</mallctl></link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.dss">
+        <term>
+          <mallctl>arena.&lt;i&gt;.dss</mallctl>
+          (<type>const char *</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Set the precedence of dss allocation as related to mmap
+        allocation for arena &lt;i&gt;, or for all arenas if &lt;i&gt; equals
+        <constant>MALLCTL_ARENAS_ALL</constant>.  See <link
+        linkend="opt.dss"><mallctl>opt.dss</mallctl></link> for supported
+        settings.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.dirty_decay_ms">
+        <term>
+          <mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Current per-arena approximate time in milliseconds from
+        the creation of a set of unused dirty pages until an equivalent set of
+        unused dirty pages is purged and/or reused.  Each time this interface is
+        set, all currently unused dirty pages are considered to have fully
+        decayed, which causes immediate purging of all unused dirty pages unless
+        the decay time is set to -1 (i.e. purging disabled).  See <link
+        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
+        for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.muzzy_decay_ms">
+        <term>
+          <mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Current per-arena approximate time in milliseconds from
+        the creation of a set of unused muzzy pages until an equivalent set of
+        unused muzzy pages is purged and/or reused.  Each time this interface is
+        set, all currently unused muzzy pages are considered to have fully
+        decayed, which causes immediate purging of all unused muzzy pages unless
+        the decay time is set to -1 (i.e. purging disabled).  See <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
+        for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.retain_grow_limit">
+        <term>
+          <mallctl>arena.&lt;i&gt;.retain_grow_limit</mallctl>
+          (<type>size_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Maximum size to grow retained region (only relevant when
+        <link linkend="opt.retain"><mallctl>opt.retain</mallctl></link> is
+        enabled).  This controls the maximum increment to expand virtual memory,
+        or allocation through <link
+        linkend="arena.i.extent_hooks"><mallctl>arena.&lt;i&gt;extent_hooks</mallctl></link>.
+        In particular, if customized extent hooks reserve physical memory
+        (e.g. 1G huge pages), this is useful to control the allocation hook's
+        input size.  The default is no limit.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arena.i.extent_hooks">
+        <term>
+          <mallctl>arena.&lt;i&gt;.extent_hooks</mallctl>
+          (<type>extent_hooks_t *</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Get or set the extent management hook functions for
+        arena &lt;i&gt;.  The functions must be capable of operating on all
+        extant extents associated with arena &lt;i&gt;, usually by passing
+        unknown extents to the replaced functions.  In practice, it is feasible
+        to control allocation for arenas explicitly created via <link
+        linkend="arenas.create"><mallctl>arenas.create</mallctl></link> such
+        that all extents originate from an application-supplied extent allocator
+        (by specifying the custom extent hook functions during arena creation),
+        but the automatically created arenas will have already created extents
+        prior to the application having an opportunity to take over extent
+        allocation.</para>
+
+        <programlisting language="C"><![CDATA[
+typedef extent_hooks_s extent_hooks_t;
+struct extent_hooks_s {
+	extent_alloc_t		*alloc;
+	extent_dalloc_t		*dalloc;
+	extent_destroy_t	*destroy;
+	extent_commit_t		*commit;
+	extent_decommit_t	*decommit;
+	extent_purge_t		*purge_lazy;
+	extent_purge_t		*purge_forced;
+	extent_split_t		*split;
+	extent_merge_t		*merge;
+};]]></programlisting>
+        <para>The <type>extent_hooks_t</type> structure comprises function
+        pointers which are described individually below.  jemalloc uses these
+        functions to manage extent lifetime, which starts off with allocation of
+        mapped committed memory, in the simplest case followed by deallocation.
+        However, there are performance and platform reasons to retain extents
+        for later reuse.  Cleanup attempts cascade from deallocation to decommit
+        to forced purging to lazy purging, which gives the extent management
+        functions opportunities to reject the most permanent cleanup operations
+        in favor of less permanent (and often less costly) operations.  All
+        operations except allocation can be universally opted out of by setting
+        the hook pointers to <constant>NULL</constant>, or selectively opted out
+        of by returning failure.  Note that once the extent hook is set, the
+        structure is accessed directly by the associated arenas, so it must
+        remain valid for the entire lifetime of the arenas.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef void *<function>(extent_alloc_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>new_addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>alignment</parameter></paramdef>
+          <paramdef>bool *<parameter>zero</parameter></paramdef>
+          <paramdef>bool *<parameter>commit</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent allocation function conforms to the
+        <type>extent_alloc_t</type> type and upon success returns a pointer to
+        <parameter>size</parameter> bytes of mapped memory on behalf of arena
+        <parameter>arena_ind</parameter> such that the extent's base address is
+        a multiple of <parameter>alignment</parameter>, as well as setting
+        <parameter>*zero</parameter> to indicate whether the extent is zeroed
+        and <parameter>*commit</parameter> to indicate whether the extent is
+        committed.  Upon error the function returns <constant>NULL</constant>
+        and leaves <parameter>*zero</parameter> and
+        <parameter>*commit</parameter> unmodified.  The
+        <parameter>size</parameter> parameter is always a multiple of the page
+        size.  The <parameter>alignment</parameter> parameter is always a power
+        of two at least as large as the page size.  Zeroing is mandatory if
+        <parameter>*zero</parameter> is true upon function entry.  Committing is
+        mandatory if <parameter>*commit</parameter> is true upon function entry.
+        If <parameter>new_addr</parameter> is not <constant>NULL</constant>, the
+        returned pointer must be <parameter>new_addr</parameter> on success or
+        <constant>NULL</constant> on error.  Committed memory may be committed
+        in absolute terms as on a system that does not overcommit, or in
+        implicit terms as on a system that overcommits and satisfies physical
+        memory needs on demand via soft page faults.  Note that replacing the
+        default extent allocation function makes the arena's <link
+        linkend="arena.i.dss"><mallctl>arena.&lt;i&gt;.dss</mallctl></link>
+        setting irrelevant.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_dalloc_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>bool <parameter>committed</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>
+        An extent deallocation function conforms to the
+        <type>extent_dalloc_t</type> type and deallocates an extent at given
+        <parameter>addr</parameter> and <parameter>size</parameter> with
+        <parameter>committed</parameter>/decommited memory as indicated, on
+        behalf of arena <parameter>arena_ind</parameter>, returning false upon
+        success.  If the function returns true, this indicates opt-out from
+        deallocation; the virtual memory mapping associated with the extent
+        remains mapped, in the same commit state, and available for future use,
+        in which case it will be automatically retained for later reuse.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef void <function>(extent_destroy_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>bool <parameter>committed</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>
+        An extent destruction function conforms to the
+        <type>extent_destroy_t</type> type and unconditionally destroys an
+        extent at given <parameter>addr</parameter> and
+        <parameter>size</parameter> with
+        <parameter>committed</parameter>/decommited memory as indicated, on
+        behalf of arena <parameter>arena_ind</parameter>.  This function may be
+        called to destroy retained extents during arena destruction (see <link
+        linkend="arena.i.destroy"><mallctl>arena.&lt;i&gt;.destroy</mallctl></link>).</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_commit_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>offset</parameter></paramdef>
+          <paramdef>size_t <parameter>length</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent commit function conforms to the
+        <type>extent_commit_t</type> type and commits zeroed physical memory to
+        back pages within an extent at given <parameter>addr</parameter> and
+        <parameter>size</parameter> at <parameter>offset</parameter> bytes,
+        extending for <parameter>length</parameter> on behalf of arena
+        <parameter>arena_ind</parameter>, returning false upon success.
+        Committed memory may be committed in absolute terms as on a system that
+        does not overcommit, or in implicit terms as on a system that
+        overcommits and satisfies physical memory needs on demand via soft page
+        faults. If the function returns true, this indicates insufficient
+        physical memory to satisfy the request.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_decommit_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>offset</parameter></paramdef>
+          <paramdef>size_t <parameter>length</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent decommit function conforms to the
+        <type>extent_decommit_t</type> type and decommits any physical memory
+        that is backing pages within an extent at given
+        <parameter>addr</parameter> and <parameter>size</parameter> at
+        <parameter>offset</parameter> bytes, extending for
+        <parameter>length</parameter> on behalf of arena
+        <parameter>arena_ind</parameter>, returning false upon success, in which
+        case the pages will be committed via the extent commit function before
+        being reused.  If the function returns true, this indicates opt-out from
+        decommit; the memory remains committed and available for future use, in
+        which case it will be automatically retained for later reuse.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_purge_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>offset</parameter></paramdef>
+          <paramdef>size_t <parameter>length</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent purge function conforms to the
+        <type>extent_purge_t</type> type and discards physical pages
+        within the virtual memory mapping associated with an extent at given
+        <parameter>addr</parameter> and <parameter>size</parameter> at
+        <parameter>offset</parameter> bytes, extending for
+        <parameter>length</parameter> on behalf of arena
+        <parameter>arena_ind</parameter>.  A lazy extent purge function (e.g.
+        implemented via
+        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>)
+        can delay purging indefinitely and leave the pages within the purged
+        virtual memory range in an indeterminite state, whereas a forced extent
+        purge function immediately purges, and the pages within the virtual
+        memory range will be zero-filled the next time they are accessed.  If
+        the function returns true, this indicates failure to purge.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_split_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr</parameter></paramdef>
+          <paramdef>size_t <parameter>size</parameter></paramdef>
+          <paramdef>size_t <parameter>size_a</parameter></paramdef>
+          <paramdef>size_t <parameter>size_b</parameter></paramdef>
+          <paramdef>bool <parameter>committed</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent split function conforms to the
+        <type>extent_split_t</type> type and optionally splits an extent at
+        given <parameter>addr</parameter> and <parameter>size</parameter> into
+        two adjacent extents, the first of <parameter>size_a</parameter> bytes,
+        and the second of <parameter>size_b</parameter> bytes, operating on
+        <parameter>committed</parameter>/decommitted memory as indicated, on
+        behalf of arena <parameter>arena_ind</parameter>, returning false upon
+        success.  If the function returns true, this indicates that the extent
+        remains unsplit and therefore should continue to be operated on as a
+        whole.</para>
+
+        <funcsynopsis><funcprototype>
+          <funcdef>typedef bool <function>(extent_merge_t)</function></funcdef>
+          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
+          <paramdef>void *<parameter>addr_a</parameter></paramdef>
+          <paramdef>size_t <parameter>size_a</parameter></paramdef>
+          <paramdef>void *<parameter>addr_b</parameter></paramdef>
+          <paramdef>size_t <parameter>size_b</parameter></paramdef>
+          <paramdef>bool <parameter>committed</parameter></paramdef>
+          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
+        </funcprototype></funcsynopsis>
+        <literallayout></literallayout>
+        <para>An extent merge function conforms to the
+        <type>extent_merge_t</type> type and optionally merges adjacent extents,
+        at given <parameter>addr_a</parameter> and <parameter>size_a</parameter>
+        with given <parameter>addr_b</parameter> and
+        <parameter>size_b</parameter> into one contiguous extent, operating on
+        <parameter>committed</parameter>/decommitted memory as indicated, on
+        behalf of arena <parameter>arena_ind</parameter>, returning false upon
+        success.  If the function returns true, this indicates that the extents
+        remain distinct mappings and therefore should continue to be operated on
+        independently.</para>
+        </listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.narenas">
+        <term>
+          <mallctl>arenas.narenas</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Current limit on number of arenas.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.dirty_decay_ms">
+        <term>
+          <mallctl>arenas.dirty_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Current default per-arena approximate time in
+        milliseconds from the creation of a set of unused dirty pages until an
+        equivalent set of unused dirty pages is purged and/or reused, used to
+        initialize <link
+        linkend="arena.i.dirty_decay_ms"><mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl></link>
+        during arena creation.  See <link
+        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
+        for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.muzzy_decay_ms">
+        <term>
+          <mallctl>arenas.muzzy_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Current default per-arena approximate time in
+        milliseconds from the creation of a set of unused muzzy pages until an
+        equivalent set of unused muzzy pages is purged and/or reused, used to
+        initialize <link
+        linkend="arena.i.muzzy_decay_ms"><mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl></link>
+        during arena creation.  See <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
+        for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.quantum">
+        <term>
+          <mallctl>arenas.quantum</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Quantum size.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.page">
+        <term>
+          <mallctl>arenas.page</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Page size.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.tcache_max">
+        <term>
+          <mallctl>arenas.tcache_max</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum thread-cached size class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.nbins">
+        <term>
+          <mallctl>arenas.nbins</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of bin size classes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.nhbins">
+        <term>
+          <mallctl>arenas.nhbins</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Total number of thread cache bin size
+        classes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.bin.i.size">
+        <term>
+          <mallctl>arenas.bin.&lt;i&gt;.size</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum size supported by size class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.bin.i.nregs">
+        <term>
+          <mallctl>arenas.bin.&lt;i&gt;.nregs</mallctl>
+          (<type>uint32_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of regions per slab.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.bin.i.slab_size">
+        <term>
+          <mallctl>arenas.bin.&lt;i&gt;.slab_size</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of bytes per slab.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.nlextents">
+        <term>
+          <mallctl>arenas.nlextents</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Total number of large size classes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.lextent.i.size">
+        <term>
+          <mallctl>arenas.lextent.&lt;i&gt;.size</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Maximum size supported by this large size
+        class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.create">
+        <term>
+          <mallctl>arenas.create</mallctl>
+          (<type>unsigned</type>, <type>extent_hooks_t *</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Explicitly create a new arena outside the range of
+        automatically managed arenas, with optionally specified extent hooks,
+        and return the new arena index.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="arenas.lookup">
+        <term>
+          <mallctl>arenas.lookup</mallctl>
+          (<type>unsigned</type>, <type>void*</type>)
+          <literal>rw</literal>
+        </term>
+        <listitem><para>Index of the arena to which an allocation belongs to.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.thread_active_init">
+        <term>
+          <mallctl>prof.thread_active_init</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Control the initial setting for <link
+        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
+        in newly created threads.  See the <link
+        linkend="opt.prof_thread_active_init"><mallctl>opt.prof_thread_active_init</mallctl></link>
+        option for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.active">
+        <term>
+          <mallctl>prof.active</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Control whether sampling is currently active.  See the
+        <link
+        linkend="opt.prof_active"><mallctl>opt.prof_active</mallctl></link>
+        option for additional information, as well as the interrelated <link
+        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
+        mallctl.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.dump">
+        <term>
+          <mallctl>prof.dump</mallctl>
+          (<type>const char *</type>)
+          <literal>-w</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Dump a memory profile to the specified file, or if NULL
+        is specified, to a file according to the pattern
+        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.m&lt;mseq&gt;.heap</filename>,
+        where <literal>&lt;prefix&gt;</literal> is controlled by the
+        <link
+        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
+        option.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.gdump">
+        <term>
+          <mallctl>prof.gdump</mallctl>
+          (<type>bool</type>)
+          <literal>rw</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>When enabled, trigger a memory profile dump every time
+        the total virtual memory exceeds the previous maximum.  Profiles are
+        dumped to files named according to the pattern
+        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.u&lt;useq&gt;.heap</filename>,
+        where <literal>&lt;prefix&gt;</literal> is controlled by the <link
+        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
+        option.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.reset">
+        <term>
+          <mallctl>prof.reset</mallctl>
+          (<type>size_t</type>)
+          <literal>-w</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Reset all memory profile statistics, and optionally
+        update the sample rate (see <link
+        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>
+        and <link
+        linkend="prof.lg_sample"><mallctl>prof.lg_sample</mallctl></link>).
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.lg_sample">
+        <term>
+          <mallctl>prof.lg_sample</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Get the current sample rate (see <link
+        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>).
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="prof.interval">
+        <term>
+          <mallctl>prof.interval</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-prof</option>]
+        </term>
+        <listitem><para>Average number of bytes allocated between
+        interval-based profile dumps.  See the
+        <link
+        linkend="opt.lg_prof_interval"><mallctl>opt.lg_prof_interval</mallctl></link>
+        option for additional information.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.allocated">
+        <term>
+          <mallctl>stats.allocated</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Total number of bytes allocated by the
+        application.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.active">
+        <term>
+          <mallctl>stats.active</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Total number of bytes in active pages allocated by the
+        application.  This is a multiple of the page size, and greater than or
+        equal to <link
+        linkend="stats.allocated"><mallctl>stats.allocated</mallctl></link>.
+        This does not include <link linkend="stats.arenas.i.pdirty">
+        <mallctl>stats.arenas.&lt;i&gt;.pdirty</mallctl></link>,
+        <link linkend="stats.arenas.i.pmuzzy">
+        <mallctl>stats.arenas.&lt;i&gt;.pmuzzy</mallctl></link>, nor pages
+        entirely devoted to allocator metadata.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.metadata">
+        <term>
+          <mallctl>stats.metadata</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Total number of bytes dedicated to metadata, which
+        comprise base allocations used for bootstrap-sensitive allocator
+        metadata structures (see <link
+        linkend="stats.arenas.i.base"><mallctl>stats.arenas.&lt;i&gt;.base</mallctl></link>)
+        and internal allocations (see <link
+        linkend="stats.arenas.i.internal"><mallctl>stats.arenas.&lt;i&gt;.internal</mallctl></link>).
+        Transparent huge page (enabled with <link
+        linkend="opt.metadata_thp">opt.metadata_thp</link>) usage is not
+        considered.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.metadata_thp">
+        <term>
+          <mallctl>stats.metadata_thp</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of transparent huge pages (THP) used for
+        metadata.  See <link
+        linkend="stats.metadata"><mallctl>stats.metadata</mallctl></link> and
+        <link linkend="opt.metadata_thp">opt.metadata_thp</link>) for
+        details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.resident">
+        <term>
+          <mallctl>stats.resident</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Maximum number of bytes in physically resident data
+        pages mapped by the allocator, comprising all pages dedicated to
+        allocator metadata, pages backing active allocations, and unused dirty
+        pages.  This is a maximum rather than precise because pages may not
+        actually be physically resident if they correspond to demand-zeroed
+        virtual memory that has not yet been touched.  This is a multiple of the
+        page size, and is larger than <link
+        linkend="stats.active"><mallctl>stats.active</mallctl></link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.mapped">
+        <term>
+          <mallctl>stats.mapped</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Total number of bytes in active extents mapped by the
+        allocator.  This is larger than <link
+        linkend="stats.active"><mallctl>stats.active</mallctl></link>.  This
+        does not include inactive extents, even those that contain unused dirty
+        pages, which means that there is no strict ordering between this and
+        <link
+        linkend="stats.resident"><mallctl>stats.resident</mallctl></link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.retained">
+        <term>
+          <mallctl>stats.retained</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Total number of bytes in virtual memory mappings that
+        were retained rather than being returned to the operating system via
+        e.g. <citerefentry><refentrytitle>munmap</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> or similar.  Retained virtual
+        memory is typically untouched, decommitted, or purged, so it has no
+        strongly associated physical memory (see <link
+        linkend="arena.i.extent_hooks">extent hooks</link> for details).
+        Retained memory is excluded from mapped memory statistics, e.g. <link
+        linkend="stats.mapped"><mallctl>stats.mapped</mallctl></link>.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.background_thread.num_threads">
+        <term>
+          <mallctl>stats.background_thread.num_threads</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para> Number of <link linkend="background_thread">background
+        threads</link> running currently.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.background_thread.num_runs">
+        <term>
+          <mallctl>stats.background_thread.num_runs</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para> Total number of runs from all <link
+        linkend="background_thread">background threads</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.background_thread.run_interval">
+        <term>
+          <mallctl>stats.background_thread.run_interval</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para> Average run interval in nanoseconds of <link
+        linkend="background_thread">background threads</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.mutexes.ctl">
+        <term>
+          <mallctl>stats.mutexes.ctl.{counter};</mallctl>
+          (<type>counter specific type</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>ctl</varname> mutex (global
+        scope; mallctl related).  <mallctl>{counter}</mallctl> is one of the
+        counters below:</para>
+        <varlistentry id="mutex_counters">
+          <listitem><para><varname>num_ops</varname> (<type>uint64_t</type>):
+          Total number of lock acquisition operations on this mutex.</para>
+
+	  <para><varname>num_spin_acq</varname> (<type>uint64_t</type>): Number
+	  of times the mutex was spin-acquired.  When the mutex is currently
+	  locked and cannot be acquired immediately, a short period of
+	  spin-retry within jemalloc will be performed.  Acquired through spin
+	  generally means the contention was lightweight and not causing context
+	  switches.</para>
+
+	  <para><varname>num_wait</varname> (<type>uint64_t</type>): Number of
+	  times the mutex was wait-acquired, which means the mutex contention
+	  was not solved by spin-retry, and blocking operation was likely
+	  involved in order to acquire the mutex.  This event generally implies
+	  higher cost / longer delay, and should be investigated if it happens
+	  often.</para>
+
+	  <para><varname>max_wait_time</varname> (<type>uint64_t</type>):
+	  Maximum length of time in nanoseconds spent on a single wait-acquired
+	  lock operation.  Note that to avoid profiling overhead on the common
+	  path, this does not consider spin-acquired cases.</para>
+
+	  <para><varname>total_wait_time</varname> (<type>uint64_t</type>):
+	  Cumulative time in nanoseconds spent on wait-acquired lock operations.
+	  Similarly, spin-acquired cases are not considered.</para>
+
+	  <para><varname>max_num_thds</varname> (<type>uint32_t</type>): Maximum
+	  number of threads waiting on this mutex simultaneously.  Similarly,
+	  spin-acquired cases are not considered.</para>
+
+	  <para><varname>num_owner_switch</varname> (<type>uint64_t</type>):
+	  Number of times the current mutex owner is different from the previous
+	  one.  This event does not generally imply an issue; rather it is an
+	  indicator of how often the protected data are accessed by different
+	  threads.
+	  </para>
+	  </listitem>
+	</varlistentry>
+	</listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.mutexes.background_thread">
+        <term>
+          <mallctl>stats.mutexes.background_thread.{counter}</mallctl>
+	  (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>background_thread</varname> mutex
+        (global scope; <link
+        linkend="background_thread"><mallctl>background_thread</mallctl></link>
+        related).  <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.mutexes.prof">
+        <term>
+          <mallctl>stats.mutexes.prof.{counter}</mallctl>
+	  (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>prof</varname> mutex (global
+        scope; profiling related).  <mallctl>{counter}</mallctl> is one of the
+        counters in <link linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.mutexes.reset">
+        <term>
+          <mallctl>stats.mutexes.reset</mallctl>
+	  (<type>void</type>) <literal>--</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Reset all mutex profile statistics, including global
+        mutexes, arena mutexes and bin mutexes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.dss">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.dss</mallctl>
+          (<type>const char *</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>dss (<citerefentry><refentrytitle>sbrk</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry>) allocation precedence as
+        related to <citerefentry><refentrytitle>mmap</refentrytitle>
+        <manvolnum>2</manvolnum></citerefentry> allocation.  See <link
+        linkend="opt.dss"><mallctl>opt.dss</mallctl></link> for details.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.dirty_decay_ms">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.dirty_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Approximate time in milliseconds from the creation of a
+        set of unused dirty pages until an equivalent set of unused dirty pages
+        is purged and/or reused.  See <link
+        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
+        for details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.muzzy_decay_ms">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.muzzy_decay_ms</mallctl>
+          (<type>ssize_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Approximate time in milliseconds from the creation of a
+        set of unused muzzy pages until an equivalent set of unused muzzy pages
+        is purged and/or reused.  See <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
+        for details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.nthreads">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.nthreads</mallctl>
+          (<type>unsigned</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of threads currently assigned to
+        arena.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.uptime">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.uptime</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Time elapsed (in nanoseconds) since the arena was
+        created.  If &lt;i&gt; equals <constant>0</constant> or
+        <constant>MALLCTL_ARENAS_ALL</constant>, this is the uptime since malloc
+        initialization.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.pactive">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.pactive</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of pages in active extents.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.pdirty">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.pdirty</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of pages within unused extents that are
+        potentially dirty, and for which <function>madvise()</function> or
+        similar has not been called.  See <link
+        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
+        for a description of dirty pages.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.pmuzzy">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.pmuzzy</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Number of pages within unused extents that are muzzy.
+        See <link
+        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
+        for a description of muzzy pages.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mapped">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mapped</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of mapped bytes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.retained">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.retained</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of retained bytes.  See <link
+        linkend="stats.retained"><mallctl>stats.retained</mallctl></link> for
+        details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.base">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.base</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>
+        Number of bytes dedicated to bootstrap-sensitive allocator metadata
+        structures.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.internal">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.internal</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of bytes dedicated to internal allocations.
+        Internal allocations differ from application-originated allocations in
+        that they are for internal use, and that they are omitted from heap
+        profiles.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.metadata_thp">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.metadata_thp</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of transparent huge pages (THP) used for
+        metadata.  See <link linkend="opt.metadata_thp">opt.metadata_thp</link>
+        for details.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.resident">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.resident</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Maximum number of bytes in physically resident data
+        pages mapped by the arena, comprising all pages dedicated to allocator
+        metadata, pages backing active allocations, and unused dirty pages.
+        This is a maximum rather than precise because pages may not actually be
+        physically resident if they correspond to demand-zeroed virtual memory
+        that has not yet been touched.  This is a multiple of the page
+        size.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.dirty_npurge">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.dirty_npurge</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of dirty page purge sweeps performed.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.dirty_nmadvise">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.dirty_nmadvise</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of <function>madvise()</function> or similar
+        calls made to purge dirty pages.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.dirty_purged">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.dirty_purged</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of dirty pages purged.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.muzzy_npurge">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.muzzy_npurge</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of muzzy page purge sweeps performed.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.muzzy_nmadvise">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.muzzy_nmadvise</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of <function>madvise()</function> or similar
+        calls made to purge muzzy pages.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.muzzy_purged">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.muzzy_purged</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of muzzy pages purged.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.small.allocated">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.small.allocated</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of bytes currently allocated by small objects.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.small.nmalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.small.nmalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a small allocation was
+        requested from the arena's bins, whether to fill the relevant tcache if
+        <link linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is
+        enabled, or to directly satisfy an allocation request
+        otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.small.ndalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.small.ndalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a small allocation was
+        returned to the arena's bins, whether to flush the relevant tcache if
+        <link linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is
+        enabled, or to directly deallocate an allocation
+        otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.small.nrequests">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.small.nrequests</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of allocation requests satisfied by
+        all bin size classes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.large.allocated">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.large.allocated</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Number of bytes currently allocated by large objects.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.large.nmalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.large.nmalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a large extent was allocated
+        from the arena, whether to fill the relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
+        the size class is within the range being cached, or to directly satisfy
+        an allocation request otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.large.ndalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.large.ndalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a large extent was returned
+        to the arena, whether to flush the relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
+        the size class is within the range being cached, or to directly
+        deallocate an allocation otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.large.nrequests">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.large.nrequests</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of allocation requests satisfied by
+        all large size classes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nmalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nmalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a bin region of the
+        corresponding size class was allocated from the arena, whether to fill
+        the relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled, or
+        to directly satisfy an allocation request otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.ndalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.ndalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a bin region of the
+        corresponding size class was returned to the arena, whether to flush the
+        relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled, or
+        to directly deallocate an allocation otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nrequests">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nrequests</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of allocation requests satisfied by
+        bin regions of the corresponding size class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.curregs">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.curregs</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Current number of regions for this size
+        class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nfills">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nfills</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Cumulative number of tcache fills.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nflushes">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nflushes</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+        </term>
+        <listitem><para>Cumulative number of tcache flushes.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nslabs">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nslabs</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of slabs created.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.nreslabs">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nreslabs</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times the current slab from which
+        to allocate changed.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.j.curslabs">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.curslabs</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Current number of slabs.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.bins.mutex">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.mutex.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on
+        <varname>arena.&lt;i&gt;.bins.&lt;j&gt;</varname> mutex (arena bin
+        scope; bin operation related).  <mallctl>{counter}</mallctl> is one of
+        the counters in <link linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.lextents.j.nmalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.nmalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a large extent of the
+        corresponding size class was allocated from the arena, whether to fill
+        the relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
+        the size class is within the range being cached, or to directly satisfy
+        an allocation request otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.lextents.j.ndalloc">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.ndalloc</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of times a large extent of the
+        corresponding size class was returned to the arena, whether to flush the
+        relevant tcache if <link
+        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
+        the size class is within the range being cached, or to directly
+        deallocate an allocation otherwise.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.lextents.j.nrequests">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.nrequests</mallctl>
+          (<type>uint64_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Cumulative number of allocation requests satisfied by
+        large extents of the corresponding size class.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.lextents.j.curlextents">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.curlextents</mallctl>
+          (<type>size_t</type>)
+          <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Current number of large allocations for this size class.
+        </para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.large">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.large.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.large</varname>
+        mutex (arena scope; large allocation related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.extent_avail">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extent_avail.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extent_avail
+        </varname> mutex (arena scope; extent avail related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.extents_dirty">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_dirty.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_dirty
+        </varname> mutex (arena scope; dirty extents related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.extents_muzzy">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_muzzy.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_muzzy
+        </varname> mutex (arena scope; muzzy extents related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.extents_retained">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_retained.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_retained
+        </varname> mutex (arena scope; retained extents related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.decay_dirty">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.decay_dirty.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.decay_dirty
+        </varname> mutex (arena scope; decay for dirty pages related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.decay_muzzy">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.decay_muzzy.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.decay_muzzy
+        </varname> mutex (arena scope; decay for muzzy pages related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.base">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.base.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.base</varname>
+        mutex (arena scope; base allocator related).
+        <mallctl>{counter}</mallctl> is one of the counters in <link
+        linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+      <varlistentry id="stats.arenas.i.mutexes.tcache_list">
+        <term>
+          <mallctl>stats.arenas.&lt;i&gt;.mutexes.tcache_list.{counter}</mallctl>
+          (<type>counter specific type</type>) <literal>r-</literal>
+          [<option>--enable-stats</option>]
+        </term>
+        <listitem><para>Statistics on
+        <varname>arena.&lt;i&gt;.tcache_list</varname> mutex (arena scope;
+        tcache to arena association related).  This mutex is expected to be
+        accessed less often.  <mallctl>{counter}</mallctl> is one of the
+        counters in <link linkend="mutex_counters">mutex profiling
+        counters</link>.</para></listitem>
+      </varlistentry>
+
+    </variablelist>
+  </refsect1>
+  <refsect1 id="heap_profile_format">
+    <title>HEAP PROFILE FORMAT</title>
+    <para>Although the heap profiling functionality was originally designed to
+    be compatible with the
+    <command>pprof</command> command that is developed as part of the <ulink
+    url="http://code.google.com/p/gperftools/">gperftools
+    package</ulink>, the addition of per thread heap profiling functionality
+    required a different heap profile format.  The <command>jeprof</command>
+    command is derived from <command>pprof</command>, with enhancements to
+    support the heap profile format described here.</para>
+
+    <para>In the following hypothetical heap profile, <constant>[...]</constant>
+    indicates elision for the sake of compactness.  <programlisting><![CDATA[
+heap_v2/524288
+  t*: 28106: 56637512 [0: 0]
+  [...]
+  t3: 352: 16777344 [0: 0]
+  [...]
+  t99: 17754: 29341640 [0: 0]
+  [...]
+@ 0x5f86da8 0x5f5a1dc [...] 0x29e4d4e 0xa200316 0xabb2988 [...]
+  t*: 13: 6688 [0: 0]
+  t3: 12: 6496 [0: ]
+  t99: 1: 192 [0: 0]
+[...]
+
+MAPPED_LIBRARIES:
+[...]]]></programlisting> The following matches the above heap profile, but most
+tokens are replaced with <constant>&lt;description&gt;</constant> to indicate
+descriptions of the corresponding fields.  <programlisting><![CDATA[
+<heap_profile_format_version>/<mean_sample_interval>
+  <aggregate>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
+  [...]
+  <thread_3_aggregate>: <curobjs>: <curbytes>[<cumobjs>: <cumbytes>]
+  [...]
+  <thread_99_aggregate>: <curobjs>: <curbytes>[<cumobjs>: <cumbytes>]
+  [...]
+@ <top_frame> <frame> [...] <frame> <frame> <frame> [...]
+  <backtrace_aggregate>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
+  <backtrace_thread_3>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
+  <backtrace_thread_99>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
+[...]
+
+MAPPED_LIBRARIES:
+</proc/<pid>/maps>]]></programlisting></para>
+  </refsect1>
+
+  <refsect1 id="debugging_malloc_problems">
+    <title>DEBUGGING MALLOC PROBLEMS</title>
+    <para>When debugging, it is a good idea to configure/build jemalloc with
+    the <option>--enable-debug</option> and <option>--enable-fill</option>
+    options, and recompile the program with suitable options and symbols for
+    debugger support.  When so configured, jemalloc incorporates a wide variety
+    of run-time assertions that catch application errors such as double-free,
+    write-after-free, etc.</para>
+
+    <para>Programs often accidentally depend on <quote>uninitialized</quote>
+    memory actually being filled with zero bytes.  Junk filling
+    (see the <link linkend="opt.junk"><mallctl>opt.junk</mallctl></link>
+    option) tends to expose such bugs in the form of obviously incorrect
+    results and/or coredumps.  Conversely, zero
+    filling (see the <link
+    linkend="opt.zero"><mallctl>opt.zero</mallctl></link> option) eliminates
+    the symptoms of such bugs.  Between these two options, it is usually
+    possible to quickly detect, diagnose, and eliminate such bugs.</para>
+
+    <para>This implementation does not provide much detail about the problems
+    it detects, because the performance impact for storing such information
+    would be prohibitive.</para>
+  </refsect1>
+  <refsect1 id="diagnostic_messages">
+    <title>DIAGNOSTIC MESSAGES</title>
+    <para>If any of the memory allocation/deallocation functions detect an
+    error or warning condition, a message will be printed to file descriptor
+    <constant>STDERR_FILENO</constant>.  Errors will result in the process
+    dumping core.  If the <link
+    linkend="opt.abort"><mallctl>opt.abort</mallctl></link> option is set, most
+    warnings are treated as errors.</para>
+
+    <para>The <varname>malloc_message</varname> variable allows the programmer
+    to override the function which emits the text strings forming the errors
+    and warnings if for some reason the <constant>STDERR_FILENO</constant> file
+    descriptor is not suitable for this.
+    <function>malloc_message()</function> takes the
+    <parameter>cbopaque</parameter> pointer argument that is
+    <constant>NULL</constant> unless overridden by the arguments in a call to
+    <function>malloc_stats_print()</function>, followed by a string
+    pointer.  Please note that doing anything which tries to allocate memory in
+    this function is likely to result in a crash or deadlock.</para>
+
+    <para>All messages are prefixed by
+    <quote><computeroutput>&lt;jemalloc&gt;: </computeroutput></quote>.</para>
+  </refsect1>
+  <refsect1 id="return_values">
+    <title>RETURN VALUES</title>
+    <refsect2>
+      <title>Standard API</title>
+      <para>The <function>malloc()</function> and
+      <function>calloc()</function> functions return a pointer to the
+      allocated memory if successful; otherwise a <constant>NULL</constant>
+      pointer is returned and <varname>errno</varname> is set to
+      <errorname>ENOMEM</errorname>.</para>
+
+      <para>The <function>posix_memalign()</function> function
+      returns the value 0 if successful; otherwise it returns an error value.
+      The <function>posix_memalign()</function> function will fail
+      if:
+        <variablelist>
+          <varlistentry>
+            <term><errorname>EINVAL</errorname></term>
+
+            <listitem><para>The <parameter>alignment</parameter> parameter is
+            not a power of 2 at least as large as
+            <code language="C">sizeof(<type>void *</type>)</code>.
+            </para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>ENOMEM</errorname></term>
+
+            <listitem><para>Memory allocation error.</para></listitem>
+          </varlistentry>
+        </variablelist>
+      </para>
+
+      <para>The <function>aligned_alloc()</function> function returns
+      a pointer to the allocated memory if successful; otherwise a
+      <constant>NULL</constant> pointer is returned and
+      <varname>errno</varname> is set.  The
+      <function>aligned_alloc()</function> function will fail if:
+        <variablelist>
+          <varlistentry>
+            <term><errorname>EINVAL</errorname></term>
+
+            <listitem><para>The <parameter>alignment</parameter> parameter is
+            not a power of 2.
+            </para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>ENOMEM</errorname></term>
+
+            <listitem><para>Memory allocation error.</para></listitem>
+          </varlistentry>
+        </variablelist>
+      </para>
+
+      <para>The <function>realloc()</function> function returns a
+      pointer, possibly identical to <parameter>ptr</parameter>, to the
+      allocated memory if successful; otherwise a <constant>NULL</constant>
+      pointer is returned, and <varname>errno</varname> is set to
+      <errorname>ENOMEM</errorname> if the error was the result of an
+      allocation failure.  The <function>realloc()</function>
+      function always leaves the original buffer intact when an error occurs.
+      </para>
+
+      <para>The <function>free()</function> function returns no
+      value.</para>
+    </refsect2>
+    <refsect2>
+      <title>Non-standard API</title>
+      <para>The <function>mallocx()</function> and
+      <function>rallocx()</function> functions return a pointer to
+      the allocated memory if successful; otherwise a <constant>NULL</constant>
+      pointer is returned to indicate insufficient contiguous memory was
+      available to service the allocation request.  </para>
+
+      <para>The <function>xallocx()</function> function returns the
+      real size of the resulting resized allocation pointed to by
+      <parameter>ptr</parameter>, which is a value less than
+      <parameter>size</parameter> if the allocation could not be adequately
+      grown in place.  </para>
+
+      <para>The <function>sallocx()</function> function returns the
+      real size of the allocation pointed to by <parameter>ptr</parameter>.
+      </para>
+
+      <para>The <function>nallocx()</function> returns the real size
+      that would result from a successful equivalent
+      <function>mallocx()</function> function call, or zero if
+      insufficient memory is available to perform the size computation.  </para>
+
+      <para>The <function>mallctl()</function>,
+      <function>mallctlnametomib()</function>, and
+      <function>mallctlbymib()</function> functions return 0 on
+      success; otherwise they return an error value.  The functions will fail
+      if:
+        <variablelist>
+          <varlistentry>
+            <term><errorname>EINVAL</errorname></term>
+
+            <listitem><para><parameter>newp</parameter> is not
+            <constant>NULL</constant>, and <parameter>newlen</parameter> is too
+            large or too small.  Alternatively, <parameter>*oldlenp</parameter>
+            is too large or too small; in this case as much data as possible
+            are read despite the error.</para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>ENOENT</errorname></term>
+
+            <listitem><para><parameter>name</parameter> or
+            <parameter>mib</parameter> specifies an unknown/invalid
+            value.</para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>EPERM</errorname></term>
+
+            <listitem><para>Attempt to read or write void value, or attempt to
+            write read-only value.</para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>EAGAIN</errorname></term>
+
+            <listitem><para>A memory allocation failure
+            occurred.</para></listitem>
+          </varlistentry>
+          <varlistentry>
+            <term><errorname>EFAULT</errorname></term>
+
+            <listitem><para>An interface with side effects failed in some way
+            not directly related to <function>mallctl*()</function>
+            read/write processing.</para></listitem>
+          </varlistentry>
+        </variablelist>
+      </para>
+
+      <para>The <function>malloc_usable_size()</function> function
+      returns the usable size of the allocation pointed to by
+      <parameter>ptr</parameter>.  </para>
+    </refsect2>
+  </refsect1>
+  <refsect1 id="environment">
+    <title>ENVIRONMENT</title>
+    <para>The following environment variable affects the execution of the
+    allocation functions:
+      <variablelist>
+        <varlistentry>
+          <term><envar>MALLOC_CONF</envar></term>
+
+          <listitem><para>If the environment variable
+          <envar>MALLOC_CONF</envar> is set, the characters it contains
+          will be interpreted as options.</para></listitem>
+        </varlistentry>
+      </variablelist>
+    </para>
+  </refsect1>
+  <refsect1 id="examples">
+    <title>EXAMPLES</title>
+    <para>To dump core whenever a problem occurs:
+      <screen>ln -s 'abort:true' /etc/malloc.conf</screen>
+    </para>
+    <para>To specify in the source that only one arena should be automatically
+    created:
+      <programlisting language="C"><![CDATA[
+malloc_conf = "narenas:1";]]></programlisting></para>
+  </refsect1>
+  <refsect1 id="see_also">
+    <title>SEE ALSO</title>
+    <para><citerefentry><refentrytitle>madvise</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>mmap</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>sbrk</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>utrace</refentrytitle>
+    <manvolnum>2</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>alloca</refentrytitle>
+    <manvolnum>3</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>atexit</refentrytitle>
+    <manvolnum>3</manvolnum></citerefentry>,
+    <citerefentry><refentrytitle>getpagesize</refentrytitle>
+    <manvolnum>3</manvolnum></citerefentry></para>
+  </refsect1>
+  <refsect1 id="standards">
+    <title>STANDARDS</title>
+    <para>The <function>malloc()</function>,
+    <function>calloc()</function>,
+    <function>realloc()</function>, and
+    <function>free()</function> functions conform to ISO/IEC
+    9899:1990 (<quote>ISO C90</quote>).</para>
+
+    <para>The <function>posix_memalign()</function> function conforms
+    to IEEE Std 1003.1-2001 (<quote>POSIX.1</quote>).</para>
+  </refsect1>
+</refentry>
diff --git a/redis-stable/deps/jemalloc/doc/manpages.xsl.in b/redis-stable/deps/jemalloc/doc/manpages.xsl.in
new file mode 100644
index 00000000..88b2626b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/doc/manpages.xsl.in
@@ -0,0 +1,4 @@
+<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
+  <xsl:import href="@XSLROOT@/manpages/docbook.xsl"/>
+  <xsl:import href="@abs_srcroot@doc/stylesheet.xsl"/>
+</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/doc/stylesheet.xsl b/redis-stable/deps/jemalloc/doc/stylesheet.xsl
new file mode 100644
index 00000000..619365d8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/doc/stylesheet.xsl
@@ -0,0 +1,10 @@
+<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
+  <xsl:param name="funcsynopsis.style">ansi</xsl:param>
+  <xsl:param name="function.parens" select="0"/>
+  <xsl:template match="function">
+    <xsl:call-template name="inline.monoseq"/>
+  </xsl:template>
+  <xsl:template match="mallctl">
+    <quote><xsl:call-template name="inline.monoseq"/></quote>
+  </xsl:template>
+</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
new file mode 100644
index 00000000..4b3732b4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
@@ -0,0 +1,94 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_EXTERNS_H
+#define JEMALLOC_INTERNAL_ARENA_EXTERNS_H
+
+#include "jemalloc/internal/bin.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/pages.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/stats.h"
+
+extern ssize_t opt_dirty_decay_ms;
+extern ssize_t opt_muzzy_decay_ms;
+
+extern percpu_arena_mode_t opt_percpu_arena;
+extern const char *percpu_arena_mode_names[];
+
+extern const uint64_t h_steps[SMOOTHSTEP_NSTEPS];
+extern malloc_mutex_t arenas_lock;
+
+void arena_basic_stats_merge(tsdn_t *tsdn, arena_t *arena,
+    unsigned *nthreads, const char **dss, ssize_t *dirty_decay_ms,
+    ssize_t *muzzy_decay_ms, size_t *nactive, size_t *ndirty, size_t *nmuzzy);
+void arena_stats_merge(tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
+    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
+    size_t *nactive, size_t *ndirty, size_t *nmuzzy, arena_stats_t *astats,
+    bin_stats_t *bstats, arena_stats_large_t *lstats);
+void arena_extents_dirty_dalloc(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent);
+#ifdef JEMALLOC_JET
+size_t arena_slab_regind(extent_t *slab, szind_t binind, const void *ptr);
+#endif
+extent_t *arena_extent_alloc_large(tsdn_t *tsdn, arena_t *arena,
+    size_t usize, size_t alignment, bool *zero);
+void arena_extent_dalloc_large_prep(tsdn_t *tsdn, arena_t *arena,
+    extent_t *extent);
+void arena_extent_ralloc_large_shrink(tsdn_t *tsdn, arena_t *arena,
+    extent_t *extent, size_t oldsize);
+void arena_extent_ralloc_large_expand(tsdn_t *tsdn, arena_t *arena,
+    extent_t *extent, size_t oldsize);
+ssize_t arena_dirty_decay_ms_get(arena_t *arena);
+bool arena_dirty_decay_ms_set(tsdn_t *tsdn, arena_t *arena, ssize_t decay_ms);
+ssize_t arena_muzzy_decay_ms_get(arena_t *arena);
+bool arena_muzzy_decay_ms_set(tsdn_t *tsdn, arena_t *arena, ssize_t decay_ms);
+void arena_decay(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
+    bool all);
+void arena_reset(tsd_t *tsd, arena_t *arena);
+void arena_destroy(tsd_t *tsd, arena_t *arena);
+void arena_tcache_fill_small(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
+    cache_bin_t *tbin, szind_t binind, uint64_t prof_accumbytes);
+void arena_alloc_junk_small(void *ptr, const bin_info_t *bin_info,
+    bool zero);
+
+typedef void (arena_dalloc_junk_small_t)(void *, const bin_info_t *);
+extern arena_dalloc_junk_small_t *JET_MUTABLE arena_dalloc_junk_small;
+
+void *arena_malloc_hard(tsdn_t *tsdn, arena_t *arena, size_t size,
+    szind_t ind, bool zero);
+void *arena_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize,
+    size_t alignment, bool zero, tcache_t *tcache);
+void arena_prof_promote(tsdn_t *tsdn, const void *ptr, size_t usize);
+void arena_dalloc_promoted(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
+    bool slow_path);
+void arena_dalloc_bin_junked_locked(tsdn_t *tsdn, arena_t *arena,
+    extent_t *extent, void *ptr);
+void arena_dalloc_small(tsdn_t *tsdn, void *ptr);
+bool arena_ralloc_no_move(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
+    size_t extra, bool zero);
+void *arena_ralloc(tsdn_t *tsdn, arena_t *arena, void *ptr, size_t oldsize,
+    size_t size, size_t alignment, bool zero, tcache_t *tcache);
+dss_prec_t arena_dss_prec_get(arena_t *arena);
+bool arena_dss_prec_set(arena_t *arena, dss_prec_t dss_prec);
+ssize_t arena_dirty_decay_ms_default_get(void);
+bool arena_dirty_decay_ms_default_set(ssize_t decay_ms);
+ssize_t arena_muzzy_decay_ms_default_get(void);
+bool arena_muzzy_decay_ms_default_set(ssize_t decay_ms);
+bool arena_retain_grow_limit_get_set(tsd_t *tsd, arena_t *arena,
+    size_t *old_limit, size_t *new_limit);
+unsigned arena_nthreads_get(arena_t *arena, bool internal);
+void arena_nthreads_inc(arena_t *arena, bool internal);
+void arena_nthreads_dec(arena_t *arena, bool internal);
+size_t arena_extent_sn_next(arena_t *arena);
+arena_t *arena_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
+void arena_boot(void);
+void arena_prefork0(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork1(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork2(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork3(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork4(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork5(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork6(tsdn_t *tsdn, arena_t *arena);
+void arena_prefork7(tsdn_t *tsdn, arena_t *arena);
+void arena_postfork_parent(tsdn_t *tsdn, arena_t *arena);
+void arena_postfork_child(tsdn_t *tsdn, arena_t *arena);
+
+#endif /* JEMALLOC_INTERNAL_ARENA_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
new file mode 100644
index 00000000..9abf7f6a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
@@ -0,0 +1,57 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_INLINES_A_H
+#define JEMALLOC_INTERNAL_ARENA_INLINES_A_H
+
+static inline unsigned
+arena_ind_get(const arena_t *arena) {
+	return base_ind_get(arena->base);
+}
+
+static inline void
+arena_internal_add(arena_t *arena, size_t size) {
+	atomic_fetch_add_zu(&arena->stats.internal, size, ATOMIC_RELAXED);
+}
+
+static inline void
+arena_internal_sub(arena_t *arena, size_t size) {
+	atomic_fetch_sub_zu(&arena->stats.internal, size, ATOMIC_RELAXED);
+}
+
+static inline size_t
+arena_internal_get(arena_t *arena) {
+	return atomic_load_zu(&arena->stats.internal, ATOMIC_RELAXED);
+}
+
+static inline bool
+arena_prof_accum(tsdn_t *tsdn, arena_t *arena, uint64_t accumbytes) {
+	cassert(config_prof);
+
+	if (likely(prof_interval == 0 || !prof_active_get_unlocked())) {
+		return false;
+	}
+
+	return prof_accum_add(tsdn, &arena->prof_accum, accumbytes);
+}
+
+static inline void
+percpu_arena_update(tsd_t *tsd, unsigned cpu) {
+	assert(have_percpu_arena);
+	arena_t *oldarena = tsd_arena_get(tsd);
+	assert(oldarena != NULL);
+	unsigned oldind = arena_ind_get(oldarena);
+
+	if (oldind != cpu) {
+		unsigned newind = cpu;
+		arena_t *newarena = arena_get(tsd_tsdn(tsd), newind, true);
+		assert(newarena != NULL);
+
+		/* Set new arena/tcache associations. */
+		arena_migrate(tsd, oldind, newind);
+		tcache_t *tcache = tcache_get(tsd);
+		if (tcache != NULL) {
+			tcache_arena_reassociate(tsd_tsdn(tsd), tcache,
+			    newarena);
+		}
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_ARENA_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
new file mode 100644
index 00000000..2b7e77e7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
@@ -0,0 +1,354 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_INLINES_B_H
+#define JEMALLOC_INTERNAL_ARENA_INLINES_B_H
+
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/sz.h"
+#include "jemalloc/internal/ticker.h"
+
+JEMALLOC_ALWAYS_INLINE prof_tctx_t *
+arena_prof_tctx_get(tsdn_t *tsdn, const void *ptr, alloc_ctx_t *alloc_ctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	/* Static check. */
+	if (alloc_ctx == NULL) {
+		const extent_t *extent = iealloc(tsdn, ptr);
+		if (unlikely(!extent_slab_get(extent))) {
+			return large_prof_tctx_get(tsdn, extent);
+		}
+	} else {
+		if (unlikely(!alloc_ctx->slab)) {
+			return large_prof_tctx_get(tsdn, iealloc(tsdn, ptr));
+		}
+	}
+	return (prof_tctx_t *)(uintptr_t)1U;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_prof_tctx_set(tsdn_t *tsdn, const void *ptr, UNUSED size_t usize,
+    alloc_ctx_t *alloc_ctx, prof_tctx_t *tctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	/* Static check. */
+	if (alloc_ctx == NULL) {
+		extent_t *extent = iealloc(tsdn, ptr);
+		if (unlikely(!extent_slab_get(extent))) {
+			large_prof_tctx_set(tsdn, extent, tctx);
+		}
+	} else {
+		if (unlikely(!alloc_ctx->slab)) {
+			large_prof_tctx_set(tsdn, iealloc(tsdn, ptr), tctx);
+		}
+	}
+}
+
+static inline void
+arena_prof_tctx_reset(tsdn_t *tsdn, const void *ptr, UNUSED prof_tctx_t *tctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	extent_t *extent = iealloc(tsdn, ptr);
+	assert(!extent_slab_get(extent));
+
+	large_prof_tctx_reset(tsdn, extent);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_decay_ticks(tsdn_t *tsdn, arena_t *arena, unsigned nticks) {
+	tsd_t *tsd;
+	ticker_t *decay_ticker;
+
+	if (unlikely(tsdn_null(tsdn))) {
+		return;
+	}
+	tsd = tsdn_tsd(tsdn);
+	decay_ticker = decay_ticker_get(tsd, arena_ind_get(arena));
+	if (unlikely(decay_ticker == NULL)) {
+		return;
+	}
+	if (unlikely(ticker_ticks(decay_ticker, nticks))) {
+		arena_decay(tsdn, arena, false, false);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_decay_tick(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_assert_not_owner(tsdn, &arena->decay_dirty.mtx);
+	malloc_mutex_assert_not_owner(tsdn, &arena->decay_muzzy.mtx);
+
+	arena_decay_ticks(tsdn, arena, 1);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+arena_malloc(tsdn_t *tsdn, arena_t *arena, size_t size, szind_t ind, bool zero,
+    tcache_t *tcache, bool slow_path) {
+	assert(!tsdn_null(tsdn) || tcache == NULL);
+	assert(size != 0);
+
+	if (likely(tcache != NULL)) {
+		if (likely(size <= SMALL_MAXCLASS)) {
+			return tcache_alloc_small(tsdn_tsd(tsdn), arena,
+			    tcache, size, ind, zero, slow_path);
+		}
+		if (likely(size <= tcache_maxclass)) {
+			return tcache_alloc_large(tsdn_tsd(tsdn), arena,
+			    tcache, size, ind, zero, slow_path);
+		}
+		/* (size > tcache_maxclass) case falls through. */
+		assert(size > tcache_maxclass);
+	}
+
+	return arena_malloc_hard(tsdn, arena, size, ind, zero);
+}
+
+JEMALLOC_ALWAYS_INLINE arena_t *
+arena_aalloc(tsdn_t *tsdn, const void *ptr) {
+	return extent_arena_get(iealloc(tsdn, ptr));
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+arena_salloc(tsdn_t *tsdn, const void *ptr) {
+	assert(ptr != NULL);
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	szind_t szind = rtree_szind_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true);
+	assert(szind != NSIZES);
+
+	return sz_index2size(szind);
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+arena_vsalloc(tsdn_t *tsdn, const void *ptr) {
+	/*
+	 * Return 0 if ptr is not within an extent managed by jemalloc.  This
+	 * function has two extra costs relative to isalloc():
+	 * - The rtree calls cannot claim to be dependent lookups, which induces
+	 *   rtree lookup load dependencies.
+	 * - The lookup may fail, so there is an extra branch to check for
+	 *   failure.
+	 */
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	extent_t *extent;
+	szind_t szind;
+	if (rtree_extent_szind_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, false, &extent, &szind)) {
+		return 0;
+	}
+
+	if (extent == NULL) {
+		return 0;
+	}
+	assert(extent_state_get(extent) == extent_state_active);
+	/* Only slab members should be looked up via interior pointers. */
+	assert(extent_addr_get(extent) == ptr || extent_slab_get(extent));
+
+	assert(szind != NSIZES);
+
+	return sz_index2size(szind);
+}
+
+static inline void
+arena_dalloc_no_tcache(tsdn_t *tsdn, void *ptr) {
+	assert(ptr != NULL);
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	szind_t szind;
+	bool slab;
+	rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
+	    true, &szind, &slab);
+
+	if (config_debug) {
+		extent_t *extent = rtree_extent_read(tsdn, &extents_rtree,
+		    rtree_ctx, (uintptr_t)ptr, true);
+		assert(szind == extent_szind_get(extent));
+		assert(szind < NSIZES);
+		assert(slab == extent_slab_get(extent));
+	}
+
+	if (likely(slab)) {
+		/* Small allocation. */
+		arena_dalloc_small(tsdn, ptr);
+	} else {
+		extent_t *extent = iealloc(tsdn, ptr);
+		large_dalloc(tsdn, extent);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_dalloc(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
+    alloc_ctx_t *alloc_ctx, bool slow_path) {
+	assert(!tsdn_null(tsdn) || tcache == NULL);
+	assert(ptr != NULL);
+
+	if (unlikely(tcache == NULL)) {
+		arena_dalloc_no_tcache(tsdn, ptr);
+		return;
+	}
+
+	szind_t szind;
+	bool slab;
+	rtree_ctx_t *rtree_ctx;
+	if (alloc_ctx != NULL) {
+		szind = alloc_ctx->szind;
+		slab = alloc_ctx->slab;
+		assert(szind != NSIZES);
+	} else {
+		rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
+		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &szind, &slab);
+	}
+
+	if (config_debug) {
+		rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
+		extent_t *extent = rtree_extent_read(tsdn, &extents_rtree,
+		    rtree_ctx, (uintptr_t)ptr, true);
+		assert(szind == extent_szind_get(extent));
+		assert(szind < NSIZES);
+		assert(slab == extent_slab_get(extent));
+	}
+
+	if (likely(slab)) {
+		/* Small allocation. */
+		tcache_dalloc_small(tsdn_tsd(tsdn), tcache, ptr, szind,
+		    slow_path);
+	} else {
+		if (szind < nhbins) {
+			if (config_prof && unlikely(szind < NBINS)) {
+				arena_dalloc_promoted(tsdn, ptr, tcache,
+				    slow_path);
+			} else {
+				tcache_dalloc_large(tsdn_tsd(tsdn), tcache, ptr,
+				    szind, slow_path);
+			}
+		} else {
+			extent_t *extent = iealloc(tsdn, ptr);
+			large_dalloc(tsdn, extent);
+		}
+	}
+}
+
+static inline void
+arena_sdalloc_no_tcache(tsdn_t *tsdn, void *ptr, size_t size) {
+	assert(ptr != NULL);
+	assert(size <= LARGE_MAXCLASS);
+
+	szind_t szind;
+	bool slab;
+	if (!config_prof || !opt_prof) {
+		/*
+		 * There is no risk of being confused by a promoted sampled
+		 * object, so base szind and slab on the given size.
+		 */
+		szind = sz_size2index(size);
+		slab = (szind < NBINS);
+	}
+
+	if ((config_prof && opt_prof) || config_debug) {
+		rtree_ctx_t rtree_ctx_fallback;
+		rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
+		    &rtree_ctx_fallback);
+
+		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &szind, &slab);
+
+		assert(szind == sz_size2index(size));
+		assert((config_prof && opt_prof) || slab == (szind < NBINS));
+
+		if (config_debug) {
+			extent_t *extent = rtree_extent_read(tsdn,
+			    &extents_rtree, rtree_ctx, (uintptr_t)ptr, true);
+			assert(szind == extent_szind_get(extent));
+			assert(slab == extent_slab_get(extent));
+		}
+	}
+
+	if (likely(slab)) {
+		/* Small allocation. */
+		arena_dalloc_small(tsdn, ptr);
+	} else {
+		extent_t *extent = iealloc(tsdn, ptr);
+		large_dalloc(tsdn, extent);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_sdalloc(tsdn_t *tsdn, void *ptr, size_t size, tcache_t *tcache,
+    alloc_ctx_t *alloc_ctx, bool slow_path) {
+	assert(!tsdn_null(tsdn) || tcache == NULL);
+	assert(ptr != NULL);
+	assert(size <= LARGE_MAXCLASS);
+
+	if (unlikely(tcache == NULL)) {
+		arena_sdalloc_no_tcache(tsdn, ptr, size);
+		return;
+	}
+
+	szind_t szind;
+	bool slab;
+	UNUSED alloc_ctx_t local_ctx;
+	if (config_prof && opt_prof) {
+		if (alloc_ctx == NULL) {
+			/* Uncommon case and should be a static check. */
+			rtree_ctx_t rtree_ctx_fallback;
+			rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
+			    &rtree_ctx_fallback);
+			rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
+			    (uintptr_t)ptr, true, &local_ctx.szind,
+			    &local_ctx.slab);
+			assert(local_ctx.szind == sz_size2index(size));
+			alloc_ctx = &local_ctx;
+		}
+		slab = alloc_ctx->slab;
+		szind = alloc_ctx->szind;
+	} else {
+		/*
+		 * There is no risk of being confused by a promoted sampled
+		 * object, so base szind and slab on the given size.
+		 */
+		szind = sz_size2index(size);
+		slab = (szind < NBINS);
+	}
+
+	if (config_debug) {
+		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
+		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &szind, &slab);
+		extent_t *extent = rtree_extent_read(tsdn,
+		    &extents_rtree, rtree_ctx, (uintptr_t)ptr, true);
+		assert(szind == extent_szind_get(extent));
+		assert(slab == extent_slab_get(extent));
+	}
+
+	if (likely(slab)) {
+		/* Small allocation. */
+		tcache_dalloc_small(tsdn_tsd(tsdn), tcache, ptr, szind,
+		    slow_path);
+	} else {
+		if (szind < nhbins) {
+			if (config_prof && unlikely(szind < NBINS)) {
+				arena_dalloc_promoted(tsdn, ptr, tcache,
+				    slow_path);
+			} else {
+				tcache_dalloc_large(tsdn_tsd(tsdn),
+				    tcache, ptr, szind, slow_path);
+			}
+		} else {
+			extent_t *extent = iealloc(tsdn, ptr);
+			large_dalloc(tsdn, extent);
+		}
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_ARENA_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
new file mode 100644
index 00000000..5f3dca8b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
@@ -0,0 +1,237 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_STATS_H
+#define JEMALLOC_INTERNAL_ARENA_STATS_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_prof.h"
+#include "jemalloc/internal/size_classes.h"
+
+/*
+ * In those architectures that support 64-bit atomics, we use atomic updates for
+ * our 64-bit values.  Otherwise, we use a plain uint64_t and synchronize
+ * externally.
+ */
+#ifdef JEMALLOC_ATOMIC_U64
+typedef atomic_u64_t arena_stats_u64_t;
+#else
+/* Must hold the arena stats mutex while reading atomically. */
+typedef uint64_t arena_stats_u64_t;
+#endif
+
+typedef struct arena_stats_large_s arena_stats_large_t;
+struct arena_stats_large_s {
+	/*
+	 * Total number of allocation/deallocation requests served directly by
+	 * the arena.
+	 */
+	arena_stats_u64_t	nmalloc;
+	arena_stats_u64_t	ndalloc;
+
+	/*
+	 * Number of allocation requests that correspond to this size class.
+	 * This includes requests served by tcache, though tcache only
+	 * periodically merges into this counter.
+	 */
+	arena_stats_u64_t	nrequests; /* Partially derived. */
+
+	/* Current number of allocations of this size class. */
+	size_t		curlextents; /* Derived. */
+};
+
+typedef struct arena_stats_decay_s arena_stats_decay_t;
+struct arena_stats_decay_s {
+	/* Total number of purge sweeps. */
+	arena_stats_u64_t	npurge;
+	/* Total number of madvise calls made. */
+	arena_stats_u64_t	nmadvise;
+	/* Total number of pages purged. */
+	arena_stats_u64_t	purged;
+};
+
+/*
+ * Arena stats.  Note that fields marked "derived" are not directly maintained
+ * within the arena code; rather their values are derived during stats merge
+ * requests.
+ */
+typedef struct arena_stats_s arena_stats_t;
+struct arena_stats_s {
+#ifndef JEMALLOC_ATOMIC_U64
+	malloc_mutex_t		mtx;
+#endif
+
+	/* Number of bytes currently mapped, excluding retained memory. */
+	atomic_zu_t		mapped; /* Partially derived. */
+
+	/*
+	 * Number of unused virtual memory bytes currently retained.  Retained
+	 * bytes are technically mapped (though always decommitted or purged),
+	 * but they are excluded from the mapped statistic (above).
+	 */
+	atomic_zu_t		retained; /* Derived. */
+
+	arena_stats_decay_t	decay_dirty;
+	arena_stats_decay_t	decay_muzzy;
+
+	atomic_zu_t		base; /* Derived. */
+	atomic_zu_t		internal;
+	atomic_zu_t		resident; /* Derived. */
+	atomic_zu_t		metadata_thp;
+
+	atomic_zu_t		allocated_large; /* Derived. */
+	arena_stats_u64_t	nmalloc_large; /* Derived. */
+	arena_stats_u64_t	ndalloc_large; /* Derived. */
+	arena_stats_u64_t	nrequests_large; /* Derived. */
+
+	/* Number of bytes cached in tcache associated with this arena. */
+	atomic_zu_t		tcache_bytes; /* Derived. */
+
+	mutex_prof_data_t mutex_prof_data[mutex_prof_num_arena_mutexes];
+
+	/* One element for each large size class. */
+	arena_stats_large_t	lstats[NSIZES - NBINS];
+
+	/* Arena uptime. */
+	nstime_t		uptime;
+};
+
+static inline bool
+arena_stats_init(UNUSED tsdn_t *tsdn, arena_stats_t *arena_stats) {
+	if (config_debug) {
+		for (size_t i = 0; i < sizeof(arena_stats_t); i++) {
+			assert(((char *)arena_stats)[i] == 0);
+		}
+	}
+#ifndef JEMALLOC_ATOMIC_U64
+	if (malloc_mutex_init(&arena_stats->mtx, "arena_stats",
+	    WITNESS_RANK_ARENA_STATS, malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+#endif
+	/* Memory is zeroed, so there is no need to clear stats. */
+	return false;
+}
+
+static inline void
+arena_stats_lock(tsdn_t *tsdn, arena_stats_t *arena_stats) {
+#ifndef JEMALLOC_ATOMIC_U64
+	malloc_mutex_lock(tsdn, &arena_stats->mtx);
+#endif
+}
+
+static inline void
+arena_stats_unlock(tsdn_t *tsdn, arena_stats_t *arena_stats) {
+#ifndef JEMALLOC_ATOMIC_U64
+	malloc_mutex_unlock(tsdn, &arena_stats->mtx);
+#endif
+}
+
+static inline uint64_t
+arena_stats_read_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
+    arena_stats_u64_t *p) {
+#ifdef JEMALLOC_ATOMIC_U64
+	return atomic_load_u64(p, ATOMIC_RELAXED);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	return *p;
+#endif
+}
+
+static inline void
+arena_stats_add_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
+    arena_stats_u64_t *p, uint64_t x) {
+#ifdef JEMALLOC_ATOMIC_U64
+	atomic_fetch_add_u64(p, x, ATOMIC_RELAXED);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	*p += x;
+#endif
+}
+
+UNUSED static inline void
+arena_stats_sub_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
+    arena_stats_u64_t *p, uint64_t x) {
+#ifdef JEMALLOC_ATOMIC_U64
+	UNUSED uint64_t r = atomic_fetch_sub_u64(p, x, ATOMIC_RELAXED);
+	assert(r - x <= r);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	*p -= x;
+	assert(*p + x >= *p);
+#endif
+}
+
+/*
+ * Non-atomically sets *dst += src.  *dst needs external synchronization.
+ * This lets us avoid the cost of a fetch_add when its unnecessary (note that
+ * the types here are atomic).
+ */
+static inline void
+arena_stats_accum_u64(arena_stats_u64_t *dst, uint64_t src) {
+#ifdef JEMALLOC_ATOMIC_U64
+	uint64_t cur_dst = atomic_load_u64(dst, ATOMIC_RELAXED);
+	atomic_store_u64(dst, src + cur_dst, ATOMIC_RELAXED);
+#else
+	*dst += src;
+#endif
+}
+
+static inline size_t
+arena_stats_read_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p) {
+#ifdef JEMALLOC_ATOMIC_U64
+	return atomic_load_zu(p, ATOMIC_RELAXED);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	return atomic_load_zu(p, ATOMIC_RELAXED);
+#endif
+}
+
+static inline void
+arena_stats_add_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p,
+    size_t x) {
+#ifdef JEMALLOC_ATOMIC_U64
+	atomic_fetch_add_zu(p, x, ATOMIC_RELAXED);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	size_t cur = atomic_load_zu(p, ATOMIC_RELAXED);
+	atomic_store_zu(p, cur + x, ATOMIC_RELAXED);
+#endif
+}
+
+static inline void
+arena_stats_sub_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p,
+    size_t x) {
+#ifdef JEMALLOC_ATOMIC_U64
+	UNUSED size_t r = atomic_fetch_sub_zu(p, x, ATOMIC_RELAXED);
+	assert(r - x <= r);
+#else
+	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
+	size_t cur = atomic_load_zu(p, ATOMIC_RELAXED);
+	atomic_store_zu(p, cur - x, ATOMIC_RELAXED);
+#endif
+}
+
+/* Like the _u64 variant, needs an externally synchronized *dst. */
+static inline void
+arena_stats_accum_zu(atomic_zu_t *dst, size_t src) {
+	size_t cur_dst = atomic_load_zu(dst, ATOMIC_RELAXED);
+	atomic_store_zu(dst, src + cur_dst, ATOMIC_RELAXED);
+}
+
+static inline void
+arena_stats_large_nrequests_add(tsdn_t *tsdn, arena_stats_t *arena_stats,
+    szind_t szind, uint64_t nrequests) {
+	arena_stats_lock(tsdn, arena_stats);
+	arena_stats_add_u64(tsdn, arena_stats, &arena_stats->lstats[szind -
+	    NBINS].nrequests, nrequests);
+	arena_stats_unlock(tsdn, arena_stats);
+}
+
+static inline void
+arena_stats_mapped_add(tsdn_t *tsdn, arena_stats_t *arena_stats, size_t size) {
+	arena_stats_lock(tsdn, arena_stats);
+	arena_stats_add_zu(tsdn, arena_stats, &arena_stats->mapped, size);
+	arena_stats_unlock(tsdn, arena_stats);
+}
+
+
+#endif /* JEMALLOC_INTERNAL_ARENA_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
new file mode 100644
index 00000000..46aa77c8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
@@ -0,0 +1,11 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H
+#define JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H
+
+#include "jemalloc/internal/bitmap.h"
+
+struct arena_slab_data_s {
+	/* Per region allocated/deallocated bitmap. */
+	bitmap_t	bitmap[BITMAP_GROUPS_MAX];
+};
+
+#endif /* JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
new file mode 100644
index 00000000..38bc9596
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
@@ -0,0 +1,229 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H
+#define JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H
+
+#include "jemalloc/internal/arena_stats.h"
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/bin.h"
+#include "jemalloc/internal/bitmap.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/nstime.h"
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/smoothstep.h"
+#include "jemalloc/internal/ticker.h"
+
+struct arena_decay_s {
+	/* Synchronizes all non-atomic fields. */
+	malloc_mutex_t		mtx;
+	/*
+	 * True if a thread is currently purging the extents associated with
+	 * this decay structure.
+	 */
+	bool			purging;
+	/*
+	 * Approximate time in milliseconds from the creation of a set of unused
+	 * dirty pages until an equivalent set of unused dirty pages is purged
+	 * and/or reused.
+	 */
+	atomic_zd_t		time_ms;
+	/* time / SMOOTHSTEP_NSTEPS. */
+	nstime_t		interval;
+	/*
+	 * Time at which the current decay interval logically started.  We do
+	 * not actually advance to a new epoch until sometime after it starts
+	 * because of scheduling and computation delays, and it is even possible
+	 * to completely skip epochs.  In all cases, during epoch advancement we
+	 * merge all relevant activity into the most recently recorded epoch.
+	 */
+	nstime_t		epoch;
+	/* Deadline randomness generator. */
+	uint64_t		jitter_state;
+	/*
+	 * Deadline for current epoch.  This is the sum of interval and per
+	 * epoch jitter which is a uniform random variable in [0..interval).
+	 * Epochs always advance by precise multiples of interval, but we
+	 * randomize the deadline to reduce the likelihood of arenas purging in
+	 * lockstep.
+	 */
+	nstime_t		deadline;
+	/*
+	 * Number of unpurged pages at beginning of current epoch.  During epoch
+	 * advancement we use the delta between arena->decay_*.nunpurged and
+	 * extents_npages_get(&arena->extents_*) to determine how many dirty
+	 * pages, if any, were generated.
+	 */
+	size_t			nunpurged;
+	/*
+	 * Trailing log of how many unused dirty pages were generated during
+	 * each of the past SMOOTHSTEP_NSTEPS decay epochs, where the last
+	 * element is the most recent epoch.  Corresponding epoch times are
+	 * relative to epoch.
+	 */
+	size_t			backlog[SMOOTHSTEP_NSTEPS];
+
+	/*
+	 * Pointer to associated stats.  These stats are embedded directly in
+	 * the arena's stats due to how stats structures are shared between the
+	 * arena and ctl code.
+	 *
+	 * Synchronization: Same as associated arena's stats field. */
+	arena_stats_decay_t	*stats;
+	/* Peak number of pages in associated extents.  Used for debug only. */
+	uint64_t		ceil_npages;
+};
+
+struct arena_s {
+	/*
+	 * Number of threads currently assigned to this arena.  Each thread has
+	 * two distinct assignments, one for application-serving allocation, and
+	 * the other for internal metadata allocation.  Internal metadata must
+	 * not be allocated from arenas explicitly created via the arenas.create
+	 * mallctl, because the arena.<i>.reset mallctl indiscriminately
+	 * discards all allocations for the affected arena.
+	 *
+	 *   0: Application allocation.
+	 *   1: Internal metadata allocation.
+	 *
+	 * Synchronization: atomic.
+	 */
+	atomic_u_t		nthreads[2];
+
+	/*
+	 * When percpu_arena is enabled, to amortize the cost of reading /
+	 * updating the current CPU id, track the most recent thread accessing
+	 * this arena, and only read CPU if there is a mismatch.
+	 */
+	tsdn_t		*last_thd;
+
+	/* Synchronization: internal. */
+	arena_stats_t		stats;
+
+	/*
+	 * Lists of tcaches and cache_bin_array_descriptors for extant threads
+	 * associated with this arena.  Stats from these are merged
+	 * incrementally, and at exit if opt_stats_print is enabled.
+	 *
+	 * Synchronization: tcache_ql_mtx.
+	 */
+	ql_head(tcache_t)			tcache_ql;
+	ql_head(cache_bin_array_descriptor_t)	cache_bin_array_descriptor_ql;
+	malloc_mutex_t				tcache_ql_mtx;
+
+	/* Synchronization: internal. */
+	prof_accum_t		prof_accum;
+	uint64_t		prof_accumbytes;
+
+	/*
+	 * PRNG state for cache index randomization of large allocation base
+	 * pointers.
+	 *
+	 * Synchronization: atomic.
+	 */
+	atomic_zu_t		offset_state;
+
+	/*
+	 * Extent serial number generator state.
+	 *
+	 * Synchronization: atomic.
+	 */
+	atomic_zu_t		extent_sn_next;
+
+	/*
+	 * Represents a dss_prec_t, but atomically.
+	 *
+	 * Synchronization: atomic.
+	 */
+	atomic_u_t		dss_prec;
+
+	/*
+	 * Number of pages in active extents.
+	 *
+	 * Synchronization: atomic.
+	 */
+	atomic_zu_t		nactive;
+
+	/*
+	 * Extant large allocations.
+	 *
+	 * Synchronization: large_mtx.
+	 */
+	extent_list_t		large;
+	/* Synchronizes all large allocation/update/deallocation. */
+	malloc_mutex_t		large_mtx;
+
+	/*
+	 * Collections of extents that were previously allocated.  These are
+	 * used when allocating extents, in an attempt to re-use address space.
+	 *
+	 * Synchronization: internal.
+	 */
+	extents_t		extents_dirty;
+	extents_t		extents_muzzy;
+	extents_t		extents_retained;
+
+	/*
+	 * Decay-based purging state, responsible for scheduling extent state
+	 * transitions.
+	 *
+	 * Synchronization: internal.
+	 */
+	arena_decay_t		decay_dirty; /* dirty --> muzzy */
+	arena_decay_t		decay_muzzy; /* muzzy --> retained */
+
+	/*
+	 * Next extent size class in a growing series to use when satisfying a
+	 * request via the extent hooks (only if opt_retain).  This limits the
+	 * number of disjoint virtual memory ranges so that extent merging can
+	 * be effective even if multiple arenas' extent allocation requests are
+	 * highly interleaved.
+	 *
+	 * retain_grow_limit is the max allowed size ind to expand (unless the
+	 * required size is greater).  Default is no limit, and controlled
+	 * through mallctl only.
+	 *
+	 * Synchronization: extent_grow_mtx
+	 */
+	pszind_t		extent_grow_next;
+	pszind_t		retain_grow_limit;
+	malloc_mutex_t		extent_grow_mtx;
+
+	/*
+	 * Available extent structures that were allocated via
+	 * base_alloc_extent().
+	 *
+	 * Synchronization: extent_avail_mtx.
+	 */
+	extent_tree_t		extent_avail;
+	malloc_mutex_t		extent_avail_mtx;
+
+	/*
+	 * bins is used to store heaps of free regions.
+	 *
+	 * Synchronization: internal.
+	 */
+	bin_t			bins[NBINS];
+
+	/*
+	 * Base allocator, from which arena metadata are allocated.
+	 *
+	 * Synchronization: internal.
+	 */
+	base_t			*base;
+	/* Used to determine uptime.  Read-only after initialization. */
+	nstime_t		create_time;
+};
+
+/* Used in conjunction with tsd for fast arena-related context lookup. */
+struct arena_tdata_s {
+	ticker_t		decay_ticker;
+};
+
+/* Used to pass rtree lookup context down the path. */
+struct alloc_ctx_s {
+	szind_t szind;
+	bool slab;
+};
+
+#endif /* JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
new file mode 100644
index 00000000..70001b5f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
@@ -0,0 +1,43 @@
+#ifndef JEMALLOC_INTERNAL_ARENA_TYPES_H
+#define JEMALLOC_INTERNAL_ARENA_TYPES_H
+
+/* Maximum number of regions in one slab. */
+#define LG_SLAB_MAXREGS		(LG_PAGE - LG_TINY_MIN)
+#define SLAB_MAXREGS		(1U << LG_SLAB_MAXREGS)
+
+/* Default decay times in milliseconds. */
+#define DIRTY_DECAY_MS_DEFAULT	ZD(10 * 1000)
+#define MUZZY_DECAY_MS_DEFAULT	ZD(10 * 1000)
+/* Number of event ticks between time checks. */
+#define DECAY_NTICKS_PER_UPDATE	1000
+
+typedef struct arena_slab_data_s arena_slab_data_t;
+typedef struct arena_decay_s arena_decay_t;
+typedef struct arena_s arena_t;
+typedef struct arena_tdata_s arena_tdata_t;
+typedef struct alloc_ctx_s alloc_ctx_t;
+
+typedef enum {
+	percpu_arena_mode_names_base   = 0, /* Used for options processing. */
+
+	/*
+	 * *_uninit are used only during bootstrapping, and must correspond
+	 * to initialized variant plus percpu_arena_mode_enabled_base.
+	 */
+	percpu_arena_uninit            = 0,
+	per_phycpu_arena_uninit        = 1,
+
+	/* All non-disabled modes must come after percpu_arena_disabled. */
+	percpu_arena_disabled          = 2,
+
+	percpu_arena_mode_names_limit  = 3, /* Used for options processing. */
+	percpu_arena_mode_enabled_base = 3,
+
+	percpu_arena                   = 3,
+	per_phycpu_arena               = 4  /* Hyper threads share arena. */
+} percpu_arena_mode_t;
+
+#define PERCPU_ARENA_ENABLED(m)	((m) >= percpu_arena_mode_enabled_base)
+#define PERCPU_ARENA_DEFAULT	percpu_arena_disabled
+
+#endif /* JEMALLOC_INTERNAL_ARENA_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
new file mode 100644
index 00000000..be4d45b3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
@@ -0,0 +1,56 @@
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/util.h"
+
+/*
+ * Define a custom assert() in order to reduce the chances of deadlock during
+ * assertion failure.
+ */
+#ifndef assert
+#define assert(e) do {							\
+	if (unlikely(config_debug && !(e))) {				\
+		malloc_printf(						\
+		    "<jemalloc>: %s:%d: Failed assertion: \"%s\"\n",	\
+		    __FILE__, __LINE__, #e);				\
+		abort();						\
+	}								\
+} while (0)
+#endif
+
+#ifndef not_reached
+#define not_reached() do {						\
+	if (config_debug) {						\
+		malloc_printf(						\
+		    "<jemalloc>: %s:%d: Unreachable code reached\n",	\
+		    __FILE__, __LINE__);				\
+		abort();						\
+	}								\
+	unreachable();							\
+} while (0)
+#endif
+
+#ifndef not_implemented
+#define not_implemented() do {						\
+	if (config_debug) {						\
+		malloc_printf("<jemalloc>: %s:%d: Not implemented\n",	\
+		    __FILE__, __LINE__);				\
+		abort();						\
+	}								\
+} while (0)
+#endif
+
+#ifndef assert_not_implemented
+#define assert_not_implemented(e) do {					\
+	if (unlikely(config_debug && !(e))) {				\
+		not_implemented();					\
+	}								\
+} while (0)
+#endif
+
+/* Use to assert a particular configuration, e.g., cassert(config_debug). */
+#ifndef cassert
+#define cassert(c) do {							\
+	if (unlikely(!(c))) {						\
+		not_reached();						\
+	}								\
+} while (0)
+#endif
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
new file mode 100644
index 00000000..adadb1a3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
@@ -0,0 +1,77 @@
+#ifndef JEMALLOC_INTERNAL_ATOMIC_H
+#define JEMALLOC_INTERNAL_ATOMIC_H
+
+#define ATOMIC_INLINE static inline
+
+#if defined(JEMALLOC_GCC_ATOMIC_ATOMICS)
+#  include "jemalloc/internal/atomic_gcc_atomic.h"
+#elif defined(JEMALLOC_GCC_SYNC_ATOMICS)
+#  include "jemalloc/internal/atomic_gcc_sync.h"
+#elif defined(_MSC_VER)
+#  include "jemalloc/internal/atomic_msvc.h"
+#elif defined(JEMALLOC_C11_ATOMICS)
+#  include "jemalloc/internal/atomic_c11.h"
+#else
+#  error "Don't have atomics implemented on this platform."
+#endif
+
+/*
+ * This header gives more or less a backport of C11 atomics. The user can write
+ * JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_sizeof_type); to generate
+ * counterparts of the C11 atomic functions for type, as so:
+ *   JEMALLOC_GENERATE_ATOMICS(int *, pi, 3);
+ * and then write things like:
+ *   int *some_ptr;
+ *   atomic_pi_t atomic_ptr_to_int;
+ *   atomic_store_pi(&atomic_ptr_to_int, some_ptr, ATOMIC_RELAXED);
+ *   int *prev_value = atomic_exchange_pi(&ptr_to_int, NULL, ATOMIC_ACQ_REL);
+ *   assert(some_ptr == prev_value);
+ * and expect things to work in the obvious way.
+ *
+ * Also included (with naming differences to avoid conflicts with the standard
+ * library):
+ *   atomic_fence(atomic_memory_order_t) (mimics C11's atomic_thread_fence).
+ *   ATOMIC_INIT (mimics C11's ATOMIC_VAR_INIT).
+ */
+
+/*
+ * Pure convenience, so that we don't have to type "atomic_memory_order_"
+ * quite so often.
+ */
+#define ATOMIC_RELAXED atomic_memory_order_relaxed
+#define ATOMIC_ACQUIRE atomic_memory_order_acquire
+#define ATOMIC_RELEASE atomic_memory_order_release
+#define ATOMIC_ACQ_REL atomic_memory_order_acq_rel
+#define ATOMIC_SEQ_CST atomic_memory_order_seq_cst
+
+/*
+ * Not all platforms have 64-bit atomics.  If we do, this #define exposes that
+ * fact.
+ */
+#if (LG_SIZEOF_PTR == 3 || LG_SIZEOF_INT == 3)
+#  define JEMALLOC_ATOMIC_U64
+#endif
+
+JEMALLOC_GENERATE_ATOMICS(void *, p, LG_SIZEOF_PTR)
+
+/*
+ * There's no actual guarantee that sizeof(bool) == 1, but it's true on the only
+ * platform that actually needs to know the size, MSVC.
+ */
+JEMALLOC_GENERATE_ATOMICS(bool, b, 0)
+
+JEMALLOC_GENERATE_INT_ATOMICS(unsigned, u, LG_SIZEOF_INT)
+
+JEMALLOC_GENERATE_INT_ATOMICS(size_t, zu, LG_SIZEOF_PTR)
+
+JEMALLOC_GENERATE_INT_ATOMICS(ssize_t, zd, LG_SIZEOF_PTR)
+
+JEMALLOC_GENERATE_INT_ATOMICS(uint32_t, u32, 2)
+
+#ifdef JEMALLOC_ATOMIC_U64
+JEMALLOC_GENERATE_INT_ATOMICS(uint64_t, u64, 3)
+#endif
+
+#undef ATOMIC_INLINE
+
+#endif /* JEMALLOC_INTERNAL_ATOMIC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
new file mode 100644
index 00000000..a5f9313a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
@@ -0,0 +1,97 @@
+#ifndef JEMALLOC_INTERNAL_ATOMIC_C11_H
+#define JEMALLOC_INTERNAL_ATOMIC_C11_H
+
+#include <stdatomic.h>
+
+#define ATOMIC_INIT(...) ATOMIC_VAR_INIT(__VA_ARGS__)
+
+#define atomic_memory_order_t memory_order
+#define atomic_memory_order_relaxed memory_order_relaxed
+#define atomic_memory_order_acquire memory_order_acquire
+#define atomic_memory_order_release memory_order_release
+#define atomic_memory_order_acq_rel memory_order_acq_rel
+#define atomic_memory_order_seq_cst memory_order_seq_cst
+
+#define atomic_fence atomic_thread_fence
+
+#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
+    /* unused */ lg_size)						\
+typedef _Atomic(type) atomic_##short_type##_t;				\
+									\
+ATOMIC_INLINE type							\
+atomic_load_##short_type(const atomic_##short_type##_t *a,		\
+    atomic_memory_order_t mo) {						\
+	/*								\
+	 * A strict interpretation of the C standard prevents		\
+	 * atomic_load from taking a const argument, but it's		\
+	 * convenient for our purposes. This cast is a workaround.	\
+	 */								\
+	atomic_##short_type##_t* a_nonconst =				\
+	    (atomic_##short_type##_t*)a;				\
+	return atomic_load_explicit(a_nonconst, mo);			\
+}									\
+									\
+ATOMIC_INLINE void							\
+atomic_store_##short_type(atomic_##short_type##_t *a,			\
+    type val, atomic_memory_order_t mo) {				\
+	atomic_store_explicit(a, val, mo);				\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return atomic_exchange_explicit(a, val, mo);			\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	return atomic_compare_exchange_weak_explicit(a, expected,	\
+	    desired, success_mo, failure_mo);				\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	return atomic_compare_exchange_strong_explicit(a, expected,	\
+	    desired, success_mo, failure_mo);				\
+}
+
+/*
+ * Integral types have some special operations available that non-integral ones
+ * lack.
+ */
+#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type, 		\
+    /* unused */ lg_size)						\
+JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_add_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return atomic_fetch_add_explicit(a, val, mo);			\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_sub_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return atomic_fetch_sub_explicit(a, val, mo);			\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_and_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return atomic_fetch_and_explicit(a, val, mo);			\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_or_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return atomic_fetch_or_explicit(a, val, mo);			\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_xor_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return atomic_fetch_xor_explicit(a, val, mo);			\
+}
+
+#endif /* JEMALLOC_INTERNAL_ATOMIC_C11_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
new file mode 100644
index 00000000..6b73a14f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
@@ -0,0 +1,127 @@
+#ifndef JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H
+#define JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H
+
+#include "jemalloc/internal/assert.h"
+
+#define ATOMIC_INIT(...) {__VA_ARGS__}
+
+typedef enum {
+	atomic_memory_order_relaxed,
+	atomic_memory_order_acquire,
+	atomic_memory_order_release,
+	atomic_memory_order_acq_rel,
+	atomic_memory_order_seq_cst
+} atomic_memory_order_t;
+
+ATOMIC_INLINE int
+atomic_enum_to_builtin(atomic_memory_order_t mo) {
+	switch (mo) {
+	case atomic_memory_order_relaxed:
+		return __ATOMIC_RELAXED;
+	case atomic_memory_order_acquire:
+		return __ATOMIC_ACQUIRE;
+	case atomic_memory_order_release:
+		return __ATOMIC_RELEASE;
+	case atomic_memory_order_acq_rel:
+		return __ATOMIC_ACQ_REL;
+	case atomic_memory_order_seq_cst:
+		return __ATOMIC_SEQ_CST;
+	}
+	/* Can't happen; the switch is exhaustive. */
+	not_reached();
+}
+
+ATOMIC_INLINE void
+atomic_fence(atomic_memory_order_t mo) {
+	__atomic_thread_fence(atomic_enum_to_builtin(mo));
+}
+
+#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
+    /* unused */ lg_size)						\
+typedef struct {							\
+	type repr;							\
+} atomic_##short_type##_t;						\
+									\
+ATOMIC_INLINE type							\
+atomic_load_##short_type(const atomic_##short_type##_t *a,		\
+    atomic_memory_order_t mo) {						\
+	type result;							\
+	__atomic_load(&a->repr, &result, atomic_enum_to_builtin(mo));	\
+	return result;							\
+}									\
+									\
+ATOMIC_INLINE void							\
+atomic_store_##short_type(atomic_##short_type##_t *a, type val,		\
+    atomic_memory_order_t mo) {						\
+	__atomic_store(&a->repr, &val, atomic_enum_to_builtin(mo));	\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	type result;							\
+	__atomic_exchange(&a->repr, &val, &result,			\
+	    atomic_enum_to_builtin(mo));				\
+	return result;							\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	return __atomic_compare_exchange(&a->repr, expected, &desired,	\
+	    true, atomic_enum_to_builtin(success_mo),			\
+	    atomic_enum_to_builtin(failure_mo));			\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	return __atomic_compare_exchange(&a->repr, expected, &desired,	\
+	    false,							\
+	    atomic_enum_to_builtin(success_mo),				\
+	    atomic_enum_to_builtin(failure_mo));			\
+}
+
+
+#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type,			\
+    /* unused */ lg_size)						\
+JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_add_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __atomic_fetch_add(&a->repr, val,			\
+	    atomic_enum_to_builtin(mo));				\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_sub_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __atomic_fetch_sub(&a->repr, val,			\
+	    atomic_enum_to_builtin(mo));				\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_and_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __atomic_fetch_and(&a->repr, val,			\
+	    atomic_enum_to_builtin(mo));				\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_or_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __atomic_fetch_or(&a->repr, val,				\
+	    atomic_enum_to_builtin(mo));				\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_xor_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __atomic_fetch_xor(&a->repr, val,			\
+	    atomic_enum_to_builtin(mo));				\
+}
+
+#endif /* JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
new file mode 100644
index 00000000..30846e4d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
@@ -0,0 +1,191 @@
+#ifndef JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H
+#define JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H
+
+#define ATOMIC_INIT(...) {__VA_ARGS__}
+
+typedef enum {
+	atomic_memory_order_relaxed,
+	atomic_memory_order_acquire,
+	atomic_memory_order_release,
+	atomic_memory_order_acq_rel,
+	atomic_memory_order_seq_cst
+} atomic_memory_order_t;
+
+ATOMIC_INLINE void
+atomic_fence(atomic_memory_order_t mo) {
+	/* Easy cases first: no barrier, and full barrier. */
+	if (mo == atomic_memory_order_relaxed) {
+		asm volatile("" ::: "memory");
+		return;
+	}
+	if (mo == atomic_memory_order_seq_cst) {
+		asm volatile("" ::: "memory");
+		__sync_synchronize();
+		asm volatile("" ::: "memory");
+		return;
+	}
+	asm volatile("" ::: "memory");
+#  if defined(__i386__) || defined(__x86_64__)
+	/* This is implicit on x86. */
+#  elif defined(__ppc__)
+	asm volatile("lwsync");
+#  elif defined(__sparc__) && defined(__arch64__)
+	if (mo == atomic_memory_order_acquire) {
+		asm volatile("membar #LoadLoad | #LoadStore");
+	} else if (mo == atomic_memory_order_release) {
+		asm volatile("membar #LoadStore | #StoreStore");
+	} else {
+		asm volatile("membar #LoadLoad | #LoadStore | #StoreStore");
+	}
+#  else
+	__sync_synchronize();
+#  endif
+	asm volatile("" ::: "memory");
+}
+
+/*
+ * A correct implementation of seq_cst loads and stores on weakly ordered
+ * architectures could do either of the following:
+ *   1. store() is weak-fence -> store -> strong fence, load() is load ->
+ *      strong-fence.
+ *   2. store() is strong-fence -> store, load() is strong-fence -> load ->
+ *      weak-fence.
+ * The tricky thing is, load() and store() above can be the load or store
+ * portions of a gcc __sync builtin, so we have to follow GCC's lead, which
+ * means going with strategy 2.
+ * On strongly ordered architectures, the natural strategy is to stick a strong
+ * fence after seq_cst stores, and have naked loads.  So we want the strong
+ * fences in different places on different architectures.
+ * atomic_pre_sc_load_fence and atomic_post_sc_store_fence allow us to
+ * accomplish this.
+ */
+
+ATOMIC_INLINE void
+atomic_pre_sc_load_fence() {
+#  if defined(__i386__) || defined(__x86_64__) ||			\
+    (defined(__sparc__) && defined(__arch64__))
+	atomic_fence(atomic_memory_order_relaxed);
+#  else
+	atomic_fence(atomic_memory_order_seq_cst);
+#  endif
+}
+
+ATOMIC_INLINE void
+atomic_post_sc_store_fence() {
+#  if defined(__i386__) || defined(__x86_64__) ||			\
+    (defined(__sparc__) && defined(__arch64__))
+	atomic_fence(atomic_memory_order_seq_cst);
+#  else
+	atomic_fence(atomic_memory_order_relaxed);
+#  endif
+
+}
+
+#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
+    /* unused */ lg_size)						\
+typedef struct {							\
+	type volatile repr;						\
+} atomic_##short_type##_t;						\
+									\
+ATOMIC_INLINE type							\
+atomic_load_##short_type(const atomic_##short_type##_t *a,		\
+    atomic_memory_order_t mo) {						\
+	if (mo == atomic_memory_order_seq_cst) {			\
+		atomic_pre_sc_load_fence();				\
+	}								\
+	type result = a->repr;						\
+	if (mo != atomic_memory_order_relaxed) {			\
+		atomic_fence(atomic_memory_order_acquire);		\
+	}								\
+	return result;							\
+}									\
+									\
+ATOMIC_INLINE void							\
+atomic_store_##short_type(atomic_##short_type##_t *a,			\
+    type val, atomic_memory_order_t mo) {				\
+	if (mo != atomic_memory_order_relaxed) {			\
+		atomic_fence(atomic_memory_order_release);		\
+	}								\
+	a->repr = val;							\
+	if (mo == atomic_memory_order_seq_cst) {			\
+		atomic_post_sc_store_fence();				\
+	}								\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	/*								\
+	 * Because of FreeBSD, we care about gcc 4.2, which doesn't have\
+	 * an atomic exchange builtin.  We fake it with a CAS loop.	\
+	 */								\
+	while (true) {							\
+		type old = a->repr;					\
+		if (__sync_bool_compare_and_swap(&a->repr, old, val)) {	\
+			return old;					\
+		}							\
+	}								\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	type prev = __sync_val_compare_and_swap(&a->repr, *expected,	\
+	    desired);							\
+	if (prev == *expected) {					\
+		return true;						\
+	} else {							\
+		*expected = prev;					\
+		return false;						\
+	}								\
+}									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	type prev = __sync_val_compare_and_swap(&a->repr, *expected,	\
+	    desired);							\
+	if (prev == *expected) {					\
+		return true;						\
+	} else {							\
+		*expected = prev;					\
+		return false;						\
+	}								\
+}
+
+#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type,			\
+    /* unused */ lg_size)						\
+JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_add_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __sync_fetch_and_add(&a->repr, val);			\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_sub_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __sync_fetch_and_sub(&a->repr, val);			\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_and_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __sync_fetch_and_and(&a->repr, val);			\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_or_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __sync_fetch_and_or(&a->repr, val);			\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_xor_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return __sync_fetch_and_xor(&a->repr, val);			\
+}
+
+#endif /* JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
new file mode 100644
index 00000000..67057ce5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
@@ -0,0 +1,158 @@
+#ifndef JEMALLOC_INTERNAL_ATOMIC_MSVC_H
+#define JEMALLOC_INTERNAL_ATOMIC_MSVC_H
+
+#define ATOMIC_INIT(...) {__VA_ARGS__}
+
+typedef enum {
+	atomic_memory_order_relaxed,
+	atomic_memory_order_acquire,
+	atomic_memory_order_release,
+	atomic_memory_order_acq_rel,
+	atomic_memory_order_seq_cst
+} atomic_memory_order_t;
+
+typedef char atomic_repr_0_t;
+typedef short atomic_repr_1_t;
+typedef long atomic_repr_2_t;
+typedef __int64 atomic_repr_3_t;
+
+ATOMIC_INLINE void
+atomic_fence(atomic_memory_order_t mo) {
+	_ReadWriteBarrier();
+#  if defined(_M_ARM) || defined(_M_ARM64)
+	/* ARM needs a barrier for everything but relaxed. */
+	if (mo != atomic_memory_order_relaxed) {
+		MemoryBarrier();
+	}
+#  elif defined(_M_IX86) || defined (_M_X64)
+	/* x86 needs a barrier only for seq_cst. */
+	if (mo == atomic_memory_order_seq_cst) {
+		MemoryBarrier();
+	}
+#  else
+#  error "Don't know how to create atomics for this platform for MSVC."
+#  endif
+	_ReadWriteBarrier();
+}
+
+#define ATOMIC_INTERLOCKED_REPR(lg_size) atomic_repr_ ## lg_size ## _t
+
+#define ATOMIC_CONCAT(a, b) ATOMIC_RAW_CONCAT(a, b)
+#define ATOMIC_RAW_CONCAT(a, b) a ## b
+
+#define ATOMIC_INTERLOCKED_NAME(base_name, lg_size) ATOMIC_CONCAT(	\
+    base_name, ATOMIC_INTERLOCKED_SUFFIX(lg_size))
+
+#define ATOMIC_INTERLOCKED_SUFFIX(lg_size)				\
+    ATOMIC_CONCAT(ATOMIC_INTERLOCKED_SUFFIX_, lg_size)
+
+#define ATOMIC_INTERLOCKED_SUFFIX_0 8
+#define ATOMIC_INTERLOCKED_SUFFIX_1 16
+#define ATOMIC_INTERLOCKED_SUFFIX_2
+#define ATOMIC_INTERLOCKED_SUFFIX_3 64
+
+#define JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_size)		\
+typedef struct {							\
+	ATOMIC_INTERLOCKED_REPR(lg_size) repr;				\
+} atomic_##short_type##_t;						\
+									\
+ATOMIC_INLINE type							\
+atomic_load_##short_type(const atomic_##short_type##_t *a,		\
+    atomic_memory_order_t mo) {						\
+	ATOMIC_INTERLOCKED_REPR(lg_size) ret = a->repr;			\
+	if (mo != atomic_memory_order_relaxed) {			\
+		atomic_fence(atomic_memory_order_acquire);		\
+	}								\
+	return (type) ret;						\
+}									\
+									\
+ATOMIC_INLINE void							\
+atomic_store_##short_type(atomic_##short_type##_t *a,			\
+    type val, atomic_memory_order_t mo) {				\
+	if (mo != atomic_memory_order_relaxed) {			\
+		atomic_fence(atomic_memory_order_release);		\
+	}								\
+	a->repr = (ATOMIC_INTERLOCKED_REPR(lg_size)) val;		\
+	if (mo == atomic_memory_order_seq_cst) {			\
+		atomic_fence(atomic_memory_order_seq_cst);		\
+	}								\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
+    atomic_memory_order_t mo) {						\
+	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedExchange,	\
+	    lg_size)(&a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);	\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	ATOMIC_INTERLOCKED_REPR(lg_size) e =				\
+	    (ATOMIC_INTERLOCKED_REPR(lg_size))*expected;		\
+	ATOMIC_INTERLOCKED_REPR(lg_size) d =				\
+	    (ATOMIC_INTERLOCKED_REPR(lg_size))desired;			\
+	ATOMIC_INTERLOCKED_REPR(lg_size) old =				\
+	    ATOMIC_INTERLOCKED_NAME(_InterlockedCompareExchange, 	\
+		lg_size)(&a->repr, d, e);				\
+	if (old == e) {							\
+		return true;						\
+	} else {							\
+		*expected = (type)old;					\
+		return false;						\
+	}								\
+}									\
+									\
+ATOMIC_INLINE bool							\
+atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
+    type *expected, type desired, atomic_memory_order_t success_mo,	\
+    atomic_memory_order_t failure_mo) {					\
+	/* We implement the weak version with strong semantics. */	\
+	return atomic_compare_exchange_weak_##short_type(a, expected,	\
+	    desired, success_mo, failure_mo);				\
+}
+
+
+#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type, lg_size)	\
+JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_size)			\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_add_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedExchangeAdd,	\
+	    lg_size)(&a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);	\
+}									\
+									\
+ATOMIC_INLINE type							\
+atomic_fetch_sub_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	/*								\
+	 * MSVC warns on negation of unsigned operands, but for us it	\
+	 * gives exactly the right semantics (MAX_TYPE + 1 - operand).	\
+	 */								\
+	__pragma(warning(push))						\
+	__pragma(warning(disable: 4146))				\
+	return atomic_fetch_add_##short_type(a, -val, mo);		\
+	__pragma(warning(pop))						\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_and_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedAnd, lg_size)(	\
+	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_or_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedOr, lg_size)(	\
+	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
+}									\
+ATOMIC_INLINE type							\
+atomic_fetch_xor_##short_type(atomic_##short_type##_t *a,		\
+    type val, atomic_memory_order_t mo) {				\
+	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedXor, lg_size)(	\
+	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
+}
+
+#endif /* JEMALLOC_INTERNAL_ATOMIC_MSVC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
new file mode 100644
index 00000000..3209aa49
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
@@ -0,0 +1,33 @@
+#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H
+#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H
+
+extern bool opt_background_thread;
+extern size_t opt_max_background_threads;
+extern malloc_mutex_t background_thread_lock;
+extern atomic_b_t background_thread_enabled_state;
+extern size_t n_background_threads;
+extern size_t max_background_threads;
+extern background_thread_info_t *background_thread_info;
+extern bool can_enable_background_thread;
+
+bool background_thread_create(tsd_t *tsd, unsigned arena_ind);
+bool background_threads_enable(tsd_t *tsd);
+bool background_threads_disable(tsd_t *tsd);
+void background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
+    arena_decay_t *decay, size_t npages_new);
+void background_thread_prefork0(tsdn_t *tsdn);
+void background_thread_prefork1(tsdn_t *tsdn);
+void background_thread_postfork_parent(tsdn_t *tsdn);
+void background_thread_postfork_child(tsdn_t *tsdn);
+bool background_thread_stats_read(tsdn_t *tsdn,
+    background_thread_stats_t *stats);
+void background_thread_ctl_init(tsdn_t *tsdn);
+
+#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
+extern int pthread_create_wrapper(pthread_t *__restrict, const pthread_attr_t *,
+    void *(*)(void *), void *__restrict);
+#endif
+bool background_thread_boot0(void);
+bool background_thread_boot1(tsdn_t *tsdn);
+
+#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
new file mode 100644
index 00000000..ef50231e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
@@ -0,0 +1,57 @@
+#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H
+#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H
+
+JEMALLOC_ALWAYS_INLINE bool
+background_thread_enabled(void) {
+	return atomic_load_b(&background_thread_enabled_state, ATOMIC_RELAXED);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+background_thread_enabled_set(tsdn_t *tsdn, bool state) {
+	malloc_mutex_assert_owner(tsdn, &background_thread_lock);
+	atomic_store_b(&background_thread_enabled_state, state, ATOMIC_RELAXED);
+}
+
+JEMALLOC_ALWAYS_INLINE background_thread_info_t *
+arena_background_thread_info_get(arena_t *arena) {
+	unsigned arena_ind = arena_ind_get(arena);
+	return &background_thread_info[arena_ind % ncpus];
+}
+
+JEMALLOC_ALWAYS_INLINE uint64_t
+background_thread_wakeup_time_get(background_thread_info_t *info) {
+	uint64_t next_wakeup = nstime_ns(&info->next_wakeup);
+	assert(atomic_load_b(&info->indefinite_sleep, ATOMIC_ACQUIRE) ==
+	    (next_wakeup == BACKGROUND_THREAD_INDEFINITE_SLEEP));
+	return next_wakeup;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+background_thread_wakeup_time_set(tsdn_t *tsdn, background_thread_info_t *info,
+    uint64_t wakeup_time) {
+	malloc_mutex_assert_owner(tsdn, &info->mtx);
+	atomic_store_b(&info->indefinite_sleep,
+	    wakeup_time == BACKGROUND_THREAD_INDEFINITE_SLEEP, ATOMIC_RELEASE);
+	nstime_init(&info->next_wakeup, wakeup_time);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+background_thread_indefinite_sleep(background_thread_info_t *info) {
+	return atomic_load_b(&info->indefinite_sleep, ATOMIC_ACQUIRE);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+arena_background_thread_inactivity_check(tsdn_t *tsdn, arena_t *arena,
+    bool is_background_thread) {
+	if (!background_thread_enabled() || is_background_thread) {
+		return;
+	}
+	background_thread_info_t *info =
+	    arena_background_thread_info_get(arena);
+	if (background_thread_indefinite_sleep(info)) {
+		background_thread_interval_check(tsdn, arena,
+		    &arena->decay_dirty, 0);
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
new file mode 100644
index 00000000..c1107dfe
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
@@ -0,0 +1,53 @@
+#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H
+#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H
+
+/* This file really combines "structs" and "types", but only transitionally. */
+
+#if defined(JEMALLOC_BACKGROUND_THREAD) || defined(JEMALLOC_LAZY_LOCK)
+#  define JEMALLOC_PTHREAD_CREATE_WRAPPER
+#endif
+
+#define BACKGROUND_THREAD_INDEFINITE_SLEEP UINT64_MAX
+#define MAX_BACKGROUND_THREAD_LIMIT MALLOCX_ARENA_LIMIT
+
+typedef enum {
+	background_thread_stopped,
+	background_thread_started,
+	/* Thread waits on the global lock when paused (for arena_reset). */
+	background_thread_paused,
+} background_thread_state_t;
+
+struct background_thread_info_s {
+#ifdef JEMALLOC_BACKGROUND_THREAD
+	/* Background thread is pthread specific. */
+	pthread_t		thread;
+	pthread_cond_t		cond;
+#endif
+	malloc_mutex_t		mtx;
+	background_thread_state_t	state;
+	/* When true, it means no wakeup scheduled. */
+	atomic_b_t		indefinite_sleep;
+	/* Next scheduled wakeup time (absolute time in ns). */
+	nstime_t		next_wakeup;
+	/*
+	 *  Since the last background thread run, newly added number of pages
+	 *  that need to be purged by the next wakeup.  This is adjusted on
+	 *  epoch advance, and is used to determine whether we should signal the
+	 *  background thread to wake up earlier.
+	 */
+	size_t			npages_to_purge_new;
+	/* Stats: total number of runs since started. */
+	uint64_t		tot_n_runs;
+	/* Stats: total sleep time since started. */
+	nstime_t		tot_sleep_time;
+};
+typedef struct background_thread_info_s background_thread_info_t;
+
+struct background_thread_stats_s {
+	size_t num_threads;
+	uint64_t num_runs;
+	nstime_t run_interval;
+};
+typedef struct background_thread_stats_s background_thread_stats_t;
+
+#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
new file mode 100644
index 00000000..7b705c9b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
@@ -0,0 +1,22 @@
+#ifndef JEMALLOC_INTERNAL_BASE_EXTERNS_H
+#define JEMALLOC_INTERNAL_BASE_EXTERNS_H
+
+extern metadata_thp_mode_t opt_metadata_thp;
+extern const char *metadata_thp_mode_names[];
+
+base_t *b0get(void);
+base_t *base_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
+void base_delete(tsdn_t *tsdn, base_t *base);
+extent_hooks_t *base_extent_hooks_get(base_t *base);
+extent_hooks_t *base_extent_hooks_set(base_t *base,
+    extent_hooks_t *extent_hooks);
+void *base_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment);
+extent_t *base_alloc_extent(tsdn_t *tsdn, base_t *base);
+void base_stats_get(tsdn_t *tsdn, base_t *base, size_t *allocated,
+    size_t *resident, size_t *mapped, size_t *n_thp);
+void base_prefork(tsdn_t *tsdn, base_t *base);
+void base_postfork_parent(tsdn_t *tsdn, base_t *base);
+void base_postfork_child(tsdn_t *tsdn, base_t *base);
+bool base_boot(tsdn_t *tsdn);
+
+#endif /* JEMALLOC_INTERNAL_BASE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
new file mode 100644
index 00000000..aec0e2e1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
@@ -0,0 +1,13 @@
+#ifndef JEMALLOC_INTERNAL_BASE_INLINES_H
+#define JEMALLOC_INTERNAL_BASE_INLINES_H
+
+static inline unsigned
+base_ind_get(const base_t *base) {
+	return base->ind;
+}
+
+static inline bool
+metadata_thp_enabled(void) {
+	return (opt_metadata_thp != metadata_thp_disabled);
+}
+#endif /* JEMALLOC_INTERNAL_BASE_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
new file mode 100644
index 00000000..2102247a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
@@ -0,0 +1,59 @@
+#ifndef JEMALLOC_INTERNAL_BASE_STRUCTS_H
+#define JEMALLOC_INTERNAL_BASE_STRUCTS_H
+
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/size_classes.h"
+
+/* Embedded at the beginning of every block of base-managed virtual memory. */
+struct base_block_s {
+	/* Total size of block's virtual memory mapping. */
+	size_t		size;
+
+	/* Next block in list of base's blocks. */
+	base_block_t	*next;
+
+	/* Tracks unused trailing space. */
+	extent_t	extent;
+};
+
+struct base_s {
+	/* Associated arena's index within the arenas array. */
+	unsigned	ind;
+
+	/*
+	 * User-configurable extent hook functions.  Points to an
+	 * extent_hooks_t.
+	 */
+	atomic_p_t	extent_hooks;
+
+	/* Protects base_alloc() and base_stats_get() operations. */
+	malloc_mutex_t	mtx;
+
+	/* Using THP when true (metadata_thp auto mode). */
+	bool		auto_thp_switched;
+	/*
+	 * Most recent size class in the series of increasingly large base
+	 * extents.  Logarithmic spacing between subsequent allocations ensures
+	 * that the total number of distinct mappings remains small.
+	 */
+	pszind_t	pind_last;
+
+	/* Serial number generation state. */
+	size_t		extent_sn_next;
+
+	/* Chain of all blocks associated with base. */
+	base_block_t	*blocks;
+
+	/* Heap of extents that track unused trailing space within blocks. */
+	extent_heap_t	avail[NSIZES];
+
+	/* Stats, only maintained if config_stats. */
+	size_t		allocated;
+	size_t		resident;
+	size_t		mapped;
+	/* Number of THP regions touched. */
+	size_t		n_thp;
+};
+
+#endif /* JEMALLOC_INTERNAL_BASE_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
new file mode 100644
index 00000000..b6db77df
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
@@ -0,0 +1,33 @@
+#ifndef JEMALLOC_INTERNAL_BASE_TYPES_H
+#define JEMALLOC_INTERNAL_BASE_TYPES_H
+
+typedef struct base_block_s base_block_t;
+typedef struct base_s base_t;
+
+#define METADATA_THP_DEFAULT metadata_thp_disabled
+
+/*
+ * In auto mode, arenas switch to huge pages for the base allocator on the
+ * second base block.  a0 switches to thp on the 5th block (after 20 megabytes
+ * of metadata), since more metadata (e.g. rtree nodes) come from a0's base.
+ */
+
+#define BASE_AUTO_THP_THRESHOLD    2
+#define BASE_AUTO_THP_THRESHOLD_A0 5
+
+typedef enum {
+	metadata_thp_disabled   = 0,
+	/*
+	 * Lazily enable hugepage for metadata. To avoid high RSS caused by THP
+	 * + low usage arena (i.e. THP becomes a significant percentage), the
+	 * "auto" option only starts using THP after a base allocator used up
+	 * the first THP region.  Starting from the second hugepage (in a single
+	 * arena), "auto" behaves the same as "always", i.e. madvise hugepage
+	 * right away.
+	 */
+	metadata_thp_auto       = 1,
+	metadata_thp_always     = 2,
+	metadata_thp_mode_limit = 3
+} metadata_thp_mode_t;
+
+#endif /* JEMALLOC_INTERNAL_BASE_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
new file mode 100644
index 00000000..9b416ada
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
@@ -0,0 +1,106 @@
+#ifndef JEMALLOC_INTERNAL_BIN_H
+#define JEMALLOC_INTERNAL_BIN_H
+
+#include "jemalloc/internal/extent_types.h"
+#include "jemalloc/internal/extent_structs.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/bin_stats.h"
+
+/*
+ * A bin contains a set of extents that are currently being used for slab
+ * allocations.
+ */
+
+/*
+ * Read-only information associated with each element of arena_t's bins array
+ * is stored separately, partly to reduce memory usage (only one copy, rather
+ * than one per arena), but mainly to avoid false cacheline sharing.
+ *
+ * Each slab has the following layout:
+ *
+ *   /--------------------\
+ *   | region 0           |
+ *   |--------------------|
+ *   | region 1           |
+ *   |--------------------|
+ *   | ...                |
+ *   | ...                |
+ *   | ...                |
+ *   |--------------------|
+ *   | region nregs-1     |
+ *   \--------------------/
+ */
+typedef struct bin_info_s bin_info_t;
+struct bin_info_s {
+	/* Size of regions in a slab for this bin's size class. */
+	size_t			reg_size;
+
+	/* Total size of a slab for this bin's size class. */
+	size_t			slab_size;
+
+	/* Total number of regions in a slab for this bin's size class. */
+	uint32_t		nregs;
+
+	/*
+	 * Metadata used to manipulate bitmaps for slabs associated with this
+	 * bin.
+	 */
+	bitmap_info_t		bitmap_info;
+};
+
+extern const bin_info_t bin_infos[NBINS];
+
+
+typedef struct bin_s bin_t;
+struct bin_s {
+	/* All operations on bin_t fields require lock ownership. */
+	malloc_mutex_t		lock;
+
+	/*
+	 * Current slab being used to service allocations of this bin's size
+	 * class.  slabcur is independent of slabs_{nonfull,full}; whenever
+	 * slabcur is reassigned, the previous slab must be deallocated or
+	 * inserted into slabs_{nonfull,full}.
+	 */
+	extent_t		*slabcur;
+
+	/*
+	 * Heap of non-full slabs.  This heap is used to assure that new
+	 * allocations come from the non-full slab that is oldest/lowest in
+	 * memory.
+	 */
+	extent_heap_t		slabs_nonfull;
+
+	/* List used to track full slabs. */
+	extent_list_t		slabs_full;
+
+	/* Bin statistics. */
+	bin_stats_t	stats;
+};
+
+/* Initializes a bin to empty.  Returns true on error. */
+bool bin_init(bin_t *bin);
+
+/* Forking. */
+void bin_prefork(tsdn_t *tsdn, bin_t *bin);
+void bin_postfork_parent(tsdn_t *tsdn, bin_t *bin);
+void bin_postfork_child(tsdn_t *tsdn, bin_t *bin);
+
+/* Stats. */
+static inline void
+bin_stats_merge(tsdn_t *tsdn, bin_stats_t *dst_bin_stats, bin_t *bin) {
+	malloc_mutex_lock(tsdn, &bin->lock);
+	malloc_mutex_prof_read(tsdn, &dst_bin_stats->mutex_data, &bin->lock);
+	dst_bin_stats->nmalloc += bin->stats.nmalloc;
+	dst_bin_stats->ndalloc += bin->stats.ndalloc;
+	dst_bin_stats->nrequests += bin->stats.nrequests;
+	dst_bin_stats->curregs += bin->stats.curregs;
+	dst_bin_stats->nfills += bin->stats.nfills;
+	dst_bin_stats->nflushes += bin->stats.nflushes;
+	dst_bin_stats->nslabs += bin->stats.nslabs;
+	dst_bin_stats->reslabs += bin->stats.reslabs;
+	dst_bin_stats->curslabs += bin->stats.curslabs;
+	malloc_mutex_unlock(tsdn, &bin->lock);
+}
+
+#endif /* JEMALLOC_INTERNAL_BIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
new file mode 100644
index 00000000..86e673ec
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
@@ -0,0 +1,51 @@
+#ifndef JEMALLOC_INTERNAL_BIN_STATS_H
+#define JEMALLOC_INTERNAL_BIN_STATS_H
+
+#include "jemalloc/internal/mutex_prof.h"
+
+typedef struct bin_stats_s bin_stats_t;
+struct bin_stats_s {
+	/*
+	 * Total number of allocation/deallocation requests served directly by
+	 * the bin.  Note that tcache may allocate an object, then recycle it
+	 * many times, resulting many increments to nrequests, but only one
+	 * each to nmalloc and ndalloc.
+	 */
+	uint64_t	nmalloc;
+	uint64_t	ndalloc;
+
+	/*
+	 * Number of allocation requests that correspond to the size of this
+	 * bin.  This includes requests served by tcache, though tcache only
+	 * periodically merges into this counter.
+	 */
+	uint64_t	nrequests;
+
+	/*
+	 * Current number of regions of this size class, including regions
+	 * currently cached by tcache.
+	 */
+	size_t		curregs;
+
+	/* Number of tcache fills from this bin. */
+	uint64_t	nfills;
+
+	/* Number of tcache flushes to this bin. */
+	uint64_t	nflushes;
+
+	/* Total number of slabs created for this bin's size class. */
+	uint64_t	nslabs;
+
+	/*
+	 * Total number of slabs reused by extracting them from the slabs heap
+	 * for this bin's size class.
+	 */
+	uint64_t	reslabs;
+
+	/* Current number of slabs in this bin. */
+	size_t		curslabs;
+
+	mutex_prof_data_t mutex_data;
+};
+
+#endif /* JEMALLOC_INTERNAL_BIN_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
new file mode 100644
index 00000000..8d078a8a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
@@ -0,0 +1,165 @@
+#ifndef JEMALLOC_INTERNAL_BIT_UTIL_H
+#define JEMALLOC_INTERNAL_BIT_UTIL_H
+
+#include "jemalloc/internal/assert.h"
+
+#define BIT_UTIL_INLINE static inline
+
+/* Sanity check. */
+#if !defined(JEMALLOC_INTERNAL_FFSLL) || !defined(JEMALLOC_INTERNAL_FFSL) \
+    || !defined(JEMALLOC_INTERNAL_FFS)
+#  error JEMALLOC_INTERNAL_FFS{,L,LL} should have been defined by configure
+#endif
+
+
+BIT_UTIL_INLINE unsigned
+ffs_llu(unsigned long long bitmap) {
+	return JEMALLOC_INTERNAL_FFSLL(bitmap);
+}
+
+BIT_UTIL_INLINE unsigned
+ffs_lu(unsigned long bitmap) {
+	return JEMALLOC_INTERNAL_FFSL(bitmap);
+}
+
+BIT_UTIL_INLINE unsigned
+ffs_u(unsigned bitmap) {
+	return JEMALLOC_INTERNAL_FFS(bitmap);
+}
+
+BIT_UTIL_INLINE unsigned
+ffs_zu(size_t bitmap) {
+#if LG_SIZEOF_PTR == LG_SIZEOF_INT
+	return ffs_u(bitmap);
+#elif LG_SIZEOF_PTR == LG_SIZEOF_LONG
+	return ffs_lu(bitmap);
+#elif LG_SIZEOF_PTR == LG_SIZEOF_LONG_LONG
+	return ffs_llu(bitmap);
+#else
+#error No implementation for size_t ffs()
+#endif
+}
+
+BIT_UTIL_INLINE unsigned
+ffs_u64(uint64_t bitmap) {
+#if LG_SIZEOF_LONG == 3
+	return ffs_lu(bitmap);
+#elif LG_SIZEOF_LONG_LONG == 3
+	return ffs_llu(bitmap);
+#else
+#error No implementation for 64-bit ffs()
+#endif
+}
+
+BIT_UTIL_INLINE unsigned
+ffs_u32(uint32_t bitmap) {
+#if LG_SIZEOF_INT == 2
+	return ffs_u(bitmap);
+#else
+#error No implementation for 32-bit ffs()
+#endif
+	return ffs_u(bitmap);
+}
+
+BIT_UTIL_INLINE uint64_t
+pow2_ceil_u64(uint64_t x) {
+	x--;
+	x |= x >> 1;
+	x |= x >> 2;
+	x |= x >> 4;
+	x |= x >> 8;
+	x |= x >> 16;
+	x |= x >> 32;
+	x++;
+	return x;
+}
+
+BIT_UTIL_INLINE uint32_t
+pow2_ceil_u32(uint32_t x) {
+	x--;
+	x |= x >> 1;
+	x |= x >> 2;
+	x |= x >> 4;
+	x |= x >> 8;
+	x |= x >> 16;
+	x++;
+	return x;
+}
+
+/* Compute the smallest power of 2 that is >= x. */
+BIT_UTIL_INLINE size_t
+pow2_ceil_zu(size_t x) {
+#if (LG_SIZEOF_PTR == 3)
+	return pow2_ceil_u64(x);
+#else
+	return pow2_ceil_u32(x);
+#endif
+}
+
+#if (defined(__i386__) || defined(__amd64__) || defined(__x86_64__))
+BIT_UTIL_INLINE unsigned
+lg_floor(size_t x) {
+	size_t ret;
+	assert(x != 0);
+
+	asm ("bsr %1, %0"
+	    : "=r"(ret) // Outputs.
+	    : "r"(x)    // Inputs.
+	    );
+	assert(ret < UINT_MAX);
+	return (unsigned)ret;
+}
+#elif (defined(_MSC_VER))
+BIT_UTIL_INLINE unsigned
+lg_floor(size_t x) {
+	unsigned long ret;
+
+	assert(x != 0);
+
+#if (LG_SIZEOF_PTR == 3)
+	_BitScanReverse64(&ret, x);
+#elif (LG_SIZEOF_PTR == 2)
+	_BitScanReverse(&ret, x);
+#else
+#  error "Unsupported type size for lg_floor()"
+#endif
+	assert(ret < UINT_MAX);
+	return (unsigned)ret;
+}
+#elif (defined(JEMALLOC_HAVE_BUILTIN_CLZ))
+BIT_UTIL_INLINE unsigned
+lg_floor(size_t x) {
+	assert(x != 0);
+
+#if (LG_SIZEOF_PTR == LG_SIZEOF_INT)
+	return ((8 << LG_SIZEOF_PTR) - 1) - __builtin_clz(x);
+#elif (LG_SIZEOF_PTR == LG_SIZEOF_LONG)
+	return ((8 << LG_SIZEOF_PTR) - 1) - __builtin_clzl(x);
+#else
+#  error "Unsupported type size for lg_floor()"
+#endif
+}
+#else
+BIT_UTIL_INLINE unsigned
+lg_floor(size_t x) {
+	assert(x != 0);
+
+	x |= (x >> 1);
+	x |= (x >> 2);
+	x |= (x >> 4);
+	x |= (x >> 8);
+	x |= (x >> 16);
+#if (LG_SIZEOF_PTR == 3)
+	x |= (x >> 32);
+#endif
+	if (x == SIZE_T_MAX) {
+		return (8 << LG_SIZEOF_PTR) - 1;
+	}
+	x++;
+	return ffs_zu(x) - 2;
+}
+#endif
+
+#undef BIT_UTIL_INLINE
+
+#endif /* JEMALLOC_INTERNAL_BIT_UTIL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
new file mode 100644
index 00000000..ac990290
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
@@ -0,0 +1,369 @@
+#ifndef JEMALLOC_INTERNAL_BITMAP_H
+#define JEMALLOC_INTERNAL_BITMAP_H
+
+#include "jemalloc/internal/arena_types.h"
+#include "jemalloc/internal/bit_util.h"
+#include "jemalloc/internal/size_classes.h"
+
+typedef unsigned long bitmap_t;
+#define LG_SIZEOF_BITMAP	LG_SIZEOF_LONG
+
+/* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
+#if LG_SLAB_MAXREGS > LG_CEIL_NSIZES
+/* Maximum bitmap bit count is determined by maximum regions per slab. */
+#  define LG_BITMAP_MAXBITS	LG_SLAB_MAXREGS
+#else
+/* Maximum bitmap bit count is determined by number of extent size classes. */
+#  define LG_BITMAP_MAXBITS	LG_CEIL_NSIZES
+#endif
+#define BITMAP_MAXBITS		(ZU(1) << LG_BITMAP_MAXBITS)
+
+/* Number of bits per group. */
+#define LG_BITMAP_GROUP_NBITS		(LG_SIZEOF_BITMAP + 3)
+#define BITMAP_GROUP_NBITS		(1U << LG_BITMAP_GROUP_NBITS)
+#define BITMAP_GROUP_NBITS_MASK		(BITMAP_GROUP_NBITS-1)
+
+/*
+ * Do some analysis on how big the bitmap is before we use a tree.  For a brute
+ * force linear search, if we would have to call ffs_lu() more than 2^3 times,
+ * use a tree instead.
+ */
+#if LG_BITMAP_MAXBITS - LG_BITMAP_GROUP_NBITS > 3
+#  define BITMAP_USE_TREE
+#endif
+
+/* Number of groups required to store a given number of bits. */
+#define BITMAP_BITS2GROUPS(nbits)					\
+    (((nbits) + BITMAP_GROUP_NBITS_MASK) >> LG_BITMAP_GROUP_NBITS)
+
+/*
+ * Number of groups required at a particular level for a given number of bits.
+ */
+#define BITMAP_GROUPS_L0(nbits)						\
+    BITMAP_BITS2GROUPS(nbits)
+#define BITMAP_GROUPS_L1(nbits)						\
+    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(nbits))
+#define BITMAP_GROUPS_L2(nbits)						\
+    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS((nbits))))
+#define BITMAP_GROUPS_L3(nbits)						\
+    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(		\
+	BITMAP_BITS2GROUPS((nbits)))))
+#define BITMAP_GROUPS_L4(nbits)						\
+    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(		\
+	BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS((nbits))))))
+
+/*
+ * Assuming the number of levels, number of groups required for a given number
+ * of bits.
+ */
+#define BITMAP_GROUPS_1_LEVEL(nbits)					\
+    BITMAP_GROUPS_L0(nbits)
+#define BITMAP_GROUPS_2_LEVEL(nbits)					\
+    (BITMAP_GROUPS_1_LEVEL(nbits) + BITMAP_GROUPS_L1(nbits))
+#define BITMAP_GROUPS_3_LEVEL(nbits)					\
+    (BITMAP_GROUPS_2_LEVEL(nbits) + BITMAP_GROUPS_L2(nbits))
+#define BITMAP_GROUPS_4_LEVEL(nbits)					\
+    (BITMAP_GROUPS_3_LEVEL(nbits) + BITMAP_GROUPS_L3(nbits))
+#define BITMAP_GROUPS_5_LEVEL(nbits)					\
+    (BITMAP_GROUPS_4_LEVEL(nbits) + BITMAP_GROUPS_L4(nbits))
+
+/*
+ * Maximum number of groups required to support LG_BITMAP_MAXBITS.
+ */
+#ifdef BITMAP_USE_TREE
+
+#if LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS
+#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_1_LEVEL(nbits)
+#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_1_LEVEL(BITMAP_MAXBITS)
+#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 2
+#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_2_LEVEL(nbits)
+#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_2_LEVEL(BITMAP_MAXBITS)
+#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 3
+#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_3_LEVEL(nbits)
+#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_3_LEVEL(BITMAP_MAXBITS)
+#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 4
+#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_4_LEVEL(nbits)
+#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_4_LEVEL(BITMAP_MAXBITS)
+#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 5
+#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_5_LEVEL(nbits)
+#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_5_LEVEL(BITMAP_MAXBITS)
+#else
+#  error "Unsupported bitmap size"
+#endif
+
+/*
+ * Maximum number of levels possible.  This could be statically computed based
+ * on LG_BITMAP_MAXBITS:
+ *
+ * #define BITMAP_MAX_LEVELS \
+ *     (LG_BITMAP_MAXBITS / LG_SIZEOF_BITMAP) \
+ *     + !!(LG_BITMAP_MAXBITS % LG_SIZEOF_BITMAP)
+ *
+ * However, that would not allow the generic BITMAP_INFO_INITIALIZER() macro, so
+ * instead hardcode BITMAP_MAX_LEVELS to the largest number supported by the
+ * various cascading macros.  The only additional cost this incurs is some
+ * unused trailing entries in bitmap_info_t structures; the bitmaps themselves
+ * are not impacted.
+ */
+#define BITMAP_MAX_LEVELS	5
+
+#define BITMAP_INFO_INITIALIZER(nbits) {				\
+	/* nbits. */							\
+	nbits,								\
+	/* nlevels. */							\
+	(BITMAP_GROUPS_L0(nbits) > BITMAP_GROUPS_L1(nbits)) +		\
+	    (BITMAP_GROUPS_L1(nbits) > BITMAP_GROUPS_L2(nbits)) +	\
+	    (BITMAP_GROUPS_L2(nbits) > BITMAP_GROUPS_L3(nbits)) +	\
+	    (BITMAP_GROUPS_L3(nbits) > BITMAP_GROUPS_L4(nbits)) + 1,	\
+	/* levels. */							\
+	{								\
+		{0},							\
+		{BITMAP_GROUPS_L0(nbits)},				\
+		{BITMAP_GROUPS_L1(nbits) + BITMAP_GROUPS_L0(nbits)},	\
+		{BITMAP_GROUPS_L2(nbits) + BITMAP_GROUPS_L1(nbits) +	\
+		    BITMAP_GROUPS_L0(nbits)},				\
+		{BITMAP_GROUPS_L3(nbits) + BITMAP_GROUPS_L2(nbits) +	\
+		    BITMAP_GROUPS_L1(nbits) + BITMAP_GROUPS_L0(nbits)},	\
+		{BITMAP_GROUPS_L4(nbits) + BITMAP_GROUPS_L3(nbits) +	\
+		     BITMAP_GROUPS_L2(nbits) + BITMAP_GROUPS_L1(nbits)	\
+		     + BITMAP_GROUPS_L0(nbits)}				\
+	}								\
+}
+
+#else /* BITMAP_USE_TREE */
+
+#define BITMAP_GROUPS(nbits)	BITMAP_BITS2GROUPS(nbits)
+#define BITMAP_GROUPS_MAX	BITMAP_BITS2GROUPS(BITMAP_MAXBITS)
+
+#define BITMAP_INFO_INITIALIZER(nbits) {				\
+	/* nbits. */							\
+	nbits,								\
+	/* ngroups. */							\
+	BITMAP_BITS2GROUPS(nbits)					\
+}
+
+#endif /* BITMAP_USE_TREE */
+
+typedef struct bitmap_level_s {
+	/* Offset of this level's groups within the array of groups. */
+	size_t group_offset;
+} bitmap_level_t;
+
+typedef struct bitmap_info_s {
+	/* Logical number of bits in bitmap (stored at bottom level). */
+	size_t nbits;
+
+#ifdef BITMAP_USE_TREE
+	/* Number of levels necessary for nbits. */
+	unsigned nlevels;
+
+	/*
+	 * Only the first (nlevels+1) elements are used, and levels are ordered
+	 * bottom to top (e.g. the bottom level is stored in levels[0]).
+	 */
+	bitmap_level_t levels[BITMAP_MAX_LEVELS+1];
+#else /* BITMAP_USE_TREE */
+	/* Number of groups necessary for nbits. */
+	size_t ngroups;
+#endif /* BITMAP_USE_TREE */
+} bitmap_info_t;
+
+void bitmap_info_init(bitmap_info_t *binfo, size_t nbits);
+void bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill);
+size_t bitmap_size(const bitmap_info_t *binfo);
+
+static inline bool
+bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo) {
+#ifdef BITMAP_USE_TREE
+	size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
+	bitmap_t rg = bitmap[rgoff];
+	/* The bitmap is full iff the root group is 0. */
+	return (rg == 0);
+#else
+	size_t i;
+
+	for (i = 0; i < binfo->ngroups; i++) {
+		if (bitmap[i] != 0) {
+			return false;
+		}
+	}
+	return true;
+#endif
+}
+
+static inline bool
+bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
+	size_t goff;
+	bitmap_t g;
+
+	assert(bit < binfo->nbits);
+	goff = bit >> LG_BITMAP_GROUP_NBITS;
+	g = bitmap[goff];
+	return !(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
+}
+
+static inline void
+bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
+	size_t goff;
+	bitmap_t *gp;
+	bitmap_t g;
+
+	assert(bit < binfo->nbits);
+	assert(!bitmap_get(bitmap, binfo, bit));
+	goff = bit >> LG_BITMAP_GROUP_NBITS;
+	gp = &bitmap[goff];
+	g = *gp;
+	assert(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
+	g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
+	*gp = g;
+	assert(bitmap_get(bitmap, binfo, bit));
+#ifdef BITMAP_USE_TREE
+	/* Propagate group state transitions up the tree. */
+	if (g == 0) {
+		unsigned i;
+		for (i = 1; i < binfo->nlevels; i++) {
+			bit = goff;
+			goff = bit >> LG_BITMAP_GROUP_NBITS;
+			gp = &bitmap[binfo->levels[i].group_offset + goff];
+			g = *gp;
+			assert(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
+			g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
+			*gp = g;
+			if (g != 0) {
+				break;
+			}
+		}
+	}
+#endif
+}
+
+/* ffu: find first unset >= bit. */
+static inline size_t
+bitmap_ffu(const bitmap_t *bitmap, const bitmap_info_t *binfo, size_t min_bit) {
+	assert(min_bit < binfo->nbits);
+
+#ifdef BITMAP_USE_TREE
+	size_t bit = 0;
+	for (unsigned level = binfo->nlevels; level--;) {
+		size_t lg_bits_per_group = (LG_BITMAP_GROUP_NBITS * (level +
+		    1));
+		bitmap_t group = bitmap[binfo->levels[level].group_offset + (bit
+		    >> lg_bits_per_group)];
+		unsigned group_nmask = (unsigned)(((min_bit > bit) ? (min_bit -
+		    bit) : 0) >> (lg_bits_per_group - LG_BITMAP_GROUP_NBITS));
+		assert(group_nmask <= BITMAP_GROUP_NBITS);
+		bitmap_t group_mask = ~((1LU << group_nmask) - 1);
+		bitmap_t group_masked = group & group_mask;
+		if (group_masked == 0LU) {
+			if (group == 0LU) {
+				return binfo->nbits;
+			}
+			/*
+			 * min_bit was preceded by one or more unset bits in
+			 * this group, but there are no other unset bits in this
+			 * group.  Try again starting at the first bit of the
+			 * next sibling.  This will recurse at most once per
+			 * non-root level.
+			 */
+			size_t sib_base = bit + (ZU(1) << lg_bits_per_group);
+			assert(sib_base > min_bit);
+			assert(sib_base > bit);
+			if (sib_base >= binfo->nbits) {
+				return binfo->nbits;
+			}
+			return bitmap_ffu(bitmap, binfo, sib_base);
+		}
+		bit += ((size_t)(ffs_lu(group_masked) - 1)) <<
+		    (lg_bits_per_group - LG_BITMAP_GROUP_NBITS);
+	}
+	assert(bit >= min_bit);
+	assert(bit < binfo->nbits);
+	return bit;
+#else
+	size_t i = min_bit >> LG_BITMAP_GROUP_NBITS;
+	bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
+	    - 1);
+	size_t bit;
+	do {
+		bit = ffs_lu(g);
+		if (bit != 0) {
+			return (i << LG_BITMAP_GROUP_NBITS) + (bit - 1);
+		}
+		i++;
+		g = bitmap[i];
+	} while (i < binfo->ngroups);
+	return binfo->nbits;
+#endif
+}
+
+/* sfu: set first unset. */
+static inline size_t
+bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo) {
+	size_t bit;
+	bitmap_t g;
+	unsigned i;
+
+	assert(!bitmap_full(bitmap, binfo));
+
+#ifdef BITMAP_USE_TREE
+	i = binfo->nlevels - 1;
+	g = bitmap[binfo->levels[i].group_offset];
+	bit = ffs_lu(g) - 1;
+	while (i > 0) {
+		i--;
+		g = bitmap[binfo->levels[i].group_offset + bit];
+		bit = (bit << LG_BITMAP_GROUP_NBITS) + (ffs_lu(g) - 1);
+	}
+#else
+	i = 0;
+	g = bitmap[0];
+	while ((bit = ffs_lu(g)) == 0) {
+		i++;
+		g = bitmap[i];
+	}
+	bit = (i << LG_BITMAP_GROUP_NBITS) + (bit - 1);
+#endif
+	bitmap_set(bitmap, binfo, bit);
+	return bit;
+}
+
+static inline void
+bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
+	size_t goff;
+	bitmap_t *gp;
+	bitmap_t g;
+	UNUSED bool propagate;
+
+	assert(bit < binfo->nbits);
+	assert(bitmap_get(bitmap, binfo, bit));
+	goff = bit >> LG_BITMAP_GROUP_NBITS;
+	gp = &bitmap[goff];
+	g = *gp;
+	propagate = (g == 0);
+	assert((g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK))) == 0);
+	g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
+	*gp = g;
+	assert(!bitmap_get(bitmap, binfo, bit));
+#ifdef BITMAP_USE_TREE
+	/* Propagate group state transitions up the tree. */
+	if (propagate) {
+		unsigned i;
+		for (i = 1; i < binfo->nlevels; i++) {
+			bit = goff;
+			goff = bit >> LG_BITMAP_GROUP_NBITS;
+			gp = &bitmap[binfo->levels[i].group_offset + goff];
+			g = *gp;
+			propagate = (g == 0);
+			assert((g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)))
+			    == 0);
+			g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
+			*gp = g;
+			if (!propagate) {
+				break;
+			}
+		}
+	}
+#endif /* BITMAP_USE_TREE */
+}
+
+#endif /* JEMALLOC_INTERNAL_BITMAP_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
new file mode 100644
index 00000000..12f3ef2d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
@@ -0,0 +1,114 @@
+#ifndef JEMALLOC_INTERNAL_CACHE_BIN_H
+#define JEMALLOC_INTERNAL_CACHE_BIN_H
+
+#include "jemalloc/internal/ql.h"
+
+/*
+ * The cache_bins are the mechanism that the tcache and the arena use to
+ * communicate.  The tcache fills from and flushes to the arena by passing a
+ * cache_bin_t to fill/flush.  When the arena needs to pull stats from the
+ * tcaches associated with it, it does so by iterating over its
+ * cache_bin_array_descriptor_t objects and reading out per-bin stats it
+ * contains.  This makes it so that the arena need not know about the existence
+ * of the tcache at all.
+ */
+
+
+/*
+ * The count of the number of cached allocations in a bin.  We make this signed
+ * so that negative numbers can encode "invalid" states (e.g. a low water mark
+ * of -1 for a cache that has been depleted).
+ */
+typedef int32_t cache_bin_sz_t;
+
+typedef struct cache_bin_stats_s cache_bin_stats_t;
+struct cache_bin_stats_s {
+	/*
+	 * Number of allocation requests that corresponded to the size of this
+	 * bin.
+	 */
+	uint64_t nrequests;
+};
+
+/*
+ * Read-only information associated with each element of tcache_t's tbins array
+ * is stored separately, mainly to reduce memory usage.
+ */
+typedef struct cache_bin_info_s cache_bin_info_t;
+struct cache_bin_info_s {
+	/* Upper limit on ncached. */
+	cache_bin_sz_t ncached_max;
+};
+
+typedef struct cache_bin_s cache_bin_t;
+struct cache_bin_s {
+	/* Min # cached since last GC. */
+	cache_bin_sz_t low_water;
+	/* # of cached objects. */
+	cache_bin_sz_t ncached;
+	/*
+	 * ncached and stats are both modified frequently.  Let's keep them
+	 * close so that they have a higher chance of being on the same
+	 * cacheline, thus less write-backs.
+	 */
+	cache_bin_stats_t tstats;
+	/*
+	 * Stack of available objects.
+	 *
+	 * To make use of adjacent cacheline prefetch, the items in the avail
+	 * stack goes to higher address for newer allocations.  avail points
+	 * just above the available space, which means that
+	 * avail[-ncached, ... -1] are available items and the lowest item will
+	 * be allocated first.
+	 */
+	void **avail;
+};
+
+typedef struct cache_bin_array_descriptor_s cache_bin_array_descriptor_t;
+struct cache_bin_array_descriptor_s {
+	/*
+	 * The arena keeps a list of the cache bins associated with it, for
+	 * stats collection.
+	 */
+	ql_elm(cache_bin_array_descriptor_t) link;
+	/* Pointers to the tcache bins. */
+	cache_bin_t *bins_small;
+	cache_bin_t *bins_large;
+};
+
+static inline void
+cache_bin_array_descriptor_init(cache_bin_array_descriptor_t *descriptor,
+    cache_bin_t *bins_small, cache_bin_t *bins_large) {
+	ql_elm_new(descriptor, link);
+	descriptor->bins_small = bins_small;
+	descriptor->bins_large = bins_large;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+cache_bin_alloc_easy(cache_bin_t *bin, bool *success) {
+	void *ret;
+
+	if (unlikely(bin->ncached == 0)) {
+		bin->low_water = -1;
+		*success = false;
+		return NULL;
+	}
+	/*
+	 * success (instead of ret) should be checked upon the return of this
+	 * function.  We avoid checking (ret == NULL) because there is never a
+	 * null stored on the avail stack (which is unknown to the compiler),
+	 * and eagerly checking ret would cause pipeline stall (waiting for the
+	 * cacheline).
+	 */
+	*success = true;
+	ret = *(bin->avail - bin->ncached);
+	bin->ncached--;
+
+	if (unlikely(bin->ncached < bin->low_water)) {
+		bin->low_water = bin->ncached;
+	}
+
+	return ret;
+}
+
+#endif /* JEMALLOC_INTERNAL_CACHE_BIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
new file mode 100644
index 00000000..7b3850bc
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
@@ -0,0 +1,101 @@
+#ifndef JEMALLOC_INTERNAL_CKH_H
+#define JEMALLOC_INTERNAL_CKH_H
+
+#include "jemalloc/internal/tsd.h"
+
+/* Cuckoo hashing implementation.  Skip to the end for the interface. */
+
+/******************************************************************************/
+/* INTERNAL DEFINITIONS -- IGNORE */
+/******************************************************************************/
+
+/* Maintain counters used to get an idea of performance. */
+/* #define CKH_COUNT */
+/* Print counter values in ckh_delete() (requires CKH_COUNT). */
+/* #define CKH_VERBOSE */
+
+/*
+ * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket.  Try to fit
+ * one bucket per L1 cache line.
+ */
+#define LG_CKH_BUCKET_CELLS (LG_CACHELINE - LG_SIZEOF_PTR - 1)
+
+/* Typedefs to allow easy function pointer passing. */
+typedef void ckh_hash_t (const void *, size_t[2]);
+typedef bool ckh_keycomp_t (const void *, const void *);
+
+/* Hash table cell. */
+typedef struct {
+	const void *key;
+	const void *data;
+} ckhc_t;
+
+/* The hash table itself. */
+typedef struct {
+#ifdef CKH_COUNT
+	/* Counters used to get an idea of performance. */
+	uint64_t ngrows;
+	uint64_t nshrinks;
+	uint64_t nshrinkfails;
+	uint64_t ninserts;
+	uint64_t nrelocs;
+#endif
+
+	/* Used for pseudo-random number generation. */
+	uint64_t prng_state;
+
+	/* Total number of items. */
+	size_t count;
+
+	/*
+	 * Minimum and current number of hash table buckets.  There are
+	 * 2^LG_CKH_BUCKET_CELLS cells per bucket.
+	 */
+	unsigned lg_minbuckets;
+	unsigned lg_curbuckets;
+
+	/* Hash and comparison functions. */
+	ckh_hash_t *hash;
+	ckh_keycomp_t *keycomp;
+
+	/* Hash table with 2^lg_curbuckets buckets. */
+	ckhc_t *tab;
+} ckh_t;
+
+/******************************************************************************/
+/* BEGIN PUBLIC API */
+/******************************************************************************/
+
+/* Lifetime management.  Minitems is the initial capacity. */
+bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
+    ckh_keycomp_t *keycomp);
+void ckh_delete(tsd_t *tsd, ckh_t *ckh);
+
+/* Get the number of elements in the set. */
+size_t ckh_count(ckh_t *ckh);
+
+/*
+ * To iterate over the elements in the table, initialize *tabind to 0 and call
+ * this function until it returns true.  Each call that returns false will
+ * update *key and *data to the next element in the table, assuming the pointers
+ * are non-NULL.
+ */
+bool ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data);
+
+/*
+ * Basic hash table operations -- insert, removal, lookup.  For ckh_remove and
+ * ckh_search, key or data can be NULL.  The hash-table only stores pointers to
+ * the key and value, and doesn't do any lifetime management.
+ */
+bool ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data);
+bool ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key,
+    void **data);
+bool ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data);
+
+/* Some useful hash and comparison functions for strings and pointers. */
+void ckh_string_hash(const void *key, size_t r_hash[2]);
+bool ckh_string_keycomp(const void *k1, const void *k2);
+void ckh_pointer_hash(const void *key, size_t r_hash[2]);
+bool ckh_pointer_keycomp(const void *k1, const void *k2);
+
+#endif /* JEMALLOC_INTERNAL_CKH_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
new file mode 100644
index 00000000..d927d948
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
@@ -0,0 +1,131 @@
+#ifndef JEMALLOC_INTERNAL_CTL_H
+#define JEMALLOC_INTERNAL_CTL_H
+
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/mutex_prof.h"
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/stats.h"
+
+/* Maximum ctl tree depth. */
+#define CTL_MAX_DEPTH	7
+
+typedef struct ctl_node_s {
+	bool named;
+} ctl_node_t;
+
+typedef struct ctl_named_node_s {
+	ctl_node_t node;
+	const char *name;
+	/* If (nchildren == 0), this is a terminal node. */
+	size_t nchildren;
+	const ctl_node_t *children;
+	int (*ctl)(tsd_t *, const size_t *, size_t, void *, size_t *, void *,
+	    size_t);
+} ctl_named_node_t;
+
+typedef struct ctl_indexed_node_s {
+	struct ctl_node_s node;
+	const ctl_named_node_t *(*index)(tsdn_t *, const size_t *, size_t,
+	    size_t);
+} ctl_indexed_node_t;
+
+typedef struct ctl_arena_stats_s {
+	arena_stats_t astats;
+
+	/* Aggregate stats for small size classes, based on bin stats. */
+	size_t allocated_small;
+	uint64_t nmalloc_small;
+	uint64_t ndalloc_small;
+	uint64_t nrequests_small;
+
+	bin_stats_t bstats[NBINS];
+	arena_stats_large_t lstats[NSIZES - NBINS];
+} ctl_arena_stats_t;
+
+typedef struct ctl_stats_s {
+	size_t allocated;
+	size_t active;
+	size_t metadata;
+	size_t metadata_thp;
+	size_t resident;
+	size_t mapped;
+	size_t retained;
+
+	background_thread_stats_t background_thread;
+	mutex_prof_data_t mutex_prof_data[mutex_prof_num_global_mutexes];
+} ctl_stats_t;
+
+typedef struct ctl_arena_s ctl_arena_t;
+struct ctl_arena_s {
+	unsigned arena_ind;
+	bool initialized;
+	ql_elm(ctl_arena_t) destroyed_link;
+
+	/* Basic stats, supported even if !config_stats. */
+	unsigned nthreads;
+	const char *dss;
+	ssize_t dirty_decay_ms;
+	ssize_t muzzy_decay_ms;
+	size_t pactive;
+	size_t pdirty;
+	size_t pmuzzy;
+
+	/* NULL if !config_stats. */
+	ctl_arena_stats_t *astats;
+};
+
+typedef struct ctl_arenas_s {
+	uint64_t epoch;
+	unsigned narenas;
+	ql_head(ctl_arena_t) destroyed;
+
+	/*
+	 * Element 0 corresponds to merged stats for extant arenas (accessed via
+	 * MALLCTL_ARENAS_ALL), element 1 corresponds to merged stats for
+	 * destroyed arenas (accessed via MALLCTL_ARENAS_DESTROYED), and the
+	 * remaining MALLOCX_ARENA_LIMIT elements correspond to arenas.
+	 */
+	ctl_arena_t *arenas[2 + MALLOCX_ARENA_LIMIT];
+} ctl_arenas_t;
+
+int ctl_byname(tsd_t *tsd, const char *name, void *oldp, size_t *oldlenp,
+    void *newp, size_t newlen);
+int ctl_nametomib(tsd_t *tsd, const char *name, size_t *mibp, size_t *miblenp);
+
+int ctl_bymib(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen);
+bool ctl_boot(void);
+void ctl_prefork(tsdn_t *tsdn);
+void ctl_postfork_parent(tsdn_t *tsdn);
+void ctl_postfork_child(tsdn_t *tsdn);
+
+#define xmallctl(name, oldp, oldlenp, newp, newlen) do {		\
+	if (je_mallctl(name, oldp, oldlenp, newp, newlen)		\
+	    != 0) {							\
+		malloc_printf(						\
+		    "<jemalloc>: Failure in xmallctl(\"%s\", ...)\n",	\
+		    name);						\
+		abort();						\
+	}								\
+} while (0)
+
+#define xmallctlnametomib(name, mibp, miblenp) do {			\
+	if (je_mallctlnametomib(name, mibp, miblenp) != 0) {		\
+		malloc_printf("<jemalloc>: Failure in "			\
+		    "xmallctlnametomib(\"%s\", ...)\n", name);		\
+		abort();						\
+	}								\
+} while (0)
+
+#define xmallctlbymib(mib, miblen, oldp, oldlenp, newp, newlen) do {	\
+	if (je_mallctlbymib(mib, miblen, oldp, oldlenp, newp,		\
+	    newlen) != 0) {						\
+		malloc_write(						\
+		    "<jemalloc>: Failure in xmallctlbymib()\n");	\
+		abort();						\
+	}								\
+} while (0)
+
+#endif /* JEMALLOC_INTERNAL_CTL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
new file mode 100644
index 00000000..aebae939
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
@@ -0,0 +1,41 @@
+#ifndef JEMALLOC_INTERNAL_DIV_H
+#define JEMALLOC_INTERNAL_DIV_H
+
+#include "jemalloc/internal/assert.h"
+
+/*
+ * This module does the division that computes the index of a region in a slab,
+ * given its offset relative to the base.
+ * That is, given a divisor d, an n = i * d (all integers), we'll return i.
+ * We do some pre-computation to do this more quickly than a CPU division
+ * instruction.
+ * We bound n < 2^32, and don't support dividing by one.
+ */
+
+typedef struct div_info_s div_info_t;
+struct div_info_s {
+	uint32_t magic;
+#ifdef JEMALLOC_DEBUG
+	size_t d;
+#endif
+};
+
+void div_init(div_info_t *div_info, size_t divisor);
+
+static inline size_t
+div_compute(div_info_t *div_info, size_t n) {
+	assert(n <= (uint32_t)-1);
+	/*
+	 * This generates, e.g. mov; imul; shr on x86-64. On a 32-bit machine,
+	 * the compilers I tried were all smart enough to turn this into the
+	 * appropriate "get the high 32 bits of the result of a multiply" (e.g.
+	 * mul; mov edx eax; on x86, umull on arm, etc.).
+	 */
+	size_t i = ((uint64_t)n * (uint64_t)div_info->magic) >> 32;
+#ifdef JEMALLOC_DEBUG
+	assert(i * div_info->d == n);
+#endif
+	return i;
+}
+
+#endif /* JEMALLOC_INTERNAL_DIV_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
new file mode 100644
index 00000000..3a2b2f7f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
@@ -0,0 +1,435 @@
+#ifndef JEMALLOC_INTERNAL_EMITTER_H
+#define JEMALLOC_INTERNAL_EMITTER_H
+
+#include "jemalloc/internal/ql.h"
+
+typedef enum emitter_output_e emitter_output_t;
+enum emitter_output_e {
+	emitter_output_json,
+	emitter_output_table
+};
+
+typedef enum emitter_justify_e emitter_justify_t;
+enum emitter_justify_e {
+	emitter_justify_left,
+	emitter_justify_right,
+	/* Not for users; just to pass to internal functions. */
+	emitter_justify_none
+};
+
+typedef enum emitter_type_e emitter_type_t;
+enum emitter_type_e {
+	emitter_type_bool,
+	emitter_type_int,
+	emitter_type_unsigned,
+	emitter_type_uint32,
+	emitter_type_uint64,
+	emitter_type_size,
+	emitter_type_ssize,
+	emitter_type_string,
+	/*
+	 * A title is a column title in a table; it's just a string, but it's
+	 * not quoted.
+	 */
+	emitter_type_title,
+};
+
+typedef struct emitter_col_s emitter_col_t;
+struct emitter_col_s {
+	/* Filled in by the user. */
+	emitter_justify_t justify;
+	int width;
+	emitter_type_t type;
+	union {
+		bool bool_val;
+		int int_val;
+		unsigned unsigned_val;
+		uint32_t uint32_val;
+		uint64_t uint64_val;
+		size_t size_val;
+		ssize_t ssize_val;
+		const char *str_val;
+	};
+
+	/* Filled in by initialization. */
+	ql_elm(emitter_col_t) link;
+};
+
+typedef struct emitter_row_s emitter_row_t;
+struct emitter_row_s {
+	ql_head(emitter_col_t) cols;
+};
+
+static inline void
+emitter_row_init(emitter_row_t *row) {
+	ql_new(&row->cols);
+}
+
+static inline void
+emitter_col_init(emitter_col_t *col, emitter_row_t *row) {
+	ql_elm_new(col, link);
+	ql_tail_insert(&row->cols, col, link);
+}
+
+typedef struct emitter_s emitter_t;
+struct emitter_s {
+	emitter_output_t output;
+	/* The output information. */
+	void (*write_cb)(void *, const char *);
+	void *cbopaque;
+	int nesting_depth;
+	/* True if we've already emitted a value at the given depth. */
+	bool item_at_depth;
+};
+
+static inline void
+emitter_init(emitter_t *emitter, emitter_output_t emitter_output,
+    void (*write_cb)(void *, const char *), void *cbopaque) {
+	emitter->output = emitter_output;
+	emitter->write_cb = write_cb;
+	emitter->cbopaque = cbopaque;
+	emitter->item_at_depth = false;
+	emitter->nesting_depth = 0;
+}
+
+/* Internal convenience function.  Write to the emitter the given string. */
+JEMALLOC_FORMAT_PRINTF(2, 3)
+static inline void
+emitter_printf(emitter_t *emitter, const char *format, ...) {
+	va_list ap;
+
+	va_start(ap, format);
+	malloc_vcprintf(emitter->write_cb, emitter->cbopaque, format, ap);
+	va_end(ap);
+}
+
+/* Write to the emitter the given string, but only in table mode. */
+JEMALLOC_FORMAT_PRINTF(2, 3)
+static inline void
+emitter_table_printf(emitter_t *emitter, const char *format, ...) {
+	if (emitter->output == emitter_output_table) {
+		va_list ap;
+		va_start(ap, format);
+		malloc_vcprintf(emitter->write_cb, emitter->cbopaque, format, ap);
+		va_end(ap);
+	}
+}
+
+static inline void
+emitter_gen_fmt(char *out_fmt, size_t out_size, const char *fmt_specifier,
+    emitter_justify_t justify, int width) {
+	size_t written;
+	if (justify == emitter_justify_none) {
+		written = malloc_snprintf(out_fmt, out_size,
+		    "%%%s", fmt_specifier);
+	} else if (justify == emitter_justify_left) {
+		written = malloc_snprintf(out_fmt, out_size,
+		    "%%-%d%s", width, fmt_specifier);
+	} else {
+		written = malloc_snprintf(out_fmt, out_size,
+		    "%%%d%s", width, fmt_specifier);
+	}
+	/* Only happens in case of bad format string, which *we* choose. */
+	assert(written <  out_size);
+}
+
+/*
+ * Internal.  Emit the given value type in the relevant encoding (so that the
+ * bool true gets mapped to json "true", but the string "true" gets mapped to
+ * json "\"true\"", for instance.
+ *
+ * Width is ignored if justify is emitter_justify_none.
+ */
+static inline void
+emitter_print_value(emitter_t *emitter, emitter_justify_t justify, int width,
+    emitter_type_t value_type, const void *value) {
+	size_t str_written;
+#define BUF_SIZE 256
+#define FMT_SIZE 10
+	/*
+	 * We dynamically generate a format string to emit, to let us use the
+	 * snprintf machinery.  This is kinda hacky, but gets the job done
+	 * quickly without having to think about the various snprintf edge
+	 * cases.
+	 */
+	char fmt[FMT_SIZE];
+	char buf[BUF_SIZE];
+
+#define EMIT_SIMPLE(type, format)					\
+	emitter_gen_fmt(fmt, FMT_SIZE, format, justify, width);		\
+	emitter_printf(emitter, fmt, *(const type *)value);		\
+
+	switch (value_type) {
+	case emitter_type_bool:
+		emitter_gen_fmt(fmt, FMT_SIZE, "s", justify, width);
+		emitter_printf(emitter, fmt, *(const bool *)value ?
+		    "true" : "false");
+		break;
+	case emitter_type_int:
+		EMIT_SIMPLE(int, "d")
+		break;
+	case emitter_type_unsigned:
+		EMIT_SIMPLE(unsigned, "u")
+		break;
+	case emitter_type_ssize:
+		EMIT_SIMPLE(ssize_t, "zd")
+		break;
+	case emitter_type_size:
+		EMIT_SIMPLE(size_t, "zu")
+		break;
+	case emitter_type_string:
+		str_written = malloc_snprintf(buf, BUF_SIZE, "\"%s\"",
+		    *(const char *const *)value);
+		/*
+		 * We control the strings we output; we shouldn't get anything
+		 * anywhere near the fmt size.
+		 */
+		assert(str_written < BUF_SIZE);
+		emitter_gen_fmt(fmt, FMT_SIZE, "s", justify, width);
+		emitter_printf(emitter, fmt, buf);
+		break;
+	case emitter_type_uint32:
+		EMIT_SIMPLE(uint32_t, FMTu32)
+		break;
+	case emitter_type_uint64:
+		EMIT_SIMPLE(uint64_t, FMTu64)
+		break;
+	case emitter_type_title:
+		EMIT_SIMPLE(char *const, "s");
+		break;
+	default:
+		unreachable();
+	}
+#undef BUF_SIZE
+#undef FMT_SIZE
+}
+
+
+/* Internal functions.  In json mode, tracks nesting state. */
+static inline void
+emitter_nest_inc(emitter_t *emitter) {
+	emitter->nesting_depth++;
+	emitter->item_at_depth = false;
+}
+
+static inline void
+emitter_nest_dec(emitter_t *emitter) {
+	emitter->nesting_depth--;
+	emitter->item_at_depth = true;
+}
+
+static inline void
+emitter_indent(emitter_t *emitter) {
+	int amount = emitter->nesting_depth;
+	const char *indent_str;
+	if (emitter->output == emitter_output_json) {
+		indent_str = "\t";
+	} else {
+		amount *= 2;
+		indent_str = " ";
+	}
+	for (int i = 0; i < amount; i++) {
+		emitter_printf(emitter, "%s", indent_str);
+	}
+}
+
+static inline void
+emitter_json_key_prefix(emitter_t *emitter) {
+	emitter_printf(emitter, "%s\n", emitter->item_at_depth ? "," : "");
+	emitter_indent(emitter);
+}
+
+static inline void
+emitter_begin(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth == 0);
+		emitter_printf(emitter, "{");
+		emitter_nest_inc(emitter);
+	} else {
+		// tabular init
+		emitter_printf(emitter, "%s", "");
+	}
+}
+
+static inline void
+emitter_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth == 1);
+		emitter_nest_dec(emitter);
+		emitter_printf(emitter, "\n}\n");
+	}
+}
+
+/*
+ * Note emits a different kv pair as well, but only in table mode.  Omits the
+ * note if table_note_key is NULL.
+ */
+static inline void
+emitter_kv_note(emitter_t *emitter, const char *json_key, const char *table_key,
+    emitter_type_t value_type, const void *value,
+    const char *table_note_key, emitter_type_t table_note_value_type,
+    const void *table_note_value) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth > 0);
+		emitter_json_key_prefix(emitter);
+		emitter_printf(emitter, "\"%s\": ", json_key);
+		emitter_print_value(emitter, emitter_justify_none, -1,
+		    value_type, value);
+	} else {
+		emitter_indent(emitter);
+		emitter_printf(emitter, "%s: ", table_key);
+		emitter_print_value(emitter, emitter_justify_none, -1,
+		    value_type, value);
+		if (table_note_key != NULL) {
+			emitter_printf(emitter, " (%s: ", table_note_key);
+			emitter_print_value(emitter, emitter_justify_none, -1,
+			    table_note_value_type, table_note_value);
+			emitter_printf(emitter, ")");
+		}
+		emitter_printf(emitter, "\n");
+	}
+	emitter->item_at_depth = true;
+}
+
+static inline void
+emitter_kv(emitter_t *emitter, const char *json_key, const char *table_key,
+    emitter_type_t value_type, const void *value) {
+	emitter_kv_note(emitter, json_key, table_key, value_type, value, NULL,
+	    emitter_type_bool, NULL);
+}
+
+static inline void
+emitter_json_kv(emitter_t *emitter, const char *json_key,
+    emitter_type_t value_type, const void *value) {
+	if (emitter->output == emitter_output_json) {
+		emitter_kv(emitter, json_key, NULL, value_type, value);
+	}
+}
+
+static inline void
+emitter_table_kv(emitter_t *emitter, const char *table_key,
+    emitter_type_t value_type, const void *value) {
+	if (emitter->output == emitter_output_table) {
+		emitter_kv(emitter, NULL, table_key, value_type, value);
+	}
+}
+
+static inline void
+emitter_dict_begin(emitter_t *emitter, const char *json_key,
+    const char *table_header) {
+	if (emitter->output == emitter_output_json) {
+		emitter_json_key_prefix(emitter);
+		emitter_printf(emitter, "\"%s\": {", json_key);
+		emitter_nest_inc(emitter);
+	} else {
+		emitter_indent(emitter);
+		emitter_printf(emitter, "%s\n", table_header);
+		emitter_nest_inc(emitter);
+	}
+}
+
+static inline void
+emitter_dict_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth > 0);
+		emitter_nest_dec(emitter);
+		emitter_printf(emitter, "\n");
+		emitter_indent(emitter);
+		emitter_printf(emitter, "}");
+	} else {
+		emitter_nest_dec(emitter);
+	}
+}
+
+static inline void
+emitter_json_dict_begin(emitter_t *emitter, const char *json_key) {
+	if (emitter->output == emitter_output_json) {
+		emitter_dict_begin(emitter, json_key, NULL);
+	}
+}
+
+static inline void
+emitter_json_dict_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		emitter_dict_end(emitter);
+	}
+}
+
+static inline void
+emitter_table_dict_begin(emitter_t *emitter, const char *table_key) {
+	if (emitter->output == emitter_output_table) {
+		emitter_dict_begin(emitter, NULL, table_key);
+	}
+}
+
+static inline void
+emitter_table_dict_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_table) {
+		emitter_dict_end(emitter);
+	}
+}
+
+static inline void
+emitter_json_arr_begin(emitter_t *emitter, const char *json_key) {
+	if (emitter->output == emitter_output_json) {
+		emitter_json_key_prefix(emitter);
+		emitter_printf(emitter, "\"%s\": [", json_key);
+		emitter_nest_inc(emitter);
+	}
+}
+
+static inline void
+emitter_json_arr_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth > 0);
+		emitter_nest_dec(emitter);
+		emitter_printf(emitter, "\n");
+		emitter_indent(emitter);
+		emitter_printf(emitter, "]");
+	}
+}
+
+static inline void
+emitter_json_arr_obj_begin(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		emitter_json_key_prefix(emitter);
+		emitter_printf(emitter, "{");
+		emitter_nest_inc(emitter);
+	}
+}
+
+static inline void
+emitter_json_arr_obj_end(emitter_t *emitter) {
+	if (emitter->output == emitter_output_json) {
+		assert(emitter->nesting_depth > 0);
+		emitter_nest_dec(emitter);
+		emitter_printf(emitter, "\n");
+		emitter_indent(emitter);
+		emitter_printf(emitter, "}");
+	}
+}
+
+static inline void
+emitter_json_arr_value(emitter_t *emitter, emitter_type_t value_type,
+    const void *value) {
+	if (emitter->output == emitter_output_json) {
+		emitter_json_key_prefix(emitter);
+		emitter_print_value(emitter, emitter_justify_none, -1,
+		    value_type, value);
+	}
+}
+
+static inline void
+emitter_table_row(emitter_t *emitter, emitter_row_t *row) {
+	if (emitter->output != emitter_output_table) {
+		return;
+	}
+	emitter_col_t *col;
+	ql_foreach(col, &row->cols, link) {
+		emitter_print_value(emitter, col->justify, col->width,
+		    col->type, (const void *)&col->bool_val);
+	}
+	emitter_table_printf(emitter, "\n");
+}
+
+#endif /* JEMALLOC_INTERNAL_EMITTER_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
new file mode 100644
index 00000000..e8f02ce2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
@@ -0,0 +1,26 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_DSS_H
+#define JEMALLOC_INTERNAL_EXTENT_DSS_H
+
+typedef enum {
+	dss_prec_disabled  = 0,
+	dss_prec_primary   = 1,
+	dss_prec_secondary = 2,
+
+	dss_prec_limit     = 3
+} dss_prec_t;
+#define DSS_PREC_DEFAULT dss_prec_secondary
+#define DSS_DEFAULT "secondary"
+
+extern const char *dss_prec_names[];
+
+extern const char *opt_dss;
+
+dss_prec_t extent_dss_prec_get(void);
+bool extent_dss_prec_set(dss_prec_t dss_prec);
+void *extent_alloc_dss(tsdn_t *tsdn, arena_t *arena, void *new_addr,
+    size_t size, size_t alignment, bool *zero, bool *commit);
+bool extent_in_dss(void *addr);
+bool extent_dss_mergeable(void *addr_a, void *addr_b);
+void extent_dss_boot(void);
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_DSS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
new file mode 100644
index 00000000..b8a4d026
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
@@ -0,0 +1,73 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_EXTERNS_H
+#define JEMALLOC_INTERNAL_EXTENT_EXTERNS_H
+
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_pool.h"
+#include "jemalloc/internal/ph.h"
+#include "jemalloc/internal/rtree.h"
+
+extern size_t opt_lg_extent_max_active_fit;
+
+extern rtree_t extents_rtree;
+extern const extent_hooks_t extent_hooks_default;
+extern mutex_pool_t extent_mutex_pool;
+
+extent_t *extent_alloc(tsdn_t *tsdn, arena_t *arena);
+void extent_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent);
+
+extent_hooks_t *extent_hooks_get(arena_t *arena);
+extent_hooks_t *extent_hooks_set(tsd_t *tsd, arena_t *arena,
+    extent_hooks_t *extent_hooks);
+
+#ifdef JEMALLOC_JET
+size_t extent_size_quantize_floor(size_t size);
+size_t extent_size_quantize_ceil(size_t size);
+#endif
+
+rb_proto(, extent_avail_, extent_tree_t, extent_t)
+ph_proto(, extent_heap_, extent_heap_t, extent_t)
+
+bool extents_init(tsdn_t *tsdn, extents_t *extents, extent_state_t state,
+    bool delay_coalesce);
+extent_state_t extents_state_get(const extents_t *extents);
+size_t extents_npages_get(extents_t *extents);
+extent_t *extents_alloc(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, void *new_addr,
+    size_t size, size_t pad, size_t alignment, bool slab, szind_t szind,
+    bool *zero, bool *commit);
+void extents_dalloc(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, extent_t *extent);
+extent_t *extents_evict(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, size_t npages_min);
+void extents_prefork(tsdn_t *tsdn, extents_t *extents);
+void extents_postfork_parent(tsdn_t *tsdn, extents_t *extents);
+void extents_postfork_child(tsdn_t *tsdn, extents_t *extents);
+extent_t *extent_alloc_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit);
+void extent_dalloc_gap(tsdn_t *tsdn, arena_t *arena, extent_t *extent);
+void extent_dalloc_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent);
+void extent_destroy_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent);
+bool extent_commit_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length);
+bool extent_decommit_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length);
+bool extent_purge_lazy_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length);
+bool extent_purge_forced_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length);
+extent_t *extent_split_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
+    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b);
+bool extent_merge_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b);
+
+bool extent_boot(void);
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
new file mode 100644
index 00000000..77181df8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
@@ -0,0 +1,433 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_INLINES_H
+#define JEMALLOC_INTERNAL_EXTENT_INLINES_H
+
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_pool.h"
+#include "jemalloc/internal/pages.h"
+#include "jemalloc/internal/prng.h"
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/sz.h"
+
+static inline void
+extent_lock(tsdn_t *tsdn, extent_t *extent) {
+	assert(extent != NULL);
+	mutex_pool_lock(tsdn, &extent_mutex_pool, (uintptr_t)extent);
+}
+
+static inline void
+extent_unlock(tsdn_t *tsdn, extent_t *extent) {
+	assert(extent != NULL);
+	mutex_pool_unlock(tsdn, &extent_mutex_pool, (uintptr_t)extent);
+}
+
+static inline void
+extent_lock2(tsdn_t *tsdn, extent_t *extent1, extent_t *extent2) {
+	assert(extent1 != NULL && extent2 != NULL);
+	mutex_pool_lock2(tsdn, &extent_mutex_pool, (uintptr_t)extent1,
+	    (uintptr_t)extent2);
+}
+
+static inline void
+extent_unlock2(tsdn_t *tsdn, extent_t *extent1, extent_t *extent2) {
+	assert(extent1 != NULL && extent2 != NULL);
+	mutex_pool_unlock2(tsdn, &extent_mutex_pool, (uintptr_t)extent1,
+	    (uintptr_t)extent2);
+}
+
+static inline arena_t *
+extent_arena_get(const extent_t *extent) {
+	unsigned arena_ind = (unsigned)((extent->e_bits &
+	    EXTENT_BITS_ARENA_MASK) >> EXTENT_BITS_ARENA_SHIFT);
+	/*
+	 * The following check is omitted because we should never actually read
+	 * a NULL arena pointer.
+	 */
+	if (false && arena_ind >= MALLOCX_ARENA_LIMIT) {
+		return NULL;
+	}
+	assert(arena_ind < MALLOCX_ARENA_LIMIT);
+	return (arena_t *)atomic_load_p(&arenas[arena_ind], ATOMIC_ACQUIRE);
+}
+
+static inline szind_t
+extent_szind_get_maybe_invalid(const extent_t *extent) {
+	szind_t szind = (szind_t)((extent->e_bits & EXTENT_BITS_SZIND_MASK) >>
+	    EXTENT_BITS_SZIND_SHIFT);
+	assert(szind <= NSIZES);
+	return szind;
+}
+
+static inline szind_t
+extent_szind_get(const extent_t *extent) {
+	szind_t szind = extent_szind_get_maybe_invalid(extent);
+	assert(szind < NSIZES); /* Never call when "invalid". */
+	return szind;
+}
+
+static inline size_t
+extent_usize_get(const extent_t *extent) {
+	return sz_index2size(extent_szind_get(extent));
+}
+
+static inline size_t
+extent_sn_get(const extent_t *extent) {
+	return (size_t)((extent->e_bits & EXTENT_BITS_SN_MASK) >>
+	    EXTENT_BITS_SN_SHIFT);
+}
+
+static inline extent_state_t
+extent_state_get(const extent_t *extent) {
+	return (extent_state_t)((extent->e_bits & EXTENT_BITS_STATE_MASK) >>
+	    EXTENT_BITS_STATE_SHIFT);
+}
+
+static inline bool
+extent_zeroed_get(const extent_t *extent) {
+	return (bool)((extent->e_bits & EXTENT_BITS_ZEROED_MASK) >>
+	    EXTENT_BITS_ZEROED_SHIFT);
+}
+
+static inline bool
+extent_committed_get(const extent_t *extent) {
+	return (bool)((extent->e_bits & EXTENT_BITS_COMMITTED_MASK) >>
+	    EXTENT_BITS_COMMITTED_SHIFT);
+}
+
+static inline bool
+extent_dumpable_get(const extent_t *extent) {
+	return (bool)((extent->e_bits & EXTENT_BITS_DUMPABLE_MASK) >>
+	    EXTENT_BITS_DUMPABLE_SHIFT);
+}
+
+static inline bool
+extent_slab_get(const extent_t *extent) {
+	return (bool)((extent->e_bits & EXTENT_BITS_SLAB_MASK) >>
+	    EXTENT_BITS_SLAB_SHIFT);
+}
+
+static inline unsigned
+extent_nfree_get(const extent_t *extent) {
+	assert(extent_slab_get(extent));
+	return (unsigned)((extent->e_bits & EXTENT_BITS_NFREE_MASK) >>
+	    EXTENT_BITS_NFREE_SHIFT);
+}
+
+static inline void *
+extent_base_get(const extent_t *extent) {
+	assert(extent->e_addr == PAGE_ADDR2BASE(extent->e_addr) ||
+	    !extent_slab_get(extent));
+	return PAGE_ADDR2BASE(extent->e_addr);
+}
+
+static inline void *
+extent_addr_get(const extent_t *extent) {
+	assert(extent->e_addr == PAGE_ADDR2BASE(extent->e_addr) ||
+	    !extent_slab_get(extent));
+	return extent->e_addr;
+}
+
+static inline size_t
+extent_size_get(const extent_t *extent) {
+	return (extent->e_size_esn & EXTENT_SIZE_MASK);
+}
+
+static inline size_t
+extent_esn_get(const extent_t *extent) {
+	return (extent->e_size_esn & EXTENT_ESN_MASK);
+}
+
+static inline size_t
+extent_bsize_get(const extent_t *extent) {
+	return extent->e_bsize;
+}
+
+static inline void *
+extent_before_get(const extent_t *extent) {
+	return (void *)((uintptr_t)extent_base_get(extent) - PAGE);
+}
+
+static inline void *
+extent_last_get(const extent_t *extent) {
+	return (void *)((uintptr_t)extent_base_get(extent) +
+	    extent_size_get(extent) - PAGE);
+}
+
+static inline void *
+extent_past_get(const extent_t *extent) {
+	return (void *)((uintptr_t)extent_base_get(extent) +
+	    extent_size_get(extent));
+}
+
+static inline arena_slab_data_t *
+extent_slab_data_get(extent_t *extent) {
+	assert(extent_slab_get(extent));
+	return &extent->e_slab_data;
+}
+
+static inline const arena_slab_data_t *
+extent_slab_data_get_const(const extent_t *extent) {
+	assert(extent_slab_get(extent));
+	return &extent->e_slab_data;
+}
+
+static inline prof_tctx_t *
+extent_prof_tctx_get(const extent_t *extent) {
+	return (prof_tctx_t *)atomic_load_p(&extent->e_prof_tctx,
+	    ATOMIC_ACQUIRE);
+}
+
+static inline void
+extent_arena_set(extent_t *extent, arena_t *arena) {
+	unsigned arena_ind = (arena != NULL) ? arena_ind_get(arena) : ((1U <<
+	    MALLOCX_ARENA_BITS) - 1);
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_ARENA_MASK) |
+	    ((uint64_t)arena_ind << EXTENT_BITS_ARENA_SHIFT);
+}
+
+static inline void
+extent_addr_set(extent_t *extent, void *addr) {
+	extent->e_addr = addr;
+}
+
+static inline void
+extent_addr_randomize(UNUSED tsdn_t *tsdn, extent_t *extent, size_t alignment) {
+	assert(extent_base_get(extent) == extent_addr_get(extent));
+
+	if (alignment < PAGE) {
+		unsigned lg_range = LG_PAGE -
+		    lg_floor(CACHELINE_CEILING(alignment));
+		size_t r;
+		if (!tsdn_null(tsdn)) {
+			tsd_t *tsd = tsdn_tsd(tsdn);
+			r = (size_t)prng_lg_range_u64(
+			    tsd_offset_statep_get(tsd), lg_range);
+		} else {
+			r = prng_lg_range_zu(
+			    &extent_arena_get(extent)->offset_state,
+			    lg_range, true);
+		}
+		uintptr_t random_offset = ((uintptr_t)r) << (LG_PAGE -
+		    lg_range);
+		extent->e_addr = (void *)((uintptr_t)extent->e_addr +
+		    random_offset);
+		assert(ALIGNMENT_ADDR2BASE(extent->e_addr, alignment) ==
+		    extent->e_addr);
+	}
+}
+
+static inline void
+extent_size_set(extent_t *extent, size_t size) {
+	assert((size & ~EXTENT_SIZE_MASK) == 0);
+	extent->e_size_esn = size | (extent->e_size_esn & ~EXTENT_SIZE_MASK);
+}
+
+static inline void
+extent_esn_set(extent_t *extent, size_t esn) {
+	extent->e_size_esn = (extent->e_size_esn & ~EXTENT_ESN_MASK) | (esn &
+	    EXTENT_ESN_MASK);
+}
+
+static inline void
+extent_bsize_set(extent_t *extent, size_t bsize) {
+	extent->e_bsize = bsize;
+}
+
+static inline void
+extent_szind_set(extent_t *extent, szind_t szind) {
+	assert(szind <= NSIZES); /* NSIZES means "invalid". */
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SZIND_MASK) |
+	    ((uint64_t)szind << EXTENT_BITS_SZIND_SHIFT);
+}
+
+static inline void
+extent_nfree_set(extent_t *extent, unsigned nfree) {
+	assert(extent_slab_get(extent));
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_NFREE_MASK) |
+	    ((uint64_t)nfree << EXTENT_BITS_NFREE_SHIFT);
+}
+
+static inline void
+extent_nfree_inc(extent_t *extent) {
+	assert(extent_slab_get(extent));
+	extent->e_bits += ((uint64_t)1U << EXTENT_BITS_NFREE_SHIFT);
+}
+
+static inline void
+extent_nfree_dec(extent_t *extent) {
+	assert(extent_slab_get(extent));
+	extent->e_bits -= ((uint64_t)1U << EXTENT_BITS_NFREE_SHIFT);
+}
+
+static inline void
+extent_sn_set(extent_t *extent, size_t sn) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SN_MASK) |
+	    ((uint64_t)sn << EXTENT_BITS_SN_SHIFT);
+}
+
+static inline void
+extent_state_set(extent_t *extent, extent_state_t state) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_STATE_MASK) |
+	    ((uint64_t)state << EXTENT_BITS_STATE_SHIFT);
+}
+
+static inline void
+extent_zeroed_set(extent_t *extent, bool zeroed) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_ZEROED_MASK) |
+	    ((uint64_t)zeroed << EXTENT_BITS_ZEROED_SHIFT);
+}
+
+static inline void
+extent_committed_set(extent_t *extent, bool committed) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_COMMITTED_MASK) |
+	    ((uint64_t)committed << EXTENT_BITS_COMMITTED_SHIFT);
+}
+
+static inline void
+extent_dumpable_set(extent_t *extent, bool dumpable) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_DUMPABLE_MASK) |
+	    ((uint64_t)dumpable << EXTENT_BITS_DUMPABLE_SHIFT);
+}
+
+static inline void
+extent_slab_set(extent_t *extent, bool slab) {
+	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SLAB_MASK) |
+	    ((uint64_t)slab << EXTENT_BITS_SLAB_SHIFT);
+}
+
+static inline void
+extent_prof_tctx_set(extent_t *extent, prof_tctx_t *tctx) {
+	atomic_store_p(&extent->e_prof_tctx, tctx, ATOMIC_RELEASE);
+}
+
+static inline void
+extent_init(extent_t *extent, arena_t *arena, void *addr, size_t size,
+    bool slab, szind_t szind, size_t sn, extent_state_t state, bool zeroed,
+    bool committed, bool dumpable) {
+	assert(addr == PAGE_ADDR2BASE(addr) || !slab);
+
+	extent_arena_set(extent, arena);
+	extent_addr_set(extent, addr);
+	extent_size_set(extent, size);
+	extent_slab_set(extent, slab);
+	extent_szind_set(extent, szind);
+	extent_sn_set(extent, sn);
+	extent_state_set(extent, state);
+	extent_zeroed_set(extent, zeroed);
+	extent_committed_set(extent, committed);
+	extent_dumpable_set(extent, dumpable);
+	ql_elm_new(extent, ql_link);
+	if (config_prof) {
+		extent_prof_tctx_set(extent, NULL);
+	}
+}
+
+static inline void
+extent_binit(extent_t *extent, void *addr, size_t bsize, size_t sn) {
+	extent_arena_set(extent, NULL);
+	extent_addr_set(extent, addr);
+	extent_bsize_set(extent, bsize);
+	extent_slab_set(extent, false);
+	extent_szind_set(extent, NSIZES);
+	extent_sn_set(extent, sn);
+	extent_state_set(extent, extent_state_active);
+	extent_zeroed_set(extent, true);
+	extent_committed_set(extent, true);
+	extent_dumpable_set(extent, true);
+}
+
+static inline void
+extent_list_init(extent_list_t *list) {
+	ql_new(list);
+}
+
+static inline extent_t *
+extent_list_first(const extent_list_t *list) {
+	return ql_first(list);
+}
+
+static inline extent_t *
+extent_list_last(const extent_list_t *list) {
+	return ql_last(list, ql_link);
+}
+
+static inline void
+extent_list_append(extent_list_t *list, extent_t *extent) {
+	ql_tail_insert(list, extent, ql_link);
+}
+
+static inline void
+extent_list_prepend(extent_list_t *list, extent_t *extent) {
+	ql_head_insert(list, extent, ql_link);
+}
+
+static inline void
+extent_list_replace(extent_list_t *list, extent_t *to_remove,
+    extent_t *to_insert) {
+	ql_after_insert(to_remove, to_insert, ql_link);
+	ql_remove(list, to_remove, ql_link);
+}
+
+static inline void
+extent_list_remove(extent_list_t *list, extent_t *extent) {
+	ql_remove(list, extent, ql_link);
+}
+
+static inline int
+extent_sn_comp(const extent_t *a, const extent_t *b) {
+	size_t a_sn = extent_sn_get(a);
+	size_t b_sn = extent_sn_get(b);
+
+	return (a_sn > b_sn) - (a_sn < b_sn);
+}
+
+static inline int
+extent_esn_comp(const extent_t *a, const extent_t *b) {
+	size_t a_esn = extent_esn_get(a);
+	size_t b_esn = extent_esn_get(b);
+
+	return (a_esn > b_esn) - (a_esn < b_esn);
+}
+
+static inline int
+extent_ad_comp(const extent_t *a, const extent_t *b) {
+	uintptr_t a_addr = (uintptr_t)extent_addr_get(a);
+	uintptr_t b_addr = (uintptr_t)extent_addr_get(b);
+
+	return (a_addr > b_addr) - (a_addr < b_addr);
+}
+
+static inline int
+extent_ead_comp(const extent_t *a, const extent_t *b) {
+	uintptr_t a_eaddr = (uintptr_t)a;
+	uintptr_t b_eaddr = (uintptr_t)b;
+
+	return (a_eaddr > b_eaddr) - (a_eaddr < b_eaddr);
+}
+
+static inline int
+extent_snad_comp(const extent_t *a, const extent_t *b) {
+	int ret;
+
+	ret = extent_sn_comp(a, b);
+	if (ret != 0) {
+		return ret;
+	}
+
+	ret = extent_ad_comp(a, b);
+	return ret;
+}
+
+static inline int
+extent_esnead_comp(const extent_t *a, const extent_t *b) {
+	int ret;
+
+	ret = extent_esn_comp(a, b);
+	if (ret != 0) {
+		return ret;
+	}
+
+	ret = extent_ead_comp(a, b);
+	return ret;
+}
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
new file mode 100644
index 00000000..55f17ee4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
@@ -0,0 +1,10 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H
+#define JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H
+
+extern bool opt_retain;
+
+void *extent_alloc_mmap(void *new_addr, size_t size, size_t alignment,
+    bool *zero, bool *commit);
+bool extent_dalloc_mmap(void *addr, size_t size);
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
new file mode 100644
index 00000000..4873b9e9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
@@ -0,0 +1,219 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_STRUCTS_H
+#define JEMALLOC_INTERNAL_EXTENT_STRUCTS_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/bitmap.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/ph.h"
+#include "jemalloc/internal/size_classes.h"
+
+typedef enum {
+	extent_state_active   = 0,
+	extent_state_dirty    = 1,
+	extent_state_muzzy    = 2,
+	extent_state_retained = 3
+} extent_state_t;
+
+/* Extent (span of pages).  Use accessor functions for e_* fields. */
+struct extent_s {
+	/*
+	 * Bitfield containing several fields:
+	 *
+	 * a: arena_ind
+	 * b: slab
+	 * c: committed
+	 * d: dumpable
+	 * z: zeroed
+	 * t: state
+	 * i: szind
+	 * f: nfree
+	 * n: sn
+	 *
+	 * nnnnnnnn ... nnnnffff ffffffii iiiiiitt zdcbaaaa aaaaaaaa
+	 *
+	 * arena_ind: Arena from which this extent came, or all 1 bits if
+	 *            unassociated.
+	 *
+	 * slab: The slab flag indicates whether the extent is used for a slab
+	 *       of small regions.  This helps differentiate small size classes,
+	 *       and it indicates whether interior pointers can be looked up via
+	 *       iealloc().
+	 *
+	 * committed: The committed flag indicates whether physical memory is
+	 *            committed to the extent, whether explicitly or implicitly
+	 *            as on a system that overcommits and satisfies physical
+	 *            memory needs on demand via soft page faults.
+	 *
+	 * dumpable: The dumpable flag indicates whether or not we've set the
+	 *           memory in question to be dumpable.  Note that this
+	 *           interacts somewhat subtly with user-specified extent hooks,
+	 *           since we don't know if *they* are fiddling with
+	 *           dumpability (in which case, we don't want to undo whatever
+	 *           they're doing).  To deal with this scenario, we:
+	 *             - Make dumpable false only for memory allocated with the
+	 *               default hooks.
+	 *             - Only allow memory to go from non-dumpable to dumpable,
+	 *               and only once.
+	 *             - Never make the OS call to allow dumping when the
+	 *               dumpable bit is already set.
+	 *           These three constraints mean that we will never
+	 *           accidentally dump user memory that the user meant to set
+	 *           nondumpable with their extent hooks.
+	 *
+	 *
+	 * zeroed: The zeroed flag is used by extent recycling code to track
+	 *         whether memory is zero-filled.
+	 *
+	 * state: The state flag is an extent_state_t.
+	 *
+	 * szind: The szind flag indicates usable size class index for
+	 *        allocations residing in this extent, regardless of whether the
+	 *        extent is a slab.  Extent size and usable size often differ
+	 *        even for non-slabs, either due to sz_large_pad or promotion of
+	 *        sampled small regions.
+	 *
+	 * nfree: Number of free regions in slab.
+	 *
+	 * sn: Serial number (potentially non-unique).
+	 *
+	 *     Serial numbers may wrap around if !opt_retain, but as long as
+	 *     comparison functions fall back on address comparison for equal
+	 *     serial numbers, stable (if imperfect) ordering is maintained.
+	 *
+	 *     Serial numbers may not be unique even in the absence of
+	 *     wrap-around, e.g. when splitting an extent and assigning the same
+	 *     serial number to both resulting adjacent extents.
+	 */
+	uint64_t		e_bits;
+#define MASK(CURRENT_FIELD_WIDTH, CURRENT_FIELD_SHIFT) ((((((uint64_t)0x1U) << (CURRENT_FIELD_WIDTH)) - 1)) << (CURRENT_FIELD_SHIFT))
+
+#define EXTENT_BITS_ARENA_WIDTH  MALLOCX_ARENA_BITS
+#define EXTENT_BITS_ARENA_SHIFT  0
+#define EXTENT_BITS_ARENA_MASK  MASK(EXTENT_BITS_ARENA_WIDTH, EXTENT_BITS_ARENA_SHIFT)
+
+#define EXTENT_BITS_SLAB_WIDTH  1
+#define EXTENT_BITS_SLAB_SHIFT  (EXTENT_BITS_ARENA_WIDTH + EXTENT_BITS_ARENA_SHIFT)
+#define EXTENT_BITS_SLAB_MASK  MASK(EXTENT_BITS_SLAB_WIDTH, EXTENT_BITS_SLAB_SHIFT)
+
+#define EXTENT_BITS_COMMITTED_WIDTH  1
+#define EXTENT_BITS_COMMITTED_SHIFT  (EXTENT_BITS_SLAB_WIDTH + EXTENT_BITS_SLAB_SHIFT)
+#define EXTENT_BITS_COMMITTED_MASK  MASK(EXTENT_BITS_COMMITTED_WIDTH, EXTENT_BITS_COMMITTED_SHIFT)
+
+#define EXTENT_BITS_DUMPABLE_WIDTH  1
+#define EXTENT_BITS_DUMPABLE_SHIFT  (EXTENT_BITS_COMMITTED_WIDTH + EXTENT_BITS_COMMITTED_SHIFT)
+#define EXTENT_BITS_DUMPABLE_MASK  MASK(EXTENT_BITS_DUMPABLE_WIDTH, EXTENT_BITS_DUMPABLE_SHIFT)
+
+#define EXTENT_BITS_ZEROED_WIDTH  1
+#define EXTENT_BITS_ZEROED_SHIFT  (EXTENT_BITS_DUMPABLE_WIDTH + EXTENT_BITS_DUMPABLE_SHIFT)
+#define EXTENT_BITS_ZEROED_MASK  MASK(EXTENT_BITS_ZEROED_WIDTH, EXTENT_BITS_ZEROED_SHIFT)
+
+#define EXTENT_BITS_STATE_WIDTH  2
+#define EXTENT_BITS_STATE_SHIFT  (EXTENT_BITS_ZEROED_WIDTH + EXTENT_BITS_ZEROED_SHIFT)
+#define EXTENT_BITS_STATE_MASK  MASK(EXTENT_BITS_STATE_WIDTH, EXTENT_BITS_STATE_SHIFT)
+
+#define EXTENT_BITS_SZIND_WIDTH  LG_CEIL_NSIZES
+#define EXTENT_BITS_SZIND_SHIFT  (EXTENT_BITS_STATE_WIDTH + EXTENT_BITS_STATE_SHIFT)
+#define EXTENT_BITS_SZIND_MASK  MASK(EXTENT_BITS_SZIND_WIDTH, EXTENT_BITS_SZIND_SHIFT)
+
+#define EXTENT_BITS_NFREE_WIDTH  (LG_SLAB_MAXREGS + 1)
+#define EXTENT_BITS_NFREE_SHIFT  (EXTENT_BITS_SZIND_WIDTH + EXTENT_BITS_SZIND_SHIFT)
+#define EXTENT_BITS_NFREE_MASK  MASK(EXTENT_BITS_NFREE_WIDTH, EXTENT_BITS_NFREE_SHIFT)
+
+#define EXTENT_BITS_SN_SHIFT  (EXTENT_BITS_NFREE_WIDTH + EXTENT_BITS_NFREE_SHIFT)
+#define EXTENT_BITS_SN_MASK  (UINT64_MAX << EXTENT_BITS_SN_SHIFT)
+
+	/* Pointer to the extent that this structure is responsible for. */
+	void			*e_addr;
+
+	union {
+		/*
+		 * Extent size and serial number associated with the extent
+		 * structure (different than the serial number for the extent at
+		 * e_addr).
+		 *
+		 * ssssssss [...] ssssssss ssssnnnn nnnnnnnn
+		 */
+		size_t			e_size_esn;
+	#define EXTENT_SIZE_MASK	((size_t)~(PAGE-1))
+	#define EXTENT_ESN_MASK		((size_t)PAGE-1)
+		/* Base extent size, which may not be a multiple of PAGE. */
+		size_t			e_bsize;
+	};
+
+	/*
+	 * List linkage, used by a variety of lists:
+	 * - bin_t's slabs_full
+	 * - extents_t's LRU
+	 * - stashed dirty extents
+	 * - arena's large allocations
+	 */
+	ql_elm(extent_t)	ql_link;
+
+	/*
+	 * Linkage for per size class sn/address-ordered heaps, and
+	 * for extent_avail
+	 */
+	phn(extent_t)		ph_link;
+
+	union {
+		/* Small region slab metadata. */
+		arena_slab_data_t	e_slab_data;
+
+		/*
+		 * Profile counters, used for large objects.  Points to a
+		 * prof_tctx_t.
+		 */
+		atomic_p_t		e_prof_tctx;
+	};
+};
+typedef ql_head(extent_t) extent_list_t;
+typedef ph(extent_t) extent_tree_t;
+typedef ph(extent_t) extent_heap_t;
+
+/* Quantized collection of extents, with built-in LRU queue. */
+struct extents_s {
+	malloc_mutex_t		mtx;
+
+	/*
+	 * Quantized per size class heaps of extents.
+	 *
+	 * Synchronization: mtx.
+	 */
+	extent_heap_t		heaps[NPSIZES+1];
+
+	/*
+	 * Bitmap for which set bits correspond to non-empty heaps.
+	 *
+	 * Synchronization: mtx.
+	 */
+	bitmap_t		bitmap[BITMAP_GROUPS(NPSIZES+1)];
+
+	/*
+	 * LRU of all extents in heaps.
+	 *
+	 * Synchronization: mtx.
+	 */
+	extent_list_t		lru;
+
+	/*
+	 * Page sum for all extents in heaps.
+	 *
+	 * The synchronization here is a little tricky.  Modifications to npages
+	 * must hold mtx, but reads need not (though, a reader who sees npages
+	 * without holding the mutex can't assume anything about the rest of the
+	 * state of the extents_t).
+	 */
+	atomic_zu_t		npages;
+
+	/* All stored extents must be in the same state. */
+	extent_state_t		state;
+
+	/*
+	 * If true, delay coalescing until eviction; otherwise coalesce during
+	 * deallocation.
+	 */
+	bool			delay_coalesce;
+};
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
new file mode 100644
index 00000000..c0561d99
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
@@ -0,0 +1,17 @@
+#ifndef JEMALLOC_INTERNAL_EXTENT_TYPES_H
+#define JEMALLOC_INTERNAL_EXTENT_TYPES_H
+
+typedef struct extent_s extent_t;
+typedef struct extents_s extents_t;
+
+#define EXTENT_HOOKS_INITIALIZER	NULL
+
+#define EXTENT_GROW_MAX_PIND (NPSIZES - 1)
+
+/*
+ * When reuse (and split) an active extent, (1U << opt_lg_extent_max_active_fit)
+ * is the max ratio between the size of the active extent and the new extent.
+ */
+#define LG_EXTENT_MAX_ACTIVE_FIT_DEFAULT 6
+
+#endif /* JEMALLOC_INTERNAL_EXTENT_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
new file mode 100644
index 00000000..dcfc992d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
@@ -0,0 +1,318 @@
+#ifndef JEMALLOC_INTERNAL_HASH_H
+#define JEMALLOC_INTERNAL_HASH_H
+
+#include "jemalloc/internal/assert.h"
+
+/*
+ * The following hash function is based on MurmurHash3, placed into the public
+ * domain by Austin Appleby.  See https://github.com/aappleby/smhasher for
+ * details.
+ */
+
+/******************************************************************************/
+/* Internal implementation. */
+static inline uint32_t
+hash_rotl_32(uint32_t x, int8_t r) {
+	return ((x << r) | (x >> (32 - r)));
+}
+
+static inline uint64_t
+hash_rotl_64(uint64_t x, int8_t r) {
+	return ((x << r) | (x >> (64 - r)));
+}
+
+static inline uint32_t
+hash_get_block_32(const uint32_t *p, int i) {
+	/* Handle unaligned read. */
+	if (unlikely((uintptr_t)p & (sizeof(uint32_t)-1)) != 0) {
+		uint32_t ret;
+
+		memcpy(&ret, (uint8_t *)(p + i), sizeof(uint32_t));
+		return ret;
+	}
+
+	return p[i];
+}
+
+static inline uint64_t
+hash_get_block_64(const uint64_t *p, int i) {
+	/* Handle unaligned read. */
+	if (unlikely((uintptr_t)p & (sizeof(uint64_t)-1)) != 0) {
+		uint64_t ret;
+
+		memcpy(&ret, (uint8_t *)(p + i), sizeof(uint64_t));
+		return ret;
+	}
+
+	return p[i];
+}
+
+static inline uint32_t
+hash_fmix_32(uint32_t h) {
+	h ^= h >> 16;
+	h *= 0x85ebca6b;
+	h ^= h >> 13;
+	h *= 0xc2b2ae35;
+	h ^= h >> 16;
+
+	return h;
+}
+
+static inline uint64_t
+hash_fmix_64(uint64_t k) {
+	k ^= k >> 33;
+	k *= KQU(0xff51afd7ed558ccd);
+	k ^= k >> 33;
+	k *= KQU(0xc4ceb9fe1a85ec53);
+	k ^= k >> 33;
+
+	return k;
+}
+
+static inline uint32_t
+hash_x86_32(const void *key, int len, uint32_t seed) {
+	const uint8_t *data = (const uint8_t *) key;
+	const int nblocks = len / 4;
+
+	uint32_t h1 = seed;
+
+	const uint32_t c1 = 0xcc9e2d51;
+	const uint32_t c2 = 0x1b873593;
+
+	/* body */
+	{
+		const uint32_t *blocks = (const uint32_t *) (data + nblocks*4);
+		int i;
+
+		for (i = -nblocks; i; i++) {
+			uint32_t k1 = hash_get_block_32(blocks, i);
+
+			k1 *= c1;
+			k1 = hash_rotl_32(k1, 15);
+			k1 *= c2;
+
+			h1 ^= k1;
+			h1 = hash_rotl_32(h1, 13);
+			h1 = h1*5 + 0xe6546b64;
+		}
+	}
+
+	/* tail */
+	{
+		const uint8_t *tail = (const uint8_t *) (data + nblocks*4);
+
+		uint32_t k1 = 0;
+
+		switch (len & 3) {
+		case 3: k1 ^= tail[2] << 16;
+		case 2: k1 ^= tail[1] << 8;
+		case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
+			k1 *= c2; h1 ^= k1;
+		}
+	}
+
+	/* finalization */
+	h1 ^= len;
+
+	h1 = hash_fmix_32(h1);
+
+	return h1;
+}
+
+UNUSED static inline void
+hash_x86_128(const void *key, const int len, uint32_t seed,
+    uint64_t r_out[2]) {
+	const uint8_t * data = (const uint8_t *) key;
+	const int nblocks = len / 16;
+
+	uint32_t h1 = seed;
+	uint32_t h2 = seed;
+	uint32_t h3 = seed;
+	uint32_t h4 = seed;
+
+	const uint32_t c1 = 0x239b961b;
+	const uint32_t c2 = 0xab0e9789;
+	const uint32_t c3 = 0x38b34ae5;
+	const uint32_t c4 = 0xa1e38b93;
+
+	/* body */
+	{
+		const uint32_t *blocks = (const uint32_t *) (data + nblocks*16);
+		int i;
+
+		for (i = -nblocks; i; i++) {
+			uint32_t k1 = hash_get_block_32(blocks, i*4 + 0);
+			uint32_t k2 = hash_get_block_32(blocks, i*4 + 1);
+			uint32_t k3 = hash_get_block_32(blocks, i*4 + 2);
+			uint32_t k4 = hash_get_block_32(blocks, i*4 + 3);
+
+			k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
+
+			h1 = hash_rotl_32(h1, 19); h1 += h2;
+			h1 = h1*5 + 0x561ccd1b;
+
+			k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;
+
+			h2 = hash_rotl_32(h2, 17); h2 += h3;
+			h2 = h2*5 + 0x0bcaa747;
+
+			k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;
+
+			h3 = hash_rotl_32(h3, 15); h3 += h4;
+			h3 = h3*5 + 0x96cd1c35;
+
+			k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
+
+			h4 = hash_rotl_32(h4, 13); h4 += h1;
+			h4 = h4*5 + 0x32ac3b17;
+		}
+	}
+
+	/* tail */
+	{
+		const uint8_t *tail = (const uint8_t *) (data + nblocks*16);
+		uint32_t k1 = 0;
+		uint32_t k2 = 0;
+		uint32_t k3 = 0;
+		uint32_t k4 = 0;
+
+		switch (len & 15) {
+		case 15: k4 ^= tail[14] << 16;
+		case 14: k4 ^= tail[13] << 8;
+		case 13: k4 ^= tail[12] << 0;
+			k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
+
+		case 12: k3 ^= tail[11] << 24;
+		case 11: k3 ^= tail[10] << 16;
+		case 10: k3 ^= tail[ 9] << 8;
+		case  9: k3 ^= tail[ 8] << 0;
+		     k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;
+
+		case  8: k2 ^= tail[ 7] << 24;
+		case  7: k2 ^= tail[ 6] << 16;
+		case  6: k2 ^= tail[ 5] << 8;
+		case  5: k2 ^= tail[ 4] << 0;
+			k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;
+
+		case  4: k1 ^= tail[ 3] << 24;
+		case  3: k1 ^= tail[ 2] << 16;
+		case  2: k1 ^= tail[ 1] << 8;
+		case  1: k1 ^= tail[ 0] << 0;
+			k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
+		}
+	}
+
+	/* finalization */
+	h1 ^= len; h2 ^= len; h3 ^= len; h4 ^= len;
+
+	h1 += h2; h1 += h3; h1 += h4;
+	h2 += h1; h3 += h1; h4 += h1;
+
+	h1 = hash_fmix_32(h1);
+	h2 = hash_fmix_32(h2);
+	h3 = hash_fmix_32(h3);
+	h4 = hash_fmix_32(h4);
+
+	h1 += h2; h1 += h3; h1 += h4;
+	h2 += h1; h3 += h1; h4 += h1;
+
+	r_out[0] = (((uint64_t) h2) << 32) | h1;
+	r_out[1] = (((uint64_t) h4) << 32) | h3;
+}
+
+UNUSED static inline void
+hash_x64_128(const void *key, const int len, const uint32_t seed,
+    uint64_t r_out[2]) {
+	const uint8_t *data = (const uint8_t *) key;
+	const int nblocks = len / 16;
+
+	uint64_t h1 = seed;
+	uint64_t h2 = seed;
+
+	const uint64_t c1 = KQU(0x87c37b91114253d5);
+	const uint64_t c2 = KQU(0x4cf5ad432745937f);
+
+	/* body */
+	{
+		const uint64_t *blocks = (const uint64_t *) (data);
+		int i;
+
+		for (i = 0; i < nblocks; i++) {
+			uint64_t k1 = hash_get_block_64(blocks, i*2 + 0);
+			uint64_t k2 = hash_get_block_64(blocks, i*2 + 1);
+
+			k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;
+
+			h1 = hash_rotl_64(h1, 27); h1 += h2;
+			h1 = h1*5 + 0x52dce729;
+
+			k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;
+
+			h2 = hash_rotl_64(h2, 31); h2 += h1;
+			h2 = h2*5 + 0x38495ab5;
+		}
+	}
+
+	/* tail */
+	{
+		const uint8_t *tail = (const uint8_t*)(data + nblocks*16);
+		uint64_t k1 = 0;
+		uint64_t k2 = 0;
+
+		switch (len & 15) {
+		case 15: k2 ^= ((uint64_t)(tail[14])) << 48; /* falls through */
+		case 14: k2 ^= ((uint64_t)(tail[13])) << 40; /* falls through */
+		case 13: k2 ^= ((uint64_t)(tail[12])) << 32; /* falls through */
+		case 12: k2 ^= ((uint64_t)(tail[11])) << 24; /* falls through */
+		case 11: k2 ^= ((uint64_t)(tail[10])) << 16; /* falls through */
+		case 10: k2 ^= ((uint64_t)(tail[ 9])) << 8;  /* falls through */
+		case  9: k2 ^= ((uint64_t)(tail[ 8])) << 0;
+			k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;
+			/* falls through */
+		case  8: k1 ^= ((uint64_t)(tail[ 7])) << 56; /* falls through */
+		case  7: k1 ^= ((uint64_t)(tail[ 6])) << 48; /* falls through */
+		case  6: k1 ^= ((uint64_t)(tail[ 5])) << 40; /* falls through */
+		case  5: k1 ^= ((uint64_t)(tail[ 4])) << 32; /* falls through */
+		case  4: k1 ^= ((uint64_t)(tail[ 3])) << 24; /* falls through */
+		case  3: k1 ^= ((uint64_t)(tail[ 2])) << 16; /* falls through */
+		case  2: k1 ^= ((uint64_t)(tail[ 1])) << 8;  /* falls through */
+		case  1: k1 ^= ((uint64_t)(tail[ 0])) << 0;
+			k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;
+		}
+	}
+
+	/* finalization */
+	h1 ^= len; h2 ^= len;
+
+	h1 += h2;
+	h2 += h1;
+
+	h1 = hash_fmix_64(h1);
+	h2 = hash_fmix_64(h2);
+
+	h1 += h2;
+	h2 += h1;
+
+	r_out[0] = h1;
+	r_out[1] = h2;
+}
+
+/******************************************************************************/
+/* API. */
+static inline void
+hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) {
+	assert(len <= INT_MAX); /* Unfortunate implementation limitation. */
+
+#if (LG_SIZEOF_PTR == 3 && !defined(JEMALLOC_BIG_ENDIAN))
+	hash_x64_128(key, (int)len, seed, (uint64_t *)r_hash);
+#else
+	{
+		uint64_t hashes[2];
+		hash_x86_128(key, (int)len, seed, hashes);
+		r_hash[0] = (size_t)hashes[0];
+		r_hash[1] = (size_t)hashes[1];
+	}
+#endif
+}
+
+#endif /* JEMALLOC_INTERNAL_HASH_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
new file mode 100644
index 00000000..cd49afcb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
@@ -0,0 +1,19 @@
+#ifndef JEMALLOC_INTERNAL_HOOKS_H
+#define JEMALLOC_INTERNAL_HOOKS_H
+
+extern JEMALLOC_EXPORT void (*hooks_arena_new_hook)();
+extern JEMALLOC_EXPORT void (*hooks_libc_hook)();
+
+#define JEMALLOC_HOOK(fn, hook) ((void)(hook != NULL && (hook(), 0)), fn)
+
+#define open JEMALLOC_HOOK(open, hooks_libc_hook)
+#define read JEMALLOC_HOOK(read, hooks_libc_hook)
+#define write JEMALLOC_HOOK(write, hooks_libc_hook)
+#define readlink JEMALLOC_HOOK(readlink, hooks_libc_hook)
+#define close JEMALLOC_HOOK(close, hooks_libc_hook)
+#define creat JEMALLOC_HOOK(creat, hooks_libc_hook)
+#define secure_getenv JEMALLOC_HOOK(secure_getenv, hooks_libc_hook)
+/* Note that this is undef'd and re-define'd in src/prof.c. */
+#define _Unwind_Backtrace JEMALLOC_HOOK(_Unwind_Backtrace, hooks_libc_hook)
+
+#endif /* JEMALLOC_INTERNAL_HOOKS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
new file mode 100644
index 00000000..be70df51
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
@@ -0,0 +1,91 @@
+#ifndef JEMALLOC_INTERNAL_DECLS_H
+#define JEMALLOC_INTERNAL_DECLS_H
+
+#include <math.h>
+#ifdef _WIN32
+#  include <windows.h>
+#  include "msvc_compat/windows_extra.h"
+#  ifdef _WIN64
+#    if LG_VADDR <= 32
+#      error Generate the headers using x64 vcargs
+#    endif
+#  else
+#    if LG_VADDR > 32
+#      undef LG_VADDR
+#      define LG_VADDR 32
+#    endif
+#  endif
+#else
+#  include <sys/param.h>
+#  include <sys/mman.h>
+#  if !defined(__pnacl__) && !defined(__native_client__)
+#    include <sys/syscall.h>
+#    if !defined(SYS_write) && defined(__NR_write)
+#      define SYS_write __NR_write
+#    endif
+#    if defined(SYS_open) && defined(__aarch64__)
+       /* Android headers may define SYS_open to __NR_open even though
+        * __NR_open may not exist on AArch64 (superseded by __NR_openat). */
+#      undef SYS_open
+#    endif
+#    include <sys/uio.h>
+#  endif
+#  include <pthread.h>
+#  include <signal.h>
+#  ifdef JEMALLOC_OS_UNFAIR_LOCK
+#    include <os/lock.h>
+#  endif
+#  ifdef JEMALLOC_GLIBC_MALLOC_HOOK
+#    include <sched.h>
+#  endif
+#  include <errno.h>
+#  include <sys/time.h>
+#  include <time.h>
+#  ifdef JEMALLOC_HAVE_MACH_ABSOLUTE_TIME
+#    include <mach/mach_time.h>
+#  endif
+#endif
+#include <sys/types.h>
+
+#include <limits.h>
+#ifndef SIZE_T_MAX
+#  define SIZE_T_MAX	SIZE_MAX
+#endif
+#ifndef SSIZE_MAX
+#  define SSIZE_MAX	((ssize_t)(SIZE_T_MAX >> 1))
+#endif
+#include <stdarg.h>
+#include <stdbool.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <stddef.h>
+#ifndef offsetof
+#  define offsetof(type, member)	((size_t)&(((type *)NULL)->member))
+#endif
+#include <string.h>
+#include <strings.h>
+#include <ctype.h>
+#ifdef _MSC_VER
+#  include <io.h>
+typedef intptr_t ssize_t;
+#  define PATH_MAX 1024
+#  define STDERR_FILENO 2
+#  define __func__ __FUNCTION__
+#  ifdef JEMALLOC_HAS_RESTRICT
+#    define restrict __restrict
+#  endif
+/* Disable warnings about deprecated system functions. */
+#  pragma warning(disable: 4996)
+#if _MSC_VER < 1800
+static int
+isblank(int c) {
+	return (c == '\t' || c == ' ');
+}
+#endif
+#else
+#  include <unistd.h>
+#endif
+#include <fcntl.h>
+
+#endif /* JEMALLOC_INTERNAL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
new file mode 100644
index 00000000..8dad9a1d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
@@ -0,0 +1,366 @@
+#ifndef JEMALLOC_INTERNAL_DEFS_H_
+#define JEMALLOC_INTERNAL_DEFS_H_
+/*
+ * If JEMALLOC_PREFIX is defined via --with-jemalloc-prefix, it will cause all
+ * public APIs to be prefixed.  This makes it possible, with some care, to use
+ * multiple allocators simultaneously.
+ */
+#undef JEMALLOC_PREFIX
+#undef JEMALLOC_CPREFIX
+
+/*
+ * Define overrides for non-standard allocator-related functions if they are
+ * present on the system.
+ */
+#undef JEMALLOC_OVERRIDE___LIBC_CALLOC
+#undef JEMALLOC_OVERRIDE___LIBC_FREE
+#undef JEMALLOC_OVERRIDE___LIBC_MALLOC
+#undef JEMALLOC_OVERRIDE___LIBC_MEMALIGN
+#undef JEMALLOC_OVERRIDE___LIBC_REALLOC
+#undef JEMALLOC_OVERRIDE___LIBC_VALLOC
+#undef JEMALLOC_OVERRIDE___POSIX_MEMALIGN
+
+/*
+ * JEMALLOC_PRIVATE_NAMESPACE is used as a prefix for all library-private APIs.
+ * For shared libraries, symbol visibility mechanisms prevent these symbols
+ * from being exported, but for static libraries, naming collisions are a real
+ * possibility.
+ */
+#undef JEMALLOC_PRIVATE_NAMESPACE
+
+/*
+ * Hyper-threaded CPUs may need a special instruction inside spin loops in
+ * order to yield to another virtual CPU.
+ */
+#undef CPU_SPINWAIT
+/* 1 if CPU_SPINWAIT is defined, 0 otherwise. */
+#undef HAVE_CPU_SPINWAIT
+
+/*
+ * Number of significant bits in virtual addresses.  This may be less than the
+ * total number of bits in a pointer, e.g. on x64, for which the uppermost 16
+ * bits are the same as bit 47.
+ */
+#undef LG_VADDR
+
+/* Defined if C11 atomics are available. */
+#undef JEMALLOC_C11_ATOMICS
+
+/* Defined if GCC __atomic atomics are available. */
+#undef JEMALLOC_GCC_ATOMIC_ATOMICS
+
+/* Defined if GCC __sync atomics are available. */
+#undef JEMALLOC_GCC_SYNC_ATOMICS
+
+/*
+ * Defined if __sync_add_and_fetch(uint32_t *, uint32_t) and
+ * __sync_sub_and_fetch(uint32_t *, uint32_t) are available, despite
+ * __GCC_HAVE_SYNC_COMPARE_AND_SWAP_4 not being defined (which means the
+ * functions are defined in libgcc instead of being inlines).
+ */
+#undef JE_FORCE_SYNC_COMPARE_AND_SWAP_4
+
+/*
+ * Defined if __sync_add_and_fetch(uint64_t *, uint64_t) and
+ * __sync_sub_and_fetch(uint64_t *, uint64_t) are available, despite
+ * __GCC_HAVE_SYNC_COMPARE_AND_SWAP_8 not being defined (which means the
+ * functions are defined in libgcc instead of being inlines).
+ */
+#undef JE_FORCE_SYNC_COMPARE_AND_SWAP_8
+
+/*
+ * Defined if __builtin_clz() and __builtin_clzl() are available.
+ */
+#undef JEMALLOC_HAVE_BUILTIN_CLZ
+
+/*
+ * Defined if os_unfair_lock_*() functions are available, as provided by Darwin.
+ */
+#undef JEMALLOC_OS_UNFAIR_LOCK
+
+/*
+ * Defined if OSSpin*() functions are available, as provided by Darwin, and
+ * documented in the spinlock(3) manual page.
+ */
+#undef JEMALLOC_OSSPIN
+
+/* Defined if syscall(2) is usable. */
+#undef JEMALLOC_USE_SYSCALL
+
+/*
+ * Defined if secure_getenv(3) is available.
+ */
+#undef JEMALLOC_HAVE_SECURE_GETENV
+
+/*
+ * Defined if issetugid(2) is available.
+ */
+#undef JEMALLOC_HAVE_ISSETUGID
+
+/* Defined if pthread_atfork(3) is available. */
+#undef JEMALLOC_HAVE_PTHREAD_ATFORK
+
+/* Defined if pthread_setname_np(3) is available. */
+#undef JEMALLOC_HAVE_PTHREAD_SETNAME_NP
+
+/*
+ * Defined if clock_gettime(CLOCK_MONOTONIC_COARSE, ...) is available.
+ */
+#undef JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE
+
+/*
+ * Defined if clock_gettime(CLOCK_MONOTONIC, ...) is available.
+ */
+#undef JEMALLOC_HAVE_CLOCK_MONOTONIC
+
+/*
+ * Defined if mach_absolute_time() is available.
+ */
+#undef JEMALLOC_HAVE_MACH_ABSOLUTE_TIME
+
+/*
+ * Defined if _malloc_thread_cleanup() exists.  At least in the case of
+ * FreeBSD, pthread_key_create() allocates, which if used during malloc
+ * bootstrapping will cause recursion into the pthreads library.  Therefore, if
+ * _malloc_thread_cleanup() exists, use it as the basis for thread cleanup in
+ * malloc_tsd.
+ */
+#undef JEMALLOC_MALLOC_THREAD_CLEANUP
+
+/*
+ * Defined if threaded initialization is known to be safe on this platform.
+ * Among other things, it must be possible to initialize a mutex without
+ * triggering allocation in order for threaded allocation to be safe.
+ */
+#undef JEMALLOC_THREADED_INIT
+
+/*
+ * Defined if the pthreads implementation defines
+ * _pthread_mutex_init_calloc_cb(), in which case the function is used in order
+ * to avoid recursive allocation during mutex initialization.
+ */
+#undef JEMALLOC_MUTEX_INIT_CB
+
+/* Non-empty if the tls_model attribute is supported. */
+#undef JEMALLOC_TLS_MODEL
+
+/*
+ * JEMALLOC_DEBUG enables assertions and other sanity checks, and disables
+ * inline functions.
+ */
+#undef JEMALLOC_DEBUG
+
+/* JEMALLOC_STATS enables statistics calculation. */
+#undef JEMALLOC_STATS
+
+/* JEMALLOC_PROF enables allocation profiling. */
+#undef JEMALLOC_PROF
+
+/* Use libunwind for profile backtracing if defined. */
+#undef JEMALLOC_PROF_LIBUNWIND
+
+/* Use libgcc for profile backtracing if defined. */
+#undef JEMALLOC_PROF_LIBGCC
+
+/* Use gcc intrinsics for profile backtracing if defined. */
+#undef JEMALLOC_PROF_GCC
+
+/*
+ * JEMALLOC_DSS enables use of sbrk(2) to allocate extents from the data storage
+ * segment (DSS).
+ */
+#undef JEMALLOC_DSS
+
+/* Support memory filling (junk/zero). */
+#undef JEMALLOC_FILL
+
+/* Support utrace(2)-based tracing. */
+#undef JEMALLOC_UTRACE
+
+/* Support optional abort() on OOM. */
+#undef JEMALLOC_XMALLOC
+
+/* Support lazy locking (avoid locking unless a second thread is launched). */
+#undef JEMALLOC_LAZY_LOCK
+
+/*
+ * Minimum allocation alignment is 2^LG_QUANTUM bytes (ignoring tiny size
+ * classes).
+ */
+#undef LG_QUANTUM
+
+/* One page is 2^LG_PAGE bytes. */
+#undef LG_PAGE
+
+/*
+ * One huge page is 2^LG_HUGEPAGE bytes.  Note that this is defined even if the
+ * system does not explicitly support huge pages; system calls that require
+ * explicit huge page support are separately configured.
+ */
+#undef LG_HUGEPAGE
+
+/*
+ * If defined, adjacent virtual memory mappings with identical attributes
+ * automatically coalesce, and they fragment when changes are made to subranges.
+ * This is the normal order of things for mmap()/munmap(), but on Windows
+ * VirtualAlloc()/VirtualFree() operations must be precisely matched, i.e.
+ * mappings do *not* coalesce/fragment.
+ */
+#undef JEMALLOC_MAPS_COALESCE
+
+/*
+ * If defined, retain memory for later reuse by default rather than using e.g.
+ * munmap() to unmap freed extents.  This is enabled on 64-bit Linux because
+ * common sequences of mmap()/munmap() calls will cause virtual memory map
+ * holes.
+ */
+#undef JEMALLOC_RETAIN
+
+/* TLS is used to map arenas and magazine caches to threads. */
+#undef JEMALLOC_TLS
+
+/*
+ * Used to mark unreachable code to quiet "end of non-void" compiler warnings.
+ * Don't use this directly; instead use unreachable() from util.h
+ */
+#undef JEMALLOC_INTERNAL_UNREACHABLE
+
+/*
+ * ffs*() functions to use for bitmapping.  Don't use these directly; instead,
+ * use ffs_*() from util.h.
+ */
+#undef JEMALLOC_INTERNAL_FFSLL
+#undef JEMALLOC_INTERNAL_FFSL
+#undef JEMALLOC_INTERNAL_FFS
+
+/*
+ * If defined, explicitly attempt to more uniformly distribute large allocation
+ * pointer alignments across all cache indices.
+ */
+#undef JEMALLOC_CACHE_OBLIVIOUS
+
+/*
+ * If defined, enable logging facilities.  We make this a configure option to
+ * avoid taking extra branches everywhere.
+ */
+#undef JEMALLOC_LOG
+
+/*
+ * Darwin (OS X) uses zones to work around Mach-O symbol override shortcomings.
+ */
+#undef JEMALLOC_ZONE
+
+/*
+ * Methods for determining whether the OS overcommits.
+ * JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY: Linux's
+ *                                         /proc/sys/vm.overcommit_memory file.
+ * JEMALLOC_SYSCTL_VM_OVERCOMMIT: FreeBSD's vm.overcommit sysctl.
+ */
+#undef JEMALLOC_SYSCTL_VM_OVERCOMMIT
+#undef JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY
+
+/* Defined if madvise(2) is available. */
+#undef JEMALLOC_HAVE_MADVISE
+
+/*
+ * Defined if transparent huge pages are supported via the MADV_[NO]HUGEPAGE
+ * arguments to madvise(2).
+ */
+#undef JEMALLOC_HAVE_MADVISE_HUGE
+
+/*
+ * Methods for purging unused pages differ between operating systems.
+ *
+ *   madvise(..., MADV_FREE) : This marks pages as being unused, such that they
+ *                             will be discarded rather than swapped out.
+ *   madvise(..., MADV_DONTNEED) : If JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS is
+ *                                 defined, this immediately discards pages,
+ *                                 such that new pages will be demand-zeroed if
+ *                                 the address region is later touched;
+ *                                 otherwise this behaves similarly to
+ *                                 MADV_FREE, though typically with higher
+ *                                 system overhead.
+ */
+#undef JEMALLOC_PURGE_MADVISE_FREE
+#undef JEMALLOC_PURGE_MADVISE_DONTNEED
+#undef JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS
+
+/* Defined if madvise(2) is available but MADV_FREE is not (x86 Linux only). */
+#undef JEMALLOC_DEFINE_MADVISE_FREE
+
+/*
+ * Defined if MADV_DO[NT]DUMP is supported as an argument to madvise.
+ */
+#undef JEMALLOC_MADVISE_DONTDUMP
+
+/*
+ * Defined if transparent huge pages (THPs) are supported via the
+ * MADV_[NO]HUGEPAGE arguments to madvise(2), and THP support is enabled.
+ */
+#undef JEMALLOC_THP
+
+/* Define if operating system has alloca.h header. */
+#undef JEMALLOC_HAS_ALLOCA_H
+
+/* C99 restrict keyword supported. */
+#undef JEMALLOC_HAS_RESTRICT
+
+/* For use by hash code. */
+#undef JEMALLOC_BIG_ENDIAN
+
+/* sizeof(int) == 2^LG_SIZEOF_INT. */
+#undef LG_SIZEOF_INT
+
+/* sizeof(long) == 2^LG_SIZEOF_LONG. */
+#undef LG_SIZEOF_LONG
+
+/* sizeof(long long) == 2^LG_SIZEOF_LONG_LONG. */
+#undef LG_SIZEOF_LONG_LONG
+
+/* sizeof(intmax_t) == 2^LG_SIZEOF_INTMAX_T. */
+#undef LG_SIZEOF_INTMAX_T
+
+/* glibc malloc hooks (__malloc_hook, __realloc_hook, __free_hook). */
+#undef JEMALLOC_GLIBC_MALLOC_HOOK
+
+/* glibc memalign hook. */
+#undef JEMALLOC_GLIBC_MEMALIGN_HOOK
+
+/* pthread support */
+#undef JEMALLOC_HAVE_PTHREAD
+
+/* dlsym() support */
+#undef JEMALLOC_HAVE_DLSYM
+
+/* Adaptive mutex support in pthreads. */
+#undef JEMALLOC_HAVE_PTHREAD_MUTEX_ADAPTIVE_NP
+
+/* GNU specific sched_getcpu support */
+#undef JEMALLOC_HAVE_SCHED_GETCPU
+
+/* GNU specific sched_setaffinity support */
+#undef JEMALLOC_HAVE_SCHED_SETAFFINITY
+
+/*
+ * If defined, all the features necessary for background threads are present.
+ */
+#undef JEMALLOC_BACKGROUND_THREAD
+
+/*
+ * If defined, jemalloc symbols are not exported (doesn't work when
+ * JEMALLOC_PREFIX is not defined).
+ */
+#undef JEMALLOC_EXPORT
+
+/* config.malloc_conf options string. */
+#undef JEMALLOC_CONFIG_MALLOC_CONF
+
+/* If defined, jemalloc takes the malloc/free/etc. symbol names. */
+#undef JEMALLOC_IS_MALLOC
+
+/*
+ * Defined if strerror_r returns char * if _GNU_SOURCE is defined.
+ */
+#undef JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE
+
+#endif /* JEMALLOC_INTERNAL_DEFS_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
new file mode 100644
index 00000000..e10fb275
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
@@ -0,0 +1,53 @@
+#ifndef JEMALLOC_INTERNAL_EXTERNS_H
+#define JEMALLOC_INTERNAL_EXTERNS_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/tsd_types.h"
+
+/* TSD checks this to set thread local slow state accordingly. */
+extern bool malloc_slow;
+
+/* Run-time options. */
+extern bool opt_abort;
+extern bool opt_abort_conf;
+extern const char *opt_junk;
+extern bool opt_junk_alloc;
+extern bool opt_junk_free;
+extern bool opt_utrace;
+extern bool opt_xmalloc;
+extern bool opt_zero;
+extern unsigned opt_narenas;
+
+/* Number of CPUs. */
+extern unsigned ncpus;
+
+/* Number of arenas used for automatic multiplexing of threads and arenas. */
+extern unsigned narenas_auto;
+
+/*
+ * Arenas that are used to service external requests.  Not all elements of the
+ * arenas array are necessarily used; arenas are created lazily as needed.
+ */
+extern atomic_p_t arenas[];
+
+void *a0malloc(size_t size);
+void a0dalloc(void *ptr);
+void *bootstrap_malloc(size_t size);
+void *bootstrap_calloc(size_t num, size_t size);
+void bootstrap_free(void *ptr);
+void arena_set(unsigned ind, arena_t *arena);
+unsigned narenas_total_get(void);
+arena_t *arena_init(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
+arena_tdata_t *arena_tdata_get_hard(tsd_t *tsd, unsigned ind);
+arena_t *arena_choose_hard(tsd_t *tsd, bool internal);
+void arena_migrate(tsd_t *tsd, unsigned oldind, unsigned newind);
+void iarena_cleanup(tsd_t *tsd);
+void arena_cleanup(tsd_t *tsd);
+void arenas_tdata_cleanup(tsd_t *tsd);
+void jemalloc_prefork(void);
+void jemalloc_postfork_parent(void);
+void jemalloc_postfork_child(void);
+bool malloc_initialized(void);
+
+#endif /* JEMALLOC_INTERNAL_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
new file mode 100644
index 00000000..437eaa40
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
@@ -0,0 +1,94 @@
+#ifndef JEMALLOC_INTERNAL_INCLUDES_H
+#define JEMALLOC_INTERNAL_INCLUDES_H
+
+/*
+ * jemalloc can conceptually be broken into components (arena, tcache, etc.),
+ * but there are circular dependencies that cannot be broken without
+ * substantial performance degradation.
+ *
+ * Historically, we dealt with this by each header into four sections (types,
+ * structs, externs, and inlines), and included each header file multiple times
+ * in this file, picking out the portion we want on each pass using the
+ * following #defines:
+ *   JEMALLOC_H_TYPES   : Preprocessor-defined constants and psuedo-opaque data
+ *                        types.
+ *   JEMALLOC_H_STRUCTS : Data structures.
+ *   JEMALLOC_H_EXTERNS : Extern data declarations and function prototypes.
+ *   JEMALLOC_H_INLINES : Inline functions.
+ *
+ * We're moving toward a world in which the dependencies are explicit; each file
+ * will #include the headers it depends on (rather than relying on them being
+ * implicitly available via this file including every header file in the
+ * project).
+ *
+ * We're now in an intermediate state: we've broken up the header files to avoid
+ * having to include each one multiple times, but have not yet moved the
+ * dependency information into the header files (i.e. we still rely on the
+ * ordering in this file to ensure all a header's dependencies are available in
+ * its translation unit).  Each component is now broken up into multiple header
+ * files, corresponding to the sections above (e.g. instead of "foo.h", we now
+ * have "foo_types.h", "foo_structs.h", "foo_externs.h", "foo_inlines.h").
+ *
+ * Those files which have been converted to explicitly include their
+ * inter-component dependencies are now in the initial HERMETIC HEADERS
+ * section.  All headers may still rely on jemalloc_preamble.h (which, by fiat,
+ * must be included first in every translation unit) for system headers and
+ * global jemalloc definitions, however.
+ */
+
+/******************************************************************************/
+/* TYPES */
+/******************************************************************************/
+
+#include "jemalloc/internal/extent_types.h"
+#include "jemalloc/internal/base_types.h"
+#include "jemalloc/internal/arena_types.h"
+#include "jemalloc/internal/tcache_types.h"
+#include "jemalloc/internal/prof_types.h"
+
+/******************************************************************************/
+/* STRUCTS */
+/******************************************************************************/
+
+#include "jemalloc/internal/arena_structs_a.h"
+#include "jemalloc/internal/extent_structs.h"
+#include "jemalloc/internal/base_structs.h"
+#include "jemalloc/internal/prof_structs.h"
+#include "jemalloc/internal/arena_structs_b.h"
+#include "jemalloc/internal/tcache_structs.h"
+#include "jemalloc/internal/background_thread_structs.h"
+
+/******************************************************************************/
+/* EXTERNS */
+/******************************************************************************/
+
+#include "jemalloc/internal/jemalloc_internal_externs.h"
+#include "jemalloc/internal/extent_externs.h"
+#include "jemalloc/internal/base_externs.h"
+#include "jemalloc/internal/arena_externs.h"
+#include "jemalloc/internal/large_externs.h"
+#include "jemalloc/internal/tcache_externs.h"
+#include "jemalloc/internal/prof_externs.h"
+#include "jemalloc/internal/background_thread_externs.h"
+
+/******************************************************************************/
+/* INLINES */
+/******************************************************************************/
+
+#include "jemalloc/internal/jemalloc_internal_inlines_a.h"
+#include "jemalloc/internal/base_inlines.h"
+/*
+ * Include portions of arena code interleaved with tcache code in order to
+ * resolve circular dependencies.
+ */
+#include "jemalloc/internal/prof_inlines_a.h"
+#include "jemalloc/internal/arena_inlines_a.h"
+#include "jemalloc/internal/extent_inlines.h"
+#include "jemalloc/internal/jemalloc_internal_inlines_b.h"
+#include "jemalloc/internal/tcache_inlines.h"
+#include "jemalloc/internal/arena_inlines_b.h"
+#include "jemalloc/internal/jemalloc_internal_inlines_c.h"
+#include "jemalloc/internal/prof_inlines_b.h"
+#include "jemalloc/internal/background_thread_inlines.h"
+
+#endif /* JEMALLOC_INTERNAL_INCLUDES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
new file mode 100644
index 00000000..c6a1f7eb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
@@ -0,0 +1,172 @@
+#ifndef JEMALLOC_INTERNAL_INLINES_A_H
+#define JEMALLOC_INTERNAL_INLINES_A_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/bit_util.h"
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/ticker.h"
+
+JEMALLOC_ALWAYS_INLINE malloc_cpuid_t
+malloc_getcpu(void) {
+	assert(have_percpu_arena);
+#if defined(JEMALLOC_HAVE_SCHED_GETCPU)
+	return (malloc_cpuid_t)sched_getcpu();
+#else
+	not_reached();
+	return -1;
+#endif
+}
+
+/* Return the chosen arena index based on current cpu. */
+JEMALLOC_ALWAYS_INLINE unsigned
+percpu_arena_choose(void) {
+	assert(have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena));
+
+	malloc_cpuid_t cpuid = malloc_getcpu();
+	assert(cpuid >= 0);
+
+	unsigned arena_ind;
+	if ((opt_percpu_arena == percpu_arena) || ((unsigned)cpuid < ncpus /
+	    2)) {
+		arena_ind = cpuid;
+	} else {
+		assert(opt_percpu_arena == per_phycpu_arena);
+		/* Hyper threads on the same physical CPU share arena. */
+		arena_ind = cpuid - ncpus / 2;
+	}
+
+	return arena_ind;
+}
+
+/* Return the limit of percpu auto arena range, i.e. arenas[0...ind_limit). */
+JEMALLOC_ALWAYS_INLINE unsigned
+percpu_arena_ind_limit(percpu_arena_mode_t mode) {
+	assert(have_percpu_arena && PERCPU_ARENA_ENABLED(mode));
+	if (mode == per_phycpu_arena && ncpus > 1) {
+		if (ncpus % 2) {
+			/* This likely means a misconfig. */
+			return ncpus / 2 + 1;
+		}
+		return ncpus / 2;
+	} else {
+		return ncpus;
+	}
+}
+
+static inline arena_tdata_t *
+arena_tdata_get(tsd_t *tsd, unsigned ind, bool refresh_if_missing) {
+	arena_tdata_t *tdata;
+	arena_tdata_t *arenas_tdata = tsd_arenas_tdata_get(tsd);
+
+	if (unlikely(arenas_tdata == NULL)) {
+		/* arenas_tdata hasn't been initialized yet. */
+		return arena_tdata_get_hard(tsd, ind);
+	}
+	if (unlikely(ind >= tsd_narenas_tdata_get(tsd))) {
+		/*
+		 * ind is invalid, cache is old (too small), or tdata to be
+		 * initialized.
+		 */
+		return (refresh_if_missing ? arena_tdata_get_hard(tsd, ind) :
+		    NULL);
+	}
+
+	tdata = &arenas_tdata[ind];
+	if (likely(tdata != NULL) || !refresh_if_missing) {
+		return tdata;
+	}
+	return arena_tdata_get_hard(tsd, ind);
+}
+
+static inline arena_t *
+arena_get(tsdn_t *tsdn, unsigned ind, bool init_if_missing) {
+	arena_t *ret;
+
+	assert(ind < MALLOCX_ARENA_LIMIT);
+
+	ret = (arena_t *)atomic_load_p(&arenas[ind], ATOMIC_ACQUIRE);
+	if (unlikely(ret == NULL)) {
+		if (init_if_missing) {
+			ret = arena_init(tsdn, ind,
+			    (extent_hooks_t *)&extent_hooks_default);
+		}
+	}
+	return ret;
+}
+
+static inline ticker_t *
+decay_ticker_get(tsd_t *tsd, unsigned ind) {
+	arena_tdata_t *tdata;
+
+	tdata = arena_tdata_get(tsd, ind, true);
+	if (unlikely(tdata == NULL)) {
+		return NULL;
+	}
+	return &tdata->decay_ticker;
+}
+
+JEMALLOC_ALWAYS_INLINE cache_bin_t *
+tcache_small_bin_get(tcache_t *tcache, szind_t binind) {
+	assert(binind < NBINS);
+	return &tcache->bins_small[binind];
+}
+
+JEMALLOC_ALWAYS_INLINE cache_bin_t *
+tcache_large_bin_get(tcache_t *tcache, szind_t binind) {
+	assert(binind >= NBINS &&binind < nhbins);
+	return &tcache->bins_large[binind - NBINS];
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tcache_available(tsd_t *tsd) {
+	/*
+	 * Thread specific auto tcache might be unavailable if: 1) during tcache
+	 * initialization, or 2) disabled through thread.tcache.enabled mallctl
+	 * or config options.  This check covers all cases.
+	 */
+	if (likely(tsd_tcache_enabled_get(tsd))) {
+		/* Associated arena == NULL implies tcache init in progress. */
+		assert(tsd_tcachep_get(tsd)->arena == NULL ||
+		    tcache_small_bin_get(tsd_tcachep_get(tsd), 0)->avail !=
+		    NULL);
+		return true;
+	}
+
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE tcache_t *
+tcache_get(tsd_t *tsd) {
+	if (!tcache_available(tsd)) {
+		return NULL;
+	}
+
+	return tsd_tcachep_get(tsd);
+}
+
+static inline void
+pre_reentrancy(tsd_t *tsd, arena_t *arena) {
+	/* arena is the current context.  Reentry from a0 is not allowed. */
+	assert(arena != arena_get(tsd_tsdn(tsd), 0, false));
+
+	bool fast = tsd_fast(tsd);
+	assert(tsd_reentrancy_level_get(tsd) < INT8_MAX);
+	++*tsd_reentrancy_levelp_get(tsd);
+	if (fast) {
+		/* Prepare slow path for reentrancy. */
+		tsd_slow_update(tsd);
+		assert(tsd->state == tsd_state_nominal_slow);
+	}
+}
+
+static inline void
+post_reentrancy(tsd_t *tsd) {
+	int8_t *reentrancy_level = tsd_reentrancy_levelp_get(tsd);
+	assert(*reentrancy_level > 0);
+	if (--*reentrancy_level == 0) {
+		tsd_slow_update(tsd);
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
new file mode 100644
index 00000000..2e76e5d8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
@@ -0,0 +1,86 @@
+#ifndef JEMALLOC_INTERNAL_INLINES_B_H
+#define JEMALLOC_INTERNAL_INLINES_B_H
+
+#include "jemalloc/internal/rtree.h"
+
+/* Choose an arena based on a per-thread value. */
+static inline arena_t *
+arena_choose_impl(tsd_t *tsd, arena_t *arena, bool internal) {
+	arena_t *ret;
+
+	if (arena != NULL) {
+		return arena;
+	}
+
+	/* During reentrancy, arena 0 is the safest bet. */
+	if (unlikely(tsd_reentrancy_level_get(tsd) > 0)) {
+		return arena_get(tsd_tsdn(tsd), 0, true);
+	}
+
+	ret = internal ? tsd_iarena_get(tsd) : tsd_arena_get(tsd);
+	if (unlikely(ret == NULL)) {
+		ret = arena_choose_hard(tsd, internal);
+		assert(ret);
+		if (tcache_available(tsd)) {
+			tcache_t *tcache = tcache_get(tsd);
+			if (tcache->arena != NULL) {
+				/* See comments in tcache_data_init().*/
+				assert(tcache->arena ==
+				    arena_get(tsd_tsdn(tsd), 0, false));
+				if (tcache->arena != ret) {
+					tcache_arena_reassociate(tsd_tsdn(tsd),
+					    tcache, ret);
+				}
+			} else {
+				tcache_arena_associate(tsd_tsdn(tsd), tcache,
+				    ret);
+			}
+		}
+	}
+
+	/*
+	 * Note that for percpu arena, if the current arena is outside of the
+	 * auto percpu arena range, (i.e. thread is assigned to a manually
+	 * managed arena), then percpu arena is skipped.
+	 */
+	if (have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena) &&
+	    !internal && (arena_ind_get(ret) <
+	    percpu_arena_ind_limit(opt_percpu_arena)) && (ret->last_thd !=
+	    tsd_tsdn(tsd))) {
+		unsigned ind = percpu_arena_choose();
+		if (arena_ind_get(ret) != ind) {
+			percpu_arena_update(tsd, ind);
+			ret = tsd_arena_get(tsd);
+		}
+		ret->last_thd = tsd_tsdn(tsd);
+	}
+
+	return ret;
+}
+
+static inline arena_t *
+arena_choose(tsd_t *tsd, arena_t *arena) {
+	return arena_choose_impl(tsd, arena, false);
+}
+
+static inline arena_t *
+arena_ichoose(tsd_t *tsd, arena_t *arena) {
+	return arena_choose_impl(tsd, arena, true);
+}
+
+static inline bool
+arena_is_auto(arena_t *arena) {
+	assert(narenas_auto > 0);
+	return (arena_ind_get(arena) < narenas_auto);
+}
+
+JEMALLOC_ALWAYS_INLINE extent_t *
+iealloc(tsdn_t *tsdn, const void *ptr) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	return rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true);
+}
+
+#endif /* JEMALLOC_INTERNAL_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
new file mode 100644
index 00000000..b19a9420
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
@@ -0,0 +1,257 @@
+#ifndef JEMALLOC_INTERNAL_INLINES_C_H
+#define JEMALLOC_INTERNAL_INLINES_C_H
+
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/sz.h"
+#include "jemalloc/internal/witness.h"
+
+/*
+ * Translating the names of the 'i' functions:
+ *   Abbreviations used in the first part of the function name (before
+ *   alloc/dalloc) describe what that function accomplishes:
+ *     a: arena (query)
+ *     s: size (query, or sized deallocation)
+ *     e: extent (query)
+ *     p: aligned (allocates)
+ *     vs: size (query, without knowing that the pointer is into the heap)
+ *     r: rallocx implementation
+ *     x: xallocx implementation
+ *   Abbreviations used in the second part of the function name (after
+ *   alloc/dalloc) describe the arguments it takes
+ *     z: whether to return zeroed memory
+ *     t: accepts a tcache_t * parameter
+ *     m: accepts an arena_t * parameter
+ */
+
+JEMALLOC_ALWAYS_INLINE arena_t *
+iaalloc(tsdn_t *tsdn, const void *ptr) {
+	assert(ptr != NULL);
+
+	return arena_aalloc(tsdn, ptr);
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+isalloc(tsdn_t *tsdn, const void *ptr) {
+	assert(ptr != NULL);
+
+	return arena_salloc(tsdn, ptr);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+iallocztm(tsdn_t *tsdn, size_t size, szind_t ind, bool zero, tcache_t *tcache,
+    bool is_internal, arena_t *arena, bool slow_path) {
+	void *ret;
+
+	assert(size != 0);
+	assert(!is_internal || tcache == NULL);
+	assert(!is_internal || arena == NULL || arena_is_auto(arena));
+	if (!tsdn_null(tsdn) && tsd_reentrancy_level_get(tsdn_tsd(tsdn)) == 0) {
+		witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+		    WITNESS_RANK_CORE, 0);
+	}
+
+	ret = arena_malloc(tsdn, arena, size, ind, zero, tcache, slow_path);
+	if (config_stats && is_internal && likely(ret != NULL)) {
+		arena_internal_add(iaalloc(tsdn, ret), isalloc(tsdn, ret));
+	}
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+ialloc(tsd_t *tsd, size_t size, szind_t ind, bool zero, bool slow_path) {
+	return iallocztm(tsd_tsdn(tsd), size, ind, zero, tcache_get(tsd), false,
+	    NULL, slow_path);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+ipallocztm(tsdn_t *tsdn, size_t usize, size_t alignment, bool zero,
+    tcache_t *tcache, bool is_internal, arena_t *arena) {
+	void *ret;
+
+	assert(usize != 0);
+	assert(usize == sz_sa2u(usize, alignment));
+	assert(!is_internal || tcache == NULL);
+	assert(!is_internal || arena == NULL || arena_is_auto(arena));
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	ret = arena_palloc(tsdn, arena, usize, alignment, zero, tcache);
+	assert(ALIGNMENT_ADDR2BASE(ret, alignment) == ret);
+	if (config_stats && is_internal && likely(ret != NULL)) {
+		arena_internal_add(iaalloc(tsdn, ret), isalloc(tsdn, ret));
+	}
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+ipalloct(tsdn_t *tsdn, size_t usize, size_t alignment, bool zero,
+    tcache_t *tcache, arena_t *arena) {
+	return ipallocztm(tsdn, usize, alignment, zero, tcache, false, arena);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+ipalloc(tsd_t *tsd, size_t usize, size_t alignment, bool zero) {
+	return ipallocztm(tsd_tsdn(tsd), usize, alignment, zero,
+	    tcache_get(tsd), false, NULL);
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+ivsalloc(tsdn_t *tsdn, const void *ptr) {
+	return arena_vsalloc(tsdn, ptr);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+idalloctm(tsdn_t *tsdn, void *ptr, tcache_t *tcache, alloc_ctx_t *alloc_ctx,
+    bool is_internal, bool slow_path) {
+	assert(ptr != NULL);
+	assert(!is_internal || tcache == NULL);
+	assert(!is_internal || arena_is_auto(iaalloc(tsdn, ptr)));
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+	if (config_stats && is_internal) {
+		arena_internal_sub(iaalloc(tsdn, ptr), isalloc(tsdn, ptr));
+	}
+	if (!is_internal && !tsdn_null(tsdn) &&
+	    tsd_reentrancy_level_get(tsdn_tsd(tsdn)) != 0) {
+		assert(tcache == NULL);
+	}
+	arena_dalloc(tsdn, ptr, tcache, alloc_ctx, slow_path);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+idalloc(tsd_t *tsd, void *ptr) {
+	idalloctm(tsd_tsdn(tsd), ptr, tcache_get(tsd), NULL, false, true);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+isdalloct(tsdn_t *tsdn, void *ptr, size_t size, tcache_t *tcache,
+    alloc_ctx_t *alloc_ctx, bool slow_path) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+	arena_sdalloc(tsdn, ptr, size, tcache, alloc_ctx, slow_path);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+iralloct_realign(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
+    size_t extra, size_t alignment, bool zero, tcache_t *tcache,
+    arena_t *arena) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+	void *p;
+	size_t usize, copysize;
+
+	usize = sz_sa2u(size + extra, alignment);
+	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+		return NULL;
+	}
+	p = ipalloct(tsdn, usize, alignment, zero, tcache, arena);
+	if (p == NULL) {
+		if (extra == 0) {
+			return NULL;
+		}
+		/* Try again, without extra this time. */
+		usize = sz_sa2u(size, alignment);
+		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+			return NULL;
+		}
+		p = ipalloct(tsdn, usize, alignment, zero, tcache, arena);
+		if (p == NULL) {
+			return NULL;
+		}
+	}
+	/*
+	 * Copy at most size bytes (not size+extra), since the caller has no
+	 * expectation that the extra bytes will be reliably preserved.
+	 */
+	copysize = (size < oldsize) ? size : oldsize;
+	memcpy(p, ptr, copysize);
+	isdalloct(tsdn, ptr, oldsize, tcache, NULL, true);
+	return p;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+iralloct(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size, size_t alignment,
+    bool zero, tcache_t *tcache, arena_t *arena) {
+	assert(ptr != NULL);
+	assert(size != 0);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	if (alignment != 0 && ((uintptr_t)ptr & ((uintptr_t)alignment-1))
+	    != 0) {
+		/*
+		 * Existing object alignment is inadequate; allocate new space
+		 * and copy.
+		 */
+		return iralloct_realign(tsdn, ptr, oldsize, size, 0, alignment,
+		    zero, tcache, arena);
+	}
+
+	return arena_ralloc(tsdn, arena, ptr, oldsize, size, alignment, zero,
+	    tcache);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+iralloc(tsd_t *tsd, void *ptr, size_t oldsize, size_t size, size_t alignment,
+    bool zero) {
+	return iralloct(tsd_tsdn(tsd), ptr, oldsize, size, alignment, zero,
+	    tcache_get(tsd), NULL);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+ixalloc(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size, size_t extra,
+    size_t alignment, bool zero) {
+	assert(ptr != NULL);
+	assert(size != 0);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	if (alignment != 0 && ((uintptr_t)ptr & ((uintptr_t)alignment-1))
+	    != 0) {
+		/* Existing object alignment is inadequate. */
+		return true;
+	}
+
+	return arena_ralloc_no_move(tsdn, ptr, oldsize, size, extra, zero);
+}
+
+JEMALLOC_ALWAYS_INLINE int
+iget_defrag_hint(tsdn_t *tsdn, void* ptr) {
+	int defrag = 0;
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	szind_t szind;
+	bool is_slab;
+	rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr, true, &szind, &is_slab);
+	if (likely(is_slab)) {
+		/* Small allocation. */
+		extent_t *slab = iealloc(tsdn, ptr);
+		arena_t *arena = extent_arena_get(slab);
+		szind_t binind = extent_szind_get(slab);
+		bin_t *bin = &arena->bins[binind];
+		malloc_mutex_lock(tsdn, &bin->lock);
+		/* don't bother moving allocations from the slab currently used for new allocations */
+		if (slab != bin->slabcur) {
+			int free_in_slab = extent_nfree_get(slab);
+			if (free_in_slab) {
+				const bin_info_t *bin_info = &bin_infos[binind];
+				unsigned long curslabs = bin->stats.curslabs;
+				size_t curregs = bin->stats.curregs;
+				if (bin->slabcur) {
+					/* remove slabcur from the overall utilization */
+					curregs -= bin_info->nregs - extent_nfree_get(bin->slabcur);
+					curslabs -= 1;
+				}
+				/* Compare the utilization ratio of the slab in question to the total average,
+				 * to avoid precision lost and division, we do that by extrapolating the usage
+				 * of the slab as if all slabs have the same usage. If this slab is less used 
+				 * than the average, we'll prefer to evict the data to hopefully more used ones */
+				defrag = (bin_info->nregs - free_in_slab) * curslabs <= curregs;
+			}
+		}
+		malloc_mutex_unlock(tsdn, &bin->lock);
+	}
+	return defrag;
+}
+
+#endif /* JEMALLOC_INTERNAL_INLINES_C_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
new file mode 100644
index 00000000..ed75d376
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
@@ -0,0 +1,43 @@
+#ifndef JEMALLOC_INTERNAL_MACROS_H
+#define JEMALLOC_INTERNAL_MACROS_H
+
+#ifdef JEMALLOC_DEBUG
+#  define JEMALLOC_ALWAYS_INLINE static inline
+#else
+#  define JEMALLOC_ALWAYS_INLINE JEMALLOC_ATTR(always_inline) static inline
+#endif
+#ifdef _MSC_VER
+#  define inline _inline
+#endif
+
+#define UNUSED JEMALLOC_ATTR(unused)
+
+#define ZU(z)	((size_t)z)
+#define ZD(z)	((ssize_t)z)
+#define QU(q)	((uint64_t)q)
+#define QD(q)	((int64_t)q)
+
+#define KZU(z)	ZU(z##ULL)
+#define KZD(z)	ZD(z##LL)
+#define KQU(q)	QU(q##ULL)
+#define KQD(q)	QI(q##LL)
+
+#ifndef __DECONST
+#  define	__DECONST(type, var)	((type)(uintptr_t)(const void *)(var))
+#endif
+
+#if !defined(JEMALLOC_HAS_RESTRICT) || defined(__cplusplus)
+#  define restrict
+#endif
+
+/* Various function pointers are statick and immutable except during testing. */
+#ifdef JEMALLOC_JET
+#  define JET_MUTABLE
+#else
+#  define JET_MUTABLE const
+#endif
+
+#define JEMALLOC_VA_ARGS_HEAD(head, ...) head
+#define JEMALLOC_VA_ARGS_TAIL(head, ...) __VA_ARGS__
+
+#endif /* JEMALLOC_INTERNAL_MACROS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
new file mode 100644
index 00000000..1b750b12
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
@@ -0,0 +1,185 @@
+#ifndef JEMALLOC_INTERNAL_TYPES_H
+#define JEMALLOC_INTERNAL_TYPES_H
+
+/* Page size index type. */
+typedef unsigned pszind_t;
+
+/* Size class index type. */
+typedef unsigned szind_t;
+
+/* Processor / core id type. */
+typedef int malloc_cpuid_t;
+
+/*
+ * Flags bits:
+ *
+ * a: arena
+ * t: tcache
+ * 0: unused
+ * z: zero
+ * n: alignment
+ *
+ * aaaaaaaa aaaatttt tttttttt 0znnnnnn
+ */
+#define MALLOCX_ARENA_BITS	12
+#define MALLOCX_TCACHE_BITS	12
+#define MALLOCX_LG_ALIGN_BITS	6
+#define MALLOCX_ARENA_SHIFT	20
+#define MALLOCX_TCACHE_SHIFT	8
+#define MALLOCX_ARENA_MASK \
+    (((1 << MALLOCX_ARENA_BITS) - 1) << MALLOCX_ARENA_SHIFT)
+/* NB: Arena index bias decreases the maximum number of arenas by 1. */
+#define MALLOCX_ARENA_LIMIT	((1 << MALLOCX_ARENA_BITS) - 1)
+#define MALLOCX_TCACHE_MASK \
+    (((1 << MALLOCX_TCACHE_BITS) - 1) << MALLOCX_TCACHE_SHIFT)
+#define MALLOCX_TCACHE_MAX	((1 << MALLOCX_TCACHE_BITS) - 3)
+#define MALLOCX_LG_ALIGN_MASK	((1 << MALLOCX_LG_ALIGN_BITS) - 1)
+/* Use MALLOCX_ALIGN_GET() if alignment may not be specified in flags. */
+#define MALLOCX_ALIGN_GET_SPECIFIED(flags)				\
+    (ZU(1) << (flags & MALLOCX_LG_ALIGN_MASK))
+#define MALLOCX_ALIGN_GET(flags)					\
+    (MALLOCX_ALIGN_GET_SPECIFIED(flags) & (SIZE_T_MAX-1))
+#define MALLOCX_ZERO_GET(flags)						\
+    ((bool)(flags & MALLOCX_ZERO))
+
+#define MALLOCX_TCACHE_GET(flags)					\
+    (((unsigned)((flags & MALLOCX_TCACHE_MASK) >> MALLOCX_TCACHE_SHIFT)) - 2)
+#define MALLOCX_ARENA_GET(flags)					\
+    (((unsigned)(((unsigned)flags) >> MALLOCX_ARENA_SHIFT)) - 1)
+
+/* Smallest size class to support. */
+#define TINY_MIN		(1U << LG_TINY_MIN)
+
+/*
+ * Minimum allocation alignment is 2^LG_QUANTUM bytes (ignoring tiny size
+ * classes).
+ */
+#ifndef LG_QUANTUM
+#  if (defined(__i386__) || defined(_M_IX86))
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __ia64__
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __alpha__
+#    define LG_QUANTUM		4
+#  endif
+#  if (defined(__sparc64__) || defined(__sparcv9) || defined(__sparc_v9__))
+#    define LG_QUANTUM		4
+#  endif
+#  if (defined(__amd64__) || defined(__x86_64__) || defined(_M_X64))
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __arm__
+#    define LG_QUANTUM		3
+#  endif
+#  ifdef __aarch64__
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __hppa__
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __m68k__
+#    define LG_QUANTUM		3
+#  endif
+#  ifdef __mips__
+#    define LG_QUANTUM		3
+#  endif
+#  ifdef __nios2__
+#    define LG_QUANTUM		3
+#  endif
+#  ifdef __or1k__
+#    define LG_QUANTUM		3
+#  endif
+#  ifdef __powerpc__
+#    define LG_QUANTUM		4
+#  endif
+#  if defined(__riscv) || defined(__riscv__)
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __s390__
+#    define LG_QUANTUM		4
+#  endif
+#  if (defined (__SH3E__) || defined(__SH4_SINGLE__) || defined(__SH4__) || \
+	defined(__SH4_SINGLE_ONLY__))
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __tile__
+#    define LG_QUANTUM		4
+#  endif
+#  ifdef __le32__
+#    define LG_QUANTUM		4
+#  endif
+#  ifndef LG_QUANTUM
+#    error "Unknown minimum alignment for architecture; specify via "
+	 "--with-lg-quantum"
+#  endif
+#endif
+
+#define QUANTUM			((size_t)(1U << LG_QUANTUM))
+#define QUANTUM_MASK		(QUANTUM - 1)
+
+/* Return the smallest quantum multiple that is >= a. */
+#define QUANTUM_CEILING(a)						\
+	(((a) + QUANTUM_MASK) & ~QUANTUM_MASK)
+
+#define LONG			((size_t)(1U << LG_SIZEOF_LONG))
+#define LONG_MASK		(LONG - 1)
+
+/* Return the smallest long multiple that is >= a. */
+#define LONG_CEILING(a)							\
+	(((a) + LONG_MASK) & ~LONG_MASK)
+
+#define SIZEOF_PTR		(1U << LG_SIZEOF_PTR)
+#define PTR_MASK		(SIZEOF_PTR - 1)
+
+/* Return the smallest (void *) multiple that is >= a. */
+#define PTR_CEILING(a)							\
+	(((a) + PTR_MASK) & ~PTR_MASK)
+
+/*
+ * Maximum size of L1 cache line.  This is used to avoid cache line aliasing.
+ * In addition, this controls the spacing of cacheline-spaced size classes.
+ *
+ * CACHELINE cannot be based on LG_CACHELINE because __declspec(align()) can
+ * only handle raw constants.
+ */
+#define LG_CACHELINE		6
+#define CACHELINE		64
+#define CACHELINE_MASK		(CACHELINE - 1)
+
+/* Return the smallest cacheline multiple that is >= s. */
+#define CACHELINE_CEILING(s)						\
+	(((s) + CACHELINE_MASK) & ~CACHELINE_MASK)
+
+/* Return the nearest aligned address at or below a. */
+#define ALIGNMENT_ADDR2BASE(a, alignment)				\
+	((void *)((uintptr_t)(a) & ((~(alignment)) + 1)))
+
+/* Return the offset between a and the nearest aligned address at or below a. */
+#define ALIGNMENT_ADDR2OFFSET(a, alignment)				\
+	((size_t)((uintptr_t)(a) & (alignment - 1)))
+
+/* Return the smallest alignment multiple that is >= s. */
+#define ALIGNMENT_CEILING(s, alignment)					\
+	(((s) + (alignment - 1)) & ((~(alignment)) + 1))
+
+/* Declare a variable-length array. */
+#if __STDC_VERSION__ < 199901L
+#  ifdef _MSC_VER
+#    include <malloc.h>
+#    define alloca _alloca
+#  else
+#    ifdef JEMALLOC_HAS_ALLOCA_H
+#      include <alloca.h>
+#    else
+#      include <stdlib.h>
+#    endif
+#  endif
+#  define VARIABLE_ARRAY(type, name, count) \
+	type *name = alloca(sizeof(type) * (count))
+#else
+#  define VARIABLE_ARRAY(type, name, count) type name[(count)]
+#endif
+
+#endif /* JEMALLOC_INTERNAL_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
new file mode 100644
index 00000000..e621fbc8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
@@ -0,0 +1,194 @@
+#ifndef JEMALLOC_PREAMBLE_H
+#define JEMALLOC_PREAMBLE_H
+
+#include "jemalloc_internal_defs.h"
+#include "jemalloc/internal/jemalloc_internal_decls.h"
+
+#ifdef JEMALLOC_UTRACE
+#include <sys/ktrace.h>
+#endif
+
+#define JEMALLOC_NO_DEMANGLE
+#ifdef JEMALLOC_JET
+#  undef JEMALLOC_IS_MALLOC
+#  define JEMALLOC_N(n) jet_##n
+#  include "jemalloc/internal/public_namespace.h"
+#  define JEMALLOC_NO_RENAME
+#  include "../jemalloc@install_suffix@.h"
+#  undef JEMALLOC_NO_RENAME
+#else
+#  define JEMALLOC_N(n) @private_namespace@##n
+#  include "../jemalloc@install_suffix@.h"
+#endif
+
+#if (defined(JEMALLOC_OSATOMIC) || defined(JEMALLOC_OSSPIN))
+#include <libkern/OSAtomic.h>
+#endif
+
+#ifdef JEMALLOC_ZONE
+#include <mach/mach_error.h>
+#include <mach/mach_init.h>
+#include <mach/vm_map.h>
+#endif
+
+#include "jemalloc/internal/jemalloc_internal_macros.h"
+
+/*
+ * Note that the ordering matters here; the hook itself is name-mangled.  We
+ * want the inclusion of hooks to happen early, so that we hook as much as
+ * possible.
+ */
+#ifndef JEMALLOC_NO_PRIVATE_NAMESPACE
+#  ifndef JEMALLOC_JET
+#    include "jemalloc/internal/private_namespace.h"
+#  else
+#    include "jemalloc/internal/private_namespace_jet.h"
+#  endif
+#endif
+#include "jemalloc/internal/hooks.h"
+
+#ifdef JEMALLOC_DEFINE_MADVISE_FREE
+#  define JEMALLOC_MADV_FREE 8
+#endif
+
+static const bool config_debug =
+#ifdef JEMALLOC_DEBUG
+    true
+#else
+    false
+#endif
+    ;
+static const bool have_dss =
+#ifdef JEMALLOC_DSS
+    true
+#else
+    false
+#endif
+    ;
+static const bool have_madvise_huge =
+#ifdef JEMALLOC_HAVE_MADVISE_HUGE
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_fill =
+#ifdef JEMALLOC_FILL
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_lazy_lock =
+#ifdef JEMALLOC_LAZY_LOCK
+    true
+#else
+    false
+#endif
+    ;
+static const char * const config_malloc_conf = JEMALLOC_CONFIG_MALLOC_CONF;
+static const bool config_prof =
+#ifdef JEMALLOC_PROF
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_prof_libgcc =
+#ifdef JEMALLOC_PROF_LIBGCC
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_prof_libunwind =
+#ifdef JEMALLOC_PROF_LIBUNWIND
+    true
+#else
+    false
+#endif
+    ;
+static const bool maps_coalesce =
+#ifdef JEMALLOC_MAPS_COALESCE
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_stats =
+#ifdef JEMALLOC_STATS
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_tls =
+#ifdef JEMALLOC_TLS
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_utrace =
+#ifdef JEMALLOC_UTRACE
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_xmalloc =
+#ifdef JEMALLOC_XMALLOC
+    true
+#else
+    false
+#endif
+    ;
+static const bool config_cache_oblivious =
+#ifdef JEMALLOC_CACHE_OBLIVIOUS
+    true
+#else
+    false
+#endif
+    ;
+/*
+ * Undocumented, for jemalloc development use only at the moment.  See the note
+ * in jemalloc/internal/log.h.
+ */
+static const bool config_log =
+#ifdef JEMALLOC_LOG
+    true
+#else
+    false
+#endif
+    ;
+#ifdef JEMALLOC_HAVE_SCHED_GETCPU
+/* Currently percpu_arena depends on sched_getcpu. */
+#define JEMALLOC_PERCPU_ARENA
+#endif
+static const bool have_percpu_arena =
+#ifdef JEMALLOC_PERCPU_ARENA
+    true
+#else
+    false
+#endif
+    ;
+/*
+ * Undocumented, and not recommended; the application should take full
+ * responsibility for tracking provenance.
+ */
+static const bool force_ivsalloc =
+#ifdef JEMALLOC_FORCE_IVSALLOC
+    true
+#else
+    false
+#endif
+    ;
+static const bool have_background_thread =
+#ifdef JEMALLOC_BACKGROUND_THREAD
+    true
+#else
+    false
+#endif
+    ;
+
+#endif /* JEMALLOC_PREAMBLE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
new file mode 100644
index 00000000..3f36282c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
@@ -0,0 +1,26 @@
+#ifndef JEMALLOC_INTERNAL_LARGE_EXTERNS_H
+#define JEMALLOC_INTERNAL_LARGE_EXTERNS_H
+
+void *large_malloc(tsdn_t *tsdn, arena_t *arena, size_t usize, bool zero);
+void *large_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
+    bool zero);
+bool large_ralloc_no_move(tsdn_t *tsdn, extent_t *extent, size_t usize_min,
+    size_t usize_max, bool zero);
+void *large_ralloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent, size_t usize,
+    size_t alignment, bool zero, tcache_t *tcache);
+
+typedef void (large_dalloc_junk_t)(void *, size_t);
+extern large_dalloc_junk_t *JET_MUTABLE large_dalloc_junk;
+
+typedef void (large_dalloc_maybe_junk_t)(void *, size_t);
+extern large_dalloc_maybe_junk_t *JET_MUTABLE large_dalloc_maybe_junk;
+
+void large_dalloc_prep_junked_locked(tsdn_t *tsdn, extent_t *extent);
+void large_dalloc_finish(tsdn_t *tsdn, extent_t *extent);
+void large_dalloc(tsdn_t *tsdn, extent_t *extent);
+size_t large_salloc(tsdn_t *tsdn, const extent_t *extent);
+prof_tctx_t *large_prof_tctx_get(tsdn_t *tsdn, const extent_t *extent);
+void large_prof_tctx_set(tsdn_t *tsdn, extent_t *extent, prof_tctx_t *tctx);
+void large_prof_tctx_reset(tsdn_t *tsdn, extent_t *extent);
+
+#endif /* JEMALLOC_INTERNAL_LARGE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
new file mode 100644
index 00000000..64208586
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
@@ -0,0 +1,115 @@
+#ifndef JEMALLOC_INTERNAL_LOG_H
+#define JEMALLOC_INTERNAL_LOG_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/mutex.h"
+
+#ifdef JEMALLOC_LOG
+#  define JEMALLOC_LOG_VAR_BUFSIZE 1000
+#else
+#  define JEMALLOC_LOG_VAR_BUFSIZE 1
+#endif
+
+#define JEMALLOC_LOG_BUFSIZE 4096
+
+/*
+ * The log malloc_conf option is a '|'-delimited list of log_var name segments
+ * which should be logged.  The names are themselves hierarchical, with '.' as
+ * the delimiter (a "segment" is just a prefix in the log namespace).  So, if
+ * you have:
+ *
+ * log("arena", "log msg for arena"); // 1
+ * log("arena.a", "log msg for arena.a"); // 2
+ * log("arena.b", "log msg for arena.b"); // 3
+ * log("arena.a.a", "log msg for arena.a.a"); // 4
+ * log("extent.a", "log msg for extent.a"); // 5
+ * log("extent.b", "log msg for extent.b"); // 6
+ *
+ * And your malloc_conf option is "log=arena.a|extent", then lines 2, 4, 5, and
+ * 6 will print at runtime.  You can enable logging from all log vars by
+ * writing "log=.".
+ *
+ * None of this should be regarded as a stable API for right now.  It's intended
+ * as a debugging interface, to let us keep around some of our printf-debugging
+ * statements.
+ */
+
+extern char log_var_names[JEMALLOC_LOG_VAR_BUFSIZE];
+extern atomic_b_t log_init_done;
+
+typedef struct log_var_s log_var_t;
+struct log_var_s {
+	/*
+	 * Lowest bit is "inited", second lowest is "enabled".  Putting them in
+	 * a single word lets us avoid any fences on weak architectures.
+	 */
+	atomic_u_t state;
+	const char *name;
+};
+
+#define LOG_NOT_INITIALIZED 0U
+#define LOG_INITIALIZED_NOT_ENABLED 1U
+#define LOG_ENABLED 2U
+
+#define LOG_VAR_INIT(name_str) {ATOMIC_INIT(LOG_NOT_INITIALIZED), name_str}
+
+/*
+ * Returns the value we should assume for state (which is not necessarily
+ * accurate; if logging is done before logging has finished initializing, then
+ * we default to doing the safe thing by logging everything).
+ */
+unsigned log_var_update_state(log_var_t *log_var);
+
+/* We factor out the metadata management to allow us to test more easily. */
+#define log_do_begin(log_var)						\
+if (config_log) {							\
+	unsigned log_state = atomic_load_u(&(log_var).state,		\
+	    ATOMIC_RELAXED);						\
+	if (unlikely(log_state == LOG_NOT_INITIALIZED)) {		\
+		log_state = log_var_update_state(&(log_var));		\
+		assert(log_state != LOG_NOT_INITIALIZED);		\
+	}								\
+	if (log_state == LOG_ENABLED) {					\
+		{
+			/* User code executes here. */
+#define log_do_end(log_var)						\
+		}							\
+	}								\
+}
+
+/*
+ * MSVC has some preprocessor bugs in its expansion of __VA_ARGS__ during
+ * preprocessing.  To work around this, we take all potential extra arguments in
+ * a var-args functions.  Since a varargs macro needs at least one argument in
+ * the "...", we accept the format string there, and require that the first
+ * argument in this "..." is a const char *.
+ */
+static inline void
+log_impl_varargs(const char *name, ...) {
+	char buf[JEMALLOC_LOG_BUFSIZE];
+	va_list ap;
+
+	va_start(ap, name);
+	const char *format = va_arg(ap, const char *);
+	size_t dst_offset = 0;
+	dst_offset += malloc_snprintf(buf, JEMALLOC_LOG_BUFSIZE, "%s: ", name);
+	dst_offset += malloc_vsnprintf(buf + dst_offset,
+	    JEMALLOC_LOG_BUFSIZE - dst_offset, format, ap);
+	dst_offset += malloc_snprintf(buf + dst_offset,
+	    JEMALLOC_LOG_BUFSIZE - dst_offset, "\n");
+	va_end(ap);
+
+	malloc_write(buf);
+}
+
+/* Call as log("log.var.str", "format_string %d", arg_for_format_string); */
+#define LOG(log_var_str, ...)						\
+do {									\
+	static log_var_t log_var = LOG_VAR_INIT(log_var_str);		\
+	log_do_begin(log_var)						\
+		log_impl_varargs((log_var).name, __VA_ARGS__);		\
+	log_do_end(log_var)						\
+} while (0)
+
+#endif /* JEMALLOC_INTERNAL_LOG_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
new file mode 100644
index 00000000..bfe556b5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
@@ -0,0 +1,102 @@
+#ifndef JEMALLOC_INTERNAL_MALLOC_IO_H
+#define JEMALLOC_INTERNAL_MALLOC_IO_H
+
+#ifdef _WIN32
+#  ifdef _WIN64
+#    define FMT64_PREFIX "ll"
+#    define FMTPTR_PREFIX "ll"
+#  else
+#    define FMT64_PREFIX "ll"
+#    define FMTPTR_PREFIX ""
+#  endif
+#  define FMTd32 "d"
+#  define FMTu32 "u"
+#  define FMTx32 "x"
+#  define FMTd64 FMT64_PREFIX "d"
+#  define FMTu64 FMT64_PREFIX "u"
+#  define FMTx64 FMT64_PREFIX "x"
+#  define FMTdPTR FMTPTR_PREFIX "d"
+#  define FMTuPTR FMTPTR_PREFIX "u"
+#  define FMTxPTR FMTPTR_PREFIX "x"
+#else
+#  include <inttypes.h>
+#  define FMTd32 PRId32
+#  define FMTu32 PRIu32
+#  define FMTx32 PRIx32
+#  define FMTd64 PRId64
+#  define FMTu64 PRIu64
+#  define FMTx64 PRIx64
+#  define FMTdPTR PRIdPTR
+#  define FMTuPTR PRIuPTR
+#  define FMTxPTR PRIxPTR
+#endif
+
+/* Size of stack-allocated buffer passed to buferror(). */
+#define BUFERROR_BUF		64
+
+/*
+ * Size of stack-allocated buffer used by malloc_{,v,vc}printf().  This must be
+ * large enough for all possible uses within jemalloc.
+ */
+#define MALLOC_PRINTF_BUFSIZE	4096
+
+int buferror(int err, char *buf, size_t buflen);
+uintmax_t malloc_strtoumax(const char *restrict nptr, char **restrict endptr,
+    int base);
+void malloc_write(const char *s);
+
+/*
+ * malloc_vsnprintf() supports a subset of snprintf(3) that avoids floating
+ * point math.
+ */
+size_t malloc_vsnprintf(char *str, size_t size, const char *format,
+    va_list ap);
+size_t malloc_snprintf(char *str, size_t size, const char *format, ...)
+    JEMALLOC_FORMAT_PRINTF(3, 4);
+/*
+ * The caller can set write_cb and cbopaque to null to choose to print with the
+ * je_malloc_message hook.
+ */
+void malloc_vcprintf(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *format, va_list ap);
+void malloc_cprintf(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *format, ...) JEMALLOC_FORMAT_PRINTF(3, 4);
+void malloc_printf(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
+
+static inline ssize_t
+malloc_write_fd(int fd, const void *buf, size_t count) {
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_write)
+	/*
+	 * Use syscall(2) rather than write(2) when possible in order to avoid
+	 * the possibility of memory allocation within libc.  This is necessary
+	 * on FreeBSD; most operating systems do not have this problem though.
+	 *
+	 * syscall() returns long or int, depending on platform, so capture the
+	 * result in the widest plausible type to avoid compiler warnings.
+	 */
+	long result = syscall(SYS_write, fd, buf, count);
+#else
+	ssize_t result = (ssize_t)write(fd, buf,
+#ifdef _WIN32
+	    (unsigned int)
+#endif
+	    count);
+#endif
+	return (ssize_t)result;
+}
+
+static inline ssize_t
+malloc_read_fd(int fd, void *buf, size_t count) {
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_read)
+	long result = syscall(SYS_read, fd, buf, count);
+#else
+	ssize_t result = read(fd, buf,
+#ifdef _WIN32
+	    (unsigned int)
+#endif
+	    count);
+#endif
+	return (ssize_t)result;
+}
+
+#endif /* JEMALLOC_INTERNAL_MALLOC_IO_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
new file mode 100644
index 00000000..6520c251
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
@@ -0,0 +1,248 @@
+#ifndef JEMALLOC_INTERNAL_MUTEX_H
+#define JEMALLOC_INTERNAL_MUTEX_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/mutex_prof.h"
+#include "jemalloc/internal/tsd.h"
+#include "jemalloc/internal/witness.h"
+
+typedef enum {
+	/* Can only acquire one mutex of a given witness rank at a time. */
+	malloc_mutex_rank_exclusive,
+	/*
+	 * Can acquire multiple mutexes of the same witness rank, but in
+	 * address-ascending order only.
+	 */
+	malloc_mutex_address_ordered
+} malloc_mutex_lock_order_t;
+
+typedef struct malloc_mutex_s malloc_mutex_t;
+struct malloc_mutex_s {
+	union {
+		struct {
+			/*
+			 * prof_data is defined first to reduce cacheline
+			 * bouncing: the data is not touched by the mutex holder
+			 * during unlocking, while might be modified by
+			 * contenders.  Having it before the mutex itself could
+			 * avoid prefetching a modified cacheline (for the
+			 * unlocking thread).
+			 */
+			mutex_prof_data_t	prof_data;
+#ifdef _WIN32
+#  if _WIN32_WINNT >= 0x0600
+			SRWLOCK         	lock;
+#  else
+			CRITICAL_SECTION	lock;
+#  endif
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+			os_unfair_lock		lock;
+#elif (defined(JEMALLOC_OSSPIN))
+			OSSpinLock		lock;
+#elif (defined(JEMALLOC_MUTEX_INIT_CB))
+			pthread_mutex_t		lock;
+			malloc_mutex_t		*postponed_next;
+#else
+			pthread_mutex_t		lock;
+#endif
+		};
+		/*
+		 * We only touch witness when configured w/ debug.  However we
+		 * keep the field in a union when !debug so that we don't have
+		 * to pollute the code base with #ifdefs, while avoid paying the
+		 * memory cost.
+		 */
+#if !defined(JEMALLOC_DEBUG)
+		witness_t			witness;
+		malloc_mutex_lock_order_t	lock_order;
+#endif
+	};
+
+#if defined(JEMALLOC_DEBUG)
+	witness_t			witness;
+	malloc_mutex_lock_order_t	lock_order;
+#endif
+};
+
+/*
+ * Based on benchmark results, a fixed spin with this amount of retries works
+ * well for our critical sections.
+ */
+#define MALLOC_MUTEX_MAX_SPIN 250
+
+#ifdef _WIN32
+#  if _WIN32_WINNT >= 0x0600
+#    define MALLOC_MUTEX_LOCK(m)    AcquireSRWLockExclusive(&(m)->lock)
+#    define MALLOC_MUTEX_UNLOCK(m)  ReleaseSRWLockExclusive(&(m)->lock)
+#    define MALLOC_MUTEX_TRYLOCK(m) (!TryAcquireSRWLockExclusive(&(m)->lock))
+#  else
+#    define MALLOC_MUTEX_LOCK(m)    EnterCriticalSection(&(m)->lock)
+#    define MALLOC_MUTEX_UNLOCK(m)  LeaveCriticalSection(&(m)->lock)
+#    define MALLOC_MUTEX_TRYLOCK(m) (!TryEnterCriticalSection(&(m)->lock))
+#  endif
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+#    define MALLOC_MUTEX_LOCK(m)    os_unfair_lock_lock(&(m)->lock)
+#    define MALLOC_MUTEX_UNLOCK(m)  os_unfair_lock_unlock(&(m)->lock)
+#    define MALLOC_MUTEX_TRYLOCK(m) (!os_unfair_lock_trylock(&(m)->lock))
+#elif (defined(JEMALLOC_OSSPIN))
+#    define MALLOC_MUTEX_LOCK(m)    OSSpinLockLock(&(m)->lock)
+#    define MALLOC_MUTEX_UNLOCK(m)  OSSpinLockUnlock(&(m)->lock)
+#    define MALLOC_MUTEX_TRYLOCK(m) (!OSSpinLockTry(&(m)->lock))
+#else
+#    define MALLOC_MUTEX_LOCK(m)    pthread_mutex_lock(&(m)->lock)
+#    define MALLOC_MUTEX_UNLOCK(m)  pthread_mutex_unlock(&(m)->lock)
+#    define MALLOC_MUTEX_TRYLOCK(m) (pthread_mutex_trylock(&(m)->lock) != 0)
+#endif
+
+#define LOCK_PROF_DATA_INITIALIZER					\
+    {NSTIME_ZERO_INITIALIZER, NSTIME_ZERO_INITIALIZER, 0, 0, 0,		\
+	    ATOMIC_INIT(0), 0, NULL, 0}
+
+#ifdef _WIN32
+#  define MALLOC_MUTEX_INITIALIZER
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+#  define MALLOC_MUTEX_INITIALIZER					\
+     {{{LOCK_PROF_DATA_INITIALIZER, OS_UNFAIR_LOCK_INIT}},		\
+      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
+#elif (defined(JEMALLOC_OSSPIN))
+#  define MALLOC_MUTEX_INITIALIZER					\
+     {{{LOCK_PROF_DATA_INITIALIZER, 0}},				\
+      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
+#elif (defined(JEMALLOC_MUTEX_INIT_CB))
+#  define MALLOC_MUTEX_INITIALIZER					\
+     {{{LOCK_PROF_DATA_INITIALIZER, PTHREAD_MUTEX_INITIALIZER, NULL}},	\
+      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
+#else
+#    define MALLOC_MUTEX_TYPE PTHREAD_MUTEX_DEFAULT
+#    define MALLOC_MUTEX_INITIALIZER					\
+       {{{LOCK_PROF_DATA_INITIALIZER, PTHREAD_MUTEX_INITIALIZER}},	\
+        WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
+#endif
+
+#ifdef JEMALLOC_LAZY_LOCK
+extern bool isthreaded;
+#else
+#  undef isthreaded /* Undo private_namespace.h definition. */
+#  define isthreaded true
+#endif
+
+bool malloc_mutex_init(malloc_mutex_t *mutex, const char *name,
+    witness_rank_t rank, malloc_mutex_lock_order_t lock_order);
+void malloc_mutex_prefork(tsdn_t *tsdn, malloc_mutex_t *mutex);
+void malloc_mutex_postfork_parent(tsdn_t *tsdn, malloc_mutex_t *mutex);
+void malloc_mutex_postfork_child(tsdn_t *tsdn, malloc_mutex_t *mutex);
+bool malloc_mutex_boot(void);
+void malloc_mutex_prof_data_reset(tsdn_t *tsdn, malloc_mutex_t *mutex);
+
+void malloc_mutex_lock_slow(malloc_mutex_t *mutex);
+
+static inline void
+malloc_mutex_lock_final(malloc_mutex_t *mutex) {
+	MALLOC_MUTEX_LOCK(mutex);
+}
+
+static inline bool
+malloc_mutex_trylock_final(malloc_mutex_t *mutex) {
+	return MALLOC_MUTEX_TRYLOCK(mutex);
+}
+
+static inline void
+mutex_owner_stats_update(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	if (config_stats) {
+		mutex_prof_data_t *data = &mutex->prof_data;
+		data->n_lock_ops++;
+		if (data->prev_owner != tsdn) {
+			data->prev_owner = tsdn;
+			data->n_owner_switches++;
+		}
+	}
+}
+
+/* Trylock: return false if the lock is successfully acquired. */
+static inline bool
+malloc_mutex_trylock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+	if (isthreaded) {
+		if (malloc_mutex_trylock_final(mutex)) {
+			return true;
+		}
+		mutex_owner_stats_update(tsdn, mutex);
+	}
+	witness_lock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+
+	return false;
+}
+
+/* Aggregate lock prof data. */
+static inline void
+malloc_mutex_prof_merge(mutex_prof_data_t *sum, mutex_prof_data_t *data) {
+	nstime_add(&sum->tot_wait_time, &data->tot_wait_time);
+	if (nstime_compare(&sum->max_wait_time, &data->max_wait_time) < 0) {
+		nstime_copy(&sum->max_wait_time, &data->max_wait_time);
+	}
+
+	sum->n_wait_times += data->n_wait_times;
+	sum->n_spin_acquired += data->n_spin_acquired;
+
+	if (sum->max_n_thds < data->max_n_thds) {
+		sum->max_n_thds = data->max_n_thds;
+	}
+	uint32_t cur_n_waiting_thds = atomic_load_u32(&sum->n_waiting_thds,
+	    ATOMIC_RELAXED);
+	uint32_t new_n_waiting_thds = cur_n_waiting_thds + atomic_load_u32(
+	    &data->n_waiting_thds, ATOMIC_RELAXED);
+	atomic_store_u32(&sum->n_waiting_thds, new_n_waiting_thds,
+	    ATOMIC_RELAXED);
+	sum->n_owner_switches += data->n_owner_switches;
+	sum->n_lock_ops += data->n_lock_ops;
+}
+
+static inline void
+malloc_mutex_lock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+	if (isthreaded) {
+		if (malloc_mutex_trylock_final(mutex)) {
+			malloc_mutex_lock_slow(mutex);
+		}
+		mutex_owner_stats_update(tsdn, mutex);
+	}
+	witness_lock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+}
+
+static inline void
+malloc_mutex_unlock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	witness_unlock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+	if (isthreaded) {
+		MALLOC_MUTEX_UNLOCK(mutex);
+	}
+}
+
+static inline void
+malloc_mutex_assert_owner(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	witness_assert_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+}
+
+static inline void
+malloc_mutex_assert_not_owner(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
+}
+
+/* Copy the prof data from mutex for processing. */
+static inline void
+malloc_mutex_prof_read(tsdn_t *tsdn, mutex_prof_data_t *data,
+    malloc_mutex_t *mutex) {
+	mutex_prof_data_t *source = &mutex->prof_data;
+	/* Can only read holding the mutex. */
+	malloc_mutex_assert_owner(tsdn, mutex);
+
+	/*
+	 * Not *really* allowed (we shouldn't be doing non-atomic loads of
+	 * atomic data), but the mutex protection makes this safe, and writing
+	 * a member-for-member copy is tedious for this situation.
+	 */
+	*data = *source;
+	/* n_wait_thds is not reported (modified w/o locking). */
+	atomic_store_u32(&data->n_waiting_thds, 0, ATOMIC_RELAXED);
+}
+
+#endif /* JEMALLOC_INTERNAL_MUTEX_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
new file mode 100644
index 00000000..726cece9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
@@ -0,0 +1,94 @@
+#ifndef JEMALLOC_INTERNAL_MUTEX_POOL_H
+#define JEMALLOC_INTERNAL_MUTEX_POOL_H
+
+#include "jemalloc/internal/hash.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/witness.h"
+
+/* We do mod reductions by this value, so it should be kept a power of 2. */
+#define MUTEX_POOL_SIZE 256
+
+typedef struct mutex_pool_s mutex_pool_t;
+struct mutex_pool_s {
+	malloc_mutex_t mutexes[MUTEX_POOL_SIZE];
+};
+
+bool mutex_pool_init(mutex_pool_t *pool, const char *name, witness_rank_t rank);
+
+/* Internal helper - not meant to be called outside this module. */
+static inline malloc_mutex_t *
+mutex_pool_mutex(mutex_pool_t *pool, uintptr_t key) {
+	size_t hash_result[2];
+	hash(&key, sizeof(key), 0xd50dcc1b, hash_result);
+	return &pool->mutexes[hash_result[0] % MUTEX_POOL_SIZE];
+}
+
+static inline void
+mutex_pool_assert_not_held(tsdn_t *tsdn, mutex_pool_t *pool) {
+	for (int i = 0; i < MUTEX_POOL_SIZE; i++) {
+		malloc_mutex_assert_not_owner(tsdn, &pool->mutexes[i]);
+	}
+}
+
+/*
+ * Note that a mutex pool doesn't work exactly the way an embdedded mutex would.
+ * You're not allowed to acquire mutexes in the pool one at a time.  You have to
+ * acquire all the mutexes you'll need in a single function call, and then
+ * release them all in a single function call.
+ */
+
+static inline void
+mutex_pool_lock(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
+	mutex_pool_assert_not_held(tsdn, pool);
+
+	malloc_mutex_t *mutex = mutex_pool_mutex(pool, key);
+	malloc_mutex_lock(tsdn, mutex);
+}
+
+static inline void
+mutex_pool_unlock(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
+	malloc_mutex_t *mutex = mutex_pool_mutex(pool, key);
+	malloc_mutex_unlock(tsdn, mutex);
+
+	mutex_pool_assert_not_held(tsdn, pool);
+}
+
+static inline void
+mutex_pool_lock2(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key1,
+    uintptr_t key2) {
+	mutex_pool_assert_not_held(tsdn, pool);
+
+	malloc_mutex_t *mutex1 = mutex_pool_mutex(pool, key1);
+	malloc_mutex_t *mutex2 = mutex_pool_mutex(pool, key2);
+	if ((uintptr_t)mutex1 < (uintptr_t)mutex2) {
+		malloc_mutex_lock(tsdn, mutex1);
+		malloc_mutex_lock(tsdn, mutex2);
+	} else if ((uintptr_t)mutex1 == (uintptr_t)mutex2) {
+		malloc_mutex_lock(tsdn, mutex1);
+	} else {
+		malloc_mutex_lock(tsdn, mutex2);
+		malloc_mutex_lock(tsdn, mutex1);
+	}
+}
+
+static inline void
+mutex_pool_unlock2(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key1,
+    uintptr_t key2) {
+	malloc_mutex_t *mutex1 = mutex_pool_mutex(pool, key1);
+	malloc_mutex_t *mutex2 = mutex_pool_mutex(pool, key2);
+	if (mutex1 == mutex2) {
+		malloc_mutex_unlock(tsdn, mutex1);
+	} else {
+		malloc_mutex_unlock(tsdn, mutex1);
+		malloc_mutex_unlock(tsdn, mutex2);
+	}
+
+	mutex_pool_assert_not_held(tsdn, pool);
+}
+
+static inline void
+mutex_pool_assert_owner(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
+	malloc_mutex_assert_owner(tsdn, mutex_pool_mutex(pool, key));
+}
+
+#endif /* JEMALLOC_INTERNAL_MUTEX_POOL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
new file mode 100644
index 00000000..ce183d33
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
@@ -0,0 +1,99 @@
+#ifndef JEMALLOC_INTERNAL_MUTEX_PROF_H
+#define JEMALLOC_INTERNAL_MUTEX_PROF_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/nstime.h"
+#include "jemalloc/internal/tsd_types.h"
+
+#define MUTEX_PROF_GLOBAL_MUTEXES					\
+    OP(background_thread)						\
+    OP(ctl)								\
+    OP(prof)
+
+typedef enum {
+#define OP(mtx) global_prof_mutex_##mtx,
+	MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+	mutex_prof_num_global_mutexes
+} mutex_prof_global_ind_t;
+
+#define MUTEX_PROF_ARENA_MUTEXES					\
+    OP(large)								\
+    OP(extent_avail)							\
+    OP(extents_dirty)							\
+    OP(extents_muzzy)							\
+    OP(extents_retained)						\
+    OP(decay_dirty)							\
+    OP(decay_muzzy)							\
+    OP(base)								\
+    OP(tcache_list)
+
+typedef enum {
+#define OP(mtx) arena_prof_mutex_##mtx,
+	MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+	mutex_prof_num_arena_mutexes
+} mutex_prof_arena_ind_t;
+
+#define MUTEX_PROF_UINT64_COUNTERS					\
+    OP(num_ops, uint64_t, "n_lock_ops")					\
+    OP(num_wait, uint64_t, "n_waiting")					\
+    OP(num_spin_acq, uint64_t, "n_spin_acq")				\
+    OP(num_owner_switch, uint64_t, "n_owner_switch")			\
+    OP(total_wait_time, uint64_t, "total_wait_ns")			\
+    OP(max_wait_time, uint64_t, "max_wait_ns")
+
+#define MUTEX_PROF_UINT32_COUNTERS					\
+    OP(max_num_thds, uint32_t, "max_n_thds")
+
+#define MUTEX_PROF_COUNTERS						\
+		MUTEX_PROF_UINT64_COUNTERS				\
+		MUTEX_PROF_UINT32_COUNTERS
+
+#define OP(counter, type, human) mutex_counter_##counter,
+
+#define COUNTER_ENUM(counter_list, t)					\
+		typedef enum {						\
+			counter_list					\
+			mutex_prof_num_##t##_counters			\
+		} mutex_prof_##t##_counter_ind_t;
+
+COUNTER_ENUM(MUTEX_PROF_UINT64_COUNTERS, uint64_t)
+COUNTER_ENUM(MUTEX_PROF_UINT32_COUNTERS, uint32_t)
+
+#undef COUNTER_ENUM
+#undef OP
+
+typedef struct {
+	/*
+	 * Counters touched on the slow path, i.e. when there is lock
+	 * contention.  We update them once we have the lock.
+	 */
+	/* Total time (in nano seconds) spent waiting on this mutex. */
+	nstime_t		tot_wait_time;
+	/* Max time (in nano seconds) spent on a single lock operation. */
+	nstime_t		max_wait_time;
+	/* # of times have to wait for this mutex (after spinning). */
+	uint64_t		n_wait_times;
+	/* # of times acquired the mutex through local spinning. */
+	uint64_t		n_spin_acquired;
+	/* Max # of threads waiting for the mutex at the same time. */
+	uint32_t		max_n_thds;
+	/* Current # of threads waiting on the lock.  Atomic synced. */
+	atomic_u32_t		n_waiting_thds;
+
+	/*
+	 * Data touched on the fast path.  These are modified right after we
+	 * grab the lock, so it's placed closest to the end (i.e. right before
+	 * the lock) so that we have a higher chance of them being on the same
+	 * cacheline.
+	 */
+	/* # of times the mutex holder is different than the previous one. */
+	uint64_t		n_owner_switches;
+	/* Previous mutex holder, to facilitate n_owner_switches. */
+	tsdn_t			*prev_owner;
+	/* # of lock() operations in total. */
+	uint64_t		n_lock_ops;
+} mutex_prof_data_t;
+
+#endif /* JEMALLOC_INTERNAL_MUTEX_PROF_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
new file mode 100644
index 00000000..17c177c7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
@@ -0,0 +1,34 @@
+#ifndef JEMALLOC_INTERNAL_NSTIME_H
+#define JEMALLOC_INTERNAL_NSTIME_H
+
+/* Maximum supported number of seconds (~584 years). */
+#define NSTIME_SEC_MAX KQU(18446744072)
+#define NSTIME_ZERO_INITIALIZER {0}
+
+typedef struct {
+	uint64_t ns;
+} nstime_t;
+
+void nstime_init(nstime_t *time, uint64_t ns);
+void nstime_init2(nstime_t *time, uint64_t sec, uint64_t nsec);
+uint64_t nstime_ns(const nstime_t *time);
+uint64_t nstime_sec(const nstime_t *time);
+uint64_t nstime_msec(const nstime_t *time);
+uint64_t nstime_nsec(const nstime_t *time);
+void nstime_copy(nstime_t *time, const nstime_t *source);
+int nstime_compare(const nstime_t *a, const nstime_t *b);
+void nstime_add(nstime_t *time, const nstime_t *addend);
+void nstime_iadd(nstime_t *time, uint64_t addend);
+void nstime_subtract(nstime_t *time, const nstime_t *subtrahend);
+void nstime_isubtract(nstime_t *time, uint64_t subtrahend);
+void nstime_imultiply(nstime_t *time, uint64_t multiplier);
+void nstime_idivide(nstime_t *time, uint64_t divisor);
+uint64_t nstime_divide(const nstime_t *time, const nstime_t *divisor);
+
+typedef bool (nstime_monotonic_t)(void);
+extern nstime_monotonic_t *JET_MUTABLE nstime_monotonic;
+
+typedef bool (nstime_update_t)(nstime_t *);
+extern nstime_update_t *JET_MUTABLE nstime_update;
+
+#endif /* JEMALLOC_INTERNAL_NSTIME_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
new file mode 100644
index 00000000..7dae633a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
@@ -0,0 +1,88 @@
+#ifndef JEMALLOC_INTERNAL_PAGES_EXTERNS_H
+#define JEMALLOC_INTERNAL_PAGES_EXTERNS_H
+
+/* Page size.  LG_PAGE is determined by the configure script. */
+#ifdef PAGE_MASK
+#  undef PAGE_MASK
+#endif
+#define PAGE		((size_t)(1U << LG_PAGE))
+#define PAGE_MASK	((size_t)(PAGE - 1))
+/* Return the page base address for the page containing address a. */
+#define PAGE_ADDR2BASE(a)						\
+	((void *)((uintptr_t)(a) & ~PAGE_MASK))
+/* Return the smallest pagesize multiple that is >= s. */
+#define PAGE_CEILING(s)							\
+	(((s) + PAGE_MASK) & ~PAGE_MASK)
+
+/* Huge page size.  LG_HUGEPAGE is determined by the configure script. */
+#define HUGEPAGE	((size_t)(1U << LG_HUGEPAGE))
+#define HUGEPAGE_MASK	((size_t)(HUGEPAGE - 1))
+/* Return the huge page base address for the huge page containing address a. */
+#define HUGEPAGE_ADDR2BASE(a)						\
+	((void *)((uintptr_t)(a) & ~HUGEPAGE_MASK))
+/* Return the smallest pagesize multiple that is >= s. */
+#define HUGEPAGE_CEILING(s)						\
+	(((s) + HUGEPAGE_MASK) & ~HUGEPAGE_MASK)
+
+/* PAGES_CAN_PURGE_LAZY is defined if lazy purging is supported. */
+#if defined(_WIN32) || defined(JEMALLOC_PURGE_MADVISE_FREE)
+#  define PAGES_CAN_PURGE_LAZY
+#endif
+/*
+ * PAGES_CAN_PURGE_FORCED is defined if forced purging is supported.
+ *
+ * The only supported way to hard-purge on Windows is to decommit and then
+ * re-commit, but doing so is racy, and if re-commit fails it's a pain to
+ * propagate the "poisoned" memory state.  Since we typically decommit as the
+ * next step after purging on Windows anyway, there's no point in adding such
+ * complexity.
+ */
+#if !defined(_WIN32) && ((defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
+    defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)) || \
+    defined(JEMALLOC_MAPS_COALESCE))
+#  define PAGES_CAN_PURGE_FORCED
+#endif
+
+static const bool pages_can_purge_lazy =
+#ifdef PAGES_CAN_PURGE_LAZY
+    true
+#else
+    false
+#endif
+    ;
+static const bool pages_can_purge_forced =
+#ifdef PAGES_CAN_PURGE_FORCED
+    true
+#else
+    false
+#endif
+    ;
+
+typedef enum {
+	thp_mode_default       = 0, /* Do not change hugepage settings. */
+	thp_mode_always        = 1, /* Always set MADV_HUGEPAGE. */
+	thp_mode_never         = 2, /* Always set MADV_NOHUGEPAGE. */
+
+	thp_mode_names_limit   = 3, /* Used for option processing. */
+	thp_mode_not_supported = 3  /* No THP support detected. */
+} thp_mode_t;
+
+#define THP_MODE_DEFAULT thp_mode_default
+extern thp_mode_t opt_thp;
+extern thp_mode_t init_system_thp_mode; /* Initial system wide state. */
+extern const char *thp_mode_names[];
+
+void *pages_map(void *addr, size_t size, size_t alignment, bool *commit);
+void pages_unmap(void *addr, size_t size);
+bool pages_commit(void *addr, size_t size);
+bool pages_decommit(void *addr, size_t size);
+bool pages_purge_lazy(void *addr, size_t size);
+bool pages_purge_forced(void *addr, size_t size);
+bool pages_huge(void *addr, size_t size);
+bool pages_nohuge(void *addr, size_t size);
+bool pages_dontdump(void *addr, size_t size);
+bool pages_dodump(void *addr, size_t size);
+bool pages_boot(void);
+void pages_set_thp_state (void *ptr, size_t size);
+
+#endif /* JEMALLOC_INTERNAL_PAGES_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
new file mode 100644
index 00000000..84d6778a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
@@ -0,0 +1,391 @@
+/*
+ * A Pairing Heap implementation.
+ *
+ * "The Pairing Heap: A New Form of Self-Adjusting Heap"
+ * https://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf
+ *
+ * With auxiliary twopass list, described in a follow on paper.
+ *
+ * "Pairing Heaps: Experiments and Analysis"
+ * http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.2988&rep=rep1&type=pdf
+ *
+ *******************************************************************************
+ */
+
+#ifndef PH_H_
+#define PH_H_
+
+/* Node structure. */
+#define phn(a_type)							\
+struct {								\
+	a_type	*phn_prev;						\
+	a_type	*phn_next;						\
+	a_type	*phn_lchild;						\
+}
+
+/* Root structure. */
+#define ph(a_type)							\
+struct {								\
+	a_type	*ph_root;						\
+}
+
+/* Internal utility macros. */
+#define phn_lchild_get(a_type, a_field, a_phn)				\
+	(a_phn->a_field.phn_lchild)
+#define phn_lchild_set(a_type, a_field, a_phn, a_lchild) do {		\
+	a_phn->a_field.phn_lchild = a_lchild;				\
+} while (0)
+
+#define phn_next_get(a_type, a_field, a_phn)				\
+	(a_phn->a_field.phn_next)
+#define phn_prev_set(a_type, a_field, a_phn, a_prev) do {		\
+	a_phn->a_field.phn_prev = a_prev;				\
+} while (0)
+
+#define phn_prev_get(a_type, a_field, a_phn)				\
+	(a_phn->a_field.phn_prev)
+#define phn_next_set(a_type, a_field, a_phn, a_next) do {		\
+	a_phn->a_field.phn_next = a_next;				\
+} while (0)
+
+#define phn_merge_ordered(a_type, a_field, a_phn0, a_phn1, a_cmp) do {	\
+	a_type *phn0child;						\
+									\
+	assert(a_phn0 != NULL);						\
+	assert(a_phn1 != NULL);						\
+	assert(a_cmp(a_phn0, a_phn1) <= 0);				\
+									\
+	phn_prev_set(a_type, a_field, a_phn1, a_phn0);			\
+	phn0child = phn_lchild_get(a_type, a_field, a_phn0);		\
+	phn_next_set(a_type, a_field, a_phn1, phn0child);		\
+	if (phn0child != NULL) {					\
+		phn_prev_set(a_type, a_field, phn0child, a_phn1);	\
+	}								\
+	phn_lchild_set(a_type, a_field, a_phn0, a_phn1);		\
+} while (0)
+
+#define phn_merge(a_type, a_field, a_phn0, a_phn1, a_cmp, r_phn) do {	\
+	if (a_phn0 == NULL) {						\
+		r_phn = a_phn1;						\
+	} else if (a_phn1 == NULL) {					\
+		r_phn = a_phn0;						\
+	} else if (a_cmp(a_phn0, a_phn1) < 0) {				\
+		phn_merge_ordered(a_type, a_field, a_phn0, a_phn1,	\
+		    a_cmp);						\
+		r_phn = a_phn0;						\
+	} else {							\
+		phn_merge_ordered(a_type, a_field, a_phn1, a_phn0,	\
+		    a_cmp);						\
+		r_phn = a_phn1;						\
+	}								\
+} while (0)
+
+#define ph_merge_siblings(a_type, a_field, a_phn, a_cmp, r_phn) do {	\
+	a_type *head = NULL;						\
+	a_type *tail = NULL;						\
+	a_type *phn0 = a_phn;						\
+	a_type *phn1 = phn_next_get(a_type, a_field, phn0);		\
+									\
+	/*								\
+	 * Multipass merge, wherein the first two elements of a FIFO	\
+	 * are repeatedly merged, and each result is appended to the	\
+	 * singly linked FIFO, until the FIFO contains only a single	\
+	 * element.  We start with a sibling list but no reference to	\
+	 * its tail, so we do a single pass over the sibling list to	\
+	 * populate the FIFO.						\
+	 */								\
+	if (phn1 != NULL) {						\
+		a_type *phnrest = phn_next_get(a_type, a_field, phn1);	\
+		if (phnrest != NULL) {					\
+			phn_prev_set(a_type, a_field, phnrest, NULL);	\
+		}							\
+		phn_prev_set(a_type, a_field, phn0, NULL);		\
+		phn_next_set(a_type, a_field, phn0, NULL);		\
+		phn_prev_set(a_type, a_field, phn1, NULL);		\
+		phn_next_set(a_type, a_field, phn1, NULL);		\
+		phn_merge(a_type, a_field, phn0, phn1, a_cmp, phn0);	\
+		head = tail = phn0;					\
+		phn0 = phnrest;						\
+		while (phn0 != NULL) {					\
+			phn1 = phn_next_get(a_type, a_field, phn0);	\
+			if (phn1 != NULL) {				\
+				phnrest = phn_next_get(a_type, a_field,	\
+				    phn1);				\
+				if (phnrest != NULL) {			\
+					phn_prev_set(a_type, a_field,	\
+					    phnrest, NULL);		\
+				}					\
+				phn_prev_set(a_type, a_field, phn0,	\
+				    NULL);				\
+				phn_next_set(a_type, a_field, phn0,	\
+				    NULL);				\
+				phn_prev_set(a_type, a_field, phn1,	\
+				    NULL);				\
+				phn_next_set(a_type, a_field, phn1,	\
+				    NULL);				\
+				phn_merge(a_type, a_field, phn0, phn1,	\
+				    a_cmp, phn0);			\
+				phn_next_set(a_type, a_field, tail,	\
+				    phn0);				\
+				tail = phn0;				\
+				phn0 = phnrest;				\
+			} else {					\
+				phn_next_set(a_type, a_field, tail,	\
+				    phn0);				\
+				tail = phn0;				\
+				phn0 = NULL;				\
+			}						\
+		}							\
+		phn0 = head;						\
+		phn1 = phn_next_get(a_type, a_field, phn0);		\
+		if (phn1 != NULL) {					\
+			while (true) {					\
+				head = phn_next_get(a_type, a_field,	\
+				    phn1);				\
+				assert(phn_prev_get(a_type, a_field,	\
+				    phn0) == NULL);			\
+				phn_next_set(a_type, a_field, phn0,	\
+				    NULL);				\
+				assert(phn_prev_get(a_type, a_field,	\
+				    phn1) == NULL);			\
+				phn_next_set(a_type, a_field, phn1,	\
+				    NULL);				\
+				phn_merge(a_type, a_field, phn0, phn1,	\
+				    a_cmp, phn0);			\
+				if (head == NULL) {			\
+					break;				\
+				}					\
+				phn_next_set(a_type, a_field, tail,	\
+				    phn0);				\
+				tail = phn0;				\
+				phn0 = head;				\
+				phn1 = phn_next_get(a_type, a_field,	\
+				    phn0);				\
+			}						\
+		}							\
+	}								\
+	r_phn = phn0;							\
+} while (0)
+
+#define ph_merge_aux(a_type, a_field, a_ph, a_cmp) do {			\
+	a_type *phn = phn_next_get(a_type, a_field, a_ph->ph_root);	\
+	if (phn != NULL) {						\
+		phn_prev_set(a_type, a_field, a_ph->ph_root, NULL);	\
+		phn_next_set(a_type, a_field, a_ph->ph_root, NULL);	\
+		phn_prev_set(a_type, a_field, phn, NULL);		\
+		ph_merge_siblings(a_type, a_field, phn, a_cmp, phn);	\
+		assert(phn_next_get(a_type, a_field, phn) == NULL);	\
+		phn_merge(a_type, a_field, a_ph->ph_root, phn, a_cmp,	\
+		    a_ph->ph_root);					\
+	}								\
+} while (0)
+
+#define ph_merge_children(a_type, a_field, a_phn, a_cmp, r_phn) do {	\
+	a_type *lchild = phn_lchild_get(a_type, a_field, a_phn);	\
+	if (lchild == NULL) {						\
+		r_phn = NULL;						\
+	} else {							\
+		ph_merge_siblings(a_type, a_field, lchild, a_cmp,	\
+		    r_phn);						\
+	}								\
+} while (0)
+
+/*
+ * The ph_proto() macro generates function prototypes that correspond to the
+ * functions generated by an equivalently parameterized call to ph_gen().
+ */
+#define ph_proto(a_attr, a_prefix, a_ph_type, a_type)			\
+a_attr void	a_prefix##new(a_ph_type *ph);				\
+a_attr bool	a_prefix##empty(a_ph_type *ph);				\
+a_attr a_type	*a_prefix##first(a_ph_type *ph);			\
+a_attr a_type	*a_prefix##any(a_ph_type *ph);				\
+a_attr void	a_prefix##insert(a_ph_type *ph, a_type *phn);		\
+a_attr a_type	*a_prefix##remove_first(a_ph_type *ph);			\
+a_attr a_type	*a_prefix##remove_any(a_ph_type *ph);			\
+a_attr void	a_prefix##remove(a_ph_type *ph, a_type *phn);
+
+/*
+ * The ph_gen() macro generates a type-specific pairing heap implementation,
+ * based on the above cpp macros.
+ */
+#define ph_gen(a_attr, a_prefix, a_ph_type, a_type, a_field, a_cmp)	\
+a_attr void								\
+a_prefix##new(a_ph_type *ph) {						\
+	memset(ph, 0, sizeof(ph(a_type)));				\
+}									\
+a_attr bool								\
+a_prefix##empty(a_ph_type *ph) {					\
+	return (ph->ph_root == NULL);					\
+}									\
+a_attr a_type *								\
+a_prefix##first(a_ph_type *ph) {					\
+	if (ph->ph_root == NULL) {					\
+		return NULL;						\
+	}								\
+	ph_merge_aux(a_type, a_field, ph, a_cmp);			\
+	return ph->ph_root;						\
+}									\
+a_attr a_type *								\
+a_prefix##any(a_ph_type *ph) {						\
+	if (ph->ph_root == NULL) {					\
+		return NULL;						\
+	}								\
+	a_type *aux = phn_next_get(a_type, a_field, ph->ph_root);	\
+	if (aux != NULL) {						\
+		return aux;						\
+	}								\
+	return ph->ph_root;						\
+}									\
+a_attr void								\
+a_prefix##insert(a_ph_type *ph, a_type *phn) {				\
+	memset(&phn->a_field, 0, sizeof(phn(a_type)));			\
+									\
+	/*								\
+	 * Treat the root as an aux list during insertion, and lazily	\
+	 * merge during a_prefix##remove_first().  For elements that	\
+	 * are inserted, then removed via a_prefix##remove() before the	\
+	 * aux list is ever processed, this makes insert/remove		\
+	 * constant-time, whereas eager merging would make insert	\
+	 * O(log n).							\
+	 */								\
+	if (ph->ph_root == NULL) {					\
+		ph->ph_root = phn;					\
+	} else {							\
+		phn_next_set(a_type, a_field, phn, phn_next_get(a_type,	\
+		    a_field, ph->ph_root));				\
+		if (phn_next_get(a_type, a_field, ph->ph_root) !=	\
+		    NULL) {						\
+			phn_prev_set(a_type, a_field,			\
+			    phn_next_get(a_type, a_field, ph->ph_root),	\
+			    phn);					\
+		}							\
+		phn_prev_set(a_type, a_field, phn, ph->ph_root);	\
+		phn_next_set(a_type, a_field, ph->ph_root, phn);	\
+	}								\
+}									\
+a_attr a_type *								\
+a_prefix##remove_first(a_ph_type *ph) {					\
+	a_type *ret;							\
+									\
+	if (ph->ph_root == NULL) {					\
+		return NULL;						\
+	}								\
+	ph_merge_aux(a_type, a_field, ph, a_cmp);			\
+									\
+	ret = ph->ph_root;						\
+									\
+	ph_merge_children(a_type, a_field, ph->ph_root, a_cmp,		\
+	    ph->ph_root);						\
+									\
+	return ret;							\
+}									\
+a_attr a_type *								\
+a_prefix##remove_any(a_ph_type *ph) {					\
+	/*								\
+	 * Remove the most recently inserted aux list element, or the	\
+	 * root if the aux list is empty.  This has the effect of	\
+	 * behaving as a LIFO (and insertion/removal is therefore	\
+	 * constant-time) if a_prefix##[remove_]first() are never	\
+	 * called.							\
+	 */								\
+	if (ph->ph_root == NULL) {					\
+		return NULL;						\
+	}								\
+	a_type *ret = phn_next_get(a_type, a_field, ph->ph_root);	\
+	if (ret != NULL) {						\
+		a_type *aux = phn_next_get(a_type, a_field, ret);	\
+		phn_next_set(a_type, a_field, ph->ph_root, aux);	\
+		if (aux != NULL) {					\
+			phn_prev_set(a_type, a_field, aux,		\
+			    ph->ph_root);				\
+		}							\
+		return ret;						\
+	}								\
+	ret = ph->ph_root;						\
+	ph_merge_children(a_type, a_field, ph->ph_root, a_cmp,		\
+	    ph->ph_root);						\
+	return ret;							\
+}									\
+a_attr void								\
+a_prefix##remove(a_ph_type *ph, a_type *phn) {				\
+	a_type *replace, *parent;					\
+									\
+	if (ph->ph_root == phn) {					\
+		/*							\
+		 * We can delete from aux list without merging it, but	\
+		 * we need to merge if we are dealing with the root	\
+		 * node and it has children.				\
+		 */							\
+		if (phn_lchild_get(a_type, a_field, phn) == NULL) {	\
+			ph->ph_root = phn_next_get(a_type, a_field,	\
+			    phn);					\
+			if (ph->ph_root != NULL) {			\
+				phn_prev_set(a_type, a_field,		\
+				    ph->ph_root, NULL);			\
+			}						\
+			return;						\
+		}							\
+		ph_merge_aux(a_type, a_field, ph, a_cmp);		\
+		if (ph->ph_root == phn) {				\
+			ph_merge_children(a_type, a_field, ph->ph_root,	\
+			    a_cmp, ph->ph_root);			\
+			return;						\
+		}							\
+	}								\
+									\
+	/* Get parent (if phn is leftmost child) before mutating. */	\
+	if ((parent = phn_prev_get(a_type, a_field, phn)) != NULL) {	\
+		if (phn_lchild_get(a_type, a_field, parent) != phn) {	\
+			parent = NULL;					\
+		}							\
+	}								\
+	/* Find a possible replacement node, and link to parent. */	\
+	ph_merge_children(a_type, a_field, phn, a_cmp, replace);	\
+	/* Set next/prev for sibling linked list. */			\
+	if (replace != NULL) {						\
+		if (parent != NULL) {					\
+			phn_prev_set(a_type, a_field, replace, parent);	\
+			phn_lchild_set(a_type, a_field, parent,		\
+			    replace);					\
+		} else {						\
+			phn_prev_set(a_type, a_field, replace,		\
+			    phn_prev_get(a_type, a_field, phn));	\
+			if (phn_prev_get(a_type, a_field, phn) !=	\
+			    NULL) {					\
+				phn_next_set(a_type, a_field,		\
+				    phn_prev_get(a_type, a_field, phn),	\
+				    replace);				\
+			}						\
+		}							\
+		phn_next_set(a_type, a_field, replace,			\
+		    phn_next_get(a_type, a_field, phn));		\
+		if (phn_next_get(a_type, a_field, phn) != NULL) {	\
+			phn_prev_set(a_type, a_field,			\
+			    phn_next_get(a_type, a_field, phn),		\
+			    replace);					\
+		}							\
+	} else {							\
+		if (parent != NULL) {					\
+			a_type *next = phn_next_get(a_type, a_field,	\
+			    phn);					\
+			phn_lchild_set(a_type, a_field, parent, next);	\
+			if (next != NULL) {				\
+				phn_prev_set(a_type, a_field, next,	\
+				    parent);				\
+			}						\
+		} else {						\
+			assert(phn_prev_get(a_type, a_field, phn) !=	\
+			    NULL);					\
+			phn_next_set(a_type, a_field,			\
+			    phn_prev_get(a_type, a_field, phn),		\
+			    phn_next_get(a_type, a_field, phn));	\
+		}							\
+		if (phn_next_get(a_type, a_field, phn) != NULL) {	\
+			phn_prev_set(a_type, a_field,			\
+			    phn_next_get(a_type, a_field, phn),		\
+			    phn_prev_get(a_type, a_field, phn));	\
+		}							\
+	}								\
+}
+
+#endif /* PH_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
new file mode 100755
index 00000000..6ef1346a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+for symbol in `cat "$@"` ; do
+  echo "#define ${symbol} JEMALLOC_N(${symbol})"
+done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
new file mode 100755
index 00000000..442a259f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
@@ -0,0 +1,51 @@
+#!/bin/sh
+#
+# Generate private_symbols[_jet].awk.
+#
+# Usage: private_symbols.sh <sym_prefix> <sym>*
+#
+# <sym_prefix> is typically "" or "_".
+
+sym_prefix=$1
+shift
+
+cat <<EOF
+#!/usr/bin/env awk -f
+
+BEGIN {
+  sym_prefix = "${sym_prefix}"
+  split("\\
+EOF
+
+for public_sym in "$@" ; do
+  cat <<EOF
+        ${sym_prefix}${public_sym} \\
+EOF
+done
+
+cat <<"EOF"
+        ", exported_symbol_names)
+  # Store exported symbol names as keys in exported_symbols.
+  for (i in exported_symbol_names) {
+    exported_symbols[exported_symbol_names[i]] = 1
+  }
+}
+
+# Process 'nm -a <c_source.o>' output.
+#
+# Handle lines like:
+#   0000000000000008 D opt_junk
+#   0000000000007574 T malloc_initialized
+(NF == 3 && $2 ~ /^[ABCDGRSTVW]$/ && !($3 in exported_symbols) && $3 ~ /^[A-Za-z0-9_]+$/) {
+  print substr($3, 1+length(sym_prefix), length($3)-length(sym_prefix))
+}
+
+# Process 'dumpbin /SYMBOLS <c_source.obj>' output.
+#
+# Handle lines like:
+#   353 00008098 SECT4  notype       External     | opt_junk
+#   3F1 00000000 SECT7  notype ()    External     | malloc_initialized
+($3 ~ /^SECT[0-9]+/ && $(NF-2) == "External" && !($NF in exported_symbols)) {
+  print $NF
+}
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
new file mode 100644
index 00000000..15cc2d18
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
@@ -0,0 +1,185 @@
+#ifndef JEMALLOC_INTERNAL_PRNG_H
+#define JEMALLOC_INTERNAL_PRNG_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/bit_util.h"
+
+/*
+ * Simple linear congruential pseudo-random number generator:
+ *
+ *   prng(y) = (a*x + c) % m
+ *
+ * where the following constants ensure maximal period:
+ *
+ *   a == Odd number (relatively prime to 2^n), and (a-1) is a multiple of 4.
+ *   c == Odd number (relatively prime to 2^n).
+ *   m == 2^32
+ *
+ * See Knuth's TAOCP 3rd Ed., Vol. 2, pg. 17 for details on these constraints.
+ *
+ * This choice of m has the disadvantage that the quality of the bits is
+ * proportional to bit position.  For example, the lowest bit has a cycle of 2,
+ * the next has a cycle of 4, etc.  For this reason, we prefer to use the upper
+ * bits.
+ */
+
+/******************************************************************************/
+/* INTERNAL DEFINITIONS -- IGNORE */
+/******************************************************************************/
+#define PRNG_A_32	UINT32_C(1103515241)
+#define PRNG_C_32	UINT32_C(12347)
+
+#define PRNG_A_64	UINT64_C(6364136223846793005)
+#define PRNG_C_64	UINT64_C(1442695040888963407)
+
+JEMALLOC_ALWAYS_INLINE uint32_t
+prng_state_next_u32(uint32_t state) {
+	return (state * PRNG_A_32) + PRNG_C_32;
+}
+
+JEMALLOC_ALWAYS_INLINE uint64_t
+prng_state_next_u64(uint64_t state) {
+	return (state * PRNG_A_64) + PRNG_C_64;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+prng_state_next_zu(size_t state) {
+#if LG_SIZEOF_PTR == 2
+	return (state * PRNG_A_32) + PRNG_C_32;
+#elif LG_SIZEOF_PTR == 3
+	return (state * PRNG_A_64) + PRNG_C_64;
+#else
+#error Unsupported pointer size
+#endif
+}
+
+/******************************************************************************/
+/* BEGIN PUBLIC API */
+/******************************************************************************/
+
+/*
+ * The prng_lg_range functions give a uniform int in the half-open range [0,
+ * 2**lg_range).  If atomic is true, they do so safely from multiple threads.
+ * Multithreaded 64-bit prngs aren't supported.
+ */
+
+JEMALLOC_ALWAYS_INLINE uint32_t
+prng_lg_range_u32(atomic_u32_t *state, unsigned lg_range, bool atomic) {
+	uint32_t ret, state0, state1;
+
+	assert(lg_range > 0);
+	assert(lg_range <= 32);
+
+	state0 = atomic_load_u32(state, ATOMIC_RELAXED);
+
+	if (atomic) {
+		do {
+			state1 = prng_state_next_u32(state0);
+		} while (!atomic_compare_exchange_weak_u32(state, &state0,
+		    state1, ATOMIC_RELAXED, ATOMIC_RELAXED));
+	} else {
+		state1 = prng_state_next_u32(state0);
+		atomic_store_u32(state, state1, ATOMIC_RELAXED);
+	}
+	ret = state1 >> (32 - lg_range);
+
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE uint64_t
+prng_lg_range_u64(uint64_t *state, unsigned lg_range) {
+	uint64_t ret, state1;
+
+	assert(lg_range > 0);
+	assert(lg_range <= 64);
+
+	state1 = prng_state_next_u64(*state);
+	*state = state1;
+	ret = state1 >> (64 - lg_range);
+
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+prng_lg_range_zu(atomic_zu_t *state, unsigned lg_range, bool atomic) {
+	size_t ret, state0, state1;
+
+	assert(lg_range > 0);
+	assert(lg_range <= ZU(1) << (3 + LG_SIZEOF_PTR));
+
+	state0 = atomic_load_zu(state, ATOMIC_RELAXED);
+
+	if (atomic) {
+		do {
+			state1 = prng_state_next_zu(state0);
+		} while (atomic_compare_exchange_weak_zu(state, &state0,
+		    state1, ATOMIC_RELAXED, ATOMIC_RELAXED));
+	} else {
+		state1 = prng_state_next_zu(state0);
+		atomic_store_zu(state, state1, ATOMIC_RELAXED);
+	}
+	ret = state1 >> ((ZU(1) << (3 + LG_SIZEOF_PTR)) - lg_range);
+
+	return ret;
+}
+
+/*
+ * The prng_range functions behave like the prng_lg_range, but return a result
+ * in [0, range) instead of [0, 2**lg_range).
+ */
+
+JEMALLOC_ALWAYS_INLINE uint32_t
+prng_range_u32(atomic_u32_t *state, uint32_t range, bool atomic) {
+	uint32_t ret;
+	unsigned lg_range;
+
+	assert(range > 1);
+
+	/* Compute the ceiling of lg(range). */
+	lg_range = ffs_u32(pow2_ceil_u32(range)) - 1;
+
+	/* Generate a result in [0..range) via repeated trial. */
+	do {
+		ret = prng_lg_range_u32(state, lg_range, atomic);
+	} while (ret >= range);
+
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE uint64_t
+prng_range_u64(uint64_t *state, uint64_t range) {
+	uint64_t ret;
+	unsigned lg_range;
+
+	assert(range > 1);
+
+	/* Compute the ceiling of lg(range). */
+	lg_range = ffs_u64(pow2_ceil_u64(range)) - 1;
+
+	/* Generate a result in [0..range) via repeated trial. */
+	do {
+		ret = prng_lg_range_u64(state, lg_range);
+	} while (ret >= range);
+
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+prng_range_zu(atomic_zu_t *state, size_t range, bool atomic) {
+	size_t ret;
+	unsigned lg_range;
+
+	assert(range > 1);
+
+	/* Compute the ceiling of lg(range). */
+	lg_range = ffs_u64(pow2_ceil_u64(range)) - 1;
+
+	/* Generate a result in [0..range) via repeated trial. */
+	do {
+		ret = prng_lg_range_zu(state, lg_range, atomic);
+	} while (ret >= range);
+
+	return ret;
+}
+
+#endif /* JEMALLOC_INTERNAL_PRNG_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
new file mode 100644
index 00000000..04348696
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
@@ -0,0 +1,92 @@
+#ifndef JEMALLOC_INTERNAL_PROF_EXTERNS_H
+#define JEMALLOC_INTERNAL_PROF_EXTERNS_H
+
+#include "jemalloc/internal/mutex.h"
+
+extern malloc_mutex_t	bt2gctx_mtx;
+
+extern bool	opt_prof;
+extern bool	opt_prof_active;
+extern bool	opt_prof_thread_active_init;
+extern size_t	opt_lg_prof_sample;   /* Mean bytes between samples. */
+extern ssize_t	opt_lg_prof_interval; /* lg(prof_interval). */
+extern bool	opt_prof_gdump;       /* High-water memory dumping. */
+extern bool	opt_prof_final;       /* Final profile dumping. */
+extern bool	opt_prof_leak;        /* Dump leak summary at exit. */
+extern bool	opt_prof_accum;       /* Report cumulative bytes. */
+extern char	opt_prof_prefix[
+    /* Minimize memory bloat for non-prof builds. */
+#ifdef JEMALLOC_PROF
+    PATH_MAX +
+#endif
+    1];
+
+/* Accessed via prof_active_[gs]et{_unlocked,}(). */
+extern bool	prof_active;
+
+/* Accessed via prof_gdump_[gs]et{_unlocked,}(). */
+extern bool	prof_gdump_val;
+
+/*
+ * Profile dump interval, measured in bytes allocated.  Each arena triggers a
+ * profile dump when it reaches this threshold.  The effect is that the
+ * interval between profile dumps averages prof_interval, though the actual
+ * interval between dumps will tend to be sporadic, and the interval will be a
+ * maximum of approximately (prof_interval * narenas).
+ */
+extern uint64_t	prof_interval;
+
+/*
+ * Initialized as opt_lg_prof_sample, and potentially modified during profiling
+ * resets.
+ */
+extern size_t	lg_prof_sample;
+
+void prof_alloc_rollback(tsd_t *tsd, prof_tctx_t *tctx, bool updated);
+void prof_malloc_sample_object(tsdn_t *tsdn, const void *ptr, size_t usize,
+    prof_tctx_t *tctx);
+void prof_free_sampled_object(tsd_t *tsd, size_t usize, prof_tctx_t *tctx);
+void bt_init(prof_bt_t *bt, void **vec);
+void prof_backtrace(prof_bt_t *bt);
+prof_tctx_t *prof_lookup(tsd_t *tsd, prof_bt_t *bt);
+#ifdef JEMALLOC_JET
+size_t prof_tdata_count(void);
+size_t prof_bt_count(void);
+#endif
+typedef int (prof_dump_open_t)(bool, const char *);
+extern prof_dump_open_t *JET_MUTABLE prof_dump_open;
+
+typedef bool (prof_dump_header_t)(tsdn_t *, bool, const prof_cnt_t *);
+extern prof_dump_header_t *JET_MUTABLE prof_dump_header;
+#ifdef JEMALLOC_JET
+void prof_cnt_all(uint64_t *curobjs, uint64_t *curbytes, uint64_t *accumobjs,
+    uint64_t *accumbytes);
+#endif
+bool prof_accum_init(tsdn_t *tsdn, prof_accum_t *prof_accum);
+void prof_idump(tsdn_t *tsdn);
+bool prof_mdump(tsd_t *tsd, const char *filename);
+void prof_gdump(tsdn_t *tsdn);
+prof_tdata_t *prof_tdata_init(tsd_t *tsd);
+prof_tdata_t *prof_tdata_reinit(tsd_t *tsd, prof_tdata_t *tdata);
+void prof_reset(tsd_t *tsd, size_t lg_sample);
+void prof_tdata_cleanup(tsd_t *tsd);
+bool prof_active_get(tsdn_t *tsdn);
+bool prof_active_set(tsdn_t *tsdn, bool active);
+const char *prof_thread_name_get(tsd_t *tsd);
+int prof_thread_name_set(tsd_t *tsd, const char *thread_name);
+bool prof_thread_active_get(tsd_t *tsd);
+bool prof_thread_active_set(tsd_t *tsd, bool active);
+bool prof_thread_active_init_get(tsdn_t *tsdn);
+bool prof_thread_active_init_set(tsdn_t *tsdn, bool active_init);
+bool prof_gdump_get(tsdn_t *tsdn);
+bool prof_gdump_set(tsdn_t *tsdn, bool active);
+void prof_boot0(void);
+void prof_boot1(void);
+bool prof_boot2(tsd_t *tsd);
+void prof_prefork0(tsdn_t *tsdn);
+void prof_prefork1(tsdn_t *tsdn);
+void prof_postfork_parent(tsdn_t *tsdn);
+void prof_postfork_child(tsdn_t *tsdn);
+void prof_sample_threshold_update(prof_tdata_t *tdata);
+
+#endif /* JEMALLOC_INTERNAL_PROF_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
new file mode 100644
index 00000000..a6efb485
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
@@ -0,0 +1,83 @@
+#ifndef JEMALLOC_INTERNAL_PROF_INLINES_A_H
+#define JEMALLOC_INTERNAL_PROF_INLINES_A_H
+
+#include "jemalloc/internal/mutex.h"
+
+static inline bool
+prof_accum_add(tsdn_t *tsdn, prof_accum_t *prof_accum, uint64_t accumbytes) {
+	cassert(config_prof);
+
+	bool overflow;
+	uint64_t a0, a1;
+
+	/*
+	 * If the application allocates fast enough (and/or if idump is slow
+	 * enough), extreme overflow here (a1 >= prof_interval * 2) can cause
+	 * idump trigger coalescing.  This is an intentional mechanism that
+	 * avoids rate-limiting allocation.
+	 */
+#ifdef JEMALLOC_ATOMIC_U64
+	a0 = atomic_load_u64(&prof_accum->accumbytes, ATOMIC_RELAXED);
+	do {
+		a1 = a0 + accumbytes;
+		assert(a1 >= a0);
+		overflow = (a1 >= prof_interval);
+		if (overflow) {
+			a1 %= prof_interval;
+		}
+	} while (!atomic_compare_exchange_weak_u64(&prof_accum->accumbytes, &a0,
+	    a1, ATOMIC_RELAXED, ATOMIC_RELAXED));
+#else
+	malloc_mutex_lock(tsdn, &prof_accum->mtx);
+	a0 = prof_accum->accumbytes;
+	a1 = a0 + accumbytes;
+	overflow = (a1 >= prof_interval);
+	if (overflow) {
+		a1 %= prof_interval;
+	}
+	prof_accum->accumbytes = a1;
+	malloc_mutex_unlock(tsdn, &prof_accum->mtx);
+#endif
+	return overflow;
+}
+
+static inline void
+prof_accum_cancel(tsdn_t *tsdn, prof_accum_t *prof_accum, size_t usize) {
+	cassert(config_prof);
+
+	/*
+	 * Cancel out as much of the excessive prof_accumbytes increase as
+	 * possible without underflowing.  Interval-triggered dumps occur
+	 * slightly more often than intended as a result of incomplete
+	 * canceling.
+	 */
+	uint64_t a0, a1;
+#ifdef JEMALLOC_ATOMIC_U64
+	a0 = atomic_load_u64(&prof_accum->accumbytes, ATOMIC_RELAXED);
+	do {
+		a1 = (a0 >= LARGE_MINCLASS - usize) ?  a0 - (LARGE_MINCLASS -
+		    usize) : 0;
+	} while (!atomic_compare_exchange_weak_u64(&prof_accum->accumbytes, &a0,
+	    a1, ATOMIC_RELAXED, ATOMIC_RELAXED));
+#else
+	malloc_mutex_lock(tsdn, &prof_accum->mtx);
+	a0 = prof_accum->accumbytes;
+	a1 = (a0 >= LARGE_MINCLASS - usize) ?  a0 - (LARGE_MINCLASS - usize) :
+	    0;
+	prof_accum->accumbytes = a1;
+	malloc_mutex_unlock(tsdn, &prof_accum->mtx);
+#endif
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+prof_active_get_unlocked(void) {
+	/*
+	 * Even if opt_prof is true, sampling can be temporarily disabled by
+	 * setting prof_active to false.  No locking is used when reading
+	 * prof_active in the fast path, so there are no guarantees regarding
+	 * how long it will take for all threads to notice state changes.
+	 */
+	return prof_active;
+}
+
+#endif /* JEMALLOC_INTERNAL_PROF_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
new file mode 100644
index 00000000..6ff465ad
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
@@ -0,0 +1,206 @@
+#ifndef JEMALLOC_INTERNAL_PROF_INLINES_B_H
+#define JEMALLOC_INTERNAL_PROF_INLINES_B_H
+
+#include "jemalloc/internal/sz.h"
+
+JEMALLOC_ALWAYS_INLINE bool
+prof_gdump_get_unlocked(void) {
+	/*
+	 * No locking is used when reading prof_gdump_val in the fast path, so
+	 * there are no guarantees regarding how long it will take for all
+	 * threads to notice state changes.
+	 */
+	return prof_gdump_val;
+}
+
+JEMALLOC_ALWAYS_INLINE prof_tdata_t *
+prof_tdata_get(tsd_t *tsd, bool create) {
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	tdata = tsd_prof_tdata_get(tsd);
+	if (create) {
+		if (unlikely(tdata == NULL)) {
+			if (tsd_nominal(tsd)) {
+				tdata = prof_tdata_init(tsd);
+				tsd_prof_tdata_set(tsd, tdata);
+			}
+		} else if (unlikely(tdata->expired)) {
+			tdata = prof_tdata_reinit(tsd, tdata);
+			tsd_prof_tdata_set(tsd, tdata);
+		}
+		assert(tdata == NULL || tdata->attached);
+	}
+
+	return tdata;
+}
+
+JEMALLOC_ALWAYS_INLINE prof_tctx_t *
+prof_tctx_get(tsdn_t *tsdn, const void *ptr, alloc_ctx_t *alloc_ctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	return arena_prof_tctx_get(tsdn, ptr, alloc_ctx);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+prof_tctx_set(tsdn_t *tsdn, const void *ptr, size_t usize,
+    alloc_ctx_t *alloc_ctx, prof_tctx_t *tctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	arena_prof_tctx_set(tsdn, ptr, usize, alloc_ctx, tctx);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+prof_tctx_reset(tsdn_t *tsdn, const void *ptr, prof_tctx_t *tctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	arena_prof_tctx_reset(tsdn, ptr, tctx);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+prof_sample_accum_update(tsd_t *tsd, size_t usize, bool update,
+    prof_tdata_t **tdata_out) {
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	tdata = prof_tdata_get(tsd, true);
+	if (unlikely((uintptr_t)tdata <= (uintptr_t)PROF_TDATA_STATE_MAX)) {
+		tdata = NULL;
+	}
+
+	if (tdata_out != NULL) {
+		*tdata_out = tdata;
+	}
+
+	if (unlikely(tdata == NULL)) {
+		return true;
+	}
+
+	if (likely(tdata->bytes_until_sample >= usize)) {
+		if (update) {
+			tdata->bytes_until_sample -= usize;
+		}
+		return true;
+	} else {
+		if (tsd_reentrancy_level_get(tsd) > 0) {
+			return true;
+		}
+		/* Compute new sample threshold. */
+		if (update) {
+			prof_sample_threshold_update(tdata);
+		}
+		return !tdata->active;
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE prof_tctx_t *
+prof_alloc_prep(tsd_t *tsd, size_t usize, bool prof_active, bool update) {
+	prof_tctx_t *ret;
+	prof_tdata_t *tdata;
+	prof_bt_t bt;
+
+	assert(usize == sz_s2u(usize));
+
+	if (!prof_active || likely(prof_sample_accum_update(tsd, usize, update,
+	    &tdata))) {
+		ret = (prof_tctx_t *)(uintptr_t)1U;
+	} else {
+		bt_init(&bt, tdata->vec);
+		prof_backtrace(&bt);
+		ret = prof_lookup(tsd, &bt);
+	}
+
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+prof_malloc(tsdn_t *tsdn, const void *ptr, size_t usize, alloc_ctx_t *alloc_ctx,
+    prof_tctx_t *tctx) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+	assert(usize == isalloc(tsdn, ptr));
+
+	if (unlikely((uintptr_t)tctx > (uintptr_t)1U)) {
+		prof_malloc_sample_object(tsdn, ptr, usize, tctx);
+	} else {
+		prof_tctx_set(tsdn, ptr, usize, alloc_ctx,
+		    (prof_tctx_t *)(uintptr_t)1U);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+prof_realloc(tsd_t *tsd, const void *ptr, size_t usize, prof_tctx_t *tctx,
+    bool prof_active, bool updated, const void *old_ptr, size_t old_usize,
+    prof_tctx_t *old_tctx) {
+	bool sampled, old_sampled, moved;
+
+	cassert(config_prof);
+	assert(ptr != NULL || (uintptr_t)tctx <= (uintptr_t)1U);
+
+	if (prof_active && !updated && ptr != NULL) {
+		assert(usize == isalloc(tsd_tsdn(tsd), ptr));
+		if (prof_sample_accum_update(tsd, usize, true, NULL)) {
+			/*
+			 * Don't sample.  The usize passed to prof_alloc_prep()
+			 * was larger than what actually got allocated, so a
+			 * backtrace was captured for this allocation, even
+			 * though its actual usize was insufficient to cross the
+			 * sample threshold.
+			 */
+			prof_alloc_rollback(tsd, tctx, true);
+			tctx = (prof_tctx_t *)(uintptr_t)1U;
+		}
+	}
+
+	sampled = ((uintptr_t)tctx > (uintptr_t)1U);
+	old_sampled = ((uintptr_t)old_tctx > (uintptr_t)1U);
+	moved = (ptr != old_ptr);
+
+	if (unlikely(sampled)) {
+		prof_malloc_sample_object(tsd_tsdn(tsd), ptr, usize, tctx);
+	} else if (moved) {
+		prof_tctx_set(tsd_tsdn(tsd), ptr, usize, NULL,
+		    (prof_tctx_t *)(uintptr_t)1U);
+	} else if (unlikely(old_sampled)) {
+		/*
+		 * prof_tctx_set() would work for the !moved case as well, but
+		 * prof_tctx_reset() is slightly cheaper, and the proper thing
+		 * to do here in the presence of explicit knowledge re: moved
+		 * state.
+		 */
+		prof_tctx_reset(tsd_tsdn(tsd), ptr, tctx);
+	} else {
+		assert((uintptr_t)prof_tctx_get(tsd_tsdn(tsd), ptr, NULL) ==
+		    (uintptr_t)1U);
+	}
+
+	/*
+	 * The prof_free_sampled_object() call must come after the
+	 * prof_malloc_sample_object() call, because tctx and old_tctx may be
+	 * the same, in which case reversing the call order could cause the tctx
+	 * to be prematurely destroyed as a side effect of momentarily zeroed
+	 * counters.
+	 */
+	if (unlikely(old_sampled)) {
+		prof_free_sampled_object(tsd, old_usize, old_tctx);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+prof_free(tsd_t *tsd, const void *ptr, size_t usize, alloc_ctx_t *alloc_ctx) {
+	prof_tctx_t *tctx = prof_tctx_get(tsd_tsdn(tsd), ptr, alloc_ctx);
+
+	cassert(config_prof);
+	assert(usize == isalloc(tsd_tsdn(tsd), ptr));
+
+	if (unlikely((uintptr_t)tctx > (uintptr_t)1U)) {
+		prof_free_sampled_object(tsd, usize, tctx);
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_PROF_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
new file mode 100644
index 00000000..0d58ae10
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
@@ -0,0 +1,201 @@
+#ifndef JEMALLOC_INTERNAL_PROF_STRUCTS_H
+#define JEMALLOC_INTERNAL_PROF_STRUCTS_H
+
+#include "jemalloc/internal/ckh.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/prng.h"
+#include "jemalloc/internal/rb.h"
+
+struct prof_bt_s {
+	/* Backtrace, stored as len program counters. */
+	void		**vec;
+	unsigned	len;
+};
+
+#ifdef JEMALLOC_PROF_LIBGCC
+/* Data structure passed to libgcc _Unwind_Backtrace() callback functions. */
+typedef struct {
+	prof_bt_t	*bt;
+	unsigned	max;
+} prof_unwind_data_t;
+#endif
+
+struct prof_accum_s {
+#ifndef JEMALLOC_ATOMIC_U64
+	malloc_mutex_t	mtx;
+	uint64_t	accumbytes;
+#else
+	atomic_u64_t	accumbytes;
+#endif
+};
+
+struct prof_cnt_s {
+	/* Profiling counters. */
+	uint64_t	curobjs;
+	uint64_t	curbytes;
+	uint64_t	accumobjs;
+	uint64_t	accumbytes;
+};
+
+typedef enum {
+	prof_tctx_state_initializing,
+	prof_tctx_state_nominal,
+	prof_tctx_state_dumping,
+	prof_tctx_state_purgatory /* Dumper must finish destroying. */
+} prof_tctx_state_t;
+
+struct prof_tctx_s {
+	/* Thread data for thread that performed the allocation. */
+	prof_tdata_t		*tdata;
+
+	/*
+	 * Copy of tdata->thr_{uid,discrim}, necessary because tdata may be
+	 * defunct during teardown.
+	 */
+	uint64_t		thr_uid;
+	uint64_t		thr_discrim;
+
+	/* Profiling counters, protected by tdata->lock. */
+	prof_cnt_t		cnts;
+
+	/* Associated global context. */
+	prof_gctx_t		*gctx;
+
+	/*
+	 * UID that distinguishes multiple tctx's created by the same thread,
+	 * but coexisting in gctx->tctxs.  There are two ways that such
+	 * coexistence can occur:
+	 * - A dumper thread can cause a tctx to be retained in the purgatory
+	 *   state.
+	 * - Although a single "producer" thread must create all tctx's which
+	 *   share the same thr_uid, multiple "consumers" can each concurrently
+	 *   execute portions of prof_tctx_destroy().  prof_tctx_destroy() only
+	 *   gets called once each time cnts.cur{objs,bytes} drop to 0, but this
+	 *   threshold can be hit again before the first consumer finishes
+	 *   executing prof_tctx_destroy().
+	 */
+	uint64_t		tctx_uid;
+
+	/* Linkage into gctx's tctxs. */
+	rb_node(prof_tctx_t)	tctx_link;
+
+	/*
+	 * True during prof_alloc_prep()..prof_malloc_sample_object(), prevents
+	 * sample vs destroy race.
+	 */
+	bool			prepared;
+
+	/* Current dump-related state, protected by gctx->lock. */
+	prof_tctx_state_t	state;
+
+	/*
+	 * Copy of cnts snapshotted during early dump phase, protected by
+	 * dump_mtx.
+	 */
+	prof_cnt_t		dump_cnts;
+};
+typedef rb_tree(prof_tctx_t) prof_tctx_tree_t;
+
+struct prof_gctx_s {
+	/* Protects nlimbo, cnt_summed, and tctxs. */
+	malloc_mutex_t		*lock;
+
+	/*
+	 * Number of threads that currently cause this gctx to be in a state of
+	 * limbo due to one of:
+	 *   - Initializing this gctx.
+	 *   - Initializing per thread counters associated with this gctx.
+	 *   - Preparing to destroy this gctx.
+	 *   - Dumping a heap profile that includes this gctx.
+	 * nlimbo must be 1 (single destroyer) in order to safely destroy the
+	 * gctx.
+	 */
+	unsigned		nlimbo;
+
+	/*
+	 * Tree of profile counters, one for each thread that has allocated in
+	 * this context.
+	 */
+	prof_tctx_tree_t	tctxs;
+
+	/* Linkage for tree of contexts to be dumped. */
+	rb_node(prof_gctx_t)	dump_link;
+
+	/* Temporary storage for summation during dump. */
+	prof_cnt_t		cnt_summed;
+
+	/* Associated backtrace. */
+	prof_bt_t		bt;
+
+	/* Backtrace vector, variable size, referred to by bt. */
+	void			*vec[1];
+};
+typedef rb_tree(prof_gctx_t) prof_gctx_tree_t;
+
+struct prof_tdata_s {
+	malloc_mutex_t		*lock;
+
+	/* Monotonically increasing unique thread identifier. */
+	uint64_t		thr_uid;
+
+	/*
+	 * Monotonically increasing discriminator among tdata structures
+	 * associated with the same thr_uid.
+	 */
+	uint64_t		thr_discrim;
+
+	/* Included in heap profile dumps if non-NULL. */
+	char			*thread_name;
+
+	bool			attached;
+	bool			expired;
+
+	rb_node(prof_tdata_t)	tdata_link;
+
+	/*
+	 * Counter used to initialize prof_tctx_t's tctx_uid.  No locking is
+	 * necessary when incrementing this field, because only one thread ever
+	 * does so.
+	 */
+	uint64_t		tctx_uid_next;
+
+	/*
+	 * Hash of (prof_bt_t *)-->(prof_tctx_t *).  Each thread tracks
+	 * backtraces for which it has non-zero allocation/deallocation counters
+	 * associated with thread-specific prof_tctx_t objects.  Other threads
+	 * may write to prof_tctx_t contents when freeing associated objects.
+	 */
+	ckh_t			bt2tctx;
+
+	/* Sampling state. */
+	uint64_t		prng_state;
+	uint64_t		bytes_until_sample;
+
+	/* State used to avoid dumping while operating on prof internals. */
+	bool			enq;
+	bool			enq_idump;
+	bool			enq_gdump;
+
+	/*
+	 * Set to true during an early dump phase for tdata's which are
+	 * currently being dumped.  New threads' tdata's have this initialized
+	 * to false so that they aren't accidentally included in later dump
+	 * phases.
+	 */
+	bool			dumping;
+
+	/*
+	 * True if profiling is active for this tdata's thread
+	 * (thread.prof.active mallctl).
+	 */
+	bool			active;
+
+	/* Temporary storage for summation during dump. */
+	prof_cnt_t		cnt_summed;
+
+	/* Backtrace vector, used for calls to prof_backtrace(). */
+	void			*vec[PROF_BT_MAX];
+};
+typedef rb_tree(prof_tdata_t) prof_tdata_tree_t;
+
+#endif /* JEMALLOC_INTERNAL_PROF_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
new file mode 100644
index 00000000..1eff995e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
@@ -0,0 +1,56 @@
+#ifndef JEMALLOC_INTERNAL_PROF_TYPES_H
+#define JEMALLOC_INTERNAL_PROF_TYPES_H
+
+typedef struct prof_bt_s prof_bt_t;
+typedef struct prof_accum_s prof_accum_t;
+typedef struct prof_cnt_s prof_cnt_t;
+typedef struct prof_tctx_s prof_tctx_t;
+typedef struct prof_gctx_s prof_gctx_t;
+typedef struct prof_tdata_s prof_tdata_t;
+
+/* Option defaults. */
+#ifdef JEMALLOC_PROF
+#  define PROF_PREFIX_DEFAULT		"jeprof"
+#else
+#  define PROF_PREFIX_DEFAULT		""
+#endif
+#define LG_PROF_SAMPLE_DEFAULT		19
+#define LG_PROF_INTERVAL_DEFAULT	-1
+
+/*
+ * Hard limit on stack backtrace depth.  The version of prof_backtrace() that
+ * is based on __builtin_return_address() necessarily has a hard-coded number
+ * of backtrace frame handlers, and should be kept in sync with this setting.
+ */
+#define PROF_BT_MAX			128
+
+/* Initial hash table size. */
+#define PROF_CKH_MINITEMS		64
+
+/* Size of memory buffer to use when writing dump files. */
+#define PROF_DUMP_BUFSIZE		65536
+
+/* Size of stack-allocated buffer used by prof_printf(). */
+#define PROF_PRINTF_BUFSIZE		128
+
+/*
+ * Number of mutexes shared among all gctx's.  No space is allocated for these
+ * unless profiling is enabled, so it's okay to over-provision.
+ */
+#define PROF_NCTX_LOCKS			1024
+
+/*
+ * Number of mutexes shared among all tdata's.  No space is allocated for these
+ * unless profiling is enabled, so it's okay to over-provision.
+ */
+#define PROF_NTDATA_LOCKS		256
+
+/*
+ * prof_tdata pointers close to NULL are used to encode state information that
+ * is used for cleaning up during thread shutdown.
+ */
+#define PROF_TDATA_STATE_REINCARNATED	((prof_tdata_t *)(uintptr_t)1)
+#define PROF_TDATA_STATE_PURGATORY	((prof_tdata_t *)(uintptr_t)2)
+#define PROF_TDATA_STATE_MAX		PROF_TDATA_STATE_PURGATORY
+
+#endif /* JEMALLOC_INTERNAL_PROF_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
new file mode 100755
index 00000000..4d415ba0
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
@@ -0,0 +1,6 @@
+#!/bin/sh
+
+for nm in `cat $1` ; do
+  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
+  echo "#define je_${n} JEMALLOC_N(${n})"
+done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
new file mode 100755
index 00000000..4239d177
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
@@ -0,0 +1,6 @@
+#!/bin/sh
+
+for nm in `cat $1` ; do
+  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
+  echo "#undef je_${n}"
+done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
new file mode 100644
index 00000000..80290407
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
@@ -0,0 +1,88 @@
+#ifndef JEMALLOC_INTERNAL_QL_H
+#define JEMALLOC_INTERNAL_QL_H
+
+#include "jemalloc/internal/qr.h"
+
+/* List definitions. */
+#define ql_head(a_type)							\
+struct {								\
+	a_type *qlh_first;						\
+}
+
+#define ql_head_initializer(a_head) {NULL}
+
+#define ql_elm(a_type)	qr(a_type)
+
+/* List functions. */
+#define ql_new(a_head) do {						\
+	(a_head)->qlh_first = NULL;					\
+} while (0)
+
+#define ql_elm_new(a_elm, a_field) qr_new((a_elm), a_field)
+
+#define ql_first(a_head) ((a_head)->qlh_first)
+
+#define ql_last(a_head, a_field)					\
+	((ql_first(a_head) != NULL)					\
+	    ? qr_prev(ql_first(a_head), a_field) : NULL)
+
+#define ql_next(a_head, a_elm, a_field)					\
+	((ql_last(a_head, a_field) != (a_elm))				\
+	    ? qr_next((a_elm), a_field)	: NULL)
+
+#define ql_prev(a_head, a_elm, a_field)					\
+	((ql_first(a_head) != (a_elm)) ? qr_prev((a_elm), a_field)	\
+				       : NULL)
+
+#define ql_before_insert(a_head, a_qlelm, a_elm, a_field) do {		\
+	qr_before_insert((a_qlelm), (a_elm), a_field);			\
+	if (ql_first(a_head) == (a_qlelm)) {				\
+		ql_first(a_head) = (a_elm);				\
+	}								\
+} while (0)
+
+#define ql_after_insert(a_qlelm, a_elm, a_field)			\
+	qr_after_insert((a_qlelm), (a_elm), a_field)
+
+#define ql_head_insert(a_head, a_elm, a_field) do {			\
+	if (ql_first(a_head) != NULL) {					\
+		qr_before_insert(ql_first(a_head), (a_elm), a_field);	\
+	}								\
+	ql_first(a_head) = (a_elm);					\
+} while (0)
+
+#define ql_tail_insert(a_head, a_elm, a_field) do {			\
+	if (ql_first(a_head) != NULL) {					\
+		qr_before_insert(ql_first(a_head), (a_elm), a_field);	\
+	}								\
+	ql_first(a_head) = qr_next((a_elm), a_field);			\
+} while (0)
+
+#define ql_remove(a_head, a_elm, a_field) do {				\
+	if (ql_first(a_head) == (a_elm)) {				\
+		ql_first(a_head) = qr_next(ql_first(a_head), a_field);	\
+	}								\
+	if (ql_first(a_head) != (a_elm)) {				\
+		qr_remove((a_elm), a_field);				\
+	} else {							\
+		ql_first(a_head) = NULL;				\
+	}								\
+} while (0)
+
+#define ql_head_remove(a_head, a_type, a_field) do {			\
+	a_type *t = ql_first(a_head);					\
+	ql_remove((a_head), t, a_field);				\
+} while (0)
+
+#define ql_tail_remove(a_head, a_type, a_field) do {			\
+	a_type *t = ql_last(a_head, a_field);				\
+	ql_remove((a_head), t, a_field);				\
+} while (0)
+
+#define ql_foreach(a_var, a_head, a_field)				\
+	qr_foreach((a_var), ql_first(a_head), a_field)
+
+#define ql_reverse_foreach(a_var, a_head, a_field)			\
+	qr_reverse_foreach((a_var), ql_first(a_head), a_field)
+
+#endif /* JEMALLOC_INTERNAL_QL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
new file mode 100644
index 00000000..1e1056b3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
@@ -0,0 +1,72 @@
+#ifndef JEMALLOC_INTERNAL_QR_H
+#define JEMALLOC_INTERNAL_QR_H
+
+/* Ring definitions. */
+#define qr(a_type)							\
+struct {								\
+	a_type	*qre_next;						\
+	a_type	*qre_prev;						\
+}
+
+/* Ring functions. */
+#define qr_new(a_qr, a_field) do {					\
+	(a_qr)->a_field.qre_next = (a_qr);				\
+	(a_qr)->a_field.qre_prev = (a_qr);				\
+} while (0)
+
+#define qr_next(a_qr, a_field) ((a_qr)->a_field.qre_next)
+
+#define qr_prev(a_qr, a_field) ((a_qr)->a_field.qre_prev)
+
+#define qr_before_insert(a_qrelm, a_qr, a_field) do {			\
+	(a_qr)->a_field.qre_prev = (a_qrelm)->a_field.qre_prev;		\
+	(a_qr)->a_field.qre_next = (a_qrelm);				\
+	(a_qr)->a_field.qre_prev->a_field.qre_next = (a_qr);		\
+	(a_qrelm)->a_field.qre_prev = (a_qr);				\
+} while (0)
+
+#define qr_after_insert(a_qrelm, a_qr, a_field) do {			\
+	(a_qr)->a_field.qre_next = (a_qrelm)->a_field.qre_next;		\
+	(a_qr)->a_field.qre_prev = (a_qrelm);				\
+	(a_qr)->a_field.qre_next->a_field.qre_prev = (a_qr);		\
+	(a_qrelm)->a_field.qre_next = (a_qr);				\
+} while (0)
+
+#define qr_meld(a_qr_a, a_qr_b, a_type, a_field) do {			\
+	a_type *t;							\
+	(a_qr_a)->a_field.qre_prev->a_field.qre_next = (a_qr_b);	\
+	(a_qr_b)->a_field.qre_prev->a_field.qre_next = (a_qr_a);	\
+	t = (a_qr_a)->a_field.qre_prev;					\
+	(a_qr_a)->a_field.qre_prev = (a_qr_b)->a_field.qre_prev;	\
+	(a_qr_b)->a_field.qre_prev = t;					\
+} while (0)
+
+/*
+ * qr_meld() and qr_split() are functionally equivalent, so there's no need to
+ * have two copies of the code.
+ */
+#define qr_split(a_qr_a, a_qr_b, a_type, a_field)			\
+	qr_meld((a_qr_a), (a_qr_b), a_type, a_field)
+
+#define qr_remove(a_qr, a_field) do {					\
+	(a_qr)->a_field.qre_prev->a_field.qre_next			\
+	    = (a_qr)->a_field.qre_next;					\
+	(a_qr)->a_field.qre_next->a_field.qre_prev			\
+	    = (a_qr)->a_field.qre_prev;					\
+	(a_qr)->a_field.qre_next = (a_qr);				\
+	(a_qr)->a_field.qre_prev = (a_qr);				\
+} while (0)
+
+#define qr_foreach(var, a_qr, a_field)					\
+	for ((var) = (a_qr);						\
+	    (var) != NULL;						\
+	    (var) = (((var)->a_field.qre_next != (a_qr))		\
+	    ? (var)->a_field.qre_next : NULL))
+
+#define qr_reverse_foreach(var, a_qr, a_field)				\
+	for ((var) = ((a_qr) != NULL) ? qr_prev(a_qr, a_field) : NULL;	\
+	    (var) != NULL;						\
+	    (var) = (((var) != (a_qr))					\
+	    ? (var)->a_field.qre_prev : NULL))
+
+#endif /* JEMALLOC_INTERNAL_QR_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
new file mode 100644
index 00000000..47fa5ca9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
@@ -0,0 +1,1006 @@
+/*-
+ *******************************************************************************
+ *
+ * cpp macro implementation of left-leaning 2-3 red-black trees.  Parent
+ * pointers are not used, and color bits are stored in the least significant
+ * bit of right-child pointers (if RB_COMPACT is defined), thus making node
+ * linkage as compact as is possible for red-black trees.
+ *
+ * Usage:
+ *
+ *   #include <stdint.h>
+ *   #include <stdbool.h>
+ *   #define NDEBUG // (Optional, see assert(3).)
+ *   #include <assert.h>
+ *   #define RB_COMPACT // (Optional, embed color bits in right-child pointers.)
+ *   #include <rb.h>
+ *   ...
+ *
+ *******************************************************************************
+ */
+
+#ifndef RB_H_
+#define RB_H_
+
+#ifndef __PGI
+#define RB_COMPACT
+#endif
+
+#ifdef RB_COMPACT
+/* Node structure. */
+#define rb_node(a_type)							\
+struct {								\
+    a_type *rbn_left;							\
+    a_type *rbn_right_red;						\
+}
+#else
+#define rb_node(a_type)							\
+struct {								\
+    a_type *rbn_left;							\
+    a_type *rbn_right;							\
+    bool rbn_red;							\
+}
+#endif
+
+/* Root structure. */
+#define rb_tree(a_type)							\
+struct {								\
+    a_type *rbt_root;							\
+}
+
+/* Left accessors. */
+#define rbtn_left_get(a_type, a_field, a_node)				\
+    ((a_node)->a_field.rbn_left)
+#define rbtn_left_set(a_type, a_field, a_node, a_left) do {		\
+    (a_node)->a_field.rbn_left = a_left;				\
+} while (0)
+
+#ifdef RB_COMPACT
+/* Right accessors. */
+#define rbtn_right_get(a_type, a_field, a_node)				\
+    ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red)		\
+      & ((ssize_t)-2)))
+#define rbtn_right_set(a_type, a_field, a_node, a_right) do {		\
+    (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right)	\
+      | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1)));	\
+} while (0)
+
+/* Color accessors. */
+#define rbtn_red_get(a_type, a_field, a_node)				\
+    ((bool) (((uintptr_t) (a_node)->a_field.rbn_right_red)		\
+      & ((size_t)1)))
+#define rbtn_color_set(a_type, a_field, a_node, a_red) do {		\
+    (a_node)->a_field.rbn_right_red = (a_type *) ((((intptr_t)		\
+      (a_node)->a_field.rbn_right_red) & ((ssize_t)-2))			\
+      | ((ssize_t)a_red));						\
+} while (0)
+#define rbtn_red_set(a_type, a_field, a_node) do {			\
+    (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t)		\
+      (a_node)->a_field.rbn_right_red) | ((size_t)1));			\
+} while (0)
+#define rbtn_black_set(a_type, a_field, a_node) do {			\
+    (a_node)->a_field.rbn_right_red = (a_type *) (((intptr_t)		\
+      (a_node)->a_field.rbn_right_red) & ((ssize_t)-2));		\
+} while (0)
+
+/* Node initializer. */
+#define rbt_node_new(a_type, a_field, a_rbt, a_node) do {		\
+    /* Bookkeeping bit cannot be used by node pointer. */		\
+    assert(((uintptr_t)(a_node) & 0x1) == 0);				\
+    rbtn_left_set(a_type, a_field, (a_node), NULL);	\
+    rbtn_right_set(a_type, a_field, (a_node), NULL);	\
+    rbtn_red_set(a_type, a_field, (a_node));				\
+} while (0)
+#else
+/* Right accessors. */
+#define rbtn_right_get(a_type, a_field, a_node)				\
+    ((a_node)->a_field.rbn_right)
+#define rbtn_right_set(a_type, a_field, a_node, a_right) do {		\
+    (a_node)->a_field.rbn_right = a_right;				\
+} while (0)
+
+/* Color accessors. */
+#define rbtn_red_get(a_type, a_field, a_node)				\
+    ((a_node)->a_field.rbn_red)
+#define rbtn_color_set(a_type, a_field, a_node, a_red) do {		\
+    (a_node)->a_field.rbn_red = (a_red);				\
+} while (0)
+#define rbtn_red_set(a_type, a_field, a_node) do {			\
+    (a_node)->a_field.rbn_red = true;					\
+} while (0)
+#define rbtn_black_set(a_type, a_field, a_node) do {			\
+    (a_node)->a_field.rbn_red = false;					\
+} while (0)
+
+/* Node initializer. */
+#define rbt_node_new(a_type, a_field, a_rbt, a_node) do {		\
+    rbtn_left_set(a_type, a_field, (a_node), NULL);	\
+    rbtn_right_set(a_type, a_field, (a_node), NULL);	\
+    rbtn_red_set(a_type, a_field, (a_node));				\
+} while (0)
+#endif
+
+/* Tree initializer. */
+#define rb_new(a_type, a_field, a_rbt) do {				\
+    (a_rbt)->rbt_root = NULL;						\
+} while (0)
+
+/* Internal utility macros. */
+#define rbtn_first(a_type, a_field, a_rbt, a_root, r_node) do {		\
+    (r_node) = (a_root);						\
+    if ((r_node) != NULL) {						\
+	for (;								\
+	  rbtn_left_get(a_type, a_field, (r_node)) != NULL;		\
+	  (r_node) = rbtn_left_get(a_type, a_field, (r_node))) {	\
+	}								\
+    }									\
+} while (0)
+
+#define rbtn_last(a_type, a_field, a_rbt, a_root, r_node) do {		\
+    (r_node) = (a_root);						\
+    if ((r_node) != NULL) {						\
+	for (; rbtn_right_get(a_type, a_field, (r_node)) != NULL;	\
+	  (r_node) = rbtn_right_get(a_type, a_field, (r_node))) {	\
+	}								\
+    }									\
+} while (0)
+
+#define rbtn_rotate_left(a_type, a_field, a_node, r_node) do {		\
+    (r_node) = rbtn_right_get(a_type, a_field, (a_node));		\
+    rbtn_right_set(a_type, a_field, (a_node),				\
+      rbtn_left_get(a_type, a_field, (r_node)));			\
+    rbtn_left_set(a_type, a_field, (r_node), (a_node));			\
+} while (0)
+
+#define rbtn_rotate_right(a_type, a_field, a_node, r_node) do {		\
+    (r_node) = rbtn_left_get(a_type, a_field, (a_node));		\
+    rbtn_left_set(a_type, a_field, (a_node),				\
+      rbtn_right_get(a_type, a_field, (r_node)));			\
+    rbtn_right_set(a_type, a_field, (r_node), (a_node));		\
+} while (0)
+
+/*
+ * The rb_proto() macro generates function prototypes that correspond to the
+ * functions generated by an equivalently parameterized call to rb_gen().
+ */
+
+#define rb_proto(a_attr, a_prefix, a_rbt_type, a_type)			\
+a_attr void								\
+a_prefix##new(a_rbt_type *rbtree);					\
+a_attr bool								\
+a_prefix##empty(a_rbt_type *rbtree);					\
+a_attr a_type *								\
+a_prefix##first(a_rbt_type *rbtree);					\
+a_attr a_type *								\
+a_prefix##last(a_rbt_type *rbtree);					\
+a_attr a_type *								\
+a_prefix##next(a_rbt_type *rbtree, a_type *node);			\
+a_attr a_type *								\
+a_prefix##prev(a_rbt_type *rbtree, a_type *node);			\
+a_attr a_type *								\
+a_prefix##search(a_rbt_type *rbtree, const a_type *key);		\
+a_attr a_type *								\
+a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key);		\
+a_attr a_type *								\
+a_prefix##psearch(a_rbt_type *rbtree, const a_type *key);		\
+a_attr void								\
+a_prefix##insert(a_rbt_type *rbtree, a_type *node);			\
+a_attr void								\
+a_prefix##remove(a_rbt_type *rbtree, a_type *node);			\
+a_attr a_type *								\
+a_prefix##iter(a_rbt_type *rbtree, a_type *start, a_type *(*cb)(	\
+  a_rbt_type *, a_type *, void *), void *arg);				\
+a_attr a_type *								\
+a_prefix##reverse_iter(a_rbt_type *rbtree, a_type *start,		\
+  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg);		\
+a_attr void								\
+a_prefix##destroy(a_rbt_type *rbtree, void (*cb)(a_type *, void *),	\
+  void *arg);
+
+/*
+ * The rb_gen() macro generates a type-specific red-black tree implementation,
+ * based on the above cpp macros.
+ *
+ * Arguments:
+ *
+ *   a_attr    : Function attribute for generated functions (ex: static).
+ *   a_prefix  : Prefix for generated functions (ex: ex_).
+ *   a_rb_type : Type for red-black tree data structure (ex: ex_t).
+ *   a_type    : Type for red-black tree node data structure (ex: ex_node_t).
+ *   a_field   : Name of red-black tree node linkage (ex: ex_link).
+ *   a_cmp     : Node comparison function name, with the following prototype:
+ *                 int (a_cmp *)(a_type *a_node, a_type *a_other);
+ *                                       ^^^^^^
+ *                                    or a_key
+ *               Interpretation of comparison function return values:
+ *                 -1 : a_node <  a_other
+ *                  0 : a_node == a_other
+ *                  1 : a_node >  a_other
+ *               In all cases, the a_node or a_key macro argument is the first
+ *               argument to the comparison function, which makes it possible
+ *               to write comparison functions that treat the first argument
+ *               specially.
+ *
+ * Assuming the following setup:
+ *
+ *   typedef struct ex_node_s ex_node_t;
+ *   struct ex_node_s {
+ *       rb_node(ex_node_t) ex_link;
+ *   };
+ *   typedef rb_tree(ex_node_t) ex_t;
+ *   rb_gen(static, ex_, ex_t, ex_node_t, ex_link, ex_cmp)
+ *
+ * The following API is generated:
+ *
+ *   static void
+ *   ex_new(ex_t *tree);
+ *       Description: Initialize a red-black tree structure.
+ *       Args:
+ *         tree: Pointer to an uninitialized red-black tree object.
+ *
+ *   static bool
+ *   ex_empty(ex_t *tree);
+ *       Description: Determine whether tree is empty.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *       Ret: True if tree is empty, false otherwise.
+ *
+ *   static ex_node_t *
+ *   ex_first(ex_t *tree);
+ *   static ex_node_t *
+ *   ex_last(ex_t *tree);
+ *       Description: Get the first/last node in tree.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *       Ret: First/last node in tree, or NULL if tree is empty.
+ *
+ *   static ex_node_t *
+ *   ex_next(ex_t *tree, ex_node_t *node);
+ *   static ex_node_t *
+ *   ex_prev(ex_t *tree, ex_node_t *node);
+ *       Description: Get node's successor/predecessor.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         node: A node in tree.
+ *       Ret: node's successor/predecessor in tree, or NULL if node is
+ *            last/first.
+ *
+ *   static ex_node_t *
+ *   ex_search(ex_t *tree, const ex_node_t *key);
+ *       Description: Search for node that matches key.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         key : Search key.
+ *       Ret: Node in tree that matches key, or NULL if no match.
+ *
+ *   static ex_node_t *
+ *   ex_nsearch(ex_t *tree, const ex_node_t *key);
+ *   static ex_node_t *
+ *   ex_psearch(ex_t *tree, const ex_node_t *key);
+ *       Description: Search for node that matches key.  If no match is found,
+ *                    return what would be key's successor/predecessor, were
+ *                    key in tree.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         key : Search key.
+ *       Ret: Node in tree that matches key, or if no match, hypothetical node's
+ *            successor/predecessor (NULL if no successor/predecessor).
+ *
+ *   static void
+ *   ex_insert(ex_t *tree, ex_node_t *node);
+ *       Description: Insert node into tree.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         node: Node to be inserted into tree.
+ *
+ *   static void
+ *   ex_remove(ex_t *tree, ex_node_t *node);
+ *       Description: Remove node from tree.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         node: Node in tree to be removed.
+ *
+ *   static ex_node_t *
+ *   ex_iter(ex_t *tree, ex_node_t *start, ex_node_t *(*cb)(ex_t *,
+ *     ex_node_t *, void *), void *arg);
+ *   static ex_node_t *
+ *   ex_reverse_iter(ex_t *tree, ex_node_t *start, ex_node *(*cb)(ex_t *,
+ *     ex_node_t *, void *), void *arg);
+ *       Description: Iterate forward/backward over tree, starting at node.  If
+ *                    tree is modified, iteration must be immediately
+ *                    terminated by the callback function that causes the
+ *                    modification.
+ *       Args:
+ *         tree : Pointer to an initialized red-black tree object.
+ *         start: Node at which to start iteration, or NULL to start at
+ *                first/last node.
+ *         cb   : Callback function, which is called for each node during
+ *                iteration.  Under normal circumstances the callback function
+ *                should return NULL, which causes iteration to continue.  If a
+ *                callback function returns non-NULL, iteration is immediately
+ *                terminated and the non-NULL return value is returned by the
+ *                iterator.  This is useful for re-starting iteration after
+ *                modifying tree.
+ *         arg  : Opaque pointer passed to cb().
+ *       Ret: NULL if iteration completed, or the non-NULL callback return value
+ *            that caused termination of the iteration.
+ *
+ *   static void
+ *   ex_destroy(ex_t *tree, void (*cb)(ex_node_t *, void *), void *arg);
+ *       Description: Iterate over the tree with post-order traversal, remove
+ *                    each node, and run the callback if non-null.  This is
+ *                    used for destroying a tree without paying the cost to
+ *                    rebalance it.  The tree must not be otherwise altered
+ *                    during traversal.
+ *       Args:
+ *         tree: Pointer to an initialized red-black tree object.
+ *         cb  : Callback function, which, if non-null, is called for each node
+ *               during iteration.  There is no way to stop iteration once it
+ *               has begun.
+ *         arg : Opaque pointer passed to cb().
+ */
+#define rb_gen(a_attr, a_prefix, a_rbt_type, a_type, a_field, a_cmp)	\
+a_attr void								\
+a_prefix##new(a_rbt_type *rbtree) {					\
+    rb_new(a_type, a_field, rbtree);					\
+}									\
+a_attr bool								\
+a_prefix##empty(a_rbt_type *rbtree) {					\
+    return (rbtree->rbt_root == NULL);					\
+}									\
+a_attr a_type *								\
+a_prefix##first(a_rbt_type *rbtree) {					\
+    a_type *ret;							\
+    rbtn_first(a_type, a_field, rbtree, rbtree->rbt_root, ret);		\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##last(a_rbt_type *rbtree) {					\
+    a_type *ret;							\
+    rbtn_last(a_type, a_field, rbtree, rbtree->rbt_root, ret);		\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##next(a_rbt_type *rbtree, a_type *node) {			\
+    a_type *ret;							\
+    if (rbtn_right_get(a_type, a_field, node) != NULL) {		\
+	rbtn_first(a_type, a_field, rbtree, rbtn_right_get(a_type,	\
+	  a_field, node), ret);						\
+    } else {								\
+	a_type *tnode = rbtree->rbt_root;				\
+	assert(tnode != NULL);						\
+	ret = NULL;							\
+	while (true) {							\
+	    int cmp = (a_cmp)(node, tnode);				\
+	    if (cmp < 0) {						\
+		ret = tnode;						\
+		tnode = rbtn_left_get(a_type, a_field, tnode);		\
+	    } else if (cmp > 0) {					\
+		tnode = rbtn_right_get(a_type, a_field, tnode);		\
+	    } else {							\
+		break;							\
+	    }								\
+	    assert(tnode != NULL);					\
+	}								\
+    }									\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##prev(a_rbt_type *rbtree, a_type *node) {			\
+    a_type *ret;							\
+    if (rbtn_left_get(a_type, a_field, node) != NULL) {			\
+	rbtn_last(a_type, a_field, rbtree, rbtn_left_get(a_type,	\
+	  a_field, node), ret);						\
+    } else {								\
+	a_type *tnode = rbtree->rbt_root;				\
+	assert(tnode != NULL);						\
+	ret = NULL;							\
+	while (true) {							\
+	    int cmp = (a_cmp)(node, tnode);				\
+	    if (cmp < 0) {						\
+		tnode = rbtn_left_get(a_type, a_field, tnode);		\
+	    } else if (cmp > 0) {					\
+		ret = tnode;						\
+		tnode = rbtn_right_get(a_type, a_field, tnode);		\
+	    } else {							\
+		break;							\
+	    }								\
+	    assert(tnode != NULL);					\
+	}								\
+    }									\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##search(a_rbt_type *rbtree, const a_type *key) {		\
+    a_type *ret;							\
+    int cmp;								\
+    ret = rbtree->rbt_root;						\
+    while (ret != NULL							\
+      && (cmp = (a_cmp)(key, ret)) != 0) {				\
+	if (cmp < 0) {							\
+	    ret = rbtn_left_get(a_type, a_field, ret);			\
+	} else {							\
+	    ret = rbtn_right_get(a_type, a_field, ret);			\
+	}								\
+    }									\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key) {		\
+    a_type *ret;							\
+    a_type *tnode = rbtree->rbt_root;					\
+    ret = NULL;								\
+    while (tnode != NULL) {						\
+	int cmp = (a_cmp)(key, tnode);					\
+	if (cmp < 0) {							\
+	    ret = tnode;						\
+	    tnode = rbtn_left_get(a_type, a_field, tnode);		\
+	} else if (cmp > 0) {						\
+	    tnode = rbtn_right_get(a_type, a_field, tnode);		\
+	} else {							\
+	    ret = tnode;						\
+	    break;							\
+	}								\
+    }									\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##psearch(a_rbt_type *rbtree, const a_type *key) {		\
+    a_type *ret;							\
+    a_type *tnode = rbtree->rbt_root;					\
+    ret = NULL;								\
+    while (tnode != NULL) {						\
+	int cmp = (a_cmp)(key, tnode);					\
+	if (cmp < 0) {							\
+	    tnode = rbtn_left_get(a_type, a_field, tnode);		\
+	} else if (cmp > 0) {						\
+	    ret = tnode;						\
+	    tnode = rbtn_right_get(a_type, a_field, tnode);		\
+	} else {							\
+	    ret = tnode;						\
+	    break;							\
+	}								\
+    }									\
+    return ret;								\
+}									\
+a_attr void								\
+a_prefix##insert(a_rbt_type *rbtree, a_type *node) {			\
+    struct {								\
+	a_type *node;							\
+	int cmp;							\
+    } path[sizeof(void *) << 4], *pathp;				\
+    rbt_node_new(a_type, a_field, rbtree, node);			\
+    /* Wind. */								\
+    path->node = rbtree->rbt_root;					\
+    for (pathp = path; pathp->node != NULL; pathp++) {			\
+	int cmp = pathp->cmp = a_cmp(node, pathp->node);		\
+	assert(cmp != 0);						\
+	if (cmp < 0) {							\
+	    pathp[1].node = rbtn_left_get(a_type, a_field,		\
+	      pathp->node);						\
+	} else {							\
+	    pathp[1].node = rbtn_right_get(a_type, a_field,		\
+	      pathp->node);						\
+	}								\
+    }									\
+    pathp->node = node;							\
+    /* Unwind. */							\
+    for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) {	\
+	a_type *cnode = pathp->node;					\
+	if (pathp->cmp < 0) {						\
+	    a_type *left = pathp[1].node;				\
+	    rbtn_left_set(a_type, a_field, cnode, left);		\
+	    if (rbtn_red_get(a_type, a_field, left)) {			\
+		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
+		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
+		  leftleft)) {						\
+		    /* Fix up 4-node. */				\
+		    a_type *tnode;					\
+		    rbtn_black_set(a_type, a_field, leftleft);		\
+		    rbtn_rotate_right(a_type, a_field, cnode, tnode);	\
+		    cnode = tnode;					\
+		}							\
+	    } else {							\
+		return;							\
+	    }								\
+	} else {							\
+	    a_type *right = pathp[1].node;				\
+	    rbtn_right_set(a_type, a_field, cnode, right);		\
+	    if (rbtn_red_get(a_type, a_field, right)) {			\
+		a_type *left = rbtn_left_get(a_type, a_field, cnode);	\
+		if (left != NULL && rbtn_red_get(a_type, a_field,	\
+		  left)) {						\
+		    /* Split 4-node. */					\
+		    rbtn_black_set(a_type, a_field, left);		\
+		    rbtn_black_set(a_type, a_field, right);		\
+		    rbtn_red_set(a_type, a_field, cnode);		\
+		} else {						\
+		    /* Lean left. */					\
+		    a_type *tnode;					\
+		    bool tred = rbtn_red_get(a_type, a_field, cnode);	\
+		    rbtn_rotate_left(a_type, a_field, cnode, tnode);	\
+		    rbtn_color_set(a_type, a_field, tnode, tred);	\
+		    rbtn_red_set(a_type, a_field, cnode);		\
+		    cnode = tnode;					\
+		}							\
+	    } else {							\
+		return;							\
+	    }								\
+	}								\
+	pathp->node = cnode;						\
+    }									\
+    /* Set root, and make it black. */					\
+    rbtree->rbt_root = path->node;					\
+    rbtn_black_set(a_type, a_field, rbtree->rbt_root);			\
+}									\
+a_attr void								\
+a_prefix##remove(a_rbt_type *rbtree, a_type *node) {			\
+    struct {								\
+	a_type *node;							\
+	int cmp;							\
+    } *pathp, *nodep, path[sizeof(void *) << 4];			\
+    /* Wind. */								\
+    nodep = NULL; /* Silence compiler warning. */			\
+    path->node = rbtree->rbt_root;					\
+    for (pathp = path; pathp->node != NULL; pathp++) {			\
+	int cmp = pathp->cmp = a_cmp(node, pathp->node);		\
+	if (cmp < 0) {							\
+	    pathp[1].node = rbtn_left_get(a_type, a_field,		\
+	      pathp->node);						\
+	} else {							\
+	    pathp[1].node = rbtn_right_get(a_type, a_field,		\
+	      pathp->node);						\
+	    if (cmp == 0) {						\
+	        /* Find node's successor, in preparation for swap. */	\
+		pathp->cmp = 1;						\
+		nodep = pathp;						\
+		for (pathp++; pathp->node != NULL; pathp++) {		\
+		    pathp->cmp = -1;					\
+		    pathp[1].node = rbtn_left_get(a_type, a_field,	\
+		      pathp->node);					\
+		}							\
+		break;							\
+	    }								\
+	}								\
+    }									\
+    assert(nodep->node == node);					\
+    pathp--;								\
+    if (pathp->node != node) {						\
+	/* Swap node with its successor. */				\
+	bool tred = rbtn_red_get(a_type, a_field, pathp->node);		\
+	rbtn_color_set(a_type, a_field, pathp->node,			\
+	  rbtn_red_get(a_type, a_field, node));				\
+	rbtn_left_set(a_type, a_field, pathp->node,			\
+	  rbtn_left_get(a_type, a_field, node));			\
+	/* If node's successor is its right child, the following code */\
+	/* will do the wrong thing for the right child pointer.       */\
+	/* However, it doesn't matter, because the pointer will be    */\
+	/* properly set when the successor is pruned.                 */\
+	rbtn_right_set(a_type, a_field, pathp->node,			\
+	  rbtn_right_get(a_type, a_field, node));			\
+	rbtn_color_set(a_type, a_field, node, tred);			\
+	/* The pruned leaf node's child pointers are never accessed   */\
+	/* again, so don't bother setting them to nil.                */\
+	nodep->node = pathp->node;					\
+	pathp->node = node;						\
+	if (nodep == path) {						\
+	    rbtree->rbt_root = nodep->node;				\
+	} else {							\
+	    if (nodep[-1].cmp < 0) {					\
+		rbtn_left_set(a_type, a_field, nodep[-1].node,		\
+		  nodep->node);						\
+	    } else {							\
+		rbtn_right_set(a_type, a_field, nodep[-1].node,		\
+		  nodep->node);						\
+	    }								\
+	}								\
+    } else {								\
+	a_type *left = rbtn_left_get(a_type, a_field, node);		\
+	if (left != NULL) {						\
+	    /* node has no successor, but it has a left child.        */\
+	    /* Splice node out, without losing the left child.        */\
+	    assert(!rbtn_red_get(a_type, a_field, node));		\
+	    assert(rbtn_red_get(a_type, a_field, left));		\
+	    rbtn_black_set(a_type, a_field, left);			\
+	    if (pathp == path) {					\
+		rbtree->rbt_root = left;				\
+	    } else {							\
+		if (pathp[-1].cmp < 0) {				\
+		    rbtn_left_set(a_type, a_field, pathp[-1].node,	\
+		      left);						\
+		} else {						\
+		    rbtn_right_set(a_type, a_field, pathp[-1].node,	\
+		      left);						\
+		}							\
+	    }								\
+	    return;							\
+	} else if (pathp == path) {					\
+	    /* The tree only contained one node. */			\
+	    rbtree->rbt_root = NULL;					\
+	    return;							\
+	}								\
+    }									\
+    if (rbtn_red_get(a_type, a_field, pathp->node)) {			\
+	/* Prune red node, which requires no fixup. */			\
+	assert(pathp[-1].cmp < 0);					\
+	rbtn_left_set(a_type, a_field, pathp[-1].node, NULL);		\
+	return;								\
+    }									\
+    /* The node to be pruned is black, so unwind until balance is     */\
+    /* restored.                                                      */\
+    pathp->node = NULL;							\
+    for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) {	\
+	assert(pathp->cmp != 0);					\
+	if (pathp->cmp < 0) {						\
+	    rbtn_left_set(a_type, a_field, pathp->node,			\
+	      pathp[1].node);						\
+	    if (rbtn_red_get(a_type, a_field, pathp->node)) {		\
+		a_type *right = rbtn_right_get(a_type, a_field,		\
+		  pathp->node);						\
+		a_type *rightleft = rbtn_left_get(a_type, a_field,	\
+		  right);						\
+		a_type *tnode;						\
+		if (rightleft != NULL && rbtn_red_get(a_type, a_field,	\
+		  rightleft)) {						\
+		    /* In the following diagrams, ||, //, and \\      */\
+		    /* indicate the path to the removed node.         */\
+		    /*                                                */\
+		    /*      ||                                        */\
+		    /*    pathp(r)                                    */\
+		    /*  //        \                                   */\
+		    /* (b)        (b)                                 */\
+		    /*           /                                    */\
+		    /*          (r)                                   */\
+		    /*                                                */\
+		    rbtn_black_set(a_type, a_field, pathp->node);	\
+		    rbtn_rotate_right(a_type, a_field, right, tnode);	\
+		    rbtn_right_set(a_type, a_field, pathp->node, tnode);\
+		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		} else {						\
+		    /*      ||                                        */\
+		    /*    pathp(r)                                    */\
+		    /*  //        \                                   */\
+		    /* (b)        (b)                                 */\
+		    /*           /                                    */\
+		    /*          (b)                                   */\
+		    /*                                                */\
+		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		}							\
+		/* Balance restored, but rotation modified subtree    */\
+		/* root.                                              */\
+		assert((uintptr_t)pathp > (uintptr_t)path);		\
+		if (pathp[-1].cmp < 0) {				\
+		    rbtn_left_set(a_type, a_field, pathp[-1].node,	\
+		      tnode);						\
+		} else {						\
+		    rbtn_right_set(a_type, a_field, pathp[-1].node,	\
+		      tnode);						\
+		}							\
+		return;							\
+	    } else {							\
+		a_type *right = rbtn_right_get(a_type, a_field,		\
+		  pathp->node);						\
+		a_type *rightleft = rbtn_left_get(a_type, a_field,	\
+		  right);						\
+		if (rightleft != NULL && rbtn_red_get(a_type, a_field,	\
+		  rightleft)) {						\
+		    /*      ||                                        */\
+		    /*    pathp(b)                                    */\
+		    /*  //        \                                   */\
+		    /* (b)        (b)                                 */\
+		    /*           /                                    */\
+		    /*          (r)                                   */\
+		    a_type *tnode;					\
+		    rbtn_black_set(a_type, a_field, rightleft);		\
+		    rbtn_rotate_right(a_type, a_field, right, tnode);	\
+		    rbtn_right_set(a_type, a_field, pathp->node, tnode);\
+		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    /* Balance restored, but rotation modified        */\
+		    /* subtree root, which may actually be the tree   */\
+		    /* root.                                          */\
+		    if (pathp == path) {				\
+			/* Set root. */					\
+			rbtree->rbt_root = tnode;			\
+		    } else {						\
+			if (pathp[-1].cmp < 0) {			\
+			    rbtn_left_set(a_type, a_field,		\
+			      pathp[-1].node, tnode);			\
+			} else {					\
+			    rbtn_right_set(a_type, a_field,		\
+			      pathp[-1].node, tnode);			\
+			}						\
+		    }							\
+		    return;						\
+		} else {						\
+		    /*      ||                                        */\
+		    /*    pathp(b)                                    */\
+		    /*  //        \                                   */\
+		    /* (b)        (b)                                 */\
+		    /*           /                                    */\
+		    /*          (b)                                   */\
+		    a_type *tnode;					\
+		    rbtn_red_set(a_type, a_field, pathp->node);		\
+		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    pathp->node = tnode;				\
+		}							\
+	    }								\
+	} else {							\
+	    a_type *left;						\
+	    rbtn_right_set(a_type, a_field, pathp->node,		\
+	      pathp[1].node);						\
+	    left = rbtn_left_get(a_type, a_field, pathp->node);		\
+	    if (rbtn_red_get(a_type, a_field, left)) {			\
+		a_type *tnode;						\
+		a_type *leftright = rbtn_right_get(a_type, a_field,	\
+		  left);						\
+		a_type *leftrightleft = rbtn_left_get(a_type, a_field,	\
+		  leftright);						\
+		if (leftrightleft != NULL && rbtn_red_get(a_type,	\
+		  a_field, leftrightleft)) {				\
+		    /*      ||                                        */\
+		    /*    pathp(b)                                    */\
+		    /*   /        \\                                  */\
+		    /* (r)        (b)                                 */\
+		    /*   \                                            */\
+		    /*   (b)                                          */\
+		    /*   /                                            */\
+		    /* (r)                                            */\
+		    a_type *unode;					\
+		    rbtn_black_set(a_type, a_field, leftrightleft);	\
+		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
+		      unode);						\
+		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    rbtn_right_set(a_type, a_field, unode, tnode);	\
+		    rbtn_rotate_left(a_type, a_field, unode, tnode);	\
+		} else {						\
+		    /*      ||                                        */\
+		    /*    pathp(b)                                    */\
+		    /*   /        \\                                  */\
+		    /* (r)        (b)                                 */\
+		    /*   \                                            */\
+		    /*   (b)                                          */\
+		    /*   /                                            */\
+		    /* (b)                                            */\
+		    assert(leftright != NULL);				\
+		    rbtn_red_set(a_type, a_field, leftright);		\
+		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    rbtn_black_set(a_type, a_field, tnode);		\
+		}							\
+		/* Balance restored, but rotation modified subtree    */\
+		/* root, which may actually be the tree root.         */\
+		if (pathp == path) {					\
+		    /* Set root. */					\
+		    rbtree->rbt_root = tnode;				\
+		} else {						\
+		    if (pathp[-1].cmp < 0) {				\
+			rbtn_left_set(a_type, a_field, pathp[-1].node,	\
+			  tnode);					\
+		    } else {						\
+			rbtn_right_set(a_type, a_field, pathp[-1].node,	\
+			  tnode);					\
+		    }							\
+		}							\
+		return;							\
+	    } else if (rbtn_red_get(a_type, a_field, pathp->node)) {	\
+		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
+		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
+		  leftleft)) {						\
+		    /*        ||                                      */\
+		    /*      pathp(r)                                  */\
+		    /*     /        \\                                */\
+		    /*   (b)        (b)                               */\
+		    /*   /                                            */\
+		    /* (r)                                            */\
+		    a_type *tnode;					\
+		    rbtn_black_set(a_type, a_field, pathp->node);	\
+		    rbtn_red_set(a_type, a_field, left);		\
+		    rbtn_black_set(a_type, a_field, leftleft);		\
+		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    /* Balance restored, but rotation modified        */\
+		    /* subtree root.                                  */\
+		    assert((uintptr_t)pathp > (uintptr_t)path);		\
+		    if (pathp[-1].cmp < 0) {				\
+			rbtn_left_set(a_type, a_field, pathp[-1].node,	\
+			  tnode);					\
+		    } else {						\
+			rbtn_right_set(a_type, a_field, pathp[-1].node,	\
+			  tnode);					\
+		    }							\
+		    return;						\
+		} else {						\
+		    /*        ||                                      */\
+		    /*      pathp(r)                                  */\
+		    /*     /        \\                                */\
+		    /*   (b)        (b)                               */\
+		    /*   /                                            */\
+		    /* (b)                                            */\
+		    rbtn_red_set(a_type, a_field, left);		\
+		    rbtn_black_set(a_type, a_field, pathp->node);	\
+		    /* Balance restored. */				\
+		    return;						\
+		}							\
+	    } else {							\
+		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
+		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
+		  leftleft)) {						\
+		    /*               ||                               */\
+		    /*             pathp(b)                           */\
+		    /*            /        \\                         */\
+		    /*          (b)        (b)                        */\
+		    /*          /                                     */\
+		    /*        (r)                                     */\
+		    a_type *tnode;					\
+		    rbtn_black_set(a_type, a_field, leftleft);		\
+		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
+		      tnode);						\
+		    /* Balance restored, but rotation modified        */\
+		    /* subtree root, which may actually be the tree   */\
+		    /* root.                                          */\
+		    if (pathp == path) {				\
+			/* Set root. */					\
+			rbtree->rbt_root = tnode;			\
+		    } else {						\
+			if (pathp[-1].cmp < 0) {			\
+			    rbtn_left_set(a_type, a_field,		\
+			      pathp[-1].node, tnode);			\
+			} else {					\
+			    rbtn_right_set(a_type, a_field,		\
+			      pathp[-1].node, tnode);			\
+			}						\
+		    }							\
+		    return;						\
+		} else {						\
+		    /*               ||                               */\
+		    /*             pathp(b)                           */\
+		    /*            /        \\                         */\
+		    /*          (b)        (b)                        */\
+		    /*          /                                     */\
+		    /*        (b)                                     */\
+		    rbtn_red_set(a_type, a_field, left);		\
+		}							\
+	    }								\
+	}								\
+    }									\
+    /* Set root. */							\
+    rbtree->rbt_root = path->node;					\
+    assert(!rbtn_red_get(a_type, a_field, rbtree->rbt_root));		\
+}									\
+a_attr a_type *								\
+a_prefix##iter_recurse(a_rbt_type *rbtree, a_type *node,		\
+  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
+    if (node == NULL) {							\
+	return NULL;							\
+    } else {								\
+	a_type *ret;							\
+	if ((ret = a_prefix##iter_recurse(rbtree, rbtn_left_get(a_type,	\
+	  a_field, node), cb, arg)) != NULL || (ret = cb(rbtree, node,	\
+	  arg)) != NULL) {						\
+	    return ret;							\
+	}								\
+	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
+	  a_field, node), cb, arg);					\
+    }									\
+}									\
+a_attr a_type *								\
+a_prefix##iter_start(a_rbt_type *rbtree, a_type *start, a_type *node,	\
+  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
+    int cmp = a_cmp(start, node);					\
+    if (cmp < 0) {							\
+	a_type *ret;							\
+	if ((ret = a_prefix##iter_start(rbtree, start,			\
+	  rbtn_left_get(a_type, a_field, node), cb, arg)) != NULL ||	\
+	  (ret = cb(rbtree, node, arg)) != NULL) {			\
+	    return ret;							\
+	}								\
+	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
+	  a_field, node), cb, arg);					\
+    } else if (cmp > 0) {						\
+	return a_prefix##iter_start(rbtree, start,			\
+	  rbtn_right_get(a_type, a_field, node), cb, arg);		\
+    } else {								\
+	a_type *ret;							\
+	if ((ret = cb(rbtree, node, arg)) != NULL) {			\
+	    return ret;							\
+	}								\
+	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
+	  a_field, node), cb, arg);					\
+    }									\
+}									\
+a_attr a_type *								\
+a_prefix##iter(a_rbt_type *rbtree, a_type *start, a_type *(*cb)(	\
+  a_rbt_type *, a_type *, void *), void *arg) {				\
+    a_type *ret;							\
+    if (start != NULL) {						\
+	ret = a_prefix##iter_start(rbtree, start, rbtree->rbt_root,	\
+	  cb, arg);							\
+    } else {								\
+	ret = a_prefix##iter_recurse(rbtree, rbtree->rbt_root, cb, arg);\
+    }									\
+    return ret;								\
+}									\
+a_attr a_type *								\
+a_prefix##reverse_iter_recurse(a_rbt_type *rbtree, a_type *node,	\
+  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
+    if (node == NULL) {							\
+	return NULL;							\
+    } else {								\
+	a_type *ret;							\
+	if ((ret = a_prefix##reverse_iter_recurse(rbtree,		\
+	  rbtn_right_get(a_type, a_field, node), cb, arg)) != NULL ||	\
+	  (ret = cb(rbtree, node, arg)) != NULL) {			\
+	    return ret;							\
+	}								\
+	return a_prefix##reverse_iter_recurse(rbtree,			\
+	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
+    }									\
+}									\
+a_attr a_type *								\
+a_prefix##reverse_iter_start(a_rbt_type *rbtree, a_type *start,		\
+  a_type *node, a_type *(*cb)(a_rbt_type *, a_type *, void *),		\
+  void *arg) {								\
+    int cmp = a_cmp(start, node);					\
+    if (cmp > 0) {							\
+	a_type *ret;							\
+	if ((ret = a_prefix##reverse_iter_start(rbtree, start,		\
+	  rbtn_right_get(a_type, a_field, node), cb, arg)) != NULL ||	\
+	  (ret = cb(rbtree, node, arg)) != NULL) {			\
+	    return ret;							\
+	}								\
+	return a_prefix##reverse_iter_recurse(rbtree,			\
+	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
+    } else if (cmp < 0) {						\
+	return a_prefix##reverse_iter_start(rbtree, start,		\
+	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
+    } else {								\
+	a_type *ret;							\
+	if ((ret = cb(rbtree, node, arg)) != NULL) {			\
+	    return ret;							\
+	}								\
+	return a_prefix##reverse_iter_recurse(rbtree,			\
+	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
+    }									\
+}									\
+a_attr a_type *								\
+a_prefix##reverse_iter(a_rbt_type *rbtree, a_type *start,		\
+  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
+    a_type *ret;							\
+    if (start != NULL) {						\
+	ret = a_prefix##reverse_iter_start(rbtree, start,		\
+	  rbtree->rbt_root, cb, arg);					\
+    } else {								\
+	ret = a_prefix##reverse_iter_recurse(rbtree, rbtree->rbt_root,	\
+	  cb, arg);							\
+    }									\
+    return ret;								\
+}									\
+a_attr void								\
+a_prefix##destroy_recurse(a_rbt_type *rbtree, a_type *node, void (*cb)(	\
+  a_type *, void *), void *arg) {					\
+    if (node == NULL) {							\
+	return;								\
+    }									\
+    a_prefix##destroy_recurse(rbtree, rbtn_left_get(a_type, a_field,	\
+      node), cb, arg);							\
+    rbtn_left_set(a_type, a_field, (node), NULL);			\
+    a_prefix##destroy_recurse(rbtree, rbtn_right_get(a_type, a_field,	\
+      node), cb, arg);							\
+    rbtn_right_set(a_type, a_field, (node), NULL);			\
+    if (cb) {								\
+	cb(node, arg);							\
+    }									\
+}									\
+a_attr void								\
+a_prefix##destroy(a_rbt_type *rbtree, void (*cb)(a_type *, void *),	\
+  void *arg) {								\
+    a_prefix##destroy_recurse(rbtree, rbtree->rbt_root, cb, arg);	\
+    rbtree->rbt_root = NULL;						\
+}
+
+#endif /* RB_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
new file mode 100644
index 00000000..b59d33a8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
@@ -0,0 +1,492 @@
+#ifndef JEMALLOC_INTERNAL_RTREE_H
+#define JEMALLOC_INTERNAL_RTREE_H
+
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree_tsd.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/tsd.h"
+
+/*
+ * This radix tree implementation is tailored to the singular purpose of
+ * associating metadata with extents that are currently owned by jemalloc.
+ *
+ *******************************************************************************
+ */
+
+/* Number of high insignificant bits. */
+#define RTREE_NHIB ((1U << (LG_SIZEOF_PTR+3)) - LG_VADDR)
+/* Number of low insigificant bits. */
+#define RTREE_NLIB LG_PAGE
+/* Number of significant bits. */
+#define RTREE_NSB (LG_VADDR - RTREE_NLIB)
+/* Number of levels in radix tree. */
+#if RTREE_NSB <= 10
+#  define RTREE_HEIGHT 1
+#elif RTREE_NSB <= 36
+#  define RTREE_HEIGHT 2
+#elif RTREE_NSB <= 52
+#  define RTREE_HEIGHT 3
+#else
+#  error Unsupported number of significant virtual address bits
+#endif
+/* Use compact leaf representation if virtual address encoding allows. */
+#if RTREE_NHIB >= LG_CEIL_NSIZES
+#  define RTREE_LEAF_COMPACT
+#endif
+
+/* Needed for initialization only. */
+#define RTREE_LEAFKEY_INVALID ((uintptr_t)1)
+
+typedef struct rtree_node_elm_s rtree_node_elm_t;
+struct rtree_node_elm_s {
+	atomic_p_t	child; /* (rtree_{node,leaf}_elm_t *) */
+};
+
+struct rtree_leaf_elm_s {
+#ifdef RTREE_LEAF_COMPACT
+	/*
+	 * Single pointer-width field containing all three leaf element fields.
+	 * For example, on a 64-bit x64 system with 48 significant virtual
+	 * memory address bits, the index, extent, and slab fields are packed as
+	 * such:
+	 *
+	 * x: index
+	 * e: extent
+	 * b: slab
+	 *
+	 *   00000000 xxxxxxxx eeeeeeee [...] eeeeeeee eeee000b
+	 */
+	atomic_p_t	le_bits;
+#else
+	atomic_p_t	le_extent; /* (extent_t *) */
+	atomic_u_t	le_szind; /* (szind_t) */
+	atomic_b_t	le_slab; /* (bool) */
+#endif
+};
+
+typedef struct rtree_level_s rtree_level_t;
+struct rtree_level_s {
+	/* Number of key bits distinguished by this level. */
+	unsigned		bits;
+	/*
+	 * Cumulative number of key bits distinguished by traversing to
+	 * corresponding tree level.
+	 */
+	unsigned		cumbits;
+};
+
+typedef struct rtree_s rtree_t;
+struct rtree_s {
+	malloc_mutex_t		init_lock;
+	/* Number of elements based on rtree_levels[0].bits. */
+#if RTREE_HEIGHT > 1
+	rtree_node_elm_t	root[1U << (RTREE_NSB/RTREE_HEIGHT)];
+#else
+	rtree_leaf_elm_t	root[1U << (RTREE_NSB/RTREE_HEIGHT)];
+#endif
+};
+
+/*
+ * Split the bits into one to three partitions depending on number of
+ * significant bits.  It the number of bits does not divide evenly into the
+ * number of levels, place one remainder bit per level starting at the leaf
+ * level.
+ */
+static const rtree_level_t rtree_levels[] = {
+#if RTREE_HEIGHT == 1
+	{RTREE_NSB, RTREE_NHIB + RTREE_NSB}
+#elif RTREE_HEIGHT == 2
+	{RTREE_NSB/2, RTREE_NHIB + RTREE_NSB/2},
+	{RTREE_NSB/2 + RTREE_NSB%2, RTREE_NHIB + RTREE_NSB}
+#elif RTREE_HEIGHT == 3
+	{RTREE_NSB/3, RTREE_NHIB + RTREE_NSB/3},
+	{RTREE_NSB/3 + RTREE_NSB%3/2,
+	    RTREE_NHIB + RTREE_NSB/3*2 + RTREE_NSB%3/2},
+	{RTREE_NSB/3 + RTREE_NSB%3 - RTREE_NSB%3/2, RTREE_NHIB + RTREE_NSB}
+#else
+#  error Unsupported rtree height
+#endif
+};
+
+bool rtree_new(rtree_t *rtree, bool zeroed);
+
+typedef rtree_node_elm_t *(rtree_node_alloc_t)(tsdn_t *, rtree_t *, size_t);
+extern rtree_node_alloc_t *JET_MUTABLE rtree_node_alloc;
+
+typedef rtree_leaf_elm_t *(rtree_leaf_alloc_t)(tsdn_t *, rtree_t *, size_t);
+extern rtree_leaf_alloc_t *JET_MUTABLE rtree_leaf_alloc;
+
+typedef void (rtree_node_dalloc_t)(tsdn_t *, rtree_t *, rtree_node_elm_t *);
+extern rtree_node_dalloc_t *JET_MUTABLE rtree_node_dalloc;
+
+typedef void (rtree_leaf_dalloc_t)(tsdn_t *, rtree_t *, rtree_leaf_elm_t *);
+extern rtree_leaf_dalloc_t *JET_MUTABLE rtree_leaf_dalloc;
+#ifdef JEMALLOC_JET
+void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
+#endif
+rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
+    rtree_ctx_t *rtree_ctx, uintptr_t key, bool dependent, bool init_missing);
+
+JEMALLOC_ALWAYS_INLINE uintptr_t
+rtree_leafkey(uintptr_t key) {
+	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
+	unsigned cumbits = (rtree_levels[RTREE_HEIGHT-1].cumbits -
+	    rtree_levels[RTREE_HEIGHT-1].bits);
+	unsigned maskbits = ptrbits - cumbits;
+	uintptr_t mask = ~((ZU(1) << maskbits) - 1);
+	return (key & mask);
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+rtree_cache_direct_map(uintptr_t key) {
+	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
+	unsigned cumbits = (rtree_levels[RTREE_HEIGHT-1].cumbits -
+	    rtree_levels[RTREE_HEIGHT-1].bits);
+	unsigned maskbits = ptrbits - cumbits;
+	return (size_t)((key >> maskbits) & (RTREE_CTX_NCACHE - 1));
+}
+
+JEMALLOC_ALWAYS_INLINE uintptr_t
+rtree_subkey(uintptr_t key, unsigned level) {
+	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
+	unsigned cumbits = rtree_levels[level].cumbits;
+	unsigned shiftbits = ptrbits - cumbits;
+	unsigned maskbits = rtree_levels[level].bits;
+	uintptr_t mask = (ZU(1) << maskbits) - 1;
+	return ((key >> shiftbits) & mask);
+}
+
+/*
+ * Atomic getters.
+ *
+ * dependent: Reading a value on behalf of a pointer to a valid allocation
+ *            is guaranteed to be a clean read even without synchronization,
+ *            because the rtree update became visible in memory before the
+ *            pointer came into existence.
+ * !dependent: An arbitrary read, e.g. on behalf of ivsalloc(), may not be
+ *             dependent on a previous rtree write, which means a stale read
+ *             could result if synchronization were omitted here.
+ */
+#  ifdef RTREE_LEAF_COMPACT
+JEMALLOC_ALWAYS_INLINE uintptr_t
+rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
+    bool dependent) {
+	return (uintptr_t)atomic_load_p(&elm->le_bits, dependent
+	    ? ATOMIC_RELAXED : ATOMIC_ACQUIRE);
+}
+
+JEMALLOC_ALWAYS_INLINE extent_t *
+rtree_leaf_elm_bits_extent_get(uintptr_t bits) {
+#    ifdef __aarch64__
+	/*
+	 * aarch64 doesn't sign extend the highest virtual address bit to set
+	 * the higher ones.  Instead, the high bits gets zeroed.
+	 */
+	uintptr_t high_bit_mask = ((uintptr_t)1 << LG_VADDR) - 1;
+	/* Mask off the slab bit. */
+	uintptr_t low_bit_mask = ~(uintptr_t)1;
+	uintptr_t mask = high_bit_mask & low_bit_mask;
+	return (extent_t *)(bits & mask);
+#    else
+	/* Restore sign-extended high bits, mask slab bit. */
+	return (extent_t *)((uintptr_t)((intptr_t)(bits << RTREE_NHIB) >>
+	    RTREE_NHIB) & ~((uintptr_t)0x1));
+#    endif
+}
+
+JEMALLOC_ALWAYS_INLINE szind_t
+rtree_leaf_elm_bits_szind_get(uintptr_t bits) {
+	return (szind_t)(bits >> LG_VADDR);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+rtree_leaf_elm_bits_slab_get(uintptr_t bits) {
+	return (bool)(bits & (uintptr_t)0x1);
+}
+
+#  endif
+
+JEMALLOC_ALWAYS_INLINE extent_t *
+rtree_leaf_elm_extent_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, bool dependent) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
+	return rtree_leaf_elm_bits_extent_get(bits);
+#else
+	extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent
+	    ? ATOMIC_RELAXED : ATOMIC_ACQUIRE);
+	return extent;
+#endif
+}
+
+JEMALLOC_ALWAYS_INLINE szind_t
+rtree_leaf_elm_szind_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, bool dependent) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
+	return rtree_leaf_elm_bits_szind_get(bits);
+#else
+	return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED
+	    : ATOMIC_ACQUIRE);
+#endif
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+rtree_leaf_elm_slab_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, bool dependent) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
+	return rtree_leaf_elm_bits_slab_get(bits);
+#else
+	return atomic_load_b(&elm->le_slab, dependent ? ATOMIC_RELAXED :
+	    ATOMIC_ACQUIRE);
+#endif
+}
+
+static inline void
+rtree_leaf_elm_extent_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, extent_t *extent) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, true);
+	uintptr_t bits = ((uintptr_t)rtree_leaf_elm_bits_szind_get(old_bits) <<
+	    LG_VADDR) | ((uintptr_t)extent & (((uintptr_t)0x1 << LG_VADDR) - 1))
+	    | ((uintptr_t)rtree_leaf_elm_bits_slab_get(old_bits));
+	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
+#else
+	atomic_store_p(&elm->le_extent, extent, ATOMIC_RELEASE);
+#endif
+}
+
+static inline void
+rtree_leaf_elm_szind_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, szind_t szind) {
+	assert(szind <= NSIZES);
+
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm,
+	    true);
+	uintptr_t bits = ((uintptr_t)szind << LG_VADDR) |
+	    ((uintptr_t)rtree_leaf_elm_bits_extent_get(old_bits) &
+	    (((uintptr_t)0x1 << LG_VADDR) - 1)) |
+	    ((uintptr_t)rtree_leaf_elm_bits_slab_get(old_bits));
+	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
+#else
+	atomic_store_u(&elm->le_szind, szind, ATOMIC_RELEASE);
+#endif
+}
+
+static inline void
+rtree_leaf_elm_slab_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
+    rtree_leaf_elm_t *elm, bool slab) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm,
+	    true);
+	uintptr_t bits = ((uintptr_t)rtree_leaf_elm_bits_szind_get(old_bits) <<
+	    LG_VADDR) | ((uintptr_t)rtree_leaf_elm_bits_extent_get(old_bits) &
+	    (((uintptr_t)0x1 << LG_VADDR) - 1)) | ((uintptr_t)slab);
+	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
+#else
+	atomic_store_b(&elm->le_slab, slab, ATOMIC_RELEASE);
+#endif
+}
+
+static inline void
+rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
+    extent_t *extent, szind_t szind, bool slab) {
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t bits = ((uintptr_t)szind << LG_VADDR) |
+	    ((uintptr_t)extent & (((uintptr_t)0x1 << LG_VADDR) - 1)) |
+	    ((uintptr_t)slab);
+	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
+#else
+	rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab);
+	rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind);
+	/*
+	 * Write extent last, since the element is atomically considered valid
+	 * as soon as the extent field is non-NULL.
+	 */
+	rtree_leaf_elm_extent_write(tsdn, rtree, elm, extent);
+#endif
+}
+
+static inline void
+rtree_leaf_elm_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree,
+    rtree_leaf_elm_t *elm, szind_t szind, bool slab) {
+	assert(!slab || szind < NBINS);
+
+	/*
+	 * The caller implicitly assures that it is the only writer to the szind
+	 * and slab fields, and that the extent field cannot currently change.
+	 */
+	rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab);
+	rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind);
+}
+
+JEMALLOC_ALWAYS_INLINE rtree_leaf_elm_t *
+rtree_leaf_elm_lookup(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent, bool init_missing) {
+	assert(key != 0);
+	assert(!dependent || !init_missing);
+
+	size_t slot = rtree_cache_direct_map(key);
+	uintptr_t leafkey = rtree_leafkey(key);
+	assert(leafkey != RTREE_LEAFKEY_INVALID);
+
+	/* Fast path: L1 direct mapped cache. */
+	if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
+		rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf;
+		assert(leaf != NULL);
+		uintptr_t subkey = rtree_subkey(key, RTREE_HEIGHT-1);
+		return &leaf[subkey];
+	}
+	/*
+	 * Search the L2 LRU cache.  On hit, swap the matching element into the
+	 * slot in L1 cache, and move the position in L2 up by 1.
+	 */
+#define RTREE_CACHE_CHECK_L2(i) do {					\
+	if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) {	\
+		rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf;	\
+		assert(leaf != NULL);					\
+		if (i > 0) {						\
+			/* Bubble up by one. */				\
+			rtree_ctx->l2_cache[i].leafkey =		\
+				rtree_ctx->l2_cache[i - 1].leafkey;	\
+			rtree_ctx->l2_cache[i].leaf =			\
+				rtree_ctx->l2_cache[i - 1].leaf;	\
+			rtree_ctx->l2_cache[i - 1].leafkey =		\
+			    rtree_ctx->cache[slot].leafkey;		\
+			rtree_ctx->l2_cache[i - 1].leaf =		\
+			    rtree_ctx->cache[slot].leaf;		\
+		} else {						\
+			rtree_ctx->l2_cache[0].leafkey =		\
+			    rtree_ctx->cache[slot].leafkey;		\
+			rtree_ctx->l2_cache[0].leaf =			\
+			    rtree_ctx->cache[slot].leaf;		\
+		}							\
+		rtree_ctx->cache[slot].leafkey = leafkey;		\
+		rtree_ctx->cache[slot].leaf = leaf;			\
+		uintptr_t subkey = rtree_subkey(key, RTREE_HEIGHT-1);	\
+		return &leaf[subkey];					\
+	}								\
+} while (0)
+	/* Check the first cache entry. */
+	RTREE_CACHE_CHECK_L2(0);
+	/* Search the remaining cache elements. */
+	for (unsigned i = 1; i < RTREE_CTX_NCACHE_L2; i++) {
+		RTREE_CACHE_CHECK_L2(i);
+	}
+#undef RTREE_CACHE_CHECK_L2
+
+	return rtree_leaf_elm_lookup_hard(tsdn, rtree, rtree_ctx, key,
+	    dependent, init_missing);
+}
+
+static inline bool
+rtree_write(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx, uintptr_t key,
+    extent_t *extent, szind_t szind, bool slab) {
+	/* Use rtree_clear() to set the extent to NULL. */
+	assert(extent != NULL);
+
+	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx,
+	    key, false, true);
+	if (elm == NULL) {
+		return true;
+	}
+
+	assert(rtree_leaf_elm_extent_read(tsdn, rtree, elm, false) == NULL);
+	rtree_leaf_elm_write(tsdn, rtree, elm, extent, szind, slab);
+
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE rtree_leaf_elm_t *
+rtree_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx, uintptr_t key,
+    bool dependent) {
+	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx,
+	    key, dependent, false);
+	if (!dependent && elm == NULL) {
+		return NULL;
+	}
+	assert(elm != NULL);
+	return elm;
+}
+
+JEMALLOC_ALWAYS_INLINE extent_t *
+rtree_extent_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent) {
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
+	    dependent);
+	if (!dependent && elm == NULL) {
+		return NULL;
+	}
+	return rtree_leaf_elm_extent_read(tsdn, rtree, elm, dependent);
+}
+
+JEMALLOC_ALWAYS_INLINE szind_t
+rtree_szind_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent) {
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
+	    dependent);
+	if (!dependent && elm == NULL) {
+		return NSIZES;
+	}
+	return rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
+}
+
+/*
+ * rtree_slab_read() is intentionally omitted because slab is always read in
+ * conjunction with szind, which makes rtree_szind_slab_read() a better choice.
+ */
+
+JEMALLOC_ALWAYS_INLINE bool
+rtree_extent_szind_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent, extent_t **r_extent, szind_t *r_szind) {
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
+	    dependent);
+	if (!dependent && elm == NULL) {
+		return true;
+	}
+	*r_extent = rtree_leaf_elm_extent_read(tsdn, rtree, elm, dependent);
+	*r_szind = rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+rtree_szind_slab_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent, szind_t *r_szind, bool *r_slab) {
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
+	    dependent);
+	if (!dependent && elm == NULL) {
+		return true;
+	}
+#ifdef RTREE_LEAF_COMPACT
+	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
+	*r_szind = rtree_leaf_elm_bits_szind_get(bits);
+	*r_slab = rtree_leaf_elm_bits_slab_get(bits);
+#else
+	*r_szind = rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
+	*r_slab = rtree_leaf_elm_slab_read(tsdn, rtree, elm, dependent);
+#endif
+	return false;
+}
+
+static inline void
+rtree_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, szind_t szind, bool slab) {
+	assert(!slab || szind < NBINS);
+
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true);
+	rtree_leaf_elm_szind_slab_update(tsdn, rtree, elm, szind, slab);
+}
+
+static inline void
+rtree_clear(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key) {
+	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true);
+	assert(rtree_leaf_elm_extent_read(tsdn, rtree, elm, false) !=
+	    NULL);
+	rtree_leaf_elm_write(tsdn, rtree, elm, NULL, NSIZES, false);
+}
+
+#endif /* JEMALLOC_INTERNAL_RTREE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
new file mode 100644
index 00000000..93a75173
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
@@ -0,0 +1,50 @@
+#ifndef JEMALLOC_INTERNAL_RTREE_CTX_H
+#define JEMALLOC_INTERNAL_RTREE_CTX_H
+
+/*
+ * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively.  Each
+ * entry supports an entire leaf, so the cache hit rate is typically high even
+ * with a small number of entries.  In rare cases extent activity will straddle
+ * the boundary between two leaf nodes.  Furthermore, an arena may use a
+ * combination of dss and mmap.  Note that as memory usage grows past the amount
+ * that this cache can directly cover, the cache will become less effective if
+ * locality of reference is low, but the consequence is merely cache misses
+ * while traversing the tree nodes.
+ *
+ * The L1 direct mapped cache offers consistent and low cost on cache hit.
+ * However collision could affect hit rate negatively.  This is resolved by
+ * combining with a L2 LRU cache, which requires linear search and re-ordering
+ * on access but suffers no collision.  Note that, the cache will itself suffer
+ * cache misses if made overly large, plus the cost of linear search in the LRU
+ * cache.
+ */
+#define RTREE_CTX_LG_NCACHE 4
+#define RTREE_CTX_NCACHE (1 << RTREE_CTX_LG_NCACHE)
+#define RTREE_CTX_NCACHE_L2 8
+
+/*
+ * Zero initializer required for tsd initialization only.  Proper initialization
+ * done via rtree_ctx_data_init().
+ */
+#define RTREE_CTX_ZERO_INITIALIZER {{{0}}, {{0}}}
+
+
+typedef struct rtree_leaf_elm_s rtree_leaf_elm_t;
+
+typedef struct rtree_ctx_cache_elm_s rtree_ctx_cache_elm_t;
+struct rtree_ctx_cache_elm_s {
+	uintptr_t		leafkey;
+	rtree_leaf_elm_t	*leaf;
+};
+
+typedef struct rtree_ctx_s rtree_ctx_t;
+struct rtree_ctx_s {
+	/* Direct mapped cache. */
+	rtree_ctx_cache_elm_t	cache[RTREE_CTX_NCACHE];
+	/* L2 LRU cache. */
+	rtree_ctx_cache_elm_t	l2_cache[RTREE_CTX_NCACHE_L2];
+};
+
+void rtree_ctx_data_init(rtree_ctx_t *ctx);
+
+#endif /* JEMALLOC_INTERNAL_RTREE_CTX_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
new file mode 100755
index 00000000..998994d0
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
@@ -0,0 +1,361 @@
+#!/bin/sh
+#
+# Usage: size_classes.sh <lg_qarr> <lg_tmin> <lg_parr> <lg_g>
+
+# The following limits are chosen such that they cover all supported platforms.
+
+# Pointer sizes.
+lg_zarr="2 3"
+
+# Quanta.
+lg_qarr=$1
+
+# The range of tiny size classes is [2^lg_tmin..2^(lg_q-1)].
+lg_tmin=$2
+
+# Maximum lookup size.
+lg_kmax=12
+
+# Page sizes.
+lg_parr=`echo $3 | tr ',' ' '`
+
+# Size class group size (number of size classes for each size doubling).
+lg_g=$4
+
+pow2() {
+  e=$1
+  pow2_result=1
+  while [ ${e} -gt 0 ] ; do
+    pow2_result=$((${pow2_result} + ${pow2_result}))
+    e=$((${e} - 1))
+  done
+}
+
+lg() {
+  x=$1
+  lg_result=0
+  while [ ${x} -gt 1 ] ; do
+    lg_result=$((${lg_result} + 1))
+    x=$((${x} / 2))
+  done
+}
+
+lg_ceil() {
+  y=$1
+  lg ${y}; lg_floor=${lg_result}
+  pow2 ${lg_floor}; pow2_floor=${pow2_result}
+  if [ ${pow2_floor} -lt ${y} ] ; then
+    lg_ceil_result=$((${lg_floor} + 1))
+  else
+    lg_ceil_result=${lg_floor}
+  fi
+}
+
+reg_size_compute() {
+  lg_grp=$1
+  lg_delta=$2
+  ndelta=$3
+
+  pow2 ${lg_grp}; grp=${pow2_result}
+  pow2 ${lg_delta}; delta=${pow2_result}
+  reg_size=$((${grp} + ${delta}*${ndelta}))
+}
+
+slab_size() {
+  lg_p=$1
+  lg_grp=$2
+  lg_delta=$3
+  ndelta=$4
+
+  pow2 ${lg_p}; p=${pow2_result}
+  reg_size_compute ${lg_grp} ${lg_delta} ${ndelta}
+
+  # Compute smallest slab size that is an integer multiple of reg_size.
+  try_slab_size=${p}
+  try_nregs=$((${try_slab_size} / ${reg_size}))
+  perfect=0
+  while [ ${perfect} -eq 0 ] ; do
+    perfect_slab_size=${try_slab_size}
+    perfect_nregs=${try_nregs}
+
+    try_slab_size=$((${try_slab_size} + ${p}))
+    try_nregs=$((${try_slab_size} / ${reg_size}))
+    if [ ${perfect_slab_size} -eq $((${perfect_nregs} * ${reg_size})) ] ; then
+      perfect=1
+    fi
+  done
+
+  slab_size_pgs=$((${perfect_slab_size} / ${p}))
+}
+
+size_class() {
+  index=$1
+  lg_grp=$2
+  lg_delta=$3
+  ndelta=$4
+  lg_p=$5
+  lg_kmax=$6
+
+  if [ ${lg_delta} -ge ${lg_p} ] ; then
+    psz="yes"
+  else
+    pow2 ${lg_p}; p=${pow2_result}
+    pow2 ${lg_grp}; grp=${pow2_result}
+    pow2 ${lg_delta}; delta=${pow2_result}
+    sz=$((${grp} + ${delta} * ${ndelta}))
+    npgs=$((${sz} / ${p}))
+    if [ ${sz} -eq $((${npgs} * ${p})) ] ; then
+      psz="yes"
+    else
+      psz="no"
+    fi
+  fi
+
+  lg ${ndelta}; lg_ndelta=${lg_result}; pow2 ${lg_ndelta}
+  if [ ${pow2_result} -lt ${ndelta} ] ; then
+    rem="yes"
+  else
+    rem="no"
+  fi
+
+  lg_size=${lg_grp}
+  if [ $((${lg_delta} + ${lg_ndelta})) -eq ${lg_grp} ] ; then
+    lg_size=$((${lg_grp} + 1))
+  else
+    lg_size=${lg_grp}
+    rem="yes"
+  fi
+
+  if [ ${lg_size} -lt $((${lg_p} + ${lg_g})) ] ; then
+    bin="yes"
+    slab_size ${lg_p} ${lg_grp} ${lg_delta} ${ndelta}; pgs=${slab_size_pgs}
+  else
+    bin="no"
+    pgs=0
+  fi
+  if [ ${lg_size} -lt ${lg_kmax} \
+      -o ${lg_size} -eq ${lg_kmax} -a ${rem} = "no" ] ; then
+    lg_delta_lookup=${lg_delta}
+  else
+    lg_delta_lookup="no"
+  fi
+  printf '    SC(%3d, %6d, %8d, %6d, %3s, %3s, %3d, %2s) \\\n' ${index} ${lg_grp} ${lg_delta} ${ndelta} ${psz} ${bin} ${pgs} ${lg_delta_lookup}
+  # Defined upon return:
+  # - psz ("yes" or "no")
+  # - bin ("yes" or "no")
+  # - pgs
+  # - lg_delta_lookup (${lg_delta} or "no")
+}
+
+sep_line() {
+  echo "                                                         \\"
+}
+
+size_classes() {
+  lg_z=$1
+  lg_q=$2
+  lg_t=$3
+  lg_p=$4
+  lg_g=$5
+
+  pow2 $((${lg_z} + 3)); ptr_bits=${pow2_result}
+  pow2 ${lg_g}; g=${pow2_result}
+
+  echo "#define SIZE_CLASSES \\"
+  echo "  /* index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup */ \\"
+
+  ntbins=0
+  nlbins=0
+  lg_tiny_maxclass='"NA"'
+  nbins=0
+  npsizes=0
+
+  # Tiny size classes.
+  ndelta=0
+  index=0
+  lg_grp=${lg_t}
+  lg_delta=${lg_grp}
+  while [ ${lg_grp} -lt ${lg_q} ] ; do
+    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
+    if [ ${lg_delta_lookup} != "no" ] ; then
+      nlbins=$((${index} + 1))
+    fi
+    if [ ${psz} = "yes" ] ; then
+      npsizes=$((${npsizes} + 1))
+    fi
+    if [ ${bin} != "no" ] ; then
+      nbins=$((${index} + 1))
+    fi
+    ntbins=$((${ntbins} + 1))
+    lg_tiny_maxclass=${lg_grp} # Final written value is correct.
+    index=$((${index} + 1))
+    lg_delta=${lg_grp}
+    lg_grp=$((${lg_grp} + 1))
+  done
+
+  # First non-tiny group.
+  if [ ${ntbins} -gt 0 ] ; then
+    sep_line
+    # The first size class has an unusual encoding, because the size has to be
+    # split between grp and delta*ndelta.
+    lg_grp=$((${lg_grp} - 1))
+    ndelta=1
+    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
+    index=$((${index} + 1))
+    lg_grp=$((${lg_grp} + 1))
+    lg_delta=$((${lg_delta} + 1))
+    if [ ${psz} = "yes" ] ; then
+      npsizes=$((${npsizes} + 1))
+    fi
+  fi
+  while [ ${ndelta} -lt ${g} ] ; do
+    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
+    index=$((${index} + 1))
+    ndelta=$((${ndelta} + 1))
+    if [ ${psz} = "yes" ] ; then
+      npsizes=$((${npsizes} + 1))
+    fi
+  done
+
+  # All remaining groups.
+  lg_grp=$((${lg_grp} + ${lg_g}))
+  while [ ${lg_grp} -lt $((${ptr_bits} - 1)) ] ; do
+    sep_line
+    ndelta=1
+    if [ ${lg_grp} -eq $((${ptr_bits} - 2)) ] ; then
+      ndelta_limit=$((${g} - 1))
+    else
+      ndelta_limit=${g}
+    fi
+    while [ ${ndelta} -le ${ndelta_limit} ] ; do
+      size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
+      if [ ${lg_delta_lookup} != "no" ] ; then
+        nlbins=$((${index} + 1))
+        # Final written value is correct:
+        lookup_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
+      fi
+      if [ ${psz} = "yes" ] ; then
+        npsizes=$((${npsizes} + 1))
+      fi
+      if [ ${bin} != "no" ] ; then
+        nbins=$((${index} + 1))
+        # Final written value is correct:
+        small_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
+        if [ ${lg_g} -gt 0 ] ; then
+          lg_large_minclass=$((${lg_grp} + 1))
+        else
+          lg_large_minclass=$((${lg_grp} + 2))
+        fi
+      fi
+      # Final written value is correct:
+      large_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
+      index=$((${index} + 1))
+      ndelta=$((${ndelta} + 1))
+    done
+    lg_grp=$((${lg_grp} + 1))
+    lg_delta=$((${lg_delta} + 1))
+  done
+  echo
+  nsizes=${index}
+  lg_ceil ${nsizes}; lg_ceil_nsizes=${lg_ceil_result}
+
+  # Defined upon completion:
+  # - ntbins
+  # - nlbins
+  # - nbins
+  # - nsizes
+  # - lg_ceil_nsizes
+  # - npsizes
+  # - lg_tiny_maxclass
+  # - lookup_maxclass
+  # - small_maxclass
+  # - lg_large_minclass
+  # - large_maxclass
+}
+
+cat <<EOF
+#ifndef JEMALLOC_INTERNAL_SIZE_CLASSES_H
+#define JEMALLOC_INTERNAL_SIZE_CLASSES_H
+
+/* This file was automatically generated by size_classes.sh. */
+
+#include "jemalloc/internal/jemalloc_internal_types.h"
+
+/*
+ * This header file defines:
+ *
+ *   LG_SIZE_CLASS_GROUP: Lg of size class count for each size doubling.
+ *   LG_TINY_MIN: Lg of minimum size class to support.
+ *   SIZE_CLASSES: Complete table of SC(index, lg_grp, lg_delta, ndelta, psz,
+ *                 bin, pgs, lg_delta_lookup) tuples.
+ *     index: Size class index.
+ *     lg_grp: Lg group base size (no deltas added).
+ *     lg_delta: Lg delta to previous size class.
+ *     ndelta: Delta multiplier.  size == 1<<lg_grp + ndelta<<lg_delta
+ *     psz: 'yes' if a multiple of the page size, 'no' otherwise.
+ *     bin: 'yes' if a small bin size class, 'no' otherwise.
+ *     pgs: Slab page count if a small bin size class, 0 otherwise.
+ *     lg_delta_lookup: Same as lg_delta if a lookup table size class, 'no'
+ *                      otherwise.
+ *   NTBINS: Number of tiny bins.
+ *   NLBINS: Number of bins supported by the lookup table.
+ *   NBINS: Number of small size class bins.
+ *   NSIZES: Number of size classes.
+ *   LG_CEIL_NSIZES: Number of bits required to store NSIZES.
+ *   NPSIZES: Number of size classes that are a multiple of (1U << LG_PAGE).
+ *   LG_TINY_MAXCLASS: Lg of maximum tiny size class.
+ *   LOOKUP_MAXCLASS: Maximum size class included in lookup table.
+ *   SMALL_MAXCLASS: Maximum small size class.
+ *   LG_LARGE_MINCLASS: Lg of minimum large size class.
+ *   LARGE_MAXCLASS: Maximum (large) size class.
+ */
+
+#define LG_SIZE_CLASS_GROUP	${lg_g}
+#define LG_TINY_MIN		${lg_tmin}
+
+EOF
+
+for lg_z in ${lg_zarr} ; do
+  for lg_q in ${lg_qarr} ; do
+    lg_t=${lg_tmin}
+    while [ ${lg_t} -le ${lg_q} ] ; do
+      # Iterate through page sizes and compute how many bins there are.
+      for lg_p in ${lg_parr} ; do
+        echo "#if (LG_SIZEOF_PTR == ${lg_z} && LG_TINY_MIN == ${lg_t} && LG_QUANTUM == ${lg_q} && LG_PAGE == ${lg_p})"
+        size_classes ${lg_z} ${lg_q} ${lg_t} ${lg_p} ${lg_g}
+        echo "#define SIZE_CLASSES_DEFINED"
+        echo "#define NTBINS			${ntbins}"
+        echo "#define NLBINS			${nlbins}"
+        echo "#define NBINS			${nbins}"
+        echo "#define NSIZES			${nsizes}"
+        echo "#define LG_CEIL_NSIZES		${lg_ceil_nsizes}"
+        echo "#define NPSIZES			${npsizes}"
+        echo "#define LG_TINY_MAXCLASS	${lg_tiny_maxclass}"
+        echo "#define LOOKUP_MAXCLASS		${lookup_maxclass}"
+        echo "#define SMALL_MAXCLASS		${small_maxclass}"
+        echo "#define LG_LARGE_MINCLASS	${lg_large_minclass}"
+        echo "#define LARGE_MINCLASS		(ZU(1) << LG_LARGE_MINCLASS)"
+        echo "#define LARGE_MAXCLASS		${large_maxclass}"
+        echo "#endif"
+        echo
+      done
+      lg_t=$((${lg_t} + 1))
+    done
+  done
+done
+
+cat <<EOF
+#ifndef SIZE_CLASSES_DEFINED
+#  error "No size class definitions match configuration"
+#endif
+#undef SIZE_CLASSES_DEFINED
+/*
+ * The size2index_tab lookup table uses uint8_t to encode each bin index, so we
+ * cannot support more than 256 small size classes.
+ */
+#if (NBINS > 256)
+#  error "Too many small size classes"
+#endif
+
+#endif /* JEMALLOC_INTERNAL_SIZE_CLASSES_H */
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
new file mode 100644
index 00000000..2e14430f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
@@ -0,0 +1,232 @@
+#ifndef JEMALLOC_INTERNAL_SMOOTHSTEP_H
+#define JEMALLOC_INTERNAL_SMOOTHSTEP_H
+
+/*
+ * This file was generated by the following command:
+ *   sh smoothstep.sh smoother 200 24 3 15
+ */
+/******************************************************************************/
+
+/*
+ * This header defines a precomputed table based on the smoothstep family of
+ * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
+ * to 1 in 0 <= x <= 1.  The table is stored as integer fixed point values so
+ * that floating point math can be avoided.
+ *
+ *                      3     2
+ *   smoothstep(x) = -2x  + 3x
+ *
+ *                       5      4      3
+ *   smootherstep(x) = 6x  - 15x  + 10x
+ *
+ *                          7      6      5      4
+ *   smootheststep(x) = -20x  + 70x  - 84x  + 35x
+ */
+
+#define SMOOTHSTEP_VARIANT	"smoother"
+#define SMOOTHSTEP_NSTEPS	200
+#define SMOOTHSTEP_BFP		24
+#define SMOOTHSTEP \
+ /* STEP(step, h,                            x,     y) */ \
+    STEP(   1, UINT64_C(0x0000000000000014), 0.005, 0.000001240643750) \
+    STEP(   2, UINT64_C(0x00000000000000a5), 0.010, 0.000009850600000) \
+    STEP(   3, UINT64_C(0x0000000000000229), 0.015, 0.000032995181250) \
+    STEP(   4, UINT64_C(0x0000000000000516), 0.020, 0.000077619200000) \
+    STEP(   5, UINT64_C(0x00000000000009dc), 0.025, 0.000150449218750) \
+    STEP(   6, UINT64_C(0x00000000000010e8), 0.030, 0.000257995800000) \
+    STEP(   7, UINT64_C(0x0000000000001aa4), 0.035, 0.000406555756250) \
+    STEP(   8, UINT64_C(0x0000000000002777), 0.040, 0.000602214400000) \
+    STEP(   9, UINT64_C(0x00000000000037c2), 0.045, 0.000850847793750) \
+    STEP(  10, UINT64_C(0x0000000000004be6), 0.050, 0.001158125000000) \
+    STEP(  11, UINT64_C(0x000000000000643c), 0.055, 0.001529510331250) \
+    STEP(  12, UINT64_C(0x000000000000811f), 0.060, 0.001970265600000) \
+    STEP(  13, UINT64_C(0x000000000000a2e2), 0.065, 0.002485452368750) \
+    STEP(  14, UINT64_C(0x000000000000c9d8), 0.070, 0.003079934200000) \
+    STEP(  15, UINT64_C(0x000000000000f64f), 0.075, 0.003758378906250) \
+    STEP(  16, UINT64_C(0x0000000000012891), 0.080, 0.004525260800000) \
+    STEP(  17, UINT64_C(0x00000000000160e7), 0.085, 0.005384862943750) \
+    STEP(  18, UINT64_C(0x0000000000019f95), 0.090, 0.006341279400000) \
+    STEP(  19, UINT64_C(0x000000000001e4dc), 0.095, 0.007398417481250) \
+    STEP(  20, UINT64_C(0x00000000000230fc), 0.100, 0.008560000000000) \
+    STEP(  21, UINT64_C(0x0000000000028430), 0.105, 0.009829567518750) \
+    STEP(  22, UINT64_C(0x000000000002deb0), 0.110, 0.011210480600000) \
+    STEP(  23, UINT64_C(0x00000000000340b1), 0.115, 0.012705922056250) \
+    STEP(  24, UINT64_C(0x000000000003aa67), 0.120, 0.014318899200000) \
+    STEP(  25, UINT64_C(0x0000000000041c00), 0.125, 0.016052246093750) \
+    STEP(  26, UINT64_C(0x00000000000495a8), 0.130, 0.017908625800000) \
+    STEP(  27, UINT64_C(0x000000000005178b), 0.135, 0.019890532631250) \
+    STEP(  28, UINT64_C(0x000000000005a1cf), 0.140, 0.022000294400000) \
+    STEP(  29, UINT64_C(0x0000000000063498), 0.145, 0.024240074668750) \
+    STEP(  30, UINT64_C(0x000000000006d009), 0.150, 0.026611875000000) \
+    STEP(  31, UINT64_C(0x000000000007743f), 0.155, 0.029117537206250) \
+    STEP(  32, UINT64_C(0x0000000000082157), 0.160, 0.031758745600000) \
+    STEP(  33, UINT64_C(0x000000000008d76b), 0.165, 0.034537029243750) \
+    STEP(  34, UINT64_C(0x0000000000099691), 0.170, 0.037453764200000) \
+    STEP(  35, UINT64_C(0x00000000000a5edf), 0.175, 0.040510175781250) \
+    STEP(  36, UINT64_C(0x00000000000b3067), 0.180, 0.043707340800000) \
+    STEP(  37, UINT64_C(0x00000000000c0b38), 0.185, 0.047046189818750) \
+    STEP(  38, UINT64_C(0x00000000000cef5e), 0.190, 0.050527509400000) \
+    STEP(  39, UINT64_C(0x00000000000ddce6), 0.195, 0.054151944356250) \
+    STEP(  40, UINT64_C(0x00000000000ed3d8), 0.200, 0.057920000000000) \
+    STEP(  41, UINT64_C(0x00000000000fd439), 0.205, 0.061832044393750) \
+    STEP(  42, UINT64_C(0x000000000010de0e), 0.210, 0.065888310600000) \
+    STEP(  43, UINT64_C(0x000000000011f158), 0.215, 0.070088898931250) \
+    STEP(  44, UINT64_C(0x0000000000130e17), 0.220, 0.074433779200000) \
+    STEP(  45, UINT64_C(0x0000000000143448), 0.225, 0.078922792968750) \
+    STEP(  46, UINT64_C(0x00000000001563e7), 0.230, 0.083555655800000) \
+    STEP(  47, UINT64_C(0x0000000000169cec), 0.235, 0.088331959506250) \
+    STEP(  48, UINT64_C(0x000000000017df4f), 0.240, 0.093251174400000) \
+    STEP(  49, UINT64_C(0x0000000000192b04), 0.245, 0.098312651543750) \
+    STEP(  50, UINT64_C(0x00000000001a8000), 0.250, 0.103515625000000) \
+    STEP(  51, UINT64_C(0x00000000001bde32), 0.255, 0.108859214081250) \
+    STEP(  52, UINT64_C(0x00000000001d458b), 0.260, 0.114342425600000) \
+    STEP(  53, UINT64_C(0x00000000001eb5f8), 0.265, 0.119964156118750) \
+    STEP(  54, UINT64_C(0x0000000000202f65), 0.270, 0.125723194200000) \
+    STEP(  55, UINT64_C(0x000000000021b1bb), 0.275, 0.131618222656250) \
+    STEP(  56, UINT64_C(0x0000000000233ce3), 0.280, 0.137647820800000) \
+    STEP(  57, UINT64_C(0x000000000024d0c3), 0.285, 0.143810466693750) \
+    STEP(  58, UINT64_C(0x0000000000266d40), 0.290, 0.150104539400000) \
+    STEP(  59, UINT64_C(0x000000000028123d), 0.295, 0.156528321231250) \
+    STEP(  60, UINT64_C(0x000000000029bf9c), 0.300, 0.163080000000000) \
+    STEP(  61, UINT64_C(0x00000000002b753d), 0.305, 0.169757671268750) \
+    STEP(  62, UINT64_C(0x00000000002d32fe), 0.310, 0.176559340600000) \
+    STEP(  63, UINT64_C(0x00000000002ef8bc), 0.315, 0.183482925806250) \
+    STEP(  64, UINT64_C(0x000000000030c654), 0.320, 0.190526259200000) \
+    STEP(  65, UINT64_C(0x0000000000329b9f), 0.325, 0.197687089843750) \
+    STEP(  66, UINT64_C(0x0000000000347875), 0.330, 0.204963085800000) \
+    STEP(  67, UINT64_C(0x0000000000365cb0), 0.335, 0.212351836381250) \
+    STEP(  68, UINT64_C(0x0000000000384825), 0.340, 0.219850854400000) \
+    STEP(  69, UINT64_C(0x00000000003a3aa8), 0.345, 0.227457578418750) \
+    STEP(  70, UINT64_C(0x00000000003c340f), 0.350, 0.235169375000000) \
+    STEP(  71, UINT64_C(0x00000000003e342b), 0.355, 0.242983540956250) \
+    STEP(  72, UINT64_C(0x0000000000403ace), 0.360, 0.250897305600000) \
+    STEP(  73, UINT64_C(0x00000000004247c8), 0.365, 0.258907832993750) \
+    STEP(  74, UINT64_C(0x0000000000445ae9), 0.370, 0.267012224200000) \
+    STEP(  75, UINT64_C(0x0000000000467400), 0.375, 0.275207519531250) \
+    STEP(  76, UINT64_C(0x00000000004892d8), 0.380, 0.283490700800000) \
+    STEP(  77, UINT64_C(0x00000000004ab740), 0.385, 0.291858693568750) \
+    STEP(  78, UINT64_C(0x00000000004ce102), 0.390, 0.300308369400000) \
+    STEP(  79, UINT64_C(0x00000000004f0fe9), 0.395, 0.308836548106250) \
+    STEP(  80, UINT64_C(0x00000000005143bf), 0.400, 0.317440000000000) \
+    STEP(  81, UINT64_C(0x0000000000537c4d), 0.405, 0.326115448143750) \
+    STEP(  82, UINT64_C(0x000000000055b95b), 0.410, 0.334859570600000) \
+    STEP(  83, UINT64_C(0x000000000057fab1), 0.415, 0.343669002681250) \
+    STEP(  84, UINT64_C(0x00000000005a4015), 0.420, 0.352540339200000) \
+    STEP(  85, UINT64_C(0x00000000005c894e), 0.425, 0.361470136718750) \
+    STEP(  86, UINT64_C(0x00000000005ed622), 0.430, 0.370454915800000) \
+    STEP(  87, UINT64_C(0x0000000000612655), 0.435, 0.379491163256250) \
+    STEP(  88, UINT64_C(0x00000000006379ac), 0.440, 0.388575334400000) \
+    STEP(  89, UINT64_C(0x000000000065cfeb), 0.445, 0.397703855293750) \
+    STEP(  90, UINT64_C(0x00000000006828d6), 0.450, 0.406873125000000) \
+    STEP(  91, UINT64_C(0x00000000006a842f), 0.455, 0.416079517831250) \
+    STEP(  92, UINT64_C(0x00000000006ce1bb), 0.460, 0.425319385600000) \
+    STEP(  93, UINT64_C(0x00000000006f413a), 0.465, 0.434589059868750) \
+    STEP(  94, UINT64_C(0x000000000071a270), 0.470, 0.443884854200000) \
+    STEP(  95, UINT64_C(0x000000000074051d), 0.475, 0.453203066406250) \
+    STEP(  96, UINT64_C(0x0000000000766905), 0.480, 0.462539980800000) \
+    STEP(  97, UINT64_C(0x000000000078cde7), 0.485, 0.471891870443750) \
+    STEP(  98, UINT64_C(0x00000000007b3387), 0.490, 0.481254999400000) \
+    STEP(  99, UINT64_C(0x00000000007d99a4), 0.495, 0.490625624981250) \
+    STEP( 100, UINT64_C(0x0000000000800000), 0.500, 0.500000000000000) \
+    STEP( 101, UINT64_C(0x000000000082665b), 0.505, 0.509374375018750) \
+    STEP( 102, UINT64_C(0x000000000084cc78), 0.510, 0.518745000600000) \
+    STEP( 103, UINT64_C(0x0000000000873218), 0.515, 0.528108129556250) \
+    STEP( 104, UINT64_C(0x00000000008996fa), 0.520, 0.537460019200000) \
+    STEP( 105, UINT64_C(0x00000000008bfae2), 0.525, 0.546796933593750) \
+    STEP( 106, UINT64_C(0x00000000008e5d8f), 0.530, 0.556115145800000) \
+    STEP( 107, UINT64_C(0x000000000090bec5), 0.535, 0.565410940131250) \
+    STEP( 108, UINT64_C(0x0000000000931e44), 0.540, 0.574680614400000) \
+    STEP( 109, UINT64_C(0x0000000000957bd0), 0.545, 0.583920482168750) \
+    STEP( 110, UINT64_C(0x000000000097d729), 0.550, 0.593126875000000) \
+    STEP( 111, UINT64_C(0x00000000009a3014), 0.555, 0.602296144706250) \
+    STEP( 112, UINT64_C(0x00000000009c8653), 0.560, 0.611424665600000) \
+    STEP( 113, UINT64_C(0x00000000009ed9aa), 0.565, 0.620508836743750) \
+    STEP( 114, UINT64_C(0x0000000000a129dd), 0.570, 0.629545084200000) \
+    STEP( 115, UINT64_C(0x0000000000a376b1), 0.575, 0.638529863281250) \
+    STEP( 116, UINT64_C(0x0000000000a5bfea), 0.580, 0.647459660800000) \
+    STEP( 117, UINT64_C(0x0000000000a8054e), 0.585, 0.656330997318750) \
+    STEP( 118, UINT64_C(0x0000000000aa46a4), 0.590, 0.665140429400000) \
+    STEP( 119, UINT64_C(0x0000000000ac83b2), 0.595, 0.673884551856250) \
+    STEP( 120, UINT64_C(0x0000000000aebc40), 0.600, 0.682560000000000) \
+    STEP( 121, UINT64_C(0x0000000000b0f016), 0.605, 0.691163451893750) \
+    STEP( 122, UINT64_C(0x0000000000b31efd), 0.610, 0.699691630600000) \
+    STEP( 123, UINT64_C(0x0000000000b548bf), 0.615, 0.708141306431250) \
+    STEP( 124, UINT64_C(0x0000000000b76d27), 0.620, 0.716509299200000) \
+    STEP( 125, UINT64_C(0x0000000000b98c00), 0.625, 0.724792480468750) \
+    STEP( 126, UINT64_C(0x0000000000bba516), 0.630, 0.732987775800000) \
+    STEP( 127, UINT64_C(0x0000000000bdb837), 0.635, 0.741092167006250) \
+    STEP( 128, UINT64_C(0x0000000000bfc531), 0.640, 0.749102694400000) \
+    STEP( 129, UINT64_C(0x0000000000c1cbd4), 0.645, 0.757016459043750) \
+    STEP( 130, UINT64_C(0x0000000000c3cbf0), 0.650, 0.764830625000000) \
+    STEP( 131, UINT64_C(0x0000000000c5c557), 0.655, 0.772542421581250) \
+    STEP( 132, UINT64_C(0x0000000000c7b7da), 0.660, 0.780149145600000) \
+    STEP( 133, UINT64_C(0x0000000000c9a34f), 0.665, 0.787648163618750) \
+    STEP( 134, UINT64_C(0x0000000000cb878a), 0.670, 0.795036914200000) \
+    STEP( 135, UINT64_C(0x0000000000cd6460), 0.675, 0.802312910156250) \
+    STEP( 136, UINT64_C(0x0000000000cf39ab), 0.680, 0.809473740800000) \
+    STEP( 137, UINT64_C(0x0000000000d10743), 0.685, 0.816517074193750) \
+    STEP( 138, UINT64_C(0x0000000000d2cd01), 0.690, 0.823440659400000) \
+    STEP( 139, UINT64_C(0x0000000000d48ac2), 0.695, 0.830242328731250) \
+    STEP( 140, UINT64_C(0x0000000000d64063), 0.700, 0.836920000000000) \
+    STEP( 141, UINT64_C(0x0000000000d7edc2), 0.705, 0.843471678768750) \
+    STEP( 142, UINT64_C(0x0000000000d992bf), 0.710, 0.849895460600000) \
+    STEP( 143, UINT64_C(0x0000000000db2f3c), 0.715, 0.856189533306250) \
+    STEP( 144, UINT64_C(0x0000000000dcc31c), 0.720, 0.862352179200000) \
+    STEP( 145, UINT64_C(0x0000000000de4e44), 0.725, 0.868381777343750) \
+    STEP( 146, UINT64_C(0x0000000000dfd09a), 0.730, 0.874276805800000) \
+    STEP( 147, UINT64_C(0x0000000000e14a07), 0.735, 0.880035843881250) \
+    STEP( 148, UINT64_C(0x0000000000e2ba74), 0.740, 0.885657574400000) \
+    STEP( 149, UINT64_C(0x0000000000e421cd), 0.745, 0.891140785918750) \
+    STEP( 150, UINT64_C(0x0000000000e58000), 0.750, 0.896484375000000) \
+    STEP( 151, UINT64_C(0x0000000000e6d4fb), 0.755, 0.901687348456250) \
+    STEP( 152, UINT64_C(0x0000000000e820b0), 0.760, 0.906748825600000) \
+    STEP( 153, UINT64_C(0x0000000000e96313), 0.765, 0.911668040493750) \
+    STEP( 154, UINT64_C(0x0000000000ea9c18), 0.770, 0.916444344200000) \
+    STEP( 155, UINT64_C(0x0000000000ebcbb7), 0.775, 0.921077207031250) \
+    STEP( 156, UINT64_C(0x0000000000ecf1e8), 0.780, 0.925566220800000) \
+    STEP( 157, UINT64_C(0x0000000000ee0ea7), 0.785, 0.929911101068750) \
+    STEP( 158, UINT64_C(0x0000000000ef21f1), 0.790, 0.934111689400000) \
+    STEP( 159, UINT64_C(0x0000000000f02bc6), 0.795, 0.938167955606250) \
+    STEP( 160, UINT64_C(0x0000000000f12c27), 0.800, 0.942080000000000) \
+    STEP( 161, UINT64_C(0x0000000000f22319), 0.805, 0.945848055643750) \
+    STEP( 162, UINT64_C(0x0000000000f310a1), 0.810, 0.949472490600000) \
+    STEP( 163, UINT64_C(0x0000000000f3f4c7), 0.815, 0.952953810181250) \
+    STEP( 164, UINT64_C(0x0000000000f4cf98), 0.820, 0.956292659200000) \
+    STEP( 165, UINT64_C(0x0000000000f5a120), 0.825, 0.959489824218750) \
+    STEP( 166, UINT64_C(0x0000000000f6696e), 0.830, 0.962546235800000) \
+    STEP( 167, UINT64_C(0x0000000000f72894), 0.835, 0.965462970756250) \
+    STEP( 168, UINT64_C(0x0000000000f7dea8), 0.840, 0.968241254400000) \
+    STEP( 169, UINT64_C(0x0000000000f88bc0), 0.845, 0.970882462793750) \
+    STEP( 170, UINT64_C(0x0000000000f92ff6), 0.850, 0.973388125000000) \
+    STEP( 171, UINT64_C(0x0000000000f9cb67), 0.855, 0.975759925331250) \
+    STEP( 172, UINT64_C(0x0000000000fa5e30), 0.860, 0.977999705600000) \
+    STEP( 173, UINT64_C(0x0000000000fae874), 0.865, 0.980109467368750) \
+    STEP( 174, UINT64_C(0x0000000000fb6a57), 0.870, 0.982091374200000) \
+    STEP( 175, UINT64_C(0x0000000000fbe400), 0.875, 0.983947753906250) \
+    STEP( 176, UINT64_C(0x0000000000fc5598), 0.880, 0.985681100800000) \
+    STEP( 177, UINT64_C(0x0000000000fcbf4e), 0.885, 0.987294077943750) \
+    STEP( 178, UINT64_C(0x0000000000fd214f), 0.890, 0.988789519400000) \
+    STEP( 179, UINT64_C(0x0000000000fd7bcf), 0.895, 0.990170432481250) \
+    STEP( 180, UINT64_C(0x0000000000fdcf03), 0.900, 0.991440000000000) \
+    STEP( 181, UINT64_C(0x0000000000fe1b23), 0.905, 0.992601582518750) \
+    STEP( 182, UINT64_C(0x0000000000fe606a), 0.910, 0.993658720600000) \
+    STEP( 183, UINT64_C(0x0000000000fe9f18), 0.915, 0.994615137056250) \
+    STEP( 184, UINT64_C(0x0000000000fed76e), 0.920, 0.995474739200000) \
+    STEP( 185, UINT64_C(0x0000000000ff09b0), 0.925, 0.996241621093750) \
+    STEP( 186, UINT64_C(0x0000000000ff3627), 0.930, 0.996920065800000) \
+    STEP( 187, UINT64_C(0x0000000000ff5d1d), 0.935, 0.997514547631250) \
+    STEP( 188, UINT64_C(0x0000000000ff7ee0), 0.940, 0.998029734400000) \
+    STEP( 189, UINT64_C(0x0000000000ff9bc3), 0.945, 0.998470489668750) \
+    STEP( 190, UINT64_C(0x0000000000ffb419), 0.950, 0.998841875000000) \
+    STEP( 191, UINT64_C(0x0000000000ffc83d), 0.955, 0.999149152206250) \
+    STEP( 192, UINT64_C(0x0000000000ffd888), 0.960, 0.999397785600000) \
+    STEP( 193, UINT64_C(0x0000000000ffe55b), 0.965, 0.999593444243750) \
+    STEP( 194, UINT64_C(0x0000000000ffef17), 0.970, 0.999742004200000) \
+    STEP( 195, UINT64_C(0x0000000000fff623), 0.975, 0.999849550781250) \
+    STEP( 196, UINT64_C(0x0000000000fffae9), 0.980, 0.999922380800000) \
+    STEP( 197, UINT64_C(0x0000000000fffdd6), 0.985, 0.999967004818750) \
+    STEP( 198, UINT64_C(0x0000000000ffff5a), 0.990, 0.999990149400000) \
+    STEP( 199, UINT64_C(0x0000000000ffffeb), 0.995, 0.999998759356250) \
+    STEP( 200, UINT64_C(0x0000000001000000), 1.000, 1.000000000000000) \
+
+#endif /* JEMALLOC_INTERNAL_SMOOTHSTEP_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
new file mode 100755
index 00000000..65de97bf
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
@@ -0,0 +1,101 @@
+#!/bin/sh
+#
+# Generate a discrete lookup table for a sigmoid function in the smoothstep
+# family (https://en.wikipedia.org/wiki/Smoothstep), where the lookup table
+# entries correspond to x in [1/nsteps, 2/nsteps, ..., nsteps/nsteps].  Encode
+# the entries using a binary fixed point representation.
+#
+# Usage: smoothstep.sh <variant> <nsteps> <bfp> <xprec> <yprec>
+#
+#        <variant> is in {smooth, smoother, smoothest}.
+#        <nsteps> must be greater than zero.
+#        <bfp> must be in [0..62]; reasonable values are roughly [10..30].
+#        <xprec> is x decimal precision.
+#        <yprec> is y decimal precision.
+
+#set -x
+
+cmd="sh smoothstep.sh $*"
+variant=$1
+nsteps=$2
+bfp=$3
+xprec=$4
+yprec=$5
+
+case "${variant}" in
+  smooth)
+    ;;
+  smoother)
+    ;;
+  smoothest)
+    ;;
+  *)
+    echo "Unsupported variant"
+    exit 1
+    ;;
+esac
+
+smooth() {
+  step=$1
+  y=`echo ${yprec} k ${step} ${nsteps} / sx _2 lx 3 ^ '*' 3 lx 2 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
+  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
+}
+
+smoother() {
+  step=$1
+  y=`echo ${yprec} k ${step} ${nsteps} / sx 6 lx 5 ^ '*' _15 lx 4 ^ '*' + 10 lx 3 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
+  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
+}
+
+smoothest() {
+  step=$1
+  y=`echo ${yprec} k ${step} ${nsteps} / sx _20 lx 7 ^ '*' 70 lx 6 ^ '*' + _84 lx 5 ^ '*' + 35 lx 4 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
+  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
+}
+
+cat <<EOF
+#ifndef JEMALLOC_INTERNAL_SMOOTHSTEP_H
+#define JEMALLOC_INTERNAL_SMOOTHSTEP_H
+
+/*
+ * This file was generated by the following command:
+ *   $cmd
+ */
+/******************************************************************************/
+
+/*
+ * This header defines a precomputed table based on the smoothstep family of
+ * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
+ * to 1 in 0 <= x <= 1.  The table is stored as integer fixed point values so
+ * that floating point math can be avoided.
+ *
+ *                      3     2
+ *   smoothstep(x) = -2x  + 3x
+ *
+ *                       5      4      3
+ *   smootherstep(x) = 6x  - 15x  + 10x
+ *
+ *                          7      6      5      4
+ *   smootheststep(x) = -20x  + 70x  - 84x  + 35x
+ */
+
+#define SMOOTHSTEP_VARIANT	"${variant}"
+#define SMOOTHSTEP_NSTEPS	${nsteps}
+#define SMOOTHSTEP_BFP		${bfp}
+#define SMOOTHSTEP \\
+ /* STEP(step, h,                            x,     y) */ \\
+EOF
+
+s=1
+while [ $s -le $nsteps ] ; do
+  $variant ${s}
+  x=`echo ${xprec} k ${s} ${nsteps} / p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
+  printf '    STEP(%4d, UINT64_C(0x%016x), %s, %s) \\\n' ${s} ${h} ${x} ${y}
+
+  s=$((s+1))
+done
+echo
+
+cat <<EOF
+#endif /* JEMALLOC_INTERNAL_SMOOTHSTEP_H */
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
new file mode 100644
index 00000000..22804c68
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
@@ -0,0 +1,40 @@
+#ifndef JEMALLOC_INTERNAL_SPIN_H
+#define JEMALLOC_INTERNAL_SPIN_H
+
+#define SPIN_INITIALIZER {0U}
+
+typedef struct {
+	unsigned iteration;
+} spin_t;
+
+static inline void
+spin_cpu_spinwait() {
+#  if HAVE_CPU_SPINWAIT
+	CPU_SPINWAIT;
+#  else
+	volatile int x = 0;
+	x = x;
+#  endif
+}
+
+static inline void
+spin_adaptive(spin_t *spin) {
+	volatile uint32_t i;
+
+	if (spin->iteration < 5) {
+		for (i = 0; i < (1U << spin->iteration); i++) {
+			spin_cpu_spinwait();
+		}
+		spin->iteration++;
+	} else {
+#ifdef _WIN32
+		SwitchToThread();
+#else
+		sched_yield();
+#endif
+	}
+}
+
+#undef SPIN_INLINE
+
+#endif /* JEMALLOC_INTERNAL_SPIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
new file mode 100644
index 00000000..852e3426
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
@@ -0,0 +1,30 @@
+#ifndef JEMALLOC_INTERNAL_STATS_H
+#define JEMALLOC_INTERNAL_STATS_H
+
+/*  OPTION(opt,		var_name,	default,	set_value_to) */
+#define STATS_PRINT_OPTIONS						\
+    OPTION('J',		json,		false,		true)		\
+    OPTION('g',		general,	true,		false)		\
+    OPTION('m',		merged,		config_stats,	false)		\
+    OPTION('d',		destroyed,	config_stats,	false)		\
+    OPTION('a',		unmerged,	config_stats,	false)		\
+    OPTION('b',		bins,		true,		false)		\
+    OPTION('l',		large,		true,		false)		\
+    OPTION('x',		mutex,		true,		false)
+
+enum {
+#define OPTION(o, v, d, s) stats_print_option_num_##v,
+    STATS_PRINT_OPTIONS
+#undef OPTION
+    stats_print_tot_num_options
+};
+
+/* Options for stats_print. */
+extern bool opt_stats_print;
+extern char opt_stats_print_opts[stats_print_tot_num_options+1];
+
+/* Implements je_malloc_stats_print. */
+void stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *opts);
+
+#endif /* JEMALLOC_INTERNAL_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
new file mode 100644
index 00000000..97946289
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
@@ -0,0 +1,317 @@
+#ifndef JEMALLOC_INTERNAL_SIZE_H
+#define JEMALLOC_INTERNAL_SIZE_H
+
+#include "jemalloc/internal/bit_util.h"
+#include "jemalloc/internal/pages.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/util.h"
+
+/*
+ * sz module: Size computations.
+ *
+ * Some abbreviations used here:
+ *   p: Page
+ *   ind: Index
+ *   s, sz: Size
+ *   u: Usable size
+ *   a: Aligned
+ *
+ * These are not always used completely consistently, but should be enough to
+ * interpret function names.  E.g. sz_psz2ind converts page size to page size
+ * index; sz_sa2u converts a (size, alignment) allocation request to the usable
+ * size that would result from such an allocation.
+ */
+
+/*
+ * sz_pind2sz_tab encodes the same information as could be computed by
+ * sz_pind2sz_compute().
+ */
+extern size_t const sz_pind2sz_tab[NPSIZES+1];
+/*
+ * sz_index2size_tab encodes the same information as could be computed (at
+ * unacceptable cost in some code paths) by sz_index2size_compute().
+ */
+extern size_t const sz_index2size_tab[NSIZES];
+/*
+ * sz_size2index_tab is a compact lookup table that rounds request sizes up to
+ * size classes.  In order to reduce cache footprint, the table is compressed,
+ * and all accesses are via sz_size2index().
+ */
+extern uint8_t const sz_size2index_tab[];
+
+static const size_t sz_large_pad =
+#ifdef JEMALLOC_CACHE_OBLIVIOUS
+    PAGE
+#else
+    0
+#endif
+    ;
+
+JEMALLOC_ALWAYS_INLINE pszind_t
+sz_psz2ind(size_t psz) {
+	if (unlikely(psz > LARGE_MAXCLASS)) {
+		return NPSIZES;
+	}
+	{
+		pszind_t x = lg_floor((psz<<1)-1);
+		pszind_t shift = (x < LG_SIZE_CLASS_GROUP + LG_PAGE) ? 0 : x -
+		    (LG_SIZE_CLASS_GROUP + LG_PAGE);
+		pszind_t grp = shift << LG_SIZE_CLASS_GROUP;
+
+		pszind_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_PAGE + 1) ?
+		    LG_PAGE : x - LG_SIZE_CLASS_GROUP - 1;
+
+		size_t delta_inverse_mask = ZU(-1) << lg_delta;
+		pszind_t mod = ((((psz-1) & delta_inverse_mask) >> lg_delta)) &
+		    ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
+
+		pszind_t ind = grp + mod;
+		return ind;
+	}
+}
+
+static inline size_t
+sz_pind2sz_compute(pszind_t pind) {
+	if (unlikely(pind == NPSIZES)) {
+		return LARGE_MAXCLASS + PAGE;
+	}
+	{
+		size_t grp = pind >> LG_SIZE_CLASS_GROUP;
+		size_t mod = pind & ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
+
+		size_t grp_size_mask = ~((!!grp)-1);
+		size_t grp_size = ((ZU(1) << (LG_PAGE +
+		    (LG_SIZE_CLASS_GROUP-1))) << grp) & grp_size_mask;
+
+		size_t shift = (grp == 0) ? 1 : grp;
+		size_t lg_delta = shift + (LG_PAGE-1);
+		size_t mod_size = (mod+1) << lg_delta;
+
+		size_t sz = grp_size + mod_size;
+		return sz;
+	}
+}
+
+static inline size_t
+sz_pind2sz_lookup(pszind_t pind) {
+	size_t ret = (size_t)sz_pind2sz_tab[pind];
+	assert(ret == sz_pind2sz_compute(pind));
+	return ret;
+}
+
+static inline size_t
+sz_pind2sz(pszind_t pind) {
+	assert(pind < NPSIZES+1);
+	return sz_pind2sz_lookup(pind);
+}
+
+static inline size_t
+sz_psz2u(size_t psz) {
+	if (unlikely(psz > LARGE_MAXCLASS)) {
+		return LARGE_MAXCLASS + PAGE;
+	}
+	{
+		size_t x = lg_floor((psz<<1)-1);
+		size_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_PAGE + 1) ?
+		    LG_PAGE : x - LG_SIZE_CLASS_GROUP - 1;
+		size_t delta = ZU(1) << lg_delta;
+		size_t delta_mask = delta - 1;
+		size_t usize = (psz + delta_mask) & ~delta_mask;
+		return usize;
+	}
+}
+
+static inline szind_t
+sz_size2index_compute(size_t size) {
+	if (unlikely(size > LARGE_MAXCLASS)) {
+		return NSIZES;
+	}
+#if (NTBINS != 0)
+	if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
+		szind_t lg_tmin = LG_TINY_MAXCLASS - NTBINS + 1;
+		szind_t lg_ceil = lg_floor(pow2_ceil_zu(size));
+		return (lg_ceil < lg_tmin ? 0 : lg_ceil - lg_tmin);
+	}
+#endif
+	{
+		szind_t x = lg_floor((size<<1)-1);
+		szind_t shift = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM) ? 0 :
+		    x - (LG_SIZE_CLASS_GROUP + LG_QUANTUM);
+		szind_t grp = shift << LG_SIZE_CLASS_GROUP;
+
+		szind_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM + 1)
+		    ? LG_QUANTUM : x - LG_SIZE_CLASS_GROUP - 1;
+
+		size_t delta_inverse_mask = ZU(-1) << lg_delta;
+		szind_t mod = ((((size-1) & delta_inverse_mask) >> lg_delta)) &
+		    ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
+
+		szind_t index = NTBINS + grp + mod;
+		return index;
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE szind_t
+sz_size2index_lookup(size_t size) {
+	assert(size <= LOOKUP_MAXCLASS);
+	{
+		szind_t ret = (sz_size2index_tab[(size-1) >> LG_TINY_MIN]);
+		assert(ret == sz_size2index_compute(size));
+		return ret;
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE szind_t
+sz_size2index(size_t size) {
+	assert(size > 0);
+	if (likely(size <= LOOKUP_MAXCLASS)) {
+		return sz_size2index_lookup(size);
+	}
+	return sz_size2index_compute(size);
+}
+
+static inline size_t
+sz_index2size_compute(szind_t index) {
+#if (NTBINS > 0)
+	if (index < NTBINS) {
+		return (ZU(1) << (LG_TINY_MAXCLASS - NTBINS + 1 + index));
+	}
+#endif
+	{
+		size_t reduced_index = index - NTBINS;
+		size_t grp = reduced_index >> LG_SIZE_CLASS_GROUP;
+		size_t mod = reduced_index & ((ZU(1) << LG_SIZE_CLASS_GROUP) -
+		    1);
+
+		size_t grp_size_mask = ~((!!grp)-1);
+		size_t grp_size = ((ZU(1) << (LG_QUANTUM +
+		    (LG_SIZE_CLASS_GROUP-1))) << grp) & grp_size_mask;
+
+		size_t shift = (grp == 0) ? 1 : grp;
+		size_t lg_delta = shift + (LG_QUANTUM-1);
+		size_t mod_size = (mod+1) << lg_delta;
+
+		size_t usize = grp_size + mod_size;
+		return usize;
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+sz_index2size_lookup(szind_t index) {
+	size_t ret = (size_t)sz_index2size_tab[index];
+	assert(ret == sz_index2size_compute(index));
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+sz_index2size(szind_t index) {
+	assert(index < NSIZES);
+	return sz_index2size_lookup(index);
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+sz_s2u_compute(size_t size) {
+	if (unlikely(size > LARGE_MAXCLASS)) {
+		return 0;
+	}
+#if (NTBINS > 0)
+	if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
+		size_t lg_tmin = LG_TINY_MAXCLASS - NTBINS + 1;
+		size_t lg_ceil = lg_floor(pow2_ceil_zu(size));
+		return (lg_ceil < lg_tmin ? (ZU(1) << lg_tmin) :
+		    (ZU(1) << lg_ceil));
+	}
+#endif
+	{
+		size_t x = lg_floor((size<<1)-1);
+		size_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM + 1)
+		    ?  LG_QUANTUM : x - LG_SIZE_CLASS_GROUP - 1;
+		size_t delta = ZU(1) << lg_delta;
+		size_t delta_mask = delta - 1;
+		size_t usize = (size + delta_mask) & ~delta_mask;
+		return usize;
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+sz_s2u_lookup(size_t size) {
+	size_t ret = sz_index2size_lookup(sz_size2index_lookup(size));
+
+	assert(ret == sz_s2u_compute(size));
+	return ret;
+}
+
+/*
+ * Compute usable size that would result from allocating an object with the
+ * specified size.
+ */
+JEMALLOC_ALWAYS_INLINE size_t
+sz_s2u(size_t size) {
+	assert(size > 0);
+	if (likely(size <= LOOKUP_MAXCLASS)) {
+		return sz_s2u_lookup(size);
+	}
+	return sz_s2u_compute(size);
+}
+
+/*
+ * Compute usable size that would result from allocating an object with the
+ * specified size and alignment.
+ */
+JEMALLOC_ALWAYS_INLINE size_t
+sz_sa2u(size_t size, size_t alignment) {
+	size_t usize;
+
+	assert(alignment != 0 && ((alignment - 1) & alignment) == 0);
+
+	/* Try for a small size class. */
+	if (size <= SMALL_MAXCLASS && alignment < PAGE) {
+		/*
+		 * Round size up to the nearest multiple of alignment.
+		 *
+		 * This done, we can take advantage of the fact that for each
+		 * small size class, every object is aligned at the smallest
+		 * power of two that is non-zero in the base two representation
+		 * of the size.  For example:
+		 *
+		 *   Size |   Base 2 | Minimum alignment
+		 *   -----+----------+------------------
+		 *     96 |  1100000 |  32
+		 *    144 | 10100000 |  32
+		 *    192 | 11000000 |  64
+		 */
+		usize = sz_s2u(ALIGNMENT_CEILING(size, alignment));
+		if (usize < LARGE_MINCLASS) {
+			return usize;
+		}
+	}
+
+	/* Large size class.  Beware of overflow. */
+
+	if (unlikely(alignment > LARGE_MAXCLASS)) {
+		return 0;
+	}
+
+	/* Make sure result is a large size class. */
+	if (size <= LARGE_MINCLASS) {
+		usize = LARGE_MINCLASS;
+	} else {
+		usize = sz_s2u(size);
+		if (usize < size) {
+			/* size_t overflow. */
+			return 0;
+		}
+	}
+
+	/*
+	 * Calculate the multi-page mapping that large_palloc() would need in
+	 * order to guarantee the alignment.
+	 */
+	if (usize + sz_large_pad + PAGE_CEILING(alignment) - PAGE < usize) {
+		/* size_t overflow. */
+		return 0;
+	}
+	return usize;
+}
+
+#endif /* JEMALLOC_INTERNAL_SIZE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
new file mode 100644
index 00000000..790367bd
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
@@ -0,0 +1,55 @@
+#ifndef JEMALLOC_INTERNAL_TCACHE_EXTERNS_H
+#define JEMALLOC_INTERNAL_TCACHE_EXTERNS_H
+
+#include "jemalloc/internal/size_classes.h"
+
+extern bool	opt_tcache;
+extern ssize_t	opt_lg_tcache_max;
+
+extern cache_bin_info_t	*tcache_bin_info;
+
+/*
+ * Number of tcache bins.  There are NBINS small-object bins, plus 0 or more
+ * large-object bins.
+ */
+extern unsigned	nhbins;
+
+/* Maximum cached size class. */
+extern size_t	tcache_maxclass;
+
+/*
+ * Explicit tcaches, managed via the tcache.{create,flush,destroy} mallctls and
+ * usable via the MALLOCX_TCACHE() flag.  The automatic per thread tcaches are
+ * completely disjoint from this data structure.  tcaches starts off as a sparse
+ * array, so it has no physical memory footprint until individual pages are
+ * touched.  This allows the entire array to be allocated the first time an
+ * explicit tcache is created without a disproportionate impact on memory usage.
+ */
+extern tcaches_t	*tcaches;
+
+size_t	tcache_salloc(tsdn_t *tsdn, const void *ptr);
+void	tcache_event_hard(tsd_t *tsd, tcache_t *tcache);
+void	*tcache_alloc_small_hard(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
+    cache_bin_t *tbin, szind_t binind, bool *tcache_success);
+void	tcache_bin_flush_small(tsd_t *tsd, tcache_t *tcache, cache_bin_t *tbin,
+    szind_t binind, unsigned rem);
+void	tcache_bin_flush_large(tsd_t *tsd, cache_bin_t *tbin, szind_t binind,
+    unsigned rem, tcache_t *tcache);
+void	tcache_arena_reassociate(tsdn_t *tsdn, tcache_t *tcache,
+    arena_t *arena);
+tcache_t *tcache_create_explicit(tsd_t *tsd);
+void	tcache_cleanup(tsd_t *tsd);
+void	tcache_stats_merge(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena);
+bool	tcaches_create(tsd_t *tsd, unsigned *r_ind);
+void	tcaches_flush(tsd_t *tsd, unsigned ind);
+void	tcaches_destroy(tsd_t *tsd, unsigned ind);
+bool	tcache_boot(tsdn_t *tsdn);
+void tcache_arena_associate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena);
+void tcache_prefork(tsdn_t *tsdn);
+void tcache_postfork_parent(tsdn_t *tsdn);
+void tcache_postfork_child(tsdn_t *tsdn);
+void tcache_flush(tsd_t *tsd);
+bool tsd_tcache_data_init(tsd_t *tsd);
+bool tsd_tcache_enabled_data_init(tsd_t *tsd);
+
+#endif /* JEMALLOC_INTERNAL_TCACHE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
new file mode 100644
index 00000000..0f6ab8cb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
@@ -0,0 +1,223 @@
+#ifndef JEMALLOC_INTERNAL_TCACHE_INLINES_H
+#define JEMALLOC_INTERNAL_TCACHE_INLINES_H
+
+#include "jemalloc/internal/bin.h"
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/sz.h"
+#include "jemalloc/internal/ticker.h"
+#include "jemalloc/internal/util.h"
+
+static inline bool
+tcache_enabled_get(tsd_t *tsd) {
+	return tsd_tcache_enabled_get(tsd);
+}
+
+static inline void
+tcache_enabled_set(tsd_t *tsd, bool enabled) {
+	bool was_enabled = tsd_tcache_enabled_get(tsd);
+
+	if (!was_enabled && enabled) {
+		tsd_tcache_data_init(tsd);
+	} else if (was_enabled && !enabled) {
+		tcache_cleanup(tsd);
+	}
+	/* Commit the state last.  Above calls check current state. */
+	tsd_tcache_enabled_set(tsd, enabled);
+	tsd_slow_update(tsd);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tcache_event(tsd_t *tsd, tcache_t *tcache) {
+	if (TCACHE_GC_INCR == 0) {
+		return;
+	}
+
+	if (unlikely(ticker_tick(&tcache->gc_ticker))) {
+		tcache_event_hard(tsd, tcache);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+tcache_alloc_small(tsd_t *tsd, arena_t *arena, tcache_t *tcache,
+    UNUSED size_t size, szind_t binind, bool zero, bool slow_path) {
+	void *ret;
+	cache_bin_t *bin;
+	bool tcache_success;
+	size_t usize JEMALLOC_CC_SILENCE_INIT(0);
+
+	assert(binind < NBINS);
+	bin = tcache_small_bin_get(tcache, binind);
+	ret = cache_bin_alloc_easy(bin, &tcache_success);
+	assert(tcache_success == (ret != NULL));
+	if (unlikely(!tcache_success)) {
+		bool tcache_hard_success;
+		arena = arena_choose(tsd, arena);
+		if (unlikely(arena == NULL)) {
+			return NULL;
+		}
+
+		ret = tcache_alloc_small_hard(tsd_tsdn(tsd), arena, tcache,
+		    bin, binind, &tcache_hard_success);
+		if (tcache_hard_success == false) {
+			return NULL;
+		}
+	}
+
+	assert(ret);
+	/*
+	 * Only compute usize if required.  The checks in the following if
+	 * statement are all static.
+	 */
+	if (config_prof || (slow_path && config_fill) || unlikely(zero)) {
+		usize = sz_index2size(binind);
+		assert(tcache_salloc(tsd_tsdn(tsd), ret) == usize);
+	}
+
+	if (likely(!zero)) {
+		if (slow_path && config_fill) {
+			if (unlikely(opt_junk_alloc)) {
+				arena_alloc_junk_small(ret, &bin_infos[binind],
+				    false);
+			} else if (unlikely(opt_zero)) {
+				memset(ret, 0, usize);
+			}
+		}
+	} else {
+		if (slow_path && config_fill && unlikely(opt_junk_alloc)) {
+			arena_alloc_junk_small(ret, &bin_infos[binind], true);
+		}
+		memset(ret, 0, usize);
+	}
+
+	if (config_stats) {
+		bin->tstats.nrequests++;
+	}
+	if (config_prof) {
+		tcache->prof_accumbytes += usize;
+	}
+	tcache_event(tsd, tcache);
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+tcache_alloc_large(tsd_t *tsd, arena_t *arena, tcache_t *tcache, size_t size,
+    szind_t binind, bool zero, bool slow_path) {
+	void *ret;
+	cache_bin_t *bin;
+	bool tcache_success;
+
+	assert(binind >= NBINS &&binind < nhbins);
+	bin = tcache_large_bin_get(tcache, binind);
+	ret = cache_bin_alloc_easy(bin, &tcache_success);
+	assert(tcache_success == (ret != NULL));
+	if (unlikely(!tcache_success)) {
+		/*
+		 * Only allocate one large object at a time, because it's quite
+		 * expensive to create one and not use it.
+		 */
+		arena = arena_choose(tsd, arena);
+		if (unlikely(arena == NULL)) {
+			return NULL;
+		}
+
+		ret = large_malloc(tsd_tsdn(tsd), arena, sz_s2u(size), zero);
+		if (ret == NULL) {
+			return NULL;
+		}
+	} else {
+		size_t usize JEMALLOC_CC_SILENCE_INIT(0);
+
+		/* Only compute usize on demand */
+		if (config_prof || (slow_path && config_fill) ||
+		    unlikely(zero)) {
+			usize = sz_index2size(binind);
+			assert(usize <= tcache_maxclass);
+		}
+
+		if (likely(!zero)) {
+			if (slow_path && config_fill) {
+				if (unlikely(opt_junk_alloc)) {
+					memset(ret, JEMALLOC_ALLOC_JUNK,
+					    usize);
+				} else if (unlikely(opt_zero)) {
+					memset(ret, 0, usize);
+				}
+			}
+		} else {
+			memset(ret, 0, usize);
+		}
+
+		if (config_stats) {
+			bin->tstats.nrequests++;
+		}
+		if (config_prof) {
+			tcache->prof_accumbytes += usize;
+		}
+	}
+
+	tcache_event(tsd, tcache);
+	return ret;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tcache_dalloc_small(tsd_t *tsd, tcache_t *tcache, void *ptr, szind_t binind,
+    bool slow_path) {
+	cache_bin_t *bin;
+	cache_bin_info_t *bin_info;
+
+	assert(tcache_salloc(tsd_tsdn(tsd), ptr) <= SMALL_MAXCLASS);
+
+	if (slow_path && config_fill && unlikely(opt_junk_free)) {
+		arena_dalloc_junk_small(ptr, &bin_infos[binind]);
+	}
+
+	bin = tcache_small_bin_get(tcache, binind);
+	bin_info = &tcache_bin_info[binind];
+	if (unlikely(bin->ncached == bin_info->ncached_max)) {
+		tcache_bin_flush_small(tsd, tcache, bin, binind,
+		    (bin_info->ncached_max >> 1));
+	}
+	assert(bin->ncached < bin_info->ncached_max);
+	bin->ncached++;
+	*(bin->avail - bin->ncached) = ptr;
+
+	tcache_event(tsd, tcache);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tcache_dalloc_large(tsd_t *tsd, tcache_t *tcache, void *ptr, szind_t binind,
+    bool slow_path) {
+	cache_bin_t *bin;
+	cache_bin_info_t *bin_info;
+
+	assert(tcache_salloc(tsd_tsdn(tsd), ptr) > SMALL_MAXCLASS);
+	assert(tcache_salloc(tsd_tsdn(tsd), ptr) <= tcache_maxclass);
+
+	if (slow_path && config_fill && unlikely(opt_junk_free)) {
+		large_dalloc_junk(ptr, sz_index2size(binind));
+	}
+
+	bin = tcache_large_bin_get(tcache, binind);
+	bin_info = &tcache_bin_info[binind];
+	if (unlikely(bin->ncached == bin_info->ncached_max)) {
+		tcache_bin_flush_large(tsd, bin, binind,
+		    (bin_info->ncached_max >> 1), tcache);
+	}
+	assert(bin->ncached < bin_info->ncached_max);
+	bin->ncached++;
+	*(bin->avail - bin->ncached) = ptr;
+
+	tcache_event(tsd, tcache);
+}
+
+JEMALLOC_ALWAYS_INLINE tcache_t *
+tcaches_get(tsd_t *tsd, unsigned ind) {
+	tcaches_t *elm = &tcaches[ind];
+	if (unlikely(elm->tcache == NULL)) {
+		elm->tcache = tcache_create_explicit(tsd);
+	}
+	return elm->tcache;
+}
+
+#endif /* JEMALLOC_INTERNAL_TCACHE_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
new file mode 100644
index 00000000..07b73870
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
@@ -0,0 +1,61 @@
+#ifndef JEMALLOC_INTERNAL_TCACHE_STRUCTS_H
+#define JEMALLOC_INTERNAL_TCACHE_STRUCTS_H
+
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/cache_bin.h"
+#include "jemalloc/internal/ticker.h"
+
+struct tcache_s {
+	/*
+	 * To minimize our cache-footprint, we put the frequently accessed data
+	 * together at the start of this struct.
+	 */
+
+	/* Cleared after arena_prof_accum(). */
+	uint64_t	prof_accumbytes;
+	/* Drives incremental GC. */
+	ticker_t	gc_ticker;
+	/*
+	 * The pointer stacks associated with bins follow as a contiguous array.
+	 * During tcache initialization, the avail pointer in each element of
+	 * tbins is initialized to point to the proper offset within this array.
+	 */
+	cache_bin_t	bins_small[NBINS];
+
+	/*
+	 * This data is less hot; we can be a little less careful with our
+	 * footprint here.
+	 */
+	/* Lets us track all the tcaches in an arena. */
+	ql_elm(tcache_t) link;
+	/*
+	 * The descriptor lets the arena find our cache bins without seeing the
+	 * tcache definition.  This enables arenas to aggregate stats across
+	 * tcaches without having a tcache dependency.
+	 */
+	cache_bin_array_descriptor_t cache_bin_array_descriptor;
+
+	/* The arena this tcache is associated with. */
+	arena_t		*arena;
+	/* Next bin to GC. */
+	szind_t		next_gc_bin;
+	/* For small bins, fill (ncached_max >> lg_fill_div). */
+	uint8_t		lg_fill_div[NBINS];
+	/*
+	 * We put the cache bins for large size classes at the end of the
+	 * struct, since some of them might not get used.  This might end up
+	 * letting us avoid touching an extra page if we don't have to.
+	 */
+	cache_bin_t	bins_large[NSIZES-NBINS];
+};
+
+/* Linkage for list of available (previously used) explicit tcache IDs. */
+struct tcaches_s {
+	union {
+		tcache_t	*tcache;
+		tcaches_t	*next;
+	};
+};
+
+#endif /* JEMALLOC_INTERNAL_TCACHE_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
new file mode 100644
index 00000000..e49bc9d7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
@@ -0,0 +1,56 @@
+#ifndef JEMALLOC_INTERNAL_TCACHE_TYPES_H
+#define JEMALLOC_INTERNAL_TCACHE_TYPES_H
+
+#include "jemalloc/internal/size_classes.h"
+
+typedef struct tcache_s tcache_t;
+typedef struct tcaches_s tcaches_t;
+
+/*
+ * tcache pointers close to NULL are used to encode state information that is
+ * used for two purposes: preventing thread caching on a per thread basis and
+ * cleaning up during thread shutdown.
+ */
+#define TCACHE_STATE_DISABLED		((tcache_t *)(uintptr_t)1)
+#define TCACHE_STATE_REINCARNATED	((tcache_t *)(uintptr_t)2)
+#define TCACHE_STATE_PURGATORY		((tcache_t *)(uintptr_t)3)
+#define TCACHE_STATE_MAX		TCACHE_STATE_PURGATORY
+
+/*
+ * Absolute minimum number of cache slots for each small bin.
+ */
+#define TCACHE_NSLOTS_SMALL_MIN		20
+
+/*
+ * Absolute maximum number of cache slots for each small bin in the thread
+ * cache.  This is an additional constraint beyond that imposed as: twice the
+ * number of regions per slab for this size class.
+ *
+ * This constant must be an even number.
+ */
+#define TCACHE_NSLOTS_SMALL_MAX		200
+
+/* Number of cache slots for large size classes. */
+#define TCACHE_NSLOTS_LARGE		20
+
+/* (1U << opt_lg_tcache_max) is used to compute tcache_maxclass. */
+#define LG_TCACHE_MAXCLASS_DEFAULT	15
+
+/*
+ * TCACHE_GC_SWEEP is the approximate number of allocation events between
+ * full GC sweeps.  Integer rounding may cause the actual number to be
+ * slightly higher, since GC is performed incrementally.
+ */
+#define TCACHE_GC_SWEEP			8192
+
+/* Number of tcache allocation/deallocation events between incremental GCs. */
+#define TCACHE_GC_INCR							\
+    ((TCACHE_GC_SWEEP / NBINS) + ((TCACHE_GC_SWEEP / NBINS == 0) ? 0 : 1))
+
+/* Used in TSD static initializer only. Real init in tcache_data_init(). */
+#define TCACHE_ZERO_INITIALIZER {0}
+
+/* Used in TSD static initializer only. Will be initialized to opt_tcache. */
+#define TCACHE_ENABLED_ZERO_INITIALIZER false
+
+#endif /* JEMALLOC_INTERNAL_TCACHE_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
new file mode 100644
index 00000000..4b360470
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
@@ -0,0 +1,78 @@
+#ifndef JEMALLOC_INTERNAL_TICKER_H
+#define JEMALLOC_INTERNAL_TICKER_H
+
+#include "jemalloc/internal/util.h"
+
+/**
+ * A ticker makes it easy to count-down events until some limit.  You
+ * ticker_init the ticker to trigger every nticks events.  You then notify it
+ * that an event has occurred with calls to ticker_tick (or that nticks events
+ * have occurred with a call to ticker_ticks), which will return true (and reset
+ * the counter) if the countdown hit zero.
+ */
+
+typedef struct {
+	int32_t tick;
+	int32_t nticks;
+} ticker_t;
+
+static inline void
+ticker_init(ticker_t *ticker, int32_t nticks) {
+	ticker->tick = nticks;
+	ticker->nticks = nticks;
+}
+
+static inline void
+ticker_copy(ticker_t *ticker, const ticker_t *other) {
+	*ticker = *other;
+}
+
+static inline int32_t
+ticker_read(const ticker_t *ticker) {
+	return ticker->tick;
+}
+
+/*
+ * Not intended to be a public API.  Unfortunately, on x86, neither gcc nor
+ * clang seems smart enough to turn
+ *   ticker->tick -= nticks;
+ *   if (unlikely(ticker->tick < 0)) {
+ *     fixup ticker
+ *     return true;
+ *   }
+ *   return false;
+ * into
+ *   subq %nticks_reg, (%ticker_reg)
+ *   js fixup ticker
+ *
+ * unless we force "fixup ticker" out of line.  In that case, gcc gets it right,
+ * but clang now does worse than before.  So, on x86 with gcc, we force it out
+ * of line, but otherwise let the inlining occur.  Ordinarily this wouldn't be
+ * worth the hassle, but this is on the fast path of both malloc and free (via
+ * tcache_event).
+ */
+#if defined(__GNUC__) && !defined(__clang__)				\
+    && (defined(__x86_64__) || defined(__i386__))
+JEMALLOC_NOINLINE
+#endif
+static bool
+ticker_fixup(ticker_t *ticker) {
+	ticker->tick = ticker->nticks;
+	return true;
+}
+
+static inline bool
+ticker_ticks(ticker_t *ticker, int32_t nticks) {
+	ticker->tick -= nticks;
+	if (unlikely(ticker->tick < 0)) {
+		return ticker_fixup(ticker);
+	}
+	return false;
+}
+
+static inline bool
+ticker_tick(ticker_t *ticker) {
+	return ticker_ticks(ticker, 1);
+}
+
+#endif /* JEMALLOC_INTERNAL_TICKER_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
new file mode 100644
index 00000000..0b9841aa
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
@@ -0,0 +1,326 @@
+#ifndef JEMALLOC_INTERNAL_TSD_H
+#define JEMALLOC_INTERNAL_TSD_H
+
+#include "jemalloc/internal/arena_types.h"
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/jemalloc_internal_externs.h"
+#include "jemalloc/internal/prof_types.h"
+#include "jemalloc/internal/ql.h"
+#include "jemalloc/internal/rtree_tsd.h"
+#include "jemalloc/internal/tcache_types.h"
+#include "jemalloc/internal/tcache_structs.h"
+#include "jemalloc/internal/util.h"
+#include "jemalloc/internal/witness.h"
+
+/*
+ * Thread-Specific-Data layout
+ * --- data accessed on tcache fast path: state, rtree_ctx, stats, prof ---
+ * s: state
+ * e: tcache_enabled
+ * m: thread_allocated (config_stats)
+ * f: thread_deallocated (config_stats)
+ * p: prof_tdata (config_prof)
+ * c: rtree_ctx (rtree cache accessed on deallocation)
+ * t: tcache
+ * --- data not accessed on tcache fast path: arena-related fields ---
+ * d: arenas_tdata_bypass
+ * r: reentrancy_level
+ * x: narenas_tdata
+ * i: iarena
+ * a: arena
+ * o: arenas_tdata
+ * Loading TSD data is on the critical path of basically all malloc operations.
+ * In particular, tcache and rtree_ctx rely on hot CPU cache to be effective.
+ * Use a compact layout to reduce cache footprint.
+ * +--- 64-bit and 64B cacheline; 1B each letter; First byte on the left. ---+
+ * |----------------------------  1st cacheline  ----------------------------|
+ * | sedrxxxx mmmmmmmm ffffffff pppppppp [c * 32  ........ ........ .......] |
+ * |----------------------------  2nd cacheline  ----------------------------|
+ * | [c * 64  ........ ........ ........ ........ ........ ........ .......] |
+ * |----------------------------  3nd cacheline  ----------------------------|
+ * | [c * 32  ........ ........ .......] iiiiiiii aaaaaaaa oooooooo [t...... |
+ * +-------------------------------------------------------------------------+
+ * Note: the entire tcache is embedded into TSD and spans multiple cachelines.
+ *
+ * The last 3 members (i, a and o) before tcache isn't really needed on tcache
+ * fast path.  However we have a number of unused tcache bins and witnesses
+ * (never touched unless config_debug) at the end of tcache, so we place them
+ * there to avoid breaking the cachelines and possibly paging in an extra page.
+ */
+#ifdef JEMALLOC_JET
+typedef void (*test_callback_t)(int *);
+#  define MALLOC_TSD_TEST_DATA_INIT 0x72b65c10
+#  define MALLOC_TEST_TSD \
+    O(test_data,		int,			int)		\
+    O(test_callback,		test_callback_t,	int)
+#  define MALLOC_TEST_TSD_INITIALIZER , MALLOC_TSD_TEST_DATA_INIT, NULL
+#else
+#  define MALLOC_TEST_TSD
+#  define MALLOC_TEST_TSD_INITIALIZER
+#endif
+
+/*  O(name,			type,			nullable type */
+#define MALLOC_TSD							\
+    O(tcache_enabled,		bool,			bool)		\
+    O(arenas_tdata_bypass,	bool,			bool)		\
+    O(reentrancy_level,		int8_t,			int8_t)		\
+    O(narenas_tdata,		uint32_t,		uint32_t)	\
+    O(offset_state,		uint64_t,		uint64_t)	\
+    O(thread_allocated,		uint64_t,		uint64_t)	\
+    O(thread_deallocated,	uint64_t,		uint64_t)	\
+    O(prof_tdata,		prof_tdata_t *,		prof_tdata_t *)	\
+    O(rtree_ctx,		rtree_ctx_t,		rtree_ctx_t)	\
+    O(iarena,			arena_t *,		arena_t *)	\
+    O(arena,			arena_t *,		arena_t *)	\
+    O(arenas_tdata,		arena_tdata_t *,	arena_tdata_t *)\
+    O(tcache,			tcache_t,		tcache_t)	\
+    O(witness_tsd,              witness_tsd_t,		witness_tsdn_t)	\
+    MALLOC_TEST_TSD
+
+#define TSD_INITIALIZER {						\
+    tsd_state_uninitialized,						\
+    TCACHE_ENABLED_ZERO_INITIALIZER,					\
+    false,								\
+    0,									\
+    0,									\
+    0,									\
+    0,									\
+    0,									\
+    NULL,								\
+    RTREE_CTX_ZERO_INITIALIZER,						\
+    NULL,								\
+    NULL,								\
+    NULL,								\
+    TCACHE_ZERO_INITIALIZER,						\
+    WITNESS_TSD_INITIALIZER						\
+    MALLOC_TEST_TSD_INITIALIZER						\
+}
+
+enum {
+	tsd_state_nominal = 0, /* Common case --> jnz. */
+	tsd_state_nominal_slow = 1, /* Initialized but on slow path. */
+	/* the above 2 nominal states should be lower values. */
+	tsd_state_nominal_max = 1, /* used for comparison only. */
+	tsd_state_minimal_initialized = 2,
+	tsd_state_purgatory = 3,
+	tsd_state_reincarnated = 4,
+	tsd_state_uninitialized = 5
+};
+
+/* Manually limit tsd_state_t to a single byte. */
+typedef uint8_t tsd_state_t;
+
+/* The actual tsd. */
+struct tsd_s {
+	/*
+	 * The contents should be treated as totally opaque outside the tsd
+	 * module.  Access any thread-local state through the getters and
+	 * setters below.
+	 */
+	tsd_state_t	state;
+#define O(n, t, nt)							\
+	t use_a_getter_or_setter_instead_##n;
+MALLOC_TSD
+#undef O
+};
+
+/*
+ * Wrapper around tsd_t that makes it possible to avoid implicit conversion
+ * between tsd_t and tsdn_t, where tsdn_t is "nullable" and has to be
+ * explicitly converted to tsd_t, which is non-nullable.
+ */
+struct tsdn_s {
+	tsd_t tsd;
+};
+#define TSDN_NULL ((tsdn_t *)0)
+JEMALLOC_ALWAYS_INLINE tsdn_t *
+tsd_tsdn(tsd_t *tsd) {
+	return (tsdn_t *)tsd;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsdn_null(const tsdn_t *tsdn) {
+	return tsdn == NULL;
+}
+
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsdn_tsd(tsdn_t *tsdn) {
+	assert(!tsdn_null(tsdn));
+
+	return &tsdn->tsd;
+}
+
+void *malloc_tsd_malloc(size_t size);
+void malloc_tsd_dalloc(void *wrapper);
+void malloc_tsd_cleanup_register(bool (*f)(void));
+tsd_t *malloc_tsd_boot0(void);
+void malloc_tsd_boot1(void);
+void tsd_cleanup(void *arg);
+tsd_t *tsd_fetch_slow(tsd_t *tsd, bool internal);
+void tsd_slow_update(tsd_t *tsd);
+
+/*
+ * We put the platform-specific data declarations and inlines into their own
+ * header files to avoid cluttering this file.  They define tsd_boot0,
+ * tsd_boot1, tsd_boot, tsd_booted_get, tsd_get_allocates, tsd_get, and tsd_set.
+ */
+#ifdef JEMALLOC_MALLOC_THREAD_CLEANUP
+#include "jemalloc/internal/tsd_malloc_thread_cleanup.h"
+#elif (defined(JEMALLOC_TLS))
+#include "jemalloc/internal/tsd_tls.h"
+#elif (defined(_WIN32))
+#include "jemalloc/internal/tsd_win.h"
+#else
+#include "jemalloc/internal/tsd_generic.h"
+#endif
+
+/*
+ * tsd_foop_get_unsafe(tsd) returns a pointer to the thread-local instance of
+ * foo.  This omits some safety checks, and so can be used during tsd
+ * initialization and cleanup.
+ */
+#define O(n, t, nt)							\
+JEMALLOC_ALWAYS_INLINE t *						\
+tsd_##n##p_get_unsafe(tsd_t *tsd) {					\
+	return &tsd->use_a_getter_or_setter_instead_##n;		\
+}
+MALLOC_TSD
+#undef O
+
+/* tsd_foop_get(tsd) returns a pointer to the thread-local instance of foo. */
+#define O(n, t, nt)							\
+JEMALLOC_ALWAYS_INLINE t *						\
+tsd_##n##p_get(tsd_t *tsd) {						\
+	assert(tsd->state == tsd_state_nominal ||			\
+	    tsd->state == tsd_state_nominal_slow ||			\
+	    tsd->state == tsd_state_reincarnated ||			\
+	    tsd->state == tsd_state_minimal_initialized);		\
+	return tsd_##n##p_get_unsafe(tsd);				\
+}
+MALLOC_TSD
+#undef O
+
+/*
+ * tsdn_foop_get(tsdn) returns either the thread-local instance of foo (if tsdn
+ * isn't NULL), or NULL (if tsdn is NULL), cast to the nullable pointer type.
+ */
+#define O(n, t, nt)							\
+JEMALLOC_ALWAYS_INLINE nt *						\
+tsdn_##n##p_get(tsdn_t *tsdn) {						\
+	if (tsdn_null(tsdn)) {						\
+		return NULL;						\
+	}								\
+	tsd_t *tsd = tsdn_tsd(tsdn);					\
+	return (nt *)tsd_##n##p_get(tsd);				\
+}
+MALLOC_TSD
+#undef O
+
+/* tsd_foo_get(tsd) returns the value of the thread-local instance of foo. */
+#define O(n, t, nt)							\
+JEMALLOC_ALWAYS_INLINE t						\
+tsd_##n##_get(tsd_t *tsd) {						\
+	return *tsd_##n##p_get(tsd);					\
+}
+MALLOC_TSD
+#undef O
+
+/* tsd_foo_set(tsd, val) updates the thread-local instance of foo to be val. */
+#define O(n, t, nt)							\
+JEMALLOC_ALWAYS_INLINE void						\
+tsd_##n##_set(tsd_t *tsd, t val) {					\
+	assert(tsd->state != tsd_state_reincarnated &&			\
+	    tsd->state != tsd_state_minimal_initialized);		\
+	*tsd_##n##p_get(tsd) = val;					\
+}
+MALLOC_TSD
+#undef O
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_assert_fast(tsd_t *tsd) {
+	assert(!malloc_slow && tsd_tcache_enabled_get(tsd) &&
+	    tsd_reentrancy_level_get(tsd) == 0);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_fast(tsd_t *tsd) {
+	bool fast = (tsd->state == tsd_state_nominal);
+	if (fast) {
+		tsd_assert_fast(tsd);
+	}
+
+	return fast;
+}
+
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_fetch_impl(bool init, bool minimal) {
+	tsd_t *tsd = tsd_get(init);
+
+	if (!init && tsd_get_allocates() && tsd == NULL) {
+		return NULL;
+	}
+	assert(tsd != NULL);
+
+	if (unlikely(tsd->state != tsd_state_nominal)) {
+		return tsd_fetch_slow(tsd, minimal);
+	}
+	assert(tsd_fast(tsd));
+	tsd_assert_fast(tsd);
+
+	return tsd;
+}
+
+/* Get a minimal TSD that requires no cleanup.  See comments in free(). */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_fetch_min(void) {
+	return tsd_fetch_impl(true, true);
+}
+
+/* For internal background threads use only. */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_internal_fetch(void) {
+	tsd_t *tsd = tsd_fetch_min();
+	/* Use reincarnated state to prevent full initialization. */
+	tsd->state = tsd_state_reincarnated;
+
+	return tsd;
+}
+
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_fetch(void) {
+	return tsd_fetch_impl(true, false);
+}
+
+static inline bool
+tsd_nominal(tsd_t *tsd) {
+	return (tsd->state <= tsd_state_nominal_max);
+}
+
+JEMALLOC_ALWAYS_INLINE tsdn_t *
+tsdn_fetch(void) {
+	if (!tsd_booted_get()) {
+		return NULL;
+	}
+
+	return tsd_tsdn(tsd_fetch_impl(false, false));
+}
+
+JEMALLOC_ALWAYS_INLINE rtree_ctx_t *
+tsd_rtree_ctx(tsd_t *tsd) {
+	return tsd_rtree_ctxp_get(tsd);
+}
+
+JEMALLOC_ALWAYS_INLINE rtree_ctx_t *
+tsdn_rtree_ctx(tsdn_t *tsdn, rtree_ctx_t *fallback) {
+	/*
+	 * If tsd cannot be accessed, initialize the fallback rtree_ctx and
+	 * return a pointer to it.
+	 */
+	if (unlikely(tsdn_null(tsdn))) {
+		rtree_ctx_data_init(fallback);
+		return fallback;
+	}
+	return tsd_rtree_ctx(tsdn_tsd(tsdn));
+}
+
+#endif /* JEMALLOC_INTERNAL_TSD_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
new file mode 100644
index 00000000..1e52ef76
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
@@ -0,0 +1,157 @@
+#ifdef JEMALLOC_INTERNAL_TSD_GENERIC_H
+#error This file should be included only once, by tsd.h.
+#endif
+#define JEMALLOC_INTERNAL_TSD_GENERIC_H
+
+typedef struct tsd_init_block_s tsd_init_block_t;
+struct tsd_init_block_s {
+	ql_elm(tsd_init_block_t) link;
+	pthread_t thread;
+	void *data;
+};
+
+/* Defined in tsd.c, to allow the mutex headers to have tsd dependencies. */
+typedef struct tsd_init_head_s tsd_init_head_t;
+
+typedef struct {
+	bool initialized;
+	tsd_t val;
+} tsd_wrapper_t;
+
+void *tsd_init_check_recursion(tsd_init_head_t *head,
+    tsd_init_block_t *block);
+void tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block);
+
+extern pthread_key_t tsd_tsd;
+extern tsd_init_head_t tsd_init_head;
+extern tsd_wrapper_t tsd_boot_wrapper;
+extern bool tsd_booted;
+
+/* Initialization/cleanup. */
+JEMALLOC_ALWAYS_INLINE void
+tsd_cleanup_wrapper(void *arg) {
+	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)arg;
+
+	if (wrapper->initialized) {
+		wrapper->initialized = false;
+		tsd_cleanup(&wrapper->val);
+		if (wrapper->initialized) {
+			/* Trigger another cleanup round. */
+			if (pthread_setspecific(tsd_tsd, (void *)wrapper) != 0)
+			{
+				malloc_write("<jemalloc>: Error setting TSD\n");
+				if (opt_abort) {
+					abort();
+				}
+			}
+			return;
+		}
+	}
+	malloc_tsd_dalloc(wrapper);
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_wrapper_set(tsd_wrapper_t *wrapper) {
+	if (pthread_setspecific(tsd_tsd, (void *)wrapper) != 0) {
+		malloc_write("<jemalloc>: Error setting TSD\n");
+		abort();
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE tsd_wrapper_t *
+tsd_wrapper_get(bool init) {
+	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)pthread_getspecific(tsd_tsd);
+
+	if (init && unlikely(wrapper == NULL)) {
+		tsd_init_block_t block;
+		wrapper = (tsd_wrapper_t *)
+		    tsd_init_check_recursion(&tsd_init_head, &block);
+		if (wrapper) {
+			return wrapper;
+		}
+		wrapper = (tsd_wrapper_t *)
+		    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
+		block.data = (void *)wrapper;
+		if (wrapper == NULL) {
+			malloc_write("<jemalloc>: Error allocating TSD\n");
+			abort();
+		} else {
+			wrapper->initialized = false;
+			tsd_t initializer = TSD_INITIALIZER;
+			wrapper->val = initializer;
+		}
+		tsd_wrapper_set(wrapper);
+		tsd_init_finish(&tsd_init_head, &block);
+	}
+	return wrapper;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot0(void) {
+	if (pthread_key_create(&tsd_tsd, tsd_cleanup_wrapper) != 0) {
+		return true;
+	}
+	tsd_wrapper_set(&tsd_boot_wrapper);
+	tsd_booted = true;
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_boot1(void) {
+	tsd_wrapper_t *wrapper;
+	wrapper = (tsd_wrapper_t *)malloc_tsd_malloc(sizeof(tsd_wrapper_t));
+	if (wrapper == NULL) {
+		malloc_write("<jemalloc>: Error allocating TSD\n");
+		abort();
+	}
+	tsd_boot_wrapper.initialized = false;
+	tsd_cleanup(&tsd_boot_wrapper.val);
+	wrapper->initialized = false;
+	tsd_t initializer = TSD_INITIALIZER;
+	wrapper->val = initializer;
+	tsd_wrapper_set(wrapper);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot(void) {
+	if (tsd_boot0()) {
+		return true;
+	}
+	tsd_boot1();
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_booted_get(void) {
+	return tsd_booted;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_get_allocates(void) {
+	return true;
+}
+
+/* Get/set. */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_get(bool init) {
+	tsd_wrapper_t *wrapper;
+
+	assert(tsd_booted);
+	wrapper = tsd_wrapper_get(init);
+	if (tsd_get_allocates() && !init && wrapper == NULL) {
+		return NULL;
+	}
+	return &wrapper->val;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_set(tsd_t *val) {
+	tsd_wrapper_t *wrapper;
+
+	assert(tsd_booted);
+	wrapper = tsd_wrapper_get(true);
+	if (likely(&wrapper->val != val)) {
+		wrapper->val = *(val);
+	}
+	wrapper->initialized = true;
+}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
new file mode 100644
index 00000000..beb467a6
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
@@ -0,0 +1,60 @@
+#ifdef JEMALLOC_INTERNAL_TSD_MALLOC_THREAD_CLEANUP_H
+#error This file should be included only once, by tsd.h.
+#endif
+#define JEMALLOC_INTERNAL_TSD_MALLOC_THREAD_CLEANUP_H
+
+extern __thread tsd_t tsd_tls;
+extern __thread bool tsd_initialized;
+extern bool tsd_booted;
+
+/* Initialization/cleanup. */
+JEMALLOC_ALWAYS_INLINE bool
+tsd_cleanup_wrapper(void) {
+	if (tsd_initialized) {
+		tsd_initialized = false;
+		tsd_cleanup(&tsd_tls);
+	}
+	return tsd_initialized;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot0(void) {
+	malloc_tsd_cleanup_register(&tsd_cleanup_wrapper);
+	tsd_booted = true;
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_boot1(void) {
+	/* Do nothing. */
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot(void) {
+	return tsd_boot0();
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_booted_get(void) {
+	return tsd_booted;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_get_allocates(void) {
+	return false;
+}
+
+/* Get/set. */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_get(bool init) {
+	assert(tsd_booted);
+	return &tsd_tls;
+}
+JEMALLOC_ALWAYS_INLINE void
+tsd_set(tsd_t *val) {
+	assert(tsd_booted);
+	if (likely(&tsd_tls != val)) {
+		tsd_tls = (*val);
+	}
+	tsd_initialized = true;
+}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
new file mode 100644
index 00000000..0de64b7b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
@@ -0,0 +1,59 @@
+#ifdef JEMALLOC_INTERNAL_TSD_TLS_H
+#error This file should be included only once, by tsd.h.
+#endif
+#define JEMALLOC_INTERNAL_TSD_TLS_H
+
+extern __thread tsd_t tsd_tls;
+extern pthread_key_t tsd_tsd;
+extern bool tsd_booted;
+
+/* Initialization/cleanup. */
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot0(void) {
+	if (pthread_key_create(&tsd_tsd, &tsd_cleanup) != 0) {
+		return true;
+	}
+	tsd_booted = true;
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_boot1(void) {
+	/* Do nothing. */
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot(void) {
+	return tsd_boot0();
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_booted_get(void) {
+	return tsd_booted;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_get_allocates(void) {
+	return false;
+}
+
+/* Get/set. */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_get(UNUSED bool init) {
+	assert(tsd_booted);
+	return &tsd_tls;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_set(tsd_t *val) {
+	assert(tsd_booted);
+	if (likely(&tsd_tls != val)) {
+		tsd_tls = (*val);
+	}
+	if (pthread_setspecific(tsd_tsd, (void *)(&tsd_tls)) != 0) {
+		malloc_write("<jemalloc>: Error setting tsd.\n");
+		if (opt_abort) {
+			abort();
+		}
+	}
+}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
new file mode 100644
index 00000000..6200af61
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
@@ -0,0 +1,10 @@
+#ifndef JEMALLOC_INTERNAL_TSD_TYPES_H
+#define JEMALLOC_INTERNAL_TSD_TYPES_H
+
+#define MALLOC_TSD_CLEANUPS_MAX	2
+
+typedef struct tsd_s tsd_t;
+typedef struct tsdn_s tsdn_t;
+typedef bool (*malloc_tsd_cleanup_t)(void);
+
+#endif /* JEMALLOC_INTERNAL_TSD_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
new file mode 100644
index 00000000..cf30d18e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
@@ -0,0 +1,139 @@
+#ifdef JEMALLOC_INTERNAL_TSD_WIN_H
+#error This file should be included only once, by tsd.h.
+#endif
+#define JEMALLOC_INTERNAL_TSD_WIN_H
+
+typedef struct {
+	bool initialized;
+	tsd_t val;
+} tsd_wrapper_t;
+
+extern DWORD tsd_tsd;
+extern tsd_wrapper_t tsd_boot_wrapper;
+extern bool tsd_booted;
+
+/* Initialization/cleanup. */
+JEMALLOC_ALWAYS_INLINE bool
+tsd_cleanup_wrapper(void) {
+	DWORD error = GetLastError();
+	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)TlsGetValue(tsd_tsd);
+	SetLastError(error);
+
+	if (wrapper == NULL) {
+		return false;
+	}
+
+	if (wrapper->initialized) {
+		wrapper->initialized = false;
+		tsd_cleanup(&wrapper->val);
+		if (wrapper->initialized) {
+			/* Trigger another cleanup round. */
+			return true;
+		}
+	}
+	malloc_tsd_dalloc(wrapper);
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_wrapper_set(tsd_wrapper_t *wrapper) {
+	if (!TlsSetValue(tsd_tsd, (void *)wrapper)) {
+		malloc_write("<jemalloc>: Error setting TSD\n");
+		abort();
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE tsd_wrapper_t *
+tsd_wrapper_get(bool init) {
+	DWORD error = GetLastError();
+	tsd_wrapper_t *wrapper = (tsd_wrapper_t *) TlsGetValue(tsd_tsd);
+	SetLastError(error);
+
+	if (init && unlikely(wrapper == NULL)) {
+		wrapper = (tsd_wrapper_t *)
+		    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
+		if (wrapper == NULL) {
+			malloc_write("<jemalloc>: Error allocating TSD\n");
+			abort();
+		} else {
+			wrapper->initialized = false;
+			/* MSVC is finicky about aggregate initialization. */
+			tsd_t tsd_initializer = TSD_INITIALIZER;
+			wrapper->val = tsd_initializer;
+		}
+		tsd_wrapper_set(wrapper);
+	}
+	return wrapper;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot0(void) {
+	tsd_tsd = TlsAlloc();
+	if (tsd_tsd == TLS_OUT_OF_INDEXES) {
+		return true;
+	}
+	malloc_tsd_cleanup_register(&tsd_cleanup_wrapper);
+	tsd_wrapper_set(&tsd_boot_wrapper);
+	tsd_booted = true;
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_boot1(void) {
+	tsd_wrapper_t *wrapper;
+	wrapper = (tsd_wrapper_t *)
+	    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
+	if (wrapper == NULL) {
+		malloc_write("<jemalloc>: Error allocating TSD\n");
+		abort();
+	}
+	tsd_boot_wrapper.initialized = false;
+	tsd_cleanup(&tsd_boot_wrapper.val);
+	wrapper->initialized = false;
+	tsd_t initializer = TSD_INITIALIZER;
+	wrapper->val = initializer;
+	tsd_wrapper_set(wrapper);
+}
+JEMALLOC_ALWAYS_INLINE bool
+tsd_boot(void) {
+	if (tsd_boot0()) {
+		return true;
+	}
+	tsd_boot1();
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_booted_get(void) {
+	return tsd_booted;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+tsd_get_allocates(void) {
+	return true;
+}
+
+/* Get/set. */
+JEMALLOC_ALWAYS_INLINE tsd_t *
+tsd_get(bool init) {
+	tsd_wrapper_t *wrapper;
+
+	assert(tsd_booted);
+	wrapper = tsd_wrapper_get(init);
+	if (tsd_get_allocates() && !init && wrapper == NULL) {
+		return NULL;
+	}
+	return &wrapper->val;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+tsd_set(tsd_t *val) {
+	tsd_wrapper_t *wrapper;
+
+	assert(tsd_booted);
+	wrapper = tsd_wrapper_get(true);
+	if (likely(&wrapper->val != val)) {
+		wrapper->val = *(val);
+	}
+	wrapper->initialized = true;
+}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
new file mode 100644
index 00000000..304cb545
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
@@ -0,0 +1,67 @@
+#ifndef JEMALLOC_INTERNAL_UTIL_H
+#define JEMALLOC_INTERNAL_UTIL_H
+
+#define UTIL_INLINE static inline
+
+/* Junk fill patterns. */
+#ifndef JEMALLOC_ALLOC_JUNK
+#  define JEMALLOC_ALLOC_JUNK	((uint8_t)0xa5)
+#endif
+#ifndef JEMALLOC_FREE_JUNK
+#  define JEMALLOC_FREE_JUNK	((uint8_t)0x5a)
+#endif
+
+/*
+ * Wrap a cpp argument that contains commas such that it isn't broken up into
+ * multiple arguments.
+ */
+#define JEMALLOC_ARG_CONCAT(...) __VA_ARGS__
+
+/* cpp macro definition stringification. */
+#define STRINGIFY_HELPER(x) #x
+#define STRINGIFY(x) STRINGIFY_HELPER(x)
+
+/*
+ * Silence compiler warnings due to uninitialized values.  This is used
+ * wherever the compiler fails to recognize that the variable is never used
+ * uninitialized.
+ */
+#define JEMALLOC_CC_SILENCE_INIT(v) = v
+
+#ifdef __GNUC__
+#  define likely(x)   __builtin_expect(!!(x), 1)
+#  define unlikely(x) __builtin_expect(!!(x), 0)
+#else
+#  define likely(x)   !!(x)
+#  define unlikely(x) !!(x)
+#endif
+
+#if !defined(JEMALLOC_INTERNAL_UNREACHABLE)
+#  error JEMALLOC_INTERNAL_UNREACHABLE should have been defined by configure
+#endif
+
+#define unreachable() JEMALLOC_INTERNAL_UNREACHABLE()
+
+/* Set error code. */
+UTIL_INLINE void
+set_errno(int errnum) {
+#ifdef _WIN32
+	SetLastError(errnum);
+#else
+	errno = errnum;
+#endif
+}
+
+/* Get last error code. */
+UTIL_INLINE int
+get_errno(void) {
+#ifdef _WIN32
+	return GetLastError();
+#else
+	return errno;
+#endif
+}
+
+#undef UTIL_INLINE
+
+#endif /* JEMALLOC_INTERNAL_UTIL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
new file mode 100644
index 00000000..7ace8ae4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
@@ -0,0 +1,346 @@
+#ifndef JEMALLOC_INTERNAL_WITNESS_H
+#define JEMALLOC_INTERNAL_WITNESS_H
+
+#include "jemalloc/internal/ql.h"
+
+/******************************************************************************/
+/* LOCK RANKS */
+/******************************************************************************/
+
+/*
+ * Witnesses with rank WITNESS_RANK_OMIT are completely ignored by the witness
+ * machinery.
+ */
+
+#define WITNESS_RANK_OMIT		0U
+
+#define WITNESS_RANK_MIN		1U
+
+#define WITNESS_RANK_INIT		1U
+#define WITNESS_RANK_CTL		1U
+#define WITNESS_RANK_TCACHES		2U
+#define WITNESS_RANK_ARENAS		3U
+
+#define WITNESS_RANK_BACKGROUND_THREAD_GLOBAL	4U
+
+#define WITNESS_RANK_PROF_DUMP		5U
+#define WITNESS_RANK_PROF_BT2GCTX	6U
+#define WITNESS_RANK_PROF_TDATAS	7U
+#define WITNESS_RANK_PROF_TDATA		8U
+#define WITNESS_RANK_PROF_GCTX		9U
+
+#define WITNESS_RANK_BACKGROUND_THREAD	10U
+
+/*
+ * Used as an argument to witness_assert_depth_to_rank() in order to validate
+ * depth excluding non-core locks with lower ranks.  Since the rank argument to
+ * witness_assert_depth_to_rank() is inclusive rather than exclusive, this
+ * definition can have the same value as the minimally ranked core lock.
+ */
+#define WITNESS_RANK_CORE		11U
+
+#define WITNESS_RANK_DECAY		11U
+#define WITNESS_RANK_TCACHE_QL		12U
+#define WITNESS_RANK_EXTENT_GROW	13U
+#define WITNESS_RANK_EXTENTS		14U
+#define WITNESS_RANK_EXTENT_AVAIL	15U
+
+#define WITNESS_RANK_EXTENT_POOL	16U
+#define WITNESS_RANK_RTREE		17U
+#define WITNESS_RANK_BASE		18U
+#define WITNESS_RANK_ARENA_LARGE	19U
+
+#define WITNESS_RANK_LEAF		0xffffffffU
+#define WITNESS_RANK_BIN		WITNESS_RANK_LEAF
+#define WITNESS_RANK_ARENA_STATS	WITNESS_RANK_LEAF
+#define WITNESS_RANK_DSS		WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_ACTIVE	WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_ACCUM		WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_DUMP_SEQ	WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_GDUMP		WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_NEXT_THR_UID	WITNESS_RANK_LEAF
+#define WITNESS_RANK_PROF_THREAD_ACTIVE_INIT	WITNESS_RANK_LEAF
+
+/******************************************************************************/
+/* PER-WITNESS DATA */
+/******************************************************************************/
+#if defined(JEMALLOC_DEBUG)
+#  define WITNESS_INITIALIZER(name, rank) {name, rank, NULL, NULL, {NULL, NULL}}
+#else
+#  define WITNESS_INITIALIZER(name, rank)
+#endif
+
+typedef struct witness_s witness_t;
+typedef unsigned witness_rank_t;
+typedef ql_head(witness_t) witness_list_t;
+typedef int witness_comp_t (const witness_t *, void *, const witness_t *,
+    void *);
+
+struct witness_s {
+	/* Name, used for printing lock order reversal messages. */
+	const char		*name;
+
+	/*
+	 * Witness rank, where 0 is lowest and UINT_MAX is highest.  Witnesses
+	 * must be acquired in order of increasing rank.
+	 */
+	witness_rank_t		rank;
+
+	/*
+	 * If two witnesses are of equal rank and they have the samp comp
+	 * function pointer, it is called as a last attempt to differentiate
+	 * between witnesses of equal rank.
+	 */
+	witness_comp_t		*comp;
+
+	/* Opaque data, passed to comp(). */
+	void			*opaque;
+
+	/* Linkage for thread's currently owned locks. */
+	ql_elm(witness_t)	link;
+};
+
+/******************************************************************************/
+/* PER-THREAD DATA */
+/******************************************************************************/
+typedef struct witness_tsd_s witness_tsd_t;
+struct witness_tsd_s {
+	witness_list_t witnesses;
+	bool forking;
+};
+
+#define WITNESS_TSD_INITIALIZER { ql_head_initializer(witnesses), false }
+#define WITNESS_TSDN_NULL ((witness_tsdn_t *)0)
+
+/******************************************************************************/
+/* (PER-THREAD) NULLABILITY HELPERS */
+/******************************************************************************/
+typedef struct witness_tsdn_s witness_tsdn_t;
+struct witness_tsdn_s {
+	witness_tsd_t witness_tsd;
+};
+
+JEMALLOC_ALWAYS_INLINE witness_tsdn_t *
+witness_tsd_tsdn(witness_tsd_t *witness_tsd) {
+	return (witness_tsdn_t *)witness_tsd;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+witness_tsdn_null(witness_tsdn_t *witness_tsdn) {
+	return witness_tsdn == NULL;
+}
+
+JEMALLOC_ALWAYS_INLINE witness_tsd_t *
+witness_tsdn_tsd(witness_tsdn_t *witness_tsdn) {
+	assert(!witness_tsdn_null(witness_tsdn));
+	return &witness_tsdn->witness_tsd;
+}
+
+/******************************************************************************/
+/* API */
+/******************************************************************************/
+void witness_init(witness_t *witness, const char *name, witness_rank_t rank,
+    witness_comp_t *comp, void *opaque);
+
+typedef void (witness_lock_error_t)(const witness_list_t *, const witness_t *);
+extern witness_lock_error_t *JET_MUTABLE witness_lock_error;
+
+typedef void (witness_owner_error_t)(const witness_t *);
+extern witness_owner_error_t *JET_MUTABLE witness_owner_error;
+
+typedef void (witness_not_owner_error_t)(const witness_t *);
+extern witness_not_owner_error_t *JET_MUTABLE witness_not_owner_error;
+
+typedef void (witness_depth_error_t)(const witness_list_t *,
+    witness_rank_t rank_inclusive, unsigned depth);
+extern witness_depth_error_t *JET_MUTABLE witness_depth_error;
+
+void witnesses_cleanup(witness_tsd_t *witness_tsd);
+void witness_prefork(witness_tsd_t *witness_tsd);
+void witness_postfork_parent(witness_tsd_t *witness_tsd);
+void witness_postfork_child(witness_tsd_t *witness_tsd);
+
+/* Helper, not intended for direct use. */
+static inline bool
+witness_owner(witness_tsd_t *witness_tsd, const witness_t *witness) {
+	witness_list_t *witnesses;
+	witness_t *w;
+
+	cassert(config_debug);
+
+	witnesses = &witness_tsd->witnesses;
+	ql_foreach(w, witnesses, link) {
+		if (w == witness) {
+			return true;
+		}
+	}
+
+	return false;
+}
+
+static inline void
+witness_assert_owner(witness_tsdn_t *witness_tsdn, const witness_t *witness) {
+	witness_tsd_t *witness_tsd;
+
+	if (!config_debug) {
+		return;
+	}
+
+	if (witness_tsdn_null(witness_tsdn)) {
+		return;
+	}
+	witness_tsd = witness_tsdn_tsd(witness_tsdn);
+	if (witness->rank == WITNESS_RANK_OMIT) {
+		return;
+	}
+
+	if (witness_owner(witness_tsd, witness)) {
+		return;
+	}
+	witness_owner_error(witness);
+}
+
+static inline void
+witness_assert_not_owner(witness_tsdn_t *witness_tsdn,
+    const witness_t *witness) {
+	witness_tsd_t *witness_tsd;
+	witness_list_t *witnesses;
+	witness_t *w;
+
+	if (!config_debug) {
+		return;
+	}
+
+	if (witness_tsdn_null(witness_tsdn)) {
+		return;
+	}
+	witness_tsd = witness_tsdn_tsd(witness_tsdn);
+	if (witness->rank == WITNESS_RANK_OMIT) {
+		return;
+	}
+
+	witnesses = &witness_tsd->witnesses;
+	ql_foreach(w, witnesses, link) {
+		if (w == witness) {
+			witness_not_owner_error(witness);
+		}
+	}
+}
+
+static inline void
+witness_assert_depth_to_rank(witness_tsdn_t *witness_tsdn,
+    witness_rank_t rank_inclusive, unsigned depth) {
+	witness_tsd_t *witness_tsd;
+	unsigned d;
+	witness_list_t *witnesses;
+	witness_t *w;
+
+	if (!config_debug) {
+		return;
+	}
+
+	if (witness_tsdn_null(witness_tsdn)) {
+		return;
+	}
+	witness_tsd = witness_tsdn_tsd(witness_tsdn);
+
+	d = 0;
+	witnesses = &witness_tsd->witnesses;
+	w = ql_last(witnesses, link);
+	if (w != NULL) {
+		ql_reverse_foreach(w, witnesses, link) {
+			if (w->rank < rank_inclusive) {
+				break;
+			}
+			d++;
+		}
+	}
+	if (d != depth) {
+		witness_depth_error(witnesses, rank_inclusive, depth);
+	}
+}
+
+static inline void
+witness_assert_depth(witness_tsdn_t *witness_tsdn, unsigned depth) {
+	witness_assert_depth_to_rank(witness_tsdn, WITNESS_RANK_MIN, depth);
+}
+
+static inline void
+witness_assert_lockless(witness_tsdn_t *witness_tsdn) {
+	witness_assert_depth(witness_tsdn, 0);
+}
+
+static inline void
+witness_lock(witness_tsdn_t *witness_tsdn, witness_t *witness) {
+	witness_tsd_t *witness_tsd;
+	witness_list_t *witnesses;
+	witness_t *w;
+
+	if (!config_debug) {
+		return;
+	}
+
+	if (witness_tsdn_null(witness_tsdn)) {
+		return;
+	}
+	witness_tsd = witness_tsdn_tsd(witness_tsdn);
+	if (witness->rank == WITNESS_RANK_OMIT) {
+		return;
+	}
+
+	witness_assert_not_owner(witness_tsdn, witness);
+
+	witnesses = &witness_tsd->witnesses;
+	w = ql_last(witnesses, link);
+	if (w == NULL) {
+		/* No other locks; do nothing. */
+	} else if (witness_tsd->forking && w->rank <= witness->rank) {
+		/* Forking, and relaxed ranking satisfied. */
+	} else if (w->rank > witness->rank) {
+		/* Not forking, rank order reversal. */
+		witness_lock_error(witnesses, witness);
+	} else if (w->rank == witness->rank && (w->comp == NULL || w->comp !=
+	    witness->comp || w->comp(w, w->opaque, witness, witness->opaque) >
+	    0)) {
+		/*
+		 * Missing/incompatible comparison function, or comparison
+		 * function indicates rank order reversal.
+		 */
+		witness_lock_error(witnesses, witness);
+	}
+
+	ql_elm_new(witness, link);
+	ql_tail_insert(witnesses, witness, link);
+}
+
+static inline void
+witness_unlock(witness_tsdn_t *witness_tsdn, witness_t *witness) {
+	witness_tsd_t *witness_tsd;
+	witness_list_t *witnesses;
+
+	if (!config_debug) {
+		return;
+	}
+
+	if (witness_tsdn_null(witness_tsdn)) {
+		return;
+	}
+	witness_tsd = witness_tsdn_tsd(witness_tsdn);
+	if (witness->rank == WITNESS_RANK_OMIT) {
+		return;
+	}
+
+	/*
+	 * Check whether owner before removal, rather than relying on
+	 * witness_assert_owner() to abort, so that unit tests can test this
+	 * function's failure mode without causing undefined behavior.
+	 */
+	if (witness_owner(witness_tsd, witness)) {
+		witnesses = &witness_tsd->witnesses;
+		ql_remove(witnesses, witness, link);
+	} else {
+		witness_assert_owner(witness_tsdn, witness);
+	}
+}
+
+#endif /* JEMALLOC_INTERNAL_WITNESS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
new file mode 100755
index 00000000..b19b1548
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
@@ -0,0 +1,27 @@
+#!/bin/sh
+
+objroot=$1
+
+cat <<EOF
+#ifndef JEMALLOC_H_
+#define JEMALLOC_H_
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+EOF
+
+for hdr in jemalloc_defs.h jemalloc_rename.h jemalloc_macros.h \
+           jemalloc_protos.h jemalloc_typedefs.h jemalloc_mangle.h ; do
+  cat "${objroot}include/jemalloc/${hdr}" \
+      | grep -v 'Generated from .* by configure\.' \
+      | sed -e 's/ $//g'
+  echo
+done
+
+cat <<EOF
+#ifdef __cplusplus
+}
+#endif
+#endif /* JEMALLOC_H_ */
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
new file mode 100644
index 00000000..6d89435c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
@@ -0,0 +1,45 @@
+/* Defined if __attribute__((...)) syntax is supported. */
+#undef JEMALLOC_HAVE_ATTR
+
+/* Defined if alloc_size attribute is supported. */
+#undef JEMALLOC_HAVE_ATTR_ALLOC_SIZE
+
+/* Defined if format(gnu_printf, ...) attribute is supported. */
+#undef JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF
+
+/* Defined if format(printf, ...) attribute is supported. */
+#undef JEMALLOC_HAVE_ATTR_FORMAT_PRINTF
+
+/*
+ * Define overrides for non-standard allocator-related functions if they are
+ * present on the system.
+ */
+#undef JEMALLOC_OVERRIDE_MEMALIGN
+#undef JEMALLOC_OVERRIDE_VALLOC
+
+/*
+ * At least Linux omits the "const" in:
+ *
+ *   size_t malloc_usable_size(const void *ptr);
+ *
+ * Match the operating system's prototype.
+ */
+#undef JEMALLOC_USABLE_SIZE_CONST
+
+/*
+ * If defined, specify throw() for the public function prototypes when compiling
+ * with C++.  The only justification for this is to match the prototypes that
+ * glibc defines.
+ */
+#undef JEMALLOC_USE_CXX_THROW
+
+#ifdef _MSC_VER
+#  ifdef _WIN64
+#    define LG_SIZEOF_PTR_WIN 3
+#  else
+#    define LG_SIZEOF_PTR_WIN 2
+#  endif
+#endif
+
+/* sizeof(void *) == 2^LG_SIZEOF_PTR. */
+#undef LG_SIZEOF_PTR
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
new file mode 100644
index 00000000..daf9e571
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
@@ -0,0 +1,126 @@
+#include <stdlib.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <limits.h>
+#include <strings.h>
+
+#define JEMALLOC_VERSION "@jemalloc_version@"
+#define JEMALLOC_VERSION_MAJOR @jemalloc_version_major@
+#define JEMALLOC_VERSION_MINOR @jemalloc_version_minor@
+#define JEMALLOC_VERSION_BUGFIX @jemalloc_version_bugfix@
+#define JEMALLOC_VERSION_NREV @jemalloc_version_nrev@
+#define JEMALLOC_VERSION_GID "@jemalloc_version_gid@"
+
+#define MALLOCX_LG_ALIGN(la)	((int)(la))
+#if LG_SIZEOF_PTR == 2
+#  define MALLOCX_ALIGN(a)	((int)(ffs((int)(a))-1))
+#else
+#  define MALLOCX_ALIGN(a)						\
+     ((int)(((size_t)(a) < (size_t)INT_MAX) ? ffs((int)(a))-1 :	\
+     ffs((int)(((size_t)(a))>>32))+31))
+#endif
+#define MALLOCX_ZERO	((int)0x40)
+/*
+ * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
+ * encodes MALLOCX_TCACHE_NONE.
+ */
+#define MALLOCX_TCACHE(tc)	((int)(((tc)+2) << 8))
+#define MALLOCX_TCACHE_NONE	MALLOCX_TCACHE(-1)
+/*
+ * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
+ */
+#define MALLOCX_ARENA(a)	((((int)(a))+1) << 20)
+
+/*
+ * Use as arena index in "arena.<i>.{purge,decay,dss}" and
+ * "stats.arenas.<i>.*" mallctl interfaces to select all arenas.  This
+ * definition is intentionally specified in raw decimal format to support
+ * cpp-based string concatenation, e.g.
+ *
+ *   #define STRINGIFY_HELPER(x) #x
+ *   #define STRINGIFY(x) STRINGIFY_HELPER(x)
+ *
+ *   mallctl("arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".purge", NULL, NULL, NULL,
+ *       0);
+ */
+#define MALLCTL_ARENAS_ALL	4096
+/*
+ * Use as arena index in "stats.arenas.<i>.*" mallctl interfaces to select
+ * destroyed arenas.
+ */
+#define MALLCTL_ARENAS_DESTROYED	4097
+
+#if defined(__cplusplus) && defined(JEMALLOC_USE_CXX_THROW)
+#  define JEMALLOC_CXX_THROW throw()
+#else
+#  define JEMALLOC_CXX_THROW
+#endif
+
+#if defined(_MSC_VER)
+#  define JEMALLOC_ATTR(s)
+#  define JEMALLOC_ALIGNED(s) __declspec(align(s))
+#  define JEMALLOC_ALLOC_SIZE(s)
+#  define JEMALLOC_ALLOC_SIZE2(s1, s2)
+#  ifndef JEMALLOC_EXPORT
+#    ifdef DLLEXPORT
+#      define JEMALLOC_EXPORT __declspec(dllexport)
+#    else
+#      define JEMALLOC_EXPORT __declspec(dllimport)
+#    endif
+#  endif
+#  define JEMALLOC_FORMAT_PRINTF(s, i)
+#  define JEMALLOC_NOINLINE __declspec(noinline)
+#  ifdef __cplusplus
+#    define JEMALLOC_NOTHROW __declspec(nothrow)
+#  else
+#    define JEMALLOC_NOTHROW
+#  endif
+#  define JEMALLOC_SECTION(s) __declspec(allocate(s))
+#  define JEMALLOC_RESTRICT_RETURN __declspec(restrict)
+#  if _MSC_VER >= 1900 && !defined(__EDG__)
+#    define JEMALLOC_ALLOCATOR __declspec(allocator)
+#  else
+#    define JEMALLOC_ALLOCATOR
+#  endif
+#elif defined(JEMALLOC_HAVE_ATTR)
+#  define JEMALLOC_ATTR(s) __attribute__((s))
+#  define JEMALLOC_ALIGNED(s) JEMALLOC_ATTR(aligned(s))
+#  ifdef JEMALLOC_HAVE_ATTR_ALLOC_SIZE
+#    define JEMALLOC_ALLOC_SIZE(s) JEMALLOC_ATTR(alloc_size(s))
+#    define JEMALLOC_ALLOC_SIZE2(s1, s2) JEMALLOC_ATTR(alloc_size(s1, s2))
+#  else
+#    define JEMALLOC_ALLOC_SIZE(s)
+#    define JEMALLOC_ALLOC_SIZE2(s1, s2)
+#  endif
+#  ifndef JEMALLOC_EXPORT
+#    define JEMALLOC_EXPORT JEMALLOC_ATTR(visibility("default"))
+#  endif
+#  ifdef JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF
+#    define JEMALLOC_FORMAT_PRINTF(s, i) JEMALLOC_ATTR(format(gnu_printf, s, i))
+#  elif defined(JEMALLOC_HAVE_ATTR_FORMAT_PRINTF)
+#    define JEMALLOC_FORMAT_PRINTF(s, i) JEMALLOC_ATTR(format(printf, s, i))
+#  else
+#    define JEMALLOC_FORMAT_PRINTF(s, i)
+#  endif
+#  define JEMALLOC_NOINLINE JEMALLOC_ATTR(noinline)
+#  define JEMALLOC_NOTHROW JEMALLOC_ATTR(nothrow)
+#  define JEMALLOC_SECTION(s) JEMALLOC_ATTR(section(s))
+#  define JEMALLOC_RESTRICT_RETURN
+#  define JEMALLOC_ALLOCATOR
+#else
+#  define JEMALLOC_ATTR(s)
+#  define JEMALLOC_ALIGNED(s)
+#  define JEMALLOC_ALLOC_SIZE(s)
+#  define JEMALLOC_ALLOC_SIZE2(s1, s2)
+#  define JEMALLOC_EXPORT
+#  define JEMALLOC_FORMAT_PRINTF(s, i)
+#  define JEMALLOC_NOINLINE
+#  define JEMALLOC_NOTHROW
+#  define JEMALLOC_SECTION(s)
+#  define JEMALLOC_RESTRICT_RETURN
+#  define JEMALLOC_ALLOCATOR
+#endif
+
+/* This version of Jemalloc, modified for Redis, has the je_get_defrag_hint()
+ * function. */
+#define JEMALLOC_FRAG_HINT
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
new file mode 100755
index 00000000..c675bb46
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
@@ -0,0 +1,45 @@
+#!/bin/sh -eu
+
+public_symbols_txt=$1
+symbol_prefix=$2
+
+cat <<EOF
+/*
+ * By default application code must explicitly refer to mangled symbol names,
+ * so that it is possible to use jemalloc in conjunction with another allocator
+ * in the same application.  Define JEMALLOC_MANGLE in order to cause automatic
+ * name mangling that matches the API prefixing that happened as a result of
+ * --with-mangling and/or --with-jemalloc-prefix configuration settings.
+ */
+#ifdef JEMALLOC_MANGLE
+#  ifndef JEMALLOC_NO_DEMANGLE
+#    define JEMALLOC_NO_DEMANGLE
+#  endif
+EOF
+
+for nm in `cat ${public_symbols_txt}` ; do
+  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
+  echo "#  define ${n} ${symbol_prefix}${n}"
+done
+
+cat <<EOF
+#endif
+
+/*
+ * The ${symbol_prefix}* macros can be used as stable alternative names for the
+ * public jemalloc API if JEMALLOC_NO_DEMANGLE is defined.  This is primarily
+ * meant for use in jemalloc itself, but it can be used by application code to
+ * provide isolation from the name mangling specified via --with-mangling
+ * and/or --with-jemalloc-prefix.
+ */
+#ifndef JEMALLOC_NO_DEMANGLE
+EOF
+
+for nm in `cat ${public_symbols_txt}` ; do
+  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
+  echo "#  undef ${symbol_prefix}${n}"
+done
+
+cat <<EOF
+#endif
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
new file mode 100644
index 00000000..a78414b1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
@@ -0,0 +1,66 @@
+/*
+ * The @je_@ prefix on the following public symbol declarations is an artifact
+ * of namespace management, and should be omitted in application code unless
+ * JEMALLOC_NO_DEMANGLE is defined (see jemalloc_mangle@install_suffix@.h).
+ */
+extern JEMALLOC_EXPORT const char	*@je_@malloc_conf;
+extern JEMALLOC_EXPORT void		(*@je_@malloc_message)(void *cbopaque,
+    const char *s);
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@malloc(size_t size)
+    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1);
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@calloc(size_t num, size_t size)
+    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE2(1, 2);
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@posix_memalign(void **memptr,
+    size_t alignment, size_t size) JEMALLOC_CXX_THROW JEMALLOC_ATTR(nonnull(1));
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@aligned_alloc(size_t alignment,
+    size_t size) JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc)
+    JEMALLOC_ALLOC_SIZE(2);
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@realloc(void *ptr, size_t size)
+    JEMALLOC_CXX_THROW JEMALLOC_ALLOC_SIZE(2);
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@free(void *ptr)
+    JEMALLOC_CXX_THROW;
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@mallocx(size_t size, int flags)
+    JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1);
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@rallocx(void *ptr, size_t size,
+    int flags) JEMALLOC_ALLOC_SIZE(2);
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@xallocx(void *ptr, size_t size,
+    size_t extra, int flags);
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@sallocx(const void *ptr,
+    int flags) JEMALLOC_ATTR(pure);
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@dallocx(void *ptr, int flags);
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@sdallocx(void *ptr, size_t size,
+    int flags);
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@nallocx(size_t size, int flags)
+    JEMALLOC_ATTR(pure);
+
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctl(const char *name,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen);
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctlnametomib(const char *name,
+    size_t *mibp, size_t *miblenp);
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctlbymib(const size_t *mib,
+    size_t miblen, void *oldp, size_t *oldlenp, void *newp, size_t newlen);
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@malloc_stats_print(
+    void (*write_cb)(void *, const char *), void *@je_@cbopaque,
+    const char *opts);
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@malloc_usable_size(
+    JEMALLOC_USABLE_SIZE_CONST void *ptr) JEMALLOC_CXX_THROW;
+
+#ifdef JEMALLOC_OVERRIDE_MEMALIGN
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@memalign(size_t alignment, size_t size)
+    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc);
+#endif
+
+#ifdef JEMALLOC_OVERRIDE_VALLOC
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+    void JEMALLOC_NOTHROW	*@je_@valloc(size_t size) JEMALLOC_CXX_THROW
+    JEMALLOC_ATTR(malloc);
+#endif
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
new file mode 100755
index 00000000..f9438912
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
@@ -0,0 +1,22 @@
+#!/bin/sh
+
+public_symbols_txt=$1
+
+cat <<EOF
+/*
+ * Name mangling for public symbols is controlled by --with-mangling and
+ * --with-jemalloc-prefix.  With default settings the je_ prefix is stripped by
+ * these macro definitions.
+ */
+#ifndef JEMALLOC_NO_RENAME
+EOF
+
+for nm in `cat ${public_symbols_txt}` ; do
+  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
+  m=`echo ${nm} |tr ':' ' ' |awk '{print $2}'`
+  echo "#  define je_${n} ${m}"
+done
+
+cat <<EOF
+#endif
+EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
new file mode 100644
index 00000000..1a588743
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
@@ -0,0 +1,77 @@
+typedef struct extent_hooks_s extent_hooks_t;
+
+/*
+ * void *
+ * extent_alloc(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
+ *     size_t alignment, bool *zero, bool *commit, unsigned arena_ind);
+ */
+typedef void *(extent_alloc_t)(extent_hooks_t *, void *, size_t, size_t, bool *,
+    bool *, unsigned);
+
+/*
+ * bool
+ * extent_dalloc(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     bool committed, unsigned arena_ind);
+ */
+typedef bool (extent_dalloc_t)(extent_hooks_t *, void *, size_t, bool,
+    unsigned);
+
+/*
+ * void
+ * extent_destroy(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     bool committed, unsigned arena_ind);
+ */
+typedef void (extent_destroy_t)(extent_hooks_t *, void *, size_t, bool,
+    unsigned);
+
+/*
+ * bool
+ * extent_commit(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     size_t offset, size_t length, unsigned arena_ind);
+ */
+typedef bool (extent_commit_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
+    unsigned);
+
+/*
+ * bool
+ * extent_decommit(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     size_t offset, size_t length, unsigned arena_ind);
+ */
+typedef bool (extent_decommit_t)(extent_hooks_t *, void *, size_t, size_t,
+    size_t, unsigned);
+
+/*
+ * bool
+ * extent_purge(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     size_t offset, size_t length, unsigned arena_ind);
+ */
+typedef bool (extent_purge_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
+    unsigned);
+
+/*
+ * bool
+ * extent_split(extent_hooks_t *extent_hooks, void *addr, size_t size,
+ *     size_t size_a, size_t size_b, bool committed, unsigned arena_ind);
+ */
+typedef bool (extent_split_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
+    bool, unsigned);
+
+/*
+ * bool
+ * extent_merge(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
+ *     void *addr_b, size_t size_b, bool committed, unsigned arena_ind);
+ */
+typedef bool (extent_merge_t)(extent_hooks_t *, void *, size_t, void *, size_t,
+    bool, unsigned);
+
+struct extent_hooks_s {
+	extent_alloc_t		*alloc;
+	extent_dalloc_t		*dalloc;
+	extent_destroy_t	*destroy;
+	extent_commit_t		*commit;
+	extent_decommit_t	*decommit;
+	extent_purge_t		*purge_lazy;
+	extent_purge_t		*purge_forced;
+	extent_split_t		*split;
+	extent_merge_t		*merge;
+};
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
new file mode 100644
index 00000000..d92160eb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
@@ -0,0 +1,20 @@
+#ifndef stdbool_h
+#define stdbool_h
+
+#include <wtypes.h>
+
+/* MSVC doesn't define _Bool or bool in C, but does have BOOL */
+/* Note this doesn't pass autoconf's test because (bool) 0.5 != true */
+/* Clang-cl uses MSVC headers, so needs msvc_compat, but has _Bool as
+ * a built-in type. */
+#ifndef __clang__
+typedef BOOL _Bool;
+#endif
+
+#define bool _Bool
+#define true 1
+#define false 0
+
+#define __bool_true_false_are_defined 1
+
+#endif /* stdbool_h */
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
new file mode 100644
index 00000000..d02608a5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
@@ -0,0 +1,247 @@
+// ISO C9x  compliant stdint.h for Microsoft Visual Studio
+// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124 
+// 
+//  Copyright (c) 2006-2008 Alexander Chemeris
+// 
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//   1. Redistributions of source code must retain the above copyright notice,
+//      this list of conditions and the following disclaimer.
+// 
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+// 
+//   3. The name of the author may be used to endorse or promote products
+//      derived from this software without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+#ifndef _MSC_VER // [
+#error "Use this header only with Microsoft Visual C++ compilers!"
+#endif // _MSC_VER ]
+
+#ifndef _MSC_STDINT_H_ // [
+#define _MSC_STDINT_H_
+
+#if _MSC_VER > 1000
+#pragma once
+#endif
+
+#include <limits.h>
+
+// For Visual Studio 6 in C++ mode and for many Visual Studio versions when
+// compiling for ARM we should wrap <wchar.h> include with 'extern "C++" {}'
+// or compiler give many errors like this:
+//   error C2733: second C linkage of overloaded function 'wmemchr' not allowed
+#ifdef __cplusplus
+extern "C" {
+#endif
+#  include <wchar.h>
+#ifdef __cplusplus
+}
+#endif
+
+// Define _W64 macros to mark types changing their size, like intptr_t.
+#ifndef _W64
+#  if !defined(__midl) && (defined(_X86_) || defined(_M_IX86)) && _MSC_VER >= 1300
+#     define _W64 __w64
+#  else
+#     define _W64
+#  endif
+#endif
+
+
+// 7.18.1 Integer types
+
+// 7.18.1.1 Exact-width integer types
+
+// Visual Studio 6 and Embedded Visual C++ 4 doesn't
+// realize that, e.g. char has the same size as __int8
+// so we give up on __intX for them.
+#if (_MSC_VER < 1300)
+   typedef signed char       int8_t;
+   typedef signed short      int16_t;
+   typedef signed int        int32_t;
+   typedef unsigned char     uint8_t;
+   typedef unsigned short    uint16_t;
+   typedef unsigned int      uint32_t;
+#else
+   typedef signed __int8     int8_t;
+   typedef signed __int16    int16_t;
+   typedef signed __int32    int32_t;
+   typedef unsigned __int8   uint8_t;
+   typedef unsigned __int16  uint16_t;
+   typedef unsigned __int32  uint32_t;
+#endif
+typedef signed __int64       int64_t;
+typedef unsigned __int64     uint64_t;
+
+
+// 7.18.1.2 Minimum-width integer types
+typedef int8_t    int_least8_t;
+typedef int16_t   int_least16_t;
+typedef int32_t   int_least32_t;
+typedef int64_t   int_least64_t;
+typedef uint8_t   uint_least8_t;
+typedef uint16_t  uint_least16_t;
+typedef uint32_t  uint_least32_t;
+typedef uint64_t  uint_least64_t;
+
+// 7.18.1.3 Fastest minimum-width integer types
+typedef int8_t    int_fast8_t;
+typedef int16_t   int_fast16_t;
+typedef int32_t   int_fast32_t;
+typedef int64_t   int_fast64_t;
+typedef uint8_t   uint_fast8_t;
+typedef uint16_t  uint_fast16_t;
+typedef uint32_t  uint_fast32_t;
+typedef uint64_t  uint_fast64_t;
+
+// 7.18.1.4 Integer types capable of holding object pointers
+#ifdef _WIN64 // [
+   typedef signed __int64    intptr_t;
+   typedef unsigned __int64  uintptr_t;
+#else // _WIN64 ][
+   typedef _W64 signed int   intptr_t;
+   typedef _W64 unsigned int uintptr_t;
+#endif // _WIN64 ]
+
+// 7.18.1.5 Greatest-width integer types
+typedef int64_t   intmax_t;
+typedef uint64_t  uintmax_t;
+
+
+// 7.18.2 Limits of specified-width integer types
+
+#if !defined(__cplusplus) || defined(__STDC_LIMIT_MACROS) // [   See footnote 220 at page 257 and footnote 221 at page 259
+
+// 7.18.2.1 Limits of exact-width integer types
+#define INT8_MIN     ((int8_t)_I8_MIN)
+#define INT8_MAX     _I8_MAX
+#define INT16_MIN    ((int16_t)_I16_MIN)
+#define INT16_MAX    _I16_MAX
+#define INT32_MIN    ((int32_t)_I32_MIN)
+#define INT32_MAX    _I32_MAX
+#define INT64_MIN    ((int64_t)_I64_MIN)
+#define INT64_MAX    _I64_MAX
+#define UINT8_MAX    _UI8_MAX
+#define UINT16_MAX   _UI16_MAX
+#define UINT32_MAX   _UI32_MAX
+#define UINT64_MAX   _UI64_MAX
+
+// 7.18.2.2 Limits of minimum-width integer types
+#define INT_LEAST8_MIN    INT8_MIN
+#define INT_LEAST8_MAX    INT8_MAX
+#define INT_LEAST16_MIN   INT16_MIN
+#define INT_LEAST16_MAX   INT16_MAX
+#define INT_LEAST32_MIN   INT32_MIN
+#define INT_LEAST32_MAX   INT32_MAX
+#define INT_LEAST64_MIN   INT64_MIN
+#define INT_LEAST64_MAX   INT64_MAX
+#define UINT_LEAST8_MAX   UINT8_MAX
+#define UINT_LEAST16_MAX  UINT16_MAX
+#define UINT_LEAST32_MAX  UINT32_MAX
+#define UINT_LEAST64_MAX  UINT64_MAX
+
+// 7.18.2.3 Limits of fastest minimum-width integer types
+#define INT_FAST8_MIN    INT8_MIN
+#define INT_FAST8_MAX    INT8_MAX
+#define INT_FAST16_MIN   INT16_MIN
+#define INT_FAST16_MAX   INT16_MAX
+#define INT_FAST32_MIN   INT32_MIN
+#define INT_FAST32_MAX   INT32_MAX
+#define INT_FAST64_MIN   INT64_MIN
+#define INT_FAST64_MAX   INT64_MAX
+#define UINT_FAST8_MAX   UINT8_MAX
+#define UINT_FAST16_MAX  UINT16_MAX
+#define UINT_FAST32_MAX  UINT32_MAX
+#define UINT_FAST64_MAX  UINT64_MAX
+
+// 7.18.2.4 Limits of integer types capable of holding object pointers
+#ifdef _WIN64 // [
+#  define INTPTR_MIN   INT64_MIN
+#  define INTPTR_MAX   INT64_MAX
+#  define UINTPTR_MAX  UINT64_MAX
+#else // _WIN64 ][
+#  define INTPTR_MIN   INT32_MIN
+#  define INTPTR_MAX   INT32_MAX
+#  define UINTPTR_MAX  UINT32_MAX
+#endif // _WIN64 ]
+
+// 7.18.2.5 Limits of greatest-width integer types
+#define INTMAX_MIN   INT64_MIN
+#define INTMAX_MAX   INT64_MAX
+#define UINTMAX_MAX  UINT64_MAX
+
+// 7.18.3 Limits of other integer types
+
+#ifdef _WIN64 // [
+#  define PTRDIFF_MIN  _I64_MIN
+#  define PTRDIFF_MAX  _I64_MAX
+#else  // _WIN64 ][
+#  define PTRDIFF_MIN  _I32_MIN
+#  define PTRDIFF_MAX  _I32_MAX
+#endif  // _WIN64 ]
+
+#define SIG_ATOMIC_MIN  INT_MIN
+#define SIG_ATOMIC_MAX  INT_MAX
+
+#ifndef SIZE_MAX // [
+#  ifdef _WIN64 // [
+#     define SIZE_MAX  _UI64_MAX
+#  else // _WIN64 ][
+#     define SIZE_MAX  _UI32_MAX
+#  endif // _WIN64 ]
+#endif // SIZE_MAX ]
+
+// WCHAR_MIN and WCHAR_MAX are also defined in <wchar.h>
+#ifndef WCHAR_MIN // [
+#  define WCHAR_MIN  0
+#endif  // WCHAR_MIN ]
+#ifndef WCHAR_MAX // [
+#  define WCHAR_MAX  _UI16_MAX
+#endif  // WCHAR_MAX ]
+
+#define WINT_MIN  0
+#define WINT_MAX  _UI16_MAX
+
+#endif // __STDC_LIMIT_MACROS ]
+
+
+// 7.18.4 Limits of other integer types
+
+#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [   See footnote 224 at page 260
+
+// 7.18.4.1 Macros for minimum-width integer constants
+
+#define INT8_C(val)  val##i8
+#define INT16_C(val) val##i16
+#define INT32_C(val) val##i32
+#define INT64_C(val) val##i64
+
+#define UINT8_C(val)  val##ui8
+#define UINT16_C(val) val##ui16
+#define UINT32_C(val) val##ui32
+#define UINT64_C(val) val##ui64
+
+// 7.18.4.2 Macros for greatest-width integer constants
+#define INTMAX_C   INT64_C
+#define UINTMAX_C  UINT64_C
+
+#endif // __STDC_CONSTANT_MACROS ]
+
+
+#endif // _MSC_STDINT_H_ ]
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/strings.h b/redis-stable/deps/jemalloc/include/msvc_compat/strings.h
new file mode 100644
index 00000000..996f256c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/msvc_compat/strings.h
@@ -0,0 +1,58 @@
+#ifndef strings_h
+#define strings_h
+
+/* MSVC doesn't define ffs/ffsl. This dummy strings.h header is provided
+ * for both */
+#ifdef _MSC_VER
+#  include <intrin.h>
+#  pragma intrinsic(_BitScanForward)
+static __forceinline int ffsl(long x) {
+	unsigned long i;
+
+	if (_BitScanForward(&i, x)) {
+		return i + 1;
+	}
+	return 0;
+}
+
+static __forceinline int ffs(int x) {
+	return ffsl(x);
+}
+
+#  ifdef  _M_X64
+#    pragma intrinsic(_BitScanForward64)
+#  endif
+
+static __forceinline int ffsll(unsigned __int64 x) {
+	unsigned long i;
+#ifdef  _M_X64
+	if (_BitScanForward64(&i, x)) {
+		return i + 1;
+	}
+	return 0;
+#else
+// Fallback for 32-bit build where 64-bit version not available
+// assuming little endian
+	union {
+		unsigned __int64 ll;
+		unsigned   long l[2];
+	} s;
+
+	s.ll = x;
+
+	if (_BitScanForward(&i, s.l[0])) {
+		return i + 1;
+	} else if(_BitScanForward(&i, s.l[1])) {
+		return i + 33;
+	}
+	return 0;
+#endif
+}
+
+#else
+#  define ffsll(x) __builtin_ffsll(x)
+#  define ffsl(x) __builtin_ffsl(x)
+#  define ffs(x) __builtin_ffs(x)
+#endif
+
+#endif /* strings_h */
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h b/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
new file mode 100644
index 00000000..a6ebb930
--- /dev/null
+++ b/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
@@ -0,0 +1,6 @@
+#ifndef MSVC_COMPAT_WINDOWS_EXTRA_H
+#define MSVC_COMPAT_WINDOWS_EXTRA_H
+
+#include <errno.h>
+
+#endif /* MSVC_COMPAT_WINDOWS_EXTRA_H */
diff --git a/redis-stable/deps/jemalloc/jemalloc.pc.in b/redis-stable/deps/jemalloc/jemalloc.pc.in
new file mode 100644
index 00000000..c428a86d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/jemalloc.pc.in
@@ -0,0 +1,12 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+install_suffix=@install_suffix@
+
+Name: jemalloc
+Description: A general purpose malloc(3) implementation that emphasizes fragmentation avoidance and scalable concurrency support.
+URL: http://jemalloc.net/
+Version: @jemalloc_version_major@.@jemalloc_version_minor@.@jemalloc_version_bugfix@_@jemalloc_version_nrev@
+Cflags: -I${includedir}
+Libs: -L${libdir} -ljemalloc${install_suffix}
diff --git a/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4 b/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
new file mode 100644
index 00000000..2c18e49c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
@@ -0,0 +1,562 @@
+# ===========================================================================
+#   http://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional])
+#
+# DESCRIPTION
+#
+#   Check for baseline language coverage in the compiler for the specified
+#   version of the C++ standard.  If necessary, add switches to CXX and
+#   CXXCPP to enable support.  VERSION may be '11' (for the C++11 standard)
+#   or '14' (for the C++14 standard).
+#
+#   The second argument, if specified, indicates whether you insist on an
+#   extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g.
+#   -std=c++11).  If neither is specified, you get whatever works, with
+#   preference for an extended mode.
+#
+#   The third argument, if specified 'mandatory' or if left unspecified,
+#   indicates that baseline support for the specified C++ standard is
+#   required and that the macro should error out if no mode with that
+#   support is found.  If specified 'optional', then configuration proceeds
+#   regardless, after defining HAVE_CXX${VERSION} if and only if a
+#   supporting mode is found.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Benjamin Kosnik <bkoz@redhat.com>
+#   Copyright (c) 2012 Zack Weinberg <zackw@panix.com>
+#   Copyright (c) 2013 Roy Stogner <roystgnr@ices.utexas.edu>
+#   Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov <sokolov@google.com>
+#   Copyright (c) 2015 Paul Norman <penorman@mac.com>
+#   Copyright (c) 2015 Moritz Klammler <moritz@klammler.eu>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved.  This file is offered as-is, without any
+#   warranty.
+
+#serial 4
+
+dnl  This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro
+dnl  (serial version number 13).
+
+AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl
+  m4_if([$1], [11], [],
+        [$1], [14], [],
+        [$1], [17], [m4_fatal([support for C++17 not yet implemented in AX_CXX_COMPILE_STDCXX])],
+        [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl
+  m4_if([$2], [], [],
+        [$2], [ext], [],
+        [$2], [noext], [],
+        [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl
+  m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true],
+        [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true],
+        [$3], [optional], [ax_cxx_compile_cxx$1_required=false],
+        [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])])
+  AC_LANG_PUSH([C++])dnl
+  ac_success=no
+  AC_CACHE_CHECK(whether $CXX supports C++$1 features by default,
+  ax_cv_cxx_compile_cxx$1,
+  [AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
+    [ax_cv_cxx_compile_cxx$1=yes],
+    [ax_cv_cxx_compile_cxx$1=no])])
+  if test x$ax_cv_cxx_compile_cxx$1 = xyes; then
+    ac_success=yes
+  fi
+
+  m4_if([$2], [noext], [], [dnl
+  if test x$ac_success = xno; then
+    for switch in -std=gnu++$1 -std=gnu++0x; do
+      cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
+      AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
+                     $cachevar,
+        [ac_save_CXX="$CXX"
+         CXX="$CXX $switch"
+         AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
+          [eval $cachevar=yes],
+          [eval $cachevar=no])
+         CXX="$ac_save_CXX"])
+      if eval test x\$$cachevar = xyes; then
+        CXX="$CXX $switch"
+        if test -n "$CXXCPP" ; then
+          CXXCPP="$CXXCPP $switch"
+        fi
+        ac_success=yes
+        break
+      fi
+    done
+  fi])
+
+  m4_if([$2], [ext], [], [dnl
+  if test x$ac_success = xno; then
+    dnl HP's aCC needs +std=c++11 according to:
+    dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf
+    dnl Cray's crayCC needs "-h std=c++11"
+    for switch in -std=c++$1 -std=c++0x +std=c++$1 "-h std=c++$1"; do
+      cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
+      AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
+                     $cachevar,
+        [ac_save_CXX="$CXX"
+         CXX="$CXX $switch"
+         AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
+          [eval $cachevar=yes],
+          [eval $cachevar=no])
+         CXX="$ac_save_CXX"])
+      if eval test x\$$cachevar = xyes; then
+        CXX="$CXX $switch"
+        if test -n "$CXXCPP" ; then
+          CXXCPP="$CXXCPP $switch"
+        fi
+        ac_success=yes
+        break
+      fi
+    done
+  fi])
+  AC_LANG_POP([C++])
+  if test x$ax_cxx_compile_cxx$1_required = xtrue; then
+    if test x$ac_success = xno; then
+      AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.])
+    fi
+  fi
+  if test x$ac_success = xno; then
+    HAVE_CXX$1=0
+    AC_MSG_NOTICE([No compiler with C++$1 support was found])
+  else
+    HAVE_CXX$1=1
+    AC_DEFINE(HAVE_CXX$1,1,
+              [define if the compiler supports basic C++$1 syntax])
+  fi
+  AC_SUBST(HAVE_CXX$1)
+])
+
+
+dnl  Test body for checking C++11 support
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11],
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
+)
+
+
+dnl  Test body for checking C++14 support
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14],
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_14
+)
+
+
+dnl  Tests for new features in C++11
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[
+
+// If the compiler admits that it is not ready for C++11, why torture it?
+// Hopefully, this will speed up the test.
+
+#ifndef __cplusplus
+
+#error "This is not a C++ compiler"
+
+#elif __cplusplus < 201103L
+
+#error "This is not a C++11 compiler"
+
+#else
+
+namespace cxx11
+{
+
+  namespace test_static_assert
+  {
+
+    template <typename T>
+    struct check
+    {
+      static_assert(sizeof(int) <= sizeof(T), "not big enough");
+    };
+
+  }
+
+  namespace test_final_override
+  {
+
+    struct Base
+    {
+      virtual void f() {}
+    };
+
+    struct Derived : public Base
+    {
+      virtual void f() override {}
+    };
+
+  }
+
+  namespace test_double_right_angle_brackets
+  {
+
+    template < typename T >
+    struct check {};
+
+    typedef check<void> single_type;
+    typedef check<check<void>> double_type;
+    typedef check<check<check<void>>> triple_type;
+    typedef check<check<check<check<void>>>> quadruple_type;
+
+  }
+
+  namespace test_decltype
+  {
+
+    int
+    f()
+    {
+      int a = 1;
+      decltype(a) b = 2;
+      return a + b;
+    }
+
+  }
+
+  namespace test_type_deduction
+  {
+
+    template < typename T1, typename T2 >
+    struct is_same
+    {
+      static const bool value = false;
+    };
+
+    template < typename T >
+    struct is_same<T, T>
+    {
+      static const bool value = true;
+    };
+
+    template < typename T1, typename T2 >
+    auto
+    add(T1 a1, T2 a2) -> decltype(a1 + a2)
+    {
+      return a1 + a2;
+    }
+
+    int
+    test(const int c, volatile int v)
+    {
+      static_assert(is_same<int, decltype(0)>::value == true, "");
+      static_assert(is_same<int, decltype(c)>::value == false, "");
+      static_assert(is_same<int, decltype(v)>::value == false, "");
+      auto ac = c;
+      auto av = v;
+      auto sumi = ac + av + 'x';
+      auto sumf = ac + av + 1.0;
+      static_assert(is_same<int, decltype(ac)>::value == true, "");
+      static_assert(is_same<int, decltype(av)>::value == true, "");
+      static_assert(is_same<int, decltype(sumi)>::value == true, "");
+      static_assert(is_same<int, decltype(sumf)>::value == false, "");
+      static_assert(is_same<int, decltype(add(c, v))>::value == true, "");
+      return (sumf > 0.0) ? sumi : add(c, v);
+    }
+
+  }
+
+  namespace test_noexcept
+  {
+
+    int f() { return 0; }
+    int g() noexcept { return 0; }
+
+    static_assert(noexcept(f()) == false, "");
+    static_assert(noexcept(g()) == true, "");
+
+  }
+
+  namespace test_constexpr
+  {
+
+    template < typename CharT >
+    unsigned long constexpr
+    strlen_c_r(const CharT *const s, const unsigned long acc) noexcept
+    {
+      return *s ? strlen_c_r(s + 1, acc + 1) : acc;
+    }
+
+    template < typename CharT >
+    unsigned long constexpr
+    strlen_c(const CharT *const s) noexcept
+    {
+      return strlen_c_r(s, 0UL);
+    }
+
+    static_assert(strlen_c("") == 0UL, "");
+    static_assert(strlen_c("1") == 1UL, "");
+    static_assert(strlen_c("example") == 7UL, "");
+    static_assert(strlen_c("another\0example") == 7UL, "");
+
+  }
+
+  namespace test_rvalue_references
+  {
+
+    template < int N >
+    struct answer
+    {
+      static constexpr int value = N;
+    };
+
+    answer<1> f(int&)       { return answer<1>(); }
+    answer<2> f(const int&) { return answer<2>(); }
+    answer<3> f(int&&)      { return answer<3>(); }
+
+    void
+    test()
+    {
+      int i = 0;
+      const int c = 0;
+      static_assert(decltype(f(i))::value == 1, "");
+      static_assert(decltype(f(c))::value == 2, "");
+      static_assert(decltype(f(0))::value == 3, "");
+    }
+
+  }
+
+  namespace test_uniform_initialization
+  {
+
+    struct test
+    {
+      static const int zero {};
+      static const int one {1};
+    };
+
+    static_assert(test::zero == 0, "");
+    static_assert(test::one == 1, "");
+
+  }
+
+  namespace test_lambdas
+  {
+
+    void
+    test1()
+    {
+      auto lambda1 = [](){};
+      auto lambda2 = lambda1;
+      lambda1();
+      lambda2();
+    }
+
+    int
+    test2()
+    {
+      auto a = [](int i, int j){ return i + j; }(1, 2);
+      auto b = []() -> int { return '0'; }();
+      auto c = [=](){ return a + b; }();
+      auto d = [&](){ return c; }();
+      auto e = [a, &b](int x) mutable {
+        const auto identity = [](int y){ return y; };
+        for (auto i = 0; i < a; ++i)
+          a += b--;
+        return x + identity(a + b);
+      }(0);
+      return a + b + c + d + e;
+    }
+
+    int
+    test3()
+    {
+      const auto nullary = [](){ return 0; };
+      const auto unary = [](int x){ return x; };
+      using nullary_t = decltype(nullary);
+      using unary_t = decltype(unary);
+      const auto higher1st = [](nullary_t f){ return f(); };
+      const auto higher2nd = [unary](nullary_t f1){
+        return [unary, f1](unary_t f2){ return f2(unary(f1())); };
+      };
+      return higher1st(nullary) + higher2nd(nullary)(unary);
+    }
+
+  }
+
+  namespace test_variadic_templates
+  {
+
+    template <int...>
+    struct sum;
+
+    template <int N0, int... N1toN>
+    struct sum<N0, N1toN...>
+    {
+      static constexpr auto value = N0 + sum<N1toN...>::value;
+    };
+
+    template <>
+    struct sum<>
+    {
+      static constexpr auto value = 0;
+    };
+
+    static_assert(sum<>::value == 0, "");
+    static_assert(sum<1>::value == 1, "");
+    static_assert(sum<23>::value == 23, "");
+    static_assert(sum<1, 2>::value == 3, "");
+    static_assert(sum<5, 5, 11>::value == 21, "");
+    static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, "");
+
+  }
+
+  // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae
+  // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function
+  // because of this.
+  namespace test_template_alias_sfinae
+  {
+
+    struct foo {};
+
+    template<typename T>
+    using member = typename T::member_type;
+
+    template<typename T>
+    void func(...) {}
+
+    template<typename T>
+    void func(member<T>*) {}
+
+    void test();
+
+    void test() { func<foo>(0); }
+
+  }
+
+}  // namespace cxx11
+
+#endif  // __cplusplus >= 201103L
+
+]])
+
+
+dnl  Tests for new features in C++14
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[
+
+// If the compiler admits that it is not ready for C++14, why torture it?
+// Hopefully, this will speed up the test.
+
+#ifndef __cplusplus
+
+#error "This is not a C++ compiler"
+
+#elif __cplusplus < 201402L
+
+#error "This is not a C++14 compiler"
+
+#else
+
+namespace cxx14
+{
+
+  namespace test_polymorphic_lambdas
+  {
+
+    int
+    test()
+    {
+      const auto lambda = [](auto&&... args){
+        const auto istiny = [](auto x){
+          return (sizeof(x) == 1UL) ? 1 : 0;
+        };
+        const int aretiny[] = { istiny(args)... };
+        return aretiny[0];
+      };
+      return lambda(1, 1L, 1.0f, '1');
+    }
+
+  }
+
+  namespace test_binary_literals
+  {
+
+    constexpr auto ivii = 0b0000000000101010;
+    static_assert(ivii == 42, "wrong value");
+
+  }
+
+  namespace test_generalized_constexpr
+  {
+
+    template < typename CharT >
+    constexpr unsigned long
+    strlen_c(const CharT *const s) noexcept
+    {
+      auto length = 0UL;
+      for (auto p = s; *p; ++p)
+        ++length;
+      return length;
+    }
+
+    static_assert(strlen_c("") == 0UL, "");
+    static_assert(strlen_c("x") == 1UL, "");
+    static_assert(strlen_c("test") == 4UL, "");
+    static_assert(strlen_c("another\0test") == 7UL, "");
+
+  }
+
+  namespace test_lambda_init_capture
+  {
+
+    int
+    test()
+    {
+      auto x = 0;
+      const auto lambda1 = [a = x](int b){ return a + b; };
+      const auto lambda2 = [a = lambda1(x)](){ return a; };
+      return lambda2();
+    }
+
+  }
+
+  namespace test_digit_seperators
+  {
+
+    constexpr auto ten_million = 100'000'000;
+    static_assert(ten_million == 100000000, "");
+
+  }
+
+  namespace test_return_type_deduction
+  {
+
+    auto f(int& x) { return x; }
+    decltype(auto) g(int& x) { return x; }
+
+    template < typename T1, typename T2 >
+    struct is_same
+    {
+      static constexpr auto value = false;
+    };
+
+    template < typename T >
+    struct is_same<T, T>
+    {
+      static constexpr auto value = true;
+    };
+
+    int
+    test()
+    {
+      auto x = 0;
+      static_assert(is_same<int, decltype(f(x))>::value, "");
+      static_assert(is_same<int&, decltype(g(x))>::value, "");
+      return x;
+    }
+
+  }
+
+}  // namespace cxx14
+
+#endif  // __cplusplus >= 201402L
+
+]])
diff --git a/redis-stable/deps/jemalloc/msvc/ReadMe.txt b/redis-stable/deps/jemalloc/msvc/ReadMe.txt
new file mode 100644
index 00000000..633a7d49
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/ReadMe.txt
@@ -0,0 +1,23 @@
+
+How to build jemalloc for Windows
+=================================
+
+1. Install Cygwin with at least the following packages:
+   * autoconf
+   * autogen
+   * gawk
+   * grep
+   * sed
+
+2. Install Visual Studio 2015 or 2017 with Visual C++
+
+3. Add Cygwin\bin to the PATH environment variable
+
+4. Open "x64 Native Tools Command Prompt for VS 2017"
+   (note: x86/x64 doesn't matter at this point)
+
+5. Generate header files:
+   sh -c "CC=cl ./autogen.sh"
+
+6. Now the project can be opened and built in Visual Studio:
+   msvc\jemalloc_vc2017.sln
diff --git a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
new file mode 100644
index 00000000..aedd5e5e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
@@ -0,0 +1,63 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 14
+VisualStudioVersion = 14.0.24720.0
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{70A99006-6DE9-472B-8F83-4CEE6C616DF3}"
+	ProjectSection(SolutionItems) = preProject
+		ReadMe.txt = ReadMe.txt
+	EndProjectSection
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "jemalloc", "projects\vc2015\jemalloc\jemalloc.vcxproj", "{8D6BB292-9E1C-413D-9F98-4864BDC1514A}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_threads", "projects\vc2015\test_threads\test_threads.vcxproj", "{09028CFD-4EB7-491D-869C-0708DB97ED44}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Debug-static|x64 = Debug-static|x64
+		Debug-static|x86 = Debug-static|x86
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+		Release-static|x64 = Release-static|x64
+		Release-static|x86 = Release-static|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.ActiveCfg = Debug|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.Build.0 = Debug|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.ActiveCfg = Debug|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.Build.0 = Debug|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.ActiveCfg = Debug-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.Build.0 = Debug-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.ActiveCfg = Debug-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.Build.0 = Debug-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.ActiveCfg = Release|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.Build.0 = Release|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.ActiveCfg = Release|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.Build.0 = Release|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.ActiveCfg = Release-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.Build.0 = Release-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.ActiveCfg = Release-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.Build.0 = Release-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.ActiveCfg = Debug|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.Build.0 = Debug|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.ActiveCfg = Debug|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.Build.0 = Debug|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.ActiveCfg = Debug-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.Build.0 = Debug-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.ActiveCfg = Debug-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.Build.0 = Debug-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.ActiveCfg = Release|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.Build.0 = Release|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.ActiveCfg = Release|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.Build.0 = Release|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.ActiveCfg = Release-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.Build.0 = Release-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.ActiveCfg = Release-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.Build.0 = Release-static|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
new file mode 100644
index 00000000..c22fcb43
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
@@ -0,0 +1,63 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 14
+VisualStudioVersion = 14.0.24720.0
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{70A99006-6DE9-472B-8F83-4CEE6C616DF3}"
+	ProjectSection(SolutionItems) = preProject
+		ReadMe.txt = ReadMe.txt
+	EndProjectSection
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "jemalloc", "projects\vc2017\jemalloc\jemalloc.vcxproj", "{8D6BB292-9E1C-413D-9F98-4864BDC1514A}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_threads", "projects\vc2017\test_threads\test_threads.vcxproj", "{09028CFD-4EB7-491D-869C-0708DB97ED44}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Debug-static|x64 = Debug-static|x64
+		Debug-static|x86 = Debug-static|x86
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+		Release-static|x64 = Release-static|x64
+		Release-static|x86 = Release-static|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.ActiveCfg = Debug|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.Build.0 = Debug|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.ActiveCfg = Debug|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.Build.0 = Debug|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.ActiveCfg = Debug-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.Build.0 = Debug-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.ActiveCfg = Debug-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.Build.0 = Debug-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.ActiveCfg = Release|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.Build.0 = Release|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.ActiveCfg = Release|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.Build.0 = Release|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.ActiveCfg = Release-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.Build.0 = Release-static|x64
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.ActiveCfg = Release-static|Win32
+		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.Build.0 = Release-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.ActiveCfg = Debug|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.Build.0 = Debug|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.ActiveCfg = Debug|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.Build.0 = Debug|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.ActiveCfg = Debug-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.Build.0 = Debug-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.ActiveCfg = Debug-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.Build.0 = Debug-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.ActiveCfg = Release|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.Build.0 = Release|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.ActiveCfg = Release|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.Build.0 = Release|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.ActiveCfg = Release-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.Build.0 = Release-static|x64
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.ActiveCfg = Release-static|Win32
+		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.Build.0 = Release-static|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
new file mode 100644
index 00000000..f7b175b0
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
@@ -0,0 +1,348 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug-static|Win32">
+      <Configuration>Debug-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug-static|x64">
+      <Configuration>Debug-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|Win32">
+      <Configuration>Release-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|x64">
+      <Configuration>Release-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\..\src\arena.c" />
+    <ClCompile Include="..\..\..\..\src\background_thread.c" />
+    <ClCompile Include="..\..\..\..\src\base.c" />
+    <ClCompile Include="..\..\..\..\src\bin.c" />
+    <ClCompile Include="..\..\..\..\src\bitmap.c" />
+    <ClCompile Include="..\..\..\..\src\ckh.c" />
+    <ClCompile Include="..\..\..\..\src\ctl.c" />
+    <ClCompile Include="..\..\..\..\src\div.c" />
+    <ClCompile Include="..\..\..\..\src\extent.c" />
+    <ClCompile Include="..\..\..\..\src\extent_dss.c" />
+    <ClCompile Include="..\..\..\..\src\extent_mmap.c" />
+    <ClCompile Include="..\..\..\..\src\hash.c" />
+    <ClCompile Include="..\..\..\..\src\hooks.c" />
+    <ClCompile Include="..\..\..\..\src\jemalloc.c" />
+    <ClCompile Include="..\..\..\..\src\large.c" />
+    <ClCompile Include="..\..\..\..\src\log.c" />
+    <ClCompile Include="..\..\..\..\src\malloc_io.c" />
+    <ClCompile Include="..\..\..\..\src\mutex.c" />
+    <ClCompile Include="..\..\..\..\src\mutex_pool.c" />
+    <ClCompile Include="..\..\..\..\src\nstime.c" />
+    <ClCompile Include="..\..\..\..\src\pages.c" />
+    <ClCompile Include="..\..\..\..\src\prng.c" />
+    <ClCompile Include="..\..\..\..\src\prof.c" />
+    <ClCompile Include="..\..\..\..\src\rtree.c" />
+    <ClCompile Include="..\..\..\..\src\stats.c" />
+    <ClCompile Include="..\..\..\..\src\sz.c" />
+    <ClCompile Include="..\..\..\..\src\tcache.c" />
+    <ClCompile Include="..\..\..\..\src\ticker.c" />
+    <ClCompile Include="..\..\..\..\src\tsd.c" />
+    <ClCompile Include="..\..\..\..\src\witness.c" />
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <ProjectGuid>{8D6BB292-9E1C-413D-9F98-4864BDC1514A}</ProjectGuid>
+    <Keyword>Win32Proj</Keyword>
+    <RootNamespace>jemalloc</RootNamespace>
+    <WindowsTargetPlatformVersion>8.1</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)d</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)d</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <DebugInformationFormat>OldStyle</DebugInformationFormat>
+      <MinimalRebuild>false</MinimalRebuild>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <DebugInformationFormat>OldStyle</DebugInformationFormat>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
new file mode 100644
index 00000000..11cfcd0b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
@@ -0,0 +1,101 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="Source Files">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\..\src\arena.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\background_thread.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\base.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\bitmap.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ckh.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ctl.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent_dss.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent_mmap.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\hash.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\hooks.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\jemalloc.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\large.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\malloc_io.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\mutex.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\mutex_pool.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\nstime.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\pages.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\prng.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\prof.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\rtree.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\stats.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\sz.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\tcache.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ticker.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\tsd.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\witness.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\log.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\bin.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\div.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+  </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
new file mode 100644
index 00000000..325876d6
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
@@ -0,0 +1,327 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug-static|Win32">
+      <Configuration>Debug-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug-static|x64">
+      <Configuration>Debug-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|Win32">
+      <Configuration>Release-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|x64">
+      <Configuration>Release-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <ProjectGuid>{09028CFD-4EB7-491D-869C-0708DB97ED44}</ProjectGuid>
+    <Keyword>Win32Proj</Keyword>
+    <RootNamespace>test_threads</RootNamespace>
+    <WindowsTargetPlatformVersion>8.1</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v140</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <LinkIncremental>true</LinkIncremental>
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <LinkIncremental>true</LinkIncremental>
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\test_threads\test_threads.cpp" />
+    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp" />
+  </ItemGroup>
+  <ItemGroup>
+    <ProjectReference Include="..\jemalloc\jemalloc.vcxproj">
+      <Project>{8d6bb292-9e1c-413d-9f98-4864bdc1514a}</Project>
+    </ProjectReference>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="..\..\..\test_threads\test_threads.h" />
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
new file mode 100644
index 00000000..fa4588fd
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
@@ -0,0 +1,26 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="Source Files">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+    <Filter Include="Header Files">
+      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+      <Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\test_threads\test_threads.cpp">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="..\..\..\test_threads\test_threads.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
+  </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
new file mode 100644
index 00000000..ed71de8a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
@@ -0,0 +1,347 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug-static|Win32">
+      <Configuration>Debug-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug-static|x64">
+      <Configuration>Debug-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|Win32">
+      <Configuration>Release-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|x64">
+      <Configuration>Release-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\..\src\arena.c" />
+    <ClCompile Include="..\..\..\..\src\background_thread.c" />
+    <ClCompile Include="..\..\..\..\src\base.c" />
+    <ClCompile Include="..\..\..\..\src\bin.c" />
+    <ClCompile Include="..\..\..\..\src\bitmap.c" />
+    <ClCompile Include="..\..\..\..\src\ckh.c" />
+    <ClCompile Include="..\..\..\..\src\ctl.c" />
+    <ClCompile Include="..\..\..\..\src\div.c" />
+    <ClCompile Include="..\..\..\..\src\extent.c" />
+    <ClCompile Include="..\..\..\..\src\extent_dss.c" />
+    <ClCompile Include="..\..\..\..\src\extent_mmap.c" />
+    <ClCompile Include="..\..\..\..\src\hash.c" />
+    <ClCompile Include="..\..\..\..\src\hooks.c" />
+    <ClCompile Include="..\..\..\..\src\jemalloc.c" />
+    <ClCompile Include="..\..\..\..\src\large.c" />
+    <ClCompile Include="..\..\..\..\src\log.c" />
+    <ClCompile Include="..\..\..\..\src\malloc_io.c" />
+    <ClCompile Include="..\..\..\..\src\mutex.c" />
+    <ClCompile Include="..\..\..\..\src\mutex_pool.c" />
+    <ClCompile Include="..\..\..\..\src\nstime.c" />
+    <ClCompile Include="..\..\..\..\src\pages.c" />
+    <ClCompile Include="..\..\..\..\src\prng.c" />
+    <ClCompile Include="..\..\..\..\src\prof.c" />
+    <ClCompile Include="..\..\..\..\src\rtree.c" />
+    <ClCompile Include="..\..\..\..\src\stats.c" />
+    <ClCompile Include="..\..\..\..\src\sz.c" />
+    <ClCompile Include="..\..\..\..\src\tcache.c" />
+    <ClCompile Include="..\..\..\..\src\ticker.c" />
+    <ClCompile Include="..\..\..\..\src\tsd.c" />
+    <ClCompile Include="..\..\..\..\src\witness.c" />
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <ProjectGuid>{8D6BB292-9E1C-413D-9F98-4864BDC1514A}</ProjectGuid>
+    <Keyword>Win32Proj</Keyword>
+    <RootNamespace>jemalloc</RootNamespace>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
+    <ConfigurationType>StaticLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)d</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)d</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <DebugInformationFormat>OldStyle</DebugInformationFormat>
+      <MinimalRebuild>false</MinimalRebuild>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
+      <DebugInformationFormat>OldStyle</DebugInformationFormat>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
new file mode 100644
index 00000000..11cfcd0b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
@@ -0,0 +1,101 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="Source Files">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\..\src\arena.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\background_thread.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\base.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\bitmap.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ckh.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ctl.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent_dss.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\extent_mmap.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\hash.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\hooks.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\jemalloc.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\large.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\malloc_io.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\mutex.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\mutex_pool.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\nstime.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\pages.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\prng.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\prof.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\rtree.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\stats.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\sz.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\tcache.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\ticker.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\tsd.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\witness.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\log.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\bin.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\..\src\div.c">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+  </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
new file mode 100644
index 00000000..c35b0f5a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
@@ -0,0 +1,326 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug-static|Win32">
+      <Configuration>Debug-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug-static|x64">
+      <Configuration>Debug-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|Win32">
+      <Configuration>Release-static</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release-static|x64">
+      <Configuration>Release-static</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <ProjectGuid>{09028CFD-4EB7-491D-869C-0708DB97ED44}</ProjectGuid>
+    <Keyword>Win32Proj</Keyword>
+    <RootNamespace>test_threads</RootNamespace>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>MultiByte</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <LinkIncremental>true</LinkIncremental>
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <LinkIncremental>true</LinkIncremental>
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
+    <IntDir>$(Platform)\$(Configuration)\</IntDir>
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
+    <ClCompile>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>
+      </PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
+      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\test_threads\test_threads.cpp" />
+    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp" />
+  </ItemGroup>
+  <ItemGroup>
+    <ProjectReference Include="..\jemalloc\jemalloc.vcxproj">
+      <Project>{8d6bb292-9e1c-413d-9f98-4864bdc1514a}</Project>
+    </ProjectReference>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="..\..\..\test_threads\test_threads.h" />
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
new file mode 100644
index 00000000..fa4588fd
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
@@ -0,0 +1,26 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="Source Files">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+    <Filter Include="Header Files">
+      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+      <Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="..\..\..\test_threads\test_threads.cpp">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp">
+      <Filter>Source Files</Filter>
+    </ClCompile>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="..\..\..\test_threads\test_threads.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
+  </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
new file mode 100644
index 00000000..92e31624
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
@@ -0,0 +1,88 @@
+// jemalloc C++ threaded test
+// Author: Rustam Abdullaev
+// Public Domain
+
+#include <atomic>
+#include <functional>
+#include <future>
+#include <random>
+#include <thread>
+#include <vector>
+#include <stdio.h>
+#include <jemalloc/jemalloc.h>
+
+using std::vector;
+using std::thread;
+using std::uniform_int_distribution;
+using std::minstd_rand;
+
+int test_threads() {
+  je_malloc_conf = "narenas:3";
+  int narenas = 0;
+  size_t sz = sizeof(narenas);
+  je_mallctl("opt.narenas", (void *)&narenas, &sz, NULL, 0);
+  if (narenas != 3) {
+    printf("Error: unexpected number of arenas: %d\n", narenas);
+    return 1;
+  }
+  static const int sizes[] = { 7, 16, 32, 60, 91, 100, 120, 144, 169, 199, 255, 400, 670, 900, 917, 1025, 3333, 5190, 13131, 49192, 99999, 123123, 255265, 2333111 };
+  static const int numSizes = (int)(sizeof(sizes) / sizeof(sizes[0]));
+  vector<thread> workers;
+  static const int numThreads = narenas + 1, numAllocsMax = 25, numIter1 = 50, numIter2 = 50;
+  je_malloc_stats_print(NULL, NULL, NULL);
+  size_t allocated1;
+  size_t sz1 = sizeof(allocated1);
+  je_mallctl("stats.active", (void *)&allocated1, &sz1, NULL, 0);
+  printf("\nPress Enter to start threads...\n");
+  getchar();
+  printf("Starting %d threads x %d x %d iterations...\n", numThreads, numIter1, numIter2);
+  for (int i = 0; i < numThreads; i++) {
+    workers.emplace_back([tid=i]() {
+      uniform_int_distribution<int> sizeDist(0, numSizes - 1);
+      minstd_rand rnd(tid * 17);
+      uint8_t* ptrs[numAllocsMax];
+      int ptrsz[numAllocsMax];
+      for (int i = 0; i < numIter1; ++i) {
+        thread t([&]() {
+          for (int i = 0; i < numIter2; ++i) {
+            const int numAllocs = numAllocsMax - sizeDist(rnd);
+            for (int j = 0; j < numAllocs; j += 64) {
+              const int x = sizeDist(rnd);
+              const int sz = sizes[x];
+              ptrsz[j] = sz;
+              ptrs[j] = (uint8_t*)je_malloc(sz);
+              if (!ptrs[j]) {
+                printf("Unable to allocate %d bytes in thread %d, iter %d, alloc %d. %d\n", sz, tid, i, j, x);
+                exit(1);
+              }
+              for (int k = 0; k < sz; k++)
+                ptrs[j][k] = tid + k;
+            }
+            for (int j = 0; j < numAllocs; j += 64) {
+              for (int k = 0, sz = ptrsz[j]; k < sz; k++)
+                if (ptrs[j][k] != (uint8_t)(tid + k)) {
+                  printf("Memory error in thread %d, iter %d, alloc %d @ %d : %02X!=%02X\n", tid, i, j, k, ptrs[j][k], (uint8_t)(tid + k));
+                  exit(1);
+                }
+              je_free(ptrs[j]);
+            }
+          }
+        });
+        t.join();
+      }
+    });
+  }
+  for (thread& t : workers) {
+    t.join();
+  }
+  je_malloc_stats_print(NULL, NULL, NULL);
+  size_t allocated2;
+  je_mallctl("stats.active", (void *)&allocated2, &sz1, NULL, 0);
+  size_t leaked = allocated2 - allocated1;
+  printf("\nDone. Leaked: %zd bytes\n", leaked);
+  bool failed = leaked > 65536; // in case C++ runtime allocated something (e.g. iostream locale or facet)
+  printf("\nTest %s!\n", (failed ? "FAILED" : "successful"));
+  printf("\nPress Enter to continue...\n");
+  getchar();
+  return failed ? 1 : 0;
+}
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
new file mode 100644
index 00000000..64d0cdb3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
@@ -0,0 +1,3 @@
+#pragma once
+
+int test_threads();
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
new file mode 100644
index 00000000..0a022fba
--- /dev/null
+++ b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
@@ -0,0 +1,11 @@
+#include "test_threads.h"
+#include <future>
+#include <functional>
+#include <chrono>
+
+using namespace std::chrono_literals;
+
+int main(int argc, char** argv) {
+  int rc = test_threads();
+  return rc;
+}
diff --git a/redis-stable/deps/jemalloc/run_tests.sh b/redis-stable/deps/jemalloc/run_tests.sh
new file mode 100755
index 00000000..b434f15b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/run_tests.sh
@@ -0,0 +1 @@
+$(dirname "$)")/scripts/gen_run_tests.py | bash
diff --git a/redis-stable/deps/jemalloc/scripts/gen_run_tests.py b/redis-stable/deps/jemalloc/scripts/gen_run_tests.py
new file mode 100755
index 00000000..a87ecffb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/scripts/gen_run_tests.py
@@ -0,0 +1,112 @@
+#!/usr/bin/env python
+
+import sys
+from itertools import combinations
+from os import uname
+from multiprocessing import cpu_count
+
+# Later, we want to test extended vaddr support.  Apparently, the "real" way of
+# checking this is flaky on OS X.
+bits_64 = sys.maxsize > 2**32
+
+nparallel = cpu_count() * 2
+
+uname = uname()[0]
+
+def powerset(items):
+    result = []
+    for i in xrange(len(items) + 1):
+        result += combinations(items, i)
+    return result
+
+possible_compilers = [('gcc', 'g++'), ('clang', 'clang++')]
+possible_compiler_opts = [
+    '-m32',
+]
+possible_config_opts = [
+    '--enable-debug',
+    '--enable-prof',
+    '--disable-stats',
+]
+if bits_64:
+    possible_config_opts.append('--with-lg-vaddr=56')
+
+possible_malloc_conf_opts = [
+    'tcache:false',
+    'dss:primary',
+    'percpu_arena:percpu',
+    'background_thread:true',
+]
+
+print 'set -e'
+print 'if [ -f Makefile ] ; then make relclean ; fi'
+print 'autoconf'
+print 'rm -rf run_tests.out'
+print 'mkdir run_tests.out'
+print 'cd run_tests.out'
+
+ind = 0
+for cc, cxx in possible_compilers:
+    for compiler_opts in powerset(possible_compiler_opts):
+        for config_opts in powerset(possible_config_opts):
+            for malloc_conf_opts in powerset(possible_malloc_conf_opts):
+                if cc is 'clang' \
+                  and '-m32' in possible_compiler_opts \
+                  and '--enable-prof' in config_opts:
+                    continue
+                config_line = (
+                    'EXTRA_CFLAGS=-Werror EXTRA_CXXFLAGS=-Werror '
+                    + 'CC="{} {}" '.format(cc, " ".join(compiler_opts))
+                    + 'CXX="{} {}" '.format(cxx, " ".join(compiler_opts))
+                    + '../../configure '
+                    + " ".join(config_opts) + (' --with-malloc-conf=' +
+                    ",".join(malloc_conf_opts) if len(malloc_conf_opts) > 0
+                    else '')
+                )
+
+                # We don't want to test large vaddr spaces in 32-bit mode.
+		if ('-m32' in compiler_opts and '--with-lg-vaddr=56' in
+                  config_opts):
+		    continue
+
+                # Per CPU arenas are only supported on Linux.
+                linux_supported = ('percpu_arena:percpu' in malloc_conf_opts \
+                  or 'background_thread:true' in malloc_conf_opts)
+                # Heap profiling and dss are not supported on OS X.
+                darwin_unsupported = ('--enable-prof' in config_opts or \
+                  'dss:primary' in malloc_conf_opts)
+                if (uname == 'Linux' and linux_supported) \
+                  or (not linux_supported and (uname != 'Darwin' or \
+                  not darwin_unsupported)):
+                    print """cat <<EOF > run_test_%(ind)d.sh
+#!/bin/sh
+
+set -e
+
+abort() {
+    echo "==> Error" >> run_test.log
+    echo "Error; see run_tests.out/run_test_%(ind)d.out/run_test.log"
+    exit 255 # Special exit code tells xargs to terminate.
+}
+
+# Environment variables are not supported.
+run_cmd() {
+    echo "==> \$@" >> run_test.log
+    \$@ >> run_test.log 2>&1 || abort
+}
+
+echo "=> run_test_%(ind)d: %(config_line)s"
+mkdir run_test_%(ind)d.out
+cd run_test_%(ind)d.out
+
+echo "==> %(config_line)s" >> run_test.log
+%(config_line)s >> run_test.log 2>&1 || abort
+
+run_cmd make all tests
+run_cmd make check
+run_cmd make distclean
+EOF
+chmod 755 run_test_%(ind)d.sh""" % {'ind': ind, 'config_line': config_line}
+                    ind += 1
+
+print 'for i in `seq 0 %(last_ind)d` ; do echo run_test_${i}.sh ; done | xargs -P %(nparallel)d -n 1 sh' % {'last_ind': ind-1, 'nparallel': nparallel}
diff --git a/redis-stable/deps/jemalloc/scripts/gen_travis.py b/redis-stable/deps/jemalloc/scripts/gen_travis.py
new file mode 100755
index 00000000..6dd39290
--- /dev/null
+++ b/redis-stable/deps/jemalloc/scripts/gen_travis.py
@@ -0,0 +1,107 @@
+#!/usr/bin/env python
+
+from itertools import combinations
+
+travis_template = """\
+language: generic
+
+matrix:
+  include:
+%s
+
+before_script:
+  - autoconf
+  - ./configure ${COMPILER_FLAGS:+ \
+      CC="$CC $COMPILER_FLAGS" \
+      CXX="$CXX $COMPILER_FLAGS" } \
+      $CONFIGURE_FLAGS
+  - make -j3
+  - make -j3 tests
+
+script:
+  - make check
+"""
+
+# The 'default' configuration is gcc, on linux, with no compiler or configure
+# flags.  We also test with clang, -m32, --enable-debug, --enable-prof,
+# --disable-stats, and --with-malloc-conf=tcache:false.  To avoid abusing
+# travis though, we don't test all 2**7 = 128 possible combinations of these;
+# instead, we only test combinations of up to 2 'unusual' settings, under the
+# hope that bugs involving interactions of such settings are rare.
+# Things at once, for C(7, 0) + C(7, 1) + C(7, 2) = 29
+MAX_UNUSUAL_OPTIONS = 2
+
+os_default = 'linux'
+os_unusual = 'osx'
+
+compilers_default = 'CC=gcc CXX=g++'
+compilers_unusual = 'CC=clang CXX=clang++'
+
+compiler_flag_unusuals = ['-m32']
+
+configure_flag_unusuals = [
+    '--enable-debug',
+    '--enable-prof',
+    '--disable-stats',
+]
+
+malloc_conf_unusuals = [
+    'tcache:false',
+    'dss:primary',
+    'percpu_arena:percpu',
+    'background_thread:true',
+]
+
+all_unusuals = (
+    [os_unusual] + [compilers_unusual] + compiler_flag_unusuals
+    + configure_flag_unusuals + malloc_conf_unusuals
+)
+
+unusual_combinations_to_test = []
+for i in xrange(MAX_UNUSUAL_OPTIONS + 1):
+    unusual_combinations_to_test += combinations(all_unusuals, i)
+
+include_rows = ""
+for unusual_combination in unusual_combinations_to_test:
+    os = os_default
+    if os_unusual in unusual_combination:
+        os = os_unusual
+
+    compilers = compilers_default
+    if compilers_unusual in unusual_combination:
+        compilers = compilers_unusual
+
+    compiler_flags = [
+        x for x in unusual_combination if x in compiler_flag_unusuals]
+
+    configure_flags = [
+        x for x in unusual_combination if x in configure_flag_unusuals]
+
+    malloc_conf = [
+        x for x in unusual_combination if x in malloc_conf_unusuals]
+    # Filter out unsupported configurations on OS X.
+    if os == 'osx' and ('dss:primary' in malloc_conf or \
+      'percpu_arena:percpu' in malloc_conf or 'background_thread:true' \
+      in malloc_conf):
+        continue
+    if len(malloc_conf) > 0:
+        configure_flags.append('--with-malloc-conf=' + ",".join(malloc_conf))
+
+    # Filter out an unsupported configuration - heap profiling on OS X.
+    if os == 'osx' and '--enable-prof' in configure_flags:
+        continue
+
+    # We get some spurious errors when -Warray-bounds is enabled.
+    env_string = ('{} COMPILER_FLAGS="{}" CONFIGURE_FLAGS="{}" '
+	'EXTRA_CFLAGS="-Werror -Wno-array-bounds"').format(
+        compilers, " ".join(compiler_flags), " ".join(configure_flags))
+
+    include_rows += '    - os: %s\n' % os
+    include_rows += '      env: %s\n' % env_string
+    if '-m32' in unusual_combination and os == 'linux':
+        include_rows += '      addons:\n'
+	include_rows += '        apt:\n'
+	include_rows += '          packages:\n'
+	include_rows += '            - gcc-multilib\n'
+
+print travis_template % include_rows
diff --git a/redis-stable/deps/jemalloc/src/arena.c b/redis-stable/deps/jemalloc/src/arena.c
new file mode 100644
index 00000000..5d55bf1a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/arena.c
@@ -0,0 +1,2043 @@
+#define JEMALLOC_ARENA_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/div.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/util.h"
+
+/******************************************************************************/
+/* Data. */
+
+/*
+ * Define names for both unininitialized and initialized phases, so that
+ * options and mallctl processing are straightforward.
+ */
+const char *percpu_arena_mode_names[] = {
+	"percpu",
+	"phycpu",
+	"disabled",
+	"percpu",
+	"phycpu"
+};
+percpu_arena_mode_t opt_percpu_arena = PERCPU_ARENA_DEFAULT;
+
+ssize_t opt_dirty_decay_ms = DIRTY_DECAY_MS_DEFAULT;
+ssize_t opt_muzzy_decay_ms = MUZZY_DECAY_MS_DEFAULT;
+
+static atomic_zd_t dirty_decay_ms_default;
+static atomic_zd_t muzzy_decay_ms_default;
+
+const uint64_t h_steps[SMOOTHSTEP_NSTEPS] = {
+#define STEP(step, h, x, y)			\
+		h,
+		SMOOTHSTEP
+#undef STEP
+};
+
+static div_info_t arena_binind_div_info[NBINS];
+
+/******************************************************************************/
+/*
+ * Function prototypes for static functions that are referenced prior to
+ * definition.
+ */
+
+static void arena_decay_to_limit(tsdn_t *tsdn, arena_t *arena,
+    arena_decay_t *decay, extents_t *extents, bool all, size_t npages_limit,
+    size_t npages_decay_max, bool is_background_thread);
+static bool arena_decay_dirty(tsdn_t *tsdn, arena_t *arena,
+    bool is_background_thread, bool all);
+static void arena_dalloc_bin_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
+    bin_t *bin);
+static void arena_bin_lower_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
+    bin_t *bin);
+
+/******************************************************************************/
+
+void
+arena_basic_stats_merge(UNUSED tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
+    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
+    size_t *nactive, size_t *ndirty, size_t *nmuzzy) {
+	*nthreads += arena_nthreads_get(arena, false);
+	*dss = dss_prec_names[arena_dss_prec_get(arena)];
+	*dirty_decay_ms = arena_dirty_decay_ms_get(arena);
+	*muzzy_decay_ms = arena_muzzy_decay_ms_get(arena);
+	*nactive += atomic_load_zu(&arena->nactive, ATOMIC_RELAXED);
+	*ndirty += extents_npages_get(&arena->extents_dirty);
+	*nmuzzy += extents_npages_get(&arena->extents_muzzy);
+}
+
+void
+arena_stats_merge(tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
+    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
+    size_t *nactive, size_t *ndirty, size_t *nmuzzy, arena_stats_t *astats,
+    bin_stats_t *bstats, arena_stats_large_t *lstats) {
+	cassert(config_stats);
+
+	arena_basic_stats_merge(tsdn, arena, nthreads, dss, dirty_decay_ms,
+	    muzzy_decay_ms, nactive, ndirty, nmuzzy);
+
+	size_t base_allocated, base_resident, base_mapped, metadata_thp;
+	base_stats_get(tsdn, arena->base, &base_allocated, &base_resident,
+	    &base_mapped, &metadata_thp);
+
+	arena_stats_lock(tsdn, &arena->stats);
+
+	arena_stats_accum_zu(&astats->mapped, base_mapped
+	    + arena_stats_read_zu(tsdn, &arena->stats, &arena->stats.mapped));
+	arena_stats_accum_zu(&astats->retained,
+	    extents_npages_get(&arena->extents_retained) << LG_PAGE);
+
+	arena_stats_accum_u64(&astats->decay_dirty.npurge,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_dirty.npurge));
+	arena_stats_accum_u64(&astats->decay_dirty.nmadvise,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_dirty.nmadvise));
+	arena_stats_accum_u64(&astats->decay_dirty.purged,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_dirty.purged));
+
+	arena_stats_accum_u64(&astats->decay_muzzy.npurge,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_muzzy.npurge));
+	arena_stats_accum_u64(&astats->decay_muzzy.nmadvise,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_muzzy.nmadvise));
+	arena_stats_accum_u64(&astats->decay_muzzy.purged,
+	    arena_stats_read_u64(tsdn, &arena->stats,
+	    &arena->stats.decay_muzzy.purged));
+
+	arena_stats_accum_zu(&astats->base, base_allocated);
+	arena_stats_accum_zu(&astats->internal, arena_internal_get(arena));
+	arena_stats_accum_zu(&astats->metadata_thp, metadata_thp);
+	arena_stats_accum_zu(&astats->resident, base_resident +
+	    (((atomic_load_zu(&arena->nactive, ATOMIC_RELAXED) +
+	    extents_npages_get(&arena->extents_dirty) +
+	    extents_npages_get(&arena->extents_muzzy)) << LG_PAGE)));
+
+	for (szind_t i = 0; i < NSIZES - NBINS; i++) {
+		uint64_t nmalloc = arena_stats_read_u64(tsdn, &arena->stats,
+		    &arena->stats.lstats[i].nmalloc);
+		arena_stats_accum_u64(&lstats[i].nmalloc, nmalloc);
+		arena_stats_accum_u64(&astats->nmalloc_large, nmalloc);
+
+		uint64_t ndalloc = arena_stats_read_u64(tsdn, &arena->stats,
+		    &arena->stats.lstats[i].ndalloc);
+		arena_stats_accum_u64(&lstats[i].ndalloc, ndalloc);
+		arena_stats_accum_u64(&astats->ndalloc_large, ndalloc);
+
+		uint64_t nrequests = arena_stats_read_u64(tsdn, &arena->stats,
+		    &arena->stats.lstats[i].nrequests);
+		arena_stats_accum_u64(&lstats[i].nrequests,
+		    nmalloc + nrequests);
+		arena_stats_accum_u64(&astats->nrequests_large,
+		    nmalloc + nrequests);
+
+		assert(nmalloc >= ndalloc);
+		assert(nmalloc - ndalloc <= SIZE_T_MAX);
+		size_t curlextents = (size_t)(nmalloc - ndalloc);
+		lstats[i].curlextents += curlextents;
+		arena_stats_accum_zu(&astats->allocated_large,
+		    curlextents * sz_index2size(NBINS + i));
+	}
+
+	arena_stats_unlock(tsdn, &arena->stats);
+
+	/* tcache_bytes counts currently cached bytes. */
+	atomic_store_zu(&astats->tcache_bytes, 0, ATOMIC_RELAXED);
+	malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
+	cache_bin_array_descriptor_t *descriptor;
+	ql_foreach(descriptor, &arena->cache_bin_array_descriptor_ql, link) {
+		szind_t i = 0;
+		for (; i < NBINS; i++) {
+			cache_bin_t *tbin = &descriptor->bins_small[i];
+			arena_stats_accum_zu(&astats->tcache_bytes,
+			    tbin->ncached * sz_index2size(i));
+		}
+		for (; i < nhbins; i++) {
+			cache_bin_t *tbin = &descriptor->bins_large[i];
+			arena_stats_accum_zu(&astats->tcache_bytes,
+			    tbin->ncached * sz_index2size(i));
+		}
+	}
+	malloc_mutex_prof_read(tsdn,
+	    &astats->mutex_prof_data[arena_prof_mutex_tcache_list],
+	    &arena->tcache_ql_mtx);
+	malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
+
+#define READ_ARENA_MUTEX_PROF_DATA(mtx, ind)				\
+    malloc_mutex_lock(tsdn, &arena->mtx);				\
+    malloc_mutex_prof_read(tsdn, &astats->mutex_prof_data[ind],		\
+        &arena->mtx);							\
+    malloc_mutex_unlock(tsdn, &arena->mtx);
+
+	/* Gather per arena mutex profiling data. */
+	READ_ARENA_MUTEX_PROF_DATA(large_mtx, arena_prof_mutex_large);
+	READ_ARENA_MUTEX_PROF_DATA(extent_avail_mtx,
+	    arena_prof_mutex_extent_avail)
+	READ_ARENA_MUTEX_PROF_DATA(extents_dirty.mtx,
+	    arena_prof_mutex_extents_dirty)
+	READ_ARENA_MUTEX_PROF_DATA(extents_muzzy.mtx,
+	    arena_prof_mutex_extents_muzzy)
+	READ_ARENA_MUTEX_PROF_DATA(extents_retained.mtx,
+	    arena_prof_mutex_extents_retained)
+	READ_ARENA_MUTEX_PROF_DATA(decay_dirty.mtx,
+	    arena_prof_mutex_decay_dirty)
+	READ_ARENA_MUTEX_PROF_DATA(decay_muzzy.mtx,
+	    arena_prof_mutex_decay_muzzy)
+	READ_ARENA_MUTEX_PROF_DATA(base->mtx,
+	    arena_prof_mutex_base)
+#undef READ_ARENA_MUTEX_PROF_DATA
+
+	nstime_copy(&astats->uptime, &arena->create_time);
+	nstime_update(&astats->uptime);
+	nstime_subtract(&astats->uptime, &arena->create_time);
+
+	for (szind_t i = 0; i < NBINS; i++) {
+		bin_stats_merge(tsdn, &bstats[i], &arena->bins[i]);
+	}
+}
+
+void
+arena_extents_dirty_dalloc(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extents_dalloc(tsdn, arena, r_extent_hooks, &arena->extents_dirty,
+	    extent);
+	if (arena_dirty_decay_ms_get(arena) == 0) {
+		arena_decay_dirty(tsdn, arena, false, true);
+	} else {
+		arena_background_thread_inactivity_check(tsdn, arena, false);
+	}
+}
+
+static void *
+arena_slab_reg_alloc(extent_t *slab, const bin_info_t *bin_info) {
+	void *ret;
+	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
+	size_t regind;
+
+	assert(extent_nfree_get(slab) > 0);
+	assert(!bitmap_full(slab_data->bitmap, &bin_info->bitmap_info));
+
+	regind = bitmap_sfu(slab_data->bitmap, &bin_info->bitmap_info);
+	ret = (void *)((uintptr_t)extent_addr_get(slab) +
+	    (uintptr_t)(bin_info->reg_size * regind));
+	extent_nfree_dec(slab);
+	return ret;
+}
+
+#ifndef JEMALLOC_JET
+static
+#endif
+size_t
+arena_slab_regind(extent_t *slab, szind_t binind, const void *ptr) {
+	size_t diff, regind;
+
+	/* Freeing a pointer outside the slab can cause assertion failure. */
+	assert((uintptr_t)ptr >= (uintptr_t)extent_addr_get(slab));
+	assert((uintptr_t)ptr < (uintptr_t)extent_past_get(slab));
+	/* Freeing an interior pointer can cause assertion failure. */
+	assert(((uintptr_t)ptr - (uintptr_t)extent_addr_get(slab)) %
+	    (uintptr_t)bin_infos[binind].reg_size == 0);
+
+	diff = (size_t)((uintptr_t)ptr - (uintptr_t)extent_addr_get(slab));
+
+	/* Avoid doing division with a variable divisor. */
+	regind = div_compute(&arena_binind_div_info[binind], diff);
+
+	assert(regind < bin_infos[binind].nregs);
+
+	return regind;
+}
+
+static void
+arena_slab_reg_dalloc(extent_t *slab, arena_slab_data_t *slab_data, void *ptr) {
+	szind_t binind = extent_szind_get(slab);
+	const bin_info_t *bin_info = &bin_infos[binind];
+	size_t regind = arena_slab_regind(slab, binind, ptr);
+
+	assert(extent_nfree_get(slab) < bin_info->nregs);
+	/* Freeing an unallocated pointer can cause assertion failure. */
+	assert(bitmap_get(slab_data->bitmap, &bin_info->bitmap_info, regind));
+
+	bitmap_unset(slab_data->bitmap, &bin_info->bitmap_info, regind);
+	extent_nfree_inc(slab);
+}
+
+static void
+arena_nactive_add(arena_t *arena, size_t add_pages) {
+	atomic_fetch_add_zu(&arena->nactive, add_pages, ATOMIC_RELAXED);
+}
+
+static void
+arena_nactive_sub(arena_t *arena, size_t sub_pages) {
+	assert(atomic_load_zu(&arena->nactive, ATOMIC_RELAXED) >= sub_pages);
+	atomic_fetch_sub_zu(&arena->nactive, sub_pages, ATOMIC_RELAXED);
+}
+
+static void
+arena_large_malloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t usize) {
+	szind_t index, hindex;
+
+	cassert(config_stats);
+
+	if (usize < LARGE_MINCLASS) {
+		usize = LARGE_MINCLASS;
+	}
+	index = sz_size2index(usize);
+	hindex = (index >= NBINS) ? index - NBINS : 0;
+
+	arena_stats_add_u64(tsdn, &arena->stats,
+	    &arena->stats.lstats[hindex].nmalloc, 1);
+}
+
+static void
+arena_large_dalloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t usize) {
+	szind_t index, hindex;
+
+	cassert(config_stats);
+
+	if (usize < LARGE_MINCLASS) {
+		usize = LARGE_MINCLASS;
+	}
+	index = sz_size2index(usize);
+	hindex = (index >= NBINS) ? index - NBINS : 0;
+
+	arena_stats_add_u64(tsdn, &arena->stats,
+	    &arena->stats.lstats[hindex].ndalloc, 1);
+}
+
+static void
+arena_large_ralloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t oldusize,
+    size_t usize) {
+	arena_large_dalloc_stats_update(tsdn, arena, oldusize);
+	arena_large_malloc_stats_update(tsdn, arena, usize);
+}
+
+extent_t *
+arena_extent_alloc_large(tsdn_t *tsdn, arena_t *arena, size_t usize,
+    size_t alignment, bool *zero) {
+	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
+
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	szind_t szind = sz_size2index(usize);
+	size_t mapped_add;
+	bool commit = true;
+	extent_t *extent = extents_alloc(tsdn, arena, &extent_hooks,
+	    &arena->extents_dirty, NULL, usize, sz_large_pad, alignment, false,
+	    szind, zero, &commit);
+	if (extent == NULL) {
+		extent = extents_alloc(tsdn, arena, &extent_hooks,
+		    &arena->extents_muzzy, NULL, usize, sz_large_pad, alignment,
+		    false, szind, zero, &commit);
+	}
+	size_t size = usize + sz_large_pad;
+	if (extent == NULL) {
+		extent = extent_alloc_wrapper(tsdn, arena, &extent_hooks, NULL,
+		    usize, sz_large_pad, alignment, false, szind, zero,
+		    &commit);
+		if (config_stats) {
+			/*
+			 * extent may be NULL on OOM, but in that case
+			 * mapped_add isn't used below, so there's no need to
+			 * conditionlly set it to 0 here.
+			 */
+			mapped_add = size;
+		}
+	} else if (config_stats) {
+		mapped_add = 0;
+	}
+
+	if (extent != NULL) {
+		if (config_stats) {
+			arena_stats_lock(tsdn, &arena->stats);
+			arena_large_malloc_stats_update(tsdn, arena, usize);
+			if (mapped_add != 0) {
+				arena_stats_add_zu(tsdn, &arena->stats,
+				    &arena->stats.mapped, mapped_add);
+			}
+			arena_stats_unlock(tsdn, &arena->stats);
+		}
+		arena_nactive_add(arena, size >> LG_PAGE);
+	}
+
+	return extent;
+}
+
+void
+arena_extent_dalloc_large_prep(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
+	if (config_stats) {
+		arena_stats_lock(tsdn, &arena->stats);
+		arena_large_dalloc_stats_update(tsdn, arena,
+		    extent_usize_get(extent));
+		arena_stats_unlock(tsdn, &arena->stats);
+	}
+	arena_nactive_sub(arena, extent_size_get(extent) >> LG_PAGE);
+}
+
+void
+arena_extent_ralloc_large_shrink(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
+    size_t oldusize) {
+	size_t usize = extent_usize_get(extent);
+	size_t udiff = oldusize - usize;
+
+	if (config_stats) {
+		arena_stats_lock(tsdn, &arena->stats);
+		arena_large_ralloc_stats_update(tsdn, arena, oldusize, usize);
+		arena_stats_unlock(tsdn, &arena->stats);
+	}
+	arena_nactive_sub(arena, udiff >> LG_PAGE);
+}
+
+void
+arena_extent_ralloc_large_expand(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
+    size_t oldusize) {
+	size_t usize = extent_usize_get(extent);
+	size_t udiff = usize - oldusize;
+
+	if (config_stats) {
+		arena_stats_lock(tsdn, &arena->stats);
+		arena_large_ralloc_stats_update(tsdn, arena, oldusize, usize);
+		arena_stats_unlock(tsdn, &arena->stats);
+	}
+	arena_nactive_add(arena, udiff >> LG_PAGE);
+}
+
+static ssize_t
+arena_decay_ms_read(arena_decay_t *decay) {
+	return atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
+}
+
+static void
+arena_decay_ms_write(arena_decay_t *decay, ssize_t decay_ms) {
+	atomic_store_zd(&decay->time_ms, decay_ms, ATOMIC_RELAXED);
+}
+
+static void
+arena_decay_deadline_init(arena_decay_t *decay) {
+	/*
+	 * Generate a new deadline that is uniformly random within the next
+	 * epoch after the current one.
+	 */
+	nstime_copy(&decay->deadline, &decay->epoch);
+	nstime_add(&decay->deadline, &decay->interval);
+	if (arena_decay_ms_read(decay) > 0) {
+		nstime_t jitter;
+
+		nstime_init(&jitter, prng_range_u64(&decay->jitter_state,
+		    nstime_ns(&decay->interval)));
+		nstime_add(&decay->deadline, &jitter);
+	}
+}
+
+static bool
+arena_decay_deadline_reached(const arena_decay_t *decay, const nstime_t *time) {
+	return (nstime_compare(&decay->deadline, time) <= 0);
+}
+
+static size_t
+arena_decay_backlog_npages_limit(const arena_decay_t *decay) {
+	uint64_t sum;
+	size_t npages_limit_backlog;
+	unsigned i;
+
+	/*
+	 * For each element of decay_backlog, multiply by the corresponding
+	 * fixed-point smoothstep decay factor.  Sum the products, then divide
+	 * to round down to the nearest whole number of pages.
+	 */
+	sum = 0;
+	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
+		sum += decay->backlog[i] * h_steps[i];
+	}
+	npages_limit_backlog = (size_t)(sum >> SMOOTHSTEP_BFP);
+
+	return npages_limit_backlog;
+}
+
+static void
+arena_decay_backlog_update_last(arena_decay_t *decay, size_t current_npages) {
+	size_t npages_delta = (current_npages > decay->nunpurged) ?
+	    current_npages - decay->nunpurged : 0;
+	decay->backlog[SMOOTHSTEP_NSTEPS-1] = npages_delta;
+
+	if (config_debug) {
+		if (current_npages > decay->ceil_npages) {
+			decay->ceil_npages = current_npages;
+		}
+		size_t npages_limit = arena_decay_backlog_npages_limit(decay);
+		assert(decay->ceil_npages >= npages_limit);
+		if (decay->ceil_npages > npages_limit) {
+			decay->ceil_npages = npages_limit;
+		}
+	}
+}
+
+static void
+arena_decay_backlog_update(arena_decay_t *decay, uint64_t nadvance_u64,
+    size_t current_npages) {
+	if (nadvance_u64 >= SMOOTHSTEP_NSTEPS) {
+		memset(decay->backlog, 0, (SMOOTHSTEP_NSTEPS-1) *
+		    sizeof(size_t));
+	} else {
+		size_t nadvance_z = (size_t)nadvance_u64;
+
+		assert((uint64_t)nadvance_z == nadvance_u64);
+
+		memmove(decay->backlog, &decay->backlog[nadvance_z],
+		    (SMOOTHSTEP_NSTEPS - nadvance_z) * sizeof(size_t));
+		if (nadvance_z > 1) {
+			memset(&decay->backlog[SMOOTHSTEP_NSTEPS -
+			    nadvance_z], 0, (nadvance_z-1) * sizeof(size_t));
+		}
+	}
+
+	arena_decay_backlog_update_last(decay, current_npages);
+}
+
+static void
+arena_decay_try_purge(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, size_t current_npages, size_t npages_limit,
+    bool is_background_thread) {
+	if (current_npages > npages_limit) {
+		arena_decay_to_limit(tsdn, arena, decay, extents, false,
+		    npages_limit, current_npages - npages_limit,
+		    is_background_thread);
+	}
+}
+
+static void
+arena_decay_epoch_advance_helper(arena_decay_t *decay, const nstime_t *time,
+    size_t current_npages) {
+	assert(arena_decay_deadline_reached(decay, time));
+
+	nstime_t delta;
+	nstime_copy(&delta, time);
+	nstime_subtract(&delta, &decay->epoch);
+
+	uint64_t nadvance_u64 = nstime_divide(&delta, &decay->interval);
+	assert(nadvance_u64 > 0);
+
+	/* Add nadvance_u64 decay intervals to epoch. */
+	nstime_copy(&delta, &decay->interval);
+	nstime_imultiply(&delta, nadvance_u64);
+	nstime_add(&decay->epoch, &delta);
+
+	/* Set a new deadline. */
+	arena_decay_deadline_init(decay);
+
+	/* Update the backlog. */
+	arena_decay_backlog_update(decay, nadvance_u64, current_npages);
+}
+
+static void
+arena_decay_epoch_advance(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, const nstime_t *time, bool is_background_thread) {
+	size_t current_npages = extents_npages_get(extents);
+	arena_decay_epoch_advance_helper(decay, time, current_npages);
+
+	size_t npages_limit = arena_decay_backlog_npages_limit(decay);
+	/* We may unlock decay->mtx when try_purge(). Finish logging first. */
+	decay->nunpurged = (npages_limit > current_npages) ? npages_limit :
+	    current_npages;
+
+	if (!background_thread_enabled() || is_background_thread) {
+		arena_decay_try_purge(tsdn, arena, decay, extents,
+		    current_npages, npages_limit, is_background_thread);
+	}
+}
+
+static void
+arena_decay_reinit(arena_decay_t *decay, ssize_t decay_ms) {
+	arena_decay_ms_write(decay, decay_ms);
+	if (decay_ms > 0) {
+		nstime_init(&decay->interval, (uint64_t)decay_ms *
+		    KQU(1000000));
+		nstime_idivide(&decay->interval, SMOOTHSTEP_NSTEPS);
+	}
+
+	nstime_init(&decay->epoch, 0);
+	nstime_update(&decay->epoch);
+	decay->jitter_state = (uint64_t)(uintptr_t)decay;
+	arena_decay_deadline_init(decay);
+	decay->nunpurged = 0;
+	memset(decay->backlog, 0, SMOOTHSTEP_NSTEPS * sizeof(size_t));
+}
+
+static bool
+arena_decay_init(arena_decay_t *decay, ssize_t decay_ms,
+    arena_stats_decay_t *stats) {
+	if (config_debug) {
+		for (size_t i = 0; i < sizeof(arena_decay_t); i++) {
+			assert(((char *)decay)[i] == 0);
+		}
+		decay->ceil_npages = 0;
+	}
+	if (malloc_mutex_init(&decay->mtx, "decay", WITNESS_RANK_DECAY,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+	decay->purging = false;
+	arena_decay_reinit(decay, decay_ms);
+	/* Memory is zeroed, so there is no need to clear stats. */
+	if (config_stats) {
+		decay->stats = stats;
+	}
+	return false;
+}
+
+static bool
+arena_decay_ms_valid(ssize_t decay_ms) {
+	if (decay_ms < -1) {
+		return false;
+	}
+	if (decay_ms == -1 || (uint64_t)decay_ms <= NSTIME_SEC_MAX *
+	    KQU(1000)) {
+		return true;
+	}
+	return false;
+}
+
+static bool
+arena_maybe_decay(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, bool is_background_thread) {
+	malloc_mutex_assert_owner(tsdn, &decay->mtx);
+
+	/* Purge all or nothing if the option is disabled. */
+	ssize_t decay_ms = arena_decay_ms_read(decay);
+	if (decay_ms <= 0) {
+		if (decay_ms == 0) {
+			arena_decay_to_limit(tsdn, arena, decay, extents, false,
+			    0, extents_npages_get(extents),
+			    is_background_thread);
+		}
+		return false;
+	}
+
+	nstime_t time;
+	nstime_init(&time, 0);
+	nstime_update(&time);
+	if (unlikely(!nstime_monotonic() && nstime_compare(&decay->epoch, &time)
+	    > 0)) {
+		/*
+		 * Time went backwards.  Move the epoch back in time and
+		 * generate a new deadline, with the expectation that time
+		 * typically flows forward for long enough periods of time that
+		 * epochs complete.  Unfortunately, this strategy is susceptible
+		 * to clock jitter triggering premature epoch advances, but
+		 * clock jitter estimation and compensation isn't feasible here
+		 * because calls into this code are event-driven.
+		 */
+		nstime_copy(&decay->epoch, &time);
+		arena_decay_deadline_init(decay);
+	} else {
+		/* Verify that time does not go backwards. */
+		assert(nstime_compare(&decay->epoch, &time) <= 0);
+	}
+
+	/*
+	 * If the deadline has been reached, advance to the current epoch and
+	 * purge to the new limit if necessary.  Note that dirty pages created
+	 * during the current epoch are not subject to purge until a future
+	 * epoch, so as a result purging only happens during epoch advances, or
+	 * being triggered by background threads (scheduled event).
+	 */
+	bool advance_epoch = arena_decay_deadline_reached(decay, &time);
+	if (advance_epoch) {
+		arena_decay_epoch_advance(tsdn, arena, decay, extents, &time,
+		    is_background_thread);
+	} else if (is_background_thread) {
+		arena_decay_try_purge(tsdn, arena, decay, extents,
+		    extents_npages_get(extents),
+		    arena_decay_backlog_npages_limit(decay),
+		    is_background_thread);
+	}
+
+	return advance_epoch;
+}
+
+static ssize_t
+arena_decay_ms_get(arena_decay_t *decay) {
+	return arena_decay_ms_read(decay);
+}
+
+ssize_t
+arena_dirty_decay_ms_get(arena_t *arena) {
+	return arena_decay_ms_get(&arena->decay_dirty);
+}
+
+ssize_t
+arena_muzzy_decay_ms_get(arena_t *arena) {
+	return arena_decay_ms_get(&arena->decay_muzzy);
+}
+
+static bool
+arena_decay_ms_set(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, ssize_t decay_ms) {
+	if (!arena_decay_ms_valid(decay_ms)) {
+		return true;
+	}
+
+	malloc_mutex_lock(tsdn, &decay->mtx);
+	/*
+	 * Restart decay backlog from scratch, which may cause many dirty pages
+	 * to be immediately purged.  It would conceptually be possible to map
+	 * the old backlog onto the new backlog, but there is no justification
+	 * for such complexity since decay_ms changes are intended to be
+	 * infrequent, either between the {-1, 0, >0} states, or a one-time
+	 * arbitrary change during initial arena configuration.
+	 */
+	arena_decay_reinit(decay, decay_ms);
+	arena_maybe_decay(tsdn, arena, decay, extents, false);
+	malloc_mutex_unlock(tsdn, &decay->mtx);
+
+	return false;
+}
+
+bool
+arena_dirty_decay_ms_set(tsdn_t *tsdn, arena_t *arena,
+    ssize_t decay_ms) {
+	return arena_decay_ms_set(tsdn, arena, &arena->decay_dirty,
+	    &arena->extents_dirty, decay_ms);
+}
+
+bool
+arena_muzzy_decay_ms_set(tsdn_t *tsdn, arena_t *arena,
+    ssize_t decay_ms) {
+	return arena_decay_ms_set(tsdn, arena, &arena->decay_muzzy,
+	    &arena->extents_muzzy, decay_ms);
+}
+
+static size_t
+arena_stash_decayed(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, size_t npages_limit,
+	size_t npages_decay_max, extent_list_t *decay_extents) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	/* Stash extents according to npages_limit. */
+	size_t nstashed = 0;
+	extent_t *extent;
+	while (nstashed < npages_decay_max &&
+	    (extent = extents_evict(tsdn, arena, r_extent_hooks, extents,
+	    npages_limit)) != NULL) {
+		extent_list_append(decay_extents, extent);
+		nstashed += extent_size_get(extent) >> LG_PAGE;
+	}
+	return nstashed;
+}
+
+static size_t
+arena_decay_stashed(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, arena_decay_t *decay, extents_t *extents,
+    bool all, extent_list_t *decay_extents, bool is_background_thread) {
+	UNUSED size_t nmadvise, nunmapped;
+	size_t npurged;
+
+	if (config_stats) {
+		nmadvise = 0;
+		nunmapped = 0;
+	}
+	npurged = 0;
+
+	ssize_t muzzy_decay_ms = arena_muzzy_decay_ms_get(arena);
+	for (extent_t *extent = extent_list_first(decay_extents); extent !=
+	    NULL; extent = extent_list_first(decay_extents)) {
+		if (config_stats) {
+			nmadvise++;
+		}
+		size_t npages = extent_size_get(extent) >> LG_PAGE;
+		npurged += npages;
+		extent_list_remove(decay_extents, extent);
+		switch (extents_state_get(extents)) {
+		case extent_state_active:
+			not_reached();
+		case extent_state_dirty:
+			if (!all && muzzy_decay_ms != 0 &&
+			    !extent_purge_lazy_wrapper(tsdn, arena,
+			    r_extent_hooks, extent, 0,
+			    extent_size_get(extent))) {
+				extents_dalloc(tsdn, arena, r_extent_hooks,
+				    &arena->extents_muzzy, extent);
+				arena_background_thread_inactivity_check(tsdn,
+				    arena, is_background_thread);
+				break;
+			}
+			/* Fall through. */
+		case extent_state_muzzy:
+			extent_dalloc_wrapper(tsdn, arena, r_extent_hooks,
+			    extent);
+			if (config_stats) {
+				nunmapped += npages;
+			}
+			break;
+		case extent_state_retained:
+		default:
+			not_reached();
+		}
+	}
+
+	if (config_stats) {
+		arena_stats_lock(tsdn, &arena->stats);
+		arena_stats_add_u64(tsdn, &arena->stats, &decay->stats->npurge,
+		    1);
+		arena_stats_add_u64(tsdn, &arena->stats,
+		    &decay->stats->nmadvise, nmadvise);
+		arena_stats_add_u64(tsdn, &arena->stats, &decay->stats->purged,
+		    npurged);
+		arena_stats_sub_zu(tsdn, &arena->stats, &arena->stats.mapped,
+		    nunmapped << LG_PAGE);
+		arena_stats_unlock(tsdn, &arena->stats);
+	}
+
+	return npurged;
+}
+
+/*
+ * npages_limit: Decay at most npages_decay_max pages without violating the
+ * invariant: (extents_npages_get(extents) >= npages_limit).  We need an upper
+ * bound on number of pages in order to prevent unbounded growth (namely in
+ * stashed), otherwise unbounded new pages could be added to extents during the
+ * current decay run, so that the purging thread never finishes.
+ */
+static void
+arena_decay_to_limit(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, bool all, size_t npages_limit, size_t npages_decay_max,
+    bool is_background_thread) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 1);
+	malloc_mutex_assert_owner(tsdn, &decay->mtx);
+
+	if (decay->purging) {
+		return;
+	}
+	decay->purging = true;
+	malloc_mutex_unlock(tsdn, &decay->mtx);
+
+	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
+
+	extent_list_t decay_extents;
+	extent_list_init(&decay_extents);
+
+	size_t npurge = arena_stash_decayed(tsdn, arena, &extent_hooks, extents,
+	    npages_limit, npages_decay_max, &decay_extents);
+	if (npurge != 0) {
+		UNUSED size_t npurged = arena_decay_stashed(tsdn, arena,
+		    &extent_hooks, decay, extents, all, &decay_extents,
+		    is_background_thread);
+		assert(npurged == npurge);
+	}
+
+	malloc_mutex_lock(tsdn, &decay->mtx);
+	decay->purging = false;
+}
+
+static bool
+arena_decay_impl(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
+    extents_t *extents, bool is_background_thread, bool all) {
+	if (all) {
+		malloc_mutex_lock(tsdn, &decay->mtx);
+		arena_decay_to_limit(tsdn, arena, decay, extents, all, 0,
+		    extents_npages_get(extents), is_background_thread);
+		malloc_mutex_unlock(tsdn, &decay->mtx);
+
+		return false;
+	}
+
+	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
+		/* No need to wait if another thread is in progress. */
+		return true;
+	}
+
+	bool epoch_advanced = arena_maybe_decay(tsdn, arena, decay, extents,
+	    is_background_thread);
+	UNUSED size_t npages_new;
+	if (epoch_advanced) {
+		/* Backlog is updated on epoch advance. */
+		npages_new = decay->backlog[SMOOTHSTEP_NSTEPS-1];
+	}
+	malloc_mutex_unlock(tsdn, &decay->mtx);
+
+	if (have_background_thread && background_thread_enabled() &&
+	    epoch_advanced && !is_background_thread) {
+		background_thread_interval_check(tsdn, arena, decay,
+		    npages_new);
+	}
+
+	return false;
+}
+
+static bool
+arena_decay_dirty(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
+    bool all) {
+	return arena_decay_impl(tsdn, arena, &arena->decay_dirty,
+	    &arena->extents_dirty, is_background_thread, all);
+}
+
+static bool
+arena_decay_muzzy(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
+    bool all) {
+	return arena_decay_impl(tsdn, arena, &arena->decay_muzzy,
+	    &arena->extents_muzzy, is_background_thread, all);
+}
+
+void
+arena_decay(tsdn_t *tsdn, arena_t *arena, bool is_background_thread, bool all) {
+	if (arena_decay_dirty(tsdn, arena, is_background_thread, all)) {
+		return;
+	}
+	arena_decay_muzzy(tsdn, arena, is_background_thread, all);
+}
+
+static void
+arena_slab_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *slab) {
+	arena_nactive_sub(arena, extent_size_get(slab) >> LG_PAGE);
+
+	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
+	arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, slab);
+}
+
+static void
+arena_bin_slabs_nonfull_insert(bin_t *bin, extent_t *slab) {
+	assert(extent_nfree_get(slab) > 0);
+	extent_heap_insert(&bin->slabs_nonfull, slab);
+}
+
+static void
+arena_bin_slabs_nonfull_remove(bin_t *bin, extent_t *slab) {
+	extent_heap_remove(&bin->slabs_nonfull, slab);
+}
+
+static extent_t *
+arena_bin_slabs_nonfull_tryget(bin_t *bin) {
+	extent_t *slab = extent_heap_remove_first(&bin->slabs_nonfull);
+	if (slab == NULL) {
+		return NULL;
+	}
+	if (config_stats) {
+		bin->stats.reslabs++;
+	}
+	return slab;
+}
+
+static void
+arena_bin_slabs_full_insert(arena_t *arena, bin_t *bin, extent_t *slab) {
+	assert(extent_nfree_get(slab) == 0);
+	/*
+	 *  Tracking extents is required by arena_reset, which is not allowed
+	 *  for auto arenas.  Bypass this step to avoid touching the extent
+	 *  linkage (often results in cache misses) for auto arenas.
+	 */
+	if (arena_is_auto(arena)) {
+		return;
+	}
+	extent_list_append(&bin->slabs_full, slab);
+}
+
+static void
+arena_bin_slabs_full_remove(arena_t *arena, bin_t *bin, extent_t *slab) {
+	if (arena_is_auto(arena)) {
+		return;
+	}
+	extent_list_remove(&bin->slabs_full, slab);
+}
+
+void
+arena_reset(tsd_t *tsd, arena_t *arena) {
+	/*
+	 * Locking in this function is unintuitive.  The caller guarantees that
+	 * no concurrent operations are happening in this arena, but there are
+	 * still reasons that some locking is necessary:
+	 *
+	 * - Some of the functions in the transitive closure of calls assume
+	 *   appropriate locks are held, and in some cases these locks are
+	 *   temporarily dropped to avoid lock order reversal or deadlock due to
+	 *   reentry.
+	 * - mallctl("epoch", ...) may concurrently refresh stats.  While
+	 *   strictly speaking this is a "concurrent operation", disallowing
+	 *   stats refreshes would impose an inconvenient burden.
+	 */
+
+	/* Large allocations. */
+	malloc_mutex_lock(tsd_tsdn(tsd), &arena->large_mtx);
+
+	for (extent_t *extent = extent_list_first(&arena->large); extent !=
+	    NULL; extent = extent_list_first(&arena->large)) {
+		void *ptr = extent_base_get(extent);
+		size_t usize;
+
+		malloc_mutex_unlock(tsd_tsdn(tsd), &arena->large_mtx);
+		alloc_ctx_t alloc_ctx;
+		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+		assert(alloc_ctx.szind != NSIZES);
+
+		if (config_stats || (config_prof && opt_prof)) {
+			usize = sz_index2size(alloc_ctx.szind);
+			assert(usize == isalloc(tsd_tsdn(tsd), ptr));
+		}
+		/* Remove large allocation from prof sample set. */
+		if (config_prof && opt_prof) {
+			prof_free(tsd, ptr, usize, &alloc_ctx);
+		}
+		large_dalloc(tsd_tsdn(tsd), extent);
+		malloc_mutex_lock(tsd_tsdn(tsd), &arena->large_mtx);
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), &arena->large_mtx);
+
+	/* Bins. */
+	for (unsigned i = 0; i < NBINS; i++) {
+		extent_t *slab;
+		bin_t *bin = &arena->bins[i];
+		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		if (bin->slabcur != NULL) {
+			slab = bin->slabcur;
+			bin->slabcur = NULL;
+			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
+			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		}
+		while ((slab = extent_heap_remove_first(&bin->slabs_nonfull)) !=
+		    NULL) {
+			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
+			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		}
+		for (slab = extent_list_first(&bin->slabs_full); slab != NULL;
+		    slab = extent_list_first(&bin->slabs_full)) {
+			arena_bin_slabs_full_remove(arena, bin, slab);
+			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
+			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		}
+		if (config_stats) {
+			bin->stats.curregs = 0;
+			bin->stats.curslabs = 0;
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+	}
+
+	atomic_store_zu(&arena->nactive, 0, ATOMIC_RELAXED);
+}
+
+static void
+arena_destroy_retained(tsdn_t *tsdn, arena_t *arena) {
+	/*
+	 * Iterate over the retained extents and destroy them.  This gives the
+	 * extent allocator underlying the extent hooks an opportunity to unmap
+	 * all retained memory without having to keep its own metadata
+	 * structures.  In practice, virtual memory for dss-allocated extents is
+	 * leaked here, so best practice is to avoid dss for arenas to be
+	 * destroyed, or provide custom extent hooks that track retained
+	 * dss-based extents for later reuse.
+	 */
+	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
+	extent_t *extent;
+	while ((extent = extents_evict(tsdn, arena, &extent_hooks,
+	    &arena->extents_retained, 0)) != NULL) {
+		extent_destroy_wrapper(tsdn, arena, &extent_hooks, extent);
+	}
+}
+
+void
+arena_destroy(tsd_t *tsd, arena_t *arena) {
+	assert(base_ind_get(arena->base) >= narenas_auto);
+	assert(arena_nthreads_get(arena, false) == 0);
+	assert(arena_nthreads_get(arena, true) == 0);
+
+	/*
+	 * No allocations have occurred since arena_reset() was called.
+	 * Furthermore, the caller (arena_i_destroy_ctl()) purged all cached
+	 * extents, so only retained extents may remain.
+	 */
+	assert(extents_npages_get(&arena->extents_dirty) == 0);
+	assert(extents_npages_get(&arena->extents_muzzy) == 0);
+
+	/* Deallocate retained memory. */
+	arena_destroy_retained(tsd_tsdn(tsd), arena);
+
+	/*
+	 * Remove the arena pointer from the arenas array.  We rely on the fact
+	 * that there is no way for the application to get a dirty read from the
+	 * arenas array unless there is an inherent race in the application
+	 * involving access of an arena being concurrently destroyed.  The
+	 * application must synchronize knowledge of the arena's validity, so as
+	 * long as we use an atomic write to update the arenas array, the
+	 * application will get a clean read any time after it synchronizes
+	 * knowledge that the arena is no longer valid.
+	 */
+	arena_set(base_ind_get(arena->base), NULL);
+
+	/*
+	 * Destroy the base allocator, which manages all metadata ever mapped by
+	 * this arena.
+	 */
+	base_delete(tsd_tsdn(tsd), arena->base);
+}
+
+static extent_t *
+arena_slab_alloc_hard(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, const bin_info_t *bin_info,
+    szind_t szind) {
+	extent_t *slab;
+	bool zero, commit;
+
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	zero = false;
+	commit = true;
+	slab = extent_alloc_wrapper(tsdn, arena, r_extent_hooks, NULL,
+	    bin_info->slab_size, 0, PAGE, true, szind, &zero, &commit);
+
+	if (config_stats && slab != NULL) {
+		arena_stats_mapped_add(tsdn, &arena->stats,
+		    bin_info->slab_size);
+	}
+
+	return slab;
+}
+
+static extent_t *
+arena_slab_alloc(tsdn_t *tsdn, arena_t *arena, szind_t binind,
+    const bin_info_t *bin_info) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
+	szind_t szind = sz_size2index(bin_info->reg_size);
+	bool zero = false;
+	bool commit = true;
+	extent_t *slab = extents_alloc(tsdn, arena, &extent_hooks,
+	    &arena->extents_dirty, NULL, bin_info->slab_size, 0, PAGE, true,
+	    binind, &zero, &commit);
+	if (slab == NULL) {
+		slab = extents_alloc(tsdn, arena, &extent_hooks,
+		    &arena->extents_muzzy, NULL, bin_info->slab_size, 0, PAGE,
+		    true, binind, &zero, &commit);
+	}
+	if (slab == NULL) {
+		slab = arena_slab_alloc_hard(tsdn, arena, &extent_hooks,
+		    bin_info, szind);
+		if (slab == NULL) {
+			return NULL;
+		}
+	}
+	assert(extent_slab_get(slab));
+
+	/* Initialize slab internals. */
+	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
+	extent_nfree_set(slab, bin_info->nregs);
+	bitmap_init(slab_data->bitmap, &bin_info->bitmap_info, false);
+
+	arena_nactive_add(arena, extent_size_get(slab) >> LG_PAGE);
+
+	return slab;
+}
+
+static extent_t *
+arena_bin_nonfull_slab_get(tsdn_t *tsdn, arena_t *arena, bin_t *bin,
+    szind_t binind) {
+	extent_t *slab;
+	const bin_info_t *bin_info;
+
+	/* Look for a usable slab. */
+	slab = arena_bin_slabs_nonfull_tryget(bin);
+	if (slab != NULL) {
+		return slab;
+	}
+	/* No existing slabs have any space available. */
+
+	bin_info = &bin_infos[binind];
+
+	/* Allocate a new slab. */
+	malloc_mutex_unlock(tsdn, &bin->lock);
+	/******************************/
+	slab = arena_slab_alloc(tsdn, arena, binind, bin_info);
+	/********************************/
+	malloc_mutex_lock(tsdn, &bin->lock);
+	if (slab != NULL) {
+		if (config_stats) {
+			bin->stats.nslabs++;
+			bin->stats.curslabs++;
+		}
+		return slab;
+	}
+
+	/*
+	 * arena_slab_alloc() failed, but another thread may have made
+	 * sufficient memory available while this one dropped bin->lock above,
+	 * so search one more time.
+	 */
+	slab = arena_bin_slabs_nonfull_tryget(bin);
+	if (slab != NULL) {
+		return slab;
+	}
+
+	return NULL;
+}
+
+/* Re-fill bin->slabcur, then call arena_slab_reg_alloc(). */
+static void *
+arena_bin_malloc_hard(tsdn_t *tsdn, arena_t *arena, bin_t *bin,
+    szind_t binind) {
+	const bin_info_t *bin_info;
+	extent_t *slab;
+
+	bin_info = &bin_infos[binind];
+	if (!arena_is_auto(arena) && bin->slabcur != NULL) {
+		arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
+		bin->slabcur = NULL;
+	}
+	slab = arena_bin_nonfull_slab_get(tsdn, arena, bin, binind);
+	if (bin->slabcur != NULL) {
+		/*
+		 * Another thread updated slabcur while this one ran without the
+		 * bin lock in arena_bin_nonfull_slab_get().
+		 */
+		if (extent_nfree_get(bin->slabcur) > 0) {
+			void *ret = arena_slab_reg_alloc(bin->slabcur,
+			    bin_info);
+			if (slab != NULL) {
+				/*
+				 * arena_slab_alloc() may have allocated slab,
+				 * or it may have been pulled from
+				 * slabs_nonfull.  Therefore it is unsafe to
+				 * make any assumptions about how slab has
+				 * previously been used, and
+				 * arena_bin_lower_slab() must be called, as if
+				 * a region were just deallocated from the slab.
+				 */
+				if (extent_nfree_get(slab) == bin_info->nregs) {
+					arena_dalloc_bin_slab(tsdn, arena, slab,
+					    bin);
+				} else {
+					arena_bin_lower_slab(tsdn, arena, slab,
+					    bin);
+				}
+			}
+			return ret;
+		}
+
+		arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
+		bin->slabcur = NULL;
+	}
+
+	if (slab == NULL) {
+		return NULL;
+	}
+	bin->slabcur = slab;
+
+	assert(extent_nfree_get(bin->slabcur) > 0);
+
+	return arena_slab_reg_alloc(slab, bin_info);
+}
+
+void
+arena_tcache_fill_small(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
+    cache_bin_t *tbin, szind_t binind, uint64_t prof_accumbytes) {
+	unsigned i, nfill;
+	bin_t *bin;
+
+	assert(tbin->ncached == 0);
+
+	if (config_prof && arena_prof_accum(tsdn, arena, prof_accumbytes)) {
+		prof_idump(tsdn);
+	}
+	bin = &arena->bins[binind];
+	malloc_mutex_lock(tsdn, &bin->lock);
+	for (i = 0, nfill = (tcache_bin_info[binind].ncached_max >>
+	    tcache->lg_fill_div[binind]); i < nfill; i++) {
+		extent_t *slab;
+		void *ptr;
+		if ((slab = bin->slabcur) != NULL && extent_nfree_get(slab) >
+		    0) {
+			ptr = arena_slab_reg_alloc(slab, &bin_infos[binind]);
+		} else {
+			ptr = arena_bin_malloc_hard(tsdn, arena, bin, binind);
+		}
+		if (ptr == NULL) {
+			/*
+			 * OOM.  tbin->avail isn't yet filled down to its first
+			 * element, so the successful allocations (if any) must
+			 * be moved just before tbin->avail before bailing out.
+			 */
+			if (i > 0) {
+				memmove(tbin->avail - i, tbin->avail - nfill,
+				    i * sizeof(void *));
+			}
+			break;
+		}
+		if (config_fill && unlikely(opt_junk_alloc)) {
+			arena_alloc_junk_small(ptr, &bin_infos[binind], true);
+		}
+		/* Insert such that low regions get used first. */
+		*(tbin->avail - nfill + i) = ptr;
+	}
+	if (config_stats) {
+		bin->stats.nmalloc += i;
+		bin->stats.nrequests += tbin->tstats.nrequests;
+		bin->stats.curregs += i;
+		bin->stats.nfills++;
+		tbin->tstats.nrequests = 0;
+	}
+	malloc_mutex_unlock(tsdn, &bin->lock);
+	tbin->ncached = i;
+	arena_decay_tick(tsdn, arena);
+}
+
+void
+arena_alloc_junk_small(void *ptr, const bin_info_t *bin_info, bool zero) {
+	if (!zero) {
+		memset(ptr, JEMALLOC_ALLOC_JUNK, bin_info->reg_size);
+	}
+}
+
+static void
+arena_dalloc_junk_small_impl(void *ptr, const bin_info_t *bin_info) {
+	memset(ptr, JEMALLOC_FREE_JUNK, bin_info->reg_size);
+}
+arena_dalloc_junk_small_t *JET_MUTABLE arena_dalloc_junk_small =
+    arena_dalloc_junk_small_impl;
+
+static void *
+arena_malloc_small(tsdn_t *tsdn, arena_t *arena, szind_t binind, bool zero) {
+	void *ret;
+	bin_t *bin;
+	size_t usize;
+	extent_t *slab;
+
+	assert(binind < NBINS);
+	bin = &arena->bins[binind];
+	usize = sz_index2size(binind);
+
+	malloc_mutex_lock(tsdn, &bin->lock);
+	if ((slab = bin->slabcur) != NULL && extent_nfree_get(slab) > 0) {
+		ret = arena_slab_reg_alloc(slab, &bin_infos[binind]);
+	} else {
+		ret = arena_bin_malloc_hard(tsdn, arena, bin, binind);
+	}
+
+	if (ret == NULL) {
+		malloc_mutex_unlock(tsdn, &bin->lock);
+		return NULL;
+	}
+
+	if (config_stats) {
+		bin->stats.nmalloc++;
+		bin->stats.nrequests++;
+		bin->stats.curregs++;
+	}
+	malloc_mutex_unlock(tsdn, &bin->lock);
+	if (config_prof && arena_prof_accum(tsdn, arena, usize)) {
+		prof_idump(tsdn);
+	}
+
+	if (!zero) {
+		if (config_fill) {
+			if (unlikely(opt_junk_alloc)) {
+				arena_alloc_junk_small(ret,
+				    &bin_infos[binind], false);
+			} else if (unlikely(opt_zero)) {
+				memset(ret, 0, usize);
+			}
+		}
+	} else {
+		if (config_fill && unlikely(opt_junk_alloc)) {
+			arena_alloc_junk_small(ret, &bin_infos[binind],
+			    true);
+		}
+		memset(ret, 0, usize);
+	}
+
+	arena_decay_tick(tsdn, arena);
+	return ret;
+}
+
+void *
+arena_malloc_hard(tsdn_t *tsdn, arena_t *arena, size_t size, szind_t ind,
+    bool zero) {
+	assert(!tsdn_null(tsdn) || arena != NULL);
+
+	if (likely(!tsdn_null(tsdn))) {
+		arena = arena_choose(tsdn_tsd(tsdn), arena);
+	}
+	if (unlikely(arena == NULL)) {
+		return NULL;
+	}
+
+	if (likely(size <= SMALL_MAXCLASS)) {
+		return arena_malloc_small(tsdn, arena, ind, zero);
+	}
+	return large_malloc(tsdn, arena, sz_index2size(ind), zero);
+}
+
+void *
+arena_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
+    bool zero, tcache_t *tcache) {
+	void *ret;
+
+	if (usize <= SMALL_MAXCLASS && (alignment < PAGE || (alignment == PAGE
+	    && (usize & PAGE_MASK) == 0))) {
+		/* Small; alignment doesn't require special slab placement. */
+		ret = arena_malloc(tsdn, arena, usize, sz_size2index(usize),
+		    zero, tcache, true);
+	} else {
+		if (likely(alignment <= CACHELINE)) {
+			ret = large_malloc(tsdn, arena, usize, zero);
+		} else {
+			ret = large_palloc(tsdn, arena, usize, alignment, zero);
+		}
+	}
+	return ret;
+}
+
+void
+arena_prof_promote(tsdn_t *tsdn, const void *ptr, size_t usize) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+	assert(isalloc(tsdn, ptr) == LARGE_MINCLASS);
+	assert(usize <= SMALL_MAXCLASS);
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	extent_t *extent = rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true);
+	arena_t *arena = extent_arena_get(extent);
+
+	szind_t szind = sz_size2index(usize);
+	extent_szind_set(extent, szind);
+	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
+	    szind, false);
+
+	prof_accum_cancel(tsdn, &arena->prof_accum, usize);
+
+	assert(isalloc(tsdn, ptr) == usize);
+}
+
+static size_t
+arena_prof_demote(tsdn_t *tsdn, extent_t *extent, const void *ptr) {
+	cassert(config_prof);
+	assert(ptr != NULL);
+
+	extent_szind_set(extent, NBINS);
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
+	    NBINS, false);
+
+	assert(isalloc(tsdn, ptr) == LARGE_MINCLASS);
+
+	return LARGE_MINCLASS;
+}
+
+void
+arena_dalloc_promoted(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
+    bool slow_path) {
+	cassert(config_prof);
+	assert(opt_prof);
+
+	extent_t *extent = iealloc(tsdn, ptr);
+	size_t usize = arena_prof_demote(tsdn, extent, ptr);
+	if (usize <= tcache_maxclass) {
+		tcache_dalloc_large(tsdn_tsd(tsdn), tcache, ptr,
+		    sz_size2index(usize), slow_path);
+	} else {
+		large_dalloc(tsdn, extent);
+	}
+}
+
+static void
+arena_dissociate_bin_slab(arena_t *arena, extent_t *slab, bin_t *bin) {
+	/* Dissociate slab from bin. */
+	if (slab == bin->slabcur) {
+		bin->slabcur = NULL;
+	} else {
+		szind_t binind = extent_szind_get(slab);
+		const bin_info_t *bin_info = &bin_infos[binind];
+
+		/*
+		 * The following block's conditional is necessary because if the
+		 * slab only contains one region, then it never gets inserted
+		 * into the non-full slabs heap.
+		 */
+		if (bin_info->nregs == 1) {
+			arena_bin_slabs_full_remove(arena, bin, slab);
+		} else {
+			arena_bin_slabs_nonfull_remove(bin, slab);
+		}
+	}
+}
+
+static void
+arena_dalloc_bin_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
+    bin_t *bin) {
+	assert(slab != bin->slabcur);
+
+	malloc_mutex_unlock(tsdn, &bin->lock);
+	/******************************/
+	arena_slab_dalloc(tsdn, arena, slab);
+	/****************************/
+	malloc_mutex_lock(tsdn, &bin->lock);
+	if (config_stats) {
+		bin->stats.curslabs--;
+	}
+}
+
+static void
+arena_bin_lower_slab(UNUSED tsdn_t *tsdn, arena_t *arena, extent_t *slab,
+    bin_t *bin) {
+	assert(extent_nfree_get(slab) > 0);
+
+	/*
+	 * Make sure that if bin->slabcur is non-NULL, it refers to the
+	 * oldest/lowest non-full slab.  It is okay to NULL slabcur out rather
+	 * than proactively keeping it pointing at the oldest/lowest non-full
+	 * slab.
+	 */
+	if (bin->slabcur != NULL && extent_snad_comp(bin->slabcur, slab) > 0) {
+		/* Switch slabcur. */
+		if (extent_nfree_get(bin->slabcur) > 0) {
+			arena_bin_slabs_nonfull_insert(bin, bin->slabcur);
+		} else {
+			arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
+		}
+		bin->slabcur = slab;
+		if (config_stats) {
+			bin->stats.reslabs++;
+		}
+	} else {
+		arena_bin_slabs_nonfull_insert(bin, slab);
+	}
+}
+
+static void
+arena_dalloc_bin_locked_impl(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
+    void *ptr, bool junked) {
+	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
+	szind_t binind = extent_szind_get(slab);
+	bin_t *bin = &arena->bins[binind];
+	const bin_info_t *bin_info = &bin_infos[binind];
+
+	if (!junked && config_fill && unlikely(opt_junk_free)) {
+		arena_dalloc_junk_small(ptr, bin_info);
+	}
+
+	arena_slab_reg_dalloc(slab, slab_data, ptr);
+	unsigned nfree = extent_nfree_get(slab);
+	if (nfree == bin_info->nregs) {
+		arena_dissociate_bin_slab(arena, slab, bin);
+		arena_dalloc_bin_slab(tsdn, arena, slab, bin);
+	} else if (nfree == 1 && slab != bin->slabcur) {
+		arena_bin_slabs_full_remove(arena, bin, slab);
+		arena_bin_lower_slab(tsdn, arena, slab, bin);
+	}
+
+	if (config_stats) {
+		bin->stats.ndalloc++;
+		bin->stats.curregs--;
+	}
+}
+
+void
+arena_dalloc_bin_junked_locked(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
+    void *ptr) {
+	arena_dalloc_bin_locked_impl(tsdn, arena, extent, ptr, true);
+}
+
+static void
+arena_dalloc_bin(tsdn_t *tsdn, arena_t *arena, extent_t *extent, void *ptr) {
+	szind_t binind = extent_szind_get(extent);
+	bin_t *bin = &arena->bins[binind];
+
+	malloc_mutex_lock(tsdn, &bin->lock);
+	arena_dalloc_bin_locked_impl(tsdn, arena, extent, ptr, false);
+	malloc_mutex_unlock(tsdn, &bin->lock);
+}
+
+void
+arena_dalloc_small(tsdn_t *tsdn, void *ptr) {
+	extent_t *extent = iealloc(tsdn, ptr);
+	arena_t *arena = extent_arena_get(extent);
+
+	arena_dalloc_bin(tsdn, arena, extent, ptr);
+	arena_decay_tick(tsdn, arena);
+}
+
+bool
+arena_ralloc_no_move(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
+    size_t extra, bool zero) {
+	/* Calls with non-zero extra had to clamp extra. */
+	assert(extra == 0 || size + extra <= LARGE_MAXCLASS);
+
+	if (unlikely(size > LARGE_MAXCLASS)) {
+		return true;
+	}
+
+	extent_t *extent = iealloc(tsdn, ptr);
+	size_t usize_min = sz_s2u(size);
+	size_t usize_max = sz_s2u(size + extra);
+	if (likely(oldsize <= SMALL_MAXCLASS && usize_min <= SMALL_MAXCLASS)) {
+		/*
+		 * Avoid moving the allocation if the size class can be left the
+		 * same.
+		 */
+		assert(bin_infos[sz_size2index(oldsize)].reg_size ==
+		    oldsize);
+		if ((usize_max > SMALL_MAXCLASS || sz_size2index(usize_max) !=
+		    sz_size2index(oldsize)) && (size > oldsize || usize_max <
+		    oldsize)) {
+			return true;
+		}
+
+		arena_decay_tick(tsdn, extent_arena_get(extent));
+		return false;
+	} else if (oldsize >= LARGE_MINCLASS && usize_max >= LARGE_MINCLASS) {
+		return large_ralloc_no_move(tsdn, extent, usize_min, usize_max,
+		    zero);
+	}
+
+	return true;
+}
+
+static void *
+arena_ralloc_move_helper(tsdn_t *tsdn, arena_t *arena, size_t usize,
+    size_t alignment, bool zero, tcache_t *tcache) {
+	if (alignment == 0) {
+		return arena_malloc(tsdn, arena, usize, sz_size2index(usize),
+		    zero, tcache, true);
+	}
+	usize = sz_sa2u(usize, alignment);
+	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+		return NULL;
+	}
+	return ipalloct(tsdn, usize, alignment, zero, tcache, arena);
+}
+
+void *
+arena_ralloc(tsdn_t *tsdn, arena_t *arena, void *ptr, size_t oldsize,
+    size_t size, size_t alignment, bool zero, tcache_t *tcache) {
+	size_t usize = sz_s2u(size);
+	if (unlikely(usize == 0 || size > LARGE_MAXCLASS)) {
+		return NULL;
+	}
+
+	if (likely(usize <= SMALL_MAXCLASS)) {
+		/* Try to avoid moving the allocation. */
+		if (!arena_ralloc_no_move(tsdn, ptr, oldsize, usize, 0, zero)) {
+			return ptr;
+		}
+	}
+
+	if (oldsize >= LARGE_MINCLASS && usize >= LARGE_MINCLASS) {
+		return large_ralloc(tsdn, arena, iealloc(tsdn, ptr), usize,
+		    alignment, zero, tcache);
+	}
+
+	/*
+	 * size and oldsize are different enough that we need to move the
+	 * object.  In that case, fall back to allocating new space and copying.
+	 */
+	void *ret = arena_ralloc_move_helper(tsdn, arena, usize, alignment,
+	    zero, tcache);
+	if (ret == NULL) {
+		return NULL;
+	}
+
+	/*
+	 * Junk/zero-filling were already done by
+	 * ipalloc()/arena_malloc().
+	 */
+
+	size_t copysize = (usize < oldsize) ? usize : oldsize;
+	memcpy(ret, ptr, copysize);
+	isdalloct(tsdn, ptr, oldsize, tcache, NULL, true);
+	return ret;
+}
+
+dss_prec_t
+arena_dss_prec_get(arena_t *arena) {
+	return (dss_prec_t)atomic_load_u(&arena->dss_prec, ATOMIC_ACQUIRE);
+}
+
+bool
+arena_dss_prec_set(arena_t *arena, dss_prec_t dss_prec) {
+	if (!have_dss) {
+		return (dss_prec != dss_prec_disabled);
+	}
+	atomic_store_u(&arena->dss_prec, (unsigned)dss_prec, ATOMIC_RELEASE);
+	return false;
+}
+
+ssize_t
+arena_dirty_decay_ms_default_get(void) {
+	return atomic_load_zd(&dirty_decay_ms_default, ATOMIC_RELAXED);
+}
+
+bool
+arena_dirty_decay_ms_default_set(ssize_t decay_ms) {
+	if (!arena_decay_ms_valid(decay_ms)) {
+		return true;
+	}
+	atomic_store_zd(&dirty_decay_ms_default, decay_ms, ATOMIC_RELAXED);
+	return false;
+}
+
+ssize_t
+arena_muzzy_decay_ms_default_get(void) {
+	return atomic_load_zd(&muzzy_decay_ms_default, ATOMIC_RELAXED);
+}
+
+bool
+arena_muzzy_decay_ms_default_set(ssize_t decay_ms) {
+	if (!arena_decay_ms_valid(decay_ms)) {
+		return true;
+	}
+	atomic_store_zd(&muzzy_decay_ms_default, decay_ms, ATOMIC_RELAXED);
+	return false;
+}
+
+bool
+arena_retain_grow_limit_get_set(tsd_t *tsd, arena_t *arena, size_t *old_limit,
+    size_t *new_limit) {
+	assert(opt_retain);
+
+	pszind_t new_ind JEMALLOC_CC_SILENCE_INIT(0);
+	if (new_limit != NULL) {
+		size_t limit = *new_limit;
+		/* Grow no more than the new limit. */
+		if ((new_ind = sz_psz2ind(limit + 1) - 1) >
+		     EXTENT_GROW_MAX_PIND) {
+			return true;
+		}
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &arena->extent_grow_mtx);
+	if (old_limit != NULL) {
+		*old_limit = sz_pind2sz(arena->retain_grow_limit);
+	}
+	if (new_limit != NULL) {
+		arena->retain_grow_limit = new_ind;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), &arena->extent_grow_mtx);
+
+	return false;
+}
+
+unsigned
+arena_nthreads_get(arena_t *arena, bool internal) {
+	return atomic_load_u(&arena->nthreads[internal], ATOMIC_RELAXED);
+}
+
+void
+arena_nthreads_inc(arena_t *arena, bool internal) {
+	atomic_fetch_add_u(&arena->nthreads[internal], 1, ATOMIC_RELAXED);
+}
+
+void
+arena_nthreads_dec(arena_t *arena, bool internal) {
+	atomic_fetch_sub_u(&arena->nthreads[internal], 1, ATOMIC_RELAXED);
+}
+
+size_t
+arena_extent_sn_next(arena_t *arena) {
+	return atomic_fetch_add_zu(&arena->extent_sn_next, 1, ATOMIC_RELAXED);
+}
+
+arena_t *
+arena_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
+	arena_t *arena;
+	base_t *base;
+	unsigned i;
+
+	if (ind == 0) {
+		base = b0get();
+	} else {
+		base = base_new(tsdn, ind, extent_hooks);
+		if (base == NULL) {
+			return NULL;
+		}
+	}
+
+	arena = (arena_t *)base_alloc(tsdn, base, sizeof(arena_t), CACHELINE);
+	if (arena == NULL) {
+		goto label_error;
+	}
+
+	atomic_store_u(&arena->nthreads[0], 0, ATOMIC_RELAXED);
+	atomic_store_u(&arena->nthreads[1], 0, ATOMIC_RELAXED);
+	arena->last_thd = NULL;
+
+	if (config_stats) {
+		if (arena_stats_init(tsdn, &arena->stats)) {
+			goto label_error;
+		}
+
+		ql_new(&arena->tcache_ql);
+		ql_new(&arena->cache_bin_array_descriptor_ql);
+		if (malloc_mutex_init(&arena->tcache_ql_mtx, "tcache_ql",
+		    WITNESS_RANK_TCACHE_QL, malloc_mutex_rank_exclusive)) {
+			goto label_error;
+		}
+	}
+
+	if (config_prof) {
+		if (prof_accum_init(tsdn, &arena->prof_accum)) {
+			goto label_error;
+		}
+	}
+
+	if (config_cache_oblivious) {
+		/*
+		 * A nondeterministic seed based on the address of arena reduces
+		 * the likelihood of lockstep non-uniform cache index
+		 * utilization among identical concurrent processes, but at the
+		 * cost of test repeatability.  For debug builds, instead use a
+		 * deterministic seed.
+		 */
+		atomic_store_zu(&arena->offset_state, config_debug ? ind :
+		    (size_t)(uintptr_t)arena, ATOMIC_RELAXED);
+	}
+
+	atomic_store_zu(&arena->extent_sn_next, 0, ATOMIC_RELAXED);
+
+	atomic_store_u(&arena->dss_prec, (unsigned)extent_dss_prec_get(),
+	    ATOMIC_RELAXED);
+
+	atomic_store_zu(&arena->nactive, 0, ATOMIC_RELAXED);
+
+	extent_list_init(&arena->large);
+	if (malloc_mutex_init(&arena->large_mtx, "arena_large",
+	    WITNESS_RANK_ARENA_LARGE, malloc_mutex_rank_exclusive)) {
+		goto label_error;
+	}
+
+	/*
+	 * Delay coalescing for dirty extents despite the disruptive effect on
+	 * memory layout for best-fit extent allocation, since cached extents
+	 * are likely to be reused soon after deallocation, and the cost of
+	 * merging/splitting extents is non-trivial.
+	 */
+	if (extents_init(tsdn, &arena->extents_dirty, extent_state_dirty,
+	    true)) {
+		goto label_error;
+	}
+	/*
+	 * Coalesce muzzy extents immediately, because operations on them are in
+	 * the critical path much less often than for dirty extents.
+	 */
+	if (extents_init(tsdn, &arena->extents_muzzy, extent_state_muzzy,
+	    false)) {
+		goto label_error;
+	}
+	/*
+	 * Coalesce retained extents immediately, in part because they will
+	 * never be evicted (and therefore there's no opportunity for delayed
+	 * coalescing), but also because operations on retained extents are not
+	 * in the critical path.
+	 */
+	if (extents_init(tsdn, &arena->extents_retained, extent_state_retained,
+	    false)) {
+		goto label_error;
+	}
+
+	if (arena_decay_init(&arena->decay_dirty,
+	    arena_dirty_decay_ms_default_get(), &arena->stats.decay_dirty)) {
+		goto label_error;
+	}
+	if (arena_decay_init(&arena->decay_muzzy,
+	    arena_muzzy_decay_ms_default_get(), &arena->stats.decay_muzzy)) {
+		goto label_error;
+	}
+
+	arena->extent_grow_next = sz_psz2ind(HUGEPAGE);
+	arena->retain_grow_limit = EXTENT_GROW_MAX_PIND;
+	if (malloc_mutex_init(&arena->extent_grow_mtx, "extent_grow",
+	    WITNESS_RANK_EXTENT_GROW, malloc_mutex_rank_exclusive)) {
+		goto label_error;
+	}
+
+	extent_avail_new(&arena->extent_avail);
+	if (malloc_mutex_init(&arena->extent_avail_mtx, "extent_avail",
+	    WITNESS_RANK_EXTENT_AVAIL, malloc_mutex_rank_exclusive)) {
+		goto label_error;
+	}
+
+	/* Initialize bins. */
+	for (i = 0; i < NBINS; i++) {
+		bool err = bin_init(&arena->bins[i]);
+		if (err) {
+			goto label_error;
+		}
+	}
+
+	arena->base = base;
+	/* Set arena before creating background threads. */
+	arena_set(ind, arena);
+
+	nstime_init(&arena->create_time, 0);
+	nstime_update(&arena->create_time);
+
+	/* We don't support reentrancy for arena 0 bootstrapping. */
+	if (ind != 0) {
+		/*
+		 * If we're here, then arena 0 already exists, so bootstrapping
+		 * is done enough that we should have tsd.
+		 */
+		assert(!tsdn_null(tsdn));
+		pre_reentrancy(tsdn_tsd(tsdn), arena);
+		if (hooks_arena_new_hook) {
+			hooks_arena_new_hook();
+		}
+		post_reentrancy(tsdn_tsd(tsdn));
+	}
+
+	return arena;
+label_error:
+	if (ind != 0) {
+		base_delete(tsdn, base);
+	}
+	return NULL;
+}
+
+void
+arena_boot(void) {
+	arena_dirty_decay_ms_default_set(opt_dirty_decay_ms);
+	arena_muzzy_decay_ms_default_set(opt_muzzy_decay_ms);
+#define REGIND_bin_yes(index, reg_size) 				\
+	div_init(&arena_binind_div_info[(index)], (reg_size));
+#define REGIND_bin_no(index, reg_size)
+#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs,		\
+    lg_delta_lookup)							\
+	REGIND_bin_##bin(index, (1U<<lg_grp) + (ndelta << lg_delta))
+	SIZE_CLASSES
+#undef REGIND_bin_yes
+#undef REGIND_bin_no
+#undef SC
+}
+
+void
+arena_prefork0(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_prefork(tsdn, &arena->decay_dirty.mtx);
+	malloc_mutex_prefork(tsdn, &arena->decay_muzzy.mtx);
+}
+
+void
+arena_prefork1(tsdn_t *tsdn, arena_t *arena) {
+	if (config_stats) {
+		malloc_mutex_prefork(tsdn, &arena->tcache_ql_mtx);
+	}
+}
+
+void
+arena_prefork2(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_prefork(tsdn, &arena->extent_grow_mtx);
+}
+
+void
+arena_prefork3(tsdn_t *tsdn, arena_t *arena) {
+	extents_prefork(tsdn, &arena->extents_dirty);
+	extents_prefork(tsdn, &arena->extents_muzzy);
+	extents_prefork(tsdn, &arena->extents_retained);
+}
+
+void
+arena_prefork4(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_prefork(tsdn, &arena->extent_avail_mtx);
+}
+
+void
+arena_prefork5(tsdn_t *tsdn, arena_t *arena) {
+	base_prefork(tsdn, arena->base);
+}
+
+void
+arena_prefork6(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_prefork(tsdn, &arena->large_mtx);
+}
+
+void
+arena_prefork7(tsdn_t *tsdn, arena_t *arena) {
+	for (unsigned i = 0; i < NBINS; i++) {
+		bin_prefork(tsdn, &arena->bins[i]);
+	}
+}
+
+void
+arena_postfork_parent(tsdn_t *tsdn, arena_t *arena) {
+	unsigned i;
+
+	for (i = 0; i < NBINS; i++) {
+		bin_postfork_parent(tsdn, &arena->bins[i]);
+	}
+	malloc_mutex_postfork_parent(tsdn, &arena->large_mtx);
+	base_postfork_parent(tsdn, arena->base);
+	malloc_mutex_postfork_parent(tsdn, &arena->extent_avail_mtx);
+	extents_postfork_parent(tsdn, &arena->extents_dirty);
+	extents_postfork_parent(tsdn, &arena->extents_muzzy);
+	extents_postfork_parent(tsdn, &arena->extents_retained);
+	malloc_mutex_postfork_parent(tsdn, &arena->extent_grow_mtx);
+	malloc_mutex_postfork_parent(tsdn, &arena->decay_dirty.mtx);
+	malloc_mutex_postfork_parent(tsdn, &arena->decay_muzzy.mtx);
+	if (config_stats) {
+		malloc_mutex_postfork_parent(tsdn, &arena->tcache_ql_mtx);
+	}
+}
+
+void
+arena_postfork_child(tsdn_t *tsdn, arena_t *arena) {
+	unsigned i;
+
+	atomic_store_u(&arena->nthreads[0], 0, ATOMIC_RELAXED);
+	atomic_store_u(&arena->nthreads[1], 0, ATOMIC_RELAXED);
+	if (tsd_arena_get(tsdn_tsd(tsdn)) == arena) {
+		arena_nthreads_inc(arena, false);
+	}
+	if (tsd_iarena_get(tsdn_tsd(tsdn)) == arena) {
+		arena_nthreads_inc(arena, true);
+	}
+	if (config_stats) {
+		ql_new(&arena->tcache_ql);
+		ql_new(&arena->cache_bin_array_descriptor_ql);
+		tcache_t *tcache = tcache_get(tsdn_tsd(tsdn));
+		if (tcache != NULL && tcache->arena == arena) {
+			ql_elm_new(tcache, link);
+			ql_tail_insert(&arena->tcache_ql, tcache, link);
+			cache_bin_array_descriptor_init(
+			    &tcache->cache_bin_array_descriptor,
+			    tcache->bins_small, tcache->bins_large);
+			ql_tail_insert(&arena->cache_bin_array_descriptor_ql,
+			    &tcache->cache_bin_array_descriptor, link);
+		}
+	}
+
+	for (i = 0; i < NBINS; i++) {
+		bin_postfork_child(tsdn, &arena->bins[i]);
+	}
+	malloc_mutex_postfork_child(tsdn, &arena->large_mtx);
+	base_postfork_child(tsdn, arena->base);
+	malloc_mutex_postfork_child(tsdn, &arena->extent_avail_mtx);
+	extents_postfork_child(tsdn, &arena->extents_dirty);
+	extents_postfork_child(tsdn, &arena->extents_muzzy);
+	extents_postfork_child(tsdn, &arena->extents_retained);
+	malloc_mutex_postfork_child(tsdn, &arena->extent_grow_mtx);
+	malloc_mutex_postfork_child(tsdn, &arena->decay_dirty.mtx);
+	malloc_mutex_postfork_child(tsdn, &arena->decay_muzzy.mtx);
+	if (config_stats) {
+		malloc_mutex_postfork_child(tsdn, &arena->tcache_ql_mtx);
+	}
+}
diff --git a/redis-stable/deps/jemalloc/src/background_thread.c b/redis-stable/deps/jemalloc/src/background_thread.c
new file mode 100644
index 00000000..457669c9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/background_thread.c
@@ -0,0 +1,915 @@
+#define JEMALLOC_BACKGROUND_THREAD_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+
+/******************************************************************************/
+/* Data. */
+
+/* This option should be opt-in only. */
+#define BACKGROUND_THREAD_DEFAULT false
+/* Read-only after initialization. */
+bool opt_background_thread = BACKGROUND_THREAD_DEFAULT;
+size_t opt_max_background_threads = MAX_BACKGROUND_THREAD_LIMIT;
+
+/* Used for thread creation, termination and stats. */
+malloc_mutex_t background_thread_lock;
+/* Indicates global state.  Atomic because decay reads this w/o locking. */
+atomic_b_t background_thread_enabled_state;
+size_t n_background_threads;
+size_t max_background_threads;
+/* Thread info per-index. */
+background_thread_info_t *background_thread_info;
+
+/* False if no necessary runtime support. */
+bool can_enable_background_thread;
+
+/******************************************************************************/
+
+#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
+#include <dlfcn.h>
+
+static int (*pthread_create_fptr)(pthread_t *__restrict, const pthread_attr_t *,
+    void *(*)(void *), void *__restrict);
+
+static void
+pthread_create_wrapper_init(void) {
+#ifdef JEMALLOC_LAZY_LOCK
+	if (!isthreaded) {
+		isthreaded = true;
+	}
+#endif
+}
+
+int
+pthread_create_wrapper(pthread_t *__restrict thread, const pthread_attr_t *attr,
+    void *(*start_routine)(void *), void *__restrict arg) {
+	pthread_create_wrapper_init();
+
+	return pthread_create_fptr(thread, attr, start_routine, arg);
+}
+#endif /* JEMALLOC_PTHREAD_CREATE_WRAPPER */
+
+#ifndef JEMALLOC_BACKGROUND_THREAD
+#define NOT_REACHED { not_reached(); }
+bool background_thread_create(tsd_t *tsd, unsigned arena_ind) NOT_REACHED
+bool background_threads_enable(tsd_t *tsd) NOT_REACHED
+bool background_threads_disable(tsd_t *tsd) NOT_REACHED
+void background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
+    arena_decay_t *decay, size_t npages_new) NOT_REACHED
+void background_thread_prefork0(tsdn_t *tsdn) NOT_REACHED
+void background_thread_prefork1(tsdn_t *tsdn) NOT_REACHED
+void background_thread_postfork_parent(tsdn_t *tsdn) NOT_REACHED
+void background_thread_postfork_child(tsdn_t *tsdn) NOT_REACHED
+bool background_thread_stats_read(tsdn_t *tsdn,
+    background_thread_stats_t *stats) NOT_REACHED
+void background_thread_ctl_init(tsdn_t *tsdn) NOT_REACHED
+#undef NOT_REACHED
+#else
+
+static bool background_thread_enabled_at_fork;
+
+static void
+background_thread_info_init(tsdn_t *tsdn, background_thread_info_t *info) {
+	background_thread_wakeup_time_set(tsdn, info, 0);
+	info->npages_to_purge_new = 0;
+	if (config_stats) {
+		info->tot_n_runs = 0;
+		nstime_init(&info->tot_sleep_time, 0);
+	}
+}
+
+static inline bool
+set_current_thread_affinity(UNUSED int cpu) {
+#if defined(JEMALLOC_HAVE_SCHED_SETAFFINITY)
+	cpu_set_t cpuset;
+	CPU_ZERO(&cpuset);
+	CPU_SET(cpu, &cpuset);
+	int ret = sched_setaffinity(0, sizeof(cpu_set_t), &cpuset);
+
+	return (ret != 0);
+#else
+	return false;
+#endif
+}
+
+/* Threshold for determining when to wake up the background thread. */
+#define BACKGROUND_THREAD_NPAGES_THRESHOLD UINT64_C(1024)
+#define BILLION UINT64_C(1000000000)
+/* Minimal sleep interval 100 ms. */
+#define BACKGROUND_THREAD_MIN_INTERVAL_NS (BILLION / 10)
+
+static inline size_t
+decay_npurge_after_interval(arena_decay_t *decay, size_t interval) {
+	size_t i;
+	uint64_t sum = 0;
+	for (i = 0; i < interval; i++) {
+		sum += decay->backlog[i] * h_steps[i];
+	}
+	for (; i < SMOOTHSTEP_NSTEPS; i++) {
+		sum += decay->backlog[i] * (h_steps[i] - h_steps[i - interval]);
+	}
+
+	return (size_t)(sum >> SMOOTHSTEP_BFP);
+}
+
+static uint64_t
+arena_decay_compute_purge_interval_impl(tsdn_t *tsdn, arena_decay_t *decay,
+    extents_t *extents) {
+	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
+		/* Use minimal interval if decay is contended. */
+		return BACKGROUND_THREAD_MIN_INTERVAL_NS;
+	}
+
+	uint64_t interval;
+	ssize_t decay_time = atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
+	if (decay_time <= 0) {
+		/* Purging is eagerly done or disabled currently. */
+		interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
+		goto label_done;
+	}
+
+	uint64_t decay_interval_ns = nstime_ns(&decay->interval);
+	assert(decay_interval_ns > 0);
+	size_t npages = extents_npages_get(extents);
+	if (npages == 0) {
+		unsigned i;
+		for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
+			if (decay->backlog[i] > 0) {
+				break;
+			}
+		}
+		if (i == SMOOTHSTEP_NSTEPS) {
+			/* No dirty pages recorded.  Sleep indefinitely. */
+			interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
+			goto label_done;
+		}
+	}
+	if (npages <= BACKGROUND_THREAD_NPAGES_THRESHOLD) {
+		/* Use max interval. */
+		interval = decay_interval_ns * SMOOTHSTEP_NSTEPS;
+		goto label_done;
+	}
+
+	size_t lb = BACKGROUND_THREAD_MIN_INTERVAL_NS / decay_interval_ns;
+	size_t ub = SMOOTHSTEP_NSTEPS;
+	/* Minimal 2 intervals to ensure reaching next epoch deadline. */
+	lb = (lb < 2) ? 2 : lb;
+	if ((decay_interval_ns * ub <= BACKGROUND_THREAD_MIN_INTERVAL_NS) ||
+	    (lb + 2 > ub)) {
+		interval = BACKGROUND_THREAD_MIN_INTERVAL_NS;
+		goto label_done;
+	}
+
+	assert(lb + 2 <= ub);
+	size_t npurge_lb, npurge_ub;
+	npurge_lb = decay_npurge_after_interval(decay, lb);
+	if (npurge_lb > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
+		interval = decay_interval_ns * lb;
+		goto label_done;
+	}
+	npurge_ub = decay_npurge_after_interval(decay, ub);
+	if (npurge_ub < BACKGROUND_THREAD_NPAGES_THRESHOLD) {
+		interval = decay_interval_ns * ub;
+		goto label_done;
+	}
+
+	unsigned n_search = 0;
+	size_t target, npurge;
+	while ((npurge_lb + BACKGROUND_THREAD_NPAGES_THRESHOLD < npurge_ub)
+	    && (lb + 2 < ub)) {
+		target = (lb + ub) / 2;
+		npurge = decay_npurge_after_interval(decay, target);
+		if (npurge > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
+			ub = target;
+			npurge_ub = npurge;
+		} else {
+			lb = target;
+			npurge_lb = npurge;
+		}
+		assert(n_search++ < lg_floor(SMOOTHSTEP_NSTEPS) + 1);
+	}
+	interval = decay_interval_ns * (ub + lb) / 2;
+label_done:
+	interval = (interval < BACKGROUND_THREAD_MIN_INTERVAL_NS) ?
+	    BACKGROUND_THREAD_MIN_INTERVAL_NS : interval;
+	malloc_mutex_unlock(tsdn, &decay->mtx);
+
+	return interval;
+}
+
+/* Compute purge interval for background threads. */
+static uint64_t
+arena_decay_compute_purge_interval(tsdn_t *tsdn, arena_t *arena) {
+	uint64_t i1, i2;
+	i1 = arena_decay_compute_purge_interval_impl(tsdn, &arena->decay_dirty,
+	    &arena->extents_dirty);
+	if (i1 == BACKGROUND_THREAD_MIN_INTERVAL_NS) {
+		return i1;
+	}
+	i2 = arena_decay_compute_purge_interval_impl(tsdn, &arena->decay_muzzy,
+	    &arena->extents_muzzy);
+
+	return i1 < i2 ? i1 : i2;
+}
+
+static void
+background_thread_sleep(tsdn_t *tsdn, background_thread_info_t *info,
+    uint64_t interval) {
+	if (config_stats) {
+		info->tot_n_runs++;
+	}
+	info->npages_to_purge_new = 0;
+
+	struct timeval tv;
+	/* Specific clock required by timedwait. */
+	gettimeofday(&tv, NULL);
+	nstime_t before_sleep;
+	nstime_init2(&before_sleep, tv.tv_sec, tv.tv_usec * 1000);
+
+	int ret;
+	if (interval == BACKGROUND_THREAD_INDEFINITE_SLEEP) {
+		assert(background_thread_indefinite_sleep(info));
+		ret = pthread_cond_wait(&info->cond, &info->mtx.lock);
+		assert(ret == 0);
+	} else {
+		assert(interval >= BACKGROUND_THREAD_MIN_INTERVAL_NS &&
+		    interval <= BACKGROUND_THREAD_INDEFINITE_SLEEP);
+		/* We need malloc clock (can be different from tv). */
+		nstime_t next_wakeup;
+		nstime_init(&next_wakeup, 0);
+		nstime_update(&next_wakeup);
+		nstime_iadd(&next_wakeup, interval);
+		assert(nstime_ns(&next_wakeup) <
+		    BACKGROUND_THREAD_INDEFINITE_SLEEP);
+		background_thread_wakeup_time_set(tsdn, info,
+		    nstime_ns(&next_wakeup));
+
+		nstime_t ts_wakeup;
+		nstime_copy(&ts_wakeup, &before_sleep);
+		nstime_iadd(&ts_wakeup, interval);
+		struct timespec ts;
+		ts.tv_sec = (size_t)nstime_sec(&ts_wakeup);
+		ts.tv_nsec = (size_t)nstime_nsec(&ts_wakeup);
+
+		assert(!background_thread_indefinite_sleep(info));
+		ret = pthread_cond_timedwait(&info->cond, &info->mtx.lock, &ts);
+		assert(ret == ETIMEDOUT || ret == 0);
+		background_thread_wakeup_time_set(tsdn, info,
+		    BACKGROUND_THREAD_INDEFINITE_SLEEP);
+	}
+	if (config_stats) {
+		gettimeofday(&tv, NULL);
+		nstime_t after_sleep;
+		nstime_init2(&after_sleep, tv.tv_sec, tv.tv_usec * 1000);
+		if (nstime_compare(&after_sleep, &before_sleep) > 0) {
+			nstime_subtract(&after_sleep, &before_sleep);
+			nstime_add(&info->tot_sleep_time, &after_sleep);
+		}
+	}
+}
+
+static bool
+background_thread_pause_check(tsdn_t *tsdn, background_thread_info_t *info) {
+	if (unlikely(info->state == background_thread_paused)) {
+		malloc_mutex_unlock(tsdn, &info->mtx);
+		/* Wait on global lock to update status. */
+		malloc_mutex_lock(tsdn, &background_thread_lock);
+		malloc_mutex_unlock(tsdn, &background_thread_lock);
+		malloc_mutex_lock(tsdn, &info->mtx);
+		return true;
+	}
+
+	return false;
+}
+
+static inline void
+background_work_sleep_once(tsdn_t *tsdn, background_thread_info_t *info, unsigned ind) {
+	uint64_t min_interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
+	unsigned narenas = narenas_total_get();
+
+	for (unsigned i = ind; i < narenas; i += max_background_threads) {
+		arena_t *arena = arena_get(tsdn, i, false);
+		if (!arena) {
+			continue;
+		}
+		arena_decay(tsdn, arena, true, false);
+		if (min_interval == BACKGROUND_THREAD_MIN_INTERVAL_NS) {
+			/* Min interval will be used. */
+			continue;
+		}
+		uint64_t interval = arena_decay_compute_purge_interval(tsdn,
+		    arena);
+		assert(interval >= BACKGROUND_THREAD_MIN_INTERVAL_NS);
+		if (min_interval > interval) {
+			min_interval = interval;
+		}
+	}
+	background_thread_sleep(tsdn, info, min_interval);
+}
+
+static bool
+background_threads_disable_single(tsd_t *tsd, background_thread_info_t *info) {
+	if (info == &background_thread_info[0]) {
+		malloc_mutex_assert_owner(tsd_tsdn(tsd),
+		    &background_thread_lock);
+	} else {
+		malloc_mutex_assert_not_owner(tsd_tsdn(tsd),
+		    &background_thread_lock);
+	}
+
+	pre_reentrancy(tsd, NULL);
+	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+	bool has_thread;
+	assert(info->state != background_thread_paused);
+	if (info->state == background_thread_started) {
+		has_thread = true;
+		info->state = background_thread_stopped;
+		pthread_cond_signal(&info->cond);
+	} else {
+		has_thread = false;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+
+	if (!has_thread) {
+		post_reentrancy(tsd);
+		return false;
+	}
+	void *ret;
+	if (pthread_join(info->thread, &ret)) {
+		post_reentrancy(tsd);
+		return true;
+	}
+	assert(ret == NULL);
+	n_background_threads--;
+	post_reentrancy(tsd);
+
+	return false;
+}
+
+static void *background_thread_entry(void *ind_arg);
+
+static int
+background_thread_create_signals_masked(pthread_t *thread,
+    const pthread_attr_t *attr, void *(*start_routine)(void *), void *arg) {
+	/*
+	 * Mask signals during thread creation so that the thread inherits
+	 * an empty signal set.
+	 */
+	sigset_t set;
+	sigfillset(&set);
+	sigset_t oldset;
+	int mask_err = pthread_sigmask(SIG_SETMASK, &set, &oldset);
+	if (mask_err != 0) {
+		return mask_err;
+	}
+	int create_err = pthread_create_wrapper(thread, attr, start_routine,
+	    arg);
+	/*
+	 * Restore the signal mask.  Failure to restore the signal mask here
+	 * changes program behavior.
+	 */
+	int restore_err = pthread_sigmask(SIG_SETMASK, &oldset, NULL);
+	if (restore_err != 0) {
+		malloc_printf("<jemalloc>: background thread creation "
+		    "failed (%d), and signal mask restoration failed "
+		    "(%d)\n", create_err, restore_err);
+		if (opt_abort) {
+			abort();
+		}
+	}
+	return create_err;
+}
+
+static bool
+check_background_thread_creation(tsd_t *tsd, unsigned *n_created,
+    bool *created_threads) {
+	bool ret = false;
+	if (likely(*n_created == n_background_threads)) {
+		return ret;
+	}
+
+	tsdn_t *tsdn = tsd_tsdn(tsd);
+	malloc_mutex_unlock(tsdn, &background_thread_info[0].mtx);
+	for (unsigned i = 1; i < max_background_threads; i++) {
+		if (created_threads[i]) {
+			continue;
+		}
+		background_thread_info_t *info = &background_thread_info[i];
+		malloc_mutex_lock(tsdn, &info->mtx);
+		/*
+		 * In case of the background_thread_paused state because of
+		 * arena reset, delay the creation.
+		 */
+		bool create = (info->state == background_thread_started);
+		malloc_mutex_unlock(tsdn, &info->mtx);
+		if (!create) {
+			continue;
+		}
+
+		pre_reentrancy(tsd, NULL);
+		int err = background_thread_create_signals_masked(&info->thread,
+		    NULL, background_thread_entry, (void *)(uintptr_t)i);
+		post_reentrancy(tsd);
+
+		if (err == 0) {
+			(*n_created)++;
+			created_threads[i] = true;
+		} else {
+			malloc_printf("<jemalloc>: background thread "
+			    "creation failed (%d)\n", err);
+			if (opt_abort) {
+				abort();
+			}
+		}
+		/* Return to restart the loop since we unlocked. */
+		ret = true;
+		break;
+	}
+	malloc_mutex_lock(tsdn, &background_thread_info[0].mtx);
+
+	return ret;
+}
+
+static void
+background_thread0_work(tsd_t *tsd) {
+	/* Thread0 is also responsible for launching / terminating threads. */
+	VARIABLE_ARRAY(bool, created_threads, max_background_threads);
+	unsigned i;
+	for (i = 1; i < max_background_threads; i++) {
+		created_threads[i] = false;
+	}
+	/* Start working, and create more threads when asked. */
+	unsigned n_created = 1;
+	while (background_thread_info[0].state != background_thread_stopped) {
+		if (background_thread_pause_check(tsd_tsdn(tsd),
+		    &background_thread_info[0])) {
+			continue;
+		}
+		if (check_background_thread_creation(tsd, &n_created,
+		    (bool *)&created_threads)) {
+			continue;
+		}
+		background_work_sleep_once(tsd_tsdn(tsd),
+		    &background_thread_info[0], 0);
+	}
+
+	/*
+	 * Shut down other threads at exit.  Note that the ctl thread is holding
+	 * the global background_thread mutex (and is waiting) for us.
+	 */
+	assert(!background_thread_enabled());
+	for (i = 1; i < max_background_threads; i++) {
+		background_thread_info_t *info = &background_thread_info[i];
+		assert(info->state != background_thread_paused);
+		if (created_threads[i]) {
+			background_threads_disable_single(tsd, info);
+		} else {
+			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+			if (info->state != background_thread_stopped) {
+				/* The thread was not created. */
+				assert(info->state ==
+				    background_thread_started);
+				n_background_threads--;
+				info->state = background_thread_stopped;
+			}
+			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+		}
+	}
+	background_thread_info[0].state = background_thread_stopped;
+	assert(n_background_threads == 1);
+}
+
+static void
+background_work(tsd_t *tsd, unsigned ind) {
+	background_thread_info_t *info = &background_thread_info[ind];
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+	background_thread_wakeup_time_set(tsd_tsdn(tsd), info,
+	    BACKGROUND_THREAD_INDEFINITE_SLEEP);
+	if (ind == 0) {
+		background_thread0_work(tsd);
+	} else {
+		while (info->state != background_thread_stopped) {
+			if (background_thread_pause_check(tsd_tsdn(tsd),
+			    info)) {
+				continue;
+			}
+			background_work_sleep_once(tsd_tsdn(tsd), info, ind);
+		}
+	}
+	assert(info->state == background_thread_stopped);
+	background_thread_wakeup_time_set(tsd_tsdn(tsd), info, 0);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+}
+
+static void *
+background_thread_entry(void *ind_arg) {
+	unsigned thread_ind = (unsigned)(uintptr_t)ind_arg;
+	assert(thread_ind < max_background_threads);
+#ifdef JEMALLOC_HAVE_PTHREAD_SETNAME_NP
+	pthread_setname_np(pthread_self(), "jemalloc_bg_thd");
+#endif
+	if (opt_percpu_arena != percpu_arena_disabled) {
+		set_current_thread_affinity((int)thread_ind);
+	}
+	/*
+	 * Start periodic background work.  We use internal tsd which avoids
+	 * side effects, for example triggering new arena creation (which in
+	 * turn triggers another background thread creation).
+	 */
+	background_work(tsd_internal_fetch(), thread_ind);
+	assert(pthread_equal(pthread_self(),
+	    background_thread_info[thread_ind].thread));
+
+	return NULL;
+}
+
+static void
+background_thread_init(tsd_t *tsd, background_thread_info_t *info) {
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
+	info->state = background_thread_started;
+	background_thread_info_init(tsd_tsdn(tsd), info);
+	n_background_threads++;
+}
+
+/* Create a new background thread if needed. */
+bool
+background_thread_create(tsd_t *tsd, unsigned arena_ind) {
+	assert(have_background_thread);
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
+
+	/* We create at most NCPUs threads. */
+	size_t thread_ind = arena_ind % max_background_threads;
+	background_thread_info_t *info = &background_thread_info[thread_ind];
+
+	bool need_new_thread;
+	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+	need_new_thread = background_thread_enabled() &&
+	    (info->state == background_thread_stopped);
+	if (need_new_thread) {
+		background_thread_init(tsd, info);
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+	if (!need_new_thread) {
+		return false;
+	}
+	if (arena_ind != 0) {
+		/* Threads are created asynchronously by Thread 0. */
+		background_thread_info_t *t0 = &background_thread_info[0];
+		malloc_mutex_lock(tsd_tsdn(tsd), &t0->mtx);
+		assert(t0->state == background_thread_started);
+		pthread_cond_signal(&t0->cond);
+		malloc_mutex_unlock(tsd_tsdn(tsd), &t0->mtx);
+
+		return false;
+	}
+
+	pre_reentrancy(tsd, NULL);
+	/*
+	 * To avoid complications (besides reentrancy), create internal
+	 * background threads with the underlying pthread_create.
+	 */
+	int err = background_thread_create_signals_masked(&info->thread, NULL,
+	    background_thread_entry, (void *)thread_ind);
+	post_reentrancy(tsd);
+
+	if (err != 0) {
+		malloc_printf("<jemalloc>: arena 0 background thread creation "
+		    "failed (%d)\n", err);
+		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+		info->state = background_thread_stopped;
+		n_background_threads--;
+		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+
+		return true;
+	}
+
+	return false;
+}
+
+bool
+background_threads_enable(tsd_t *tsd) {
+	assert(n_background_threads == 0);
+	assert(background_thread_enabled());
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
+
+	VARIABLE_ARRAY(bool, marked, max_background_threads);
+	unsigned i, nmarked;
+	for (i = 0; i < max_background_threads; i++) {
+		marked[i] = false;
+	}
+	nmarked = 0;
+	/* Thread 0 is required and created at the end. */
+	marked[0] = true;
+	/* Mark the threads we need to create for thread 0. */
+	unsigned n = narenas_total_get();
+	for (i = 1; i < n; i++) {
+		if (marked[i % max_background_threads] ||
+		    arena_get(tsd_tsdn(tsd), i, false) == NULL) {
+			continue;
+		}
+		background_thread_info_t *info = &background_thread_info[
+		    i % max_background_threads];
+		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+		assert(info->state == background_thread_stopped);
+		background_thread_init(tsd, info);
+		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+		marked[i % max_background_threads] = true;
+		if (++nmarked == max_background_threads) {
+			break;
+		}
+	}
+
+	return background_thread_create(tsd, 0);
+}
+
+bool
+background_threads_disable(tsd_t *tsd) {
+	assert(!background_thread_enabled());
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
+
+	/* Thread 0 will be responsible for terminating other threads. */
+	if (background_threads_disable_single(tsd,
+	    &background_thread_info[0])) {
+		return true;
+	}
+	assert(n_background_threads == 0);
+
+	return false;
+}
+
+/* Check if we need to signal the background thread early. */
+void
+background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
+    arena_decay_t *decay, size_t npages_new) {
+	background_thread_info_t *info = arena_background_thread_info_get(
+	    arena);
+	if (malloc_mutex_trylock(tsdn, &info->mtx)) {
+		/*
+		 * Background thread may hold the mutex for a long period of
+		 * time.  We'd like to avoid the variance on application
+		 * threads.  So keep this non-blocking, and leave the work to a
+		 * future epoch.
+		 */
+		return;
+	}
+
+	if (info->state != background_thread_started) {
+		goto label_done;
+	}
+	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
+		goto label_done;
+	}
+
+	ssize_t decay_time = atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
+	if (decay_time <= 0) {
+		/* Purging is eagerly done or disabled currently. */
+		goto label_done_unlock2;
+	}
+	uint64_t decay_interval_ns = nstime_ns(&decay->interval);
+	assert(decay_interval_ns > 0);
+
+	nstime_t diff;
+	nstime_init(&diff, background_thread_wakeup_time_get(info));
+	if (nstime_compare(&diff, &decay->epoch) <= 0) {
+		goto label_done_unlock2;
+	}
+	nstime_subtract(&diff, &decay->epoch);
+	if (nstime_ns(&diff) < BACKGROUND_THREAD_MIN_INTERVAL_NS) {
+		goto label_done_unlock2;
+	}
+
+	if (npages_new > 0) {
+		size_t n_epoch = (size_t)(nstime_ns(&diff) / decay_interval_ns);
+		/*
+		 * Compute how many new pages we would need to purge by the next
+		 * wakeup, which is used to determine if we should signal the
+		 * background thread.
+		 */
+		uint64_t npurge_new;
+		if (n_epoch >= SMOOTHSTEP_NSTEPS) {
+			npurge_new = npages_new;
+		} else {
+			uint64_t h_steps_max = h_steps[SMOOTHSTEP_NSTEPS - 1];
+			assert(h_steps_max >=
+			    h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
+			npurge_new = npages_new * (h_steps_max -
+			    h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
+			npurge_new >>= SMOOTHSTEP_BFP;
+		}
+		info->npages_to_purge_new += npurge_new;
+	}
+
+	bool should_signal;
+	if (info->npages_to_purge_new > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
+		should_signal = true;
+	} else if (unlikely(background_thread_indefinite_sleep(info)) &&
+	    (extents_npages_get(&arena->extents_dirty) > 0 ||
+	    extents_npages_get(&arena->extents_muzzy) > 0 ||
+	    info->npages_to_purge_new > 0)) {
+		should_signal = true;
+	} else {
+		should_signal = false;
+	}
+
+	if (should_signal) {
+		info->npages_to_purge_new = 0;
+		pthread_cond_signal(&info->cond);
+	}
+label_done_unlock2:
+	malloc_mutex_unlock(tsdn, &decay->mtx);
+label_done:
+	malloc_mutex_unlock(tsdn, &info->mtx);
+}
+
+void
+background_thread_prefork0(tsdn_t *tsdn) {
+	malloc_mutex_prefork(tsdn, &background_thread_lock);
+	background_thread_enabled_at_fork = background_thread_enabled();
+}
+
+void
+background_thread_prefork1(tsdn_t *tsdn) {
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		malloc_mutex_prefork(tsdn, &background_thread_info[i].mtx);
+	}
+}
+
+void
+background_thread_postfork_parent(tsdn_t *tsdn) {
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		malloc_mutex_postfork_parent(tsdn,
+		    &background_thread_info[i].mtx);
+	}
+	malloc_mutex_postfork_parent(tsdn, &background_thread_lock);
+}
+
+void
+background_thread_postfork_child(tsdn_t *tsdn) {
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		malloc_mutex_postfork_child(tsdn,
+		    &background_thread_info[i].mtx);
+	}
+	malloc_mutex_postfork_child(tsdn, &background_thread_lock);
+	if (!background_thread_enabled_at_fork) {
+		return;
+	}
+
+	/* Clear background_thread state (reset to disabled for child). */
+	malloc_mutex_lock(tsdn, &background_thread_lock);
+	n_background_threads = 0;
+	background_thread_enabled_set(tsdn, false);
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		background_thread_info_t *info = &background_thread_info[i];
+		malloc_mutex_lock(tsdn, &info->mtx);
+		info->state = background_thread_stopped;
+		int ret = pthread_cond_init(&info->cond, NULL);
+		assert(ret == 0);
+		background_thread_info_init(tsdn, info);
+		malloc_mutex_unlock(tsdn, &info->mtx);
+	}
+	malloc_mutex_unlock(tsdn, &background_thread_lock);
+}
+
+bool
+background_thread_stats_read(tsdn_t *tsdn, background_thread_stats_t *stats) {
+	assert(config_stats);
+	malloc_mutex_lock(tsdn, &background_thread_lock);
+	if (!background_thread_enabled()) {
+		malloc_mutex_unlock(tsdn, &background_thread_lock);
+		return true;
+	}
+
+	stats->num_threads = n_background_threads;
+	uint64_t num_runs = 0;
+	nstime_init(&stats->run_interval, 0);
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		background_thread_info_t *info = &background_thread_info[i];
+		if (malloc_mutex_trylock(tsdn, &info->mtx)) {
+			/*
+			 * Each background thread run may take a long time;
+			 * avoid waiting on the stats if the thread is active.
+			 */
+			continue;
+		}
+		if (info->state != background_thread_stopped) {
+			num_runs += info->tot_n_runs;
+			nstime_add(&stats->run_interval, &info->tot_sleep_time);
+		}
+		malloc_mutex_unlock(tsdn, &info->mtx);
+	}
+	stats->num_runs = num_runs;
+	if (num_runs > 0) {
+		nstime_idivide(&stats->run_interval, num_runs);
+	}
+	malloc_mutex_unlock(tsdn, &background_thread_lock);
+
+	return false;
+}
+
+#undef BACKGROUND_THREAD_NPAGES_THRESHOLD
+#undef BILLION
+#undef BACKGROUND_THREAD_MIN_INTERVAL_NS
+
+static bool
+pthread_create_fptr_init(void) {
+	if (pthread_create_fptr != NULL) {
+		return false;
+	}
+	pthread_create_fptr = dlsym(RTLD_NEXT, "pthread_create");
+	if (pthread_create_fptr == NULL) {
+		can_enable_background_thread = false;
+		if (config_lazy_lock || opt_background_thread) {
+			malloc_write("<jemalloc>: Error in dlsym(RTLD_NEXT, "
+			    "\"pthread_create\")\n");
+			abort();
+		}
+	} else {
+		can_enable_background_thread = true;
+	}
+
+	return false;
+}
+
+/*
+ * When lazy lock is enabled, we need to make sure setting isthreaded before
+ * taking any background_thread locks.  This is called early in ctl (instead of
+ * wait for the pthread_create calls to trigger) because the mutex is required
+ * before creating background threads.
+ */
+void
+background_thread_ctl_init(tsdn_t *tsdn) {
+	malloc_mutex_assert_not_owner(tsdn, &background_thread_lock);
+#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
+	pthread_create_fptr_init();
+	pthread_create_wrapper_init();
+#endif
+}
+
+#endif /* defined(JEMALLOC_BACKGROUND_THREAD) */
+
+bool
+background_thread_boot0(void) {
+	if (!have_background_thread && opt_background_thread) {
+		malloc_printf("<jemalloc>: option background_thread currently "
+		    "supports pthread only\n");
+		return true;
+	}
+#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
+	if ((config_lazy_lock || opt_background_thread) &&
+	    pthread_create_fptr_init()) {
+		return true;
+	}
+#endif
+	return false;
+}
+
+bool
+background_thread_boot1(tsdn_t *tsdn) {
+#ifdef JEMALLOC_BACKGROUND_THREAD
+	assert(have_background_thread);
+	assert(narenas_total_get() > 0);
+
+	if (opt_max_background_threads == MAX_BACKGROUND_THREAD_LIMIT &&
+	    ncpus < MAX_BACKGROUND_THREAD_LIMIT) {
+		opt_max_background_threads = ncpus;
+	}
+	max_background_threads = opt_max_background_threads;
+
+	background_thread_enabled_set(tsdn, opt_background_thread);
+	if (malloc_mutex_init(&background_thread_lock,
+	    "background_thread_global",
+	    WITNESS_RANK_BACKGROUND_THREAD_GLOBAL,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+
+	background_thread_info = (background_thread_info_t *)base_alloc(tsdn,
+	    b0get(), opt_max_background_threads *
+	    sizeof(background_thread_info_t), CACHELINE);
+	if (background_thread_info == NULL) {
+		return true;
+	}
+
+	for (unsigned i = 0; i < max_background_threads; i++) {
+		background_thread_info_t *info = &background_thread_info[i];
+		/* Thread mutex is rank_inclusive because of thread0. */
+		if (malloc_mutex_init(&info->mtx, "background_thread",
+		    WITNESS_RANK_BACKGROUND_THREAD,
+		    malloc_mutex_address_ordered)) {
+			return true;
+		}
+		if (pthread_cond_init(&info->cond, NULL)) {
+			return true;
+		}
+		malloc_mutex_lock(tsdn, &info->mtx);
+		info->state = background_thread_stopped;
+		background_thread_info_init(tsdn, info);
+		malloc_mutex_unlock(tsdn, &info->mtx);
+	}
+#endif
+
+	return false;
+}
diff --git a/redis-stable/deps/jemalloc/src/base.c b/redis-stable/deps/jemalloc/src/base.c
new file mode 100644
index 00000000..b0324b5d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/base.c
@@ -0,0 +1,514 @@
+#define JEMALLOC_BASE_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/sz.h"
+
+/******************************************************************************/
+/* Data. */
+
+static base_t *b0;
+
+metadata_thp_mode_t opt_metadata_thp = METADATA_THP_DEFAULT;
+
+const char *metadata_thp_mode_names[] = {
+	"disabled",
+	"auto",
+	"always"
+};
+
+/******************************************************************************/
+
+static inline bool
+metadata_thp_madvise(void) {
+	return (metadata_thp_enabled() &&
+	    (init_system_thp_mode == thp_mode_default));
+}
+
+static void *
+base_map(tsdn_t *tsdn, extent_hooks_t *extent_hooks, unsigned ind, size_t size) {
+	void *addr;
+	bool zero = true;
+	bool commit = true;
+
+	/* Use huge page sizes and alignment regardless of opt_metadata_thp. */
+	assert(size == HUGEPAGE_CEILING(size));
+	size_t alignment = HUGEPAGE;
+	if (extent_hooks == &extent_hooks_default) {
+		addr = extent_alloc_mmap(NULL, size, alignment, &zero, &commit);
+	} else {
+		/* No arena context as we are creating new arenas. */
+		tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
+		pre_reentrancy(tsd, NULL);
+		addr = extent_hooks->alloc(extent_hooks, NULL, size, alignment,
+		    &zero, &commit, ind);
+		post_reentrancy(tsd);
+	}
+
+	return addr;
+}
+
+static void
+base_unmap(tsdn_t *tsdn, extent_hooks_t *extent_hooks, unsigned ind, void *addr,
+    size_t size) {
+	/*
+	 * Cascade through dalloc, decommit, purge_forced, and purge_lazy,
+	 * stopping at first success.  This cascade is performed for consistency
+	 * with the cascade in extent_dalloc_wrapper() because an application's
+	 * custom hooks may not support e.g. dalloc.  This function is only ever
+	 * called as a side effect of arena destruction, so although it might
+	 * seem pointless to do anything besides dalloc here, the application
+	 * may in fact want the end state of all associated virtual memory to be
+	 * in some consistent-but-allocated state.
+	 */
+	if (extent_hooks == &extent_hooks_default) {
+		if (!extent_dalloc_mmap(addr, size)) {
+			goto label_done;
+		}
+		if (!pages_decommit(addr, size)) {
+			goto label_done;
+		}
+		if (!pages_purge_forced(addr, size)) {
+			goto label_done;
+		}
+		if (!pages_purge_lazy(addr, size)) {
+			goto label_done;
+		}
+		/* Nothing worked.  This should never happen. */
+		not_reached();
+	} else {
+		tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
+		pre_reentrancy(tsd, NULL);
+		if (extent_hooks->dalloc != NULL &&
+		    !extent_hooks->dalloc(extent_hooks, addr, size, true,
+		    ind)) {
+			goto label_post_reentrancy;
+		}
+		if (extent_hooks->decommit != NULL &&
+		    !extent_hooks->decommit(extent_hooks, addr, size, 0, size,
+		    ind)) {
+			goto label_post_reentrancy;
+		}
+		if (extent_hooks->purge_forced != NULL &&
+		    !extent_hooks->purge_forced(extent_hooks, addr, size, 0,
+		    size, ind)) {
+			goto label_post_reentrancy;
+		}
+		if (extent_hooks->purge_lazy != NULL &&
+		    !extent_hooks->purge_lazy(extent_hooks, addr, size, 0, size,
+		    ind)) {
+			goto label_post_reentrancy;
+		}
+		/* Nothing worked.  That's the application's problem. */
+	label_post_reentrancy:
+		post_reentrancy(tsd);
+	}
+label_done:
+	if (metadata_thp_madvise()) {
+		/* Set NOHUGEPAGE after unmap to avoid kernel defrag. */
+		assert(((uintptr_t)addr & HUGEPAGE_MASK) == 0 &&
+		    (size & HUGEPAGE_MASK) == 0);
+		pages_nohuge(addr, size);
+	}
+}
+
+static void
+base_extent_init(size_t *extent_sn_next, extent_t *extent, void *addr,
+    size_t size) {
+	size_t sn;
+
+	sn = *extent_sn_next;
+	(*extent_sn_next)++;
+
+	extent_binit(extent, addr, size, sn);
+}
+
+static size_t
+base_get_num_blocks(base_t *base, bool with_new_block) {
+	base_block_t *b = base->blocks;
+	assert(b != NULL);
+
+	size_t n_blocks = with_new_block ? 2 : 1;
+	while (b->next != NULL) {
+		n_blocks++;
+		b = b->next;
+	}
+
+	return n_blocks;
+}
+
+static void
+base_auto_thp_switch(tsdn_t *tsdn, base_t *base) {
+	assert(opt_metadata_thp == metadata_thp_auto);
+	malloc_mutex_assert_owner(tsdn, &base->mtx);
+	if (base->auto_thp_switched) {
+		return;
+	}
+	/* Called when adding a new block. */
+	bool should_switch;
+	if (base_ind_get(base) != 0) {
+		should_switch = (base_get_num_blocks(base, true) ==
+		    BASE_AUTO_THP_THRESHOLD);
+	} else {
+		should_switch = (base_get_num_blocks(base, true) ==
+		    BASE_AUTO_THP_THRESHOLD_A0);
+	}
+	if (!should_switch) {
+		return;
+	}
+
+	base->auto_thp_switched = true;
+	assert(!config_stats || base->n_thp == 0);
+	/* Make the initial blocks THP lazily. */
+	base_block_t *block = base->blocks;
+	while (block != NULL) {
+		assert((block->size & HUGEPAGE_MASK) == 0);
+		pages_huge(block, block->size);
+		if (config_stats) {
+			base->n_thp += HUGEPAGE_CEILING(block->size -
+			    extent_bsize_get(&block->extent)) >> LG_HUGEPAGE;
+		}
+		block = block->next;
+		assert(block == NULL || (base_ind_get(base) == 0));
+	}
+}
+
+static void *
+base_extent_bump_alloc_helper(extent_t *extent, size_t *gap_size, size_t size,
+    size_t alignment) {
+	void *ret;
+
+	assert(alignment == ALIGNMENT_CEILING(alignment, QUANTUM));
+	assert(size == ALIGNMENT_CEILING(size, alignment));
+
+	*gap_size = ALIGNMENT_CEILING((uintptr_t)extent_addr_get(extent),
+	    alignment) - (uintptr_t)extent_addr_get(extent);
+	ret = (void *)((uintptr_t)extent_addr_get(extent) + *gap_size);
+	assert(extent_bsize_get(extent) >= *gap_size + size);
+	extent_binit(extent, (void *)((uintptr_t)extent_addr_get(extent) +
+	    *gap_size + size), extent_bsize_get(extent) - *gap_size - size,
+	    extent_sn_get(extent));
+	return ret;
+}
+
+static void
+base_extent_bump_alloc_post(base_t *base, extent_t *extent, size_t gap_size,
+    void *addr, size_t size) {
+	if (extent_bsize_get(extent) > 0) {
+		/*
+		 * Compute the index for the largest size class that does not
+		 * exceed extent's size.
+		 */
+		szind_t index_floor =
+		    sz_size2index(extent_bsize_get(extent) + 1) - 1;
+		extent_heap_insert(&base->avail[index_floor], extent);
+	}
+
+	if (config_stats) {
+		base->allocated += size;
+		/*
+		 * Add one PAGE to base_resident for every page boundary that is
+		 * crossed by the new allocation. Adjust n_thp similarly when
+		 * metadata_thp is enabled.
+		 */
+		base->resident += PAGE_CEILING((uintptr_t)addr + size) -
+		    PAGE_CEILING((uintptr_t)addr - gap_size);
+		assert(base->allocated <= base->resident);
+		assert(base->resident <= base->mapped);
+		if (metadata_thp_madvise() && (opt_metadata_thp ==
+		    metadata_thp_always || base->auto_thp_switched)) {
+			base->n_thp += (HUGEPAGE_CEILING((uintptr_t)addr + size)
+			    - HUGEPAGE_CEILING((uintptr_t)addr - gap_size)) >>
+			    LG_HUGEPAGE;
+			assert(base->mapped >= base->n_thp << LG_HUGEPAGE);
+		}
+	}
+}
+
+static void *
+base_extent_bump_alloc(base_t *base, extent_t *extent, size_t size,
+    size_t alignment) {
+	void *ret;
+	size_t gap_size;
+
+	ret = base_extent_bump_alloc_helper(extent, &gap_size, size, alignment);
+	base_extent_bump_alloc_post(base, extent, gap_size, ret, size);
+	return ret;
+}
+
+/*
+ * Allocate a block of virtual memory that is large enough to start with a
+ * base_block_t header, followed by an object of specified size and alignment.
+ * On success a pointer to the initialized base_block_t header is returned.
+ */
+static base_block_t *
+base_block_alloc(tsdn_t *tsdn, base_t *base, extent_hooks_t *extent_hooks,
+    unsigned ind, pszind_t *pind_last, size_t *extent_sn_next, size_t size,
+    size_t alignment) {
+	alignment = ALIGNMENT_CEILING(alignment, QUANTUM);
+	size_t usize = ALIGNMENT_CEILING(size, alignment);
+	size_t header_size = sizeof(base_block_t);
+	size_t gap_size = ALIGNMENT_CEILING(header_size, alignment) -
+	    header_size;
+	/*
+	 * Create increasingly larger blocks in order to limit the total number
+	 * of disjoint virtual memory ranges.  Choose the next size in the page
+	 * size class series (skipping size classes that are not a multiple of
+	 * HUGEPAGE), or a size large enough to satisfy the requested size and
+	 * alignment, whichever is larger.
+	 */
+	size_t min_block_size = HUGEPAGE_CEILING(sz_psz2u(header_size + gap_size
+	    + usize));
+	pszind_t pind_next = (*pind_last + 1 < NPSIZES) ? *pind_last + 1 :
+	    *pind_last;
+	size_t next_block_size = HUGEPAGE_CEILING(sz_pind2sz(pind_next));
+	size_t block_size = (min_block_size > next_block_size) ? min_block_size
+	    : next_block_size;
+	base_block_t *block = (base_block_t *)base_map(tsdn, extent_hooks, ind,
+	    block_size);
+	if (block == NULL) {
+		return NULL;
+	}
+
+	if (metadata_thp_madvise()) {
+		void *addr = (void *)block;
+		assert(((uintptr_t)addr & HUGEPAGE_MASK) == 0 &&
+		    (block_size & HUGEPAGE_MASK) == 0);
+		if (opt_metadata_thp == metadata_thp_always) {
+			pages_huge(addr, block_size);
+		} else if (opt_metadata_thp == metadata_thp_auto &&
+		    base != NULL) {
+			/* base != NULL indicates this is not a new base. */
+			malloc_mutex_lock(tsdn, &base->mtx);
+			base_auto_thp_switch(tsdn, base);
+			if (base->auto_thp_switched) {
+				pages_huge(addr, block_size);
+			}
+			malloc_mutex_unlock(tsdn, &base->mtx);
+		}
+	}
+
+	*pind_last = sz_psz2ind(block_size);
+	block->size = block_size;
+	block->next = NULL;
+	assert(block_size >= header_size);
+	base_extent_init(extent_sn_next, &block->extent,
+	    (void *)((uintptr_t)block + header_size), block_size - header_size);
+	return block;
+}
+
+/*
+ * Allocate an extent that is at least as large as specified size, with
+ * specified alignment.
+ */
+static extent_t *
+base_extent_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment) {
+	malloc_mutex_assert_owner(tsdn, &base->mtx);
+
+	extent_hooks_t *extent_hooks = base_extent_hooks_get(base);
+	/*
+	 * Drop mutex during base_block_alloc(), because an extent hook will be
+	 * called.
+	 */
+	malloc_mutex_unlock(tsdn, &base->mtx);
+	base_block_t *block = base_block_alloc(tsdn, base, extent_hooks,
+	    base_ind_get(base), &base->pind_last, &base->extent_sn_next, size,
+	    alignment);
+	malloc_mutex_lock(tsdn, &base->mtx);
+	if (block == NULL) {
+		return NULL;
+	}
+	block->next = base->blocks;
+	base->blocks = block;
+	if (config_stats) {
+		base->allocated += sizeof(base_block_t);
+		base->resident += PAGE_CEILING(sizeof(base_block_t));
+		base->mapped += block->size;
+		if (metadata_thp_madvise() &&
+		    !(opt_metadata_thp == metadata_thp_auto
+		      && !base->auto_thp_switched)) {
+			assert(base->n_thp > 0);
+			base->n_thp += HUGEPAGE_CEILING(sizeof(base_block_t)) >>
+			    LG_HUGEPAGE;
+		}
+		assert(base->allocated <= base->resident);
+		assert(base->resident <= base->mapped);
+		assert(base->n_thp << LG_HUGEPAGE <= base->mapped);
+	}
+	return &block->extent;
+}
+
+base_t *
+b0get(void) {
+	return b0;
+}
+
+base_t *
+base_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
+	pszind_t pind_last = 0;
+	size_t extent_sn_next = 0;
+	base_block_t *block = base_block_alloc(tsdn, NULL, extent_hooks, ind,
+	    &pind_last, &extent_sn_next, sizeof(base_t), QUANTUM);
+	if (block == NULL) {
+		return NULL;
+	}
+
+	size_t gap_size;
+	size_t base_alignment = CACHELINE;
+	size_t base_size = ALIGNMENT_CEILING(sizeof(base_t), base_alignment);
+	base_t *base = (base_t *)base_extent_bump_alloc_helper(&block->extent,
+	    &gap_size, base_size, base_alignment);
+	base->ind = ind;
+	atomic_store_p(&base->extent_hooks, extent_hooks, ATOMIC_RELAXED);
+	if (malloc_mutex_init(&base->mtx, "base", WITNESS_RANK_BASE,
+	    malloc_mutex_rank_exclusive)) {
+		base_unmap(tsdn, extent_hooks, ind, block, block->size);
+		return NULL;
+	}
+	base->pind_last = pind_last;
+	base->extent_sn_next = extent_sn_next;
+	base->blocks = block;
+	base->auto_thp_switched = false;
+	for (szind_t i = 0; i < NSIZES; i++) {
+		extent_heap_new(&base->avail[i]);
+	}
+	if (config_stats) {
+		base->allocated = sizeof(base_block_t);
+		base->resident = PAGE_CEILING(sizeof(base_block_t));
+		base->mapped = block->size;
+		base->n_thp = (opt_metadata_thp == metadata_thp_always) &&
+		    metadata_thp_madvise() ? HUGEPAGE_CEILING(sizeof(base_block_t))
+		    >> LG_HUGEPAGE : 0;
+		assert(base->allocated <= base->resident);
+		assert(base->resident <= base->mapped);
+		assert(base->n_thp << LG_HUGEPAGE <= base->mapped);
+	}
+	base_extent_bump_alloc_post(base, &block->extent, gap_size, base,
+	    base_size);
+
+	return base;
+}
+
+void
+base_delete(tsdn_t *tsdn, base_t *base) {
+	extent_hooks_t *extent_hooks = base_extent_hooks_get(base);
+	base_block_t *next = base->blocks;
+	do {
+		base_block_t *block = next;
+		next = block->next;
+		base_unmap(tsdn, extent_hooks, base_ind_get(base), block,
+		    block->size);
+	} while (next != NULL);
+}
+
+extent_hooks_t *
+base_extent_hooks_get(base_t *base) {
+	return (extent_hooks_t *)atomic_load_p(&base->extent_hooks,
+	    ATOMIC_ACQUIRE);
+}
+
+extent_hooks_t *
+base_extent_hooks_set(base_t *base, extent_hooks_t *extent_hooks) {
+	extent_hooks_t *old_extent_hooks = base_extent_hooks_get(base);
+	atomic_store_p(&base->extent_hooks, extent_hooks, ATOMIC_RELEASE);
+	return old_extent_hooks;
+}
+
+static void *
+base_alloc_impl(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment,
+    size_t *esn) {
+	alignment = QUANTUM_CEILING(alignment);
+	size_t usize = ALIGNMENT_CEILING(size, alignment);
+	size_t asize = usize + alignment - QUANTUM;
+
+	extent_t *extent = NULL;
+	malloc_mutex_lock(tsdn, &base->mtx);
+	for (szind_t i = sz_size2index(asize); i < NSIZES; i++) {
+		extent = extent_heap_remove_first(&base->avail[i]);
+		if (extent != NULL) {
+			/* Use existing space. */
+			break;
+		}
+	}
+	if (extent == NULL) {
+		/* Try to allocate more space. */
+		extent = base_extent_alloc(tsdn, base, usize, alignment);
+	}
+	void *ret;
+	if (extent == NULL) {
+		ret = NULL;
+		goto label_return;
+	}
+
+	ret = base_extent_bump_alloc(base, extent, usize, alignment);
+	if (esn != NULL) {
+		*esn = extent_sn_get(extent);
+	}
+label_return:
+	malloc_mutex_unlock(tsdn, &base->mtx);
+	return ret;
+}
+
+/*
+ * base_alloc() returns zeroed memory, which is always demand-zeroed for the
+ * auto arenas, in order to make multi-page sparse data structures such as radix
+ * tree nodes efficient with respect to physical memory usage.  Upon success a
+ * pointer to at least size bytes with specified alignment is returned.  Note
+ * that size is rounded up to the nearest multiple of alignment to avoid false
+ * sharing.
+ */
+void *
+base_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment) {
+	return base_alloc_impl(tsdn, base, size, alignment, NULL);
+}
+
+extent_t *
+base_alloc_extent(tsdn_t *tsdn, base_t *base) {
+	size_t esn;
+	extent_t *extent = base_alloc_impl(tsdn, base, sizeof(extent_t),
+	    CACHELINE, &esn);
+	if (extent == NULL) {
+		return NULL;
+	}
+	extent_esn_set(extent, esn);
+	return extent;
+}
+
+void
+base_stats_get(tsdn_t *tsdn, base_t *base, size_t *allocated, size_t *resident,
+    size_t *mapped, size_t *n_thp) {
+	cassert(config_stats);
+
+	malloc_mutex_lock(tsdn, &base->mtx);
+	assert(base->allocated <= base->resident);
+	assert(base->resident <= base->mapped);
+	*allocated = base->allocated;
+	*resident = base->resident;
+	*mapped = base->mapped;
+	*n_thp = base->n_thp;
+	malloc_mutex_unlock(tsdn, &base->mtx);
+}
+
+void
+base_prefork(tsdn_t *tsdn, base_t *base) {
+	malloc_mutex_prefork(tsdn, &base->mtx);
+}
+
+void
+base_postfork_parent(tsdn_t *tsdn, base_t *base) {
+	malloc_mutex_postfork_parent(tsdn, &base->mtx);
+}
+
+void
+base_postfork_child(tsdn_t *tsdn, base_t *base) {
+	malloc_mutex_postfork_child(tsdn, &base->mtx);
+}
+
+bool
+base_boot(tsdn_t *tsdn) {
+	b0 = base_new(tsdn, 0, (extent_hooks_t *)&extent_hooks_default);
+	return (b0 == NULL);
+}
diff --git a/redis-stable/deps/jemalloc/src/bin.c b/redis-stable/deps/jemalloc/src/bin.c
new file mode 100644
index 00000000..0886bc4e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/bin.c
@@ -0,0 +1,50 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/bin.h"
+#include "jemalloc/internal/witness.h"
+
+const bin_info_t bin_infos[NBINS] = {
+#define BIN_INFO_bin_yes(reg_size, slab_size, nregs)			\
+	{reg_size, slab_size, nregs, BITMAP_INFO_INITIALIZER(nregs)},
+#define BIN_INFO_bin_no(reg_size, slab_size, nregs)
+#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs,		\
+    lg_delta_lookup)							\
+	BIN_INFO_bin_##bin((1U<<lg_grp) + (ndelta<<lg_delta),		\
+	    (pgs << LG_PAGE), (pgs << LG_PAGE) / ((1U<<lg_grp) +	\
+	    (ndelta<<lg_delta)))
+	SIZE_CLASSES
+#undef BIN_INFO_bin_yes
+#undef BIN_INFO_bin_no
+#undef SC
+};
+
+bool
+bin_init(bin_t *bin) {
+	if (malloc_mutex_init(&bin->lock, "bin", WITNESS_RANK_BIN,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+	bin->slabcur = NULL;
+	extent_heap_new(&bin->slabs_nonfull);
+	extent_list_init(&bin->slabs_full);
+	if (config_stats) {
+		memset(&bin->stats, 0, sizeof(bin_stats_t));
+	}
+	return false;
+}
+
+void
+bin_prefork(tsdn_t *tsdn, bin_t *bin) {
+	malloc_mutex_prefork(tsdn, &bin->lock);
+}
+
+void
+bin_postfork_parent(tsdn_t *tsdn, bin_t *bin) {
+	malloc_mutex_postfork_parent(tsdn, &bin->lock);
+}
+
+void
+bin_postfork_child(tsdn_t *tsdn, bin_t *bin) {
+	malloc_mutex_postfork_child(tsdn, &bin->lock);
+}
diff --git a/redis-stable/deps/jemalloc/src/bitmap.c b/redis-stable/deps/jemalloc/src/bitmap.c
new file mode 100644
index 00000000..468b3178
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/bitmap.c
@@ -0,0 +1,121 @@
+#define JEMALLOC_BITMAP_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+
+/******************************************************************************/
+
+#ifdef BITMAP_USE_TREE
+
+void
+bitmap_info_init(bitmap_info_t *binfo, size_t nbits) {
+	unsigned i;
+	size_t group_count;
+
+	assert(nbits > 0);
+	assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
+
+	/*
+	 * Compute the number of groups necessary to store nbits bits, and
+	 * progressively work upward through the levels until reaching a level
+	 * that requires only one group.
+	 */
+	binfo->levels[0].group_offset = 0;
+	group_count = BITMAP_BITS2GROUPS(nbits);
+	for (i = 1; group_count > 1; i++) {
+		assert(i < BITMAP_MAX_LEVELS);
+		binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
+		    + group_count;
+		group_count = BITMAP_BITS2GROUPS(group_count);
+	}
+	binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
+	    + group_count;
+	assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX);
+	binfo->nlevels = i;
+	binfo->nbits = nbits;
+}
+
+static size_t
+bitmap_info_ngroups(const bitmap_info_t *binfo) {
+	return binfo->levels[binfo->nlevels].group_offset;
+}
+
+void
+bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill) {
+	size_t extra;
+	unsigned i;
+
+	/*
+	 * Bits are actually inverted with regard to the external bitmap
+	 * interface.
+	 */
+
+	if (fill) {
+		/* The "filled" bitmap starts out with all 0 bits. */
+		memset(bitmap, 0, bitmap_size(binfo));
+		return;
+	}
+
+	/*
+	 * The "empty" bitmap starts out with all 1 bits, except for trailing
+	 * unused bits (if any).  Note that each group uses bit 0 to correspond
+	 * to the first logical bit in the group, so extra bits are the most
+	 * significant bits of the last group.
+	 */
+	memset(bitmap, 0xffU, bitmap_size(binfo));
+	extra = (BITMAP_GROUP_NBITS - (binfo->nbits & BITMAP_GROUP_NBITS_MASK))
+	    & BITMAP_GROUP_NBITS_MASK;
+	if (extra != 0) {
+		bitmap[binfo->levels[1].group_offset - 1] >>= extra;
+	}
+	for (i = 1; i < binfo->nlevels; i++) {
+		size_t group_count = binfo->levels[i].group_offset -
+		    binfo->levels[i-1].group_offset;
+		extra = (BITMAP_GROUP_NBITS - (group_count &
+		    BITMAP_GROUP_NBITS_MASK)) & BITMAP_GROUP_NBITS_MASK;
+		if (extra != 0) {
+			bitmap[binfo->levels[i+1].group_offset - 1] >>= extra;
+		}
+	}
+}
+
+#else /* BITMAP_USE_TREE */
+
+void
+bitmap_info_init(bitmap_info_t *binfo, size_t nbits) {
+	assert(nbits > 0);
+	assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
+
+	binfo->ngroups = BITMAP_BITS2GROUPS(nbits);
+	binfo->nbits = nbits;
+}
+
+static size_t
+bitmap_info_ngroups(const bitmap_info_t *binfo) {
+	return binfo->ngroups;
+}
+
+void
+bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill) {
+	size_t extra;
+
+	if (fill) {
+		memset(bitmap, 0, bitmap_size(binfo));
+		return;
+	}
+
+	memset(bitmap, 0xffU, bitmap_size(binfo));
+	extra = (BITMAP_GROUP_NBITS - (binfo->nbits & BITMAP_GROUP_NBITS_MASK))
+	    & BITMAP_GROUP_NBITS_MASK;
+	if (extra != 0) {
+		bitmap[binfo->ngroups - 1] >>= extra;
+	}
+}
+
+#endif /* BITMAP_USE_TREE */
+
+size_t
+bitmap_size(const bitmap_info_t *binfo) {
+	return (bitmap_info_ngroups(binfo) << LG_SIZEOF_BITMAP);
+}
diff --git a/redis-stable/deps/jemalloc/src/ckh.c b/redis-stable/deps/jemalloc/src/ckh.c
new file mode 100644
index 00000000..e95e0a3e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/ckh.c
@@ -0,0 +1,569 @@
+/*
+ *******************************************************************************
+ * Implementation of (2^1+,2) cuckoo hashing, where 2^1+ indicates that each
+ * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
+ * functions are employed.  The original cuckoo hashing algorithm was described
+ * in:
+ *
+ *   Pagh, R., F.F. Rodler (2004) Cuckoo Hashing.  Journal of Algorithms
+ *     51(2):122-144.
+ *
+ * Generalization of cuckoo hashing was discussed in:
+ *
+ *   Erlingsson, U., M. Manasse, F. McSherry (2006) A cool and practical
+ *     alternative to traditional hash tables.  In Proceedings of the 7th
+ *     Workshop on Distributed Data and Structures (WDAS'06), Santa Clara, CA,
+ *     January 2006.
+ *
+ * This implementation uses precisely two hash functions because that is the
+ * fewest that can work, and supporting multiple hashes is an implementation
+ * burden.  Here is a reproduction of Figure 1 from Erlingsson et al. (2006)
+ * that shows approximate expected maximum load factors for various
+ * configurations:
+ *
+ *           |         #cells/bucket         |
+ *   #hashes |   1   |   2   |   4   |   8   |
+ *   --------+-------+-------+-------+-------+
+ *         1 | 0.006 | 0.006 | 0.03  | 0.12  |
+ *         2 | 0.49  | 0.86  |>0.93< |>0.96< |
+ *         3 | 0.91  | 0.97  | 0.98  | 0.999 |
+ *         4 | 0.97  | 0.99  | 0.999 |       |
+ *
+ * The number of cells per bucket is chosen such that a bucket fits in one cache
+ * line.  So, on 32- and 64-bit systems, we use (8,2) and (4,2) cuckoo hashing,
+ * respectively.
+ *
+ ******************************************************************************/
+#define JEMALLOC_CKH_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+
+#include "jemalloc/internal/ckh.h"
+
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/hash.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/prng.h"
+#include "jemalloc/internal/util.h"
+
+/******************************************************************************/
+/* Function prototypes for non-inline static functions. */
+
+static bool	ckh_grow(tsd_t *tsd, ckh_t *ckh);
+static void	ckh_shrink(tsd_t *tsd, ckh_t *ckh);
+
+/******************************************************************************/
+
+/*
+ * Search bucket for key and return the cell number if found; SIZE_T_MAX
+ * otherwise.
+ */
+static size_t
+ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
+	ckhc_t *cell;
+	unsigned i;
+
+	for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) {
+		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
+		if (cell->key != NULL && ckh->keycomp(key, cell->key)) {
+			return (bucket << LG_CKH_BUCKET_CELLS) + i;
+		}
+	}
+
+	return SIZE_T_MAX;
+}
+
+/*
+ * Search table for key and return cell number if found; SIZE_T_MAX otherwise.
+ */
+static size_t
+ckh_isearch(ckh_t *ckh, const void *key) {
+	size_t hashes[2], bucket, cell;
+
+	assert(ckh != NULL);
+
+	ckh->hash(key, hashes);
+
+	/* Search primary bucket. */
+	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
+	cell = ckh_bucket_search(ckh, bucket, key);
+	if (cell != SIZE_T_MAX) {
+		return cell;
+	}
+
+	/* Search secondary bucket. */
+	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
+	cell = ckh_bucket_search(ckh, bucket, key);
+	return cell;
+}
+
+static bool
+ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key,
+    const void *data) {
+	ckhc_t *cell;
+	unsigned offset, i;
+
+	/*
+	 * Cycle through the cells in the bucket, starting at a random position.
+	 * The randomness avoids worst-case search overhead as buckets fill up.
+	 */
+	offset = (unsigned)prng_lg_range_u64(&ckh->prng_state,
+	    LG_CKH_BUCKET_CELLS);
+	for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) {
+		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +
+		    ((i + offset) & ((ZU(1) << LG_CKH_BUCKET_CELLS) - 1))];
+		if (cell->key == NULL) {
+			cell->key = key;
+			cell->data = data;
+			ckh->count++;
+			return false;
+		}
+	}
+
+	return true;
+}
+
+/*
+ * No space is available in bucket.  Randomly evict an item, then try to find an
+ * alternate location for that item.  Iteratively repeat this
+ * eviction/relocation procedure until either success or detection of an
+ * eviction/relocation bucket cycle.
+ */
+static bool
+ckh_evict_reloc_insert(ckh_t *ckh, size_t argbucket, void const **argkey,
+    void const **argdata) {
+	const void *key, *data, *tkey, *tdata;
+	ckhc_t *cell;
+	size_t hashes[2], bucket, tbucket;
+	unsigned i;
+
+	bucket = argbucket;
+	key = *argkey;
+	data = *argdata;
+	while (true) {
+		/*
+		 * Choose a random item within the bucket to evict.  This is
+		 * critical to correct function, because without (eventually)
+		 * evicting all items within a bucket during iteration, it
+		 * would be possible to get stuck in an infinite loop if there
+		 * were an item for which both hashes indicated the same
+		 * bucket.
+		 */
+		i = (unsigned)prng_lg_range_u64(&ckh->prng_state,
+		    LG_CKH_BUCKET_CELLS);
+		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
+		assert(cell->key != NULL);
+
+		/* Swap cell->{key,data} and {key,data} (evict). */
+		tkey = cell->key; tdata = cell->data;
+		cell->key = key; cell->data = data;
+		key = tkey; data = tdata;
+
+#ifdef CKH_COUNT
+		ckh->nrelocs++;
+#endif
+
+		/* Find the alternate bucket for the evicted item. */
+		ckh->hash(key, hashes);
+		tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
+		if (tbucket == bucket) {
+			tbucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets)
+			    - 1);
+			/*
+			 * It may be that (tbucket == bucket) still, if the
+			 * item's hashes both indicate this bucket.  However,
+			 * we are guaranteed to eventually escape this bucket
+			 * during iteration, assuming pseudo-random item
+			 * selection (true randomness would make infinite
+			 * looping a remote possibility).  The reason we can
+			 * never get trapped forever is that there are two
+			 * cases:
+			 *
+			 * 1) This bucket == argbucket, so we will quickly
+			 *    detect an eviction cycle and terminate.
+			 * 2) An item was evicted to this bucket from another,
+			 *    which means that at least one item in this bucket
+			 *    has hashes that indicate distinct buckets.
+			 */
+		}
+		/* Check for a cycle. */
+		if (tbucket == argbucket) {
+			*argkey = key;
+			*argdata = data;
+			return true;
+		}
+
+		bucket = tbucket;
+		if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
+			return false;
+		}
+	}
+}
+
+static bool
+ckh_try_insert(ckh_t *ckh, void const**argkey, void const**argdata) {
+	size_t hashes[2], bucket;
+	const void *key = *argkey;
+	const void *data = *argdata;
+
+	ckh->hash(key, hashes);
+
+	/* Try to insert in primary bucket. */
+	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
+	if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
+		return false;
+	}
+
+	/* Try to insert in secondary bucket. */
+	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
+	if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
+		return false;
+	}
+
+	/*
+	 * Try to find a place for this item via iterative eviction/relocation.
+	 */
+	return ckh_evict_reloc_insert(ckh, bucket, argkey, argdata);
+}
+
+/*
+ * Try to rebuild the hash table from scratch by inserting all items from the
+ * old table into the new.
+ */
+static bool
+ckh_rebuild(ckh_t *ckh, ckhc_t *aTab) {
+	size_t count, i, nins;
+	const void *key, *data;
+
+	count = ckh->count;
+	ckh->count = 0;
+	for (i = nins = 0; nins < count; i++) {
+		if (aTab[i].key != NULL) {
+			key = aTab[i].key;
+			data = aTab[i].data;
+			if (ckh_try_insert(ckh, &key, &data)) {
+				ckh->count = count;
+				return true;
+			}
+			nins++;
+		}
+	}
+
+	return false;
+}
+
+static bool
+ckh_grow(tsd_t *tsd, ckh_t *ckh) {
+	bool ret;
+	ckhc_t *tab, *ttab;
+	unsigned lg_prevbuckets, lg_curcells;
+
+#ifdef CKH_COUNT
+	ckh->ngrows++;
+#endif
+
+	/*
+	 * It is possible (though unlikely, given well behaved hashes) that the
+	 * table will have to be doubled more than once in order to create a
+	 * usable table.
+	 */
+	lg_prevbuckets = ckh->lg_curbuckets;
+	lg_curcells = ckh->lg_curbuckets + LG_CKH_BUCKET_CELLS;
+	while (true) {
+		size_t usize;
+
+		lg_curcells++;
+		usize = sz_sa2u(sizeof(ckhc_t) << lg_curcells, CACHELINE);
+		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+			ret = true;
+			goto label_return;
+		}
+		tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE,
+		    true, NULL, true, arena_ichoose(tsd, NULL));
+		if (tab == NULL) {
+			ret = true;
+			goto label_return;
+		}
+		/* Swap in new table. */
+		ttab = ckh->tab;
+		ckh->tab = tab;
+		tab = ttab;
+		ckh->lg_curbuckets = lg_curcells - LG_CKH_BUCKET_CELLS;
+
+		if (!ckh_rebuild(ckh, tab)) {
+			idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true);
+			break;
+		}
+
+		/* Rebuilding failed, so back out partially rebuilt table. */
+		idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
+		ckh->tab = tab;
+		ckh->lg_curbuckets = lg_prevbuckets;
+	}
+
+	ret = false;
+label_return:
+	return ret;
+}
+
+static void
+ckh_shrink(tsd_t *tsd, ckh_t *ckh) {
+	ckhc_t *tab, *ttab;
+	size_t usize;
+	unsigned lg_prevbuckets, lg_curcells;
+
+	/*
+	 * It is possible (though unlikely, given well behaved hashes) that the
+	 * table rebuild will fail.
+	 */
+	lg_prevbuckets = ckh->lg_curbuckets;
+	lg_curcells = ckh->lg_curbuckets + LG_CKH_BUCKET_CELLS - 1;
+	usize = sz_sa2u(sizeof(ckhc_t) << lg_curcells, CACHELINE);
+	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+		return;
+	}
+	tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE, true, NULL,
+	    true, arena_ichoose(tsd, NULL));
+	if (tab == NULL) {
+		/*
+		 * An OOM error isn't worth propagating, since it doesn't
+		 * prevent this or future operations from proceeding.
+		 */
+		return;
+	}
+	/* Swap in new table. */
+	ttab = ckh->tab;
+	ckh->tab = tab;
+	tab = ttab;
+	ckh->lg_curbuckets = lg_curcells - LG_CKH_BUCKET_CELLS;
+
+	if (!ckh_rebuild(ckh, tab)) {
+		idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true);
+#ifdef CKH_COUNT
+		ckh->nshrinks++;
+#endif
+		return;
+	}
+
+	/* Rebuilding failed, so back out partially rebuilt table. */
+	idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
+	ckh->tab = tab;
+	ckh->lg_curbuckets = lg_prevbuckets;
+#ifdef CKH_COUNT
+	ckh->nshrinkfails++;
+#endif
+}
+
+bool
+ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
+    ckh_keycomp_t *keycomp) {
+	bool ret;
+	size_t mincells, usize;
+	unsigned lg_mincells;
+
+	assert(minitems > 0);
+	assert(hash != NULL);
+	assert(keycomp != NULL);
+
+#ifdef CKH_COUNT
+	ckh->ngrows = 0;
+	ckh->nshrinks = 0;
+	ckh->nshrinkfails = 0;
+	ckh->ninserts = 0;
+	ckh->nrelocs = 0;
+#endif
+	ckh->prng_state = 42; /* Value doesn't really matter. */
+	ckh->count = 0;
+
+	/*
+	 * Find the minimum power of 2 that is large enough to fit minitems
+	 * entries.  We are using (2+,2) cuckoo hashing, which has an expected
+	 * maximum load factor of at least ~0.86, so 0.75 is a conservative load
+	 * factor that will typically allow mincells items to fit without ever
+	 * growing the table.
+	 */
+	assert(LG_CKH_BUCKET_CELLS > 0);
+	mincells = ((minitems + (3 - (minitems % 3))) / 3) << 2;
+	for (lg_mincells = LG_CKH_BUCKET_CELLS;
+	    (ZU(1) << lg_mincells) < mincells;
+	    lg_mincells++) {
+		/* Do nothing. */
+	}
+	ckh->lg_minbuckets = lg_mincells - LG_CKH_BUCKET_CELLS;
+	ckh->lg_curbuckets = lg_mincells - LG_CKH_BUCKET_CELLS;
+	ckh->hash = hash;
+	ckh->keycomp = keycomp;
+
+	usize = sz_sa2u(sizeof(ckhc_t) << lg_mincells, CACHELINE);
+	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+		ret = true;
+		goto label_return;
+	}
+	ckh->tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE, true,
+	    NULL, true, arena_ichoose(tsd, NULL));
+	if (ckh->tab == NULL) {
+		ret = true;
+		goto label_return;
+	}
+
+	ret = false;
+label_return:
+	return ret;
+}
+
+void
+ckh_delete(tsd_t *tsd, ckh_t *ckh) {
+	assert(ckh != NULL);
+
+#ifdef CKH_VERBOSE
+	malloc_printf(
+	    "%s(%p): ngrows: %"FMTu64", nshrinks: %"FMTu64","
+	    " nshrinkfails: %"FMTu64", ninserts: %"FMTu64","
+	    " nrelocs: %"FMTu64"\n", __func__, ckh,
+	    (unsigned long long)ckh->ngrows,
+	    (unsigned long long)ckh->nshrinks,
+	    (unsigned long long)ckh->nshrinkfails,
+	    (unsigned long long)ckh->ninserts,
+	    (unsigned long long)ckh->nrelocs);
+#endif
+
+	idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
+	if (config_debug) {
+		memset(ckh, JEMALLOC_FREE_JUNK, sizeof(ckh_t));
+	}
+}
+
+size_t
+ckh_count(ckh_t *ckh) {
+	assert(ckh != NULL);
+
+	return ckh->count;
+}
+
+bool
+ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data) {
+	size_t i, ncells;
+
+	for (i = *tabind, ncells = (ZU(1) << (ckh->lg_curbuckets +
+	    LG_CKH_BUCKET_CELLS)); i < ncells; i++) {
+		if (ckh->tab[i].key != NULL) {
+			if (key != NULL) {
+				*key = (void *)ckh->tab[i].key;
+			}
+			if (data != NULL) {
+				*data = (void *)ckh->tab[i].data;
+			}
+			*tabind = i + 1;
+			return false;
+		}
+	}
+
+	return true;
+}
+
+bool
+ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data) {
+	bool ret;
+
+	assert(ckh != NULL);
+	assert(ckh_search(ckh, key, NULL, NULL));
+
+#ifdef CKH_COUNT
+	ckh->ninserts++;
+#endif
+
+	while (ckh_try_insert(ckh, &key, &data)) {
+		if (ckh_grow(tsd, ckh)) {
+			ret = true;
+			goto label_return;
+		}
+	}
+
+	ret = false;
+label_return:
+	return ret;
+}
+
+bool
+ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key,
+    void **data) {
+	size_t cell;
+
+	assert(ckh != NULL);
+
+	cell = ckh_isearch(ckh, searchkey);
+	if (cell != SIZE_T_MAX) {
+		if (key != NULL) {
+			*key = (void *)ckh->tab[cell].key;
+		}
+		if (data != NULL) {
+			*data = (void *)ckh->tab[cell].data;
+		}
+		ckh->tab[cell].key = NULL;
+		ckh->tab[cell].data = NULL; /* Not necessary. */
+
+		ckh->count--;
+		/* Try to halve the table if it is less than 1/4 full. */
+		if (ckh->count < (ZU(1) << (ckh->lg_curbuckets
+		    + LG_CKH_BUCKET_CELLS - 2)) && ckh->lg_curbuckets
+		    > ckh->lg_minbuckets) {
+			/* Ignore error due to OOM. */
+			ckh_shrink(tsd, ckh);
+		}
+
+		return false;
+	}
+
+	return true;
+}
+
+bool
+ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data) {
+	size_t cell;
+
+	assert(ckh != NULL);
+
+	cell = ckh_isearch(ckh, searchkey);
+	if (cell != SIZE_T_MAX) {
+		if (key != NULL) {
+			*key = (void *)ckh->tab[cell].key;
+		}
+		if (data != NULL) {
+			*data = (void *)ckh->tab[cell].data;
+		}
+		return false;
+	}
+
+	return true;
+}
+
+void
+ckh_string_hash(const void *key, size_t r_hash[2]) {
+	hash(key, strlen((const char *)key), 0x94122f33U, r_hash);
+}
+
+bool
+ckh_string_keycomp(const void *k1, const void *k2) {
+	assert(k1 != NULL);
+	assert(k2 != NULL);
+
+	return !strcmp((char *)k1, (char *)k2);
+}
+
+void
+ckh_pointer_hash(const void *key, size_t r_hash[2]) {
+	union {
+		const void	*v;
+		size_t		i;
+	} u;
+
+	assert(sizeof(u.v) == sizeof(u.i));
+	u.v = key;
+	hash(&u.i, sizeof(u.i), 0xd983396eU, r_hash);
+}
+
+bool
+ckh_pointer_keycomp(const void *k1, const void *k2) {
+	return (k1 == k2);
+}
diff --git a/redis-stable/deps/jemalloc/src/ctl.c b/redis-stable/deps/jemalloc/src/ctl.c
new file mode 100644
index 00000000..1e713a3d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/ctl.c
@@ -0,0 +1,2883 @@
+#define JEMALLOC_CTL_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/ctl.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/nstime.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/util.h"
+
+/******************************************************************************/
+/* Data. */
+
+/*
+ * ctl_mtx protects the following:
+ * - ctl_stats->*
+ */
+static malloc_mutex_t	ctl_mtx;
+static bool		ctl_initialized;
+static ctl_stats_t	*ctl_stats;
+static ctl_arenas_t	*ctl_arenas;
+
+/******************************************************************************/
+/* Helpers for named and indexed nodes. */
+
+static const ctl_named_node_t *
+ctl_named_node(const ctl_node_t *node) {
+	return ((node->named) ? (const ctl_named_node_t *)node : NULL);
+}
+
+static const ctl_named_node_t *
+ctl_named_children(const ctl_named_node_t *node, size_t index) {
+	const ctl_named_node_t *children = ctl_named_node(node->children);
+
+	return (children ? &children[index] : NULL);
+}
+
+static const ctl_indexed_node_t *
+ctl_indexed_node(const ctl_node_t *node) {
+	return (!node->named ? (const ctl_indexed_node_t *)node : NULL);
+}
+
+/******************************************************************************/
+/* Function prototypes for non-inline static functions. */
+
+#define CTL_PROTO(n)							\
+static int	n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,	\
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen);
+
+#define INDEX_PROTO(n)							\
+static const ctl_named_node_t	*n##_index(tsdn_t *tsdn,		\
+    const size_t *mib, size_t miblen, size_t i);
+
+CTL_PROTO(version)
+CTL_PROTO(epoch)
+CTL_PROTO(background_thread)
+CTL_PROTO(max_background_threads)
+CTL_PROTO(thread_tcache_enabled)
+CTL_PROTO(thread_tcache_flush)
+CTL_PROTO(thread_prof_name)
+CTL_PROTO(thread_prof_active)
+CTL_PROTO(thread_arena)
+CTL_PROTO(thread_allocated)
+CTL_PROTO(thread_allocatedp)
+CTL_PROTO(thread_deallocated)
+CTL_PROTO(thread_deallocatedp)
+CTL_PROTO(config_cache_oblivious)
+CTL_PROTO(config_debug)
+CTL_PROTO(config_fill)
+CTL_PROTO(config_lazy_lock)
+CTL_PROTO(config_malloc_conf)
+CTL_PROTO(config_prof)
+CTL_PROTO(config_prof_libgcc)
+CTL_PROTO(config_prof_libunwind)
+CTL_PROTO(config_stats)
+CTL_PROTO(config_utrace)
+CTL_PROTO(config_xmalloc)
+CTL_PROTO(opt_abort)
+CTL_PROTO(opt_abort_conf)
+CTL_PROTO(opt_metadata_thp)
+CTL_PROTO(opt_retain)
+CTL_PROTO(opt_dss)
+CTL_PROTO(opt_narenas)
+CTL_PROTO(opt_percpu_arena)
+CTL_PROTO(opt_background_thread)
+CTL_PROTO(opt_max_background_threads)
+CTL_PROTO(opt_dirty_decay_ms)
+CTL_PROTO(opt_muzzy_decay_ms)
+CTL_PROTO(opt_stats_print)
+CTL_PROTO(opt_stats_print_opts)
+CTL_PROTO(opt_junk)
+CTL_PROTO(opt_zero)
+CTL_PROTO(opt_utrace)
+CTL_PROTO(opt_xmalloc)
+CTL_PROTO(opt_tcache)
+CTL_PROTO(opt_thp)
+CTL_PROTO(opt_lg_extent_max_active_fit)
+CTL_PROTO(opt_lg_tcache_max)
+CTL_PROTO(opt_prof)
+CTL_PROTO(opt_prof_prefix)
+CTL_PROTO(opt_prof_active)
+CTL_PROTO(opt_prof_thread_active_init)
+CTL_PROTO(opt_lg_prof_sample)
+CTL_PROTO(opt_lg_prof_interval)
+CTL_PROTO(opt_prof_gdump)
+CTL_PROTO(opt_prof_final)
+CTL_PROTO(opt_prof_leak)
+CTL_PROTO(opt_prof_accum)
+CTL_PROTO(tcache_create)
+CTL_PROTO(tcache_flush)
+CTL_PROTO(tcache_destroy)
+CTL_PROTO(arena_i_initialized)
+CTL_PROTO(arena_i_decay)
+CTL_PROTO(arena_i_purge)
+CTL_PROTO(arena_i_reset)
+CTL_PROTO(arena_i_destroy)
+CTL_PROTO(arena_i_dss)
+CTL_PROTO(arena_i_dirty_decay_ms)
+CTL_PROTO(arena_i_muzzy_decay_ms)
+CTL_PROTO(arena_i_extent_hooks)
+CTL_PROTO(arena_i_retain_grow_limit)
+INDEX_PROTO(arena_i)
+CTL_PROTO(arenas_bin_i_size)
+CTL_PROTO(arenas_bin_i_nregs)
+CTL_PROTO(arenas_bin_i_slab_size)
+INDEX_PROTO(arenas_bin_i)
+CTL_PROTO(arenas_lextent_i_size)
+INDEX_PROTO(arenas_lextent_i)
+CTL_PROTO(arenas_narenas)
+CTL_PROTO(arenas_dirty_decay_ms)
+CTL_PROTO(arenas_muzzy_decay_ms)
+CTL_PROTO(arenas_quantum)
+CTL_PROTO(arenas_page)
+CTL_PROTO(arenas_tcache_max)
+CTL_PROTO(arenas_nbins)
+CTL_PROTO(arenas_nhbins)
+CTL_PROTO(arenas_nlextents)
+CTL_PROTO(arenas_create)
+CTL_PROTO(arenas_lookup)
+CTL_PROTO(prof_thread_active_init)
+CTL_PROTO(prof_active)
+CTL_PROTO(prof_dump)
+CTL_PROTO(prof_gdump)
+CTL_PROTO(prof_reset)
+CTL_PROTO(prof_interval)
+CTL_PROTO(lg_prof_sample)
+CTL_PROTO(stats_arenas_i_small_allocated)
+CTL_PROTO(stats_arenas_i_small_nmalloc)
+CTL_PROTO(stats_arenas_i_small_ndalloc)
+CTL_PROTO(stats_arenas_i_small_nrequests)
+CTL_PROTO(stats_arenas_i_large_allocated)
+CTL_PROTO(stats_arenas_i_large_nmalloc)
+CTL_PROTO(stats_arenas_i_large_ndalloc)
+CTL_PROTO(stats_arenas_i_large_nrequests)
+CTL_PROTO(stats_arenas_i_bins_j_nmalloc)
+CTL_PROTO(stats_arenas_i_bins_j_ndalloc)
+CTL_PROTO(stats_arenas_i_bins_j_nrequests)
+CTL_PROTO(stats_arenas_i_bins_j_curregs)
+CTL_PROTO(stats_arenas_i_bins_j_nfills)
+CTL_PROTO(stats_arenas_i_bins_j_nflushes)
+CTL_PROTO(stats_arenas_i_bins_j_nslabs)
+CTL_PROTO(stats_arenas_i_bins_j_nreslabs)
+CTL_PROTO(stats_arenas_i_bins_j_curslabs)
+INDEX_PROTO(stats_arenas_i_bins_j)
+CTL_PROTO(stats_arenas_i_lextents_j_nmalloc)
+CTL_PROTO(stats_arenas_i_lextents_j_ndalloc)
+CTL_PROTO(stats_arenas_i_lextents_j_nrequests)
+CTL_PROTO(stats_arenas_i_lextents_j_curlextents)
+INDEX_PROTO(stats_arenas_i_lextents_j)
+CTL_PROTO(stats_arenas_i_nthreads)
+CTL_PROTO(stats_arenas_i_uptime)
+CTL_PROTO(stats_arenas_i_dss)
+CTL_PROTO(stats_arenas_i_dirty_decay_ms)
+CTL_PROTO(stats_arenas_i_muzzy_decay_ms)
+CTL_PROTO(stats_arenas_i_pactive)
+CTL_PROTO(stats_arenas_i_pdirty)
+CTL_PROTO(stats_arenas_i_pmuzzy)
+CTL_PROTO(stats_arenas_i_mapped)
+CTL_PROTO(stats_arenas_i_retained)
+CTL_PROTO(stats_arenas_i_dirty_npurge)
+CTL_PROTO(stats_arenas_i_dirty_nmadvise)
+CTL_PROTO(stats_arenas_i_dirty_purged)
+CTL_PROTO(stats_arenas_i_muzzy_npurge)
+CTL_PROTO(stats_arenas_i_muzzy_nmadvise)
+CTL_PROTO(stats_arenas_i_muzzy_purged)
+CTL_PROTO(stats_arenas_i_base)
+CTL_PROTO(stats_arenas_i_internal)
+CTL_PROTO(stats_arenas_i_metadata_thp)
+CTL_PROTO(stats_arenas_i_tcache_bytes)
+CTL_PROTO(stats_arenas_i_resident)
+INDEX_PROTO(stats_arenas_i)
+CTL_PROTO(stats_allocated)
+CTL_PROTO(stats_active)
+CTL_PROTO(stats_background_thread_num_threads)
+CTL_PROTO(stats_background_thread_num_runs)
+CTL_PROTO(stats_background_thread_run_interval)
+CTL_PROTO(stats_metadata)
+CTL_PROTO(stats_metadata_thp)
+CTL_PROTO(stats_resident)
+CTL_PROTO(stats_mapped)
+CTL_PROTO(stats_retained)
+
+#define MUTEX_STATS_CTL_PROTO_GEN(n)					\
+CTL_PROTO(stats_##n##_num_ops)						\
+CTL_PROTO(stats_##n##_num_wait)						\
+CTL_PROTO(stats_##n##_num_spin_acq)					\
+CTL_PROTO(stats_##n##_num_owner_switch)					\
+CTL_PROTO(stats_##n##_total_wait_time)					\
+CTL_PROTO(stats_##n##_max_wait_time)					\
+CTL_PROTO(stats_##n##_max_num_thds)
+
+/* Global mutexes. */
+#define OP(mtx) MUTEX_STATS_CTL_PROTO_GEN(mutexes_##mtx)
+MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+
+/* Per arena mutexes. */
+#define OP(mtx) MUTEX_STATS_CTL_PROTO_GEN(arenas_i_mutexes_##mtx)
+MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+
+/* Arena bin mutexes. */
+MUTEX_STATS_CTL_PROTO_GEN(arenas_i_bins_j_mutex)
+#undef MUTEX_STATS_CTL_PROTO_GEN
+
+CTL_PROTO(stats_mutexes_reset)
+
+/******************************************************************************/
+/* mallctl tree. */
+
+#define NAME(n)	{true},	n
+#define CHILD(t, c)							\
+	sizeof(c##_node) / sizeof(ctl_##t##_node_t),			\
+	(ctl_node_t *)c##_node,						\
+	NULL
+#define CTL(c)	0, NULL, c##_ctl
+
+/*
+ * Only handles internal indexed nodes, since there are currently no external
+ * ones.
+ */
+#define INDEX(i)	{false},	i##_index
+
+static const ctl_named_node_t	thread_tcache_node[] = {
+	{NAME("enabled"),	CTL(thread_tcache_enabled)},
+	{NAME("flush"),		CTL(thread_tcache_flush)}
+};
+
+static const ctl_named_node_t	thread_prof_node[] = {
+	{NAME("name"),		CTL(thread_prof_name)},
+	{NAME("active"),	CTL(thread_prof_active)}
+};
+
+static const ctl_named_node_t	thread_node[] = {
+	{NAME("arena"),		CTL(thread_arena)},
+	{NAME("allocated"),	CTL(thread_allocated)},
+	{NAME("allocatedp"),	CTL(thread_allocatedp)},
+	{NAME("deallocated"),	CTL(thread_deallocated)},
+	{NAME("deallocatedp"),	CTL(thread_deallocatedp)},
+	{NAME("tcache"),	CHILD(named, thread_tcache)},
+	{NAME("prof"),		CHILD(named, thread_prof)}
+};
+
+static const ctl_named_node_t	config_node[] = {
+	{NAME("cache_oblivious"), CTL(config_cache_oblivious)},
+	{NAME("debug"),		CTL(config_debug)},
+	{NAME("fill"),		CTL(config_fill)},
+	{NAME("lazy_lock"),	CTL(config_lazy_lock)},
+	{NAME("malloc_conf"),	CTL(config_malloc_conf)},
+	{NAME("prof"),		CTL(config_prof)},
+	{NAME("prof_libgcc"),	CTL(config_prof_libgcc)},
+	{NAME("prof_libunwind"), CTL(config_prof_libunwind)},
+	{NAME("stats"),		CTL(config_stats)},
+	{NAME("utrace"),	CTL(config_utrace)},
+	{NAME("xmalloc"),	CTL(config_xmalloc)}
+};
+
+static const ctl_named_node_t opt_node[] = {
+	{NAME("abort"),		CTL(opt_abort)},
+	{NAME("abort_conf"),	CTL(opt_abort_conf)},
+	{NAME("metadata_thp"),	CTL(opt_metadata_thp)},
+	{NAME("retain"),	CTL(opt_retain)},
+	{NAME("dss"),		CTL(opt_dss)},
+	{NAME("narenas"),	CTL(opt_narenas)},
+	{NAME("percpu_arena"),	CTL(opt_percpu_arena)},
+	{NAME("background_thread"),	CTL(opt_background_thread)},
+	{NAME("max_background_threads"),	CTL(opt_max_background_threads)},
+	{NAME("dirty_decay_ms"), CTL(opt_dirty_decay_ms)},
+	{NAME("muzzy_decay_ms"), CTL(opt_muzzy_decay_ms)},
+	{NAME("stats_print"),	CTL(opt_stats_print)},
+	{NAME("stats_print_opts"),	CTL(opt_stats_print_opts)},
+	{NAME("junk"),		CTL(opt_junk)},
+	{NAME("zero"),		CTL(opt_zero)},
+	{NAME("utrace"),	CTL(opt_utrace)},
+	{NAME("xmalloc"),	CTL(opt_xmalloc)},
+	{NAME("tcache"),	CTL(opt_tcache)},
+	{NAME("thp"),		CTL(opt_thp)},
+	{NAME("lg_extent_max_active_fit"), CTL(opt_lg_extent_max_active_fit)},
+	{NAME("lg_tcache_max"),	CTL(opt_lg_tcache_max)},
+	{NAME("prof"),		CTL(opt_prof)},
+	{NAME("prof_prefix"),	CTL(opt_prof_prefix)},
+	{NAME("prof_active"),	CTL(opt_prof_active)},
+	{NAME("prof_thread_active_init"), CTL(opt_prof_thread_active_init)},
+	{NAME("lg_prof_sample"), CTL(opt_lg_prof_sample)},
+	{NAME("lg_prof_interval"), CTL(opt_lg_prof_interval)},
+	{NAME("prof_gdump"),	CTL(opt_prof_gdump)},
+	{NAME("prof_final"),	CTL(opt_prof_final)},
+	{NAME("prof_leak"),	CTL(opt_prof_leak)},
+	{NAME("prof_accum"),	CTL(opt_prof_accum)}
+};
+
+static const ctl_named_node_t	tcache_node[] = {
+	{NAME("create"),	CTL(tcache_create)},
+	{NAME("flush"),		CTL(tcache_flush)},
+	{NAME("destroy"),	CTL(tcache_destroy)}
+};
+
+static const ctl_named_node_t arena_i_node[] = {
+	{NAME("initialized"),	CTL(arena_i_initialized)},
+	{NAME("decay"),		CTL(arena_i_decay)},
+	{NAME("purge"),		CTL(arena_i_purge)},
+	{NAME("reset"),		CTL(arena_i_reset)},
+	{NAME("destroy"),	CTL(arena_i_destroy)},
+	{NAME("dss"),		CTL(arena_i_dss)},
+	{NAME("dirty_decay_ms"), CTL(arena_i_dirty_decay_ms)},
+	{NAME("muzzy_decay_ms"), CTL(arena_i_muzzy_decay_ms)},
+	{NAME("extent_hooks"),	CTL(arena_i_extent_hooks)},
+	{NAME("retain_grow_limit"),	CTL(arena_i_retain_grow_limit)}
+};
+static const ctl_named_node_t super_arena_i_node[] = {
+	{NAME(""),		CHILD(named, arena_i)}
+};
+
+static const ctl_indexed_node_t arena_node[] = {
+	{INDEX(arena_i)}
+};
+
+static const ctl_named_node_t arenas_bin_i_node[] = {
+	{NAME("size"),		CTL(arenas_bin_i_size)},
+	{NAME("nregs"),		CTL(arenas_bin_i_nregs)},
+	{NAME("slab_size"),	CTL(arenas_bin_i_slab_size)}
+};
+static const ctl_named_node_t super_arenas_bin_i_node[] = {
+	{NAME(""),		CHILD(named, arenas_bin_i)}
+};
+
+static const ctl_indexed_node_t arenas_bin_node[] = {
+	{INDEX(arenas_bin_i)}
+};
+
+static const ctl_named_node_t arenas_lextent_i_node[] = {
+	{NAME("size"),		CTL(arenas_lextent_i_size)}
+};
+static const ctl_named_node_t super_arenas_lextent_i_node[] = {
+	{NAME(""),		CHILD(named, arenas_lextent_i)}
+};
+
+static const ctl_indexed_node_t arenas_lextent_node[] = {
+	{INDEX(arenas_lextent_i)}
+};
+
+static const ctl_named_node_t arenas_node[] = {
+	{NAME("narenas"),	CTL(arenas_narenas)},
+	{NAME("dirty_decay_ms"), CTL(arenas_dirty_decay_ms)},
+	{NAME("muzzy_decay_ms"), CTL(arenas_muzzy_decay_ms)},
+	{NAME("quantum"),	CTL(arenas_quantum)},
+	{NAME("page"),		CTL(arenas_page)},
+	{NAME("tcache_max"),	CTL(arenas_tcache_max)},
+	{NAME("nbins"),		CTL(arenas_nbins)},
+	{NAME("nhbins"),	CTL(arenas_nhbins)},
+	{NAME("bin"),		CHILD(indexed, arenas_bin)},
+	{NAME("nlextents"),	CTL(arenas_nlextents)},
+	{NAME("lextent"),	CHILD(indexed, arenas_lextent)},
+	{NAME("create"),	CTL(arenas_create)},
+	{NAME("lookup"),	CTL(arenas_lookup)}
+};
+
+static const ctl_named_node_t	prof_node[] = {
+	{NAME("thread_active_init"), CTL(prof_thread_active_init)},
+	{NAME("active"),	CTL(prof_active)},
+	{NAME("dump"),		CTL(prof_dump)},
+	{NAME("gdump"),		CTL(prof_gdump)},
+	{NAME("reset"),		CTL(prof_reset)},
+	{NAME("interval"),	CTL(prof_interval)},
+	{NAME("lg_sample"),	CTL(lg_prof_sample)}
+};
+
+static const ctl_named_node_t stats_arenas_i_small_node[] = {
+	{NAME("allocated"),	CTL(stats_arenas_i_small_allocated)},
+	{NAME("nmalloc"),	CTL(stats_arenas_i_small_nmalloc)},
+	{NAME("ndalloc"),	CTL(stats_arenas_i_small_ndalloc)},
+	{NAME("nrequests"),	CTL(stats_arenas_i_small_nrequests)}
+};
+
+static const ctl_named_node_t stats_arenas_i_large_node[] = {
+	{NAME("allocated"),	CTL(stats_arenas_i_large_allocated)},
+	{NAME("nmalloc"),	CTL(stats_arenas_i_large_nmalloc)},
+	{NAME("ndalloc"),	CTL(stats_arenas_i_large_ndalloc)},
+	{NAME("nrequests"),	CTL(stats_arenas_i_large_nrequests)}
+};
+
+#define MUTEX_PROF_DATA_NODE(prefix)					\
+static const ctl_named_node_t stats_##prefix##_node[] = {		\
+	{NAME("num_ops"),						\
+	 CTL(stats_##prefix##_num_ops)},				\
+	{NAME("num_wait"),						\
+	 CTL(stats_##prefix##_num_wait)},				\
+	{NAME("num_spin_acq"),						\
+	 CTL(stats_##prefix##_num_spin_acq)},				\
+	{NAME("num_owner_switch"),					\
+	 CTL(stats_##prefix##_num_owner_switch)},			\
+	{NAME("total_wait_time"),					\
+	 CTL(stats_##prefix##_total_wait_time)},			\
+	{NAME("max_wait_time"),						\
+	 CTL(stats_##prefix##_max_wait_time)},				\
+	{NAME("max_num_thds"),						\
+	 CTL(stats_##prefix##_max_num_thds)}				\
+	/* Note that # of current waiting thread not provided. */	\
+};
+
+MUTEX_PROF_DATA_NODE(arenas_i_bins_j_mutex)
+
+static const ctl_named_node_t stats_arenas_i_bins_j_node[] = {
+	{NAME("nmalloc"),	CTL(stats_arenas_i_bins_j_nmalloc)},
+	{NAME("ndalloc"),	CTL(stats_arenas_i_bins_j_ndalloc)},
+	{NAME("nrequests"),	CTL(stats_arenas_i_bins_j_nrequests)},
+	{NAME("curregs"),	CTL(stats_arenas_i_bins_j_curregs)},
+	{NAME("nfills"),	CTL(stats_arenas_i_bins_j_nfills)},
+	{NAME("nflushes"),	CTL(stats_arenas_i_bins_j_nflushes)},
+	{NAME("nslabs"),	CTL(stats_arenas_i_bins_j_nslabs)},
+	{NAME("nreslabs"),	CTL(stats_arenas_i_bins_j_nreslabs)},
+	{NAME("curslabs"),	CTL(stats_arenas_i_bins_j_curslabs)},
+	{NAME("mutex"),		CHILD(named, stats_arenas_i_bins_j_mutex)}
+};
+
+static const ctl_named_node_t super_stats_arenas_i_bins_j_node[] = {
+	{NAME(""),		CHILD(named, stats_arenas_i_bins_j)}
+};
+
+static const ctl_indexed_node_t stats_arenas_i_bins_node[] = {
+	{INDEX(stats_arenas_i_bins_j)}
+};
+
+static const ctl_named_node_t stats_arenas_i_lextents_j_node[] = {
+	{NAME("nmalloc"),	CTL(stats_arenas_i_lextents_j_nmalloc)},
+	{NAME("ndalloc"),	CTL(stats_arenas_i_lextents_j_ndalloc)},
+	{NAME("nrequests"),	CTL(stats_arenas_i_lextents_j_nrequests)},
+	{NAME("curlextents"),	CTL(stats_arenas_i_lextents_j_curlextents)}
+};
+static const ctl_named_node_t super_stats_arenas_i_lextents_j_node[] = {
+	{NAME(""),		CHILD(named, stats_arenas_i_lextents_j)}
+};
+
+static const ctl_indexed_node_t stats_arenas_i_lextents_node[] = {
+	{INDEX(stats_arenas_i_lextents_j)}
+};
+
+#define OP(mtx)  MUTEX_PROF_DATA_NODE(arenas_i_mutexes_##mtx)
+MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+
+static const ctl_named_node_t stats_arenas_i_mutexes_node[] = {
+#define OP(mtx) {NAME(#mtx), CHILD(named, stats_arenas_i_mutexes_##mtx)},
+MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+};
+
+static const ctl_named_node_t stats_arenas_i_node[] = {
+	{NAME("nthreads"),	CTL(stats_arenas_i_nthreads)},
+	{NAME("uptime"),	CTL(stats_arenas_i_uptime)},
+	{NAME("dss"),		CTL(stats_arenas_i_dss)},
+	{NAME("dirty_decay_ms"), CTL(stats_arenas_i_dirty_decay_ms)},
+	{NAME("muzzy_decay_ms"), CTL(stats_arenas_i_muzzy_decay_ms)},
+	{NAME("pactive"),	CTL(stats_arenas_i_pactive)},
+	{NAME("pdirty"),	CTL(stats_arenas_i_pdirty)},
+	{NAME("pmuzzy"),	CTL(stats_arenas_i_pmuzzy)},
+	{NAME("mapped"),	CTL(stats_arenas_i_mapped)},
+	{NAME("retained"),	CTL(stats_arenas_i_retained)},
+	{NAME("dirty_npurge"),	CTL(stats_arenas_i_dirty_npurge)},
+	{NAME("dirty_nmadvise"), CTL(stats_arenas_i_dirty_nmadvise)},
+	{NAME("dirty_purged"),	CTL(stats_arenas_i_dirty_purged)},
+	{NAME("muzzy_npurge"),	CTL(stats_arenas_i_muzzy_npurge)},
+	{NAME("muzzy_nmadvise"), CTL(stats_arenas_i_muzzy_nmadvise)},
+	{NAME("muzzy_purged"),	CTL(stats_arenas_i_muzzy_purged)},
+	{NAME("base"),		CTL(stats_arenas_i_base)},
+	{NAME("internal"),	CTL(stats_arenas_i_internal)},
+	{NAME("metadata_thp"),	CTL(stats_arenas_i_metadata_thp)},
+	{NAME("tcache_bytes"),	CTL(stats_arenas_i_tcache_bytes)},
+	{NAME("resident"),	CTL(stats_arenas_i_resident)},
+	{NAME("small"),		CHILD(named, stats_arenas_i_small)},
+	{NAME("large"),		CHILD(named, stats_arenas_i_large)},
+	{NAME("bins"),		CHILD(indexed, stats_arenas_i_bins)},
+	{NAME("lextents"),	CHILD(indexed, stats_arenas_i_lextents)},
+	{NAME("mutexes"),	CHILD(named, stats_arenas_i_mutexes)}
+};
+static const ctl_named_node_t super_stats_arenas_i_node[] = {
+	{NAME(""),		CHILD(named, stats_arenas_i)}
+};
+
+static const ctl_indexed_node_t stats_arenas_node[] = {
+	{INDEX(stats_arenas_i)}
+};
+
+static const ctl_named_node_t stats_background_thread_node[] = {
+	{NAME("num_threads"),	CTL(stats_background_thread_num_threads)},
+	{NAME("num_runs"),	CTL(stats_background_thread_num_runs)},
+	{NAME("run_interval"),	CTL(stats_background_thread_run_interval)}
+};
+
+#define OP(mtx) MUTEX_PROF_DATA_NODE(mutexes_##mtx)
+MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+
+static const ctl_named_node_t stats_mutexes_node[] = {
+#define OP(mtx) {NAME(#mtx), CHILD(named, stats_mutexes_##mtx)},
+MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+	{NAME("reset"),		CTL(stats_mutexes_reset)}
+};
+#undef MUTEX_PROF_DATA_NODE
+
+static const ctl_named_node_t stats_node[] = {
+	{NAME("allocated"),	CTL(stats_allocated)},
+	{NAME("active"),	CTL(stats_active)},
+	{NAME("metadata"),	CTL(stats_metadata)},
+	{NAME("metadata_thp"),	CTL(stats_metadata_thp)},
+	{NAME("resident"),	CTL(stats_resident)},
+	{NAME("mapped"),	CTL(stats_mapped)},
+	{NAME("retained"),	CTL(stats_retained)},
+	{NAME("background_thread"),
+	 CHILD(named, stats_background_thread)},
+	{NAME("mutexes"),	CHILD(named, stats_mutexes)},
+	{NAME("arenas"),	CHILD(indexed, stats_arenas)}
+};
+
+static const ctl_named_node_t	root_node[] = {
+	{NAME("version"),	CTL(version)},
+	{NAME("epoch"),		CTL(epoch)},
+	{NAME("background_thread"),	CTL(background_thread)},
+	{NAME("max_background_threads"),	CTL(max_background_threads)},
+	{NAME("thread"),	CHILD(named, thread)},
+	{NAME("config"),	CHILD(named, config)},
+	{NAME("opt"),		CHILD(named, opt)},
+	{NAME("tcache"),	CHILD(named, tcache)},
+	{NAME("arena"),		CHILD(indexed, arena)},
+	{NAME("arenas"),	CHILD(named, arenas)},
+	{NAME("prof"),		CHILD(named, prof)},
+	{NAME("stats"),		CHILD(named, stats)}
+};
+static const ctl_named_node_t super_root_node[] = {
+	{NAME(""),		CHILD(named, root)}
+};
+
+#undef NAME
+#undef CHILD
+#undef CTL
+#undef INDEX
+
+/******************************************************************************/
+
+/*
+ * Sets *dst + *src non-atomically.  This is safe, since everything is
+ * synchronized by the ctl mutex.
+ */
+static void
+ctl_accum_arena_stats_u64(arena_stats_u64_t *dst, arena_stats_u64_t *src) {
+#ifdef JEMALLOC_ATOMIC_U64
+	uint64_t cur_dst = atomic_load_u64(dst, ATOMIC_RELAXED);
+	uint64_t cur_src = atomic_load_u64(src, ATOMIC_RELAXED);
+	atomic_store_u64(dst, cur_dst + cur_src, ATOMIC_RELAXED);
+#else
+	*dst += *src;
+#endif
+}
+
+/* Likewise: with ctl mutex synchronization, reading is simple. */
+static uint64_t
+ctl_arena_stats_read_u64(arena_stats_u64_t *p) {
+#ifdef JEMALLOC_ATOMIC_U64
+	return atomic_load_u64(p, ATOMIC_RELAXED);
+#else
+	return *p;
+#endif
+}
+
+static void
+accum_atomic_zu(atomic_zu_t *dst, atomic_zu_t *src) {
+	size_t cur_dst = atomic_load_zu(dst, ATOMIC_RELAXED);
+	size_t cur_src = atomic_load_zu(src, ATOMIC_RELAXED);
+	atomic_store_zu(dst, cur_dst + cur_src, ATOMIC_RELAXED);
+}
+
+/******************************************************************************/
+
+static unsigned
+arenas_i2a_impl(size_t i, bool compat, bool validate) {
+	unsigned a;
+
+	switch (i) {
+	case MALLCTL_ARENAS_ALL:
+		a = 0;
+		break;
+	case MALLCTL_ARENAS_DESTROYED:
+		a = 1;
+		break;
+	default:
+		if (compat && i == ctl_arenas->narenas) {
+			/*
+			 * Provide deprecated backward compatibility for
+			 * accessing the merged stats at index narenas rather
+			 * than via MALLCTL_ARENAS_ALL.  This is scheduled for
+			 * removal in 6.0.0.
+			 */
+			a = 0;
+		} else if (validate && i >= ctl_arenas->narenas) {
+			a = UINT_MAX;
+		} else {
+			/*
+			 * This function should never be called for an index
+			 * more than one past the range of indices that have
+			 * initialized ctl data.
+			 */
+			assert(i < ctl_arenas->narenas || (!validate && i ==
+			    ctl_arenas->narenas));
+			a = (unsigned)i + 2;
+		}
+		break;
+	}
+
+	return a;
+}
+
+static unsigned
+arenas_i2a(size_t i) {
+	return arenas_i2a_impl(i, true, false);
+}
+
+static ctl_arena_t *
+arenas_i_impl(tsd_t *tsd, size_t i, bool compat, bool init) {
+	ctl_arena_t *ret;
+
+	assert(!compat || !init);
+
+	ret = ctl_arenas->arenas[arenas_i2a_impl(i, compat, false)];
+	if (init && ret == NULL) {
+		if (config_stats) {
+			struct container_s {
+				ctl_arena_t		ctl_arena;
+				ctl_arena_stats_t	astats;
+			};
+			struct container_s *cont =
+			    (struct container_s *)base_alloc(tsd_tsdn(tsd),
+			    b0get(), sizeof(struct container_s), QUANTUM);
+			if (cont == NULL) {
+				return NULL;
+			}
+			ret = &cont->ctl_arena;
+			ret->astats = &cont->astats;
+		} else {
+			ret = (ctl_arena_t *)base_alloc(tsd_tsdn(tsd), b0get(),
+			    sizeof(ctl_arena_t), QUANTUM);
+			if (ret == NULL) {
+				return NULL;
+			}
+		}
+		ret->arena_ind = (unsigned)i;
+		ctl_arenas->arenas[arenas_i2a_impl(i, compat, false)] = ret;
+	}
+
+	assert(ret == NULL || arenas_i2a(ret->arena_ind) == arenas_i2a(i));
+	return ret;
+}
+
+static ctl_arena_t *
+arenas_i(size_t i) {
+	ctl_arena_t *ret = arenas_i_impl(tsd_fetch(), i, true, false);
+	assert(ret != NULL);
+	return ret;
+}
+
+static void
+ctl_arena_clear(ctl_arena_t *ctl_arena) {
+	ctl_arena->nthreads = 0;
+	ctl_arena->dss = dss_prec_names[dss_prec_limit];
+	ctl_arena->dirty_decay_ms = -1;
+	ctl_arena->muzzy_decay_ms = -1;
+	ctl_arena->pactive = 0;
+	ctl_arena->pdirty = 0;
+	ctl_arena->pmuzzy = 0;
+	if (config_stats) {
+		memset(&ctl_arena->astats->astats, 0, sizeof(arena_stats_t));
+		ctl_arena->astats->allocated_small = 0;
+		ctl_arena->astats->nmalloc_small = 0;
+		ctl_arena->astats->ndalloc_small = 0;
+		ctl_arena->astats->nrequests_small = 0;
+		memset(ctl_arena->astats->bstats, 0, NBINS *
+		    sizeof(bin_stats_t));
+		memset(ctl_arena->astats->lstats, 0, (NSIZES - NBINS) *
+		    sizeof(arena_stats_large_t));
+	}
+}
+
+static void
+ctl_arena_stats_amerge(tsdn_t *tsdn, ctl_arena_t *ctl_arena, arena_t *arena) {
+	unsigned i;
+
+	if (config_stats) {
+		arena_stats_merge(tsdn, arena, &ctl_arena->nthreads,
+		    &ctl_arena->dss, &ctl_arena->dirty_decay_ms,
+		    &ctl_arena->muzzy_decay_ms, &ctl_arena->pactive,
+		    &ctl_arena->pdirty, &ctl_arena->pmuzzy,
+		    &ctl_arena->astats->astats, ctl_arena->astats->bstats,
+		    ctl_arena->astats->lstats);
+
+		for (i = 0; i < NBINS; i++) {
+			ctl_arena->astats->allocated_small +=
+			    ctl_arena->astats->bstats[i].curregs *
+			    sz_index2size(i);
+			ctl_arena->astats->nmalloc_small +=
+			    ctl_arena->astats->bstats[i].nmalloc;
+			ctl_arena->astats->ndalloc_small +=
+			    ctl_arena->astats->bstats[i].ndalloc;
+			ctl_arena->astats->nrequests_small +=
+			    ctl_arena->astats->bstats[i].nrequests;
+		}
+	} else {
+		arena_basic_stats_merge(tsdn, arena, &ctl_arena->nthreads,
+		    &ctl_arena->dss, &ctl_arena->dirty_decay_ms,
+		    &ctl_arena->muzzy_decay_ms, &ctl_arena->pactive,
+		    &ctl_arena->pdirty, &ctl_arena->pmuzzy);
+	}
+}
+
+static void
+ctl_arena_stats_sdmerge(ctl_arena_t *ctl_sdarena, ctl_arena_t *ctl_arena,
+    bool destroyed) {
+	unsigned i;
+
+	if (!destroyed) {
+		ctl_sdarena->nthreads += ctl_arena->nthreads;
+		ctl_sdarena->pactive += ctl_arena->pactive;
+		ctl_sdarena->pdirty += ctl_arena->pdirty;
+		ctl_sdarena->pmuzzy += ctl_arena->pmuzzy;
+	} else {
+		assert(ctl_arena->nthreads == 0);
+		assert(ctl_arena->pactive == 0);
+		assert(ctl_arena->pdirty == 0);
+		assert(ctl_arena->pmuzzy == 0);
+	}
+
+	if (config_stats) {
+		ctl_arena_stats_t *sdstats = ctl_sdarena->astats;
+		ctl_arena_stats_t *astats = ctl_arena->astats;
+
+		if (!destroyed) {
+			accum_atomic_zu(&sdstats->astats.mapped,
+			    &astats->astats.mapped);
+			accum_atomic_zu(&sdstats->astats.retained,
+			    &astats->astats.retained);
+		}
+
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.npurge,
+		    &astats->astats.decay_dirty.npurge);
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.nmadvise,
+		    &astats->astats.decay_dirty.nmadvise);
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.purged,
+		    &astats->astats.decay_dirty.purged);
+
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.npurge,
+		    &astats->astats.decay_muzzy.npurge);
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.nmadvise,
+		    &astats->astats.decay_muzzy.nmadvise);
+		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.purged,
+		    &astats->astats.decay_muzzy.purged);
+
+#define OP(mtx) malloc_mutex_prof_merge(				\
+		    &(sdstats->astats.mutex_prof_data[			\
+		        arena_prof_mutex_##mtx]),			\
+		    &(astats->astats.mutex_prof_data[			\
+		        arena_prof_mutex_##mtx]));
+MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+		if (!destroyed) {
+			accum_atomic_zu(&sdstats->astats.base,
+			    &astats->astats.base);
+			accum_atomic_zu(&sdstats->astats.internal,
+			    &astats->astats.internal);
+			accum_atomic_zu(&sdstats->astats.resident,
+			    &astats->astats.resident);
+			accum_atomic_zu(&sdstats->astats.metadata_thp,
+			    &astats->astats.metadata_thp);
+		} else {
+			assert(atomic_load_zu(
+			    &astats->astats.internal, ATOMIC_RELAXED) == 0);
+		}
+
+		if (!destroyed) {
+			sdstats->allocated_small += astats->allocated_small;
+		} else {
+			assert(astats->allocated_small == 0);
+		}
+		sdstats->nmalloc_small += astats->nmalloc_small;
+		sdstats->ndalloc_small += astats->ndalloc_small;
+		sdstats->nrequests_small += astats->nrequests_small;
+
+		if (!destroyed) {
+			accum_atomic_zu(&sdstats->astats.allocated_large,
+			    &astats->astats.allocated_large);
+		} else {
+			assert(atomic_load_zu(&astats->astats.allocated_large,
+			    ATOMIC_RELAXED) == 0);
+		}
+		ctl_accum_arena_stats_u64(&sdstats->astats.nmalloc_large,
+		    &astats->astats.nmalloc_large);
+		ctl_accum_arena_stats_u64(&sdstats->astats.ndalloc_large,
+		    &astats->astats.ndalloc_large);
+		ctl_accum_arena_stats_u64(&sdstats->astats.nrequests_large,
+		    &astats->astats.nrequests_large);
+
+		accum_atomic_zu(&sdstats->astats.tcache_bytes,
+		    &astats->astats.tcache_bytes);
+
+		if (ctl_arena->arena_ind == 0) {
+			sdstats->astats.uptime = astats->astats.uptime;
+		}
+
+		for (i = 0; i < NBINS; i++) {
+			sdstats->bstats[i].nmalloc += astats->bstats[i].nmalloc;
+			sdstats->bstats[i].ndalloc += astats->bstats[i].ndalloc;
+			sdstats->bstats[i].nrequests +=
+			    astats->bstats[i].nrequests;
+			if (!destroyed) {
+				sdstats->bstats[i].curregs +=
+				    astats->bstats[i].curregs;
+			} else {
+				assert(astats->bstats[i].curregs == 0);
+			}
+			sdstats->bstats[i].nfills += astats->bstats[i].nfills;
+			sdstats->bstats[i].nflushes +=
+			    astats->bstats[i].nflushes;
+			sdstats->bstats[i].nslabs += astats->bstats[i].nslabs;
+			sdstats->bstats[i].reslabs += astats->bstats[i].reslabs;
+			if (!destroyed) {
+				sdstats->bstats[i].curslabs +=
+				    astats->bstats[i].curslabs;
+			} else {
+				assert(astats->bstats[i].curslabs == 0);
+			}
+			malloc_mutex_prof_merge(&sdstats->bstats[i].mutex_data,
+			    &astats->bstats[i].mutex_data);
+		}
+
+		for (i = 0; i < NSIZES - NBINS; i++) {
+			ctl_accum_arena_stats_u64(&sdstats->lstats[i].nmalloc,
+			    &astats->lstats[i].nmalloc);
+			ctl_accum_arena_stats_u64(&sdstats->lstats[i].ndalloc,
+			    &astats->lstats[i].ndalloc);
+			ctl_accum_arena_stats_u64(&sdstats->lstats[i].nrequests,
+			    &astats->lstats[i].nrequests);
+			if (!destroyed) {
+				sdstats->lstats[i].curlextents +=
+				    astats->lstats[i].curlextents;
+			} else {
+				assert(astats->lstats[i].curlextents == 0);
+			}
+		}
+	}
+}
+
+static void
+ctl_arena_refresh(tsdn_t *tsdn, arena_t *arena, ctl_arena_t *ctl_sdarena,
+    unsigned i, bool destroyed) {
+	ctl_arena_t *ctl_arena = arenas_i(i);
+
+	ctl_arena_clear(ctl_arena);
+	ctl_arena_stats_amerge(tsdn, ctl_arena, arena);
+	/* Merge into sum stats as well. */
+	ctl_arena_stats_sdmerge(ctl_sdarena, ctl_arena, destroyed);
+}
+
+static unsigned
+ctl_arena_init(tsd_t *tsd, extent_hooks_t *extent_hooks) {
+	unsigned arena_ind;
+	ctl_arena_t *ctl_arena;
+
+	if ((ctl_arena = ql_last(&ctl_arenas->destroyed, destroyed_link)) !=
+	    NULL) {
+		ql_remove(&ctl_arenas->destroyed, ctl_arena, destroyed_link);
+		arena_ind = ctl_arena->arena_ind;
+	} else {
+		arena_ind = ctl_arenas->narenas;
+	}
+
+	/* Trigger stats allocation. */
+	if (arenas_i_impl(tsd, arena_ind, false, true) == NULL) {
+		return UINT_MAX;
+	}
+
+	/* Initialize new arena. */
+	if (arena_init(tsd_tsdn(tsd), arena_ind, extent_hooks) == NULL) {
+		return UINT_MAX;
+	}
+
+	if (arena_ind == ctl_arenas->narenas) {
+		ctl_arenas->narenas++;
+	}
+
+	return arena_ind;
+}
+
+static void
+ctl_background_thread_stats_read(tsdn_t *tsdn) {
+	background_thread_stats_t *stats = &ctl_stats->background_thread;
+	if (!have_background_thread ||
+	    background_thread_stats_read(tsdn, stats)) {
+		memset(stats, 0, sizeof(background_thread_stats_t));
+		nstime_init(&stats->run_interval, 0);
+	}
+}
+
+static void
+ctl_refresh(tsdn_t *tsdn) {
+	unsigned i;
+	ctl_arena_t *ctl_sarena = arenas_i(MALLCTL_ARENAS_ALL);
+	VARIABLE_ARRAY(arena_t *, tarenas, ctl_arenas->narenas);
+
+	/*
+	 * Clear sum stats, since they will be merged into by
+	 * ctl_arena_refresh().
+	 */
+	ctl_arena_clear(ctl_sarena);
+
+	for (i = 0; i < ctl_arenas->narenas; i++) {
+		tarenas[i] = arena_get(tsdn, i, false);
+	}
+
+	for (i = 0; i < ctl_arenas->narenas; i++) {
+		ctl_arena_t *ctl_arena = arenas_i(i);
+		bool initialized = (tarenas[i] != NULL);
+
+		ctl_arena->initialized = initialized;
+		if (initialized) {
+			ctl_arena_refresh(tsdn, tarenas[i], ctl_sarena, i,
+			    false);
+		}
+	}
+
+	if (config_stats) {
+		ctl_stats->allocated = ctl_sarena->astats->allocated_small +
+		    atomic_load_zu(&ctl_sarena->astats->astats.allocated_large,
+			ATOMIC_RELAXED);
+		ctl_stats->active = (ctl_sarena->pactive << LG_PAGE);
+		ctl_stats->metadata = atomic_load_zu(
+		    &ctl_sarena->astats->astats.base, ATOMIC_RELAXED) +
+		    atomic_load_zu(&ctl_sarena->astats->astats.internal,
+			ATOMIC_RELAXED);
+		ctl_stats->metadata_thp = atomic_load_zu(
+		    &ctl_sarena->astats->astats.metadata_thp, ATOMIC_RELAXED);
+		ctl_stats->resident = atomic_load_zu(
+		    &ctl_sarena->astats->astats.resident, ATOMIC_RELAXED);
+		ctl_stats->mapped = atomic_load_zu(
+		    &ctl_sarena->astats->astats.mapped, ATOMIC_RELAXED);
+		ctl_stats->retained = atomic_load_zu(
+		    &ctl_sarena->astats->astats.retained, ATOMIC_RELAXED);
+
+		ctl_background_thread_stats_read(tsdn);
+
+#define READ_GLOBAL_MUTEX_PROF_DATA(i, mtx)				\
+    malloc_mutex_lock(tsdn, &mtx);					\
+    malloc_mutex_prof_read(tsdn, &ctl_stats->mutex_prof_data[i], &mtx);	\
+    malloc_mutex_unlock(tsdn, &mtx);
+
+		if (config_prof && opt_prof) {
+			READ_GLOBAL_MUTEX_PROF_DATA(global_prof_mutex_prof,
+			    bt2gctx_mtx);
+		}
+		if (have_background_thread) {
+			READ_GLOBAL_MUTEX_PROF_DATA(
+			    global_prof_mutex_background_thread,
+			    background_thread_lock);
+		} else {
+			memset(&ctl_stats->mutex_prof_data[
+			    global_prof_mutex_background_thread], 0,
+			    sizeof(mutex_prof_data_t));
+		}
+		/* We own ctl mutex already. */
+		malloc_mutex_prof_read(tsdn,
+		    &ctl_stats->mutex_prof_data[global_prof_mutex_ctl],
+		    &ctl_mtx);
+#undef READ_GLOBAL_MUTEX_PROF_DATA
+	}
+	ctl_arenas->epoch++;
+}
+
+static bool
+ctl_init(tsd_t *tsd) {
+	bool ret;
+	tsdn_t *tsdn = tsd_tsdn(tsd);
+
+	malloc_mutex_lock(tsdn, &ctl_mtx);
+	if (!ctl_initialized) {
+		ctl_arena_t *ctl_sarena, *ctl_darena;
+		unsigned i;
+
+		/*
+		 * Allocate demand-zeroed space for pointers to the full
+		 * range of supported arena indices.
+		 */
+		if (ctl_arenas == NULL) {
+			ctl_arenas = (ctl_arenas_t *)base_alloc(tsdn,
+			    b0get(), sizeof(ctl_arenas_t), QUANTUM);
+			if (ctl_arenas == NULL) {
+				ret = true;
+				goto label_return;
+			}
+		}
+
+		if (config_stats && ctl_stats == NULL) {
+			ctl_stats = (ctl_stats_t *)base_alloc(tsdn, b0get(),
+			    sizeof(ctl_stats_t), QUANTUM);
+			if (ctl_stats == NULL) {
+				ret = true;
+				goto label_return;
+			}
+		}
+
+		/*
+		 * Allocate space for the current full range of arenas
+		 * here rather than doing it lazily elsewhere, in order
+		 * to limit when OOM-caused errors can occur.
+		 */
+		if ((ctl_sarena = arenas_i_impl(tsd, MALLCTL_ARENAS_ALL, false,
+		    true)) == NULL) {
+			ret = true;
+			goto label_return;
+		}
+		ctl_sarena->initialized = true;
+
+		if ((ctl_darena = arenas_i_impl(tsd, MALLCTL_ARENAS_DESTROYED,
+		    false, true)) == NULL) {
+			ret = true;
+			goto label_return;
+		}
+		ctl_arena_clear(ctl_darena);
+		/*
+		 * Don't toggle ctl_darena to initialized until an arena is
+		 * actually destroyed, so that arena.<i>.initialized can be used
+		 * to query whether the stats are relevant.
+		 */
+
+		ctl_arenas->narenas = narenas_total_get();
+		for (i = 0; i < ctl_arenas->narenas; i++) {
+			if (arenas_i_impl(tsd, i, false, true) == NULL) {
+				ret = true;
+				goto label_return;
+			}
+		}
+
+		ql_new(&ctl_arenas->destroyed);
+		ctl_refresh(tsdn);
+
+		ctl_initialized = true;
+	}
+
+	ret = false;
+label_return:
+	malloc_mutex_unlock(tsdn, &ctl_mtx);
+	return ret;
+}
+
+static int
+ctl_lookup(tsdn_t *tsdn, const char *name, ctl_node_t const **nodesp,
+    size_t *mibp, size_t *depthp) {
+	int ret;
+	const char *elm, *tdot, *dot;
+	size_t elen, i, j;
+	const ctl_named_node_t *node;
+
+	elm = name;
+	/* Equivalent to strchrnul(). */
+	dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot : strchr(elm, '\0');
+	elen = (size_t)((uintptr_t)dot - (uintptr_t)elm);
+	if (elen == 0) {
+		ret = ENOENT;
+		goto label_return;
+	}
+	node = super_root_node;
+	for (i = 0; i < *depthp; i++) {
+		assert(node);
+		assert(node->nchildren > 0);
+		if (ctl_named_node(node->children) != NULL) {
+			const ctl_named_node_t *pnode = node;
+
+			/* Children are named. */
+			for (j = 0; j < node->nchildren; j++) {
+				const ctl_named_node_t *child =
+				    ctl_named_children(node, j);
+				if (strlen(child->name) == elen &&
+				    strncmp(elm, child->name, elen) == 0) {
+					node = child;
+					if (nodesp != NULL) {
+						nodesp[i] =
+						    (const ctl_node_t *)node;
+					}
+					mibp[i] = j;
+					break;
+				}
+			}
+			if (node == pnode) {
+				ret = ENOENT;
+				goto label_return;
+			}
+		} else {
+			uintmax_t index;
+			const ctl_indexed_node_t *inode;
+
+			/* Children are indexed. */
+			index = malloc_strtoumax(elm, NULL, 10);
+			if (index == UINTMAX_MAX || index > SIZE_T_MAX) {
+				ret = ENOENT;
+				goto label_return;
+			}
+
+			inode = ctl_indexed_node(node->children);
+			node = inode->index(tsdn, mibp, *depthp, (size_t)index);
+			if (node == NULL) {
+				ret = ENOENT;
+				goto label_return;
+			}
+
+			if (nodesp != NULL) {
+				nodesp[i] = (const ctl_node_t *)node;
+			}
+			mibp[i] = (size_t)index;
+		}
+
+		if (node->ctl != NULL) {
+			/* Terminal node. */
+			if (*dot != '\0') {
+				/*
+				 * The name contains more elements than are
+				 * in this path through the tree.
+				 */
+				ret = ENOENT;
+				goto label_return;
+			}
+			/* Complete lookup successful. */
+			*depthp = i + 1;
+			break;
+		}
+
+		/* Update elm. */
+		if (*dot == '\0') {
+			/* No more elements. */
+			ret = ENOENT;
+			goto label_return;
+		}
+		elm = &dot[1];
+		dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot :
+		    strchr(elm, '\0');
+		elen = (size_t)((uintptr_t)dot - (uintptr_t)elm);
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+int
+ctl_byname(tsd_t *tsd, const char *name, void *oldp, size_t *oldlenp,
+    void *newp, size_t newlen) {
+	int ret;
+	size_t depth;
+	ctl_node_t const *nodes[CTL_MAX_DEPTH];
+	size_t mib[CTL_MAX_DEPTH];
+	const ctl_named_node_t *node;
+
+	if (!ctl_initialized && ctl_init(tsd)) {
+		ret = EAGAIN;
+		goto label_return;
+	}
+
+	depth = CTL_MAX_DEPTH;
+	ret = ctl_lookup(tsd_tsdn(tsd), name, nodes, mib, &depth);
+	if (ret != 0) {
+		goto label_return;
+	}
+
+	node = ctl_named_node(nodes[depth-1]);
+	if (node != NULL && node->ctl) {
+		ret = node->ctl(tsd, mib, depth, oldp, oldlenp, newp, newlen);
+	} else {
+		/* The name refers to a partial path through the ctl tree. */
+		ret = ENOENT;
+	}
+
+label_return:
+	return(ret);
+}
+
+int
+ctl_nametomib(tsd_t *tsd, const char *name, size_t *mibp, size_t *miblenp) {
+	int ret;
+
+	if (!ctl_initialized && ctl_init(tsd)) {
+		ret = EAGAIN;
+		goto label_return;
+	}
+
+	ret = ctl_lookup(tsd_tsdn(tsd), name, NULL, mibp, miblenp);
+label_return:
+	return(ret);
+}
+
+int
+ctl_bymib(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	const ctl_named_node_t *node;
+	size_t i;
+
+	if (!ctl_initialized && ctl_init(tsd)) {
+		ret = EAGAIN;
+		goto label_return;
+	}
+
+	/* Iterate down the tree. */
+	node = super_root_node;
+	for (i = 0; i < miblen; i++) {
+		assert(node);
+		assert(node->nchildren > 0);
+		if (ctl_named_node(node->children) != NULL) {
+			/* Children are named. */
+			if (node->nchildren <= mib[i]) {
+				ret = ENOENT;
+				goto label_return;
+			}
+			node = ctl_named_children(node, mib[i]);
+		} else {
+			const ctl_indexed_node_t *inode;
+
+			/* Indexed element. */
+			inode = ctl_indexed_node(node->children);
+			node = inode->index(tsd_tsdn(tsd), mib, miblen, mib[i]);
+			if (node == NULL) {
+				ret = ENOENT;
+				goto label_return;
+			}
+		}
+	}
+
+	/* Call the ctl function. */
+	if (node && node->ctl) {
+		ret = node->ctl(tsd, mib, miblen, oldp, oldlenp, newp, newlen);
+	} else {
+		/* Partial MIB. */
+		ret = ENOENT;
+	}
+
+label_return:
+	return(ret);
+}
+
+bool
+ctl_boot(void) {
+	if (malloc_mutex_init(&ctl_mtx, "ctl", WITNESS_RANK_CTL,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+
+	ctl_initialized = false;
+
+	return false;
+}
+
+void
+ctl_prefork(tsdn_t *tsdn) {
+	malloc_mutex_prefork(tsdn, &ctl_mtx);
+}
+
+void
+ctl_postfork_parent(tsdn_t *tsdn) {
+	malloc_mutex_postfork_parent(tsdn, &ctl_mtx);
+}
+
+void
+ctl_postfork_child(tsdn_t *tsdn) {
+	malloc_mutex_postfork_child(tsdn, &ctl_mtx);
+}
+
+/******************************************************************************/
+/* *_ctl() functions. */
+
+#define READONLY()	do {						\
+	if (newp != NULL || newlen != 0) {				\
+		ret = EPERM;						\
+		goto label_return;					\
+	}								\
+} while (0)
+
+#define WRITEONLY()	do {						\
+	if (oldp != NULL || oldlenp != NULL) {				\
+		ret = EPERM;						\
+		goto label_return;					\
+	}								\
+} while (0)
+
+#define READ_XOR_WRITE()	do {					\
+	if ((oldp != NULL && oldlenp != NULL) && (newp != NULL ||	\
+	    newlen != 0)) {						\
+		ret = EPERM;						\
+		goto label_return;					\
+	}								\
+} while (0)
+
+#define READ(v, t)	do {						\
+	if (oldp != NULL && oldlenp != NULL) {				\
+		if (*oldlenp != sizeof(t)) {				\
+			size_t	copylen = (sizeof(t) <= *oldlenp)	\
+			    ? sizeof(t) : *oldlenp;			\
+			memcpy(oldp, (void *)&(v), copylen);		\
+			ret = EINVAL;					\
+			goto label_return;				\
+		}							\
+		*(t *)oldp = (v);					\
+	}								\
+} while (0)
+
+#define WRITE(v, t)	do {						\
+	if (newp != NULL) {						\
+		if (newlen != sizeof(t)) {				\
+			ret = EINVAL;					\
+			goto label_return;				\
+		}							\
+		(v) = *(t *)newp;					\
+	}								\
+} while (0)
+
+#define MIB_UNSIGNED(v, i) do {						\
+	if (mib[i] > UINT_MAX) {					\
+		ret = EFAULT;						\
+		goto label_return;					\
+	}								\
+	v = (unsigned)mib[i];						\
+} while (0)
+
+/*
+ * There's a lot of code duplication in the following macros due to limitations
+ * in how nested cpp macros are expanded.
+ */
+#define CTL_RO_CLGEN(c, l, n, v, t)					\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	if (!(c)) {							\
+		return ENOENT;						\
+	}								\
+	if (l) {							\
+		malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);		\
+	}								\
+	READONLY();							\
+	oldval = (v);							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	if (l) {							\
+		malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);		\
+	}								\
+	return ret;							\
+}
+
+#define CTL_RO_CGEN(c, n, v, t)						\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	if (!(c)) {							\
+		return ENOENT;						\
+	}								\
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);			\
+	READONLY();							\
+	oldval = (v);							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);			\
+	return ret;							\
+}
+
+#define CTL_RO_GEN(n, v, t)						\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);			\
+	READONLY();							\
+	oldval = (v);							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);			\
+	return ret;							\
+}
+
+/*
+ * ctl_mtx is not acquired, under the assumption that no pertinent data will
+ * mutate during the call.
+ */
+#define CTL_RO_NL_CGEN(c, n, v, t)					\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	if (!(c)) {							\
+		return ENOENT;						\
+	}								\
+	READONLY();							\
+	oldval = (v);							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	return ret;							\
+}
+
+#define CTL_RO_NL_GEN(n, v, t)						\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	READONLY();							\
+	oldval = (v);							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	return ret;							\
+}
+
+#define CTL_TSD_RO_NL_CGEN(c, n, m, t)					\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	if (!(c)) {							\
+		return ENOENT;						\
+	}								\
+	READONLY();							\
+	oldval = (m(tsd));						\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	return ret;							\
+}
+
+#define CTL_RO_CONFIG_GEN(n, t)						\
+static int								\
+n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
+    size_t *oldlenp, void *newp, size_t newlen) {			\
+	int ret;							\
+	t oldval;							\
+									\
+	READONLY();							\
+	oldval = n;							\
+	READ(oldval, t);						\
+									\
+	ret = 0;							\
+label_return:								\
+	return ret;							\
+}
+
+/******************************************************************************/
+
+CTL_RO_NL_GEN(version, JEMALLOC_VERSION, const char *)
+
+static int
+epoch_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	UNUSED uint64_t newval;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	WRITE(newval, uint64_t);
+	if (newp != NULL) {
+		ctl_refresh(tsd_tsdn(tsd));
+	}
+	READ(ctl_arenas->epoch, uint64_t);
+
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static int
+background_thread_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	if (!have_background_thread) {
+		return ENOENT;
+	}
+	background_thread_ctl_init(tsd_tsdn(tsd));
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
+	if (newp == NULL) {
+		oldval = background_thread_enabled();
+		READ(oldval, bool);
+	} else {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		oldval = background_thread_enabled();
+		READ(oldval, bool);
+
+		bool newval = *(bool *)newp;
+		if (newval == oldval) {
+			ret = 0;
+			goto label_return;
+		}
+
+		background_thread_enabled_set(tsd_tsdn(tsd), newval);
+		if (newval) {
+			if (!can_enable_background_thread) {
+				malloc_printf("<jemalloc>: Error in dlsym("
+			            "RTLD_NEXT, \"pthread_create\"). Cannot "
+				    "enable background_thread\n");
+				ret = EFAULT;
+				goto label_return;
+			}
+			if (background_threads_enable(tsd)) {
+				ret = EFAULT;
+				goto label_return;
+			}
+		} else {
+			if (background_threads_disable(tsd)) {
+				ret = EFAULT;
+				goto label_return;
+			}
+		}
+	}
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+
+	return ret;
+}
+
+static int
+max_background_threads_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	size_t oldval;
+
+	if (!have_background_thread) {
+		return ENOENT;
+	}
+	background_thread_ctl_init(tsd_tsdn(tsd));
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
+	if (newp == NULL) {
+		oldval = max_background_threads;
+		READ(oldval, size_t);
+	} else {
+		if (newlen != sizeof(size_t)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		oldval = max_background_threads;
+		READ(oldval, size_t);
+
+		size_t newval = *(size_t *)newp;
+		if (newval == oldval) {
+			ret = 0;
+			goto label_return;
+		}
+		if (newval > opt_max_background_threads) {
+			ret = EINVAL;
+			goto label_return;
+		}
+
+		if (background_thread_enabled()) {
+			if (!can_enable_background_thread) {
+				malloc_printf("<jemalloc>: Error in dlsym("
+			            "RTLD_NEXT, \"pthread_create\"). Cannot "
+				    "enable background_thread\n");
+				ret = EFAULT;
+				goto label_return;
+			}
+			background_thread_enabled_set(tsd_tsdn(tsd), false);
+			if (background_threads_disable(tsd)) {
+				ret = EFAULT;
+				goto label_return;
+			}
+			max_background_threads = newval;
+			background_thread_enabled_set(tsd_tsdn(tsd), true);
+			if (background_threads_enable(tsd)) {
+				ret = EFAULT;
+				goto label_return;
+			}
+		} else {
+			max_background_threads = newval;
+		}
+	}
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+
+	return ret;
+}
+
+/******************************************************************************/
+
+CTL_RO_CONFIG_GEN(config_cache_oblivious, bool)
+CTL_RO_CONFIG_GEN(config_debug, bool)
+CTL_RO_CONFIG_GEN(config_fill, bool)
+CTL_RO_CONFIG_GEN(config_lazy_lock, bool)
+CTL_RO_CONFIG_GEN(config_malloc_conf, const char *)
+CTL_RO_CONFIG_GEN(config_prof, bool)
+CTL_RO_CONFIG_GEN(config_prof_libgcc, bool)
+CTL_RO_CONFIG_GEN(config_prof_libunwind, bool)
+CTL_RO_CONFIG_GEN(config_stats, bool)
+CTL_RO_CONFIG_GEN(config_utrace, bool)
+CTL_RO_CONFIG_GEN(config_xmalloc, bool)
+
+/******************************************************************************/
+
+CTL_RO_NL_GEN(opt_abort, opt_abort, bool)
+CTL_RO_NL_GEN(opt_abort_conf, opt_abort_conf, bool)
+CTL_RO_NL_GEN(opt_metadata_thp, metadata_thp_mode_names[opt_metadata_thp],
+    const char *)
+CTL_RO_NL_GEN(opt_retain, opt_retain, bool)
+CTL_RO_NL_GEN(opt_dss, opt_dss, const char *)
+CTL_RO_NL_GEN(opt_narenas, opt_narenas, unsigned)
+CTL_RO_NL_GEN(opt_percpu_arena, percpu_arena_mode_names[opt_percpu_arena],
+    const char *)
+CTL_RO_NL_GEN(opt_background_thread, opt_background_thread, bool)
+CTL_RO_NL_GEN(opt_max_background_threads, opt_max_background_threads, size_t)
+CTL_RO_NL_GEN(opt_dirty_decay_ms, opt_dirty_decay_ms, ssize_t)
+CTL_RO_NL_GEN(opt_muzzy_decay_ms, opt_muzzy_decay_ms, ssize_t)
+CTL_RO_NL_GEN(opt_stats_print, opt_stats_print, bool)
+CTL_RO_NL_GEN(opt_stats_print_opts, opt_stats_print_opts, const char *)
+CTL_RO_NL_CGEN(config_fill, opt_junk, opt_junk, const char *)
+CTL_RO_NL_CGEN(config_fill, opt_zero, opt_zero, bool)
+CTL_RO_NL_CGEN(config_utrace, opt_utrace, opt_utrace, bool)
+CTL_RO_NL_CGEN(config_xmalloc, opt_xmalloc, opt_xmalloc, bool)
+CTL_RO_NL_GEN(opt_tcache, opt_tcache, bool)
+CTL_RO_NL_GEN(opt_thp, thp_mode_names[opt_thp], const char *)
+CTL_RO_NL_GEN(opt_lg_extent_max_active_fit, opt_lg_extent_max_active_fit,
+    size_t)
+CTL_RO_NL_GEN(opt_lg_tcache_max, opt_lg_tcache_max, ssize_t)
+CTL_RO_NL_CGEN(config_prof, opt_prof, opt_prof, bool)
+CTL_RO_NL_CGEN(config_prof, opt_prof_prefix, opt_prof_prefix, const char *)
+CTL_RO_NL_CGEN(config_prof, opt_prof_active, opt_prof_active, bool)
+CTL_RO_NL_CGEN(config_prof, opt_prof_thread_active_init,
+    opt_prof_thread_active_init, bool)
+CTL_RO_NL_CGEN(config_prof, opt_lg_prof_sample, opt_lg_prof_sample, size_t)
+CTL_RO_NL_CGEN(config_prof, opt_prof_accum, opt_prof_accum, bool)
+CTL_RO_NL_CGEN(config_prof, opt_lg_prof_interval, opt_lg_prof_interval, ssize_t)
+CTL_RO_NL_CGEN(config_prof, opt_prof_gdump, opt_prof_gdump, bool)
+CTL_RO_NL_CGEN(config_prof, opt_prof_final, opt_prof_final, bool)
+CTL_RO_NL_CGEN(config_prof, opt_prof_leak, opt_prof_leak, bool)
+
+/******************************************************************************/
+
+static int
+thread_arena_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	arena_t *oldarena;
+	unsigned newind, oldind;
+
+	oldarena = arena_choose(tsd, NULL);
+	if (oldarena == NULL) {
+		return EAGAIN;
+	}
+	newind = oldind = arena_ind_get(oldarena);
+	WRITE(newind, unsigned);
+	READ(oldind, unsigned);
+
+	if (newind != oldind) {
+		arena_t *newarena;
+
+		if (newind >= narenas_total_get()) {
+			/* New arena index is out of range. */
+			ret = EFAULT;
+			goto label_return;
+		}
+
+		if (have_percpu_arena &&
+		    PERCPU_ARENA_ENABLED(opt_percpu_arena)) {
+			if (newind < percpu_arena_ind_limit(opt_percpu_arena)) {
+				/*
+				 * If perCPU arena is enabled, thread_arena
+				 * control is not allowed for the auto arena
+				 * range.
+				 */
+				ret = EPERM;
+				goto label_return;
+			}
+		}
+
+		/* Initialize arena if necessary. */
+		newarena = arena_get(tsd_tsdn(tsd), newind, true);
+		if (newarena == NULL) {
+			ret = EAGAIN;
+			goto label_return;
+		}
+		/* Set new arena/tcache associations. */
+		arena_migrate(tsd, oldind, newind);
+		if (tcache_available(tsd)) {
+			tcache_arena_reassociate(tsd_tsdn(tsd),
+			    tsd_tcachep_get(tsd), newarena);
+		}
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+CTL_TSD_RO_NL_CGEN(config_stats, thread_allocated, tsd_thread_allocated_get,
+    uint64_t)
+CTL_TSD_RO_NL_CGEN(config_stats, thread_allocatedp, tsd_thread_allocatedp_get,
+    uint64_t *)
+CTL_TSD_RO_NL_CGEN(config_stats, thread_deallocated, tsd_thread_deallocated_get,
+    uint64_t)
+CTL_TSD_RO_NL_CGEN(config_stats, thread_deallocatedp,
+    tsd_thread_deallocatedp_get, uint64_t *)
+
+static int
+thread_tcache_enabled_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	oldval = tcache_enabled_get(tsd);
+	if (newp != NULL) {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		tcache_enabled_set(tsd, *(bool *)newp);
+	}
+	READ(oldval, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+thread_tcache_flush_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+
+	if (!tcache_available(tsd)) {
+		ret = EFAULT;
+		goto label_return;
+	}
+
+	READONLY();
+	WRITEONLY();
+
+	tcache_flush(tsd);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+thread_prof_name_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	READ_XOR_WRITE();
+
+	if (newp != NULL) {
+		if (newlen != sizeof(const char *)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+
+		if ((ret = prof_thread_name_set(tsd, *(const char **)newp)) !=
+		    0) {
+			goto label_return;
+		}
+	} else {
+		const char *oldname = prof_thread_name_get(tsd);
+		READ(oldname, const char *);
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+thread_prof_active_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	oldval = prof_thread_active_get(tsd);
+	if (newp != NULL) {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		if (prof_thread_active_set(tsd, *(bool *)newp)) {
+			ret = EAGAIN;
+			goto label_return;
+		}
+	}
+	READ(oldval, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+/******************************************************************************/
+
+static int
+tcache_create_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned tcache_ind;
+
+	READONLY();
+	if (tcaches_create(tsd, &tcache_ind)) {
+		ret = EFAULT;
+		goto label_return;
+	}
+	READ(tcache_ind, unsigned);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+tcache_flush_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned tcache_ind;
+
+	WRITEONLY();
+	tcache_ind = UINT_MAX;
+	WRITE(tcache_ind, unsigned);
+	if (tcache_ind == UINT_MAX) {
+		ret = EFAULT;
+		goto label_return;
+	}
+	tcaches_flush(tsd, tcache_ind);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+tcache_destroy_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned tcache_ind;
+
+	WRITEONLY();
+	tcache_ind = UINT_MAX;
+	WRITE(tcache_ind, unsigned);
+	if (tcache_ind == UINT_MAX) {
+		ret = EFAULT;
+		goto label_return;
+	}
+	tcaches_destroy(tsd, tcache_ind);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+/******************************************************************************/
+
+static int
+arena_i_initialized_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	tsdn_t *tsdn = tsd_tsdn(tsd);
+	unsigned arena_ind;
+	bool initialized;
+
+	READONLY();
+	MIB_UNSIGNED(arena_ind, 1);
+
+	malloc_mutex_lock(tsdn, &ctl_mtx);
+	initialized = arenas_i(arena_ind)->initialized;
+	malloc_mutex_unlock(tsdn, &ctl_mtx);
+
+	READ(initialized, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static void
+arena_i_decay(tsdn_t *tsdn, unsigned arena_ind, bool all) {
+	malloc_mutex_lock(tsdn, &ctl_mtx);
+	{
+		unsigned narenas = ctl_arenas->narenas;
+
+		/*
+		 * Access via index narenas is deprecated, and scheduled for
+		 * removal in 6.0.0.
+		 */
+		if (arena_ind == MALLCTL_ARENAS_ALL || arena_ind == narenas) {
+			unsigned i;
+			VARIABLE_ARRAY(arena_t *, tarenas, narenas);
+
+			for (i = 0; i < narenas; i++) {
+				tarenas[i] = arena_get(tsdn, i, false);
+			}
+
+			/*
+			 * No further need to hold ctl_mtx, since narenas and
+			 * tarenas contain everything needed below.
+			 */
+			malloc_mutex_unlock(tsdn, &ctl_mtx);
+
+			for (i = 0; i < narenas; i++) {
+				if (tarenas[i] != NULL) {
+					arena_decay(tsdn, tarenas[i], false,
+					    all);
+				}
+			}
+		} else {
+			arena_t *tarena;
+
+			assert(arena_ind < narenas);
+
+			tarena = arena_get(tsdn, arena_ind, false);
+
+			/* No further need to hold ctl_mtx. */
+			malloc_mutex_unlock(tsdn, &ctl_mtx);
+
+			if (tarena != NULL) {
+				arena_decay(tsdn, tarena, false, all);
+			}
+		}
+	}
+}
+
+static int
+arena_i_decay_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+
+	READONLY();
+	WRITEONLY();
+	MIB_UNSIGNED(arena_ind, 1);
+	arena_i_decay(tsd_tsdn(tsd), arena_ind, false);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+arena_i_purge_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+
+	READONLY();
+	WRITEONLY();
+	MIB_UNSIGNED(arena_ind, 1);
+	arena_i_decay(tsd_tsdn(tsd), arena_ind, true);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+arena_i_reset_destroy_helper(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen, unsigned *arena_ind,
+    arena_t **arena) {
+	int ret;
+
+	READONLY();
+	WRITEONLY();
+	MIB_UNSIGNED(*arena_ind, 1);
+
+	*arena = arena_get(tsd_tsdn(tsd), *arena_ind, false);
+	if (*arena == NULL || arena_is_auto(*arena)) {
+		ret = EFAULT;
+		goto label_return;
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static void
+arena_reset_prepare_background_thread(tsd_t *tsd, unsigned arena_ind) {
+	/* Temporarily disable the background thread during arena reset. */
+	if (have_background_thread) {
+		malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
+		if (background_thread_enabled()) {
+			unsigned ind = arena_ind % ncpus;
+			background_thread_info_t *info =
+			    &background_thread_info[ind];
+			assert(info->state == background_thread_started);
+			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+			info->state = background_thread_paused;
+			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+		}
+	}
+}
+
+static void
+arena_reset_finish_background_thread(tsd_t *tsd, unsigned arena_ind) {
+	if (have_background_thread) {
+		if (background_thread_enabled()) {
+			unsigned ind = arena_ind % ncpus;
+			background_thread_info_t *info =
+			    &background_thread_info[ind];
+			assert(info->state == background_thread_paused);
+			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+			info->state = background_thread_started;
+			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
+	}
+}
+
+static int
+arena_i_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+	arena_t *arena;
+
+	ret = arena_i_reset_destroy_helper(tsd, mib, miblen, oldp, oldlenp,
+	    newp, newlen, &arena_ind, &arena);
+	if (ret != 0) {
+		return ret;
+	}
+
+	arena_reset_prepare_background_thread(tsd, arena_ind);
+	arena_reset(tsd, arena);
+	arena_reset_finish_background_thread(tsd, arena_ind);
+
+	return ret;
+}
+
+static int
+arena_i_destroy_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+	arena_t *arena;
+	ctl_arena_t *ctl_darena, *ctl_arena;
+
+	ret = arena_i_reset_destroy_helper(tsd, mib, miblen, oldp, oldlenp,
+	    newp, newlen, &arena_ind, &arena);
+	if (ret != 0) {
+		goto label_return;
+	}
+
+	if (arena_nthreads_get(arena, false) != 0 || arena_nthreads_get(arena,
+	    true) != 0) {
+		ret = EFAULT;
+		goto label_return;
+	}
+
+	arena_reset_prepare_background_thread(tsd, arena_ind);
+	/* Merge stats after resetting and purging arena. */
+	arena_reset(tsd, arena);
+	arena_decay(tsd_tsdn(tsd), arena, false, true);
+	ctl_darena = arenas_i(MALLCTL_ARENAS_DESTROYED);
+	ctl_darena->initialized = true;
+	ctl_arena_refresh(tsd_tsdn(tsd), arena, ctl_darena, arena_ind, true);
+	/* Destroy arena. */
+	arena_destroy(tsd, arena);
+	ctl_arena = arenas_i(arena_ind);
+	ctl_arena->initialized = false;
+	/* Record arena index for later recycling via arenas.create. */
+	ql_elm_new(ctl_arena, destroyed_link);
+	ql_tail_insert(&ctl_arenas->destroyed, ctl_arena, destroyed_link);
+	arena_reset_finish_background_thread(tsd, arena_ind);
+
+	assert(ret == 0);
+label_return:
+	return ret;
+}
+
+static int
+arena_i_dss_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	const char *dss = NULL;
+	unsigned arena_ind;
+	dss_prec_t dss_prec_old = dss_prec_limit;
+	dss_prec_t dss_prec = dss_prec_limit;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	WRITE(dss, const char *);
+	MIB_UNSIGNED(arena_ind, 1);
+	if (dss != NULL) {
+		int i;
+		bool match = false;
+
+		for (i = 0; i < dss_prec_limit; i++) {
+			if (strcmp(dss_prec_names[i], dss) == 0) {
+				dss_prec = i;
+				match = true;
+				break;
+			}
+		}
+
+		if (!match) {
+			ret = EINVAL;
+			goto label_return;
+		}
+	}
+
+	/*
+	 * Access via index narenas is deprecated, and scheduled for removal in
+	 * 6.0.0.
+	 */
+	if (arena_ind == MALLCTL_ARENAS_ALL || arena_ind ==
+	    ctl_arenas->narenas) {
+		if (dss_prec != dss_prec_limit &&
+		    extent_dss_prec_set(dss_prec)) {
+			ret = EFAULT;
+			goto label_return;
+		}
+		dss_prec_old = extent_dss_prec_get();
+	} else {
+		arena_t *arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
+		if (arena == NULL || (dss_prec != dss_prec_limit &&
+		    arena_dss_prec_set(arena, dss_prec))) {
+			ret = EFAULT;
+			goto label_return;
+		}
+		dss_prec_old = arena_dss_prec_get(arena);
+	}
+
+	dss = dss_prec_names[dss_prec_old];
+	READ(dss, const char *);
+
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static int
+arena_i_decay_ms_ctl_impl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen, bool dirty) {
+	int ret;
+	unsigned arena_ind;
+	arena_t *arena;
+
+	MIB_UNSIGNED(arena_ind, 1);
+	arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
+	if (arena == NULL) {
+		ret = EFAULT;
+		goto label_return;
+	}
+
+	if (oldp != NULL && oldlenp != NULL) {
+		size_t oldval = dirty ? arena_dirty_decay_ms_get(arena) :
+		    arena_muzzy_decay_ms_get(arena);
+		READ(oldval, ssize_t);
+	}
+	if (newp != NULL) {
+		if (newlen != sizeof(ssize_t)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		if (dirty ? arena_dirty_decay_ms_set(tsd_tsdn(tsd), arena,
+		    *(ssize_t *)newp) : arena_muzzy_decay_ms_set(tsd_tsdn(tsd),
+		    arena, *(ssize_t *)newp)) {
+			ret = EFAULT;
+			goto label_return;
+		}
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+arena_i_dirty_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	return arena_i_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
+	    newlen, true);
+}
+
+static int
+arena_i_muzzy_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	return arena_i_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
+	    newlen, false);
+}
+
+static int
+arena_i_extent_hooks_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+	arena_t *arena;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	MIB_UNSIGNED(arena_ind, 1);
+	if (arena_ind < narenas_total_get()) {
+		extent_hooks_t *old_extent_hooks;
+		arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
+		if (arena == NULL) {
+			if (arena_ind >= narenas_auto) {
+				ret = EFAULT;
+				goto label_return;
+			}
+			old_extent_hooks =
+			    (extent_hooks_t *)&extent_hooks_default;
+			READ(old_extent_hooks, extent_hooks_t *);
+			if (newp != NULL) {
+				/* Initialize a new arena as a side effect. */
+				extent_hooks_t *new_extent_hooks
+				    JEMALLOC_CC_SILENCE_INIT(NULL);
+				WRITE(new_extent_hooks, extent_hooks_t *);
+				arena = arena_init(tsd_tsdn(tsd), arena_ind,
+				    new_extent_hooks);
+				if (arena == NULL) {
+					ret = EFAULT;
+					goto label_return;
+				}
+			}
+		} else {
+			if (newp != NULL) {
+				extent_hooks_t *new_extent_hooks
+				    JEMALLOC_CC_SILENCE_INIT(NULL);
+				WRITE(new_extent_hooks, extent_hooks_t *);
+				old_extent_hooks = extent_hooks_set(tsd, arena,
+				    new_extent_hooks);
+				READ(old_extent_hooks, extent_hooks_t *);
+			} else {
+				old_extent_hooks = extent_hooks_get(arena);
+				READ(old_extent_hooks, extent_hooks_t *);
+			}
+		}
+	} else {
+		ret = EFAULT;
+		goto label_return;
+	}
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static int
+arena_i_retain_grow_limit_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+	arena_t *arena;
+
+	if (!opt_retain) {
+		/* Only relevant when retain is enabled. */
+		return ENOENT;
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	MIB_UNSIGNED(arena_ind, 1);
+	if (arena_ind < narenas_total_get() && (arena =
+	    arena_get(tsd_tsdn(tsd), arena_ind, false)) != NULL) {
+		size_t old_limit, new_limit;
+		if (newp != NULL) {
+			WRITE(new_limit, size_t);
+		}
+		bool err = arena_retain_grow_limit_get_set(tsd, arena,
+		    &old_limit, newp != NULL ? &new_limit : NULL);
+		if (!err) {
+			READ(old_limit, size_t);
+			ret = 0;
+		} else {
+			ret = EFAULT;
+		}
+	} else {
+		ret = EFAULT;
+	}
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static const ctl_named_node_t *
+arena_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
+	const ctl_named_node_t *ret;
+
+	malloc_mutex_lock(tsdn, &ctl_mtx);
+	switch (i) {
+	case MALLCTL_ARENAS_ALL:
+	case MALLCTL_ARENAS_DESTROYED:
+		break;
+	default:
+		if (i > ctl_arenas->narenas) {
+			ret = NULL;
+			goto label_return;
+		}
+		break;
+	}
+
+	ret = super_arena_i_node;
+label_return:
+	malloc_mutex_unlock(tsdn, &ctl_mtx);
+	return ret;
+}
+
+/******************************************************************************/
+
+static int
+arenas_narenas_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned narenas;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	READONLY();
+	if (*oldlenp != sizeof(unsigned)) {
+		ret = EINVAL;
+		goto label_return;
+	}
+	narenas = ctl_arenas->narenas;
+	READ(narenas, unsigned);
+
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static int
+arenas_decay_ms_ctl_impl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen, bool dirty) {
+	int ret;
+
+	if (oldp != NULL && oldlenp != NULL) {
+		size_t oldval = (dirty ? arena_dirty_decay_ms_default_get() :
+		    arena_muzzy_decay_ms_default_get());
+		READ(oldval, ssize_t);
+	}
+	if (newp != NULL) {
+		if (newlen != sizeof(ssize_t)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		if (dirty ? arena_dirty_decay_ms_default_set(*(ssize_t *)newp)
+		    : arena_muzzy_decay_ms_default_set(*(ssize_t *)newp)) {
+			ret = EFAULT;
+			goto label_return;
+		}
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+arenas_dirty_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	return arenas_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
+	    newlen, true);
+}
+
+static int
+arenas_muzzy_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	return arenas_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
+	    newlen, false);
+}
+
+CTL_RO_NL_GEN(arenas_quantum, QUANTUM, size_t)
+CTL_RO_NL_GEN(arenas_page, PAGE, size_t)
+CTL_RO_NL_GEN(arenas_tcache_max, tcache_maxclass, size_t)
+CTL_RO_NL_GEN(arenas_nbins, NBINS, unsigned)
+CTL_RO_NL_GEN(arenas_nhbins, nhbins, unsigned)
+CTL_RO_NL_GEN(arenas_bin_i_size, bin_infos[mib[2]].reg_size, size_t)
+CTL_RO_NL_GEN(arenas_bin_i_nregs, bin_infos[mib[2]].nregs, uint32_t)
+CTL_RO_NL_GEN(arenas_bin_i_slab_size, bin_infos[mib[2]].slab_size, size_t)
+static const ctl_named_node_t *
+arenas_bin_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
+	if (i > NBINS) {
+		return NULL;
+	}
+	return super_arenas_bin_i_node;
+}
+
+CTL_RO_NL_GEN(arenas_nlextents, NSIZES - NBINS, unsigned)
+CTL_RO_NL_GEN(arenas_lextent_i_size, sz_index2size(NBINS+(szind_t)mib[2]),
+    size_t)
+static const ctl_named_node_t *
+arenas_lextent_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
+    size_t i) {
+	if (i > NSIZES - NBINS) {
+		return NULL;
+	}
+	return super_arenas_lextent_i_node;
+}
+
+static int
+arenas_create_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	extent_hooks_t *extent_hooks;
+	unsigned arena_ind;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+
+	extent_hooks = (extent_hooks_t *)&extent_hooks_default;
+	WRITE(extent_hooks, extent_hooks_t *);
+	if ((arena_ind = ctl_arena_init(tsd, extent_hooks)) == UINT_MAX) {
+		ret = EAGAIN;
+		goto label_return;
+	}
+	READ(arena_ind, unsigned);
+
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+static int
+arenas_lookup_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	unsigned arena_ind;
+	void *ptr;
+	extent_t *extent;
+	arena_t *arena;
+
+	ptr = NULL;
+	ret = EINVAL;
+	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
+	WRITE(ptr, void *);
+	extent = iealloc(tsd_tsdn(tsd), ptr);
+	if (extent == NULL)
+		goto label_return;
+
+	arena = extent_arena_get(extent);
+	if (arena == NULL)
+		goto label_return;
+
+	arena_ind = arena_ind_get(arena);
+	READ(arena_ind, unsigned);
+
+	ret = 0;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
+	return ret;
+}
+
+/******************************************************************************/
+
+static int
+prof_thread_active_init_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	if (newp != NULL) {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		oldval = prof_thread_active_init_set(tsd_tsdn(tsd),
+		    *(bool *)newp);
+	} else {
+		oldval = prof_thread_active_init_get(tsd_tsdn(tsd));
+	}
+	READ(oldval, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+prof_active_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	if (newp != NULL) {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		oldval = prof_active_set(tsd_tsdn(tsd), *(bool *)newp);
+	} else {
+		oldval = prof_active_get(tsd_tsdn(tsd));
+	}
+	READ(oldval, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+prof_dump_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	const char *filename = NULL;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	WRITEONLY();
+	WRITE(filename, const char *);
+
+	if (prof_mdump(tsd, filename)) {
+		ret = EFAULT;
+		goto label_return;
+	}
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+prof_gdump_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	bool oldval;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	if (newp != NULL) {
+		if (newlen != sizeof(bool)) {
+			ret = EINVAL;
+			goto label_return;
+		}
+		oldval = prof_gdump_set(tsd_tsdn(tsd), *(bool *)newp);
+	} else {
+		oldval = prof_gdump_get(tsd_tsdn(tsd));
+	}
+	READ(oldval, bool);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+static int
+prof_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
+    size_t *oldlenp, void *newp, size_t newlen) {
+	int ret;
+	size_t lg_sample = lg_prof_sample;
+
+	if (!config_prof) {
+		return ENOENT;
+	}
+
+	WRITEONLY();
+	WRITE(lg_sample, size_t);
+	if (lg_sample >= (sizeof(uint64_t) << 3)) {
+		lg_sample = (sizeof(uint64_t) << 3) - 1;
+	}
+
+	prof_reset(tsd, lg_sample);
+
+	ret = 0;
+label_return:
+	return ret;
+}
+
+CTL_RO_NL_CGEN(config_prof, prof_interval, prof_interval, uint64_t)
+CTL_RO_NL_CGEN(config_prof, lg_prof_sample, lg_prof_sample, size_t)
+
+/******************************************************************************/
+
+CTL_RO_CGEN(config_stats, stats_allocated, ctl_stats->allocated, size_t)
+CTL_RO_CGEN(config_stats, stats_active, ctl_stats->active, size_t)
+CTL_RO_CGEN(config_stats, stats_metadata, ctl_stats->metadata, size_t)
+CTL_RO_CGEN(config_stats, stats_metadata_thp, ctl_stats->metadata_thp, size_t)
+CTL_RO_CGEN(config_stats, stats_resident, ctl_stats->resident, size_t)
+CTL_RO_CGEN(config_stats, stats_mapped, ctl_stats->mapped, size_t)
+CTL_RO_CGEN(config_stats, stats_retained, ctl_stats->retained, size_t)
+
+CTL_RO_CGEN(config_stats, stats_background_thread_num_threads,
+    ctl_stats->background_thread.num_threads, size_t)
+CTL_RO_CGEN(config_stats, stats_background_thread_num_runs,
+    ctl_stats->background_thread.num_runs, uint64_t)
+CTL_RO_CGEN(config_stats, stats_background_thread_run_interval,
+    nstime_ns(&ctl_stats->background_thread.run_interval), uint64_t)
+
+CTL_RO_GEN(stats_arenas_i_dss, arenas_i(mib[2])->dss, const char *)
+CTL_RO_GEN(stats_arenas_i_dirty_decay_ms, arenas_i(mib[2])->dirty_decay_ms,
+    ssize_t)
+CTL_RO_GEN(stats_arenas_i_muzzy_decay_ms, arenas_i(mib[2])->muzzy_decay_ms,
+    ssize_t)
+CTL_RO_GEN(stats_arenas_i_nthreads, arenas_i(mib[2])->nthreads, unsigned)
+CTL_RO_GEN(stats_arenas_i_uptime,
+    nstime_ns(&arenas_i(mib[2])->astats->astats.uptime), uint64_t)
+CTL_RO_GEN(stats_arenas_i_pactive, arenas_i(mib[2])->pactive, size_t)
+CTL_RO_GEN(stats_arenas_i_pdirty, arenas_i(mib[2])->pdirty, size_t)
+CTL_RO_GEN(stats_arenas_i_pmuzzy, arenas_i(mib[2])->pmuzzy, size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_mapped,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.mapped, ATOMIC_RELAXED),
+    size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_retained,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.retained, ATOMIC_RELAXED),
+    size_t)
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_npurge,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_dirty.npurge), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_nmadvise,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_dirty.nmadvise), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_purged,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_dirty.purged), uint64_t)
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_npurge,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_muzzy.npurge), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_nmadvise,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_muzzy.nmadvise), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_purged,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.decay_muzzy.purged), uint64_t)
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_base,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.base, ATOMIC_RELAXED),
+    size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_internal,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.internal, ATOMIC_RELAXED),
+    size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_metadata_thp,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.metadata_thp,
+    ATOMIC_RELAXED), size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_tcache_bytes,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.tcache_bytes,
+    ATOMIC_RELAXED), size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_resident,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.resident, ATOMIC_RELAXED),
+    size_t)
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_small_allocated,
+    arenas_i(mib[2])->astats->allocated_small, size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_small_nmalloc,
+    arenas_i(mib[2])->astats->nmalloc_small, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_small_ndalloc,
+    arenas_i(mib[2])->astats->ndalloc_small, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_small_nrequests,
+    arenas_i(mib[2])->astats->nrequests_small, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_large_allocated,
+    atomic_load_zu(&arenas_i(mib[2])->astats->astats.allocated_large,
+    ATOMIC_RELAXED), size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_large_nmalloc,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.nmalloc_large), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_large_ndalloc,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.ndalloc_large), uint64_t)
+/*
+ * Note: "nmalloc" here instead of "nrequests" in the read.  This is intentional.
+ */
+CTL_RO_CGEN(config_stats, stats_arenas_i_large_nrequests,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->astats.nmalloc_large), uint64_t) /* Intentional. */
+
+/* Lock profiling related APIs below. */
+#define RO_MUTEX_CTL_GEN(n, l)						\
+CTL_RO_CGEN(config_stats, stats_##n##_num_ops,				\
+    l.n_lock_ops, uint64_t)						\
+CTL_RO_CGEN(config_stats, stats_##n##_num_wait,				\
+    l.n_wait_times, uint64_t)						\
+CTL_RO_CGEN(config_stats, stats_##n##_num_spin_acq,			\
+    l.n_spin_acquired, uint64_t)					\
+CTL_RO_CGEN(config_stats, stats_##n##_num_owner_switch,			\
+    l.n_owner_switches, uint64_t) 					\
+CTL_RO_CGEN(config_stats, stats_##n##_total_wait_time,			\
+    nstime_ns(&l.tot_wait_time), uint64_t)				\
+CTL_RO_CGEN(config_stats, stats_##n##_max_wait_time,			\
+    nstime_ns(&l.max_wait_time), uint64_t)				\
+CTL_RO_CGEN(config_stats, stats_##n##_max_num_thds,			\
+    l.max_n_thds, uint32_t)
+
+/* Global mutexes. */
+#define OP(mtx)								\
+    RO_MUTEX_CTL_GEN(mutexes_##mtx,					\
+        ctl_stats->mutex_prof_data[global_prof_mutex_##mtx])
+MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+
+/* Per arena mutexes */
+#define OP(mtx) RO_MUTEX_CTL_GEN(arenas_i_mutexes_##mtx,		\
+    arenas_i(mib[2])->astats->astats.mutex_prof_data[arena_prof_mutex_##mtx])
+MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+
+/* tcache bin mutex */
+RO_MUTEX_CTL_GEN(arenas_i_bins_j_mutex,
+    arenas_i(mib[2])->astats->bstats[mib[4]].mutex_data)
+#undef RO_MUTEX_CTL_GEN
+
+/* Resets all mutex stats, including global, arena and bin mutexes. */
+static int
+stats_mutexes_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
+    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
+	if (!config_stats) {
+		return ENOENT;
+	}
+
+	tsdn_t *tsdn = tsd_tsdn(tsd);
+
+#define MUTEX_PROF_RESET(mtx)						\
+    malloc_mutex_lock(tsdn, &mtx);					\
+    malloc_mutex_prof_data_reset(tsdn, &mtx);				\
+    malloc_mutex_unlock(tsdn, &mtx);
+
+	/* Global mutexes: ctl and prof. */
+	MUTEX_PROF_RESET(ctl_mtx);
+	if (have_background_thread) {
+		MUTEX_PROF_RESET(background_thread_lock);
+	}
+	if (config_prof && opt_prof) {
+		MUTEX_PROF_RESET(bt2gctx_mtx);
+	}
+
+
+	/* Per arena mutexes. */
+	unsigned n = narenas_total_get();
+
+	for (unsigned i = 0; i < n; i++) {
+		arena_t *arena = arena_get(tsdn, i, false);
+		if (!arena) {
+			continue;
+		}
+		MUTEX_PROF_RESET(arena->large_mtx);
+		MUTEX_PROF_RESET(arena->extent_avail_mtx);
+		MUTEX_PROF_RESET(arena->extents_dirty.mtx);
+		MUTEX_PROF_RESET(arena->extents_muzzy.mtx);
+		MUTEX_PROF_RESET(arena->extents_retained.mtx);
+		MUTEX_PROF_RESET(arena->decay_dirty.mtx);
+		MUTEX_PROF_RESET(arena->decay_muzzy.mtx);
+		MUTEX_PROF_RESET(arena->tcache_ql_mtx);
+		MUTEX_PROF_RESET(arena->base->mtx);
+
+		for (szind_t i = 0; i < NBINS; i++) {
+			bin_t *bin = &arena->bins[i];
+			MUTEX_PROF_RESET(bin->lock);
+		}
+	}
+#undef MUTEX_PROF_RESET
+	return 0;
+}
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nmalloc,
+    arenas_i(mib[2])->astats->bstats[mib[4]].nmalloc, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_ndalloc,
+    arenas_i(mib[2])->astats->bstats[mib[4]].ndalloc, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nrequests,
+    arenas_i(mib[2])->astats->bstats[mib[4]].nrequests, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_curregs,
+    arenas_i(mib[2])->astats->bstats[mib[4]].curregs, size_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nfills,
+    arenas_i(mib[2])->astats->bstats[mib[4]].nfills, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nflushes,
+    arenas_i(mib[2])->astats->bstats[mib[4]].nflushes, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nslabs,
+    arenas_i(mib[2])->astats->bstats[mib[4]].nslabs, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nreslabs,
+    arenas_i(mib[2])->astats->bstats[mib[4]].reslabs, uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_curslabs,
+    arenas_i(mib[2])->astats->bstats[mib[4]].curslabs, size_t)
+
+static const ctl_named_node_t *
+stats_arenas_i_bins_j_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
+    size_t j) {
+	if (j > NBINS) {
+		return NULL;
+	}
+	return super_stats_arenas_i_bins_j_node;
+}
+
+CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_nmalloc,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->lstats[mib[4]].nmalloc), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_ndalloc,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->lstats[mib[4]].ndalloc), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_nrequests,
+    ctl_arena_stats_read_u64(
+    &arenas_i(mib[2])->astats->lstats[mib[4]].nrequests), uint64_t)
+CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_curlextents,
+    arenas_i(mib[2])->astats->lstats[mib[4]].curlextents, size_t)
+
+static const ctl_named_node_t *
+stats_arenas_i_lextents_j_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
+    size_t j) {
+	if (j > NSIZES - NBINS) {
+		return NULL;
+	}
+	return super_stats_arenas_i_lextents_j_node;
+}
+
+static const ctl_named_node_t *
+stats_arenas_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
+	const ctl_named_node_t *ret;
+	size_t a;
+
+	malloc_mutex_lock(tsdn, &ctl_mtx);
+	a = arenas_i2a_impl(i, true, true);
+	if (a == UINT_MAX || !ctl_arenas->arenas[a]->initialized) {
+		ret = NULL;
+		goto label_return;
+	}
+
+	ret = super_stats_arenas_i_node;
+label_return:
+	malloc_mutex_unlock(tsdn, &ctl_mtx);
+	return ret;
+}
diff --git a/redis-stable/deps/jemalloc/src/div.c b/redis-stable/deps/jemalloc/src/div.c
new file mode 100644
index 00000000..808892a1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/div.c
@@ -0,0 +1,55 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+
+#include "jemalloc/internal/div.h"
+
+#include "jemalloc/internal/assert.h"
+
+/*
+ * Suppose we have n = q * d, all integers. We know n and d, and want q = n / d.
+ *
+ * For any k, we have (here, all division is exact; not C-style rounding):
+ * floor(ceil(2^k / d) * n / 2^k) = floor((2^k + r) / d * n / 2^k), where
+ * r = (-2^k) mod d.
+ *
+ * Expanding this out:
+ * ... = floor(2^k / d * n / 2^k + r / d * n / 2^k)
+ *     = floor(n / d + (r / d) * (n / 2^k)).
+ *
+ * The fractional part of n / d is 0 (because of the assumption that d divides n
+ * exactly), so we have:
+ * ... = n / d + floor((r / d) * (n / 2^k))
+ *
+ * So that our initial expression is equal to the quantity we seek, so long as
+ * (r / d) * (n / 2^k) < 1.
+ *
+ * r is a remainder mod d, so r < d and r / d < 1 always. We can make
+ * n / 2 ^ k < 1 by setting k = 32. This gets us a value of magic that works.
+ */
+
+void
+div_init(div_info_t *div_info, size_t d) {
+	/* Nonsensical. */
+	assert(d != 0);
+	/*
+	 * This would make the value of magic too high to fit into a uint32_t
+	 * (we would want magic = 2^32 exactly). This would mess with code gen
+	 * on 32-bit machines.
+	 */
+	assert(d != 1);
+
+	uint64_t two_to_k = ((uint64_t)1 << 32);
+	uint32_t magic = (uint32_t)(two_to_k / d);
+
+	/*
+	 * We want magic = ceil(2^k / d), but C gives us floor. We have to
+	 * increment it unless the result was exact (i.e. unless d is a power of
+	 * two).
+	 */
+	if (two_to_k % d != 0) {
+		magic++;
+	}
+	div_info->magic = magic;
+#ifdef JEMALLOC_DEBUG
+	div_info->d = d;
+#endif
+}
diff --git a/redis-stable/deps/jemalloc/src/extent.c b/redis-stable/deps/jemalloc/src/extent.c
new file mode 100644
index 00000000..09d6d771
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/extent.c
@@ -0,0 +1,2177 @@
+#define JEMALLOC_EXTENT_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/ph.h"
+#include "jemalloc/internal/rtree.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_pool.h"
+
+/******************************************************************************/
+/* Data. */
+
+rtree_t		extents_rtree;
+/* Keyed by the address of the extent_t being protected. */
+mutex_pool_t	extent_mutex_pool;
+
+size_t opt_lg_extent_max_active_fit = LG_EXTENT_MAX_ACTIVE_FIT_DEFAULT;
+
+static const bitmap_info_t extents_bitmap_info =
+    BITMAP_INFO_INITIALIZER(NPSIZES+1);
+
+static void *extent_alloc_default(extent_hooks_t *extent_hooks, void *new_addr,
+    size_t size, size_t alignment, bool *zero, bool *commit,
+    unsigned arena_ind);
+static bool extent_dalloc_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, bool committed, unsigned arena_ind);
+static void extent_destroy_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, bool committed, unsigned arena_ind);
+static bool extent_commit_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind);
+static bool extent_commit_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained);
+static bool extent_decommit_default(extent_hooks_t *extent_hooks,
+    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
+#ifdef PAGES_CAN_PURGE_LAZY
+static bool extent_purge_lazy_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind);
+#endif
+static bool extent_purge_lazy_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained);
+#ifdef PAGES_CAN_PURGE_FORCED
+static bool extent_purge_forced_default(extent_hooks_t *extent_hooks,
+    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
+#endif
+static bool extent_purge_forced_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained);
+#ifdef JEMALLOC_MAPS_COALESCE
+static bool extent_split_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t size_a, size_t size_b, bool committed,
+    unsigned arena_ind);
+#endif
+static extent_t *extent_split_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
+    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b,
+    bool growing_retained);
+#ifdef JEMALLOC_MAPS_COALESCE
+static bool extent_merge_default(extent_hooks_t *extent_hooks, void *addr_a,
+    size_t size_a, void *addr_b, size_t size_b, bool committed,
+    unsigned arena_ind);
+#endif
+static bool extent_merge_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b,
+    bool growing_retained);
+
+const extent_hooks_t	extent_hooks_default = {
+	extent_alloc_default,
+	extent_dalloc_default,
+	extent_destroy_default,
+	extent_commit_default,
+	extent_decommit_default
+#ifdef PAGES_CAN_PURGE_LAZY
+	,
+	extent_purge_lazy_default
+#else
+	,
+	NULL
+#endif
+#ifdef PAGES_CAN_PURGE_FORCED
+	,
+	extent_purge_forced_default
+#else
+	,
+	NULL
+#endif
+#ifdef JEMALLOC_MAPS_COALESCE
+	,
+	extent_split_default,
+	extent_merge_default
+#endif
+};
+
+/* Used exclusively for gdump triggering. */
+static atomic_zu_t curpages;
+static atomic_zu_t highpages;
+
+/******************************************************************************/
+/*
+ * Function prototypes for static functions that are referenced prior to
+ * definition.
+ */
+
+static void extent_deregister(tsdn_t *tsdn, extent_t *extent);
+static extent_t *extent_recycle(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, void *new_addr,
+    size_t usize, size_t pad, size_t alignment, bool slab, szind_t szind,
+    bool *zero, bool *commit, bool growing_retained);
+static extent_t *extent_try_coalesce(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
+    extent_t *extent, bool *coalesced, bool growing_retained);
+static void extent_record(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extents_t *extents, extent_t *extent,
+    bool growing_retained);
+
+/******************************************************************************/
+
+ph_gen(UNUSED, extent_avail_, extent_tree_t, extent_t, ph_link,
+    extent_esnead_comp)
+
+typedef enum {
+	lock_result_success,
+	lock_result_failure,
+	lock_result_no_extent
+} lock_result_t;
+
+static lock_result_t
+extent_rtree_leaf_elm_try_lock(tsdn_t *tsdn, rtree_leaf_elm_t *elm,
+    extent_t **result) {
+	extent_t *extent1 = rtree_leaf_elm_extent_read(tsdn, &extents_rtree,
+	    elm, true);
+
+	if (extent1 == NULL) {
+		return lock_result_no_extent;
+	}
+	/*
+	 * It's possible that the extent changed out from under us, and with it
+	 * the leaf->extent mapping.  We have to recheck while holding the lock.
+	 */
+	extent_lock(tsdn, extent1);
+	extent_t *extent2 = rtree_leaf_elm_extent_read(tsdn,
+	    &extents_rtree, elm, true);
+
+	if (extent1 == extent2) {
+		*result = extent1;
+		return lock_result_success;
+	} else {
+		extent_unlock(tsdn, extent1);
+		return lock_result_failure;
+	}
+}
+
+/*
+ * Returns a pool-locked extent_t * if there's one associated with the given
+ * address, and NULL otherwise.
+ */
+static extent_t *
+extent_lock_from_addr(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx, void *addr) {
+	extent_t *ret = NULL;
+	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &extents_rtree,
+	    rtree_ctx, (uintptr_t)addr, false, false);
+	if (elm == NULL) {
+		return NULL;
+	}
+	lock_result_t lock_result;
+	do {
+		lock_result = extent_rtree_leaf_elm_try_lock(tsdn, elm, &ret);
+	} while (lock_result == lock_result_failure);
+	return ret;
+}
+
+extent_t *
+extent_alloc(tsdn_t *tsdn, arena_t *arena) {
+	malloc_mutex_lock(tsdn, &arena->extent_avail_mtx);
+	extent_t *extent = extent_avail_first(&arena->extent_avail);
+	if (extent == NULL) {
+		malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
+		return base_alloc_extent(tsdn, arena->base);
+	}
+	extent_avail_remove(&arena->extent_avail, extent);
+	malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
+	return extent;
+}
+
+void
+extent_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
+	malloc_mutex_lock(tsdn, &arena->extent_avail_mtx);
+	extent_avail_insert(&arena->extent_avail, extent);
+	malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
+}
+
+extent_hooks_t *
+extent_hooks_get(arena_t *arena) {
+	return base_extent_hooks_get(arena->base);
+}
+
+extent_hooks_t *
+extent_hooks_set(tsd_t *tsd, arena_t *arena, extent_hooks_t *extent_hooks) {
+	background_thread_info_t *info;
+	if (have_background_thread) {
+		info = arena_background_thread_info_get(arena);
+		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+	}
+	extent_hooks_t *ret = base_extent_hooks_set(arena->base, extent_hooks);
+	if (have_background_thread) {
+		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+	}
+
+	return ret;
+}
+
+static void
+extent_hooks_assure_initialized(arena_t *arena,
+    extent_hooks_t **r_extent_hooks) {
+	if (*r_extent_hooks == EXTENT_HOOKS_INITIALIZER) {
+		*r_extent_hooks = extent_hooks_get(arena);
+	}
+}
+
+#ifndef JEMALLOC_JET
+static
+#endif
+size_t
+extent_size_quantize_floor(size_t size) {
+	size_t ret;
+	pszind_t pind;
+
+	assert(size > 0);
+	assert((size & PAGE_MASK) == 0);
+
+	pind = sz_psz2ind(size - sz_large_pad + 1);
+	if (pind == 0) {
+		/*
+		 * Avoid underflow.  This short-circuit would also do the right
+		 * thing for all sizes in the range for which there are
+		 * PAGE-spaced size classes, but it's simplest to just handle
+		 * the one case that would cause erroneous results.
+		 */
+		return size;
+	}
+	ret = sz_pind2sz(pind - 1) + sz_large_pad;
+	assert(ret <= size);
+	return ret;
+}
+
+#ifndef JEMALLOC_JET
+static
+#endif
+size_t
+extent_size_quantize_ceil(size_t size) {
+	size_t ret;
+
+	assert(size > 0);
+	assert(size - sz_large_pad <= LARGE_MAXCLASS);
+	assert((size & PAGE_MASK) == 0);
+
+	ret = extent_size_quantize_floor(size);
+	if (ret < size) {
+		/*
+		 * Skip a quantization that may have an adequately large extent,
+		 * because under-sized extents may be mixed in.  This only
+		 * happens when an unusual size is requested, i.e. for aligned
+		 * allocation, and is just one of several places where linear
+		 * search would potentially find sufficiently aligned available
+		 * memory somewhere lower.
+		 */
+		ret = sz_pind2sz(sz_psz2ind(ret - sz_large_pad + 1)) +
+		    sz_large_pad;
+	}
+	return ret;
+}
+
+/* Generate pairing heap functions. */
+ph_gen(, extent_heap_, extent_heap_t, extent_t, ph_link, extent_snad_comp)
+
+bool
+extents_init(tsdn_t *tsdn, extents_t *extents, extent_state_t state,
+    bool delay_coalesce) {
+	if (malloc_mutex_init(&extents->mtx, "extents", WITNESS_RANK_EXTENTS,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+	for (unsigned i = 0; i < NPSIZES+1; i++) {
+		extent_heap_new(&extents->heaps[i]);
+	}
+	bitmap_init(extents->bitmap, &extents_bitmap_info, true);
+	extent_list_init(&extents->lru);
+	atomic_store_zu(&extents->npages, 0, ATOMIC_RELAXED);
+	extents->state = state;
+	extents->delay_coalesce = delay_coalesce;
+	return false;
+}
+
+extent_state_t
+extents_state_get(const extents_t *extents) {
+	return extents->state;
+}
+
+size_t
+extents_npages_get(extents_t *extents) {
+	return atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
+}
+
+static void
+extents_insert_locked(tsdn_t *tsdn, extents_t *extents, extent_t *extent) {
+	malloc_mutex_assert_owner(tsdn, &extents->mtx);
+	assert(extent_state_get(extent) == extents->state);
+
+	size_t size = extent_size_get(extent);
+	size_t psz = extent_size_quantize_floor(size);
+	pszind_t pind = sz_psz2ind(psz);
+	if (extent_heap_empty(&extents->heaps[pind])) {
+		bitmap_unset(extents->bitmap, &extents_bitmap_info,
+		    (size_t)pind);
+	}
+	extent_heap_insert(&extents->heaps[pind], extent);
+	extent_list_append(&extents->lru, extent);
+	size_t npages = size >> LG_PAGE;
+	/*
+	 * All modifications to npages hold the mutex (as asserted above), so we
+	 * don't need an atomic fetch-add; we can get by with a load followed by
+	 * a store.
+	 */
+	size_t cur_extents_npages =
+	    atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
+	atomic_store_zu(&extents->npages, cur_extents_npages + npages,
+	    ATOMIC_RELAXED);
+}
+
+static void
+extents_remove_locked(tsdn_t *tsdn, extents_t *extents, extent_t *extent) {
+	malloc_mutex_assert_owner(tsdn, &extents->mtx);
+	assert(extent_state_get(extent) == extents->state);
+
+	size_t size = extent_size_get(extent);
+	size_t psz = extent_size_quantize_floor(size);
+	pszind_t pind = sz_psz2ind(psz);
+	extent_heap_remove(&extents->heaps[pind], extent);
+	if (extent_heap_empty(&extents->heaps[pind])) {
+		bitmap_set(extents->bitmap, &extents_bitmap_info,
+		    (size_t)pind);
+	}
+	extent_list_remove(&extents->lru, extent);
+	size_t npages = size >> LG_PAGE;
+	/*
+	 * As in extents_insert_locked, we hold extents->mtx and so don't need
+	 * atomic operations for updating extents->npages.
+	 */
+	size_t cur_extents_npages =
+	    atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
+	assert(cur_extents_npages >= npages);
+	atomic_store_zu(&extents->npages,
+	    cur_extents_npages - (size >> LG_PAGE), ATOMIC_RELAXED);
+}
+
+/*
+ * Find an extent with size [min_size, max_size) to satisfy the alignment
+ * requirement.  For each size, try only the first extent in the heap.
+ */
+static extent_t *
+extents_fit_alignment(extents_t *extents, size_t min_size, size_t max_size,
+    size_t alignment) {
+        pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(min_size));
+        pszind_t pind_max = sz_psz2ind(extent_size_quantize_ceil(max_size));
+
+	for (pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap,
+	    &extents_bitmap_info, (size_t)pind); i < pind_max; i =
+	    (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
+	    (size_t)i+1)) {
+		assert(i < NPSIZES);
+		assert(!extent_heap_empty(&extents->heaps[i]));
+		extent_t *extent = extent_heap_first(&extents->heaps[i]);
+		uintptr_t base = (uintptr_t)extent_base_get(extent);
+		size_t candidate_size = extent_size_get(extent);
+		assert(candidate_size >= min_size);
+
+		uintptr_t next_align = ALIGNMENT_CEILING((uintptr_t)base,
+		    PAGE_CEILING(alignment));
+		if (base > next_align || base + candidate_size <= next_align) {
+			/* Overflow or not crossing the next alignment. */
+			continue;
+		}
+
+		size_t leadsize = next_align - base;
+		if (candidate_size - leadsize >= min_size) {
+			return extent;
+		}
+	}
+
+	return NULL;
+}
+
+/* Do any-best-fit extent selection, i.e. select any extent that best fits. */
+static extent_t *
+extents_best_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    size_t size) {
+	pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(size));
+	pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
+	    (size_t)pind);
+	if (i < NPSIZES+1) {
+		/*
+		 * In order to reduce fragmentation, avoid reusing and splitting
+		 * large extents for much smaller sizes.
+		 */
+		if ((sz_pind2sz(i) >> opt_lg_extent_max_active_fit) > size) {
+			return NULL;
+		}
+		assert(!extent_heap_empty(&extents->heaps[i]));
+		extent_t *extent = extent_heap_first(&extents->heaps[i]);
+		assert(extent_size_get(extent) >= size);
+		return extent;
+	}
+
+	return NULL;
+}
+
+/*
+ * Do first-fit extent selection, i.e. select the oldest/lowest extent that is
+ * large enough.
+ */
+static extent_t *
+extents_first_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    size_t size) {
+	extent_t *ret = NULL;
+
+	pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(size));
+	for (pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap,
+	    &extents_bitmap_info, (size_t)pind); i < NPSIZES+1; i =
+	    (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
+	    (size_t)i+1)) {
+		assert(!extent_heap_empty(&extents->heaps[i]));
+		extent_t *extent = extent_heap_first(&extents->heaps[i]);
+		assert(extent_size_get(extent) >= size);
+		if (ret == NULL || extent_snad_comp(extent, ret) < 0) {
+			ret = extent;
+		}
+		if (i == NPSIZES) {
+			break;
+		}
+		assert(i < NPSIZES);
+	}
+
+	return ret;
+}
+
+/*
+ * Do {best,first}-fit extent selection, where the selection policy choice is
+ * based on extents->delay_coalesce.  Best-fit selection requires less
+ * searching, but its layout policy is less stable and may cause higher virtual
+ * memory fragmentation as a side effect.
+ */
+static extent_t *
+extents_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    size_t esize, size_t alignment) {
+	malloc_mutex_assert_owner(tsdn, &extents->mtx);
+
+	size_t max_size = esize + PAGE_CEILING(alignment) - PAGE;
+	/* Beware size_t wrap-around. */
+	if (max_size < esize) {
+		return NULL;
+	}
+
+	extent_t *extent = extents->delay_coalesce ?
+	    extents_best_fit_locked(tsdn, arena, extents, max_size) :
+	    extents_first_fit_locked(tsdn, arena, extents, max_size);
+
+	if (alignment > PAGE && extent == NULL) {
+		/*
+		 * max_size guarantees the alignment requirement but is rather
+		 * pessimistic.  Next we try to satisfy the aligned allocation
+		 * with sizes in [esize, max_size).
+		 */
+		extent = extents_fit_alignment(extents, esize, max_size,
+		    alignment);
+	}
+
+	return extent;
+}
+
+static bool
+extent_try_delayed_coalesce(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
+    extent_t *extent) {
+	extent_state_set(extent, extent_state_active);
+	bool coalesced;
+	extent = extent_try_coalesce(tsdn, arena, r_extent_hooks, rtree_ctx,
+	    extents, extent, &coalesced, false);
+	extent_state_set(extent, extents_state_get(extents));
+
+	if (!coalesced) {
+		return true;
+	}
+	extents_insert_locked(tsdn, extents, extent);
+	return false;
+}
+
+extent_t *
+extents_alloc(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
+	assert(size + pad != 0);
+	assert(alignment != 0);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_t *extent = extent_recycle(tsdn, arena, r_extent_hooks, extents,
+	    new_addr, size, pad, alignment, slab, szind, zero, commit, false);
+	assert(extent == NULL || extent_dumpable_get(extent));
+	return extent;
+}
+
+void
+extents_dalloc(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, extent_t *extent) {
+	assert(extent_base_get(extent) != NULL);
+	assert(extent_size_get(extent) != 0);
+	assert(extent_dumpable_get(extent));
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_addr_set(extent, extent_base_get(extent));
+	extent_zeroed_set(extent, false);
+
+	extent_record(tsdn, arena, r_extent_hooks, extents, extent, false);
+}
+
+extent_t *
+extents_evict(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, size_t npages_min) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	malloc_mutex_lock(tsdn, &extents->mtx);
+
+	/*
+	 * Get the LRU coalesced extent, if any.  If coalescing was delayed,
+	 * the loop will iterate until the LRU extent is fully coalesced.
+	 */
+	extent_t *extent;
+	while (true) {
+		/* Get the LRU extent, if any. */
+		extent = extent_list_first(&extents->lru);
+		if (extent == NULL) {
+			goto label_return;
+		}
+		/* Check the eviction limit. */
+		size_t extents_npages = atomic_load_zu(&extents->npages,
+		    ATOMIC_RELAXED);
+		if (extents_npages <= npages_min) {
+			extent = NULL;
+			goto label_return;
+		}
+		extents_remove_locked(tsdn, extents, extent);
+		if (!extents->delay_coalesce) {
+			break;
+		}
+		/* Try to coalesce. */
+		if (extent_try_delayed_coalesce(tsdn, arena, r_extent_hooks,
+		    rtree_ctx, extents, extent)) {
+			break;
+		}
+		/*
+		 * The LRU extent was just coalesced and the result placed in
+		 * the LRU at its neighbor's position.  Start over.
+		 */
+	}
+
+	/*
+	 * Either mark the extent active or deregister it to protect against
+	 * concurrent operations.
+	 */
+	switch (extents_state_get(extents)) {
+	case extent_state_active:
+		not_reached();
+	case extent_state_dirty:
+	case extent_state_muzzy:
+		extent_state_set(extent, extent_state_active);
+		break;
+	case extent_state_retained:
+		extent_deregister(tsdn, extent);
+		break;
+	default:
+		not_reached();
+	}
+
+label_return:
+	malloc_mutex_unlock(tsdn, &extents->mtx);
+	return extent;
+}
+
+static void
+extents_leak(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, extent_t *extent, bool growing_retained) {
+	/*
+	 * Leak extent after making sure its pages have already been purged, so
+	 * that this is only a virtual memory leak.
+	 */
+	if (extents_state_get(extents) == extent_state_dirty) {
+		if (extent_purge_lazy_impl(tsdn, arena, r_extent_hooks,
+		    extent, 0, extent_size_get(extent), growing_retained)) {
+			extent_purge_forced_impl(tsdn, arena, r_extent_hooks,
+			    extent, 0, extent_size_get(extent),
+			    growing_retained);
+		}
+	}
+	extent_dalloc(tsdn, arena, extent);
+}
+
+void
+extents_prefork(tsdn_t *tsdn, extents_t *extents) {
+	malloc_mutex_prefork(tsdn, &extents->mtx);
+}
+
+void
+extents_postfork_parent(tsdn_t *tsdn, extents_t *extents) {
+	malloc_mutex_postfork_parent(tsdn, &extents->mtx);
+}
+
+void
+extents_postfork_child(tsdn_t *tsdn, extents_t *extents) {
+	malloc_mutex_postfork_child(tsdn, &extents->mtx);
+}
+
+static void
+extent_deactivate_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    extent_t *extent) {
+	assert(extent_arena_get(extent) == arena);
+	assert(extent_state_get(extent) == extent_state_active);
+
+	extent_state_set(extent, extents_state_get(extents));
+	extents_insert_locked(tsdn, extents, extent);
+}
+
+static void
+extent_deactivate(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    extent_t *extent) {
+	malloc_mutex_lock(tsdn, &extents->mtx);
+	extent_deactivate_locked(tsdn, arena, extents, extent);
+	malloc_mutex_unlock(tsdn, &extents->mtx);
+}
+
+static void
+extent_activate_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
+    extent_t *extent) {
+	assert(extent_arena_get(extent) == arena);
+	assert(extent_state_get(extent) == extents_state_get(extents));
+
+	extents_remove_locked(tsdn, extents, extent);
+	extent_state_set(extent, extent_state_active);
+}
+
+static bool
+extent_rtree_leaf_elms_lookup(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx,
+    const extent_t *extent, bool dependent, bool init_missing,
+    rtree_leaf_elm_t **r_elm_a, rtree_leaf_elm_t **r_elm_b) {
+	*r_elm_a = rtree_leaf_elm_lookup(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)extent_base_get(extent), dependent, init_missing);
+	if (!dependent && *r_elm_a == NULL) {
+		return true;
+	}
+	assert(*r_elm_a != NULL);
+
+	*r_elm_b = rtree_leaf_elm_lookup(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)extent_last_get(extent), dependent, init_missing);
+	if (!dependent && *r_elm_b == NULL) {
+		return true;
+	}
+	assert(*r_elm_b != NULL);
+
+	return false;
+}
+
+static void
+extent_rtree_write_acquired(tsdn_t *tsdn, rtree_leaf_elm_t *elm_a,
+    rtree_leaf_elm_t *elm_b, extent_t *extent, szind_t szind, bool slab) {
+	rtree_leaf_elm_write(tsdn, &extents_rtree, elm_a, extent, szind, slab);
+	if (elm_b != NULL) {
+		rtree_leaf_elm_write(tsdn, &extents_rtree, elm_b, extent, szind,
+		    slab);
+	}
+}
+
+static void
+extent_interior_register(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx, extent_t *extent,
+    szind_t szind) {
+	assert(extent_slab_get(extent));
+
+	/* Register interior. */
+	for (size_t i = 1; i < (extent_size_get(extent) >> LG_PAGE) - 1; i++) {
+		rtree_write(tsdn, &extents_rtree, rtree_ctx,
+		    (uintptr_t)extent_base_get(extent) + (uintptr_t)(i <<
+		    LG_PAGE), extent, szind, true);
+	}
+}
+
+static void
+extent_gdump_add(tsdn_t *tsdn, const extent_t *extent) {
+	cassert(config_prof);
+	/* prof_gdump() requirement. */
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	if (opt_prof && extent_state_get(extent) == extent_state_active) {
+		size_t nadd = extent_size_get(extent) >> LG_PAGE;
+		size_t cur = atomic_fetch_add_zu(&curpages, nadd,
+		    ATOMIC_RELAXED) + nadd;
+		size_t high = atomic_load_zu(&highpages, ATOMIC_RELAXED);
+		while (cur > high && !atomic_compare_exchange_weak_zu(
+		    &highpages, &high, cur, ATOMIC_RELAXED, ATOMIC_RELAXED)) {
+			/*
+			 * Don't refresh cur, because it may have decreased
+			 * since this thread lost the highpages update race.
+			 * Note that high is updated in case of CAS failure.
+			 */
+		}
+		if (cur > high && prof_gdump_get_unlocked()) {
+			prof_gdump(tsdn);
+		}
+	}
+}
+
+static void
+extent_gdump_sub(tsdn_t *tsdn, const extent_t *extent) {
+	cassert(config_prof);
+
+	if (opt_prof && extent_state_get(extent) == extent_state_active) {
+		size_t nsub = extent_size_get(extent) >> LG_PAGE;
+		assert(atomic_load_zu(&curpages, ATOMIC_RELAXED) >= nsub);
+		atomic_fetch_sub_zu(&curpages, nsub, ATOMIC_RELAXED);
+	}
+}
+
+static bool
+extent_register_impl(tsdn_t *tsdn, extent_t *extent, bool gdump_add) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	rtree_leaf_elm_t *elm_a, *elm_b;
+
+	/*
+	 * We need to hold the lock to protect against a concurrent coalesce
+	 * operation that sees us in a partial state.
+	 */
+	extent_lock(tsdn, extent);
+
+	if (extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, extent, false, true,
+	    &elm_a, &elm_b)) {
+		return true;
+	}
+
+	szind_t szind = extent_szind_get_maybe_invalid(extent);
+	bool slab = extent_slab_get(extent);
+	extent_rtree_write_acquired(tsdn, elm_a, elm_b, extent, szind, slab);
+	if (slab) {
+		extent_interior_register(tsdn, rtree_ctx, extent, szind);
+	}
+
+	extent_unlock(tsdn, extent);
+
+	if (config_prof && gdump_add) {
+		extent_gdump_add(tsdn, extent);
+	}
+
+	return false;
+}
+
+static bool
+extent_register(tsdn_t *tsdn, extent_t *extent) {
+	return extent_register_impl(tsdn, extent, true);
+}
+
+static bool
+extent_register_no_gdump_add(tsdn_t *tsdn, extent_t *extent) {
+	return extent_register_impl(tsdn, extent, false);
+}
+
+static void
+extent_reregister(tsdn_t *tsdn, extent_t *extent) {
+	bool err = extent_register(tsdn, extent);
+	assert(!err);
+}
+
+/*
+ * Removes all pointers to the given extent from the global rtree indices for
+ * its interior.  This is relevant for slab extents, for which we need to do
+ * metadata lookups at places other than the head of the extent.  We deregister
+ * on the interior, then, when an extent moves from being an active slab to an
+ * inactive state.
+ */
+static void
+extent_interior_deregister(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx,
+    extent_t *extent) {
+	size_t i;
+
+	assert(extent_slab_get(extent));
+
+	for (i = 1; i < (extent_size_get(extent) >> LG_PAGE) - 1; i++) {
+		rtree_clear(tsdn, &extents_rtree, rtree_ctx,
+		    (uintptr_t)extent_base_get(extent) + (uintptr_t)(i <<
+		    LG_PAGE));
+	}
+}
+
+/*
+ * Removes all pointers to the given extent from the global rtree.
+ */
+static void
+extent_deregister_impl(tsdn_t *tsdn, extent_t *extent, bool gdump) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	rtree_leaf_elm_t *elm_a, *elm_b;
+	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, extent, true, false,
+	    &elm_a, &elm_b);
+
+	extent_lock(tsdn, extent);
+
+	extent_rtree_write_acquired(tsdn, elm_a, elm_b, NULL, NSIZES, false);
+	if (extent_slab_get(extent)) {
+		extent_interior_deregister(tsdn, rtree_ctx, extent);
+		extent_slab_set(extent, false);
+	}
+
+	extent_unlock(tsdn, extent);
+
+	if (config_prof && gdump) {
+		extent_gdump_sub(tsdn, extent);
+	}
+}
+
+static void
+extent_deregister(tsdn_t *tsdn, extent_t *extent) {
+	extent_deregister_impl(tsdn, extent, true);
+}
+
+static void
+extent_deregister_no_gdump_sub(tsdn_t *tsdn, extent_t *extent) {
+	extent_deregister_impl(tsdn, extent, false);
+}
+
+/*
+ * Tries to find and remove an extent from extents that can be used for the
+ * given allocation request.
+ */
+static extent_t *
+extent_recycle_extract(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
+    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
+    bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+	assert(alignment > 0);
+	if (config_debug && new_addr != NULL) {
+		/*
+		 * Non-NULL new_addr has two use cases:
+		 *
+		 *   1) Recycle a known-extant extent, e.g. during purging.
+		 *   2) Perform in-place expanding reallocation.
+		 *
+		 * Regardless of use case, new_addr must either refer to a
+		 * non-existing extent, or to the base of an extant extent,
+		 * since only active slabs support interior lookups (which of
+		 * course cannot be recycled).
+		 */
+		assert(PAGE_ADDR2BASE(new_addr) == new_addr);
+		assert(pad == 0);
+		assert(alignment <= PAGE);
+	}
+
+	size_t esize = size + pad;
+	malloc_mutex_lock(tsdn, &extents->mtx);
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+	extent_t *extent;
+	if (new_addr != NULL) {
+		extent = extent_lock_from_addr(tsdn, rtree_ctx, new_addr);
+		if (extent != NULL) {
+			/*
+			 * We might null-out extent to report an error, but we
+			 * still need to unlock the associated mutex after.
+			 */
+			extent_t *unlock_extent = extent;
+			assert(extent_base_get(extent) == new_addr);
+			if (extent_arena_get(extent) != arena ||
+			    extent_size_get(extent) < esize ||
+			    extent_state_get(extent) !=
+			    extents_state_get(extents)) {
+				extent = NULL;
+			}
+			extent_unlock(tsdn, unlock_extent);
+		}
+	} else {
+		extent = extents_fit_locked(tsdn, arena, extents, esize,
+		    alignment);
+	}
+	if (extent == NULL) {
+		malloc_mutex_unlock(tsdn, &extents->mtx);
+		return NULL;
+	}
+
+	extent_activate_locked(tsdn, arena, extents, extent);
+	malloc_mutex_unlock(tsdn, &extents->mtx);
+
+	return extent;
+}
+
+/*
+ * Given an allocation request and an extent guaranteed to be able to satisfy
+ * it, this splits off lead and trail extents, leaving extent pointing to an
+ * extent satisfying the allocation.
+ * This function doesn't put lead or trail into any extents_t; it's the caller's
+ * job to ensure that they can be reused.
+ */
+typedef enum {
+	/*
+	 * Split successfully.  lead, extent, and trail, are modified to extents
+	 * describing the ranges before, in, and after the given allocation.
+	 */
+	extent_split_interior_ok,
+	/*
+	 * The extent can't satisfy the given allocation request.  None of the
+	 * input extent_t *s are touched.
+	 */
+	extent_split_interior_cant_alloc,
+	/*
+	 * In a potentially invalid state.  Must leak (if *to_leak is non-NULL),
+	 * and salvage what's still salvageable (if *to_salvage is non-NULL).
+	 * None of lead, extent, or trail are valid.
+	 */
+	extent_split_interior_error
+} extent_split_interior_result_t;
+
+static extent_split_interior_result_t
+extent_split_interior(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx,
+    /* The result of splitting, in case of success. */
+    extent_t **extent, extent_t **lead, extent_t **trail,
+    /* The mess to clean up, in case of error. */
+    extent_t **to_leak, extent_t **to_salvage,
+    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
+    szind_t szind, bool growing_retained) {
+	size_t esize = size + pad;
+	size_t leadsize = ALIGNMENT_CEILING((uintptr_t)extent_base_get(*extent),
+	    PAGE_CEILING(alignment)) - (uintptr_t)extent_base_get(*extent);
+	assert(new_addr == NULL || leadsize == 0);
+	if (extent_size_get(*extent) < leadsize + esize) {
+		return extent_split_interior_cant_alloc;
+	}
+	size_t trailsize = extent_size_get(*extent) - leadsize - esize;
+
+	*lead = NULL;
+	*trail = NULL;
+	*to_leak = NULL;
+	*to_salvage = NULL;
+
+	/* Split the lead. */
+	if (leadsize != 0) {
+		*lead = *extent;
+		*extent = extent_split_impl(tsdn, arena, r_extent_hooks,
+		    *lead, leadsize, NSIZES, false, esize + trailsize, szind,
+		    slab, growing_retained);
+		if (*extent == NULL) {
+			*to_leak = *lead;
+			*lead = NULL;
+			return extent_split_interior_error;
+		}
+	}
+
+	/* Split the trail. */
+	if (trailsize != 0) {
+		*trail = extent_split_impl(tsdn, arena, r_extent_hooks, *extent,
+		    esize, szind, slab, trailsize, NSIZES, false,
+		    growing_retained);
+		if (*trail == NULL) {
+			*to_leak = *extent;
+			*to_salvage = *lead;
+			*lead = NULL;
+			*extent = NULL;
+			return extent_split_interior_error;
+		}
+	}
+
+	if (leadsize == 0 && trailsize == 0) {
+		/*
+		 * Splitting causes szind to be set as a side effect, but no
+		 * splitting occurred.
+		 */
+		extent_szind_set(*extent, szind);
+		if (szind != NSIZES) {
+			rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx,
+			    (uintptr_t)extent_addr_get(*extent), szind, slab);
+			if (slab && extent_size_get(*extent) > PAGE) {
+				rtree_szind_slab_update(tsdn, &extents_rtree,
+				    rtree_ctx,
+				    (uintptr_t)extent_past_get(*extent) -
+				    (uintptr_t)PAGE, szind, slab);
+			}
+		}
+	}
+
+	return extent_split_interior_ok;
+}
+
+/*
+ * This fulfills the indicated allocation request out of the given extent (which
+ * the caller should have ensured was big enough).  If there's any unused space
+ * before or after the resulting allocation, that space is given its own extent
+ * and put back into extents.
+ */
+static extent_t *
+extent_recycle_split(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
+    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
+    szind_t szind, extent_t *extent, bool growing_retained) {
+	extent_t *lead;
+	extent_t *trail;
+	extent_t *to_leak;
+	extent_t *to_salvage;
+
+	extent_split_interior_result_t result = extent_split_interior(
+	    tsdn, arena, r_extent_hooks, rtree_ctx, &extent, &lead, &trail,
+	    &to_leak, &to_salvage, new_addr, size, pad, alignment, slab, szind,
+	    growing_retained);
+
+	if (result == extent_split_interior_ok) {
+		if (lead != NULL) {
+			extent_deactivate(tsdn, arena, extents, lead);
+		}
+		if (trail != NULL) {
+			extent_deactivate(tsdn, arena, extents, trail);
+		}
+		return extent;
+	} else {
+		/*
+		 * We should have picked an extent that was large enough to
+		 * fulfill our allocation request.
+		 */
+		assert(result == extent_split_interior_error);
+		if (to_salvage != NULL) {
+			extent_deregister(tsdn, to_salvage);
+		}
+		if (to_leak != NULL) {
+			void *leak = extent_base_get(to_leak);
+			extent_deregister_no_gdump_sub(tsdn, to_leak);
+			extents_leak(tsdn, arena, r_extent_hooks, extents,
+			    to_leak, growing_retained);
+			assert(extent_lock_from_addr(tsdn, rtree_ctx, leak)
+			    == NULL);
+		}
+		return NULL;
+	}
+	unreachable();
+}
+
+/*
+ * Tries to satisfy the given allocation request by reusing one of the extents
+ * in the given extents_t.
+ */
+static extent_t *
+extent_recycle(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit,
+    bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+	assert(new_addr == NULL || !slab);
+	assert(pad == 0 || !slab);
+	assert(!*zero || !slab);
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	extent_t *extent = extent_recycle_extract(tsdn, arena, r_extent_hooks,
+	    rtree_ctx, extents, new_addr, size, pad, alignment, slab,
+	    growing_retained);
+	if (extent == NULL) {
+		return NULL;
+	}
+
+	extent = extent_recycle_split(tsdn, arena, r_extent_hooks, rtree_ctx,
+	    extents, new_addr, size, pad, alignment, slab, szind, extent,
+	    growing_retained);
+	if (extent == NULL) {
+		return NULL;
+	}
+
+	if (*commit && !extent_committed_get(extent)) {
+		if (extent_commit_impl(tsdn, arena, r_extent_hooks, extent,
+		    0, extent_size_get(extent), growing_retained)) {
+			extent_record(tsdn, arena, r_extent_hooks, extents,
+			    extent, growing_retained);
+			return NULL;
+		}
+		extent_zeroed_set(extent, true);
+	}
+
+	if (extent_committed_get(extent)) {
+		*commit = true;
+	}
+	if (extent_zeroed_get(extent)) {
+		*zero = true;
+	}
+
+	if (pad != 0) {
+		extent_addr_randomize(tsdn, extent, alignment);
+	}
+	assert(extent_state_get(extent) == extent_state_active);
+	if (slab) {
+		extent_slab_set(extent, slab);
+		extent_interior_register(tsdn, rtree_ctx, extent, szind);
+	}
+
+	if (*zero) {
+		void *addr = extent_base_get(extent);
+		size_t size = extent_size_get(extent);
+		if (!extent_zeroed_get(extent)) {
+			if (pages_purge_forced(addr, size)) {
+				memset(addr, 0, size);
+			}
+		} else if (config_debug) {
+			size_t *p = (size_t *)(uintptr_t)addr;
+			for (size_t i = 0; i < size / sizeof(size_t); i++) {
+				assert(p[i] == 0);
+			}
+		}
+	}
+	return extent;
+}
+
+/*
+ * If the caller specifies (!*zero), it is still possible to receive zeroed
+ * memory, in which case *zero is toggled to true.  arena_extent_alloc() takes
+ * advantage of this to avoid demanding zeroed extents, but taking advantage of
+ * them if they are returned.
+ */
+static void *
+extent_alloc_core(tsdn_t *tsdn, arena_t *arena, void *new_addr, size_t size,
+    size_t alignment, bool *zero, bool *commit, dss_prec_t dss_prec) {
+	void *ret;
+
+	assert(size != 0);
+	assert(alignment != 0);
+
+	/* "primary" dss. */
+	if (have_dss && dss_prec == dss_prec_primary && (ret =
+	    extent_alloc_dss(tsdn, arena, new_addr, size, alignment, zero,
+	    commit)) != NULL) {
+		return ret;
+	}
+	/* mmap. */
+	if ((ret = extent_alloc_mmap(new_addr, size, alignment, zero, commit))
+	    != NULL) {
+		return ret;
+	}
+	/* "secondary" dss. */
+	if (have_dss && dss_prec == dss_prec_secondary && (ret =
+	    extent_alloc_dss(tsdn, arena, new_addr, size, alignment, zero,
+	    commit)) != NULL) {
+		return ret;
+	}
+
+	/* All strategies for allocation failed. */
+	return NULL;
+}
+
+static void *
+extent_alloc_default_impl(tsdn_t *tsdn, arena_t *arena, void *new_addr,
+    size_t size, size_t alignment, bool *zero, bool *commit) {
+	void *ret = extent_alloc_core(tsdn, arena, new_addr, size, alignment, zero,
+	    commit, (dss_prec_t)atomic_load_u(&arena->dss_prec,
+	    ATOMIC_RELAXED));
+	if (have_madvise_huge && ret) {
+		pages_set_thp_state(ret, size);
+	}
+	return ret;
+}
+
+static void *
+extent_alloc_default(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
+    size_t alignment, bool *zero, bool *commit, unsigned arena_ind) {
+	tsdn_t *tsdn;
+	arena_t *arena;
+
+	tsdn = tsdn_fetch();
+	arena = arena_get(tsdn, arena_ind, false);
+	/*
+	 * The arena we're allocating on behalf of must have been initialized
+	 * already.
+	 */
+	assert(arena != NULL);
+
+	return extent_alloc_default_impl(tsdn, arena, new_addr, size,
+	    alignment, zero, commit);
+}
+
+static void
+extent_hook_pre_reentrancy(tsdn_t *tsdn, arena_t *arena) {
+	tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
+	if (arena == arena_get(tsd_tsdn(tsd), 0, false)) {
+		/*
+		 * The only legitimate case of customized extent hooks for a0 is
+		 * hooks with no allocation activities.  One such example is to
+		 * place metadata on pre-allocated resources such as huge pages.
+		 * In that case, rely on reentrancy_level checks to catch
+		 * infinite recursions.
+		 */
+		pre_reentrancy(tsd, NULL);
+	} else {
+		pre_reentrancy(tsd, arena);
+	}
+}
+
+static void
+extent_hook_post_reentrancy(tsdn_t *tsdn) {
+	tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
+	post_reentrancy(tsd);
+}
+
+/*
+ * If virtual memory is retained, create increasingly larger extents from which
+ * to split requested extents in order to limit the total number of disjoint
+ * virtual memory ranges retained by each arena.
+ */
+static extent_t *
+extent_grow_retained(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, size_t size, size_t pad, size_t alignment,
+    bool slab, szind_t szind, bool *zero, bool *commit) {
+	malloc_mutex_assert_owner(tsdn, &arena->extent_grow_mtx);
+	assert(pad == 0 || !slab);
+	assert(!*zero || !slab);
+
+	size_t esize = size + pad;
+	size_t alloc_size_min = esize + PAGE_CEILING(alignment) - PAGE;
+	/* Beware size_t wrap-around. */
+	if (alloc_size_min < esize) {
+		goto label_err;
+	}
+	/*
+	 * Find the next extent size in the series that would be large enough to
+	 * satisfy this request.
+	 */
+	pszind_t egn_skip = 0;
+	size_t alloc_size = sz_pind2sz(arena->extent_grow_next + egn_skip);
+	while (alloc_size < alloc_size_min) {
+		egn_skip++;
+		if (arena->extent_grow_next + egn_skip == NPSIZES) {
+			/* Outside legal range. */
+			goto label_err;
+		}
+		assert(arena->extent_grow_next + egn_skip < NPSIZES);
+		alloc_size = sz_pind2sz(arena->extent_grow_next + egn_skip);
+	}
+
+	extent_t *extent = extent_alloc(tsdn, arena);
+	if (extent == NULL) {
+		goto label_err;
+	}
+	bool zeroed = false;
+	bool committed = false;
+
+	void *ptr;
+	if (*r_extent_hooks == &extent_hooks_default) {
+		ptr = extent_alloc_default_impl(tsdn, arena, NULL,
+		    alloc_size, PAGE, &zeroed, &committed);
+	} else {
+		extent_hook_pre_reentrancy(tsdn, arena);
+		ptr = (*r_extent_hooks)->alloc(*r_extent_hooks, NULL,
+		    alloc_size, PAGE, &zeroed, &committed,
+		    arena_ind_get(arena));
+		extent_hook_post_reentrancy(tsdn);
+	}
+
+	extent_init(extent, arena, ptr, alloc_size, false, NSIZES,
+	    arena_extent_sn_next(arena), extent_state_active, zeroed,
+	    committed, true);
+	if (ptr == NULL) {
+		extent_dalloc(tsdn, arena, extent);
+		goto label_err;
+	}
+
+	if (extent_register_no_gdump_add(tsdn, extent)) {
+		extents_leak(tsdn, arena, r_extent_hooks,
+		    &arena->extents_retained, extent, true);
+		goto label_err;
+	}
+
+	if (extent_zeroed_get(extent) && extent_committed_get(extent)) {
+		*zero = true;
+	}
+	if (extent_committed_get(extent)) {
+		*commit = true;
+	}
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	extent_t *lead;
+	extent_t *trail;
+	extent_t *to_leak;
+	extent_t *to_salvage;
+	extent_split_interior_result_t result = extent_split_interior(
+	    tsdn, arena, r_extent_hooks, rtree_ctx, &extent, &lead, &trail,
+	    &to_leak, &to_salvage, NULL, size, pad, alignment, slab, szind,
+	    true);
+
+	if (result == extent_split_interior_ok) {
+		if (lead != NULL) {
+			extent_record(tsdn, arena, r_extent_hooks,
+			    &arena->extents_retained, lead, true);
+		}
+		if (trail != NULL) {
+			extent_record(tsdn, arena, r_extent_hooks,
+			    &arena->extents_retained, trail, true);
+		}
+	} else {
+		/*
+		 * We should have allocated a sufficiently large extent; the
+		 * cant_alloc case should not occur.
+		 */
+		assert(result == extent_split_interior_error);
+		if (to_salvage != NULL) {
+			if (config_prof) {
+				extent_gdump_add(tsdn, to_salvage);
+			}
+			extent_record(tsdn, arena, r_extent_hooks,
+			    &arena->extents_retained, to_salvage, true);
+		}
+		if (to_leak != NULL) {
+			extent_deregister_no_gdump_sub(tsdn, to_leak);
+			extents_leak(tsdn, arena, r_extent_hooks,
+			    &arena->extents_retained, to_leak, true);
+		}
+		goto label_err;
+	}
+
+	if (*commit && !extent_committed_get(extent)) {
+		if (extent_commit_impl(tsdn, arena, r_extent_hooks, extent, 0,
+		    extent_size_get(extent), true)) {
+			extent_record(tsdn, arena, r_extent_hooks,
+			    &arena->extents_retained, extent, true);
+			goto label_err;
+		}
+		extent_zeroed_set(extent, true);
+	}
+
+	/*
+	 * Increment extent_grow_next if doing so wouldn't exceed the allowed
+	 * range.
+	 */
+	if (arena->extent_grow_next + egn_skip + 1 <=
+	    arena->retain_grow_limit) {
+		arena->extent_grow_next += egn_skip + 1;
+	} else {
+		arena->extent_grow_next = arena->retain_grow_limit;
+	}
+	/* All opportunities for failure are past. */
+	malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
+
+	if (config_prof) {
+		/* Adjust gdump stats now that extent is final size. */
+		extent_gdump_add(tsdn, extent);
+	}
+	if (pad != 0) {
+		extent_addr_randomize(tsdn, extent, alignment);
+	}
+	if (slab) {
+		rtree_ctx_t rtree_ctx_fallback;
+		rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
+		    &rtree_ctx_fallback);
+
+		extent_slab_set(extent, true);
+		extent_interior_register(tsdn, rtree_ctx, extent, szind);
+	}
+	if (*zero && !extent_zeroed_get(extent)) {
+		void *addr = extent_base_get(extent);
+		size_t size = extent_size_get(extent);
+		if (pages_purge_forced(addr, size)) {
+			memset(addr, 0, size);
+		}
+	}
+
+	return extent;
+label_err:
+	malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
+	return NULL;
+}
+
+static extent_t *
+extent_alloc_retained(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
+	assert(size != 0);
+	assert(alignment != 0);
+
+	malloc_mutex_lock(tsdn, &arena->extent_grow_mtx);
+
+	extent_t *extent = extent_recycle(tsdn, arena, r_extent_hooks,
+	    &arena->extents_retained, new_addr, size, pad, alignment, slab,
+	    szind, zero, commit, true);
+	if (extent != NULL) {
+		malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
+		if (config_prof) {
+			extent_gdump_add(tsdn, extent);
+		}
+	} else if (opt_retain && new_addr == NULL) {
+		extent = extent_grow_retained(tsdn, arena, r_extent_hooks, size,
+		    pad, alignment, slab, szind, zero, commit);
+		/* extent_grow_retained() always releases extent_grow_mtx. */
+	} else {
+		malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
+	}
+	malloc_mutex_assert_not_owner(tsdn, &arena->extent_grow_mtx);
+
+	return extent;
+}
+
+static extent_t *
+extent_alloc_wrapper_hard(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
+	size_t esize = size + pad;
+	extent_t *extent = extent_alloc(tsdn, arena);
+	if (extent == NULL) {
+		return NULL;
+	}
+	void *addr;
+	if (*r_extent_hooks == &extent_hooks_default) {
+		/* Call directly to propagate tsdn. */
+		addr = extent_alloc_default_impl(tsdn, arena, new_addr, esize,
+		    alignment, zero, commit);
+	} else {
+		extent_hook_pre_reentrancy(tsdn, arena);
+		addr = (*r_extent_hooks)->alloc(*r_extent_hooks, new_addr,
+		    esize, alignment, zero, commit, arena_ind_get(arena));
+		extent_hook_post_reentrancy(tsdn);
+	}
+	if (addr == NULL) {
+		extent_dalloc(tsdn, arena, extent);
+		return NULL;
+	}
+	extent_init(extent, arena, addr, esize, slab, szind,
+	    arena_extent_sn_next(arena), extent_state_active, *zero, *commit,
+	    true);
+	if (pad != 0) {
+		extent_addr_randomize(tsdn, extent, alignment);
+	}
+	if (extent_register(tsdn, extent)) {
+		extents_leak(tsdn, arena, r_extent_hooks,
+		    &arena->extents_retained, extent, false);
+		return NULL;
+	}
+
+	return extent;
+}
+
+extent_t *
+extent_alloc_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
+    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	extent_t *extent = extent_alloc_retained(tsdn, arena, r_extent_hooks,
+	    new_addr, size, pad, alignment, slab, szind, zero, commit);
+	if (extent == NULL) {
+		if (opt_retain && new_addr != NULL) {
+			/*
+			 * When retain is enabled and new_addr is set, we do not
+			 * attempt extent_alloc_wrapper_hard which does mmap
+			 * that is very unlikely to succeed (unless it happens
+			 * to be at the end).
+			 */
+			return NULL;
+		}
+		extent = extent_alloc_wrapper_hard(tsdn, arena, r_extent_hooks,
+		    new_addr, size, pad, alignment, slab, szind, zero, commit);
+	}
+
+	assert(extent == NULL || extent_dumpable_get(extent));
+	return extent;
+}
+
+static bool
+extent_can_coalesce(arena_t *arena, extents_t *extents, const extent_t *inner,
+    const extent_t *outer) {
+	assert(extent_arena_get(inner) == arena);
+	if (extent_arena_get(outer) != arena) {
+		return false;
+	}
+
+	assert(extent_state_get(inner) == extent_state_active);
+	if (extent_state_get(outer) != extents->state) {
+		return false;
+	}
+
+	if (extent_committed_get(inner) != extent_committed_get(outer)) {
+		return false;
+	}
+
+	return true;
+}
+
+static bool
+extent_coalesce(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, extent_t *inner, extent_t *outer, bool forward,
+    bool growing_retained) {
+	assert(extent_can_coalesce(arena, extents, inner, outer));
+
+	extent_activate_locked(tsdn, arena, extents, outer);
+
+	malloc_mutex_unlock(tsdn, &extents->mtx);
+	bool err = extent_merge_impl(tsdn, arena, r_extent_hooks,
+	    forward ? inner : outer, forward ? outer : inner, growing_retained);
+	malloc_mutex_lock(tsdn, &extents->mtx);
+
+	if (err) {
+		extent_deactivate_locked(tsdn, arena, extents, outer);
+	}
+
+	return err;
+}
+
+static extent_t *
+extent_try_coalesce(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
+    extent_t *extent, bool *coalesced, bool growing_retained) {
+	/*
+	 * Continue attempting to coalesce until failure, to protect against
+	 * races with other threads that are thwarted by this one.
+	 */
+	bool again;
+	do {
+		again = false;
+
+		/* Try to coalesce forward. */
+		extent_t *next = extent_lock_from_addr(tsdn, rtree_ctx,
+		    extent_past_get(extent));
+		if (next != NULL) {
+			/*
+			 * extents->mtx only protects against races for
+			 * like-state extents, so call extent_can_coalesce()
+			 * before releasing next's pool lock.
+			 */
+			bool can_coalesce = extent_can_coalesce(arena, extents,
+			    extent, next);
+
+			extent_unlock(tsdn, next);
+
+			if (can_coalesce && !extent_coalesce(tsdn, arena,
+			    r_extent_hooks, extents, extent, next, true,
+			    growing_retained)) {
+				if (extents->delay_coalesce) {
+					/* Do minimal coalescing. */
+					*coalesced = true;
+					return extent;
+				}
+				again = true;
+			}
+		}
+
+		/* Try to coalesce backward. */
+		extent_t *prev = extent_lock_from_addr(tsdn, rtree_ctx,
+		    extent_before_get(extent));
+		if (prev != NULL) {
+			bool can_coalesce = extent_can_coalesce(arena, extents,
+			    extent, prev);
+			extent_unlock(tsdn, prev);
+
+			if (can_coalesce && !extent_coalesce(tsdn, arena,
+			    r_extent_hooks, extents, extent, prev, false,
+			    growing_retained)) {
+				extent = prev;
+				if (extents->delay_coalesce) {
+					/* Do minimal coalescing. */
+					*coalesced = true;
+					return extent;
+				}
+				again = true;
+			}
+		}
+	} while (again);
+
+	if (extents->delay_coalesce) {
+		*coalesced = false;
+	}
+	return extent;
+}
+
+/*
+ * Does the metadata management portions of putting an unused extent into the
+ * given extents_t (coalesces, deregisters slab interiors, the heap operations).
+ */
+static void
+extent_record(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
+    extents_t *extents, extent_t *extent, bool growing_retained) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	assert((extents_state_get(extents) != extent_state_dirty &&
+	    extents_state_get(extents) != extent_state_muzzy) ||
+	    !extent_zeroed_get(extent));
+
+	malloc_mutex_lock(tsdn, &extents->mtx);
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	extent_szind_set(extent, NSIZES);
+	if (extent_slab_get(extent)) {
+		extent_interior_deregister(tsdn, rtree_ctx, extent);
+		extent_slab_set(extent, false);
+	}
+
+	assert(rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)extent_base_get(extent), true) == extent);
+
+	if (!extents->delay_coalesce) {
+		extent = extent_try_coalesce(tsdn, arena, r_extent_hooks,
+		    rtree_ctx, extents, extent, NULL, growing_retained);
+	} else if (extent_size_get(extent) >= LARGE_MINCLASS) {
+		/* Always coalesce large extents eagerly. */
+		bool coalesced;
+		size_t prev_size;
+		do {
+			prev_size = extent_size_get(extent);
+			assert(extent_state_get(extent) == extent_state_active);
+			extent = extent_try_coalesce(tsdn, arena,
+			    r_extent_hooks, rtree_ctx, extents, extent,
+			    &coalesced, growing_retained);
+		} while (coalesced &&
+		    extent_size_get(extent) >= prev_size + LARGE_MINCLASS);
+	}
+	extent_deactivate_locked(tsdn, arena, extents, extent);
+
+	malloc_mutex_unlock(tsdn, &extents->mtx);
+}
+
+void
+extent_dalloc_gap(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
+	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
+
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	if (extent_register(tsdn, extent)) {
+		extents_leak(tsdn, arena, &extent_hooks,
+		    &arena->extents_retained, extent, false);
+		return;
+	}
+	extent_dalloc_wrapper(tsdn, arena, &extent_hooks, extent);
+}
+
+static bool
+extent_dalloc_default_impl(void *addr, size_t size) {
+	if (!have_dss || !extent_in_dss(addr)) {
+		return extent_dalloc_mmap(addr, size);
+	}
+	return true;
+}
+
+static bool
+extent_dalloc_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    bool committed, unsigned arena_ind) {
+	return extent_dalloc_default_impl(addr, size);
+}
+
+static bool
+extent_dalloc_wrapper_try(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent) {
+	bool err;
+
+	assert(extent_base_get(extent) != NULL);
+	assert(extent_size_get(extent) != 0);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_addr_set(extent, extent_base_get(extent));
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+	/* Try to deallocate. */
+	if (*r_extent_hooks == &extent_hooks_default) {
+		/* Call directly to propagate tsdn. */
+		err = extent_dalloc_default_impl(extent_base_get(extent),
+		    extent_size_get(extent));
+	} else {
+		extent_hook_pre_reentrancy(tsdn, arena);
+		err = ((*r_extent_hooks)->dalloc == NULL ||
+		    (*r_extent_hooks)->dalloc(*r_extent_hooks,
+		    extent_base_get(extent), extent_size_get(extent),
+		    extent_committed_get(extent), arena_ind_get(arena)));
+		extent_hook_post_reentrancy(tsdn);
+	}
+
+	if (!err) {
+		extent_dalloc(tsdn, arena, extent);
+	}
+
+	return err;
+}
+
+void
+extent_dalloc_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent) {
+	assert(extent_dumpable_get(extent));
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	/*
+	 * Deregister first to avoid a race with other allocating threads, and
+	 * reregister if deallocation fails.
+	 */
+	extent_deregister(tsdn, extent);
+	if (!extent_dalloc_wrapper_try(tsdn, arena, r_extent_hooks, extent)) {
+		return;
+	}
+
+	extent_reregister(tsdn, extent);
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	/* Try to decommit; purge if that fails. */
+	bool zeroed;
+	if (!extent_committed_get(extent)) {
+		zeroed = true;
+	} else if (!extent_decommit_wrapper(tsdn, arena, r_extent_hooks, extent,
+	    0, extent_size_get(extent))) {
+		zeroed = true;
+	} else if ((*r_extent_hooks)->purge_forced != NULL &&
+	    !(*r_extent_hooks)->purge_forced(*r_extent_hooks,
+	    extent_base_get(extent), extent_size_get(extent), 0,
+	    extent_size_get(extent), arena_ind_get(arena))) {
+		zeroed = true;
+	} else if (extent_state_get(extent) == extent_state_muzzy ||
+	    ((*r_extent_hooks)->purge_lazy != NULL &&
+	    !(*r_extent_hooks)->purge_lazy(*r_extent_hooks,
+	    extent_base_get(extent), extent_size_get(extent), 0,
+	    extent_size_get(extent), arena_ind_get(arena)))) {
+		zeroed = false;
+	} else {
+		zeroed = false;
+	}
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+	extent_zeroed_set(extent, zeroed);
+
+	if (config_prof) {
+		extent_gdump_sub(tsdn, extent);
+	}
+
+	extent_record(tsdn, arena, r_extent_hooks, &arena->extents_retained,
+	    extent, false);
+}
+
+static void
+extent_destroy_default_impl(void *addr, size_t size) {
+	if (!have_dss || !extent_in_dss(addr)) {
+		pages_unmap(addr, size);
+	}
+}
+
+static void
+extent_destroy_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    bool committed, unsigned arena_ind) {
+	extent_destroy_default_impl(addr, size);
+}
+
+void
+extent_destroy_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent) {
+	assert(extent_base_get(extent) != NULL);
+	assert(extent_size_get(extent) != 0);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	/* Deregister first to avoid a race with other allocating threads. */
+	extent_deregister(tsdn, extent);
+
+	extent_addr_set(extent, extent_base_get(extent));
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+	/* Try to destroy; silently fail otherwise. */
+	if (*r_extent_hooks == &extent_hooks_default) {
+		/* Call directly to propagate tsdn. */
+		extent_destroy_default_impl(extent_base_get(extent),
+		    extent_size_get(extent));
+	} else if ((*r_extent_hooks)->destroy != NULL) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+		(*r_extent_hooks)->destroy(*r_extent_hooks,
+		    extent_base_get(extent), extent_size_get(extent),
+		    extent_committed_get(extent), arena_ind_get(arena));
+		extent_hook_post_reentrancy(tsdn);
+	}
+
+	extent_dalloc(tsdn, arena, extent);
+}
+
+static bool
+extent_commit_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	return pages_commit((void *)((uintptr_t)addr + (uintptr_t)offset),
+	    length);
+}
+
+static bool
+extent_commit_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	bool err = ((*r_extent_hooks)->commit == NULL ||
+	    (*r_extent_hooks)->commit(*r_extent_hooks, extent_base_get(extent),
+	    extent_size_get(extent), offset, length, arena_ind_get(arena)));
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+	extent_committed_set(extent, extent_committed_get(extent) || !err);
+	return err;
+}
+
+bool
+extent_commit_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length) {
+	return extent_commit_impl(tsdn, arena, r_extent_hooks, extent, offset,
+	    length, false);
+}
+
+static bool
+extent_decommit_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	return pages_decommit((void *)((uintptr_t)addr + (uintptr_t)offset),
+	    length);
+}
+
+bool
+extent_decommit_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	bool err = ((*r_extent_hooks)->decommit == NULL ||
+	    (*r_extent_hooks)->decommit(*r_extent_hooks,
+	    extent_base_get(extent), extent_size_get(extent), offset, length,
+	    arena_ind_get(arena)));
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+	extent_committed_set(extent, extent_committed_get(extent) && err);
+	return err;
+}
+
+#ifdef PAGES_CAN_PURGE_LAZY
+static bool
+extent_purge_lazy_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	assert(addr != NULL);
+	assert((offset & PAGE_MASK) == 0);
+	assert(length != 0);
+	assert((length & PAGE_MASK) == 0);
+
+	return pages_purge_lazy((void *)((uintptr_t)addr + (uintptr_t)offset),
+	    length);
+}
+#endif
+
+static bool
+extent_purge_lazy_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	if ((*r_extent_hooks)->purge_lazy == NULL) {
+		return true;
+	}
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	bool err = (*r_extent_hooks)->purge_lazy(*r_extent_hooks,
+	    extent_base_get(extent), extent_size_get(extent), offset, length,
+	    arena_ind_get(arena));
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+
+	return err;
+}
+
+bool
+extent_purge_lazy_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length) {
+	return extent_purge_lazy_impl(tsdn, arena, r_extent_hooks, extent,
+	    offset, length, false);
+}
+
+#ifdef PAGES_CAN_PURGE_FORCED
+static bool
+extent_purge_forced_default(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind) {
+	assert(addr != NULL);
+	assert((offset & PAGE_MASK) == 0);
+	assert(length != 0);
+	assert((length & PAGE_MASK) == 0);
+
+	return pages_purge_forced((void *)((uintptr_t)addr +
+	    (uintptr_t)offset), length);
+}
+#endif
+
+static bool
+extent_purge_forced_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length, bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	if ((*r_extent_hooks)->purge_forced == NULL) {
+		return true;
+	}
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	bool err = (*r_extent_hooks)->purge_forced(*r_extent_hooks,
+	    extent_base_get(extent), extent_size_get(extent), offset, length,
+	    arena_ind_get(arena));
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+	return err;
+}
+
+bool
+extent_purge_forced_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
+    size_t length) {
+	return extent_purge_forced_impl(tsdn, arena, r_extent_hooks, extent,
+	    offset, length, false);
+}
+
+#ifdef JEMALLOC_MAPS_COALESCE
+static bool
+extent_split_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t size_a, size_t size_b, bool committed, unsigned arena_ind) {
+	return !maps_coalesce;
+}
+#endif
+
+/*
+ * Accepts the extent to split, and the characteristics of each side of the
+ * split.  The 'a' parameters go with the 'lead' of the resulting pair of
+ * extents (the lower addressed portion of the split), and the 'b' parameters go
+ * with the trail (the higher addressed portion).  This makes 'extent' the lead,
+ * and returns the trail (except in case of error).
+ */
+static extent_t *
+extent_split_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
+    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b,
+    bool growing_retained) {
+	assert(extent_size_get(extent) == size_a + size_b);
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	if ((*r_extent_hooks)->split == NULL) {
+		return NULL;
+	}
+
+	extent_t *trail = extent_alloc(tsdn, arena);
+	if (trail == NULL) {
+		goto label_error_a;
+	}
+
+	extent_init(trail, arena, (void *)((uintptr_t)extent_base_get(extent) +
+	    size_a), size_b, slab_b, szind_b, extent_sn_get(extent),
+	    extent_state_get(extent), extent_zeroed_get(extent),
+	    extent_committed_get(extent), extent_dumpable_get(extent));
+
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	rtree_leaf_elm_t *lead_elm_a, *lead_elm_b;
+	{
+		extent_t lead;
+
+		extent_init(&lead, arena, extent_addr_get(extent), size_a,
+		    slab_a, szind_a, extent_sn_get(extent),
+		    extent_state_get(extent), extent_zeroed_get(extent),
+		    extent_committed_get(extent), extent_dumpable_get(extent));
+
+		extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, &lead, false,
+		    true, &lead_elm_a, &lead_elm_b);
+	}
+	rtree_leaf_elm_t *trail_elm_a, *trail_elm_b;
+	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, trail, false, true,
+	    &trail_elm_a, &trail_elm_b);
+
+	if (lead_elm_a == NULL || lead_elm_b == NULL || trail_elm_a == NULL
+	    || trail_elm_b == NULL) {
+		goto label_error_b;
+	}
+
+	extent_lock2(tsdn, extent, trail);
+
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_pre_reentrancy(tsdn, arena);
+	}
+	bool err = (*r_extent_hooks)->split(*r_extent_hooks, extent_base_get(extent),
+	    size_a + size_b, size_a, size_b, extent_committed_get(extent),
+	    arena_ind_get(arena));
+	if (*r_extent_hooks != &extent_hooks_default) {
+		extent_hook_post_reentrancy(tsdn);
+	}
+	if (err) {
+		goto label_error_c;
+	}
+
+	extent_size_set(extent, size_a);
+	extent_szind_set(extent, szind_a);
+
+	extent_rtree_write_acquired(tsdn, lead_elm_a, lead_elm_b, extent,
+	    szind_a, slab_a);
+	extent_rtree_write_acquired(tsdn, trail_elm_a, trail_elm_b, trail,
+	    szind_b, slab_b);
+
+	extent_unlock2(tsdn, extent, trail);
+
+	return trail;
+label_error_c:
+	extent_unlock2(tsdn, extent, trail);
+label_error_b:
+	extent_dalloc(tsdn, arena, trail);
+label_error_a:
+	return NULL;
+}
+
+extent_t *
+extent_split_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
+    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b) {
+	return extent_split_impl(tsdn, arena, r_extent_hooks, extent, size_a,
+	    szind_a, slab_a, size_b, szind_b, slab_b, false);
+}
+
+static bool
+extent_merge_default_impl(void *addr_a, void *addr_b) {
+	if (!maps_coalesce) {
+		return true;
+	}
+	if (have_dss && !extent_dss_mergeable(addr_a, addr_b)) {
+		return true;
+	}
+
+	return false;
+}
+
+#ifdef JEMALLOC_MAPS_COALESCE
+static bool
+extent_merge_default(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
+    void *addr_b, size_t size_b, bool committed, unsigned arena_ind) {
+	return extent_merge_default_impl(addr_a, addr_b);
+}
+#endif
+
+static bool
+extent_merge_impl(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b,
+    bool growing_retained) {
+	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
+	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
+
+	extent_hooks_assure_initialized(arena, r_extent_hooks);
+
+	if ((*r_extent_hooks)->merge == NULL) {
+		return true;
+	}
+
+	bool err;
+	if (*r_extent_hooks == &extent_hooks_default) {
+		/* Call directly to propagate tsdn. */
+		err = extent_merge_default_impl(extent_base_get(a),
+		    extent_base_get(b));
+	} else {
+		extent_hook_pre_reentrancy(tsdn, arena);
+		err = (*r_extent_hooks)->merge(*r_extent_hooks,
+		    extent_base_get(a), extent_size_get(a), extent_base_get(b),
+		    extent_size_get(b), extent_committed_get(a),
+		    arena_ind_get(arena));
+		extent_hook_post_reentrancy(tsdn);
+	}
+
+	if (err) {
+		return true;
+	}
+
+	/*
+	 * The rtree writes must happen while all the relevant elements are
+	 * owned, so the following code uses decomposed helper functions rather
+	 * than extent_{,de}register() to do things in the right order.
+	 */
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	rtree_leaf_elm_t *a_elm_a, *a_elm_b, *b_elm_a, *b_elm_b;
+	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, a, true, false, &a_elm_a,
+	    &a_elm_b);
+	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, b, true, false, &b_elm_a,
+	    &b_elm_b);
+
+	extent_lock2(tsdn, a, b);
+
+	if (a_elm_b != NULL) {
+		rtree_leaf_elm_write(tsdn, &extents_rtree, a_elm_b, NULL,
+		    NSIZES, false);
+	}
+	if (b_elm_b != NULL) {
+		rtree_leaf_elm_write(tsdn, &extents_rtree, b_elm_a, NULL,
+		    NSIZES, false);
+	} else {
+		b_elm_b = b_elm_a;
+	}
+
+	extent_size_set(a, extent_size_get(a) + extent_size_get(b));
+	extent_szind_set(a, NSIZES);
+	extent_sn_set(a, (extent_sn_get(a) < extent_sn_get(b)) ?
+	    extent_sn_get(a) : extent_sn_get(b));
+	extent_zeroed_set(a, extent_zeroed_get(a) && extent_zeroed_get(b));
+
+	extent_rtree_write_acquired(tsdn, a_elm_a, b_elm_b, a, NSIZES, false);
+
+	extent_unlock2(tsdn, a, b);
+
+	extent_dalloc(tsdn, extent_arena_get(b), b);
+
+	return false;
+}
+
+bool
+extent_merge_wrapper(tsdn_t *tsdn, arena_t *arena,
+    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b) {
+	return extent_merge_impl(tsdn, arena, r_extent_hooks, a, b, false);
+}
+
+bool
+extent_boot(void) {
+	if (rtree_new(&extents_rtree, true)) {
+		return true;
+	}
+
+	if (mutex_pool_init(&extent_mutex_pool, "extent_mutex_pool",
+	    WITNESS_RANK_EXTENT_POOL)) {
+		return true;
+	}
+
+	if (have_dss) {
+		extent_dss_boot();
+	}
+
+	return false;
+}
diff --git a/redis-stable/deps/jemalloc/src/extent_dss.c b/redis-stable/deps/jemalloc/src/extent_dss.c
new file mode 100644
index 00000000..2b1ea9ca
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/extent_dss.c
@@ -0,0 +1,270 @@
+#define JEMALLOC_EXTENT_DSS_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/spin.h"
+
+/******************************************************************************/
+/* Data. */
+
+const char	*opt_dss = DSS_DEFAULT;
+
+const char	*dss_prec_names[] = {
+	"disabled",
+	"primary",
+	"secondary",
+	"N/A"
+};
+
+/*
+ * Current dss precedence default, used when creating new arenas.  NB: This is
+ * stored as unsigned rather than dss_prec_t because in principle there's no
+ * guarantee that sizeof(dss_prec_t) is the same as sizeof(unsigned), and we use
+ * atomic operations to synchronize the setting.
+ */
+static atomic_u_t	dss_prec_default = ATOMIC_INIT(
+    (unsigned)DSS_PREC_DEFAULT);
+
+/* Base address of the DSS. */
+static void		*dss_base;
+/* Atomic boolean indicating whether a thread is currently extending DSS. */
+static atomic_b_t	dss_extending;
+/* Atomic boolean indicating whether the DSS is exhausted. */
+static atomic_b_t	dss_exhausted;
+/* Atomic current upper limit on DSS addresses. */
+static atomic_p_t	dss_max;
+
+/******************************************************************************/
+
+static void *
+extent_dss_sbrk(intptr_t increment) {
+#ifdef JEMALLOC_DSS
+	return sbrk(increment);
+#else
+	not_implemented();
+	return NULL;
+#endif
+}
+
+dss_prec_t
+extent_dss_prec_get(void) {
+	dss_prec_t ret;
+
+	if (!have_dss) {
+		return dss_prec_disabled;
+	}
+	ret = (dss_prec_t)atomic_load_u(&dss_prec_default, ATOMIC_ACQUIRE);
+	return ret;
+}
+
+bool
+extent_dss_prec_set(dss_prec_t dss_prec) {
+	if (!have_dss) {
+		return (dss_prec != dss_prec_disabled);
+	}
+	atomic_store_u(&dss_prec_default, (unsigned)dss_prec, ATOMIC_RELEASE);
+	return false;
+}
+
+static void
+extent_dss_extending_start(void) {
+	spin_t spinner = SPIN_INITIALIZER;
+	while (true) {
+		bool expected = false;
+		if (atomic_compare_exchange_weak_b(&dss_extending, &expected,
+		    true, ATOMIC_ACQ_REL, ATOMIC_RELAXED)) {
+			break;
+		}
+		spin_adaptive(&spinner);
+	}
+}
+
+static void
+extent_dss_extending_finish(void) {
+	assert(atomic_load_b(&dss_extending, ATOMIC_RELAXED));
+
+	atomic_store_b(&dss_extending, false, ATOMIC_RELEASE);
+}
+
+static void *
+extent_dss_max_update(void *new_addr) {
+	/*
+	 * Get the current end of the DSS as max_cur and assure that dss_max is
+	 * up to date.
+	 */
+	void *max_cur = extent_dss_sbrk(0);
+	if (max_cur == (void *)-1) {
+		return NULL;
+	}
+	atomic_store_p(&dss_max, max_cur, ATOMIC_RELEASE);
+	/* Fixed new_addr can only be supported if it is at the edge of DSS. */
+	if (new_addr != NULL && max_cur != new_addr) {
+		return NULL;
+	}
+	return max_cur;
+}
+
+void *
+extent_alloc_dss(tsdn_t *tsdn, arena_t *arena, void *new_addr, size_t size,
+    size_t alignment, bool *zero, bool *commit) {
+	extent_t *gap;
+
+	cassert(have_dss);
+	assert(size > 0);
+	assert(alignment > 0);
+
+	/*
+	 * sbrk() uses a signed increment argument, so take care not to
+	 * interpret a large allocation request as a negative increment.
+	 */
+	if ((intptr_t)size < 0) {
+		return NULL;
+	}
+
+	gap = extent_alloc(tsdn, arena);
+	if (gap == NULL) {
+		return NULL;
+	}
+
+	extent_dss_extending_start();
+	if (!atomic_load_b(&dss_exhausted, ATOMIC_ACQUIRE)) {
+		/*
+		 * The loop is necessary to recover from races with other
+		 * threads that are using the DSS for something other than
+		 * malloc.
+		 */
+		while (true) {
+			void *max_cur = extent_dss_max_update(new_addr);
+			if (max_cur == NULL) {
+				goto label_oom;
+			}
+
+			/*
+			 * Compute how much page-aligned gap space (if any) is
+			 * necessary to satisfy alignment.  This space can be
+			 * recycled for later use.
+			 */
+			void *gap_addr_page = (void *)(PAGE_CEILING(
+			    (uintptr_t)max_cur));
+			void *ret = (void *)ALIGNMENT_CEILING(
+			    (uintptr_t)gap_addr_page, alignment);
+			size_t gap_size_page = (uintptr_t)ret -
+			    (uintptr_t)gap_addr_page;
+			if (gap_size_page != 0) {
+				extent_init(gap, arena, gap_addr_page,
+				    gap_size_page, false, NSIZES,
+				    arena_extent_sn_next(arena),
+				    extent_state_active, false, true, true);
+			}
+			/*
+			 * Compute the address just past the end of the desired
+			 * allocation space.
+			 */
+			void *dss_next = (void *)((uintptr_t)ret + size);
+			if ((uintptr_t)ret < (uintptr_t)max_cur ||
+			    (uintptr_t)dss_next < (uintptr_t)max_cur) {
+				goto label_oom; /* Wrap-around. */
+			}
+			/* Compute the increment, including subpage bytes. */
+			void *gap_addr_subpage = max_cur;
+			size_t gap_size_subpage = (uintptr_t)ret -
+			    (uintptr_t)gap_addr_subpage;
+			intptr_t incr = gap_size_subpage + size;
+
+			assert((uintptr_t)max_cur + incr == (uintptr_t)ret +
+			    size);
+
+			/* Try to allocate. */
+			void *dss_prev = extent_dss_sbrk(incr);
+			if (dss_prev == max_cur) {
+				/* Success. */
+				atomic_store_p(&dss_max, dss_next,
+				    ATOMIC_RELEASE);
+				extent_dss_extending_finish();
+
+				if (gap_size_page != 0) {
+					extent_dalloc_gap(tsdn, arena, gap);
+				} else {
+					extent_dalloc(tsdn, arena, gap);
+				}
+				if (!*commit) {
+					*commit = pages_decommit(ret, size);
+				}
+				if (*zero && *commit) {
+					extent_hooks_t *extent_hooks =
+					    EXTENT_HOOKS_INITIALIZER;
+					extent_t extent;
+
+					extent_init(&extent, arena, ret, size,
+					    size, false, NSIZES,
+					    extent_state_active, false, true,
+					    true);
+					if (extent_purge_forced_wrapper(tsdn,
+					    arena, &extent_hooks, &extent, 0,
+					    size)) {
+						memset(ret, 0, size);
+					}
+				}
+				return ret;
+			}
+			/*
+			 * Failure, whether due to OOM or a race with a raw
+			 * sbrk() call from outside the allocator.
+			 */
+			if (dss_prev == (void *)-1) {
+				/* OOM. */
+				atomic_store_b(&dss_exhausted, true,
+				    ATOMIC_RELEASE);
+				goto label_oom;
+			}
+		}
+	}
+label_oom:
+	extent_dss_extending_finish();
+	extent_dalloc(tsdn, arena, gap);
+	return NULL;
+}
+
+static bool
+extent_in_dss_helper(void *addr, void *max) {
+	return ((uintptr_t)addr >= (uintptr_t)dss_base && (uintptr_t)addr <
+	    (uintptr_t)max);
+}
+
+bool
+extent_in_dss(void *addr) {
+	cassert(have_dss);
+
+	return extent_in_dss_helper(addr, atomic_load_p(&dss_max,
+	    ATOMIC_ACQUIRE));
+}
+
+bool
+extent_dss_mergeable(void *addr_a, void *addr_b) {
+	void *max;
+
+	cassert(have_dss);
+
+	if ((uintptr_t)addr_a < (uintptr_t)dss_base && (uintptr_t)addr_b <
+	    (uintptr_t)dss_base) {
+		return true;
+	}
+
+	max = atomic_load_p(&dss_max, ATOMIC_ACQUIRE);
+	return (extent_in_dss_helper(addr_a, max) ==
+	    extent_in_dss_helper(addr_b, max));
+}
+
+void
+extent_dss_boot(void) {
+	cassert(have_dss);
+
+	dss_base = extent_dss_sbrk(0);
+	atomic_store_b(&dss_extending, false, ATOMIC_RELAXED);
+	atomic_store_b(&dss_exhausted, dss_base == (void *)-1, ATOMIC_RELAXED);
+	atomic_store_p(&dss_max, dss_base, ATOMIC_RELAXED);
+}
+
+/******************************************************************************/
diff --git a/redis-stable/deps/jemalloc/src/extent_mmap.c b/redis-stable/deps/jemalloc/src/extent_mmap.c
new file mode 100644
index 00000000..8d607dc8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/extent_mmap.c
@@ -0,0 +1,42 @@
+#define JEMALLOC_EXTENT_MMAP_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/extent_mmap.h"
+
+/******************************************************************************/
+/* Data. */
+
+bool	opt_retain =
+#ifdef JEMALLOC_RETAIN
+    true
+#else
+    false
+#endif
+    ;
+
+/******************************************************************************/
+
+void *
+extent_alloc_mmap(void *new_addr, size_t size, size_t alignment, bool *zero,
+    bool *commit) {
+	void *ret = pages_map(new_addr, size, ALIGNMENT_CEILING(alignment,
+	    PAGE), commit);
+	if (ret == NULL) {
+		return NULL;
+	}
+	assert(ret != NULL);
+	if (*commit) {
+		*zero = true;
+	}
+	return ret;
+}
+
+bool
+extent_dalloc_mmap(void *addr, size_t size) {
+	if (!opt_retain) {
+		pages_unmap(addr, size);
+	}
+	return opt_retain;
+}
diff --git a/redis-stable/deps/jemalloc/src/hash.c b/redis-stable/deps/jemalloc/src/hash.c
new file mode 100644
index 00000000..7b2bdc2b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/hash.c
@@ -0,0 +1,3 @@
+#define JEMALLOC_HASH_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/hooks.c b/redis-stable/deps/jemalloc/src/hooks.c
new file mode 100644
index 00000000..6266ecd4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/hooks.c
@@ -0,0 +1,12 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+
+/*
+ * The hooks are a little bit screwy -- they're not genuinely exported in the
+ * sense that we want them available to end-users, but we do want them visible
+ * from outside the generated library, so that we can use them in test code.
+ */
+JEMALLOC_EXPORT
+void (*hooks_arena_new_hook)() = NULL;
+
+JEMALLOC_EXPORT
+void (*hooks_libc_hook)() = NULL;
diff --git a/redis-stable/deps/jemalloc/src/jemalloc.c b/redis-stable/deps/jemalloc/src/jemalloc.c
new file mode 100644
index 00000000..585645a2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/jemalloc.c
@@ -0,0 +1,3335 @@
+#define JEMALLOC_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/atomic.h"
+#include "jemalloc/internal/ctl.h"
+#include "jemalloc/internal/extent_dss.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/jemalloc_internal_types.h"
+#include "jemalloc/internal/log.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree.h"
+#include "jemalloc/internal/size_classes.h"
+#include "jemalloc/internal/spin.h"
+#include "jemalloc/internal/sz.h"
+#include "jemalloc/internal/ticker.h"
+#include "jemalloc/internal/util.h"
+
+/******************************************************************************/
+/* Data. */
+
+/* Runtime configuration options. */
+const char	*je_malloc_conf
+#ifndef _WIN32
+    JEMALLOC_ATTR(weak)
+#endif
+    ;
+bool	opt_abort =
+#ifdef JEMALLOC_DEBUG
+    true
+#else
+    false
+#endif
+    ;
+bool	opt_abort_conf =
+#ifdef JEMALLOC_DEBUG
+    true
+#else
+    false
+#endif
+    ;
+const char	*opt_junk =
+#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
+    "true"
+#else
+    "false"
+#endif
+    ;
+bool	opt_junk_alloc =
+#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
+    true
+#else
+    false
+#endif
+    ;
+bool	opt_junk_free =
+#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
+    true
+#else
+    false
+#endif
+    ;
+
+bool	opt_utrace = false;
+bool	opt_xmalloc = false;
+bool	opt_zero = false;
+unsigned	opt_narenas = 0;
+
+unsigned	ncpus;
+
+/* Protects arenas initialization. */
+malloc_mutex_t arenas_lock;
+/*
+ * Arenas that are used to service external requests.  Not all elements of the
+ * arenas array are necessarily used; arenas are created lazily as needed.
+ *
+ * arenas[0..narenas_auto) are used for automatic multiplexing of threads and
+ * arenas.  arenas[narenas_auto..narenas_total) are only used if the application
+ * takes some action to create them and allocate from them.
+ *
+ * Points to an arena_t.
+ */
+JEMALLOC_ALIGNED(CACHELINE)
+atomic_p_t		arenas[MALLOCX_ARENA_LIMIT];
+static atomic_u_t	narenas_total; /* Use narenas_total_*(). */
+static arena_t		*a0; /* arenas[0]; read-only after initialization. */
+unsigned		narenas_auto; /* Read-only after initialization. */
+
+typedef enum {
+	malloc_init_uninitialized	= 3,
+	malloc_init_a0_initialized	= 2,
+	malloc_init_recursible		= 1,
+	malloc_init_initialized		= 0 /* Common case --> jnz. */
+} malloc_init_t;
+static malloc_init_t	malloc_init_state = malloc_init_uninitialized;
+
+/* False should be the common case.  Set to true to trigger initialization. */
+bool			malloc_slow = true;
+
+/* When malloc_slow is true, set the corresponding bits for sanity check. */
+enum {
+	flag_opt_junk_alloc	= (1U),
+	flag_opt_junk_free	= (1U << 1),
+	flag_opt_zero		= (1U << 2),
+	flag_opt_utrace		= (1U << 3),
+	flag_opt_xmalloc	= (1U << 4)
+};
+static uint8_t	malloc_slow_flags;
+
+#ifdef JEMALLOC_THREADED_INIT
+/* Used to let the initializing thread recursively allocate. */
+#  define NO_INITIALIZER	((unsigned long)0)
+#  define INITIALIZER		pthread_self()
+#  define IS_INITIALIZER	(malloc_initializer == pthread_self())
+static pthread_t		malloc_initializer = NO_INITIALIZER;
+#else
+#  define NO_INITIALIZER	false
+#  define INITIALIZER		true
+#  define IS_INITIALIZER	malloc_initializer
+static bool			malloc_initializer = NO_INITIALIZER;
+#endif
+
+/* Used to avoid initialization races. */
+#ifdef _WIN32
+#if _WIN32_WINNT >= 0x0600
+static malloc_mutex_t	init_lock = SRWLOCK_INIT;
+#else
+static malloc_mutex_t	init_lock;
+static bool init_lock_initialized = false;
+
+JEMALLOC_ATTR(constructor)
+static void WINAPI
+_init_init_lock(void) {
+	/*
+	 * If another constructor in the same binary is using mallctl to e.g.
+	 * set up extent hooks, it may end up running before this one, and
+	 * malloc_init_hard will crash trying to lock the uninitialized lock. So
+	 * we force an initialization of the lock in malloc_init_hard as well.
+	 * We don't try to care about atomicity of the accessed to the
+	 * init_lock_initialized boolean, since it really only matters early in
+	 * the process creation, before any separate thread normally starts
+	 * doing anything.
+	 */
+	if (!init_lock_initialized) {
+		malloc_mutex_init(&init_lock, "init", WITNESS_RANK_INIT,
+		    malloc_mutex_rank_exclusive);
+	}
+	init_lock_initialized = true;
+}
+
+#ifdef _MSC_VER
+#  pragma section(".CRT$XCU", read)
+JEMALLOC_SECTION(".CRT$XCU") JEMALLOC_ATTR(used)
+static const void (WINAPI *init_init_lock)(void) = _init_init_lock;
+#endif
+#endif
+#else
+static malloc_mutex_t	init_lock = MALLOC_MUTEX_INITIALIZER;
+#endif
+
+typedef struct {
+	void	*p;	/* Input pointer (as in realloc(p, s)). */
+	size_t	s;	/* Request size. */
+	void	*r;	/* Result pointer. */
+} malloc_utrace_t;
+
+#ifdef JEMALLOC_UTRACE
+#  define UTRACE(a, b, c) do {						\
+	if (unlikely(opt_utrace)) {					\
+		int utrace_serrno = errno;				\
+		malloc_utrace_t ut;					\
+		ut.p = (a);						\
+		ut.s = (b);						\
+		ut.r = (c);						\
+		utrace(&ut, sizeof(ut));				\
+		errno = utrace_serrno;					\
+	}								\
+} while (0)
+#else
+#  define UTRACE(a, b, c)
+#endif
+
+/* Whether encountered any invalid config options. */
+static bool had_conf_error = false;
+
+/******************************************************************************/
+/*
+ * Function prototypes for static functions that are referenced prior to
+ * definition.
+ */
+
+static bool	malloc_init_hard_a0(void);
+static bool	malloc_init_hard(void);
+
+/******************************************************************************/
+/*
+ * Begin miscellaneous support functions.
+ */
+
+bool
+malloc_initialized(void) {
+	return (malloc_init_state == malloc_init_initialized);
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+malloc_init_a0(void) {
+	if (unlikely(malloc_init_state == malloc_init_uninitialized)) {
+		return malloc_init_hard_a0();
+	}
+	return false;
+}
+
+JEMALLOC_ALWAYS_INLINE bool
+malloc_init(void) {
+	if (unlikely(!malloc_initialized()) && malloc_init_hard()) {
+		return true;
+	}
+	return false;
+}
+
+/*
+ * The a0*() functions are used instead of i{d,}alloc() in situations that
+ * cannot tolerate TLS variable access.
+ */
+
+static void *
+a0ialloc(size_t size, bool zero, bool is_internal) {
+	if (unlikely(malloc_init_a0())) {
+		return NULL;
+	}
+
+	return iallocztm(TSDN_NULL, size, sz_size2index(size), zero, NULL,
+	    is_internal, arena_get(TSDN_NULL, 0, true), true);
+}
+
+static void
+a0idalloc(void *ptr, bool is_internal) {
+	idalloctm(TSDN_NULL, ptr, NULL, NULL, is_internal, true);
+}
+
+void *
+a0malloc(size_t size) {
+	return a0ialloc(size, false, true);
+}
+
+void
+a0dalloc(void *ptr) {
+	a0idalloc(ptr, true);
+}
+
+/*
+ * FreeBSD's libc uses the bootstrap_*() functions in bootstrap-senstive
+ * situations that cannot tolerate TLS variable access (TLS allocation and very
+ * early internal data structure initialization).
+ */
+
+void *
+bootstrap_malloc(size_t size) {
+	if (unlikely(size == 0)) {
+		size = 1;
+	}
+
+	return a0ialloc(size, false, false);
+}
+
+void *
+bootstrap_calloc(size_t num, size_t size) {
+	size_t num_size;
+
+	num_size = num * size;
+	if (unlikely(num_size == 0)) {
+		assert(num == 0 || size == 0);
+		num_size = 1;
+	}
+
+	return a0ialloc(num_size, true, false);
+}
+
+void
+bootstrap_free(void *ptr) {
+	if (unlikely(ptr == NULL)) {
+		return;
+	}
+
+	a0idalloc(ptr, false);
+}
+
+void
+arena_set(unsigned ind, arena_t *arena) {
+	atomic_store_p(&arenas[ind], arena, ATOMIC_RELEASE);
+}
+
+static void
+narenas_total_set(unsigned narenas) {
+	atomic_store_u(&narenas_total, narenas, ATOMIC_RELEASE);
+}
+
+static void
+narenas_total_inc(void) {
+	atomic_fetch_add_u(&narenas_total, 1, ATOMIC_RELEASE);
+}
+
+unsigned
+narenas_total_get(void) {
+	return atomic_load_u(&narenas_total, ATOMIC_ACQUIRE);
+}
+
+/* Create a new arena and insert it into the arenas array at index ind. */
+static arena_t *
+arena_init_locked(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
+	arena_t *arena;
+
+	assert(ind <= narenas_total_get());
+	if (ind >= MALLOCX_ARENA_LIMIT) {
+		return NULL;
+	}
+	if (ind == narenas_total_get()) {
+		narenas_total_inc();
+	}
+
+	/*
+	 * Another thread may have already initialized arenas[ind] if it's an
+	 * auto arena.
+	 */
+	arena = arena_get(tsdn, ind, false);
+	if (arena != NULL) {
+		assert(ind < narenas_auto);
+		return arena;
+	}
+
+	/* Actually initialize the arena. */
+	arena = arena_new(tsdn, ind, extent_hooks);
+
+	return arena;
+}
+
+static void
+arena_new_create_background_thread(tsdn_t *tsdn, unsigned ind) {
+	if (ind == 0) {
+		return;
+	}
+	if (have_background_thread) {
+		bool err;
+		malloc_mutex_lock(tsdn, &background_thread_lock);
+		err = background_thread_create(tsdn_tsd(tsdn), ind);
+		malloc_mutex_unlock(tsdn, &background_thread_lock);
+		if (err) {
+			malloc_printf("<jemalloc>: error in background thread "
+				      "creation for arena %u. Abort.\n", ind);
+			abort();
+		}
+	}
+}
+
+arena_t *
+arena_init(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
+	arena_t *arena;
+
+	malloc_mutex_lock(tsdn, &arenas_lock);
+	arena = arena_init_locked(tsdn, ind, extent_hooks);
+	malloc_mutex_unlock(tsdn, &arenas_lock);
+
+	arena_new_create_background_thread(tsdn, ind);
+
+	return arena;
+}
+
+static void
+arena_bind(tsd_t *tsd, unsigned ind, bool internal) {
+	arena_t *arena = arena_get(tsd_tsdn(tsd), ind, false);
+	arena_nthreads_inc(arena, internal);
+
+	if (internal) {
+		tsd_iarena_set(tsd, arena);
+	} else {
+		tsd_arena_set(tsd, arena);
+	}
+}
+
+void
+arena_migrate(tsd_t *tsd, unsigned oldind, unsigned newind) {
+	arena_t *oldarena, *newarena;
+
+	oldarena = arena_get(tsd_tsdn(tsd), oldind, false);
+	newarena = arena_get(tsd_tsdn(tsd), newind, false);
+	arena_nthreads_dec(oldarena, false);
+	arena_nthreads_inc(newarena, false);
+	tsd_arena_set(tsd, newarena);
+}
+
+static void
+arena_unbind(tsd_t *tsd, unsigned ind, bool internal) {
+	arena_t *arena;
+
+	arena = arena_get(tsd_tsdn(tsd), ind, false);
+	arena_nthreads_dec(arena, internal);
+
+	if (internal) {
+		tsd_iarena_set(tsd, NULL);
+	} else {
+		tsd_arena_set(tsd, NULL);
+	}
+}
+
+arena_tdata_t *
+arena_tdata_get_hard(tsd_t *tsd, unsigned ind) {
+	arena_tdata_t *tdata, *arenas_tdata_old;
+	arena_tdata_t *arenas_tdata = tsd_arenas_tdata_get(tsd);
+	unsigned narenas_tdata_old, i;
+	unsigned narenas_tdata = tsd_narenas_tdata_get(tsd);
+	unsigned narenas_actual = narenas_total_get();
+
+	/*
+	 * Dissociate old tdata array (and set up for deallocation upon return)
+	 * if it's too small.
+	 */
+	if (arenas_tdata != NULL && narenas_tdata < narenas_actual) {
+		arenas_tdata_old = arenas_tdata;
+		narenas_tdata_old = narenas_tdata;
+		arenas_tdata = NULL;
+		narenas_tdata = 0;
+		tsd_arenas_tdata_set(tsd, arenas_tdata);
+		tsd_narenas_tdata_set(tsd, narenas_tdata);
+	} else {
+		arenas_tdata_old = NULL;
+		narenas_tdata_old = 0;
+	}
+
+	/* Allocate tdata array if it's missing. */
+	if (arenas_tdata == NULL) {
+		bool *arenas_tdata_bypassp = tsd_arenas_tdata_bypassp_get(tsd);
+		narenas_tdata = (ind < narenas_actual) ? narenas_actual : ind+1;
+
+		if (tsd_nominal(tsd) && !*arenas_tdata_bypassp) {
+			*arenas_tdata_bypassp = true;
+			arenas_tdata = (arena_tdata_t *)a0malloc(
+			    sizeof(arena_tdata_t) * narenas_tdata);
+			*arenas_tdata_bypassp = false;
+		}
+		if (arenas_tdata == NULL) {
+			tdata = NULL;
+			goto label_return;
+		}
+		assert(tsd_nominal(tsd) && !*arenas_tdata_bypassp);
+		tsd_arenas_tdata_set(tsd, arenas_tdata);
+		tsd_narenas_tdata_set(tsd, narenas_tdata);
+	}
+
+	/*
+	 * Copy to tdata array.  It's possible that the actual number of arenas
+	 * has increased since narenas_total_get() was called above, but that
+	 * causes no correctness issues unless two threads concurrently execute
+	 * the arenas.create mallctl, which we trust mallctl synchronization to
+	 * prevent.
+	 */
+
+	/* Copy/initialize tickers. */
+	for (i = 0; i < narenas_actual; i++) {
+		if (i < narenas_tdata_old) {
+			ticker_copy(&arenas_tdata[i].decay_ticker,
+			    &arenas_tdata_old[i].decay_ticker);
+		} else {
+			ticker_init(&arenas_tdata[i].decay_ticker,
+			    DECAY_NTICKS_PER_UPDATE);
+		}
+	}
+	if (narenas_tdata > narenas_actual) {
+		memset(&arenas_tdata[narenas_actual], 0, sizeof(arena_tdata_t)
+		    * (narenas_tdata - narenas_actual));
+	}
+
+	/* Read the refreshed tdata array. */
+	tdata = &arenas_tdata[ind];
+label_return:
+	if (arenas_tdata_old != NULL) {
+		a0dalloc(arenas_tdata_old);
+	}
+	return tdata;
+}
+
+/* Slow path, called only by arena_choose(). */
+arena_t *
+arena_choose_hard(tsd_t *tsd, bool internal) {
+	arena_t *ret JEMALLOC_CC_SILENCE_INIT(NULL);
+
+	if (have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena)) {
+		unsigned choose = percpu_arena_choose();
+		ret = arena_get(tsd_tsdn(tsd), choose, true);
+		assert(ret != NULL);
+		arena_bind(tsd, arena_ind_get(ret), false);
+		arena_bind(tsd, arena_ind_get(ret), true);
+
+		return ret;
+	}
+
+	if (narenas_auto > 1) {
+		unsigned i, j, choose[2], first_null;
+		bool is_new_arena[2];
+
+		/*
+		 * Determine binding for both non-internal and internal
+		 * allocation.
+		 *
+		 *   choose[0]: For application allocation.
+		 *   choose[1]: For internal metadata allocation.
+		 */
+
+		for (j = 0; j < 2; j++) {
+			choose[j] = 0;
+			is_new_arena[j] = false;
+		}
+
+		first_null = narenas_auto;
+		malloc_mutex_lock(tsd_tsdn(tsd), &arenas_lock);
+		assert(arena_get(tsd_tsdn(tsd), 0, false) != NULL);
+		for (i = 1; i < narenas_auto; i++) {
+			if (arena_get(tsd_tsdn(tsd), i, false) != NULL) {
+				/*
+				 * Choose the first arena that has the lowest
+				 * number of threads assigned to it.
+				 */
+				for (j = 0; j < 2; j++) {
+					if (arena_nthreads_get(arena_get(
+					    tsd_tsdn(tsd), i, false), !!j) <
+					    arena_nthreads_get(arena_get(
+					    tsd_tsdn(tsd), choose[j], false),
+					    !!j)) {
+						choose[j] = i;
+					}
+				}
+			} else if (first_null == narenas_auto) {
+				/*
+				 * Record the index of the first uninitialized
+				 * arena, in case all extant arenas are in use.
+				 *
+				 * NB: It is possible for there to be
+				 * discontinuities in terms of initialized
+				 * versus uninitialized arenas, due to the
+				 * "thread.arena" mallctl.
+				 */
+				first_null = i;
+			}
+		}
+
+		for (j = 0; j < 2; j++) {
+			if (arena_nthreads_get(arena_get(tsd_tsdn(tsd),
+			    choose[j], false), !!j) == 0 || first_null ==
+			    narenas_auto) {
+				/*
+				 * Use an unloaded arena, or the least loaded
+				 * arena if all arenas are already initialized.
+				 */
+				if (!!j == internal) {
+					ret = arena_get(tsd_tsdn(tsd),
+					    choose[j], false);
+				}
+			} else {
+				arena_t *arena;
+
+				/* Initialize a new arena. */
+				choose[j] = first_null;
+				arena = arena_init_locked(tsd_tsdn(tsd),
+				    choose[j],
+				    (extent_hooks_t *)&extent_hooks_default);
+				if (arena == NULL) {
+					malloc_mutex_unlock(tsd_tsdn(tsd),
+					    &arenas_lock);
+					return NULL;
+				}
+				is_new_arena[j] = true;
+				if (!!j == internal) {
+					ret = arena;
+				}
+			}
+			arena_bind(tsd, choose[j], !!j);
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &arenas_lock);
+
+		for (j = 0; j < 2; j++) {
+			if (is_new_arena[j]) {
+				assert(choose[j] > 0);
+				arena_new_create_background_thread(
+				    tsd_tsdn(tsd), choose[j]);
+			}
+		}
+
+	} else {
+		ret = arena_get(tsd_tsdn(tsd), 0, false);
+		arena_bind(tsd, 0, false);
+		arena_bind(tsd, 0, true);
+	}
+
+	return ret;
+}
+
+void
+iarena_cleanup(tsd_t *tsd) {
+	arena_t *iarena;
+
+	iarena = tsd_iarena_get(tsd);
+	if (iarena != NULL) {
+		arena_unbind(tsd, arena_ind_get(iarena), true);
+	}
+}
+
+void
+arena_cleanup(tsd_t *tsd) {
+	arena_t *arena;
+
+	arena = tsd_arena_get(tsd);
+	if (arena != NULL) {
+		arena_unbind(tsd, arena_ind_get(arena), false);
+	}
+}
+
+void
+arenas_tdata_cleanup(tsd_t *tsd) {
+	arena_tdata_t *arenas_tdata;
+
+	/* Prevent tsd->arenas_tdata from being (re)created. */
+	*tsd_arenas_tdata_bypassp_get(tsd) = true;
+
+	arenas_tdata = tsd_arenas_tdata_get(tsd);
+	if (arenas_tdata != NULL) {
+		tsd_arenas_tdata_set(tsd, NULL);
+		a0dalloc(arenas_tdata);
+	}
+}
+
+static void
+stats_print_atexit(void) {
+	if (config_stats) {
+		tsdn_t *tsdn;
+		unsigned narenas, i;
+
+		tsdn = tsdn_fetch();
+
+		/*
+		 * Merge stats from extant threads.  This is racy, since
+		 * individual threads do not lock when recording tcache stats
+		 * events.  As a consequence, the final stats may be slightly
+		 * out of date by the time they are reported, if other threads
+		 * continue to allocate.
+		 */
+		for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
+			arena_t *arena = arena_get(tsdn, i, false);
+			if (arena != NULL) {
+				tcache_t *tcache;
+
+				malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
+				ql_foreach(tcache, &arena->tcache_ql, link) {
+					tcache_stats_merge(tsdn, tcache, arena);
+				}
+				malloc_mutex_unlock(tsdn,
+				    &arena->tcache_ql_mtx);
+			}
+		}
+	}
+	je_malloc_stats_print(NULL, NULL, opt_stats_print_opts);
+}
+
+/*
+ * Ensure that we don't hold any locks upon entry to or exit from allocator
+ * code (in a "broad" sense that doesn't count a reentrant allocation as an
+ * entrance or exit).
+ */
+JEMALLOC_ALWAYS_INLINE void
+check_entry_exit_locking(tsdn_t *tsdn) {
+	if (!config_debug) {
+		return;
+	}
+	if (tsdn_null(tsdn)) {
+		return;
+	}
+	tsd_t *tsd = tsdn_tsd(tsdn);
+	/*
+	 * It's possible we hold locks at entry/exit if we're in a nested
+	 * allocation.
+	 */
+	int8_t reentrancy_level = tsd_reentrancy_level_get(tsd);
+	if (reentrancy_level != 0) {
+		return;
+	}
+	witness_assert_lockless(tsdn_witness_tsdp_get(tsdn));
+}
+
+/*
+ * End miscellaneous support functions.
+ */
+/******************************************************************************/
+/*
+ * Begin initialization functions.
+ */
+
+static char *
+jemalloc_secure_getenv(const char *name) {
+#ifdef JEMALLOC_HAVE_SECURE_GETENV
+	return secure_getenv(name);
+#else
+#  ifdef JEMALLOC_HAVE_ISSETUGID
+	if (issetugid() != 0) {
+		return NULL;
+	}
+#  endif
+	return getenv(name);
+#endif
+}
+
+static unsigned
+malloc_ncpus(void) {
+	long result;
+
+#ifdef _WIN32
+	SYSTEM_INFO si;
+	GetSystemInfo(&si);
+	result = si.dwNumberOfProcessors;
+#elif defined(JEMALLOC_GLIBC_MALLOC_HOOK) && defined(CPU_COUNT)
+	/*
+	 * glibc >= 2.6 has the CPU_COUNT macro.
+	 *
+	 * glibc's sysconf() uses isspace().  glibc allocates for the first time
+	 * *before* setting up the isspace tables.  Therefore we need a
+	 * different method to get the number of CPUs.
+	 */
+	{
+		cpu_set_t set;
+
+		pthread_getaffinity_np(pthread_self(), sizeof(set), &set);
+		result = CPU_COUNT(&set);
+	}
+#else
+	result = sysconf(_SC_NPROCESSORS_ONLN);
+#endif
+	return ((result == -1) ? 1 : (unsigned)result);
+}
+
+static void
+init_opt_stats_print_opts(const char *v, size_t vlen) {
+	size_t opts_len = strlen(opt_stats_print_opts);
+	assert(opts_len <= stats_print_tot_num_options);
+
+	for (size_t i = 0; i < vlen; i++) {
+		switch (v[i]) {
+#define OPTION(o, v, d, s) case o: break;
+			STATS_PRINT_OPTIONS
+#undef OPTION
+		default: continue;
+		}
+
+		if (strchr(opt_stats_print_opts, v[i]) != NULL) {
+			/* Ignore repeated. */
+			continue;
+		}
+
+		opt_stats_print_opts[opts_len++] = v[i];
+		opt_stats_print_opts[opts_len] = '\0';
+		assert(opts_len <= stats_print_tot_num_options);
+	}
+	assert(opts_len == strlen(opt_stats_print_opts));
+}
+
+static bool
+malloc_conf_next(char const **opts_p, char const **k_p, size_t *klen_p,
+    char const **v_p, size_t *vlen_p) {
+	bool accept;
+	const char *opts = *opts_p;
+
+	*k_p = opts;
+
+	for (accept = false; !accept;) {
+		switch (*opts) {
+		case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
+		case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
+		case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
+		case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
+		case 'Y': case 'Z':
+		case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
+		case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
+		case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
+		case 's': case 't': case 'u': case 'v': case 'w': case 'x':
+		case 'y': case 'z':
+		case '0': case '1': case '2': case '3': case '4': case '5':
+		case '6': case '7': case '8': case '9':
+		case '_':
+			opts++;
+			break;
+		case ':':
+			opts++;
+			*klen_p = (uintptr_t)opts - 1 - (uintptr_t)*k_p;
+			*v_p = opts;
+			accept = true;
+			break;
+		case '\0':
+			if (opts != *opts_p) {
+				malloc_write("<jemalloc>: Conf string ends "
+				    "with key\n");
+			}
+			return true;
+		default:
+			malloc_write("<jemalloc>: Malformed conf string\n");
+			return true;
+		}
+	}
+
+	for (accept = false; !accept;) {
+		switch (*opts) {
+		case ',':
+			opts++;
+			/*
+			 * Look ahead one character here, because the next time
+			 * this function is called, it will assume that end of
+			 * input has been cleanly reached if no input remains,
+			 * but we have optimistically already consumed the
+			 * comma if one exists.
+			 */
+			if (*opts == '\0') {
+				malloc_write("<jemalloc>: Conf string ends "
+				    "with comma\n");
+			}
+			*vlen_p = (uintptr_t)opts - 1 - (uintptr_t)*v_p;
+			accept = true;
+			break;
+		case '\0':
+			*vlen_p = (uintptr_t)opts - (uintptr_t)*v_p;
+			accept = true;
+			break;
+		default:
+			opts++;
+			break;
+		}
+	}
+
+	*opts_p = opts;
+	return false;
+}
+
+static void
+malloc_abort_invalid_conf(void) {
+	assert(opt_abort_conf);
+	malloc_printf("<jemalloc>: Abort (abort_conf:true) on invalid conf "
+	    "value (see above).\n");
+	abort();
+}
+
+static void
+malloc_conf_error(const char *msg, const char *k, size_t klen, const char *v,
+    size_t vlen) {
+	malloc_printf("<jemalloc>: %s: %.*s:%.*s\n", msg, (int)klen, k,
+	    (int)vlen, v);
+	/* If abort_conf is set, error out after processing all options. */
+	had_conf_error = true;
+}
+
+static void
+malloc_slow_flag_init(void) {
+	/*
+	 * Combine the runtime options into malloc_slow for fast path.  Called
+	 * after processing all the options.
+	 */
+	malloc_slow_flags |= (opt_junk_alloc ? flag_opt_junk_alloc : 0)
+	    | (opt_junk_free ? flag_opt_junk_free : 0)
+	    | (opt_zero ? flag_opt_zero : 0)
+	    | (opt_utrace ? flag_opt_utrace : 0)
+	    | (opt_xmalloc ? flag_opt_xmalloc : 0);
+
+	malloc_slow = (malloc_slow_flags != 0);
+}
+
+static void
+malloc_conf_init(void) {
+	unsigned i;
+	char buf[PATH_MAX + 1];
+	const char *opts, *k, *v;
+	size_t klen, vlen;
+
+	for (i = 0; i < 4; i++) {
+		/* Get runtime configuration. */
+		switch (i) {
+		case 0:
+			opts = config_malloc_conf;
+			break;
+		case 1:
+			if (je_malloc_conf != NULL) {
+				/*
+				 * Use options that were compiled into the
+				 * program.
+				 */
+				opts = je_malloc_conf;
+			} else {
+				/* No configuration specified. */
+				buf[0] = '\0';
+				opts = buf;
+			}
+			break;
+		case 2: {
+			ssize_t linklen = 0;
+#ifndef _WIN32
+			int saved_errno = errno;
+			const char *linkname =
+#  ifdef JEMALLOC_PREFIX
+			    "/etc/"JEMALLOC_PREFIX"malloc.conf"
+#  else
+			    "/etc/malloc.conf"
+#  endif
+			    ;
+
+			/*
+			 * Try to use the contents of the "/etc/malloc.conf"
+			 * symbolic link's name.
+			 */
+			linklen = readlink(linkname, buf, sizeof(buf) - 1);
+			if (linklen == -1) {
+				/* No configuration specified. */
+				linklen = 0;
+				/* Restore errno. */
+				set_errno(saved_errno);
+			}
+#endif
+			buf[linklen] = '\0';
+			opts = buf;
+			break;
+		} case 3: {
+			const char *envname =
+#ifdef JEMALLOC_PREFIX
+			    JEMALLOC_CPREFIX"MALLOC_CONF"
+#else
+			    "MALLOC_CONF"
+#endif
+			    ;
+
+			if ((opts = jemalloc_secure_getenv(envname)) != NULL) {
+				/*
+				 * Do nothing; opts is already initialized to
+				 * the value of the MALLOC_CONF environment
+				 * variable.
+				 */
+			} else {
+				/* No configuration specified. */
+				buf[0] = '\0';
+				opts = buf;
+			}
+			break;
+		} default:
+			not_reached();
+			buf[0] = '\0';
+			opts = buf;
+		}
+
+		while (*opts != '\0' && !malloc_conf_next(&opts, &k, &klen, &v,
+		    &vlen)) {
+#define CONF_MATCH(n)							\
+	(sizeof(n)-1 == klen && strncmp(n, k, klen) == 0)
+#define CONF_MATCH_VALUE(n)						\
+	(sizeof(n)-1 == vlen && strncmp(n, v, vlen) == 0)
+#define CONF_HANDLE_BOOL(o, n)						\
+			if (CONF_MATCH(n)) {				\
+				if (CONF_MATCH_VALUE("true")) {		\
+					o = true;			\
+				} else if (CONF_MATCH_VALUE("false")) {	\
+					o = false;			\
+				} else {				\
+					malloc_conf_error(		\
+					    "Invalid conf value",	\
+					    k, klen, v, vlen);		\
+				}					\
+				continue;				\
+			}
+#define CONF_MIN_no(um, min)	false
+#define CONF_MIN_yes(um, min)	((um) < (min))
+#define CONF_MAX_no(um, max)	false
+#define CONF_MAX_yes(um, max)	((um) > (max))
+#define CONF_HANDLE_T_U(t, o, n, min, max, check_min, check_max, clip)	\
+			if (CONF_MATCH(n)) {				\
+				uintmax_t um;				\
+				char *end;				\
+									\
+				set_errno(0);				\
+				um = malloc_strtoumax(v, &end, 0);	\
+				if (get_errno() != 0 || (uintptr_t)end -\
+				    (uintptr_t)v != vlen) {		\
+					malloc_conf_error(		\
+					    "Invalid conf value",	\
+					    k, klen, v, vlen);		\
+				} else if (clip) {			\
+					if (CONF_MIN_##check_min(um,	\
+					    (t)(min))) {		\
+						o = (t)(min);		\
+					} else if (			\
+					    CONF_MAX_##check_max(um,	\
+					    (t)(max))) {		\
+						o = (t)(max);		\
+					} else {			\
+						o = (t)um;		\
+					}				\
+				} else {				\
+					if (CONF_MIN_##check_min(um,	\
+					    (t)(min)) ||		\
+					    CONF_MAX_##check_max(um,	\
+					    (t)(max))) {		\
+						malloc_conf_error(	\
+						    "Out-of-range "	\
+						    "conf value",	\
+						    k, klen, v, vlen);	\
+					} else {			\
+						o = (t)um;		\
+					}				\
+				}					\
+				continue;				\
+			}
+#define CONF_HANDLE_UNSIGNED(o, n, min, max, check_min, check_max,	\
+    clip)								\
+			CONF_HANDLE_T_U(unsigned, o, n, min, max,	\
+			    check_min, check_max, clip)
+#define CONF_HANDLE_SIZE_T(o, n, min, max, check_min, check_max, clip)	\
+			CONF_HANDLE_T_U(size_t, o, n, min, max,		\
+			    check_min, check_max, clip)
+#define CONF_HANDLE_SSIZE_T(o, n, min, max)				\
+			if (CONF_MATCH(n)) {				\
+				long l;					\
+				char *end;				\
+									\
+				set_errno(0);				\
+				l = strtol(v, &end, 0);			\
+				if (get_errno() != 0 || (uintptr_t)end -\
+				    (uintptr_t)v != vlen) {		\
+					malloc_conf_error(		\
+					    "Invalid conf value",	\
+					    k, klen, v, vlen);		\
+				} else if (l < (ssize_t)(min) || l >	\
+				    (ssize_t)(max)) {			\
+					malloc_conf_error(		\
+					    "Out-of-range conf value",	\
+					    k, klen, v, vlen);		\
+				} else {				\
+					o = l;				\
+				}					\
+				continue;				\
+			}
+#define CONF_HANDLE_CHAR_P(o, n, d)					\
+			if (CONF_MATCH(n)) {				\
+				size_t cpylen = (vlen <=		\
+				    sizeof(o)-1) ? vlen :		\
+				    sizeof(o)-1;			\
+				strncpy(o, v, cpylen);			\
+				o[cpylen] = '\0';			\
+				continue;				\
+			}
+
+			CONF_HANDLE_BOOL(opt_abort, "abort")
+			CONF_HANDLE_BOOL(opt_abort_conf, "abort_conf")
+			if (strncmp("metadata_thp", k, klen) == 0) {
+				int i;
+				bool match = false;
+				for (i = 0; i < metadata_thp_mode_limit; i++) {
+					if (strncmp(metadata_thp_mode_names[i],
+					    v, vlen) == 0) {
+						opt_metadata_thp = i;
+						match = true;
+						break;
+					}
+				}
+				if (!match) {
+					malloc_conf_error("Invalid conf value",
+					    k, klen, v, vlen);
+				}
+				continue;
+			}
+			CONF_HANDLE_BOOL(opt_retain, "retain")
+			if (strncmp("dss", k, klen) == 0) {
+				int i;
+				bool match = false;
+				for (i = 0; i < dss_prec_limit; i++) {
+					if (strncmp(dss_prec_names[i], v, vlen)
+					    == 0) {
+						if (extent_dss_prec_set(i)) {
+							malloc_conf_error(
+							    "Error setting dss",
+							    k, klen, v, vlen);
+						} else {
+							opt_dss =
+							    dss_prec_names[i];
+							match = true;
+							break;
+						}
+					}
+				}
+				if (!match) {
+					malloc_conf_error("Invalid conf value",
+					    k, klen, v, vlen);
+				}
+				continue;
+			}
+			CONF_HANDLE_UNSIGNED(opt_narenas, "narenas", 1,
+			    UINT_MAX, yes, no, false)
+			CONF_HANDLE_SSIZE_T(opt_dirty_decay_ms,
+			    "dirty_decay_ms", -1, NSTIME_SEC_MAX * KQU(1000) <
+			    QU(SSIZE_MAX) ? NSTIME_SEC_MAX * KQU(1000) :
+			    SSIZE_MAX);
+			CONF_HANDLE_SSIZE_T(opt_muzzy_decay_ms,
+			    "muzzy_decay_ms", -1, NSTIME_SEC_MAX * KQU(1000) <
+			    QU(SSIZE_MAX) ? NSTIME_SEC_MAX * KQU(1000) :
+			    SSIZE_MAX);
+			CONF_HANDLE_BOOL(opt_stats_print, "stats_print")
+			if (CONF_MATCH("stats_print_opts")) {
+				init_opt_stats_print_opts(v, vlen);
+				continue;
+			}
+			if (config_fill) {
+				if (CONF_MATCH("junk")) {
+					if (CONF_MATCH_VALUE("true")) {
+						opt_junk = "true";
+						opt_junk_alloc = opt_junk_free =
+						    true;
+					} else if (CONF_MATCH_VALUE("false")) {
+						opt_junk = "false";
+						opt_junk_alloc = opt_junk_free =
+						    false;
+					} else if (CONF_MATCH_VALUE("alloc")) {
+						opt_junk = "alloc";
+						opt_junk_alloc = true;
+						opt_junk_free = false;
+					} else if (CONF_MATCH_VALUE("free")) {
+						opt_junk = "free";
+						opt_junk_alloc = false;
+						opt_junk_free = true;
+					} else {
+						malloc_conf_error(
+						    "Invalid conf value", k,
+						    klen, v, vlen);
+					}
+					continue;
+				}
+				CONF_HANDLE_BOOL(opt_zero, "zero")
+			}
+			if (config_utrace) {
+				CONF_HANDLE_BOOL(opt_utrace, "utrace")
+			}
+			if (config_xmalloc) {
+				CONF_HANDLE_BOOL(opt_xmalloc, "xmalloc")
+			}
+			CONF_HANDLE_BOOL(opt_tcache, "tcache")
+			CONF_HANDLE_SIZE_T(opt_lg_extent_max_active_fit,
+			    "lg_extent_max_active_fit", 0,
+			    (sizeof(size_t) << 3), yes, yes, false)
+			CONF_HANDLE_SSIZE_T(opt_lg_tcache_max, "lg_tcache_max",
+			    -1, (sizeof(size_t) << 3) - 1)
+			if (strncmp("percpu_arena", k, klen) == 0) {
+				bool match = false;
+				for (int i = percpu_arena_mode_names_base; i <
+				    percpu_arena_mode_names_limit; i++) {
+					if (strncmp(percpu_arena_mode_names[i],
+					    v, vlen) == 0) {
+						if (!have_percpu_arena) {
+							malloc_conf_error(
+							    "No getcpu support",
+							    k, klen, v, vlen);
+						}
+						opt_percpu_arena = i;
+						match = true;
+						break;
+					}
+				}
+				if (!match) {
+					malloc_conf_error("Invalid conf value",
+					    k, klen, v, vlen);
+				}
+				continue;
+			}
+			CONF_HANDLE_BOOL(opt_background_thread,
+			    "background_thread");
+			CONF_HANDLE_SIZE_T(opt_max_background_threads,
+					   "max_background_threads", 1,
+					   opt_max_background_threads, yes, yes,
+					   true);
+			if (config_prof) {
+				CONF_HANDLE_BOOL(opt_prof, "prof")
+				CONF_HANDLE_CHAR_P(opt_prof_prefix,
+				    "prof_prefix", "jeprof")
+				CONF_HANDLE_BOOL(opt_prof_active, "prof_active")
+				CONF_HANDLE_BOOL(opt_prof_thread_active_init,
+				    "prof_thread_active_init")
+				CONF_HANDLE_SIZE_T(opt_lg_prof_sample,
+				    "lg_prof_sample", 0, (sizeof(uint64_t) << 3)
+				    - 1, no, yes, true)
+				CONF_HANDLE_BOOL(opt_prof_accum, "prof_accum")
+				CONF_HANDLE_SSIZE_T(opt_lg_prof_interval,
+				    "lg_prof_interval", -1,
+				    (sizeof(uint64_t) << 3) - 1)
+				CONF_HANDLE_BOOL(opt_prof_gdump, "prof_gdump")
+				CONF_HANDLE_BOOL(opt_prof_final, "prof_final")
+				CONF_HANDLE_BOOL(opt_prof_leak, "prof_leak")
+			}
+			if (config_log) {
+				if (CONF_MATCH("log")) {
+					size_t cpylen = (
+					    vlen <= sizeof(log_var_names) ?
+					    vlen : sizeof(log_var_names) - 1);
+					strncpy(log_var_names, v, cpylen);
+					log_var_names[cpylen] = '\0';
+					continue;
+				}
+			}
+			if (CONF_MATCH("thp")) {
+				bool match = false;
+				for (int i = 0; i < thp_mode_names_limit; i++) {
+					if (strncmp(thp_mode_names[i],v, vlen)
+					    == 0) {
+						if (!have_madvise_huge) {
+							malloc_conf_error(
+							    "No THP support",
+							    k, klen, v, vlen);
+						}
+						opt_thp = i;
+						match = true;
+						break;
+					}
+				}
+				if (!match) {
+					malloc_conf_error("Invalid conf value",
+					    k, klen, v, vlen);
+				}
+				continue;
+			}
+			malloc_conf_error("Invalid conf pair", k, klen, v,
+			    vlen);
+#undef CONF_MATCH
+#undef CONF_MATCH_VALUE
+#undef CONF_HANDLE_BOOL
+#undef CONF_MIN_no
+#undef CONF_MIN_yes
+#undef CONF_MAX_no
+#undef CONF_MAX_yes
+#undef CONF_HANDLE_T_U
+#undef CONF_HANDLE_UNSIGNED
+#undef CONF_HANDLE_SIZE_T
+#undef CONF_HANDLE_SSIZE_T
+#undef CONF_HANDLE_CHAR_P
+		}
+		if (opt_abort_conf && had_conf_error) {
+			malloc_abort_invalid_conf();
+		}
+	}
+	atomic_store_b(&log_init_done, true, ATOMIC_RELEASE);
+}
+
+static bool
+malloc_init_hard_needed(void) {
+	if (malloc_initialized() || (IS_INITIALIZER && malloc_init_state ==
+	    malloc_init_recursible)) {
+		/*
+		 * Another thread initialized the allocator before this one
+		 * acquired init_lock, or this thread is the initializing
+		 * thread, and it is recursively allocating.
+		 */
+		return false;
+	}
+#ifdef JEMALLOC_THREADED_INIT
+	if (malloc_initializer != NO_INITIALIZER && !IS_INITIALIZER) {
+		/* Busy-wait until the initializing thread completes. */
+		spin_t spinner = SPIN_INITIALIZER;
+		do {
+			malloc_mutex_unlock(TSDN_NULL, &init_lock);
+			spin_adaptive(&spinner);
+			malloc_mutex_lock(TSDN_NULL, &init_lock);
+		} while (!malloc_initialized());
+		return false;
+	}
+#endif
+	return true;
+}
+
+static bool
+malloc_init_hard_a0_locked() {
+	malloc_initializer = INITIALIZER;
+
+	if (config_prof) {
+		prof_boot0();
+	}
+	malloc_conf_init();
+	if (opt_stats_print) {
+		/* Print statistics at exit. */
+		if (atexit(stats_print_atexit) != 0) {
+			malloc_write("<jemalloc>: Error in atexit()\n");
+			if (opt_abort) {
+				abort();
+			}
+		}
+	}
+	if (pages_boot()) {
+		return true;
+	}
+	if (base_boot(TSDN_NULL)) {
+		return true;
+	}
+	if (extent_boot()) {
+		return true;
+	}
+	if (ctl_boot()) {
+		return true;
+	}
+	if (config_prof) {
+		prof_boot1();
+	}
+	arena_boot();
+	if (tcache_boot(TSDN_NULL)) {
+		return true;
+	}
+	if (malloc_mutex_init(&arenas_lock, "arenas", WITNESS_RANK_ARENAS,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+	/*
+	 * Create enough scaffolding to allow recursive allocation in
+	 * malloc_ncpus().
+	 */
+	narenas_auto = 1;
+	memset(arenas, 0, sizeof(arena_t *) * narenas_auto);
+	/*
+	 * Initialize one arena here.  The rest are lazily created in
+	 * arena_choose_hard().
+	 */
+	if (arena_init(TSDN_NULL, 0, (extent_hooks_t *)&extent_hooks_default)
+	    == NULL) {
+		return true;
+	}
+	a0 = arena_get(TSDN_NULL, 0, false);
+	malloc_init_state = malloc_init_a0_initialized;
+
+	return false;
+}
+
+static bool
+malloc_init_hard_a0(void) {
+	bool ret;
+
+	malloc_mutex_lock(TSDN_NULL, &init_lock);
+	ret = malloc_init_hard_a0_locked();
+	malloc_mutex_unlock(TSDN_NULL, &init_lock);
+	return ret;
+}
+
+/* Initialize data structures which may trigger recursive allocation. */
+static bool
+malloc_init_hard_recursible(void) {
+	malloc_init_state = malloc_init_recursible;
+
+	ncpus = malloc_ncpus();
+
+#if (defined(JEMALLOC_HAVE_PTHREAD_ATFORK) && !defined(JEMALLOC_MUTEX_INIT_CB) \
+    && !defined(JEMALLOC_ZONE) && !defined(_WIN32) && \
+    !defined(__native_client__))
+	/* LinuxThreads' pthread_atfork() allocates. */
+	if (pthread_atfork(jemalloc_prefork, jemalloc_postfork_parent,
+	    jemalloc_postfork_child) != 0) {
+		malloc_write("<jemalloc>: Error in pthread_atfork()\n");
+		if (opt_abort) {
+			abort();
+		}
+		return true;
+	}
+#endif
+
+	if (background_thread_boot0()) {
+		return true;
+	}
+
+	return false;
+}
+
+static unsigned
+malloc_narenas_default(void) {
+	assert(ncpus > 0);
+	/*
+	 * For SMP systems, create more than one arena per CPU by
+	 * default.
+	 */
+	if (ncpus > 1) {
+		return ncpus << 2;
+	} else {
+		return 1;
+	}
+}
+
+static percpu_arena_mode_t
+percpu_arena_as_initialized(percpu_arena_mode_t mode) {
+	assert(!malloc_initialized());
+	assert(mode <= percpu_arena_disabled);
+
+	if (mode != percpu_arena_disabled) {
+		mode += percpu_arena_mode_enabled_base;
+	}
+
+	return mode;
+}
+
+static bool
+malloc_init_narenas(void) {
+	assert(ncpus > 0);
+
+	if (opt_percpu_arena != percpu_arena_disabled) {
+		if (!have_percpu_arena || malloc_getcpu() < 0) {
+			opt_percpu_arena = percpu_arena_disabled;
+			malloc_printf("<jemalloc>: perCPU arena getcpu() not "
+			    "available. Setting narenas to %u.\n", opt_narenas ?
+			    opt_narenas : malloc_narenas_default());
+			if (opt_abort) {
+				abort();
+			}
+		} else {
+			if (ncpus >= MALLOCX_ARENA_LIMIT) {
+				malloc_printf("<jemalloc>: narenas w/ percpu"
+				    "arena beyond limit (%d)\n", ncpus);
+				if (opt_abort) {
+					abort();
+				}
+				return true;
+			}
+			/* NB: opt_percpu_arena isn't fully initialized yet. */
+			if (percpu_arena_as_initialized(opt_percpu_arena) ==
+			    per_phycpu_arena && ncpus % 2 != 0) {
+				malloc_printf("<jemalloc>: invalid "
+				    "configuration -- per physical CPU arena "
+				    "with odd number (%u) of CPUs (no hyper "
+				    "threading?).\n", ncpus);
+				if (opt_abort)
+					abort();
+			}
+			unsigned n = percpu_arena_ind_limit(
+			    percpu_arena_as_initialized(opt_percpu_arena));
+			if (opt_narenas < n) {
+				/*
+				 * If narenas is specified with percpu_arena
+				 * enabled, actual narenas is set as the greater
+				 * of the two. percpu_arena_choose will be free
+				 * to use any of the arenas based on CPU
+				 * id. This is conservative (at a small cost)
+				 * but ensures correctness.
+				 *
+				 * If for some reason the ncpus determined at
+				 * boot is not the actual number (e.g. because
+				 * of affinity setting from numactl), reserving
+				 * narenas this way provides a workaround for
+				 * percpu_arena.
+				 */
+				opt_narenas = n;
+			}
+		}
+	}
+	if (opt_narenas == 0) {
+		opt_narenas = malloc_narenas_default();
+	}
+	assert(opt_narenas > 0);
+
+	narenas_auto = opt_narenas;
+	/*
+	 * Limit the number of arenas to the indexing range of MALLOCX_ARENA().
+	 */
+	if (narenas_auto >= MALLOCX_ARENA_LIMIT) {
+		narenas_auto = MALLOCX_ARENA_LIMIT - 1;
+		malloc_printf("<jemalloc>: Reducing narenas to limit (%d)\n",
+		    narenas_auto);
+	}
+	narenas_total_set(narenas_auto);
+
+	return false;
+}
+
+static void
+malloc_init_percpu(void) {
+	opt_percpu_arena = percpu_arena_as_initialized(opt_percpu_arena);
+}
+
+static bool
+malloc_init_hard_finish(void) {
+	if (malloc_mutex_boot()) {
+		return true;
+	}
+
+	malloc_init_state = malloc_init_initialized;
+	malloc_slow_flag_init();
+
+	return false;
+}
+
+static void
+malloc_init_hard_cleanup(tsdn_t *tsdn, bool reentrancy_set) {
+	malloc_mutex_assert_owner(tsdn, &init_lock);
+	malloc_mutex_unlock(tsdn, &init_lock);
+	if (reentrancy_set) {
+		assert(!tsdn_null(tsdn));
+		tsd_t *tsd = tsdn_tsd(tsdn);
+		assert(tsd_reentrancy_level_get(tsd) > 0);
+		post_reentrancy(tsd);
+	}
+}
+
+static bool
+malloc_init_hard(void) {
+	tsd_t *tsd;
+
+#if defined(_WIN32) && _WIN32_WINNT < 0x0600
+	_init_init_lock();
+#endif
+	malloc_mutex_lock(TSDN_NULL, &init_lock);
+
+#define UNLOCK_RETURN(tsdn, ret, reentrancy)		\
+	malloc_init_hard_cleanup(tsdn, reentrancy);	\
+	return ret;
+
+	if (!malloc_init_hard_needed()) {
+		UNLOCK_RETURN(TSDN_NULL, false, false)
+	}
+
+	if (malloc_init_state != malloc_init_a0_initialized &&
+	    malloc_init_hard_a0_locked()) {
+		UNLOCK_RETURN(TSDN_NULL, true, false)
+	}
+
+	malloc_mutex_unlock(TSDN_NULL, &init_lock);
+	/* Recursive allocation relies on functional tsd. */
+	tsd = malloc_tsd_boot0();
+	if (tsd == NULL) {
+		return true;
+	}
+	if (malloc_init_hard_recursible()) {
+		return true;
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &init_lock);
+	/* Set reentrancy level to 1 during init. */
+	pre_reentrancy(tsd, NULL);
+	/* Initialize narenas before prof_boot2 (for allocation). */
+	if (malloc_init_narenas() || background_thread_boot1(tsd_tsdn(tsd))) {
+		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
+	}
+	if (config_prof && prof_boot2(tsd)) {
+		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
+	}
+
+	malloc_init_percpu();
+
+	if (malloc_init_hard_finish()) {
+		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
+	}
+	post_reentrancy(tsd);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &init_lock);
+
+	witness_assert_lockless(witness_tsd_tsdn(
+	    tsd_witness_tsdp_get_unsafe(tsd)));
+	malloc_tsd_boot1();
+	/* Update TSD after tsd_boot1. */
+	tsd = tsd_fetch();
+	if (opt_background_thread) {
+		assert(have_background_thread);
+		/*
+		 * Need to finish init & unlock first before creating background
+		 * threads (pthread_create depends on malloc).  ctl_init (which
+		 * sets isthreaded) needs to be called without holding any lock.
+		 */
+		background_thread_ctl_init(tsd_tsdn(tsd));
+
+		malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
+		bool err = background_thread_create(tsd, 0);
+		malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
+		if (err) {
+			return true;
+		}
+	}
+#undef UNLOCK_RETURN
+	return false;
+}
+
+/*
+ * End initialization functions.
+ */
+/******************************************************************************/
+/*
+ * Begin allocation-path internal functions and data structures.
+ */
+
+/*
+ * Settings determined by the documented behavior of the allocation functions.
+ */
+typedef struct static_opts_s static_opts_t;
+struct static_opts_s {
+	/* Whether or not allocation size may overflow. */
+	bool may_overflow;
+	/* Whether or not allocations of size 0 should be treated as size 1. */
+	bool bump_empty_alloc;
+	/*
+	 * Whether to assert that allocations are not of size 0 (after any
+	 * bumping).
+	 */
+	bool assert_nonempty_alloc;
+
+	/*
+	 * Whether or not to modify the 'result' argument to malloc in case of
+	 * error.
+	 */
+	bool null_out_result_on_error;
+	/* Whether to set errno when we encounter an error condition. */
+	bool set_errno_on_error;
+
+	/*
+	 * The minimum valid alignment for functions requesting aligned storage.
+	 */
+	size_t min_alignment;
+
+	/* The error string to use if we oom. */
+	const char *oom_string;
+	/* The error string to use if the passed-in alignment is invalid. */
+	const char *invalid_alignment_string;
+
+	/*
+	 * False if we're configured to skip some time-consuming operations.
+	 *
+	 * This isn't really a malloc "behavior", but it acts as a useful
+	 * summary of several other static (or at least, static after program
+	 * initialization) options.
+	 */
+	bool slow;
+};
+
+JEMALLOC_ALWAYS_INLINE void
+static_opts_init(static_opts_t *static_opts) {
+	static_opts->may_overflow = false;
+	static_opts->bump_empty_alloc = false;
+	static_opts->assert_nonempty_alloc = false;
+	static_opts->null_out_result_on_error = false;
+	static_opts->set_errno_on_error = false;
+	static_opts->min_alignment = 0;
+	static_opts->oom_string = "";
+	static_opts->invalid_alignment_string = "";
+	static_opts->slow = false;
+}
+
+/*
+ * These correspond to the macros in jemalloc/jemalloc_macros.h.  Broadly, we
+ * should have one constant here per magic value there.  Note however that the
+ * representations need not be related.
+ */
+#define TCACHE_IND_NONE ((unsigned)-1)
+#define TCACHE_IND_AUTOMATIC ((unsigned)-2)
+#define ARENA_IND_AUTOMATIC ((unsigned)-1)
+
+typedef struct dynamic_opts_s dynamic_opts_t;
+struct dynamic_opts_s {
+	void **result;
+	size_t num_items;
+	size_t item_size;
+	size_t alignment;
+	bool zero;
+	unsigned tcache_ind;
+	unsigned arena_ind;
+};
+
+JEMALLOC_ALWAYS_INLINE void
+dynamic_opts_init(dynamic_opts_t *dynamic_opts) {
+	dynamic_opts->result = NULL;
+	dynamic_opts->num_items = 0;
+	dynamic_opts->item_size = 0;
+	dynamic_opts->alignment = 0;
+	dynamic_opts->zero = false;
+	dynamic_opts->tcache_ind = TCACHE_IND_AUTOMATIC;
+	dynamic_opts->arena_ind = ARENA_IND_AUTOMATIC;
+}
+
+/* ind is ignored if dopts->alignment > 0. */
+JEMALLOC_ALWAYS_INLINE void *
+imalloc_no_sample(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd,
+    size_t size, size_t usize, szind_t ind) {
+	tcache_t *tcache;
+	arena_t *arena;
+
+	/* Fill in the tcache. */
+	if (dopts->tcache_ind == TCACHE_IND_AUTOMATIC) {
+		if (likely(!sopts->slow)) {
+			/* Getting tcache ptr unconditionally. */
+			tcache = tsd_tcachep_get(tsd);
+			assert(tcache == tcache_get(tsd));
+		} else {
+			tcache = tcache_get(tsd);
+		}
+	} else if (dopts->tcache_ind == TCACHE_IND_NONE) {
+		tcache = NULL;
+	} else {
+		tcache = tcaches_get(tsd, dopts->tcache_ind);
+	}
+
+	/* Fill in the arena. */
+	if (dopts->arena_ind == ARENA_IND_AUTOMATIC) {
+		/*
+		 * In case of automatic arena management, we defer arena
+		 * computation until as late as we can, hoping to fill the
+		 * allocation out of the tcache.
+		 */
+		arena = NULL;
+	} else {
+		arena = arena_get(tsd_tsdn(tsd), dopts->arena_ind, true);
+	}
+
+	if (unlikely(dopts->alignment != 0)) {
+		return ipalloct(tsd_tsdn(tsd), usize, dopts->alignment,
+		    dopts->zero, tcache, arena);
+	}
+
+	return iallocztm(tsd_tsdn(tsd), size, ind, dopts->zero, tcache, false,
+	    arena, sopts->slow);
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+imalloc_sample(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd,
+    size_t usize, szind_t ind) {
+	void *ret;
+
+	/*
+	 * For small allocations, sampling bumps the usize.  If so, we allocate
+	 * from the ind_large bucket.
+	 */
+	szind_t ind_large;
+	size_t bumped_usize = usize;
+
+	if (usize <= SMALL_MAXCLASS) {
+		assert(((dopts->alignment == 0) ? sz_s2u(LARGE_MINCLASS) :
+		    sz_sa2u(LARGE_MINCLASS, dopts->alignment))
+		    == LARGE_MINCLASS);
+		ind_large = sz_size2index(LARGE_MINCLASS);
+		bumped_usize = sz_s2u(LARGE_MINCLASS);
+		ret = imalloc_no_sample(sopts, dopts, tsd, bumped_usize,
+		    bumped_usize, ind_large);
+		if (unlikely(ret == NULL)) {
+			return NULL;
+		}
+		arena_prof_promote(tsd_tsdn(tsd), ret, usize);
+	} else {
+		ret = imalloc_no_sample(sopts, dopts, tsd, usize, usize, ind);
+	}
+
+	return ret;
+}
+
+/*
+ * Returns true if the allocation will overflow, and false otherwise.  Sets
+ * *size to the product either way.
+ */
+JEMALLOC_ALWAYS_INLINE bool
+compute_size_with_overflow(bool may_overflow, dynamic_opts_t *dopts,
+    size_t *size) {
+	/*
+	 * This function is just num_items * item_size, except that we may have
+	 * to check for overflow.
+	 */
+
+	if (!may_overflow) {
+		assert(dopts->num_items == 1);
+		*size = dopts->item_size;
+		return false;
+	}
+
+	/* A size_t with its high-half bits all set to 1. */
+	static const size_t high_bits = SIZE_T_MAX << (sizeof(size_t) * 8 / 2);
+
+	*size = dopts->item_size * dopts->num_items;
+
+	if (unlikely(*size == 0)) {
+		return (dopts->num_items != 0 && dopts->item_size != 0);
+	}
+
+	/*
+	 * We got a non-zero size, but we don't know if we overflowed to get
+	 * there.  To avoid having to do a divide, we'll be clever and note that
+	 * if both A and B can be represented in N/2 bits, then their product
+	 * can be represented in N bits (without the possibility of overflow).
+	 */
+	if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
+		return false;
+	}
+	if (likely(*size / dopts->item_size == dopts->num_items)) {
+		return false;
+	}
+	return true;
+}
+
+JEMALLOC_ALWAYS_INLINE int
+imalloc_body(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd) {
+	/* Where the actual allocated memory will live. */
+	void *allocation = NULL;
+	/* Filled in by compute_size_with_overflow below. */
+	size_t size = 0;
+	/*
+	 * For unaligned allocations, we need only ind.  For aligned
+	 * allocations, or in case of stats or profiling we need usize.
+	 *
+	 * These are actually dead stores, in that their values are reset before
+	 * any branch on their value is taken.  Sometimes though, it's
+	 * convenient to pass them as arguments before this point.  To avoid
+	 * undefined behavior then, we initialize them with dummy stores.
+	 */
+	szind_t ind = 0;
+	size_t usize = 0;
+
+	/* Reentrancy is only checked on slow path. */
+	int8_t reentrancy_level;
+
+	/* Compute the amount of memory the user wants. */
+	if (unlikely(compute_size_with_overflow(sopts->may_overflow, dopts,
+	    &size))) {
+		goto label_oom;
+	}
+
+	/* Validate the user input. */
+	if (sopts->bump_empty_alloc) {
+		if (unlikely(size == 0)) {
+			size = 1;
+		}
+	}
+
+	if (sopts->assert_nonempty_alloc) {
+		assert (size != 0);
+	}
+
+	if (unlikely(dopts->alignment < sopts->min_alignment
+	    || (dopts->alignment & (dopts->alignment - 1)) != 0)) {
+		goto label_invalid_alignment;
+	}
+
+	/* This is the beginning of the "core" algorithm. */
+
+	if (dopts->alignment == 0) {
+		ind = sz_size2index(size);
+		if (unlikely(ind >= NSIZES)) {
+			goto label_oom;
+		}
+		if (config_stats || (config_prof && opt_prof)) {
+			usize = sz_index2size(ind);
+			assert(usize > 0 && usize <= LARGE_MAXCLASS);
+		}
+	} else {
+		usize = sz_sa2u(size, dopts->alignment);
+		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+			goto label_oom;
+		}
+	}
+
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	/*
+	 * If we need to handle reentrancy, we can do it out of a
+	 * known-initialized arena (i.e. arena 0).
+	 */
+	reentrancy_level = tsd_reentrancy_level_get(tsd);
+	if (sopts->slow && unlikely(reentrancy_level > 0)) {
+		/*
+		 * We should never specify particular arenas or tcaches from
+		 * within our internal allocations.
+		 */
+		assert(dopts->tcache_ind == TCACHE_IND_AUTOMATIC ||
+		    dopts->tcache_ind == TCACHE_IND_NONE);
+		assert(dopts->arena_ind == ARENA_IND_AUTOMATIC);
+		dopts->tcache_ind = TCACHE_IND_NONE;
+		/* We know that arena 0 has already been initialized. */
+		dopts->arena_ind = 0;
+	}
+
+	/* If profiling is on, get our profiling context. */
+	if (config_prof && opt_prof) {
+		/*
+		 * Note that if we're going down this path, usize must have been
+		 * initialized in the previous if statement.
+		 */
+		prof_tctx_t *tctx = prof_alloc_prep(
+		    tsd, usize, prof_active_get_unlocked(), true);
+
+		alloc_ctx_t alloc_ctx;
+		if (likely((uintptr_t)tctx == (uintptr_t)1U)) {
+			alloc_ctx.slab = (usize <= SMALL_MAXCLASS);
+			allocation = imalloc_no_sample(
+			    sopts, dopts, tsd, usize, usize, ind);
+		} else if ((uintptr_t)tctx > (uintptr_t)1U) {
+			/*
+			 * Note that ind might still be 0 here.  This is fine;
+			 * imalloc_sample ignores ind if dopts->alignment > 0.
+			 */
+			allocation = imalloc_sample(
+			    sopts, dopts, tsd, usize, ind);
+			alloc_ctx.slab = false;
+		} else {
+			allocation = NULL;
+		}
+
+		if (unlikely(allocation == NULL)) {
+			prof_alloc_rollback(tsd, tctx, true);
+			goto label_oom;
+		}
+		prof_malloc(tsd_tsdn(tsd), allocation, usize, &alloc_ctx, tctx);
+	} else {
+		/*
+		 * If dopts->alignment > 0, then ind is still 0, but usize was
+		 * computed in the previous if statement.  Down the positive
+		 * alignment path, imalloc_no_sample ignores ind and size
+		 * (relying only on usize).
+		 */
+		allocation = imalloc_no_sample(sopts, dopts, tsd, size, usize,
+		    ind);
+		if (unlikely(allocation == NULL)) {
+			goto label_oom;
+		}
+	}
+
+	/*
+	 * Allocation has been done at this point.  We still have some
+	 * post-allocation work to do though.
+	 */
+	assert(dopts->alignment == 0
+	    || ((uintptr_t)allocation & (dopts->alignment - 1)) == ZU(0));
+
+	if (config_stats) {
+		assert(usize == isalloc(tsd_tsdn(tsd), allocation));
+		*tsd_thread_allocatedp_get(tsd) += usize;
+	}
+
+	if (sopts->slow) {
+		UTRACE(0, size, allocation);
+	}
+
+	/* Success! */
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	*dopts->result = allocation;
+	return 0;
+
+label_oom:
+	if (unlikely(sopts->slow) && config_xmalloc && unlikely(opt_xmalloc)) {
+		malloc_write(sopts->oom_string);
+		abort();
+	}
+
+	if (sopts->slow) {
+		UTRACE(NULL, size, NULL);
+	}
+
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	if (sopts->set_errno_on_error) {
+		set_errno(ENOMEM);
+	}
+
+	if (sopts->null_out_result_on_error) {
+		*dopts->result = NULL;
+	}
+
+	return ENOMEM;
+
+	/*
+	 * This label is only jumped to by one goto; we move it out of line
+	 * anyways to avoid obscuring the non-error paths, and for symmetry with
+	 * the oom case.
+	 */
+label_invalid_alignment:
+	if (config_xmalloc && unlikely(opt_xmalloc)) {
+		malloc_write(sopts->invalid_alignment_string);
+		abort();
+	}
+
+	if (sopts->set_errno_on_error) {
+		set_errno(EINVAL);
+	}
+
+	if (sopts->slow) {
+		UTRACE(NULL, size, NULL);
+	}
+
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	if (sopts->null_out_result_on_error) {
+		*dopts->result = NULL;
+	}
+
+	return EINVAL;
+}
+
+/* Returns the errno-style error code of the allocation. */
+JEMALLOC_ALWAYS_INLINE int
+imalloc(static_opts_t *sopts, dynamic_opts_t *dopts) {
+	if (unlikely(!malloc_initialized()) && unlikely(malloc_init())) {
+		if (config_xmalloc && unlikely(opt_xmalloc)) {
+			malloc_write(sopts->oom_string);
+			abort();
+		}
+		UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
+		set_errno(ENOMEM);
+		*dopts->result = NULL;
+
+		return ENOMEM;
+	}
+
+	/* We always need the tsd.  Let's grab it right away. */
+	tsd_t *tsd = tsd_fetch();
+	assert(tsd);
+	if (likely(tsd_fast(tsd))) {
+		/* Fast and common path. */
+		tsd_assert_fast(tsd);
+		sopts->slow = false;
+		return imalloc_body(sopts, dopts, tsd);
+	} else {
+		sopts->slow = true;
+		return imalloc_body(sopts, dopts, tsd);
+	}
+}
+/******************************************************************************/
+/*
+ * Begin malloc(3)-compatible functions.
+ */
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1)
+je_malloc(size_t size) {
+	void *ret;
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.malloc.entry", "size: %zu", size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.bump_empty_alloc = true;
+	sopts.null_out_result_on_error = true;
+	sopts.set_errno_on_error = true;
+	sopts.oom_string = "<jemalloc>: Error in malloc(): out of memory\n";
+
+	dopts.result = &ret;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.malloc.exit", "result: %p", ret);
+
+	return ret;
+}
+
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW
+JEMALLOC_ATTR(nonnull(1))
+je_posix_memalign(void **memptr, size_t alignment, size_t size) {
+	int ret;
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.posix_memalign.entry", "mem ptr: %p, alignment: %zu, "
+	    "size: %zu", memptr, alignment, size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.bump_empty_alloc = true;
+	sopts.min_alignment = sizeof(void *);
+	sopts.oom_string =
+	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
+	sopts.invalid_alignment_string =
+	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
+
+	dopts.result = memptr;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+	dopts.alignment = alignment;
+
+	ret = imalloc(&sopts, &dopts);
+
+	LOG("core.posix_memalign.exit", "result: %d, alloc ptr: %p", ret,
+	    *memptr);
+
+	return ret;
+}
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(2)
+je_aligned_alloc(size_t alignment, size_t size) {
+	void *ret;
+
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.aligned_alloc.entry", "alignment: %zu, size: %zu\n",
+	    alignment, size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.bump_empty_alloc = true;
+	sopts.null_out_result_on_error = true;
+	sopts.set_errno_on_error = true;
+	sopts.min_alignment = 1;
+	sopts.oom_string =
+	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
+	sopts.invalid_alignment_string =
+	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
+
+	dopts.result = &ret;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+	dopts.alignment = alignment;
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.aligned_alloc.exit", "result: %p", ret);
+
+	return ret;
+}
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE2(1, 2)
+je_calloc(size_t num, size_t size) {
+	void *ret;
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.calloc.entry", "num: %zu, size: %zu\n", num, size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.may_overflow = true;
+	sopts.bump_empty_alloc = true;
+	sopts.null_out_result_on_error = true;
+	sopts.set_errno_on_error = true;
+	sopts.oom_string = "<jemalloc>: Error in calloc(): out of memory\n";
+
+	dopts.result = &ret;
+	dopts.num_items = num;
+	dopts.item_size = size;
+	dopts.zero = true;
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.calloc.exit", "result: %p", ret);
+
+	return ret;
+}
+
+static void *
+irealloc_prof_sample(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t usize,
+    prof_tctx_t *tctx) {
+	void *p;
+
+	if (tctx == NULL) {
+		return NULL;
+	}
+	if (usize <= SMALL_MAXCLASS) {
+		p = iralloc(tsd, old_ptr, old_usize, LARGE_MINCLASS, 0, false);
+		if (p == NULL) {
+			return NULL;
+		}
+		arena_prof_promote(tsd_tsdn(tsd), p, usize);
+	} else {
+		p = iralloc(tsd, old_ptr, old_usize, usize, 0, false);
+	}
+
+	return p;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+irealloc_prof(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t usize,
+   alloc_ctx_t *alloc_ctx) {
+	void *p;
+	bool prof_active;
+	prof_tctx_t *old_tctx, *tctx;
+
+	prof_active = prof_active_get_unlocked();
+	old_tctx = prof_tctx_get(tsd_tsdn(tsd), old_ptr, alloc_ctx);
+	tctx = prof_alloc_prep(tsd, usize, prof_active, true);
+	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
+		p = irealloc_prof_sample(tsd, old_ptr, old_usize, usize, tctx);
+	} else {
+		p = iralloc(tsd, old_ptr, old_usize, usize, 0, false);
+	}
+	if (unlikely(p == NULL)) {
+		prof_alloc_rollback(tsd, tctx, true);
+		return NULL;
+	}
+	prof_realloc(tsd, p, usize, tctx, prof_active, true, old_ptr, old_usize,
+	    old_tctx);
+
+	return p;
+}
+
+JEMALLOC_ALWAYS_INLINE void
+ifree(tsd_t *tsd, void *ptr, tcache_t *tcache, bool slow_path) {
+	if (!slow_path) {
+		tsd_assert_fast(tsd);
+	}
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	if (tsd_reentrancy_level_get(tsd) != 0) {
+		assert(slow_path);
+	}
+
+	assert(ptr != NULL);
+	assert(malloc_initialized() || IS_INITIALIZER);
+
+	alloc_ctx_t alloc_ctx;
+	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+	assert(alloc_ctx.szind != NSIZES);
+
+	size_t usize;
+	if (config_prof && opt_prof) {
+		usize = sz_index2size(alloc_ctx.szind);
+		prof_free(tsd, ptr, usize, &alloc_ctx);
+	} else if (config_stats) {
+		usize = sz_index2size(alloc_ctx.szind);
+	}
+	if (config_stats) {
+		*tsd_thread_deallocatedp_get(tsd) += usize;
+	}
+
+	if (likely(!slow_path)) {
+		idalloctm(tsd_tsdn(tsd), ptr, tcache, &alloc_ctx, false,
+		    false);
+	} else {
+		idalloctm(tsd_tsdn(tsd), ptr, tcache, &alloc_ctx, false,
+		    true);
+	}
+}
+
+JEMALLOC_ALWAYS_INLINE void
+isfree(tsd_t *tsd, void *ptr, size_t usize, tcache_t *tcache, bool slow_path) {
+	if (!slow_path) {
+		tsd_assert_fast(tsd);
+	}
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	if (tsd_reentrancy_level_get(tsd) != 0) {
+		assert(slow_path);
+	}
+
+	assert(ptr != NULL);
+	assert(malloc_initialized() || IS_INITIALIZER);
+
+	alloc_ctx_t alloc_ctx, *ctx;
+	if (!config_cache_oblivious && ((uintptr_t)ptr & PAGE_MASK) != 0) {
+		/*
+		 * When cache_oblivious is disabled and ptr is not page aligned,
+		 * the allocation was not sampled -- usize can be used to
+		 * determine szind directly.
+		 */
+		alloc_ctx.szind = sz_size2index(usize);
+		alloc_ctx.slab = true;
+		ctx = &alloc_ctx;
+		if (config_debug) {
+			alloc_ctx_t dbg_ctx;
+			rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+			rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree,
+			    rtree_ctx, (uintptr_t)ptr, true, &dbg_ctx.szind,
+			    &dbg_ctx.slab);
+			assert(dbg_ctx.szind == alloc_ctx.szind);
+			assert(dbg_ctx.slab == alloc_ctx.slab);
+		}
+	} else if (config_prof && opt_prof) {
+		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+		assert(alloc_ctx.szind == sz_size2index(usize));
+		ctx = &alloc_ctx;
+	} else {
+		ctx = NULL;
+	}
+
+	if (config_prof && opt_prof) {
+		prof_free(tsd, ptr, usize, ctx);
+	}
+	if (config_stats) {
+		*tsd_thread_deallocatedp_get(tsd) += usize;
+	}
+
+	if (likely(!slow_path)) {
+		isdalloct(tsd_tsdn(tsd), ptr, usize, tcache, ctx, false);
+	} else {
+		isdalloct(tsd_tsdn(tsd), ptr, usize, tcache, ctx, true);
+	}
+}
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ALLOC_SIZE(2)
+je_realloc(void *ptr, size_t size) {
+	void *ret;
+	tsdn_t *tsdn JEMALLOC_CC_SILENCE_INIT(NULL);
+	size_t usize JEMALLOC_CC_SILENCE_INIT(0);
+	size_t old_usize = 0;
+
+	LOG("core.realloc.entry", "ptr: %p, size: %zu\n", ptr, size);
+
+	if (unlikely(size == 0)) {
+		if (ptr != NULL) {
+			/* realloc(ptr, 0) is equivalent to free(ptr). */
+			UTRACE(ptr, 0, 0);
+			tcache_t *tcache;
+			tsd_t *tsd = tsd_fetch();
+			if (tsd_reentrancy_level_get(tsd) == 0) {
+				tcache = tcache_get(tsd);
+			} else {
+				tcache = NULL;
+			}
+			ifree(tsd, ptr, tcache, true);
+
+			LOG("core.realloc.exit", "result: %p", NULL);
+			return NULL;
+		}
+		size = 1;
+	}
+
+	if (likely(ptr != NULL)) {
+		assert(malloc_initialized() || IS_INITIALIZER);
+		tsd_t *tsd = tsd_fetch();
+
+		check_entry_exit_locking(tsd_tsdn(tsd));
+
+		alloc_ctx_t alloc_ctx;
+		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+		assert(alloc_ctx.szind != NSIZES);
+		old_usize = sz_index2size(alloc_ctx.szind);
+		assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
+		if (config_prof && opt_prof) {
+			usize = sz_s2u(size);
+			ret = unlikely(usize == 0 || usize > LARGE_MAXCLASS) ?
+			    NULL : irealloc_prof(tsd, ptr, old_usize, usize,
+			    &alloc_ctx);
+		} else {
+			if (config_stats) {
+				usize = sz_s2u(size);
+			}
+			ret = iralloc(tsd, ptr, old_usize, size, 0, false);
+		}
+		tsdn = tsd_tsdn(tsd);
+	} else {
+		/* realloc(NULL, size) is equivalent to malloc(size). */
+		void *ret = je_malloc(size);
+		LOG("core.realloc.exit", "result: %p", ret);
+		return ret;
+	}
+
+	if (unlikely(ret == NULL)) {
+		if (config_xmalloc && unlikely(opt_xmalloc)) {
+			malloc_write("<jemalloc>: Error in realloc(): "
+			    "out of memory\n");
+			abort();
+		}
+		set_errno(ENOMEM);
+	}
+	if (config_stats && likely(ret != NULL)) {
+		tsd_t *tsd;
+
+		assert(usize == isalloc(tsdn, ret));
+		tsd = tsdn_tsd(tsdn);
+		*tsd_thread_allocatedp_get(tsd) += usize;
+		*tsd_thread_deallocatedp_get(tsd) += old_usize;
+	}
+	UTRACE(ptr, size, ret);
+	check_entry_exit_locking(tsdn);
+
+	LOG("core.realloc.exit", "result: %p", ret);
+	return ret;
+}
+
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW
+je_free(void *ptr) {
+	LOG("core.free.entry", "ptr: %p", ptr);
+
+	UTRACE(ptr, 0, 0);
+	if (likely(ptr != NULL)) {
+		/*
+		 * We avoid setting up tsd fully (e.g. tcache, arena binding)
+		 * based on only free() calls -- other activities trigger the
+		 * minimal to full transition.  This is because free() may
+		 * happen during thread shutdown after tls deallocation: if a
+		 * thread never had any malloc activities until then, a
+		 * fully-setup tsd won't be destructed properly.
+		 */
+		tsd_t *tsd = tsd_fetch_min();
+		check_entry_exit_locking(tsd_tsdn(tsd));
+
+		tcache_t *tcache;
+		if (likely(tsd_fast(tsd))) {
+			tsd_assert_fast(tsd);
+			/* Unconditionally get tcache ptr on fast path. */
+			tcache = tsd_tcachep_get(tsd);
+			ifree(tsd, ptr, tcache, false);
+		} else {
+			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
+				tcache = tcache_get(tsd);
+			} else {
+				tcache = NULL;
+			}
+			ifree(tsd, ptr, tcache, true);
+		}
+		check_entry_exit_locking(tsd_tsdn(tsd));
+	}
+	LOG("core.free.exit", "");
+}
+
+/*
+ * End malloc(3)-compatible functions.
+ */
+/******************************************************************************/
+/*
+ * Begin non-standard override functions.
+ */
+
+#ifdef JEMALLOC_OVERRIDE_MEMALIGN
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc)
+je_memalign(size_t alignment, size_t size) {
+	void *ret;
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.memalign.entry", "alignment: %zu, size: %zu\n", alignment,
+	    size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.bump_empty_alloc = true;
+	sopts.min_alignment = 1;
+	sopts.oom_string =
+	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
+	sopts.invalid_alignment_string =
+	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
+	sopts.null_out_result_on_error = true;
+
+	dopts.result = &ret;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+	dopts.alignment = alignment;
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.memalign.exit", "result: %p", ret);
+	return ret;
+}
+#endif
+
+#ifdef JEMALLOC_OVERRIDE_VALLOC
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc)
+je_valloc(size_t size) {
+	void *ret;
+
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.valloc.entry", "size: %zu\n", size);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.bump_empty_alloc = true;
+	sopts.null_out_result_on_error = true;
+	sopts.min_alignment = PAGE;
+	sopts.oom_string =
+	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
+	sopts.invalid_alignment_string =
+	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
+
+	dopts.result = &ret;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+	dopts.alignment = PAGE;
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.valloc.exit", "result: %p\n", ret);
+	return ret;
+}
+#endif
+
+#if defined(JEMALLOC_IS_MALLOC) && defined(JEMALLOC_GLIBC_MALLOC_HOOK)
+/*
+ * glibc provides the RTLD_DEEPBIND flag for dlopen which can make it possible
+ * to inconsistently reference libc's malloc(3)-compatible functions
+ * (https://bugzilla.mozilla.org/show_bug.cgi?id=493541).
+ *
+ * These definitions interpose hooks in glibc.  The functions are actually
+ * passed an extra argument for the caller return address, which will be
+ * ignored.
+ */
+JEMALLOC_EXPORT void (*__free_hook)(void *ptr) = je_free;
+JEMALLOC_EXPORT void *(*__malloc_hook)(size_t size) = je_malloc;
+JEMALLOC_EXPORT void *(*__realloc_hook)(void *ptr, size_t size) = je_realloc;
+#  ifdef JEMALLOC_GLIBC_MEMALIGN_HOOK
+JEMALLOC_EXPORT void *(*__memalign_hook)(size_t alignment, size_t size) =
+    je_memalign;
+#  endif
+
+#  ifdef CPU_COUNT
+/*
+ * To enable static linking with glibc, the libc specific malloc interface must
+ * be implemented also, so none of glibc's malloc.o functions are added to the
+ * link.
+ */
+#    define ALIAS(je_fn)	__attribute__((alias (#je_fn), used))
+/* To force macro expansion of je_ prefix before stringification. */
+#    define PREALIAS(je_fn)	ALIAS(je_fn)
+#    ifdef JEMALLOC_OVERRIDE___LIBC_CALLOC
+void *__libc_calloc(size_t n, size_t size) PREALIAS(je_calloc);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___LIBC_FREE
+void __libc_free(void* ptr) PREALIAS(je_free);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___LIBC_MALLOC
+void *__libc_malloc(size_t size) PREALIAS(je_malloc);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___LIBC_MEMALIGN
+void *__libc_memalign(size_t align, size_t s) PREALIAS(je_memalign);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___LIBC_REALLOC
+void *__libc_realloc(void* ptr, size_t size) PREALIAS(je_realloc);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___LIBC_VALLOC
+void *__libc_valloc(size_t size) PREALIAS(je_valloc);
+#    endif
+#    ifdef JEMALLOC_OVERRIDE___POSIX_MEMALIGN
+int __posix_memalign(void** r, size_t a, size_t s) PREALIAS(je_posix_memalign);
+#    endif
+#    undef PREALIAS
+#    undef ALIAS
+#  endif
+#endif
+
+/*
+ * End non-standard override functions.
+ */
+/******************************************************************************/
+/*
+ * Begin non-standard functions.
+ */
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1)
+je_mallocx(size_t size, int flags) {
+	void *ret;
+	static_opts_t sopts;
+	dynamic_opts_t dopts;
+
+	LOG("core.mallocx.entry", "size: %zu, flags: %d", size, flags);
+
+	static_opts_init(&sopts);
+	dynamic_opts_init(&dopts);
+
+	sopts.assert_nonempty_alloc = true;
+	sopts.null_out_result_on_error = true;
+	sopts.oom_string = "<jemalloc>: Error in mallocx(): out of memory\n";
+
+	dopts.result = &ret;
+	dopts.num_items = 1;
+	dopts.item_size = size;
+	if (unlikely(flags != 0)) {
+		if ((flags & MALLOCX_LG_ALIGN_MASK) != 0) {
+			dopts.alignment = MALLOCX_ALIGN_GET_SPECIFIED(flags);
+		}
+
+		dopts.zero = MALLOCX_ZERO_GET(flags);
+
+		if ((flags & MALLOCX_TCACHE_MASK) != 0) {
+			if ((flags & MALLOCX_TCACHE_MASK)
+			    == MALLOCX_TCACHE_NONE) {
+				dopts.tcache_ind = TCACHE_IND_NONE;
+			} else {
+				dopts.tcache_ind = MALLOCX_TCACHE_GET(flags);
+			}
+		} else {
+			dopts.tcache_ind = TCACHE_IND_AUTOMATIC;
+		}
+
+		if ((flags & MALLOCX_ARENA_MASK) != 0)
+			dopts.arena_ind = MALLOCX_ARENA_GET(flags);
+	}
+
+	imalloc(&sopts, &dopts);
+
+	LOG("core.mallocx.exit", "result: %p", ret);
+	return ret;
+}
+
+static void *
+irallocx_prof_sample(tsdn_t *tsdn, void *old_ptr, size_t old_usize,
+    size_t usize, size_t alignment, bool zero, tcache_t *tcache, arena_t *arena,
+    prof_tctx_t *tctx) {
+	void *p;
+
+	if (tctx == NULL) {
+		return NULL;
+	}
+	if (usize <= SMALL_MAXCLASS) {
+		p = iralloct(tsdn, old_ptr, old_usize, LARGE_MINCLASS,
+		    alignment, zero, tcache, arena);
+		if (p == NULL) {
+			return NULL;
+		}
+		arena_prof_promote(tsdn, p, usize);
+	} else {
+		p = iralloct(tsdn, old_ptr, old_usize, usize, alignment, zero,
+		    tcache, arena);
+	}
+
+	return p;
+}
+
+JEMALLOC_ALWAYS_INLINE void *
+irallocx_prof(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t size,
+    size_t alignment, size_t *usize, bool zero, tcache_t *tcache,
+    arena_t *arena, alloc_ctx_t *alloc_ctx) {
+	void *p;
+	bool prof_active;
+	prof_tctx_t *old_tctx, *tctx;
+
+	prof_active = prof_active_get_unlocked();
+	old_tctx = prof_tctx_get(tsd_tsdn(tsd), old_ptr, alloc_ctx);
+	tctx = prof_alloc_prep(tsd, *usize, prof_active, false);
+	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
+		p = irallocx_prof_sample(tsd_tsdn(tsd), old_ptr, old_usize,
+		    *usize, alignment, zero, tcache, arena, tctx);
+	} else {
+		p = iralloct(tsd_tsdn(tsd), old_ptr, old_usize, size, alignment,
+		    zero, tcache, arena);
+	}
+	if (unlikely(p == NULL)) {
+		prof_alloc_rollback(tsd, tctx, false);
+		return NULL;
+	}
+
+	if (p == old_ptr && alignment != 0) {
+		/*
+		 * The allocation did not move, so it is possible that the size
+		 * class is smaller than would guarantee the requested
+		 * alignment, and that the alignment constraint was
+		 * serendipitously satisfied.  Additionally, old_usize may not
+		 * be the same as the current usize because of in-place large
+		 * reallocation.  Therefore, query the actual value of usize.
+		 */
+		*usize = isalloc(tsd_tsdn(tsd), p);
+	}
+	prof_realloc(tsd, p, *usize, tctx, prof_active, false, old_ptr,
+	    old_usize, old_tctx);
+
+	return p;
+}
+
+JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
+void JEMALLOC_NOTHROW *
+JEMALLOC_ALLOC_SIZE(2)
+je_rallocx(void *ptr, size_t size, int flags) {
+	void *p;
+	tsd_t *tsd;
+	size_t usize;
+	size_t old_usize;
+	size_t alignment = MALLOCX_ALIGN_GET(flags);
+	bool zero = flags & MALLOCX_ZERO;
+	arena_t *arena;
+	tcache_t *tcache;
+
+	LOG("core.rallocx.entry", "ptr: %p, size: %zu, flags: %d", ptr,
+	    size, flags);
+
+
+	assert(ptr != NULL);
+	assert(size != 0);
+	assert(malloc_initialized() || IS_INITIALIZER);
+	tsd = tsd_fetch();
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	if (unlikely((flags & MALLOCX_ARENA_MASK) != 0)) {
+		unsigned arena_ind = MALLOCX_ARENA_GET(flags);
+		arena = arena_get(tsd_tsdn(tsd), arena_ind, true);
+		if (unlikely(arena == NULL)) {
+			goto label_oom;
+		}
+	} else {
+		arena = NULL;
+	}
+
+	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
+		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
+			tcache = NULL;
+		} else {
+			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
+		}
+	} else {
+		tcache = tcache_get(tsd);
+	}
+
+	alloc_ctx_t alloc_ctx;
+	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+	assert(alloc_ctx.szind != NSIZES);
+	old_usize = sz_index2size(alloc_ctx.szind);
+	assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
+	if (config_prof && opt_prof) {
+		usize = (alignment == 0) ?
+		    sz_s2u(size) : sz_sa2u(size, alignment);
+		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
+			goto label_oom;
+		}
+		p = irallocx_prof(tsd, ptr, old_usize, size, alignment, &usize,
+		    zero, tcache, arena, &alloc_ctx);
+		if (unlikely(p == NULL)) {
+			goto label_oom;
+		}
+	} else {
+		p = iralloct(tsd_tsdn(tsd), ptr, old_usize, size, alignment,
+		    zero, tcache, arena);
+		if (unlikely(p == NULL)) {
+			goto label_oom;
+		}
+		if (config_stats) {
+			usize = isalloc(tsd_tsdn(tsd), p);
+		}
+	}
+	assert(alignment == 0 || ((uintptr_t)p & (alignment - 1)) == ZU(0));
+
+	if (config_stats) {
+		*tsd_thread_allocatedp_get(tsd) += usize;
+		*tsd_thread_deallocatedp_get(tsd) += old_usize;
+	}
+	UTRACE(ptr, size, p);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.rallocx.exit", "result: %p", p);
+	return p;
+label_oom:
+	if (config_xmalloc && unlikely(opt_xmalloc)) {
+		malloc_write("<jemalloc>: Error in rallocx(): out of memory\n");
+		abort();
+	}
+	UTRACE(ptr, size, 0);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.rallocx.exit", "result: %p", NULL);
+	return NULL;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+ixallocx_helper(tsdn_t *tsdn, void *ptr, size_t old_usize, size_t size,
+    size_t extra, size_t alignment, bool zero) {
+	size_t usize;
+
+	if (ixalloc(tsdn, ptr, old_usize, size, extra, alignment, zero)) {
+		return old_usize;
+	}
+	usize = isalloc(tsdn, ptr);
+
+	return usize;
+}
+
+static size_t
+ixallocx_prof_sample(tsdn_t *tsdn, void *ptr, size_t old_usize, size_t size,
+    size_t extra, size_t alignment, bool zero, prof_tctx_t *tctx) {
+	size_t usize;
+
+	if (tctx == NULL) {
+		return old_usize;
+	}
+	usize = ixallocx_helper(tsdn, ptr, old_usize, size, extra, alignment,
+	    zero);
+
+	return usize;
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+ixallocx_prof(tsd_t *tsd, void *ptr, size_t old_usize, size_t size,
+    size_t extra, size_t alignment, bool zero, alloc_ctx_t *alloc_ctx) {
+	size_t usize_max, usize;
+	bool prof_active;
+	prof_tctx_t *old_tctx, *tctx;
+
+	prof_active = prof_active_get_unlocked();
+	old_tctx = prof_tctx_get(tsd_tsdn(tsd), ptr, alloc_ctx);
+	/*
+	 * usize isn't knowable before ixalloc() returns when extra is non-zero.
+	 * Therefore, compute its maximum possible value and use that in
+	 * prof_alloc_prep() to decide whether to capture a backtrace.
+	 * prof_realloc() will use the actual usize to decide whether to sample.
+	 */
+	if (alignment == 0) {
+		usize_max = sz_s2u(size+extra);
+		assert(usize_max > 0 && usize_max <= LARGE_MAXCLASS);
+	} else {
+		usize_max = sz_sa2u(size+extra, alignment);
+		if (unlikely(usize_max == 0 || usize_max > LARGE_MAXCLASS)) {
+			/*
+			 * usize_max is out of range, and chances are that
+			 * allocation will fail, but use the maximum possible
+			 * value and carry on with prof_alloc_prep(), just in
+			 * case allocation succeeds.
+			 */
+			usize_max = LARGE_MAXCLASS;
+		}
+	}
+	tctx = prof_alloc_prep(tsd, usize_max, prof_active, false);
+
+	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
+		usize = ixallocx_prof_sample(tsd_tsdn(tsd), ptr, old_usize,
+		    size, extra, alignment, zero, tctx);
+	} else {
+		usize = ixallocx_helper(tsd_tsdn(tsd), ptr, old_usize, size,
+		    extra, alignment, zero);
+	}
+	if (usize == old_usize) {
+		prof_alloc_rollback(tsd, tctx, false);
+		return usize;
+	}
+	prof_realloc(tsd, ptr, usize, tctx, prof_active, false, ptr, old_usize,
+	    old_tctx);
+
+	return usize;
+}
+
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
+je_xallocx(void *ptr, size_t size, size_t extra, int flags) {
+	tsd_t *tsd;
+	size_t usize, old_usize;
+	size_t alignment = MALLOCX_ALIGN_GET(flags);
+	bool zero = flags & MALLOCX_ZERO;
+
+	LOG("core.xallocx.entry", "ptr: %p, size: %zu, extra: %zu, "
+	    "flags: %d", ptr, size, extra, flags);
+
+	assert(ptr != NULL);
+	assert(size != 0);
+	assert(SIZE_T_MAX - size >= extra);
+	assert(malloc_initialized() || IS_INITIALIZER);
+	tsd = tsd_fetch();
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	alloc_ctx_t alloc_ctx;
+	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
+	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
+	assert(alloc_ctx.szind != NSIZES);
+	old_usize = sz_index2size(alloc_ctx.szind);
+	assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
+	/*
+	 * The API explicitly absolves itself of protecting against (size +
+	 * extra) numerical overflow, but we may need to clamp extra to avoid
+	 * exceeding LARGE_MAXCLASS.
+	 *
+	 * Ordinarily, size limit checking is handled deeper down, but here we
+	 * have to check as part of (size + extra) clamping, since we need the
+	 * clamped value in the above helper functions.
+	 */
+	if (unlikely(size > LARGE_MAXCLASS)) {
+		usize = old_usize;
+		goto label_not_resized;
+	}
+	if (unlikely(LARGE_MAXCLASS - size < extra)) {
+		extra = LARGE_MAXCLASS - size;
+	}
+
+	if (config_prof && opt_prof) {
+		usize = ixallocx_prof(tsd, ptr, old_usize, size, extra,
+		    alignment, zero, &alloc_ctx);
+	} else {
+		usize = ixallocx_helper(tsd_tsdn(tsd), ptr, old_usize, size,
+		    extra, alignment, zero);
+	}
+	if (unlikely(usize == old_usize)) {
+		goto label_not_resized;
+	}
+
+	if (config_stats) {
+		*tsd_thread_allocatedp_get(tsd) += usize;
+		*tsd_thread_deallocatedp_get(tsd) += old_usize;
+	}
+label_not_resized:
+	UTRACE(ptr, size, ptr);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.xallocx.exit", "result: %zu", usize);
+	return usize;
+}
+
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
+JEMALLOC_ATTR(pure)
+je_sallocx(const void *ptr, UNUSED int flags) {
+	size_t usize;
+	tsdn_t *tsdn;
+
+	LOG("core.sallocx.entry", "ptr: %p, flags: %d", ptr, flags);
+
+	assert(malloc_initialized() || IS_INITIALIZER);
+	assert(ptr != NULL);
+
+	tsdn = tsdn_fetch();
+	check_entry_exit_locking(tsdn);
+
+	if (config_debug || force_ivsalloc) {
+		usize = ivsalloc(tsdn, ptr);
+		assert(force_ivsalloc || usize != 0);
+	} else {
+		usize = isalloc(tsdn, ptr);
+	}
+
+	check_entry_exit_locking(tsdn);
+
+	LOG("core.sallocx.exit", "result: %zu", usize);
+	return usize;
+}
+
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW
+je_dallocx(void *ptr, int flags) {
+	LOG("core.dallocx.entry", "ptr: %p, flags: %d", ptr, flags);
+
+	assert(ptr != NULL);
+	assert(malloc_initialized() || IS_INITIALIZER);
+
+	tsd_t *tsd = tsd_fetch();
+	bool fast = tsd_fast(tsd);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	tcache_t *tcache;
+	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
+		/* Not allowed to be reentrant and specify a custom tcache. */
+		assert(tsd_reentrancy_level_get(tsd) == 0);
+		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
+			tcache = NULL;
+		} else {
+			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
+		}
+	} else {
+		if (likely(fast)) {
+			tcache = tsd_tcachep_get(tsd);
+			assert(tcache == tcache_get(tsd));
+		} else {
+			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
+				tcache = tcache_get(tsd);
+			}  else {
+				tcache = NULL;
+			}
+		}
+	}
+
+	UTRACE(ptr, 0, 0);
+	if (likely(fast)) {
+		tsd_assert_fast(tsd);
+		ifree(tsd, ptr, tcache, false);
+	} else {
+		ifree(tsd, ptr, tcache, true);
+	}
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.dallocx.exit", "");
+}
+
+JEMALLOC_ALWAYS_INLINE size_t
+inallocx(tsdn_t *tsdn, size_t size, int flags) {
+	check_entry_exit_locking(tsdn);
+
+	size_t usize;
+	if (likely((flags & MALLOCX_LG_ALIGN_MASK) == 0)) {
+		usize = sz_s2u(size);
+	} else {
+		usize = sz_sa2u(size, MALLOCX_ALIGN_GET_SPECIFIED(flags));
+	}
+	check_entry_exit_locking(tsdn);
+	return usize;
+}
+
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW
+je_sdallocx(void *ptr, size_t size, int flags) {
+	assert(ptr != NULL);
+	assert(malloc_initialized() || IS_INITIALIZER);
+
+	LOG("core.sdallocx.entry", "ptr: %p, size: %zu, flags: %d", ptr,
+	    size, flags);
+
+	tsd_t *tsd = tsd_fetch();
+	bool fast = tsd_fast(tsd);
+	size_t usize = inallocx(tsd_tsdn(tsd), size, flags);
+	assert(usize == isalloc(tsd_tsdn(tsd), ptr));
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	tcache_t *tcache;
+	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
+		/* Not allowed to be reentrant and specify a custom tcache. */
+		assert(tsd_reentrancy_level_get(tsd) == 0);
+		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
+			tcache = NULL;
+		} else {
+			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
+		}
+	} else {
+		if (likely(fast)) {
+			tcache = tsd_tcachep_get(tsd);
+			assert(tcache == tcache_get(tsd));
+		} else {
+			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
+				tcache = tcache_get(tsd);
+			} else {
+				tcache = NULL;
+			}
+		}
+	}
+
+	UTRACE(ptr, 0, 0);
+	if (likely(fast)) {
+		tsd_assert_fast(tsd);
+		isfree(tsd, ptr, usize, tcache, false);
+	} else {
+		isfree(tsd, ptr, usize, tcache, true);
+	}
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.sdallocx.exit", "");
+}
+
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
+JEMALLOC_ATTR(pure)
+je_nallocx(size_t size, int flags) {
+	size_t usize;
+	tsdn_t *tsdn;
+
+	assert(size != 0);
+
+	if (unlikely(malloc_init())) {
+		LOG("core.nallocx.exit", "result: %zu", ZU(0));
+		return 0;
+	}
+
+	tsdn = tsdn_fetch();
+	check_entry_exit_locking(tsdn);
+
+	usize = inallocx(tsdn, size, flags);
+	if (unlikely(usize > LARGE_MAXCLASS)) {
+		LOG("core.nallocx.exit", "result: %zu", ZU(0));
+		return 0;
+	}
+
+	check_entry_exit_locking(tsdn);
+	LOG("core.nallocx.exit", "result: %zu", usize);
+	return usize;
+}
+
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW
+je_mallctl(const char *name, void *oldp, size_t *oldlenp, void *newp,
+    size_t newlen) {
+	int ret;
+	tsd_t *tsd;
+
+	LOG("core.mallctl.entry", "name: %s", name);
+
+	if (unlikely(malloc_init())) {
+		LOG("core.mallctl.exit", "result: %d", EAGAIN);
+		return EAGAIN;
+	}
+
+	tsd = tsd_fetch();
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	ret = ctl_byname(tsd, name, oldp, oldlenp, newp, newlen);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.mallctl.exit", "result: %d", ret);
+	return ret;
+}
+
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW
+je_mallctlnametomib(const char *name, size_t *mibp, size_t *miblenp) {
+	int ret;
+
+	LOG("core.mallctlnametomib.entry", "name: %s", name);
+
+	if (unlikely(malloc_init())) {
+		LOG("core.mallctlnametomib.exit", "result: %d", EAGAIN);
+		return EAGAIN;
+	}
+
+	tsd_t *tsd = tsd_fetch();
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	ret = ctl_nametomib(tsd, name, mibp, miblenp);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+
+	LOG("core.mallctlnametomib.exit", "result: %d", ret);
+	return ret;
+}
+
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW
+je_mallctlbymib(const size_t *mib, size_t miblen, void *oldp, size_t *oldlenp,
+  void *newp, size_t newlen) {
+	int ret;
+	tsd_t *tsd;
+
+	LOG("core.mallctlbymib.entry", "");
+
+	if (unlikely(malloc_init())) {
+		LOG("core.mallctlbymib.exit", "result: %d", EAGAIN);
+		return EAGAIN;
+	}
+
+	tsd = tsd_fetch();
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	ret = ctl_bymib(tsd, mib, miblen, oldp, oldlenp, newp, newlen);
+	check_entry_exit_locking(tsd_tsdn(tsd));
+	LOG("core.mallctlbymib.exit", "result: %d", ret);
+	return ret;
+}
+
+JEMALLOC_EXPORT void JEMALLOC_NOTHROW
+je_malloc_stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *opts) {
+	tsdn_t *tsdn;
+
+	LOG("core.malloc_stats_print.entry", "");
+
+	tsdn = tsdn_fetch();
+	check_entry_exit_locking(tsdn);
+	stats_print(write_cb, cbopaque, opts);
+	check_entry_exit_locking(tsdn);
+	LOG("core.malloc_stats_print.exit", "");
+}
+
+JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
+je_malloc_usable_size(JEMALLOC_USABLE_SIZE_CONST void *ptr) {
+	size_t ret;
+	tsdn_t *tsdn;
+
+	LOG("core.malloc_usable_size.entry", "ptr: %p", ptr);
+
+	assert(malloc_initialized() || IS_INITIALIZER);
+
+	tsdn = tsdn_fetch();
+	check_entry_exit_locking(tsdn);
+
+	if (unlikely(ptr == NULL)) {
+		ret = 0;
+	} else {
+		if (config_debug || force_ivsalloc) {
+			ret = ivsalloc(tsdn, ptr);
+			assert(force_ivsalloc || ret != 0);
+		} else {
+			ret = isalloc(tsdn, ptr);
+		}
+	}
+
+	check_entry_exit_locking(tsdn);
+	LOG("core.malloc_usable_size.exit", "result: %zu", ret);
+	return ret;
+}
+
+/*
+ * End non-standard functions.
+ */
+/******************************************************************************/
+/*
+ * The following functions are used by threading libraries for protection of
+ * malloc during fork().
+ */
+
+/*
+ * If an application creates a thread before doing any allocation in the main
+ * thread, then calls fork(2) in the main thread followed by memory allocation
+ * in the child process, a race can occur that results in deadlock within the
+ * child: the main thread may have forked while the created thread had
+ * partially initialized the allocator.  Ordinarily jemalloc prevents
+ * fork/malloc races via the following functions it registers during
+ * initialization using pthread_atfork(), but of course that does no good if
+ * the allocator isn't fully initialized at fork time.  The following library
+ * constructor is a partial solution to this problem.  It may still be possible
+ * to trigger the deadlock described above, but doing so would involve forking
+ * via a library constructor that runs before jemalloc's runs.
+ */
+#ifndef JEMALLOC_JET
+JEMALLOC_ATTR(constructor)
+static void
+jemalloc_constructor(void) {
+	malloc_init();
+}
+#endif
+
+#ifndef JEMALLOC_MUTEX_INIT_CB
+void
+jemalloc_prefork(void)
+#else
+JEMALLOC_EXPORT void
+_malloc_prefork(void)
+#endif
+{
+	tsd_t *tsd;
+	unsigned i, j, narenas;
+	arena_t *arena;
+
+#ifdef JEMALLOC_MUTEX_INIT_CB
+	if (!malloc_initialized()) {
+		return;
+	}
+#endif
+	assert(malloc_initialized());
+
+	tsd = tsd_fetch();
+
+	narenas = narenas_total_get();
+
+	witness_prefork(tsd_witness_tsdp_get(tsd));
+	/* Acquire all mutexes in a safe order. */
+	ctl_prefork(tsd_tsdn(tsd));
+	tcache_prefork(tsd_tsdn(tsd));
+	malloc_mutex_prefork(tsd_tsdn(tsd), &arenas_lock);
+	if (have_background_thread) {
+		background_thread_prefork0(tsd_tsdn(tsd));
+	}
+	prof_prefork0(tsd_tsdn(tsd));
+	if (have_background_thread) {
+		background_thread_prefork1(tsd_tsdn(tsd));
+	}
+	/* Break arena prefork into stages to preserve lock order. */
+	for (i = 0; i < 8; i++) {
+		for (j = 0; j < narenas; j++) {
+			if ((arena = arena_get(tsd_tsdn(tsd), j, false)) !=
+			    NULL) {
+				switch (i) {
+				case 0:
+					arena_prefork0(tsd_tsdn(tsd), arena);
+					break;
+				case 1:
+					arena_prefork1(tsd_tsdn(tsd), arena);
+					break;
+				case 2:
+					arena_prefork2(tsd_tsdn(tsd), arena);
+					break;
+				case 3:
+					arena_prefork3(tsd_tsdn(tsd), arena);
+					break;
+				case 4:
+					arena_prefork4(tsd_tsdn(tsd), arena);
+					break;
+				case 5:
+					arena_prefork5(tsd_tsdn(tsd), arena);
+					break;
+				case 6:
+					arena_prefork6(tsd_tsdn(tsd), arena);
+					break;
+				case 7:
+					arena_prefork7(tsd_tsdn(tsd), arena);
+					break;
+				default: not_reached();
+				}
+			}
+		}
+	}
+	prof_prefork1(tsd_tsdn(tsd));
+}
+
+#ifndef JEMALLOC_MUTEX_INIT_CB
+void
+jemalloc_postfork_parent(void)
+#else
+JEMALLOC_EXPORT void
+_malloc_postfork(void)
+#endif
+{
+	tsd_t *tsd;
+	unsigned i, narenas;
+
+#ifdef JEMALLOC_MUTEX_INIT_CB
+	if (!malloc_initialized()) {
+		return;
+	}
+#endif
+	assert(malloc_initialized());
+
+	tsd = tsd_fetch();
+
+	witness_postfork_parent(tsd_witness_tsdp_get(tsd));
+	/* Release all mutexes, now that fork() has completed. */
+	for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
+		arena_t *arena;
+
+		if ((arena = arena_get(tsd_tsdn(tsd), i, false)) != NULL) {
+			arena_postfork_parent(tsd_tsdn(tsd), arena);
+		}
+	}
+	prof_postfork_parent(tsd_tsdn(tsd));
+	if (have_background_thread) {
+		background_thread_postfork_parent(tsd_tsdn(tsd));
+	}
+	malloc_mutex_postfork_parent(tsd_tsdn(tsd), &arenas_lock);
+	tcache_postfork_parent(tsd_tsdn(tsd));
+	ctl_postfork_parent(tsd_tsdn(tsd));
+}
+
+void
+jemalloc_postfork_child(void) {
+	tsd_t *tsd;
+	unsigned i, narenas;
+
+	assert(malloc_initialized());
+
+	tsd = tsd_fetch();
+
+	witness_postfork_child(tsd_witness_tsdp_get(tsd));
+	/* Release all mutexes, now that fork() has completed. */
+	for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
+		arena_t *arena;
+
+		if ((arena = arena_get(tsd_tsdn(tsd), i, false)) != NULL) {
+			arena_postfork_child(tsd_tsdn(tsd), arena);
+		}
+	}
+	prof_postfork_child(tsd_tsdn(tsd));
+	if (have_background_thread) {
+		background_thread_postfork_child(tsd_tsdn(tsd));
+	}
+	malloc_mutex_postfork_child(tsd_tsdn(tsd), &arenas_lock);
+	tcache_postfork_child(tsd_tsdn(tsd));
+	ctl_postfork_child(tsd_tsdn(tsd));
+}
+
+/******************************************************************************/
+
+/* Helps the application decide if a pointer is worth re-allocating in order to reduce fragmentation.
+ * returns 1 if the allocation should be moved, and 0 if the allocation be kept.
+ * If the application decides to re-allocate it should use MALLOCX_TCACHE_NONE when doing so. */
+JEMALLOC_EXPORT int JEMALLOC_NOTHROW
+get_defrag_hint(void* ptr) {
+	assert(ptr != NULL);
+	return iget_defrag_hint(TSDN_NULL, ptr);
+}
diff --git a/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp b/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
new file mode 100644
index 00000000..f0ceddae
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
@@ -0,0 +1,141 @@
+#include <mutex>
+#include <new>
+
+#define JEMALLOC_CPP_CPP_
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#ifdef __cplusplus
+}
+#endif
+
+// All operators in this file are exported.
+
+// Possibly alias hidden versions of malloc and sdallocx to avoid an extra plt
+// thunk?
+//
+// extern __typeof (sdallocx) sdallocx_int
+//  __attribute ((alias ("sdallocx"),
+//		visibility ("hidden")));
+//
+// ... but it needs to work with jemalloc namespaces.
+
+void	*operator new(std::size_t size);
+void	*operator new[](std::size_t size);
+void	*operator new(std::size_t size, const std::nothrow_t &) noexcept;
+void	*operator new[](std::size_t size, const std::nothrow_t &) noexcept;
+void	operator delete(void *ptr) noexcept;
+void	operator delete[](void *ptr) noexcept;
+void	operator delete(void *ptr, const std::nothrow_t &) noexcept;
+void	operator delete[](void *ptr, const std::nothrow_t &) noexcept;
+
+#if __cpp_sized_deallocation >= 201309
+/* C++14's sized-delete operators. */
+void	operator delete(void *ptr, std::size_t size) noexcept;
+void	operator delete[](void *ptr, std::size_t size) noexcept;
+#endif
+
+JEMALLOC_NOINLINE
+static void *
+handleOOM(std::size_t size, bool nothrow) {
+	void *ptr = nullptr;
+
+	while (ptr == nullptr) {
+		std::new_handler handler;
+		// GCC-4.8 and clang 4.0 do not have std::get_new_handler.
+		{
+			static std::mutex mtx;
+			std::lock_guard<std::mutex> lock(mtx);
+
+			handler = std::set_new_handler(nullptr);
+			std::set_new_handler(handler);
+		}
+		if (handler == nullptr)
+			break;
+
+		try {
+			handler();
+		} catch (const std::bad_alloc &) {
+			break;
+		}
+
+		ptr = je_malloc(size);
+	}
+
+	if (ptr == nullptr && !nothrow)
+		std::__throw_bad_alloc();
+	return ptr;
+}
+
+template <bool IsNoExcept>
+JEMALLOC_ALWAYS_INLINE
+void *
+newImpl(std::size_t size) noexcept(IsNoExcept) {
+	void *ptr = je_malloc(size);
+	if (likely(ptr != nullptr))
+		return ptr;
+
+	return handleOOM(size, IsNoExcept);
+}
+
+void *
+operator new(std::size_t size) {
+	return newImpl<false>(size);
+}
+
+void *
+operator new[](std::size_t size) {
+	return newImpl<false>(size);
+}
+
+void *
+operator new(std::size_t size, const std::nothrow_t &) noexcept {
+	return newImpl<true>(size);
+}
+
+void *
+operator new[](std::size_t size, const std::nothrow_t &) noexcept {
+	return newImpl<true>(size);
+}
+
+void
+operator delete(void *ptr) noexcept {
+	je_free(ptr);
+}
+
+void
+operator delete[](void *ptr) noexcept {
+	je_free(ptr);
+}
+
+void
+operator delete(void *ptr, const std::nothrow_t &) noexcept {
+	je_free(ptr);
+}
+
+void operator delete[](void *ptr, const std::nothrow_t &) noexcept {
+	je_free(ptr);
+}
+
+#if __cpp_sized_deallocation >= 201309
+
+void
+operator delete(void *ptr, std::size_t size) noexcept {
+	if (unlikely(ptr == nullptr)) {
+		return;
+	}
+	je_sdallocx(ptr, size, /*flags=*/0);
+}
+
+void operator delete[](void *ptr, std::size_t size) noexcept {
+	if (unlikely(ptr == nullptr)) {
+		return;
+	}
+	je_sdallocx(ptr, size, /*flags=*/0);
+}
+
+#endif  // __cpp_sized_deallocation
diff --git a/redis-stable/deps/jemalloc/src/large.c b/redis-stable/deps/jemalloc/src/large.c
new file mode 100644
index 00000000..27a2c679
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/large.c
@@ -0,0 +1,371 @@
+#define JEMALLOC_LARGE_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree.h"
+#include "jemalloc/internal/util.h"
+
+/******************************************************************************/
+
+void *
+large_malloc(tsdn_t *tsdn, arena_t *arena, size_t usize, bool zero) {
+	assert(usize == sz_s2u(usize));
+
+	return large_palloc(tsdn, arena, usize, CACHELINE, zero);
+}
+
+void *
+large_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
+    bool zero) {
+	size_t ausize;
+	extent_t *extent;
+	bool is_zeroed;
+	UNUSED bool idump JEMALLOC_CC_SILENCE_INIT(false);
+
+	assert(!tsdn_null(tsdn) || arena != NULL);
+
+	ausize = sz_sa2u(usize, alignment);
+	if (unlikely(ausize == 0 || ausize > LARGE_MAXCLASS)) {
+		return NULL;
+	}
+
+	if (config_fill && unlikely(opt_zero)) {
+		zero = true;
+	}
+	/*
+	 * Copy zero into is_zeroed and pass the copy when allocating the
+	 * extent, so that it is possible to make correct junk/zero fill
+	 * decisions below, even if is_zeroed ends up true when zero is false.
+	 */
+	is_zeroed = zero;
+	if (likely(!tsdn_null(tsdn))) {
+		arena = arena_choose(tsdn_tsd(tsdn), arena);
+	}
+	if (unlikely(arena == NULL) || (extent = arena_extent_alloc_large(tsdn,
+	    arena, usize, alignment, &is_zeroed)) == NULL) {
+		return NULL;
+	}
+
+	/* See comments in arena_bin_slabs_full_insert(). */
+	if (!arena_is_auto(arena)) {
+		/* Insert extent into large. */
+		malloc_mutex_lock(tsdn, &arena->large_mtx);
+		extent_list_append(&arena->large, extent);
+		malloc_mutex_unlock(tsdn, &arena->large_mtx);
+	}
+	if (config_prof && arena_prof_accum(tsdn, arena, usize)) {
+		prof_idump(tsdn);
+	}
+
+	if (zero) {
+		assert(is_zeroed);
+	} else if (config_fill && unlikely(opt_junk_alloc)) {
+		memset(extent_addr_get(extent), JEMALLOC_ALLOC_JUNK,
+		    extent_usize_get(extent));
+	}
+
+	arena_decay_tick(tsdn, arena);
+	return extent_addr_get(extent);
+}
+
+static void
+large_dalloc_junk_impl(void *ptr, size_t size) {
+	memset(ptr, JEMALLOC_FREE_JUNK, size);
+}
+large_dalloc_junk_t *JET_MUTABLE large_dalloc_junk = large_dalloc_junk_impl;
+
+static void
+large_dalloc_maybe_junk_impl(void *ptr, size_t size) {
+	if (config_fill && have_dss && unlikely(opt_junk_free)) {
+		/*
+		 * Only bother junk filling if the extent isn't about to be
+		 * unmapped.
+		 */
+		if (opt_retain || (have_dss && extent_in_dss(ptr))) {
+			large_dalloc_junk(ptr, size);
+		}
+	}
+}
+large_dalloc_maybe_junk_t *JET_MUTABLE large_dalloc_maybe_junk =
+    large_dalloc_maybe_junk_impl;
+
+static bool
+large_ralloc_no_move_shrink(tsdn_t *tsdn, extent_t *extent, size_t usize) {
+	arena_t *arena = extent_arena_get(extent);
+	size_t oldusize = extent_usize_get(extent);
+	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
+	size_t diff = extent_size_get(extent) - (usize + sz_large_pad);
+
+	assert(oldusize > usize);
+
+	if (extent_hooks->split == NULL) {
+		return true;
+	}
+
+	/* Split excess pages. */
+	if (diff != 0) {
+		extent_t *trail = extent_split_wrapper(tsdn, arena,
+		    &extent_hooks, extent, usize + sz_large_pad,
+		    sz_size2index(usize), false, diff, NSIZES, false);
+		if (trail == NULL) {
+			return true;
+		}
+
+		if (config_fill && unlikely(opt_junk_free)) {
+			large_dalloc_maybe_junk(extent_addr_get(trail),
+			    extent_size_get(trail));
+		}
+
+		arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, trail);
+	}
+
+	arena_extent_ralloc_large_shrink(tsdn, arena, extent, oldusize);
+
+	return false;
+}
+
+static bool
+large_ralloc_no_move_expand(tsdn_t *tsdn, extent_t *extent, size_t usize,
+    bool zero) {
+	arena_t *arena = extent_arena_get(extent);
+	size_t oldusize = extent_usize_get(extent);
+	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
+	size_t trailsize = usize - oldusize;
+
+	if (extent_hooks->merge == NULL) {
+		return true;
+	}
+
+	if (config_fill && unlikely(opt_zero)) {
+		zero = true;
+	}
+	/*
+	 * Copy zero into is_zeroed_trail and pass the copy when allocating the
+	 * extent, so that it is possible to make correct junk/zero fill
+	 * decisions below, even if is_zeroed_trail ends up true when zero is
+	 * false.
+	 */
+	bool is_zeroed_trail = zero;
+	bool commit = true;
+	extent_t *trail;
+	bool new_mapping;
+	if ((trail = extents_alloc(tsdn, arena, &extent_hooks,
+	    &arena->extents_dirty, extent_past_get(extent), trailsize, 0,
+	    CACHELINE, false, NSIZES, &is_zeroed_trail, &commit)) != NULL
+	    || (trail = extents_alloc(tsdn, arena, &extent_hooks,
+	    &arena->extents_muzzy, extent_past_get(extent), trailsize, 0,
+	    CACHELINE, false, NSIZES, &is_zeroed_trail, &commit)) != NULL) {
+		if (config_stats) {
+			new_mapping = false;
+		}
+	} else {
+		if ((trail = extent_alloc_wrapper(tsdn, arena, &extent_hooks,
+		    extent_past_get(extent), trailsize, 0, CACHELINE, false,
+		    NSIZES, &is_zeroed_trail, &commit)) == NULL) {
+			return true;
+		}
+		if (config_stats) {
+			new_mapping = true;
+		}
+	}
+
+	if (extent_merge_wrapper(tsdn, arena, &extent_hooks, extent, trail)) {
+		extent_dalloc_wrapper(tsdn, arena, &extent_hooks, trail);
+		return true;
+	}
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+	szind_t szind = sz_size2index(usize);
+	extent_szind_set(extent, szind);
+	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)extent_addr_get(extent), szind, false);
+
+	if (config_stats && new_mapping) {
+		arena_stats_mapped_add(tsdn, &arena->stats, trailsize);
+	}
+
+	if (zero) {
+		if (config_cache_oblivious) {
+			/*
+			 * Zero the trailing bytes of the original allocation's
+			 * last page, since they are in an indeterminate state.
+			 * There will always be trailing bytes, because ptr's
+			 * offset from the beginning of the extent is a multiple
+			 * of CACHELINE in [0 .. PAGE).
+			 */
+			void *zbase = (void *)
+			    ((uintptr_t)extent_addr_get(extent) + oldusize);
+			void *zpast = PAGE_ADDR2BASE((void *)((uintptr_t)zbase +
+			    PAGE));
+			size_t nzero = (uintptr_t)zpast - (uintptr_t)zbase;
+			assert(nzero > 0);
+			memset(zbase, 0, nzero);
+		}
+		assert(is_zeroed_trail);
+	} else if (config_fill && unlikely(opt_junk_alloc)) {
+		memset((void *)((uintptr_t)extent_addr_get(extent) + oldusize),
+		    JEMALLOC_ALLOC_JUNK, usize - oldusize);
+	}
+
+	arena_extent_ralloc_large_expand(tsdn, arena, extent, oldusize);
+
+	return false;
+}
+
+bool
+large_ralloc_no_move(tsdn_t *tsdn, extent_t *extent, size_t usize_min,
+    size_t usize_max, bool zero) {
+	size_t oldusize = extent_usize_get(extent);
+
+	/* The following should have been caught by callers. */
+	assert(usize_min > 0 && usize_max <= LARGE_MAXCLASS);
+	/* Both allocation sizes must be large to avoid a move. */
+	assert(oldusize >= LARGE_MINCLASS && usize_max >= LARGE_MINCLASS);
+
+	if (usize_max > oldusize) {
+		/* Attempt to expand the allocation in-place. */
+		if (!large_ralloc_no_move_expand(tsdn, extent, usize_max,
+		    zero)) {
+			arena_decay_tick(tsdn, extent_arena_get(extent));
+			return false;
+		}
+		/* Try again, this time with usize_min. */
+		if (usize_min < usize_max && usize_min > oldusize &&
+		    large_ralloc_no_move_expand(tsdn, extent, usize_min,
+		    zero)) {
+			arena_decay_tick(tsdn, extent_arena_get(extent));
+			return false;
+		}
+	}
+
+	/*
+	 * Avoid moving the allocation if the existing extent size accommodates
+	 * the new size.
+	 */
+	if (oldusize >= usize_min && oldusize <= usize_max) {
+		arena_decay_tick(tsdn, extent_arena_get(extent));
+		return false;
+	}
+
+	/* Attempt to shrink the allocation in-place. */
+	if (oldusize > usize_max) {
+		if (!large_ralloc_no_move_shrink(tsdn, extent, usize_max)) {
+			arena_decay_tick(tsdn, extent_arena_get(extent));
+			return false;
+		}
+	}
+	return true;
+}
+
+static void *
+large_ralloc_move_helper(tsdn_t *tsdn, arena_t *arena, size_t usize,
+    size_t alignment, bool zero) {
+	if (alignment <= CACHELINE) {
+		return large_malloc(tsdn, arena, usize, zero);
+	}
+	return large_palloc(tsdn, arena, usize, alignment, zero);
+}
+
+void *
+large_ralloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent, size_t usize,
+    size_t alignment, bool zero, tcache_t *tcache) {
+	size_t oldusize = extent_usize_get(extent);
+
+	/* The following should have been caught by callers. */
+	assert(usize > 0 && usize <= LARGE_MAXCLASS);
+	/* Both allocation sizes must be large to avoid a move. */
+	assert(oldusize >= LARGE_MINCLASS && usize >= LARGE_MINCLASS);
+
+	/* Try to avoid moving the allocation. */
+	if (!large_ralloc_no_move(tsdn, extent, usize, usize, zero)) {
+		return extent_addr_get(extent);
+	}
+
+	/*
+	 * usize and old size are different enough that we need to use a
+	 * different size class.  In that case, fall back to allocating new
+	 * space and copying.
+	 */
+	void *ret = large_ralloc_move_helper(tsdn, arena, usize, alignment,
+	    zero);
+	if (ret == NULL) {
+		return NULL;
+	}
+
+	size_t copysize = (usize < oldusize) ? usize : oldusize;
+	memcpy(ret, extent_addr_get(extent), copysize);
+	isdalloct(tsdn, extent_addr_get(extent), oldusize, tcache, NULL, true);
+	return ret;
+}
+
+/*
+ * junked_locked indicates whether the extent's data have been junk-filled, and
+ * whether the arena's large_mtx is currently held.
+ */
+static void
+large_dalloc_prep_impl(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
+    bool junked_locked) {
+	if (!junked_locked) {
+		/* See comments in arena_bin_slabs_full_insert(). */
+		if (!arena_is_auto(arena)) {
+			malloc_mutex_lock(tsdn, &arena->large_mtx);
+			extent_list_remove(&arena->large, extent);
+			malloc_mutex_unlock(tsdn, &arena->large_mtx);
+		}
+		large_dalloc_maybe_junk(extent_addr_get(extent),
+		    extent_usize_get(extent));
+	} else {
+		malloc_mutex_assert_owner(tsdn, &arena->large_mtx);
+		if (!arena_is_auto(arena)) {
+			extent_list_remove(&arena->large, extent);
+		}
+	}
+	arena_extent_dalloc_large_prep(tsdn, arena, extent);
+}
+
+static void
+large_dalloc_finish_impl(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
+	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
+	arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, extent);
+}
+
+void
+large_dalloc_prep_junked_locked(tsdn_t *tsdn, extent_t *extent) {
+	large_dalloc_prep_impl(tsdn, extent_arena_get(extent), extent, true);
+}
+
+void
+large_dalloc_finish(tsdn_t *tsdn, extent_t *extent) {
+	large_dalloc_finish_impl(tsdn, extent_arena_get(extent), extent);
+}
+
+void
+large_dalloc(tsdn_t *tsdn, extent_t *extent) {
+	arena_t *arena = extent_arena_get(extent);
+	large_dalloc_prep_impl(tsdn, arena, extent, false);
+	large_dalloc_finish_impl(tsdn, arena, extent);
+	arena_decay_tick(tsdn, arena);
+}
+
+size_t
+large_salloc(tsdn_t *tsdn, const extent_t *extent) {
+	return extent_usize_get(extent);
+}
+
+prof_tctx_t *
+large_prof_tctx_get(tsdn_t *tsdn, const extent_t *extent) {
+	return extent_prof_tctx_get(extent);
+}
+
+void
+large_prof_tctx_set(tsdn_t *tsdn, extent_t *extent, prof_tctx_t *tctx) {
+	extent_prof_tctx_set(extent, tctx);
+}
+
+void
+large_prof_tctx_reset(tsdn_t *tsdn, extent_t *extent) {
+	large_prof_tctx_set(tsdn, extent, (prof_tctx_t *)(uintptr_t)1U);
+}
diff --git a/redis-stable/deps/jemalloc/src/log.c b/redis-stable/deps/jemalloc/src/log.c
new file mode 100644
index 00000000..778902fb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/log.c
@@ -0,0 +1,78 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/log.h"
+
+char log_var_names[JEMALLOC_LOG_VAR_BUFSIZE];
+atomic_b_t log_init_done = ATOMIC_INIT(false);
+
+/*
+ * Returns true if we were able to pick out a segment.  Fills in r_segment_end
+ * with a pointer to the first character after the end of the string.
+ */
+static const char *
+log_var_extract_segment(const char* segment_begin) {
+	const char *end;
+	for (end = segment_begin; *end != '\0' && *end != '|'; end++) {
+	}
+	return end;
+}
+
+static bool
+log_var_matches_segment(const char *segment_begin, const char *segment_end,
+    const char *log_var_begin, const char *log_var_end) {
+	assert(segment_begin <= segment_end);
+	assert(log_var_begin < log_var_end);
+
+	ptrdiff_t segment_len = segment_end - segment_begin;
+	ptrdiff_t log_var_len = log_var_end - log_var_begin;
+	/* The special '.' segment matches everything. */
+	if (segment_len == 1 && *segment_begin == '.') {
+		return true;
+	}
+        if (segment_len == log_var_len) {
+		return strncmp(segment_begin, log_var_begin, segment_len) == 0;
+	} else if (segment_len < log_var_len) {
+		return strncmp(segment_begin, log_var_begin, segment_len) == 0
+		    && log_var_begin[segment_len] == '.';
+        } else {
+		return false;
+	}
+}
+
+unsigned
+log_var_update_state(log_var_t *log_var) {
+	const char *log_var_begin = log_var->name;
+	const char *log_var_end = log_var->name + strlen(log_var->name);
+
+	/* Pointer to one before the beginning of the current segment. */
+	const char *segment_begin = log_var_names;
+
+	/*
+	 * If log_init done is false, we haven't parsed the malloc conf yet.  To
+	 * avoid log-spew, we default to not displaying anything.
+	 */
+	if (!atomic_load_b(&log_init_done, ATOMIC_ACQUIRE)) {
+		return LOG_INITIALIZED_NOT_ENABLED;
+	}
+
+	while (true) {
+		const char *segment_end = log_var_extract_segment(
+		    segment_begin);
+		assert(segment_end < log_var_names + JEMALLOC_LOG_VAR_BUFSIZE);
+		if (log_var_matches_segment(segment_begin, segment_end,
+		    log_var_begin, log_var_end)) {
+			atomic_store_u(&log_var->state, LOG_ENABLED,
+			    ATOMIC_RELAXED);
+			return LOG_ENABLED;
+		}
+		if (*segment_end == '\0') {
+			/* Hit the end of the segment string with no match. */
+			atomic_store_u(&log_var->state,
+			    LOG_INITIALIZED_NOT_ENABLED, ATOMIC_RELAXED);
+			return LOG_INITIALIZED_NOT_ENABLED;
+		}
+		/* Otherwise, skip the delimiter and continue. */
+		segment_begin = segment_end + 1;
+	}
+}
diff --git a/redis-stable/deps/jemalloc/src/malloc_io.c b/redis-stable/deps/jemalloc/src/malloc_io.c
new file mode 100644
index 00000000..dd882651
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/malloc_io.c
@@ -0,0 +1,676 @@
+#define JEMALLOC_MALLOC_IO_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/util.h"
+
+#ifdef assert
+#  undef assert
+#endif
+#ifdef not_reached
+#  undef not_reached
+#endif
+#ifdef not_implemented
+#  undef not_implemented
+#endif
+#ifdef assert_not_implemented
+#  undef assert_not_implemented
+#endif
+
+/*
+ * Define simple versions of assertion macros that won't recurse in case
+ * of assertion failures in malloc_*printf().
+ */
+#define assert(e) do {							\
+	if (config_debug && !(e)) {					\
+		malloc_write("<jemalloc>: Failed assertion\n");		\
+		abort();						\
+	}								\
+} while (0)
+
+#define not_reached() do {						\
+	if (config_debug) {						\
+		malloc_write("<jemalloc>: Unreachable code reached\n");	\
+		abort();						\
+	}								\
+	unreachable();							\
+} while (0)
+
+#define not_implemented() do {						\
+	if (config_debug) {						\
+		malloc_write("<jemalloc>: Not implemented\n");		\
+		abort();						\
+	}								\
+} while (0)
+
+#define assert_not_implemented(e) do {					\
+	if (unlikely(config_debug && !(e))) {				\
+		not_implemented();					\
+	}								\
+} while (0)
+
+/******************************************************************************/
+/* Function prototypes for non-inline static functions. */
+
+static void wrtmessage(void *cbopaque, const char *s);
+#define U2S_BUFSIZE ((1U << (LG_SIZEOF_INTMAX_T + 3)) + 1)
+static char *u2s(uintmax_t x, unsigned base, bool uppercase, char *s,
+    size_t *slen_p);
+#define D2S_BUFSIZE (1 + U2S_BUFSIZE)
+static char *d2s(intmax_t x, char sign, char *s, size_t *slen_p);
+#define O2S_BUFSIZE (1 + U2S_BUFSIZE)
+static char *o2s(uintmax_t x, bool alt_form, char *s, size_t *slen_p);
+#define X2S_BUFSIZE (2 + U2S_BUFSIZE)
+static char *x2s(uintmax_t x, bool alt_form, bool uppercase, char *s,
+    size_t *slen_p);
+
+/******************************************************************************/
+
+/* malloc_message() setup. */
+static void
+wrtmessage(void *cbopaque, const char *s) {
+	malloc_write_fd(STDERR_FILENO, s, strlen(s));
+}
+
+JEMALLOC_EXPORT void	(*je_malloc_message)(void *, const char *s);
+
+/*
+ * Wrapper around malloc_message() that avoids the need for
+ * je_malloc_message(...) throughout the code.
+ */
+void
+malloc_write(const char *s) {
+	if (je_malloc_message != NULL) {
+		je_malloc_message(NULL, s);
+	} else {
+		wrtmessage(NULL, s);
+	}
+}
+
+/*
+ * glibc provides a non-standard strerror_r() when _GNU_SOURCE is defined, so
+ * provide a wrapper.
+ */
+int
+buferror(int err, char *buf, size_t buflen) {
+#ifdef _WIN32
+	FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM, NULL, err, 0,
+	    (LPSTR)buf, (DWORD)buflen, NULL);
+	return 0;
+#elif defined(JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE) && defined(_GNU_SOURCE)
+	char *b = strerror_r(err, buf, buflen);
+	if (b != buf) {
+		strncpy(buf, b, buflen);
+		buf[buflen-1] = '\0';
+	}
+	return 0;
+#else
+	return strerror_r(err, buf, buflen);
+#endif
+}
+
+uintmax_t
+malloc_strtoumax(const char *restrict nptr, char **restrict endptr, int base) {
+	uintmax_t ret, digit;
+	unsigned b;
+	bool neg;
+	const char *p, *ns;
+
+	p = nptr;
+	if (base < 0 || base == 1 || base > 36) {
+		ns = p;
+		set_errno(EINVAL);
+		ret = UINTMAX_MAX;
+		goto label_return;
+	}
+	b = base;
+
+	/* Swallow leading whitespace and get sign, if any. */
+	neg = false;
+	while (true) {
+		switch (*p) {
+		case '\t': case '\n': case '\v': case '\f': case '\r': case ' ':
+			p++;
+			break;
+		case '-':
+			neg = true;
+			/* Fall through. */
+		case '+':
+			p++;
+			/* Fall through. */
+		default:
+			goto label_prefix;
+		}
+	}
+
+	/* Get prefix, if any. */
+	label_prefix:
+	/*
+	 * Note where the first non-whitespace/sign character is so that it is
+	 * possible to tell whether any digits are consumed (e.g., "  0" vs.
+	 * "  -x").
+	 */
+	ns = p;
+	if (*p == '0') {
+		switch (p[1]) {
+		case '0': case '1': case '2': case '3': case '4': case '5':
+		case '6': case '7':
+			if (b == 0) {
+				b = 8;
+			}
+			if (b == 8) {
+				p++;
+			}
+			break;
+		case 'X': case 'x':
+			switch (p[2]) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+			case 'A': case 'B': case 'C': case 'D': case 'E':
+			case 'F':
+			case 'a': case 'b': case 'c': case 'd': case 'e':
+			case 'f':
+				if (b == 0) {
+					b = 16;
+				}
+				if (b == 16) {
+					p += 2;
+				}
+				break;
+			default:
+				break;
+			}
+			break;
+		default:
+			p++;
+			ret = 0;
+			goto label_return;
+		}
+	}
+	if (b == 0) {
+		b = 10;
+	}
+
+	/* Convert. */
+	ret = 0;
+	while ((*p >= '0' && *p <= '9' && (digit = *p - '0') < b)
+	    || (*p >= 'A' && *p <= 'Z' && (digit = 10 + *p - 'A') < b)
+	    || (*p >= 'a' && *p <= 'z' && (digit = 10 + *p - 'a') < b)) {
+		uintmax_t pret = ret;
+		ret *= b;
+		ret += digit;
+		if (ret < pret) {
+			/* Overflow. */
+			set_errno(ERANGE);
+			ret = UINTMAX_MAX;
+			goto label_return;
+		}
+		p++;
+	}
+	if (neg) {
+		ret = (uintmax_t)(-((intmax_t)ret));
+	}
+
+	if (p == ns) {
+		/* No conversion performed. */
+		set_errno(EINVAL);
+		ret = UINTMAX_MAX;
+		goto label_return;
+	}
+
+label_return:
+	if (endptr != NULL) {
+		if (p == ns) {
+			/* No characters were converted. */
+			*endptr = (char *)nptr;
+		} else {
+			*endptr = (char *)p;
+		}
+	}
+	return ret;
+}
+
+static char *
+u2s(uintmax_t x, unsigned base, bool uppercase, char *s, size_t *slen_p) {
+	unsigned i;
+
+	i = U2S_BUFSIZE - 1;
+	s[i] = '\0';
+	switch (base) {
+	case 10:
+		do {
+			i--;
+			s[i] = "0123456789"[x % (uint64_t)10];
+			x /= (uint64_t)10;
+		} while (x > 0);
+		break;
+	case 16: {
+		const char *digits = (uppercase)
+		    ? "0123456789ABCDEF"
+		    : "0123456789abcdef";
+
+		do {
+			i--;
+			s[i] = digits[x & 0xf];
+			x >>= 4;
+		} while (x > 0);
+		break;
+	} default: {
+		const char *digits = (uppercase)
+		    ? "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+		    : "0123456789abcdefghijklmnopqrstuvwxyz";
+
+		assert(base >= 2 && base <= 36);
+		do {
+			i--;
+			s[i] = digits[x % (uint64_t)base];
+			x /= (uint64_t)base;
+		} while (x > 0);
+	}}
+
+	*slen_p = U2S_BUFSIZE - 1 - i;
+	return &s[i];
+}
+
+static char *
+d2s(intmax_t x, char sign, char *s, size_t *slen_p) {
+	bool neg;
+
+	if ((neg = (x < 0))) {
+		x = -x;
+	}
+	s = u2s(x, 10, false, s, slen_p);
+	if (neg) {
+		sign = '-';
+	}
+	switch (sign) {
+	case '-':
+		if (!neg) {
+			break;
+		}
+		/* Fall through. */
+	case ' ':
+	case '+':
+		s--;
+		(*slen_p)++;
+		*s = sign;
+		break;
+	default: not_reached();
+	}
+	return s;
+}
+
+static char *
+o2s(uintmax_t x, bool alt_form, char *s, size_t *slen_p) {
+	s = u2s(x, 8, false, s, slen_p);
+	if (alt_form && *s != '0') {
+		s--;
+		(*slen_p)++;
+		*s = '0';
+	}
+	return s;
+}
+
+static char *
+x2s(uintmax_t x, bool alt_form, bool uppercase, char *s, size_t *slen_p) {
+	s = u2s(x, 16, uppercase, s, slen_p);
+	if (alt_form) {
+		s -= 2;
+		(*slen_p) += 2;
+		memcpy(s, uppercase ? "0X" : "0x", 2);
+	}
+	return s;
+}
+
+size_t
+malloc_vsnprintf(char *str, size_t size, const char *format, va_list ap) {
+	size_t i;
+	const char *f;
+
+#define APPEND_C(c) do {						\
+	if (i < size) {							\
+		str[i] = (c);						\
+	}								\
+	i++;								\
+} while (0)
+#define APPEND_S(s, slen) do {						\
+	if (i < size) {							\
+		size_t cpylen = (slen <= size - i) ? slen : size - i;	\
+		memcpy(&str[i], s, cpylen);				\
+	}								\
+	i += slen;							\
+} while (0)
+#define APPEND_PADDED_S(s, slen, width, left_justify) do {		\
+	/* Left padding. */						\
+	size_t pad_len = (width == -1) ? 0 : ((slen < (size_t)width) ?	\
+	    (size_t)width - slen : 0);					\
+	if (!left_justify && pad_len != 0) {				\
+		size_t j;						\
+		for (j = 0; j < pad_len; j++) {				\
+			APPEND_C(' ');					\
+		}							\
+	}								\
+	/* Value. */							\
+	APPEND_S(s, slen);						\
+	/* Right padding. */						\
+	if (left_justify && pad_len != 0) {				\
+		size_t j;						\
+		for (j = 0; j < pad_len; j++) {				\
+			APPEND_C(' ');					\
+		}							\
+	}								\
+} while (0)
+#define GET_ARG_NUMERIC(val, len) do {					\
+	switch ((unsigned char)len) {					\
+	case '?':							\
+		val = va_arg(ap, int);					\
+		break;							\
+	case '?' | 0x80:						\
+		val = va_arg(ap, unsigned int);				\
+		break;							\
+	case 'l':							\
+		val = va_arg(ap, long);					\
+		break;							\
+	case 'l' | 0x80:						\
+		val = va_arg(ap, unsigned long);			\
+		break;							\
+	case 'q':							\
+		val = va_arg(ap, long long);				\
+		break;							\
+	case 'q' | 0x80:						\
+		val = va_arg(ap, unsigned long long);			\
+		break;							\
+	case 'j':							\
+		val = va_arg(ap, intmax_t);				\
+		break;							\
+	case 'j' | 0x80:						\
+		val = va_arg(ap, uintmax_t);				\
+		break;							\
+	case 't':							\
+		val = va_arg(ap, ptrdiff_t);				\
+		break;							\
+	case 'z':							\
+		val = va_arg(ap, ssize_t);				\
+		break;							\
+	case 'z' | 0x80:						\
+		val = va_arg(ap, size_t);				\
+		break;							\
+	case 'p': /* Synthetic; used for %p. */				\
+		val = va_arg(ap, uintptr_t);				\
+		break;							\
+	default:							\
+		not_reached();						\
+		val = 0;						\
+	}								\
+} while (0)
+
+	i = 0;
+	f = format;
+	while (true) {
+		switch (*f) {
+		case '\0': goto label_out;
+		case '%': {
+			bool alt_form = false;
+			bool left_justify = false;
+			bool plus_space = false;
+			bool plus_plus = false;
+			int prec = -1;
+			int width = -1;
+			unsigned char len = '?';
+			char *s;
+			size_t slen;
+
+			f++;
+			/* Flags. */
+			while (true) {
+				switch (*f) {
+				case '#':
+					assert(!alt_form);
+					alt_form = true;
+					break;
+				case '-':
+					assert(!left_justify);
+					left_justify = true;
+					break;
+				case ' ':
+					assert(!plus_space);
+					plus_space = true;
+					break;
+				case '+':
+					assert(!plus_plus);
+					plus_plus = true;
+					break;
+				default: goto label_width;
+				}
+				f++;
+			}
+			/* Width. */
+			label_width:
+			switch (*f) {
+			case '*':
+				width = va_arg(ap, int);
+				f++;
+				if (width < 0) {
+					left_justify = true;
+					width = -width;
+				}
+				break;
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9': {
+				uintmax_t uwidth;
+				set_errno(0);
+				uwidth = malloc_strtoumax(f, (char **)&f, 10);
+				assert(uwidth != UINTMAX_MAX || get_errno() !=
+				    ERANGE);
+				width = (int)uwidth;
+				break;
+			} default:
+				break;
+			}
+			/* Width/precision separator. */
+			if (*f == '.') {
+				f++;
+			} else {
+				goto label_length;
+			}
+			/* Precision. */
+			switch (*f) {
+			case '*':
+				prec = va_arg(ap, int);
+				f++;
+				break;
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9': {
+				uintmax_t uprec;
+				set_errno(0);
+				uprec = malloc_strtoumax(f, (char **)&f, 10);
+				assert(uprec != UINTMAX_MAX || get_errno() !=
+				    ERANGE);
+				prec = (int)uprec;
+				break;
+			}
+			default: break;
+			}
+			/* Length. */
+			label_length:
+			switch (*f) {
+			case 'l':
+				f++;
+				if (*f == 'l') {
+					len = 'q';
+					f++;
+				} else {
+					len = 'l';
+				}
+				break;
+			case 'q': case 'j': case 't': case 'z':
+				len = *f;
+				f++;
+				break;
+			default: break;
+			}
+			/* Conversion specifier. */
+			switch (*f) {
+			case '%':
+				/* %% */
+				APPEND_C(*f);
+				f++;
+				break;
+			case 'd': case 'i': {
+				intmax_t val JEMALLOC_CC_SILENCE_INIT(0);
+				char buf[D2S_BUFSIZE];
+
+				GET_ARG_NUMERIC(val, len);
+				s = d2s(val, (plus_plus ? '+' : (plus_space ?
+				    ' ' : '-')), buf, &slen);
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			} case 'o': {
+				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
+				char buf[O2S_BUFSIZE];
+
+				GET_ARG_NUMERIC(val, len | 0x80);
+				s = o2s(val, alt_form, buf, &slen);
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			} case 'u': {
+				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
+				char buf[U2S_BUFSIZE];
+
+				GET_ARG_NUMERIC(val, len | 0x80);
+				s = u2s(val, 10, false, buf, &slen);
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			} case 'x': case 'X': {
+				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
+				char buf[X2S_BUFSIZE];
+
+				GET_ARG_NUMERIC(val, len | 0x80);
+				s = x2s(val, alt_form, *f == 'X', buf, &slen);
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			} case 'c': {
+				unsigned char val;
+				char buf[2];
+
+				assert(len == '?' || len == 'l');
+				assert_not_implemented(len != 'l');
+				val = va_arg(ap, int);
+				buf[0] = val;
+				buf[1] = '\0';
+				APPEND_PADDED_S(buf, 1, width, left_justify);
+				f++;
+				break;
+			} case 's':
+				assert(len == '?' || len == 'l');
+				assert_not_implemented(len != 'l');
+				s = va_arg(ap, char *);
+				slen = (prec < 0) ? strlen(s) : (size_t)prec;
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			case 'p': {
+				uintmax_t val;
+				char buf[X2S_BUFSIZE];
+
+				GET_ARG_NUMERIC(val, 'p');
+				s = x2s(val, true, false, buf, &slen);
+				APPEND_PADDED_S(s, slen, width, left_justify);
+				f++;
+				break;
+			} default: not_reached();
+			}
+			break;
+		} default: {
+			APPEND_C(*f);
+			f++;
+			break;
+		}}
+	}
+	label_out:
+	if (i < size) {
+		str[i] = '\0';
+	} else {
+		str[size - 1] = '\0';
+	}
+
+#undef APPEND_C
+#undef APPEND_S
+#undef APPEND_PADDED_S
+#undef GET_ARG_NUMERIC
+	return i;
+}
+
+JEMALLOC_FORMAT_PRINTF(3, 4)
+size_t
+malloc_snprintf(char *str, size_t size, const char *format, ...) {
+	size_t ret;
+	va_list ap;
+
+	va_start(ap, format);
+	ret = malloc_vsnprintf(str, size, format, ap);
+	va_end(ap);
+
+	return ret;
+}
+
+void
+malloc_vcprintf(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *format, va_list ap) {
+	char buf[MALLOC_PRINTF_BUFSIZE];
+
+	if (write_cb == NULL) {
+		/*
+		 * The caller did not provide an alternate write_cb callback
+		 * function, so use the default one.  malloc_write() is an
+		 * inline function, so use malloc_message() directly here.
+		 */
+		write_cb = (je_malloc_message != NULL) ? je_malloc_message :
+		    wrtmessage;
+		cbopaque = NULL;
+	}
+
+	malloc_vsnprintf(buf, sizeof(buf), format, ap);
+	write_cb(cbopaque, buf);
+}
+
+/*
+ * Print to a callback function in such a way as to (hopefully) avoid memory
+ * allocation.
+ */
+JEMALLOC_FORMAT_PRINTF(3, 4)
+void
+malloc_cprintf(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *format, ...) {
+	va_list ap;
+
+	va_start(ap, format);
+	malloc_vcprintf(write_cb, cbopaque, format, ap);
+	va_end(ap);
+}
+
+/* Print to stderr in such a way as to avoid memory allocation. */
+JEMALLOC_FORMAT_PRINTF(1, 2)
+void
+malloc_printf(const char *format, ...) {
+	va_list ap;
+
+	va_start(ap, format);
+	malloc_vcprintf(NULL, NULL, format, ap);
+	va_end(ap);
+}
+
+/*
+ * Restore normal assertion macros, in order to make it possible to compile all
+ * C files as a single concatenation.
+ */
+#undef assert
+#undef not_reached
+#undef not_implemented
+#undef assert_not_implemented
+#include "jemalloc/internal/assert.h"
diff --git a/redis-stable/deps/jemalloc/src/mutex.c b/redis-stable/deps/jemalloc/src/mutex.c
new file mode 100644
index 00000000..30222b3e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/mutex.c
@@ -0,0 +1,224 @@
+#define JEMALLOC_MUTEX_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/spin.h"
+
+#ifndef _CRT_SPINCOUNT
+#define _CRT_SPINCOUNT 4000
+#endif
+
+/******************************************************************************/
+/* Data. */
+
+#ifdef JEMALLOC_LAZY_LOCK
+bool isthreaded = false;
+#endif
+#ifdef JEMALLOC_MUTEX_INIT_CB
+static bool		postpone_init = true;
+static malloc_mutex_t	*postponed_mutexes = NULL;
+#endif
+
+/******************************************************************************/
+/*
+ * We intercept pthread_create() calls in order to toggle isthreaded if the
+ * process goes multi-threaded.
+ */
+
+#if defined(JEMALLOC_LAZY_LOCK) && !defined(_WIN32)
+JEMALLOC_EXPORT int
+pthread_create(pthread_t *__restrict thread,
+    const pthread_attr_t *__restrict attr, void *(*start_routine)(void *),
+    void *__restrict arg) {
+	return pthread_create_wrapper(thread, attr, start_routine, arg);
+}
+#endif
+
+/******************************************************************************/
+
+#ifdef JEMALLOC_MUTEX_INIT_CB
+JEMALLOC_EXPORT int	_pthread_mutex_init_calloc_cb(pthread_mutex_t *mutex,
+    void *(calloc_cb)(size_t, size_t));
+#endif
+
+void
+malloc_mutex_lock_slow(malloc_mutex_t *mutex) {
+	mutex_prof_data_t *data = &mutex->prof_data;
+	UNUSED nstime_t before = NSTIME_ZERO_INITIALIZER;
+
+	if (ncpus == 1) {
+		goto label_spin_done;
+	}
+
+	int cnt = 0, max_cnt = MALLOC_MUTEX_MAX_SPIN;
+	do {
+		spin_cpu_spinwait();
+		if (!malloc_mutex_trylock_final(mutex)) {
+			data->n_spin_acquired++;
+			return;
+		}
+	} while (cnt++ < max_cnt);
+
+	if (!config_stats) {
+		/* Only spin is useful when stats is off. */
+		malloc_mutex_lock_final(mutex);
+		return;
+	}
+label_spin_done:
+	nstime_update(&before);
+	/* Copy before to after to avoid clock skews. */
+	nstime_t after;
+	nstime_copy(&after, &before);
+	uint32_t n_thds = atomic_fetch_add_u32(&data->n_waiting_thds, 1,
+	    ATOMIC_RELAXED) + 1;
+	/* One last try as above two calls may take quite some cycles. */
+	if (!malloc_mutex_trylock_final(mutex)) {
+		atomic_fetch_sub_u32(&data->n_waiting_thds, 1, ATOMIC_RELAXED);
+		data->n_spin_acquired++;
+		return;
+	}
+
+	/* True slow path. */
+	malloc_mutex_lock_final(mutex);
+	/* Update more slow-path only counters. */
+	atomic_fetch_sub_u32(&data->n_waiting_thds, 1, ATOMIC_RELAXED);
+	nstime_update(&after);
+
+	nstime_t delta;
+	nstime_copy(&delta, &after);
+	nstime_subtract(&delta, &before);
+
+	data->n_wait_times++;
+	nstime_add(&data->tot_wait_time, &delta);
+	if (nstime_compare(&data->max_wait_time, &delta) < 0) {
+		nstime_copy(&data->max_wait_time, &delta);
+	}
+	if (n_thds > data->max_n_thds) {
+		data->max_n_thds = n_thds;
+	}
+}
+
+static void
+mutex_prof_data_init(mutex_prof_data_t *data) {
+	memset(data, 0, sizeof(mutex_prof_data_t));
+	nstime_init(&data->max_wait_time, 0);
+	nstime_init(&data->tot_wait_time, 0);
+	data->prev_owner = NULL;
+}
+
+void
+malloc_mutex_prof_data_reset(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	malloc_mutex_assert_owner(tsdn, mutex);
+	mutex_prof_data_init(&mutex->prof_data);
+}
+
+static int
+mutex_addr_comp(const witness_t *witness1, void *mutex1,
+    const witness_t *witness2, void *mutex2) {
+	assert(mutex1 != NULL);
+	assert(mutex2 != NULL);
+	uintptr_t mu1int = (uintptr_t)mutex1;
+	uintptr_t mu2int = (uintptr_t)mutex2;
+	if (mu1int < mu2int) {
+		return -1;
+	} else if (mu1int == mu2int) {
+		return 0;
+	} else {
+		return 1;
+	}
+}
+
+bool
+malloc_mutex_init(malloc_mutex_t *mutex, const char *name,
+    witness_rank_t rank, malloc_mutex_lock_order_t lock_order) {
+	mutex_prof_data_init(&mutex->prof_data);
+#ifdef _WIN32
+#  if _WIN32_WINNT >= 0x0600
+	InitializeSRWLock(&mutex->lock);
+#  else
+	if (!InitializeCriticalSectionAndSpinCount(&mutex->lock,
+	    _CRT_SPINCOUNT)) {
+		return true;
+	}
+#  endif
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+	mutex->lock = OS_UNFAIR_LOCK_INIT;
+#elif (defined(JEMALLOC_OSSPIN))
+	mutex->lock = 0;
+#elif (defined(JEMALLOC_MUTEX_INIT_CB))
+	if (postpone_init) {
+		mutex->postponed_next = postponed_mutexes;
+		postponed_mutexes = mutex;
+	} else {
+		if (_pthread_mutex_init_calloc_cb(&mutex->lock,
+		    bootstrap_calloc) != 0) {
+			return true;
+		}
+	}
+#else
+	pthread_mutexattr_t attr;
+
+	if (pthread_mutexattr_init(&attr) != 0) {
+		return true;
+	}
+	pthread_mutexattr_settype(&attr, MALLOC_MUTEX_TYPE);
+	if (pthread_mutex_init(&mutex->lock, &attr) != 0) {
+		pthread_mutexattr_destroy(&attr);
+		return true;
+	}
+	pthread_mutexattr_destroy(&attr);
+#endif
+	if (config_debug) {
+		mutex->lock_order = lock_order;
+		if (lock_order == malloc_mutex_address_ordered) {
+			witness_init(&mutex->witness, name, rank,
+			    mutex_addr_comp, mutex);
+		} else {
+			witness_init(&mutex->witness, name, rank, NULL, NULL);
+		}
+	}
+	return false;
+}
+
+void
+malloc_mutex_prefork(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	malloc_mutex_lock(tsdn, mutex);
+}
+
+void
+malloc_mutex_postfork_parent(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+	malloc_mutex_unlock(tsdn, mutex);
+}
+
+void
+malloc_mutex_postfork_child(tsdn_t *tsdn, malloc_mutex_t *mutex) {
+#ifdef JEMALLOC_MUTEX_INIT_CB
+	malloc_mutex_unlock(tsdn, mutex);
+#else
+	if (malloc_mutex_init(mutex, mutex->witness.name,
+	    mutex->witness.rank, mutex->lock_order)) {
+		malloc_printf("<jemalloc>: Error re-initializing mutex in "
+		    "child\n");
+		if (opt_abort) {
+			abort();
+		}
+	}
+#endif
+}
+
+bool
+malloc_mutex_boot(void) {
+#ifdef JEMALLOC_MUTEX_INIT_CB
+	postpone_init = false;
+	while (postponed_mutexes != NULL) {
+		if (_pthread_mutex_init_calloc_cb(&postponed_mutexes->lock,
+		    bootstrap_calloc) != 0) {
+			return true;
+		}
+		postponed_mutexes = postponed_mutexes->postponed_next;
+	}
+#endif
+	return false;
+}
diff --git a/redis-stable/deps/jemalloc/src/mutex_pool.c b/redis-stable/deps/jemalloc/src/mutex_pool.c
new file mode 100644
index 00000000..f24d10e4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/mutex_pool.c
@@ -0,0 +1,18 @@
+#define JEMALLOC_MUTEX_POOL_C_
+
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_pool.h"
+
+bool
+mutex_pool_init(mutex_pool_t *pool, const char *name, witness_rank_t rank) {
+	for (int i = 0; i < MUTEX_POOL_SIZE; ++i) {
+		if (malloc_mutex_init(&pool->mutexes[i], name, rank,
+		    malloc_mutex_address_ordered)) {
+			return true;
+		}
+	}
+	return false;
+}
diff --git a/redis-stable/deps/jemalloc/src/nstime.c b/redis-stable/deps/jemalloc/src/nstime.c
new file mode 100644
index 00000000..71db3539
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/nstime.c
@@ -0,0 +1,170 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/nstime.h"
+
+#include "jemalloc/internal/assert.h"
+
+#define BILLION	UINT64_C(1000000000)
+#define MILLION	UINT64_C(1000000)
+
+void
+nstime_init(nstime_t *time, uint64_t ns) {
+	time->ns = ns;
+}
+
+void
+nstime_init2(nstime_t *time, uint64_t sec, uint64_t nsec) {
+	time->ns = sec * BILLION + nsec;
+}
+
+uint64_t
+nstime_ns(const nstime_t *time) {
+	return time->ns;
+}
+
+uint64_t
+nstime_msec(const nstime_t *time) {
+	return time->ns / MILLION;
+}
+
+uint64_t
+nstime_sec(const nstime_t *time) {
+	return time->ns / BILLION;
+}
+
+uint64_t
+nstime_nsec(const nstime_t *time) {
+	return time->ns % BILLION;
+}
+
+void
+nstime_copy(nstime_t *time, const nstime_t *source) {
+	*time = *source;
+}
+
+int
+nstime_compare(const nstime_t *a, const nstime_t *b) {
+	return (a->ns > b->ns) - (a->ns < b->ns);
+}
+
+void
+nstime_add(nstime_t *time, const nstime_t *addend) {
+	assert(UINT64_MAX - time->ns >= addend->ns);
+
+	time->ns += addend->ns;
+}
+
+void
+nstime_iadd(nstime_t *time, uint64_t addend) {
+	assert(UINT64_MAX - time->ns >= addend);
+
+	time->ns += addend;
+}
+
+void
+nstime_subtract(nstime_t *time, const nstime_t *subtrahend) {
+	assert(nstime_compare(time, subtrahend) >= 0);
+
+	time->ns -= subtrahend->ns;
+}
+
+void
+nstime_isubtract(nstime_t *time, uint64_t subtrahend) {
+	assert(time->ns >= subtrahend);
+
+	time->ns -= subtrahend;
+}
+
+void
+nstime_imultiply(nstime_t *time, uint64_t multiplier) {
+	assert((((time->ns | multiplier) & (UINT64_MAX << (sizeof(uint64_t) <<
+	    2))) == 0) || ((time->ns * multiplier) / multiplier == time->ns));
+
+	time->ns *= multiplier;
+}
+
+void
+nstime_idivide(nstime_t *time, uint64_t divisor) {
+	assert(divisor != 0);
+
+	time->ns /= divisor;
+}
+
+uint64_t
+nstime_divide(const nstime_t *time, const nstime_t *divisor) {
+	assert(divisor->ns != 0);
+
+	return time->ns / divisor->ns;
+}
+
+#ifdef _WIN32
+#  define NSTIME_MONOTONIC true
+static void
+nstime_get(nstime_t *time) {
+	FILETIME ft;
+	uint64_t ticks_100ns;
+
+	GetSystemTimeAsFileTime(&ft);
+	ticks_100ns = (((uint64_t)ft.dwHighDateTime) << 32) | ft.dwLowDateTime;
+
+	nstime_init(time, ticks_100ns * 100);
+}
+#elif defined(JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE)
+#  define NSTIME_MONOTONIC true
+static void
+nstime_get(nstime_t *time) {
+	struct timespec ts;
+
+	clock_gettime(CLOCK_MONOTONIC_COARSE, &ts);
+	nstime_init2(time, ts.tv_sec, ts.tv_nsec);
+}
+#elif defined(JEMALLOC_HAVE_CLOCK_MONOTONIC)
+#  define NSTIME_MONOTONIC true
+static void
+nstime_get(nstime_t *time) {
+	struct timespec ts;
+
+	clock_gettime(CLOCK_MONOTONIC, &ts);
+	nstime_init2(time, ts.tv_sec, ts.tv_nsec);
+}
+#elif defined(JEMALLOC_HAVE_MACH_ABSOLUTE_TIME)
+#  define NSTIME_MONOTONIC true
+static void
+nstime_get(nstime_t *time) {
+	nstime_init(time, mach_absolute_time());
+}
+#else
+#  define NSTIME_MONOTONIC false
+static void
+nstime_get(nstime_t *time) {
+	struct timeval tv;
+
+	gettimeofday(&tv, NULL);
+	nstime_init2(time, tv.tv_sec, tv.tv_usec * 1000);
+}
+#endif
+
+static bool
+nstime_monotonic_impl(void) {
+	return NSTIME_MONOTONIC;
+#undef NSTIME_MONOTONIC
+}
+nstime_monotonic_t *JET_MUTABLE nstime_monotonic = nstime_monotonic_impl;
+
+static bool
+nstime_update_impl(nstime_t *time) {
+	nstime_t old_time;
+
+	nstime_copy(&old_time, time);
+	nstime_get(time);
+
+	/* Handle non-monotonic clocks. */
+	if (unlikely(nstime_compare(&old_time, time) > 0)) {
+		nstime_copy(time, &old_time);
+		return true;
+	}
+
+	return false;
+}
+nstime_update_t *JET_MUTABLE nstime_update = nstime_update_impl;
diff --git a/redis-stable/deps/jemalloc/src/pages.c b/redis-stable/deps/jemalloc/src/pages.c
new file mode 100644
index 00000000..26002692
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/pages.c
@@ -0,0 +1,606 @@
+#define JEMALLOC_PAGES_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+
+#include "jemalloc/internal/pages.h"
+
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/malloc_io.h"
+
+#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
+#include <sys/sysctl.h>
+#ifdef __FreeBSD__
+#include <vm/vm_param.h>
+#endif
+#endif
+
+/******************************************************************************/
+/* Data. */
+
+/* Actual operating system page size, detected during bootstrap, <= PAGE. */
+static size_t	os_page;
+
+#ifndef _WIN32
+#  define PAGES_PROT_COMMIT (PROT_READ | PROT_WRITE)
+#  define PAGES_PROT_DECOMMIT (PROT_NONE)
+static int	mmap_flags;
+#endif
+static bool	os_overcommits;
+
+const char *thp_mode_names[] = {
+	"default",
+	"always",
+	"never",
+	"not supported"
+};
+thp_mode_t opt_thp = THP_MODE_DEFAULT;
+thp_mode_t init_system_thp_mode;
+
+/* Runtime support for lazy purge. Irrelevant when !pages_can_purge_lazy. */
+static bool pages_can_purge_lazy_runtime = true;
+
+/******************************************************************************/
+/*
+ * Function prototypes for static functions that are referenced prior to
+ * definition.
+ */
+
+static void os_pages_unmap(void *addr, size_t size);
+
+/******************************************************************************/
+
+static void *
+os_pages_map(void *addr, size_t size, size_t alignment, bool *commit) {
+	assert(ALIGNMENT_ADDR2BASE(addr, os_page) == addr);
+	assert(ALIGNMENT_CEILING(size, os_page) == size);
+	assert(size != 0);
+
+	if (os_overcommits) {
+		*commit = true;
+	}
+
+	void *ret;
+#ifdef _WIN32
+	/*
+	 * If VirtualAlloc can't allocate at the given address when one is
+	 * given, it fails and returns NULL.
+	 */
+	ret = VirtualAlloc(addr, size, MEM_RESERVE | (*commit ? MEM_COMMIT : 0),
+	    PAGE_READWRITE);
+#else
+	/*
+	 * We don't use MAP_FIXED here, because it can cause the *replacement*
+	 * of existing mappings, and we only want to create new mappings.
+	 */
+	{
+		int prot = *commit ? PAGES_PROT_COMMIT : PAGES_PROT_DECOMMIT;
+
+		ret = mmap(addr, size, prot, mmap_flags, -1, 0);
+	}
+	assert(ret != NULL);
+
+	if (ret == MAP_FAILED) {
+		ret = NULL;
+	} else if (addr != NULL && ret != addr) {
+		/*
+		 * We succeeded in mapping memory, but not in the right place.
+		 */
+		os_pages_unmap(ret, size);
+		ret = NULL;
+	}
+#endif
+	assert(ret == NULL || (addr == NULL && ret != addr) || (addr != NULL &&
+	    ret == addr));
+	return ret;
+}
+
+static void *
+os_pages_trim(void *addr, size_t alloc_size, size_t leadsize, size_t size,
+    bool *commit) {
+	void *ret = (void *)((uintptr_t)addr + leadsize);
+
+	assert(alloc_size >= leadsize + size);
+#ifdef _WIN32
+	os_pages_unmap(addr, alloc_size);
+	void *new_addr = os_pages_map(ret, size, PAGE, commit);
+	if (new_addr == ret) {
+		return ret;
+	}
+	if (new_addr != NULL) {
+		os_pages_unmap(new_addr, size);
+	}
+	return NULL;
+#else
+	size_t trailsize = alloc_size - leadsize - size;
+
+	if (leadsize != 0) {
+		os_pages_unmap(addr, leadsize);
+	}
+	if (trailsize != 0) {
+		os_pages_unmap((void *)((uintptr_t)ret + size), trailsize);
+	}
+	return ret;
+#endif
+}
+
+static void
+os_pages_unmap(void *addr, size_t size) {
+	assert(ALIGNMENT_ADDR2BASE(addr, os_page) == addr);
+	assert(ALIGNMENT_CEILING(size, os_page) == size);
+
+#ifdef _WIN32
+	if (VirtualFree(addr, 0, MEM_RELEASE) == 0)
+#else
+	if (munmap(addr, size) == -1)
+#endif
+	{
+		char buf[BUFERROR_BUF];
+
+		buferror(get_errno(), buf, sizeof(buf));
+		malloc_printf("<jemalloc>: Error in "
+#ifdef _WIN32
+		    "VirtualFree"
+#else
+		    "munmap"
+#endif
+		    "(): %s\n", buf);
+		if (opt_abort) {
+			abort();
+		}
+	}
+}
+
+static void *
+pages_map_slow(size_t size, size_t alignment, bool *commit) {
+	size_t alloc_size = size + alignment - os_page;
+	/* Beware size_t wrap-around. */
+	if (alloc_size < size) {
+		return NULL;
+	}
+
+	void *ret;
+	do {
+		void *pages = os_pages_map(NULL, alloc_size, alignment, commit);
+		if (pages == NULL) {
+			return NULL;
+		}
+		size_t leadsize = ALIGNMENT_CEILING((uintptr_t)pages, alignment)
+		    - (uintptr_t)pages;
+		ret = os_pages_trim(pages, alloc_size, leadsize, size, commit);
+	} while (ret == NULL);
+
+	assert(ret != NULL);
+	assert(PAGE_ADDR2BASE(ret) == ret);
+	return ret;
+}
+
+void *
+pages_map(void *addr, size_t size, size_t alignment, bool *commit) {
+	assert(alignment >= PAGE);
+	assert(ALIGNMENT_ADDR2BASE(addr, alignment) == addr);
+
+	/*
+	 * Ideally, there would be a way to specify alignment to mmap() (like
+	 * NetBSD has), but in the absence of such a feature, we have to work
+	 * hard to efficiently create aligned mappings.  The reliable, but
+	 * slow method is to create a mapping that is over-sized, then trim the
+	 * excess.  However, that always results in one or two calls to
+	 * os_pages_unmap(), and it can leave holes in the process's virtual
+	 * memory map if memory grows downward.
+	 *
+	 * Optimistically try mapping precisely the right amount before falling
+	 * back to the slow method, with the expectation that the optimistic
+	 * approach works most of the time.
+	 */
+
+	void *ret = os_pages_map(addr, size, os_page, commit);
+	if (ret == NULL || ret == addr) {
+		return ret;
+	}
+	assert(addr == NULL);
+	if (ALIGNMENT_ADDR2OFFSET(ret, alignment) != 0) {
+		os_pages_unmap(ret, size);
+		return pages_map_slow(size, alignment, commit);
+	}
+
+	assert(PAGE_ADDR2BASE(ret) == ret);
+	return ret;
+}
+
+void
+pages_unmap(void *addr, size_t size) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+
+	os_pages_unmap(addr, size);
+}
+
+static bool
+pages_commit_impl(void *addr, size_t size, bool commit) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+
+	if (os_overcommits) {
+		return true;
+	}
+
+#ifdef _WIN32
+	return (commit ? (addr != VirtualAlloc(addr, size, MEM_COMMIT,
+	    PAGE_READWRITE)) : (!VirtualFree(addr, size, MEM_DECOMMIT)));
+#else
+	{
+		int prot = commit ? PAGES_PROT_COMMIT : PAGES_PROT_DECOMMIT;
+		void *result = mmap(addr, size, prot, mmap_flags | MAP_FIXED,
+		    -1, 0);
+		if (result == MAP_FAILED) {
+			return true;
+		}
+		if (result != addr) {
+			/*
+			 * We succeeded in mapping memory, but not in the right
+			 * place.
+			 */
+			os_pages_unmap(result, size);
+			return true;
+		}
+		return false;
+	}
+#endif
+}
+
+bool
+pages_commit(void *addr, size_t size) {
+	return pages_commit_impl(addr, size, true);
+}
+
+bool
+pages_decommit(void *addr, size_t size) {
+	return pages_commit_impl(addr, size, false);
+}
+
+bool
+pages_purge_lazy(void *addr, size_t size) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+
+	if (!pages_can_purge_lazy) {
+		return true;
+	}
+	if (!pages_can_purge_lazy_runtime) {
+		/*
+		 * Built with lazy purge enabled, but detected it was not
+		 * supported on the current system.
+		 */
+		return true;
+	}
+
+#ifdef _WIN32
+	VirtualAlloc(addr, size, MEM_RESET, PAGE_READWRITE);
+	return false;
+#elif defined(JEMALLOC_PURGE_MADVISE_FREE)
+	return (madvise(addr, size,
+#  ifdef MADV_FREE
+	    MADV_FREE
+#  else
+	    JEMALLOC_MADV_FREE
+#  endif
+	    ) != 0);
+#elif defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
+    !defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)
+	return (madvise(addr, size, MADV_DONTNEED) != 0);
+#else
+	not_reached();
+#endif
+}
+
+bool
+pages_purge_forced(void *addr, size_t size) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+
+	if (!pages_can_purge_forced) {
+		return true;
+	}
+
+#if defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
+    defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)
+	return (madvise(addr, size, MADV_DONTNEED) != 0);
+#elif defined(JEMALLOC_MAPS_COALESCE)
+	/* Try to overlay a new demand-zeroed mapping. */
+	return pages_commit(addr, size);
+#else
+	not_reached();
+#endif
+}
+
+static bool
+pages_huge_impl(void *addr, size_t size, bool aligned) {
+	if (aligned) {
+		assert(HUGEPAGE_ADDR2BASE(addr) == addr);
+		assert(HUGEPAGE_CEILING(size) == size);
+	}
+#ifdef JEMALLOC_HAVE_MADVISE_HUGE
+	return (madvise(addr, size, MADV_HUGEPAGE) != 0);
+#else
+	return true;
+#endif
+}
+
+bool
+pages_huge(void *addr, size_t size) {
+	return pages_huge_impl(addr, size, true);
+}
+
+static bool
+pages_huge_unaligned(void *addr, size_t size) {
+	return pages_huge_impl(addr, size, false);
+}
+
+static bool
+pages_nohuge_impl(void *addr, size_t size, bool aligned) {
+	if (aligned) {
+		assert(HUGEPAGE_ADDR2BASE(addr) == addr);
+		assert(HUGEPAGE_CEILING(size) == size);
+	}
+
+#ifdef JEMALLOC_HAVE_MADVISE_HUGE
+	return (madvise(addr, size, MADV_NOHUGEPAGE) != 0);
+#else
+	return false;
+#endif
+}
+
+bool
+pages_nohuge(void *addr, size_t size) {
+	return pages_nohuge_impl(addr, size, true);
+}
+
+static bool
+pages_nohuge_unaligned(void *addr, size_t size) {
+	return pages_nohuge_impl(addr, size, false);
+}
+
+bool
+pages_dontdump(void *addr, size_t size) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+#ifdef JEMALLOC_MADVISE_DONTDUMP
+	return madvise(addr, size, MADV_DONTDUMP) != 0;
+#else
+	return false;
+#endif
+}
+
+bool
+pages_dodump(void *addr, size_t size) {
+	assert(PAGE_ADDR2BASE(addr) == addr);
+	assert(PAGE_CEILING(size) == size);
+#ifdef JEMALLOC_MADVISE_DONTDUMP
+	return madvise(addr, size, MADV_DODUMP) != 0;
+#else
+	return false;
+#endif
+}
+
+
+static size_t
+os_page_detect(void) {
+#ifdef _WIN32
+	SYSTEM_INFO si;
+	GetSystemInfo(&si);
+	return si.dwPageSize;
+#elif defined(__FreeBSD__)
+	return getpagesize();
+#else
+	long result = sysconf(_SC_PAGESIZE);
+	if (result == -1) {
+		return LG_PAGE;
+	}
+	return (size_t)result;
+#endif
+}
+
+#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
+static bool
+os_overcommits_sysctl(void) {
+	int vm_overcommit;
+	size_t sz;
+
+	sz = sizeof(vm_overcommit);
+#if defined(__FreeBSD__) && defined(VM_OVERCOMMIT)
+	int mib[2];
+
+	mib[0] = CTL_VM;
+	mib[1] = VM_OVERCOMMIT;
+	if (sysctl(mib, 2, &vm_overcommit, &sz, NULL, 0) != 0) {
+		return false; /* Error. */
+	}
+#else
+	if (sysctlbyname("vm.overcommit", &vm_overcommit, &sz, NULL, 0) != 0) {
+		return false; /* Error. */
+	}
+#endif
+
+	return ((vm_overcommit & 0x3) == 0);
+}
+#endif
+
+#ifdef JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY
+/*
+ * Use syscall(2) rather than {open,read,close}(2) when possible to avoid
+ * reentry during bootstrapping if another library has interposed system call
+ * wrappers.
+ */
+static bool
+os_overcommits_proc(void) {
+	int fd;
+	char buf[1];
+
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_open)
+	#if defined(O_CLOEXEC)
+		fd = (int)syscall(SYS_open, "/proc/sys/vm/overcommit_memory", O_RDONLY |
+			O_CLOEXEC);
+	#else
+		fd = (int)syscall(SYS_open, "/proc/sys/vm/overcommit_memory", O_RDONLY);
+		if (fd != -1) {
+			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
+		}
+	#endif
+#elif defined(JEMALLOC_USE_SYSCALL) && defined(SYS_openat)
+	#if defined(O_CLOEXEC)
+		fd = (int)syscall(SYS_openat,
+			AT_FDCWD, "/proc/sys/vm/overcommit_memory", O_RDONLY | O_CLOEXEC);
+	#else
+		fd = (int)syscall(SYS_openat,
+			AT_FDCWD, "/proc/sys/vm/overcommit_memory", O_RDONLY);
+		if (fd != -1) {
+			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
+		}
+	#endif
+#else
+	#if defined(O_CLOEXEC)
+		fd = open("/proc/sys/vm/overcommit_memory", O_RDONLY | O_CLOEXEC);
+	#else
+		fd = open("/proc/sys/vm/overcommit_memory", O_RDONLY);
+		if (fd != -1) {
+			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
+		}
+	#endif
+#endif
+
+	if (fd == -1) {
+		return false; /* Error. */
+	}
+
+	ssize_t nread = malloc_read_fd(fd, &buf, sizeof(buf));
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_close)
+	syscall(SYS_close, fd);
+#else
+	close(fd);
+#endif
+
+	if (nread < 1) {
+		return false; /* Error. */
+	}
+	/*
+	 * /proc/sys/vm/overcommit_memory meanings:
+	 * 0: Heuristic overcommit.
+	 * 1: Always overcommit.
+	 * 2: Never overcommit.
+	 */
+	return (buf[0] == '0' || buf[0] == '1');
+}
+#endif
+
+void
+pages_set_thp_state (void *ptr, size_t size) {
+	if (opt_thp == thp_mode_default || opt_thp == init_system_thp_mode) {
+		return;
+	}
+	assert(opt_thp != thp_mode_not_supported &&
+	    init_system_thp_mode != thp_mode_not_supported);
+
+	if (opt_thp == thp_mode_always
+	    && init_system_thp_mode != thp_mode_never) {
+		assert(init_system_thp_mode == thp_mode_default);
+		pages_huge_unaligned(ptr, size);
+	} else if (opt_thp == thp_mode_never) {
+		assert(init_system_thp_mode == thp_mode_default ||
+		    init_system_thp_mode == thp_mode_always);
+		pages_nohuge_unaligned(ptr, size);
+	}
+}
+
+static void
+init_thp_state(void) {
+	if (!have_madvise_huge) {
+		if (metadata_thp_enabled() && opt_abort) {
+			malloc_write("<jemalloc>: no MADV_HUGEPAGE support\n");
+			abort();
+		}
+		goto label_error;
+	}
+
+	static const char sys_state_madvise[] = "always [madvise] never\n";
+	static const char sys_state_always[] = "[always] madvise never\n";
+	static const char sys_state_never[] = "always madvise [never]\n";
+	char buf[sizeof(sys_state_madvise)];
+
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_open)
+	int fd = (int)syscall(SYS_open,
+	    "/sys/kernel/mm/transparent_hugepage/enabled", O_RDONLY);
+#else
+	int fd = open("/sys/kernel/mm/transparent_hugepage/enabled", O_RDONLY);
+#endif
+	if (fd == -1) {
+		goto label_error;
+	}
+
+	ssize_t nread = malloc_read_fd(fd, &buf, sizeof(buf));
+#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_close)
+	syscall(SYS_close, fd);
+#else
+	close(fd);
+#endif
+
+	if (strncmp(buf, sys_state_madvise, (size_t)nread) == 0) {
+		init_system_thp_mode = thp_mode_default;
+	} else if (strncmp(buf, sys_state_always, (size_t)nread) == 0) {
+		init_system_thp_mode = thp_mode_always;
+	} else if (strncmp(buf, sys_state_never, (size_t)nread) == 0) {
+		init_system_thp_mode = thp_mode_never;
+	} else {
+		goto label_error;
+	}
+	return;
+label_error:
+	opt_thp = init_system_thp_mode = thp_mode_not_supported;
+}
+
+bool
+pages_boot(void) {
+	os_page = os_page_detect();
+	if (os_page > PAGE) {
+		malloc_write("<jemalloc>: Unsupported system page size\n");
+		if (opt_abort) {
+			abort();
+		}
+		return true;
+	}
+
+#ifndef _WIN32
+	mmap_flags = MAP_PRIVATE | MAP_ANON;
+#endif
+
+#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
+	os_overcommits = os_overcommits_sysctl();
+#elif defined(JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY)
+	os_overcommits = os_overcommits_proc();
+#  ifdef MAP_NORESERVE
+	if (os_overcommits) {
+		mmap_flags |= MAP_NORESERVE;
+	}
+#  endif
+#else
+	os_overcommits = false;
+#endif
+
+	init_thp_state();
+
+	/* Detect lazy purge runtime support. */
+	if (pages_can_purge_lazy) {
+		bool committed = false;
+		void *madv_free_page = os_pages_map(NULL, PAGE, PAGE, &committed);
+		if (madv_free_page == NULL) {
+			return true;
+		}
+		assert(pages_can_purge_lazy_runtime);
+		if (pages_purge_lazy(madv_free_page, PAGE)) {
+			pages_can_purge_lazy_runtime = false;
+		}
+		os_pages_unmap(madv_free_page, PAGE);
+	}
+
+	return false;
+}
diff --git a/redis-stable/deps/jemalloc/src/prng.c b/redis-stable/deps/jemalloc/src/prng.c
new file mode 100644
index 00000000..83c04bf9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/prng.c
@@ -0,0 +1,3 @@
+#define JEMALLOC_PRNG_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/prof.c b/redis-stable/deps/jemalloc/src/prof.c
new file mode 100644
index 00000000..13df641a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/prof.c
@@ -0,0 +1,2473 @@
+#define JEMALLOC_PROF_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/ckh.h"
+#include "jemalloc/internal/hash.h"
+#include "jemalloc/internal/malloc_io.h"
+#include "jemalloc/internal/mutex.h"
+
+/******************************************************************************/
+
+#ifdef JEMALLOC_PROF_LIBUNWIND
+#define UNW_LOCAL_ONLY
+#include <libunwind.h>
+#endif
+
+#ifdef JEMALLOC_PROF_LIBGCC
+/*
+ * We have a circular dependency -- jemalloc_internal.h tells us if we should
+ * use libgcc's unwinding functionality, but after we've included that, we've
+ * already hooked _Unwind_Backtrace.  We'll temporarily disable hooking.
+ */
+#undef _Unwind_Backtrace
+#include <unwind.h>
+#define _Unwind_Backtrace JEMALLOC_HOOK(_Unwind_Backtrace, hooks_libc_hook)
+#endif
+
+/******************************************************************************/
+/* Data. */
+
+bool		opt_prof = false;
+bool		opt_prof_active = true;
+bool		opt_prof_thread_active_init = true;
+size_t		opt_lg_prof_sample = LG_PROF_SAMPLE_DEFAULT;
+ssize_t		opt_lg_prof_interval = LG_PROF_INTERVAL_DEFAULT;
+bool		opt_prof_gdump = false;
+bool		opt_prof_final = false;
+bool		opt_prof_leak = false;
+bool		opt_prof_accum = false;
+char		opt_prof_prefix[
+    /* Minimize memory bloat for non-prof builds. */
+#ifdef JEMALLOC_PROF
+    PATH_MAX +
+#endif
+    1];
+
+/*
+ * Initialized as opt_prof_active, and accessed via
+ * prof_active_[gs]et{_unlocked,}().
+ */
+bool			prof_active;
+static malloc_mutex_t	prof_active_mtx;
+
+/*
+ * Initialized as opt_prof_thread_active_init, and accessed via
+ * prof_thread_active_init_[gs]et().
+ */
+static bool		prof_thread_active_init;
+static malloc_mutex_t	prof_thread_active_init_mtx;
+
+/*
+ * Initialized as opt_prof_gdump, and accessed via
+ * prof_gdump_[gs]et{_unlocked,}().
+ */
+bool			prof_gdump_val;
+static malloc_mutex_t	prof_gdump_mtx;
+
+uint64_t	prof_interval = 0;
+
+size_t		lg_prof_sample;
+
+/*
+ * Table of mutexes that are shared among gctx's.  These are leaf locks, so
+ * there is no problem with using them for more than one gctx at the same time.
+ * The primary motivation for this sharing though is that gctx's are ephemeral,
+ * and destroying mutexes causes complications for systems that allocate when
+ * creating/destroying mutexes.
+ */
+static malloc_mutex_t	*gctx_locks;
+static atomic_u_t	cum_gctxs; /* Atomic counter. */
+
+/*
+ * Table of mutexes that are shared among tdata's.  No operations require
+ * holding multiple tdata locks, so there is no problem with using them for more
+ * than one tdata at the same time, even though a gctx lock may be acquired
+ * while holding a tdata lock.
+ */
+static malloc_mutex_t	*tdata_locks;
+
+/*
+ * Global hash of (prof_bt_t *)-->(prof_gctx_t *).  This is the master data
+ * structure that knows about all backtraces currently captured.
+ */
+static ckh_t		bt2gctx;
+/* Non static to enable profiling. */
+malloc_mutex_t		bt2gctx_mtx;
+
+/*
+ * Tree of all extant prof_tdata_t structures, regardless of state,
+ * {attached,detached,expired}.
+ */
+static prof_tdata_tree_t	tdatas;
+static malloc_mutex_t	tdatas_mtx;
+
+static uint64_t		next_thr_uid;
+static malloc_mutex_t	next_thr_uid_mtx;
+
+static malloc_mutex_t	prof_dump_seq_mtx;
+static uint64_t		prof_dump_seq;
+static uint64_t		prof_dump_iseq;
+static uint64_t		prof_dump_mseq;
+static uint64_t		prof_dump_useq;
+
+/*
+ * This buffer is rather large for stack allocation, so use a single buffer for
+ * all profile dumps.
+ */
+static malloc_mutex_t	prof_dump_mtx;
+static char		prof_dump_buf[
+    /* Minimize memory bloat for non-prof builds. */
+#ifdef JEMALLOC_PROF
+    PROF_DUMP_BUFSIZE
+#else
+    1
+#endif
+];
+static size_t		prof_dump_buf_end;
+static int		prof_dump_fd;
+
+/* Do not dump any profiles until bootstrapping is complete. */
+static bool		prof_booted = false;
+
+/******************************************************************************/
+/*
+ * Function prototypes for static functions that are referenced prior to
+ * definition.
+ */
+
+static bool	prof_tctx_should_destroy(tsdn_t *tsdn, prof_tctx_t *tctx);
+static void	prof_tctx_destroy(tsd_t *tsd, prof_tctx_t *tctx);
+static bool	prof_tdata_should_destroy(tsdn_t *tsdn, prof_tdata_t *tdata,
+    bool even_if_attached);
+static void	prof_tdata_destroy(tsd_t *tsd, prof_tdata_t *tdata,
+    bool even_if_attached);
+static char	*prof_thread_name_alloc(tsdn_t *tsdn, const char *thread_name);
+
+/******************************************************************************/
+/* Red-black trees. */
+
+static int
+prof_tctx_comp(const prof_tctx_t *a, const prof_tctx_t *b) {
+	uint64_t a_thr_uid = a->thr_uid;
+	uint64_t b_thr_uid = b->thr_uid;
+	int ret = (a_thr_uid > b_thr_uid) - (a_thr_uid < b_thr_uid);
+	if (ret == 0) {
+		uint64_t a_thr_discrim = a->thr_discrim;
+		uint64_t b_thr_discrim = b->thr_discrim;
+		ret = (a_thr_discrim > b_thr_discrim) - (a_thr_discrim <
+		    b_thr_discrim);
+		if (ret == 0) {
+			uint64_t a_tctx_uid = a->tctx_uid;
+			uint64_t b_tctx_uid = b->tctx_uid;
+			ret = (a_tctx_uid > b_tctx_uid) - (a_tctx_uid <
+			    b_tctx_uid);
+		}
+	}
+	return ret;
+}
+
+rb_gen(static UNUSED, tctx_tree_, prof_tctx_tree_t, prof_tctx_t,
+    tctx_link, prof_tctx_comp)
+
+static int
+prof_gctx_comp(const prof_gctx_t *a, const prof_gctx_t *b) {
+	unsigned a_len = a->bt.len;
+	unsigned b_len = b->bt.len;
+	unsigned comp_len = (a_len < b_len) ? a_len : b_len;
+	int ret = memcmp(a->bt.vec, b->bt.vec, comp_len * sizeof(void *));
+	if (ret == 0) {
+		ret = (a_len > b_len) - (a_len < b_len);
+	}
+	return ret;
+}
+
+rb_gen(static UNUSED, gctx_tree_, prof_gctx_tree_t, prof_gctx_t, dump_link,
+    prof_gctx_comp)
+
+static int
+prof_tdata_comp(const prof_tdata_t *a, const prof_tdata_t *b) {
+	int ret;
+	uint64_t a_uid = a->thr_uid;
+	uint64_t b_uid = b->thr_uid;
+
+	ret = ((a_uid > b_uid) - (a_uid < b_uid));
+	if (ret == 0) {
+		uint64_t a_discrim = a->thr_discrim;
+		uint64_t b_discrim = b->thr_discrim;
+
+		ret = ((a_discrim > b_discrim) - (a_discrim < b_discrim));
+	}
+	return ret;
+}
+
+rb_gen(static UNUSED, tdata_tree_, prof_tdata_tree_t, prof_tdata_t, tdata_link,
+    prof_tdata_comp)
+
+/******************************************************************************/
+
+void
+prof_alloc_rollback(tsd_t *tsd, prof_tctx_t *tctx, bool updated) {
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	if (updated) {
+		/*
+		 * Compute a new sample threshold.  This isn't very important in
+		 * practice, because this function is rarely executed, so the
+		 * potential for sample bias is minimal except in contrived
+		 * programs.
+		 */
+		tdata = prof_tdata_get(tsd, true);
+		if (tdata != NULL) {
+			prof_sample_threshold_update(tdata);
+		}
+	}
+
+	if ((uintptr_t)tctx > (uintptr_t)1U) {
+		malloc_mutex_lock(tsd_tsdn(tsd), tctx->tdata->lock);
+		tctx->prepared = false;
+		if (prof_tctx_should_destroy(tsd_tsdn(tsd), tctx)) {
+			prof_tctx_destroy(tsd, tctx);
+		} else {
+			malloc_mutex_unlock(tsd_tsdn(tsd), tctx->tdata->lock);
+		}
+	}
+}
+
+void
+prof_malloc_sample_object(tsdn_t *tsdn, const void *ptr, size_t usize,
+    prof_tctx_t *tctx) {
+	prof_tctx_set(tsdn, ptr, usize, NULL, tctx);
+
+	malloc_mutex_lock(tsdn, tctx->tdata->lock);
+	tctx->cnts.curobjs++;
+	tctx->cnts.curbytes += usize;
+	if (opt_prof_accum) {
+		tctx->cnts.accumobjs++;
+		tctx->cnts.accumbytes += usize;
+	}
+	tctx->prepared = false;
+	malloc_mutex_unlock(tsdn, tctx->tdata->lock);
+}
+
+void
+prof_free_sampled_object(tsd_t *tsd, size_t usize, prof_tctx_t *tctx) {
+	malloc_mutex_lock(tsd_tsdn(tsd), tctx->tdata->lock);
+	assert(tctx->cnts.curobjs > 0);
+	assert(tctx->cnts.curbytes >= usize);
+	tctx->cnts.curobjs--;
+	tctx->cnts.curbytes -= usize;
+
+	if (prof_tctx_should_destroy(tsd_tsdn(tsd), tctx)) {
+		prof_tctx_destroy(tsd, tctx);
+	} else {
+		malloc_mutex_unlock(tsd_tsdn(tsd), tctx->tdata->lock);
+	}
+}
+
+void
+bt_init(prof_bt_t *bt, void **vec) {
+	cassert(config_prof);
+
+	bt->vec = vec;
+	bt->len = 0;
+}
+
+static void
+prof_enter(tsd_t *tsd, prof_tdata_t *tdata) {
+	cassert(config_prof);
+	assert(tdata == prof_tdata_get(tsd, false));
+
+	if (tdata != NULL) {
+		assert(!tdata->enq);
+		tdata->enq = true;
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &bt2gctx_mtx);
+}
+
+static void
+prof_leave(tsd_t *tsd, prof_tdata_t *tdata) {
+	cassert(config_prof);
+	assert(tdata == prof_tdata_get(tsd, false));
+
+	malloc_mutex_unlock(tsd_tsdn(tsd), &bt2gctx_mtx);
+
+	if (tdata != NULL) {
+		bool idump, gdump;
+
+		assert(tdata->enq);
+		tdata->enq = false;
+		idump = tdata->enq_idump;
+		tdata->enq_idump = false;
+		gdump = tdata->enq_gdump;
+		tdata->enq_gdump = false;
+
+		if (idump) {
+			prof_idump(tsd_tsdn(tsd));
+		}
+		if (gdump) {
+			prof_gdump(tsd_tsdn(tsd));
+		}
+	}
+}
+
+#ifdef JEMALLOC_PROF_LIBUNWIND
+void
+prof_backtrace(prof_bt_t *bt) {
+	int nframes;
+
+	cassert(config_prof);
+	assert(bt->len == 0);
+	assert(bt->vec != NULL);
+
+	nframes = unw_backtrace(bt->vec, PROF_BT_MAX);
+	if (nframes <= 0) {
+		return;
+	}
+	bt->len = nframes;
+}
+#elif (defined(JEMALLOC_PROF_LIBGCC))
+static _Unwind_Reason_Code
+prof_unwind_init_callback(struct _Unwind_Context *context, void *arg) {
+	cassert(config_prof);
+
+	return _URC_NO_REASON;
+}
+
+static _Unwind_Reason_Code
+prof_unwind_callback(struct _Unwind_Context *context, void *arg) {
+	prof_unwind_data_t *data = (prof_unwind_data_t *)arg;
+	void *ip;
+
+	cassert(config_prof);
+
+	ip = (void *)_Unwind_GetIP(context);
+	if (ip == NULL) {
+		return _URC_END_OF_STACK;
+	}
+	data->bt->vec[data->bt->len] = ip;
+	data->bt->len++;
+	if (data->bt->len == data->max) {
+		return _URC_END_OF_STACK;
+	}
+
+	return _URC_NO_REASON;
+}
+
+void
+prof_backtrace(prof_bt_t *bt) {
+	prof_unwind_data_t data = {bt, PROF_BT_MAX};
+
+	cassert(config_prof);
+
+	_Unwind_Backtrace(prof_unwind_callback, &data);
+}
+#elif (defined(JEMALLOC_PROF_GCC))
+void
+prof_backtrace(prof_bt_t *bt) {
+#define BT_FRAME(i)							\
+	if ((i) < PROF_BT_MAX) {					\
+		void *p;						\
+		if (__builtin_frame_address(i) == 0) {			\
+			return;						\
+		}							\
+		p = __builtin_return_address(i);			\
+		if (p == NULL) {					\
+			return;						\
+		}							\
+		bt->vec[(i)] = p;					\
+		bt->len = (i) + 1;					\
+	} else {							\
+		return;							\
+	}
+
+	cassert(config_prof);
+
+	BT_FRAME(0)
+	BT_FRAME(1)
+	BT_FRAME(2)
+	BT_FRAME(3)
+	BT_FRAME(4)
+	BT_FRAME(5)
+	BT_FRAME(6)
+	BT_FRAME(7)
+	BT_FRAME(8)
+	BT_FRAME(9)
+
+	BT_FRAME(10)
+	BT_FRAME(11)
+	BT_FRAME(12)
+	BT_FRAME(13)
+	BT_FRAME(14)
+	BT_FRAME(15)
+	BT_FRAME(16)
+	BT_FRAME(17)
+	BT_FRAME(18)
+	BT_FRAME(19)
+
+	BT_FRAME(20)
+	BT_FRAME(21)
+	BT_FRAME(22)
+	BT_FRAME(23)
+	BT_FRAME(24)
+	BT_FRAME(25)
+	BT_FRAME(26)
+	BT_FRAME(27)
+	BT_FRAME(28)
+	BT_FRAME(29)
+
+	BT_FRAME(30)
+	BT_FRAME(31)
+	BT_FRAME(32)
+	BT_FRAME(33)
+	BT_FRAME(34)
+	BT_FRAME(35)
+	BT_FRAME(36)
+	BT_FRAME(37)
+	BT_FRAME(38)
+	BT_FRAME(39)
+
+	BT_FRAME(40)
+	BT_FRAME(41)
+	BT_FRAME(42)
+	BT_FRAME(43)
+	BT_FRAME(44)
+	BT_FRAME(45)
+	BT_FRAME(46)
+	BT_FRAME(47)
+	BT_FRAME(48)
+	BT_FRAME(49)
+
+	BT_FRAME(50)
+	BT_FRAME(51)
+	BT_FRAME(52)
+	BT_FRAME(53)
+	BT_FRAME(54)
+	BT_FRAME(55)
+	BT_FRAME(56)
+	BT_FRAME(57)
+	BT_FRAME(58)
+	BT_FRAME(59)
+
+	BT_FRAME(60)
+	BT_FRAME(61)
+	BT_FRAME(62)
+	BT_FRAME(63)
+	BT_FRAME(64)
+	BT_FRAME(65)
+	BT_FRAME(66)
+	BT_FRAME(67)
+	BT_FRAME(68)
+	BT_FRAME(69)
+
+	BT_FRAME(70)
+	BT_FRAME(71)
+	BT_FRAME(72)
+	BT_FRAME(73)
+	BT_FRAME(74)
+	BT_FRAME(75)
+	BT_FRAME(76)
+	BT_FRAME(77)
+	BT_FRAME(78)
+	BT_FRAME(79)
+
+	BT_FRAME(80)
+	BT_FRAME(81)
+	BT_FRAME(82)
+	BT_FRAME(83)
+	BT_FRAME(84)
+	BT_FRAME(85)
+	BT_FRAME(86)
+	BT_FRAME(87)
+	BT_FRAME(88)
+	BT_FRAME(89)
+
+	BT_FRAME(90)
+	BT_FRAME(91)
+	BT_FRAME(92)
+	BT_FRAME(93)
+	BT_FRAME(94)
+	BT_FRAME(95)
+	BT_FRAME(96)
+	BT_FRAME(97)
+	BT_FRAME(98)
+	BT_FRAME(99)
+
+	BT_FRAME(100)
+	BT_FRAME(101)
+	BT_FRAME(102)
+	BT_FRAME(103)
+	BT_FRAME(104)
+	BT_FRAME(105)
+	BT_FRAME(106)
+	BT_FRAME(107)
+	BT_FRAME(108)
+	BT_FRAME(109)
+
+	BT_FRAME(110)
+	BT_FRAME(111)
+	BT_FRAME(112)
+	BT_FRAME(113)
+	BT_FRAME(114)
+	BT_FRAME(115)
+	BT_FRAME(116)
+	BT_FRAME(117)
+	BT_FRAME(118)
+	BT_FRAME(119)
+
+	BT_FRAME(120)
+	BT_FRAME(121)
+	BT_FRAME(122)
+	BT_FRAME(123)
+	BT_FRAME(124)
+	BT_FRAME(125)
+	BT_FRAME(126)
+	BT_FRAME(127)
+#undef BT_FRAME
+}
+#else
+void
+prof_backtrace(prof_bt_t *bt) {
+	cassert(config_prof);
+	not_reached();
+}
+#endif
+
+static malloc_mutex_t *
+prof_gctx_mutex_choose(void) {
+	unsigned ngctxs = atomic_fetch_add_u(&cum_gctxs, 1, ATOMIC_RELAXED);
+
+	return &gctx_locks[(ngctxs - 1) % PROF_NCTX_LOCKS];
+}
+
+static malloc_mutex_t *
+prof_tdata_mutex_choose(uint64_t thr_uid) {
+	return &tdata_locks[thr_uid % PROF_NTDATA_LOCKS];
+}
+
+static prof_gctx_t *
+prof_gctx_create(tsdn_t *tsdn, prof_bt_t *bt) {
+	/*
+	 * Create a single allocation that has space for vec of length bt->len.
+	 */
+	size_t size = offsetof(prof_gctx_t, vec) + (bt->len * sizeof(void *));
+	prof_gctx_t *gctx = (prof_gctx_t *)iallocztm(tsdn, size,
+	    sz_size2index(size), false, NULL, true, arena_get(TSDN_NULL, 0, true),
+	    true);
+	if (gctx == NULL) {
+		return NULL;
+	}
+	gctx->lock = prof_gctx_mutex_choose();
+	/*
+	 * Set nlimbo to 1, in order to avoid a race condition with
+	 * prof_tctx_destroy()/prof_gctx_try_destroy().
+	 */
+	gctx->nlimbo = 1;
+	tctx_tree_new(&gctx->tctxs);
+	/* Duplicate bt. */
+	memcpy(gctx->vec, bt->vec, bt->len * sizeof(void *));
+	gctx->bt.vec = gctx->vec;
+	gctx->bt.len = bt->len;
+	return gctx;
+}
+
+static void
+prof_gctx_try_destroy(tsd_t *tsd, prof_tdata_t *tdata_self, prof_gctx_t *gctx,
+    prof_tdata_t *tdata) {
+	cassert(config_prof);
+
+	/*
+	 * Check that gctx is still unused by any thread cache before destroying
+	 * it.  prof_lookup() increments gctx->nlimbo in order to avoid a race
+	 * condition with this function, as does prof_tctx_destroy() in order to
+	 * avoid a race between the main body of prof_tctx_destroy() and entry
+	 * into this function.
+	 */
+	prof_enter(tsd, tdata_self);
+	malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
+	assert(gctx->nlimbo != 0);
+	if (tctx_tree_empty(&gctx->tctxs) && gctx->nlimbo == 1) {
+		/* Remove gctx from bt2gctx. */
+		if (ckh_remove(tsd, &bt2gctx, &gctx->bt, NULL, NULL)) {
+			not_reached();
+		}
+		prof_leave(tsd, tdata_self);
+		/* Destroy gctx. */
+		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+		idalloctm(tsd_tsdn(tsd), gctx, NULL, NULL, true, true);
+	} else {
+		/*
+		 * Compensate for increment in prof_tctx_destroy() or
+		 * prof_lookup().
+		 */
+		gctx->nlimbo--;
+		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+		prof_leave(tsd, tdata_self);
+	}
+}
+
+static bool
+prof_tctx_should_destroy(tsdn_t *tsdn, prof_tctx_t *tctx) {
+	malloc_mutex_assert_owner(tsdn, tctx->tdata->lock);
+
+	if (opt_prof_accum) {
+		return false;
+	}
+	if (tctx->cnts.curobjs != 0) {
+		return false;
+	}
+	if (tctx->prepared) {
+		return false;
+	}
+	return true;
+}
+
+static bool
+prof_gctx_should_destroy(prof_gctx_t *gctx) {
+	if (opt_prof_accum) {
+		return false;
+	}
+	if (!tctx_tree_empty(&gctx->tctxs)) {
+		return false;
+	}
+	if (gctx->nlimbo != 0) {
+		return false;
+	}
+	return true;
+}
+
+static void
+prof_tctx_destroy(tsd_t *tsd, prof_tctx_t *tctx) {
+	prof_tdata_t *tdata = tctx->tdata;
+	prof_gctx_t *gctx = tctx->gctx;
+	bool destroy_tdata, destroy_tctx, destroy_gctx;
+
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), tctx->tdata->lock);
+
+	assert(tctx->cnts.curobjs == 0);
+	assert(tctx->cnts.curbytes == 0);
+	assert(!opt_prof_accum);
+	assert(tctx->cnts.accumobjs == 0);
+	assert(tctx->cnts.accumbytes == 0);
+
+	ckh_remove(tsd, &tdata->bt2tctx, &gctx->bt, NULL, NULL);
+	destroy_tdata = prof_tdata_should_destroy(tsd_tsdn(tsd), tdata, false);
+	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
+
+	malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
+	switch (tctx->state) {
+	case prof_tctx_state_nominal:
+		tctx_tree_remove(&gctx->tctxs, tctx);
+		destroy_tctx = true;
+		if (prof_gctx_should_destroy(gctx)) {
+			/*
+			 * Increment gctx->nlimbo in order to keep another
+			 * thread from winning the race to destroy gctx while
+			 * this one has gctx->lock dropped.  Without this, it
+			 * would be possible for another thread to:
+			 *
+			 * 1) Sample an allocation associated with gctx.
+			 * 2) Deallocate the sampled object.
+			 * 3) Successfully prof_gctx_try_destroy(gctx).
+			 *
+			 * The result would be that gctx no longer exists by the
+			 * time this thread accesses it in
+			 * prof_gctx_try_destroy().
+			 */
+			gctx->nlimbo++;
+			destroy_gctx = true;
+		} else {
+			destroy_gctx = false;
+		}
+		break;
+	case prof_tctx_state_dumping:
+		/*
+		 * A dumping thread needs tctx to remain valid until dumping
+		 * has finished.  Change state such that the dumping thread will
+		 * complete destruction during a late dump iteration phase.
+		 */
+		tctx->state = prof_tctx_state_purgatory;
+		destroy_tctx = false;
+		destroy_gctx = false;
+		break;
+	default:
+		not_reached();
+		destroy_tctx = false;
+		destroy_gctx = false;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+	if (destroy_gctx) {
+		prof_gctx_try_destroy(tsd, prof_tdata_get(tsd, false), gctx,
+		    tdata);
+	}
+
+	malloc_mutex_assert_not_owner(tsd_tsdn(tsd), tctx->tdata->lock);
+
+	if (destroy_tdata) {
+		prof_tdata_destroy(tsd, tdata, false);
+	}
+
+	if (destroy_tctx) {
+		idalloctm(tsd_tsdn(tsd), tctx, NULL, NULL, true, true);
+	}
+}
+
+static bool
+prof_lookup_global(tsd_t *tsd, prof_bt_t *bt, prof_tdata_t *tdata,
+    void **p_btkey, prof_gctx_t **p_gctx, bool *p_new_gctx) {
+	union {
+		prof_gctx_t	*p;
+		void		*v;
+	} gctx, tgctx;
+	union {
+		prof_bt_t	*p;
+		void		*v;
+	} btkey;
+	bool new_gctx;
+
+	prof_enter(tsd, tdata);
+	if (ckh_search(&bt2gctx, bt, &btkey.v, &gctx.v)) {
+		/* bt has never been seen before.  Insert it. */
+		prof_leave(tsd, tdata);
+		tgctx.p = prof_gctx_create(tsd_tsdn(tsd), bt);
+		if (tgctx.v == NULL) {
+			return true;
+		}
+		prof_enter(tsd, tdata);
+		if (ckh_search(&bt2gctx, bt, &btkey.v, &gctx.v)) {
+			gctx.p = tgctx.p;
+			btkey.p = &gctx.p->bt;
+			if (ckh_insert(tsd, &bt2gctx, btkey.v, gctx.v)) {
+				/* OOM. */
+				prof_leave(tsd, tdata);
+				idalloctm(tsd_tsdn(tsd), gctx.v, NULL, NULL,
+				    true, true);
+				return true;
+			}
+			new_gctx = true;
+		} else {
+			new_gctx = false;
+		}
+	} else {
+		tgctx.v = NULL;
+		new_gctx = false;
+	}
+
+	if (!new_gctx) {
+		/*
+		 * Increment nlimbo, in order to avoid a race condition with
+		 * prof_tctx_destroy()/prof_gctx_try_destroy().
+		 */
+		malloc_mutex_lock(tsd_tsdn(tsd), gctx.p->lock);
+		gctx.p->nlimbo++;
+		malloc_mutex_unlock(tsd_tsdn(tsd), gctx.p->lock);
+		new_gctx = false;
+
+		if (tgctx.v != NULL) {
+			/* Lost race to insert. */
+			idalloctm(tsd_tsdn(tsd), tgctx.v, NULL, NULL, true,
+			    true);
+		}
+	}
+	prof_leave(tsd, tdata);
+
+	*p_btkey = btkey.v;
+	*p_gctx = gctx.p;
+	*p_new_gctx = new_gctx;
+	return false;
+}
+
+prof_tctx_t *
+prof_lookup(tsd_t *tsd, prof_bt_t *bt) {
+	union {
+		prof_tctx_t	*p;
+		void		*v;
+	} ret;
+	prof_tdata_t *tdata;
+	bool not_found;
+
+	cassert(config_prof);
+
+	tdata = prof_tdata_get(tsd, false);
+	if (tdata == NULL) {
+		return NULL;
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
+	not_found = ckh_search(&tdata->bt2tctx, bt, NULL, &ret.v);
+	if (!not_found) { /* Note double negative! */
+		ret.p->prepared = true;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
+	if (not_found) {
+		void *btkey;
+		prof_gctx_t *gctx;
+		bool new_gctx, error;
+
+		/*
+		 * This thread's cache lacks bt.  Look for it in the global
+		 * cache.
+		 */
+		if (prof_lookup_global(tsd, bt, tdata, &btkey, &gctx,
+		    &new_gctx)) {
+			return NULL;
+		}
+
+		/* Link a prof_tctx_t into gctx for this thread. */
+		ret.v = iallocztm(tsd_tsdn(tsd), sizeof(prof_tctx_t),
+		    sz_size2index(sizeof(prof_tctx_t)), false, NULL, true,
+		    arena_ichoose(tsd, NULL), true);
+		if (ret.p == NULL) {
+			if (new_gctx) {
+				prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
+			}
+			return NULL;
+		}
+		ret.p->tdata = tdata;
+		ret.p->thr_uid = tdata->thr_uid;
+		ret.p->thr_discrim = tdata->thr_discrim;
+		memset(&ret.p->cnts, 0, sizeof(prof_cnt_t));
+		ret.p->gctx = gctx;
+		ret.p->tctx_uid = tdata->tctx_uid_next++;
+		ret.p->prepared = true;
+		ret.p->state = prof_tctx_state_initializing;
+		malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
+		error = ckh_insert(tsd, &tdata->bt2tctx, btkey, ret.v);
+		malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
+		if (error) {
+			if (new_gctx) {
+				prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
+			}
+			idalloctm(tsd_tsdn(tsd), ret.v, NULL, NULL, true, true);
+			return NULL;
+		}
+		malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
+		ret.p->state = prof_tctx_state_nominal;
+		tctx_tree_insert(&gctx->tctxs, ret.p);
+		gctx->nlimbo--;
+		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+	}
+
+	return ret.p;
+}
+
+/*
+ * The bodies of this function and prof_leakcheck() are compiled out unless heap
+ * profiling is enabled, so that it is possible to compile jemalloc with
+ * floating point support completely disabled.  Avoiding floating point code is
+ * important on memory-constrained systems, but it also enables a workaround for
+ * versions of glibc that don't properly save/restore floating point registers
+ * during dynamic lazy symbol loading (which internally calls into whatever
+ * malloc implementation happens to be integrated into the application).  Note
+ * that some compilers (e.g.  gcc 4.8) may use floating point registers for fast
+ * memory moves, so jemalloc must be compiled with such optimizations disabled
+ * (e.g.
+ * -mno-sse) in order for the workaround to be complete.
+ */
+void
+prof_sample_threshold_update(prof_tdata_t *tdata) {
+#ifdef JEMALLOC_PROF
+	uint64_t r;
+	double u;
+
+	if (!config_prof) {
+		return;
+	}
+
+	if (lg_prof_sample == 0) {
+		tdata->bytes_until_sample = 0;
+		return;
+	}
+
+	/*
+	 * Compute sample interval as a geometrically distributed random
+	 * variable with mean (2^lg_prof_sample).
+	 *
+	 *                             __        __
+	 *                             |  log(u)  |                     1
+	 * tdata->bytes_until_sample = | -------- |, where p = ---------------
+	 *                             | log(1-p) |             lg_prof_sample
+	 *                                                     2
+	 *
+	 * For more information on the math, see:
+	 *
+	 *   Non-Uniform Random Variate Generation
+	 *   Luc Devroye
+	 *   Springer-Verlag, New York, 1986
+	 *   pp 500
+	 *   (http://luc.devroye.org/rnbookindex.html)
+	 */
+	r = prng_lg_range_u64(&tdata->prng_state, 53);
+	u = (double)r * (1.0/9007199254740992.0L);
+	tdata->bytes_until_sample = (uint64_t)(log(u) /
+	    log(1.0 - (1.0 / (double)((uint64_t)1U << lg_prof_sample))))
+	    + (uint64_t)1U;
+#endif
+}
+
+#ifdef JEMALLOC_JET
+static prof_tdata_t *
+prof_tdata_count_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
+    void *arg) {
+	size_t *tdata_count = (size_t *)arg;
+
+	(*tdata_count)++;
+
+	return NULL;
+}
+
+size_t
+prof_tdata_count(void) {
+	size_t tdata_count = 0;
+	tsdn_t *tsdn;
+
+	tsdn = tsdn_fetch();
+	malloc_mutex_lock(tsdn, &tdatas_mtx);
+	tdata_tree_iter(&tdatas, NULL, prof_tdata_count_iter,
+	    (void *)&tdata_count);
+	malloc_mutex_unlock(tsdn, &tdatas_mtx);
+
+	return tdata_count;
+}
+
+size_t
+prof_bt_count(void) {
+	size_t bt_count;
+	tsd_t *tsd;
+	prof_tdata_t *tdata;
+
+	tsd = tsd_fetch();
+	tdata = prof_tdata_get(tsd, false);
+	if (tdata == NULL) {
+		return 0;
+	}
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &bt2gctx_mtx);
+	bt_count = ckh_count(&bt2gctx);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &bt2gctx_mtx);
+
+	return bt_count;
+}
+#endif
+
+static int
+prof_dump_open_impl(bool propagate_err, const char *filename) {
+	int fd;
+
+	fd = creat(filename, 0644);
+	if (fd == -1 && !propagate_err) {
+		malloc_printf("<jemalloc>: creat(\"%s\"), 0644) failed\n",
+		    filename);
+		if (opt_abort) {
+			abort();
+		}
+	}
+
+	return fd;
+}
+prof_dump_open_t *JET_MUTABLE prof_dump_open = prof_dump_open_impl;
+
+static bool
+prof_dump_flush(bool propagate_err) {
+	bool ret = false;
+	ssize_t err;
+
+	cassert(config_prof);
+
+	err = malloc_write_fd(prof_dump_fd, prof_dump_buf, prof_dump_buf_end);
+	if (err == -1) {
+		if (!propagate_err) {
+			malloc_write("<jemalloc>: write() failed during heap "
+			    "profile flush\n");
+			if (opt_abort) {
+				abort();
+			}
+		}
+		ret = true;
+	}
+	prof_dump_buf_end = 0;
+
+	return ret;
+}
+
+static bool
+prof_dump_close(bool propagate_err) {
+	bool ret;
+
+	assert(prof_dump_fd != -1);
+	ret = prof_dump_flush(propagate_err);
+	close(prof_dump_fd);
+	prof_dump_fd = -1;
+
+	return ret;
+}
+
+static bool
+prof_dump_write(bool propagate_err, const char *s) {
+	size_t i, slen, n;
+
+	cassert(config_prof);
+
+	i = 0;
+	slen = strlen(s);
+	while (i < slen) {
+		/* Flush the buffer if it is full. */
+		if (prof_dump_buf_end == PROF_DUMP_BUFSIZE) {
+			if (prof_dump_flush(propagate_err) && propagate_err) {
+				return true;
+			}
+		}
+
+		if (prof_dump_buf_end + slen <= PROF_DUMP_BUFSIZE) {
+			/* Finish writing. */
+			n = slen - i;
+		} else {
+			/* Write as much of s as will fit. */
+			n = PROF_DUMP_BUFSIZE - prof_dump_buf_end;
+		}
+		memcpy(&prof_dump_buf[prof_dump_buf_end], &s[i], n);
+		prof_dump_buf_end += n;
+		i += n;
+	}
+
+	return false;
+}
+
+JEMALLOC_FORMAT_PRINTF(2, 3)
+static bool
+prof_dump_printf(bool propagate_err, const char *format, ...) {
+	bool ret;
+	va_list ap;
+	char buf[PROF_PRINTF_BUFSIZE];
+
+	va_start(ap, format);
+	malloc_vsnprintf(buf, sizeof(buf), format, ap);
+	va_end(ap);
+	ret = prof_dump_write(propagate_err, buf);
+
+	return ret;
+}
+
+static void
+prof_tctx_merge_tdata(tsdn_t *tsdn, prof_tctx_t *tctx, prof_tdata_t *tdata) {
+	malloc_mutex_assert_owner(tsdn, tctx->tdata->lock);
+
+	malloc_mutex_lock(tsdn, tctx->gctx->lock);
+
+	switch (tctx->state) {
+	case prof_tctx_state_initializing:
+		malloc_mutex_unlock(tsdn, tctx->gctx->lock);
+		return;
+	case prof_tctx_state_nominal:
+		tctx->state = prof_tctx_state_dumping;
+		malloc_mutex_unlock(tsdn, tctx->gctx->lock);
+
+		memcpy(&tctx->dump_cnts, &tctx->cnts, sizeof(prof_cnt_t));
+
+		tdata->cnt_summed.curobjs += tctx->dump_cnts.curobjs;
+		tdata->cnt_summed.curbytes += tctx->dump_cnts.curbytes;
+		if (opt_prof_accum) {
+			tdata->cnt_summed.accumobjs +=
+			    tctx->dump_cnts.accumobjs;
+			tdata->cnt_summed.accumbytes +=
+			    tctx->dump_cnts.accumbytes;
+		}
+		break;
+	case prof_tctx_state_dumping:
+	case prof_tctx_state_purgatory:
+		not_reached();
+	}
+}
+
+static void
+prof_tctx_merge_gctx(tsdn_t *tsdn, prof_tctx_t *tctx, prof_gctx_t *gctx) {
+	malloc_mutex_assert_owner(tsdn, gctx->lock);
+
+	gctx->cnt_summed.curobjs += tctx->dump_cnts.curobjs;
+	gctx->cnt_summed.curbytes += tctx->dump_cnts.curbytes;
+	if (opt_prof_accum) {
+		gctx->cnt_summed.accumobjs += tctx->dump_cnts.accumobjs;
+		gctx->cnt_summed.accumbytes += tctx->dump_cnts.accumbytes;
+	}
+}
+
+static prof_tctx_t *
+prof_tctx_merge_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *arg) {
+	tsdn_t *tsdn = (tsdn_t *)arg;
+
+	malloc_mutex_assert_owner(tsdn, tctx->gctx->lock);
+
+	switch (tctx->state) {
+	case prof_tctx_state_nominal:
+		/* New since dumping started; ignore. */
+		break;
+	case prof_tctx_state_dumping:
+	case prof_tctx_state_purgatory:
+		prof_tctx_merge_gctx(tsdn, tctx, tctx->gctx);
+		break;
+	default:
+		not_reached();
+	}
+
+	return NULL;
+}
+
+struct prof_tctx_dump_iter_arg_s {
+	tsdn_t	*tsdn;
+	bool	propagate_err;
+};
+
+static prof_tctx_t *
+prof_tctx_dump_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *opaque) {
+	struct prof_tctx_dump_iter_arg_s *arg =
+	    (struct prof_tctx_dump_iter_arg_s *)opaque;
+
+	malloc_mutex_assert_owner(arg->tsdn, tctx->gctx->lock);
+
+	switch (tctx->state) {
+	case prof_tctx_state_initializing:
+	case prof_tctx_state_nominal:
+		/* Not captured by this dump. */
+		break;
+	case prof_tctx_state_dumping:
+	case prof_tctx_state_purgatory:
+		if (prof_dump_printf(arg->propagate_err,
+		    "  t%"FMTu64": %"FMTu64": %"FMTu64" [%"FMTu64": "
+		    "%"FMTu64"]\n", tctx->thr_uid, tctx->dump_cnts.curobjs,
+		    tctx->dump_cnts.curbytes, tctx->dump_cnts.accumobjs,
+		    tctx->dump_cnts.accumbytes)) {
+			return tctx;
+		}
+		break;
+	default:
+		not_reached();
+	}
+	return NULL;
+}
+
+static prof_tctx_t *
+prof_tctx_finish_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *arg) {
+	tsdn_t *tsdn = (tsdn_t *)arg;
+	prof_tctx_t *ret;
+
+	malloc_mutex_assert_owner(tsdn, tctx->gctx->lock);
+
+	switch (tctx->state) {
+	case prof_tctx_state_nominal:
+		/* New since dumping started; ignore. */
+		break;
+	case prof_tctx_state_dumping:
+		tctx->state = prof_tctx_state_nominal;
+		break;
+	case prof_tctx_state_purgatory:
+		ret = tctx;
+		goto label_return;
+	default:
+		not_reached();
+	}
+
+	ret = NULL;
+label_return:
+	return ret;
+}
+
+static void
+prof_dump_gctx_prep(tsdn_t *tsdn, prof_gctx_t *gctx, prof_gctx_tree_t *gctxs) {
+	cassert(config_prof);
+
+	malloc_mutex_lock(tsdn, gctx->lock);
+
+	/*
+	 * Increment nlimbo so that gctx won't go away before dump.
+	 * Additionally, link gctx into the dump list so that it is included in
+	 * prof_dump()'s second pass.
+	 */
+	gctx->nlimbo++;
+	gctx_tree_insert(gctxs, gctx);
+
+	memset(&gctx->cnt_summed, 0, sizeof(prof_cnt_t));
+
+	malloc_mutex_unlock(tsdn, gctx->lock);
+}
+
+struct prof_gctx_merge_iter_arg_s {
+	tsdn_t	*tsdn;
+	size_t	leak_ngctx;
+};
+
+static prof_gctx_t *
+prof_gctx_merge_iter(prof_gctx_tree_t *gctxs, prof_gctx_t *gctx, void *opaque) {
+	struct prof_gctx_merge_iter_arg_s *arg =
+	    (struct prof_gctx_merge_iter_arg_s *)opaque;
+
+	malloc_mutex_lock(arg->tsdn, gctx->lock);
+	tctx_tree_iter(&gctx->tctxs, NULL, prof_tctx_merge_iter,
+	    (void *)arg->tsdn);
+	if (gctx->cnt_summed.curobjs != 0) {
+		arg->leak_ngctx++;
+	}
+	malloc_mutex_unlock(arg->tsdn, gctx->lock);
+
+	return NULL;
+}
+
+static void
+prof_gctx_finish(tsd_t *tsd, prof_gctx_tree_t *gctxs) {
+	prof_tdata_t *tdata = prof_tdata_get(tsd, false);
+	prof_gctx_t *gctx;
+
+	/*
+	 * Standard tree iteration won't work here, because as soon as we
+	 * decrement gctx->nlimbo and unlock gctx, another thread can
+	 * concurrently destroy it, which will corrupt the tree.  Therefore,
+	 * tear down the tree one node at a time during iteration.
+	 */
+	while ((gctx = gctx_tree_first(gctxs)) != NULL) {
+		gctx_tree_remove(gctxs, gctx);
+		malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
+		{
+			prof_tctx_t *next;
+
+			next = NULL;
+			do {
+				prof_tctx_t *to_destroy =
+				    tctx_tree_iter(&gctx->tctxs, next,
+				    prof_tctx_finish_iter,
+				    (void *)tsd_tsdn(tsd));
+				if (to_destroy != NULL) {
+					next = tctx_tree_next(&gctx->tctxs,
+					    to_destroy);
+					tctx_tree_remove(&gctx->tctxs,
+					    to_destroy);
+					idalloctm(tsd_tsdn(tsd), to_destroy,
+					    NULL, NULL, true, true);
+				} else {
+					next = NULL;
+				}
+			} while (next != NULL);
+		}
+		gctx->nlimbo--;
+		if (prof_gctx_should_destroy(gctx)) {
+			gctx->nlimbo++;
+			malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+			prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
+		} else {
+			malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
+		}
+	}
+}
+
+struct prof_tdata_merge_iter_arg_s {
+	tsdn_t		*tsdn;
+	prof_cnt_t	cnt_all;
+};
+
+static prof_tdata_t *
+prof_tdata_merge_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
+    void *opaque) {
+	struct prof_tdata_merge_iter_arg_s *arg =
+	    (struct prof_tdata_merge_iter_arg_s *)opaque;
+
+	malloc_mutex_lock(arg->tsdn, tdata->lock);
+	if (!tdata->expired) {
+		size_t tabind;
+		union {
+			prof_tctx_t	*p;
+			void		*v;
+		} tctx;
+
+		tdata->dumping = true;
+		memset(&tdata->cnt_summed, 0, sizeof(prof_cnt_t));
+		for (tabind = 0; !ckh_iter(&tdata->bt2tctx, &tabind, NULL,
+		    &tctx.v);) {
+			prof_tctx_merge_tdata(arg->tsdn, tctx.p, tdata);
+		}
+
+		arg->cnt_all.curobjs += tdata->cnt_summed.curobjs;
+		arg->cnt_all.curbytes += tdata->cnt_summed.curbytes;
+		if (opt_prof_accum) {
+			arg->cnt_all.accumobjs += tdata->cnt_summed.accumobjs;
+			arg->cnt_all.accumbytes += tdata->cnt_summed.accumbytes;
+		}
+	} else {
+		tdata->dumping = false;
+	}
+	malloc_mutex_unlock(arg->tsdn, tdata->lock);
+
+	return NULL;
+}
+
+static prof_tdata_t *
+prof_tdata_dump_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
+    void *arg) {
+	bool propagate_err = *(bool *)arg;
+
+	if (!tdata->dumping) {
+		return NULL;
+	}
+
+	if (prof_dump_printf(propagate_err,
+	    "  t%"FMTu64": %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]%s%s\n",
+	    tdata->thr_uid, tdata->cnt_summed.curobjs,
+	    tdata->cnt_summed.curbytes, tdata->cnt_summed.accumobjs,
+	    tdata->cnt_summed.accumbytes,
+	    (tdata->thread_name != NULL) ? " " : "",
+	    (tdata->thread_name != NULL) ? tdata->thread_name : "")) {
+		return tdata;
+	}
+	return NULL;
+}
+
+static bool
+prof_dump_header_impl(tsdn_t *tsdn, bool propagate_err,
+    const prof_cnt_t *cnt_all) {
+	bool ret;
+
+	if (prof_dump_printf(propagate_err,
+	    "heap_v2/%"FMTu64"\n"
+	    "  t*: %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]\n",
+	    ((uint64_t)1U << lg_prof_sample), cnt_all->curobjs,
+	    cnt_all->curbytes, cnt_all->accumobjs, cnt_all->accumbytes)) {
+		return true;
+	}
+
+	malloc_mutex_lock(tsdn, &tdatas_mtx);
+	ret = (tdata_tree_iter(&tdatas, NULL, prof_tdata_dump_iter,
+	    (void *)&propagate_err) != NULL);
+	malloc_mutex_unlock(tsdn, &tdatas_mtx);
+	return ret;
+}
+prof_dump_header_t *JET_MUTABLE prof_dump_header = prof_dump_header_impl;
+
+static bool
+prof_dump_gctx(tsdn_t *tsdn, bool propagate_err, prof_gctx_t *gctx,
+    const prof_bt_t *bt, prof_gctx_tree_t *gctxs) {
+	bool ret;
+	unsigned i;
+	struct prof_tctx_dump_iter_arg_s prof_tctx_dump_iter_arg;
+
+	cassert(config_prof);
+	malloc_mutex_assert_owner(tsdn, gctx->lock);
+
+	/* Avoid dumping such gctx's that have no useful data. */
+	if ((!opt_prof_accum && gctx->cnt_summed.curobjs == 0) ||
+	    (opt_prof_accum && gctx->cnt_summed.accumobjs == 0)) {
+		assert(gctx->cnt_summed.curobjs == 0);
+		assert(gctx->cnt_summed.curbytes == 0);
+		assert(gctx->cnt_summed.accumobjs == 0);
+		assert(gctx->cnt_summed.accumbytes == 0);
+		ret = false;
+		goto label_return;
+	}
+
+	if (prof_dump_printf(propagate_err, "@")) {
+		ret = true;
+		goto label_return;
+	}
+	for (i = 0; i < bt->len; i++) {
+		if (prof_dump_printf(propagate_err, " %#"FMTxPTR,
+		    (uintptr_t)bt->vec[i])) {
+			ret = true;
+			goto label_return;
+		}
+	}
+
+	if (prof_dump_printf(propagate_err,
+	    "\n"
+	    "  t*: %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]\n",
+	    gctx->cnt_summed.curobjs, gctx->cnt_summed.curbytes,
+	    gctx->cnt_summed.accumobjs, gctx->cnt_summed.accumbytes)) {
+		ret = true;
+		goto label_return;
+	}
+
+	prof_tctx_dump_iter_arg.tsdn = tsdn;
+	prof_tctx_dump_iter_arg.propagate_err = propagate_err;
+	if (tctx_tree_iter(&gctx->tctxs, NULL, prof_tctx_dump_iter,
+	    (void *)&prof_tctx_dump_iter_arg) != NULL) {
+		ret = true;
+		goto label_return;
+	}
+
+	ret = false;
+label_return:
+	return ret;
+}
+
+#ifndef _WIN32
+JEMALLOC_FORMAT_PRINTF(1, 2)
+static int
+prof_open_maps(const char *format, ...) {
+	int mfd;
+	va_list ap;
+	char filename[PATH_MAX + 1];
+
+	va_start(ap, format);
+	malloc_vsnprintf(filename, sizeof(filename), format, ap);
+	va_end(ap);
+
+#if defined(O_CLOEXEC)
+	mfd = open(filename, O_RDONLY | O_CLOEXEC);
+#else
+	mfd = open(filename, O_RDONLY);
+	if (mfd != -1) {
+		fcntl(mfd, F_SETFD, fcntl(mfd, F_GETFD) | FD_CLOEXEC);
+	}
+#endif
+
+	return mfd;
+}
+#endif
+
+static int
+prof_getpid(void) {
+#ifdef _WIN32
+	return GetCurrentProcessId();
+#else
+	return getpid();
+#endif
+}
+
+static bool
+prof_dump_maps(bool propagate_err) {
+	bool ret;
+	int mfd;
+
+	cassert(config_prof);
+#ifdef __FreeBSD__
+	mfd = prof_open_maps("/proc/curproc/map");
+#elif defined(_WIN32)
+	mfd = -1; // Not implemented
+#else
+	{
+		int pid = prof_getpid();
+
+		mfd = prof_open_maps("/proc/%d/task/%d/maps", pid, pid);
+		if (mfd == -1) {
+			mfd = prof_open_maps("/proc/%d/maps", pid);
+		}
+	}
+#endif
+	if (mfd != -1) {
+		ssize_t nread;
+
+		if (prof_dump_write(propagate_err, "\nMAPPED_LIBRARIES:\n") &&
+		    propagate_err) {
+			ret = true;
+			goto label_return;
+		}
+		nread = 0;
+		do {
+			prof_dump_buf_end += nread;
+			if (prof_dump_buf_end == PROF_DUMP_BUFSIZE) {
+				/* Make space in prof_dump_buf before read(). */
+				if (prof_dump_flush(propagate_err) &&
+				    propagate_err) {
+					ret = true;
+					goto label_return;
+				}
+			}
+			nread = malloc_read_fd(mfd,
+			    &prof_dump_buf[prof_dump_buf_end], PROF_DUMP_BUFSIZE
+			    - prof_dump_buf_end);
+		} while (nread > 0);
+	} else {
+		ret = true;
+		goto label_return;
+	}
+
+	ret = false;
+label_return:
+	if (mfd != -1) {
+		close(mfd);
+	}
+	return ret;
+}
+
+/*
+ * See prof_sample_threshold_update() comment for why the body of this function
+ * is conditionally compiled.
+ */
+static void
+prof_leakcheck(const prof_cnt_t *cnt_all, size_t leak_ngctx,
+    const char *filename) {
+#ifdef JEMALLOC_PROF
+	/*
+	 * Scaling is equivalent AdjustSamples() in jeprof, but the result may
+	 * differ slightly from what jeprof reports, because here we scale the
+	 * summary values, whereas jeprof scales each context individually and
+	 * reports the sums of the scaled values.
+	 */
+	if (cnt_all->curbytes != 0) {
+		double sample_period = (double)((uint64_t)1 << lg_prof_sample);
+		double ratio = (((double)cnt_all->curbytes) /
+		    (double)cnt_all->curobjs) / sample_period;
+		double scale_factor = 1.0 / (1.0 - exp(-ratio));
+		uint64_t curbytes = (uint64_t)round(((double)cnt_all->curbytes)
+		    * scale_factor);
+		uint64_t curobjs = (uint64_t)round(((double)cnt_all->curobjs) *
+		    scale_factor);
+
+		malloc_printf("<jemalloc>: Leak approximation summary: ~%"FMTu64
+		    " byte%s, ~%"FMTu64" object%s, >= %zu context%s\n",
+		    curbytes, (curbytes != 1) ? "s" : "", curobjs, (curobjs !=
+		    1) ? "s" : "", leak_ngctx, (leak_ngctx != 1) ? "s" : "");
+		malloc_printf(
+		    "<jemalloc>: Run jeprof on \"%s\" for leak detail\n",
+		    filename);
+	}
+#endif
+}
+
+struct prof_gctx_dump_iter_arg_s {
+	tsdn_t	*tsdn;
+	bool	propagate_err;
+};
+
+static prof_gctx_t *
+prof_gctx_dump_iter(prof_gctx_tree_t *gctxs, prof_gctx_t *gctx, void *opaque) {
+	prof_gctx_t *ret;
+	struct prof_gctx_dump_iter_arg_s *arg =
+	    (struct prof_gctx_dump_iter_arg_s *)opaque;
+
+	malloc_mutex_lock(arg->tsdn, gctx->lock);
+
+	if (prof_dump_gctx(arg->tsdn, arg->propagate_err, gctx, &gctx->bt,
+	    gctxs)) {
+		ret = gctx;
+		goto label_return;
+	}
+
+	ret = NULL;
+label_return:
+	malloc_mutex_unlock(arg->tsdn, gctx->lock);
+	return ret;
+}
+
+static void
+prof_dump_prep(tsd_t *tsd, prof_tdata_t *tdata,
+    struct prof_tdata_merge_iter_arg_s *prof_tdata_merge_iter_arg,
+    struct prof_gctx_merge_iter_arg_s *prof_gctx_merge_iter_arg,
+    prof_gctx_tree_t *gctxs) {
+	size_t tabind;
+	union {
+		prof_gctx_t	*p;
+		void		*v;
+	} gctx;
+
+	prof_enter(tsd, tdata);
+
+	/*
+	 * Put gctx's in limbo and clear their counters in preparation for
+	 * summing.
+	 */
+	gctx_tree_new(gctxs);
+	for (tabind = 0; !ckh_iter(&bt2gctx, &tabind, NULL, &gctx.v);) {
+		prof_dump_gctx_prep(tsd_tsdn(tsd), gctx.p, gctxs);
+	}
+
+	/*
+	 * Iterate over tdatas, and for the non-expired ones snapshot their tctx
+	 * stats and merge them into the associated gctx's.
+	 */
+	prof_tdata_merge_iter_arg->tsdn = tsd_tsdn(tsd);
+	memset(&prof_tdata_merge_iter_arg->cnt_all, 0, sizeof(prof_cnt_t));
+	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
+	tdata_tree_iter(&tdatas, NULL, prof_tdata_merge_iter,
+	    (void *)prof_tdata_merge_iter_arg);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
+
+	/* Merge tctx stats into gctx's. */
+	prof_gctx_merge_iter_arg->tsdn = tsd_tsdn(tsd);
+	prof_gctx_merge_iter_arg->leak_ngctx = 0;
+	gctx_tree_iter(gctxs, NULL, prof_gctx_merge_iter,
+	    (void *)prof_gctx_merge_iter_arg);
+
+	prof_leave(tsd, tdata);
+}
+
+static bool
+prof_dump_file(tsd_t *tsd, bool propagate_err, const char *filename,
+    bool leakcheck, prof_tdata_t *tdata,
+    struct prof_tdata_merge_iter_arg_s *prof_tdata_merge_iter_arg,
+    struct prof_gctx_merge_iter_arg_s *prof_gctx_merge_iter_arg,
+    struct prof_gctx_dump_iter_arg_s *prof_gctx_dump_iter_arg,
+    prof_gctx_tree_t *gctxs) {
+	/* Create dump file. */
+	if ((prof_dump_fd = prof_dump_open(propagate_err, filename)) == -1) {
+		return true;
+	}
+
+	/* Dump profile header. */
+	if (prof_dump_header(tsd_tsdn(tsd), propagate_err,
+	    &prof_tdata_merge_iter_arg->cnt_all)) {
+		goto label_write_error;
+	}
+
+	/* Dump per gctx profile stats. */
+	prof_gctx_dump_iter_arg->tsdn = tsd_tsdn(tsd);
+	prof_gctx_dump_iter_arg->propagate_err = propagate_err;
+	if (gctx_tree_iter(gctxs, NULL, prof_gctx_dump_iter,
+	    (void *)prof_gctx_dump_iter_arg) != NULL) {
+		goto label_write_error;
+	}
+
+	/* Dump /proc/<pid>/maps if possible. */
+	if (prof_dump_maps(propagate_err)) {
+		goto label_write_error;
+	}
+
+	if (prof_dump_close(propagate_err)) {
+		return true;
+	}
+
+	return false;
+label_write_error:
+	prof_dump_close(propagate_err);
+	return true;
+}
+
+static bool
+prof_dump(tsd_t *tsd, bool propagate_err, const char *filename,
+    bool leakcheck) {
+	cassert(config_prof);
+	assert(tsd_reentrancy_level_get(tsd) == 0);
+
+	prof_tdata_t * tdata = prof_tdata_get(tsd, true);
+	if (tdata == NULL) {
+		return true;
+	}
+
+	pre_reentrancy(tsd, NULL);
+	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_mtx);
+
+	prof_gctx_tree_t gctxs;
+	struct prof_tdata_merge_iter_arg_s prof_tdata_merge_iter_arg;
+	struct prof_gctx_merge_iter_arg_s prof_gctx_merge_iter_arg;
+	struct prof_gctx_dump_iter_arg_s prof_gctx_dump_iter_arg;
+	prof_dump_prep(tsd, tdata, &prof_tdata_merge_iter_arg,
+	    &prof_gctx_merge_iter_arg, &gctxs);
+	bool err = prof_dump_file(tsd, propagate_err, filename, leakcheck, tdata,
+	    &prof_tdata_merge_iter_arg, &prof_gctx_merge_iter_arg,
+	    &prof_gctx_dump_iter_arg, &gctxs);
+	prof_gctx_finish(tsd, &gctxs);
+
+	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_mtx);
+	post_reentrancy(tsd);
+
+	if (err) {
+		return true;
+	}
+
+	if (leakcheck) {
+		prof_leakcheck(&prof_tdata_merge_iter_arg.cnt_all,
+		    prof_gctx_merge_iter_arg.leak_ngctx, filename);
+	}
+	return false;
+}
+
+#ifdef JEMALLOC_JET
+void
+prof_cnt_all(uint64_t *curobjs, uint64_t *curbytes, uint64_t *accumobjs,
+    uint64_t *accumbytes) {
+	tsd_t *tsd;
+	prof_tdata_t *tdata;
+	struct prof_tdata_merge_iter_arg_s prof_tdata_merge_iter_arg;
+	struct prof_gctx_merge_iter_arg_s prof_gctx_merge_iter_arg;
+	prof_gctx_tree_t gctxs;
+
+	tsd = tsd_fetch();
+	tdata = prof_tdata_get(tsd, false);
+	if (tdata == NULL) {
+		if (curobjs != NULL) {
+			*curobjs = 0;
+		}
+		if (curbytes != NULL) {
+			*curbytes = 0;
+		}
+		if (accumobjs != NULL) {
+			*accumobjs = 0;
+		}
+		if (accumbytes != NULL) {
+			*accumbytes = 0;
+		}
+		return;
+	}
+
+	prof_dump_prep(tsd, tdata, &prof_tdata_merge_iter_arg,
+	    &prof_gctx_merge_iter_arg, &gctxs);
+	prof_gctx_finish(tsd, &gctxs);
+
+	if (curobjs != NULL) {
+		*curobjs = prof_tdata_merge_iter_arg.cnt_all.curobjs;
+	}
+	if (curbytes != NULL) {
+		*curbytes = prof_tdata_merge_iter_arg.cnt_all.curbytes;
+	}
+	if (accumobjs != NULL) {
+		*accumobjs = prof_tdata_merge_iter_arg.cnt_all.accumobjs;
+	}
+	if (accumbytes != NULL) {
+		*accumbytes = prof_tdata_merge_iter_arg.cnt_all.accumbytes;
+	}
+}
+#endif
+
+#define DUMP_FILENAME_BUFSIZE	(PATH_MAX + 1)
+#define VSEQ_INVALID		UINT64_C(0xffffffffffffffff)
+static void
+prof_dump_filename(char *filename, char v, uint64_t vseq) {
+	cassert(config_prof);
+
+	if (vseq != VSEQ_INVALID) {
+	        /* "<prefix>.<pid>.<seq>.v<vseq>.heap" */
+		malloc_snprintf(filename, DUMP_FILENAME_BUFSIZE,
+		    "%s.%d.%"FMTu64".%c%"FMTu64".heap",
+		    opt_prof_prefix, prof_getpid(), prof_dump_seq, v, vseq);
+	} else {
+	        /* "<prefix>.<pid>.<seq>.<v>.heap" */
+		malloc_snprintf(filename, DUMP_FILENAME_BUFSIZE,
+		    "%s.%d.%"FMTu64".%c.heap",
+		    opt_prof_prefix, prof_getpid(), prof_dump_seq, v);
+	}
+	prof_dump_seq++;
+}
+
+static void
+prof_fdump(void) {
+	tsd_t *tsd;
+	char filename[DUMP_FILENAME_BUFSIZE];
+
+	cassert(config_prof);
+	assert(opt_prof_final);
+	assert(opt_prof_prefix[0] != '\0');
+
+	if (!prof_booted) {
+		return;
+	}
+	tsd = tsd_fetch();
+	assert(tsd_reentrancy_level_get(tsd) == 0);
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+	prof_dump_filename(filename, 'f', VSEQ_INVALID);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+	prof_dump(tsd, false, filename, opt_prof_leak);
+}
+
+bool
+prof_accum_init(tsdn_t *tsdn, prof_accum_t *prof_accum) {
+	cassert(config_prof);
+
+#ifndef JEMALLOC_ATOMIC_U64
+	if (malloc_mutex_init(&prof_accum->mtx, "prof_accum",
+	    WITNESS_RANK_PROF_ACCUM, malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+	prof_accum->accumbytes = 0;
+#else
+	atomic_store_u64(&prof_accum->accumbytes, 0, ATOMIC_RELAXED);
+#endif
+	return false;
+}
+
+void
+prof_idump(tsdn_t *tsdn) {
+	tsd_t *tsd;
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	if (!prof_booted || tsdn_null(tsdn) || !prof_active_get_unlocked()) {
+		return;
+	}
+	tsd = tsdn_tsd(tsdn);
+	if (tsd_reentrancy_level_get(tsd) > 0) {
+		return;
+	}
+
+	tdata = prof_tdata_get(tsd, false);
+	if (tdata == NULL) {
+		return;
+	}
+	if (tdata->enq) {
+		tdata->enq_idump = true;
+		return;
+	}
+
+	if (opt_prof_prefix[0] != '\0') {
+		char filename[PATH_MAX + 1];
+		malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+		prof_dump_filename(filename, 'i', prof_dump_iseq);
+		prof_dump_iseq++;
+		malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+		prof_dump(tsd, false, filename, false);
+	}
+}
+
+bool
+prof_mdump(tsd_t *tsd, const char *filename) {
+	cassert(config_prof);
+	assert(tsd_reentrancy_level_get(tsd) == 0);
+
+	if (!opt_prof || !prof_booted) {
+		return true;
+	}
+	char filename_buf[DUMP_FILENAME_BUFSIZE];
+	if (filename == NULL) {
+		/* No filename specified, so automatically generate one. */
+		if (opt_prof_prefix[0] == '\0') {
+			return true;
+		}
+		malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+		prof_dump_filename(filename_buf, 'm', prof_dump_mseq);
+		prof_dump_mseq++;
+		malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
+		filename = filename_buf;
+	}
+	return prof_dump(tsd, true, filename, false);
+}
+
+void
+prof_gdump(tsdn_t *tsdn) {
+	tsd_t *tsd;
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	if (!prof_booted || tsdn_null(tsdn) || !prof_active_get_unlocked()) {
+		return;
+	}
+	tsd = tsdn_tsd(tsdn);
+	if (tsd_reentrancy_level_get(tsd) > 0) {
+		return;
+	}
+
+	tdata = prof_tdata_get(tsd, false);
+	if (tdata == NULL) {
+		return;
+	}
+	if (tdata->enq) {
+		tdata->enq_gdump = true;
+		return;
+	}
+
+	if (opt_prof_prefix[0] != '\0') {
+		char filename[DUMP_FILENAME_BUFSIZE];
+		malloc_mutex_lock(tsdn, &prof_dump_seq_mtx);
+		prof_dump_filename(filename, 'u', prof_dump_useq);
+		prof_dump_useq++;
+		malloc_mutex_unlock(tsdn, &prof_dump_seq_mtx);
+		prof_dump(tsd, false, filename, false);
+	}
+}
+
+static void
+prof_bt_hash(const void *key, size_t r_hash[2]) {
+	prof_bt_t *bt = (prof_bt_t *)key;
+
+	cassert(config_prof);
+
+	hash(bt->vec, bt->len * sizeof(void *), 0x94122f33U, r_hash);
+}
+
+static bool
+prof_bt_keycomp(const void *k1, const void *k2) {
+	const prof_bt_t *bt1 = (prof_bt_t *)k1;
+	const prof_bt_t *bt2 = (prof_bt_t *)k2;
+
+	cassert(config_prof);
+
+	if (bt1->len != bt2->len) {
+		return false;
+	}
+	return (memcmp(bt1->vec, bt2->vec, bt1->len * sizeof(void *)) == 0);
+}
+
+static uint64_t
+prof_thr_uid_alloc(tsdn_t *tsdn) {
+	uint64_t thr_uid;
+
+	malloc_mutex_lock(tsdn, &next_thr_uid_mtx);
+	thr_uid = next_thr_uid;
+	next_thr_uid++;
+	malloc_mutex_unlock(tsdn, &next_thr_uid_mtx);
+
+	return thr_uid;
+}
+
+static prof_tdata_t *
+prof_tdata_init_impl(tsd_t *tsd, uint64_t thr_uid, uint64_t thr_discrim,
+    char *thread_name, bool active) {
+	prof_tdata_t *tdata;
+
+	cassert(config_prof);
+
+	/* Initialize an empty cache for this thread. */
+	tdata = (prof_tdata_t *)iallocztm(tsd_tsdn(tsd), sizeof(prof_tdata_t),
+	    sz_size2index(sizeof(prof_tdata_t)), false, NULL, true,
+	    arena_get(TSDN_NULL, 0, true), true);
+	if (tdata == NULL) {
+		return NULL;
+	}
+
+	tdata->lock = prof_tdata_mutex_choose(thr_uid);
+	tdata->thr_uid = thr_uid;
+	tdata->thr_discrim = thr_discrim;
+	tdata->thread_name = thread_name;
+	tdata->attached = true;
+	tdata->expired = false;
+	tdata->tctx_uid_next = 0;
+
+	if (ckh_new(tsd, &tdata->bt2tctx, PROF_CKH_MINITEMS, prof_bt_hash,
+	    prof_bt_keycomp)) {
+		idalloctm(tsd_tsdn(tsd), tdata, NULL, NULL, true, true);
+		return NULL;
+	}
+
+	tdata->prng_state = (uint64_t)(uintptr_t)tdata;
+	prof_sample_threshold_update(tdata);
+
+	tdata->enq = false;
+	tdata->enq_idump = false;
+	tdata->enq_gdump = false;
+
+	tdata->dumping = false;
+	tdata->active = active;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
+	tdata_tree_insert(&tdatas, tdata);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
+
+	return tdata;
+}
+
+prof_tdata_t *
+prof_tdata_init(tsd_t *tsd) {
+	return prof_tdata_init_impl(tsd, prof_thr_uid_alloc(tsd_tsdn(tsd)), 0,
+	    NULL, prof_thread_active_init_get(tsd_tsdn(tsd)));
+}
+
+static bool
+prof_tdata_should_destroy_unlocked(prof_tdata_t *tdata, bool even_if_attached) {
+	if (tdata->attached && !even_if_attached) {
+		return false;
+	}
+	if (ckh_count(&tdata->bt2tctx) != 0) {
+		return false;
+	}
+	return true;
+}
+
+static bool
+prof_tdata_should_destroy(tsdn_t *tsdn, prof_tdata_t *tdata,
+    bool even_if_attached) {
+	malloc_mutex_assert_owner(tsdn, tdata->lock);
+
+	return prof_tdata_should_destroy_unlocked(tdata, even_if_attached);
+}
+
+static void
+prof_tdata_destroy_locked(tsd_t *tsd, prof_tdata_t *tdata,
+    bool even_if_attached) {
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &tdatas_mtx);
+
+	tdata_tree_remove(&tdatas, tdata);
+
+	assert(prof_tdata_should_destroy_unlocked(tdata, even_if_attached));
+
+	if (tdata->thread_name != NULL) {
+		idalloctm(tsd_tsdn(tsd), tdata->thread_name, NULL, NULL, true,
+		    true);
+	}
+	ckh_delete(tsd, &tdata->bt2tctx);
+	idalloctm(tsd_tsdn(tsd), tdata, NULL, NULL, true, true);
+}
+
+static void
+prof_tdata_destroy(tsd_t *tsd, prof_tdata_t *tdata, bool even_if_attached) {
+	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
+	prof_tdata_destroy_locked(tsd, tdata, even_if_attached);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
+}
+
+static void
+prof_tdata_detach(tsd_t *tsd, prof_tdata_t *tdata) {
+	bool destroy_tdata;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
+	if (tdata->attached) {
+		destroy_tdata = prof_tdata_should_destroy(tsd_tsdn(tsd), tdata,
+		    true);
+		/*
+		 * Only detach if !destroy_tdata, because detaching would allow
+		 * another thread to win the race to destroy tdata.
+		 */
+		if (!destroy_tdata) {
+			tdata->attached = false;
+		}
+		tsd_prof_tdata_set(tsd, NULL);
+	} else {
+		destroy_tdata = false;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
+	if (destroy_tdata) {
+		prof_tdata_destroy(tsd, tdata, true);
+	}
+}
+
+prof_tdata_t *
+prof_tdata_reinit(tsd_t *tsd, prof_tdata_t *tdata) {
+	uint64_t thr_uid = tdata->thr_uid;
+	uint64_t thr_discrim = tdata->thr_discrim + 1;
+	char *thread_name = (tdata->thread_name != NULL) ?
+	    prof_thread_name_alloc(tsd_tsdn(tsd), tdata->thread_name) : NULL;
+	bool active = tdata->active;
+
+	prof_tdata_detach(tsd, tdata);
+	return prof_tdata_init_impl(tsd, thr_uid, thr_discrim, thread_name,
+	    active);
+}
+
+static bool
+prof_tdata_expire(tsdn_t *tsdn, prof_tdata_t *tdata) {
+	bool destroy_tdata;
+
+	malloc_mutex_lock(tsdn, tdata->lock);
+	if (!tdata->expired) {
+		tdata->expired = true;
+		destroy_tdata = tdata->attached ? false :
+		    prof_tdata_should_destroy(tsdn, tdata, false);
+	} else {
+		destroy_tdata = false;
+	}
+	malloc_mutex_unlock(tsdn, tdata->lock);
+
+	return destroy_tdata;
+}
+
+static prof_tdata_t *
+prof_tdata_reset_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
+    void *arg) {
+	tsdn_t *tsdn = (tsdn_t *)arg;
+
+	return (prof_tdata_expire(tsdn, tdata) ? tdata : NULL);
+}
+
+void
+prof_reset(tsd_t *tsd, size_t lg_sample) {
+	prof_tdata_t *next;
+
+	assert(lg_sample < (sizeof(uint64_t) << 3));
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_mtx);
+	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
+
+	lg_prof_sample = lg_sample;
+
+	next = NULL;
+	do {
+		prof_tdata_t *to_destroy = tdata_tree_iter(&tdatas, next,
+		    prof_tdata_reset_iter, (void *)tsd);
+		if (to_destroy != NULL) {
+			next = tdata_tree_next(&tdatas, to_destroy);
+			prof_tdata_destroy_locked(tsd, to_destroy, false);
+		} else {
+			next = NULL;
+		}
+	} while (next != NULL);
+
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_mtx);
+}
+
+void
+prof_tdata_cleanup(tsd_t *tsd) {
+	prof_tdata_t *tdata;
+
+	if (!config_prof) {
+		return;
+	}
+
+	tdata = tsd_prof_tdata_get(tsd);
+	if (tdata != NULL) {
+		prof_tdata_detach(tsd, tdata);
+	}
+}
+
+bool
+prof_active_get(tsdn_t *tsdn) {
+	bool prof_active_current;
+
+	malloc_mutex_lock(tsdn, &prof_active_mtx);
+	prof_active_current = prof_active;
+	malloc_mutex_unlock(tsdn, &prof_active_mtx);
+	return prof_active_current;
+}
+
+bool
+prof_active_set(tsdn_t *tsdn, bool active) {
+	bool prof_active_old;
+
+	malloc_mutex_lock(tsdn, &prof_active_mtx);
+	prof_active_old = prof_active;
+	prof_active = active;
+	malloc_mutex_unlock(tsdn, &prof_active_mtx);
+	return prof_active_old;
+}
+
+const char *
+prof_thread_name_get(tsd_t *tsd) {
+	prof_tdata_t *tdata;
+
+	tdata = prof_tdata_get(tsd, true);
+	if (tdata == NULL) {
+		return "";
+	}
+	return (tdata->thread_name != NULL ? tdata->thread_name : "");
+}
+
+static char *
+prof_thread_name_alloc(tsdn_t *tsdn, const char *thread_name) {
+	char *ret;
+	size_t size;
+
+	if (thread_name == NULL) {
+		return NULL;
+	}
+
+	size = strlen(thread_name) + 1;
+	if (size == 1) {
+		return "";
+	}
+
+	ret = iallocztm(tsdn, size, sz_size2index(size), false, NULL, true,
+	    arena_get(TSDN_NULL, 0, true), true);
+	if (ret == NULL) {
+		return NULL;
+	}
+	memcpy(ret, thread_name, size);
+	return ret;
+}
+
+int
+prof_thread_name_set(tsd_t *tsd, const char *thread_name) {
+	prof_tdata_t *tdata;
+	unsigned i;
+	char *s;
+
+	tdata = prof_tdata_get(tsd, true);
+	if (tdata == NULL) {
+		return EAGAIN;
+	}
+
+	/* Validate input. */
+	if (thread_name == NULL) {
+		return EFAULT;
+	}
+	for (i = 0; thread_name[i] != '\0'; i++) {
+		char c = thread_name[i];
+		if (!isgraph(c) && !isblank(c)) {
+			return EFAULT;
+		}
+	}
+
+	s = prof_thread_name_alloc(tsd_tsdn(tsd), thread_name);
+	if (s == NULL) {
+		return EAGAIN;
+	}
+
+	if (tdata->thread_name != NULL) {
+		idalloctm(tsd_tsdn(tsd), tdata->thread_name, NULL, NULL, true,
+		    true);
+		tdata->thread_name = NULL;
+	}
+	if (strlen(s) > 0) {
+		tdata->thread_name = s;
+	}
+	return 0;
+}
+
+bool
+prof_thread_active_get(tsd_t *tsd) {
+	prof_tdata_t *tdata;
+
+	tdata = prof_tdata_get(tsd, true);
+	if (tdata == NULL) {
+		return false;
+	}
+	return tdata->active;
+}
+
+bool
+prof_thread_active_set(tsd_t *tsd, bool active) {
+	prof_tdata_t *tdata;
+
+	tdata = prof_tdata_get(tsd, true);
+	if (tdata == NULL) {
+		return true;
+	}
+	tdata->active = active;
+	return false;
+}
+
+bool
+prof_thread_active_init_get(tsdn_t *tsdn) {
+	bool active_init;
+
+	malloc_mutex_lock(tsdn, &prof_thread_active_init_mtx);
+	active_init = prof_thread_active_init;
+	malloc_mutex_unlock(tsdn, &prof_thread_active_init_mtx);
+	return active_init;
+}
+
+bool
+prof_thread_active_init_set(tsdn_t *tsdn, bool active_init) {
+	bool active_init_old;
+
+	malloc_mutex_lock(tsdn, &prof_thread_active_init_mtx);
+	active_init_old = prof_thread_active_init;
+	prof_thread_active_init = active_init;
+	malloc_mutex_unlock(tsdn, &prof_thread_active_init_mtx);
+	return active_init_old;
+}
+
+bool
+prof_gdump_get(tsdn_t *tsdn) {
+	bool prof_gdump_current;
+
+	malloc_mutex_lock(tsdn, &prof_gdump_mtx);
+	prof_gdump_current = prof_gdump_val;
+	malloc_mutex_unlock(tsdn, &prof_gdump_mtx);
+	return prof_gdump_current;
+}
+
+bool
+prof_gdump_set(tsdn_t *tsdn, bool gdump) {
+	bool prof_gdump_old;
+
+	malloc_mutex_lock(tsdn, &prof_gdump_mtx);
+	prof_gdump_old = prof_gdump_val;
+	prof_gdump_val = gdump;
+	malloc_mutex_unlock(tsdn, &prof_gdump_mtx);
+	return prof_gdump_old;
+}
+
+void
+prof_boot0(void) {
+	cassert(config_prof);
+
+	memcpy(opt_prof_prefix, PROF_PREFIX_DEFAULT,
+	    sizeof(PROF_PREFIX_DEFAULT));
+}
+
+void
+prof_boot1(void) {
+	cassert(config_prof);
+
+	/*
+	 * opt_prof must be in its final state before any arenas are
+	 * initialized, so this function must be executed early.
+	 */
+
+	if (opt_prof_leak && !opt_prof) {
+		/*
+		 * Enable opt_prof, but in such a way that profiles are never
+		 * automatically dumped.
+		 */
+		opt_prof = true;
+		opt_prof_gdump = false;
+	} else if (opt_prof) {
+		if (opt_lg_prof_interval >= 0) {
+			prof_interval = (((uint64_t)1U) <<
+			    opt_lg_prof_interval);
+		}
+	}
+}
+
+bool
+prof_boot2(tsd_t *tsd) {
+	cassert(config_prof);
+
+	if (opt_prof) {
+		unsigned i;
+
+		lg_prof_sample = opt_lg_prof_sample;
+
+		prof_active = opt_prof_active;
+		if (malloc_mutex_init(&prof_active_mtx, "prof_active",
+		    WITNESS_RANK_PROF_ACTIVE, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		prof_gdump_val = opt_prof_gdump;
+		if (malloc_mutex_init(&prof_gdump_mtx, "prof_gdump",
+		    WITNESS_RANK_PROF_GDUMP, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		prof_thread_active_init = opt_prof_thread_active_init;
+		if (malloc_mutex_init(&prof_thread_active_init_mtx,
+		    "prof_thread_active_init",
+		    WITNESS_RANK_PROF_THREAD_ACTIVE_INIT,
+		    malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		if (ckh_new(tsd, &bt2gctx, PROF_CKH_MINITEMS, prof_bt_hash,
+		    prof_bt_keycomp)) {
+			return true;
+		}
+		if (malloc_mutex_init(&bt2gctx_mtx, "prof_bt2gctx",
+		    WITNESS_RANK_PROF_BT2GCTX, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		tdata_tree_new(&tdatas);
+		if (malloc_mutex_init(&tdatas_mtx, "prof_tdatas",
+		    WITNESS_RANK_PROF_TDATAS, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		next_thr_uid = 0;
+		if (malloc_mutex_init(&next_thr_uid_mtx, "prof_next_thr_uid",
+		    WITNESS_RANK_PROF_NEXT_THR_UID, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		if (malloc_mutex_init(&prof_dump_seq_mtx, "prof_dump_seq",
+		    WITNESS_RANK_PROF_DUMP_SEQ, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+		if (malloc_mutex_init(&prof_dump_mtx, "prof_dump",
+		    WITNESS_RANK_PROF_DUMP, malloc_mutex_rank_exclusive)) {
+			return true;
+		}
+
+		if (opt_prof_final && opt_prof_prefix[0] != '\0' &&
+		    atexit(prof_fdump) != 0) {
+			malloc_write("<jemalloc>: Error in atexit()\n");
+			if (opt_abort) {
+				abort();
+			}
+		}
+
+		gctx_locks = (malloc_mutex_t *)base_alloc(tsd_tsdn(tsd),
+		    b0get(), PROF_NCTX_LOCKS * sizeof(malloc_mutex_t),
+		    CACHELINE);
+		if (gctx_locks == NULL) {
+			return true;
+		}
+		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
+			if (malloc_mutex_init(&gctx_locks[i], "prof_gctx",
+			    WITNESS_RANK_PROF_GCTX,
+			    malloc_mutex_rank_exclusive)) {
+				return true;
+			}
+		}
+
+		tdata_locks = (malloc_mutex_t *)base_alloc(tsd_tsdn(tsd),
+		    b0get(), PROF_NTDATA_LOCKS * sizeof(malloc_mutex_t),
+		    CACHELINE);
+		if (tdata_locks == NULL) {
+			return true;
+		}
+		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
+			if (malloc_mutex_init(&tdata_locks[i], "prof_tdata",
+			    WITNESS_RANK_PROF_TDATA,
+			    malloc_mutex_rank_exclusive)) {
+				return true;
+			}
+		}
+	}
+
+#ifdef JEMALLOC_PROF_LIBGCC
+	/*
+	 * Cause the backtracing machinery to allocate its internal state
+	 * before enabling profiling.
+	 */
+	_Unwind_Backtrace(prof_unwind_init_callback, NULL);
+#endif
+
+	prof_booted = true;
+
+	return false;
+}
+
+void
+prof_prefork0(tsdn_t *tsdn) {
+	if (config_prof && opt_prof) {
+		unsigned i;
+
+		malloc_mutex_prefork(tsdn, &prof_dump_mtx);
+		malloc_mutex_prefork(tsdn, &bt2gctx_mtx);
+		malloc_mutex_prefork(tsdn, &tdatas_mtx);
+		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
+			malloc_mutex_prefork(tsdn, &tdata_locks[i]);
+		}
+		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
+			malloc_mutex_prefork(tsdn, &gctx_locks[i]);
+		}
+	}
+}
+
+void
+prof_prefork1(tsdn_t *tsdn) {
+	if (config_prof && opt_prof) {
+		malloc_mutex_prefork(tsdn, &prof_active_mtx);
+		malloc_mutex_prefork(tsdn, &prof_dump_seq_mtx);
+		malloc_mutex_prefork(tsdn, &prof_gdump_mtx);
+		malloc_mutex_prefork(tsdn, &next_thr_uid_mtx);
+		malloc_mutex_prefork(tsdn, &prof_thread_active_init_mtx);
+	}
+}
+
+void
+prof_postfork_parent(tsdn_t *tsdn) {
+	if (config_prof && opt_prof) {
+		unsigned i;
+
+		malloc_mutex_postfork_parent(tsdn,
+		    &prof_thread_active_init_mtx);
+		malloc_mutex_postfork_parent(tsdn, &next_thr_uid_mtx);
+		malloc_mutex_postfork_parent(tsdn, &prof_gdump_mtx);
+		malloc_mutex_postfork_parent(tsdn, &prof_dump_seq_mtx);
+		malloc_mutex_postfork_parent(tsdn, &prof_active_mtx);
+		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
+			malloc_mutex_postfork_parent(tsdn, &gctx_locks[i]);
+		}
+		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
+			malloc_mutex_postfork_parent(tsdn, &tdata_locks[i]);
+		}
+		malloc_mutex_postfork_parent(tsdn, &tdatas_mtx);
+		malloc_mutex_postfork_parent(tsdn, &bt2gctx_mtx);
+		malloc_mutex_postfork_parent(tsdn, &prof_dump_mtx);
+	}
+}
+
+void
+prof_postfork_child(tsdn_t *tsdn) {
+	if (config_prof && opt_prof) {
+		unsigned i;
+
+		malloc_mutex_postfork_child(tsdn, &prof_thread_active_init_mtx);
+		malloc_mutex_postfork_child(tsdn, &next_thr_uid_mtx);
+		malloc_mutex_postfork_child(tsdn, &prof_gdump_mtx);
+		malloc_mutex_postfork_child(tsdn, &prof_dump_seq_mtx);
+		malloc_mutex_postfork_child(tsdn, &prof_active_mtx);
+		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
+			malloc_mutex_postfork_child(tsdn, &gctx_locks[i]);
+		}
+		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
+			malloc_mutex_postfork_child(tsdn, &tdata_locks[i]);
+		}
+		malloc_mutex_postfork_child(tsdn, &tdatas_mtx);
+		malloc_mutex_postfork_child(tsdn, &bt2gctx_mtx);
+		malloc_mutex_postfork_child(tsdn, &prof_dump_mtx);
+	}
+}
+
+/******************************************************************************/
diff --git a/redis-stable/deps/jemalloc/src/rtree.c b/redis-stable/deps/jemalloc/src/rtree.c
new file mode 100644
index 00000000..53702cf7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/rtree.c
@@ -0,0 +1,320 @@
+#define JEMALLOC_RTREE_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/mutex.h"
+
+/*
+ * Only the most significant bits of keys passed to rtree_{read,write}() are
+ * used.
+ */
+bool
+rtree_new(rtree_t *rtree, bool zeroed) {
+#ifdef JEMALLOC_JET
+	if (!zeroed) {
+		memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */
+	}
+#else
+	assert(zeroed);
+#endif
+
+	if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+
+	return false;
+}
+
+static rtree_node_elm_t *
+rtree_node_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
+	return (rtree_node_elm_t *)base_alloc(tsdn, b0get(), nelms *
+	    sizeof(rtree_node_elm_t), CACHELINE);
+}
+rtree_node_alloc_t *JET_MUTABLE rtree_node_alloc = rtree_node_alloc_impl;
+
+static void
+rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) {
+	/* Nodes are never deleted during normal operation. */
+	not_reached();
+}
+UNUSED rtree_node_dalloc_t *JET_MUTABLE rtree_node_dalloc =
+    rtree_node_dalloc_impl;
+
+static rtree_leaf_elm_t *
+rtree_leaf_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
+	return (rtree_leaf_elm_t *)base_alloc(tsdn, b0get(), nelms *
+	    sizeof(rtree_leaf_elm_t), CACHELINE);
+}
+rtree_leaf_alloc_t *JET_MUTABLE rtree_leaf_alloc = rtree_leaf_alloc_impl;
+
+static void
+rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) {
+	/* Leaves are never deleted during normal operation. */
+	not_reached();
+}
+UNUSED rtree_leaf_dalloc_t *JET_MUTABLE rtree_leaf_dalloc =
+    rtree_leaf_dalloc_impl;
+
+#ifdef JEMALLOC_JET
+#  if RTREE_HEIGHT > 1
+static void
+rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree,
+    unsigned level) {
+	size_t nchildren = ZU(1) << rtree_levels[level].bits;
+	if (level + 2 < RTREE_HEIGHT) {
+		for (size_t i = 0; i < nchildren; i++) {
+			rtree_node_elm_t *node =
+			    (rtree_node_elm_t *)atomic_load_p(&subtree[i].child,
+			    ATOMIC_RELAXED);
+			if (node != NULL) {
+				rtree_delete_subtree(tsdn, rtree, node, level +
+				    1);
+			}
+		}
+	} else {
+		for (size_t i = 0; i < nchildren; i++) {
+			rtree_leaf_elm_t *leaf =
+			    (rtree_leaf_elm_t *)atomic_load_p(&subtree[i].child,
+			    ATOMIC_RELAXED);
+			if (leaf != NULL) {
+				rtree_leaf_dalloc(tsdn, rtree, leaf);
+			}
+		}
+	}
+
+	if (subtree != rtree->root) {
+		rtree_node_dalloc(tsdn, rtree, subtree);
+	}
+}
+#  endif
+
+void
+rtree_delete(tsdn_t *tsdn, rtree_t *rtree) {
+#  if RTREE_HEIGHT > 1
+	rtree_delete_subtree(tsdn, rtree, rtree->root, 0);
+#  endif
+}
+#endif
+
+static rtree_node_elm_t *
+rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigned level,
+    atomic_p_t *elmp) {
+	malloc_mutex_lock(tsdn, &rtree->init_lock);
+	/*
+	 * If *elmp is non-null, then it was initialized with the init lock
+	 * held, so we can get by with 'relaxed' here.
+	 */
+	rtree_node_elm_t *node = atomic_load_p(elmp, ATOMIC_RELAXED);
+	if (node == NULL) {
+		node = rtree_node_alloc(tsdn, rtree, ZU(1) <<
+		    rtree_levels[level].bits);
+		if (node == NULL) {
+			malloc_mutex_unlock(tsdn, &rtree->init_lock);
+			return NULL;
+		}
+		/*
+		 * Even though we hold the lock, a later reader might not; we
+		 * need release semantics.
+		 */
+		atomic_store_p(elmp, node, ATOMIC_RELEASE);
+	}
+	malloc_mutex_unlock(tsdn, &rtree->init_lock);
+
+	return node;
+}
+
+static rtree_leaf_elm_t *
+rtree_leaf_init(tsdn_t *tsdn, rtree_t *rtree, atomic_p_t *elmp) {
+	malloc_mutex_lock(tsdn, &rtree->init_lock);
+	/*
+	 * If *elmp is non-null, then it was initialized with the init lock
+	 * held, so we can get by with 'relaxed' here.
+	 */
+	rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED);
+	if (leaf == NULL) {
+		leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
+		    rtree_levels[RTREE_HEIGHT-1].bits);
+		if (leaf == NULL) {
+			malloc_mutex_unlock(tsdn, &rtree->init_lock);
+			return NULL;
+		}
+		/*
+		 * Even though we hold the lock, a later reader might not; we
+		 * need release semantics.
+		 */
+		atomic_store_p(elmp, leaf, ATOMIC_RELEASE);
+	}
+	malloc_mutex_unlock(tsdn, &rtree->init_lock);
+
+	return leaf;
+}
+
+static bool
+rtree_node_valid(rtree_node_elm_t *node) {
+	return ((uintptr_t)node != (uintptr_t)0);
+}
+
+static bool
+rtree_leaf_valid(rtree_leaf_elm_t *leaf) {
+	return ((uintptr_t)leaf != (uintptr_t)0);
+}
+
+static rtree_node_elm_t *
+rtree_child_node_tryread(rtree_node_elm_t *elm, bool dependent) {
+	rtree_node_elm_t *node;
+
+	if (dependent) {
+		node = (rtree_node_elm_t *)atomic_load_p(&elm->child,
+		    ATOMIC_RELAXED);
+	} else {
+		node = (rtree_node_elm_t *)atomic_load_p(&elm->child,
+		    ATOMIC_ACQUIRE);
+	}
+
+	assert(!dependent || node != NULL);
+	return node;
+}
+
+static rtree_node_elm_t *
+rtree_child_node_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
+    unsigned level, bool dependent) {
+	rtree_node_elm_t *node;
+
+	node = rtree_child_node_tryread(elm, dependent);
+	if (!dependent && unlikely(!rtree_node_valid(node))) {
+		node = rtree_node_init(tsdn, rtree, level + 1, &elm->child);
+	}
+	assert(!dependent || node != NULL);
+	return node;
+}
+
+static rtree_leaf_elm_t *
+rtree_child_leaf_tryread(rtree_node_elm_t *elm, bool dependent) {
+	rtree_leaf_elm_t *leaf;
+
+	if (dependent) {
+		leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child,
+		    ATOMIC_RELAXED);
+	} else {
+		leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child,
+		    ATOMIC_ACQUIRE);
+	}
+
+	assert(!dependent || leaf != NULL);
+	return leaf;
+}
+
+static rtree_leaf_elm_t *
+rtree_child_leaf_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
+    unsigned level, bool dependent) {
+	rtree_leaf_elm_t *leaf;
+
+	leaf = rtree_child_leaf_tryread(elm, dependent);
+	if (!dependent && unlikely(!rtree_leaf_valid(leaf))) {
+		leaf = rtree_leaf_init(tsdn, rtree, &elm->child);
+	}
+	assert(!dependent || leaf != NULL);
+	return leaf;
+}
+
+rtree_leaf_elm_t *
+rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
+    uintptr_t key, bool dependent, bool init_missing) {
+	rtree_node_elm_t *node;
+	rtree_leaf_elm_t *leaf;
+#if RTREE_HEIGHT > 1
+	node = rtree->root;
+#else
+	leaf = rtree->root;
+#endif
+
+	if (config_debug) {
+		uintptr_t leafkey = rtree_leafkey(key);
+		for (unsigned i = 0; i < RTREE_CTX_NCACHE; i++) {
+			assert(rtree_ctx->cache[i].leafkey != leafkey);
+		}
+		for (unsigned i = 0; i < RTREE_CTX_NCACHE_L2; i++) {
+			assert(rtree_ctx->l2_cache[i].leafkey != leafkey);
+		}
+	}
+
+#define RTREE_GET_CHILD(level) {					\
+		assert(level < RTREE_HEIGHT-1);				\
+		if (level != 0 && !dependent &&				\
+		    unlikely(!rtree_node_valid(node))) {		\
+			return NULL;					\
+		}							\
+		uintptr_t subkey = rtree_subkey(key, level);		\
+		if (level + 2 < RTREE_HEIGHT) {				\
+			node = init_missing ?				\
+			    rtree_child_node_read(tsdn, rtree,		\
+			    &node[subkey], level, dependent) :		\
+			    rtree_child_node_tryread(&node[subkey],	\
+			    dependent);					\
+		} else {						\
+			leaf = init_missing ?				\
+			    rtree_child_leaf_read(tsdn, rtree,		\
+			    &node[subkey], level, dependent) :		\
+			    rtree_child_leaf_tryread(&node[subkey],	\
+			    dependent);					\
+		}							\
+	}
+	/*
+	 * Cache replacement upon hard lookup (i.e. L1 & L2 rtree cache miss):
+	 * (1) evict last entry in L2 cache; (2) move the collision slot from L1
+	 * cache down to L2; and 3) fill L1.
+	 */
+#define RTREE_GET_LEAF(level) {						\
+		assert(level == RTREE_HEIGHT-1);			\
+		if (!dependent && unlikely(!rtree_leaf_valid(leaf))) {	\
+			return NULL;					\
+		}							\
+		if (RTREE_CTX_NCACHE_L2 > 1) {				\
+			memmove(&rtree_ctx->l2_cache[1],		\
+			    &rtree_ctx->l2_cache[0],			\
+			    sizeof(rtree_ctx_cache_elm_t) *		\
+			    (RTREE_CTX_NCACHE_L2 - 1));			\
+		}							\
+		size_t slot = rtree_cache_direct_map(key);		\
+		rtree_ctx->l2_cache[0].leafkey =			\
+		    rtree_ctx->cache[slot].leafkey;			\
+		rtree_ctx->l2_cache[0].leaf =				\
+		    rtree_ctx->cache[slot].leaf;			\
+		uintptr_t leafkey = rtree_leafkey(key);			\
+		rtree_ctx->cache[slot].leafkey = leafkey;		\
+		rtree_ctx->cache[slot].leaf = leaf;			\
+		uintptr_t subkey = rtree_subkey(key, level);		\
+		return &leaf[subkey];					\
+	}
+	if (RTREE_HEIGHT > 1) {
+		RTREE_GET_CHILD(0)
+	}
+	if (RTREE_HEIGHT > 2) {
+		RTREE_GET_CHILD(1)
+	}
+	if (RTREE_HEIGHT > 3) {
+		for (unsigned i = 2; i < RTREE_HEIGHT-1; i++) {
+			RTREE_GET_CHILD(i)
+		}
+	}
+	RTREE_GET_LEAF(RTREE_HEIGHT-1)
+#undef RTREE_GET_CHILD
+#undef RTREE_GET_LEAF
+	not_reached();
+}
+
+void
+rtree_ctx_data_init(rtree_ctx_t *ctx) {
+	for (unsigned i = 0; i < RTREE_CTX_NCACHE; i++) {
+		rtree_ctx_cache_elm_t *cache = &ctx->cache[i];
+		cache->leafkey = RTREE_LEAFKEY_INVALID;
+		cache->leaf = NULL;
+	}
+	for (unsigned i = 0; i < RTREE_CTX_NCACHE_L2; i++) {
+		rtree_ctx_cache_elm_t *cache = &ctx->l2_cache[i];
+		cache->leafkey = RTREE_LEAFKEY_INVALID;
+		cache->leaf = NULL;
+	}
+}
diff --git a/redis-stable/deps/jemalloc/src/stats.c b/redis-stable/deps/jemalloc/src/stats.c
new file mode 100644
index 00000000..08b9507c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/stats.c
@@ -0,0 +1,1286 @@
+#define JEMALLOC_STATS_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/ctl.h"
+#include "jemalloc/internal/emitter.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/mutex_prof.h"
+
+const char *global_mutex_names[mutex_prof_num_global_mutexes] = {
+#define OP(mtx) #mtx,
+	MUTEX_PROF_GLOBAL_MUTEXES
+#undef OP
+};
+
+const char *arena_mutex_names[mutex_prof_num_arena_mutexes] = {
+#define OP(mtx) #mtx,
+	MUTEX_PROF_ARENA_MUTEXES
+#undef OP
+};
+
+#define CTL_GET(n, v, t) do {						\
+	size_t sz = sizeof(t);						\
+	xmallctl(n, (void *)v, &sz, NULL, 0);				\
+} while (0)
+
+#define CTL_M2_GET(n, i, v, t) do {					\
+	size_t mib[CTL_MAX_DEPTH];					\
+	size_t miblen = sizeof(mib) / sizeof(size_t);			\
+	size_t sz = sizeof(t);						\
+	xmallctlnametomib(n, mib, &miblen);				\
+	mib[2] = (i);							\
+	xmallctlbymib(mib, miblen, (void *)v, &sz, NULL, 0);		\
+} while (0)
+
+#define CTL_M2_M4_GET(n, i, j, v, t) do {				\
+	size_t mib[CTL_MAX_DEPTH];					\
+	size_t miblen = sizeof(mib) / sizeof(size_t);			\
+	size_t sz = sizeof(t);						\
+	xmallctlnametomib(n, mib, &miblen);				\
+	mib[2] = (i);							\
+	mib[4] = (j);							\
+	xmallctlbymib(mib, miblen, (void *)v, &sz, NULL, 0);		\
+} while (0)
+
+/******************************************************************************/
+/* Data. */
+
+bool opt_stats_print = false;
+char opt_stats_print_opts[stats_print_tot_num_options+1] = "";
+
+/******************************************************************************/
+
+/* Calculate x.yyy and output a string (takes a fixed sized char array). */
+static bool
+get_rate_str(uint64_t dividend, uint64_t divisor, char str[6]) {
+	if (divisor == 0 || dividend > divisor) {
+		/* The rate is not supposed to be greater than 1. */
+		return true;
+	}
+	if (dividend > 0) {
+		assert(UINT64_MAX / dividend >= 1000);
+	}
+
+	unsigned n = (unsigned)((dividend * 1000) / divisor);
+	if (n < 10) {
+		malloc_snprintf(str, 6, "0.00%u", n);
+	} else if (n < 100) {
+		malloc_snprintf(str, 6, "0.0%u", n);
+	} else if (n < 1000) {
+		malloc_snprintf(str, 6, "0.%u", n);
+	} else {
+		malloc_snprintf(str, 6, "1");
+	}
+
+	return false;
+}
+
+#define MUTEX_CTL_STR_MAX_LENGTH 128
+static void
+gen_mutex_ctl_str(char *str, size_t buf_len, const char *prefix,
+    const char *mutex, const char *counter) {
+	malloc_snprintf(str, buf_len, "stats.%s.%s.%s", prefix, mutex, counter);
+}
+
+static void
+mutex_stats_init_cols(emitter_row_t *row, const char *table_name,
+    emitter_col_t *name,
+    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
+    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
+	mutex_prof_uint64_t_counter_ind_t k_uint64_t = 0;
+	mutex_prof_uint32_t_counter_ind_t k_uint32_t = 0;
+
+	emitter_col_t *col;
+
+	if (name != NULL) {
+		emitter_col_init(name, row);
+		name->justify = emitter_justify_left;
+		name->width = 21;
+		name->type = emitter_type_title;
+		name->str_val = table_name;
+	}
+
+#define WIDTH_uint32_t 12
+#define WIDTH_uint64_t 16
+#define OP(counter, counter_type, human)				\
+	col = &col_##counter_type[k_##counter_type];			\
+	++k_##counter_type;						\
+	emitter_col_init(col, row);					\
+	col->justify = emitter_justify_right;				\
+	col->width = WIDTH_##counter_type;				\
+	col->type = emitter_type_title;					\
+	col->str_val = human;
+	MUTEX_PROF_COUNTERS
+#undef OP
+#undef WIDTH_uint32_t
+#undef WIDTH_uint64_t
+}
+
+static void
+mutex_stats_read_global(const char *name, emitter_col_t *col_name,
+    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
+    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
+	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
+
+	col_name->str_val = name;
+
+	emitter_col_t *dst;
+#define EMITTER_TYPE_uint32_t emitter_type_uint32
+#define EMITTER_TYPE_uint64_t emitter_type_uint64
+#define OP(counter, counter_type, human)				\
+	dst = &col_##counter_type[mutex_counter_##counter];		\
+	dst->type = EMITTER_TYPE_##counter_type;			\
+	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
+	    "mutexes", name, #counter);					\
+	CTL_GET(cmd, (counter_type *)&dst->bool_val, counter_type);
+	MUTEX_PROF_COUNTERS
+#undef OP
+#undef EMITTER_TYPE_uint32_t
+#undef EMITTER_TYPE_uint64_t
+}
+
+static void
+mutex_stats_read_arena(unsigned arena_ind, mutex_prof_arena_ind_t mutex_ind,
+    const char *name, emitter_col_t *col_name,
+    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
+    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
+	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
+
+	col_name->str_val = name;
+
+	emitter_col_t *dst;
+#define EMITTER_TYPE_uint32_t emitter_type_uint32
+#define EMITTER_TYPE_uint64_t emitter_type_uint64
+#define OP(counter, counter_type, human)				\
+	dst = &col_##counter_type[mutex_counter_##counter];		\
+	dst->type = EMITTER_TYPE_##counter_type;			\
+	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
+	    "arenas.0.mutexes",	arena_mutex_names[mutex_ind], #counter);\
+	CTL_M2_GET(cmd, arena_ind,					\
+	    (counter_type *)&dst->bool_val, counter_type);
+	MUTEX_PROF_COUNTERS
+#undef OP
+#undef EMITTER_TYPE_uint32_t
+#undef EMITTER_TYPE_uint64_t
+}
+
+static void
+mutex_stats_read_arena_bin(unsigned arena_ind, unsigned bin_ind,
+    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
+    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
+	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
+	emitter_col_t *dst;
+
+#define EMITTER_TYPE_uint32_t emitter_type_uint32
+#define EMITTER_TYPE_uint64_t emitter_type_uint64
+#define OP(counter, counter_type, human)				\
+	dst = &col_##counter_type[mutex_counter_##counter];		\
+	dst->type = EMITTER_TYPE_##counter_type;			\
+	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
+	    "arenas.0.bins.0","mutex", #counter);			\
+	CTL_M2_M4_GET(cmd, arena_ind, bin_ind,				\
+	    (counter_type *)&dst->bool_val, counter_type);
+	MUTEX_PROF_COUNTERS
+#undef OP
+#undef EMITTER_TYPE_uint32_t
+#undef EMITTER_TYPE_uint64_t
+}
+
+/* "row" can be NULL to avoid emitting in table mode. */
+static void
+mutex_stats_emit(emitter_t *emitter, emitter_row_t *row,
+    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
+    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
+	if (row != NULL) {
+		emitter_table_row(emitter, row);
+	}
+
+	mutex_prof_uint64_t_counter_ind_t k_uint64_t = 0;
+	mutex_prof_uint32_t_counter_ind_t k_uint32_t = 0;
+
+	emitter_col_t *col;
+
+#define EMITTER_TYPE_uint32_t emitter_type_uint32
+#define EMITTER_TYPE_uint64_t emitter_type_uint64
+#define OP(counter, type, human)					\
+	col = &col_##type[k_##type];						\
+	++k_##type;							\
+	emitter_json_kv(emitter, #counter, EMITTER_TYPE_##type,		\
+	    (const void *)&col->bool_val);
+	MUTEX_PROF_COUNTERS;
+#undef OP
+#undef EMITTER_TYPE_uint32_t
+#undef EMITTER_TYPE_uint64_t
+}
+
+static void
+stats_arena_bins_print(emitter_t *emitter, bool mutex, unsigned i) {
+	size_t page;
+	bool in_gap, in_gap_prev;
+	unsigned nbins, j;
+
+	CTL_GET("arenas.page", &page, size_t);
+
+	CTL_GET("arenas.nbins", &nbins, unsigned);
+
+	emitter_row_t header_row;
+	emitter_row_init(&header_row);
+
+	emitter_row_t row;
+	emitter_row_init(&row);
+#define COL(name, left_or_right, col_width, etype)			\
+	emitter_col_t col_##name;					\
+	emitter_col_init(&col_##name, &row);				\
+	col_##name.justify = emitter_justify_##left_or_right;		\
+	col_##name.width = col_width;					\
+	col_##name.type = emitter_type_##etype;				\
+	emitter_col_t header_col_##name;				\
+	emitter_col_init(&header_col_##name, &header_row);		\
+	header_col_##name.justify = emitter_justify_##left_or_right;	\
+	header_col_##name.width = col_width;				\
+	header_col_##name.type = emitter_type_title;			\
+	header_col_##name.str_val = #name;
+
+	COL(size, right, 20, size)
+	COL(ind, right, 4, unsigned)
+	COL(allocated, right, 13, uint64)
+	COL(nmalloc, right, 13, uint64)
+	COL(ndalloc, right, 13, uint64)
+	COL(nrequests, right, 13, uint64)
+	COL(curregs, right, 13, size)
+	COL(curslabs, right, 13, size)
+	COL(regs, right, 5, unsigned)
+	COL(pgs, right, 4, size)
+	/* To buffer a right- and left-justified column. */
+	COL(justify_spacer, right, 1, title)
+	COL(util, right, 6, title)
+	COL(nfills, right, 13, uint64)
+	COL(nflushes, right, 13, uint64)
+	COL(nslabs, right, 13, uint64)
+	COL(nreslabs, right, 13, uint64)
+#undef COL
+
+	/* Don't want to actually print the name. */
+	header_col_justify_spacer.str_val = " ";
+	col_justify_spacer.str_val = " ";
+
+
+	emitter_col_t col_mutex64[mutex_prof_num_uint64_t_counters];
+	emitter_col_t col_mutex32[mutex_prof_num_uint32_t_counters];
+
+	emitter_col_t header_mutex64[mutex_prof_num_uint64_t_counters];
+	emitter_col_t header_mutex32[mutex_prof_num_uint32_t_counters];
+
+	if (mutex) {
+		mutex_stats_init_cols(&row, NULL, NULL, col_mutex64,
+		    col_mutex32);
+		mutex_stats_init_cols(&header_row, NULL, NULL, header_mutex64,
+		    header_mutex32);
+	}
+
+	/*
+	 * We print a "bins:" header as part of the table row; we need to adjust
+	 * the header size column to compensate.
+	 */
+	header_col_size.width -=5;
+	emitter_table_printf(emitter, "bins:");
+	emitter_table_row(emitter, &header_row);
+	emitter_json_arr_begin(emitter, "bins");
+
+	for (j = 0, in_gap = false; j < nbins; j++) {
+		uint64_t nslabs;
+		size_t reg_size, slab_size, curregs;
+		size_t curslabs;
+		uint32_t nregs;
+		uint64_t nmalloc, ndalloc, nrequests, nfills, nflushes;
+		uint64_t nreslabs;
+
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nslabs", i, j, &nslabs,
+		    uint64_t);
+		in_gap_prev = in_gap;
+		in_gap = (nslabs == 0);
+
+		if (in_gap_prev && !in_gap) {
+			emitter_table_printf(emitter,
+			    "                     ---\n");
+		}
+
+		CTL_M2_GET("arenas.bin.0.size", j, &reg_size, size_t);
+		CTL_M2_GET("arenas.bin.0.nregs", j, &nregs, uint32_t);
+		CTL_M2_GET("arenas.bin.0.slab_size", j, &slab_size, size_t);
+
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nmalloc", i, j, &nmalloc,
+		    uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.ndalloc", i, j, &ndalloc,
+		    uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.curregs", i, j, &curregs,
+		    size_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nrequests", i, j,
+		    &nrequests, uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nfills", i, j, &nfills,
+		    uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nflushes", i, j, &nflushes,
+		    uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.nreslabs", i, j, &nreslabs,
+		    uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.bins.0.curslabs", i, j, &curslabs,
+		    size_t);
+
+		if (mutex) {
+			mutex_stats_read_arena_bin(i, j, col_mutex64,
+			    col_mutex32);
+		}
+
+		emitter_json_arr_obj_begin(emitter);
+		emitter_json_kv(emitter, "nmalloc", emitter_type_uint64,
+		    &nmalloc);
+		emitter_json_kv(emitter, "ndalloc", emitter_type_uint64,
+		    &ndalloc);
+		emitter_json_kv(emitter, "curregs", emitter_type_size,
+		    &curregs);
+		emitter_json_kv(emitter, "nrequests", emitter_type_uint64,
+		    &nrequests);
+		emitter_json_kv(emitter, "nfills", emitter_type_uint64,
+		    &nfills);
+		emitter_json_kv(emitter, "nflushes", emitter_type_uint64,
+		    &nflushes);
+		emitter_json_kv(emitter, "nreslabs", emitter_type_uint64,
+		    &nreslabs);
+		emitter_json_kv(emitter, "curslabs", emitter_type_size,
+		    &curslabs);
+		if (mutex) {
+			emitter_json_dict_begin(emitter, "mutex");
+			mutex_stats_emit(emitter, NULL, col_mutex64,
+			    col_mutex32);
+			emitter_json_dict_end(emitter);
+		}
+		emitter_json_arr_obj_end(emitter);
+
+		size_t availregs = nregs * curslabs;
+		char util[6];
+		if (get_rate_str((uint64_t)curregs, (uint64_t)availregs, util))
+		{
+			if (availregs == 0) {
+				malloc_snprintf(util, sizeof(util), "1");
+			} else if (curregs > availregs) {
+				/*
+				 * Race detected: the counters were read in
+				 * separate mallctl calls and concurrent
+				 * operations happened in between.  In this case
+				 * no meaningful utilization can be computed.
+				 */
+				malloc_snprintf(util, sizeof(util), " race");
+			} else {
+				not_reached();
+			}
+		}
+
+		col_size.size_val = reg_size;
+		col_ind.unsigned_val = j;
+		col_allocated.size_val = curregs * reg_size;
+		col_nmalloc.uint64_val = nmalloc;
+		col_ndalloc.uint64_val = ndalloc;
+		col_nrequests.uint64_val = nrequests;
+		col_curregs.size_val = curregs;
+		col_curslabs.size_val = curslabs;
+		col_regs.unsigned_val = nregs;
+		col_pgs.size_val = slab_size / page;
+		col_util.str_val = util;
+		col_nfills.uint64_val = nfills;
+		col_nflushes.uint64_val = nflushes;
+		col_nslabs.uint64_val = nslabs;
+		col_nreslabs.uint64_val = nreslabs;
+
+		/*
+		 * Note that mutex columns were initialized above, if mutex ==
+		 * true.
+		 */
+
+		emitter_table_row(emitter, &row);
+	}
+	emitter_json_arr_end(emitter); /* Close "bins". */
+
+	if (in_gap) {
+		emitter_table_printf(emitter, "                     ---\n");
+	}
+}
+
+static void
+stats_arena_lextents_print(emitter_t *emitter, unsigned i) {
+	unsigned nbins, nlextents, j;
+	bool in_gap, in_gap_prev;
+
+	CTL_GET("arenas.nbins", &nbins, unsigned);
+	CTL_GET("arenas.nlextents", &nlextents, unsigned);
+
+	emitter_row_t header_row;
+	emitter_row_init(&header_row);
+	emitter_row_t row;
+	emitter_row_init(&row);
+
+#define COL(name, left_or_right, col_width, etype)			\
+	emitter_col_t header_##name;					\
+	emitter_col_init(&header_##name, &header_row);			\
+	header_##name.justify = emitter_justify_##left_or_right;	\
+	header_##name.width = col_width;				\
+	header_##name.type = emitter_type_title;			\
+	header_##name.str_val = #name;					\
+									\
+	emitter_col_t col_##name;					\
+	emitter_col_init(&col_##name, &row);				\
+	col_##name.justify = emitter_justify_##left_or_right;		\
+	col_##name.width = col_width;					\
+	col_##name.type = emitter_type_##etype;
+
+	COL(size, right, 20, size)
+	COL(ind, right, 4, unsigned)
+	COL(allocated, right, 13, size)
+	COL(nmalloc, right, 13, uint64)
+	COL(ndalloc, right, 13, uint64)
+	COL(nrequests, right, 13, uint64)
+	COL(curlextents, right, 13, size)
+#undef COL
+
+	/* As with bins, we label the large extents table. */
+	header_size.width -= 6;
+	emitter_table_printf(emitter, "large:");
+	emitter_table_row(emitter, &header_row);
+	emitter_json_arr_begin(emitter, "lextents");
+
+	for (j = 0, in_gap = false; j < nlextents; j++) {
+		uint64_t nmalloc, ndalloc, nrequests;
+		size_t lextent_size, curlextents;
+
+		CTL_M2_M4_GET("stats.arenas.0.lextents.0.nmalloc", i, j,
+		    &nmalloc, uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.lextents.0.ndalloc", i, j,
+		    &ndalloc, uint64_t);
+		CTL_M2_M4_GET("stats.arenas.0.lextents.0.nrequests", i, j,
+		    &nrequests, uint64_t);
+		in_gap_prev = in_gap;
+		in_gap = (nrequests == 0);
+
+		if (in_gap_prev && !in_gap) {
+			emitter_table_printf(emitter,
+			    "                     ---\n");
+		}
+
+		CTL_M2_GET("arenas.lextent.0.size", j, &lextent_size, size_t);
+		CTL_M2_M4_GET("stats.arenas.0.lextents.0.curlextents", i, j,
+		    &curlextents, size_t);
+
+		emitter_json_arr_obj_begin(emitter);
+		emitter_json_kv(emitter, "curlextents", emitter_type_size,
+		    &curlextents);
+		emitter_json_arr_obj_end(emitter);
+
+		col_size.size_val = lextent_size;
+		col_ind.unsigned_val = nbins + j;
+		col_allocated.size_val = curlextents * lextent_size;
+		col_nmalloc.uint64_val = nmalloc;
+		col_ndalloc.uint64_val = ndalloc;
+		col_nrequests.uint64_val = nrequests;
+		col_curlextents.size_val = curlextents;
+
+		if (!in_gap) {
+			emitter_table_row(emitter, &row);
+		}
+	}
+	emitter_json_arr_end(emitter); /* Close "lextents". */
+	if (in_gap) {
+		emitter_table_printf(emitter, "                     ---\n");
+	}
+}
+
+static void
+stats_arena_mutexes_print(emitter_t *emitter, unsigned arena_ind) {
+	emitter_row_t row;
+	emitter_col_t col_name;
+	emitter_col_t col64[mutex_prof_num_uint64_t_counters];
+	emitter_col_t col32[mutex_prof_num_uint32_t_counters];
+
+	emitter_row_init(&row);
+	mutex_stats_init_cols(&row, "", &col_name, col64, col32);
+
+	emitter_json_dict_begin(emitter, "mutexes");
+	emitter_table_row(emitter, &row);
+
+	for (mutex_prof_arena_ind_t i = 0; i < mutex_prof_num_arena_mutexes;
+	    i++) {
+		const char *name = arena_mutex_names[i];
+		emitter_json_dict_begin(emitter, name);
+		mutex_stats_read_arena(arena_ind, i, name, &col_name, col64,
+		    col32);
+		mutex_stats_emit(emitter, &row, col64, col32);
+		emitter_json_dict_end(emitter); /* Close the mutex dict. */
+	}
+	emitter_json_dict_end(emitter); /* End "mutexes". */
+}
+
+static void
+stats_arena_print(emitter_t *emitter, unsigned i, bool bins, bool large,
+    bool mutex) {
+	unsigned nthreads;
+	const char *dss;
+	ssize_t dirty_decay_ms, muzzy_decay_ms;
+	size_t page, pactive, pdirty, pmuzzy, mapped, retained;
+	size_t base, internal, resident, metadata_thp;
+	uint64_t dirty_npurge, dirty_nmadvise, dirty_purged;
+	uint64_t muzzy_npurge, muzzy_nmadvise, muzzy_purged;
+	size_t small_allocated;
+	uint64_t small_nmalloc, small_ndalloc, small_nrequests;
+	size_t large_allocated;
+	uint64_t large_nmalloc, large_ndalloc, large_nrequests;
+	size_t tcache_bytes;
+	uint64_t uptime;
+
+	CTL_GET("arenas.page", &page, size_t);
+
+	CTL_M2_GET("stats.arenas.0.nthreads", i, &nthreads, unsigned);
+	emitter_kv(emitter, "nthreads", "assigned threads",
+	    emitter_type_unsigned, &nthreads);
+
+	CTL_M2_GET("stats.arenas.0.uptime", i, &uptime, uint64_t);
+	emitter_kv(emitter, "uptime_ns", "uptime", emitter_type_uint64,
+	    &uptime);
+
+	CTL_M2_GET("stats.arenas.0.dss", i, &dss, const char *);
+	emitter_kv(emitter, "dss", "dss allocation precedence",
+	    emitter_type_string, &dss);
+
+	CTL_M2_GET("stats.arenas.0.dirty_decay_ms", i, &dirty_decay_ms,
+	    ssize_t);
+	CTL_M2_GET("stats.arenas.0.muzzy_decay_ms", i, &muzzy_decay_ms,
+	    ssize_t);
+	CTL_M2_GET("stats.arenas.0.pactive", i, &pactive, size_t);
+	CTL_M2_GET("stats.arenas.0.pdirty", i, &pdirty, size_t);
+	CTL_M2_GET("stats.arenas.0.pmuzzy", i, &pmuzzy, size_t);
+	CTL_M2_GET("stats.arenas.0.dirty_npurge", i, &dirty_npurge, uint64_t);
+	CTL_M2_GET("stats.arenas.0.dirty_nmadvise", i, &dirty_nmadvise,
+	    uint64_t);
+	CTL_M2_GET("stats.arenas.0.dirty_purged", i, &dirty_purged, uint64_t);
+	CTL_M2_GET("stats.arenas.0.muzzy_npurge", i, &muzzy_npurge, uint64_t);
+	CTL_M2_GET("stats.arenas.0.muzzy_nmadvise", i, &muzzy_nmadvise,
+	    uint64_t);
+	CTL_M2_GET("stats.arenas.0.muzzy_purged", i, &muzzy_purged, uint64_t);
+
+	emitter_row_t decay_row;
+	emitter_row_init(&decay_row);
+
+	/* JSON-style emission. */
+	emitter_json_kv(emitter, "dirty_decay_ms", emitter_type_ssize,
+	    &dirty_decay_ms);
+	emitter_json_kv(emitter, "muzzy_decay_ms", emitter_type_ssize,
+	    &muzzy_decay_ms);
+
+	emitter_json_kv(emitter, "pactive", emitter_type_size, &pactive);
+	emitter_json_kv(emitter, "pdirty", emitter_type_size, &pdirty);
+	emitter_json_kv(emitter, "pmuzzy", emitter_type_size, &pmuzzy);
+
+	emitter_json_kv(emitter, "dirty_npurge", emitter_type_uint64,
+	    &dirty_npurge);
+	emitter_json_kv(emitter, "dirty_nmadvise", emitter_type_uint64,
+	    &dirty_nmadvise);
+	emitter_json_kv(emitter, "dirty_purged", emitter_type_uint64,
+	    &dirty_purged);
+
+	emitter_json_kv(emitter, "muzzy_npurge", emitter_type_uint64,
+	    &muzzy_npurge);
+	emitter_json_kv(emitter, "muzzy_nmadvise", emitter_type_uint64,
+	    &muzzy_nmadvise);
+	emitter_json_kv(emitter, "muzzy_purged", emitter_type_uint64,
+	    &muzzy_purged);
+
+	/* Table-style emission. */
+	emitter_col_t decay_type;
+	emitter_col_init(&decay_type, &decay_row);
+	decay_type.justify = emitter_justify_right;
+	decay_type.width = 9;
+	decay_type.type = emitter_type_title;
+	decay_type.str_val = "decaying:";
+
+	emitter_col_t decay_time;
+	emitter_col_init(&decay_time, &decay_row);
+	decay_time.justify = emitter_justify_right;
+	decay_time.width = 6;
+	decay_time.type = emitter_type_title;
+	decay_time.str_val = "time";
+
+	emitter_col_t decay_npages;
+	emitter_col_init(&decay_npages, &decay_row);
+	decay_npages.justify = emitter_justify_right;
+	decay_npages.width = 13;
+	decay_npages.type = emitter_type_title;
+	decay_npages.str_val = "npages";
+
+	emitter_col_t decay_sweeps;
+	emitter_col_init(&decay_sweeps, &decay_row);
+	decay_sweeps.justify = emitter_justify_right;
+	decay_sweeps.width = 13;
+	decay_sweeps.type = emitter_type_title;
+	decay_sweeps.str_val = "sweeps";
+
+	emitter_col_t decay_madvises;
+	emitter_col_init(&decay_madvises, &decay_row);
+	decay_madvises.justify = emitter_justify_right;
+	decay_madvises.width = 13;
+	decay_madvises.type = emitter_type_title;
+	decay_madvises.str_val = "madvises";
+
+	emitter_col_t decay_purged;
+	emitter_col_init(&decay_purged, &decay_row);
+	decay_purged.justify = emitter_justify_right;
+	decay_purged.width = 13;
+	decay_purged.type = emitter_type_title;
+	decay_purged.str_val = "purged";
+
+	/* Title row. */
+	emitter_table_row(emitter, &decay_row);
+
+	/* Dirty row. */
+	decay_type.str_val = "dirty:";
+
+	if (dirty_decay_ms >= 0) {
+		decay_time.type = emitter_type_ssize;
+		decay_time.ssize_val = dirty_decay_ms;
+	} else {
+		decay_time.type = emitter_type_title;
+		decay_time.str_val = "N/A";
+	}
+
+	decay_npages.type = emitter_type_size;
+	decay_npages.size_val = pdirty;
+
+	decay_sweeps.type = emitter_type_uint64;
+	decay_sweeps.uint64_val = dirty_npurge;
+
+	decay_madvises.type = emitter_type_uint64;
+	decay_madvises.uint64_val = dirty_nmadvise;
+
+	decay_purged.type = emitter_type_uint64;
+	decay_purged.uint64_val = dirty_purged;
+
+	emitter_table_row(emitter, &decay_row);
+
+	/* Muzzy row. */
+	decay_type.str_val = "muzzy:";
+
+	if (muzzy_decay_ms >= 0) {
+		decay_time.type = emitter_type_ssize;
+		decay_time.ssize_val = muzzy_decay_ms;
+	} else {
+		decay_time.type = emitter_type_title;
+		decay_time.str_val = "N/A";
+	}
+
+	decay_npages.type = emitter_type_size;
+	decay_npages.size_val = pmuzzy;
+
+	decay_sweeps.type = emitter_type_uint64;
+	decay_sweeps.uint64_val = muzzy_npurge;
+
+	decay_madvises.type = emitter_type_uint64;
+	decay_madvises.uint64_val = muzzy_nmadvise;
+
+	decay_purged.type = emitter_type_uint64;
+	decay_purged.uint64_val = muzzy_purged;
+
+	emitter_table_row(emitter, &decay_row);
+
+	/* Small / large / total allocation counts. */
+	emitter_row_t alloc_count_row;
+	emitter_row_init(&alloc_count_row);
+
+	emitter_col_t alloc_count_title;
+	emitter_col_init(&alloc_count_title, &alloc_count_row);
+	alloc_count_title.justify = emitter_justify_left;
+	alloc_count_title.width = 25;
+	alloc_count_title.type = emitter_type_title;
+	alloc_count_title.str_val = "";
+
+	emitter_col_t alloc_count_allocated;
+	emitter_col_init(&alloc_count_allocated, &alloc_count_row);
+	alloc_count_allocated.justify = emitter_justify_right;
+	alloc_count_allocated.width = 12;
+	alloc_count_allocated.type = emitter_type_title;
+	alloc_count_allocated.str_val = "allocated";
+
+	emitter_col_t alloc_count_nmalloc;
+	emitter_col_init(&alloc_count_nmalloc, &alloc_count_row);
+	alloc_count_nmalloc.justify = emitter_justify_right;
+	alloc_count_nmalloc.width = 12;
+	alloc_count_nmalloc.type = emitter_type_title;
+	alloc_count_nmalloc.str_val = "nmalloc";
+
+	emitter_col_t alloc_count_ndalloc;
+	emitter_col_init(&alloc_count_ndalloc, &alloc_count_row);
+	alloc_count_ndalloc.justify = emitter_justify_right;
+	alloc_count_ndalloc.width = 12;
+	alloc_count_ndalloc.type = emitter_type_title;
+	alloc_count_ndalloc.str_val = "ndalloc";
+
+	emitter_col_t alloc_count_nrequests;
+	emitter_col_init(&alloc_count_nrequests, &alloc_count_row);
+	alloc_count_nrequests.justify = emitter_justify_right;
+	alloc_count_nrequests.width = 12;
+	alloc_count_nrequests.type = emitter_type_title;
+	alloc_count_nrequests.str_val = "nrequests";
+
+	emitter_table_row(emitter, &alloc_count_row);
+
+#define GET_AND_EMIT_ALLOC_STAT(small_or_large, name, valtype)		\
+	CTL_M2_GET("stats.arenas.0." #small_or_large "." #name, i,	\
+	    &small_or_large##_##name, valtype##_t);			\
+	emitter_json_kv(emitter, #name, emitter_type_##valtype,		\
+	    &small_or_large##_##name);					\
+	alloc_count_##name.type = emitter_type_##valtype;		\
+	alloc_count_##name.valtype##_val = small_or_large##_##name;
+
+	emitter_json_dict_begin(emitter, "small");
+	alloc_count_title.str_val = "small:";
+
+	GET_AND_EMIT_ALLOC_STAT(small, allocated, size)
+	GET_AND_EMIT_ALLOC_STAT(small, nmalloc, uint64)
+	GET_AND_EMIT_ALLOC_STAT(small, ndalloc, uint64)
+	GET_AND_EMIT_ALLOC_STAT(small, nrequests, uint64)
+
+	emitter_table_row(emitter, &alloc_count_row);
+	emitter_json_dict_end(emitter); /* Close "small". */
+
+	emitter_json_dict_begin(emitter, "large");
+	alloc_count_title.str_val = "large:";
+
+	GET_AND_EMIT_ALLOC_STAT(large, allocated, size)
+	GET_AND_EMIT_ALLOC_STAT(large, nmalloc, uint64)
+	GET_AND_EMIT_ALLOC_STAT(large, ndalloc, uint64)
+	GET_AND_EMIT_ALLOC_STAT(large, nrequests, uint64)
+
+	emitter_table_row(emitter, &alloc_count_row);
+	emitter_json_dict_end(emitter); /* Close "large". */
+
+#undef GET_AND_EMIT_ALLOC_STAT
+
+	/* Aggregated small + large stats are emitter only in table mode. */
+	alloc_count_title.str_val = "total:";
+	alloc_count_allocated.size_val = small_allocated + large_allocated;
+	alloc_count_nmalloc.uint64_val = small_nmalloc + large_nmalloc;
+	alloc_count_ndalloc.uint64_val = small_ndalloc + large_ndalloc;
+	alloc_count_nrequests.uint64_val = small_nrequests + large_nrequests;
+	emitter_table_row(emitter, &alloc_count_row);
+
+	emitter_row_t mem_count_row;
+	emitter_row_init(&mem_count_row);
+
+	emitter_col_t mem_count_title;
+	emitter_col_init(&mem_count_title, &mem_count_row);
+	mem_count_title.justify = emitter_justify_left;
+	mem_count_title.width = 25;
+	mem_count_title.type = emitter_type_title;
+	mem_count_title.str_val = "";
+
+	emitter_col_t mem_count_val;
+	emitter_col_init(&mem_count_val, &mem_count_row);
+	mem_count_val.justify = emitter_justify_right;
+	mem_count_val.width = 12;
+	mem_count_val.type = emitter_type_title;
+	mem_count_val.str_val = "";
+
+	emitter_table_row(emitter, &mem_count_row);
+	mem_count_val.type = emitter_type_size;
+
+	/* Active count in bytes is emitted only in table mode. */
+	mem_count_title.str_val = "active:";
+	mem_count_val.size_val = pactive * page;
+	emitter_table_row(emitter, &mem_count_row);
+
+#define GET_AND_EMIT_MEM_STAT(stat)					\
+	CTL_M2_GET("stats.arenas.0."#stat, i, &stat, size_t);		\
+	emitter_json_kv(emitter, #stat, emitter_type_size, &stat);	\
+	mem_count_title.str_val = #stat":";				\
+	mem_count_val.size_val = stat;					\
+	emitter_table_row(emitter, &mem_count_row);
+
+	GET_AND_EMIT_MEM_STAT(mapped)
+	GET_AND_EMIT_MEM_STAT(retained)
+	GET_AND_EMIT_MEM_STAT(base)
+	GET_AND_EMIT_MEM_STAT(internal)
+	GET_AND_EMIT_MEM_STAT(metadata_thp)
+	GET_AND_EMIT_MEM_STAT(tcache_bytes)
+	GET_AND_EMIT_MEM_STAT(resident)
+#undef GET_AND_EMIT_MEM_STAT
+
+	if (mutex) {
+		stats_arena_mutexes_print(emitter, i);
+	}
+	if (bins) {
+		stats_arena_bins_print(emitter, mutex, i);
+	}
+	if (large) {
+		stats_arena_lextents_print(emitter, i);
+	}
+}
+
+static void
+stats_general_print(emitter_t *emitter) {
+	const char *cpv;
+	bool bv, bv2;
+	unsigned uv;
+	uint32_t u32v;
+	uint64_t u64v;
+	ssize_t ssv, ssv2;
+	size_t sv, bsz, usz, ssz, sssz, cpsz;
+
+	bsz = sizeof(bool);
+	usz = sizeof(unsigned);
+	ssz = sizeof(size_t);
+	sssz = sizeof(ssize_t);
+	cpsz = sizeof(const char *);
+
+	CTL_GET("version", &cpv, const char *);
+	emitter_kv(emitter, "version", "Version", emitter_type_string, &cpv);
+
+	/* config. */
+	emitter_dict_begin(emitter, "config", "Build-time option settings");
+#define CONFIG_WRITE_BOOL(name)						\
+	do {								\
+		CTL_GET("config."#name, &bv, bool);			\
+		emitter_kv(emitter, #name, "config."#name,		\
+		    emitter_type_bool, &bv);				\
+	} while (0)
+
+	CONFIG_WRITE_BOOL(cache_oblivious);
+	CONFIG_WRITE_BOOL(debug);
+	CONFIG_WRITE_BOOL(fill);
+	CONFIG_WRITE_BOOL(lazy_lock);
+	emitter_kv(emitter, "malloc_conf", "config.malloc_conf",
+	    emitter_type_string, &config_malloc_conf);
+
+	CONFIG_WRITE_BOOL(prof);
+	CONFIG_WRITE_BOOL(prof_libgcc);
+	CONFIG_WRITE_BOOL(prof_libunwind);
+	CONFIG_WRITE_BOOL(stats);
+	CONFIG_WRITE_BOOL(utrace);
+	CONFIG_WRITE_BOOL(xmalloc);
+#undef CONFIG_WRITE_BOOL
+	emitter_dict_end(emitter); /* Close "config" dict. */
+
+	/* opt. */
+#define OPT_WRITE(name, var, size, emitter_type)			\
+	if (je_mallctl("opt."name, (void *)&var, &size, NULL, 0) ==	\
+	    0) {							\
+		emitter_kv(emitter, name, "opt."name, emitter_type,	\
+		    &var);						\
+	}
+
+#define OPT_WRITE_MUTABLE(name, var1, var2, size, emitter_type,		\
+    altname)								\
+	if (je_mallctl("opt."name, (void *)&var1, &size, NULL, 0) ==	\
+	    0 && je_mallctl(altname, (void *)&var2, &size, NULL, 0)	\
+	    == 0) {							\
+		emitter_kv_note(emitter, name, "opt."name,		\
+		    emitter_type, &var1, altname, emitter_type,		\
+		    &var2);						\
+	}
+
+#define OPT_WRITE_BOOL(name) OPT_WRITE(name, bv, bsz, emitter_type_bool)
+#define OPT_WRITE_BOOL_MUTABLE(name, altname)				\
+	OPT_WRITE_MUTABLE(name, bv, bv2, bsz, emitter_type_bool, altname)
+
+#define OPT_WRITE_UNSIGNED(name)					\
+	OPT_WRITE(name, uv, usz, emitter_type_unsigned)
+
+#define OPT_WRITE_SSIZE_T(name)						\
+	OPT_WRITE(name, ssv, sssz, emitter_type_ssize)
+#define OPT_WRITE_SSIZE_T_MUTABLE(name, altname)			\
+	OPT_WRITE_MUTABLE(name, ssv, ssv2, sssz, emitter_type_ssize,	\
+	    altname)
+
+#define OPT_WRITE_CHAR_P(name)						\
+	OPT_WRITE(name, cpv, cpsz, emitter_type_string)
+
+	emitter_dict_begin(emitter, "opt", "Run-time option settings");
+
+	OPT_WRITE_BOOL("abort")
+	OPT_WRITE_BOOL("abort_conf")
+	OPT_WRITE_BOOL("retain")
+	OPT_WRITE_CHAR_P("dss")
+	OPT_WRITE_UNSIGNED("narenas")
+	OPT_WRITE_CHAR_P("percpu_arena")
+	OPT_WRITE_CHAR_P("metadata_thp")
+	OPT_WRITE_BOOL_MUTABLE("background_thread", "background_thread")
+	OPT_WRITE_SSIZE_T_MUTABLE("dirty_decay_ms", "arenas.dirty_decay_ms")
+	OPT_WRITE_SSIZE_T_MUTABLE("muzzy_decay_ms", "arenas.muzzy_decay_ms")
+	OPT_WRITE_UNSIGNED("lg_extent_max_active_fit")
+	OPT_WRITE_CHAR_P("junk")
+	OPT_WRITE_BOOL("zero")
+	OPT_WRITE_BOOL("utrace")
+	OPT_WRITE_BOOL("xmalloc")
+	OPT_WRITE_BOOL("tcache")
+	OPT_WRITE_SSIZE_T("lg_tcache_max")
+	OPT_WRITE_CHAR_P("thp")
+	OPT_WRITE_BOOL("prof")
+	OPT_WRITE_CHAR_P("prof_prefix")
+	OPT_WRITE_BOOL_MUTABLE("prof_active", "prof.active")
+	OPT_WRITE_BOOL_MUTABLE("prof_thread_active_init",
+	    "prof.thread_active_init")
+	OPT_WRITE_SSIZE_T_MUTABLE("lg_prof_sample", "prof.lg_sample")
+	OPT_WRITE_BOOL("prof_accum")
+	OPT_WRITE_SSIZE_T("lg_prof_interval")
+	OPT_WRITE_BOOL("prof_gdump")
+	OPT_WRITE_BOOL("prof_final")
+	OPT_WRITE_BOOL("prof_leak")
+	OPT_WRITE_BOOL("stats_print")
+	OPT_WRITE_CHAR_P("stats_print_opts")
+
+	emitter_dict_end(emitter);
+
+#undef OPT_WRITE
+#undef OPT_WRITE_MUTABLE
+#undef OPT_WRITE_BOOL
+#undef OPT_WRITE_BOOL_MUTABLE
+#undef OPT_WRITE_UNSIGNED
+#undef OPT_WRITE_SSIZE_T
+#undef OPT_WRITE_SSIZE_T_MUTABLE
+#undef OPT_WRITE_CHAR_P
+
+	/* prof. */
+	if (config_prof) {
+		emitter_dict_begin(emitter, "prof", "Profiling settings");
+
+		CTL_GET("prof.thread_active_init", &bv, bool);
+		emitter_kv(emitter, "thread_active_init",
+		    "prof.thread_active_init", emitter_type_bool, &bv);
+
+		CTL_GET("prof.active", &bv, bool);
+		emitter_kv(emitter, "active", "prof.active", emitter_type_bool,
+		    &bv);
+
+		CTL_GET("prof.gdump", &bv, bool);
+		emitter_kv(emitter, "gdump", "prof.gdump", emitter_type_bool,
+		    &bv);
+
+		CTL_GET("prof.interval", &u64v, uint64_t);
+		emitter_kv(emitter, "interval", "prof.interval",
+		    emitter_type_uint64, &u64v);
+
+		CTL_GET("prof.lg_sample", &ssv, ssize_t);
+		emitter_kv(emitter, "lg_sample", "prof.lg_sample",
+		    emitter_type_ssize, &ssv);
+
+		emitter_dict_end(emitter); /* Close "prof". */
+	}
+
+	/* arenas. */
+	/*
+	 * The json output sticks arena info into an "arenas" dict; the table
+	 * output puts them at the top-level.
+	 */
+	emitter_json_dict_begin(emitter, "arenas");
+
+	CTL_GET("arenas.narenas", &uv, unsigned);
+	emitter_kv(emitter, "narenas", "Arenas", emitter_type_unsigned, &uv);
+
+	/*
+	 * Decay settings are emitted only in json mode; in table mode, they're
+	 * emitted as notes with the opt output, above.
+	 */
+	CTL_GET("arenas.dirty_decay_ms", &ssv, ssize_t);
+	emitter_json_kv(emitter, "dirty_decay_ms", emitter_type_ssize, &ssv);
+
+	CTL_GET("arenas.muzzy_decay_ms", &ssv, ssize_t);
+	emitter_json_kv(emitter, "muzzy_decay_ms", emitter_type_ssize, &ssv);
+
+	CTL_GET("arenas.quantum", &sv, size_t);
+	emitter_kv(emitter, "quantum", "Quantum size", emitter_type_size, &sv);
+
+	CTL_GET("arenas.page", &sv, size_t);
+	emitter_kv(emitter, "page", "Page size", emitter_type_size, &sv);
+
+	if (je_mallctl("arenas.tcache_max", (void *)&sv, &ssz, NULL, 0) == 0) {
+		emitter_kv(emitter, "tcache_max",
+		    "Maximum thread-cached size class", emitter_type_size, &sv);
+	}
+
+	unsigned nbins;
+	CTL_GET("arenas.nbins", &nbins, unsigned);
+	emitter_kv(emitter, "nbins", "Number of bin size classes",
+	    emitter_type_unsigned, &nbins);
+
+	unsigned nhbins;
+	CTL_GET("arenas.nhbins", &nhbins, unsigned);
+	emitter_kv(emitter, "nhbins", "Number of thread-cache bin size classes",
+	    emitter_type_unsigned, &nhbins);
+
+	/*
+	 * We do enough mallctls in a loop that we actually want to omit them
+	 * (not just omit the printing).
+	 */
+	if (emitter->output == emitter_output_json) {
+		emitter_json_arr_begin(emitter, "bin");
+		for (unsigned i = 0; i < nbins; i++) {
+			emitter_json_arr_obj_begin(emitter);
+
+			CTL_M2_GET("arenas.bin.0.size", i, &sv, size_t);
+			emitter_json_kv(emitter, "size", emitter_type_size,
+			    &sv);
+
+			CTL_M2_GET("arenas.bin.0.nregs", i, &u32v, uint32_t);
+			emitter_json_kv(emitter, "nregs", emitter_type_uint32,
+			    &u32v);
+
+			CTL_M2_GET("arenas.bin.0.slab_size", i, &sv, size_t);
+			emitter_json_kv(emitter, "slab_size", emitter_type_size,
+			    &sv);
+
+			emitter_json_arr_obj_end(emitter);
+		}
+		emitter_json_arr_end(emitter); /* Close "bin". */
+	}
+
+	unsigned nlextents;
+	CTL_GET("arenas.nlextents", &nlextents, unsigned);
+	emitter_kv(emitter, "nlextents", "Number of large size classes",
+	    emitter_type_unsigned, &nlextents);
+
+	if (emitter->output == emitter_output_json) {
+		emitter_json_arr_begin(emitter, "lextent");
+		for (unsigned i = 0; i < nlextents; i++) {
+			emitter_json_arr_obj_begin(emitter);
+
+			CTL_M2_GET("arenas.lextent.0.size", i, &sv, size_t);
+			emitter_json_kv(emitter, "size", emitter_type_size,
+			    &sv);
+
+			emitter_json_arr_obj_end(emitter);
+		}
+		emitter_json_arr_end(emitter); /* Close "lextent". */
+	}
+
+	emitter_json_dict_end(emitter); /* Close "arenas" */
+}
+
+static void
+stats_print_helper(emitter_t *emitter, bool merged, bool destroyed,
+    bool unmerged, bool bins, bool large, bool mutex) {
+	/*
+	 * These should be deleted.  We keep them around for a while, to aid in
+	 * the transition to the emitter code.
+	 */
+	size_t allocated, active, metadata, metadata_thp, resident, mapped,
+	    retained;
+	size_t num_background_threads;
+	uint64_t background_thread_num_runs, background_thread_run_interval;
+
+	CTL_GET("stats.allocated", &allocated, size_t);
+	CTL_GET("stats.active", &active, size_t);
+	CTL_GET("stats.metadata", &metadata, size_t);
+	CTL_GET("stats.metadata_thp", &metadata_thp, size_t);
+	CTL_GET("stats.resident", &resident, size_t);
+	CTL_GET("stats.mapped", &mapped, size_t);
+	CTL_GET("stats.retained", &retained, size_t);
+
+	if (have_background_thread) {
+		CTL_GET("stats.background_thread.num_threads",
+		    &num_background_threads, size_t);
+		CTL_GET("stats.background_thread.num_runs",
+		    &background_thread_num_runs, uint64_t);
+		CTL_GET("stats.background_thread.run_interval",
+		    &background_thread_run_interval, uint64_t);
+	} else {
+		num_background_threads = 0;
+		background_thread_num_runs = 0;
+		background_thread_run_interval = 0;
+	}
+
+	/* Generic global stats. */
+	emitter_json_dict_begin(emitter, "stats");
+	emitter_json_kv(emitter, "allocated", emitter_type_size, &allocated);
+	emitter_json_kv(emitter, "active", emitter_type_size, &active);
+	emitter_json_kv(emitter, "metadata", emitter_type_size, &metadata);
+	emitter_json_kv(emitter, "metadata_thp", emitter_type_size,
+	    &metadata_thp);
+	emitter_json_kv(emitter, "resident", emitter_type_size, &resident);
+	emitter_json_kv(emitter, "mapped", emitter_type_size, &mapped);
+	emitter_json_kv(emitter, "retained", emitter_type_size, &retained);
+
+	emitter_table_printf(emitter, "Allocated: %zu, active: %zu, "
+	    "metadata: %zu (n_thp %zu), resident: %zu, mapped: %zu, "
+	    "retained: %zu\n", allocated, active, metadata, metadata_thp,
+	    resident, mapped, retained);
+
+	/* Background thread stats. */
+	emitter_json_dict_begin(emitter, "background_thread");
+	emitter_json_kv(emitter, "num_threads", emitter_type_size,
+	    &num_background_threads);
+	emitter_json_kv(emitter, "num_runs", emitter_type_uint64,
+	    &background_thread_num_runs);
+	emitter_json_kv(emitter, "run_interval", emitter_type_uint64,
+	    &background_thread_run_interval);
+	emitter_json_dict_end(emitter); /* Close "background_thread". */
+
+	emitter_table_printf(emitter, "Background threads: %zu, "
+	    "num_runs: %"FMTu64", run_interval: %"FMTu64" ns\n",
+	    num_background_threads, background_thread_num_runs,
+	    background_thread_run_interval);
+
+	if (mutex) {
+		emitter_row_t row;
+		emitter_col_t name;
+		emitter_col_t col64[mutex_prof_num_uint64_t_counters];
+		emitter_col_t col32[mutex_prof_num_uint32_t_counters];
+
+		emitter_row_init(&row);
+		mutex_stats_init_cols(&row, "", &name, col64, col32);
+
+		emitter_table_row(emitter, &row);
+		emitter_json_dict_begin(emitter, "mutexes");
+
+		for (int i = 0; i < mutex_prof_num_global_mutexes; i++) {
+			mutex_stats_read_global(global_mutex_names[i], &name,
+			    col64, col32);
+			emitter_json_dict_begin(emitter, global_mutex_names[i]);
+			mutex_stats_emit(emitter, &row, col64, col32);
+			emitter_json_dict_end(emitter);
+		}
+
+		emitter_json_dict_end(emitter); /* Close "mutexes". */
+	}
+
+	emitter_json_dict_end(emitter); /* Close "stats". */
+
+	if (merged || destroyed || unmerged) {
+		unsigned narenas;
+
+		emitter_json_dict_begin(emitter, "stats.arenas");
+
+		CTL_GET("arenas.narenas", &narenas, unsigned);
+		size_t mib[3];
+		size_t miblen = sizeof(mib) / sizeof(size_t);
+		size_t sz;
+		VARIABLE_ARRAY(bool, initialized, narenas);
+		bool destroyed_initialized;
+		unsigned i, j, ninitialized;
+
+		xmallctlnametomib("arena.0.initialized", mib, &miblen);
+		for (i = ninitialized = 0; i < narenas; i++) {
+			mib[1] = i;
+			sz = sizeof(bool);
+			xmallctlbymib(mib, miblen, &initialized[i], &sz,
+			    NULL, 0);
+			if (initialized[i]) {
+				ninitialized++;
+			}
+		}
+		mib[1] = MALLCTL_ARENAS_DESTROYED;
+		sz = sizeof(bool);
+		xmallctlbymib(mib, miblen, &destroyed_initialized, &sz,
+		    NULL, 0);
+
+		/* Merged stats. */
+		if (merged && (ninitialized > 1 || !unmerged)) {
+			/* Print merged arena stats. */
+			emitter_table_printf(emitter, "Merged arenas stats:\n");
+			emitter_json_dict_begin(emitter, "merged");
+			stats_arena_print(emitter, MALLCTL_ARENAS_ALL, bins,
+			    large, mutex);
+			emitter_json_dict_end(emitter); /* Close "merged". */
+		}
+
+		/* Destroyed stats. */
+		if (destroyed_initialized && destroyed) {
+			/* Print destroyed arena stats. */
+			emitter_table_printf(emitter,
+			    "Destroyed arenas stats:\n");
+			emitter_json_dict_begin(emitter, "destroyed");
+			stats_arena_print(emitter, MALLCTL_ARENAS_DESTROYED,
+			    bins, large, mutex);
+			emitter_json_dict_end(emitter); /* Close "destroyed". */
+		}
+
+		/* Unmerged stats. */
+		if (unmerged) {
+			for (i = j = 0; i < narenas; i++) {
+				if (initialized[i]) {
+					char arena_ind_str[20];
+					malloc_snprintf(arena_ind_str,
+					    sizeof(arena_ind_str), "%u", i);
+					emitter_json_dict_begin(emitter,
+					    arena_ind_str);
+					emitter_table_printf(emitter,
+					    "arenas[%s]:\n", arena_ind_str);
+					stats_arena_print(emitter, i, bins,
+					    large, mutex);
+					/* Close "<arena-ind>". */
+					emitter_json_dict_end(emitter);
+				}
+			}
+		}
+		emitter_json_dict_end(emitter); /* Close "stats.arenas". */
+	}
+}
+
+void
+stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
+    const char *opts) {
+	int err;
+	uint64_t epoch;
+	size_t u64sz;
+#define OPTION(o, v, d, s) bool v = d;
+	STATS_PRINT_OPTIONS
+#undef OPTION
+
+	/*
+	 * Refresh stats, in case mallctl() was called by the application.
+	 *
+	 * Check for OOM here, since refreshing the ctl cache can trigger
+	 * allocation.  In practice, none of the subsequent mallctl()-related
+	 * calls in this function will cause OOM if this one succeeds.
+	 * */
+	epoch = 1;
+	u64sz = sizeof(uint64_t);
+	err = je_mallctl("epoch", (void *)&epoch, &u64sz, (void *)&epoch,
+	    sizeof(uint64_t));
+	if (err != 0) {
+		if (err == EAGAIN) {
+			malloc_write("<jemalloc>: Memory allocation failure in "
+			    "mallctl(\"epoch\", ...)\n");
+			return;
+		}
+		malloc_write("<jemalloc>: Failure in mallctl(\"epoch\", "
+		    "...)\n");
+		abort();
+	}
+
+	if (opts != NULL) {
+		for (unsigned i = 0; opts[i] != '\0'; i++) {
+			switch (opts[i]) {
+#define OPTION(o, v, d, s) case o: v = s; break;
+				STATS_PRINT_OPTIONS
+#undef OPTION
+			default:;
+			}
+		}
+	}
+
+	emitter_t emitter;
+	emitter_init(&emitter,
+	    json ? emitter_output_json : emitter_output_table, write_cb,
+	    cbopaque);
+	emitter_begin(&emitter);
+	emitter_table_printf(&emitter, "___ Begin jemalloc statistics ___\n");
+	emitter_json_dict_begin(&emitter, "jemalloc");
+
+	if (general) {
+		stats_general_print(&emitter);
+	}
+	if (config_stats) {
+		stats_print_helper(&emitter, merged, destroyed, unmerged,
+		    bins, large, mutex);
+	}
+
+	emitter_json_dict_end(&emitter); /* Closes the "jemalloc" dict. */
+	emitter_table_printf(&emitter, "--- End jemalloc statistics ---\n");
+	emitter_end(&emitter);
+}
diff --git a/redis-stable/deps/jemalloc/src/sz.c b/redis-stable/deps/jemalloc/src/sz.c
new file mode 100644
index 00000000..9de77e45
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/sz.c
@@ -0,0 +1,107 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/sz.h"
+
+JEMALLOC_ALIGNED(CACHELINE)
+const size_t sz_pind2sz_tab[NPSIZES+1] = {
+#define PSZ_yes(lg_grp, ndelta, lg_delta)				\
+	(((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta))),
+#define PSZ_no(lg_grp, ndelta, lg_delta)
+#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
+	PSZ_##psz(lg_grp, ndelta, lg_delta)
+	SIZE_CLASSES
+#undef PSZ_yes
+#undef PSZ_no
+#undef SC
+	(LARGE_MAXCLASS + PAGE)
+};
+
+JEMALLOC_ALIGNED(CACHELINE)
+const size_t sz_index2size_tab[NSIZES] = {
+#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
+	((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)),
+	SIZE_CLASSES
+#undef SC
+};
+
+JEMALLOC_ALIGNED(CACHELINE)
+const uint8_t sz_size2index_tab[] = {
+#if LG_TINY_MIN == 0
+/* The div module doesn't support division by 1. */
+#error "Unsupported LG_TINY_MIN"
+#define S2B_0(i)	i,
+#elif LG_TINY_MIN == 1
+#warning "Dangerous LG_TINY_MIN"
+#define S2B_1(i)	i,
+#elif LG_TINY_MIN == 2
+#warning "Dangerous LG_TINY_MIN"
+#define S2B_2(i)	i,
+#elif LG_TINY_MIN == 3
+#define S2B_3(i)	i,
+#elif LG_TINY_MIN == 4
+#define S2B_4(i)	i,
+#elif LG_TINY_MIN == 5
+#define S2B_5(i)	i,
+#elif LG_TINY_MIN == 6
+#define S2B_6(i)	i,
+#elif LG_TINY_MIN == 7
+#define S2B_7(i)	i,
+#elif LG_TINY_MIN == 8
+#define S2B_8(i)	i,
+#elif LG_TINY_MIN == 9
+#define S2B_9(i)	i,
+#elif LG_TINY_MIN == 10
+#define S2B_10(i)	i,
+#elif LG_TINY_MIN == 11
+#define S2B_11(i)	i,
+#else
+#error "Unsupported LG_TINY_MIN"
+#endif
+#if LG_TINY_MIN < 1
+#define S2B_1(i)	S2B_0(i) S2B_0(i)
+#endif
+#if LG_TINY_MIN < 2
+#define S2B_2(i)	S2B_1(i) S2B_1(i)
+#endif
+#if LG_TINY_MIN < 3
+#define S2B_3(i)	S2B_2(i) S2B_2(i)
+#endif
+#if LG_TINY_MIN < 4
+#define S2B_4(i)	S2B_3(i) S2B_3(i)
+#endif
+#if LG_TINY_MIN < 5
+#define S2B_5(i)	S2B_4(i) S2B_4(i)
+#endif
+#if LG_TINY_MIN < 6
+#define S2B_6(i)	S2B_5(i) S2B_5(i)
+#endif
+#if LG_TINY_MIN < 7
+#define S2B_7(i)	S2B_6(i) S2B_6(i)
+#endif
+#if LG_TINY_MIN < 8
+#define S2B_8(i)	S2B_7(i) S2B_7(i)
+#endif
+#if LG_TINY_MIN < 9
+#define S2B_9(i)	S2B_8(i) S2B_8(i)
+#endif
+#if LG_TINY_MIN < 10
+#define S2B_10(i)	S2B_9(i) S2B_9(i)
+#endif
+#if LG_TINY_MIN < 11
+#define S2B_11(i)	S2B_10(i) S2B_10(i)
+#endif
+#define S2B_no(i)
+#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
+	S2B_##lg_delta_lookup(index)
+	SIZE_CLASSES
+#undef S2B_3
+#undef S2B_4
+#undef S2B_5
+#undef S2B_6
+#undef S2B_7
+#undef S2B_8
+#undef S2B_9
+#undef S2B_10
+#undef S2B_11
+#undef S2B_no
+#undef SC
+};
diff --git a/redis-stable/deps/jemalloc/src/tcache.c b/redis-stable/deps/jemalloc/src/tcache.c
new file mode 100644
index 00000000..a769a6b1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/tcache.c
@@ -0,0 +1,717 @@
+#define JEMALLOC_TCACHE_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/size_classes.h"
+
+/******************************************************************************/
+/* Data. */
+
+bool	opt_tcache = true;
+ssize_t	opt_lg_tcache_max = LG_TCACHE_MAXCLASS_DEFAULT;
+
+cache_bin_info_t	*tcache_bin_info;
+static unsigned		stack_nelms; /* Total stack elms per tcache. */
+
+unsigned		nhbins;
+size_t			tcache_maxclass;
+
+tcaches_t		*tcaches;
+
+/* Index of first element within tcaches that has never been used. */
+static unsigned		tcaches_past;
+
+/* Head of singly linked list tracking available tcaches elements. */
+static tcaches_t	*tcaches_avail;
+
+/* Protects tcaches{,_past,_avail}. */
+static malloc_mutex_t	tcaches_mtx;
+
+/******************************************************************************/
+
+size_t
+tcache_salloc(tsdn_t *tsdn, const void *ptr) {
+	return arena_salloc(tsdn, ptr);
+}
+
+void
+tcache_event_hard(tsd_t *tsd, tcache_t *tcache) {
+	szind_t binind = tcache->next_gc_bin;
+
+	cache_bin_t *tbin;
+	if (binind < NBINS) {
+		tbin = tcache_small_bin_get(tcache, binind);
+	} else {
+		tbin = tcache_large_bin_get(tcache, binind);
+	}
+	if (tbin->low_water > 0) {
+		/*
+		 * Flush (ceiling) 3/4 of the objects below the low water mark.
+		 */
+		if (binind < NBINS) {
+			tcache_bin_flush_small(tsd, tcache, tbin, binind,
+			    tbin->ncached - tbin->low_water + (tbin->low_water
+			    >> 2));
+			/*
+			 * Reduce fill count by 2X.  Limit lg_fill_div such that
+			 * the fill count is always at least 1.
+			 */
+			cache_bin_info_t *tbin_info = &tcache_bin_info[binind];
+			if ((tbin_info->ncached_max >>
+			     (tcache->lg_fill_div[binind] + 1)) >= 1) {
+				tcache->lg_fill_div[binind]++;
+			}
+		} else {
+			tcache_bin_flush_large(tsd, tbin, binind, tbin->ncached
+			    - tbin->low_water + (tbin->low_water >> 2), tcache);
+		}
+	} else if (tbin->low_water < 0) {
+		/*
+		 * Increase fill count by 2X for small bins.  Make sure
+		 * lg_fill_div stays greater than 0.
+		 */
+		if (binind < NBINS && tcache->lg_fill_div[binind] > 1) {
+			tcache->lg_fill_div[binind]--;
+		}
+	}
+	tbin->low_water = tbin->ncached;
+
+	tcache->next_gc_bin++;
+	if (tcache->next_gc_bin == nhbins) {
+		tcache->next_gc_bin = 0;
+	}
+}
+
+void *
+tcache_alloc_small_hard(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
+    cache_bin_t *tbin, szind_t binind, bool *tcache_success) {
+	void *ret;
+
+	assert(tcache->arena != NULL);
+	arena_tcache_fill_small(tsdn, arena, tcache, tbin, binind,
+	    config_prof ? tcache->prof_accumbytes : 0);
+	if (config_prof) {
+		tcache->prof_accumbytes = 0;
+	}
+	ret = cache_bin_alloc_easy(tbin, tcache_success);
+
+	return ret;
+}
+
+void
+tcache_bin_flush_small(tsd_t *tsd, tcache_t *tcache, cache_bin_t *tbin,
+    szind_t binind, unsigned rem) {
+	bool merged_stats = false;
+
+	assert(binind < NBINS);
+	assert((cache_bin_sz_t)rem <= tbin->ncached);
+
+	arena_t *arena = tcache->arena;
+	assert(arena != NULL);
+	unsigned nflush = tbin->ncached - rem;
+	VARIABLE_ARRAY(extent_t *, item_extent, nflush);
+	/* Look up extent once per item. */
+	for (unsigned i = 0 ; i < nflush; i++) {
+		item_extent[i] = iealloc(tsd_tsdn(tsd), *(tbin->avail - 1 - i));
+	}
+
+	while (nflush > 0) {
+		/* Lock the arena bin associated with the first object. */
+		extent_t *extent = item_extent[0];
+		arena_t *bin_arena = extent_arena_get(extent);
+		bin_t *bin = &bin_arena->bins[binind];
+
+		if (config_prof && bin_arena == arena) {
+			if (arena_prof_accum(tsd_tsdn(tsd), arena,
+			    tcache->prof_accumbytes)) {
+				prof_idump(tsd_tsdn(tsd));
+			}
+			tcache->prof_accumbytes = 0;
+		}
+
+		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		if (config_stats && bin_arena == arena) {
+			assert(!merged_stats);
+			merged_stats = true;
+			bin->stats.nflushes++;
+			bin->stats.nrequests += tbin->tstats.nrequests;
+			tbin->tstats.nrequests = 0;
+		}
+		unsigned ndeferred = 0;
+		for (unsigned i = 0; i < nflush; i++) {
+			void *ptr = *(tbin->avail - 1 - i);
+			extent = item_extent[i];
+			assert(ptr != NULL && extent != NULL);
+
+			if (extent_arena_get(extent) == bin_arena) {
+				arena_dalloc_bin_junked_locked(tsd_tsdn(tsd),
+				    bin_arena, extent, ptr);
+			} else {
+				/*
+				 * This object was allocated via a different
+				 * arena bin than the one that is currently
+				 * locked.  Stash the object, so that it can be
+				 * handled in a future pass.
+				 */
+				*(tbin->avail - 1 - ndeferred) = ptr;
+				item_extent[ndeferred] = extent;
+				ndeferred++;
+			}
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+		arena_decay_ticks(tsd_tsdn(tsd), bin_arena, nflush - ndeferred);
+		nflush = ndeferred;
+	}
+	if (config_stats && !merged_stats) {
+		/*
+		 * The flush loop didn't happen to flush to this thread's
+		 * arena, so the stats didn't get merged.  Manually do so now.
+		 */
+		bin_t *bin = &arena->bins[binind];
+		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
+		bin->stats.nflushes++;
+		bin->stats.nrequests += tbin->tstats.nrequests;
+		tbin->tstats.nrequests = 0;
+		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
+	}
+
+	memmove(tbin->avail - rem, tbin->avail - tbin->ncached, rem *
+	    sizeof(void *));
+	tbin->ncached = rem;
+	if (tbin->ncached < tbin->low_water) {
+		tbin->low_water = tbin->ncached;
+	}
+}
+
+void
+tcache_bin_flush_large(tsd_t *tsd, cache_bin_t *tbin, szind_t binind,
+    unsigned rem, tcache_t *tcache) {
+	bool merged_stats = false;
+
+	assert(binind < nhbins);
+	assert((cache_bin_sz_t)rem <= tbin->ncached);
+
+	arena_t *arena = tcache->arena;
+	assert(arena != NULL);
+	unsigned nflush = tbin->ncached - rem;
+	VARIABLE_ARRAY(extent_t *, item_extent, nflush);
+	/* Look up extent once per item. */
+	for (unsigned i = 0 ; i < nflush; i++) {
+		item_extent[i] = iealloc(tsd_tsdn(tsd), *(tbin->avail - 1 - i));
+	}
+
+	while (nflush > 0) {
+		/* Lock the arena associated with the first object. */
+		extent_t *extent = item_extent[0];
+		arena_t *locked_arena = extent_arena_get(extent);
+		UNUSED bool idump;
+
+		if (config_prof) {
+			idump = false;
+		}
+
+		malloc_mutex_lock(tsd_tsdn(tsd), &locked_arena->large_mtx);
+		for (unsigned i = 0; i < nflush; i++) {
+			void *ptr = *(tbin->avail - 1 - i);
+			assert(ptr != NULL);
+			extent = item_extent[i];
+			if (extent_arena_get(extent) == locked_arena) {
+				large_dalloc_prep_junked_locked(tsd_tsdn(tsd),
+				    extent);
+			}
+		}
+		if ((config_prof || config_stats) && locked_arena == arena) {
+			if (config_prof) {
+				idump = arena_prof_accum(tsd_tsdn(tsd), arena,
+				    tcache->prof_accumbytes);
+				tcache->prof_accumbytes = 0;
+			}
+			if (config_stats) {
+				merged_stats = true;
+				arena_stats_large_nrequests_add(tsd_tsdn(tsd),
+				    &arena->stats, binind,
+				    tbin->tstats.nrequests);
+				tbin->tstats.nrequests = 0;
+			}
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &locked_arena->large_mtx);
+
+		unsigned ndeferred = 0;
+		for (unsigned i = 0; i < nflush; i++) {
+			void *ptr = *(tbin->avail - 1 - i);
+			extent = item_extent[i];
+			assert(ptr != NULL && extent != NULL);
+
+			if (extent_arena_get(extent) == locked_arena) {
+				large_dalloc_finish(tsd_tsdn(tsd), extent);
+			} else {
+				/*
+				 * This object was allocated via a different
+				 * arena than the one that is currently locked.
+				 * Stash the object, so that it can be handled
+				 * in a future pass.
+				 */
+				*(tbin->avail - 1 - ndeferred) = ptr;
+				item_extent[ndeferred] = extent;
+				ndeferred++;
+			}
+		}
+		if (config_prof && idump) {
+			prof_idump(tsd_tsdn(tsd));
+		}
+		arena_decay_ticks(tsd_tsdn(tsd), locked_arena, nflush -
+		    ndeferred);
+		nflush = ndeferred;
+	}
+	if (config_stats && !merged_stats) {
+		/*
+		 * The flush loop didn't happen to flush to this thread's
+		 * arena, so the stats didn't get merged.  Manually do so now.
+		 */
+		arena_stats_large_nrequests_add(tsd_tsdn(tsd), &arena->stats,
+		    binind, tbin->tstats.nrequests);
+		tbin->tstats.nrequests = 0;
+	}
+
+	memmove(tbin->avail - rem, tbin->avail - tbin->ncached, rem *
+	    sizeof(void *));
+	tbin->ncached = rem;
+	if (tbin->ncached < tbin->low_water) {
+		tbin->low_water = tbin->ncached;
+	}
+}
+
+void
+tcache_arena_associate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
+	assert(tcache->arena == NULL);
+	tcache->arena = arena;
+
+	if (config_stats) {
+		/* Link into list of extant tcaches. */
+		malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
+
+		ql_elm_new(tcache, link);
+		ql_tail_insert(&arena->tcache_ql, tcache, link);
+		cache_bin_array_descriptor_init(
+		    &tcache->cache_bin_array_descriptor, tcache->bins_small,
+		    tcache->bins_large);
+		ql_tail_insert(&arena->cache_bin_array_descriptor_ql,
+		    &tcache->cache_bin_array_descriptor, link);
+
+		malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
+	}
+}
+
+static void
+tcache_arena_dissociate(tsdn_t *tsdn, tcache_t *tcache) {
+	arena_t *arena = tcache->arena;
+	assert(arena != NULL);
+	if (config_stats) {
+		/* Unlink from list of extant tcaches. */
+		malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
+		if (config_debug) {
+			bool in_ql = false;
+			tcache_t *iter;
+			ql_foreach(iter, &arena->tcache_ql, link) {
+				if (iter == tcache) {
+					in_ql = true;
+					break;
+				}
+			}
+			assert(in_ql);
+		}
+		ql_remove(&arena->tcache_ql, tcache, link);
+		ql_remove(&arena->cache_bin_array_descriptor_ql,
+		    &tcache->cache_bin_array_descriptor, link);
+		tcache_stats_merge(tsdn, tcache, arena);
+		malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
+	}
+	tcache->arena = NULL;
+}
+
+void
+tcache_arena_reassociate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
+	tcache_arena_dissociate(tsdn, tcache);
+	tcache_arena_associate(tsdn, tcache, arena);
+}
+
+bool
+tsd_tcache_enabled_data_init(tsd_t *tsd) {
+	/* Called upon tsd initialization. */
+	tsd_tcache_enabled_set(tsd, opt_tcache);
+	tsd_slow_update(tsd);
+
+	if (opt_tcache) {
+		/* Trigger tcache init. */
+		tsd_tcache_data_init(tsd);
+	}
+
+	return false;
+}
+
+/* Initialize auto tcache (embedded in TSD). */
+static void
+tcache_init(tsd_t *tsd, tcache_t *tcache, void *avail_stack) {
+	memset(&tcache->link, 0, sizeof(ql_elm(tcache_t)));
+	tcache->prof_accumbytes = 0;
+	tcache->next_gc_bin = 0;
+	tcache->arena = NULL;
+
+	ticker_init(&tcache->gc_ticker, TCACHE_GC_INCR);
+
+	size_t stack_offset = 0;
+	assert((TCACHE_NSLOTS_SMALL_MAX & 1U) == 0);
+	memset(tcache->bins_small, 0, sizeof(cache_bin_t) * NBINS);
+	memset(tcache->bins_large, 0, sizeof(cache_bin_t) * (nhbins - NBINS));
+	unsigned i = 0;
+	for (; i < NBINS; i++) {
+		tcache->lg_fill_div[i] = 1;
+		stack_offset += tcache_bin_info[i].ncached_max * sizeof(void *);
+		/*
+		 * avail points past the available space.  Allocations will
+		 * access the slots toward higher addresses (for the benefit of
+		 * prefetch).
+		 */
+		tcache_small_bin_get(tcache, i)->avail =
+		    (void **)((uintptr_t)avail_stack + (uintptr_t)stack_offset);
+	}
+	for (; i < nhbins; i++) {
+		stack_offset += tcache_bin_info[i].ncached_max * sizeof(void *);
+		tcache_large_bin_get(tcache, i)->avail =
+		    (void **)((uintptr_t)avail_stack + (uintptr_t)stack_offset);
+	}
+	assert(stack_offset == stack_nelms * sizeof(void *));
+}
+
+/* Initialize auto tcache (embedded in TSD). */
+bool
+tsd_tcache_data_init(tsd_t *tsd) {
+	tcache_t *tcache = tsd_tcachep_get_unsafe(tsd);
+	assert(tcache_small_bin_get(tcache, 0)->avail == NULL);
+	size_t size = stack_nelms * sizeof(void *);
+	/* Avoid false cacheline sharing. */
+	size = sz_sa2u(size, CACHELINE);
+
+	void *avail_array = ipallocztm(tsd_tsdn(tsd), size, CACHELINE, true,
+	    NULL, true, arena_get(TSDN_NULL, 0, true));
+	if (avail_array == NULL) {
+		return true;
+	}
+
+	tcache_init(tsd, tcache, avail_array);
+	/*
+	 * Initialization is a bit tricky here.  After malloc init is done, all
+	 * threads can rely on arena_choose and associate tcache accordingly.
+	 * However, the thread that does actual malloc bootstrapping relies on
+	 * functional tsd, and it can only rely on a0.  In that case, we
+	 * associate its tcache to a0 temporarily, and later on
+	 * arena_choose_hard() will re-associate properly.
+	 */
+	tcache->arena = NULL;
+	arena_t *arena;
+	if (!malloc_initialized()) {
+		/* If in initialization, assign to a0. */
+		arena = arena_get(tsd_tsdn(tsd), 0, false);
+		tcache_arena_associate(tsd_tsdn(tsd), tcache, arena);
+	} else {
+		arena = arena_choose(tsd, NULL);
+		/* This may happen if thread.tcache.enabled is used. */
+		if (tcache->arena == NULL) {
+			tcache_arena_associate(tsd_tsdn(tsd), tcache, arena);
+		}
+	}
+	assert(arena == tcache->arena);
+
+	return false;
+}
+
+/* Created manual tcache for tcache.create mallctl. */
+tcache_t *
+tcache_create_explicit(tsd_t *tsd) {
+	tcache_t *tcache;
+	size_t size, stack_offset;
+
+	size = sizeof(tcache_t);
+	/* Naturally align the pointer stacks. */
+	size = PTR_CEILING(size);
+	stack_offset = size;
+	size += stack_nelms * sizeof(void *);
+	/* Avoid false cacheline sharing. */
+	size = sz_sa2u(size, CACHELINE);
+
+	tcache = ipallocztm(tsd_tsdn(tsd), size, CACHELINE, true, NULL, true,
+	    arena_get(TSDN_NULL, 0, true));
+	if (tcache == NULL) {
+		return NULL;
+	}
+
+	tcache_init(tsd, tcache,
+	    (void *)((uintptr_t)tcache + (uintptr_t)stack_offset));
+	tcache_arena_associate(tsd_tsdn(tsd), tcache, arena_ichoose(tsd, NULL));
+
+	return tcache;
+}
+
+static void
+tcache_flush_cache(tsd_t *tsd, tcache_t *tcache) {
+	assert(tcache->arena != NULL);
+
+	for (unsigned i = 0; i < NBINS; i++) {
+		cache_bin_t *tbin = tcache_small_bin_get(tcache, i);
+		tcache_bin_flush_small(tsd, tcache, tbin, i, 0);
+
+		if (config_stats) {
+			assert(tbin->tstats.nrequests == 0);
+		}
+	}
+	for (unsigned i = NBINS; i < nhbins; i++) {
+		cache_bin_t *tbin = tcache_large_bin_get(tcache, i);
+		tcache_bin_flush_large(tsd, tbin, i, 0, tcache);
+
+		if (config_stats) {
+			assert(tbin->tstats.nrequests == 0);
+		}
+	}
+
+	if (config_prof && tcache->prof_accumbytes > 0 &&
+	    arena_prof_accum(tsd_tsdn(tsd), tcache->arena,
+	    tcache->prof_accumbytes)) {
+		prof_idump(tsd_tsdn(tsd));
+	}
+}
+
+void
+tcache_flush(tsd_t *tsd) {
+	assert(tcache_available(tsd));
+	tcache_flush_cache(tsd, tsd_tcachep_get(tsd));
+}
+
+static void
+tcache_destroy(tsd_t *tsd, tcache_t *tcache, bool tsd_tcache) {
+	tcache_flush_cache(tsd, tcache);
+	tcache_arena_dissociate(tsd_tsdn(tsd), tcache);
+
+	if (tsd_tcache) {
+		/* Release the avail array for the TSD embedded auto tcache. */
+		void *avail_array =
+		    (void *)((uintptr_t)tcache_small_bin_get(tcache, 0)->avail -
+		    (uintptr_t)tcache_bin_info[0].ncached_max * sizeof(void *));
+		idalloctm(tsd_tsdn(tsd), avail_array, NULL, NULL, true, true);
+	} else {
+		/* Release both the tcache struct and avail array. */
+		idalloctm(tsd_tsdn(tsd), tcache, NULL, NULL, true, true);
+	}
+}
+
+/* For auto tcache (embedded in TSD) only. */
+void
+tcache_cleanup(tsd_t *tsd) {
+	tcache_t *tcache = tsd_tcachep_get(tsd);
+	if (!tcache_available(tsd)) {
+		assert(tsd_tcache_enabled_get(tsd) == false);
+		if (config_debug) {
+			assert(tcache_small_bin_get(tcache, 0)->avail == NULL);
+		}
+		return;
+	}
+	assert(tsd_tcache_enabled_get(tsd));
+	assert(tcache_small_bin_get(tcache, 0)->avail != NULL);
+
+	tcache_destroy(tsd, tcache, true);
+	if (config_debug) {
+		tcache_small_bin_get(tcache, 0)->avail = NULL;
+	}
+}
+
+void
+tcache_stats_merge(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
+	unsigned i;
+
+	cassert(config_stats);
+
+	/* Merge and reset tcache stats. */
+	for (i = 0; i < NBINS; i++) {
+		bin_t *bin = &arena->bins[i];
+		cache_bin_t *tbin = tcache_small_bin_get(tcache, i);
+		malloc_mutex_lock(tsdn, &bin->lock);
+		bin->stats.nrequests += tbin->tstats.nrequests;
+		malloc_mutex_unlock(tsdn, &bin->lock);
+		tbin->tstats.nrequests = 0;
+	}
+
+	for (; i < nhbins; i++) {
+		cache_bin_t *tbin = tcache_large_bin_get(tcache, i);
+		arena_stats_large_nrequests_add(tsdn, &arena->stats, i,
+		    tbin->tstats.nrequests);
+		tbin->tstats.nrequests = 0;
+	}
+}
+
+static bool
+tcaches_create_prep(tsd_t *tsd) {
+	bool err;
+
+	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
+
+	if (tcaches == NULL) {
+		tcaches = base_alloc(tsd_tsdn(tsd), b0get(), sizeof(tcache_t *)
+		    * (MALLOCX_TCACHE_MAX+1), CACHELINE);
+		if (tcaches == NULL) {
+			err = true;
+			goto label_return;
+		}
+	}
+
+	if (tcaches_avail == NULL && tcaches_past > MALLOCX_TCACHE_MAX) {
+		err = true;
+		goto label_return;
+	}
+
+	err = false;
+label_return:
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
+	return err;
+}
+
+bool
+tcaches_create(tsd_t *tsd, unsigned *r_ind) {
+	witness_assert_depth(tsdn_witness_tsdp_get(tsd_tsdn(tsd)), 0);
+
+	bool err;
+
+	if (tcaches_create_prep(tsd)) {
+		err = true;
+		goto label_return;
+	}
+
+	tcache_t *tcache = tcache_create_explicit(tsd);
+	if (tcache == NULL) {
+		err = true;
+		goto label_return;
+	}
+
+	tcaches_t *elm;
+	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
+	if (tcaches_avail != NULL) {
+		elm = tcaches_avail;
+		tcaches_avail = tcaches_avail->next;
+		elm->tcache = tcache;
+		*r_ind = (unsigned)(elm - tcaches);
+	} else {
+		elm = &tcaches[tcaches_past];
+		elm->tcache = tcache;
+		*r_ind = tcaches_past;
+		tcaches_past++;
+	}
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
+
+	err = false;
+label_return:
+	witness_assert_depth(tsdn_witness_tsdp_get(tsd_tsdn(tsd)), 0);
+	return err;
+}
+
+static tcache_t *
+tcaches_elm_remove(tsd_t *tsd, tcaches_t *elm) {
+	malloc_mutex_assert_owner(tsd_tsdn(tsd), &tcaches_mtx);
+
+	if (elm->tcache == NULL) {
+		return NULL;
+	}
+	tcache_t *tcache = elm->tcache;
+	elm->tcache = NULL;
+	return tcache;
+}
+
+void
+tcaches_flush(tsd_t *tsd, unsigned ind) {
+	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
+	tcache_t *tcache = tcaches_elm_remove(tsd, &tcaches[ind]);
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
+	if (tcache != NULL) {
+		tcache_destroy(tsd, tcache, false);
+	}
+}
+
+void
+tcaches_destroy(tsd_t *tsd, unsigned ind) {
+	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
+	tcaches_t *elm = &tcaches[ind];
+	tcache_t *tcache = tcaches_elm_remove(tsd, elm);
+	elm->next = tcaches_avail;
+	tcaches_avail = elm;
+	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
+	if (tcache != NULL) {
+		tcache_destroy(tsd, tcache, false);
+	}
+}
+
+bool
+tcache_boot(tsdn_t *tsdn) {
+	/* If necessary, clamp opt_lg_tcache_max. */
+	if (opt_lg_tcache_max < 0 || (ZU(1) << opt_lg_tcache_max) <
+	    SMALL_MAXCLASS) {
+		tcache_maxclass = SMALL_MAXCLASS;
+	} else {
+		tcache_maxclass = (ZU(1) << opt_lg_tcache_max);
+	}
+
+	if (malloc_mutex_init(&tcaches_mtx, "tcaches", WITNESS_RANK_TCACHES,
+	    malloc_mutex_rank_exclusive)) {
+		return true;
+	}
+
+	nhbins = sz_size2index(tcache_maxclass) + 1;
+
+	/* Initialize tcache_bin_info. */
+	tcache_bin_info = (cache_bin_info_t *)base_alloc(tsdn, b0get(), nhbins
+	    * sizeof(cache_bin_info_t), CACHELINE);
+	if (tcache_bin_info == NULL) {
+		return true;
+	}
+	stack_nelms = 0;
+	unsigned i;
+	for (i = 0; i < NBINS; i++) {
+		if ((bin_infos[i].nregs << 1) <= TCACHE_NSLOTS_SMALL_MIN) {
+			tcache_bin_info[i].ncached_max =
+			    TCACHE_NSLOTS_SMALL_MIN;
+		} else if ((bin_infos[i].nregs << 1) <=
+		    TCACHE_NSLOTS_SMALL_MAX) {
+			tcache_bin_info[i].ncached_max =
+			    (bin_infos[i].nregs << 1);
+		} else {
+			tcache_bin_info[i].ncached_max =
+			    TCACHE_NSLOTS_SMALL_MAX;
+		}
+		stack_nelms += tcache_bin_info[i].ncached_max;
+	}
+	for (; i < nhbins; i++) {
+		tcache_bin_info[i].ncached_max = TCACHE_NSLOTS_LARGE;
+		stack_nelms += tcache_bin_info[i].ncached_max;
+	}
+
+	return false;
+}
+
+void
+tcache_prefork(tsdn_t *tsdn) {
+	if (!config_prof && opt_tcache) {
+		malloc_mutex_prefork(tsdn, &tcaches_mtx);
+	}
+}
+
+void
+tcache_postfork_parent(tsdn_t *tsdn) {
+	if (!config_prof && opt_tcache) {
+		malloc_mutex_postfork_parent(tsdn, &tcaches_mtx);
+	}
+}
+
+void
+tcache_postfork_child(tsdn_t *tsdn) {
+	if (!config_prof && opt_tcache) {
+		malloc_mutex_postfork_child(tsdn, &tcaches_mtx);
+	}
+}
diff --git a/redis-stable/deps/jemalloc/src/ticker.c b/redis-stable/deps/jemalloc/src/ticker.c
new file mode 100644
index 00000000..d7b8cd26
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/ticker.c
@@ -0,0 +1,3 @@
+#define JEMALLOC_TICKER_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/tsd.c b/redis-stable/deps/jemalloc/src/tsd.c
new file mode 100644
index 00000000..c1430682
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/tsd.c
@@ -0,0 +1,351 @@
+#define JEMALLOC_TSD_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/mutex.h"
+#include "jemalloc/internal/rtree.h"
+
+/******************************************************************************/
+/* Data. */
+
+static unsigned ncleanups;
+static malloc_tsd_cleanup_t cleanups[MALLOC_TSD_CLEANUPS_MAX];
+
+#ifdef JEMALLOC_MALLOC_THREAD_CLEANUP
+__thread tsd_t JEMALLOC_TLS_MODEL tsd_tls = TSD_INITIALIZER;
+__thread bool JEMALLOC_TLS_MODEL tsd_initialized = false;
+bool tsd_booted = false;
+#elif (defined(JEMALLOC_TLS))
+__thread tsd_t JEMALLOC_TLS_MODEL tsd_tls = TSD_INITIALIZER;
+pthread_key_t tsd_tsd;
+bool tsd_booted = false;
+#elif (defined(_WIN32))
+DWORD tsd_tsd;
+tsd_wrapper_t tsd_boot_wrapper = {false, TSD_INITIALIZER};
+bool tsd_booted = false;
+#else
+
+/*
+ * This contains a mutex, but it's pretty convenient to allow the mutex code to
+ * have a dependency on tsd.  So we define the struct here, and only refer to it
+ * by pointer in the header.
+ */
+struct tsd_init_head_s {
+	ql_head(tsd_init_block_t) blocks;
+	malloc_mutex_t lock;
+};
+
+pthread_key_t tsd_tsd;
+tsd_init_head_t	tsd_init_head = {
+	ql_head_initializer(blocks),
+	MALLOC_MUTEX_INITIALIZER
+};
+tsd_wrapper_t tsd_boot_wrapper = {
+	false,
+	TSD_INITIALIZER
+};
+bool tsd_booted = false;
+#endif
+
+
+/******************************************************************************/
+
+void
+tsd_slow_update(tsd_t *tsd) {
+	if (tsd_nominal(tsd)) {
+		if (malloc_slow || !tsd_tcache_enabled_get(tsd) ||
+		    tsd_reentrancy_level_get(tsd) > 0) {
+			tsd->state = tsd_state_nominal_slow;
+		} else {
+			tsd->state = tsd_state_nominal;
+		}
+	}
+}
+
+static bool
+tsd_data_init(tsd_t *tsd) {
+	/*
+	 * We initialize the rtree context first (before the tcache), since the
+	 * tcache initialization depends on it.
+	 */
+	rtree_ctx_data_init(tsd_rtree_ctxp_get_unsafe(tsd));
+
+	/*
+	 * A nondeterministic seed based on the address of tsd reduces
+	 * the likelihood of lockstep non-uniform cache index
+	 * utilization among identical concurrent processes, but at the
+	 * cost of test repeatability.  For debug builds, instead use a
+	 * deterministic seed.
+	 */
+	*tsd_offset_statep_get(tsd) = config_debug ? 0 :
+	    (uint64_t)(uintptr_t)tsd;
+
+	return tsd_tcache_enabled_data_init(tsd);
+}
+
+static void
+assert_tsd_data_cleanup_done(tsd_t *tsd) {
+	assert(!tsd_nominal(tsd));
+	assert(*tsd_arenap_get_unsafe(tsd) == NULL);
+	assert(*tsd_iarenap_get_unsafe(tsd) == NULL);
+	assert(*tsd_arenas_tdata_bypassp_get_unsafe(tsd) == true);
+	assert(*tsd_arenas_tdatap_get_unsafe(tsd) == NULL);
+	assert(*tsd_tcache_enabledp_get_unsafe(tsd) == false);
+	assert(*tsd_prof_tdatap_get_unsafe(tsd) == NULL);
+}
+
+static bool
+tsd_data_init_nocleanup(tsd_t *tsd) {
+	assert(tsd->state == tsd_state_reincarnated ||
+	    tsd->state == tsd_state_minimal_initialized);
+	/*
+	 * During reincarnation, there is no guarantee that the cleanup function
+	 * will be called (deallocation may happen after all tsd destructors).
+	 * We set up tsd in a way that no cleanup is needed.
+	 */
+	rtree_ctx_data_init(tsd_rtree_ctxp_get_unsafe(tsd));
+	*tsd_arenas_tdata_bypassp_get(tsd) = true;
+	*tsd_tcache_enabledp_get_unsafe(tsd) = false;
+	*tsd_reentrancy_levelp_get(tsd) = 1;
+	assert_tsd_data_cleanup_done(tsd);
+
+	return false;
+}
+
+tsd_t *
+tsd_fetch_slow(tsd_t *tsd, bool minimal) {
+	assert(!tsd_fast(tsd));
+
+	if (tsd->state == tsd_state_nominal_slow) {
+		/* On slow path but no work needed. */
+		assert(malloc_slow || !tsd_tcache_enabled_get(tsd) ||
+		    tsd_reentrancy_level_get(tsd) > 0 ||
+		    *tsd_arenas_tdata_bypassp_get(tsd));
+	} else if (tsd->state == tsd_state_uninitialized) {
+		if (!minimal) {
+			tsd->state = tsd_state_nominal;
+			tsd_slow_update(tsd);
+			/* Trigger cleanup handler registration. */
+			tsd_set(tsd);
+			tsd_data_init(tsd);
+		} else {
+			tsd->state = tsd_state_minimal_initialized;
+			tsd_set(tsd);
+			tsd_data_init_nocleanup(tsd);
+		}
+	} else if (tsd->state == tsd_state_minimal_initialized) {
+		if (!minimal) {
+			/* Switch to fully initialized. */
+			tsd->state = tsd_state_nominal;
+			assert(*tsd_reentrancy_levelp_get(tsd) >= 1);
+			(*tsd_reentrancy_levelp_get(tsd))--;
+			tsd_slow_update(tsd);
+			tsd_data_init(tsd);
+		} else {
+			assert_tsd_data_cleanup_done(tsd);
+		}
+	} else if (tsd->state == tsd_state_purgatory) {
+		tsd->state = tsd_state_reincarnated;
+		tsd_set(tsd);
+		tsd_data_init_nocleanup(tsd);
+	} else {
+		assert(tsd->state == tsd_state_reincarnated);
+	}
+
+	return tsd;
+}
+
+void *
+malloc_tsd_malloc(size_t size) {
+	return a0malloc(CACHELINE_CEILING(size));
+}
+
+void
+malloc_tsd_dalloc(void *wrapper) {
+	a0dalloc(wrapper);
+}
+
+#if defined(JEMALLOC_MALLOC_THREAD_CLEANUP) || defined(_WIN32)
+#ifndef _WIN32
+JEMALLOC_EXPORT
+#endif
+void
+_malloc_thread_cleanup(void) {
+	bool pending[MALLOC_TSD_CLEANUPS_MAX], again;
+	unsigned i;
+
+	for (i = 0; i < ncleanups; i++) {
+		pending[i] = true;
+	}
+
+	do {
+		again = false;
+		for (i = 0; i < ncleanups; i++) {
+			if (pending[i]) {
+				pending[i] = cleanups[i]();
+				if (pending[i]) {
+					again = true;
+				}
+			}
+		}
+	} while (again);
+}
+#endif
+
+void
+malloc_tsd_cleanup_register(bool (*f)(void)) {
+	assert(ncleanups < MALLOC_TSD_CLEANUPS_MAX);
+	cleanups[ncleanups] = f;
+	ncleanups++;
+}
+
+static void
+tsd_do_data_cleanup(tsd_t *tsd) {
+	prof_tdata_cleanup(tsd);
+	iarena_cleanup(tsd);
+	arena_cleanup(tsd);
+	arenas_tdata_cleanup(tsd);
+	tcache_cleanup(tsd);
+	witnesses_cleanup(tsd_witness_tsdp_get_unsafe(tsd));
+}
+
+void
+tsd_cleanup(void *arg) {
+	tsd_t *tsd = (tsd_t *)arg;
+
+	switch (tsd->state) {
+	case tsd_state_uninitialized:
+		/* Do nothing. */
+		break;
+	case tsd_state_minimal_initialized:
+		/* This implies the thread only did free() in its life time. */
+		/* Fall through. */
+	case tsd_state_reincarnated:
+		/*
+		 * Reincarnated means another destructor deallocated memory
+		 * after the destructor was called.  Cleanup isn't required but
+		 * is still called for testing and completeness.
+		 */
+		assert_tsd_data_cleanup_done(tsd);
+		/* Fall through. */
+	case tsd_state_nominal:
+	case tsd_state_nominal_slow:
+		tsd_do_data_cleanup(tsd);
+		tsd->state = tsd_state_purgatory;
+		tsd_set(tsd);
+		break;
+	case tsd_state_purgatory:
+		/*
+		 * The previous time this destructor was called, we set the
+		 * state to tsd_state_purgatory so that other destructors
+		 * wouldn't cause re-creation of the tsd.  This time, do
+		 * nothing, and do not request another callback.
+		 */
+		break;
+	default:
+		not_reached();
+	}
+#ifdef JEMALLOC_JET
+	test_callback_t test_callback = *tsd_test_callbackp_get_unsafe(tsd);
+	int *data = tsd_test_datap_get_unsafe(tsd);
+	if (test_callback != NULL) {
+		test_callback(data);
+	}
+#endif
+}
+
+tsd_t *
+malloc_tsd_boot0(void) {
+	tsd_t *tsd;
+
+	ncleanups = 0;
+	if (tsd_boot0()) {
+		return NULL;
+	}
+	tsd = tsd_fetch();
+	*tsd_arenas_tdata_bypassp_get(tsd) = true;
+	return tsd;
+}
+
+void
+malloc_tsd_boot1(void) {
+	tsd_boot1();
+	tsd_t *tsd = tsd_fetch();
+	/* malloc_slow has been set properly.  Update tsd_slow. */
+	tsd_slow_update(tsd);
+	*tsd_arenas_tdata_bypassp_get(tsd) = false;
+}
+
+#ifdef _WIN32
+static BOOL WINAPI
+_tls_callback(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved) {
+	switch (fdwReason) {
+#ifdef JEMALLOC_LAZY_LOCK
+	case DLL_THREAD_ATTACH:
+		isthreaded = true;
+		break;
+#endif
+	case DLL_THREAD_DETACH:
+		_malloc_thread_cleanup();
+		break;
+	default:
+		break;
+	}
+	return true;
+}
+
+/*
+ * We need to be able to say "read" here (in the "pragma section"), but have
+ * hooked "read". We won't read for the rest of the file, so we can get away
+ * with unhooking.
+ */
+#ifdef read
+#  undef read
+#endif
+
+#ifdef _MSC_VER
+#  ifdef _M_IX86
+#    pragma comment(linker, "/INCLUDE:__tls_used")
+#    pragma comment(linker, "/INCLUDE:_tls_callback")
+#  else
+#    pragma comment(linker, "/INCLUDE:_tls_used")
+#    pragma comment(linker, "/INCLUDE:tls_callback")
+#  endif
+#  pragma section(".CRT$XLY",long,read)
+#endif
+JEMALLOC_SECTION(".CRT$XLY") JEMALLOC_ATTR(used)
+BOOL	(WINAPI *const tls_callback)(HINSTANCE hinstDLL,
+    DWORD fdwReason, LPVOID lpvReserved) = _tls_callback;
+#endif
+
+#if (!defined(JEMALLOC_MALLOC_THREAD_CLEANUP) && !defined(JEMALLOC_TLS) && \
+    !defined(_WIN32))
+void *
+tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block) {
+	pthread_t self = pthread_self();
+	tsd_init_block_t *iter;
+
+	/* Check whether this thread has already inserted into the list. */
+	malloc_mutex_lock(TSDN_NULL, &head->lock);
+	ql_foreach(iter, &head->blocks, link) {
+		if (iter->thread == self) {
+			malloc_mutex_unlock(TSDN_NULL, &head->lock);
+			return iter->data;
+		}
+	}
+	/* Insert block into list. */
+	ql_elm_new(block, link);
+	block->thread = self;
+	ql_tail_insert(&head->blocks, block, link);
+	malloc_mutex_unlock(TSDN_NULL, &head->lock);
+	return NULL;
+}
+
+void
+tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block) {
+	malloc_mutex_lock(TSDN_NULL, &head->lock);
+	ql_remove(&head->blocks, block, link);
+	malloc_mutex_unlock(TSDN_NULL, &head->lock);
+}
+#endif
diff --git a/redis-stable/deps/jemalloc/src/witness.c b/redis-stable/deps/jemalloc/src/witness.c
new file mode 100644
index 00000000..f42b72ad
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/witness.c
@@ -0,0 +1,100 @@
+#define JEMALLOC_WITNESS_C_
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+#include "jemalloc/internal/malloc_io.h"
+
+void
+witness_init(witness_t *witness, const char *name, witness_rank_t rank,
+    witness_comp_t *comp, void *opaque) {
+	witness->name = name;
+	witness->rank = rank;
+	witness->comp = comp;
+	witness->opaque = opaque;
+}
+
+static void
+witness_lock_error_impl(const witness_list_t *witnesses,
+    const witness_t *witness) {
+	witness_t *w;
+
+	malloc_printf("<jemalloc>: Lock rank order reversal:");
+	ql_foreach(w, witnesses, link) {
+		malloc_printf(" %s(%u)", w->name, w->rank);
+	}
+	malloc_printf(" %s(%u)\n", witness->name, witness->rank);
+	abort();
+}
+witness_lock_error_t *JET_MUTABLE witness_lock_error = witness_lock_error_impl;
+
+static void
+witness_owner_error_impl(const witness_t *witness) {
+	malloc_printf("<jemalloc>: Should own %s(%u)\n", witness->name,
+	    witness->rank);
+	abort();
+}
+witness_owner_error_t *JET_MUTABLE witness_owner_error =
+    witness_owner_error_impl;
+
+static void
+witness_not_owner_error_impl(const witness_t *witness) {
+	malloc_printf("<jemalloc>: Should not own %s(%u)\n", witness->name,
+	    witness->rank);
+	abort();
+}
+witness_not_owner_error_t *JET_MUTABLE witness_not_owner_error =
+    witness_not_owner_error_impl;
+
+static void
+witness_depth_error_impl(const witness_list_t *witnesses,
+    witness_rank_t rank_inclusive, unsigned depth) {
+	witness_t *w;
+
+	malloc_printf("<jemalloc>: Should own %u lock%s of rank >= %u:", depth,
+	    (depth != 1) ?  "s" : "", rank_inclusive);
+	ql_foreach(w, witnesses, link) {
+		malloc_printf(" %s(%u)", w->name, w->rank);
+	}
+	malloc_printf("\n");
+	abort();
+}
+witness_depth_error_t *JET_MUTABLE witness_depth_error =
+    witness_depth_error_impl;
+
+void
+witnesses_cleanup(witness_tsd_t *witness_tsd) {
+	witness_assert_lockless(witness_tsd_tsdn(witness_tsd));
+
+	/* Do nothing. */
+}
+
+void
+witness_prefork(witness_tsd_t *witness_tsd) {
+	if (!config_debug) {
+		return;
+	}
+	witness_tsd->forking = true;
+}
+
+void
+witness_postfork_parent(witness_tsd_t *witness_tsd) {
+	if (!config_debug) {
+		return;
+	}
+	witness_tsd->forking = false;
+}
+
+void
+witness_postfork_child(witness_tsd_t *witness_tsd) {
+	if (!config_debug) {
+		return;
+	}
+#ifndef JEMALLOC_MUTEX_INIT_CB
+	witness_list_t *witnesses;
+
+	witnesses = &witness_tsd->witnesses;
+	ql_new(witnesses);
+#endif
+	witness_tsd->forking = false;
+}
diff --git a/redis-stable/deps/jemalloc/src/zone.c b/redis-stable/deps/jemalloc/src/zone.c
new file mode 100644
index 00000000..23dfdd04
--- /dev/null
+++ b/redis-stable/deps/jemalloc/src/zone.c
@@ -0,0 +1,469 @@
+#include "jemalloc/internal/jemalloc_preamble.h"
+#include "jemalloc/internal/jemalloc_internal_includes.h"
+
+#include "jemalloc/internal/assert.h"
+
+#ifndef JEMALLOC_ZONE
+#  error "This source file is for zones on Darwin (OS X)."
+#endif
+
+/* Definitions of the following structs in malloc/malloc.h might be too old
+ * for the built binary to run on newer versions of OSX. So use the newest
+ * possible version of those structs.
+ */
+typedef struct _malloc_zone_t {
+	void *reserved1;
+	void *reserved2;
+	size_t (*size)(struct _malloc_zone_t *, const void *);
+	void *(*malloc)(struct _malloc_zone_t *, size_t);
+	void *(*calloc)(struct _malloc_zone_t *, size_t, size_t);
+	void *(*valloc)(struct _malloc_zone_t *, size_t);
+	void (*free)(struct _malloc_zone_t *, void *);
+	void *(*realloc)(struct _malloc_zone_t *, void *, size_t);
+	void (*destroy)(struct _malloc_zone_t *);
+	const char *zone_name;
+	unsigned (*batch_malloc)(struct _malloc_zone_t *, size_t, void **, unsigned);
+	void (*batch_free)(struct _malloc_zone_t *, void **, unsigned);
+	struct malloc_introspection_t *introspect;
+	unsigned version;
+	void *(*memalign)(struct _malloc_zone_t *, size_t, size_t);
+	void (*free_definite_size)(struct _malloc_zone_t *, void *, size_t);
+	size_t (*pressure_relief)(struct _malloc_zone_t *, size_t);
+} malloc_zone_t;
+
+typedef struct {
+	vm_address_t address;
+	vm_size_t size;
+} vm_range_t;
+
+typedef struct malloc_statistics_t {
+	unsigned blocks_in_use;
+	size_t size_in_use;
+	size_t max_size_in_use;
+	size_t size_allocated;
+} malloc_statistics_t;
+
+typedef kern_return_t memory_reader_t(task_t, vm_address_t, vm_size_t, void **);
+
+typedef void vm_range_recorder_t(task_t, void *, unsigned type, vm_range_t *, unsigned);
+
+typedef struct malloc_introspection_t {
+	kern_return_t (*enumerator)(task_t, void *, unsigned, vm_address_t, memory_reader_t, vm_range_recorder_t);
+	size_t (*good_size)(malloc_zone_t *, size_t);
+	boolean_t (*check)(malloc_zone_t *);
+	void (*print)(malloc_zone_t *, boolean_t);
+	void (*log)(malloc_zone_t *, void *);
+	void (*force_lock)(malloc_zone_t *);
+	void (*force_unlock)(malloc_zone_t *);
+	void (*statistics)(malloc_zone_t *, malloc_statistics_t *);
+	boolean_t (*zone_locked)(malloc_zone_t *);
+	boolean_t (*enable_discharge_checking)(malloc_zone_t *);
+	boolean_t (*disable_discharge_checking)(malloc_zone_t *);
+	void (*discharge)(malloc_zone_t *, void *);
+#ifdef __BLOCKS__
+	void (*enumerate_discharged_pointers)(malloc_zone_t *, void (^)(void *, void *));
+#else
+	void *enumerate_unavailable_without_blocks;
+#endif
+	void (*reinit_lock)(malloc_zone_t *);
+} malloc_introspection_t;
+
+extern kern_return_t malloc_get_all_zones(task_t, memory_reader_t, vm_address_t **, unsigned *);
+
+extern malloc_zone_t *malloc_default_zone(void);
+
+extern void malloc_zone_register(malloc_zone_t *zone);
+
+extern void malloc_zone_unregister(malloc_zone_t *zone);
+
+/*
+ * The malloc_default_purgeable_zone() function is only available on >= 10.6.
+ * We need to check whether it is present at runtime, thus the weak_import.
+ */
+extern malloc_zone_t *malloc_default_purgeable_zone(void)
+JEMALLOC_ATTR(weak_import);
+
+/******************************************************************************/
+/* Data. */
+
+static malloc_zone_t *default_zone, *purgeable_zone;
+static malloc_zone_t jemalloc_zone;
+static struct malloc_introspection_t jemalloc_zone_introspect;
+static pid_t zone_force_lock_pid = -1;
+
+/******************************************************************************/
+/* Function prototypes for non-inline static functions. */
+
+static size_t	zone_size(malloc_zone_t *zone, const void *ptr);
+static void	*zone_malloc(malloc_zone_t *zone, size_t size);
+static void	*zone_calloc(malloc_zone_t *zone, size_t num, size_t size);
+static void	*zone_valloc(malloc_zone_t *zone, size_t size);
+static void	zone_free(malloc_zone_t *zone, void *ptr);
+static void	*zone_realloc(malloc_zone_t *zone, void *ptr, size_t size);
+static void	*zone_memalign(malloc_zone_t *zone, size_t alignment,
+    size_t size);
+static void	zone_free_definite_size(malloc_zone_t *zone, void *ptr,
+    size_t size);
+static void	zone_destroy(malloc_zone_t *zone);
+static unsigned	zone_batch_malloc(struct _malloc_zone_t *zone, size_t size,
+    void **results, unsigned num_requested);
+static void	zone_batch_free(struct _malloc_zone_t *zone,
+    void **to_be_freed, unsigned num_to_be_freed);
+static size_t	zone_pressure_relief(struct _malloc_zone_t *zone, size_t goal);
+static size_t	zone_good_size(malloc_zone_t *zone, size_t size);
+static kern_return_t	zone_enumerator(task_t task, void *data, unsigned type_mask,
+    vm_address_t zone_address, memory_reader_t reader,
+    vm_range_recorder_t recorder);
+static boolean_t	zone_check(malloc_zone_t *zone);
+static void	zone_print(malloc_zone_t *zone, boolean_t verbose);
+static void	zone_log(malloc_zone_t *zone, void *address);
+static void	zone_force_lock(malloc_zone_t *zone);
+static void	zone_force_unlock(malloc_zone_t *zone);
+static void	zone_statistics(malloc_zone_t *zone,
+    malloc_statistics_t *stats);
+static boolean_t	zone_locked(malloc_zone_t *zone);
+static void	zone_reinit_lock(malloc_zone_t *zone);
+
+/******************************************************************************/
+/*
+ * Functions.
+ */
+
+static size_t
+zone_size(malloc_zone_t *zone, const void *ptr) {
+	/*
+	 * There appear to be places within Darwin (such as setenv(3)) that
+	 * cause calls to this function with pointers that *no* zone owns.  If
+	 * we knew that all pointers were owned by *some* zone, we could split
+	 * our zone into two parts, and use one as the default allocator and
+	 * the other as the default deallocator/reallocator.  Since that will
+	 * not work in practice, we must check all pointers to assure that they
+	 * reside within a mapped extent before determining size.
+	 */
+	return ivsalloc(tsdn_fetch(), ptr);
+}
+
+static void *
+zone_malloc(malloc_zone_t *zone, size_t size) {
+	return je_malloc(size);
+}
+
+static void *
+zone_calloc(malloc_zone_t *zone, size_t num, size_t size) {
+	return je_calloc(num, size);
+}
+
+static void *
+zone_valloc(malloc_zone_t *zone, size_t size) {
+	void *ret = NULL; /* Assignment avoids useless compiler warning. */
+
+	je_posix_memalign(&ret, PAGE, size);
+
+	return ret;
+}
+
+static void
+zone_free(malloc_zone_t *zone, void *ptr) {
+	if (ivsalloc(tsdn_fetch(), ptr) != 0) {
+		je_free(ptr);
+		return;
+	}
+
+	free(ptr);
+}
+
+static void *
+zone_realloc(malloc_zone_t *zone, void *ptr, size_t size) {
+	if (ivsalloc(tsdn_fetch(), ptr) != 0) {
+		return je_realloc(ptr, size);
+	}
+
+	return realloc(ptr, size);
+}
+
+static void *
+zone_memalign(malloc_zone_t *zone, size_t alignment, size_t size) {
+	void *ret = NULL; /* Assignment avoids useless compiler warning. */
+
+	je_posix_memalign(&ret, alignment, size);
+
+	return ret;
+}
+
+static void
+zone_free_definite_size(malloc_zone_t *zone, void *ptr, size_t size) {
+	size_t alloc_size;
+
+	alloc_size = ivsalloc(tsdn_fetch(), ptr);
+	if (alloc_size != 0) {
+		assert(alloc_size == size);
+		je_free(ptr);
+		return;
+	}
+
+	free(ptr);
+}
+
+static void
+zone_destroy(malloc_zone_t *zone) {
+	/* This function should never be called. */
+	not_reached();
+}
+
+static unsigned
+zone_batch_malloc(struct _malloc_zone_t *zone, size_t size, void **results,
+    unsigned num_requested) {
+	unsigned i;
+
+	for (i = 0; i < num_requested; i++) {
+		results[i] = je_malloc(size);
+		if (!results[i])
+			break;
+	}
+
+	return i;
+}
+
+static void
+zone_batch_free(struct _malloc_zone_t *zone, void **to_be_freed,
+    unsigned num_to_be_freed) {
+	unsigned i;
+
+	for (i = 0; i < num_to_be_freed; i++) {
+		zone_free(zone, to_be_freed[i]);
+		to_be_freed[i] = NULL;
+	}
+}
+
+static size_t
+zone_pressure_relief(struct _malloc_zone_t *zone, size_t goal) {
+	return 0;
+}
+
+static size_t
+zone_good_size(malloc_zone_t *zone, size_t size) {
+	if (size == 0) {
+		size = 1;
+	}
+	return sz_s2u(size);
+}
+
+static kern_return_t
+zone_enumerator(task_t task, void *data, unsigned type_mask,
+    vm_address_t zone_address, memory_reader_t reader,
+    vm_range_recorder_t recorder) {
+	return KERN_SUCCESS;
+}
+
+static boolean_t
+zone_check(malloc_zone_t *zone) {
+	return true;
+}
+
+static void
+zone_print(malloc_zone_t *zone, boolean_t verbose) {
+}
+
+static void
+zone_log(malloc_zone_t *zone, void *address) {
+}
+
+static void
+zone_force_lock(malloc_zone_t *zone) {
+	if (isthreaded) {
+		/*
+		 * See the note in zone_force_unlock, below, to see why we need
+		 * this.
+		 */
+		assert(zone_force_lock_pid == -1);
+		zone_force_lock_pid = getpid();
+		jemalloc_prefork();
+	}
+}
+
+static void
+zone_force_unlock(malloc_zone_t *zone) {
+	/*
+	 * zone_force_lock and zone_force_unlock are the entry points to the
+	 * forking machinery on OS X.  The tricky thing is, the child is not
+	 * allowed to unlock mutexes locked in the parent, even if owned by the
+	 * forking thread (and the mutex type we use in OS X will fail an assert
+	 * if we try).  In the child, we can get away with reinitializing all
+	 * the mutexes, which has the effect of unlocking them.  In the parent,
+	 * doing this would mean we wouldn't wake any waiters blocked on the
+	 * mutexes we unlock.  So, we record the pid of the current thread in
+	 * zone_force_lock, and use that to detect if we're in the parent or
+	 * child here, to decide which unlock logic we need.
+	 */
+	if (isthreaded) {
+		assert(zone_force_lock_pid != -1);
+		if (getpid() == zone_force_lock_pid) {
+			jemalloc_postfork_parent();
+		} else {
+			jemalloc_postfork_child();
+		}
+		zone_force_lock_pid = -1;
+	}
+}
+
+static void
+zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats) {
+	/* We make no effort to actually fill the values */
+	stats->blocks_in_use = 0;
+	stats->size_in_use = 0;
+	stats->max_size_in_use = 0;
+	stats->size_allocated = 0;
+}
+
+static boolean_t
+zone_locked(malloc_zone_t *zone) {
+	/* Pretend no lock is being held */
+	return false;
+}
+
+static void
+zone_reinit_lock(malloc_zone_t *zone) {
+	/* As of OSX 10.12, this function is only used when force_unlock would
+	 * be used if the zone version were < 9. So just use force_unlock. */
+	zone_force_unlock(zone);
+}
+
+static void
+zone_init(void) {
+	jemalloc_zone.size = zone_size;
+	jemalloc_zone.malloc = zone_malloc;
+	jemalloc_zone.calloc = zone_calloc;
+	jemalloc_zone.valloc = zone_valloc;
+	jemalloc_zone.free = zone_free;
+	jemalloc_zone.realloc = zone_realloc;
+	jemalloc_zone.destroy = zone_destroy;
+	jemalloc_zone.zone_name = "jemalloc_zone";
+	jemalloc_zone.batch_malloc = zone_batch_malloc;
+	jemalloc_zone.batch_free = zone_batch_free;
+	jemalloc_zone.introspect = &jemalloc_zone_introspect;
+	jemalloc_zone.version = 9;
+	jemalloc_zone.memalign = zone_memalign;
+	jemalloc_zone.free_definite_size = zone_free_definite_size;
+	jemalloc_zone.pressure_relief = zone_pressure_relief;
+
+	jemalloc_zone_introspect.enumerator = zone_enumerator;
+	jemalloc_zone_introspect.good_size = zone_good_size;
+	jemalloc_zone_introspect.check = zone_check;
+	jemalloc_zone_introspect.print = zone_print;
+	jemalloc_zone_introspect.log = zone_log;
+	jemalloc_zone_introspect.force_lock = zone_force_lock;
+	jemalloc_zone_introspect.force_unlock = zone_force_unlock;
+	jemalloc_zone_introspect.statistics = zone_statistics;
+	jemalloc_zone_introspect.zone_locked = zone_locked;
+	jemalloc_zone_introspect.enable_discharge_checking = NULL;
+	jemalloc_zone_introspect.disable_discharge_checking = NULL;
+	jemalloc_zone_introspect.discharge = NULL;
+#ifdef __BLOCKS__
+	jemalloc_zone_introspect.enumerate_discharged_pointers = NULL;
+#else
+	jemalloc_zone_introspect.enumerate_unavailable_without_blocks = NULL;
+#endif
+	jemalloc_zone_introspect.reinit_lock = zone_reinit_lock;
+}
+
+static malloc_zone_t *
+zone_default_get(void) {
+	malloc_zone_t **zones = NULL;
+	unsigned int num_zones = 0;
+
+	/*
+	 * On OSX 10.12, malloc_default_zone returns a special zone that is not
+	 * present in the list of registered zones. That zone uses a "lite zone"
+	 * if one is present (apparently enabled when malloc stack logging is
+	 * enabled), or the first registered zone otherwise. In practice this
+	 * means unless malloc stack logging is enabled, the first registered
+	 * zone is the default.  So get the list of zones to get the first one,
+	 * instead of relying on malloc_default_zone.
+	 */
+	if (KERN_SUCCESS != malloc_get_all_zones(0, NULL,
+	    (vm_address_t**)&zones, &num_zones)) {
+		/*
+		 * Reset the value in case the failure happened after it was
+		 * set.
+		 */
+		num_zones = 0;
+	}
+
+	if (num_zones) {
+		return zones[0];
+	}
+
+	return malloc_default_zone();
+}
+
+/* As written, this function can only promote jemalloc_zone. */
+static void
+zone_promote(void) {
+	malloc_zone_t *zone;
+
+	do {
+		/*
+		 * Unregister and reregister the default zone.  On OSX >= 10.6,
+		 * unregistering takes the last registered zone and places it
+		 * at the location of the specified zone.  Unregistering the
+		 * default zone thus makes the last registered one the default.
+		 * On OSX < 10.6, unregistering shifts all registered zones.
+		 * The first registered zone then becomes the default.
+		 */
+		malloc_zone_unregister(default_zone);
+		malloc_zone_register(default_zone);
+
+		/*
+		 * On OSX 10.6, having the default purgeable zone appear before
+		 * the default zone makes some things crash because it thinks it
+		 * owns the default zone allocated pointers.  We thus
+		 * unregister/re-register it in order to ensure it's always
+		 * after the default zone.  On OSX < 10.6, there is no purgeable
+		 * zone, so this does nothing.  On OSX >= 10.6, unregistering
+		 * replaces the purgeable zone with the last registered zone
+		 * above, i.e. the default zone.  Registering it again then puts
+		 * it at the end, obviously after the default zone.
+		 */
+		if (purgeable_zone != NULL) {
+			malloc_zone_unregister(purgeable_zone);
+			malloc_zone_register(purgeable_zone);
+		}
+
+		zone = zone_default_get();
+	} while (zone != &jemalloc_zone);
+}
+
+JEMALLOC_ATTR(constructor)
+void
+zone_register(void) {
+	/*
+	 * If something else replaced the system default zone allocator, don't
+	 * register jemalloc's.
+	 */
+	default_zone = zone_default_get();
+	if (!default_zone->zone_name || strcmp(default_zone->zone_name,
+	    "DefaultMallocZone") != 0) {
+		return;
+	}
+
+	/*
+	 * The default purgeable zone is created lazily by OSX's libc.  It uses
+	 * the default zone when it is created for "small" allocations
+	 * (< 15 KiB), but assumes the default zone is a scalable_zone.  This
+	 * obviously fails when the default zone is the jemalloc zone, so
+	 * malloc_default_purgeable_zone() is called beforehand so that the
+	 * default purgeable zone is created when the default zone is still
+	 * a scalable_zone.  As purgeable zones only exist on >= 10.6, we need
+	 * to check for the existence of malloc_default_purgeable_zone() at
+	 * run time.
+	 */
+	purgeable_zone = (malloc_default_purgeable_zone == NULL) ? NULL :
+	    malloc_default_purgeable_zone();
+
+	/* Register the custom zone.  At this point it won't be the default. */
+	zone_init();
+	malloc_zone_register(&jemalloc_zone);
+
+	/* Promote the custom zone to be default. */
+	zone_promote();
+}
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
new file mode 100644
index 00000000..a1885dbf
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
@@ -0,0 +1,186 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+/**
+ * @file SFMT-alti.h
+ *
+ * @brief SIMD oriented Fast Mersenne Twister(SFMT)
+ * pseudorandom number generator
+ *
+ * @author Mutsuo Saito (Hiroshima University)
+ * @author Makoto Matsumoto (Hiroshima University)
+ *
+ * Copyright (C) 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ * University. All rights reserved.
+ *
+ * The new BSD License is applied to this software.
+ * see LICENSE.txt
+ */
+
+#ifndef SFMT_ALTI_H
+#define SFMT_ALTI_H
+
+/**
+ * This function represents the recursion formula in AltiVec and BIG ENDIAN.
+ * @param a a 128-bit part of the interal state array
+ * @param b a 128-bit part of the interal state array
+ * @param c a 128-bit part of the interal state array
+ * @param d a 128-bit part of the interal state array
+ * @return output
+ */
+JEMALLOC_ALWAYS_INLINE
+vector unsigned int vec_recursion(vector unsigned int a,
+						vector unsigned int b,
+						vector unsigned int c,
+						vector unsigned int d) {
+
+    const vector unsigned int sl1 = ALTI_SL1;
+    const vector unsigned int sr1 = ALTI_SR1;
+#ifdef ONLY64
+    const vector unsigned int mask = ALTI_MSK64;
+    const vector unsigned char perm_sl = ALTI_SL2_PERM64;
+    const vector unsigned char perm_sr = ALTI_SR2_PERM64;
+#else
+    const vector unsigned int mask = ALTI_MSK;
+    const vector unsigned char perm_sl = ALTI_SL2_PERM;
+    const vector unsigned char perm_sr = ALTI_SR2_PERM;
+#endif
+    vector unsigned int v, w, x, y, z;
+    x = vec_perm(a, (vector unsigned int)perm_sl, perm_sl);
+    v = a;
+    y = vec_sr(b, sr1);
+    z = vec_perm(c, (vector unsigned int)perm_sr, perm_sr);
+    w = vec_sl(d, sl1);
+    z = vec_xor(z, w);
+    y = vec_and(y, mask);
+    v = vec_xor(v, x);
+    z = vec_xor(z, y);
+    z = vec_xor(z, v);
+    return z;
+}
+
+/**
+ * This function fills the internal state array with pseudorandom
+ * integers.
+ */
+static inline void gen_rand_all(sfmt_t *ctx) {
+    int i;
+    vector unsigned int r, r1, r2;
+
+    r1 = ctx->sfmt[N - 2].s;
+    r2 = ctx->sfmt[N - 1].s;
+    for (i = 0; i < N - POS1; i++) {
+	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2);
+	ctx->sfmt[i].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+    for (; i < N; i++) {
+	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1 - N].s, r1, r2);
+	ctx->sfmt[i].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+}
+
+/**
+ * This function fills the user-specified array with pseudorandom
+ * integers.
+ *
+ * @param array an 128-bit array to be filled by pseudorandom numbers.
+ * @param size number of 128-bit pesudorandom numbers to be generated.
+ */
+static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
+    int i, j;
+    vector unsigned int r, r1, r2;
+
+    r1 = ctx->sfmt[N - 2].s;
+    r2 = ctx->sfmt[N - 1].s;
+    for (i = 0; i < N - POS1; i++) {
+	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2);
+	array[i].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+    for (; i < N; i++) {
+	r = vec_recursion(ctx->sfmt[i].s, array[i + POS1 - N].s, r1, r2);
+	array[i].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+    /* main loop */
+    for (; i < size - N; i++) {
+	r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2);
+	array[i].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+    for (j = 0; j < 2 * N - size; j++) {
+	ctx->sfmt[j].s = array[j + size - N].s;
+    }
+    for (; i < size; i++) {
+	r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2);
+	array[i].s = r;
+	ctx->sfmt[j++].s = r;
+	r1 = r2;
+	r2 = r;
+    }
+}
+
+#ifndef ONLY64
+#if defined(__APPLE__)
+#define ALTI_SWAP (vector unsigned char) \
+	(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)
+#else
+#define ALTI_SWAP {4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11}
+#endif
+/**
+ * This function swaps high and low 32-bit of 64-bit integers in user
+ * specified array.
+ *
+ * @param array an 128-bit array to be swaped.
+ * @param size size of 128-bit array.
+ */
+static inline void swap(w128_t *array, int size) {
+    int i;
+    const vector unsigned char perm = ALTI_SWAP;
+
+    for (i = 0; i < size; i++) {
+	array[i].s = vec_perm(array[i].s, (vector unsigned int)perm, perm);
+    }
+}
+#endif
+
+#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
new file mode 100644
index 00000000..ade66222
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
@@ -0,0 +1,132 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS_H
+#define SFMT_PARAMS_H
+
+#if !defined(MEXP)
+#ifdef __GNUC__
+  #warning "MEXP is not defined. I assume MEXP is 19937."
+#endif
+  #define MEXP 19937
+#endif
+/*-----------------
+  BASIC DEFINITIONS
+  -----------------*/
+/** Mersenne Exponent. The period of the sequence 
+ *  is a multiple of 2^MEXP-1.
+ * #define MEXP 19937 */
+/** SFMT generator has an internal state array of 128-bit integers,
+ * and N is its size. */
+#define N (MEXP / 128 + 1)
+/** N32 is the size of internal state array when regarded as an array
+ * of 32-bit integers.*/
+#define N32 (N * 4)
+/** N64 is the size of internal state array when regarded as an array
+ * of 64-bit integers.*/
+#define N64 (N * 2)
+
+/*----------------------
+  the parameters of SFMT
+  following definitions are in paramsXXXX.h file.
+  ----------------------*/
+/** the pick up position of the array.
+#define POS1 122 
+*/
+
+/** the parameter of shift left as four 32-bit registers.
+#define SL1 18
+ */
+
+/** the parameter of shift left as one 128-bit register. 
+ * The 128-bit integer is shifted by (SL2 * 8) bits. 
+#define SL2 1 
+*/
+
+/** the parameter of shift right as four 32-bit registers.
+#define SR1 11
+*/
+
+/** the parameter of shift right as one 128-bit register. 
+ * The 128-bit integer is shifted by (SL2 * 8) bits. 
+#define SR2 1 
+*/
+
+/** A bitmask, used in the recursion.  These parameters are introduced
+ * to break symmetry of SIMD.
+#define MSK1 0xdfffffefU
+#define MSK2 0xddfecb7fU
+#define MSK3 0xbffaffffU
+#define MSK4 0xbffffff6U 
+*/
+
+/** These definitions are part of a 128-bit period certification vector.
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0xc98e126aU
+*/
+
+#if MEXP == 607
+  #include "test/SFMT-params607.h"
+#elif MEXP == 1279
+  #include "test/SFMT-params1279.h"
+#elif MEXP == 2281
+  #include "test/SFMT-params2281.h"
+#elif MEXP == 4253
+  #include "test/SFMT-params4253.h"
+#elif MEXP == 11213
+  #include "test/SFMT-params11213.h"
+#elif MEXP == 19937
+  #include "test/SFMT-params19937.h"
+#elif MEXP == 44497
+  #include "test/SFMT-params44497.h"
+#elif MEXP == 86243
+  #include "test/SFMT-params86243.h"
+#elif MEXP == 132049
+  #include "test/SFMT-params132049.h"
+#elif MEXP == 216091
+  #include "test/SFMT-params216091.h"
+#else
+#ifdef __GNUC__
+  #error "MEXP is not valid."
+  #undef MEXP
+#else
+  #undef MEXP
+#endif
+
+#endif
+
+#endif /* SFMT_PARAMS_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
new file mode 100644
index 00000000..2994bd21
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS11213_H
+#define SFMT_PARAMS11213_H
+
+#define POS1	68
+#define SL1	14
+#define SL2	3
+#define SR1	7
+#define SR2	3
+#define MSK1	0xeffff7fbU
+#define MSK2	0xffffffefU
+#define MSK3	0xdfdfbfffU
+#define MSK4	0x7fffdbfdU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0xe8148000U
+#define PARITY4	0xd0c7afa3U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
+    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
+    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
+    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-11213:68-14-3-7-3:effff7fb-ffffffef-dfdfbfff-7fffdbfd"
+
+#endif /* SFMT_PARAMS11213_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
new file mode 100644
index 00000000..d7959f98
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS1279_H
+#define SFMT_PARAMS1279_H
+
+#define POS1	7
+#define SL1	14
+#define SL2	3
+#define SR1	5
+#define SR2	1
+#define MSK1	0xf7fefffdU
+#define MSK2	0x7fefcfffU
+#define MSK3	0xaff3ef3fU
+#define MSK4	0xb5ffff7fU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0x20000000U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
+    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-1279:7-14-3-5-1:f7fefffd-7fefcfff-aff3ef3f-b5ffff7f"
+
+#endif /* SFMT_PARAMS1279_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
new file mode 100644
index 00000000..a1dcec39
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS132049_H
+#define SFMT_PARAMS132049_H
+
+#define POS1	110
+#define SL1	19
+#define SL2	1
+#define SR1	21
+#define SR2	1
+#define MSK1	0xffffbb5fU
+#define MSK2	0xfb6ebf95U
+#define MSK3	0xfffefffaU
+#define MSK4	0xcff77fffU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0xcb520000U
+#define PARITY4	0xc7e91c7dU
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
+    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-132049:110-19-1-21-1:ffffbb5f-fb6ebf95-fffefffa-cff77fff"
+
+#endif /* SFMT_PARAMS132049_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
new file mode 100644
index 00000000..fb92b4c9
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS19937_H
+#define SFMT_PARAMS19937_H
+
+#define POS1	122
+#define SL1	18
+#define SL2	1
+#define SR1	11
+#define SR2	1
+#define MSK1	0xdfffffefU
+#define MSK2	0xddfecb7fU
+#define MSK3	0xbffaffffU
+#define MSK4	0xbffffff6U
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0x13c9e684U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
+    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-19937:122-18-1-11-1:dfffffef-ddfecb7f-bffaffff-bffffff6"
+
+#endif /* SFMT_PARAMS19937_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
new file mode 100644
index 00000000..125ce282
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS216091_H
+#define SFMT_PARAMS216091_H
+
+#define POS1	627
+#define SL1	11
+#define SL2	3
+#define SR1	10
+#define SR2	1
+#define MSK1	0xbff7bff7U
+#define MSK2	0xbfffffffU
+#define MSK3	0xbffffa7fU
+#define MSK4	0xffddfbfbU
+#define PARITY1	0xf8000001U
+#define PARITY2	0x89e80709U
+#define PARITY3	0x3bd2b64bU
+#define PARITY4	0x0c64b1e4U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
+    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-216091:627-11-3-10-1:bff7bff7-bfffffff-bffffa7f-ffddfbfb"
+
+#endif /* SFMT_PARAMS216091_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
new file mode 100644
index 00000000..0ef85c40
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS2281_H
+#define SFMT_PARAMS2281_H
+
+#define POS1	12
+#define SL1	19
+#define SL2	1
+#define SR1	5
+#define SR2	1
+#define MSK1	0xbff7ffbfU
+#define MSK2	0xfdfffffeU
+#define MSK3	0xf7ffef7fU
+#define MSK4	0xf2f7cbbfU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0x41dfa600U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
+    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-2281:12-19-1-5-1:bff7ffbf-fdfffffe-f7ffef7f-f2f7cbbf"
+
+#endif /* SFMT_PARAMS2281_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
new file mode 100644
index 00000000..9f07bc67
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS4253_H
+#define SFMT_PARAMS4253_H
+
+#define POS1	17
+#define SL1	20
+#define SL2	1
+#define SR1	7
+#define SR2	1
+#define MSK1	0x9f7bffffU
+#define MSK2	0x9fffff5fU
+#define MSK3	0x3efffffbU
+#define MSK4	0xfffff7bbU
+#define PARITY1	0xa8000001U
+#define PARITY2	0xaf5390a3U
+#define PARITY3	0xb740b3f8U
+#define PARITY4	0x6c11486dU
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
+    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-4253:17-20-1-7-1:9f7bffff-9fffff5f-3efffffb-fffff7bb"
+
+#endif /* SFMT_PARAMS4253_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
new file mode 100644
index 00000000..85598fed
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS44497_H
+#define SFMT_PARAMS44497_H
+
+#define POS1	330
+#define SL1	5
+#define SL2	3
+#define SR1	9
+#define SR2	3
+#define MSK1	0xeffffffbU
+#define MSK2	0xdfbebfffU
+#define MSK3	0xbfbf7befU
+#define MSK4	0x9ffd7bffU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0xa3ac4000U
+#define PARITY4	0xecc1327aU
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
+    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
+    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
+    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-44497:330-5-3-9-3:effffffb-dfbebfff-bfbf7bef-9ffd7bff"
+
+#endif /* SFMT_PARAMS44497_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
new file mode 100644
index 00000000..bc76485f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS607_H
+#define SFMT_PARAMS607_H
+
+#define POS1	2
+#define SL1	15
+#define SL2	3
+#define SR1	13
+#define SR2	3
+#define MSK1	0xfdff37ffU
+#define MSK2	0xef7f3f7dU
+#define MSK3	0xff777b7dU
+#define MSK4	0x7ff7fb2fU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0x5986f054U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
+    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
+    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
+    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-607:2-15-3-13-3:fdff37ff-ef7f3f7d-ff777b7d-7ff7fb2f"
+
+#endif /* SFMT_PARAMS607_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
new file mode 100644
index 00000000..5e4d783c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
@@ -0,0 +1,81 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#ifndef SFMT_PARAMS86243_H
+#define SFMT_PARAMS86243_H
+
+#define POS1	366
+#define SL1	6
+#define SL2	7
+#define SR1	19
+#define SR2	1
+#define MSK1	0xfdbffbffU
+#define MSK2	0xbff7ff3fU
+#define MSK3	0xfd77efffU
+#define MSK4	0xbf9ff3ffU
+#define PARITY1	0x00000001U
+#define PARITY2	0x00000000U
+#define PARITY3	0x00000000U
+#define PARITY4	0xe9528d85U
+
+
+/* PARAMETERS FOR ALTIVEC */
+#if defined(__APPLE__)	/* For OSX */
+    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
+    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
+    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
+    #define ALTI_MSK64 \
+	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
+    #define ALTI_SL2_PERM \
+	(vector unsigned char)(25,25,25,25,3,25,25,25,7,0,1,2,11,4,5,6)
+    #define ALTI_SL2_PERM64 \
+	(vector unsigned char)(7,25,25,25,25,25,25,25,15,0,1,2,3,4,5,6)
+    #define ALTI_SR2_PERM \
+	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
+    #define ALTI_SR2_PERM64 \
+	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
+#else	/* For OTHER OSs(Linux?) */
+    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
+    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
+    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
+    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
+    #define ALTI_SL2_PERM	{25,25,25,25,3,25,25,25,7,0,1,2,11,4,5,6}
+    #define ALTI_SL2_PERM64	{7,25,25,25,25,25,25,25,15,0,1,2,3,4,5,6}
+    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
+    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
+#endif	/* For OSX */
+#define IDSTR	"SFMT-86243:366-6-7-19-1:fdbffbff-bff7ff3f-fd77efff-bf9ff3ff"
+
+#endif /* SFMT_PARAMS86243_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
new file mode 100644
index 00000000..169ad558
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
@@ -0,0 +1,157 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+/**
+ * @file  SFMT-sse2.h
+ * @brief SIMD oriented Fast Mersenne Twister(SFMT) for Intel SSE2
+ *
+ * @author Mutsuo Saito (Hiroshima University)
+ * @author Makoto Matsumoto (Hiroshima University)
+ *
+ * @note We assume LITTLE ENDIAN in this file
+ *
+ * Copyright (C) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ * University. All rights reserved.
+ *
+ * The new BSD License is applied to this software, see LICENSE.txt
+ */
+
+#ifndef SFMT_SSE2_H
+#define SFMT_SSE2_H
+
+/**
+ * This function represents the recursion formula.
+ * @param a a 128-bit part of the interal state array
+ * @param b a 128-bit part of the interal state array
+ * @param c a 128-bit part of the interal state array
+ * @param d a 128-bit part of the interal state array
+ * @param mask 128-bit mask
+ * @return output
+ */
+JEMALLOC_ALWAYS_INLINE __m128i mm_recursion(__m128i *a, __m128i *b,
+				   __m128i c, __m128i d, __m128i mask) {
+    __m128i v, x, y, z;
+
+    x = _mm_load_si128(a);
+    y = _mm_srli_epi32(*b, SR1);
+    z = _mm_srli_si128(c, SR2);
+    v = _mm_slli_epi32(d, SL1);
+    z = _mm_xor_si128(z, x);
+    z = _mm_xor_si128(z, v);
+    x = _mm_slli_si128(x, SL2);
+    y = _mm_and_si128(y, mask);
+    z = _mm_xor_si128(z, x);
+    z = _mm_xor_si128(z, y);
+    return z;
+}
+
+/**
+ * This function fills the internal state array with pseudorandom
+ * integers.
+ */
+static inline void gen_rand_all(sfmt_t *ctx) {
+    int i;
+    __m128i r, r1, r2, mask;
+    mask = _mm_set_epi32(MSK4, MSK3, MSK2, MSK1);
+
+    r1 = _mm_load_si128(&ctx->sfmt[N - 2].si);
+    r2 = _mm_load_si128(&ctx->sfmt[N - 1].si);
+    for (i = 0; i < N - POS1; i++) {
+	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2,
+	  mask);
+	_mm_store_si128(&ctx->sfmt[i].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+    for (; i < N; i++) {
+	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1 - N].si, r1, r2,
+	  mask);
+	_mm_store_si128(&ctx->sfmt[i].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+}
+
+/**
+ * This function fills the user-specified array with pseudorandom
+ * integers.
+ *
+ * @param array an 128-bit array to be filled by pseudorandom numbers.
+ * @param size number of 128-bit pesudorandom numbers to be generated.
+ */
+static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
+    int i, j;
+    __m128i r, r1, r2, mask;
+    mask = _mm_set_epi32(MSK4, MSK3, MSK2, MSK1);
+
+    r1 = _mm_load_si128(&ctx->sfmt[N - 2].si);
+    r2 = _mm_load_si128(&ctx->sfmt[N - 1].si);
+    for (i = 0; i < N - POS1; i++) {
+	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2,
+	  mask);
+	_mm_store_si128(&array[i].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+    for (; i < N; i++) {
+	r = mm_recursion(&ctx->sfmt[i].si, &array[i + POS1 - N].si, r1, r2,
+	  mask);
+	_mm_store_si128(&array[i].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+    /* main loop */
+    for (; i < size - N; i++) {
+	r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2,
+			 mask);
+	_mm_store_si128(&array[i].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+    for (j = 0; j < 2 * N - size; j++) {
+	r = _mm_load_si128(&array[j + size - N].si);
+	_mm_store_si128(&ctx->sfmt[j].si, r);
+    }
+    for (; i < size; i++) {
+	r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2,
+			 mask);
+	_mm_store_si128(&array[i].si, r);
+	_mm_store_si128(&ctx->sfmt[j++].si, r);
+	r1 = r2;
+	r2 = r;
+    }
+}
+
+#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT.h b/redis-stable/deps/jemalloc/test/include/test/SFMT.h
new file mode 100644
index 00000000..863fc55e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/SFMT.h
@@ -0,0 +1,146 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+/** 
+ * @file SFMT.h 
+ *
+ * @brief SIMD oriented Fast Mersenne Twister(SFMT) pseudorandom
+ * number generator
+ *
+ * @author Mutsuo Saito (Hiroshima University)
+ * @author Makoto Matsumoto (Hiroshima University)
+ *
+ * Copyright (C) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ * University. All rights reserved.
+ *
+ * The new BSD License is applied to this software.
+ * see LICENSE.txt
+ *
+ * @note We assume that your system has inttypes.h.  If your system
+ * doesn't have inttypes.h, you have to typedef uint32_t and uint64_t,
+ * and you have to define PRIu64 and PRIx64 in this file as follows:
+ * @verbatim
+ typedef unsigned int uint32_t
+ typedef unsigned long long uint64_t  
+ #define PRIu64 "llu"
+ #define PRIx64 "llx"
+@endverbatim
+ * uint32_t must be exactly 32-bit unsigned integer type (no more, no
+ * less), and uint64_t must be exactly 64-bit unsigned integer type.
+ * PRIu64 and PRIx64 are used for printf function to print 64-bit
+ * unsigned int and 64-bit unsigned int in hexadecimal format.
+ */
+
+#ifndef SFMT_H
+#define SFMT_H
+
+typedef struct sfmt_s sfmt_t;
+
+uint32_t gen_rand32(sfmt_t *ctx);
+uint32_t gen_rand32_range(sfmt_t *ctx, uint32_t limit);
+uint64_t gen_rand64(sfmt_t *ctx);
+uint64_t gen_rand64_range(sfmt_t *ctx, uint64_t limit);
+void fill_array32(sfmt_t *ctx, uint32_t *array, int size);
+void fill_array64(sfmt_t *ctx, uint64_t *array, int size);
+sfmt_t *init_gen_rand(uint32_t seed);
+sfmt_t *init_by_array(uint32_t *init_key, int key_length);
+void fini_gen_rand(sfmt_t *ctx);
+const char *get_idstring(void);
+int get_min_array_size32(void);
+int get_min_array_size64(void);
+
+/* These real versions are due to Isaku Wada */
+/** generates a random number on [0,1]-real-interval */
+static inline double to_real1(uint32_t v) {
+    return v * (1.0/4294967295.0); 
+    /* divided by 2^32-1 */ 
+}
+
+/** generates a random number on [0,1]-real-interval */
+static inline double genrand_real1(sfmt_t *ctx) {
+    return to_real1(gen_rand32(ctx));
+}
+
+/** generates a random number on [0,1)-real-interval */
+static inline double to_real2(uint32_t v) {
+    return v * (1.0/4294967296.0); 
+    /* divided by 2^32 */
+}
+
+/** generates a random number on [0,1)-real-interval */
+static inline double genrand_real2(sfmt_t *ctx) {
+    return to_real2(gen_rand32(ctx));
+}
+
+/** generates a random number on (0,1)-real-interval */
+static inline double to_real3(uint32_t v) {
+    return (((double)v) + 0.5)*(1.0/4294967296.0); 
+    /* divided by 2^32 */
+}
+
+/** generates a random number on (0,1)-real-interval */
+static inline double genrand_real3(sfmt_t *ctx) {
+    return to_real3(gen_rand32(ctx));
+}
+/** These real versions are due to Isaku Wada */
+
+/** generates a random number on [0,1) with 53-bit resolution*/
+static inline double to_res53(uint64_t v) {
+    return v * (1.0/18446744073709551616.0L);
+}
+
+/** generates a random number on [0,1) with 53-bit resolution from two
+ * 32 bit integers */
+static inline double to_res53_mix(uint32_t x, uint32_t y) {
+    return to_res53(x | ((uint64_t)y << 32));
+}
+
+/** generates a random number on [0,1) with 53-bit resolution
+ */
+static inline double genrand_res53(sfmt_t *ctx) {
+    return to_res53(gen_rand64(ctx));
+}
+
+/** generates a random number on [0,1) with 53-bit resolution
+    using 32bit integer.
+ */
+static inline double genrand_res53_mix(sfmt_t *ctx) {
+    uint32_t x, y;
+
+    x = gen_rand32(ctx);
+    y = gen_rand32(ctx);
+    return to_res53_mix(x, y);
+}
+#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/btalloc.h b/redis-stable/deps/jemalloc/test/include/test/btalloc.h
new file mode 100644
index 00000000..5877ea77
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/btalloc.h
@@ -0,0 +1,30 @@
+/* btalloc() provides a mechanism for allocating via permuted backtraces. */
+void	*btalloc(size_t size, unsigned bits);
+
+#define btalloc_n_proto(n)						\
+void	*btalloc_##n(size_t size, unsigned bits);
+btalloc_n_proto(0)
+btalloc_n_proto(1)
+
+#define btalloc_n_gen(n)						\
+void *									\
+btalloc_##n(size_t size, unsigned bits) {				\
+	void *p;							\
+									\
+	if (bits == 0) {						\
+		p = mallocx(size, 0);					\
+	} else {							\
+		switch (bits & 0x1U) {					\
+		case 0:							\
+			p = (btalloc_0(size, bits >> 1));		\
+			break;						\
+		case 1:							\
+			p = (btalloc_1(size, bits >> 1));		\
+			break;						\
+		default: not_reached();					\
+		}							\
+	}								\
+	/* Intentionally sabotage tail call optimization. */		\
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");		\
+	return p;							\
+}
diff --git a/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h b/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
new file mode 100644
index 00000000..1f062015
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
@@ -0,0 +1,289 @@
+/*
+ * Boilerplate code used for testing extent hooks via interception and
+ * passthrough.
+ */
+
+static void	*extent_alloc_hook(extent_hooks_t *extent_hooks, void *new_addr,
+    size_t size, size_t alignment, bool *zero, bool *commit,
+    unsigned arena_ind);
+static bool	extent_dalloc_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, bool committed, unsigned arena_ind);
+static void	extent_destroy_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, bool committed, unsigned arena_ind);
+static bool	extent_commit_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind);
+static bool	extent_decommit_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind);
+static bool	extent_purge_lazy_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t offset, size_t length, unsigned arena_ind);
+static bool	extent_purge_forced_hook(extent_hooks_t *extent_hooks,
+    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
+static bool	extent_split_hook(extent_hooks_t *extent_hooks, void *addr,
+    size_t size, size_t size_a, size_t size_b, bool committed,
+    unsigned arena_ind);
+static bool	extent_merge_hook(extent_hooks_t *extent_hooks, void *addr_a,
+    size_t size_a, void *addr_b, size_t size_b, bool committed,
+    unsigned arena_ind);
+
+static extent_hooks_t *default_hooks;
+static extent_hooks_t hooks = {
+	extent_alloc_hook,
+	extent_dalloc_hook,
+	extent_destroy_hook,
+	extent_commit_hook,
+	extent_decommit_hook,
+	extent_purge_lazy_hook,
+	extent_purge_forced_hook,
+	extent_split_hook,
+	extent_merge_hook
+};
+
+/* Control whether hook functions pass calls through to default hooks. */
+static bool try_alloc = true;
+static bool try_dalloc = true;
+static bool try_destroy = true;
+static bool try_commit = true;
+static bool try_decommit = true;
+static bool try_purge_lazy = true;
+static bool try_purge_forced = true;
+static bool try_split = true;
+static bool try_merge = true;
+
+/* Set to false prior to operations, then introspect after operations. */
+static bool called_alloc;
+static bool called_dalloc;
+static bool called_destroy;
+static bool called_commit;
+static bool called_decommit;
+static bool called_purge_lazy;
+static bool called_purge_forced;
+static bool called_split;
+static bool called_merge;
+
+/* Set to false prior to operations, then introspect after operations. */
+static bool did_alloc;
+static bool did_dalloc;
+static bool did_destroy;
+static bool did_commit;
+static bool did_decommit;
+static bool did_purge_lazy;
+static bool did_purge_forced;
+static bool did_split;
+static bool did_merge;
+
+#if 0
+#  define TRACE_HOOK(fmt, ...) malloc_printf(fmt, __VA_ARGS__)
+#else
+#  define TRACE_HOOK(fmt, ...)
+#endif
+
+static void *
+extent_alloc_hook(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
+    size_t alignment, bool *zero, bool *commit, unsigned arena_ind) {
+	void *ret;
+
+	TRACE_HOOK("%s(extent_hooks=%p, new_addr=%p, size=%zu, alignment=%zu, "
+	    "*zero=%s, *commit=%s, arena_ind=%u)\n", __func__, extent_hooks,
+	    new_addr, size, alignment, *zero ?  "true" : "false", *commit ?
+	    "true" : "false", arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->alloc, extent_alloc_hook,
+	    "Wrong hook function");
+	called_alloc = true;
+	if (!try_alloc) {
+		return NULL;
+	}
+	ret = default_hooks->alloc(default_hooks, new_addr, size, alignment,
+	    zero, commit, 0);
+	did_alloc = (ret != NULL);
+	return ret;
+}
+
+static bool
+extent_dalloc_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    bool committed, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
+	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
+	    "true" : "false", arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->dalloc, extent_dalloc_hook,
+	    "Wrong hook function");
+	called_dalloc = true;
+	if (!try_dalloc) {
+		return true;
+	}
+	err = default_hooks->dalloc(default_hooks, addr, size, committed, 0);
+	did_dalloc = !err;
+	return err;
+}
+
+static void
+extent_destroy_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    bool committed, unsigned arena_ind) {
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
+	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
+	    "true" : "false", arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->destroy, extent_destroy_hook,
+	    "Wrong hook function");
+	called_destroy = true;
+	if (!try_destroy) {
+		return;
+	}
+	default_hooks->destroy(default_hooks, addr, size, committed, 0);
+	did_destroy = true;
+}
+
+static bool
+extent_commit_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
+	    "length=%zu, arena_ind=%u)\n", __func__, extent_hooks, addr, size,
+	    offset, length, arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->commit, extent_commit_hook,
+	    "Wrong hook function");
+	called_commit = true;
+	if (!try_commit) {
+		return true;
+	}
+	err = default_hooks->commit(default_hooks, addr, size, offset, length,
+	    0);
+	did_commit = !err;
+	return err;
+}
+
+static bool
+extent_decommit_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
+	    "length=%zu, arena_ind=%u)\n", __func__, extent_hooks, addr, size,
+	    offset, length, arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->decommit, extent_decommit_hook,
+	    "Wrong hook function");
+	called_decommit = true;
+	if (!try_decommit) {
+		return true;
+	}
+	err = default_hooks->decommit(default_hooks, addr, size, offset, length,
+	    0);
+	did_decommit = !err;
+	return err;
+}
+
+static bool
+extent_purge_lazy_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
+	    "length=%zu arena_ind=%u)\n", __func__, extent_hooks, addr, size,
+	    offset, length, arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->purge_lazy, extent_purge_lazy_hook,
+	    "Wrong hook function");
+	called_purge_lazy = true;
+	if (!try_purge_lazy) {
+		return true;
+	}
+	err = default_hooks->purge_lazy == NULL ||
+	    default_hooks->purge_lazy(default_hooks, addr, size, offset, length,
+	    0);
+	did_purge_lazy = !err;
+	return err;
+}
+
+static bool
+extent_purge_forced_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t offset, size_t length, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
+	    "length=%zu arena_ind=%u)\n", __func__, extent_hooks, addr, size,
+	    offset, length, arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->purge_forced, extent_purge_forced_hook,
+	    "Wrong hook function");
+	called_purge_forced = true;
+	if (!try_purge_forced) {
+		return true;
+	}
+	err = default_hooks->purge_forced == NULL ||
+	    default_hooks->purge_forced(default_hooks, addr, size, offset,
+	    length, 0);
+	did_purge_forced = !err;
+	return err;
+}
+
+static bool
+extent_split_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    size_t size_a, size_t size_b, bool committed, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, size_a=%zu, "
+	    "size_b=%zu, committed=%s, arena_ind=%u)\n", __func__, extent_hooks,
+	    addr, size, size_a, size_b, committed ? "true" : "false",
+	    arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->split, extent_split_hook,
+	    "Wrong hook function");
+	called_split = true;
+	if (!try_split) {
+		return true;
+	}
+	err = (default_hooks->split == NULL ||
+	    default_hooks->split(default_hooks, addr, size, size_a, size_b,
+	    committed, 0));
+	did_split = !err;
+	return err;
+}
+
+static bool
+extent_merge_hook(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
+    void *addr_b, size_t size_b, bool committed, unsigned arena_ind) {
+	bool err;
+
+	TRACE_HOOK("%s(extent_hooks=%p, addr_a=%p, size_a=%zu, addr_b=%p "
+	    "size_b=%zu, committed=%s, arena_ind=%u)\n", __func__, extent_hooks,
+	    addr_a, size_a, addr_b, size_b, committed ? "true" : "false",
+	    arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->merge, extent_merge_hook,
+	    "Wrong hook function");
+	assert_ptr_eq((void *)((uintptr_t)addr_a + size_a), addr_b,
+	    "Extents not mergeable");
+	called_merge = true;
+	if (!try_merge) {
+		return true;
+	}
+	err = (default_hooks->merge == NULL ||
+	    default_hooks->merge(default_hooks, addr_a, size_a, addr_b, size_b,
+	    committed, 0));
+	did_merge = !err;
+	return err;
+}
+
+static void
+extent_hooks_prep(void) {
+	size_t sz;
+
+	sz = sizeof(default_hooks);
+	assert_d_eq(mallctl("arena.0.extent_hooks", (void *)&default_hooks, &sz,
+	    NULL, 0), 0, "Unexpected mallctl() error");
+}
diff --git a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
new file mode 100644
index 00000000..67caa86b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
@@ -0,0 +1,173 @@
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <limits.h>
+#ifndef SIZE_T_MAX
+#  define SIZE_T_MAX	SIZE_MAX
+#endif
+#include <stdlib.h>
+#include <stdarg.h>
+#include <stdbool.h>
+#include <errno.h>
+#include <math.h>
+#include <string.h>
+#ifdef _WIN32
+#  include "msvc_compat/strings.h"
+#endif
+
+#ifdef _WIN32
+#  include <windows.h>
+#  include "msvc_compat/windows_extra.h"
+#else
+#  include <pthread.h>
+#endif
+
+#include "test/jemalloc_test_defs.h"
+
+#ifdef JEMALLOC_OSSPIN
+#  include <libkern/OSAtomic.h>
+#endif
+
+#if defined(HAVE_ALTIVEC) && !defined(__APPLE__)
+#  include <altivec.h>
+#endif
+#ifdef HAVE_SSE2
+#  include <emmintrin.h>
+#endif
+
+/******************************************************************************/
+/*
+ * For unit tests, expose all public and private interfaces.
+ */
+#ifdef JEMALLOC_UNIT_TEST
+#  define JEMALLOC_JET
+#  define JEMALLOC_MANGLE
+#  include "jemalloc/internal/jemalloc_preamble.h"
+#  include "jemalloc/internal/jemalloc_internal_includes.h"
+
+/******************************************************************************/
+/*
+ * For integration tests, expose the public jemalloc interfaces, but only
+ * expose the minimum necessary internal utility code (to avoid re-implementing
+ * essentially identical code within the test infrastructure).
+ */
+#elif defined(JEMALLOC_INTEGRATION_TEST) || \
+    defined(JEMALLOC_INTEGRATION_CPP_TEST)
+#  define JEMALLOC_MANGLE
+#  include "jemalloc/jemalloc@install_suffix@.h"
+#  include "jemalloc/internal/jemalloc_internal_defs.h"
+#  include "jemalloc/internal/jemalloc_internal_macros.h"
+
+static const bool config_debug =
+#ifdef JEMALLOC_DEBUG
+    true
+#else
+    false
+#endif
+    ;
+
+#  define JEMALLOC_N(n) @private_namespace@##n
+#  include "jemalloc/internal/private_namespace.h"
+#  include "jemalloc/internal/hooks.h"
+
+/* Hermetic headers. */
+#  include "jemalloc/internal/assert.h"
+#  include "jemalloc/internal/malloc_io.h"
+#  include "jemalloc/internal/nstime.h"
+#  include "jemalloc/internal/util.h"
+
+/* Non-hermetic headers. */
+#  include "jemalloc/internal/qr.h"
+#  include "jemalloc/internal/ql.h"
+
+/******************************************************************************/
+/*
+ * For stress tests, expose the public jemalloc interfaces with name mangling
+ * so that they can be tested as e.g. malloc() and free().  Also expose the
+ * public jemalloc interfaces with jet_ prefixes, so that stress tests can use
+ * a separate allocator for their internal data structures.
+ */
+#elif defined(JEMALLOC_STRESS_TEST)
+#  include "jemalloc/jemalloc@install_suffix@.h"
+
+#  include "jemalloc/jemalloc_protos_jet.h"
+
+#  define JEMALLOC_JET
+#  include "jemalloc/internal/jemalloc_preamble.h"
+#  include "jemalloc/internal/jemalloc_internal_includes.h"
+#  include "jemalloc/internal/public_unnamespace.h"
+#  undef JEMALLOC_JET
+
+#  include "jemalloc/jemalloc_rename.h"
+#  define JEMALLOC_MANGLE
+#  ifdef JEMALLOC_STRESS_TESTLIB
+#    include "jemalloc/jemalloc_mangle_jet.h"
+#  else
+#    include "jemalloc/jemalloc_mangle.h"
+#  endif
+
+/******************************************************************************/
+/*
+ * This header does dangerous things, the effects of which only test code
+ * should be subject to.
+ */
+#else
+#  error "This header cannot be included outside a testing context"
+#endif
+
+/******************************************************************************/
+/*
+ * Common test utilities.
+ */
+#include "test/btalloc.h"
+#include "test/math.h"
+#include "test/mtx.h"
+#include "test/mq.h"
+#include "test/test.h"
+#include "test/timer.h"
+#include "test/thd.h"
+#define MEXP 19937
+#include "test/SFMT.h"
+
+/******************************************************************************/
+/*
+ * Define always-enabled assertion macros, so that test assertions execute even
+ * if assertions are disabled in the library code.
+ */
+#undef assert
+#undef not_reached
+#undef not_implemented
+#undef assert_not_implemented
+
+#define assert(e) do {							\
+	if (!(e)) {							\
+		malloc_printf(						\
+		    "<jemalloc>: %s:%d: Failed assertion: \"%s\"\n",	\
+		    __FILE__, __LINE__, #e);				\
+		abort();						\
+	}								\
+} while (0)
+
+#define not_reached() do {						\
+	malloc_printf(							\
+	    "<jemalloc>: %s:%d: Unreachable code reached\n",		\
+	    __FILE__, __LINE__);					\
+	abort();							\
+} while (0)
+
+#define not_implemented() do {						\
+	malloc_printf("<jemalloc>: %s:%d: Not implemented\n",		\
+	    __FILE__, __LINE__);					\
+	abort();							\
+} while (0)
+
+#define assert_not_implemented(e) do {					\
+	if (!(e)) {							\
+		not_implemented();					\
+	}								\
+} while (0)
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
new file mode 100644
index 00000000..5cc8532a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
@@ -0,0 +1,9 @@
+#include "jemalloc/internal/jemalloc_internal_defs.h"
+#include "jemalloc/internal/jemalloc_internal_decls.h"
+
+/*
+ * For use by SFMT.  configure.ac doesn't actually define HAVE_SSE2 because its
+ * dependencies are notoriously unportable in practice.
+ */
+#undef HAVE_SSE2
+#undef HAVE_ALTIVEC
diff --git a/redis-stable/deps/jemalloc/test/include/test/math.h b/redis-stable/deps/jemalloc/test/include/test/math.h
new file mode 100644
index 00000000..efba086d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/math.h
@@ -0,0 +1,306 @@
+/*
+ * Compute the natural log of Gamma(x), accurate to 10 decimal places.
+ *
+ * This implementation is based on:
+ *
+ *   Pike, M.C., I.D. Hill (1966) Algorithm 291: Logarithm of Gamma function
+ *   [S14].  Communications of the ACM 9(9):684.
+ */
+static inline double
+ln_gamma(double x) {
+	double f, z;
+
+	assert(x > 0.0);
+
+	if (x < 7.0) {
+		f = 1.0;
+		z = x;
+		while (z < 7.0) {
+			f *= z;
+			z += 1.0;
+		}
+		x = z;
+		f = -log(f);
+	} else {
+		f = 0.0;
+	}
+
+	z = 1.0 / (x * x);
+
+	return f + (x-0.5) * log(x) - x + 0.918938533204673 +
+	    (((-0.000595238095238 * z + 0.000793650793651) * z -
+	    0.002777777777778) * z + 0.083333333333333) / x;
+}
+
+/*
+ * Compute the incomplete Gamma ratio for [0..x], where p is the shape
+ * parameter, and ln_gamma_p is ln_gamma(p).
+ *
+ * This implementation is based on:
+ *
+ *   Bhattacharjee, G.P. (1970) Algorithm AS 32: The incomplete Gamma integral.
+ *   Applied Statistics 19:285-287.
+ */
+static inline double
+i_gamma(double x, double p, double ln_gamma_p) {
+	double acu, factor, oflo, gin, term, rn, a, b, an, dif;
+	double pn[6];
+	unsigned i;
+
+	assert(p > 0.0);
+	assert(x >= 0.0);
+
+	if (x == 0.0) {
+		return 0.0;
+	}
+
+	acu = 1.0e-10;
+	oflo = 1.0e30;
+	gin = 0.0;
+	factor = exp(p * log(x) - x - ln_gamma_p);
+
+	if (x <= 1.0 || x < p) {
+		/* Calculation by series expansion. */
+		gin = 1.0;
+		term = 1.0;
+		rn = p;
+
+		while (true) {
+			rn += 1.0;
+			term *= x / rn;
+			gin += term;
+			if (term <= acu) {
+				gin *= factor / p;
+				return gin;
+			}
+		}
+	} else {
+		/* Calculation by continued fraction. */
+		a = 1.0 - p;
+		b = a + x + 1.0;
+		term = 0.0;
+		pn[0] = 1.0;
+		pn[1] = x;
+		pn[2] = x + 1.0;
+		pn[3] = x * b;
+		gin = pn[2] / pn[3];
+
+		while (true) {
+			a += 1.0;
+			b += 2.0;
+			term += 1.0;
+			an = a * term;
+			for (i = 0; i < 2; i++) {
+				pn[i+4] = b * pn[i+2] - an * pn[i];
+			}
+			if (pn[5] != 0.0) {
+				rn = pn[4] / pn[5];
+				dif = fabs(gin - rn);
+				if (dif <= acu && dif <= acu * rn) {
+					gin = 1.0 - factor * gin;
+					return gin;
+				}
+				gin = rn;
+			}
+			for (i = 0; i < 4; i++) {
+				pn[i] = pn[i+2];
+			}
+
+			if (fabs(pn[4]) >= oflo) {
+				for (i = 0; i < 4; i++) {
+					pn[i] /= oflo;
+				}
+			}
+		}
+	}
+}
+
+/*
+ * Given a value p in [0..1] of the lower tail area of the normal distribution,
+ * compute the limit on the definite integral from [-inf..z] that satisfies p,
+ * accurate to 16 decimal places.
+ *
+ * This implementation is based on:
+ *
+ *   Wichura, M.J. (1988) Algorithm AS 241: The percentage points of the normal
+ *   distribution.  Applied Statistics 37(3):477-484.
+ */
+static inline double
+pt_norm(double p) {
+	double q, r, ret;
+
+	assert(p > 0.0 && p < 1.0);
+
+	q = p - 0.5;
+	if (fabs(q) <= 0.425) {
+		/* p close to 1/2. */
+		r = 0.180625 - q * q;
+		return q * (((((((2.5090809287301226727e3 * r +
+		    3.3430575583588128105e4) * r + 6.7265770927008700853e4) * r
+		    + 4.5921953931549871457e4) * r + 1.3731693765509461125e4) *
+		    r + 1.9715909503065514427e3) * r + 1.3314166789178437745e2)
+		    * r + 3.3871328727963666080e0) /
+		    (((((((5.2264952788528545610e3 * r +
+		    2.8729085735721942674e4) * r + 3.9307895800092710610e4) * r
+		    + 2.1213794301586595867e4) * r + 5.3941960214247511077e3) *
+		    r + 6.8718700749205790830e2) * r + 4.2313330701600911252e1)
+		    * r + 1.0);
+	} else {
+		if (q < 0.0) {
+			r = p;
+		} else {
+			r = 1.0 - p;
+		}
+		assert(r > 0.0);
+
+		r = sqrt(-log(r));
+		if (r <= 5.0) {
+			/* p neither close to 1/2 nor 0 or 1. */
+			r -= 1.6;
+			ret = ((((((((7.74545014278341407640e-4 * r +
+			    2.27238449892691845833e-2) * r +
+			    2.41780725177450611770e-1) * r +
+			    1.27045825245236838258e0) * r +
+			    3.64784832476320460504e0) * r +
+			    5.76949722146069140550e0) * r +
+			    4.63033784615654529590e0) * r +
+			    1.42343711074968357734e0) /
+			    (((((((1.05075007164441684324e-9 * r +
+			    5.47593808499534494600e-4) * r +
+			    1.51986665636164571966e-2)
+			    * r + 1.48103976427480074590e-1) * r +
+			    6.89767334985100004550e-1) * r +
+			    1.67638483018380384940e0) * r +
+			    2.05319162663775882187e0) * r + 1.0));
+		} else {
+			/* p near 0 or 1. */
+			r -= 5.0;
+			ret = ((((((((2.01033439929228813265e-7 * r +
+			    2.71155556874348757815e-5) * r +
+			    1.24266094738807843860e-3) * r +
+			    2.65321895265761230930e-2) * r +
+			    2.96560571828504891230e-1) * r +
+			    1.78482653991729133580e0) * r +
+			    5.46378491116411436990e0) * r +
+			    6.65790464350110377720e0) /
+			    (((((((2.04426310338993978564e-15 * r +
+			    1.42151175831644588870e-7) * r +
+			    1.84631831751005468180e-5) * r +
+			    7.86869131145613259100e-4) * r +
+			    1.48753612908506148525e-2) * r +
+			    1.36929880922735805310e-1) * r +
+			    5.99832206555887937690e-1)
+			    * r + 1.0));
+		}
+		if (q < 0.0) {
+			ret = -ret;
+		}
+		return ret;
+	}
+}
+
+/*
+ * Given a value p in [0..1] of the lower tail area of the Chi^2 distribution
+ * with df degrees of freedom, where ln_gamma_df_2 is ln_gamma(df/2.0), compute
+ * the upper limit on the definite integral from [0..z] that satisfies p,
+ * accurate to 12 decimal places.
+ *
+ * This implementation is based on:
+ *
+ *   Best, D.J., D.E. Roberts (1975) Algorithm AS 91: The percentage points of
+ *   the Chi^2 distribution.  Applied Statistics 24(3):385-388.
+ *
+ *   Shea, B.L. (1991) Algorithm AS R85: A remark on AS 91: The percentage
+ *   points of the Chi^2 distribution.  Applied Statistics 40(1):233-235.
+ */
+static inline double
+pt_chi2(double p, double df, double ln_gamma_df_2) {
+	double e, aa, xx, c, ch, a, q, p1, p2, t, x, b, s1, s2, s3, s4, s5, s6;
+	unsigned i;
+
+	assert(p >= 0.0 && p < 1.0);
+	assert(df > 0.0);
+
+	e = 5.0e-7;
+	aa = 0.6931471805;
+
+	xx = 0.5 * df;
+	c = xx - 1.0;
+
+	if (df < -1.24 * log(p)) {
+		/* Starting approximation for small Chi^2. */
+		ch = pow(p * xx * exp(ln_gamma_df_2 + xx * aa), 1.0 / xx);
+		if (ch - e < 0.0) {
+			return ch;
+		}
+	} else {
+		if (df > 0.32) {
+			x = pt_norm(p);
+			/*
+			 * Starting approximation using Wilson and Hilferty
+			 * estimate.
+			 */
+			p1 = 0.222222 / df;
+			ch = df * pow(x * sqrt(p1) + 1.0 - p1, 3.0);
+			/* Starting approximation for p tending to 1. */
+			if (ch > 2.2 * df + 6.0) {
+				ch = -2.0 * (log(1.0 - p) - c * log(0.5 * ch) +
+				    ln_gamma_df_2);
+			}
+		} else {
+			ch = 0.4;
+			a = log(1.0 - p);
+			while (true) {
+				q = ch;
+				p1 = 1.0 + ch * (4.67 + ch);
+				p2 = ch * (6.73 + ch * (6.66 + ch));
+				t = -0.5 + (4.67 + 2.0 * ch) / p1 - (6.73 + ch
+				    * (13.32 + 3.0 * ch)) / p2;
+				ch -= (1.0 - exp(a + ln_gamma_df_2 + 0.5 * ch +
+				    c * aa) * p2 / p1) / t;
+				if (fabs(q / ch - 1.0) - 0.01 <= 0.0) {
+					break;
+				}
+			}
+		}
+	}
+
+	for (i = 0; i < 20; i++) {
+		/* Calculation of seven-term Taylor series. */
+		q = ch;
+		p1 = 0.5 * ch;
+		if (p1 < 0.0) {
+			return -1.0;
+		}
+		p2 = p - i_gamma(p1, xx, ln_gamma_df_2);
+		t = p2 * exp(xx * aa + ln_gamma_df_2 + p1 - c * log(ch));
+		b = t / ch;
+		a = 0.5 * t - b * c;
+		s1 = (210.0 + a * (140.0 + a * (105.0 + a * (84.0 + a * (70.0 +
+		    60.0 * a))))) / 420.0;
+		s2 = (420.0 + a * (735.0 + a * (966.0 + a * (1141.0 + 1278.0 *
+		    a)))) / 2520.0;
+		s3 = (210.0 + a * (462.0 + a * (707.0 + 932.0 * a))) / 2520.0;
+		s4 = (252.0 + a * (672.0 + 1182.0 * a) + c * (294.0 + a *
+		    (889.0 + 1740.0 * a))) / 5040.0;
+		s5 = (84.0 + 264.0 * a + c * (175.0 + 606.0 * a)) / 2520.0;
+		s6 = (120.0 + c * (346.0 + 127.0 * c)) / 5040.0;
+		ch += t * (1.0 + 0.5 * t * s1 - b * c * (s1 - b * (s2 - b * (s3
+		    - b * (s4 - b * (s5 - b * s6))))));
+		if (fabs(q / ch - 1.0) <= e) {
+			break;
+		}
+	}
+
+	return ch;
+}
+
+/*
+ * Given a value p in [0..1] and Gamma distribution shape and scale parameters,
+ * compute the upper limit on the definite integral from [0..z] that satisfies
+ * p.
+ */
+static inline double
+pt_gamma(double p, double shape, double scale, double ln_gamma_shape) {
+	return pt_chi2(p, shape * 2.0, ln_gamma_shape) * 0.5 * scale;
+}
diff --git a/redis-stable/deps/jemalloc/test/include/test/mq.h b/redis-stable/deps/jemalloc/test/include/test/mq.h
new file mode 100644
index 00000000..af2c078d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/mq.h
@@ -0,0 +1,107 @@
+void	mq_nanosleep(unsigned ns);
+
+/*
+ * Simple templated message queue implementation that relies on only mutexes for
+ * synchronization (which reduces portability issues).  Given the following
+ * setup:
+ *
+ *   typedef struct mq_msg_s mq_msg_t;
+ *   struct mq_msg_s {
+ *           mq_msg(mq_msg_t) link;
+ *           [message data]
+ *   };
+ *   mq_gen(, mq_, mq_t, mq_msg_t, link)
+ *
+ * The API is as follows:
+ *
+ *   bool mq_init(mq_t *mq);
+ *   void mq_fini(mq_t *mq);
+ *   unsigned mq_count(mq_t *mq);
+ *   mq_msg_t *mq_tryget(mq_t *mq);
+ *   mq_msg_t *mq_get(mq_t *mq);
+ *   void mq_put(mq_t *mq, mq_msg_t *msg);
+ *
+ * The message queue linkage embedded in each message is to be treated as
+ * externally opaque (no need to initialize or clean up externally).  mq_fini()
+ * does not perform any cleanup of messages, since it knows nothing of their
+ * payloads.
+ */
+#define mq_msg(a_mq_msg_type)	ql_elm(a_mq_msg_type)
+
+#define mq_gen(a_attr, a_prefix, a_mq_type, a_mq_msg_type, a_field)	\
+typedef struct {							\
+	mtx_t			lock;					\
+	ql_head(a_mq_msg_type)	msgs;					\
+	unsigned		count;					\
+} a_mq_type;								\
+a_attr bool								\
+a_prefix##init(a_mq_type *mq) {						\
+									\
+	if (mtx_init(&mq->lock)) {					\
+		return true;						\
+	}								\
+	ql_new(&mq->msgs);						\
+	mq->count = 0;							\
+	return false;							\
+}									\
+a_attr void								\
+a_prefix##fini(a_mq_type *mq) {						\
+	mtx_fini(&mq->lock);						\
+}									\
+a_attr unsigned								\
+a_prefix##count(a_mq_type *mq) {					\
+	unsigned count;							\
+									\
+	mtx_lock(&mq->lock);						\
+	count = mq->count;						\
+	mtx_unlock(&mq->lock);						\
+	return count;							\
+}									\
+a_attr a_mq_msg_type *							\
+a_prefix##tryget(a_mq_type *mq) {					\
+	a_mq_msg_type *msg;						\
+									\
+	mtx_lock(&mq->lock);						\
+	msg = ql_first(&mq->msgs);					\
+	if (msg != NULL) {						\
+		ql_head_remove(&mq->msgs, a_mq_msg_type, a_field);	\
+		mq->count--;						\
+	}								\
+	mtx_unlock(&mq->lock);						\
+	return msg;							\
+}									\
+a_attr a_mq_msg_type *							\
+a_prefix##get(a_mq_type *mq) {						\
+	a_mq_msg_type *msg;						\
+	unsigned ns;							\
+									\
+	msg = a_prefix##tryget(mq);					\
+	if (msg != NULL) {						\
+		return msg;						\
+	}								\
+									\
+	ns = 1;								\
+	while (true) {							\
+		mq_nanosleep(ns);					\
+		msg = a_prefix##tryget(mq);				\
+		if (msg != NULL) {					\
+			return msg;					\
+		}							\
+		if (ns < 1000*1000*1000) {				\
+			/* Double sleep time, up to max 1 second. */	\
+			ns <<= 1;					\
+			if (ns > 1000*1000*1000) {			\
+				ns = 1000*1000*1000;			\
+			}						\
+		}							\
+	}								\
+}									\
+a_attr void								\
+a_prefix##put(a_mq_type *mq, a_mq_msg_type *msg) {			\
+									\
+	mtx_lock(&mq->lock);						\
+	ql_elm_new(msg, a_field);					\
+	ql_tail_insert(&mq->msgs, msg, a_field);			\
+	mq->count++;							\
+	mtx_unlock(&mq->lock);						\
+}
diff --git a/redis-stable/deps/jemalloc/test/include/test/mtx.h b/redis-stable/deps/jemalloc/test/include/test/mtx.h
new file mode 100644
index 00000000..58afbc3d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/mtx.h
@@ -0,0 +1,23 @@
+/*
+ * mtx is a slightly simplified version of malloc_mutex.  This code duplication
+ * is unfortunate, but there are allocator bootstrapping considerations that
+ * would leak into the test infrastructure if malloc_mutex were used directly
+ * in tests.
+ */
+
+typedef struct {
+#ifdef _WIN32
+	CRITICAL_SECTION	lock;
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+	os_unfair_lock		lock;
+#elif (defined(JEMALLOC_OSSPIN))
+	OSSpinLock		lock;
+#else
+	pthread_mutex_t		lock;
+#endif
+} mtx_t;
+
+bool	mtx_init(mtx_t *mtx);
+void	mtx_fini(mtx_t *mtx);
+void	mtx_lock(mtx_t *mtx);
+void	mtx_unlock(mtx_t *mtx);
diff --git a/redis-stable/deps/jemalloc/test/include/test/test.h b/redis-stable/deps/jemalloc/test/include/test/test.h
new file mode 100644
index 00000000..fd0e5265
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/test.h
@@ -0,0 +1,338 @@
+#define ASSERT_BUFSIZE	256
+
+#define assert_cmp(t, a, b, cmp, neg_cmp, pri, ...) do {		\
+	t a_ = (a);							\
+	t b_ = (b);							\
+	if (!(a_ cmp b_)) {						\
+		char prefix[ASSERT_BUFSIZE];				\
+		char message[ASSERT_BUFSIZE];				\
+		malloc_snprintf(prefix, sizeof(prefix),			\
+		    "%s:%s:%d: Failed assertion: "			\
+		    "(%s) " #cmp " (%s) --> "				\
+		    "%" pri " " #neg_cmp " %" pri ": ",			\
+		    __func__, __FILE__, __LINE__,			\
+		    #a, #b, a_, b_);					\
+		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
+		p_test_fail(prefix, message);				\
+	}								\
+} while (0)
+
+#define assert_ptr_eq(a, b, ...)	assert_cmp(void *, a, b, ==,	\
+    !=, "p", __VA_ARGS__)
+#define assert_ptr_ne(a, b, ...)	assert_cmp(void *, a, b, !=,	\
+    ==, "p", __VA_ARGS__)
+#define assert_ptr_null(a, ...)		assert_cmp(void *, a, NULL, ==,	\
+    !=, "p", __VA_ARGS__)
+#define assert_ptr_not_null(a, ...)	assert_cmp(void *, a, NULL, !=,	\
+    ==, "p", __VA_ARGS__)
+
+#define assert_c_eq(a, b, ...)	assert_cmp(char, a, b, ==, !=, "c", __VA_ARGS__)
+#define assert_c_ne(a, b, ...)	assert_cmp(char, a, b, !=, ==, "c", __VA_ARGS__)
+#define assert_c_lt(a, b, ...)	assert_cmp(char, a, b, <, >=, "c", __VA_ARGS__)
+#define assert_c_le(a, b, ...)	assert_cmp(char, a, b, <=, >, "c", __VA_ARGS__)
+#define assert_c_ge(a, b, ...)	assert_cmp(char, a, b, >=, <, "c", __VA_ARGS__)
+#define assert_c_gt(a, b, ...)	assert_cmp(char, a, b, >, <=, "c", __VA_ARGS__)
+
+#define assert_x_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "#x", __VA_ARGS__)
+#define assert_x_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "#x", __VA_ARGS__)
+#define assert_x_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "#x", __VA_ARGS__)
+#define assert_x_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "#x", __VA_ARGS__)
+#define assert_x_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "#x", __VA_ARGS__)
+#define assert_x_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "#x", __VA_ARGS__)
+
+#define assert_d_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "d", __VA_ARGS__)
+#define assert_d_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "d", __VA_ARGS__)
+#define assert_d_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "d", __VA_ARGS__)
+#define assert_d_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "d", __VA_ARGS__)
+#define assert_d_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "d", __VA_ARGS__)
+#define assert_d_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "d", __VA_ARGS__)
+
+#define assert_u_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "u", __VA_ARGS__)
+#define assert_u_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "u", __VA_ARGS__)
+#define assert_u_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "u", __VA_ARGS__)
+#define assert_u_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "u", __VA_ARGS__)
+#define assert_u_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "u", __VA_ARGS__)
+#define assert_u_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "u", __VA_ARGS__)
+
+#define assert_ld_eq(a, b, ...)	assert_cmp(long, a, b, ==,	\
+    !=, "ld", __VA_ARGS__)
+#define assert_ld_ne(a, b, ...)	assert_cmp(long, a, b, !=,	\
+    ==, "ld", __VA_ARGS__)
+#define assert_ld_lt(a, b, ...)	assert_cmp(long, a, b, <,	\
+    >=, "ld", __VA_ARGS__)
+#define assert_ld_le(a, b, ...)	assert_cmp(long, a, b, <=,	\
+    >, "ld", __VA_ARGS__)
+#define assert_ld_ge(a, b, ...)	assert_cmp(long, a, b, >=,	\
+    <, "ld", __VA_ARGS__)
+#define assert_ld_gt(a, b, ...)	assert_cmp(long, a, b, >,	\
+    <=, "ld", __VA_ARGS__)
+
+#define assert_lu_eq(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, ==, !=, "lu", __VA_ARGS__)
+#define assert_lu_ne(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, !=, ==, "lu", __VA_ARGS__)
+#define assert_lu_lt(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, <, >=, "lu", __VA_ARGS__)
+#define assert_lu_le(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, <=, >, "lu", __VA_ARGS__)
+#define assert_lu_ge(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, >=, <, "lu", __VA_ARGS__)
+#define assert_lu_gt(a, b, ...)	assert_cmp(unsigned long,	\
+    a, b, >, <=, "lu", __VA_ARGS__)
+
+#define assert_qd_eq(a, b, ...)	assert_cmp(long long, a, b, ==,	\
+    !=, "qd", __VA_ARGS__)
+#define assert_qd_ne(a, b, ...)	assert_cmp(long long, a, b, !=,	\
+    ==, "qd", __VA_ARGS__)
+#define assert_qd_lt(a, b, ...)	assert_cmp(long long, a, b, <,	\
+    >=, "qd", __VA_ARGS__)
+#define assert_qd_le(a, b, ...)	assert_cmp(long long, a, b, <=,	\
+    >, "qd", __VA_ARGS__)
+#define assert_qd_ge(a, b, ...)	assert_cmp(long long, a, b, >=,	\
+    <, "qd", __VA_ARGS__)
+#define assert_qd_gt(a, b, ...)	assert_cmp(long long, a, b, >,	\
+    <=, "qd", __VA_ARGS__)
+
+#define assert_qu_eq(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, ==, !=, "qu", __VA_ARGS__)
+#define assert_qu_ne(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, !=, ==, "qu", __VA_ARGS__)
+#define assert_qu_lt(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, <, >=, "qu", __VA_ARGS__)
+#define assert_qu_le(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, <=, >, "qu", __VA_ARGS__)
+#define assert_qu_ge(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, >=, <, "qu", __VA_ARGS__)
+#define assert_qu_gt(a, b, ...)	assert_cmp(unsigned long long,	\
+    a, b, >, <=, "qu", __VA_ARGS__)
+
+#define assert_jd_eq(a, b, ...)	assert_cmp(intmax_t, a, b, ==,	\
+    !=, "jd", __VA_ARGS__)
+#define assert_jd_ne(a, b, ...)	assert_cmp(intmax_t, a, b, !=,	\
+    ==, "jd", __VA_ARGS__)
+#define assert_jd_lt(a, b, ...)	assert_cmp(intmax_t, a, b, <,	\
+    >=, "jd", __VA_ARGS__)
+#define assert_jd_le(a, b, ...)	assert_cmp(intmax_t, a, b, <=,	\
+    >, "jd", __VA_ARGS__)
+#define assert_jd_ge(a, b, ...)	assert_cmp(intmax_t, a, b, >=,	\
+    <, "jd", __VA_ARGS__)
+#define assert_jd_gt(a, b, ...)	assert_cmp(intmax_t, a, b, >,	\
+    <=, "jd", __VA_ARGS__)
+
+#define assert_ju_eq(a, b, ...)	assert_cmp(uintmax_t, a, b, ==,	\
+    !=, "ju", __VA_ARGS__)
+#define assert_ju_ne(a, b, ...)	assert_cmp(uintmax_t, a, b, !=,	\
+    ==, "ju", __VA_ARGS__)
+#define assert_ju_lt(a, b, ...)	assert_cmp(uintmax_t, a, b, <,	\
+    >=, "ju", __VA_ARGS__)
+#define assert_ju_le(a, b, ...)	assert_cmp(uintmax_t, a, b, <=,	\
+    >, "ju", __VA_ARGS__)
+#define assert_ju_ge(a, b, ...)	assert_cmp(uintmax_t, a, b, >=,	\
+    <, "ju", __VA_ARGS__)
+#define assert_ju_gt(a, b, ...)	assert_cmp(uintmax_t, a, b, >,	\
+    <=, "ju", __VA_ARGS__)
+
+#define assert_zd_eq(a, b, ...)	assert_cmp(ssize_t, a, b, ==,	\
+    !=, "zd", __VA_ARGS__)
+#define assert_zd_ne(a, b, ...)	assert_cmp(ssize_t, a, b, !=,	\
+    ==, "zd", __VA_ARGS__)
+#define assert_zd_lt(a, b, ...)	assert_cmp(ssize_t, a, b, <,	\
+    >=, "zd", __VA_ARGS__)
+#define assert_zd_le(a, b, ...)	assert_cmp(ssize_t, a, b, <=,	\
+    >, "zd", __VA_ARGS__)
+#define assert_zd_ge(a, b, ...)	assert_cmp(ssize_t, a, b, >=,	\
+    <, "zd", __VA_ARGS__)
+#define assert_zd_gt(a, b, ...)	assert_cmp(ssize_t, a, b, >,	\
+    <=, "zd", __VA_ARGS__)
+
+#define assert_zu_eq(a, b, ...)	assert_cmp(size_t, a, b, ==,	\
+    !=, "zu", __VA_ARGS__)
+#define assert_zu_ne(a, b, ...)	assert_cmp(size_t, a, b, !=,	\
+    ==, "zu", __VA_ARGS__)
+#define assert_zu_lt(a, b, ...)	assert_cmp(size_t, a, b, <,	\
+    >=, "zu", __VA_ARGS__)
+#define assert_zu_le(a, b, ...)	assert_cmp(size_t, a, b, <=,	\
+    >, "zu", __VA_ARGS__)
+#define assert_zu_ge(a, b, ...)	assert_cmp(size_t, a, b, >=,	\
+    <, "zu", __VA_ARGS__)
+#define assert_zu_gt(a, b, ...)	assert_cmp(size_t, a, b, >,	\
+    <=, "zu", __VA_ARGS__)
+
+#define assert_d32_eq(a, b, ...)	assert_cmp(int32_t, a, b, ==,	\
+    !=, FMTd32, __VA_ARGS__)
+#define assert_d32_ne(a, b, ...)	assert_cmp(int32_t, a, b, !=,	\
+    ==, FMTd32, __VA_ARGS__)
+#define assert_d32_lt(a, b, ...)	assert_cmp(int32_t, a, b, <,	\
+    >=, FMTd32, __VA_ARGS__)
+#define assert_d32_le(a, b, ...)	assert_cmp(int32_t, a, b, <=,	\
+    >, FMTd32, __VA_ARGS__)
+#define assert_d32_ge(a, b, ...)	assert_cmp(int32_t, a, b, >=,	\
+    <, FMTd32, __VA_ARGS__)
+#define assert_d32_gt(a, b, ...)	assert_cmp(int32_t, a, b, >,	\
+    <=, FMTd32, __VA_ARGS__)
+
+#define assert_u32_eq(a, b, ...)	assert_cmp(uint32_t, a, b, ==,	\
+    !=, FMTu32, __VA_ARGS__)
+#define assert_u32_ne(a, b, ...)	assert_cmp(uint32_t, a, b, !=,	\
+    ==, FMTu32, __VA_ARGS__)
+#define assert_u32_lt(a, b, ...)	assert_cmp(uint32_t, a, b, <,	\
+    >=, FMTu32, __VA_ARGS__)
+#define assert_u32_le(a, b, ...)	assert_cmp(uint32_t, a, b, <=,	\
+    >, FMTu32, __VA_ARGS__)
+#define assert_u32_ge(a, b, ...)	assert_cmp(uint32_t, a, b, >=,	\
+    <, FMTu32, __VA_ARGS__)
+#define assert_u32_gt(a, b, ...)	assert_cmp(uint32_t, a, b, >,	\
+    <=, FMTu32, __VA_ARGS__)
+
+#define assert_d64_eq(a, b, ...)	assert_cmp(int64_t, a, b, ==,	\
+    !=, FMTd64, __VA_ARGS__)
+#define assert_d64_ne(a, b, ...)	assert_cmp(int64_t, a, b, !=,	\
+    ==, FMTd64, __VA_ARGS__)
+#define assert_d64_lt(a, b, ...)	assert_cmp(int64_t, a, b, <,	\
+    >=, FMTd64, __VA_ARGS__)
+#define assert_d64_le(a, b, ...)	assert_cmp(int64_t, a, b, <=,	\
+    >, FMTd64, __VA_ARGS__)
+#define assert_d64_ge(a, b, ...)	assert_cmp(int64_t, a, b, >=,	\
+    <, FMTd64, __VA_ARGS__)
+#define assert_d64_gt(a, b, ...)	assert_cmp(int64_t, a, b, >,	\
+    <=, FMTd64, __VA_ARGS__)
+
+#define assert_u64_eq(a, b, ...)	assert_cmp(uint64_t, a, b, ==,	\
+    !=, FMTu64, __VA_ARGS__)
+#define assert_u64_ne(a, b, ...)	assert_cmp(uint64_t, a, b, !=,	\
+    ==, FMTu64, __VA_ARGS__)
+#define assert_u64_lt(a, b, ...)	assert_cmp(uint64_t, a, b, <,	\
+    >=, FMTu64, __VA_ARGS__)
+#define assert_u64_le(a, b, ...)	assert_cmp(uint64_t, a, b, <=,	\
+    >, FMTu64, __VA_ARGS__)
+#define assert_u64_ge(a, b, ...)	assert_cmp(uint64_t, a, b, >=,	\
+    <, FMTu64, __VA_ARGS__)
+#define assert_u64_gt(a, b, ...)	assert_cmp(uint64_t, a, b, >,	\
+    <=, FMTu64, __VA_ARGS__)
+
+#define assert_b_eq(a, b, ...) do {					\
+	bool a_ = (a);							\
+	bool b_ = (b);							\
+	if (!(a_ == b_)) {						\
+		char prefix[ASSERT_BUFSIZE];				\
+		char message[ASSERT_BUFSIZE];				\
+		malloc_snprintf(prefix, sizeof(prefix),			\
+		    "%s:%s:%d: Failed assertion: "			\
+		    "(%s) == (%s) --> %s != %s: ",			\
+		    __func__, __FILE__, __LINE__,			\
+		    #a, #b, a_ ? "true" : "false",			\
+		    b_ ? "true" : "false");				\
+		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
+		p_test_fail(prefix, message);				\
+	}								\
+} while (0)
+#define assert_b_ne(a, b, ...) do {					\
+	bool a_ = (a);							\
+	bool b_ = (b);							\
+	if (!(a_ != b_)) {						\
+		char prefix[ASSERT_BUFSIZE];				\
+		char message[ASSERT_BUFSIZE];				\
+		malloc_snprintf(prefix, sizeof(prefix),			\
+		    "%s:%s:%d: Failed assertion: "			\
+		    "(%s) != (%s) --> %s == %s: ",			\
+		    __func__, __FILE__, __LINE__,			\
+		    #a, #b, a_ ? "true" : "false",			\
+		    b_ ? "true" : "false");				\
+		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
+		p_test_fail(prefix, message);				\
+	}								\
+} while (0)
+#define assert_true(a, ...)	assert_b_eq(a, true, __VA_ARGS__)
+#define assert_false(a, ...)	assert_b_eq(a, false, __VA_ARGS__)
+
+#define assert_str_eq(a, b, ...) do {				\
+	if (strcmp((a), (b))) {						\
+		char prefix[ASSERT_BUFSIZE];				\
+		char message[ASSERT_BUFSIZE];				\
+		malloc_snprintf(prefix, sizeof(prefix),			\
+		    "%s:%s:%d: Failed assertion: "			\
+		    "(%s) same as (%s) --> "				\
+		    "\"%s\" differs from \"%s\": ",			\
+		    __func__, __FILE__, __LINE__, #a, #b, a, b);	\
+		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
+		p_test_fail(prefix, message);				\
+	}								\
+} while (0)
+#define assert_str_ne(a, b, ...) do {				\
+	if (!strcmp((a), (b))) {					\
+		char prefix[ASSERT_BUFSIZE];				\
+		char message[ASSERT_BUFSIZE];				\
+		malloc_snprintf(prefix, sizeof(prefix),			\
+		    "%s:%s:%d: Failed assertion: "			\
+		    "(%s) differs from (%s) --> "			\
+		    "\"%s\" same as \"%s\": ",				\
+		    __func__, __FILE__, __LINE__, #a, #b, a, b);	\
+		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
+		p_test_fail(prefix, message);				\
+	}								\
+} while (0)
+
+#define assert_not_reached(...) do {					\
+	char prefix[ASSERT_BUFSIZE];					\
+	char message[ASSERT_BUFSIZE];					\
+	malloc_snprintf(prefix, sizeof(prefix),				\
+	    "%s:%s:%d: Unreachable code reached: ",			\
+	    __func__, __FILE__, __LINE__);				\
+	malloc_snprintf(message, sizeof(message), __VA_ARGS__);		\
+	p_test_fail(prefix, message);					\
+} while (0)
+
+/*
+ * If this enum changes, corresponding changes in test/test.sh.in are also
+ * necessary.
+ */
+typedef enum {
+	test_status_pass = 0,
+	test_status_skip = 1,
+	test_status_fail = 2,
+
+	test_status_count = 3
+} test_status_t;
+
+typedef void (test_t)(void);
+
+#define TEST_BEGIN(f)							\
+static void								\
+f(void) {								\
+	p_test_init(#f);
+
+#define TEST_END							\
+	goto label_test_end;						\
+label_test_end:								\
+	p_test_fini();							\
+}
+
+#define test(...)							\
+	p_test(__VA_ARGS__, NULL)
+
+#define test_no_reentrancy(...)							\
+	p_test_no_reentrancy(__VA_ARGS__, NULL)
+
+#define test_no_malloc_init(...)					\
+	p_test_no_malloc_init(__VA_ARGS__, NULL)
+
+#define test_skip_if(e) do {						\
+	if (e) {							\
+		test_skip("%s:%s:%d: Test skipped: (%s)",		\
+		    __func__, __FILE__, __LINE__, #e);			\
+		goto label_test_end;					\
+	}								\
+} while (0)
+
+bool test_is_reentrant();
+
+void	test_skip(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
+void	test_fail(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
+
+/* For private use by macros. */
+test_status_t	p_test(test_t *t, ...);
+test_status_t	p_test_no_reentrancy(test_t *t, ...);
+test_status_t	p_test_no_malloc_init(test_t *t, ...);
+void	p_test_init(const char *name);
+void	p_test_fini(void);
+void	p_test_fail(const char *prefix, const char *message);
diff --git a/redis-stable/deps/jemalloc/test/include/test/thd.h b/redis-stable/deps/jemalloc/test/include/test/thd.h
new file mode 100644
index 00000000..47a51262
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/thd.h
@@ -0,0 +1,9 @@
+/* Abstraction layer for threading in tests. */
+#ifdef _WIN32
+typedef HANDLE thd_t;
+#else
+typedef pthread_t thd_t;
+#endif
+
+void	thd_create(thd_t *thd, void *(*proc)(void *), void *arg);
+void	thd_join(thd_t thd, void **ret);
diff --git a/redis-stable/deps/jemalloc/test/include/test/timer.h b/redis-stable/deps/jemalloc/test/include/test/timer.h
new file mode 100644
index 00000000..ace6191b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/include/test/timer.h
@@ -0,0 +1,11 @@
+/* Simple timer, for use in benchmark reporting. */
+
+typedef struct {
+	nstime_t t0;
+	nstime_t t1;
+} timedelta_t;
+
+void	timer_start(timedelta_t *timer);
+void	timer_stop(timedelta_t *timer);
+uint64_t	timer_usec(const timedelta_t *timer);
+void	timer_ratio(timedelta_t *a, timedelta_t *b, char *buf, size_t buflen);
diff --git a/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c b/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
new file mode 100644
index 00000000..222164d6
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
@@ -0,0 +1,66 @@
+#include "test/jemalloc_test.h"
+
+#define NTHREADS 10
+
+static bool have_dss =
+#ifdef JEMALLOC_DSS
+    true
+#else
+    false
+#endif
+    ;
+
+void *
+thd_start(void *arg) {
+	unsigned thread_ind = (unsigned)(uintptr_t)arg;
+	unsigned arena_ind;
+	void *p;
+	size_t sz;
+
+	sz = sizeof(arena_ind);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Error in arenas.create");
+
+	if (thread_ind % 4 != 3) {
+		size_t mib[3];
+		size_t miblen = sizeof(mib) / sizeof(size_t);
+		const char *dss_precs[] = {"disabled", "primary", "secondary"};
+		unsigned prec_ind = thread_ind %
+		    (sizeof(dss_precs)/sizeof(char*));
+		const char *dss = dss_precs[prec_ind];
+		int expected_err = (have_dss || prec_ind == 0) ? 0 : EFAULT;
+		assert_d_eq(mallctlnametomib("arena.0.dss", mib, &miblen), 0,
+		    "Error in mallctlnametomib()");
+		mib[1] = arena_ind;
+		assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&dss,
+		    sizeof(const char *)), expected_err,
+		    "Error in mallctlbymib()");
+	}
+
+	p = mallocx(1, MALLOCX_ARENA(arena_ind));
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	dallocx(p, 0);
+
+	return NULL;
+}
+
+TEST_BEGIN(test_MALLOCX_ARENA) {
+	thd_t thds[NTHREADS];
+	unsigned i;
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_create(&thds[i], thd_start,
+		    (void *)(uintptr_t)i);
+	}
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_join(thds[i], NULL);
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_MALLOCX_ARENA);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c b/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
new file mode 100644
index 00000000..536b67ea
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
@@ -0,0 +1,133 @@
+#include "test/jemalloc_test.h"
+
+#define MAXALIGN (((size_t)1) << 23)
+
+/*
+ * On systems which can't merge extents, tests that call this function generate
+ * a lot of dirty memory very quickly.  Purging between cycles mitigates
+ * potential OOM on e.g. 32-bit Windows.
+ */
+static void
+purge(void) {
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl error");
+}
+
+TEST_BEGIN(test_alignment_errors) {
+	size_t alignment;
+	void *p;
+
+	alignment = 0;
+	set_errno(0);
+	p = aligned_alloc(alignment, 1);
+	assert_false(p != NULL || get_errno() != EINVAL,
+	    "Expected error for invalid alignment %zu", alignment);
+
+	for (alignment = sizeof(size_t); alignment < MAXALIGN;
+	    alignment <<= 1) {
+		set_errno(0);
+		p = aligned_alloc(alignment + 1, 1);
+		assert_false(p != NULL || get_errno() != EINVAL,
+		    "Expected error for invalid alignment %zu",
+		    alignment + 1);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_oom_errors) {
+	size_t alignment, size;
+	void *p;
+
+#if LG_SIZEOF_PTR == 3
+	alignment = UINT64_C(0x8000000000000000);
+	size      = UINT64_C(0x8000000000000000);
+#else
+	alignment = 0x80000000LU;
+	size      = 0x80000000LU;
+#endif
+	set_errno(0);
+	p = aligned_alloc(alignment, size);
+	assert_false(p != NULL || get_errno() != ENOMEM,
+	    "Expected error for aligned_alloc(%zu, %zu)",
+	    alignment, size);
+
+#if LG_SIZEOF_PTR == 3
+	alignment = UINT64_C(0x4000000000000000);
+	size      = UINT64_C(0xc000000000000001);
+#else
+	alignment = 0x40000000LU;
+	size      = 0xc0000001LU;
+#endif
+	set_errno(0);
+	p = aligned_alloc(alignment, size);
+	assert_false(p != NULL || get_errno() != ENOMEM,
+	    "Expected error for aligned_alloc(%zu, %zu)",
+	    alignment, size);
+
+	alignment = 0x10LU;
+#if LG_SIZEOF_PTR == 3
+	size = UINT64_C(0xfffffffffffffff0);
+#else
+	size = 0xfffffff0LU;
+#endif
+	set_errno(0);
+	p = aligned_alloc(alignment, size);
+	assert_false(p != NULL || get_errno() != ENOMEM,
+	    "Expected error for aligned_alloc(&p, %zu, %zu)",
+	    alignment, size);
+}
+TEST_END
+
+TEST_BEGIN(test_alignment_and_size) {
+#define NITER 4
+	size_t alignment, size, total;
+	unsigned i;
+	void *ps[NITER];
+
+	for (i = 0; i < NITER; i++) {
+		ps[i] = NULL;
+	}
+
+	for (alignment = 8;
+	    alignment <= MAXALIGN;
+	    alignment <<= 1) {
+		total = 0;
+		for (size = 1;
+		    size < 3 * alignment && size < (1U << 31);
+		    size += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
+			for (i = 0; i < NITER; i++) {
+				ps[i] = aligned_alloc(alignment, size);
+				if (ps[i] == NULL) {
+					char buf[BUFERROR_BUF];
+
+					buferror(get_errno(), buf, sizeof(buf));
+					test_fail(
+					    "Error for alignment=%zu, "
+					    "size=%zu (%#zx): %s",
+					    alignment, size, size, buf);
+				}
+				total += malloc_usable_size(ps[i]);
+				if (total >= (MAXALIGN << 1)) {
+					break;
+				}
+			}
+			for (i = 0; i < NITER; i++) {
+				if (ps[i] != NULL) {
+					free(ps[i]);
+					ps[i] = NULL;
+				}
+			}
+		}
+		purge();
+	}
+#undef NITER
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_alignment_errors,
+	    test_oom_errors,
+	    test_alignment_and_size);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/allocated.c b/redis-stable/deps/jemalloc/test/integration/allocated.c
new file mode 100644
index 00000000..1425fd0a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/allocated.c
@@ -0,0 +1,124 @@
+#include "test/jemalloc_test.h"
+
+static const bool config_stats =
+#ifdef JEMALLOC_STATS
+    true
+#else
+    false
+#endif
+    ;
+
+void *
+thd_start(void *arg) {
+	int err;
+	void *p;
+	uint64_t a0, a1, d0, d1;
+	uint64_t *ap0, *ap1, *dp0, *dp1;
+	size_t sz, usize;
+
+	sz = sizeof(a0);
+	if ((err = mallctl("thread.allocated", (void *)&a0, &sz, NULL, 0))) {
+		if (err == ENOENT) {
+			goto label_ENOENT;
+		}
+		test_fail("%s(): Error in mallctl(): %s", __func__,
+		    strerror(err));
+	}
+	sz = sizeof(ap0);
+	if ((err = mallctl("thread.allocatedp", (void *)&ap0, &sz, NULL, 0))) {
+		if (err == ENOENT) {
+			goto label_ENOENT;
+		}
+		test_fail("%s(): Error in mallctl(): %s", __func__,
+		    strerror(err));
+	}
+	assert_u64_eq(*ap0, a0,
+	    "\"thread.allocatedp\" should provide a pointer to internal "
+	    "storage");
+
+	sz = sizeof(d0);
+	if ((err = mallctl("thread.deallocated", (void *)&d0, &sz, NULL, 0))) {
+		if (err == ENOENT) {
+			goto label_ENOENT;
+		}
+		test_fail("%s(): Error in mallctl(): %s", __func__,
+		    strerror(err));
+	}
+	sz = sizeof(dp0);
+	if ((err = mallctl("thread.deallocatedp", (void *)&dp0, &sz, NULL,
+	    0))) {
+		if (err == ENOENT) {
+			goto label_ENOENT;
+		}
+		test_fail("%s(): Error in mallctl(): %s", __func__,
+		    strerror(err));
+	}
+	assert_u64_eq(*dp0, d0,
+	    "\"thread.deallocatedp\" should provide a pointer to internal "
+	    "storage");
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Unexpected malloc() error");
+
+	sz = sizeof(a1);
+	mallctl("thread.allocated", (void *)&a1, &sz, NULL, 0);
+	sz = sizeof(ap1);
+	mallctl("thread.allocatedp", (void *)&ap1, &sz, NULL, 0);
+	assert_u64_eq(*ap1, a1,
+	    "Dereferenced \"thread.allocatedp\" value should equal "
+	    "\"thread.allocated\" value");
+	assert_ptr_eq(ap0, ap1,
+	    "Pointer returned by \"thread.allocatedp\" should not change");
+
+	usize = malloc_usable_size(p);
+	assert_u64_le(a0 + usize, a1,
+	    "Allocated memory counter should increase by at least the amount "
+	    "explicitly allocated");
+
+	free(p);
+
+	sz = sizeof(d1);
+	mallctl("thread.deallocated", (void *)&d1, &sz, NULL, 0);
+	sz = sizeof(dp1);
+	mallctl("thread.deallocatedp", (void *)&dp1, &sz, NULL, 0);
+	assert_u64_eq(*dp1, d1,
+	    "Dereferenced \"thread.deallocatedp\" value should equal "
+	    "\"thread.deallocated\" value");
+	assert_ptr_eq(dp0, dp1,
+	    "Pointer returned by \"thread.deallocatedp\" should not change");
+
+	assert_u64_le(d0 + usize, d1,
+	    "Deallocated memory counter should increase by at least the amount "
+	    "explicitly deallocated");
+
+	return NULL;
+label_ENOENT:
+	assert_false(config_stats,
+	    "ENOENT should only be returned if stats are disabled");
+	test_skip("\"thread.allocated\" mallctl not available");
+	return NULL;
+}
+
+TEST_BEGIN(test_main_thread) {
+	thd_start(NULL);
+}
+TEST_END
+
+TEST_BEGIN(test_subthread) {
+	thd_t thd;
+
+	thd_create(&thd, thd_start, NULL);
+	thd_join(thd, NULL);
+}
+TEST_END
+
+int
+main(void) {
+	/* Run tests multiple times to check for bad interactions. */
+	return test(
+	    test_main_thread,
+	    test_subthread,
+	    test_main_thread,
+	    test_subthread,
+	    test_main_thread);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/extent.c b/redis-stable/deps/jemalloc/test/integration/extent.c
new file mode 100644
index 00000000..b5db0876
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/extent.c
@@ -0,0 +1,248 @@
+#include "test/jemalloc_test.h"
+
+#include "test/extent_hooks.h"
+
+static bool
+check_background_thread_enabled(void) {
+	bool enabled;
+	size_t sz = sizeof(bool);
+	int ret = mallctl("background_thread", (void *)&enabled, &sz, NULL,0);
+	if (ret == ENOENT) {
+		return false;
+	}
+	assert_d_eq(ret, 0, "Unexpected mallctl error");
+	return enabled;
+}
+
+static void
+test_extent_body(unsigned arena_ind) {
+	void *p;
+	size_t large0, large1, large2, sz;
+	size_t purge_mib[3];
+	size_t purge_miblen;
+	int flags;
+	bool xallocx_success_a, xallocx_success_b, xallocx_success_c;
+
+	flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
+
+	/* Get large size classes. */
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
+	    0), 0, "Unexpected arenas.lextent.0.size failure");
+	assert_d_eq(mallctl("arenas.lextent.1.size", (void *)&large1, &sz, NULL,
+	    0), 0, "Unexpected arenas.lextent.1.size failure");
+	assert_d_eq(mallctl("arenas.lextent.2.size", (void *)&large2, &sz, NULL,
+	    0), 0, "Unexpected arenas.lextent.2.size failure");
+
+	/* Test dalloc/decommit/purge cascade. */
+	purge_miblen = sizeof(purge_mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.purge", purge_mib, &purge_miblen),
+	    0, "Unexpected mallctlnametomib() failure");
+	purge_mib[1] = (size_t)arena_ind;
+	called_alloc = false;
+	try_alloc = true;
+	try_dalloc = false;
+	try_decommit = false;
+	p = mallocx(large0 * 2, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	assert_true(called_alloc, "Expected alloc call");
+	called_dalloc = false;
+	called_decommit = false;
+	did_purge_lazy = false;
+	did_purge_forced = false;
+	called_split = false;
+	xallocx_success_a = (xallocx(p, large0, 0, flags) == large0);
+	assert_d_eq(mallctlbymib(purge_mib, purge_miblen, NULL, NULL, NULL, 0),
+	    0, "Unexpected arena.%u.purge error", arena_ind);
+	if (xallocx_success_a) {
+		assert_true(called_dalloc, "Expected dalloc call");
+		assert_true(called_decommit, "Expected decommit call");
+		assert_true(did_purge_lazy || did_purge_forced,
+		    "Expected purge");
+	}
+	assert_true(called_split, "Expected split call");
+	dallocx(p, flags);
+	try_dalloc = true;
+
+	/* Test decommit/commit and observe split/merge. */
+	try_dalloc = false;
+	try_decommit = true;
+	p = mallocx(large0 * 2, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	did_decommit = false;
+	did_commit = false;
+	called_split = false;
+	did_split = false;
+	did_merge = false;
+	xallocx_success_b = (xallocx(p, large0, 0, flags) == large0);
+	assert_d_eq(mallctlbymib(purge_mib, purge_miblen, NULL, NULL, NULL, 0),
+	    0, "Unexpected arena.%u.purge error", arena_ind);
+	if (xallocx_success_b) {
+		assert_true(did_split, "Expected split");
+	}
+	xallocx_success_c = (xallocx(p, large0 * 2, 0, flags) == large0 * 2);
+	if (did_split) {
+		assert_b_eq(did_decommit, did_commit,
+		    "Expected decommit/commit match");
+	}
+	if (xallocx_success_b && xallocx_success_c) {
+		assert_true(did_merge, "Expected merge");
+	}
+	dallocx(p, flags);
+	try_dalloc = true;
+	try_decommit = false;
+
+	/* Make sure non-large allocation succeeds. */
+	p = mallocx(42, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	dallocx(p, flags);
+}
+
+static void
+test_manual_hook_auto_arena(void) {
+	unsigned narenas;
+	size_t old_size, new_size, sz;
+	size_t hooks_mib[3];
+	size_t hooks_miblen;
+	extent_hooks_t *new_hooks, *old_hooks;
+
+	extent_hooks_prep();
+
+	sz = sizeof(unsigned);
+	/* Get number of auto arenas. */
+	assert_d_eq(mallctl("opt.narenas", (void *)&narenas, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	if (narenas == 1) {
+		return;
+	}
+
+	/* Install custom extent hooks on arena 1 (might not be initialized). */
+	hooks_miblen = sizeof(hooks_mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.extent_hooks", hooks_mib,
+	    &hooks_miblen), 0, "Unexpected mallctlnametomib() failure");
+	hooks_mib[1] = 1;
+	old_size = sizeof(extent_hooks_t *);
+	new_hooks = &hooks;
+	new_size = sizeof(extent_hooks_t *);
+	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
+	    &old_size, (void *)&new_hooks, new_size), 0,
+	    "Unexpected extent_hooks error");
+	static bool auto_arena_created = false;
+	if (old_hooks != &hooks) {
+		assert_b_eq(auto_arena_created, false,
+		    "Expected auto arena 1 created only once.");
+		auto_arena_created = true;
+	}
+}
+
+static void
+test_manual_hook_body(void) {
+	unsigned arena_ind;
+	size_t old_size, new_size, sz;
+	size_t hooks_mib[3];
+	size_t hooks_miblen;
+	extent_hooks_t *new_hooks, *old_hooks;
+
+	extent_hooks_prep();
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+
+	/* Install custom extent hooks. */
+	hooks_miblen = sizeof(hooks_mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.extent_hooks", hooks_mib,
+	    &hooks_miblen), 0, "Unexpected mallctlnametomib() failure");
+	hooks_mib[1] = (size_t)arena_ind;
+	old_size = sizeof(extent_hooks_t *);
+	new_hooks = &hooks;
+	new_size = sizeof(extent_hooks_t *);
+	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
+	    &old_size, (void *)&new_hooks, new_size), 0,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->alloc, extent_alloc_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->dalloc, extent_dalloc_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->commit, extent_commit_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->decommit, extent_decommit_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->purge_lazy, extent_purge_lazy_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->purge_forced, extent_purge_forced_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->split, extent_split_hook,
+	    "Unexpected extent_hooks error");
+	assert_ptr_ne(old_hooks->merge, extent_merge_hook,
+	    "Unexpected extent_hooks error");
+
+	if (!check_background_thread_enabled()) {
+		test_extent_body(arena_ind);
+	}
+
+	/* Restore extent hooks. */
+	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, NULL, NULL,
+	    (void *)&old_hooks, new_size), 0, "Unexpected extent_hooks error");
+	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
+	    &old_size, NULL, 0), 0, "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks, default_hooks, "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->alloc, default_hooks->alloc,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->dalloc, default_hooks->dalloc,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->commit, default_hooks->commit,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->decommit, default_hooks->decommit,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->purge_lazy, default_hooks->purge_lazy,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->purge_forced, default_hooks->purge_forced,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->split, default_hooks->split,
+	    "Unexpected extent_hooks error");
+	assert_ptr_eq(old_hooks->merge, default_hooks->merge,
+	    "Unexpected extent_hooks error");
+}
+
+TEST_BEGIN(test_extent_manual_hook) {
+	test_manual_hook_auto_arena();
+	test_manual_hook_body();
+
+	/* Test failure paths. */
+	try_split = false;
+	test_manual_hook_body();
+	try_merge = false;
+	test_manual_hook_body();
+	try_purge_lazy = false;
+	try_purge_forced = false;
+	test_manual_hook_body();
+
+	try_split = try_merge = try_purge_lazy = try_purge_forced = true;
+}
+TEST_END
+
+TEST_BEGIN(test_extent_auto_hook) {
+	unsigned arena_ind;
+	size_t new_size, sz;
+	extent_hooks_t *new_hooks;
+
+	extent_hooks_prep();
+
+	sz = sizeof(unsigned);
+	new_hooks = &hooks;
+	new_size = sizeof(extent_hooks_t *);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
+	    (void *)&new_hooks, new_size), 0, "Unexpected mallctl() failure");
+
+	test_skip_if(check_background_thread_enabled());
+	test_extent_body(arena_ind);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_extent_manual_hook,
+	    test_extent_auto_hook);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/extent.sh b/redis-stable/deps/jemalloc/test/integration/extent.sh
new file mode 100644
index 00000000..0cc21873
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/extent.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="junk:false"
+fi
diff --git a/redis-stable/deps/jemalloc/test/integration/mallocx.c b/redis-stable/deps/jemalloc/test/integration/mallocx.c
new file mode 100644
index 00000000..fd960f30
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/mallocx.c
@@ -0,0 +1,228 @@
+#include "test/jemalloc_test.h"
+
+static unsigned
+get_nsizes_impl(const char *cmd) {
+	unsigned ret;
+	size_t z;
+
+	z = sizeof(unsigned);
+	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
+	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
+
+	return ret;
+}
+
+static unsigned
+get_nlarge(void) {
+	return get_nsizes_impl("arenas.nlextents");
+}
+
+static size_t
+get_size_impl(const char *cmd, size_t ind) {
+	size_t ret;
+	size_t z;
+	size_t mib[4];
+	size_t miblen = 4;
+
+	z = sizeof(size_t);
+	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
+	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
+	mib[2] = ind;
+	z = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
+	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
+
+	return ret;
+}
+
+static size_t
+get_large_size(size_t ind) {
+	return get_size_impl("arenas.lextent.0.size", ind);
+}
+
+/*
+ * On systems which can't merge extents, tests that call this function generate
+ * a lot of dirty memory very quickly.  Purging between cycles mitigates
+ * potential OOM on e.g. 32-bit Windows.
+ */
+static void
+purge(void) {
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl error");
+}
+
+TEST_BEGIN(test_overflow) {
+	size_t largemax;
+
+	largemax = get_large_size(get_nlarge()-1);
+
+	assert_ptr_null(mallocx(largemax+1, 0),
+	    "Expected OOM for mallocx(size=%#zx, 0)", largemax+1);
+
+	assert_ptr_null(mallocx(ZU(PTRDIFF_MAX)+1, 0),
+	    "Expected OOM for mallocx(size=%#zx, 0)", ZU(PTRDIFF_MAX)+1);
+
+	assert_ptr_null(mallocx(SIZE_T_MAX, 0),
+	    "Expected OOM for mallocx(size=%#zx, 0)", SIZE_T_MAX);
+
+	assert_ptr_null(mallocx(1, MALLOCX_ALIGN(ZU(PTRDIFF_MAX)+1)),
+	    "Expected OOM for mallocx(size=1, MALLOCX_ALIGN(%#zx))",
+	    ZU(PTRDIFF_MAX)+1);
+}
+TEST_END
+
+TEST_BEGIN(test_oom) {
+	size_t largemax;
+	bool oom;
+	void *ptrs[3];
+	unsigned i;
+
+	/*
+	 * It should be impossible to allocate three objects that each consume
+	 * nearly half the virtual address space.
+	 */
+	largemax = get_large_size(get_nlarge()-1);
+	oom = false;
+	for (i = 0; i < sizeof(ptrs) / sizeof(void *); i++) {
+		ptrs[i] = mallocx(largemax, 0);
+		if (ptrs[i] == NULL) {
+			oom = true;
+		}
+	}
+	assert_true(oom,
+	    "Expected OOM during series of calls to mallocx(size=%zu, 0)",
+	    largemax);
+	for (i = 0; i < sizeof(ptrs) / sizeof(void *); i++) {
+		if (ptrs[i] != NULL) {
+			dallocx(ptrs[i], 0);
+		}
+	}
+	purge();
+
+#if LG_SIZEOF_PTR == 3
+	assert_ptr_null(mallocx(0x8000000000000000ULL,
+	    MALLOCX_ALIGN(0x8000000000000000ULL)),
+	    "Expected OOM for mallocx()");
+	assert_ptr_null(mallocx(0x8000000000000000ULL,
+	    MALLOCX_ALIGN(0x80000000)),
+	    "Expected OOM for mallocx()");
+#else
+	assert_ptr_null(mallocx(0x80000000UL, MALLOCX_ALIGN(0x80000000UL)),
+	    "Expected OOM for mallocx()");
+#endif
+}
+TEST_END
+
+TEST_BEGIN(test_basic) {
+#define MAXSZ (((size_t)1) << 23)
+	size_t sz;
+
+	for (sz = 1; sz < MAXSZ; sz = nallocx(sz, 0) + 1) {
+		size_t nsz, rsz;
+		void *p;
+		nsz = nallocx(sz, 0);
+		assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
+		p = mallocx(sz, 0);
+		assert_ptr_not_null(p,
+		    "Unexpected mallocx(size=%zx, flags=0) error", sz);
+		rsz = sallocx(p, 0);
+		assert_zu_ge(rsz, sz, "Real size smaller than expected");
+		assert_zu_eq(nsz, rsz, "nallocx()/sallocx() size mismatch");
+		dallocx(p, 0);
+
+		p = mallocx(sz, 0);
+		assert_ptr_not_null(p,
+		    "Unexpected mallocx(size=%zx, flags=0) error", sz);
+		dallocx(p, 0);
+
+		nsz = nallocx(sz, MALLOCX_ZERO);
+		assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
+		p = mallocx(sz, MALLOCX_ZERO);
+		assert_ptr_not_null(p,
+		    "Unexpected mallocx(size=%zx, flags=MALLOCX_ZERO) error",
+		    nsz);
+		rsz = sallocx(p, 0);
+		assert_zu_eq(nsz, rsz, "nallocx()/sallocx() rsize mismatch");
+		dallocx(p, 0);
+		purge();
+	}
+#undef MAXSZ
+}
+TEST_END
+
+TEST_BEGIN(test_alignment_and_size) {
+	const char *percpu_arena;
+	size_t sz = sizeof(percpu_arena);
+
+	if(mallctl("opt.percpu_arena", (void *)&percpu_arena, &sz, NULL, 0) ||
+	    strcmp(percpu_arena, "disabled") != 0) {
+		test_skip("test_alignment_and_size skipped: "
+		    "not working with percpu arena.");
+	};
+#define MAXALIGN (((size_t)1) << 23)
+#define NITER 4
+	size_t nsz, rsz, alignment, total;
+	unsigned i;
+	void *ps[NITER];
+
+	for (i = 0; i < NITER; i++) {
+		ps[i] = NULL;
+	}
+
+	for (alignment = 8;
+	    alignment <= MAXALIGN;
+	    alignment <<= 1) {
+		total = 0;
+		for (sz = 1;
+		    sz < 3 * alignment && sz < (1U << 31);
+		    sz += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
+			for (i = 0; i < NITER; i++) {
+				nsz = nallocx(sz, MALLOCX_ALIGN(alignment) |
+				    MALLOCX_ZERO);
+				assert_zu_ne(nsz, 0,
+				    "nallocx() error for alignment=%zu, "
+				    "size=%zu (%#zx)", alignment, sz, sz);
+				ps[i] = mallocx(sz, MALLOCX_ALIGN(alignment) |
+				    MALLOCX_ZERO);
+				assert_ptr_not_null(ps[i],
+				    "mallocx() error for alignment=%zu, "
+				    "size=%zu (%#zx)", alignment, sz, sz);
+				rsz = sallocx(ps[i], 0);
+				assert_zu_ge(rsz, sz,
+				    "Real size smaller than expected for "
+				    "alignment=%zu, size=%zu", alignment, sz);
+				assert_zu_eq(nsz, rsz,
+				    "nallocx()/sallocx() size mismatch for "
+				    "alignment=%zu, size=%zu", alignment, sz);
+				assert_ptr_null(
+				    (void *)((uintptr_t)ps[i] & (alignment-1)),
+				    "%p inadequately aligned for"
+				    " alignment=%zu, size=%zu", ps[i],
+				    alignment, sz);
+				total += rsz;
+				if (total >= (MAXALIGN << 1)) {
+					break;
+				}
+			}
+			for (i = 0; i < NITER; i++) {
+				if (ps[i] != NULL) {
+					dallocx(ps[i], 0);
+					ps[i] = NULL;
+				}
+			}
+		}
+		purge();
+	}
+#undef MAXALIGN
+#undef NITER
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_overflow,
+	    test_oom,
+	    test_basic,
+	    test_alignment_and_size);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/mallocx.sh b/redis-stable/deps/jemalloc/test/integration/mallocx.sh
new file mode 100644
index 00000000..0cc21873
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/mallocx.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="junk:false"
+fi
diff --git a/redis-stable/deps/jemalloc/test/integration/overflow.c b/redis-stable/deps/jemalloc/test/integration/overflow.c
new file mode 100644
index 00000000..6a9785b2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/overflow.c
@@ -0,0 +1,46 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_overflow) {
+	unsigned nlextents;
+	size_t mib[4];
+	size_t sz, miblen, max_size_class;
+	void *p;
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
+	    0), 0, "Unexpected mallctl() error");
+
+	miblen = sizeof(mib) / sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() error");
+	mib[2] = nlextents - 1;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&max_size_class, &sz,
+	    NULL, 0), 0, "Unexpected mallctlbymib() error");
+
+	assert_ptr_null(malloc(max_size_class + 1),
+	    "Expected OOM due to over-sized allocation request");
+	assert_ptr_null(malloc(SIZE_T_MAX),
+	    "Expected OOM due to over-sized allocation request");
+
+	assert_ptr_null(calloc(1, max_size_class + 1),
+	    "Expected OOM due to over-sized allocation request");
+	assert_ptr_null(calloc(1, SIZE_T_MAX),
+	    "Expected OOM due to over-sized allocation request");
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Unexpected malloc() OOM");
+	assert_ptr_null(realloc(p, max_size_class + 1),
+	    "Expected OOM due to over-sized allocation request");
+	assert_ptr_null(realloc(p, SIZE_T_MAX),
+	    "Expected OOM due to over-sized allocation request");
+	free(p);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_overflow);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/posix_memalign.c b/redis-stable/deps/jemalloc/test/integration/posix_memalign.c
new file mode 100644
index 00000000..2c2726de
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/posix_memalign.c
@@ -0,0 +1,127 @@
+#include "test/jemalloc_test.h"
+
+#define MAXALIGN (((size_t)1) << 23)
+
+/*
+ * On systems which can't merge extents, tests that call this function generate
+ * a lot of dirty memory very quickly.  Purging between cycles mitigates
+ * potential OOM on e.g. 32-bit Windows.
+ */
+static void
+purge(void) {
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl error");
+}
+
+TEST_BEGIN(test_alignment_errors) {
+	size_t alignment;
+	void *p;
+
+	for (alignment = 0; alignment < sizeof(void *); alignment++) {
+		assert_d_eq(posix_memalign(&p, alignment, 1), EINVAL,
+		    "Expected error for invalid alignment %zu",
+		    alignment);
+	}
+
+	for (alignment = sizeof(size_t); alignment < MAXALIGN;
+	    alignment <<= 1) {
+		assert_d_ne(posix_memalign(&p, alignment + 1, 1), 0,
+		    "Expected error for invalid alignment %zu",
+		    alignment + 1);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_oom_errors) {
+	size_t alignment, size;
+	void *p;
+
+#if LG_SIZEOF_PTR == 3
+	alignment = UINT64_C(0x8000000000000000);
+	size      = UINT64_C(0x8000000000000000);
+#else
+	alignment = 0x80000000LU;
+	size      = 0x80000000LU;
+#endif
+	assert_d_ne(posix_memalign(&p, alignment, size), 0,
+	    "Expected error for posix_memalign(&p, %zu, %zu)",
+	    alignment, size);
+
+#if LG_SIZEOF_PTR == 3
+	alignment = UINT64_C(0x4000000000000000);
+	size      = UINT64_C(0xc000000000000001);
+#else
+	alignment = 0x40000000LU;
+	size      = 0xc0000001LU;
+#endif
+	assert_d_ne(posix_memalign(&p, alignment, size), 0,
+	    "Expected error for posix_memalign(&p, %zu, %zu)",
+	    alignment, size);
+
+	alignment = 0x10LU;
+#if LG_SIZEOF_PTR == 3
+	size = UINT64_C(0xfffffffffffffff0);
+#else
+	size = 0xfffffff0LU;
+#endif
+	assert_d_ne(posix_memalign(&p, alignment, size), 0,
+	    "Expected error for posix_memalign(&p, %zu, %zu)",
+	    alignment, size);
+}
+TEST_END
+
+TEST_BEGIN(test_alignment_and_size) {
+#define NITER 4
+	size_t alignment, size, total;
+	unsigned i;
+	int err;
+	void *ps[NITER];
+
+	for (i = 0; i < NITER; i++) {
+		ps[i] = NULL;
+	}
+
+	for (alignment = 8;
+	    alignment <= MAXALIGN;
+	    alignment <<= 1) {
+		total = 0;
+		for (size = 1;
+		    size < 3 * alignment && size < (1U << 31);
+		    size += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
+			for (i = 0; i < NITER; i++) {
+				err = posix_memalign(&ps[i],
+				    alignment, size);
+				if (err) {
+					char buf[BUFERROR_BUF];
+
+					buferror(get_errno(), buf, sizeof(buf));
+					test_fail(
+					    "Error for alignment=%zu, "
+					    "size=%zu (%#zx): %s",
+					    alignment, size, size, buf);
+				}
+				total += malloc_usable_size(ps[i]);
+				if (total >= (MAXALIGN << 1)) {
+					break;
+				}
+			}
+			for (i = 0; i < NITER; i++) {
+				if (ps[i] != NULL) {
+					free(ps[i]);
+					ps[i] = NULL;
+				}
+			}
+		}
+		purge();
+	}
+#undef NITER
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_alignment_errors,
+	    test_oom_errors,
+	    test_alignment_and_size);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/rallocx.c b/redis-stable/deps/jemalloc/test/integration/rallocx.c
new file mode 100644
index 00000000..7821ca5f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/rallocx.c
@@ -0,0 +1,245 @@
+#include "test/jemalloc_test.h"
+
+static unsigned
+get_nsizes_impl(const char *cmd) {
+	unsigned ret;
+	size_t z;
+
+	z = sizeof(unsigned);
+	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
+	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
+
+	return ret;
+}
+
+static unsigned
+get_nlarge(void) {
+	return get_nsizes_impl("arenas.nlextents");
+}
+
+static size_t
+get_size_impl(const char *cmd, size_t ind) {
+	size_t ret;
+	size_t z;
+	size_t mib[4];
+	size_t miblen = 4;
+
+	z = sizeof(size_t);
+	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
+	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
+	mib[2] = ind;
+	z = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
+	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
+
+	return ret;
+}
+
+static size_t
+get_large_size(size_t ind) {
+	return get_size_impl("arenas.lextent.0.size", ind);
+}
+
+TEST_BEGIN(test_grow_and_shrink) {
+	void *p, *q;
+	size_t tsz;
+#define NCYCLES 3
+	unsigned i, j;
+#define NSZS 1024
+	size_t szs[NSZS];
+#define MAXSZ ZU(12 * 1024 * 1024)
+
+	p = mallocx(1, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	szs[0] = sallocx(p, 0);
+
+	for (i = 0; i < NCYCLES; i++) {
+		for (j = 1; j < NSZS && szs[j-1] < MAXSZ; j++) {
+			q = rallocx(p, szs[j-1]+1, 0);
+			assert_ptr_not_null(q,
+			    "Unexpected rallocx() error for size=%zu-->%zu",
+			    szs[j-1], szs[j-1]+1);
+			szs[j] = sallocx(q, 0);
+			assert_zu_ne(szs[j], szs[j-1]+1,
+			    "Expected size to be at least: %zu", szs[j-1]+1);
+			p = q;
+		}
+
+		for (j--; j > 0; j--) {
+			q = rallocx(p, szs[j-1], 0);
+			assert_ptr_not_null(q,
+			    "Unexpected rallocx() error for size=%zu-->%zu",
+			    szs[j], szs[j-1]);
+			tsz = sallocx(q, 0);
+			assert_zu_eq(tsz, szs[j-1],
+			    "Expected size=%zu, got size=%zu", szs[j-1], tsz);
+			p = q;
+		}
+	}
+
+	dallocx(p, 0);
+#undef MAXSZ
+#undef NSZS
+#undef NCYCLES
+}
+TEST_END
+
+static bool
+validate_fill(const void *p, uint8_t c, size_t offset, size_t len) {
+	bool ret = false;
+	const uint8_t *buf = (const uint8_t *)p;
+	size_t i;
+
+	for (i = 0; i < len; i++) {
+		uint8_t b = buf[offset+i];
+		if (b != c) {
+			test_fail("Allocation at %p (len=%zu) contains %#x "
+			    "rather than %#x at offset %zu", p, len, b, c,
+			    offset+i);
+			ret = true;
+		}
+	}
+
+	return ret;
+}
+
+TEST_BEGIN(test_zero) {
+	void *p, *q;
+	size_t psz, qsz, i, j;
+	size_t start_sizes[] = {1, 3*1024, 63*1024, 4095*1024};
+#define FILL_BYTE 0xaaU
+#define RANGE 2048
+
+	for (i = 0; i < sizeof(start_sizes)/sizeof(size_t); i++) {
+		size_t start_size = start_sizes[i];
+		p = mallocx(start_size, MALLOCX_ZERO);
+		assert_ptr_not_null(p, "Unexpected mallocx() error");
+		psz = sallocx(p, 0);
+
+		assert_false(validate_fill(p, 0, 0, psz),
+		    "Expected zeroed memory");
+		memset(p, FILL_BYTE, psz);
+		assert_false(validate_fill(p, FILL_BYTE, 0, psz),
+		    "Expected filled memory");
+
+		for (j = 1; j < RANGE; j++) {
+			q = rallocx(p, start_size+j, MALLOCX_ZERO);
+			assert_ptr_not_null(q, "Unexpected rallocx() error");
+			qsz = sallocx(q, 0);
+			if (q != p || qsz != psz) {
+				assert_false(validate_fill(q, FILL_BYTE, 0,
+				    psz), "Expected filled memory");
+				assert_false(validate_fill(q, 0, psz, qsz-psz),
+				    "Expected zeroed memory");
+			}
+			if (psz != qsz) {
+				memset((void *)((uintptr_t)q+psz), FILL_BYTE,
+				    qsz-psz);
+				psz = qsz;
+			}
+			p = q;
+		}
+		assert_false(validate_fill(p, FILL_BYTE, 0, psz),
+		    "Expected filled memory");
+		dallocx(p, 0);
+	}
+#undef FILL_BYTE
+}
+TEST_END
+
+TEST_BEGIN(test_align) {
+	void *p, *q;
+	size_t align;
+#define MAX_ALIGN (ZU(1) << 25)
+
+	align = ZU(1);
+	p = mallocx(1, MALLOCX_ALIGN(align));
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	for (align <<= 1; align <= MAX_ALIGN; align <<= 1) {
+		q = rallocx(p, 1, MALLOCX_ALIGN(align));
+		assert_ptr_not_null(q,
+		    "Unexpected rallocx() error for align=%zu", align);
+		assert_ptr_null(
+		    (void *)((uintptr_t)q & (align-1)),
+		    "%p inadequately aligned for align=%zu",
+		    q, align);
+		p = q;
+	}
+	dallocx(p, 0);
+#undef MAX_ALIGN
+}
+TEST_END
+
+TEST_BEGIN(test_lg_align_and_zero) {
+	void *p, *q;
+	unsigned lg_align;
+	size_t sz;
+#define MAX_LG_ALIGN 25
+#define MAX_VALIDATE (ZU(1) << 22)
+
+	lg_align = 0;
+	p = mallocx(1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	for (lg_align++; lg_align <= MAX_LG_ALIGN; lg_align++) {
+		q = rallocx(p, 1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
+		assert_ptr_not_null(q,
+		    "Unexpected rallocx() error for lg_align=%u", lg_align);
+		assert_ptr_null(
+		    (void *)((uintptr_t)q & ((ZU(1) << lg_align)-1)),
+		    "%p inadequately aligned for lg_align=%u", q, lg_align);
+		sz = sallocx(q, 0);
+		if ((sz << 1) <= MAX_VALIDATE) {
+			assert_false(validate_fill(q, 0, 0, sz),
+			    "Expected zeroed memory");
+		} else {
+			assert_false(validate_fill(q, 0, 0, MAX_VALIDATE),
+			    "Expected zeroed memory");
+			assert_false(validate_fill(
+			    (void *)((uintptr_t)q+sz-MAX_VALIDATE),
+			    0, 0, MAX_VALIDATE), "Expected zeroed memory");
+		}
+		p = q;
+	}
+	dallocx(p, 0);
+#undef MAX_VALIDATE
+#undef MAX_LG_ALIGN
+}
+TEST_END
+
+TEST_BEGIN(test_overflow) {
+	size_t largemax;
+	void *p;
+
+	largemax = get_large_size(get_nlarge()-1);
+
+	p = mallocx(1, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+	assert_ptr_null(rallocx(p, largemax+1, 0),
+	    "Expected OOM for rallocx(p, size=%#zx, 0)", largemax+1);
+
+	assert_ptr_null(rallocx(p, ZU(PTRDIFF_MAX)+1, 0),
+	    "Expected OOM for rallocx(p, size=%#zx, 0)", ZU(PTRDIFF_MAX)+1);
+
+	assert_ptr_null(rallocx(p, SIZE_T_MAX, 0),
+	    "Expected OOM for rallocx(p, size=%#zx, 0)", SIZE_T_MAX);
+
+	assert_ptr_null(rallocx(p, 1, MALLOCX_ALIGN(ZU(PTRDIFF_MAX)+1)),
+	    "Expected OOM for rallocx(p, size=1, MALLOCX_ALIGN(%#zx))",
+	    ZU(PTRDIFF_MAX)+1);
+
+	dallocx(p, 0);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_grow_and_shrink,
+	    test_zero,
+	    test_align,
+	    test_lg_align_and_zero,
+	    test_overflow);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/sdallocx.c b/redis-stable/deps/jemalloc/test/integration/sdallocx.c
new file mode 100644
index 00000000..ca014485
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/sdallocx.c
@@ -0,0 +1,55 @@
+#include "test/jemalloc_test.h"
+
+#define MAXALIGN (((size_t)1) << 22)
+#define NITER 3
+
+TEST_BEGIN(test_basic) {
+	void *ptr = mallocx(64, 0);
+	sdallocx(ptr, 64, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_alignment_and_size) {
+	size_t nsz, sz, alignment, total;
+	unsigned i;
+	void *ps[NITER];
+
+	for (i = 0; i < NITER; i++) {
+		ps[i] = NULL;
+	}
+
+	for (alignment = 8;
+	    alignment <= MAXALIGN;
+	    alignment <<= 1) {
+		total = 0;
+		for (sz = 1;
+		    sz < 3 * alignment && sz < (1U << 31);
+		    sz += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
+			for (i = 0; i < NITER; i++) {
+				nsz = nallocx(sz, MALLOCX_ALIGN(alignment) |
+				    MALLOCX_ZERO);
+				ps[i] = mallocx(sz, MALLOCX_ALIGN(alignment) |
+				    MALLOCX_ZERO);
+				total += nsz;
+				if (total >= (MAXALIGN << 1)) {
+					break;
+				}
+			}
+			for (i = 0; i < NITER; i++) {
+				if (ps[i] != NULL) {
+					sdallocx(ps[i], sz,
+					    MALLOCX_ALIGN(alignment));
+					ps[i] = NULL;
+				}
+			}
+		}
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_basic,
+	    test_alignment_and_size);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/thread_arena.c b/redis-stable/deps/jemalloc/test/integration/thread_arena.c
new file mode 100644
index 00000000..1e5ec05d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/thread_arena.c
@@ -0,0 +1,86 @@
+#include "test/jemalloc_test.h"
+
+#define NTHREADS 10
+
+void *
+thd_start(void *arg) {
+	unsigned main_arena_ind = *(unsigned *)arg;
+	void *p;
+	unsigned arena_ind;
+	size_t size;
+	int err;
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Error in malloc()");
+	free(p);
+
+	size = sizeof(arena_ind);
+	if ((err = mallctl("thread.arena", (void *)&arena_ind, &size,
+	    (void *)&main_arena_ind, sizeof(main_arena_ind)))) {
+		char buf[BUFERROR_BUF];
+
+		buferror(err, buf, sizeof(buf));
+		test_fail("Error in mallctl(): %s", buf);
+	}
+
+	size = sizeof(arena_ind);
+	if ((err = mallctl("thread.arena", (void *)&arena_ind, &size, NULL,
+	    0))) {
+		char buf[BUFERROR_BUF];
+
+		buferror(err, buf, sizeof(buf));
+		test_fail("Error in mallctl(): %s", buf);
+	}
+	assert_u_eq(arena_ind, main_arena_ind,
+	    "Arena index should be same as for main thread");
+
+	return NULL;
+}
+
+static void
+mallctl_failure(int err) {
+	char buf[BUFERROR_BUF];
+
+	buferror(err, buf, sizeof(buf));
+	test_fail("Error in mallctl(): %s", buf);
+}
+
+TEST_BEGIN(test_thread_arena) {
+	void *p;
+	int err;
+	thd_t thds[NTHREADS];
+	unsigned i;
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Error in malloc()");
+
+	unsigned arena_ind, old_arena_ind;
+	size_t sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Arena creation failure");
+
+	size_t size = sizeof(arena_ind);
+	if ((err = mallctl("thread.arena", (void *)&old_arena_ind, &size,
+	    (void *)&arena_ind, sizeof(arena_ind))) != 0) {
+		mallctl_failure(err);
+	}
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_create(&thds[i], thd_start,
+		    (void *)&arena_ind);
+	}
+
+	for (i = 0; i < NTHREADS; i++) {
+		intptr_t join_ret;
+		thd_join(thds[i], (void *)&join_ret);
+		assert_zd_eq(join_ret, 0, "Unexpected thread join error");
+	}
+	free(p);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_thread_arena);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c b/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
new file mode 100644
index 00000000..95c9acc1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
@@ -0,0 +1,87 @@
+#include "test/jemalloc_test.h"
+
+void *
+thd_start(void *arg) {
+	bool e0, e1;
+	size_t sz = sizeof(bool);
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz, NULL,
+	    0), 0, "Unexpected mallctl failure");
+
+	if (e0) {
+		e1 = false;
+		assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+		    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+		assert_true(e0, "tcache should be enabled");
+	}
+
+	e1 = true;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_false(e0, "tcache should be disabled");
+
+	e1 = true;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_true(e0, "tcache should be enabled");
+
+	e1 = false;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_true(e0, "tcache should be enabled");
+
+	e1 = false;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_false(e0, "tcache should be disabled");
+
+	free(malloc(1));
+	e1 = true;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_false(e0, "tcache should be disabled");
+
+	free(malloc(1));
+	e1 = true;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_true(e0, "tcache should be enabled");
+
+	free(malloc(1));
+	e1 = false;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_true(e0, "tcache should be enabled");
+
+	free(malloc(1));
+	e1 = false;
+	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
+	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
+	assert_false(e0, "tcache should be disabled");
+
+	free(malloc(1));
+	return NULL;
+}
+
+TEST_BEGIN(test_main_thread) {
+	thd_start(NULL);
+}
+TEST_END
+
+TEST_BEGIN(test_subthread) {
+	thd_t thd;
+
+	thd_create(&thd, thd_start, NULL);
+	thd_join(thd, NULL);
+}
+TEST_END
+
+int
+main(void) {
+	/* Run tests multiple times to check for bad interactions. */
+	return test(
+	    test_main_thread,
+	    test_subthread,
+	    test_main_thread,
+	    test_subthread,
+	    test_main_thread);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/xallocx.c b/redis-stable/deps/jemalloc/test/integration/xallocx.c
new file mode 100644
index 00000000..cd0ca048
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/xallocx.c
@@ -0,0 +1,384 @@
+#include "test/jemalloc_test.h"
+
+/*
+ * Use a separate arena for xallocx() extension/contraction tests so that
+ * internal allocation e.g. by heap profiling can't interpose allocations where
+ * xallocx() would ordinarily be able to extend.
+ */
+static unsigned
+arena_ind(void) {
+	static unsigned ind = 0;
+
+	if (ind == 0) {
+		size_t sz = sizeof(ind);
+		assert_d_eq(mallctl("arenas.create", (void *)&ind, &sz, NULL,
+		    0), 0, "Unexpected mallctl failure creating arena");
+	}
+
+	return ind;
+}
+
+TEST_BEGIN(test_same_size) {
+	void *p;
+	size_t sz, tsz;
+
+	p = mallocx(42, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	sz = sallocx(p, 0);
+
+	tsz = xallocx(p, sz, 0, 0);
+	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_extra_no_move) {
+	void *p;
+	size_t sz, tsz;
+
+	p = mallocx(42, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	sz = sallocx(p, 0);
+
+	tsz = xallocx(p, sz, sz-42, 0);
+	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_no_move_fail) {
+	void *p;
+	size_t sz, tsz;
+
+	p = mallocx(42, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	sz = sallocx(p, 0);
+
+	tsz = xallocx(p, sz + 5, 0, 0);
+	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
+
+	dallocx(p, 0);
+}
+TEST_END
+
+static unsigned
+get_nsizes_impl(const char *cmd) {
+	unsigned ret;
+	size_t z;
+
+	z = sizeof(unsigned);
+	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
+	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
+
+	return ret;
+}
+
+static unsigned
+get_nsmall(void) {
+	return get_nsizes_impl("arenas.nbins");
+}
+
+static unsigned
+get_nlarge(void) {
+	return get_nsizes_impl("arenas.nlextents");
+}
+
+static size_t
+get_size_impl(const char *cmd, size_t ind) {
+	size_t ret;
+	size_t z;
+	size_t mib[4];
+	size_t miblen = 4;
+
+	z = sizeof(size_t);
+	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
+	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
+	mib[2] = ind;
+	z = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
+	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
+
+	return ret;
+}
+
+static size_t
+get_small_size(size_t ind) {
+	return get_size_impl("arenas.bin.0.size", ind);
+}
+
+static size_t
+get_large_size(size_t ind) {
+	return get_size_impl("arenas.lextent.0.size", ind);
+}
+
+TEST_BEGIN(test_size) {
+	size_t small0, largemax;
+	void *p;
+
+	/* Get size classes. */
+	small0 = get_small_size(0);
+	largemax = get_large_size(get_nlarge()-1);
+
+	p = mallocx(small0, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	/* Test smallest supported size. */
+	assert_zu_eq(xallocx(p, 1, 0, 0), small0,
+	    "Unexpected xallocx() behavior");
+
+	/* Test largest supported size. */
+	assert_zu_le(xallocx(p, largemax, 0, 0), largemax,
+	    "Unexpected xallocx() behavior");
+
+	/* Test size overflow. */
+	assert_zu_le(xallocx(p, largemax+1, 0, 0), largemax,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, SIZE_T_MAX, 0, 0), largemax,
+	    "Unexpected xallocx() behavior");
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_size_extra_overflow) {
+	size_t small0, largemax;
+	void *p;
+
+	/* Get size classes. */
+	small0 = get_small_size(0);
+	largemax = get_large_size(get_nlarge()-1);
+
+	p = mallocx(small0, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	/* Test overflows that can be resolved by clamping extra. */
+	assert_zu_le(xallocx(p, largemax-1, 2, 0), largemax,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, largemax, 1, 0), largemax,
+	    "Unexpected xallocx() behavior");
+
+	/* Test overflow such that largemax-size underflows. */
+	assert_zu_le(xallocx(p, largemax+1, 2, 0), largemax,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, largemax+2, 3, 0), largemax,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, SIZE_T_MAX-2, 2, 0), largemax,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, SIZE_T_MAX-1, 1, 0), largemax,
+	    "Unexpected xallocx() behavior");
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_extra_small) {
+	size_t small0, small1, largemax;
+	void *p;
+
+	/* Get size classes. */
+	small0 = get_small_size(0);
+	small1 = get_small_size(1);
+	largemax = get_large_size(get_nlarge()-1);
+
+	p = mallocx(small0, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	assert_zu_eq(xallocx(p, small1, 0, 0), small0,
+	    "Unexpected xallocx() behavior");
+
+	assert_zu_eq(xallocx(p, small1, 0, 0), small0,
+	    "Unexpected xallocx() behavior");
+
+	assert_zu_eq(xallocx(p, small0, small1 - small0, 0), small0,
+	    "Unexpected xallocx() behavior");
+
+	/* Test size+extra overflow. */
+	assert_zu_eq(xallocx(p, small0, largemax - small0 + 1, 0), small0,
+	    "Unexpected xallocx() behavior");
+	assert_zu_eq(xallocx(p, small0, SIZE_T_MAX - small0, 0), small0,
+	    "Unexpected xallocx() behavior");
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_extra_large) {
+	int flags = MALLOCX_ARENA(arena_ind());
+	size_t smallmax, large1, large2, large3, largemax;
+	void *p;
+
+	/* Get size classes. */
+	smallmax = get_small_size(get_nsmall()-1);
+	large1 = get_large_size(1);
+	large2 = get_large_size(2);
+	large3 = get_large_size(3);
+	largemax = get_large_size(get_nlarge()-1);
+
+	p = mallocx(large3, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+
+	assert_zu_eq(xallocx(p, large3, 0, flags), large3,
+	    "Unexpected xallocx() behavior");
+	/* Test size decrease with zero extra. */
+	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
+	    "Unexpected xallocx() behavior");
+	assert_zu_ge(xallocx(p, smallmax, 0, flags), large1,
+	    "Unexpected xallocx() behavior");
+
+	if (xallocx(p, large3, 0, flags) != large3) {
+		p = rallocx(p, large3, flags);
+		assert_ptr_not_null(p, "Unexpected rallocx() failure");
+	}
+	/* Test size decrease with non-zero extra. */
+	assert_zu_eq(xallocx(p, large1, large3 - large1, flags), large3,
+	    "Unexpected xallocx() behavior");
+	assert_zu_eq(xallocx(p, large2, large3 - large2, flags), large3,
+	    "Unexpected xallocx() behavior");
+	assert_zu_ge(xallocx(p, large1, large2 - large1, flags), large2,
+	    "Unexpected xallocx() behavior");
+	assert_zu_ge(xallocx(p, smallmax, large1 - smallmax, flags), large1,
+	    "Unexpected xallocx() behavior");
+
+	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
+	    "Unexpected xallocx() behavior");
+	/* Test size increase with zero extra. */
+	assert_zu_le(xallocx(p, large3, 0, flags), large3,
+	    "Unexpected xallocx() behavior");
+	assert_zu_le(xallocx(p, largemax+1, 0, flags), large3,
+	    "Unexpected xallocx() behavior");
+
+	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
+	    "Unexpected xallocx() behavior");
+	/* Test size increase with non-zero extra. */
+	assert_zu_le(xallocx(p, large1, SIZE_T_MAX - large1, flags), largemax,
+	    "Unexpected xallocx() behavior");
+
+	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
+	    "Unexpected xallocx() behavior");
+	/* Test size increase with non-zero extra. */
+	assert_zu_le(xallocx(p, large1, large3 - large1, flags), large3,
+	    "Unexpected xallocx() behavior");
+
+	if (xallocx(p, large3, 0, flags) != large3) {
+		p = rallocx(p, large3, flags);
+		assert_ptr_not_null(p, "Unexpected rallocx() failure");
+	}
+	/* Test size+extra overflow. */
+	assert_zu_le(xallocx(p, large3, largemax - large3 + 1, flags), largemax,
+	    "Unexpected xallocx() behavior");
+
+	dallocx(p, flags);
+}
+TEST_END
+
+static void
+print_filled_extents(const void *p, uint8_t c, size_t len) {
+	const uint8_t *pc = (const uint8_t *)p;
+	size_t i, range0;
+	uint8_t c0;
+
+	malloc_printf("  p=%p, c=%#x, len=%zu:", p, c, len);
+	range0 = 0;
+	c0 = pc[0];
+	for (i = 0; i < len; i++) {
+		if (pc[i] != c0) {
+			malloc_printf(" %#x[%zu..%zu)", c0, range0, i);
+			range0 = i;
+			c0 = pc[i];
+		}
+	}
+	malloc_printf(" %#x[%zu..%zu)\n", c0, range0, i);
+}
+
+static bool
+validate_fill(const void *p, uint8_t c, size_t offset, size_t len) {
+	const uint8_t *pc = (const uint8_t *)p;
+	bool err;
+	size_t i;
+
+	for (i = offset, err = false; i < offset+len; i++) {
+		if (pc[i] != c) {
+			err = true;
+		}
+	}
+
+	if (err) {
+		print_filled_extents(p, c, offset + len);
+	}
+
+	return err;
+}
+
+static void
+test_zero(size_t szmin, size_t szmax) {
+	int flags = MALLOCX_ARENA(arena_ind()) | MALLOCX_ZERO;
+	size_t sz, nsz;
+	void *p;
+#define FILL_BYTE 0x7aU
+
+	sz = szmax;
+	p = mallocx(sz, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() error");
+	assert_false(validate_fill(p, 0x00, 0, sz), "Memory not filled: sz=%zu",
+	    sz);
+
+	/*
+	 * Fill with non-zero so that non-debug builds are more likely to detect
+	 * errors.
+	 */
+	memset(p, FILL_BYTE, sz);
+	assert_false(validate_fill(p, FILL_BYTE, 0, sz),
+	    "Memory not filled: sz=%zu", sz);
+
+	/* Shrink in place so that we can expect growing in place to succeed. */
+	sz = szmin;
+	if (xallocx(p, sz, 0, flags) != sz) {
+		p = rallocx(p, sz, flags);
+		assert_ptr_not_null(p, "Unexpected rallocx() failure");
+	}
+	assert_false(validate_fill(p, FILL_BYTE, 0, sz),
+	    "Memory not filled: sz=%zu", sz);
+
+	for (sz = szmin; sz < szmax; sz = nsz) {
+		nsz = nallocx(sz+1, flags);
+		if (xallocx(p, sz+1, 0, flags) != nsz) {
+			p = rallocx(p, sz+1, flags);
+			assert_ptr_not_null(p, "Unexpected rallocx() failure");
+		}
+		assert_false(validate_fill(p, FILL_BYTE, 0, sz),
+		    "Memory not filled: sz=%zu", sz);
+		assert_false(validate_fill(p, 0x00, sz, nsz-sz),
+		    "Memory not filled: sz=%zu, nsz-sz=%zu", sz, nsz-sz);
+		memset((void *)((uintptr_t)p + sz), FILL_BYTE, nsz-sz);
+		assert_false(validate_fill(p, FILL_BYTE, 0, nsz),
+		    "Memory not filled: nsz=%zu", nsz);
+	}
+
+	dallocx(p, flags);
+}
+
+TEST_BEGIN(test_zero_large) {
+	size_t large0, large1;
+
+	/* Get size classes. */
+	large0 = get_large_size(0);
+	large1 = get_large_size(1);
+
+	test_zero(large1, large0 * 2);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_same_size,
+	    test_extra_no_move,
+	    test_no_move_fail,
+	    test_size,
+	    test_size_extra_overflow,
+	    test_extra_small,
+	    test_extra_large,
+	    test_zero_large);
+}
diff --git a/redis-stable/deps/jemalloc/test/integration/xallocx.sh b/redis-stable/deps/jemalloc/test/integration/xallocx.sh
new file mode 100644
index 00000000..0cc21873
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/integration/xallocx.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="junk:false"
+fi
diff --git a/redis-stable/deps/jemalloc/test/src/SFMT.c b/redis-stable/deps/jemalloc/test/src/SFMT.c
new file mode 100644
index 00000000..c05e2183
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/SFMT.c
@@ -0,0 +1,719 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+/**
+ * @file  SFMT.c
+ * @brief SIMD oriented Fast Mersenne Twister(SFMT)
+ *
+ * @author Mutsuo Saito (Hiroshima University)
+ * @author Makoto Matsumoto (Hiroshima University)
+ *
+ * Copyright (C) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ * University. All rights reserved.
+ *
+ * The new BSD License is applied to this software, see LICENSE.txt
+ */
+#define SFMT_C_
+#include "test/jemalloc_test.h"
+#include "test/SFMT-params.h"
+
+#if defined(JEMALLOC_BIG_ENDIAN) && !defined(BIG_ENDIAN64)
+#define BIG_ENDIAN64 1
+#endif
+#if defined(__BIG_ENDIAN__) && !defined(__amd64) && !defined(BIG_ENDIAN64)
+#define BIG_ENDIAN64 1
+#endif
+#if defined(HAVE_ALTIVEC) && !defined(BIG_ENDIAN64)
+#define BIG_ENDIAN64 1
+#endif
+#if defined(ONLY64) && !defined(BIG_ENDIAN64)
+  #if defined(__GNUC__)
+    #error "-DONLY64 must be specified with -DBIG_ENDIAN64"
+  #endif
+#undef ONLY64
+#endif
+/*------------------------------------------------------
+  128-bit SIMD data type for Altivec, SSE2 or standard C
+  ------------------------------------------------------*/
+#if defined(HAVE_ALTIVEC)
+/** 128-bit data structure */
+union W128_T {
+    vector unsigned int s;
+    uint32_t u[4];
+};
+/** 128-bit data type */
+typedef union W128_T w128_t;
+
+#elif defined(HAVE_SSE2)
+/** 128-bit data structure */
+union W128_T {
+    __m128i si;
+    uint32_t u[4];
+};
+/** 128-bit data type */
+typedef union W128_T w128_t;
+
+#else
+
+/** 128-bit data structure */
+struct W128_T {
+    uint32_t u[4];
+};
+/** 128-bit data type */
+typedef struct W128_T w128_t;
+
+#endif
+
+struct sfmt_s {
+    /** the 128-bit internal state array */
+    w128_t sfmt[N];
+    /** index counter to the 32-bit internal state array */
+    int idx;
+    /** a flag: it is 0 if and only if the internal state is not yet
+     * initialized. */
+    int initialized;
+};
+
+/*--------------------------------------
+  FILE GLOBAL VARIABLES
+  internal state, index counter and flag
+  --------------------------------------*/
+
+/** a parity check vector which certificate the period of 2^{MEXP} */
+static uint32_t parity[4] = {PARITY1, PARITY2, PARITY3, PARITY4};
+
+/*----------------
+  STATIC FUNCTIONS
+  ----------------*/
+static inline int idxof(int i);
+#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
+static inline void rshift128(w128_t *out,  w128_t const *in, int shift);
+static inline void lshift128(w128_t *out,  w128_t const *in, int shift);
+#endif
+static inline void gen_rand_all(sfmt_t *ctx);
+static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size);
+static inline uint32_t func1(uint32_t x);
+static inline uint32_t func2(uint32_t x);
+static void period_certification(sfmt_t *ctx);
+#if defined(BIG_ENDIAN64) && !defined(ONLY64)
+static inline void swap(w128_t *array, int size);
+#endif
+
+#if defined(HAVE_ALTIVEC)
+  #include "test/SFMT-alti.h"
+#elif defined(HAVE_SSE2)
+  #include "test/SFMT-sse2.h"
+#endif
+
+/**
+ * This function simulate a 64-bit index of LITTLE ENDIAN
+ * in BIG ENDIAN machine.
+ */
+#ifdef ONLY64
+static inline int idxof(int i) {
+    return i ^ 1;
+}
+#else
+static inline int idxof(int i) {
+    return i;
+}
+#endif
+/**
+ * This function simulates SIMD 128-bit right shift by the standard C.
+ * The 128-bit integer given in in is shifted by (shift * 8) bits.
+ * This function simulates the LITTLE ENDIAN SIMD.
+ * @param out the output of this function
+ * @param in the 128-bit data to be shifted
+ * @param shift the shift value
+ */
+#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
+#ifdef ONLY64
+static inline void rshift128(w128_t *out, w128_t const *in, int shift) {
+    uint64_t th, tl, oh, ol;
+
+    th = ((uint64_t)in->u[2] << 32) | ((uint64_t)in->u[3]);
+    tl = ((uint64_t)in->u[0] << 32) | ((uint64_t)in->u[1]);
+
+    oh = th >> (shift * 8);
+    ol = tl >> (shift * 8);
+    ol |= th << (64 - shift * 8);
+    out->u[0] = (uint32_t)(ol >> 32);
+    out->u[1] = (uint32_t)ol;
+    out->u[2] = (uint32_t)(oh >> 32);
+    out->u[3] = (uint32_t)oh;
+}
+#else
+static inline void rshift128(w128_t *out, w128_t const *in, int shift) {
+    uint64_t th, tl, oh, ol;
+
+    th = ((uint64_t)in->u[3] << 32) | ((uint64_t)in->u[2]);
+    tl = ((uint64_t)in->u[1] << 32) | ((uint64_t)in->u[0]);
+
+    oh = th >> (shift * 8);
+    ol = tl >> (shift * 8);
+    ol |= th << (64 - shift * 8);
+    out->u[1] = (uint32_t)(ol >> 32);
+    out->u[0] = (uint32_t)ol;
+    out->u[3] = (uint32_t)(oh >> 32);
+    out->u[2] = (uint32_t)oh;
+}
+#endif
+/**
+ * This function simulates SIMD 128-bit left shift by the standard C.
+ * The 128-bit integer given in in is shifted by (shift * 8) bits.
+ * This function simulates the LITTLE ENDIAN SIMD.
+ * @param out the output of this function
+ * @param in the 128-bit data to be shifted
+ * @param shift the shift value
+ */
+#ifdef ONLY64
+static inline void lshift128(w128_t *out, w128_t const *in, int shift) {
+    uint64_t th, tl, oh, ol;
+
+    th = ((uint64_t)in->u[2] << 32) | ((uint64_t)in->u[3]);
+    tl = ((uint64_t)in->u[0] << 32) | ((uint64_t)in->u[1]);
+
+    oh = th << (shift * 8);
+    ol = tl << (shift * 8);
+    oh |= tl >> (64 - shift * 8);
+    out->u[0] = (uint32_t)(ol >> 32);
+    out->u[1] = (uint32_t)ol;
+    out->u[2] = (uint32_t)(oh >> 32);
+    out->u[3] = (uint32_t)oh;
+}
+#else
+static inline void lshift128(w128_t *out, w128_t const *in, int shift) {
+    uint64_t th, tl, oh, ol;
+
+    th = ((uint64_t)in->u[3] << 32) | ((uint64_t)in->u[2]);
+    tl = ((uint64_t)in->u[1] << 32) | ((uint64_t)in->u[0]);
+
+    oh = th << (shift * 8);
+    ol = tl << (shift * 8);
+    oh |= tl >> (64 - shift * 8);
+    out->u[1] = (uint32_t)(ol >> 32);
+    out->u[0] = (uint32_t)ol;
+    out->u[3] = (uint32_t)(oh >> 32);
+    out->u[2] = (uint32_t)oh;
+}
+#endif
+#endif
+
+/**
+ * This function represents the recursion formula.
+ * @param r output
+ * @param a a 128-bit part of the internal state array
+ * @param b a 128-bit part of the internal state array
+ * @param c a 128-bit part of the internal state array
+ * @param d a 128-bit part of the internal state array
+ */
+#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
+#ifdef ONLY64
+static inline void do_recursion(w128_t *r, w128_t *a, w128_t *b, w128_t *c,
+				w128_t *d) {
+    w128_t x;
+    w128_t y;
+
+    lshift128(&x, a, SL2);
+    rshift128(&y, c, SR2);
+    r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK2) ^ y.u[0]
+	^ (d->u[0] << SL1);
+    r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK1) ^ y.u[1]
+	^ (d->u[1] << SL1);
+    r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK4) ^ y.u[2]
+	^ (d->u[2] << SL1);
+    r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK3) ^ y.u[3]
+	^ (d->u[3] << SL1);
+}
+#else
+static inline void do_recursion(w128_t *r, w128_t *a, w128_t *b, w128_t *c,
+				w128_t *d) {
+    w128_t x;
+    w128_t y;
+
+    lshift128(&x, a, SL2);
+    rshift128(&y, c, SR2);
+    r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK1) ^ y.u[0]
+	^ (d->u[0] << SL1);
+    r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK2) ^ y.u[1]
+	^ (d->u[1] << SL1);
+    r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK3) ^ y.u[2]
+	^ (d->u[2] << SL1);
+    r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK4) ^ y.u[3]
+	^ (d->u[3] << SL1);
+}
+#endif
+#endif
+
+#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
+/**
+ * This function fills the internal state array with pseudorandom
+ * integers.
+ */
+static inline void gen_rand_all(sfmt_t *ctx) {
+    int i;
+    w128_t *r1, *r2;
+
+    r1 = &ctx->sfmt[N - 2];
+    r2 = &ctx->sfmt[N - 1];
+    for (i = 0; i < N - POS1; i++) {
+	do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1,
+	  r2);
+	r1 = r2;
+	r2 = &ctx->sfmt[i];
+    }
+    for (; i < N; i++) {
+	do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1 - N], r1,
+	  r2);
+	r1 = r2;
+	r2 = &ctx->sfmt[i];
+    }
+}
+
+/**
+ * This function fills the user-specified array with pseudorandom
+ * integers.
+ *
+ * @param array an 128-bit array to be filled by pseudorandom numbers.
+ * @param size number of 128-bit pseudorandom numbers to be generated.
+ */
+static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
+    int i, j;
+    w128_t *r1, *r2;
+
+    r1 = &ctx->sfmt[N - 2];
+    r2 = &ctx->sfmt[N - 1];
+    for (i = 0; i < N - POS1; i++) {
+	do_recursion(&array[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1, r2);
+	r1 = r2;
+	r2 = &array[i];
+    }
+    for (; i < N; i++) {
+	do_recursion(&array[i], &ctx->sfmt[i], &array[i + POS1 - N], r1, r2);
+	r1 = r2;
+	r2 = &array[i];
+    }
+    for (; i < size - N; i++) {
+	do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2);
+	r1 = r2;
+	r2 = &array[i];
+    }
+    for (j = 0; j < 2 * N - size; j++) {
+	ctx->sfmt[j] = array[j + size - N];
+    }
+    for (; i < size; i++, j++) {
+	do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2);
+	r1 = r2;
+	r2 = &array[i];
+	ctx->sfmt[j] = array[i];
+    }
+}
+#endif
+
+#if defined(BIG_ENDIAN64) && !defined(ONLY64) && !defined(HAVE_ALTIVEC)
+static inline void swap(w128_t *array, int size) {
+    int i;
+    uint32_t x, y;
+
+    for (i = 0; i < size; i++) {
+	x = array[i].u[0];
+	y = array[i].u[2];
+	array[i].u[0] = array[i].u[1];
+	array[i].u[2] = array[i].u[3];
+	array[i].u[1] = x;
+	array[i].u[3] = y;
+    }
+}
+#endif
+/**
+ * This function represents a function used in the initialization
+ * by init_by_array
+ * @param x 32-bit integer
+ * @return 32-bit integer
+ */
+static uint32_t func1(uint32_t x) {
+    return (x ^ (x >> 27)) * (uint32_t)1664525UL;
+}
+
+/**
+ * This function represents a function used in the initialization
+ * by init_by_array
+ * @param x 32-bit integer
+ * @return 32-bit integer
+ */
+static uint32_t func2(uint32_t x) {
+    return (x ^ (x >> 27)) * (uint32_t)1566083941UL;
+}
+
+/**
+ * This function certificate the period of 2^{MEXP}
+ */
+static void period_certification(sfmt_t *ctx) {
+    int inner = 0;
+    int i, j;
+    uint32_t work;
+    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
+
+    for (i = 0; i < 4; i++)
+	inner ^= psfmt32[idxof(i)] & parity[i];
+    for (i = 16; i > 0; i >>= 1)
+	inner ^= inner >> i;
+    inner &= 1;
+    /* check OK */
+    if (inner == 1) {
+	return;
+    }
+    /* check NG, and modification */
+    for (i = 0; i < 4; i++) {
+	work = 1;
+	for (j = 0; j < 32; j++) {
+	    if ((work & parity[i]) != 0) {
+		psfmt32[idxof(i)] ^= work;
+		return;
+	    }
+	    work = work << 1;
+	}
+    }
+}
+
+/*----------------
+  PUBLIC FUNCTIONS
+  ----------------*/
+/**
+ * This function returns the identification string.
+ * The string shows the word size, the Mersenne exponent,
+ * and all parameters of this generator.
+ */
+const char *get_idstring(void) {
+    return IDSTR;
+}
+
+/**
+ * This function returns the minimum size of array used for \b
+ * fill_array32() function.
+ * @return minimum size of array used for fill_array32() function.
+ */
+int get_min_array_size32(void) {
+    return N32;
+}
+
+/**
+ * This function returns the minimum size of array used for \b
+ * fill_array64() function.
+ * @return minimum size of array used for fill_array64() function.
+ */
+int get_min_array_size64(void) {
+    return N64;
+}
+
+#ifndef ONLY64
+/**
+ * This function generates and returns 32-bit pseudorandom number.
+ * init_gen_rand or init_by_array must be called before this function.
+ * @return 32-bit pseudorandom number
+ */
+uint32_t gen_rand32(sfmt_t *ctx) {
+    uint32_t r;
+    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
+
+    assert(ctx->initialized);
+    if (ctx->idx >= N32) {
+	gen_rand_all(ctx);
+	ctx->idx = 0;
+    }
+    r = psfmt32[ctx->idx++];
+    return r;
+}
+
+/* Generate a random integer in [0..limit). */
+uint32_t gen_rand32_range(sfmt_t *ctx, uint32_t limit) {
+    uint32_t ret, above;
+
+    above = 0xffffffffU - (0xffffffffU % limit);
+    while (1) {
+	ret = gen_rand32(ctx);
+	if (ret < above) {
+	    ret %= limit;
+	    break;
+	}
+    }
+    return ret;
+}
+#endif
+/**
+ * This function generates and returns 64-bit pseudorandom number.
+ * init_gen_rand or init_by_array must be called before this function.
+ * The function gen_rand64 should not be called after gen_rand32,
+ * unless an initialization is again executed.
+ * @return 64-bit pseudorandom number
+ */
+uint64_t gen_rand64(sfmt_t *ctx) {
+#if defined(BIG_ENDIAN64) && !defined(ONLY64)
+    uint32_t r1, r2;
+    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
+#else
+    uint64_t r;
+    uint64_t *psfmt64 = (uint64_t *)&ctx->sfmt[0].u[0];
+#endif
+
+    assert(ctx->initialized);
+    assert(ctx->idx % 2 == 0);
+
+    if (ctx->idx >= N32) {
+	gen_rand_all(ctx);
+	ctx->idx = 0;
+    }
+#if defined(BIG_ENDIAN64) && !defined(ONLY64)
+    r1 = psfmt32[ctx->idx];
+    r2 = psfmt32[ctx->idx + 1];
+    ctx->idx += 2;
+    return ((uint64_t)r2 << 32) | r1;
+#else
+    r = psfmt64[ctx->idx / 2];
+    ctx->idx += 2;
+    return r;
+#endif
+}
+
+/* Generate a random integer in [0..limit). */
+uint64_t gen_rand64_range(sfmt_t *ctx, uint64_t limit) {
+    uint64_t ret, above;
+
+    above = KQU(0xffffffffffffffff) - (KQU(0xffffffffffffffff) % limit);
+    while (1) {
+	ret = gen_rand64(ctx);
+	if (ret < above) {
+	    ret %= limit;
+	    break;
+	}
+    }
+    return ret;
+}
+
+#ifndef ONLY64
+/**
+ * This function generates pseudorandom 32-bit integers in the
+ * specified array[] by one call. The number of pseudorandom integers
+ * is specified by the argument size, which must be at least 624 and a
+ * multiple of four.  The generation by this function is much faster
+ * than the following gen_rand function.
+ *
+ * For initialization, init_gen_rand or init_by_array must be called
+ * before the first call of this function. This function can not be
+ * used after calling gen_rand function, without initialization.
+ *
+ * @param array an array where pseudorandom 32-bit integers are filled
+ * by this function.  The pointer to the array must be \b "aligned"
+ * (namely, must be a multiple of 16) in the SIMD version, since it
+ * refers to the address of a 128-bit integer.  In the standard C
+ * version, the pointer is arbitrary.
+ *
+ * @param size the number of 32-bit pseudorandom integers to be
+ * generated.  size must be a multiple of 4, and greater than or equal
+ * to (MEXP / 128 + 1) * 4.
+ *
+ * @note \b memalign or \b posix_memalign is available to get aligned
+ * memory. Mac OSX doesn't have these functions, but \b malloc of OSX
+ * returns the pointer to the aligned memory block.
+ */
+void fill_array32(sfmt_t *ctx, uint32_t *array, int size) {
+    assert(ctx->initialized);
+    assert(ctx->idx == N32);
+    assert(size % 4 == 0);
+    assert(size >= N32);
+
+    gen_rand_array(ctx, (w128_t *)array, size / 4);
+    ctx->idx = N32;
+}
+#endif
+
+/**
+ * This function generates pseudorandom 64-bit integers in the
+ * specified array[] by one call. The number of pseudorandom integers
+ * is specified by the argument size, which must be at least 312 and a
+ * multiple of two.  The generation by this function is much faster
+ * than the following gen_rand function.
+ *
+ * For initialization, init_gen_rand or init_by_array must be called
+ * before the first call of this function. This function can not be
+ * used after calling gen_rand function, without initialization.
+ *
+ * @param array an array where pseudorandom 64-bit integers are filled
+ * by this function.  The pointer to the array must be "aligned"
+ * (namely, must be a multiple of 16) in the SIMD version, since it
+ * refers to the address of a 128-bit integer.  In the standard C
+ * version, the pointer is arbitrary.
+ *
+ * @param size the number of 64-bit pseudorandom integers to be
+ * generated.  size must be a multiple of 2, and greater than or equal
+ * to (MEXP / 128 + 1) * 2
+ *
+ * @note \b memalign or \b posix_memalign is available to get aligned
+ * memory. Mac OSX doesn't have these functions, but \b malloc of OSX
+ * returns the pointer to the aligned memory block.
+ */
+void fill_array64(sfmt_t *ctx, uint64_t *array, int size) {
+    assert(ctx->initialized);
+    assert(ctx->idx == N32);
+    assert(size % 2 == 0);
+    assert(size >= N64);
+
+    gen_rand_array(ctx, (w128_t *)array, size / 2);
+    ctx->idx = N32;
+
+#if defined(BIG_ENDIAN64) && !defined(ONLY64)
+    swap((w128_t *)array, size /2);
+#endif
+}
+
+/**
+ * This function initializes the internal state array with a 32-bit
+ * integer seed.
+ *
+ * @param seed a 32-bit integer used as the seed.
+ */
+sfmt_t *init_gen_rand(uint32_t seed) {
+    void *p;
+    sfmt_t *ctx;
+    int i;
+    uint32_t *psfmt32;
+
+    if (posix_memalign(&p, sizeof(w128_t), sizeof(sfmt_t)) != 0) {
+	return NULL;
+    }
+    ctx = (sfmt_t *)p;
+    psfmt32 = &ctx->sfmt[0].u[0];
+
+    psfmt32[idxof(0)] = seed;
+    for (i = 1; i < N32; i++) {
+	psfmt32[idxof(i)] = 1812433253UL * (psfmt32[idxof(i - 1)]
+					    ^ (psfmt32[idxof(i - 1)] >> 30))
+	    + i;
+    }
+    ctx->idx = N32;
+    period_certification(ctx);
+    ctx->initialized = 1;
+
+    return ctx;
+}
+
+/**
+ * This function initializes the internal state array,
+ * with an array of 32-bit integers used as the seeds
+ * @param init_key the array of 32-bit integers, used as a seed.
+ * @param key_length the length of init_key.
+ */
+sfmt_t *init_by_array(uint32_t *init_key, int key_length) {
+    void *p;
+    sfmt_t *ctx;
+    int i, j, count;
+    uint32_t r;
+    int lag;
+    int mid;
+    int size = N * 4;
+    uint32_t *psfmt32;
+
+    if (posix_memalign(&p, sizeof(w128_t), sizeof(sfmt_t)) != 0) {
+	return NULL;
+    }
+    ctx = (sfmt_t *)p;
+    psfmt32 = &ctx->sfmt[0].u[0];
+
+    if (size >= 623) {
+	lag = 11;
+    } else if (size >= 68) {
+	lag = 7;
+    } else if (size >= 39) {
+	lag = 5;
+    } else {
+	lag = 3;
+    }
+    mid = (size - lag) / 2;
+
+    memset(ctx->sfmt, 0x8b, sizeof(ctx->sfmt));
+    if (key_length + 1 > N32) {
+	count = key_length + 1;
+    } else {
+	count = N32;
+    }
+    r = func1(psfmt32[idxof(0)] ^ psfmt32[idxof(mid)]
+	      ^ psfmt32[idxof(N32 - 1)]);
+    psfmt32[idxof(mid)] += r;
+    r += key_length;
+    psfmt32[idxof(mid + lag)] += r;
+    psfmt32[idxof(0)] = r;
+
+    count--;
+    for (i = 1, j = 0; (j < count) && (j < key_length); j++) {
+	r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
+		  ^ psfmt32[idxof((i + N32 - 1) % N32)]);
+	psfmt32[idxof((i + mid) % N32)] += r;
+	r += init_key[j] + i;
+	psfmt32[idxof((i + mid + lag) % N32)] += r;
+	psfmt32[idxof(i)] = r;
+	i = (i + 1) % N32;
+    }
+    for (; j < count; j++) {
+	r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
+		  ^ psfmt32[idxof((i + N32 - 1) % N32)]);
+	psfmt32[idxof((i + mid) % N32)] += r;
+	r += i;
+	psfmt32[idxof((i + mid + lag) % N32)] += r;
+	psfmt32[idxof(i)] = r;
+	i = (i + 1) % N32;
+    }
+    for (j = 0; j < N32; j++) {
+	r = func2(psfmt32[idxof(i)] + psfmt32[idxof((i + mid) % N32)]
+		  + psfmt32[idxof((i + N32 - 1) % N32)]);
+	psfmt32[idxof((i + mid) % N32)] ^= r;
+	r -= i;
+	psfmt32[idxof((i + mid + lag) % N32)] ^= r;
+	psfmt32[idxof(i)] = r;
+	i = (i + 1) % N32;
+    }
+
+    ctx->idx = N32;
+    period_certification(ctx);
+    ctx->initialized = 1;
+
+    return ctx;
+}
+
+void fini_gen_rand(sfmt_t *ctx) {
+    assert(ctx != NULL);
+
+    ctx->initialized = 0;
+    free(ctx);
+}
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc.c b/redis-stable/deps/jemalloc/test/src/btalloc.c
new file mode 100644
index 00000000..d570952c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/btalloc.c
@@ -0,0 +1,6 @@
+#include "test/jemalloc_test.h"
+
+void *
+btalloc(size_t size, unsigned bits) {
+	return btalloc_0(size, bits);
+}
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc_0.c b/redis-stable/deps/jemalloc/test/src/btalloc_0.c
new file mode 100644
index 00000000..77d8904e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/btalloc_0.c
@@ -0,0 +1,3 @@
+#include "test/jemalloc_test.h"
+
+btalloc_n_gen(0)
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc_1.c b/redis-stable/deps/jemalloc/test/src/btalloc_1.c
new file mode 100644
index 00000000..4c126c30
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/btalloc_1.c
@@ -0,0 +1,3 @@
+#include "test/jemalloc_test.h"
+
+btalloc_n_gen(1)
diff --git a/redis-stable/deps/jemalloc/test/src/math.c b/redis-stable/deps/jemalloc/test/src/math.c
new file mode 100644
index 00000000..1758c677
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/math.c
@@ -0,0 +1,2 @@
+#define MATH_C_
+#include "test/jemalloc_test.h"
diff --git a/redis-stable/deps/jemalloc/test/src/mq.c b/redis-stable/deps/jemalloc/test/src/mq.c
new file mode 100644
index 00000000..9b5f672d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/mq.c
@@ -0,0 +1,27 @@
+#include "test/jemalloc_test.h"
+
+/*
+ * Sleep for approximately ns nanoseconds.  No lower *nor* upper bound on sleep
+ * time is guaranteed.
+ */
+void
+mq_nanosleep(unsigned ns) {
+	assert(ns <= 1000*1000*1000);
+
+#ifdef _WIN32
+	Sleep(ns / 1000);
+#else
+	{
+		struct timespec timeout;
+
+		if (ns < 1000*1000*1000) {
+			timeout.tv_sec = 0;
+			timeout.tv_nsec = ns;
+		} else {
+			timeout.tv_sec = 1;
+			timeout.tv_nsec = 0;
+		}
+		nanosleep(&timeout, NULL);
+	}
+#endif
+}
diff --git a/redis-stable/deps/jemalloc/test/src/mtx.c b/redis-stable/deps/jemalloc/test/src/mtx.c
new file mode 100644
index 00000000..a393c01f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/mtx.c
@@ -0,0 +1,68 @@
+#include "test/jemalloc_test.h"
+
+#ifndef _CRT_SPINCOUNT
+#define _CRT_SPINCOUNT 4000
+#endif
+
+bool
+mtx_init(mtx_t *mtx) {
+#ifdef _WIN32
+	if (!InitializeCriticalSectionAndSpinCount(&mtx->lock,
+	    _CRT_SPINCOUNT)) {
+		return true;
+	}
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+	mtx->lock = OS_UNFAIR_LOCK_INIT;
+#elif (defined(JEMALLOC_OSSPIN))
+	mtx->lock = 0;
+#else
+	pthread_mutexattr_t attr;
+
+	if (pthread_mutexattr_init(&attr) != 0) {
+		return true;
+	}
+	pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_DEFAULT);
+	if (pthread_mutex_init(&mtx->lock, &attr) != 0) {
+		pthread_mutexattr_destroy(&attr);
+		return true;
+	}
+	pthread_mutexattr_destroy(&attr);
+#endif
+	return false;
+}
+
+void
+mtx_fini(mtx_t *mtx) {
+#ifdef _WIN32
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+#elif (defined(JEMALLOC_OSSPIN))
+#else
+	pthread_mutex_destroy(&mtx->lock);
+#endif
+}
+
+void
+mtx_lock(mtx_t *mtx) {
+#ifdef _WIN32
+	EnterCriticalSection(&mtx->lock);
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+	os_unfair_lock_lock(&mtx->lock);
+#elif (defined(JEMALLOC_OSSPIN))
+	OSSpinLockLock(&mtx->lock);
+#else
+	pthread_mutex_lock(&mtx->lock);
+#endif
+}
+
+void
+mtx_unlock(mtx_t *mtx) {
+#ifdef _WIN32
+	LeaveCriticalSection(&mtx->lock);
+#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
+	os_unfair_lock_unlock(&mtx->lock);
+#elif (defined(JEMALLOC_OSSPIN))
+	OSSpinLockUnlock(&mtx->lock);
+#else
+	pthread_mutex_unlock(&mtx->lock);
+#endif
+}
diff --git a/redis-stable/deps/jemalloc/test/src/test.c b/redis-stable/deps/jemalloc/test/src/test.c
new file mode 100644
index 00000000..01a4d738
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/test.c
@@ -0,0 +1,217 @@
+#include "test/jemalloc_test.h"
+
+/* Test status state. */
+
+static unsigned		test_count = 0;
+static test_status_t	test_counts[test_status_count] = {0, 0, 0};
+static test_status_t	test_status = test_status_pass;
+static const char *	test_name = "";
+
+/* Reentrancy testing helpers. */
+
+#define NUM_REENTRANT_ALLOCS 20
+typedef enum {
+	non_reentrant = 0,
+	libc_reentrant = 1,
+	arena_new_reentrant = 2
+} reentrancy_t;
+static reentrancy_t reentrancy;
+
+static bool libc_hook_ran = false;
+static bool arena_new_hook_ran = false;
+
+static const char *
+reentrancy_t_str(reentrancy_t r) {
+	switch (r) {
+	case non_reentrant:
+		return "non-reentrant";
+	case libc_reentrant:
+		return "libc-reentrant";
+	case arena_new_reentrant:
+		return "arena_new-reentrant";
+	default:
+		unreachable();
+	}
+}
+
+static void
+do_hook(bool *hook_ran, void (**hook)()) {
+	*hook_ran = true;
+	*hook = NULL;
+
+	size_t alloc_size = 1;
+	for (int i = 0; i < NUM_REENTRANT_ALLOCS; i++) {
+		free(malloc(alloc_size));
+		alloc_size *= 2;
+	}
+}
+
+static void
+libc_reentrancy_hook() {
+	do_hook(&libc_hook_ran, &hooks_libc_hook);
+}
+
+static void
+arena_new_reentrancy_hook() {
+	do_hook(&arena_new_hook_ran, &hooks_arena_new_hook);
+}
+
+/* Actual test infrastructure. */
+bool
+test_is_reentrant() {
+	return reentrancy != non_reentrant;
+}
+
+JEMALLOC_FORMAT_PRINTF(1, 2)
+void
+test_skip(const char *format, ...) {
+	va_list ap;
+
+	va_start(ap, format);
+	malloc_vcprintf(NULL, NULL, format, ap);
+	va_end(ap);
+	malloc_printf("\n");
+	test_status = test_status_skip;
+}
+
+JEMALLOC_FORMAT_PRINTF(1, 2)
+void
+test_fail(const char *format, ...) {
+	va_list ap;
+
+	va_start(ap, format);
+	malloc_vcprintf(NULL, NULL, format, ap);
+	va_end(ap);
+	malloc_printf("\n");
+	test_status = test_status_fail;
+}
+
+static const char *
+test_status_string(test_status_t test_status) {
+	switch (test_status) {
+	case test_status_pass: return "pass";
+	case test_status_skip: return "skip";
+	case test_status_fail: return "fail";
+	default: not_reached();
+	}
+}
+
+void
+p_test_init(const char *name) {
+	test_count++;
+	test_status = test_status_pass;
+	test_name = name;
+}
+
+void
+p_test_fini(void) {
+	test_counts[test_status]++;
+	malloc_printf("%s (%s): %s\n", test_name, reentrancy_t_str(reentrancy),
+	    test_status_string(test_status));
+}
+
+static test_status_t
+p_test_impl(bool do_malloc_init, bool do_reentrant, test_t *t, va_list ap) {
+	test_status_t ret;
+
+	if (do_malloc_init) {
+		/*
+		 * Make sure initialization occurs prior to running tests.
+		 * Tests are special because they may use internal facilities
+		 * prior to triggering initialization as a side effect of
+		 * calling into the public API.
+		 */
+		if (nallocx(1, 0) == 0) {
+			malloc_printf("Initialization error");
+			return test_status_fail;
+		}
+	}
+
+	ret = test_status_pass;
+	for (; t != NULL; t = va_arg(ap, test_t *)) {
+		/* Non-reentrant run. */
+		reentrancy = non_reentrant;
+		hooks_arena_new_hook = hooks_libc_hook = NULL;
+		t();
+		if (test_status > ret) {
+			ret = test_status;
+		}
+		/* Reentrant run. */
+		if (do_reentrant) {
+			reentrancy = libc_reentrant;
+			hooks_arena_new_hook = NULL;
+			hooks_libc_hook = &libc_reentrancy_hook;
+			t();
+			if (test_status > ret) {
+				ret = test_status;
+			}
+
+			reentrancy = arena_new_reentrant;
+			hooks_libc_hook = NULL;
+			hooks_arena_new_hook = &arena_new_reentrancy_hook;
+			t();
+			if (test_status > ret) {
+				ret = test_status;
+			}
+		}
+	}
+
+	malloc_printf("--- %s: %u/%u, %s: %u/%u, %s: %u/%u ---\n",
+	    test_status_string(test_status_pass),
+	    test_counts[test_status_pass], test_count,
+	    test_status_string(test_status_skip),
+	    test_counts[test_status_skip], test_count,
+	    test_status_string(test_status_fail),
+	    test_counts[test_status_fail], test_count);
+
+	return ret;
+}
+
+test_status_t
+p_test(test_t *t, ...) {
+	test_status_t ret;
+	va_list ap;
+
+	ret = test_status_pass;
+	va_start(ap, t);
+	ret = p_test_impl(true, true, t, ap);
+	va_end(ap);
+
+	return ret;
+}
+
+test_status_t
+p_test_no_reentrancy(test_t *t, ...) {
+	test_status_t ret;
+	va_list ap;
+
+	ret = test_status_pass;
+	va_start(ap, t);
+	ret = p_test_impl(true, false, t, ap);
+	va_end(ap);
+
+	return ret;
+}
+
+test_status_t
+p_test_no_malloc_init(test_t *t, ...) {
+	test_status_t ret;
+	va_list ap;
+
+	ret = test_status_pass;
+	va_start(ap, t);
+	/*
+	 * We also omit reentrancy from bootstrapping tests, since we don't
+	 * (yet) care about general reentrancy during bootstrapping.
+	 */
+	ret = p_test_impl(false, false, t, ap);
+	va_end(ap);
+
+	return ret;
+}
+
+void
+p_test_fail(const char *prefix, const char *message) {
+	malloc_cprintf(NULL, NULL, "%s%s\n", prefix, message);
+	test_status = test_status_fail;
+}
diff --git a/redis-stable/deps/jemalloc/test/src/thd.c b/redis-stable/deps/jemalloc/test/src/thd.c
new file mode 100644
index 00000000..9a15eabb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/thd.c
@@ -0,0 +1,34 @@
+#include "test/jemalloc_test.h"
+
+#ifdef _WIN32
+void
+thd_create(thd_t *thd, void *(*proc)(void *), void *arg) {
+	LPTHREAD_START_ROUTINE routine = (LPTHREAD_START_ROUTINE)proc;
+	*thd = CreateThread(NULL, 0, routine, arg, 0, NULL);
+	if (*thd == NULL) {
+		test_fail("Error in CreateThread()\n");
+	}
+}
+
+void
+thd_join(thd_t thd, void **ret) {
+	if (WaitForSingleObject(thd, INFINITE) == WAIT_OBJECT_0 && ret) {
+		DWORD exit_code;
+		GetExitCodeThread(thd, (LPDWORD) &exit_code);
+		*ret = (void *)(uintptr_t)exit_code;
+	}
+}
+
+#else
+void
+thd_create(thd_t *thd, void *(*proc)(void *), void *arg) {
+	if (pthread_create(thd, NULL, proc, arg) != 0) {
+		test_fail("Error in pthread_create()\n");
+	}
+}
+
+void
+thd_join(thd_t thd, void **ret) {
+	pthread_join(thd, ret);
+}
+#endif
diff --git a/redis-stable/deps/jemalloc/test/src/timer.c b/redis-stable/deps/jemalloc/test/src/timer.c
new file mode 100644
index 00000000..c451c639
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/src/timer.c
@@ -0,0 +1,56 @@
+#include "test/jemalloc_test.h"
+
+void
+timer_start(timedelta_t *timer) {
+	nstime_init(&timer->t0, 0);
+	nstime_update(&timer->t0);
+}
+
+void
+timer_stop(timedelta_t *timer) {
+	nstime_copy(&timer->t1, &timer->t0);
+	nstime_update(&timer->t1);
+}
+
+uint64_t
+timer_usec(const timedelta_t *timer) {
+	nstime_t delta;
+
+	nstime_copy(&delta, &timer->t1);
+	nstime_subtract(&delta, &timer->t0);
+	return nstime_ns(&delta) / 1000;
+}
+
+void
+timer_ratio(timedelta_t *a, timedelta_t *b, char *buf, size_t buflen) {
+	uint64_t t0 = timer_usec(a);
+	uint64_t t1 = timer_usec(b);
+	uint64_t mult;
+	size_t i = 0;
+	size_t j, n;
+
+	/* Whole. */
+	n = malloc_snprintf(&buf[i], buflen-i, "%"FMTu64, t0 / t1);
+	i += n;
+	if (i >= buflen) {
+		return;
+	}
+	mult = 1;
+	for (j = 0; j < n; j++) {
+		mult *= 10;
+	}
+
+	/* Decimal. */
+	n = malloc_snprintf(&buf[i], buflen-i, ".");
+	i += n;
+
+	/* Fraction. */
+	while (i < buflen-1) {
+		uint64_t round = (i+1 == buflen-1 && ((t0 * mult * 10 / t1) % 10
+		    >= 5)) ? 1 : 0;
+		n = malloc_snprintf(&buf[i], buflen-i,
+		    "%"FMTu64, (t0 * mult / t1) % 10 + round);
+		i += n;
+		mult *= 10;
+	}
+}
diff --git a/redis-stable/deps/jemalloc/test/stress/microbench.c b/redis-stable/deps/jemalloc/test/stress/microbench.c
new file mode 100644
index 00000000..988b7938
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/stress/microbench.c
@@ -0,0 +1,165 @@
+#include "test/jemalloc_test.h"
+
+static inline void
+time_func(timedelta_t *timer, uint64_t nwarmup, uint64_t niter,
+    void (*func)(void)) {
+	uint64_t i;
+
+	for (i = 0; i < nwarmup; i++) {
+		func();
+	}
+	timer_start(timer);
+	for (i = 0; i < niter; i++) {
+		func();
+	}
+	timer_stop(timer);
+}
+
+void
+compare_funcs(uint64_t nwarmup, uint64_t niter, const char *name_a,
+    void (*func_a), const char *name_b, void (*func_b)) {
+	timedelta_t timer_a, timer_b;
+	char ratio_buf[6];
+	void *p;
+
+	p = mallocx(1, 0);
+	if (p == NULL) {
+		test_fail("Unexpected mallocx() failure");
+		return;
+	}
+
+	time_func(&timer_a, nwarmup, niter, func_a);
+	time_func(&timer_b, nwarmup, niter, func_b);
+
+	timer_ratio(&timer_a, &timer_b, ratio_buf, sizeof(ratio_buf));
+	malloc_printf("%"FMTu64" iterations, %s=%"FMTu64"us, "
+	    "%s=%"FMTu64"us, ratio=1:%s\n",
+	    niter, name_a, timer_usec(&timer_a), name_b, timer_usec(&timer_b),
+	    ratio_buf);
+
+	dallocx(p, 0);
+}
+
+static void
+malloc_free(void) {
+	/* The compiler can optimize away free(malloc(1))! */
+	void *p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	free(p);
+}
+
+static void
+mallocx_free(void) {
+	void *p = mallocx(1, 0);
+	if (p == NULL) {
+		test_fail("Unexpected mallocx() failure");
+		return;
+	}
+	free(p);
+}
+
+TEST_BEGIN(test_malloc_vs_mallocx) {
+	compare_funcs(10*1000*1000, 100*1000*1000, "malloc",
+	    malloc_free, "mallocx", mallocx_free);
+}
+TEST_END
+
+static void
+malloc_dallocx(void) {
+	void *p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	dallocx(p, 0);
+}
+
+static void
+malloc_sdallocx(void) {
+	void *p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	sdallocx(p, 1, 0);
+}
+
+TEST_BEGIN(test_free_vs_dallocx) {
+	compare_funcs(10*1000*1000, 100*1000*1000, "free", malloc_free,
+	    "dallocx", malloc_dallocx);
+}
+TEST_END
+
+TEST_BEGIN(test_dallocx_vs_sdallocx) {
+	compare_funcs(10*1000*1000, 100*1000*1000, "dallocx", malloc_dallocx,
+	    "sdallocx", malloc_sdallocx);
+}
+TEST_END
+
+static void
+malloc_mus_free(void) {
+	void *p;
+
+	p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	malloc_usable_size(p);
+	free(p);
+}
+
+static void
+malloc_sallocx_free(void) {
+	void *p;
+
+	p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	if (sallocx(p, 0) < 1) {
+		test_fail("Unexpected sallocx() failure");
+	}
+	free(p);
+}
+
+TEST_BEGIN(test_mus_vs_sallocx) {
+	compare_funcs(10*1000*1000, 100*1000*1000, "malloc_usable_size",
+	    malloc_mus_free, "sallocx", malloc_sallocx_free);
+}
+TEST_END
+
+static void
+malloc_nallocx_free(void) {
+	void *p;
+
+	p = malloc(1);
+	if (p == NULL) {
+		test_fail("Unexpected malloc() failure");
+		return;
+	}
+	if (nallocx(1, 0) < 1) {
+		test_fail("Unexpected nallocx() failure");
+	}
+	free(p);
+}
+
+TEST_BEGIN(test_sallocx_vs_nallocx) {
+	compare_funcs(10*1000*1000, 100*1000*1000, "sallocx",
+	    malloc_sallocx_free, "nallocx", malloc_nallocx_free);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_malloc_vs_mallocx,
+	    test_free_vs_dallocx,
+	    test_dallocx_vs_sdallocx,
+	    test_mus_vs_sallocx,
+	    test_sallocx_vs_nallocx);
+}
diff --git a/redis-stable/deps/jemalloc/test/test.sh.in b/redis-stable/deps/jemalloc/test/test.sh.in
new file mode 100644
index 00000000..39302fff
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/test.sh.in
@@ -0,0 +1,80 @@
+#!/bin/sh
+
+case @abi@ in
+  macho)
+    export DYLD_FALLBACK_LIBRARY_PATH="@objroot@lib"
+    ;;
+  pecoff)
+    export PATH="${PATH}:@objroot@lib"
+    ;;
+  *)
+    ;;
+esac
+
+# Make a copy of the @JEMALLOC_CPREFIX@MALLOC_CONF passed in to this script, so
+# it can be repeatedly concatenated with per test settings.
+export MALLOC_CONF_ALL=${@JEMALLOC_CPREFIX@MALLOC_CONF}
+# Concatenate the individual test's MALLOC_CONF and MALLOC_CONF_ALL.
+export_malloc_conf() {
+  if [ "x${MALLOC_CONF}" != "x" -a "x${MALLOC_CONF_ALL}" != "x" ] ; then
+    export @JEMALLOC_CPREFIX@MALLOC_CONF="${MALLOC_CONF},${MALLOC_CONF_ALL}"
+  else
+    export @JEMALLOC_CPREFIX@MALLOC_CONF="${MALLOC_CONF}${MALLOC_CONF_ALL}"
+  fi
+}
+
+# Corresponds to test_status_t.
+pass_code=0
+skip_code=1
+fail_code=2
+
+pass_count=0
+skip_count=0
+fail_count=0
+for t in $@; do
+  if [ $pass_count -ne 0 -o $skip_count -ne 0 -o $fail_count != 0 ] ; then
+    echo
+  fi
+  echo "=== ${t} ==="
+  if [ -e "@srcroot@${t}.sh" ] ; then
+    # Source the shell script corresponding to the test in a subshell and
+    # execute the test.  This allows the shell script to set MALLOC_CONF, which
+    # is then used to set @JEMALLOC_CPREFIX@MALLOC_CONF (thus allowing the
+    # per test shell script to ignore the @JEMALLOC_CPREFIX@ detail).
+    enable_fill=@enable_fill@ \
+    enable_prof=@enable_prof@ \
+    . @srcroot@${t}.sh && \
+    export_malloc_conf && \
+    $JEMALLOC_TEST_PREFIX ${t}@exe@ @abs_srcroot@ @abs_objroot@
+  else
+    export MALLOC_CONF= && \
+    export_malloc_conf && \
+    $JEMALLOC_TEST_PREFIX ${t}@exe@ @abs_srcroot@ @abs_objroot@
+  fi
+  result_code=$?
+  case ${result_code} in
+    ${pass_code})
+      pass_count=$((pass_count+1))
+      ;;
+    ${skip_code})
+      skip_count=$((skip_count+1))
+      ;;
+    ${fail_code})
+      fail_count=$((fail_count+1))
+      ;;
+    *)
+      echo "Test harness error: ${t} w/ MALLOC_CONF=\"${MALLOC_CONF}\"" 1>&2
+      echo "Use prefix to debug, e.g. JEMALLOC_TEST_PREFIX=\"gdb --args\" sh test/test.sh ${t}" 1>&2
+      exit 1
+  esac
+done
+
+total_count=`expr ${pass_count} + ${skip_count} + ${fail_count}`
+echo
+echo "Test suite summary: pass: ${pass_count}/${total_count}, skip: ${skip_count}/${total_count}, fail: ${fail_count}/${total_count}"
+
+if [ ${fail_count} -eq 0 ] ; then
+  exit 0
+else
+  exit 1
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/SFMT.c b/redis-stable/deps/jemalloc/test/unit/SFMT.c
new file mode 100644
index 00000000..1fc8cf1b
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/SFMT.c
@@ -0,0 +1,1599 @@
+/*
+ * This file derives from SFMT 1.3.3
+ * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
+ * released under the terms of the following license:
+ *
+ *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
+ *   University. All rights reserved.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following conditions are
+ *   met:
+ *
+ *       * Redistributions of source code must retain the above copyright
+ *         notice, this list of conditions and the following disclaimer.
+ *       * Redistributions in binary form must reproduce the above
+ *         copyright notice, this list of conditions and the following
+ *         disclaimer in the documentation and/or other materials provided
+ *         with the distribution.
+ *       * Neither the name of the Hiroshima University nor the names of
+ *         its contributors may be used to endorse or promote products
+ *         derived from this software without specific prior written
+ *         permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#include "test/jemalloc_test.h"
+
+#define BLOCK_SIZE 10000
+#define BLOCK_SIZE64 (BLOCK_SIZE / 2)
+#define COUNT_1 1000
+#define COUNT_2 700
+
+static const uint32_t init_gen_rand_32_expected[] = {
+	3440181298U, 1564997079U, 1510669302U, 2930277156U, 1452439940U,
+	3796268453U,  423124208U, 2143818589U, 3827219408U, 2987036003U,
+	2674978610U, 1536842514U, 2027035537U, 2534897563U, 1686527725U,
+	 545368292U, 1489013321U, 1370534252U, 4231012796U, 3994803019U,
+	1764869045U,  824597505U,  862581900U, 2469764249U,  812862514U,
+	 359318673U,  116957936U, 3367389672U, 2327178354U, 1898245200U,
+	3206507879U, 2378925033U, 1040214787U, 2524778605U, 3088428700U,
+	1417665896U,  964324147U, 2282797708U, 2456269299U,  313400376U,
+	2245093271U, 1015729427U, 2694465011U, 3246975184U, 1992793635U,
+	 463679346U, 3721104591U, 3475064196U,  856141236U, 1499559719U,
+	3522818941U, 3721533109U, 1954826617U, 1282044024U, 1543279136U,
+	1301863085U, 2669145051U, 4221477354U, 3896016841U, 3392740262U,
+	 462466863U, 1037679449U, 1228140306U,  922298197U, 1205109853U,
+	1872938061U, 3102547608U, 2742766808U, 1888626088U, 4028039414U,
+	 157593879U, 1136901695U, 4038377686U, 3572517236U, 4231706728U,
+	2997311961U, 1189931652U, 3981543765U, 2826166703U,   87159245U,
+	1721379072U, 3897926942U, 1790395498U, 2569178939U, 1047368729U,
+	2340259131U, 3144212906U, 2301169789U, 2442885464U, 3034046771U,
+	3667880593U, 3935928400U, 2372805237U, 1666397115U, 2460584504U,
+	 513866770U, 3810869743U, 2147400037U, 2792078025U, 2941761810U,
+	3212265810U,  984692259U,  346590253U, 1804179199U, 3298543443U,
+	 750108141U, 2880257022U,  243310542U, 1869036465U, 1588062513U,
+	2983949551U, 1931450364U, 4034505847U, 2735030199U, 1628461061U,
+	2539522841U,  127965585U, 3992448871U,  913388237U,  559130076U,
+	1202933193U, 4087643167U, 2590021067U, 2256240196U, 1746697293U,
+	1013913783U, 1155864921U, 2715773730U,  915061862U, 1948766573U,
+	2322882854U, 3761119102U, 1343405684U, 3078711943U, 3067431651U,
+	3245156316U, 3588354584U, 3484623306U, 3899621563U, 4156689741U,
+	3237090058U, 3880063844U,  862416318U, 4039923869U, 2303788317U,
+	3073590536U,  701653667U, 2131530884U, 3169309950U, 2028486980U,
+	 747196777U, 3620218225U,  432016035U, 1449580595U, 2772266392U,
+	 444224948U, 1662832057U, 3184055582U, 3028331792U, 1861686254U,
+	1104864179U,  342430307U, 1350510923U, 3024656237U, 1028417492U,
+	2870772950U,  290847558U, 3675663500U,  508431529U, 4264340390U,
+	2263569913U, 1669302976U,  519511383U, 2706411211U, 3764615828U,
+	3883162495U, 4051445305U, 2412729798U, 3299405164U, 3991911166U,
+	2348767304U, 2664054906U, 3763609282U,  593943581U, 3757090046U,
+	2075338894U, 2020550814U, 4287452920U, 4290140003U, 1422957317U,
+	2512716667U, 2003485045U, 2307520103U, 2288472169U, 3940751663U,
+	4204638664U, 2892583423U, 1710068300U, 3904755993U, 2363243951U,
+	3038334120U,  547099465U,  771105860U, 3199983734U, 4282046461U,
+	2298388363U,  934810218U, 2837827901U, 3952500708U, 2095130248U,
+	3083335297U,   26885281U, 3932155283U, 1531751116U, 1425227133U,
+	 495654159U, 3279634176U, 3855562207U, 3957195338U, 4159985527U,
+	 893375062U, 1875515536U, 1327247422U, 3754140693U, 1028923197U,
+	1729880440U,  805571298U,  448971099U, 2726757106U, 2749436461U,
+	2485987104U,  175337042U, 3235477922U, 3882114302U, 2020970972U,
+	 943926109U, 2762587195U, 1904195558U, 3452650564U,  108432281U,
+	3893463573U, 3977583081U, 2636504348U, 1110673525U, 3548479841U,
+	4258854744U,  980047703U, 4057175418U, 3890008292U,  145653646U,
+	3141868989U, 3293216228U, 1194331837U, 1254570642U, 3049934521U,
+	2868313360U, 2886032750U, 1110873820U,  279553524U, 3007258565U,
+	1104807822U, 3186961098U,  315764646U, 2163680838U, 3574508994U,
+	3099755655U,  191957684U, 3642656737U, 3317946149U, 3522087636U,
+	 444526410U,  779157624U, 1088229627U, 1092460223U, 1856013765U,
+	3659877367U,  368270451U,  503570716U, 3000984671U, 2742789647U,
+	 928097709U, 2914109539U,  308843566U, 2816161253U, 3667192079U,
+	2762679057U, 3395240989U, 2928925038U, 1491465914U, 3458702834U,
+	3787782576U, 2894104823U, 1296880455U, 1253636503U,  989959407U,
+	2291560361U, 2776790436U, 1913178042U, 1584677829U,  689637520U,
+	1898406878U,  688391508U, 3385234998U,  845493284U, 1943591856U,
+	2720472050U,  222695101U, 1653320868U, 2904632120U, 4084936008U,
+	1080720688U, 3938032556U,  387896427U, 2650839632U,   99042991U,
+	1720913794U, 1047186003U, 1877048040U, 2090457659U,  517087501U,
+	4172014665U, 2129713163U, 2413533132U, 2760285054U, 4129272496U,
+	1317737175U, 2309566414U, 2228873332U, 3889671280U, 1110864630U,
+	3576797776U, 2074552772U,  832002644U, 3097122623U, 2464859298U,
+	2679603822U, 1667489885U, 3237652716U, 1478413938U, 1719340335U,
+	2306631119U,  639727358U, 3369698270U,  226902796U, 2099920751U,
+	1892289957U, 2201594097U, 3508197013U, 3495811856U, 3900381493U,
+	 841660320U, 3974501451U, 3360949056U, 1676829340U,  728899254U,
+	2047809627U, 2390948962U,  670165943U, 3412951831U, 4189320049U,
+	1911595255U, 2055363086U,  507170575U,  418219594U, 4141495280U,
+	2692088692U, 4203630654U, 3540093932U,  791986533U, 2237921051U,
+	2526864324U, 2956616642U, 1394958700U, 1983768223U, 1893373266U,
+	 591653646U,  228432437U, 1611046598U, 3007736357U, 1040040725U,
+	2726180733U, 2789804360U, 4263568405U,  829098158U, 3847722805U,
+	1123578029U, 1804276347U,  997971319U, 4203797076U, 4185199713U,
+	2811733626U, 2343642194U, 2985262313U, 1417930827U, 3759587724U,
+	1967077982U, 1585223204U, 1097475516U, 1903944948U,  740382444U,
+	1114142065U, 1541796065U, 1718384172U, 1544076191U, 1134682254U,
+	3519754455U, 2866243923U,  341865437U,  645498576U, 2690735853U,
+	1046963033U, 2493178460U, 1187604696U, 1619577821U,  488503634U,
+	3255768161U, 2306666149U, 1630514044U, 2377698367U, 2751503746U,
+	3794467088U, 1796415981U, 3657173746U,  409136296U, 1387122342U,
+	1297726519U,  219544855U, 4270285558U,  437578827U, 1444698679U,
+	2258519491U,  963109892U, 3982244073U, 3351535275U,  385328496U,
+	1804784013U,  698059346U, 3920535147U,  708331212U,  784338163U,
+	 785678147U, 1238376158U, 1557298846U, 2037809321U,  271576218U,
+	4145155269U, 1913481602U, 2763691931U,  588981080U, 1201098051U,
+	3717640232U, 1509206239U,  662536967U, 3180523616U, 1133105435U,
+	2963500837U, 2253971215U, 3153642623U, 1066925709U, 2582781958U,
+	3034720222U, 1090798544U, 2942170004U, 4036187520U,  686972531U,
+	2610990302U, 2641437026U, 1837562420U,  722096247U, 1315333033U,
+	2102231203U, 3402389208U, 3403698140U, 1312402831U, 2898426558U,
+	 814384596U,  385649582U, 1916643285U, 1924625106U, 2512905582U,
+	2501170304U, 4275223366U, 2841225246U, 1467663688U, 3563567847U,
+	2969208552U,  884750901U,  102992576U,  227844301U, 3681442994U,
+	3502881894U, 4034693299U, 1166727018U, 1697460687U, 1737778332U,
+	1787161139U, 1053003655U, 1215024478U, 2791616766U, 2525841204U,
+	1629323443U,    3233815U, 2003823032U, 3083834263U, 2379264872U,
+	3752392312U, 1287475550U, 3770904171U, 3004244617U, 1502117784U,
+	 918698423U, 2419857538U, 3864502062U, 1751322107U, 2188775056U,
+	4018728324U,  983712955U,  440071928U, 3710838677U, 2001027698U,
+	3994702151U,   22493119U, 3584400918U, 3446253670U, 4254789085U,
+	1405447860U, 1240245579U, 1800644159U, 1661363424U, 3278326132U,
+	3403623451U,   67092802U, 2609352193U, 3914150340U, 1814842761U,
+	3610830847U,  591531412U, 3880232807U, 1673505890U, 2585326991U,
+	1678544474U, 3148435887U, 3457217359U, 1193226330U, 2816576908U,
+	 154025329U,  121678860U, 1164915738U,  973873761U,  269116100U,
+	  52087970U,  744015362U,  498556057U,   94298882U, 1563271621U,
+	2383059628U, 4197367290U, 3958472990U, 2592083636U, 2906408439U,
+	1097742433U, 3924840517U,  264557272U, 2292287003U, 3203307984U,
+	4047038857U, 3820609705U, 2333416067U, 1839206046U, 3600944252U,
+	3412254904U,  583538222U, 2390557166U, 4140459427U, 2810357445U,
+	 226777499U, 2496151295U, 2207301712U, 3283683112U,  611630281U,
+	1933218215U, 3315610954U, 3889441987U, 3719454256U, 3957190521U,
+	1313998161U, 2365383016U, 3146941060U, 1801206260U,  796124080U,
+	2076248581U, 1747472464U, 3254365145U,  595543130U, 3573909503U,
+	3758250204U, 2020768540U, 2439254210U,   93368951U, 3155792250U,
+	2600232980U, 3709198295U, 3894900440U, 2971850836U, 1578909644U,
+	1443493395U, 2581621665U, 3086506297U, 2443465861U,  558107211U,
+	1519367835U,  249149686U,  908102264U, 2588765675U, 1232743965U,
+	1001330373U, 3561331654U, 2259301289U, 1564977624U, 3835077093U,
+	 727244906U, 4255738067U, 1214133513U, 2570786021U, 3899704621U,
+	1633861986U, 1636979509U, 1438500431U,   58463278U, 2823485629U,
+	2297430187U, 2926781924U, 3371352948U, 1864009023U, 2722267973U,
+	1444292075U,  437703973U, 1060414512U,  189705863U,  910018135U,
+	4077357964U,  884213423U, 2644986052U, 3973488374U, 1187906116U,
+	2331207875U,  780463700U, 3713351662U, 3854611290U,  412805574U,
+	2978462572U, 2176222820U,  829424696U, 2790788332U, 2750819108U,
+	1594611657U, 3899878394U, 3032870364U, 1702887682U, 1948167778U,
+	  14130042U,  192292500U,  947227076U,   90719497U, 3854230320U,
+	 784028434U, 2142399787U, 1563449646U, 2844400217U,  819143172U,
+	2883302356U, 2328055304U, 1328532246U, 2603885363U, 3375188924U,
+	 933941291U, 3627039714U, 2129697284U, 2167253953U, 2506905438U,
+	1412424497U, 2981395985U, 1418359660U, 2925902456U,   52752784U,
+	3713667988U, 3924669405U,  648975707U, 1145520213U, 4018650664U,
+	3805915440U, 2380542088U, 2013260958U, 3262572197U, 2465078101U,
+	1114540067U, 3728768081U, 2396958768U,  590672271U,  904818725U,
+	4263660715U,  700754408U, 1042601829U, 4094111823U, 4274838909U,
+	2512692617U, 2774300207U, 2057306915U, 3470942453U,   99333088U,
+	1142661026U, 2889931380U,   14316674U, 2201179167U,  415289459U,
+	 448265759U, 3515142743U, 3254903683U,  246633281U, 1184307224U,
+	2418347830U, 2092967314U, 2682072314U, 2558750234U, 2000352263U,
+	1544150531U,  399010405U, 1513946097U,  499682937U,  461167460U,
+	3045570638U, 1633669705U,  851492362U, 4052801922U, 2055266765U,
+	 635556996U,  368266356U, 2385737383U, 3218202352U, 2603772408U,
+	 349178792U,  226482567U, 3102426060U, 3575998268U, 2103001871U,
+	3243137071U,  225500688U, 1634718593U, 4283311431U, 4292122923U,
+	3842802787U,  811735523U,  105712518U,  663434053U, 1855889273U,
+	2847972595U, 1196355421U, 2552150115U, 4254510614U, 3752181265U,
+	3430721819U, 3828705396U, 3436287905U, 3441964937U, 4123670631U,
+	 353001539U,  459496439U, 3799690868U, 1293777660U, 2761079737U,
+	 498096339U, 3398433374U, 4080378380U, 2304691596U, 2995729055U,
+	4134660419U, 3903444024U, 3576494993U,  203682175U, 3321164857U,
+	2747963611U,   79749085U, 2992890370U, 1240278549U, 1772175713U,
+	2111331972U, 2655023449U, 1683896345U, 2836027212U, 3482868021U,
+	2489884874U,  756853961U, 2298874501U, 4013448667U, 4143996022U,
+	2948306858U, 4132920035U, 1283299272U,  995592228U, 3450508595U,
+	1027845759U, 1766942720U, 3861411826U, 1446861231U,   95974993U,
+	3502263554U, 1487532194U,  601502472U, 4129619129U,  250131773U,
+	2050079547U, 3198903947U, 3105589778U, 4066481316U, 3026383978U,
+	2276901713U,  365637751U, 2260718426U, 1394775634U, 1791172338U,
+	2690503163U, 2952737846U, 1568710462U,  732623190U, 2980358000U,
+	1053631832U, 1432426951U, 3229149635U, 1854113985U, 3719733532U,
+	3204031934U,  735775531U,  107468620U, 3734611984U,  631009402U,
+	3083622457U, 4109580626U,  159373458U, 1301970201U, 4132389302U,
+	1293255004U,  847182752U, 4170022737U,   96712900U, 2641406755U,
+	1381727755U,  405608287U, 4287919625U, 1703554290U, 3589580244U,
+	2911403488U,    2166565U, 2647306451U, 2330535117U, 1200815358U,
+	1165916754U,  245060911U, 4040679071U, 3684908771U, 2452834126U,
+	2486872773U, 2318678365U, 2940627908U, 1837837240U, 3447897409U,
+	4270484676U, 1495388728U, 3754288477U, 4204167884U, 1386977705U,
+	2692224733U, 3076249689U, 4109568048U, 4170955115U, 4167531356U,
+	4020189950U, 4261855038U, 3036907575U, 3410399885U, 3076395737U,
+	1046178638U,  144496770U,  230725846U, 3349637149U,   17065717U,
+	2809932048U, 2054581785U, 3608424964U, 3259628808U,  134897388U,
+	3743067463U,  257685904U, 3795656590U, 1562468719U, 3589103904U,
+	3120404710U,  254684547U, 2653661580U, 3663904795U, 2631942758U,
+	1063234347U, 2609732900U, 2332080715U, 3521125233U, 1180599599U,
+	1935868586U, 4110970440U,  296706371U, 2128666368U, 1319875791U,
+	1570900197U, 3096025483U, 1799882517U, 1928302007U, 1163707758U,
+	1244491489U, 3533770203U,  567496053U, 2757924305U, 2781639343U,
+	2818420107U,  560404889U, 2619609724U, 4176035430U, 2511289753U,
+	2521842019U, 3910553502U, 2926149387U, 3302078172U, 4237118867U,
+	 330725126U,  367400677U,  888239854U,  545570454U, 4259590525U,
+	 134343617U, 1102169784U, 1647463719U, 3260979784U, 1518840883U,
+	3631537963U, 3342671457U, 1301549147U, 2083739356U,  146593792U,
+	3217959080U,  652755743U, 2032187193U, 3898758414U, 1021358093U,
+	4037409230U, 2176407931U, 3427391950U, 2883553603U,  985613827U,
+	3105265092U, 3423168427U, 3387507672U,  467170288U, 2141266163U,
+	3723870208U,  916410914U, 1293987799U, 2652584950U,  769160137U,
+	3205292896U, 1561287359U, 1684510084U, 3136055621U, 3765171391U,
+	 639683232U, 2639569327U, 1218546948U, 4263586685U, 3058215773U,
+	2352279820U,  401870217U, 2625822463U, 1529125296U, 2981801895U,
+	1191285226U, 4027725437U, 3432700217U, 4098835661U,  971182783U,
+	2443861173U, 3881457123U, 3874386651U,  457276199U, 2638294160U,
+	4002809368U,  421169044U, 1112642589U, 3076213779U, 3387033971U,
+	2499610950U, 3057240914U, 1662679783U,  461224431U, 1168395933U
+};
+static const uint32_t init_by_array_32_expected[] = {
+	2920711183U, 3885745737U, 3501893680U,  856470934U, 1421864068U,
+	 277361036U, 1518638004U, 2328404353U, 3355513634U,   64329189U,
+	1624587673U, 3508467182U, 2481792141U, 3706480799U, 1925859037U,
+	2913275699U,  882658412U,  384641219U,  422202002U, 1873384891U,
+	2006084383U, 3924929912U, 1636718106U, 3108838742U, 1245465724U,
+	4195470535U,  779207191U, 1577721373U, 1390469554U, 2928648150U,
+	 121399709U, 3170839019U, 4044347501U,  953953814U, 3821710850U,
+	3085591323U, 3666535579U, 3577837737U, 2012008410U, 3565417471U,
+	4044408017U,  433600965U, 1637785608U, 1798509764U,  860770589U,
+	3081466273U, 3982393409U, 2451928325U, 3437124742U, 4093828739U,
+	3357389386U, 2154596123U,  496568176U, 2650035164U, 2472361850U,
+	   3438299U, 2150366101U, 1577256676U, 3802546413U, 1787774626U,
+	4078331588U, 3706103141U,  170391138U, 3806085154U, 1680970100U,
+	1961637521U, 3316029766U,  890610272U, 1453751581U, 1430283664U,
+	3051057411U, 3597003186U,  542563954U, 3796490244U, 1690016688U,
+	3448752238U,  440702173U,  347290497U, 1121336647U, 2540588620U,
+	 280881896U, 2495136428U,  213707396U,   15104824U, 2946180358U,
+	 659000016U,  566379385U, 2614030979U, 2855760170U,  334526548U,
+	2315569495U, 2729518615U,  564745877U, 1263517638U, 3157185798U,
+	1604852056U, 1011639885U, 2950579535U, 2524219188U,  312951012U,
+	1528896652U, 1327861054U, 2846910138U, 3966855905U, 2536721582U,
+	 855353911U, 1685434729U, 3303978929U, 1624872055U, 4020329649U,
+	3164802143U, 1642802700U, 1957727869U, 1792352426U, 3334618929U,
+	2631577923U, 3027156164U,  842334259U, 3353446843U, 1226432104U,
+	1742801369U, 3552852535U, 3471698828U, 1653910186U, 3380330939U,
+	2313782701U, 3351007196U, 2129839995U, 1800682418U, 4085884420U,
+	1625156629U, 3669701987U,  615211810U, 3294791649U, 4131143784U,
+	2590843588U, 3207422808U, 3275066464U,  561592872U, 3957205738U,
+	3396578098U,   48410678U, 3505556445U, 1005764855U, 3920606528U,
+	2936980473U, 2378918600U, 2404449845U, 1649515163U,  701203563U,
+	3705256349U,   83714199U, 3586854132U,  922978446U, 2863406304U,
+	3523398907U, 2606864832U, 2385399361U, 3171757816U, 4262841009U,
+	3645837721U, 1169579486U, 3666433897U, 3174689479U, 1457866976U,
+	3803895110U, 3346639145U, 1907224409U, 1978473712U, 1036712794U,
+	 980754888U, 1302782359U, 1765252468U,  459245755U, 3728923860U,
+	1512894209U, 2046491914U,  207860527U,  514188684U, 2288713615U,
+	1597354672U, 3349636117U, 2357291114U, 3995796221U,  945364213U,
+	1893326518U, 3770814016U, 1691552714U, 2397527410U,  967486361U,
+	 776416472U, 4197661421U,  951150819U, 1852770983U, 4044624181U,
+	1399439738U, 4194455275U, 2284037669U, 1550734958U, 3321078108U,
+	1865235926U, 2912129961U, 2664980877U, 1357572033U, 2600196436U,
+	2486728200U, 2372668724U, 1567316966U, 2374111491U, 1839843570U,
+	  20815612U, 3727008608U, 3871996229U,  824061249U, 1932503978U,
+	3404541726U,  758428924U, 2609331364U, 1223966026U, 1299179808U,
+	 648499352U, 2180134401U,  880821170U, 3781130950U,  113491270U,
+	1032413764U, 4185884695U, 2490396037U, 1201932817U, 4060951446U,
+	4165586898U, 1629813212U, 2887821158U,  415045333U,  628926856U,
+	2193466079U, 3391843445U, 2227540681U, 1907099846U, 2848448395U,
+	1717828221U, 1372704537U, 1707549841U, 2294058813U, 2101214437U,
+	2052479531U, 1695809164U, 3176587306U, 2632770465U,   81634404U,
+	1603220563U,  644238487U,  302857763U,  897352968U, 2613146653U,
+	1391730149U, 4245717312U, 4191828749U, 1948492526U, 2618174230U,
+	3992984522U, 2178852787U, 3596044509U, 3445573503U, 2026614616U,
+	 915763564U, 3415689334U, 2532153403U, 3879661562U, 2215027417U,
+	3111154986U, 2929478371U,  668346391U, 1152241381U, 2632029711U,
+	3004150659U, 2135025926U,  948690501U, 2799119116U, 4228829406U,
+	1981197489U, 4209064138U,  684318751U, 3459397845U,  201790843U,
+	4022541136U, 3043635877U,  492509624U, 3263466772U, 1509148086U,
+	 921459029U, 3198857146U,  705479721U, 3835966910U, 3603356465U,
+	 576159741U, 1742849431U,  594214882U, 2055294343U, 3634861861U,
+	 449571793U, 3246390646U, 3868232151U, 1479156585U, 2900125656U,
+	2464815318U, 3960178104U, 1784261920U,   18311476U, 3627135050U,
+	 644609697U,  424968996U,  919890700U, 2986824110U,  816423214U,
+	4003562844U, 1392714305U, 1757384428U, 2569030598U,  995949559U,
+	3875659880U, 2933807823U, 2752536860U, 2993858466U, 4030558899U,
+	2770783427U, 2775406005U, 2777781742U, 1931292655U,  472147933U,
+	3865853827U, 2726470545U, 2668412860U, 2887008249U,  408979190U,
+	3578063323U, 3242082049U, 1778193530U,   27981909U, 2362826515U,
+	 389875677U, 1043878156U,  581653903U, 3830568952U,  389535942U,
+	3713523185U, 2768373359U, 2526101582U, 1998618197U, 1160859704U,
+	3951172488U, 1098005003U,  906275699U, 3446228002U, 2220677963U,
+	2059306445U,  132199571U,  476838790U, 1868039399U, 3097344807U,
+	 857300945U,  396345050U, 2835919916U, 1782168828U, 1419519470U,
+	4288137521U,  819087232U,  596301494U,  872823172U, 1526888217U,
+	 805161465U, 1116186205U, 2829002754U, 2352620120U,  620121516U,
+	 354159268U, 3601949785U,  209568138U, 1352371732U, 2145977349U,
+	4236871834U, 1539414078U, 3558126206U, 3224857093U, 4164166682U,
+	3817553440U, 3301780278U, 2682696837U, 3734994768U, 1370950260U,
+	1477421202U, 2521315749U, 1330148125U, 1261554731U, 2769143688U,
+	3554756293U, 4235882678U, 3254686059U, 3530579953U, 1215452615U,
+	3574970923U, 4057131421U,  589224178U, 1000098193U,  171190718U,
+	2521852045U, 2351447494U, 2284441580U, 2646685513U, 3486933563U,
+	3789864960U, 1190528160U, 1702536782U, 1534105589U, 4262946827U,
+	2726686826U, 3584544841U, 2348270128U, 2145092281U, 2502718509U,
+	1027832411U, 3571171153U, 1287361161U, 4011474411U, 3241215351U,
+	2419700818U,  971242709U, 1361975763U, 1096842482U, 3271045537U,
+	  81165449U,  612438025U, 3912966678U, 1356929810U,  733545735U,
+	 537003843U, 1282953084U,  884458241U,  588930090U, 3930269801U,
+	2961472450U, 1219535534U, 3632251943U,  268183903U, 1441240533U,
+	3653903360U, 3854473319U, 2259087390U, 2548293048U, 2022641195U,
+	2105543911U, 1764085217U, 3246183186U,  482438805U,  888317895U,
+	2628314765U, 2466219854U,  717546004U, 2322237039U,  416725234U,
+	1544049923U, 1797944973U, 3398652364U, 3111909456U,  485742908U,
+	2277491072U, 1056355088U, 3181001278U,  129695079U, 2693624550U,
+	1764438564U, 3797785470U,  195503713U, 3266519725U, 2053389444U,
+	1961527818U, 3400226523U, 3777903038U, 2597274307U, 4235851091U,
+	4094406648U, 2171410785U, 1781151386U, 1378577117U,  654643266U,
+	3424024173U, 3385813322U,  679385799U,  479380913U,  681715441U,
+	3096225905U,  276813409U, 3854398070U, 2721105350U,  831263315U,
+	3276280337U, 2628301522U, 3984868494U, 1466099834U, 2104922114U,
+	1412672743U,  820330404U, 3491501010U,  942735832U,  710652807U,
+	3972652090U,  679881088U,   40577009U, 3705286397U, 2815423480U,
+	3566262429U,  663396513U, 3777887429U, 4016670678U,  404539370U,
+	1142712925U, 1140173408U, 2913248352U, 2872321286U,  263751841U,
+	3175196073U, 3162557581U, 2878996619U,   75498548U, 3836833140U,
+	3284664959U, 1157523805U,  112847376U,  207855609U, 1337979698U,
+	1222578451U,  157107174U,  901174378U, 3883717063U, 1618632639U,
+	1767889440U, 4264698824U, 1582999313U,  884471997U, 2508825098U,
+	3756370771U, 2457213553U, 3565776881U, 3709583214U,  915609601U,
+	 460833524U, 1091049576U,   85522880U,    2553251U,  132102809U,
+	2429882442U, 2562084610U, 1386507633U, 4112471229U,   21965213U,
+	1981516006U, 2418435617U, 3054872091U, 4251511224U, 2025783543U,
+	1916911512U, 2454491136U, 3938440891U, 3825869115U, 1121698605U,
+	3463052265U,  802340101U, 1912886800U, 4031997367U, 3550640406U,
+	1596096923U,  610150600U,  431464457U, 2541325046U,  486478003U,
+	 739704936U, 2862696430U, 3037903166U, 1129749694U, 2611481261U,
+	1228993498U,  510075548U, 3424962587U, 2458689681U,  818934833U,
+	4233309125U, 1608196251U, 3419476016U, 1858543939U, 2682166524U,
+	3317854285U,  631986188U, 3008214764U,  613826412U, 3567358221U,
+	3512343882U, 1552467474U, 3316162670U, 1275841024U, 4142173454U,
+	 565267881U,  768644821U,  198310105U, 2396688616U, 1837659011U,
+	 203429334U,  854539004U, 4235811518U, 3338304926U, 3730418692U,
+	3852254981U, 3032046452U, 2329811860U, 2303590566U, 2696092212U,
+	3894665932U,  145835667U,  249563655U, 1932210840U, 2431696407U,
+	3312636759U,  214962629U, 2092026914U, 3020145527U, 4073039873U,
+	2739105705U, 1308336752U,  855104522U, 2391715321U,   67448785U,
+	 547989482U,  854411802U, 3608633740U,  431731530U,  537375589U,
+	3888005760U,  696099141U,  397343236U, 1864511780U,   44029739U,
+	1729526891U, 1993398655U, 2010173426U, 2591546756U,  275223291U,
+	1503900299U, 4217765081U, 2185635252U, 1122436015U, 3550155364U,
+	 681707194U, 3260479338U,  933579397U, 2983029282U, 2505504587U,
+	2667410393U, 2962684490U, 4139721708U, 2658172284U, 2452602383U,
+	2607631612U, 1344296217U, 3075398709U, 2949785295U, 1049956168U,
+	3917185129U, 2155660174U, 3280524475U, 1503827867U,  674380765U,
+	1918468193U, 3843983676U,  634358221U, 2538335643U, 1873351298U,
+	3368723763U, 2129144130U, 3203528633U, 3087174986U, 2691698871U,
+	2516284287U,   24437745U, 1118381474U, 2816314867U, 2448576035U,
+	4281989654U,  217287825U,  165872888U, 2628995722U, 3533525116U,
+	2721669106U,  872340568U, 3429930655U, 3309047304U, 3916704967U,
+	3270160355U, 1348884255U, 1634797670U,  881214967U, 4259633554U,
+	 174613027U, 1103974314U, 1625224232U, 2678368291U, 1133866707U,
+	3853082619U, 4073196549U, 1189620777U,  637238656U,  930241537U,
+	4042750792U, 3842136042U, 2417007212U, 2524907510U, 1243036827U,
+	1282059441U, 3764588774U, 1394459615U, 2323620015U, 1166152231U,
+	3307479609U, 3849322257U, 3507445699U, 4247696636U,  758393720U,
+	 967665141U, 1095244571U, 1319812152U,  407678762U, 2640605208U,
+	2170766134U, 3663594275U, 4039329364U, 2512175520U,  725523154U,
+	2249807004U, 3312617979U, 2414634172U, 1278482215U,  349206484U,
+	1573063308U, 1196429124U, 3873264116U, 2400067801U,  268795167U,
+	 226175489U, 2961367263U, 1968719665U,   42656370U, 1010790699U,
+	 561600615U, 2422453992U, 3082197735U, 1636700484U, 3977715296U,
+	3125350482U, 3478021514U, 2227819446U, 1540868045U, 3061908980U,
+	1087362407U, 3625200291U,  361937537U,  580441897U, 1520043666U,
+	2270875402U, 1009161260U, 2502355842U, 4278769785U,  473902412U,
+	1057239083U, 1905829039U, 1483781177U, 2080011417U, 1207494246U,
+	1806991954U, 2194674403U, 3455972205U,  807207678U, 3655655687U,
+	 674112918U,  195425752U, 3917890095U, 1874364234U, 1837892715U,
+	3663478166U, 1548892014U, 2570748714U, 2049929836U, 2167029704U,
+	 697543767U, 3499545023U, 3342496315U, 1725251190U, 3561387469U,
+	2905606616U, 1580182447U, 3934525927U, 4103172792U, 1365672522U,
+	1534795737U, 3308667416U, 2841911405U, 3943182730U, 4072020313U,
+	3494770452U, 3332626671U,   55327267U,  478030603U,  411080625U,
+	3419529010U, 1604767823U, 3513468014U,  570668510U,  913790824U,
+	2283967995U,  695159462U, 3825542932U, 4150698144U, 1829758699U,
+	 202895590U, 1609122645U, 1267651008U, 2910315509U, 2511475445U,
+	2477423819U, 3932081579U,  900879979U, 2145588390U, 2670007504U,
+	 580819444U, 1864996828U, 2526325979U, 1019124258U,  815508628U,
+	2765933989U, 1277301341U, 3006021786U,  855540956U,  288025710U,
+	1919594237U, 2331223864U,  177452412U, 2475870369U, 2689291749U,
+	 865194284U,  253432152U, 2628531804U, 2861208555U, 2361597573U,
+	1653952120U, 1039661024U, 2159959078U, 3709040440U, 3564718533U,
+	2596878672U, 2041442161U,   31164696U, 2662962485U, 3665637339U,
+	1678115244U, 2699839832U, 3651968520U, 3521595541U,  458433303U,
+	2423096824U,   21831741U,  380011703U, 2498168716U,  861806087U,
+	1673574843U, 4188794405U, 2520563651U, 2632279153U, 2170465525U,
+	4171949898U, 3886039621U, 1661344005U, 3424285243U,  992588372U,
+	2500984144U, 2993248497U, 3590193895U, 1535327365U,  515645636U,
+	 131633450U, 3729760261U, 1613045101U, 3254194278U,   15889678U,
+	1493590689U,  244148718U, 2991472662U, 1401629333U,  777349878U,
+	2501401703U, 4285518317U, 3794656178U,  955526526U, 3442142820U,
+	3970298374U,  736025417U, 2737370764U, 1271509744U,  440570731U,
+	 136141826U, 1596189518U,  923399175U,  257541519U, 3505774281U,
+	2194358432U, 2518162991U, 1379893637U, 2667767062U, 3748146247U,
+	1821712620U, 3923161384U, 1947811444U, 2392527197U, 4127419685U,
+	1423694998U, 4156576871U, 1382885582U, 3420127279U, 3617499534U,
+	2994377493U, 4038063986U, 1918458672U, 2983166794U, 4200449033U,
+	 353294540U, 1609232588U,  243926648U, 2332803291U,  507996832U,
+	2392838793U, 4075145196U, 2060984340U, 4287475136U,   88232602U,
+	2491531140U, 4159725633U, 2272075455U,  759298618U,  201384554U,
+	 838356250U, 1416268324U,  674476934U,   90795364U,  141672229U,
+	3660399588U, 4196417251U, 3249270244U, 3774530247U,   59587265U,
+	3683164208U,   19392575U, 1463123697U, 1882205379U,  293780489U,
+	2553160622U, 2933904694U,  675638239U, 2851336944U, 1435238743U,
+	2448730183U,  804436302U, 2119845972U,  322560608U, 4097732704U,
+	2987802540U,  641492617U, 2575442710U, 4217822703U, 3271835300U,
+	2836418300U, 3739921620U, 2138378768U, 2879771855U, 4294903423U,
+	3121097946U, 2603440486U, 2560820391U, 1012930944U, 2313499967U,
+	 584489368U, 3431165766U,  897384869U, 2062537737U, 2847889234U,
+	3742362450U, 2951174585U, 4204621084U, 1109373893U, 3668075775U,
+	2750138839U, 3518055702U,  733072558U, 4169325400U,  788493625U
+};
+static const uint64_t init_gen_rand_64_expected[] = {
+	KQU(16924766246869039260), KQU( 8201438687333352714),
+	KQU( 2265290287015001750), KQU(18397264611805473832),
+	KQU( 3375255223302384358), KQU( 6345559975416828796),
+	KQU(18229739242790328073), KQU( 7596792742098800905),
+	KQU(  255338647169685981), KQU( 2052747240048610300),
+	KQU(18328151576097299343), KQU(12472905421133796567),
+	KQU(11315245349717600863), KQU(16594110197775871209),
+	KQU(15708751964632456450), KQU(10452031272054632535),
+	KQU(11097646720811454386), KQU( 4556090668445745441),
+	KQU(17116187693090663106), KQU(14931526836144510645),
+	KQU( 9190752218020552591), KQU( 9625800285771901401),
+	KQU(13995141077659972832), KQU( 5194209094927829625),
+	KQU( 4156788379151063303), KQU( 8523452593770139494),
+	KQU(14082382103049296727), KQU( 2462601863986088483),
+	KQU( 3030583461592840678), KQU( 5221622077872827681),
+	KQU( 3084210671228981236), KQU(13956758381389953823),
+	KQU(13503889856213423831), KQU(15696904024189836170),
+	KQU( 4612584152877036206), KQU( 6231135538447867881),
+	KQU(10172457294158869468), KQU( 6452258628466708150),
+	KQU(14044432824917330221), KQU(  370168364480044279),
+	KQU(10102144686427193359), KQU(  667870489994776076),
+	KQU( 2732271956925885858), KQU(18027788905977284151),
+	KQU(15009842788582923859), KQU( 7136357960180199542),
+	KQU(15901736243475578127), KQU(16951293785352615701),
+	KQU(10551492125243691632), KQU(17668869969146434804),
+	KQU(13646002971174390445), KQU( 9804471050759613248),
+	KQU( 5511670439655935493), KQU(18103342091070400926),
+	KQU(17224512747665137533), KQU(15534627482992618168),
+	KQU( 1423813266186582647), KQU(15821176807932930024),
+	KQU(   30323369733607156), KQU(11599382494723479403),
+	KQU(  653856076586810062), KQU( 3176437395144899659),
+	KQU(14028076268147963917), KQU(16156398271809666195),
+	KQU( 3166955484848201676), KQU( 5746805620136919390),
+	KQU(17297845208891256593), KQU(11691653183226428483),
+	KQU(17900026146506981577), KQU(15387382115755971042),
+	KQU(16923567681040845943), KQU( 8039057517199388606),
+	KQU(11748409241468629263), KQU(  794358245539076095),
+	KQU(13438501964693401242), KQU(14036803236515618962),
+	KQU( 5252311215205424721), KQU(17806589612915509081),
+	KQU( 6802767092397596006), KQU(14212120431184557140),
+	KQU( 1072951366761385712), KQU(13098491780722836296),
+	KQU( 9466676828710797353), KQU(12673056849042830081),
+	KQU(12763726623645357580), KQU(16468961652999309493),
+	KQU(15305979875636438926), KQU(17444713151223449734),
+	KQU( 5692214267627883674), KQU(13049589139196151505),
+	KQU(  880115207831670745), KQU( 1776529075789695498),
+	KQU(16695225897801466485), KQU(10666901778795346845),
+	KQU( 6164389346722833869), KQU( 2863817793264300475),
+	KQU( 9464049921886304754), KQU( 3993566636740015468),
+	KQU( 9983749692528514136), KQU(16375286075057755211),
+	KQU(16042643417005440820), KQU(11445419662923489877),
+	KQU( 7999038846885158836), KQU( 6721913661721511535),
+	KQU( 5363052654139357320), KQU( 1817788761173584205),
+	KQU(13290974386445856444), KQU( 4650350818937984680),
+	KQU( 8219183528102484836), KQU( 1569862923500819899),
+	KQU( 4189359732136641860), KQU(14202822961683148583),
+	KQU( 4457498315309429058), KQU(13089067387019074834),
+	KQU(11075517153328927293), KQU(10277016248336668389),
+	KQU( 7070509725324401122), KQU(17808892017780289380),
+	KQU(13143367339909287349), KQU( 1377743745360085151),
+	KQU( 5749341807421286485), KQU(14832814616770931325),
+	KQU( 7688820635324359492), KQU(10960474011539770045),
+	KQU(   81970066653179790), KQU(12619476072607878022),
+	KQU( 4419566616271201744), KQU(15147917311750568503),
+	KQU( 5549739182852706345), KQU( 7308198397975204770),
+	KQU(13580425496671289278), KQU(17070764785210130301),
+	KQU( 8202832846285604405), KQU( 6873046287640887249),
+	KQU( 6927424434308206114), KQU( 6139014645937224874),
+	KQU(10290373645978487639), KQU(15904261291701523804),
+	KQU( 9628743442057826883), KQU(18383429096255546714),
+	KQU( 4977413265753686967), KQU( 7714317492425012869),
+	KQU( 9025232586309926193), KQU(14627338359776709107),
+	KQU(14759849896467790763), KQU(10931129435864423252),
+	KQU( 4588456988775014359), KQU(10699388531797056724),
+	KQU(  468652268869238792), KQU( 5755943035328078086),
+	KQU( 2102437379988580216), KQU( 9986312786506674028),
+	KQU( 2654207180040945604), KQU( 8726634790559960062),
+	KQU(  100497234871808137), KQU( 2800137176951425819),
+	KQU( 6076627612918553487), KQU( 5780186919186152796),
+	KQU( 8179183595769929098), KQU( 6009426283716221169),
+	KQU( 2796662551397449358), KQU( 1756961367041986764),
+	KQU( 6972897917355606205), KQU(14524774345368968243),
+	KQU( 2773529684745706940), KQU( 4853632376213075959),
+	KQU( 4198177923731358102), KQU( 8271224913084139776),
+	KQU( 2741753121611092226), KQU(16782366145996731181),
+	KQU(15426125238972640790), KQU(13595497100671260342),
+	KQU( 3173531022836259898), KQU( 6573264560319511662),
+	KQU(18041111951511157441), KQU( 2351433581833135952),
+	KQU( 3113255578908173487), KQU( 1739371330877858784),
+	KQU(16046126562789165480), KQU( 8072101652214192925),
+	KQU(15267091584090664910), KQU( 9309579200403648940),
+	KQU( 5218892439752408722), KQU(14492477246004337115),
+	KQU(17431037586679770619), KQU( 7385248135963250480),
+	KQU( 9580144956565560660), KQU( 4919546228040008720),
+	KQU(15261542469145035584), KQU(18233297270822253102),
+	KQU( 5453248417992302857), KQU( 9309519155931460285),
+	KQU(10342813012345291756), KQU(15676085186784762381),
+	KQU(15912092950691300645), KQU( 9371053121499003195),
+	KQU( 9897186478226866746), KQU(14061858287188196327),
+	KQU(  122575971620788119), KQU(12146750969116317754),
+	KQU( 4438317272813245201), KQU( 8332576791009527119),
+	KQU(13907785691786542057), KQU(10374194887283287467),
+	KQU( 2098798755649059566), KQU( 3416235197748288894),
+	KQU( 8688269957320773484), KQU( 7503964602397371571),
+	KQU(16724977015147478236), KQU( 9461512855439858184),
+	KQU(13259049744534534727), KQU( 3583094952542899294),
+	KQU( 8764245731305528292), KQU(13240823595462088985),
+	KQU(13716141617617910448), KQU(18114969519935960955),
+	KQU( 2297553615798302206), KQU( 4585521442944663362),
+	KQU(17776858680630198686), KQU( 4685873229192163363),
+	KQU(  152558080671135627), KQU(15424900540842670088),
+	KQU(13229630297130024108), KQU(17530268788245718717),
+	KQU(16675633913065714144), KQU( 3158912717897568068),
+	KQU(15399132185380087288), KQU( 7401418744515677872),
+	KQU(13135412922344398535), KQU( 6385314346100509511),
+	KQU(13962867001134161139), KQU(10272780155442671999),
+	KQU(12894856086597769142), KQU(13340877795287554994),
+	KQU(12913630602094607396), KQU(12543167911119793857),
+	KQU(17343570372251873096), KQU(10959487764494150545),
+	KQU( 6966737953093821128), KQU(13780699135496988601),
+	KQU( 4405070719380142046), KQU(14923788365607284982),
+	KQU( 2869487678905148380), KQU( 6416272754197188403),
+	KQU(15017380475943612591), KQU( 1995636220918429487),
+	KQU( 3402016804620122716), KQU(15800188663407057080),
+	KQU(11362369990390932882), KQU(15262183501637986147),
+	KQU(10239175385387371494), KQU( 9352042420365748334),
+	KQU( 1682457034285119875), KQU( 1724710651376289644),
+	KQU( 2038157098893817966), KQU( 9897825558324608773),
+	KQU( 1477666236519164736), KQU(16835397314511233640),
+	KQU(10370866327005346508), KQU(10157504370660621982),
+	KQU(12113904045335882069), KQU(13326444439742783008),
+	KQU(11302769043000765804), KQU(13594979923955228484),
+	KQU(11779351762613475968), KQU( 3786101619539298383),
+	KQU( 8021122969180846063), KQU(15745904401162500495),
+	KQU(10762168465993897267), KQU(13552058957896319026),
+	KQU(11200228655252462013), KQU( 5035370357337441226),
+	KQU( 7593918984545500013), KQU( 5418554918361528700),
+	KQU( 4858270799405446371), KQU( 9974659566876282544),
+	KQU(18227595922273957859), KQU( 2772778443635656220),
+	KQU(14285143053182085385), KQU( 9939700992429600469),
+	KQU(12756185904545598068), KQU( 2020783375367345262),
+	KQU(   57026775058331227), KQU(  950827867930065454),
+	KQU( 6602279670145371217), KQU( 2291171535443566929),
+	KQU( 5832380724425010313), KQU( 1220343904715982285),
+	KQU(17045542598598037633), KQU(15460481779702820971),
+	KQU(13948388779949365130), KQU(13975040175430829518),
+	KQU(17477538238425541763), KQU(11104663041851745725),
+	KQU(15860992957141157587), KQU(14529434633012950138),
+	KQU( 2504838019075394203), KQU( 7512113882611121886),
+	KQU( 4859973559980886617), KQU( 1258601555703250219),
+	KQU(15594548157514316394), KQU( 4516730171963773048),
+	KQU(11380103193905031983), KQU( 6809282239982353344),
+	KQU(18045256930420065002), KQU( 2453702683108791859),
+	KQU(  977214582986981460), KQU( 2006410402232713466),
+	KQU( 6192236267216378358), KQU( 3429468402195675253),
+	KQU(18146933153017348921), KQU(17369978576367231139),
+	KQU( 1246940717230386603), KQU(11335758870083327110),
+	KQU(14166488801730353682), KQU( 9008573127269635732),
+	KQU(10776025389820643815), KQU(15087605441903942962),
+	KQU( 1359542462712147922), KQU(13898874411226454206),
+	KQU(17911176066536804411), KQU( 9435590428600085274),
+	KQU(  294488509967864007), KQU( 8890111397567922046),
+	KQU( 7987823476034328778), KQU(13263827582440967651),
+	KQU( 7503774813106751573), KQU(14974747296185646837),
+	KQU( 8504765037032103375), KQU(17340303357444536213),
+	KQU( 7704610912964485743), KQU( 8107533670327205061),
+	KQU( 9062969835083315985), KQU(16968963142126734184),
+	KQU(12958041214190810180), KQU( 2720170147759570200),
+	KQU( 2986358963942189566), KQU(14884226322219356580),
+	KQU(  286224325144368520), KQU(11313800433154279797),
+	KQU(18366849528439673248), KQU(17899725929482368789),
+	KQU( 3730004284609106799), KQU( 1654474302052767205),
+	KQU( 5006698007047077032), KQU( 8196893913601182838),
+	KQU(15214541774425211640), KQU(17391346045606626073),
+	KQU( 8369003584076969089), KQU( 3939046733368550293),
+	KQU(10178639720308707785), KQU( 2180248669304388697),
+	KQU(   62894391300126322), KQU( 9205708961736223191),
+	KQU( 6837431058165360438), KQU( 3150743890848308214),
+	KQU(17849330658111464583), KQU(12214815643135450865),
+	KQU(13410713840519603402), KQU( 3200778126692046802),
+	KQU(13354780043041779313), KQU(  800850022756886036),
+	KQU(15660052933953067433), KQU( 6572823544154375676),
+	KQU(11030281857015819266), KQU(12682241941471433835),
+	KQU(11654136407300274693), KQU( 4517795492388641109),
+	KQU( 9757017371504524244), KQU(17833043400781889277),
+	KQU(12685085201747792227), KQU(10408057728835019573),
+	KQU(   98370418513455221), KQU( 6732663555696848598),
+	KQU(13248530959948529780), KQU( 3530441401230622826),
+	KQU(18188251992895660615), KQU( 1847918354186383756),
+	KQU( 1127392190402660921), KQU(11293734643143819463),
+	KQU( 3015506344578682982), KQU(13852645444071153329),
+	KQU( 2121359659091349142), KQU( 1294604376116677694),
+	KQU( 5616576231286352318), KQU( 7112502442954235625),
+	KQU(11676228199551561689), KQU(12925182803007305359),
+	KQU( 7852375518160493082), KQU( 1136513130539296154),
+	KQU( 5636923900916593195), KQU( 3221077517612607747),
+	KQU(17784790465798152513), KQU( 3554210049056995938),
+	KQU(17476839685878225874), KQU( 3206836372585575732),
+	KQU( 2765333945644823430), KQU(10080070903718799528),
+	KQU( 5412370818878286353), KQU( 9689685887726257728),
+	KQU( 8236117509123533998), KQU( 1951139137165040214),
+	KQU( 4492205209227980349), KQU(16541291230861602967),
+	KQU( 1424371548301437940), KQU( 9117562079669206794),
+	KQU(14374681563251691625), KQU(13873164030199921303),
+	KQU( 6680317946770936731), KQU(15586334026918276214),
+	KQU(10896213950976109802), KQU( 9506261949596413689),
+	KQU( 9903949574308040616), KQU( 6038397344557204470),
+	KQU(  174601465422373648), KQU(15946141191338238030),
+	KQU(17142225620992044937), KQU( 7552030283784477064),
+	KQU( 2947372384532947997), KQU(  510797021688197711),
+	KQU( 4962499439249363461), KQU(   23770320158385357),
+	KQU(  959774499105138124), KQU( 1468396011518788276),
+	KQU( 2015698006852312308), KQU( 4149400718489980136),
+	KQU( 5992916099522371188), KQU(10819182935265531076),
+	KQU(16189787999192351131), KQU(  342833961790261950),
+	KQU(12470830319550495336), KQU(18128495041912812501),
+	KQU( 1193600899723524337), KQU( 9056793666590079770),
+	KQU( 2154021227041669041), KQU( 4963570213951235735),
+	KQU( 4865075960209211409), KQU( 2097724599039942963),
+	KQU( 2024080278583179845), KQU(11527054549196576736),
+	KQU(10650256084182390252), KQU( 4808408648695766755),
+	KQU( 1642839215013788844), KQU(10607187948250398390),
+	KQU( 7076868166085913508), KQU(  730522571106887032),
+	KQU(12500579240208524895), KQU( 4484390097311355324),
+	KQU(15145801330700623870), KQU( 8055827661392944028),
+	KQU( 5865092976832712268), KQU(15159212508053625143),
+	KQU( 3560964582876483341), KQU( 4070052741344438280),
+	KQU( 6032585709886855634), KQU(15643262320904604873),
+	KQU( 2565119772293371111), KQU(  318314293065348260),
+	KQU(15047458749141511872), KQU( 7772788389811528730),
+	KQU( 7081187494343801976), KQU( 6465136009467253947),
+	KQU(10425940692543362069), KQU(  554608190318339115),
+	KQU(14796699860302125214), KQU( 1638153134431111443),
+	KQU(10336967447052276248), KQU( 8412308070396592958),
+	KQU( 4004557277152051226), KQU( 8143598997278774834),
+	KQU(16413323996508783221), KQU(13139418758033994949),
+	KQU( 9772709138335006667), KQU( 2818167159287157659),
+	KQU(17091740573832523669), KQU(14629199013130751608),
+	KQU(18268322711500338185), KQU( 8290963415675493063),
+	KQU( 8830864907452542588), KQU( 1614839084637494849),
+	KQU(14855358500870422231), KQU( 3472996748392519937),
+	KQU(15317151166268877716), KQU( 5825895018698400362),
+	KQU(16730208429367544129), KQU(10481156578141202800),
+	KQU( 4746166512382823750), KQU(12720876014472464998),
+	KQU( 8825177124486735972), KQU(13733447296837467838),
+	KQU( 6412293741681359625), KQU( 8313213138756135033),
+	KQU(11421481194803712517), KQU( 7997007691544174032),
+	KQU( 6812963847917605930), KQU( 9683091901227558641),
+	KQU(14703594165860324713), KQU( 1775476144519618309),
+	KQU( 2724283288516469519), KQU(  717642555185856868),
+	KQU( 8736402192215092346), KQU(11878800336431381021),
+	KQU( 4348816066017061293), KQU( 6115112756583631307),
+	KQU( 9176597239667142976), KQU(12615622714894259204),
+	KQU(10283406711301385987), KQU( 5111762509485379420),
+	KQU( 3118290051198688449), KQU( 7345123071632232145),
+	KQU( 9176423451688682359), KQU( 4843865456157868971),
+	KQU(12008036363752566088), KQU(12058837181919397720),
+	KQU( 2145073958457347366), KQU( 1526504881672818067),
+	KQU( 3488830105567134848), KQU(13208362960674805143),
+	KQU( 4077549672899572192), KQU( 7770995684693818365),
+	KQU( 1398532341546313593), KQU(12711859908703927840),
+	KQU( 1417561172594446813), KQU(17045191024194170604),
+	KQU( 4101933177604931713), KQU(14708428834203480320),
+	KQU(17447509264469407724), KQU(14314821973983434255),
+	KQU(17990472271061617265), KQU( 5087756685841673942),
+	KQU(12797820586893859939), KQU( 1778128952671092879),
+	KQU( 3535918530508665898), KQU( 9035729701042481301),
+	KQU(14808661568277079962), KQU(14587345077537747914),
+	KQU(11920080002323122708), KQU( 6426515805197278753),
+	KQU( 3295612216725984831), KQU(11040722532100876120),
+	KQU(12305952936387598754), KQU(16097391899742004253),
+	KQU( 4908537335606182208), KQU(12446674552196795504),
+	KQU(16010497855816895177), KQU( 9194378874788615551),
+	KQU( 3382957529567613384), KQU( 5154647600754974077),
+	KQU( 9801822865328396141), KQU( 9023662173919288143),
+	KQU(17623115353825147868), KQU( 8238115767443015816),
+	KQU(15811444159859002560), KQU( 9085612528904059661),
+	KQU( 6888601089398614254), KQU(  258252992894160189),
+	KQU( 6704363880792428622), KQU( 6114966032147235763),
+	KQU(11075393882690261875), KQU( 8797664238933620407),
+	KQU( 5901892006476726920), KQU( 5309780159285518958),
+	KQU(14940808387240817367), KQU(14642032021449656698),
+	KQU( 9808256672068504139), KQU( 3670135111380607658),
+	KQU(11211211097845960152), KQU( 1474304506716695808),
+	KQU(15843166204506876239), KQU( 7661051252471780561),
+	KQU(10170905502249418476), KQU( 7801416045582028589),
+	KQU( 2763981484737053050), KQU( 9491377905499253054),
+	KQU(16201395896336915095), KQU( 9256513756442782198),
+	KQU( 5411283157972456034), KQU( 5059433122288321676),
+	KQU( 4327408006721123357), KQU( 9278544078834433377),
+	KQU( 7601527110882281612), KQU(11848295896975505251),
+	KQU(12096998801094735560), KQU(14773480339823506413),
+	KQU(15586227433895802149), KQU(12786541257830242872),
+	KQU( 6904692985140503067), KQU( 5309011515263103959),
+	KQU(12105257191179371066), KQU(14654380212442225037),
+	KQU( 2556774974190695009), KQU( 4461297399927600261),
+	KQU(14888225660915118646), KQU(14915459341148291824),
+	KQU( 2738802166252327631), KQU( 6047155789239131512),
+	KQU(12920545353217010338), KQU(10697617257007840205),
+	KQU( 2751585253158203504), KQU(13252729159780047496),
+	KQU(14700326134672815469), KQU(14082527904374600529),
+	KQU(16852962273496542070), KQU(17446675504235853907),
+	KQU(15019600398527572311), KQU(12312781346344081551),
+	KQU(14524667935039810450), KQU( 5634005663377195738),
+	KQU(11375574739525000569), KQU( 2423665396433260040),
+	KQU( 5222836914796015410), KQU( 4397666386492647387),
+	KQU( 4619294441691707638), KQU(  665088602354770716),
+	KQU(13246495665281593610), KQU( 6564144270549729409),
+	KQU(10223216188145661688), KQU( 3961556907299230585),
+	KQU(11543262515492439914), KQU(16118031437285993790),
+	KQU( 7143417964520166465), KQU(13295053515909486772),
+	KQU(   40434666004899675), KQU(17127804194038347164),
+	KQU( 8599165966560586269), KQU( 8214016749011284903),
+	KQU(13725130352140465239), KQU( 5467254474431726291),
+	KQU( 7748584297438219877), KQU(16933551114829772472),
+	KQU( 2169618439506799400), KQU( 2169787627665113463),
+	KQU(17314493571267943764), KQU(18053575102911354912),
+	KQU(11928303275378476973), KQU(11593850925061715550),
+	KQU(17782269923473589362), KQU( 3280235307704747039),
+	KQU( 6145343578598685149), KQU(17080117031114086090),
+	KQU(18066839902983594755), KQU( 6517508430331020706),
+	KQU( 8092908893950411541), KQU(12558378233386153732),
+	KQU( 4476532167973132976), KQU(16081642430367025016),
+	KQU( 4233154094369139361), KQU( 8693630486693161027),
+	KQU(11244959343027742285), KQU(12273503967768513508),
+	KQU(14108978636385284876), KQU( 7242414665378826984),
+	KQU( 6561316938846562432), KQU( 8601038474994665795),
+	KQU(17532942353612365904), KQU(17940076637020912186),
+	KQU( 7340260368823171304), KQU( 7061807613916067905),
+	KQU(10561734935039519326), KQU(17990796503724650862),
+	KQU( 6208732943911827159), KQU(  359077562804090617),
+	KQU(14177751537784403113), KQU(10659599444915362902),
+	KQU(15081727220615085833), KQU(13417573895659757486),
+	KQU(15513842342017811524), KQU(11814141516204288231),
+	KQU( 1827312513875101814), KQU( 2804611699894603103),
+	KQU(17116500469975602763), KQU(12270191815211952087),
+	KQU(12256358467786024988), KQU(18435021722453971267),
+	KQU(  671330264390865618), KQU(  476504300460286050),
+	KQU(16465470901027093441), KQU( 4047724406247136402),
+	KQU( 1322305451411883346), KQU( 1388308688834322280),
+	KQU( 7303989085269758176), KQU( 9323792664765233642),
+	KQU( 4542762575316368936), KQU(17342696132794337618),
+	KQU( 4588025054768498379), KQU(13415475057390330804),
+	KQU(17880279491733405570), KQU(10610553400618620353),
+	KQU( 3180842072658960139), KQU(13002966655454270120),
+	KQU( 1665301181064982826), KQU( 7083673946791258979),
+	KQU(  190522247122496820), KQU(17388280237250677740),
+	KQU( 8430770379923642945), KQU(12987180971921668584),
+	KQU( 2311086108365390642), KQU( 2870984383579822345),
+	KQU(14014682609164653318), KQU(14467187293062251484),
+	KQU(  192186361147413298), KQU(15171951713531796524),
+	KQU( 9900305495015948728), KQU(17958004775615466344),
+	KQU(14346380954498606514), KQU(18040047357617407096),
+	KQU( 5035237584833424532), KQU(15089555460613972287),
+	KQU( 4131411873749729831), KQU( 1329013581168250330),
+	KQU(10095353333051193949), KQU(10749518561022462716),
+	KQU( 9050611429810755847), KQU(15022028840236655649),
+	KQU( 8775554279239748298), KQU(13105754025489230502),
+	KQU(15471300118574167585), KQU(   89864764002355628),
+	KQU( 8776416323420466637), KQU( 5280258630612040891),
+	KQU( 2719174488591862912), KQU( 7599309137399661994),
+	KQU(15012887256778039979), KQU(14062981725630928925),
+	KQU(12038536286991689603), KQU( 7089756544681775245),
+	KQU(10376661532744718039), KQU( 1265198725901533130),
+	KQU(13807996727081142408), KQU( 2935019626765036403),
+	KQU( 7651672460680700141), KQU( 3644093016200370795),
+	KQU( 2840982578090080674), KQU(17956262740157449201),
+	KQU(18267979450492880548), KQU(11799503659796848070),
+	KQU( 9942537025669672388), KQU(11886606816406990297),
+	KQU( 5488594946437447576), KQU( 7226714353282744302),
+	KQU( 3784851653123877043), KQU(  878018453244803041),
+	KQU(12110022586268616085), KQU(  734072179404675123),
+	KQU(11869573627998248542), KQU(  469150421297783998),
+	KQU(  260151124912803804), KQU(11639179410120968649),
+	KQU( 9318165193840846253), KQU(12795671722734758075),
+	KQU(15318410297267253933), KQU(  691524703570062620),
+	KQU( 5837129010576994601), KQU(15045963859726941052),
+	KQU( 5850056944932238169), KQU(12017434144750943807),
+	KQU( 7447139064928956574), KQU( 3101711812658245019),
+	KQU(16052940704474982954), KQU(18195745945986994042),
+	KQU( 8932252132785575659), KQU(13390817488106794834),
+	KQU(11582771836502517453), KQU( 4964411326683611686),
+	KQU( 2195093981702694011), KQU(14145229538389675669),
+	KQU(16459605532062271798), KQU(  866316924816482864),
+	KQU( 4593041209937286377), KQU( 8415491391910972138),
+	KQU( 4171236715600528969), KQU(16637569303336782889),
+	KQU( 2002011073439212680), KQU(17695124661097601411),
+	KQU( 4627687053598611702), KQU( 7895831936020190403),
+	KQU( 8455951300917267802), KQU( 2923861649108534854),
+	KQU( 8344557563927786255), KQU( 6408671940373352556),
+	KQU(12210227354536675772), KQU(14294804157294222295),
+	KQU(10103022425071085127), KQU(10092959489504123771),
+	KQU( 6554774405376736268), KQU(12629917718410641774),
+	KQU( 6260933257596067126), KQU( 2460827021439369673),
+	KQU( 2541962996717103668), KQU(  597377203127351475),
+	KQU( 5316984203117315309), KQU( 4811211393563241961),
+	KQU(13119698597255811641), KQU( 8048691512862388981),
+	KQU(10216818971194073842), KQU( 4612229970165291764),
+	KQU(10000980798419974770), KQU( 6877640812402540687),
+	KQU( 1488727563290436992), KQU( 2227774069895697318),
+	KQU(11237754507523316593), KQU(13478948605382290972),
+	KQU( 1963583846976858124), KQU( 5512309205269276457),
+	KQU( 3972770164717652347), KQU( 3841751276198975037),
+	KQU(10283343042181903117), KQU( 8564001259792872199),
+	KQU(16472187244722489221), KQU( 8953493499268945921),
+	KQU( 3518747340357279580), KQU( 4003157546223963073),
+	KQU( 3270305958289814590), KQU( 3966704458129482496),
+	KQU( 8122141865926661939), KQU(14627734748099506653),
+	KQU(13064426990862560568), KQU( 2414079187889870829),
+	KQU( 5378461209354225306), KQU(10841985740128255566),
+	KQU(  538582442885401738), KQU( 7535089183482905946),
+	KQU(16117559957598879095), KQU( 8477890721414539741),
+	KQU( 1459127491209533386), KQU(17035126360733620462),
+	KQU( 8517668552872379126), KQU(10292151468337355014),
+	KQU(17081267732745344157), KQU(13751455337946087178),
+	KQU(14026945459523832966), KQU( 6653278775061723516),
+	KQU(10619085543856390441), KQU( 2196343631481122885),
+	KQU(10045966074702826136), KQU(10082317330452718282),
+	KQU( 5920859259504831242), KQU( 9951879073426540617),
+	KQU( 7074696649151414158), KQU(15808193543879464318),
+	KQU( 7385247772746953374), KQU( 3192003544283864292),
+	KQU(18153684490917593847), KQU(12423498260668568905),
+	KQU(10957758099756378169), KQU(11488762179911016040),
+	KQU( 2099931186465333782), KQU(11180979581250294432),
+	KQU( 8098916250668367933), KQU( 3529200436790763465),
+	KQU(12988418908674681745), KQU( 6147567275954808580),
+	KQU( 3207503344604030989), KQU(10761592604898615360),
+	KQU(  229854861031893504), KQU( 8809853962667144291),
+	KQU(13957364469005693860), KQU( 7634287665224495886),
+	KQU(12353487366976556874), KQU( 1134423796317152034),
+	KQU( 2088992471334107068), KQU( 7393372127190799698),
+	KQU( 1845367839871058391), KQU(  207922563987322884),
+	KQU(11960870813159944976), KQU(12182120053317317363),
+	KQU(17307358132571709283), KQU(13871081155552824936),
+	KQU(18304446751741566262), KQU( 7178705220184302849),
+	KQU(10929605677758824425), KQU(16446976977835806844),
+	KQU(13723874412159769044), KQU( 6942854352100915216),
+	KQU( 1726308474365729390), KQU( 2150078766445323155),
+	KQU(15345558947919656626), KQU(12145453828874527201),
+	KQU( 2054448620739726849), KQU( 2740102003352628137),
+	KQU(11294462163577610655), KQU(  756164283387413743),
+	KQU(17841144758438810880), KQU(10802406021185415861),
+	KQU( 8716455530476737846), KQU( 6321788834517649606),
+	KQU(14681322910577468426), KQU(17330043563884336387),
+	KQU(12701802180050071614), KQU(14695105111079727151),
+	KQU( 5112098511654172830), KQU( 4957505496794139973),
+	KQU( 8270979451952045982), KQU(12307685939199120969),
+	KQU(12425799408953443032), KQU( 8376410143634796588),
+	KQU(16621778679680060464), KQU( 3580497854566660073),
+	KQU( 1122515747803382416), KQU(  857664980960597599),
+	KQU( 6343640119895925918), KQU(12878473260854462891),
+	KQU(10036813920765722626), KQU(14451335468363173812),
+	KQU( 5476809692401102807), KQU(16442255173514366342),
+	KQU(13060203194757167104), KQU(14354124071243177715),
+	KQU(15961249405696125227), KQU(13703893649690872584),
+	KQU(  363907326340340064), KQU( 6247455540491754842),
+	KQU(12242249332757832361), KQU(  156065475679796717),
+	KQU( 9351116235749732355), KQU( 4590350628677701405),
+	KQU( 1671195940982350389), KQU(13501398458898451905),
+	KQU( 6526341991225002255), KQU( 1689782913778157592),
+	KQU( 7439222350869010334), KQU(13975150263226478308),
+	KQU(11411961169932682710), KQU(17204271834833847277),
+	KQU(  541534742544435367), KQU( 6591191931218949684),
+	KQU( 2645454775478232486), KQU( 4322857481256485321),
+	KQU( 8477416487553065110), KQU(12902505428548435048),
+	KQU(  971445777981341415), KQU(14995104682744976712),
+	KQU( 4243341648807158063), KQU( 8695061252721927661),
+	KQU( 5028202003270177222), KQU( 2289257340915567840),
+	KQU(13870416345121866007), KQU(13994481698072092233),
+	KQU( 6912785400753196481), KQU( 2278309315841980139),
+	KQU( 4329765449648304839), KQU( 5963108095785485298),
+	KQU( 4880024847478722478), KQU(16015608779890240947),
+	KQU( 1866679034261393544), KQU(  914821179919731519),
+	KQU( 9643404035648760131), KQU( 2418114953615593915),
+	KQU(  944756836073702374), KQU(15186388048737296834),
+	KQU( 7723355336128442206), KQU( 7500747479679599691),
+	KQU(18013961306453293634), KQU( 2315274808095756456),
+	KQU(13655308255424029566), KQU(17203800273561677098),
+	KQU( 1382158694422087756), KQU( 5090390250309588976),
+	KQU(  517170818384213989), KQU( 1612709252627729621),
+	KQU( 1330118955572449606), KQU(  300922478056709885),
+	KQU(18115693291289091987), KQU(13491407109725238321),
+	KQU(15293714633593827320), KQU( 5151539373053314504),
+	KQU( 5951523243743139207), KQU(14459112015249527975),
+	KQU( 5456113959000700739), KQU( 3877918438464873016),
+	KQU(12534071654260163555), KQU(15871678376893555041),
+	KQU(11005484805712025549), KQU(16353066973143374252),
+	KQU( 4358331472063256685), KQU( 8268349332210859288),
+	KQU(12485161590939658075), KQU(13955993592854471343),
+	KQU( 5911446886848367039), KQU(14925834086813706974),
+	KQU( 6590362597857994805), KQU( 1280544923533661875),
+	KQU( 1637756018947988164), KQU( 4734090064512686329),
+	KQU(16693705263131485912), KQU( 6834882340494360958),
+	KQU( 8120732176159658505), KQU( 2244371958905329346),
+	KQU(10447499707729734021), KQU( 7318742361446942194),
+	KQU( 8032857516355555296), KQU(14023605983059313116),
+	KQU( 1032336061815461376), KQU( 9840995337876562612),
+	KQU( 9869256223029203587), KQU(12227975697177267636),
+	KQU(12728115115844186033), KQU( 7752058479783205470),
+	KQU(  729733219713393087), KQU(12954017801239007622)
+};
+static const uint64_t init_by_array_64_expected[] = {
+	KQU( 2100341266307895239), KQU( 8344256300489757943),
+	KQU(15687933285484243894), KQU( 8268620370277076319),
+	KQU(12371852309826545459), KQU( 8800491541730110238),
+	KQU(18113268950100835773), KQU( 2886823658884438119),
+	KQU( 3293667307248180724), KQU( 9307928143300172731),
+	KQU( 7688082017574293629), KQU(  900986224735166665),
+	KQU( 9977972710722265039), KQU( 6008205004994830552),
+	KQU(  546909104521689292), KQU( 7428471521869107594),
+	KQU(14777563419314721179), KQU(16116143076567350053),
+	KQU( 5322685342003142329), KQU( 4200427048445863473),
+	KQU( 4693092150132559146), KQU(13671425863759338582),
+	KQU( 6747117460737639916), KQU( 4732666080236551150),
+	KQU( 5912839950611941263), KQU( 3903717554504704909),
+	KQU( 2615667650256786818), KQU(10844129913887006352),
+	KQU(13786467861810997820), KQU(14267853002994021570),
+	KQU(13767807302847237439), KQU(16407963253707224617),
+	KQU( 4802498363698583497), KQU( 2523802839317209764),
+	KQU( 3822579397797475589), KQU( 8950320572212130610),
+	KQU( 3745623504978342534), KQU(16092609066068482806),
+	KQU( 9817016950274642398), KQU(10591660660323829098),
+	KQU(11751606650792815920), KQU( 5122873818577122211),
+	KQU(17209553764913936624), KQU( 6249057709284380343),
+	KQU(15088791264695071830), KQU(15344673071709851930),
+	KQU( 4345751415293646084), KQU( 2542865750703067928),
+	KQU(13520525127852368784), KQU(18294188662880997241),
+	KQU( 3871781938044881523), KQU( 2873487268122812184),
+	KQU(15099676759482679005), KQU(15442599127239350490),
+	KQU( 6311893274367710888), KQU( 3286118760484672933),
+	KQU( 4146067961333542189), KQU(13303942567897208770),
+	KQU( 8196013722255630418), KQU( 4437815439340979989),
+	KQU(15433791533450605135), KQU( 4254828956815687049),
+	KQU( 1310903207708286015), KQU(10529182764462398549),
+	KQU(14900231311660638810), KQU( 9727017277104609793),
+	KQU( 1821308310948199033), KQU(11628861435066772084),
+	KQU( 9469019138491546924), KQU( 3145812670532604988),
+	KQU( 9938468915045491919), KQU( 1562447430672662142),
+	KQU(13963995266697989134), KQU( 3356884357625028695),
+	KQU( 4499850304584309747), KQU( 8456825817023658122),
+	KQU(10859039922814285279), KQU( 8099512337972526555),
+	KQU(  348006375109672149), KQU(11919893998241688603),
+	KQU( 1104199577402948826), KQU(16689191854356060289),
+	KQU(10992552041730168078), KQU( 7243733172705465836),
+	KQU( 5668075606180319560), KQU(18182847037333286970),
+	KQU( 4290215357664631322), KQU( 4061414220791828613),
+	KQU(13006291061652989604), KQU( 7140491178917128798),
+	KQU(12703446217663283481), KQU( 5500220597564558267),
+	KQU(10330551509971296358), KQU(15958554768648714492),
+	KQU( 5174555954515360045), KQU( 1731318837687577735),
+	KQU( 3557700801048354857), KQU(13764012341928616198),
+	KQU(13115166194379119043), KQU( 7989321021560255519),
+	KQU( 2103584280905877040), KQU( 9230788662155228488),
+	KQU(16396629323325547654), KQU(  657926409811318051),
+	KQU(15046700264391400727), KQU( 5120132858771880830),
+	KQU( 7934160097989028561), KQU( 6963121488531976245),
+	KQU(17412329602621742089), KQU(15144843053931774092),
+	KQU(17204176651763054532), KQU(13166595387554065870),
+	KQU( 8590377810513960213), KQU( 5834365135373991938),
+	KQU( 7640913007182226243), KQU( 3479394703859418425),
+	KQU(16402784452644521040), KQU( 4993979809687083980),
+	KQU(13254522168097688865), KQU(15643659095244365219),
+	KQU( 5881437660538424982), KQU(11174892200618987379),
+	KQU(  254409966159711077), KQU(17158413043140549909),
+	KQU( 3638048789290376272), KQU( 1376816930299489190),
+	KQU( 4622462095217761923), KQU(15086407973010263515),
+	KQU(13253971772784692238), KQU( 5270549043541649236),
+	KQU(11182714186805411604), KQU(12283846437495577140),
+	KQU( 5297647149908953219), KQU(10047451738316836654),
+	KQU( 4938228100367874746), KQU(12328523025304077923),
+	KQU( 3601049438595312361), KQU( 9313624118352733770),
+	KQU(13322966086117661798), KQU(16660005705644029394),
+	KQU(11337677526988872373), KQU(13869299102574417795),
+	KQU(15642043183045645437), KQU( 3021755569085880019),
+	KQU( 4979741767761188161), KQU(13679979092079279587),
+	KQU( 3344685842861071743), KQU(13947960059899588104),
+	KQU(  305806934293368007), KQU( 5749173929201650029),
+	KQU(11123724852118844098), KQU(15128987688788879802),
+	KQU(15251651211024665009), KQU( 7689925933816577776),
+	KQU(16732804392695859449), KQU(17087345401014078468),
+	KQU(14315108589159048871), KQU( 4820700266619778917),
+	KQU(16709637539357958441), KQU( 4936227875177351374),
+	KQU( 2137907697912987247), KQU(11628565601408395420),
+	KQU( 2333250549241556786), KQU( 5711200379577778637),
+	KQU( 5170680131529031729), KQU(12620392043061335164),
+	KQU(   95363390101096078), KQU( 5487981914081709462),
+	KQU( 1763109823981838620), KQU( 3395861271473224396),
+	KQU( 1300496844282213595), KQU( 6894316212820232902),
+	KQU(10673859651135576674), KQU( 5911839658857903252),
+	KQU(17407110743387299102), KQU( 8257427154623140385),
+	KQU(11389003026741800267), KQU( 4070043211095013717),
+	KQU(11663806997145259025), KQU(15265598950648798210),
+	KQU(  630585789434030934), KQU( 3524446529213587334),
+	KQU( 7186424168495184211), KQU(10806585451386379021),
+	KQU(11120017753500499273), KQU( 1586837651387701301),
+	KQU(17530454400954415544), KQU( 9991670045077880430),
+	KQU( 7550997268990730180), KQU( 8640249196597379304),
+	KQU( 3522203892786893823), KQU(10401116549878854788),
+	KQU(13690285544733124852), KQU( 8295785675455774586),
+	KQU(15535716172155117603), KQU( 3112108583723722511),
+	KQU(17633179955339271113), KQU(18154208056063759375),
+	KQU( 1866409236285815666), KQU(13326075895396412882),
+	KQU( 8756261842948020025), KQU( 6281852999868439131),
+	KQU(15087653361275292858), KQU(10333923911152949397),
+	KQU( 5265567645757408500), KQU(12728041843210352184),
+	KQU( 6347959327507828759), KQU(  154112802625564758),
+	KQU(18235228308679780218), KQU( 3253805274673352418),
+	KQU( 4849171610689031197), KQU(17948529398340432518),
+	KQU(13803510475637409167), KQU(13506570190409883095),
+	KQU(15870801273282960805), KQU( 8451286481299170773),
+	KQU( 9562190620034457541), KQU( 8518905387449138364),
+	KQU(12681306401363385655), KQU( 3788073690559762558),
+	KQU( 5256820289573487769), KQU( 2752021372314875467),
+	KQU( 6354035166862520716), KQU( 4328956378309739069),
+	KQU(  449087441228269600), KQU( 5533508742653090868),
+	KQU( 1260389420404746988), KQU(18175394473289055097),
+	KQU( 1535467109660399420), KQU( 8818894282874061442),
+	KQU(12140873243824811213), KQU(15031386653823014946),
+	KQU( 1286028221456149232), KQU( 6329608889367858784),
+	KQU( 9419654354945132725), KQU( 6094576547061672379),
+	KQU(17706217251847450255), KQU( 1733495073065878126),
+	KQU(16918923754607552663), KQU( 8881949849954945044),
+	KQU(12938977706896313891), KQU(14043628638299793407),
+	KQU(18393874581723718233), KQU( 6886318534846892044),
+	KQU(14577870878038334081), KQU(13541558383439414119),
+	KQU(13570472158807588273), KQU(18300760537910283361),
+	KQU(  818368572800609205), KQU( 1417000585112573219),
+	KQU(12337533143867683655), KQU(12433180994702314480),
+	KQU(  778190005829189083), KQU(13667356216206524711),
+	KQU( 9866149895295225230), KQU(11043240490417111999),
+	KQU( 1123933826541378598), KQU( 6469631933605123610),
+	KQU(14508554074431980040), KQU(13918931242962026714),
+	KQU( 2870785929342348285), KQU(14786362626740736974),
+	KQU(13176680060902695786), KQU( 9591778613541679456),
+	KQU( 9097662885117436706), KQU(  749262234240924947),
+	KQU( 1944844067793307093), KQU( 4339214904577487742),
+	KQU( 8009584152961946551), KQU(16073159501225501777),
+	KQU( 3335870590499306217), KQU(17088312653151202847),
+	KQU( 3108893142681931848), KQU(16636841767202792021),
+	KQU(10423316431118400637), KQU( 8008357368674443506),
+	KQU(11340015231914677875), KQU(17687896501594936090),
+	KQU(15173627921763199958), KQU(  542569482243721959),
+	KQU(15071714982769812975), KQU( 4466624872151386956),
+	KQU( 1901780715602332461), KQU( 9822227742154351098),
+	KQU( 1479332892928648780), KQU( 6981611948382474400),
+	KQU( 7620824924456077376), KQU(14095973329429406782),
+	KQU( 7902744005696185404), KQU(15830577219375036920),
+	KQU(10287076667317764416), KQU(12334872764071724025),
+	KQU( 4419302088133544331), KQU(14455842851266090520),
+	KQU(12488077416504654222), KQU( 7953892017701886766),
+	KQU( 6331484925529519007), KQU( 4902145853785030022),
+	KQU(17010159216096443073), KQU(11945354668653886087),
+	KQU(15112022728645230829), KQU(17363484484522986742),
+	KQU( 4423497825896692887), KQU( 8155489510809067471),
+	KQU(  258966605622576285), KQU( 5462958075742020534),
+	KQU( 6763710214913276228), KQU( 2368935183451109054),
+	KQU(14209506165246453811), KQU( 2646257040978514881),
+	KQU( 3776001911922207672), KQU( 1419304601390147631),
+	KQU(14987366598022458284), KQU( 3977770701065815721),
+	KQU(  730820417451838898), KQU( 3982991703612885327),
+	KQU( 2803544519671388477), KQU(17067667221114424649),
+	KQU( 2922555119737867166), KQU( 1989477584121460932),
+	KQU(15020387605892337354), KQU( 9293277796427533547),
+	KQU(10722181424063557247), KQU(16704542332047511651),
+	KQU( 5008286236142089514), KQU(16174732308747382540),
+	KQU(17597019485798338402), KQU(13081745199110622093),
+	KQU( 8850305883842258115), KQU(12723629125624589005),
+	KQU( 8140566453402805978), KQU(15356684607680935061),
+	KQU(14222190387342648650), KQU(11134610460665975178),
+	KQU( 1259799058620984266), KQU(13281656268025610041),
+	KQU(  298262561068153992), KQU(12277871700239212922),
+	KQU(13911297774719779438), KQU(16556727962761474934),
+	KQU(17903010316654728010), KQU( 9682617699648434744),
+	KQU(14757681836838592850), KQU( 1327242446558524473),
+	KQU(11126645098780572792), KQU( 1883602329313221774),
+	KQU( 2543897783922776873), KQU(15029168513767772842),
+	KQU(12710270651039129878), KQU(16118202956069604504),
+	KQU(15010759372168680524), KQU( 2296827082251923948),
+	KQU(10793729742623518101), KQU(13829764151845413046),
+	KQU(17769301223184451213), KQU( 3118268169210783372),
+	KQU(17626204544105123127), KQU( 7416718488974352644),
+	KQU(10450751996212925994), KQU( 9352529519128770586),
+	KQU(  259347569641110140), KQU( 8048588892269692697),
+	KQU( 1774414152306494058), KQU(10669548347214355622),
+	KQU(13061992253816795081), KQU(18432677803063861659),
+	KQU( 8879191055593984333), KQU(12433753195199268041),
+	KQU(14919392415439730602), KQU( 6612848378595332963),
+	KQU( 6320986812036143628), KQU(10465592420226092859),
+	KQU( 4196009278962570808), KQU( 3747816564473572224),
+	KQU(17941203486133732898), KQU( 2350310037040505198),
+	KQU( 5811779859134370113), KQU(10492109599506195126),
+	KQU( 7699650690179541274), KQU( 1954338494306022961),
+	KQU(14095816969027231152), KQU( 5841346919964852061),
+	KQU(14945969510148214735), KQU( 3680200305887550992),
+	KQU( 6218047466131695792), KQU( 8242165745175775096),
+	KQU(11021371934053307357), KQU( 1265099502753169797),
+	KQU( 4644347436111321718), KQU( 3609296916782832859),
+	KQU( 8109807992218521571), KQU(18387884215648662020),
+	KQU(14656324896296392902), KQU(17386819091238216751),
+	KQU(17788300878582317152), KQU( 7919446259742399591),
+	KQU( 4466613134576358004), KQU(12928181023667938509),
+	KQU(13147446154454932030), KQU(16552129038252734620),
+	KQU( 8395299403738822450), KQU(11313817655275361164),
+	KQU(  434258809499511718), KQU( 2074882104954788676),
+	KQU( 7929892178759395518), KQU( 9006461629105745388),
+	KQU( 5176475650000323086), KQU(11128357033468341069),
+	KQU(12026158851559118955), KQU(14699716249471156500),
+	KQU(  448982497120206757), KQU( 4156475356685519900),
+	KQU( 6063816103417215727), KQU(10073289387954971479),
+	KQU( 8174466846138590962), KQU( 2675777452363449006),
+	KQU( 9090685420572474281), KQU( 6659652652765562060),
+	KQU(12923120304018106621), KQU(11117480560334526775),
+	KQU(  937910473424587511), KQU( 1838692113502346645),
+	KQU(11133914074648726180), KQU( 7922600945143884053),
+	KQU(13435287702700959550), KQU( 5287964921251123332),
+	KQU(11354875374575318947), KQU(17955724760748238133),
+	KQU(13728617396297106512), KQU( 4107449660118101255),
+	KQU( 1210269794886589623), KQU(11408687205733456282),
+	KQU( 4538354710392677887), KQU(13566803319341319267),
+	KQU(17870798107734050771), KQU( 3354318982568089135),
+	KQU( 9034450839405133651), KQU(13087431795753424314),
+	KQU(  950333102820688239), KQU( 1968360654535604116),
+	KQU(16840551645563314995), KQU( 8867501803892924995),
+	KQU(11395388644490626845), KQU( 1529815836300732204),
+	KQU(13330848522996608842), KQU( 1813432878817504265),
+	KQU( 2336867432693429560), KQU(15192805445973385902),
+	KQU( 2528593071076407877), KQU(  128459777936689248),
+	KQU( 9976345382867214866), KQU( 6208885766767996043),
+	KQU(14982349522273141706), KQU( 3099654362410737822),
+	KQU(13776700761947297661), KQU( 8806185470684925550),
+	KQU( 8151717890410585321), KQU(  640860591588072925),
+	KQU(14592096303937307465), KQU( 9056472419613564846),
+	KQU(14861544647742266352), KQU(12703771500398470216),
+	KQU( 3142372800384138465), KQU( 6201105606917248196),
+	KQU(18337516409359270184), KQU(15042268695665115339),
+	KQU(15188246541383283846), KQU(12800028693090114519),
+	KQU( 5992859621101493472), KQU(18278043971816803521),
+	KQU( 9002773075219424560), KQU( 7325707116943598353),
+	KQU( 7930571931248040822), KQU( 5645275869617023448),
+	KQU( 7266107455295958487), KQU( 4363664528273524411),
+	KQU(14313875763787479809), KQU(17059695613553486802),
+	KQU( 9247761425889940932), KQU(13704726459237593128),
+	KQU( 2701312427328909832), KQU(17235532008287243115),
+	KQU(14093147761491729538), KQU( 6247352273768386516),
+	KQU( 8268710048153268415), KQU( 7985295214477182083),
+	KQU(15624495190888896807), KQU( 3772753430045262788),
+	KQU( 9133991620474991698), KQU( 5665791943316256028),
+	KQU( 7551996832462193473), KQU(13163729206798953877),
+	KQU( 9263532074153846374), KQU( 1015460703698618353),
+	KQU(17929874696989519390), KQU(18257884721466153847),
+	KQU(16271867543011222991), KQU( 3905971519021791941),
+	KQU(16814488397137052085), KQU( 1321197685504621613),
+	KQU( 2870359191894002181), KQU(14317282970323395450),
+	KQU(13663920845511074366), KQU( 2052463995796539594),
+	KQU(14126345686431444337), KQU( 1727572121947022534),
+	KQU(17793552254485594241), KQU( 6738857418849205750),
+	KQU( 1282987123157442952), KQU(16655480021581159251),
+	KQU( 6784587032080183866), KQU(14726758805359965162),
+	KQU( 7577995933961987349), KQU(12539609320311114036),
+	KQU(10789773033385439494), KQU( 8517001497411158227),
+	KQU(10075543932136339710), KQU(14838152340938811081),
+	KQU( 9560840631794044194), KQU(17445736541454117475),
+	KQU(10633026464336393186), KQU(15705729708242246293),
+	KQU( 1117517596891411098), KQU( 4305657943415886942),
+	KQU( 4948856840533979263), KQU(16071681989041789593),
+	KQU(13723031429272486527), KQU( 7639567622306509462),
+	KQU(12670424537483090390), KQU( 9715223453097197134),
+	KQU( 5457173389992686394), KQU(  289857129276135145),
+	KQU(17048610270521972512), KQU(  692768013309835485),
+	KQU(14823232360546632057), KQU(18218002361317895936),
+	KQU( 3281724260212650204), KQU(16453957266549513795),
+	KQU( 8592711109774511881), KQU(  929825123473369579),
+	KQU(15966784769764367791), KQU( 9627344291450607588),
+	KQU(10849555504977813287), KQU( 9234566913936339275),
+	KQU( 6413807690366911210), KQU(10862389016184219267),
+	KQU(13842504799335374048), KQU( 1531994113376881174),
+	KQU( 2081314867544364459), KQU(16430628791616959932),
+	KQU( 8314714038654394368), KQU( 9155473892098431813),
+	KQU(12577843786670475704), KQU( 4399161106452401017),
+	KQU( 1668083091682623186), KQU( 1741383777203714216),
+	KQU( 2162597285417794374), KQU(15841980159165218736),
+	KQU( 1971354603551467079), KQU( 1206714764913205968),
+	KQU( 4790860439591272330), KQU(14699375615594055799),
+	KQU( 8374423871657449988), KQU(10950685736472937738),
+	KQU(  697344331343267176), KQU(10084998763118059810),
+	KQU(12897369539795983124), KQU(12351260292144383605),
+	KQU( 1268810970176811234), KQU( 7406287800414582768),
+	KQU(  516169557043807831), KQU( 5077568278710520380),
+	KQU( 3828791738309039304), KQU( 7721974069946943610),
+	KQU( 3534670260981096460), KQU( 4865792189600584891),
+	KQU(16892578493734337298), KQU( 9161499464278042590),
+	KQU(11976149624067055931), KQU(13219479887277343990),
+	KQU(14161556738111500680), KQU(14670715255011223056),
+	KQU( 4671205678403576558), KQU(12633022931454259781),
+	KQU(14821376219869187646), KQU(  751181776484317028),
+	KQU( 2192211308839047070), KQU(11787306362361245189),
+	KQU(10672375120744095707), KQU( 4601972328345244467),
+	KQU(15457217788831125879), KQU( 8464345256775460809),
+	KQU(10191938789487159478), KQU( 6184348739615197613),
+	KQU(11425436778806882100), KQU( 2739227089124319793),
+	KQU(  461464518456000551), KQU( 4689850170029177442),
+	KQU( 6120307814374078625), KQU(11153579230681708671),
+	KQU( 7891721473905347926), KQU(10281646937824872400),
+	KQU( 3026099648191332248), KQU( 8666750296953273818),
+	KQU(14978499698844363232), KQU(13303395102890132065),
+	KQU( 8182358205292864080), KQU(10560547713972971291),
+	KQU(11981635489418959093), KQU( 3134621354935288409),
+	KQU(11580681977404383968), KQU(14205530317404088650),
+	KQU( 5997789011854923157), KQU(13659151593432238041),
+	KQU(11664332114338865086), KQU( 7490351383220929386),
+	KQU( 7189290499881530378), KQU(15039262734271020220),
+	KQU( 2057217285976980055), KQU(  555570804905355739),
+	KQU(11235311968348555110), KQU(13824557146269603217),
+	KQU(16906788840653099693), KQU( 7222878245455661677),
+	KQU( 5245139444332423756), KQU( 4723748462805674292),
+	KQU(12216509815698568612), KQU(17402362976648951187),
+	KQU(17389614836810366768), KQU( 4880936484146667711),
+	KQU( 9085007839292639880), KQU(13837353458498535449),
+	KQU(11914419854360366677), KQU(16595890135313864103),
+	KQU( 6313969847197627222), KQU(18296909792163910431),
+	KQU(10041780113382084042), KQU( 2499478551172884794),
+	KQU(11057894246241189489), KQU( 9742243032389068555),
+	KQU(12838934582673196228), KQU(13437023235248490367),
+	KQU(13372420669446163240), KQU( 6752564244716909224),
+	KQU( 7157333073400313737), KQU(12230281516370654308),
+	KQU( 1182884552219419117), KQU( 2955125381312499218),
+	KQU(10308827097079443249), KQU( 1337648572986534958),
+	KQU(16378788590020343939), KQU(  108619126514420935),
+	KQU( 3990981009621629188), KQU( 5460953070230946410),
+	KQU( 9703328329366531883), KQU(13166631489188077236),
+	KQU( 1104768831213675170), KQU( 3447930458553877908),
+	KQU( 8067172487769945676), KQU( 5445802098190775347),
+	KQU( 3244840981648973873), KQU(17314668322981950060),
+	KQU( 5006812527827763807), KQU(18158695070225526260),
+	KQU( 2824536478852417853), KQU(13974775809127519886),
+	KQU( 9814362769074067392), KQU(17276205156374862128),
+	KQU(11361680725379306967), KQU( 3422581970382012542),
+	KQU(11003189603753241266), KQU(11194292945277862261),
+	KQU( 6839623313908521348), KQU(11935326462707324634),
+	KQU( 1611456788685878444), KQU(13112620989475558907),
+	KQU(  517659108904450427), KQU(13558114318574407624),
+	KQU(15699089742731633077), KQU( 4988979278862685458),
+	KQU( 8111373583056521297), KQU( 3891258746615399627),
+	KQU( 8137298251469718086), KQU(12748663295624701649),
+	KQU( 4389835683495292062), KQU( 5775217872128831729),
+	KQU( 9462091896405534927), KQU( 8498124108820263989),
+	KQU( 8059131278842839525), KQU(10503167994254090892),
+	KQU(11613153541070396656), KQU(18069248738504647790),
+	KQU(  570657419109768508), KQU( 3950574167771159665),
+	KQU( 5514655599604313077), KQU( 2908460854428484165),
+	KQU(10777722615935663114), KQU(12007363304839279486),
+	KQU( 9800646187569484767), KQU( 8795423564889864287),
+	KQU(14257396680131028419), KQU( 6405465117315096498),
+	KQU( 7939411072208774878), KQU(17577572378528990006),
+	KQU(14785873806715994850), KQU(16770572680854747390),
+	KQU(18127549474419396481), KQU(11637013449455757750),
+	KQU(14371851933996761086), KQU( 3601181063650110280),
+	KQU( 4126442845019316144), KQU(10198287239244320669),
+	KQU(18000169628555379659), KQU(18392482400739978269),
+	KQU( 6219919037686919957), KQU( 3610085377719446052),
+	KQU( 2513925039981776336), KQU(16679413537926716955),
+	KQU(12903302131714909434), KQU( 5581145789762985009),
+	KQU(12325955044293303233), KQU(17216111180742141204),
+	KQU( 6321919595276545740), KQU( 3507521147216174501),
+	KQU( 9659194593319481840), KQU(11473976005975358326),
+	KQU(14742730101435987026), KQU(  492845897709954780),
+	KQU(16976371186162599676), KQU(17712703422837648655),
+	KQU( 9881254778587061697), KQU( 8413223156302299551),
+	KQU( 1563841828254089168), KQU( 9996032758786671975),
+	KQU(  138877700583772667), KQU(13003043368574995989),
+	KQU( 4390573668650456587), KQU( 8610287390568126755),
+	KQU(15126904974266642199), KQU( 6703637238986057662),
+	KQU( 2873075592956810157), KQU( 6035080933946049418),
+	KQU(13382846581202353014), KQU( 7303971031814642463),
+	KQU(18418024405307444267), KQU( 5847096731675404647),
+	KQU( 4035880699639842500), KQU(11525348625112218478),
+	KQU( 3041162365459574102), KQU( 2604734487727986558),
+	KQU(15526341771636983145), KQU(14556052310697370254),
+	KQU(12997787077930808155), KQU( 9601806501755554499),
+	KQU(11349677952521423389), KQU(14956777807644899350),
+	KQU(16559736957742852721), KQU(12360828274778140726),
+	KQU( 6685373272009662513), KQU(16932258748055324130),
+	KQU(15918051131954158508), KQU( 1692312913140790144),
+	KQU(  546653826801637367), KQU( 5341587076045986652),
+	KQU(14975057236342585662), KQU(12374976357340622412),
+	KQU(10328833995181940552), KQU(12831807101710443149),
+	KQU(10548514914382545716), KQU( 2217806727199715993),
+	KQU(12627067369242845138), KQU( 4598965364035438158),
+	KQU(  150923352751318171), KQU(14274109544442257283),
+	KQU( 4696661475093863031), KQU( 1505764114384654516),
+	KQU(10699185831891495147), KQU( 2392353847713620519),
+	KQU( 3652870166711788383), KQU( 8640653276221911108),
+	KQU( 3894077592275889704), KQU( 4918592872135964845),
+	KQU(16379121273281400789), KQU(12058465483591683656),
+	KQU(11250106829302924945), KQU( 1147537556296983005),
+	KQU( 6376342756004613268), KQU(14967128191709280506),
+	KQU(18007449949790627628), KQU( 9497178279316537841),
+	KQU( 7920174844809394893), KQU(10037752595255719907),
+	KQU(15875342784985217697), KQU(15311615921712850696),
+	KQU( 9552902652110992950), KQU(14054979450099721140),
+	KQU( 5998709773566417349), KQU(18027910339276320187),
+	KQU( 8223099053868585554), KQU( 7842270354824999767),
+	KQU( 4896315688770080292), KQU(12969320296569787895),
+	KQU( 2674321489185759961), KQU( 4053615936864718439),
+	KQU(11349775270588617578), KQU( 4743019256284553975),
+	KQU( 5602100217469723769), KQU(14398995691411527813),
+	KQU( 7412170493796825470), KQU(  836262406131744846),
+	KQU( 8231086633845153022), KQU( 5161377920438552287),
+	KQU( 8828731196169924949), KQU(16211142246465502680),
+	KQU( 3307990879253687818), KQU( 5193405406899782022),
+	KQU( 8510842117467566693), KQU( 6070955181022405365),
+	KQU(14482950231361409799), KQU(12585159371331138077),
+	KQU( 3511537678933588148), KQU( 2041849474531116417),
+	KQU(10944936685095345792), KQU(18303116923079107729),
+	KQU( 2720566371239725320), KQU( 4958672473562397622),
+	KQU( 3032326668253243412), KQU(13689418691726908338),
+	KQU( 1895205511728843996), KQU( 8146303515271990527),
+	KQU(16507343500056113480), KQU(  473996939105902919),
+	KQU( 9897686885246881481), KQU(14606433762712790575),
+	KQU( 6732796251605566368), KQU( 1399778120855368916),
+	KQU(  935023885182833777), KQU(16066282816186753477),
+	KQU( 7291270991820612055), KQU(17530230393129853844),
+	KQU(10223493623477451366), KQU(15841725630495676683),
+	KQU(17379567246435515824), KQU( 8588251429375561971),
+	KQU(18339511210887206423), KQU(17349587430725976100),
+	KQU(12244876521394838088), KQU( 6382187714147161259),
+	KQU(12335807181848950831), KQU(16948885622305460665),
+	KQU(13755097796371520506), KQU(14806740373324947801),
+	KQU( 4828699633859287703), KQU( 8209879281452301604),
+	KQU(12435716669553736437), KQU(13970976859588452131),
+	KQU( 6233960842566773148), KQU(12507096267900505759),
+	KQU( 1198713114381279421), KQU(14989862731124149015),
+	KQU(15932189508707978949), KQU( 2526406641432708722),
+	KQU(   29187427817271982), KQU( 1499802773054556353),
+	KQU(10816638187021897173), KQU( 5436139270839738132),
+	KQU( 6659882287036010082), KQU( 2154048955317173697),
+	KQU(10887317019333757642), KQU(16281091802634424955),
+	KQU(10754549879915384901), KQU(10760611745769249815),
+	KQU( 2161505946972504002), KQU( 5243132808986265107),
+	KQU(10129852179873415416), KQU(  710339480008649081),
+	KQU( 7802129453068808528), KQU(17967213567178907213),
+	KQU(15730859124668605599), KQU(13058356168962376502),
+	KQU( 3701224985413645909), KQU(14464065869149109264),
+	KQU( 9959272418844311646), KQU(10157426099515958752),
+	KQU(14013736814538268528), KQU(17797456992065653951),
+	KQU(17418878140257344806), KQU(15457429073540561521),
+	KQU( 2184426881360949378), KQU( 2062193041154712416),
+	KQU( 8553463347406931661), KQU( 4913057625202871854),
+	KQU( 2668943682126618425), KQU(17064444737891172288),
+	KQU( 4997115903913298637), KQU(12019402608892327416),
+	KQU(17603584559765897352), KQU(11367529582073647975),
+	KQU( 8211476043518436050), KQU( 8676849804070323674),
+	KQU(18431829230394475730), KQU(10490177861361247904),
+	KQU( 9508720602025651349), KQU( 7409627448555722700),
+	KQU( 5804047018862729008), KQU(11943858176893142594),
+	KQU(11908095418933847092), KQU( 5415449345715887652),
+	KQU( 1554022699166156407), KQU( 9073322106406017161),
+	KQU( 7080630967969047082), KQU(18049736940860732943),
+	KQU(12748714242594196794), KQU( 1226992415735156741),
+	KQU(17900981019609531193), KQU(11720739744008710999),
+	KQU( 3006400683394775434), KQU(11347974011751996028),
+	KQU( 3316999628257954608), KQU( 8384484563557639101),
+	KQU(18117794685961729767), KQU( 1900145025596618194),
+	KQU(17459527840632892676), KQU( 5634784101865710994),
+	KQU( 7918619300292897158), KQU( 3146577625026301350),
+	KQU( 9955212856499068767), KQU( 1873995843681746975),
+	KQU( 1561487759967972194), KQU( 8322718804375878474),
+	KQU(11300284215327028366), KQU( 4667391032508998982),
+	KQU( 9820104494306625580), KQU(17922397968599970610),
+	KQU( 1784690461886786712), KQU(14940365084341346821),
+	KQU( 5348719575594186181), KQU(10720419084507855261),
+	KQU(14210394354145143274), KQU( 2426468692164000131),
+	KQU(16271062114607059202), KQU(14851904092357070247),
+	KQU( 6524493015693121897), KQU( 9825473835127138531),
+	KQU(14222500616268569578), KQU(15521484052007487468),
+	KQU(14462579404124614699), KQU(11012375590820665520),
+	KQU(11625327350536084927), KQU(14452017765243785417),
+	KQU( 9989342263518766305), KQU( 3640105471101803790),
+	KQU( 4749866455897513242), KQU(13963064946736312044),
+	KQU(10007416591973223791), KQU(18314132234717431115),
+	KQU( 3286596588617483450), KQU( 7726163455370818765),
+	KQU( 7575454721115379328), KQU( 5308331576437663422),
+	KQU(18288821894903530934), KQU( 8028405805410554106),
+	KQU(15744019832103296628), KQU(  149765559630932100),
+	KQU( 6137705557200071977), KQU(14513416315434803615),
+	KQU(11665702820128984473), KQU(  218926670505601386),
+	KQU( 6868675028717769519), KQU(15282016569441512302),
+	KQU( 5707000497782960236), KQU( 6671120586555079567),
+	KQU( 2194098052618985448), KQU(16849577895477330978),
+	KQU(12957148471017466283), KQU( 1997805535404859393),
+	KQU( 1180721060263860490), KQU(13206391310193756958),
+	KQU(12980208674461861797), KQU( 3825967775058875366),
+	KQU(17543433670782042631), KQU( 1518339070120322730),
+	KQU(16344584340890991669), KQU( 2611327165318529819),
+	KQU(11265022723283422529), KQU( 4001552800373196817),
+	KQU(14509595890079346161), KQU( 3528717165416234562),
+	KQU(18153222571501914072), KQU( 9387182977209744425),
+	KQU(10064342315985580021), KQU(11373678413215253977),
+	KQU( 2308457853228798099), KQU( 9729042942839545302),
+	KQU( 7833785471140127746), KQU( 6351049900319844436),
+	KQU(14454610627133496067), KQU(12533175683634819111),
+	KQU(15570163926716513029), KQU(13356980519185762498)
+};
+
+TEST_BEGIN(test_gen_rand_32) {
+	uint32_t array32[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
+	uint32_t array32_2[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
+	int i;
+	uint32_t r32;
+	sfmt_t *ctx;
+
+	assert_d_le(get_min_array_size32(), BLOCK_SIZE,
+	    "Array size too small");
+	ctx = init_gen_rand(1234);
+	fill_array32(ctx, array32, BLOCK_SIZE);
+	fill_array32(ctx, array32_2, BLOCK_SIZE);
+	fini_gen_rand(ctx);
+
+	ctx = init_gen_rand(1234);
+	for (i = 0; i < BLOCK_SIZE; i++) {
+		if (i < COUNT_1) {
+			assert_u32_eq(array32[i], init_gen_rand_32_expected[i],
+			    "Output mismatch for i=%d", i);
+		}
+		r32 = gen_rand32(ctx);
+		assert_u32_eq(r32, array32[i],
+		    "Mismatch at array32[%d]=%x, gen=%x", i, array32[i], r32);
+	}
+	for (i = 0; i < COUNT_2; i++) {
+		r32 = gen_rand32(ctx);
+		assert_u32_eq(r32, array32_2[i],
+		    "Mismatch at array32_2[%d]=%x, gen=%x", i, array32_2[i],
+		    r32);
+	}
+	fini_gen_rand(ctx);
+}
+TEST_END
+
+TEST_BEGIN(test_by_array_32) {
+	uint32_t array32[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
+	uint32_t array32_2[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
+	int i;
+	uint32_t ini[4] = {0x1234, 0x5678, 0x9abc, 0xdef0};
+	uint32_t r32;
+	sfmt_t *ctx;
+
+	assert_d_le(get_min_array_size32(), BLOCK_SIZE,
+	    "Array size too small");
+	ctx = init_by_array(ini, 4);
+	fill_array32(ctx, array32, BLOCK_SIZE);
+	fill_array32(ctx, array32_2, BLOCK_SIZE);
+	fini_gen_rand(ctx);
+
+	ctx = init_by_array(ini, 4);
+	for (i = 0; i < BLOCK_SIZE; i++) {
+		if (i < COUNT_1) {
+			assert_u32_eq(array32[i], init_by_array_32_expected[i],
+			    "Output mismatch for i=%d", i);
+		}
+		r32 = gen_rand32(ctx);
+		assert_u32_eq(r32, array32[i],
+		    "Mismatch at array32[%d]=%x, gen=%x", i, array32[i], r32);
+	}
+	for (i = 0; i < COUNT_2; i++) {
+		r32 = gen_rand32(ctx);
+		assert_u32_eq(r32, array32_2[i],
+		    "Mismatch at array32_2[%d]=%x, gen=%x", i, array32_2[i],
+		    r32);
+	}
+	fini_gen_rand(ctx);
+}
+TEST_END
+
+TEST_BEGIN(test_gen_rand_64) {
+	uint64_t array64[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
+	uint64_t array64_2[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
+	int i;
+	uint64_t r;
+	sfmt_t *ctx;
+
+	assert_d_le(get_min_array_size64(), BLOCK_SIZE64,
+	    "Array size too small");
+	ctx = init_gen_rand(4321);
+	fill_array64(ctx, array64, BLOCK_SIZE64);
+	fill_array64(ctx, array64_2, BLOCK_SIZE64);
+	fini_gen_rand(ctx);
+
+	ctx = init_gen_rand(4321);
+	for (i = 0; i < BLOCK_SIZE64; i++) {
+		if (i < COUNT_1) {
+			assert_u64_eq(array64[i], init_gen_rand_64_expected[i],
+			    "Output mismatch for i=%d", i);
+		}
+		r = gen_rand64(ctx);
+		assert_u64_eq(r, array64[i],
+		    "Mismatch at array64[%d]=%"FMTx64", gen=%"FMTx64, i,
+		    array64[i], r);
+	}
+	for (i = 0; i < COUNT_2; i++) {
+		r = gen_rand64(ctx);
+		assert_u64_eq(r, array64_2[i],
+		    "Mismatch at array64_2[%d]=%"FMTx64" gen=%"FMTx64"", i,
+		    array64_2[i], r);
+	}
+	fini_gen_rand(ctx);
+}
+TEST_END
+
+TEST_BEGIN(test_by_array_64) {
+	uint64_t array64[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
+	uint64_t array64_2[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
+	int i;
+	uint64_t r;
+	uint32_t ini[] = {5, 4, 3, 2, 1};
+	sfmt_t *ctx;
+
+	assert_d_le(get_min_array_size64(), BLOCK_SIZE64,
+	    "Array size too small");
+	ctx = init_by_array(ini, 5);
+	fill_array64(ctx, array64, BLOCK_SIZE64);
+	fill_array64(ctx, array64_2, BLOCK_SIZE64);
+	fini_gen_rand(ctx);
+
+	ctx = init_by_array(ini, 5);
+	for (i = 0; i < BLOCK_SIZE64; i++) {
+		if (i < COUNT_1) {
+			assert_u64_eq(array64[i], init_by_array_64_expected[i],
+			    "Output mismatch for i=%d", i);
+		}
+		r = gen_rand64(ctx);
+		assert_u64_eq(r, array64[i],
+		    "Mismatch at array64[%d]=%"FMTx64" gen=%"FMTx64, i,
+		    array64[i], r);
+	}
+	for (i = 0; i < COUNT_2; i++) {
+		r = gen_rand64(ctx);
+		assert_u64_eq(r, array64_2[i],
+		    "Mismatch at array64_2[%d]=%"FMTx64" gen=%"FMTx64, i,
+		    array64_2[i], r);
+	}
+	fini_gen_rand(ctx);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_gen_rand_32,
+	    test_by_array_32,
+	    test_gen_rand_64,
+	    test_by_array_64);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/a0.c b/redis-stable/deps/jemalloc/test/unit/a0.c
new file mode 100644
index 00000000..a27ab3f4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/a0.c
@@ -0,0 +1,16 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_a0) {
+	void *p;
+
+	p = a0malloc(1);
+	assert_ptr_not_null(p, "Unexpected a0malloc() error");
+	a0dalloc(p);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_malloc_init(
+	    test_a0);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset.c b/redis-stable/deps/jemalloc/test/unit/arena_reset.c
new file mode 100644
index 00000000..f5fb24d1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/arena_reset.c
@@ -0,0 +1,344 @@
+#ifndef ARENA_RESET_PROF_C_
+#include "test/jemalloc_test.h"
+#endif
+
+#include "jemalloc/internal/extent_mmap.h"
+#include "jemalloc/internal/rtree.h"
+
+#include "test/extent_hooks.h"
+
+static unsigned
+get_nsizes_impl(const char *cmd) {
+	unsigned ret;
+	size_t z;
+
+	z = sizeof(unsigned);
+	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
+	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
+
+	return ret;
+}
+
+static unsigned
+get_nsmall(void) {
+	return get_nsizes_impl("arenas.nbins");
+}
+
+static unsigned
+get_nlarge(void) {
+	return get_nsizes_impl("arenas.nlextents");
+}
+
+static size_t
+get_size_impl(const char *cmd, size_t ind) {
+	size_t ret;
+	size_t z;
+	size_t mib[4];
+	size_t miblen = 4;
+
+	z = sizeof(size_t);
+	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
+	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
+	mib[2] = ind;
+	z = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
+	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
+
+	return ret;
+}
+
+static size_t
+get_small_size(size_t ind) {
+	return get_size_impl("arenas.bin.0.size", ind);
+}
+
+static size_t
+get_large_size(size_t ind) {
+	return get_size_impl("arenas.lextent.0.size", ind);
+}
+
+/* Like ivsalloc(), but safe to call on discarded allocations. */
+static size_t
+vsalloc(tsdn_t *tsdn, const void *ptr) {
+	rtree_ctx_t rtree_ctx_fallback;
+	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
+
+	extent_t *extent;
+	szind_t szind;
+	if (rtree_extent_szind_read(tsdn, &extents_rtree, rtree_ctx,
+	    (uintptr_t)ptr, false, &extent, &szind)) {
+		return 0;
+	}
+
+	if (extent == NULL) {
+		return 0;
+	}
+	if (extent_state_get(extent) != extent_state_active) {
+		return 0;
+	}
+
+	if (szind == NSIZES) {
+		return 0;
+	}
+
+	return sz_index2size(szind);
+}
+
+static unsigned
+do_arena_create(extent_hooks_t *h) {
+	unsigned arena_ind;
+	size_t sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
+	    (void *)(h != NULL ? &h : NULL), (h != NULL ? sizeof(h) : 0)), 0,
+	    "Unexpected mallctl() failure");
+	return arena_ind;
+}
+
+static void
+do_arena_reset_pre(unsigned arena_ind, void ***ptrs, unsigned *nptrs) {
+#define NLARGE	32
+	unsigned nsmall, nlarge, i;
+	size_t sz;
+	int flags;
+	tsdn_t *tsdn;
+
+	flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
+
+	nsmall = get_nsmall();
+	nlarge = get_nlarge() > NLARGE ? NLARGE : get_nlarge();
+	*nptrs = nsmall + nlarge;
+	*ptrs = (void **)malloc(*nptrs * sizeof(void *));
+	assert_ptr_not_null(*ptrs, "Unexpected malloc() failure");
+
+	/* Allocate objects with a wide range of sizes. */
+	for (i = 0; i < nsmall; i++) {
+		sz = get_small_size(i);
+		(*ptrs)[i] = mallocx(sz, flags);
+		assert_ptr_not_null((*ptrs)[i],
+		    "Unexpected mallocx(%zu, %#x) failure", sz, flags);
+	}
+	for (i = 0; i < nlarge; i++) {
+		sz = get_large_size(i);
+		(*ptrs)[nsmall + i] = mallocx(sz, flags);
+		assert_ptr_not_null((*ptrs)[i],
+		    "Unexpected mallocx(%zu, %#x) failure", sz, flags);
+	}
+
+	tsdn = tsdn_fetch();
+
+	/* Verify allocations. */
+	for (i = 0; i < *nptrs; i++) {
+		assert_zu_gt(ivsalloc(tsdn, (*ptrs)[i]), 0,
+		    "Allocation should have queryable size");
+	}
+}
+
+static void
+do_arena_reset_post(void **ptrs, unsigned nptrs, unsigned arena_ind) {
+	tsdn_t *tsdn;
+	unsigned i;
+
+	tsdn = tsdn_fetch();
+
+	if (have_background_thread) {
+		malloc_mutex_lock(tsdn,
+		    &background_thread_info[arena_ind % ncpus].mtx);
+	}
+	/* Verify allocations no longer exist. */
+	for (i = 0; i < nptrs; i++) {
+		assert_zu_eq(vsalloc(tsdn, ptrs[i]), 0,
+		    "Allocation should no longer exist");
+	}
+	if (have_background_thread) {
+		malloc_mutex_unlock(tsdn,
+		    &background_thread_info[arena_ind % ncpus].mtx);
+	}
+
+	free(ptrs);
+}
+
+static void
+do_arena_reset_destroy(const char *name, unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen;
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib(name, mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+static void
+do_arena_reset(unsigned arena_ind) {
+	do_arena_reset_destroy("arena.0.reset", arena_ind);
+}
+
+static void
+do_arena_destroy(unsigned arena_ind) {
+	do_arena_reset_destroy("arena.0.destroy", arena_ind);
+}
+
+TEST_BEGIN(test_arena_reset) {
+	unsigned arena_ind;
+	void **ptrs;
+	unsigned nptrs;
+
+	arena_ind = do_arena_create(NULL);
+	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
+	do_arena_reset(arena_ind);
+	do_arena_reset_post(ptrs, nptrs, arena_ind);
+}
+TEST_END
+
+static bool
+arena_i_initialized(unsigned arena_ind, bool refresh) {
+	bool initialized;
+	size_t mib[3];
+	size_t miblen, sz;
+
+	if (refresh) {
+		uint64_t epoch = 1;
+		assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
+		    sizeof(epoch)), 0, "Unexpected mallctl() failure");
+	}
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.initialized", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	sz = sizeof(initialized);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&initialized, &sz, NULL,
+	    0), 0, "Unexpected mallctlbymib() failure");
+
+	return initialized;
+}
+
+TEST_BEGIN(test_arena_destroy_initial) {
+	assert_false(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
+	    "Destroyed arena stats should not be initialized");
+}
+TEST_END
+
+TEST_BEGIN(test_arena_destroy_hooks_default) {
+	unsigned arena_ind, arena_ind_another, arena_ind_prev;
+	void **ptrs;
+	unsigned nptrs;
+
+	arena_ind = do_arena_create(NULL);
+	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
+
+	assert_false(arena_i_initialized(arena_ind, false),
+	    "Arena stats should not be initialized");
+	assert_true(arena_i_initialized(arena_ind, true),
+	    "Arena stats should be initialized");
+
+	/*
+	 * Create another arena before destroying one, to better verify arena
+	 * index reuse.
+	 */
+	arena_ind_another = do_arena_create(NULL);
+
+	do_arena_destroy(arena_ind);
+
+	assert_false(arena_i_initialized(arena_ind, true),
+	    "Arena stats should not be initialized");
+	assert_true(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
+	    "Destroyed arena stats should be initialized");
+
+	do_arena_reset_post(ptrs, nptrs, arena_ind);
+
+	arena_ind_prev = arena_ind;
+	arena_ind = do_arena_create(NULL);
+	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
+	assert_u_eq(arena_ind, arena_ind_prev,
+	    "Arena index should have been recycled");
+	do_arena_destroy(arena_ind);
+	do_arena_reset_post(ptrs, nptrs, arena_ind);
+
+	do_arena_destroy(arena_ind_another);
+}
+TEST_END
+
+/*
+ * Actually unmap extents, regardless of opt_retain, so that attempts to access
+ * a destroyed arena's memory will segfault.
+ */
+static bool
+extent_dalloc_unmap(extent_hooks_t *extent_hooks, void *addr, size_t size,
+    bool committed, unsigned arena_ind) {
+	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
+	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
+	    "true" : "false", arena_ind);
+	assert_ptr_eq(extent_hooks, &hooks,
+	    "extent_hooks should be same as pointer used to set hooks");
+	assert_ptr_eq(extent_hooks->dalloc, extent_dalloc_unmap,
+	    "Wrong hook function");
+	called_dalloc = true;
+	if (!try_dalloc) {
+		return true;
+	}
+	pages_unmap(addr, size);
+	did_dalloc = true;
+	return false;
+}
+
+static extent_hooks_t hooks_orig;
+
+static extent_hooks_t hooks_unmap = {
+	extent_alloc_hook,
+	extent_dalloc_unmap, /* dalloc */
+	extent_destroy_hook,
+	extent_commit_hook,
+	extent_decommit_hook,
+	extent_purge_lazy_hook,
+	extent_purge_forced_hook,
+	extent_split_hook,
+	extent_merge_hook
+};
+
+TEST_BEGIN(test_arena_destroy_hooks_unmap) {
+	unsigned arena_ind;
+	void **ptrs;
+	unsigned nptrs;
+
+	extent_hooks_prep();
+	try_decommit = false;
+	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
+	memcpy(&hooks, &hooks_unmap, sizeof(extent_hooks_t));
+
+	did_alloc = false;
+	arena_ind = do_arena_create(&hooks);
+	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
+
+	assert_true(did_alloc, "Expected alloc");
+
+	assert_false(arena_i_initialized(arena_ind, false),
+	    "Arena stats should not be initialized");
+	assert_true(arena_i_initialized(arena_ind, true),
+	    "Arena stats should be initialized");
+
+	did_dalloc = false;
+	do_arena_destroy(arena_ind);
+	assert_true(did_dalloc, "Expected dalloc");
+
+	assert_false(arena_i_initialized(arena_ind, true),
+	    "Arena stats should not be initialized");
+	assert_true(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
+	    "Destroyed arena stats should be initialized");
+
+	do_arena_reset_post(ptrs, nptrs, arena_ind);
+
+	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_arena_reset,
+	    test_arena_destroy_initial,
+	    test_arena_destroy_hooks_default,
+	    test_arena_destroy_hooks_unmap);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
new file mode 100644
index 00000000..38d80124
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
@@ -0,0 +1,4 @@
+#include "test/jemalloc_test.h"
+#define ARENA_RESET_PROF_C_
+
+#include "arena_reset.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
new file mode 100644
index 00000000..041dc1c3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+export MALLOC_CONF="prof:true,lg_prof_sample:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/atomic.c b/redis-stable/deps/jemalloc/test/unit/atomic.c
new file mode 100644
index 00000000..572d8d23
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/atomic.c
@@ -0,0 +1,229 @@
+#include "test/jemalloc_test.h"
+
+/*
+ * We *almost* have consistent short names (e.g. "u32" for uint32_t, "b" for
+ * bool, etc.  The one exception is that the short name for void * is "p" in
+ * some places and "ptr" in others.  In the long run it would be nice to unify
+ * these, but in the short run we'll use this shim.
+ */
+#define assert_p_eq assert_ptr_eq
+
+/*
+ * t: the non-atomic type, like "uint32_t".
+ * ta: the short name for the type, like "u32".
+ * val[1,2,3]: Values of the given type.  The CAS tests use val2 for expected,
+ * and val3 for desired.
+ */
+
+#define DO_TESTS(t, ta, val1, val2, val3) do {				\
+	t val;								\
+	t expected;							\
+	bool success;							\
+	/* This (along with the load below) also tests ATOMIC_LOAD. */	\
+	atomic_##ta##_t atom = ATOMIC_INIT(val1);			\
+									\
+	/* ATOMIC_INIT and load. */					\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1, val, "Load or init failed");		\
+									\
+	/* Store. */							\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	atomic_store_##ta(&atom, val2, ATOMIC_RELAXED);			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val2, val, "Store failed");			\
+									\
+	/* Exchange. */							\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_exchange_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val, "Exchange returned invalid value");	\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val2, val, "Exchange store invalid value");	\
+									\
+	/* 								\
+	 * Weak CAS.  Spurious failures are allowed, so we loop a few	\
+	 * times.							\
+	 */								\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	success = false;						\
+	for (int i = 0; i < 10 && !success; i++) {			\
+		expected = val2;					\
+		success = atomic_compare_exchange_weak_##ta(&atom,	\
+		    &expected, val3, ATOMIC_RELAXED, ATOMIC_RELAXED);	\
+		assert_##ta##_eq(val1, expected, 			\
+		    "CAS should update expected");			\
+	}								\
+	assert_b_eq(val1 == val2, success,				\
+	    "Weak CAS did the wrong state update");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	if (success) {							\
+		assert_##ta##_eq(val3, val,				\
+		    "Successful CAS should update atomic");		\
+	} else {							\
+		assert_##ta##_eq(val1, val,				\
+		    "Unsuccessful CAS should not update atomic");	\
+	}								\
+									\
+	/* Strong CAS. */						\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	expected = val2;						\
+	success = atomic_compare_exchange_strong_##ta(&atom, &expected,	\
+	    val3, ATOMIC_RELAXED, ATOMIC_RELAXED);			\
+	assert_b_eq(val1 == val2, success,				\
+	    "Strong CAS did the wrong state update");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	if (success) {							\
+		assert_##ta##_eq(val3, val,				\
+		    "Successful CAS should update atomic");		\
+	} else {							\
+		assert_##ta##_eq(val1, val,				\
+		    "Unsuccessful CAS should not update atomic");	\
+	}								\
+									\
+									\
+} while (0)
+
+#define DO_INTEGER_TESTS(t, ta, val1, val2) do {			\
+	atomic_##ta##_t atom;						\
+	t val;								\
+									\
+	/* Fetch-add. */						\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_fetch_add_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val,					\
+	    "Fetch-add should return previous value");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1 + val2, val,				\
+	    "Fetch-add should update atomic");				\
+									\
+	/* Fetch-sub. */						\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_fetch_sub_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val,					\
+	    "Fetch-sub should return previous value");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1 - val2, val,				\
+	    "Fetch-sub should update atomic");				\
+									\
+	/* Fetch-and. */						\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_fetch_and_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val,					\
+	    "Fetch-and should return previous value");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1 & val2, val,				\
+	    "Fetch-and should update atomic");				\
+									\
+	/* Fetch-or. */							\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_fetch_or_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val,					\
+	    "Fetch-or should return previous value");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1 | val2, val,				\
+	    "Fetch-or should update atomic");				\
+									\
+	/* Fetch-xor. */						\
+	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
+	val = atomic_fetch_xor_##ta(&atom, val2, ATOMIC_RELAXED);	\
+	assert_##ta##_eq(val1, val,					\
+	    "Fetch-xor should return previous value");			\
+	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
+	assert_##ta##_eq(val1 ^ val2, val,				\
+	    "Fetch-xor should update atomic");				\
+} while (0)
+
+#define TEST_STRUCT(t, ta)						\
+typedef struct {							\
+	t val1;								\
+	t val2;								\
+	t val3;								\
+} ta##_test_t;
+
+#define TEST_CASES(t) {							\
+	{(t)-1, (t)-1, (t)-2},						\
+	{(t)-1, (t) 0, (t)-2},						\
+	{(t)-1, (t) 1, (t)-2},						\
+									\
+	{(t) 0, (t)-1, (t)-2},						\
+	{(t) 0, (t) 0, (t)-2},						\
+	{(t) 0, (t) 1, (t)-2},						\
+									\
+	{(t) 1, (t)-1, (t)-2},						\
+	{(t) 1, (t) 0, (t)-2},						\
+	{(t) 1, (t) 1, (t)-2},						\
+									\
+	{(t)0, (t)-(1 << 22), (t)-2},					\
+	{(t)0, (t)(1 << 22), (t)-2},					\
+	{(t)(1 << 22), (t)-(1 << 22), (t)-2},				\
+	{(t)(1 << 22), (t)(1 << 22), (t)-2}				\
+}
+
+#define TEST_BODY(t, ta) do {						\
+	const ta##_test_t tests[] = TEST_CASES(t);			\
+	for (unsigned i = 0; i < sizeof(tests)/sizeof(tests[0]); i++) {	\
+		ta##_test_t test = tests[i];				\
+		DO_TESTS(t, ta, test.val1, test.val2, test.val3);	\
+	}								\
+} while (0)
+
+#define INTEGER_TEST_BODY(t, ta) do {					\
+	const ta##_test_t tests[] = TEST_CASES(t);			\
+	for (unsigned i = 0; i < sizeof(tests)/sizeof(tests[0]); i++) {	\
+		ta##_test_t test = tests[i];				\
+		DO_TESTS(t, ta, test.val1, test.val2, test.val3);	\
+		DO_INTEGER_TESTS(t, ta, test.val1, test.val2);		\
+	}								\
+} while (0)
+
+TEST_STRUCT(uint64_t, u64);
+TEST_BEGIN(test_atomic_u64) {
+#if !(LG_SIZEOF_PTR == 3 || LG_SIZEOF_INT == 3)
+	test_skip("64-bit atomic operations not supported");
+#else
+	INTEGER_TEST_BODY(uint64_t, u64);
+#endif
+}
+TEST_END
+
+
+TEST_STRUCT(uint32_t, u32);
+TEST_BEGIN(test_atomic_u32) {
+	INTEGER_TEST_BODY(uint32_t, u32);
+}
+TEST_END
+
+TEST_STRUCT(void *, p);
+TEST_BEGIN(test_atomic_p) {
+	TEST_BODY(void *, p);
+}
+TEST_END
+
+TEST_STRUCT(size_t, zu);
+TEST_BEGIN(test_atomic_zu) {
+	INTEGER_TEST_BODY(size_t, zu);
+}
+TEST_END
+
+TEST_STRUCT(ssize_t, zd);
+TEST_BEGIN(test_atomic_zd) {
+	INTEGER_TEST_BODY(ssize_t, zd);
+}
+TEST_END
+
+
+TEST_STRUCT(unsigned, u);
+TEST_BEGIN(test_atomic_u) {
+	INTEGER_TEST_BODY(unsigned, u);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_atomic_u64,
+	    test_atomic_u32,
+	    test_atomic_p,
+	    test_atomic_zu,
+	    test_atomic_zd,
+	    test_atomic_u);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/background_thread.c b/redis-stable/deps/jemalloc/test/unit/background_thread.c
new file mode 100644
index 00000000..f7bd37c4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/background_thread.c
@@ -0,0 +1,119 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/util.h"
+
+static void
+test_switch_background_thread_ctl(bool new_val) {
+	bool e0, e1;
+	size_t sz = sizeof(bool);
+
+	e1 = new_val;
+	assert_d_eq(mallctl("background_thread", (void *)&e0, &sz,
+	    &e1, sz), 0, "Unexpected mallctl() failure");
+	assert_b_eq(e0, !e1,
+	    "background_thread should be %d before.\n", !e1);
+	if (e1) {
+		assert_zu_gt(n_background_threads, 0,
+		    "Number of background threads should be non zero.\n");
+	} else {
+		assert_zu_eq(n_background_threads, 0,
+		    "Number of background threads should be zero.\n");
+	}
+}
+
+static void
+test_repeat_background_thread_ctl(bool before) {
+	bool e0, e1;
+	size_t sz = sizeof(bool);
+
+	e1 = before;
+	assert_d_eq(mallctl("background_thread", (void *)&e0, &sz,
+	    &e1, sz), 0, "Unexpected mallctl() failure");
+	assert_b_eq(e0, before,
+	    "background_thread should be %d.\n", before);
+	if (e1) {
+		assert_zu_gt(n_background_threads, 0,
+		    "Number of background threads should be non zero.\n");
+	} else {
+		assert_zu_eq(n_background_threads, 0,
+		    "Number of background threads should be zero.\n");
+	}
+}
+
+TEST_BEGIN(test_background_thread_ctl) {
+	test_skip_if(!have_background_thread);
+
+	bool e0, e1;
+	size_t sz = sizeof(bool);
+
+	assert_d_eq(mallctl("opt.background_thread", (void *)&e0, &sz,
+	    NULL, 0), 0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctl("background_thread", (void *)&e1, &sz,
+	    NULL, 0), 0, "Unexpected mallctl() failure");
+	assert_b_eq(e0, e1,
+	    "Default and opt.background_thread does not match.\n");
+	if (e0) {
+		test_switch_background_thread_ctl(false);
+	}
+	assert_zu_eq(n_background_threads, 0,
+	    "Number of background threads should be 0.\n");
+
+	for (unsigned i = 0; i < 4; i++) {
+		test_switch_background_thread_ctl(true);
+		test_repeat_background_thread_ctl(true);
+		test_repeat_background_thread_ctl(true);
+
+		test_switch_background_thread_ctl(false);
+		test_repeat_background_thread_ctl(false);
+		test_repeat_background_thread_ctl(false);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_background_thread_running) {
+	test_skip_if(!have_background_thread);
+	test_skip_if(!config_stats);
+
+#if defined(JEMALLOC_BACKGROUND_THREAD)
+	tsd_t *tsd = tsd_fetch();
+	background_thread_info_t *info = &background_thread_info[0];
+
+	test_repeat_background_thread_ctl(false);
+	test_switch_background_thread_ctl(true);
+	assert_b_eq(info->state, background_thread_started,
+	    "Background_thread did not start.\n");
+
+	nstime_t start, now;
+	nstime_init(&start, 0);
+	nstime_update(&start);
+
+	bool ran = false;
+	while (true) {
+		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
+		if (info->tot_n_runs > 0) {
+			ran = true;
+		}
+		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
+		if (ran) {
+			break;
+		}
+
+		nstime_init(&now, 0);
+		nstime_update(&now);
+		nstime_subtract(&now, &start);
+		assert_u64_lt(nstime_sec(&now), 1000,
+		    "Background threads did not run for 1000 seconds.");
+		sleep(1);
+	}
+	test_switch_background_thread_ctl(false);
+#endif
+}
+TEST_END
+
+int
+main(void) {
+	/* Background_thread creation tests reentrancy naturally. */
+	return test_no_reentrancy(
+	    test_background_thread_ctl,
+	    test_background_thread_running);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c b/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
new file mode 100644
index 00000000..ff95e672
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
@@ -0,0 +1,83 @@
+#include "test/jemalloc_test.h"
+
+const char *malloc_conf = "background_thread:false,narenas:1,max_background_threads:20";
+
+TEST_BEGIN(test_deferred) {
+	test_skip_if(!have_background_thread);
+
+	unsigned id;
+	size_t sz_u = sizeof(unsigned);
+
+	/*
+	 * 10 here is somewhat arbitrary, except insofar as we want to ensure
+	 * that the number of background threads is smaller than the number of
+	 * arenas.  I'll ragequit long before we have to spin up 10 threads per
+	 * cpu to handle background purging, so this is a conservative
+	 * approximation.
+	 */
+	for (unsigned i = 0; i < 10 * ncpus; i++) {
+		assert_d_eq(mallctl("arenas.create", &id, &sz_u, NULL, 0), 0,
+		    "Failed to create arena");
+	}
+
+	bool enable = true;
+	size_t sz_b = sizeof(bool);
+	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
+	    "Failed to enable background threads");
+	enable = false;
+	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
+	    "Failed to disable background threads");
+}
+TEST_END
+
+TEST_BEGIN(test_max_background_threads) {
+	test_skip_if(!have_background_thread);
+
+	size_t maxt;
+	size_t opt_maxt;
+	size_t sz_m = sizeof(maxt);
+	assert_d_eq(mallctl("opt.max_background_threads",
+			    &opt_maxt, &sz_m, NULL, 0), 0,
+			    "Failed to get opt.max_background_threads");
+	assert_d_eq(mallctl("max_background_threads", &maxt, &sz_m, NULL, 0), 0,
+		    "Failed to get max background threads");
+	assert_zu_eq(20, maxt, "should be ncpus");
+	assert_zu_eq(opt_maxt, maxt,
+		     "max_background_threads and "
+		     "opt.max_background_threads should match");
+	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
+		    0, "Failed to set max background threads");
+
+	unsigned id;
+	size_t sz_u = sizeof(unsigned);
+
+	for (unsigned i = 0; i < 10 * ncpus; i++) {
+		assert_d_eq(mallctl("arenas.create", &id, &sz_u, NULL, 0), 0,
+		    "Failed to create arena");
+	}
+
+	bool enable = true;
+	size_t sz_b = sizeof(bool);
+	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
+	    "Failed to enable background threads");
+	assert_zu_eq(n_background_threads, maxt,
+		     "Number of background threads should be 3.\n");
+	maxt = 10;
+	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
+		    0, "Failed to set max background threads");
+	assert_zu_eq(n_background_threads, maxt,
+		     "Number of background threads should be 10.\n");
+	maxt = 3;
+	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
+		    0, "Failed to set max background threads");
+	assert_zu_eq(n_background_threads, maxt,
+		     "Number of background threads should be 3.\n");
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+		test_deferred,
+		test_max_background_threads);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/base.c b/redis-stable/deps/jemalloc/test/unit/base.c
new file mode 100644
index 00000000..6b792cf2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/base.c
@@ -0,0 +1,234 @@
+#include "test/jemalloc_test.h"
+
+#include "test/extent_hooks.h"
+
+static extent_hooks_t hooks_null = {
+	extent_alloc_hook,
+	NULL, /* dalloc */
+	NULL, /* destroy */
+	NULL, /* commit */
+	NULL, /* decommit */
+	NULL, /* purge_lazy */
+	NULL, /* purge_forced */
+	NULL, /* split */
+	NULL /* merge */
+};
+
+static extent_hooks_t hooks_not_null = {
+	extent_alloc_hook,
+	extent_dalloc_hook,
+	extent_destroy_hook,
+	NULL, /* commit */
+	extent_decommit_hook,
+	extent_purge_lazy_hook,
+	extent_purge_forced_hook,
+	NULL, /* split */
+	NULL /* merge */
+};
+
+TEST_BEGIN(test_base_hooks_default) {
+	base_t *base;
+	size_t allocated0, allocated1, resident, mapped, n_thp;
+
+	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
+	base = base_new(tsdn, 0, (extent_hooks_t *)&extent_hooks_default);
+
+	if (config_stats) {
+		base_stats_get(tsdn, base, &allocated0, &resident, &mapped,
+		    &n_thp);
+		assert_zu_ge(allocated0, sizeof(base_t),
+		    "Base header should count as allocated");
+		if (opt_metadata_thp == metadata_thp_always) {
+			assert_zu_gt(n_thp, 0,
+			    "Base should have 1 THP at least.");
+		}
+	}
+
+	assert_ptr_not_null(base_alloc(tsdn, base, 42, 1),
+	    "Unexpected base_alloc() failure");
+
+	if (config_stats) {
+		base_stats_get(tsdn, base, &allocated1, &resident, &mapped,
+		    &n_thp);
+		assert_zu_ge(allocated1 - allocated0, 42,
+		    "At least 42 bytes were allocated by base_alloc()");
+	}
+
+	base_delete(tsdn, base);
+}
+TEST_END
+
+TEST_BEGIN(test_base_hooks_null) {
+	extent_hooks_t hooks_orig;
+	base_t *base;
+	size_t allocated0, allocated1, resident, mapped, n_thp;
+
+	extent_hooks_prep();
+	try_dalloc = false;
+	try_destroy = true;
+	try_decommit = false;
+	try_purge_lazy = false;
+	try_purge_forced = false;
+	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
+	memcpy(&hooks, &hooks_null, sizeof(extent_hooks_t));
+
+	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
+	base = base_new(tsdn, 0, &hooks);
+	assert_ptr_not_null(base, "Unexpected base_new() failure");
+
+	if (config_stats) {
+		base_stats_get(tsdn, base, &allocated0, &resident, &mapped,
+		    &n_thp);
+		assert_zu_ge(allocated0, sizeof(base_t),
+		    "Base header should count as allocated");
+		if (opt_metadata_thp == metadata_thp_always) {
+			assert_zu_gt(n_thp, 0,
+			    "Base should have 1 THP at least.");
+		}
+	}
+
+	assert_ptr_not_null(base_alloc(tsdn, base, 42, 1),
+	    "Unexpected base_alloc() failure");
+
+	if (config_stats) {
+		base_stats_get(tsdn, base, &allocated1, &resident, &mapped,
+		    &n_thp);
+		assert_zu_ge(allocated1 - allocated0, 42,
+		    "At least 42 bytes were allocated by base_alloc()");
+	}
+
+	base_delete(tsdn, base);
+
+	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
+}
+TEST_END
+
+TEST_BEGIN(test_base_hooks_not_null) {
+	extent_hooks_t hooks_orig;
+	base_t *base;
+	void *p, *q, *r, *r_exp;
+
+	extent_hooks_prep();
+	try_dalloc = false;
+	try_destroy = true;
+	try_decommit = false;
+	try_purge_lazy = false;
+	try_purge_forced = false;
+	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
+	memcpy(&hooks, &hooks_not_null, sizeof(extent_hooks_t));
+
+	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
+	did_alloc = false;
+	base = base_new(tsdn, 0, &hooks);
+	assert_ptr_not_null(base, "Unexpected base_new() failure");
+	assert_true(did_alloc, "Expected alloc");
+
+	/*
+	 * Check for tight packing at specified alignment under simple
+	 * conditions.
+	 */
+	{
+		const size_t alignments[] = {
+			1,
+			QUANTUM,
+			QUANTUM << 1,
+			CACHELINE,
+			CACHELINE << 1,
+		};
+		unsigned i;
+
+		for (i = 0; i < sizeof(alignments) / sizeof(size_t); i++) {
+			size_t alignment = alignments[i];
+			size_t align_ceil = ALIGNMENT_CEILING(alignment,
+			    QUANTUM);
+			p = base_alloc(tsdn, base, 1, alignment);
+			assert_ptr_not_null(p,
+			    "Unexpected base_alloc() failure");
+			assert_ptr_eq(p,
+			    (void *)(ALIGNMENT_CEILING((uintptr_t)p,
+			    alignment)), "Expected quantum alignment");
+			q = base_alloc(tsdn, base, alignment, alignment);
+			assert_ptr_not_null(q,
+			    "Unexpected base_alloc() failure");
+			assert_ptr_eq((void *)((uintptr_t)p + align_ceil), q,
+			    "Minimal allocation should take up %zu bytes",
+			    align_ceil);
+			r = base_alloc(tsdn, base, 1, alignment);
+			assert_ptr_not_null(r,
+			    "Unexpected base_alloc() failure");
+			assert_ptr_eq((void *)((uintptr_t)q + align_ceil), r,
+			    "Minimal allocation should take up %zu bytes",
+			    align_ceil);
+		}
+	}
+
+	/*
+	 * Allocate an object that cannot fit in the first block, then verify
+	 * that the first block's remaining space is considered for subsequent
+	 * allocation.
+	 */
+	assert_zu_ge(extent_bsize_get(&base->blocks->extent), QUANTUM,
+	    "Remainder insufficient for test");
+	/* Use up all but one quantum of block. */
+	while (extent_bsize_get(&base->blocks->extent) > QUANTUM) {
+		p = base_alloc(tsdn, base, QUANTUM, QUANTUM);
+		assert_ptr_not_null(p, "Unexpected base_alloc() failure");
+	}
+	r_exp = extent_addr_get(&base->blocks->extent);
+	assert_zu_eq(base->extent_sn_next, 1, "One extant block expected");
+	q = base_alloc(tsdn, base, QUANTUM + 1, QUANTUM);
+	assert_ptr_not_null(q, "Unexpected base_alloc() failure");
+	assert_ptr_ne(q, r_exp, "Expected allocation from new block");
+	assert_zu_eq(base->extent_sn_next, 2, "Two extant blocks expected");
+	r = base_alloc(tsdn, base, QUANTUM, QUANTUM);
+	assert_ptr_not_null(r, "Unexpected base_alloc() failure");
+	assert_ptr_eq(r, r_exp, "Expected allocation from first block");
+	assert_zu_eq(base->extent_sn_next, 2, "Two extant blocks expected");
+
+	/*
+	 * Check for proper alignment support when normal blocks are too small.
+	 */
+	{
+		const size_t alignments[] = {
+			HUGEPAGE,
+			HUGEPAGE << 1
+		};
+		unsigned i;
+
+		for (i = 0; i < sizeof(alignments) / sizeof(size_t); i++) {
+			size_t alignment = alignments[i];
+			p = base_alloc(tsdn, base, QUANTUM, alignment);
+			assert_ptr_not_null(p,
+			    "Unexpected base_alloc() failure");
+			assert_ptr_eq(p,
+			    (void *)(ALIGNMENT_CEILING((uintptr_t)p,
+			    alignment)), "Expected %zu-byte alignment",
+			    alignment);
+		}
+	}
+
+	called_dalloc = called_destroy = called_decommit = called_purge_lazy =
+	    called_purge_forced = false;
+	base_delete(tsdn, base);
+	assert_true(called_dalloc, "Expected dalloc call");
+	assert_true(!called_destroy, "Unexpected destroy call");
+	assert_true(called_decommit, "Expected decommit call");
+	assert_true(called_purge_lazy, "Expected purge_lazy call");
+	assert_true(called_purge_forced, "Expected purge_forced call");
+
+	try_dalloc = true;
+	try_destroy = true;
+	try_decommit = true;
+	try_purge_lazy = true;
+	try_purge_forced = true;
+	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_base_hooks_default,
+	    test_base_hooks_null,
+	    test_base_hooks_not_null);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/bit_util.c b/redis-stable/deps/jemalloc/test/unit/bit_util.c
new file mode 100644
index 00000000..42a97013
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/bit_util.c
@@ -0,0 +1,57 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/bit_util.h"
+
+#define TEST_POW2_CEIL(t, suf, pri) do {				\
+	unsigned i, pow2;						\
+	t x;								\
+									\
+	assert_##suf##_eq(pow2_ceil_##suf(0), 0, "Unexpected result");	\
+									\
+	for (i = 0; i < sizeof(t) * 8; i++) {				\
+		assert_##suf##_eq(pow2_ceil_##suf(((t)1) << i), ((t)1)	\
+		    << i, "Unexpected result");				\
+	}								\
+									\
+	for (i = 2; i < sizeof(t) * 8; i++) {				\
+		assert_##suf##_eq(pow2_ceil_##suf((((t)1) << i) - 1),	\
+		    ((t)1) << i, "Unexpected result");			\
+	}								\
+									\
+	for (i = 0; i < sizeof(t) * 8 - 1; i++) {			\
+		assert_##suf##_eq(pow2_ceil_##suf((((t)1) << i) + 1),	\
+		    ((t)1) << (i+1), "Unexpected result");		\
+	}								\
+									\
+	for (pow2 = 1; pow2 < 25; pow2++) {				\
+		for (x = (((t)1) << (pow2-1)) + 1; x <= ((t)1) << pow2;	\
+		    x++) {						\
+			assert_##suf##_eq(pow2_ceil_##suf(x),		\
+			    ((t)1) << pow2,				\
+			    "Unexpected result, x=%"pri, x);		\
+		}							\
+	}								\
+} while (0)
+
+TEST_BEGIN(test_pow2_ceil_u64) {
+	TEST_POW2_CEIL(uint64_t, u64, FMTu64);
+}
+TEST_END
+
+TEST_BEGIN(test_pow2_ceil_u32) {
+	TEST_POW2_CEIL(uint32_t, u32, FMTu32);
+}
+TEST_END
+
+TEST_BEGIN(test_pow2_ceil_zu) {
+	TEST_POW2_CEIL(size_t, zu, "zu");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_pow2_ceil_u64,
+	    test_pow2_ceil_u32,
+	    test_pow2_ceil_zu);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/bitmap.c b/redis-stable/deps/jemalloc/test/unit/bitmap.c
new file mode 100644
index 00000000..cafb2039
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/bitmap.c
@@ -0,0 +1,431 @@
+#include "test/jemalloc_test.h"
+
+#define NBITS_TAB \
+    NB( 1) \
+    NB( 2) \
+    NB( 3) \
+    NB( 4) \
+    NB( 5) \
+    NB( 6) \
+    NB( 7) \
+    NB( 8) \
+    NB( 9) \
+    NB(10) \
+    NB(11) \
+    NB(12) \
+    NB(13) \
+    NB(14) \
+    NB(15) \
+    NB(16) \
+    NB(17) \
+    NB(18) \
+    NB(19) \
+    NB(20) \
+    NB(21) \
+    NB(22) \
+    NB(23) \
+    NB(24) \
+    NB(25) \
+    NB(26) \
+    NB(27) \
+    NB(28) \
+    NB(29) \
+    NB(30) \
+    NB(31) \
+    NB(32) \
+    \
+    NB(33) \
+    NB(34) \
+    NB(35) \
+    NB(36) \
+    NB(37) \
+    NB(38) \
+    NB(39) \
+    NB(40) \
+    NB(41) \
+    NB(42) \
+    NB(43) \
+    NB(44) \
+    NB(45) \
+    NB(46) \
+    NB(47) \
+    NB(48) \
+    NB(49) \
+    NB(50) \
+    NB(51) \
+    NB(52) \
+    NB(53) \
+    NB(54) \
+    NB(55) \
+    NB(56) \
+    NB(57) \
+    NB(58) \
+    NB(59) \
+    NB(60) \
+    NB(61) \
+    NB(62) \
+    NB(63) \
+    NB(64) \
+    NB(65) \
+    \
+    NB(126) \
+    NB(127) \
+    NB(128) \
+    NB(129) \
+    NB(130) \
+    \
+    NB(254) \
+    NB(255) \
+    NB(256) \
+    NB(257) \
+    NB(258) \
+    \
+    NB(510) \
+    NB(511) \
+    NB(512) \
+    NB(513) \
+    NB(514) \
+    \
+    NB(1024) \
+    NB(2048) \
+    NB(4096) \
+    NB(8192) \
+    NB(16384) \
+
+static void
+test_bitmap_initializer_body(const bitmap_info_t *binfo, size_t nbits) {
+	bitmap_info_t binfo_dyn;
+	bitmap_info_init(&binfo_dyn, nbits);
+
+	assert_zu_eq(bitmap_size(binfo), bitmap_size(&binfo_dyn),
+	    "Unexpected difference between static and dynamic initialization, "
+	    "nbits=%zu", nbits);
+	assert_zu_eq(binfo->nbits, binfo_dyn.nbits,
+	    "Unexpected difference between static and dynamic initialization, "
+	    "nbits=%zu", nbits);
+#ifdef BITMAP_USE_TREE
+	assert_u_eq(binfo->nlevels, binfo_dyn.nlevels,
+	    "Unexpected difference between static and dynamic initialization, "
+	    "nbits=%zu", nbits);
+	{
+		unsigned i;
+
+		for (i = 0; i < binfo->nlevels; i++) {
+			assert_zu_eq(binfo->levels[i].group_offset,
+			    binfo_dyn.levels[i].group_offset,
+			    "Unexpected difference between static and dynamic "
+			    "initialization, nbits=%zu, level=%u", nbits, i);
+		}
+	}
+#else
+	assert_zu_eq(binfo->ngroups, binfo_dyn.ngroups,
+	    "Unexpected difference between static and dynamic initialization");
+#endif
+}
+
+TEST_BEGIN(test_bitmap_initializer) {
+#define NB(nbits) {							\
+		if (nbits <= BITMAP_MAXBITS) {				\
+			bitmap_info_t binfo =				\
+			    BITMAP_INFO_INITIALIZER(nbits);		\
+			test_bitmap_initializer_body(&binfo, nbits);	\
+		}							\
+	}
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+static size_t
+test_bitmap_size_body(const bitmap_info_t *binfo, size_t nbits,
+    size_t prev_size) {
+	size_t size = bitmap_size(binfo);
+	assert_zu_ge(size, (nbits >> 3),
+	    "Bitmap size is smaller than expected");
+	assert_zu_ge(size, prev_size, "Bitmap size is smaller than expected");
+	return size;
+}
+
+TEST_BEGIN(test_bitmap_size) {
+	size_t nbits, prev_size;
+
+	prev_size = 0;
+	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
+		bitmap_info_t binfo;
+		bitmap_info_init(&binfo, nbits);
+		prev_size = test_bitmap_size_body(&binfo, nbits, prev_size);
+	}
+#define NB(nbits) {							\
+		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
+		prev_size = test_bitmap_size_body(&binfo, nbits,	\
+		    prev_size);						\
+	}
+	prev_size = 0;
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+static void
+test_bitmap_init_body(const bitmap_info_t *binfo, size_t nbits) {
+	size_t i;
+	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
+	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
+
+	bitmap_init(bitmap, binfo, false);
+	for (i = 0; i < nbits; i++) {
+		assert_false(bitmap_get(bitmap, binfo, i),
+		    "Bit should be unset");
+	}
+
+	bitmap_init(bitmap, binfo, true);
+	for (i = 0; i < nbits; i++) {
+		assert_true(bitmap_get(bitmap, binfo, i), "Bit should be set");
+	}
+
+	free(bitmap);
+}
+
+TEST_BEGIN(test_bitmap_init) {
+	size_t nbits;
+
+	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
+		bitmap_info_t binfo;
+		bitmap_info_init(&binfo, nbits);
+		test_bitmap_init_body(&binfo, nbits);
+	}
+#define NB(nbits) {							\
+		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
+		test_bitmap_init_body(&binfo, nbits);			\
+	}
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+static void
+test_bitmap_set_body(const bitmap_info_t *binfo, size_t nbits) {
+	size_t i;
+	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
+	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
+	bitmap_init(bitmap, binfo, false);
+
+	for (i = 0; i < nbits; i++) {
+		bitmap_set(bitmap, binfo, i);
+	}
+	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
+	free(bitmap);
+}
+
+TEST_BEGIN(test_bitmap_set) {
+	size_t nbits;
+
+	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
+		bitmap_info_t binfo;
+		bitmap_info_init(&binfo, nbits);
+		test_bitmap_set_body(&binfo, nbits);
+	}
+#define NB(nbits) {							\
+		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
+		test_bitmap_set_body(&binfo, nbits);			\
+	}
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+static void
+test_bitmap_unset_body(const bitmap_info_t *binfo, size_t nbits) {
+	size_t i;
+	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
+	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
+	bitmap_init(bitmap, binfo, false);
+
+	for (i = 0; i < nbits; i++) {
+		bitmap_set(bitmap, binfo, i);
+	}
+	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
+	for (i = 0; i < nbits; i++) {
+		bitmap_unset(bitmap, binfo, i);
+	}
+	for (i = 0; i < nbits; i++) {
+		bitmap_set(bitmap, binfo, i);
+	}
+	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
+	free(bitmap);
+}
+
+TEST_BEGIN(test_bitmap_unset) {
+	size_t nbits;
+
+	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
+		bitmap_info_t binfo;
+		bitmap_info_init(&binfo, nbits);
+		test_bitmap_unset_body(&binfo, nbits);
+	}
+#define NB(nbits) {							\
+		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
+		test_bitmap_unset_body(&binfo, nbits);			\
+	}
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+static void
+test_bitmap_xfu_body(const bitmap_info_t *binfo, size_t nbits) {
+	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
+	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
+	bitmap_init(bitmap, binfo, false);
+
+	/* Iteratively set bits starting at the beginning. */
+	for (size_t i = 0; i < nbits; i++) {
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
+		    "First unset bit should be just after previous first unset "
+		    "bit");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
+		    "First unset bit should be just after previous first unset "
+		    "bit");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
+		    "First unset bit should be just after previous first unset "
+		    "bit");
+		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
+		    "First unset bit should be just after previous first unset "
+		    "bit");
+	}
+	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
+
+	/*
+	 * Iteratively unset bits starting at the end, and verify that
+	 * bitmap_sfu() reaches the unset bits.
+	 */
+	for (size_t i = nbits - 1; i < nbits; i--) { /* (nbits..0] */
+		bitmap_unset(bitmap, binfo, i);
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
+		    "First unset bit should the bit previously unset");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
+		    "First unset bit should the bit previously unset");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
+		    "First unset bit should the bit previously unset");
+		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
+		    "First unset bit should the bit previously unset");
+		bitmap_unset(bitmap, binfo, i);
+	}
+	assert_false(bitmap_get(bitmap, binfo, 0), "Bit should be unset");
+
+	/*
+	 * Iteratively set bits starting at the beginning, and verify that
+	 * bitmap_sfu() looks past them.
+	 */
+	for (size_t i = 1; i < nbits; i++) {
+		bitmap_set(bitmap, binfo, i - 1);
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
+		    "First unset bit should be just after the bit previously "
+		    "set");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
+		    "First unset bit should be just after the bit previously "
+		    "set");
+		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
+		    "First unset bit should be just after the bit previously "
+		    "set");
+		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
+		    "First unset bit should be just after the bit previously "
+		    "set");
+		bitmap_unset(bitmap, binfo, i);
+	}
+	assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), nbits - 1,
+	    "First unset bit should be the last bit");
+	assert_zu_eq(bitmap_ffu(bitmap, binfo, (nbits > 1) ? nbits-2 : nbits-1),
+	    nbits - 1, "First unset bit should be the last bit");
+	assert_zu_eq(bitmap_ffu(bitmap, binfo, nbits - 1), nbits - 1,
+	    "First unset bit should be the last bit");
+	assert_zu_eq(bitmap_sfu(bitmap, binfo), nbits - 1,
+	    "First unset bit should be the last bit");
+	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
+
+	/*
+	 * Bubble a "usu" pattern through the bitmap and verify that
+	 * bitmap_ffu() finds the correct bit for all five min_bit cases.
+	 */
+	if (nbits >= 3) {
+		for (size_t i = 0; i < nbits-2; i++) {
+			bitmap_unset(bitmap, binfo, i);
+			bitmap_unset(bitmap, binfo, i+2);
+			if (i > 0) {
+				assert_zu_eq(bitmap_ffu(bitmap, binfo, i-1), i,
+				    "Unexpected first unset bit");
+			}
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
+			    "Unexpected first unset bit");
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+1), i+2,
+			    "Unexpected first unset bit");
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+2), i+2,
+			    "Unexpected first unset bit");
+			if (i + 3 < nbits) {
+				assert_zu_eq(bitmap_ffu(bitmap, binfo, i+3),
+				    nbits, "Unexpected first unset bit");
+			}
+			assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
+			    "Unexpected first unset bit");
+			assert_zu_eq(bitmap_sfu(bitmap, binfo), i+2,
+			    "Unexpected first unset bit");
+		}
+	}
+
+	/*
+	 * Unset the last bit, bubble another unset bit through the bitmap, and
+	 * verify that bitmap_ffu() finds the correct bit for all four min_bit
+	 * cases.
+	 */
+	if (nbits >= 3) {
+		bitmap_unset(bitmap, binfo, nbits-1);
+		for (size_t i = 0; i < nbits-1; i++) {
+			bitmap_unset(bitmap, binfo, i);
+			if (i > 0) {
+				assert_zu_eq(bitmap_ffu(bitmap, binfo, i-1), i,
+				    "Unexpected first unset bit");
+			}
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
+			    "Unexpected first unset bit");
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+1), nbits-1,
+			    "Unexpected first unset bit");
+			assert_zu_eq(bitmap_ffu(bitmap, binfo, nbits-1),
+			    nbits-1, "Unexpected first unset bit");
+
+			assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
+			    "Unexpected first unset bit");
+		}
+		assert_zu_eq(bitmap_sfu(bitmap, binfo), nbits-1,
+		    "Unexpected first unset bit");
+	}
+
+	free(bitmap);
+}
+
+TEST_BEGIN(test_bitmap_xfu) {
+	size_t nbits;
+
+	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
+		bitmap_info_t binfo;
+		bitmap_info_init(&binfo, nbits);
+		test_bitmap_xfu_body(&binfo, nbits);
+	}
+#define NB(nbits) {							\
+		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
+		test_bitmap_xfu_body(&binfo, nbits);			\
+	}
+	NBITS_TAB
+#undef NB
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_bitmap_initializer,
+	    test_bitmap_size,
+	    test_bitmap_init,
+	    test_bitmap_set,
+	    test_bitmap_unset,
+	    test_bitmap_xfu);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/ckh.c b/redis-stable/deps/jemalloc/test/unit/ckh.c
new file mode 100644
index 00000000..707ea5f8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/ckh.c
@@ -0,0 +1,211 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_new_delete) {
+	tsd_t *tsd;
+	ckh_t ckh;
+
+	tsd = tsd_fetch();
+
+	assert_false(ckh_new(tsd, &ckh, 2, ckh_string_hash,
+	    ckh_string_keycomp), "Unexpected ckh_new() error");
+	ckh_delete(tsd, &ckh);
+
+	assert_false(ckh_new(tsd, &ckh, 3, ckh_pointer_hash,
+	    ckh_pointer_keycomp), "Unexpected ckh_new() error");
+	ckh_delete(tsd, &ckh);
+}
+TEST_END
+
+TEST_BEGIN(test_count_insert_search_remove) {
+	tsd_t *tsd;
+	ckh_t ckh;
+	const char *strs[] = {
+	    "a string",
+	    "A string",
+	    "a string.",
+	    "A string."
+	};
+	const char *missing = "A string not in the hash table.";
+	size_t i;
+
+	tsd = tsd_fetch();
+
+	assert_false(ckh_new(tsd, &ckh, 2, ckh_string_hash,
+	    ckh_string_keycomp), "Unexpected ckh_new() error");
+	assert_zu_eq(ckh_count(&ckh), 0,
+	    "ckh_count() should return %zu, but it returned %zu", ZU(0),
+	    ckh_count(&ckh));
+
+	/* Insert. */
+	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
+		ckh_insert(tsd, &ckh, strs[i], strs[i]);
+		assert_zu_eq(ckh_count(&ckh), i+1,
+		    "ckh_count() should return %zu, but it returned %zu", i+1,
+		    ckh_count(&ckh));
+	}
+
+	/* Search. */
+	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
+		union {
+			void *p;
+			const char *s;
+		} k, v;
+		void **kp, **vp;
+		const char *ks, *vs;
+
+		kp = (i & 1) ? &k.p : NULL;
+		vp = (i & 2) ? &v.p : NULL;
+		k.p = NULL;
+		v.p = NULL;
+		assert_false(ckh_search(&ckh, strs[i], kp, vp),
+		    "Unexpected ckh_search() error");
+
+		ks = (i & 1) ? strs[i] : (const char *)NULL;
+		vs = (i & 2) ? strs[i] : (const char *)NULL;
+		assert_ptr_eq((void *)ks, (void *)k.s, "Key mismatch, i=%zu",
+		    i);
+		assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu",
+		    i);
+	}
+	assert_true(ckh_search(&ckh, missing, NULL, NULL),
+	    "Unexpected ckh_search() success");
+
+	/* Remove. */
+	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
+		union {
+			void *p;
+			const char *s;
+		} k, v;
+		void **kp, **vp;
+		const char *ks, *vs;
+
+		kp = (i & 1) ? &k.p : NULL;
+		vp = (i & 2) ? &v.p : NULL;
+		k.p = NULL;
+		v.p = NULL;
+		assert_false(ckh_remove(tsd, &ckh, strs[i], kp, vp),
+		    "Unexpected ckh_remove() error");
+
+		ks = (i & 1) ? strs[i] : (const char *)NULL;
+		vs = (i & 2) ? strs[i] : (const char *)NULL;
+		assert_ptr_eq((void *)ks, (void *)k.s, "Key mismatch, i=%zu",
+		    i);
+		assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu",
+		    i);
+		assert_zu_eq(ckh_count(&ckh),
+		    sizeof(strs)/sizeof(const char *) - i - 1,
+		    "ckh_count() should return %zu, but it returned %zu",
+		        sizeof(strs)/sizeof(const char *) - i - 1,
+		    ckh_count(&ckh));
+	}
+
+	ckh_delete(tsd, &ckh);
+}
+TEST_END
+
+TEST_BEGIN(test_insert_iter_remove) {
+#define NITEMS ZU(1000)
+	tsd_t *tsd;
+	ckh_t ckh;
+	void **p[NITEMS];
+	void *q, *r;
+	size_t i;
+
+	tsd = tsd_fetch();
+
+	assert_false(ckh_new(tsd, &ckh, 2, ckh_pointer_hash,
+	    ckh_pointer_keycomp), "Unexpected ckh_new() error");
+
+	for (i = 0; i < NITEMS; i++) {
+		p[i] = mallocx(i+1, 0);
+		assert_ptr_not_null(p[i], "Unexpected mallocx() failure");
+	}
+
+	for (i = 0; i < NITEMS; i++) {
+		size_t j;
+
+		for (j = i; j < NITEMS; j++) {
+			assert_false(ckh_insert(tsd, &ckh, p[j], p[j]),
+			    "Unexpected ckh_insert() failure");
+			assert_false(ckh_search(&ckh, p[j], &q, &r),
+			    "Unexpected ckh_search() failure");
+			assert_ptr_eq(p[j], q, "Key pointer mismatch");
+			assert_ptr_eq(p[j], r, "Value pointer mismatch");
+		}
+
+		assert_zu_eq(ckh_count(&ckh), NITEMS,
+		    "ckh_count() should return %zu, but it returned %zu",
+		    NITEMS, ckh_count(&ckh));
+
+		for (j = i + 1; j < NITEMS; j++) {
+			assert_false(ckh_search(&ckh, p[j], NULL, NULL),
+			    "Unexpected ckh_search() failure");
+			assert_false(ckh_remove(tsd, &ckh, p[j], &q, &r),
+			    "Unexpected ckh_remove() failure");
+			assert_ptr_eq(p[j], q, "Key pointer mismatch");
+			assert_ptr_eq(p[j], r, "Value pointer mismatch");
+			assert_true(ckh_search(&ckh, p[j], NULL, NULL),
+			    "Unexpected ckh_search() success");
+			assert_true(ckh_remove(tsd, &ckh, p[j], &q, &r),
+			    "Unexpected ckh_remove() success");
+		}
+
+		{
+			bool seen[NITEMS];
+			size_t tabind;
+
+			memset(seen, 0, sizeof(seen));
+
+			for (tabind = 0; !ckh_iter(&ckh, &tabind, &q, &r);) {
+				size_t k;
+
+				assert_ptr_eq(q, r, "Key and val not equal");
+
+				for (k = 0; k < NITEMS; k++) {
+					if (p[k] == q) {
+						assert_false(seen[k],
+						    "Item %zu already seen", k);
+						seen[k] = true;
+						break;
+					}
+				}
+			}
+
+			for (j = 0; j < i + 1; j++) {
+				assert_true(seen[j], "Item %zu not seen", j);
+			}
+			for (; j < NITEMS; j++) {
+				assert_false(seen[j], "Item %zu seen", j);
+			}
+		}
+	}
+
+	for (i = 0; i < NITEMS; i++) {
+		assert_false(ckh_search(&ckh, p[i], NULL, NULL),
+		    "Unexpected ckh_search() failure");
+		assert_false(ckh_remove(tsd, &ckh, p[i], &q, &r),
+		    "Unexpected ckh_remove() failure");
+		assert_ptr_eq(p[i], q, "Key pointer mismatch");
+		assert_ptr_eq(p[i], r, "Value pointer mismatch");
+		assert_true(ckh_search(&ckh, p[i], NULL, NULL),
+		    "Unexpected ckh_search() success");
+		assert_true(ckh_remove(tsd, &ckh, p[i], &q, &r),
+		    "Unexpected ckh_remove() success");
+		dallocx(p[i], 0);
+	}
+
+	assert_zu_eq(ckh_count(&ckh), 0,
+	    "ckh_count() should return %zu, but it returned %zu",
+	    ZU(0), ckh_count(&ckh));
+	ckh_delete(tsd, &ckh);
+#undef NITEMS
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_new_delete,
+	    test_count_insert_search_remove,
+	    test_insert_iter_remove);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/decay.c b/redis-stable/deps/jemalloc/test/unit/decay.c
new file mode 100644
index 00000000..f727bf93
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/decay.c
@@ -0,0 +1,599 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/ticker.h"
+
+static nstime_monotonic_t *nstime_monotonic_orig;
+static nstime_update_t *nstime_update_orig;
+
+static unsigned nupdates_mock;
+static nstime_t time_mock;
+static bool monotonic_mock;
+
+static bool
+check_background_thread_enabled(void) {
+	bool enabled;
+	size_t sz = sizeof(bool);
+	int ret = mallctl("background_thread", (void *)&enabled, &sz, NULL,0);
+	if (ret == ENOENT) {
+		return false;
+	}
+	assert_d_eq(ret, 0, "Unexpected mallctl error");
+	return enabled;
+}
+
+static bool
+nstime_monotonic_mock(void) {
+	return monotonic_mock;
+}
+
+static bool
+nstime_update_mock(nstime_t *time) {
+	nupdates_mock++;
+	if (monotonic_mock) {
+		nstime_copy(time, &time_mock);
+	}
+	return !monotonic_mock;
+}
+
+static unsigned
+do_arena_create(ssize_t dirty_decay_ms, ssize_t muzzy_decay_ms) {
+	unsigned arena_ind;
+	size_t sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	size_t mib[3];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+
+	assert_d_eq(mallctlnametomib("arena.0.dirty_decay_ms", mib, &miblen),
+	    0, "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL,
+	    (void *)&dirty_decay_ms, sizeof(dirty_decay_ms)), 0,
+	    "Unexpected mallctlbymib() failure");
+
+	assert_d_eq(mallctlnametomib("arena.0.muzzy_decay_ms", mib, &miblen),
+	    0, "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL,
+	    (void *)&muzzy_decay_ms, sizeof(muzzy_decay_ms)), 0,
+	    "Unexpected mallctlbymib() failure");
+
+	return arena_ind;
+}
+
+static void
+do_arena_destroy(unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.destroy", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+void
+do_epoch(void) {
+	uint64_t epoch = 1;
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+}
+
+void
+do_purge(unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.purge", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+void
+do_decay(unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.decay", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+static uint64_t
+get_arena_npurge_impl(const char *mibname, unsigned arena_ind) {
+	size_t mib[4];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib(mibname, mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[2] = (size_t)arena_ind;
+	uint64_t npurge = 0;
+	size_t sz = sizeof(npurge);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&npurge, &sz, NULL, 0),
+	    config_stats ? 0 : ENOENT, "Unexpected mallctlbymib() failure");
+	return npurge;
+}
+
+static uint64_t
+get_arena_dirty_npurge(unsigned arena_ind) {
+	do_epoch();
+	return get_arena_npurge_impl("stats.arenas.0.dirty_npurge", arena_ind);
+}
+
+static uint64_t
+get_arena_muzzy_npurge(unsigned arena_ind) {
+	do_epoch();
+	return get_arena_npurge_impl("stats.arenas.0.muzzy_npurge", arena_ind);
+}
+
+static uint64_t
+get_arena_npurge(unsigned arena_ind) {
+	do_epoch();
+	return get_arena_npurge_impl("stats.arenas.0.dirty_npurge", arena_ind) +
+	    get_arena_npurge_impl("stats.arenas.0.muzzy_npurge", arena_ind);
+}
+
+static size_t
+get_arena_pdirty(unsigned arena_ind) {
+	do_epoch();
+	size_t mib[4];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("stats.arenas.0.pdirty", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[2] = (size_t)arena_ind;
+	size_t pdirty;
+	size_t sz = sizeof(pdirty);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&pdirty, &sz, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+	return pdirty;
+}
+
+static size_t
+get_arena_pmuzzy(unsigned arena_ind) {
+	do_epoch();
+	size_t mib[4];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("stats.arenas.0.pmuzzy", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[2] = (size_t)arena_ind;
+	size_t pmuzzy;
+	size_t sz = sizeof(pmuzzy);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&pmuzzy, &sz, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+	return pmuzzy;
+}
+
+static void *
+do_mallocx(size_t size, int flags) {
+	void *p = mallocx(size, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	return p;
+}
+
+static void
+generate_dirty(unsigned arena_ind, size_t size) {
+	int flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
+	void *p = do_mallocx(size, flags);
+	dallocx(p, flags);
+}
+
+TEST_BEGIN(test_decay_ticks) {
+	test_skip_if(check_background_thread_enabled());
+
+	ticker_t *decay_ticker;
+	unsigned tick0, tick1, arena_ind;
+	size_t sz, large0;
+	void *p;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
+	    0), 0, "Unexpected mallctl failure");
+
+	/* Set up a manually managed arena for test. */
+	arena_ind = do_arena_create(0, 0);
+
+	/* Migrate to the new arena, and get the ticker. */
+	unsigned old_arena_ind;
+	size_t sz_arena_ind = sizeof(old_arena_ind);
+	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind,
+	    &sz_arena_ind, (void *)&arena_ind, sizeof(arena_ind)), 0,
+	    "Unexpected mallctl() failure");
+	decay_ticker = decay_ticker_get(tsd_fetch(), arena_ind);
+	assert_ptr_not_null(decay_ticker,
+	    "Unexpected failure getting decay ticker");
+
+	/*
+	 * Test the standard APIs using a large size class, since we can't
+	 * control tcache interactions for small size classes (except by
+	 * completely disabling tcache for the entire test program).
+	 */
+
+	/* malloc(). */
+	tick0 = ticker_read(decay_ticker);
+	p = malloc(large0);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during malloc()");
+	/* free(). */
+	tick0 = ticker_read(decay_ticker);
+	free(p);
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during free()");
+
+	/* calloc(). */
+	tick0 = ticker_read(decay_ticker);
+	p = calloc(1, large0);
+	assert_ptr_not_null(p, "Unexpected calloc() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during calloc()");
+	free(p);
+
+	/* posix_memalign(). */
+	tick0 = ticker_read(decay_ticker);
+	assert_d_eq(posix_memalign(&p, sizeof(size_t), large0), 0,
+	    "Unexpected posix_memalign() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0,
+	    "Expected ticker to tick during posix_memalign()");
+	free(p);
+
+	/* aligned_alloc(). */
+	tick0 = ticker_read(decay_ticker);
+	p = aligned_alloc(sizeof(size_t), large0);
+	assert_ptr_not_null(p, "Unexpected aligned_alloc() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0,
+	    "Expected ticker to tick during aligned_alloc()");
+	free(p);
+
+	/* realloc(). */
+	/* Allocate. */
+	tick0 = ticker_read(decay_ticker);
+	p = realloc(NULL, large0);
+	assert_ptr_not_null(p, "Unexpected realloc() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
+	/* Reallocate. */
+	tick0 = ticker_read(decay_ticker);
+	p = realloc(p, large0);
+	assert_ptr_not_null(p, "Unexpected realloc() failure");
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
+	/* Deallocate. */
+	tick0 = ticker_read(decay_ticker);
+	realloc(p, 0);
+	tick1 = ticker_read(decay_ticker);
+	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
+
+	/*
+	 * Test the *allocx() APIs using large and small size classes, with
+	 * tcache explicitly disabled.
+	 */
+	{
+		unsigned i;
+		size_t allocx_sizes[2];
+		allocx_sizes[0] = large0;
+		allocx_sizes[1] = 1;
+
+		for (i = 0; i < sizeof(allocx_sizes) / sizeof(size_t); i++) {
+			sz = allocx_sizes[i];
+
+			/* mallocx(). */
+			tick0 = ticker_read(decay_ticker);
+			p = mallocx(sz, MALLOCX_TCACHE_NONE);
+			assert_ptr_not_null(p, "Unexpected mallocx() failure");
+			tick1 = ticker_read(decay_ticker);
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during mallocx() (sz=%zu)",
+			    sz);
+			/* rallocx(). */
+			tick0 = ticker_read(decay_ticker);
+			p = rallocx(p, sz, MALLOCX_TCACHE_NONE);
+			assert_ptr_not_null(p, "Unexpected rallocx() failure");
+			tick1 = ticker_read(decay_ticker);
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during rallocx() (sz=%zu)",
+			    sz);
+			/* xallocx(). */
+			tick0 = ticker_read(decay_ticker);
+			xallocx(p, sz, 0, MALLOCX_TCACHE_NONE);
+			tick1 = ticker_read(decay_ticker);
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during xallocx() (sz=%zu)",
+			    sz);
+			/* dallocx(). */
+			tick0 = ticker_read(decay_ticker);
+			dallocx(p, MALLOCX_TCACHE_NONE);
+			tick1 = ticker_read(decay_ticker);
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during dallocx() (sz=%zu)",
+			    sz);
+			/* sdallocx(). */
+			p = mallocx(sz, MALLOCX_TCACHE_NONE);
+			assert_ptr_not_null(p, "Unexpected mallocx() failure");
+			tick0 = ticker_read(decay_ticker);
+			sdallocx(p, sz, MALLOCX_TCACHE_NONE);
+			tick1 = ticker_read(decay_ticker);
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during sdallocx() "
+			    "(sz=%zu)", sz);
+		}
+	}
+
+	/*
+	 * Test tcache fill/flush interactions for large and small size classes,
+	 * using an explicit tcache.
+	 */
+	unsigned tcache_ind, i;
+	size_t tcache_sizes[2];
+	tcache_sizes[0] = large0;
+	tcache_sizes[1] = 1;
+
+	size_t tcache_max, sz_tcache_max;
+	sz_tcache_max = sizeof(tcache_max);
+	assert_d_eq(mallctl("arenas.tcache_max", (void *)&tcache_max,
+	    &sz_tcache_max, NULL, 0), 0, "Unexpected mallctl() failure");
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("tcache.create", (void *)&tcache_ind, &sz,
+	    NULL, 0), 0, "Unexpected mallctl failure");
+
+	for (i = 0; i < sizeof(tcache_sizes) / sizeof(size_t); i++) {
+		sz = tcache_sizes[i];
+
+		/* tcache fill. */
+		tick0 = ticker_read(decay_ticker);
+		p = mallocx(sz, MALLOCX_TCACHE(tcache_ind));
+		assert_ptr_not_null(p, "Unexpected mallocx() failure");
+		tick1 = ticker_read(decay_ticker);
+		assert_u32_ne(tick1, tick0,
+		    "Expected ticker to tick during tcache fill "
+		    "(sz=%zu)", sz);
+		/* tcache flush. */
+		dallocx(p, MALLOCX_TCACHE(tcache_ind));
+		tick0 = ticker_read(decay_ticker);
+		assert_d_eq(mallctl("tcache.flush", NULL, NULL,
+		    (void *)&tcache_ind, sizeof(unsigned)), 0,
+		    "Unexpected mallctl failure");
+		tick1 = ticker_read(decay_ticker);
+
+		/* Will only tick if it's in tcache. */
+		if (sz <= tcache_max) {
+			assert_u32_ne(tick1, tick0,
+			    "Expected ticker to tick during tcache "
+			    "flush (sz=%zu)", sz);
+		} else {
+			assert_u32_eq(tick1, tick0,
+			    "Unexpected ticker tick during tcache "
+			    "flush (sz=%zu)", sz);
+		}
+	}
+}
+TEST_END
+
+static void
+decay_ticker_helper(unsigned arena_ind, int flags, bool dirty, ssize_t dt,
+    uint64_t dirty_npurge0, uint64_t muzzy_npurge0, bool terminate_asap) {
+#define NINTERVALS 101
+	nstime_t time, update_interval, decay_ms, deadline;
+
+	nstime_init(&time, 0);
+	nstime_update(&time);
+
+	nstime_init2(&decay_ms, dt, 0);
+	nstime_copy(&deadline, &time);
+	nstime_add(&deadline, &decay_ms);
+
+	nstime_init2(&update_interval, dt, 0);
+	nstime_idivide(&update_interval, NINTERVALS);
+
+	/*
+	 * Keep q's slab from being deallocated during the looping below.  If a
+	 * cached slab were to repeatedly come and go during looping, it could
+	 * prevent the decay backlog ever becoming empty.
+	 */
+	void *p = do_mallocx(1, flags);
+	uint64_t dirty_npurge1, muzzy_npurge1;
+	do {
+		for (unsigned i = 0; i < DECAY_NTICKS_PER_UPDATE / 2;
+		    i++) {
+			void *q = do_mallocx(1, flags);
+			dallocx(q, flags);
+		}
+		dirty_npurge1 = get_arena_dirty_npurge(arena_ind);
+		muzzy_npurge1 = get_arena_muzzy_npurge(arena_ind);
+
+		nstime_add(&time_mock, &update_interval);
+		nstime_update(&time);
+	} while (nstime_compare(&time, &deadline) <= 0 && ((dirty_npurge1 ==
+	    dirty_npurge0 && muzzy_npurge1 == muzzy_npurge0) ||
+	    !terminate_asap));
+	dallocx(p, flags);
+
+	if (config_stats) {
+		assert_u64_gt(dirty_npurge1 + muzzy_npurge1, dirty_npurge0 +
+		    muzzy_npurge0, "Expected purging to occur");
+	}
+#undef NINTERVALS
+}
+
+TEST_BEGIN(test_decay_ticker) {
+	test_skip_if(check_background_thread_enabled());
+#define NPS 2048
+	ssize_t ddt = opt_dirty_decay_ms;
+	ssize_t mdt = opt_muzzy_decay_ms;
+	unsigned arena_ind = do_arena_create(ddt, mdt);
+	int flags = (MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE);
+	void *ps[NPS];
+	size_t large;
+
+	/*
+	 * Allocate a bunch of large objects, pause the clock, deallocate every
+	 * other object (to fragment virtual memory), restore the clock, then
+	 * [md]allocx() in a tight loop while advancing time rapidly to verify
+	 * the ticker triggers purging.
+	 */
+
+	size_t tcache_max;
+	size_t sz = sizeof(size_t);
+	assert_d_eq(mallctl("arenas.tcache_max", (void *)&tcache_max, &sz, NULL,
+	    0), 0, "Unexpected mallctl failure");
+	large = nallocx(tcache_max + 1, flags);
+
+	do_purge(arena_ind);
+	uint64_t dirty_npurge0 = get_arena_dirty_npurge(arena_ind);
+	uint64_t muzzy_npurge0 = get_arena_muzzy_npurge(arena_ind);
+
+	for (unsigned i = 0; i < NPS; i++) {
+		ps[i] = do_mallocx(large, flags);
+	}
+
+	nupdates_mock = 0;
+	nstime_init(&time_mock, 0);
+	nstime_update(&time_mock);
+	monotonic_mock = true;
+
+	nstime_monotonic_orig = nstime_monotonic;
+	nstime_update_orig = nstime_update;
+	nstime_monotonic = nstime_monotonic_mock;
+	nstime_update = nstime_update_mock;
+
+	for (unsigned i = 0; i < NPS; i += 2) {
+		dallocx(ps[i], flags);
+		unsigned nupdates0 = nupdates_mock;
+		do_decay(arena_ind);
+		assert_u_gt(nupdates_mock, nupdates0,
+		    "Expected nstime_update() to be called");
+	}
+
+	decay_ticker_helper(arena_ind, flags, true, ddt, dirty_npurge0,
+	    muzzy_npurge0, true);
+	decay_ticker_helper(arena_ind, flags, false, ddt+mdt, dirty_npurge0,
+	    muzzy_npurge0, false);
+
+	do_arena_destroy(arena_ind);
+
+	nstime_monotonic = nstime_monotonic_orig;
+	nstime_update = nstime_update_orig;
+#undef NPS
+}
+TEST_END
+
+TEST_BEGIN(test_decay_nonmonotonic) {
+	test_skip_if(check_background_thread_enabled());
+#define NPS (SMOOTHSTEP_NSTEPS + 1)
+	int flags = (MALLOCX_ARENA(0) | MALLOCX_TCACHE_NONE);
+	void *ps[NPS];
+	uint64_t npurge0 = 0;
+	uint64_t npurge1 = 0;
+	size_t sz, large0;
+	unsigned i, nupdates0;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
+	    0), 0, "Unexpected mallctl failure");
+
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl failure");
+	do_epoch();
+	sz = sizeof(uint64_t);
+	npurge0 = get_arena_npurge(0);
+
+	nupdates_mock = 0;
+	nstime_init(&time_mock, 0);
+	nstime_update(&time_mock);
+	monotonic_mock = false;
+
+	nstime_monotonic_orig = nstime_monotonic;
+	nstime_update_orig = nstime_update;
+	nstime_monotonic = nstime_monotonic_mock;
+	nstime_update = nstime_update_mock;
+
+	for (i = 0; i < NPS; i++) {
+		ps[i] = mallocx(large0, flags);
+		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure");
+	}
+
+	for (i = 0; i < NPS; i++) {
+		dallocx(ps[i], flags);
+		nupdates0 = nupdates_mock;
+		assert_d_eq(mallctl("arena.0.decay", NULL, NULL, NULL, 0), 0,
+		    "Unexpected arena.0.decay failure");
+		assert_u_gt(nupdates_mock, nupdates0,
+		    "Expected nstime_update() to be called");
+	}
+
+	do_epoch();
+	sz = sizeof(uint64_t);
+	npurge1 = get_arena_npurge(0);
+
+	if (config_stats) {
+		assert_u64_eq(npurge0, npurge1, "Unexpected purging occurred");
+	}
+
+	nstime_monotonic = nstime_monotonic_orig;
+	nstime_update = nstime_update_orig;
+#undef NPS
+}
+TEST_END
+
+TEST_BEGIN(test_decay_now) {
+	test_skip_if(check_background_thread_enabled());
+
+	unsigned arena_ind = do_arena_create(0, 0);
+	assert_zu_eq(get_arena_pdirty(arena_ind), 0, "Unexpected dirty pages");
+	assert_zu_eq(get_arena_pmuzzy(arena_ind), 0, "Unexpected muzzy pages");
+	size_t sizes[] = {16, PAGE<<2, HUGEPAGE<<2};
+	/* Verify that dirty/muzzy pages never linger after deallocation. */
+	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
+		size_t size = sizes[i];
+		generate_dirty(arena_ind, size);
+		assert_zu_eq(get_arena_pdirty(arena_ind), 0,
+		    "Unexpected dirty pages");
+		assert_zu_eq(get_arena_pmuzzy(arena_ind), 0,
+		    "Unexpected muzzy pages");
+	}
+	do_arena_destroy(arena_ind);
+}
+TEST_END
+
+TEST_BEGIN(test_decay_never) {
+	test_skip_if(check_background_thread_enabled());
+
+	unsigned arena_ind = do_arena_create(-1, -1);
+	int flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
+	assert_zu_eq(get_arena_pdirty(arena_ind), 0, "Unexpected dirty pages");
+	assert_zu_eq(get_arena_pmuzzy(arena_ind), 0, "Unexpected muzzy pages");
+	size_t sizes[] = {16, PAGE<<2, HUGEPAGE<<2};
+	void *ptrs[sizeof(sizes)/sizeof(size_t)];
+	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
+		ptrs[i] = do_mallocx(sizes[i], flags);
+	}
+	/* Verify that each deallocation generates additional dirty pages. */
+	size_t pdirty_prev = get_arena_pdirty(arena_ind);
+	size_t pmuzzy_prev = get_arena_pmuzzy(arena_ind);
+	assert_zu_eq(pdirty_prev, 0, "Unexpected dirty pages");
+	assert_zu_eq(pmuzzy_prev, 0, "Unexpected muzzy pages");
+	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
+		dallocx(ptrs[i], flags);
+		size_t pdirty = get_arena_pdirty(arena_ind);
+		size_t pmuzzy = get_arena_pmuzzy(arena_ind);
+		assert_zu_gt(pdirty, pdirty_prev,
+		    "Expected dirty pages to increase.");
+		assert_zu_eq(pmuzzy, 0, "Unexpected muzzy pages");
+		pdirty_prev = pdirty;
+	}
+	do_arena_destroy(arena_ind);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_decay_ticks,
+	    test_decay_ticker,
+	    test_decay_nonmonotonic,
+	    test_decay_now,
+	    test_decay_never);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/decay.sh b/redis-stable/deps/jemalloc/test/unit/decay.sh
new file mode 100644
index 00000000..45aeccf4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/decay.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+export MALLOC_CONF="dirty_decay_ms:1000,muzzy_decay_ms:1000,lg_tcache_max:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/div.c b/redis-stable/deps/jemalloc/test/unit/div.c
new file mode 100644
index 00000000..b47f10b2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/div.c
@@ -0,0 +1,29 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/div.h"
+
+TEST_BEGIN(test_div_exhaustive) {
+	for (size_t divisor = 2; divisor < 1000 * 1000; ++divisor) {
+		div_info_t div_info;
+		div_init(&div_info, divisor);
+		size_t max = 1000 * divisor;
+		if (max < 1000 * 1000) {
+			max = 1000 * 1000;
+		}
+		for (size_t dividend = 0; dividend < 1000 * divisor;
+		    dividend += divisor) {
+			size_t quotient = div_compute(
+			    &div_info, dividend);
+			assert_zu_eq(dividend, quotient * divisor,
+			    "With divisor = %zu, dividend = %zu, "
+			    "got quotient %zu", divisor, dividend, quotient);
+		}
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_div_exhaustive);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/emitter.c b/redis-stable/deps/jemalloc/test/unit/emitter.c
new file mode 100644
index 00000000..535c7cf1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/emitter.c
@@ -0,0 +1,413 @@
+#include "test/jemalloc_test.h"
+#include "jemalloc/internal/emitter.h"
+
+/*
+ * This is so useful for debugging and feature work, we'll leave printing
+ * functionality committed but disabled by default.
+ */
+/* Print the text as it will appear. */
+static bool print_raw = false;
+/* Print the text escaped, so it can be copied back into the test case. */
+static bool print_escaped = false;
+
+typedef struct buf_descriptor_s buf_descriptor_t;
+struct buf_descriptor_s {
+	char *buf;
+	size_t len;
+	bool mid_quote;
+};
+
+/*
+ * Forwards all writes to the passed-in buf_v (which should be cast from a
+ * buf_descriptor_t *).
+ */
+static void
+forwarding_cb(void *buf_descriptor_v, const char *str) {
+	buf_descriptor_t *buf_descriptor = (buf_descriptor_t *)buf_descriptor_v;
+
+	if (print_raw) {
+		malloc_printf("%s", str);
+	}
+	if (print_escaped) {
+		const char *it = str;
+		while (*it != '\0') {
+			if (!buf_descriptor->mid_quote) {
+				malloc_printf("\"");
+				buf_descriptor->mid_quote = true;
+			}
+			switch (*it) {
+			case '\\':
+				malloc_printf("\\");
+				break;
+			case '\"':
+				malloc_printf("\\\"");
+				break;
+			case '\t':
+				malloc_printf("\\t");
+				break;
+			case '\n':
+				malloc_printf("\\n\"\n");
+				buf_descriptor->mid_quote = false;
+				break;
+			default:
+				malloc_printf("%c", *it);
+			}
+			it++;
+		}
+	}
+
+	size_t written = malloc_snprintf(buf_descriptor->buf,
+	    buf_descriptor->len, "%s", str);
+	assert_zu_eq(written, strlen(str), "Buffer overflow!");
+	buf_descriptor->buf += written;
+	buf_descriptor->len -= written;
+	assert_zu_gt(buf_descriptor->len, 0, "Buffer out of space!");
+}
+
+static void
+assert_emit_output(void (*emit_fn)(emitter_t *),
+    const char *expected_json_output, const char *expected_table_output) {
+	emitter_t emitter;
+	char buf[MALLOC_PRINTF_BUFSIZE];
+	buf_descriptor_t buf_descriptor;
+
+	buf_descriptor.buf = buf;
+	buf_descriptor.len = MALLOC_PRINTF_BUFSIZE;
+	buf_descriptor.mid_quote = false;
+
+	emitter_init(&emitter, emitter_output_json, &forwarding_cb,
+	    &buf_descriptor);
+	(*emit_fn)(&emitter);
+	assert_str_eq(expected_json_output, buf, "json output failure");
+
+	buf_descriptor.buf = buf;
+	buf_descriptor.len = MALLOC_PRINTF_BUFSIZE;
+	buf_descriptor.mid_quote = false;
+
+	emitter_init(&emitter, emitter_output_table, &forwarding_cb,
+	    &buf_descriptor);
+	(*emit_fn)(&emitter);
+	assert_str_eq(expected_table_output, buf, "table output failure");
+}
+
+static void
+emit_dict(emitter_t *emitter) {
+	bool b_false = false;
+	bool b_true = true;
+	int i_123 = 123;
+	const char *str = "a string";
+
+	emitter_begin(emitter);
+	emitter_dict_begin(emitter, "foo", "This is the foo table:");
+	emitter_kv(emitter, "abc", "ABC", emitter_type_bool, &b_false);
+	emitter_kv(emitter, "def", "DEF", emitter_type_bool, &b_true);
+	emitter_kv_note(emitter, "ghi", "GHI", emitter_type_int, &i_123,
+	    "note_key1", emitter_type_string, &str);
+	emitter_kv_note(emitter, "jkl", "JKL", emitter_type_string, &str,
+	    "note_key2", emitter_type_bool, &b_false);
+	emitter_dict_end(emitter);
+	emitter_end(emitter);
+}
+static const char *dict_json =
+"{\n"
+"\t\"foo\": {\n"
+"\t\t\"abc\": false,\n"
+"\t\t\"def\": true,\n"
+"\t\t\"ghi\": 123,\n"
+"\t\t\"jkl\": \"a string\"\n"
+"\t}\n"
+"}\n";
+static const char *dict_table =
+"This is the foo table:\n"
+"  ABC: false\n"
+"  DEF: true\n"
+"  GHI: 123 (note_key1: \"a string\")\n"
+"  JKL: \"a string\" (note_key2: false)\n";
+
+TEST_BEGIN(test_dict) {
+	assert_emit_output(&emit_dict, dict_json, dict_table);
+}
+TEST_END
+
+static void
+emit_table_printf(emitter_t *emitter) {
+	emitter_begin(emitter);
+	emitter_table_printf(emitter, "Table note 1\n");
+	emitter_table_printf(emitter, "Table note 2 %s\n",
+	    "with format string");
+	emitter_end(emitter);
+}
+
+static const char *table_printf_json =
+"{\n"
+"}\n";
+
+static const char *table_printf_table =
+"Table note 1\n"
+"Table note 2 with format string\n";
+
+TEST_BEGIN(test_table_printf) {
+	assert_emit_output(&emit_table_printf, table_printf_json,
+	    table_printf_table);
+}
+TEST_END
+
+static void emit_nested_dict(emitter_t *emitter) {
+	int val = 123;
+	emitter_begin(emitter);
+	emitter_dict_begin(emitter, "json1", "Dict 1");
+	emitter_dict_begin(emitter, "json2", "Dict 2");
+	emitter_kv(emitter, "primitive", "A primitive", emitter_type_int, &val);
+	emitter_dict_end(emitter); /* Close 2 */
+	emitter_dict_begin(emitter, "json3", "Dict 3");
+	emitter_dict_end(emitter); /* Close 3 */
+	emitter_dict_end(emitter); /* Close 1 */
+	emitter_dict_begin(emitter, "json4", "Dict 4");
+	emitter_kv(emitter, "primitive", "Another primitive",
+	    emitter_type_int, &val);
+	emitter_dict_end(emitter); /* Close 4 */
+	emitter_end(emitter);
+}
+
+static const char *nested_dict_json =
+"{\n"
+"\t\"json1\": {\n"
+"\t\t\"json2\": {\n"
+"\t\t\t\"primitive\": 123\n"
+"\t\t},\n"
+"\t\t\"json3\": {\n"
+"\t\t}\n"
+"\t},\n"
+"\t\"json4\": {\n"
+"\t\t\"primitive\": 123\n"
+"\t}\n"
+"}\n";
+
+static const char *nested_dict_table =
+"Dict 1\n"
+"  Dict 2\n"
+"    A primitive: 123\n"
+"  Dict 3\n"
+"Dict 4\n"
+"  Another primitive: 123\n";
+
+TEST_BEGIN(test_nested_dict) {
+	assert_emit_output(&emit_nested_dict, nested_dict_json,
+	    nested_dict_table);
+}
+TEST_END
+
+static void
+emit_types(emitter_t *emitter) {
+	bool b = false;
+	int i = -123;
+	unsigned u = 123;
+	ssize_t zd = -456;
+	size_t zu = 456;
+	const char *str = "string";
+	uint32_t u32 = 789;
+	uint64_t u64 = 10000000000ULL;
+
+	emitter_begin(emitter);
+	emitter_kv(emitter, "k1", "K1", emitter_type_bool, &b);
+	emitter_kv(emitter, "k2", "K2", emitter_type_int, &i);
+	emitter_kv(emitter, "k3", "K3", emitter_type_unsigned, &u);
+	emitter_kv(emitter, "k4", "K4", emitter_type_ssize, &zd);
+	emitter_kv(emitter, "k5", "K5", emitter_type_size, &zu);
+	emitter_kv(emitter, "k6", "K6", emitter_type_string, &str);
+	emitter_kv(emitter, "k7", "K7", emitter_type_uint32, &u32);
+	emitter_kv(emitter, "k8", "K8", emitter_type_uint64, &u64);
+	/*
+	 * We don't test the title type, since it's only used for tables.  It's
+	 * tested in the emitter_table_row tests.
+	 */
+	emitter_end(emitter);
+}
+
+static const char *types_json =
+"{\n"
+"\t\"k1\": false,\n"
+"\t\"k2\": -123,\n"
+"\t\"k3\": 123,\n"
+"\t\"k4\": -456,\n"
+"\t\"k5\": 456,\n"
+"\t\"k6\": \"string\",\n"
+"\t\"k7\": 789,\n"
+"\t\"k8\": 10000000000\n"
+"}\n";
+
+static const char *types_table =
+"K1: false\n"
+"K2: -123\n"
+"K3: 123\n"
+"K4: -456\n"
+"K5: 456\n"
+"K6: \"string\"\n"
+"K7: 789\n"
+"K8: 10000000000\n";
+
+TEST_BEGIN(test_types) {
+	assert_emit_output(&emit_types, types_json, types_table);
+}
+TEST_END
+
+static void
+emit_modal(emitter_t *emitter) {
+	int val = 123;
+	emitter_begin(emitter);
+	emitter_dict_begin(emitter, "j0", "T0");
+	emitter_json_dict_begin(emitter, "j1");
+	emitter_kv(emitter, "i1", "I1", emitter_type_int, &val);
+	emitter_json_kv(emitter, "i2", emitter_type_int, &val);
+	emitter_table_kv(emitter, "I3", emitter_type_int, &val);
+	emitter_table_dict_begin(emitter, "T1");
+	emitter_kv(emitter, "i4", "I4", emitter_type_int, &val);
+	emitter_json_dict_end(emitter); /* Close j1 */
+	emitter_kv(emitter, "i5", "I5", emitter_type_int, &val);
+	emitter_table_dict_end(emitter); /* Close T1 */
+	emitter_kv(emitter, "i6", "I6", emitter_type_int, &val);
+	emitter_dict_end(emitter); /* Close j0 / T0 */
+	emitter_end(emitter);
+}
+
+const char *modal_json =
+"{\n"
+"\t\"j0\": {\n"
+"\t\t\"j1\": {\n"
+"\t\t\t\"i1\": 123,\n"
+"\t\t\t\"i2\": 123,\n"
+"\t\t\t\"i4\": 123\n"
+"\t\t},\n"
+"\t\t\"i5\": 123,\n"
+"\t\t\"i6\": 123\n"
+"\t}\n"
+"}\n";
+
+const char *modal_table =
+"T0\n"
+"  I1: 123\n"
+"  I3: 123\n"
+"  T1\n"
+"    I4: 123\n"
+"    I5: 123\n"
+"  I6: 123\n";
+
+TEST_BEGIN(test_modal) {
+	assert_emit_output(&emit_modal, modal_json, modal_table);
+}
+TEST_END
+
+static void
+emit_json_arr(emitter_t *emitter) {
+	int ival = 123;
+
+	emitter_begin(emitter);
+	emitter_json_dict_begin(emitter, "dict");
+	emitter_json_arr_begin(emitter, "arr");
+	emitter_json_arr_obj_begin(emitter);
+	emitter_json_kv(emitter, "foo", emitter_type_int, &ival);
+	emitter_json_arr_obj_end(emitter); /* Close arr[0] */
+	/* arr[1] and arr[2] are primitives. */
+	emitter_json_arr_value(emitter, emitter_type_int, &ival);
+	emitter_json_arr_value(emitter, emitter_type_int, &ival);
+	emitter_json_arr_obj_begin(emitter);
+	emitter_json_kv(emitter, "bar", emitter_type_int, &ival);
+	emitter_json_kv(emitter, "baz", emitter_type_int, &ival);
+	emitter_json_arr_obj_end(emitter); /* Close arr[3]. */
+	emitter_json_arr_end(emitter); /* Close arr. */
+	emitter_json_dict_end(emitter); /* Close dict. */
+	emitter_end(emitter);
+}
+
+static const char *json_arr_json =
+"{\n"
+"\t\"dict\": {\n"
+"\t\t\"arr\": [\n"
+"\t\t\t{\n"
+"\t\t\t\t\"foo\": 123\n"
+"\t\t\t},\n"
+"\t\t\t123,\n"
+"\t\t\t123,\n"
+"\t\t\t{\n"
+"\t\t\t\t\"bar\": 123,\n"
+"\t\t\t\t\"baz\": 123\n"
+"\t\t\t}\n"
+"\t\t]\n"
+"\t}\n"
+"}\n";
+
+static const char *json_arr_table = "";
+
+TEST_BEGIN(test_json_arr) {
+	assert_emit_output(&emit_json_arr, json_arr_json, json_arr_table);
+}
+TEST_END
+
+static void
+emit_table_row(emitter_t *emitter) {
+	emitter_begin(emitter);
+	emitter_row_t row;
+	emitter_col_t abc = {emitter_justify_left, 10, emitter_type_title};
+	abc.str_val = "ABC title";
+	emitter_col_t def = {emitter_justify_right, 15, emitter_type_title};
+	def.str_val = "DEF title";
+	emitter_col_t ghi = {emitter_justify_right, 5, emitter_type_title};
+	ghi.str_val = "GHI";
+
+	emitter_row_init(&row);
+	emitter_col_init(&abc, &row);
+	emitter_col_init(&def, &row);
+	emitter_col_init(&ghi, &row);
+
+	emitter_table_row(emitter, &row);
+
+	abc.type = emitter_type_int;
+	def.type = emitter_type_bool;
+	ghi.type = emitter_type_int;
+
+	abc.int_val = 123;
+	def.bool_val = true;
+	ghi.int_val = 456;
+	emitter_table_row(emitter, &row);
+
+	abc.int_val = 789;
+	def.bool_val = false;
+	ghi.int_val = 1011;
+	emitter_table_row(emitter, &row);
+
+	abc.type = emitter_type_string;
+	abc.str_val = "a string";
+	def.bool_val = false;
+	ghi.type = emitter_type_title;
+	ghi.str_val = "ghi";
+	emitter_table_row(emitter, &row);
+
+	emitter_end(emitter);
+}
+
+static const char *table_row_json =
+"{\n"
+"}\n";
+
+static const char *table_row_table =
+"ABC title       DEF title  GHI\n"
+"123                  true  456\n"
+"789                 false 1011\n"
+"\"a string\"          false  ghi\n";
+
+TEST_BEGIN(test_table_row) {
+	assert_emit_output(&emit_table_row, table_row_json, table_row_table);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_dict,
+	    test_table_printf,
+	    test_nested_dict,
+	    test_types,
+	    test_modal,
+	    test_json_arr,
+	    test_table_row);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/extent_quantize.c b/redis-stable/deps/jemalloc/test/unit/extent_quantize.c
new file mode 100644
index 00000000..0ca7a75d
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/extent_quantize.c
@@ -0,0 +1,141 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_small_extent_size) {
+	unsigned nbins, i;
+	size_t sz, extent_size;
+	size_t mib[4];
+	size_t miblen = sizeof(mib) / sizeof(size_t);
+
+	/*
+	 * Iterate over all small size classes, get their extent sizes, and
+	 * verify that the quantized size is the same as the extent size.
+	 */
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &sz, NULL, 0), 0,
+	    "Unexpected mallctl failure");
+
+	assert_d_eq(mallctlnametomib("arenas.bin.0.slab_size", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib failure");
+	for (i = 0; i < nbins; i++) {
+		mib[2] = i;
+		sz = sizeof(size_t);
+		assert_d_eq(mallctlbymib(mib, miblen, (void *)&extent_size, &sz,
+		    NULL, 0), 0, "Unexpected mallctlbymib failure");
+		assert_zu_eq(extent_size,
+		    extent_size_quantize_floor(extent_size),
+		    "Small extent quantization should be a no-op "
+		    "(extent_size=%zu)", extent_size);
+		assert_zu_eq(extent_size,
+		    extent_size_quantize_ceil(extent_size),
+		    "Small extent quantization should be a no-op "
+		    "(extent_size=%zu)", extent_size);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_large_extent_size) {
+	bool cache_oblivious;
+	unsigned nlextents, i;
+	size_t sz, extent_size_prev, ceil_prev;
+	size_t mib[4];
+	size_t miblen = sizeof(mib) / sizeof(size_t);
+
+	/*
+	 * Iterate over all large size classes, get their extent sizes, and
+	 * verify that the quantized size is the same as the extent size.
+	 */
+
+	sz = sizeof(bool);
+	assert_d_eq(mallctl("config.cache_oblivious", (void *)&cache_oblivious,
+	    &sz, NULL, 0), 0, "Unexpected mallctl failure");
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
+	    0), 0, "Unexpected mallctl failure");
+
+	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib failure");
+	for (i = 0; i < nlextents; i++) {
+		size_t lextent_size, extent_size, floor, ceil;
+
+		mib[2] = i;
+		sz = sizeof(size_t);
+		assert_d_eq(mallctlbymib(mib, miblen, (void *)&lextent_size,
+		    &sz, NULL, 0), 0, "Unexpected mallctlbymib failure");
+		extent_size = cache_oblivious ? lextent_size + PAGE :
+		    lextent_size;
+		floor = extent_size_quantize_floor(extent_size);
+		ceil = extent_size_quantize_ceil(extent_size);
+
+		assert_zu_eq(extent_size, floor,
+		    "Extent quantization should be a no-op for precise size "
+		    "(lextent_size=%zu, extent_size=%zu)", lextent_size,
+		    extent_size);
+		assert_zu_eq(extent_size, ceil,
+		    "Extent quantization should be a no-op for precise size "
+		    "(lextent_size=%zu, extent_size=%zu)", lextent_size,
+		    extent_size);
+
+		if (i > 0) {
+			assert_zu_eq(extent_size_prev,
+			    extent_size_quantize_floor(extent_size - PAGE),
+			    "Floor should be a precise size");
+			if (extent_size_prev < ceil_prev) {
+				assert_zu_eq(ceil_prev, extent_size,
+				    "Ceiling should be a precise size "
+				    "(extent_size_prev=%zu, ceil_prev=%zu, "
+				    "extent_size=%zu)", extent_size_prev,
+				    ceil_prev, extent_size);
+			}
+		}
+		if (i + 1 < nlextents) {
+			extent_size_prev = floor;
+			ceil_prev = extent_size_quantize_ceil(extent_size +
+			    PAGE);
+		}
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_monotonic) {
+#define SZ_MAX	ZU(4 * 1024 * 1024)
+	unsigned i;
+	size_t floor_prev, ceil_prev;
+
+	floor_prev = 0;
+	ceil_prev = 0;
+	for (i = 1; i <= SZ_MAX >> LG_PAGE; i++) {
+		size_t extent_size, floor, ceil;
+
+		extent_size = i << LG_PAGE;
+		floor = extent_size_quantize_floor(extent_size);
+		ceil = extent_size_quantize_ceil(extent_size);
+
+		assert_zu_le(floor, extent_size,
+		    "Floor should be <= (floor=%zu, extent_size=%zu, ceil=%zu)",
+		    floor, extent_size, ceil);
+		assert_zu_ge(ceil, extent_size,
+		    "Ceiling should be >= (floor=%zu, extent_size=%zu, "
+		    "ceil=%zu)", floor, extent_size, ceil);
+
+		assert_zu_le(floor_prev, floor, "Floor should be monotonic "
+		    "(floor_prev=%zu, floor=%zu, extent_size=%zu, ceil=%zu)",
+		    floor_prev, floor, extent_size, ceil);
+		assert_zu_le(ceil_prev, ceil, "Ceiling should be monotonic "
+		    "(floor=%zu, extent_size=%zu, ceil_prev=%zu, ceil=%zu)",
+		    floor, extent_size, ceil_prev, ceil);
+
+		floor_prev = floor;
+		ceil_prev = ceil;
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_small_extent_size,
+	    test_large_extent_size,
+	    test_monotonic);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/fork.c b/redis-stable/deps/jemalloc/test/unit/fork.c
new file mode 100644
index 00000000..b1690750
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/fork.c
@@ -0,0 +1,141 @@
+#include "test/jemalloc_test.h"
+
+#ifndef _WIN32
+#include <sys/wait.h>
+#endif
+
+#ifndef _WIN32
+static void
+wait_for_child_exit(int pid) {
+	int status;
+	while (true) {
+		if (waitpid(pid, &status, 0) == -1) {
+			test_fail("Unexpected waitpid() failure.");
+		}
+		if (WIFSIGNALED(status)) {
+			test_fail("Unexpected child termination due to "
+			    "signal %d", WTERMSIG(status));
+			break;
+		}
+		if (WIFEXITED(status)) {
+			if (WEXITSTATUS(status) != 0) {
+				test_fail("Unexpected child exit value %d",
+				    WEXITSTATUS(status));
+			}
+			break;
+		}
+	}
+}
+#endif
+
+TEST_BEGIN(test_fork) {
+#ifndef _WIN32
+	void *p;
+	pid_t pid;
+
+	/* Set up a manually managed arena for test. */
+	unsigned arena_ind;
+	size_t sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+
+	/* Migrate to the new arena. */
+	unsigned old_arena_ind;
+	sz = sizeof(old_arena_ind);
+	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
+	    (void *)&arena_ind, sizeof(arena_ind)), 0,
+	    "Unexpected mallctl() failure");
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+
+	pid = fork();
+
+	free(p);
+
+	p = malloc(64);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+	free(p);
+
+	if (pid == -1) {
+		/* Error. */
+		test_fail("Unexpected fork() failure");
+	} else if (pid == 0) {
+		/* Child. */
+		_exit(0);
+	} else {
+		wait_for_child_exit(pid);
+	}
+#else
+	test_skip("fork(2) is irrelevant to Windows");
+#endif
+}
+TEST_END
+
+#ifndef _WIN32
+static void *
+do_fork_thd(void *arg) {
+	malloc(1);
+	int pid = fork();
+	if (pid == -1) {
+		/* Error. */
+		test_fail("Unexpected fork() failure");
+	} else if (pid == 0) {
+		/* Child. */
+		char *args[] = {"true", NULL};
+		execvp(args[0], args);
+		test_fail("Exec failed");
+	} else {
+		/* Parent */
+		wait_for_child_exit(pid);
+	}
+	return NULL;
+}
+#endif
+
+#ifndef _WIN32
+static void
+do_test_fork_multithreaded() {
+	thd_t child;
+	thd_create(&child, do_fork_thd, NULL);
+	do_fork_thd(NULL);
+	thd_join(child, NULL);
+}
+#endif
+
+TEST_BEGIN(test_fork_multithreaded) {
+#ifndef _WIN32
+	/*
+	 * We've seen bugs involving hanging on arenas_lock (though the same
+	 * class of bugs can happen on any mutex).  The bugs are intermittent
+	 * though, so we want to run the test multiple times.  Since we hold the
+	 * arenas lock only early in the process lifetime, we can't just run
+	 * this test in a loop (since, after all the arenas are initialized, we
+	 * won't acquire arenas_lock any further).  We therefore repeat the test
+	 * with multiple processes.
+	 */
+	for (int i = 0; i < 100; i++) {
+		int pid = fork();
+		if (pid == -1) {
+			/* Error. */
+			test_fail("Unexpected fork() failure,");
+		} else if (pid == 0) {
+			/* Child. */
+			do_test_fork_multithreaded();
+			_exit(0);
+		} else {
+			wait_for_child_exit(pid);
+		}
+	}
+#else
+	test_skip("fork(2) is irrelevant to Windows");
+#endif
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_fork,
+	    test_fork_multithreaded);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/hash.c b/redis-stable/deps/jemalloc/test/unit/hash.c
new file mode 100644
index 00000000..7cc034f8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/hash.c
@@ -0,0 +1,173 @@
+/*
+ * This file is based on code that is part of SMHasher
+ * (https://code.google.com/p/smhasher/), and is subject to the MIT license
+ * (http://www.opensource.org/licenses/mit-license.php).  Both email addresses
+ * associated with the source code's revision history belong to Austin Appleby,
+ * and the revision history ranges from 2010 to 2012.  Therefore the copyright
+ * and license are here taken to be:
+ *
+ * Copyright (c) 2010-2012 Austin Appleby
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#include "test/jemalloc_test.h"
+#include "jemalloc/internal/hash.h"
+
+typedef enum {
+	hash_variant_x86_32,
+	hash_variant_x86_128,
+	hash_variant_x64_128
+} hash_variant_t;
+
+static int
+hash_variant_bits(hash_variant_t variant) {
+	switch (variant) {
+	case hash_variant_x86_32: return 32;
+	case hash_variant_x86_128: return 128;
+	case hash_variant_x64_128: return 128;
+	default: not_reached();
+	}
+}
+
+static const char *
+hash_variant_string(hash_variant_t variant) {
+	switch (variant) {
+	case hash_variant_x86_32: return "hash_x86_32";
+	case hash_variant_x86_128: return "hash_x86_128";
+	case hash_variant_x64_128: return "hash_x64_128";
+	default: not_reached();
+	}
+}
+
+#define KEY_SIZE	256
+static void
+hash_variant_verify_key(hash_variant_t variant, uint8_t *key) {
+	const int hashbytes = hash_variant_bits(variant) / 8;
+	const int hashes_size = hashbytes * 256;
+	VARIABLE_ARRAY(uint8_t, hashes, hashes_size);
+	VARIABLE_ARRAY(uint8_t, final, hashbytes);
+	unsigned i;
+	uint32_t computed, expected;
+
+	memset(key, 0, KEY_SIZE);
+	memset(hashes, 0, hashes_size);
+	memset(final, 0, hashbytes);
+
+	/*
+	 * Hash keys of the form {0}, {0,1}, {0,1,2}, ..., {0,1,...,255} as the
+	 * seed.
+	 */
+	for (i = 0; i < 256; i++) {
+		key[i] = (uint8_t)i;
+		switch (variant) {
+		case hash_variant_x86_32: {
+			uint32_t out;
+			out = hash_x86_32(key, i, 256-i);
+			memcpy(&hashes[i*hashbytes], &out, hashbytes);
+			break;
+		} case hash_variant_x86_128: {
+			uint64_t out[2];
+			hash_x86_128(key, i, 256-i, out);
+			memcpy(&hashes[i*hashbytes], out, hashbytes);
+			break;
+		} case hash_variant_x64_128: {
+			uint64_t out[2];
+			hash_x64_128(key, i, 256-i, out);
+			memcpy(&hashes[i*hashbytes], out, hashbytes);
+			break;
+		} default: not_reached();
+		}
+	}
+
+	/* Hash the result array. */
+	switch (variant) {
+	case hash_variant_x86_32: {
+		uint32_t out = hash_x86_32(hashes, hashes_size, 0);
+		memcpy(final, &out, sizeof(out));
+		break;
+	} case hash_variant_x86_128: {
+		uint64_t out[2];
+		hash_x86_128(hashes, hashes_size, 0, out);
+		memcpy(final, out, sizeof(out));
+		break;
+	} case hash_variant_x64_128: {
+		uint64_t out[2];
+		hash_x64_128(hashes, hashes_size, 0, out);
+		memcpy(final, out, sizeof(out));
+		break;
+	} default: not_reached();
+	}
+
+	computed = (final[0] << 0) | (final[1] << 8) | (final[2] << 16) |
+	    (final[3] << 24);
+
+	switch (variant) {
+#ifdef JEMALLOC_BIG_ENDIAN
+	case hash_variant_x86_32: expected = 0x6213303eU; break;
+	case hash_variant_x86_128: expected = 0x266820caU; break;
+	case hash_variant_x64_128: expected = 0xcc622b6fU; break;
+#else
+	case hash_variant_x86_32: expected = 0xb0f57ee3U; break;
+	case hash_variant_x86_128: expected = 0xb3ece62aU; break;
+	case hash_variant_x64_128: expected = 0x6384ba69U; break;
+#endif
+	default: not_reached();
+	}
+
+	assert_u32_eq(computed, expected,
+	    "Hash mismatch for %s(): expected %#x but got %#x",
+	    hash_variant_string(variant), expected, computed);
+}
+
+static void
+hash_variant_verify(hash_variant_t variant) {
+#define MAX_ALIGN	16
+	uint8_t key[KEY_SIZE + (MAX_ALIGN - 1)];
+	unsigned i;
+
+	for (i = 0; i < MAX_ALIGN; i++) {
+		hash_variant_verify_key(variant, &key[i]);
+	}
+#undef MAX_ALIGN
+}
+#undef KEY_SIZE
+
+TEST_BEGIN(test_hash_x86_32) {
+	hash_variant_verify(hash_variant_x86_32);
+}
+TEST_END
+
+TEST_BEGIN(test_hash_x86_128) {
+	hash_variant_verify(hash_variant_x86_128);
+}
+TEST_END
+
+TEST_BEGIN(test_hash_x64_128) {
+	hash_variant_verify(hash_variant_x64_128);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_hash_x86_32,
+	    test_hash_x86_128,
+	    test_hash_x64_128);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/hooks.c b/redis-stable/deps/jemalloc/test/unit/hooks.c
new file mode 100644
index 00000000..b70172e1
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/hooks.c
@@ -0,0 +1,38 @@
+#include "test/jemalloc_test.h"
+
+static bool hook_called = false;
+
+static void
+hook() {
+	hook_called = true;
+}
+
+static int
+func_to_hook(int arg1, int arg2) {
+	return arg1 + arg2;
+}
+
+#define func_to_hook JEMALLOC_HOOK(func_to_hook, hooks_libc_hook)
+
+TEST_BEGIN(unhooked_call) {
+	hooks_libc_hook = NULL;
+	hook_called = false;
+	assert_d_eq(3, func_to_hook(1, 2), "Hooking changed return value.");
+	assert_false(hook_called, "Nulling out hook didn't take.");
+}
+TEST_END
+
+TEST_BEGIN(hooked_call) {
+	hooks_libc_hook = &hook;
+	hook_called = false;
+	assert_d_eq(3, func_to_hook(1, 2), "Hooking changed return value.");
+	assert_true(hook_called, "Hook should have executed.");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    unhooked_call,
+	    hooked_call);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/junk.c b/redis-stable/deps/jemalloc/test/unit/junk.c
new file mode 100644
index 00000000..243ced41
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk.c
@@ -0,0 +1,141 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/util.h"
+
+static arena_dalloc_junk_small_t *arena_dalloc_junk_small_orig;
+static large_dalloc_junk_t *large_dalloc_junk_orig;
+static large_dalloc_maybe_junk_t *large_dalloc_maybe_junk_orig;
+static void *watch_for_junking;
+static bool saw_junking;
+
+static void
+watch_junking(void *p) {
+	watch_for_junking = p;
+	saw_junking = false;
+}
+
+static void
+arena_dalloc_junk_small_intercept(void *ptr, const bin_info_t *bin_info) {
+	size_t i;
+
+	arena_dalloc_junk_small_orig(ptr, bin_info);
+	for (i = 0; i < bin_info->reg_size; i++) {
+		assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK,
+		    "Missing junk fill for byte %zu/%zu of deallocated region",
+		    i, bin_info->reg_size);
+	}
+	if (ptr == watch_for_junking) {
+		saw_junking = true;
+	}
+}
+
+static void
+large_dalloc_junk_intercept(void *ptr, size_t usize) {
+	size_t i;
+
+	large_dalloc_junk_orig(ptr, usize);
+	for (i = 0; i < usize; i++) {
+		assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK,
+		    "Missing junk fill for byte %zu/%zu of deallocated region",
+		    i, usize);
+	}
+	if (ptr == watch_for_junking) {
+		saw_junking = true;
+	}
+}
+
+static void
+large_dalloc_maybe_junk_intercept(void *ptr, size_t usize) {
+	large_dalloc_maybe_junk_orig(ptr, usize);
+	if (ptr == watch_for_junking) {
+		saw_junking = true;
+	}
+}
+
+static void
+test_junk(size_t sz_min, size_t sz_max) {
+	uint8_t *s;
+	size_t sz_prev, sz, i;
+
+	if (opt_junk_free) {
+		arena_dalloc_junk_small_orig = arena_dalloc_junk_small;
+		arena_dalloc_junk_small = arena_dalloc_junk_small_intercept;
+		large_dalloc_junk_orig = large_dalloc_junk;
+		large_dalloc_junk = large_dalloc_junk_intercept;
+		large_dalloc_maybe_junk_orig = large_dalloc_maybe_junk;
+		large_dalloc_maybe_junk = large_dalloc_maybe_junk_intercept;
+	}
+
+	sz_prev = 0;
+	s = (uint8_t *)mallocx(sz_min, 0);
+	assert_ptr_not_null((void *)s, "Unexpected mallocx() failure");
+
+	for (sz = sallocx(s, 0); sz <= sz_max;
+	    sz_prev = sz, sz = sallocx(s, 0)) {
+		if (sz_prev > 0) {
+			assert_u_eq(s[0], 'a',
+			    "Previously allocated byte %zu/%zu is corrupted",
+			    ZU(0), sz_prev);
+			assert_u_eq(s[sz_prev-1], 'a',
+			    "Previously allocated byte %zu/%zu is corrupted",
+			    sz_prev-1, sz_prev);
+		}
+
+		for (i = sz_prev; i < sz; i++) {
+			if (opt_junk_alloc) {
+				assert_u_eq(s[i], JEMALLOC_ALLOC_JUNK,
+				    "Newly allocated byte %zu/%zu isn't "
+				    "junk-filled", i, sz);
+			}
+			s[i] = 'a';
+		}
+
+		if (xallocx(s, sz+1, 0, 0) == sz) {
+			uint8_t *t;
+			watch_junking(s);
+			t = (uint8_t *)rallocx(s, sz+1, 0);
+			assert_ptr_not_null((void *)t,
+			    "Unexpected rallocx() failure");
+			assert_zu_ge(sallocx(t, 0), sz+1,
+			    "Unexpectedly small rallocx() result");
+			if (!background_thread_enabled()) {
+				assert_ptr_ne(s, t,
+				    "Unexpected in-place rallocx()");
+				assert_true(!opt_junk_free || saw_junking,
+				    "Expected region of size %zu to be "
+				    "junk-filled", sz);
+			}
+			s = t;
+		}
+	}
+
+	watch_junking(s);
+	dallocx(s, 0);
+	assert_true(!opt_junk_free || saw_junking,
+	    "Expected region of size %zu to be junk-filled", sz);
+
+	if (opt_junk_free) {
+		arena_dalloc_junk_small = arena_dalloc_junk_small_orig;
+		large_dalloc_junk = large_dalloc_junk_orig;
+		large_dalloc_maybe_junk = large_dalloc_maybe_junk_orig;
+	}
+}
+
+TEST_BEGIN(test_junk_small) {
+	test_skip_if(!config_fill);
+	test_junk(1, SMALL_MAXCLASS-1);
+}
+TEST_END
+
+TEST_BEGIN(test_junk_large) {
+	test_skip_if(!config_fill);
+	test_junk(SMALL_MAXCLASS+1, (1U << (LG_LARGE_MINCLASS+1)));
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_junk_small,
+	    test_junk_large);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/junk.sh b/redis-stable/deps/jemalloc/test/unit/junk.sh
new file mode 100644
index 00000000..97cd8ca5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="abort:false,zero:false,junk:true"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_alloc.c b/redis-stable/deps/jemalloc/test/unit/junk_alloc.c
new file mode 100644
index 00000000..a442a0ca
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk_alloc.c
@@ -0,0 +1 @@
+#include "junk.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh b/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
new file mode 100644
index 00000000..e1008c2e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="abort:false,zero:false,junk:alloc"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_free.c b/redis-stable/deps/jemalloc/test/unit/junk_free.c
new file mode 100644
index 00000000..a442a0ca
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk_free.c
@@ -0,0 +1 @@
+#include "junk.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_free.sh b/redis-stable/deps/jemalloc/test/unit/junk_free.sh
new file mode 100644
index 00000000..402196ca
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/junk_free.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="abort:false,zero:false,junk:free"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/log.c b/redis-stable/deps/jemalloc/test/unit/log.c
new file mode 100644
index 00000000..a52bd737
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/log.c
@@ -0,0 +1,193 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/log.h"
+
+static void
+expect_no_logging(const char *names) {
+	log_var_t log_l1 = LOG_VAR_INIT("l1");
+	log_var_t log_l2 = LOG_VAR_INIT("l2");
+	log_var_t log_l2_a = LOG_VAR_INIT("l2.a");
+
+	strcpy(log_var_names, names);
+
+	int count = 0;
+
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1)
+			count++;
+		log_do_end(log_l1)
+
+		log_do_begin(log_l2)
+			count++;
+		log_do_end(log_l2)
+
+		log_do_begin(log_l2_a)
+			count++;
+		log_do_end(log_l2_a)
+	}
+	assert_d_eq(count, 0, "Disabled logging not ignored!");
+}
+
+TEST_BEGIN(test_log_disabled) {
+	test_skip_if(!config_log);
+	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
+	expect_no_logging("");
+	expect_no_logging("abc");
+	expect_no_logging("a.b.c");
+	expect_no_logging("l12");
+	expect_no_logging("l123|a456|b789");
+	expect_no_logging("|||");
+}
+TEST_END
+
+TEST_BEGIN(test_log_enabled_direct) {
+	test_skip_if(!config_log);
+	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
+	log_var_t log_l1 = LOG_VAR_INIT("l1");
+	log_var_t log_l1_a = LOG_VAR_INIT("l1.a");
+	log_var_t log_l2 = LOG_VAR_INIT("l2");
+
+	int count;
+
+	count = 0;
+	strcpy(log_var_names, "l1");
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1)
+			count++;
+		log_do_end(log_l1)
+	}
+	assert_d_eq(count, 10, "Mis-logged!");
+
+	count = 0;
+	strcpy(log_var_names, "l1.a");
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1_a)
+			count++;
+		log_do_end(log_l1_a)
+	}
+	assert_d_eq(count, 10, "Mis-logged!");
+
+	count = 0;
+	strcpy(log_var_names, "l1.a|abc|l2|def");
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1_a)
+			count++;
+		log_do_end(log_l1_a)
+
+		log_do_begin(log_l2)
+			count++;
+		log_do_end(log_l2)
+	}
+	assert_d_eq(count, 20, "Mis-logged!");
+}
+TEST_END
+
+TEST_BEGIN(test_log_enabled_indirect) {
+	test_skip_if(!config_log);
+	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
+	strcpy(log_var_names, "l0|l1|abc|l2.b|def");
+
+	/* On. */
+	log_var_t log_l1 = LOG_VAR_INIT("l1");
+	/* Off. */
+	log_var_t log_l1a = LOG_VAR_INIT("l1a");
+	/* On. */
+	log_var_t log_l1_a = LOG_VAR_INIT("l1.a");
+	/* Off. */
+	log_var_t log_l2_a = LOG_VAR_INIT("l2.a");
+	/* On. */
+	log_var_t log_l2_b_a = LOG_VAR_INIT("l2.b.a");
+	/* On. */
+	log_var_t log_l2_b_b = LOG_VAR_INIT("l2.b.b");
+
+	/* 4 are on total, so should sum to 40. */
+	int count = 0;
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1)
+			count++;
+		log_do_end(log_l1)
+
+		log_do_begin(log_l1a)
+			count++;
+		log_do_end(log_l1a)
+
+		log_do_begin(log_l1_a)
+			count++;
+		log_do_end(log_l1_a)
+
+		log_do_begin(log_l2_a)
+			count++;
+		log_do_end(log_l2_a)
+
+		log_do_begin(log_l2_b_a)
+			count++;
+		log_do_end(log_l2_b_a)
+
+		log_do_begin(log_l2_b_b)
+			count++;
+		log_do_end(log_l2_b_b)
+	}
+
+	assert_d_eq(count, 40, "Mis-logged!");
+}
+TEST_END
+
+TEST_BEGIN(test_log_enabled_global) {
+	test_skip_if(!config_log);
+	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
+	strcpy(log_var_names, "abc|.|def");
+
+	log_var_t log_l1 = LOG_VAR_INIT("l1");
+	log_var_t log_l2_a_a = LOG_VAR_INIT("l2.a.a");
+
+	int count = 0;
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(log_l1)
+		    count++;
+		log_do_end(log_l1)
+
+		log_do_begin(log_l2_a_a)
+		    count++;
+		log_do_end(log_l2_a_a)
+	}
+	assert_d_eq(count, 20, "Mis-logged!");
+}
+TEST_END
+
+TEST_BEGIN(test_logs_if_no_init) {
+	test_skip_if(!config_log);
+	atomic_store_b(&log_init_done, false, ATOMIC_RELAXED);
+
+	log_var_t l = LOG_VAR_INIT("definitely.not.enabled");
+
+	int count = 0;
+	for (int i = 0; i < 10; i++) {
+		log_do_begin(l)
+			count++;
+		log_do_end(l)
+	}
+	assert_d_eq(count, 0, "Logging shouldn't happen if not initialized.");
+}
+TEST_END
+
+/*
+ * This really just checks to make sure that this usage compiles; we don't have
+ * any test code to run.
+ */
+TEST_BEGIN(test_log_only_format_string) {
+	if (false) {
+		LOG("log_str", "No arguments follow this format string.");
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_log_disabled,
+	    test_log_enabled_direct,
+	    test_log_enabled_indirect,
+	    test_log_enabled_global,
+	    test_logs_if_no_init,
+	    test_log_only_format_string);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/mallctl.c b/redis-stable/deps/jemalloc/test/unit/mallctl.c
new file mode 100644
index 00000000..1ecbab08
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/mallctl.c
@@ -0,0 +1,805 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/util.h"
+
+TEST_BEGIN(test_mallctl_errors) {
+	uint64_t epoch;
+	size_t sz;
+
+	assert_d_eq(mallctl("no_such_name", NULL, NULL, NULL, 0), ENOENT,
+	    "mallctl() should return ENOENT for non-existent names");
+
+	assert_d_eq(mallctl("version", NULL, NULL, "0.0.0", strlen("0.0.0")),
+	    EPERM, "mallctl() should return EPERM on attempt to write "
+	    "read-only value");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
+	    sizeof(epoch)-1), EINVAL,
+	    "mallctl() should return EINVAL for input size mismatch");
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
+	    sizeof(epoch)+1), EINVAL,
+	    "mallctl() should return EINVAL for input size mismatch");
+
+	sz = sizeof(epoch)-1;
+	assert_d_eq(mallctl("epoch", (void *)&epoch, &sz, NULL, 0), EINVAL,
+	    "mallctl() should return EINVAL for output size mismatch");
+	sz = sizeof(epoch)+1;
+	assert_d_eq(mallctl("epoch", (void *)&epoch, &sz, NULL, 0), EINVAL,
+	    "mallctl() should return EINVAL for output size mismatch");
+}
+TEST_END
+
+TEST_BEGIN(test_mallctlnametomib_errors) {
+	size_t mib[1];
+	size_t miblen;
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("no_such_name", mib, &miblen), ENOENT,
+	    "mallctlnametomib() should return ENOENT for non-existent names");
+}
+TEST_END
+
+TEST_BEGIN(test_mallctlbymib_errors) {
+	uint64_t epoch;
+	size_t sz;
+	size_t mib[1];
+	size_t miblen;
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("version", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, "0.0.0",
+	    strlen("0.0.0")), EPERM, "mallctl() should return EPERM on "
+	    "attempt to write read-only value");
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("epoch", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&epoch,
+	    sizeof(epoch)-1), EINVAL,
+	    "mallctlbymib() should return EINVAL for input size mismatch");
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&epoch,
+	    sizeof(epoch)+1), EINVAL,
+	    "mallctlbymib() should return EINVAL for input size mismatch");
+
+	sz = sizeof(epoch)-1;
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&epoch, &sz, NULL, 0),
+	    EINVAL,
+	    "mallctlbymib() should return EINVAL for output size mismatch");
+	sz = sizeof(epoch)+1;
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&epoch, &sz, NULL, 0),
+	    EINVAL,
+	    "mallctlbymib() should return EINVAL for output size mismatch");
+}
+TEST_END
+
+TEST_BEGIN(test_mallctl_read_write) {
+	uint64_t old_epoch, new_epoch;
+	size_t sz = sizeof(old_epoch);
+
+	/* Blind. */
+	assert_d_eq(mallctl("epoch", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
+
+	/* Read. */
+	assert_d_eq(mallctl("epoch", (void *)&old_epoch, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
+
+	/* Write. */
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&new_epoch,
+	    sizeof(new_epoch)), 0, "Unexpected mallctl() failure");
+	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
+
+	/* Read+write. */
+	assert_d_eq(mallctl("epoch", (void *)&old_epoch, &sz,
+	    (void *)&new_epoch, sizeof(new_epoch)), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
+}
+TEST_END
+
+TEST_BEGIN(test_mallctlnametomib_short_mib) {
+	size_t mib[4];
+	size_t miblen;
+
+	miblen = 3;
+	mib[3] = 42;
+	assert_d_eq(mallctlnametomib("arenas.bin.0.nregs", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	assert_zu_eq(miblen, 3, "Unexpected mib output length");
+	assert_zu_eq(mib[3], 42,
+	    "mallctlnametomib() wrote past the end of the input mib");
+}
+TEST_END
+
+TEST_BEGIN(test_mallctl_config) {
+#define TEST_MALLCTL_CONFIG(config, t) do {				\
+	t oldval;							\
+	size_t sz = sizeof(oldval);					\
+	assert_d_eq(mallctl("config."#config, (void *)&oldval, &sz,	\
+	    NULL, 0), 0, "Unexpected mallctl() failure");		\
+	assert_b_eq(oldval, config_##config, "Incorrect config value");	\
+	assert_zu_eq(sz, sizeof(oldval), "Unexpected output size");	\
+} while (0)
+
+	TEST_MALLCTL_CONFIG(cache_oblivious, bool);
+	TEST_MALLCTL_CONFIG(debug, bool);
+	TEST_MALLCTL_CONFIG(fill, bool);
+	TEST_MALLCTL_CONFIG(lazy_lock, bool);
+	TEST_MALLCTL_CONFIG(malloc_conf, const char *);
+	TEST_MALLCTL_CONFIG(prof, bool);
+	TEST_MALLCTL_CONFIG(prof_libgcc, bool);
+	TEST_MALLCTL_CONFIG(prof_libunwind, bool);
+	TEST_MALLCTL_CONFIG(stats, bool);
+	TEST_MALLCTL_CONFIG(utrace, bool);
+	TEST_MALLCTL_CONFIG(xmalloc, bool);
+
+#undef TEST_MALLCTL_CONFIG
+}
+TEST_END
+
+TEST_BEGIN(test_mallctl_opt) {
+	bool config_always = true;
+
+#define TEST_MALLCTL_OPT(t, opt, config) do {				\
+	t oldval;							\
+	size_t sz = sizeof(oldval);					\
+	int expected = config_##config ? 0 : ENOENT;			\
+	int result = mallctl("opt."#opt, (void *)&oldval, &sz, NULL,	\
+	    0);								\
+	assert_d_eq(result, expected,					\
+	    "Unexpected mallctl() result for opt."#opt);		\
+	assert_zu_eq(sz, sizeof(oldval), "Unexpected output size");	\
+} while (0)
+
+	TEST_MALLCTL_OPT(bool, abort, always);
+	TEST_MALLCTL_OPT(bool, abort_conf, always);
+	TEST_MALLCTL_OPT(const char *, metadata_thp, always);
+	TEST_MALLCTL_OPT(bool, retain, always);
+	TEST_MALLCTL_OPT(const char *, dss, always);
+	TEST_MALLCTL_OPT(unsigned, narenas, always);
+	TEST_MALLCTL_OPT(const char *, percpu_arena, always);
+	TEST_MALLCTL_OPT(bool, background_thread, always);
+	TEST_MALLCTL_OPT(ssize_t, dirty_decay_ms, always);
+	TEST_MALLCTL_OPT(ssize_t, muzzy_decay_ms, always);
+	TEST_MALLCTL_OPT(bool, stats_print, always);
+	TEST_MALLCTL_OPT(const char *, junk, fill);
+	TEST_MALLCTL_OPT(bool, zero, fill);
+	TEST_MALLCTL_OPT(bool, utrace, utrace);
+	TEST_MALLCTL_OPT(bool, xmalloc, xmalloc);
+	TEST_MALLCTL_OPT(bool, tcache, always);
+	TEST_MALLCTL_OPT(size_t, lg_extent_max_active_fit, always);
+	TEST_MALLCTL_OPT(size_t, lg_tcache_max, always);
+	TEST_MALLCTL_OPT(const char *, thp, always);
+	TEST_MALLCTL_OPT(bool, prof, prof);
+	TEST_MALLCTL_OPT(const char *, prof_prefix, prof);
+	TEST_MALLCTL_OPT(bool, prof_active, prof);
+	TEST_MALLCTL_OPT(ssize_t, lg_prof_sample, prof);
+	TEST_MALLCTL_OPT(bool, prof_accum, prof);
+	TEST_MALLCTL_OPT(ssize_t, lg_prof_interval, prof);
+	TEST_MALLCTL_OPT(bool, prof_gdump, prof);
+	TEST_MALLCTL_OPT(bool, prof_final, prof);
+	TEST_MALLCTL_OPT(bool, prof_leak, prof);
+
+#undef TEST_MALLCTL_OPT
+}
+TEST_END
+
+TEST_BEGIN(test_manpage_example) {
+	unsigned nbins, i;
+	size_t mib[4];
+	size_t len, miblen;
+
+	len = sizeof(nbins);
+	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &len, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	miblen = 4;
+	assert_d_eq(mallctlnametomib("arenas.bin.0.size", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	for (i = 0; i < nbins; i++) {
+		size_t bin_size;
+
+		mib[2] = i;
+		len = sizeof(bin_size);
+		assert_d_eq(mallctlbymib(mib, miblen, (void *)&bin_size, &len,
+		    NULL, 0), 0, "Unexpected mallctlbymib() failure");
+		/* Do something with bin_size... */
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_tcache_none) {
+	test_skip_if(!opt_tcache);
+
+	/* Allocate p and q. */
+	void *p0 = mallocx(42, 0);
+	assert_ptr_not_null(p0, "Unexpected mallocx() failure");
+	void *q = mallocx(42, 0);
+	assert_ptr_not_null(q, "Unexpected mallocx() failure");
+
+	/* Deallocate p and q, but bypass the tcache for q. */
+	dallocx(p0, 0);
+	dallocx(q, MALLOCX_TCACHE_NONE);
+
+	/* Make sure that tcache-based allocation returns p, not q. */
+	void *p1 = mallocx(42, 0);
+	assert_ptr_not_null(p1, "Unexpected mallocx() failure");
+	assert_ptr_eq(p0, p1, "Expected tcache to allocate cached region");
+
+	/* Clean up. */
+	dallocx(p1, MALLOCX_TCACHE_NONE);
+}
+TEST_END
+
+TEST_BEGIN(test_tcache) {
+#define NTCACHES	10
+	unsigned tis[NTCACHES];
+	void *ps[NTCACHES];
+	void *qs[NTCACHES];
+	unsigned i;
+	size_t sz, psz, qsz;
+
+	psz = 42;
+	qsz = nallocx(psz, 0) + 1;
+
+	/* Create tcaches. */
+	for (i = 0; i < NTCACHES; i++) {
+		sz = sizeof(unsigned);
+		assert_d_eq(mallctl("tcache.create", (void *)&tis[i], &sz, NULL,
+		    0), 0, "Unexpected mallctl() failure, i=%u", i);
+	}
+
+	/* Exercise tcache ID recycling. */
+	for (i = 0; i < NTCACHES; i++) {
+		assert_d_eq(mallctl("tcache.destroy", NULL, NULL,
+		    (void *)&tis[i], sizeof(unsigned)), 0,
+		    "Unexpected mallctl() failure, i=%u", i);
+	}
+	for (i = 0; i < NTCACHES; i++) {
+		sz = sizeof(unsigned);
+		assert_d_eq(mallctl("tcache.create", (void *)&tis[i], &sz, NULL,
+		    0), 0, "Unexpected mallctl() failure, i=%u", i);
+	}
+
+	/* Flush empty tcaches. */
+	for (i = 0; i < NTCACHES; i++) {
+		assert_d_eq(mallctl("tcache.flush", NULL, NULL, (void *)&tis[i],
+		    sizeof(unsigned)), 0, "Unexpected mallctl() failure, i=%u",
+		    i);
+	}
+
+	/* Cache some allocations. */
+	for (i = 0; i < NTCACHES; i++) {
+		ps[i] = mallocx(psz, MALLOCX_TCACHE(tis[i]));
+		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure, i=%u",
+		    i);
+		dallocx(ps[i], MALLOCX_TCACHE(tis[i]));
+
+		qs[i] = mallocx(qsz, MALLOCX_TCACHE(tis[i]));
+		assert_ptr_not_null(qs[i], "Unexpected mallocx() failure, i=%u",
+		    i);
+		dallocx(qs[i], MALLOCX_TCACHE(tis[i]));
+	}
+
+	/* Verify that tcaches allocate cached regions. */
+	for (i = 0; i < NTCACHES; i++) {
+		void *p0 = ps[i];
+		ps[i] = mallocx(psz, MALLOCX_TCACHE(tis[i]));
+		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure, i=%u",
+		    i);
+		assert_ptr_eq(ps[i], p0,
+		    "Expected mallocx() to allocate cached region, i=%u", i);
+	}
+
+	/* Verify that reallocation uses cached regions. */
+	for (i = 0; i < NTCACHES; i++) {
+		void *q0 = qs[i];
+		qs[i] = rallocx(ps[i], qsz, MALLOCX_TCACHE(tis[i]));
+		assert_ptr_not_null(qs[i], "Unexpected rallocx() failure, i=%u",
+		    i);
+		assert_ptr_eq(qs[i], q0,
+		    "Expected rallocx() to allocate cached region, i=%u", i);
+		/* Avoid undefined behavior in case of test failure. */
+		if (qs[i] == NULL) {
+			qs[i] = ps[i];
+		}
+	}
+	for (i = 0; i < NTCACHES; i++) {
+		dallocx(qs[i], MALLOCX_TCACHE(tis[i]));
+	}
+
+	/* Flush some non-empty tcaches. */
+	for (i = 0; i < NTCACHES/2; i++) {
+		assert_d_eq(mallctl("tcache.flush", NULL, NULL, (void *)&tis[i],
+		    sizeof(unsigned)), 0, "Unexpected mallctl() failure, i=%u",
+		    i);
+	}
+
+	/* Destroy tcaches. */
+	for (i = 0; i < NTCACHES; i++) {
+		assert_d_eq(mallctl("tcache.destroy", NULL, NULL,
+		    (void *)&tis[i], sizeof(unsigned)), 0,
+		    "Unexpected mallctl() failure, i=%u", i);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_thread_arena) {
+	unsigned old_arena_ind, new_arena_ind, narenas;
+
+	const char *opa;
+	size_t sz = sizeof(opa);
+	assert_d_eq(mallctl("opt.percpu_arena", (void *)&opa, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	assert_u_eq(narenas, opt_narenas, "Number of arenas incorrect");
+
+	if (strcmp(opa, "disabled") == 0) {
+		new_arena_ind = narenas - 1;
+		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
+		    (void *)&new_arena_ind, sizeof(unsigned)), 0,
+		    "Unexpected mallctl() failure");
+		new_arena_ind = 0;
+		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
+		    (void *)&new_arena_ind, sizeof(unsigned)), 0,
+		    "Unexpected mallctl() failure");
+	} else {
+		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
+		    NULL, 0), 0, "Unexpected mallctl() failure");
+		new_arena_ind = percpu_arena_ind_limit(opt_percpu_arena) - 1;
+		if (old_arena_ind != new_arena_ind) {
+			assert_d_eq(mallctl("thread.arena",
+			    (void *)&old_arena_ind, &sz, (void *)&new_arena_ind,
+			    sizeof(unsigned)), EPERM, "thread.arena ctl "
+			    "should not be allowed with percpu arena");
+		}
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_initialized) {
+	unsigned narenas, i;
+	size_t sz;
+	size_t mib[3];
+	size_t miblen = sizeof(mib) / sizeof(size_t);
+	bool initialized;
+
+	sz = sizeof(narenas);
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctlnametomib("arena.0.initialized", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	for (i = 0; i < narenas; i++) {
+		mib[1] = i;
+		sz = sizeof(initialized);
+		assert_d_eq(mallctlbymib(mib, miblen, &initialized, &sz, NULL,
+		    0), 0, "Unexpected mallctl() failure");
+	}
+
+	mib[1] = MALLCTL_ARENAS_ALL;
+	sz = sizeof(initialized);
+	assert_d_eq(mallctlbymib(mib, miblen, &initialized, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_true(initialized,
+	    "Merged arena statistics should always be initialized");
+
+	/* Equivalent to the above but using mallctl() directly. */
+	sz = sizeof(initialized);
+	assert_d_eq(mallctl(
+	    "arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".initialized",
+	    (void *)&initialized, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_true(initialized,
+	    "Merged arena statistics should always be initialized");
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_dirty_decay_ms) {
+	ssize_t dirty_decay_ms, orig_dirty_decay_ms, prev_dirty_decay_ms;
+	size_t sz = sizeof(ssize_t);
+
+	assert_d_eq(mallctl("arena.0.dirty_decay_ms",
+	    (void *)&orig_dirty_decay_ms, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	dirty_decay_ms = -2;
+	assert_d_eq(mallctl("arena.0.dirty_decay_ms", NULL, NULL,
+	    (void *)&dirty_decay_ms, sizeof(ssize_t)), EFAULT,
+	    "Unexpected mallctl() success");
+
+	dirty_decay_ms = 0x7fffffff;
+	assert_d_eq(mallctl("arena.0.dirty_decay_ms", NULL, NULL,
+	    (void *)&dirty_decay_ms, sizeof(ssize_t)), 0,
+	    "Unexpected mallctl() failure");
+
+	for (prev_dirty_decay_ms = dirty_decay_ms, dirty_decay_ms = -1;
+	    dirty_decay_ms < 20; prev_dirty_decay_ms = dirty_decay_ms,
+	    dirty_decay_ms++) {
+		ssize_t old_dirty_decay_ms;
+
+		assert_d_eq(mallctl("arena.0.dirty_decay_ms",
+		    (void *)&old_dirty_decay_ms, &sz, (void *)&dirty_decay_ms,
+		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
+		assert_zd_eq(old_dirty_decay_ms, prev_dirty_decay_ms,
+		    "Unexpected old arena.0.dirty_decay_ms");
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_muzzy_decay_ms) {
+	ssize_t muzzy_decay_ms, orig_muzzy_decay_ms, prev_muzzy_decay_ms;
+	size_t sz = sizeof(ssize_t);
+
+	assert_d_eq(mallctl("arena.0.muzzy_decay_ms",
+	    (void *)&orig_muzzy_decay_ms, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	muzzy_decay_ms = -2;
+	assert_d_eq(mallctl("arena.0.muzzy_decay_ms", NULL, NULL,
+	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), EFAULT,
+	    "Unexpected mallctl() success");
+
+	muzzy_decay_ms = 0x7fffffff;
+	assert_d_eq(mallctl("arena.0.muzzy_decay_ms", NULL, NULL,
+	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), 0,
+	    "Unexpected mallctl() failure");
+
+	for (prev_muzzy_decay_ms = muzzy_decay_ms, muzzy_decay_ms = -1;
+	    muzzy_decay_ms < 20; prev_muzzy_decay_ms = muzzy_decay_ms,
+	    muzzy_decay_ms++) {
+		ssize_t old_muzzy_decay_ms;
+
+		assert_d_eq(mallctl("arena.0.muzzy_decay_ms",
+		    (void *)&old_muzzy_decay_ms, &sz, (void *)&muzzy_decay_ms,
+		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
+		assert_zd_eq(old_muzzy_decay_ms, prev_muzzy_decay_ms,
+		    "Unexpected old arena.0.muzzy_decay_ms");
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_purge) {
+	unsigned narenas;
+	size_t sz = sizeof(unsigned);
+	size_t mib[3];
+	size_t miblen = 3;
+
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctlnametomib("arena.0.purge", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = narenas;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+
+	mib[1] = MALLCTL_ARENAS_ALL;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_decay) {
+	unsigned narenas;
+	size_t sz = sizeof(unsigned);
+	size_t mib[3];
+	size_t miblen = 3;
+
+	assert_d_eq(mallctl("arena.0.decay", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctlnametomib("arena.0.decay", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = narenas;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+
+	mib[1] = MALLCTL_ARENAS_ALL;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_dss) {
+	const char *dss_prec_old, *dss_prec_new;
+	size_t sz = sizeof(dss_prec_old);
+	size_t mib[3];
+	size_t miblen;
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.dss", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() error");
+
+	dss_prec_new = "disabled";
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz,
+	    (void *)&dss_prec_new, sizeof(dss_prec_new)), 0,
+	    "Unexpected mallctl() failure");
+	assert_str_ne(dss_prec_old, "primary",
+	    "Unexpected default for dss precedence");
+
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_new, &sz,
+	    (void *)&dss_prec_old, sizeof(dss_prec_old)), 0,
+	    "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz, NULL,
+	    0), 0, "Unexpected mallctl() failure");
+	assert_str_ne(dss_prec_old, "primary",
+	    "Unexpected value for dss precedence");
+
+	mib[1] = narenas_total_get();
+	dss_prec_new = "disabled";
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz,
+	    (void *)&dss_prec_new, sizeof(dss_prec_new)), 0,
+	    "Unexpected mallctl() failure");
+	assert_str_ne(dss_prec_old, "primary",
+	    "Unexpected default for dss precedence");
+
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_new, &sz,
+	    (void *)&dss_prec_old, sizeof(dss_prec_new)), 0,
+	    "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz, NULL,
+	    0), 0, "Unexpected mallctl() failure");
+	assert_str_ne(dss_prec_old, "primary",
+	    "Unexpected value for dss precedence");
+}
+TEST_END
+
+TEST_BEGIN(test_arena_i_retain_grow_limit) {
+	size_t old_limit, new_limit, default_limit;
+	size_t mib[3];
+	size_t miblen;
+
+	bool retain_enabled;
+	size_t sz = sizeof(retain_enabled);
+	assert_d_eq(mallctl("opt.retain", &retain_enabled, &sz, NULL, 0),
+	    0, "Unexpected mallctl() failure");
+	test_skip_if(!retain_enabled);
+
+	sz = sizeof(default_limit);
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.retain_grow_limit", mib, &miblen),
+	    0, "Unexpected mallctlnametomib() error");
+
+	assert_d_eq(mallctlbymib(mib, miblen, &default_limit, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(default_limit, sz_pind2sz(EXTENT_GROW_MAX_PIND),
+	    "Unexpected default for retain_grow_limit");
+
+	new_limit = PAGE - 1;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
+	    sizeof(new_limit)), EFAULT, "Unexpected mallctl() success");
+
+	new_limit = PAGE + 1;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
+	    sizeof(new_limit)), 0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctlbymib(mib, miblen, &old_limit, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(old_limit, PAGE,
+	    "Unexpected value for retain_grow_limit");
+
+	/* Expect grow less than psize class 10. */
+	new_limit = sz_pind2sz(10) - 1;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
+	    sizeof(new_limit)), 0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctlbymib(mib, miblen, &old_limit, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_zu_eq(old_limit, sz_pind2sz(9),
+	    "Unexpected value for retain_grow_limit");
+
+	/* Restore to default. */
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &default_limit,
+	    sizeof(default_limit)), 0, "Unexpected mallctl() failure");
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_dirty_decay_ms) {
+	ssize_t dirty_decay_ms, orig_dirty_decay_ms, prev_dirty_decay_ms;
+	size_t sz = sizeof(ssize_t);
+
+	assert_d_eq(mallctl("arenas.dirty_decay_ms",
+	    (void *)&orig_dirty_decay_ms, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	dirty_decay_ms = -2;
+	assert_d_eq(mallctl("arenas.dirty_decay_ms", NULL, NULL,
+	    (void *)&dirty_decay_ms, sizeof(ssize_t)), EFAULT,
+	    "Unexpected mallctl() success");
+
+	dirty_decay_ms = 0x7fffffff;
+	assert_d_eq(mallctl("arenas.dirty_decay_ms", NULL, NULL,
+	    (void *)&dirty_decay_ms, sizeof(ssize_t)), 0,
+	    "Expected mallctl() failure");
+
+	for (prev_dirty_decay_ms = dirty_decay_ms, dirty_decay_ms = -1;
+	    dirty_decay_ms < 20; prev_dirty_decay_ms = dirty_decay_ms,
+	    dirty_decay_ms++) {
+		ssize_t old_dirty_decay_ms;
+
+		assert_d_eq(mallctl("arenas.dirty_decay_ms",
+		    (void *)&old_dirty_decay_ms, &sz, (void *)&dirty_decay_ms,
+		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
+		assert_zd_eq(old_dirty_decay_ms, prev_dirty_decay_ms,
+		    "Unexpected old arenas.dirty_decay_ms");
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_muzzy_decay_ms) {
+	ssize_t muzzy_decay_ms, orig_muzzy_decay_ms, prev_muzzy_decay_ms;
+	size_t sz = sizeof(ssize_t);
+
+	assert_d_eq(mallctl("arenas.muzzy_decay_ms",
+	    (void *)&orig_muzzy_decay_ms, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	muzzy_decay_ms = -2;
+	assert_d_eq(mallctl("arenas.muzzy_decay_ms", NULL, NULL,
+	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), EFAULT,
+	    "Unexpected mallctl() success");
+
+	muzzy_decay_ms = 0x7fffffff;
+	assert_d_eq(mallctl("arenas.muzzy_decay_ms", NULL, NULL,
+	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), 0,
+	    "Expected mallctl() failure");
+
+	for (prev_muzzy_decay_ms = muzzy_decay_ms, muzzy_decay_ms = -1;
+	    muzzy_decay_ms < 20; prev_muzzy_decay_ms = muzzy_decay_ms,
+	    muzzy_decay_ms++) {
+		ssize_t old_muzzy_decay_ms;
+
+		assert_d_eq(mallctl("arenas.muzzy_decay_ms",
+		    (void *)&old_muzzy_decay_ms, &sz, (void *)&muzzy_decay_ms,
+		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
+		assert_zd_eq(old_muzzy_decay_ms, prev_muzzy_decay_ms,
+		    "Unexpected old arenas.muzzy_decay_ms");
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_constants) {
+#define TEST_ARENAS_CONSTANT(t, name, expected) do {			\
+	t name;								\
+	size_t sz = sizeof(t);						\
+	assert_d_eq(mallctl("arenas."#name, (void *)&name, &sz, NULL,	\
+	    0), 0, "Unexpected mallctl() failure");			\
+	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
+} while (0)
+
+	TEST_ARENAS_CONSTANT(size_t, quantum, QUANTUM);
+	TEST_ARENAS_CONSTANT(size_t, page, PAGE);
+	TEST_ARENAS_CONSTANT(unsigned, nbins, NBINS);
+	TEST_ARENAS_CONSTANT(unsigned, nlextents, NSIZES - NBINS);
+
+#undef TEST_ARENAS_CONSTANT
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_bin_constants) {
+#define TEST_ARENAS_BIN_CONSTANT(t, name, expected) do {		\
+	t name;								\
+	size_t sz = sizeof(t);						\
+	assert_d_eq(mallctl("arenas.bin.0."#name, (void *)&name, &sz,	\
+	    NULL, 0), 0, "Unexpected mallctl() failure");		\
+	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
+} while (0)
+
+	TEST_ARENAS_BIN_CONSTANT(size_t, size, bin_infos[0].reg_size);
+	TEST_ARENAS_BIN_CONSTANT(uint32_t, nregs, bin_infos[0].nregs);
+	TEST_ARENAS_BIN_CONSTANT(size_t, slab_size,
+	    bin_infos[0].slab_size);
+
+#undef TEST_ARENAS_BIN_CONSTANT
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_lextent_constants) {
+#define TEST_ARENAS_LEXTENT_CONSTANT(t, name, expected) do {		\
+	t name;								\
+	size_t sz = sizeof(t);						\
+	assert_d_eq(mallctl("arenas.lextent.0."#name, (void *)&name,	\
+	    &sz, NULL, 0), 0, "Unexpected mallctl() failure");		\
+	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
+} while (0)
+
+	TEST_ARENAS_LEXTENT_CONSTANT(size_t, size, LARGE_MINCLASS);
+
+#undef TEST_ARENAS_LEXTENT_CONSTANT
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_create) {
+	unsigned narenas_before, arena, narenas_after;
+	size_t sz = sizeof(unsigned);
+
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas_before, &sz,
+	    NULL, 0), 0, "Unexpected mallctl() failure");
+	assert_d_eq(mallctl("arenas.create", (void *)&arena, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas_after, &sz, NULL,
+	    0), 0, "Unexpected mallctl() failure");
+
+	assert_u_eq(narenas_before+1, narenas_after,
+	    "Unexpected number of arenas before versus after extension");
+	assert_u_eq(arena, narenas_after-1, "Unexpected arena index");
+}
+TEST_END
+
+TEST_BEGIN(test_arenas_lookup) {
+	unsigned arena, arena1;
+	void *ptr;
+	size_t sz = sizeof(unsigned);
+
+	assert_d_eq(mallctl("arenas.create", (void *)&arena, &sz, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+	ptr = mallocx(42, MALLOCX_ARENA(arena) | MALLOCX_TCACHE_NONE);
+	assert_ptr_not_null(ptr, "Unexpected mallocx() failure");
+	assert_d_eq(mallctl("arenas.lookup", &arena1, &sz, &ptr, sizeof(ptr)),
+	    0, "Unexpected mallctl() failure");
+	assert_u_eq(arena, arena1, "Unexpected arena index");
+	dallocx(ptr, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_stats_arenas) {
+#define TEST_STATS_ARENAS(t, name) do {					\
+	t name;								\
+	size_t sz = sizeof(t);						\
+	assert_d_eq(mallctl("stats.arenas.0."#name, (void *)&name, &sz,	\
+	    NULL, 0), 0, "Unexpected mallctl() failure");		\
+} while (0)
+
+	TEST_STATS_ARENAS(unsigned, nthreads);
+	TEST_STATS_ARENAS(const char *, dss);
+	TEST_STATS_ARENAS(ssize_t, dirty_decay_ms);
+	TEST_STATS_ARENAS(ssize_t, muzzy_decay_ms);
+	TEST_STATS_ARENAS(size_t, pactive);
+	TEST_STATS_ARENAS(size_t, pdirty);
+
+#undef TEST_STATS_ARENAS
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_mallctl_errors,
+	    test_mallctlnametomib_errors,
+	    test_mallctlbymib_errors,
+	    test_mallctl_read_write,
+	    test_mallctlnametomib_short_mib,
+	    test_mallctl_config,
+	    test_mallctl_opt,
+	    test_manpage_example,
+	    test_tcache_none,
+	    test_tcache,
+	    test_thread_arena,
+	    test_arena_i_initialized,
+	    test_arena_i_dirty_decay_ms,
+	    test_arena_i_muzzy_decay_ms,
+	    test_arena_i_purge,
+	    test_arena_i_decay,
+	    test_arena_i_dss,
+	    test_arena_i_retain_grow_limit,
+	    test_arenas_dirty_decay_ms,
+	    test_arenas_muzzy_decay_ms,
+	    test_arenas_constants,
+	    test_arenas_bin_constants,
+	    test_arenas_lextent_constants,
+	    test_arenas_create,
+	    test_arenas_lookup,
+	    test_stats_arenas);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/malloc_io.c b/redis-stable/deps/jemalloc/test/unit/malloc_io.c
new file mode 100644
index 00000000..79ba7fc5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/malloc_io.c
@@ -0,0 +1,258 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_malloc_strtoumax_no_endptr) {
+	int err;
+
+	set_errno(0);
+	assert_ju_eq(malloc_strtoumax("0", NULL, 0), 0, "Unexpected result");
+	err = get_errno();
+	assert_d_eq(err, 0, "Unexpected failure");
+}
+TEST_END
+
+TEST_BEGIN(test_malloc_strtoumax) {
+	struct test_s {
+		const char *input;
+		const char *expected_remainder;
+		int base;
+		int expected_errno;
+		const char *expected_errno_name;
+		uintmax_t expected_x;
+	};
+#define ERR(e)		e, #e
+#define KUMAX(x)	((uintmax_t)x##ULL)
+#define KSMAX(x)	((uintmax_t)(intmax_t)x##LL)
+	struct test_s tests[] = {
+		{"0",		"0",	-1,	ERR(EINVAL),	UINTMAX_MAX},
+		{"0",		"0",	1,	ERR(EINVAL),	UINTMAX_MAX},
+		{"0",		"0",	37,	ERR(EINVAL),	UINTMAX_MAX},
+
+		{"",		"",	0,	ERR(EINVAL),	UINTMAX_MAX},
+		{"+",		"+",	0,	ERR(EINVAL),	UINTMAX_MAX},
+		{"++3",		"++3",	0,	ERR(EINVAL),	UINTMAX_MAX},
+		{"-",		"-",	0,	ERR(EINVAL),	UINTMAX_MAX},
+
+		{"42",		"",	0,	ERR(0),		KUMAX(42)},
+		{"+42",		"",	0,	ERR(0),		KUMAX(42)},
+		{"-42",		"",	0,	ERR(0),		KSMAX(-42)},
+		{"042",		"",	0,	ERR(0),		KUMAX(042)},
+		{"+042",	"",	0,	ERR(0),		KUMAX(042)},
+		{"-042",	"",	0,	ERR(0),		KSMAX(-042)},
+		{"0x42",	"",	0,	ERR(0),		KUMAX(0x42)},
+		{"+0x42",	"",	0,	ERR(0),		KUMAX(0x42)},
+		{"-0x42",	"",	0,	ERR(0),		KSMAX(-0x42)},
+
+		{"0",		"",	0,	ERR(0),		KUMAX(0)},
+		{"1",		"",	0,	ERR(0),		KUMAX(1)},
+
+		{"42",		"",	0,	ERR(0),		KUMAX(42)},
+		{" 42",		"",	0,	ERR(0),		KUMAX(42)},
+		{"42 ",		" ",	0,	ERR(0),		KUMAX(42)},
+		{"0x",		"x",	0,	ERR(0),		KUMAX(0)},
+		{"42x",		"x",	0,	ERR(0),		KUMAX(42)},
+
+		{"07",		"",	0,	ERR(0),		KUMAX(7)},
+		{"010",		"",	0,	ERR(0),		KUMAX(8)},
+		{"08",		"8",	0,	ERR(0),		KUMAX(0)},
+		{"0_",		"_",	0,	ERR(0),		KUMAX(0)},
+
+		{"0x",		"x",	0,	ERR(0),		KUMAX(0)},
+		{"0X",		"X",	0,	ERR(0),		KUMAX(0)},
+		{"0xg",		"xg",	0,	ERR(0),		KUMAX(0)},
+		{"0XA",		"",	0,	ERR(0),		KUMAX(10)},
+
+		{"010",		"",	10,	ERR(0),		KUMAX(10)},
+		{"0x3",		"x3",	10,	ERR(0),		KUMAX(0)},
+
+		{"12",		"2",	2,	ERR(0),		KUMAX(1)},
+		{"78",		"8",	8,	ERR(0),		KUMAX(7)},
+		{"9a",		"a",	10,	ERR(0),		KUMAX(9)},
+		{"9A",		"A",	10,	ERR(0),		KUMAX(9)},
+		{"fg",		"g",	16,	ERR(0),		KUMAX(15)},
+		{"FG",		"G",	16,	ERR(0),		KUMAX(15)},
+		{"0xfg",	"g",	16,	ERR(0),		KUMAX(15)},
+		{"0XFG",	"G",	16,	ERR(0),		KUMAX(15)},
+		{"z_",		"_",	36,	ERR(0),		KUMAX(35)},
+		{"Z_",		"_",	36,	ERR(0),		KUMAX(35)}
+	};
+#undef ERR
+#undef KUMAX
+#undef KSMAX
+	unsigned i;
+
+	for (i = 0; i < sizeof(tests)/sizeof(struct test_s); i++) {
+		struct test_s *test = &tests[i];
+		int err;
+		uintmax_t result;
+		char *remainder;
+
+		set_errno(0);
+		result = malloc_strtoumax(test->input, &remainder, test->base);
+		err = get_errno();
+		assert_d_eq(err, test->expected_errno,
+		    "Expected errno %s for \"%s\", base %d",
+		    test->expected_errno_name, test->input, test->base);
+		assert_str_eq(remainder, test->expected_remainder,
+		    "Unexpected remainder for \"%s\", base %d",
+		    test->input, test->base);
+		if (err == 0) {
+			assert_ju_eq(result, test->expected_x,
+			    "Unexpected result for \"%s\", base %d",
+			    test->input, test->base);
+		}
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_malloc_snprintf_truncated) {
+#define BUFLEN	15
+	char buf[BUFLEN];
+	size_t result;
+	size_t len;
+#define TEST(expected_str_untruncated, ...) do {			\
+	result = malloc_snprintf(buf, len, __VA_ARGS__);		\
+	assert_d_eq(strncmp(buf, expected_str_untruncated, len-1), 0,	\
+	    "Unexpected string inequality (\"%s\" vs \"%s\")",		\
+	    buf, expected_str_untruncated);				\
+	assert_zu_eq(result, strlen(expected_str_untruncated),		\
+	    "Unexpected result");					\
+} while (0)
+
+	for (len = 1; len < BUFLEN; len++) {
+		TEST("012346789",	"012346789");
+		TEST("a0123b",		"a%sb", "0123");
+		TEST("a01234567",	"a%s%s", "0123", "4567");
+		TEST("a0123  ",		"a%-6s", "0123");
+		TEST("a  0123",		"a%6s", "0123");
+		TEST("a   012",		"a%6.3s", "0123");
+		TEST("a   012",		"a%*.*s", 6, 3, "0123");
+		TEST("a 123b",		"a% db", 123);
+		TEST("a123b",		"a%-db", 123);
+		TEST("a-123b",		"a%-db", -123);
+		TEST("a+123b",		"a%+db", 123);
+	}
+#undef BUFLEN
+#undef TEST
+}
+TEST_END
+
+TEST_BEGIN(test_malloc_snprintf) {
+#define BUFLEN	128
+	char buf[BUFLEN];
+	size_t result;
+#define TEST(expected_str, ...) do {					\
+	result = malloc_snprintf(buf, sizeof(buf), __VA_ARGS__);	\
+	assert_str_eq(buf, expected_str, "Unexpected output");		\
+	assert_zu_eq(result, strlen(expected_str), "Unexpected result");\
+} while (0)
+
+	TEST("hello", "hello");
+
+	TEST("50%, 100%", "50%%, %d%%", 100);
+
+	TEST("a0123b", "a%sb", "0123");
+
+	TEST("a 0123b", "a%5sb", "0123");
+	TEST("a 0123b", "a%*sb", 5, "0123");
+
+	TEST("a0123 b", "a%-5sb", "0123");
+	TEST("a0123b", "a%*sb", -1, "0123");
+	TEST("a0123 b", "a%*sb", -5, "0123");
+	TEST("a0123 b", "a%-*sb", -5, "0123");
+
+	TEST("a012b", "a%.3sb", "0123");
+	TEST("a012b", "a%.*sb", 3, "0123");
+	TEST("a0123b", "a%.*sb", -3, "0123");
+
+	TEST("a  012b", "a%5.3sb", "0123");
+	TEST("a  012b", "a%5.*sb", 3, "0123");
+	TEST("a  012b", "a%*.3sb", 5, "0123");
+	TEST("a  012b", "a%*.*sb", 5, 3, "0123");
+	TEST("a 0123b", "a%*.*sb", 5, -3, "0123");
+
+	TEST("_abcd_", "_%x_", 0xabcd);
+	TEST("_0xabcd_", "_%#x_", 0xabcd);
+	TEST("_1234_", "_%o_", 01234);
+	TEST("_01234_", "_%#o_", 01234);
+	TEST("_1234_", "_%u_", 1234);
+
+	TEST("_1234_", "_%d_", 1234);
+	TEST("_ 1234_", "_% d_", 1234);
+	TEST("_+1234_", "_%+d_", 1234);
+	TEST("_-1234_", "_%d_", -1234);
+	TEST("_-1234_", "_% d_", -1234);
+	TEST("_-1234_", "_%+d_", -1234);
+
+	TEST("_-1234_", "_%d_", -1234);
+	TEST("_1234_", "_%d_", 1234);
+	TEST("_-1234_", "_%i_", -1234);
+	TEST("_1234_", "_%i_", 1234);
+	TEST("_01234_", "_%#o_", 01234);
+	TEST("_1234_", "_%u_", 1234);
+	TEST("_0x1234abc_", "_%#x_", 0x1234abc);
+	TEST("_0X1234ABC_", "_%#X_", 0x1234abc);
+	TEST("_c_", "_%c_", 'c');
+	TEST("_string_", "_%s_", "string");
+	TEST("_0x42_", "_%p_", ((void *)0x42));
+
+	TEST("_-1234_", "_%ld_", ((long)-1234));
+	TEST("_1234_", "_%ld_", ((long)1234));
+	TEST("_-1234_", "_%li_", ((long)-1234));
+	TEST("_1234_", "_%li_", ((long)1234));
+	TEST("_01234_", "_%#lo_", ((long)01234));
+	TEST("_1234_", "_%lu_", ((long)1234));
+	TEST("_0x1234abc_", "_%#lx_", ((long)0x1234abc));
+	TEST("_0X1234ABC_", "_%#lX_", ((long)0x1234ABC));
+
+	TEST("_-1234_", "_%lld_", ((long long)-1234));
+	TEST("_1234_", "_%lld_", ((long long)1234));
+	TEST("_-1234_", "_%lli_", ((long long)-1234));
+	TEST("_1234_", "_%lli_", ((long long)1234));
+	TEST("_01234_", "_%#llo_", ((long long)01234));
+	TEST("_1234_", "_%llu_", ((long long)1234));
+	TEST("_0x1234abc_", "_%#llx_", ((long long)0x1234abc));
+	TEST("_0X1234ABC_", "_%#llX_", ((long long)0x1234ABC));
+
+	TEST("_-1234_", "_%qd_", ((long long)-1234));
+	TEST("_1234_", "_%qd_", ((long long)1234));
+	TEST("_-1234_", "_%qi_", ((long long)-1234));
+	TEST("_1234_", "_%qi_", ((long long)1234));
+	TEST("_01234_", "_%#qo_", ((long long)01234));
+	TEST("_1234_", "_%qu_", ((long long)1234));
+	TEST("_0x1234abc_", "_%#qx_", ((long long)0x1234abc));
+	TEST("_0X1234ABC_", "_%#qX_", ((long long)0x1234ABC));
+
+	TEST("_-1234_", "_%jd_", ((intmax_t)-1234));
+	TEST("_1234_", "_%jd_", ((intmax_t)1234));
+	TEST("_-1234_", "_%ji_", ((intmax_t)-1234));
+	TEST("_1234_", "_%ji_", ((intmax_t)1234));
+	TEST("_01234_", "_%#jo_", ((intmax_t)01234));
+	TEST("_1234_", "_%ju_", ((intmax_t)1234));
+	TEST("_0x1234abc_", "_%#jx_", ((intmax_t)0x1234abc));
+	TEST("_0X1234ABC_", "_%#jX_", ((intmax_t)0x1234ABC));
+
+	TEST("_1234_", "_%td_", ((ptrdiff_t)1234));
+	TEST("_-1234_", "_%td_", ((ptrdiff_t)-1234));
+	TEST("_1234_", "_%ti_", ((ptrdiff_t)1234));
+	TEST("_-1234_", "_%ti_", ((ptrdiff_t)-1234));
+
+	TEST("_-1234_", "_%zd_", ((ssize_t)-1234));
+	TEST("_1234_", "_%zd_", ((ssize_t)1234));
+	TEST("_-1234_", "_%zi_", ((ssize_t)-1234));
+	TEST("_1234_", "_%zi_", ((ssize_t)1234));
+	TEST("_01234_", "_%#zo_", ((ssize_t)01234));
+	TEST("_1234_", "_%zu_", ((ssize_t)1234));
+	TEST("_0x1234abc_", "_%#zx_", ((ssize_t)0x1234abc));
+	TEST("_0X1234ABC_", "_%#zX_", ((ssize_t)0x1234ABC));
+#undef BUFLEN
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_malloc_strtoumax_no_endptr,
+	    test_malloc_strtoumax,
+	    test_malloc_snprintf_truncated,
+	    test_malloc_snprintf);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/math.c b/redis-stable/deps/jemalloc/test/unit/math.c
new file mode 100644
index 00000000..09ef20c7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/math.c
@@ -0,0 +1,390 @@
+#include "test/jemalloc_test.h"
+
+#define MAX_REL_ERR 1.0e-9
+#define MAX_ABS_ERR 1.0e-9
+
+#include <float.h>
+
+#ifdef __PGI
+#undef INFINITY
+#endif
+
+#ifndef INFINITY
+#define INFINITY (DBL_MAX + DBL_MAX)
+#endif
+
+static bool
+double_eq_rel(double a, double b, double max_rel_err, double max_abs_err) {
+	double rel_err;
+
+	if (fabs(a - b) < max_abs_err) {
+		return true;
+	}
+	rel_err = (fabs(b) > fabs(a)) ? fabs((a-b)/b) : fabs((a-b)/a);
+	return (rel_err < max_rel_err);
+}
+
+static uint64_t
+factorial(unsigned x) {
+	uint64_t ret = 1;
+	unsigned i;
+
+	for (i = 2; i <= x; i++) {
+		ret *= (uint64_t)i;
+	}
+
+	return ret;
+}
+
+TEST_BEGIN(test_ln_gamma_factorial) {
+	unsigned x;
+
+	/* exp(ln_gamma(x)) == (x-1)! for integer x. */
+	for (x = 1; x <= 21; x++) {
+		assert_true(double_eq_rel(exp(ln_gamma(x)),
+		    (double)factorial(x-1), MAX_REL_ERR, MAX_ABS_ERR),
+		    "Incorrect factorial result for x=%u", x);
+	}
+}
+TEST_END
+
+/* Expected ln_gamma([0.0..100.0] increment=0.25). */
+static const double ln_gamma_misc_expected[] = {
+	INFINITY,
+	1.28802252469807743, 0.57236494292470008, 0.20328095143129538,
+	0.00000000000000000, -0.09827183642181320, -0.12078223763524518,
+	-0.08440112102048555, 0.00000000000000000, 0.12487171489239651,
+	0.28468287047291918, 0.47521466691493719, 0.69314718055994529,
+	0.93580193110872523, 1.20097360234707429, 1.48681557859341718,
+	1.79175946922805496, 2.11445692745037128, 2.45373657084244234,
+	2.80857141857573644, 3.17805383034794575, 3.56137591038669710,
+	3.95781396761871651, 4.36671603662228680, 4.78749174278204581,
+	5.21960398699022932, 5.66256205985714178, 6.11591589143154568,
+	6.57925121201010121, 7.05218545073853953, 7.53436423675873268,
+	8.02545839631598312, 8.52516136106541467, 9.03318691960512332,
+	9.54926725730099690, 10.07315123968123949, 10.60460290274525086,
+	11.14340011995171231, 11.68933342079726856, 12.24220494005076176,
+	12.80182748008146909, 13.36802367147604720, 13.94062521940376342,
+	14.51947222506051816, 15.10441257307551943, 15.69530137706046524,
+	16.29200047656724237, 16.89437797963419285, 17.50230784587389010,
+	18.11566950571089407, 18.73434751193644843, 19.35823122022435427,
+	19.98721449566188468, 20.62119544270163018, 21.26007615624470048,
+	21.90376249182879320, 22.55216385312342098, 23.20519299513386002,
+	23.86276584168908954, 24.52480131594137802, 25.19122118273868338,
+	25.86194990184851861, 26.53691449111561340, 27.21604439872720604,
+	27.89927138384089389, 28.58652940490193828, 29.27775451504081516,
+	29.97288476399884871, 30.67186010608067548, 31.37462231367769050,
+	32.08111489594735843, 32.79128302226991565, 33.50507345013689076,
+	34.22243445715505317, 34.94331577687681545, 35.66766853819134298,
+	36.39544520803305261, 37.12659953718355865, 37.86108650896109395,
+	38.59886229060776230, 39.33988418719949465, 40.08411059791735198,
+	40.83150097453079752, 41.58201578195490100, 42.33561646075348506,
+	43.09226539146988699, 43.85192586067515208, 44.61456202863158893,
+	45.38013889847690052, 46.14862228684032885, 46.91997879580877395,
+	47.69417578616628361, 48.47118135183522014, 49.25096429545256882,
+	50.03349410501914463, 50.81874093156324790, 51.60667556776436982,
+	52.39726942748592364, 53.19049452616926743, 53.98632346204390586,
+	54.78472939811231157, 55.58568604486942633, 56.38916764371992940,
+	57.19514895105859864, 58.00360522298051080, 58.81451220059079787,
+	59.62784609588432261, 60.44358357816834371, 61.26170176100199427,
+	62.08217818962842927, 62.90499082887649962, 63.73011805151035958,
+	64.55753862700632340, 65.38723171073768015, 66.21917683354901385,
+	67.05335389170279825, 67.88974313718154008, 68.72832516833013017,
+	69.56908092082363737, 70.41199165894616385, 71.25703896716800045,
+	72.10420474200799390, 72.95347118416940191, 73.80482079093779646,
+	74.65823634883015814, 75.51370092648485866, 76.37119786778275454,
+	77.23071078519033961, 78.09222355331530707, 78.95572030266725960,
+	79.82118541361435859, 80.68860351052903468, 81.55795945611502873,
+	82.42923834590904164, 83.30242550295004378, 84.17750647261028973,
+	85.05446701758152983, 85.93329311301090456, 86.81397094178107920,
+	87.69648688992882057, 88.58082754219766741, 89.46697967771913795,
+	90.35493026581838194, 91.24466646193963015, 92.13617560368709292,
+	93.02944520697742803, 93.92446296229978486, 94.82121673107967297,
+	95.71969454214321615, 96.61988458827809723, 97.52177522288820910,
+	98.42535495673848800, 99.33061245478741341, 100.23753653310367895,
+	101.14611615586458981, 102.05634043243354370, 102.96819861451382394,
+	103.88168009337621811, 104.79677439715833032, 105.71347118823287303,
+	106.63176026064346047, 107.55163153760463501, 108.47307506906540198,
+	109.39608102933323153, 110.32063971475740516, 111.24674154146920557,
+	112.17437704317786995, 113.10353686902013237, 114.03421178146170689,
+	114.96639265424990128, 115.90007047041454769, 116.83523632031698014,
+	117.77188139974506953, 118.70999700805310795, 119.64957454634490830,
+	120.59060551569974962, 121.53308151543865279, 122.47699424143097247,
+	123.42233548443955726, 124.36909712850338394, 125.31727114935689826,
+	126.26684961288492559, 127.21782467361175861, 128.17018857322420899,
+	129.12393363912724453, 130.07905228303084755, 131.03553699956862033,
+	131.99338036494577864, 132.95257503561629164, 133.91311374698926784,
+	134.87498931216194364, 135.83819462068046846, 136.80272263732638294,
+	137.76856640092901785, 138.73571902320256299, 139.70417368760718091,
+	140.67392364823425055, 141.64496222871400732, 142.61728282114600574,
+	143.59087888505104047, 144.56574394634486680, 145.54187159633210058,
+	146.51925549072063859, 147.49788934865566148, 148.47776695177302031,
+	149.45888214327129617, 150.44122882700193600, 151.42480096657754984,
+	152.40959258449737490, 153.39559776128982094, 154.38281063467164245,
+	155.37122539872302696, 156.36083630307879844, 157.35163765213474107,
+	158.34362380426921391, 159.33678917107920370, 160.33112821663092973,
+	161.32663545672428995, 162.32330545817117695, 163.32113283808695314,
+	164.32011226319519892, 165.32023844914485267, 166.32150615984036790,
+	167.32391020678358018, 168.32744544842768164, 169.33210678954270634,
+	170.33788918059275375, 171.34478761712384198, 172.35279713916281707,
+	173.36191283062726143, 174.37212981874515094, 175.38344327348534080,
+	176.39584840699734514, 177.40934047306160437, 178.42391476654847793,
+	179.43956662288721304, 180.45629141754378111, 181.47408456550741107,
+	182.49294152078630304, 183.51285777591152737, 184.53382886144947861,
+	185.55585034552262869, 186.57891783333786861, 187.60302696672312095,
+	188.62817342367162610, 189.65435291789341932, 190.68156119837468054,
+	191.70979404894376330, 192.73904728784492590, 193.76931676731820176,
+	194.80059837318714244, 195.83288802445184729, 196.86618167288995096,
+	197.90047530266301123, 198.93576492992946214, 199.97204660246373464,
+	201.00931639928148797, 202.04757043027063901, 203.08680483582807597,
+	204.12701578650228385, 205.16819948264117102, 206.21035215404597807,
+	207.25347005962987623, 208.29754948708190909, 209.34258675253678916,
+	210.38857820024875878, 211.43552020227099320, 212.48340915813977858,
+	213.53224149456323744, 214.58201366511514152, 215.63272214993284592,
+	216.68436345542014010, 217.73693411395422004, 218.79043068359703739,
+	219.84484974781133815, 220.90018791517996988, 221.95644181913033322,
+	223.01360811766215875, 224.07168349307951871, 225.13066465172661879,
+	226.19054832372759734, 227.25133126272962159, 228.31301024565024704,
+	229.37558207242807384, 230.43904356577689896, 231.50339157094342113,
+	232.56862295546847008, 233.63473460895144740, 234.70172344281823484,
+	235.76958639009222907, 236.83832040516844586, 237.90792246359117712,
+	238.97838956183431947, 240.04971871708477238, 241.12190696702904802,
+	242.19495136964280846, 243.26884900298270509, 244.34359696498191283,
+	245.41919237324782443, 246.49563236486270057, 247.57291409618682110,
+	248.65103474266476269, 249.72999149863338175, 250.80978157713354904,
+	251.89040220972316320, 252.97185064629374551, 254.05412415488834199,
+	255.13722002152300661, 256.22113555000953511, 257.30586806178126835,
+	258.39141489572085675, 259.47777340799029844, 260.56494097186322279,
+	261.65291497755913497, 262.74169283208021852, 263.83127195904967266,
+	264.92164979855277807, 266.01282380697938379, 267.10479145686849733,
+	268.19755023675537586, 269.29109765101975427, 270.38543121973674488,
+	271.48054847852881721, 272.57644697842033565, 273.67312428569374561,
+	274.77057798174683967, 275.86880566295326389, 276.96780494052313770,
+	278.06757344036617496, 279.16810880295668085, 280.26940868320008349,
+	281.37147075030043197, 282.47429268763045229, 283.57787219260217171,
+	284.68220697654078322, 285.78729476455760050, 286.89313329542699194,
+	287.99972032146268930, 289.10705360839756395, 290.21513093526289140,
+	291.32395009427028754, 292.43350889069523646, 293.54380514276073200,
+	294.65483668152336350, 295.76660135076059532, 296.87909700685889902,
+	297.99232151870342022, 299.10627276756946458, 300.22094864701409733,
+	301.33634706277030091, 302.45246593264130297, 303.56930318639643929,
+	304.68685676566872189, 305.80512462385280514, 306.92410472600477078,
+	308.04379504874236773, 309.16419358014690033, 310.28529831966631036,
+	311.40710727801865687, 312.52961847709792664, 313.65282994987899201,
+	314.77673974032603610, 315.90134590329950015, 317.02664650446632777,
+	318.15263962020929966, 319.27932333753892635, 320.40669575400545455,
+	321.53475497761127144, 322.66349912672620803, 323.79292633000159185,
+	324.92303472628691452, 326.05382246454587403, 327.18528770377525916,
+	328.31742861292224234, 329.45024337080525356, 330.58373016603343331,
+	331.71788719692847280, 332.85271267144611329, 333.98820480709991898,
+	335.12436183088397001, 336.26118197919845443, 337.39866349777429377,
+	338.53680464159958774, 339.67560367484657036, 340.81505887079896411,
+	341.95516851178109619, 343.09593088908627578, 344.23734430290727460,
+	345.37940706226686416, 346.52211748494903532, 347.66547389743118401,
+	348.80947463481720661, 349.95411804077025408, 351.09940246744753267,
+	352.24532627543504759, 353.39188783368263103, 354.53908551944078908,
+	355.68691771819692349, 356.83538282361303118, 357.98447923746385868,
+	359.13420536957539753
+};
+
+TEST_BEGIN(test_ln_gamma_misc) {
+	unsigned i;
+
+	for (i = 1; i < sizeof(ln_gamma_misc_expected)/sizeof(double); i++) {
+		double x = (double)i * 0.25;
+		assert_true(double_eq_rel(ln_gamma(x),
+		    ln_gamma_misc_expected[i], MAX_REL_ERR, MAX_ABS_ERR),
+		    "Incorrect ln_gamma result for i=%u", i);
+	}
+}
+TEST_END
+
+/* Expected pt_norm([0.01..0.99] increment=0.01). */
+static const double pt_norm_expected[] = {
+	-INFINITY,
+	-2.32634787404084076, -2.05374891063182252, -1.88079360815125085,
+	-1.75068607125216946, -1.64485362695147264, -1.55477359459685305,
+	-1.47579102817917063, -1.40507156030963221, -1.34075503369021654,
+	-1.28155156554460081, -1.22652812003661049, -1.17498679206608991,
+	-1.12639112903880045, -1.08031934081495606, -1.03643338949378938,
+	-0.99445788320975281, -0.95416525314619416, -0.91536508784281390,
+	-0.87789629505122846, -0.84162123357291418, -0.80642124701824025,
+	-0.77219321418868492, -0.73884684918521371, -0.70630256284008752,
+	-0.67448975019608171, -0.64334540539291685, -0.61281299101662701,
+	-0.58284150727121620, -0.55338471955567281, -0.52440051270804067,
+	-0.49585034734745320, -0.46769879911450812, -0.43991316567323380,
+	-0.41246312944140462, -0.38532046640756751, -0.35845879325119373,
+	-0.33185334643681652, -0.30548078809939738, -0.27931903444745404,
+	-0.25334710313579978, -0.22754497664114931, -0.20189347914185077,
+	-0.17637416478086135, -0.15096921549677725, -0.12566134685507399,
+	-0.10043372051146975, -0.07526986209982976, -0.05015358346473352,
+	-0.02506890825871106, 0.00000000000000000, 0.02506890825871106,
+	0.05015358346473366, 0.07526986209982990, 0.10043372051146990,
+	0.12566134685507413, 0.15096921549677739, 0.17637416478086146,
+	0.20189347914185105, 0.22754497664114931, 0.25334710313579978,
+	0.27931903444745404, 0.30548078809939738, 0.33185334643681652,
+	0.35845879325119373, 0.38532046640756762, 0.41246312944140484,
+	0.43991316567323391, 0.46769879911450835, 0.49585034734745348,
+	0.52440051270804111, 0.55338471955567303, 0.58284150727121620,
+	0.61281299101662701, 0.64334540539291685, 0.67448975019608171,
+	0.70630256284008752, 0.73884684918521371, 0.77219321418868492,
+	0.80642124701824036, 0.84162123357291441, 0.87789629505122879,
+	0.91536508784281423, 0.95416525314619460, 0.99445788320975348,
+	1.03643338949378938, 1.08031934081495606, 1.12639112903880045,
+	1.17498679206608991, 1.22652812003661049, 1.28155156554460081,
+	1.34075503369021654, 1.40507156030963265, 1.47579102817917085,
+	1.55477359459685394, 1.64485362695147308, 1.75068607125217102,
+	1.88079360815125041, 2.05374891063182208, 2.32634787404084076
+};
+
+TEST_BEGIN(test_pt_norm) {
+	unsigned i;
+
+	for (i = 1; i < sizeof(pt_norm_expected)/sizeof(double); i++) {
+		double p = (double)i * 0.01;
+		assert_true(double_eq_rel(pt_norm(p), pt_norm_expected[i],
+		    MAX_REL_ERR, MAX_ABS_ERR),
+		    "Incorrect pt_norm result for i=%u", i);
+	}
+}
+TEST_END
+
+/*
+ * Expected pt_chi2(p=[0.01..0.99] increment=0.07,
+ *                  df={0.1, 1.1, 10.1, 100.1, 1000.1}).
+ */
+static const double pt_chi2_df[] = {0.1, 1.1, 10.1, 100.1, 1000.1};
+static const double pt_chi2_expected[] = {
+	1.168926411457320e-40, 1.347680397072034e-22, 3.886980416666260e-17,
+	8.245951724356564e-14, 2.068936347497604e-11, 1.562561743309233e-09,
+	5.459543043426564e-08, 1.114775688149252e-06, 1.532101202364371e-05,
+	1.553884683726585e-04, 1.239396954915939e-03, 8.153872320255721e-03,
+	4.631183739647523e-02, 2.473187311701327e-01, 2.175254800183617e+00,
+
+	0.0003729887888876379, 0.0164409238228929513, 0.0521523015190650113,
+	0.1064701372271216612, 0.1800913735793082115, 0.2748704281195626931,
+	0.3939246282787986497, 0.5420727552260817816, 0.7267265822221973259,
+	0.9596554296000253670, 1.2607440376386165326, 1.6671185084541604304,
+	2.2604828984738705167, 3.2868613342148607082, 6.9298574921692139839,
+
+	2.606673548632508, 4.602913725294877, 5.646152813924212,
+	6.488971315540869, 7.249823275816285, 7.977314231410841,
+	8.700354939944047, 9.441728024225892, 10.224338321374127,
+	11.076435368801061, 12.039320937038386, 13.183878752697167,
+	14.657791935084575, 16.885728216339373, 23.361991680031817,
+
+	70.14844087392152, 80.92379498849355, 85.53325420085891,
+	88.94433120715347, 91.83732712857017, 94.46719943606301,
+	96.96896479994635, 99.43412843510363, 101.94074719829733,
+	104.57228644307247, 107.43900093448734, 110.71844673417287,
+	114.76616819871325, 120.57422505959563, 135.92318818757556,
+
+	899.0072447849649, 937.9271278858220, 953.8117189560207,
+	965.3079371501154, 974.8974061207954, 983.4936235182347,
+	991.5691170518946, 999.4334123954690, 1007.3391826856553,
+	1015.5445154999951, 1024.3777075619569, 1034.3538789836223,
+	1046.4872561869577, 1063.5717461999654, 1107.0741966053859
+};
+
+TEST_BEGIN(test_pt_chi2) {
+	unsigned i, j;
+	unsigned e = 0;
+
+	for (i = 0; i < sizeof(pt_chi2_df)/sizeof(double); i++) {
+		double df = pt_chi2_df[i];
+		double ln_gamma_df = ln_gamma(df * 0.5);
+		for (j = 1; j < 100; j += 7) {
+			double p = (double)j * 0.01;
+			assert_true(double_eq_rel(pt_chi2(p, df, ln_gamma_df),
+			    pt_chi2_expected[e], MAX_REL_ERR, MAX_ABS_ERR),
+			    "Incorrect pt_chi2 result for i=%u, j=%u", i, j);
+			e++;
+		}
+	}
+}
+TEST_END
+
+/*
+ * Expected pt_gamma(p=[0.1..0.99] increment=0.07,
+ *                   shape=[0.5..3.0] increment=0.5).
+ */
+static const double pt_gamma_shape[] = {0.5, 1.0, 1.5, 2.0, 2.5, 3.0};
+static const double pt_gamma_expected[] = {
+	7.854392895485103e-05, 5.043466107888016e-03, 1.788288957794883e-02,
+	3.900956150232906e-02, 6.913847560638034e-02, 1.093710833465766e-01,
+	1.613412523825817e-01, 2.274682115597864e-01, 3.114117323127083e-01,
+	4.189466220207417e-01, 5.598106789059246e-01, 7.521856146202706e-01,
+	1.036125427911119e+00, 1.532450860038180e+00, 3.317448300510606e+00,
+
+	0.01005033585350144, 0.08338160893905107, 0.16251892949777497,
+	0.24846135929849966, 0.34249030894677596, 0.44628710262841947,
+	0.56211891815354142, 0.69314718055994529, 0.84397007029452920,
+	1.02165124753198167, 1.23787435600161766, 1.51412773262977574,
+	1.89711998488588196, 2.52572864430825783, 4.60517018598809091,
+
+	0.05741590094955853, 0.24747378084860744, 0.39888572212236084,
+	0.54394139997444901, 0.69048812513915159, 0.84311389861296104,
+	1.00580622221479898, 1.18298694218766931, 1.38038096305861213,
+	1.60627736383027453, 1.87396970522337947, 2.20749220408081070,
+	2.65852391865854942, 3.37934630984842244, 5.67243336507218476,
+
+	0.1485547402532659, 0.4657458011640391, 0.6832386130709406,
+	0.8794297834672100, 1.0700752852474524, 1.2629614217350744,
+	1.4638400448580779, 1.6783469900166610, 1.9132338090606940,
+	2.1778589228618777, 2.4868823970010991, 2.8664695666264195,
+	3.3724415436062114, 4.1682658512758071, 6.6383520679938108,
+
+	0.2771490383641385, 0.7195001279643727, 0.9969081732265243,
+	1.2383497880608061, 1.4675206597269927, 1.6953064251816552,
+	1.9291243435606809, 2.1757300955477641, 2.4428032131216391,
+	2.7406534569230616, 3.0851445039665513, 3.5043101122033367,
+	4.0575997065264637, 4.9182956424675286, 7.5431362346944937,
+
+	0.4360451650782932, 0.9983600902486267, 1.3306365880734528,
+	1.6129750834753802, 1.8767241606994294, 2.1357032436097660,
+	2.3988853336865565, 2.6740603137235603, 2.9697561737517959,
+	3.2971457713883265, 3.6731795898504660, 4.1275751617770631,
+	4.7230515633946677, 5.6417477865306020, 8.4059469148854635
+};
+
+TEST_BEGIN(test_pt_gamma_shape) {
+	unsigned i, j;
+	unsigned e = 0;
+
+	for (i = 0; i < sizeof(pt_gamma_shape)/sizeof(double); i++) {
+		double shape = pt_gamma_shape[i];
+		double ln_gamma_shape = ln_gamma(shape);
+		for (j = 1; j < 100; j += 7) {
+			double p = (double)j * 0.01;
+			assert_true(double_eq_rel(pt_gamma(p, shape, 1.0,
+			    ln_gamma_shape), pt_gamma_expected[e], MAX_REL_ERR,
+			    MAX_ABS_ERR),
+			    "Incorrect pt_gamma result for i=%u, j=%u", i, j);
+			e++;
+		}
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_pt_gamma_scale) {
+	double shape = 1.0;
+	double ln_gamma_shape = ln_gamma(shape);
+
+	assert_true(double_eq_rel(
+	    pt_gamma(0.5, shape, 1.0, ln_gamma_shape) * 10.0,
+	    pt_gamma(0.5, shape, 10.0, ln_gamma_shape), MAX_REL_ERR,
+	    MAX_ABS_ERR),
+	    "Scale should be trivially equivalent to external multiplication");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_ln_gamma_factorial,
+	    test_ln_gamma_misc,
+	    test_pt_norm,
+	    test_pt_chi2,
+	    test_pt_gamma_shape,
+	    test_pt_gamma_scale);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/mq.c b/redis-stable/deps/jemalloc/test/unit/mq.c
new file mode 100644
index 00000000..57a4d54e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/mq.c
@@ -0,0 +1,89 @@
+#include "test/jemalloc_test.h"
+
+#define NSENDERS	3
+#define NMSGS		100000
+
+typedef struct mq_msg_s mq_msg_t;
+struct mq_msg_s {
+	mq_msg(mq_msg_t)	link;
+};
+mq_gen(static, mq_, mq_t, mq_msg_t, link)
+
+TEST_BEGIN(test_mq_basic) {
+	mq_t mq;
+	mq_msg_t msg;
+
+	assert_false(mq_init(&mq), "Unexpected mq_init() failure");
+	assert_u_eq(mq_count(&mq), 0, "mq should be empty");
+	assert_ptr_null(mq_tryget(&mq),
+	    "mq_tryget() should fail when the queue is empty");
+
+	mq_put(&mq, &msg);
+	assert_u_eq(mq_count(&mq), 1, "mq should contain one message");
+	assert_ptr_eq(mq_tryget(&mq), &msg, "mq_tryget() should return msg");
+
+	mq_put(&mq, &msg);
+	assert_ptr_eq(mq_get(&mq), &msg, "mq_get() should return msg");
+
+	mq_fini(&mq);
+}
+TEST_END
+
+static void *
+thd_receiver_start(void *arg) {
+	mq_t *mq = (mq_t *)arg;
+	unsigned i;
+
+	for (i = 0; i < (NSENDERS * NMSGS); i++) {
+		mq_msg_t *msg = mq_get(mq);
+		assert_ptr_not_null(msg, "mq_get() should never return NULL");
+		dallocx(msg, 0);
+	}
+	return NULL;
+}
+
+static void *
+thd_sender_start(void *arg) {
+	mq_t *mq = (mq_t *)arg;
+	unsigned i;
+
+	for (i = 0; i < NMSGS; i++) {
+		mq_msg_t *msg;
+		void *p;
+		p = mallocx(sizeof(mq_msg_t), 0);
+		assert_ptr_not_null(p, "Unexpected mallocx() failure");
+		msg = (mq_msg_t *)p;
+		mq_put(mq, msg);
+	}
+	return NULL;
+}
+
+TEST_BEGIN(test_mq_threaded) {
+	mq_t mq;
+	thd_t receiver;
+	thd_t senders[NSENDERS];
+	unsigned i;
+
+	assert_false(mq_init(&mq), "Unexpected mq_init() failure");
+
+	thd_create(&receiver, thd_receiver_start, (void *)&mq);
+	for (i = 0; i < NSENDERS; i++) {
+		thd_create(&senders[i], thd_sender_start, (void *)&mq);
+	}
+
+	thd_join(receiver, NULL);
+	for (i = 0; i < NSENDERS; i++) {
+		thd_join(senders[i], NULL);
+	}
+
+	mq_fini(&mq);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_mq_basic,
+	    test_mq_threaded);
+}
+
diff --git a/redis-stable/deps/jemalloc/test/unit/mtx.c b/redis-stable/deps/jemalloc/test/unit/mtx.c
new file mode 100644
index 00000000..424587b0
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/mtx.c
@@ -0,0 +1,57 @@
+#include "test/jemalloc_test.h"
+
+#define NTHREADS	2
+#define NINCRS		2000000
+
+TEST_BEGIN(test_mtx_basic) {
+	mtx_t mtx;
+
+	assert_false(mtx_init(&mtx), "Unexpected mtx_init() failure");
+	mtx_lock(&mtx);
+	mtx_unlock(&mtx);
+	mtx_fini(&mtx);
+}
+TEST_END
+
+typedef struct {
+	mtx_t		mtx;
+	unsigned	x;
+} thd_start_arg_t;
+
+static void *
+thd_start(void *varg) {
+	thd_start_arg_t *arg = (thd_start_arg_t *)varg;
+	unsigned i;
+
+	for (i = 0; i < NINCRS; i++) {
+		mtx_lock(&arg->mtx);
+		arg->x++;
+		mtx_unlock(&arg->mtx);
+	}
+	return NULL;
+}
+
+TEST_BEGIN(test_mtx_race) {
+	thd_start_arg_t arg;
+	thd_t thds[NTHREADS];
+	unsigned i;
+
+	assert_false(mtx_init(&arg.mtx), "Unexpected mtx_init() failure");
+	arg.x = 0;
+	for (i = 0; i < NTHREADS; i++) {
+		thd_create(&thds[i], thd_start, (void *)&arg);
+	}
+	for (i = 0; i < NTHREADS; i++) {
+		thd_join(thds[i], NULL);
+	}
+	assert_u_eq(arg.x, NTHREADS * NINCRS,
+	    "Race-related counter corruption");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_mtx_basic,
+	    test_mtx_race);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/nstime.c b/redis-stable/deps/jemalloc/test/unit/nstime.c
new file mode 100644
index 00000000..f3137805
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/nstime.c
@@ -0,0 +1,249 @@
+#include "test/jemalloc_test.h"
+
+#define BILLION	UINT64_C(1000000000)
+
+TEST_BEGIN(test_nstime_init) {
+	nstime_t nst;
+
+	nstime_init(&nst, 42000000043);
+	assert_u64_eq(nstime_ns(&nst), 42000000043, "ns incorrectly read");
+	assert_u64_eq(nstime_sec(&nst), 42, "sec incorrectly read");
+	assert_u64_eq(nstime_nsec(&nst), 43, "nsec incorrectly read");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_init2) {
+	nstime_t nst;
+
+	nstime_init2(&nst, 42, 43);
+	assert_u64_eq(nstime_sec(&nst), 42, "sec incorrectly read");
+	assert_u64_eq(nstime_nsec(&nst), 43, "nsec incorrectly read");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_copy) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_init(&nstb, 0);
+	nstime_copy(&nstb, &nsta);
+	assert_u64_eq(nstime_sec(&nstb), 42, "sec incorrectly copied");
+	assert_u64_eq(nstime_nsec(&nstb), 43, "nsec incorrectly copied");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_compare) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0, "Times should be equal");
+	assert_d_eq(nstime_compare(&nstb, &nsta), 0, "Times should be equal");
+
+	nstime_init2(&nstb, 42, 42);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 1,
+	    "nsta should be greater than nstb");
+	assert_d_eq(nstime_compare(&nstb, &nsta), -1,
+	    "nstb should be less than nsta");
+
+	nstime_init2(&nstb, 42, 44);
+	assert_d_eq(nstime_compare(&nsta, &nstb), -1,
+	    "nsta should be less than nstb");
+	assert_d_eq(nstime_compare(&nstb, &nsta), 1,
+	    "nstb should be greater than nsta");
+
+	nstime_init2(&nstb, 41, BILLION - 1);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 1,
+	    "nsta should be greater than nstb");
+	assert_d_eq(nstime_compare(&nstb, &nsta), -1,
+	    "nstb should be less than nsta");
+
+	nstime_init2(&nstb, 43, 0);
+	assert_d_eq(nstime_compare(&nsta, &nstb), -1,
+	    "nsta should be less than nstb");
+	assert_d_eq(nstime_compare(&nstb, &nsta), 1,
+	    "nstb should be greater than nsta");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_add) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_add(&nsta, &nstb);
+	nstime_init2(&nstb, 84, 86);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect addition result");
+
+	nstime_init2(&nsta, 42, BILLION - 1);
+	nstime_copy(&nstb, &nsta);
+	nstime_add(&nsta, &nstb);
+	nstime_init2(&nstb, 85, BILLION - 2);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect addition result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_iadd) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, BILLION - 1);
+	nstime_iadd(&nsta, 1);
+	nstime_init2(&nstb, 43, 0);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect addition result");
+
+	nstime_init2(&nsta, 42, 1);
+	nstime_iadd(&nsta, BILLION + 1);
+	nstime_init2(&nstb, 43, 2);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect addition result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_subtract) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_subtract(&nsta, &nstb);
+	nstime_init(&nstb, 0);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect subtraction result");
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_init2(&nstb, 41, 44);
+	nstime_subtract(&nsta, &nstb);
+	nstime_init2(&nstb, 0, BILLION - 1);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect subtraction result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_isubtract) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_isubtract(&nsta, 42*BILLION + 43);
+	nstime_init(&nstb, 0);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect subtraction result");
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_isubtract(&nsta, 41*BILLION + 44);
+	nstime_init2(&nstb, 0, BILLION - 1);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect subtraction result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_imultiply) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_imultiply(&nsta, 10);
+	nstime_init2(&nstb, 420, 430);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect multiplication result");
+
+	nstime_init2(&nsta, 42, 666666666);
+	nstime_imultiply(&nsta, 3);
+	nstime_init2(&nstb, 127, 999999998);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect multiplication result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_idivide) {
+	nstime_t nsta, nstb;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_imultiply(&nsta, 10);
+	nstime_idivide(&nsta, 10);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect division result");
+
+	nstime_init2(&nsta, 42, 666666666);
+	nstime_copy(&nstb, &nsta);
+	nstime_imultiply(&nsta, 3);
+	nstime_idivide(&nsta, 3);
+	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
+	    "Incorrect division result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_divide) {
+	nstime_t nsta, nstb, nstc;
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_imultiply(&nsta, 10);
+	assert_u64_eq(nstime_divide(&nsta, &nstb), 10,
+	    "Incorrect division result");
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_imultiply(&nsta, 10);
+	nstime_init(&nstc, 1);
+	nstime_add(&nsta, &nstc);
+	assert_u64_eq(nstime_divide(&nsta, &nstb), 10,
+	    "Incorrect division result");
+
+	nstime_init2(&nsta, 42, 43);
+	nstime_copy(&nstb, &nsta);
+	nstime_imultiply(&nsta, 10);
+	nstime_init(&nstc, 1);
+	nstime_subtract(&nsta, &nstc);
+	assert_u64_eq(nstime_divide(&nsta, &nstb), 9,
+	    "Incorrect division result");
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_monotonic) {
+	nstime_monotonic();
+}
+TEST_END
+
+TEST_BEGIN(test_nstime_update) {
+	nstime_t nst;
+
+	nstime_init(&nst, 0);
+
+	assert_false(nstime_update(&nst), "Basic time update failed.");
+
+	/* Only Rip Van Winkle sleeps this long. */
+	{
+		nstime_t addend;
+		nstime_init2(&addend, 631152000, 0);
+		nstime_add(&nst, &addend);
+	}
+	{
+		nstime_t nst0;
+		nstime_copy(&nst0, &nst);
+		assert_true(nstime_update(&nst),
+		    "Update should detect time roll-back.");
+		assert_d_eq(nstime_compare(&nst, &nst0), 0,
+		    "Time should not have been modified");
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_nstime_init,
+	    test_nstime_init2,
+	    test_nstime_copy,
+	    test_nstime_compare,
+	    test_nstime_add,
+	    test_nstime_iadd,
+	    test_nstime_subtract,
+	    test_nstime_isubtract,
+	    test_nstime_imultiply,
+	    test_nstime_idivide,
+	    test_nstime_divide,
+	    test_nstime_monotonic,
+	    test_nstime_update);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/pack.c b/redis-stable/deps/jemalloc/test/unit/pack.c
new file mode 100644
index 00000000..fc188b00
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/pack.c
@@ -0,0 +1,166 @@
+#include "test/jemalloc_test.h"
+
+/*
+ * Size class that is a divisor of the page size, ideally 4+ regions per run.
+ */
+#if LG_PAGE <= 14
+#define SZ	(ZU(1) << (LG_PAGE - 2))
+#else
+#define SZ	ZU(4096)
+#endif
+
+/*
+ * Number of slabs to consume at high water mark.  Should be at least 2 so that
+ * if mmap()ed memory grows downward, downward growth of mmap()ed memory is
+ * tested.
+ */
+#define NSLABS	8
+
+static unsigned
+binind_compute(void) {
+	size_t sz;
+	unsigned nbins, i;
+
+	sz = sizeof(nbins);
+	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &sz, NULL, 0), 0,
+	    "Unexpected mallctl failure");
+
+	for (i = 0; i < nbins; i++) {
+		size_t mib[4];
+		size_t miblen = sizeof(mib)/sizeof(size_t);
+		size_t size;
+
+		assert_d_eq(mallctlnametomib("arenas.bin.0.size", mib,
+		    &miblen), 0, "Unexpected mallctlnametomb failure");
+		mib[2] = (size_t)i;
+
+		sz = sizeof(size);
+		assert_d_eq(mallctlbymib(mib, miblen, (void *)&size, &sz, NULL,
+		    0), 0, "Unexpected mallctlbymib failure");
+		if (size == SZ) {
+			return i;
+		}
+	}
+
+	test_fail("Unable to compute nregs_per_run");
+	return 0;
+}
+
+static size_t
+nregs_per_run_compute(void) {
+	uint32_t nregs;
+	size_t sz;
+	unsigned binind = binind_compute();
+	size_t mib[4];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+
+	assert_d_eq(mallctlnametomib("arenas.bin.0.nregs", mib, &miblen), 0,
+	    "Unexpected mallctlnametomb failure");
+	mib[2] = (size_t)binind;
+	sz = sizeof(nregs);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&nregs, &sz, NULL,
+	    0), 0, "Unexpected mallctlbymib failure");
+	return nregs;
+}
+
+static unsigned
+arenas_create_mallctl(void) {
+	unsigned arena_ind;
+	size_t sz;
+
+	sz = sizeof(arena_ind);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Error in arenas.create");
+
+	return arena_ind;
+}
+
+static void
+arena_reset_mallctl(unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen = sizeof(mib)/sizeof(size_t);
+
+	assert_d_eq(mallctlnametomib("arena.0.reset", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+TEST_BEGIN(test_pack) {
+	bool prof_enabled;
+	size_t sz = sizeof(prof_enabled);
+	if (mallctl("opt.prof", (void *)&prof_enabled, &sz, NULL, 0) == 0) {
+		test_skip_if(prof_enabled);
+	}
+
+	unsigned arena_ind = arenas_create_mallctl();
+	size_t nregs_per_run = nregs_per_run_compute();
+	size_t nregs = nregs_per_run * NSLABS;
+	VARIABLE_ARRAY(void *, ptrs, nregs);
+	size_t i, j, offset;
+
+	/* Fill matrix. */
+	for (i = offset = 0; i < NSLABS; i++) {
+		for (j = 0; j < nregs_per_run; j++) {
+			void *p = mallocx(SZ, MALLOCX_ARENA(arena_ind) |
+			    MALLOCX_TCACHE_NONE);
+			assert_ptr_not_null(p,
+			    "Unexpected mallocx(%zu, MALLOCX_ARENA(%u) |"
+			    " MALLOCX_TCACHE_NONE) failure, run=%zu, reg=%zu",
+			    SZ, arena_ind, i, j);
+			ptrs[(i * nregs_per_run) + j] = p;
+		}
+	}
+
+	/*
+	 * Free all but one region of each run, but rotate which region is
+	 * preserved, so that subsequent allocations exercise the within-run
+	 * layout policy.
+	 */
+	offset = 0;
+	for (i = offset = 0;
+	    i < NSLABS;
+	    i++, offset = (offset + 1) % nregs_per_run) {
+		for (j = 0; j < nregs_per_run; j++) {
+			void *p = ptrs[(i * nregs_per_run) + j];
+			if (offset == j) {
+				continue;
+			}
+			dallocx(p, MALLOCX_ARENA(arena_ind) |
+			    MALLOCX_TCACHE_NONE);
+		}
+	}
+
+	/*
+	 * Logically refill matrix, skipping preserved regions and verifying
+	 * that the matrix is unmodified.
+	 */
+	offset = 0;
+	for (i = offset = 0;
+	    i < NSLABS;
+	    i++, offset = (offset + 1) % nregs_per_run) {
+		for (j = 0; j < nregs_per_run; j++) {
+			void *p;
+
+			if (offset == j) {
+				continue;
+			}
+			p = mallocx(SZ, MALLOCX_ARENA(arena_ind) |
+			    MALLOCX_TCACHE_NONE);
+			assert_ptr_eq(p, ptrs[(i * nregs_per_run) + j],
+			    "Unexpected refill discrepancy, run=%zu, reg=%zu\n",
+			    i, j);
+		}
+	}
+
+	/* Clean up. */
+	arena_reset_mallctl(arena_ind);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_pack);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/pack.sh b/redis-stable/deps/jemalloc/test/unit/pack.sh
new file mode 100644
index 00000000..6f451480
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/pack.sh
@@ -0,0 +1,4 @@
+#!/bin/sh
+
+# Immediately purge to minimize fragmentation.
+export MALLOC_CONF="dirty_decay_ms:0,muzzy_decay_ms:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/pages.c b/redis-stable/deps/jemalloc/test/unit/pages.c
new file mode 100644
index 00000000..ee729eec
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/pages.c
@@ -0,0 +1,29 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_pages_huge) {
+	size_t alloc_size;
+	bool commit;
+	void *pages, *hugepage;
+
+	alloc_size = HUGEPAGE * 2 - PAGE;
+	commit = true;
+	pages = pages_map(NULL, alloc_size, PAGE, &commit);
+	assert_ptr_not_null(pages, "Unexpected pages_map() error");
+
+	if (init_system_thp_mode == thp_mode_default) {
+	    hugepage = (void *)(ALIGNMENT_CEILING((uintptr_t)pages, HUGEPAGE));
+	    assert_b_ne(pages_huge(hugepage, HUGEPAGE), have_madvise_huge,
+	        "Unexpected pages_huge() result");
+	    assert_false(pages_nohuge(hugepage, HUGEPAGE),
+	        "Unexpected pages_nohuge() result");
+	}
+
+	pages_unmap(pages, alloc_size);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_pages_huge);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/ph.c b/redis-stable/deps/jemalloc/test/unit/ph.c
new file mode 100644
index 00000000..88bf56f8
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/ph.c
@@ -0,0 +1,318 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/ph.h"
+
+typedef struct node_s node_t;
+
+struct node_s {
+#define NODE_MAGIC 0x9823af7e
+	uint32_t magic;
+	phn(node_t) link;
+	uint64_t key;
+};
+
+static int
+node_cmp(const node_t *a, const node_t *b) {
+	int ret;
+
+	ret = (a->key > b->key) - (a->key < b->key);
+	if (ret == 0) {
+		/*
+		 * Duplicates are not allowed in the heap, so force an
+		 * arbitrary ordering for non-identical items with equal keys.
+		 */
+		ret = (((uintptr_t)a) > ((uintptr_t)b))
+		    - (((uintptr_t)a) < ((uintptr_t)b));
+	}
+	return ret;
+}
+
+static int
+node_cmp_magic(const node_t *a, const node_t *b) {
+
+	assert_u32_eq(a->magic, NODE_MAGIC, "Bad magic");
+	assert_u32_eq(b->magic, NODE_MAGIC, "Bad magic");
+
+	return node_cmp(a, b);
+}
+
+typedef ph(node_t) heap_t;
+ph_gen(static, heap_, heap_t, node_t, link, node_cmp_magic);
+
+static void
+node_print(const node_t *node, unsigned depth) {
+	unsigned i;
+	node_t *leftmost_child, *sibling;
+
+	for (i = 0; i < depth; i++) {
+		malloc_printf("\t");
+	}
+	malloc_printf("%2"FMTu64"\n", node->key);
+
+	leftmost_child = phn_lchild_get(node_t, link, node);
+	if (leftmost_child == NULL) {
+		return;
+	}
+	node_print(leftmost_child, depth + 1);
+
+	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
+	    NULL; sibling = phn_next_get(node_t, link, sibling)) {
+		node_print(sibling, depth + 1);
+	}
+}
+
+static void
+heap_print(const heap_t *heap) {
+	node_t *auxelm;
+
+	malloc_printf("vvv heap %p vvv\n", heap);
+	if (heap->ph_root == NULL) {
+		goto label_return;
+	}
+
+	node_print(heap->ph_root, 0);
+
+	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
+	    auxelm = phn_next_get(node_t, link, auxelm)) {
+		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
+		    link, auxelm)), auxelm,
+		    "auxelm's prev doesn't link to auxelm");
+		node_print(auxelm, 0);
+	}
+
+label_return:
+	malloc_printf("^^^ heap %p ^^^\n", heap);
+}
+
+static unsigned
+node_validate(const node_t *node, const node_t *parent) {
+	unsigned nnodes = 1;
+	node_t *leftmost_child, *sibling;
+
+	if (parent != NULL) {
+		assert_d_ge(node_cmp_magic(node, parent), 0,
+		    "Child is less than parent");
+	}
+
+	leftmost_child = phn_lchild_get(node_t, link, node);
+	if (leftmost_child == NULL) {
+		return nnodes;
+	}
+	assert_ptr_eq((void *)phn_prev_get(node_t, link, leftmost_child),
+	    (void *)node, "Leftmost child does not link to node");
+	nnodes += node_validate(leftmost_child, node);
+
+	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
+	    NULL; sibling = phn_next_get(node_t, link, sibling)) {
+		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
+		    link, sibling)), sibling,
+		    "sibling's prev doesn't link to sibling");
+		nnodes += node_validate(sibling, node);
+	}
+	return nnodes;
+}
+
+static unsigned
+heap_validate(const heap_t *heap) {
+	unsigned nnodes = 0;
+	node_t *auxelm;
+
+	if (heap->ph_root == NULL) {
+		goto label_return;
+	}
+
+	nnodes += node_validate(heap->ph_root, NULL);
+
+	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
+	    auxelm = phn_next_get(node_t, link, auxelm)) {
+		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
+		    link, auxelm)), auxelm,
+		    "auxelm's prev doesn't link to auxelm");
+		nnodes += node_validate(auxelm, NULL);
+	}
+
+label_return:
+	if (false) {
+		heap_print(heap);
+	}
+	return nnodes;
+}
+
+TEST_BEGIN(test_ph_empty) {
+	heap_t heap;
+
+	heap_new(&heap);
+	assert_true(heap_empty(&heap), "Heap should be empty");
+	assert_ptr_null(heap_first(&heap), "Unexpected node");
+	assert_ptr_null(heap_any(&heap), "Unexpected node");
+}
+TEST_END
+
+static void
+node_remove(heap_t *heap, node_t *node) {
+	heap_remove(heap, node);
+
+	node->magic = 0;
+}
+
+static node_t *
+node_remove_first(heap_t *heap) {
+	node_t *node = heap_remove_first(heap);
+	node->magic = 0;
+	return node;
+}
+
+static node_t *
+node_remove_any(heap_t *heap) {
+	node_t *node = heap_remove_any(heap);
+	node->magic = 0;
+	return node;
+}
+
+TEST_BEGIN(test_ph_random) {
+#define NNODES 25
+#define NBAGS 250
+#define SEED 42
+	sfmt_t *sfmt;
+	uint64_t bag[NNODES];
+	heap_t heap;
+	node_t nodes[NNODES];
+	unsigned i, j, k;
+
+	sfmt = init_gen_rand(SEED);
+	for (i = 0; i < NBAGS; i++) {
+		switch (i) {
+		case 0:
+			/* Insert in order. */
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = j;
+			}
+			break;
+		case 1:
+			/* Insert in reverse order. */
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = NNODES - j - 1;
+			}
+			break;
+		default:
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = gen_rand64_range(sfmt, NNODES);
+			}
+		}
+
+		for (j = 1; j <= NNODES; j++) {
+			/* Initialize heap and nodes. */
+			heap_new(&heap);
+			assert_u_eq(heap_validate(&heap), 0,
+			    "Incorrect node count");
+			for (k = 0; k < j; k++) {
+				nodes[k].magic = NODE_MAGIC;
+				nodes[k].key = bag[k];
+			}
+
+			/* Insert nodes. */
+			for (k = 0; k < j; k++) {
+				heap_insert(&heap, &nodes[k]);
+				if (i % 13 == 12) {
+					assert_ptr_not_null(heap_any(&heap),
+					    "Heap should not be empty");
+					/* Trigger merging. */
+					assert_ptr_not_null(heap_first(&heap),
+					    "Heap should not be empty");
+				}
+				assert_u_eq(heap_validate(&heap), k + 1,
+				    "Incorrect node count");
+			}
+
+			assert_false(heap_empty(&heap),
+			    "Heap should not be empty");
+
+			/* Remove nodes. */
+			switch (i % 6) {
+			case 0:
+				for (k = 0; k < j; k++) {
+					assert_u_eq(heap_validate(&heap), j - k,
+					    "Incorrect node count");
+					node_remove(&heap, &nodes[k]);
+					assert_u_eq(heap_validate(&heap), j - k
+					    - 1, "Incorrect node count");
+				}
+				break;
+			case 1:
+				for (k = j; k > 0; k--) {
+					node_remove(&heap, &nodes[k-1]);
+					assert_u_eq(heap_validate(&heap), k - 1,
+					    "Incorrect node count");
+				}
+				break;
+			case 2: {
+				node_t *prev = NULL;
+				for (k = 0; k < j; k++) {
+					node_t *node = node_remove_first(&heap);
+					assert_u_eq(heap_validate(&heap), j - k
+					    - 1, "Incorrect node count");
+					if (prev != NULL) {
+						assert_d_ge(node_cmp(node,
+						    prev), 0,
+						    "Bad removal order");
+					}
+					prev = node;
+				}
+				break;
+			} case 3: {
+				node_t *prev = NULL;
+				for (k = 0; k < j; k++) {
+					node_t *node = heap_first(&heap);
+					assert_u_eq(heap_validate(&heap), j - k,
+					    "Incorrect node count");
+					if (prev != NULL) {
+						assert_d_ge(node_cmp(node,
+						    prev), 0,
+						    "Bad removal order");
+					}
+					node_remove(&heap, node);
+					assert_u_eq(heap_validate(&heap), j - k
+					    - 1, "Incorrect node count");
+					prev = node;
+				}
+				break;
+			} case 4: {
+				for (k = 0; k < j; k++) {
+					node_remove_any(&heap);
+					assert_u_eq(heap_validate(&heap), j - k
+					    - 1, "Incorrect node count");
+				}
+				break;
+			} case 5: {
+				for (k = 0; k < j; k++) {
+					node_t *node = heap_any(&heap);
+					assert_u_eq(heap_validate(&heap), j - k,
+					    "Incorrect node count");
+					node_remove(&heap, node);
+					assert_u_eq(heap_validate(&heap), j - k
+					    - 1, "Incorrect node count");
+				}
+				break;
+			} default:
+				not_reached();
+			}
+
+			assert_ptr_null(heap_first(&heap),
+			    "Heap should be empty");
+			assert_ptr_null(heap_any(&heap),
+			    "Heap should be empty");
+			assert_true(heap_empty(&heap), "Heap should be empty");
+		}
+	}
+	fini_gen_rand(sfmt);
+#undef NNODES
+#undef SEED
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_ph_empty,
+	    test_ph_random);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prng.c b/redis-stable/deps/jemalloc/test/unit/prng.c
new file mode 100644
index 00000000..b5795c2f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prng.c
@@ -0,0 +1,237 @@
+#include "test/jemalloc_test.h"
+
+static void
+test_prng_lg_range_u32(bool atomic) {
+	atomic_u32_t sa, sb;
+	uint32_t ra, rb;
+	unsigned lg_range;
+
+	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_u32(&sa, 32, atomic);
+	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
+	rb = prng_lg_range_u32(&sa, 32, atomic);
+	assert_u32_eq(ra, rb,
+	    "Repeated generation should produce repeated results");
+
+	atomic_store_u32(&sb, 42, ATOMIC_RELAXED);
+	rb = prng_lg_range_u32(&sb, 32, atomic);
+	assert_u32_eq(ra, rb,
+	    "Equivalent generation should produce equivalent results");
+
+	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_u32(&sa, 32, atomic);
+	rb = prng_lg_range_u32(&sa, 32, atomic);
+	assert_u32_ne(ra, rb,
+	    "Full-width results must not immediately repeat");
+
+	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_u32(&sa, 32, atomic);
+	for (lg_range = 31; lg_range > 0; lg_range--) {
+		atomic_store_u32(&sb, 42, ATOMIC_RELAXED);
+		rb = prng_lg_range_u32(&sb, lg_range, atomic);
+		assert_u32_eq((rb & (UINT32_C(0xffffffff) << lg_range)),
+		    0, "High order bits should be 0, lg_range=%u", lg_range);
+		assert_u32_eq(rb, (ra >> (32 - lg_range)),
+		    "Expected high order bits of full-width result, "
+		    "lg_range=%u", lg_range);
+	}
+}
+
+static void
+test_prng_lg_range_u64(void) {
+	uint64_t sa, sb, ra, rb;
+	unsigned lg_range;
+
+	sa = 42;
+	ra = prng_lg_range_u64(&sa, 64);
+	sa = 42;
+	rb = prng_lg_range_u64(&sa, 64);
+	assert_u64_eq(ra, rb,
+	    "Repeated generation should produce repeated results");
+
+	sb = 42;
+	rb = prng_lg_range_u64(&sb, 64);
+	assert_u64_eq(ra, rb,
+	    "Equivalent generation should produce equivalent results");
+
+	sa = 42;
+	ra = prng_lg_range_u64(&sa, 64);
+	rb = prng_lg_range_u64(&sa, 64);
+	assert_u64_ne(ra, rb,
+	    "Full-width results must not immediately repeat");
+
+	sa = 42;
+	ra = prng_lg_range_u64(&sa, 64);
+	for (lg_range = 63; lg_range > 0; lg_range--) {
+		sb = 42;
+		rb = prng_lg_range_u64(&sb, lg_range);
+		assert_u64_eq((rb & (UINT64_C(0xffffffffffffffff) << lg_range)),
+		    0, "High order bits should be 0, lg_range=%u", lg_range);
+		assert_u64_eq(rb, (ra >> (64 - lg_range)),
+		    "Expected high order bits of full-width result, "
+		    "lg_range=%u", lg_range);
+	}
+}
+
+static void
+test_prng_lg_range_zu(bool atomic) {
+	atomic_zu_t sa, sb;
+	size_t ra, rb;
+	unsigned lg_range;
+
+	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
+	rb = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	assert_zu_eq(ra, rb,
+	    "Repeated generation should produce repeated results");
+
+	atomic_store_zu(&sb, 42, ATOMIC_RELAXED);
+	rb = prng_lg_range_zu(&sb, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	assert_zu_eq(ra, rb,
+	    "Equivalent generation should produce equivalent results");
+
+	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	rb = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	assert_zu_ne(ra, rb,
+	    "Full-width results must not immediately repeat");
+
+	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
+	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
+	for (lg_range = (ZU(1) << (3 + LG_SIZEOF_PTR)) - 1; lg_range > 0;
+	    lg_range--) {
+		atomic_store_zu(&sb, 42, ATOMIC_RELAXED);
+		rb = prng_lg_range_zu(&sb, lg_range, atomic);
+		assert_zu_eq((rb & (SIZE_T_MAX << lg_range)),
+		    0, "High order bits should be 0, lg_range=%u", lg_range);
+		assert_zu_eq(rb, (ra >> ((ZU(1) << (3 + LG_SIZEOF_PTR)) -
+		    lg_range)), "Expected high order bits of full-width "
+		    "result, lg_range=%u", lg_range);
+	}
+}
+
+TEST_BEGIN(test_prng_lg_range_u32_nonatomic) {
+	test_prng_lg_range_u32(false);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_lg_range_u32_atomic) {
+	test_prng_lg_range_u32(true);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_lg_range_u64_nonatomic) {
+	test_prng_lg_range_u64();
+}
+TEST_END
+
+TEST_BEGIN(test_prng_lg_range_zu_nonatomic) {
+	test_prng_lg_range_zu(false);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_lg_range_zu_atomic) {
+	test_prng_lg_range_zu(true);
+}
+TEST_END
+
+static void
+test_prng_range_u32(bool atomic) {
+	uint32_t range;
+#define MAX_RANGE	10000000
+#define RANGE_STEP	97
+#define NREPS		10
+
+	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
+		atomic_u32_t s;
+		unsigned rep;
+
+		atomic_store_u32(&s, range, ATOMIC_RELAXED);
+		for (rep = 0; rep < NREPS; rep++) {
+			uint32_t r = prng_range_u32(&s, range, atomic);
+
+			assert_u32_lt(r, range, "Out of range");
+		}
+	}
+}
+
+static void
+test_prng_range_u64(void) {
+	uint64_t range;
+#define MAX_RANGE	10000000
+#define RANGE_STEP	97
+#define NREPS		10
+
+	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
+		uint64_t s;
+		unsigned rep;
+
+		s = range;
+		for (rep = 0; rep < NREPS; rep++) {
+			uint64_t r = prng_range_u64(&s, range);
+
+			assert_u64_lt(r, range, "Out of range");
+		}
+	}
+}
+
+static void
+test_prng_range_zu(bool atomic) {
+	size_t range;
+#define MAX_RANGE	10000000
+#define RANGE_STEP	97
+#define NREPS		10
+
+	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
+		atomic_zu_t s;
+		unsigned rep;
+
+		atomic_store_zu(&s, range, ATOMIC_RELAXED);
+		for (rep = 0; rep < NREPS; rep++) {
+			size_t r = prng_range_zu(&s, range, atomic);
+
+			assert_zu_lt(r, range, "Out of range");
+		}
+	}
+}
+
+TEST_BEGIN(test_prng_range_u32_nonatomic) {
+	test_prng_range_u32(false);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_range_u32_atomic) {
+	test_prng_range_u32(true);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_range_u64_nonatomic) {
+	test_prng_range_u64();
+}
+TEST_END
+
+TEST_BEGIN(test_prng_range_zu_nonatomic) {
+	test_prng_range_zu(false);
+}
+TEST_END
+
+TEST_BEGIN(test_prng_range_zu_atomic) {
+	test_prng_range_zu(true);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_prng_lg_range_u32_nonatomic,
+	    test_prng_lg_range_u32_atomic,
+	    test_prng_lg_range_u64_nonatomic,
+	    test_prng_lg_range_zu_nonatomic,
+	    test_prng_lg_range_zu_atomic,
+	    test_prng_range_u32_nonatomic,
+	    test_prng_range_u32_atomic,
+	    test_prng_range_u64_nonatomic,
+	    test_prng_range_zu_nonatomic,
+	    test_prng_range_zu_atomic);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_accum.c b/redis-stable/deps/jemalloc/test/unit/prof_accum.c
new file mode 100644
index 00000000..25220063
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_accum.c
@@ -0,0 +1,81 @@
+#include "test/jemalloc_test.h"
+
+#define NTHREADS		4
+#define NALLOCS_PER_THREAD	50
+#define DUMP_INTERVAL		1
+#define BT_COUNT_CHECK_INTERVAL	5
+
+static int
+prof_dump_open_intercept(bool propagate_err, const char *filename) {
+	int fd;
+
+	fd = open("/dev/null", O_WRONLY);
+	assert_d_ne(fd, -1, "Unexpected open() failure");
+
+	return fd;
+}
+
+static void *
+alloc_from_permuted_backtrace(unsigned thd_ind, unsigned iteration) {
+	return btalloc(1, thd_ind*NALLOCS_PER_THREAD + iteration);
+}
+
+static void *
+thd_start(void *varg) {
+	unsigned thd_ind = *(unsigned *)varg;
+	size_t bt_count_prev, bt_count;
+	unsigned i_prev, i;
+
+	i_prev = 0;
+	bt_count_prev = 0;
+	for (i = 0; i < NALLOCS_PER_THREAD; i++) {
+		void *p = alloc_from_permuted_backtrace(thd_ind, i);
+		dallocx(p, 0);
+		if (i % DUMP_INTERVAL == 0) {
+			assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
+			    0, "Unexpected error while dumping heap profile");
+		}
+
+		if (i % BT_COUNT_CHECK_INTERVAL == 0 ||
+		    i+1 == NALLOCS_PER_THREAD) {
+			bt_count = prof_bt_count();
+			assert_zu_le(bt_count_prev+(i-i_prev), bt_count,
+			    "Expected larger backtrace count increase");
+			i_prev = i;
+			bt_count_prev = bt_count;
+		}
+	}
+
+	return NULL;
+}
+
+TEST_BEGIN(test_idump) {
+	bool active;
+	thd_t thds[NTHREADS];
+	unsigned thd_args[NTHREADS];
+	unsigned i;
+
+	test_skip_if(!config_prof);
+
+	active = true;
+	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
+	    sizeof(active)), 0,
+	    "Unexpected mallctl failure while activating profiling");
+
+	prof_dump_open = prof_dump_open_intercept;
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_args[i] = i;
+		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
+	}
+	for (i = 0; i < NTHREADS; i++) {
+		thd_join(thds[i], NULL);
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_idump);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_accum.sh b/redis-stable/deps/jemalloc/test/unit/prof_accum.sh
new file mode 100644
index 00000000..b3e13fc5
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_accum.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,prof_accum:true,prof_active:false,lg_prof_sample:0"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_active.c b/redis-stable/deps/jemalloc/test/unit/prof_active.c
new file mode 100644
index 00000000..850a24a7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_active.c
@@ -0,0 +1,117 @@
+#include "test/jemalloc_test.h"
+
+static void
+mallctl_bool_get(const char *name, bool expected, const char *func, int line) {
+	bool old;
+	size_t sz;
+
+	sz = sizeof(old);
+	assert_d_eq(mallctl(name, (void *)&old, &sz, NULL, 0), 0,
+	    "%s():%d: Unexpected mallctl failure reading %s", func, line, name);
+	assert_b_eq(old, expected, "%s():%d: Unexpected %s value", func, line,
+	    name);
+}
+
+static void
+mallctl_bool_set(const char *name, bool old_expected, bool val_new,
+    const char *func, int line) {
+	bool old;
+	size_t sz;
+
+	sz = sizeof(old);
+	assert_d_eq(mallctl(name, (void *)&old, &sz, (void *)&val_new,
+	    sizeof(val_new)), 0,
+	    "%s():%d: Unexpected mallctl failure reading/writing %s", func,
+	    line, name);
+	assert_b_eq(old, old_expected, "%s():%d: Unexpected %s value", func,
+	    line, name);
+}
+
+static void
+mallctl_prof_active_get_impl(bool prof_active_old_expected, const char *func,
+    int line) {
+	mallctl_bool_get("prof.active", prof_active_old_expected, func, line);
+}
+#define mallctl_prof_active_get(a)					\
+	mallctl_prof_active_get_impl(a, __func__, __LINE__)
+
+static void
+mallctl_prof_active_set_impl(bool prof_active_old_expected,
+    bool prof_active_new, const char *func, int line) {
+	mallctl_bool_set("prof.active", prof_active_old_expected,
+	    prof_active_new, func, line);
+}
+#define mallctl_prof_active_set(a, b)					\
+	mallctl_prof_active_set_impl(a, b, __func__, __LINE__)
+
+static void
+mallctl_thread_prof_active_get_impl(bool thread_prof_active_old_expected,
+    const char *func, int line) {
+	mallctl_bool_get("thread.prof.active", thread_prof_active_old_expected,
+	    func, line);
+}
+#define mallctl_thread_prof_active_get(a)				\
+	mallctl_thread_prof_active_get_impl(a, __func__, __LINE__)
+
+static void
+mallctl_thread_prof_active_set_impl(bool thread_prof_active_old_expected,
+    bool thread_prof_active_new, const char *func, int line) {
+	mallctl_bool_set("thread.prof.active", thread_prof_active_old_expected,
+	    thread_prof_active_new, func, line);
+}
+#define mallctl_thread_prof_active_set(a, b)				\
+	mallctl_thread_prof_active_set_impl(a, b, __func__, __LINE__)
+
+static void
+prof_sampling_probe_impl(bool expect_sample, const char *func, int line) {
+	void *p;
+	size_t expected_backtraces = expect_sample ? 1 : 0;
+
+	assert_zu_eq(prof_bt_count(), 0, "%s():%d: Expected 0 backtraces", func,
+	    line);
+	p = mallocx(1, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	assert_zu_eq(prof_bt_count(), expected_backtraces,
+	    "%s():%d: Unexpected backtrace count", func, line);
+	dallocx(p, 0);
+}
+#define prof_sampling_probe(a)						\
+	prof_sampling_probe_impl(a, __func__, __LINE__)
+
+TEST_BEGIN(test_prof_active) {
+	test_skip_if(!config_prof);
+
+	mallctl_prof_active_get(true);
+	mallctl_thread_prof_active_get(false);
+
+	mallctl_prof_active_set(true, true);
+	mallctl_thread_prof_active_set(false, false);
+	/* prof.active, !thread.prof.active. */
+	prof_sampling_probe(false);
+
+	mallctl_prof_active_set(true, false);
+	mallctl_thread_prof_active_set(false, false);
+	/* !prof.active, !thread.prof.active. */
+	prof_sampling_probe(false);
+
+	mallctl_prof_active_set(false, false);
+	mallctl_thread_prof_active_set(false, true);
+	/* !prof.active, thread.prof.active. */
+	prof_sampling_probe(false);
+
+	mallctl_prof_active_set(false, true);
+	mallctl_thread_prof_active_set(true, true);
+	/* prof.active, thread.prof.active. */
+	prof_sampling_probe(true);
+
+	/* Restore settings. */
+	mallctl_prof_active_set(true, true);
+	mallctl_thread_prof_active_set(true, false);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_prof_active);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_active.sh b/redis-stable/deps/jemalloc/test/unit/prof_active.sh
new file mode 100644
index 00000000..0167cb10
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_active.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,prof_thread_active_init:false,lg_prof_sample:0"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_gdump.c b/redis-stable/deps/jemalloc/test/unit/prof_gdump.c
new file mode 100644
index 00000000..fcb434cb
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_gdump.c
@@ -0,0 +1,74 @@
+#include "test/jemalloc_test.h"
+
+static bool did_prof_dump_open;
+
+static int
+prof_dump_open_intercept(bool propagate_err, const char *filename) {
+	int fd;
+
+	did_prof_dump_open = true;
+
+	fd = open("/dev/null", O_WRONLY);
+	assert_d_ne(fd, -1, "Unexpected open() failure");
+
+	return fd;
+}
+
+TEST_BEGIN(test_gdump) {
+	bool active, gdump, gdump_old;
+	void *p, *q, *r, *s;
+	size_t sz;
+
+	test_skip_if(!config_prof);
+
+	active = true;
+	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
+	    sizeof(active)), 0,
+	    "Unexpected mallctl failure while activating profiling");
+
+	prof_dump_open = prof_dump_open_intercept;
+
+	did_prof_dump_open = false;
+	p = mallocx((1U << LG_LARGE_MINCLASS), 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	assert_true(did_prof_dump_open, "Expected a profile dump");
+
+	did_prof_dump_open = false;
+	q = mallocx((1U << LG_LARGE_MINCLASS), 0);
+	assert_ptr_not_null(q, "Unexpected mallocx() failure");
+	assert_true(did_prof_dump_open, "Expected a profile dump");
+
+	gdump = false;
+	sz = sizeof(gdump_old);
+	assert_d_eq(mallctl("prof.gdump", (void *)&gdump_old, &sz,
+	    (void *)&gdump, sizeof(gdump)), 0,
+	    "Unexpected mallctl failure while disabling prof.gdump");
+	assert(gdump_old);
+	did_prof_dump_open = false;
+	r = mallocx((1U << LG_LARGE_MINCLASS), 0);
+	assert_ptr_not_null(q, "Unexpected mallocx() failure");
+	assert_false(did_prof_dump_open, "Unexpected profile dump");
+
+	gdump = true;
+	sz = sizeof(gdump_old);
+	assert_d_eq(mallctl("prof.gdump", (void *)&gdump_old, &sz,
+	    (void *)&gdump, sizeof(gdump)), 0,
+	    "Unexpected mallctl failure while enabling prof.gdump");
+	assert(!gdump_old);
+	did_prof_dump_open = false;
+	s = mallocx((1U << LG_LARGE_MINCLASS), 0);
+	assert_ptr_not_null(q, "Unexpected mallocx() failure");
+	assert_true(did_prof_dump_open, "Expected a profile dump");
+
+	dallocx(p, 0);
+	dallocx(q, 0);
+	dallocx(r, 0);
+	dallocx(s, 0);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_gdump);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh b/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
new file mode 100644
index 00000000..3f600d20
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
@@ -0,0 +1,6 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,prof_active:false,prof_gdump:true"
+fi
+
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_idump.c b/redis-stable/deps/jemalloc/test/unit/prof_idump.c
new file mode 100644
index 00000000..1cc6c98c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_idump.c
@@ -0,0 +1,42 @@
+#include "test/jemalloc_test.h"
+
+static bool did_prof_dump_open;
+
+static int
+prof_dump_open_intercept(bool propagate_err, const char *filename) {
+	int fd;
+
+	did_prof_dump_open = true;
+
+	fd = open("/dev/null", O_WRONLY);
+	assert_d_ne(fd, -1, "Unexpected open() failure");
+
+	return fd;
+}
+
+TEST_BEGIN(test_idump) {
+	bool active;
+	void *p;
+
+	test_skip_if(!config_prof);
+
+	active = true;
+	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
+	    sizeof(active)), 0,
+	    "Unexpected mallctl failure while activating profiling");
+
+	prof_dump_open = prof_dump_open_intercept;
+
+	did_prof_dump_open = false;
+	p = mallocx(1, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	dallocx(p, 0);
+	assert_true(did_prof_dump_open, "Expected a profile dump");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_idump);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_idump.sh b/redis-stable/deps/jemalloc/test/unit/prof_idump.sh
new file mode 100644
index 00000000..4dc599a3
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_idump.sh
@@ -0,0 +1,8 @@
+#!/bin/sh
+
+export MALLOC_CONF="tcache:false"
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="${MALLOC_CONF},prof:true,prof_accum:true,prof_active:false,lg_prof_sample:0,lg_prof_interval:0"
+fi
+
+
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_reset.c b/redis-stable/deps/jemalloc/test/unit/prof_reset.c
new file mode 100644
index 00000000..7cce42d2
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_reset.c
@@ -0,0 +1,286 @@
+#include "test/jemalloc_test.h"
+
+static int
+prof_dump_open_intercept(bool propagate_err, const char *filename) {
+	int fd;
+
+	fd = open("/dev/null", O_WRONLY);
+	assert_d_ne(fd, -1, "Unexpected open() failure");
+
+	return fd;
+}
+
+static void
+set_prof_active(bool active) {
+	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
+	    sizeof(active)), 0, "Unexpected mallctl failure");
+}
+
+static size_t
+get_lg_prof_sample(void) {
+	size_t lg_prof_sample;
+	size_t sz = sizeof(size_t);
+
+	assert_d_eq(mallctl("prof.lg_sample", (void *)&lg_prof_sample, &sz,
+	    NULL, 0), 0,
+	    "Unexpected mallctl failure while reading profiling sample rate");
+	return lg_prof_sample;
+}
+
+static void
+do_prof_reset(size_t lg_prof_sample) {
+	assert_d_eq(mallctl("prof.reset", NULL, NULL,
+	    (void *)&lg_prof_sample, sizeof(size_t)), 0,
+	    "Unexpected mallctl failure while resetting profile data");
+	assert_zu_eq(lg_prof_sample, get_lg_prof_sample(),
+	    "Expected profile sample rate change");
+}
+
+TEST_BEGIN(test_prof_reset_basic) {
+	size_t lg_prof_sample_orig, lg_prof_sample, lg_prof_sample_next;
+	size_t sz;
+	unsigned i;
+
+	test_skip_if(!config_prof);
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("opt.lg_prof_sample", (void *)&lg_prof_sample_orig,
+	    &sz, NULL, 0), 0,
+	    "Unexpected mallctl failure while reading profiling sample rate");
+	assert_zu_eq(lg_prof_sample_orig, 0,
+	    "Unexpected profiling sample rate");
+	lg_prof_sample = get_lg_prof_sample();
+	assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
+	    "Unexpected disagreement between \"opt.lg_prof_sample\" and "
+	    "\"prof.lg_sample\"");
+
+	/* Test simple resets. */
+	for (i = 0; i < 2; i++) {
+		assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
+		    "Unexpected mallctl failure while resetting profile data");
+		lg_prof_sample = get_lg_prof_sample();
+		assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
+		    "Unexpected profile sample rate change");
+	}
+
+	/* Test resets with prof.lg_sample changes. */
+	lg_prof_sample_next = 1;
+	for (i = 0; i < 2; i++) {
+		do_prof_reset(lg_prof_sample_next);
+		lg_prof_sample = get_lg_prof_sample();
+		assert_zu_eq(lg_prof_sample, lg_prof_sample_next,
+		    "Expected profile sample rate change");
+		lg_prof_sample_next = lg_prof_sample_orig;
+	}
+
+	/* Make sure the test code restored prof.lg_sample. */
+	lg_prof_sample = get_lg_prof_sample();
+	assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
+	    "Unexpected disagreement between \"opt.lg_prof_sample\" and "
+	    "\"prof.lg_sample\"");
+}
+TEST_END
+
+bool prof_dump_header_intercepted = false;
+prof_cnt_t cnt_all_copy = {0, 0, 0, 0};
+static bool
+prof_dump_header_intercept(tsdn_t *tsdn, bool propagate_err,
+    const prof_cnt_t *cnt_all) {
+	prof_dump_header_intercepted = true;
+	memcpy(&cnt_all_copy, cnt_all, sizeof(prof_cnt_t));
+
+	return false;
+}
+
+TEST_BEGIN(test_prof_reset_cleanup) {
+	void *p;
+	prof_dump_header_t *prof_dump_header_orig;
+
+	test_skip_if(!config_prof);
+
+	set_prof_active(true);
+
+	assert_zu_eq(prof_bt_count(), 0, "Expected 0 backtraces");
+	p = mallocx(1, 0);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	assert_zu_eq(prof_bt_count(), 1, "Expected 1 backtrace");
+
+	prof_dump_header_orig = prof_dump_header;
+	prof_dump_header = prof_dump_header_intercept;
+	assert_false(prof_dump_header_intercepted, "Unexpected intercept");
+
+	assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
+	    0, "Unexpected error while dumping heap profile");
+	assert_true(prof_dump_header_intercepted, "Expected intercept");
+	assert_u64_eq(cnt_all_copy.curobjs, 1, "Expected 1 allocation");
+
+	assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
+	    "Unexpected error while resetting heap profile data");
+	assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
+	    0, "Unexpected error while dumping heap profile");
+	assert_u64_eq(cnt_all_copy.curobjs, 0, "Expected 0 allocations");
+	assert_zu_eq(prof_bt_count(), 1, "Expected 1 backtrace");
+
+	prof_dump_header = prof_dump_header_orig;
+
+	dallocx(p, 0);
+	assert_zu_eq(prof_bt_count(), 0, "Expected 0 backtraces");
+
+	set_prof_active(false);
+}
+TEST_END
+
+#define NTHREADS		4
+#define NALLOCS_PER_THREAD	(1U << 13)
+#define OBJ_RING_BUF_COUNT	1531
+#define RESET_INTERVAL		(1U << 10)
+#define DUMP_INTERVAL		3677
+static void *
+thd_start(void *varg) {
+	unsigned thd_ind = *(unsigned *)varg;
+	unsigned i;
+	void *objs[OBJ_RING_BUF_COUNT];
+
+	memset(objs, 0, sizeof(objs));
+
+	for (i = 0; i < NALLOCS_PER_THREAD; i++) {
+		if (i % RESET_INTERVAL == 0) {
+			assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0),
+			    0, "Unexpected error while resetting heap profile "
+			    "data");
+		}
+
+		if (i % DUMP_INTERVAL == 0) {
+			assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
+			    0, "Unexpected error while dumping heap profile");
+		}
+
+		{
+			void **pp = &objs[i % OBJ_RING_BUF_COUNT];
+			if (*pp != NULL) {
+				dallocx(*pp, 0);
+				*pp = NULL;
+			}
+			*pp = btalloc(1, thd_ind*NALLOCS_PER_THREAD + i);
+			assert_ptr_not_null(*pp,
+			    "Unexpected btalloc() failure");
+		}
+	}
+
+	/* Clean up any remaining objects. */
+	for (i = 0; i < OBJ_RING_BUF_COUNT; i++) {
+		void **pp = &objs[i % OBJ_RING_BUF_COUNT];
+		if (*pp != NULL) {
+			dallocx(*pp, 0);
+			*pp = NULL;
+		}
+	}
+
+	return NULL;
+}
+
+TEST_BEGIN(test_prof_reset) {
+	size_t lg_prof_sample_orig;
+	thd_t thds[NTHREADS];
+	unsigned thd_args[NTHREADS];
+	unsigned i;
+	size_t bt_count, tdata_count;
+
+	test_skip_if(!config_prof);
+
+	bt_count = prof_bt_count();
+	assert_zu_eq(bt_count, 0,
+	    "Unexpected pre-existing tdata structures");
+	tdata_count = prof_tdata_count();
+
+	lg_prof_sample_orig = get_lg_prof_sample();
+	do_prof_reset(5);
+
+	set_prof_active(true);
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_args[i] = i;
+		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
+	}
+	for (i = 0; i < NTHREADS; i++) {
+		thd_join(thds[i], NULL);
+	}
+
+	assert_zu_eq(prof_bt_count(), bt_count,
+	    "Unexpected bactrace count change");
+	assert_zu_eq(prof_tdata_count(), tdata_count,
+	    "Unexpected remaining tdata structures");
+
+	set_prof_active(false);
+
+	do_prof_reset(lg_prof_sample_orig);
+}
+TEST_END
+#undef NTHREADS
+#undef NALLOCS_PER_THREAD
+#undef OBJ_RING_BUF_COUNT
+#undef RESET_INTERVAL
+#undef DUMP_INTERVAL
+
+/* Test sampling at the same allocation site across resets. */
+#define NITER 10
+TEST_BEGIN(test_xallocx) {
+	size_t lg_prof_sample_orig;
+	unsigned i;
+	void *ptrs[NITER];
+
+	test_skip_if(!config_prof);
+
+	lg_prof_sample_orig = get_lg_prof_sample();
+	set_prof_active(true);
+
+	/* Reset profiling. */
+	do_prof_reset(0);
+
+	for (i = 0; i < NITER; i++) {
+		void *p;
+		size_t sz, nsz;
+
+		/* Reset profiling. */
+		do_prof_reset(0);
+
+		/* Allocate small object (which will be promoted). */
+		p = ptrs[i] = mallocx(1, 0);
+		assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+		/* Reset profiling. */
+		do_prof_reset(0);
+
+		/* Perform successful xallocx(). */
+		sz = sallocx(p, 0);
+		assert_zu_eq(xallocx(p, sz, 0, 0), sz,
+		    "Unexpected xallocx() failure");
+
+		/* Perform unsuccessful xallocx(). */
+		nsz = nallocx(sz+1, 0);
+		assert_zu_eq(xallocx(p, nsz, 0, 0), sz,
+		    "Unexpected xallocx() success");
+	}
+
+	for (i = 0; i < NITER; i++) {
+		/* dallocx. */
+		dallocx(ptrs[i], 0);
+	}
+
+	set_prof_active(false);
+	do_prof_reset(lg_prof_sample_orig);
+}
+TEST_END
+#undef NITER
+
+int
+main(void) {
+	/* Intercept dumping prior to running any tests. */
+	prof_dump_open = prof_dump_open_intercept;
+
+	return test_no_reentrancy(
+	    test_prof_reset_basic,
+	    test_prof_reset_cleanup,
+	    test_prof_reset,
+	    test_xallocx);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_reset.sh b/redis-stable/deps/jemalloc/test/unit/prof_reset.sh
new file mode 100644
index 00000000..43c516a0
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_reset.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,prof_active:false,lg_prof_sample:0"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_tctx.c b/redis-stable/deps/jemalloc/test/unit/prof_tctx.c
new file mode 100644
index 00000000..ff3b2b0c
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_tctx.c
@@ -0,0 +1,46 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_prof_realloc) {
+	tsdn_t *tsdn;
+	int flags;
+	void *p, *q;
+	prof_tctx_t *tctx_p, *tctx_q;
+	uint64_t curobjs_0, curobjs_1, curobjs_2, curobjs_3;
+
+	test_skip_if(!config_prof);
+
+	tsdn = tsdn_fetch();
+	flags = MALLOCX_TCACHE_NONE;
+
+	prof_cnt_all(&curobjs_0, NULL, NULL, NULL);
+	p = mallocx(1024, flags);
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+	tctx_p = prof_tctx_get(tsdn, p, NULL);
+	assert_ptr_ne(tctx_p, (prof_tctx_t *)(uintptr_t)1U,
+	    "Expected valid tctx");
+	prof_cnt_all(&curobjs_1, NULL, NULL, NULL);
+	assert_u64_eq(curobjs_0 + 1, curobjs_1,
+	    "Allocation should have increased sample size");
+
+	q = rallocx(p, 2048, flags);
+	assert_ptr_ne(p, q, "Expected move");
+	assert_ptr_not_null(p, "Unexpected rmallocx() failure");
+	tctx_q = prof_tctx_get(tsdn, q, NULL);
+	assert_ptr_ne(tctx_q, (prof_tctx_t *)(uintptr_t)1U,
+	    "Expected valid tctx");
+	prof_cnt_all(&curobjs_2, NULL, NULL, NULL);
+	assert_u64_eq(curobjs_1, curobjs_2,
+	    "Reallocation should not have changed sample size");
+
+	dallocx(q, flags);
+	prof_cnt_all(&curobjs_3, NULL, NULL, NULL);
+	assert_u64_eq(curobjs_0, curobjs_3,
+	    "Sample size should have returned to base level");
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_prof_realloc);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh b/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
new file mode 100644
index 00000000..8fcc7d8a
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,lg_prof_sample:0"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
new file mode 100644
index 00000000..c9c2a2b7
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
@@ -0,0 +1,120 @@
+#include "test/jemalloc_test.h"
+
+static void
+mallctl_thread_name_get_impl(const char *thread_name_expected, const char *func,
+    int line) {
+	const char *thread_name_old;
+	size_t sz;
+
+	sz = sizeof(thread_name_old);
+	assert_d_eq(mallctl("thread.prof.name", (void *)&thread_name_old, &sz,
+	    NULL, 0), 0,
+	    "%s():%d: Unexpected mallctl failure reading thread.prof.name",
+	    func, line);
+	assert_str_eq(thread_name_old, thread_name_expected,
+	    "%s():%d: Unexpected thread.prof.name value", func, line);
+}
+#define mallctl_thread_name_get(a)					\
+	mallctl_thread_name_get_impl(a, __func__, __LINE__)
+
+static void
+mallctl_thread_name_set_impl(const char *thread_name, const char *func,
+    int line) {
+	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
+	    (void *)&thread_name, sizeof(thread_name)), 0,
+	    "%s():%d: Unexpected mallctl failure reading thread.prof.name",
+	    func, line);
+	mallctl_thread_name_get_impl(thread_name, func, line);
+}
+#define mallctl_thread_name_set(a)					\
+	mallctl_thread_name_set_impl(a, __func__, __LINE__)
+
+TEST_BEGIN(test_prof_thread_name_validation) {
+	const char *thread_name;
+
+	test_skip_if(!config_prof);
+
+	mallctl_thread_name_get("");
+	mallctl_thread_name_set("hi there");
+
+	/* NULL input shouldn't be allowed. */
+	thread_name = NULL;
+	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
+	    (void *)&thread_name, sizeof(thread_name)), EFAULT,
+	    "Unexpected mallctl result writing \"%s\" to thread.prof.name",
+	    thread_name);
+
+	/* '\n' shouldn't be allowed. */
+	thread_name = "hi\nthere";
+	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
+	    (void *)&thread_name, sizeof(thread_name)), EFAULT,
+	    "Unexpected mallctl result writing \"%s\" to thread.prof.name",
+	    thread_name);
+
+	/* Simultaneous read/write shouldn't be allowed. */
+	{
+		const char *thread_name_old;
+		size_t sz;
+
+		sz = sizeof(thread_name_old);
+		assert_d_eq(mallctl("thread.prof.name",
+		    (void *)&thread_name_old, &sz, (void *)&thread_name,
+		    sizeof(thread_name)), EPERM,
+		    "Unexpected mallctl result writing \"%s\" to "
+		    "thread.prof.name", thread_name);
+	}
+
+	mallctl_thread_name_set("");
+}
+TEST_END
+
+#define NTHREADS	4
+#define NRESET		25
+static void *
+thd_start(void *varg) {
+	unsigned thd_ind = *(unsigned *)varg;
+	char thread_name[16] = "";
+	unsigned i;
+
+	malloc_snprintf(thread_name, sizeof(thread_name), "thread %u", thd_ind);
+
+	mallctl_thread_name_get("");
+	mallctl_thread_name_set(thread_name);
+
+	for (i = 0; i < NRESET; i++) {
+		assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
+		    "Unexpected error while resetting heap profile data");
+		mallctl_thread_name_get(thread_name);
+	}
+
+	mallctl_thread_name_set(thread_name);
+	mallctl_thread_name_set("");
+
+	return NULL;
+}
+
+TEST_BEGIN(test_prof_thread_name_threaded) {
+	thd_t thds[NTHREADS];
+	unsigned thd_args[NTHREADS];
+	unsigned i;
+
+	test_skip_if(!config_prof);
+
+	for (i = 0; i < NTHREADS; i++) {
+		thd_args[i] = i;
+		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
+	}
+	for (i = 0; i < NTHREADS; i++) {
+		thd_join(thds[i], NULL);
+	}
+}
+TEST_END
+#undef NTHREADS
+#undef NRESET
+
+int
+main(void) {
+	return test(
+	    test_prof_thread_name_validation,
+	    test_prof_thread_name_threaded);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
new file mode 100644
index 00000000..298c1058
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_prof}" = "x1" ] ; then
+  export MALLOC_CONF="prof:true,prof_active:false"
+fi
diff --git a/redis-stable/deps/jemalloc/test/unit/ql.c b/redis-stable/deps/jemalloc/test/unit/ql.c
new file mode 100644
index 00000000..b76c24c4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/ql.c
@@ -0,0 +1,204 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/ql.h"
+
+/* Number of ring entries, in [2..26]. */
+#define NENTRIES 9
+
+typedef struct list_s list_t;
+typedef ql_head(list_t) list_head_t;
+
+struct list_s {
+	ql_elm(list_t) link;
+	char id;
+};
+
+static void
+test_empty_list(list_head_t *head) {
+	list_t *t;
+	unsigned i;
+
+	assert_ptr_null(ql_first(head), "Unexpected element for empty list");
+	assert_ptr_null(ql_last(head, link),
+	    "Unexpected element for empty list");
+
+	i = 0;
+	ql_foreach(t, head, link) {
+		i++;
+	}
+	assert_u_eq(i, 0, "Unexpected element for empty list");
+
+	i = 0;
+	ql_reverse_foreach(t, head, link) {
+		i++;
+	}
+	assert_u_eq(i, 0, "Unexpected element for empty list");
+}
+
+TEST_BEGIN(test_ql_empty) {
+	list_head_t head;
+
+	ql_new(&head);
+	test_empty_list(&head);
+}
+TEST_END
+
+static void
+init_entries(list_t *entries, unsigned nentries) {
+	unsigned i;
+
+	for (i = 0; i < nentries; i++) {
+		entries[i].id = 'a' + i;
+		ql_elm_new(&entries[i], link);
+	}
+}
+
+static void
+test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
+	list_t *t;
+	unsigned i;
+
+	assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
+	assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
+	    "Element id mismatch");
+
+	i = 0;
+	ql_foreach(t, head, link) {
+		assert_c_eq(t->id, entries[i].id, "Element id mismatch");
+		i++;
+	}
+
+	i = 0;
+	ql_reverse_foreach(t, head, link) {
+		assert_c_eq(t->id, entries[nentries-i-1].id,
+		    "Element id mismatch");
+		i++;
+	}
+
+	for (i = 0; i < nentries-1; i++) {
+		t = ql_next(head, &entries[i], link);
+		assert_c_eq(t->id, entries[i+1].id, "Element id mismatch");
+	}
+	assert_ptr_null(ql_next(head, &entries[nentries-1], link),
+	    "Unexpected element");
+
+	assert_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");
+	for (i = 1; i < nentries; i++) {
+		t = ql_prev(head, &entries[i], link);
+		assert_c_eq(t->id, entries[i-1].id, "Element id mismatch");
+	}
+}
+
+TEST_BEGIN(test_ql_tail_insert) {
+	list_head_t head;
+	list_t entries[NENTRIES];
+	unsigned i;
+
+	ql_new(&head);
+	init_entries(entries, sizeof(entries)/sizeof(list_t));
+	for (i = 0; i < NENTRIES; i++) {
+		ql_tail_insert(&head, &entries[i], link);
+	}
+
+	test_entries_list(&head, entries, NENTRIES);
+}
+TEST_END
+
+TEST_BEGIN(test_ql_tail_remove) {
+	list_head_t head;
+	list_t entries[NENTRIES];
+	unsigned i;
+
+	ql_new(&head);
+	init_entries(entries, sizeof(entries)/sizeof(list_t));
+	for (i = 0; i < NENTRIES; i++) {
+		ql_tail_insert(&head, &entries[i], link);
+	}
+
+	for (i = 0; i < NENTRIES; i++) {
+		test_entries_list(&head, entries, NENTRIES-i);
+		ql_tail_remove(&head, list_t, link);
+	}
+	test_empty_list(&head);
+}
+TEST_END
+
+TEST_BEGIN(test_ql_head_insert) {
+	list_head_t head;
+	list_t entries[NENTRIES];
+	unsigned i;
+
+	ql_new(&head);
+	init_entries(entries, sizeof(entries)/sizeof(list_t));
+	for (i = 0; i < NENTRIES; i++) {
+		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
+	}
+
+	test_entries_list(&head, entries, NENTRIES);
+}
+TEST_END
+
+TEST_BEGIN(test_ql_head_remove) {
+	list_head_t head;
+	list_t entries[NENTRIES];
+	unsigned i;
+
+	ql_new(&head);
+	init_entries(entries, sizeof(entries)/sizeof(list_t));
+	for (i = 0; i < NENTRIES; i++) {
+		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
+	}
+
+	for (i = 0; i < NENTRIES; i++) {
+		test_entries_list(&head, &entries[i], NENTRIES-i);
+		ql_head_remove(&head, list_t, link);
+	}
+	test_empty_list(&head);
+}
+TEST_END
+
+TEST_BEGIN(test_ql_insert) {
+	list_head_t head;
+	list_t entries[8];
+	list_t *a, *b, *c, *d, *e, *f, *g, *h;
+
+	ql_new(&head);
+	init_entries(entries, sizeof(entries)/sizeof(list_t));
+	a = &entries[0];
+	b = &entries[1];
+	c = &entries[2];
+	d = &entries[3];
+	e = &entries[4];
+	f = &entries[5];
+	g = &entries[6];
+	h = &entries[7];
+
+	/*
+	 * ql_remove(), ql_before_insert(), and ql_after_insert() are used
+	 * internally by other macros that are already tested, so there's no
+	 * need to test them completely.  However, insertion/deletion from the
+	 * middle of lists is not otherwise tested; do so here.
+	 */
+	ql_tail_insert(&head, f, link);
+	ql_before_insert(&head, f, b, link);
+	ql_before_insert(&head, f, c, link);
+	ql_after_insert(f, h, link);
+	ql_after_insert(f, g, link);
+	ql_before_insert(&head, b, a, link);
+	ql_after_insert(c, d, link);
+	ql_before_insert(&head, f, e, link);
+
+	test_entries_list(&head, entries, sizeof(entries)/sizeof(list_t));
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_ql_empty,
+	    test_ql_tail_insert,
+	    test_ql_tail_remove,
+	    test_ql_head_insert,
+	    test_ql_head_remove,
+	    test_ql_insert);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/qr.c b/redis-stable/deps/jemalloc/test/unit/qr.c
new file mode 100644
index 00000000..271a1095
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/qr.c
@@ -0,0 +1,243 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/qr.h"
+
+/* Number of ring entries, in [2..26]. */
+#define NENTRIES 9
+/* Split index, in [1..NENTRIES). */
+#define SPLIT_INDEX 5
+
+typedef struct ring_s ring_t;
+
+struct ring_s {
+	qr(ring_t) link;
+	char id;
+};
+
+static void
+init_entries(ring_t *entries) {
+	unsigned i;
+
+	for (i = 0; i < NENTRIES; i++) {
+		qr_new(&entries[i], link);
+		entries[i].id = 'a' + i;
+	}
+}
+
+static void
+test_independent_entries(ring_t *entries) {
+	ring_t *t;
+	unsigned i, j;
+
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_foreach(t, &entries[i], link) {
+			j++;
+		}
+		assert_u_eq(j, 1,
+		    "Iteration over single-element ring should visit precisely "
+		    "one element");
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_reverse_foreach(t, &entries[i], link) {
+			j++;
+		}
+		assert_u_eq(j, 1,
+		    "Iteration over single-element ring should visit precisely "
+		    "one element");
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_next(&entries[i], link);
+		assert_ptr_eq(t, &entries[i],
+		    "Next element in single-element ring should be same as "
+		    "current element");
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_prev(&entries[i], link);
+		assert_ptr_eq(t, &entries[i],
+		    "Previous element in single-element ring should be same as "
+		    "current element");
+	}
+}
+
+TEST_BEGIN(test_qr_one) {
+	ring_t entries[NENTRIES];
+
+	init_entries(entries);
+	test_independent_entries(entries);
+}
+TEST_END
+
+static void
+test_entries_ring(ring_t *entries) {
+	ring_t *t;
+	unsigned i, j;
+
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[(i+j) % NENTRIES].id,
+			    "Element id mismatch");
+			j++;
+		}
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_reverse_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[(NENTRIES+i-j-1) %
+			    NENTRIES].id, "Element id mismatch");
+			j++;
+		}
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_next(&entries[i], link);
+		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,
+		    "Element id mismatch");
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_prev(&entries[i], link);
+		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,
+		    "Element id mismatch");
+	}
+}
+
+TEST_BEGIN(test_qr_after_insert) {
+	ring_t entries[NENTRIES];
+	unsigned i;
+
+	init_entries(entries);
+	for (i = 1; i < NENTRIES; i++) {
+		qr_after_insert(&entries[i - 1], &entries[i], link);
+	}
+	test_entries_ring(entries);
+}
+TEST_END
+
+TEST_BEGIN(test_qr_remove) {
+	ring_t entries[NENTRIES];
+	ring_t *t;
+	unsigned i, j;
+
+	init_entries(entries);
+	for (i = 1; i < NENTRIES; i++) {
+		qr_after_insert(&entries[i - 1], &entries[i], link);
+	}
+
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[i+j].id,
+			    "Element id mismatch");
+			j++;
+		}
+		j = 0;
+		qr_reverse_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[NENTRIES - 1 - j].id,
+			"Element id mismatch");
+			j++;
+		}
+		qr_remove(&entries[i], link);
+	}
+	test_independent_entries(entries);
+}
+TEST_END
+
+TEST_BEGIN(test_qr_before_insert) {
+	ring_t entries[NENTRIES];
+	ring_t *t;
+	unsigned i, j;
+
+	init_entries(entries);
+	for (i = 1; i < NENTRIES; i++) {
+		qr_before_insert(&entries[i - 1], &entries[i], link);
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[(NENTRIES+i-j) %
+			    NENTRIES].id, "Element id mismatch");
+			j++;
+		}
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_reverse_foreach(t, &entries[i], link) {
+			assert_c_eq(t->id, entries[(i+j+1) % NENTRIES].id,
+			    "Element id mismatch");
+			j++;
+		}
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_next(&entries[i], link);
+		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,
+		    "Element id mismatch");
+	}
+	for (i = 0; i < NENTRIES; i++) {
+		t = qr_prev(&entries[i], link);
+		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,
+		    "Element id mismatch");
+	}
+}
+TEST_END
+
+static void
+test_split_entries(ring_t *entries) {
+	ring_t *t;
+	unsigned i, j;
+
+	for (i = 0; i < NENTRIES; i++) {
+		j = 0;
+		qr_foreach(t, &entries[i], link) {
+			if (i < SPLIT_INDEX) {
+				assert_c_eq(t->id,
+				    entries[(i+j) % SPLIT_INDEX].id,
+				    "Element id mismatch");
+			} else {
+				assert_c_eq(t->id, entries[(i+j-SPLIT_INDEX) %
+				    (NENTRIES-SPLIT_INDEX) + SPLIT_INDEX].id,
+				    "Element id mismatch");
+			}
+			j++;
+		}
+	}
+}
+
+TEST_BEGIN(test_qr_meld_split) {
+	ring_t entries[NENTRIES];
+	unsigned i;
+
+	init_entries(entries);
+	for (i = 1; i < NENTRIES; i++) {
+		qr_after_insert(&entries[i - 1], &entries[i], link);
+	}
+
+	qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
+	test_split_entries(entries);
+
+	qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
+	test_entries_ring(entries);
+
+	qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
+	test_split_entries(entries);
+
+	qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
+	test_entries_ring(entries);
+
+	qr_split(&entries[0], &entries[0], ring_t, link);
+	test_entries_ring(entries);
+
+	qr_meld(&entries[0], &entries[0], ring_t, link);
+	test_entries_ring(entries);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_qr_one,
+	    test_qr_after_insert,
+	    test_qr_remove,
+	    test_qr_before_insert,
+	    test_qr_meld_split);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/rb.c b/redis-stable/deps/jemalloc/test/unit/rb.c
new file mode 100644
index 00000000..65c04920
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/rb.c
@@ -0,0 +1,355 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/rb.h"
+
+#define rbtn_black_height(a_type, a_field, a_rbt, r_height) do {	\
+	a_type *rbp_bh_t;						\
+	for (rbp_bh_t = (a_rbt)->rbt_root, (r_height) = 0; rbp_bh_t !=	\
+	    NULL; rbp_bh_t = rbtn_left_get(a_type, a_field,		\
+	    rbp_bh_t)) {						\
+		if (!rbtn_red_get(a_type, a_field, rbp_bh_t)) {		\
+		(r_height)++;						\
+		}							\
+	}								\
+} while (0)
+
+typedef struct node_s node_t;
+
+struct node_s {
+#define NODE_MAGIC 0x9823af7e
+	uint32_t magic;
+	rb_node(node_t) link;
+	uint64_t key;
+};
+
+static int
+node_cmp(const node_t *a, const node_t *b) {
+	int ret;
+
+	assert_u32_eq(a->magic, NODE_MAGIC, "Bad magic");
+	assert_u32_eq(b->magic, NODE_MAGIC, "Bad magic");
+
+	ret = (a->key > b->key) - (a->key < b->key);
+	if (ret == 0) {
+		/*
+		 * Duplicates are not allowed in the tree, so force an
+		 * arbitrary ordering for non-identical items with equal keys.
+		 */
+		ret = (((uintptr_t)a) > ((uintptr_t)b))
+		    - (((uintptr_t)a) < ((uintptr_t)b));
+	}
+	return ret;
+}
+
+typedef rb_tree(node_t) tree_t;
+rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
+
+TEST_BEGIN(test_rb_empty) {
+	tree_t tree;
+	node_t key;
+
+	tree_new(&tree);
+
+	assert_true(tree_empty(&tree), "Tree should be empty");
+	assert_ptr_null(tree_first(&tree), "Unexpected node");
+	assert_ptr_null(tree_last(&tree), "Unexpected node");
+
+	key.key = 0;
+	key.magic = NODE_MAGIC;
+	assert_ptr_null(tree_search(&tree, &key), "Unexpected node");
+
+	key.key = 0;
+	key.magic = NODE_MAGIC;
+	assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node");
+
+	key.key = 0;
+	key.magic = NODE_MAGIC;
+	assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node");
+}
+TEST_END
+
+static unsigned
+tree_recurse(node_t *node, unsigned black_height, unsigned black_depth) {
+	unsigned ret = 0;
+	node_t *left_node;
+	node_t *right_node;
+
+	if (node == NULL) {
+		return ret;
+	}
+
+	left_node = rbtn_left_get(node_t, link, node);
+	right_node = rbtn_right_get(node_t, link, node);
+
+	if (!rbtn_red_get(node_t, link, node)) {
+		black_depth++;
+	}
+
+	/* Red nodes must be interleaved with black nodes. */
+	if (rbtn_red_get(node_t, link, node)) {
+		if (left_node != NULL) {
+			assert_false(rbtn_red_get(node_t, link, left_node),
+				"Node should be black");
+		}
+		if (right_node != NULL) {
+			assert_false(rbtn_red_get(node_t, link, right_node),
+			    "Node should be black");
+		}
+	}
+
+	/* Self. */
+	assert_u32_eq(node->magic, NODE_MAGIC, "Bad magic");
+
+	/* Left subtree. */
+	if (left_node != NULL) {
+		ret += tree_recurse(left_node, black_height, black_depth);
+	} else {
+		ret += (black_depth != black_height);
+	}
+
+	/* Right subtree. */
+	if (right_node != NULL) {
+		ret += tree_recurse(right_node, black_height, black_depth);
+	} else {
+		ret += (black_depth != black_height);
+	}
+
+	return ret;
+}
+
+static node_t *
+tree_iterate_cb(tree_t *tree, node_t *node, void *data) {
+	unsigned *i = (unsigned *)data;
+	node_t *search_node;
+
+	assert_u32_eq(node->magic, NODE_MAGIC, "Bad magic");
+
+	/* Test rb_search(). */
+	search_node = tree_search(tree, node);
+	assert_ptr_eq(search_node, node,
+	    "tree_search() returned unexpected node");
+
+	/* Test rb_nsearch(). */
+	search_node = tree_nsearch(tree, node);
+	assert_ptr_eq(search_node, node,
+	    "tree_nsearch() returned unexpected node");
+
+	/* Test rb_psearch(). */
+	search_node = tree_psearch(tree, node);
+	assert_ptr_eq(search_node, node,
+	    "tree_psearch() returned unexpected node");
+
+	(*i)++;
+
+	return NULL;
+}
+
+static unsigned
+tree_iterate(tree_t *tree) {
+	unsigned i;
+
+	i = 0;
+	tree_iter(tree, NULL, tree_iterate_cb, (void *)&i);
+
+	return i;
+}
+
+static unsigned
+tree_iterate_reverse(tree_t *tree) {
+	unsigned i;
+
+	i = 0;
+	tree_reverse_iter(tree, NULL, tree_iterate_cb, (void *)&i);
+
+	return i;
+}
+
+static void
+node_remove(tree_t *tree, node_t *node, unsigned nnodes) {
+	node_t *search_node;
+	unsigned black_height, imbalances;
+
+	tree_remove(tree, node);
+
+	/* Test rb_nsearch(). */
+	search_node = tree_nsearch(tree, node);
+	if (search_node != NULL) {
+		assert_u64_ge(search_node->key, node->key,
+		    "Key ordering error");
+	}
+
+	/* Test rb_psearch(). */
+	search_node = tree_psearch(tree, node);
+	if (search_node != NULL) {
+		assert_u64_le(search_node->key, node->key,
+		    "Key ordering error");
+	}
+
+	node->magic = 0;
+
+	rbtn_black_height(node_t, link, tree, black_height);
+	imbalances = tree_recurse(tree->rbt_root, black_height, 0);
+	assert_u_eq(imbalances, 0, "Tree is unbalanced");
+	assert_u_eq(tree_iterate(tree), nnodes-1,
+	    "Unexpected node iteration count");
+	assert_u_eq(tree_iterate_reverse(tree), nnodes-1,
+	    "Unexpected node iteration count");
+}
+
+static node_t *
+remove_iterate_cb(tree_t *tree, node_t *node, void *data) {
+	unsigned *nnodes = (unsigned *)data;
+	node_t *ret = tree_next(tree, node);
+
+	node_remove(tree, node, *nnodes);
+
+	return ret;
+}
+
+static node_t *
+remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) {
+	unsigned *nnodes = (unsigned *)data;
+	node_t *ret = tree_prev(tree, node);
+
+	node_remove(tree, node, *nnodes);
+
+	return ret;
+}
+
+static void
+destroy_cb(node_t *node, void *data) {
+	unsigned *nnodes = (unsigned *)data;
+
+	assert_u_gt(*nnodes, 0, "Destruction removed too many nodes");
+	(*nnodes)--;
+}
+
+TEST_BEGIN(test_rb_random) {
+#define NNODES 25
+#define NBAGS 250
+#define SEED 42
+	sfmt_t *sfmt;
+	uint64_t bag[NNODES];
+	tree_t tree;
+	node_t nodes[NNODES];
+	unsigned i, j, k, black_height, imbalances;
+
+	sfmt = init_gen_rand(SEED);
+	for (i = 0; i < NBAGS; i++) {
+		switch (i) {
+		case 0:
+			/* Insert in order. */
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = j;
+			}
+			break;
+		case 1:
+			/* Insert in reverse order. */
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = NNODES - j - 1;
+			}
+			break;
+		default:
+			for (j = 0; j < NNODES; j++) {
+				bag[j] = gen_rand64_range(sfmt, NNODES);
+			}
+		}
+
+		for (j = 1; j <= NNODES; j++) {
+			/* Initialize tree and nodes. */
+			tree_new(&tree);
+			for (k = 0; k < j; k++) {
+				nodes[k].magic = NODE_MAGIC;
+				nodes[k].key = bag[k];
+			}
+
+			/* Insert nodes. */
+			for (k = 0; k < j; k++) {
+				tree_insert(&tree, &nodes[k]);
+
+				rbtn_black_height(node_t, link, &tree,
+				    black_height);
+				imbalances = tree_recurse(tree.rbt_root,
+				    black_height, 0);
+				assert_u_eq(imbalances, 0,
+				    "Tree is unbalanced");
+
+				assert_u_eq(tree_iterate(&tree), k+1,
+				    "Unexpected node iteration count");
+				assert_u_eq(tree_iterate_reverse(&tree), k+1,
+				    "Unexpected node iteration count");
+
+				assert_false(tree_empty(&tree),
+				    "Tree should not be empty");
+				assert_ptr_not_null(tree_first(&tree),
+				    "Tree should not be empty");
+				assert_ptr_not_null(tree_last(&tree),
+				    "Tree should not be empty");
+
+				tree_next(&tree, &nodes[k]);
+				tree_prev(&tree, &nodes[k]);
+			}
+
+			/* Remove nodes. */
+			switch (i % 5) {
+			case 0:
+				for (k = 0; k < j; k++) {
+					node_remove(&tree, &nodes[k], j - k);
+				}
+				break;
+			case 1:
+				for (k = j; k > 0; k--) {
+					node_remove(&tree, &nodes[k-1], k);
+				}
+				break;
+			case 2: {
+				node_t *start;
+				unsigned nnodes = j;
+
+				start = NULL;
+				do {
+					start = tree_iter(&tree, start,
+					    remove_iterate_cb, (void *)&nnodes);
+					nnodes--;
+				} while (start != NULL);
+				assert_u_eq(nnodes, 0,
+				    "Removal terminated early");
+				break;
+			} case 3: {
+				node_t *start;
+				unsigned nnodes = j;
+
+				start = NULL;
+				do {
+					start = tree_reverse_iter(&tree, start,
+					    remove_reverse_iterate_cb,
+					    (void *)&nnodes);
+					nnodes--;
+				} while (start != NULL);
+				assert_u_eq(nnodes, 0,
+				    "Removal terminated early");
+				break;
+			} case 4: {
+				unsigned nnodes = j;
+				tree_destroy(&tree, destroy_cb, &nnodes);
+				assert_u_eq(nnodes, 0,
+				    "Destruction terminated early");
+				break;
+			} default:
+				not_reached();
+			}
+		}
+	}
+	fini_gen_rand(sfmt);
+#undef NNODES
+#undef NBAGS
+#undef SEED
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_rb_empty,
+	    test_rb_random);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/retained.c b/redis-stable/deps/jemalloc/test/unit/retained.c
new file mode 100644
index 00000000..d51a5981
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/retained.c
@@ -0,0 +1,181 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/spin.h"
+
+static unsigned		arena_ind;
+static size_t		sz;
+static size_t		esz;
+#define NEPOCHS		8
+#define PER_THD_NALLOCS	1
+static atomic_u_t	epoch;
+static atomic_u_t	nfinished;
+
+static unsigned
+do_arena_create(extent_hooks_t *h) {
+	unsigned arena_ind;
+	size_t sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
+	    (void *)(h != NULL ? &h : NULL), (h != NULL ? sizeof(h) : 0)), 0,
+	    "Unexpected mallctl() failure");
+	return arena_ind;
+}
+
+static void
+do_arena_destroy(unsigned arena_ind) {
+	size_t mib[3];
+	size_t miblen;
+
+	miblen = sizeof(mib)/sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arena.0.destroy", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() failure");
+	mib[1] = (size_t)arena_ind;
+	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctlbymib() failure");
+}
+
+static void
+do_refresh(void) {
+	uint64_t epoch = 1;
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
+	    sizeof(epoch)), 0, "Unexpected mallctl() failure");
+}
+
+static size_t
+do_get_size_impl(const char *cmd, unsigned arena_ind) {
+	size_t mib[4];
+	size_t miblen = sizeof(mib) / sizeof(size_t);
+	size_t z = sizeof(size_t);
+
+	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
+	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
+	mib[2] = arena_ind;
+	size_t size;
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&size, &z, NULL, 0),
+	    0, "Unexpected mallctlbymib([\"%s\"], ...) failure", cmd);
+
+	return size;
+}
+
+static size_t
+do_get_active(unsigned arena_ind) {
+	return do_get_size_impl("stats.arenas.0.pactive", arena_ind) * PAGE;
+}
+
+static size_t
+do_get_mapped(unsigned arena_ind) {
+	return do_get_size_impl("stats.arenas.0.mapped", arena_ind);
+}
+
+static void *
+thd_start(void *arg) {
+	for (unsigned next_epoch = 1; next_epoch < NEPOCHS; next_epoch++) {
+		/* Busy-wait for next epoch. */
+		unsigned cur_epoch;
+		spin_t spinner = SPIN_INITIALIZER;
+		while ((cur_epoch = atomic_load_u(&epoch, ATOMIC_ACQUIRE)) !=
+		    next_epoch) {
+			spin_adaptive(&spinner);
+		}
+		assert_u_eq(cur_epoch, next_epoch, "Unexpected epoch");
+
+		/*
+		 * Allocate.  The main thread will reset the arena, so there's
+		 * no need to deallocate.
+		 */
+		for (unsigned i = 0; i < PER_THD_NALLOCS; i++) {
+			void *p = mallocx(sz, MALLOCX_ARENA(arena_ind) |
+			    MALLOCX_TCACHE_NONE
+			    );
+			assert_ptr_not_null(p,
+			    "Unexpected mallocx() failure\n");
+		}
+
+		/* Let the main thread know we've finished this iteration. */
+		atomic_fetch_add_u(&nfinished, 1, ATOMIC_RELEASE);
+	}
+
+	return NULL;
+}
+
+TEST_BEGIN(test_retained) {
+	test_skip_if(!config_stats);
+
+	arena_ind = do_arena_create(NULL);
+	sz = nallocx(HUGEPAGE, 0);
+	esz = sz + sz_large_pad;
+
+	atomic_store_u(&epoch, 0, ATOMIC_RELAXED);
+
+	unsigned nthreads = ncpus * 2;
+	VARIABLE_ARRAY(thd_t, threads, nthreads);
+	for (unsigned i = 0; i < nthreads; i++) {
+		thd_create(&threads[i], thd_start, NULL);
+	}
+
+	for (unsigned e = 1; e < NEPOCHS; e++) {
+		atomic_store_u(&nfinished, 0, ATOMIC_RELEASE);
+		atomic_store_u(&epoch, e, ATOMIC_RELEASE);
+
+		/* Wait for threads to finish allocating. */
+		spin_t spinner = SPIN_INITIALIZER;
+		while (atomic_load_u(&nfinished, ATOMIC_ACQUIRE) < nthreads) {
+			spin_adaptive(&spinner);
+		}
+
+		/*
+		 * Assert that retained is no more than the sum of size classes
+		 * that should have been used to satisfy the worker threads'
+		 * requests, discounting per growth fragmentation.
+		 */
+		do_refresh();
+
+		size_t allocated = esz * nthreads * PER_THD_NALLOCS;
+		size_t active = do_get_active(arena_ind);
+		assert_zu_le(allocated, active, "Unexpected active memory");
+		size_t mapped = do_get_mapped(arena_ind);
+		assert_zu_le(active, mapped, "Unexpected mapped memory");
+
+		arena_t *arena = arena_get(tsdn_fetch(), arena_ind, false);
+		size_t usable = 0;
+		size_t fragmented = 0;
+		for (pszind_t pind = sz_psz2ind(HUGEPAGE); pind <
+		    arena->extent_grow_next; pind++) {
+			size_t psz = sz_pind2sz(pind);
+			size_t psz_fragmented = psz % esz;
+			size_t psz_usable = psz - psz_fragmented;
+			/*
+			 * Only consider size classes that wouldn't be skipped.
+			 */
+			if (psz_usable > 0) {
+				assert_zu_lt(usable, allocated,
+				    "Excessive retained memory "
+				    "(%#zx[+%#zx] > %#zx)", usable, psz_usable,
+				    allocated);
+				fragmented += psz_fragmented;
+				usable += psz_usable;
+			}
+		}
+
+		/*
+		 * Clean up arena.  Destroying and recreating the arena
+		 * is simpler that specifying extent hooks that deallocate
+		 * (rather than retaining) during reset.
+		 */
+		do_arena_destroy(arena_ind);
+		assert_u_eq(do_arena_create(NULL), arena_ind,
+		    "Unexpected arena index");
+	}
+
+	for (unsigned i = 0; i < nthreads; i++) {
+		thd_join(threads[i], NULL);
+	}
+
+	do_arena_destroy(arena_ind);
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_retained);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/rtree.c b/redis-stable/deps/jemalloc/test/unit/rtree.c
new file mode 100644
index 00000000..908100fa
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/rtree.c
@@ -0,0 +1,227 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/rtree.h"
+
+rtree_node_alloc_t *rtree_node_alloc_orig;
+rtree_node_dalloc_t *rtree_node_dalloc_orig;
+rtree_leaf_alloc_t *rtree_leaf_alloc_orig;
+rtree_leaf_dalloc_t *rtree_leaf_dalloc_orig;
+
+/* Potentially too large to safely place on the stack. */
+rtree_t test_rtree;
+
+static rtree_node_elm_t *
+rtree_node_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
+	rtree_node_elm_t *node;
+
+	if (rtree != &test_rtree) {
+		return rtree_node_alloc_orig(tsdn, rtree, nelms);
+	}
+
+	malloc_mutex_unlock(tsdn, &rtree->init_lock);
+	node = (rtree_node_elm_t *)calloc(nelms, sizeof(rtree_node_elm_t));
+	assert_ptr_not_null(node, "Unexpected calloc() failure");
+	malloc_mutex_lock(tsdn, &rtree->init_lock);
+
+	return node;
+}
+
+static void
+rtree_node_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,
+    rtree_node_elm_t *node) {
+	if (rtree != &test_rtree) {
+		rtree_node_dalloc_orig(tsdn, rtree, node);
+		return;
+	}
+
+	free(node);
+}
+
+static rtree_leaf_elm_t *
+rtree_leaf_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
+	rtree_leaf_elm_t *leaf;
+
+	if (rtree != &test_rtree) {
+		return rtree_leaf_alloc_orig(tsdn, rtree, nelms);
+	}
+
+	malloc_mutex_unlock(tsdn, &rtree->init_lock);
+	leaf = (rtree_leaf_elm_t *)calloc(nelms, sizeof(rtree_leaf_elm_t));
+	assert_ptr_not_null(leaf, "Unexpected calloc() failure");
+	malloc_mutex_lock(tsdn, &rtree->init_lock);
+
+	return leaf;
+}
+
+static void
+rtree_leaf_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,
+    rtree_leaf_elm_t *leaf) {
+	if (rtree != &test_rtree) {
+		rtree_leaf_dalloc_orig(tsdn, rtree, leaf);
+		return;
+	}
+
+	free(leaf);
+}
+
+TEST_BEGIN(test_rtree_read_empty) {
+	tsdn_t *tsdn;
+
+	tsdn = tsdn_fetch();
+
+	rtree_t *rtree = &test_rtree;
+	rtree_ctx_t rtree_ctx;
+	rtree_ctx_data_init(&rtree_ctx);
+	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
+	assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE,
+	    false), "rtree_extent_read() should return NULL for empty tree");
+	rtree_delete(tsdn, rtree);
+}
+TEST_END
+
+#undef NTHREADS
+#undef NITERS
+#undef SEED
+
+TEST_BEGIN(test_rtree_extrema) {
+	extent_t extent_a, extent_b;
+	extent_init(&extent_a, NULL, NULL, LARGE_MINCLASS, false,
+	    sz_size2index(LARGE_MINCLASS), 0, extent_state_active, false,
+	    false, true);
+	extent_init(&extent_b, NULL, NULL, 0, false, NSIZES, 0,
+	    extent_state_active, false, false, true);
+
+	tsdn_t *tsdn = tsdn_fetch();
+
+	rtree_t *rtree = &test_rtree;
+	rtree_ctx_t rtree_ctx;
+	rtree_ctx_data_init(&rtree_ctx);
+	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
+
+	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, &extent_a,
+	    extent_szind_get(&extent_a), extent_slab_get(&extent_a)),
+	    "Unexpected rtree_write() failure");
+	rtree_szind_slab_update(tsdn, rtree, &rtree_ctx, PAGE,
+	    extent_szind_get(&extent_a), extent_slab_get(&extent_a));
+	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE, true),
+	    &extent_a,
+	    "rtree_extent_read() should return previously set value");
+
+	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, ~((uintptr_t)0),
+	    &extent_b, extent_szind_get_maybe_invalid(&extent_b),
+	    extent_slab_get(&extent_b)), "Unexpected rtree_write() failure");
+	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+	    ~((uintptr_t)0), true), &extent_b,
+	    "rtree_extent_read() should return previously set value");
+
+	rtree_delete(tsdn, rtree);
+}
+TEST_END
+
+TEST_BEGIN(test_rtree_bits) {
+	tsdn_t *tsdn = tsdn_fetch();
+
+	uintptr_t keys[] = {PAGE, PAGE + 1,
+	    PAGE + (((uintptr_t)1) << LG_PAGE) - 1};
+
+	extent_t extent;
+	extent_init(&extent, NULL, NULL, 0, false, NSIZES, 0,
+	    extent_state_active, false, false, true);
+
+	rtree_t *rtree = &test_rtree;
+	rtree_ctx_t rtree_ctx;
+	rtree_ctx_data_init(&rtree_ctx);
+	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
+
+	for (unsigned i = 0; i < sizeof(keys)/sizeof(uintptr_t); i++) {
+		assert_false(rtree_write(tsdn, rtree, &rtree_ctx, keys[i],
+		    &extent, NSIZES, false),
+		    "Unexpected rtree_write() failure");
+		for (unsigned j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) {
+			assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+			    keys[j], true), &extent,
+			    "rtree_extent_read() should return previously set "
+			    "value and ignore insignificant key bits; i=%u, "
+			    "j=%u, set key=%#"FMTxPTR", get key=%#"FMTxPTR, i,
+			    j, keys[i], keys[j]);
+		}
+		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+		    (((uintptr_t)2) << LG_PAGE), false),
+		    "Only leftmost rtree leaf should be set; i=%u", i);
+		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
+	}
+
+	rtree_delete(tsdn, rtree);
+}
+TEST_END
+
+TEST_BEGIN(test_rtree_random) {
+#define NSET 16
+#define SEED 42
+	sfmt_t *sfmt = init_gen_rand(SEED);
+	tsdn_t *tsdn = tsdn_fetch();
+	uintptr_t keys[NSET];
+	rtree_t *rtree = &test_rtree;
+	rtree_ctx_t rtree_ctx;
+	rtree_ctx_data_init(&rtree_ctx);
+
+	extent_t extent;
+	extent_init(&extent, NULL, NULL, 0, false, NSIZES, 0,
+	    extent_state_active, false, false, true);
+
+	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
+
+	for (unsigned i = 0; i < NSET; i++) {
+		keys[i] = (uintptr_t)gen_rand64(sfmt);
+		rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree,
+		    &rtree_ctx, keys[i], false, true);
+		assert_ptr_not_null(elm,
+		    "Unexpected rtree_leaf_elm_lookup() failure");
+		rtree_leaf_elm_write(tsdn, rtree, elm, &extent, NSIZES, false);
+		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+		    keys[i], true), &extent,
+		    "rtree_extent_read() should return previously set value");
+	}
+	for (unsigned i = 0; i < NSET; i++) {
+		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+		    keys[i], true), &extent,
+		    "rtree_extent_read() should return previously set value, "
+		    "i=%u", i);
+	}
+
+	for (unsigned i = 0; i < NSET; i++) {
+		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
+		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+		    keys[i], true),
+		   "rtree_extent_read() should return previously set value");
+	}
+	for (unsigned i = 0; i < NSET; i++) {
+		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
+		    keys[i], true),
+		    "rtree_extent_read() should return previously set value");
+	}
+
+	rtree_delete(tsdn, rtree);
+	fini_gen_rand(sfmt);
+#undef NSET
+#undef SEED
+}
+TEST_END
+
+int
+main(void) {
+	rtree_node_alloc_orig = rtree_node_alloc;
+	rtree_node_alloc = rtree_node_alloc_intercept;
+	rtree_node_dalloc_orig = rtree_node_dalloc;
+	rtree_node_dalloc = rtree_node_dalloc_intercept;
+	rtree_leaf_alloc_orig = rtree_leaf_alloc;
+	rtree_leaf_alloc = rtree_leaf_alloc_intercept;
+	rtree_leaf_dalloc_orig = rtree_leaf_dalloc;
+	rtree_leaf_dalloc = rtree_leaf_dalloc_intercept;
+
+	return test(
+	    test_rtree_read_empty,
+	    test_rtree_extrema,
+	    test_rtree_bits,
+	    test_rtree_random);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/size_classes.c b/redis-stable/deps/jemalloc/test/unit/size_classes.c
new file mode 100644
index 00000000..bcff5609
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/size_classes.c
@@ -0,0 +1,183 @@
+#include "test/jemalloc_test.h"
+
+static size_t
+get_max_size_class(void) {
+	unsigned nlextents;
+	size_t mib[4];
+	size_t sz, miblen, max_size_class;
+
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
+	    0), 0, "Unexpected mallctl() error");
+
+	miblen = sizeof(mib) / sizeof(size_t);
+	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
+	    "Unexpected mallctlnametomib() error");
+	mib[2] = nlextents - 1;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctlbymib(mib, miblen, (void *)&max_size_class, &sz,
+	    NULL, 0), 0, "Unexpected mallctlbymib() error");
+
+	return max_size_class;
+}
+
+TEST_BEGIN(test_size_classes) {
+	size_t size_class, max_size_class;
+	szind_t index, max_index;
+
+	max_size_class = get_max_size_class();
+	max_index = sz_size2index(max_size_class);
+
+	for (index = 0, size_class = sz_index2size(index); index < max_index ||
+	    size_class < max_size_class; index++, size_class =
+	    sz_index2size(index)) {
+		assert_true(index < max_index,
+		    "Loop conditionals should be equivalent; index=%u, "
+		    "size_class=%zu (%#zx)", index, size_class, size_class);
+		assert_true(size_class < max_size_class,
+		    "Loop conditionals should be equivalent; index=%u, "
+		    "size_class=%zu (%#zx)", index, size_class, size_class);
+
+		assert_u_eq(index, sz_size2index(size_class),
+		    "sz_size2index() does not reverse sz_index2size(): index=%u"
+		    " --> size_class=%zu --> index=%u --> size_class=%zu",
+		    index, size_class, sz_size2index(size_class),
+		    sz_index2size(sz_size2index(size_class)));
+		assert_zu_eq(size_class,
+		    sz_index2size(sz_size2index(size_class)),
+		    "sz_index2size() does not reverse sz_size2index(): index=%u"
+		    " --> size_class=%zu --> index=%u --> size_class=%zu",
+		    index, size_class, sz_size2index(size_class),
+		    sz_index2size(sz_size2index(size_class)));
+
+		assert_u_eq(index+1, sz_size2index(size_class+1),
+		    "Next size_class does not round up properly");
+
+		assert_zu_eq(size_class, (index > 0) ?
+		    sz_s2u(sz_index2size(index-1)+1) : sz_s2u(1),
+		    "sz_s2u() does not round up to size class");
+		assert_zu_eq(size_class, sz_s2u(size_class-1),
+		    "sz_s2u() does not round up to size class");
+		assert_zu_eq(size_class, sz_s2u(size_class),
+		    "sz_s2u() does not compute same size class");
+		assert_zu_eq(sz_s2u(size_class+1), sz_index2size(index+1),
+		    "sz_s2u() does not round up to next size class");
+	}
+
+	assert_u_eq(index, sz_size2index(sz_index2size(index)),
+	    "sz_size2index() does not reverse sz_index2size()");
+	assert_zu_eq(max_size_class, sz_index2size(
+	    sz_size2index(max_size_class)),
+	    "sz_index2size() does not reverse sz_size2index()");
+
+	assert_zu_eq(size_class, sz_s2u(sz_index2size(index-1)+1),
+	    "sz_s2u() does not round up to size class");
+	assert_zu_eq(size_class, sz_s2u(size_class-1),
+	    "sz_s2u() does not round up to size class");
+	assert_zu_eq(size_class, sz_s2u(size_class),
+	    "sz_s2u() does not compute same size class");
+}
+TEST_END
+
+TEST_BEGIN(test_psize_classes) {
+	size_t size_class, max_psz;
+	pszind_t pind, max_pind;
+
+	max_psz = get_max_size_class() + PAGE;
+	max_pind = sz_psz2ind(max_psz);
+
+	for (pind = 0, size_class = sz_pind2sz(pind);
+	    pind < max_pind || size_class < max_psz;
+	    pind++, size_class = sz_pind2sz(pind)) {
+		assert_true(pind < max_pind,
+		    "Loop conditionals should be equivalent; pind=%u, "
+		    "size_class=%zu (%#zx)", pind, size_class, size_class);
+		assert_true(size_class < max_psz,
+		    "Loop conditionals should be equivalent; pind=%u, "
+		    "size_class=%zu (%#zx)", pind, size_class, size_class);
+
+		assert_u_eq(pind, sz_psz2ind(size_class),
+		    "sz_psz2ind() does not reverse sz_pind2sz(): pind=%u -->"
+		    " size_class=%zu --> pind=%u --> size_class=%zu", pind,
+		    size_class, sz_psz2ind(size_class),
+		    sz_pind2sz(sz_psz2ind(size_class)));
+		assert_zu_eq(size_class, sz_pind2sz(sz_psz2ind(size_class)),
+		    "sz_pind2sz() does not reverse sz_psz2ind(): pind=%u -->"
+		    " size_class=%zu --> pind=%u --> size_class=%zu", pind,
+		    size_class, sz_psz2ind(size_class),
+		    sz_pind2sz(sz_psz2ind(size_class)));
+
+		assert_u_eq(pind+1, sz_psz2ind(size_class+1),
+		    "Next size_class does not round up properly");
+
+		assert_zu_eq(size_class, (pind > 0) ?
+		    sz_psz2u(sz_pind2sz(pind-1)+1) : sz_psz2u(1),
+		    "sz_psz2u() does not round up to size class");
+		assert_zu_eq(size_class, sz_psz2u(size_class-1),
+		    "sz_psz2u() does not round up to size class");
+		assert_zu_eq(size_class, sz_psz2u(size_class),
+		    "sz_psz2u() does not compute same size class");
+		assert_zu_eq(sz_psz2u(size_class+1), sz_pind2sz(pind+1),
+		    "sz_psz2u() does not round up to next size class");
+	}
+
+	assert_u_eq(pind, sz_psz2ind(sz_pind2sz(pind)),
+	    "sz_psz2ind() does not reverse sz_pind2sz()");
+	assert_zu_eq(max_psz, sz_pind2sz(sz_psz2ind(max_psz)),
+	    "sz_pind2sz() does not reverse sz_psz2ind()");
+
+	assert_zu_eq(size_class, sz_psz2u(sz_pind2sz(pind-1)+1),
+	    "sz_psz2u() does not round up to size class");
+	assert_zu_eq(size_class, sz_psz2u(size_class-1),
+	    "sz_psz2u() does not round up to size class");
+	assert_zu_eq(size_class, sz_psz2u(size_class),
+	    "sz_psz2u() does not compute same size class");
+}
+TEST_END
+
+TEST_BEGIN(test_overflow) {
+	size_t max_size_class, max_psz;
+
+	max_size_class = get_max_size_class();
+	max_psz = max_size_class + PAGE;
+
+	assert_u_eq(sz_size2index(max_size_class+1), NSIZES,
+	    "sz_size2index() should return NSIZES on overflow");
+	assert_u_eq(sz_size2index(ZU(PTRDIFF_MAX)+1), NSIZES,
+	    "sz_size2index() should return NSIZES on overflow");
+	assert_u_eq(sz_size2index(SIZE_T_MAX), NSIZES,
+	    "sz_size2index() should return NSIZES on overflow");
+
+	assert_zu_eq(sz_s2u(max_size_class+1), 0,
+	    "sz_s2u() should return 0 for unsupported size");
+	assert_zu_eq(sz_s2u(ZU(PTRDIFF_MAX)+1), 0,
+	    "sz_s2u() should return 0 for unsupported size");
+	assert_zu_eq(sz_s2u(SIZE_T_MAX), 0,
+	    "sz_s2u() should return 0 on overflow");
+
+	assert_u_eq(sz_psz2ind(max_size_class+1), NPSIZES,
+	    "sz_psz2ind() should return NPSIZES on overflow");
+	assert_u_eq(sz_psz2ind(ZU(PTRDIFF_MAX)+1), NPSIZES,
+	    "sz_psz2ind() should return NPSIZES on overflow");
+	assert_u_eq(sz_psz2ind(SIZE_T_MAX), NPSIZES,
+	    "sz_psz2ind() should return NPSIZES on overflow");
+
+	assert_zu_eq(sz_psz2u(max_size_class+1), max_psz,
+	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) for unsupported"
+	    " size");
+	assert_zu_eq(sz_psz2u(ZU(PTRDIFF_MAX)+1), max_psz,
+	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) for unsupported "
+	    "size");
+	assert_zu_eq(sz_psz2u(SIZE_T_MAX), max_psz,
+	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) on overflow");
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_size_classes,
+	    test_psize_classes,
+	    test_overflow);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/slab.c b/redis-stable/deps/jemalloc/test/unit/slab.c
new file mode 100644
index 00000000..7e662aed
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/slab.c
@@ -0,0 +1,32 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_arena_slab_regind) {
+	szind_t binind;
+
+	for (binind = 0; binind < NBINS; binind++) {
+		size_t regind;
+		extent_t slab;
+		const bin_info_t *bin_info = &bin_infos[binind];
+		extent_init(&slab, NULL, mallocx(bin_info->slab_size,
+		    MALLOCX_LG_ALIGN(LG_PAGE)), bin_info->slab_size, true,
+		    binind, 0, extent_state_active, false, true, true);
+		assert_ptr_not_null(extent_addr_get(&slab),
+		    "Unexpected malloc() failure");
+		for (regind = 0; regind < bin_info->nregs; regind++) {
+			void *reg = (void *)((uintptr_t)extent_addr_get(&slab) +
+			    (bin_info->reg_size * regind));
+			assert_zu_eq(arena_slab_regind(&slab, binind, reg),
+			    regind,
+			    "Incorrect region index computed for size %zu",
+			    bin_info->reg_size);
+		}
+		free(extent_addr_get(&slab));
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_arena_slab_regind);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/smoothstep.c b/redis-stable/deps/jemalloc/test/unit/smoothstep.c
new file mode 100644
index 00000000..7c5dbb7e
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/smoothstep.c
@@ -0,0 +1,102 @@
+#include "test/jemalloc_test.h"
+
+static const uint64_t smoothstep_tab[] = {
+#define STEP(step, h, x, y)			\
+	h,
+	SMOOTHSTEP
+#undef STEP
+};
+
+TEST_BEGIN(test_smoothstep_integral) {
+	uint64_t sum, min, max;
+	unsigned i;
+
+	/*
+	 * The integral of smoothstep in the [0..1] range equals 1/2.  Verify
+	 * that the fixed point representation's integral is no more than
+	 * rounding error distant from 1/2.  Regarding rounding, each table
+	 * element is rounded down to the nearest fixed point value, so the
+	 * integral may be off by as much as SMOOTHSTEP_NSTEPS ulps.
+	 */
+	sum = 0;
+	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
+		sum += smoothstep_tab[i];
+	}
+
+	max = (KQU(1) << (SMOOTHSTEP_BFP-1)) * (SMOOTHSTEP_NSTEPS+1);
+	min = max - SMOOTHSTEP_NSTEPS;
+
+	assert_u64_ge(sum, min,
+	    "Integral too small, even accounting for truncation");
+	assert_u64_le(sum, max, "Integral exceeds 1/2");
+	if (false) {
+		malloc_printf("%"FMTu64" ulps under 1/2 (limit %d)\n",
+		    max - sum, SMOOTHSTEP_NSTEPS);
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_smoothstep_monotonic) {
+	uint64_t prev_h;
+	unsigned i;
+
+	/*
+	 * The smoothstep function is monotonic in [0..1], i.e. its slope is
+	 * non-negative.  In practice we want to parametrize table generation
+	 * such that piecewise slope is greater than zero, but do not require
+	 * that here.
+	 */
+	prev_h = 0;
+	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
+		uint64_t h = smoothstep_tab[i];
+		assert_u64_ge(h, prev_h, "Piecewise non-monotonic, i=%u", i);
+		prev_h = h;
+	}
+	assert_u64_eq(smoothstep_tab[SMOOTHSTEP_NSTEPS-1],
+	    (KQU(1) << SMOOTHSTEP_BFP), "Last step must equal 1");
+}
+TEST_END
+
+TEST_BEGIN(test_smoothstep_slope) {
+	uint64_t prev_h, prev_delta;
+	unsigned i;
+
+	/*
+	 * The smoothstep slope strictly increases until x=0.5, and then
+	 * strictly decreases until x=1.0.  Verify the slightly weaker
+	 * requirement of monotonicity, so that inadequate table precision does
+	 * not cause false test failures.
+	 */
+	prev_h = 0;
+	prev_delta = 0;
+	for (i = 0; i < SMOOTHSTEP_NSTEPS / 2 + SMOOTHSTEP_NSTEPS % 2; i++) {
+		uint64_t h = smoothstep_tab[i];
+		uint64_t delta = h - prev_h;
+		assert_u64_ge(delta, prev_delta,
+		    "Slope must monotonically increase in 0.0 <= x <= 0.5, "
+		    "i=%u", i);
+		prev_h = h;
+		prev_delta = delta;
+	}
+
+	prev_h = KQU(1) << SMOOTHSTEP_BFP;
+	prev_delta = 0;
+	for (i = SMOOTHSTEP_NSTEPS-1; i >= SMOOTHSTEP_NSTEPS / 2; i--) {
+		uint64_t h = smoothstep_tab[i];
+		uint64_t delta = prev_h - h;
+		assert_u64_ge(delta, prev_delta,
+		    "Slope must monotonically decrease in 0.5 <= x <= 1.0, "
+		    "i=%u", i);
+		prev_h = h;
+		prev_delta = delta;
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_smoothstep_integral,
+	    test_smoothstep_monotonic,
+	    test_smoothstep_slope);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/spin.c b/redis-stable/deps/jemalloc/test/unit/spin.c
new file mode 100644
index 00000000..b965f742
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/spin.c
@@ -0,0 +1,18 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/spin.h"
+
+TEST_BEGIN(test_spin) {
+	spin_t spinner = SPIN_INITIALIZER;
+
+	for (unsigned i = 0; i < 100; i++) {
+		spin_adaptive(&spinner);
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_spin);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/stats.c b/redis-stable/deps/jemalloc/test/unit/stats.c
new file mode 100644
index 00000000..231010e4
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/stats.c
@@ -0,0 +1,368 @@
+#include "test/jemalloc_test.h"
+
+TEST_BEGIN(test_stats_summary) {
+	size_t sz, allocated, active, resident, mapped;
+	int expected = config_stats ? 0 : ENOENT;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.allocated", (void *)&allocated, &sz, NULL,
+	    0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.active", (void *)&active, &sz, NULL, 0),
+	    expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.resident", (void *)&resident, &sz, NULL, 0),
+	    expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.mapped", (void *)&mapped, &sz, NULL, 0),
+	    expected, "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_zu_le(allocated, active,
+		    "allocated should be no larger than active");
+		assert_zu_lt(active, resident,
+		    "active should be less than resident");
+		assert_zu_lt(active, mapped,
+		    "active should be less than mapped");
+	}
+}
+TEST_END
+
+TEST_BEGIN(test_stats_large) {
+	void *p;
+	uint64_t epoch;
+	size_t allocated;
+	uint64_t nmalloc, ndalloc, nrequests;
+	size_t sz;
+	int expected = config_stats ? 0 : ENOENT;
+
+	p = mallocx(SMALL_MAXCLASS+1, MALLOCX_ARENA(0));
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.arenas.0.large.allocated",
+	    (void *)&allocated, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(uint64_t);
+	assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.large.nrequests",
+	    (void *)&nrequests, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_zu_gt(allocated, 0,
+		    "allocated should be greater than zero");
+		assert_u64_ge(nmalloc, ndalloc,
+		    "nmalloc should be at least as large as ndalloc");
+		assert_u64_le(nmalloc, nrequests,
+		    "nmalloc should no larger than nrequests");
+	}
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_stats_arenas_summary) {
+	void *little, *large;
+	uint64_t epoch;
+	size_t sz;
+	int expected = config_stats ? 0 : ENOENT;
+	size_t mapped;
+	uint64_t dirty_npurge, dirty_nmadvise, dirty_purged;
+	uint64_t muzzy_npurge, muzzy_nmadvise, muzzy_purged;
+
+	little = mallocx(SMALL_MAXCLASS, MALLOCX_ARENA(0));
+	assert_ptr_not_null(little, "Unexpected mallocx() failure");
+	large = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
+	assert_ptr_not_null(large, "Unexpected mallocx() failure");
+
+	dallocx(little, 0);
+	dallocx(large, 0);
+
+	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
+	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
+	    "Unexpected mallctl() failure");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.arenas.0.mapped", (void *)&mapped, &sz, NULL,
+	    0), expected, "Unexepected mallctl() result");
+
+	sz = sizeof(uint64_t);
+	assert_d_eq(mallctl("stats.arenas.0.dirty_npurge",
+	    (void *)&dirty_npurge, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.dirty_nmadvise",
+	    (void *)&dirty_nmadvise, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.dirty_purged",
+	    (void *)&dirty_purged, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.muzzy_npurge",
+	    (void *)&muzzy_npurge, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.muzzy_nmadvise",
+	    (void *)&muzzy_nmadvise, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.muzzy_purged",
+	    (void *)&muzzy_purged, &sz, NULL, 0), expected,
+	    "Unexepected mallctl() result");
+
+	if (config_stats) {
+		if (!background_thread_enabled()) {
+			assert_u64_gt(dirty_npurge + muzzy_npurge, 0,
+			    "At least one purge should have occurred");
+		}
+		assert_u64_le(dirty_nmadvise, dirty_purged,
+		    "dirty_nmadvise should be no greater than dirty_purged");
+		assert_u64_le(muzzy_nmadvise, muzzy_purged,
+		    "muzzy_nmadvise should be no greater than muzzy_purged");
+	}
+}
+TEST_END
+
+void *
+thd_start(void *arg) {
+	return NULL;
+}
+
+static void
+no_lazy_lock(void) {
+	thd_t thd;
+
+	thd_create(&thd, thd_start, NULL);
+	thd_join(thd, NULL);
+}
+
+TEST_BEGIN(test_stats_arenas_small) {
+	void *p;
+	size_t sz, allocated;
+	uint64_t epoch, nmalloc, ndalloc, nrequests;
+	int expected = config_stats ? 0 : ENOENT;
+
+	no_lazy_lock(); /* Lazy locking would dodge tcache testing. */
+
+	p = mallocx(SMALL_MAXCLASS, MALLOCX_ARENA(0));
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
+	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.arenas.0.small.allocated",
+	    (void *)&allocated, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(uint64_t);
+	assert_d_eq(mallctl("stats.arenas.0.small.nmalloc", (void *)&nmalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.small.ndalloc", (void *)&ndalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.small.nrequests",
+	    (void *)&nrequests, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_zu_gt(allocated, 0,
+		    "allocated should be greater than zero");
+		assert_u64_gt(nmalloc, 0,
+		    "nmalloc should be no greater than zero");
+		assert_u64_ge(nmalloc, ndalloc,
+		    "nmalloc should be at least as large as ndalloc");
+		assert_u64_gt(nrequests, 0,
+		    "nrequests should be greater than zero");
+	}
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_stats_arenas_large) {
+	void *p;
+	size_t sz, allocated;
+	uint64_t epoch, nmalloc, ndalloc;
+	int expected = config_stats ? 0 : ENOENT;
+
+	p = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.arenas.0.large.allocated",
+	    (void *)&allocated, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(uint64_t);
+	assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
+	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_zu_gt(allocated, 0,
+		    "allocated should be greater than zero");
+		assert_u64_gt(nmalloc, 0,
+		    "nmalloc should be greater than zero");
+		assert_u64_ge(nmalloc, ndalloc,
+		    "nmalloc should be at least as large as ndalloc");
+	}
+
+	dallocx(p, 0);
+}
+TEST_END
+
+static void
+gen_mallctl_str(char *cmd, char *name, unsigned arena_ind) {
+	sprintf(cmd, "stats.arenas.%u.bins.0.%s", arena_ind, name);
+}
+
+TEST_BEGIN(test_stats_arenas_bins) {
+	void *p;
+	size_t sz, curslabs, curregs;
+	uint64_t epoch, nmalloc, ndalloc, nrequests, nfills, nflushes;
+	uint64_t nslabs, nreslabs;
+	int expected = config_stats ? 0 : ENOENT;
+
+	/* Make sure allocation below isn't satisfied by tcache. */
+	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
+	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
+
+	unsigned arena_ind, old_arena_ind;
+	sz = sizeof(unsigned);
+	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
+	    0, "Arena creation failure");
+	sz = sizeof(arena_ind);
+	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
+	    (void *)&arena_ind, sizeof(arena_ind)), 0,
+	    "Unexpected mallctl() failure");
+
+	p = malloc(bin_infos[0].reg_size);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+
+	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
+	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	char cmd[128];
+	sz = sizeof(uint64_t);
+	gen_mallctl_str(cmd, "nmalloc", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nmalloc, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	gen_mallctl_str(cmd, "ndalloc", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&ndalloc, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	gen_mallctl_str(cmd, "nrequests", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nrequests, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(size_t);
+	gen_mallctl_str(cmd, "curregs", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&curregs, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	sz = sizeof(uint64_t);
+	gen_mallctl_str(cmd, "nfills", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nfills, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	gen_mallctl_str(cmd, "nflushes", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nflushes, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	gen_mallctl_str(cmd, "nslabs", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nslabs, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	gen_mallctl_str(cmd, "nreslabs", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&nreslabs, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(size_t);
+	gen_mallctl_str(cmd, "curslabs", arena_ind);
+	assert_d_eq(mallctl(cmd, (void *)&curslabs, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_u64_gt(nmalloc, 0,
+		    "nmalloc should be greater than zero");
+		assert_u64_ge(nmalloc, ndalloc,
+		    "nmalloc should be at least as large as ndalloc");
+		assert_u64_gt(nrequests, 0,
+		    "nrequests should be greater than zero");
+		assert_zu_gt(curregs, 0,
+		    "allocated should be greater than zero");
+		if (opt_tcache) {
+			assert_u64_gt(nfills, 0,
+			    "At least one fill should have occurred");
+			assert_u64_gt(nflushes, 0,
+			    "At least one flush should have occurred");
+		}
+		assert_u64_gt(nslabs, 0,
+		    "At least one slab should have been allocated");
+		assert_zu_gt(curslabs, 0,
+		    "At least one slab should be currently allocated");
+	}
+
+	dallocx(p, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_stats_arenas_lextents) {
+	void *p;
+	uint64_t epoch, nmalloc, ndalloc;
+	size_t curlextents, sz, hsize;
+	int expected = config_stats ? 0 : ENOENT;
+
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&hsize, &sz, NULL,
+	    0), 0, "Unexpected mallctl() failure");
+
+	p = mallocx(hsize, MALLOCX_ARENA(0));
+	assert_ptr_not_null(p, "Unexpected mallocx() failure");
+
+	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
+	    0, "Unexpected mallctl() failure");
+
+	sz = sizeof(uint64_t);
+	assert_d_eq(mallctl("stats.arenas.0.lextents.0.nmalloc",
+	    (void *)&nmalloc, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	assert_d_eq(mallctl("stats.arenas.0.lextents.0.ndalloc",
+	    (void *)&ndalloc, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+	sz = sizeof(size_t);
+	assert_d_eq(mallctl("stats.arenas.0.lextents.0.curlextents",
+	    (void *)&curlextents, &sz, NULL, 0), expected,
+	    "Unexpected mallctl() result");
+
+	if (config_stats) {
+		assert_u64_gt(nmalloc, 0,
+		    "nmalloc should be greater than zero");
+		assert_u64_ge(nmalloc, ndalloc,
+		    "nmalloc should be at least as large as ndalloc");
+		assert_u64_gt(curlextents, 0,
+		    "At least one extent should be currently allocated");
+	}
+
+	dallocx(p, 0);
+}
+TEST_END
+
+int
+main(void) {
+	return test_no_reentrancy(
+	    test_stats_summary,
+	    test_stats_large,
+	    test_stats_arenas_summary,
+	    test_stats_arenas_small,
+	    test_stats_arenas_large,
+	    test_stats_arenas_bins,
+	    test_stats_arenas_lextents);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/stats_print.c b/redis-stable/deps/jemalloc/test/unit/stats_print.c
new file mode 100644
index 00000000..014d002f
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/stats_print.c
@@ -0,0 +1,999 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/util.h"
+
+typedef enum {
+	TOKEN_TYPE_NONE,
+	TOKEN_TYPE_ERROR,
+	TOKEN_TYPE_EOI,
+	TOKEN_TYPE_NULL,
+	TOKEN_TYPE_FALSE,
+	TOKEN_TYPE_TRUE,
+	TOKEN_TYPE_LBRACKET,
+	TOKEN_TYPE_RBRACKET,
+	TOKEN_TYPE_LBRACE,
+	TOKEN_TYPE_RBRACE,
+	TOKEN_TYPE_COLON,
+	TOKEN_TYPE_COMMA,
+	TOKEN_TYPE_STRING,
+	TOKEN_TYPE_NUMBER
+} token_type_t;
+
+typedef struct parser_s parser_t;
+typedef struct {
+	parser_t	*parser;
+	token_type_t	token_type;
+	size_t		pos;
+	size_t		len;
+	size_t		line;
+	size_t		col;
+} token_t;
+
+struct parser_s {
+	bool verbose;
+	char	*buf; /* '\0'-terminated. */
+	size_t	len; /* Number of characters preceding '\0' in buf. */
+	size_t	pos;
+	size_t	line;
+	size_t	col;
+	token_t	token;
+};
+
+static void
+token_init(token_t *token, parser_t *parser, token_type_t token_type,
+    size_t pos, size_t len, size_t line, size_t col) {
+	token->parser = parser;
+	token->token_type = token_type;
+	token->pos = pos;
+	token->len = len;
+	token->line = line;
+	token->col = col;
+}
+
+static void
+token_error(token_t *token) {
+	if (!token->parser->verbose) {
+		return;
+	}
+	switch (token->token_type) {
+	case TOKEN_TYPE_NONE:
+		not_reached();
+	case TOKEN_TYPE_ERROR:
+		malloc_printf("%zu:%zu: Unexpected character in token: ",
+		    token->line, token->col);
+		break;
+	default:
+		malloc_printf("%zu:%zu: Unexpected token: ", token->line,
+		    token->col);
+		break;
+	}
+	UNUSED ssize_t err = malloc_write_fd(STDERR_FILENO,
+	    &token->parser->buf[token->pos], token->len);
+	malloc_printf("\n");
+}
+
+static void
+parser_init(parser_t *parser, bool verbose) {
+	parser->verbose = verbose;
+	parser->buf = NULL;
+	parser->len = 0;
+	parser->pos = 0;
+	parser->line = 1;
+	parser->col = 0;
+}
+
+static void
+parser_fini(parser_t *parser) {
+	if (parser->buf != NULL) {
+		dallocx(parser->buf, MALLOCX_TCACHE_NONE);
+	}
+}
+
+static bool
+parser_append(parser_t *parser, const char *str) {
+	size_t len = strlen(str);
+	char *buf = (parser->buf == NULL) ? mallocx(len + 1,
+	    MALLOCX_TCACHE_NONE) : rallocx(parser->buf, parser->len + len + 1,
+	    MALLOCX_TCACHE_NONE);
+	if (buf == NULL) {
+		return true;
+	}
+	memcpy(&buf[parser->len], str, len + 1);
+	parser->buf = buf;
+	parser->len += len;
+	return false;
+}
+
+static bool
+parser_tokenize(parser_t *parser) {
+	enum {
+		STATE_START,
+		STATE_EOI,
+		STATE_N, STATE_NU, STATE_NUL, STATE_NULL,
+		STATE_F, STATE_FA, STATE_FAL, STATE_FALS, STATE_FALSE,
+		STATE_T, STATE_TR, STATE_TRU, STATE_TRUE,
+		STATE_LBRACKET,
+		STATE_RBRACKET,
+		STATE_LBRACE,
+		STATE_RBRACE,
+		STATE_COLON,
+		STATE_COMMA,
+		STATE_CHARS,
+		STATE_CHAR_ESCAPE,
+		STATE_CHAR_U, STATE_CHAR_UD, STATE_CHAR_UDD, STATE_CHAR_UDDD,
+		STATE_STRING,
+		STATE_MINUS,
+		STATE_LEADING_ZERO,
+		STATE_DIGITS,
+		STATE_DECIMAL,
+		STATE_FRAC_DIGITS,
+		STATE_EXP,
+		STATE_EXP_SIGN,
+		STATE_EXP_DIGITS,
+		STATE_ACCEPT
+	} state = STATE_START;
+	size_t token_pos JEMALLOC_CC_SILENCE_INIT(0);
+	size_t token_line JEMALLOC_CC_SILENCE_INIT(1);
+	size_t token_col JEMALLOC_CC_SILENCE_INIT(0);
+
+	assert_zu_le(parser->pos, parser->len,
+	    "Position is past end of buffer");
+
+	while (state != STATE_ACCEPT) {
+		char c = parser->buf[parser->pos];
+
+		switch (state) {
+		case STATE_START:
+			token_pos = parser->pos;
+			token_line = parser->line;
+			token_col = parser->col;
+			switch (c) {
+			case ' ': case '\b': case '\n': case '\r': case '\t':
+				break;
+			case '\0':
+				state = STATE_EOI;
+				break;
+			case 'n':
+				state = STATE_N;
+				break;
+			case 'f':
+				state = STATE_F;
+				break;
+			case 't':
+				state = STATE_T;
+				break;
+			case '[':
+				state = STATE_LBRACKET;
+				break;
+			case ']':
+				state = STATE_RBRACKET;
+				break;
+			case '{':
+				state = STATE_LBRACE;
+				break;
+			case '}':
+				state = STATE_RBRACE;
+				break;
+			case ':':
+				state = STATE_COLON;
+				break;
+			case ',':
+				state = STATE_COMMA;
+				break;
+			case '"':
+				state = STATE_CHARS;
+				break;
+			case '-':
+				state = STATE_MINUS;
+				break;
+			case '0':
+				state = STATE_LEADING_ZERO;
+				break;
+			case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				state = STATE_DIGITS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_EOI:
+			token_init(&parser->token, parser,
+			    TOKEN_TYPE_EOI, token_pos, parser->pos -
+			    token_pos, token_line, token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_N:
+			switch (c) {
+			case 'u':
+				state = STATE_NU;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_NU:
+			switch (c) {
+			case 'l':
+				state = STATE_NUL;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_NUL:
+			switch (c) {
+			case 'l':
+				state = STATE_NULL;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_NULL:
+			switch (c) {
+			case ' ': case '\b': case '\n': case '\r': case '\t':
+			case '\0':
+			case '[': case ']': case '{': case '}': case ':':
+			case ',':
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			token_init(&parser->token, parser, TOKEN_TYPE_NULL,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_F:
+			switch (c) {
+			case 'a':
+				state = STATE_FA;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_FA:
+			switch (c) {
+			case 'l':
+				state = STATE_FAL;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_FAL:
+			switch (c) {
+			case 's':
+				state = STATE_FALS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_FALS:
+			switch (c) {
+			case 'e':
+				state = STATE_FALSE;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_FALSE:
+			switch (c) {
+			case ' ': case '\b': case '\n': case '\r': case '\t':
+			case '\0':
+			case '[': case ']': case '{': case '}': case ':':
+			case ',':
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			token_init(&parser->token, parser,
+			    TOKEN_TYPE_FALSE, token_pos, parser->pos -
+			    token_pos, token_line, token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_T:
+			switch (c) {
+			case 'r':
+				state = STATE_TR;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_TR:
+			switch (c) {
+			case 'u':
+				state = STATE_TRU;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_TRU:
+			switch (c) {
+			case 'e':
+				state = STATE_TRUE;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_TRUE:
+			switch (c) {
+			case ' ': case '\b': case '\n': case '\r': case '\t':
+			case '\0':
+			case '[': case ']': case '{': case '}': case ':':
+			case ',':
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			token_init(&parser->token, parser, TOKEN_TYPE_TRUE,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_LBRACKET:
+			token_init(&parser->token, parser, TOKEN_TYPE_LBRACKET,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_RBRACKET:
+			token_init(&parser->token, parser, TOKEN_TYPE_RBRACKET,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_LBRACE:
+			token_init(&parser->token, parser, TOKEN_TYPE_LBRACE,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_RBRACE:
+			token_init(&parser->token, parser, TOKEN_TYPE_RBRACE,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_COLON:
+			token_init(&parser->token, parser, TOKEN_TYPE_COLON,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_COMMA:
+			token_init(&parser->token, parser, TOKEN_TYPE_COMMA,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_CHARS:
+			switch (c) {
+			case '\\':
+				state = STATE_CHAR_ESCAPE;
+				break;
+			case '"':
+				state = STATE_STRING;
+				break;
+			case 0x00: case 0x01: case 0x02: case 0x03: case 0x04:
+			case 0x05: case 0x06: case 0x07: case 0x08: case 0x09:
+			case 0x0a: case 0x0b: case 0x0c: case 0x0d: case 0x0e:
+			case 0x0f: case 0x10: case 0x11: case 0x12: case 0x13:
+			case 0x14: case 0x15: case 0x16: case 0x17: case 0x18:
+			case 0x19: case 0x1a: case 0x1b: case 0x1c: case 0x1d:
+			case 0x1e: case 0x1f:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			default:
+				break;
+			}
+			break;
+		case STATE_CHAR_ESCAPE:
+			switch (c) {
+			case '"': case '\\': case '/': case 'b': case 'n':
+			case 'r': case 't':
+				state = STATE_CHARS;
+				break;
+			case 'u':
+				state = STATE_CHAR_U;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_CHAR_U:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+			case 'a': case 'b': case 'c': case 'd': case 'e':
+			case 'f':
+			case 'A': case 'B': case 'C': case 'D': case 'E':
+			case 'F':
+				state = STATE_CHAR_UD;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_CHAR_UD:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+			case 'a': case 'b': case 'c': case 'd': case 'e':
+			case 'f':
+			case 'A': case 'B': case 'C': case 'D': case 'E':
+			case 'F':
+				state = STATE_CHAR_UDD;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_CHAR_UDD:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+			case 'a': case 'b': case 'c': case 'd': case 'e':
+			case 'f':
+			case 'A': case 'B': case 'C': case 'D': case 'E':
+			case 'F':
+				state = STATE_CHAR_UDDD;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_CHAR_UDDD:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+			case 'a': case 'b': case 'c': case 'd': case 'e':
+			case 'f':
+			case 'A': case 'B': case 'C': case 'D': case 'E':
+			case 'F':
+				state = STATE_CHARS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_STRING:
+			token_init(&parser->token, parser, TOKEN_TYPE_STRING,
+			    token_pos, parser->pos - token_pos, token_line,
+			    token_col);
+			state = STATE_ACCEPT;
+			break;
+		case STATE_MINUS:
+			switch (c) {
+			case '0':
+				state = STATE_LEADING_ZERO;
+				break;
+			case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				state = STATE_DIGITS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_LEADING_ZERO:
+			switch (c) {
+			case '.':
+				state = STATE_DECIMAL;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
+				    token_pos, token_line, token_col);
+				state = STATE_ACCEPT;
+				break;
+			}
+			break;
+		case STATE_DIGITS:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				break;
+			case '.':
+				state = STATE_DECIMAL;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
+				    token_pos, token_line, token_col);
+				state = STATE_ACCEPT;
+				break;
+			}
+			break;
+		case STATE_DECIMAL:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				state = STATE_FRAC_DIGITS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_FRAC_DIGITS:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				break;
+			case 'e': case 'E':
+				state = STATE_EXP;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
+				    token_pos, token_line, token_col);
+				state = STATE_ACCEPT;
+				break;
+			}
+			break;
+		case STATE_EXP:
+			switch (c) {
+			case '-': case '+':
+				state = STATE_EXP_SIGN;
+				break;
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				state = STATE_EXP_DIGITS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_EXP_SIGN:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				state = STATE_EXP_DIGITS;
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
+				    - token_pos, token_line, token_col);
+				return true;
+			}
+			break;
+		case STATE_EXP_DIGITS:
+			switch (c) {
+			case '0': case '1': case '2': case '3': case '4':
+			case '5': case '6': case '7': case '8': case '9':
+				break;
+			default:
+				token_init(&parser->token, parser,
+				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
+				    token_pos, token_line, token_col);
+				state = STATE_ACCEPT;
+				break;
+			}
+			break;
+		default:
+			not_reached();
+		}
+
+		if (state != STATE_ACCEPT) {
+			if (c == '\n') {
+				parser->line++;
+				parser->col = 0;
+			} else {
+				parser->col++;
+			}
+			parser->pos++;
+		}
+	}
+	return false;
+}
+
+static bool	parser_parse_array(parser_t *parser);
+static bool	parser_parse_object(parser_t *parser);
+
+static bool
+parser_parse_value(parser_t *parser) {
+	switch (parser->token.token_type) {
+	case TOKEN_TYPE_NULL:
+	case TOKEN_TYPE_FALSE:
+	case TOKEN_TYPE_TRUE:
+	case TOKEN_TYPE_STRING:
+	case TOKEN_TYPE_NUMBER:
+		return false;
+	case TOKEN_TYPE_LBRACE:
+		return parser_parse_object(parser);
+	case TOKEN_TYPE_LBRACKET:
+		return parser_parse_array(parser);
+	default:
+		return true;
+	}
+	not_reached();
+}
+
+static bool
+parser_parse_pair(parser_t *parser) {
+	assert_d_eq(parser->token.token_type, TOKEN_TYPE_STRING,
+	    "Pair should start with string");
+	if (parser_tokenize(parser)) {
+		return true;
+	}
+	switch (parser->token.token_type) {
+	case TOKEN_TYPE_COLON:
+		if (parser_tokenize(parser)) {
+			return true;
+		}
+		return parser_parse_value(parser);
+	default:
+		return true;
+	}
+}
+
+static bool
+parser_parse_values(parser_t *parser) {
+	if (parser_parse_value(parser)) {
+		return true;
+	}
+
+	while (true) {
+		if (parser_tokenize(parser)) {
+			return true;
+		}
+		switch (parser->token.token_type) {
+		case TOKEN_TYPE_COMMA:
+			if (parser_tokenize(parser)) {
+				return true;
+			}
+			if (parser_parse_value(parser)) {
+				return true;
+			}
+			break;
+		case TOKEN_TYPE_RBRACKET:
+			return false;
+		default:
+			return true;
+		}
+	}
+}
+
+static bool
+parser_parse_array(parser_t *parser) {
+	assert_d_eq(parser->token.token_type, TOKEN_TYPE_LBRACKET,
+	    "Array should start with [");
+	if (parser_tokenize(parser)) {
+		return true;
+	}
+	switch (parser->token.token_type) {
+	case TOKEN_TYPE_RBRACKET:
+		return false;
+	default:
+		return parser_parse_values(parser);
+	}
+	not_reached();
+}
+
+static bool
+parser_parse_pairs(parser_t *parser) {
+	assert_d_eq(parser->token.token_type, TOKEN_TYPE_STRING,
+	    "Object should start with string");
+	if (parser_parse_pair(parser)) {
+		return true;
+	}
+
+	while (true) {
+		if (parser_tokenize(parser)) {
+			return true;
+		}
+		switch (parser->token.token_type) {
+		case TOKEN_TYPE_COMMA:
+			if (parser_tokenize(parser)) {
+				return true;
+			}
+			switch (parser->token.token_type) {
+			case TOKEN_TYPE_STRING:
+				if (parser_parse_pair(parser)) {
+					return true;
+				}
+				break;
+			default:
+				return true;
+			}
+			break;
+		case TOKEN_TYPE_RBRACE:
+			return false;
+		default:
+			return true;
+		}
+	}
+}
+
+static bool
+parser_parse_object(parser_t *parser) {
+	assert_d_eq(parser->token.token_type, TOKEN_TYPE_LBRACE,
+	    "Object should start with {");
+	if (parser_tokenize(parser)) {
+		return true;
+	}
+	switch (parser->token.token_type) {
+	case TOKEN_TYPE_STRING:
+		return parser_parse_pairs(parser);
+	case TOKEN_TYPE_RBRACE:
+		return false;
+	default:
+		return true;
+	}
+	not_reached();
+}
+
+static bool
+parser_parse(parser_t *parser) {
+	if (parser_tokenize(parser)) {
+		goto label_error;
+	}
+	if (parser_parse_value(parser)) {
+		goto label_error;
+	}
+
+	if (parser_tokenize(parser)) {
+		goto label_error;
+	}
+	switch (parser->token.token_type) {
+	case TOKEN_TYPE_EOI:
+		return false;
+	default:
+		goto label_error;
+	}
+	not_reached();
+
+label_error:
+	token_error(&parser->token);
+	return true;
+}
+
+TEST_BEGIN(test_json_parser) {
+	size_t i;
+	const char *invalid_inputs[] = {
+		/* Tokenizer error case tests. */
+		"{ \"string\": X }",
+		"{ \"string\": nXll }",
+		"{ \"string\": nuXl }",
+		"{ \"string\": nulX }",
+		"{ \"string\": nullX }",
+		"{ \"string\": fXlse }",
+		"{ \"string\": faXse }",
+		"{ \"string\": falXe }",
+		"{ \"string\": falsX }",
+		"{ \"string\": falseX }",
+		"{ \"string\": tXue }",
+		"{ \"string\": trXe }",
+		"{ \"string\": truX }",
+		"{ \"string\": trueX }",
+		"{ \"string\": \"\n\" }",
+		"{ \"string\": \"\\z\" }",
+		"{ \"string\": \"\\uX000\" }",
+		"{ \"string\": \"\\u0X00\" }",
+		"{ \"string\": \"\\u00X0\" }",
+		"{ \"string\": \"\\u000X\" }",
+		"{ \"string\": -X }",
+		"{ \"string\": 0.X }",
+		"{ \"string\": 0.0eX }",
+		"{ \"string\": 0.0e+X }",
+
+		/* Parser error test cases. */
+		"{\"string\": }",
+		"{\"string\" }",
+		"{\"string\": [ 0 }",
+		"{\"string\": {\"a\":0, 1 } }",
+		"{\"string\": {\"a\":0: } }",
+		"{",
+		"{}{",
+	};
+	const char *valid_inputs[] = {
+		/* Token tests. */
+		"null",
+		"false",
+		"true",
+		"{}",
+		"{\"a\": 0}",
+		"[]",
+		"[0, 1]",
+		"0",
+		"1",
+		"10",
+		"-10",
+		"10.23",
+		"10.23e4",
+		"10.23e-4",
+		"10.23e+4",
+		"10.23E4",
+		"10.23E-4",
+		"10.23E+4",
+		"-10.23",
+		"-10.23e4",
+		"-10.23e-4",
+		"-10.23e+4",
+		"-10.23E4",
+		"-10.23E-4",
+		"-10.23E+4",
+		"\"value\"",
+		"\" \\\" \\/ \\b \\n \\r \\t \\u0abc \\u1DEF \"",
+
+		/* Parser test with various nesting. */
+		"{\"a\":null, \"b\":[1,[{\"c\":2},3]], \"d\":{\"e\":true}}",
+	};
+
+	for (i = 0; i < sizeof(invalid_inputs)/sizeof(const char *); i++) {
+		const char *input = invalid_inputs[i];
+		parser_t parser;
+		parser_init(&parser, false);
+		assert_false(parser_append(&parser, input),
+		    "Unexpected input appending failure");
+		assert_true(parser_parse(&parser),
+		    "Unexpected parse success for input: %s", input);
+		parser_fini(&parser);
+	}
+
+	for (i = 0; i < sizeof(valid_inputs)/sizeof(const char *); i++) {
+		const char *input = valid_inputs[i];
+		parser_t parser;
+		parser_init(&parser, true);
+		assert_false(parser_append(&parser, input),
+		    "Unexpected input appending failure");
+		assert_false(parser_parse(&parser),
+		    "Unexpected parse error for input: %s", input);
+		parser_fini(&parser);
+	}
+}
+TEST_END
+
+void
+write_cb(void *opaque, const char *str) {
+	parser_t *parser = (parser_t *)opaque;
+	if (parser_append(parser, str)) {
+		test_fail("Unexpected input appending failure");
+	}
+}
+
+TEST_BEGIN(test_stats_print_json) {
+	const char *opts[] = {
+		"J",
+		"Jg",
+		"Jm",
+		"Jd",
+		"Jmd",
+		"Jgd",
+		"Jgm",
+		"Jgmd",
+		"Ja",
+		"Jb",
+		"Jl",
+		"Jx",
+		"Jbl",
+		"Jal",
+		"Jab",
+		"Jabl",
+		"Jax",
+		"Jbx",
+		"Jlx",
+		"Jablx",
+		"Jgmdablx",
+	};
+	unsigned arena_ind, i;
+
+	for (i = 0; i < 3; i++) {
+		unsigned j;
+
+		switch (i) {
+		case 0:
+			break;
+		case 1: {
+			size_t sz = sizeof(arena_ind);
+			assert_d_eq(mallctl("arenas.create", (void *)&arena_ind,
+			    &sz, NULL, 0), 0, "Unexpected mallctl failure");
+			break;
+		} case 2: {
+			size_t mib[3];
+			size_t miblen = sizeof(mib)/sizeof(size_t);
+			assert_d_eq(mallctlnametomib("arena.0.destroy",
+			    mib, &miblen), 0,
+			    "Unexpected mallctlnametomib failure");
+			mib[1] = arena_ind;
+			assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL,
+			    0), 0, "Unexpected mallctlbymib failure");
+			break;
+		} default:
+			not_reached();
+		}
+
+		for (j = 0; j < sizeof(opts)/sizeof(const char *); j++) {
+			parser_t parser;
+
+			parser_init(&parser, true);
+			malloc_stats_print(write_cb, (void *)&parser, opts[j]);
+			assert_false(parser_parse(&parser),
+			    "Unexpected parse error, opts=\"%s\"", opts[j]);
+			parser_fini(&parser);
+		}
+	}
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_json_parser,
+	    test_stats_print_json);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/ticker.c b/redis-stable/deps/jemalloc/test/unit/ticker.c
new file mode 100644
index 00000000..e5790a31
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/ticker.c
@@ -0,0 +1,73 @@
+#include "test/jemalloc_test.h"
+
+#include "jemalloc/internal/ticker.h"
+
+TEST_BEGIN(test_ticker_tick) {
+#define NREPS 2
+#define NTICKS 3
+	ticker_t ticker;
+	int32_t i, j;
+
+	ticker_init(&ticker, NTICKS);
+	for (i = 0; i < NREPS; i++) {
+		for (j = 0; j < NTICKS; j++) {
+			assert_u_eq(ticker_read(&ticker), NTICKS - j,
+			    "Unexpected ticker value (i=%d, j=%d)", i, j);
+			assert_false(ticker_tick(&ticker),
+			    "Unexpected ticker fire (i=%d, j=%d)", i, j);
+		}
+		assert_u32_eq(ticker_read(&ticker), 0,
+		    "Expected ticker depletion");
+		assert_true(ticker_tick(&ticker),
+		    "Expected ticker fire (i=%d)", i);
+		assert_u32_eq(ticker_read(&ticker), NTICKS,
+		    "Expected ticker reset");
+	}
+#undef NTICKS
+}
+TEST_END
+
+TEST_BEGIN(test_ticker_ticks) {
+#define NTICKS 3
+	ticker_t ticker;
+
+	ticker_init(&ticker, NTICKS);
+
+	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
+	assert_false(ticker_ticks(&ticker, NTICKS), "Unexpected ticker fire");
+	assert_u_eq(ticker_read(&ticker), 0, "Unexpected ticker value");
+	assert_true(ticker_ticks(&ticker, NTICKS), "Expected ticker fire");
+	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
+
+	assert_true(ticker_ticks(&ticker, NTICKS + 1), "Expected ticker fire");
+	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
+#undef NTICKS
+}
+TEST_END
+
+TEST_BEGIN(test_ticker_copy) {
+#define NTICKS 3
+	ticker_t ta, tb;
+
+	ticker_init(&ta, NTICKS);
+	ticker_copy(&tb, &ta);
+	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
+	assert_true(ticker_ticks(&tb, NTICKS + 1), "Expected ticker fire");
+	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
+
+	ticker_tick(&ta);
+	ticker_copy(&tb, &ta);
+	assert_u_eq(ticker_read(&tb), NTICKS - 1, "Unexpected ticker value");
+	assert_true(ticker_ticks(&tb, NTICKS), "Expected ticker fire");
+	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
+#undef NTICKS
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_ticker_tick,
+	    test_ticker_ticks,
+	    test_ticker_copy);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/tsd.c b/redis-stable/deps/jemalloc/test/unit/tsd.c
new file mode 100644
index 00000000..6c479139
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/tsd.c
@@ -0,0 +1,139 @@
+#include "test/jemalloc_test.h"
+
+static int data_cleanup_count;
+
+void
+data_cleanup(int *data) {
+	if (data_cleanup_count == 0) {
+		assert_x_eq(*data, MALLOC_TSD_TEST_DATA_INIT,
+		    "Argument passed into cleanup function should match tsd "
+		    "value");
+	}
+	++data_cleanup_count;
+
+	/*
+	 * Allocate during cleanup for two rounds, in order to assure that
+	 * jemalloc's internal tsd reinitialization happens.
+	 */
+	bool reincarnate = false;
+	switch (*data) {
+	case MALLOC_TSD_TEST_DATA_INIT:
+		*data = 1;
+		reincarnate = true;
+		break;
+	case 1:
+		*data = 2;
+		reincarnate = true;
+		break;
+	case 2:
+		return;
+	default:
+		not_reached();
+	}
+
+	if (reincarnate) {
+		void *p = mallocx(1, 0);
+		assert_ptr_not_null(p, "Unexpeced mallocx() failure");
+		dallocx(p, 0);
+	}
+}
+
+static void *
+thd_start(void *arg) {
+	int d = (int)(uintptr_t)arg;
+	void *p;
+
+	tsd_t *tsd = tsd_fetch();
+	assert_x_eq(tsd_test_data_get(tsd), MALLOC_TSD_TEST_DATA_INIT,
+	    "Initial tsd get should return initialization value");
+
+	p = malloc(1);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+
+	tsd_test_data_set(tsd, d);
+	assert_x_eq(tsd_test_data_get(tsd), d,
+	    "After tsd set, tsd get should return value that was set");
+
+	d = 0;
+	assert_x_eq(tsd_test_data_get(tsd), (int)(uintptr_t)arg,
+	    "Resetting local data should have no effect on tsd");
+
+	tsd_test_callback_set(tsd, &data_cleanup);
+
+	free(p);
+	return NULL;
+}
+
+TEST_BEGIN(test_tsd_main_thread) {
+	thd_start((void *)(uintptr_t)0xa5f3e329);
+}
+TEST_END
+
+TEST_BEGIN(test_tsd_sub_thread) {
+	thd_t thd;
+
+	data_cleanup_count = 0;
+	thd_create(&thd, thd_start, (void *)MALLOC_TSD_TEST_DATA_INIT);
+	thd_join(thd, NULL);
+	/*
+	 * We reincarnate twice in the data cleanup, so it should execute at
+	 * least 3 times.
+	 */
+	assert_x_ge(data_cleanup_count, 3,
+	    "Cleanup function should have executed multiple times.");
+}
+TEST_END
+
+static void *
+thd_start_reincarnated(void *arg) {
+	tsd_t *tsd = tsd_fetch();
+	assert(tsd);
+
+	void *p = malloc(1);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+
+	/* Manually trigger reincarnation. */
+	assert_ptr_not_null(tsd_arena_get(tsd),
+	    "Should have tsd arena set.");
+	tsd_cleanup((void *)tsd);
+	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
+	    "TSD arena should have been cleared.");
+	assert_u_eq(tsd->state, tsd_state_purgatory,
+	    "TSD state should be purgatory\n");
+
+	free(p);
+	assert_u_eq(tsd->state, tsd_state_reincarnated,
+	    "TSD state should be reincarnated\n");
+	p = mallocx(1, MALLOCX_TCACHE_NONE);
+	assert_ptr_not_null(p, "Unexpected malloc() failure");
+	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
+	    "Should not have tsd arena set after reincarnation.");
+
+	free(p);
+	tsd_cleanup((void *)tsd);
+	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
+	    "TSD arena should have been cleared after 2nd cleanup.");
+
+	return NULL;
+}
+
+TEST_BEGIN(test_tsd_reincarnation) {
+	thd_t thd;
+	thd_create(&thd, thd_start_reincarnated, NULL);
+	thd_join(thd, NULL);
+}
+TEST_END
+
+int
+main(void) {
+	/* Ensure tsd bootstrapped. */
+	if (nallocx(1, 0) == 0) {
+		malloc_printf("Initialization error");
+		return test_status_fail;
+	}
+
+	return test_no_reentrancy(
+	    test_tsd_main_thread,
+	    test_tsd_sub_thread,
+	    test_tsd_reincarnation);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/witness.c b/redis-stable/deps/jemalloc/test/unit/witness.c
new file mode 100644
index 00000000..5986da40
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/witness.c
@@ -0,0 +1,280 @@
+#include "test/jemalloc_test.h"
+
+static witness_lock_error_t *witness_lock_error_orig;
+static witness_owner_error_t *witness_owner_error_orig;
+static witness_not_owner_error_t *witness_not_owner_error_orig;
+static witness_depth_error_t *witness_depth_error_orig;
+
+static bool saw_lock_error;
+static bool saw_owner_error;
+static bool saw_not_owner_error;
+static bool saw_depth_error;
+
+static void
+witness_lock_error_intercept(const witness_list_t *witnesses,
+    const witness_t *witness) {
+	saw_lock_error = true;
+}
+
+static void
+witness_owner_error_intercept(const witness_t *witness) {
+	saw_owner_error = true;
+}
+
+static void
+witness_not_owner_error_intercept(const witness_t *witness) {
+	saw_not_owner_error = true;
+}
+
+static void
+witness_depth_error_intercept(const witness_list_t *witnesses,
+    witness_rank_t rank_inclusive, unsigned depth) {
+	saw_depth_error = true;
+}
+
+static int
+witness_comp(const witness_t *a, void *oa, const witness_t *b, void *ob) {
+	assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank");
+
+	assert(oa == (void *)a);
+	assert(ob == (void *)b);
+
+	return strcmp(a->name, b->name);
+}
+
+static int
+witness_comp_reverse(const witness_t *a, void *oa, const witness_t *b,
+    void *ob) {
+	assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank");
+
+	assert(oa == (void *)a);
+	assert(ob == (void *)b);
+
+	return -strcmp(a->name, b->name);
+}
+
+TEST_BEGIN(test_witness) {
+	witness_t a, b;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 0);
+
+	witness_init(&a, "a", 1, NULL, NULL);
+	witness_assert_not_owner(&witness_tsdn, &a);
+	witness_lock(&witness_tsdn, &a);
+	witness_assert_owner(&witness_tsdn, &a);
+	witness_assert_depth(&witness_tsdn, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 0);
+
+	witness_init(&b, "b", 2, NULL, NULL);
+	witness_assert_not_owner(&witness_tsdn, &b);
+	witness_lock(&witness_tsdn, &b);
+	witness_assert_owner(&witness_tsdn, &b);
+	witness_assert_depth(&witness_tsdn, 2);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 2);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)3U, 0);
+
+	witness_unlock(&witness_tsdn, &a);
+	witness_assert_depth(&witness_tsdn, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 1);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)3U, 0);
+	witness_unlock(&witness_tsdn, &b);
+
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 0);
+}
+TEST_END
+
+TEST_BEGIN(test_witness_comp) {
+	witness_t a, b, c, d;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_init(&a, "a", 1, witness_comp, &a);
+	witness_assert_not_owner(&witness_tsdn, &a);
+	witness_lock(&witness_tsdn, &a);
+	witness_assert_owner(&witness_tsdn, &a);
+	witness_assert_depth(&witness_tsdn, 1);
+
+	witness_init(&b, "b", 1, witness_comp, &b);
+	witness_assert_not_owner(&witness_tsdn, &b);
+	witness_lock(&witness_tsdn, &b);
+	witness_assert_owner(&witness_tsdn, &b);
+	witness_assert_depth(&witness_tsdn, 2);
+	witness_unlock(&witness_tsdn, &b);
+	witness_assert_depth(&witness_tsdn, 1);
+
+	witness_lock_error_orig = witness_lock_error;
+	witness_lock_error = witness_lock_error_intercept;
+	saw_lock_error = false;
+
+	witness_init(&c, "c", 1, witness_comp_reverse, &c);
+	witness_assert_not_owner(&witness_tsdn, &c);
+	assert_false(saw_lock_error, "Unexpected witness lock error");
+	witness_lock(&witness_tsdn, &c);
+	assert_true(saw_lock_error, "Expected witness lock error");
+	witness_unlock(&witness_tsdn, &c);
+	witness_assert_depth(&witness_tsdn, 1);
+
+	saw_lock_error = false;
+
+	witness_init(&d, "d", 1, NULL, NULL);
+	witness_assert_not_owner(&witness_tsdn, &d);
+	assert_false(saw_lock_error, "Unexpected witness lock error");
+	witness_lock(&witness_tsdn, &d);
+	assert_true(saw_lock_error, "Expected witness lock error");
+	witness_unlock(&witness_tsdn, &d);
+	witness_assert_depth(&witness_tsdn, 1);
+
+	witness_unlock(&witness_tsdn, &a);
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_lock_error = witness_lock_error_orig;
+}
+TEST_END
+
+TEST_BEGIN(test_witness_reversal) {
+	witness_t a, b;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_lock_error_orig = witness_lock_error;
+	witness_lock_error = witness_lock_error_intercept;
+	saw_lock_error = false;
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_init(&a, "a", 1, NULL, NULL);
+	witness_init(&b, "b", 2, NULL, NULL);
+
+	witness_lock(&witness_tsdn, &b);
+	witness_assert_depth(&witness_tsdn, 1);
+	assert_false(saw_lock_error, "Unexpected witness lock error");
+	witness_lock(&witness_tsdn, &a);
+	assert_true(saw_lock_error, "Expected witness lock error");
+
+	witness_unlock(&witness_tsdn, &a);
+	witness_assert_depth(&witness_tsdn, 1);
+	witness_unlock(&witness_tsdn, &b);
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_lock_error = witness_lock_error_orig;
+}
+TEST_END
+
+TEST_BEGIN(test_witness_recursive) {
+	witness_t a;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_not_owner_error_orig = witness_not_owner_error;
+	witness_not_owner_error = witness_not_owner_error_intercept;
+	saw_not_owner_error = false;
+
+	witness_lock_error_orig = witness_lock_error;
+	witness_lock_error = witness_lock_error_intercept;
+	saw_lock_error = false;
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_init(&a, "a", 1, NULL, NULL);
+
+	witness_lock(&witness_tsdn, &a);
+	assert_false(saw_lock_error, "Unexpected witness lock error");
+	assert_false(saw_not_owner_error, "Unexpected witness not owner error");
+	witness_lock(&witness_tsdn, &a);
+	assert_true(saw_lock_error, "Expected witness lock error");
+	assert_true(saw_not_owner_error, "Expected witness not owner error");
+
+	witness_unlock(&witness_tsdn, &a);
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_owner_error = witness_owner_error_orig;
+	witness_lock_error = witness_lock_error_orig;
+
+}
+TEST_END
+
+TEST_BEGIN(test_witness_unlock_not_owned) {
+	witness_t a;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_owner_error_orig = witness_owner_error;
+	witness_owner_error = witness_owner_error_intercept;
+	saw_owner_error = false;
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_init(&a, "a", 1, NULL, NULL);
+
+	assert_false(saw_owner_error, "Unexpected owner error");
+	witness_unlock(&witness_tsdn, &a);
+	assert_true(saw_owner_error, "Expected owner error");
+
+	witness_assert_lockless(&witness_tsdn);
+
+	witness_owner_error = witness_owner_error_orig;
+}
+TEST_END
+
+TEST_BEGIN(test_witness_depth) {
+	witness_t a;
+	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
+
+	test_skip_if(!config_debug);
+
+	witness_depth_error_orig = witness_depth_error;
+	witness_depth_error = witness_depth_error_intercept;
+	saw_depth_error = false;
+
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+
+	witness_init(&a, "a", 1, NULL, NULL);
+
+	assert_false(saw_depth_error, "Unexpected depth error");
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+
+	witness_lock(&witness_tsdn, &a);
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+	assert_true(saw_depth_error, "Expected depth error");
+
+	witness_unlock(&witness_tsdn, &a);
+
+	witness_assert_lockless(&witness_tsdn);
+	witness_assert_depth(&witness_tsdn, 0);
+
+	witness_depth_error = witness_depth_error_orig;
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_witness,
+	    test_witness_comp,
+	    test_witness_reversal,
+	    test_witness_recursive,
+	    test_witness_unlock_not_owned,
+	    test_witness_depth);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/zero.c b/redis-stable/deps/jemalloc/test/unit/zero.c
new file mode 100644
index 00000000..553692ba
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/zero.c
@@ -0,0 +1,59 @@
+#include "test/jemalloc_test.h"
+
+static void
+test_zero(size_t sz_min, size_t sz_max) {
+	uint8_t *s;
+	size_t sz_prev, sz, i;
+#define MAGIC	((uint8_t)0x61)
+
+	sz_prev = 0;
+	s = (uint8_t *)mallocx(sz_min, 0);
+	assert_ptr_not_null((void *)s, "Unexpected mallocx() failure");
+
+	for (sz = sallocx(s, 0); sz <= sz_max;
+	    sz_prev = sz, sz = sallocx(s, 0)) {
+		if (sz_prev > 0) {
+			assert_u_eq(s[0], MAGIC,
+			    "Previously allocated byte %zu/%zu is corrupted",
+			    ZU(0), sz_prev);
+			assert_u_eq(s[sz_prev-1], MAGIC,
+			    "Previously allocated byte %zu/%zu is corrupted",
+			    sz_prev-1, sz_prev);
+		}
+
+		for (i = sz_prev; i < sz; i++) {
+			assert_u_eq(s[i], 0x0,
+			    "Newly allocated byte %zu/%zu isn't zero-filled",
+			    i, sz);
+			s[i] = MAGIC;
+		}
+
+		if (xallocx(s, sz+1, 0, 0) == sz) {
+			s = (uint8_t *)rallocx(s, sz+1, 0);
+			assert_ptr_not_null((void *)s,
+			    "Unexpected rallocx() failure");
+		}
+	}
+
+	dallocx(s, 0);
+#undef MAGIC
+}
+
+TEST_BEGIN(test_zero_small) {
+	test_skip_if(!config_fill);
+	test_zero(1, SMALL_MAXCLASS-1);
+}
+TEST_END
+
+TEST_BEGIN(test_zero_large) {
+	test_skip_if(!config_fill);
+	test_zero(SMALL_MAXCLASS+1, (1U << (LG_LARGE_MINCLASS+1)));
+}
+TEST_END
+
+int
+main(void) {
+	return test(
+	    test_zero_small,
+	    test_zero_large);
+}
diff --git a/redis-stable/deps/jemalloc/test/unit/zero.sh b/redis-stable/deps/jemalloc/test/unit/zero.sh
new file mode 100644
index 00000000..b4540b27
--- /dev/null
+++ b/redis-stable/deps/jemalloc/test/unit/zero.sh
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+if [ "x${enable_fill}" = "x1" ] ; then
+  export MALLOC_CONF="abort:false,junk:false,zero:true"
+fi
diff --git a/redis-stable/deps/linenoise/.gitignore b/redis-stable/deps/linenoise/.gitignore
new file mode 100644
index 00000000..7ab7825f
--- /dev/null
+++ b/redis-stable/deps/linenoise/.gitignore
@@ -0,0 +1,3 @@
+linenoise_example
+*.dSYM
+history.txt
diff --git a/redis-stable/deps/linenoise/Makefile b/redis-stable/deps/linenoise/Makefile
new file mode 100644
index 00000000..1dd894b4
--- /dev/null
+++ b/redis-stable/deps/linenoise/Makefile
@@ -0,0 +1,21 @@
+STD=
+WARN= -Wall
+OPT= -Os
+
+R_CFLAGS= $(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS)
+R_LDFLAGS= $(LDFLAGS)
+DEBUG= -g
+
+R_CC=$(CC) $(R_CFLAGS)
+R_LD=$(CC) $(R_LDFLAGS)
+
+linenoise.o: linenoise.h linenoise.c
+
+linenoise_example: linenoise.o example.o
+	$(R_LD) -o $@ $^
+
+.c.o:
+	$(R_CC) -c $<
+
+clean:
+	rm -f linenoise_example *.o
diff --git a/redis-stable/deps/linenoise/README.markdown b/redis-stable/deps/linenoise/README.markdown
new file mode 100644
index 00000000..1afea2ae
--- /dev/null
+++ b/redis-stable/deps/linenoise/README.markdown
@@ -0,0 +1,247 @@
+# Linenoise
+
+A minimal, zero-config, BSD licensed, readline replacement used in Redis,
+MongoDB, and Android.
+
+* Single and multi line editing mode with the usual key bindings implemented.
+* History handling.
+* Completion.
+* Hints (suggestions at the right of the prompt as you type).
+* About 1,100 lines of BSD license source code.
+* Only uses a subset of VT100 escapes (ANSI.SYS compatible).
+
+## Can a line editing library be 20k lines of code?
+
+Line editing with some support for history is a really important feature for command line utilities. Instead of retyping almost the same stuff again and again it's just much better to hit the up arrow and edit on syntax errors, or in order to try a slightly different command. But apparently code dealing with terminals is some sort of Black Magic: readline is 30k lines of code, libedit 20k. Is it reasonable to link small utilities to huge libraries just to get a minimal support for line editing?
+
+So what usually happens is either:
+
+ * Large programs with configure scripts disabling line editing if readline is not present in the system, or not supporting it at all since readline is GPL licensed and libedit (the BSD clone) is not as known and available as readline is (Real world example of this problem: Tclsh).
+ * Smaller programs not using a configure script not supporting line editing at all (A problem we had with Redis-cli for instance).
+ 
+The result is a pollution of binaries without line editing support.
+
+So I spent more or less two hours doing a reality check resulting in this little library: is it *really* needed for a line editing library to be 20k lines of code? Apparently not, it is possibe to get a very small, zero configuration, trivial to embed library, that solves the problem. Smaller programs will just include this, supporting line editing out of the box. Larger programs may use this little library or just checking with configure if readline/libedit is available and resorting to Linenoise if not.
+
+## Terminals, in 2010.
+
+Apparently almost every terminal you can happen to use today has some kind of support for basic VT100 escape sequences. So I tried to write a lib using just very basic VT100 features. The resulting library appears to work everywhere I tried to use it, and now can work even on ANSI.SYS compatible terminals, since no
+VT220 specific sequences are used anymore.
+
+The library is currently about 1100 lines of code. In order to use it in your project just look at the *example.c* file in the source distribution, it is trivial. Linenoise is BSD code, so you can use both in free software and commercial software.
+
+## Tested with...
+
+ * Linux text only console ($TERM = linux)
+ * Linux KDE terminal application ($TERM = xterm)
+ * Linux xterm ($TERM = xterm)
+ * Linux Buildroot ($TERM = vt100)
+ * Mac OS X iTerm ($TERM = xterm)
+ * Mac OS X default Terminal.app ($TERM = xterm)
+ * OpenBSD 4.5 through an OSX Terminal.app ($TERM = screen)
+ * IBM AIX 6.1
+ * FreeBSD xterm ($TERM = xterm)
+ * ANSI.SYS
+ * Emacs comint mode ($TERM = dumb)
+
+Please test it everywhere you can and report back!
+
+## Let's push this forward!
+
+Patches should be provided in the respect of Linenoise sensibility for small
+easy to understand code.
+
+Send feedbacks to antirez at gmail
+
+# The API
+
+Linenoise is very easy to use, and reading the example shipped with the
+library should get you up to speed ASAP. Here is a list of API calls
+and how to use them.
+
+    char *linenoise(const char *prompt);
+
+This is the main Linenoise call: it shows the user a prompt with line editing
+and history capabilities. The prompt you specify is used as a prompt, that is,
+it will be printed to the left of the cursor. The library returns a buffer
+with the line composed by the user, or NULL on end of file or when there
+is an out of memory condition.
+
+When a tty is detected (the user is actually typing into a terminal session)
+the maximum editable line length is `LINENOISE_MAX_LINE`. When instead the
+standard input is not a tty, which happens every time you redirect a file
+to a program, or use it in an Unix pipeline, there are no limits to the
+length of the line that can be returned.
+
+The returned line should be freed with the `free()` standard system call.
+However sometimes it could happen that your program uses a different dynamic
+allocation library, so you may also used `linenoiseFree` to make sure the
+line is freed with the same allocator it was created.
+
+The canonical loop used by a program using Linenoise will be something like
+this:
+
+    while((line = linenoise("hello> ")) != NULL) {
+        printf("You wrote: %s\n", line);
+        linenoiseFree(line); /* Or just free(line) if you use libc malloc. */
+    }
+
+## Single line VS multi line editing
+
+By default, Linenoise uses single line editing, that is, a single row on the
+screen will be used, and as the user types more, the text will scroll towards
+left to make room. This works if your program is one where the user is
+unlikely to write a lot of text, otherwise multi line editing, where multiple
+screens rows are used, can be a lot more comfortable.
+
+In order to enable multi line editing use the following API call:
+
+    linenoiseSetMultiLine(1);
+
+You can disable it using `0` as argument.
+
+## History
+
+Linenoise supporst history, so that the user does not have to retype
+again and again the same things, but can use the down and up arrows in order
+to search and re-edit already inserted lines of text.
+
+The followings are the history API calls:
+
+    int linenoiseHistoryAdd(const char *line);
+    int linenoiseHistorySetMaxLen(int len);
+    int linenoiseHistorySave(const char *filename);
+    int linenoiseHistoryLoad(const char *filename);
+
+Use `linenoiseHistoryAdd` every time you want to add a new element
+to the top of the history (it will be the first the user will see when
+using the up arrow).
+
+Note that for history to work, you have to set a length for the history
+(which is zero by default, so history will be disabled if you don't set
+a proper one). This is accomplished using the `linenoiseHistorySetMaxLen`
+function.
+
+Linenoise has direct support for persisting the history into an history
+file. The functions `linenoiseHistorySave` and `linenoiseHistoryLoad` do
+just that. Both functions return -1 on error and 0 on success.
+
+## Mask mode
+
+Sometimes it is useful to allow the user to type passwords or other
+secrets that should not be displayed. For such situations linenoise supports
+a "mask mode" that will just replace the characters the user is typing 
+with `*` characters, like in the following example:
+
+    $ ./linenoise_example
+    hello> get mykey
+    echo: 'get mykey'
+    hello> /mask
+    hello> *********
+
+You can enable and disable mask mode using the following two functions:
+
+    void linenoiseMaskModeEnable(void);
+    void linenoiseMaskModeDisable(void);
+
+## Completion
+
+Linenoise supports completion, which is the ability to complete the user
+input when she or he presses the `<TAB>` key.
+
+In order to use completion, you need to register a completion callback, which
+is called every time the user presses `<TAB>`. Your callback will return a
+list of items that are completions for the current string.
+
+The following is an example of registering a completion callback:
+
+    linenoiseSetCompletionCallback(completion);
+
+The completion must be a function returning `void` and getting as input
+a `const char` pointer, which is the line the user has typed so far, and
+a `linenoiseCompletions` object pointer, which is used as argument of
+`linenoiseAddCompletion` in order to add completions inside the callback.
+An example will make it more clear:
+
+    void completion(const char *buf, linenoiseCompletions *lc) {
+        if (buf[0] == 'h') {
+            linenoiseAddCompletion(lc,"hello");
+            linenoiseAddCompletion(lc,"hello there");
+        }
+    }
+
+Basically in your completion callback, you inspect the input, and return
+a list of items that are good completions by using `linenoiseAddCompletion`.
+
+If you want to test the completion feature, compile the example program
+with `make`, run it, type `h` and press `<TAB>`.
+
+## Hints
+
+Linenoise has a feature called *hints* which is very useful when you
+use Linenoise in order to implement a REPL (Read Eval Print Loop) for
+a program that accepts commands and arguments, but may also be useful in
+other conditions.
+
+The feature shows, on the right of the cursor, as the user types, hints that
+may be useful. The hints can be displayed using a different color compared
+to the color the user is typing, and can also be bold.
+
+For example as the user starts to type `"git remote add"`, with hints it's
+possible to show on the right of the prompt a string `<name> <url>`.
+
+The feature works similarly to the history feature, using a callback.
+To register the callback we use:
+
+    linenoiseSetHintsCallback(hints);
+
+The callback itself is implemented like this:
+
+    char *hints(const char *buf, int *color, int *bold) {
+        if (!strcasecmp(buf,"git remote add")) {
+            *color = 35;
+            *bold = 0;
+            return " <name> <url>";
+        }
+        return NULL;
+    }
+
+The callback function returns the string that should be displayed or NULL
+if no hint is available for the text the user currently typed. The returned
+string will be trimmed as needed depending on the number of columns available
+on the screen.
+
+It is possible to return a string allocated in dynamic way, by also registering
+a function to deallocate the hint string once used:
+
+    void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *);
+
+The free hint callback will just receive the pointer and free the string
+as needed (depending on how the hits callback allocated it).
+
+As you can see in the example above, a `color` (in xterm color terminal codes)
+can be provided together with a `bold` attribute. If no color is set, the
+current terminal foreground color is used. If no bold attribute is set,
+non-bold text is printed.
+
+Color codes are:
+
+    red = 31
+    green = 32
+    yellow = 33
+    blue = 34
+    magenta = 35
+    cyan = 36
+    white = 37;
+
+## Screen handling
+
+Sometimes you may want to clear the screen as a result of something the
+user typed. You can do this by calling the following function:
+
+    void linenoiseClearScreen(void);
+
+## Related projects
+
+* [Linenoise NG](https://github.com/arangodb/linenoise-ng) is a fork of Linenoise that aims to add more advanced features like UTF-8 support, Windows support and other features. Uses C++ instead of C as development language.
+* [Linenoise-swift](https://github.com/andybest/linenoise-swift) is a reimplementation of Linenoise written in Swift.
diff --git a/redis-stable/deps/linenoise/example.c b/redis-stable/deps/linenoise/example.c
new file mode 100644
index 00000000..74358c32
--- /dev/null
+++ b/redis-stable/deps/linenoise/example.c
@@ -0,0 +1,79 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "linenoise.h"
+
+
+void completion(const char *buf, linenoiseCompletions *lc) {
+    if (buf[0] == 'h') {
+        linenoiseAddCompletion(lc,"hello");
+        linenoiseAddCompletion(lc,"hello there");
+    }
+}
+
+char *hints(const char *buf, int *color, int *bold) {
+    if (!strcasecmp(buf,"hello")) {
+        *color = 35;
+        *bold = 0;
+        return " World";
+    }
+    return NULL;
+}
+
+int main(int argc, char **argv) {
+    char *line;
+    char *prgname = argv[0];
+
+    /* Parse options, with --multiline we enable multi line editing. */
+    while(argc > 1) {
+        argc--;
+        argv++;
+        if (!strcmp(*argv,"--multiline")) {
+            linenoiseSetMultiLine(1);
+            printf("Multi-line mode enabled.\n");
+        } else if (!strcmp(*argv,"--keycodes")) {
+            linenoisePrintKeyCodes();
+            exit(0);
+        } else {
+            fprintf(stderr, "Usage: %s [--multiline] [--keycodes]\n", prgname);
+            exit(1);
+        }
+    }
+
+    /* Set the completion callback. This will be called every time the
+     * user uses the <tab> key. */
+    linenoiseSetCompletionCallback(completion);
+    linenoiseSetHintsCallback(hints);
+
+    /* Load history from file. The history file is just a plain text file
+     * where entries are separated by newlines. */
+    linenoiseHistoryLoad("history.txt"); /* Load the history at startup */
+
+    /* Now this is the main loop of the typical linenoise-based application.
+     * The call to linenoise() will block as long as the user types something
+     * and presses enter.
+     *
+     * The typed string is returned as a malloc() allocated string by
+     * linenoise, so the user needs to free() it. */
+    
+    while((line = linenoise("hello> ")) != NULL) {
+        /* Do something with the string. */
+        if (line[0] != '\0' && line[0] != '/') {
+            printf("echo: '%s'\n", line);
+            linenoiseHistoryAdd(line); /* Add to the history. */
+            linenoiseHistorySave("history.txt"); /* Save the history on disk. */
+        } else if (!strncmp(line,"/historylen",11)) {
+            /* The "/historylen" command will change the history len. */
+            int len = atoi(line+11);
+            linenoiseHistorySetMaxLen(len);
+        } else if (!strncmp(line, "/mask", 5)) {
+            linenoiseMaskModeEnable();
+        } else if (!strncmp(line, "/unmask", 7)) {
+            linenoiseMaskModeDisable();
+        } else if (line[0] == '/') {
+            printf("Unreconized command: %s\n", line);
+        }
+        free(line);
+    }
+    return 0;
+}
diff --git a/redis-stable/deps/linenoise/linenoise.c b/redis-stable/deps/linenoise/linenoise.c
new file mode 100644
index 00000000..ccf5c554
--- /dev/null
+++ b/redis-stable/deps/linenoise/linenoise.c
@@ -0,0 +1,1225 @@
+/* linenoise.c -- guerrilla line editing library against the idea that a
+ * line editing lib needs to be 20,000 lines of C code.
+ *
+ * You can find the latest source code at:
+ *
+ *   http://github.com/antirez/linenoise
+ *
+ * Does a number of crazy assumptions that happen to be true in 99.9999% of
+ * the 2010 UNIX computers around.
+ *
+ * ------------------------------------------------------------------------
+ *
+ * Copyright (c) 2010-2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2013, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  *  Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *
+ *  *  Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ------------------------------------------------------------------------
+ *
+ * References:
+ * - http://invisible-island.net/xterm/ctlseqs/ctlseqs.html
+ * - http://www.3waylabs.com/nw/WWW/products/wizcon/vt220.html
+ *
+ * Todo list:
+ * - Filter bogus Ctrl+<char> combinations.
+ * - Win32 support
+ *
+ * Bloat:
+ * - History search like Ctrl+r in readline?
+ *
+ * List of escape sequences used by this program, we do everything just
+ * with three sequences. In order to be so cheap we may have some
+ * flickering effect with some slow terminal, but the lesser sequences
+ * the more compatible.
+ *
+ * EL (Erase Line)
+ *    Sequence: ESC [ n K
+ *    Effect: if n is 0 or missing, clear from cursor to end of line
+ *    Effect: if n is 1, clear from beginning of line to cursor
+ *    Effect: if n is 2, clear entire line
+ *
+ * CUF (CUrsor Forward)
+ *    Sequence: ESC [ n C
+ *    Effect: moves cursor forward n chars
+ *
+ * CUB (CUrsor Backward)
+ *    Sequence: ESC [ n D
+ *    Effect: moves cursor backward n chars
+ *
+ * The following is used to get the terminal width if getting
+ * the width with the TIOCGWINSZ ioctl fails
+ *
+ * DSR (Device Status Report)
+ *    Sequence: ESC [ 6 n
+ *    Effect: reports the current cusor position as ESC [ n ; m R
+ *            where n is the row and m is the column
+ *
+ * When multi line mode is enabled, we also use an additional escape
+ * sequence. However multi line editing is disabled by default.
+ *
+ * CUU (Cursor Up)
+ *    Sequence: ESC [ n A
+ *    Effect: moves cursor up of n chars.
+ *
+ * CUD (Cursor Down)
+ *    Sequence: ESC [ n B
+ *    Effect: moves cursor down of n chars.
+ *
+ * When linenoiseClearScreen() is called, two additional escape sequences
+ * are used in order to clear the screen and position the cursor at home
+ * position.
+ *
+ * CUP (Cursor position)
+ *    Sequence: ESC [ H
+ *    Effect: moves the cursor to upper left corner
+ *
+ * ED (Erase display)
+ *    Sequence: ESC [ 2 J
+ *    Effect: clear the whole screen
+ *
+ */
+
+#include <termios.h>
+#include <unistd.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <errno.h>
+#include <string.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include <sys/ioctl.h>
+#include <unistd.h>
+#include "linenoise.h"
+
+#define LINENOISE_DEFAULT_HISTORY_MAX_LEN 100
+#define LINENOISE_MAX_LINE 4096
+static char *unsupported_term[] = {"dumb","cons25","emacs",NULL};
+static linenoiseCompletionCallback *completionCallback = NULL;
+static linenoiseHintsCallback *hintsCallback = NULL;
+static linenoiseFreeHintsCallback *freeHintsCallback = NULL;
+
+static struct termios orig_termios; /* In order to restore at exit.*/
+static int maskmode = 0; /* Show "***" instead of input. For passwords. */
+static int rawmode = 0; /* For atexit() function to check if restore is needed*/
+static int mlmode = 0;  /* Multi line mode. Default is single line. */
+static int atexit_registered = 0; /* Register atexit just 1 time. */
+static int history_max_len = LINENOISE_DEFAULT_HISTORY_MAX_LEN;
+static int history_len = 0;
+static char **history = NULL;
+
+/* The linenoiseState structure represents the state during line editing.
+ * We pass this state to functions implementing specific editing
+ * functionalities. */
+struct linenoiseState {
+    int ifd;            /* Terminal stdin file descriptor. */
+    int ofd;            /* Terminal stdout file descriptor. */
+    char *buf;          /* Edited line buffer. */
+    size_t buflen;      /* Edited line buffer size. */
+    const char *prompt; /* Prompt to display. */
+    size_t plen;        /* Prompt length. */
+    size_t pos;         /* Current cursor position. */
+    size_t oldpos;      /* Previous refresh cursor position. */
+    size_t len;         /* Current edited line length. */
+    size_t cols;        /* Number of columns in terminal. */
+    size_t maxrows;     /* Maximum num of rows used so far (multiline mode) */
+    int history_index;  /* The history index we are currently editing. */
+};
+
+enum KEY_ACTION{
+	KEY_NULL = 0,	    /* NULL */
+	CTRL_A = 1,         /* Ctrl+a */
+	CTRL_B = 2,         /* Ctrl-b */
+	CTRL_C = 3,         /* Ctrl-c */
+	CTRL_D = 4,         /* Ctrl-d */
+	CTRL_E = 5,         /* Ctrl-e */
+	CTRL_F = 6,         /* Ctrl-f */
+	CTRL_H = 8,         /* Ctrl-h */
+	TAB = 9,            /* Tab */
+	CTRL_K = 11,        /* Ctrl+k */
+	CTRL_L = 12,        /* Ctrl+l */
+	ENTER = 13,         /* Enter */
+	CTRL_N = 14,        /* Ctrl-n */
+	CTRL_P = 16,        /* Ctrl-p */
+	CTRL_T = 20,        /* Ctrl-t */
+	CTRL_U = 21,        /* Ctrl+u */
+	CTRL_W = 23,        /* Ctrl+w */
+	ESC = 27,           /* Escape */
+	BACKSPACE =  127    /* Backspace */
+};
+
+static void linenoiseAtExit(void);
+int linenoiseHistoryAdd(const char *line);
+static void refreshLine(struct linenoiseState *l);
+
+/* Debugging macro. */
+#if 0
+FILE *lndebug_fp = NULL;
+#define lndebug(...) \
+    do { \
+        if (lndebug_fp == NULL) { \
+            lndebug_fp = fopen("/tmp/lndebug.txt","a"); \
+            fprintf(lndebug_fp, \
+            "[%d %d %d] p: %d, rows: %d, rpos: %d, max: %d, oldmax: %d\n", \
+            (int)l->len,(int)l->pos,(int)l->oldpos,plen,rows,rpos, \
+            (int)l->maxrows,old_rows); \
+        } \
+        fprintf(lndebug_fp, ", " __VA_ARGS__); \
+        fflush(lndebug_fp); \
+    } while (0)
+#else
+#define lndebug(fmt, ...)
+#endif
+
+/* ======================= Low level terminal handling ====================== */
+
+/* Enable "mask mode". When it is enabled, instead of the input that
+ * the user is typing, the terminal will just display a corresponding
+ * number of asterisks, like "****". This is useful for passwords and other
+ * secrets that should not be displayed. */
+void linenoiseMaskModeEnable(void) {
+    maskmode = 1;
+}
+
+/* Disable mask mode. */
+void linenoiseMaskModeDisable(void) {
+    maskmode = 0;
+}
+
+/* Set if to use or not the multi line mode. */
+void linenoiseSetMultiLine(int ml) {
+    mlmode = ml;
+}
+
+/* Return true if the terminal name is in the list of terminals we know are
+ * not able to understand basic escape sequences. */
+static int isUnsupportedTerm(void) {
+    char *term = getenv("TERM");
+    int j;
+
+    if (term == NULL) return 0;
+    for (j = 0; unsupported_term[j]; j++)
+        if (!strcasecmp(term,unsupported_term[j])) return 1;
+    return 0;
+}
+
+/* Raw mode: 1960 magic shit. */
+static int enableRawMode(int fd) {
+    struct termios raw;
+
+    if (!isatty(STDIN_FILENO)) goto fatal;
+    if (!atexit_registered) {
+        atexit(linenoiseAtExit);
+        atexit_registered = 1;
+    }
+    if (tcgetattr(fd,&orig_termios) == -1) goto fatal;
+
+    raw = orig_termios;  /* modify the original mode */
+    /* input modes: no break, no CR to NL, no parity check, no strip char,
+     * no start/stop output control. */
+    raw.c_iflag &= ~(BRKINT | ICRNL | INPCK | ISTRIP | IXON);
+    /* output modes - disable post processing */
+    raw.c_oflag &= ~(OPOST);
+    /* control modes - set 8 bit chars */
+    raw.c_cflag |= (CS8);
+    /* local modes - choing off, canonical off, no extended functions,
+     * no signal chars (^Z,^C) */
+    raw.c_lflag &= ~(ECHO | ICANON | IEXTEN | ISIG);
+    /* control chars - set return condition: min number of bytes and timer.
+     * We want read to return every single byte, without timeout. */
+    raw.c_cc[VMIN] = 1; raw.c_cc[VTIME] = 0; /* 1 byte, no timer */
+
+    /* put terminal in raw mode after flushing */
+    if (tcsetattr(fd,TCSAFLUSH,&raw) < 0) goto fatal;
+    rawmode = 1;
+    return 0;
+
+fatal:
+    errno = ENOTTY;
+    return -1;
+}
+
+static void disableRawMode(int fd) {
+    /* Don't even check the return value as it's too late. */
+    if (rawmode && tcsetattr(fd,TCSAFLUSH,&orig_termios) != -1)
+        rawmode = 0;
+}
+
+/* Use the ESC [6n escape sequence to query the horizontal cursor position
+ * and return it. On error -1 is returned, on success the position of the
+ * cursor. */
+static int getCursorPosition(int ifd, int ofd) {
+    char buf[32];
+    int cols, rows;
+    unsigned int i = 0;
+
+    /* Report cursor location */
+    if (write(ofd, "\x1b[6n", 4) != 4) return -1;
+
+    /* Read the response: ESC [ rows ; cols R */
+    while (i < sizeof(buf)-1) {
+        if (read(ifd,buf+i,1) != 1) break;
+        if (buf[i] == 'R') break;
+        i++;
+    }
+    buf[i] = '\0';
+
+    /* Parse it. */
+    if (buf[0] != ESC || buf[1] != '[') return -1;
+    if (sscanf(buf+2,"%d;%d",&rows,&cols) != 2) return -1;
+    return cols;
+}
+
+/* Try to get the number of columns in the current terminal, or assume 80
+ * if it fails. */
+static int getColumns(int ifd, int ofd) {
+    struct winsize ws;
+
+    if (ioctl(1, TIOCGWINSZ, &ws) == -1 || ws.ws_col == 0) {
+        /* ioctl() failed. Try to query the terminal itself. */
+        int start, cols;
+
+        /* Get the initial position so we can restore it later. */
+        start = getCursorPosition(ifd,ofd);
+        if (start == -1) goto failed;
+
+        /* Go to right margin and get position. */
+        if (write(ofd,"\x1b[999C",6) != 6) goto failed;
+        cols = getCursorPosition(ifd,ofd);
+        if (cols == -1) goto failed;
+
+        /* Restore position. */
+        if (cols > start) {
+            char seq[32];
+            snprintf(seq,32,"\x1b[%dD",cols-start);
+            if (write(ofd,seq,strlen(seq)) == -1) {
+                /* Can't recover... */
+            }
+        }
+        return cols;
+    } else {
+        return ws.ws_col;
+    }
+
+failed:
+    return 80;
+}
+
+/* Clear the screen. Used to handle ctrl+l */
+void linenoiseClearScreen(void) {
+    if (write(STDOUT_FILENO,"\x1b[H\x1b[2J",7) <= 0) {
+        /* nothing to do, just to avoid warning. */
+    }
+}
+
+/* Beep, used for completion when there is nothing to complete or when all
+ * the choices were already shown. */
+static void linenoiseBeep(void) {
+    fprintf(stderr, "\x7");
+    fflush(stderr);
+}
+
+/* ============================== Completion ================================ */
+
+/* Free a list of completion option populated by linenoiseAddCompletion(). */
+static void freeCompletions(linenoiseCompletions *lc) {
+    size_t i;
+    for (i = 0; i < lc->len; i++)
+        free(lc->cvec[i]);
+    if (lc->cvec != NULL)
+        free(lc->cvec);
+}
+
+/* This is an helper function for linenoiseEdit() and is called when the
+ * user types the <tab> key in order to complete the string currently in the
+ * input.
+ *
+ * The state of the editing is encapsulated into the pointed linenoiseState
+ * structure as described in the structure definition. */
+static int completeLine(struct linenoiseState *ls) {
+    linenoiseCompletions lc = { 0, NULL };
+    int nread, nwritten;
+    char c = 0;
+
+    completionCallback(ls->buf,&lc);
+    if (lc.len == 0) {
+        linenoiseBeep();
+    } else {
+        size_t stop = 0, i = 0;
+
+        while(!stop) {
+            /* Show completion or original buffer */
+            if (i < lc.len) {
+                struct linenoiseState saved = *ls;
+
+                ls->len = ls->pos = strlen(lc.cvec[i]);
+                ls->buf = lc.cvec[i];
+                refreshLine(ls);
+                ls->len = saved.len;
+                ls->pos = saved.pos;
+                ls->buf = saved.buf;
+            } else {
+                refreshLine(ls);
+            }
+
+            nread = read(ls->ifd,&c,1);
+            if (nread <= 0) {
+                freeCompletions(&lc);
+                return -1;
+            }
+
+            switch(c) {
+                case 9: /* tab */
+                    i = (i+1) % (lc.len+1);
+                    if (i == lc.len) linenoiseBeep();
+                    break;
+                case 27: /* escape */
+                    /* Re-show original buffer */
+                    if (i < lc.len) refreshLine(ls);
+                    stop = 1;
+                    break;
+                default:
+                    /* Update buffer and return */
+                    if (i < lc.len) {
+                        nwritten = snprintf(ls->buf,ls->buflen,"%s",lc.cvec[i]);
+                        ls->len = ls->pos = nwritten;
+                    }
+                    stop = 1;
+                    break;
+            }
+        }
+    }
+
+    freeCompletions(&lc);
+    return c; /* Return last read character */
+}
+
+/* Register a callback function to be called for tab-completion. */
+void linenoiseSetCompletionCallback(linenoiseCompletionCallback *fn) {
+    completionCallback = fn;
+}
+
+/* Register a hits function to be called to show hits to the user at the
+ * right of the prompt. */
+void linenoiseSetHintsCallback(linenoiseHintsCallback *fn) {
+    hintsCallback = fn;
+}
+
+/* Register a function to free the hints returned by the hints callback
+ * registered with linenoiseSetHintsCallback(). */
+void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *fn) {
+    freeHintsCallback = fn;
+}
+
+/* This function is used by the callback function registered by the user
+ * in order to add completion options given the input string when the
+ * user typed <tab>. See the example.c source code for a very easy to
+ * understand example. */
+void linenoiseAddCompletion(linenoiseCompletions *lc, const char *str) {
+    size_t len = strlen(str);
+    char *copy, **cvec;
+
+    copy = malloc(len+1);
+    if (copy == NULL) return;
+    memcpy(copy,str,len+1);
+    cvec = realloc(lc->cvec,sizeof(char*)*(lc->len+1));
+    if (cvec == NULL) {
+        free(copy);
+        return;
+    }
+    lc->cvec = cvec;
+    lc->cvec[lc->len++] = copy;
+}
+
+/* =========================== Line editing ================================= */
+
+/* We define a very simple "append buffer" structure, that is an heap
+ * allocated string where we can append to. This is useful in order to
+ * write all the escape sequences in a buffer and flush them to the standard
+ * output in a single call, to avoid flickering effects. */
+struct abuf {
+    char *b;
+    int len;
+};
+
+static void abInit(struct abuf *ab) {
+    ab->b = NULL;
+    ab->len = 0;
+}
+
+static void abAppend(struct abuf *ab, const char *s, int len) {
+    char *new = realloc(ab->b,ab->len+len);
+
+    if (new == NULL) return;
+    memcpy(new+ab->len,s,len);
+    ab->b = new;
+    ab->len += len;
+}
+
+static void abFree(struct abuf *ab) {
+    free(ab->b);
+}
+
+/* Helper of refreshSingleLine() and refreshMultiLine() to show hints
+ * to the right of the prompt. */
+void refreshShowHints(struct abuf *ab, struct linenoiseState *l, int plen) {
+    char seq[64];
+    if (hintsCallback && plen+l->len < l->cols) {
+        int color = -1, bold = 0;
+        char *hint = hintsCallback(l->buf,&color,&bold);
+        if (hint) {
+            int hintlen = strlen(hint);
+            int hintmaxlen = l->cols-(plen+l->len);
+            if (hintlen > hintmaxlen) hintlen = hintmaxlen;
+            if (bold == 1 && color == -1) color = 37;
+            if (color != -1 || bold != 0)
+                snprintf(seq,64,"\033[%d;%d;49m",bold,color);
+            else
+                seq[0] = '\0';
+            abAppend(ab,seq,strlen(seq));
+            abAppend(ab,hint,hintlen);
+            if (color != -1 || bold != 0)
+                abAppend(ab,"\033[0m",4);
+            /* Call the function to free the hint returned. */
+            if (freeHintsCallback) freeHintsCallback(hint);
+        }
+    }
+}
+
+/* Single line low level line refresh.
+ *
+ * Rewrite the currently edited line accordingly to the buffer content,
+ * cursor position, and number of columns of the terminal. */
+static void refreshSingleLine(struct linenoiseState *l) {
+    char seq[64];
+    size_t plen = strlen(l->prompt);
+    int fd = l->ofd;
+    char *buf = l->buf;
+    size_t len = l->len;
+    size_t pos = l->pos;
+    struct abuf ab;
+
+    while((plen+pos) >= l->cols) {
+        buf++;
+        len--;
+        pos--;
+    }
+    while (plen+len > l->cols) {
+        len--;
+    }
+
+    abInit(&ab);
+    /* Cursor to left edge */
+    snprintf(seq,64,"\r");
+    abAppend(&ab,seq,strlen(seq));
+    /* Write the prompt and the current buffer content */
+    abAppend(&ab,l->prompt,strlen(l->prompt));
+    if (maskmode == 1) {
+        while (len--) abAppend(&ab,"*",1);
+    } else {
+        abAppend(&ab,buf,len);
+    }
+    /* Show hits if any. */
+    refreshShowHints(&ab,l,plen);
+    /* Erase to right */
+    snprintf(seq,64,"\x1b[0K");
+    abAppend(&ab,seq,strlen(seq));
+    /* Move cursor to original position. */
+    snprintf(seq,64,"\r\x1b[%dC", (int)(pos+plen));
+    abAppend(&ab,seq,strlen(seq));
+    if (write(fd,ab.b,ab.len) == -1) {} /* Can't recover from write error. */
+    abFree(&ab);
+}
+
+/* Multi line low level line refresh.
+ *
+ * Rewrite the currently edited line accordingly to the buffer content,
+ * cursor position, and number of columns of the terminal. */
+static void refreshMultiLine(struct linenoiseState *l) {
+    char seq[64];
+    int plen = strlen(l->prompt);
+    int rows = (plen+l->len+l->cols-1)/l->cols; /* rows used by current buf. */
+    int rpos = (plen+l->oldpos+l->cols)/l->cols; /* cursor relative row. */
+    int rpos2; /* rpos after refresh. */
+    int col; /* colum position, zero-based. */
+    int old_rows = l->maxrows;
+    int fd = l->ofd, j;
+    struct abuf ab;
+
+    /* Update maxrows if needed. */
+    if (rows > (int)l->maxrows) l->maxrows = rows;
+
+    /* First step: clear all the lines used before. To do so start by
+     * going to the last row. */
+    abInit(&ab);
+    if (old_rows-rpos > 0) {
+        lndebug("go down %d", old_rows-rpos);
+        snprintf(seq,64,"\x1b[%dB", old_rows-rpos);
+        abAppend(&ab,seq,strlen(seq));
+    }
+
+    /* Now for every row clear it, go up. */
+    for (j = 0; j < old_rows-1; j++) {
+        lndebug("clear+up");
+        snprintf(seq,64,"\r\x1b[0K\x1b[1A");
+        abAppend(&ab,seq,strlen(seq));
+    }
+
+    /* Clean the top line. */
+    lndebug("clear");
+    snprintf(seq,64,"\r\x1b[0K");
+    abAppend(&ab,seq,strlen(seq));
+
+    /* Write the prompt and the current buffer content */
+    abAppend(&ab,l->prompt,strlen(l->prompt));
+    if (maskmode == 1) {
+        unsigned int i;
+        for (i = 0; i < l->len; i++) abAppend(&ab,"*",1);
+    } else {
+        abAppend(&ab,l->buf,l->len);
+    }
+
+    /* Show hits if any. */
+    refreshShowHints(&ab,l,plen);
+
+    /* If we are at the very end of the screen with our prompt, we need to
+     * emit a newline and move the prompt to the first column. */
+    if (l->pos &&
+        l->pos == l->len &&
+        (l->pos+plen) % l->cols == 0)
+    {
+        lndebug("<newline>");
+        abAppend(&ab,"\n",1);
+        snprintf(seq,64,"\r");
+        abAppend(&ab,seq,strlen(seq));
+        rows++;
+        if (rows > (int)l->maxrows) l->maxrows = rows;
+    }
+
+    /* Move cursor to right position. */
+    rpos2 = (plen+l->pos+l->cols)/l->cols; /* current cursor relative row. */
+    lndebug("rpos2 %d", rpos2);
+
+    /* Go up till we reach the expected position. */
+    if (rows-rpos2 > 0) {
+        lndebug("go-up %d", rows-rpos2);
+        snprintf(seq,64,"\x1b[%dA", rows-rpos2);
+        abAppend(&ab,seq,strlen(seq));
+    }
+
+    /* Set column. */
+    col = (plen+(int)l->pos) % (int)l->cols;
+    lndebug("set col %d", 1+col);
+    if (col)
+        snprintf(seq,64,"\r\x1b[%dC", col);
+    else
+        snprintf(seq,64,"\r");
+    abAppend(&ab,seq,strlen(seq));
+
+    lndebug("\n");
+    l->oldpos = l->pos;
+
+    if (write(fd,ab.b,ab.len) == -1) {} /* Can't recover from write error. */
+    abFree(&ab);
+}
+
+/* Calls the two low level functions refreshSingleLine() or
+ * refreshMultiLine() according to the selected mode. */
+static void refreshLine(struct linenoiseState *l) {
+    if (mlmode)
+        refreshMultiLine(l);
+    else
+        refreshSingleLine(l);
+}
+
+/* Insert the character 'c' at cursor current position.
+ *
+ * On error writing to the terminal -1 is returned, otherwise 0. */
+int linenoiseEditInsert(struct linenoiseState *l, char c) {
+    if (l->len < l->buflen) {
+        if (l->len == l->pos) {
+            l->buf[l->pos] = c;
+            l->pos++;
+            l->len++;
+            l->buf[l->len] = '\0';
+            if ((!mlmode && l->plen+l->len < l->cols && !hintsCallback)) {
+                /* Avoid a full update of the line in the
+                 * trivial case. */
+                char d = (maskmode==1) ? '*' : c;
+                if (write(l->ofd,&d,1) == -1) return -1;
+            } else {
+                refreshLine(l);
+            }
+        } else {
+            memmove(l->buf+l->pos+1,l->buf+l->pos,l->len-l->pos);
+            l->buf[l->pos] = c;
+            l->len++;
+            l->pos++;
+            l->buf[l->len] = '\0';
+            refreshLine(l);
+        }
+    }
+    return 0;
+}
+
+/* Move cursor on the left. */
+void linenoiseEditMoveLeft(struct linenoiseState *l) {
+    if (l->pos > 0) {
+        l->pos--;
+        refreshLine(l);
+    }
+}
+
+/* Move cursor on the right. */
+void linenoiseEditMoveRight(struct linenoiseState *l) {
+    if (l->pos != l->len) {
+        l->pos++;
+        refreshLine(l);
+    }
+}
+
+/* Move cursor to the start of the line. */
+void linenoiseEditMoveHome(struct linenoiseState *l) {
+    if (l->pos != 0) {
+        l->pos = 0;
+        refreshLine(l);
+    }
+}
+
+/* Move cursor to the end of the line. */
+void linenoiseEditMoveEnd(struct linenoiseState *l) {
+    if (l->pos != l->len) {
+        l->pos = l->len;
+        refreshLine(l);
+    }
+}
+
+/* Substitute the currently edited line with the next or previous history
+ * entry as specified by 'dir'. */
+#define LINENOISE_HISTORY_NEXT 0
+#define LINENOISE_HISTORY_PREV 1
+void linenoiseEditHistoryNext(struct linenoiseState *l, int dir) {
+    if (history_len > 1) {
+        /* Update the current history entry before to
+         * overwrite it with the next one. */
+        free(history[history_len - 1 - l->history_index]);
+        history[history_len - 1 - l->history_index] = strdup(l->buf);
+        /* Show the new entry */
+        l->history_index += (dir == LINENOISE_HISTORY_PREV) ? 1 : -1;
+        if (l->history_index < 0) {
+            l->history_index = 0;
+            return;
+        } else if (l->history_index >= history_len) {
+            l->history_index = history_len-1;
+            return;
+        }
+        strncpy(l->buf,history[history_len - 1 - l->history_index],l->buflen);
+        l->buf[l->buflen-1] = '\0';
+        l->len = l->pos = strlen(l->buf);
+        refreshLine(l);
+    }
+}
+
+/* Delete the character at the right of the cursor without altering the cursor
+ * position. Basically this is what happens with the "Delete" keyboard key. */
+void linenoiseEditDelete(struct linenoiseState *l) {
+    if (l->len > 0 && l->pos < l->len) {
+        memmove(l->buf+l->pos,l->buf+l->pos+1,l->len-l->pos-1);
+        l->len--;
+        l->buf[l->len] = '\0';
+        refreshLine(l);
+    }
+}
+
+/* Backspace implementation. */
+void linenoiseEditBackspace(struct linenoiseState *l) {
+    if (l->pos > 0 && l->len > 0) {
+        memmove(l->buf+l->pos-1,l->buf+l->pos,l->len-l->pos);
+        l->pos--;
+        l->len--;
+        l->buf[l->len] = '\0';
+        refreshLine(l);
+    }
+}
+
+/* Delete the previous word, maintaining the cursor at the start of the
+ * current word. */
+void linenoiseEditDeletePrevWord(struct linenoiseState *l) {
+    size_t old_pos = l->pos;
+    size_t diff;
+
+    while (l->pos > 0 && l->buf[l->pos-1] == ' ')
+        l->pos--;
+    while (l->pos > 0 && l->buf[l->pos-1] != ' ')
+        l->pos--;
+    diff = old_pos - l->pos;
+    memmove(l->buf+l->pos,l->buf+old_pos,l->len-old_pos+1);
+    l->len -= diff;
+    refreshLine(l);
+}
+
+/* This function is the core of the line editing capability of linenoise.
+ * It expects 'fd' to be already in "raw mode" so that every key pressed
+ * will be returned ASAP to read().
+ *
+ * The resulting string is put into 'buf' when the user type enter, or
+ * when ctrl+d is typed.
+ *
+ * The function returns the length of the current buffer. */
+static int linenoiseEdit(int stdin_fd, int stdout_fd, char *buf, size_t buflen, const char *prompt)
+{
+    struct linenoiseState l;
+
+    /* Populate the linenoise state that we pass to functions implementing
+     * specific editing functionalities. */
+    l.ifd = stdin_fd;
+    l.ofd = stdout_fd;
+    l.buf = buf;
+    l.buflen = buflen;
+    l.prompt = prompt;
+    l.plen = strlen(prompt);
+    l.oldpos = l.pos = 0;
+    l.len = 0;
+    l.cols = getColumns(stdin_fd, stdout_fd);
+    l.maxrows = 0;
+    l.history_index = 0;
+
+    /* Buffer starts empty. */
+    l.buf[0] = '\0';
+    l.buflen--; /* Make sure there is always space for the nulterm */
+
+    /* The latest history entry is always our current buffer, that
+     * initially is just an empty string. */
+    linenoiseHistoryAdd("");
+
+    if (write(l.ofd,prompt,l.plen) == -1) return -1;
+    while(1) {
+        char c;
+        int nread;
+        char seq[3];
+
+        nread = read(l.ifd,&c,1);
+        if (nread <= 0) return l.len;
+
+        /* Only autocomplete when the callback is set. It returns < 0 when
+         * there was an error reading from fd. Otherwise it will return the
+         * character that should be handled next. */
+        if (c == 9 && completionCallback != NULL) {
+            c = completeLine(&l);
+            /* Return on errors */
+            if (c < 0) return l.len;
+            /* Read next character when 0 */
+            if (c == 0) continue;
+        }
+
+        switch(c) {
+        case ENTER:    /* enter */
+            history_len--;
+            free(history[history_len]);
+            if (mlmode) linenoiseEditMoveEnd(&l);
+            if (hintsCallback) {
+                /* Force a refresh without hints to leave the previous
+                 * line as the user typed it after a newline. */
+                linenoiseHintsCallback *hc = hintsCallback;
+                hintsCallback = NULL;
+                refreshLine(&l);
+                hintsCallback = hc;
+            }
+            return (int)l.len;
+        case CTRL_C:     /* ctrl-c */
+            errno = EAGAIN;
+            return -1;
+        case BACKSPACE:   /* backspace */
+        case 8:     /* ctrl-h */
+            linenoiseEditBackspace(&l);
+            break;
+        case CTRL_D:     /* ctrl-d, remove char at right of cursor, or if the
+                            line is empty, act as end-of-file. */
+            if (l.len > 0) {
+                linenoiseEditDelete(&l);
+            } else {
+                history_len--;
+                free(history[history_len]);
+                return -1;
+            }
+            break;
+        case CTRL_T:    /* ctrl-t, swaps current character with previous. */
+            if (l.pos > 0 && l.pos < l.len) {
+                int aux = buf[l.pos-1];
+                buf[l.pos-1] = buf[l.pos];
+                buf[l.pos] = aux;
+                if (l.pos != l.len-1) l.pos++;
+                refreshLine(&l);
+            }
+            break;
+        case CTRL_B:     /* ctrl-b */
+            linenoiseEditMoveLeft(&l);
+            break;
+        case CTRL_F:     /* ctrl-f */
+            linenoiseEditMoveRight(&l);
+            break;
+        case CTRL_P:    /* ctrl-p */
+            linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_PREV);
+            break;
+        case CTRL_N:    /* ctrl-n */
+            linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_NEXT);
+            break;
+        case ESC:    /* escape sequence */
+            /* Read the next two bytes representing the escape sequence.
+             * Use two calls to handle slow terminals returning the two
+             * chars at different times. */
+            if (read(l.ifd,seq,1) == -1) break;
+            if (read(l.ifd,seq+1,1) == -1) break;
+
+            /* ESC [ sequences. */
+            if (seq[0] == '[') {
+                if (seq[1] >= '0' && seq[1] <= '9') {
+                    /* Extended escape, read additional byte. */
+                    if (read(l.ifd,seq+2,1) == -1) break;
+                    if (seq[2] == '~') {
+                        switch(seq[1]) {
+                        case '3': /* Delete key. */
+                            linenoiseEditDelete(&l);
+                            break;
+                        }
+                    }
+                } else {
+                    switch(seq[1]) {
+                    case 'A': /* Up */
+                        linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_PREV);
+                        break;
+                    case 'B': /* Down */
+                        linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_NEXT);
+                        break;
+                    case 'C': /* Right */
+                        linenoiseEditMoveRight(&l);
+                        break;
+                    case 'D': /* Left */
+                        linenoiseEditMoveLeft(&l);
+                        break;
+                    case 'H': /* Home */
+                        linenoiseEditMoveHome(&l);
+                        break;
+                    case 'F': /* End*/
+                        linenoiseEditMoveEnd(&l);
+                        break;
+                    }
+                }
+            }
+
+            /* ESC O sequences. */
+            else if (seq[0] == 'O') {
+                switch(seq[1]) {
+                case 'H': /* Home */
+                    linenoiseEditMoveHome(&l);
+                    break;
+                case 'F': /* End*/
+                    linenoiseEditMoveEnd(&l);
+                    break;
+                }
+            }
+            break;
+        default:
+            if (linenoiseEditInsert(&l,c)) return -1;
+            break;
+        case CTRL_U: /* Ctrl+u, delete the whole line. */
+            buf[0] = '\0';
+            l.pos = l.len = 0;
+            refreshLine(&l);
+            break;
+        case CTRL_K: /* Ctrl+k, delete from current to end of line. */
+            buf[l.pos] = '\0';
+            l.len = l.pos;
+            refreshLine(&l);
+            break;
+        case CTRL_A: /* Ctrl+a, go to the start of the line */
+            linenoiseEditMoveHome(&l);
+            break;
+        case CTRL_E: /* ctrl+e, go to the end of the line */
+            linenoiseEditMoveEnd(&l);
+            break;
+        case CTRL_L: /* ctrl+l, clear screen */
+            linenoiseClearScreen();
+            refreshLine(&l);
+            break;
+        case CTRL_W: /* ctrl+w, delete previous word */
+            linenoiseEditDeletePrevWord(&l);
+            break;
+        }
+    }
+    return l.len;
+}
+
+/* This special mode is used by linenoise in order to print scan codes
+ * on screen for debugging / development purposes. It is implemented
+ * by the linenoise_example program using the --keycodes option. */
+void linenoisePrintKeyCodes(void) {
+    char quit[4];
+
+    printf("Linenoise key codes debugging mode.\n"
+            "Press keys to see scan codes. Type 'quit' at any time to exit.\n");
+    if (enableRawMode(STDIN_FILENO) == -1) return;
+    memset(quit,' ',4);
+    while(1) {
+        char c;
+        int nread;
+
+        nread = read(STDIN_FILENO,&c,1);
+        if (nread <= 0) continue;
+        memmove(quit,quit+1,sizeof(quit)-1); /* shift string to left. */
+        quit[sizeof(quit)-1] = c; /* Insert current char on the right. */
+        if (memcmp(quit,"quit",sizeof(quit)) == 0) break;
+
+        printf("'%c' %02x (%d) (type quit to exit)\n",
+            isprint(c) ? c : '?', (int)c, (int)c);
+        printf("\r"); /* Go left edge manually, we are in raw mode. */
+        fflush(stdout);
+    }
+    disableRawMode(STDIN_FILENO);
+}
+
+/* This function calls the line editing function linenoiseEdit() using
+ * the STDIN file descriptor set in raw mode. */
+static int linenoiseRaw(char *buf, size_t buflen, const char *prompt) {
+    int count;
+
+    if (buflen == 0) {
+        errno = EINVAL;
+        return -1;
+    }
+
+    if (enableRawMode(STDIN_FILENO) == -1) return -1;
+    count = linenoiseEdit(STDIN_FILENO, STDOUT_FILENO, buf, buflen, prompt);
+    disableRawMode(STDIN_FILENO);
+    printf("\n");
+    return count;
+}
+
+/* This function is called when linenoise() is called with the standard
+ * input file descriptor not attached to a TTY. So for example when the
+ * program using linenoise is called in pipe or with a file redirected
+ * to its standard input. In this case, we want to be able to return the
+ * line regardless of its length (by default we are limited to 4k). */
+static char *linenoiseNoTTY(void) {
+    char *line = NULL;
+    size_t len = 0, maxlen = 0;
+
+    while(1) {
+        if (len == maxlen) {
+            if (maxlen == 0) maxlen = 16;
+            maxlen *= 2;
+            char *oldval = line;
+            line = realloc(line,maxlen);
+            if (line == NULL) {
+                if (oldval) free(oldval);
+                return NULL;
+            }
+        }
+        int c = fgetc(stdin);
+        if (c == EOF || c == '\n') {
+            if (c == EOF && len == 0) {
+                free(line);
+                return NULL;
+            } else {
+                line[len] = '\0';
+                return line;
+            }
+        } else {
+            line[len] = c;
+            len++;
+        }
+    }
+}
+
+/* The high level function that is the main API of the linenoise library.
+ * This function checks if the terminal has basic capabilities, just checking
+ * for a blacklist of stupid terminals, and later either calls the line
+ * editing function or uses dummy fgets() so that you will be able to type
+ * something even in the most desperate of the conditions. */
+char *linenoise(const char *prompt) {
+    char buf[LINENOISE_MAX_LINE];
+    int count;
+
+    if (!isatty(STDIN_FILENO)) {
+        /* Not a tty: read from file / pipe. In this mode we don't want any
+         * limit to the line size, so we call a function to handle that. */
+        return linenoiseNoTTY();
+    } else if (isUnsupportedTerm()) {
+        size_t len;
+
+        printf("%s",prompt);
+        fflush(stdout);
+        if (fgets(buf,LINENOISE_MAX_LINE,stdin) == NULL) return NULL;
+        len = strlen(buf);
+        while(len && (buf[len-1] == '\n' || buf[len-1] == '\r')) {
+            len--;
+            buf[len] = '\0';
+        }
+        return strdup(buf);
+    } else {
+        count = linenoiseRaw(buf,LINENOISE_MAX_LINE,prompt);
+        if (count == -1) return NULL;
+        return strdup(buf);
+    }
+}
+
+/* This is just a wrapper the user may want to call in order to make sure
+ * the linenoise returned buffer is freed with the same allocator it was
+ * created with. Useful when the main program is using an alternative
+ * allocator. */
+void linenoiseFree(void *ptr) {
+    free(ptr);
+}
+
+/* ================================ History ================================= */
+
+/* Free the history, but does not reset it. Only used when we have to
+ * exit() to avoid memory leaks are reported by valgrind & co. */
+static void freeHistory(void) {
+    if (history) {
+        int j;
+
+        for (j = 0; j < history_len; j++)
+            free(history[j]);
+        free(history);
+    }
+}
+
+/* At exit we'll try to fix the terminal to the initial conditions. */
+static void linenoiseAtExit(void) {
+    disableRawMode(STDIN_FILENO);
+    freeHistory();
+}
+
+/* This is the API call to add a new entry in the linenoise history.
+ * It uses a fixed array of char pointers that are shifted (memmoved)
+ * when the history max length is reached in order to remove the older
+ * entry and make room for the new one, so it is not exactly suitable for huge
+ * histories, but will work well for a few hundred of entries.
+ *
+ * Using a circular buffer is smarter, but a bit more complex to handle. */
+int linenoiseHistoryAdd(const char *line) {
+    char *linecopy;
+
+    if (history_max_len == 0) return 0;
+
+    /* Initialization on first call. */
+    if (history == NULL) {
+        history = malloc(sizeof(char*)*history_max_len);
+        if (history == NULL) return 0;
+        memset(history,0,(sizeof(char*)*history_max_len));
+    }
+
+    /* Don't add duplicated lines. */
+    if (history_len && !strcmp(history[history_len-1], line)) return 0;
+
+    /* Add an heap allocated copy of the line in the history.
+     * If we reached the max length, remove the older line. */
+    linecopy = strdup(line);
+    if (!linecopy) return 0;
+    if (history_len == history_max_len) {
+        free(history[0]);
+        memmove(history,history+1,sizeof(char*)*(history_max_len-1));
+        history_len--;
+    }
+    history[history_len] = linecopy;
+    history_len++;
+    return 1;
+}
+
+/* Set the maximum length for the history. This function can be called even
+ * if there is already some history, the function will make sure to retain
+ * just the latest 'len' elements if the new history length value is smaller
+ * than the amount of items already inside the history. */
+int linenoiseHistorySetMaxLen(int len) {
+    char **new;
+
+    if (len < 1) return 0;
+    if (history) {
+        int tocopy = history_len;
+
+        new = malloc(sizeof(char*)*len);
+        if (new == NULL) return 0;
+
+        /* If we can't copy everything, free the elements we'll not use. */
+        if (len < tocopy) {
+            int j;
+
+            for (j = 0; j < tocopy-len; j++) free(history[j]);
+            tocopy = len;
+        }
+        memset(new,0,sizeof(char*)*len);
+        memcpy(new,history+(history_len-tocopy), sizeof(char*)*tocopy);
+        free(history);
+        history = new;
+    }
+    history_max_len = len;
+    if (history_len > history_max_len)
+        history_len = history_max_len;
+    return 1;
+}
+
+/* Save the history in the specified file. On success 0 is returned
+ * otherwise -1 is returned. */
+int linenoiseHistorySave(const char *filename) {
+    mode_t old_umask = umask(S_IXUSR|S_IRWXG|S_IRWXO);
+    FILE *fp;
+    int j;
+
+    fp = fopen(filename,"w");
+    umask(old_umask);
+    if (fp == NULL) return -1;
+    chmod(filename,S_IRUSR|S_IWUSR);
+    for (j = 0; j < history_len; j++)
+        fprintf(fp,"%s\n",history[j]);
+    fclose(fp);
+    return 0;
+}
+
+/* Load the history from the specified file. If the file does not exist
+ * zero is returned and no operation is performed.
+ *
+ * If the file exists and the operation succeeded 0 is returned, otherwise
+ * on error -1 is returned. */
+int linenoiseHistoryLoad(const char *filename) {
+    FILE *fp = fopen(filename,"r");
+    char buf[LINENOISE_MAX_LINE];
+
+    if (fp == NULL) return -1;
+
+    while (fgets(buf,LINENOISE_MAX_LINE,fp) != NULL) {
+        char *p;
+
+        p = strchr(buf,'\r');
+        if (!p) p = strchr(buf,'\n');
+        if (p) *p = '\0';
+        linenoiseHistoryAdd(buf);
+    }
+    fclose(fp);
+    return 0;
+}
diff --git a/redis-stable/deps/linenoise/linenoise.h b/redis-stable/deps/linenoise/linenoise.h
new file mode 100644
index 00000000..6dfee73b
--- /dev/null
+++ b/redis-stable/deps/linenoise/linenoise.h
@@ -0,0 +1,75 @@
+/* linenoise.h -- VERSION 1.0
+ *
+ * Guerrilla line editing library against the idea that a line editing lib
+ * needs to be 20,000 lines of C code.
+ *
+ * See linenoise.c for more information.
+ *
+ * ------------------------------------------------------------------------
+ *
+ * Copyright (c) 2010-2014, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2010-2013, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ *
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  *  Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *
+ *  *  Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __LINENOISE_H
+#define __LINENOISE_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct linenoiseCompletions {
+  size_t len;
+  char **cvec;
+} linenoiseCompletions;
+
+typedef void(linenoiseCompletionCallback)(const char *, linenoiseCompletions *);
+typedef char*(linenoiseHintsCallback)(const char *, int *color, int *bold);
+typedef void(linenoiseFreeHintsCallback)(void *);
+void linenoiseSetCompletionCallback(linenoiseCompletionCallback *);
+void linenoiseSetHintsCallback(linenoiseHintsCallback *);
+void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *);
+void linenoiseAddCompletion(linenoiseCompletions *, const char *);
+
+char *linenoise(const char *prompt);
+void linenoiseFree(void *ptr);
+int linenoiseHistoryAdd(const char *line);
+int linenoiseHistorySetMaxLen(int len);
+int linenoiseHistorySave(const char *filename);
+int linenoiseHistoryLoad(const char *filename);
+void linenoiseClearScreen(void);
+void linenoiseSetMultiLine(int ml);
+void linenoisePrintKeyCodes(void);
+void linenoiseMaskModeEnable(void);
+void linenoiseMaskModeDisable(void);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* __LINENOISE_H */
diff --git a/redis-stable/deps/lua/COPYRIGHT b/redis-stable/deps/lua/COPYRIGHT
new file mode 100644
index 00000000..a8602680
--- /dev/null
+++ b/redis-stable/deps/lua/COPYRIGHT
@@ -0,0 +1,34 @@
+Lua License
+-----------
+
+Lua is licensed under the terms of the MIT license reproduced below.
+This means that Lua is free software and can be used for both academic
+and commercial purposes at absolutely no cost.
+
+For details and rationale, see http://www.lua.org/license.html .
+
+===============================================================================
+
+Copyright (C) 1994-2012 Lua.org, PUC-Rio.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+===============================================================================
+
+(end of COPYRIGHT)
diff --git a/redis-stable/deps/lua/HISTORY b/redis-stable/deps/lua/HISTORY
new file mode 100644
index 00000000..ce0c95bc
--- /dev/null
+++ b/redis-stable/deps/lua/HISTORY
@@ -0,0 +1,183 @@
+HISTORY for Lua 5.1
+
+* Changes from version 5.0 to 5.1
+  -------------------------------
+  Language:
+  + new module system.
+  + new semantics for control variables of fors.
+  + new semantics for setn/getn.
+  + new syntax/semantics for varargs.
+  + new long strings and comments.
+  + new `mod' operator (`%')
+  + new length operator #t
+  + metatables for all types
+  API:
+  + new functions: lua_createtable, lua_get(set)field, lua_push(to)integer.
+  + user supplies memory allocator (lua_open becomes lua_newstate).
+  + luaopen_* functions must be called through Lua.
+  Implementation:
+  + new configuration scheme via luaconf.h.
+  + incremental garbage collection.
+  + better handling of end-of-line in the lexer.
+  + fully reentrant parser (new Lua function `load')
+  + better support for 64-bit machines.
+  + native loadlib support for Mac OS X.
+  + standard distribution in only one library (lualib.a merged into lua.a)
+
+* Changes from version 4.0 to 5.0
+  -------------------------------
+  Language:
+  + lexical scoping.
+  + Lua coroutines.
+  + standard libraries now packaged in tables.
+  + tags replaced by metatables and tag methods replaced by metamethods,
+    stored in metatables.
+  + proper tail calls.
+  + each function can have its own global table, which can be shared.
+  + new __newindex metamethod, called when we insert a new key into a table.
+  + new block comments: --[[ ... ]].
+  + new generic for.
+  + new weak tables.
+  + new boolean type.
+  + new syntax "local function".
+  + (f()) returns the first value returned by f.
+  + {f()} fills a table with all values returned by f.
+  + \n ignored in [[\n .
+  + fixed and-or priorities.
+  + more general syntax for function definition (e.g. function a.x.y:f()...end).
+  + more general syntax for function calls (e.g. (print or write)(9)).
+  + new functions (time/date, tmpfile, unpack, require, load*, etc.).
+  API:
+  + chunks are loaded by using lua_load; new luaL_loadfile and luaL_loadbuffer.
+  + introduced lightweight userdata, a simple "void*" without a metatable.
+  + new error handling protocol: the core no longer prints error messages;
+    all errors are reported to the caller on the stack.
+  + new lua_atpanic for host cleanup.
+  + new, signal-safe, hook scheme.
+  Implementation:
+  + new license: MIT.
+  + new, faster, register-based virtual machine.
+  + support for external multithreading and coroutines.
+  + new and consistent error message format.
+  + the core no longer needs "stdio.h" for anything (except for a single
+    use of sprintf to convert numbers to strings).
+  + lua.c now runs the environment variable LUA_INIT, if present. It can
+    be "@filename", to run a file, or the chunk itself.
+  + support for user extensions in lua.c.
+    sample implementation given for command line editing.
+  + new dynamic loading library, active by default on several platforms.
+  + safe garbage-collector metamethods.
+  + precompiled bytecodes checked for integrity (secure binary dostring).
+  + strings are fully aligned.
+  + position capture in string.find.
+  + read('*l') can read lines with embedded zeros.
+
+* Changes from version 3.2 to 4.0
+  -------------------------------
+  Language:
+  + new "break" and "for" statements (both numerical and for tables).
+  + uniform treatment of globals: globals are now stored in a Lua table.
+  + improved error messages.
+  + no more '$debug': full speed *and* full debug information.
+  + new read form: read(N) for next N bytes.
+  + general read patterns now deprecated.
+    (still available with -DCOMPAT_READPATTERNS.)
+  + all return values are passed as arguments for the last function
+    (old semantics still available with -DLUA_COMPAT_ARGRET)
+  + garbage collection tag methods for tables now deprecated.
+  + there is now only one tag method for order.
+  API:
+  + New API: fully re-entrant, simpler, and more efficient.
+  + New debug API.
+  Implementation:
+  + faster than ever: cleaner virtual machine and new hashing algorithm.
+  + non-recursive garbage-collector algorithm.
+  + reduced memory usage for programs with many strings.
+  + improved treatment for memory allocation errors.
+  + improved support for 16-bit machines (we hope).
+  + code now compiles unmodified as both ANSI C and C++.
+  + numbers in bases other than 10 are converted using strtoul.
+  + new -f option in Lua to support #! scripts.
+  + luac can now combine text and binaries.
+
+* Changes from version 3.1 to 3.2
+  -------------------------------
+  + redirected all output in Lua's core to _ERRORMESSAGE and _ALERT.
+  + increased limit on the number of constants and globals per function
+    (from 2^16 to 2^24).
+  + debugging info (lua_debug and hooks) moved into lua_state and new API
+    functions provided to get and set this info.
+  + new debug lib gives full debugging access within Lua.
+  + new table functions "foreachi", "sort", "tinsert", "tremove", "getn".
+  + new io functions "flush", "seek".
+
+* Changes from version 3.0 to 3.1
+  -------------------------------
+  + NEW FEATURE: anonymous functions with closures (via "upvalues").
+  + new syntax:
+    - local variables in chunks.
+    - better scope control with DO block END.
+    - constructors can now be also written: { record-part; list-part }.
+    - more general syntax for function calls and lvalues, e.g.:
+      f(x).y=1
+      o:f(x,y):g(z)
+      f"string" is sugar for f("string")
+  + strings may now contain arbitrary binary data (e.g., embedded zeros).
+  + major code re-organization and clean-up; reduced module interdependecies.
+  + no arbitrary limits on the total number of constants and globals.
+  + support for multiple global contexts.
+  + better syntax error messages.
+  + new traversal functions "foreach" and "foreachvar".
+  + the default for numbers is now double.
+    changing it to use floats or longs is easy.
+  + complete debug information stored in pre-compiled chunks.
+  + sample interpreter now prompts user when run interactively, and also
+    handles control-C interruptions gracefully.
+
+* Changes from version 2.5 to 3.0
+  -------------------------------
+  + NEW CONCEPT: "tag methods".
+    Tag methods replace fallbacks as the meta-mechanism for extending the
+    semantics of Lua. Whereas fallbacks had a global nature, tag methods
+    work on objects having the same tag (e.g., groups of tables).
+    Existing code that uses fallbacks should work without change.
+  + new, general syntax for constructors {[exp] = exp, ... }.
+  + support for handling variable number of arguments in functions (varargs).
+  + support for conditional compilation ($if ... $else ... $end).
+  + cleaner semantics in API simplifies host code.
+  + better support for writing libraries (auxlib.h).
+  + better type checking and error messages in the standard library.
+  + luac can now also undump.
+
+* Changes from version 2.4 to 2.5
+  -------------------------------
+  + io and string libraries are now based on pattern matching;
+    the old libraries are still available for compatibility
+  + dofile and dostring can now return values (via return statement)
+  + better support for 16- and 64-bit machines
+  + expanded documentation, with more examples
+
+* Changes from version 2.2 to 2.4
+  -------------------------------
+  + external compiler creates portable binary files that can be loaded faster
+  + interface for debugging and profiling
+  + new "getglobal" fallback
+  + new functions for handling references to Lua objects
+  + new functions in standard lib
+  + only one copy of each string is stored
+  + expanded documentation, with more examples
+
+* Changes from version 2.1 to 2.2
+  -------------------------------
+  + functions now may be declared with any "lvalue" as a name
+  + garbage collection of functions
+  + support for pipes
+
+* Changes from version 1.1 to 2.1
+  -------------------------------
+  + object-oriented support
+  + fallbacks
+  + simplified syntax for tables
+  + many internal improvements
+
+(end of HISTORY)
diff --git a/redis-stable/deps/lua/INSTALL b/redis-stable/deps/lua/INSTALL
new file mode 100644
index 00000000..17eb8aee
--- /dev/null
+++ b/redis-stable/deps/lua/INSTALL
@@ -0,0 +1,99 @@
+INSTALL for Lua 5.1
+
+* Building Lua
+  ------------
+  Lua is built in the src directory, but the build process can be
+  controlled from the top-level Makefile.
+
+  Building Lua on Unix systems should be very easy. First do "make" and
+  see if your platform is listed. If so, just do "make xxx", where xxx
+  is your platform name. The platforms currently supported are:
+    aix ansi bsd freebsd generic linux macosx mingw posix solaris
+
+  If your platform is not listed, try the closest one or posix, generic,
+  ansi, in this order.
+
+  See below for customization instructions and for instructions on how
+  to build with other Windows compilers.
+
+  If you want to check that Lua has been built correctly, do "make test"
+  after building Lua. Also, have a look at the example programs in test.
+
+* Installing Lua
+  --------------
+  Once you have built Lua, you may want to install it in an official
+  place in your system. In this case, do "make install". The official
+  place and the way to install files are defined in Makefile. You must
+  have the right permissions to install files.
+
+  If you want to build and install Lua in one step, do "make xxx install",
+  where xxx is your platform name.
+
+  If you want to install Lua locally, then do "make local". This will
+  create directories bin, include, lib, man, and install Lua there as
+  follows:
+
+    bin:	lua luac
+    include:	lua.h luaconf.h lualib.h lauxlib.h lua.hpp
+    lib:	liblua.a
+    man/man1:	lua.1 luac.1
+
+  These are the only directories you need for development.
+
+  There are man pages for lua and luac, in both nroff and html, and a
+  reference manual in html in doc, some sample code in test, and some
+  useful stuff in etc. You don't need these directories for development.
+
+  If you want to install Lua locally, but in some other directory, do
+  "make install INSTALL_TOP=xxx", where xxx is your chosen directory.
+
+  See below for instructions for Windows and other systems.
+
+* Customization
+  -------------
+  Three things can be customized by editing a file:
+    - Where and how to install Lua -- edit Makefile.
+    - How to build Lua -- edit src/Makefile.
+    - Lua features -- edit src/luaconf.h.
+
+  You don't actually need to edit the Makefiles because you may set the
+  relevant variables when invoking make.
+
+  On the other hand, if you need to select some Lua features, you'll need
+  to edit src/luaconf.h. The edited file will be the one installed, and
+  it will be used by any Lua clients that you build, to ensure consistency.
+
+  We strongly recommend that you enable dynamic loading. This is done
+  automatically for all platforms listed above that have this feature
+  (and also Windows). See src/luaconf.h and also src/Makefile.
+
+* Building Lua on Windows and other systems
+  -----------------------------------------
+  If you're not using the usual Unix tools, then the instructions for
+  building Lua depend on the compiler you use. You'll need to create
+  projects (or whatever your compiler uses) for building the library,
+  the interpreter, and the compiler, as follows:
+
+  library:	lapi.c lcode.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c
+		lmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c
+		ltable.c ltm.c lundump.c lvm.c lzio.c
+		lauxlib.c lbaselib.c ldblib.c liolib.c lmathlib.c loslib.c
+		ltablib.c lstrlib.c loadlib.c linit.c
+
+  interpreter:	library, lua.c
+
+  compiler:	library, luac.c print.c
+
+  If you use Visual Studio .NET, you can use etc/luavs.bat in its
+  "Command Prompt".
+
+  If all you want is to build the Lua interpreter, you may put all .c files
+  in a single project, except for luac.c and print.c. Or just use etc/all.c.
+
+  To use Lua as a library in your own programs, you'll need to know how to
+  create and use libraries with your compiler.
+
+  As mentioned above, you may edit luaconf.h to select some features before
+  building Lua.
+
+(end of INSTALL)
diff --git a/redis-stable/deps/lua/Makefile b/redis-stable/deps/lua/Makefile
new file mode 100644
index 00000000..209a1324
--- /dev/null
+++ b/redis-stable/deps/lua/Makefile
@@ -0,0 +1,128 @@
+# makefile for installing Lua
+# see INSTALL for installation instructions
+# see src/Makefile and src/luaconf.h for further customization
+
+# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
+
+# Your platform. See PLATS for possible values.
+PLAT= none
+
+# Where to install. The installation starts in the src and doc directories,
+# so take care if INSTALL_TOP is not an absolute path.
+INSTALL_TOP= /usr/local
+INSTALL_BIN= $(INSTALL_TOP)/bin
+INSTALL_INC= $(INSTALL_TOP)/include
+INSTALL_LIB= $(INSTALL_TOP)/lib
+INSTALL_MAN= $(INSTALL_TOP)/man/man1
+#
+# You probably want to make INSTALL_LMOD and INSTALL_CMOD consistent with
+# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h (and also with etc/lua.pc).
+INSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V
+INSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V
+
+# How to install. If your install program does not support "-p", then you
+# may have to run ranlib on the installed liblua.a (do "make ranlib").
+INSTALL= install -p
+INSTALL_EXEC= $(INSTALL) -m 0755
+INSTALL_DATA= $(INSTALL) -m 0644
+#
+# If you don't have install you can use cp instead.
+# INSTALL= cp -p
+# INSTALL_EXEC= $(INSTALL)
+# INSTALL_DATA= $(INSTALL)
+
+# Utilities.
+MKDIR= mkdir -p
+RANLIB= ranlib
+
+# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
+
+# Convenience platforms targets.
+PLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris
+
+# What to install.
+TO_BIN= lua luac
+TO_INC= lua.h luaconf.h lualib.h lauxlib.h ../etc/lua.hpp
+TO_LIB= liblua.a
+TO_MAN= lua.1 luac.1
+
+# Lua version and release.
+V= 5.1
+R= 5.1.5
+
+all:	$(PLAT)
+
+$(PLATS) clean:
+	cd src && $(MAKE) $@
+
+test:	dummy
+	src/lua test/hello.lua
+
+install: dummy
+	cd src && $(MKDIR) $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN) $(INSTALL_LMOD) $(INSTALL_CMOD)
+	cd src && $(INSTALL_EXEC) $(TO_BIN) $(INSTALL_BIN)
+	cd src && $(INSTALL_DATA) $(TO_INC) $(INSTALL_INC)
+	cd src && $(INSTALL_DATA) $(TO_LIB) $(INSTALL_LIB)
+	cd doc && $(INSTALL_DATA) $(TO_MAN) $(INSTALL_MAN)
+
+ranlib:
+	cd src && cd $(INSTALL_LIB) && $(RANLIB) $(TO_LIB)
+
+local:
+	$(MAKE) install INSTALL_TOP=..
+
+none:
+	@echo "Please do"
+	@echo "   make PLATFORM"
+	@echo "where PLATFORM is one of these:"
+	@echo "   $(PLATS)"
+	@echo "See INSTALL for complete instructions."
+
+# make may get confused with test/ and INSTALL in a case-insensitive OS
+dummy:
+
+# echo config parameters
+echo:
+	@echo ""
+	@echo "These are the parameters currently set in src/Makefile to build Lua $R:"
+	@echo ""
+	@cd src && $(MAKE) -s echo
+	@echo ""
+	@echo "These are the parameters currently set in Makefile to install Lua $R:"
+	@echo ""
+	@echo "PLAT = $(PLAT)"
+	@echo "INSTALL_TOP = $(INSTALL_TOP)"
+	@echo "INSTALL_BIN = $(INSTALL_BIN)"
+	@echo "INSTALL_INC = $(INSTALL_INC)"
+	@echo "INSTALL_LIB = $(INSTALL_LIB)"
+	@echo "INSTALL_MAN = $(INSTALL_MAN)"
+	@echo "INSTALL_LMOD = $(INSTALL_LMOD)"
+	@echo "INSTALL_CMOD = $(INSTALL_CMOD)"
+	@echo "INSTALL_EXEC = $(INSTALL_EXEC)"
+	@echo "INSTALL_DATA = $(INSTALL_DATA)"
+	@echo ""
+	@echo "See also src/luaconf.h ."
+	@echo ""
+
+# echo private config parameters
+pecho:
+	@echo "V = $(V)"
+	@echo "R = $(R)"
+	@echo "TO_BIN = $(TO_BIN)"
+	@echo "TO_INC = $(TO_INC)"
+	@echo "TO_LIB = $(TO_LIB)"
+	@echo "TO_MAN = $(TO_MAN)"
+
+# echo config parameters as Lua code
+# uncomment the last sed expression if you want nil instead of empty strings
+lecho:
+	@echo "-- installation parameters for Lua $R"
+	@echo "VERSION = '$V'"
+	@echo "RELEASE = '$R'"
+	@$(MAKE) echo | grep = | sed -e 's/= /= "/' -e 's/$$/"/' #-e 's/""/nil/'
+	@echo "-- EOF"
+
+# list targets that do not create files (but not all makes understand .PHONY)
+.PHONY: all $(PLATS) clean test install local none dummy echo pecho lecho
+
+# (end of Makefile)
diff --git a/redis-stable/deps/lua/README b/redis-stable/deps/lua/README
new file mode 100644
index 00000000..11b4dff7
--- /dev/null
+++ b/redis-stable/deps/lua/README
@@ -0,0 +1,37 @@
+README for Lua 5.1
+
+See INSTALL for installation instructions.
+See HISTORY for a summary of changes since the last released version.
+
+* What is Lua?
+  ------------
+  Lua is a powerful, light-weight programming language designed for extending
+  applications. Lua is also frequently used as a general-purpose, stand-alone
+  language. Lua is free software.
+
+  For complete information, visit Lua's web site at http://www.lua.org/ .
+  For an executive summary, see http://www.lua.org/about.html .
+
+  Lua has been used in many different projects around the world.
+  For a short list, see http://www.lua.org/uses.html .
+
+* Availability
+  ------------
+  Lua is freely available for both academic and commercial purposes.
+  See COPYRIGHT and http://www.lua.org/license.html for details.
+  Lua can be downloaded at http://www.lua.org/download.html .
+
+* Installation
+  ------------
+  Lua is implemented in pure ANSI C, and compiles unmodified in all known
+  platforms that have an ANSI C compiler. In most Unix-like platforms, simply
+  do "make" with a suitable target. See INSTALL for detailed instructions.
+
+* Origin
+  ------
+  Lua is developed at Lua.org, a laboratory of the Department of Computer
+  Science of PUC-Rio (the Pontifical Catholic University of Rio de Janeiro
+  in Brazil).
+  For more information about the authors, see http://www.lua.org/authors.html .
+
+(end of README)
diff --git a/redis-stable/deps/lua/doc/contents.html b/redis-stable/deps/lua/doc/contents.html
new file mode 100644
index 00000000..3d83da98
--- /dev/null
+++ b/redis-stable/deps/lua/doc/contents.html
@@ -0,0 +1,497 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<HTML>
+<HEAD>
+<TITLE>Lua 5.1 Reference Manual - contents</TITLE>
+<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
+<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=utf-8">
+<STYLE TYPE="text/css">
+ul {
+	list-style-type: none ;
+}
+</STYLE>
+</HEAD>
+
+<BODY>
+
+<HR>
+<H1>
+<A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="" BORDER=0></A>
+Lua 5.1 Reference Manual
+</H1>
+
+<P>
+The reference manual is the official definition of the Lua language.
+For a complete introduction to Lua programming, see the book
+<A HREF="http://www.lua.org/docs.html#pil">Programming in Lua</A>.
+
+<P>
+This manual is also available as a book:
+<BLOCKQUOTE>
+<A HREF="http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20">
+<IMG SRC="cover.png" ALT="" TITLE="buy from Amazon" BORDER=1 ALIGN="left" HSPACE=12>
+</A>
+<B>Lua 5.1 Reference Manual</B>
+<BR>by R. Ierusalimschy, L. H. de Figueiredo, W. Celes
+<BR>Lua.org, August 2006
+<BR>ISBN 85-903798-3-3
+<BR CLEAR="all">
+</BLOCKQUOTE>
+
+<P>
+<A HREF="http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20">Buy a copy</A>
+of this book and
+<A HREF="http://www.lua.org/donations.html">help to support</A>
+the Lua project.
+
+<P>
+<A HREF="manual.html">start</A>
+&middot;
+<A HREF="#contents">contents</A>
+&middot;
+<A HREF="#index">index</A>
+&middot;
+<A HREF="http://www.lua.org/manual/">other versions</A>
+<HR>
+<SMALL>
+Copyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.
+Freely available under the terms of the
+<A HREF="http://www.lua.org/license.html">Lua license</A>.
+</SMALL>
+
+<H2><A NAME="contents">Contents</A></H2>
+<UL style="padding: 0">
+<LI><A HREF="manual.html">1 &ndash; Introduction</A>
+<P>
+<LI><A HREF="manual.html#2">2 &ndash; The Language</A>
+<UL>
+<LI><A HREF="manual.html#2.1">2.1 &ndash; Lexical Conventions</A>
+<LI><A HREF="manual.html#2.2">2.2 &ndash; Values and Types</A>
+<UL>
+<LI><A HREF="manual.html#2.2.1">2.2.1 &ndash; Coercion</A>
+</UL>
+<LI><A HREF="manual.html#2.3">2.3 &ndash; Variables</A>
+<LI><A HREF="manual.html#2.4">2.4 &ndash; Statements</A>
+<UL>
+<LI><A HREF="manual.html#2.4.1">2.4.1 &ndash; Chunks</A>
+<LI><A HREF="manual.html#2.4.2">2.4.2 &ndash; Blocks</A>
+<LI><A HREF="manual.html#2.4.3">2.4.3 &ndash; Assignment</A>
+<LI><A HREF="manual.html#2.4.4">2.4.4 &ndash; Control Structures</A>
+<LI><A HREF="manual.html#2.4.5">2.4.5 &ndash; For Statement</A>
+<LI><A HREF="manual.html#2.4.6">2.4.6 &ndash; Function Calls as Statements</A>
+<LI><A HREF="manual.html#2.4.7">2.4.7 &ndash; Local Declarations</A>
+</UL>
+<LI><A HREF="manual.html#2.5">2.5 &ndash; Expressions</A>
+<UL>
+<LI><A HREF="manual.html#2.5.1">2.5.1 &ndash; Arithmetic Operators</A>
+<LI><A HREF="manual.html#2.5.2">2.5.2 &ndash; Relational Operators</A>
+<LI><A HREF="manual.html#2.5.3">2.5.3 &ndash; Logical Operators</A>
+<LI><A HREF="manual.html#2.5.4">2.5.4 &ndash; Concatenation</A>
+<LI><A HREF="manual.html#2.5.5">2.5.5 &ndash; The Length Operator</A>
+<LI><A HREF="manual.html#2.5.6">2.5.6 &ndash; Precedence</A>
+<LI><A HREF="manual.html#2.5.7">2.5.7 &ndash; Table Constructors</A>
+<LI><A HREF="manual.html#2.5.8">2.5.8 &ndash; Function Calls</A>
+<LI><A HREF="manual.html#2.5.9">2.5.9 &ndash; Function Definitions</A>
+</UL>
+<LI><A HREF="manual.html#2.6">2.6 &ndash; Visibility Rules</A>
+<LI><A HREF="manual.html#2.7">2.7 &ndash; Error Handling</A>
+<LI><A HREF="manual.html#2.8">2.8 &ndash; Metatables</A>
+<LI><A HREF="manual.html#2.9">2.9 &ndash; Environments</A>
+<LI><A HREF="manual.html#2.10">2.10 &ndash; Garbage Collection</A>
+<UL>
+<LI><A HREF="manual.html#2.10.1">2.10.1 &ndash; Garbage-Collection Metamethods</A>
+<LI><A HREF="manual.html#2.10.2">2.10.2 &ndash; Weak Tables</A>
+</UL>
+<LI><A HREF="manual.html#2.11">2.11 &ndash; Coroutines</A>
+</UL>
+<P>
+<LI><A HREF="manual.html#3">3 &ndash; The Application Program Interface</A>
+<UL>
+<LI><A HREF="manual.html#3.1">3.1 &ndash; The Stack</A>
+<LI><A HREF="manual.html#3.2">3.2 &ndash; Stack Size</A>
+<LI><A HREF="manual.html#3.3">3.3 &ndash; Pseudo-Indices</A>
+<LI><A HREF="manual.html#3.4">3.4 &ndash; C Closures</A>
+<LI><A HREF="manual.html#3.5">3.5 &ndash; Registry</A>
+<LI><A HREF="manual.html#3.6">3.6 &ndash; Error Handling in C</A>
+<LI><A HREF="manual.html#3.7">3.7 &ndash; Functions and Types</A>
+<LI><A HREF="manual.html#3.8">3.8 &ndash; The Debug Interface</A>
+</UL>
+<P>
+<LI><A HREF="manual.html#4">4 &ndash; The Auxiliary Library</A>
+<UL>
+<LI><A HREF="manual.html#4.1">4.1 &ndash; Functions and Types</A>
+</UL>
+<P>
+<LI><A HREF="manual.html#5">5 &ndash; Standard Libraries</A>
+<UL>
+<LI><A HREF="manual.html#5.1">5.1 &ndash; Basic Functions</A>
+<LI><A HREF="manual.html#5.2">5.2 &ndash; Coroutine Manipulation</A>
+<LI><A HREF="manual.html#5.3">5.3 &ndash; Modules</A>
+<LI><A HREF="manual.html#5.4">5.4 &ndash; String Manipulation</A>
+<UL>
+<LI><A HREF="manual.html#5.4.1">5.4.1 &ndash; Patterns</A>
+</UL>
+<LI><A HREF="manual.html#5.5">5.5 &ndash; Table Manipulation</A>
+<LI><A HREF="manual.html#5.6">5.6 &ndash; Mathematical Functions</A>
+<LI><A HREF="manual.html#5.7">5.7 &ndash; Input and Output Facilities</A>
+<LI><A HREF="manual.html#5.8">5.8 &ndash; Operating System Facilities</A>
+<LI><A HREF="manual.html#5.9">5.9 &ndash; The Debug Library</A>
+</UL>
+<P>
+<LI><A HREF="manual.html#6">6 &ndash; Lua Stand-alone</A>
+<P>
+<LI><A HREF="manual.html#7">7 &ndash; Incompatibilities with the Previous Version</A>
+<UL>
+<LI><A HREF="manual.html#7.1">7.1 &ndash; Changes in the Language</A>
+<LI><A HREF="manual.html#7.2">7.2 &ndash; Changes in the Libraries</A>
+<LI><A HREF="manual.html#7.3">7.3 &ndash; Changes in the API</A>
+</UL>
+<P>
+<LI><A HREF="manual.html#8">8 &ndash; The Complete Syntax of Lua</A>
+</UL>
+
+<H2><A NAME="index">Index</A></H2>
+<TABLE WIDTH="100%">
+<TR VALIGN="top">
+<TD>
+<H3><A NAME="functions">Lua functions</A></H3>
+<A HREF="manual.html#pdf-_G">_G</A><BR>
+<A HREF="manual.html#pdf-_VERSION">_VERSION</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-assert">assert</A><BR>
+<A HREF="manual.html#pdf-collectgarbage">collectgarbage</A><BR>
+<A HREF="manual.html#pdf-dofile">dofile</A><BR>
+<A HREF="manual.html#pdf-error">error</A><BR>
+<A HREF="manual.html#pdf-getfenv">getfenv</A><BR>
+<A HREF="manual.html#pdf-getmetatable">getmetatable</A><BR>
+<A HREF="manual.html#pdf-ipairs">ipairs</A><BR>
+<A HREF="manual.html#pdf-load">load</A><BR>
+<A HREF="manual.html#pdf-loadfile">loadfile</A><BR>
+<A HREF="manual.html#pdf-loadstring">loadstring</A><BR>
+<A HREF="manual.html#pdf-module">module</A><BR>
+<A HREF="manual.html#pdf-next">next</A><BR>
+<A HREF="manual.html#pdf-pairs">pairs</A><BR>
+<A HREF="manual.html#pdf-pcall">pcall</A><BR>
+<A HREF="manual.html#pdf-print">print</A><BR>
+<A HREF="manual.html#pdf-rawequal">rawequal</A><BR>
+<A HREF="manual.html#pdf-rawget">rawget</A><BR>
+<A HREF="manual.html#pdf-rawset">rawset</A><BR>
+<A HREF="manual.html#pdf-require">require</A><BR>
+<A HREF="manual.html#pdf-select">select</A><BR>
+<A HREF="manual.html#pdf-setfenv">setfenv</A><BR>
+<A HREF="manual.html#pdf-setmetatable">setmetatable</A><BR>
+<A HREF="manual.html#pdf-tonumber">tonumber</A><BR>
+<A HREF="manual.html#pdf-tostring">tostring</A><BR>
+<A HREF="manual.html#pdf-type">type</A><BR>
+<A HREF="manual.html#pdf-unpack">unpack</A><BR>
+<A HREF="manual.html#pdf-xpcall">xpcall</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-coroutine.create">coroutine.create</A><BR>
+<A HREF="manual.html#pdf-coroutine.resume">coroutine.resume</A><BR>
+<A HREF="manual.html#pdf-coroutine.running">coroutine.running</A><BR>
+<A HREF="manual.html#pdf-coroutine.status">coroutine.status</A><BR>
+<A HREF="manual.html#pdf-coroutine.wrap">coroutine.wrap</A><BR>
+<A HREF="manual.html#pdf-coroutine.yield">coroutine.yield</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-debug.debug">debug.debug</A><BR>
+<A HREF="manual.html#pdf-debug.getfenv">debug.getfenv</A><BR>
+<A HREF="manual.html#pdf-debug.gethook">debug.gethook</A><BR>
+<A HREF="manual.html#pdf-debug.getinfo">debug.getinfo</A><BR>
+<A HREF="manual.html#pdf-debug.getlocal">debug.getlocal</A><BR>
+<A HREF="manual.html#pdf-debug.getmetatable">debug.getmetatable</A><BR>
+<A HREF="manual.html#pdf-debug.getregistry">debug.getregistry</A><BR>
+<A HREF="manual.html#pdf-debug.getupvalue">debug.getupvalue</A><BR>
+<A HREF="manual.html#pdf-debug.setfenv">debug.setfenv</A><BR>
+<A HREF="manual.html#pdf-debug.sethook">debug.sethook</A><BR>
+<A HREF="manual.html#pdf-debug.setlocal">debug.setlocal</A><BR>
+<A HREF="manual.html#pdf-debug.setmetatable">debug.setmetatable</A><BR>
+<A HREF="manual.html#pdf-debug.setupvalue">debug.setupvalue</A><BR>
+<A HREF="manual.html#pdf-debug.traceback">debug.traceback</A><BR>
+
+</TD>
+<TD>
+<H3>&nbsp;</H3>
+<A HREF="manual.html#pdf-file:close">file:close</A><BR>
+<A HREF="manual.html#pdf-file:flush">file:flush</A><BR>
+<A HREF="manual.html#pdf-file:lines">file:lines</A><BR>
+<A HREF="manual.html#pdf-file:read">file:read</A><BR>
+<A HREF="manual.html#pdf-file:seek">file:seek</A><BR>
+<A HREF="manual.html#pdf-file:setvbuf">file:setvbuf</A><BR>
+<A HREF="manual.html#pdf-file:write">file:write</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-io.close">io.close</A><BR>
+<A HREF="manual.html#pdf-io.flush">io.flush</A><BR>
+<A HREF="manual.html#pdf-io.input">io.input</A><BR>
+<A HREF="manual.html#pdf-io.lines">io.lines</A><BR>
+<A HREF="manual.html#pdf-io.open">io.open</A><BR>
+<A HREF="manual.html#pdf-io.output">io.output</A><BR>
+<A HREF="manual.html#pdf-io.popen">io.popen</A><BR>
+<A HREF="manual.html#pdf-io.read">io.read</A><BR>
+<A HREF="manual.html#pdf-io.stderr">io.stderr</A><BR>
+<A HREF="manual.html#pdf-io.stdin">io.stdin</A><BR>
+<A HREF="manual.html#pdf-io.stdout">io.stdout</A><BR>
+<A HREF="manual.html#pdf-io.tmpfile">io.tmpfile</A><BR>
+<A HREF="manual.html#pdf-io.type">io.type</A><BR>
+<A HREF="manual.html#pdf-io.write">io.write</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-math.abs">math.abs</A><BR>
+<A HREF="manual.html#pdf-math.acos">math.acos</A><BR>
+<A HREF="manual.html#pdf-math.asin">math.asin</A><BR>
+<A HREF="manual.html#pdf-math.atan">math.atan</A><BR>
+<A HREF="manual.html#pdf-math.atan2">math.atan2</A><BR>
+<A HREF="manual.html#pdf-math.ceil">math.ceil</A><BR>
+<A HREF="manual.html#pdf-math.cos">math.cos</A><BR>
+<A HREF="manual.html#pdf-math.cosh">math.cosh</A><BR>
+<A HREF="manual.html#pdf-math.deg">math.deg</A><BR>
+<A HREF="manual.html#pdf-math.exp">math.exp</A><BR>
+<A HREF="manual.html#pdf-math.floor">math.floor</A><BR>
+<A HREF="manual.html#pdf-math.fmod">math.fmod</A><BR>
+<A HREF="manual.html#pdf-math.frexp">math.frexp</A><BR>
+<A HREF="manual.html#pdf-math.huge">math.huge</A><BR>
+<A HREF="manual.html#pdf-math.ldexp">math.ldexp</A><BR>
+<A HREF="manual.html#pdf-math.log">math.log</A><BR>
+<A HREF="manual.html#pdf-math.log10">math.log10</A><BR>
+<A HREF="manual.html#pdf-math.max">math.max</A><BR>
+<A HREF="manual.html#pdf-math.min">math.min</A><BR>
+<A HREF="manual.html#pdf-math.modf">math.modf</A><BR>
+<A HREF="manual.html#pdf-math.pi">math.pi</A><BR>
+<A HREF="manual.html#pdf-math.pow">math.pow</A><BR>
+<A HREF="manual.html#pdf-math.rad">math.rad</A><BR>
+<A HREF="manual.html#pdf-math.random">math.random</A><BR>
+<A HREF="manual.html#pdf-math.randomseed">math.randomseed</A><BR>
+<A HREF="manual.html#pdf-math.sin">math.sin</A><BR>
+<A HREF="manual.html#pdf-math.sinh">math.sinh</A><BR>
+<A HREF="manual.html#pdf-math.sqrt">math.sqrt</A><BR>
+<A HREF="manual.html#pdf-math.tan">math.tan</A><BR>
+<A HREF="manual.html#pdf-math.tanh">math.tanh</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-os.clock">os.clock</A><BR>
+<A HREF="manual.html#pdf-os.date">os.date</A><BR>
+<A HREF="manual.html#pdf-os.difftime">os.difftime</A><BR>
+<A HREF="manual.html#pdf-os.execute">os.execute</A><BR>
+<A HREF="manual.html#pdf-os.exit">os.exit</A><BR>
+<A HREF="manual.html#pdf-os.getenv">os.getenv</A><BR>
+<A HREF="manual.html#pdf-os.remove">os.remove</A><BR>
+<A HREF="manual.html#pdf-os.rename">os.rename</A><BR>
+<A HREF="manual.html#pdf-os.setlocale">os.setlocale</A><BR>
+<A HREF="manual.html#pdf-os.time">os.time</A><BR>
+<A HREF="manual.html#pdf-os.tmpname">os.tmpname</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-package.cpath">package.cpath</A><BR>
+<A HREF="manual.html#pdf-package.loaded">package.loaded</A><BR>
+<A HREF="manual.html#pdf-package.loaders">package.loaders</A><BR>
+<A HREF="manual.html#pdf-package.loadlib">package.loadlib</A><BR>
+<A HREF="manual.html#pdf-package.path">package.path</A><BR>
+<A HREF="manual.html#pdf-package.preload">package.preload</A><BR>
+<A HREF="manual.html#pdf-package.seeall">package.seeall</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-string.byte">string.byte</A><BR>
+<A HREF="manual.html#pdf-string.char">string.char</A><BR>
+<A HREF="manual.html#pdf-string.dump">string.dump</A><BR>
+<A HREF="manual.html#pdf-string.find">string.find</A><BR>
+<A HREF="manual.html#pdf-string.format">string.format</A><BR>
+<A HREF="manual.html#pdf-string.gmatch">string.gmatch</A><BR>
+<A HREF="manual.html#pdf-string.gsub">string.gsub</A><BR>
+<A HREF="manual.html#pdf-string.len">string.len</A><BR>
+<A HREF="manual.html#pdf-string.lower">string.lower</A><BR>
+<A HREF="manual.html#pdf-string.match">string.match</A><BR>
+<A HREF="manual.html#pdf-string.rep">string.rep</A><BR>
+<A HREF="manual.html#pdf-string.reverse">string.reverse</A><BR>
+<A HREF="manual.html#pdf-string.sub">string.sub</A><BR>
+<A HREF="manual.html#pdf-string.upper">string.upper</A><BR>
+<P>
+
+<A HREF="manual.html#pdf-table.concat">table.concat</A><BR>
+<A HREF="manual.html#pdf-table.insert">table.insert</A><BR>
+<A HREF="manual.html#pdf-table.maxn">table.maxn</A><BR>
+<A HREF="manual.html#pdf-table.remove">table.remove</A><BR>
+<A HREF="manual.html#pdf-table.sort">table.sort</A><BR>
+
+</TD>
+<TD>
+<H3>C API</H3>
+<A HREF="manual.html#lua_Alloc">lua_Alloc</A><BR>
+<A HREF="manual.html#lua_CFunction">lua_CFunction</A><BR>
+<A HREF="manual.html#lua_Debug">lua_Debug</A><BR>
+<A HREF="manual.html#lua_Hook">lua_Hook</A><BR>
+<A HREF="manual.html#lua_Integer">lua_Integer</A><BR>
+<A HREF="manual.html#lua_Number">lua_Number</A><BR>
+<A HREF="manual.html#lua_Reader">lua_Reader</A><BR>
+<A HREF="manual.html#lua_State">lua_State</A><BR>
+<A HREF="manual.html#lua_Writer">lua_Writer</A><BR>
+<P>
+
+<A HREF="manual.html#lua_atpanic">lua_atpanic</A><BR>
+<A HREF="manual.html#lua_call">lua_call</A><BR>
+<A HREF="manual.html#lua_checkstack">lua_checkstack</A><BR>
+<A HREF="manual.html#lua_close">lua_close</A><BR>
+<A HREF="manual.html#lua_concat">lua_concat</A><BR>
+<A HREF="manual.html#lua_cpcall">lua_cpcall</A><BR>
+<A HREF="manual.html#lua_createtable">lua_createtable</A><BR>
+<A HREF="manual.html#lua_dump">lua_dump</A><BR>
+<A HREF="manual.html#lua_equal">lua_equal</A><BR>
+<A HREF="manual.html#lua_error">lua_error</A><BR>
+<A HREF="manual.html#lua_gc">lua_gc</A><BR>
+<A HREF="manual.html#lua_getallocf">lua_getallocf</A><BR>
+<A HREF="manual.html#lua_getfenv">lua_getfenv</A><BR>
+<A HREF="manual.html#lua_getfield">lua_getfield</A><BR>
+<A HREF="manual.html#lua_getglobal">lua_getglobal</A><BR>
+<A HREF="manual.html#lua_gethook">lua_gethook</A><BR>
+<A HREF="manual.html#lua_gethookcount">lua_gethookcount</A><BR>
+<A HREF="manual.html#lua_gethookmask">lua_gethookmask</A><BR>
+<A HREF="manual.html#lua_getinfo">lua_getinfo</A><BR>
+<A HREF="manual.html#lua_getlocal">lua_getlocal</A><BR>
+<A HREF="manual.html#lua_getmetatable">lua_getmetatable</A><BR>
+<A HREF="manual.html#lua_getstack">lua_getstack</A><BR>
+<A HREF="manual.html#lua_gettable">lua_gettable</A><BR>
+<A HREF="manual.html#lua_gettop">lua_gettop</A><BR>
+<A HREF="manual.html#lua_getupvalue">lua_getupvalue</A><BR>
+<A HREF="manual.html#lua_insert">lua_insert</A><BR>
+<A HREF="manual.html#lua_isboolean">lua_isboolean</A><BR>
+<A HREF="manual.html#lua_iscfunction">lua_iscfunction</A><BR>
+<A HREF="manual.html#lua_isfunction">lua_isfunction</A><BR>
+<A HREF="manual.html#lua_islightuserdata">lua_islightuserdata</A><BR>
+<A HREF="manual.html#lua_isnil">lua_isnil</A><BR>
+<A HREF="manual.html#lua_isnone">lua_isnone</A><BR>
+<A HREF="manual.html#lua_isnoneornil">lua_isnoneornil</A><BR>
+<A HREF="manual.html#lua_isnumber">lua_isnumber</A><BR>
+<A HREF="manual.html#lua_isstring">lua_isstring</A><BR>
+<A HREF="manual.html#lua_istable">lua_istable</A><BR>
+<A HREF="manual.html#lua_isthread">lua_isthread</A><BR>
+<A HREF="manual.html#lua_isuserdata">lua_isuserdata</A><BR>
+<A HREF="manual.html#lua_lessthan">lua_lessthan</A><BR>
+<A HREF="manual.html#lua_load">lua_load</A><BR>
+<A HREF="manual.html#lua_newstate">lua_newstate</A><BR>
+<A HREF="manual.html#lua_newtable">lua_newtable</A><BR>
+<A HREF="manual.html#lua_newthread">lua_newthread</A><BR>
+<A HREF="manual.html#lua_newuserdata">lua_newuserdata</A><BR>
+<A HREF="manual.html#lua_next">lua_next</A><BR>
+<A HREF="manual.html#lua_objlen">lua_objlen</A><BR>
+<A HREF="manual.html#lua_pcall">lua_pcall</A><BR>
+<A HREF="manual.html#lua_pop">lua_pop</A><BR>
+<A HREF="manual.html#lua_pushboolean">lua_pushboolean</A><BR>
+<A HREF="manual.html#lua_pushcclosure">lua_pushcclosure</A><BR>
+<A HREF="manual.html#lua_pushcfunction">lua_pushcfunction</A><BR>
+<A HREF="manual.html#lua_pushfstring">lua_pushfstring</A><BR>
+<A HREF="manual.html#lua_pushinteger">lua_pushinteger</A><BR>
+<A HREF="manual.html#lua_pushlightuserdata">lua_pushlightuserdata</A><BR>
+<A HREF="manual.html#lua_pushliteral">lua_pushliteral</A><BR>
+<A HREF="manual.html#lua_pushlstring">lua_pushlstring</A><BR>
+<A HREF="manual.html#lua_pushnil">lua_pushnil</A><BR>
+<A HREF="manual.html#lua_pushnumber">lua_pushnumber</A><BR>
+<A HREF="manual.html#lua_pushstring">lua_pushstring</A><BR>
+<A HREF="manual.html#lua_pushthread">lua_pushthread</A><BR>
+<A HREF="manual.html#lua_pushvalue">lua_pushvalue</A><BR>
+<A HREF="manual.html#lua_pushvfstring">lua_pushvfstring</A><BR>
+<A HREF="manual.html#lua_rawequal">lua_rawequal</A><BR>
+<A HREF="manual.html#lua_rawget">lua_rawget</A><BR>
+<A HREF="manual.html#lua_rawgeti">lua_rawgeti</A><BR>
+<A HREF="manual.html#lua_rawset">lua_rawset</A><BR>
+<A HREF="manual.html#lua_rawseti">lua_rawseti</A><BR>
+<A HREF="manual.html#lua_register">lua_register</A><BR>
+<A HREF="manual.html#lua_remove">lua_remove</A><BR>
+<A HREF="manual.html#lua_replace">lua_replace</A><BR>
+<A HREF="manual.html#lua_resume">lua_resume</A><BR>
+<A HREF="manual.html#lua_setallocf">lua_setallocf</A><BR>
+<A HREF="manual.html#lua_setfenv">lua_setfenv</A><BR>
+<A HREF="manual.html#lua_setfield">lua_setfield</A><BR>
+<A HREF="manual.html#lua_setglobal">lua_setglobal</A><BR>
+<A HREF="manual.html#lua_sethook">lua_sethook</A><BR>
+<A HREF="manual.html#lua_setlocal">lua_setlocal</A><BR>
+<A HREF="manual.html#lua_setmetatable">lua_setmetatable</A><BR>
+<A HREF="manual.html#lua_settable">lua_settable</A><BR>
+<A HREF="manual.html#lua_settop">lua_settop</A><BR>
+<A HREF="manual.html#lua_setupvalue">lua_setupvalue</A><BR>
+<A HREF="manual.html#lua_status">lua_status</A><BR>
+<A HREF="manual.html#lua_toboolean">lua_toboolean</A><BR>
+<A HREF="manual.html#lua_tocfunction">lua_tocfunction</A><BR>
+<A HREF="manual.html#lua_tointeger">lua_tointeger</A><BR>
+<A HREF="manual.html#lua_tolstring">lua_tolstring</A><BR>
+<A HREF="manual.html#lua_tonumber">lua_tonumber</A><BR>
+<A HREF="manual.html#lua_topointer">lua_topointer</A><BR>
+<A HREF="manual.html#lua_tostring">lua_tostring</A><BR>
+<A HREF="manual.html#lua_tothread">lua_tothread</A><BR>
+<A HREF="manual.html#lua_touserdata">lua_touserdata</A><BR>
+<A HREF="manual.html#lua_type">lua_type</A><BR>
+<A HREF="manual.html#lua_typename">lua_typename</A><BR>
+<A HREF="manual.html#lua_upvalueindex">lua_upvalueindex</A><BR>
+<A HREF="manual.html#lua_xmove">lua_xmove</A><BR>
+<A HREF="manual.html#lua_yield">lua_yield</A><BR>
+
+</TD>
+<TD>
+<H3>auxiliary library</H3>
+<A HREF="manual.html#luaL_Buffer">luaL_Buffer</A><BR>
+<A HREF="manual.html#luaL_Reg">luaL_Reg</A><BR>
+<P>
+
+<A HREF="manual.html#luaL_addchar">luaL_addchar</A><BR>
+<A HREF="manual.html#luaL_addlstring">luaL_addlstring</A><BR>
+<A HREF="manual.html#luaL_addsize">luaL_addsize</A><BR>
+<A HREF="manual.html#luaL_addstring">luaL_addstring</A><BR>
+<A HREF="manual.html#luaL_addvalue">luaL_addvalue</A><BR>
+<A HREF="manual.html#luaL_argcheck">luaL_argcheck</A><BR>
+<A HREF="manual.html#luaL_argerror">luaL_argerror</A><BR>
+<A HREF="manual.html#luaL_buffinit">luaL_buffinit</A><BR>
+<A HREF="manual.html#luaL_callmeta">luaL_callmeta</A><BR>
+<A HREF="manual.html#luaL_checkany">luaL_checkany</A><BR>
+<A HREF="manual.html#luaL_checkint">luaL_checkint</A><BR>
+<A HREF="manual.html#luaL_checkinteger">luaL_checkinteger</A><BR>
+<A HREF="manual.html#luaL_checklong">luaL_checklong</A><BR>
+<A HREF="manual.html#luaL_checklstring">luaL_checklstring</A><BR>
+<A HREF="manual.html#luaL_checknumber">luaL_checknumber</A><BR>
+<A HREF="manual.html#luaL_checkoption">luaL_checkoption</A><BR>
+<A HREF="manual.html#luaL_checkstack">luaL_checkstack</A><BR>
+<A HREF="manual.html#luaL_checkstring">luaL_checkstring</A><BR>
+<A HREF="manual.html#luaL_checktype">luaL_checktype</A><BR>
+<A HREF="manual.html#luaL_checkudata">luaL_checkudata</A><BR>
+<A HREF="manual.html#luaL_dofile">luaL_dofile</A><BR>
+<A HREF="manual.html#luaL_dostring">luaL_dostring</A><BR>
+<A HREF="manual.html#luaL_error">luaL_error</A><BR>
+<A HREF="manual.html#luaL_getmetafield">luaL_getmetafield</A><BR>
+<A HREF="manual.html#luaL_getmetatable">luaL_getmetatable</A><BR>
+<A HREF="manual.html#luaL_gsub">luaL_gsub</A><BR>
+<A HREF="manual.html#luaL_loadbuffer">luaL_loadbuffer</A><BR>
+<A HREF="manual.html#luaL_loadfile">luaL_loadfile</A><BR>
+<A HREF="manual.html#luaL_loadstring">luaL_loadstring</A><BR>
+<A HREF="manual.html#luaL_newmetatable">luaL_newmetatable</A><BR>
+<A HREF="manual.html#luaL_newstate">luaL_newstate</A><BR>
+<A HREF="manual.html#luaL_openlibs">luaL_openlibs</A><BR>
+<A HREF="manual.html#luaL_optint">luaL_optint</A><BR>
+<A HREF="manual.html#luaL_optinteger">luaL_optinteger</A><BR>
+<A HREF="manual.html#luaL_optlong">luaL_optlong</A><BR>
+<A HREF="manual.html#luaL_optlstring">luaL_optlstring</A><BR>
+<A HREF="manual.html#luaL_optnumber">luaL_optnumber</A><BR>
+<A HREF="manual.html#luaL_optstring">luaL_optstring</A><BR>
+<A HREF="manual.html#luaL_prepbuffer">luaL_prepbuffer</A><BR>
+<A HREF="manual.html#luaL_pushresult">luaL_pushresult</A><BR>
+<A HREF="manual.html#luaL_ref">luaL_ref</A><BR>
+<A HREF="manual.html#luaL_register">luaL_register</A><BR>
+<A HREF="manual.html#luaL_typename">luaL_typename</A><BR>
+<A HREF="manual.html#luaL_typerror">luaL_typerror</A><BR>
+<A HREF="manual.html#luaL_unref">luaL_unref</A><BR>
+<A HREF="manual.html#luaL_where">luaL_where</A><BR>
+
+</TD>
+</TR>
+</TABLE>
+<P>
+
+<HR>
+<SMALL CLASS="footer">
+Last update:
+Mon Feb 13 18:53:32 BRST 2012
+</SMALL>
+<!--
+Last change: revised for Lua 5.1.5
+-->
+
+</BODY>
+</HTML>
diff --git a/redis-stable/deps/lua/doc/cover.png b/redis-stable/deps/lua/doc/cover.png
new file mode 100644
index 0000000000000000000000000000000000000000..2dbb198123f03a7250bfa57c8253739962d69afb
GIT binary patch
literal 3305
zcmV<F3>Nc=P)<h;3K|Lk000e1NJLTq002b*003SH0ssI2`u<KP00004XF*Lt006O%
z3;baP0000ubVXQnQ*UN;cVTj609aNaR%LQ?X>V>IGcGYOVIUw<Wp+9sF)}YQIWIXh
zASh5yM<8%vbYo~BF)lJG-4!lL000b0Nkl<Zc%1E<OK=>=dB=a<GqbY~EU<WE0T3iW
zkQ7N#FUk@13Zse?l^+#3sdB87%Lm8hsvLaKP1e;%Uv%*$FZqzTRH;-V$Ek88#foT}
zDvK0J@c~jK0TLttf&drT#lB~z+Xw7o7Qh171s5Ws!oP69&h&JD|M~js{=Toj5&YvR
zzCw@>TYv^*htKxL4xjCf9X{I|EBQ!hu?+M>5oT>TE}0ye97P9R7S8qXycMFZ<kJ!`
zez3o*J7gZ~Y<fA~{QcpM4%_@vL|zwDvn*uE7jfLum2{2^*O^bRXt+{V0e#`Xvt7~W
zyP_=tqdR1cBy+PfE)Nk}vyi2w37{o{5CBrJJB|RctnErZ$)fvD7w;6|R=SWWx?w4=
zWs5+y8K`kR42i3-j8ey<bO+@jWohgOgwnVk(J-#Z*c8M42thcAQog#@;^Sot7tUX&
zP^7b!OdhRhjvxfChiTw?1Oq6I<I>&6rBQl2xq6d5z1RT?1tMWggH(oGfxZ3MRwMW*
zhWcm<0o+gGDNJLnwySJIYqTbnA(cT&JjHAh%b?&;aM%-PVunbF`4oU{acLCOU~~ed
z=<Vdr43<eIhwCxa*8nn$B2CV)CyuL1i@{uq*5;~<)+#=Bfc*pPj+0Ciwn31~(-I|_
z#<pk*5sRWVZBaT~X>Xys9YZpo#<qw>i8bMPc#43D)u4sMGKqI^_da6LW&~0K*cO4+
z_P<uVpqI5O{S>RNFEtj+pK65RYy#Eh+iK_)|A>ml%LRW(G?uWEPuP@)V__g<O07{^
zryS2wy3ICIju()ksC3ftI&Cu`WzO?FP0mv{777nT_$pY*$C9!)90*9!YMb{9Zld6J
z7*ay3ZN|YAXvll2-L?u!rHWob>B&q{E^1Drx0`;n)|1&{JZ#-e7eMcd1S~0(ChdB8
zS0!Ap-8R#X^0X5R7@pQ0wmH~jKhYj`l%C2tznfmz5?4vXD&s9-{r%L{8o|B1n{hn>
zX-7F)1C|g{Fjw^QO3xSEM8WF{nF8))ijLB@AziK0j<-dAU&NHQAw-4j8oelO%2Dg_
z37hiyuBd>qbbcrr0xb~*rLW9q2cyBcq8kgCW9j_Jd}=!9R2g|I=9{KHXtr2}hFHKH
zPZ!2Bg|$47mFu;Duqg$YQfQ4vD~-}9t!+atHYg~SbM=?ElxgB&vnLeLny@Jo1@}ra
zw-%pO_5&GLRc)GAp8w;^w0pr+)}6{$xN2*=h1(z&s0B5@zOQ<G`u`m}e6}}s_-t?N
z@Y&wj;j_K5!>2Cj<++EgPm6D*KdLp^Jc$%i(A&wq1mn{*M;Pu$%2I-|s;8_q`68Jd
zLJ$dITeas|8_h>+9GB??ksz(jj7@SsNq-j_f;Mf@l8W*L-v0vui)W9N64OhM7aV?n
zo{!IxNC9-U@zPPgc8EYtsn)ggZ<}BOc#01{#gH6*gjm!cMXYM<xFpjwg$Y=EF;2Xl
zmL`fWzx*FgoI`njM$a_(i(`EIIOfK0-{7?$G=Pljas4(*(G+GN&Tv1WAVQS?R<#!b
z!yp{OG(nSG;P)4ZMY(#5|NK9cs)%?5N^$EhL;ZBNZaDE8G2fKp<ar#IUEK(=ItRNl
zw^|`8fRGIDVs{*+c=vrgZ&mmvC^~#{k%NO6Tgpf4l371}kdR$UD_7q26!{|QEZIEy
z0s)I~kftypd)Z<j1Oba&f&0ldW6_y8l)~6xL4E)}T61%f(Meu9N+h)GmQo~ATpZ=X
zbta}+$l<yujR4am93<Y(p&=d{rn?QJOiTz&qaqi+Lee!B!-nxm=lJX@FMn;>FiJ5!
z$8SI7^a#mxl?1n2Bwr+v<kA?wKFQ%BUU`PWIEF#MWN$y?cdHF1*gvqLa@gd0u(*_2
zCd2)NLnS_oOYKKz_{FceJW9UE>eIkV`2fdd@*by0Naq>o!4A;Y!nrTV7gj#l-OAs*
zvT_zQj8D<w!VS9Hu}q&#GR?pIhW9@qn_rj75|)msT}CIkafiV^`a0?9;Kl^md^yQ0
zh<EV4Z!*xcHS<kt&RoGXkrk&Vb1DAeJw|Q<wJ?!V?%v(~)KhySk>KsyvuDrVn7=m8
z&;O0T{VN_DroW5Nu5jxvQZU%ZlLv@3)#xH@icfQd{R930nH<0P?=qQ<5s3ufc;l~s
z^rLTdbhJn*9LK$Q@z$Gf{__VPoYQ~*AN<{S=xOJbXHXg;Sjdpd5Nq1FU!ZP(bkV*K
z5BX<_uE(!VaN&B59T<lE$xmK?>#f)0@ixmc3_}Kkful!<-+AYa=bk&r<P87%8*&AN
zz>r9RA^GG2#cH|o2Jo3*;M^C0Z#I`l`S@(jj<Y^|c;JUW{JOc^a}h%H^t8V9*6X%y
zae0)F&Y;RU=SYZs1Eg~`4p0vtt+_l#B<Nqs75LQ&3dP#{c<H6bT3ee|+kz0{=+S-g
zcpFOd!5_Fcw{(NY_tDl|WB+yPCl)Q8Fauh1@dh_1>q^e|^t7&J*rAXei$y>%zrcxe
zzKVokW{ylvDyoN%5F8rxOC(&6ljrfOA4aT&iHZA4RiB-iOg@n)*W;YNOgdZoU&C~Q
zYvZ-d>YDjzn4Be*DQQDPBE@KZ$^kz7@cjMzsnv(*TI*A%M(*BC03b*t8J+ZR_jR(6
zttGy#T|b&jH^^6<W8a)2TdSFtA+BD%^Y+{C6$-^lN?PmNw`YF((_a>g<wG7%arG9e
zd~O<R=Gc*12B>-e(O?=xBjqSdb8D)Kd$tjjQa}6Izo*l=AOHBZzP@%TWj<d#efrv)
zZ@zQ-^z~)Ejo-!dkY<UJ=V5GI;8Zgo0WUs*Q7#11nwhzEA6T=ae7^Yh+wZ;m?uo;P
z2O^Q+#6)6bWIU6}FMl<H`2`%$-{?+$zC7lwj(YUtxXbutH(f&^v}S5*ZfYvAbft=(
z^F>?-Z2yYmt`$ryp=SGWT>kg8zlLgEEs(4iVm;4Q>56I~!I5E_!W;Hjvwox?Uqoq)
z@&EyI&Dg6UFbzN8)tb&2Y&=@c`Y|NW9`Pe8A!)AFN8A)Nk)Urp8ZM1e+_>zsW<F99
z@9>uw3Gwz#h*<|ZTYWyBV&rD^+OOrPXFnaE_T4H3gMI7NJvIPCeSU~lbZRURtjFJ3
zOtR_n9@p1NEV@-WX*<9pdwg@TE&lANPj7A1!>6YW%k<@shB-1^pOm#iGtfhChrf42
zsVsLR)XYafILOn7Dzbrs7oH##T<@vPK}ueH!cSN`F26lfqvKnrf9<;5xmTWYf?eG_
zeX!9}PBYlclLvflOw3@&T9Q?4=KSZAi+(6#NWSqr9j%R{qzT%*cARj9+M7Z={YZ`Z
zkUIHTCXWs=UG`IipsSVd{5f`@zJAseNAl`14({<oM$e-oR{LI8Cm$g=u$#f&QrY?9
zm8TBymw#GL)jj}(;Q7aS^_cG^7K(iE>FT2Xbx{9&lM)RVZ}_{lVes;w@a^N+fz49V
zNXZM2^W9f`Rcp=JFX(8gt1f+0`B4G4?=d#PKzC_k7?Qz0y4x6=B$uz#sndjmeCtJC
zJ5DgL%uYf!d*Z&jYQX0B2)f!R6lrVmT}CPC?c~T_GI?g_YxBM}hQWc|eD9k)^C*Fe
z?D1?8AQoMD2D71Pn?G+{G@(R_)@FY(T|5yQo#5loxID%}wj5$qei{Hm5DK!lj~Ach
z@X#`~XwB_uPF>*Z&(R#ISEvU#FA)Nz`TQED$+JgFvs?%)ll=n>_cNbnY=Y|(+?{11
zL&3o^iG=8GW2ldzK00F6PjxbRUOh&1<7lUfP!D<@?6{2FWT>x{XIvqi2CY#FPoWf2
zVo0P!tZu2v=D9u1zJZdTwyAHS9=M*uGC8uBNRUK|GgrvwmU;C8q`)+=EkZW7g=ru~
z6<HH0{_A&mszi0OA9gjOK4fwDXc#H@=q#>RQpkqkiq>Ru+?vAkXbSVK7dSLn?*gy_
zjjN{!SUh<EPhm*r7C3pH-cBCfOTa9>^+iEFRr=;K9At8qQ=c=~M}HT#)sT<V8dpzI
z38h%bGBeMvE)0W@&X7!V{3+U6`1CS&rrF!iWBbqwO)Xiq+Oai!sH{2Acpk38GLfQG
zE3sH)(Ks4Q*s^-0$}q_^{c-Bq>^Fg(`nT<k9X{I|JAAe`cKB>>?C{y%_^R>wBb&6$
nh%8`n`v3p{2XskIMF-Xh6%#iZwFs;u00000NkvXXu0mjfd@Wp4

literal 0
HcmV?d00001

diff --git a/redis-stable/deps/lua/doc/logo.gif b/redis-stable/deps/lua/doc/logo.gif
new file mode 100644
index 0000000000000000000000000000000000000000..2f5e4ac2e742fbb7675e739879211553758aea9c
GIT binary patch
literal 4232
zcmeH``9G8i;K!fm@ywWE@XWZzZ5SF?A>^uN#>^O6HI%DVL*<G!j$AqBbX6LxN`)Cm
zMJhsNOO2x(l|`2hyOX4-ZK<?kzxwX}4c}kC@7L$o&o7_D*N^4CA(9X9fxm%&NdbU#
z0LTV_TvgRPEH*zWDJeNQIXyi+J3Bi+KOY47Ff71eMC$5dO--SemPAvt0FRgG=@sJf
zMY_5r1_mXDhDS|Ij+mGnBauq2td3h)NUf~OY;4Ny?JHbePdYhOy1G_5Ii2$KJniXu
zcJt<HI=z;`sG-wkOs3r5zn;x*`01zmfPh90=lqTx=K=#Sgoa)W4{zSNvn3+p;+{R1
zxZErI_O->tw8h1>$H%uPC0$QQ=txe!o}PX)Ev+jn>*nFZ-TC=<^76WcLZL(=DJm)|
zEiIKwrInSHXU?3duCC_u@5try#>U2`rlw1mF15F}U%!66tE;QKyIUmcDJ<+QF77*W
z<Zfx{J*jk{ynL{-a=5DMepS_j+S=db^55#}#u^*Po0=XqH9fv`>FJd#&)VAl)kJ6K
zi<>tmZ{3>g>+2gB7#JQNe(>OdLh;A=`1q42PbMZNCMPF*dXxhLZw3aYhlZwyhu@Bj
z%#4n{d-Q1b$&<N>i4QMce4L#8^!oMdw{PDnm4D66&3*dxX=-YIX6DQL_g`jbzkd4k
zZDC<ye*W*p#l<gQzW@FA%J=WzS62S#$B!TXwfF!0-x9F@&;H*R0L&_|25Zc2mGy`)
z+O`pct@6G?#M1vPyRGi-5#svzSA%W!1INvMN{s!kHVjozwl_x%U2VL7(sAGLSwC%g
z!<h=+(+*;Bpxm<nV`$h<3G(;zGBPw_`wF(h+c7K}r(v*+W{R&OrTCyV?cxowjME)5
zOV91)=HZ^jcw?Fb*Os`leXA}@#l)#9C}wT{MrU&jhI*=%ujU0+x(>oLf=%jL&vIeE
zO=XcZ9fxt`f}-DQ^%H*PHMUs(JN%UWkI|Y8h9#6~I$Cw@{RqzO4&P-x;jHCPJ6Ks2
zoU%foi)nXd_sdkiuJa@@5J4RrreKfWSnz5>eMa5yTP=)16uu)TIdx~Fhho))6jZl)
z($*i>Qr<!n_FLoFoeEz=NBupi_n%uUu(lq~l6)_cZb5>IX4u}u3>m{WSn_ehkUGQ&
zs})aUlTH1Cj1g3ZE3=MPXsSniEwJ{e6C3N#HjD=B4`8rWIsz!a7ecYpec?Wu<RQx<
zW5OV*$UA5{48Is@B-oVaPDLF@{G{YODM^eY^Ed((jhq=O%2;YHLiQ~=O;=#PJ4IHS
zMi~U@UiSOt4T(F5a3dki=o^_p^IkaGnV&p((0eP^v>H+y?Wsm18^$cS4WmHhH3_=r
zh*ILlm*X1dB^E5($KVl&zT5<?j^;A%f-ajFC(OJ!2wzr{J~MT8IM*#6AiP%&9IKdc
z{3BQTl(i?0x05jdmNBObaWL;&?D3b*c9G)aDb_w_YVw}u+_bg6K$j^qYSO1<TKXq|
z%XwjcBX!Dc4)8E9=V0DlqnKwo-eNq}C-6e9)Xzd6=Aw}_(25p~ks9|w`iiw%*d}$t
zUgBo^*20mWPY9ztEGqkQG}rmo=$W(?Owrg?W%Ioj?_N#i)?m$P29~9ry&12TJ$Zmv
zCM<zIxRS-PZ>24%l}vpHg%;Y+LezV_&TAJCmH`idhuj-n$4FZ)UE|jXLayXa-&O3Q
z?Iyo!x*$5hD_HfFnDfGYj-RD|eIb7I?%>Y_kf%}Nbd`BXb4l1(Pc+}zoUR|9%_!7f
zum2T;wbx&pohtI+&@~wm3nH9xLbOYkg*`phY~TK5iC#3tZNXo9s`cahx+8j2)rh5C
zQgZh6D7Ekgib|hpdhxYf{r<U)u0wTrDRbDJ0JGH?75WFCy0Z=wf;Qsva!0DMT+sAp
zjKiqbRVP!vroBPXH#%E@UtSh#KZHvU+;#{MVir?N`_-1pD8_QqVP)WBfZds>!PTJc
z!vsYG@{hA}l5kL)g)0N_)(nC<*L0qdUi*3fD5<0sn58>zklX@6Tyv3*X^}m=Cqc40
zQ6GfjG@kd1mFIm`qaubWunm_?P>WUZ`9|f_z%gGHi{n|uu(N8!L=aw5(qAcDj$-QK
zu;D#j6e42<qtMiSuKWv@K?Ux07;9W{*R6XjJEx1#@iUm9Uy)x?7$8=?Y>OXTQD>)i
zlv<!8U`l(@GvECIbE)55<5^q%9yQCLtD!4{^S#Fybj?@>M$LX`$n9EEjxM$_QDF&a
z7cme_rat}aXmiN&7`6Q98}dh4Z@8L_uAb#nK&GQiZOOUnA9kAEVb-csuN1AWL=sXt
z{z9GCN%%l0N9QvJM;tl1nf?rrhT{*sE%4WqR?{0~aIrfCcCPxf4eh_*jjQ=`$p53Y
z@_|Rsx2i}|3dNF<BhsI}Wbcu~SaSg_1+!SN&0apzH<+p-xP}7L=8MSQoS)*Nl5;ny
zQMJ8KOMMe$4Y!^5s}kJ{3sM;VxO#%CD5lZz>etMQQ5y8agTK-E0D&7;@3-LUxfvZ7
z7~!p@&mFe^oca2^F|CBt+4Ly?^ViUVSAhAH>JH1GN{^TQb3QnM*x0ZiZgDyNI@_c3
z@{}(WH4*e3T~}n_^0}da4ElIxAf9B!IaL7z9X0Icvj@cIkE*~W--17&WN`Ea5)Gn>
z#gpfRb#44;jVTOS{FuaZgd(-ZD848=fQzgST2MxR>wSLc1P=2HDvByz$B$IsNCC6L
zCM?nK*OHj6JA9gz4|b<~2%RqelN^1Y)jIqnRs!mDKV^BQTfo@hOtz7*Ug}Ee^cbsj
zNNlumRgAmt`1$b5MO;&X#5-EP<}AaY;52ihIpem&MTea$?3!DrwbYa?V`NjEfWF3z
zUq5JY8Ch;L{kx&J<1K&Fe_Vn;8gk{%c;n?nA2(%(f%DCRHko3uT~VI7RE^JWEqaCq
z)i|<Fl@k83KMb0{93?tr0@6Rt6$Mux@&;p*Sq0^LopMfXa^91)2E|AJK6<6+`k2p&
zSlK4<2KDGby9iVI(f$XklN8AAU8TGEJ*22FF_%4*70fTHf>%nfj(*4|V*XhY3W%M#
z*yn6SN4eUOHFxAD7B&9E_PO`G5bqgs^@J{9bk>&;PlUAiqo`j3rjQDgD!}mqLUtb`
zCB}ZD@m@s#pf7bV4jreOC*JVfHZ|hyHkX!rauVdd_I9FL45d{gWH!DNYu;i(|8wVx
z!)eLY6YXxZ2{Coae0xuTnxo1ACb5wtED?VJAz&@114$Ao6uG9YSy*!K;m5_mj=0^j
zw%?b%AOs}ql@$TGC-!^^*_#RT5+y_kTzQG9?LPPZNAtt6cJ%d2$q(I)ws21*?xF%p
zN+NeGnWRQ<5w70Rc(bl|S0Xr&5@WrmdurS|IgPB|EyuZO#=tf!35)G!HJ`E1jh^lH
zTBu~rL#DhQO*XAWtBt}JHH$lc>3%r0yD|maW_(W=B_J+y164F>O4dO|@&@N3Z3p=B
zmVl{|^Z&#atHY|9n&la)SBo}=3AFIF=_~LDJk6MTlA73CXtX+4bnn+c!}N}IPa5pp
zwyqbqIkN|I3j_3vD6$zlu{Ps(<WKwkS{}LAFESsb3otboHNqZuf2f@HBOXvEIO;q`
zBk!(!*zJ-<tcRZFB5S0fBpdOk_XfMoJLoxt^JY@?3@f=!oq+=s56_owPW?yBC*7_c
zG&;J<Z?R-m%&)Jxy|h>N-J|*qz<PJB%h;`Yo8CO2cKzjEzL;>Et<$5Soh;s^AuKv_
z-Tz+O1_~6*9CJh4r}`}mbUtjbf#fX58RIIkP6&@*y9kI|5fK*_eZ%jv3U$5*x<>D_
za2M(TV8?XY+9xy>0En#Te<6X4$0&dbyd(go$~eq4u(u)E<bbc`m}>A2msyF<5ssLZ
zDP|I}=~Bi_q)whWv=Ri~L1TYaNrR;5cMB@s78HF1{w&r(6GJ;_2@bD?#1p&P4n<!j
zgB&X)uN9pk^$4ZHP){bL$Y7UY(iP~#QjZKEwgOQNnRip-0ap%TRU(VPE~p-}I21jD
zw46v{>_?n0#9Vx~$qjMX=Lk?*!@aKo8m&$iPO7S{g3sFUwr`*<53(68xx7?z`2xf#
zGSicy_zI(PJ|<oU3CBTO8RY!f6`BW2AZ$5+6+5D>%qc2VxT+6bOE--a{k&aq7$<<=
zFt)C<@|TPs`+eycPGoGL1Wn9|Ed&a2JyAmjnkm3DQBECX&`bt~od<UpB0(J3U;$lt
z7x8$vbBt&U+2q~(d+YlNhq|wpl9b(bg3{XrVC#A0s0=8H#ryIS)W-ySP*h!3c(+Tg
zS=74eo&X#P)!c|L=|`l1<Hz8ffCC$6_pdU^k2aa{0<dK;v6zrI52QTtzxLL_+S*Wy
zx;8=w`*Z^DzTxoghV@)4$HM)oc24ZrFBMOoIM*&Zb7t{d`1${=$A&sq_8($?dSYWM
z3AVAZ!?xyAT?NE%j*lL*<OCpXkf~j@&8!UGGK#R}D2_HYcY2RT6)L_HW;+scD=NMR
zqhYR-BlckB+wv|Zuum2eEZst;sq#<m&6a`OfgL(x=13W+O9<8;s&t`=d!AN+Xm3K0
z5vYVNq(oP6Fup?sOuewCi@w;CjkHD@S|Bm|-75GPXM}?3Ivtti2O%nnOJ`V0_?iWh
z+<Mfcci)|_6^jIl#VQhm&`?!b1Q8$LIO5}|)h`b)w~wDHEjPL;4A;h^^4}4JQeYc^
z_lQz;0l=FUxhBsoGPMDOs$#qb&*1|?K>H9cUPq4M{#$-q?G3!)qO-it*&YHw+j-O*
zYy78V*`4Q=kQ@^Yz*b6Tal4(Me7BGeS^;phWAW8+L^5A(=D)t?k!rLIwVAKtq=f7h
z&^n&VX1-T$ScvN~639QLZ^d@niMaS{C-Q)8oHHBhwD*r~-1Ze#Q)GFOFptW32a-uF
z;M@ux%i%a25NwIgXt*=GHX$3~aZfwovGL!}sf?j9TsVo^cn(%&a<--0mIX<H?1BP9
zFb7sMM;$V}pwfdmFClEFqMG_IXp&HVO7u2cyo7^#&1@plRJU<qEDw%YM#_+8wSO&h
zO++WmVNXQFhkrs)+xh1zII6)^RA4J?I+q<Zimn=Nwsb*p6tJ(9TUc^(E7H>YqGe>c
PWz_J}_#7St0k8iB@FZjZ

literal 0
HcmV?d00001

diff --git a/redis-stable/deps/lua/doc/lua.1 b/redis-stable/deps/lua/doc/lua.1
new file mode 100644
index 00000000..24809cc6
--- /dev/null
+++ b/redis-stable/deps/lua/doc/lua.1
@@ -0,0 +1,163 @@
+.\" $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $
+.TH LUA 1 "$Date: 2006/01/06 16:03:34 $"
+.SH NAME
+lua \- Lua interpreter
+.SH SYNOPSIS
+.B lua
+[
+.I options
+]
+[
+.I script
+[
+.I args
+]
+]
+.SH DESCRIPTION
+.B lua
+is the stand-alone Lua interpreter.
+It loads and executes Lua programs,
+either in textual source form or
+in precompiled binary form.
+(Precompiled binaries are output by
+.BR luac ,
+the Lua compiler.)
+.B lua
+can be used as a batch interpreter and also interactively.
+.LP
+The given
+.I options
+(see below)
+are executed and then
+the Lua program in file
+.I script
+is loaded and executed.
+The given
+.I args
+are available to
+.I script
+as strings in a global table named
+.BR arg .
+If these arguments contain spaces or other characters special to the shell,
+then they should be quoted
+(but note that the quotes will be removed by the shell).
+The arguments in
+.B arg
+start at 0,
+which contains the string
+.RI ' script '.
+The index of the last argument is stored in
+.BR arg.n .
+The arguments given in the command line before
+.IR script ,
+including the name of the interpreter,
+are available in negative indices in
+.BR arg .
+.LP
+At the very start,
+before even handling the command line,
+.B lua
+executes the contents of the environment variable
+.BR LUA_INIT ,
+if it is defined.
+If the value of
+.B LUA_INIT
+is of the form
+.RI '@ filename ',
+then
+.I filename
+is executed.
+Otherwise, the string is assumed to be a Lua statement and is executed.
+.LP
+Options start with
+.B '\-'
+and are described below.
+You can use
+.B "'\--'"
+to signal the end of options.
+.LP
+If no arguments are given,
+then
+.B "\-v \-i"
+is assumed when the standard input is a terminal;
+otherwise,
+.B "\-"
+is assumed.
+.LP
+In interactive mode,
+.B lua
+prompts the user,
+reads lines from the standard input,
+and executes them as they are read.
+If a line does not contain a complete statement,
+then a secondary prompt is displayed and
+lines are read until a complete statement is formed or
+a syntax error is found.
+So, one way to interrupt the reading of an incomplete statement is
+to force a syntax error:
+adding a
+.B ';' 
+in the middle of a statement is a sure way of forcing a syntax error
+(except inside multiline strings and comments; these must be closed explicitly).
+If a line starts with
+.BR '=' ,
+then
+.B lua
+displays the values of all the expressions in the remainder of the
+line. The expressions must be separated by commas.
+The primary prompt is the value of the global variable
+.BR _PROMPT ,
+if this value is a string;
+otherwise, the default prompt is used.
+Similarly, the secondary prompt is the value of the global variable
+.BR _PROMPT2 .
+So,
+to change the prompts,
+set the corresponding variable to a string of your choice.
+You can do that after calling the interpreter
+or on the command line
+(but in this case you have to be careful with quotes
+if the prompt string contains a space; otherwise you may confuse the shell.)
+The default prompts are "> " and ">> ".
+.SH OPTIONS
+.TP
+.B \-
+load and execute the standard input as a file,
+that is,
+not interactively,
+even when the standard input is a terminal.
+.TP
+.BI \-e " stat"
+execute statement
+.IR stat .
+You need to quote
+.I stat 
+if it contains spaces, quotes,
+or other characters special to the shell.
+.TP
+.B \-i
+enter interactive mode after
+.I script
+is executed.
+.TP
+.BI \-l " name"
+call
+.BI require(' name ')
+before executing
+.IR script .
+Typically used to load libraries.
+.TP
+.B \-v
+show version information.
+.SH "SEE ALSO"
+.BR luac (1)
+.br
+http://www.lua.org/
+.SH DIAGNOSTICS
+Error messages should be self explanatory.
+.SH AUTHORS
+R. Ierusalimschy,
+L. H. de Figueiredo,
+and
+W. Celes
+.\" EOF
diff --git a/redis-stable/deps/lua/doc/lua.css b/redis-stable/deps/lua/doc/lua.css
new file mode 100644
index 00000000..7fafbb1b
--- /dev/null
+++ b/redis-stable/deps/lua/doc/lua.css
@@ -0,0 +1,83 @@
+body {
+	color: #000000 ;
+	background-color: #FFFFFF ;
+	font-family: Helvetica, Arial, sans-serif ;
+	text-align: justify ;
+	margin-right: 30px ;
+	margin-left: 30px ;
+}
+
+h1, h2, h3, h4 {
+	font-family: Verdana, Geneva, sans-serif ;
+	font-weight: normal ;
+	font-style: italic ;
+}
+
+h2 {
+	padding-top: 0.4em ;
+	padding-bottom: 0.4em ;
+	padding-left: 30px ;
+	padding-right: 30px ;
+	margin-left: -30px ;
+	background-color: #E0E0FF ;
+}
+
+h3 {
+	padding-left: 0.5em ;
+	border-left: solid #E0E0FF 1em ;
+}
+
+table h3 {
+	padding-left: 0px ;
+	border-left: none ;
+}
+
+a:link {
+	color: #000080 ;
+	background-color: inherit ;
+	text-decoration: none ;
+}
+
+a:visited {
+	background-color: inherit ;
+	text-decoration: none ;
+}
+
+a:link:hover, a:visited:hover {
+	color: #000080 ;
+	background-color: #E0E0FF ;
+}
+
+a:link:active, a:visited:active {
+	color: #FF0000 ;
+}
+
+hr {
+	border: 0 ;
+	height: 1px ;
+	color: #a0a0a0 ;
+	background-color: #a0a0a0 ;
+}
+
+:target {
+	background-color: #F8F8F8 ;
+	padding: 8px ;
+	border: solid #a0a0a0 2px ;
+}
+
+.footer {
+	color: gray ;
+	font-size: small ;
+}
+
+input[type=text] {
+	border: solid #a0a0a0 2px ;
+	border-radius: 2em ;
+	-moz-border-radius: 2em ;
+	background-image: url('images/search.png') ;
+	background-repeat: no-repeat;
+	background-position: 4px center ;
+	padding-left: 20px ;
+	height: 2em ;
+}
+
diff --git a/redis-stable/deps/lua/doc/lua.html b/redis-stable/deps/lua/doc/lua.html
new file mode 100644
index 00000000..1d435ab0
--- /dev/null
+++ b/redis-stable/deps/lua/doc/lua.html
@@ -0,0 +1,172 @@
+<!-- $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $ -->
+<HTML>
+<HEAD>
+<TITLE>LUA man page</TITLE>
+<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<H2>NAME</H2>
+lua - Lua interpreter
+<H2>SYNOPSIS</H2>
+<B>lua</B>
+[
+<I>options</I>
+]
+[
+<I>script</I>
+[
+<I>args</I>
+]
+]
+<H2>DESCRIPTION</H2>
+<B>lua</B>
+is the stand-alone Lua interpreter.
+It loads and executes Lua programs,
+either in textual source form or
+in precompiled binary form.
+(Precompiled binaries are output by
+<B>luac</B>,
+the Lua compiler.)
+<B>lua</B>
+can be used as a batch interpreter and also interactively.
+<P>
+The given
+<I>options</I>
+(see below)
+are executed and then
+the Lua program in file
+<I>script</I>
+is loaded and executed.
+The given
+<I>args</I>
+are available to
+<I>script</I>
+as strings in a global table named
+<B>arg</B>.
+If these arguments contain spaces or other characters special to the shell,
+then they should be quoted
+(but note that the quotes will be removed by the shell).
+The arguments in
+<B>arg</B>
+start at 0,
+which contains the string
+'<I>script</I>'.
+The index of the last argument is stored in
+<B>arg.n</B>.
+The arguments given in the command line before
+<I>script</I>,
+including the name of the interpreter,
+are available in negative indices in
+<B>arg</B>.
+<P>
+At the very start,
+before even handling the command line,
+<B>lua</B>
+executes the contents of the environment variable
+<B>LUA_INIT</B>,
+if it is defined.
+If the value of
+<B>LUA_INIT</B>
+is of the form
+'@<I>filename</I>',
+then
+<I>filename</I>
+is executed.
+Otherwise, the string is assumed to be a Lua statement and is executed.
+<P>
+Options start with
+<B>'-'</B>
+and are described below.
+You can use
+<B>'--'</B>
+to signal the end of options.
+<P>
+If no arguments are given,
+then
+<B>"-v -i"</B>
+is assumed when the standard input is a terminal;
+otherwise,
+<B>"-"</B>
+is assumed.
+<P>
+In interactive mode,
+<B>lua</B>
+prompts the user,
+reads lines from the standard input,
+and executes them as they are read.
+If a line does not contain a complete statement,
+then a secondary prompt is displayed and
+lines are read until a complete statement is formed or
+a syntax error is found.
+So, one way to interrupt the reading of an incomplete statement is
+to force a syntax error:
+adding a
+<B>';'</B>
+in the middle of a statement is a sure way of forcing a syntax error
+(except inside multiline strings and comments; these must be closed explicitly).
+If a line starts with
+<B>'='</B>,
+then
+<B>lua</B>
+displays the values of all the expressions in the remainder of the
+line. The expressions must be separated by commas.
+The primary prompt is the value of the global variable
+<B>_PROMPT</B>,
+if this value is a string;
+otherwise, the default prompt is used.
+Similarly, the secondary prompt is the value of the global variable
+<B>_PROMPT2</B>.
+So,
+to change the prompts,
+set the corresponding variable to a string of your choice.
+You can do that after calling the interpreter
+or on the command line
+(but in this case you have to be careful with quotes
+if the prompt string contains a space; otherwise you may confuse the shell.)
+The default prompts are "&gt; " and "&gt;&gt; ".
+<H2>OPTIONS</H2>
+<P>
+<B>-</B>
+load and execute the standard input as a file,
+that is,
+not interactively,
+even when the standard input is a terminal.
+<P>
+<B>-e </B><I>stat</I>
+execute statement
+<I>stat</I>.
+You need to quote
+<I>stat </I>
+if it contains spaces, quotes,
+or other characters special to the shell.
+<P>
+<B>-i</B>
+enter interactive mode after
+<I>script</I>
+is executed.
+<P>
+<B>-l </B><I>name</I>
+call
+<B>require</B>('<I>name</I>')
+before executing
+<I>script</I>.
+Typically used to load libraries.
+<P>
+<B>-v</B>
+show version information.
+<H2>SEE ALSO</H2>
+<B>luac</B>(1)
+<BR>
+<A HREF="http://www.lua.org/">http://www.lua.org/</A>
+<H2>DIAGNOSTICS</H2>
+Error messages should be self explanatory.
+<H2>AUTHORS</H2>
+R. Ierusalimschy,
+L. H. de Figueiredo,
+and
+W. Celes
+<!-- EOF -->
+</BODY>
+</HTML>
diff --git a/redis-stable/deps/lua/doc/luac.1 b/redis-stable/deps/lua/doc/luac.1
new file mode 100644
index 00000000..d8146782
--- /dev/null
+++ b/redis-stable/deps/lua/doc/luac.1
@@ -0,0 +1,136 @@
+.\" $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $
+.TH LUAC 1 "$Date: 2006/01/06 16:03:34 $"
+.SH NAME
+luac \- Lua compiler
+.SH SYNOPSIS
+.B luac
+[
+.I options
+] [
+.I filenames
+]
+.SH DESCRIPTION
+.B luac
+is the Lua compiler.
+It translates programs written in the Lua programming language
+into binary files that can be later loaded and executed.
+.LP
+The main advantages of precompiling chunks are:
+faster loading,
+protecting source code from accidental user changes,
+and
+off-line syntax checking.
+.LP
+Pre-compiling does not imply faster execution
+because in Lua chunks are always compiled into bytecodes before being executed.
+.B luac
+simply allows those bytecodes to be saved in a file for later execution.
+.LP
+Pre-compiled chunks are not necessarily smaller than the corresponding source.
+The main goal in pre-compiling is faster loading.
+.LP
+The binary files created by
+.B luac
+are portable only among architectures with the same word size and byte order.
+.LP
+.B luac
+produces a single output file containing the bytecodes
+for all source files given.
+By default,
+the output file is named
+.BR luac.out ,
+but you can change this with the
+.B \-o
+option.
+.LP
+In the command line,
+you can mix
+text files containing Lua source and
+binary files containing precompiled chunks.
+This is useful to combine several precompiled chunks,
+even from different (but compatible) platforms,
+into a single precompiled chunk.
+.LP
+You can use
+.B "'\-'"
+to indicate the standard input as a source file
+and
+.B "'\--'"
+to signal the end of options
+(that is,
+all remaining arguments will be treated as files even if they start with
+.BR "'\-'" ).
+.LP
+The internal format of the binary files produced by
+.B luac
+is likely to change when a new version of Lua is released.
+So,
+save the source files of all Lua programs that you precompile.
+.LP
+.SH OPTIONS
+Options must be separate.
+.TP
+.B \-l
+produce a listing of the compiled bytecode for Lua's virtual machine.
+Listing bytecodes is useful to learn about Lua's virtual machine.
+If no files are given, then
+.B luac
+loads
+.B luac.out
+and lists its contents.
+.TP
+.BI \-o " file"
+output to
+.IR file ,
+instead of the default
+.BR luac.out .
+(You can use
+.B "'\-'"
+for standard output,
+but not on platforms that open standard output in text mode.)
+The output file may be a source file because
+all files are loaded before the output file is written.
+Be careful not to overwrite precious files.
+.TP
+.B \-p
+load files but do not generate any output file.
+Used mainly for syntax checking and for testing precompiled chunks:
+corrupted files will probably generate errors when loaded.
+Lua always performs a thorough integrity test on precompiled chunks.
+Bytecode that passes this test is completely safe,
+in the sense that it will not break the interpreter.
+However,
+there is no guarantee that such code does anything sensible.
+(None can be given, because the halting problem is unsolvable.)
+If no files are given, then
+.B luac
+loads
+.B luac.out
+and tests its contents.
+No messages are displayed if the file passes the integrity test.
+.TP
+.B \-s
+strip debug information before writing the output file.
+This saves some space in very large chunks,
+but if errors occur when running a stripped chunk,
+then the error messages may not contain the full information they usually do.
+For instance,
+line numbers and names of local variables are lost.
+.TP
+.B \-v
+show version information.
+.SH FILES
+.TP 15
+.B luac.out
+default output file
+.SH "SEE ALSO"
+.BR lua (1)
+.br
+http://www.lua.org/
+.SH DIAGNOSTICS
+Error messages should be self explanatory.
+.SH AUTHORS
+L. H. de Figueiredo,
+R. Ierusalimschy and
+W. Celes
+.\" EOF
diff --git a/redis-stable/deps/lua/doc/luac.html b/redis-stable/deps/lua/doc/luac.html
new file mode 100644
index 00000000..179ffe82
--- /dev/null
+++ b/redis-stable/deps/lua/doc/luac.html
@@ -0,0 +1,145 @@
+<!-- $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $ -->
+<HTML>
+<HEAD>
+<TITLE>LUAC man page</TITLE>
+<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
+</HEAD>
+
+<BODY BGCOLOR="#FFFFFF">
+
+<H2>NAME</H2>
+luac - Lua compiler
+<H2>SYNOPSIS</H2>
+<B>luac</B>
+[
+<I>options</I>
+] [
+<I>filenames</I>
+]
+<H2>DESCRIPTION</H2>
+<B>luac</B>
+is the Lua compiler.
+It translates programs written in the Lua programming language
+into binary files that can be later loaded and executed.
+<P>
+The main advantages of precompiling chunks are:
+faster loading,
+protecting source code from accidental user changes,
+and
+off-line syntax checking.
+<P>
+Precompiling does not imply faster execution
+because in Lua chunks are always compiled into bytecodes before being executed.
+<B>luac</B>
+simply allows those bytecodes to be saved in a file for later execution.
+<P>
+Precompiled chunks are not necessarily smaller than the corresponding source.
+The main goal in precompiling is faster loading.
+<P>
+The binary files created by
+<B>luac</B>
+are portable only among architectures with the same word size and byte order.
+<P>
+<B>luac</B>
+produces a single output file containing the bytecodes
+for all source files given.
+By default,
+the output file is named
+<B>luac.out</B>,
+but you can change this with the
+<B>-o</B>
+option.
+<P>
+In the command line,
+you can mix
+text files containing Lua source and
+binary files containing precompiled chunks.
+This is useful because several precompiled chunks,
+even from different (but compatible) platforms,
+can be combined into a single precompiled chunk.
+<P>
+You can use
+<B>'-'</B>
+to indicate the standard input as a source file
+and
+<B>'--'</B>
+to signal the end of options
+(that is,
+all remaining arguments will be treated as files even if they start with
+<B>'-'</B>).
+<P>
+The internal format of the binary files produced by
+<B>luac</B>
+is likely to change when a new version of Lua is released.
+So,
+save the source files of all Lua programs that you precompile.
+<P>
+<H2>OPTIONS</H2>
+Options must be separate.
+<P>
+<B>-l</B>
+produce a listing of the compiled bytecode for Lua's virtual machine.
+Listing bytecodes is useful to learn about Lua's virtual machine.
+If no files are given, then
+<B>luac</B>
+loads
+<B>luac.out</B>
+and lists its contents.
+<P>
+<B>-o </B><I>file</I>
+output to
+<I>file</I>,
+instead of the default
+<B>luac.out</B>.
+(You can use
+<B>'-'</B>
+for standard output,
+but not on platforms that open standard output in text mode.)
+The output file may be a source file because
+all files are loaded before the output file is written.
+Be careful not to overwrite precious files.
+<P>
+<B>-p</B>
+load files but do not generate any output file.
+Used mainly for syntax checking and for testing precompiled chunks:
+corrupted files will probably generate errors when loaded.
+Lua always performs a thorough integrity test on precompiled chunks.
+Bytecode that passes this test is completely safe,
+in the sense that it will not break the interpreter.
+However,
+there is no guarantee that such code does anything sensible.
+(None can be given, because the halting problem is unsolvable.)
+If no files are given, then
+<B>luac</B>
+loads
+<B>luac.out</B>
+and tests its contents.
+No messages are displayed if the file passes the integrity test.
+<P>
+<B>-s</B>
+strip debug information before writing the output file.
+This saves some space in very large chunks,
+but if errors occur when running a stripped chunk,
+then the error messages may not contain the full information they usually do.
+For instance,
+line numbers and names of local variables are lost.
+<P>
+<B>-v</B>
+show version information.
+<H2>FILES</H2>
+<P>
+<B>luac.out</B>
+default output file
+<H2>SEE ALSO</H2>
+<B>lua</B>(1)
+<BR>
+<A HREF="http://www.lua.org/">http://www.lua.org/</A>
+<H2>DIAGNOSTICS</H2>
+Error messages should be self explanatory.
+<H2>AUTHORS</H2>
+L. H. de Figueiredo,
+R. Ierusalimschy and
+W. Celes
+<!-- EOF -->
+</BODY>
+</HTML>
diff --git a/redis-stable/deps/lua/doc/manual.css b/redis-stable/deps/lua/doc/manual.css
new file mode 100644
index 00000000..b49b3629
--- /dev/null
+++ b/redis-stable/deps/lua/doc/manual.css
@@ -0,0 +1,24 @@
+h3 code {
+	font-family: inherit ;
+	font-size: inherit ;
+}
+
+pre, code {
+	font-size: 12pt ;
+}
+
+span.apii {
+	float: right ;
+	font-family: inherit ;
+	font-style: normal ;
+	font-size: small ;
+	color: gray ;
+}
+
+p+h1, ul+h1 {
+	padding-top: 0.4em ;
+	padding-bottom: 0.4em ;
+	padding-left: 30px ;
+	margin-left: -30px ;
+	background-color: #E0E0FF ;
+}
diff --git a/redis-stable/deps/lua/doc/manual.html b/redis-stable/deps/lua/doc/manual.html
new file mode 100644
index 00000000..4e41683d
--- /dev/null
+++ b/redis-stable/deps/lua/doc/manual.html
@@ -0,0 +1,8804 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+
+<head>
+<title>Lua 5.1 Reference Manual</title>
+<link rel="stylesheet" type="text/css" href="lua.css">
+<link rel="stylesheet" type="text/css" href="manual.css">
+<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=iso-8859-1">
+</head>
+
+<body>
+
+<hr>
+<h1>
+<a href="http://www.lua.org/"><img src="logo.gif" alt="" border="0"></a>
+Lua 5.1 Reference Manual
+</h1>
+
+by Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes
+<p>
+<small>
+Copyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.
+Freely available under the terms of the
+<a href="http://www.lua.org/license.html">Lua license</a>.
+</small>
+<hr>
+<p>
+
+<a href="contents.html#contents">contents</A>
+&middot;
+<a href="contents.html#index">index</A>
+&middot;
+<A HREF="http://www.lua.org/manual/">other versions</A>
+
+<!-- ====================================================================== -->
+<p>
+
+<!-- $Id: manual.of,v 1.49.1.2 2012/01/13 20:23:26 roberto Exp $ -->
+
+
+
+
+<h1>1 - <a name="1">Introduction</a></h1>
+
+<p>
+Lua is an extension programming language designed to support
+general procedural programming with data description
+facilities.
+It also offers good support for object-oriented programming,
+functional programming, and data-driven programming.
+Lua is intended to be used as a powerful, light-weight
+scripting language for any program that needs one.
+Lua is implemented as a library, written in <em>clean</em> C
+(that is, in the common subset of ANSI&nbsp;C and C++).
+
+
+<p>
+Being an extension language, Lua has no notion of a "main" program:
+it only works <em>embedded</em> in a host client,
+called the <em>embedding program</em> or simply the <em>host</em>.
+This host program can invoke functions to execute a piece of Lua code,
+can write and read Lua variables,
+and can register C&nbsp;functions to be called by Lua code.
+Through the use of C&nbsp;functions, Lua can be augmented to cope with
+a wide range of different domains,
+thus creating customized programming languages sharing a syntactical framework.
+The Lua distribution includes a sample host program called <code>lua</code>,
+which uses the Lua library to offer a complete, stand-alone Lua interpreter.
+
+
+<p>
+Lua is free software,
+and is provided as usual with no guarantees,
+as stated in its license.
+The implementation described in this manual is available
+at Lua's official web site, <code>www.lua.org</code>.
+
+
+<p>
+Like any other reference manual,
+this document is dry in places.
+For a discussion of the decisions behind the design of Lua,
+see the technical papers available at Lua's web site.
+For a detailed introduction to programming in Lua,
+see Roberto's book, <em>Programming in Lua (Second Edition)</em>.
+
+
+
+<h1>2 - <a name="2">The Language</a></h1>
+
+<p>
+This section describes the lexis, the syntax, and the semantics of Lua.
+In other words,
+this section describes
+which tokens are valid,
+how they can be combined,
+and what their combinations mean.
+
+
+<p>
+The language constructs will be explained using the usual extended BNF notation,
+in which
+{<em>a</em>}&nbsp;means&nbsp;0 or more <em>a</em>'s, and
+[<em>a</em>]&nbsp;means an optional <em>a</em>.
+Non-terminals are shown like non-terminal,
+keywords are shown like <b>kword</b>,
+and other terminal symbols are shown like `<b>=</b>&acute;.
+The complete syntax of Lua can be found in <a href="#8">&sect;8</a>
+at the end of this manual.
+
+
+
+<h2>2.1 - <a name="2.1">Lexical Conventions</a></h2>
+
+<p>
+<em>Names</em>
+(also called <em>identifiers</em>)
+in Lua can be any string of letters,
+digits, and underscores,
+not beginning with a digit.
+This coincides with the definition of names in most languages.
+(The definition of letter depends on the current locale:
+any character considered alphabetic by the current locale
+can be used in an identifier.)
+Identifiers are used to name variables and table fields.
+
+
+<p>
+The following <em>keywords</em> are reserved
+and cannot be used as names:
+
+
+<pre>
+     and       break     do        else      elseif
+     end       false     for       function  if
+     in        local     nil       not       or
+     repeat    return    then      true      until     while
+</pre>
+
+<p>
+Lua is a case-sensitive language:
+<code>and</code> is a reserved word, but <code>And</code> and <code>AND</code>
+are two different, valid names.
+As a convention, names starting with an underscore followed by
+uppercase letters (such as <a href="#pdf-_VERSION"><code>_VERSION</code></a>)
+are reserved for internal global variables used by Lua.
+
+
+<p>
+The following strings denote other tokens:
+
+<pre>
+     +     -     *     /     %     ^     #
+     ==    ~=    &lt;=    &gt;=    &lt;     &gt;     =
+     (     )     {     }     [     ]
+     ;     :     ,     .     ..    ...
+</pre>
+
+<p>
+<em>Literal strings</em>
+can be delimited by matching single or double quotes,
+and can contain the following C-like escape sequences:
+'<code>\a</code>' (bell),
+'<code>\b</code>' (backspace),
+'<code>\f</code>' (form feed),
+'<code>\n</code>' (newline),
+'<code>\r</code>' (carriage return),
+'<code>\t</code>' (horizontal tab),
+'<code>\v</code>' (vertical tab),
+'<code>\\</code>' (backslash),
+'<code>\"</code>' (quotation mark [double quote]),
+and '<code>\'</code>' (apostrophe [single quote]).
+Moreover, a backslash followed by a real newline
+results in a newline in the string.
+A character in a string can also be specified by its numerical value
+using the escape sequence <code>\<em>ddd</em></code>,
+where <em>ddd</em> is a sequence of up to three decimal digits.
+(Note that if a numerical escape is to be followed by a digit,
+it must be expressed using exactly three digits.)
+Strings in Lua can contain any 8-bit value, including embedded zeros,
+which can be specified as '<code>\0</code>'.
+
+
+<p>
+Literal strings can also be defined using a long format
+enclosed by <em>long brackets</em>.
+We define an <em>opening long bracket of level <em>n</em></em> as an opening
+square bracket followed by <em>n</em> equal signs followed by another
+opening square bracket.
+So, an opening long bracket of level&nbsp;0 is written as <code>[[</code>,
+an opening long bracket of level&nbsp;1 is written as <code>[=[</code>,
+and so on.
+A <em>closing long bracket</em> is defined similarly;
+for instance, a closing long bracket of level&nbsp;4 is written as <code>]====]</code>.
+A long string starts with an opening long bracket of any level and
+ends at the first closing long bracket of the same level.
+Literals in this bracketed form can run for several lines,
+do not interpret any escape sequences,
+and ignore long brackets of any other level.
+They can contain anything except a closing bracket of the proper level.
+
+
+<p>
+For convenience,
+when the opening long bracket is immediately followed by a newline,
+the newline is not included in the string.
+As an example, in a system using ASCII
+(in which '<code>a</code>' is coded as&nbsp;97,
+newline is coded as&nbsp;10, and '<code>1</code>' is coded as&nbsp;49),
+the five literal strings below denote the same string:
+
+<pre>
+     a = 'alo\n123"'
+     a = "alo\n123\""
+     a = '\97lo\10\04923"'
+     a = [[alo
+     123"]]
+     a = [==[
+     alo
+     123"]==]
+</pre>
+
+<p>
+A <em>numerical constant</em> can be written with an optional decimal part
+and an optional decimal exponent.
+Lua also accepts integer hexadecimal constants,
+by prefixing them with <code>0x</code>.
+Examples of valid numerical constants are
+
+<pre>
+     3   3.0   3.1416   314.16e-2   0.31416E1   0xff   0x56
+</pre>
+
+<p>
+A <em>comment</em> starts with a double hyphen (<code>--</code>)
+anywhere outside a string.
+If the text immediately after <code>--</code> is not an opening long bracket,
+the comment is a <em>short comment</em>,
+which runs until the end of the line.
+Otherwise, it is a <em>long comment</em>,
+which runs until the corresponding closing long bracket.
+Long comments are frequently used to disable code temporarily.
+
+
+
+
+
+<h2>2.2 - <a name="2.2">Values and Types</a></h2>
+
+<p>
+Lua is a <em>dynamically typed language</em>.
+This means that
+variables do not have types; only values do.
+There are no type definitions in the language.
+All values carry their own type.
+
+
+<p>
+All values in Lua are <em>first-class values</em>.
+This means that all values can be stored in variables,
+passed as arguments to other functions, and returned as results.
+
+
+<p>
+There are eight basic types in Lua:
+<em>nil</em>, <em>boolean</em>, <em>number</em>,
+<em>string</em>, <em>function</em>, <em>userdata</em>,
+<em>thread</em>, and <em>table</em>.
+<em>Nil</em> is the type of the value <b>nil</b>,
+whose main property is to be different from any other value;
+it usually represents the absence of a useful value.
+<em>Boolean</em> is the type of the values <b>false</b> and <b>true</b>.
+Both <b>nil</b> and <b>false</b> make a condition false;
+any other value makes it true.
+<em>Number</em> represents real (double-precision floating-point) numbers.
+(It is easy to build Lua interpreters that use other
+internal representations for numbers,
+such as single-precision float or long integers;
+see file <code>luaconf.h</code>.)
+<em>String</em> represents arrays of characters.
+
+Lua is 8-bit clean:
+strings can contain any 8-bit character,
+including embedded zeros ('<code>\0</code>') (see <a href="#2.1">&sect;2.1</a>).
+
+
+<p>
+Lua can call (and manipulate) functions written in Lua and
+functions written in C
+(see <a href="#2.5.8">&sect;2.5.8</a>).
+
+
+<p>
+The type <em>userdata</em> is provided to allow arbitrary C&nbsp;data to
+be stored in Lua variables.
+This type corresponds to a block of raw memory
+and has no pre-defined operations in Lua,
+except assignment and identity test.
+However, by using <em>metatables</em>,
+the programmer can define operations for userdata values
+(see <a href="#2.8">&sect;2.8</a>).
+Userdata values cannot be created or modified in Lua,
+only through the C&nbsp;API.
+This guarantees the integrity of data owned by the host program.
+
+
+<p>
+The type <em>thread</em> represents independent threads of execution
+and it is used to implement coroutines (see <a href="#2.11">&sect;2.11</a>).
+Do not confuse Lua threads with operating-system threads.
+Lua supports coroutines on all systems,
+even those that do not support threads.
+
+
+<p>
+The type <em>table</em> implements associative arrays,
+that is, arrays that can be indexed not only with numbers,
+but with any value (except <b>nil</b>).
+Tables can be <em>heterogeneous</em>;
+that is, they can contain values of all types (except <b>nil</b>).
+Tables are the sole data structuring mechanism in Lua;
+they can be used to represent ordinary arrays,
+symbol tables, sets, records, graphs, trees, etc.
+To represent records, Lua uses the field name as an index.
+The language supports this representation by
+providing <code>a.name</code> as syntactic sugar for <code>a["name"]</code>.
+There are several convenient ways to create tables in Lua
+(see <a href="#2.5.7">&sect;2.5.7</a>).
+
+
+<p>
+Like indices,
+the value of a table field can be of any type (except <b>nil</b>).
+In particular,
+because functions are first-class values,
+table fields can contain functions.
+Thus tables can also carry <em>methods</em> (see <a href="#2.5.9">&sect;2.5.9</a>).
+
+
+<p>
+Tables, functions, threads, and (full) userdata values are <em>objects</em>:
+variables do not actually <em>contain</em> these values,
+only <em>references</em> to them.
+Assignment, parameter passing, and function returns
+always manipulate references to such values;
+these operations do not imply any kind of copy.
+
+
+<p>
+The library function <a href="#pdf-type"><code>type</code></a> returns a string describing the type
+of a given value.
+
+
+
+<h3>2.2.1 - <a name="2.2.1">Coercion</a></h3>
+
+<p>
+Lua provides automatic conversion between
+string and number values at run time.
+Any arithmetic operation applied to a string tries to convert
+this string to a number, following the usual conversion rules.
+Conversely, whenever a number is used where a string is expected,
+the number is converted to a string, in a reasonable format.
+For complete control over how numbers are converted to strings,
+use the <code>format</code> function from the string library
+(see <a href="#pdf-string.format"><code>string.format</code></a>).
+
+
+
+
+
+
+
+<h2>2.3 - <a name="2.3">Variables</a></h2>
+
+<p>
+Variables are places that store values.
+
+There are three kinds of variables in Lua:
+global variables, local variables, and table fields.
+
+
+<p>
+A single name can denote a global variable or a local variable
+(or a function's formal parameter,
+which is a particular kind of local variable):
+
+<pre>
+	var ::= Name
+</pre><p>
+Name denotes identifiers, as defined in <a href="#2.1">&sect;2.1</a>.
+
+
+<p>
+Any variable is assumed to be global unless explicitly declared
+as a local (see <a href="#2.4.7">&sect;2.4.7</a>).
+Local variables are <em>lexically scoped</em>:
+local variables can be freely accessed by functions
+defined inside their scope (see <a href="#2.6">&sect;2.6</a>).
+
+
+<p>
+Before the first assignment to a variable, its value is <b>nil</b>.
+
+
+<p>
+Square brackets are used to index a table:
+
+<pre>
+	var ::= prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute;
+</pre><p>
+The meaning of accesses to global variables 
+and table fields can be changed via metatables.
+An access to an indexed variable <code>t[i]</code> is equivalent to
+a call <code>gettable_event(t,i)</code>.
+(See <a href="#2.8">&sect;2.8</a> for a complete description of the
+<code>gettable_event</code> function.
+This function is not defined or callable in Lua.
+We use it here only for explanatory purposes.)
+
+
+<p>
+The syntax <code>var.Name</code> is just syntactic sugar for
+<code>var["Name"]</code>:
+
+<pre>
+	var ::= prefixexp `<b>.</b>&acute; Name
+</pre>
+
+<p>
+All global variables live as fields in ordinary Lua tables,
+called <em>environment tables</em> or simply
+<em>environments</em> (see <a href="#2.9">&sect;2.9</a>).
+Each function has its own reference to an environment,
+so that all global variables in this function
+will refer to this environment table.
+When a function is created,
+it inherits the environment from the function that created it.
+To get the environment table of a Lua function,
+you call <a href="#pdf-getfenv"><code>getfenv</code></a>.
+To replace it,
+you call <a href="#pdf-setfenv"><code>setfenv</code></a>.
+(You can only manipulate the environment of C&nbsp;functions
+through the debug library; (see <a href="#5.9">&sect;5.9</a>).)
+
+
+<p>
+An access to a global variable <code>x</code>
+is equivalent to <code>_env.x</code>,
+which in turn is equivalent to
+
+<pre>
+     gettable_event(_env, "x")
+</pre><p>
+where <code>_env</code> is the environment of the running function.
+(See <a href="#2.8">&sect;2.8</a> for a complete description of the
+<code>gettable_event</code> function.
+This function is not defined or callable in Lua.
+Similarly, the <code>_env</code> variable is not defined in Lua.
+We use them here only for explanatory purposes.)
+
+
+
+
+
+<h2>2.4 - <a name="2.4">Statements</a></h2>
+
+<p>
+Lua supports an almost conventional set of statements,
+similar to those in Pascal or C.
+This set includes
+assignments, control structures, function calls,
+and variable declarations.
+
+
+
+<h3>2.4.1 - <a name="2.4.1">Chunks</a></h3>
+
+<p>
+The unit of execution of Lua is called a <em>chunk</em>.
+A chunk is simply a sequence of statements,
+which are executed sequentially.
+Each statement can be optionally followed by a semicolon:
+
+<pre>
+	chunk ::= {stat [`<b>;</b>&acute;]}
+</pre><p>
+There are no empty statements and thus '<code>;;</code>' is not legal.
+
+
+<p>
+Lua handles a chunk as the body of an anonymous function 
+with a variable number of arguments
+(see <a href="#2.5.9">&sect;2.5.9</a>).
+As such, chunks can define local variables,
+receive arguments, and return values.
+
+
+<p>
+A chunk can be stored in a file or in a string inside the host program.
+To execute a chunk,
+Lua first pre-compiles the chunk into instructions for a virtual machine,
+and then it executes the compiled code
+with an interpreter for the virtual machine.
+
+
+<p>
+Chunks can also be pre-compiled into binary form;
+see program <code>luac</code> for details.
+Programs in source and compiled forms are interchangeable;
+Lua automatically detects the file type and acts accordingly.
+
+
+
+
+
+
+<h3>2.4.2 - <a name="2.4.2">Blocks</a></h3><p>
+A block is a list of statements;
+syntactically, a block is the same as a chunk:
+
+<pre>
+	block ::= chunk
+</pre>
+
+<p>
+A block can be explicitly delimited to produce a single statement:
+
+<pre>
+	stat ::= <b>do</b> block <b>end</b>
+</pre><p>
+Explicit blocks are useful
+to control the scope of variable declarations.
+Explicit blocks are also sometimes used to
+add a <b>return</b> or <b>break</b> statement in the middle
+of another block (see <a href="#2.4.4">&sect;2.4.4</a>).
+
+
+
+
+
+<h3>2.4.3 - <a name="2.4.3">Assignment</a></h3>
+
+<p>
+Lua allows multiple assignments.
+Therefore, the syntax for assignment
+defines a list of variables on the left side
+and a list of expressions on the right side.
+The elements in both lists are separated by commas:
+
+<pre>
+	stat ::= varlist `<b>=</b>&acute; explist
+	varlist ::= var {`<b>,</b>&acute; var}
+	explist ::= exp {`<b>,</b>&acute; exp}
+</pre><p>
+Expressions are discussed in <a href="#2.5">&sect;2.5</a>.
+
+
+<p>
+Before the assignment,
+the list of values is <em>adjusted</em> to the length of
+the list of variables.
+If there are more values than needed,
+the excess values are thrown away.
+If there are fewer values than needed,
+the list is extended with as many  <b>nil</b>'s as needed.
+If the list of expressions ends with a function call,
+then all values returned by that call enter the list of values,
+before the adjustment
+(except when the call is enclosed in parentheses; see <a href="#2.5">&sect;2.5</a>).
+
+
+<p>
+The assignment statement first evaluates all its expressions
+and only then are the assignments performed.
+Thus the code
+
+<pre>
+     i = 3
+     i, a[i] = i+1, 20
+</pre><p>
+sets <code>a[3]</code> to 20, without affecting <code>a[4]</code>
+because the <code>i</code> in <code>a[i]</code> is evaluated (to 3)
+before it is assigned&nbsp;4.
+Similarly, the line
+
+<pre>
+     x, y = y, x
+</pre><p>
+exchanges the values of <code>x</code> and <code>y</code>,
+and
+
+<pre>
+     x, y, z = y, z, x
+</pre><p>
+cyclically permutes the values of <code>x</code>, <code>y</code>, and <code>z</code>.
+
+
+<p>
+The meaning of assignments to global variables
+and table fields can be changed via metatables.
+An assignment to an indexed variable <code>t[i] = val</code> is equivalent to
+<code>settable_event(t,i,val)</code>.
+(See <a href="#2.8">&sect;2.8</a> for a complete description of the
+<code>settable_event</code> function.
+This function is not defined or callable in Lua.
+We use it here only for explanatory purposes.)
+
+
+<p>
+An assignment to a global variable <code>x = val</code>
+is equivalent to the assignment
+<code>_env.x = val</code>,
+which in turn is equivalent to
+
+<pre>
+     settable_event(_env, "x", val)
+</pre><p>
+where <code>_env</code> is the environment of the running function.
+(The <code>_env</code> variable is not defined in Lua.
+We use it here only for explanatory purposes.)
+
+
+
+
+
+<h3>2.4.4 - <a name="2.4.4">Control Structures</a></h3><p>
+The control structures
+<b>if</b>, <b>while</b>, and <b>repeat</b> have the usual meaning and
+familiar syntax:
+
+
+
+
+<pre>
+	stat ::= <b>while</b> exp <b>do</b> block <b>end</b>
+	stat ::= <b>repeat</b> block <b>until</b> exp
+	stat ::= <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b>
+</pre><p>
+Lua also has a <b>for</b> statement, in two flavors (see <a href="#2.4.5">&sect;2.4.5</a>).
+
+
+<p>
+The condition expression of a
+control structure can return any value.
+Both <b>false</b> and <b>nil</b> are considered false.
+All values different from <b>nil</b> and <b>false</b> are considered true
+(in particular, the number 0 and the empty string are also true).
+
+
+<p>
+In the <b>repeat</b>&ndash;<b>until</b> loop,
+the inner block does not end at the <b>until</b> keyword,
+but only after the condition.
+So, the condition can refer to local variables
+declared inside the loop block.
+
+
+<p>
+The <b>return</b> statement is used to return values
+from a function or a chunk (which is just a function).
+
+Functions and chunks can return more than one value,
+and so the syntax for the <b>return</b> statement is
+
+<pre>
+	stat ::= <b>return</b> [explist]
+</pre>
+
+<p>
+The <b>break</b> statement is used to terminate the execution of a
+<b>while</b>, <b>repeat</b>, or <b>for</b> loop,
+skipping to the next statement after the loop:
+
+
+<pre>
+	stat ::= <b>break</b>
+</pre><p>
+A <b>break</b> ends the innermost enclosing loop.
+
+
+<p>
+The <b>return</b> and <b>break</b>
+statements can only be written as the <em>last</em> statement of a block.
+If it is really necessary to <b>return</b> or <b>break</b> in the
+middle of a block,
+then an explicit inner block can be used,
+as in the idioms
+<code>do return end</code> and <code>do break end</code>,
+because now <b>return</b> and <b>break</b> are the last statements in
+their (inner) blocks.
+
+
+
+
+
+<h3>2.4.5 - <a name="2.4.5">For Statement</a></h3>
+
+<p>
+
+The <b>for</b> statement has two forms:
+one numeric and one generic.
+
+
+<p>
+The numeric <b>for</b> loop repeats a block of code while a
+control variable runs through an arithmetic progression.
+It has the following syntax:
+
+<pre>
+	stat ::= <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b>
+</pre><p>
+The <em>block</em> is repeated for <em>name</em> starting at the value of
+the first <em>exp</em>, until it passes the second <em>exp</em> by steps of the
+third <em>exp</em>.
+More precisely, a <b>for</b> statement like
+
+<pre>
+     for v = <em>e1</em>, <em>e2</em>, <em>e3</em> do <em>block</em> end
+</pre><p>
+is equivalent to the code:
+
+<pre>
+     do
+       local <em>var</em>, <em>limit</em>, <em>step</em> = tonumber(<em>e1</em>), tonumber(<em>e2</em>), tonumber(<em>e3</em>)
+       if not (<em>var</em> and <em>limit</em> and <em>step</em>) then error() end
+       while (<em>step</em> &gt; 0 and <em>var</em> &lt;= <em>limit</em>) or (<em>step</em> &lt;= 0 and <em>var</em> &gt;= <em>limit</em>) do
+         local v = <em>var</em>
+         <em>block</em>
+         <em>var</em> = <em>var</em> + <em>step</em>
+       end
+     end
+</pre><p>
+Note the following:
+
+<ul>
+
+<li>
+All three control expressions are evaluated only once,
+before the loop starts.
+They must all result in numbers.
+</li>
+
+<li>
+<code><em>var</em></code>, <code><em>limit</em></code>, and <code><em>step</em></code> are invisible variables.
+The names shown here are for explanatory purposes only.
+</li>
+
+<li>
+If the third expression (the step) is absent,
+then a step of&nbsp;1 is used.
+</li>
+
+<li>
+You can use <b>break</b> to exit a <b>for</b> loop.
+</li>
+
+<li>
+The loop variable <code>v</code> is local to the loop;
+you cannot use its value after the <b>for</b> ends or is broken.
+If you need this value,
+assign it to another variable before breaking or exiting the loop.
+</li>
+
+</ul>
+
+<p>
+The generic <b>for</b> statement works over functions,
+called <em>iterators</em>.
+On each iteration, the iterator function is called to produce a new value,
+stopping when this new value is <b>nil</b>.
+The generic <b>for</b> loop has the following syntax:
+
+<pre>
+	stat ::= <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b>
+	namelist ::= Name {`<b>,</b>&acute; Name}
+</pre><p>
+A <b>for</b> statement like
+
+<pre>
+     for <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> in <em>explist</em> do <em>block</em> end
+</pre><p>
+is equivalent to the code:
+
+<pre>
+     do
+       local <em>f</em>, <em>s</em>, <em>var</em> = <em>explist</em>
+       while true do
+         local <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> = <em>f</em>(<em>s</em>, <em>var</em>)
+         <em>var</em> = <em>var_1</em>
+         if <em>var</em> == nil then break end
+         <em>block</em>
+       end
+     end
+</pre><p>
+Note the following:
+
+<ul>
+
+<li>
+<code><em>explist</em></code> is evaluated only once.
+Its results are an <em>iterator</em> function,
+a <em>state</em>,
+and an initial value for the first <em>iterator variable</em>.
+</li>
+
+<li>
+<code><em>f</em></code>, <code><em>s</em></code>, and <code><em>var</em></code> are invisible variables.
+The names are here for explanatory purposes only.
+</li>
+
+<li>
+You can use <b>break</b> to exit a <b>for</b> loop.
+</li>
+
+<li>
+The loop variables <code><em>var_i</em></code> are local to the loop;
+you cannot use their values after the <b>for</b> ends.
+If you need these values,
+then assign them to other variables before breaking or exiting the loop.
+</li>
+
+</ul>
+
+
+
+
+<h3>2.4.6 - <a name="2.4.6">Function Calls as Statements</a></h3><p>
+To allow possible side-effects,
+function calls can be executed as statements:
+
+<pre>
+	stat ::= functioncall
+</pre><p>
+In this case, all returned values are thrown away.
+Function calls are explained in <a href="#2.5.8">&sect;2.5.8</a>.
+
+
+
+
+
+<h3>2.4.7 - <a name="2.4.7">Local Declarations</a></h3><p>
+Local variables can be declared anywhere inside a block.
+The declaration can include an initial assignment:
+
+<pre>
+	stat ::= <b>local</b> namelist [`<b>=</b>&acute; explist]
+</pre><p>
+If present, an initial assignment has the same semantics
+of a multiple assignment (see <a href="#2.4.3">&sect;2.4.3</a>).
+Otherwise, all variables are initialized with <b>nil</b>.
+
+
+<p>
+A chunk is also a block (see <a href="#2.4.1">&sect;2.4.1</a>),
+and so local variables can be declared in a chunk outside any explicit block.
+The scope of such local variables extends until the end of the chunk.
+
+
+<p>
+The visibility rules for local variables are explained in <a href="#2.6">&sect;2.6</a>.
+
+
+
+
+
+
+
+<h2>2.5 - <a name="2.5">Expressions</a></h2>
+
+<p>
+The basic expressions in Lua are the following:
+
+<pre>
+	exp ::= prefixexp
+	exp ::= <b>nil</b> | <b>false</b> | <b>true</b>
+	exp ::= Number
+	exp ::= String
+	exp ::= function
+	exp ::= tableconstructor
+	exp ::= `<b>...</b>&acute;
+	exp ::= exp binop exp
+	exp ::= unop exp
+	prefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;
+</pre>
+
+<p>
+Numbers and literal strings are explained in <a href="#2.1">&sect;2.1</a>;
+variables are explained in <a href="#2.3">&sect;2.3</a>;
+function definitions are explained in <a href="#2.5.9">&sect;2.5.9</a>;
+function calls are explained in <a href="#2.5.8">&sect;2.5.8</a>;
+table constructors are explained in <a href="#2.5.7">&sect;2.5.7</a>.
+Vararg expressions,
+denoted by three dots ('<code>...</code>'), can only be used when
+directly inside a vararg function;
+they are explained in <a href="#2.5.9">&sect;2.5.9</a>.
+
+
+<p>
+Binary operators comprise arithmetic operators (see <a href="#2.5.1">&sect;2.5.1</a>),
+relational operators (see <a href="#2.5.2">&sect;2.5.2</a>), logical operators (see <a href="#2.5.3">&sect;2.5.3</a>),
+and the concatenation operator (see <a href="#2.5.4">&sect;2.5.4</a>).
+Unary operators comprise the unary minus (see <a href="#2.5.1">&sect;2.5.1</a>),
+the unary <b>not</b> (see <a href="#2.5.3">&sect;2.5.3</a>),
+and the unary <em>length operator</em> (see <a href="#2.5.5">&sect;2.5.5</a>).
+
+
+<p>
+Both function calls and vararg expressions can result in multiple values.
+If an expression is used as a statement
+(only possible for function calls (see <a href="#2.4.6">&sect;2.4.6</a>)),
+then its return list is adjusted to zero elements,
+thus discarding all returned values.
+If an expression is used as the last (or the only) element
+of a list of expressions,
+then no adjustment is made
+(unless the call is enclosed in parentheses).
+In all other contexts,
+Lua adjusts the result list to one element,
+discarding all values except the first one.
+
+
+<p>
+Here are some examples:
+
+<pre>
+     f()                -- adjusted to 0 results
+     g(f(), x)          -- f() is adjusted to 1 result
+     g(x, f())          -- g gets x plus all results from f()
+     a,b,c = f(), x     -- f() is adjusted to 1 result (c gets nil)
+     a,b = ...          -- a gets the first vararg parameter, b gets
+                        -- the second (both a and b can get nil if there
+                        -- is no corresponding vararg parameter)
+     
+     a,b,c = x, f()     -- f() is adjusted to 2 results
+     a,b,c = f()        -- f() is adjusted to 3 results
+     return f()         -- returns all results from f()
+     return ...         -- returns all received vararg parameters
+     return x,y,f()     -- returns x, y, and all results from f()
+     {f()}              -- creates a list with all results from f()
+     {...}              -- creates a list with all vararg parameters
+     {f(), nil}         -- f() is adjusted to 1 result
+</pre>
+
+<p>
+Any expression enclosed in parentheses always results in only one value.
+Thus,
+<code>(f(x,y,z))</code> is always a single value,
+even if <code>f</code> returns several values.
+(The value of <code>(f(x,y,z))</code> is the first value returned by <code>f</code>
+or <b>nil</b> if <code>f</code> does not return any values.)
+
+
+
+<h3>2.5.1 - <a name="2.5.1">Arithmetic Operators</a></h3><p>
+Lua supports the usual arithmetic operators:
+the binary <code>+</code> (addition),
+<code>-</code> (subtraction), <code>*</code> (multiplication),
+<code>/</code> (division), <code>%</code> (modulo), and <code>^</code> (exponentiation);
+and unary <code>-</code> (negation).
+If the operands are numbers, or strings that can be converted to
+numbers (see <a href="#2.2.1">&sect;2.2.1</a>),
+then all operations have the usual meaning.
+Exponentiation works for any exponent.
+For instance, <code>x^(-0.5)</code> computes the inverse of the square root of <code>x</code>.
+Modulo is defined as
+
+<pre>
+     a % b == a - math.floor(a/b)*b
+</pre><p>
+That is, it is the remainder of a division that rounds
+the quotient towards minus infinity.
+
+
+
+
+
+<h3>2.5.2 - <a name="2.5.2">Relational Operators</a></h3><p>
+The relational operators in Lua are
+
+<pre>
+     ==    ~=    &lt;     &gt;     &lt;=    &gt;=
+</pre><p>
+These operators always result in <b>false</b> or <b>true</b>.
+
+
+<p>
+Equality (<code>==</code>) first compares the type of its operands.
+If the types are different, then the result is <b>false</b>.
+Otherwise, the values of the operands are compared.
+Numbers and strings are compared in the usual way.
+Objects (tables, userdata, threads, and functions)
+are compared by <em>reference</em>:
+two objects are considered equal only if they are the <em>same</em> object.
+Every time you create a new object
+(a table, userdata, thread, or function),
+this new object is different from any previously existing object.
+
+
+<p>
+You can change the way that Lua compares tables and userdata 
+by using the "eq" metamethod (see <a href="#2.8">&sect;2.8</a>).
+
+
+<p>
+The conversion rules of <a href="#2.2.1">&sect;2.2.1</a>
+<em>do not</em> apply to equality comparisons.
+Thus, <code>"0"==0</code> evaluates to <b>false</b>,
+and <code>t[0]</code> and <code>t["0"]</code> denote different
+entries in a table.
+
+
+<p>
+The operator <code>~=</code> is exactly the negation of equality (<code>==</code>).
+
+
+<p>
+The order operators work as follows.
+If both arguments are numbers, then they are compared as such.
+Otherwise, if both arguments are strings,
+then their values are compared according to the current locale.
+Otherwise, Lua tries to call the "lt" or the "le"
+metamethod (see <a href="#2.8">&sect;2.8</a>).
+A comparison <code>a &gt; b</code> is translated to <code>b &lt; a</code>
+and <code>a &gt;= b</code> is translated to <code>b &lt;= a</code>.
+
+
+
+
+
+<h3>2.5.3 - <a name="2.5.3">Logical Operators</a></h3><p>
+The logical operators in Lua are
+<b>and</b>, <b>or</b>, and <b>not</b>.
+Like the control structures (see <a href="#2.4.4">&sect;2.4.4</a>),
+all logical operators consider both <b>false</b> and <b>nil</b> as false
+and anything else as true.
+
+
+<p>
+The negation operator <b>not</b> always returns <b>false</b> or <b>true</b>.
+The conjunction operator <b>and</b> returns its first argument
+if this value is <b>false</b> or <b>nil</b>;
+otherwise, <b>and</b> returns its second argument.
+The disjunction operator <b>or</b> returns its first argument
+if this value is different from <b>nil</b> and <b>false</b>;
+otherwise, <b>or</b> returns its second argument.
+Both <b>and</b> and <b>or</b> use short-cut evaluation;
+that is,
+the second operand is evaluated only if necessary.
+Here are some examples:
+
+<pre>
+     10 or 20            --&gt; 10
+     10 or error()       --&gt; 10
+     nil or "a"          --&gt; "a"
+     nil and 10          --&gt; nil
+     false and error()   --&gt; false
+     false and nil       --&gt; false
+     false or nil        --&gt; nil
+     10 and 20           --&gt; 20
+</pre><p>
+(In this manual,
+<code>--&gt;</code> indicates the result of the preceding expression.)
+
+
+
+
+
+<h3>2.5.4 - <a name="2.5.4">Concatenation</a></h3><p>
+The string concatenation operator in Lua is
+denoted by two dots ('<code>..</code>').
+If both operands are strings or numbers, then they are converted to
+strings according to the rules mentioned in <a href="#2.2.1">&sect;2.2.1</a>.
+Otherwise, the "concat" metamethod is called (see <a href="#2.8">&sect;2.8</a>).
+
+
+
+
+
+<h3>2.5.5 - <a name="2.5.5">The Length Operator</a></h3>
+
+<p>
+The length operator is denoted by the unary operator <code>#</code>.
+The length of a string is its number of bytes
+(that is, the usual meaning of string length when each
+character is one byte).
+
+
+<p>
+The length of a table <code>t</code> is defined to be any
+integer index <code>n</code>
+such that <code>t[n]</code> is not <b>nil</b> and <code>t[n+1]</code> is <b>nil</b>;
+moreover, if <code>t[1]</code> is <b>nil</b>, <code>n</code> can be zero.
+For a regular array, with non-nil values from 1 to a given <code>n</code>,
+its length is exactly that <code>n</code>,
+the index of its last value.
+If the array has "holes"
+(that is, <b>nil</b> values between other non-nil values),
+then <code>#t</code> can be any of the indices that
+directly precedes a <b>nil</b> value
+(that is, it may consider any such <b>nil</b> value as the end of
+the array). 
+
+
+
+
+
+<h3>2.5.6 - <a name="2.5.6">Precedence</a></h3><p>
+Operator precedence in Lua follows the table below,
+from lower to higher priority:
+
+<pre>
+     or
+     and
+     &lt;     &gt;     &lt;=    &gt;=    ~=    ==
+     ..
+     +     -
+     *     /     %
+     not   #     - (unary)
+     ^
+</pre><p>
+As usual,
+you can use parentheses to change the precedences of an expression.
+The concatenation ('<code>..</code>') and exponentiation ('<code>^</code>')
+operators are right associative.
+All other binary operators are left associative.
+
+
+
+
+
+<h3>2.5.7 - <a name="2.5.7">Table Constructors</a></h3><p>
+Table constructors are expressions that create tables.
+Every time a constructor is evaluated, a new table is created.
+A constructor can be used to create an empty table
+or to create a table and initialize some of its fields.
+The general syntax for constructors is
+
+<pre>
+	tableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;
+	fieldlist ::= field {fieldsep field} [fieldsep]
+	field ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp
+	fieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;
+</pre>
+
+<p>
+Each field of the form <code>[exp1] = exp2</code> adds to the new table an entry
+with key <code>exp1</code> and value <code>exp2</code>.
+A field of the form <code>name = exp</code> is equivalent to
+<code>["name"] = exp</code>.
+Finally, fields of the form <code>exp</code> are equivalent to
+<code>[i] = exp</code>, where <code>i</code> are consecutive numerical integers,
+starting with 1.
+Fields in the other formats do not affect this counting.
+For example,
+
+<pre>
+     a = { [f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45 }
+</pre><p>
+is equivalent to
+
+<pre>
+     do
+       local t = {}
+       t[f(1)] = g
+       t[1] = "x"         -- 1st exp
+       t[2] = "y"         -- 2nd exp
+       t.x = 1            -- t["x"] = 1
+       t[3] = f(x)        -- 3rd exp
+       t[30] = 23
+       t[4] = 45          -- 4th exp
+       a = t
+     end
+</pre>
+
+<p>
+If the last field in the list has the form <code>exp</code>
+and the expression is a function call or a vararg expression,
+then all values returned by this expression enter the list consecutively
+(see <a href="#2.5.8">&sect;2.5.8</a>).
+To avoid this,
+enclose the function call or the vararg expression
+in parentheses (see <a href="#2.5">&sect;2.5</a>).
+
+
+<p>
+The field list can have an optional trailing separator,
+as a convenience for machine-generated code.
+
+
+
+
+
+<h3>2.5.8 - <a name="2.5.8">Function Calls</a></h3><p>
+A function call in Lua has the following syntax:
+
+<pre>
+	functioncall ::= prefixexp args
+</pre><p>
+In a function call,
+first prefixexp and args are evaluated.
+If the value of prefixexp has type <em>function</em>,
+then this function is called
+with the given arguments.
+Otherwise, the prefixexp "call" metamethod is called,
+having as first parameter the value of prefixexp,
+followed by the original call arguments
+(see <a href="#2.8">&sect;2.8</a>).
+
+
+<p>
+The form
+
+<pre>
+	functioncall ::= prefixexp `<b>:</b>&acute; Name args
+</pre><p>
+can be used to call "methods".
+A call <code>v:name(<em>args</em>)</code>
+is syntactic sugar for <code>v.name(v,<em>args</em>)</code>,
+except that <code>v</code> is evaluated only once.
+
+
+<p>
+Arguments have the following syntax:
+
+<pre>
+	args ::= `<b>(</b>&acute; [explist] `<b>)</b>&acute;
+	args ::= tableconstructor
+	args ::= String
+</pre><p>
+All argument expressions are evaluated before the call.
+A call of the form <code>f{<em>fields</em>}</code> is
+syntactic sugar for <code>f({<em>fields</em>})</code>;
+that is, the argument list is a single new table.
+A call of the form <code>f'<em>string</em>'</code>
+(or <code>f"<em>string</em>"</code> or <code>f[[<em>string</em>]]</code>)
+is syntactic sugar for <code>f('<em>string</em>')</code>;
+that is, the argument list is a single literal string.
+
+
+<p>
+As an exception to the free-format syntax of Lua,
+you cannot put a line break before the '<code>(</code>' in a function call.
+This restriction avoids some ambiguities in the language.
+If you write
+
+<pre>
+     a = f
+     (g).x(a)
+</pre><p>
+Lua would see that as a single statement, <code>a = f(g).x(a)</code>.
+So, if you want two statements, you must add a semi-colon between them.
+If you actually want to call <code>f</code>,
+you must remove the line break before <code>(g)</code>.
+
+
+<p>
+A call of the form <code>return</code> <em>functioncall</em> is called
+a <em>tail call</em>.
+Lua implements <em>proper tail calls</em>
+(or <em>proper tail recursion</em>):
+in a tail call,
+the called function reuses the stack entry of the calling function.
+Therefore, there is no limit on the number of nested tail calls that
+a program can execute.
+However, a tail call erases any debug information about the
+calling function.
+Note that a tail call only happens with a particular syntax,
+where the <b>return</b> has one single function call as argument;
+this syntax makes the calling function return exactly
+the returns of the called function.
+So, none of the following examples are tail calls:
+
+<pre>
+     return (f(x))        -- results adjusted to 1
+     return 2 * f(x)
+     return x, f(x)       -- additional results
+     f(x); return         -- results discarded
+     return x or f(x)     -- results adjusted to 1
+</pre>
+
+
+
+
+<h3>2.5.9 - <a name="2.5.9">Function Definitions</a></h3>
+
+<p>
+The syntax for function definition is
+
+<pre>
+	function ::= <b>function</b> funcbody
+	funcbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>
+</pre>
+
+<p>
+The following syntactic sugar simplifies function definitions:
+
+<pre>
+	stat ::= <b>function</b> funcname funcbody
+	stat ::= <b>local</b> <b>function</b> Name funcbody
+	funcname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]
+</pre><p>
+The statement
+
+<pre>
+     function f () <em>body</em> end
+</pre><p>
+translates to
+
+<pre>
+     f = function () <em>body</em> end
+</pre><p>
+The statement
+
+<pre>
+     function t.a.b.c.f () <em>body</em> end
+</pre><p>
+translates to
+
+<pre>
+     t.a.b.c.f = function () <em>body</em> end
+</pre><p>
+The statement
+
+<pre>
+     local function f () <em>body</em> end
+</pre><p>
+translates to
+
+<pre>
+     local f; f = function () <em>body</em> end
+</pre><p>
+<em>not</em> to
+
+<pre>
+     local f = function () <em>body</em> end
+</pre><p>
+(This only makes a difference when the body of the function
+contains references to <code>f</code>.)
+
+
+<p>
+A function definition is an executable expression,
+whose value has type <em>function</em>.
+When Lua pre-compiles a chunk,
+all its function bodies are pre-compiled too.
+Then, whenever Lua executes the function definition,
+the function is <em>instantiated</em> (or <em>closed</em>).
+This function instance (or <em>closure</em>)
+is the final value of the expression.
+Different instances of the same function
+can refer to different  external local variables
+and can have different environment tables.
+
+
+<p>
+Parameters act as local variables that are
+initialized with the argument values:
+
+<pre>
+	parlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;
+</pre><p>
+When a function is called,
+the list of arguments is adjusted to
+the length of the list of parameters,
+unless the function is a variadic or <em>vararg function</em>,
+which is
+indicated by three dots ('<code>...</code>') at the end of its parameter list.
+A vararg function does not adjust its argument list;
+instead, it collects all extra arguments and supplies them
+to the function through a <em>vararg expression</em>,
+which is also written as three dots.
+The value of this expression is a list of all actual extra arguments,
+similar to a function with multiple results.
+If a vararg expression is used inside another expression
+or in the middle of a list of expressions,
+then its return list is adjusted to one element.
+If the expression is used as the last element of a list of expressions,
+then no adjustment is made
+(unless that last expression is enclosed in parentheses).
+
+
+<p>
+As an example, consider the following definitions:
+
+<pre>
+     function f(a, b) end
+     function g(a, b, ...) end
+     function r() return 1,2,3 end
+</pre><p>
+Then, we have the following mapping from arguments to parameters and
+to the vararg expression:
+
+<pre>
+     CALL            PARAMETERS
+     
+     f(3)             a=3, b=nil
+     f(3, 4)          a=3, b=4
+     f(3, 4, 5)       a=3, b=4
+     f(r(), 10)       a=1, b=10
+     f(r())           a=1, b=2
+     
+     g(3)             a=3, b=nil, ... --&gt;  (nothing)
+     g(3, 4)          a=3, b=4,   ... --&gt;  (nothing)
+     g(3, 4, 5, 8)    a=3, b=4,   ... --&gt;  5  8
+     g(5, r())        a=5, b=1,   ... --&gt;  2  3
+</pre>
+
+<p>
+Results are returned using the <b>return</b> statement (see <a href="#2.4.4">&sect;2.4.4</a>).
+If control reaches the end of a function
+without encountering a <b>return</b> statement,
+then the function returns with no results.
+
+
+<p>
+The <em>colon</em> syntax
+is used for defining <em>methods</em>,
+that is, functions that have an implicit extra parameter <code>self</code>.
+Thus, the statement
+
+<pre>
+     function t.a.b.c:f (<em>params</em>) <em>body</em> end
+</pre><p>
+is syntactic sugar for
+
+<pre>
+     t.a.b.c.f = function (self, <em>params</em>) <em>body</em> end
+</pre>
+
+
+
+
+
+
+<h2>2.6 - <a name="2.6">Visibility Rules</a></h2>
+
+<p>
+
+Lua is a lexically scoped language.
+The scope of variables begins at the first statement <em>after</em>
+their declaration and lasts until the end of the innermost block that
+includes the declaration.
+Consider the following example:
+
+<pre>
+     x = 10                -- global variable
+     do                    -- new block
+       local x = x         -- new 'x', with value 10
+       print(x)            --&gt; 10
+       x = x+1
+       do                  -- another block
+         local x = x+1     -- another 'x'
+         print(x)          --&gt; 12
+       end
+       print(x)            --&gt; 11
+     end
+     print(x)              --&gt; 10  (the global one)
+</pre>
+
+<p>
+Notice that, in a declaration like <code>local x = x</code>,
+the new <code>x</code> being declared is not in scope yet,
+and so the second <code>x</code> refers to the outside variable.
+
+
+<p>
+Because of the lexical scoping rules,
+local variables can be freely accessed by functions
+defined inside their scope.
+A local variable used by an inner function is called
+an <em>upvalue</em>, or <em>external local variable</em>,
+inside the inner function.
+
+
+<p>
+Notice that each execution of a <b>local</b> statement
+defines new local variables.
+Consider the following example:
+
+<pre>
+     a = {}
+     local x = 20
+     for i=1,10 do
+       local y = 0
+       a[i] = function () y=y+1; return x+y end
+     end
+</pre><p>
+The loop creates ten closures
+(that is, ten instances of the anonymous function).
+Each of these closures uses a different <code>y</code> variable,
+while all of them share the same <code>x</code>.
+
+
+
+
+
+<h2>2.7 - <a name="2.7">Error Handling</a></h2>
+
+<p>
+Because Lua is an embedded extension language,
+all Lua actions start from C&nbsp;code in the host program
+calling a function from the Lua library (see <a href="#lua_pcall"><code>lua_pcall</code></a>).
+Whenever an error occurs during Lua compilation or execution,
+control returns to C,
+which can take appropriate measures
+(such as printing an error message).
+
+
+<p>
+Lua code can explicitly generate an error by calling the
+<a href="#pdf-error"><code>error</code></a> function.
+If you need to catch errors in Lua,
+you can use the <a href="#pdf-pcall"><code>pcall</code></a> function.
+
+
+
+
+
+<h2>2.8 - <a name="2.8">Metatables</a></h2>
+
+<p>
+Every value in Lua can have a <em>metatable</em>.
+This <em>metatable</em> is an ordinary Lua table
+that defines the behavior of the original value
+under certain special operations.
+You can change several aspects of the behavior
+of operations over a value by setting specific fields in its metatable.
+For instance, when a non-numeric value is the operand of an addition,
+Lua checks for a function in the field <code>"__add"</code> in its metatable.
+If it finds one,
+Lua calls this function to perform the addition.
+
+
+<p>
+We call the keys in a metatable <em>events</em>
+and the values <em>metamethods</em>.
+In the previous example, the event is <code>"add"</code> 
+and the metamethod is the function that performs the addition.
+
+
+<p>
+You can query the metatable of any value
+through the <a href="#pdf-getmetatable"><code>getmetatable</code></a> function.
+
+
+<p>
+You can replace the metatable of tables
+through the <a href="#pdf-setmetatable"><code>setmetatable</code></a>
+function.
+You cannot change the metatable of other types from Lua
+(except by using the debug library);
+you must use the C&nbsp;API for that.
+
+
+<p>
+Tables and full userdata have individual metatables
+(although multiple tables and userdata can share their metatables).
+Values of all other types share one single metatable per type;
+that is, there is one single metatable for all numbers,
+one for all strings, etc.
+
+
+<p>
+A metatable controls how an object behaves in arithmetic operations,
+order comparisons, concatenation, length operation, and indexing.
+A metatable also can define a function to be called when a userdata
+is garbage collected.
+For each of these operations Lua associates a specific key
+called an <em>event</em>.
+When Lua performs one of these operations over a value,
+it checks whether this value has a metatable with the corresponding event.
+If so, the value associated with that key (the metamethod)
+controls how Lua will perform the operation.
+
+
+<p>
+Metatables control the operations listed next.
+Each operation is identified by its corresponding name.
+The key for each operation is a string with its name prefixed by
+two underscores, '<code>__</code>';
+for instance, the key for operation "add" is the
+string <code>"__add"</code>.
+The semantics of these operations is better explained by a Lua function
+describing how the interpreter executes the operation.
+
+
+<p>
+The code shown here in Lua is only illustrative;
+the real behavior is hard coded in the interpreter
+and it is much more efficient than this simulation.
+All functions used in these descriptions
+(<a href="#pdf-rawget"><code>rawget</code></a>, <a href="#pdf-tonumber"><code>tonumber</code></a>, etc.)
+are described in <a href="#5.1">&sect;5.1</a>.
+In particular, to retrieve the metamethod of a given object,
+we use the expression
+
+<pre>
+     metatable(obj)[event]
+</pre><p>
+This should be read as
+
+<pre>
+     rawget(getmetatable(obj) or {}, event)
+</pre><p>
+
+That is, the access to a metamethod does not invoke other metamethods,
+and the access to objects with no metatables does not fail
+(it simply results in <b>nil</b>).
+
+
+
+<ul>
+
+<li><b>"add":</b>
+the <code>+</code> operation.
+
+
+
+<p>
+The function <code>getbinhandler</code> below defines how Lua chooses a handler
+for a binary operation.
+First, Lua tries the first operand.
+If its type does not define a handler for the operation,
+then Lua tries the second operand.
+
+<pre>
+     function getbinhandler (op1, op2, event)
+       return metatable(op1)[event] or metatable(op2)[event]
+     end
+</pre><p>
+By using this function,
+the behavior of the <code>op1 + op2</code> is
+
+<pre>
+     function add_event (op1, op2)
+       local o1, o2 = tonumber(op1), tonumber(op2)
+       if o1 and o2 then  -- both operands are numeric?
+         return o1 + o2   -- '+' here is the primitive 'add'
+       else  -- at least one of the operands is not numeric
+         local h = getbinhandler(op1, op2, "__add")
+         if h then
+           -- call the handler with both operands
+           return (h(op1, op2))
+         else  -- no handler available: default behavior
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+</li>
+
+<li><b>"sub":</b>
+the <code>-</code> operation.
+
+Behavior similar to the "add" operation.
+</li>
+
+<li><b>"mul":</b>
+the <code>*</code> operation.
+
+Behavior similar to the "add" operation.
+</li>
+
+<li><b>"div":</b>
+the <code>/</code> operation.
+
+Behavior similar to the "add" operation.
+</li>
+
+<li><b>"mod":</b>
+the <code>%</code> operation.
+
+Behavior similar to the "add" operation,
+with the operation
+<code>o1 - floor(o1/o2)*o2</code> as the primitive operation.
+</li>
+
+<li><b>"pow":</b>
+the <code>^</code> (exponentiation) operation.
+
+Behavior similar to the "add" operation,
+with the function <code>pow</code> (from the C&nbsp;math library)
+as the primitive operation.
+</li>
+
+<li><b>"unm":</b>
+the unary <code>-</code> operation.
+
+
+<pre>
+     function unm_event (op)
+       local o = tonumber(op)
+       if o then  -- operand is numeric?
+         return -o  -- '-' here is the primitive 'unm'
+       else  -- the operand is not numeric.
+         -- Try to get a handler from the operand
+         local h = metatable(op).__unm
+         if h then
+           -- call the handler with the operand
+           return (h(op))
+         else  -- no handler available: default behavior
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+</li>
+
+<li><b>"concat":</b>
+the <code>..</code> (concatenation) operation.
+
+
+<pre>
+     function concat_event (op1, op2)
+       if (type(op1) == "string" or type(op1) == "number") and
+          (type(op2) == "string" or type(op2) == "number") then
+         return op1 .. op2  -- primitive string concatenation
+       else
+         local h = getbinhandler(op1, op2, "__concat")
+         if h then
+           return (h(op1, op2))
+         else
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+</li>
+
+<li><b>"len":</b>
+the <code>#</code> operation.
+
+
+<pre>
+     function len_event (op)
+       if type(op) == "string" then
+         return strlen(op)         -- primitive string length
+       elseif type(op) == "table" then
+         return #op                -- primitive table length
+       else
+         local h = metatable(op).__len
+         if h then
+           -- call the handler with the operand
+           return (h(op))
+         else  -- no handler available: default behavior
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+See <a href="#2.5.5">&sect;2.5.5</a> for a description of the length of a table.
+</li>
+
+<li><b>"eq":</b>
+the <code>==</code> operation.
+
+The function <code>getcomphandler</code> defines how Lua chooses a metamethod
+for comparison operators.
+A metamethod only is selected when both objects
+being compared have the same type
+and the same metamethod for the selected operation.
+
+<pre>
+     function getcomphandler (op1, op2, event)
+       if type(op1) ~= type(op2) then return nil end
+       local mm1 = metatable(op1)[event]
+       local mm2 = metatable(op2)[event]
+       if mm1 == mm2 then return mm1 else return nil end
+     end
+</pre><p>
+The "eq" event is defined as follows:
+
+<pre>
+     function eq_event (op1, op2)
+       if type(op1) ~= type(op2) then  -- different types?
+         return false   -- different objects
+       end
+       if op1 == op2 then   -- primitive equal?
+         return true   -- objects are equal
+       end
+       -- try metamethod
+       local h = getcomphandler(op1, op2, "__eq")
+       if h then
+         return (h(op1, op2))
+       else
+         return false
+       end
+     end
+</pre><p>
+<code>a ~= b</code> is equivalent to <code>not (a == b)</code>.
+</li>
+
+<li><b>"lt":</b>
+the <code>&lt;</code> operation.
+
+
+<pre>
+     function lt_event (op1, op2)
+       if type(op1) == "number" and type(op2) == "number" then
+         return op1 &lt; op2   -- numeric comparison
+       elseif type(op1) == "string" and type(op2) == "string" then
+         return op1 &lt; op2   -- lexicographic comparison
+       else
+         local h = getcomphandler(op1, op2, "__lt")
+         if h then
+           return (h(op1, op2))
+         else
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+<code>a &gt; b</code> is equivalent to <code>b &lt; a</code>.
+</li>
+
+<li><b>"le":</b>
+the <code>&lt;=</code> operation.
+
+
+<pre>
+     function le_event (op1, op2)
+       if type(op1) == "number" and type(op2) == "number" then
+         return op1 &lt;= op2   -- numeric comparison
+       elseif type(op1) == "string" and type(op2) == "string" then
+         return op1 &lt;= op2   -- lexicographic comparison
+       else
+         local h = getcomphandler(op1, op2, "__le")
+         if h then
+           return (h(op1, op2))
+         else
+           h = getcomphandler(op1, op2, "__lt")
+           if h then
+             return not h(op2, op1)
+           else
+             error(&middot;&middot;&middot;)
+           end
+         end
+       end
+     end
+</pre><p>
+<code>a &gt;= b</code> is equivalent to <code>b &lt;= a</code>.
+Note that, in the absence of a "le" metamethod,
+Lua tries the "lt", assuming that <code>a &lt;= b</code> is
+equivalent to <code>not (b &lt; a)</code>.
+</li>
+
+<li><b>"index":</b>
+The indexing access <code>table[key]</code>.
+
+
+<pre>
+     function gettable_event (table, key)
+       local h
+       if type(table) == "table" then
+         local v = rawget(table, key)
+         if v ~= nil then return v end
+         h = metatable(table).__index
+         if h == nil then return nil end
+       else
+         h = metatable(table).__index
+         if h == nil then
+           error(&middot;&middot;&middot;)
+         end
+       end
+       if type(h) == "function" then
+         return (h(table, key))     -- call the handler
+       else return h[key]           -- or repeat operation on it
+       end
+     end
+</pre><p>
+</li>
+
+<li><b>"newindex":</b>
+The indexing assignment <code>table[key] = value</code>.
+
+
+<pre>
+     function settable_event (table, key, value)
+       local h
+       if type(table) == "table" then
+         local v = rawget(table, key)
+         if v ~= nil then rawset(table, key, value); return end
+         h = metatable(table).__newindex
+         if h == nil then rawset(table, key, value); return end
+       else
+         h = metatable(table).__newindex
+         if h == nil then
+           error(&middot;&middot;&middot;)
+         end
+       end
+       if type(h) == "function" then
+         h(table, key,value)           -- call the handler
+       else h[key] = value             -- or repeat operation on it
+       end
+     end
+</pre><p>
+</li>
+
+<li><b>"call":</b>
+called when Lua calls a value.
+
+
+<pre>
+     function function_event (func, ...)
+       if type(func) == "function" then
+         return func(...)   -- primitive call
+       else
+         local h = metatable(func).__call
+         if h then
+           return h(func, ...)
+         else
+           error(&middot;&middot;&middot;)
+         end
+       end
+     end
+</pre><p>
+</li>
+
+</ul>
+
+
+
+
+<h2>2.9 - <a name="2.9">Environments</a></h2>
+
+<p>
+Besides metatables,
+objects of types thread, function, and userdata
+have another table associated with them,
+called their <em>environment</em>.
+Like metatables, environments are regular tables and
+multiple objects can share the same environment.
+
+
+<p>
+Threads are created sharing the environment of the creating thread.
+Userdata and C&nbsp;functions are created sharing the environment
+of the creating C&nbsp;function.
+Non-nested Lua functions
+(created by <a href="#pdf-loadfile"><code>loadfile</code></a>, <a href="#pdf-loadstring"><code>loadstring</code></a> or <a href="#pdf-load"><code>load</code></a>)
+are created sharing the environment of the creating thread.
+Nested Lua functions are created sharing the environment of
+the creating Lua function.
+
+
+<p>
+Environments associated with userdata have no meaning for Lua.
+It is only a convenience feature for programmers to associate a table to
+a userdata.
+
+
+<p>
+Environments associated with threads are called
+<em>global environments</em>.
+They are used as the default environment for threads and
+non-nested Lua functions created by the thread
+and can be directly accessed by C&nbsp;code (see <a href="#3.3">&sect;3.3</a>).
+
+
+<p>
+The environment associated with a C&nbsp;function can be directly
+accessed by C&nbsp;code (see <a href="#3.3">&sect;3.3</a>).
+It is used as the default environment for other C&nbsp;functions
+and userdata created by the function.
+
+
+<p>
+Environments associated with Lua functions are used to resolve
+all accesses to global variables within the function (see <a href="#2.3">&sect;2.3</a>).
+They are used as the default environment for nested Lua functions
+created by the function.
+
+
+<p>
+You can change the environment of a Lua function or the
+running thread by calling <a href="#pdf-setfenv"><code>setfenv</code></a>.
+You can get the environment of a Lua function or the running thread
+by calling <a href="#pdf-getfenv"><code>getfenv</code></a>.
+To manipulate the environment of other objects
+(userdata, C&nbsp;functions, other threads) you must
+use the C&nbsp;API.
+
+
+
+
+
+<h2>2.10 - <a name="2.10">Garbage Collection</a></h2>
+
+<p>
+Lua performs automatic memory management.
+This means that
+you have to worry neither about allocating memory for new objects
+nor about freeing it when the objects are no longer needed.
+Lua manages memory automatically by running
+a <em>garbage collector</em> from time to time
+to collect all <em>dead objects</em>
+(that is, objects that are no longer accessible from Lua).
+All memory used by Lua is subject to automatic management:
+tables, userdata, functions, threads, strings, etc.
+
+
+<p>
+Lua implements an incremental mark-and-sweep collector.
+It uses two numbers to control its garbage-collection cycles:
+the <em>garbage-collector pause</em> and
+the <em>garbage-collector step multiplier</em>.
+Both use percentage points as units
+(so that a value of 100 means an internal value of 1).
+
+
+<p>
+The garbage-collector pause
+controls how long the collector waits before starting a new cycle.
+Larger values make the collector less aggressive.
+Values smaller than 100 mean the collector will not wait to
+start a new cycle.
+A value of 200 means that the collector waits for the total memory in use
+to double before starting a new cycle.
+
+
+<p>
+The step multiplier
+controls the relative speed of the collector relative to
+memory allocation.
+Larger values make the collector more aggressive but also increase
+the size of each incremental step.
+Values smaller than 100 make the collector too slow and
+can result in the collector never finishing a cycle.
+The default, 200, means that the collector runs at "twice"
+the speed of memory allocation.
+
+
+<p>
+You can change these numbers by calling <a href="#lua_gc"><code>lua_gc</code></a> in C
+or <a href="#pdf-collectgarbage"><code>collectgarbage</code></a> in Lua.
+With these functions you can also control 
+the collector directly (e.g., stop and restart it).
+
+
+
+<h3>2.10.1 - <a name="2.10.1">Garbage-Collection Metamethods</a></h3>
+
+<p>
+Using the C&nbsp;API,
+you can set garbage-collector metamethods for userdata (see <a href="#2.8">&sect;2.8</a>).
+These metamethods are also called <em>finalizers</em>.
+Finalizers allow you to coordinate Lua's garbage collection
+with external resource management
+(such as closing files, network or database connections,
+or freeing your own memory).
+
+
+<p>
+Garbage userdata with a field <code>__gc</code> in their metatables are not
+collected immediately by the garbage collector.
+Instead, Lua puts them in a list.
+After the collection,
+Lua does the equivalent of the following function
+for each userdata in that list:
+
+<pre>
+     function gc_event (udata)
+       local h = metatable(udata).__gc
+       if h then
+         h(udata)
+       end
+     end
+</pre>
+
+<p>
+At the end of each garbage-collection cycle,
+the finalizers for userdata are called in <em>reverse</em>
+order of their creation,
+among those collected in that cycle.
+That is, the first finalizer to be called is the one associated
+with the userdata created last in the program.
+The userdata itself is freed only in the next garbage-collection cycle.
+
+
+
+
+
+<h3>2.10.2 - <a name="2.10.2">Weak Tables</a></h3>
+
+<p>
+A <em>weak table</em> is a table whose elements are
+<em>weak references</em>.
+A weak reference is ignored by the garbage collector.
+In other words,
+if the only references to an object are weak references,
+then the garbage collector will collect this object.
+
+
+<p>
+A weak table can have weak keys, weak values, or both.
+A table with weak keys allows the collection of its keys,
+but prevents the collection of its values.
+A table with both weak keys and weak values allows the collection of
+both keys and values.
+In any case, if either the key or the value is collected,
+the whole pair is removed from the table.
+The weakness of a table is controlled by the
+<code>__mode</code> field of its metatable.
+If the <code>__mode</code> field is a string containing the character&nbsp;'<code>k</code>',
+the keys in the table are weak.
+If <code>__mode</code> contains '<code>v</code>',
+the values in the table are weak.
+
+
+<p>
+After you use a table as a metatable,
+you should not change the value of its <code>__mode</code> field.
+Otherwise, the weak behavior of the tables controlled by this
+metatable is undefined.
+
+
+
+
+
+
+
+<h2>2.11 - <a name="2.11">Coroutines</a></h2>
+
+<p>
+Lua supports coroutines,
+also called <em>collaborative multithreading</em>.
+A coroutine in Lua represents an independent thread of execution.
+Unlike threads in multithread systems, however,
+a coroutine only suspends its execution by explicitly calling
+a yield function.
+
+
+<p>
+You create a coroutine with a call to <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>.
+Its sole argument is a function
+that is the main function of the coroutine.
+The <code>create</code> function only creates a new coroutine and
+returns a handle to it (an object of type <em>thread</em>);
+it does not start the coroutine execution.
+
+
+<p>
+When you first call <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
+passing as its first argument
+a thread returned by <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>,
+the coroutine starts its execution,
+at the first line of its main function.
+Extra arguments passed to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> are passed on
+to the coroutine main function.
+After the coroutine starts running,
+it runs until it terminates or <em>yields</em>.
+
+
+<p>
+A coroutine can terminate its execution in two ways:
+normally, when its main function returns
+(explicitly or implicitly, after the last instruction);
+and abnormally, if there is an unprotected error.
+In the first case, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns <b>true</b>,
+plus any values returned by the coroutine main function.
+In case of errors, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns <b>false</b>
+plus an error message.
+
+
+<p>
+A coroutine yields by calling <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a>.
+When a coroutine yields,
+the corresponding <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns immediately,
+even if the yield happens inside nested function calls
+(that is, not in the main function,
+but in a function directly or indirectly called by the main function).
+In the case of a yield, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> also returns <b>true</b>,
+plus any values passed to <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a>.
+The next time you resume the same coroutine,
+it continues its execution from the point where it yielded,
+with the call to <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a> returning any extra
+arguments passed to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>.
+
+
+<p>
+Like <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>,
+the <a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> function also creates a coroutine,
+but instead of returning the coroutine itself,
+it returns a function that, when called, resumes the coroutine.
+Any arguments passed to this function
+go as extra arguments to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>.
+<a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> returns all the values returned by <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
+except the first one (the boolean error code).
+Unlike <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
+<a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> does not catch errors;
+any error is propagated to the caller.
+
+
+<p>
+As an example,
+consider the following code:
+
+<pre>
+     function foo (a)
+       print("foo", a)
+       return coroutine.yield(2*a)
+     end
+     
+     co = coroutine.create(function (a,b)
+           print("co-body", a, b)
+           local r = foo(a+1)
+           print("co-body", r)
+           local r, s = coroutine.yield(a+b, a-b)
+           print("co-body", r, s)
+           return b, "end"
+     end)
+            
+     print("main", coroutine.resume(co, 1, 10))
+     print("main", coroutine.resume(co, "r"))
+     print("main", coroutine.resume(co, "x", "y"))
+     print("main", coroutine.resume(co, "x", "y"))
+</pre><p>
+When you run it, it produces the following output:
+
+<pre>
+     co-body 1       10
+     foo     2
+     
+     main    true    4
+     co-body r
+     main    true    11      -9
+     co-body x       y
+     main    true    10      end
+     main    false   cannot resume dead coroutine
+</pre>
+
+
+
+
+<h1>3 - <a name="3">The Application Program Interface</a></h1>
+
+<p>
+
+This section describes the C&nbsp;API for Lua, that is,
+the set of C&nbsp;functions available to the host program to communicate
+with Lua.
+All API functions and related types and constants
+are declared in the header file <a name="pdf-lua.h"><code>lua.h</code></a>.
+
+
+<p>
+Even when we use the term "function",
+any facility in the API may be provided as a macro instead.
+All such macros use each of their arguments exactly once
+(except for the first argument, which is always a Lua state),
+and so do not generate any hidden side-effects.
+
+
+<p>
+As in most C&nbsp;libraries,
+the Lua API functions do not check their arguments for validity or consistency.
+However, you can change this behavior by compiling Lua
+with a proper definition for the macro <a name="pdf-luai_apicheck"><code>luai_apicheck</code></a>,
+in file <code>luaconf.h</code>.
+
+
+
+<h2>3.1 - <a name="3.1">The Stack</a></h2>
+
+<p>
+Lua uses a <em>virtual stack</em> to pass values to and from C.
+Each element in this stack represents a Lua value
+(<b>nil</b>, number, string, etc.).
+
+
+<p>
+Whenever Lua calls C, the called function gets a new stack,
+which is independent of previous stacks and of stacks of
+C&nbsp;functions that are still active.
+This stack initially contains any arguments to the C&nbsp;function
+and it is where the C&nbsp;function pushes its results
+to be returned to the caller (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>).
+
+
+<p>
+For convenience,
+most query operations in the API do not follow a strict stack discipline.
+Instead, they can refer to any element in the stack
+by using an <em>index</em>:
+A positive index represents an <em>absolute</em> stack position
+(starting at&nbsp;1);
+a negative index represents an <em>offset</em> relative to the top of the stack.
+More specifically, if the stack has <em>n</em> elements,
+then index&nbsp;1 represents the first element
+(that is, the element that was pushed onto the stack first)
+and
+index&nbsp;<em>n</em> represents the last element;
+index&nbsp;-1 also represents the last element
+(that is, the element at the&nbsp;top)
+and index <em>-n</em> represents the first element.
+We say that an index is <em>valid</em>
+if it lies between&nbsp;1 and the stack top
+(that is, if <code>1 &le; abs(index) &le; top</code>).
+ 
+
+
+
+
+
+<h2>3.2 - <a name="3.2">Stack Size</a></h2>
+
+<p>
+When you interact with Lua API,
+you are responsible for ensuring consistency.
+In particular,
+<em>you are responsible for controlling stack overflow</em>.
+You can use the function <a href="#lua_checkstack"><code>lua_checkstack</code></a>
+to grow the stack size.
+
+
+<p>
+Whenever Lua calls C,
+it ensures that at least <a name="pdf-LUA_MINSTACK"><code>LUA_MINSTACK</code></a> stack positions are available.
+<code>LUA_MINSTACK</code> is defined as 20,
+so that usually you do not have to worry about stack space
+unless your code has loops pushing elements onto the stack.
+
+
+<p>
+Most query functions accept as indices any value inside the
+available stack space, that is, indices up to the maximum stack size
+you have set through <a href="#lua_checkstack"><code>lua_checkstack</code></a>.
+Such indices are called <em>acceptable indices</em>.
+More formally, we define an <em>acceptable index</em>
+as follows:
+
+<pre>
+     (index &lt; 0 &amp;&amp; abs(index) &lt;= top) ||
+     (index &gt; 0 &amp;&amp; index &lt;= stackspace)
+</pre><p>
+Note that 0 is never an acceptable index.
+
+
+
+
+
+<h2>3.3 - <a name="3.3">Pseudo-Indices</a></h2>
+
+<p>
+Unless otherwise noted,
+any function that accepts valid indices can also be called with
+<em>pseudo-indices</em>,
+which represent some Lua values that are accessible to C&nbsp;code
+but which are not in the stack.
+Pseudo-indices are used to access the thread environment,
+the function environment,
+the registry,
+and the upvalues of a C&nbsp;function (see <a href="#3.4">&sect;3.4</a>).
+
+
+<p>
+The thread environment (where global variables live) is
+always at pseudo-index <a name="pdf-LUA_GLOBALSINDEX"><code>LUA_GLOBALSINDEX</code></a>.
+The environment of the running C&nbsp;function is always
+at pseudo-index <a name="pdf-LUA_ENVIRONINDEX"><code>LUA_ENVIRONINDEX</code></a>.
+
+
+<p>
+To access and change the value of global variables,
+you can use regular table operations over an environment table.
+For instance, to access the value of a global variable, do
+
+<pre>
+     lua_getfield(L, LUA_GLOBALSINDEX, varname);
+</pre>
+
+
+
+
+<h2>3.4 - <a name="3.4">C Closures</a></h2>
+
+<p>
+When a C&nbsp;function is created,
+it is possible to associate some values with it,
+thus creating a <em>C&nbsp;closure</em>;
+these values are called <em>upvalues</em> and are
+accessible to the function whenever it is called
+(see <a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a>).
+
+
+<p>
+Whenever a C&nbsp;function is called,
+its upvalues are located at specific pseudo-indices.
+These pseudo-indices are produced by the macro
+<a name="lua_upvalueindex"><code>lua_upvalueindex</code></a>.
+The first value associated with a function is at position
+<code>lua_upvalueindex(1)</code>, and so on.
+Any access to <code>lua_upvalueindex(<em>n</em>)</code>,
+where <em>n</em> is greater than the number of upvalues of the
+current function (but not greater than 256),
+produces an acceptable (but invalid) index.
+
+
+
+
+
+<h2>3.5 - <a name="3.5">Registry</a></h2>
+
+<p>
+Lua provides a <em>registry</em>,
+a pre-defined table that can be used by any C&nbsp;code to
+store whatever Lua value it needs to store.
+This table is always located at pseudo-index
+<a name="pdf-LUA_REGISTRYINDEX"><code>LUA_REGISTRYINDEX</code></a>.
+Any C&nbsp;library can store data into this table,
+but it should take care to choose keys different from those used
+by other libraries, to avoid collisions.
+Typically, you should use as key a string containing your library name
+or a light userdata with the address of a C&nbsp;object in your code.
+
+
+<p>
+The integer keys in the registry are used by the reference mechanism,
+implemented by the auxiliary library,
+and therefore should not be used for other purposes.
+
+
+
+
+
+<h2>3.6 - <a name="3.6">Error Handling in C</a></h2>
+
+<p>
+Internally, Lua uses the C <code>longjmp</code> facility to handle errors.
+(You can also choose to use exceptions if you use C++;
+see file <code>luaconf.h</code>.)
+When Lua faces any error
+(such as memory allocation errors, type errors, syntax errors,
+and runtime errors)
+it <em>raises</em> an error;
+that is, it does a long jump.
+A <em>protected environment</em> uses <code>setjmp</code>
+to set a recover point;
+any error jumps to the most recent active recover point.
+
+
+<p>
+Most functions in the API can throw an error,
+for instance due to a memory allocation error.
+The documentation for each function indicates whether
+it can throw errors.
+
+
+<p>
+Inside a C&nbsp;function you can throw an error by calling <a href="#lua_error"><code>lua_error</code></a>.
+
+
+
+
+
+<h2>3.7 - <a name="3.7">Functions and Types</a></h2>
+
+<p>
+Here we list all functions and types from the C&nbsp;API in
+alphabetical order.
+Each function has an indicator like this:
+<span class="apii">[-o, +p, <em>x</em>]</span>
+
+
+<p>
+The first field, <code>o</code>,
+is how many elements the function pops from the stack.
+The second field, <code>p</code>,
+is how many elements the function pushes onto the stack.
+(Any function always pushes its results after popping its arguments.)
+A field in the form <code>x|y</code> means the function can push (or pop)
+<code>x</code> or <code>y</code> elements,
+depending on the situation;
+an interrogation mark '<code>?</code>' means that
+we cannot know how many elements the function pops/pushes
+by looking only at its arguments
+(e.g., they may depend on what is on the stack).
+The third field, <code>x</code>,
+tells whether the function may throw errors:
+'<code>-</code>' means the function never throws any error;
+'<code>m</code>' means the function may throw an error
+only due to not enough memory;
+'<code>e</code>' means the function may throw other kinds of errors;
+'<code>v</code>' means the function may throw an error on purpose.
+
+
+
+<hr><h3><a name="lua_Alloc"><code>lua_Alloc</code></a></h3>
+<pre>typedef void * (*lua_Alloc) (void *ud,
+                             void *ptr,
+                             size_t osize,
+                             size_t nsize);</pre>
+
+<p>
+The type of the memory-allocation function used by Lua states.
+The allocator function must provide a
+functionality similar to <code>realloc</code>,
+but not exactly the same.
+Its arguments are
+<code>ud</code>, an opaque pointer passed to <a href="#lua_newstate"><code>lua_newstate</code></a>;
+<code>ptr</code>, a pointer to the block being allocated/reallocated/freed;
+<code>osize</code>, the original size of the block;
+<code>nsize</code>, the new size of the block.
+<code>ptr</code> is <code>NULL</code> if and only if <code>osize</code> is zero.
+When <code>nsize</code> is zero, the allocator must return <code>NULL</code>;
+if <code>osize</code> is not zero,
+it should free the block pointed to by <code>ptr</code>.
+When <code>nsize</code> is not zero, the allocator returns <code>NULL</code>
+if and only if it cannot fill the request.
+When <code>nsize</code> is not zero and <code>osize</code> is zero,
+the allocator should behave like <code>malloc</code>.
+When <code>nsize</code> and <code>osize</code> are not zero,
+the allocator behaves like <code>realloc</code>.
+Lua assumes that the allocator never fails when
+<code>osize &gt;= nsize</code>.
+
+
+<p>
+Here is a simple implementation for the allocator function.
+It is used in the auxiliary library by <a href="#luaL_newstate"><code>luaL_newstate</code></a>.
+
+<pre>
+     static void *l_alloc (void *ud, void *ptr, size_t osize,
+                                                size_t nsize) {
+       (void)ud;  (void)osize;  /* not used */
+       if (nsize == 0) {
+         free(ptr);
+         return NULL;
+       }
+       else
+         return realloc(ptr, nsize);
+     }
+</pre><p>
+This code assumes
+that <code>free(NULL)</code> has no effect and that
+<code>realloc(NULL, size)</code> is equivalent to <code>malloc(size)</code>.
+ANSI&nbsp;C ensures both behaviors.
+
+
+
+
+
+<hr><h3><a name="lua_atpanic"><code>lua_atpanic</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf);</pre>
+
+<p>
+Sets a new panic function and returns the old one.
+
+
+<p>
+If an error happens outside any protected environment,
+Lua calls a <em>panic function</em>
+and then calls <code>exit(EXIT_FAILURE)</code>,
+thus exiting the host application.
+Your panic function can avoid this exit by
+never returning (e.g., doing a long jump).
+
+
+<p>
+The panic function can access the error message at the top of the stack.
+
+
+
+
+
+<hr><h3><a name="lua_call"><code>lua_call</code></a></h3><p>
+<span class="apii">[-(nargs + 1), +nresults, <em>e</em>]</span>
+<pre>void lua_call (lua_State *L, int nargs, int nresults);</pre>
+
+<p>
+Calls a function.
+
+
+<p>
+To call a function you must use the following protocol:
+first, the function to be called is pushed onto the stack;
+then, the arguments to the function are pushed
+in direct order;
+that is, the first argument is pushed first.
+Finally you call <a href="#lua_call"><code>lua_call</code></a>;
+<code>nargs</code> is the number of arguments that you pushed onto the stack.
+All arguments and the function value are popped from the stack
+when the function is called.
+The function results are pushed onto the stack when the function returns.
+The number of results is adjusted to <code>nresults</code>,
+unless <code>nresults</code> is <a name="pdf-LUA_MULTRET"><code>LUA_MULTRET</code></a>.
+In this case, <em>all</em> results from the function are pushed.
+Lua takes care that the returned values fit into the stack space.
+The function results are pushed onto the stack in direct order
+(the first result is pushed first),
+so that after the call the last result is on the top of the stack.
+
+
+<p>
+Any error inside the called function is propagated upwards
+(with a <code>longjmp</code>).
+
+
+<p>
+The following example shows how the host program can do the
+equivalent to this Lua code:
+
+<pre>
+     a = f("how", t.x, 14)
+</pre><p>
+Here it is in&nbsp;C:
+
+<pre>
+     lua_getfield(L, LUA_GLOBALSINDEX, "f"); /* function to be called */
+     lua_pushstring(L, "how");                        /* 1st argument */
+     lua_getfield(L, LUA_GLOBALSINDEX, "t");   /* table to be indexed */
+     lua_getfield(L, -1, "x");        /* push result of t.x (2nd arg) */
+     lua_remove(L, -2);                  /* remove 't' from the stack */
+     lua_pushinteger(L, 14);                          /* 3rd argument */
+     lua_call(L, 3, 1);     /* call 'f' with 3 arguments and 1 result */
+     lua_setfield(L, LUA_GLOBALSINDEX, "a");        /* set global 'a' */
+</pre><p>
+Note that the code above is "balanced":
+at its end, the stack is back to its original configuration.
+This is considered good programming practice.
+
+
+
+
+
+<hr><h3><a name="lua_CFunction"><code>lua_CFunction</code></a></h3>
+<pre>typedef int (*lua_CFunction) (lua_State *L);</pre>
+
+<p>
+Type for C&nbsp;functions.
+
+
+<p>
+In order to communicate properly with Lua,
+a C&nbsp;function must use the following protocol,
+which defines the way parameters and results are passed:
+a C&nbsp;function receives its arguments from Lua in its stack
+in direct order (the first argument is pushed first).
+So, when the function starts,
+<code>lua_gettop(L)</code> returns the number of arguments received by the function.
+The first argument (if any) is at index 1
+and its last argument is at index <code>lua_gettop(L)</code>.
+To return values to Lua, a C&nbsp;function just pushes them onto the stack,
+in direct order (the first result is pushed first),
+and returns the number of results.
+Any other value in the stack below the results will be properly
+discarded by Lua.
+Like a Lua function, a C&nbsp;function called by Lua can also return
+many results.
+
+
+<p>
+As an example, the following function receives a variable number
+of numerical arguments and returns their average and sum:
+
+<pre>
+     static int foo (lua_State *L) {
+       int n = lua_gettop(L);    /* number of arguments */
+       lua_Number sum = 0;
+       int i;
+       for (i = 1; i &lt;= n; i++) {
+         if (!lua_isnumber(L, i)) {
+           lua_pushstring(L, "incorrect argument");
+           lua_error(L);
+         }
+         sum += lua_tonumber(L, i);
+       }
+       lua_pushnumber(L, sum/n);        /* first result */
+       lua_pushnumber(L, sum);         /* second result */
+       return 2;                   /* number of results */
+     }
+</pre>
+
+
+
+
+<hr><h3><a name="lua_checkstack"><code>lua_checkstack</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>int lua_checkstack (lua_State *L, int extra);</pre>
+
+<p>
+Ensures that there are at least <code>extra</code> free stack slots in the stack.
+It returns false if it cannot grow the stack to that size.
+This function never shrinks the stack;
+if the stack is already larger than the new size,
+it is left unchanged.
+
+
+
+
+
+<hr><h3><a name="lua_close"><code>lua_close</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>void lua_close (lua_State *L);</pre>
+
+<p>
+Destroys all objects in the given Lua state
+(calling the corresponding garbage-collection metamethods, if any)
+and frees all dynamic memory used by this state.
+On several platforms, you may not need to call this function,
+because all resources are naturally released when the host program ends.
+On the other hand, long-running programs,
+such as a daemon or a web server,
+might need to release states as soon as they are not needed,
+to avoid growing too large.
+
+
+
+
+
+<hr><h3><a name="lua_concat"><code>lua_concat</code></a></h3><p>
+<span class="apii">[-n, +1, <em>e</em>]</span>
+<pre>void lua_concat (lua_State *L, int n);</pre>
+
+<p>
+Concatenates the <code>n</code> values at the top of the stack,
+pops them, and leaves the result at the top.
+If <code>n</code>&nbsp;is&nbsp;1, the result is the single value on the stack
+(that is, the function does nothing);
+if <code>n</code> is 0, the result is the empty string.
+Concatenation is performed following the usual semantics of Lua
+(see <a href="#2.5.4">&sect;2.5.4</a>).
+
+
+
+
+
+<hr><h3><a name="lua_cpcall"><code>lua_cpcall</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>-</em>]</span>
+<pre>int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);</pre>
+
+<p>
+Calls the C&nbsp;function <code>func</code> in protected mode.
+<code>func</code> starts with only one element in its stack,
+a light userdata containing <code>ud</code>.
+In case of errors,
+<a href="#lua_cpcall"><code>lua_cpcall</code></a> returns the same error codes as <a href="#lua_pcall"><code>lua_pcall</code></a>,
+plus the error object on the top of the stack;
+otherwise, it returns zero, and does not change the stack.
+All values returned by <code>func</code> are discarded.
+
+
+
+
+
+<hr><h3><a name="lua_createtable"><code>lua_createtable</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_createtable (lua_State *L, int narr, int nrec);</pre>
+
+<p>
+Creates a new empty table and pushes it onto the stack.
+The new table has space pre-allocated
+for <code>narr</code> array elements and <code>nrec</code> non-array elements.
+This pre-allocation is useful when you know exactly how many elements
+the table will have.
+Otherwise you can use the function <a href="#lua_newtable"><code>lua_newtable</code></a>.
+
+
+
+
+
+<hr><h3><a name="lua_dump"><code>lua_dump</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>int lua_dump (lua_State *L, lua_Writer writer, void *data);</pre>
+
+<p>
+Dumps a function as a binary chunk.
+Receives a Lua function on the top of the stack
+and produces a binary chunk that,
+if loaded again,
+results in a function equivalent to the one dumped.
+As it produces parts of the chunk,
+<a href="#lua_dump"><code>lua_dump</code></a> calls function <code>writer</code> (see <a href="#lua_Writer"><code>lua_Writer</code></a>)
+with the given <code>data</code>
+to write them.
+
+
+<p>
+The value returned is the error code returned by the last
+call to the writer;
+0&nbsp;means no errors.
+
+
+<p>
+This function does not pop the Lua function from the stack.
+
+
+
+
+
+<hr><h3><a name="lua_equal"><code>lua_equal</code></a></h3><p>
+<span class="apii">[-0, +0, <em>e</em>]</span>
+<pre>int lua_equal (lua_State *L, int index1, int index2);</pre>
+
+<p>
+Returns 1 if the two values in acceptable indices <code>index1</code> and
+<code>index2</code> are equal,
+following the semantics of the Lua <code>==</code> operator
+(that is, may call metamethods).
+Otherwise returns&nbsp;0.
+Also returns&nbsp;0 if any of the indices is non valid.
+
+
+
+
+
+<hr><h3><a name="lua_error"><code>lua_error</code></a></h3><p>
+<span class="apii">[-1, +0, <em>v</em>]</span>
+<pre>int lua_error (lua_State *L);</pre>
+
+<p>
+Generates a Lua error.
+The error message (which can actually be a Lua value of any type)
+must be on the stack top.
+This function does a long jump,
+and therefore never returns.
+(see <a href="#luaL_error"><code>luaL_error</code></a>).
+
+
+
+
+
+<hr><h3><a name="lua_gc"><code>lua_gc</code></a></h3><p>
+<span class="apii">[-0, +0, <em>e</em>]</span>
+<pre>int lua_gc (lua_State *L, int what, int data);</pre>
+
+<p>
+Controls the garbage collector.
+
+
+<p>
+This function performs several tasks,
+according to the value of the parameter <code>what</code>:
+
+<ul>
+
+<li><b><code>LUA_GCSTOP</code>:</b>
+stops the garbage collector.
+</li>
+
+<li><b><code>LUA_GCRESTART</code>:</b>
+restarts the garbage collector.
+</li>
+
+<li><b><code>LUA_GCCOLLECT</code>:</b>
+performs a full garbage-collection cycle.
+</li>
+
+<li><b><code>LUA_GCCOUNT</code>:</b>
+returns the current amount of memory (in Kbytes) in use by Lua.
+</li>
+
+<li><b><code>LUA_GCCOUNTB</code>:</b>
+returns the remainder of dividing the current amount of bytes of
+memory in use by Lua by 1024.
+</li>
+
+<li><b><code>LUA_GCSTEP</code>:</b>
+performs an incremental step of garbage collection.
+The step "size" is controlled by <code>data</code>
+(larger values mean more steps) in a non-specified way.
+If you want to control the step size
+you must experimentally tune the value of <code>data</code>.
+The function returns 1 if the step finished a
+garbage-collection cycle.
+</li>
+
+<li><b><code>LUA_GCSETPAUSE</code>:</b>
+sets <code>data</code> as the new value
+for the <em>pause</em> of the collector (see <a href="#2.10">&sect;2.10</a>).
+The function returns the previous value of the pause.
+</li>
+
+<li><b><code>LUA_GCSETSTEPMUL</code>:</b>
+sets <code>data</code> as the new value for the <em>step multiplier</em> of
+the collector (see <a href="#2.10">&sect;2.10</a>).
+The function returns the previous value of the step multiplier.
+</li>
+
+</ul>
+
+
+
+
+<hr><h3><a name="lua_getallocf"><code>lua_getallocf</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_Alloc lua_getallocf (lua_State *L, void **ud);</pre>
+
+<p>
+Returns the memory-allocation function of a given state.
+If <code>ud</code> is not <code>NULL</code>, Lua stores in <code>*ud</code> the
+opaque pointer passed to <a href="#lua_newstate"><code>lua_newstate</code></a>.
+
+
+
+
+
+<hr><h3><a name="lua_getfenv"><code>lua_getfenv</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_getfenv (lua_State *L, int index);</pre>
+
+<p>
+Pushes onto the stack the environment table of
+the value at the given index.
+
+
+
+
+
+<hr><h3><a name="lua_getfield"><code>lua_getfield</code></a></h3><p>
+<span class="apii">[-0, +1, <em>e</em>]</span>
+<pre>void lua_getfield (lua_State *L, int index, const char *k);</pre>
+
+<p>
+Pushes onto the stack the value <code>t[k]</code>,
+where <code>t</code> is the value at the given valid index.
+As in Lua, this function may trigger a metamethod
+for the "index" event (see <a href="#2.8">&sect;2.8</a>).
+
+
+
+
+
+<hr><h3><a name="lua_getglobal"><code>lua_getglobal</code></a></h3><p>
+<span class="apii">[-0, +1, <em>e</em>]</span>
+<pre>void lua_getglobal (lua_State *L, const char *name);</pre>
+
+<p>
+Pushes onto the stack the value of the global <code>name</code>.
+It is defined as a macro:
+
+<pre>
+     #define lua_getglobal(L,s)  lua_getfield(L, LUA_GLOBALSINDEX, s)
+</pre>
+
+
+
+
+<hr><h3><a name="lua_getmetatable"><code>lua_getmetatable</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>-</em>]</span>
+<pre>int lua_getmetatable (lua_State *L, int index);</pre>
+
+<p>
+Pushes onto the stack the metatable of the value at the given
+acceptable index.
+If the index is not valid,
+or if the value does not have a metatable,
+the function returns&nbsp;0 and pushes nothing on the stack.
+
+
+
+
+
+<hr><h3><a name="lua_gettable"><code>lua_gettable</code></a></h3><p>
+<span class="apii">[-1, +1, <em>e</em>]</span>
+<pre>void lua_gettable (lua_State *L, int index);</pre>
+
+<p>
+Pushes onto the stack the value <code>t[k]</code>,
+where <code>t</code> is the value at the given valid index
+and <code>k</code> is the value at the top of the stack.
+
+
+<p>
+This function pops the key from the stack
+(putting the resulting value in its place).
+As in Lua, this function may trigger a metamethod
+for the "index" event (see <a href="#2.8">&sect;2.8</a>).
+
+
+
+
+
+<hr><h3><a name="lua_gettop"><code>lua_gettop</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_gettop (lua_State *L);</pre>
+
+<p>
+Returns the index of the top element in the stack.
+Because indices start at&nbsp;1,
+this result is equal to the number of elements in the stack
+(and so 0&nbsp;means an empty stack).
+
+
+
+
+
+<hr><h3><a name="lua_insert"><code>lua_insert</code></a></h3><p>
+<span class="apii">[-1, +1, <em>-</em>]</span>
+<pre>void lua_insert (lua_State *L, int index);</pre>
+
+<p>
+Moves the top element into the given valid index,
+shifting up the elements above this index to open space.
+Cannot be called with a pseudo-index,
+because a pseudo-index is not an actual stack position.
+
+
+
+
+
+<hr><h3><a name="lua_Integer"><code>lua_Integer</code></a></h3>
+<pre>typedef ptrdiff_t lua_Integer;</pre>
+
+<p>
+The type used by the Lua API to represent integral values.
+
+
+<p>
+By default it is a <code>ptrdiff_t</code>,
+which is usually the largest signed integral type the machine handles
+"comfortably".
+
+
+
+
+
+<hr><h3><a name="lua_isboolean"><code>lua_isboolean</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isboolean (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index has type boolean,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_iscfunction"><code>lua_iscfunction</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_iscfunction (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a C&nbsp;function,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isfunction"><code>lua_isfunction</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isfunction (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a function
+(either C or Lua), and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_islightuserdata"><code>lua_islightuserdata</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_islightuserdata (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a light userdata,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isnil"><code>lua_isnil</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isnil (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is <b>nil</b>,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isnone"><code>lua_isnone</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isnone (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the given acceptable index is not valid
+(that is, it refers to an element outside the current stack),
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isnoneornil"><code>lua_isnoneornil</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isnoneornil (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the given acceptable index is not valid
+(that is, it refers to an element outside the current stack)
+or if the value at this index is <b>nil</b>,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isnumber"><code>lua_isnumber</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isnumber (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a number
+or a string convertible to a number,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isstring"><code>lua_isstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isstring (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a string
+or a number (which is always convertible to a string),
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_istable"><code>lua_istable</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_istable (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a table,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isthread"><code>lua_isthread</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isthread (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a thread,
+and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_isuserdata"><code>lua_isuserdata</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_isuserdata (lua_State *L, int index);</pre>
+
+<p>
+Returns 1 if the value at the given acceptable index is a userdata
+(either full or light), and 0&nbsp;otherwise.
+
+
+
+
+
+<hr><h3><a name="lua_lessthan"><code>lua_lessthan</code></a></h3><p>
+<span class="apii">[-0, +0, <em>e</em>]</span>
+<pre>int lua_lessthan (lua_State *L, int index1, int index2);</pre>
+
+<p>
+Returns 1 if the value at acceptable index <code>index1</code> is smaller
+than the value at acceptable index <code>index2</code>,
+following the semantics of the Lua <code>&lt;</code> operator
+(that is, may call metamethods).
+Otherwise returns&nbsp;0.
+Also returns&nbsp;0 if any of the indices is non valid.
+
+
+
+
+
+<hr><h3><a name="lua_load"><code>lua_load</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>int lua_load (lua_State *L,
+              lua_Reader reader,
+              void *data,
+              const char *chunkname);</pre>
+
+<p>
+Loads a Lua chunk.
+If there are no errors,
+<a href="#lua_load"><code>lua_load</code></a> pushes the compiled chunk as a Lua
+function on top of the stack.
+Otherwise, it pushes an error message.
+The return values of <a href="#lua_load"><code>lua_load</code></a> are:
+
+<ul>
+
+<li><b>0:</b> no errors;</li>
+
+<li><b><a name="pdf-LUA_ERRSYNTAX"><code>LUA_ERRSYNTAX</code></a>:</b>
+syntax error during pre-compilation;</li>
+
+<li><b><a href="#pdf-LUA_ERRMEM"><code>LUA_ERRMEM</code></a>:</b>
+memory allocation error.</li>
+
+</ul>
+
+<p>
+This function only loads a chunk;
+it does not run it.
+
+
+<p>
+<a href="#lua_load"><code>lua_load</code></a> automatically detects whether the chunk is text or binary,
+and loads it accordingly (see program <code>luac</code>).
+
+
+<p>
+The <a href="#lua_load"><code>lua_load</code></a> function uses a user-supplied <code>reader</code> function
+to read the chunk (see <a href="#lua_Reader"><code>lua_Reader</code></a>).
+The <code>data</code> argument is an opaque value passed to the reader function.
+
+
+<p>
+The <code>chunkname</code> argument gives a name to the chunk,
+which is used for error messages and in debug information (see <a href="#3.8">&sect;3.8</a>).
+
+
+
+
+
+<hr><h3><a name="lua_newstate"><code>lua_newstate</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_State *lua_newstate (lua_Alloc f, void *ud);</pre>
+
+<p>
+Creates a new, independent state.
+Returns <code>NULL</code> if cannot create the state
+(due to lack of memory).
+The argument <code>f</code> is the allocator function;
+Lua does all memory allocation for this state through this function.
+The second argument, <code>ud</code>, is an opaque pointer that Lua
+simply passes to the allocator in every call.
+
+
+
+
+
+<hr><h3><a name="lua_newtable"><code>lua_newtable</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_newtable (lua_State *L);</pre>
+
+<p>
+Creates a new empty table and pushes it onto the stack.
+It is equivalent to <code>lua_createtable(L, 0, 0)</code>.
+
+
+
+
+
+<hr><h3><a name="lua_newthread"><code>lua_newthread</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>lua_State *lua_newthread (lua_State *L);</pre>
+
+<p>
+Creates a new thread, pushes it on the stack,
+and returns a pointer to a <a href="#lua_State"><code>lua_State</code></a> that represents this new thread.
+The new state returned by this function shares with the original state
+all global objects (such as tables),
+but has an independent execution stack.
+
+
+<p>
+There is no explicit function to close or to destroy a thread.
+Threads are subject to garbage collection,
+like any Lua object.
+
+
+
+
+
+<hr><h3><a name="lua_newuserdata"><code>lua_newuserdata</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void *lua_newuserdata (lua_State *L, size_t size);</pre>
+
+<p>
+This function allocates a new block of memory with the given size,
+pushes onto the stack a new full userdata with the block address,
+and returns this address.
+
+
+<p>
+Userdata represent C&nbsp;values in Lua.
+A <em>full userdata</em> represents a block of memory.
+It is an object (like a table):
+you must create it, it can have its own metatable,
+and you can detect when it is being collected.
+A full userdata is only equal to itself (under raw equality).
+
+
+<p>
+When Lua collects a full userdata with a <code>gc</code> metamethod,
+Lua calls the metamethod and marks the userdata as finalized.
+When this userdata is collected again then
+Lua frees its corresponding memory.
+
+
+
+
+
+<hr><h3><a name="lua_next"><code>lua_next</code></a></h3><p>
+<span class="apii">[-1, +(2|0), <em>e</em>]</span>
+<pre>int lua_next (lua_State *L, int index);</pre>
+
+<p>
+Pops a key from the stack,
+and pushes a key-value pair from the table at the given index
+(the "next" pair after the given key).
+If there are no more elements in the table,
+then <a href="#lua_next"><code>lua_next</code></a> returns 0 (and pushes nothing).
+
+
+<p>
+A typical traversal looks like this:
+
+<pre>
+     /* table is in the stack at index 't' */
+     lua_pushnil(L);  /* first key */
+     while (lua_next(L, t) != 0) {
+       /* uses 'key' (at index -2) and 'value' (at index -1) */
+       printf("%s - %s\n",
+              lua_typename(L, lua_type(L, -2)),
+              lua_typename(L, lua_type(L, -1)));
+       /* removes 'value'; keeps 'key' for next iteration */
+       lua_pop(L, 1);
+     }
+</pre>
+
+<p>
+While traversing a table,
+do not call <a href="#lua_tolstring"><code>lua_tolstring</code></a> directly on a key,
+unless you know that the key is actually a string.
+Recall that <a href="#lua_tolstring"><code>lua_tolstring</code></a> <em>changes</em>
+the value at the given index;
+this confuses the next call to <a href="#lua_next"><code>lua_next</code></a>.
+
+
+
+
+
+<hr><h3><a name="lua_Number"><code>lua_Number</code></a></h3>
+<pre>typedef double lua_Number;</pre>
+
+<p>
+The type of numbers in Lua.
+By default, it is double, but that can be changed in <code>luaconf.h</code>.
+
+
+<p>
+Through the configuration file you can change
+Lua to operate with another type for numbers (e.g., float or long).
+
+
+
+
+
+<hr><h3><a name="lua_objlen"><code>lua_objlen</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>size_t lua_objlen (lua_State *L, int index);</pre>
+
+<p>
+Returns the "length" of the value at the given acceptable index:
+for strings, this is the string length;
+for tables, this is the result of the length operator ('<code>#</code>');
+for userdata, this is the size of the block of memory allocated
+for the userdata;
+for other values, it is&nbsp;0.
+
+
+
+
+
+<hr><h3><a name="lua_pcall"><code>lua_pcall</code></a></h3><p>
+<span class="apii">[-(nargs + 1), +(nresults|1), <em>-</em>]</span>
+<pre>int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc);</pre>
+
+<p>
+Calls a function in protected mode.
+
+
+<p>
+Both <code>nargs</code> and <code>nresults</code> have the same meaning as
+in <a href="#lua_call"><code>lua_call</code></a>.
+If there are no errors during the call,
+<a href="#lua_pcall"><code>lua_pcall</code></a> behaves exactly like <a href="#lua_call"><code>lua_call</code></a>.
+However, if there is any error,
+<a href="#lua_pcall"><code>lua_pcall</code></a> catches it,
+pushes a single value on the stack (the error message),
+and returns an error code.
+Like <a href="#lua_call"><code>lua_call</code></a>,
+<a href="#lua_pcall"><code>lua_pcall</code></a> always removes the function
+and its arguments from the stack.
+
+
+<p>
+If <code>errfunc</code> is 0,
+then the error message returned on the stack
+is exactly the original error message.
+Otherwise, <code>errfunc</code> is the stack index of an
+<em>error handler function</em>.
+(In the current implementation, this index cannot be a pseudo-index.)
+In case of runtime errors,
+this function will be called with the error message
+and its return value will be the message returned on the stack by <a href="#lua_pcall"><code>lua_pcall</code></a>.
+
+
+<p>
+Typically, the error handler function is used to add more debug
+information to the error message, such as a stack traceback.
+Such information cannot be gathered after the return of <a href="#lua_pcall"><code>lua_pcall</code></a>,
+since by then the stack has unwound.
+
+
+<p>
+The <a href="#lua_pcall"><code>lua_pcall</code></a> function returns 0 in case of success
+or one of the following error codes
+(defined in <code>lua.h</code>):
+
+<ul>
+
+<li><b><a name="pdf-LUA_ERRRUN"><code>LUA_ERRRUN</code></a>:</b>
+a runtime error.
+</li>
+
+<li><b><a name="pdf-LUA_ERRMEM"><code>LUA_ERRMEM</code></a>:</b>
+memory allocation error.
+For such errors, Lua does not call the error handler function.
+</li>
+
+<li><b><a name="pdf-LUA_ERRERR"><code>LUA_ERRERR</code></a>:</b>
+error while running the error handler function.
+</li>
+
+</ul>
+
+
+
+
+<hr><h3><a name="lua_pop"><code>lua_pop</code></a></h3><p>
+<span class="apii">[-n, +0, <em>-</em>]</span>
+<pre>void lua_pop (lua_State *L, int n);</pre>
+
+<p>
+Pops <code>n</code> elements from the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushboolean"><code>lua_pushboolean</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushboolean (lua_State *L, int b);</pre>
+
+<p>
+Pushes a boolean value with value <code>b</code> onto the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushcclosure"><code>lua_pushcclosure</code></a></h3><p>
+<span class="apii">[-n, +1, <em>m</em>]</span>
+<pre>void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);</pre>
+
+<p>
+Pushes a new C&nbsp;closure onto the stack.
+
+
+<p>
+When a C&nbsp;function is created,
+it is possible to associate some values with it,
+thus creating a C&nbsp;closure (see <a href="#3.4">&sect;3.4</a>);
+these values are then accessible to the function whenever it is called.
+To associate values with a C&nbsp;function,
+first these values should be pushed onto the stack
+(when there are multiple values, the first value is pushed first).
+Then <a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a>
+is called to create and push the C&nbsp;function onto the stack,
+with the argument <code>n</code> telling how many values should be
+associated with the function.
+<a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a> also pops these values from the stack.
+
+
+<p>
+The maximum value for <code>n</code> is 255.
+
+
+
+
+
+<hr><h3><a name="lua_pushcfunction"><code>lua_pushcfunction</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_pushcfunction (lua_State *L, lua_CFunction f);</pre>
+
+<p>
+Pushes a C&nbsp;function onto the stack.
+This function receives a pointer to a C function
+and pushes onto the stack a Lua value of type <code>function</code> that,
+when called, invokes the corresponding C&nbsp;function.
+
+
+<p>
+Any function to be registered in Lua must
+follow the correct protocol to receive its parameters
+and return its results (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>).
+
+
+<p>
+<code>lua_pushcfunction</code> is defined as a macro:
+
+<pre>
+     #define lua_pushcfunction(L,f)  lua_pushcclosure(L,f,0)
+</pre>
+
+
+
+
+<hr><h3><a name="lua_pushfstring"><code>lua_pushfstring</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>const char *lua_pushfstring (lua_State *L, const char *fmt, ...);</pre>
+
+<p>
+Pushes onto the stack a formatted string
+and returns a pointer to this string.
+It is similar to the C&nbsp;function <code>sprintf</code>,
+but has some important differences:
+
+<ul>
+
+<li>
+You do not have to allocate space for the result:
+the result is a Lua string and Lua takes care of memory allocation
+(and deallocation, through garbage collection).
+</li>
+
+<li>
+The conversion specifiers are quite restricted.
+There are no flags, widths, or precisions.
+The conversion specifiers can only be
+'<code>%%</code>' (inserts a '<code>%</code>' in the string),
+'<code>%s</code>' (inserts a zero-terminated string, with no size restrictions),
+'<code>%f</code>' (inserts a <a href="#lua_Number"><code>lua_Number</code></a>),
+'<code>%p</code>' (inserts a pointer as a hexadecimal numeral),
+'<code>%d</code>' (inserts an <code>int</code>), and
+'<code>%c</code>' (inserts an <code>int</code> as a character).
+</li>
+
+</ul>
+
+
+
+
+<hr><h3><a name="lua_pushinteger"><code>lua_pushinteger</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushinteger (lua_State *L, lua_Integer n);</pre>
+
+<p>
+Pushes a number with value <code>n</code> onto the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushlightuserdata"><code>lua_pushlightuserdata</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushlightuserdata (lua_State *L, void *p);</pre>
+
+<p>
+Pushes a light userdata onto the stack.
+
+
+<p>
+Userdata represent C&nbsp;values in Lua.
+A <em>light userdata</em> represents a pointer.
+It is a value (like a number):
+you do not create it, it has no individual metatable,
+and it is not collected (as it was never created).
+A light userdata is equal to "any"
+light userdata with the same C&nbsp;address.
+
+
+
+
+
+<hr><h3><a name="lua_pushliteral"><code>lua_pushliteral</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_pushliteral (lua_State *L, const char *s);</pre>
+
+<p>
+This macro is equivalent to <a href="#lua_pushlstring"><code>lua_pushlstring</code></a>,
+but can be used only when <code>s</code> is a literal string.
+In these cases, it automatically provides the string length.
+
+
+
+
+
+<hr><h3><a name="lua_pushlstring"><code>lua_pushlstring</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_pushlstring (lua_State *L, const char *s, size_t len);</pre>
+
+<p>
+Pushes the string pointed to by <code>s</code> with size <code>len</code>
+onto the stack.
+Lua makes (or reuses) an internal copy of the given string,
+so the memory at <code>s</code> can be freed or reused immediately after
+the function returns.
+The string can contain embedded zeros.
+
+
+
+
+
+<hr><h3><a name="lua_pushnil"><code>lua_pushnil</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushnil (lua_State *L);</pre>
+
+<p>
+Pushes a nil value onto the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushnumber"><code>lua_pushnumber</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushnumber (lua_State *L, lua_Number n);</pre>
+
+<p>
+Pushes a number with value <code>n</code> onto the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushstring"><code>lua_pushstring</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void lua_pushstring (lua_State *L, const char *s);</pre>
+
+<p>
+Pushes the zero-terminated string pointed to by <code>s</code>
+onto the stack.
+Lua makes (or reuses) an internal copy of the given string,
+so the memory at <code>s</code> can be freed or reused immediately after
+the function returns.
+The string cannot contain embedded zeros;
+it is assumed to end at the first zero.
+
+
+
+
+
+<hr><h3><a name="lua_pushthread"><code>lua_pushthread</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>int lua_pushthread (lua_State *L);</pre>
+
+<p>
+Pushes the thread represented by <code>L</code> onto the stack.
+Returns 1 if this thread is the main thread of its state.
+
+
+
+
+
+<hr><h3><a name="lua_pushvalue"><code>lua_pushvalue</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_pushvalue (lua_State *L, int index);</pre>
+
+<p>
+Pushes a copy of the element at the given valid index
+onto the stack.
+
+
+
+
+
+<hr><h3><a name="lua_pushvfstring"><code>lua_pushvfstring</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>const char *lua_pushvfstring (lua_State *L,
+                              const char *fmt,
+                              va_list argp);</pre>
+
+<p>
+Equivalent to <a href="#lua_pushfstring"><code>lua_pushfstring</code></a>, except that it receives a <code>va_list</code>
+instead of a variable number of arguments.
+
+
+
+
+
+<hr><h3><a name="lua_rawequal"><code>lua_rawequal</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_rawequal (lua_State *L, int index1, int index2);</pre>
+
+<p>
+Returns 1 if the two values in acceptable indices <code>index1</code> and
+<code>index2</code> are primitively equal
+(that is, without calling metamethods).
+Otherwise returns&nbsp;0.
+Also returns&nbsp;0 if any of the indices are non valid.
+
+
+
+
+
+<hr><h3><a name="lua_rawget"><code>lua_rawget</code></a></h3><p>
+<span class="apii">[-1, +1, <em>-</em>]</span>
+<pre>void lua_rawget (lua_State *L, int index);</pre>
+
+<p>
+Similar to <a href="#lua_gettable"><code>lua_gettable</code></a>, but does a raw access
+(i.e., without metamethods).
+
+
+
+
+
+<hr><h3><a name="lua_rawgeti"><code>lua_rawgeti</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void lua_rawgeti (lua_State *L, int index, int n);</pre>
+
+<p>
+Pushes onto the stack the value <code>t[n]</code>,
+where <code>t</code> is the value at the given valid index.
+The access is raw;
+that is, it does not invoke metamethods.
+
+
+
+
+
+<hr><h3><a name="lua_rawset"><code>lua_rawset</code></a></h3><p>
+<span class="apii">[-2, +0, <em>m</em>]</span>
+<pre>void lua_rawset (lua_State *L, int index);</pre>
+
+<p>
+Similar to <a href="#lua_settable"><code>lua_settable</code></a>, but does a raw assignment
+(i.e., without metamethods).
+
+
+
+
+
+<hr><h3><a name="lua_rawseti"><code>lua_rawseti</code></a></h3><p>
+<span class="apii">[-1, +0, <em>m</em>]</span>
+<pre>void lua_rawseti (lua_State *L, int index, int n);</pre>
+
+<p>
+Does the equivalent of <code>t[n] = v</code>,
+where <code>t</code> is the value at the given valid index
+and <code>v</code> is the value at the top of the stack.
+
+
+<p>
+This function pops the value from the stack.
+The assignment is raw;
+that is, it does not invoke metamethods.
+
+
+
+
+
+<hr><h3><a name="lua_Reader"><code>lua_Reader</code></a></h3>
+<pre>typedef const char * (*lua_Reader) (lua_State *L,
+                                    void *data,
+                                    size_t *size);</pre>
+
+<p>
+The reader function used by <a href="#lua_load"><code>lua_load</code></a>.
+Every time it needs another piece of the chunk,
+<a href="#lua_load"><code>lua_load</code></a> calls the reader,
+passing along its <code>data</code> parameter.
+The reader must return a pointer to a block of memory
+with a new piece of the chunk
+and set <code>size</code> to the block size.
+The block must exist until the reader function is called again.
+To signal the end of the chunk,
+the reader must return <code>NULL</code> or set <code>size</code> to zero.
+The reader function may return pieces of any size greater than zero.
+
+
+
+
+
+<hr><h3><a name="lua_register"><code>lua_register</code></a></h3><p>
+<span class="apii">[-0, +0, <em>e</em>]</span>
+<pre>void lua_register (lua_State *L,
+                   const char *name,
+                   lua_CFunction f);</pre>
+
+<p>
+Sets the C function <code>f</code> as the new value of global <code>name</code>.
+It is defined as a macro:
+
+<pre>
+     #define lua_register(L,n,f) \
+            (lua_pushcfunction(L, f), lua_setglobal(L, n))
+</pre>
+
+
+
+
+<hr><h3><a name="lua_remove"><code>lua_remove</code></a></h3><p>
+<span class="apii">[-1, +0, <em>-</em>]</span>
+<pre>void lua_remove (lua_State *L, int index);</pre>
+
+<p>
+Removes the element at the given valid index,
+shifting down the elements above this index to fill the gap.
+Cannot be called with a pseudo-index,
+because a pseudo-index is not an actual stack position.
+
+
+
+
+
+<hr><h3><a name="lua_replace"><code>lua_replace</code></a></h3><p>
+<span class="apii">[-1, +0, <em>-</em>]</span>
+<pre>void lua_replace (lua_State *L, int index);</pre>
+
+<p>
+Moves the top element into the given position (and pops it),
+without shifting any element
+(therefore replacing the value at the given position).
+
+
+
+
+
+<hr><h3><a name="lua_resume"><code>lua_resume</code></a></h3><p>
+<span class="apii">[-?, +?, <em>-</em>]</span>
+<pre>int lua_resume (lua_State *L, int narg);</pre>
+
+<p>
+Starts and resumes a coroutine in a given thread.
+
+
+<p>
+To start a coroutine, you first create a new thread
+(see <a href="#lua_newthread"><code>lua_newthread</code></a>);
+then you push onto its stack the main function plus any arguments;
+then you call <a href="#lua_resume"><code>lua_resume</code></a>,
+with <code>narg</code> being the number of arguments.
+This call returns when the coroutine suspends or finishes its execution.
+When it returns, the stack contains all values passed to <a href="#lua_yield"><code>lua_yield</code></a>,
+or all values returned by the body function.
+<a href="#lua_resume"><code>lua_resume</code></a> returns
+<a href="#pdf-LUA_YIELD"><code>LUA_YIELD</code></a> if the coroutine yields,
+0 if the coroutine finishes its execution
+without errors,
+or an error code in case of errors (see <a href="#lua_pcall"><code>lua_pcall</code></a>).
+In case of errors,
+the stack is not unwound,
+so you can use the debug API over it.
+The error message is on the top of the stack.
+To restart a coroutine, you put on its stack only the values to
+be passed as results from <code>yield</code>,
+and then call <a href="#lua_resume"><code>lua_resume</code></a>.
+
+
+
+
+
+<hr><h3><a name="lua_setallocf"><code>lua_setallocf</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);</pre>
+
+<p>
+Changes the allocator function of a given state to <code>f</code>
+with user data <code>ud</code>.
+
+
+
+
+
+<hr><h3><a name="lua_setfenv"><code>lua_setfenv</code></a></h3><p>
+<span class="apii">[-1, +0, <em>-</em>]</span>
+<pre>int lua_setfenv (lua_State *L, int index);</pre>
+
+<p>
+Pops a table from the stack and sets it as
+the new environment for the value at the given index.
+If the value at the given index is
+neither a function nor a thread nor a userdata,
+<a href="#lua_setfenv"><code>lua_setfenv</code></a> returns 0.
+Otherwise it returns 1.
+
+
+
+
+
+<hr><h3><a name="lua_setfield"><code>lua_setfield</code></a></h3><p>
+<span class="apii">[-1, +0, <em>e</em>]</span>
+<pre>void lua_setfield (lua_State *L, int index, const char *k);</pre>
+
+<p>
+Does the equivalent to <code>t[k] = v</code>,
+where <code>t</code> is the value at the given valid index
+and <code>v</code> is the value at the top of the stack.
+
+
+<p>
+This function pops the value from the stack.
+As in Lua, this function may trigger a metamethod
+for the "newindex" event (see <a href="#2.8">&sect;2.8</a>).
+
+
+
+
+
+<hr><h3><a name="lua_setglobal"><code>lua_setglobal</code></a></h3><p>
+<span class="apii">[-1, +0, <em>e</em>]</span>
+<pre>void lua_setglobal (lua_State *L, const char *name);</pre>
+
+<p>
+Pops a value from the stack and
+sets it as the new value of global <code>name</code>.
+It is defined as a macro:
+
+<pre>
+     #define lua_setglobal(L,s)   lua_setfield(L, LUA_GLOBALSINDEX, s)
+</pre>
+
+
+
+
+<hr><h3><a name="lua_setmetatable"><code>lua_setmetatable</code></a></h3><p>
+<span class="apii">[-1, +0, <em>-</em>]</span>
+<pre>int lua_setmetatable (lua_State *L, int index);</pre>
+
+<p>
+Pops a table from the stack and
+sets it as the new metatable for the value at the given
+acceptable index.
+
+
+
+
+
+<hr><h3><a name="lua_settable"><code>lua_settable</code></a></h3><p>
+<span class="apii">[-2, +0, <em>e</em>]</span>
+<pre>void lua_settable (lua_State *L, int index);</pre>
+
+<p>
+Does the equivalent to <code>t[k] = v</code>,
+where <code>t</code> is the value at the given valid index,
+<code>v</code> is the value at the top of the stack,
+and <code>k</code> is the value just below the top.
+
+
+<p>
+This function pops both the key and the value from the stack.
+As in Lua, this function may trigger a metamethod
+for the "newindex" event (see <a href="#2.8">&sect;2.8</a>).
+
+
+
+
+
+<hr><h3><a name="lua_settop"><code>lua_settop</code></a></h3><p>
+<span class="apii">[-?, +?, <em>-</em>]</span>
+<pre>void lua_settop (lua_State *L, int index);</pre>
+
+<p>
+Accepts any acceptable index, or&nbsp;0,
+and sets the stack top to this index.
+If the new top is larger than the old one,
+then the new elements are filled with <b>nil</b>.
+If <code>index</code> is&nbsp;0, then all stack elements are removed.
+
+
+
+
+
+<hr><h3><a name="lua_State"><code>lua_State</code></a></h3>
+<pre>typedef struct lua_State lua_State;</pre>
+
+<p>
+Opaque structure that keeps the whole state of a Lua interpreter.
+The Lua library is fully reentrant:
+it has no global variables.
+All information about a state is kept in this structure.
+
+
+<p>
+A pointer to this state must be passed as the first argument to
+every function in the library, except to <a href="#lua_newstate"><code>lua_newstate</code></a>,
+which creates a Lua state from scratch.
+
+
+
+
+
+<hr><h3><a name="lua_status"><code>lua_status</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_status (lua_State *L);</pre>
+
+<p>
+Returns the status of the thread <code>L</code>.
+
+
+<p>
+The status can be 0 for a normal thread,
+an error code if the thread finished its execution with an error,
+or <a name="pdf-LUA_YIELD"><code>LUA_YIELD</code></a> if the thread is suspended.
+
+
+
+
+
+<hr><h3><a name="lua_toboolean"><code>lua_toboolean</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_toboolean (lua_State *L, int index);</pre>
+
+<p>
+Converts the Lua value at the given acceptable index to a C&nbsp;boolean
+value (0&nbsp;or&nbsp;1).
+Like all tests in Lua,
+<a href="#lua_toboolean"><code>lua_toboolean</code></a> returns 1 for any Lua value
+different from <b>false</b> and <b>nil</b>;
+otherwise it returns 0.
+It also returns 0 when called with a non-valid index.
+(If you want to accept only actual boolean values,
+use <a href="#lua_isboolean"><code>lua_isboolean</code></a> to test the value's type.)
+
+
+
+
+
+<hr><h3><a name="lua_tocfunction"><code>lua_tocfunction</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_CFunction lua_tocfunction (lua_State *L, int index);</pre>
+
+<p>
+Converts a value at the given acceptable index to a C&nbsp;function.
+That value must be a C&nbsp;function;
+otherwise, returns <code>NULL</code>.
+
+
+
+
+
+<hr><h3><a name="lua_tointeger"><code>lua_tointeger</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_Integer lua_tointeger (lua_State *L, int index);</pre>
+
+<p>
+Converts the Lua value at the given acceptable index
+to the signed integral type <a href="#lua_Integer"><code>lua_Integer</code></a>.
+The Lua value must be a number or a string convertible to a number
+(see <a href="#2.2.1">&sect;2.2.1</a>);
+otherwise, <a href="#lua_tointeger"><code>lua_tointeger</code></a> returns&nbsp;0.
+
+
+<p>
+If the number is not an integer,
+it is truncated in some non-specified way.
+
+
+
+
+
+<hr><h3><a name="lua_tolstring"><code>lua_tolstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>const char *lua_tolstring (lua_State *L, int index, size_t *len);</pre>
+
+<p>
+Converts the Lua value at the given acceptable index to a C&nbsp;string.
+If <code>len</code> is not <code>NULL</code>,
+it also sets <code>*len</code> with the string length.
+The Lua value must be a string or a number;
+otherwise, the function returns <code>NULL</code>.
+If the value is a number,
+then <a href="#lua_tolstring"><code>lua_tolstring</code></a> also
+<em>changes the actual value in the stack to a string</em>.
+(This change confuses <a href="#lua_next"><code>lua_next</code></a>
+when <a href="#lua_tolstring"><code>lua_tolstring</code></a> is applied to keys during a table traversal.)
+
+
+<p>
+<a href="#lua_tolstring"><code>lua_tolstring</code></a> returns a fully aligned pointer
+to a string inside the Lua state.
+This string always has a zero ('<code>\0</code>')
+after its last character (as in&nbsp;C),
+but can contain other zeros in its body.
+Because Lua has garbage collection,
+there is no guarantee that the pointer returned by <a href="#lua_tolstring"><code>lua_tolstring</code></a>
+will be valid after the corresponding value is removed from the stack.
+
+
+
+
+
+<hr><h3><a name="lua_tonumber"><code>lua_tonumber</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_Number lua_tonumber (lua_State *L, int index);</pre>
+
+<p>
+Converts the Lua value at the given acceptable index
+to the C&nbsp;type <a href="#lua_Number"><code>lua_Number</code></a> (see <a href="#lua_Number"><code>lua_Number</code></a>).
+The Lua value must be a number or a string convertible to a number
+(see <a href="#2.2.1">&sect;2.2.1</a>);
+otherwise, <a href="#lua_tonumber"><code>lua_tonumber</code></a> returns&nbsp;0.
+
+
+
+
+
+<hr><h3><a name="lua_topointer"><code>lua_topointer</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>const void *lua_topointer (lua_State *L, int index);</pre>
+
+<p>
+Converts the value at the given acceptable index to a generic
+C&nbsp;pointer (<code>void*</code>).
+The value can be a userdata, a table, a thread, or a function;
+otherwise, <a href="#lua_topointer"><code>lua_topointer</code></a> returns <code>NULL</code>.
+Different objects will give different pointers.
+There is no way to convert the pointer back to its original value.
+
+
+<p>
+Typically this function is used only for debug information.
+
+
+
+
+
+<hr><h3><a name="lua_tostring"><code>lua_tostring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>const char *lua_tostring (lua_State *L, int index);</pre>
+
+<p>
+Equivalent to <a href="#lua_tolstring"><code>lua_tolstring</code></a> with <code>len</code> equal to <code>NULL</code>.
+
+
+
+
+
+<hr><h3><a name="lua_tothread"><code>lua_tothread</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_State *lua_tothread (lua_State *L, int index);</pre>
+
+<p>
+Converts the value at the given acceptable index to a Lua thread
+(represented as <code>lua_State*</code>).
+This value must be a thread;
+otherwise, the function returns <code>NULL</code>.
+
+
+
+
+
+<hr><h3><a name="lua_touserdata"><code>lua_touserdata</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>void *lua_touserdata (lua_State *L, int index);</pre>
+
+<p>
+If the value at the given acceptable index is a full userdata,
+returns its block address.
+If the value is a light userdata,
+returns its pointer.
+Otherwise, returns <code>NULL</code>.
+
+
+
+
+
+<hr><h3><a name="lua_type"><code>lua_type</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_type (lua_State *L, int index);</pre>
+
+<p>
+Returns the type of the value in the given acceptable index,
+or <code>LUA_TNONE</code> for a non-valid index
+(that is, an index to an "empty" stack position).
+The types returned by <a href="#lua_type"><code>lua_type</code></a> are coded by the following constants
+defined in <code>lua.h</code>:
+<code>LUA_TNIL</code>,
+<code>LUA_TNUMBER</code>,
+<code>LUA_TBOOLEAN</code>,
+<code>LUA_TSTRING</code>,
+<code>LUA_TTABLE</code>,
+<code>LUA_TFUNCTION</code>,
+<code>LUA_TUSERDATA</code>,
+<code>LUA_TTHREAD</code>,
+and
+<code>LUA_TLIGHTUSERDATA</code>.
+
+
+
+
+
+<hr><h3><a name="lua_typename"><code>lua_typename</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>const char *lua_typename  (lua_State *L, int tp);</pre>
+
+<p>
+Returns the name of the type encoded by the value <code>tp</code>,
+which must be one the values returned by <a href="#lua_type"><code>lua_type</code></a>.
+
+
+
+
+
+<hr><h3><a name="lua_Writer"><code>lua_Writer</code></a></h3>
+<pre>typedef int (*lua_Writer) (lua_State *L,
+                           const void* p,
+                           size_t sz,
+                           void* ud);</pre>
+
+<p>
+The type of the writer function used by <a href="#lua_dump"><code>lua_dump</code></a>.
+Every time it produces another piece of chunk,
+<a href="#lua_dump"><code>lua_dump</code></a> calls the writer,
+passing along the buffer to be written (<code>p</code>),
+its size (<code>sz</code>),
+and the <code>data</code> parameter supplied to <a href="#lua_dump"><code>lua_dump</code></a>.
+
+
+<p>
+The writer returns an error code:
+0&nbsp;means no errors;
+any other value means an error and stops <a href="#lua_dump"><code>lua_dump</code></a> from
+calling the writer again.
+
+
+
+
+
+<hr><h3><a name="lua_xmove"><code>lua_xmove</code></a></h3><p>
+<span class="apii">[-?, +?, <em>-</em>]</span>
+<pre>void lua_xmove (lua_State *from, lua_State *to, int n);</pre>
+
+<p>
+Exchange values between different threads of the <em>same</em> global state.
+
+
+<p>
+This function pops <code>n</code> values from the stack <code>from</code>,
+and pushes them onto the stack <code>to</code>.
+
+
+
+
+
+<hr><h3><a name="lua_yield"><code>lua_yield</code></a></h3><p>
+<span class="apii">[-?, +?, <em>-</em>]</span>
+<pre>int lua_yield  (lua_State *L, int nresults);</pre>
+
+<p>
+Yields a coroutine.
+
+
+<p>
+This function should only be called as the
+return expression of a C&nbsp;function, as follows:
+
+<pre>
+     return lua_yield (L, nresults);
+</pre><p>
+When a C&nbsp;function calls <a href="#lua_yield"><code>lua_yield</code></a> in that way,
+the running coroutine suspends its execution,
+and the call to <a href="#lua_resume"><code>lua_resume</code></a> that started this coroutine returns.
+The parameter <code>nresults</code> is the number of values from the stack
+that are passed as results to <a href="#lua_resume"><code>lua_resume</code></a>.
+
+
+
+
+
+
+
+<h2>3.8 - <a name="3.8">The Debug Interface</a></h2>
+
+<p>
+Lua has no built-in debugging facilities.
+Instead, it offers a special interface
+by means of functions and <em>hooks</em>.
+This interface allows the construction of different
+kinds of debuggers, profilers, and other tools
+that need "inside information" from the interpreter.
+
+
+
+<hr><h3><a name="lua_Debug"><code>lua_Debug</code></a></h3>
+<pre>typedef struct lua_Debug {
+  int event;
+  const char *name;           /* (n) */
+  const char *namewhat;       /* (n) */
+  const char *what;           /* (S) */
+  const char *source;         /* (S) */
+  int currentline;            /* (l) */
+  int nups;                   /* (u) number of upvalues */
+  int linedefined;            /* (S) */
+  int lastlinedefined;        /* (S) */
+  char short_src[LUA_IDSIZE]; /* (S) */
+  /* private part */
+  <em>other fields</em>
+} lua_Debug;</pre>
+
+<p>
+A structure used to carry different pieces of
+information about an active function.
+<a href="#lua_getstack"><code>lua_getstack</code></a> fills only the private part
+of this structure, for later use.
+To fill the other fields of <a href="#lua_Debug"><code>lua_Debug</code></a> with useful information,
+call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
+
+
+<p>
+The fields of <a href="#lua_Debug"><code>lua_Debug</code></a> have the following meaning:
+
+<ul>
+
+<li><b><code>source</code>:</b>
+If the function was defined in a string,
+then <code>source</code> is that string.
+If the function was defined in a file,
+then <code>source</code> starts with a '<code>@</code>' followed by the file name.
+</li>
+
+<li><b><code>short_src</code>:</b>
+a "printable" version of <code>source</code>, to be used in error messages.
+</li>
+
+<li><b><code>linedefined</code>:</b>
+the line number where the definition of the function starts.
+</li>
+
+<li><b><code>lastlinedefined</code>:</b>
+the line number where the definition of the function ends.
+</li>
+
+<li><b><code>what</code>:</b>
+the string <code>"Lua"</code> if the function is a Lua function,
+<code>"C"</code> if it is a C&nbsp;function,
+<code>"main"</code> if it is the main part of a chunk,
+and <code>"tail"</code> if it was a function that did a tail call.
+In the latter case,
+Lua has no other information about the function.
+</li>
+
+<li><b><code>currentline</code>:</b>
+the current line where the given function is executing.
+When no line information is available,
+<code>currentline</code> is set to -1.
+</li>
+
+<li><b><code>name</code>:</b>
+a reasonable name for the given function.
+Because functions in Lua are first-class values,
+they do not have a fixed name:
+some functions can be the value of multiple global variables,
+while others can be stored only in a table field.
+The <code>lua_getinfo</code> function checks how the function was
+called to find a suitable name.
+If it cannot find a name,
+then <code>name</code> is set to <code>NULL</code>.
+</li>
+
+<li><b><code>namewhat</code>:</b>
+explains the <code>name</code> field.
+The value of <code>namewhat</code> can be
+<code>"global"</code>, <code>"local"</code>, <code>"method"</code>,
+<code>"field"</code>, <code>"upvalue"</code>, or <code>""</code> (the empty string),
+according to how the function was called.
+(Lua uses the empty string when no other option seems to apply.)
+</li>
+
+<li><b><code>nups</code>:</b>
+the number of upvalues of the function.
+</li>
+
+</ul>
+
+
+
+
+<hr><h3><a name="lua_gethook"><code>lua_gethook</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_Hook lua_gethook (lua_State *L);</pre>
+
+<p>
+Returns the current hook function.
+
+
+
+
+
+<hr><h3><a name="lua_gethookcount"><code>lua_gethookcount</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_gethookcount (lua_State *L);</pre>
+
+<p>
+Returns the current hook count.
+
+
+
+
+
+<hr><h3><a name="lua_gethookmask"><code>lua_gethookmask</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_gethookmask (lua_State *L);</pre>
+
+<p>
+Returns the current hook mask.
+
+
+
+
+
+<hr><h3><a name="lua_getinfo"><code>lua_getinfo</code></a></h3><p>
+<span class="apii">[-(0|1), +(0|1|2), <em>m</em>]</span>
+<pre>int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);</pre>
+
+<p>
+Returns information about a specific function or function invocation.
+
+
+<p>
+To get information about a function invocation,
+the parameter <code>ar</code> must be a valid activation record that was
+filled by a previous call to <a href="#lua_getstack"><code>lua_getstack</code></a> or
+given as argument to a hook (see <a href="#lua_Hook"><code>lua_Hook</code></a>).
+
+
+<p>
+To get information about a function you push it onto the stack
+and start the <code>what</code> string with the character '<code>&gt;</code>'.
+(In that case,
+<code>lua_getinfo</code> pops the function in the top of the stack.)
+For instance, to know in which line a function <code>f</code> was defined,
+you can write the following code:
+
+<pre>
+     lua_Debug ar;
+     lua_getfield(L, LUA_GLOBALSINDEX, "f");  /* get global 'f' */
+     lua_getinfo(L, "&gt;S", &amp;ar);
+     printf("%d\n", ar.linedefined);
+</pre>
+
+<p>
+Each character in the string <code>what</code>
+selects some fields of the structure <code>ar</code> to be filled or
+a value to be pushed on the stack:
+
+<ul>
+
+<li><b>'<code>n</code>':</b> fills in the field <code>name</code> and <code>namewhat</code>;
+</li>
+
+<li><b>'<code>S</code>':</b>
+fills in the fields <code>source</code>, <code>short_src</code>,
+<code>linedefined</code>, <code>lastlinedefined</code>, and <code>what</code>;
+</li>
+
+<li><b>'<code>l</code>':</b> fills in the field <code>currentline</code>;
+</li>
+
+<li><b>'<code>u</code>':</b> fills in the field <code>nups</code>;
+</li>
+
+<li><b>'<code>f</code>':</b>
+pushes onto the stack the function that is
+running at the given level;
+</li>
+
+<li><b>'<code>L</code>':</b>
+pushes onto the stack a table whose indices are the
+numbers of the lines that are valid on the function.
+(A <em>valid line</em> is a line with some associated code,
+that is, a line where you can put a break point.
+Non-valid lines include empty lines and comments.)
+</li>
+
+</ul>
+
+<p>
+This function returns 0 on error
+(for instance, an invalid option in <code>what</code>).
+
+
+
+
+
+<hr><h3><a name="lua_getlocal"><code>lua_getlocal</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>-</em>]</span>
+<pre>const char *lua_getlocal (lua_State *L, lua_Debug *ar, int n);</pre>
+
+<p>
+Gets information about a local variable of a given activation record.
+The parameter <code>ar</code> must be a valid activation record that was
+filled by a previous call to <a href="#lua_getstack"><code>lua_getstack</code></a> or
+given as argument to a hook (see <a href="#lua_Hook"><code>lua_Hook</code></a>).
+The index <code>n</code> selects which local variable to inspect
+(1 is the first parameter or active local variable, and so on,
+until the last active local variable).
+<a href="#lua_getlocal"><code>lua_getlocal</code></a> pushes the variable's value onto the stack
+and returns its name.
+
+
+<p>
+Variable names starting with '<code>(</code>' (open parentheses)
+represent internal variables
+(loop control variables, temporaries, and C&nbsp;function locals).
+
+
+<p>
+Returns <code>NULL</code> (and pushes nothing)
+when the index is greater than
+the number of active local variables.
+
+
+
+
+
+<hr><h3><a name="lua_getstack"><code>lua_getstack</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_getstack (lua_State *L, int level, lua_Debug *ar);</pre>
+
+<p>
+Get information about the interpreter runtime stack.
+
+
+<p>
+This function fills parts of a <a href="#lua_Debug"><code>lua_Debug</code></a> structure with
+an identification of the <em>activation record</em>
+of the function executing at a given level.
+Level&nbsp;0 is the current running function,
+whereas level <em>n+1</em> is the function that has called level <em>n</em>.
+When there are no errors, <a href="#lua_getstack"><code>lua_getstack</code></a> returns 1;
+when called with a level greater than the stack depth,
+it returns 0.
+
+
+
+
+
+<hr><h3><a name="lua_getupvalue"><code>lua_getupvalue</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>-</em>]</span>
+<pre>const char *lua_getupvalue (lua_State *L, int funcindex, int n);</pre>
+
+<p>
+Gets information about a closure's upvalue.
+(For Lua functions,
+upvalues are the external local variables that the function uses,
+and that are consequently included in its closure.)
+<a href="#lua_getupvalue"><code>lua_getupvalue</code></a> gets the index <code>n</code> of an upvalue,
+pushes the upvalue's value onto the stack,
+and returns its name.
+<code>funcindex</code> points to the closure in the stack.
+(Upvalues have no particular order,
+as they are active through the whole function.
+So, they are numbered in an arbitrary order.)
+
+
+<p>
+Returns <code>NULL</code> (and pushes nothing)
+when the index is greater than the number of upvalues.
+For C&nbsp;functions, this function uses the empty string <code>""</code>
+as a name for all upvalues.
+
+
+
+
+
+<hr><h3><a name="lua_Hook"><code>lua_Hook</code></a></h3>
+<pre>typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);</pre>
+
+<p>
+Type for debugging hook functions.
+
+
+<p>
+Whenever a hook is called, its <code>ar</code> argument has its field
+<code>event</code> set to the specific event that triggered the hook.
+Lua identifies these events with the following constants:
+<a name="pdf-LUA_HOOKCALL"><code>LUA_HOOKCALL</code></a>, <a name="pdf-LUA_HOOKRET"><code>LUA_HOOKRET</code></a>,
+<a name="pdf-LUA_HOOKTAILRET"><code>LUA_HOOKTAILRET</code></a>, <a name="pdf-LUA_HOOKLINE"><code>LUA_HOOKLINE</code></a>,
+and <a name="pdf-LUA_HOOKCOUNT"><code>LUA_HOOKCOUNT</code></a>.
+Moreover, for line events, the field <code>currentline</code> is also set.
+To get the value of any other field in <code>ar</code>,
+the hook must call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
+For return events, <code>event</code> can be <code>LUA_HOOKRET</code>,
+the normal value, or <code>LUA_HOOKTAILRET</code>.
+In the latter case, Lua is simulating a return from
+a function that did a tail call;
+in this case, it is useless to call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
+
+
+<p>
+While Lua is running a hook, it disables other calls to hooks.
+Therefore, if a hook calls back Lua to execute a function or a chunk,
+this execution occurs without any calls to hooks.
+
+
+
+
+
+<hr><h3><a name="lua_sethook"><code>lua_sethook</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>int lua_sethook (lua_State *L, lua_Hook f, int mask, int count);</pre>
+
+<p>
+Sets the debugging hook function.
+
+
+<p>
+Argument <code>f</code> is the hook function.
+<code>mask</code> specifies on which events the hook will be called:
+it is formed by a bitwise or of the constants
+<a name="pdf-LUA_MASKCALL"><code>LUA_MASKCALL</code></a>,
+<a name="pdf-LUA_MASKRET"><code>LUA_MASKRET</code></a>,
+<a name="pdf-LUA_MASKLINE"><code>LUA_MASKLINE</code></a>,
+and <a name="pdf-LUA_MASKCOUNT"><code>LUA_MASKCOUNT</code></a>.
+The <code>count</code> argument is only meaningful when the mask
+includes <code>LUA_MASKCOUNT</code>.
+For each event, the hook is called as explained below:
+
+<ul>
+
+<li><b>The call hook:</b> is called when the interpreter calls a function.
+The hook is called just after Lua enters the new function,
+before the function gets its arguments.
+</li>
+
+<li><b>The return hook:</b> is called when the interpreter returns from a function.
+The hook is called just before Lua leaves the function.
+You have no access to the values to be returned by the function.
+</li>
+
+<li><b>The line hook:</b> is called when the interpreter is about to
+start the execution of a new line of code,
+or when it jumps back in the code (even to the same line).
+(This event only happens while Lua is executing a Lua function.)
+</li>
+
+<li><b>The count hook:</b> is called after the interpreter executes every
+<code>count</code> instructions.
+(This event only happens while Lua is executing a Lua function.)
+</li>
+
+</ul>
+
+<p>
+A hook is disabled by setting <code>mask</code> to zero.
+
+
+
+
+
+<hr><h3><a name="lua_setlocal"><code>lua_setlocal</code></a></h3><p>
+<span class="apii">[-(0|1), +0, <em>-</em>]</span>
+<pre>const char *lua_setlocal (lua_State *L, lua_Debug *ar, int n);</pre>
+
+<p>
+Sets the value of a local variable of a given activation record.
+Parameters <code>ar</code> and <code>n</code> are as in <a href="#lua_getlocal"><code>lua_getlocal</code></a>
+(see <a href="#lua_getlocal"><code>lua_getlocal</code></a>).
+<a href="#lua_setlocal"><code>lua_setlocal</code></a> assigns the value at the top of the stack
+to the variable and returns its name.
+It also pops the value from the stack.
+
+
+<p>
+Returns <code>NULL</code> (and pops nothing)
+when the index is greater than
+the number of active local variables.
+
+
+
+
+
+<hr><h3><a name="lua_setupvalue"><code>lua_setupvalue</code></a></h3><p>
+<span class="apii">[-(0|1), +0, <em>-</em>]</span>
+<pre>const char *lua_setupvalue (lua_State *L, int funcindex, int n);</pre>
+
+<p>
+Sets the value of a closure's upvalue.
+It assigns the value at the top of the stack
+to the upvalue and returns its name.
+It also pops the value from the stack.
+Parameters <code>funcindex</code> and <code>n</code> are as in the <a href="#lua_getupvalue"><code>lua_getupvalue</code></a>
+(see <a href="#lua_getupvalue"><code>lua_getupvalue</code></a>).
+
+
+<p>
+Returns <code>NULL</code> (and pops nothing)
+when the index is greater than the number of upvalues.
+
+
+
+
+
+
+
+<h1>4 - <a name="4">The Auxiliary Library</a></h1>
+
+<p>
+
+The <em>auxiliary library</em> provides several convenient functions
+to interface C with Lua.
+While the basic API provides the primitive functions for all 
+interactions between C and Lua,
+the auxiliary library provides higher-level functions for some
+common tasks.
+
+
+<p>
+All functions from the auxiliary library
+are defined in header file <code>lauxlib.h</code> and
+have a prefix <code>luaL_</code>.
+
+
+<p>
+All functions in the auxiliary library are built on
+top of the basic API,
+and so they provide nothing that cannot be done with this API.
+
+
+<p>
+Several functions in the auxiliary library are used to
+check C&nbsp;function arguments.
+Their names are always <code>luaL_check*</code> or <code>luaL_opt*</code>.
+All of these functions throw an error if the check is not satisfied.
+Because the error message is formatted for arguments
+(e.g., "<code>bad argument #1</code>"),
+you should not use these functions for other stack values.
+
+
+
+<h2>4.1 - <a name="4.1">Functions and Types</a></h2>
+
+<p>
+Here we list all functions and types from the auxiliary library
+in alphabetical order.
+
+
+
+<hr><h3><a name="luaL_addchar"><code>luaL_addchar</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>void luaL_addchar (luaL_Buffer *B, char c);</pre>
+
+<p>
+Adds the character <code>c</code> to the buffer <code>B</code>
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+
+
+
+
+
+<hr><h3><a name="luaL_addlstring"><code>luaL_addlstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l);</pre>
+
+<p>
+Adds the string pointed to by <code>s</code> with length <code>l</code> to
+the buffer <code>B</code>
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+The string may contain embedded zeros.
+
+
+
+
+
+<hr><h3><a name="luaL_addsize"><code>luaL_addsize</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>void luaL_addsize (luaL_Buffer *B, size_t n);</pre>
+
+<p>
+Adds to the buffer <code>B</code> (see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>)
+a string of length <code>n</code> previously copied to the
+buffer area (see <a href="#luaL_prepbuffer"><code>luaL_prepbuffer</code></a>).
+
+
+
+
+
+<hr><h3><a name="luaL_addstring"><code>luaL_addstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>void luaL_addstring (luaL_Buffer *B, const char *s);</pre>
+
+<p>
+Adds the zero-terminated string pointed to by <code>s</code>
+to the buffer <code>B</code>
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+The string may not contain embedded zeros.
+
+
+
+
+
+<hr><h3><a name="luaL_addvalue"><code>luaL_addvalue</code></a></h3><p>
+<span class="apii">[-1, +0, <em>m</em>]</span>
+<pre>void luaL_addvalue (luaL_Buffer *B);</pre>
+
+<p>
+Adds the value at the top of the stack
+to the buffer <code>B</code>
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+Pops the value.
+
+
+<p>
+This is the only function on string buffers that can (and must)
+be called with an extra element on the stack,
+which is the value to be added to the buffer.
+
+
+
+
+
+<hr><h3><a name="luaL_argcheck"><code>luaL_argcheck</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>void luaL_argcheck (lua_State *L,
+                    int cond,
+                    int narg,
+                    const char *extramsg);</pre>
+
+<p>
+Checks whether <code>cond</code> is true.
+If not, raises an error with the following message,
+where <code>func</code> is retrieved from the call stack:
+
+<pre>
+     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)
+</pre>
+
+
+
+
+<hr><h3><a name="luaL_argerror"><code>luaL_argerror</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_argerror (lua_State *L, int narg, const char *extramsg);</pre>
+
+<p>
+Raises an error with the following message,
+where <code>func</code> is retrieved from the call stack:
+
+<pre>
+     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)
+</pre>
+
+<p>
+This function never returns,
+but it is an idiom to use it in C&nbsp;functions
+as <code>return luaL_argerror(<em>args</em>)</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_Buffer"><code>luaL_Buffer</code></a></h3>
+<pre>typedef struct luaL_Buffer luaL_Buffer;</pre>
+
+<p>
+Type for a <em>string buffer</em>.
+
+
+<p>
+A string buffer allows C&nbsp;code to build Lua strings piecemeal.
+Its pattern of use is as follows:
+
+<ul>
+
+<li>First you declare a variable <code>b</code> of type <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>.</li>
+
+<li>Then you initialize it with a call <code>luaL_buffinit(L, &amp;b)</code>.</li>
+
+<li>
+Then you add string pieces to the buffer calling any of
+the <code>luaL_add*</code> functions.
+</li>
+
+<li>
+You finish by calling <code>luaL_pushresult(&amp;b)</code>.
+This call leaves the final string on the top of the stack.
+</li>
+
+</ul>
+
+<p>
+During its normal operation,
+a string buffer uses a variable number of stack slots.
+So, while using a buffer, you cannot assume that you know where
+the top of the stack is.
+You can use the stack between successive calls to buffer operations
+as long as that use is balanced;
+that is,
+when you call a buffer operation,
+the stack is at the same level
+it was immediately after the previous buffer operation.
+(The only exception to this rule is <a href="#luaL_addvalue"><code>luaL_addvalue</code></a>.)
+After calling <a href="#luaL_pushresult"><code>luaL_pushresult</code></a> the stack is back to its
+level when the buffer was initialized,
+plus the final string on its top.
+
+
+
+
+
+<hr><h3><a name="luaL_buffinit"><code>luaL_buffinit</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>void luaL_buffinit (lua_State *L, luaL_Buffer *B);</pre>
+
+<p>
+Initializes a buffer <code>B</code>.
+This function does not allocate any space;
+the buffer must be declared as a variable
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+
+
+
+
+
+<hr><h3><a name="luaL_callmeta"><code>luaL_callmeta</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>e</em>]</span>
+<pre>int luaL_callmeta (lua_State *L, int obj, const char *e);</pre>
+
+<p>
+Calls a metamethod.
+
+
+<p>
+If the object at index <code>obj</code> has a metatable and this
+metatable has a field <code>e</code>,
+this function calls this field and passes the object as its only argument.
+In this case this function returns 1 and pushes onto the
+stack the value returned by the call.
+If there is no metatable or no metamethod,
+this function returns 0 (without pushing any value on the stack).
+
+
+
+
+
+<hr><h3><a name="luaL_checkany"><code>luaL_checkany</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>void luaL_checkany (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function has an argument
+of any type (including <b>nil</b>) at position <code>narg</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_checkint"><code>luaL_checkint</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_checkint (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a number
+and returns this number cast to an <code>int</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_checkinteger"><code>luaL_checkinteger</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>lua_Integer luaL_checkinteger (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a number
+and returns this number cast to a <a href="#lua_Integer"><code>lua_Integer</code></a>.
+
+
+
+
+
+<hr><h3><a name="luaL_checklong"><code>luaL_checklong</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>long luaL_checklong (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a number
+and returns this number cast to a <code>long</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_checklstring"><code>luaL_checklstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>const char *luaL_checklstring (lua_State *L, int narg, size_t *l);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a string
+and returns this string;
+if <code>l</code> is not <code>NULL</code> fills <code>*l</code>
+with the string's length.
+
+
+<p>
+This function uses <a href="#lua_tolstring"><code>lua_tolstring</code></a> to get its result,
+so all conversions and caveats of that function apply here.
+
+
+
+
+
+<hr><h3><a name="luaL_checknumber"><code>luaL_checknumber</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>lua_Number luaL_checknumber (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a number
+and returns this number.
+
+
+
+
+
+<hr><h3><a name="luaL_checkoption"><code>luaL_checkoption</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_checkoption (lua_State *L,
+                      int narg,
+                      const char *def,
+                      const char *const lst[]);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a string and
+searches for this string in the array <code>lst</code>
+(which must be NULL-terminated).
+Returns the index in the array where the string was found.
+Raises an error if the argument is not a string or
+if the string cannot be found.
+
+
+<p>
+If <code>def</code> is not <code>NULL</code>,
+the function uses <code>def</code> as a default value when
+there is no argument <code>narg</code> or if this argument is <b>nil</b>.
+
+
+<p>
+This is a useful function for mapping strings to C&nbsp;enums.
+(The usual convention in Lua libraries is
+to use strings instead of numbers to select options.)
+
+
+
+
+
+<hr><h3><a name="luaL_checkstack"><code>luaL_checkstack</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>void luaL_checkstack (lua_State *L, int sz, const char *msg);</pre>
+
+<p>
+Grows the stack size to <code>top + sz</code> elements,
+raising an error if the stack cannot grow to that size.
+<code>msg</code> is an additional text to go into the error message.
+
+
+
+
+
+<hr><h3><a name="luaL_checkstring"><code>luaL_checkstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>const char *luaL_checkstring (lua_State *L, int narg);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a string
+and returns this string.
+
+
+<p>
+This function uses <a href="#lua_tolstring"><code>lua_tolstring</code></a> to get its result,
+so all conversions and caveats of that function apply here.
+
+
+
+
+
+<hr><h3><a name="luaL_checktype"><code>luaL_checktype</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>void luaL_checktype (lua_State *L, int narg, int t);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> has type <code>t</code>.
+See <a href="#lua_type"><code>lua_type</code></a> for the encoding of types for <code>t</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_checkudata"><code>luaL_checkudata</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>void *luaL_checkudata (lua_State *L, int narg, const char *tname);</pre>
+
+<p>
+Checks whether the function argument <code>narg</code> is a userdata
+of the type <code>tname</code> (see <a href="#luaL_newmetatable"><code>luaL_newmetatable</code></a>).
+
+
+
+
+
+<hr><h3><a name="luaL_dofile"><code>luaL_dofile</code></a></h3><p>
+<span class="apii">[-0, +?, <em>m</em>]</span>
+<pre>int luaL_dofile (lua_State *L, const char *filename);</pre>
+
+<p>
+Loads and runs the given file.
+It is defined as the following macro:
+
+<pre>
+     (luaL_loadfile(L, filename) || lua_pcall(L, 0, LUA_MULTRET, 0))
+</pre><p>
+It returns 0 if there are no errors
+or 1 in case of errors.
+
+
+
+
+
+<hr><h3><a name="luaL_dostring"><code>luaL_dostring</code></a></h3><p>
+<span class="apii">[-0, +?, <em>m</em>]</span>
+<pre>int luaL_dostring (lua_State *L, const char *str);</pre>
+
+<p>
+Loads and runs the given string.
+It is defined as the following macro:
+
+<pre>
+     (luaL_loadstring(L, str) || lua_pcall(L, 0, LUA_MULTRET, 0))
+</pre><p>
+It returns 0 if there are no errors
+or 1 in case of errors.
+
+
+
+
+
+<hr><h3><a name="luaL_error"><code>luaL_error</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_error (lua_State *L, const char *fmt, ...);</pre>
+
+<p>
+Raises an error.
+The error message format is given by <code>fmt</code>
+plus any extra arguments,
+following the same rules of <a href="#lua_pushfstring"><code>lua_pushfstring</code></a>.
+It also adds at the beginning of the message the file name and
+the line number where the error occurred,
+if this information is available.
+
+
+<p>
+This function never returns,
+but it is an idiom to use it in C&nbsp;functions
+as <code>return luaL_error(<em>args</em>)</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_getmetafield"><code>luaL_getmetafield</code></a></h3><p>
+<span class="apii">[-0, +(0|1), <em>m</em>]</span>
+<pre>int luaL_getmetafield (lua_State *L, int obj, const char *e);</pre>
+
+<p>
+Pushes onto the stack the field <code>e</code> from the metatable
+of the object at index <code>obj</code>.
+If the object does not have a metatable,
+or if the metatable does not have this field,
+returns 0 and pushes nothing.
+
+
+
+
+
+<hr><h3><a name="luaL_getmetatable"><code>luaL_getmetatable</code></a></h3><p>
+<span class="apii">[-0, +1, <em>-</em>]</span>
+<pre>void luaL_getmetatable (lua_State *L, const char *tname);</pre>
+
+<p>
+Pushes onto the stack the metatable associated with name <code>tname</code>
+in the registry (see <a href="#luaL_newmetatable"><code>luaL_newmetatable</code></a>).
+
+
+
+
+
+<hr><h3><a name="luaL_gsub"><code>luaL_gsub</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>const char *luaL_gsub (lua_State *L,
+                       const char *s,
+                       const char *p,
+                       const char *r);</pre>
+
+<p>
+Creates a copy of string <code>s</code> by replacing
+any occurrence of the string <code>p</code>
+with the string <code>r</code>.
+Pushes the resulting string on the stack and returns it.
+
+
+
+
+
+<hr><h3><a name="luaL_loadbuffer"><code>luaL_loadbuffer</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>int luaL_loadbuffer (lua_State *L,
+                     const char *buff,
+                     size_t sz,
+                     const char *name);</pre>
+
+<p>
+Loads a buffer as a Lua chunk.
+This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in the
+buffer pointed to by <code>buff</code> with size <code>sz</code>.
+
+
+<p>
+This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>.
+<code>name</code> is the chunk name,
+used for debug information and error messages.
+
+
+
+
+
+<hr><h3><a name="luaL_loadfile"><code>luaL_loadfile</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>int luaL_loadfile (lua_State *L, const char *filename);</pre>
+
+<p>
+Loads a file as a Lua chunk.
+This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in the file
+named <code>filename</code>.
+If <code>filename</code> is <code>NULL</code>,
+then it loads from the standard input.
+The first line in the file is ignored if it starts with a <code>#</code>.
+
+
+<p>
+This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>,
+but it has an extra error code <a name="pdf-LUA_ERRFILE"><code>LUA_ERRFILE</code></a>
+if it cannot open/read the file.
+
+
+<p>
+As <a href="#lua_load"><code>lua_load</code></a>, this function only loads the chunk;
+it does not run it.
+
+
+
+
+
+<hr><h3><a name="luaL_loadstring"><code>luaL_loadstring</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>int luaL_loadstring (lua_State *L, const char *s);</pre>
+
+<p>
+Loads a string as a Lua chunk.
+This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in
+the zero-terminated string <code>s</code>.
+
+
+<p>
+This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>.
+
+
+<p>
+Also as <a href="#lua_load"><code>lua_load</code></a>, this function only loads the chunk;
+it does not run it.
+
+
+
+
+
+<hr><h3><a name="luaL_newmetatable"><code>luaL_newmetatable</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>int luaL_newmetatable (lua_State *L, const char *tname);</pre>
+
+<p>
+If the registry already has the key <code>tname</code>,
+returns 0.
+Otherwise,
+creates a new table to be used as a metatable for userdata,
+adds it to the registry with key <code>tname</code>,
+and returns 1.
+
+
+<p>
+In both cases pushes onto the stack the final value associated
+with <code>tname</code> in the registry.
+
+
+
+
+
+<hr><h3><a name="luaL_newstate"><code>luaL_newstate</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>lua_State *luaL_newstate (void);</pre>
+
+<p>
+Creates a new Lua state.
+It calls <a href="#lua_newstate"><code>lua_newstate</code></a> with an
+allocator based on the standard&nbsp;C <code>realloc</code> function
+and then sets a panic function (see <a href="#lua_atpanic"><code>lua_atpanic</code></a>) that prints
+an error message to the standard error output in case of fatal
+errors.
+
+
+<p>
+Returns the new state,
+or <code>NULL</code> if there is a memory allocation error.
+
+
+
+
+
+<hr><h3><a name="luaL_openlibs"><code>luaL_openlibs</code></a></h3><p>
+<span class="apii">[-0, +0, <em>m</em>]</span>
+<pre>void luaL_openlibs (lua_State *L);</pre>
+
+<p>
+Opens all standard Lua libraries into the given state.
+
+
+
+
+
+<hr><h3><a name="luaL_optint"><code>luaL_optint</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_optint (lua_State *L, int narg, int d);</pre>
+
+<p>
+If the function argument <code>narg</code> is a number,
+returns this number cast to an <code>int</code>.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+
+
+
+<hr><h3><a name="luaL_optinteger"><code>luaL_optinteger</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>lua_Integer luaL_optinteger (lua_State *L,
+                             int narg,
+                             lua_Integer d);</pre>
+
+<p>
+If the function argument <code>narg</code> is a number,
+returns this number cast to a <a href="#lua_Integer"><code>lua_Integer</code></a>.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+
+
+
+<hr><h3><a name="luaL_optlong"><code>luaL_optlong</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>long luaL_optlong (lua_State *L, int narg, long d);</pre>
+
+<p>
+If the function argument <code>narg</code> is a number,
+returns this number cast to a <code>long</code>.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+
+
+
+<hr><h3><a name="luaL_optlstring"><code>luaL_optlstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>const char *luaL_optlstring (lua_State *L,
+                             int narg,
+                             const char *d,
+                             size_t *l);</pre>
+
+<p>
+If the function argument <code>narg</code> is a string,
+returns this string.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+<p>
+If <code>l</code> is not <code>NULL</code>,
+fills the position <code>*l</code> with the results's length.
+
+
+
+
+
+<hr><h3><a name="luaL_optnumber"><code>luaL_optnumber</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number d);</pre>
+
+<p>
+If the function argument <code>narg</code> is a number,
+returns this number.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+
+
+
+<hr><h3><a name="luaL_optstring"><code>luaL_optstring</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>const char *luaL_optstring (lua_State *L,
+                            int narg,
+                            const char *d);</pre>
+
+<p>
+If the function argument <code>narg</code> is a string,
+returns this string.
+If this argument is absent or is <b>nil</b>,
+returns <code>d</code>.
+Otherwise, raises an error.
+
+
+
+
+
+<hr><h3><a name="luaL_prepbuffer"><code>luaL_prepbuffer</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>char *luaL_prepbuffer (luaL_Buffer *B);</pre>
+
+<p>
+Returns an address to a space of size <a name="pdf-LUAL_BUFFERSIZE"><code>LUAL_BUFFERSIZE</code></a>
+where you can copy a string to be added to buffer <code>B</code>
+(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
+After copying the string into this space you must call
+<a href="#luaL_addsize"><code>luaL_addsize</code></a> with the size of the string to actually add 
+it to the buffer.
+
+
+
+
+
+<hr><h3><a name="luaL_pushresult"><code>luaL_pushresult</code></a></h3><p>
+<span class="apii">[-?, +1, <em>m</em>]</span>
+<pre>void luaL_pushresult (luaL_Buffer *B);</pre>
+
+<p>
+Finishes the use of buffer <code>B</code> leaving the final string on
+the top of the stack.
+
+
+
+
+
+<hr><h3><a name="luaL_ref"><code>luaL_ref</code></a></h3><p>
+<span class="apii">[-1, +0, <em>m</em>]</span>
+<pre>int luaL_ref (lua_State *L, int t);</pre>
+
+<p>
+Creates and returns a <em>reference</em>,
+in the table at index <code>t</code>,
+for the object at the top of the stack (and pops the object).
+
+
+<p>
+A reference is a unique integer key.
+As long as you do not manually add integer keys into table <code>t</code>,
+<a href="#luaL_ref"><code>luaL_ref</code></a> ensures the uniqueness of the key it returns.
+You can retrieve an object referred by reference <code>r</code>
+by calling <code>lua_rawgeti(L, t, r)</code>.
+Function <a href="#luaL_unref"><code>luaL_unref</code></a> frees a reference and its associated object.
+
+
+<p>
+If the object at the top of the stack is <b>nil</b>,
+<a href="#luaL_ref"><code>luaL_ref</code></a> returns the constant <a name="pdf-LUA_REFNIL"><code>LUA_REFNIL</code></a>.
+The constant <a name="pdf-LUA_NOREF"><code>LUA_NOREF</code></a> is guaranteed to be different
+from any reference returned by <a href="#luaL_ref"><code>luaL_ref</code></a>.
+
+
+
+
+
+<hr><h3><a name="luaL_Reg"><code>luaL_Reg</code></a></h3>
+<pre>typedef struct luaL_Reg {
+  const char *name;
+  lua_CFunction func;
+} luaL_Reg;</pre>
+
+<p>
+Type for arrays of functions to be registered by
+<a href="#luaL_register"><code>luaL_register</code></a>.
+<code>name</code> is the function name and <code>func</code> is a pointer to
+the function.
+Any array of <a href="#luaL_Reg"><code>luaL_Reg</code></a> must end with an sentinel entry
+in which both <code>name</code> and <code>func</code> are <code>NULL</code>.
+
+
+
+
+
+<hr><h3><a name="luaL_register"><code>luaL_register</code></a></h3><p>
+<span class="apii">[-(0|1), +1, <em>m</em>]</span>
+<pre>void luaL_register (lua_State *L,
+                    const char *libname,
+                    const luaL_Reg *l);</pre>
+
+<p>
+Opens a library.
+
+
+<p>
+When called with <code>libname</code> equal to <code>NULL</code>,
+it simply registers all functions in the list <code>l</code>
+(see <a href="#luaL_Reg"><code>luaL_Reg</code></a>) into the table on the top of the stack.
+
+
+<p>
+When called with a non-null <code>libname</code>,
+<code>luaL_register</code> creates a new table <code>t</code>,
+sets it as the value of the global variable <code>libname</code>,
+sets it as the value of <code>package.loaded[libname]</code>,
+and registers on it all functions in the list <code>l</code>.
+If there is a table in <code>package.loaded[libname]</code> or in
+variable <code>libname</code>,
+reuses this table instead of creating a new one.
+
+
+<p>
+In any case the function leaves the table
+on the top of the stack.
+
+
+
+
+
+<hr><h3><a name="luaL_typename"><code>luaL_typename</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>const char *luaL_typename (lua_State *L, int index);</pre>
+
+<p>
+Returns the name of the type of the value at the given index.
+
+
+
+
+
+<hr><h3><a name="luaL_typerror"><code>luaL_typerror</code></a></h3><p>
+<span class="apii">[-0, +0, <em>v</em>]</span>
+<pre>int luaL_typerror (lua_State *L, int narg, const char *tname);</pre>
+
+<p>
+Generates an error with a message like the following:
+
+<pre>
+     <em>location</em>: bad argument <em>narg</em> to '<em>func</em>' (<em>tname</em> expected, got <em>rt</em>)
+</pre><p>
+where <code><em>location</em></code> is produced by <a href="#luaL_where"><code>luaL_where</code></a>,
+<code><em>func</em></code> is the name of the current function,
+and <code><em>rt</em></code> is the type name of the actual argument.
+
+
+
+
+
+<hr><h3><a name="luaL_unref"><code>luaL_unref</code></a></h3><p>
+<span class="apii">[-0, +0, <em>-</em>]</span>
+<pre>void luaL_unref (lua_State *L, int t, int ref);</pre>
+
+<p>
+Releases reference <code>ref</code> from the table at index <code>t</code>
+(see <a href="#luaL_ref"><code>luaL_ref</code></a>).
+The entry is removed from the table,
+so that the referred object can be collected.
+The reference <code>ref</code> is also freed to be used again.
+
+
+<p>
+If <code>ref</code> is <a href="#pdf-LUA_NOREF"><code>LUA_NOREF</code></a> or <a href="#pdf-LUA_REFNIL"><code>LUA_REFNIL</code></a>,
+<a href="#luaL_unref"><code>luaL_unref</code></a> does nothing.
+
+
+
+
+
+<hr><h3><a name="luaL_where"><code>luaL_where</code></a></h3><p>
+<span class="apii">[-0, +1, <em>m</em>]</span>
+<pre>void luaL_where (lua_State *L, int lvl);</pre>
+
+<p>
+Pushes onto the stack a string identifying the current position
+of the control at level <code>lvl</code> in the call stack.
+Typically this string has the following format:
+
+<pre>
+     <em>chunkname</em>:<em>currentline</em>:
+</pre><p>
+Level&nbsp;0 is the running function,
+level&nbsp;1 is the function that called the running function,
+etc.
+
+
+<p>
+This function is used to build a prefix for error messages.
+
+
+
+
+
+
+
+<h1>5 - <a name="5">Standard Libraries</a></h1>
+
+<p>
+The standard Lua libraries provide useful functions
+that are implemented directly through the C&nbsp;API.
+Some of these functions provide essential services to the language
+(e.g., <a href="#pdf-type"><code>type</code></a> and <a href="#pdf-getmetatable"><code>getmetatable</code></a>);
+others provide access to "outside" services (e.g., I/O);
+and others could be implemented in Lua itself,
+but are quite useful or have critical performance requirements that
+deserve an implementation in C (e.g., <a href="#pdf-table.sort"><code>table.sort</code></a>).
+
+
+<p>
+All libraries are implemented through the official C&nbsp;API
+and are provided as separate C&nbsp;modules.
+Currently, Lua has the following standard libraries:
+
+<ul>
+
+<li>basic library, which includes the coroutine sub-library;</li>
+
+<li>package library;</li>
+
+<li>string manipulation;</li>
+
+<li>table manipulation;</li>
+
+<li>mathematical functions (sin, log, etc.);</li>
+
+<li>input and output;</li>
+
+<li>operating system facilities;</li>
+
+<li>debug facilities.</li>
+
+</ul><p>
+Except for the basic and package libraries,
+each library provides all its functions as fields of a global table
+or as methods of its objects.
+
+
+<p>
+To have access to these libraries,
+the C&nbsp;host program should call the <a href="#luaL_openlibs"><code>luaL_openlibs</code></a> function,
+which opens all standard libraries.
+Alternatively,
+it can open them individually by calling
+<a name="pdf-luaopen_base"><code>luaopen_base</code></a> (for the basic library),
+<a name="pdf-luaopen_package"><code>luaopen_package</code></a> (for the package library),
+<a name="pdf-luaopen_string"><code>luaopen_string</code></a> (for the string library),
+<a name="pdf-luaopen_table"><code>luaopen_table</code></a> (for the table library),
+<a name="pdf-luaopen_math"><code>luaopen_math</code></a> (for the mathematical library),
+<a name="pdf-luaopen_io"><code>luaopen_io</code></a> (for the I/O library),
+<a name="pdf-luaopen_os"><code>luaopen_os</code></a> (for the Operating System library),
+and <a name="pdf-luaopen_debug"><code>luaopen_debug</code></a> (for the debug library).
+These functions are declared in <a name="pdf-lualib.h"><code>lualib.h</code></a>
+and should not be called directly:
+you must call them like any other Lua C&nbsp;function,
+e.g., by using <a href="#lua_call"><code>lua_call</code></a>.
+
+
+
+<h2>5.1 - <a name="5.1">Basic Functions</a></h2>
+
+<p>
+The basic library provides some core functions to Lua.
+If you do not include this library in your application,
+you should check carefully whether you need to provide 
+implementations for some of its facilities.
+
+
+<p>
+<hr><h3><a name="pdf-assert"><code>assert (v [, message])</code></a></h3>
+Issues an  error when
+the value of its argument <code>v</code> is false (i.e., <b>nil</b> or <b>false</b>);
+otherwise, returns all its arguments.
+<code>message</code> is an error message;
+when absent, it defaults to "assertion failed!"
+
+
+
+
+<p>
+<hr><h3><a name="pdf-collectgarbage"><code>collectgarbage ([opt [, arg]])</code></a></h3>
+
+
+<p>
+This function is a generic interface to the garbage collector.
+It performs different functions according to its first argument, <code>opt</code>:
+
+<ul>
+
+<li><b>"collect":</b>
+performs a full garbage-collection cycle.
+This is the default option.
+</li>
+
+<li><b>"stop":</b>
+stops the garbage collector.
+</li>
+
+<li><b>"restart":</b>
+restarts the garbage collector.
+</li>
+
+<li><b>"count":</b>
+returns the total memory in use by Lua (in Kbytes).
+</li>
+
+<li><b>"step":</b>
+performs a garbage-collection step.
+The step "size" is controlled by <code>arg</code>
+(larger values mean more steps) in a non-specified way.
+If you want to control the step size
+you must experimentally tune the value of <code>arg</code>.
+Returns <b>true</b> if the step finished a collection cycle.
+</li>
+
+<li><b>"setpause":</b>
+sets <code>arg</code> as the new value for the <em>pause</em> of
+the collector (see <a href="#2.10">&sect;2.10</a>).
+Returns the previous value for <em>pause</em>.
+</li>
+
+<li><b>"setstepmul":</b>
+sets <code>arg</code> as the new value for the <em>step multiplier</em> of
+the collector (see <a href="#2.10">&sect;2.10</a>).
+Returns the previous value for <em>step</em>.
+</li>
+
+</ul>
+
+
+
+<p>
+<hr><h3><a name="pdf-dofile"><code>dofile ([filename])</code></a></h3>
+Opens the named file and executes its contents as a Lua chunk.
+When called without arguments,
+<code>dofile</code> executes the contents of the standard input (<code>stdin</code>).
+Returns all values returned by the chunk.
+In case of errors, <code>dofile</code> propagates the error
+to its caller (that is, <code>dofile</code> does not run in protected mode).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-error"><code>error (message [, level])</code></a></h3>
+Terminates the last protected function called
+and returns <code>message</code> as the error message.
+Function <code>error</code> never returns.
+
+
+<p>
+Usually, <code>error</code> adds some information about the error position
+at the beginning of the message.
+The <code>level</code> argument specifies how to get the error position.
+With level&nbsp;1 (the default), the error position is where the
+<code>error</code> function was called.
+Level&nbsp;2 points the error to where the function
+that called <code>error</code> was called; and so on.
+Passing a level&nbsp;0 avoids the addition of error position information
+to the message.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-_G"><code>_G</code></a></h3>
+A global variable (not a function) that
+holds the global environment (that is, <code>_G._G = _G</code>).
+Lua itself does not use this variable;
+changing its value does not affect any environment,
+nor vice-versa.
+(Use <a href="#pdf-setfenv"><code>setfenv</code></a> to change environments.)
+
+
+
+
+<p>
+<hr><h3><a name="pdf-getfenv"><code>getfenv ([f])</code></a></h3>
+Returns the current environment in use by the function.
+<code>f</code> can be a Lua function or a number
+that specifies the function at that stack level:
+Level&nbsp;1 is the function calling <code>getfenv</code>.
+If the given function is not a Lua function,
+or if <code>f</code> is 0,
+<code>getfenv</code> returns the global environment.
+The default for <code>f</code> is 1.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-getmetatable"><code>getmetatable (object)</code></a></h3>
+
+
+<p>
+If <code>object</code> does not have a metatable, returns <b>nil</b>.
+Otherwise,
+if the object's metatable has a <code>"__metatable"</code> field,
+returns the associated value.
+Otherwise, returns the metatable of the given object.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-ipairs"><code>ipairs (t)</code></a></h3>
+
+
+<p>
+Returns three values: an iterator function, the table <code>t</code>, and 0,
+so that the construction
+
+<pre>
+     for i,v in ipairs(t) do <em>body</em> end
+</pre><p>
+will iterate over the pairs (<code>1,t[1]</code>), (<code>2,t[2]</code>), &middot;&middot;&middot;,
+up to the first integer key absent from the table.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-load"><code>load (func [, chunkname])</code></a></h3>
+
+
+<p>
+Loads a chunk using function <code>func</code> to get its pieces.
+Each call to <code>func</code> must return a string that concatenates
+with previous results.
+A return of an empty string, <b>nil</b>, or no value signals the end of the chunk.
+
+
+<p>
+If there are no errors, 
+returns the compiled chunk as a function;
+otherwise, returns <b>nil</b> plus the error message.
+The environment of the returned function is the global environment.
+
+
+<p>
+<code>chunkname</code> is used as the chunk name for error messages
+and debug information.
+When absent,
+it defaults to "<code>=(load)</code>".
+
+
+
+
+<p>
+<hr><h3><a name="pdf-loadfile"><code>loadfile ([filename])</code></a></h3>
+
+
+<p>
+Similar to <a href="#pdf-load"><code>load</code></a>,
+but gets the chunk from file <code>filename</code>
+or from the standard input,
+if no file name is given.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-loadstring"><code>loadstring (string [, chunkname])</code></a></h3>
+
+
+<p>
+Similar to <a href="#pdf-load"><code>load</code></a>,
+but gets the chunk from the given string.
+
+
+<p>
+To load and run a given string, use the idiom
+
+<pre>
+     assert(loadstring(s))()
+</pre>
+
+<p>
+When absent,
+<code>chunkname</code> defaults to the given string.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-next"><code>next (table [, index])</code></a></h3>
+
+
+<p>
+Allows a program to traverse all fields of a table.
+Its first argument is a table and its second argument
+is an index in this table.
+<code>next</code> returns the next index of the table
+and its associated value.
+When called with <b>nil</b> as its second argument,
+<code>next</code> returns an initial index
+and its associated value.
+When called with the last index,
+or with <b>nil</b> in an empty table,
+<code>next</code> returns <b>nil</b>.
+If the second argument is absent, then it is interpreted as <b>nil</b>.
+In particular,
+you can use <code>next(t)</code> to check whether a table is empty.
+
+
+<p>
+The order in which the indices are enumerated is not specified,
+<em>even for numeric indices</em>.
+(To traverse a table in numeric order,
+use a numerical <b>for</b> or the <a href="#pdf-ipairs"><code>ipairs</code></a> function.)
+
+
+<p>
+The behavior of <code>next</code> is <em>undefined</em> if,
+during the traversal,
+you assign any value to a non-existent field in the table.
+You may however modify existing fields.
+In particular, you may clear existing fields.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-pairs"><code>pairs (t)</code></a></h3>
+
+
+<p>
+Returns three values: the <a href="#pdf-next"><code>next</code></a> function, the table <code>t</code>, and <b>nil</b>,
+so that the construction
+
+<pre>
+     for k,v in pairs(t) do <em>body</em> end
+</pre><p>
+will iterate over all key&ndash;value pairs of table <code>t</code>.
+
+
+<p>
+See function <a href="#pdf-next"><code>next</code></a> for the caveats of modifying
+the table during its traversal.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-pcall"><code>pcall (f, arg1, &middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Calls function <code>f</code> with
+the given arguments in <em>protected mode</em>.
+This means that any error inside&nbsp;<code>f</code> is not propagated;
+instead, <code>pcall</code> catches the error
+and returns a status code.
+Its first result is the status code (a boolean),
+which is true if the call succeeds without errors.
+In such case, <code>pcall</code> also returns all results from the call,
+after this first result.
+In case of any error, <code>pcall</code> returns <b>false</b> plus the error message.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-print"><code>print (&middot;&middot;&middot;)</code></a></h3>
+Receives any number of arguments,
+and prints their values to <code>stdout</code>,
+using the <a href="#pdf-tostring"><code>tostring</code></a> function to convert them to strings.
+<code>print</code> is not intended for formatted output,
+but only as a quick way to show a value,
+typically for debugging.
+For formatted output, use <a href="#pdf-string.format"><code>string.format</code></a>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-rawequal"><code>rawequal (v1, v2)</code></a></h3>
+Checks whether <code>v1</code> is equal to <code>v2</code>,
+without invoking any metamethod.
+Returns a boolean.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-rawget"><code>rawget (table, index)</code></a></h3>
+Gets the real value of <code>table[index]</code>,
+without invoking any metamethod.
+<code>table</code> must be a table;
+<code>index</code> may be any value.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-rawset"><code>rawset (table, index, value)</code></a></h3>
+Sets the real value of <code>table[index]</code> to <code>value</code>,
+without invoking any metamethod.
+<code>table</code> must be a table,
+<code>index</code> any value different from <b>nil</b>,
+and <code>value</code> any Lua value.
+
+
+<p>
+This function returns <code>table</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-select"><code>select (index, &middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+If <code>index</code> is a number,
+returns all arguments after argument number <code>index</code>.
+Otherwise, <code>index</code> must be the string <code>"#"</code>,
+and <code>select</code> returns the total number of extra arguments it received.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-setfenv"><code>setfenv (f, table)</code></a></h3>
+
+
+<p>
+Sets the environment to be used by the given function.
+<code>f</code> can be a Lua function or a number
+that specifies the function at that stack level:
+Level&nbsp;1 is the function calling <code>setfenv</code>.
+<code>setfenv</code> returns the given function.
+
+
+<p>
+As a special case, when <code>f</code> is 0 <code>setfenv</code> changes
+the environment of the running thread.
+In this case, <code>setfenv</code> returns no values.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-setmetatable"><code>setmetatable (table, metatable)</code></a></h3>
+
+
+<p>
+Sets the metatable for the given table.
+(You cannot change the metatable of other types from Lua, only from&nbsp;C.)
+If <code>metatable</code> is <b>nil</b>,
+removes the metatable of the given table.
+If the original metatable has a <code>"__metatable"</code> field,
+raises an error.
+
+
+<p>
+This function returns <code>table</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-tonumber"><code>tonumber (e [, base])</code></a></h3>
+Tries to convert its argument to a number.
+If the argument is already a number or a string convertible
+to a number, then <code>tonumber</code> returns this number;
+otherwise, it returns <b>nil</b>.
+
+
+<p>
+An optional argument specifies the base to interpret the numeral.
+The base may be any integer between 2 and 36, inclusive.
+In bases above&nbsp;10, the letter '<code>A</code>' (in either upper or lower case)
+represents&nbsp;10, '<code>B</code>' represents&nbsp;11, and so forth,
+with '<code>Z</code>' representing 35.
+In base 10 (the default), the number can have a decimal part,
+as well as an optional exponent part (see <a href="#2.1">&sect;2.1</a>).
+In other bases, only unsigned integers are accepted.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-tostring"><code>tostring (e)</code></a></h3>
+Receives an argument of any type and
+converts it to a string in a reasonable format.
+For complete control of how numbers are converted,
+use <a href="#pdf-string.format"><code>string.format</code></a>.
+
+
+<p>
+If the metatable of <code>e</code> has a <code>"__tostring"</code> field,
+then <code>tostring</code> calls the corresponding value
+with <code>e</code> as argument,
+and uses the result of the call as its result.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-type"><code>type (v)</code></a></h3>
+Returns the type of its only argument, coded as a string.
+The possible results of this function are
+"<code>nil</code>" (a string, not the value <b>nil</b>),
+"<code>number</code>",
+"<code>string</code>",
+"<code>boolean</code>",
+"<code>table</code>",
+"<code>function</code>",
+"<code>thread</code>",
+and "<code>userdata</code>".
+
+
+
+
+<p>
+<hr><h3><a name="pdf-unpack"><code>unpack (list [, i [, j]])</code></a></h3>
+Returns the elements from the given table.
+This function is equivalent to
+
+<pre>
+     return list[i], list[i+1], &middot;&middot;&middot;, list[j]
+</pre><p>
+except that the above code can be written only for a fixed number
+of elements.
+By default, <code>i</code> is&nbsp;1 and <code>j</code> is the length of the list,
+as defined by the length operator (see <a href="#2.5.5">&sect;2.5.5</a>).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-_VERSION"><code>_VERSION</code></a></h3>
+A global variable (not a function) that
+holds a string containing the current interpreter version.
+The current contents of this variable is "<code>Lua 5.1</code>".
+
+
+
+
+<p>
+<hr><h3><a name="pdf-xpcall"><code>xpcall (f, err)</code></a></h3>
+
+
+<p>
+This function is similar to <a href="#pdf-pcall"><code>pcall</code></a>,
+except that you can set a new error handler.
+
+
+<p>
+<code>xpcall</code> calls function <code>f</code> in protected mode,
+using <code>err</code> as the error handler.
+Any error inside <code>f</code> is not propagated;
+instead, <code>xpcall</code> catches the error,
+calls the <code>err</code> function with the original error object,
+and returns a status code.
+Its first result is the status code (a boolean),
+which is true if the call succeeds without errors.
+In this case, <code>xpcall</code> also returns all results from the call,
+after this first result.
+In case of any error,
+<code>xpcall</code> returns <b>false</b> plus the result from <code>err</code>.
+
+
+
+
+
+
+
+<h2>5.2 - <a name="5.2">Coroutine Manipulation</a></h2>
+
+<p>
+The operations related to coroutines comprise a sub-library of
+the basic library and come inside the table <a name="pdf-coroutine"><code>coroutine</code></a>.
+See <a href="#2.11">&sect;2.11</a> for a general description of coroutines.
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.create"><code>coroutine.create (f)</code></a></h3>
+
+
+<p>
+Creates a new coroutine, with body <code>f</code>.
+<code>f</code> must be a Lua function.
+Returns this new coroutine,
+an object with type <code>"thread"</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.resume"><code>coroutine.resume (co [, val1, &middot;&middot;&middot;])</code></a></h3>
+
+
+<p>
+Starts or continues the execution of coroutine <code>co</code>.
+The first time you resume a coroutine,
+it starts running its body.
+The values <code>val1</code>, &middot;&middot;&middot; are passed
+as the arguments to the body function.
+If the coroutine has yielded,
+<code>resume</code> restarts it;
+the values <code>val1</code>, &middot;&middot;&middot; are passed
+as the results from the yield.
+
+
+<p>
+If the coroutine runs without any errors,
+<code>resume</code> returns <b>true</b> plus any values passed to <code>yield</code>
+(if the coroutine yields) or any values returned by the body function
+(if the coroutine terminates).
+If there is any error,
+<code>resume</code> returns <b>false</b> plus the error message.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.running"><code>coroutine.running ()</code></a></h3>
+
+
+<p>
+Returns the running coroutine,
+or <b>nil</b> when called by the main thread.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.status"><code>coroutine.status (co)</code></a></h3>
+
+
+<p>
+Returns the status of coroutine <code>co</code>, as a string:
+<code>"running"</code>,
+if the coroutine is running (that is, it called <code>status</code>);
+<code>"suspended"</code>, if the coroutine is suspended in a call to <code>yield</code>,
+or if it has not started running yet;
+<code>"normal"</code> if the coroutine is active but not running
+(that is, it has resumed another coroutine);
+and <code>"dead"</code> if the coroutine has finished its body function,
+or if it has stopped with an error.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.wrap"><code>coroutine.wrap (f)</code></a></h3>
+
+
+<p>
+Creates a new coroutine, with body <code>f</code>.
+<code>f</code> must be a Lua function.
+Returns a function that resumes the coroutine each time it is called.
+Any arguments passed to the function behave as the
+extra arguments to <code>resume</code>.
+Returns the same values returned by <code>resume</code>,
+except the first boolean.
+In case of error, propagates the error.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-coroutine.yield"><code>coroutine.yield (&middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Suspends the execution of the calling coroutine.
+The coroutine cannot be running a C&nbsp;function,
+a metamethod, or an iterator.
+Any arguments to <code>yield</code> are passed as extra results to <code>resume</code>.
+
+
+
+
+
+
+
+<h2>5.3 - <a name="5.3">Modules</a></h2>
+
+<p>
+The package library provides basic
+facilities for loading and building modules in Lua.
+It exports two of its functions directly in the global environment:
+<a href="#pdf-require"><code>require</code></a> and <a href="#pdf-module"><code>module</code></a>.
+Everything else is exported in a table <a name="pdf-package"><code>package</code></a>.
+
+
+<p>
+<hr><h3><a name="pdf-module"><code>module (name [, &middot;&middot;&middot;])</code></a></h3>
+
+
+<p>
+Creates a module.
+If there is a table in <code>package.loaded[name]</code>,
+this table is the module.
+Otherwise, if there is a global table <code>t</code> with the given name,
+this table is the module.
+Otherwise creates a new table <code>t</code> and
+sets it as the value of the global <code>name</code> and
+the value of <code>package.loaded[name]</code>.
+This function also initializes <code>t._NAME</code> with the given name,
+<code>t._M</code> with the module (<code>t</code> itself),
+and <code>t._PACKAGE</code> with the package name
+(the full module name minus last component; see below).
+Finally, <code>module</code> sets <code>t</code> as the new environment
+of the current function and the new value of <code>package.loaded[name]</code>,
+so that <a href="#pdf-require"><code>require</code></a> returns <code>t</code>.
+
+
+<p>
+If <code>name</code> is a compound name
+(that is, one with components separated by dots),
+<code>module</code> creates (or reuses, if they already exist)
+tables for each component.
+For instance, if <code>name</code> is <code>a.b.c</code>,
+then <code>module</code> stores the module table in field <code>c</code> of
+field <code>b</code> of global <code>a</code>.
+
+
+<p>
+This function can receive optional <em>options</em> after
+the module name,
+where each option is a function to be applied over the module.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-require"><code>require (modname)</code></a></h3>
+
+
+<p>
+Loads the given module.
+The function starts by looking into the <a href="#pdf-package.loaded"><code>package.loaded</code></a> table
+to determine whether <code>modname</code> is already loaded.
+If it is, then <code>require</code> returns the value stored
+at <code>package.loaded[modname]</code>.
+Otherwise, it tries to find a <em>loader</em> for the module.
+
+
+<p>
+To find a loader,
+<code>require</code> is guided by the <a href="#pdf-package.loaders"><code>package.loaders</code></a> array.
+By changing this array,
+we can change how <code>require</code> looks for a module.
+The following explanation is based on the default configuration
+for <a href="#pdf-package.loaders"><code>package.loaders</code></a>.
+
+
+<p>
+First <code>require</code> queries <code>package.preload[modname]</code>.
+If it has a value,
+this value (which should be a function) is the loader.
+Otherwise <code>require</code> searches for a Lua loader using the
+path stored in <a href="#pdf-package.path"><code>package.path</code></a>.
+If that also fails, it searches for a C&nbsp;loader using the
+path stored in <a href="#pdf-package.cpath"><code>package.cpath</code></a>.
+If that also fails,
+it tries an <em>all-in-one</em> loader (see <a href="#pdf-package.loaders"><code>package.loaders</code></a>).
+
+
+<p>
+Once a loader is found,
+<code>require</code> calls the loader with a single argument, <code>modname</code>.
+If the loader returns any value,
+<code>require</code> assigns the returned value to <code>package.loaded[modname]</code>.
+If the loader returns no value and
+has not assigned any value to <code>package.loaded[modname]</code>,
+then <code>require</code> assigns <b>true</b> to this entry.
+In any case, <code>require</code> returns the
+final value of <code>package.loaded[modname]</code>.
+
+
+<p>
+If there is any error loading or running the module,
+or if it cannot find any loader for the module,
+then <code>require</code> signals an error. 
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.cpath"><code>package.cpath</code></a></h3>
+
+
+<p>
+The path used by <a href="#pdf-require"><code>require</code></a> to search for a C&nbsp;loader.
+
+
+<p>
+Lua initializes the C&nbsp;path <a href="#pdf-package.cpath"><code>package.cpath</code></a> in the same way
+it initializes the Lua path <a href="#pdf-package.path"><code>package.path</code></a>,
+using the environment variable <a name="pdf-LUA_CPATH"><code>LUA_CPATH</code></a>
+or a default path defined in <code>luaconf.h</code>.
+
+
+
+
+<p>
+
+<hr><h3><a name="pdf-package.loaded"><code>package.loaded</code></a></h3>
+
+
+<p>
+A table used by <a href="#pdf-require"><code>require</code></a> to control which
+modules are already loaded.
+When you require a module <code>modname</code> and
+<code>package.loaded[modname]</code> is not false,
+<a href="#pdf-require"><code>require</code></a> simply returns the value stored there.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.loaders"><code>package.loaders</code></a></h3>
+
+
+<p>
+A table used by <a href="#pdf-require"><code>require</code></a> to control how to load modules.
+
+
+<p>
+Each entry in this table is a <em>searcher function</em>.
+When looking for a module,
+<a href="#pdf-require"><code>require</code></a> calls each of these searchers in ascending order,
+with the module name (the argument given to <a href="#pdf-require"><code>require</code></a>) as its
+sole parameter.
+The function can return another function (the module <em>loader</em>)
+or a string explaining why it did not find that module
+(or <b>nil</b> if it has nothing to say).
+Lua initializes this table with four functions.
+
+
+<p>
+The first searcher simply looks for a loader in the
+<a href="#pdf-package.preload"><code>package.preload</code></a> table.
+
+
+<p>
+The second searcher looks for a loader as a Lua library,
+using the path stored at <a href="#pdf-package.path"><code>package.path</code></a>.
+A path is a sequence of <em>templates</em> separated by semicolons.
+For each template,
+the searcher will change each interrogation
+mark in the template by <code>filename</code>,
+which is the module name with each dot replaced by a
+"directory separator" (such as "<code>/</code>" in Unix);
+then it will try to open the resulting file name.
+So, for instance, if the Lua path is the string
+
+<pre>
+     "./?.lua;./?.lc;/usr/local/?/init.lua"
+</pre><p>
+the search for a Lua file for module <code>foo</code>
+will try to open the files
+<code>./foo.lua</code>, <code>./foo.lc</code>, and
+<code>/usr/local/foo/init.lua</code>, in that order.
+
+
+<p>
+The third searcher looks for a loader as a C&nbsp;library,
+using the path given by the variable <a href="#pdf-package.cpath"><code>package.cpath</code></a>.
+For instance,
+if the C&nbsp;path is the string
+
+<pre>
+     "./?.so;./?.dll;/usr/local/?/init.so"
+</pre><p>
+the searcher for module <code>foo</code>
+will try to open the files <code>./foo.so</code>, <code>./foo.dll</code>,
+and <code>/usr/local/foo/init.so</code>, in that order.
+Once it finds a C&nbsp;library,
+this searcher first uses a dynamic link facility to link the
+application with the library.
+Then it tries to find a C&nbsp;function inside the library to
+be used as the loader.
+The name of this C&nbsp;function is the string "<code>luaopen_</code>"
+concatenated with a copy of the module name where each dot
+is replaced by an underscore.
+Moreover, if the module name has a hyphen,
+its prefix up to (and including) the first hyphen is removed.
+For instance, if the module name is <code>a.v1-b.c</code>,
+the function name will be <code>luaopen_b_c</code>.
+
+
+<p>
+The fourth searcher tries an <em>all-in-one loader</em>.
+It searches the C&nbsp;path for a library for
+the root name of the given module.
+For instance, when requiring <code>a.b.c</code>,
+it will search for a C&nbsp;library for <code>a</code>.
+If found, it looks into it for an open function for
+the submodule;
+in our example, that would be <code>luaopen_a_b_c</code>.
+With this facility, a package can pack several C&nbsp;submodules
+into one single library,
+with each submodule keeping its original open function.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.loadlib"><code>package.loadlib (libname, funcname)</code></a></h3>
+
+
+<p>
+Dynamically links the host program with the C&nbsp;library <code>libname</code>.
+Inside this library, looks for a function <code>funcname</code>
+and returns this function as a C&nbsp;function.
+(So, <code>funcname</code> must follow the protocol (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>)).
+
+
+<p>
+This is a low-level function.
+It completely bypasses the package and module system.
+Unlike <a href="#pdf-require"><code>require</code></a>,
+it does not perform any path searching and
+does not automatically adds extensions.
+<code>libname</code> must be the complete file name of the C&nbsp;library,
+including if necessary a path and extension.
+<code>funcname</code> must be the exact name exported by the C&nbsp;library
+(which may depend on the C&nbsp;compiler and linker used).
+
+
+<p>
+This function is not supported by ANSI C.
+As such, it is only available on some platforms
+(Windows, Linux, Mac OS X, Solaris, BSD,
+plus other Unix systems that support the <code>dlfcn</code> standard).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.path"><code>package.path</code></a></h3>
+
+
+<p>
+The path used by <a href="#pdf-require"><code>require</code></a> to search for a Lua loader.
+
+
+<p>
+At start-up, Lua initializes this variable with
+the value of the environment variable <a name="pdf-LUA_PATH"><code>LUA_PATH</code></a> or
+with a default path defined in <code>luaconf.h</code>,
+if the environment variable is not defined.
+Any "<code>;;</code>" in the value of the environment variable
+is replaced by the default path.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.preload"><code>package.preload</code></a></h3>
+
+
+<p>
+A table to store loaders for specific modules
+(see <a href="#pdf-require"><code>require</code></a>).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-package.seeall"><code>package.seeall (module)</code></a></h3>
+
+
+<p>
+Sets a metatable for <code>module</code> with
+its <code>__index</code> field referring to the global environment,
+so that this module inherits values
+from the global environment.
+To be used as an option to function <a href="#pdf-module"><code>module</code></a>.
+
+
+
+
+
+
+
+<h2>5.4 - <a name="5.4">String Manipulation</a></h2>
+
+<p>
+This library provides generic functions for string manipulation,
+such as finding and extracting substrings, and pattern matching.
+When indexing a string in Lua, the first character is at position&nbsp;1
+(not at&nbsp;0, as in C).
+Indices are allowed to be negative and are interpreted as indexing backwards,
+from the end of the string.
+Thus, the last character is at position -1, and so on.
+
+
+<p>
+The string library provides all its functions inside the table
+<a name="pdf-string"><code>string</code></a>.
+It also sets a metatable for strings
+where the <code>__index</code> field points to the <code>string</code> table.
+Therefore, you can use the string functions in object-oriented style.
+For instance, <code>string.byte(s, i)</code>
+can be written as <code>s:byte(i)</code>.
+
+
+<p>
+The string library assumes one-byte character encodings.
+
+
+<p>
+<hr><h3><a name="pdf-string.byte"><code>string.byte (s [, i [, j]])</code></a></h3>
+Returns the internal numerical codes of the characters <code>s[i]</code>,
+<code>s[i+1]</code>, &middot;&middot;&middot;, <code>s[j]</code>.
+The default value for <code>i</code> is&nbsp;1;
+the default value for <code>j</code> is&nbsp;<code>i</code>.
+
+
+<p>
+Note that numerical codes are not necessarily portable across platforms.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.char"><code>string.char (&middot;&middot;&middot;)</code></a></h3>
+Receives zero or more integers.
+Returns a string with length equal to the number of arguments,
+in which each character has the internal numerical code equal
+to its corresponding argument.
+
+
+<p>
+Note that numerical codes are not necessarily portable across platforms.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.dump"><code>string.dump (function)</code></a></h3>
+
+
+<p>
+Returns a string containing a binary representation of the given function,
+so that a later <a href="#pdf-loadstring"><code>loadstring</code></a> on this string returns
+a copy of the function.
+<code>function</code> must be a Lua function without upvalues.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.find"><code>string.find (s, pattern [, init [, plain]])</code></a></h3>
+Looks for the first match of
+<code>pattern</code> in the string <code>s</code>.
+If it finds a match, then <code>find</code> returns the indices of&nbsp;<code>s</code>
+where this occurrence starts and ends;
+otherwise, it returns <b>nil</b>.
+A third, optional numerical argument <code>init</code> specifies
+where to start the search;
+its default value is&nbsp;1 and can be negative.
+A value of <b>true</b> as a fourth, optional argument <code>plain</code>
+turns off the pattern matching facilities,
+so the function does a plain "find substring" operation,
+with no characters in <code>pattern</code> being considered "magic".
+Note that if <code>plain</code> is given, then <code>init</code> must be given as well.
+
+
+<p>
+If the pattern has captures,
+then in a successful match
+the captured values are also returned,
+after the two indices.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.format"><code>string.format (formatstring, &middot;&middot;&middot;)</code></a></h3>
+Returns a formatted version of its variable number of arguments
+following the description given in its first argument (which must be a string).
+The format string follows the same rules as the <code>printf</code> family of
+standard C&nbsp;functions.
+The only differences are that the options/modifiers
+<code>*</code>, <code>l</code>, <code>L</code>, <code>n</code>, <code>p</code>,
+and <code>h</code> are not supported
+and that there is an extra option, <code>q</code>.
+The <code>q</code> option formats a string in a form suitable to be safely read
+back by the Lua interpreter:
+the string is written between double quotes,
+and all double quotes, newlines, embedded zeros,
+and backslashes in the string
+are correctly escaped when written.
+For instance, the call
+
+<pre>
+     string.format('%q', 'a string with "quotes" and \n new line')
+</pre><p>
+will produce the string:
+
+<pre>
+     "a string with \"quotes\" and \
+      new line"
+</pre>
+
+<p>
+The options <code>c</code>, <code>d</code>, <code>E</code>, <code>e</code>, <code>f</code>,
+<code>g</code>, <code>G</code>, <code>i</code>, <code>o</code>, <code>u</code>, <code>X</code>, and <code>x</code> all
+expect a number as argument,
+whereas <code>q</code> and <code>s</code> expect a string.
+
+
+<p>
+This function does not accept string values
+containing embedded zeros,
+except as arguments to the <code>q</code> option.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.gmatch"><code>string.gmatch (s, pattern)</code></a></h3>
+Returns an iterator function that,
+each time it is called,
+returns the next captures from <code>pattern</code> over string <code>s</code>.
+If <code>pattern</code> specifies no captures,
+then the whole match is produced in each call.
+
+
+<p>
+As an example, the following loop
+
+<pre>
+     s = "hello world from Lua"
+     for w in string.gmatch(s, "%a+") do
+       print(w)
+     end
+</pre><p>
+will iterate over all the words from string <code>s</code>,
+printing one per line.
+The next example collects all pairs <code>key=value</code> from the
+given string into a table:
+
+<pre>
+     t = {}
+     s = "from=world, to=Lua"
+     for k, v in string.gmatch(s, "(%w+)=(%w+)") do
+       t[k] = v
+     end
+</pre>
+
+<p>
+For this function, a '<code>^</code>' at the start of a pattern does not
+work as an anchor, as this would prevent the iteration.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.gsub"><code>string.gsub (s, pattern, repl [, n])</code></a></h3>
+Returns a copy of <code>s</code>
+in which all (or the first <code>n</code>, if given)
+occurrences of the <code>pattern</code> have been
+replaced by a replacement string specified by <code>repl</code>,
+which can be a string, a table, or a function.
+<code>gsub</code> also returns, as its second value,
+the total number of matches that occurred.
+
+
+<p>
+If <code>repl</code> is a string, then its value is used for replacement.
+The character&nbsp;<code>%</code> works as an escape character:
+any sequence in <code>repl</code> of the form <code>%<em>n</em></code>,
+with <em>n</em> between 1 and 9,
+stands for the value of the <em>n</em>-th captured substring (see below).
+The sequence <code>%0</code> stands for the whole match.
+The sequence <code>%%</code> stands for a single&nbsp;<code>%</code>.
+
+
+<p>
+If <code>repl</code> is a table, then the table is queried for every match,
+using the first capture as the key;
+if the pattern specifies no captures,
+then the whole match is used as the key.
+
+
+<p>
+If <code>repl</code> is a function, then this function is called every time a
+match occurs, with all captured substrings passed as arguments,
+in order;
+if the pattern specifies no captures,
+then the whole match is passed as a sole argument.
+
+
+<p>
+If the value returned by the table query or by the function call
+is a string or a number,
+then it is used as the replacement string;
+otherwise, if it is <b>false</b> or <b>nil</b>,
+then there is no replacement
+(that is, the original match is kept in the string).
+
+
+<p>
+Here are some examples:
+
+<pre>
+     x = string.gsub("hello world", "(%w+)", "%1 %1")
+     --&gt; x="hello hello world world"
+     
+     x = string.gsub("hello world", "%w+", "%0 %0", 1)
+     --&gt; x="hello hello world"
+     
+     x = string.gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
+     --&gt; x="world hello Lua from"
+     
+     x = string.gsub("home = $HOME, user = $USER", "%$(%w+)", os.getenv)
+     --&gt; x="home = /home/roberto, user = roberto"
+     
+     x = string.gsub("4+5 = $return 4+5$", "%$(.-)%$", function (s)
+           return loadstring(s)()
+         end)
+     --&gt; x="4+5 = 9"
+     
+     local t = {name="lua", version="5.1"}
+     x = string.gsub("$name-$version.tar.gz", "%$(%w+)", t)
+     --&gt; x="lua-5.1.tar.gz"
+</pre>
+
+
+
+<p>
+<hr><h3><a name="pdf-string.len"><code>string.len (s)</code></a></h3>
+Receives a string and returns its length.
+The empty string <code>""</code> has length 0.
+Embedded zeros are counted,
+so <code>"a\000bc\000"</code> has length 5.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.lower"><code>string.lower (s)</code></a></h3>
+Receives a string and returns a copy of this string with all
+uppercase letters changed to lowercase.
+All other characters are left unchanged.
+The definition of what an uppercase letter is depends on the current locale.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.match"><code>string.match (s, pattern [, init])</code></a></h3>
+Looks for the first <em>match</em> of
+<code>pattern</code> in the string <code>s</code>.
+If it finds one, then <code>match</code> returns
+the captures from the pattern;
+otherwise it returns <b>nil</b>.
+If <code>pattern</code> specifies no captures,
+then the whole match is returned.
+A third, optional numerical argument <code>init</code> specifies
+where to start the search;
+its default value is&nbsp;1 and can be negative.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.rep"><code>string.rep (s, n)</code></a></h3>
+Returns a string that is the concatenation of <code>n</code> copies of
+the string <code>s</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.reverse"><code>string.reverse (s)</code></a></h3>
+Returns a string that is the string <code>s</code> reversed.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.sub"><code>string.sub (s, i [, j])</code></a></h3>
+Returns the substring of <code>s</code> that
+starts at <code>i</code>  and continues until <code>j</code>;
+<code>i</code> and <code>j</code> can be negative.
+If <code>j</code> is absent, then it is assumed to be equal to -1
+(which is the same as the string length).
+In particular,
+the call <code>string.sub(s,1,j)</code> returns a prefix of <code>s</code>
+with length <code>j</code>,
+and <code>string.sub(s, -i)</code> returns a suffix of <code>s</code>
+with length <code>i</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-string.upper"><code>string.upper (s)</code></a></h3>
+Receives a string and returns a copy of this string with all
+lowercase letters changed to uppercase.
+All other characters are left unchanged.
+The definition of what a lowercase letter is depends on the current locale.
+
+
+
+<h3>5.4.1 - <a name="5.4.1">Patterns</a></h3>
+
+
+<h4>Character Class:</h4><p>
+A <em>character class</em> is used to represent a set of characters.
+The following combinations are allowed in describing a character class:
+
+<ul>
+
+<li><b><em>x</em>:</b>
+(where <em>x</em> is not one of the <em>magic characters</em>
+<code>^$()%.[]*+-?</code>)
+represents the character <em>x</em> itself.
+</li>
+
+<li><b><code>.</code>:</b> (a dot) represents all characters.</li>
+
+<li><b><code>%a</code>:</b> represents all letters.</li>
+
+<li><b><code>%c</code>:</b> represents all control characters.</li>
+
+<li><b><code>%d</code>:</b> represents all digits.</li>
+
+<li><b><code>%l</code>:</b> represents all lowercase letters.</li>
+
+<li><b><code>%p</code>:</b> represents all punctuation characters.</li>
+
+<li><b><code>%s</code>:</b> represents all space characters.</li>
+
+<li><b><code>%u</code>:</b> represents all uppercase letters.</li>
+
+<li><b><code>%w</code>:</b> represents all alphanumeric characters.</li>
+
+<li><b><code>%x</code>:</b> represents all hexadecimal digits.</li>
+
+<li><b><code>%z</code>:</b> represents the character with representation 0.</li>
+
+<li><b><code>%<em>x</em></code>:</b> (where <em>x</em> is any non-alphanumeric character)
+represents the character <em>x</em>.
+This is the standard way to escape the magic characters.
+Any punctuation character (even the non magic)
+can be preceded by a '<code>%</code>'
+when used to represent itself in a pattern.
+</li>
+
+<li><b><code>[<em>set</em>]</code>:</b>
+represents the class which is the union of all
+characters in <em>set</em>.
+A range of characters can be specified by
+separating the end characters of the range with a '<code>-</code>'.
+All classes <code>%</code><em>x</em> described above can also be used as
+components in <em>set</em>.
+All other characters in <em>set</em> represent themselves.
+For example, <code>[%w_]</code> (or <code>[_%w]</code>)
+represents all alphanumeric characters plus the underscore,
+<code>[0-7]</code> represents the octal digits,
+and <code>[0-7%l%-]</code> represents the octal digits plus
+the lowercase letters plus the '<code>-</code>' character.
+
+
+<p>
+The interaction between ranges and classes is not defined.
+Therefore, patterns like <code>[%a-z]</code> or <code>[a-%%]</code>
+have no meaning.
+</li>
+
+<li><b><code>[^<em>set</em>]</code>:</b>
+represents the complement of <em>set</em>,
+where <em>set</em> is interpreted as above.
+</li>
+
+</ul><p>
+For all classes represented by single letters (<code>%a</code>, <code>%c</code>, etc.),
+the corresponding uppercase letter represents the complement of the class.
+For instance, <code>%S</code> represents all non-space characters.
+
+
+<p>
+The definitions of letter, space, and other character groups
+depend on the current locale.
+In particular, the class <code>[a-z]</code> may not be equivalent to <code>%l</code>.
+
+
+
+
+
+<h4>Pattern Item:</h4><p>
+A <em>pattern item</em> can be
+
+<ul>
+
+<li>
+a single character class,
+which matches any single character in the class;
+</li>
+
+<li>
+a single character class followed by '<code>*</code>',
+which matches 0 or more repetitions of characters in the class.
+These repetition items will always match the longest possible sequence;
+</li>
+
+<li>
+a single character class followed by '<code>+</code>',
+which matches 1 or more repetitions of characters in the class.
+These repetition items will always match the longest possible sequence;
+</li>
+
+<li>
+a single character class followed by '<code>-</code>',
+which also matches 0 or more repetitions of characters in the class.
+Unlike '<code>*</code>',
+these repetition items will always match the <em>shortest</em> possible sequence;
+</li>
+
+<li>
+a single character class followed by '<code>?</code>',
+which matches 0 or 1 occurrence of a character in the class;
+</li>
+
+<li>
+<code>%<em>n</em></code>, for <em>n</em> between 1 and 9;
+such item matches a substring equal to the <em>n</em>-th captured string
+(see below);
+</li>
+
+<li>
+<code>%b<em>xy</em></code>, where <em>x</em> and <em>y</em> are two distinct characters;
+such item matches strings that start with&nbsp;<em>x</em>, end with&nbsp;<em>y</em>,
+and where the <em>x</em> and <em>y</em> are <em>balanced</em>.
+This means that, if one reads the string from left to right,
+counting <em>+1</em> for an <em>x</em> and <em>-1</em> for a <em>y</em>,
+the ending <em>y</em> is the first <em>y</em> where the count reaches 0.
+For instance, the item <code>%b()</code> matches expressions with
+balanced parentheses.
+</li>
+
+</ul>
+
+
+
+
+<h4>Pattern:</h4><p>
+A <em>pattern</em> is a sequence of pattern items.
+A '<code>^</code>' at the beginning of a pattern anchors the match at the
+beginning of the subject string.
+A '<code>$</code>' at the end of a pattern anchors the match at the
+end of the subject string.
+At other positions,
+'<code>^</code>' and '<code>$</code>' have no special meaning and represent themselves.
+
+
+
+
+
+<h4>Captures:</h4><p>
+A pattern can contain sub-patterns enclosed in parentheses;
+they describe <em>captures</em>.
+When a match succeeds, the substrings of the subject string
+that match captures are stored (<em>captured</em>) for future use.
+Captures are numbered according to their left parentheses.
+For instance, in the pattern <code>"(a*(.)%w(%s*))"</code>,
+the part of the string matching <code>"a*(.)%w(%s*)"</code> is
+stored as the first capture (and therefore has number&nbsp;1);
+the character matching "<code>.</code>" is captured with number&nbsp;2,
+and the part matching "<code>%s*</code>" has number&nbsp;3.
+
+
+<p>
+As a special case, the empty capture <code>()</code> captures
+the current string position (a number).
+For instance, if we apply the pattern <code>"()aa()"</code> on the
+string <code>"flaaap"</code>, there will be two captures: 3&nbsp;and&nbsp;5.
+
+
+<p>
+A pattern cannot contain embedded zeros.  Use <code>%z</code> instead.
+
+
+
+
+
+
+
+
+
+
+
+<h2>5.5 - <a name="5.5">Table Manipulation</a></h2><p>
+This library provides generic functions for table manipulation.
+It provides all its functions inside the table <a name="pdf-table"><code>table</code></a>.
+
+
+<p>
+Most functions in the table library assume that the table
+represents an array or a list.
+For these functions, when we talk about the "length" of a table
+we mean the result of the length operator.
+
+
+<p>
+<hr><h3><a name="pdf-table.concat"><code>table.concat (table [, sep [, i [, j]]])</code></a></h3>
+Given an array where all elements are strings or numbers,
+returns <code>table[i]..sep..table[i+1] &middot;&middot;&middot; sep..table[j]</code>.
+The default value for <code>sep</code> is the empty string,
+the default for <code>i</code> is 1,
+and the default for <code>j</code> is the length of the table.
+If <code>i</code> is greater than <code>j</code>, returns the empty string.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-table.insert"><code>table.insert (table, [pos,] value)</code></a></h3>
+
+
+<p>
+Inserts element <code>value</code> at position <code>pos</code> in <code>table</code>,
+shifting up other elements to open space, if necessary.
+The default value for <code>pos</code> is <code>n+1</code>,
+where <code>n</code> is the length of the table (see <a href="#2.5.5">&sect;2.5.5</a>),
+so that a call <code>table.insert(t,x)</code> inserts <code>x</code> at the end
+of table <code>t</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-table.maxn"><code>table.maxn (table)</code></a></h3>
+
+
+<p>
+Returns the largest positive numerical index of the given table,
+or zero if the table has no positive numerical indices.
+(To do its job this function does a linear traversal of
+the whole table.) 
+
+
+
+
+<p>
+<hr><h3><a name="pdf-table.remove"><code>table.remove (table [, pos])</code></a></h3>
+
+
+<p>
+Removes from <code>table</code> the element at position <code>pos</code>,
+shifting down other elements to close the space, if necessary.
+Returns the value of the removed element.
+The default value for <code>pos</code> is <code>n</code>,
+where <code>n</code> is the length of the table,
+so that a call <code>table.remove(t)</code> removes the last element
+of table <code>t</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-table.sort"><code>table.sort (table [, comp])</code></a></h3>
+Sorts table elements in a given order, <em>in-place</em>,
+from <code>table[1]</code> to <code>table[n]</code>,
+where <code>n</code> is the length of the table.
+If <code>comp</code> is given,
+then it must be a function that receives two table elements,
+and returns true
+when the first is less than the second
+(so that <code>not comp(a[i+1],a[i])</code> will be true after the sort).
+If <code>comp</code> is not given,
+then the standard Lua operator <code>&lt;</code> is used instead.
+
+
+<p>
+The sort algorithm is not stable;
+that is, elements considered equal by the given order
+may have their relative positions changed by the sort.
+
+
+
+
+
+
+
+<h2>5.6 - <a name="5.6">Mathematical Functions</a></h2>
+
+<p>
+This library is an interface to the standard C&nbsp;math library.
+It provides all its functions inside the table <a name="pdf-math"><code>math</code></a>.
+
+
+<p>
+<hr><h3><a name="pdf-math.abs"><code>math.abs (x)</code></a></h3>
+
+
+<p>
+Returns the absolute value of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.acos"><code>math.acos (x)</code></a></h3>
+
+
+<p>
+Returns the arc cosine of <code>x</code> (in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.asin"><code>math.asin (x)</code></a></h3>
+
+
+<p>
+Returns the arc sine of <code>x</code> (in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.atan"><code>math.atan (x)</code></a></h3>
+
+
+<p>
+Returns the arc tangent of <code>x</code> (in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.atan2"><code>math.atan2 (y, x)</code></a></h3>
+
+
+<p>
+Returns the arc tangent of <code>y/x</code> (in radians),
+but uses the signs of both parameters to find the
+quadrant of the result.
+(It also handles correctly the case of <code>x</code> being zero.)
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.ceil"><code>math.ceil (x)</code></a></h3>
+
+
+<p>
+Returns the smallest integer larger than or equal to <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.cos"><code>math.cos (x)</code></a></h3>
+
+
+<p>
+Returns the cosine of <code>x</code> (assumed to be in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.cosh"><code>math.cosh (x)</code></a></h3>
+
+
+<p>
+Returns the hyperbolic cosine of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.deg"><code>math.deg (x)</code></a></h3>
+
+
+<p>
+Returns the angle <code>x</code> (given in radians) in degrees.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.exp"><code>math.exp (x)</code></a></h3>
+
+
+<p>
+Returns the value <em>e<sup>x</sup></em>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.floor"><code>math.floor (x)</code></a></h3>
+
+
+<p>
+Returns the largest integer smaller than or equal to <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.fmod"><code>math.fmod (x, y)</code></a></h3>
+
+
+<p>
+Returns the remainder of the division of <code>x</code> by <code>y</code>
+that rounds the quotient towards zero.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.frexp"><code>math.frexp (x)</code></a></h3>
+
+
+<p>
+Returns <code>m</code> and <code>e</code> such that <em>x = m2<sup>e</sup></em>,
+<code>e</code> is an integer and the absolute value of <code>m</code> is
+in the range <em>[0.5, 1)</em>
+(or zero when <code>x</code> is zero).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.huge"><code>math.huge</code></a></h3>
+
+
+<p>
+The value <code>HUGE_VAL</code>,
+a value larger than or equal to any other numerical value.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.ldexp"><code>math.ldexp (m, e)</code></a></h3>
+
+
+<p>
+Returns <em>m2<sup>e</sup></em> (<code>e</code> should be an integer).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.log"><code>math.log (x)</code></a></h3>
+
+
+<p>
+Returns the natural logarithm of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.log10"><code>math.log10 (x)</code></a></h3>
+
+
+<p>
+Returns the base-10 logarithm of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.max"><code>math.max (x, &middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Returns the maximum value among its arguments.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.min"><code>math.min (x, &middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Returns the minimum value among its arguments.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.modf"><code>math.modf (x)</code></a></h3>
+
+
+<p>
+Returns two numbers,
+the integral part of <code>x</code> and the fractional part of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.pi"><code>math.pi</code></a></h3>
+
+
+<p>
+The value of <em>pi</em>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.pow"><code>math.pow (x, y)</code></a></h3>
+
+
+<p>
+Returns <em>x<sup>y</sup></em>.
+(You can also use the expression <code>x^y</code> to compute this value.)
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.rad"><code>math.rad (x)</code></a></h3>
+
+
+<p>
+Returns the angle <code>x</code> (given in degrees) in radians.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.random"><code>math.random ([m [, n]])</code></a></h3>
+
+
+<p>
+This function is an interface to the simple
+pseudo-random generator function <code>rand</code> provided by ANSI&nbsp;C.
+(No guarantees can be given for its statistical properties.)
+
+
+<p>
+When called without arguments,
+returns a uniform pseudo-random real number
+in the range <em>[0,1)</em>.  
+When called with an integer number <code>m</code>,
+<code>math.random</code> returns
+a uniform pseudo-random integer in the range <em>[1, m]</em>.
+When called with two integer numbers <code>m</code> and <code>n</code>,
+<code>math.random</code> returns a uniform pseudo-random
+integer in the range <em>[m, n]</em>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.randomseed"><code>math.randomseed (x)</code></a></h3>
+
+
+<p>
+Sets <code>x</code> as the "seed"
+for the pseudo-random generator:
+equal seeds produce equal sequences of numbers.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.sin"><code>math.sin (x)</code></a></h3>
+
+
+<p>
+Returns the sine of <code>x</code> (assumed to be in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.sinh"><code>math.sinh (x)</code></a></h3>
+
+
+<p>
+Returns the hyperbolic sine of <code>x</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.sqrt"><code>math.sqrt (x)</code></a></h3>
+
+
+<p>
+Returns the square root of <code>x</code>.
+(You can also use the expression <code>x^0.5</code> to compute this value.)
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.tan"><code>math.tan (x)</code></a></h3>
+
+
+<p>
+Returns the tangent of <code>x</code> (assumed to be in radians).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-math.tanh"><code>math.tanh (x)</code></a></h3>
+
+
+<p>
+Returns the hyperbolic tangent of <code>x</code>.
+
+
+
+
+
+
+
+<h2>5.7 - <a name="5.7">Input and Output Facilities</a></h2>
+
+<p>
+The I/O library provides two different styles for file manipulation.
+The first one uses implicit file descriptors;
+that is, there are operations to set a default input file and a
+default output file,
+and all input/output operations are over these default files.
+The second style uses explicit file descriptors.
+
+
+<p>
+When using implicit file descriptors,
+all operations are supplied by table <a name="pdf-io"><code>io</code></a>.
+When using explicit file descriptors,
+the operation <a href="#pdf-io.open"><code>io.open</code></a> returns a file descriptor
+and then all operations are supplied as methods of the file descriptor.
+
+
+<p>
+The table <code>io</code> also provides
+three predefined file descriptors with their usual meanings from C:
+<a name="pdf-io.stdin"><code>io.stdin</code></a>, <a name="pdf-io.stdout"><code>io.stdout</code></a>, and <a name="pdf-io.stderr"><code>io.stderr</code></a>.
+The I/O library never closes these files.
+
+
+<p>
+Unless otherwise stated,
+all I/O functions return <b>nil</b> on failure
+(plus an error message as a second result and
+a system-dependent error code as a third result)
+and some value different from <b>nil</b> on success.
+
+
+<p>
+<hr><h3><a name="pdf-io.close"><code>io.close ([file])</code></a></h3>
+
+
+<p>
+Equivalent to <code>file:close()</code>.
+Without a <code>file</code>, closes the default output file.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.flush"><code>io.flush ()</code></a></h3>
+
+
+<p>
+Equivalent to <code>file:flush</code> over the default output file.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.input"><code>io.input ([file])</code></a></h3>
+
+
+<p>
+When called with a file name, it opens the named file (in text mode),
+and sets its handle as the default input file.
+When called with a file handle,
+it simply sets this file handle as the default input file.
+When called without parameters,
+it returns the current default input file.
+
+
+<p>
+In case of errors this function raises the error,
+instead of returning an error code.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.lines"><code>io.lines ([filename])</code></a></h3>
+
+
+<p>
+Opens the given file name in read mode
+and returns an iterator function that,
+each time it is called,
+returns a new line from the file.
+Therefore, the construction
+
+<pre>
+     for line in io.lines(filename) do <em>body</em> end
+</pre><p>
+will iterate over all lines of the file.
+When the iterator function detects the end of file,
+it returns <b>nil</b> (to finish the loop) and automatically closes the file.
+
+
+<p>
+The call <code>io.lines()</code> (with no file name) is equivalent
+to <code>io.input():lines()</code>;
+that is, it iterates over the lines of the default input file.
+In this case it does not close the file when the loop ends.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.open"><code>io.open (filename [, mode])</code></a></h3>
+
+
+<p>
+This function opens a file,
+in the mode specified in the string <code>mode</code>.
+It returns a new file handle,
+or, in case of errors, <b>nil</b> plus an error message.
+
+
+<p>
+The <code>mode</code> string can be any of the following:
+
+<ul>
+<li><b>"r":</b> read mode (the default);</li>
+<li><b>"w":</b> write mode;</li>
+<li><b>"a":</b> append mode;</li>
+<li><b>"r+":</b> update mode, all previous data is preserved;</li>
+<li><b>"w+":</b> update mode, all previous data is erased;</li>
+<li><b>"a+":</b> append update mode, previous data is preserved,
+  writing is only allowed at the end of file.</li>
+</ul><p>
+The <code>mode</code> string can also have a '<code>b</code>' at the end,
+which is needed in some systems to open the file in binary mode.
+This string is exactly what is used in the
+standard&nbsp;C function <code>fopen</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.output"><code>io.output ([file])</code></a></h3>
+
+
+<p>
+Similar to <a href="#pdf-io.input"><code>io.input</code></a>, but operates over the default output file.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.popen"><code>io.popen (prog [, mode])</code></a></h3>
+
+
+<p>
+Starts program <code>prog</code> in a separated process and returns
+a file handle that you can use to read data from this program
+(if <code>mode</code> is <code>"r"</code>, the default)
+or to write data to this program
+(if <code>mode</code> is <code>"w"</code>).
+
+
+<p>
+This function is system dependent and is not available
+on all platforms.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.read"><code>io.read (&middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Equivalent to <code>io.input():read</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.tmpfile"><code>io.tmpfile ()</code></a></h3>
+
+
+<p>
+Returns a handle for a temporary file.
+This file is opened in update mode
+and it is automatically removed when the program ends.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.type"><code>io.type (obj)</code></a></h3>
+
+
+<p>
+Checks whether <code>obj</code> is a valid file handle.
+Returns the string <code>"file"</code> if <code>obj</code> is an open file handle,
+<code>"closed file"</code> if <code>obj</code> is a closed file handle,
+or <b>nil</b> if <code>obj</code> is not a file handle.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-io.write"><code>io.write (&middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Equivalent to <code>io.output():write</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:close"><code>file:close ()</code></a></h3>
+
+
+<p>
+Closes <code>file</code>.
+Note that files are automatically closed when
+their handles are garbage collected,
+but that takes an unpredictable amount of time to happen.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:flush"><code>file:flush ()</code></a></h3>
+
+
+<p>
+Saves any written data to <code>file</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:lines"><code>file:lines ()</code></a></h3>
+
+
+<p>
+Returns an iterator function that,
+each time it is called,
+returns a new line from the file.
+Therefore, the construction
+
+<pre>
+     for line in file:lines() do <em>body</em> end
+</pre><p>
+will iterate over all lines of the file.
+(Unlike <a href="#pdf-io.lines"><code>io.lines</code></a>, this function does not close the file
+when the loop ends.)
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:read"><code>file:read (&middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Reads the file <code>file</code>,
+according to the given formats, which specify what to read.
+For each format,
+the function returns a string (or a number) with the characters read,
+or <b>nil</b> if it cannot read data with the specified format.
+When called without formats,
+it uses a default format that reads the entire next line
+(see below).
+
+
+<p>
+The available formats are
+
+<ul>
+
+<li><b>"*n":</b>
+reads a number;
+this is the only format that returns a number instead of a string.
+</li>
+
+<li><b>"*a":</b>
+reads the whole file, starting at the current position.
+On end of file, it returns the empty string.
+</li>
+
+<li><b>"*l":</b>
+reads the next line (skipping the end of line),
+returning <b>nil</b> on end of file.
+This is the default format.
+</li>
+
+<li><b><em>number</em>:</b>
+reads a string with up to this number of characters,
+returning <b>nil</b> on end of file.
+If number is zero,
+it reads nothing and returns an empty string,
+or <b>nil</b> on end of file.
+</li>
+
+</ul>
+
+
+
+<p>
+<hr><h3><a name="pdf-file:seek"><code>file:seek ([whence] [, offset])</code></a></h3>
+
+
+<p>
+Sets and gets the file position,
+measured from the beginning of the file,
+to the position given by <code>offset</code> plus a base
+specified by the string <code>whence</code>, as follows:
+
+<ul>
+<li><b>"set":</b> base is position 0 (beginning of the file);</li>
+<li><b>"cur":</b> base is current position;</li>
+<li><b>"end":</b> base is end of file;</li>
+</ul><p>
+In case of success, function <code>seek</code> returns the final file position,
+measured in bytes from the beginning of the file.
+If this function fails, it returns <b>nil</b>,
+plus a string describing the error.
+
+
+<p>
+The default value for <code>whence</code> is <code>"cur"</code>,
+and for <code>offset</code> is 0.
+Therefore, the call <code>file:seek()</code> returns the current
+file position, without changing it;
+the call <code>file:seek("set")</code> sets the position to the
+beginning of the file (and returns 0);
+and the call <code>file:seek("end")</code> sets the position to the
+end of the file, and returns its size.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:setvbuf"><code>file:setvbuf (mode [, size])</code></a></h3>
+
+
+<p>
+Sets the buffering mode for an output file.
+There are three available modes:
+
+<ul>
+
+<li><b>"no":</b>
+no buffering; the result of any output operation appears immediately.
+</li>
+
+<li><b>"full":</b>
+full buffering; output operation is performed only
+when the buffer is full (or when you explicitly <code>flush</code> the file
+(see <a href="#pdf-io.flush"><code>io.flush</code></a>)).
+</li>
+
+<li><b>"line":</b>
+line buffering; output is buffered until a newline is output
+or there is any input from some special files
+(such as a terminal device).
+</li>
+
+</ul><p>
+For the last two cases, <code>size</code>
+specifies the size of the buffer, in bytes.
+The default is an appropriate size.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-file:write"><code>file:write (&middot;&middot;&middot;)</code></a></h3>
+
+
+<p>
+Writes the value of each of its arguments to
+the <code>file</code>.
+The arguments must be strings or numbers.
+To write other values,
+use <a href="#pdf-tostring"><code>tostring</code></a> or <a href="#pdf-string.format"><code>string.format</code></a> before <code>write</code>.
+
+
+
+
+
+
+
+<h2>5.8 - <a name="5.8">Operating System Facilities</a></h2>
+
+<p>
+This library is implemented through table <a name="pdf-os"><code>os</code></a>.
+
+
+<p>
+<hr><h3><a name="pdf-os.clock"><code>os.clock ()</code></a></h3>
+
+
+<p>
+Returns an approximation of the amount in seconds of CPU time
+used by the program.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.date"><code>os.date ([format [, time]])</code></a></h3>
+
+
+<p>
+Returns a string or a table containing date and time,
+formatted according to the given string <code>format</code>.
+
+
+<p>
+If the <code>time</code> argument is present,
+this is the time to be formatted
+(see the <a href="#pdf-os.time"><code>os.time</code></a> function for a description of this value).
+Otherwise, <code>date</code> formats the current time.
+
+
+<p>
+If <code>format</code> starts with '<code>!</code>',
+then the date is formatted in Coordinated Universal Time.
+After this optional character,
+if <code>format</code> is the string "<code>*t</code>",
+then <code>date</code> returns a table with the following fields:
+<code>year</code> (four digits), <code>month</code> (1--12), <code>day</code> (1--31),
+<code>hour</code> (0--23), <code>min</code> (0--59), <code>sec</code> (0--61),
+<code>wday</code> (weekday, Sunday is&nbsp;1),
+<code>yday</code> (day of the year),
+and <code>isdst</code> (daylight saving flag, a boolean).
+
+
+<p>
+If <code>format</code> is not "<code>*t</code>",
+then <code>date</code> returns the date as a string,
+formatted according to the same rules as the C&nbsp;function <code>strftime</code>.
+
+
+<p>
+When called without arguments,
+<code>date</code> returns a reasonable date and time representation that depends on
+the host system and on the current locale
+(that is, <code>os.date()</code> is equivalent to <code>os.date("%c")</code>).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.difftime"><code>os.difftime (t2, t1)</code></a></h3>
+
+
+<p>
+Returns the number of seconds from time <code>t1</code> to time <code>t2</code>.
+In POSIX, Windows, and some other systems,
+this value is exactly <code>t2</code><em>-</em><code>t1</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.execute"><code>os.execute ([command])</code></a></h3>
+
+
+<p>
+This function is equivalent to the C&nbsp;function <code>system</code>.
+It passes <code>command</code> to be executed by an operating system shell.
+It returns a status code, which is system-dependent.
+If <code>command</code> is absent, then it returns nonzero if a shell is available
+and zero otherwise.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.exit"><code>os.exit ([code])</code></a></h3>
+
+
+<p>
+Calls the C&nbsp;function <code>exit</code>,
+with an optional <code>code</code>,
+to terminate the host program.
+The default value for <code>code</code> is the success code.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.getenv"><code>os.getenv (varname)</code></a></h3>
+
+
+<p>
+Returns the value of the process environment variable <code>varname</code>,
+or <b>nil</b> if the variable is not defined.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.remove"><code>os.remove (filename)</code></a></h3>
+
+
+<p>
+Deletes the file or directory with the given name.
+Directories must be empty to be removed.
+If this function fails, it returns <b>nil</b>,
+plus a string describing the error.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.rename"><code>os.rename (oldname, newname)</code></a></h3>
+
+
+<p>
+Renames file or directory named <code>oldname</code> to <code>newname</code>.
+If this function fails, it returns <b>nil</b>,
+plus a string describing the error.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.setlocale"><code>os.setlocale (locale [, category])</code></a></h3>
+
+
+<p>
+Sets the current locale of the program.
+<code>locale</code> is a string specifying a locale;
+<code>category</code> is an optional string describing which category to change:
+<code>"all"</code>, <code>"collate"</code>, <code>"ctype"</code>,
+<code>"monetary"</code>, <code>"numeric"</code>, or <code>"time"</code>;
+the default category is <code>"all"</code>.
+The function returns the name of the new locale,
+or <b>nil</b> if the request cannot be honored.
+
+
+<p>
+If <code>locale</code> is the empty string,
+the current locale is set to an implementation-defined native locale.
+If <code>locale</code> is the string "<code>C</code>",
+the current locale is set to the standard C locale.
+
+
+<p>
+When called with <b>nil</b> as the first argument,
+this function only returns the name of the current locale
+for the given category.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.time"><code>os.time ([table])</code></a></h3>
+
+
+<p>
+Returns the current time when called without arguments,
+or a time representing the date and time specified by the given table.
+This table must have fields <code>year</code>, <code>month</code>, and <code>day</code>,
+and may have fields <code>hour</code>, <code>min</code>, <code>sec</code>, and <code>isdst</code>
+(for a description of these fields, see the <a href="#pdf-os.date"><code>os.date</code></a> function).
+
+
+<p>
+The returned value is a number, whose meaning depends on your system.
+In POSIX, Windows, and some other systems, this number counts the number
+of seconds since some given start time (the "epoch").
+In other systems, the meaning is not specified,
+and the number returned by <code>time</code> can be used only as an argument to
+<code>date</code> and <code>difftime</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-os.tmpname"><code>os.tmpname ()</code></a></h3>
+
+
+<p>
+Returns a string with a file name that can
+be used for a temporary file.
+The file must be explicitly opened before its use
+and explicitly removed when no longer needed.
+
+
+<p>
+On some systems (POSIX),
+this function also creates a file with that name,
+to avoid security risks.
+(Someone else might create the file with wrong permissions
+in the time between getting the name and creating the file.)
+You still have to open the file to use it
+and to remove it (even if you do not use it).
+
+
+<p>
+When possible,
+you may prefer to use <a href="#pdf-io.tmpfile"><code>io.tmpfile</code></a>,
+which automatically removes the file when the program ends.
+
+
+
+
+
+
+
+<h2>5.9 - <a name="5.9">The Debug Library</a></h2>
+
+<p>
+This library provides
+the functionality of the debug interface to Lua programs.
+You should exert care when using this library.
+The functions provided here should be used exclusively for debugging
+and similar tasks, such as profiling.
+Please resist the temptation to use them as a
+usual programming tool:
+they can be very slow.
+Moreover, several of these functions
+violate some assumptions about Lua code
+(e.g., that variables local to a function
+cannot be accessed from outside or
+that userdata metatables cannot be changed by Lua code)
+and therefore can compromise otherwise secure code.
+
+
+<p>
+All functions in this library are provided
+inside the <a name="pdf-debug"><code>debug</code></a> table.
+All functions that operate over a thread
+have an optional first argument which is the
+thread to operate over.
+The default is always the current thread.
+
+
+<p>
+<hr><h3><a name="pdf-debug.debug"><code>debug.debug ()</code></a></h3>
+
+
+<p>
+Enters an interactive mode with the user,
+running each string that the user enters.
+Using simple commands and other debug facilities,
+the user can inspect global and local variables,
+change their values, evaluate expressions, and so on.
+A line containing only the word <code>cont</code> finishes this function,
+so that the caller continues its execution.
+
+
+<p>
+Note that commands for <code>debug.debug</code> are not lexically nested
+within any function, and so have no direct access to local variables.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getfenv"><code>debug.getfenv (o)</code></a></h3>
+Returns the environment of object <code>o</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.gethook"><code>debug.gethook ([thread])</code></a></h3>
+
+
+<p>
+Returns the current hook settings of the thread, as three values:
+the current hook function, the current hook mask,
+and the current hook count
+(as set by the <a href="#pdf-debug.sethook"><code>debug.sethook</code></a> function).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getinfo"><code>debug.getinfo ([thread,] function [, what])</code></a></h3>
+
+
+<p>
+Returns a table with information about a function.
+You can give the function directly,
+or you can give a number as the value of <code>function</code>,
+which means the function running at level <code>function</code> of the call stack
+of the given thread:
+level&nbsp;0 is the current function (<code>getinfo</code> itself);
+level&nbsp;1 is the function that called <code>getinfo</code>;
+and so on.
+If <code>function</code> is a number larger than the number of active functions,
+then <code>getinfo</code> returns <b>nil</b>.
+
+
+<p>
+The returned table can contain all the fields returned by <a href="#lua_getinfo"><code>lua_getinfo</code></a>,
+with the string <code>what</code> describing which fields to fill in.
+The default for <code>what</code> is to get all information available,
+except the table of valid lines.
+If present,
+the option '<code>f</code>'
+adds a field named <code>func</code> with the function itself.
+If present,
+the option '<code>L</code>'
+adds a field named <code>activelines</code> with the table of
+valid lines.
+
+
+<p>
+For instance, the expression <code>debug.getinfo(1,"n").name</code> returns
+a table with a name for the current function,
+if a reasonable name can be found,
+and the expression <code>debug.getinfo(print)</code>
+returns a table with all available information
+about the <a href="#pdf-print"><code>print</code></a> function.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getlocal"><code>debug.getlocal ([thread,] level, local)</code></a></h3>
+
+
+<p>
+This function returns the name and the value of the local variable
+with index <code>local</code> of the function at level <code>level</code> of the stack.
+(The first parameter or local variable has index&nbsp;1, and so on,
+until the last active local variable.)
+The function returns <b>nil</b> if there is no local
+variable with the given index,
+and raises an error when called with a <code>level</code> out of range.
+(You can call <a href="#pdf-debug.getinfo"><code>debug.getinfo</code></a> to check whether the level is valid.)
+
+
+<p>
+Variable names starting with '<code>(</code>' (open parentheses)
+represent internal variables
+(loop control variables, temporaries, and C&nbsp;function locals).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getmetatable"><code>debug.getmetatable (object)</code></a></h3>
+
+
+<p>
+Returns the metatable of the given <code>object</code>
+or <b>nil</b> if it does not have a metatable.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getregistry"><code>debug.getregistry ()</code></a></h3>
+
+
+<p>
+Returns the registry table (see <a href="#3.5">&sect;3.5</a>).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.getupvalue"><code>debug.getupvalue (func, up)</code></a></h3>
+
+
+<p>
+This function returns the name and the value of the upvalue
+with index <code>up</code> of the function <code>func</code>.
+The function returns <b>nil</b> if there is no upvalue with the given index.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.setfenv"><code>debug.setfenv (object, table)</code></a></h3>
+
+
+<p>
+Sets the environment of the given <code>object</code> to the given <code>table</code>.
+Returns <code>object</code>.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.sethook"><code>debug.sethook ([thread,] hook, mask [, count])</code></a></h3>
+
+
+<p>
+Sets the given function as a hook.
+The string <code>mask</code> and the number <code>count</code> describe
+when the hook will be called.
+The string mask may have the following characters,
+with the given meaning:
+
+<ul>
+<li><b><code>"c"</code>:</b> the hook is called every time Lua calls a function;</li>
+<li><b><code>"r"</code>:</b> the hook is called every time Lua returns from a function;</li>
+<li><b><code>"l"</code>:</b> the hook is called every time Lua enters a new line of code.</li>
+</ul><p>
+With a <code>count</code> different from zero,
+the hook is called after every <code>count</code> instructions.
+
+
+<p>
+When called without arguments,
+<a href="#pdf-debug.sethook"><code>debug.sethook</code></a> turns off the hook.
+
+
+<p>
+When the hook is called, its first parameter is a string
+describing the event that has triggered its call:
+<code>"call"</code>, <code>"return"</code> (or <code>"tail return"</code>,
+when simulating a return from a tail call),
+<code>"line"</code>, and <code>"count"</code>.
+For line events,
+the hook also gets the new line number as its second parameter.
+Inside a hook,
+you can call <code>getinfo</code> with level&nbsp;2 to get more information about
+the running function
+(level&nbsp;0 is the <code>getinfo</code> function,
+and level&nbsp;1 is the hook function),
+unless the event is <code>"tail return"</code>.
+In this case, Lua is only simulating the return,
+and a call to <code>getinfo</code> will return invalid data.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.setlocal"><code>debug.setlocal ([thread,] level, local, value)</code></a></h3>
+
+
+<p>
+This function assigns the value <code>value</code> to the local variable
+with index <code>local</code> of the function at level <code>level</code> of the stack.
+The function returns <b>nil</b> if there is no local
+variable with the given index,
+and raises an error when called with a <code>level</code> out of range.
+(You can call <code>getinfo</code> to check whether the level is valid.)
+Otherwise, it returns the name of the local variable.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.setmetatable"><code>debug.setmetatable (object, table)</code></a></h3>
+
+
+<p>
+Sets the metatable for the given <code>object</code> to the given <code>table</code>
+(which can be <b>nil</b>).
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.setupvalue"><code>debug.setupvalue (func, up, value)</code></a></h3>
+
+
+<p>
+This function assigns the value <code>value</code> to the upvalue
+with index <code>up</code> of the function <code>func</code>.
+The function returns <b>nil</b> if there is no upvalue
+with the given index.
+Otherwise, it returns the name of the upvalue.
+
+
+
+
+<p>
+<hr><h3><a name="pdf-debug.traceback"><code>debug.traceback ([thread,] [message [, level]])</code></a></h3>
+
+
+<p>
+Returns a string with a traceback of the call stack.
+An optional <code>message</code> string is appended
+at the beginning of the traceback.
+An optional <code>level</code> number tells at which level
+to start the traceback
+(default is 1, the function calling <code>traceback</code>).
+
+
+
+
+
+
+
+<h1>6 - <a name="6">Lua Stand-alone</a></h1>
+
+<p>
+Although Lua has been designed as an extension language,
+to be embedded in a host C&nbsp;program,
+it is also frequently used as a stand-alone language.
+An interpreter for Lua as a stand-alone language,
+called simply <code>lua</code>,
+is provided with the standard distribution.
+The stand-alone interpreter includes
+all standard libraries, including the debug library.
+Its usage is:
+
+<pre>
+     lua [options] [script [args]]
+</pre><p>
+The options are:
+
+<ul>
+<li><b><code>-e <em>stat</em></code>:</b> executes string <em>stat</em>;</li>
+<li><b><code>-l <em>mod</em></code>:</b> "requires" <em>mod</em>;</li>
+<li><b><code>-i</code>:</b> enters interactive mode after running <em>script</em>;</li>
+<li><b><code>-v</code>:</b> prints version information;</li>
+<li><b><code>--</code>:</b> stops handling options;</li>
+<li><b><code>-</code>:</b> executes <code>stdin</code> as a file and stops handling options.</li>
+</ul><p>
+After handling its options, <code>lua</code> runs the given <em>script</em>,
+passing to it the given <em>args</em> as string arguments.
+When called without arguments,
+<code>lua</code> behaves as <code>lua -v -i</code>
+when the standard input (<code>stdin</code>) is a terminal,
+and as <code>lua -</code> otherwise.
+
+
+<p>
+Before running any argument,
+the interpreter checks for an environment variable <a name="pdf-LUA_INIT"><code>LUA_INIT</code></a>.
+If its format is <code>@<em>filename</em></code>,
+then <code>lua</code> executes the file.
+Otherwise, <code>lua</code> executes the string itself.
+
+
+<p>
+All options are handled in order, except <code>-i</code>.
+For instance, an invocation like
+
+<pre>
+     $ lua -e'a=1' -e 'print(a)' script.lua
+</pre><p>
+will first set <code>a</code> to 1, then print the value of <code>a</code> (which is '<code>1</code>'),
+and finally run the file <code>script.lua</code> with no arguments.
+(Here <code>$</code> is the shell prompt. Your prompt may be different.)
+
+
+<p>
+Before starting to run the script,
+<code>lua</code> collects all arguments in the command line
+in a global table called <code>arg</code>.
+The script name is stored at index 0,
+the first argument after the script name goes to index 1,
+and so on.
+Any arguments before the script name
+(that is, the interpreter name plus the options)
+go to negative indices.
+For instance, in the call
+
+<pre>
+     $ lua -la b.lua t1 t2
+</pre><p>
+the interpreter first runs the file <code>a.lua</code>,
+then creates a table
+
+<pre>
+     arg = { [-2] = "lua", [-1] = "-la",
+             [0] = "b.lua",
+             [1] = "t1", [2] = "t2" }
+</pre><p>
+and finally runs the file <code>b.lua</code>.
+The script is called with <code>arg[1]</code>, <code>arg[2]</code>, &middot;&middot;&middot;
+as arguments;
+it can also access these arguments with the vararg expression '<code>...</code>'.
+
+
+<p>
+In interactive mode,
+if you write an incomplete statement,
+the interpreter waits for its completion
+by issuing a different prompt.
+
+
+<p>
+If the global variable <a name="pdf-_PROMPT"><code>_PROMPT</code></a> contains a string,
+then its value is used as the prompt.
+Similarly, if the global variable <a name="pdf-_PROMPT2"><code>_PROMPT2</code></a> contains a string,
+its value is used as the secondary prompt
+(issued during incomplete statements).
+Therefore, both prompts can be changed directly on the command line
+or in any Lua programs by assigning to <code>_PROMPT</code>.
+See the next example:
+
+<pre>
+     $ lua -e"_PROMPT='myprompt&gt; '" -i
+</pre><p>
+(The outer pair of quotes is for the shell,
+the inner pair is for Lua.)
+Note the use of <code>-i</code> to enter interactive mode;
+otherwise,
+the program would just end silently
+right after the assignment to <code>_PROMPT</code>.
+
+
+<p>
+To allow the use of Lua as a
+script interpreter in Unix systems,
+the stand-alone interpreter skips
+the first line of a chunk if it starts with <code>#</code>.
+Therefore, Lua scripts can be made into executable programs
+by using <code>chmod +x</code> and the&nbsp;<code>#!</code> form,
+as in
+
+<pre>
+     #!/usr/local/bin/lua
+</pre><p>
+(Of course,
+the location of the Lua interpreter may be different in your machine.
+If <code>lua</code> is in your <code>PATH</code>,
+then 
+
+<pre>
+     #!/usr/bin/env lua
+</pre><p>
+is a more portable solution.) 
+
+
+
+<h1>7 - <a name="7">Incompatibilities with the Previous Version</a></h1>
+
+<p>
+Here we list the incompatibilities that you may find when moving a program
+from Lua&nbsp;5.0 to Lua&nbsp;5.1.
+You can avoid most of the incompatibilities compiling Lua with
+appropriate options (see file <code>luaconf.h</code>).
+However,
+all these compatibility options will be removed in the next version of Lua.
+
+
+
+<h2>7.1 - <a name="7.1">Changes in the Language</a></h2>
+<ul>
+
+<li>
+The vararg system changed from the pseudo-argument <code>arg</code> with a
+table with the extra arguments to the vararg expression.
+(See compile-time option <code>LUA_COMPAT_VARARG</code> in <code>luaconf.h</code>.)
+</li>
+
+<li>
+There was a subtle change in the scope of the implicit
+variables of the <b>for</b> statement and for the <b>repeat</b> statement.
+</li>
+
+<li>
+The long string/long comment syntax (<code>[[<em>string</em>]]</code>)
+does not allow nesting.
+You can use the new syntax (<code>[=[<em>string</em>]=]</code>) in these cases.
+(See compile-time option <code>LUA_COMPAT_LSTR</code> in <code>luaconf.h</code>.)
+</li>
+
+</ul>
+
+
+
+
+<h2>7.2 - <a name="7.2">Changes in the Libraries</a></h2>
+<ul>
+
+<li>
+Function <code>string.gfind</code> was renamed <a href="#pdf-string.gmatch"><code>string.gmatch</code></a>.
+(See compile-time option <code>LUA_COMPAT_GFIND</code> in <code>luaconf.h</code>.)
+</li>
+
+<li>
+When <a href="#pdf-string.gsub"><code>string.gsub</code></a> is called with a function as its
+third argument,
+whenever this function returns <b>nil</b> or <b>false</b> the
+replacement string is the whole match,
+instead of the empty string.
+</li>
+
+<li>
+Function <code>table.setn</code> was deprecated.
+Function <code>table.getn</code> corresponds
+to the new length operator (<code>#</code>);
+use the operator instead of the function.
+(See compile-time option <code>LUA_COMPAT_GETN</code> in <code>luaconf.h</code>.)
+</li>
+
+<li>
+Function <code>loadlib</code> was renamed <a href="#pdf-package.loadlib"><code>package.loadlib</code></a>.
+(See compile-time option <code>LUA_COMPAT_LOADLIB</code> in <code>luaconf.h</code>.)
+</li>
+
+<li>
+Function <code>math.mod</code> was renamed <a href="#pdf-math.fmod"><code>math.fmod</code></a>.
+(See compile-time option <code>LUA_COMPAT_MOD</code> in <code>luaconf.h</code>.)
+</li>
+
+<li>
+Functions <code>table.foreach</code> and <code>table.foreachi</code> are deprecated.
+You can use a for loop with <code>pairs</code> or <code>ipairs</code> instead.
+</li>
+
+<li>
+There were substantial changes in function <a href="#pdf-require"><code>require</code></a> due to
+the new module system.
+However, the new behavior is mostly compatible with the old,
+but <code>require</code> gets the path from <a href="#pdf-package.path"><code>package.path</code></a> instead
+of from <code>LUA_PATH</code>.
+</li>
+
+<li>
+Function <a href="#pdf-collectgarbage"><code>collectgarbage</code></a> has different arguments.
+Function <code>gcinfo</code> is deprecated;
+use <code>collectgarbage("count")</code> instead.
+</li>
+
+</ul>
+
+
+
+
+<h2>7.3 - <a name="7.3">Changes in the API</a></h2>
+<ul>
+
+<li>
+The <code>luaopen_*</code> functions (to open libraries)
+cannot be called directly,
+like a regular C function.
+They must be called through Lua,
+like a Lua function.
+</li>
+
+<li>
+Function <code>lua_open</code> was replaced by <a href="#lua_newstate"><code>lua_newstate</code></a> to
+allow the user to set a memory-allocation function.
+You can use <a href="#luaL_newstate"><code>luaL_newstate</code></a> from the standard library to
+create a state with a standard allocation function
+(based on <code>realloc</code>).
+</li>
+
+<li>
+Functions <code>luaL_getn</code> and <code>luaL_setn</code>
+(from the auxiliary library) are deprecated.
+Use <a href="#lua_objlen"><code>lua_objlen</code></a> instead of <code>luaL_getn</code>
+and nothing instead of <code>luaL_setn</code>.
+</li>
+
+<li>
+Function <code>luaL_openlib</code> was replaced by <a href="#luaL_register"><code>luaL_register</code></a>.
+</li>
+
+<li>
+Function <code>luaL_checkudata</code> now throws an error when the given value
+is not a userdata of the expected type.
+(In Lua&nbsp;5.0 it returned <code>NULL</code>.)
+</li>
+
+</ul>
+
+
+
+
+<h1>8 - <a name="8">The Complete Syntax of Lua</a></h1>
+
+<p>
+Here is the complete syntax of Lua in extended BNF.
+(It does not describe operator precedences.)
+
+
+
+
+<pre>
+
+	chunk ::= {stat [`<b>;</b>&acute;]} [laststat [`<b>;</b>&acute;]]
+
+	block ::= chunk
+
+	stat ::=  varlist `<b>=</b>&acute; explist | 
+		 functioncall | 
+		 <b>do</b> block <b>end</b> | 
+		 <b>while</b> exp <b>do</b> block <b>end</b> | 
+		 <b>repeat</b> block <b>until</b> exp | 
+		 <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b> | 
+		 <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b> | 
+		 <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b> | 
+		 <b>function</b> funcname funcbody | 
+		 <b>local</b> <b>function</b> Name funcbody | 
+		 <b>local</b> namelist [`<b>=</b>&acute; explist] 
+
+	laststat ::= <b>return</b> [explist] | <b>break</b>
+
+	funcname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]
+
+	varlist ::= var {`<b>,</b>&acute; var}
+
+	var ::=  Name | prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute; | prefixexp `<b>.</b>&acute; Name 
+
+	namelist ::= Name {`<b>,</b>&acute; Name}
+
+	explist ::= {exp `<b>,</b>&acute;} exp
+
+	exp ::=  <b>nil</b> | <b>false</b> | <b>true</b> | Number | String | `<b>...</b>&acute; | function | 
+		 prefixexp | tableconstructor | exp binop exp | unop exp 
+
+	prefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;
+
+	functioncall ::=  prefixexp args | prefixexp `<b>:</b>&acute; Name args 
+
+	args ::=  `<b>(</b>&acute; [explist] `<b>)</b>&acute; | tableconstructor | String 
+
+	function ::= <b>function</b> funcbody
+
+	funcbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>
+
+	parlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;
+
+	tableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;
+
+	fieldlist ::= field {fieldsep field} [fieldsep]
+
+	field ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp
+
+	fieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;
+
+	binop ::= `<b>+</b>&acute; | `<b>-</b>&acute; | `<b>*</b>&acute; | `<b>/</b>&acute; | `<b>^</b>&acute; | `<b>%</b>&acute; | `<b>..</b>&acute; | 
+		 `<b>&lt;</b>&acute; | `<b>&lt;=</b>&acute; | `<b>&gt;</b>&acute; | `<b>&gt;=</b>&acute; | `<b>==</b>&acute; | `<b>~=</b>&acute; | 
+		 <b>and</b> | <b>or</b>
+
+	unop ::= `<b>-</b>&acute; | <b>not</b> | `<b>#</b>&acute;
+
+</pre>
+
+<p>
+
+
+
+
+
+
+
+<HR>
+<SMALL CLASS="footer">
+Last update:
+Mon Feb 13 18:54:19 BRST 2012
+</SMALL>
+<!--
+Last change: revised for Lua 5.1.5
+-->
+
+</body></html>
+
diff --git a/redis-stable/deps/lua/doc/readme.html b/redis-stable/deps/lua/doc/readme.html
new file mode 100644
index 00000000..3ed6a818
--- /dev/null
+++ b/redis-stable/deps/lua/doc/readme.html
@@ -0,0 +1,40 @@
+<HTML>
+<HEAD>
+<TITLE>Lua documentation</TITLE>
+<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
+</HEAD>
+
+<BODY>
+
+<HR>
+<H1>
+<A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="Lua" BORDER=0></A>
+Documentation
+</H1>
+
+This is the documentation included in the source distribution of Lua 5.1.5.
+
+<UL>
+<LI><A HREF="contents.html">Reference manual</A>
+<LI><A HREF="lua.html">lua man page</A>
+<LI><A HREF="luac.html">luac man page</A>
+<LI><A HREF="../README">lua/README</A>
+<LI><A HREF="../etc/README">lua/etc/README</A>
+<LI><A HREF="../test/README">lua/test/README</A>
+</UL>
+
+Lua's
+<A HREF="http://www.lua.org/">official web site</A>
+contains updated documentation,
+especially the
+<A HREF="http://www.lua.org/manual/5.1/">reference manual</A>.
+<P>
+
+<HR>
+<SMALL>
+Last update:
+Fri Feb  3 09:44:42 BRST 2012
+</SMALL>
+
+</BODY>
+</HTML>
diff --git a/redis-stable/deps/lua/etc/Makefile b/redis-stable/deps/lua/etc/Makefile
new file mode 100644
index 00000000..6d00008d
--- /dev/null
+++ b/redis-stable/deps/lua/etc/Makefile
@@ -0,0 +1,44 @@
+# makefile for Lua etc
+
+TOP= ..
+LIB= $(TOP)/src
+INC= $(TOP)/src
+BIN= $(TOP)/src
+SRC= $(TOP)/src
+TST= $(TOP)/test
+
+CC= gcc
+CFLAGS= -O2 -Wall -I$(INC) $(MYCFLAGS)
+MYCFLAGS= 
+MYLDFLAGS= -Wl,-E
+MYLIBS= -lm
+#MYLIBS= -lm -Wl,-E -ldl -lreadline -lhistory -lncurses
+RM= rm -f
+
+default:
+	@echo 'Please choose a target: min noparser one strict clean'
+
+min:	min.c
+	$(CC) $(CFLAGS) $@.c -L$(LIB) -llua $(MYLIBS)
+	echo 'print"Hello there!"' | ./a.out
+
+noparser: noparser.o
+	$(CC) noparser.o $(SRC)/lua.o -L$(LIB) -llua $(MYLIBS)
+	$(BIN)/luac $(TST)/hello.lua
+	-./a.out luac.out
+	-./a.out -e'a=1'
+
+one:
+	$(CC) $(CFLAGS) all.c $(MYLIBS)
+	./a.out $(TST)/hello.lua
+
+strict:
+	-$(BIN)/lua -e 'print(a);b=2'
+	-$(BIN)/lua -lstrict -e 'print(a)'
+	-$(BIN)/lua -e 'function f() b=2 end f()'
+	-$(BIN)/lua -lstrict -e 'function f() b=2 end f()'
+
+clean:
+	$(RM) a.out core core.* *.o luac.out
+
+.PHONY:	default min noparser one strict clean
diff --git a/redis-stable/deps/lua/etc/README b/redis-stable/deps/lua/etc/README
new file mode 100644
index 00000000..5149fc91
--- /dev/null
+++ b/redis-stable/deps/lua/etc/README
@@ -0,0 +1,37 @@
+This directory contains some useful files and code.
+Unlike the code in ../src, everything here is in the public domain.
+
+If any of the makes fail, you're probably not using the same libraries
+used to build Lua. Set MYLIBS in Makefile accordingly.
+
+all.c
+	Full Lua interpreter in a single file.
+	Do "make one" for a demo.
+
+lua.hpp
+	Lua header files for C++ using 'extern "C"'.
+
+lua.ico
+	A Lua icon for Windows (and web sites: save as favicon.ico).
+	Drawn by hand by Markus Gritsch <gritsch@iue.tuwien.ac.at>.
+
+lua.pc
+	pkg-config data for Lua
+
+luavs.bat
+	Script to build Lua under "Visual Studio .NET Command Prompt".
+	Run it from the toplevel as etc\luavs.bat.
+
+min.c
+	A minimal Lua interpreter.
+	Good for learning and for starting your own.
+	Do "make min" for a demo.
+
+noparser.c
+	Linking with noparser.o avoids loading the parsing modules in lualib.a.
+	Do "make noparser" for a demo.
+
+strict.lua
+	Traps uses of undeclared global variables.
+	Do "make strict" for a demo.
+
diff --git a/redis-stable/deps/lua/etc/all.c b/redis-stable/deps/lua/etc/all.c
new file mode 100644
index 00000000..dab68fac
--- /dev/null
+++ b/redis-stable/deps/lua/etc/all.c
@@ -0,0 +1,38 @@
+/*
+* all.c -- Lua core, libraries and interpreter in a single file
+*/
+
+#define luaall_c
+
+#include "lapi.c"
+#include "lcode.c"
+#include "ldebug.c"
+#include "ldo.c"
+#include "ldump.c"
+#include "lfunc.c"
+#include "lgc.c"
+#include "llex.c"
+#include "lmem.c"
+#include "lobject.c"
+#include "lopcodes.c"
+#include "lparser.c"
+#include "lstate.c"
+#include "lstring.c"
+#include "ltable.c"
+#include "ltm.c"
+#include "lundump.c"
+#include "lvm.c"
+#include "lzio.c"
+
+#include "lauxlib.c"
+#include "lbaselib.c"
+#include "ldblib.c"
+#include "liolib.c"
+#include "linit.c"
+#include "lmathlib.c"
+#include "loadlib.c"
+#include "loslib.c"
+#include "lstrlib.c"
+#include "ltablib.c"
+
+#include "lua.c"
diff --git a/redis-stable/deps/lua/etc/lua.hpp b/redis-stable/deps/lua/etc/lua.hpp
new file mode 100644
index 00000000..ec417f59
--- /dev/null
+++ b/redis-stable/deps/lua/etc/lua.hpp
@@ -0,0 +1,9 @@
+// lua.hpp
+// Lua header files for C++
+// <<extern "C">> not supplied automatically because Lua also compiles as C++
+
+extern "C" {
+#include "lua.h"
+#include "lualib.h"
+#include "lauxlib.h"
+}
diff --git a/redis-stable/deps/lua/etc/lua.ico b/redis-stable/deps/lua/etc/lua.ico
new file mode 100644
index 0000000000000000000000000000000000000000..ccbabc4e2004683f29598a991006d7caff6d837d
GIT binary patch
literal 1078
zcma)5y>7xl4E|D3VJbX9VX7GW1~6FSw!BIQq_T0tNo32b^bxZ4H5fZGR7xh?&v!Y3
zDh3=J`#b+#Yy%W{!g4u>(a#g`Mme7+yefc~5wPOflDr`o81qe{?|t$BfABsDzNw;V
z8cH*0{6W<;G9Np#7ik(qoR4aR5-A@{5)}DJ9&}FRBA#X_5+im4-kQSzMF^)-t2(Vi
ztw-^|Sn8@O_lM9`oos+0wMZGt&`Bq(aK&XCv1Gfr&Jtd6%lKPdD{s=<uXnh?Rp9Ax
zy`#1~uzHCO%J^76V#i*^`r~9ynD^~JKVg1P{@xf*h`t||KlUT{i}n4dwKSxR9Kl{3
z4~Blz;_1*wcr&CFG;m&5Odq5F*fM)FWJ>unqGWyb3%y{X9SS{jB~HMh0oKMISQrDC
zJ;K?)>ElnpmN^UNE-rXxtyk{c#rCe~`P=q<PF|Apo_p%|$#chP@!W3{_E33j&x4IK
zwVO(6s^|V0ZTcy=JifcK?j-tgfn%KNCg!O-ULr7!+i^Zt$2Q3*%iZ?87HMYs>nFT7
bCxwx*w%~s~=?o*z_6Fk4@7l(poWF`cPpA(!

literal 0
HcmV?d00001

diff --git a/redis-stable/deps/lua/etc/lua.pc b/redis-stable/deps/lua/etc/lua.pc
new file mode 100644
index 00000000..07e2852b
--- /dev/null
+++ b/redis-stable/deps/lua/etc/lua.pc
@@ -0,0 +1,31 @@
+# lua.pc -- pkg-config data for Lua
+
+# vars from install Makefile
+
+# grep '^V=' ../Makefile
+V= 5.1
+# grep '^R=' ../Makefile
+R= 5.1.5
+
+# grep '^INSTALL_.*=' ../Makefile | sed 's/INSTALL_TOP/prefix/'
+prefix= /usr/local
+INSTALL_BIN= ${prefix}/bin
+INSTALL_INC= ${prefix}/include
+INSTALL_LIB= ${prefix}/lib
+INSTALL_MAN= ${prefix}/man/man1
+INSTALL_LMOD= ${prefix}/share/lua/${V}
+INSTALL_CMOD= ${prefix}/lib/lua/${V}
+
+# canonical vars
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: Lua
+Description: An Extensible Extension Language
+Version: ${R}
+Requires: 
+Libs: -L${libdir} -llua -lm
+Cflags: -I${includedir}
+
+# (end of lua.pc)
diff --git a/redis-stable/deps/lua/etc/luavs.bat b/redis-stable/deps/lua/etc/luavs.bat
new file mode 100644
index 00000000..08c2bedd
--- /dev/null
+++ b/redis-stable/deps/lua/etc/luavs.bat
@@ -0,0 +1,28 @@
+@rem Script to build Lua under "Visual Studio .NET Command Prompt".
+@rem Do not run from this directory; run it from the toplevel: etc\luavs.bat .
+@rem It creates lua51.dll, lua51.lib, lua.exe, and luac.exe in src.
+@rem (contributed by David Manura and Mike Pall)
+
+@setlocal
+@set MYCOMPILE=cl /nologo /MD /O2 /W3 /c /D_CRT_SECURE_NO_DEPRECATE
+@set MYLINK=link /nologo
+@set MYMT=mt /nologo
+
+cd src
+%MYCOMPILE% /DLUA_BUILD_AS_DLL l*.c
+del lua.obj luac.obj
+%MYLINK% /DLL /out:lua51.dll l*.obj
+if exist lua51.dll.manifest^
+  %MYMT% -manifest lua51.dll.manifest -outputresource:lua51.dll;2
+%MYCOMPILE% /DLUA_BUILD_AS_DLL lua.c
+%MYLINK% /out:lua.exe lua.obj lua51.lib
+if exist lua.exe.manifest^
+  %MYMT% -manifest lua.exe.manifest -outputresource:lua.exe
+%MYCOMPILE% l*.c print.c
+del lua.obj linit.obj lbaselib.obj ldblib.obj liolib.obj lmathlib.obj^
+    loslib.obj ltablib.obj lstrlib.obj loadlib.obj
+%MYLINK% /out:luac.exe *.obj
+if exist luac.exe.manifest^
+  %MYMT% -manifest luac.exe.manifest -outputresource:luac.exe
+del *.obj *.manifest
+cd ..
diff --git a/redis-stable/deps/lua/etc/min.c b/redis-stable/deps/lua/etc/min.c
new file mode 100644
index 00000000..6a85a4d1
--- /dev/null
+++ b/redis-stable/deps/lua/etc/min.c
@@ -0,0 +1,39 @@
+/*
+* min.c -- a minimal Lua interpreter
+* loads stdin only with minimal error handling.
+* no interaction, and no standard library, only a "print" function.
+*/
+
+#include <stdio.h>
+
+#include "lua.h"
+#include "lauxlib.h"
+
+static int print(lua_State *L)
+{
+ int n=lua_gettop(L);
+ int i;
+ for (i=1; i<=n; i++)
+ {
+  if (i>1) printf("\t");
+  if (lua_isstring(L,i))
+   printf("%s",lua_tostring(L,i));
+  else if (lua_isnil(L,i))
+   printf("%s","nil");
+  else if (lua_isboolean(L,i))
+   printf("%s",lua_toboolean(L,i) ? "true" : "false");
+  else
+   printf("%s:%p",luaL_typename(L,i),lua_topointer(L,i));
+ }
+ printf("\n");
+ return 0;
+}
+
+int main(void)
+{
+ lua_State *L=lua_open();
+ lua_register(L,"print",print);
+ if (luaL_dofile(L,NULL)!=0) fprintf(stderr,"%s\n",lua_tostring(L,-1));
+ lua_close(L);
+ return 0;
+}
diff --git a/redis-stable/deps/lua/etc/noparser.c b/redis-stable/deps/lua/etc/noparser.c
new file mode 100644
index 00000000..13ba5462
--- /dev/null
+++ b/redis-stable/deps/lua/etc/noparser.c
@@ -0,0 +1,50 @@
+/*
+* The code below can be used to make a Lua core that does not contain the
+* parsing modules (lcode, llex, lparser), which represent 35% of the total core.
+* You'll only be able to load binary files and strings, precompiled with luac.
+* (Of course, you'll have to build luac with the original parsing modules!)
+*
+* To use this module, simply compile it ("make noparser" does that) and list
+* its object file before the Lua libraries. The linker should then not load
+* the parsing modules. To try it, do "make luab".
+*
+* If you also want to avoid the dump module (ldump.o), define NODUMP.
+* #define NODUMP
+*/
+
+#define LUA_CORE
+
+#include "llex.h"
+#include "lparser.h"
+#include "lzio.h"
+
+LUAI_FUNC void luaX_init (lua_State *L) {
+  UNUSED(L);
+}
+
+LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
+  UNUSED(z);
+  UNUSED(buff);
+  UNUSED(name);
+  lua_pushliteral(L,"parser not loaded");
+  lua_error(L);
+  return NULL;
+}
+
+#ifdef NODUMP
+#include "lundump.h"
+
+LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) {
+  UNUSED(f);
+  UNUSED(w);
+  UNUSED(data);
+  UNUSED(strip);
+#if 1
+  UNUSED(L);
+  return 0;
+#else
+  lua_pushliteral(L,"dumper not loaded");
+  lua_error(L);
+#endif
+}
+#endif
diff --git a/redis-stable/deps/lua/etc/strict.lua b/redis-stable/deps/lua/etc/strict.lua
new file mode 100644
index 00000000..604619dd
--- /dev/null
+++ b/redis-stable/deps/lua/etc/strict.lua
@@ -0,0 +1,41 @@
+--
+-- strict.lua
+-- checks uses of undeclared global variables
+-- All global variables must be 'declared' through a regular assignment
+-- (even assigning nil will do) in a main chunk before being used
+-- anywhere or assigned to inside a function.
+--
+
+local getinfo, error, rawset, rawget = debug.getinfo, error, rawset, rawget
+
+local mt = getmetatable(_G)
+if mt == nil then
+  mt = {}
+  setmetatable(_G, mt)
+end
+
+mt.__declared = {}
+
+local function what ()
+  local d = getinfo(3, "S")
+  return d and d.what or "C"
+end
+
+mt.__newindex = function (t, n, v)
+  if not mt.__declared[n] then
+    local w = what()
+    if w ~= "main" and w ~= "C" then
+      error("assign to undeclared variable '"..n.."'", 2)
+    end
+    mt.__declared[n] = true
+  end
+  rawset(t, n, v)
+end
+  
+mt.__index = function (t, n)
+  if not mt.__declared[n] and what() ~= "C" then
+    error("variable '"..n.."' is not declared", 2)
+  end
+  return rawget(t, n)
+end
+
diff --git a/redis-stable/deps/lua/src/Makefile b/redis-stable/deps/lua/src/Makefile
new file mode 100644
index 00000000..f3bba2f8
--- /dev/null
+++ b/redis-stable/deps/lua/src/Makefile
@@ -0,0 +1,183 @@
+# makefile for building Lua
+# see ../INSTALL for installation instructions
+# see ../Makefile and luaconf.h for further customization
+
+# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
+
+# Your platform. See PLATS for possible values.
+PLAT= none
+
+CC?= gcc
+CFLAGS= -O2 -Wall $(MYCFLAGS)
+AR= ar rcu
+RANLIB= ranlib
+RM= rm -f
+LIBS= -lm $(MYLIBS)
+
+MYCFLAGS=
+MYLDFLAGS=
+MYLIBS=
+
+# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
+
+PLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris
+
+LUA_A=	liblua.a
+CORE_O=	lapi.o lcode.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o lmem.o \
+	lobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o ltm.o  \
+	lundump.o lvm.o lzio.o strbuf.o fpconv.o
+LIB_O=	lauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o loslib.o ltablib.o \
+	lstrlib.o loadlib.o linit.o lua_cjson.o lua_struct.o lua_cmsgpack.o \
+	lua_bit.o
+
+LUA_T=	lua
+LUA_O=	lua.o
+
+LUAC_T=	luac
+LUAC_O=	luac.o print.o
+
+ALL_O= $(CORE_O) $(LIB_O) $(LUA_O) $(LUAC_O)
+ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T)
+ALL_A= $(LUA_A)
+
+default: $(PLAT)
+
+all:	$(ALL_T)
+
+o:	$(ALL_O)
+
+a:	$(ALL_A)
+
+$(LUA_A): $(CORE_O) $(LIB_O)
+	$(AR) $@ $(CORE_O) $(LIB_O)	# DLL needs all object files
+	$(RANLIB) $@
+
+$(LUA_T): $(LUA_O) $(LUA_A)
+	$(CC) -o $@ $(MYLDFLAGS) $(LUA_O) $(LUA_A) $(LIBS)
+
+$(LUAC_T): $(LUAC_O) $(LUA_A)
+	$(CC) -o $@ $(MYLDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS)
+
+clean:
+	$(RM) $(ALL_T) $(ALL_O)
+
+depend:
+	@$(CC) $(CFLAGS) -MM l*.c print.c
+
+echo:
+	@echo "PLAT = $(PLAT)"
+	@echo "CC = $(CC)"
+	@echo "CFLAGS = $(CFLAGS)"
+	@echo "AR = $(AR)"
+	@echo "RANLIB = $(RANLIB)"
+	@echo "RM = $(RM)"
+	@echo "MYCFLAGS = $(MYCFLAGS)"
+	@echo "MYLDFLAGS = $(MYLDFLAGS)"
+	@echo "MYLIBS = $(MYLIBS)"
+
+# convenience targets for popular platforms
+
+none:
+	@echo "Please choose a platform:"
+	@echo "   $(PLATS)"
+
+aix:
+	$(MAKE) all CC="xlc" CFLAGS="-O2 -DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl" MYLDFLAGS="-brtl -bexpall"
+
+ansi:
+	$(MAKE) all MYCFLAGS=-DLUA_ANSI
+
+bsd:
+	$(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-Wl,-E"
+
+freebsd:
+	$(MAKE) all MYCFLAGS="-DLUA_USE_LINUX" MYLIBS="-Wl,-E -lreadline"
+
+generic:
+	$(MAKE) all MYCFLAGS=
+
+linux:
+	$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-Wl,-E -ldl -lreadline -lhistory -lncurses"
+
+macosx:
+	$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-lreadline"
+# use this on Mac OS X 10.3-
+#	$(MAKE) all MYCFLAGS=-DLUA_USE_MACOSX
+
+mingw:
+	$(MAKE) "LUA_A=lua51.dll" "LUA_T=lua.exe" \
+	"AR=$(CC) -shared -o" "RANLIB=strip --strip-unneeded" \
+	"MYCFLAGS=-DLUA_BUILD_AS_DLL" "MYLIBS=" "MYLDFLAGS=-s" lua.exe
+	$(MAKE) "LUAC_T=luac.exe" luac.exe
+
+posix:
+	$(MAKE) all MYCFLAGS=-DLUA_USE_POSIX
+
+solaris:
+	$(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl"
+
+# list targets that do not create files (but not all makes understand .PHONY)
+.PHONY: all $(PLATS) default o a clean depend echo none
+
+# DO NOT DELETE
+
+lapi.o: lapi.c lua.h luaconf.h lapi.h lobject.h llimits.h ldebug.h \
+  lstate.h ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h \
+  lundump.h lvm.h
+lauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h
+lbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h
+lcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
+  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h lgc.h \
+  ltable.h
+ldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h
+ldebug.o: ldebug.c lua.h luaconf.h lapi.h lobject.h llimits.h lcode.h \
+  llex.h lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \
+  lfunc.h lstring.h lgc.h ltable.h lvm.h
+ldo.o: ldo.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h lstring.h \
+  ltable.h lundump.h lvm.h
+ldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \
+  lzio.h lmem.h lundump.h
+lfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h lmem.h \
+  lstate.h ltm.h lzio.h
+lgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+  lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h
+linit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h
+liolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h
+llex.o: llex.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h ltm.h \
+  lzio.h lmem.h llex.h lparser.h lstring.h lgc.h ltable.h
+lmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h
+lmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+  ltm.h lzio.h lmem.h ldo.h
+loadlib.o: loadlib.c lua.h luaconf.h lauxlib.h lualib.h
+lobject.o: lobject.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h \
+  ltm.h lzio.h lmem.h lstring.h lgc.h lvm.h
+lopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h
+loslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h
+lparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
+  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \
+  lfunc.h lstring.h lgc.h ltable.h
+lstate.o: lstate.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+  ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h llex.h lstring.h ltable.h
+lstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \
+  ltm.h lzio.h lstring.h lgc.h
+lstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h
+ltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
+  ltm.h lzio.h lmem.h ldo.h lgc.h ltable.h
+ltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h
+ltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \
+  lmem.h lstring.h lgc.h ltable.h
+lua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h
+luac.o: luac.c lua.h luaconf.h lauxlib.h ldo.h lobject.h llimits.h \
+  lstate.h ltm.h lzio.h lmem.h lfunc.h lopcodes.h lstring.h lgc.h \
+  lundump.h
+lundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \
+  llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lstring.h lgc.h lundump.h
+lvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
+  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h lvm.h
+lzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \
+  lzio.h
+print.o: print.c ldebug.h lstate.h lua.h luaconf.h lobject.h llimits.h \
+  ltm.h lzio.h lmem.h lopcodes.h lundump.h
+
+# (end of Makefile)
diff --git a/redis-stable/deps/lua/src/fpconv.c b/redis-stable/deps/lua/src/fpconv.c
new file mode 100644
index 00000000..79908317
--- /dev/null
+++ b/redis-stable/deps/lua/src/fpconv.c
@@ -0,0 +1,205 @@
+/* fpconv - Floating point conversion routines
+ *
+ * Copyright (c) 2011-2012  Mark Pulford <mark@kyne.com.au>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+/* JSON uses a '.' decimal separator. strtod() / sprintf() under C libraries
+ * with locale support will break when the decimal separator is a comma.
+ *
+ * fpconv_* will around these issues with a translation buffer if required.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <assert.h>
+#include <string.h>
+
+#include "fpconv.h"
+
+/* Lua CJSON assumes the locale is the same for all threads within a
+ * process and doesn't change after initialisation.
+ *
+ * This avoids the need for per thread storage or expensive checks
+ * for call. */
+static char locale_decimal_point = '.';
+
+/* In theory multibyte decimal_points are possible, but
+ * Lua CJSON only supports UTF-8 and known locales only have
+ * single byte decimal points ([.,]).
+ *
+ * localconv() may not be thread safe (=>crash), and nl_langinfo() is
+ * not supported on some platforms. Use sprintf() instead - if the
+ * locale does change, at least Lua CJSON won't crash. */
+static void fpconv_update_locale()
+{
+    char buf[8];
+
+    snprintf(buf, sizeof(buf), "%g", 0.5);
+
+    /* Failing this test might imply the platform has a buggy dtoa
+     * implementation or wide characters */
+    if (buf[0] != '0' || buf[2] != '5' || buf[3] != 0) {
+        fprintf(stderr, "Error: wide characters found or printf() bug.");
+        abort();
+    }
+
+    locale_decimal_point = buf[1];
+}
+
+/* Check for a valid number character: [-+0-9a-yA-Y.]
+ * Eg: -0.6e+5, infinity, 0xF0.F0pF0
+ *
+ * Used to find the probable end of a number. It doesn't matter if
+ * invalid characters are counted - strtod() will find the valid
+ * number if it exists.  The risk is that slightly more memory might
+ * be allocated before a parse error occurs. */
+static inline int valid_number_character(char ch)
+{
+    char lower_ch;
+
+    if ('0' <= ch && ch <= '9')
+        return 1;
+    if (ch == '-' || ch == '+' || ch == '.')
+        return 1;
+
+    /* Hex digits, exponent (e), base (p), "infinity",.. */
+    lower_ch = ch | 0x20;
+    if ('a' <= lower_ch && lower_ch <= 'y')
+        return 1;
+
+    return 0;
+}
+
+/* Calculate the size of the buffer required for a strtod locale
+ * conversion. */
+static int strtod_buffer_size(const char *s)
+{
+    const char *p = s;
+
+    while (valid_number_character(*p))
+        p++;
+
+    return p - s;
+}
+
+/* Similar to strtod(), but must be passed the current locale's decimal point
+ * character. Guaranteed to be called at the start of any valid number in a string */
+double fpconv_strtod(const char *nptr, char **endptr)
+{
+    char localbuf[FPCONV_G_FMT_BUFSIZE];
+    char *buf, *endbuf, *dp;
+    int buflen;
+    double value;
+
+    /* System strtod() is fine when decimal point is '.' */
+    if (locale_decimal_point == '.')
+        return strtod(nptr, endptr);
+
+    buflen = strtod_buffer_size(nptr);
+    if (!buflen) {
+        /* No valid characters found, standard strtod() return */
+        *endptr = (char *)nptr;
+        return 0;
+    }
+
+    /* Duplicate number into buffer */
+    if (buflen >= FPCONV_G_FMT_BUFSIZE) {
+        /* Handle unusually large numbers */
+        buf = malloc(buflen + 1);
+        if (!buf) {
+            fprintf(stderr, "Out of memory");
+            abort();
+        }
+    } else {
+        /* This is the common case.. */
+        buf = localbuf;
+    }
+    memcpy(buf, nptr, buflen);
+    buf[buflen] = 0;
+
+    /* Update decimal point character if found */
+    dp = strchr(buf, '.');
+    if (dp)
+        *dp = locale_decimal_point;
+
+    value = strtod(buf, &endbuf);
+    *endptr = (char *)&nptr[endbuf - buf];
+    if (buflen >= FPCONV_G_FMT_BUFSIZE)
+        free(buf);
+
+    return value;
+}
+
+/* "fmt" must point to a buffer of at least 6 characters */
+static void set_number_format(char *fmt, int precision)
+{
+    int d1, d2, i;
+
+    assert(1 <= precision && precision <= 14);
+
+    /* Create printf format (%.14g) from precision */
+    d1 = precision / 10;
+    d2 = precision % 10;
+    fmt[0] = '%';
+    fmt[1] = '.';
+    i = 2;
+    if (d1) {
+        fmt[i++] = '0' + d1;
+    }
+    fmt[i++] = '0' + d2;
+    fmt[i++] = 'g';
+    fmt[i] = 0;
+}
+
+/* Assumes there is always at least 32 characters available in the target buffer */
+int fpconv_g_fmt(char *str, double num, int precision)
+{
+    char buf[FPCONV_G_FMT_BUFSIZE];
+    char fmt[6];
+    int len;
+    char *b;
+
+    set_number_format(fmt, precision);
+
+    /* Pass through when decimal point character is dot. */
+    if (locale_decimal_point == '.')
+        return snprintf(str, FPCONV_G_FMT_BUFSIZE, fmt, num);
+
+    /* snprintf() to a buffer then translate for other decimal point characters */
+    len = snprintf(buf, FPCONV_G_FMT_BUFSIZE, fmt, num);
+
+    /* Copy into target location. Translate decimal point if required */
+    b = buf;
+    do {
+        *str++ = (*b == locale_decimal_point ? '.' : *b);
+    } while(*b++);
+
+    return len;
+}
+
+void fpconv_init()
+{
+    fpconv_update_locale();
+}
+
+/* vi:ai et sw=4 ts=4:
+ */
diff --git a/redis-stable/deps/lua/src/fpconv.h b/redis-stable/deps/lua/src/fpconv.h
new file mode 100644
index 00000000..7b0d0ee3
--- /dev/null
+++ b/redis-stable/deps/lua/src/fpconv.h
@@ -0,0 +1,22 @@
+/* Lua CJSON floating point conversion routines */
+
+/* Buffer required to store the largest string representation of a double.
+ *
+ * Longest double printed with %.14g is 21 characters long:
+ * -1.7976931348623e+308 */
+# define FPCONV_G_FMT_BUFSIZE   32
+
+#ifdef USE_INTERNAL_FPCONV
+static inline void fpconv_init()
+{
+    /* Do nothing - not required */
+}
+#else
+extern void fpconv_init();
+#endif
+
+extern int fpconv_g_fmt(char*, double, int);
+extern double fpconv_strtod(const char*, char**);
+
+/* vi:ai et sw=4 ts=4:
+ */
diff --git a/redis-stable/deps/lua/src/lapi.c b/redis-stable/deps/lua/src/lapi.c
new file mode 100644
index 00000000..5d5145d2
--- /dev/null
+++ b/redis-stable/deps/lua/src/lapi.c
@@ -0,0 +1,1087 @@
+/*
+** $Id: lapi.c,v 2.55.1.5 2008/07/04 18:41:18 roberto Exp $
+** Lua API
+** See Copyright Notice in lua.h
+*/
+
+
+#include <assert.h>
+#include <math.h>
+#include <stdarg.h>
+#include <string.h>
+
+#define lapi_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lapi.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lundump.h"
+#include "lvm.h"
+
+
+
+const char lua_ident[] =
+  "$Lua: " LUA_RELEASE " " LUA_COPYRIGHT " $\n"
+  "$Authors: " LUA_AUTHORS " $\n"
+  "$URL: www.lua.org $\n";
+
+
+
+#define api_checknelems(L, n)	api_check(L, (n) <= (L->top - L->base))
+
+#define api_checkvalidindex(L, i)	api_check(L, (i) != luaO_nilobject)
+
+#define api_incr_top(L)   {api_check(L, L->top < L->ci->top); L->top++;}
+
+
+
+static TValue *index2adr (lua_State *L, int idx) {
+  if (idx > 0) {
+    TValue *o = L->base + (idx - 1);
+    api_check(L, idx <= L->ci->top - L->base);
+    if (o >= L->top) return cast(TValue *, luaO_nilobject);
+    else return o;
+  }
+  else if (idx > LUA_REGISTRYINDEX) {
+    api_check(L, idx != 0 && -idx <= L->top - L->base);
+    return L->top + idx;
+  }
+  else switch (idx) {  /* pseudo-indices */
+    case LUA_REGISTRYINDEX: return registry(L);
+    case LUA_ENVIRONINDEX: {
+      Closure *func = curr_func(L);
+      sethvalue(L, &L->env, func->c.env);
+      return &L->env;
+    }
+    case LUA_GLOBALSINDEX: return gt(L);
+    default: {
+      Closure *func = curr_func(L);
+      idx = LUA_GLOBALSINDEX - idx;
+      return (idx <= func->c.nupvalues)
+                ? &func->c.upvalue[idx-1]
+                : cast(TValue *, luaO_nilobject);
+    }
+  }
+}
+
+
+static Table *getcurrenv (lua_State *L) {
+  if (L->ci == L->base_ci)  /* no enclosing function? */
+    return hvalue(gt(L));  /* use global table as environment */
+  else {
+    Closure *func = curr_func(L);
+    return func->c.env;
+  }
+}
+
+
+void luaA_pushobject (lua_State *L, const TValue *o) {
+  setobj2s(L, L->top, o);
+  api_incr_top(L);
+}
+
+
+LUA_API int lua_checkstack (lua_State *L, int size) {
+  int res = 1;
+  lua_lock(L);
+  if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK)
+    res = 0;  /* stack overflow */
+  else if (size > 0) {
+    luaD_checkstack(L, size);
+    if (L->ci->top < L->top + size)
+      L->ci->top = L->top + size;
+  }
+  lua_unlock(L);
+  return res;
+}
+
+
+LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {
+  int i;
+  if (from == to) return;
+  lua_lock(to);
+  api_checknelems(from, n);
+  api_check(from, G(from) == G(to));
+  api_check(from, to->ci->top - to->top >= n);
+  from->top -= n;
+  for (i = 0; i < n; i++) {
+    setobj2s(to, to->top++, from->top + i);
+  }
+  lua_unlock(to);
+}
+
+
+LUA_API void lua_setlevel (lua_State *from, lua_State *to) {
+  to->nCcalls = from->nCcalls;
+}
+
+
+LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) {
+  lua_CFunction old;
+  lua_lock(L);
+  old = G(L)->panic;
+  G(L)->panic = panicf;
+  lua_unlock(L);
+  return old;
+}
+
+
+LUA_API lua_State *lua_newthread (lua_State *L) {
+  lua_State *L1;
+  lua_lock(L);
+  luaC_checkGC(L);
+  L1 = luaE_newthread(L);
+  setthvalue(L, L->top, L1);
+  api_incr_top(L);
+  lua_unlock(L);
+  luai_userstatethread(L, L1);
+  return L1;
+}
+
+
+
+/*
+** basic stack manipulation
+*/
+
+
+LUA_API int lua_gettop (lua_State *L) {
+  return cast_int(L->top - L->base);
+}
+
+
+LUA_API void lua_settop (lua_State *L, int idx) {
+  lua_lock(L);
+  if (idx >= 0) {
+    api_check(L, idx <= L->stack_last - L->base);
+    while (L->top < L->base + idx)
+      setnilvalue(L->top++);
+    L->top = L->base + idx;
+  }
+  else {
+    api_check(L, -(idx+1) <= (L->top - L->base));
+    L->top += idx+1;  /* `subtract' index (index is negative) */
+  }
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_remove (lua_State *L, int idx) {
+  StkId p;
+  lua_lock(L);
+  p = index2adr(L, idx);
+  api_checkvalidindex(L, p);
+  while (++p < L->top) setobjs2s(L, p-1, p);
+  L->top--;
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_insert (lua_State *L, int idx) {
+  StkId p;
+  StkId q;
+  lua_lock(L);
+  p = index2adr(L, idx);
+  api_checkvalidindex(L, p);
+  for (q = L->top; q>p; q--) setobjs2s(L, q, q-1);
+  setobjs2s(L, p, L->top);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_replace (lua_State *L, int idx) {
+  StkId o;
+  lua_lock(L);
+  /* explicit test for incompatible code */
+  if (idx == LUA_ENVIRONINDEX && L->ci == L->base_ci)
+    luaG_runerror(L, "no calling environment");
+  api_checknelems(L, 1);
+  o = index2adr(L, idx);
+  api_checkvalidindex(L, o);
+  if (idx == LUA_ENVIRONINDEX) {
+    Closure *func = curr_func(L);
+    api_check(L, ttistable(L->top - 1)); 
+    func->c.env = hvalue(L->top - 1);
+    luaC_barrier(L, func, L->top - 1);
+  }
+  else {
+    setobj(L, o, L->top - 1);
+    if (idx < LUA_GLOBALSINDEX)  /* function upvalue? */
+      luaC_barrier(L, curr_func(L), L->top - 1);
+  }
+  L->top--;
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushvalue (lua_State *L, int idx) {
+  lua_lock(L);
+  setobj2s(L, L->top, index2adr(L, idx));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+
+/*
+** access functions (stack -> C)
+*/
+
+
+LUA_API int lua_type (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  return (o == luaO_nilobject) ? LUA_TNONE : ttype(o);
+}
+
+
+LUA_API const char *lua_typename (lua_State *L, int t) {
+  UNUSED(L);
+  return (t == LUA_TNONE) ? "no value" : luaT_typenames[t];
+}
+
+
+LUA_API int lua_iscfunction (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  return iscfunction(o);
+}
+
+
+LUA_API int lua_isnumber (lua_State *L, int idx) {
+  TValue n;
+  const TValue *o = index2adr(L, idx);
+  return tonumber(o, &n);
+}
+
+
+LUA_API int lua_isstring (lua_State *L, int idx) {
+  int t = lua_type(L, idx);
+  return (t == LUA_TSTRING || t == LUA_TNUMBER);
+}
+
+
+LUA_API int lua_isuserdata (lua_State *L, int idx) {
+  const TValue *o = index2adr(L, idx);
+  return (ttisuserdata(o) || ttislightuserdata(o));
+}
+
+
+LUA_API int lua_rawequal (lua_State *L, int index1, int index2) {
+  StkId o1 = index2adr(L, index1);
+  StkId o2 = index2adr(L, index2);
+  return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
+         : luaO_rawequalObj(o1, o2);
+}
+
+
+LUA_API int lua_equal (lua_State *L, int index1, int index2) {
+  StkId o1, o2;
+  int i;
+  lua_lock(L);  /* may call tag method */
+  o1 = index2adr(L, index1);
+  o2 = index2adr(L, index2);
+  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 : equalobj(L, o1, o2);
+  lua_unlock(L);
+  return i;
+}
+
+
+LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
+  StkId o1, o2;
+  int i;
+  lua_lock(L);  /* may call tag method */
+  o1 = index2adr(L, index1);
+  o2 = index2adr(L, index2);
+  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
+       : luaV_lessthan(L, o1, o2);
+  lua_unlock(L);
+  return i;
+}
+
+
+
+LUA_API lua_Number lua_tonumber (lua_State *L, int idx) {
+  TValue n;
+  const TValue *o = index2adr(L, idx);
+  if (tonumber(o, &n))
+    return nvalue(o);
+  else
+    return 0;
+}
+
+
+LUA_API lua_Integer lua_tointeger (lua_State *L, int idx) {
+  TValue n;
+  const TValue *o = index2adr(L, idx);
+  if (tonumber(o, &n)) {
+    lua_Integer res;
+    lua_Number num = nvalue(o);
+    lua_number2integer(res, num);
+    return res;
+  }
+  else
+    return 0;
+}
+
+
+LUA_API int lua_toboolean (lua_State *L, int idx) {
+  const TValue *o = index2adr(L, idx);
+  return !l_isfalse(o);
+}
+
+
+LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) {
+  StkId o = index2adr(L, idx);
+  if (!ttisstring(o)) {
+    lua_lock(L);  /* `luaV_tostring' may create a new string */
+    if (!luaV_tostring(L, o)) {  /* conversion failed? */
+      if (len != NULL) *len = 0;
+      lua_unlock(L);
+      return NULL;
+    }
+    luaC_checkGC(L);
+    o = index2adr(L, idx);  /* previous call may reallocate the stack */
+    lua_unlock(L);
+  }
+  if (len != NULL) *len = tsvalue(o)->len;
+  return svalue(o);
+}
+
+
+LUA_API size_t lua_objlen (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  switch (ttype(o)) {
+    case LUA_TSTRING: return tsvalue(o)->len;
+    case LUA_TUSERDATA: return uvalue(o)->len;
+    case LUA_TTABLE: return luaH_getn(hvalue(o));
+    case LUA_TNUMBER: {
+      size_t l;
+      lua_lock(L);  /* `luaV_tostring' may create a new string */
+      l = (luaV_tostring(L, o) ? tsvalue(o)->len : 0);
+      lua_unlock(L);
+      return l;
+    }
+    default: return 0;
+  }
+}
+
+
+LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  return (!iscfunction(o)) ? NULL : clvalue(o)->c.f;
+}
+
+
+LUA_API void *lua_touserdata (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  switch (ttype(o)) {
+    case LUA_TUSERDATA: return (rawuvalue(o) + 1);
+    case LUA_TLIGHTUSERDATA: return pvalue(o);
+    default: return NULL;
+  }
+}
+
+
+LUA_API lua_State *lua_tothread (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  return (!ttisthread(o)) ? NULL : thvalue(o);
+}
+
+
+LUA_API const void *lua_topointer (lua_State *L, int idx) {
+  StkId o = index2adr(L, idx);
+  switch (ttype(o)) {
+    case LUA_TTABLE: return hvalue(o);
+    case LUA_TFUNCTION: return clvalue(o);
+    case LUA_TTHREAD: return thvalue(o);
+    case LUA_TUSERDATA:
+    case LUA_TLIGHTUSERDATA:
+      return lua_touserdata(L, idx);
+    default: return NULL;
+  }
+}
+
+
+
+/*
+** push functions (C -> stack)
+*/
+
+
+LUA_API void lua_pushnil (lua_State *L) {
+  lua_lock(L);
+  setnilvalue(L->top);
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
+  lua_lock(L);
+  setnvalue(L->top, n);
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) {
+  lua_lock(L);
+  setnvalue(L->top, cast_num(n));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {
+  lua_lock(L);
+  luaC_checkGC(L);
+  setsvalue2s(L, L->top, luaS_newlstr(L, s, len));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushstring (lua_State *L, const char *s) {
+  if (s == NULL)
+    lua_pushnil(L);
+  else
+    lua_pushlstring(L, s, strlen(s));
+}
+
+
+LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt,
+                                      va_list argp) {
+  const char *ret;
+  lua_lock(L);
+  luaC_checkGC(L);
+  ret = luaO_pushvfstring(L, fmt, argp);
+  lua_unlock(L);
+  return ret;
+}
+
+
+LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) {
+  const char *ret;
+  va_list argp;
+  lua_lock(L);
+  luaC_checkGC(L);
+  va_start(argp, fmt);
+  ret = luaO_pushvfstring(L, fmt, argp);
+  va_end(argp);
+  lua_unlock(L);
+  return ret;
+}
+
+
+LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
+  Closure *cl;
+  lua_lock(L);
+  luaC_checkGC(L);
+  api_checknelems(L, n);
+  cl = luaF_newCclosure(L, n, getcurrenv(L));
+  cl->c.f = fn;
+  L->top -= n;
+  while (n--)
+    setobj2n(L, &cl->c.upvalue[n], L->top+n);
+  setclvalue(L, L->top, cl);
+  lua_assert(iswhite(obj2gco(cl)));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushboolean (lua_State *L, int b) {
+  lua_lock(L);
+  setbvalue(L->top, (b != 0));  /* ensure that true is 1 */
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_pushlightuserdata (lua_State *L, void *p) {
+  lua_lock(L);
+  setpvalue(L->top, p);
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API int lua_pushthread (lua_State *L) {
+  lua_lock(L);
+  setthvalue(L, L->top, L);
+  api_incr_top(L);
+  lua_unlock(L);
+  return (G(L)->mainthread == L);
+}
+
+
+
+/*
+** get functions (Lua -> stack)
+*/
+
+
+LUA_API void lua_gettable (lua_State *L, int idx) {
+  StkId t;
+  lua_lock(L);
+  t = index2adr(L, idx);
+  api_checkvalidindex(L, t);
+  luaV_gettable(L, t, L->top - 1, L->top - 1);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_getfield (lua_State *L, int idx, const char *k) {
+  StkId t;
+  TValue key;
+  lua_lock(L);
+  t = index2adr(L, idx);
+  api_checkvalidindex(L, t);
+  setsvalue(L, &key, luaS_new(L, k));
+  luaV_gettable(L, t, &key, L->top);
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_rawget (lua_State *L, int idx) {
+  StkId t;
+  lua_lock(L);
+  t = index2adr(L, idx);
+  api_check(L, ttistable(t));
+  setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1));
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_rawgeti (lua_State *L, int idx, int n) {
+  StkId o;
+  lua_lock(L);
+  o = index2adr(L, idx);
+  api_check(L, ttistable(o));
+  setobj2s(L, L->top, luaH_getnum(hvalue(o), n));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_createtable (lua_State *L, int narray, int nrec) {
+  lua_lock(L);
+  luaC_checkGC(L);
+  sethvalue(L, L->top, luaH_new(L, narray, nrec));
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+LUA_API int lua_getmetatable (lua_State *L, int objindex) {
+  const TValue *obj;
+  Table *mt = NULL;
+  int res;
+  lua_lock(L);
+  obj = index2adr(L, objindex);
+  switch (ttype(obj)) {
+    case LUA_TTABLE:
+      mt = hvalue(obj)->metatable;
+      break;
+    case LUA_TUSERDATA:
+      mt = uvalue(obj)->metatable;
+      break;
+    default:
+      mt = G(L)->mt[ttype(obj)];
+      break;
+  }
+  if (mt == NULL)
+    res = 0;
+  else {
+    sethvalue(L, L->top, mt);
+    api_incr_top(L);
+    res = 1;
+  }
+  lua_unlock(L);
+  return res;
+}
+
+
+LUA_API void lua_getfenv (lua_State *L, int idx) {
+  StkId o;
+  lua_lock(L);
+  o = index2adr(L, idx);
+  api_checkvalidindex(L, o);
+  switch (ttype(o)) {
+    case LUA_TFUNCTION:
+      sethvalue(L, L->top, clvalue(o)->c.env);
+      break;
+    case LUA_TUSERDATA:
+      sethvalue(L, L->top, uvalue(o)->env);
+      break;
+    case LUA_TTHREAD:
+      setobj2s(L, L->top,  gt(thvalue(o)));
+      break;
+    default:
+      setnilvalue(L->top);
+      break;
+  }
+  api_incr_top(L);
+  lua_unlock(L);
+}
+
+
+/*
+** set functions (stack -> Lua)
+*/
+
+
+LUA_API void lua_settable (lua_State *L, int idx) {
+  StkId t;
+  lua_lock(L);
+  api_checknelems(L, 2);
+  t = index2adr(L, idx);
+  api_checkvalidindex(L, t);
+  luaV_settable(L, t, L->top - 2, L->top - 1);
+  L->top -= 2;  /* pop index and value */
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_setfield (lua_State *L, int idx, const char *k) {
+  StkId t;
+  TValue key;
+  lua_lock(L);
+  api_checknelems(L, 1);
+  t = index2adr(L, idx);
+  api_checkvalidindex(L, t);
+  setsvalue(L, &key, luaS_new(L, k));
+  luaV_settable(L, t, &key, L->top - 1);
+  L->top--;  /* pop value */
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_rawset (lua_State *L, int idx) {
+  StkId t;
+  lua_lock(L);
+  api_checknelems(L, 2);
+  t = index2adr(L, idx);
+  api_check(L, ttistable(t));
+  setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1);
+  luaC_barriert(L, hvalue(t), L->top-1);
+  L->top -= 2;
+  lua_unlock(L);
+}
+
+
+LUA_API void lua_rawseti (lua_State *L, int idx, int n) {
+  StkId o;
+  lua_lock(L);
+  api_checknelems(L, 1);
+  o = index2adr(L, idx);
+  api_check(L, ttistable(o));
+  setobj2t(L, luaH_setnum(L, hvalue(o), n), L->top-1);
+  luaC_barriert(L, hvalue(o), L->top-1);
+  L->top--;
+  lua_unlock(L);
+}
+
+
+LUA_API int lua_setmetatable (lua_State *L, int objindex) {
+  TValue *obj;
+  Table *mt;
+  lua_lock(L);
+  api_checknelems(L, 1);
+  obj = index2adr(L, objindex);
+  api_checkvalidindex(L, obj);
+  if (ttisnil(L->top - 1))
+    mt = NULL;
+  else {
+    api_check(L, ttistable(L->top - 1));
+    mt = hvalue(L->top - 1);
+  }
+  switch (ttype(obj)) {
+    case LUA_TTABLE: {
+      hvalue(obj)->metatable = mt;
+      if (mt)
+        luaC_objbarriert(L, hvalue(obj), mt);
+      break;
+    }
+    case LUA_TUSERDATA: {
+      uvalue(obj)->metatable = mt;
+      if (mt)
+        luaC_objbarrier(L, rawuvalue(obj), mt);
+      break;
+    }
+    default: {
+      G(L)->mt[ttype(obj)] = mt;
+      break;
+    }
+  }
+  L->top--;
+  lua_unlock(L);
+  return 1;
+}
+
+
+LUA_API int lua_setfenv (lua_State *L, int idx) {
+  StkId o;
+  int res = 1;
+  lua_lock(L);
+  api_checknelems(L, 1);
+  o = index2adr(L, idx);
+  api_checkvalidindex(L, o);
+  api_check(L, ttistable(L->top - 1));
+  switch (ttype(o)) {
+    case LUA_TFUNCTION:
+      clvalue(o)->c.env = hvalue(L->top - 1);
+      break;
+    case LUA_TUSERDATA:
+      uvalue(o)->env = hvalue(L->top - 1);
+      break;
+    case LUA_TTHREAD:
+      sethvalue(L, gt(thvalue(o)), hvalue(L->top - 1));
+      break;
+    default:
+      res = 0;
+      break;
+  }
+  if (res) luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1));
+  L->top--;
+  lua_unlock(L);
+  return res;
+}
+
+
+/*
+** `load' and `call' functions (run Lua code)
+*/
+
+
+#define adjustresults(L,nres) \
+    { if (nres == LUA_MULTRET && L->top >= L->ci->top) L->ci->top = L->top; }
+
+
+#define checkresults(L,na,nr) \
+     api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)))
+	
+
+LUA_API void lua_call (lua_State *L, int nargs, int nresults) {
+  StkId func;
+  lua_lock(L);
+  api_checknelems(L, nargs+1);
+  checkresults(L, nargs, nresults);
+  func = L->top - (nargs+1);
+  luaD_call(L, func, nresults);
+  adjustresults(L, nresults);
+  lua_unlock(L);
+}
+
+
+
+/*
+** Execute a protected call.
+*/
+struct CallS {  /* data to `f_call' */
+  StkId func;
+  int nresults;
+};
+
+
+static void f_call (lua_State *L, void *ud) {
+  struct CallS *c = cast(struct CallS *, ud);
+  luaD_call(L, c->func, c->nresults);
+}
+
+
+
+LUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc) {
+  struct CallS c;
+  int status;
+  ptrdiff_t func;
+  lua_lock(L);
+  api_checknelems(L, nargs+1);
+  checkresults(L, nargs, nresults);
+  if (errfunc == 0)
+    func = 0;
+  else {
+    StkId o = index2adr(L, errfunc);
+    api_checkvalidindex(L, o);
+    func = savestack(L, o);
+  }
+  c.func = L->top - (nargs+1);  /* function to be called */
+  c.nresults = nresults;
+  status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func);
+  adjustresults(L, nresults);
+  lua_unlock(L);
+  return status;
+}
+
+
+/*
+** Execute a protected C call.
+*/
+struct CCallS {  /* data to `f_Ccall' */
+  lua_CFunction func;
+  void *ud;
+};
+
+
+static void f_Ccall (lua_State *L, void *ud) {
+  struct CCallS *c = cast(struct CCallS *, ud);
+  Closure *cl;
+  cl = luaF_newCclosure(L, 0, getcurrenv(L));
+  cl->c.f = c->func;
+  setclvalue(L, L->top, cl);  /* push function */
+  api_incr_top(L);
+  setpvalue(L->top, c->ud);  /* push only argument */
+  api_incr_top(L);
+  luaD_call(L, L->top - 2, 0);
+}
+
+
+LUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud) {
+  struct CCallS c;
+  int status;
+  lua_lock(L);
+  c.func = func;
+  c.ud = ud;
+  status = luaD_pcall(L, f_Ccall, &c, savestack(L, L->top), 0);
+  lua_unlock(L);
+  return status;
+}
+
+
+LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data,
+                      const char *chunkname) {
+  ZIO z;
+  int status;
+  lua_lock(L);
+  if (!chunkname) chunkname = "?";
+  luaZ_init(L, &z, reader, data);
+  status = luaD_protectedparser(L, &z, chunkname);
+  lua_unlock(L);
+  return status;
+}
+
+
+LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) {
+  int status;
+  TValue *o;
+  lua_lock(L);
+  api_checknelems(L, 1);
+  o = L->top - 1;
+  if (isLfunction(o))
+    status = luaU_dump(L, clvalue(o)->l.p, writer, data, 0);
+  else
+    status = 1;
+  lua_unlock(L);
+  return status;
+}
+
+
+LUA_API int  lua_status (lua_State *L) {
+  return L->status;
+}
+
+
+/*
+** Garbage-collection function
+*/
+
+LUA_API int lua_gc (lua_State *L, int what, int data) {
+  int res = 0;
+  global_State *g;
+  lua_lock(L);
+  g = G(L);
+  switch (what) {
+    case LUA_GCSTOP: {
+      g->GCthreshold = MAX_LUMEM;
+      break;
+    }
+    case LUA_GCRESTART: {
+      g->GCthreshold = g->totalbytes;
+      break;
+    }
+    case LUA_GCCOLLECT: {
+      luaC_fullgc(L);
+      break;
+    }
+    case LUA_GCCOUNT: {
+      /* GC values are expressed in Kbytes: #bytes/2^10 */
+      res = cast_int(g->totalbytes >> 10);
+      break;
+    }
+    case LUA_GCCOUNTB: {
+      res = cast_int(g->totalbytes & 0x3ff);
+      break;
+    }
+    case LUA_GCSTEP: {
+      lu_mem a = (cast(lu_mem, data) << 10);
+      if (a <= g->totalbytes)
+        g->GCthreshold = g->totalbytes - a;
+      else
+        g->GCthreshold = 0;
+      while (g->GCthreshold <= g->totalbytes) {
+        luaC_step(L);
+        if (g->gcstate == GCSpause) {  /* end of cycle? */
+          res = 1;  /* signal it */
+          break;
+        }
+      }
+      break;
+    }
+    case LUA_GCSETPAUSE: {
+      res = g->gcpause;
+      g->gcpause = data;
+      break;
+    }
+    case LUA_GCSETSTEPMUL: {
+      res = g->gcstepmul;
+      g->gcstepmul = data;
+      break;
+    }
+    default: res = -1;  /* invalid option */
+  }
+  lua_unlock(L);
+  return res;
+}
+
+
+
+/*
+** miscellaneous functions
+*/
+
+
+LUA_API int lua_error (lua_State *L) {
+  lua_lock(L);
+  api_checknelems(L, 1);
+  luaG_errormsg(L);
+  lua_unlock(L);
+  return 0;  /* to avoid warnings */
+}
+
+
+LUA_API int lua_next (lua_State *L, int idx) {
+  StkId t;
+  int more;
+  lua_lock(L);
+  t = index2adr(L, idx);
+  api_check(L, ttistable(t));
+  more = luaH_next(L, hvalue(t), L->top - 1);
+  if (more) {
+    api_incr_top(L);
+  }
+  else  /* no more elements */
+    L->top -= 1;  /* remove key */
+  lua_unlock(L);
+  return more;
+}
+
+
+LUA_API void lua_concat (lua_State *L, int n) {
+  lua_lock(L);
+  api_checknelems(L, n);
+  if (n >= 2) {
+    luaC_checkGC(L);
+    luaV_concat(L, n, cast_int(L->top - L->base) - 1);
+    L->top -= (n-1);
+  }
+  else if (n == 0) {  /* push empty string */
+    setsvalue2s(L, L->top, luaS_newlstr(L, "", 0));
+    api_incr_top(L);
+  }
+  /* else n == 1; nothing to do */
+  lua_unlock(L);
+}
+
+
+LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) {
+  lua_Alloc f;
+  lua_lock(L);
+  if (ud) *ud = G(L)->ud;
+  f = G(L)->frealloc;
+  lua_unlock(L);
+  return f;
+}
+
+
+LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) {
+  lua_lock(L);
+  G(L)->ud = ud;
+  G(L)->frealloc = f;
+  lua_unlock(L);
+}
+
+
+LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
+  Udata *u;
+  lua_lock(L);
+  luaC_checkGC(L);
+  u = luaS_newudata(L, size, getcurrenv(L));
+  setuvalue(L, L->top, u);
+  api_incr_top(L);
+  lua_unlock(L);
+  return u + 1;
+}
+
+
+
+
+static const char *aux_upvalue (StkId fi, int n, TValue **val) {
+  Closure *f;
+  if (!ttisfunction(fi)) return NULL;
+  f = clvalue(fi);
+  if (f->c.isC) {
+    if (!(1 <= n && n <= f->c.nupvalues)) return NULL;
+    *val = &f->c.upvalue[n-1];
+    return "";
+  }
+  else {
+    Proto *p = f->l.p;
+    if (!(1 <= n && n <= p->sizeupvalues)) return NULL;
+    *val = f->l.upvals[n-1]->v;
+    return getstr(p->upvalues[n-1]);
+  }
+}
+
+
+LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) {
+  const char *name;
+  TValue *val;
+  lua_lock(L);
+  name = aux_upvalue(index2adr(L, funcindex), n, &val);
+  if (name) {
+    setobj2s(L, L->top, val);
+    api_incr_top(L);
+  }
+  lua_unlock(L);
+  return name;
+}
+
+
+LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) {
+  const char *name;
+  TValue *val;
+  StkId fi;
+  lua_lock(L);
+  fi = index2adr(L, funcindex);
+  api_checknelems(L, 1);
+  name = aux_upvalue(fi, n, &val);
+  if (name) {
+    L->top--;
+    setobj(L, val, L->top);
+    luaC_barrier(L, clvalue(fi), L->top);
+  }
+  lua_unlock(L);
+  return name;
+}
+
diff --git a/redis-stable/deps/lua/src/lapi.h b/redis-stable/deps/lua/src/lapi.h
new file mode 100644
index 00000000..2c3fab24
--- /dev/null
+++ b/redis-stable/deps/lua/src/lapi.h
@@ -0,0 +1,16 @@
+/*
+** $Id: lapi.h,v 2.2.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions from Lua API
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lapi_h
+#define lapi_h
+
+
+#include "lobject.h"
+
+
+LUAI_FUNC void luaA_pushobject (lua_State *L, const TValue *o);
+
+#endif
diff --git a/redis-stable/deps/lua/src/lauxlib.c b/redis-stable/deps/lua/src/lauxlib.c
new file mode 100644
index 00000000..751f1e88
--- /dev/null
+++ b/redis-stable/deps/lua/src/lauxlib.c
@@ -0,0 +1,652 @@
+/*
+** $Id: lauxlib.c,v 1.159.1.3 2008/01/21 13:20:51 roberto Exp $
+** Auxiliary functions for building Lua libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <errno.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+/* This file uses only the official API of Lua.
+** Any function declared here could be written as an application function.
+*/
+
+#define lauxlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+
+
+#define FREELIST_REF	0	/* free list of references */
+
+
+/* convert a stack index to positive */
+#define abs_index(L, i)		((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \
+					lua_gettop(L) + (i) + 1)
+
+
+/*
+** {======================================================
+** Error-report functions
+** =======================================================
+*/
+
+
+LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
+  lua_Debug ar;
+  if (!lua_getstack(L, 0, &ar))  /* no stack frame? */
+    return luaL_error(L, "bad argument #%d (%s)", narg, extramsg);
+  lua_getinfo(L, "n", &ar);
+  if (strcmp(ar.namewhat, "method") == 0) {
+    narg--;  /* do not count `self' */
+    if (narg == 0)  /* error is in the self argument itself? */
+      return luaL_error(L, "calling " LUA_QS " on bad self (%s)",
+                           ar.name, extramsg);
+  }
+  if (ar.name == NULL)
+    ar.name = "?";
+  return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)",
+                        narg, ar.name, extramsg);
+}
+
+
+LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {
+  const char *msg = lua_pushfstring(L, "%s expected, got %s",
+                                    tname, luaL_typename(L, narg));
+  return luaL_argerror(L, narg, msg);
+}
+
+
+static void tag_error (lua_State *L, int narg, int tag) {
+  luaL_typerror(L, narg, lua_typename(L, tag));
+}
+
+
+LUALIB_API void luaL_where (lua_State *L, int level) {
+  lua_Debug ar;
+  if (lua_getstack(L, level, &ar)) {  /* check function at level */
+    lua_getinfo(L, "Sl", &ar);  /* get info about it */
+    if (ar.currentline > 0) {  /* is there info? */
+      lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
+      return;
+    }
+  }
+  lua_pushliteral(L, "");  /* else, no information available... */
+}
+
+
+LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
+  va_list argp;
+  va_start(argp, fmt);
+  luaL_where(L, 1);
+  lua_pushvfstring(L, fmt, argp);
+  va_end(argp);
+  lua_concat(L, 2);
+  return lua_error(L);
+}
+
+/* }====================================================== */
+
+
+LUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def,
+                                 const char *const lst[]) {
+  const char *name = (def) ? luaL_optstring(L, narg, def) :
+                             luaL_checkstring(L, narg);
+  int i;
+  for (i=0; lst[i]; i++)
+    if (strcmp(lst[i], name) == 0)
+      return i;
+  return luaL_argerror(L, narg,
+                       lua_pushfstring(L, "invalid option " LUA_QS, name));
+}
+
+
+LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
+  lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get registry.name */
+  if (!lua_isnil(L, -1))  /* name already in use? */
+    return 0;  /* leave previous value on top, but return 0 */
+  lua_pop(L, 1);
+  lua_newtable(L);  /* create metatable */
+  lua_pushvalue(L, -1);
+  lua_setfield(L, LUA_REGISTRYINDEX, tname);  /* registry.name = metatable */
+  return 1;
+}
+
+
+LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
+  void *p = lua_touserdata(L, ud);
+  if (p != NULL) {  /* value is a userdata? */
+    if (lua_getmetatable(L, ud)) {  /* does it have a metatable? */
+      lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get correct metatable */
+      if (lua_rawequal(L, -1, -2)) {  /* does it have the correct mt? */
+        lua_pop(L, 2);  /* remove both metatables */
+        return p;
+      }
+    }
+  }
+  luaL_typerror(L, ud, tname);  /* else error */
+  return NULL;  /* to avoid warnings */
+}
+
+
+LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
+  if (!lua_checkstack(L, space))
+    luaL_error(L, "stack overflow (%s)", mes);
+}
+
+
+LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
+  if (lua_type(L, narg) != t)
+    tag_error(L, narg, t);
+}
+
+
+LUALIB_API void luaL_checkany (lua_State *L, int narg) {
+  if (lua_type(L, narg) == LUA_TNONE)
+    luaL_argerror(L, narg, "value expected");
+}
+
+
+LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
+  const char *s = lua_tolstring(L, narg, len);
+  if (!s) tag_error(L, narg, LUA_TSTRING);
+  return s;
+}
+
+
+LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
+                                        const char *def, size_t *len) {
+  if (lua_isnoneornil(L, narg)) {
+    if (len)
+      *len = (def ? strlen(def) : 0);
+    return def;
+  }
+  else return luaL_checklstring(L, narg, len);
+}
+
+
+LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
+  lua_Number d = lua_tonumber(L, narg);
+  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */
+    tag_error(L, narg, LUA_TNUMBER);
+  return d;
+}
+
+
+LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
+  return luaL_opt(L, luaL_checknumber, narg, def);
+}
+
+
+LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {
+  lua_Integer d = lua_tointeger(L, narg);
+  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */
+    tag_error(L, narg, LUA_TNUMBER);
+  return d;
+}
+
+
+LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg,
+                                                      lua_Integer def) {
+  return luaL_opt(L, luaL_checkinteger, narg, def);
+}
+
+
+LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
+  if (!lua_getmetatable(L, obj))  /* no metatable? */
+    return 0;
+  lua_pushstring(L, event);
+  lua_rawget(L, -2);
+  if (lua_isnil(L, -1)) {
+    lua_pop(L, 2);  /* remove metatable and metafield */
+    return 0;
+  }
+  else {
+    lua_remove(L, -2);  /* remove only metatable */
+    return 1;
+  }
+}
+
+
+LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
+  obj = abs_index(L, obj);
+  if (!luaL_getmetafield(L, obj, event))  /* no metafield? */
+    return 0;
+  lua_pushvalue(L, obj);
+  lua_call(L, 1, 1);
+  return 1;
+}
+
+
+LUALIB_API void (luaL_register) (lua_State *L, const char *libname,
+                                const luaL_Reg *l) {
+  luaI_openlib(L, libname, l, 0);
+}
+
+
+static int libsize (const luaL_Reg *l) {
+  int size = 0;
+  for (; l->name; l++) size++;
+  return size;
+}
+
+
+LUALIB_API void luaI_openlib (lua_State *L, const char *libname,
+                              const luaL_Reg *l, int nup) {
+  if (libname) {
+    int size = libsize(l);
+    /* check whether lib already exists */
+    luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1);
+    lua_getfield(L, -1, libname);  /* get _LOADED[libname] */
+    if (!lua_istable(L, -1)) {  /* not found? */
+      lua_pop(L, 1);  /* remove previous result */
+      /* try global variable (and create one if it does not exist) */
+      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)
+        luaL_error(L, "name conflict for module " LUA_QS, libname);
+      lua_pushvalue(L, -1);
+      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */
+    }
+    lua_remove(L, -2);  /* remove _LOADED table */
+    lua_insert(L, -(nup+1));  /* move library table to below upvalues */
+  }
+  for (; l->name; l++) {
+    int i;
+    for (i=0; i<nup; i++)  /* copy upvalues to the top */
+      lua_pushvalue(L, -nup);
+    lua_pushcclosure(L, l->func, nup);
+    lua_setfield(L, -(nup+2), l->name);
+  }
+  lua_pop(L, nup);  /* remove upvalues */
+}
+
+
+
+/*
+** {======================================================
+** getn-setn: size for arrays
+** =======================================================
+*/
+
+#if defined(LUA_COMPAT_GETN)
+
+static int checkint (lua_State *L, int topop) {
+  int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1;
+  lua_pop(L, topop);
+  return n;
+}
+
+
+static void getsizes (lua_State *L) {
+  lua_getfield(L, LUA_REGISTRYINDEX, "LUA_SIZES");
+  if (lua_isnil(L, -1)) {  /* no `size' table? */
+    lua_pop(L, 1);  /* remove nil */
+    lua_newtable(L);  /* create it */
+    lua_pushvalue(L, -1);  /* `size' will be its own metatable */
+    lua_setmetatable(L, -2);
+    lua_pushliteral(L, "kv");
+    lua_setfield(L, -2, "__mode");  /* metatable(N).__mode = "kv" */
+    lua_pushvalue(L, -1);
+    lua_setfield(L, LUA_REGISTRYINDEX, "LUA_SIZES");  /* store in register */
+  }
+}
+
+
+LUALIB_API void luaL_setn (lua_State *L, int t, int n) {
+  t = abs_index(L, t);
+  lua_pushliteral(L, "n");
+  lua_rawget(L, t);
+  if (checkint(L, 1) >= 0) {  /* is there a numeric field `n'? */
+    lua_pushliteral(L, "n");  /* use it */
+    lua_pushinteger(L, n);
+    lua_rawset(L, t);
+  }
+  else {  /* use `sizes' */
+    getsizes(L);
+    lua_pushvalue(L, t);
+    lua_pushinteger(L, n);
+    lua_rawset(L, -3);  /* sizes[t] = n */
+    lua_pop(L, 1);  /* remove `sizes' */
+  }
+}
+
+
+LUALIB_API int luaL_getn (lua_State *L, int t) {
+  int n;
+  t = abs_index(L, t);
+  lua_pushliteral(L, "n");  /* try t.n */
+  lua_rawget(L, t);
+  if ((n = checkint(L, 1)) >= 0) return n;
+  getsizes(L);  /* else try sizes[t] */
+  lua_pushvalue(L, t);
+  lua_rawget(L, -2);
+  if ((n = checkint(L, 2)) >= 0) return n;
+  return (int)lua_objlen(L, t);
+}
+
+#endif
+
+/* }====================================================== */
+
+
+
+LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,
+                                                               const char *r) {
+  const char *wild;
+  size_t l = strlen(p);
+  luaL_Buffer b;
+  luaL_buffinit(L, &b);
+  while ((wild = strstr(s, p)) != NULL) {
+    luaL_addlstring(&b, s, wild - s);  /* push prefix */
+    luaL_addstring(&b, r);  /* push replacement in place of pattern */
+    s = wild + l;  /* continue after `p' */
+  }
+  luaL_addstring(&b, s);  /* push last suffix */
+  luaL_pushresult(&b);
+  return lua_tostring(L, -1);
+}
+
+
+LUALIB_API const char *luaL_findtable (lua_State *L, int idx,
+                                       const char *fname, int szhint) {
+  const char *e;
+  lua_pushvalue(L, idx);
+  do {
+    e = strchr(fname, '.');
+    if (e == NULL) e = fname + strlen(fname);
+    lua_pushlstring(L, fname, e - fname);
+    lua_rawget(L, -2);
+    if (lua_isnil(L, -1)) {  /* no such field? */
+      lua_pop(L, 1);  /* remove this nil */
+      lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */
+      lua_pushlstring(L, fname, e - fname);
+      lua_pushvalue(L, -2);
+      lua_settable(L, -4);  /* set new table into field */
+    }
+    else if (!lua_istable(L, -1)) {  /* field has a non-table value? */
+      lua_pop(L, 2);  /* remove table and value */
+      return fname;  /* return problematic part of the name */
+    }
+    lua_remove(L, -2);  /* remove previous table */
+    fname = e + 1;
+  } while (*e == '.');
+  return NULL;
+}
+
+
+
+/*
+** {======================================================
+** Generic Buffer manipulation
+** =======================================================
+*/
+
+
+#define bufflen(B)	((B)->p - (B)->buffer)
+#define bufffree(B)	((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
+
+#define LIMIT	(LUA_MINSTACK/2)
+
+
+static int emptybuffer (luaL_Buffer *B) {
+  size_t l = bufflen(B);
+  if (l == 0) return 0;  /* put nothing on stack */
+  else {
+    lua_pushlstring(B->L, B->buffer, l);
+    B->p = B->buffer;
+    B->lvl++;
+    return 1;
+  }
+}
+
+
+static void adjuststack (luaL_Buffer *B) {
+  if (B->lvl > 1) {
+    lua_State *L = B->L;
+    int toget = 1;  /* number of levels to concat */
+    size_t toplen = lua_strlen(L, -1);
+    do {
+      size_t l = lua_strlen(L, -(toget+1));
+      if (B->lvl - toget + 1 >= LIMIT || toplen > l) {
+        toplen += l;
+        toget++;
+      }
+      else break;
+    } while (toget < B->lvl);
+    lua_concat(L, toget);
+    B->lvl = B->lvl - toget + 1;
+  }
+}
+
+
+LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
+  if (emptybuffer(B))
+    adjuststack(B);
+  return B->buffer;
+}
+
+
+LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
+  while (l--)
+    luaL_addchar(B, *s++);
+}
+
+
+LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
+  luaL_addlstring(B, s, strlen(s));
+}
+
+
+LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
+  emptybuffer(B);
+  lua_concat(B->L, B->lvl);
+  B->lvl = 1;
+}
+
+
+LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
+  lua_State *L = B->L;
+  size_t vl;
+  const char *s = lua_tolstring(L, -1, &vl);
+  if (vl <= bufffree(B)) {  /* fit into buffer? */
+    memcpy(B->p, s, vl);  /* put it there */
+    B->p += vl;
+    lua_pop(L, 1);  /* remove from stack */
+  }
+  else {
+    if (emptybuffer(B))
+      lua_insert(L, -2);  /* put buffer before new value */
+    B->lvl++;  /* add new value into B stack */
+    adjuststack(B);
+  }
+}
+
+
+LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
+  B->L = L;
+  B->p = B->buffer;
+  B->lvl = 0;
+}
+
+/* }====================================================== */
+
+
+LUALIB_API int luaL_ref (lua_State *L, int t) {
+  int ref;
+  t = abs_index(L, t);
+  if (lua_isnil(L, -1)) {
+    lua_pop(L, 1);  /* remove from stack */
+    return LUA_REFNIL;  /* `nil' has a unique fixed reference */
+  }
+  lua_rawgeti(L, t, FREELIST_REF);  /* get first free element */
+  ref = (int)lua_tointeger(L, -1);  /* ref = t[FREELIST_REF] */
+  lua_pop(L, 1);  /* remove it from stack */
+  if (ref != 0) {  /* any free element? */
+    lua_rawgeti(L, t, ref);  /* remove it from list */
+    lua_rawseti(L, t, FREELIST_REF);  /* (t[FREELIST_REF] = t[ref]) */
+  }
+  else {  /* no free elements */
+    ref = (int)lua_objlen(L, t);
+    ref++;  /* create new reference */
+  }
+  lua_rawseti(L, t, ref);
+  return ref;
+}
+
+
+LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
+  if (ref >= 0) {
+    t = abs_index(L, t);
+    lua_rawgeti(L, t, FREELIST_REF);
+    lua_rawseti(L, t, ref);  /* t[ref] = t[FREELIST_REF] */
+    lua_pushinteger(L, ref);
+    lua_rawseti(L, t, FREELIST_REF);  /* t[FREELIST_REF] = ref */
+  }
+}
+
+
+
+/*
+** {======================================================
+** Load functions
+** =======================================================
+*/
+
+typedef struct LoadF {
+  int extraline;
+  FILE *f;
+  char buff[LUAL_BUFFERSIZE];
+} LoadF;
+
+
+static const char *getF (lua_State *L, void *ud, size_t *size) {
+  LoadF *lf = (LoadF *)ud;
+  (void)L;
+  if (lf->extraline) {
+    lf->extraline = 0;
+    *size = 1;
+    return "\n";
+  }
+  if (feof(lf->f)) return NULL;
+  *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f);
+  return (*size > 0) ? lf->buff : NULL;
+}
+
+
+static int errfile (lua_State *L, const char *what, int fnameindex) {
+  const char *serr = strerror(errno);
+  const char *filename = lua_tostring(L, fnameindex) + 1;
+  lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
+  lua_remove(L, fnameindex);
+  return LUA_ERRFILE;
+}
+
+
+LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
+  LoadF lf;
+  int status, readstatus;
+  int c;
+  int fnameindex = lua_gettop(L) + 1;  /* index of filename on the stack */
+  lf.extraline = 0;
+  if (filename == NULL) {
+    lua_pushliteral(L, "=stdin");
+    lf.f = stdin;
+  }
+  else {
+    lua_pushfstring(L, "@%s", filename);
+    lf.f = fopen(filename, "r");
+    if (lf.f == NULL) return errfile(L, "open", fnameindex);
+  }
+  c = getc(lf.f);
+  if (c == '#') {  /* Unix exec. file? */
+    lf.extraline = 1;
+    while ((c = getc(lf.f)) != EOF && c != '\n') ;  /* skip first line */
+    if (c == '\n') c = getc(lf.f);
+  }
+  if (c == LUA_SIGNATURE[0] && filename) {  /* binary file? */
+    lf.f = freopen(filename, "rb", lf.f);  /* reopen in binary mode */
+    if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
+    /* skip eventual `#!...' */
+   while ((c = getc(lf.f)) != EOF && c != LUA_SIGNATURE[0]) ;
+   lf.extraline = 0;
+  }
+  ungetc(c, lf.f);
+  status = lua_load(L, getF, &lf, lua_tostring(L, -1));
+  readstatus = ferror(lf.f);
+  if (filename) fclose(lf.f);  /* close file (even in case of errors) */
+  if (readstatus) {
+    lua_settop(L, fnameindex);  /* ignore results from `lua_load' */
+    return errfile(L, "read", fnameindex);
+  }
+  lua_remove(L, fnameindex);
+  return status;
+}
+
+
+typedef struct LoadS {
+  const char *s;
+  size_t size;
+} LoadS;
+
+
+static const char *getS (lua_State *L, void *ud, size_t *size) {
+  LoadS *ls = (LoadS *)ud;
+  (void)L;
+  if (ls->size == 0) return NULL;
+  *size = ls->size;
+  ls->size = 0;
+  return ls->s;
+}
+
+
+LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,
+                                const char *name) {
+  LoadS ls;
+  ls.s = buff;
+  ls.size = size;
+  return lua_load(L, getS, &ls, name);
+}
+
+
+LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s) {
+  return luaL_loadbuffer(L, s, strlen(s), s);
+}
+
+
+
+/* }====================================================== */
+
+
+static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
+  (void)ud;
+  (void)osize;
+  if (nsize == 0) {
+    free(ptr);
+    return NULL;
+  }
+  else
+    return realloc(ptr, nsize);
+}
+
+
+static int panic (lua_State *L) {
+  (void)L;  /* to avoid warnings */
+  fprintf(stderr, "PANIC: unprotected error in call to Lua API (%s)\n",
+                   lua_tostring(L, -1));
+  return 0;
+}
+
+
+LUALIB_API lua_State *luaL_newstate (void) {
+  lua_State *L = lua_newstate(l_alloc, NULL);
+  if (L) lua_atpanic(L, &panic);
+  return L;
+}
+
diff --git a/redis-stable/deps/lua/src/lauxlib.h b/redis-stable/deps/lua/src/lauxlib.h
new file mode 100644
index 00000000..34258235
--- /dev/null
+++ b/redis-stable/deps/lua/src/lauxlib.h
@@ -0,0 +1,174 @@
+/*
+** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions for building Lua libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lauxlib_h
+#define lauxlib_h
+
+
+#include <stddef.h>
+#include <stdio.h>
+
+#include "lua.h"
+
+
+#if defined(LUA_COMPAT_GETN)
+LUALIB_API int (luaL_getn) (lua_State *L, int t);
+LUALIB_API void (luaL_setn) (lua_State *L, int t, int n);
+#else
+#define luaL_getn(L,i)          ((int)lua_objlen(L, i))
+#define luaL_setn(L,i,j)        ((void)0)  /* no op! */
+#endif
+
+#if defined(LUA_COMPAT_OPENLIB)
+#define luaI_openlib	luaL_openlib
+#endif
+
+
+/* extra error code for `luaL_load' */
+#define LUA_ERRFILE     (LUA_ERRERR+1)
+
+
+typedef struct luaL_Reg {
+  const char *name;
+  lua_CFunction func;
+} luaL_Reg;
+
+
+
+LUALIB_API void (luaI_openlib) (lua_State *L, const char *libname,
+                                const luaL_Reg *l, int nup);
+LUALIB_API void (luaL_register) (lua_State *L, const char *libname,
+                                const luaL_Reg *l);
+LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e);
+LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e);
+LUALIB_API int (luaL_typerror) (lua_State *L, int narg, const char *tname);
+LUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg);
+LUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg,
+                                                          size_t *l);
+LUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg,
+                                          const char *def, size_t *l);
+LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg);
+LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def);
+
+LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);
+LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,
+                                          lua_Integer def);
+
+LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);
+LUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t);
+LUALIB_API void (luaL_checkany) (lua_State *L, int narg);
+
+LUALIB_API int   (luaL_newmetatable) (lua_State *L, const char *tname);
+LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname);
+
+LUALIB_API void (luaL_where) (lua_State *L, int lvl);
+LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);
+
+LUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,
+                                   const char *const lst[]);
+
+LUALIB_API int (luaL_ref) (lua_State *L, int t);
+LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref);
+
+LUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename);
+LUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,
+                                  const char *name);
+LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);
+
+LUALIB_API lua_State *(luaL_newstate) (void);
+
+
+LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,
+                                                  const char *r);
+
+LUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,
+                                         const char *fname, int szhint);
+
+
+
+
+/*
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define luaL_argcheck(L, cond,numarg,extramsg)	\
+		((void)((cond) || luaL_argerror(L, (numarg), (extramsg))))
+#define luaL_checkstring(L,n)	(luaL_checklstring(L, (n), NULL))
+#define luaL_optstring(L,n,d)	(luaL_optlstring(L, (n), (d), NULL))
+#define luaL_checkint(L,n)	((int)luaL_checkinteger(L, (n)))
+#define luaL_optint(L,n,d)	((int)luaL_optinteger(L, (n), (d)))
+#define luaL_checklong(L,n)	((long)luaL_checkinteger(L, (n)))
+#define luaL_optlong(L,n,d)	((long)luaL_optinteger(L, (n), (d)))
+
+#define luaL_typename(L,i)	lua_typename(L, lua_type(L,(i)))
+
+#define luaL_dofile(L, fn) \
+	(luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))
+
+#define luaL_dostring(L, s) \
+	(luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))
+
+#define luaL_getmetatable(L,n)	(lua_getfield(L, LUA_REGISTRYINDEX, (n)))
+
+#define luaL_opt(L,f,n,d)	(lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))
+
+/*
+** {======================================================
+** Generic Buffer manipulation
+** =======================================================
+*/
+
+
+
+typedef struct luaL_Buffer {
+  char *p;			/* current position in buffer */
+  int lvl;  /* number of strings in the stack (level) */
+  lua_State *L;
+  char buffer[LUAL_BUFFERSIZE];
+} luaL_Buffer;
+
+#define luaL_addchar(B,c) \
+  ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \
+   (*(B)->p++ = (char)(c)))
+
+/* compatibility only */
+#define luaL_putchar(B,c)	luaL_addchar(B,c)
+
+#define luaL_addsize(B,n)	((B)->p += (n))
+
+LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B);
+LUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B);
+LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l);
+LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s);
+LUALIB_API void (luaL_addvalue) (luaL_Buffer *B);
+LUALIB_API void (luaL_pushresult) (luaL_Buffer *B);
+
+
+/* }====================================================== */
+
+
+/* compatibility with ref system */
+
+/* pre-defined references */
+#define LUA_NOREF       (-2)
+#define LUA_REFNIL      (-1)
+
+#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \
+      (lua_pushstring(L, "unlocked references are obsolete"), lua_error(L), 0))
+
+#define lua_unref(L,ref)        luaL_unref(L, LUA_REGISTRYINDEX, (ref))
+
+#define lua_getref(L,ref)       lua_rawgeti(L, LUA_REGISTRYINDEX, (ref))
+
+
+#define luaL_reg	luaL_Reg
+
+#endif
+
+
diff --git a/redis-stable/deps/lua/src/lbaselib.c b/redis-stable/deps/lua/src/lbaselib.c
new file mode 100644
index 00000000..2ab550bd
--- /dev/null
+++ b/redis-stable/deps/lua/src/lbaselib.c
@@ -0,0 +1,653 @@
+/*
+** $Id: lbaselib.c,v 1.191.1.6 2008/02/14 16:46:22 roberto Exp $
+** Basic library
+** See Copyright Notice in lua.h
+*/
+
+
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lbaselib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+
+/*
+** If your system does not support `stdout', you can just remove this function.
+** If you need, you can define your own `print' function, following this
+** model but changing `fputs' to put the strings at a proper place
+** (a console window or a log file, for instance).
+*/
+static int luaB_print (lua_State *L) {
+  int n = lua_gettop(L);  /* number of arguments */
+  int i;
+  lua_getglobal(L, "tostring");
+  for (i=1; i<=n; i++) {
+    const char *s;
+    lua_pushvalue(L, -1);  /* function to be called */
+    lua_pushvalue(L, i);   /* value to print */
+    lua_call(L, 1, 1);
+    s = lua_tostring(L, -1);  /* get result */
+    if (s == NULL)
+      return luaL_error(L, LUA_QL("tostring") " must return a string to "
+                           LUA_QL("print"));
+    if (i>1) fputs("\t", stdout);
+    fputs(s, stdout);
+    lua_pop(L, 1);  /* pop result */
+  }
+  fputs("\n", stdout);
+  return 0;
+}
+
+
+static int luaB_tonumber (lua_State *L) {
+  int base = luaL_optint(L, 2, 10);
+  if (base == 10) {  /* standard conversion */
+    luaL_checkany(L, 1);
+    if (lua_isnumber(L, 1)) {
+      lua_pushnumber(L, lua_tonumber(L, 1));
+      return 1;
+    }
+  }
+  else {
+    const char *s1 = luaL_checkstring(L, 1);
+    char *s2;
+    unsigned long n;
+    luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range");
+    n = strtoul(s1, &s2, base);
+    if (s1 != s2) {  /* at least one valid digit? */
+      while (isspace((unsigned char)(*s2))) s2++;  /* skip trailing spaces */
+      if (*s2 == '\0') {  /* no invalid trailing characters? */
+        lua_pushnumber(L, (lua_Number)n);
+        return 1;
+      }
+    }
+  }
+  lua_pushnil(L);  /* else not a number */
+  return 1;
+}
+
+
+static int luaB_error (lua_State *L) {
+  int level = luaL_optint(L, 2, 1);
+  lua_settop(L, 1);
+  if (lua_isstring(L, 1) && level > 0) {  /* add extra information? */
+    luaL_where(L, level);
+    lua_pushvalue(L, 1);
+    lua_concat(L, 2);
+  }
+  return lua_error(L);
+}
+
+
+static int luaB_getmetatable (lua_State *L) {
+  luaL_checkany(L, 1);
+  if (!lua_getmetatable(L, 1)) {
+    lua_pushnil(L);
+    return 1;  /* no metatable */
+  }
+  luaL_getmetafield(L, 1, "__metatable");
+  return 1;  /* returns either __metatable field (if present) or metatable */
+}
+
+
+static int luaB_setmetatable (lua_State *L) {
+  int t = lua_type(L, 2);
+  luaL_checktype(L, 1, LUA_TTABLE);
+  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,
+                    "nil or table expected");
+  if (luaL_getmetafield(L, 1, "__metatable"))
+    luaL_error(L, "cannot change a protected metatable");
+  lua_settop(L, 2);
+  lua_setmetatable(L, 1);
+  return 1;
+}
+
+
+static void getfunc (lua_State *L, int opt) {
+  if (lua_isfunction(L, 1)) lua_pushvalue(L, 1);
+  else {
+    lua_Debug ar;
+    int level = opt ? luaL_optint(L, 1, 1) : luaL_checkint(L, 1);
+    luaL_argcheck(L, level >= 0, 1, "level must be non-negative");
+    if (lua_getstack(L, level, &ar) == 0)
+      luaL_argerror(L, 1, "invalid level");
+    lua_getinfo(L, "f", &ar);
+    if (lua_isnil(L, -1))
+      luaL_error(L, "no function environment for tail call at level %d",
+                    level);
+  }
+}
+
+
+static int luaB_getfenv (lua_State *L) {
+  getfunc(L, 1);
+  if (lua_iscfunction(L, -1))  /* is a C function? */
+    lua_pushvalue(L, LUA_GLOBALSINDEX);  /* return the thread's global env. */
+  else
+    lua_getfenv(L, -1);
+  return 1;
+}
+
+
+static int luaB_setfenv (lua_State *L) {
+  luaL_checktype(L, 2, LUA_TTABLE);
+  getfunc(L, 0);
+  lua_pushvalue(L, 2);
+  if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0) {
+    /* change environment of current thread */
+    lua_pushthread(L);
+    lua_insert(L, -2);
+    lua_setfenv(L, -2);
+    return 0;
+  }
+  else if (lua_iscfunction(L, -2) || lua_setfenv(L, -2) == 0)
+    luaL_error(L,
+          LUA_QL("setfenv") " cannot change environment of given object");
+  return 1;
+}
+
+
+static int luaB_rawequal (lua_State *L) {
+  luaL_checkany(L, 1);
+  luaL_checkany(L, 2);
+  lua_pushboolean(L, lua_rawequal(L, 1, 2));
+  return 1;
+}
+
+
+static int luaB_rawget (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  luaL_checkany(L, 2);
+  lua_settop(L, 2);
+  lua_rawget(L, 1);
+  return 1;
+}
+
+static int luaB_rawset (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  luaL_checkany(L, 2);
+  luaL_checkany(L, 3);
+  lua_settop(L, 3);
+  lua_rawset(L, 1);
+  return 1;
+}
+
+
+static int luaB_gcinfo (lua_State *L) {
+  lua_pushinteger(L, lua_getgccount(L));
+  return 1;
+}
+
+
+static int luaB_collectgarbage (lua_State *L) {
+  static const char *const opts[] = {"stop", "restart", "collect",
+    "count", "step", "setpause", "setstepmul", NULL};
+  static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT,
+    LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL};
+  int o = luaL_checkoption(L, 1, "collect", opts);
+  int ex = luaL_optint(L, 2, 0);
+  int res = lua_gc(L, optsnum[o], ex);
+  switch (optsnum[o]) {
+    case LUA_GCCOUNT: {
+      int b = lua_gc(L, LUA_GCCOUNTB, 0);
+      lua_pushnumber(L, res + ((lua_Number)b/1024));
+      return 1;
+    }
+    case LUA_GCSTEP: {
+      lua_pushboolean(L, res);
+      return 1;
+    }
+    default: {
+      lua_pushnumber(L, res);
+      return 1;
+    }
+  }
+}
+
+
+static int luaB_type (lua_State *L) {
+  luaL_checkany(L, 1);
+  lua_pushstring(L, luaL_typename(L, 1));
+  return 1;
+}
+
+
+static int luaB_next (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  lua_settop(L, 2);  /* create a 2nd argument if there isn't one */
+  if (lua_next(L, 1))
+    return 2;
+  else {
+    lua_pushnil(L);
+    return 1;
+  }
+}
+
+
+static int luaB_pairs (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */
+  lua_pushvalue(L, 1);  /* state, */
+  lua_pushnil(L);  /* and initial value */
+  return 3;
+}
+
+
+static int ipairsaux (lua_State *L) {
+  int i = luaL_checkint(L, 2);
+  luaL_checktype(L, 1, LUA_TTABLE);
+  i++;  /* next value */
+  lua_pushinteger(L, i);
+  lua_rawgeti(L, 1, i);
+  return (lua_isnil(L, -1)) ? 0 : 2;
+}
+
+
+static int luaB_ipairs (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */
+  lua_pushvalue(L, 1);  /* state, */
+  lua_pushinteger(L, 0);  /* and initial value */
+  return 3;
+}
+
+
+static int load_aux (lua_State *L, int status) {
+  if (status == 0)  /* OK? */
+    return 1;
+  else {
+    lua_pushnil(L);
+    lua_insert(L, -2);  /* put before error message */
+    return 2;  /* return nil plus error message */
+  }
+}
+
+
+static int luaB_loadstring (lua_State *L) {
+  size_t l;
+  const char *s = luaL_checklstring(L, 1, &l);
+  const char *chunkname = luaL_optstring(L, 2, s);
+  return load_aux(L, luaL_loadbuffer(L, s, l, chunkname));
+}
+
+
+static int luaB_loadfile (lua_State *L) {
+  const char *fname = luaL_optstring(L, 1, NULL);
+  return load_aux(L, luaL_loadfile(L, fname));
+}
+
+
+/*
+** Reader for generic `load' function: `lua_load' uses the
+** stack for internal stuff, so the reader cannot change the
+** stack top. Instead, it keeps its resulting string in a
+** reserved slot inside the stack.
+*/
+static const char *generic_reader (lua_State *L, void *ud, size_t *size) {
+  (void)ud;  /* to avoid warnings */
+  luaL_checkstack(L, 2, "too many nested functions");
+  lua_pushvalue(L, 1);  /* get function */
+  lua_call(L, 0, 1);  /* call it */
+  if (lua_isnil(L, -1)) {
+    *size = 0;
+    return NULL;
+  }
+  else if (lua_isstring(L, -1)) {
+    lua_replace(L, 3);  /* save string in a reserved stack slot */
+    return lua_tolstring(L, 3, size);
+  }
+  else luaL_error(L, "reader function must return a string");
+  return NULL;  /* to avoid warnings */
+}
+
+
+static int luaB_load (lua_State *L) {
+  int status;
+  const char *cname = luaL_optstring(L, 2, "=(load)");
+  luaL_checktype(L, 1, LUA_TFUNCTION);
+  lua_settop(L, 3);  /* function, eventual name, plus one reserved slot */
+  status = lua_load(L, generic_reader, NULL, cname);
+  return load_aux(L, status);
+}
+
+
+static int luaB_dofile (lua_State *L) {
+  const char *fname = luaL_optstring(L, 1, NULL);
+  int n = lua_gettop(L);
+  if (luaL_loadfile(L, fname) != 0) lua_error(L);
+  lua_call(L, 0, LUA_MULTRET);
+  return lua_gettop(L) - n;
+}
+
+
+static int luaB_assert (lua_State *L) {
+  luaL_checkany(L, 1);
+  if (!lua_toboolean(L, 1))
+    return luaL_error(L, "%s", luaL_optstring(L, 2, "assertion failed!"));
+  return lua_gettop(L);
+}
+
+
+static int luaB_unpack (lua_State *L) {
+  int i, e, n;
+  luaL_checktype(L, 1, LUA_TTABLE);
+  i = luaL_optint(L, 2, 1);
+  e = luaL_opt(L, luaL_checkint, 3, luaL_getn(L, 1));
+  if (i > e) return 0;  /* empty range */
+  n = e - i + 1;  /* number of elements */
+  if (n <= 0 || !lua_checkstack(L, n))  /* n <= 0 means arith. overflow */
+    return luaL_error(L, "too many results to unpack");
+  lua_rawgeti(L, 1, i);  /* push arg[i] (avoiding overflow problems) */
+  while (i++ < e)  /* push arg[i + 1...e] */
+    lua_rawgeti(L, 1, i);
+  return n;
+}
+
+
+static int luaB_select (lua_State *L) {
+  int n = lua_gettop(L);
+  if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') {
+    lua_pushinteger(L, n-1);
+    return 1;
+  }
+  else {
+    int i = luaL_checkint(L, 1);
+    if (i < 0) i = n + i;
+    else if (i > n) i = n;
+    luaL_argcheck(L, 1 <= i, 1, "index out of range");
+    return n - i;
+  }
+}
+
+
+static int luaB_pcall (lua_State *L) {
+  int status;
+  luaL_checkany(L, 1);
+  status = lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0);
+  lua_pushboolean(L, (status == 0));
+  lua_insert(L, 1);
+  return lua_gettop(L);  /* return status + all results */
+}
+
+
+static int luaB_xpcall (lua_State *L) {
+  int status;
+  luaL_checkany(L, 2);
+  lua_settop(L, 2);
+  lua_insert(L, 1);  /* put error function under function to be called */
+  status = lua_pcall(L, 0, LUA_MULTRET, 1);
+  lua_pushboolean(L, (status == 0));
+  lua_replace(L, 1);
+  return lua_gettop(L);  /* return status + all results */
+}
+
+
+static int luaB_tostring (lua_State *L) {
+  luaL_checkany(L, 1);
+  if (luaL_callmeta(L, 1, "__tostring"))  /* is there a metafield? */
+    return 1;  /* use its value */
+  switch (lua_type(L, 1)) {
+    case LUA_TNUMBER:
+      lua_pushstring(L, lua_tostring(L, 1));
+      break;
+    case LUA_TSTRING:
+      lua_pushvalue(L, 1);
+      break;
+    case LUA_TBOOLEAN:
+      lua_pushstring(L, (lua_toboolean(L, 1) ? "true" : "false"));
+      break;
+    case LUA_TNIL:
+      lua_pushliteral(L, "nil");
+      break;
+    default:
+      lua_pushfstring(L, "%s: %p", luaL_typename(L, 1), lua_topointer(L, 1));
+      break;
+  }
+  return 1;
+}
+
+
+static int luaB_newproxy (lua_State *L) {
+  lua_settop(L, 1);
+  lua_newuserdata(L, 0);  /* create proxy */
+  if (lua_toboolean(L, 1) == 0)
+    return 1;  /* no metatable */
+  else if (lua_isboolean(L, 1)) {
+    lua_newtable(L);  /* create a new metatable `m' ... */
+    lua_pushvalue(L, -1);  /* ... and mark `m' as a valid metatable */
+    lua_pushboolean(L, 1);
+    lua_rawset(L, lua_upvalueindex(1));  /* weaktable[m] = true */
+  }
+  else {
+    int validproxy = 0;  /* to check if weaktable[metatable(u)] == true */
+    if (lua_getmetatable(L, 1)) {
+      lua_rawget(L, lua_upvalueindex(1));
+      validproxy = lua_toboolean(L, -1);
+      lua_pop(L, 1);  /* remove value */
+    }
+    luaL_argcheck(L, validproxy, 1, "boolean or proxy expected");
+    lua_getmetatable(L, 1);  /* metatable is valid; get it */
+  }
+  lua_setmetatable(L, 2);
+  return 1;
+}
+
+
+static const luaL_Reg base_funcs[] = {
+  {"assert", luaB_assert},
+  {"collectgarbage", luaB_collectgarbage},
+  {"dofile", luaB_dofile},
+  {"error", luaB_error},
+  {"gcinfo", luaB_gcinfo},
+  {"getfenv", luaB_getfenv},
+  {"getmetatable", luaB_getmetatable},
+  {"loadfile", luaB_loadfile},
+  {"load", luaB_load},
+  {"loadstring", luaB_loadstring},
+  {"next", luaB_next},
+  {"pcall", luaB_pcall},
+  {"print", luaB_print},
+  {"rawequal", luaB_rawequal},
+  {"rawget", luaB_rawget},
+  {"rawset", luaB_rawset},
+  {"select", luaB_select},
+  {"setfenv", luaB_setfenv},
+  {"setmetatable", luaB_setmetatable},
+  {"tonumber", luaB_tonumber},
+  {"tostring", luaB_tostring},
+  {"type", luaB_type},
+  {"unpack", luaB_unpack},
+  {"xpcall", luaB_xpcall},
+  {NULL, NULL}
+};
+
+
+/*
+** {======================================================
+** Coroutine library
+** =======================================================
+*/
+
+#define CO_RUN	0	/* running */
+#define CO_SUS	1	/* suspended */
+#define CO_NOR	2	/* 'normal' (it resumed another coroutine) */
+#define CO_DEAD	3
+
+static const char *const statnames[] =
+    {"running", "suspended", "normal", "dead"};
+
+static int costatus (lua_State *L, lua_State *co) {
+  if (L == co) return CO_RUN;
+  switch (lua_status(co)) {
+    case LUA_YIELD:
+      return CO_SUS;
+    case 0: {
+      lua_Debug ar;
+      if (lua_getstack(co, 0, &ar) > 0)  /* does it have frames? */
+        return CO_NOR;  /* it is running */
+      else if (lua_gettop(co) == 0)
+          return CO_DEAD;
+      else
+        return CO_SUS;  /* initial state */
+    }
+    default:  /* some error occured */
+      return CO_DEAD;
+  }
+}
+
+
+static int luaB_costatus (lua_State *L) {
+  lua_State *co = lua_tothread(L, 1);
+  luaL_argcheck(L, co, 1, "coroutine expected");
+  lua_pushstring(L, statnames[costatus(L, co)]);
+  return 1;
+}
+
+
+static int auxresume (lua_State *L, lua_State *co, int narg) {
+  int status = costatus(L, co);
+  if (!lua_checkstack(co, narg))
+    luaL_error(L, "too many arguments to resume");
+  if (status != CO_SUS) {
+    lua_pushfstring(L, "cannot resume %s coroutine", statnames[status]);
+    return -1;  /* error flag */
+  }
+  lua_xmove(L, co, narg);
+  lua_setlevel(L, co);
+  status = lua_resume(co, narg);
+  if (status == 0 || status == LUA_YIELD) {
+    int nres = lua_gettop(co);
+    if (!lua_checkstack(L, nres + 1))
+      luaL_error(L, "too many results to resume");
+    lua_xmove(co, L, nres);  /* move yielded values */
+    return nres;
+  }
+  else {
+    lua_xmove(co, L, 1);  /* move error message */
+    return -1;  /* error flag */
+  }
+}
+
+
+static int luaB_coresume (lua_State *L) {
+  lua_State *co = lua_tothread(L, 1);
+  int r;
+  luaL_argcheck(L, co, 1, "coroutine expected");
+  r = auxresume(L, co, lua_gettop(L) - 1);
+  if (r < 0) {
+    lua_pushboolean(L, 0);
+    lua_insert(L, -2);
+    return 2;  /* return false + error message */
+  }
+  else {
+    lua_pushboolean(L, 1);
+    lua_insert(L, -(r + 1));
+    return r + 1;  /* return true + `resume' returns */
+  }
+}
+
+
+static int luaB_auxwrap (lua_State *L) {
+  lua_State *co = lua_tothread(L, lua_upvalueindex(1));
+  int r = auxresume(L, co, lua_gettop(L));
+  if (r < 0) {
+    if (lua_isstring(L, -1)) {  /* error object is a string? */
+      luaL_where(L, 1);  /* add extra info */
+      lua_insert(L, -2);
+      lua_concat(L, 2);
+    }
+    lua_error(L);  /* propagate error */
+  }
+  return r;
+}
+
+
+static int luaB_cocreate (lua_State *L) {
+  lua_State *NL = lua_newthread(L);
+  luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1,
+    "Lua function expected");
+  lua_pushvalue(L, 1);  /* move function to top */
+  lua_xmove(L, NL, 1);  /* move function from L to NL */
+  return 1;
+}
+
+
+static int luaB_cowrap (lua_State *L) {
+  luaB_cocreate(L);
+  lua_pushcclosure(L, luaB_auxwrap, 1);
+  return 1;
+}
+
+
+static int luaB_yield (lua_State *L) {
+  return lua_yield(L, lua_gettop(L));
+}
+
+
+static int luaB_corunning (lua_State *L) {
+  if (lua_pushthread(L))
+    lua_pushnil(L);  /* main thread is not a coroutine */
+  return 1;
+}
+
+
+static const luaL_Reg co_funcs[] = {
+  {"create", luaB_cocreate},
+  {"resume", luaB_coresume},
+  {"running", luaB_corunning},
+  {"status", luaB_costatus},
+  {"wrap", luaB_cowrap},
+  {"yield", luaB_yield},
+  {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+static void auxopen (lua_State *L, const char *name,
+                     lua_CFunction f, lua_CFunction u) {
+  lua_pushcfunction(L, u);
+  lua_pushcclosure(L, f, 1);
+  lua_setfield(L, -2, name);
+}
+
+
+static void base_open (lua_State *L) {
+  /* set global _G */
+  lua_pushvalue(L, LUA_GLOBALSINDEX);
+  lua_setglobal(L, "_G");
+  /* open lib into global table */
+  luaL_register(L, "_G", base_funcs);
+  lua_pushliteral(L, LUA_VERSION);
+  lua_setglobal(L, "_VERSION");  /* set global _VERSION */
+  /* `ipairs' and `pairs' need auxiliary functions as upvalues */
+  auxopen(L, "ipairs", luaB_ipairs, ipairsaux);
+  auxopen(L, "pairs", luaB_pairs, luaB_next);
+  /* `newproxy' needs a weaktable as upvalue */
+  lua_createtable(L, 0, 1);  /* new table `w' */
+  lua_pushvalue(L, -1);  /* `w' will be its own metatable */
+  lua_setmetatable(L, -2);
+  lua_pushliteral(L, "kv");
+  lua_setfield(L, -2, "__mode");  /* metatable(w).__mode = "kv" */
+  lua_pushcclosure(L, luaB_newproxy, 1);
+  lua_setglobal(L, "newproxy");  /* set global `newproxy' */
+}
+
+
+LUALIB_API int luaopen_base (lua_State *L) {
+  base_open(L);
+  luaL_register(L, LUA_COLIBNAME, co_funcs);
+  return 2;
+}
+
diff --git a/redis-stable/deps/lua/src/lcode.c b/redis-stable/deps/lua/src/lcode.c
new file mode 100644
index 00000000..679cb9cf
--- /dev/null
+++ b/redis-stable/deps/lua/src/lcode.c
@@ -0,0 +1,831 @@
+/*
+** $Id: lcode.c,v 2.25.1.5 2011/01/31 14:53:16 roberto Exp $
+** Code generator for Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+
+#define lcode_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lgc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "ltable.h"
+
+
+#define hasjumps(e)	((e)->t != (e)->f)
+
+
+static int isnumeral(expdesc *e) {
+  return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);
+}
+
+
+void luaK_nil (FuncState *fs, int from, int n) {
+  Instruction *previous;
+  if (fs->pc > fs->lasttarget) {  /* no jumps to current position? */
+    if (fs->pc == 0) {  /* function start? */
+      if (from >= fs->nactvar)
+        return;  /* positions are already clean */
+    }
+    else {
+      previous = &fs->f->code[fs->pc-1];
+      if (GET_OPCODE(*previous) == OP_LOADNIL) {
+        int pfrom = GETARG_A(*previous);
+        int pto = GETARG_B(*previous);
+        if (pfrom <= from && from <= pto+1) {  /* can connect both? */
+          if (from+n-1 > pto)
+            SETARG_B(*previous, from+n-1);
+          return;
+        }
+      }
+    }
+  }
+  luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0);  /* else no optimization */
+}
+
+
+int luaK_jump (FuncState *fs) {
+  int jpc = fs->jpc;  /* save list of jumps to here */
+  int j;
+  fs->jpc = NO_JUMP;
+  j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);
+  luaK_concat(fs, &j, jpc);  /* keep them on hold */
+  return j;
+}
+
+
+void luaK_ret (FuncState *fs, int first, int nret) {
+  luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
+}
+
+
+static int condjump (FuncState *fs, OpCode op, int A, int B, int C) {
+  luaK_codeABC(fs, op, A, B, C);
+  return luaK_jump(fs);
+}
+
+
+static void fixjump (FuncState *fs, int pc, int dest) {
+  Instruction *jmp = &fs->f->code[pc];
+  int offset = dest-(pc+1);
+  lua_assert(dest != NO_JUMP);
+  if (abs(offset) > MAXARG_sBx)
+    luaX_syntaxerror(fs->ls, "control structure too long");
+  SETARG_sBx(*jmp, offset);
+}
+
+
+/*
+** returns current `pc' and marks it as a jump target (to avoid wrong
+** optimizations with consecutive instructions not in the same basic block).
+*/
+int luaK_getlabel (FuncState *fs) {
+  fs->lasttarget = fs->pc;
+  return fs->pc;
+}
+
+
+static int getjump (FuncState *fs, int pc) {
+  int offset = GETARG_sBx(fs->f->code[pc]);
+  if (offset == NO_JUMP)  /* point to itself represents end of list */
+    return NO_JUMP;  /* end of list */
+  else
+    return (pc+1)+offset;  /* turn offset into absolute position */
+}
+
+
+static Instruction *getjumpcontrol (FuncState *fs, int pc) {
+  Instruction *pi = &fs->f->code[pc];
+  if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1))))
+    return pi-1;
+  else
+    return pi;
+}
+
+
+/*
+** check whether list has any jump that do not produce a value
+** (or produce an inverted value)
+*/
+static int need_value (FuncState *fs, int list) {
+  for (; list != NO_JUMP; list = getjump(fs, list)) {
+    Instruction i = *getjumpcontrol(fs, list);
+    if (GET_OPCODE(i) != OP_TESTSET) return 1;
+  }
+  return 0;  /* not found */
+}
+
+
+static int patchtestreg (FuncState *fs, int node, int reg) {
+  Instruction *i = getjumpcontrol(fs, node);
+  if (GET_OPCODE(*i) != OP_TESTSET)
+    return 0;  /* cannot patch other instructions */
+  if (reg != NO_REG && reg != GETARG_B(*i))
+    SETARG_A(*i, reg);
+  else  /* no register to put value or register already has the value */
+    *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i));
+
+  return 1;
+}
+
+
+static void removevalues (FuncState *fs, int list) {
+  for (; list != NO_JUMP; list = getjump(fs, list))
+      patchtestreg(fs, list, NO_REG);
+}
+
+
+static void patchlistaux (FuncState *fs, int list, int vtarget, int reg,
+                          int dtarget) {
+  while (list != NO_JUMP) {
+    int next = getjump(fs, list);
+    if (patchtestreg(fs, list, reg))
+      fixjump(fs, list, vtarget);
+    else
+      fixjump(fs, list, dtarget);  /* jump to default target */
+    list = next;
+  }
+}
+
+
+static void dischargejpc (FuncState *fs) {
+  patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc);
+  fs->jpc = NO_JUMP;
+}
+
+
+void luaK_patchlist (FuncState *fs, int list, int target) {
+  if (target == fs->pc)
+    luaK_patchtohere(fs, list);
+  else {
+    lua_assert(target < fs->pc);
+    patchlistaux(fs, list, target, NO_REG, target);
+  }
+}
+
+
+void luaK_patchtohere (FuncState *fs, int list) {
+  luaK_getlabel(fs);
+  luaK_concat(fs, &fs->jpc, list);
+}
+
+
+void luaK_concat (FuncState *fs, int *l1, int l2) {
+  if (l2 == NO_JUMP) return;
+  else if (*l1 == NO_JUMP)
+    *l1 = l2;
+  else {
+    int list = *l1;
+    int next;
+    while ((next = getjump(fs, list)) != NO_JUMP)  /* find last element */
+      list = next;
+    fixjump(fs, list, l2);
+  }
+}
+
+
+void luaK_checkstack (FuncState *fs, int n) {
+  int newstack = fs->freereg + n;
+  if (newstack > fs->f->maxstacksize) {
+    if (newstack >= MAXSTACK)
+      luaX_syntaxerror(fs->ls, "function or expression too complex");
+    fs->f->maxstacksize = cast_byte(newstack);
+  }
+}
+
+
+void luaK_reserveregs (FuncState *fs, int n) {
+  luaK_checkstack(fs, n);
+  fs->freereg += n;
+}
+
+
+static void freereg (FuncState *fs, int reg) {
+  if (!ISK(reg) && reg >= fs->nactvar) {
+    fs->freereg--;
+    lua_assert(reg == fs->freereg);
+  }
+}
+
+
+static void freeexp (FuncState *fs, expdesc *e) {
+  if (e->k == VNONRELOC)
+    freereg(fs, e->u.s.info);
+}
+
+
+static int addk (FuncState *fs, TValue *k, TValue *v) {
+  lua_State *L = fs->L;
+  TValue *idx = luaH_set(L, fs->h, k);
+  Proto *f = fs->f;
+  int oldsize = f->sizek;
+  if (ttisnumber(idx)) {
+    lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v));
+    return cast_int(nvalue(idx));
+  }
+  else {  /* constant not found; create a new entry */
+    setnvalue(idx, cast_num(fs->nk));
+    luaM_growvector(L, f->k, fs->nk, f->sizek, TValue,
+                    MAXARG_Bx, "constant table overflow");
+    while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]);
+    setobj(L, &f->k[fs->nk], v);
+    luaC_barrier(L, f, v);
+    return fs->nk++;
+  }
+}
+
+
+int luaK_stringK (FuncState *fs, TString *s) {
+  TValue o;
+  setsvalue(fs->L, &o, s);
+  return addk(fs, &o, &o);
+}
+
+
+int luaK_numberK (FuncState *fs, lua_Number r) {
+  TValue o;
+  setnvalue(&o, r);
+  return addk(fs, &o, &o);
+}
+
+
+static int boolK (FuncState *fs, int b) {
+  TValue o;
+  setbvalue(&o, b);
+  return addk(fs, &o, &o);
+}
+
+
+static int nilK (FuncState *fs) {
+  TValue k, v;
+  setnilvalue(&v);
+  /* cannot use nil as key; instead use table itself to represent nil */
+  sethvalue(fs->L, &k, fs->h);
+  return addk(fs, &k, &v);
+}
+
+
+void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) {
+  if (e->k == VCALL) {  /* expression is an open function call? */
+    SETARG_C(getcode(fs, e), nresults+1);
+  }
+  else if (e->k == VVARARG) {
+    SETARG_B(getcode(fs, e), nresults+1);
+    SETARG_A(getcode(fs, e), fs->freereg);
+    luaK_reserveregs(fs, 1);
+  }
+}
+
+
+void luaK_setoneret (FuncState *fs, expdesc *e) {
+  if (e->k == VCALL) {  /* expression is an open function call? */
+    e->k = VNONRELOC;
+    e->u.s.info = GETARG_A(getcode(fs, e));
+  }
+  else if (e->k == VVARARG) {
+    SETARG_B(getcode(fs, e), 2);
+    e->k = VRELOCABLE;  /* can relocate its simple result */
+  }
+}
+
+
+void luaK_dischargevars (FuncState *fs, expdesc *e) {
+  switch (e->k) {
+    case VLOCAL: {
+      e->k = VNONRELOC;
+      break;
+    }
+    case VUPVAL: {
+      e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0);
+      e->k = VRELOCABLE;
+      break;
+    }
+    case VGLOBAL: {
+      e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info);
+      e->k = VRELOCABLE;
+      break;
+    }
+    case VINDEXED: {
+      freereg(fs, e->u.s.aux);
+      freereg(fs, e->u.s.info);
+      e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux);
+      e->k = VRELOCABLE;
+      break;
+    }
+    case VVARARG:
+    case VCALL: {
+      luaK_setoneret(fs, e);
+      break;
+    }
+    default: break;  /* there is one value available (somewhere) */
+  }
+}
+
+
+static int code_label (FuncState *fs, int A, int b, int jump) {
+  luaK_getlabel(fs);  /* those instructions may be jump targets */
+  return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump);
+}
+
+
+static void discharge2reg (FuncState *fs, expdesc *e, int reg) {
+  luaK_dischargevars(fs, e);
+  switch (e->k) {
+    case VNIL: {
+      luaK_nil(fs, reg, 1);
+      break;
+    }
+    case VFALSE:  case VTRUE: {
+      luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0);
+      break;
+    }
+    case VK: {
+      luaK_codeABx(fs, OP_LOADK, reg, e->u.s.info);
+      break;
+    }
+    case VKNUM: {
+      luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval));
+      break;
+    }
+    case VRELOCABLE: {
+      Instruction *pc = &getcode(fs, e);
+      SETARG_A(*pc, reg);
+      break;
+    }
+    case VNONRELOC: {
+      if (reg != e->u.s.info)
+        luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0);
+      break;
+    }
+    default: {
+      lua_assert(e->k == VVOID || e->k == VJMP);
+      return;  /* nothing to do... */
+    }
+  }
+  e->u.s.info = reg;
+  e->k = VNONRELOC;
+}
+
+
+static void discharge2anyreg (FuncState *fs, expdesc *e) {
+  if (e->k != VNONRELOC) {
+    luaK_reserveregs(fs, 1);
+    discharge2reg(fs, e, fs->freereg-1);
+  }
+}
+
+
+static void exp2reg (FuncState *fs, expdesc *e, int reg) {
+  discharge2reg(fs, e, reg);
+  if (e->k == VJMP)
+    luaK_concat(fs, &e->t, e->u.s.info);  /* put this jump in `t' list */
+  if (hasjumps(e)) {
+    int final;  /* position after whole expression */
+    int p_f = NO_JUMP;  /* position of an eventual LOAD false */
+    int p_t = NO_JUMP;  /* position of an eventual LOAD true */
+    if (need_value(fs, e->t) || need_value(fs, e->f)) {
+      int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);
+      p_f = code_label(fs, reg, 0, 1);
+      p_t = code_label(fs, reg, 1, 0);
+      luaK_patchtohere(fs, fj);
+    }
+    final = luaK_getlabel(fs);
+    patchlistaux(fs, e->f, final, reg, p_f);
+    patchlistaux(fs, e->t, final, reg, p_t);
+  }
+  e->f = e->t = NO_JUMP;
+  e->u.s.info = reg;
+  e->k = VNONRELOC;
+}
+
+
+void luaK_exp2nextreg (FuncState *fs, expdesc *e) {
+  luaK_dischargevars(fs, e);
+  freeexp(fs, e);
+  luaK_reserveregs(fs, 1);
+  exp2reg(fs, e, fs->freereg - 1);
+}
+
+
+int luaK_exp2anyreg (FuncState *fs, expdesc *e) {
+  luaK_dischargevars(fs, e);
+  if (e->k == VNONRELOC) {
+    if (!hasjumps(e)) return e->u.s.info;  /* exp is already in a register */
+    if (e->u.s.info >= fs->nactvar) {  /* reg. is not a local? */
+      exp2reg(fs, e, e->u.s.info);  /* put value on it */
+      return e->u.s.info;
+    }
+  }
+  luaK_exp2nextreg(fs, e);  /* default */
+  return e->u.s.info;
+}
+
+
+void luaK_exp2val (FuncState *fs, expdesc *e) {
+  if (hasjumps(e))
+    luaK_exp2anyreg(fs, e);
+  else
+    luaK_dischargevars(fs, e);
+}
+
+
+int luaK_exp2RK (FuncState *fs, expdesc *e) {
+  luaK_exp2val(fs, e);
+  switch (e->k) {
+    case VKNUM:
+    case VTRUE:
+    case VFALSE:
+    case VNIL: {
+      if (fs->nk <= MAXINDEXRK) {  /* constant fit in RK operand? */
+        e->u.s.info = (e->k == VNIL)  ? nilK(fs) :
+                      (e->k == VKNUM) ? luaK_numberK(fs, e->u.nval) :
+                                        boolK(fs, (e->k == VTRUE));
+        e->k = VK;
+        return RKASK(e->u.s.info);
+      }
+      else break;
+    }
+    case VK: {
+      if (e->u.s.info <= MAXINDEXRK)  /* constant fit in argC? */
+        return RKASK(e->u.s.info);
+      else break;
+    }
+    default: break;
+  }
+  /* not a constant in the right range: put it in a register */
+  return luaK_exp2anyreg(fs, e);
+}
+
+
+void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) {
+  switch (var->k) {
+    case VLOCAL: {
+      freeexp(fs, ex);
+      exp2reg(fs, ex, var->u.s.info);
+      return;
+    }
+    case VUPVAL: {
+      int e = luaK_exp2anyreg(fs, ex);
+      luaK_codeABC(fs, OP_SETUPVAL, e, var->u.s.info, 0);
+      break;
+    }
+    case VGLOBAL: {
+      int e = luaK_exp2anyreg(fs, ex);
+      luaK_codeABx(fs, OP_SETGLOBAL, e, var->u.s.info);
+      break;
+    }
+    case VINDEXED: {
+      int e = luaK_exp2RK(fs, ex);
+      luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e);
+      break;
+    }
+    default: {
+      lua_assert(0);  /* invalid var kind to store */
+      break;
+    }
+  }
+  freeexp(fs, ex);
+}
+
+
+void luaK_self (FuncState *fs, expdesc *e, expdesc *key) {
+  int func;
+  luaK_exp2anyreg(fs, e);
+  freeexp(fs, e);
+  func = fs->freereg;
+  luaK_reserveregs(fs, 2);
+  luaK_codeABC(fs, OP_SELF, func, e->u.s.info, luaK_exp2RK(fs, key));
+  freeexp(fs, key);
+  e->u.s.info = func;
+  e->k = VNONRELOC;
+}
+
+
+static void invertjump (FuncState *fs, expdesc *e) {
+  Instruction *pc = getjumpcontrol(fs, e->u.s.info);
+  lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET &&
+                                           GET_OPCODE(*pc) != OP_TEST);
+  SETARG_A(*pc, !(GETARG_A(*pc)));
+}
+
+
+static int jumponcond (FuncState *fs, expdesc *e, int cond) {
+  if (e->k == VRELOCABLE) {
+    Instruction ie = getcode(fs, e);
+    if (GET_OPCODE(ie) == OP_NOT) {
+      fs->pc--;  /* remove previous OP_NOT */
+      return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond);
+    }
+    /* else go through */
+  }
+  discharge2anyreg(fs, e);
+  freeexp(fs, e);
+  return condjump(fs, OP_TESTSET, NO_REG, e->u.s.info, cond);
+}
+
+
+void luaK_goiftrue (FuncState *fs, expdesc *e) {
+  int pc;  /* pc of last jump */
+  luaK_dischargevars(fs, e);
+  switch (e->k) {
+    case VK: case VKNUM: case VTRUE: {
+      pc = NO_JUMP;  /* always true; do nothing */
+      break;
+    }
+    case VJMP: {
+      invertjump(fs, e);
+      pc = e->u.s.info;
+      break;
+    }
+    default: {
+      pc = jumponcond(fs, e, 0);
+      break;
+    }
+  }
+  luaK_concat(fs, &e->f, pc);  /* insert last jump in `f' list */
+  luaK_patchtohere(fs, e->t);
+  e->t = NO_JUMP;
+}
+
+
+static void luaK_goiffalse (FuncState *fs, expdesc *e) {
+  int pc;  /* pc of last jump */
+  luaK_dischargevars(fs, e);
+  switch (e->k) {
+    case VNIL: case VFALSE: {
+      pc = NO_JUMP;  /* always false; do nothing */
+      break;
+    }
+    case VJMP: {
+      pc = e->u.s.info;
+      break;
+    }
+    default: {
+      pc = jumponcond(fs, e, 1);
+      break;
+    }
+  }
+  luaK_concat(fs, &e->t, pc);  /* insert last jump in `t' list */
+  luaK_patchtohere(fs, e->f);
+  e->f = NO_JUMP;
+}
+
+
+static void codenot (FuncState *fs, expdesc *e) {
+  luaK_dischargevars(fs, e);
+  switch (e->k) {
+    case VNIL: case VFALSE: {
+      e->k = VTRUE;
+      break;
+    }
+    case VK: case VKNUM: case VTRUE: {
+      e->k = VFALSE;
+      break;
+    }
+    case VJMP: {
+      invertjump(fs, e);
+      break;
+    }
+    case VRELOCABLE:
+    case VNONRELOC: {
+      discharge2anyreg(fs, e);
+      freeexp(fs, e);
+      e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.info, 0);
+      e->k = VRELOCABLE;
+      break;
+    }
+    default: {
+      lua_assert(0);  /* cannot happen */
+      break;
+    }
+  }
+  /* interchange true and false lists */
+  { int temp = e->f; e->f = e->t; e->t = temp; }
+  removevalues(fs, e->f);
+  removevalues(fs, e->t);
+}
+
+
+void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {
+  t->u.s.aux = luaK_exp2RK(fs, k);
+  t->k = VINDEXED;
+}
+
+
+static int constfolding (OpCode op, expdesc *e1, expdesc *e2) {
+  lua_Number v1, v2, r;
+  if (!isnumeral(e1) || !isnumeral(e2)) return 0;
+  v1 = e1->u.nval;
+  v2 = e2->u.nval;
+  switch (op) {
+    case OP_ADD: r = luai_numadd(v1, v2); break;
+    case OP_SUB: r = luai_numsub(v1, v2); break;
+    case OP_MUL: r = luai_nummul(v1, v2); break;
+    case OP_DIV:
+      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */
+      r = luai_numdiv(v1, v2); break;
+    case OP_MOD:
+      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */
+      r = luai_nummod(v1, v2); break;
+    case OP_POW: r = luai_numpow(v1, v2); break;
+    case OP_UNM: r = luai_numunm(v1); break;
+    case OP_LEN: return 0;  /* no constant folding for 'len' */
+    default: lua_assert(0); r = 0; break;
+  }
+  if (luai_numisnan(r)) return 0;  /* do not attempt to produce NaN */
+  e1->u.nval = r;
+  return 1;
+}
+
+
+static void codearith (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) {
+  if (constfolding(op, e1, e2))
+    return;
+  else {
+    int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0;
+    int o1 = luaK_exp2RK(fs, e1);
+    if (o1 > o2) {
+      freeexp(fs, e1);
+      freeexp(fs, e2);
+    }
+    else {
+      freeexp(fs, e2);
+      freeexp(fs, e1);
+    }
+    e1->u.s.info = luaK_codeABC(fs, op, 0, o1, o2);
+    e1->k = VRELOCABLE;
+  }
+}
+
+
+static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1,
+                                                          expdesc *e2) {
+  int o1 = luaK_exp2RK(fs, e1);
+  int o2 = luaK_exp2RK(fs, e2);
+  freeexp(fs, e2);
+  freeexp(fs, e1);
+  if (cond == 0 && op != OP_EQ) {
+    int temp;  /* exchange args to replace by `<' or `<=' */
+    temp = o1; o1 = o2; o2 = temp;  /* o1 <==> o2 */
+    cond = 1;
+  }
+  e1->u.s.info = condjump(fs, op, cond, o1, o2);
+  e1->k = VJMP;
+}
+
+
+void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) {
+  expdesc e2;
+  e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;
+  switch (op) {
+    case OPR_MINUS: {
+      if (!isnumeral(e))
+        luaK_exp2anyreg(fs, e);  /* cannot operate on non-numeric constants */
+      codearith(fs, OP_UNM, e, &e2);
+      break;
+    }
+    case OPR_NOT: codenot(fs, e); break;
+    case OPR_LEN: {
+      luaK_exp2anyreg(fs, e);  /* cannot operate on constants */
+      codearith(fs, OP_LEN, e, &e2);
+      break;
+    }
+    default: lua_assert(0);
+  }
+}
+
+
+void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {
+  switch (op) {
+    case OPR_AND: {
+      luaK_goiftrue(fs, v);
+      break;
+    }
+    case OPR_OR: {
+      luaK_goiffalse(fs, v);
+      break;
+    }
+    case OPR_CONCAT: {
+      luaK_exp2nextreg(fs, v);  /* operand must be on the `stack' */
+      break;
+    }
+    case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV:
+    case OPR_MOD: case OPR_POW: {
+      if (!isnumeral(v)) luaK_exp2RK(fs, v);
+      break;
+    }
+    default: {
+      luaK_exp2RK(fs, v);
+      break;
+    }
+  }
+}
+
+
+void luaK_posfix (FuncState *fs, BinOpr op, expdesc *e1, expdesc *e2) {
+  switch (op) {
+    case OPR_AND: {
+      lua_assert(e1->t == NO_JUMP);  /* list must be closed */
+      luaK_dischargevars(fs, e2);
+      luaK_concat(fs, &e2->f, e1->f);
+      *e1 = *e2;
+      break;
+    }
+    case OPR_OR: {
+      lua_assert(e1->f == NO_JUMP);  /* list must be closed */
+      luaK_dischargevars(fs, e2);
+      luaK_concat(fs, &e2->t, e1->t);
+      *e1 = *e2;
+      break;
+    }
+    case OPR_CONCAT: {
+      luaK_exp2val(fs, e2);
+      if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {
+        lua_assert(e1->u.s.info == GETARG_B(getcode(fs, e2))-1);
+        freeexp(fs, e1);
+        SETARG_B(getcode(fs, e2), e1->u.s.info);
+        e1->k = VRELOCABLE; e1->u.s.info = e2->u.s.info;
+      }
+      else {
+        luaK_exp2nextreg(fs, e2);  /* operand must be on the 'stack' */
+        codearith(fs, OP_CONCAT, e1, e2);
+      }
+      break;
+    }
+    case OPR_ADD: codearith(fs, OP_ADD, e1, e2); break;
+    case OPR_SUB: codearith(fs, OP_SUB, e1, e2); break;
+    case OPR_MUL: codearith(fs, OP_MUL, e1, e2); break;
+    case OPR_DIV: codearith(fs, OP_DIV, e1, e2); break;
+    case OPR_MOD: codearith(fs, OP_MOD, e1, e2); break;
+    case OPR_POW: codearith(fs, OP_POW, e1, e2); break;
+    case OPR_EQ: codecomp(fs, OP_EQ, 1, e1, e2); break;
+    case OPR_NE: codecomp(fs, OP_EQ, 0, e1, e2); break;
+    case OPR_LT: codecomp(fs, OP_LT, 1, e1, e2); break;
+    case OPR_LE: codecomp(fs, OP_LE, 1, e1, e2); break;
+    case OPR_GT: codecomp(fs, OP_LT, 0, e1, e2); break;
+    case OPR_GE: codecomp(fs, OP_LE, 0, e1, e2); break;
+    default: lua_assert(0);
+  }
+}
+
+
+void luaK_fixline (FuncState *fs, int line) {
+  fs->f->lineinfo[fs->pc - 1] = line;
+}
+
+
+static int luaK_code (FuncState *fs, Instruction i, int line) {
+  Proto *f = fs->f;
+  dischargejpc(fs);  /* `pc' will change */
+  /* put new instruction in code array */
+  luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction,
+                  MAX_INT, "code size overflow");
+  f->code[fs->pc] = i;
+  /* save corresponding line information */
+  luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int,
+                  MAX_INT, "code size overflow");
+  f->lineinfo[fs->pc] = line;
+  return fs->pc++;
+}
+
+
+int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) {
+  lua_assert(getOpMode(o) == iABC);
+  lua_assert(getBMode(o) != OpArgN || b == 0);
+  lua_assert(getCMode(o) != OpArgN || c == 0);
+  return luaK_code(fs, CREATE_ABC(o, a, b, c), fs->ls->lastline);
+}
+
+
+int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) {
+  lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx);
+  lua_assert(getCMode(o) == OpArgN);
+  return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline);
+}
+
+
+void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) {
+  int c =  (nelems - 1)/LFIELDS_PER_FLUSH + 1;
+  int b = (tostore == LUA_MULTRET) ? 0 : tostore;
+  lua_assert(tostore != 0);
+  if (c <= MAXARG_C)
+    luaK_codeABC(fs, OP_SETLIST, base, b, c);
+  else {
+    luaK_codeABC(fs, OP_SETLIST, base, b, 0);
+    luaK_code(fs, cast(Instruction, c), fs->ls->lastline);
+  }
+  fs->freereg = base + 1;  /* free registers with list values */
+}
+
diff --git a/redis-stable/deps/lua/src/lcode.h b/redis-stable/deps/lua/src/lcode.h
new file mode 100644
index 00000000..b941c607
--- /dev/null
+++ b/redis-stable/deps/lua/src/lcode.h
@@ -0,0 +1,76 @@
+/*
+** $Id: lcode.h,v 1.48.1.1 2007/12/27 13:02:25 roberto Exp $
+** Code generator for Lua
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lcode_h
+#define lcode_h
+
+#include "llex.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+
+
+/*
+** Marks the end of a patch list. It is an invalid value both as an absolute
+** address, and as a list link (would link an element to itself).
+*/
+#define NO_JUMP (-1)
+
+
+/*
+** grep "ORDER OPR" if you change these enums
+*/
+typedef enum BinOpr {
+  OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW,
+  OPR_CONCAT,
+  OPR_NE, OPR_EQ,
+  OPR_LT, OPR_LE, OPR_GT, OPR_GE,
+  OPR_AND, OPR_OR,
+  OPR_NOBINOPR
+} BinOpr;
+
+
+typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr;
+
+
+#define getcode(fs,e)	((fs)->f->code[(e)->u.s.info])
+
+#define luaK_codeAsBx(fs,o,A,sBx)	luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx)
+
+#define luaK_setmultret(fs,e)	luaK_setreturns(fs, e, LUA_MULTRET)
+
+LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx);
+LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C);
+LUAI_FUNC void luaK_fixline (FuncState *fs, int line);
+LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n);
+LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n);
+LUAI_FUNC void luaK_checkstack (FuncState *fs, int n);
+LUAI_FUNC int luaK_stringK (FuncState *fs, TString *s);
+LUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r);
+LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_exp2RK (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key);
+LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k);
+LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e);
+LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e);
+LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults);
+LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e);
+LUAI_FUNC int luaK_jump (FuncState *fs);
+LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret);
+LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target);
+LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list);
+LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2);
+LUAI_FUNC int luaK_getlabel (FuncState *fs);
+LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v);
+LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v);
+LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2);
+LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/ldblib.c b/redis-stable/deps/lua/src/ldblib.c
new file mode 100644
index 00000000..2027eda5
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldblib.c
@@ -0,0 +1,398 @@
+/*
+** $Id: ldblib.c,v 1.104.1.4 2009/08/04 18:50:18 roberto Exp $
+** Interface from Lua to its debug API
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define ldblib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+static int db_getregistry (lua_State *L) {
+  lua_pushvalue(L, LUA_REGISTRYINDEX);
+  return 1;
+}
+
+
+static int db_getmetatable (lua_State *L) {
+  luaL_checkany(L, 1);
+  if (!lua_getmetatable(L, 1)) {
+    lua_pushnil(L);  /* no metatable */
+  }
+  return 1;
+}
+
+
+static int db_setmetatable (lua_State *L) {
+  int t = lua_type(L, 2);
+  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,
+                    "nil or table expected");
+  lua_settop(L, 2);
+  lua_pushboolean(L, lua_setmetatable(L, 1));
+  return 1;
+}
+
+
+static int db_getfenv (lua_State *L) {
+  luaL_checkany(L, 1);
+  lua_getfenv(L, 1);
+  return 1;
+}
+
+
+static int db_setfenv (lua_State *L) {
+  luaL_checktype(L, 2, LUA_TTABLE);
+  lua_settop(L, 2);
+  if (lua_setfenv(L, 1) == 0)
+    luaL_error(L, LUA_QL("setfenv")
+                  " cannot change environment of given object");
+  return 1;
+}
+
+
+static void settabss (lua_State *L, const char *i, const char *v) {
+  lua_pushstring(L, v);
+  lua_setfield(L, -2, i);
+}
+
+
+static void settabsi (lua_State *L, const char *i, int v) {
+  lua_pushinteger(L, v);
+  lua_setfield(L, -2, i);
+}
+
+
+static lua_State *getthread (lua_State *L, int *arg) {
+  if (lua_isthread(L, 1)) {
+    *arg = 1;
+    return lua_tothread(L, 1);
+  }
+  else {
+    *arg = 0;
+    return L;
+  }
+}
+
+
+static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) {
+  if (L == L1) {
+    lua_pushvalue(L, -2);
+    lua_remove(L, -3);
+  }
+  else
+    lua_xmove(L1, L, 1);
+  lua_setfield(L, -2, fname);
+}
+
+
+static int db_getinfo (lua_State *L) {
+  lua_Debug ar;
+  int arg;
+  lua_State *L1 = getthread(L, &arg);
+  const char *options = luaL_optstring(L, arg+2, "flnSu");
+  if (lua_isnumber(L, arg+1)) {
+    if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) {
+      lua_pushnil(L);  /* level out of range */
+      return 1;
+    }
+  }
+  else if (lua_isfunction(L, arg+1)) {
+    lua_pushfstring(L, ">%s", options);
+    options = lua_tostring(L, -1);
+    lua_pushvalue(L, arg+1);
+    lua_xmove(L, L1, 1);
+  }
+  else
+    return luaL_argerror(L, arg+1, "function or level expected");
+  if (!lua_getinfo(L1, options, &ar))
+    return luaL_argerror(L, arg+2, "invalid option");
+  lua_createtable(L, 0, 2);
+  if (strchr(options, 'S')) {
+    settabss(L, "source", ar.source);
+    settabss(L, "short_src", ar.short_src);
+    settabsi(L, "linedefined", ar.linedefined);
+    settabsi(L, "lastlinedefined", ar.lastlinedefined);
+    settabss(L, "what", ar.what);
+  }
+  if (strchr(options, 'l'))
+    settabsi(L, "currentline", ar.currentline);
+  if (strchr(options, 'u'))
+    settabsi(L, "nups", ar.nups);
+  if (strchr(options, 'n')) {
+    settabss(L, "name", ar.name);
+    settabss(L, "namewhat", ar.namewhat);
+  }
+  if (strchr(options, 'L'))
+    treatstackoption(L, L1, "activelines");
+  if (strchr(options, 'f'))
+    treatstackoption(L, L1, "func");
+  return 1;  /* return table */
+}
+    
+
+static int db_getlocal (lua_State *L) {
+  int arg;
+  lua_State *L1 = getthread(L, &arg);
+  lua_Debug ar;
+  const char *name;
+  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */
+    return luaL_argerror(L, arg+1, "level out of range");
+  name = lua_getlocal(L1, &ar, luaL_checkint(L, arg+2));
+  if (name) {
+    lua_xmove(L1, L, 1);
+    lua_pushstring(L, name);
+    lua_pushvalue(L, -2);
+    return 2;
+  }
+  else {
+    lua_pushnil(L);
+    return 1;
+  }
+}
+
+
+static int db_setlocal (lua_State *L) {
+  int arg;
+  lua_State *L1 = getthread(L, &arg);
+  lua_Debug ar;
+  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */
+    return luaL_argerror(L, arg+1, "level out of range");
+  luaL_checkany(L, arg+3);
+  lua_settop(L, arg+3);
+  lua_xmove(L, L1, 1);
+  lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+2)));
+  return 1;
+}
+
+
+static int auxupvalue (lua_State *L, int get) {
+  const char *name;
+  int n = luaL_checkint(L, 2);
+  luaL_checktype(L, 1, LUA_TFUNCTION);
+  if (lua_iscfunction(L, 1)) return 0;  /* cannot touch C upvalues from Lua */
+  name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);
+  if (name == NULL) return 0;
+  lua_pushstring(L, name);
+  lua_insert(L, -(get+1));
+  return get + 1;
+}
+
+
+static int db_getupvalue (lua_State *L) {
+  return auxupvalue(L, 1);
+}
+
+
+static int db_setupvalue (lua_State *L) {
+  luaL_checkany(L, 3);
+  return auxupvalue(L, 0);
+}
+
+
+
+static const char KEY_HOOK = 'h';
+
+
+static void hookf (lua_State *L, lua_Debug *ar) {
+  static const char *const hooknames[] =
+    {"call", "return", "line", "count", "tail return"};
+  lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+  lua_rawget(L, LUA_REGISTRYINDEX);
+  lua_pushlightuserdata(L, L);
+  lua_rawget(L, -2);
+  if (lua_isfunction(L, -1)) {
+    lua_pushstring(L, hooknames[(int)ar->event]);
+    if (ar->currentline >= 0)
+      lua_pushinteger(L, ar->currentline);
+    else lua_pushnil(L);
+    lua_assert(lua_getinfo(L, "lS", ar));
+    lua_call(L, 2, 0);
+  }
+}
+
+
+static int makemask (const char *smask, int count) {
+  int mask = 0;
+  if (strchr(smask, 'c')) mask |= LUA_MASKCALL;
+  if (strchr(smask, 'r')) mask |= LUA_MASKRET;
+  if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
+  if (count > 0) mask |= LUA_MASKCOUNT;
+  return mask;
+}
+
+
+static char *unmakemask (int mask, char *smask) {
+  int i = 0;
+  if (mask & LUA_MASKCALL) smask[i++] = 'c';
+  if (mask & LUA_MASKRET) smask[i++] = 'r';
+  if (mask & LUA_MASKLINE) smask[i++] = 'l';
+  smask[i] = '\0';
+  return smask;
+}
+
+
+static void gethooktable (lua_State *L) {
+  lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+  lua_rawget(L, LUA_REGISTRYINDEX);
+  if (!lua_istable(L, -1)) {
+    lua_pop(L, 1);
+    lua_createtable(L, 0, 1);
+    lua_pushlightuserdata(L, (void *)&KEY_HOOK);
+    lua_pushvalue(L, -2);
+    lua_rawset(L, LUA_REGISTRYINDEX);
+  }
+}
+
+
+static int db_sethook (lua_State *L) {
+  int arg, mask, count;
+  lua_Hook func;
+  lua_State *L1 = getthread(L, &arg);
+  if (lua_isnoneornil(L, arg+1)) {
+    lua_settop(L, arg+1);
+    func = NULL; mask = 0; count = 0;  /* turn off hooks */
+  }
+  else {
+    const char *smask = luaL_checkstring(L, arg+2);
+    luaL_checktype(L, arg+1, LUA_TFUNCTION);
+    count = luaL_optint(L, arg+3, 0);
+    func = hookf; mask = makemask(smask, count);
+  }
+  gethooktable(L);
+  lua_pushlightuserdata(L, L1);
+  lua_pushvalue(L, arg+1);
+  lua_rawset(L, -3);  /* set new hook */
+  lua_pop(L, 1);  /* remove hook table */
+  lua_sethook(L1, func, mask, count);  /* set hooks */
+  return 0;
+}
+
+
+static int db_gethook (lua_State *L) {
+  int arg;
+  lua_State *L1 = getthread(L, &arg);
+  char buff[5];
+  int mask = lua_gethookmask(L1);
+  lua_Hook hook = lua_gethook(L1);
+  if (hook != NULL && hook != hookf)  /* external hook? */
+    lua_pushliteral(L, "external hook");
+  else {
+    gethooktable(L);
+    lua_pushlightuserdata(L, L1);
+    lua_rawget(L, -2);   /* get hook */
+    lua_remove(L, -2);  /* remove hook table */
+  }
+  lua_pushstring(L, unmakemask(mask, buff));
+  lua_pushinteger(L, lua_gethookcount(L1));
+  return 3;
+}
+
+
+static int db_debug (lua_State *L) {
+  for (;;) {
+    char buffer[250];
+    fputs("lua_debug> ", stderr);
+    if (fgets(buffer, sizeof(buffer), stdin) == 0 ||
+        strcmp(buffer, "cont\n") == 0)
+      return 0;
+    if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") ||
+        lua_pcall(L, 0, 0, 0)) {
+      fputs(lua_tostring(L, -1), stderr);
+      fputs("\n", stderr);
+    }
+    lua_settop(L, 0);  /* remove eventual returns */
+  }
+}
+
+
+#define LEVELS1	12	/* size of the first part of the stack */
+#define LEVELS2	10	/* size of the second part of the stack */
+
+static int db_errorfb (lua_State *L) {
+  int level;
+  int firstpart = 1;  /* still before eventual `...' */
+  int arg;
+  lua_State *L1 = getthread(L, &arg);
+  lua_Debug ar;
+  if (lua_isnumber(L, arg+2)) {
+    level = (int)lua_tointeger(L, arg+2);
+    lua_pop(L, 1);
+  }
+  else
+    level = (L == L1) ? 1 : 0;  /* level 0 may be this own function */
+  if (lua_gettop(L) == arg)
+    lua_pushliteral(L, "");
+  else if (!lua_isstring(L, arg+1)) return 1;  /* message is not a string */
+  else lua_pushliteral(L, "\n");
+  lua_pushliteral(L, "stack traceback:");
+  while (lua_getstack(L1, level++, &ar)) {
+    if (level > LEVELS1 && firstpart) {
+      /* no more than `LEVELS2' more levels? */
+      if (!lua_getstack(L1, level+LEVELS2, &ar))
+        level--;  /* keep going */
+      else {
+        lua_pushliteral(L, "\n\t...");  /* too many levels */
+        while (lua_getstack(L1, level+LEVELS2, &ar))  /* find last levels */
+          level++;
+      }
+      firstpart = 0;
+      continue;
+    }
+    lua_pushliteral(L, "\n\t");
+    lua_getinfo(L1, "Snl", &ar);
+    lua_pushfstring(L, "%s:", ar.short_src);
+    if (ar.currentline > 0)
+      lua_pushfstring(L, "%d:", ar.currentline);
+    if (*ar.namewhat != '\0')  /* is there a name? */
+        lua_pushfstring(L, " in function " LUA_QS, ar.name);
+    else {
+      if (*ar.what == 'm')  /* main? */
+        lua_pushfstring(L, " in main chunk");
+      else if (*ar.what == 'C' || *ar.what == 't')
+        lua_pushliteral(L, " ?");  /* C function or tail call */
+      else
+        lua_pushfstring(L, " in function <%s:%d>",
+                           ar.short_src, ar.linedefined);
+    }
+    lua_concat(L, lua_gettop(L) - arg);
+  }
+  lua_concat(L, lua_gettop(L) - arg);
+  return 1;
+}
+
+
+static const luaL_Reg dblib[] = {
+  {"debug", db_debug},
+  {"getfenv", db_getfenv},
+  {"gethook", db_gethook},
+  {"getinfo", db_getinfo},
+  {"getlocal", db_getlocal},
+  {"getregistry", db_getregistry},
+  {"getmetatable", db_getmetatable},
+  {"getupvalue", db_getupvalue},
+  {"setfenv", db_setfenv},
+  {"sethook", db_sethook},
+  {"setlocal", db_setlocal},
+  {"setmetatable", db_setmetatable},
+  {"setupvalue", db_setupvalue},
+  {"traceback", db_errorfb},
+  {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_debug (lua_State *L) {
+  luaL_register(L, LUA_DBLIBNAME, dblib);
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/ldebug.c b/redis-stable/deps/lua/src/ldebug.c
new file mode 100644
index 00000000..50ad3d38
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldebug.c
@@ -0,0 +1,638 @@
+/*
+** $Id: ldebug.c,v 2.29.1.6 2008/05/08 16:56:26 roberto Exp $
+** Debug Interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdarg.h>
+#include <stddef.h>
+#include <string.h>
+
+
+#define ldebug_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lapi.h"
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lvm.h"
+
+
+
+static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name);
+
+
+static int currentpc (lua_State *L, CallInfo *ci) {
+  if (!isLua(ci)) return -1;  /* function is not a Lua function? */
+  if (ci == L->ci)
+    ci->savedpc = L->savedpc;
+  return pcRel(ci->savedpc, ci_func(ci)->l.p);
+}
+
+
+static int currentline (lua_State *L, CallInfo *ci) {
+  int pc = currentpc(L, ci);
+  if (pc < 0)
+    return -1;  /* only active lua functions have current-line information */
+  else
+    return getline(ci_func(ci)->l.p, pc);
+}
+
+
+/*
+** this function can be called asynchronous (e.g. during a signal)
+*/
+LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
+  if (func == NULL || mask == 0) {  /* turn off hooks? */
+    mask = 0;
+    func = NULL;
+  }
+  L->hook = func;
+  L->basehookcount = count;
+  resethookcount(L);
+  L->hookmask = cast_byte(mask);
+  return 1;
+}
+
+
+LUA_API lua_Hook lua_gethook (lua_State *L) {
+  return L->hook;
+}
+
+
+LUA_API int lua_gethookmask (lua_State *L) {
+  return L->hookmask;
+}
+
+
+LUA_API int lua_gethookcount (lua_State *L) {
+  return L->basehookcount;
+}
+
+
+LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {
+  int status;
+  CallInfo *ci;
+  lua_lock(L);
+  for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) {
+    level--;
+    if (f_isLua(ci))  /* Lua function? */
+      level -= ci->tailcalls;  /* skip lost tail calls */
+  }
+  if (level == 0 && ci > L->base_ci) {  /* level found? */
+    status = 1;
+    ar->i_ci = cast_int(ci - L->base_ci);
+  }
+  else if (level < 0) {  /* level is of a lost tail call? */
+    status = 1;
+    ar->i_ci = 0;
+  }
+  else status = 0;  /* no such level */
+  lua_unlock(L);
+  return status;
+}
+
+
+static Proto *getluaproto (CallInfo *ci) {
+  return (isLua(ci) ? ci_func(ci)->l.p : NULL);
+}
+
+
+static const char *findlocal (lua_State *L, CallInfo *ci, int n) {
+  const char *name;
+  Proto *fp = getluaproto(ci);
+  if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL)
+    return name;  /* is a local variable in a Lua function */
+  else {
+    StkId limit = (ci == L->ci) ? L->top : (ci+1)->func;
+    if (limit - ci->base >= n && n > 0)  /* is 'n' inside 'ci' stack? */
+      return "(*temporary)";
+    else
+      return NULL;
+  }
+}
+
+
+LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
+  CallInfo *ci = L->base_ci + ar->i_ci;
+  const char *name = findlocal(L, ci, n);
+  lua_lock(L);
+  if (name)
+      luaA_pushobject(L, ci->base + (n - 1));
+  lua_unlock(L);
+  return name;
+}
+
+
+LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
+  CallInfo *ci = L->base_ci + ar->i_ci;
+  const char *name = findlocal(L, ci, n);
+  lua_lock(L);
+  if (name)
+      setobjs2s(L, ci->base + (n - 1), L->top - 1);
+  L->top--;  /* pop value */
+  lua_unlock(L);
+  return name;
+}
+
+
+static void funcinfo (lua_Debug *ar, Closure *cl) {
+  if (cl->c.isC) {
+    ar->source = "=[C]";
+    ar->linedefined = -1;
+    ar->lastlinedefined = -1;
+    ar->what = "C";
+  }
+  else {
+    ar->source = getstr(cl->l.p->source);
+    ar->linedefined = cl->l.p->linedefined;
+    ar->lastlinedefined = cl->l.p->lastlinedefined;
+    ar->what = (ar->linedefined == 0) ? "main" : "Lua";
+  }
+  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+}
+
+
+static void info_tailcall (lua_Debug *ar) {
+  ar->name = ar->namewhat = "";
+  ar->what = "tail";
+  ar->lastlinedefined = ar->linedefined = ar->currentline = -1;
+  ar->source = "=(tail call)";
+  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
+  ar->nups = 0;
+}
+
+
+static void collectvalidlines (lua_State *L, Closure *f) {
+  if (f == NULL || f->c.isC) {
+    setnilvalue(L->top);
+  }
+  else {
+    Table *t = luaH_new(L, 0, 0);
+    int *lineinfo = f->l.p->lineinfo;
+    int i;
+    for (i=0; i<f->l.p->sizelineinfo; i++)
+      setbvalue(luaH_setnum(L, t, lineinfo[i]), 1);
+    sethvalue(L, L->top, t); 
+  }
+  incr_top(L);
+}
+
+
+static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
+                    Closure *f, CallInfo *ci) {
+  int status = 1;
+  if (f == NULL) {
+    info_tailcall(ar);
+    return status;
+  }
+  for (; *what; what++) {
+    switch (*what) {
+      case 'S': {
+        funcinfo(ar, f);
+        break;
+      }
+      case 'l': {
+        ar->currentline = (ci) ? currentline(L, ci) : -1;
+        break;
+      }
+      case 'u': {
+        ar->nups = f->c.nupvalues;
+        break;
+      }
+      case 'n': {
+        ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL;
+        if (ar->namewhat == NULL) {
+          ar->namewhat = "";  /* not found */
+          ar->name = NULL;
+        }
+        break;
+      }
+      case 'L':
+      case 'f':  /* handled by lua_getinfo */
+        break;
+      default: status = 0;  /* invalid option */
+    }
+  }
+  return status;
+}
+
+
+LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
+  int status;
+  Closure *f = NULL;
+  CallInfo *ci = NULL;
+  lua_lock(L);
+  if (*what == '>') {
+    StkId func = L->top - 1;
+    luai_apicheck(L, ttisfunction(func));
+    what++;  /* skip the '>' */
+    f = clvalue(func);
+    L->top--;  /* pop function */
+  }
+  else if (ar->i_ci != 0) {  /* no tail call? */
+    ci = L->base_ci + ar->i_ci;
+    lua_assert(ttisfunction(ci->func));
+    f = clvalue(ci->func);
+  }
+  status = auxgetinfo(L, what, ar, f, ci);
+  if (strchr(what, 'f')) {
+    if (f == NULL) setnilvalue(L->top);
+    else setclvalue(L, L->top, f);
+    incr_top(L);
+  }
+  if (strchr(what, 'L'))
+    collectvalidlines(L, f);
+  lua_unlock(L);
+  return status;
+}
+
+
+/*
+** {======================================================
+** Symbolic Execution and code checker
+** =======================================================
+*/
+
+#define check(x)		if (!(x)) return 0;
+
+#define checkjump(pt,pc)	check(0 <= pc && pc < pt->sizecode)
+
+#define checkreg(pt,reg)	check((reg) < (pt)->maxstacksize)
+
+
+
+static int precheck (const Proto *pt) {
+  check(pt->maxstacksize <= MAXSTACK);
+  check(pt->numparams+(pt->is_vararg & VARARG_HASARG) <= pt->maxstacksize);
+  check(!(pt->is_vararg & VARARG_NEEDSARG) ||
+              (pt->is_vararg & VARARG_HASARG));
+  check(pt->sizeupvalues <= pt->nups);
+  check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
+  check(pt->sizecode > 0 && GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
+  return 1;
+}
+
+
+#define checkopenop(pt,pc)	luaG_checkopenop((pt)->code[(pc)+1])
+
+int luaG_checkopenop (Instruction i) {
+  switch (GET_OPCODE(i)) {
+    case OP_CALL:
+    case OP_TAILCALL:
+    case OP_RETURN:
+    case OP_SETLIST: {
+      check(GETARG_B(i) == 0);
+      return 1;
+    }
+    default: return 0;  /* invalid instruction after an open call */
+  }
+}
+
+
+static int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) {
+  switch (mode) {
+    case OpArgN: check(r == 0); break;
+    case OpArgU: break;
+    case OpArgR: checkreg(pt, r); break;
+    case OpArgK:
+      check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize);
+      break;
+  }
+  return 1;
+}
+
+
+static Instruction symbexec (const Proto *pt, int lastpc, int reg) {
+  int pc;
+  int last;  /* stores position of last instruction that changed `reg' */
+  last = pt->sizecode-1;  /* points to final return (a `neutral' instruction) */
+  check(precheck(pt));
+  for (pc = 0; pc < lastpc; pc++) {
+    Instruction i = pt->code[pc];
+    OpCode op = GET_OPCODE(i);
+    int a = GETARG_A(i);
+    int b = 0;
+    int c = 0;
+    check(op < NUM_OPCODES);
+    checkreg(pt, a);
+    switch (getOpMode(op)) {
+      case iABC: {
+        b = GETARG_B(i);
+        c = GETARG_C(i);
+        check(checkArgMode(pt, b, getBMode(op)));
+        check(checkArgMode(pt, c, getCMode(op)));
+        break;
+      }
+      case iABx: {
+        b = GETARG_Bx(i);
+        if (getBMode(op) == OpArgK) check(b < pt->sizek);
+        break;
+      }
+      case iAsBx: {
+        b = GETARG_sBx(i);
+        if (getBMode(op) == OpArgR) {
+          int dest = pc+1+b;
+          check(0 <= dest && dest < pt->sizecode);
+          if (dest > 0) {
+            int j;
+            /* check that it does not jump to a setlist count; this
+               is tricky, because the count from a previous setlist may
+               have the same value of an invalid setlist; so, we must
+               go all the way back to the first of them (if any) */
+            for (j = 0; j < dest; j++) {
+              Instruction d = pt->code[dest-1-j];
+              if (!(GET_OPCODE(d) == OP_SETLIST && GETARG_C(d) == 0)) break;
+            }
+            /* if 'j' is even, previous value is not a setlist (even if
+               it looks like one) */
+            check((j&1) == 0);
+          }
+        }
+        break;
+      }
+    }
+    if (testAMode(op)) {
+      if (a == reg) last = pc;  /* change register `a' */
+    }
+    if (testTMode(op)) {
+      check(pc+2 < pt->sizecode);  /* check skip */
+      check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
+    }
+    switch (op) {
+      case OP_LOADBOOL: {
+        if (c == 1) {  /* does it jump? */
+          check(pc+2 < pt->sizecode);  /* check its jump */
+          check(GET_OPCODE(pt->code[pc+1]) != OP_SETLIST ||
+                GETARG_C(pt->code[pc+1]) != 0);
+        }
+        break;
+      }
+      case OP_LOADNIL: {
+        if (a <= reg && reg <= b)
+          last = pc;  /* set registers from `a' to `b' */
+        break;
+      }
+      case OP_GETUPVAL:
+      case OP_SETUPVAL: {
+        check(b < pt->nups);
+        break;
+      }
+      case OP_GETGLOBAL:
+      case OP_SETGLOBAL: {
+        check(ttisstring(&pt->k[b]));
+        break;
+      }
+      case OP_SELF: {
+        checkreg(pt, a+1);
+        if (reg == a+1) last = pc;
+        break;
+      }
+      case OP_CONCAT: {
+        check(b < c);  /* at least two operands */
+        break;
+      }
+      case OP_TFORLOOP: {
+        check(c >= 1);  /* at least one result (control variable) */
+        checkreg(pt, a+2+c);  /* space for results */
+        if (reg >= a+2) last = pc;  /* affect all regs above its base */
+        break;
+      }
+      case OP_FORLOOP:
+      case OP_FORPREP:
+        checkreg(pt, a+3);
+        /* go through */
+      case OP_JMP: {
+        int dest = pc+1+b;
+        /* not full check and jump is forward and do not skip `lastpc'? */
+        if (reg != NO_REG && pc < dest && dest <= lastpc)
+          pc += b;  /* do the jump */
+        break;
+      }
+      case OP_CALL:
+      case OP_TAILCALL: {
+        if (b != 0) {
+          checkreg(pt, a+b-1);
+        }
+        c--;  /* c = num. returns */
+        if (c == LUA_MULTRET) {
+          check(checkopenop(pt, pc));
+        }
+        else if (c != 0)
+          checkreg(pt, a+c-1);
+        if (reg >= a) last = pc;  /* affect all registers above base */
+        break;
+      }
+      case OP_RETURN: {
+        b--;  /* b = num. returns */
+        if (b > 0) checkreg(pt, a+b-1);
+        break;
+      }
+      case OP_SETLIST: {
+        if (b > 0) checkreg(pt, a + b);
+        if (c == 0) {
+          pc++;
+          check(pc < pt->sizecode - 1);
+        }
+        break;
+      }
+      case OP_CLOSURE: {
+        int nup, j;
+        check(b < pt->sizep);
+        nup = pt->p[b]->nups;
+        check(pc + nup < pt->sizecode);
+        for (j = 1; j <= nup; j++) {
+          OpCode op1 = GET_OPCODE(pt->code[pc + j]);
+          check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
+        }
+        if (reg != NO_REG)  /* tracing? */
+          pc += nup;  /* do not 'execute' these pseudo-instructions */
+        break;
+      }
+      case OP_VARARG: {
+        check((pt->is_vararg & VARARG_ISVARARG) &&
+             !(pt->is_vararg & VARARG_NEEDSARG));
+        b--;
+        if (b == LUA_MULTRET) check(checkopenop(pt, pc));
+        checkreg(pt, a+b-1);
+        break;
+      }
+      default: break;
+    }
+  }
+  return pt->code[last];
+}
+
+#undef check
+#undef checkjump
+#undef checkreg
+
+/* }====================================================== */
+
+
+int luaG_checkcode (const Proto *pt) {
+  return (symbexec(pt, pt->sizecode, NO_REG) != 0);
+}
+
+
+static const char *kname (Proto *p, int c) {
+  if (ISK(c) && ttisstring(&p->k[INDEXK(c)]))
+    return svalue(&p->k[INDEXK(c)]);
+  else
+    return "?";
+}
+
+
+static const char *getobjname (lua_State *L, CallInfo *ci, int stackpos,
+                               const char **name) {
+  if (isLua(ci)) {  /* a Lua function? */
+    Proto *p = ci_func(ci)->l.p;
+    int pc = currentpc(L, ci);
+    Instruction i;
+    *name = luaF_getlocalname(p, stackpos+1, pc);
+    if (*name)  /* is a local? */
+      return "local";
+    i = symbexec(p, pc, stackpos);  /* try symbolic execution */
+    lua_assert(pc != -1);
+    switch (GET_OPCODE(i)) {
+      case OP_GETGLOBAL: {
+        int g = GETARG_Bx(i);  /* global index */
+        lua_assert(ttisstring(&p->k[g]));
+        *name = svalue(&p->k[g]);
+        return "global";
+      }
+      case OP_MOVE: {
+        int a = GETARG_A(i);
+        int b = GETARG_B(i);  /* move from `b' to `a' */
+        if (b < a)
+          return getobjname(L, ci, b, name);  /* get name for `b' */
+        break;
+      }
+      case OP_GETTABLE: {
+        int k = GETARG_C(i);  /* key index */
+        *name = kname(p, k);
+        return "field";
+      }
+      case OP_GETUPVAL: {
+        int u = GETARG_B(i);  /* upvalue index */
+        *name = p->upvalues ? getstr(p->upvalues[u]) : "?";
+        return "upvalue";
+      }
+      case OP_SELF: {
+        int k = GETARG_C(i);  /* key index */
+        *name = kname(p, k);
+        return "method";
+      }
+      default: break;
+    }
+  }
+  return NULL;  /* no useful name found */
+}
+
+
+static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) {
+  Instruction i;
+  if ((isLua(ci) && ci->tailcalls > 0) || !isLua(ci - 1))
+    return NULL;  /* calling function is not Lua (or is unknown) */
+  ci--;  /* calling function */
+  i = ci_func(ci)->l.p->code[currentpc(L, ci)];
+  if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||
+      GET_OPCODE(i) == OP_TFORLOOP)
+    return getobjname(L, ci, GETARG_A(i), name);
+  else
+    return NULL;  /* no useful name can be found */
+}
+
+
+/* only ANSI way to check whether a pointer points to an array */
+static int isinstack (CallInfo *ci, const TValue *o) {
+  StkId p;
+  for (p = ci->base; p < ci->top; p++)
+    if (o == p) return 1;
+  return 0;
+}
+
+
+void luaG_typeerror (lua_State *L, const TValue *o, const char *op) {
+  const char *name = NULL;
+  const char *t = luaT_typenames[ttype(o)];
+  const char *kind = (isinstack(L->ci, o)) ?
+                         getobjname(L, L->ci, cast_int(o - L->base), &name) :
+                         NULL;
+  if (kind)
+    luaG_runerror(L, "attempt to %s %s " LUA_QS " (a %s value)",
+                op, kind, name, t);
+  else
+    luaG_runerror(L, "attempt to %s a %s value", op, t);
+}
+
+
+void luaG_concaterror (lua_State *L, StkId p1, StkId p2) {
+  if (ttisstring(p1) || ttisnumber(p1)) p1 = p2;
+  lua_assert(!ttisstring(p1) && !ttisnumber(p1));
+  luaG_typeerror(L, p1, "concatenate");
+}
+
+
+void luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) {
+  TValue temp;
+  if (luaV_tonumber(p1, &temp) == NULL)
+    p2 = p1;  /* first operand is wrong */
+  luaG_typeerror(L, p2, "perform arithmetic on");
+}
+
+
+int luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) {
+  const char *t1 = luaT_typenames[ttype(p1)];
+  const char *t2 = luaT_typenames[ttype(p2)];
+  if (t1[2] == t2[2])
+    luaG_runerror(L, "attempt to compare two %s values", t1);
+  else
+    luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
+  return 0;
+}
+
+
+static void addinfo (lua_State *L, const char *msg) {
+  CallInfo *ci = L->ci;
+  if (isLua(ci)) {  /* is Lua code? */
+    char buff[LUA_IDSIZE];  /* add file:line information */
+    int line = currentline(L, ci);
+    luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);
+    luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
+  }
+}
+
+
+void luaG_errormsg (lua_State *L) {
+  if (L->errfunc != 0) {  /* is there an error handling function? */
+    StkId errfunc = restorestack(L, L->errfunc);
+    if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);
+    setobjs2s(L, L->top, L->top - 1);  /* move argument */
+    setobjs2s(L, L->top - 1, errfunc);  /* push function */
+    incr_top(L);
+    luaD_call(L, L->top - 2, 1);  /* call it */
+  }
+  luaD_throw(L, LUA_ERRRUN);
+}
+
+
+void luaG_runerror (lua_State *L, const char *fmt, ...) {
+  va_list argp;
+  va_start(argp, fmt);
+  addinfo(L, luaO_pushvfstring(L, fmt, argp));
+  va_end(argp);
+  luaG_errormsg(L);
+}
+
diff --git a/redis-stable/deps/lua/src/ldebug.h b/redis-stable/deps/lua/src/ldebug.h
new file mode 100644
index 00000000..ba28a972
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldebug.h
@@ -0,0 +1,33 @@
+/*
+** $Id: ldebug.h,v 2.3.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions from Debug Interface module
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ldebug_h
+#define ldebug_h
+
+
+#include "lstate.h"
+
+
+#define pcRel(pc, p)	(cast(int, (pc) - (p)->code) - 1)
+
+#define getline(f,pc)	(((f)->lineinfo) ? (f)->lineinfo[pc] : 0)
+
+#define resethookcount(L)	(L->hookcount = L->basehookcount)
+
+
+LUAI_FUNC void luaG_typeerror (lua_State *L, const TValue *o,
+                                             const char *opname);
+LUAI_FUNC void luaG_concaterror (lua_State *L, StkId p1, StkId p2);
+LUAI_FUNC void luaG_aritherror (lua_State *L, const TValue *p1,
+                                              const TValue *p2);
+LUAI_FUNC int luaG_ordererror (lua_State *L, const TValue *p1,
+                                             const TValue *p2);
+LUAI_FUNC void luaG_runerror (lua_State *L, const char *fmt, ...);
+LUAI_FUNC void luaG_errormsg (lua_State *L);
+LUAI_FUNC int luaG_checkcode (const Proto *pt);
+LUAI_FUNC int luaG_checkopenop (Instruction i);
+
+#endif
diff --git a/redis-stable/deps/lua/src/ldo.c b/redis-stable/deps/lua/src/ldo.c
new file mode 100644
index 00000000..e641dfcd
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldo.c
@@ -0,0 +1,519 @@
+/*
+** $Id: ldo.c,v 2.38.1.4 2012/01/18 02:27:10 roberto Exp $
+** Stack and Call structure of Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#include <setjmp.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define ldo_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lundump.h"
+#include "lvm.h"
+#include "lzio.h"
+
+
+
+
+/*
+** {======================================================
+** Error-recovery functions
+** =======================================================
+*/
+
+
+/* chain list of long jump buffers */
+struct lua_longjmp {
+  struct lua_longjmp *previous;
+  luai_jmpbuf b;
+  volatile int status;  /* error code */
+};
+
+
+void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) {
+  switch (errcode) {
+    case LUA_ERRMEM: {
+      setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG));
+      break;
+    }
+    case LUA_ERRERR: {
+      setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling"));
+      break;
+    }
+    case LUA_ERRSYNTAX:
+    case LUA_ERRRUN: {
+      setobjs2s(L, oldtop, L->top - 1);  /* error message on current top */
+      break;
+    }
+  }
+  L->top = oldtop + 1;
+}
+
+
+static void restore_stack_limit (lua_State *L) {
+  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
+  if (L->size_ci > LUAI_MAXCALLS) {  /* there was an overflow? */
+    int inuse = cast_int(L->ci - L->base_ci);
+    if (inuse + 1 < LUAI_MAXCALLS)  /* can `undo' overflow? */
+      luaD_reallocCI(L, LUAI_MAXCALLS);
+  }
+}
+
+
+static void resetstack (lua_State *L, int status) {
+  L->ci = L->base_ci;
+  L->base = L->ci->base;
+  luaF_close(L, L->base);  /* close eventual pending closures */
+  luaD_seterrorobj(L, status, L->base);
+  L->nCcalls = L->baseCcalls;
+  L->allowhook = 1;
+  restore_stack_limit(L);
+  L->errfunc = 0;
+  L->errorJmp = NULL;
+}
+
+
+void luaD_throw (lua_State *L, int errcode) {
+  if (L->errorJmp) {
+    L->errorJmp->status = errcode;
+    LUAI_THROW(L, L->errorJmp);
+  }
+  else {
+    L->status = cast_byte(errcode);
+    if (G(L)->panic) {
+      resetstack(L, errcode);
+      lua_unlock(L);
+      G(L)->panic(L);
+    }
+    exit(EXIT_FAILURE);
+  }
+}
+
+
+int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) {
+  struct lua_longjmp lj;
+  lj.status = 0;
+  lj.previous = L->errorJmp;  /* chain new error handler */
+  L->errorJmp = &lj;
+  LUAI_TRY(L, &lj,
+    (*f)(L, ud);
+  );
+  L->errorJmp = lj.previous;  /* restore old error handler */
+  return lj.status;
+}
+
+/* }====================================================== */
+
+
+static void correctstack (lua_State *L, TValue *oldstack) {
+  CallInfo *ci;
+  GCObject *up;
+  L->top = (L->top - oldstack) + L->stack;
+  for (up = L->openupval; up != NULL; up = up->gch.next)
+    gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;
+  for (ci = L->base_ci; ci <= L->ci; ci++) {
+    ci->top = (ci->top - oldstack) + L->stack;
+    ci->base = (ci->base - oldstack) + L->stack;
+    ci->func = (ci->func - oldstack) + L->stack;
+  }
+  L->base = (L->base - oldstack) + L->stack;
+}
+
+
+void luaD_reallocstack (lua_State *L, int newsize) {
+  TValue *oldstack = L->stack;
+  int realsize = newsize + 1 + EXTRA_STACK;
+  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
+  luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue);
+  L->stacksize = realsize;
+  L->stack_last = L->stack+newsize;
+  correctstack(L, oldstack);
+}
+
+
+void luaD_reallocCI (lua_State *L, int newsize) {
+  CallInfo *oldci = L->base_ci;
+  luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo);
+  L->size_ci = newsize;
+  L->ci = (L->ci - oldci) + L->base_ci;
+  L->end_ci = L->base_ci + L->size_ci - 1;
+}
+
+
+void luaD_growstack (lua_State *L, int n) {
+  if (n <= L->stacksize)  /* double size is enough? */
+    luaD_reallocstack(L, 2*L->stacksize);
+  else
+    luaD_reallocstack(L, L->stacksize + n);
+}
+
+
+static CallInfo *growCI (lua_State *L) {
+  if (L->size_ci > LUAI_MAXCALLS)  /* overflow while handling overflow? */
+    luaD_throw(L, LUA_ERRERR);
+  else {
+    luaD_reallocCI(L, 2*L->size_ci);
+    if (L->size_ci > LUAI_MAXCALLS)
+      luaG_runerror(L, "stack overflow");
+  }
+  return ++L->ci;
+}
+
+
+void luaD_callhook (lua_State *L, int event, int line) {
+  lua_Hook hook = L->hook;
+  if (hook && L->allowhook) {
+    ptrdiff_t top = savestack(L, L->top);
+    ptrdiff_t ci_top = savestack(L, L->ci->top);
+    lua_Debug ar;
+    ar.event = event;
+    ar.currentline = line;
+    if (event == LUA_HOOKTAILRET)
+      ar.i_ci = 0;  /* tail call; no debug information about it */
+    else
+      ar.i_ci = cast_int(L->ci - L->base_ci);
+    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */
+    L->ci->top = L->top + LUA_MINSTACK;
+    lua_assert(L->ci->top <= L->stack_last);
+    L->allowhook = 0;  /* cannot call hooks inside a hook */
+    lua_unlock(L);
+    (*hook)(L, &ar);
+    lua_lock(L);
+    lua_assert(!L->allowhook);
+    L->allowhook = 1;
+    L->ci->top = restorestack(L, ci_top);
+    L->top = restorestack(L, top);
+  }
+}
+
+
+static StkId adjust_varargs (lua_State *L, Proto *p, int actual) {
+  int i;
+  int nfixargs = p->numparams;
+  Table *htab = NULL;
+  StkId base, fixed;
+  for (; actual < nfixargs; ++actual)
+    setnilvalue(L->top++);
+#if defined(LUA_COMPAT_VARARG)
+  if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */
+    int nvar = actual - nfixargs;  /* number of extra arguments */
+    lua_assert(p->is_vararg & VARARG_HASARG);
+    luaC_checkGC(L);
+    luaD_checkstack(L, p->maxstacksize);
+    htab = luaH_new(L, nvar, 1);  /* create `arg' table */
+    for (i=0; i<nvar; i++)  /* put extra arguments into `arg' table */
+      setobj2n(L, luaH_setnum(L, htab, i+1), L->top - nvar + i);
+    /* store counter in field `n' */
+    setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, "n")), cast_num(nvar));
+  }
+#endif
+  /* move fixed parameters to final position */
+  fixed = L->top - actual;  /* first fixed argument */
+  base = L->top;  /* final position of first argument */
+  for (i=0; i<nfixargs; i++) {
+    setobjs2s(L, L->top++, fixed+i);
+    setnilvalue(fixed+i);
+  }
+  /* add `arg' parameter */
+  if (htab) {
+    sethvalue(L, L->top++, htab);
+    lua_assert(iswhite(obj2gco(htab)));
+  }
+  return base;
+}
+
+
+static StkId tryfuncTM (lua_State *L, StkId func) {
+  const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL);
+  StkId p;
+  ptrdiff_t funcr = savestack(L, func);
+  if (!ttisfunction(tm))
+    luaG_typeerror(L, func, "call");
+  /* Open a hole inside the stack at `func' */
+  for (p = L->top; p > func; p--) setobjs2s(L, p, p-1);
+  incr_top(L);
+  func = restorestack(L, funcr);  /* previous call may change stack */
+  setobj2s(L, func, tm);  /* tag method is the new function to be called */
+  return func;
+}
+
+
+
+#define inc_ci(L) \
+  ((L->ci == L->end_ci) ? growCI(L) : \
+   (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci))
+
+
+int luaD_precall (lua_State *L, StkId func, int nresults) {
+  LClosure *cl;
+  ptrdiff_t funcr;
+  if (!ttisfunction(func)) /* `func' is not a function? */
+    func = tryfuncTM(L, func);  /* check the `function' tag method */
+  funcr = savestack(L, func);
+  cl = &clvalue(func)->l;
+  L->ci->savedpc = L->savedpc;
+  if (!cl->isC) {  /* Lua function? prepare its call */
+    CallInfo *ci;
+    StkId st, base;
+    Proto *p = cl->p;
+    luaD_checkstack(L, p->maxstacksize + p->numparams);
+    func = restorestack(L, funcr);
+    if (!p->is_vararg) {  /* no varargs? */
+      base = func + 1;
+      if (L->top > base + p->numparams)
+        L->top = base + p->numparams;
+    }
+    else {  /* vararg function */
+      int nargs = cast_int(L->top - func) - 1;
+      base = adjust_varargs(L, p, nargs);
+      func = restorestack(L, funcr);  /* previous call may change the stack */
+    }
+    ci = inc_ci(L);  /* now `enter' new function */
+    ci->func = func;
+    L->base = ci->base = base;
+    ci->top = L->base + p->maxstacksize;
+    lua_assert(ci->top <= L->stack_last);
+    L->savedpc = p->code;  /* starting point */
+    ci->tailcalls = 0;
+    ci->nresults = nresults;
+    for (st = L->top; st < ci->top; st++)
+      setnilvalue(st);
+    L->top = ci->top;
+    if (L->hookmask & LUA_MASKCALL) {
+      L->savedpc++;  /* hooks assume 'pc' is already incremented */
+      luaD_callhook(L, LUA_HOOKCALL, -1);
+      L->savedpc--;  /* correct 'pc' */
+    }
+    return PCRLUA;
+  }
+  else {  /* if is a C function, call it */
+    CallInfo *ci;
+    int n;
+    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */
+    ci = inc_ci(L);  /* now `enter' new function */
+    ci->func = restorestack(L, funcr);
+    L->base = ci->base = ci->func + 1;
+    ci->top = L->top + LUA_MINSTACK;
+    lua_assert(ci->top <= L->stack_last);
+    ci->nresults = nresults;
+    if (L->hookmask & LUA_MASKCALL)
+      luaD_callhook(L, LUA_HOOKCALL, -1);
+    lua_unlock(L);
+    n = (*curr_func(L)->c.f)(L);  /* do the actual call */
+    lua_lock(L);
+    if (n < 0)  /* yielding? */
+      return PCRYIELD;
+    else {
+      luaD_poscall(L, L->top - n);
+      return PCRC;
+    }
+  }
+}
+
+
+static StkId callrethooks (lua_State *L, StkId firstResult) {
+  ptrdiff_t fr = savestack(L, firstResult);  /* next call may change stack */
+  luaD_callhook(L, LUA_HOOKRET, -1);
+  if (f_isLua(L->ci)) {  /* Lua function? */
+    while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */
+      luaD_callhook(L, LUA_HOOKTAILRET, -1);
+  }
+  return restorestack(L, fr);
+}
+
+
+int luaD_poscall (lua_State *L, StkId firstResult) {
+  StkId res;
+  int wanted, i;
+  CallInfo *ci;
+  if (L->hookmask & LUA_MASKRET)
+    firstResult = callrethooks(L, firstResult);
+  ci = L->ci--;
+  res = ci->func;  /* res == final position of 1st result */
+  wanted = ci->nresults;
+  L->base = (ci - 1)->base;  /* restore base */
+  L->savedpc = (ci - 1)->savedpc;  /* restore savedpc */
+  /* move results to correct place */
+  for (i = wanted; i != 0 && firstResult < L->top; i--)
+    setobjs2s(L, res++, firstResult++);
+  while (i-- > 0)
+    setnilvalue(res++);
+  L->top = res;
+  return (wanted - LUA_MULTRET);  /* 0 iff wanted == LUA_MULTRET */
+}
+
+
+/*
+** Call a function (C or Lua). The function to be called is at *func.
+** The arguments are on the stack, right after the function.
+** When returns, all the results are on the stack, starting at the original
+** function position.
+*/ 
+void luaD_call (lua_State *L, StkId func, int nResults) {
+  if (++L->nCcalls >= LUAI_MAXCCALLS) {
+    if (L->nCcalls == LUAI_MAXCCALLS)
+      luaG_runerror(L, "C stack overflow");
+    else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3)))
+      luaD_throw(L, LUA_ERRERR);  /* error while handing stack error */
+  }
+  if (luaD_precall(L, func, nResults) == PCRLUA)  /* is a Lua function? */
+    luaV_execute(L, 1);  /* call it */
+  L->nCcalls--;
+  luaC_checkGC(L);
+}
+
+
+static void resume (lua_State *L, void *ud) {
+  StkId firstArg = cast(StkId, ud);
+  CallInfo *ci = L->ci;
+  if (L->status == 0) {  /* start coroutine? */
+    lua_assert(ci == L->base_ci && firstArg > L->base);
+    if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA)
+      return;
+  }
+  else {  /* resuming from previous yield */
+    lua_assert(L->status == LUA_YIELD);
+    L->status = 0;
+    if (!f_isLua(ci)) {  /* `common' yield? */
+      /* finish interrupted execution of `OP_CALL' */
+      lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL ||
+                 GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL);
+      if (luaD_poscall(L, firstArg))  /* complete it... */
+        L->top = L->ci->top;  /* and correct top if not multiple results */
+    }
+    else  /* yielded inside a hook: just continue its execution */
+      L->base = L->ci->base;
+  }
+  luaV_execute(L, cast_int(L->ci - L->base_ci));
+}
+
+
+static int resume_error (lua_State *L, const char *msg) {
+  L->top = L->ci->base;
+  setsvalue2s(L, L->top, luaS_new(L, msg));
+  incr_top(L);
+  lua_unlock(L);
+  return LUA_ERRRUN;
+}
+
+
+LUA_API int lua_resume (lua_State *L, int nargs) {
+  int status;
+  lua_lock(L);
+  if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci))
+      return resume_error(L, "cannot resume non-suspended coroutine");
+  if (L->nCcalls >= LUAI_MAXCCALLS)
+    return resume_error(L, "C stack overflow");
+  luai_userstateresume(L, nargs);
+  lua_assert(L->errfunc == 0);
+  L->baseCcalls = ++L->nCcalls;
+  status = luaD_rawrunprotected(L, resume, L->top - nargs);
+  if (status != 0) {  /* error? */
+    L->status = cast_byte(status);  /* mark thread as `dead' */
+    luaD_seterrorobj(L, status, L->top);
+    L->ci->top = L->top;
+  }
+  else {
+    lua_assert(L->nCcalls == L->baseCcalls);
+    status = L->status;
+  }
+  --L->nCcalls;
+  lua_unlock(L);
+  return status;
+}
+
+
+LUA_API int lua_yield (lua_State *L, int nresults) {
+  luai_userstateyield(L, nresults);
+  lua_lock(L);
+  if (L->nCcalls > L->baseCcalls)
+    luaG_runerror(L, "attempt to yield across metamethod/C-call boundary");
+  L->base = L->top - nresults;  /* protect stack slots below */
+  L->status = LUA_YIELD;
+  lua_unlock(L);
+  return -1;
+}
+
+
+int luaD_pcall (lua_State *L, Pfunc func, void *u,
+                ptrdiff_t old_top, ptrdiff_t ef) {
+  int status;
+  unsigned short oldnCcalls = L->nCcalls;
+  ptrdiff_t old_ci = saveci(L, L->ci);
+  lu_byte old_allowhooks = L->allowhook;
+  ptrdiff_t old_errfunc = L->errfunc;
+  L->errfunc = ef;
+  status = luaD_rawrunprotected(L, func, u);
+  if (status != 0) {  /* an error occurred? */
+    StkId oldtop = restorestack(L, old_top);
+    luaF_close(L, oldtop);  /* close eventual pending closures */
+    luaD_seterrorobj(L, status, oldtop);
+    L->nCcalls = oldnCcalls;
+    L->ci = restoreci(L, old_ci);
+    L->base = L->ci->base;
+    L->savedpc = L->ci->savedpc;
+    L->allowhook = old_allowhooks;
+    restore_stack_limit(L);
+  }
+  L->errfunc = old_errfunc;
+  return status;
+}
+
+
+
+/*
+** Execute a protected parser.
+*/
+struct SParser {  /* data to `f_parser' */
+  ZIO *z;
+  Mbuffer buff;  /* buffer to be used by the scanner */
+  const char *name;
+};
+
+static void f_parser (lua_State *L, void *ud) {
+  int i;
+  Proto *tf;
+  Closure *cl;
+  struct SParser *p = cast(struct SParser *, ud);
+  luaZ_lookahead(p->z);
+  luaC_checkGC(L);
+  tf = (luaY_parser)(L, p->z,
+                                                             &p->buff, p->name);
+  cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L)));
+  cl->l.p = tf;
+  for (i = 0; i < tf->nups; i++)  /* initialize eventual upvalues */
+    cl->l.upvals[i] = luaF_newupval(L);
+  setclvalue(L, L->top, cl);
+  incr_top(L);
+}
+
+
+int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) {
+  struct SParser p;
+  int status;
+  p.z = z; p.name = name;
+  luaZ_initbuffer(L, &p.buff);
+  status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc);
+  luaZ_freebuffer(L, &p.buff);
+  return status;
+}
+
+
diff --git a/redis-stable/deps/lua/src/ldo.h b/redis-stable/deps/lua/src/ldo.h
new file mode 100644
index 00000000..98fddac5
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldo.h
@@ -0,0 +1,57 @@
+/*
+** $Id: ldo.h,v 2.7.1.1 2007/12/27 13:02:25 roberto Exp $
+** Stack and Call structure of Lua
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ldo_h
+#define ldo_h
+
+
+#include "lobject.h"
+#include "lstate.h"
+#include "lzio.h"
+
+
+#define luaD_checkstack(L,n)	\
+  if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TValue)) \
+    luaD_growstack(L, n); \
+  else condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1));
+
+
+#define incr_top(L) {luaD_checkstack(L,1); L->top++;}
+
+#define savestack(L,p)		((char *)(p) - (char *)L->stack)
+#define restorestack(L,n)	((TValue *)((char *)L->stack + (n)))
+
+#define saveci(L,p)		((char *)(p) - (char *)L->base_ci)
+#define restoreci(L,n)		((CallInfo *)((char *)L->base_ci + (n)))
+
+
+/* results from luaD_precall */
+#define PCRLUA		0	/* initiated a call to a Lua function */
+#define PCRC		1	/* did a call to a C function */
+#define PCRYIELD	2	/* C funtion yielded */
+
+
+/* type of protected functions, to be ran by `runprotected' */
+typedef void (*Pfunc) (lua_State *L, void *ud);
+
+LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name);
+LUAI_FUNC void luaD_callhook (lua_State *L, int event, int line);
+LUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults);
+LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults);
+LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u,
+                                        ptrdiff_t oldtop, ptrdiff_t ef);
+LUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult);
+LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize);
+LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize);
+LUAI_FUNC void luaD_growstack (lua_State *L, int n);
+
+LUAI_FUNC void luaD_throw (lua_State *L, int errcode);
+LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud);
+
+LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop);
+
+#endif
+
diff --git a/redis-stable/deps/lua/src/ldump.c b/redis-stable/deps/lua/src/ldump.c
new file mode 100644
index 00000000..c9d3d487
--- /dev/null
+++ b/redis-stable/deps/lua/src/ldump.c
@@ -0,0 +1,164 @@
+/*
+** $Id: ldump.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** save precompiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#include <stddef.h>
+
+#define ldump_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "lundump.h"
+
+typedef struct {
+ lua_State* L;
+ lua_Writer writer;
+ void* data;
+ int strip;
+ int status;
+} DumpState;
+
+#define DumpMem(b,n,size,D)	DumpBlock(b,(n)*(size),D)
+#define DumpVar(x,D)	 	DumpMem(&x,1,sizeof(x),D)
+
+static void DumpBlock(const void* b, size_t size, DumpState* D)
+{
+ if (D->status==0)
+ {
+  lua_unlock(D->L);
+  D->status=(*D->writer)(D->L,b,size,D->data);
+  lua_lock(D->L);
+ }
+}
+
+static void DumpChar(int y, DumpState* D)
+{
+ char x=(char)y;
+ DumpVar(x,D);
+}
+
+static void DumpInt(int x, DumpState* D)
+{
+ DumpVar(x,D);
+}
+
+static void DumpNumber(lua_Number x, DumpState* D)
+{
+ DumpVar(x,D);
+}
+
+static void DumpVector(const void* b, int n, size_t size, DumpState* D)
+{
+ DumpInt(n,D);
+ DumpMem(b,n,size,D);
+}
+
+static void DumpString(const TString* s, DumpState* D)
+{
+ if (s==NULL || getstr(s)==NULL)
+ {
+  size_t size=0;
+  DumpVar(size,D);
+ }
+ else
+ {
+  size_t size=s->tsv.len+1;		/* include trailing '\0' */
+  DumpVar(size,D);
+  DumpBlock(getstr(s),size,D);
+ }
+}
+
+#define DumpCode(f,D)	 DumpVector(f->code,f->sizecode,sizeof(Instruction),D)
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D);
+
+static void DumpConstants(const Proto* f, DumpState* D)
+{
+ int i,n=f->sizek;
+ DumpInt(n,D);
+ for (i=0; i<n; i++)
+ {
+  const TValue* o=&f->k[i];
+  DumpChar(ttype(o),D);
+  switch (ttype(o))
+  {
+   case LUA_TNIL:
+	break;
+   case LUA_TBOOLEAN:
+	DumpChar(bvalue(o),D);
+	break;
+   case LUA_TNUMBER:
+	DumpNumber(nvalue(o),D);
+	break;
+   case LUA_TSTRING:
+	DumpString(rawtsvalue(o),D);
+	break;
+   default:
+	lua_assert(0);			/* cannot happen */
+	break;
+  }
+ }
+ n=f->sizep;
+ DumpInt(n,D);
+ for (i=0; i<n; i++) DumpFunction(f->p[i],f->source,D);
+}
+
+static void DumpDebug(const Proto* f, DumpState* D)
+{
+ int i,n;
+ n= (D->strip) ? 0 : f->sizelineinfo;
+ DumpVector(f->lineinfo,n,sizeof(int),D);
+ n= (D->strip) ? 0 : f->sizelocvars;
+ DumpInt(n,D);
+ for (i=0; i<n; i++)
+ {
+  DumpString(f->locvars[i].varname,D);
+  DumpInt(f->locvars[i].startpc,D);
+  DumpInt(f->locvars[i].endpc,D);
+ }
+ n= (D->strip) ? 0 : f->sizeupvalues;
+ DumpInt(n,D);
+ for (i=0; i<n; i++) DumpString(f->upvalues[i],D);
+}
+
+static void DumpFunction(const Proto* f, const TString* p, DumpState* D)
+{
+ DumpString((f->source==p || D->strip) ? NULL : f->source,D);
+ DumpInt(f->linedefined,D);
+ DumpInt(f->lastlinedefined,D);
+ DumpChar(f->nups,D);
+ DumpChar(f->numparams,D);
+ DumpChar(f->is_vararg,D);
+ DumpChar(f->maxstacksize,D);
+ DumpCode(f,D);
+ DumpConstants(f,D);
+ DumpDebug(f,D);
+}
+
+static void DumpHeader(DumpState* D)
+{
+ char h[LUAC_HEADERSIZE];
+ luaU_header(h);
+ DumpBlock(h,LUAC_HEADERSIZE,D);
+}
+
+/*
+** dump Lua function as precompiled chunk
+*/
+int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip)
+{
+ DumpState D;
+ D.L=L;
+ D.writer=w;
+ D.data=data;
+ D.strip=strip;
+ D.status=0;
+ DumpHeader(&D);
+ DumpFunction(f,NULL,&D);
+ return D.status;
+}
diff --git a/redis-stable/deps/lua/src/lfunc.c b/redis-stable/deps/lua/src/lfunc.c
new file mode 100644
index 00000000..813e88f5
--- /dev/null
+++ b/redis-stable/deps/lua/src/lfunc.c
@@ -0,0 +1,174 @@
+/*
+** $Id: lfunc.c,v 2.12.1.2 2007/12/28 14:58:43 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lfunc_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+
+Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {
+  Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
+  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
+  c->c.isC = 1;
+  c->c.env = e;
+  c->c.nupvalues = cast_byte(nelems);
+  return c;
+}
+
+
+Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {
+  Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
+  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
+  c->l.isC = 0;
+  c->l.env = e;
+  c->l.nupvalues = cast_byte(nelems);
+  while (nelems--) c->l.upvals[nelems] = NULL;
+  return c;
+}
+
+
+UpVal *luaF_newupval (lua_State *L) {
+  UpVal *uv = luaM_new(L, UpVal);
+  luaC_link(L, obj2gco(uv), LUA_TUPVAL);
+  uv->v = &uv->u.value;
+  setnilvalue(uv->v);
+  return uv;
+}
+
+
+UpVal *luaF_findupval (lua_State *L, StkId level) {
+  global_State *g = G(L);
+  GCObject **pp = &L->openupval;
+  UpVal *p;
+  UpVal *uv;
+  while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) {
+    lua_assert(p->v != &p->u.value);
+    if (p->v == level) {  /* found a corresponding upvalue? */
+      if (isdead(g, obj2gco(p)))  /* is it dead? */
+        changewhite(obj2gco(p));  /* ressurect it */
+      return p;
+    }
+    pp = &p->next;
+  }
+  uv = luaM_new(L, UpVal);  /* not found: create a new one */
+  uv->tt = LUA_TUPVAL;
+  uv->marked = luaC_white(g);
+  uv->v = level;  /* current value lives in the stack */
+  uv->next = *pp;  /* chain it in the proper position */
+  *pp = obj2gco(uv);
+  uv->u.l.prev = &g->uvhead;  /* double link it in `uvhead' list */
+  uv->u.l.next = g->uvhead.u.l.next;
+  uv->u.l.next->u.l.prev = uv;
+  g->uvhead.u.l.next = uv;
+  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+  return uv;
+}
+
+
+static void unlinkupval (UpVal *uv) {
+  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+  uv->u.l.next->u.l.prev = uv->u.l.prev;  /* remove from `uvhead' list */
+  uv->u.l.prev->u.l.next = uv->u.l.next;
+}
+
+
+void luaF_freeupval (lua_State *L, UpVal *uv) {
+  if (uv->v != &uv->u.value)  /* is it open? */
+    unlinkupval(uv);  /* remove from open list */
+  luaM_free(L, uv);  /* free upvalue */
+}
+
+
+void luaF_close (lua_State *L, StkId level) {
+  UpVal *uv;
+  global_State *g = G(L);
+  while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) {
+    GCObject *o = obj2gco(uv);
+    lua_assert(!isblack(o) && uv->v != &uv->u.value);
+    L->openupval = uv->next;  /* remove from `open' list */
+    if (isdead(g, o))
+      luaF_freeupval(L, uv);  /* free upvalue */
+    else {
+      unlinkupval(uv);
+      setobj(L, &uv->u.value, uv->v);
+      uv->v = &uv->u.value;  /* now current value lives here */
+      luaC_linkupval(L, uv);  /* link upvalue into `gcroot' list */
+    }
+  }
+}
+
+
+Proto *luaF_newproto (lua_State *L) {
+  Proto *f = luaM_new(L, Proto);
+  luaC_link(L, obj2gco(f), LUA_TPROTO);
+  f->k = NULL;
+  f->sizek = 0;
+  f->p = NULL;
+  f->sizep = 0;
+  f->code = NULL;
+  f->sizecode = 0;
+  f->sizelineinfo = 0;
+  f->sizeupvalues = 0;
+  f->nups = 0;
+  f->upvalues = NULL;
+  f->numparams = 0;
+  f->is_vararg = 0;
+  f->maxstacksize = 0;
+  f->lineinfo = NULL;
+  f->sizelocvars = 0;
+  f->locvars = NULL;
+  f->linedefined = 0;
+  f->lastlinedefined = 0;
+  f->source = NULL;
+  return f;
+}
+
+
+void luaF_freeproto (lua_State *L, Proto *f) {
+  luaM_freearray(L, f->code, f->sizecode, Instruction);
+  luaM_freearray(L, f->p, f->sizep, Proto *);
+  luaM_freearray(L, f->k, f->sizek, TValue);
+  luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
+  luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
+  luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
+  luaM_free(L, f);
+}
+
+
+void luaF_freeclosure (lua_State *L, Closure *c) {
+  int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
+                          sizeLclosure(c->l.nupvalues);
+  luaM_freemem(L, c, size);
+}
+
+
+/*
+** Look for n-th local variable at line `line' in function `func'.
+** Returns NULL if not found.
+*/
+const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
+  int i;
+  for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
+    if (pc < f->locvars[i].endpc) {  /* is variable active? */
+      local_number--;
+      if (local_number == 0)
+        return getstr(f->locvars[i].varname);
+    }
+  }
+  return NULL;  /* not found */
+}
+
diff --git a/redis-stable/deps/lua/src/lfunc.h b/redis-stable/deps/lua/src/lfunc.h
new file mode 100644
index 00000000..a68cf515
--- /dev/null
+++ b/redis-stable/deps/lua/src/lfunc.h
@@ -0,0 +1,34 @@
+/*
+** $Id: lfunc.h,v 2.4.1.1 2007/12/27 13:02:25 roberto Exp $
+** Auxiliary functions to manipulate prototypes and closures
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lfunc_h
+#define lfunc_h
+
+
+#include "lobject.h"
+
+
+#define sizeCclosure(n)	(cast(int, sizeof(CClosure)) + \
+                         cast(int, sizeof(TValue)*((n)-1)))
+
+#define sizeLclosure(n)	(cast(int, sizeof(LClosure)) + \
+                         cast(int, sizeof(TValue *)*((n)-1)))
+
+
+LUAI_FUNC Proto *luaF_newproto (lua_State *L);
+LUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e);
+LUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e);
+LUAI_FUNC UpVal *luaF_newupval (lua_State *L);
+LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level);
+LUAI_FUNC void luaF_close (lua_State *L, StkId level);
+LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f);
+LUAI_FUNC void luaF_freeclosure (lua_State *L, Closure *c);
+LUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv);
+LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number,
+                                         int pc);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/lgc.c b/redis-stable/deps/lua/src/lgc.c
new file mode 100644
index 00000000..e909c79a
--- /dev/null
+++ b/redis-stable/deps/lua/src/lgc.c
@@ -0,0 +1,710 @@
+/*
+** $Id: lgc.c,v 2.38.1.2 2011/03/18 18:05:38 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#include <string.h>
+
+#define lgc_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+#define GCSTEPSIZE	1024u
+#define GCSWEEPMAX	40
+#define GCSWEEPCOST	10
+#define GCFINALIZECOST	100
+
+
+#define maskmarks	cast_byte(~(bitmask(BLACKBIT)|WHITEBITS))
+
+#define makewhite(g,x)	\
+   ((x)->gch.marked = cast_byte(((x)->gch.marked & maskmarks) | luaC_white(g)))
+
+#define white2gray(x)	reset2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
+#define black2gray(x)	resetbit((x)->gch.marked, BLACKBIT)
+
+#define stringmark(s)	reset2bits((s)->tsv.marked, WHITE0BIT, WHITE1BIT)
+
+
+#define isfinalized(u)		testbit((u)->marked, FINALIZEDBIT)
+#define markfinalized(u)	l_setbit((u)->marked, FINALIZEDBIT)
+
+
+#define KEYWEAK         bitmask(KEYWEAKBIT)
+#define VALUEWEAK       bitmask(VALUEWEAKBIT)
+
+
+
+#define markvalue(g,o) { checkconsistency(o); \
+  if (iscollectable(o) && iswhite(gcvalue(o))) reallymarkobject(g,gcvalue(o)); }
+
+#define markobject(g,t) { if (iswhite(obj2gco(t))) \
+		reallymarkobject(g, obj2gco(t)); }
+
+
+#define setthreshold(g)  (g->GCthreshold = (g->estimate/100) * g->gcpause)
+
+
+static void removeentry (Node *n) {
+  lua_assert(ttisnil(gval(n)));
+  if (iscollectable(gkey(n)))
+    setttype(gkey(n), LUA_TDEADKEY);  /* dead key; remove it */
+}
+
+
+static void reallymarkobject (global_State *g, GCObject *o) {
+  lua_assert(iswhite(o) && !isdead(g, o));
+  white2gray(o);
+  switch (o->gch.tt) {
+    case LUA_TSTRING: {
+      return;
+    }
+    case LUA_TUSERDATA: {
+      Table *mt = gco2u(o)->metatable;
+      gray2black(o);  /* udata are never gray */
+      if (mt) markobject(g, mt);
+      markobject(g, gco2u(o)->env);
+      return;
+    }
+    case LUA_TUPVAL: {
+      UpVal *uv = gco2uv(o);
+      markvalue(g, uv->v);
+      if (uv->v == &uv->u.value)  /* closed? */
+        gray2black(o);  /* open upvalues are never black */
+      return;
+    }
+    case LUA_TFUNCTION: {
+      gco2cl(o)->c.gclist = g->gray;
+      g->gray = o;
+      break;
+    }
+    case LUA_TTABLE: {
+      gco2h(o)->gclist = g->gray;
+      g->gray = o;
+      break;
+    }
+    case LUA_TTHREAD: {
+      gco2th(o)->gclist = g->gray;
+      g->gray = o;
+      break;
+    }
+    case LUA_TPROTO: {
+      gco2p(o)->gclist = g->gray;
+      g->gray = o;
+      break;
+    }
+    default: lua_assert(0);
+  }
+}
+
+
+static void marktmu (global_State *g) {
+  GCObject *u = g->tmudata;
+  if (u) {
+    do {
+      u = u->gch.next;
+      makewhite(g, u);  /* may be marked, if left from previous GC */
+      reallymarkobject(g, u);
+    } while (u != g->tmudata);
+  }
+}
+
+
+/* move `dead' udata that need finalization to list `tmudata' */
+size_t luaC_separateudata (lua_State *L, int all) {
+  global_State *g = G(L);
+  size_t deadmem = 0;
+  GCObject **p = &g->mainthread->next;
+  GCObject *curr;
+  while ((curr = *p) != NULL) {
+    if (!(iswhite(curr) || all) || isfinalized(gco2u(curr)))
+      p = &curr->gch.next;  /* don't bother with them */
+    else if (fasttm(L, gco2u(curr)->metatable, TM_GC) == NULL) {
+      markfinalized(gco2u(curr));  /* don't need finalization */
+      p = &curr->gch.next;
+    }
+    else {  /* must call its gc method */
+      deadmem += sizeudata(gco2u(curr));
+      markfinalized(gco2u(curr));
+      *p = curr->gch.next;
+      /* link `curr' at the end of `tmudata' list */
+      if (g->tmudata == NULL)  /* list is empty? */
+        g->tmudata = curr->gch.next = curr;  /* creates a circular list */
+      else {
+        curr->gch.next = g->tmudata->gch.next;
+        g->tmudata->gch.next = curr;
+        g->tmudata = curr;
+      }
+    }
+  }
+  return deadmem;
+}
+
+
+static int traversetable (global_State *g, Table *h) {
+  int i;
+  int weakkey = 0;
+  int weakvalue = 0;
+  const TValue *mode;
+  if (h->metatable)
+    markobject(g, h->metatable);
+  mode = gfasttm(g, h->metatable, TM_MODE);
+  if (mode && ttisstring(mode)) {  /* is there a weak mode? */
+    weakkey = (strchr(svalue(mode), 'k') != NULL);
+    weakvalue = (strchr(svalue(mode), 'v') != NULL);
+    if (weakkey || weakvalue) {  /* is really weak? */
+      h->marked &= ~(KEYWEAK | VALUEWEAK);  /* clear bits */
+      h->marked |= cast_byte((weakkey << KEYWEAKBIT) |
+                             (weakvalue << VALUEWEAKBIT));
+      h->gclist = g->weak;  /* must be cleared after GC, ... */
+      g->weak = obj2gco(h);  /* ... so put in the appropriate list */
+    }
+  }
+  if (weakkey && weakvalue) return 1;
+  if (!weakvalue) {
+    i = h->sizearray;
+    while (i--)
+      markvalue(g, &h->array[i]);
+  }
+  i = sizenode(h);
+  while (i--) {
+    Node *n = gnode(h, i);
+    lua_assert(ttype(gkey(n)) != LUA_TDEADKEY || ttisnil(gval(n)));
+    if (ttisnil(gval(n)))
+      removeentry(n);  /* remove empty entries */
+    else {
+      lua_assert(!ttisnil(gkey(n)));
+      if (!weakkey) markvalue(g, gkey(n));
+      if (!weakvalue) markvalue(g, gval(n));
+    }
+  }
+  return weakkey || weakvalue;
+}
+
+
+/*
+** All marks are conditional because a GC may happen while the
+** prototype is still being created
+*/
+static void traverseproto (global_State *g, Proto *f) {
+  int i;
+  if (f->source) stringmark(f->source);
+  for (i=0; i<f->sizek; i++)  /* mark literals */
+    markvalue(g, &f->k[i]);
+  for (i=0; i<f->sizeupvalues; i++) {  /* mark upvalue names */
+    if (f->upvalues[i])
+      stringmark(f->upvalues[i]);
+  }
+  for (i=0; i<f->sizep; i++) {  /* mark nested protos */
+    if (f->p[i])
+      markobject(g, f->p[i]);
+  }
+  for (i=0; i<f->sizelocvars; i++) {  /* mark local-variable names */
+    if (f->locvars[i].varname)
+      stringmark(f->locvars[i].varname);
+  }
+}
+
+
+
+static void traverseclosure (global_State *g, Closure *cl) {
+  markobject(g, cl->c.env);
+  if (cl->c.isC) {
+    int i;
+    for (i=0; i<cl->c.nupvalues; i++)  /* mark its upvalues */
+      markvalue(g, &cl->c.upvalue[i]);
+  }
+  else {
+    int i;
+    lua_assert(cl->l.nupvalues == cl->l.p->nups);
+    markobject(g, cl->l.p);
+    for (i=0; i<cl->l.nupvalues; i++)  /* mark its upvalues */
+      markobject(g, cl->l.upvals[i]);
+  }
+}
+
+
+static void checkstacksizes (lua_State *L, StkId max) {
+  int ci_used = cast_int(L->ci - L->base_ci);  /* number of `ci' in use */
+  int s_used = cast_int(max - L->stack);  /* part of stack in use */
+  if (L->size_ci > LUAI_MAXCALLS)  /* handling overflow? */
+    return;  /* do not touch the stacks */
+  if (4*ci_used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci)
+    luaD_reallocCI(L, L->size_ci/2);  /* still big enough... */
+  condhardstacktests(luaD_reallocCI(L, ci_used + 1));
+  if (4*s_used < L->stacksize &&
+      2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize)
+    luaD_reallocstack(L, L->stacksize/2);  /* still big enough... */
+  condhardstacktests(luaD_reallocstack(L, s_used));
+}
+
+
+static void traversestack (global_State *g, lua_State *l) {
+  StkId o, lim;
+  CallInfo *ci;
+  markvalue(g, gt(l));
+  lim = l->top;
+  for (ci = l->base_ci; ci <= l->ci; ci++) {
+    lua_assert(ci->top <= l->stack_last);
+    if (lim < ci->top) lim = ci->top;
+  }
+  for (o = l->stack; o < l->top; o++)
+    markvalue(g, o);
+  for (; o <= lim; o++)
+    setnilvalue(o);
+  checkstacksizes(l, lim);
+}
+
+
+/*
+** traverse one gray object, turning it to black.
+** Returns `quantity' traversed.
+*/
+static l_mem propagatemark (global_State *g) {
+  GCObject *o = g->gray;
+  lua_assert(isgray(o));
+  gray2black(o);
+  switch (o->gch.tt) {
+    case LUA_TTABLE: {
+      Table *h = gco2h(o);
+      g->gray = h->gclist;
+      if (traversetable(g, h))  /* table is weak? */
+        black2gray(o);  /* keep it gray */
+      return sizeof(Table) + sizeof(TValue) * h->sizearray +
+                             sizeof(Node) * sizenode(h);
+    }
+    case LUA_TFUNCTION: {
+      Closure *cl = gco2cl(o);
+      g->gray = cl->c.gclist;
+      traverseclosure(g, cl);
+      return (cl->c.isC) ? sizeCclosure(cl->c.nupvalues) :
+                           sizeLclosure(cl->l.nupvalues);
+    }
+    case LUA_TTHREAD: {
+      lua_State *th = gco2th(o);
+      g->gray = th->gclist;
+      th->gclist = g->grayagain;
+      g->grayagain = o;
+      black2gray(o);
+      traversestack(g, th);
+      return sizeof(lua_State) + sizeof(TValue) * th->stacksize +
+                                 sizeof(CallInfo) * th->size_ci;
+    }
+    case LUA_TPROTO: {
+      Proto *p = gco2p(o);
+      g->gray = p->gclist;
+      traverseproto(g, p);
+      return sizeof(Proto) + sizeof(Instruction) * p->sizecode +
+                             sizeof(Proto *) * p->sizep +
+                             sizeof(TValue) * p->sizek + 
+                             sizeof(int) * p->sizelineinfo +
+                             sizeof(LocVar) * p->sizelocvars +
+                             sizeof(TString *) * p->sizeupvalues;
+    }
+    default: lua_assert(0); return 0;
+  }
+}
+
+
+static size_t propagateall (global_State *g) {
+  size_t m = 0;
+  while (g->gray) m += propagatemark(g);
+  return m;
+}
+
+
+/*
+** The next function tells whether a key or value can be cleared from
+** a weak table. Non-collectable objects are never removed from weak
+** tables. Strings behave as `values', so are never removed too. for
+** other objects: if really collected, cannot keep them; for userdata
+** being finalized, keep them in keys, but not in values
+*/
+static int iscleared (const TValue *o, int iskey) {
+  if (!iscollectable(o)) return 0;
+  if (ttisstring(o)) {
+    stringmark(rawtsvalue(o));  /* strings are `values', so are never weak */
+    return 0;
+  }
+  return iswhite(gcvalue(o)) ||
+    (ttisuserdata(o) && (!iskey && isfinalized(uvalue(o))));
+}
+
+
+/*
+** clear collected entries from weaktables
+*/
+static void cleartable (GCObject *l) {
+  while (l) {
+    Table *h = gco2h(l);
+    int i = h->sizearray;
+    lua_assert(testbit(h->marked, VALUEWEAKBIT) ||
+               testbit(h->marked, KEYWEAKBIT));
+    if (testbit(h->marked, VALUEWEAKBIT)) {
+      while (i--) {
+        TValue *o = &h->array[i];
+        if (iscleared(o, 0))  /* value was collected? */
+          setnilvalue(o);  /* remove value */
+      }
+    }
+    i = sizenode(h);
+    while (i--) {
+      Node *n = gnode(h, i);
+      if (!ttisnil(gval(n)) &&  /* non-empty entry? */
+          (iscleared(key2tval(n), 1) || iscleared(gval(n), 0))) {
+        setnilvalue(gval(n));  /* remove value ... */
+        removeentry(n);  /* remove entry from table */
+      }
+    }
+    l = h->gclist;
+  }
+}
+
+
+static void freeobj (lua_State *L, GCObject *o) {
+  switch (o->gch.tt) {
+    case LUA_TPROTO: luaF_freeproto(L, gco2p(o)); break;
+    case LUA_TFUNCTION: luaF_freeclosure(L, gco2cl(o)); break;
+    case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break;
+    case LUA_TTABLE: luaH_free(L, gco2h(o)); break;
+    case LUA_TTHREAD: {
+      lua_assert(gco2th(o) != L && gco2th(o) != G(L)->mainthread);
+      luaE_freethread(L, gco2th(o));
+      break;
+    }
+    case LUA_TSTRING: {
+      G(L)->strt.nuse--;
+      luaM_freemem(L, o, sizestring(gco2ts(o)));
+      break;
+    }
+    case LUA_TUSERDATA: {
+      luaM_freemem(L, o, sizeudata(gco2u(o)));
+      break;
+    }
+    default: lua_assert(0);
+  }
+}
+
+
+
+#define sweepwholelist(L,p)	sweeplist(L,p,MAX_LUMEM)
+
+
+static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) {
+  GCObject *curr;
+  global_State *g = G(L);
+  int deadmask = otherwhite(g);
+  while ((curr = *p) != NULL && count-- > 0) {
+    if (curr->gch.tt == LUA_TTHREAD)  /* sweep open upvalues of each thread */
+      sweepwholelist(L, &gco2th(curr)->openupval);
+    if ((curr->gch.marked ^ WHITEBITS) & deadmask) {  /* not dead? */
+      lua_assert(!isdead(g, curr) || testbit(curr->gch.marked, FIXEDBIT));
+      makewhite(g, curr);  /* make it white (for next cycle) */
+      p = &curr->gch.next;
+    }
+    else {  /* must erase `curr' */
+      lua_assert(isdead(g, curr) || deadmask == bitmask(SFIXEDBIT));
+      *p = curr->gch.next;
+      if (curr == g->rootgc)  /* is the first element of the list? */
+        g->rootgc = curr->gch.next;  /* adjust first */
+      freeobj(L, curr);
+    }
+  }
+  return p;
+}
+
+
+static void checkSizes (lua_State *L) {
+  global_State *g = G(L);
+  /* check size of string hash */
+  if (g->strt.nuse < cast(lu_int32, g->strt.size/4) &&
+      g->strt.size > MINSTRTABSIZE*2)
+    luaS_resize(L, g->strt.size/2);  /* table is too big */
+  /* check size of buffer */
+  if (luaZ_sizebuffer(&g->buff) > LUA_MINBUFFER*2) {  /* buffer too big? */
+    size_t newsize = luaZ_sizebuffer(&g->buff) / 2;
+    luaZ_resizebuffer(L, &g->buff, newsize);
+  }
+}
+
+
+static void GCTM (lua_State *L) {
+  global_State *g = G(L);
+  GCObject *o = g->tmudata->gch.next;  /* get first element */
+  Udata *udata = rawgco2u(o);
+  const TValue *tm;
+  /* remove udata from `tmudata' */
+  if (o == g->tmudata)  /* last element? */
+    g->tmudata = NULL;
+  else
+    g->tmudata->gch.next = udata->uv.next;
+  udata->uv.next = g->mainthread->next;  /* return it to `root' list */
+  g->mainthread->next = o;
+  makewhite(g, o);
+  tm = fasttm(L, udata->uv.metatable, TM_GC);
+  if (tm != NULL) {
+    lu_byte oldah = L->allowhook;
+    lu_mem oldt = g->GCthreshold;
+    L->allowhook = 0;  /* stop debug hooks during GC tag method */
+    g->GCthreshold = 2*g->totalbytes;  /* avoid GC steps */
+    setobj2s(L, L->top, tm);
+    setuvalue(L, L->top+1, udata);
+    L->top += 2;
+    luaD_call(L, L->top - 2, 0);
+    L->allowhook = oldah;  /* restore hooks */
+    g->GCthreshold = oldt;  /* restore threshold */
+  }
+}
+
+
+/*
+** Call all GC tag methods
+*/
+void luaC_callGCTM (lua_State *L) {
+  while (G(L)->tmudata)
+    GCTM(L);
+}
+
+
+void luaC_freeall (lua_State *L) {
+  global_State *g = G(L);
+  int i;
+  g->currentwhite = WHITEBITS | bitmask(SFIXEDBIT);  /* mask to collect all elements */
+  sweepwholelist(L, &g->rootgc);
+  for (i = 0; i < g->strt.size; i++)  /* free all string lists */
+    sweepwholelist(L, &g->strt.hash[i]);
+}
+
+
+static void markmt (global_State *g) {
+  int i;
+  for (i=0; i<NUM_TAGS; i++)
+    if (g->mt[i]) markobject(g, g->mt[i]);
+}
+
+
+/* mark root set */
+static void markroot (lua_State *L) {
+  global_State *g = G(L);
+  g->gray = NULL;
+  g->grayagain = NULL;
+  g->weak = NULL;
+  markobject(g, g->mainthread);
+  /* make global table be traversed before main stack */
+  markvalue(g, gt(g->mainthread));
+  markvalue(g, registry(L));
+  markmt(g);
+  g->gcstate = GCSpropagate;
+}
+
+
+static void remarkupvals (global_State *g) {
+  UpVal *uv;
+  for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) {
+    lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
+    if (isgray(obj2gco(uv)))
+      markvalue(g, uv->v);
+  }
+}
+
+
+static void atomic (lua_State *L) {
+  global_State *g = G(L);
+  size_t udsize;  /* total size of userdata to be finalized */
+  /* remark occasional upvalues of (maybe) dead threads */
+  remarkupvals(g);
+  /* traverse objects cautch by write barrier and by 'remarkupvals' */
+  propagateall(g);
+  /* remark weak tables */
+  g->gray = g->weak;
+  g->weak = NULL;
+  lua_assert(!iswhite(obj2gco(g->mainthread)));
+  markobject(g, L);  /* mark running thread */
+  markmt(g);  /* mark basic metatables (again) */
+  propagateall(g);
+  /* remark gray again */
+  g->gray = g->grayagain;
+  g->grayagain = NULL;
+  propagateall(g);
+  udsize = luaC_separateudata(L, 0);  /* separate userdata to be finalized */
+  marktmu(g);  /* mark `preserved' userdata */
+  udsize += propagateall(g);  /* remark, to propagate `preserveness' */
+  cleartable(g->weak);  /* remove collected objects from weak tables */
+  /* flip current white */
+  g->currentwhite = cast_byte(otherwhite(g));
+  g->sweepstrgc = 0;
+  g->sweepgc = &g->rootgc;
+  g->gcstate = GCSsweepstring;
+  g->estimate = g->totalbytes - udsize;  /* first estimate */
+}
+
+
+static l_mem singlestep (lua_State *L) {
+  global_State *g = G(L);
+  /*lua_checkmemory(L);*/
+  switch (g->gcstate) {
+    case GCSpause: {
+      markroot(L);  /* start a new collection */
+      return 0;
+    }
+    case GCSpropagate: {
+      if (g->gray)
+        return propagatemark(g);
+      else {  /* no more `gray' objects */
+        atomic(L);  /* finish mark phase */
+        return 0;
+      }
+    }
+    case GCSsweepstring: {
+      lu_mem old = g->totalbytes;
+      sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]);
+      if (g->sweepstrgc >= g->strt.size)  /* nothing more to sweep? */
+        g->gcstate = GCSsweep;  /* end sweep-string phase */
+      lua_assert(old >= g->totalbytes);
+      g->estimate -= old - g->totalbytes;
+      return GCSWEEPCOST;
+    }
+    case GCSsweep: {
+      lu_mem old = g->totalbytes;
+      g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX);
+      if (*g->sweepgc == NULL) {  /* nothing more to sweep? */
+        checkSizes(L);
+        g->gcstate = GCSfinalize;  /* end sweep phase */
+      }
+      lua_assert(old >= g->totalbytes);
+      g->estimate -= old - g->totalbytes;
+      return GCSWEEPMAX*GCSWEEPCOST;
+    }
+    case GCSfinalize: {
+      if (g->tmudata) {
+        GCTM(L);
+        if (g->estimate > GCFINALIZECOST)
+          g->estimate -= GCFINALIZECOST;
+        return GCFINALIZECOST;
+      }
+      else {
+        g->gcstate = GCSpause;  /* end collection */
+        g->gcdept = 0;
+        return 0;
+      }
+    }
+    default: lua_assert(0); return 0;
+  }
+}
+
+
+void luaC_step (lua_State *L) {
+  global_State *g = G(L);
+  l_mem lim = (GCSTEPSIZE/100) * g->gcstepmul;
+  if (lim == 0)
+    lim = (MAX_LUMEM-1)/2;  /* no limit */
+  g->gcdept += g->totalbytes - g->GCthreshold;
+  do {
+    lim -= singlestep(L);
+    if (g->gcstate == GCSpause)
+      break;
+  } while (lim > 0);
+  if (g->gcstate != GCSpause) {
+    if (g->gcdept < GCSTEPSIZE)
+      g->GCthreshold = g->totalbytes + GCSTEPSIZE;  /* - lim/g->gcstepmul;*/
+    else {
+      g->gcdept -= GCSTEPSIZE;
+      g->GCthreshold = g->totalbytes;
+    }
+  }
+  else {
+    setthreshold(g);
+  }
+}
+
+
+void luaC_fullgc (lua_State *L) {
+  global_State *g = G(L);
+  if (g->gcstate <= GCSpropagate) {
+    /* reset sweep marks to sweep all elements (returning them to white) */
+    g->sweepstrgc = 0;
+    g->sweepgc = &g->rootgc;
+    /* reset other collector lists */
+    g->gray = NULL;
+    g->grayagain = NULL;
+    g->weak = NULL;
+    g->gcstate = GCSsweepstring;
+  }
+  lua_assert(g->gcstate != GCSpause && g->gcstate != GCSpropagate);
+  /* finish any pending sweep phase */
+  while (g->gcstate != GCSfinalize) {
+    lua_assert(g->gcstate == GCSsweepstring || g->gcstate == GCSsweep);
+    singlestep(L);
+  }
+  markroot(L);
+  while (g->gcstate != GCSpause) {
+    singlestep(L);
+  }
+  setthreshold(g);
+}
+
+
+void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v) {
+  global_State *g = G(L);
+  lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));
+  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+  lua_assert(ttype(&o->gch) != LUA_TTABLE);
+  /* must keep invariant? */
+  if (g->gcstate == GCSpropagate)
+    reallymarkobject(g, v);  /* restore invariant */
+  else  /* don't mind */
+    makewhite(g, o);  /* mark as white just to avoid other barriers */
+}
+
+
+void luaC_barrierback (lua_State *L, Table *t) {
+  global_State *g = G(L);
+  GCObject *o = obj2gco(t);
+  lua_assert(isblack(o) && !isdead(g, o));
+  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+  black2gray(o);  /* make table gray (again) */
+  t->gclist = g->grayagain;
+  g->grayagain = o;
+}
+
+
+void luaC_link (lua_State *L, GCObject *o, lu_byte tt) {
+  global_State *g = G(L);
+  o->gch.next = g->rootgc;
+  g->rootgc = o;
+  o->gch.marked = luaC_white(g);
+  o->gch.tt = tt;
+}
+
+
+void luaC_linkupval (lua_State *L, UpVal *uv) {
+  global_State *g = G(L);
+  GCObject *o = obj2gco(uv);
+  o->gch.next = g->rootgc;  /* link upvalue into `rootgc' list */
+  g->rootgc = o;
+  if (isgray(o)) { 
+    if (g->gcstate == GCSpropagate) {
+      gray2black(o);  /* closed upvalues need barrier */
+      luaC_barrier(L, uv, uv->v);
+    }
+    else {  /* sweep phase: sweep it (turning it into white) */
+      makewhite(g, o);
+      lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
+    }
+  }
+}
+
diff --git a/redis-stable/deps/lua/src/lgc.h b/redis-stable/deps/lua/src/lgc.h
new file mode 100644
index 00000000..5a8dc605
--- /dev/null
+++ b/redis-stable/deps/lua/src/lgc.h
@@ -0,0 +1,110 @@
+/*
+** $Id: lgc.h,v 2.15.1.1 2007/12/27 13:02:25 roberto Exp $
+** Garbage Collector
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lgc_h
+#define lgc_h
+
+
+#include "lobject.h"
+
+
+/*
+** Possible states of the Garbage Collector
+*/
+#define GCSpause	0
+#define GCSpropagate	1
+#define GCSsweepstring	2
+#define GCSsweep	3
+#define GCSfinalize	4
+
+
+/*
+** some userful bit tricks
+*/
+#define resetbits(x,m)	((x) &= cast(lu_byte, ~(m)))
+#define setbits(x,m)	((x) |= (m))
+#define testbits(x,m)	((x) & (m))
+#define bitmask(b)	(1<<(b))
+#define bit2mask(b1,b2)	(bitmask(b1) | bitmask(b2))
+#define l_setbit(x,b)	setbits(x, bitmask(b))
+#define resetbit(x,b)	resetbits(x, bitmask(b))
+#define testbit(x,b)	testbits(x, bitmask(b))
+#define set2bits(x,b1,b2)	setbits(x, (bit2mask(b1, b2)))
+#define reset2bits(x,b1,b2)	resetbits(x, (bit2mask(b1, b2)))
+#define test2bits(x,b1,b2)	testbits(x, (bit2mask(b1, b2)))
+
+
+
+/*
+** Layout for bit use in `marked' field:
+** bit 0 - object is white (type 0)
+** bit 1 - object is white (type 1)
+** bit 2 - object is black
+** bit 3 - for userdata: has been finalized
+** bit 3 - for tables: has weak keys
+** bit 4 - for tables: has weak values
+** bit 5 - object is fixed (should not be collected)
+** bit 6 - object is "super" fixed (only the main thread)
+*/
+
+
+#define WHITE0BIT	0
+#define WHITE1BIT	1
+#define BLACKBIT	2
+#define FINALIZEDBIT	3
+#define KEYWEAKBIT	3
+#define VALUEWEAKBIT	4
+#define FIXEDBIT	5
+#define SFIXEDBIT	6
+#define WHITEBITS	bit2mask(WHITE0BIT, WHITE1BIT)
+
+
+#define iswhite(x)      test2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
+#define isblack(x)      testbit((x)->gch.marked, BLACKBIT)
+#define isgray(x)	(!isblack(x) && !iswhite(x))
+
+#define otherwhite(g)	(g->currentwhite ^ WHITEBITS)
+#define isdead(g,v)	((v)->gch.marked & otherwhite(g) & WHITEBITS)
+
+#define changewhite(x)	((x)->gch.marked ^= WHITEBITS)
+#define gray2black(x)	l_setbit((x)->gch.marked, BLACKBIT)
+
+#define valiswhite(x)	(iscollectable(x) && iswhite(gcvalue(x)))
+
+#define luaC_white(g)	cast(lu_byte, (g)->currentwhite & WHITEBITS)
+
+
+#define luaC_checkGC(L) { \
+  condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); \
+  if (G(L)->totalbytes >= G(L)->GCthreshold) \
+	luaC_step(L); }
+
+
+#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p)))  \
+	luaC_barrierf(L,obj2gco(p),gcvalue(v)); }
+
+#define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t)))  \
+	luaC_barrierback(L,t); }
+
+#define luaC_objbarrier(L,p,o)  \
+	{ if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \
+		luaC_barrierf(L,obj2gco(p),obj2gco(o)); }
+
+#define luaC_objbarriert(L,t,o)  \
+   { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) luaC_barrierback(L,t); }
+
+LUAI_FUNC size_t luaC_separateudata (lua_State *L, int all);
+LUAI_FUNC void luaC_callGCTM (lua_State *L);
+LUAI_FUNC void luaC_freeall (lua_State *L);
+LUAI_FUNC void luaC_step (lua_State *L);
+LUAI_FUNC void luaC_fullgc (lua_State *L);
+LUAI_FUNC void luaC_link (lua_State *L, GCObject *o, lu_byte tt);
+LUAI_FUNC void luaC_linkupval (lua_State *L, UpVal *uv);
+LUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v);
+LUAI_FUNC void luaC_barrierback (lua_State *L, Table *t);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/linit.c b/redis-stable/deps/lua/src/linit.c
new file mode 100644
index 00000000..c1f90dfa
--- /dev/null
+++ b/redis-stable/deps/lua/src/linit.c
@@ -0,0 +1,38 @@
+/*
+** $Id: linit.c,v 1.14.1.1 2007/12/27 13:02:25 roberto Exp $
+** Initialization of libraries for lua.c
+** See Copyright Notice in lua.h
+*/
+
+
+#define linit_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lualib.h"
+#include "lauxlib.h"
+
+
+static const luaL_Reg lualibs[] = {
+  {"", luaopen_base},
+  {LUA_LOADLIBNAME, luaopen_package},
+  {LUA_TABLIBNAME, luaopen_table},
+  {LUA_IOLIBNAME, luaopen_io},
+  {LUA_OSLIBNAME, luaopen_os},
+  {LUA_STRLIBNAME, luaopen_string},
+  {LUA_MATHLIBNAME, luaopen_math},
+  {LUA_DBLIBNAME, luaopen_debug},
+  {NULL, NULL}
+};
+
+
+LUALIB_API void luaL_openlibs (lua_State *L) {
+  const luaL_Reg *lib = lualibs;
+  for (; lib->func; lib++) {
+    lua_pushcfunction(L, lib->func);
+    lua_pushstring(L, lib->name);
+    lua_call(L, 1, 0);
+  }
+}
+
diff --git a/redis-stable/deps/lua/src/liolib.c b/redis-stable/deps/lua/src/liolib.c
new file mode 100644
index 00000000..649f9a59
--- /dev/null
+++ b/redis-stable/deps/lua/src/liolib.c
@@ -0,0 +1,556 @@
+/*
+** $Id: liolib.c,v 2.73.1.4 2010/05/14 15:33:51 roberto Exp $
+** Standard I/O (and system) library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define liolib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+#define IO_INPUT	1
+#define IO_OUTPUT	2
+
+
+static const char *const fnames[] = {"input", "output"};
+
+
+static int pushresult (lua_State *L, int i, const char *filename) {
+  int en = errno;  /* calls to Lua API may change this value */
+  if (i) {
+    lua_pushboolean(L, 1);
+    return 1;
+  }
+  else {
+    lua_pushnil(L);
+    if (filename)
+      lua_pushfstring(L, "%s: %s", filename, strerror(en));
+    else
+      lua_pushfstring(L, "%s", strerror(en));
+    lua_pushinteger(L, en);
+    return 3;
+  }
+}
+
+
+static void fileerror (lua_State *L, int arg, const char *filename) {
+  lua_pushfstring(L, "%s: %s", filename, strerror(errno));
+  luaL_argerror(L, arg, lua_tostring(L, -1));
+}
+
+
+#define tofilep(L)	((FILE **)luaL_checkudata(L, 1, LUA_FILEHANDLE))
+
+
+static int io_type (lua_State *L) {
+  void *ud;
+  luaL_checkany(L, 1);
+  ud = lua_touserdata(L, 1);
+  lua_getfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);
+  if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1))
+    lua_pushnil(L);  /* not a file */
+  else if (*((FILE **)ud) == NULL)
+    lua_pushliteral(L, "closed file");
+  else
+    lua_pushliteral(L, "file");
+  return 1;
+}
+
+
+static FILE *tofile (lua_State *L) {
+  FILE **f = tofilep(L);
+  if (*f == NULL)
+    luaL_error(L, "attempt to use a closed file");
+  return *f;
+}
+
+
+
+/*
+** When creating file handles, always creates a `closed' file handle
+** before opening the actual file; so, if there is a memory error, the
+** file is not left opened.
+*/
+static FILE **newfile (lua_State *L) {
+  FILE **pf = (FILE **)lua_newuserdata(L, sizeof(FILE *));
+  *pf = NULL;  /* file handle is currently `closed' */
+  luaL_getmetatable(L, LUA_FILEHANDLE);
+  lua_setmetatable(L, -2);
+  return pf;
+}
+
+
+/*
+** function to (not) close the standard files stdin, stdout, and stderr
+*/
+static int io_noclose (lua_State *L) {
+  lua_pushnil(L);
+  lua_pushliteral(L, "cannot close standard file");
+  return 2;
+}
+
+
+/*
+** function to close 'popen' files
+*/
+static int io_pclose (lua_State *L) {
+  FILE **p = tofilep(L);
+  int ok = lua_pclose(L, *p);
+  *p = NULL;
+  return pushresult(L, ok, NULL);
+}
+
+
+/*
+** function to close regular files
+*/
+static int io_fclose (lua_State *L) {
+  FILE **p = tofilep(L);
+  int ok = (fclose(*p) == 0);
+  *p = NULL;
+  return pushresult(L, ok, NULL);
+}
+
+
+static int aux_close (lua_State *L) {
+  lua_getfenv(L, 1);
+  lua_getfield(L, -1, "__close");
+  return (lua_tocfunction(L, -1))(L);
+}
+
+
+static int io_close (lua_State *L) {
+  if (lua_isnone(L, 1))
+    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_OUTPUT);
+  tofile(L);  /* make sure argument is a file */
+  return aux_close(L);
+}
+
+
+static int io_gc (lua_State *L) {
+  FILE *f = *tofilep(L);
+  /* ignore closed files */
+  if (f != NULL)
+    aux_close(L);
+  return 0;
+}
+
+
+static int io_tostring (lua_State *L) {
+  FILE *f = *tofilep(L);
+  if (f == NULL)
+    lua_pushliteral(L, "file (closed)");
+  else
+    lua_pushfstring(L, "file (%p)", f);
+  return 1;
+}
+
+
+static int io_open (lua_State *L) {
+  const char *filename = luaL_checkstring(L, 1);
+  const char *mode = luaL_optstring(L, 2, "r");
+  FILE **pf = newfile(L);
+  *pf = fopen(filename, mode);
+  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
+}
+
+
+/*
+** this function has a separated environment, which defines the
+** correct __close for 'popen' files
+*/
+static int io_popen (lua_State *L) {
+  const char *filename = luaL_checkstring(L, 1);
+  const char *mode = luaL_optstring(L, 2, "r");
+  FILE **pf = newfile(L);
+  *pf = lua_popen(L, filename, mode);
+  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
+}
+
+
+static int io_tmpfile (lua_State *L) {
+  FILE **pf = newfile(L);
+  *pf = tmpfile();
+  return (*pf == NULL) ? pushresult(L, 0, NULL) : 1;
+}
+
+
+static FILE *getiofile (lua_State *L, int findex) {
+  FILE *f;
+  lua_rawgeti(L, LUA_ENVIRONINDEX, findex);
+  f = *(FILE **)lua_touserdata(L, -1);
+  if (f == NULL)
+    luaL_error(L, "standard %s file is closed", fnames[findex - 1]);
+  return f;
+}
+
+
+static int g_iofile (lua_State *L, int f, const char *mode) {
+  if (!lua_isnoneornil(L, 1)) {
+    const char *filename = lua_tostring(L, 1);
+    if (filename) {
+      FILE **pf = newfile(L);
+      *pf = fopen(filename, mode);
+      if (*pf == NULL)
+        fileerror(L, 1, filename);
+    }
+    else {
+      tofile(L);  /* check that it's a valid file handle */
+      lua_pushvalue(L, 1);
+    }
+    lua_rawseti(L, LUA_ENVIRONINDEX, f);
+  }
+  /* return current value */
+  lua_rawgeti(L, LUA_ENVIRONINDEX, f);
+  return 1;
+}
+
+
+static int io_input (lua_State *L) {
+  return g_iofile(L, IO_INPUT, "r");
+}
+
+
+static int io_output (lua_State *L) {
+  return g_iofile(L, IO_OUTPUT, "w");
+}
+
+
+static int io_readline (lua_State *L);
+
+
+static void aux_lines (lua_State *L, int idx, int toclose) {
+  lua_pushvalue(L, idx);
+  lua_pushboolean(L, toclose);  /* close/not close file when finished */
+  lua_pushcclosure(L, io_readline, 2);
+}
+
+
+static int f_lines (lua_State *L) {
+  tofile(L);  /* check that it's a valid file handle */
+  aux_lines(L, 1, 0);
+  return 1;
+}
+
+
+static int io_lines (lua_State *L) {
+  if (lua_isnoneornil(L, 1)) {  /* no arguments? */
+    /* will iterate over default input */
+    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_INPUT);
+    return f_lines(L);
+  }
+  else {
+    const char *filename = luaL_checkstring(L, 1);
+    FILE **pf = newfile(L);
+    *pf = fopen(filename, "r");
+    if (*pf == NULL)
+      fileerror(L, 1, filename);
+    aux_lines(L, lua_gettop(L), 1);
+    return 1;
+  }
+}
+
+
+/*
+** {======================================================
+** READ
+** =======================================================
+*/
+
+
+static int read_number (lua_State *L, FILE *f) {
+  lua_Number d;
+  if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) {
+    lua_pushnumber(L, d);
+    return 1;
+  }
+  else {
+    lua_pushnil(L);  /* "result" to be removed */
+    return 0;  /* read fails */
+  }
+}
+
+
+static int test_eof (lua_State *L, FILE *f) {
+  int c = getc(f);
+  ungetc(c, f);
+  lua_pushlstring(L, NULL, 0);
+  return (c != EOF);
+}
+
+
+static int read_line (lua_State *L, FILE *f) {
+  luaL_Buffer b;
+  luaL_buffinit(L, &b);
+  for (;;) {
+    size_t l;
+    char *p = luaL_prepbuffer(&b);
+    if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) {  /* eof? */
+      luaL_pushresult(&b);  /* close buffer */
+      return (lua_objlen(L, -1) > 0);  /* check whether read something */
+    }
+    l = strlen(p);
+    if (l == 0 || p[l-1] != '\n')
+      luaL_addsize(&b, l);
+    else {
+      luaL_addsize(&b, l - 1);  /* do not include `eol' */
+      luaL_pushresult(&b);  /* close buffer */
+      return 1;  /* read at least an `eol' */
+    }
+  }
+}
+
+
+static int read_chars (lua_State *L, FILE *f, size_t n) {
+  size_t rlen;  /* how much to read */
+  size_t nr;  /* number of chars actually read */
+  luaL_Buffer b;
+  luaL_buffinit(L, &b);
+  rlen = LUAL_BUFFERSIZE;  /* try to read that much each time */
+  do {
+    char *p = luaL_prepbuffer(&b);
+    if (rlen > n) rlen = n;  /* cannot read more than asked */
+    nr = fread(p, sizeof(char), rlen, f);
+    luaL_addsize(&b, nr);
+    n -= nr;  /* still have to read `n' chars */
+  } while (n > 0 && nr == rlen);  /* until end of count or eof */
+  luaL_pushresult(&b);  /* close buffer */
+  return (n == 0 || lua_objlen(L, -1) > 0);
+}
+
+
+static int g_read (lua_State *L, FILE *f, int first) {
+  int nargs = lua_gettop(L) - 1;
+  int success;
+  int n;
+  clearerr(f);
+  if (nargs == 0) {  /* no arguments? */
+    success = read_line(L, f);
+    n = first+1;  /* to return 1 result */
+  }
+  else {  /* ensure stack space for all results and for auxlib's buffer */
+    luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments");
+    success = 1;
+    for (n = first; nargs-- && success; n++) {
+      if (lua_type(L, n) == LUA_TNUMBER) {
+        size_t l = (size_t)lua_tointeger(L, n);
+        success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l);
+      }
+      else {
+        const char *p = lua_tostring(L, n);
+        luaL_argcheck(L, p && p[0] == '*', n, "invalid option");
+        switch (p[1]) {
+          case 'n':  /* number */
+            success = read_number(L, f);
+            break;
+          case 'l':  /* line */
+            success = read_line(L, f);
+            break;
+          case 'a':  /* file */
+            read_chars(L, f, ~((size_t)0));  /* read MAX_SIZE_T chars */
+            success = 1; /* always success */
+            break;
+          default:
+            return luaL_argerror(L, n, "invalid format");
+        }
+      }
+    }
+  }
+  if (ferror(f))
+    return pushresult(L, 0, NULL);
+  if (!success) {
+    lua_pop(L, 1);  /* remove last result */
+    lua_pushnil(L);  /* push nil instead */
+  }
+  return n - first;
+}
+
+
+static int io_read (lua_State *L) {
+  return g_read(L, getiofile(L, IO_INPUT), 1);
+}
+
+
+static int f_read (lua_State *L) {
+  return g_read(L, tofile(L), 2);
+}
+
+
+static int io_readline (lua_State *L) {
+  FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(1));
+  int sucess;
+  if (f == NULL)  /* file is already closed? */
+    luaL_error(L, "file is already closed");
+  sucess = read_line(L, f);
+  if (ferror(f))
+    return luaL_error(L, "%s", strerror(errno));
+  if (sucess) return 1;
+  else {  /* EOF */
+    if (lua_toboolean(L, lua_upvalueindex(2))) {  /* generator created file? */
+      lua_settop(L, 0);
+      lua_pushvalue(L, lua_upvalueindex(1));
+      aux_close(L);  /* close it */
+    }
+    return 0;
+  }
+}
+
+/* }====================================================== */
+
+
+static int g_write (lua_State *L, FILE *f, int arg) {
+  int nargs = lua_gettop(L) - 1;
+  int status = 1;
+  for (; nargs--; arg++) {
+    if (lua_type(L, arg) == LUA_TNUMBER) {
+      /* optimization: could be done exactly as for strings */
+      status = status &&
+          fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0;
+    }
+    else {
+      size_t l;
+      const char *s = luaL_checklstring(L, arg, &l);
+      status = status && (fwrite(s, sizeof(char), l, f) == l);
+    }
+  }
+  return pushresult(L, status, NULL);
+}
+
+
+static int io_write (lua_State *L) {
+  return g_write(L, getiofile(L, IO_OUTPUT), 1);
+}
+
+
+static int f_write (lua_State *L) {
+  return g_write(L, tofile(L), 2);
+}
+
+
+static int f_seek (lua_State *L) {
+  static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END};
+  static const char *const modenames[] = {"set", "cur", "end", NULL};
+  FILE *f = tofile(L);
+  int op = luaL_checkoption(L, 2, "cur", modenames);
+  long offset = luaL_optlong(L, 3, 0);
+  op = fseek(f, offset, mode[op]);
+  if (op)
+    return pushresult(L, 0, NULL);  /* error */
+  else {
+    lua_pushinteger(L, ftell(f));
+    return 1;
+  }
+}
+
+
+static int f_setvbuf (lua_State *L) {
+  static const int mode[] = {_IONBF, _IOFBF, _IOLBF};
+  static const char *const modenames[] = {"no", "full", "line", NULL};
+  FILE *f = tofile(L);
+  int op = luaL_checkoption(L, 2, NULL, modenames);
+  lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE);
+  int res = setvbuf(f, NULL, mode[op], sz);
+  return pushresult(L, res == 0, NULL);
+}
+
+
+
+static int io_flush (lua_State *L) {
+  return pushresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL);
+}
+
+
+static int f_flush (lua_State *L) {
+  return pushresult(L, fflush(tofile(L)) == 0, NULL);
+}
+
+
+static const luaL_Reg iolib[] = {
+  {"close", io_close},
+  {"flush", io_flush},
+  {"input", io_input},
+  {"lines", io_lines},
+  {"open", io_open},
+  {"output", io_output},
+  {"popen", io_popen},
+  {"read", io_read},
+  {"tmpfile", io_tmpfile},
+  {"type", io_type},
+  {"write", io_write},
+  {NULL, NULL}
+};
+
+
+static const luaL_Reg flib[] = {
+  {"close", io_close},
+  {"flush", f_flush},
+  {"lines", f_lines},
+  {"read", f_read},
+  {"seek", f_seek},
+  {"setvbuf", f_setvbuf},
+  {"write", f_write},
+  {"__gc", io_gc},
+  {"__tostring", io_tostring},
+  {NULL, NULL}
+};
+
+
+static void createmeta (lua_State *L) {
+  luaL_newmetatable(L, LUA_FILEHANDLE);  /* create metatable for file handles */
+  lua_pushvalue(L, -1);  /* push metatable */
+  lua_setfield(L, -2, "__index");  /* metatable.__index = metatable */
+  luaL_register(L, NULL, flib);  /* file methods */
+}
+
+
+static void createstdfile (lua_State *L, FILE *f, int k, const char *fname) {
+  *newfile(L) = f;
+  if (k > 0) {
+    lua_pushvalue(L, -1);
+    lua_rawseti(L, LUA_ENVIRONINDEX, k);
+  }
+  lua_pushvalue(L, -2);  /* copy environment */
+  lua_setfenv(L, -2);  /* set it */
+  lua_setfield(L, -3, fname);
+}
+
+
+static void newfenv (lua_State *L, lua_CFunction cls) {
+  lua_createtable(L, 0, 1);
+  lua_pushcfunction(L, cls);
+  lua_setfield(L, -2, "__close");
+}
+
+
+LUALIB_API int luaopen_io (lua_State *L) {
+  createmeta(L);
+  /* create (private) environment (with fields IO_INPUT, IO_OUTPUT, __close) */
+  newfenv(L, io_fclose);
+  lua_replace(L, LUA_ENVIRONINDEX);
+  /* open library */
+  luaL_register(L, LUA_IOLIBNAME, iolib);
+  /* create (and set) default files */
+  newfenv(L, io_noclose);  /* close function for default files */
+  createstdfile(L, stdin, IO_INPUT, "stdin");
+  createstdfile(L, stdout, IO_OUTPUT, "stdout");
+  createstdfile(L, stderr, 0, "stderr");
+  lua_pop(L, 1);  /* pop environment for default files */
+  lua_getfield(L, -1, "popen");
+  newfenv(L, io_pclose);  /* create environment for 'popen' */
+  lua_setfenv(L, -2);  /* set fenv for 'popen' */
+  lua_pop(L, 1);  /* pop 'popen' */
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/llex.c b/redis-stable/deps/lua/src/llex.c
new file mode 100644
index 00000000..88c6790c
--- /dev/null
+++ b/redis-stable/deps/lua/src/llex.c
@@ -0,0 +1,463 @@
+/*
+** $Id: llex.c,v 2.20.1.2 2009/11/23 14:58:22 roberto Exp $
+** Lexical Analyzer
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <locale.h>
+#include <string.h>
+
+#define llex_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "llex.h"
+#include "lobject.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "lzio.h"
+
+
+
+#define next(ls) (ls->current = zgetc(ls->z))
+
+
+
+
+#define currIsNewline(ls)	(ls->current == '\n' || ls->current == '\r')
+
+
+/* ORDER RESERVED */
+const char *const luaX_tokens [] = {
+    "and", "break", "do", "else", "elseif",
+    "end", "false", "for", "function", "if",
+    "in", "local", "nil", "not", "or", "repeat",
+    "return", "then", "true", "until", "while",
+    "..", "...", "==", ">=", "<=", "~=",
+    "<number>", "<name>", "<string>", "<eof>",
+    NULL
+};
+
+
+#define save_and_next(ls) (save(ls, ls->current), next(ls))
+
+
+static void save (LexState *ls, int c) {
+  Mbuffer *b = ls->buff;
+  if (b->n + 1 > b->buffsize) {
+    size_t newsize;
+    if (b->buffsize >= MAX_SIZET/2)
+      luaX_lexerror(ls, "lexical element too long", 0);
+    newsize = b->buffsize * 2;
+    luaZ_resizebuffer(ls->L, b, newsize);
+  }
+  b->buffer[b->n++] = cast(char, c);
+}
+
+
+void luaX_init (lua_State *L) {
+  int i;
+  for (i=0; i<NUM_RESERVED; i++) {
+    TString *ts = luaS_new(L, luaX_tokens[i]);
+    luaS_fix(ts);  /* reserved words are never collected */
+    lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);
+    ts->tsv.reserved = cast_byte(i+1);  /* reserved word */
+  }
+}
+
+
+#define MAXSRC          80
+
+
+const char *luaX_token2str (LexState *ls, int token) {
+  if (token < FIRST_RESERVED) {
+    lua_assert(token == cast(unsigned char, token));
+    return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) :
+                              luaO_pushfstring(ls->L, "%c", token);
+  }
+  else
+    return luaX_tokens[token-FIRST_RESERVED];
+}
+
+
+static const char *txtToken (LexState *ls, int token) {
+  switch (token) {
+    case TK_NAME:
+    case TK_STRING:
+    case TK_NUMBER:
+      save(ls, '\0');
+      return luaZ_buffer(ls->buff);
+    default:
+      return luaX_token2str(ls, token);
+  }
+}
+
+
+void luaX_lexerror (LexState *ls, const char *msg, int token) {
+  char buff[MAXSRC];
+  luaO_chunkid(buff, getstr(ls->source), MAXSRC);
+  msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
+  if (token)
+    luaO_pushfstring(ls->L, "%s near " LUA_QS, msg, txtToken(ls, token));
+  luaD_throw(ls->L, LUA_ERRSYNTAX);
+}
+
+
+void luaX_syntaxerror (LexState *ls, const char *msg) {
+  luaX_lexerror(ls, msg, ls->t.token);
+}
+
+
+TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
+  lua_State *L = ls->L;
+  TString *ts = luaS_newlstr(L, str, l);
+  TValue *o = luaH_setstr(L, ls->fs->h, ts);  /* entry for `str' */
+  if (ttisnil(o)) {
+    setbvalue(o, 1);  /* make sure `str' will not be collected */
+    luaC_checkGC(L);
+  }
+  return ts;
+}
+
+
+static void inclinenumber (LexState *ls) {
+  int old = ls->current;
+  lua_assert(currIsNewline(ls));
+  next(ls);  /* skip `\n' or `\r' */
+  if (currIsNewline(ls) && ls->current != old)
+    next(ls);  /* skip `\n\r' or `\r\n' */
+  if (++ls->linenumber >= MAX_INT)
+    luaX_syntaxerror(ls, "chunk has too many lines");
+}
+
+
+void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
+  ls->decpoint = '.';
+  ls->L = L;
+  ls->lookahead.token = TK_EOS;  /* no look-ahead token */
+  ls->z = z;
+  ls->fs = NULL;
+  ls->linenumber = 1;
+  ls->lastline = 1;
+  ls->source = source;
+  luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */
+  next(ls);  /* read first char */
+}
+
+
+
+/*
+** =======================================================
+** LEXICAL ANALYZER
+** =======================================================
+*/
+
+
+
+static int check_next (LexState *ls, const char *set) {
+  if (!strchr(set, ls->current))
+    return 0;
+  save_and_next(ls);
+  return 1;
+}
+
+
+static void buffreplace (LexState *ls, char from, char to) {
+  size_t n = luaZ_bufflen(ls->buff);
+  char *p = luaZ_buffer(ls->buff);
+  while (n--)
+    if (p[n] == from) p[n] = to;
+}
+
+
+static void trydecpoint (LexState *ls, SemInfo *seminfo) {
+  /* format error: try to update decimal point separator */
+  struct lconv *cv = localeconv();
+  char old = ls->decpoint;
+  ls->decpoint = (cv ? cv->decimal_point[0] : '.');
+  buffreplace(ls, old, ls->decpoint);  /* try updated decimal separator */
+  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {
+    /* format error with correct decimal point: no more options */
+    buffreplace(ls, ls->decpoint, '.');  /* undo change (for error message) */
+    luaX_lexerror(ls, "malformed number", TK_NUMBER);
+  }
+}
+
+
+/* LUA_NUMBER */
+static void read_numeral (LexState *ls, SemInfo *seminfo) {
+  lua_assert(isdigit(ls->current));
+  do {
+    save_and_next(ls);
+  } while (isdigit(ls->current) || ls->current == '.');
+  if (check_next(ls, "Ee"))  /* `E'? */
+    check_next(ls, "+-");  /* optional exponent sign */
+  while (isalnum(ls->current) || ls->current == '_')
+    save_and_next(ls);
+  save(ls, '\0');
+  buffreplace(ls, '.', ls->decpoint);  /* follow locale for decimal point */
+  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r))  /* format error? */
+    trydecpoint(ls, seminfo); /* try to update decimal point separator */
+}
+
+
+static int skip_sep (LexState *ls) {
+  int count = 0;
+  int s = ls->current;
+  lua_assert(s == '[' || s == ']');
+  save_and_next(ls);
+  while (ls->current == '=') {
+    save_and_next(ls);
+    count++;
+  }
+  return (ls->current == s) ? count : (-count) - 1;
+}
+
+
+static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
+  int cont = 0;
+  (void)(cont);  /* avoid warnings when `cont' is not used */
+  save_and_next(ls);  /* skip 2nd `[' */
+  if (currIsNewline(ls))  /* string starts with a newline? */
+    inclinenumber(ls);  /* skip it */
+  for (;;) {
+    switch (ls->current) {
+      case EOZ:
+        luaX_lexerror(ls, (seminfo) ? "unfinished long string" :
+                                   "unfinished long comment", TK_EOS);
+        break;  /* to avoid warnings */
+#if defined(LUA_COMPAT_LSTR)
+      case '[': {
+        if (skip_sep(ls) == sep) {
+          save_and_next(ls);  /* skip 2nd `[' */
+          cont++;
+#if LUA_COMPAT_LSTR == 1
+          if (sep == 0)
+            luaX_lexerror(ls, "nesting of [[...]] is deprecated", '[');
+#endif
+        }
+        break;
+      }
+#endif
+      case ']': {
+        if (skip_sep(ls) == sep) {
+          save_and_next(ls);  /* skip 2nd `]' */
+#if defined(LUA_COMPAT_LSTR) && LUA_COMPAT_LSTR == 2
+          cont--;
+          if (sep == 0 && cont >= 0) break;
+#endif
+          goto endloop;
+        }
+        break;
+      }
+      case '\n':
+      case '\r': {
+        save(ls, '\n');
+        inclinenumber(ls);
+        if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */
+        break;
+      }
+      default: {
+        if (seminfo) save_and_next(ls);
+        else next(ls);
+      }
+    }
+  } endloop:
+  if (seminfo)
+    seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
+                                     luaZ_bufflen(ls->buff) - 2*(2 + sep));
+}
+
+
+static void read_string (LexState *ls, int del, SemInfo *seminfo) {
+  save_and_next(ls);
+  while (ls->current != del) {
+    switch (ls->current) {
+      case EOZ:
+        luaX_lexerror(ls, "unfinished string", TK_EOS);
+        continue;  /* to avoid warnings */
+      case '\n':
+      case '\r':
+        luaX_lexerror(ls, "unfinished string", TK_STRING);
+        continue;  /* to avoid warnings */
+      case '\\': {
+        int c;
+        next(ls);  /* do not save the `\' */
+        switch (ls->current) {
+          case 'a': c = '\a'; break;
+          case 'b': c = '\b'; break;
+          case 'f': c = '\f'; break;
+          case 'n': c = '\n'; break;
+          case 'r': c = '\r'; break;
+          case 't': c = '\t'; break;
+          case 'v': c = '\v'; break;
+          case '\n':  /* go through */
+          case '\r': save(ls, '\n'); inclinenumber(ls); continue;
+          case EOZ: continue;  /* will raise an error next loop */
+          default: {
+            if (!isdigit(ls->current))
+              save_and_next(ls);  /* handles \\, \", \', and \? */
+            else {  /* \xxx */
+              int i = 0;
+              c = 0;
+              do {
+                c = 10*c + (ls->current-'0');
+                next(ls);
+              } while (++i<3 && isdigit(ls->current));
+              if (c > UCHAR_MAX)
+                luaX_lexerror(ls, "escape sequence too large", TK_STRING);
+              save(ls, c);
+            }
+            continue;
+          }
+        }
+        save(ls, c);
+        next(ls);
+        continue;
+      }
+      default:
+        save_and_next(ls);
+    }
+  }
+  save_and_next(ls);  /* skip delimiter */
+  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
+                                   luaZ_bufflen(ls->buff) - 2);
+}
+
+
+static int llex (LexState *ls, SemInfo *seminfo) {
+  luaZ_resetbuffer(ls->buff);
+  for (;;) {
+    switch (ls->current) {
+      case '\n':
+      case '\r': {
+        inclinenumber(ls);
+        continue;
+      }
+      case '-': {
+        next(ls);
+        if (ls->current != '-') return '-';
+        /* else is a comment */
+        next(ls);
+        if (ls->current == '[') {
+          int sep = skip_sep(ls);
+          luaZ_resetbuffer(ls->buff);  /* `skip_sep' may dirty the buffer */
+          if (sep >= 0) {
+            read_long_string(ls, NULL, sep);  /* long comment */
+            luaZ_resetbuffer(ls->buff);
+            continue;
+          }
+        }
+        /* else short comment */
+        while (!currIsNewline(ls) && ls->current != EOZ)
+          next(ls);
+        continue;
+      }
+      case '[': {
+        int sep = skip_sep(ls);
+        if (sep >= 0) {
+          read_long_string(ls, seminfo, sep);
+          return TK_STRING;
+        }
+        else if (sep == -1) return '[';
+        else luaX_lexerror(ls, "invalid long string delimiter", TK_STRING);
+      }
+      case '=': {
+        next(ls);
+        if (ls->current != '=') return '=';
+        else { next(ls); return TK_EQ; }
+      }
+      case '<': {
+        next(ls);
+        if (ls->current != '=') return '<';
+        else { next(ls); return TK_LE; }
+      }
+      case '>': {
+        next(ls);
+        if (ls->current != '=') return '>';
+        else { next(ls); return TK_GE; }
+      }
+      case '~': {
+        next(ls);
+        if (ls->current != '=') return '~';
+        else { next(ls); return TK_NE; }
+      }
+      case '"':
+      case '\'': {
+        read_string(ls, ls->current, seminfo);
+        return TK_STRING;
+      }
+      case '.': {
+        save_and_next(ls);
+        if (check_next(ls, ".")) {
+          if (check_next(ls, "."))
+            return TK_DOTS;   /* ... */
+          else return TK_CONCAT;   /* .. */
+        }
+        else if (!isdigit(ls->current)) return '.';
+        else {
+          read_numeral(ls, seminfo);
+          return TK_NUMBER;
+        }
+      }
+      case EOZ: {
+        return TK_EOS;
+      }
+      default: {
+        if (isspace(ls->current)) {
+          lua_assert(!currIsNewline(ls));
+          next(ls);
+          continue;
+        }
+        else if (isdigit(ls->current)) {
+          read_numeral(ls, seminfo);
+          return TK_NUMBER;
+        }
+        else if (isalpha(ls->current) || ls->current == '_') {
+          /* identifier or reserved word */
+          TString *ts;
+          do {
+            save_and_next(ls);
+          } while (isalnum(ls->current) || ls->current == '_');
+          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
+                                  luaZ_bufflen(ls->buff));
+          if (ts->tsv.reserved > 0)  /* reserved word? */
+            return ts->tsv.reserved - 1 + FIRST_RESERVED;
+          else {
+            seminfo->ts = ts;
+            return TK_NAME;
+          }
+        }
+        else {
+          int c = ls->current;
+          next(ls);
+          return c;  /* single-char tokens (+ - / ...) */
+        }
+      }
+    }
+  }
+}
+
+
+void luaX_next (LexState *ls) {
+  ls->lastline = ls->linenumber;
+  if (ls->lookahead.token != TK_EOS) {  /* is there a look-ahead token? */
+    ls->t = ls->lookahead;  /* use this one */
+    ls->lookahead.token = TK_EOS;  /* and discharge it */
+  }
+  else
+    ls->t.token = llex(ls, &ls->t.seminfo);  /* read next token */
+}
+
+
+void luaX_lookahead (LexState *ls) {
+  lua_assert(ls->lookahead.token == TK_EOS);
+  ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
+}
+
diff --git a/redis-stable/deps/lua/src/llex.h b/redis-stable/deps/lua/src/llex.h
new file mode 100644
index 00000000..a9201cee
--- /dev/null
+++ b/redis-stable/deps/lua/src/llex.h
@@ -0,0 +1,81 @@
+/*
+** $Id: llex.h,v 1.58.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lexical Analyzer
+** See Copyright Notice in lua.h
+*/
+
+#ifndef llex_h
+#define llex_h
+
+#include "lobject.h"
+#include "lzio.h"
+
+
+#define FIRST_RESERVED	257
+
+/* maximum length of a reserved word */
+#define TOKEN_LEN	(sizeof("function")/sizeof(char))
+
+
+/*
+* WARNING: if you change the order of this enumeration,
+* grep "ORDER RESERVED"
+*/
+enum RESERVED {
+  /* terminal symbols denoted by reserved words */
+  TK_AND = FIRST_RESERVED, TK_BREAK,
+  TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION,
+  TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT,
+  TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE,
+  /* other terminal symbols */
+  TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER,
+  TK_NAME, TK_STRING, TK_EOS
+};
+
+/* number of reserved words */
+#define NUM_RESERVED	(cast(int, TK_WHILE-FIRST_RESERVED+1))
+
+
+/* array with token `names' */
+LUAI_DATA const char *const luaX_tokens [];
+
+
+typedef union {
+  lua_Number r;
+  TString *ts;
+} SemInfo;  /* semantics information */
+
+
+typedef struct Token {
+  int token;
+  SemInfo seminfo;
+} Token;
+
+
+typedef struct LexState {
+  int current;  /* current character (charint) */
+  int linenumber;  /* input line counter */
+  int lastline;  /* line of last token `consumed' */
+  Token t;  /* current token */
+  Token lookahead;  /* look ahead token */
+  struct FuncState *fs;  /* `FuncState' is private to the parser */
+  struct lua_State *L;
+  ZIO *z;  /* input stream */
+  Mbuffer *buff;  /* buffer for tokens */
+  TString *source;  /* current source name */
+  char decpoint;  /* locale decimal point */
+} LexState;
+
+
+LUAI_FUNC void luaX_init (lua_State *L);
+LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z,
+                              TString *source);
+LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l);
+LUAI_FUNC void luaX_next (LexState *ls);
+LUAI_FUNC void luaX_lookahead (LexState *ls);
+LUAI_FUNC void luaX_lexerror (LexState *ls, const char *msg, int token);
+LUAI_FUNC void luaX_syntaxerror (LexState *ls, const char *s);
+LUAI_FUNC const char *luaX_token2str (LexState *ls, int token);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/llimits.h b/redis-stable/deps/lua/src/llimits.h
new file mode 100644
index 00000000..ca8dcb72
--- /dev/null
+++ b/redis-stable/deps/lua/src/llimits.h
@@ -0,0 +1,128 @@
+/*
+** $Id: llimits.h,v 1.69.1.1 2007/12/27 13:02:25 roberto Exp $
+** Limits, basic types, and some other `installation-dependent' definitions
+** See Copyright Notice in lua.h
+*/
+
+#ifndef llimits_h
+#define llimits_h
+
+
+#include <limits.h>
+#include <stddef.h>
+
+
+#include "lua.h"
+
+
+typedef LUAI_UINT32 lu_int32;
+
+typedef LUAI_UMEM lu_mem;
+
+typedef LUAI_MEM l_mem;
+
+
+
+/* chars used as small naturals (so that `char' is reserved for characters) */
+typedef unsigned char lu_byte;
+
+
+#define MAX_SIZET	((size_t)(~(size_t)0)-2)
+
+#define MAX_LUMEM	((lu_mem)(~(lu_mem)0)-2)
+
+
+#define MAX_INT (INT_MAX-2)  /* maximum value of an int (-2 for safety) */
+
+/*
+** conversion of pointer to integer
+** this is for hashing only; there is no problem if the integer
+** cannot hold the whole pointer value
+*/
+#define IntPoint(p)  ((unsigned int)(lu_mem)(p))
+
+
+
+/* type to ensure maximum alignment */
+typedef LUAI_USER_ALIGNMENT_T L_Umaxalign;
+
+
+/* result of a `usual argument conversion' over lua_Number */
+typedef LUAI_UACNUMBER l_uacNumber;
+
+
+/* internal assertions for in-house debugging */
+#ifdef lua_assert
+
+#define check_exp(c,e)		(lua_assert(c), (e))
+#define api_check(l,e)		lua_assert(e)
+
+#else
+
+#define lua_assert(c)		((void)0)
+#define check_exp(c,e)		(e)
+#define api_check		luai_apicheck
+
+#endif
+
+
+#ifndef UNUSED
+#define UNUSED(x)	((void)(x))	/* to avoid warnings */
+#endif
+
+
+#ifndef cast
+#define cast(t, exp)	((t)(exp))
+#endif
+
+#define cast_byte(i)	cast(lu_byte, (i))
+#define cast_num(i)	cast(lua_Number, (i))
+#define cast_int(i)	cast(int, (i))
+
+
+
+/*
+** type for virtual-machine instructions
+** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h)
+*/
+typedef lu_int32 Instruction;
+
+
+
+/* maximum stack for a Lua function */
+#define MAXSTACK	250
+
+
+
+/* minimum size for the string table (must be power of 2) */
+#ifndef MINSTRTABSIZE
+#define MINSTRTABSIZE	32
+#endif
+
+
+/* minimum size for string buffer */
+#ifndef LUA_MINBUFFER
+#define LUA_MINBUFFER	32
+#endif
+
+
+#ifndef lua_lock
+#define lua_lock(L)     ((void) 0) 
+#define lua_unlock(L)   ((void) 0)
+#endif
+
+#ifndef luai_threadyield
+#define luai_threadyield(L)     {lua_unlock(L); lua_lock(L);}
+#endif
+
+
+/*
+** macro to control inclusion of some hard tests on stack reallocation
+*/ 
+#ifndef HARDSTACKTESTS
+#define condhardstacktests(x)	((void)0)
+#else
+#define condhardstacktests(x)	x
+#endif
+
+#endif
diff --git a/redis-stable/deps/lua/src/lmathlib.c b/redis-stable/deps/lua/src/lmathlib.c
new file mode 100644
index 00000000..441fbf73
--- /dev/null
+++ b/redis-stable/deps/lua/src/lmathlib.c
@@ -0,0 +1,263 @@
+/*
+** $Id: lmathlib.c,v 1.67.1.1 2007/12/27 13:02:25 roberto Exp $
+** Standard mathematical library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdlib.h>
+#include <math.h>
+
+#define lmathlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#undef PI
+#define PI (3.14159265358979323846)
+#define RADIANS_PER_DEGREE (PI/180.0)
+
+
+
+static int math_abs (lua_State *L) {
+  lua_pushnumber(L, fabs(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_sin (lua_State *L) {
+  lua_pushnumber(L, sin(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_sinh (lua_State *L) {
+  lua_pushnumber(L, sinh(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_cos (lua_State *L) {
+  lua_pushnumber(L, cos(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_cosh (lua_State *L) {
+  lua_pushnumber(L, cosh(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_tan (lua_State *L) {
+  lua_pushnumber(L, tan(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_tanh (lua_State *L) {
+  lua_pushnumber(L, tanh(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_asin (lua_State *L) {
+  lua_pushnumber(L, asin(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_acos (lua_State *L) {
+  lua_pushnumber(L, acos(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_atan (lua_State *L) {
+  lua_pushnumber(L, atan(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_atan2 (lua_State *L) {
+  lua_pushnumber(L, atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+  return 1;
+}
+
+static int math_ceil (lua_State *L) {
+  lua_pushnumber(L, ceil(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_floor (lua_State *L) {
+  lua_pushnumber(L, floor(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_fmod (lua_State *L) {
+  lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+  return 1;
+}
+
+static int math_modf (lua_State *L) {
+  double ip;
+  double fp = modf(luaL_checknumber(L, 1), &ip);
+  lua_pushnumber(L, ip);
+  lua_pushnumber(L, fp);
+  return 2;
+}
+
+static int math_sqrt (lua_State *L) {
+  lua_pushnumber(L, sqrt(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_pow (lua_State *L) {
+  lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
+  return 1;
+}
+
+static int math_log (lua_State *L) {
+  lua_pushnumber(L, log(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_log10 (lua_State *L) {
+  lua_pushnumber(L, log10(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_exp (lua_State *L) {
+  lua_pushnumber(L, exp(luaL_checknumber(L, 1)));
+  return 1;
+}
+
+static int math_deg (lua_State *L) {
+  lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE);
+  return 1;
+}
+
+static int math_rad (lua_State *L) {
+  lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE);
+  return 1;
+}
+
+static int math_frexp (lua_State *L) {
+  int e;
+  lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e));
+  lua_pushinteger(L, e);
+  return 2;
+}
+
+static int math_ldexp (lua_State *L) {
+  lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2)));
+  return 1;
+}
+
+
+
+static int math_min (lua_State *L) {
+  int n = lua_gettop(L);  /* number of arguments */
+  lua_Number dmin = luaL_checknumber(L, 1);
+  int i;
+  for (i=2; i<=n; i++) {
+    lua_Number d = luaL_checknumber(L, i);
+    if (d < dmin)
+      dmin = d;
+  }
+  lua_pushnumber(L, dmin);
+  return 1;
+}
+
+
+static int math_max (lua_State *L) {
+  int n = lua_gettop(L);  /* number of arguments */
+  lua_Number dmax = luaL_checknumber(L, 1);
+  int i;
+  for (i=2; i<=n; i++) {
+    lua_Number d = luaL_checknumber(L, i);
+    if (d > dmax)
+      dmax = d;
+  }
+  lua_pushnumber(L, dmax);
+  return 1;
+}
+
+
+static int math_random (lua_State *L) {
+  /* the `%' avoids the (rare) case of r==1, and is needed also because on
+     some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
+  lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX;
+  switch (lua_gettop(L)) {  /* check number of arguments */
+    case 0: {  /* no arguments */
+      lua_pushnumber(L, r);  /* Number between 0 and 1 */
+      break;
+    }
+    case 1: {  /* only upper limit */
+      int u = luaL_checkint(L, 1);
+      luaL_argcheck(L, 1<=u, 1, "interval is empty");
+      lua_pushnumber(L, floor(r*u)+1);  /* int between 1 and `u' */
+      break;
+    }
+    case 2: {  /* lower and upper limits */
+      int l = luaL_checkint(L, 1);
+      int u = luaL_checkint(L, 2);
+      luaL_argcheck(L, l<=u, 2, "interval is empty");
+      lua_pushnumber(L, floor(r*(u-l+1))+l);  /* int between `l' and `u' */
+      break;
+    }
+    default: return luaL_error(L, "wrong number of arguments");
+  }
+  return 1;
+}
+
+
+static int math_randomseed (lua_State *L) {
+  srand(luaL_checkint(L, 1));
+  return 0;
+}
+
+
+static const luaL_Reg mathlib[] = {
+  {"abs",   math_abs},
+  {"acos",  math_acos},
+  {"asin",  math_asin},
+  {"atan2", math_atan2},
+  {"atan",  math_atan},
+  {"ceil",  math_ceil},
+  {"cosh",   math_cosh},
+  {"cos",   math_cos},
+  {"deg",   math_deg},
+  {"exp",   math_exp},
+  {"floor", math_floor},
+  {"fmod",   math_fmod},
+  {"frexp", math_frexp},
+  {"ldexp", math_ldexp},
+  {"log10", math_log10},
+  {"log",   math_log},
+  {"max",   math_max},
+  {"min",   math_min},
+  {"modf",   math_modf},
+  {"pow",   math_pow},
+  {"rad",   math_rad},
+  {"random",     math_random},
+  {"randomseed", math_randomseed},
+  {"sinh",   math_sinh},
+  {"sin",   math_sin},
+  {"sqrt",  math_sqrt},
+  {"tanh",   math_tanh},
+  {"tan",   math_tan},
+  {NULL, NULL}
+};
+
+
+/*
+** Open math library
+*/
+LUALIB_API int luaopen_math (lua_State *L) {
+  luaL_register(L, LUA_MATHLIBNAME, mathlib);
+  lua_pushnumber(L, PI);
+  lua_setfield(L, -2, "pi");
+  lua_pushnumber(L, HUGE_VAL);
+  lua_setfield(L, -2, "huge");
+#if defined(LUA_COMPAT_MOD)
+  lua_getfield(L, -1, "fmod");
+  lua_setfield(L, -2, "mod");
+#endif
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/lmem.c b/redis-stable/deps/lua/src/lmem.c
new file mode 100644
index 00000000..ae7d8c96
--- /dev/null
+++ b/redis-stable/deps/lua/src/lmem.c
@@ -0,0 +1,86 @@
+/*
+** $Id: lmem.c,v 1.70.1.1 2007/12/27 13:02:25 roberto Exp $
+** Interface to Memory Manager
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lmem_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+
+/*
+** About the realloc function:
+** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize);
+** (`osize' is the old size, `nsize' is the new size)
+**
+** Lua ensures that (ptr == NULL) iff (osize == 0).
+**
+** * frealloc(ud, NULL, 0, x) creates a new block of size `x'
+**
+** * frealloc(ud, p, x, 0) frees the block `p'
+** (in this specific case, frealloc must return NULL).
+** particularly, frealloc(ud, NULL, 0, 0) does nothing
+** (which is equivalent to free(NULL) in ANSI C)
+**
+** frealloc returns NULL if it cannot create or reallocate the area
+** (any reallocation to an equal or smaller size cannot fail!)
+*/
+
+
+
+#define MINSIZEARRAY	4
+
+
+void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
+                     int limit, const char *errormsg) {
+  void *newblock;
+  int newsize;
+  if (*size >= limit/2) {  /* cannot double it? */
+    if (*size >= limit)  /* cannot grow even a little? */
+      luaG_runerror(L, errormsg);
+    newsize = limit;  /* still have at least one free place */
+  }
+  else {
+    newsize = (*size)*2;
+    if (newsize < MINSIZEARRAY)
+      newsize = MINSIZEARRAY;  /* minimum size */
+  }
+  newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
+  *size = newsize;  /* update only when everything else is OK */
+  return newblock;
+}
+
+
+void *luaM_toobig (lua_State *L) {
+  luaG_runerror(L, "memory allocation error: block too big");
+  return NULL;  /* to avoid warnings */
+}
+
+
+
+/*
+** generic allocation routine.
+*/
+void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
+  global_State *g = G(L);
+  lua_assert((osize == 0) == (block == NULL));
+  block = (*g->frealloc)(g->ud, block, osize, nsize);
+  if (block == NULL && nsize > 0)
+    luaD_throw(L, LUA_ERRMEM);
+  lua_assert((nsize == 0) == (block == NULL));
+  g->totalbytes = (g->totalbytes - osize) + nsize;
+  return block;
+}
+
diff --git a/redis-stable/deps/lua/src/lmem.h b/redis-stable/deps/lua/src/lmem.h
new file mode 100644
index 00000000..7c2dcb32
--- /dev/null
+++ b/redis-stable/deps/lua/src/lmem.h
@@ -0,0 +1,49 @@
+/*
+** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
+** Interface to Memory Manager
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lmem_h
+#define lmem_h
+
+
+#include <stddef.h>
+
+#include "llimits.h"
+#include "lua.h"
+
+#define MEMERRMSG	"not enough memory"
+
+
+#define luaM_reallocv(L,b,on,n,e) \
+	((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ?  /* +1 to avoid warnings */ \
+		luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \
+		luaM_toobig(L))
+
+#define luaM_freemem(L, b, s)	luaM_realloc_(L, (b), (s), 0)
+#define luaM_free(L, b)		luaM_realloc_(L, (b), sizeof(*(b)), 0)
+#define luaM_freearray(L, b, n, t)   luaM_reallocv(L, (b), n, 0, sizeof(t))
+
+#define luaM_malloc(L,t)	luaM_realloc_(L, NULL, 0, (t))
+#define luaM_new(L,t)		cast(t *, luaM_malloc(L, sizeof(t)))
+#define luaM_newvector(L,n,t) \
+		cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
+
+#define luaM_growvector(L,v,nelems,size,t,limit,e) \
+          if ((nelems)+1 > (size)) \
+            ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
+
+#define luaM_reallocvector(L, v,oldn,n,t) \
+   ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
+
+
+LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
+                                                          size_t size);
+LUAI_FUNC void *luaM_toobig (lua_State *L);
+LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
+                               size_t size_elem, int limit,
+                               const char *errormsg);
+
+#endif
+
diff --git a/redis-stable/deps/lua/src/loadlib.c b/redis-stable/deps/lua/src/loadlib.c
new file mode 100644
index 00000000..6158c535
--- /dev/null
+++ b/redis-stable/deps/lua/src/loadlib.c
@@ -0,0 +1,666 @@
+/*
+** $Id: loadlib.c,v 1.52.1.4 2009/09/09 13:17:16 roberto Exp $
+** Dynamic library loader for Lua
+** See Copyright Notice in lua.h
+**
+** This module contains an implementation of loadlib for Unix systems
+** that have dlfcn, an implementation for Darwin (Mac OS X), an
+** implementation for Windows, and a stub for other systems.
+*/
+
+
+#include <stdlib.h>
+#include <string.h>
+
+
+#define loadlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+/* prefix for open functions in C libraries */
+#define LUA_POF		"luaopen_"
+
+/* separator for open functions in C libraries */
+#define LUA_OFSEP	"_"
+
+
+#define LIBPREFIX	"LOADLIB: "
+
+#define POF		LUA_POF
+#define LIB_FAIL	"open"
+
+
+/* error codes for ll_loadfunc */
+#define ERRLIB		1
+#define ERRFUNC		2
+
+#define setprogdir(L)		((void)0)
+
+
+static void ll_unloadlib (void *lib);
+static void *ll_load (lua_State *L, const char *path);
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym);
+
+
+
+#if defined(LUA_DL_DLOPEN)
+/*
+** {========================================================================
+** This is an implementation of loadlib based on the dlfcn interface.
+** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD,
+** NetBSD, AIX 4.2, HPUX 11, and  probably most other Unix flavors, at least
+** as an emulation layer on top of native functions.
+** =========================================================================
+*/
+
+#include <dlfcn.h>
+
+static void ll_unloadlib (void *lib) {
+  dlclose(lib);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+  void *lib = dlopen(path, RTLD_NOW);
+  if (lib == NULL) lua_pushstring(L, dlerror());
+  return lib;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+  lua_CFunction f = (lua_CFunction)dlsym(lib, sym);
+  if (f == NULL) lua_pushstring(L, dlerror());
+  return f;
+}
+
+/* }====================================================== */
+
+
+
+#elif defined(LUA_DL_DLL)
+/*
+** {======================================================================
+** This is an implementation of loadlib for Windows using native functions.
+** =======================================================================
+*/
+
+#include <windows.h>
+
+
+#undef setprogdir
+
+static void setprogdir (lua_State *L) {
+  char buff[MAX_PATH + 1];
+  char *lb;
+  DWORD nsize = sizeof(buff)/sizeof(char);
+  DWORD n = GetModuleFileNameA(NULL, buff, nsize);
+  if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL)
+    luaL_error(L, "unable to get ModuleFileName");
+  else {
+    *lb = '\0';
+    luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);
+    lua_remove(L, -2);  /* remove original string */
+  }
+}
+
+
+static void pusherror (lua_State *L) {
+  int error = GetLastError();
+  char buffer[128];
+  if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,
+      NULL, error, 0, buffer, sizeof(buffer), NULL))
+    lua_pushstring(L, buffer);
+  else
+    lua_pushfstring(L, "system error %d\n", error);
+}
+
+static void ll_unloadlib (void *lib) {
+  FreeLibrary((HINSTANCE)lib);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+  HINSTANCE lib = LoadLibraryA(path);
+  if (lib == NULL) pusherror(L);
+  return lib;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+  lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);
+  if (f == NULL) pusherror(L);
+  return f;
+}
+
+/* }====================================================== */
+
+
+
+#elif defined(LUA_DL_DYLD)
+/*
+** {======================================================================
+** Native Mac OS X / Darwin Implementation
+** =======================================================================
+*/
+
+#include <mach-o/dyld.h>
+
+
+/* Mac appends a `_' before C function names */
+#undef POF
+#define POF	"_" LUA_POF
+
+
+static void pusherror (lua_State *L) {
+  const char *err_str;
+  const char *err_file;
+  NSLinkEditErrors err;
+  int err_num;
+  NSLinkEditError(&err, &err_num, &err_file, &err_str);
+  lua_pushstring(L, err_str);
+}
+
+
+static const char *errorfromcode (NSObjectFileImageReturnCode ret) {
+  switch (ret) {
+    case NSObjectFileImageInappropriateFile:
+      return "file is not a bundle";
+    case NSObjectFileImageArch:
+      return "library is for wrong CPU type";
+    case NSObjectFileImageFormat:
+      return "bad format";
+    case NSObjectFileImageAccess:
+      return "cannot access file";
+    case NSObjectFileImageFailure:
+    default:
+      return "unable to load library";
+  }
+}
+
+
+static void ll_unloadlib (void *lib) {
+  NSUnLinkModule((NSModule)lib, NSUNLINKMODULE_OPTION_RESET_LAZY_REFERENCES);
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+  NSObjectFileImage img;
+  NSObjectFileImageReturnCode ret;
+  /* this would be a rare case, but prevents crashing if it happens */
+  if(!_dyld_present()) {
+    lua_pushliteral(L, "dyld not present");
+    return NULL;
+  }
+  ret = NSCreateObjectFileImageFromFile(path, &img);
+  if (ret == NSObjectFileImageSuccess) {
+    NSModule mod = NSLinkModule(img, path, NSLINKMODULE_OPTION_PRIVATE |
+                       NSLINKMODULE_OPTION_RETURN_ON_ERROR);
+    NSDestroyObjectFileImage(img);
+    if (mod == NULL) pusherror(L);
+    return mod;
+  }
+  lua_pushstring(L, errorfromcode(ret));
+  return NULL;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+  NSSymbol nss = NSLookupSymbolInModule((NSModule)lib, sym);
+  if (nss == NULL) {
+    lua_pushfstring(L, "symbol " LUA_QS " not found", sym);
+    return NULL;
+  }
+  return (lua_CFunction)NSAddressOfSymbol(nss);
+}
+
+/* }====================================================== */
+
+
+
+#else
+/*
+** {======================================================
+** Fallback for other systems
+** =======================================================
+*/
+
+#undef LIB_FAIL
+#define LIB_FAIL	"absent"
+
+
+#define DLMSG	"dynamic libraries not enabled; check your Lua installation"
+
+
+static void ll_unloadlib (void *lib) {
+  (void)lib;  /* to avoid warnings */
+}
+
+
+static void *ll_load (lua_State *L, const char *path) {
+  (void)path;  /* to avoid warnings */
+  lua_pushliteral(L, DLMSG);
+  return NULL;
+}
+
+
+static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
+  (void)lib; (void)sym;  /* to avoid warnings */
+  lua_pushliteral(L, DLMSG);
+  return NULL;
+}
+
+/* }====================================================== */
+#endif
+
+
+
+static void **ll_register (lua_State *L, const char *path) {
+  void **plib;
+  lua_pushfstring(L, "%s%s", LIBPREFIX, path);
+  lua_gettable(L, LUA_REGISTRYINDEX);  /* check library in registry? */
+  if (!lua_isnil(L, -1))  /* is there an entry? */
+    plib = (void **)lua_touserdata(L, -1);
+  else {  /* no entry yet; create one */
+    lua_pop(L, 1);
+    plib = (void **)lua_newuserdata(L, sizeof(const void *));
+    *plib = NULL;
+    luaL_getmetatable(L, "_LOADLIB");
+    lua_setmetatable(L, -2);
+    lua_pushfstring(L, "%s%s", LIBPREFIX, path);
+    lua_pushvalue(L, -2);
+    lua_settable(L, LUA_REGISTRYINDEX);
+  }
+  return plib;
+}
+
+
+/*
+** __gc tag method: calls library's `ll_unloadlib' function with the lib
+** handle
+*/
+static int gctm (lua_State *L) {
+  void **lib = (void **)luaL_checkudata(L, 1, "_LOADLIB");
+  if (*lib) ll_unloadlib(*lib);
+  *lib = NULL;  /* mark library as closed */
+  return 0;
+}
+
+
+static int ll_loadfunc (lua_State *L, const char *path, const char *sym) {
+  void **reg = ll_register(L, path);
+  if (*reg == NULL) *reg = ll_load(L, path);
+  if (*reg == NULL)
+    return ERRLIB;  /* unable to load library */
+  else {
+    lua_CFunction f = ll_sym(L, *reg, sym);
+    if (f == NULL)
+      return ERRFUNC;  /* unable to find function */
+    lua_pushcfunction(L, f);
+    return 0;  /* return function */
+  }
+}
+
+
+static int ll_loadlib (lua_State *L) {
+  const char *path = luaL_checkstring(L, 1);
+  const char *init = luaL_checkstring(L, 2);
+  int stat = ll_loadfunc(L, path, init);
+  if (stat == 0)  /* no errors? */
+    return 1;  /* return the loaded function */
+  else {  /* error; error message is on stack top */
+    lua_pushnil(L);
+    lua_insert(L, -2);
+    lua_pushstring(L, (stat == ERRLIB) ?  LIB_FAIL : "init");
+    return 3;  /* return nil, error message, and where */
+  }
+}
+
+
+
+/*
+** {======================================================
+** 'require' function
+** =======================================================
+*/
+
+
+static int readable (const char *filename) {
+  FILE *f = fopen(filename, "r");  /* try to open file */
+  if (f == NULL) return 0;  /* open failed */
+  fclose(f);
+  return 1;
+}
+
+
+static const char *pushnexttemplate (lua_State *L, const char *path) {
+  const char *l;
+  while (*path == *LUA_PATHSEP) path++;  /* skip separators */
+  if (*path == '\0') return NULL;  /* no more templates */
+  l = strchr(path, *LUA_PATHSEP);  /* find next separator */
+  if (l == NULL) l = path + strlen(path);
+  lua_pushlstring(L, path, l - path);  /* template */
+  return l;
+}
+
+
+static const char *findfile (lua_State *L, const char *name,
+                                           const char *pname) {
+  const char *path;
+  name = luaL_gsub(L, name, ".", LUA_DIRSEP);
+  lua_getfield(L, LUA_ENVIRONINDEX, pname);
+  path = lua_tostring(L, -1);
+  if (path == NULL)
+    luaL_error(L, LUA_QL("package.%s") " must be a string", pname);
+  lua_pushliteral(L, "");  /* error accumulator */
+  while ((path = pushnexttemplate(L, path)) != NULL) {
+    const char *filename;
+    filename = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name);
+    lua_remove(L, -2);  /* remove path template */
+    if (readable(filename))  /* does file exist and is readable? */
+      return filename;  /* return that file name */
+    lua_pushfstring(L, "\n\tno file " LUA_QS, filename);
+    lua_remove(L, -2);  /* remove file name */
+    lua_concat(L, 2);  /* add entry to possible error message */
+  }
+  return NULL;  /* not found */
+}
+
+
+static void loaderror (lua_State *L, const char *filename) {
+  luaL_error(L, "error loading module " LUA_QS " from file " LUA_QS ":\n\t%s",
+                lua_tostring(L, 1), filename, lua_tostring(L, -1));
+}
+
+
+static int loader_Lua (lua_State *L) {
+  const char *filename;
+  const char *name = luaL_checkstring(L, 1);
+  filename = findfile(L, name, "path");
+  if (filename == NULL) return 1;  /* library not found in this path */
+  if (luaL_loadfile(L, filename) != 0)
+    loaderror(L, filename);
+  return 1;  /* library loaded successfully */
+}
+
+
+static const char *mkfuncname (lua_State *L, const char *modname) {
+  const char *funcname;
+  const char *mark = strchr(modname, *LUA_IGMARK);
+  if (mark) modname = mark + 1;
+  funcname = luaL_gsub(L, modname, ".", LUA_OFSEP);
+  funcname = lua_pushfstring(L, POF"%s", funcname);
+  lua_remove(L, -2);  /* remove 'gsub' result */
+  return funcname;
+}
+
+
+static int loader_C (lua_State *L) {
+  const char *funcname;
+  const char *name = luaL_checkstring(L, 1);
+  const char *filename = findfile(L, name, "cpath");
+  if (filename == NULL) return 1;  /* library not found in this path */
+  funcname = mkfuncname(L, name);
+  if (ll_loadfunc(L, filename, funcname) != 0)
+    loaderror(L, filename);
+  return 1;  /* library loaded successfully */
+}
+
+
+static int loader_Croot (lua_State *L) {
+  const char *funcname;
+  const char *filename;
+  const char *name = luaL_checkstring(L, 1);
+  const char *p = strchr(name, '.');
+  int stat;
+  if (p == NULL) return 0;  /* is root */
+  lua_pushlstring(L, name, p - name);
+  filename = findfile(L, lua_tostring(L, -1), "cpath");
+  if (filename == NULL) return 1;  /* root not found */
+  funcname = mkfuncname(L, name);
+  if ((stat = ll_loadfunc(L, filename, funcname)) != 0) {
+    if (stat != ERRFUNC) loaderror(L, filename);  /* real error */
+    lua_pushfstring(L, "\n\tno module " LUA_QS " in file " LUA_QS,
+                       name, filename);
+    return 1;  /* function not found */
+  }
+  return 1;
+}
+
+
+static int loader_preload (lua_State *L) {
+  const char *name = luaL_checkstring(L, 1);
+  lua_getfield(L, LUA_ENVIRONINDEX, "preload");
+  if (!lua_istable(L, -1))
+    luaL_error(L, LUA_QL("package.preload") " must be a table");
+  lua_getfield(L, -1, name);
+  if (lua_isnil(L, -1))  /* not found? */
+    lua_pushfstring(L, "\n\tno field package.preload['%s']", name);
+  return 1;
+}
+
+
+static const int sentinel_ = 0;
+#define sentinel	((void *)&sentinel_)
+
+
+static int ll_require (lua_State *L) {
+  const char *name = luaL_checkstring(L, 1);
+  int i;
+  lua_settop(L, 1);  /* _LOADED table will be at index 2 */
+  lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
+  lua_getfield(L, 2, name);
+  if (lua_toboolean(L, -1)) {  /* is it there? */
+    if (lua_touserdata(L, -1) == sentinel)  /* check loops */
+      luaL_error(L, "loop or previous error loading module " LUA_QS, name);
+    return 1;  /* package is already loaded */
+  }
+  /* else must load it; iterate over available loaders */
+  lua_getfield(L, LUA_ENVIRONINDEX, "loaders");
+  if (!lua_istable(L, -1))
+    luaL_error(L, LUA_QL("package.loaders") " must be a table");
+  lua_pushliteral(L, "");  /* error message accumulator */
+  for (i=1; ; i++) {
+    lua_rawgeti(L, -2, i);  /* get a loader */
+    if (lua_isnil(L, -1))
+      luaL_error(L, "module " LUA_QS " not found:%s",
+                    name, lua_tostring(L, -2));
+    lua_pushstring(L, name);
+    lua_call(L, 1, 1);  /* call it */
+    if (lua_isfunction(L, -1))  /* did it find module? */
+      break;  /* module loaded successfully */
+    else if (lua_isstring(L, -1))  /* loader returned error message? */
+      lua_concat(L, 2);  /* accumulate it */
+    else
+      lua_pop(L, 1);
+  }
+  lua_pushlightuserdata(L, sentinel);
+  lua_setfield(L, 2, name);  /* _LOADED[name] = sentinel */
+  lua_pushstring(L, name);  /* pass name as argument to module */
+  lua_call(L, 1, 1);  /* run loaded module */
+  if (!lua_isnil(L, -1))  /* non-nil return? */
+    lua_setfield(L, 2, name);  /* _LOADED[name] = returned value */
+  lua_getfield(L, 2, name);
+  if (lua_touserdata(L, -1) == sentinel) {   /* module did not set a value? */
+    lua_pushboolean(L, 1);  /* use true as result */
+    lua_pushvalue(L, -1);  /* extra copy to be returned */
+    lua_setfield(L, 2, name);  /* _LOADED[name] = true */
+  }
+  return 1;
+}
+
+/* }====================================================== */
+
+
+
+/*
+** {======================================================
+** 'module' function
+** =======================================================
+*/
+  
+
+static void setfenv (lua_State *L) {
+  lua_Debug ar;
+  if (lua_getstack(L, 1, &ar) == 0 ||
+      lua_getinfo(L, "f", &ar) == 0 ||  /* get calling function */
+      lua_iscfunction(L, -1))
+    luaL_error(L, LUA_QL("module") " not called from a Lua function");
+  lua_pushvalue(L, -2);
+  lua_setfenv(L, -2);
+  lua_pop(L, 1);
+}
+
+
+static void dooptions (lua_State *L, int n) {
+  int i;
+  for (i = 2; i <= n; i++) {
+    lua_pushvalue(L, i);  /* get option (a function) */
+    lua_pushvalue(L, -2);  /* module */
+    lua_call(L, 1, 0);
+  }
+}
+
+
+static void modinit (lua_State *L, const char *modname) {
+  const char *dot;
+  lua_pushvalue(L, -1);
+  lua_setfield(L, -2, "_M");  /* module._M = module */
+  lua_pushstring(L, modname);
+  lua_setfield(L, -2, "_NAME");
+  dot = strrchr(modname, '.');  /* look for last dot in module name */
+  if (dot == NULL) dot = modname;
+  else dot++;
+  /* set _PACKAGE as package name (full module name minus last part) */
+  lua_pushlstring(L, modname, dot - modname);
+  lua_setfield(L, -2, "_PACKAGE");
+}
+
+
+static int ll_module (lua_State *L) {
+  const char *modname = luaL_checkstring(L, 1);
+  int loaded = lua_gettop(L) + 1;  /* index of _LOADED table */
+  lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
+  lua_getfield(L, loaded, modname);  /* get _LOADED[modname] */
+  if (!lua_istable(L, -1)) {  /* not found? */
+    lua_pop(L, 1);  /* remove previous result */
+    /* try global variable (and create one if it does not exist) */
+    if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)
+      return luaL_error(L, "name conflict for module " LUA_QS, modname);
+    lua_pushvalue(L, -1);
+    lua_setfield(L, loaded, modname);  /* _LOADED[modname] = new table */
+  }
+  /* check whether table already has a _NAME field */
+  lua_getfield(L, -1, "_NAME");
+  if (!lua_isnil(L, -1))  /* is table an initialized module? */
+    lua_pop(L, 1);
+  else {  /* no; initialize it */
+    lua_pop(L, 1);
+    modinit(L, modname);
+  }
+  lua_pushvalue(L, -1);
+  setfenv(L);
+  dooptions(L, loaded - 1);
+  return 0;
+}
+
+
+static int ll_seeall (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  if (!lua_getmetatable(L, 1)) {
+    lua_createtable(L, 0, 1); /* create new metatable */
+    lua_pushvalue(L, -1);
+    lua_setmetatable(L, 1);
+  }
+  lua_pushvalue(L, LUA_GLOBALSINDEX);
+  lua_setfield(L, -2, "__index");  /* mt.__index = _G */
+  return 0;
+}
+
+
+/* }====================================================== */
+
+
+
+/* auxiliary mark (for internal use) */
+#define AUXMARK		"\1"
+
+static void setpath (lua_State *L, const char *fieldname, const char *envname,
+                                   const char *def) {
+  const char *path = getenv(envname);
+  if (path == NULL)  /* no environment variable? */
+    lua_pushstring(L, def);  /* use default */
+  else {
+    /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */
+    path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,
+                              LUA_PATHSEP AUXMARK LUA_PATHSEP);
+    luaL_gsub(L, path, AUXMARK, def);
+    lua_remove(L, -2);
+  }
+  setprogdir(L);
+  lua_setfield(L, -2, fieldname);
+}
+
+
+static const luaL_Reg pk_funcs[] = {
+  {"loadlib", ll_loadlib},
+  {"seeall", ll_seeall},
+  {NULL, NULL}
+};
+
+
+static const luaL_Reg ll_funcs[] = {
+  {"module", ll_module},
+  {"require", ll_require},
+  {NULL, NULL}
+};
+
+
+static const lua_CFunction loaders[] =
+  {loader_preload, loader_Lua, loader_C, loader_Croot, NULL};
+
+
+LUALIB_API int luaopen_package (lua_State *L) {
+  int i;
+  /* create new type _LOADLIB */
+  luaL_newmetatable(L, "_LOADLIB");
+  lua_pushcfunction(L, gctm);
+  lua_setfield(L, -2, "__gc");
+  /* create `package' table */
+  luaL_register(L, LUA_LOADLIBNAME, pk_funcs);
+#if defined(LUA_COMPAT_LOADLIB) 
+  lua_getfield(L, -1, "loadlib");
+  lua_setfield(L, LUA_GLOBALSINDEX, "loadlib");
+#endif
+  lua_pushvalue(L, -1);
+  lua_replace(L, LUA_ENVIRONINDEX);
+  /* create `loaders' table */
+  lua_createtable(L, sizeof(loaders)/sizeof(loaders[0]) - 1, 0);
+  /* fill it with pre-defined loaders */
+  for (i=0; loaders[i] != NULL; i++) {
+    lua_pushcfunction(L, loaders[i]);
+    lua_rawseti(L, -2, i+1);
+  }
+  lua_setfield(L, -2, "loaders");  /* put it in field `loaders' */
+  setpath(L, "path", LUA_PATH, LUA_PATH_DEFAULT);  /* set field `path' */
+  setpath(L, "cpath", LUA_CPATH, LUA_CPATH_DEFAULT); /* set field `cpath' */
+  /* store config information */
+  lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATHSEP "\n" LUA_PATH_MARK "\n"
+                     LUA_EXECDIR "\n" LUA_IGMARK);
+  lua_setfield(L, -2, "config");
+  /* set field `loaded' */
+  luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 2);
+  lua_setfield(L, -2, "loaded");
+  /* set field `preload' */
+  lua_newtable(L);
+  lua_setfield(L, -2, "preload");
+  lua_pushvalue(L, LUA_GLOBALSINDEX);
+  luaL_register(L, NULL, ll_funcs);  /* open lib into global table */
+  lua_pop(L, 1);
+  return 1;  /* return 'package' table */
+}
+
diff --git a/redis-stable/deps/lua/src/lobject.c b/redis-stable/deps/lua/src/lobject.c
new file mode 100644
index 00000000..4ff50732
--- /dev/null
+++ b/redis-stable/deps/lua/src/lobject.c
@@ -0,0 +1,214 @@
+/*
+** $Id: lobject.c,v 2.22.1.1 2007/12/27 13:02:25 roberto Exp $
+** Some generic functions over Lua objects
+** See Copyright Notice in lua.h
+*/
+
+#include <ctype.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lobject_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldo.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "lvm.h"
+
+
+
+const TValue luaO_nilobject_ = {{NULL}, LUA_TNIL};
+
+
+/*
+** converts an integer to a "floating point byte", represented as
+** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if
+** eeeee != 0 and (xxx) otherwise.
+*/
+int luaO_int2fb (unsigned int x) {
+  int e = 0;  /* expoent */
+  while (x >= 16) {
+    x = (x+1) >> 1;
+    e++;
+  }
+  if (x < 8) return x;
+  else return ((e+1) << 3) | (cast_int(x) - 8);
+}
+
+
+/* converts back */
+int luaO_fb2int (int x) {
+  int e = (x >> 3) & 31;
+  if (e == 0) return x;
+  else return ((x & 7)+8) << (e - 1);
+}
+
+
+int luaO_log2 (unsigned int x) {
+  static const lu_byte log_2[256] = {
+    0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
+    6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
+    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
+    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
+    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
+    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
+  };
+  int l = -1;
+  while (x >= 256) { l += 8; x >>= 8; }
+  return l + log_2[x];
+
+}
+
+
+int luaO_rawequalObj (const TValue *t1, const TValue *t2) {
+  if (ttype(t1) != ttype(t2)) return 0;
+  else switch (ttype(t1)) {
+    case LUA_TNIL:
+      return 1;
+    case LUA_TNUMBER:
+      return luai_numeq(nvalue(t1), nvalue(t2));
+    case LUA_TBOOLEAN:
+      return bvalue(t1) == bvalue(t2);  /* boolean true must be 1 !! */
+    case LUA_TLIGHTUSERDATA:
+      return pvalue(t1) == pvalue(t2);
+    default:
+      lua_assert(iscollectable(t1));
+      return gcvalue(t1) == gcvalue(t2);
+  }
+}
+
+
+int luaO_str2d (const char *s, lua_Number *result) {
+  char *endptr;
+  *result = lua_str2number(s, &endptr);
+  if (endptr == s) return 0;  /* conversion failed */
+  if (*endptr == 'x' || *endptr == 'X')  /* maybe an hexadecimal constant? */
+    *result = cast_num(strtoul(s, &endptr, 16));
+  if (*endptr == '\0') return 1;  /* most common case */
+  while (isspace(cast(unsigned char, *endptr))) endptr++;
+  if (*endptr != '\0') return 0;  /* invalid trailing characters? */
+  return 1;
+}
+
+
+
+static void pushstr (lua_State *L, const char *str) {
+  setsvalue2s(L, L->top, luaS_new(L, str));
+  incr_top(L);
+}
+
+
+/* this function handles only `%d', `%c', %f, %p, and `%s' formats */
+const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
+  int n = 1;
+  pushstr(L, "");
+  for (;;) {
+    const char *e = strchr(fmt, '%');
+    if (e == NULL) break;
+    setsvalue2s(L, L->top, luaS_newlstr(L, fmt, e-fmt));
+    incr_top(L);
+    switch (*(e+1)) {
+      case 's': {
+        const char *s = va_arg(argp, char *);
+        if (s == NULL) s = "(null)";
+        pushstr(L, s);
+        break;
+      }
+      case 'c': {
+        char buff[2];
+        buff[0] = cast(char, va_arg(argp, int));
+        buff[1] = '\0';
+        pushstr(L, buff);
+        break;
+      }
+      case 'd': {
+        setnvalue(L->top, cast_num(va_arg(argp, int)));
+        incr_top(L);
+        break;
+      }
+      case 'f': {
+        setnvalue(L->top, cast_num(va_arg(argp, l_uacNumber)));
+        incr_top(L);
+        break;
+      }
+      case 'p': {
+        char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */
+        sprintf(buff, "%p", va_arg(argp, void *));
+        pushstr(L, buff);
+        break;
+      }
+      case '%': {
+        pushstr(L, "%");
+        break;
+      }
+      default: {
+        char buff[3];
+        buff[0] = '%';
+        buff[1] = *(e+1);
+        buff[2] = '\0';
+        pushstr(L, buff);
+        break;
+      }
+    }
+    n += 2;
+    fmt = e+2;
+  }
+  pushstr(L, fmt);
+  luaV_concat(L, n+1, cast_int(L->top - L->base) - 1);
+  L->top -= n;
+  return svalue(L->top - 1);
+}
+
+
+const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {
+  const char *msg;
+  va_list argp;
+  va_start(argp, fmt);
+  msg = luaO_pushvfstring(L, fmt, argp);
+  va_end(argp);
+  return msg;
+}
+
+
+void luaO_chunkid (char *out, const char *source, size_t bufflen) {
+  if (*source == '=') {
+    strncpy(out, source+1, bufflen);  /* remove first char */
+    out[bufflen-1] = '\0';  /* ensures null termination */
+  }
+  else {  /* out = "source", or "...source" */
+    if (*source == '@') {
+      size_t l;
+      source++;  /* skip the `@' */
+      bufflen -= sizeof(" '...' ");
+      l = strlen(source);
+      strcpy(out, "");
+      if (l > bufflen) {
+        source += (l-bufflen);  /* get last part of file name */
+        strcat(out, "...");
+      }
+      strcat(out, source);
+    }
+    else {  /* out = [string "string"] */
+      size_t len = strcspn(source, "\n\r");  /* stop at first newline */
+      bufflen -= sizeof(" [string \"...\"] ");
+      if (len > bufflen) len = bufflen;
+      strcpy(out, "[string \"");
+      if (source[len] != '\0') {  /* must truncate? */
+        strncat(out, source, len);
+        strcat(out, "...");
+      }
+      else
+        strcat(out, source);
+      strcat(out, "\"]");
+    }
+  }
+}
diff --git a/redis-stable/deps/lua/src/lobject.h b/redis-stable/deps/lua/src/lobject.h
new file mode 100644
index 00000000..f1e447ef
--- /dev/null
+++ b/redis-stable/deps/lua/src/lobject.h
@@ -0,0 +1,381 @@
+/*
+** $Id: lobject.h,v 2.20.1.2 2008/08/06 13:29:48 roberto Exp $
+** Type definitions for Lua objects
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lobject_h
+#define lobject_h
+
+
+#include <stdarg.h>
+
+
+#include "llimits.h"
+#include "lua.h"
+
+
+/* tags for values visible from Lua */
+#define LAST_TAG	LUA_TTHREAD
+
+#define NUM_TAGS	(LAST_TAG+1)
+
+
+/*
+** Extra tags for non-values
+*/
+#define LUA_TPROTO	(LAST_TAG+1)
+#define LUA_TUPVAL	(LAST_TAG+2)
+#define LUA_TDEADKEY	(LAST_TAG+3)
+
+
+/*
+** Union of all collectable objects
+*/
+typedef union GCObject GCObject;
+
+
+/*
+** Common Header for all collectable objects (in macro form, to be
+** included in other objects)
+*/
+#define CommonHeader	GCObject *next; lu_byte tt; lu_byte marked
+
+
+/*
+** Common header in struct form
+*/
+typedef struct GCheader {
+  CommonHeader;
+} GCheader;
+
+
+
+
+/*
+** Union of all Lua values
+*/
+typedef union {
+  GCObject *gc;
+  void *p;
+  lua_Number n;
+  int b;
+} Value;
+
+
+/*
+** Tagged Values
+*/
+
+#define TValuefields	Value value; int tt
+
+typedef struct lua_TValue {
+  TValuefields;
+} TValue;
+
+
+/* Macros to test type */
+#define ttisnil(o)	(ttype(o) == LUA_TNIL)
+#define ttisnumber(o)	(ttype(o) == LUA_TNUMBER)
+#define ttisstring(o)	(ttype(o) == LUA_TSTRING)
+#define ttistable(o)	(ttype(o) == LUA_TTABLE)
+#define ttisfunction(o)	(ttype(o) == LUA_TFUNCTION)
+#define ttisboolean(o)	(ttype(o) == LUA_TBOOLEAN)
+#define ttisuserdata(o)	(ttype(o) == LUA_TUSERDATA)
+#define ttisthread(o)	(ttype(o) == LUA_TTHREAD)
+#define ttislightuserdata(o)	(ttype(o) == LUA_TLIGHTUSERDATA)
+
+/* Macros to access values */
+#define ttype(o)	((o)->tt)
+#define gcvalue(o)	check_exp(iscollectable(o), (o)->value.gc)
+#define pvalue(o)	check_exp(ttislightuserdata(o), (o)->value.p)
+#define nvalue(o)	check_exp(ttisnumber(o), (o)->value.n)
+#define rawtsvalue(o)	check_exp(ttisstring(o), &(o)->value.gc->ts)
+#define tsvalue(o)	(&rawtsvalue(o)->tsv)
+#define rawuvalue(o)	check_exp(ttisuserdata(o), &(o)->value.gc->u)
+#define uvalue(o)	(&rawuvalue(o)->uv)
+#define clvalue(o)	check_exp(ttisfunction(o), &(o)->value.gc->cl)
+#define hvalue(o)	check_exp(ttistable(o), &(o)->value.gc->h)
+#define bvalue(o)	check_exp(ttisboolean(o), (o)->value.b)
+#define thvalue(o)	check_exp(ttisthread(o), &(o)->value.gc->th)
+
+#define l_isfalse(o)	(ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0))
+
+/*
+** for internal debug only
+*/
+#define checkconsistency(obj) \
+  lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt))
+
+#define checkliveness(g,obj) \
+  lua_assert(!iscollectable(obj) || \
+  ((ttype(obj) == (obj)->value.gc->gch.tt) && !isdead(g, (obj)->value.gc)))
+
+
+/* Macros to set values */
+#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)
+
+#define setnvalue(obj,x) \
+  { TValue *i_o=(obj); i_o->value.n=(x); i_o->tt=LUA_TNUMBER; }
+
+#define setpvalue(obj,x) \
+  { TValue *i_o=(obj); i_o->value.p=(x); i_o->tt=LUA_TLIGHTUSERDATA; }
+
+#define setbvalue(obj,x) \
+  { TValue *i_o=(obj); i_o->value.b=(x); i_o->tt=LUA_TBOOLEAN; }
+
+#define setsvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TSTRING; \
+    checkliveness(G(L),i_o); }
+
+#define setuvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TUSERDATA; \
+    checkliveness(G(L),i_o); }
+
+#define setthvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTHREAD; \
+    checkliveness(G(L),i_o); }
+
+#define setclvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TFUNCTION; \
+    checkliveness(G(L),i_o); }
+
+#define sethvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTABLE; \
+    checkliveness(G(L),i_o); }
+
+#define setptvalue(L,obj,x) \
+  { TValue *i_o=(obj); \
+    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TPROTO; \
+    checkliveness(G(L),i_o); }
+
+
+
+
+#define setobj(L,obj1,obj2) \
+  { const TValue *o2=(obj2); TValue *o1=(obj1); \
+    o1->value = o2->value; o1->tt=o2->tt; \
+    checkliveness(G(L),o1); }
+
+
+/*
+** different types of sets, according to destination
+*/
+
+/* from stack to (same) stack */
+#define setobjs2s	setobj
+/* to stack (not from same stack) */
+#define setobj2s	setobj
+#define setsvalue2s	setsvalue
+#define sethvalue2s	sethvalue
+#define setptvalue2s	setptvalue
+/* from table to same table */
+#define setobjt2t	setobj
+/* to table */
+#define setobj2t	setobj
+/* to new object */
+#define setobj2n	setobj
+#define setsvalue2n	setsvalue
+
+#define setttype(obj, tt) (ttype(obj) = (tt))
+
+
+#define iscollectable(o)	(ttype(o) >= LUA_TSTRING)
+
+
+
+typedef TValue *StkId;  /* index to stack elements */
+
+
+/*
+** String headers for string table
+*/
+typedef union TString {
+  L_Umaxalign dummy;  /* ensures maximum alignment for strings */
+  struct {
+    CommonHeader;
+    lu_byte reserved;
+    unsigned int hash;
+    size_t len;
+  } tsv;
+} TString;
+
+
+#define getstr(ts)	cast(const char *, (ts) + 1)
+#define svalue(o)       getstr(rawtsvalue(o))
+
+
+
+typedef union Udata {
+  L_Umaxalign dummy;  /* ensures maximum alignment for `local' udata */
+  struct {
+    CommonHeader;
+    struct Table *metatable;
+    struct Table *env;
+    size_t len;
+  } uv;
+} Udata;
+
+
+
+
+/*
+** Function Prototypes
+*/
+typedef struct Proto {
+  CommonHeader;
+  TValue *k;  /* constants used by the function */
+  Instruction *code;
+  struct Proto **p;  /* functions defined inside the function */
+  int *lineinfo;  /* map from opcodes to source lines */
+  struct LocVar *locvars;  /* information about local variables */
+  TString **upvalues;  /* upvalue names */
+  TString  *source;
+  int sizeupvalues;
+  int sizek;  /* size of `k' */
+  int sizecode;
+  int sizelineinfo;
+  int sizep;  /* size of `p' */
+  int sizelocvars;
+  int linedefined;
+  int lastlinedefined;
+  GCObject *gclist;
+  lu_byte nups;  /* number of upvalues */
+  lu_byte numparams;
+  lu_byte is_vararg;
+  lu_byte maxstacksize;
+} Proto;
+
+
+/* masks for new-style vararg */
+#define VARARG_HASARG		1
+#define VARARG_ISVARARG		2
+#define VARARG_NEEDSARG		4
+
+
+typedef struct LocVar {
+  TString *varname;
+  int startpc;  /* first point where variable is active */
+  int endpc;    /* first point where variable is dead */
+} LocVar;
+
+
+
+/*
+** Upvalues
+*/
+
+typedef struct UpVal {
+  CommonHeader;
+  TValue *v;  /* points to stack or to its own value */
+  union {
+    TValue value;  /* the value (when closed) */
+    struct {  /* double linked list (when open) */
+      struct UpVal *prev;
+      struct UpVal *next;
+    } l;
+  } u;
+} UpVal;
+
+
+/*
+** Closures
+*/
+
+#define ClosureHeader \
+	CommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist; \
+	struct Table *env
+
+typedef struct CClosure {
+  ClosureHeader;
+  lua_CFunction f;
+  TValue upvalue[1];
+} CClosure;
+
+
+typedef struct LClosure {
+  ClosureHeader;
+  struct Proto *p;
+  UpVal *upvals[1];
+} LClosure;
+
+
+typedef union Closure {
+  CClosure c;
+  LClosure l;
+} Closure;
+
+
+#define iscfunction(o)	(ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)
+#define isLfunction(o)	(ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC)
+
+
+/*
+** Tables
+*/
+
+typedef union TKey {
+  struct {
+    TValuefields;
+    struct Node *next;  /* for chaining */
+  } nk;
+  TValue tvk;
+} TKey;
+
+
+typedef struct Node {
+  TValue i_val;
+  TKey i_key;
+} Node;
+
+
+typedef struct Table {
+  CommonHeader;
+  lu_byte flags;  /* 1<<p means tagmethod(p) is not present */ 
+  lu_byte lsizenode;  /* log2 of size of `node' array */
+  struct Table *metatable;
+  TValue *array;  /* array part */
+  Node *node;
+  Node *lastfree;  /* any free position is before this position */
+  GCObject *gclist;
+  int sizearray;  /* size of `array' array */
+} Table;
+
+
+
+/*
+** `module' operation for hashing (size is always a power of 2)
+*/
+#define lmod(s,size) \
+	(check_exp((size&(size-1))==0, (cast(int, (s) & ((size)-1)))))
+
+
+#define twoto(x)	(1<<(x))
+#define sizenode(t)	(twoto((t)->lsizenode))
+
+
+#define luaO_nilobject		(&luaO_nilobject_)
+
+LUAI_DATA const TValue luaO_nilobject_;
+
+#define ceillog2(x)	(luaO_log2((x)-1) + 1)
+
+LUAI_FUNC int luaO_log2 (unsigned int x);
+LUAI_FUNC int luaO_int2fb (unsigned int x);
+LUAI_FUNC int luaO_fb2int (int x);
+LUAI_FUNC int luaO_rawequalObj (const TValue *t1, const TValue *t2);
+LUAI_FUNC int luaO_str2d (const char *s, lua_Number *result);
+LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt,
+                                                       va_list argp);
+LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...);
+LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len);
+
+
+#endif
+
diff --git a/redis-stable/deps/lua/src/lopcodes.c b/redis-stable/deps/lua/src/lopcodes.c
new file mode 100644
index 00000000..4cc74523
--- /dev/null
+++ b/redis-stable/deps/lua/src/lopcodes.c
@@ -0,0 +1,102 @@
+/*
+** $Id: lopcodes.c,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
+** See Copyright Notice in lua.h
+*/
+
+
+#define lopcodes_c
+#define LUA_CORE
+
+
+#include "lopcodes.h"
+
+
+/* ORDER OP */
+
+const char *const luaP_opnames[NUM_OPCODES+1] = {
+  "MOVE",
+  "LOADK",
+  "LOADBOOL",
+  "LOADNIL",
+  "GETUPVAL",
+  "GETGLOBAL",
+  "GETTABLE",
+  "SETGLOBAL",
+  "SETUPVAL",
+  "SETTABLE",
+  "NEWTABLE",
+  "SELF",
+  "ADD",
+  "SUB",
+  "MUL",
+  "DIV",
+  "MOD",
+  "POW",
+  "UNM",
+  "NOT",
+  "LEN",
+  "CONCAT",
+  "JMP",
+  "EQ",
+  "LT",
+  "LE",
+  "TEST",
+  "TESTSET",
+  "CALL",
+  "TAILCALL",
+  "RETURN",
+  "FORLOOP",
+  "FORPREP",
+  "TFORLOOP",
+  "SETLIST",
+  "CLOSE",
+  "CLOSURE",
+  "VARARG",
+  NULL
+};
+
+
+#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m))
+
+const lu_byte luaP_opmodes[NUM_OPCODES] = {
+/*       T  A    B       C     mode		   opcode	*/
+  opmode(0, 1, OpArgR, OpArgN, iABC) 		/* OP_MOVE */
+ ,opmode(0, 1, OpArgK, OpArgN, iABx)		/* OP_LOADK */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_LOADBOOL */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_LOADNIL */
+ ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_GETUPVAL */
+ ,opmode(0, 1, OpArgK, OpArgN, iABx)		/* OP_GETGLOBAL */
+ ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_GETTABLE */
+ ,opmode(0, 0, OpArgK, OpArgN, iABx)		/* OP_SETGLOBAL */
+ ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_SETUPVAL */
+ ,opmode(0, 0, OpArgK, OpArgK, iABC)		/* OP_SETTABLE */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_NEWTABLE */
+ ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_SELF */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_ADD */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_SUB */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MUL */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_DIV */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MOD */
+ ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_POW */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_UNM */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_NOT */
+ ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_LEN */
+ ,opmode(0, 1, OpArgR, OpArgR, iABC)		/* OP_CONCAT */
+ ,opmode(0, 0, OpArgR, OpArgN, iAsBx)		/* OP_JMP */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_EQ */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LT */
+ ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LE */
+ ,opmode(1, 1, OpArgR, OpArgU, iABC)		/* OP_TEST */
+ ,opmode(1, 1, OpArgR, OpArgU, iABC)		/* OP_TESTSET */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_CALL */
+ ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_TAILCALL */
+ ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_RETURN */
+ ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORLOOP */
+ ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORPREP */
+ ,opmode(1, 0, OpArgN, OpArgU, iABC)		/* OP_TFORLOOP */
+ ,opmode(0, 0, OpArgU, OpArgU, iABC)		/* OP_SETLIST */
+ ,opmode(0, 0, OpArgN, OpArgN, iABC)		/* OP_CLOSE */
+ ,opmode(0, 1, OpArgU, OpArgN, iABx)		/* OP_CLOSURE */
+ ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_VARARG */
+};
+
diff --git a/redis-stable/deps/lua/src/lopcodes.h b/redis-stable/deps/lua/src/lopcodes.h
new file mode 100644
index 00000000..41224d6e
--- /dev/null
+++ b/redis-stable/deps/lua/src/lopcodes.h
@@ -0,0 +1,268 @@
+/*
+** $Id: lopcodes.h,v 1.125.1.1 2007/12/27 13:02:25 roberto Exp $
+** Opcodes for Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lopcodes_h
+#define lopcodes_h
+
+#include "llimits.h"
+
+
+/*===========================================================================
+  We assume that instructions are unsigned numbers.
+  All instructions have an opcode in the first 6 bits.
+  Instructions can have the following fields:
+	`A' : 8 bits
+	`B' : 9 bits
+	`C' : 9 bits
+	`Bx' : 18 bits (`B' and `C' together)
+	`sBx' : signed Bx
+
+  A signed argument is represented in excess K; that is, the number
+  value is the unsigned value minus K. K is exactly the maximum value
+  for that argument (so that -max is represented by 0, and +max is
+  represented by 2*max), which is half the maximum for the corresponding
+  unsigned argument.
+===========================================================================*/
+
+
+enum OpMode {iABC, iABx, iAsBx};  /* basic instruction format */
+
+
+/*
+** size and position of opcode arguments.
+*/
+#define SIZE_C		9
+#define SIZE_B		9
+#define SIZE_Bx		(SIZE_C + SIZE_B)
+#define SIZE_A		8
+
+#define SIZE_OP		6
+
+#define POS_OP		0
+#define POS_A		(POS_OP + SIZE_OP)
+#define POS_C		(POS_A + SIZE_A)
+#define POS_B		(POS_C + SIZE_C)
+#define POS_Bx		POS_C
+
+
+/*
+** limits for opcode arguments.
+** we use (signed) int to manipulate most arguments,
+** so they must fit in LUAI_BITSINT-1 bits (-1 for sign)
+*/
+#if SIZE_Bx < LUAI_BITSINT-1
+#define MAXARG_Bx        ((1<<SIZE_Bx)-1)
+#define MAXARG_sBx        (MAXARG_Bx>>1)         /* `sBx' is signed */
+#else
+#define MAXARG_Bx        MAX_INT
+#define MAXARG_sBx        MAX_INT
+#endif
+
+
+#define MAXARG_A        ((1<<SIZE_A)-1)
+#define MAXARG_B        ((1<<SIZE_B)-1)
+#define MAXARG_C        ((1<<SIZE_C)-1)
+
+
+/* creates a mask with `n' 1 bits at position `p' */
+#define MASK1(n,p)	((~((~(Instruction)0)<<n))<<p)
+
+/* creates a mask with `n' 0 bits at position `p' */
+#define MASK0(n,p)	(~MASK1(n,p))
+
+/*
+** the following macros help to manipulate instructions
+*/
+
+#define GET_OPCODE(i)	(cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0)))
+#define SET_OPCODE(i,o)	((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \
+		((cast(Instruction, o)<<POS_OP)&MASK1(SIZE_OP,POS_OP))))
+
+#define GETARG_A(i)	(cast(int, ((i)>>POS_A) & MASK1(SIZE_A,0)))
+#define SETARG_A(i,u)	((i) = (((i)&MASK0(SIZE_A,POS_A)) | \
+		((cast(Instruction, u)<<POS_A)&MASK1(SIZE_A,POS_A))))
+
+#define GETARG_B(i)	(cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0)))
+#define SETARG_B(i,b)	((i) = (((i)&MASK0(SIZE_B,POS_B)) | \
+		((cast(Instruction, b)<<POS_B)&MASK1(SIZE_B,POS_B))))
+
+#define GETARG_C(i)	(cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0)))
+#define SETARG_C(i,b)	((i) = (((i)&MASK0(SIZE_C,POS_C)) | \
+		((cast(Instruction, b)<<POS_C)&MASK1(SIZE_C,POS_C))))
+
+#define GETARG_Bx(i)	(cast(int, ((i)>>POS_Bx) & MASK1(SIZE_Bx,0)))
+#define SETARG_Bx(i,b)	((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \
+		((cast(Instruction, b)<<POS_Bx)&MASK1(SIZE_Bx,POS_Bx))))
+
+#define GETARG_sBx(i)	(GETARG_Bx(i)-MAXARG_sBx)
+#define SETARG_sBx(i,b)	SETARG_Bx((i),cast(unsigned int, (b)+MAXARG_sBx))
+
+
+#define CREATE_ABC(o,a,b,c)	((cast(Instruction, o)<<POS_OP) \
+			| (cast(Instruction, a)<<POS_A) \
+			| (cast(Instruction, b)<<POS_B) \
+			| (cast(Instruction, c)<<POS_C))
+
+#define CREATE_ABx(o,a,bc)	((cast(Instruction, o)<<POS_OP) \
+			| (cast(Instruction, a)<<POS_A) \
+			| (cast(Instruction, bc)<<POS_Bx))
+
+
+/*
+** Macros to operate RK indices
+*/
+
+/* this bit 1 means constant (0 means register) */
+#define BITRK		(1 << (SIZE_B - 1))
+
+/* test whether value is a constant */
+#define ISK(x)		((x) & BITRK)
+
+/* gets the index of the constant */
+#define INDEXK(r)	((int)(r) & ~BITRK)
+
+#define MAXINDEXRK	(BITRK - 1)
+
+/* code a constant index as a RK value */
+#define RKASK(x)	((x) | BITRK)
+
+
+/*
+** invalid register that fits in 8 bits
+*/
+#define NO_REG		MAXARG_A
+
+
+/*
+** R(x) - register
+** Kst(x) - constant (in constant table)
+** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x)
+*/
+
+
+/*
+** grep "ORDER OP" if you change these enums
+*/
+
+typedef enum {
+/*----------------------------------------------------------------------
+name		args	description
+------------------------------------------------------------------------*/
+OP_MOVE,/*	A B	R(A) := R(B)					*/
+OP_LOADK,/*	A Bx	R(A) := Kst(Bx)					*/
+OP_LOADBOOL,/*	A B C	R(A) := (Bool)B; if (C) pc++			*/
+OP_LOADNIL,/*	A B	R(A) := ... := R(B) := nil			*/
+OP_GETUPVAL,/*	A B	R(A) := UpValue[B]				*/
+
+OP_GETGLOBAL,/*	A Bx	R(A) := Gbl[Kst(Bx)]				*/
+OP_GETTABLE,/*	A B C	R(A) := R(B)[RK(C)]				*/
+
+OP_SETGLOBAL,/*	A Bx	Gbl[Kst(Bx)] := R(A)				*/
+OP_SETUPVAL,/*	A B	UpValue[B] := R(A)				*/
+OP_SETTABLE,/*	A B C	R(A)[RK(B)] := RK(C)				*/
+
+OP_NEWTABLE,/*	A B C	R(A) := {} (size = B,C)				*/
+
+OP_SELF,/*	A B C	R(A+1) := R(B); R(A) := R(B)[RK(C)]		*/
+
+OP_ADD,/*	A B C	R(A) := RK(B) + RK(C)				*/
+OP_SUB,/*	A B C	R(A) := RK(B) - RK(C)				*/
+OP_MUL,/*	A B C	R(A) := RK(B) * RK(C)				*/
+OP_DIV,/*	A B C	R(A) := RK(B) / RK(C)				*/
+OP_MOD,/*	A B C	R(A) := RK(B) % RK(C)				*/
+OP_POW,/*	A B C	R(A) := RK(B) ^ RK(C)				*/
+OP_UNM,/*	A B	R(A) := -R(B)					*/
+OP_NOT,/*	A B	R(A) := not R(B)				*/
+OP_LEN,/*	A B	R(A) := length of R(B)				*/
+
+OP_CONCAT,/*	A B C	R(A) := R(B).. ... ..R(C)			*/
+
+OP_JMP,/*	sBx	pc+=sBx					*/
+
+OP_EQ,/*	A B C	if ((RK(B) == RK(C)) ~= A) then pc++		*/
+OP_LT,/*	A B C	if ((RK(B) <  RK(C)) ~= A) then pc++  		*/
+OP_LE,/*	A B C	if ((RK(B) <= RK(C)) ~= A) then pc++  		*/
+
+OP_TEST,/*	A C	if not (R(A) <=> C) then pc++			*/ 
+OP_TESTSET,/*	A B C	if (R(B) <=> C) then R(A) := R(B) else pc++	*/ 
+
+OP_CALL,/*	A B C	R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */
+OP_TAILCALL,/*	A B C	return R(A)(R(A+1), ... ,R(A+B-1))		*/
+OP_RETURN,/*	A B	return R(A), ... ,R(A+B-2)	(see note)	*/
+
+OP_FORLOOP,/*	A sBx	R(A)+=R(A+2);
+			if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }*/
+OP_FORPREP,/*	A sBx	R(A)-=R(A+2); pc+=sBx				*/
+
+OP_TFORLOOP,/*	A C	R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); 
+                        if R(A+3) ~= nil then R(A+2)=R(A+3) else pc++	*/ 
+OP_SETLIST,/*	A B C	R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B	*/
+
+OP_CLOSE,/*	A 	close all variables in the stack up to (>=) R(A)*/
+OP_CLOSURE,/*	A Bx	R(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n))	*/
+
+OP_VARARG/*	A B	R(A), R(A+1), ..., R(A+B-1) = vararg		*/
+} OpCode;
+
+
+#define NUM_OPCODES	(cast(int, OP_VARARG) + 1)
+
+
+
+/*===========================================================================
+  Notes:
+  (*) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1,
+      and can be 0: OP_CALL then sets `top' to last_result+1, so
+      next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'.
+
+  (*) In OP_VARARG, if (B == 0) then use actual number of varargs and
+      set top (like in OP_CALL with C == 0).
+
+  (*) In OP_RETURN, if (B == 0) then return up to `top'
+
+  (*) In OP_SETLIST, if (B == 0) then B = `top';
+      if (C == 0) then next `instruction' is real C
+
+  (*) For comparisons, A specifies what condition the test should accept
+      (true or false).
+
+  (*) All `skips' (pc++) assume that next instruction is a jump
+===========================================================================*/
+
+
+/*
+** masks for instruction properties. The format is:
+** bits 0-1: op mode
+** bits 2-3: C arg mode
+** bits 4-5: B arg mode
+** bit 6: instruction set register A
+** bit 7: operator is a test
+*/  
+
+enum OpArgMask {
+  OpArgN,  /* argument is not used */
+  OpArgU,  /* argument is used */
+  OpArgR,  /* argument is a register or a jump offset */
+  OpArgK   /* argument is a constant or register/constant */
+};
+
+LUAI_DATA const lu_byte luaP_opmodes[NUM_OPCODES];
+
+#define getOpMode(m)	(cast(enum OpMode, luaP_opmodes[m] & 3))
+#define getBMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3))
+#define getCMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3))
+#define testAMode(m)	(luaP_opmodes[m] & (1 << 6))
+#define testTMode(m)	(luaP_opmodes[m] & (1 << 7))
+
+
+LUAI_DATA const char *const luaP_opnames[NUM_OPCODES+1];  /* opcode names */
+
+
+/* number of list items to accumulate before a SETLIST instruction */
+#define LFIELDS_PER_FLUSH	50
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/loslib.c b/redis-stable/deps/lua/src/loslib.c
new file mode 100644
index 00000000..da06a572
--- /dev/null
+++ b/redis-stable/deps/lua/src/loslib.c
@@ -0,0 +1,243 @@
+/*
+** $Id: loslib.c,v 1.19.1.3 2008/01/18 16:38:18 roberto Exp $
+** Standard Operating System library
+** See Copyright Notice in lua.h
+*/
+
+
+#include <errno.h>
+#include <locale.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#define loslib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+static int os_pushresult (lua_State *L, int i, const char *filename) {
+  int en = errno;  /* calls to Lua API may change this value */
+  if (i) {
+    lua_pushboolean(L, 1);
+    return 1;
+  }
+  else {
+    lua_pushnil(L);
+    lua_pushfstring(L, "%s: %s", filename, strerror(en));
+    lua_pushinteger(L, en);
+    return 3;
+  }
+}
+
+
+static int os_execute (lua_State *L) {
+  lua_pushinteger(L, system(luaL_optstring(L, 1, NULL)));
+  return 1;
+}
+
+
+static int os_remove (lua_State *L) {
+  const char *filename = luaL_checkstring(L, 1);
+  return os_pushresult(L, remove(filename) == 0, filename);
+}
+
+
+static int os_rename (lua_State *L) {
+  const char *fromname = luaL_checkstring(L, 1);
+  const char *toname = luaL_checkstring(L, 2);
+  return os_pushresult(L, rename(fromname, toname) == 0, fromname);
+}
+
+
+static int os_tmpname (lua_State *L) {
+  char buff[LUA_TMPNAMBUFSIZE];
+  int err;
+  lua_tmpnam(buff, err);
+  if (err)
+    return luaL_error(L, "unable to generate a unique filename");
+  lua_pushstring(L, buff);
+  return 1;
+}
+
+
+static int os_getenv (lua_State *L) {
+  lua_pushstring(L, getenv(luaL_checkstring(L, 1)));  /* if NULL push nil */
+  return 1;
+}
+
+
+static int os_clock (lua_State *L) {
+  lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC);
+  return 1;
+}
+
+
+/*
+** {======================================================
+** Time/Date operations
+** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S,
+**   wday=%w+1, yday=%j, isdst=? }
+** =======================================================
+*/
+
+static void setfield (lua_State *L, const char *key, int value) {
+  lua_pushinteger(L, value);
+  lua_setfield(L, -2, key);
+}
+
+static void setboolfield (lua_State *L, const char *key, int value) {
+  if (value < 0)  /* undefined? */
+    return;  /* does not set field */
+  lua_pushboolean(L, value);
+  lua_setfield(L, -2, key);
+}
+
+static int getboolfield (lua_State *L, const char *key) {
+  int res;
+  lua_getfield(L, -1, key);
+  res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);
+  lua_pop(L, 1);
+  return res;
+}
+
+
+static int getfield (lua_State *L, const char *key, int d) {
+  int res;
+  lua_getfield(L, -1, key);
+  if (lua_isnumber(L, -1))
+    res = (int)lua_tointeger(L, -1);
+  else {
+    if (d < 0)
+      return luaL_error(L, "field " LUA_QS " missing in date table", key);
+    res = d;
+  }
+  lua_pop(L, 1);
+  return res;
+}
+
+
+static int os_date (lua_State *L) {
+  const char *s = luaL_optstring(L, 1, "%c");
+  time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));
+  struct tm *stm;
+  if (*s == '!') {  /* UTC? */
+    stm = gmtime(&t);
+    s++;  /* skip `!' */
+  }
+  else
+    stm = localtime(&t);
+  if (stm == NULL)  /* invalid date? */
+    lua_pushnil(L);
+  else if (strcmp(s, "*t") == 0) {
+    lua_createtable(L, 0, 9);  /* 9 = number of fields */
+    setfield(L, "sec", stm->tm_sec);
+    setfield(L, "min", stm->tm_min);
+    setfield(L, "hour", stm->tm_hour);
+    setfield(L, "day", stm->tm_mday);
+    setfield(L, "month", stm->tm_mon+1);
+    setfield(L, "year", stm->tm_year+1900);
+    setfield(L, "wday", stm->tm_wday+1);
+    setfield(L, "yday", stm->tm_yday+1);
+    setboolfield(L, "isdst", stm->tm_isdst);
+  }
+  else {
+    char cc[3];
+    luaL_Buffer b;
+    cc[0] = '%'; cc[2] = '\0';
+    luaL_buffinit(L, &b);
+    for (; *s; s++) {
+      if (*s != '%' || *(s + 1) == '\0')  /* no conversion specifier? */
+        luaL_addchar(&b, *s);
+      else {
+        size_t reslen;
+        char buff[200];  /* should be big enough for any conversion result */
+        cc[1] = *(++s);
+        reslen = strftime(buff, sizeof(buff), cc, stm);
+        luaL_addlstring(&b, buff, reslen);
+      }
+    }
+    luaL_pushresult(&b);
+  }
+  return 1;
+}
+
+
+static int os_time (lua_State *L) {
+  time_t t;
+  if (lua_isnoneornil(L, 1))  /* called without args? */
+    t = time(NULL);  /* get current time */
+  else {
+    struct tm ts;
+    luaL_checktype(L, 1, LUA_TTABLE);
+    lua_settop(L, 1);  /* make sure table is at the top */
+    ts.tm_sec = getfield(L, "sec", 0);
+    ts.tm_min = getfield(L, "min", 0);
+    ts.tm_hour = getfield(L, "hour", 12);
+    ts.tm_mday = getfield(L, "day", -1);
+    ts.tm_mon = getfield(L, "month", -1) - 1;
+    ts.tm_year = getfield(L, "year", -1) - 1900;
+    ts.tm_isdst = getboolfield(L, "isdst");
+    t = mktime(&ts);
+  }
+  if (t == (time_t)(-1))
+    lua_pushnil(L);
+  else
+    lua_pushnumber(L, (lua_Number)t);
+  return 1;
+}
+
+
+static int os_difftime (lua_State *L) {
+  lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),
+                             (time_t)(luaL_optnumber(L, 2, 0))));
+  return 1;
+}
+
+/* }====================================================== */
+
+
+static int os_setlocale (lua_State *L) {
+  static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY,
+                      LC_NUMERIC, LC_TIME};
+  static const char *const catnames[] = {"all", "collate", "ctype", "monetary",
+     "numeric", "time", NULL};
+  const char *l = luaL_optstring(L, 1, NULL);
+  int op = luaL_checkoption(L, 2, "all", catnames);
+  lua_pushstring(L, setlocale(cat[op], l));
+  return 1;
+}
+
+
+static int os_exit (lua_State *L) {
+  exit(luaL_optint(L, 1, EXIT_SUCCESS));
+}
+
+static const luaL_Reg syslib[] = {
+  {"clock",     os_clock},
+  {"date",      os_date},
+  {"difftime",  os_difftime},
+  {"execute",   os_execute},
+  {"exit",      os_exit},
+  {"getenv",    os_getenv},
+  {"remove",    os_remove},
+  {"rename",    os_rename},
+  {"setlocale", os_setlocale},
+  {"time",      os_time},
+  {"tmpname",   os_tmpname},
+  {NULL, NULL}
+};
+
+/* }====================================================== */
+
+
+
+LUALIB_API int luaopen_os (lua_State *L) {
+  luaL_register(L, LUA_OSLIBNAME, syslib);
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/lparser.c b/redis-stable/deps/lua/src/lparser.c
new file mode 100644
index 00000000..dda7488d
--- /dev/null
+++ b/redis-stable/deps/lua/src/lparser.c
@@ -0,0 +1,1339 @@
+/*
+** $Id: lparser.c,v 2.42.1.4 2011/10/21 19:31:42 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lparser_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lcode.h"
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lparser.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+
+
+
+#define hasmultret(k)		((k) == VCALL || (k) == VVARARG)
+
+#define getlocvar(fs, i)	((fs)->f->locvars[(fs)->actvar[i]])
+
+#define luaY_checklimit(fs,v,l,m)	if ((v)>(l)) errorlimit(fs,l,m)
+
+
+/*
+** nodes for block list (list of active blocks)
+*/
+typedef struct BlockCnt {
+  struct BlockCnt *previous;  /* chain */
+  int breaklist;  /* list of jumps out of this loop */
+  lu_byte nactvar;  /* # active locals outside the breakable structure */
+  lu_byte upval;  /* true if some variable in the block is an upvalue */
+  lu_byte isbreakable;  /* true if `block' is a loop */
+} BlockCnt;
+
+
+
+/*
+** prototypes for recursive non-terminal functions
+*/
+static void chunk (LexState *ls);
+static void expr (LexState *ls, expdesc *v);
+
+
+static void anchor_token (LexState *ls) {
+  if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) {
+    TString *ts = ls->t.seminfo.ts;
+    luaX_newstring(ls, getstr(ts), ts->tsv.len);
+  }
+}
+
+
+static void error_expected (LexState *ls, int token) {
+  luaX_syntaxerror(ls,
+      luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token)));
+}
+
+
+static void errorlimit (FuncState *fs, int limit, const char *what) {
+  const char *msg = (fs->f->linedefined == 0) ?
+    luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) :
+    luaO_pushfstring(fs->L, "function at line %d has more than %d %s",
+                            fs->f->linedefined, limit, what);
+  luaX_lexerror(fs->ls, msg, 0);
+}
+
+
+static int testnext (LexState *ls, int c) {
+  if (ls->t.token == c) {
+    luaX_next(ls);
+    return 1;
+  }
+  else return 0;
+}
+
+
+static void check (LexState *ls, int c) {
+  if (ls->t.token != c)
+    error_expected(ls, c);
+}
+
+static void checknext (LexState *ls, int c) {
+  check(ls, c);
+  luaX_next(ls);
+}
+
+
+#define check_condition(ls,c,msg)	{ if (!(c)) luaX_syntaxerror(ls, msg); }
+
+
+
+static void check_match (LexState *ls, int what, int who, int where) {
+  if (!testnext(ls, what)) {
+    if (where == ls->linenumber)
+      error_expected(ls, what);
+    else {
+      luaX_syntaxerror(ls, luaO_pushfstring(ls->L,
+             LUA_QS " expected (to close " LUA_QS " at line %d)",
+              luaX_token2str(ls, what), luaX_token2str(ls, who), where));
+    }
+  }
+}
+
+
+static TString *str_checkname (LexState *ls) {
+  TString *ts;
+  check(ls, TK_NAME);
+  ts = ls->t.seminfo.ts;
+  luaX_next(ls);
+  return ts;
+}
+
+
+static void init_exp (expdesc *e, expkind k, int i) {
+  e->f = e->t = NO_JUMP;
+  e->k = k;
+  e->u.s.info = i;
+}
+
+
+static void codestring (LexState *ls, expdesc *e, TString *s) {
+  init_exp(e, VK, luaK_stringK(ls->fs, s));
+}
+
+
+static void checkname(LexState *ls, expdesc *e) {
+  codestring(ls, e, str_checkname(ls));
+}
+
+
+static int registerlocalvar (LexState *ls, TString *varname) {
+  FuncState *fs = ls->fs;
+  Proto *f = fs->f;
+  int oldsize = f->sizelocvars;
+  luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,
+                  LocVar, SHRT_MAX, "too many local variables");
+  while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL;
+  f->locvars[fs->nlocvars].varname = varname;
+  luaC_objbarrier(ls->L, f, varname);
+  return fs->nlocvars++;
+}
+
+
+#define new_localvarliteral(ls,v,n) \
+  new_localvar(ls, luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char))-1), n)
+
+
+static void new_localvar (LexState *ls, TString *name, int n) {
+  FuncState *fs = ls->fs;
+  luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables");
+  fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));
+}
+
+
+static void adjustlocalvars (LexState *ls, int nvars) {
+  FuncState *fs = ls->fs;
+  fs->nactvar = cast_byte(fs->nactvar + nvars);
+  for (; nvars; nvars--) {
+    getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc;
+  }
+}
+
+
+static void removevars (LexState *ls, int tolevel) {
+  FuncState *fs = ls->fs;
+  while (fs->nactvar > tolevel)
+    getlocvar(fs, --fs->nactvar).endpc = fs->pc;
+}
+
+
+static int indexupvalue (FuncState *fs, TString *name, expdesc *v) {
+  int i;
+  Proto *f = fs->f;
+  int oldsize = f->sizeupvalues;
+  for (i=0; i<f->nups; i++) {
+    if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) {
+      lua_assert(f->upvalues[i] == name);
+      return i;
+    }
+  }
+  /* new one */
+  luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues");
+  luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,
+                  TString *, MAX_INT, "");
+  while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;
+  f->upvalues[f->nups] = name;
+  luaC_objbarrier(fs->L, f, name);
+  lua_assert(v->k == VLOCAL || v->k == VUPVAL);
+  fs->upvalues[f->nups].k = cast_byte(v->k);
+  fs->upvalues[f->nups].info = cast_byte(v->u.s.info);
+  return f->nups++;
+}
+
+
+static int searchvar (FuncState *fs, TString *n) {
+  int i;
+  for (i=fs->nactvar-1; i >= 0; i--) {
+    if (n == getlocvar(fs, i).varname)
+      return i;
+  }
+  return -1;  /* not found */
+}
+
+
+static void markupval (FuncState *fs, int level) {
+  BlockCnt *bl = fs->bl;
+  while (bl && bl->nactvar > level) bl = bl->previous;
+  if (bl) bl->upval = 1;
+}
+
+
+static int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) {
+  if (fs == NULL) {  /* no more levels? */
+    init_exp(var, VGLOBAL, NO_REG);  /* default is global variable */
+    return VGLOBAL;
+  }
+  else {
+    int v = searchvar(fs, n);  /* look up at current level */
+    if (v >= 0) {
+      init_exp(var, VLOCAL, v);
+      if (!base)
+        markupval(fs, v);  /* local will be used as an upval */
+      return VLOCAL;
+    }
+    else {  /* not found at current level; try upper one */
+      if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL)
+        return VGLOBAL;
+      var->u.s.info = indexupvalue(fs, n, var);  /* else was LOCAL or UPVAL */
+      var->k = VUPVAL;  /* upvalue in this level */
+      return VUPVAL;
+    }
+  }
+}
+
+
+static void singlevar (LexState *ls, expdesc *var) {
+  TString *varname = str_checkname(ls);
+  FuncState *fs = ls->fs;
+  if (singlevaraux(fs, varname, var, 1) == VGLOBAL)
+    var->u.s.info = luaK_stringK(fs, varname);  /* info points to global name */
+}
+
+
+static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {
+  FuncState *fs = ls->fs;
+  int extra = nvars - nexps;
+  if (hasmultret(e->k)) {
+    extra++;  /* includes call itself */
+    if (extra < 0) extra = 0;
+    luaK_setreturns(fs, e, extra);  /* last exp. provides the difference */
+    if (extra > 1) luaK_reserveregs(fs, extra-1);
+  }
+  else {
+    if (e->k != VVOID) luaK_exp2nextreg(fs, e);  /* close last expression */
+    if (extra > 0) {
+      int reg = fs->freereg;
+      luaK_reserveregs(fs, extra);
+      luaK_nil(fs, reg, extra);
+    }
+  }
+}
+
+
+static void enterlevel (LexState *ls) {
+  if (++ls->L->nCcalls > LUAI_MAXCCALLS)
+	luaX_lexerror(ls, "chunk has too many syntax levels", 0);
+}
+
+
+#define leavelevel(ls)	((ls)->L->nCcalls--)
+
+
+static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) {
+  bl->breaklist = NO_JUMP;
+  bl->isbreakable = isbreakable;
+  bl->nactvar = fs->nactvar;
+  bl->upval = 0;
+  bl->previous = fs->bl;
+  fs->bl = bl;
+  lua_assert(fs->freereg == fs->nactvar);
+}
+
+
+static void leaveblock (FuncState *fs) {
+  BlockCnt *bl = fs->bl;
+  fs->bl = bl->previous;
+  removevars(fs->ls, bl->nactvar);
+  if (bl->upval)
+    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
+  /* a block either controls scope or breaks (never both) */
+  lua_assert(!bl->isbreakable || !bl->upval);
+  lua_assert(bl->nactvar == fs->nactvar);
+  fs->freereg = fs->nactvar;  /* free registers */
+  luaK_patchtohere(fs, bl->breaklist);
+}
+
+
+static void pushclosure (LexState *ls, FuncState *func, expdesc *v) {
+  FuncState *fs = ls->fs;
+  Proto *f = fs->f;
+  int oldsize = f->sizep;
+  int i;
+  luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,
+                  MAXARG_Bx, "constant table overflow");
+  while (oldsize < f->sizep) f->p[oldsize++] = NULL;
+  f->p[fs->np++] = func->f;
+  luaC_objbarrier(ls->L, f, func->f);
+  init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1));
+  for (i=0; i<func->f->nups; i++) {
+    OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL;
+    luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0);
+  }
+}
+
+
+static void open_func (LexState *ls, FuncState *fs) {
+  lua_State *L = ls->L;
+  Proto *f = luaF_newproto(L);
+  fs->f = f;
+  fs->prev = ls->fs;  /* linked list of funcstates */
+  fs->ls = ls;
+  fs->L = L;
+  ls->fs = fs;
+  fs->pc = 0;
+  fs->lasttarget = -1;
+  fs->jpc = NO_JUMP;
+  fs->freereg = 0;
+  fs->nk = 0;
+  fs->np = 0;
+  fs->nlocvars = 0;
+  fs->nactvar = 0;
+  fs->bl = NULL;
+  f->source = ls->source;
+  f->maxstacksize = 2;  /* registers 0/1 are always valid */
+  fs->h = luaH_new(L, 0, 0);
+  /* anchor table of constants and prototype (to avoid being collected) */
+  sethvalue2s(L, L->top, fs->h);
+  incr_top(L);
+  setptvalue2s(L, L->top, f);
+  incr_top(L);
+}
+
+
+static void close_func (LexState *ls) {
+  lua_State *L = ls->L;
+  FuncState *fs = ls->fs;
+  Proto *f = fs->f;
+  removevars(ls, 0);
+  luaK_ret(fs, 0, 0);  /* final return */
+  luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction);
+  f->sizecode = fs->pc;
+  luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int);
+  f->sizelineinfo = fs->pc;
+  luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue);
+  f->sizek = fs->nk;
+  luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *);
+  f->sizep = fs->np;
+  luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar);
+  f->sizelocvars = fs->nlocvars;
+  luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *);
+  f->sizeupvalues = f->nups;
+  lua_assert(luaG_checkcode(f));
+  lua_assert(fs->bl == NULL);
+  ls->fs = fs->prev;
+  /* last token read was anchored in defunct function; must reanchor it */
+  if (fs) anchor_token(ls);
+  L->top -= 2;  /* remove table and prototype from the stack */
+}
+
+
+Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
+  struct LexState lexstate;
+  struct FuncState funcstate;
+  lexstate.buff = buff;
+  luaX_setinput(L, &lexstate, z, luaS_new(L, name));
+  open_func(&lexstate, &funcstate);
+  funcstate.f->is_vararg = VARARG_ISVARARG;  /* main func. is always vararg */
+  luaX_next(&lexstate);  /* read first token */
+  chunk(&lexstate);
+  check(&lexstate, TK_EOS);
+  close_func(&lexstate);
+  lua_assert(funcstate.prev == NULL);
+  lua_assert(funcstate.f->nups == 0);
+  lua_assert(lexstate.fs == NULL);
+  return funcstate.f;
+}
+
+
+
+/*============================================================*/
+/* GRAMMAR RULES */
+/*============================================================*/
+
+
+static void field (LexState *ls, expdesc *v) {
+  /* field -> ['.' | ':'] NAME */
+  FuncState *fs = ls->fs;
+  expdesc key;
+  luaK_exp2anyreg(fs, v);
+  luaX_next(ls);  /* skip the dot or colon */
+  checkname(ls, &key);
+  luaK_indexed(fs, v, &key);
+}
+
+
+static void yindex (LexState *ls, expdesc *v) {
+  /* index -> '[' expr ']' */
+  luaX_next(ls);  /* skip the '[' */
+  expr(ls, v);
+  luaK_exp2val(ls->fs, v);
+  checknext(ls, ']');
+}
+
+
+/*
+** {======================================================================
+** Rules for Constructors
+** =======================================================================
+*/
+
+
+struct ConsControl {
+  expdesc v;  /* last list item read */
+  expdesc *t;  /* table descriptor */
+  int nh;  /* total number of `record' elements */
+  int na;  /* total number of array elements */
+  int tostore;  /* number of array elements pending to be stored */
+};
+
+
+static void recfield (LexState *ls, struct ConsControl *cc) {
+  /* recfield -> (NAME | `['exp1`]') = exp1 */
+  FuncState *fs = ls->fs;
+  int reg = ls->fs->freereg;
+  expdesc key, val;
+  int rkkey;
+  if (ls->t.token == TK_NAME) {
+    luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor");
+    checkname(ls, &key);
+  }
+  else  /* ls->t.token == '[' */
+    yindex(ls, &key);
+  cc->nh++;
+  checknext(ls, '=');
+  rkkey = luaK_exp2RK(fs, &key);
+  expr(ls, &val);
+  luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, luaK_exp2RK(fs, &val));
+  fs->freereg = reg;  /* free registers */
+}
+
+
+static void closelistfield (FuncState *fs, struct ConsControl *cc) {
+  if (cc->v.k == VVOID) return;  /* there is no list item */
+  luaK_exp2nextreg(fs, &cc->v);
+  cc->v.k = VVOID;
+  if (cc->tostore == LFIELDS_PER_FLUSH) {
+    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);  /* flush */
+    cc->tostore = 0;  /* no more items pending */
+  }
+}
+
+
+static void lastlistfield (FuncState *fs, struct ConsControl *cc) {
+  if (cc->tostore == 0) return;
+  if (hasmultret(cc->v.k)) {
+    luaK_setmultret(fs, &cc->v);
+    luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET);
+    cc->na--;  /* do not count last expression (unknown number of elements) */
+  }
+  else {
+    if (cc->v.k != VVOID)
+      luaK_exp2nextreg(fs, &cc->v);
+    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);
+  }
+}
+
+
+static void listfield (LexState *ls, struct ConsControl *cc) {
+  expr(ls, &cc->v);
+  luaY_checklimit(ls->fs, cc->na, MAX_INT, "items in a constructor");
+  cc->na++;
+  cc->tostore++;
+}
+
+
+static void constructor (LexState *ls, expdesc *t) {
+  /* constructor -> ?? */
+  FuncState *fs = ls->fs;
+  int line = ls->linenumber;
+  int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0);
+  struct ConsControl cc;
+  cc.na = cc.nh = cc.tostore = 0;
+  cc.t = t;
+  init_exp(t, VRELOCABLE, pc);
+  init_exp(&cc.v, VVOID, 0);  /* no value (yet) */
+  luaK_exp2nextreg(ls->fs, t);  /* fix it at stack top (for gc) */
+  checknext(ls, '{');
+  do {
+    lua_assert(cc.v.k == VVOID || cc.tostore > 0);
+    if (ls->t.token == '}') break;
+    closelistfield(fs, &cc);
+    switch(ls->t.token) {
+      case TK_NAME: {  /* may be listfields or recfields */
+        luaX_lookahead(ls);
+        if (ls->lookahead.token != '=')  /* expression? */
+          listfield(ls, &cc);
+        else
+          recfield(ls, &cc);
+        break;
+      }
+      case '[': {  /* constructor_item -> recfield */
+        recfield(ls, &cc);
+        break;
+      }
+      default: {  /* constructor_part -> listfield */
+        listfield(ls, &cc);
+        break;
+      }
+    }
+  } while (testnext(ls, ',') || testnext(ls, ';'));
+  check_match(ls, '}', '{', line);
+  lastlistfield(fs, &cc);
+  SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */
+  SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh));  /* set initial table size */
+}
+
+/* }====================================================================== */
+
+
+
+static void parlist (LexState *ls) {
+  /* parlist -> [ param { `,' param } ] */
+  FuncState *fs = ls->fs;
+  Proto *f = fs->f;
+  int nparams = 0;
+  f->is_vararg = 0;
+  if (ls->t.token != ')') {  /* is `parlist' not empty? */
+    do {
+      switch (ls->t.token) {
+        case TK_NAME: {  /* param -> NAME */
+          new_localvar(ls, str_checkname(ls), nparams++);
+          break;
+        }
+        case TK_DOTS: {  /* param -> `...' */
+          luaX_next(ls);
+#if defined(LUA_COMPAT_VARARG)
+          /* use `arg' as default name */
+          new_localvarliteral(ls, "arg", nparams++);
+          f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG;
+#endif
+          f->is_vararg |= VARARG_ISVARARG;
+          break;
+        }
+        default: luaX_syntaxerror(ls, "<name> or " LUA_QL("...") " expected");
+      }
+    } while (!f->is_vararg && testnext(ls, ','));
+  }
+  adjustlocalvars(ls, nparams);
+  f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG));
+  luaK_reserveregs(fs, fs->nactvar);  /* reserve register for parameters */
+}
+
+
+static void body (LexState *ls, expdesc *e, int needself, int line) {
+  /* body ->  `(' parlist `)' chunk END */
+  FuncState new_fs;
+  open_func(ls, &new_fs);
+  new_fs.f->linedefined = line;
+  checknext(ls, '(');
+  if (needself) {
+    new_localvarliteral(ls, "self", 0);
+    adjustlocalvars(ls, 1);
+  }
+  parlist(ls);
+  checknext(ls, ')');
+  chunk(ls);
+  new_fs.f->lastlinedefined = ls->linenumber;
+  check_match(ls, TK_END, TK_FUNCTION, line);
+  close_func(ls);
+  pushclosure(ls, &new_fs, e);
+}
+
+
+static int explist1 (LexState *ls, expdesc *v) {
+  /* explist1 -> expr { `,' expr } */
+  int n = 1;  /* at least one expression */
+  expr(ls, v);
+  while (testnext(ls, ',')) {
+    luaK_exp2nextreg(ls->fs, v);
+    expr(ls, v);
+    n++;
+  }
+  return n;
+}
+
+
+static void funcargs (LexState *ls, expdesc *f) {
+  FuncState *fs = ls->fs;
+  expdesc args;
+  int base, nparams;
+  int line = ls->linenumber;
+  switch (ls->t.token) {
+    case '(': {  /* funcargs -> `(' [ explist1 ] `)' */
+      if (line != ls->lastline)
+        luaX_syntaxerror(ls,"ambiguous syntax (function call x new statement)");
+      luaX_next(ls);
+      if (ls->t.token == ')')  /* arg list is empty? */
+        args.k = VVOID;
+      else {
+        explist1(ls, &args);
+        luaK_setmultret(fs, &args);
+      }
+      check_match(ls, ')', '(', line);
+      break;
+    }
+    case '{': {  /* funcargs -> constructor */
+      constructor(ls, &args);
+      break;
+    }
+    case TK_STRING: {  /* funcargs -> STRING */
+      codestring(ls, &args, ls->t.seminfo.ts);
+      luaX_next(ls);  /* must use `seminfo' before `next' */
+      break;
+    }
+    default: {
+      luaX_syntaxerror(ls, "function arguments expected");
+      return;
+    }
+  }
+  lua_assert(f->k == VNONRELOC);
+  base = f->u.s.info;  /* base register for call */
+  if (hasmultret(args.k))
+    nparams = LUA_MULTRET;  /* open call */
+  else {
+    if (args.k != VVOID)
+      luaK_exp2nextreg(fs, &args);  /* close last argument */
+    nparams = fs->freereg - (base+1);
+  }
+  init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));
+  luaK_fixline(fs, line);
+  fs->freereg = base+1;  /* call remove function and arguments and leaves
+                            (unless changed) one result */
+}
+
+
+
+
+/*
+** {======================================================================
+** Expression parsing
+** =======================================================================
+*/
+
+
+static void prefixexp (LexState *ls, expdesc *v) {
+  /* prefixexp -> NAME | '(' expr ')' */
+  switch (ls->t.token) {
+    case '(': {
+      int line = ls->linenumber;
+      luaX_next(ls);
+      expr(ls, v);
+      check_match(ls, ')', '(', line);
+      luaK_dischargevars(ls->fs, v);
+      return;
+    }
+    case TK_NAME: {
+      singlevar(ls, v);
+      return;
+    }
+    default: {
+      luaX_syntaxerror(ls, "unexpected symbol");
+      return;
+    }
+  }
+}
+
+
+static void primaryexp (LexState *ls, expdesc *v) {
+  /* primaryexp ->
+        prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */
+  FuncState *fs = ls->fs;
+  prefixexp(ls, v);
+  for (;;) {
+    switch (ls->t.token) {
+      case '.': {  /* field */
+        field(ls, v);
+        break;
+      }
+      case '[': {  /* `[' exp1 `]' */
+        expdesc key;
+        luaK_exp2anyreg(fs, v);
+        yindex(ls, &key);
+        luaK_indexed(fs, v, &key);
+        break;
+      }
+      case ':': {  /* `:' NAME funcargs */
+        expdesc key;
+        luaX_next(ls);
+        checkname(ls, &key);
+        luaK_self(fs, v, &key);
+        funcargs(ls, v);
+        break;
+      }
+      case '(': case TK_STRING: case '{': {  /* funcargs */
+        luaK_exp2nextreg(fs, v);
+        funcargs(ls, v);
+        break;
+      }
+      default: return;
+    }
+  }
+}
+
+
+static void simpleexp (LexState *ls, expdesc *v) {
+  /* simpleexp -> NUMBER | STRING | NIL | true | false | ... |
+                  constructor | FUNCTION body | primaryexp */
+  switch (ls->t.token) {
+    case TK_NUMBER: {
+      init_exp(v, VKNUM, 0);
+      v->u.nval = ls->t.seminfo.r;
+      break;
+    }
+    case TK_STRING: {
+      codestring(ls, v, ls->t.seminfo.ts);
+      break;
+    }
+    case TK_NIL: {
+      init_exp(v, VNIL, 0);
+      break;
+    }
+    case TK_TRUE: {
+      init_exp(v, VTRUE, 0);
+      break;
+    }
+    case TK_FALSE: {
+      init_exp(v, VFALSE, 0);
+      break;
+    }
+    case TK_DOTS: {  /* vararg */
+      FuncState *fs = ls->fs;
+      check_condition(ls, fs->f->is_vararg,
+                      "cannot use " LUA_QL("...") " outside a vararg function");
+      fs->f->is_vararg &= ~VARARG_NEEDSARG;  /* don't need 'arg' */
+      init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0));
+      break;
+    }
+    case '{': {  /* constructor */
+      constructor(ls, v);
+      return;
+    }
+    case TK_FUNCTION: {
+      luaX_next(ls);
+      body(ls, v, 0, ls->linenumber);
+      return;
+    }
+    default: {
+      primaryexp(ls, v);
+      return;
+    }
+  }
+  luaX_next(ls);
+}
+
+
+static UnOpr getunopr (int op) {
+  switch (op) {
+    case TK_NOT: return OPR_NOT;
+    case '-': return OPR_MINUS;
+    case '#': return OPR_LEN;
+    default: return OPR_NOUNOPR;
+  }
+}
+
+
+static BinOpr getbinopr (int op) {
+  switch (op) {
+    case '+': return OPR_ADD;
+    case '-': return OPR_SUB;
+    case '*': return OPR_MUL;
+    case '/': return OPR_DIV;
+    case '%': return OPR_MOD;
+    case '^': return OPR_POW;
+    case TK_CONCAT: return OPR_CONCAT;
+    case TK_NE: return OPR_NE;
+    case TK_EQ: return OPR_EQ;
+    case '<': return OPR_LT;
+    case TK_LE: return OPR_LE;
+    case '>': return OPR_GT;
+    case TK_GE: return OPR_GE;
+    case TK_AND: return OPR_AND;
+    case TK_OR: return OPR_OR;
+    default: return OPR_NOBINOPR;
+  }
+}
+
+
+static const struct {
+  lu_byte left;  /* left priority for each binary operator */
+  lu_byte right; /* right priority */
+} priority[] = {  /* ORDER OPR */
+   {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7},  /* `+' `-' `/' `%' */
+   {10, 9}, {5, 4},                 /* power and concat (right associative) */
+   {3, 3}, {3, 3},                  /* equality and inequality */
+   {3, 3}, {3, 3}, {3, 3}, {3, 3},  /* order */
+   {2, 2}, {1, 1}                   /* logical (and/or) */
+};
+
+#define UNARY_PRIORITY	8  /* priority for unary operators */
+
+
+/*
+** subexpr -> (simpleexp | unop subexpr) { binop subexpr }
+** where `binop' is any binary operator with a priority higher than `limit'
+*/
+static BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) {
+  BinOpr op;
+  UnOpr uop;
+  enterlevel(ls);
+  uop = getunopr(ls->t.token);
+  if (uop != OPR_NOUNOPR) {
+    luaX_next(ls);
+    subexpr(ls, v, UNARY_PRIORITY);
+    luaK_prefix(ls->fs, uop, v);
+  }
+  else simpleexp(ls, v);
+  /* expand while operators have priorities higher than `limit' */
+  op = getbinopr(ls->t.token);
+  while (op != OPR_NOBINOPR && priority[op].left > limit) {
+    expdesc v2;
+    BinOpr nextop;
+    luaX_next(ls);
+    luaK_infix(ls->fs, op, v);
+    /* read sub-expression with higher priority */
+    nextop = subexpr(ls, &v2, priority[op].right);
+    luaK_posfix(ls->fs, op, v, &v2);
+    op = nextop;
+  }
+  leavelevel(ls);
+  return op;  /* return first untreated operator */
+}
+
+
+static void expr (LexState *ls, expdesc *v) {
+  subexpr(ls, v, 0);
+}
+
+/* }==================================================================== */
+
+
+
+/*
+** {======================================================================
+** Rules for Statements
+** =======================================================================
+*/
+
+
+static int block_follow (int token) {
+  switch (token) {
+    case TK_ELSE: case TK_ELSEIF: case TK_END:
+    case TK_UNTIL: case TK_EOS:
+      return 1;
+    default: return 0;
+  }
+}
+
+
+static void block (LexState *ls) {
+  /* block -> chunk */
+  FuncState *fs = ls->fs;
+  BlockCnt bl;
+  enterblock(fs, &bl, 0);
+  chunk(ls);
+  lua_assert(bl.breaklist == NO_JUMP);
+  leaveblock(fs);
+}
+
+
+/*
+** structure to chain all variables in the left-hand side of an
+** assignment
+*/
+struct LHS_assign {
+  struct LHS_assign *prev;
+  expdesc v;  /* variable (global, local, upvalue, or indexed) */
+};
+
+
+/*
+** check whether, in an assignment to a local variable, the local variable
+** is needed in a previous assignment (to a table). If so, save original
+** local value in a safe place and use this safe copy in the previous
+** assignment.
+*/
+static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) {
+  FuncState *fs = ls->fs;
+  int extra = fs->freereg;  /* eventual position to save local variable */
+  int conflict = 0;
+  for (; lh; lh = lh->prev) {
+    if (lh->v.k == VINDEXED) {
+      if (lh->v.u.s.info == v->u.s.info) {  /* conflict? */
+        conflict = 1;
+        lh->v.u.s.info = extra;  /* previous assignment will use safe copy */
+      }
+      if (lh->v.u.s.aux == v->u.s.info) {  /* conflict? */
+        conflict = 1;
+        lh->v.u.s.aux = extra;  /* previous assignment will use safe copy */
+      }
+    }
+  }
+  if (conflict) {
+    luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.info, 0);  /* make copy */
+    luaK_reserveregs(fs, 1);
+  }
+}
+
+
+static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {
+  expdesc e;
+  check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
+                      "syntax error");
+  if (testnext(ls, ',')) {  /* assignment -> `,' primaryexp assignment */
+    struct LHS_assign nv;
+    nv.prev = lh;
+    primaryexp(ls, &nv.v);
+    if (nv.v.k == VLOCAL)
+      check_conflict(ls, lh, &nv.v);
+    luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
+                    "variables in assignment");
+    assignment(ls, &nv, nvars+1);
+  }
+  else {  /* assignment -> `=' explist1 */
+    int nexps;
+    checknext(ls, '=');
+    nexps = explist1(ls, &e);
+    if (nexps != nvars) {
+      adjust_assign(ls, nvars, nexps, &e);
+      if (nexps > nvars)
+        ls->fs->freereg -= nexps - nvars;  /* remove extra values */
+    }
+    else {
+      luaK_setoneret(ls->fs, &e);  /* close last expression */
+      luaK_storevar(ls->fs, &lh->v, &e);
+      return;  /* avoid default */
+    }
+  }
+  init_exp(&e, VNONRELOC, ls->fs->freereg-1);  /* default assignment */
+  luaK_storevar(ls->fs, &lh->v, &e);
+}
+
+
+static int cond (LexState *ls) {
+  /* cond -> exp */
+  expdesc v;
+  expr(ls, &v);  /* read condition */
+  if (v.k == VNIL) v.k = VFALSE;  /* `falses' are all equal here */
+  luaK_goiftrue(ls->fs, &v);
+  return v.f;
+}
+
+
+static void breakstat (LexState *ls) {
+  FuncState *fs = ls->fs;
+  BlockCnt *bl = fs->bl;
+  int upval = 0;
+  while (bl && !bl->isbreakable) {
+    upval |= bl->upval;
+    bl = bl->previous;
+  }
+  if (!bl)
+    luaX_syntaxerror(ls, "no loop to break");
+  if (upval)
+    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
+  luaK_concat(fs, &bl->breaklist, luaK_jump(fs));
+}
+
+
+static void whilestat (LexState *ls, int line) {
+  /* whilestat -> WHILE cond DO block END */
+  FuncState *fs = ls->fs;
+  int whileinit;
+  int condexit;
+  BlockCnt bl;
+  luaX_next(ls);  /* skip WHILE */
+  whileinit = luaK_getlabel(fs);
+  condexit = cond(ls);
+  enterblock(fs, &bl, 1);
+  checknext(ls, TK_DO);
+  block(ls);
+  luaK_patchlist(fs, luaK_jump(fs), whileinit);
+  check_match(ls, TK_END, TK_WHILE, line);
+  leaveblock(fs);
+  luaK_patchtohere(fs, condexit);  /* false conditions finish the loop */
+}
+
+
+static void repeatstat (LexState *ls, int line) {
+  /* repeatstat -> REPEAT block UNTIL cond */
+  int condexit;
+  FuncState *fs = ls->fs;
+  int repeat_init = luaK_getlabel(fs);
+  BlockCnt bl1, bl2;
+  enterblock(fs, &bl1, 1);  /* loop block */
+  enterblock(fs, &bl2, 0);  /* scope block */
+  luaX_next(ls);  /* skip REPEAT */
+  chunk(ls);
+  check_match(ls, TK_UNTIL, TK_REPEAT, line);
+  condexit = cond(ls);  /* read condition (inside scope block) */
+  if (!bl2.upval) {  /* no upvalues? */
+    leaveblock(fs);  /* finish scope */
+    luaK_patchlist(ls->fs, condexit, repeat_init);  /* close the loop */
+  }
+  else {  /* complete semantics when there are upvalues */
+    breakstat(ls);  /* if condition then break */
+    luaK_patchtohere(ls->fs, condexit);  /* else... */
+    leaveblock(fs);  /* finish scope... */
+    luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init);  /* and repeat */
+  }
+  leaveblock(fs);  /* finish loop */
+}
+
+
+static int exp1 (LexState *ls) {
+  expdesc e;
+  int k;
+  expr(ls, &e);
+  k = e.k;
+  luaK_exp2nextreg(ls->fs, &e);
+  return k;
+}
+
+
+static void forbody (LexState *ls, int base, int line, int nvars, int isnum) {
+  /* forbody -> DO block */
+  BlockCnt bl;
+  FuncState *fs = ls->fs;
+  int prep, endfor;
+  adjustlocalvars(ls, 3);  /* control variables */
+  checknext(ls, TK_DO);
+  prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);
+  enterblock(fs, &bl, 0);  /* scope for declared variables */
+  adjustlocalvars(ls, nvars);
+  luaK_reserveregs(fs, nvars);
+  block(ls);
+  leaveblock(fs);  /* end of scope for declared variables */
+  luaK_patchtohere(fs, prep);
+  endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :
+                     luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars);
+  luaK_fixline(fs, line);  /* pretend that `OP_FOR' starts the loop */
+  luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1);
+}
+
+
+static void fornum (LexState *ls, TString *varname, int line) {
+  /* fornum -> NAME = exp1,exp1[,exp1] forbody */
+  FuncState *fs = ls->fs;
+  int base = fs->freereg;
+  new_localvarliteral(ls, "(for index)", 0);
+  new_localvarliteral(ls, "(for limit)", 1);
+  new_localvarliteral(ls, "(for step)", 2);
+  new_localvar(ls, varname, 3);
+  checknext(ls, '=');
+  exp1(ls);  /* initial value */
+  checknext(ls, ',');
+  exp1(ls);  /* limit */
+  if (testnext(ls, ','))
+    exp1(ls);  /* optional step */
+  else {  /* default step = 1 */
+    luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1));
+    luaK_reserveregs(fs, 1);
+  }
+  forbody(ls, base, line, 1, 1);
+}
+
+
+static void forlist (LexState *ls, TString *indexname) {
+  /* forlist -> NAME {,NAME} IN explist1 forbody */
+  FuncState *fs = ls->fs;
+  expdesc e;
+  int nvars = 0;
+  int line;
+  int base = fs->freereg;
+  /* create control variables */
+  new_localvarliteral(ls, "(for generator)", nvars++);
+  new_localvarliteral(ls, "(for state)", nvars++);
+  new_localvarliteral(ls, "(for control)", nvars++);
+  /* create declared variables */
+  new_localvar(ls, indexname, nvars++);
+  while (testnext(ls, ','))
+    new_localvar(ls, str_checkname(ls), nvars++);
+  checknext(ls, TK_IN);
+  line = ls->linenumber;
+  adjust_assign(ls, 3, explist1(ls, &e), &e);
+  luaK_checkstack(fs, 3);  /* extra space to call generator */
+  forbody(ls, base, line, nvars - 3, 0);
+}
+
+
+static void forstat (LexState *ls, int line) {
+  /* forstat -> FOR (fornum | forlist) END */
+  FuncState *fs = ls->fs;
+  TString *varname;
+  BlockCnt bl;
+  enterblock(fs, &bl, 1);  /* scope for loop and control variables */
+  luaX_next(ls);  /* skip `for' */
+  varname = str_checkname(ls);  /* first variable name */
+  switch (ls->t.token) {
+    case '=': fornum(ls, varname, line); break;
+    case ',': case TK_IN: forlist(ls, varname); break;
+    default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected");
+  }
+  check_match(ls, TK_END, TK_FOR, line);
+  leaveblock(fs);  /* loop scope (`break' jumps to this point) */
+}
+
+
+static int test_then_block (LexState *ls) {
+  /* test_then_block -> [IF | ELSEIF] cond THEN block */
+  int condexit;
+  luaX_next(ls);  /* skip IF or ELSEIF */
+  condexit = cond(ls);
+  checknext(ls, TK_THEN);
+  block(ls);  /* `then' part */
+  return condexit;
+}
+
+
+static void ifstat (LexState *ls, int line) {
+  /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */
+  FuncState *fs = ls->fs;
+  int flist;
+  int escapelist = NO_JUMP;
+  flist = test_then_block(ls);  /* IF cond THEN block */
+  while (ls->t.token == TK_ELSEIF) {
+    luaK_concat(fs, &escapelist, luaK_jump(fs));
+    luaK_patchtohere(fs, flist);
+    flist = test_then_block(ls);  /* ELSEIF cond THEN block */
+  }
+  if (ls->t.token == TK_ELSE) {
+    luaK_concat(fs, &escapelist, luaK_jump(fs));
+    luaK_patchtohere(fs, flist);
+    luaX_next(ls);  /* skip ELSE (after patch, for correct line info) */
+    block(ls);  /* `else' part */
+  }
+  else
+    luaK_concat(fs, &escapelist, flist);
+  luaK_patchtohere(fs, escapelist);
+  check_match(ls, TK_END, TK_IF, line);
+}
+
+
+static void localfunc (LexState *ls) {
+  expdesc v, b;
+  FuncState *fs = ls->fs;
+  new_localvar(ls, str_checkname(ls), 0);
+  init_exp(&v, VLOCAL, fs->freereg);
+  luaK_reserveregs(fs, 1);
+  adjustlocalvars(ls, 1);
+  body(ls, &b, 0, ls->linenumber);
+  luaK_storevar(fs, &v, &b);
+  /* debug information will only see the variable after this point! */
+  getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;
+}
+
+
+static void localstat (LexState *ls) {
+  /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */
+  int nvars = 0;
+  int nexps;
+  expdesc e;
+  do {
+    new_localvar(ls, str_checkname(ls), nvars++);
+  } while (testnext(ls, ','));
+  if (testnext(ls, '='))
+    nexps = explist1(ls, &e);
+  else {
+    e.k = VVOID;
+    nexps = 0;
+  }
+  adjust_assign(ls, nvars, nexps, &e);
+  adjustlocalvars(ls, nvars);
+}
+
+
+static int funcname (LexState *ls, expdesc *v) {
+  /* funcname -> NAME {field} [`:' NAME] */
+  int needself = 0;
+  singlevar(ls, v);
+  while (ls->t.token == '.')
+    field(ls, v);
+  if (ls->t.token == ':') {
+    needself = 1;
+    field(ls, v);
+  }
+  return needself;
+}
+
+
+static void funcstat (LexState *ls, int line) {
+  /* funcstat -> FUNCTION funcname body */
+  int needself;
+  expdesc v, b;
+  luaX_next(ls);  /* skip FUNCTION */
+  needself = funcname(ls, &v);
+  body(ls, &b, needself, line);
+  luaK_storevar(ls->fs, &v, &b);
+  luaK_fixline(ls->fs, line);  /* definition `happens' in the first line */
+}
+
+
+static void exprstat (LexState *ls) {
+  /* stat -> func | assignment */
+  FuncState *fs = ls->fs;
+  struct LHS_assign v;
+  primaryexp(ls, &v.v);
+  if (v.v.k == VCALL)  /* stat -> func */
+    SETARG_C(getcode(fs, &v.v), 1);  /* call statement uses no results */
+  else {  /* stat -> assignment */
+    v.prev = NULL;
+    assignment(ls, &v, 1);
+  }
+}
+
+
+static void retstat (LexState *ls) {
+  /* stat -> RETURN explist */
+  FuncState *fs = ls->fs;
+  expdesc e;
+  int first, nret;  /* registers with returned values */
+  luaX_next(ls);  /* skip RETURN */
+  if (block_follow(ls->t.token) || ls->t.token == ';')
+    first = nret = 0;  /* return no values */
+  else {
+    nret = explist1(ls, &e);  /* optional return values */
+    if (hasmultret(e.k)) {
+      luaK_setmultret(fs, &e);
+      if (e.k == VCALL && nret == 1) {  /* tail call? */
+        SET_OPCODE(getcode(fs,&e), OP_TAILCALL);
+        lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar);
+      }
+      first = fs->nactvar;
+      nret = LUA_MULTRET;  /* return all values */
+    }
+    else {
+      if (nret == 1)  /* only one single value? */
+        first = luaK_exp2anyreg(fs, &e);
+      else {
+        luaK_exp2nextreg(fs, &e);  /* values must go to the `stack' */
+        first = fs->nactvar;  /* return all `active' values */
+        lua_assert(nret == fs->freereg - first);
+      }
+    }
+  }
+  luaK_ret(fs, first, nret);
+}
+
+
+static int statement (LexState *ls) {
+  int line = ls->linenumber;  /* may be needed for error messages */
+  switch (ls->t.token) {
+    case TK_IF: {  /* stat -> ifstat */
+      ifstat(ls, line);
+      return 0;
+    }
+    case TK_WHILE: {  /* stat -> whilestat */
+      whilestat(ls, line);
+      return 0;
+    }
+    case TK_DO: {  /* stat -> DO block END */
+      luaX_next(ls);  /* skip DO */
+      block(ls);
+      check_match(ls, TK_END, TK_DO, line);
+      return 0;
+    }
+    case TK_FOR: {  /* stat -> forstat */
+      forstat(ls, line);
+      return 0;
+    }
+    case TK_REPEAT: {  /* stat -> repeatstat */
+      repeatstat(ls, line);
+      return 0;
+    }
+    case TK_FUNCTION: {
+      funcstat(ls, line);  /* stat -> funcstat */
+      return 0;
+    }
+    case TK_LOCAL: {  /* stat -> localstat */
+      luaX_next(ls);  /* skip LOCAL */
+      if (testnext(ls, TK_FUNCTION))  /* local function? */
+        localfunc(ls);
+      else
+        localstat(ls);
+      return 0;
+    }
+    case TK_RETURN: {  /* stat -> retstat */
+      retstat(ls);
+      return 1;  /* must be last statement */
+    }
+    case TK_BREAK: {  /* stat -> breakstat */
+      luaX_next(ls);  /* skip BREAK */
+      breakstat(ls);
+      return 1;  /* must be last statement */
+    }
+    default: {
+      exprstat(ls);
+      return 0;  /* to avoid warnings */
+    }
+  }
+}
+
+
+static void chunk (LexState *ls) {
+  /* chunk -> { stat [`;'] } */
+  int islast = 0;
+  enterlevel(ls);
+  while (!islast && !block_follow(ls->t.token)) {
+    islast = statement(ls);
+    testnext(ls, ';');
+    lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg &&
+               ls->fs->freereg >= ls->fs->nactvar);
+    ls->fs->freereg = ls->fs->nactvar;  /* free registers */
+  }
+  leavelevel(ls);
+}
+
+/* }====================================================================== */
diff --git a/redis-stable/deps/lua/src/lparser.h b/redis-stable/deps/lua/src/lparser.h
new file mode 100644
index 00000000..18836afd
--- /dev/null
+++ b/redis-stable/deps/lua/src/lparser.h
@@ -0,0 +1,82 @@
+/*
+** $Id: lparser.h,v 1.57.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lua Parser
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lparser_h
+#define lparser_h
+
+#include "llimits.h"
+#include "lobject.h"
+#include "lzio.h"
+
+
+/*
+** Expression descriptor
+*/
+
+typedef enum {
+  VVOID,	/* no value */
+  VNIL,
+  VTRUE,
+  VFALSE,
+  VK,		/* info = index of constant in `k' */
+  VKNUM,	/* nval = numerical value */
+  VLOCAL,	/* info = local register */
+  VUPVAL,       /* info = index of upvalue in `upvalues' */
+  VGLOBAL,	/* info = index of table; aux = index of global name in `k' */
+  VINDEXED,	/* info = table register; aux = index register (or `k') */
+  VJMP,		/* info = instruction pc */
+  VRELOCABLE,	/* info = instruction pc */
+  VNONRELOC,	/* info = result register */
+  VCALL,	/* info = instruction pc */
+  VVARARG	/* info = instruction pc */
+} expkind;
+
+typedef struct expdesc {
+  expkind k;
+  union {
+    struct { int info, aux; } s;
+    lua_Number nval;
+  } u;
+  int t;  /* patch list of `exit when true' */
+  int f;  /* patch list of `exit when false' */
+} expdesc;
+
+
+typedef struct upvaldesc {
+  lu_byte k;
+  lu_byte info;
+} upvaldesc;
+
+
+struct BlockCnt;  /* defined in lparser.c */
+
+
+/* state needed to generate code for a given function */
+typedef struct FuncState {
+  Proto *f;  /* current function header */
+  Table *h;  /* table to find (and reuse) elements in `k' */
+  struct FuncState *prev;  /* enclosing function */
+  struct LexState *ls;  /* lexical state */
+  struct lua_State *L;  /* copy of the Lua state */
+  struct BlockCnt *bl;  /* chain of current blocks */
+  int pc;  /* next position to code (equivalent to `ncode') */
+  int lasttarget;   /* `pc' of last `jump target' */
+  int jpc;  /* list of pending jumps to `pc' */
+  int freereg;  /* first free register */
+  int nk;  /* number of elements in `k' */
+  int np;  /* number of elements in `p' */
+  short nlocvars;  /* number of elements in `locvars' */
+  lu_byte nactvar;  /* number of active local variables */
+  upvaldesc upvalues[LUAI_MAXUPVALUES];  /* upvalues */
+  unsigned short actvar[LUAI_MAXVARS];  /* declared-variable stack */
+} FuncState;
+
+
+LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,
+                                            const char *name);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/lstate.c b/redis-stable/deps/lua/src/lstate.c
new file mode 100644
index 00000000..4313b83a
--- /dev/null
+++ b/redis-stable/deps/lua/src/lstate.c
@@ -0,0 +1,214 @@
+/*
+** $Id: lstate.c,v 2.36.1.2 2008/01/03 15:20:39 roberto Exp $
+** Global State
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define lstate_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "llex.h"
+#include "lmem.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+#define state_size(x)	(sizeof(x) + LUAI_EXTRASPACE)
+#define fromstate(l)	(cast(lu_byte *, (l)) - LUAI_EXTRASPACE)
+#define tostate(l)   (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE))
+
+
+/*
+** Main thread combines a thread state and the global state
+*/
+typedef struct LG {
+  lua_State l;
+  global_State g;
+} LG;
+  
+
+
+static void stack_init (lua_State *L1, lua_State *L) {
+  /* initialize CallInfo array */
+  L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo);
+  L1->ci = L1->base_ci;
+  L1->size_ci = BASIC_CI_SIZE;
+  L1->end_ci = L1->base_ci + L1->size_ci - 1;
+  /* initialize stack array */
+  L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TValue);
+  L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK;
+  L1->top = L1->stack;
+  L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1;
+  /* initialize first ci */
+  L1->ci->func = L1->top;
+  setnilvalue(L1->top++);  /* `function' entry for this `ci' */
+  L1->base = L1->ci->base = L1->top;
+  L1->ci->top = L1->top + LUA_MINSTACK;
+}
+
+
+static void freestack (lua_State *L, lua_State *L1) {
+  luaM_freearray(L, L1->base_ci, L1->size_ci, CallInfo);
+  luaM_freearray(L, L1->stack, L1->stacksize, TValue);
+}
+
+
+/*
+** open parts that may cause memory-allocation errors
+*/
+static void f_luaopen (lua_State *L, void *ud) {
+  global_State *g = G(L);
+  UNUSED(ud);
+  stack_init(L, L);  /* init stack */
+  sethvalue(L, gt(L), luaH_new(L, 0, 2));  /* table of globals */
+  sethvalue(L, registry(L), luaH_new(L, 0, 2));  /* registry */
+  luaS_resize(L, MINSTRTABSIZE);  /* initial size of string table */
+  luaT_init(L);
+  luaX_init(L);
+  luaS_fix(luaS_newliteral(L, MEMERRMSG));
+  g->GCthreshold = 4*g->totalbytes;
+}
+
+
+static void preinit_state (lua_State *L, global_State *g) {
+  G(L) = g;
+  L->stack = NULL;
+  L->stacksize = 0;
+  L->errorJmp = NULL;
+  L->hook = NULL;
+  L->hookmask = 0;
+  L->basehookcount = 0;
+  L->allowhook = 1;
+  resethookcount(L);
+  L->openupval = NULL;
+  L->size_ci = 0;
+  L->nCcalls = L->baseCcalls = 0;
+  L->status = 0;
+  L->base_ci = L->ci = NULL;
+  L->savedpc = NULL;
+  L->errfunc = 0;
+  setnilvalue(gt(L));
+}
+
+
+static void close_state (lua_State *L) {
+  global_State *g = G(L);
+  luaF_close(L, L->stack);  /* close all upvalues for this thread */
+  luaC_freeall(L);  /* collect all objects */
+  lua_assert(g->rootgc == obj2gco(L));
+  lua_assert(g->strt.nuse == 0);
+  luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
+  luaZ_freebuffer(L, &g->buff);
+  freestack(L, L);
+  lua_assert(g->totalbytes == sizeof(LG));
+  (*g->frealloc)(g->ud, fromstate(L), state_size(LG), 0);
+}
+
+
+lua_State *luaE_newthread (lua_State *L) {
+  lua_State *L1 = tostate(luaM_malloc(L, state_size(lua_State)));
+  luaC_link(L, obj2gco(L1), LUA_TTHREAD);
+  preinit_state(L1, G(L));
+  stack_init(L1, L);  /* init stack */
+  setobj2n(L, gt(L1), gt(L));  /* share table of globals */
+  L1->hookmask = L->hookmask;
+  L1->basehookcount = L->basehookcount;
+  L1->hook = L->hook;
+  resethookcount(L1);
+  lua_assert(iswhite(obj2gco(L1)));
+  return L1;
+}
+
+
+void luaE_freethread (lua_State *L, lua_State *L1) {
+  luaF_close(L1, L1->stack);  /* close all upvalues for this thread */
+  lua_assert(L1->openupval == NULL);
+  luai_userstatefree(L1);
+  freestack(L, L1);
+  luaM_freemem(L, fromstate(L1), state_size(lua_State));
+}
+
+
+LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) {
+  int i;
+  lua_State *L;
+  global_State *g;
+  void *l = (*f)(ud, NULL, 0, state_size(LG));
+  if (l == NULL) return NULL;
+  L = tostate(l);
+  g = &((LG *)L)->g;
+  L->next = NULL;
+  L->tt = LUA_TTHREAD;
+  g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT);
+  L->marked = luaC_white(g);
+  set2bits(L->marked, FIXEDBIT, SFIXEDBIT);
+  preinit_state(L, g);
+  g->frealloc = f;
+  g->ud = ud;
+  g->mainthread = L;
+  g->uvhead.u.l.prev = &g->uvhead;
+  g->uvhead.u.l.next = &g->uvhead;
+  g->GCthreshold = 0;  /* mark it as unfinished state */
+  g->strt.size = 0;
+  g->strt.nuse = 0;
+  g->strt.hash = NULL;
+  setnilvalue(registry(L));
+  luaZ_initbuffer(L, &g->buff);
+  g->panic = NULL;
+  g->gcstate = GCSpause;
+  g->rootgc = obj2gco(L);
+  g->sweepstrgc = 0;
+  g->sweepgc = &g->rootgc;
+  g->gray = NULL;
+  g->grayagain = NULL;
+  g->weak = NULL;
+  g->tmudata = NULL;
+  g->totalbytes = sizeof(LG);
+  g->gcpause = LUAI_GCPAUSE;
+  g->gcstepmul = LUAI_GCMUL;
+  g->gcdept = 0;
+  for (i=0; i<NUM_TAGS; i++) g->mt[i] = NULL;
+  if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) {
+    /* memory allocation error: free partial state */
+    close_state(L);
+    L = NULL;
+  }
+  else
+    luai_userstateopen(L);
+  return L;
+}
+
+
+static void callallgcTM (lua_State *L, void *ud) {
+  UNUSED(ud);
+  luaC_callGCTM(L);  /* call GC metamethods for all udata */
+}
+
+
+LUA_API void lua_close (lua_State *L) {
+  L = G(L)->mainthread;  /* only the main thread can be closed */
+  lua_lock(L);
+  luaF_close(L, L->stack);  /* close all upvalues for this thread */
+  luaC_separateudata(L, 1);  /* separate udata that have GC metamethods */
+  L->errfunc = 0;  /* no error function during GC metamethods */
+  do {  /* repeat until no more errors */
+    L->ci = L->base_ci;
+    L->base = L->top = L->ci->base;
+    L->nCcalls = L->baseCcalls = 0;
+  } while (luaD_rawrunprotected(L, callallgcTM, NULL) != 0);
+  lua_assert(G(L)->tmudata == NULL);
+  luai_userstateclose(L);
+  close_state(L);
+}
+
diff --git a/redis-stable/deps/lua/src/lstate.h b/redis-stable/deps/lua/src/lstate.h
new file mode 100644
index 00000000..3bc575b6
--- /dev/null
+++ b/redis-stable/deps/lua/src/lstate.h
@@ -0,0 +1,169 @@
+/*
+** $Id: lstate.h,v 2.24.1.2 2008/01/03 15:20:39 roberto Exp $
+** Global State
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lstate_h
+#define lstate_h
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "ltm.h"
+#include "lzio.h"
+
+
+
+struct lua_longjmp;  /* defined in ldo.c */
+
+
+/* table of globals */
+#define gt(L)	(&L->l_gt)
+
+/* registry */
+#define registry(L)	(&G(L)->l_registry)
+
+
+/* extra stack space to handle TM calls and some other extras */
+#define EXTRA_STACK   5
+
+
+#define BASIC_CI_SIZE           8
+
+#define BASIC_STACK_SIZE        (2*LUA_MINSTACK)
+
+
+
+typedef struct stringtable {
+  GCObject **hash;
+  lu_int32 nuse;  /* number of elements */
+  int size;
+} stringtable;
+
+
+/*
+** informations about a call
+*/
+typedef struct CallInfo {
+  StkId base;  /* base for this function */
+  StkId func;  /* function index in the stack */
+  StkId	top;  /* top for this function */
+  const Instruction *savedpc;
+  int nresults;  /* expected number of results from this function */
+  int tailcalls;  /* number of tail calls lost under this entry */
+} CallInfo;
+
+
+
+#define curr_func(L)	(clvalue(L->ci->func))
+#define ci_func(ci)	(clvalue((ci)->func))
+#define f_isLua(ci)	(!ci_func(ci)->c.isC)
+#define isLua(ci)	(ttisfunction((ci)->func) && f_isLua(ci))
+
+
+/*
+** `global state', shared by all threads of this state
+*/
+typedef struct global_State {
+  stringtable strt;  /* hash table for strings */
+  lua_Alloc frealloc;  /* function to reallocate memory */
+  void *ud;         /* auxiliary data to `frealloc' */
+  lu_byte currentwhite;
+  lu_byte gcstate;  /* state of garbage collector */
+  int sweepstrgc;  /* position of sweep in `strt' */
+  GCObject *rootgc;  /* list of all collectable objects */
+  GCObject **sweepgc;  /* position of sweep in `rootgc' */
+  GCObject *gray;  /* list of gray objects */
+  GCObject *grayagain;  /* list of objects to be traversed atomically */
+  GCObject *weak;  /* list of weak tables (to be cleared) */
+  GCObject *tmudata;  /* last element of list of userdata to be GC */
+  Mbuffer buff;  /* temporary buffer for string concatentation */
+  lu_mem GCthreshold;
+  lu_mem totalbytes;  /* number of bytes currently allocated */
+  lu_mem estimate;  /* an estimate of number of bytes actually in use */
+  lu_mem gcdept;  /* how much GC is `behind schedule' */
+  int gcpause;  /* size of pause between successive GCs */
+  int gcstepmul;  /* GC `granularity' */
+  lua_CFunction panic;  /* to be called in unprotected errors */
+  TValue l_registry;
+  struct lua_State *mainthread;
+  UpVal uvhead;  /* head of double-linked list of all open upvalues */
+  struct Table *mt[NUM_TAGS];  /* metatables for basic types */
+  TString *tmname[TM_N];  /* array with tag-method names */
+} global_State;
+
+
+/*
+** `per thread' state
+*/
+struct lua_State {
+  CommonHeader;
+  lu_byte status;
+  StkId top;  /* first free slot in the stack */
+  StkId base;  /* base of current function */
+  global_State *l_G;
+  CallInfo *ci;  /* call info for current function */
+  const Instruction *savedpc;  /* `savedpc' of current function */
+  StkId stack_last;  /* last free slot in the stack */
+  StkId stack;  /* stack base */
+  CallInfo *end_ci;  /* points after end of ci array*/
+  CallInfo *base_ci;  /* array of CallInfo's */
+  int stacksize;
+  int size_ci;  /* size of array `base_ci' */
+  unsigned short nCcalls;  /* number of nested C calls */
+  unsigned short baseCcalls;  /* nested C calls when resuming coroutine */
+  lu_byte hookmask;
+  lu_byte allowhook;
+  int basehookcount;
+  int hookcount;
+  lua_Hook hook;
+  TValue l_gt;  /* table of globals */
+  TValue env;  /* temporary place for environments */
+  GCObject *openupval;  /* list of open upvalues in this stack */
+  GCObject *gclist;
+  struct lua_longjmp *errorJmp;  /* current error recover point */
+  ptrdiff_t errfunc;  /* current error handling function (stack index) */
+};
+
+
+#define G(L)	(L->l_G)
+
+
+/*
+** Union of all collectable objects
+*/
+union GCObject {
+  GCheader gch;
+  union TString ts;
+  union Udata u;
+  union Closure cl;
+  struct Table h;
+  struct Proto p;
+  struct UpVal uv;
+  struct lua_State th;  /* thread */
+};
+
+
+/* macros to convert a GCObject into a specific value */
+#define rawgco2ts(o)	check_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts))
+#define gco2ts(o)	(&rawgco2ts(o)->tsv)
+#define rawgco2u(o)	check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
+#define gco2u(o)	(&rawgco2u(o)->uv)
+#define gco2cl(o)	check_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl))
+#define gco2h(o)	check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))
+#define gco2p(o)	check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))
+#define gco2uv(o)	check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv))
+#define ngcotouv(o) \
+	check_exp((o) == NULL || (o)->gch.tt == LUA_TUPVAL, &((o)->uv))
+#define gco2th(o)	check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))
+
+/* macro to convert any Lua object into a GCObject */
+#define obj2gco(v)	(cast(GCObject *, (v)))
+
+
+LUAI_FUNC lua_State *luaE_newthread (lua_State *L);
+LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
+
+#endif
+
diff --git a/redis-stable/deps/lua/src/lstring.c b/redis-stable/deps/lua/src/lstring.c
new file mode 100644
index 00000000..49113151
--- /dev/null
+++ b/redis-stable/deps/lua/src/lstring.c
@@ -0,0 +1,111 @@
+/*
+** $Id: lstring.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** String table (keeps all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lstring_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+
+
+
+void luaS_resize (lua_State *L, int newsize) {
+  GCObject **newhash;
+  stringtable *tb;
+  int i;
+  if (G(L)->gcstate == GCSsweepstring)
+    return;  /* cannot resize during GC traverse */
+  newhash = luaM_newvector(L, newsize, GCObject *);
+  tb = &G(L)->strt;
+  for (i=0; i<newsize; i++) newhash[i] = NULL;
+  /* rehash */
+  for (i=0; i<tb->size; i++) {
+    GCObject *p = tb->hash[i];
+    while (p) {  /* for each node in the list */
+      GCObject *next = p->gch.next;  /* save next */
+      unsigned int h = gco2ts(p)->hash;
+      int h1 = lmod(h, newsize);  /* new position */
+      lua_assert(cast_int(h%newsize) == lmod(h, newsize));
+      p->gch.next = newhash[h1];  /* chain it */
+      newhash[h1] = p;
+      p = next;
+    }
+  }
+  luaM_freearray(L, tb->hash, tb->size, TString *);
+  tb->size = newsize;
+  tb->hash = newhash;
+}
+
+
+static TString *newlstr (lua_State *L, const char *str, size_t l,
+                                       unsigned int h) {
+  TString *ts;
+  stringtable *tb;
+  if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char))
+    luaM_toobig(L);
+  ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString)));
+  ts->tsv.len = l;
+  ts->tsv.hash = h;
+  ts->tsv.marked = luaC_white(G(L));
+  ts->tsv.tt = LUA_TSTRING;
+  ts->tsv.reserved = 0;
+  memcpy(ts+1, str, l*sizeof(char));
+  ((char *)(ts+1))[l] = '\0';  /* ending 0 */
+  tb = &G(L)->strt;
+  h = lmod(h, tb->size);
+  ts->tsv.next = tb->hash[h];  /* chain new entry */
+  tb->hash[h] = obj2gco(ts);
+  tb->nuse++;
+  if (tb->nuse > cast(lu_int32, tb->size) && tb->size <= MAX_INT/2)
+    luaS_resize(L, tb->size*2);  /* too crowded */
+  return ts;
+}
+
+
+TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
+  GCObject *o;
+  unsigned int h = cast(unsigned int, l);  /* seed */
+  size_t step = (l>>5)+1;  /* if string is too long, don't hash all its chars */
+  size_t l1;
+  for (l1=l; l1>=step; l1-=step)  /* compute hash */
+    h = h ^ ((h<<5)+(h>>2)+cast(unsigned char, str[l1-1]));
+  for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
+       o != NULL;
+       o = o->gch.next) {
+    TString *ts = rawgco2ts(o);
+    if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) {
+      /* string may be dead */
+      if (isdead(G(L), o)) changewhite(o);
+      return ts;
+    }
+  }
+  return newlstr(L, str, l, h);  /* not found */
+}
+
+
+Udata *luaS_newudata (lua_State *L, size_t s, Table *e) {
+  Udata *u;
+  if (s > MAX_SIZET - sizeof(Udata))
+    luaM_toobig(L);
+  u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata)));
+  u->uv.marked = luaC_white(G(L));  /* is not finalized */
+  u->uv.tt = LUA_TUSERDATA;
+  u->uv.len = s;
+  u->uv.metatable = NULL;
+  u->uv.env = e;
+  /* chain it on udata list (after main thread) */
+  u->uv.next = G(L)->mainthread->next;
+  G(L)->mainthread->next = obj2gco(u);
+  return u;
+}
+
diff --git a/redis-stable/deps/lua/src/lstring.h b/redis-stable/deps/lua/src/lstring.h
new file mode 100644
index 00000000..73a2ff8b
--- /dev/null
+++ b/redis-stable/deps/lua/src/lstring.h
@@ -0,0 +1,31 @@
+/*
+** $Id: lstring.h,v 1.43.1.1 2007/12/27 13:02:25 roberto Exp $
+** String table (keep all strings handled by Lua)
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lstring_h
+#define lstring_h
+
+
+#include "lgc.h"
+#include "lobject.h"
+#include "lstate.h"
+
+
+#define sizestring(s)	(sizeof(union TString)+((s)->len+1)*sizeof(char))
+
+#define sizeudata(u)	(sizeof(union Udata)+(u)->len)
+
+#define luaS_new(L, s)	(luaS_newlstr(L, s, strlen(s)))
+#define luaS_newliteral(L, s)	(luaS_newlstr(L, "" s, \
+                                 (sizeof(s)/sizeof(char))-1))
+
+#define luaS_fix(s)	l_setbit((s)->tsv.marked, FIXEDBIT)
+
+LUAI_FUNC void luaS_resize (lua_State *L, int newsize);
+LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e);
+LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l);
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/lstrlib.c b/redis-stable/deps/lua/src/lstrlib.c
new file mode 100644
index 00000000..7a03489b
--- /dev/null
+++ b/redis-stable/deps/lua/src/lstrlib.c
@@ -0,0 +1,871 @@
+/*
+** $Id: lstrlib.c,v 1.132.1.5 2010/05/14 15:34:19 roberto Exp $
+** Standard library for string operations and pattern-matching
+** See Copyright Notice in lua.h
+*/
+
+
+#include <ctype.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lstrlib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+/* macro to `unsign' a character */
+#define uchar(c)        ((unsigned char)(c))
+
+
+
+static int str_len (lua_State *L) {
+  size_t l;
+  luaL_checklstring(L, 1, &l);
+  lua_pushinteger(L, l);
+  return 1;
+}
+
+
+static ptrdiff_t posrelat (ptrdiff_t pos, size_t len) {
+  /* relative string position: negative means back from end */
+  if (pos < 0) pos += (ptrdiff_t)len + 1;
+  return (pos >= 0) ? pos : 0;
+}
+
+
+static int str_sub (lua_State *L) {
+  size_t l;
+  const char *s = luaL_checklstring(L, 1, &l);
+  ptrdiff_t start = posrelat(luaL_checkinteger(L, 2), l);
+  ptrdiff_t end = posrelat(luaL_optinteger(L, 3, -1), l);
+  if (start < 1) start = 1;
+  if (end > (ptrdiff_t)l) end = (ptrdiff_t)l;
+  if (start <= end)
+    lua_pushlstring(L, s+start-1, end-start+1);
+  else lua_pushliteral(L, "");
+  return 1;
+}
+
+
+static int str_reverse (lua_State *L) {
+  size_t l;
+  luaL_Buffer b;
+  const char *s = luaL_checklstring(L, 1, &l);
+  luaL_buffinit(L, &b);
+  while (l--) luaL_addchar(&b, s[l]);
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static int str_lower (lua_State *L) {
+  size_t l;
+  size_t i;
+  luaL_Buffer b;
+  const char *s = luaL_checklstring(L, 1, &l);
+  luaL_buffinit(L, &b);
+  for (i=0; i<l; i++)
+    luaL_addchar(&b, tolower(uchar(s[i])));
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static int str_upper (lua_State *L) {
+  size_t l;
+  size_t i;
+  luaL_Buffer b;
+  const char *s = luaL_checklstring(L, 1, &l);
+  luaL_buffinit(L, &b);
+  for (i=0; i<l; i++)
+    luaL_addchar(&b, toupper(uchar(s[i])));
+  luaL_pushresult(&b);
+  return 1;
+}
+
+static int str_rep (lua_State *L) {
+  size_t l;
+  luaL_Buffer b;
+  const char *s = luaL_checklstring(L, 1, &l);
+  int n = luaL_checkint(L, 2);
+  luaL_buffinit(L, &b);
+  while (n-- > 0)
+    luaL_addlstring(&b, s, l);
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static int str_byte (lua_State *L) {
+  size_t l;
+  const char *s = luaL_checklstring(L, 1, &l);
+  ptrdiff_t posi = posrelat(luaL_optinteger(L, 2, 1), l);
+  ptrdiff_t pose = posrelat(luaL_optinteger(L, 3, posi), l);
+  int n, i;
+  if (posi <= 0) posi = 1;
+  if ((size_t)pose > l) pose = l;
+  if (posi > pose) return 0;  /* empty interval; return no values */
+  n = (int)(pose -  posi + 1);
+  if (posi + n <= pose)  /* overflow? */
+    luaL_error(L, "string slice too long");
+  luaL_checkstack(L, n, "string slice too long");
+  for (i=0; i<n; i++)
+    lua_pushinteger(L, uchar(s[posi+i-1]));
+  return n;
+}
+
+
+static int str_char (lua_State *L) {
+  int n = lua_gettop(L);  /* number of arguments */
+  int i;
+  luaL_Buffer b;
+  luaL_buffinit(L, &b);
+  for (i=1; i<=n; i++) {
+    int c = luaL_checkint(L, i);
+    luaL_argcheck(L, uchar(c) == c, i, "invalid value");
+    luaL_addchar(&b, uchar(c));
+  }
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static int writer (lua_State *L, const void* b, size_t size, void* B) {
+  (void)L;
+  luaL_addlstring((luaL_Buffer*) B, (const char *)b, size);
+  return 0;
+}
+
+
+static int str_dump (lua_State *L) {
+  luaL_Buffer b;
+  luaL_checktype(L, 1, LUA_TFUNCTION);
+  lua_settop(L, 1);
+  luaL_buffinit(L,&b);
+  if (lua_dump(L, writer, &b) != 0)
+    luaL_error(L, "unable to dump given function");
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+
+/*
+** {======================================================
+** PATTERN MATCHING
+** =======================================================
+*/
+
+
+#define CAP_UNFINISHED	(-1)
+#define CAP_POSITION	(-2)
+
+typedef struct MatchState {
+  const char *src_init;  /* init of source string */
+  const char *src_end;  /* end (`\0') of source string */
+  lua_State *L;
+  int level;  /* total number of captures (finished or unfinished) */
+  struct {
+    const char *init;
+    ptrdiff_t len;
+  } capture[LUA_MAXCAPTURES];
+} MatchState;
+
+
+#define L_ESC		'%'
+#define SPECIALS	"^$*+?.([%-"
+
+
+static int check_capture (MatchState *ms, int l) {
+  l -= '1';
+  if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)
+    return luaL_error(ms->L, "invalid capture index");
+  return l;
+}
+
+
+static int capture_to_close (MatchState *ms) {
+  int level = ms->level;
+  for (level--; level>=0; level--)
+    if (ms->capture[level].len == CAP_UNFINISHED) return level;
+  return luaL_error(ms->L, "invalid pattern capture");
+}
+
+
+static const char *classend (MatchState *ms, const char *p) {
+  switch (*p++) {
+    case L_ESC: {
+      if (*p == '\0')
+        luaL_error(ms->L, "malformed pattern (ends with " LUA_QL("%%") ")");
+      return p+1;
+    }
+    case '[': {
+      if (*p == '^') p++;
+      do {  /* look for a `]' */
+        if (*p == '\0')
+          luaL_error(ms->L, "malformed pattern (missing " LUA_QL("]") ")");
+        if (*(p++) == L_ESC && *p != '\0')
+          p++;  /* skip escapes (e.g. `%]') */
+      } while (*p != ']');
+      return p+1;
+    }
+    default: {
+      return p;
+    }
+  }
+}
+
+
+static int match_class (int c, int cl) {
+  int res;
+  switch (tolower(cl)) {
+    case 'a' : res = isalpha(c); break;
+    case 'c' : res = iscntrl(c); break;
+    case 'd' : res = isdigit(c); break;
+    case 'l' : res = islower(c); break;
+    case 'p' : res = ispunct(c); break;
+    case 's' : res = isspace(c); break;
+    case 'u' : res = isupper(c); break;
+    case 'w' : res = isalnum(c); break;
+    case 'x' : res = isxdigit(c); break;
+    case 'z' : res = (c == 0); break;
+    default: return (cl == c);
+  }
+  return (islower(cl) ? res : !res);
+}
+
+
+static int matchbracketclass (int c, const char *p, const char *ec) {
+  int sig = 1;
+  if (*(p+1) == '^') {
+    sig = 0;
+    p++;  /* skip the `^' */
+  }
+  while (++p < ec) {
+    if (*p == L_ESC) {
+      p++;
+      if (match_class(c, uchar(*p)))
+        return sig;
+    }
+    else if ((*(p+1) == '-') && (p+2 < ec)) {
+      p+=2;
+      if (uchar(*(p-2)) <= c && c <= uchar(*p))
+        return sig;
+    }
+    else if (uchar(*p) == c) return sig;
+  }
+  return !sig;
+}
+
+
+static int singlematch (int c, const char *p, const char *ep) {
+  switch (*p) {
+    case '.': return 1;  /* matches any char */
+    case L_ESC: return match_class(c, uchar(*(p+1)));
+    case '[': return matchbracketclass(c, p, ep-1);
+    default:  return (uchar(*p) == c);
+  }
+}
+
+
+static const char *match (MatchState *ms, const char *s, const char *p);
+
+
+static const char *matchbalance (MatchState *ms, const char *s,
+                                   const char *p) {
+  if (*p == 0 || *(p+1) == 0)
+    luaL_error(ms->L, "unbalanced pattern");
+  if (*s != *p) return NULL;
+  else {
+    int b = *p;
+    int e = *(p+1);
+    int cont = 1;
+    while (++s < ms->src_end) {
+      if (*s == e) {
+        if (--cont == 0) return s+1;
+      }
+      else if (*s == b) cont++;
+    }
+  }
+  return NULL;  /* string ends out of balance */
+}
+
+
+static const char *max_expand (MatchState *ms, const char *s,
+                                 const char *p, const char *ep) {
+  ptrdiff_t i = 0;  /* counts maximum expand for item */
+  while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep))
+    i++;
+  /* keeps trying to match with the maximum repetitions */
+  while (i>=0) {
+    const char *res = match(ms, (s+i), ep+1);
+    if (res) return res;
+    i--;  /* else didn't match; reduce 1 repetition to try again */
+  }
+  return NULL;
+}
+
+
+static const char *min_expand (MatchState *ms, const char *s,
+                                 const char *p, const char *ep) {
+  for (;;) {
+    const char *res = match(ms, s, ep+1);
+    if (res != NULL)
+      return res;
+    else if (s<ms->src_end && singlematch(uchar(*s), p, ep))
+      s++;  /* try with one more repetition */
+    else return NULL;
+  }
+}
+
+
+static const char *start_capture (MatchState *ms, const char *s,
+                                    const char *p, int what) {
+  const char *res;
+  int level = ms->level;
+  if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures");
+  ms->capture[level].init = s;
+  ms->capture[level].len = what;
+  ms->level = level+1;
+  if ((res=match(ms, s, p)) == NULL)  /* match failed? */
+    ms->level--;  /* undo capture */
+  return res;
+}
+
+
+static const char *end_capture (MatchState *ms, const char *s,
+                                  const char *p) {
+  int l = capture_to_close(ms);
+  const char *res;
+  ms->capture[l].len = s - ms->capture[l].init;  /* close capture */
+  if ((res = match(ms, s, p)) == NULL)  /* match failed? */
+    ms->capture[l].len = CAP_UNFINISHED;  /* undo capture */
+  return res;
+}
+
+
+static const char *match_capture (MatchState *ms, const char *s, int l) {
+  size_t len;
+  l = check_capture(ms, l);
+  len = ms->capture[l].len;
+  if ((size_t)(ms->src_end-s) >= len &&
+      memcmp(ms->capture[l].init, s, len) == 0)
+    return s+len;
+  else return NULL;
+}
+
+
+static const char *match (MatchState *ms, const char *s, const char *p) {
+  init: /* using goto's to optimize tail recursion */
+  switch (*p) {
+    case '(': {  /* start capture */
+      if (*(p+1) == ')')  /* position capture? */
+        return start_capture(ms, s, p+2, CAP_POSITION);
+      else
+        return start_capture(ms, s, p+1, CAP_UNFINISHED);
+    }
+    case ')': {  /* end capture */
+      return end_capture(ms, s, p+1);
+    }
+    case L_ESC: {
+      switch (*(p+1)) {
+        case 'b': {  /* balanced string? */
+          s = matchbalance(ms, s, p+2);
+          if (s == NULL) return NULL;
+          p+=4; goto init;  /* else return match(ms, s, p+4); */
+        }
+        case 'f': {  /* frontier? */
+          const char *ep; char previous;
+          p += 2;
+          if (*p != '[')
+            luaL_error(ms->L, "missing " LUA_QL("[") " after "
+                               LUA_QL("%%f") " in pattern");
+          ep = classend(ms, p);  /* points to what is next */
+          previous = (s == ms->src_init) ? '\0' : *(s-1);
+          if (matchbracketclass(uchar(previous), p, ep-1) ||
+             !matchbracketclass(uchar(*s), p, ep-1)) return NULL;
+          p=ep; goto init;  /* else return match(ms, s, ep); */
+        }
+        default: {
+          if (isdigit(uchar(*(p+1)))) {  /* capture results (%0-%9)? */
+            s = match_capture(ms, s, uchar(*(p+1)));
+            if (s == NULL) return NULL;
+            p+=2; goto init;  /* else return match(ms, s, p+2) */
+          }
+          goto dflt;  /* case default */
+        }
+      }
+    }
+    case '\0': {  /* end of pattern */
+      return s;  /* match succeeded */
+    }
+    case '$': {
+      if (*(p+1) == '\0')  /* is the `$' the last char in pattern? */
+        return (s == ms->src_end) ? s : NULL;  /* check end of string */
+      else goto dflt;
+    }
+    default: dflt: {  /* it is a pattern item */
+      const char *ep = classend(ms, p);  /* points to what is next */
+      int m = s<ms->src_end && singlematch(uchar(*s), p, ep);
+      switch (*ep) {
+        case '?': {  /* optional */
+          const char *res;
+          if (m && ((res=match(ms, s+1, ep+1)) != NULL))
+            return res;
+          p=ep+1; goto init;  /* else return match(ms, s, ep+1); */
+        }
+        case '*': {  /* 0 or more repetitions */
+          return max_expand(ms, s, p, ep);
+        }
+        case '+': {  /* 1 or more repetitions */
+          return (m ? max_expand(ms, s+1, p, ep) : NULL);
+        }
+        case '-': {  /* 0 or more repetitions (minimum) */
+          return min_expand(ms, s, p, ep);
+        }
+        default: {
+          if (!m) return NULL;
+          s++; p=ep; goto init;  /* else return match(ms, s+1, ep); */
+        }
+      }
+    }
+  }
+}
+
+
+
+static const char *lmemfind (const char *s1, size_t l1,
+                               const char *s2, size_t l2) {
+  if (l2 == 0) return s1;  /* empty strings are everywhere */
+  else if (l2 > l1) return NULL;  /* avoids a negative `l1' */
+  else {
+    const char *init;  /* to search for a `*s2' inside `s1' */
+    l2--;  /* 1st char will be checked by `memchr' */
+    l1 = l1-l2;  /* `s2' cannot be found after that */
+    while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) {
+      init++;   /* 1st char is already checked */
+      if (memcmp(init, s2+1, l2) == 0)
+        return init-1;
+      else {  /* correct `l1' and `s1' to try again */
+        l1 -= init-s1;
+        s1 = init;
+      }
+    }
+    return NULL;  /* not found */
+  }
+}
+
+
+static void push_onecapture (MatchState *ms, int i, const char *s,
+                                                    const char *e) {
+  if (i >= ms->level) {
+    if (i == 0)  /* ms->level == 0, too */
+      lua_pushlstring(ms->L, s, e - s);  /* add whole match */
+    else
+      luaL_error(ms->L, "invalid capture index");
+  }
+  else {
+    ptrdiff_t l = ms->capture[i].len;
+    if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture");
+    if (l == CAP_POSITION)
+      lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1);
+    else
+      lua_pushlstring(ms->L, ms->capture[i].init, l);
+  }
+}
+
+
+static int push_captures (MatchState *ms, const char *s, const char *e) {
+  int i;
+  int nlevels = (ms->level == 0 && s) ? 1 : ms->level;
+  luaL_checkstack(ms->L, nlevels, "too many captures");
+  for (i = 0; i < nlevels; i++)
+    push_onecapture(ms, i, s, e);
+  return nlevels;  /* number of strings pushed */
+}
+
+
+static int str_find_aux (lua_State *L, int find) {
+  size_t l1, l2;
+  const char *s = luaL_checklstring(L, 1, &l1);
+  const char *p = luaL_checklstring(L, 2, &l2);
+  ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1;
+  if (init < 0) init = 0;
+  else if ((size_t)(init) > l1) init = (ptrdiff_t)l1;
+  if (find && (lua_toboolean(L, 4) ||  /* explicit request? */
+      strpbrk(p, SPECIALS) == NULL)) {  /* or no special characters? */
+    /* do a plain search */
+    const char *s2 = lmemfind(s+init, l1-init, p, l2);
+    if (s2) {
+      lua_pushinteger(L, s2-s+1);
+      lua_pushinteger(L, s2-s+l2);
+      return 2;
+    }
+  }
+  else {
+    MatchState ms;
+    int anchor = (*p == '^') ? (p++, 1) : 0;
+    const char *s1=s+init;
+    ms.L = L;
+    ms.src_init = s;
+    ms.src_end = s+l1;
+    do {
+      const char *res;
+      ms.level = 0;
+      if ((res=match(&ms, s1, p)) != NULL) {
+        if (find) {
+          lua_pushinteger(L, s1-s+1);  /* start */
+          lua_pushinteger(L, res-s);   /* end */
+          return push_captures(&ms, NULL, 0) + 2;
+        }
+        else
+          return push_captures(&ms, s1, res);
+      }
+    } while (s1++ < ms.src_end && !anchor);
+  }
+  lua_pushnil(L);  /* not found */
+  return 1;
+}
+
+
+static int str_find (lua_State *L) {
+  return str_find_aux(L, 1);
+}
+
+
+static int str_match (lua_State *L) {
+  return str_find_aux(L, 0);
+}
+
+
+static int gmatch_aux (lua_State *L) {
+  MatchState ms;
+  size_t ls;
+  const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls);
+  const char *p = lua_tostring(L, lua_upvalueindex(2));
+  const char *src;
+  ms.L = L;
+  ms.src_init = s;
+  ms.src_end = s+ls;
+  for (src = s + (size_t)lua_tointeger(L, lua_upvalueindex(3));
+       src <= ms.src_end;
+       src++) {
+    const char *e;
+    ms.level = 0;
+    if ((e = match(&ms, src, p)) != NULL) {
+      lua_Integer newstart = e-s;
+      if (e == src) newstart++;  /* empty match? go at least one position */
+      lua_pushinteger(L, newstart);
+      lua_replace(L, lua_upvalueindex(3));
+      return push_captures(&ms, src, e);
+    }
+  }
+  return 0;  /* not found */
+}
+
+
+static int gmatch (lua_State *L) {
+  luaL_checkstring(L, 1);
+  luaL_checkstring(L, 2);
+  lua_settop(L, 2);
+  lua_pushinteger(L, 0);
+  lua_pushcclosure(L, gmatch_aux, 3);
+  return 1;
+}
+
+
+static int gfind_nodef (lua_State *L) {
+  return luaL_error(L, LUA_QL("string.gfind") " was renamed to "
+                       LUA_QL("string.gmatch"));
+}
+
+
+static void add_s (MatchState *ms, luaL_Buffer *b, const char *s,
+                                                   const char *e) {
+  size_t l, i;
+  const char *news = lua_tolstring(ms->L, 3, &l);
+  for (i = 0; i < l; i++) {
+    if (news[i] != L_ESC)
+      luaL_addchar(b, news[i]);
+    else {
+      i++;  /* skip ESC */
+      if (!isdigit(uchar(news[i])))
+        luaL_addchar(b, news[i]);
+      else if (news[i] == '0')
+          luaL_addlstring(b, s, e - s);
+      else {
+        push_onecapture(ms, news[i] - '1', s, e);
+        luaL_addvalue(b);  /* add capture to accumulated result */
+      }
+    }
+  }
+}
+
+
+static void add_value (MatchState *ms, luaL_Buffer *b, const char *s,
+                                                       const char *e) {
+  lua_State *L = ms->L;
+  switch (lua_type(L, 3)) {
+    case LUA_TNUMBER:
+    case LUA_TSTRING: {
+      add_s(ms, b, s, e);
+      return;
+    }
+    case LUA_TFUNCTION: {
+      int n;
+      lua_pushvalue(L, 3);
+      n = push_captures(ms, s, e);
+      lua_call(L, n, 1);
+      break;
+    }
+    case LUA_TTABLE: {
+      push_onecapture(ms, 0, s, e);
+      lua_gettable(L, 3);
+      break;
+    }
+  }
+  if (!lua_toboolean(L, -1)) {  /* nil or false? */
+    lua_pop(L, 1);
+    lua_pushlstring(L, s, e - s);  /* keep original text */
+  }
+  else if (!lua_isstring(L, -1))
+    luaL_error(L, "invalid replacement value (a %s)", luaL_typename(L, -1)); 
+  luaL_addvalue(b);  /* add result to accumulator */
+}
+
+
+static int str_gsub (lua_State *L) {
+  size_t srcl;
+  const char *src = luaL_checklstring(L, 1, &srcl);
+  const char *p = luaL_checkstring(L, 2);
+  int  tr = lua_type(L, 3);
+  int max_s = luaL_optint(L, 4, srcl+1);
+  int anchor = (*p == '^') ? (p++, 1) : 0;
+  int n = 0;
+  MatchState ms;
+  luaL_Buffer b;
+  luaL_argcheck(L, tr == LUA_TNUMBER || tr == LUA_TSTRING ||
+                   tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3,
+                      "string/function/table expected");
+  luaL_buffinit(L, &b);
+  ms.L = L;
+  ms.src_init = src;
+  ms.src_end = src+srcl;
+  while (n < max_s) {
+    const char *e;
+    ms.level = 0;
+    e = match(&ms, src, p);
+    if (e) {
+      n++;
+      add_value(&ms, &b, src, e);
+    }
+    if (e && e>src) /* non empty match? */
+      src = e;  /* skip it */
+    else if (src < ms.src_end)
+      luaL_addchar(&b, *src++);
+    else break;
+    if (anchor) break;
+  }
+  luaL_addlstring(&b, src, ms.src_end-src);
+  luaL_pushresult(&b);
+  lua_pushinteger(L, n);  /* number of substitutions */
+  return 2;
+}
+
+/* }====================================================== */
+
+
+/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */
+#define MAX_ITEM	512
+/* valid flags in a format specification */
+#define FLAGS	"-+ #0"
+/*
+** maximum size of each format specification (such as '%-099.99d')
+** (+10 accounts for %99.99x plus margin of error)
+*/
+#define MAX_FORMAT	(sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10)
+
+
+static void addquoted (lua_State *L, luaL_Buffer *b, int arg) {
+  size_t l;
+  const char *s = luaL_checklstring(L, arg, &l);
+  luaL_addchar(b, '"');
+  while (l--) {
+    switch (*s) {
+      case '"': case '\\': case '\n': {
+        luaL_addchar(b, '\\');
+        luaL_addchar(b, *s);
+        break;
+      }
+      case '\r': {
+        luaL_addlstring(b, "\\r", 2);
+        break;
+      }
+      case '\0': {
+        luaL_addlstring(b, "\\000", 4);
+        break;
+      }
+      default: {
+        luaL_addchar(b, *s);
+        break;
+      }
+    }
+    s++;
+  }
+  luaL_addchar(b, '"');
+}
+
+static const char *scanformat (lua_State *L, const char *strfrmt, char *form) {
+  const char *p = strfrmt;
+  while (*p != '\0' && strchr(FLAGS, *p) != NULL) p++;  /* skip flags */
+  if ((size_t)(p - strfrmt) >= sizeof(FLAGS))
+    luaL_error(L, "invalid format (repeated flags)");
+  if (isdigit(uchar(*p))) p++;  /* skip width */
+  if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */
+  if (*p == '.') {
+    p++;
+    if (isdigit(uchar(*p))) p++;  /* skip precision */
+    if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */
+  }
+  if (isdigit(uchar(*p)))
+    luaL_error(L, "invalid format (width or precision too long)");
+  *(form++) = '%';
+  strncpy(form, strfrmt, p - strfrmt + 1);
+  form += p - strfrmt + 1;
+  *form = '\0';
+  return p;
+}
+
+
+static void addintlen (char *form) {
+  size_t l = strlen(form);
+  char spec = form[l - 1];
+  strcpy(form + l - 1, LUA_INTFRMLEN);
+  form[l + sizeof(LUA_INTFRMLEN) - 2] = spec;
+  form[l + sizeof(LUA_INTFRMLEN) - 1] = '\0';
+}
+
+
+static int str_format (lua_State *L) {
+  int top = lua_gettop(L);
+  int arg = 1;
+  size_t sfl;
+  const char *strfrmt = luaL_checklstring(L, arg, &sfl);
+  const char *strfrmt_end = strfrmt+sfl;
+  luaL_Buffer b;
+  luaL_buffinit(L, &b);
+  while (strfrmt < strfrmt_end) {
+    if (*strfrmt != L_ESC)
+      luaL_addchar(&b, *strfrmt++);
+    else if (*++strfrmt == L_ESC)
+      luaL_addchar(&b, *strfrmt++);  /* %% */
+    else { /* format item */
+      char form[MAX_FORMAT];  /* to store the format (`%...') */
+      char buff[MAX_ITEM];  /* to store the formatted item */
+      if (++arg > top)
+        luaL_argerror(L, arg, "no value");
+      strfrmt = scanformat(L, strfrmt, form);
+      switch (*strfrmt++) {
+        case 'c': {
+          sprintf(buff, form, (int)luaL_checknumber(L, arg));
+          break;
+        }
+        case 'd':  case 'i': {
+          addintlen(form);
+          sprintf(buff, form, (LUA_INTFRM_T)luaL_checknumber(L, arg));
+          break;
+        }
+        case 'o':  case 'u':  case 'x':  case 'X': {
+          addintlen(form);
+          sprintf(buff, form, (unsigned LUA_INTFRM_T)luaL_checknumber(L, arg));
+          break;
+        }
+        case 'e':  case 'E': case 'f':
+        case 'g': case 'G': {
+          sprintf(buff, form, (double)luaL_checknumber(L, arg));
+          break;
+        }
+        case 'q': {
+          addquoted(L, &b, arg);
+          continue;  /* skip the 'addsize' at the end */
+        }
+        case 's': {
+          size_t l;
+          const char *s = luaL_checklstring(L, arg, &l);
+          if (!strchr(form, '.') && l >= 100) {
+            /* no precision and string is too long to be formatted;
+               keep original string */
+            lua_pushvalue(L, arg);
+            luaL_addvalue(&b);
+            continue;  /* skip the `addsize' at the end */
+          }
+          else {
+            sprintf(buff, form, s);
+            break;
+          }
+        }
+        default: {  /* also treat cases `pnLlh' */
+          return luaL_error(L, "invalid option " LUA_QL("%%%c") " to "
+                               LUA_QL("format"), *(strfrmt - 1));
+        }
+      }
+      luaL_addlstring(&b, buff, strlen(buff));
+    }
+  }
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static const luaL_Reg strlib[] = {
+  {"byte", str_byte},
+  {"char", str_char},
+  {"dump", str_dump},
+  {"find", str_find},
+  {"format", str_format},
+  {"gfind", gfind_nodef},
+  {"gmatch", gmatch},
+  {"gsub", str_gsub},
+  {"len", str_len},
+  {"lower", str_lower},
+  {"match", str_match},
+  {"rep", str_rep},
+  {"reverse", str_reverse},
+  {"sub", str_sub},
+  {"upper", str_upper},
+  {NULL, NULL}
+};
+
+
+static void createmetatable (lua_State *L) {
+  lua_createtable(L, 0, 1);  /* create metatable for strings */
+  lua_pushliteral(L, "");  /* dummy string */
+  lua_pushvalue(L, -2);
+  lua_setmetatable(L, -2);  /* set string metatable */
+  lua_pop(L, 1);  /* pop dummy string */
+  lua_pushvalue(L, -2);  /* string library... */
+  lua_setfield(L, -2, "__index");  /* ...is the __index metamethod */
+  lua_pop(L, 1);  /* pop metatable */
+}
+
+
+/*
+** Open string library
+*/
+LUALIB_API int luaopen_string (lua_State *L) {
+  luaL_register(L, LUA_STRLIBNAME, strlib);
+#if defined(LUA_COMPAT_GFIND)
+  lua_getfield(L, -1, "gmatch");
+  lua_setfield(L, -2, "gfind");
+#endif
+  createmetatable(L);
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/ltable.c b/redis-stable/deps/lua/src/ltable.c
new file mode 100644
index 00000000..ec84f4fa
--- /dev/null
+++ b/redis-stable/deps/lua/src/ltable.c
@@ -0,0 +1,588 @@
+/*
+** $Id: ltable.c,v 2.32.1.2 2007/12/28 15:32:23 roberto Exp $
+** Lua tables (hash)
+** See Copyright Notice in lua.h
+*/
+
+
+/*
+** Implementation of tables (aka arrays, objects, or hash tables).
+** Tables keep its elements in two parts: an array part and a hash part.
+** Non-negative integer keys are all candidates to be kept in the array
+** part. The actual size of the array is the largest `n' such that at
+** least half the slots between 0 and n are in use.
+** Hash uses a mix of chained scatter table with Brent's variation.
+** A main invariant of these tables is that, if an element is not
+** in its main position (i.e. the `original' position that its hash gives
+** to it), then the colliding element is in its own main position.
+** Hence even when the load factor reaches 100%, performance remains good.
+*/
+
+#include <math.h>
+#include <string.h>
+
+#define ltable_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lgc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstate.h"
+#include "ltable.h"
+
+
+/*
+** max size of array part is 2^MAXBITS
+*/
+#if LUAI_BITSINT > 26
+#define MAXBITS		26
+#else
+#define MAXBITS		(LUAI_BITSINT-2)
+#endif
+
+#define MAXASIZE	(1 << MAXBITS)
+
+
+#define hashpow2(t,n)      (gnode(t, lmod((n), sizenode(t))))
+  
+#define hashstr(t,str)  hashpow2(t, (str)->tsv.hash)
+#define hashboolean(t,p)        hashpow2(t, p)
+
+
+/*
+** for some types, it is better to avoid modulus by power of 2, as
+** they tend to have many 2 factors.
+*/
+#define hashmod(t,n)	(gnode(t, ((n) % ((sizenode(t)-1)|1))))
+
+
+#define hashpointer(t,p)	hashmod(t, IntPoint(p))
+
+
+/*
+** number of ints inside a lua_Number
+*/
+#define numints		cast_int(sizeof(lua_Number)/sizeof(int))
+
+
+
+#define dummynode		(&dummynode_)
+
+static const Node dummynode_ = {
+  {{NULL}, LUA_TNIL},  /* value */
+  {{{NULL}, LUA_TNIL, NULL}}  /* key */
+};
+
+
+/*
+** hash for lua_Numbers
+*/
+static Node *hashnum (const Table *t, lua_Number n) {
+  unsigned int a[numints];
+  int i;
+  if (luai_numeq(n, 0))  /* avoid problems with -0 */
+    return gnode(t, 0);
+  memcpy(a, &n, sizeof(a));
+  for (i = 1; i < numints; i++) a[0] += a[i];
+  return hashmod(t, a[0]);
+}
+
+
+
+/*
+** returns the `main' position of an element in a table (that is, the index
+** of its hash value)
+*/
+static Node *mainposition (const Table *t, const TValue *key) {
+  switch (ttype(key)) {
+    case LUA_TNUMBER:
+      return hashnum(t, nvalue(key));
+    case LUA_TSTRING:
+      return hashstr(t, rawtsvalue(key));
+    case LUA_TBOOLEAN:
+      return hashboolean(t, bvalue(key));
+    case LUA_TLIGHTUSERDATA:
+      return hashpointer(t, pvalue(key));
+    default:
+      return hashpointer(t, gcvalue(key));
+  }
+}
+
+
+/*
+** returns the index for `key' if `key' is an appropriate key to live in
+** the array part of the table, -1 otherwise.
+*/
+static int arrayindex (const TValue *key) {
+  if (ttisnumber(key)) {
+    lua_Number n = nvalue(key);
+    int k;
+    lua_number2int(k, n);
+    if (luai_numeq(cast_num(k), n))
+      return k;
+  }
+  return -1;  /* `key' did not match some condition */
+}
+
+
+/*
+** returns the index of a `key' for table traversals. First goes all
+** elements in the array part, then elements in the hash part. The
+** beginning of a traversal is signalled by -1.
+*/
+static int findindex (lua_State *L, Table *t, StkId key) {
+  int i;
+  if (ttisnil(key)) return -1;  /* first iteration */
+  i = arrayindex(key);
+  if (0 < i && i <= t->sizearray)  /* is `key' inside array part? */
+    return i-1;  /* yes; that's the index (corrected to C) */
+  else {
+    Node *n = mainposition(t, key);
+    do {  /* check whether `key' is somewhere in the chain */
+      /* key may be dead already, but it is ok to use it in `next' */
+      if (luaO_rawequalObj(key2tval(n), key) ||
+            (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) &&
+             gcvalue(gkey(n)) == gcvalue(key))) {
+        i = cast_int(n - gnode(t, 0));  /* key index in hash table */
+        /* hash elements are numbered after array ones */
+        return i + t->sizearray;
+      }
+      else n = gnext(n);
+    } while (n);
+    luaG_runerror(L, "invalid key to " LUA_QL("next"));  /* key not found */
+    return 0;  /* to avoid warnings */
+  }
+}
+
+
+int luaH_next (lua_State *L, Table *t, StkId key) {
+  int i = findindex(L, t, key);  /* find original element */
+  for (i++; i < t->sizearray; i++) {  /* try first array part */
+    if (!ttisnil(&t->array[i])) {  /* a non-nil value? */
+      setnvalue(key, cast_num(i+1));
+      setobj2s(L, key+1, &t->array[i]);
+      return 1;
+    }
+  }
+  for (i -= t->sizearray; i < sizenode(t); i++) {  /* then hash part */
+    if (!ttisnil(gval(gnode(t, i)))) {  /* a non-nil value? */
+      setobj2s(L, key, key2tval(gnode(t, i)));
+      setobj2s(L, key+1, gval(gnode(t, i)));
+      return 1;
+    }
+  }
+  return 0;  /* no more elements */
+}
+
+
+/*
+** {=============================================================
+** Rehash
+** ==============================================================
+*/
+
+
+static int computesizes (int nums[], int *narray) {
+  int i;
+  int twotoi;  /* 2^i */
+  int a = 0;  /* number of elements smaller than 2^i */
+  int na = 0;  /* number of elements to go to array part */
+  int n = 0;  /* optimal size for array part */
+  for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {
+    if (nums[i] > 0) {
+      a += nums[i];
+      if (a > twotoi/2) {  /* more than half elements present? */
+        n = twotoi;  /* optimal size (till now) */
+        na = a;  /* all elements smaller than n will go to array part */
+      }
+    }
+    if (a == *narray) break;  /* all elements already counted */
+  }
+  *narray = n;
+  lua_assert(*narray/2 <= na && na <= *narray);
+  return na;
+}
+
+
+static int countint (const TValue *key, int *nums) {
+  int k = arrayindex(key);
+  if (0 < k && k <= MAXASIZE) {  /* is `key' an appropriate array index? */
+    nums[ceillog2(k)]++;  /* count as such */
+    return 1;
+  }
+  else
+    return 0;
+}
+
+
+static int numusearray (const Table *t, int *nums) {
+  int lg;
+  int ttlg;  /* 2^lg */
+  int ause = 0;  /* summation of `nums' */
+  int i = 1;  /* count to traverse all array keys */
+  for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) {  /* for each slice */
+    int lc = 0;  /* counter */
+    int lim = ttlg;
+    if (lim > t->sizearray) {
+      lim = t->sizearray;  /* adjust upper limit */
+      if (i > lim)
+        break;  /* no more elements to count */
+    }
+    /* count elements in range (2^(lg-1), 2^lg] */
+    for (; i <= lim; i++) {
+      if (!ttisnil(&t->array[i-1]))
+        lc++;
+    }
+    nums[lg] += lc;
+    ause += lc;
+  }
+  return ause;
+}
+
+
+static int numusehash (const Table *t, int *nums, int *pnasize) {
+  int totaluse = 0;  /* total number of elements */
+  int ause = 0;  /* summation of `nums' */
+  int i = sizenode(t);
+  while (i--) {
+    Node *n = &t->node[i];
+    if (!ttisnil(gval(n))) {
+      ause += countint(key2tval(n), nums);
+      totaluse++;
+    }
+  }
+  *pnasize += ause;
+  return totaluse;
+}
+
+
+static void setarrayvector (lua_State *L, Table *t, int size) {
+  int i;
+  luaM_reallocvector(L, t->array, t->sizearray, size, TValue);
+  for (i=t->sizearray; i<size; i++)
+     setnilvalue(&t->array[i]);
+  t->sizearray = size;
+}
+
+
+static void setnodevector (lua_State *L, Table *t, int size) {
+  int lsize;
+  if (size == 0) {  /* no elements to hash part? */
+    t->node = cast(Node *, dummynode);  /* use common `dummynode' */
+    lsize = 0;
+  }
+  else {
+    int i;
+    lsize = ceillog2(size);
+    if (lsize > MAXBITS)
+      luaG_runerror(L, "table overflow");
+    size = twoto(lsize);
+    t->node = luaM_newvector(L, size, Node);
+    for (i=0; i<size; i++) {
+      Node *n = gnode(t, i);
+      gnext(n) = NULL;
+      setnilvalue(gkey(n));
+      setnilvalue(gval(n));
+    }
+  }
+  t->lsizenode = cast_byte(lsize);
+  t->lastfree = gnode(t, size);  /* all positions are free */
+}
+
+
+static void resize (lua_State *L, Table *t, int nasize, int nhsize) {
+  int i;
+  int oldasize = t->sizearray;
+  int oldhsize = t->lsizenode;
+  Node *nold = t->node;  /* save old hash ... */
+  if (nasize > oldasize)  /* array part must grow? */
+    setarrayvector(L, t, nasize);
+  /* create new hash part with appropriate size */
+  setnodevector(L, t, nhsize);  
+  if (nasize < oldasize) {  /* array part must shrink? */
+    t->sizearray = nasize;
+    /* re-insert elements from vanishing slice */
+    for (i=nasize; i<oldasize; i++) {
+      if (!ttisnil(&t->array[i]))
+        setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);
+    }
+    /* shrink array */
+    luaM_reallocvector(L, t->array, oldasize, nasize, TValue);
+  }
+  /* re-insert elements from hash part */
+  for (i = twoto(oldhsize) - 1; i >= 0; i--) {
+    Node *old = nold+i;
+    if (!ttisnil(gval(old)))
+      setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old));
+  }
+  if (nold != dummynode)
+    luaM_freearray(L, nold, twoto(oldhsize), Node);  /* free old array */
+}
+
+
+void luaH_resizearray (lua_State *L, Table *t, int nasize) {
+  int nsize = (t->node == dummynode) ? 0 : sizenode(t);
+  resize(L, t, nasize, nsize);
+}
+
+
+static void rehash (lua_State *L, Table *t, const TValue *ek) {
+  int nasize, na;
+  int nums[MAXBITS+1];  /* nums[i] = number of keys between 2^(i-1) and 2^i */
+  int i;
+  int totaluse;
+  for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */
+  nasize = numusearray(t, nums);  /* count keys in array part */
+  totaluse = nasize;  /* all those keys are integer keys */
+  totaluse += numusehash(t, nums, &nasize);  /* count keys in hash part */
+  /* count extra key */
+  nasize += countint(ek, nums);
+  totaluse++;
+  /* compute new size for array part */
+  na = computesizes(nums, &nasize);
+  /* resize the table to new computed sizes */
+  resize(L, t, nasize, totaluse - na);
+}
+
+
+
+/*
+** }=============================================================
+*/
+
+
+Table *luaH_new (lua_State *L, int narray, int nhash) {
+  Table *t = luaM_new(L, Table);
+  luaC_link(L, obj2gco(t), LUA_TTABLE);
+  t->metatable = NULL;
+  t->flags = cast_byte(~0);
+  /* temporary values (kept only if some malloc fails) */
+  t->array = NULL;
+  t->sizearray = 0;
+  t->lsizenode = 0;
+  t->node = cast(Node *, dummynode);
+  setarrayvector(L, t, narray);
+  setnodevector(L, t, nhash);
+  return t;
+}
+
+
+void luaH_free (lua_State *L, Table *t) {
+  if (t->node != dummynode)
+    luaM_freearray(L, t->node, sizenode(t), Node);
+  luaM_freearray(L, t->array, t->sizearray, TValue);
+  luaM_free(L, t);
+}
+
+
+static Node *getfreepos (Table *t) {
+  while (t->lastfree-- > t->node) {
+    if (ttisnil(gkey(t->lastfree)))
+      return t->lastfree;
+  }
+  return NULL;  /* could not find a free place */
+}
+
+
+
+/*
+** inserts a new key into a hash table; first, check whether key's main 
+** position is free. If not, check whether colliding node is in its main 
+** position or not: if it is not, move colliding node to an empty place and 
+** put new key in its main position; otherwise (colliding node is in its main 
+** position), new key goes to an empty position. 
+*/
+static TValue *newkey (lua_State *L, Table *t, const TValue *key) {
+  Node *mp = mainposition(t, key);
+  if (!ttisnil(gval(mp)) || mp == dummynode) {
+    Node *othern;
+    Node *n = getfreepos(t);  /* get a free place */
+    if (n == NULL) {  /* cannot find a free place? */
+      rehash(L, t, key);  /* grow table */
+      return luaH_set(L, t, key);  /* re-insert key into grown table */
+    }
+    lua_assert(n != dummynode);
+    othern = mainposition(t, key2tval(mp));
+    if (othern != mp) {  /* is colliding node out of its main position? */
+      /* yes; move colliding node into free position */
+      while (gnext(othern) != mp) othern = gnext(othern);  /* find previous */
+      gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */
+      *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */
+      gnext(mp) = NULL;  /* now `mp' is free */
+      setnilvalue(gval(mp));
+    }
+    else {  /* colliding node is in its own main position */
+      /* new node will go into free position */
+      gnext(n) = gnext(mp);  /* chain new position */
+      gnext(mp) = n;
+      mp = n;
+    }
+  }
+  gkey(mp)->value = key->value; gkey(mp)->tt = key->tt;
+  luaC_barriert(L, t, key);
+  lua_assert(ttisnil(gval(mp)));
+  return gval(mp);
+}
+
+
+/*
+** search function for integers
+*/
+const TValue *luaH_getnum (Table *t, int key) {
+  /* (1 <= key && key <= t->sizearray) */
+  if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))
+    return &t->array[key-1];
+  else {
+    lua_Number nk = cast_num(key);
+    Node *n = hashnum(t, nk);
+    do {  /* check whether `key' is somewhere in the chain */
+      if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))
+        return gval(n);  /* that's it */
+      else n = gnext(n);
+    } while (n);
+    return luaO_nilobject;
+  }
+}
+
+
+/*
+** search function for strings
+*/
+const TValue *luaH_getstr (Table *t, TString *key) {
+  Node *n = hashstr(t, key);
+  do {  /* check whether `key' is somewhere in the chain */
+    if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)
+      return gval(n);  /* that's it */
+    else n = gnext(n);
+  } while (n);
+  return luaO_nilobject;
+}
+
+
+/*
+** main search function
+*/
+const TValue *luaH_get (Table *t, const TValue *key) {
+  switch (ttype(key)) {
+    case LUA_TNIL: return luaO_nilobject;
+    case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key));
+    case LUA_TNUMBER: {
+      int k;
+      lua_Number n = nvalue(key);
+      lua_number2int(k, n);
+      if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */
+        return luaH_getnum(t, k);  /* use specialized version */
+      /* else go through */
+    }
+    default: {
+      Node *n = mainposition(t, key);
+      do {  /* check whether `key' is somewhere in the chain */
+        if (luaO_rawequalObj(key2tval(n), key))
+          return gval(n);  /* that's it */
+        else n = gnext(n);
+      } while (n);
+      return luaO_nilobject;
+    }
+  }
+}
+
+
+TValue *luaH_set (lua_State *L, Table *t, const TValue *key) {
+  const TValue *p = luaH_get(t, key);
+  t->flags = 0;
+  if (p != luaO_nilobject)
+    return cast(TValue *, p);
+  else {
+    if (ttisnil(key)) luaG_runerror(L, "table index is nil");
+    else if (ttisnumber(key) && luai_numisnan(nvalue(key)))
+      luaG_runerror(L, "table index is NaN");
+    return newkey(L, t, key);
+  }
+}
+
+
+TValue *luaH_setnum (lua_State *L, Table *t, int key) {
+  const TValue *p = luaH_getnum(t, key);
+  if (p != luaO_nilobject)
+    return cast(TValue *, p);
+  else {
+    TValue k;
+    setnvalue(&k, cast_num(key));
+    return newkey(L, t, &k);
+  }
+}
+
+
+TValue *luaH_setstr (lua_State *L, Table *t, TString *key) {
+  const TValue *p = luaH_getstr(t, key);
+  if (p != luaO_nilobject)
+    return cast(TValue *, p);
+  else {
+    TValue k;
+    setsvalue(L, &k, key);
+    return newkey(L, t, &k);
+  }
+}
+
+
+static int unbound_search (Table *t, unsigned int j) {
+  unsigned int i = j;  /* i is zero or a present index */
+  j++;
+  /* find `i' and `j' such that i is present and j is not */
+  while (!ttisnil(luaH_getnum(t, j))) {
+    i = j;
+    j *= 2;
+    if (j > cast(unsigned int, MAX_INT)) {  /* overflow? */
+      /* table was built with bad purposes: resort to linear search */
+      i = 1;
+      while (!ttisnil(luaH_getnum(t, i))) i++;
+      return i - 1;
+    }
+  }
+  /* now do a binary search between them */
+  while (j - i > 1) {
+    unsigned int m = (i+j)/2;
+    if (ttisnil(luaH_getnum(t, m))) j = m;
+    else i = m;
+  }
+  return i;
+}
+
+
+/*
+** Try to find a boundary in table `t'. A `boundary' is an integer index
+** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).
+*/
+int luaH_getn (Table *t) {
+  unsigned int j = t->sizearray;
+  if (j > 0 && ttisnil(&t->array[j - 1])) {
+    /* there is a boundary in the array part: (binary) search for it */
+    unsigned int i = 0;
+    while (j - i > 1) {
+      unsigned int m = (i+j)/2;
+      if (ttisnil(&t->array[m - 1])) j = m;
+      else i = m;
+    }
+    return i;
+  }
+  /* else must find a boundary in hash part */
+  else if (t->node == dummynode)  /* hash part is empty? */
+    return j;  /* that is easy... */
+  else return unbound_search(t, j);
+}
+
+
+
+#if defined(LUA_DEBUG)
+
+Node *luaH_mainposition (const Table *t, const TValue *key) {
+  return mainposition(t, key);
+}
+
+int luaH_isdummy (Node *n) { return n == dummynode; }
+
+#endif
diff --git a/redis-stable/deps/lua/src/ltable.h b/redis-stable/deps/lua/src/ltable.h
new file mode 100644
index 00000000..f5b9d5ea
--- /dev/null
+++ b/redis-stable/deps/lua/src/ltable.h
@@ -0,0 +1,40 @@
+/*
+** $Id: ltable.h,v 2.10.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lua tables (hash)
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ltable_h
+#define ltable_h
+
+#include "lobject.h"
+
+
+#define gnode(t,i)	(&(t)->node[i])
+#define gkey(n)		(&(n)->i_key.nk)
+#define gval(n)		(&(n)->i_val)
+#define gnext(n)	((n)->i_key.nk.next)
+
+#define key2tval(n)	(&(n)->i_key.tvk)
+
+
+LUAI_FUNC const TValue *luaH_getnum (Table *t, int key);
+LUAI_FUNC TValue *luaH_setnum (lua_State *L, Table *t, int key);
+LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);
+LUAI_FUNC TValue *luaH_setstr (lua_State *L, Table *t, TString *key);
+LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key);
+LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key);
+LUAI_FUNC Table *luaH_new (lua_State *L, int narray, int lnhash);
+LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize);
+LUAI_FUNC void luaH_free (lua_State *L, Table *t);
+LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);
+LUAI_FUNC int luaH_getn (Table *t);
+
+
+#if defined(LUA_DEBUG)
+LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
+LUAI_FUNC int luaH_isdummy (Node *n);
+#endif
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/ltablib.c b/redis-stable/deps/lua/src/ltablib.c
new file mode 100644
index 00000000..0bdac7f6
--- /dev/null
+++ b/redis-stable/deps/lua/src/ltablib.c
@@ -0,0 +1,287 @@
+/*
+** $Id: ltablib.c,v 1.38.1.3 2008/02/14 16:46:58 roberto Exp $
+** Library for Table Manipulation
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stddef.h>
+
+#define ltablib_c
+#define LUA_LIB
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+#define aux_getn(L,n)	(luaL_checktype(L, n, LUA_TTABLE), luaL_getn(L, n))
+
+
+static int foreachi (lua_State *L) {
+  int i;
+  int n = aux_getn(L, 1);
+  luaL_checktype(L, 2, LUA_TFUNCTION);
+  for (i=1; i <= n; i++) {
+    lua_pushvalue(L, 2);  /* function */
+    lua_pushinteger(L, i);  /* 1st argument */
+    lua_rawgeti(L, 1, i);  /* 2nd argument */
+    lua_call(L, 2, 1);
+    if (!lua_isnil(L, -1))
+      return 1;
+    lua_pop(L, 1);  /* remove nil result */
+  }
+  return 0;
+}
+
+
+static int foreach (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+  luaL_checktype(L, 2, LUA_TFUNCTION);
+  lua_pushnil(L);  /* first key */
+  while (lua_next(L, 1)) {
+    lua_pushvalue(L, 2);  /* function */
+    lua_pushvalue(L, -3);  /* key */
+    lua_pushvalue(L, -3);  /* value */
+    lua_call(L, 2, 1);
+    if (!lua_isnil(L, -1))
+      return 1;
+    lua_pop(L, 2);  /* remove value and result */
+  }
+  return 0;
+}
+
+
+static int maxn (lua_State *L) {
+  lua_Number max = 0;
+  luaL_checktype(L, 1, LUA_TTABLE);
+  lua_pushnil(L);  /* first key */
+  while (lua_next(L, 1)) {
+    lua_pop(L, 1);  /* remove value */
+    if (lua_type(L, -1) == LUA_TNUMBER) {
+      lua_Number v = lua_tonumber(L, -1);
+      if (v > max) max = v;
+    }
+  }
+  lua_pushnumber(L, max);
+  return 1;
+}
+
+
+static int getn (lua_State *L) {
+  lua_pushinteger(L, aux_getn(L, 1));
+  return 1;
+}
+
+
+static int setn (lua_State *L) {
+  luaL_checktype(L, 1, LUA_TTABLE);
+#ifndef luaL_setn
+  luaL_setn(L, 1, luaL_checkint(L, 2));
+#else
+  luaL_error(L, LUA_QL("setn") " is obsolete");
+#endif
+  lua_pushvalue(L, 1);
+  return 1;
+}
+
+
+static int tinsert (lua_State *L) {
+  int e = aux_getn(L, 1) + 1;  /* first empty element */
+  int pos;  /* where to insert new element */
+  switch (lua_gettop(L)) {
+    case 2: {  /* called with only 2 arguments */
+      pos = e;  /* insert new element at the end */
+      break;
+    }
+    case 3: {
+      int i;
+      pos = luaL_checkint(L, 2);  /* 2nd argument is the position */
+      if (pos > e) e = pos;  /* `grow' array if necessary */
+      for (i = e; i > pos; i--) {  /* move up elements */
+        lua_rawgeti(L, 1, i-1);
+        lua_rawseti(L, 1, i);  /* t[i] = t[i-1] */
+      }
+      break;
+    }
+    default: {
+      return luaL_error(L, "wrong number of arguments to " LUA_QL("insert"));
+    }
+  }
+  luaL_setn(L, 1, e);  /* new size */
+  lua_rawseti(L, 1, pos);  /* t[pos] = v */
+  return 0;
+}
+
+
+static int tremove (lua_State *L) {
+  int e = aux_getn(L, 1);
+  int pos = luaL_optint(L, 2, e);
+  if (!(1 <= pos && pos <= e))  /* position is outside bounds? */
+   return 0;  /* nothing to remove */
+  luaL_setn(L, 1, e - 1);  /* t.n = n-1 */
+  lua_rawgeti(L, 1, pos);  /* result = t[pos] */
+  for ( ;pos<e; pos++) {
+    lua_rawgeti(L, 1, pos+1);
+    lua_rawseti(L, 1, pos);  /* t[pos] = t[pos+1] */
+  }
+  lua_pushnil(L);
+  lua_rawseti(L, 1, e);  /* t[e] = nil */
+  return 1;
+}
+
+
+static void addfield (lua_State *L, luaL_Buffer *b, int i) {
+  lua_rawgeti(L, 1, i);
+  if (!lua_isstring(L, -1))
+    luaL_error(L, "invalid value (%s) at index %d in table for "
+                  LUA_QL("concat"), luaL_typename(L, -1), i);
+  luaL_addvalue(b);
+}
+
+
+static int tconcat (lua_State *L) {
+  luaL_Buffer b;
+  size_t lsep;
+  int i, last;
+  const char *sep = luaL_optlstring(L, 2, "", &lsep);
+  luaL_checktype(L, 1, LUA_TTABLE);
+  i = luaL_optint(L, 3, 1);
+  last = luaL_opt(L, luaL_checkint, 4, luaL_getn(L, 1));
+  luaL_buffinit(L, &b);
+  for (; i < last; i++) {
+    addfield(L, &b, i);
+    luaL_addlstring(&b, sep, lsep);
+  }
+  if (i == last)  /* add last value (if interval was not empty) */
+    addfield(L, &b, i);
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+
+/*
+** {======================================================
+** Quicksort
+** (based on `Algorithms in MODULA-3', Robert Sedgewick;
+**  Addison-Wesley, 1993.)
+*/
+
+
+static void set2 (lua_State *L, int i, int j) {
+  lua_rawseti(L, 1, i);
+  lua_rawseti(L, 1, j);
+}
+
+static int sort_comp (lua_State *L, int a, int b) {
+  if (!lua_isnil(L, 2)) {  /* function? */
+    int res;
+    lua_pushvalue(L, 2);
+    lua_pushvalue(L, a-1);  /* -1 to compensate function */
+    lua_pushvalue(L, b-2);  /* -2 to compensate function and `a' */
+    lua_call(L, 2, 1);
+    res = lua_toboolean(L, -1);
+    lua_pop(L, 1);
+    return res;
+  }
+  else  /* a < b? */
+    return lua_lessthan(L, a, b);
+}
+
+static void auxsort (lua_State *L, int l, int u) {
+  while (l < u) {  /* for tail recursion */
+    int i, j;
+    /* sort elements a[l], a[(l+u)/2] and a[u] */
+    lua_rawgeti(L, 1, l);
+    lua_rawgeti(L, 1, u);
+    if (sort_comp(L, -1, -2))  /* a[u] < a[l]? */
+      set2(L, l, u);  /* swap a[l] - a[u] */
+    else
+      lua_pop(L, 2);
+    if (u-l == 1) break;  /* only 2 elements */
+    i = (l+u)/2;
+    lua_rawgeti(L, 1, i);
+    lua_rawgeti(L, 1, l);
+    if (sort_comp(L, -2, -1))  /* a[i]<a[l]? */
+      set2(L, i, l);
+    else {
+      lua_pop(L, 1);  /* remove a[l] */
+      lua_rawgeti(L, 1, u);
+      if (sort_comp(L, -1, -2))  /* a[u]<a[i]? */
+        set2(L, i, u);
+      else
+        lua_pop(L, 2);
+    }
+    if (u-l == 2) break;  /* only 3 elements */
+    lua_rawgeti(L, 1, i);  /* Pivot */
+    lua_pushvalue(L, -1);
+    lua_rawgeti(L, 1, u-1);
+    set2(L, i, u-1);
+    /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */
+    i = l; j = u-1;
+    for (;;) {  /* invariant: a[l..i] <= P <= a[j..u] */
+      /* repeat ++i until a[i] >= P */
+      while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {
+        if (i>u) luaL_error(L, "invalid order function for sorting");
+        lua_pop(L, 1);  /* remove a[i] */
+      }
+      /* repeat --j until a[j] <= P */
+      while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {
+        if (j<l) luaL_error(L, "invalid order function for sorting");
+        lua_pop(L, 1);  /* remove a[j] */
+      }
+      if (j<i) {
+        lua_pop(L, 3);  /* pop pivot, a[i], a[j] */
+        break;
+      }
+      set2(L, i, j);
+    }
+    lua_rawgeti(L, 1, u-1);
+    lua_rawgeti(L, 1, i);
+    set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */
+    /* a[l..i-1] <= a[i] == P <= a[i+1..u] */
+    /* adjust so that smaller half is in [j..i] and larger one in [l..u] */
+    if (i-l < u-i) {
+      j=l; i=i-1; l=i+2;
+    }
+    else {
+      j=i+1; i=u; u=j-2;
+    }
+    auxsort(L, j, i);  /* call recursively the smaller one */
+  }  /* repeat the routine for the larger one */
+}
+
+static int sort (lua_State *L) {
+  int n = aux_getn(L, 1);
+  luaL_checkstack(L, 40, "");  /* assume array is smaller than 2^40 */
+  if (!lua_isnoneornil(L, 2))  /* is there a 2nd argument? */
+    luaL_checktype(L, 2, LUA_TFUNCTION);
+  lua_settop(L, 2);  /* make sure there is two arguments */
+  auxsort(L, 1, n);
+  return 0;
+}
+
+/* }====================================================== */
+
+
+static const luaL_Reg tab_funcs[] = {
+  {"concat", tconcat},
+  {"foreach", foreach},
+  {"foreachi", foreachi},
+  {"getn", getn},
+  {"maxn", maxn},
+  {"insert", tinsert},
+  {"remove", tremove},
+  {"setn", setn},
+  {"sort", sort},
+  {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_table (lua_State *L) {
+  luaL_register(L, LUA_TABLIBNAME, tab_funcs);
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/ltm.c b/redis-stable/deps/lua/src/ltm.c
new file mode 100644
index 00000000..c27f0f6f
--- /dev/null
+++ b/redis-stable/deps/lua/src/ltm.c
@@ -0,0 +1,75 @@
+/*
+** $Id: ltm.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
+** Tag methods
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define ltm_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "lobject.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+
+
+
+const char *const luaT_typenames[] = {
+  "nil", "boolean", "userdata", "number",
+  "string", "table", "function", "userdata", "thread",
+  "proto", "upval"
+};
+
+
+void luaT_init (lua_State *L) {
+  static const char *const luaT_eventname[] = {  /* ORDER TM */
+    "__index", "__newindex",
+    "__gc", "__mode", "__eq",
+    "__add", "__sub", "__mul", "__div", "__mod",
+    "__pow", "__unm", "__len", "__lt", "__le",
+    "__concat", "__call"
+  };
+  int i;
+  for (i=0; i<TM_N; i++) {
+    G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);
+    luaS_fix(G(L)->tmname[i]);  /* never collect these names */
+  }
+}
+
+
+/*
+** function to be used with macro "fasttm": optimized for absence of
+** tag methods
+*/
+const TValue *luaT_gettm (Table *events, TMS event, TString *ename) {
+  const TValue *tm = luaH_getstr(events, ename);
+  lua_assert(event <= TM_EQ);
+  if (ttisnil(tm)) {  /* no tag method? */
+    events->flags |= cast_byte(1u<<event);  /* cache this fact */
+    return NULL;
+  }
+  else return tm;
+}
+
+
+const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {
+  Table *mt;
+  switch (ttype(o)) {
+    case LUA_TTABLE:
+      mt = hvalue(o)->metatable;
+      break;
+    case LUA_TUSERDATA:
+      mt = uvalue(o)->metatable;
+      break;
+    default:
+      mt = G(L)->mt[ttype(o)];
+  }
+  return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject);
+}
+
diff --git a/redis-stable/deps/lua/src/ltm.h b/redis-stable/deps/lua/src/ltm.h
new file mode 100644
index 00000000..64343b78
--- /dev/null
+++ b/redis-stable/deps/lua/src/ltm.h
@@ -0,0 +1,54 @@
+/*
+** $Id: ltm.h,v 2.6.1.1 2007/12/27 13:02:25 roberto Exp $
+** Tag methods
+** See Copyright Notice in lua.h
+*/
+
+#ifndef ltm_h
+#define ltm_h
+
+
+#include "lobject.h"
+
+
+/*
+* WARNING: if you change the order of this enumeration,
+* grep "ORDER TM"
+*/
+typedef enum {
+  TM_INDEX,
+  TM_NEWINDEX,
+  TM_GC,
+  TM_MODE,
+  TM_EQ,  /* last tag method with `fast' access */
+  TM_ADD,
+  TM_SUB,
+  TM_MUL,
+  TM_DIV,
+  TM_MOD,
+  TM_POW,
+  TM_UNM,
+  TM_LEN,
+  TM_LT,
+  TM_LE,
+  TM_CONCAT,
+  TM_CALL,
+  TM_N		/* number of elements in the enum */
+} TMS;
+
+
+
+#define gfasttm(g,et,e) ((et) == NULL ? NULL : \
+  ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e]))
+
+#define fasttm(l,et,e)	gfasttm(G(l), et, e)
+
+LUAI_DATA const char *const luaT_typenames[];
+
+
+LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename);
+LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o,
+                                                       TMS event);
+LUAI_FUNC void luaT_init (lua_State *L);
+
+#endif
diff --git a/redis-stable/deps/lua/src/lua.c b/redis-stable/deps/lua/src/lua.c
new file mode 100644
index 00000000..3a466093
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua.c
@@ -0,0 +1,392 @@
+/*
+** $Id: lua.c,v 1.160.1.2 2007/12/28 15:32:23 roberto Exp $
+** Lua stand-alone interpreter
+** See Copyright Notice in lua.h
+*/
+
+
+#include <signal.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lua_c
+
+#include "lua.h"
+
+#include "lauxlib.h"
+#include "lualib.h"
+
+
+
+static lua_State *globalL = NULL;
+
+static const char *progname = LUA_PROGNAME;
+
+
+
+static void lstop (lua_State *L, lua_Debug *ar) {
+  (void)ar;  /* unused arg. */
+  lua_sethook(L, NULL, 0, 0);
+  luaL_error(L, "interrupted!");
+}
+
+
+static void laction (int i) {
+  signal(i, SIG_DFL); /* if another SIGINT happens before lstop,
+                              terminate process (default action) */
+  lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);
+}
+
+
+static void print_usage (void) {
+  fprintf(stderr,
+  "usage: %s [options] [script [args]].\n"
+  "Available options are:\n"
+  "  -e stat  execute string " LUA_QL("stat") "\n"
+  "  -l name  require library " LUA_QL("name") "\n"
+  "  -i       enter interactive mode after executing " LUA_QL("script") "\n"
+  "  -v       show version information\n"
+  "  --       stop handling options\n"
+  "  -        execute stdin and stop handling options\n"
+  ,
+  progname);
+  fflush(stderr);
+}
+
+
+static void l_message (const char *pname, const char *msg) {
+  if (pname) fprintf(stderr, "%s: ", pname);
+  fprintf(stderr, "%s\n", msg);
+  fflush(stderr);
+}
+
+
+static int report (lua_State *L, int status) {
+  if (status && !lua_isnil(L, -1)) {
+    const char *msg = lua_tostring(L, -1);
+    if (msg == NULL) msg = "(error object is not a string)";
+    l_message(progname, msg);
+    lua_pop(L, 1);
+  }
+  return status;
+}
+
+
+static int traceback (lua_State *L) {
+  if (!lua_isstring(L, 1))  /* 'message' not a string? */
+    return 1;  /* keep it intact */
+  lua_getfield(L, LUA_GLOBALSINDEX, "debug");
+  if (!lua_istable(L, -1)) {
+    lua_pop(L, 1);
+    return 1;
+  }
+  lua_getfield(L, -1, "traceback");
+  if (!lua_isfunction(L, -1)) {
+    lua_pop(L, 2);
+    return 1;
+  }
+  lua_pushvalue(L, 1);  /* pass error message */
+  lua_pushinteger(L, 2);  /* skip this function and traceback */
+  lua_call(L, 2, 1);  /* call debug.traceback */
+  return 1;
+}
+
+
+static int docall (lua_State *L, int narg, int clear) {
+  int status;
+  int base = lua_gettop(L) - narg;  /* function index */
+  lua_pushcfunction(L, traceback);  /* push traceback function */
+  lua_insert(L, base);  /* put it under chunk and args */
+  signal(SIGINT, laction);
+  status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);
+  signal(SIGINT, SIG_DFL);
+  lua_remove(L, base);  /* remove traceback function */
+  /* force a complete garbage collection in case of errors */
+  if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0);
+  return status;
+}
+
+
+static void print_version (void) {
+  l_message(NULL, LUA_RELEASE "  " LUA_COPYRIGHT);
+}
+
+
+static int getargs (lua_State *L, char **argv, int n) {
+  int narg;
+  int i;
+  int argc = 0;
+  while (argv[argc]) argc++;  /* count total number of arguments */
+  narg = argc - (n + 1);  /* number of arguments to the script */
+  luaL_checkstack(L, narg + 3, "too many arguments to script");
+  for (i=n+1; i < argc; i++)
+    lua_pushstring(L, argv[i]);
+  lua_createtable(L, narg, n + 1);
+  for (i=0; i < argc; i++) {
+    lua_pushstring(L, argv[i]);
+    lua_rawseti(L, -2, i - n);
+  }
+  return narg;
+}
+
+
+static int dofile (lua_State *L, const char *name) {
+  int status = luaL_loadfile(L, name) || docall(L, 0, 1);
+  return report(L, status);
+}
+
+
+static int dostring (lua_State *L, const char *s, const char *name) {
+  int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1);
+  return report(L, status);
+}
+
+
+static int dolibrary (lua_State *L, const char *name) {
+  lua_getglobal(L, "require");
+  lua_pushstring(L, name);
+  return report(L, docall(L, 1, 1));
+}
+
+
+static const char *get_prompt (lua_State *L, int firstline) {
+  const char *p;
+  lua_getfield(L, LUA_GLOBALSINDEX, firstline ? "_PROMPT" : "_PROMPT2");
+  p = lua_tostring(L, -1);
+  if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2);
+  lua_pop(L, 1);  /* remove global */
+  return p;
+}
+
+
+static int incomplete (lua_State *L, int status) {
+  if (status == LUA_ERRSYNTAX) {
+    size_t lmsg;
+    const char *msg = lua_tolstring(L, -1, &lmsg);
+    const char *tp = msg + lmsg - (sizeof(LUA_QL("<eof>")) - 1);
+    if (strstr(msg, LUA_QL("<eof>")) == tp) {
+      lua_pop(L, 1);
+      return 1;
+    }
+  }
+  return 0;  /* else... */
+}
+
+
+static int pushline (lua_State *L, int firstline) {
+  char buffer[LUA_MAXINPUT];
+  char *b = buffer;
+  size_t l;
+  const char *prmt = get_prompt(L, firstline);
+  if (lua_readline(L, b, prmt) == 0)
+    return 0;  /* no input */
+  l = strlen(b);
+  if (l > 0 && b[l-1] == '\n')  /* line ends with newline? */
+    b[l-1] = '\0';  /* remove it */
+  if (firstline && b[0] == '=')  /* first line starts with `=' ? */
+    lua_pushfstring(L, "return %s", b+1);  /* change it to `return' */
+  else
+    lua_pushstring(L, b);
+  lua_freeline(L, b);
+  return 1;
+}
+
+
+static int loadline (lua_State *L) {
+  int status;
+  lua_settop(L, 0);
+  if (!pushline(L, 1))
+    return -1;  /* no input */
+  for (;;) {  /* repeat until gets a complete line */
+    status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), "=stdin");
+    if (!incomplete(L, status)) break;  /* cannot try to add lines? */
+    if (!pushline(L, 0))  /* no more input? */
+      return -1;
+    lua_pushliteral(L, "\n");  /* add a new line... */
+    lua_insert(L, -2);  /* ...between the two lines */
+    lua_concat(L, 3);  /* join them */
+  }
+  lua_saveline(L, 1);
+  lua_remove(L, 1);  /* remove line */
+  return status;
+}
+
+
+static void dotty (lua_State *L) {
+  int status;
+  const char *oldprogname = progname;
+  progname = NULL;
+  while ((status = loadline(L)) != -1) {
+    if (status == 0) status = docall(L, 0, 0);
+    report(L, status);
+    if (status == 0 && lua_gettop(L) > 0) {  /* any result to print? */
+      lua_getglobal(L, "print");
+      lua_insert(L, 1);
+      if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)
+        l_message(progname, lua_pushfstring(L,
+                               "error calling " LUA_QL("print") " (%s)",
+                               lua_tostring(L, -1)));
+    }
+  }
+  lua_settop(L, 0);  /* clear stack */
+  fputs("\n", stdout);
+  fflush(stdout);
+  progname = oldprogname;
+}
+
+
+static int handle_script (lua_State *L, char **argv, int n) {
+  int status;
+  const char *fname;
+  int narg = getargs(L, argv, n);  /* collect arguments */
+  lua_setglobal(L, "arg");
+  fname = argv[n];
+  if (strcmp(fname, "-") == 0 && strcmp(argv[n-1], "--") != 0) 
+    fname = NULL;  /* stdin */
+  status = luaL_loadfile(L, fname);
+  lua_insert(L, -(narg+1));
+  if (status == 0)
+    status = docall(L, narg, 0);
+  else
+    lua_pop(L, narg);      
+  return report(L, status);
+}
+
+
+/* check that argument has no extra characters at the end */
+#define notail(x)	{if ((x)[2] != '\0') return -1;}
+
+
+static int collectargs (char **argv, int *pi, int *pv, int *pe) {
+  int i;
+  for (i = 1; argv[i] != NULL; i++) {
+    if (argv[i][0] != '-')  /* not an option? */
+        return i;
+    switch (argv[i][1]) {  /* option */
+      case '-':
+        notail(argv[i]);
+        return (argv[i+1] != NULL ? i+1 : 0);
+      case '\0':
+        return i;
+      case 'i':
+        notail(argv[i]);
+        *pi = 1;  /* go through */
+      case 'v':
+        notail(argv[i]);
+        *pv = 1;
+        break;
+      case 'e':
+        *pe = 1;  /* go through */
+      case 'l':
+        if (argv[i][2] == '\0') {
+          i++;
+          if (argv[i] == NULL) return -1;
+        }
+        break;
+      default: return -1;  /* invalid option */
+    }
+  }
+  return 0;
+}
+
+
+static int runargs (lua_State *L, char **argv, int n) {
+  int i;
+  for (i = 1; i < n; i++) {
+    if (argv[i] == NULL) continue;
+    lua_assert(argv[i][0] == '-');
+    switch (argv[i][1]) {  /* option */
+      case 'e': {
+        const char *chunk = argv[i] + 2;
+        if (*chunk == '\0') chunk = argv[++i];
+        lua_assert(chunk != NULL);
+        if (dostring(L, chunk, "=(command line)") != 0)
+          return 1;
+        break;
+      }
+      case 'l': {
+        const char *filename = argv[i] + 2;
+        if (*filename == '\0') filename = argv[++i];
+        lua_assert(filename != NULL);
+        if (dolibrary(L, filename))
+          return 1;  /* stop if file fails */
+        break;
+      }
+      default: break;
+    }
+  }
+  return 0;
+}
+
+
+static int handle_luainit (lua_State *L) {
+  const char *init = getenv(LUA_INIT);
+  if (init == NULL) return 0;  /* status OK */
+  else if (init[0] == '@')
+    return dofile(L, init+1);
+  else
+    return dostring(L, init, "=" LUA_INIT);
+}
+
+
+struct Smain {
+  int argc;
+  char **argv;
+  int status;
+};
+
+
+static int pmain (lua_State *L) {
+  struct Smain *s = (struct Smain *)lua_touserdata(L, 1);
+  char **argv = s->argv;
+  int script;
+  int has_i = 0, has_v = 0, has_e = 0;
+  globalL = L;
+  if (argv[0] && argv[0][0]) progname = argv[0];
+  lua_gc(L, LUA_GCSTOP, 0);  /* stop collector during initialization */
+  luaL_openlibs(L);  /* open libraries */
+  lua_gc(L, LUA_GCRESTART, 0);
+  s->status = handle_luainit(L);
+  if (s->status != 0) return 0;
+  script = collectargs(argv, &has_i, &has_v, &has_e);
+  if (script < 0) {  /* invalid args? */
+    print_usage();
+    s->status = 1;
+    return 0;
+  }
+  if (has_v) print_version();
+  s->status = runargs(L, argv, (script > 0) ? script : s->argc);
+  if (s->status != 0) return 0;
+  if (script)
+    s->status = handle_script(L, argv, script);
+  if (s->status != 0) return 0;
+  if (has_i)
+    dotty(L);
+  else if (script == 0 && !has_e && !has_v) {
+    if (lua_stdin_is_tty()) {
+      print_version();
+      dotty(L);
+    }
+    else dofile(L, NULL);  /* executes stdin as a file */
+  }
+  return 0;
+}
+
+
+int main (int argc, char **argv) {
+  int status;
+  struct Smain s;
+  lua_State *L = lua_open();  /* create state */
+  if (L == NULL) {
+    l_message(argv[0], "cannot create state: not enough memory");
+    return EXIT_FAILURE;
+  }
+  s.argc = argc;
+  s.argv = argv;
+  status = lua_cpcall(L, &pmain, &s);
+  report(L, status);
+  lua_close(L);
+  return (status || s.status) ? EXIT_FAILURE : EXIT_SUCCESS;
+}
+
diff --git a/redis-stable/deps/lua/src/lua.h b/redis-stable/deps/lua/src/lua.h
new file mode 100644
index 00000000..a4b73e74
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua.h
@@ -0,0 +1,388 @@
+/*
+** $Id: lua.h,v 1.218.1.7 2012/01/13 20:36:20 roberto Exp $
+** Lua - An Extensible Extension Language
+** Lua.org, PUC-Rio, Brazil (http://www.lua.org)
+** See Copyright Notice at the end of this file
+*/
+
+
+#ifndef lua_h
+#define lua_h
+
+#include <stdarg.h>
+#include <stddef.h>
+
+
+#include "luaconf.h"
+
+
+#define LUA_VERSION	"Lua 5.1"
+#define LUA_RELEASE	"Lua 5.1.5"
+#define LUA_VERSION_NUM	501
+#define LUA_COPYRIGHT	"Copyright (C) 1994-2012 Lua.org, PUC-Rio"
+#define LUA_AUTHORS 	"R. Ierusalimschy, L. H. de Figueiredo & W. Celes"
+
+
+/* mark for precompiled code (`<esc>Lua') */
+#define	LUA_SIGNATURE	"\033Lua"
+
+/* option for multiple returns in `lua_pcall' and `lua_call' */
+#define LUA_MULTRET	(-1)
+
+
+/*
+** pseudo-indices
+*/
+#define LUA_REGISTRYINDEX	(-10000)
+#define LUA_ENVIRONINDEX	(-10001)
+#define LUA_GLOBALSINDEX	(-10002)
+#define lua_upvalueindex(i)	(LUA_GLOBALSINDEX-(i))
+
+
+/* thread status; 0 is OK */
+#define LUA_YIELD	1
+#define LUA_ERRRUN	2
+#define LUA_ERRSYNTAX	3
+#define LUA_ERRMEM	4
+#define LUA_ERRERR	5
+
+
+typedef struct lua_State lua_State;
+
+typedef int (*lua_CFunction) (lua_State *L);
+
+
+/*
+** functions that read/write blocks when loading/dumping Lua chunks
+*/
+typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);
+
+typedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);
+
+
+/*
+** prototype for memory-allocation functions
+*/
+typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);
+
+
+/*
+** basic types
+*/
+#define LUA_TNONE		(-1)
+
+#define LUA_TNIL		0
+#define LUA_TBOOLEAN		1
+#define LUA_TLIGHTUSERDATA	2
+#define LUA_TNUMBER		3
+#define LUA_TSTRING		4
+#define LUA_TTABLE		5
+#define LUA_TFUNCTION		6
+#define LUA_TUSERDATA		7
+#define LUA_TTHREAD		8
+
+
+
+/* minimum Lua stack available to a C function */
+#define LUA_MINSTACK	20
+
+
+/*
+** generic extra include file
+*/
+#if defined(LUA_USER_H)
+#include LUA_USER_H
+#endif
+
+
+/* type of numbers in Lua */
+typedef LUA_NUMBER lua_Number;
+
+
+/* type for integer functions */
+typedef LUA_INTEGER lua_Integer;
+
+
+
+/*
+** state manipulation
+*/
+LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);
+LUA_API void       (lua_close) (lua_State *L);
+LUA_API lua_State *(lua_newthread) (lua_State *L);
+
+LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);
+
+
+/*
+** basic stack manipulation
+*/
+LUA_API int   (lua_gettop) (lua_State *L);
+LUA_API void  (lua_settop) (lua_State *L, int idx);
+LUA_API void  (lua_pushvalue) (lua_State *L, int idx);
+LUA_API void  (lua_remove) (lua_State *L, int idx);
+LUA_API void  (lua_insert) (lua_State *L, int idx);
+LUA_API void  (lua_replace) (lua_State *L, int idx);
+LUA_API int   (lua_checkstack) (lua_State *L, int sz);
+
+LUA_API void  (lua_xmove) (lua_State *from, lua_State *to, int n);
+
+
+/*
+** access functions (stack -> C)
+*/
+
+LUA_API int             (lua_isnumber) (lua_State *L, int idx);
+LUA_API int             (lua_isstring) (lua_State *L, int idx);
+LUA_API int             (lua_iscfunction) (lua_State *L, int idx);
+LUA_API int             (lua_isuserdata) (lua_State *L, int idx);
+LUA_API int             (lua_type) (lua_State *L, int idx);
+LUA_API const char     *(lua_typename) (lua_State *L, int tp);
+
+LUA_API int            (lua_equal) (lua_State *L, int idx1, int idx2);
+LUA_API int            (lua_rawequal) (lua_State *L, int idx1, int idx2);
+LUA_API int            (lua_lessthan) (lua_State *L, int idx1, int idx2);
+
+LUA_API lua_Number      (lua_tonumber) (lua_State *L, int idx);
+LUA_API lua_Integer     (lua_tointeger) (lua_State *L, int idx);
+LUA_API int             (lua_toboolean) (lua_State *L, int idx);
+LUA_API const char     *(lua_tolstring) (lua_State *L, int idx, size_t *len);
+LUA_API size_t          (lua_objlen) (lua_State *L, int idx);
+LUA_API lua_CFunction   (lua_tocfunction) (lua_State *L, int idx);
+LUA_API void	       *(lua_touserdata) (lua_State *L, int idx);
+LUA_API lua_State      *(lua_tothread) (lua_State *L, int idx);
+LUA_API const void     *(lua_topointer) (lua_State *L, int idx);
+
+
+/*
+** push functions (C -> stack)
+*/
+LUA_API void  (lua_pushnil) (lua_State *L);
+LUA_API void  (lua_pushnumber) (lua_State *L, lua_Number n);
+LUA_API void  (lua_pushinteger) (lua_State *L, lua_Integer n);
+LUA_API void  (lua_pushlstring) (lua_State *L, const char *s, size_t l);
+LUA_API void  (lua_pushstring) (lua_State *L, const char *s);
+LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt,
+                                                      va_list argp);
+LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...);
+LUA_API void  (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);
+LUA_API void  (lua_pushboolean) (lua_State *L, int b);
+LUA_API void  (lua_pushlightuserdata) (lua_State *L, void *p);
+LUA_API int   (lua_pushthread) (lua_State *L);
+
+
+/*
+** get functions (Lua -> stack)
+*/
+LUA_API void  (lua_gettable) (lua_State *L, int idx);
+LUA_API void  (lua_getfield) (lua_State *L, int idx, const char *k);
+LUA_API void  (lua_rawget) (lua_State *L, int idx);
+LUA_API void  (lua_rawgeti) (lua_State *L, int idx, int n);
+LUA_API void  (lua_createtable) (lua_State *L, int narr, int nrec);
+LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);
+LUA_API int   (lua_getmetatable) (lua_State *L, int objindex);
+LUA_API void  (lua_getfenv) (lua_State *L, int idx);
+
+
+/*
+** set functions (stack -> Lua)
+*/
+LUA_API void  (lua_settable) (lua_State *L, int idx);
+LUA_API void  (lua_setfield) (lua_State *L, int idx, const char *k);
+LUA_API void  (lua_rawset) (lua_State *L, int idx);
+LUA_API void  (lua_rawseti) (lua_State *L, int idx, int n);
+LUA_API int   (lua_setmetatable) (lua_State *L, int objindex);
+LUA_API int   (lua_setfenv) (lua_State *L, int idx);
+
+
+/*
+** `load' and `call' functions (load and run Lua code)
+*/
+LUA_API void  (lua_call) (lua_State *L, int nargs, int nresults);
+LUA_API int   (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);
+LUA_API int   (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud);
+LUA_API int   (lua_load) (lua_State *L, lua_Reader reader, void *dt,
+                                        const char *chunkname);
+
+LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data);
+
+
+/*
+** coroutine functions
+*/
+LUA_API int  (lua_yield) (lua_State *L, int nresults);
+LUA_API int  (lua_resume) (lua_State *L, int narg);
+LUA_API int  (lua_status) (lua_State *L);
+
+/*
+** garbage-collection function and options
+*/
+
+#define LUA_GCSTOP		0
+#define LUA_GCRESTART		1
+#define LUA_GCCOLLECT		2
+#define LUA_GCCOUNT		3
+#define LUA_GCCOUNTB		4
+#define LUA_GCSTEP		5
+#define LUA_GCSETPAUSE		6
+#define LUA_GCSETSTEPMUL	7
+
+LUA_API int (lua_gc) (lua_State *L, int what, int data);
+
+
+/*
+** miscellaneous functions
+*/
+
+LUA_API int   (lua_error) (lua_State *L);
+
+LUA_API int   (lua_next) (lua_State *L, int idx);
+
+LUA_API void  (lua_concat) (lua_State *L, int n);
+
+LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);
+LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);
+
+
+
+/* 
+** ===============================================================
+** some useful macros
+** ===============================================================
+*/
+
+#define lua_pop(L,n)		lua_settop(L, -(n)-1)
+
+#define lua_newtable(L)		lua_createtable(L, 0, 0)
+
+#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))
+
+#define lua_pushcfunction(L,f)	lua_pushcclosure(L, (f), 0)
+
+#define lua_strlen(L,i)		lua_objlen(L, (i))
+
+#define lua_isfunction(L,n)	(lua_type(L, (n)) == LUA_TFUNCTION)
+#define lua_istable(L,n)	(lua_type(L, (n)) == LUA_TTABLE)
+#define lua_islightuserdata(L,n)	(lua_type(L, (n)) == LUA_TLIGHTUSERDATA)
+#define lua_isnil(L,n)		(lua_type(L, (n)) == LUA_TNIL)
+#define lua_isboolean(L,n)	(lua_type(L, (n)) == LUA_TBOOLEAN)
+#define lua_isthread(L,n)	(lua_type(L, (n)) == LUA_TTHREAD)
+#define lua_isnone(L,n)		(lua_type(L, (n)) == LUA_TNONE)
+#define lua_isnoneornil(L, n)	(lua_type(L, (n)) <= 0)
+
+#define lua_pushliteral(L, s)	\
+	lua_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1)
+
+#define lua_setglobal(L,s)	lua_setfield(L, LUA_GLOBALSINDEX, (s))
+#define lua_getglobal(L,s)	lua_getfield(L, LUA_GLOBALSINDEX, (s))
+
+#define lua_tostring(L,i)	lua_tolstring(L, (i), NULL)
+
+
+
+/*
+** compatibility macros and functions
+*/
+
+#define lua_open()	luaL_newstate()
+
+#define lua_getregistry(L)	lua_pushvalue(L, LUA_REGISTRYINDEX)
+
+#define lua_getgccount(L)	lua_gc(L, LUA_GCCOUNT, 0)
+
+#define lua_Chunkreader		lua_Reader
+#define lua_Chunkwriter		lua_Writer
+
+
+/* hack */
+LUA_API void lua_setlevel	(lua_State *from, lua_State *to);
+
+
+/*
+** {======================================================================
+** Debug API
+** =======================================================================
+*/
+
+
+/*
+** Event codes
+*/
+#define LUA_HOOKCALL	0
+#define LUA_HOOKRET	1
+#define LUA_HOOKLINE	2
+#define LUA_HOOKCOUNT	3
+#define LUA_HOOKTAILRET 4
+
+
+/*
+** Event masks
+*/
+#define LUA_MASKCALL	(1 << LUA_HOOKCALL)
+#define LUA_MASKRET	(1 << LUA_HOOKRET)
+#define LUA_MASKLINE	(1 << LUA_HOOKLINE)
+#define LUA_MASKCOUNT	(1 << LUA_HOOKCOUNT)
+
+typedef struct lua_Debug lua_Debug;  /* activation record */
+
+
+/* Functions to be called by the debuger in specific events */
+typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
+
+
+LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);
+LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
+LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
+LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
+LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);
+LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);
+
+LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);
+LUA_API lua_Hook lua_gethook (lua_State *L);
+LUA_API int lua_gethookmask (lua_State *L);
+LUA_API int lua_gethookcount (lua_State *L);
+
+
+struct lua_Debug {
+  int event;
+  const char *name;	/* (n) */
+  const char *namewhat;	/* (n) `global', `local', `field', `method' */
+  const char *what;	/* (S) `Lua', `C', `main', `tail' */
+  const char *source;	/* (S) */
+  int currentline;	/* (l) */
+  int nups;		/* (u) number of upvalues */
+  int linedefined;	/* (S) */
+  int lastlinedefined;	/* (S) */
+  char short_src[LUA_IDSIZE]; /* (S) */
+  /* private part */
+  int i_ci;  /* active function */
+};
+
+/* }====================================================================== */
+
+
+/******************************************************************************
+* Copyright (C) 1994-2012 Lua.org, PUC-Rio.  All rights reserved.
+*
+* Permission is hereby granted, free of charge, to any person obtaining
+* a copy of this software and associated documentation files (the
+* "Software"), to deal in the Software without restriction, including
+* without limitation the rights to use, copy, modify, merge, publish,
+* distribute, sublicense, and/or sell copies of the Software, and to
+* permit persons to whom the Software is furnished to do so, subject to
+* the following conditions:
+*
+* The above copyright notice and this permission notice shall be
+* included in all copies or substantial portions of the Software.
+*
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+******************************************************************************/
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/lua_bit.c b/redis-stable/deps/lua/src/lua_bit.c
new file mode 100644
index 00000000..690df7d3
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua_bit.c
@@ -0,0 +1,189 @@
+/*
+** Lua BitOp -- a bit operations library for Lua 5.1/5.2.
+** http://bitop.luajit.org/
+**
+** Copyright (C) 2008-2012 Mike Pall. All rights reserved.
+**
+** Permission is hereby granted, free of charge, to any person obtaining
+** a copy of this software and associated documentation files (the
+** "Software"), to deal in the Software without restriction, including
+** without limitation the rights to use, copy, modify, merge, publish,
+** distribute, sublicense, and/or sell copies of the Software, and to
+** permit persons to whom the Software is furnished to do so, subject to
+** the following conditions:
+**
+** The above copyright notice and this permission notice shall be
+** included in all copies or substantial portions of the Software.
+**
+** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+**
+** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
+*/
+
+#define LUA_BITOP_VERSION	"1.0.2"
+
+#define LUA_LIB
+#include "lua.h"
+#include "lauxlib.h"
+
+#ifdef _MSC_VER
+/* MSVC is stuck in the last century and doesn't have C99's stdint.h. */
+typedef __int32 int32_t;
+typedef unsigned __int32 uint32_t;
+typedef unsigned __int64 uint64_t;
+#else
+#include <stdint.h>
+#endif
+
+typedef int32_t SBits;
+typedef uint32_t UBits;
+
+typedef union {
+  lua_Number n;
+#ifdef LUA_NUMBER_DOUBLE
+  uint64_t b;
+#else
+  UBits b;
+#endif
+} BitNum;
+
+/* Convert argument to bit type. */
+static UBits barg(lua_State *L, int idx)
+{
+  BitNum bn;
+  UBits b;
+#if LUA_VERSION_NUM < 502
+  bn.n = lua_tonumber(L, idx);
+#else
+  bn.n = luaL_checknumber(L, idx);
+#endif
+#if defined(LUA_NUMBER_DOUBLE)
+  bn.n += 6755399441055744.0;  /* 2^52+2^51 */
+#ifdef SWAPPED_DOUBLE
+  b = (UBits)(bn.b >> 32);
+#else
+  b = (UBits)bn.b;
+#endif
+#elif defined(LUA_NUMBER_INT) || defined(LUA_NUMBER_LONG) || \
+      defined(LUA_NUMBER_LONGLONG) || defined(LUA_NUMBER_LONG_LONG) || \
+      defined(LUA_NUMBER_LLONG)
+  if (sizeof(UBits) == sizeof(lua_Number))
+    b = bn.b;
+  else
+    b = (UBits)(SBits)bn.n;
+#elif defined(LUA_NUMBER_FLOAT)
+#error "A 'float' lua_Number type is incompatible with this library"
+#else
+#error "Unknown number type, check LUA_NUMBER_* in luaconf.h"
+#endif
+#if LUA_VERSION_NUM < 502
+  if (b == 0 && !lua_isnumber(L, idx)) {
+    luaL_typerror(L, idx, "number");
+  }
+#endif
+  return b;
+}
+
+/* Return bit type. */
+#define BRET(b)  lua_pushnumber(L, (lua_Number)(SBits)(b)); return 1;
+
+static int bit_tobit(lua_State *L) { BRET(barg(L, 1)) }
+static int bit_bnot(lua_State *L) { BRET(~barg(L, 1)) }
+
+#define BIT_OP(func, opr) \
+  static int func(lua_State *L) { int i; UBits b = barg(L, 1); \
+    for (i = lua_gettop(L); i > 1; i--) b opr barg(L, i); BRET(b) }
+BIT_OP(bit_band, &=)
+BIT_OP(bit_bor, |=)
+BIT_OP(bit_bxor, ^=)
+
+#define bshl(b, n)  (b << n)
+#define bshr(b, n)  (b >> n)
+#define bsar(b, n)  ((SBits)b >> n)
+#define brol(b, n)  ((b << n) | (b >> (32-n)))
+#define bror(b, n)  ((b << (32-n)) | (b >> n))
+#define BIT_SH(func, fn) \
+  static int func(lua_State *L) { \
+    UBits b = barg(L, 1); UBits n = barg(L, 2) & 31; BRET(fn(b, n)) }
+BIT_SH(bit_lshift, bshl)
+BIT_SH(bit_rshift, bshr)
+BIT_SH(bit_arshift, bsar)
+BIT_SH(bit_rol, brol)
+BIT_SH(bit_ror, bror)
+
+static int bit_bswap(lua_State *L)
+{
+  UBits b = barg(L, 1);
+  b = (b >> 24) | ((b >> 8) & 0xff00) | ((b & 0xff00) << 8) | (b << 24);
+  BRET(b)
+}
+
+static int bit_tohex(lua_State *L)
+{
+  UBits b = barg(L, 1);
+  SBits n = lua_isnone(L, 2) ? 8 : (SBits)barg(L, 2);
+  const char *hexdigits = "0123456789abcdef";
+  char buf[8];
+  int i;
+  if (n < 0) { n = -n; hexdigits = "0123456789ABCDEF"; }
+  if (n > 8) n = 8;
+  for (i = (int)n; --i >= 0; ) { buf[i] = hexdigits[b & 15]; b >>= 4; }
+  lua_pushlstring(L, buf, (size_t)n);
+  return 1;
+}
+
+static const struct luaL_Reg bit_funcs[] = {
+  { "tobit",	bit_tobit },
+  { "bnot",	bit_bnot },
+  { "band",	bit_band },
+  { "bor",	bit_bor },
+  { "bxor",	bit_bxor },
+  { "lshift",	bit_lshift },
+  { "rshift",	bit_rshift },
+  { "arshift",	bit_arshift },
+  { "rol",	bit_rol },
+  { "ror",	bit_ror },
+  { "bswap",	bit_bswap },
+  { "tohex",	bit_tohex },
+  { NULL, NULL }
+};
+
+/* Signed right-shifts are implementation-defined per C89/C99.
+** But the de facto standard are arithmetic right-shifts on two's
+** complement CPUs. This behaviour is required here, so test for it.
+*/
+#define BAD_SAR		(bsar(-8, 2) != (SBits)-2)
+
+LUALIB_API int luaopen_bit(lua_State *L)
+{
+  UBits b;
+  lua_pushnumber(L, (lua_Number)1437217655L);
+  b = barg(L, -1);
+  if (b != (UBits)1437217655L || BAD_SAR) {  /* Perform a simple self-test. */
+    const char *msg = "compiled with incompatible luaconf.h";
+#ifdef LUA_NUMBER_DOUBLE
+#ifdef _WIN32
+    if (b == (UBits)1610612736L)
+      msg = "use D3DCREATE_FPU_PRESERVE with DirectX";
+#endif
+    if (b == (UBits)1127743488L)
+      msg = "not compiled with SWAPPED_DOUBLE";
+#endif
+    if (BAD_SAR)
+      msg = "arithmetic right-shift broken";
+    luaL_error(L, "bit library self-test failed (%s)", msg);
+  }
+#if LUA_VERSION_NUM < 502
+  luaL_register(L, "bit", bit_funcs);
+#else
+  luaL_newlib(L, bit_funcs);
+#endif
+  return 1;
+}
+
diff --git a/redis-stable/deps/lua/src/lua_cjson.c b/redis-stable/deps/lua/src/lua_cjson.c
new file mode 100644
index 00000000..c26c0d7b
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua_cjson.c
@@ -0,0 +1,1427 @@
+/* Lua CJSON - JSON support for Lua
+ *
+ * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+/* Caveats:
+ * - JSON "null" values are represented as lightuserdata since Lua
+ *   tables cannot contain "nil". Compare with cjson.null.
+ * - Invalid UTF-8 characters are not detected and will be passed
+ *   untouched. If required, UTF-8 error checking should be done
+ *   outside this library.
+ * - Javascript comments are not part of the JSON spec, and are not
+ *   currently supported.
+ *
+ * Note: Decoding is slower than encoding. Lua spends significant
+ *       time (30%) managing tables when parsing JSON since it is
+ *       difficult to know object/array sizes ahead of time.
+ */
+
+#include <assert.h>
+#include <string.h>
+#include <math.h>
+#include <limits.h>
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "strbuf.h"
+#include "fpconv.h"
+
+#include "../../../src/solarisfixes.h"
+
+#ifndef CJSON_MODNAME
+#define CJSON_MODNAME   "cjson"
+#endif
+
+#ifndef CJSON_VERSION
+#define CJSON_VERSION   "2.1.0"
+#endif
+
+/* Workaround for Solaris platforms missing isinf() */
+#if !defined(isinf) && (defined(USE_INTERNAL_ISINF) || defined(MISSING_ISINF))
+#define isinf(x) (!isnan(x) && isnan((x) - (x)))
+#endif
+
+#define DEFAULT_SPARSE_CONVERT 0
+#define DEFAULT_SPARSE_RATIO 2
+#define DEFAULT_SPARSE_SAFE 10
+#define DEFAULT_ENCODE_MAX_DEPTH 1000
+#define DEFAULT_DECODE_MAX_DEPTH 1000
+#define DEFAULT_ENCODE_INVALID_NUMBERS 0
+#define DEFAULT_DECODE_INVALID_NUMBERS 1
+#define DEFAULT_ENCODE_KEEP_BUFFER 1
+#define DEFAULT_ENCODE_NUMBER_PRECISION 14
+
+#ifdef DISABLE_INVALID_NUMBERS
+#undef DEFAULT_DECODE_INVALID_NUMBERS
+#define DEFAULT_DECODE_INVALID_NUMBERS 0
+#endif
+
+typedef enum {
+    T_OBJ_BEGIN,
+    T_OBJ_END,
+    T_ARR_BEGIN,
+    T_ARR_END,
+    T_STRING,
+    T_NUMBER,
+    T_BOOLEAN,
+    T_NULL,
+    T_COLON,
+    T_COMMA,
+    T_END,
+    T_WHITESPACE,
+    T_ERROR,
+    T_UNKNOWN
+} json_token_type_t;
+
+static const char *json_token_type_name[] = {
+    "T_OBJ_BEGIN",
+    "T_OBJ_END",
+    "T_ARR_BEGIN",
+    "T_ARR_END",
+    "T_STRING",
+    "T_NUMBER",
+    "T_BOOLEAN",
+    "T_NULL",
+    "T_COLON",
+    "T_COMMA",
+    "T_END",
+    "T_WHITESPACE",
+    "T_ERROR",
+    "T_UNKNOWN",
+    NULL
+};
+
+typedef struct {
+    json_token_type_t ch2token[256];
+    char escape2char[256];  /* Decoding */
+
+    /* encode_buf is only allocated and used when
+     * encode_keep_buffer is set */
+    strbuf_t encode_buf;
+
+    int encode_sparse_convert;
+    int encode_sparse_ratio;
+    int encode_sparse_safe;
+    int encode_max_depth;
+    int encode_invalid_numbers;     /* 2 => Encode as "null" */
+    int encode_number_precision;
+    int encode_keep_buffer;
+
+    int decode_invalid_numbers;
+    int decode_max_depth;
+} json_config_t;
+
+typedef struct {
+    const char *data;
+    const char *ptr;
+    strbuf_t *tmp;    /* Temporary storage for strings */
+    json_config_t *cfg;
+    int current_depth;
+} json_parse_t;
+
+typedef struct {
+    json_token_type_t type;
+    int index;
+    union {
+        const char *string;
+        double number;
+        int boolean;
+    } value;
+    int string_len;
+} json_token_t;
+
+static const char *char2escape[256] = {
+    "\\u0000", "\\u0001", "\\u0002", "\\u0003",
+    "\\u0004", "\\u0005", "\\u0006", "\\u0007",
+    "\\b", "\\t", "\\n", "\\u000b",
+    "\\f", "\\r", "\\u000e", "\\u000f",
+    "\\u0010", "\\u0011", "\\u0012", "\\u0013",
+    "\\u0014", "\\u0015", "\\u0016", "\\u0017",
+    "\\u0018", "\\u0019", "\\u001a", "\\u001b",
+    "\\u001c", "\\u001d", "\\u001e", "\\u001f",
+    NULL, NULL, "\\\"", NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, "\\/",
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, "\\\\", NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, "\\u007f",
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
+};
+
+/* ===== CONFIGURATION ===== */
+
+static json_config_t *json_fetch_config(lua_State *l)
+{
+    json_config_t *cfg;
+
+    cfg = lua_touserdata(l, lua_upvalueindex(1));
+    if (!cfg)
+        luaL_error(l, "BUG: Unable to fetch CJSON configuration");
+
+    return cfg;
+}
+
+/* Ensure the correct number of arguments have been provided.
+ * Pad with nil to allow other functions to simply check arg[i]
+ * to find whether an argument was provided */
+static json_config_t *json_arg_init(lua_State *l, int args)
+{
+    luaL_argcheck(l, lua_gettop(l) <= args, args + 1,
+                  "found too many arguments");
+
+    while (lua_gettop(l) < args)
+        lua_pushnil(l);
+
+    return json_fetch_config(l);
+}
+
+/* Process integer options for configuration functions */
+static int json_integer_option(lua_State *l, int optindex, int *setting,
+                               int min, int max)
+{
+    char errmsg[64];
+    int value;
+
+    if (!lua_isnil(l, optindex)) {
+        value = luaL_checkinteger(l, optindex);
+        snprintf(errmsg, sizeof(errmsg), "expected integer between %d and %d", min, max);
+        luaL_argcheck(l, min <= value && value <= max, 1, errmsg);
+        *setting = value;
+    }
+
+    lua_pushinteger(l, *setting);
+
+    return 1;
+}
+
+/* Process enumerated arguments for a configuration function */
+static int json_enum_option(lua_State *l, int optindex, int *setting,
+                            const char **options, int bool_true)
+{
+    static const char *bool_options[] = { "off", "on", NULL };
+
+    if (!options) {
+        options = bool_options;
+        bool_true = 1;
+    }
+
+    if (!lua_isnil(l, optindex)) {
+        if (bool_true && lua_isboolean(l, optindex))
+            *setting = lua_toboolean(l, optindex) * bool_true;
+        else
+            *setting = luaL_checkoption(l, optindex, NULL, options);
+    }
+
+    if (bool_true && (*setting == 0 || *setting == bool_true))
+        lua_pushboolean(l, *setting);
+    else
+        lua_pushstring(l, options[*setting]);
+
+    return 1;
+}
+
+/* Configures handling of extremely sparse arrays:
+ * convert: Convert extremely sparse arrays into objects? Otherwise error.
+ * ratio: 0: always allow sparse; 1: never allow sparse; >1: use ratio
+ * safe: Always use an array when the max index <= safe */
+static int json_cfg_encode_sparse_array(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 3);
+
+    json_enum_option(l, 1, &cfg->encode_sparse_convert, NULL, 1);
+    json_integer_option(l, 2, &cfg->encode_sparse_ratio, 0, INT_MAX);
+    json_integer_option(l, 3, &cfg->encode_sparse_safe, 0, INT_MAX);
+
+    return 3;
+}
+
+/* Configures the maximum number of nested arrays/objects allowed when
+ * encoding */
+static int json_cfg_encode_max_depth(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 1);
+
+    return json_integer_option(l, 1, &cfg->encode_max_depth, 1, INT_MAX);
+}
+
+/* Configures the maximum number of nested arrays/objects allowed when
+ * encoding */
+static int json_cfg_decode_max_depth(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 1);
+
+    return json_integer_option(l, 1, &cfg->decode_max_depth, 1, INT_MAX);
+}
+
+/* Configures number precision when converting doubles to text */
+static int json_cfg_encode_number_precision(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 1);
+
+    return json_integer_option(l, 1, &cfg->encode_number_precision, 1, 14);
+}
+
+/* Configures JSON encoding buffer persistence */
+static int json_cfg_encode_keep_buffer(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 1);
+    int old_value;
+
+    old_value = cfg->encode_keep_buffer;
+
+    json_enum_option(l, 1, &cfg->encode_keep_buffer, NULL, 1);
+
+    /* Init / free the buffer if the setting has changed */
+    if (old_value ^ cfg->encode_keep_buffer) {
+        if (cfg->encode_keep_buffer)
+            strbuf_init(&cfg->encode_buf, 0);
+        else
+            strbuf_free(&cfg->encode_buf);
+    }
+
+    return 1;
+}
+
+#if defined(DISABLE_INVALID_NUMBERS) && !defined(USE_INTERNAL_FPCONV)
+void json_verify_invalid_number_setting(lua_State *l, int *setting)
+{
+    if (*setting == 1) {
+        *setting = 0;
+        luaL_error(l, "Infinity, NaN, and/or hexadecimal numbers are not supported.");
+    }
+}
+#else
+#define json_verify_invalid_number_setting(l, s)    do { } while(0)
+#endif
+
+static int json_cfg_encode_invalid_numbers(lua_State *l)
+{
+    static const char *options[] = { "off", "on", "null", NULL };
+    json_config_t *cfg = json_arg_init(l, 1);
+
+    json_enum_option(l, 1, &cfg->encode_invalid_numbers, options, 1);
+
+    json_verify_invalid_number_setting(l, &cfg->encode_invalid_numbers);
+
+    return 1;
+}
+
+static int json_cfg_decode_invalid_numbers(lua_State *l)
+{
+    json_config_t *cfg = json_arg_init(l, 1);
+
+    json_enum_option(l, 1, &cfg->decode_invalid_numbers, NULL, 1);
+
+    json_verify_invalid_number_setting(l, &cfg->encode_invalid_numbers);
+
+    return 1;
+}
+
+static int json_destroy_config(lua_State *l)
+{
+    json_config_t *cfg;
+
+    cfg = lua_touserdata(l, 1);
+    if (cfg)
+        strbuf_free(&cfg->encode_buf);
+    cfg = NULL;
+
+    return 0;
+}
+
+static void json_create_config(lua_State *l)
+{
+    json_config_t *cfg;
+    int i;
+
+    cfg = lua_newuserdata(l, sizeof(*cfg));
+
+    /* Create GC method to clean up strbuf */
+    lua_newtable(l);
+    lua_pushcfunction(l, json_destroy_config);
+    lua_setfield(l, -2, "__gc");
+    lua_setmetatable(l, -2);
+
+    cfg->encode_sparse_convert = DEFAULT_SPARSE_CONVERT;
+    cfg->encode_sparse_ratio = DEFAULT_SPARSE_RATIO;
+    cfg->encode_sparse_safe = DEFAULT_SPARSE_SAFE;
+    cfg->encode_max_depth = DEFAULT_ENCODE_MAX_DEPTH;
+    cfg->decode_max_depth = DEFAULT_DECODE_MAX_DEPTH;
+    cfg->encode_invalid_numbers = DEFAULT_ENCODE_INVALID_NUMBERS;
+    cfg->decode_invalid_numbers = DEFAULT_DECODE_INVALID_NUMBERS;
+    cfg->encode_keep_buffer = DEFAULT_ENCODE_KEEP_BUFFER;
+    cfg->encode_number_precision = DEFAULT_ENCODE_NUMBER_PRECISION;
+
+#if DEFAULT_ENCODE_KEEP_BUFFER > 0
+    strbuf_init(&cfg->encode_buf, 0);
+#endif
+
+    /* Decoding init */
+
+    /* Tag all characters as an error */
+    for (i = 0; i < 256; i++)
+        cfg->ch2token[i] = T_ERROR;
+
+    /* Set tokens that require no further processing */
+    cfg->ch2token['{'] = T_OBJ_BEGIN;
+    cfg->ch2token['}'] = T_OBJ_END;
+    cfg->ch2token['['] = T_ARR_BEGIN;
+    cfg->ch2token[']'] = T_ARR_END;
+    cfg->ch2token[','] = T_COMMA;
+    cfg->ch2token[':'] = T_COLON;
+    cfg->ch2token['\0'] = T_END;
+    cfg->ch2token[' '] = T_WHITESPACE;
+    cfg->ch2token['\t'] = T_WHITESPACE;
+    cfg->ch2token['\n'] = T_WHITESPACE;
+    cfg->ch2token['\r'] = T_WHITESPACE;
+
+    /* Update characters that require further processing */
+    cfg->ch2token['f'] = T_UNKNOWN;     /* false? */
+    cfg->ch2token['i'] = T_UNKNOWN;     /* inf, ininity? */
+    cfg->ch2token['I'] = T_UNKNOWN;
+    cfg->ch2token['n'] = T_UNKNOWN;     /* null, nan? */
+    cfg->ch2token['N'] = T_UNKNOWN;
+    cfg->ch2token['t'] = T_UNKNOWN;     /* true? */
+    cfg->ch2token['"'] = T_UNKNOWN;     /* string? */
+    cfg->ch2token['+'] = T_UNKNOWN;     /* number? */
+    cfg->ch2token['-'] = T_UNKNOWN;
+    for (i = 0; i < 10; i++)
+        cfg->ch2token['0' + i] = T_UNKNOWN;
+
+    /* Lookup table for parsing escape characters */
+    for (i = 0; i < 256; i++)
+        cfg->escape2char[i] = 0;          /* String error */
+    cfg->escape2char['"'] = '"';
+    cfg->escape2char['\\'] = '\\';
+    cfg->escape2char['/'] = '/';
+    cfg->escape2char['b'] = '\b';
+    cfg->escape2char['t'] = '\t';
+    cfg->escape2char['n'] = '\n';
+    cfg->escape2char['f'] = '\f';
+    cfg->escape2char['r'] = '\r';
+    cfg->escape2char['u'] = 'u';          /* Unicode parsing required */
+}
+
+/* ===== ENCODING ===== */
+
+static void json_encode_exception(lua_State *l, json_config_t *cfg, strbuf_t *json, int lindex,
+                                  const char *reason)
+{
+    if (!cfg->encode_keep_buffer)
+        strbuf_free(json);
+    luaL_error(l, "Cannot serialise %s: %s",
+                  lua_typename(l, lua_type(l, lindex)), reason);
+}
+
+/* json_append_string args:
+ * - lua_State
+ * - JSON strbuf
+ * - String (Lua stack index)
+ *
+ * Returns nothing. Doesn't remove string from Lua stack */
+static void json_append_string(lua_State *l, strbuf_t *json, int lindex)
+{
+    const char *escstr;
+    int i;
+    const char *str;
+    size_t len;
+
+    str = lua_tolstring(l, lindex, &len);
+
+    /* Worst case is len * 6 (all unicode escapes).
+     * This buffer is reused constantly for small strings
+     * If there are any excess pages, they won't be hit anyway.
+     * This gains ~5% speedup. */
+    strbuf_ensure_empty_length(json, len * 6 + 2);
+
+    strbuf_append_char_unsafe(json, '\"');
+    for (i = 0; i < len; i++) {
+        escstr = char2escape[(unsigned char)str[i]];
+        if (escstr)
+            strbuf_append_string(json, escstr);
+        else
+            strbuf_append_char_unsafe(json, str[i]);
+    }
+    strbuf_append_char_unsafe(json, '\"');
+}
+
+/* Find the size of the array on the top of the Lua stack
+ * -1   object (not a pure array)
+ * >=0  elements in array
+ */
+static int lua_array_length(lua_State *l, json_config_t *cfg, strbuf_t *json)
+{
+    double k;
+    int max;
+    int items;
+
+    max = 0;
+    items = 0;
+
+    lua_pushnil(l);
+    /* table, startkey */
+    while (lua_next(l, -2) != 0) {
+        /* table, key, value */
+        if (lua_type(l, -2) == LUA_TNUMBER &&
+            (k = lua_tonumber(l, -2))) {
+            /* Integer >= 1 ? */
+            if (floor(k) == k && k >= 1) {
+                if (k > max)
+                    max = k;
+                items++;
+                lua_pop(l, 1);
+                continue;
+            }
+        }
+
+        /* Must not be an array (non integer key) */
+        lua_pop(l, 2);
+        return -1;
+    }
+
+    /* Encode excessively sparse arrays as objects (if enabled) */
+    if (cfg->encode_sparse_ratio > 0 &&
+        max > items * cfg->encode_sparse_ratio &&
+        max > cfg->encode_sparse_safe) {
+        if (!cfg->encode_sparse_convert)
+            json_encode_exception(l, cfg, json, -1, "excessively sparse array");
+
+        return -1;
+    }
+
+    return max;
+}
+
+static void json_check_encode_depth(lua_State *l, json_config_t *cfg,
+                                    int current_depth, strbuf_t *json)
+{
+    /* Ensure there are enough slots free to traverse a table (key,
+     * value) and push a string for a potential error message.
+     *
+     * Unlike "decode", the key and value are still on the stack when
+     * lua_checkstack() is called.  Hence an extra slot for luaL_error()
+     * below is required just in case the next check to lua_checkstack()
+     * fails.
+     *
+     * While this won't cause a crash due to the EXTRA_STACK reserve
+     * slots, it would still be an improper use of the API. */
+    if (current_depth <= cfg->encode_max_depth && lua_checkstack(l, 3))
+        return;
+
+    if (!cfg->encode_keep_buffer)
+        strbuf_free(json);
+
+    luaL_error(l, "Cannot serialise, excessive nesting (%d)",
+               current_depth);
+}
+
+static void json_append_data(lua_State *l, json_config_t *cfg,
+                             int current_depth, strbuf_t *json);
+
+/* json_append_array args:
+ * - lua_State
+ * - JSON strbuf
+ * - Size of passwd Lua array (top of stack) */
+static void json_append_array(lua_State *l, json_config_t *cfg, int current_depth,
+                              strbuf_t *json, int array_length)
+{
+    int comma, i;
+
+    strbuf_append_char(json, '[');
+
+    comma = 0;
+    for (i = 1; i <= array_length; i++) {
+        if (comma)
+            strbuf_append_char(json, ',');
+        else
+            comma = 1;
+
+        lua_rawgeti(l, -1, i);
+        json_append_data(l, cfg, current_depth, json);
+        lua_pop(l, 1);
+    }
+
+    strbuf_append_char(json, ']');
+}
+
+static void json_append_number(lua_State *l, json_config_t *cfg,
+                               strbuf_t *json, int lindex)
+{
+    double num = lua_tonumber(l, lindex);
+    int len;
+
+    if (cfg->encode_invalid_numbers == 0) {
+        /* Prevent encoding invalid numbers */
+        if (isinf(num) || isnan(num))
+            json_encode_exception(l, cfg, json, lindex, "must not be NaN or Inf");
+    } else if (cfg->encode_invalid_numbers == 1) {
+        /* Encode invalid numbers, but handle "nan" separately
+         * since some platforms may encode as "-nan". */
+        if (isnan(num)) {
+            strbuf_append_mem(json, "nan", 3);
+            return;
+        }
+    } else {
+        /* Encode invalid numbers as "null" */
+        if (isinf(num) || isnan(num)) {
+            strbuf_append_mem(json, "null", 4);
+            return;
+        }
+    }
+
+    strbuf_ensure_empty_length(json, FPCONV_G_FMT_BUFSIZE);
+    len = fpconv_g_fmt(strbuf_empty_ptr(json), num, cfg->encode_number_precision);
+    strbuf_extend_length(json, len);
+}
+
+static void json_append_object(lua_State *l, json_config_t *cfg,
+                               int current_depth, strbuf_t *json)
+{
+    int comma, keytype;
+
+    /* Object */
+    strbuf_append_char(json, '{');
+
+    lua_pushnil(l);
+    /* table, startkey */
+    comma = 0;
+    while (lua_next(l, -2) != 0) {
+        if (comma)
+            strbuf_append_char(json, ',');
+        else
+            comma = 1;
+
+        /* table, key, value */
+        keytype = lua_type(l, -2);
+        if (keytype == LUA_TNUMBER) {
+            strbuf_append_char(json, '"');
+            json_append_number(l, cfg, json, -2);
+            strbuf_append_mem(json, "\":", 2);
+        } else if (keytype == LUA_TSTRING) {
+            json_append_string(l, json, -2);
+            strbuf_append_char(json, ':');
+        } else {
+            json_encode_exception(l, cfg, json, -2,
+                                  "table key must be a number or string");
+            /* never returns */
+        }
+
+        /* table, key, value */
+        json_append_data(l, cfg, current_depth, json);
+        lua_pop(l, 1);
+        /* table, key */
+    }
+
+    strbuf_append_char(json, '}');
+}
+
+/* Serialise Lua data into JSON string. */
+static void json_append_data(lua_State *l, json_config_t *cfg,
+                             int current_depth, strbuf_t *json)
+{
+    int len;
+
+    switch (lua_type(l, -1)) {
+    case LUA_TSTRING:
+        json_append_string(l, json, -1);
+        break;
+    case LUA_TNUMBER:
+        json_append_number(l, cfg, json, -1);
+        break;
+    case LUA_TBOOLEAN:
+        if (lua_toboolean(l, -1))
+            strbuf_append_mem(json, "true", 4);
+        else
+            strbuf_append_mem(json, "false", 5);
+        break;
+    case LUA_TTABLE:
+        current_depth++;
+        json_check_encode_depth(l, cfg, current_depth, json);
+        len = lua_array_length(l, cfg, json);
+        if (len > 0)
+            json_append_array(l, cfg, current_depth, json, len);
+        else
+            json_append_object(l, cfg, current_depth, json);
+        break;
+    case LUA_TNIL:
+        strbuf_append_mem(json, "null", 4);
+        break;
+    case LUA_TLIGHTUSERDATA:
+        if (lua_touserdata(l, -1) == NULL) {
+            strbuf_append_mem(json, "null", 4);
+            break;
+        }
+    default:
+        /* Remaining types (LUA_TFUNCTION, LUA_TUSERDATA, LUA_TTHREAD,
+         * and LUA_TLIGHTUSERDATA) cannot be serialised */
+        json_encode_exception(l, cfg, json, -1, "type not supported");
+        /* never returns */
+    }
+}
+
+static int json_encode(lua_State *l)
+{
+    json_config_t *cfg = json_fetch_config(l);
+    strbuf_t local_encode_buf;
+    strbuf_t *encode_buf;
+    char *json;
+    int len;
+
+    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
+
+    if (!cfg->encode_keep_buffer) {
+        /* Use private buffer */
+        encode_buf = &local_encode_buf;
+        strbuf_init(encode_buf, 0);
+    } else {
+        /* Reuse existing buffer */
+        encode_buf = &cfg->encode_buf;
+        strbuf_reset(encode_buf);
+    }
+
+    json_append_data(l, cfg, 0, encode_buf);
+    json = strbuf_string(encode_buf, &len);
+
+    lua_pushlstring(l, json, len);
+
+    if (!cfg->encode_keep_buffer)
+        strbuf_free(encode_buf);
+
+    return 1;
+}
+
+/* ===== DECODING ===== */
+
+static void json_process_value(lua_State *l, json_parse_t *json,
+                               json_token_t *token);
+
+static int hexdigit2int(char hex)
+{
+    if ('0' <= hex  && hex <= '9')
+        return hex - '0';
+
+    /* Force lowercase */
+    hex |= 0x20;
+    if ('a' <= hex && hex <= 'f')
+        return 10 + hex - 'a';
+
+    return -1;
+}
+
+static int decode_hex4(const char *hex)
+{
+    int digit[4];
+    int i;
+
+    /* Convert ASCII hex digit to numeric digit
+     * Note: this returns an error for invalid hex digits, including
+     *       NULL */
+    for (i = 0; i < 4; i++) {
+        digit[i] = hexdigit2int(hex[i]);
+        if (digit[i] < 0) {
+            return -1;
+        }
+    }
+
+    return (digit[0] << 12) +
+           (digit[1] << 8) +
+           (digit[2] << 4) +
+            digit[3];
+}
+
+/* Converts a Unicode codepoint to UTF-8.
+ * Returns UTF-8 string length, and up to 4 bytes in *utf8 */
+static int codepoint_to_utf8(char *utf8, int codepoint)
+{
+    /* 0xxxxxxx */
+    if (codepoint <= 0x7F) {
+        utf8[0] = codepoint;
+        return 1;
+    }
+
+    /* 110xxxxx 10xxxxxx */
+    if (codepoint <= 0x7FF) {
+        utf8[0] = (codepoint >> 6) | 0xC0;
+        utf8[1] = (codepoint & 0x3F) | 0x80;
+        return 2;
+    }
+
+    /* 1110xxxx 10xxxxxx 10xxxxxx */
+    if (codepoint <= 0xFFFF) {
+        utf8[0] = (codepoint >> 12) | 0xE0;
+        utf8[1] = ((codepoint >> 6) & 0x3F) | 0x80;
+        utf8[2] = (codepoint & 0x3F) | 0x80;
+        return 3;
+    }
+
+    /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
+    if (codepoint <= 0x1FFFFF) {
+        utf8[0] = (codepoint >> 18) | 0xF0;
+        utf8[1] = ((codepoint >> 12) & 0x3F) | 0x80;
+        utf8[2] = ((codepoint >> 6) & 0x3F) | 0x80;
+        utf8[3] = (codepoint & 0x3F) | 0x80;
+        return 4;
+    }
+
+    return 0;
+}
+
+
+/* Called when index pointing to beginning of UTF-16 code escape: \uXXXX
+ * \u is guaranteed to exist, but the remaining hex characters may be
+ * missing.
+ * Translate to UTF-8 and append to temporary token string.
+ * Must advance index to the next character to be processed.
+ * Returns: 0   success
+ *          -1  error
+ */
+static int json_append_unicode_escape(json_parse_t *json)
+{
+    char utf8[4];       /* Surrogate pairs require 4 UTF-8 bytes */
+    int codepoint;
+    int surrogate_low;
+    int len;
+    int escape_len = 6;
+
+    /* Fetch UTF-16 code unit */
+    codepoint = decode_hex4(json->ptr + 2);
+    if (codepoint < 0)
+        return -1;
+
+    /* UTF-16 surrogate pairs take the following 2 byte form:
+     *      11011 x yyyyyyyyyy
+     * When x = 0: y is the high 10 bits of the codepoint
+     *      x = 1: y is the low 10 bits of the codepoint
+     *
+     * Check for a surrogate pair (high or low) */
+    if ((codepoint & 0xF800) == 0xD800) {
+        /* Error if the 1st surrogate is not high */
+        if (codepoint & 0x400)
+            return -1;
+
+        /* Ensure the next code is a unicode escape */
+        if (*(json->ptr + escape_len) != '\\' ||
+            *(json->ptr + escape_len + 1) != 'u') {
+            return -1;
+        }
+
+        /* Fetch the next codepoint */
+        surrogate_low = decode_hex4(json->ptr + 2 + escape_len);
+        if (surrogate_low < 0)
+            return -1;
+
+        /* Error if the 2nd code is not a low surrogate */
+        if ((surrogate_low & 0xFC00) != 0xDC00)
+            return -1;
+
+        /* Calculate Unicode codepoint */
+        codepoint = (codepoint & 0x3FF) << 10;
+        surrogate_low &= 0x3FF;
+        codepoint = (codepoint | surrogate_low) + 0x10000;
+        escape_len = 12;
+    }
+
+    /* Convert codepoint to UTF-8 */
+    len = codepoint_to_utf8(utf8, codepoint);
+    if (!len)
+        return -1;
+
+    /* Append bytes and advance parse index */
+    strbuf_append_mem_unsafe(json->tmp, utf8, len);
+    json->ptr += escape_len;
+
+    return 0;
+}
+
+static void json_set_token_error(json_token_t *token, json_parse_t *json,
+                                 const char *errtype)
+{
+    token->type = T_ERROR;
+    token->index = json->ptr - json->data;
+    token->value.string = errtype;
+}
+
+static void json_next_string_token(json_parse_t *json, json_token_t *token)
+{
+    char *escape2char = json->cfg->escape2char;
+    char ch;
+
+    /* Caller must ensure a string is next */
+    assert(*json->ptr == '"');
+
+    /* Skip " */
+    json->ptr++;
+
+    /* json->tmp is the temporary strbuf used to accumulate the
+     * decoded string value.
+     * json->tmp is sized to handle JSON containing only a string value.
+     */
+    strbuf_reset(json->tmp);
+
+    while ((ch = *json->ptr) != '"') {
+        if (!ch) {
+            /* Premature end of the string */
+            json_set_token_error(token, json, "unexpected end of string");
+            return;
+        }
+
+        /* Handle escapes */
+        if (ch == '\\') {
+            /* Fetch escape character */
+            ch = *(json->ptr + 1);
+
+            /* Translate escape code and append to tmp string */
+            ch = escape2char[(unsigned char)ch];
+            if (ch == 'u') {
+                if (json_append_unicode_escape(json) == 0)
+                    continue;
+
+                json_set_token_error(token, json,
+                                     "invalid unicode escape code");
+                return;
+            }
+            if (!ch) {
+                json_set_token_error(token, json, "invalid escape code");
+                return;
+            }
+
+            /* Skip '\' */
+            json->ptr++;
+        }
+        /* Append normal character or translated single character
+         * Unicode escapes are handled above */
+        strbuf_append_char_unsafe(json->tmp, ch);
+        json->ptr++;
+    }
+    json->ptr++;    /* Eat final quote (") */
+
+    strbuf_ensure_null(json->tmp);
+
+    token->type = T_STRING;
+    token->value.string = strbuf_string(json->tmp, &token->string_len);
+}
+
+/* JSON numbers should take the following form:
+ *      -?(0|[1-9]|[1-9][0-9]+)(.[0-9]+)?([eE][-+]?[0-9]+)?
+ *
+ * json_next_number_token() uses strtod() which allows other forms:
+ * - numbers starting with '+'
+ * - NaN, -NaN, infinity, -infinity
+ * - hexadecimal numbers
+ * - numbers with leading zeros
+ *
+ * json_is_invalid_number() detects "numbers" which may pass strtod()'s
+ * error checking, but should not be allowed with strict JSON.
+ *
+ * json_is_invalid_number() may pass numbers which cause strtod()
+ * to generate an error.
+ */
+static int json_is_invalid_number(json_parse_t *json)
+{
+    const char *p = json->ptr;
+
+    /* Reject numbers starting with + */
+    if (*p == '+')
+        return 1;
+
+    /* Skip minus sign if it exists */
+    if (*p == '-')
+        p++;
+
+    /* Reject numbers starting with 0x, or leading zeros */
+    if (*p == '0') {
+        int ch2 = *(p + 1);
+
+        if ((ch2 | 0x20) == 'x' ||          /* Hex */
+            ('0' <= ch2 && ch2 <= '9'))     /* Leading zero */
+            return 1;
+
+        return 0;
+    } else if (*p <= '9') {
+        return 0;                           /* Ordinary number */
+    }
+
+    /* Reject inf/nan */
+    if (!strncasecmp(p, "inf", 3))
+        return 1;
+    if (!strncasecmp(p, "nan", 3))
+        return 1;
+
+    /* Pass all other numbers which may still be invalid, but
+     * strtod() will catch them. */
+    return 0;
+}
+
+static void json_next_number_token(json_parse_t *json, json_token_t *token)
+{
+    char *endptr;
+
+    token->type = T_NUMBER;
+    token->value.number = fpconv_strtod(json->ptr, &endptr);
+    if (json->ptr == endptr)
+        json_set_token_error(token, json, "invalid number");
+    else
+        json->ptr = endptr;     /* Skip the processed number */
+
+    return;
+}
+
+/* Fills in the token struct.
+ * T_STRING will return a pointer to the json_parse_t temporary string
+ * T_ERROR will leave the json->ptr pointer at the error.
+ */
+static void json_next_token(json_parse_t *json, json_token_t *token)
+{
+    const json_token_type_t *ch2token = json->cfg->ch2token;
+    int ch;
+
+    /* Eat whitespace. */
+    while (1) {
+        ch = (unsigned char)*(json->ptr);
+        token->type = ch2token[ch];
+        if (token->type != T_WHITESPACE)
+            break;
+        json->ptr++;
+    }
+
+    /* Store location of new token. Required when throwing errors
+     * for unexpected tokens (syntax errors). */
+    token->index = json->ptr - json->data;
+
+    /* Don't advance the pointer for an error or the end */
+    if (token->type == T_ERROR) {
+        json_set_token_error(token, json, "invalid token");
+        return;
+    }
+
+    if (token->type == T_END) {
+        return;
+    }
+
+    /* Found a known single character token, advance index and return */
+    if (token->type != T_UNKNOWN) {
+        json->ptr++;
+        return;
+    }
+
+    /* Process characters which triggered T_UNKNOWN
+     *
+     * Must use strncmp() to match the front of the JSON string.
+     * JSON identifier must be lowercase.
+     * When strict_numbers if disabled, either case is allowed for
+     * Infinity/NaN (since we are no longer following the spec..) */
+    if (ch == '"') {
+        json_next_string_token(json, token);
+        return;
+    } else if (ch == '-' || ('0' <= ch && ch <= '9')) {
+        if (!json->cfg->decode_invalid_numbers && json_is_invalid_number(json)) {
+            json_set_token_error(token, json, "invalid number");
+            return;
+        }
+        json_next_number_token(json, token);
+        return;
+    } else if (!strncmp(json->ptr, "true", 4)) {
+        token->type = T_BOOLEAN;
+        token->value.boolean = 1;
+        json->ptr += 4;
+        return;
+    } else if (!strncmp(json->ptr, "false", 5)) {
+        token->type = T_BOOLEAN;
+        token->value.boolean = 0;
+        json->ptr += 5;
+        return;
+    } else if (!strncmp(json->ptr, "null", 4)) {
+        token->type = T_NULL;
+        json->ptr += 4;
+        return;
+    } else if (json->cfg->decode_invalid_numbers &&
+               json_is_invalid_number(json)) {
+        /* When decode_invalid_numbers is enabled, only attempt to process
+         * numbers we know are invalid JSON (Inf, NaN, hex)
+         * This is required to generate an appropriate token error,
+         * otherwise all bad tokens will register as "invalid number"
+         */
+        json_next_number_token(json, token);
+        return;
+    }
+
+    /* Token starts with t/f/n but isn't recognised above. */
+    json_set_token_error(token, json, "invalid token");
+}
+
+/* This function does not return.
+ * DO NOT CALL WITH DYNAMIC MEMORY ALLOCATED.
+ * The only supported exception is the temporary parser string
+ * json->tmp struct.
+ * json and token should exist on the stack somewhere.
+ * luaL_error() will long_jmp and release the stack */
+static void json_throw_parse_error(lua_State *l, json_parse_t *json,
+                                   const char *exp, json_token_t *token)
+{
+    const char *found;
+
+    strbuf_free(json->tmp);
+
+    if (token->type == T_ERROR)
+        found = token->value.string;
+    else
+        found = json_token_type_name[token->type];
+
+    /* Note: token->index is 0 based, display starting from 1 */
+    luaL_error(l, "Expected %s but found %s at character %d",
+               exp, found, token->index + 1);
+}
+
+static inline void json_decode_ascend(json_parse_t *json)
+{
+    json->current_depth--;
+}
+
+static void json_decode_descend(lua_State *l, json_parse_t *json, int slots)
+{
+    json->current_depth++;
+
+    if (json->current_depth <= json->cfg->decode_max_depth &&
+        lua_checkstack(l, slots)) {
+        return;
+    }
+
+    strbuf_free(json->tmp);
+    luaL_error(l, "Found too many nested data structures (%d) at character %d",
+        json->current_depth, json->ptr - json->data);
+}
+
+static void json_parse_object_context(lua_State *l, json_parse_t *json)
+{
+    json_token_t token;
+
+    /* 3 slots required:
+     * .., table, key, value */
+    json_decode_descend(l, json, 3);
+
+    lua_newtable(l);
+
+    json_next_token(json, &token);
+
+    /* Handle empty objects */
+    if (token.type == T_OBJ_END) {
+        json_decode_ascend(json);
+        return;
+    }
+
+    while (1) {
+        if (token.type != T_STRING)
+            json_throw_parse_error(l, json, "object key string", &token);
+
+        /* Push key */
+        lua_pushlstring(l, token.value.string, token.string_len);
+
+        json_next_token(json, &token);
+        if (token.type != T_COLON)
+            json_throw_parse_error(l, json, "colon", &token);
+
+        /* Fetch value */
+        json_next_token(json, &token);
+        json_process_value(l, json, &token);
+
+        /* Set key = value */
+        lua_rawset(l, -3);
+
+        json_next_token(json, &token);
+
+        if (token.type == T_OBJ_END) {
+            json_decode_ascend(json);
+            return;
+        }
+
+        if (token.type != T_COMMA)
+            json_throw_parse_error(l, json, "comma or object end", &token);
+
+        json_next_token(json, &token);
+    }
+}
+
+/* Handle the array context */
+static void json_parse_array_context(lua_State *l, json_parse_t *json)
+{
+    json_token_t token;
+    int i;
+
+    /* 2 slots required:
+     * .., table, value */
+    json_decode_descend(l, json, 2);
+
+    lua_newtable(l);
+
+    json_next_token(json, &token);
+
+    /* Handle empty arrays */
+    if (token.type == T_ARR_END) {
+        json_decode_ascend(json);
+        return;
+    }
+
+    for (i = 1; ; i++) {
+        json_process_value(l, json, &token);
+        lua_rawseti(l, -2, i);            /* arr[i] = value */
+
+        json_next_token(json, &token);
+
+        if (token.type == T_ARR_END) {
+            json_decode_ascend(json);
+            return;
+        }
+
+        if (token.type != T_COMMA)
+            json_throw_parse_error(l, json, "comma or array end", &token);
+
+        json_next_token(json, &token);
+    }
+}
+
+/* Handle the "value" context */
+static void json_process_value(lua_State *l, json_parse_t *json,
+                               json_token_t *token)
+{
+    switch (token->type) {
+    case T_STRING:
+        lua_pushlstring(l, token->value.string, token->string_len);
+        break;;
+    case T_NUMBER:
+        lua_pushnumber(l, token->value.number);
+        break;;
+    case T_BOOLEAN:
+        lua_pushboolean(l, token->value.boolean);
+        break;;
+    case T_OBJ_BEGIN:
+        json_parse_object_context(l, json);
+        break;;
+    case T_ARR_BEGIN:
+        json_parse_array_context(l, json);
+        break;;
+    case T_NULL:
+        /* In Lua, setting "t[k] = nil" will delete k from the table.
+         * Hence a NULL pointer lightuserdata object is used instead */
+        lua_pushlightuserdata(l, NULL);
+        break;;
+    default:
+        json_throw_parse_error(l, json, "value", token);
+    }
+}
+
+static int json_decode(lua_State *l)
+{
+    json_parse_t json;
+    json_token_t token;
+    size_t json_len;
+
+    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
+
+    json.cfg = json_fetch_config(l);
+    json.data = luaL_checklstring(l, 1, &json_len);
+    json.current_depth = 0;
+    json.ptr = json.data;
+
+    /* Detect Unicode other than UTF-8 (see RFC 4627, Sec 3)
+     *
+     * CJSON can support any simple data type, hence only the first
+     * character is guaranteed to be ASCII (at worst: '"'). This is
+     * still enough to detect whether the wrong encoding is in use. */
+    if (json_len >= 2 && (!json.data[0] || !json.data[1]))
+        luaL_error(l, "JSON parser does not support UTF-16 or UTF-32");
+
+    /* Ensure the temporary buffer can hold the entire string.
+     * This means we no longer need to do length checks since the decoded
+     * string must be smaller than the entire json string */
+    json.tmp = strbuf_new(json_len);
+
+    json_next_token(&json, &token);
+    json_process_value(l, &json, &token);
+
+    /* Ensure there is no more input left */
+    json_next_token(&json, &token);
+
+    if (token.type != T_END)
+        json_throw_parse_error(l, &json, "the end", &token);
+
+    strbuf_free(json.tmp);
+
+    return 1;
+}
+
+/* ===== INITIALISATION ===== */
+
+#if !defined(LUA_VERSION_NUM) || LUA_VERSION_NUM < 502
+/* Compatibility for Lua 5.1.
+ *
+ * luaL_setfuncs() is used to create a module table where the functions have
+ * json_config_t as their first upvalue. Code borrowed from Lua 5.2 source. */
+static void luaL_setfuncs (lua_State *l, const luaL_Reg *reg, int nup)
+{
+    int i;
+
+    luaL_checkstack(l, nup, "too many upvalues");
+    for (; reg->name != NULL; reg++) {  /* fill the table with given functions */
+        for (i = 0; i < nup; i++)  /* copy upvalues to the top */
+            lua_pushvalue(l, -nup);
+        lua_pushcclosure(l, reg->func, nup);  /* closure with those upvalues */
+        lua_setfield(l, -(nup + 2), reg->name);
+    }
+    lua_pop(l, nup);  /* remove upvalues */
+}
+#endif
+
+/* Call target function in protected mode with all supplied args.
+ * Assumes target function only returns a single non-nil value.
+ * Convert and return thrown errors as: nil, "error message" */
+static int json_protect_conversion(lua_State *l)
+{
+    int err;
+
+    /* Deliberately throw an error for invalid arguments */
+    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
+
+    /* pcall() the function stored as upvalue(1) */
+    lua_pushvalue(l, lua_upvalueindex(1));
+    lua_insert(l, 1);
+    err = lua_pcall(l, 1, 1, 0);
+    if (!err)
+        return 1;
+
+    if (err == LUA_ERRRUN) {
+        lua_pushnil(l);
+        lua_insert(l, -2);
+        return 2;
+    }
+
+    /* Since we are not using a custom error handler, the only remaining
+     * errors are memory related */
+    return luaL_error(l, "Memory allocation error in CJSON protected call");
+}
+
+/* Return cjson module table */
+static int lua_cjson_new(lua_State *l)
+{
+    luaL_Reg reg[] = {
+        { "encode", json_encode },
+        { "decode", json_decode },
+        { "encode_sparse_array", json_cfg_encode_sparse_array },
+        { "encode_max_depth", json_cfg_encode_max_depth },
+        { "decode_max_depth", json_cfg_decode_max_depth },
+        { "encode_number_precision", json_cfg_encode_number_precision },
+        { "encode_keep_buffer", json_cfg_encode_keep_buffer },
+        { "encode_invalid_numbers", json_cfg_encode_invalid_numbers },
+        { "decode_invalid_numbers", json_cfg_decode_invalid_numbers },
+        { "new", lua_cjson_new },
+        { NULL, NULL }
+    };
+
+    /* Initialise number conversions */
+    fpconv_init();
+
+    /* cjson module table */
+    lua_newtable(l);
+
+    /* Register functions with config data as upvalue */
+    json_create_config(l);
+    luaL_setfuncs(l, reg, 1);
+
+    /* Set cjson.null */
+    lua_pushlightuserdata(l, NULL);
+    lua_setfield(l, -2, "null");
+
+    /* Set module name / version fields */
+    lua_pushliteral(l, CJSON_MODNAME);
+    lua_setfield(l, -2, "_NAME");
+    lua_pushliteral(l, CJSON_VERSION);
+    lua_setfield(l, -2, "_VERSION");
+
+    return 1;
+}
+
+/* Return cjson.safe module table */
+static int lua_cjson_safe_new(lua_State *l)
+{
+    const char *func[] = { "decode", "encode", NULL };
+    int i;
+
+    lua_cjson_new(l);
+
+    /* Fix new() method */
+    lua_pushcfunction(l, lua_cjson_safe_new);
+    lua_setfield(l, -2, "new");
+
+    for (i = 0; func[i]; i++) {
+        lua_getfield(l, -1, func[i]);
+        lua_pushcclosure(l, json_protect_conversion, 1);
+        lua_setfield(l, -2, func[i]);
+    }
+
+    return 1;
+}
+
+int luaopen_cjson(lua_State *l)
+{
+    lua_cjson_new(l);
+
+#ifdef ENABLE_CJSON_GLOBAL
+    /* Register a global "cjson" table. */
+    lua_pushvalue(l, -1);
+    lua_setglobal(l, CJSON_MODNAME);
+#endif
+
+    /* Return cjson table */
+    return 1;
+}
+
+int luaopen_cjson_safe(lua_State *l)
+{
+    lua_cjson_safe_new(l);
+
+    /* Return cjson.safe table */
+    return 1;
+}
+
+/* vi:ai et sw=4 ts=4:
+ */
diff --git a/redis-stable/deps/lua/src/lua_cmsgpack.c b/redis-stable/deps/lua/src/lua_cmsgpack.c
new file mode 100644
index 00000000..89215479
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua_cmsgpack.c
@@ -0,0 +1,977 @@
+#include <math.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+#include <assert.h>
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#define LUACMSGPACK_NAME        "cmsgpack"
+#define LUACMSGPACK_SAFE_NAME   "cmsgpack_safe"
+#define LUACMSGPACK_VERSION     "lua-cmsgpack 0.4.0"
+#define LUACMSGPACK_COPYRIGHT   "Copyright (C) 2012, Salvatore Sanfilippo"
+#define LUACMSGPACK_DESCRIPTION "MessagePack C implementation for Lua"
+
+/* Allows a preprocessor directive to override MAX_NESTING */
+#ifndef LUACMSGPACK_MAX_NESTING
+    #define LUACMSGPACK_MAX_NESTING  16 /* Max tables nesting. */
+#endif
+
+/* Check if float or double can be an integer without loss of precision */
+#define IS_INT_TYPE_EQUIVALENT(x, T) (!isinf(x) && (T)(x) == (x))
+
+#define IS_INT64_EQUIVALENT(x) IS_INT_TYPE_EQUIVALENT(x, int64_t)
+#define IS_INT_EQUIVALENT(x) IS_INT_TYPE_EQUIVALENT(x, int)
+
+/* If size of pointer is equal to a 4 byte integer, we're on 32 bits. */
+#if UINTPTR_MAX == UINT_MAX
+    #define BITS_32 1
+#else
+    #define BITS_32 0
+#endif
+
+#if BITS_32
+    #define lua_pushunsigned(L, n) lua_pushnumber(L, n)
+#else
+    #define lua_pushunsigned(L, n) lua_pushinteger(L, n)
+#endif
+
+/* =============================================================================
+ * MessagePack implementation and bindings for Lua 5.1/5.2.
+ * Copyright(C) 2012 Salvatore Sanfilippo <antirez@gmail.com>
+ *
+ * http://github.com/antirez/lua-cmsgpack
+ *
+ * For MessagePack specification check the following web site:
+ * http://wiki.msgpack.org/display/MSGPACK/Format+specification
+ *
+ * See Copyright Notice at the end of this file.
+ *
+ * CHANGELOG:
+ * 19-Feb-2012 (ver 0.1.0): Initial release.
+ * 20-Feb-2012 (ver 0.2.0): Tables encoding improved.
+ * 20-Feb-2012 (ver 0.2.1): Minor bug fixing.
+ * 20-Feb-2012 (ver 0.3.0): Module renamed lua-cmsgpack (was lua-msgpack).
+ * 04-Apr-2014 (ver 0.3.1): Lua 5.2 support and minor bug fix.
+ * 07-Apr-2014 (ver 0.4.0): Multiple pack/unpack, lua allocator, efficiency.
+ * ========================================================================== */
+
+/* -------------------------- Endian conversion --------------------------------
+ * We use it only for floats and doubles, all the other conversions performed
+ * in an endian independent fashion. So the only thing we need is a function
+ * that swaps a binary string if arch is little endian (and left it untouched
+ * otherwise). */
+
+/* Reverse memory bytes if arch is little endian. Given the conceptual
+ * simplicity of the Lua build system we prefer check for endianess at runtime.
+ * The performance difference should be acceptable. */
+void memrevifle(void *ptr, size_t len) {
+    unsigned char   *p = (unsigned char *)ptr,
+                    *e = (unsigned char *)p+len-1,
+                    aux;
+    int test = 1;
+    unsigned char *testp = (unsigned char*) &test;
+
+    if (testp[0] == 0) return; /* Big endian, nothing to do. */
+    len /= 2;
+    while(len--) {
+        aux = *p;
+        *p = *e;
+        *e = aux;
+        p++;
+        e--;
+    }
+}
+
+/* ---------------------------- String buffer ----------------------------------
+ * This is a simple implementation of string buffers. The only operation
+ * supported is creating empty buffers and appending bytes to it.
+ * The string buffer uses 2x preallocation on every realloc for O(N) append
+ * behavior.  */
+
+typedef struct mp_buf {
+    unsigned char *b;
+    size_t len, free;
+} mp_buf;
+
+void *mp_realloc(lua_State *L, void *target, size_t osize,size_t nsize) {
+    void *(*local_realloc) (void *, void *, size_t osize, size_t nsize) = NULL;
+    void *ud;
+
+    local_realloc = lua_getallocf(L, &ud);
+
+    return local_realloc(ud, target, osize, nsize);
+}
+
+mp_buf *mp_buf_new(lua_State *L) {
+    mp_buf *buf = NULL;
+
+    /* Old size = 0; new size = sizeof(*buf) */
+    buf = (mp_buf*)mp_realloc(L, NULL, 0, sizeof(*buf));
+
+    buf->b = NULL;
+    buf->len = buf->free = 0;
+    return buf;
+}
+
+void mp_buf_append(lua_State *L, mp_buf *buf, const unsigned char *s, size_t len) {
+    if (buf->free < len) {
+        size_t newsize = (buf->len+len)*2;
+
+        buf->b = (unsigned char*)mp_realloc(L, buf->b, buf->len + buf->free, newsize);
+        buf->free = newsize - buf->len;
+    }
+    memcpy(buf->b+buf->len,s,len);
+    buf->len += len;
+    buf->free -= len;
+}
+
+void mp_buf_free(lua_State *L, mp_buf *buf) {
+    mp_realloc(L, buf->b, buf->len + buf->free, 0); /* realloc to 0 = free */
+    mp_realloc(L, buf, sizeof(*buf), 0);
+}
+
+/* ---------------------------- String cursor ----------------------------------
+ * This simple data structure is used for parsing. Basically you create a cursor
+ * using a string pointer and a length, then it is possible to access the
+ * current string position with cursor->p, check the remaining length
+ * in cursor->left, and finally consume more string using
+ * mp_cur_consume(cursor,len), to advance 'p' and subtract 'left'.
+ * An additional field cursor->error is set to zero on initialization and can
+ * be used to report errors. */
+
+#define MP_CUR_ERROR_NONE   0
+#define MP_CUR_ERROR_EOF    1   /* Not enough data to complete operation. */
+#define MP_CUR_ERROR_BADFMT 2   /* Bad data format */
+
+typedef struct mp_cur {
+    const unsigned char *p;
+    size_t left;
+    int err;
+} mp_cur;
+
+void mp_cur_init(mp_cur *cursor, const unsigned char *s, size_t len) {
+    cursor->p = s;
+    cursor->left = len;
+    cursor->err = MP_CUR_ERROR_NONE;
+}
+
+#define mp_cur_consume(_c,_len) do { _c->p += _len; _c->left -= _len; } while(0)
+
+/* When there is not enough room we set an error in the cursor and return. This
+ * is very common across the code so we have a macro to make the code look
+ * a bit simpler. */
+#define mp_cur_need(_c,_len) do { \
+    if (_c->left < _len) { \
+        _c->err = MP_CUR_ERROR_EOF; \
+        return; \
+    } \
+} while(0)
+
+/* ------------------------- Low level MP encoding -------------------------- */
+
+void mp_encode_bytes(lua_State *L, mp_buf *buf, const unsigned char *s, size_t len) {
+    unsigned char hdr[5];
+    int hdrlen;
+
+    if (len < 32) {
+        hdr[0] = 0xa0 | (len&0xff); /* fix raw */
+        hdrlen = 1;
+    } else if (len <= 0xff) {
+        hdr[0] = 0xd9;
+        hdr[1] = len;
+        hdrlen = 2;
+    } else if (len <= 0xffff) {
+        hdr[0] = 0xda;
+        hdr[1] = (len&0xff00)>>8;
+        hdr[2] = len&0xff;
+        hdrlen = 3;
+    } else {
+        hdr[0] = 0xdb;
+        hdr[1] = (len&0xff000000)>>24;
+        hdr[2] = (len&0xff0000)>>16;
+        hdr[3] = (len&0xff00)>>8;
+        hdr[4] = len&0xff;
+        hdrlen = 5;
+    }
+    mp_buf_append(L,buf,hdr,hdrlen);
+    mp_buf_append(L,buf,s,len);
+}
+
+/* we assume IEEE 754 internal format for single and double precision floats. */
+void mp_encode_double(lua_State *L, mp_buf *buf, double d) {
+    unsigned char b[9];
+    float f = d;
+
+    assert(sizeof(f) == 4 && sizeof(d) == 8);
+    if (d == (double)f) {
+        b[0] = 0xca;    /* float IEEE 754 */
+        memcpy(b+1,&f,4);
+        memrevifle(b+1,4);
+        mp_buf_append(L,buf,b,5);
+    } else if (sizeof(d) == 8) {
+        b[0] = 0xcb;    /* double IEEE 754 */
+        memcpy(b+1,&d,8);
+        memrevifle(b+1,8);
+        mp_buf_append(L,buf,b,9);
+    }
+}
+
+void mp_encode_int(lua_State *L, mp_buf *buf, int64_t n) {
+    unsigned char b[9];
+    int enclen;
+
+    if (n >= 0) {
+        if (n <= 127) {
+            b[0] = n & 0x7f;    /* positive fixnum */
+            enclen = 1;
+        } else if (n <= 0xff) {
+            b[0] = 0xcc;        /* uint 8 */
+            b[1] = n & 0xff;
+            enclen = 2;
+        } else if (n <= 0xffff) {
+            b[0] = 0xcd;        /* uint 16 */
+            b[1] = (n & 0xff00) >> 8;
+            b[2] = n & 0xff;
+            enclen = 3;
+        } else if (n <= 0xffffffffLL) {
+            b[0] = 0xce;        /* uint 32 */
+            b[1] = (n & 0xff000000) >> 24;
+            b[2] = (n & 0xff0000) >> 16;
+            b[3] = (n & 0xff00) >> 8;
+            b[4] = n & 0xff;
+            enclen = 5;
+        } else {
+            b[0] = 0xcf;        /* uint 64 */
+            b[1] = (n & 0xff00000000000000LL) >> 56;
+            b[2] = (n & 0xff000000000000LL) >> 48;
+            b[3] = (n & 0xff0000000000LL) >> 40;
+            b[4] = (n & 0xff00000000LL) >> 32;
+            b[5] = (n & 0xff000000) >> 24;
+            b[6] = (n & 0xff0000) >> 16;
+            b[7] = (n & 0xff00) >> 8;
+            b[8] = n & 0xff;
+            enclen = 9;
+        }
+    } else {
+        if (n >= -32) {
+            b[0] = ((signed char)n);   /* negative fixnum */
+            enclen = 1;
+        } else if (n >= -128) {
+            b[0] = 0xd0;        /* int 8 */
+            b[1] = n & 0xff;
+            enclen = 2;
+        } else if (n >= -32768) {
+            b[0] = 0xd1;        /* int 16 */
+            b[1] = (n & 0xff00) >> 8;
+            b[2] = n & 0xff;
+            enclen = 3;
+        } else if (n >= -2147483648LL) {
+            b[0] = 0xd2;        /* int 32 */
+            b[1] = (n & 0xff000000) >> 24;
+            b[2] = (n & 0xff0000) >> 16;
+            b[3] = (n & 0xff00) >> 8;
+            b[4] = n & 0xff;
+            enclen = 5;
+        } else {
+            b[0] = 0xd3;        /* int 64 */
+            b[1] = (n & 0xff00000000000000LL) >> 56;
+            b[2] = (n & 0xff000000000000LL) >> 48;
+            b[3] = (n & 0xff0000000000LL) >> 40;
+            b[4] = (n & 0xff00000000LL) >> 32;
+            b[5] = (n & 0xff000000) >> 24;
+            b[6] = (n & 0xff0000) >> 16;
+            b[7] = (n & 0xff00) >> 8;
+            b[8] = n & 0xff;
+            enclen = 9;
+        }
+    }
+    mp_buf_append(L,buf,b,enclen);
+}
+
+void mp_encode_array(lua_State *L, mp_buf *buf, int64_t n) {
+    unsigned char b[5];
+    int enclen;
+
+    if (n <= 15) {
+        b[0] = 0x90 | (n & 0xf);    /* fix array */
+        enclen = 1;
+    } else if (n <= 65535) {
+        b[0] = 0xdc;                /* array 16 */
+        b[1] = (n & 0xff00) >> 8;
+        b[2] = n & 0xff;
+        enclen = 3;
+    } else {
+        b[0] = 0xdd;                /* array 32 */
+        b[1] = (n & 0xff000000) >> 24;
+        b[2] = (n & 0xff0000) >> 16;
+        b[3] = (n & 0xff00) >> 8;
+        b[4] = n & 0xff;
+        enclen = 5;
+    }
+    mp_buf_append(L,buf,b,enclen);
+}
+
+void mp_encode_map(lua_State *L, mp_buf *buf, int64_t n) {
+    unsigned char b[5];
+    int enclen;
+
+    if (n <= 15) {
+        b[0] = 0x80 | (n & 0xf);    /* fix map */
+        enclen = 1;
+    } else if (n <= 65535) {
+        b[0] = 0xde;                /* map 16 */
+        b[1] = (n & 0xff00) >> 8;
+        b[2] = n & 0xff;
+        enclen = 3;
+    } else {
+        b[0] = 0xdf;                /* map 32 */
+        b[1] = (n & 0xff000000) >> 24;
+        b[2] = (n & 0xff0000) >> 16;
+        b[3] = (n & 0xff00) >> 8;
+        b[4] = n & 0xff;
+        enclen = 5;
+    }
+    mp_buf_append(L,buf,b,enclen);
+}
+
+/* --------------------------- Lua types encoding --------------------------- */
+
+void mp_encode_lua_string(lua_State *L, mp_buf *buf) {
+    size_t len;
+    const char *s;
+
+    s = lua_tolstring(L,-1,&len);
+    mp_encode_bytes(L,buf,(const unsigned char*)s,len);
+}
+
+void mp_encode_lua_bool(lua_State *L, mp_buf *buf) {
+    unsigned char b = lua_toboolean(L,-1) ? 0xc3 : 0xc2;
+    mp_buf_append(L,buf,&b,1);
+}
+
+/* Lua 5.3 has a built in 64-bit integer type */
+void mp_encode_lua_integer(lua_State *L, mp_buf *buf) {
+#if (LUA_VERSION_NUM < 503) && BITS_32
+    lua_Number i = lua_tonumber(L,-1);
+#else
+    lua_Integer i = lua_tointeger(L,-1);
+#endif
+    mp_encode_int(L, buf, (int64_t)i);
+}
+
+/* Lua 5.2 and lower only has 64-bit doubles, so we need to
+ * detect if the double may be representable as an int
+ * for Lua < 5.3 */
+void mp_encode_lua_number(lua_State *L, mp_buf *buf) {
+    lua_Number n = lua_tonumber(L,-1);
+
+    if (IS_INT64_EQUIVALENT(n)) {
+        mp_encode_lua_integer(L, buf);
+    } else {
+        mp_encode_double(L,buf,(double)n);
+    }
+}
+
+void mp_encode_lua_type(lua_State *L, mp_buf *buf, int level);
+
+/* Convert a lua table into a message pack list. */
+void mp_encode_lua_table_as_array(lua_State *L, mp_buf *buf, int level) {
+#if LUA_VERSION_NUM < 502
+    size_t len = lua_objlen(L,-1), j;
+#else
+    size_t len = lua_rawlen(L,-1), j;
+#endif
+
+    mp_encode_array(L,buf,len);
+    luaL_checkstack(L, 1, "in function mp_encode_lua_table_as_array");
+    for (j = 1; j <= len; j++) {
+        lua_pushnumber(L,j);
+        lua_gettable(L,-2);
+        mp_encode_lua_type(L,buf,level+1);
+    }
+}
+
+/* Convert a lua table into a message pack key-value map. */
+void mp_encode_lua_table_as_map(lua_State *L, mp_buf *buf, int level) {
+    size_t len = 0;
+
+    /* First step: count keys into table. No other way to do it with the
+     * Lua API, we need to iterate a first time. Note that an alternative
+     * would be to do a single run, and then hack the buffer to insert the
+     * map opcodes for message pack. Too hackish for this lib. */
+    luaL_checkstack(L, 3, "in function mp_encode_lua_table_as_map");
+    lua_pushnil(L);
+    while(lua_next(L,-2)) {
+        lua_pop(L,1); /* remove value, keep key for next iteration. */
+        len++;
+    }
+
+    /* Step two: actually encoding of the map. */
+    mp_encode_map(L,buf,len);
+    lua_pushnil(L);
+    while(lua_next(L,-2)) {
+        /* Stack: ... key value */
+        lua_pushvalue(L,-2); /* Stack: ... key value key */
+        mp_encode_lua_type(L,buf,level+1); /* encode key */
+        mp_encode_lua_type(L,buf,level+1); /* encode val */
+    }
+}
+
+/* Returns true if the Lua table on top of the stack is exclusively composed
+ * of keys from numerical keys from 1 up to N, with N being the total number
+ * of elements, without any hole in the middle. */
+int table_is_an_array(lua_State *L) {
+    int count = 0, max = 0;
+#if LUA_VERSION_NUM < 503
+    lua_Number n;
+#else
+    lua_Integer n;
+#endif
+
+    /* Stack top on function entry */
+    int stacktop;
+
+    stacktop = lua_gettop(L);
+
+    lua_pushnil(L);
+    while(lua_next(L,-2)) {
+        /* Stack: ... key value */
+        lua_pop(L,1); /* Stack: ... key */
+        /* The <= 0 check is valid here because we're comparing indexes. */
+#if LUA_VERSION_NUM < 503
+        if ((LUA_TNUMBER != lua_type(L,-1)) || (n = lua_tonumber(L, -1)) <= 0 ||
+            !IS_INT_EQUIVALENT(n))
+#else
+        if (!lua_isinteger(L,-1) || (n = lua_tointeger(L, -1)) <= 0)
+#endif
+        {
+            lua_settop(L, stacktop);
+            return 0;
+        }
+        max = (n > max ? n : max);
+        count++;
+    }
+    /* We have the total number of elements in "count". Also we have
+     * the max index encountered in "max". We can't reach this code
+     * if there are indexes <= 0. If you also note that there can not be
+     * repeated keys into a table, you have that if max==count you are sure
+     * that there are all the keys form 1 to count (both included). */
+    lua_settop(L, stacktop);
+    return max == count;
+}
+
+/* If the length operator returns non-zero, that is, there is at least
+ * an object at key '1', we serialize to message pack list. Otherwise
+ * we use a map. */
+void mp_encode_lua_table(lua_State *L, mp_buf *buf, int level) {
+    if (table_is_an_array(L))
+        mp_encode_lua_table_as_array(L,buf,level);
+    else
+        mp_encode_lua_table_as_map(L,buf,level);
+}
+
+void mp_encode_lua_null(lua_State *L, mp_buf *buf) {
+    unsigned char b[1];
+
+    b[0] = 0xc0;
+    mp_buf_append(L,buf,b,1);
+}
+
+void mp_encode_lua_type(lua_State *L, mp_buf *buf, int level) {
+    int t = lua_type(L,-1);
+
+    /* Limit the encoding of nested tables to a specified maximum depth, so that
+     * we survive when called against circular references in tables. */
+    if (t == LUA_TTABLE && level == LUACMSGPACK_MAX_NESTING) t = LUA_TNIL;
+    switch(t) {
+    case LUA_TSTRING: mp_encode_lua_string(L,buf); break;
+    case LUA_TBOOLEAN: mp_encode_lua_bool(L,buf); break;
+    case LUA_TNUMBER:
+    #if LUA_VERSION_NUM < 503
+        mp_encode_lua_number(L,buf); break;
+    #else
+        if (lua_isinteger(L, -1)) {
+            mp_encode_lua_integer(L, buf);
+        } else {
+            mp_encode_lua_number(L, buf);
+        }
+        break;
+    #endif
+    case LUA_TTABLE: mp_encode_lua_table(L,buf,level); break;
+    default: mp_encode_lua_null(L,buf); break;
+    }
+    lua_pop(L,1);
+}
+
+/*
+ * Packs all arguments as a stream for multiple upacking later.
+ * Returns error if no arguments provided.
+ */
+int mp_pack(lua_State *L) {
+    int nargs = lua_gettop(L);
+    int i;
+    mp_buf *buf;
+
+    if (nargs == 0)
+        return luaL_argerror(L, 0, "MessagePack pack needs input.");
+
+    if (!lua_checkstack(L, nargs))
+        return luaL_argerror(L, 0, "Too many arguments for MessagePack pack.");
+
+    buf = mp_buf_new(L);
+    for(i = 1; i <= nargs; i++) {
+        /* Copy argument i to top of stack for _encode processing;
+         * the encode function pops it from the stack when complete. */
+        luaL_checkstack(L, 1, "in function mp_check");
+        lua_pushvalue(L, i);
+
+        mp_encode_lua_type(L,buf,0);
+
+        lua_pushlstring(L,(char*)buf->b,buf->len);
+
+        /* Reuse the buffer for the next operation by
+         * setting its free count to the total buffer size
+         * and the current position to zero. */
+        buf->free += buf->len;
+        buf->len = 0;
+    }
+    mp_buf_free(L, buf);
+
+    /* Concatenate all nargs buffers together */
+    lua_concat(L, nargs);
+    return 1;
+}
+
+/* ------------------------------- Decoding --------------------------------- */
+
+void mp_decode_to_lua_type(lua_State *L, mp_cur *c);
+
+void mp_decode_to_lua_array(lua_State *L, mp_cur *c, size_t len) {
+    assert(len <= UINT_MAX);
+    int index = 1;
+
+    lua_newtable(L);
+    luaL_checkstack(L, 1, "in function mp_decode_to_lua_array");
+    while(len--) {
+        lua_pushnumber(L,index++);
+        mp_decode_to_lua_type(L,c);
+        if (c->err) return;
+        lua_settable(L,-3);
+    }
+}
+
+void mp_decode_to_lua_hash(lua_State *L, mp_cur *c, size_t len) {
+    assert(len <= UINT_MAX);
+    lua_newtable(L);
+    while(len--) {
+        mp_decode_to_lua_type(L,c); /* key */
+        if (c->err) return;
+        mp_decode_to_lua_type(L,c); /* value */
+        if (c->err) return;
+        lua_settable(L,-3);
+    }
+}
+
+/* Decode a Message Pack raw object pointed by the string cursor 'c' to
+ * a Lua type, that is left as the only result on the stack. */
+void mp_decode_to_lua_type(lua_State *L, mp_cur *c) {
+    mp_cur_need(c,1);
+
+    /* If we return more than 18 elements, we must resize the stack to
+     * fit all our return values.  But, there is no way to
+     * determine how many objects a msgpack will unpack to up front, so
+     * we request a +1 larger stack on each iteration (noop if stack is
+     * big enough, and when stack does require resize it doubles in size) */
+    luaL_checkstack(L, 1,
+        "too many return values at once; "
+        "use unpack_one or unpack_limit instead.");
+
+    switch(c->p[0]) {
+    case 0xcc:  /* uint 8 */
+        mp_cur_need(c,2);
+        lua_pushunsigned(L,c->p[1]);
+        mp_cur_consume(c,2);
+        break;
+    case 0xd0:  /* int 8 */
+        mp_cur_need(c,2);
+        lua_pushinteger(L,(signed char)c->p[1]);
+        mp_cur_consume(c,2);
+        break;
+    case 0xcd:  /* uint 16 */
+        mp_cur_need(c,3);
+        lua_pushunsigned(L,
+            (c->p[1] << 8) |
+             c->p[2]);
+        mp_cur_consume(c,3);
+        break;
+    case 0xd1:  /* int 16 */
+        mp_cur_need(c,3);
+        lua_pushinteger(L,(int16_t)
+            (c->p[1] << 8) |
+             c->p[2]);
+        mp_cur_consume(c,3);
+        break;
+    case 0xce:  /* uint 32 */
+        mp_cur_need(c,5);
+        lua_pushunsigned(L,
+            ((uint32_t)c->p[1] << 24) |
+            ((uint32_t)c->p[2] << 16) |
+            ((uint32_t)c->p[3] << 8) |
+             (uint32_t)c->p[4]);
+        mp_cur_consume(c,5);
+        break;
+    case 0xd2:  /* int 32 */
+        mp_cur_need(c,5);
+        lua_pushinteger(L,
+            ((int32_t)c->p[1] << 24) |
+            ((int32_t)c->p[2] << 16) |
+            ((int32_t)c->p[3] << 8) |
+             (int32_t)c->p[4]);
+        mp_cur_consume(c,5);
+        break;
+    case 0xcf:  /* uint 64 */
+        mp_cur_need(c,9);
+        lua_pushunsigned(L,
+            ((uint64_t)c->p[1] << 56) |
+            ((uint64_t)c->p[2] << 48) |
+            ((uint64_t)c->p[3] << 40) |
+            ((uint64_t)c->p[4] << 32) |
+            ((uint64_t)c->p[5] << 24) |
+            ((uint64_t)c->p[6] << 16) |
+            ((uint64_t)c->p[7] << 8) |
+             (uint64_t)c->p[8]);
+        mp_cur_consume(c,9);
+        break;
+    case 0xd3:  /* int 64 */
+        mp_cur_need(c,9);
+#if LUA_VERSION_NUM < 503
+        lua_pushnumber(L,
+#else
+        lua_pushinteger(L,
+#endif
+            ((int64_t)c->p[1] << 56) |
+            ((int64_t)c->p[2] << 48) |
+            ((int64_t)c->p[3] << 40) |
+            ((int64_t)c->p[4] << 32) |
+            ((int64_t)c->p[5] << 24) |
+            ((int64_t)c->p[6] << 16) |
+            ((int64_t)c->p[7] << 8) |
+             (int64_t)c->p[8]);
+        mp_cur_consume(c,9);
+        break;
+    case 0xc0:  /* nil */
+        lua_pushnil(L);
+        mp_cur_consume(c,1);
+        break;
+    case 0xc3:  /* true */
+        lua_pushboolean(L,1);
+        mp_cur_consume(c,1);
+        break;
+    case 0xc2:  /* false */
+        lua_pushboolean(L,0);
+        mp_cur_consume(c,1);
+        break;
+    case 0xca:  /* float */
+        mp_cur_need(c,5);
+        assert(sizeof(float) == 4);
+        {
+            float f;
+            memcpy(&f,c->p+1,4);
+            memrevifle(&f,4);
+            lua_pushnumber(L,f);
+            mp_cur_consume(c,5);
+        }
+        break;
+    case 0xcb:  /* double */
+        mp_cur_need(c,9);
+        assert(sizeof(double) == 8);
+        {
+            double d;
+            memcpy(&d,c->p+1,8);
+            memrevifle(&d,8);
+            lua_pushnumber(L,d);
+            mp_cur_consume(c,9);
+        }
+        break;
+    case 0xd9:  /* raw 8 */
+        mp_cur_need(c,2);
+        {
+            size_t l = c->p[1];
+            mp_cur_need(c,2+l);
+            lua_pushlstring(L,(char*)c->p+2,l);
+            mp_cur_consume(c,2+l);
+        }
+        break;
+    case 0xda:  /* raw 16 */
+        mp_cur_need(c,3);
+        {
+            size_t l = (c->p[1] << 8) | c->p[2];
+            mp_cur_need(c,3+l);
+            lua_pushlstring(L,(char*)c->p+3,l);
+            mp_cur_consume(c,3+l);
+        }
+        break;
+    case 0xdb:  /* raw 32 */
+        mp_cur_need(c,5);
+        {
+            size_t l = ((size_t)c->p[1] << 24) |
+                       ((size_t)c->p[2] << 16) |
+                       ((size_t)c->p[3] << 8) |
+                       (size_t)c->p[4];
+            mp_cur_consume(c,5);
+            mp_cur_need(c,l);
+            lua_pushlstring(L,(char*)c->p,l);
+            mp_cur_consume(c,l);
+        }
+        break;
+    case 0xdc:  /* array 16 */
+        mp_cur_need(c,3);
+        {
+            size_t l = (c->p[1] << 8) | c->p[2];
+            mp_cur_consume(c,3);
+            mp_decode_to_lua_array(L,c,l);
+        }
+        break;
+    case 0xdd:  /* array 32 */
+        mp_cur_need(c,5);
+        {
+            size_t l = ((size_t)c->p[1] << 24) |
+                       ((size_t)c->p[2] << 16) |
+                       ((size_t)c->p[3] << 8) |
+                       (size_t)c->p[4];
+            mp_cur_consume(c,5);
+            mp_decode_to_lua_array(L,c,l);
+        }
+        break;
+    case 0xde:  /* map 16 */
+        mp_cur_need(c,3);
+        {
+            size_t l = (c->p[1] << 8) | c->p[2];
+            mp_cur_consume(c,3);
+            mp_decode_to_lua_hash(L,c,l);
+        }
+        break;
+    case 0xdf:  /* map 32 */
+        mp_cur_need(c,5);
+        {
+            size_t l = ((size_t)c->p[1] << 24) |
+                       ((size_t)c->p[2] << 16) |
+                       ((size_t)c->p[3] << 8) |
+                       (size_t)c->p[4];
+            mp_cur_consume(c,5);
+            mp_decode_to_lua_hash(L,c,l);
+        }
+        break;
+    default:    /* types that can't be idenitified by first byte value. */
+        if ((c->p[0] & 0x80) == 0) {   /* positive fixnum */
+            lua_pushunsigned(L,c->p[0]);
+            mp_cur_consume(c,1);
+        } else if ((c->p[0] & 0xe0) == 0xe0) {  /* negative fixnum */
+            lua_pushinteger(L,(signed char)c->p[0]);
+            mp_cur_consume(c,1);
+        } else if ((c->p[0] & 0xe0) == 0xa0) {  /* fix raw */
+            size_t l = c->p[0] & 0x1f;
+            mp_cur_need(c,1+l);
+            lua_pushlstring(L,(char*)c->p+1,l);
+            mp_cur_consume(c,1+l);
+        } else if ((c->p[0] & 0xf0) == 0x90) {  /* fix map */
+            size_t l = c->p[0] & 0xf;
+            mp_cur_consume(c,1);
+            mp_decode_to_lua_array(L,c,l);
+        } else if ((c->p[0] & 0xf0) == 0x80) {  /* fix map */
+            size_t l = c->p[0] & 0xf;
+            mp_cur_consume(c,1);
+            mp_decode_to_lua_hash(L,c,l);
+        } else {
+            c->err = MP_CUR_ERROR_BADFMT;
+        }
+    }
+}
+
+int mp_unpack_full(lua_State *L, int limit, int offset) {
+    size_t len;
+    const char *s;
+    mp_cur c;
+    int cnt; /* Number of objects unpacked */
+    int decode_all = (!limit && !offset);
+
+    s = luaL_checklstring(L,1,&len); /* if no match, exits */
+
+    if (offset < 0 || limit < 0) /* requesting negative off or lim is invalid */
+        return luaL_error(L,
+            "Invalid request to unpack with offset of %d and limit of %d.",
+            offset, len);
+    else if (offset > len)
+        return luaL_error(L,
+            "Start offset %d greater than input length %d.", offset, len);
+
+    if (decode_all) limit = INT_MAX;
+
+    mp_cur_init(&c,(const unsigned char *)s+offset,len-offset);
+
+    /* We loop over the decode because this could be a stream
+     * of multiple top-level values serialized together */
+    for(cnt = 0; c.left > 0 && cnt < limit; cnt++) {
+        mp_decode_to_lua_type(L,&c);
+
+        if (c.err == MP_CUR_ERROR_EOF) {
+            return luaL_error(L,"Missing bytes in input.");
+        } else if (c.err == MP_CUR_ERROR_BADFMT) {
+            return luaL_error(L,"Bad data format in input.");
+        }
+    }
+
+    if (!decode_all) {
+        /* c->left is the remaining size of the input buffer.
+         * subtract the entire buffer size from the unprocessed size
+         * to get our next start offset */
+        int offset = len - c.left;
+
+        luaL_checkstack(L, 1, "in function mp_unpack_full");
+
+        /* Return offset -1 when we have have processed the entire buffer. */
+        lua_pushinteger(L, c.left == 0 ? -1 : offset);
+        /* Results are returned with the arg elements still
+         * in place. Lua takes care of only returning
+         * elements above the args for us.
+         * In this case, we have one arg on the stack
+         * for this function, so we insert our first return
+         * value at position 2. */
+        lua_insert(L, 2);
+        cnt += 1; /* increase return count by one to make room for offset */
+    }
+
+    return cnt;
+}
+
+int mp_unpack(lua_State *L) {
+    return mp_unpack_full(L, 0, 0);
+}
+
+int mp_unpack_one(lua_State *L) {
+    int offset = luaL_optinteger(L, 2, 0);
+    /* Variable pop because offset may not exist */
+    lua_pop(L, lua_gettop(L)-1);
+    return mp_unpack_full(L, 1, offset);
+}
+
+int mp_unpack_limit(lua_State *L) {
+    int limit = luaL_checkinteger(L, 2);
+    int offset = luaL_optinteger(L, 3, 0);
+    /* Variable pop because offset may not exist */
+    lua_pop(L, lua_gettop(L)-1);
+
+    return mp_unpack_full(L, limit, offset);
+}
+
+int mp_safe(lua_State *L) {
+    int argc, err, total_results;
+
+    argc = lua_gettop(L);
+
+    /* This adds our function to the bottom of the stack
+     * (the "call this function" position) */
+    lua_pushvalue(L, lua_upvalueindex(1));
+    lua_insert(L, 1);
+
+    err = lua_pcall(L, argc, LUA_MULTRET, 0);
+    total_results = lua_gettop(L);
+
+    if (!err) {
+        return total_results;
+    } else {
+        lua_pushnil(L);
+        lua_insert(L,-2);
+        return 2;
+    }
+}
+
+/* -------------------------------------------------------------------------- */
+const struct luaL_Reg cmds[] = {
+    {"pack", mp_pack},
+    {"unpack", mp_unpack},
+    {"unpack_one", mp_unpack_one},
+    {"unpack_limit", mp_unpack_limit},
+    {0}
+};
+
+int luaopen_create(lua_State *L) {
+    int i;
+    /* Manually construct our module table instead of
+     * relying on _register or _newlib */
+    lua_newtable(L);
+
+    for (i = 0; i < (sizeof(cmds)/sizeof(*cmds) - 1); i++) {
+        lua_pushcfunction(L, cmds[i].func);
+        lua_setfield(L, -2, cmds[i].name);
+    }
+
+    /* Add metadata */
+    lua_pushliteral(L, LUACMSGPACK_NAME);
+    lua_setfield(L, -2, "_NAME");
+    lua_pushliteral(L, LUACMSGPACK_VERSION);
+    lua_setfield(L, -2, "_VERSION");
+    lua_pushliteral(L, LUACMSGPACK_COPYRIGHT);
+    lua_setfield(L, -2, "_COPYRIGHT");
+    lua_pushliteral(L, LUACMSGPACK_DESCRIPTION);
+    lua_setfield(L, -2, "_DESCRIPTION");
+    return 1;
+}
+
+LUALIB_API int luaopen_cmsgpack(lua_State *L) {
+    luaopen_create(L);
+
+#if LUA_VERSION_NUM < 502
+    /* Register name globally for 5.1 */
+    lua_pushvalue(L, -1);
+    lua_setglobal(L, LUACMSGPACK_NAME);
+#endif
+
+    return 1;
+}
+
+LUALIB_API int luaopen_cmsgpack_safe(lua_State *L) {
+    int i;
+
+    luaopen_cmsgpack(L);
+
+    /* Wrap all functions in the safe handler */
+    for (i = 0; i < (sizeof(cmds)/sizeof(*cmds) - 1); i++) {
+        lua_getfield(L, -1, cmds[i].name);
+        lua_pushcclosure(L, mp_safe, 1);
+        lua_setfield(L, -2, cmds[i].name);
+    }
+
+#if LUA_VERSION_NUM < 502
+    /* Register name globally for 5.1 */
+    lua_pushvalue(L, -1);
+    lua_setglobal(L, LUACMSGPACK_SAFE_NAME);
+#endif
+
+    return 1;
+}
+
+/******************************************************************************
+* Copyright (C) 2012 Salvatore Sanfilippo.  All rights reserved.
+*
+* Permission is hereby granted, free of charge, to any person obtaining
+* a copy of this software and associated documentation files (the
+* "Software"), to deal in the Software without restriction, including
+* without limitation the rights to use, copy, modify, merge, publish,
+* distribute, sublicense, and/or sell copies of the Software, and to
+* permit persons to whom the Software is furnished to do so, subject to
+* the following conditions:
+*
+* The above copyright notice and this permission notice shall be
+* included in all copies or substantial portions of the Software.
+*
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+******************************************************************************/
diff --git a/redis-stable/deps/lua/src/lua_struct.c b/redis-stable/deps/lua/src/lua_struct.c
new file mode 100644
index 00000000..c58c8e72
--- /dev/null
+++ b/redis-stable/deps/lua/src/lua_struct.c
@@ -0,0 +1,429 @@
+/*
+** {======================================================
+** Library for packing/unpacking structures.
+** $Id: struct.c,v 1.7 2018/05/11 22:04:31 roberto Exp $
+** See Copyright Notice at the end of this file
+** =======================================================
+*/
+/*
+** Valid formats:
+** > - big endian
+** < - little endian
+** ![num] - alignment
+** x - pading
+** b/B - signed/unsigned byte
+** h/H - signed/unsigned short
+** l/L - signed/unsigned long
+** T   - size_t
+** i/In - signed/unsigned integer with size 'n' (default is size of int)
+** cn - sequence of 'n' chars (from/to a string); when packing, n==0 means
+        the whole string; when unpacking, n==0 means use the previous
+        read number as the string length
+** s - zero-terminated string
+** f - float
+** d - double
+** ' ' - ignored
+*/
+
+
+#include <assert.h>
+#include <ctype.h>
+#include <limits.h>
+#include <stddef.h>
+#include <string.h>
+
+
+#include "lua.h"
+#include "lauxlib.h"
+
+
+#if (LUA_VERSION_NUM >= 502)
+
+#define luaL_register(L,n,f)	luaL_newlib(L,f)
+
+#endif
+
+
+/* basic integer type */
+#if !defined(STRUCT_INT)
+#define STRUCT_INT	long
+#endif
+
+typedef STRUCT_INT Inttype;
+
+/* corresponding unsigned version */
+typedef unsigned STRUCT_INT Uinttype;
+
+
+/* maximum size (in bytes) for integral types */
+#define MAXINTSIZE	32
+
+/* is 'x' a power of 2? */
+#define isp2(x)		((x) > 0 && ((x) & ((x) - 1)) == 0)
+
+/* dummy structure to get alignment requirements */
+struct cD {
+  char c;
+  double d;
+};
+
+
+#define PADDING		(sizeof(struct cD) - sizeof(double))
+#define MAXALIGN  	(PADDING > sizeof(int) ? PADDING : sizeof(int))
+
+
+/* endian options */
+#define BIG	0
+#define LITTLE	1
+
+
+static union {
+  int dummy;
+  char endian;
+} const native = {1};
+
+
+typedef struct Header {
+  int endian;
+  int align;
+} Header;
+
+
+static int getnum (lua_State *L, const char **fmt, int df) {
+  if (!isdigit(**fmt))  /* no number? */
+    return df;  /* return default value */
+  else {
+    int a = 0;
+    do {
+      if (a > (INT_MAX / 10) || a * 10 > (INT_MAX - (**fmt - '0')))
+        luaL_error(L, "integral size overflow");
+      a = a*10 + *((*fmt)++) - '0';
+    } while (isdigit(**fmt));
+    return a;
+  }
+}
+
+
+#define defaultoptions(h)	((h)->endian = native.endian, (h)->align = 1)
+
+
+
+static size_t optsize (lua_State *L, char opt, const char **fmt) {
+  switch (opt) {
+    case 'B': case 'b': return sizeof(char);
+    case 'H': case 'h': return sizeof(short);
+    case 'L': case 'l': return sizeof(long);
+    case 'T': return sizeof(size_t);
+    case 'f':  return sizeof(float);
+    case 'd':  return sizeof(double);
+    case 'x': return 1;
+    case 'c': return getnum(L, fmt, 1);
+    case 'i': case 'I': {
+      int sz = getnum(L, fmt, sizeof(int));
+      if (sz > MAXINTSIZE)
+        luaL_error(L, "integral size %d is larger than limit of %d",
+                       sz, MAXINTSIZE);
+      return sz;
+    }
+    default: return 0;  /* other cases do not need alignment */
+  }
+}
+
+
+/*
+** return number of bytes needed to align an element of size 'size'
+** at current position 'len'
+*/
+static int gettoalign (size_t len, Header *h, int opt, size_t size) {
+  if (size == 0 || opt == 'c') return 0;
+  if (size > (size_t)h->align)
+    size = h->align;  /* respect max. alignment */
+  return (size - (len & (size - 1))) & (size - 1);
+}
+
+
+/*
+** options to control endianess and alignment
+*/
+static void controloptions (lua_State *L, int opt, const char **fmt,
+                            Header *h) {
+  switch (opt) {
+    case  ' ': return;  /* ignore white spaces */
+    case '>': h->endian = BIG; return;
+    case '<': h->endian = LITTLE; return;
+    case '!': {
+      int a = getnum(L, fmt, MAXALIGN);
+      if (!isp2(a))
+        luaL_error(L, "alignment %d is not a power of 2", a);
+      h->align = a;
+      return;
+    }
+    default: {
+      const char *msg = lua_pushfstring(L, "invalid format option '%c'", opt);
+      luaL_argerror(L, 1, msg);
+    }
+  }
+}
+
+
+static void putinteger (lua_State *L, luaL_Buffer *b, int arg, int endian,
+                        int size) {
+  lua_Number n = luaL_checknumber(L, arg);
+  Uinttype value;
+  char buff[MAXINTSIZE];
+  if (n < 0)
+    value = (Uinttype)(Inttype)n;
+  else
+    value = (Uinttype)n;
+  if (endian == LITTLE) {
+    int i;
+    for (i = 0; i < size; i++) {
+      buff[i] = (value & 0xff);
+      value >>= 8;
+    }
+  }
+  else {
+    int i;
+    for (i = size - 1; i >= 0; i--) {
+      buff[i] = (value & 0xff);
+      value >>= 8;
+    }
+  }
+  luaL_addlstring(b, buff, size);
+}
+
+
+static void correctbytes (char *b, int size, int endian) {
+  if (endian != native.endian) {
+    int i = 0;
+    while (i < --size) {
+      char temp = b[i];
+      b[i++] = b[size];
+      b[size] = temp;
+    }
+  }
+}
+
+
+static int b_pack (lua_State *L) {
+  luaL_Buffer b;
+  const char *fmt = luaL_checkstring(L, 1);
+  Header h;
+  int arg = 2;
+  size_t totalsize = 0;
+  defaultoptions(&h);
+  lua_pushnil(L);  /* mark to separate arguments from string buffer */
+  luaL_buffinit(L, &b);
+  while (*fmt != '\0') {
+    int opt = *fmt++;
+    size_t size = optsize(L, opt, &fmt);
+    int toalign = gettoalign(totalsize, &h, opt, size);
+    totalsize += toalign;
+    while (toalign-- > 0) luaL_addchar(&b, '\0');
+    switch (opt) {
+      case 'b': case 'B': case 'h': case 'H':
+      case 'l': case 'L': case 'T': case 'i': case 'I': {  /* integer types */
+        putinteger(L, &b, arg++, h.endian, size);
+        break;
+      }
+      case 'x': {
+        luaL_addchar(&b, '\0');
+        break;
+      }
+      case 'f': {
+        float f = (float)luaL_checknumber(L, arg++);
+        correctbytes((char *)&f, size, h.endian);
+        luaL_addlstring(&b, (char *)&f, size);
+        break;
+      }
+      case 'd': {
+        double d = luaL_checknumber(L, arg++);
+        correctbytes((char *)&d, size, h.endian);
+        luaL_addlstring(&b, (char *)&d, size);
+        break;
+      }
+      case 'c': case 's': {
+        size_t l;
+        const char *s = luaL_checklstring(L, arg++, &l);
+        if (size == 0) size = l;
+        luaL_argcheck(L, l >= (size_t)size, arg, "string too short");
+        luaL_addlstring(&b, s, size);
+        if (opt == 's') {
+          luaL_addchar(&b, '\0');  /* add zero at the end */
+          size++;
+        }
+        break;
+      }
+      default: controloptions(L, opt, &fmt, &h);
+    }
+    totalsize += size;
+  }
+  luaL_pushresult(&b);
+  return 1;
+}
+
+
+static lua_Number getinteger (const char *buff, int endian,
+                        int issigned, int size) {
+  Uinttype l = 0;
+  int i;
+  if (endian == BIG) {
+    for (i = 0; i < size; i++) {
+      l <<= 8;
+      l |= (Uinttype)(unsigned char)buff[i];
+    }
+  }
+  else {
+    for (i = size - 1; i >= 0; i--) {
+      l <<= 8;
+      l |= (Uinttype)(unsigned char)buff[i];
+    }
+  }
+  if (!issigned)
+    return (lua_Number)l;
+  else {  /* signed format */
+    Uinttype mask = (Uinttype)(~((Uinttype)0)) << (size*8 - 1);
+    if (l & mask)  /* negative value? */
+      l |= mask;  /* signal extension */
+    return (lua_Number)(Inttype)l;
+  }
+}
+
+
+static int b_unpack (lua_State *L) {
+  Header h;
+  const char *fmt = luaL_checkstring(L, 1);
+  size_t ld;
+  const char *data = luaL_checklstring(L, 2, &ld);
+  size_t pos = luaL_optinteger(L, 3, 1);
+  luaL_argcheck(L, pos > 0, 3, "offset must be 1 or greater");
+  pos--; /* Lua indexes are 1-based, but here we want 0-based for C
+          * pointer math. */
+  int n = 0;  /* number of results */
+  defaultoptions(&h);
+  while (*fmt) {
+    int opt = *fmt++;
+    size_t size = optsize(L, opt, &fmt);
+    pos += gettoalign(pos, &h, opt, size);
+    luaL_argcheck(L, size <= ld && pos <= ld - size,
+                   2, "data string too short");
+    /* stack space for item + next position */
+    luaL_checkstack(L, 2, "too many results");
+    switch (opt) {
+      case 'b': case 'B': case 'h': case 'H':
+      case 'l': case 'L': case 'T': case 'i':  case 'I': {  /* integer types */
+        int issigned = islower(opt);
+        lua_Number res = getinteger(data+pos, h.endian, issigned, size);
+        lua_pushnumber(L, res); n++;
+        break;
+      }
+      case 'x': {
+        break;
+      }
+      case 'f': {
+        float f;
+        memcpy(&f, data+pos, size);
+        correctbytes((char *)&f, sizeof(f), h.endian);
+        lua_pushnumber(L, f); n++;
+        break;
+      }
+      case 'd': {
+        double d;
+        memcpy(&d, data+pos, size);
+        correctbytes((char *)&d, sizeof(d), h.endian);
+        lua_pushnumber(L, d); n++;
+        break;
+      }
+      case 'c': {
+        if (size == 0) {
+          if (n == 0 || !lua_isnumber(L, -1))
+            luaL_error(L, "format 'c0' needs a previous size");
+          size = lua_tonumber(L, -1);
+          lua_pop(L, 1); n--;
+          luaL_argcheck(L, size <= ld && pos <= ld - size,
+                           2, "data string too short");
+        }
+        lua_pushlstring(L, data+pos, size); n++;
+        break;
+      }
+      case 's': {
+        const char *e = (const char *)memchr(data+pos, '\0', ld - pos);
+        if (e == NULL)
+          luaL_error(L, "unfinished string in data");
+        size = (e - (data+pos)) + 1;
+        lua_pushlstring(L, data+pos, size - 1); n++;
+        break;
+      }
+      default: controloptions(L, opt, &fmt, &h);
+    }
+    pos += size;
+  }
+  lua_pushinteger(L, pos + 1);  /* next position */
+  return n + 1;
+}
+
+
+static int b_size (lua_State *L) {
+  Header h;
+  const char *fmt = luaL_checkstring(L, 1);
+  size_t pos = 0;
+  defaultoptions(&h);
+  while (*fmt) {
+    int opt = *fmt++;
+    size_t size = optsize(L, opt, &fmt);
+    pos += gettoalign(pos, &h, opt, size);
+    if (opt == 's')
+      luaL_argerror(L, 1, "option 's' has no fixed size");
+    else if (opt == 'c' && size == 0)
+      luaL_argerror(L, 1, "option 'c0' has no fixed size");
+    if (!isalnum(opt))
+      controloptions(L, opt, &fmt, &h);
+    pos += size;
+  }
+  lua_pushinteger(L, pos);
+  return 1;
+}
+
+/* }====================================================== */
+
+
+
+static const struct luaL_Reg thislib[] = {
+  {"pack", b_pack},
+  {"unpack", b_unpack},
+  {"size", b_size},
+  {NULL, NULL}
+};
+
+
+LUALIB_API int luaopen_struct (lua_State *L);
+
+LUALIB_API int luaopen_struct (lua_State *L) {
+  luaL_register(L, "struct", thislib);
+  return 1;
+}
+
+
+/******************************************************************************
+* Copyright (C) 2010-2018 Lua.org, PUC-Rio.  All rights reserved.
+*
+* Permission is hereby granted, free of charge, to any person obtaining
+* a copy of this software and associated documentation files (the
+* "Software"), to deal in the Software without restriction, including
+* without limitation the rights to use, copy, modify, merge, publish,
+* distribute, sublicense, and/or sell copies of the Software, and to
+* permit persons to whom the Software is furnished to do so, subject to
+* the following conditions:
+*
+* The above copyright notice and this permission notice shall be
+* included in all copies or substantial portions of the Software.
+*
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+******************************************************************************/
+
diff --git a/redis-stable/deps/lua/src/luac.c b/redis-stable/deps/lua/src/luac.c
new file mode 100644
index 00000000..d0701739
--- /dev/null
+++ b/redis-stable/deps/lua/src/luac.c
@@ -0,0 +1,200 @@
+/*
+** $Id: luac.c,v 1.54 2006/06/02 17:37:11 lhf Exp $
+** Lua compiler (saves bytecodes to files; also list bytecodes)
+** See Copyright Notice in lua.h
+*/
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define luac_c
+#define LUA_CORE
+
+#include "lua.h"
+#include "lauxlib.h"
+
+#include "ldo.h"
+#include "lfunc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstring.h"
+#include "lundump.h"
+
+#define PROGNAME	"luac"		/* default program name */
+#define	OUTPUT		PROGNAME ".out"	/* default output file */
+
+static int listing=0;			/* list bytecodes? */
+static int dumping=1;			/* dump bytecodes? */
+static int stripping=0;			/* strip debug information? */
+static char Output[]={ OUTPUT };	/* default output file name */
+static const char* output=Output;	/* actual output file name */
+static const char* progname=PROGNAME;	/* actual program name */
+
+static void fatal(const char* message)
+{
+ fprintf(stderr,"%s: %s\n",progname,message);
+ exit(EXIT_FAILURE);
+}
+
+static void cannot(const char* what)
+{
+ fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno));
+ exit(EXIT_FAILURE);
+}
+
+static void usage(const char* message)
+{
+ if (*message=='-')
+  fprintf(stderr,"%s: unrecognized option " LUA_QS "\n",progname,message);
+ else
+  fprintf(stderr,"%s: %s\n",progname,message);
+ fprintf(stderr,
+ "usage: %s [options] [filenames].\n"
+ "Available options are:\n"
+ "  -        process stdin\n"
+ "  -l       list\n"
+ "  -o name  output to file " LUA_QL("name") " (default is \"%s\")\n"
+ "  -p       parse only\n"
+ "  -s       strip debug information\n"
+ "  -v       show version information\n"
+ "  --       stop handling options\n",
+ progname,Output);
+ exit(EXIT_FAILURE);
+}
+
+#define	IS(s)	(strcmp(argv[i],s)==0)
+
+static int doargs(int argc, char* argv[])
+{
+ int i;
+ int version=0;
+ if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0];
+ for (i=1; i<argc; i++)
+ {
+  if (*argv[i]!='-')			/* end of options; keep it */
+   break;
+  else if (IS("--"))			/* end of options; skip it */
+  {
+   ++i;
+   if (version) ++version;
+   break;
+  }
+  else if (IS("-"))			/* end of options; use stdin */
+   break;
+  else if (IS("-l"))			/* list */
+   ++listing;
+  else if (IS("-o"))			/* output file */
+  {
+   output=argv[++i];
+   if (output==NULL || *output==0) usage(LUA_QL("-o") " needs argument");
+   if (IS("-")) output=NULL;
+  }
+  else if (IS("-p"))			/* parse only */
+   dumping=0;
+  else if (IS("-s"))			/* strip debug information */
+   stripping=1;
+  else if (IS("-v"))			/* show version */
+   ++version;
+  else					/* unknown option */
+   usage(argv[i]);
+ }
+ if (i==argc && (listing || !dumping))
+ {
+  dumping=0;
+  argv[--i]=Output;
+ }
+ if (version)
+ {
+  printf("%s  %s\n",LUA_RELEASE,LUA_COPYRIGHT);
+  if (version==argc-1) exit(EXIT_SUCCESS);
+ }
+ return i;
+}
+
+#define toproto(L,i) (clvalue(L->top+(i))->l.p)
+
+static const Proto* combine(lua_State* L, int n)
+{
+ if (n==1)
+  return toproto(L,-1);
+ else
+ {
+  int i,pc;
+  Proto* f=luaF_newproto(L);
+  setptvalue2s(L,L->top,f); incr_top(L);
+  f->source=luaS_newliteral(L,"=(" PROGNAME ")");
+  f->maxstacksize=1;
+  pc=2*n+1;
+  f->code=luaM_newvector(L,pc,Instruction);
+  f->sizecode=pc;
+  f->p=luaM_newvector(L,n,Proto*);
+  f->sizep=n;
+  pc=0;
+  for (i=0; i<n; i++)
+  {
+   f->p[i]=toproto(L,i-n-1);
+   f->code[pc++]=CREATE_ABx(OP_CLOSURE,0,i);
+   f->code[pc++]=CREATE_ABC(OP_CALL,0,1,1);
+  }
+  f->code[pc++]=CREATE_ABC(OP_RETURN,0,1,0);
+  return f;
+ }
+}
+
+static int writer(lua_State* L, const void* p, size_t size, void* u)
+{
+ UNUSED(L);
+ return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0);
+}
+
+struct Smain {
+ int argc;
+ char** argv;
+};
+
+static int pmain(lua_State* L)
+{
+ struct Smain* s = (struct Smain*)lua_touserdata(L, 1);
+ int argc=s->argc;
+ char** argv=s->argv;
+ const Proto* f;
+ int i;
+ if (!lua_checkstack(L,argc)) fatal("too many input files");
+ for (i=0; i<argc; i++)
+ {
+  const char* filename=IS("-") ? NULL : argv[i];
+  if (luaL_loadfile(L,filename)!=0) fatal(lua_tostring(L,-1));
+ }
+ f=combine(L,argc);
+ if (listing) luaU_print(f,listing>1);
+ if (dumping)
+ {
+  FILE* D= (output==NULL) ? stdout : fopen(output,"wb");
+  if (D==NULL) cannot("open");
+  lua_lock(L);
+  luaU_dump(L,f,writer,D,stripping);
+  lua_unlock(L);
+  if (ferror(D)) cannot("write");
+  if (fclose(D)) cannot("close");
+ }
+ return 0;
+}
+
+int main(int argc, char* argv[])
+{
+ lua_State* L;
+ struct Smain s;
+ int i=doargs(argc,argv);
+ argc-=i; argv+=i;
+ if (argc<=0) usage("no input files given");
+ L=lua_open();
+ if (L==NULL) fatal("not enough memory for state");
+ s.argc=argc;
+ s.argv=argv;
+ if (lua_cpcall(L,pmain,&s)!=0) fatal(lua_tostring(L,-1));
+ lua_close(L);
+ return EXIT_SUCCESS;
+}
diff --git a/redis-stable/deps/lua/src/luaconf.h b/redis-stable/deps/lua/src/luaconf.h
new file mode 100644
index 00000000..e2cb2616
--- /dev/null
+++ b/redis-stable/deps/lua/src/luaconf.h
@@ -0,0 +1,763 @@
+/*
+** $Id: luaconf.h,v 1.82.1.7 2008/02/11 16:25:08 roberto Exp $
+** Configuration file for Lua
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lconfig_h
+#define lconfig_h
+
+#include <limits.h>
+#include <stddef.h>
+
+
+/*
+** ==================================================================
+** Search for "@@" to find all configurable definitions.
+** ===================================================================
+*/
+
+
+/*
+@@ LUA_ANSI controls the use of non-ansi features.
+** CHANGE it (define it) if you want Lua to avoid the use of any
+** non-ansi feature or library.
+*/
+#if defined(__STRICT_ANSI__)
+#define LUA_ANSI
+#endif
+
+
+#if !defined(LUA_ANSI) && defined(_WIN32)
+#define LUA_WIN
+#endif
+
+#if defined(LUA_USE_LINUX)
+#define LUA_USE_POSIX
+#define LUA_USE_DLOPEN		/* needs an extra library: -ldl */
+#define LUA_USE_READLINE	/* needs some extra libraries */
+#endif
+
+#if defined(LUA_USE_MACOSX)
+#define LUA_USE_POSIX
+#define LUA_DL_DYLD		/* does not need extra library */
+#endif
+
+
+
+/*
+@@ LUA_USE_POSIX includes all functionallity listed as X/Open System
+@* Interfaces Extension (XSI).
+** CHANGE it (define it) if your system is XSI compatible.
+*/
+#if defined(LUA_USE_POSIX)
+#define LUA_USE_MKSTEMP
+#define LUA_USE_ISATTY
+#define LUA_USE_POPEN
+#define LUA_USE_ULONGJMP
+#endif
+
+
+/*
+@@ LUA_PATH and LUA_CPATH are the names of the environment variables that
+@* Lua check to set its paths.
+@@ LUA_INIT is the name of the environment variable that Lua
+@* checks for initialization code.
+** CHANGE them if you want different names.
+*/
+#define LUA_PATH        "LUA_PATH"
+#define LUA_CPATH       "LUA_CPATH"
+#define LUA_INIT	"LUA_INIT"
+
+
+/*
+@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for
+@* Lua libraries.
+@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for
+@* C libraries.
+** CHANGE them if your machine has a non-conventional directory
+** hierarchy or if you want to install your libraries in
+** non-conventional directories.
+*/
+#if defined(_WIN32)
+/*
+** In Windows, any exclamation mark ('!') in the path is replaced by the
+** path of the directory of the executable file of the current process.
+*/
+#define LUA_LDIR	"!\\lua\\"
+#define LUA_CDIR	"!\\"
+#define LUA_PATH_DEFAULT  \
+		".\\?.lua;"  LUA_LDIR"?.lua;"  LUA_LDIR"?\\init.lua;" \
+		             LUA_CDIR"?.lua;"  LUA_CDIR"?\\init.lua"
+#define LUA_CPATH_DEFAULT \
+	".\\?.dll;"  LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll"
+
+#else
+#define LUA_ROOT	"/usr/local/"
+#define LUA_LDIR	LUA_ROOT "share/lua/5.1/"
+#define LUA_CDIR	LUA_ROOT "lib/lua/5.1/"
+#define LUA_PATH_DEFAULT  \
+		"./?.lua;"  LUA_LDIR"?.lua;"  LUA_LDIR"?/init.lua;" \
+		            LUA_CDIR"?.lua;"  LUA_CDIR"?/init.lua"
+#define LUA_CPATH_DEFAULT \
+	"./?.so;"  LUA_CDIR"?.so;" LUA_CDIR"loadall.so"
+#endif
+
+
+/*
+@@ LUA_DIRSEP is the directory separator (for submodules).
+** CHANGE it if your machine does not use "/" as the directory separator
+** and is not Windows. (On Windows Lua automatically uses "\".)
+*/
+#if defined(_WIN32)
+#define LUA_DIRSEP	"\\"
+#else
+#define LUA_DIRSEP	"/"
+#endif
+
+
+/*
+@@ LUA_PATHSEP is the character that separates templates in a path.
+@@ LUA_PATH_MARK is the string that marks the substitution points in a
+@* template.
+@@ LUA_EXECDIR in a Windows path is replaced by the executable's
+@* directory.
+@@ LUA_IGMARK is a mark to ignore all before it when bulding the
+@* luaopen_ function name.
+** CHANGE them if for some reason your system cannot use those
+** characters. (E.g., if one of those characters is a common character
+** in file/directory names.) Probably you do not need to change them.
+*/
+#define LUA_PATHSEP	";"
+#define LUA_PATH_MARK	"?"
+#define LUA_EXECDIR	"!"
+#define LUA_IGMARK	"-"
+
+
+/*
+@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger.
+** CHANGE that if ptrdiff_t is not adequate on your machine. (On most
+** machines, ptrdiff_t gives a good choice between int or long.)
+*/
+#define LUA_INTEGER	ptrdiff_t
+
+
+/*
+@@ LUA_API is a mark for all core API functions.
+@@ LUALIB_API is a mark for all standard library functions.
+** CHANGE them if you need to define those functions in some special way.
+** For instance, if you want to create one Windows DLL with the core and
+** the libraries, you may want to use the following definition (define
+** LUA_BUILD_AS_DLL to get it).
+*/
+#if defined(LUA_BUILD_AS_DLL)
+
+#if defined(LUA_CORE) || defined(LUA_LIB)
+#define LUA_API __declspec(dllexport)
+#else
+#define LUA_API __declspec(dllimport)
+#endif
+
+#else
+
+#define LUA_API		extern
+
+#endif
+
+/* more often than not the libs go together with the core */
+#define LUALIB_API	LUA_API
+
+
+/*
+@@ LUAI_FUNC is a mark for all extern functions that are not to be
+@* exported to outside modules.
+@@ LUAI_DATA is a mark for all extern (const) variables that are not to
+@* be exported to outside modules.
+** CHANGE them if you need to mark them in some special way. Elf/gcc
+** (versions 3.2 and later) mark them as "hidden" to optimize access
+** when Lua is compiled as a shared library.
+*/
+#if defined(luaall_c)
+#define LUAI_FUNC	static
+#define LUAI_DATA	/* empty */
+
+#elif defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \
+      defined(__ELF__)
+#define LUAI_FUNC	__attribute__((visibility("hidden"))) extern
+#define LUAI_DATA	LUAI_FUNC
+
+#else
+#define LUAI_FUNC	extern
+#define LUAI_DATA	extern
+#endif
+
+
+
+/*
+@@ LUA_QL describes how error messages quote program elements.
+** CHANGE it if you want a different appearance.
+*/
+#define LUA_QL(x)	"'" x "'"
+#define LUA_QS		LUA_QL("%s")
+
+
+/*
+@@ LUA_IDSIZE gives the maximum size for the description of the source
+@* of a function in debug information.
+** CHANGE it if you want a different size.
+*/
+#define LUA_IDSIZE	60
+
+
+/*
+** {==================================================================
+** Stand-alone configuration
+** ===================================================================
+*/
+
+#if defined(lua_c) || defined(luaall_c)
+
+/*
+@@ lua_stdin_is_tty detects whether the standard input is a 'tty' (that
+@* is, whether we're running lua interactively).
+** CHANGE it if you have a better definition for non-POSIX/non-Windows
+** systems.
+*/
+#if defined(LUA_USE_ISATTY)
+#include <unistd.h>
+#define lua_stdin_is_tty()	isatty(0)
+#elif defined(LUA_WIN)
+#include <io.h>
+#include <stdio.h>
+#define lua_stdin_is_tty()	_isatty(_fileno(stdin))
+#else
+#define lua_stdin_is_tty()	1  /* assume stdin is a tty */
+#endif
+
+
+/*
+@@ LUA_PROMPT is the default prompt used by stand-alone Lua.
+@@ LUA_PROMPT2 is the default continuation prompt used by stand-alone Lua.
+** CHANGE them if you want different prompts. (You can also change the
+** prompts dynamically, assigning to globals _PROMPT/_PROMPT2.)
+*/
+#define LUA_PROMPT		"> "
+#define LUA_PROMPT2		">> "
+
+
+/*
+@@ LUA_PROGNAME is the default name for the stand-alone Lua program.
+** CHANGE it if your stand-alone interpreter has a different name and
+** your system is not able to detect that name automatically.
+*/
+#define LUA_PROGNAME		"lua"
+
+
+/*
+@@ LUA_MAXINPUT is the maximum length for an input line in the
+@* stand-alone interpreter.
+** CHANGE it if you need longer lines.
+*/
+#define LUA_MAXINPUT	512
+
+
+/*
+@@ lua_readline defines how to show a prompt and then read a line from
+@* the standard input.
+@@ lua_saveline defines how to "save" a read line in a "history".
+@@ lua_freeline defines how to free a line read by lua_readline.
+** CHANGE them if you want to improve this functionality (e.g., by using
+** GNU readline and history facilities).
+*/
+#if defined(LUA_USE_READLINE)
+#include <stdio.h>
+#include <readline/readline.h>
+#include <readline/history.h>
+#define lua_readline(L,b,p)	((void)L, ((b)=readline(p)) != NULL)
+#define lua_saveline(L,idx) \
+	if (lua_strlen(L,idx) > 0)  /* non-empty line? */ \
+	  add_history(lua_tostring(L, idx));  /* add it to history */
+#define lua_freeline(L,b)	((void)L, free(b))
+#else
+#define lua_readline(L,b,p)	\
+	((void)L, fputs(p, stdout), fflush(stdout),  /* show prompt */ \
+	fgets(b, LUA_MAXINPUT, stdin) != NULL)  /* get line */
+#define lua_saveline(L,idx)	{ (void)L; (void)idx; }
+#define lua_freeline(L,b)	{ (void)L; (void)b; }
+#endif
+
+#endif
+
+/* }================================================================== */
+
+
+/*
+@@ LUAI_GCPAUSE defines the default pause between garbage-collector cycles
+@* as a percentage.
+** CHANGE it if you want the GC to run faster or slower (higher values
+** mean larger pauses which mean slower collection.) You can also change
+** this value dynamically.
+*/
+#define LUAI_GCPAUSE	200  /* 200% (wait memory to double before next GC) */
+
+
+/*
+@@ LUAI_GCMUL defines the default speed of garbage collection relative to
+@* memory allocation as a percentage.
+** CHANGE it if you want to change the granularity of the garbage
+** collection. (Higher values mean coarser collections. 0 represents
+** infinity, where each step performs a full collection.) You can also
+** change this value dynamically.
+*/
+#define LUAI_GCMUL	200 /* GC runs 'twice the speed' of memory allocation */
+
+
+
+/*
+@@ LUA_COMPAT_GETN controls compatibility with old getn behavior.
+** CHANGE it (define it) if you want exact compatibility with the
+** behavior of setn/getn in Lua 5.0.
+*/
+#undef LUA_COMPAT_GETN
+
+/*
+@@ LUA_COMPAT_LOADLIB controls compatibility about global loadlib.
+** CHANGE it to undefined as soon as you do not need a global 'loadlib'
+** function (the function is still available as 'package.loadlib').
+*/
+#undef LUA_COMPAT_LOADLIB
+
+/*
+@@ LUA_COMPAT_VARARG controls compatibility with old vararg feature.
+** CHANGE it to undefined as soon as your programs use only '...' to
+** access vararg parameters (instead of the old 'arg' table).
+*/
+#define LUA_COMPAT_VARARG
+
+/*
+@@ LUA_COMPAT_MOD controls compatibility with old math.mod function.
+** CHANGE it to undefined as soon as your programs use 'math.fmod' or
+** the new '%' operator instead of 'math.mod'.
+*/
+#define LUA_COMPAT_MOD
+
+/*
+@@ LUA_COMPAT_LSTR controls compatibility with old long string nesting
+@* facility.
+** CHANGE it to 2 if you want the old behaviour, or undefine it to turn
+** off the advisory error when nesting [[...]].
+*/
+#define LUA_COMPAT_LSTR		1
+
+/*
+@@ LUA_COMPAT_GFIND controls compatibility with old 'string.gfind' name.
+** CHANGE it to undefined as soon as you rename 'string.gfind' to
+** 'string.gmatch'.
+*/
+#define LUA_COMPAT_GFIND
+
+/*
+@@ LUA_COMPAT_OPENLIB controls compatibility with old 'luaL_openlib'
+@* behavior.
+** CHANGE it to undefined as soon as you replace to 'luaL_register'
+** your uses of 'luaL_openlib'
+*/
+#define LUA_COMPAT_OPENLIB
+
+
+
+/*
+@@ luai_apicheck is the assert macro used by the Lua-C API.
+** CHANGE luai_apicheck if you want Lua to perform some checks in the
+** parameters it gets from API calls. This may slow down the interpreter
+** a bit, but may be quite useful when debugging C code that interfaces
+** with Lua. A useful redefinition is to use assert.h.
+*/
+#if defined(LUA_USE_APICHECK)
+#include <assert.h>
+#define luai_apicheck(L,o)	{ (void)L; assert(o); }
+#else
+#define luai_apicheck(L,o)	{ (void)L; }
+#endif
+
+
+/*
+@@ LUAI_BITSINT defines the number of bits in an int.
+** CHANGE here if Lua cannot automatically detect the number of bits of
+** your machine. Probably you do not need to change this.
+*/
+/* avoid overflows in comparison */
+#if INT_MAX-20 < 32760
+#define LUAI_BITSINT	16
+#elif INT_MAX > 2147483640L
+/* int has at least 32 bits */
+#define LUAI_BITSINT	32
+#else
+#error "you must define LUA_BITSINT with number of bits in an integer"
+#endif
+
+
+/*
+@@ LUAI_UINT32 is an unsigned integer with at least 32 bits.
+@@ LUAI_INT32 is an signed integer with at least 32 bits.
+@@ LUAI_UMEM is an unsigned integer big enough to count the total
+@* memory used by Lua.
+@@ LUAI_MEM is a signed integer big enough to count the total memory
+@* used by Lua.
+** CHANGE here if for some weird reason the default definitions are not
+** good enough for your machine. (The definitions in the 'else'
+** part always works, but may waste space on machines with 64-bit
+** longs.) Probably you do not need to change this.
+*/
+#if LUAI_BITSINT >= 32
+#define LUAI_UINT32	unsigned int
+#define LUAI_INT32	int
+#define LUAI_MAXINT32	INT_MAX
+#define LUAI_UMEM	size_t
+#define LUAI_MEM	ptrdiff_t
+#else
+/* 16-bit ints */
+#define LUAI_UINT32	unsigned long
+#define LUAI_INT32	long
+#define LUAI_MAXINT32	LONG_MAX
+#define LUAI_UMEM	unsigned long
+#define LUAI_MEM	long
+#endif
+
+
+/*
+@@ LUAI_MAXCALLS limits the number of nested calls.
+** CHANGE it if you need really deep recursive calls. This limit is
+** arbitrary; its only purpose is to stop infinite recursion before
+** exhausting memory.
+*/
+#define LUAI_MAXCALLS	20000
+
+
+/*
+@@ LUAI_MAXCSTACK limits the number of Lua stack slots that a C function
+@* can use.
+** CHANGE it if you need lots of (Lua) stack space for your C
+** functions. This limit is arbitrary; its only purpose is to stop C
+** functions to consume unlimited stack space. (must be smaller than
+** -LUA_REGISTRYINDEX)
+*/
+#define LUAI_MAXCSTACK	8000
+
+
+
+/*
+** {==================================================================
+** CHANGE (to smaller values) the following definitions if your system
+** has a small C stack. (Or you may want to change them to larger
+** values if your system has a large C stack and these limits are
+** too rigid for you.) Some of these constants control the size of
+** stack-allocated arrays used by the compiler or the interpreter, while
+** others limit the maximum number of recursive calls that the compiler
+** or the interpreter can perform. Values too large may cause a C stack
+** overflow for some forms of deep constructs.
+** ===================================================================
+*/
+
+
+/*
+@@ LUAI_MAXCCALLS is the maximum depth for nested C calls (short) and
+@* syntactical nested non-terminals in a program.
+*/
+#define LUAI_MAXCCALLS		200
+
+
+/*
+@@ LUAI_MAXVARS is the maximum number of local variables per function
+@* (must be smaller than 250).
+*/
+#define LUAI_MAXVARS		200
+
+
+/*
+@@ LUAI_MAXUPVALUES is the maximum number of upvalues per function
+@* (must be smaller than 250).
+*/
+#define LUAI_MAXUPVALUES	60
+
+
+/*
+@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system.
+*/
+#define LUAL_BUFFERSIZE		BUFSIZ
+
+/* }================================================================== */
+
+
+
+
+/*
+** {==================================================================
+@@ LUA_NUMBER is the type of numbers in Lua.
+** CHANGE the following definitions only if you want to build Lua
+** with a number type different from double. You may also need to
+** change lua_number2int & lua_number2integer.
+** ===================================================================
+*/
+
+#define LUA_NUMBER_DOUBLE
+#define LUA_NUMBER	double
+
+/*
+@@ LUAI_UACNUMBER is the result of an 'usual argument conversion'
+@* over a number.
+*/
+#define LUAI_UACNUMBER	double
+
+
+/*
+@@ LUA_NUMBER_SCAN is the format for reading numbers.
+@@ LUA_NUMBER_FMT is the format for writing numbers.
+@@ lua_number2str converts a number to a string.
+@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion.
+@@ lua_str2number converts a string to a number.
+*/
+#define LUA_NUMBER_SCAN		"%lf"
+#define LUA_NUMBER_FMT		"%.14g"
+#define lua_number2str(s,n)	sprintf((s), LUA_NUMBER_FMT, (n))
+#define LUAI_MAXNUMBER2STR	32 /* 16 digits, sign, point, and \0 */
+#define lua_str2number(s,p)	strtod((s), (p))
+
+
+/*
+@@ The luai_num* macros define the primitive operations over numbers.
+*/
+#if defined(LUA_CORE)
+#include <math.h>
+#define luai_numadd(a,b)	((a)+(b))
+#define luai_numsub(a,b)	((a)-(b))
+#define luai_nummul(a,b)	((a)*(b))
+#define luai_numdiv(a,b)	((a)/(b))
+#define luai_nummod(a,b)	((a) - floor((a)/(b))*(b))
+#define luai_numpow(a,b)	(pow(a,b))
+#define luai_numunm(a)		(-(a))
+#define luai_numeq(a,b)		((a)==(b))
+#define luai_numlt(a,b)		((a)<(b))
+#define luai_numle(a,b)		((a)<=(b))
+#define luai_numisnan(a)	(!luai_numeq((a), (a)))
+#endif
+
+
+/*
+@@ lua_number2int is a macro to convert lua_Number to int.
+@@ lua_number2integer is a macro to convert lua_Number to lua_Integer.
+** CHANGE them if you know a faster way to convert a lua_Number to
+** int (with any rounding method and without throwing errors) in your
+** system. In Pentium machines, a naive typecast from double to int
+** in C is extremely slow, so any alternative is worth trying.
+*/
+
+/* On a Pentium, resort to a trick */
+#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) && !defined(__SSE2__) && \
+    (defined(__i386) || defined (_M_IX86) || defined(__i386__))
+
+/* On a Microsoft compiler, use assembler */
+#if defined(_MSC_VER)
+
+#define lua_number2int(i,d)   __asm fld d   __asm fistp i
+#define lua_number2integer(i,n)		lua_number2int(i, n)
+
+/* the next trick should work on any Pentium, but sometimes clashes
+   with a DirectX idiosyncrasy */
+#else
+
+union luai_Cast { double l_d; long l_l; };
+#define lua_number2int(i,d) \
+  { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; }
+#define lua_number2integer(i,n)		lua_number2int(i, n)
+
+#endif
+
+
+/* this option always works, but may be slow */
+#else
+#define lua_number2int(i,d)	((i)=(int)(d))
+#define lua_number2integer(i,d)	((i)=(lua_Integer)(d))
+
+#endif
+
+/* }================================================================== */
+
+
+/*
+@@ LUAI_USER_ALIGNMENT_T is a type that requires maximum alignment.
+** CHANGE it if your system requires alignments larger than double. (For
+** instance, if your system supports long doubles and they must be
+** aligned in 16-byte boundaries, then you should add long double in the
+** union.) Probably you do not need to change this.
+*/
+#define LUAI_USER_ALIGNMENT_T	union { double u; void *s; long l; }
+
+
+/*
+@@ LUAI_THROW/LUAI_TRY define how Lua does exception handling.
+** CHANGE them if you prefer to use longjmp/setjmp even with C++
+** or if want/don't to use _longjmp/_setjmp instead of regular
+** longjmp/setjmp. By default, Lua handles errors with exceptions when
+** compiling as C++ code, with _longjmp/_setjmp when asked to use them,
+** and with longjmp/setjmp otherwise.
+*/
+#if defined(__cplusplus)
+/* C++ exceptions */
+#define LUAI_THROW(L,c)	throw(c)
+#define LUAI_TRY(L,c,a)	try { a } catch(...) \
+	{ if ((c)->status == 0) (c)->status = -1; }
+#define luai_jmpbuf	int  /* dummy variable */
+
+#elif defined(LUA_USE_ULONGJMP)
+/* in Unix, try _longjmp/_setjmp (more efficient) */
+#define LUAI_THROW(L,c)	_longjmp((c)->b, 1)
+#define LUAI_TRY(L,c,a)	if (_setjmp((c)->b) == 0) { a }
+#define luai_jmpbuf	jmp_buf
+
+#else
+/* default handling with long jumps */
+#define LUAI_THROW(L,c)	longjmp((c)->b, 1)
+#define LUAI_TRY(L,c,a)	if (setjmp((c)->b) == 0) { a }
+#define luai_jmpbuf	jmp_buf
+
+#endif
+
+
+/*
+@@ LUA_MAXCAPTURES is the maximum number of captures that a pattern
+@* can do during pattern-matching.
+** CHANGE it if you need more captures. This limit is arbitrary.
+*/
+#define LUA_MAXCAPTURES		32
+
+
+/*
+@@ lua_tmpnam is the function that the OS library uses to create a
+@* temporary name.
+@@ LUA_TMPNAMBUFSIZE is the maximum size of a name created by lua_tmpnam.
+** CHANGE them if you have an alternative to tmpnam (which is considered
+** insecure) or if you want the original tmpnam anyway.  By default, Lua
+** uses tmpnam except when POSIX is available, where it uses mkstemp.
+*/
+#if defined(loslib_c) || defined(luaall_c)
+
+#if defined(LUA_USE_MKSTEMP)
+#include <unistd.h>
+#define LUA_TMPNAMBUFSIZE	32
+#define lua_tmpnam(b,e)	{ \
+	strcpy(b, "/tmp/lua_XXXXXX"); \
+	e = mkstemp(b); \
+	if (e != -1) close(e); \
+	e = (e == -1); }
+
+#else
+#define LUA_TMPNAMBUFSIZE	L_tmpnam
+#define lua_tmpnam(b,e)		{ e = (tmpnam(b) == NULL); }
+#endif
+
+#endif
+
+
+/*
+@@ lua_popen spawns a new process connected to the current one through
+@* the file streams.
+** CHANGE it if you have a way to implement it in your system.
+*/
+#if defined(LUA_USE_POPEN)
+
+#define lua_popen(L,c,m)	((void)L, fflush(NULL), popen(c,m))
+#define lua_pclose(L,file)	((void)L, (pclose(file) != -1))
+
+#elif defined(LUA_WIN)
+
+#define lua_popen(L,c,m)	((void)L, _popen(c,m))
+#define lua_pclose(L,file)	((void)L, (_pclose(file) != -1))
+
+#else
+
+#define lua_popen(L,c,m)	((void)((void)c, m),  \
+		luaL_error(L, LUA_QL("popen") " not supported"), (FILE*)0)
+#define lua_pclose(L,file)		((void)((void)L, file), 0)
+
+#endif
+
+/*
+@@ LUA_DL_* define which dynamic-library system Lua should use.
+** CHANGE here if Lua has problems choosing the appropriate
+** dynamic-library system for your platform (either Windows' DLL, Mac's
+** dyld, or Unix's dlopen). If your system is some kind of Unix, there
+** is a good chance that it has dlopen, so LUA_DL_DLOPEN will work for
+** it.  To use dlopen you also need to adapt the src/Makefile (probably
+** adding -ldl to the linker options), so Lua does not select it
+** automatically.  (When you change the makefile to add -ldl, you must
+** also add -DLUA_USE_DLOPEN.)
+** If you do not want any kind of dynamic library, undefine all these
+** options.
+** By default, _WIN32 gets LUA_DL_DLL and MAC OS X gets LUA_DL_DYLD.
+*/
+#if defined(LUA_USE_DLOPEN)
+#define LUA_DL_DLOPEN
+#endif
+
+#if defined(LUA_WIN)
+#define LUA_DL_DLL
+#endif
+
+
+/*
+@@ LUAI_EXTRASPACE allows you to add user-specific data in a lua_State
+@* (the data goes just *before* the lua_State pointer).
+** CHANGE (define) this if you really need that. This value must be
+** a multiple of the maximum alignment required for your machine.
+*/
+#define LUAI_EXTRASPACE		0
+
+
+/*
+@@ luai_userstate* allow user-specific actions on threads.
+** CHANGE them if you defined LUAI_EXTRASPACE and need to do something
+** extra when a thread is created/deleted/resumed/yielded.
+*/
+#define luai_userstateopen(L)		((void)L)
+#define luai_userstateclose(L)		((void)L)
+#define luai_userstatethread(L,L1)	((void)L)
+#define luai_userstatefree(L)		((void)L)
+#define luai_userstateresume(L,n)	((void)L)
+#define luai_userstateyield(L,n)	((void)L)
+
+
+/*
+@@ LUA_INTFRMLEN is the length modifier for integer conversions
+@* in 'string.format'.
+@@ LUA_INTFRM_T is the integer type correspoding to the previous length
+@* modifier.
+** CHANGE them if your system supports long long or does not support long.
+*/
+
+#if defined(LUA_USELONGLONG)
+
+#define LUA_INTFRMLEN		"ll"
+#define LUA_INTFRM_T		long long
+
+#else
+
+#define LUA_INTFRMLEN		"l"
+#define LUA_INTFRM_T		long
+
+#endif
+
+
+
+/* =================================================================== */
+
+/*
+** Local configuration. You can use this space to add your redefinitions
+** without modifying the main part of the file.
+*/
+
+
+
+#endif
+
diff --git a/redis-stable/deps/lua/src/lualib.h b/redis-stable/deps/lua/src/lualib.h
new file mode 100644
index 00000000..469417f6
--- /dev/null
+++ b/redis-stable/deps/lua/src/lualib.h
@@ -0,0 +1,53 @@
+/*
+** $Id: lualib.h,v 1.36.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lua standard libraries
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lualib_h
+#define lualib_h
+
+#include "lua.h"
+
+
+/* Key to file-handle type */
+#define LUA_FILEHANDLE		"FILE*"
+
+
+#define LUA_COLIBNAME	"coroutine"
+LUALIB_API int (luaopen_base) (lua_State *L);
+
+#define LUA_TABLIBNAME	"table"
+LUALIB_API int (luaopen_table) (lua_State *L);
+
+#define LUA_IOLIBNAME	"io"
+LUALIB_API int (luaopen_io) (lua_State *L);
+
+#define LUA_OSLIBNAME	"os"
+LUALIB_API int (luaopen_os) (lua_State *L);
+
+#define LUA_STRLIBNAME	"string"
+LUALIB_API int (luaopen_string) (lua_State *L);
+
+#define LUA_MATHLIBNAME	"math"
+LUALIB_API int (luaopen_math) (lua_State *L);
+
+#define LUA_DBLIBNAME	"debug"
+LUALIB_API int (luaopen_debug) (lua_State *L);
+
+#define LUA_LOADLIBNAME	"package"
+LUALIB_API int (luaopen_package) (lua_State *L);
+
+
+/* open all previous libraries */
+LUALIB_API void (luaL_openlibs) (lua_State *L); 
+
+
+
+#ifndef lua_assert
+#define lua_assert(x)	((void)0)
+#endif
+
+
+#endif
diff --git a/redis-stable/deps/lua/src/lundump.c b/redis-stable/deps/lua/src/lundump.c
new file mode 100644
index 00000000..8010a457
--- /dev/null
+++ b/redis-stable/deps/lua/src/lundump.c
@@ -0,0 +1,227 @@
+/*
+** $Id: lundump.c,v 2.7.1.4 2008/04/04 19:51:41 roberto Exp $
+** load precompiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#include <string.h>
+
+#define lundump_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lmem.h"
+#include "lobject.h"
+#include "lstring.h"
+#include "lundump.h"
+#include "lzio.h"
+
+typedef struct {
+ lua_State* L;
+ ZIO* Z;
+ Mbuffer* b;
+ const char* name;
+} LoadState;
+
+#ifdef LUAC_TRUST_BINARIES
+#define IF(c,s)
+#define error(S,s)
+#else
+#define IF(c,s)		if (c) error(S,s)
+
+static void error(LoadState* S, const char* why)
+{
+ luaO_pushfstring(S->L,"%s: %s in precompiled chunk",S->name,why);
+ luaD_throw(S->L,LUA_ERRSYNTAX);
+}
+#endif
+
+#define LoadMem(S,b,n,size)	LoadBlock(S,b,(n)*(size))
+#define	LoadByte(S)		(lu_byte)LoadChar(S)
+#define LoadVar(S,x)		LoadMem(S,&x,1,sizeof(x))
+#define LoadVector(S,b,n,size)	LoadMem(S,b,n,size)
+
+static void LoadBlock(LoadState* S, void* b, size_t size)
+{
+ size_t r=luaZ_read(S->Z,b,size);
+ IF (r!=0, "unexpected end");
+}
+
+static int LoadChar(LoadState* S)
+{
+ char x;
+ LoadVar(S,x);
+ return x;
+}
+
+static int LoadInt(LoadState* S)
+{
+ int x;
+ LoadVar(S,x);
+ IF (x<0, "bad integer");
+ return x;
+}
+
+static lua_Number LoadNumber(LoadState* S)
+{
+ lua_Number x;
+ LoadVar(S,x);
+ return x;
+}
+
+static TString* LoadString(LoadState* S)
+{
+ size_t size;
+ LoadVar(S,size);
+ if (size==0)
+  return NULL;
+ else
+ {
+  char* s=luaZ_openspace(S->L,S->b,size);
+  LoadBlock(S,s,size);
+  return luaS_newlstr(S->L,s,size-1);		/* remove trailing '\0' */
+ }
+}
+
+static void LoadCode(LoadState* S, Proto* f)
+{
+ int n=LoadInt(S);
+ f->code=luaM_newvector(S->L,n,Instruction);
+ f->sizecode=n;
+ LoadVector(S,f->code,n,sizeof(Instruction));
+}
+
+static Proto* LoadFunction(LoadState* S, TString* p);
+
+static void LoadConstants(LoadState* S, Proto* f)
+{
+ int i,n;
+ n=LoadInt(S);
+ f->k=luaM_newvector(S->L,n,TValue);
+ f->sizek=n;
+ for (i=0; i<n; i++) setnilvalue(&f->k[i]);
+ for (i=0; i<n; i++)
+ {
+  TValue* o=&f->k[i];
+  int t=LoadChar(S);
+  switch (t)
+  {
+   case LUA_TNIL:
+   	setnilvalue(o);
+	break;
+   case LUA_TBOOLEAN:
+   	setbvalue(o,LoadChar(S)!=0);
+	break;
+   case LUA_TNUMBER:
+	setnvalue(o,LoadNumber(S));
+	break;
+   case LUA_TSTRING:
+	setsvalue2n(S->L,o,LoadString(S));
+	break;
+   default:
+	error(S,"bad constant");
+	break;
+  }
+ }
+ n=LoadInt(S);
+ f->p=luaM_newvector(S->L,n,Proto*);
+ f->sizep=n;
+ for (i=0; i<n; i++) f->p[i]=NULL;
+ for (i=0; i<n; i++) f->p[i]=LoadFunction(S,f->source);
+}
+
+static void LoadDebug(LoadState* S, Proto* f)
+{
+ int i,n;
+ n=LoadInt(S);
+ f->lineinfo=luaM_newvector(S->L,n,int);
+ f->sizelineinfo=n;
+ LoadVector(S,f->lineinfo,n,sizeof(int));
+ n=LoadInt(S);
+ f->locvars=luaM_newvector(S->L,n,LocVar);
+ f->sizelocvars=n;
+ for (i=0; i<n; i++) f->locvars[i].varname=NULL;
+ for (i=0; i<n; i++)
+ {
+  f->locvars[i].varname=LoadString(S);
+  f->locvars[i].startpc=LoadInt(S);
+  f->locvars[i].endpc=LoadInt(S);
+ }
+ n=LoadInt(S);
+ f->upvalues=luaM_newvector(S->L,n,TString*);
+ f->sizeupvalues=n;
+ for (i=0; i<n; i++) f->upvalues[i]=NULL;
+ for (i=0; i<n; i++) f->upvalues[i]=LoadString(S);
+}
+
+static Proto* LoadFunction(LoadState* S, TString* p)
+{
+ Proto* f;
+ if (++S->L->nCcalls > LUAI_MAXCCALLS) error(S,"code too deep");
+ f=luaF_newproto(S->L);
+ setptvalue2s(S->L,S->L->top,f); incr_top(S->L);
+ f->source=LoadString(S); if (f->source==NULL) f->source=p;
+ f->linedefined=LoadInt(S);
+ f->lastlinedefined=LoadInt(S);
+ f->nups=LoadByte(S);
+ f->numparams=LoadByte(S);
+ f->is_vararg=LoadByte(S);
+ f->maxstacksize=LoadByte(S);
+ LoadCode(S,f);
+ LoadConstants(S,f);
+ LoadDebug(S,f);
+ IF (!luaG_checkcode(f), "bad code");
+ S->L->top--;
+ S->L->nCcalls--;
+ return f;
+}
+
+static void LoadHeader(LoadState* S)
+{
+ char h[LUAC_HEADERSIZE];
+ char s[LUAC_HEADERSIZE];
+ luaU_header(h);
+ LoadBlock(S,s,LUAC_HEADERSIZE);
+ IF (memcmp(h,s,LUAC_HEADERSIZE)!=0, "bad header");
+}
+
+/*
+** load precompiled chunk
+*/
+Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name)
+{
+ LoadState S;
+ if (*name=='@' || *name=='=')
+  S.name=name+1;
+ else if (*name==LUA_SIGNATURE[0])
+  S.name="binary string";
+ else
+  S.name=name;
+ S.L=L;
+ S.Z=Z;
+ S.b=buff;
+ LoadHeader(&S);
+ return LoadFunction(&S,luaS_newliteral(L,"=?"));
+}
+
+/*
+* make header
+*/
+void luaU_header (char* h)
+{
+ int x=1;
+ memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-1);
+ h+=sizeof(LUA_SIGNATURE)-1;
+ *h++=(char)LUAC_VERSION;
+ *h++=(char)LUAC_FORMAT;
+ *h++=(char)*(char*)&x;				/* endianness */
+ *h++=(char)sizeof(int);
+ *h++=(char)sizeof(size_t);
+ *h++=(char)sizeof(Instruction);
+ *h++=(char)sizeof(lua_Number);
+ *h++=(char)(((lua_Number)0.5)==0);		/* is lua_Number integral? */
+}
diff --git a/redis-stable/deps/lua/src/lundump.h b/redis-stable/deps/lua/src/lundump.h
new file mode 100644
index 00000000..c80189db
--- /dev/null
+++ b/redis-stable/deps/lua/src/lundump.h
@@ -0,0 +1,36 @@
+/*
+** $Id: lundump.h,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
+** load precompiled Lua chunks
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lundump_h
+#define lundump_h
+
+#include "lobject.h"
+#include "lzio.h"
+
+/* load one chunk; from lundump.c */
+LUAI_FUNC Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name);
+
+/* make header; from lundump.c */
+LUAI_FUNC void luaU_header (char* h);
+
+/* dump one chunk; from ldump.c */
+LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip);
+
+#ifdef luac_c
+/* print one chunk; from print.c */
+LUAI_FUNC void luaU_print (const Proto* f, int full);
+#endif
+
+/* for header of binary files -- this is Lua 5.1 */
+#define LUAC_VERSION		0x51
+
+/* for header of binary files -- this is the official format */
+#define LUAC_FORMAT		0
+
+/* size of header of binary files */
+#define LUAC_HEADERSIZE		12
+
+#endif
diff --git a/redis-stable/deps/lua/src/lvm.c b/redis-stable/deps/lua/src/lvm.c
new file mode 100644
index 00000000..e0a0cd85
--- /dev/null
+++ b/redis-stable/deps/lua/src/lvm.c
@@ -0,0 +1,767 @@
+/*
+** $Id: lvm.c,v 2.63.1.5 2011/08/17 20:43:11 roberto Exp $
+** Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define lvm_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "ldebug.h"
+#include "ldo.h"
+#include "lfunc.h"
+#include "lgc.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lstate.h"
+#include "lstring.h"
+#include "ltable.h"
+#include "ltm.h"
+#include "lvm.h"
+
+
+
+/* limit for table tag-method chains (to avoid loops) */
+#define MAXTAGLOOP	100
+
+
+const TValue *luaV_tonumber (const TValue *obj, TValue *n) {
+  lua_Number num;
+  if (ttisnumber(obj)) return obj;
+  if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {
+    setnvalue(n, num);
+    return n;
+  }
+  else
+    return NULL;
+}
+
+
+int luaV_tostring (lua_State *L, StkId obj) {
+  if (!ttisnumber(obj))
+    return 0;
+  else {
+    char s[LUAI_MAXNUMBER2STR];
+    lua_Number n = nvalue(obj);
+    lua_number2str(s, n);
+    setsvalue2s(L, obj, luaS_new(L, s));
+    return 1;
+  }
+}
+
+
+static void traceexec (lua_State *L, const Instruction *pc) {
+  lu_byte mask = L->hookmask;
+  const Instruction *oldpc = L->savedpc;
+  L->savedpc = pc;
+  if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
+    resethookcount(L);
+    luaD_callhook(L, LUA_HOOKCOUNT, -1);
+  }
+  if (mask & LUA_MASKLINE) {
+    Proto *p = ci_func(L->ci)->l.p;
+    int npc = pcRel(pc, p);
+    int newline = getline(p, npc);
+    /* call linehook when enter a new function, when jump back (loop),
+       or when enter a new line */
+    if (npc == 0 || pc <= oldpc || newline != getline(p, pcRel(oldpc, p)))
+      luaD_callhook(L, LUA_HOOKLINE, newline);
+  }
+}
+
+
+static void callTMres (lua_State *L, StkId res, const TValue *f,
+                        const TValue *p1, const TValue *p2) {
+  ptrdiff_t result = savestack(L, res);
+  setobj2s(L, L->top, f);  /* push function */
+  setobj2s(L, L->top+1, p1);  /* 1st argument */
+  setobj2s(L, L->top+2, p2);  /* 2nd argument */
+  luaD_checkstack(L, 3);
+  L->top += 3;
+  luaD_call(L, L->top - 3, 1);
+  res = restorestack(L, result);
+  L->top--;
+  setobjs2s(L, res, L->top);
+}
+
+
+
+static void callTM (lua_State *L, const TValue *f, const TValue *p1,
+                    const TValue *p2, const TValue *p3) {
+  setobj2s(L, L->top, f);  /* push function */
+  setobj2s(L, L->top+1, p1);  /* 1st argument */
+  setobj2s(L, L->top+2, p2);  /* 2nd argument */
+  setobj2s(L, L->top+3, p3);  /* 3th argument */
+  luaD_checkstack(L, 4);
+  L->top += 4;
+  luaD_call(L, L->top - 4, 0);
+}
+
+
+void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
+  int loop;
+  for (loop = 0; loop < MAXTAGLOOP; loop++) {
+    const TValue *tm;
+    if (ttistable(t)) {  /* `t' is a table? */
+      Table *h = hvalue(t);
+      const TValue *res = luaH_get(h, key); /* do a primitive get */
+      if (!ttisnil(res) ||  /* result is no nil? */
+          (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
+        setobj2s(L, val, res);
+        return;
+      }
+      /* else will try the tag method */
+    }
+    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
+      luaG_typeerror(L, t, "index");
+    if (ttisfunction(tm)) {
+      callTMres(L, val, tm, t, key);
+      return;
+    }
+    t = tm;  /* else repeat with `tm' */ 
+  }
+  luaG_runerror(L, "loop in gettable");
+}
+
+
+void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
+  int loop;
+  TValue temp;
+  for (loop = 0; loop < MAXTAGLOOP; loop++) {
+    const TValue *tm;
+    if (ttistable(t)) {  /* `t' is a table? */
+      Table *h = hvalue(t);
+      TValue *oldval = luaH_set(L, h, key); /* do a primitive set */
+      if (!ttisnil(oldval) ||  /* result is no nil? */
+          (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */
+        setobj2t(L, oldval, val);
+        h->flags = 0;
+        luaC_barriert(L, h, val);
+        return;
+      }
+      /* else will try the tag method */
+    }
+    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
+      luaG_typeerror(L, t, "index");
+    if (ttisfunction(tm)) {
+      callTM(L, tm, t, key, val);
+      return;
+    }
+    /* else repeat with `tm' */
+    setobj(L, &temp, tm);  /* avoid pointing inside table (may rehash) */
+    t = &temp;
+  }
+  luaG_runerror(L, "loop in settable");
+}
+
+
+static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
+                       StkId res, TMS event) {
+  const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */
+  if (ttisnil(tm))
+    tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */
+  if (ttisnil(tm)) return 0;
+  callTMres(L, res, tm, p1, p2);
+  return 1;
+}
+
+
+static const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2,
+                                  TMS event) {
+  const TValue *tm1 = fasttm(L, mt1, event);
+  const TValue *tm2;
+  if (tm1 == NULL) return NULL;  /* no metamethod */
+  if (mt1 == mt2) return tm1;  /* same metatables => same metamethods */
+  tm2 = fasttm(L, mt2, event);
+  if (tm2 == NULL) return NULL;  /* no metamethod */
+  if (luaO_rawequalObj(tm1, tm2))  /* same metamethods? */
+    return tm1;
+  return NULL;
+}
+
+
+static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,
+                         TMS event) {
+  const TValue *tm1 = luaT_gettmbyobj(L, p1, event);
+  const TValue *tm2;
+  if (ttisnil(tm1)) return -1;  /* no metamethod? */
+  tm2 = luaT_gettmbyobj(L, p2, event);
+  if (!luaO_rawequalObj(tm1, tm2))  /* different metamethods? */
+    return -1;
+  callTMres(L, L->top, tm1, p1, p2);
+  return !l_isfalse(L->top);
+}
+
+
+static int l_strcmp (const TString *ls, const TString *rs) {
+  const char *l = getstr(ls);
+  size_t ll = ls->tsv.len;
+  const char *r = getstr(rs);
+  size_t lr = rs->tsv.len;
+  for (;;) {
+    int temp = strcoll(l, r);
+    if (temp != 0) return temp;
+    else {  /* strings are equal up to a `\0' */
+      size_t len = strlen(l);  /* index of first `\0' in both strings */
+      if (len == lr)  /* r is finished? */
+        return (len == ll) ? 0 : 1;
+      else if (len == ll)  /* l is finished? */
+        return -1;  /* l is smaller than r (because r is not finished) */
+      /* both strings longer than `len'; go on comparing (after the `\0') */
+      len++;
+      l += len; ll -= len; r += len; lr -= len;
+    }
+  }
+}
+
+
+int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {
+  int res;
+  if (ttype(l) != ttype(r))
+    return luaG_ordererror(L, l, r);
+  else if (ttisnumber(l))
+    return luai_numlt(nvalue(l), nvalue(r));
+  else if (ttisstring(l))
+    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
+  else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
+    return res;
+  return luaG_ordererror(L, l, r);
+}
+
+
+static int lessequal (lua_State *L, const TValue *l, const TValue *r) {
+  int res;
+  if (ttype(l) != ttype(r))
+    return luaG_ordererror(L, l, r);
+  else if (ttisnumber(l))
+    return luai_numle(nvalue(l), nvalue(r));
+  else if (ttisstring(l))
+    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;
+  else if ((res = call_orderTM(L, l, r, TM_LE)) != -1)  /* first try `le' */
+    return res;
+  else if ((res = call_orderTM(L, r, l, TM_LT)) != -1)  /* else try `lt' */
+    return !res;
+  return luaG_ordererror(L, l, r);
+}
+
+
+int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2) {
+  const TValue *tm;
+  lua_assert(ttype(t1) == ttype(t2));
+  switch (ttype(t1)) {
+    case LUA_TNIL: return 1;
+    case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));
+    case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2);  /* true must be 1 !! */
+    case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
+    case LUA_TUSERDATA: {
+      if (uvalue(t1) == uvalue(t2)) return 1;
+      tm = get_compTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable,
+                         TM_EQ);
+      break;  /* will try TM */
+    }
+    case LUA_TTABLE: {
+      if (hvalue(t1) == hvalue(t2)) return 1;
+      tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
+      break;  /* will try TM */
+    }
+    default: return gcvalue(t1) == gcvalue(t2);
+  }
+  if (tm == NULL) return 0;  /* no TM? */
+  callTMres(L, L->top, tm, t1, t2);  /* call TM */
+  return !l_isfalse(L->top);
+}
+
+
+void luaV_concat (lua_State *L, int total, int last) {
+  do {
+    StkId top = L->base + last + 1;
+    int n = 2;  /* number of elements handled in this pass (at least 2) */
+    if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
+      if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
+        luaG_concaterror(L, top-2, top-1);
+    } else if (tsvalue(top-1)->len == 0)  /* second op is empty? */
+      (void)tostring(L, top - 2);  /* result is first op (as string) */
+    else {
+      /* at least two string values; get as many as possible */
+      size_t tl = tsvalue(top-1)->len;
+      char *buffer;
+      int i;
+      /* collect total length */
+      for (n = 1; n < total && tostring(L, top-n-1); n++) {
+        size_t l = tsvalue(top-n-1)->len;
+        if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
+        tl += l;
+      }
+      buffer = luaZ_openspace(L, &G(L)->buff, tl);
+      tl = 0;
+      for (i=n; i>0; i--) {  /* concat all strings */
+        size_t l = tsvalue(top-i)->len;
+        memcpy(buffer+tl, svalue(top-i), l);
+        tl += l;
+      }
+      setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
+    }
+    total -= n-1;  /* got `n' strings to create 1 new */
+    last -= n-1;
+  } while (total > 1);  /* repeat until only 1 result left */
+}
+
+
+static void Arith (lua_State *L, StkId ra, const TValue *rb,
+                   const TValue *rc, TMS op) {
+  TValue tempb, tempc;
+  const TValue *b, *c;
+  if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
+      (c = luaV_tonumber(rc, &tempc)) != NULL) {
+    lua_Number nb = nvalue(b), nc = nvalue(c);
+    switch (op) {
+      case TM_ADD: setnvalue(ra, luai_numadd(nb, nc)); break;
+      case TM_SUB: setnvalue(ra, luai_numsub(nb, nc)); break;
+      case TM_MUL: setnvalue(ra, luai_nummul(nb, nc)); break;
+      case TM_DIV: setnvalue(ra, luai_numdiv(nb, nc)); break;
+      case TM_MOD: setnvalue(ra, luai_nummod(nb, nc)); break;
+      case TM_POW: setnvalue(ra, luai_numpow(nb, nc)); break;
+      case TM_UNM: setnvalue(ra, luai_numunm(nb)); break;
+      default: lua_assert(0); break;
+    }
+  }
+  else if (!call_binTM(L, rb, rc, ra, op))
+    luaG_aritherror(L, rb, rc);
+}
+
+
+
+/*
+** some macros for common tasks in `luaV_execute'
+*/
+
+#define runtime_check(L, c)	{ if (!(c)) break; }
+
+#define RA(i)	(base+GETARG_A(i))
+/* to be used after possible stack reallocation */
+#define RB(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
+#define RC(i)	check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
+#define RKB(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
+	ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
+#define RKC(i)	check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
+	ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
+#define KBx(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgK, k+GETARG_Bx(i))
+
+
+#define dojump(L,pc,i)	{(pc) += (i); luai_threadyield(L);}
+
+
+#define Protect(x)	{ L->savedpc = pc; {x;}; base = L->base; }
+
+
+#define arith_op(op,tm) { \
+        TValue *rb = RKB(i); \
+        TValue *rc = RKC(i); \
+        if (ttisnumber(rb) && ttisnumber(rc)) { \
+          lua_Number nb = nvalue(rb), nc = nvalue(rc); \
+          setnvalue(ra, op(nb, nc)); \
+        } \
+        else \
+          Protect(Arith(L, ra, rb, rc, tm)); \
+      }
+
+
+
+void luaV_execute (lua_State *L, int nexeccalls) {
+  LClosure *cl;
+  StkId base;
+  TValue *k;
+  const Instruction *pc;
+ reentry:  /* entry point */
+  lua_assert(isLua(L->ci));
+  pc = L->savedpc;
+  cl = &clvalue(L->ci->func)->l;
+  base = L->base;
+  k = cl->p->k;
+  /* main loop of interpreter */
+  for (;;) {
+    const Instruction i = *pc++;
+    StkId ra;
+    if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
+        (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
+      traceexec(L, pc);
+      if (L->status == LUA_YIELD) {  /* did hook yield? */
+        L->savedpc = pc - 1;
+        return;
+      }
+      base = L->base;
+    }
+    /* warning!! several calls may realloc the stack and invalidate `ra' */
+    ra = RA(i);
+    lua_assert(base == L->base && L->base == L->ci->base);
+    lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
+    lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
+    switch (GET_OPCODE(i)) {
+      case OP_MOVE: {
+        setobjs2s(L, ra, RB(i));
+        continue;
+      }
+      case OP_LOADK: {
+        setobj2s(L, ra, KBx(i));
+        continue;
+      }
+      case OP_LOADBOOL: {
+        setbvalue(ra, GETARG_B(i));
+        if (GETARG_C(i)) pc++;  /* skip next instruction (if C) */
+        continue;
+      }
+      case OP_LOADNIL: {
+        TValue *rb = RB(i);
+        do {
+          setnilvalue(rb--);
+        } while (rb >= ra);
+        continue;
+      }
+      case OP_GETUPVAL: {
+        int b = GETARG_B(i);
+        setobj2s(L, ra, cl->upvals[b]->v);
+        continue;
+      }
+      case OP_GETGLOBAL: {
+        TValue g;
+        TValue *rb = KBx(i);
+        sethvalue(L, &g, cl->env);
+        lua_assert(ttisstring(rb));
+        Protect(luaV_gettable(L, &g, rb, ra));
+        continue;
+      }
+      case OP_GETTABLE: {
+        Protect(luaV_gettable(L, RB(i), RKC(i), ra));
+        continue;
+      }
+      case OP_SETGLOBAL: {
+        TValue g;
+        sethvalue(L, &g, cl->env);
+        lua_assert(ttisstring(KBx(i)));
+        Protect(luaV_settable(L, &g, KBx(i), ra));
+        continue;
+      }
+      case OP_SETUPVAL: {
+        UpVal *uv = cl->upvals[GETARG_B(i)];
+        setobj(L, uv->v, ra);
+        luaC_barrier(L, uv, ra);
+        continue;
+      }
+      case OP_SETTABLE: {
+        Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
+        continue;
+      }
+      case OP_NEWTABLE: {
+        int b = GETARG_B(i);
+        int c = GETARG_C(i);
+        sethvalue(L, ra, luaH_new(L, luaO_fb2int(b), luaO_fb2int(c)));
+        Protect(luaC_checkGC(L));
+        continue;
+      }
+      case OP_SELF: {
+        StkId rb = RB(i);
+        setobjs2s(L, ra+1, rb);
+        Protect(luaV_gettable(L, rb, RKC(i), ra));
+        continue;
+      }
+      case OP_ADD: {
+        arith_op(luai_numadd, TM_ADD);
+        continue;
+      }
+      case OP_SUB: {
+        arith_op(luai_numsub, TM_SUB);
+        continue;
+      }
+      case OP_MUL: {
+        arith_op(luai_nummul, TM_MUL);
+        continue;
+      }
+      case OP_DIV: {
+        arith_op(luai_numdiv, TM_DIV);
+        continue;
+      }
+      case OP_MOD: {
+        arith_op(luai_nummod, TM_MOD);
+        continue;
+      }
+      case OP_POW: {
+        arith_op(luai_numpow, TM_POW);
+        continue;
+      }
+      case OP_UNM: {
+        TValue *rb = RB(i);
+        if (ttisnumber(rb)) {
+          lua_Number nb = nvalue(rb);
+          setnvalue(ra, luai_numunm(nb));
+        }
+        else {
+          Protect(Arith(L, ra, rb, rb, TM_UNM));
+        }
+        continue;
+      }
+      case OP_NOT: {
+        int res = l_isfalse(RB(i));  /* next assignment may change this value */
+        setbvalue(ra, res);
+        continue;
+      }
+      case OP_LEN: {
+        const TValue *rb = RB(i);
+        switch (ttype(rb)) {
+          case LUA_TTABLE: {
+            setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));
+            break;
+          }
+          case LUA_TSTRING: {
+            setnvalue(ra, cast_num(tsvalue(rb)->len));
+            break;
+          }
+          default: {  /* try metamethod */
+            Protect(
+              if (!call_binTM(L, rb, luaO_nilobject, ra, TM_LEN))
+                luaG_typeerror(L, rb, "get length of");
+            )
+          }
+        }
+        continue;
+      }
+      case OP_CONCAT: {
+        int b = GETARG_B(i);
+        int c = GETARG_C(i);
+        Protect(luaV_concat(L, c-b+1, c); luaC_checkGC(L));
+        setobjs2s(L, RA(i), base+b);
+        continue;
+      }
+      case OP_JMP: {
+        dojump(L, pc, GETARG_sBx(i));
+        continue;
+      }
+      case OP_EQ: {
+        TValue *rb = RKB(i);
+        TValue *rc = RKC(i);
+        Protect(
+          if (equalobj(L, rb, rc) == GETARG_A(i))
+            dojump(L, pc, GETARG_sBx(*pc));
+        )
+        pc++;
+        continue;
+      }
+      case OP_LT: {
+        Protect(
+          if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
+            dojump(L, pc, GETARG_sBx(*pc));
+        )
+        pc++;
+        continue;
+      }
+      case OP_LE: {
+        Protect(
+          if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
+            dojump(L, pc, GETARG_sBx(*pc));
+        )
+        pc++;
+        continue;
+      }
+      case OP_TEST: {
+        if (l_isfalse(ra) != GETARG_C(i))
+          dojump(L, pc, GETARG_sBx(*pc));
+        pc++;
+        continue;
+      }
+      case OP_TESTSET: {
+        TValue *rb = RB(i);
+        if (l_isfalse(rb) != GETARG_C(i)) {
+          setobjs2s(L, ra, rb);
+          dojump(L, pc, GETARG_sBx(*pc));
+        }
+        pc++;
+        continue;
+      }
+      case OP_CALL: {
+        int b = GETARG_B(i);
+        int nresults = GETARG_C(i) - 1;
+        if (b != 0) L->top = ra+b;  /* else previous instruction set top */
+        L->savedpc = pc;
+        switch (luaD_precall(L, ra, nresults)) {
+          case PCRLUA: {
+            nexeccalls++;
+            goto reentry;  /* restart luaV_execute over new Lua function */
+          }
+          case PCRC: {
+            /* it was a C function (`precall' called it); adjust results */
+            if (nresults >= 0) L->top = L->ci->top;
+            base = L->base;
+            continue;
+          }
+          default: {
+            return;  /* yield */
+          }
+        }
+      }
+      case OP_TAILCALL: {
+        int b = GETARG_B(i);
+        if (b != 0) L->top = ra+b;  /* else previous instruction set top */
+        L->savedpc = pc;
+        lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
+        switch (luaD_precall(L, ra, LUA_MULTRET)) {
+          case PCRLUA: {
+            /* tail call: put new frame in place of previous one */
+            CallInfo *ci = L->ci - 1;  /* previous frame */
+            int aux;
+            StkId func = ci->func;
+            StkId pfunc = (ci+1)->func;  /* previous function index */
+            if (L->openupval) luaF_close(L, ci->base);
+            L->base = ci->base = ci->func + ((ci+1)->base - pfunc);
+            for (aux = 0; pfunc+aux < L->top; aux++)  /* move frame down */
+              setobjs2s(L, func+aux, pfunc+aux);
+            ci->top = L->top = func+aux;  /* correct top */
+            lua_assert(L->top == L->base + clvalue(func)->l.p->maxstacksize);
+            ci->savedpc = L->savedpc;
+            ci->tailcalls++;  /* one more call lost */
+            L->ci--;  /* remove new frame */
+            goto reentry;
+          }
+          case PCRC: {  /* it was a C function (`precall' called it) */
+            base = L->base;
+            continue;
+          }
+          default: {
+            return;  /* yield */
+          }
+        }
+      }
+      case OP_RETURN: {
+        int b = GETARG_B(i);
+        if (b != 0) L->top = ra+b-1;
+        if (L->openupval) luaF_close(L, base);
+        L->savedpc = pc;
+        b = luaD_poscall(L, ra);
+        if (--nexeccalls == 0)  /* was previous function running `here'? */
+          return;  /* no: return */
+        else {  /* yes: continue its execution */
+          if (b) L->top = L->ci->top;
+          lua_assert(isLua(L->ci));
+          lua_assert(GET_OPCODE(*((L->ci)->savedpc - 1)) == OP_CALL);
+          goto reentry;
+        }
+      }
+      case OP_FORLOOP: {
+        lua_Number step = nvalue(ra+2);
+        lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */
+        lua_Number limit = nvalue(ra+1);
+        if (luai_numlt(0, step) ? luai_numle(idx, limit)
+                                : luai_numle(limit, idx)) {
+          dojump(L, pc, GETARG_sBx(i));  /* jump back */
+          setnvalue(ra, idx);  /* update internal index... */
+          setnvalue(ra+3, idx);  /* ...and external index */
+        }
+        continue;
+      }
+      case OP_FORPREP: {
+        const TValue *init = ra;
+        const TValue *plimit = ra+1;
+        const TValue *pstep = ra+2;
+        L->savedpc = pc;  /* next steps may throw errors */
+        if (!tonumber(init, ra))
+          luaG_runerror(L, LUA_QL("for") " initial value must be a number");
+        else if (!tonumber(plimit, ra+1))
+          luaG_runerror(L, LUA_QL("for") " limit must be a number");
+        else if (!tonumber(pstep, ra+2))
+          luaG_runerror(L, LUA_QL("for") " step must be a number");
+        setnvalue(ra, luai_numsub(nvalue(ra), nvalue(pstep)));
+        dojump(L, pc, GETARG_sBx(i));
+        continue;
+      }
+      case OP_TFORLOOP: {
+        StkId cb = ra + 3;  /* call base */
+        setobjs2s(L, cb+2, ra+2);
+        setobjs2s(L, cb+1, ra+1);
+        setobjs2s(L, cb, ra);
+        L->top = cb+3;  /* func. + 2 args (state and index) */
+        Protect(luaD_call(L, cb, GETARG_C(i)));
+        L->top = L->ci->top;
+        cb = RA(i) + 3;  /* previous call may change the stack */
+        if (!ttisnil(cb)) {  /* continue loop? */
+          setobjs2s(L, cb-1, cb);  /* save control variable */
+          dojump(L, pc, GETARG_sBx(*pc));  /* jump back */
+        }
+        pc++;
+        continue;
+      }
+      case OP_SETLIST: {
+        int n = GETARG_B(i);
+        int c = GETARG_C(i);
+        int last;
+        Table *h;
+        if (n == 0) {
+          n = cast_int(L->top - ra) - 1;
+          L->top = L->ci->top;
+        }
+        if (c == 0) c = cast_int(*pc++);
+        runtime_check(L, ttistable(ra));
+        h = hvalue(ra);
+        last = ((c-1)*LFIELDS_PER_FLUSH) + n;
+        if (last > h->sizearray)  /* needs more space? */
+          luaH_resizearray(L, h, last);  /* pre-alloc it at once */
+        for (; n > 0; n--) {
+          TValue *val = ra+n;
+          setobj2t(L, luaH_setnum(L, h, last--), val);
+          luaC_barriert(L, h, val);
+        }
+        continue;
+      }
+      case OP_CLOSE: {
+        luaF_close(L, ra);
+        continue;
+      }
+      case OP_CLOSURE: {
+        Proto *p;
+        Closure *ncl;
+        int nup, j;
+        p = cl->p->p[GETARG_Bx(i)];
+        nup = p->nups;
+        ncl = luaF_newLclosure(L, nup, cl->env);
+        ncl->l.p = p;
+        for (j=0; j<nup; j++, pc++) {
+          if (GET_OPCODE(*pc) == OP_GETUPVAL)
+            ncl->l.upvals[j] = cl->upvals[GETARG_B(*pc)];
+          else {
+            lua_assert(GET_OPCODE(*pc) == OP_MOVE);
+            ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc));
+          }
+        }
+        setclvalue(L, ra, ncl);
+        Protect(luaC_checkGC(L));
+        continue;
+      }
+      case OP_VARARG: {
+        int b = GETARG_B(i) - 1;
+        int j;
+        CallInfo *ci = L->ci;
+        int n = cast_int(ci->base - ci->func) - cl->p->numparams - 1;
+        if (b == LUA_MULTRET) {
+          Protect(luaD_checkstack(L, n));
+          ra = RA(i);  /* previous call may change the stack */
+          b = n;
+          L->top = ra + n;
+        }
+        for (j = 0; j < b; j++) {
+          if (j < n) {
+            setobjs2s(L, ra + j, ci->base - n + j);
+          }
+          else {
+            setnilvalue(ra + j);
+          }
+        }
+        continue;
+      }
+    }
+  }
+}
+
diff --git a/redis-stable/deps/lua/src/lvm.h b/redis-stable/deps/lua/src/lvm.h
new file mode 100644
index 00000000..bfe4f567
--- /dev/null
+++ b/redis-stable/deps/lua/src/lvm.h
@@ -0,0 +1,36 @@
+/*
+** $Id: lvm.h,v 2.5.1.1 2007/12/27 13:02:25 roberto Exp $
+** Lua virtual machine
+** See Copyright Notice in lua.h
+*/
+
+#ifndef lvm_h
+#define lvm_h
+
+
+#include "ldo.h"
+#include "lobject.h"
+#include "ltm.h"
+
+
+#define tostring(L,o) ((ttype(o) == LUA_TSTRING) || (luaV_tostring(L, o)))
+
+#define tonumber(o,n)	(ttype(o) == LUA_TNUMBER || \
+                         (((o) = luaV_tonumber(o,n)) != NULL))
+
+#define equalobj(L,o1,o2) \
+	(ttype(o1) == ttype(o2) && luaV_equalval(L, o1, o2))
+
+
+LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r);
+LUAI_FUNC int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2);
+LUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n);
+LUAI_FUNC int luaV_tostring (lua_State *L, StkId obj);
+LUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key,
+                                            StkId val);
+LUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key,
+                                            StkId val);
+LUAI_FUNC void luaV_execute (lua_State *L, int nexeccalls);
+LUAI_FUNC void luaV_concat (lua_State *L, int total, int last);
+
+#endif
diff --git a/redis-stable/deps/lua/src/lzio.c b/redis-stable/deps/lua/src/lzio.c
new file mode 100644
index 00000000..293edd59
--- /dev/null
+++ b/redis-stable/deps/lua/src/lzio.c
@@ -0,0 +1,82 @@
+/*
+** $Id: lzio.c,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
+** a generic input stream interface
+** See Copyright Notice in lua.h
+*/
+
+
+#include <string.h>
+
+#define lzio_c
+#define LUA_CORE
+
+#include "lua.h"
+
+#include "llimits.h"
+#include "lmem.h"
+#include "lstate.h"
+#include "lzio.h"
+
+
+int luaZ_fill (ZIO *z) {
+  size_t size;
+  lua_State *L = z->L;
+  const char *buff;
+  lua_unlock(L);
+  buff = z->reader(L, z->data, &size);
+  lua_lock(L);
+  if (buff == NULL || size == 0) return EOZ;
+  z->n = size - 1;
+  z->p = buff;
+  return char2int(*(z->p++));
+}
+
+
+int luaZ_lookahead (ZIO *z) {
+  if (z->n == 0) {
+    if (luaZ_fill(z) == EOZ)
+      return EOZ;
+    else {
+      z->n++;  /* luaZ_fill removed first byte; put back it */
+      z->p--;
+    }
+  }
+  return char2int(*z->p);
+}
+
+
+void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {
+  z->L = L;
+  z->reader = reader;
+  z->data = data;
+  z->n = 0;
+  z->p = NULL;
+}
+
+
+/* --------------------------------------------------------------- read --- */
+size_t luaZ_read (ZIO *z, void *b, size_t n) {
+  while (n) {
+    size_t m;
+    if (luaZ_lookahead(z) == EOZ)
+      return n;  /* return number of missing bytes */
+    m = (n <= z->n) ? n : z->n;  /* min. between n and z->n */
+    memcpy(b, z->p, m);
+    z->n -= m;
+    z->p += m;
+    b = (char *)b + m;
+    n -= m;
+  }
+  return 0;
+}
+
+/* ------------------------------------------------------------------------ */
+char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
+  if (n > buff->buffsize) {
+    if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
+    luaZ_resizebuffer(L, buff, n);
+  }
+  return buff->buffer;
+}
+
+
diff --git a/redis-stable/deps/lua/src/lzio.h b/redis-stable/deps/lua/src/lzio.h
new file mode 100644
index 00000000..51d695d8
--- /dev/null
+++ b/redis-stable/deps/lua/src/lzio.h
@@ -0,0 +1,67 @@
+/*
+** $Id: lzio.h,v 1.21.1.1 2007/12/27 13:02:25 roberto Exp $
+** Buffered streams
+** See Copyright Notice in lua.h
+*/
+
+
+#ifndef lzio_h
+#define lzio_h
+
+#include "lua.h"
+
+#include "lmem.h"
+
+
+#define EOZ	(-1)			/* end of stream */
+
+typedef struct Zio ZIO;
+
+#define char2int(c)	cast(int, cast(unsigned char, (c)))
+
+#define zgetc(z)  (((z)->n--)>0 ?  char2int(*(z)->p++) : luaZ_fill(z))
+
+typedef struct Mbuffer {
+  char *buffer;
+  size_t n;
+  size_t buffsize;
+} Mbuffer;
+
+#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0)
+
+#define luaZ_buffer(buff)	((buff)->buffer)
+#define luaZ_sizebuffer(buff)	((buff)->buffsize)
+#define luaZ_bufflen(buff)	((buff)->n)
+
+#define luaZ_resetbuffer(buff) ((buff)->n = 0)
+
+
+#define luaZ_resizebuffer(L, buff, size) \
+	(luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \
+	(buff)->buffsize = size)
+
+#define luaZ_freebuffer(L, buff)	luaZ_resizebuffer(L, buff, 0)
+
+
+LUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n);
+LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader,
+                                        void *data);
+LUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n);	/* read next n bytes */
+LUAI_FUNC int luaZ_lookahead (ZIO *z);
+
+
+
+/* --------- Private Part ------------------ */
+
+struct Zio {
+  size_t n;			/* bytes still unread */
+  const char *p;		/* current position in buffer */
+  lua_Reader reader;
+  void* data;			/* additional data */
+  lua_State *L;			/* Lua state (for reader) */
+};
+
+
+LUAI_FUNC int luaZ_fill (ZIO *z);
+
+#endif
diff --git a/redis-stable/deps/lua/src/print.c b/redis-stable/deps/lua/src/print.c
new file mode 100644
index 00000000..e240cfc3
--- /dev/null
+++ b/redis-stable/deps/lua/src/print.c
@@ -0,0 +1,227 @@
+/*
+** $Id: print.c,v 1.55a 2006/05/31 13:30:05 lhf Exp $
+** print bytecodes
+** See Copyright Notice in lua.h
+*/
+
+#include <ctype.h>
+#include <stdio.h>
+
+#define luac_c
+#define LUA_CORE
+
+#include "ldebug.h"
+#include "lobject.h"
+#include "lopcodes.h"
+#include "lundump.h"
+
+#define PrintFunction	luaU_print
+
+#define Sizeof(x)	((int)sizeof(x))
+#define VOID(p)		((const void*)(p))
+
+static void PrintString(const TString* ts)
+{
+ const char* s=getstr(ts);
+ size_t i,n=ts->tsv.len;
+ putchar('"');
+ for (i=0; i<n; i++)
+ {
+  int c=s[i];
+  switch (c)
+  {
+   case '"': printf("\\\""); break;
+   case '\\': printf("\\\\"); break;
+   case '\a': printf("\\a"); break;
+   case '\b': printf("\\b"); break;
+   case '\f': printf("\\f"); break;
+   case '\n': printf("\\n"); break;
+   case '\r': printf("\\r"); break;
+   case '\t': printf("\\t"); break;
+   case '\v': printf("\\v"); break;
+   default:	if (isprint((unsigned char)c))
+   			putchar(c);
+		else
+			printf("\\%03u",(unsigned char)c);
+  }
+ }
+ putchar('"');
+}
+
+static void PrintConstant(const Proto* f, int i)
+{
+ const TValue* o=&f->k[i];
+ switch (ttype(o))
+ {
+  case LUA_TNIL:
+	printf("nil");
+	break;
+  case LUA_TBOOLEAN:
+	printf(bvalue(o) ? "true" : "false");
+	break;
+  case LUA_TNUMBER:
+	printf(LUA_NUMBER_FMT,nvalue(o));
+	break;
+  case LUA_TSTRING:
+	PrintString(rawtsvalue(o));
+	break;
+  default:				/* cannot happen */
+	printf("? type=%d",ttype(o));
+	break;
+ }
+}
+
+static void PrintCode(const Proto* f)
+{
+ const Instruction* code=f->code;
+ int pc,n=f->sizecode;
+ for (pc=0; pc<n; pc++)
+ {
+  Instruction i=code[pc];
+  OpCode o=GET_OPCODE(i);
+  int a=GETARG_A(i);
+  int b=GETARG_B(i);
+  int c=GETARG_C(i);
+  int bx=GETARG_Bx(i);
+  int sbx=GETARG_sBx(i);
+  int line=getline(f,pc);
+  printf("\t%d\t",pc+1);
+  if (line>0) printf("[%d]\t",line); else printf("[-]\t");
+  printf("%-9s\t",luaP_opnames[o]);
+  switch (getOpMode(o))
+  {
+   case iABC:
+    printf("%d",a);
+    if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (-1-INDEXK(b)) : b);
+    if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (-1-INDEXK(c)) : c);
+    break;
+   case iABx:
+    if (getBMode(o)==OpArgK) printf("%d %d",a,-1-bx); else printf("%d %d",a,bx);
+    break;
+   case iAsBx:
+    if (o==OP_JMP) printf("%d",sbx); else printf("%d %d",a,sbx);
+    break;
+  }
+  switch (o)
+  {
+   case OP_LOADK:
+    printf("\t; "); PrintConstant(f,bx);
+    break;
+   case OP_GETUPVAL:
+   case OP_SETUPVAL:
+    printf("\t; %s", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : "-");
+    break;
+   case OP_GETGLOBAL:
+   case OP_SETGLOBAL:
+    printf("\t; %s",svalue(&f->k[bx]));
+    break;
+   case OP_GETTABLE:
+   case OP_SELF:
+    if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); }
+    break;
+   case OP_SETTABLE:
+   case OP_ADD:
+   case OP_SUB:
+   case OP_MUL:
+   case OP_DIV:
+   case OP_POW:
+   case OP_EQ:
+   case OP_LT:
+   case OP_LE:
+    if (ISK(b) || ISK(c))
+    {
+     printf("\t; ");
+     if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-");
+     printf(" ");
+     if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-");
+    }
+    break;
+   case OP_JMP:
+   case OP_FORLOOP:
+   case OP_FORPREP:
+    printf("\t; to %d",sbx+pc+2);
+    break;
+   case OP_CLOSURE:
+    printf("\t; %p",VOID(f->p[bx]));
+    break;
+   case OP_SETLIST:
+    if (c==0) printf("\t; %d",(int)code[++pc]);
+    else printf("\t; %d",c);
+    break;
+   default:
+    break;
+  }
+  printf("\n");
+ }
+}
+
+#define SS(x)	(x==1)?"":"s"
+#define S(x)	x,SS(x)
+
+static void PrintHeader(const Proto* f)
+{
+ const char* s=getstr(f->source);
+ if (*s=='@' || *s=='=')
+  s++;
+ else if (*s==LUA_SIGNATURE[0])
+  s="(bstring)";
+ else
+  s="(string)";
+ printf("\n%s <%s:%d,%d> (%d instruction%s, %d bytes at %p)\n",
+ 	(f->linedefined==0)?"main":"function",s,
+	f->linedefined,f->lastlinedefined,
+	S(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f));
+ printf("%d%s param%s, %d slot%s, %d upvalue%s, ",
+	f->numparams,f->is_vararg?"+":"",SS(f->numparams),
+	S(f->maxstacksize),S(f->nups));
+ printf("%d local%s, %d constant%s, %d function%s\n",
+	S(f->sizelocvars),S(f->sizek),S(f->sizep));
+}
+
+static void PrintConstants(const Proto* f)
+{
+ int i,n=f->sizek;
+ printf("constants (%d) for %p:\n",n,VOID(f));
+ for (i=0; i<n; i++)
+ {
+  printf("\t%d\t",i+1);
+  PrintConstant(f,i);
+  printf("\n");
+ }
+}
+
+static void PrintLocals(const Proto* f)
+{
+ int i,n=f->sizelocvars;
+ printf("locals (%d) for %p:\n",n,VOID(f));
+ for (i=0; i<n; i++)
+ {
+  printf("\t%d\t%s\t%d\t%d\n",
+  i,getstr(f->locvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1);
+ }
+}
+
+static void PrintUpvalues(const Proto* f)
+{
+ int i,n=f->sizeupvalues;
+ printf("upvalues (%d) for %p:\n",n,VOID(f));
+ if (f->upvalues==NULL) return;
+ for (i=0; i<n; i++)
+ {
+  printf("\t%d\t%s\n",i,getstr(f->upvalues[i]));
+ }
+}
+
+void PrintFunction(const Proto* f, int full)
+{
+ int i,n=f->sizep;
+ PrintHeader(f);
+ PrintCode(f);
+ if (full)
+ {
+  PrintConstants(f);
+  PrintLocals(f);
+  PrintUpvalues(f);
+ }
+ for (i=0; i<n; i++) PrintFunction(f->p[i],full);
+}
diff --git a/redis-stable/deps/lua/src/strbuf.c b/redis-stable/deps/lua/src/strbuf.c
new file mode 100644
index 00000000..f0f7f4b9
--- /dev/null
+++ b/redis-stable/deps/lua/src/strbuf.c
@@ -0,0 +1,251 @@
+/* strbuf - String buffer routines
+ *
+ * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdarg.h>
+#include <string.h>
+
+#include "strbuf.h"
+
+static void die(const char *fmt, ...)
+{
+    va_list arg;
+
+    va_start(arg, fmt);
+    vfprintf(stderr, fmt, arg);
+    va_end(arg);
+    fprintf(stderr, "\n");
+
+    exit(-1);
+}
+
+void strbuf_init(strbuf_t *s, int len)
+{
+    int size;
+
+    if (len <= 0)
+        size = STRBUF_DEFAULT_SIZE;
+    else
+        size = len + 1;         /* \0 terminator */
+
+    s->buf = NULL;
+    s->size = size;
+    s->length = 0;
+    s->increment = STRBUF_DEFAULT_INCREMENT;
+    s->dynamic = 0;
+    s->reallocs = 0;
+    s->debug = 0;
+
+    s->buf = malloc(size);
+    if (!s->buf)
+        die("Out of memory");
+
+    strbuf_ensure_null(s);
+}
+
+strbuf_t *strbuf_new(int len)
+{
+    strbuf_t *s;
+
+    s = malloc(sizeof(strbuf_t));
+    if (!s)
+        die("Out of memory");
+
+    strbuf_init(s, len);
+
+    /* Dynamic strbuf allocation / deallocation */
+    s->dynamic = 1;
+
+    return s;
+}
+
+void strbuf_set_increment(strbuf_t *s, int increment)
+{
+    /* Increment > 0:  Linear buffer growth rate
+     * Increment < -1: Exponential buffer growth rate */
+    if (increment == 0 || increment == -1)
+        die("BUG: Invalid string increment");
+
+    s->increment = increment;
+}
+
+static inline void debug_stats(strbuf_t *s)
+{
+    if (s->debug) {
+        fprintf(stderr, "strbuf(%lx) reallocs: %d, length: %d, size: %d\n",
+                (long)s, s->reallocs, s->length, s->size);
+    }
+}
+
+/* If strbuf_t has not been dynamically allocated, strbuf_free() can
+ * be called any number of times strbuf_init() */
+void strbuf_free(strbuf_t *s)
+{
+    debug_stats(s);
+
+    if (s->buf) {
+        free(s->buf);
+        s->buf = NULL;
+    }
+    if (s->dynamic)
+        free(s);
+}
+
+char *strbuf_free_to_string(strbuf_t *s, int *len)
+{
+    char *buf;
+
+    debug_stats(s);
+
+    strbuf_ensure_null(s);
+
+    buf = s->buf;
+    if (len)
+        *len = s->length;
+
+    if (s->dynamic)
+        free(s);
+
+    return buf;
+}
+
+static int calculate_new_size(strbuf_t *s, int len)
+{
+    int reqsize, newsize;
+
+    if (len <= 0)
+        die("BUG: Invalid strbuf length requested");
+
+    /* Ensure there is room for optional NULL termination */
+    reqsize = len + 1;
+
+    /* If the user has requested to shrink the buffer, do it exactly */
+    if (s->size > reqsize)
+        return reqsize;
+
+    newsize = s->size;
+    if (s->increment < 0) {
+        /* Exponential sizing */
+        while (newsize < reqsize)
+            newsize *= -s->increment;
+    } else {
+        /* Linear sizing */
+        newsize = ((newsize + s->increment - 1) / s->increment) * s->increment;
+    }
+
+    return newsize;
+}
+
+
+/* Ensure strbuf can handle a string length bytes long (ignoring NULL
+ * optional termination). */
+void strbuf_resize(strbuf_t *s, int len)
+{
+    int newsize;
+
+    newsize = calculate_new_size(s, len);
+
+    if (s->debug > 1) {
+        fprintf(stderr, "strbuf(%lx) resize: %d => %d\n",
+                (long)s, s->size, newsize);
+    }
+
+    s->size = newsize;
+    s->buf = realloc(s->buf, s->size);
+    if (!s->buf)
+        die("Out of memory");
+    s->reallocs++;
+}
+
+void strbuf_append_string(strbuf_t *s, const char *str)
+{
+    int space, i;
+
+    space = strbuf_empty_length(s);
+
+    for (i = 0; str[i]; i++) {
+        if (space < 1) {
+            strbuf_resize(s, s->length + 1);
+            space = strbuf_empty_length(s);
+        }
+
+        s->buf[s->length] = str[i];
+        s->length++;
+        space--;
+    }
+}
+
+/* strbuf_append_fmt() should only be used when an upper bound
+ * is known for the output string. */
+void strbuf_append_fmt(strbuf_t *s, int len, const char *fmt, ...)
+{
+    va_list arg;
+    int fmt_len;
+
+    strbuf_ensure_empty_length(s, len);
+
+    va_start(arg, fmt);
+    fmt_len = vsnprintf(s->buf + s->length, len, fmt, arg);
+    va_end(arg);
+
+    if (fmt_len < 0)
+        die("BUG: Unable to convert number");  /* This should never happen.. */
+
+    s->length += fmt_len;
+}
+
+/* strbuf_append_fmt_retry() can be used when the there is no known
+ * upper bound for the output string. */
+void strbuf_append_fmt_retry(strbuf_t *s, const char *fmt, ...)
+{
+    va_list arg;
+    int fmt_len, try;
+    int empty_len;
+
+    /* If the first attempt to append fails, resize the buffer appropriately
+     * and try again */
+    for (try = 0; ; try++) {
+        va_start(arg, fmt);
+        /* Append the new formatted string */
+        /* fmt_len is the length of the string required, excluding the
+         * trailing NULL */
+        empty_len = strbuf_empty_length(s);
+        /* Add 1 since there is also space to store the terminating NULL. */
+        fmt_len = vsnprintf(s->buf + s->length, empty_len + 1, fmt, arg);
+        va_end(arg);
+
+        if (fmt_len <= empty_len)
+            break;  /* SUCCESS */
+        if (try > 0)
+            die("BUG: length of formatted string changed");
+
+        strbuf_resize(s, s->length + fmt_len);
+    }
+
+    s->length += fmt_len;
+}
+
+/* vi:ai et sw=4 ts=4:
+ */
diff --git a/redis-stable/deps/lua/src/strbuf.h b/redis-stable/deps/lua/src/strbuf.h
new file mode 100644
index 00000000..d861108c
--- /dev/null
+++ b/redis-stable/deps/lua/src/strbuf.h
@@ -0,0 +1,154 @@
+/* strbuf - String buffer routines
+ *
+ * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+#include <stdlib.h>
+#include <stdarg.h>
+
+/* Size: Total bytes allocated to *buf
+ * Length: String length, excluding optional NULL terminator.
+ * Increment: Allocation increments when resizing the string buffer.
+ * Dynamic: True if created via strbuf_new()
+ */
+
+typedef struct {
+    char *buf;
+    int size;
+    int length;
+    int increment;
+    int dynamic;
+    int reallocs;
+    int debug;
+} strbuf_t;
+
+#ifndef STRBUF_DEFAULT_SIZE
+#define STRBUF_DEFAULT_SIZE 1023
+#endif
+#ifndef STRBUF_DEFAULT_INCREMENT
+#define STRBUF_DEFAULT_INCREMENT -2
+#endif
+
+/* Initialise */
+extern strbuf_t *strbuf_new(int len);
+extern void strbuf_init(strbuf_t *s, int len);
+extern void strbuf_set_increment(strbuf_t *s, int increment);
+
+/* Release */
+extern void strbuf_free(strbuf_t *s);
+extern char *strbuf_free_to_string(strbuf_t *s, int *len);
+
+/* Management */
+extern void strbuf_resize(strbuf_t *s, int len);
+static int strbuf_empty_length(strbuf_t *s);
+static int strbuf_length(strbuf_t *s);
+static char *strbuf_string(strbuf_t *s, int *len);
+static void strbuf_ensure_empty_length(strbuf_t *s, int len);
+static char *strbuf_empty_ptr(strbuf_t *s);
+static void strbuf_extend_length(strbuf_t *s, int len);
+
+/* Update */
+extern void strbuf_append_fmt(strbuf_t *s, int len, const char *fmt, ...);
+extern void strbuf_append_fmt_retry(strbuf_t *s, const char *format, ...);
+static void strbuf_append_mem(strbuf_t *s, const char *c, int len);
+extern void strbuf_append_string(strbuf_t *s, const char *str);
+static void strbuf_append_char(strbuf_t *s, const char c);
+static void strbuf_ensure_null(strbuf_t *s);
+
+/* Reset string for before use */
+static inline void strbuf_reset(strbuf_t *s)
+{
+    s->length = 0;
+}
+
+static inline int strbuf_allocated(strbuf_t *s)
+{
+    return s->buf != NULL;
+}
+
+/* Return bytes remaining in the string buffer
+ * Ensure there is space for a NULL terminator. */
+static inline int strbuf_empty_length(strbuf_t *s)
+{
+    return s->size - s->length - 1;
+}
+
+static inline void strbuf_ensure_empty_length(strbuf_t *s, int len)
+{
+    if (len > strbuf_empty_length(s))
+        strbuf_resize(s, s->length + len);
+}
+
+static inline char *strbuf_empty_ptr(strbuf_t *s)
+{
+    return s->buf + s->length;
+}
+
+static inline void strbuf_extend_length(strbuf_t *s, int len)
+{
+    s->length += len;
+}
+
+static inline int strbuf_length(strbuf_t *s)
+{
+    return s->length;
+}
+
+static inline void strbuf_append_char(strbuf_t *s, const char c)
+{
+    strbuf_ensure_empty_length(s, 1);
+    s->buf[s->length++] = c;
+}
+
+static inline void strbuf_append_char_unsafe(strbuf_t *s, const char c)
+{
+    s->buf[s->length++] = c;
+}
+
+static inline void strbuf_append_mem(strbuf_t *s, const char *c, int len)
+{
+    strbuf_ensure_empty_length(s, len);
+    memcpy(s->buf + s->length, c, len);
+    s->length += len;
+}
+
+static inline void strbuf_append_mem_unsafe(strbuf_t *s, const char *c, int len)
+{
+    memcpy(s->buf + s->length, c, len);
+    s->length += len;
+}
+
+static inline void strbuf_ensure_null(strbuf_t *s)
+{
+    s->buf[s->length] = 0;
+}
+
+static inline char *strbuf_string(strbuf_t *s, int *len)
+{
+    if (len)
+        *len = s->length;
+
+    return s->buf;
+}
+
+/* vi:ai et sw=4 ts=4:
+ */
diff --git a/redis-stable/deps/lua/test/README b/redis-stable/deps/lua/test/README
new file mode 100644
index 00000000..0c7f38bc
--- /dev/null
+++ b/redis-stable/deps/lua/test/README
@@ -0,0 +1,26 @@
+These are simple tests for Lua.  Some of them contain useful code.
+They are meant to be run to make sure Lua is built correctly and also
+to be read, to see how Lua programs look.
+
+Here is a one-line summary of each program:
+
+   bisect.lua		bisection method for solving non-linear equations
+   cf.lua		temperature conversion table (celsius to farenheit)
+   echo.lua             echo command line arguments
+   env.lua              environment variables as automatic global variables
+   factorial.lua	factorial without recursion
+   fib.lua		fibonacci function with cache
+   fibfor.lua		fibonacci numbers with coroutines and generators
+   globals.lua		report global variable usage
+   hello.lua		the first program in every language
+   life.lua		Conway's Game of Life
+   luac.lua	 	bare-bones luac
+   printf.lua		an implementation of printf
+   readonly.lua		make global variables readonly
+   sieve.lua		the sieve of of Eratosthenes programmed with coroutines
+   sort.lua		two implementations of a sort function
+   table.lua		make table, grouping all data for the same item
+   trace-calls.lua	trace calls
+   trace-globals.lua	trace assigments to global variables
+   xd.lua		hex dump
+
diff --git a/redis-stable/deps/lua/test/bisect.lua b/redis-stable/deps/lua/test/bisect.lua
new file mode 100644
index 00000000..f91e69bf
--- /dev/null
+++ b/redis-stable/deps/lua/test/bisect.lua
@@ -0,0 +1,27 @@
+-- bisection method for solving non-linear equations
+
+delta=1e-6	-- tolerance
+
+function bisect(f,a,b,fa,fb)
+ local c=(a+b)/2
+ io.write(n," c=",c," a=",a," b=",b,"\n")
+ if c==a or c==b or math.abs(a-b)<delta then return c,b-a end
+ n=n+1
+ local fc=f(c)
+ if fa*fc<0 then return bisect(f,a,c,fa,fc) else return bisect(f,c,b,fc,fb) end
+end
+
+-- find root of f in the inverval [a,b]. needs f(a)*f(b)<0
+function solve(f,a,b)
+ n=0
+ local z,e=bisect(f,a,b,f(a),f(b))
+ io.write(string.format("after %d steps, root is %.17g with error %.1e, f=%.1e\n",n,z,e,f(z)))
+end
+
+-- our function
+function f(x)
+ return x*x*x-x-1
+end
+
+-- find zero in [1,2]
+solve(f,1,2)
diff --git a/redis-stable/deps/lua/test/cf.lua b/redis-stable/deps/lua/test/cf.lua
new file mode 100644
index 00000000..8cda54b9
--- /dev/null
+++ b/redis-stable/deps/lua/test/cf.lua
@@ -0,0 +1,16 @@
+-- temperature conversion table (celsius to farenheit)
+
+for c0=-20,50-1,10 do
+	io.write("C ")
+	for c=c0,c0+10-1 do
+		io.write(string.format("%3.0f ",c))
+	end
+	io.write("\n")
+	
+	io.write("F ")
+	for c=c0,c0+10-1 do
+		f=(9/5)*c+32
+		io.write(string.format("%3.0f ",f))
+	end
+	io.write("\n\n")
+end
diff --git a/redis-stable/deps/lua/test/echo.lua b/redis-stable/deps/lua/test/echo.lua
new file mode 100644
index 00000000..4313439a
--- /dev/null
+++ b/redis-stable/deps/lua/test/echo.lua
@@ -0,0 +1,5 @@
+-- echo command line arguments
+
+for i=0,table.getn(arg) do
+ print(i,arg[i])
+end
diff --git a/redis-stable/deps/lua/test/env.lua b/redis-stable/deps/lua/test/env.lua
new file mode 100644
index 00000000..9e62a57f
--- /dev/null
+++ b/redis-stable/deps/lua/test/env.lua
@@ -0,0 +1,7 @@
+-- read environment variables as if they were global variables
+
+local f=function (t,i) return os.getenv(i) end
+setmetatable(getfenv(),{__index=f})
+
+-- an example
+print(a,USER,PATH)
diff --git a/redis-stable/deps/lua/test/factorial.lua b/redis-stable/deps/lua/test/factorial.lua
new file mode 100644
index 00000000..7c4cf0fa
--- /dev/null
+++ b/redis-stable/deps/lua/test/factorial.lua
@@ -0,0 +1,32 @@
+-- function closures are powerful
+
+-- traditional fixed-point operator from functional programming
+Y = function (g)
+      local a = function (f) return f(f) end
+      return a(function (f)
+                 return g(function (x)
+                             local c=f(f)
+                             return c(x)
+                           end)
+               end)
+end
+
+
+-- factorial without recursion
+F = function (f)
+      return function (n)
+               if n == 0 then return 1
+               else return n*f(n-1) end
+             end
+    end
+
+factorial = Y(F)   -- factorial is the fixed point of F
+
+-- now test it
+function test(x)
+	io.write(x,"! = ",factorial(x),"\n")
+end
+
+for n=0,16 do
+	test(n)
+end
diff --git a/redis-stable/deps/lua/test/fib.lua b/redis-stable/deps/lua/test/fib.lua
new file mode 100644
index 00000000..97a921b1
--- /dev/null
+++ b/redis-stable/deps/lua/test/fib.lua
@@ -0,0 +1,40 @@
+-- fibonacci function with cache
+
+-- very inefficient fibonacci function
+function fib(n)
+	N=N+1
+	if n<2 then
+		return n
+	else
+		return fib(n-1)+fib(n-2)
+	end
+end
+
+-- a general-purpose value cache
+function cache(f)
+	local c={}
+	return function (x)
+		local y=c[x]
+		if not y then
+			y=f(x)
+			c[x]=y
+		end
+		return y
+	end
+end
+
+-- run and time it
+function test(s,f)
+	N=0
+	local c=os.clock()
+	local v=f(n)
+	local t=os.clock()-c
+	print(s,n,v,t,N)
+end
+
+n=arg[1] or 24		-- for other values, do lua fib.lua XX
+n=tonumber(n)
+print("","n","value","time","evals")
+test("plain",fib)
+fib=cache(fib)
+test("cached",fib)
diff --git a/redis-stable/deps/lua/test/fibfor.lua b/redis-stable/deps/lua/test/fibfor.lua
new file mode 100644
index 00000000..8bbba39c
--- /dev/null
+++ b/redis-stable/deps/lua/test/fibfor.lua
@@ -0,0 +1,13 @@
+-- example of for with generator functions
+
+function generatefib (n)
+  return coroutine.wrap(function ()
+    local a,b = 1, 1
+    while a <= n do
+      coroutine.yield(a)
+      a, b = b, a+b
+    end
+  end)
+end
+
+for i in generatefib(1000) do print(i) end
diff --git a/redis-stable/deps/lua/test/globals.lua b/redis-stable/deps/lua/test/globals.lua
new file mode 100644
index 00000000..d4c20e15
--- /dev/null
+++ b/redis-stable/deps/lua/test/globals.lua
@@ -0,0 +1,13 @@
+-- reads luac listings and reports global variable usage
+-- lines where a global is written to are marked with "*"
+-- typical usage: luac -p -l file.lua | lua globals.lua | sort | lua table.lua
+
+while 1 do
+ local s=io.read()
+ if s==nil then break end
+ local ok,_,l,op,g=string.find(s,"%[%-?(%d*)%]%s*([GS])ETGLOBAL.-;%s+(.*)$")
+ if ok then
+  if op=="S" then op="*" else op="" end
+  io.write(g,"\t",l,op,"\n")
+ end
+end
diff --git a/redis-stable/deps/lua/test/hello.lua b/redis-stable/deps/lua/test/hello.lua
new file mode 100644
index 00000000..0925498f
--- /dev/null
+++ b/redis-stable/deps/lua/test/hello.lua
@@ -0,0 +1,3 @@
+-- the first program in every language
+
+io.write("Hello world, from ",_VERSION,"!\n")
diff --git a/redis-stable/deps/lua/test/life.lua b/redis-stable/deps/lua/test/life.lua
new file mode 100644
index 00000000..911d9fe1
--- /dev/null
+++ b/redis-stable/deps/lua/test/life.lua
@@ -0,0 +1,111 @@
+-- life.lua
+-- original by Dave Bollinger <DBollinger@compuserve.com> posted to lua-l
+-- modified to use ANSI terminal escape sequences
+-- modified to use for instead of while
+
+local write=io.write
+
+ALIVE="�"	DEAD="�"
+ALIVE="O"	DEAD="-"
+
+function delay() -- NOTE: SYSTEM-DEPENDENT, adjust as necessary
+  for i=1,10000 do end
+  -- local i=os.clock()+1 while(os.clock()<i) do end
+end
+
+function ARRAY2D(w,h)
+  local t = {w=w,h=h}
+  for y=1,h do
+    t[y] = {}
+    for x=1,w do
+      t[y][x]=0
+    end
+  end
+  return t
+end
+
+_CELLS = {}
+
+-- give birth to a "shape" within the cell array
+function _CELLS:spawn(shape,left,top)
+  for y=0,shape.h-1 do
+    for x=0,shape.w-1 do
+      self[top+y][left+x] = shape[y*shape.w+x+1]
+    end
+  end
+end
+
+-- run the CA and produce the next generation
+function _CELLS:evolve(next)
+  local ym1,y,yp1,yi=self.h-1,self.h,1,self.h
+  while yi > 0 do
+    local xm1,x,xp1,xi=self.w-1,self.w,1,self.w
+    while xi > 0 do
+      local sum = self[ym1][xm1] + self[ym1][x] + self[ym1][xp1] +
+                  self[y][xm1] + self[y][xp1] +
+                  self[yp1][xm1] + self[yp1][x] + self[yp1][xp1]
+      next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0
+      xm1,x,xp1,xi = x,xp1,xp1+1,xi-1
+    end
+    ym1,y,yp1,yi = y,yp1,yp1+1,yi-1
+  end
+end
+
+-- output the array to screen
+function _CELLS:draw()
+  local out="" -- accumulate to reduce flicker
+  for y=1,self.h do
+   for x=1,self.w do
+      out=out..(((self[y][x]>0) and ALIVE) or DEAD)
+    end
+    out=out.."\n"
+  end
+  write(out)
+end
+
+-- constructor
+function CELLS(w,h)
+  local c = ARRAY2D(w,h)
+  c.spawn = _CELLS.spawn
+  c.evolve = _CELLS.evolve
+  c.draw = _CELLS.draw
+  return c
+end
+
+--
+-- shapes suitable for use with spawn() above
+--
+HEART = { 1,0,1,1,0,1,1,1,1; w=3,h=3 }
+GLIDER = { 0,0,1,1,0,1,0,1,1; w=3,h=3 }
+EXPLODE = { 0,1,0,1,1,1,1,0,1,0,1,0; w=3,h=4 }
+FISH = { 0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,1,0; w=5,h=4 }
+BUTTERFLY = { 1,0,0,0,1,0,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,0,1; w=5,h=5 }
+
+-- the main routine
+function LIFE(w,h)
+  -- create two arrays
+  local thisgen = CELLS(w,h)
+  local nextgen = CELLS(w,h)
+
+  -- create some life
+  -- about 1000 generations of fun, then a glider steady-state
+  thisgen:spawn(GLIDER,5,4)
+  thisgen:spawn(EXPLODE,25,10)
+  thisgen:spawn(FISH,4,12)
+
+  -- run until break
+  local gen=1
+  write("\027[2J")	-- ANSI clear screen
+  while 1 do
+    thisgen:evolve(nextgen)
+    thisgen,nextgen = nextgen,thisgen
+    write("\027[H")	-- ANSI home cursor
+    thisgen:draw()
+    write("Life - generation ",gen,"\n")
+    gen=gen+1
+    if gen>2000 then break end
+    --delay()		-- no delay
+  end
+end
+
+LIFE(40,20)
diff --git a/redis-stable/deps/lua/test/luac.lua b/redis-stable/deps/lua/test/luac.lua
new file mode 100644
index 00000000..96a0a97c
--- /dev/null
+++ b/redis-stable/deps/lua/test/luac.lua
@@ -0,0 +1,7 @@
+-- bare-bones luac in Lua
+-- usage: lua luac.lua file.lua
+
+assert(arg[1]~=nil and arg[2]==nil,"usage: lua luac.lua file.lua")
+f=assert(io.open("luac.out","wb"))
+assert(f:write(string.dump(assert(loadfile(arg[1])))))
+assert(f:close())
diff --git a/redis-stable/deps/lua/test/printf.lua b/redis-stable/deps/lua/test/printf.lua
new file mode 100644
index 00000000..58c63ff5
--- /dev/null
+++ b/redis-stable/deps/lua/test/printf.lua
@@ -0,0 +1,7 @@
+-- an implementation of printf
+
+function printf(...)
+ io.write(string.format(...))
+end
+
+printf("Hello %s from %s on %s\n",os.getenv"USER" or "there",_VERSION,os.date())
diff --git a/redis-stable/deps/lua/test/readonly.lua b/redis-stable/deps/lua/test/readonly.lua
new file mode 100644
index 00000000..85c0b4e0
--- /dev/null
+++ b/redis-stable/deps/lua/test/readonly.lua
@@ -0,0 +1,12 @@
+-- make global variables readonly
+
+local f=function (t,i) error("cannot redefine global variable `"..i.."'",2) end
+local g={}
+local G=getfenv()
+setmetatable(g,{__index=G,__newindex=f})
+setfenv(1,g)
+
+-- an example
+rawset(g,"x",3)
+x=2
+y=1	-- cannot redefine `y'
diff --git a/redis-stable/deps/lua/test/sieve.lua b/redis-stable/deps/lua/test/sieve.lua
new file mode 100644
index 00000000..0871bb21
--- /dev/null
+++ b/redis-stable/deps/lua/test/sieve.lua
@@ -0,0 +1,29 @@
+-- the sieve of of Eratosthenes programmed with coroutines
+-- typical usage: lua -e N=1000 sieve.lua | column
+
+-- generate all the numbers from 2 to n
+function gen (n)
+  return coroutine.wrap(function ()
+    for i=2,n do coroutine.yield(i) end
+  end)
+end
+
+-- filter the numbers generated by `g', removing multiples of `p'
+function filter (p, g)
+  return coroutine.wrap(function ()
+    while 1 do
+      local n = g()
+      if n == nil then return end
+      if math.mod(n, p) ~= 0 then coroutine.yield(n) end
+    end
+  end)
+end
+
+N=N or 1000		-- from command line
+x = gen(N)		-- generate primes up to N
+while 1 do
+  local n = x()		-- pick a number until done
+  if n == nil then break end
+  print(n)		-- must be a prime number
+  x = filter(n, x)	-- now remove its multiples
+end
diff --git a/redis-stable/deps/lua/test/sort.lua b/redis-stable/deps/lua/test/sort.lua
new file mode 100644
index 00000000..0bcb15f8
--- /dev/null
+++ b/redis-stable/deps/lua/test/sort.lua
@@ -0,0 +1,66 @@
+-- two implementations of a sort function
+-- this is an example only. Lua has now a built-in function "sort"
+
+-- extracted from Programming Pearls, page 110
+function qsort(x,l,u,f)
+ if l<u then
+  local m=math.random(u-(l-1))+l-1	-- choose a random pivot in range l..u
+  x[l],x[m]=x[m],x[l]			-- swap pivot to first position
+  local t=x[l]				-- pivot value
+  m=l
+  local i=l+1
+  while i<=u do
+    -- invariant: x[l+1..m] < t <= x[m+1..i-1]
+    if f(x[i],t) then
+      m=m+1
+      x[m],x[i]=x[i],x[m]		-- swap x[i] and x[m]
+    end
+    i=i+1
+  end
+  x[l],x[m]=x[m],x[l]			-- swap pivot to a valid place
+  -- x[l+1..m-1] < x[m] <= x[m+1..u]
+  qsort(x,l,m-1,f)
+  qsort(x,m+1,u,f)
+ end
+end
+
+function selectionsort(x,n,f)
+ local i=1
+ while i<=n do
+  local m,j=i,i+1
+  while j<=n do
+   if f(x[j],x[m]) then m=j end
+   j=j+1
+  end
+ x[i],x[m]=x[m],x[i]			-- swap x[i] and x[m]
+ i=i+1
+ end
+end
+
+function show(m,x)
+ io.write(m,"\n\t")
+ local i=1
+ while x[i] do
+  io.write(x[i])
+  i=i+1
+  if x[i] then io.write(",") end
+ end
+ io.write("\n")
+end
+
+function testsorts(x)
+ local n=1
+ while x[n] do n=n+1 end; n=n-1		-- count elements
+ show("original",x)
+ qsort(x,1,n,function (x,y) return x<y end)
+ show("after quicksort",x)
+ selectionsort(x,n,function (x,y) return x>y end)
+ show("after reverse selection sort",x)
+ qsort(x,1,n,function (x,y) return x<y end)
+ show("after quicksort again",x)
+end
+
+-- array to be sorted
+x={"Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"}
+
+testsorts(x)
diff --git a/redis-stable/deps/lua/test/table.lua b/redis-stable/deps/lua/test/table.lua
new file mode 100644
index 00000000..235089c0
--- /dev/null
+++ b/redis-stable/deps/lua/test/table.lua
@@ -0,0 +1,12 @@
+-- make table, grouping all data for the same item
+-- input is 2 columns (item, data)
+
+local A
+while 1 do
+ local l=io.read()
+ if l==nil then break end
+ local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
+ if a~=A then A=a io.write("\n",a,":") end
+ io.write(" ",b)
+end
+io.write("\n")
diff --git a/redis-stable/deps/lua/test/trace-calls.lua b/redis-stable/deps/lua/test/trace-calls.lua
new file mode 100644
index 00000000..6d7a7b3b
--- /dev/null
+++ b/redis-stable/deps/lua/test/trace-calls.lua
@@ -0,0 +1,32 @@
+-- trace calls
+-- example: lua -ltrace-calls bisect.lua
+
+local level=0
+
+local function hook(event)
+ local t=debug.getinfo(3)
+ io.write(level," >>> ",string.rep(" ",level))
+ if t~=nil and t.currentline>=0 then io.write(t.short_src,":",t.currentline," ") end
+ t=debug.getinfo(2)
+ if event=="call" then
+  level=level+1
+ else
+  level=level-1 if level<0 then level=0 end
+ end
+ if t.what=="main" then
+  if event=="call" then
+   io.write("begin ",t.short_src)
+  else
+   io.write("end ",t.short_src)
+  end
+ elseif t.what=="Lua" then
+-- table.foreach(t,print)
+  io.write(event," ",t.name or "(Lua)"," <",t.linedefined,":",t.short_src,">")
+ else
+ io.write(event," ",t.name or "(C)"," [",t.what,"] ")
+ end
+ io.write("\n")
+end
+
+debug.sethook(hook,"cr")
+level=0
diff --git a/redis-stable/deps/lua/test/trace-globals.lua b/redis-stable/deps/lua/test/trace-globals.lua
new file mode 100644
index 00000000..295e670c
--- /dev/null
+++ b/redis-stable/deps/lua/test/trace-globals.lua
@@ -0,0 +1,38 @@
+-- trace assigments to global variables
+
+do
+ -- a tostring that quotes strings. note the use of the original tostring.
+ local _tostring=tostring
+ local tostring=function(a)
+  if type(a)=="string" then
+   return string.format("%q",a)
+  else
+   return _tostring(a)
+  end
+ end
+
+ local log=function (name,old,new)
+  local t=debug.getinfo(3,"Sl")
+  local line=t.currentline
+  io.write(t.short_src)
+  if line>=0 then io.write(":",line) end
+  io.write(": ",name," is now ",tostring(new)," (was ",tostring(old),")","\n")
+ end
+
+ local g={}
+ local set=function (t,name,value)
+  log(name,g[name],value)
+  g[name]=value
+ end
+ setmetatable(getfenv(),{__index=g,__newindex=set})
+end
+
+-- an example
+
+a=1
+b=2
+a=10
+b=20
+b=nil
+b=200
+print(a,b,c)
diff --git a/redis-stable/deps/lua/test/xd.lua b/redis-stable/deps/lua/test/xd.lua
new file mode 100644
index 00000000..ebc3effc
--- /dev/null
+++ b/redis-stable/deps/lua/test/xd.lua
@@ -0,0 +1,14 @@
+-- hex dump
+-- usage: lua xd.lua < file
+
+local offset=0
+while true do
+ local s=io.read(16)
+ if s==nil then return end
+ io.write(string.format("%08X  ",offset))
+ string.gsub(s,"(.)",
+	function (c) io.write(string.format("%02X ",string.byte(c))) end)
+ io.write(string.rep(" ",3*(16-string.len(s))))
+ io.write(" ",string.gsub(s,"%c","."),"\n") 
+ offset=offset+16
+end
diff --git a/redis-stable/deps/update-jemalloc.sh b/redis-stable/deps/update-jemalloc.sh
new file mode 100755
index 00000000..8ffbe1d7
--- /dev/null
+++ b/redis-stable/deps/update-jemalloc.sh
@@ -0,0 +1,9 @@
+#!/bin/bash
+VER=$1
+URL="http://www.canonware.com/download/jemalloc/jemalloc-${VER}.tar.bz2"
+echo "Downloading $URL"
+curl $URL > /tmp/jemalloc.tar.bz2
+tar xvjf /tmp/jemalloc.tar.bz2
+rm -rf jemalloc
+mv jemalloc-${VER} jemalloc
+echo "Use git status, add all files and commit changes."
diff --git a/redis-stable/redis.conf b/redis-stable/redis.conf
new file mode 100644
index 00000000..e8eff277
--- /dev/null
+++ b/redis-stable/redis.conf
@@ -0,0 +1,2051 @@
+# Redis configuration file example.
+#
+# Note that in order to read the configuration file, Redis must be
+# started with the file path as first argument:
+#
+# ./redis-server /path/to/redis.conf
+
+# Note on units: when memory size is needed, it is possible to specify
+# it in the usual form of 1k 5GB 4M and so forth:
+#
+# 1k => 1000 bytes
+# 1kb => 1024 bytes
+# 1m => 1000000 bytes
+# 1mb => 1024*1024 bytes
+# 1g => 1000000000 bytes
+# 1gb => 1024*1024*1024 bytes
+#
+# units are case insensitive so 1GB 1Gb 1gB are all the same.
+
+################################## INCLUDES ###################################
+
+# Include one or more other config files here.  This is useful if you
+# have a standard template that goes to all Redis servers but also need
+# to customize a few per-server settings.  Include files can include
+# other files, so use this wisely.
+#
+# Note that option "include" won't be rewritten by command "CONFIG REWRITE"
+# from admin or Redis Sentinel. Since Redis always uses the last processed
+# line as value of a configuration directive, you'd better put includes
+# at the beginning of this file to avoid overwriting config change at runtime.
+#
+# If instead you are interested in using includes to override configuration
+# options, it is better to use include as the last line.
+#
+# include /path/to/local.conf
+# include /path/to/other.conf
+
+################################## MODULES #####################################
+
+# Load modules at startup. If the server is not able to load modules
+# it will abort. It is possible to use multiple loadmodule directives.
+#
+# loadmodule /path/to/my_module.so
+# loadmodule /path/to/other_module.so
+
+################################## NETWORK #####################################
+
+# By default, if no "bind" configuration directive is specified, Redis listens
+# for connections from all available network interfaces on the host machine.
+# It is possible to listen to just one or multiple selected interfaces using
+# the "bind" configuration directive, followed by one or more IP addresses.
+# Each address can be prefixed by "-", which means that redis will not fail to
+# start if the address is not available. Being not available only refers to
+# addresses that does not correspond to any network interfece. Addresses that
+# are already in use will always fail, and unsupported protocols will always BE
+# silently skipped.
+#
+# Examples:
+#
+# bind 192.168.1.100 10.0.0.1     # listens on two specific IPv4 addresses
+# bind 127.0.0.1 ::1              # listens on loopback IPv4 and IPv6
+# bind * -::*                     # like the default, all available interfaces
+#
+# ~~~ WARNING ~~~ If the computer running Redis is directly exposed to the
+# internet, binding to all the interfaces is dangerous and will expose the
+# instance to everybody on the internet. So by default we uncomment the
+# following bind directive, that will force Redis to listen only on the
+# IPv4 and IPv6 (if available) loopback interface addresses (this means Redis
+# will only be able to accept client connections from the same host that it is
+# running on).
+#
+# IF YOU ARE SURE YOU WANT YOUR INSTANCE TO LISTEN TO ALL THE INTERFACES
+# JUST COMMENT OUT THE FOLLOWING LINE.
+# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+bind 127.0.0.1 -::1
+
+# Protected mode is a layer of security protection, in order to avoid that
+# Redis instances left open on the internet are accessed and exploited.
+#
+# When protected mode is on and if:
+#
+# 1) The server is not binding explicitly to a set of addresses using the
+#    "bind" directive.
+# 2) No password is configured.
+#
+# The server only accepts connections from clients connecting from the
+# IPv4 and IPv6 loopback addresses 127.0.0.1 and ::1, and from Unix domain
+# sockets.
+#
+# By default protected mode is enabled. You should disable it only if
+# you are sure you want clients from other hosts to connect to Redis
+# even if no authentication is configured, nor a specific set of interfaces
+# are explicitly listed using the "bind" directive.
+protected-mode yes
+
+# Accept connections on the specified port, default is 6379 (IANA #815344).
+# If port 0 is specified Redis will not listen on a TCP socket.
+port 6379
+
+# TCP listen() backlog.
+#
+# In high requests-per-second environments you need a high backlog in order
+# to avoid slow clients connection issues. Note that the Linux kernel
+# will silently truncate it to the value of /proc/sys/net/core/somaxconn so
+# make sure to raise both the value of somaxconn and tcp_max_syn_backlog
+# in order to get the desired effect.
+tcp-backlog 511
+
+# Unix socket.
+#
+# Specify the path for the Unix socket that will be used to listen for
+# incoming connections. There is no default, so Redis will not listen
+# on a unix socket when not specified.
+#
+# unixsocket /run/redis.sock
+# unixsocketperm 700
+
+# Close the connection after a client is idle for N seconds (0 to disable)
+timeout 0
+
+# TCP keepalive.
+#
+# If non-zero, use SO_KEEPALIVE to send TCP ACKs to clients in absence
+# of communication. This is useful for two reasons:
+#
+# 1) Detect dead peers.
+# 2) Force network equipment in the middle to consider the connection to be
+#    alive.
+#
+# On Linux, the specified value (in seconds) is the period used to send ACKs.
+# Note that to close the connection the double of the time is needed.
+# On other kernels the period depends on the kernel configuration.
+#
+# A reasonable value for this option is 300 seconds, which is the new
+# Redis default starting with Redis 3.2.1.
+tcp-keepalive 300
+
+################################# TLS/SSL #####################################
+
+# By default, TLS/SSL is disabled. To enable it, the "tls-port" configuration
+# directive can be used to define TLS-listening ports. To enable TLS on the
+# default port, use:
+#
+# port 0
+# tls-port 6379
+
+# Configure a X.509 certificate and private key to use for authenticating the
+# server to connected clients, masters or cluster peers.  These files should be
+# PEM formatted.
+#
+# tls-cert-file redis.crt 
+# tls-key-file redis.key
+#
+# If the key file is encrypted using a passphrase, it can be included here
+# as well.
+#
+# tls-key-file-pass secret
+
+# Normally Redis uses the same certificate for both server functions (accepting
+# connections) and client functions (replicating from a master, establishing
+# cluster bus connections, etc.).
+#
+# Sometimes certificates are issued with attributes that designate them as
+# client-only or server-only certificates. In that case it may be desired to use
+# different certificates for incoming (server) and outgoing (client)
+# connections. To do that, use the following directives:
+#
+# tls-client-cert-file client.crt
+# tls-client-key-file client.key
+#
+# If the key file is encrypted using a passphrase, it can be included here
+# as well.
+#
+# tls-client-key-file-pass secret
+
+# Configure a DH parameters file to enable Diffie-Hellman (DH) key exchange:
+#
+# tls-dh-params-file redis.dh
+
+# Configure a CA certificate(s) bundle or directory to authenticate TLS/SSL
+# clients and peers.  Redis requires an explicit configuration of at least one
+# of these, and will not implicitly use the system wide configuration.
+#
+# tls-ca-cert-file ca.crt
+# tls-ca-cert-dir /etc/ssl/certs
+
+# By default, clients (including replica servers) on a TLS port are required
+# to authenticate using valid client side certificates.
+#
+# If "no" is specified, client certificates are not required and not accepted.
+# If "optional" is specified, client certificates are accepted and must be
+# valid if provided, but are not required.
+#
+# tls-auth-clients no
+# tls-auth-clients optional
+
+# By default, a Redis replica does not attempt to establish a TLS connection
+# with its master.
+#
+# Use the following directive to enable TLS on replication links.
+#
+# tls-replication yes
+
+# By default, the Redis Cluster bus uses a plain TCP connection. To enable
+# TLS for the bus protocol, use the following directive:
+#
+# tls-cluster yes
+
+# By default, only TLSv1.2 and TLSv1.3 are enabled and it is highly recommended
+# that older formally deprecated versions are kept disabled to reduce the attack surface.
+# You can explicitly specify TLS versions to support.
+# Allowed values are case insensitive and include "TLSv1", "TLSv1.1", "TLSv1.2",
+# "TLSv1.3" (OpenSSL >= 1.1.1) or any combination.
+# To enable only TLSv1.2 and TLSv1.3, use:
+#
+# tls-protocols "TLSv1.2 TLSv1.3"
+
+# Configure allowed ciphers.  See the ciphers(1ssl) manpage for more information
+# about the syntax of this string.
+#
+# Note: this configuration applies only to <= TLSv1.2.
+#
+# tls-ciphers DEFAULT:!MEDIUM
+
+# Configure allowed TLSv1.3 ciphersuites.  See the ciphers(1ssl) manpage for more
+# information about the syntax of this string, and specifically for TLSv1.3
+# ciphersuites.
+#
+# tls-ciphersuites TLS_CHACHA20_POLY1305_SHA256
+
+# When choosing a cipher, use the server's preference instead of the client
+# preference. By default, the server follows the client's preference.
+#
+# tls-prefer-server-ciphers yes
+
+# By default, TLS session caching is enabled to allow faster and less expensive
+# reconnections by clients that support it. Use the following directive to disable
+# caching.
+#
+# tls-session-caching no
+
+# Change the default number of TLS sessions cached. A zero value sets the cache
+# to unlimited size. The default size is 20480.
+#
+# tls-session-cache-size 5000
+
+# Change the default timeout of cached TLS sessions. The default timeout is 300
+# seconds.
+#
+# tls-session-cache-timeout 60
+
+################################# GENERAL #####################################
+
+# By default Redis does not run as a daemon. Use 'yes' if you need it.
+# Note that Redis will write a pid file in /var/run/redis.pid when daemonized.
+# When Redis is supervised by upstart or systemd, this parameter has no impact.
+daemonize no
+
+# If you run Redis from upstart or systemd, Redis can interact with your
+# supervision tree. Options:
+#   supervised no      - no supervision interaction
+#   supervised upstart - signal upstart by putting Redis into SIGSTOP mode
+#                        requires "expect stop" in your upstart job config
+#   supervised systemd - signal systemd by writing READY=1 to $NOTIFY_SOCKET
+#                        on startup, and updating Redis status on a regular
+#                        basis.
+#   supervised auto    - detect upstart or systemd method based on
+#                        UPSTART_JOB or NOTIFY_SOCKET environment variables
+# Note: these supervision methods only signal "process is ready."
+#       They do not enable continuous pings back to your supervisor.
+#
+# The default is "no". To run under upstart/systemd, you can simply uncomment
+# the line below:
+#
+# supervised auto
+
+# If a pid file is specified, Redis writes it where specified at startup
+# and removes it at exit.
+#
+# When the server runs non daemonized, no pid file is created if none is
+# specified in the configuration. When the server is daemonized, the pid file
+# is used even if not specified, defaulting to "/var/run/redis.pid".
+#
+# Creating a pid file is best effort: if Redis is not able to create it
+# nothing bad happens, the server will start and run normally.
+#
+# Note that on modern Linux systems "/run/redis.pid" is more conforming
+# and should be used instead.
+pidfile /var/run/redis_6379.pid
+
+# Specify the server verbosity level.
+# This can be one of:
+# debug (a lot of information, useful for development/testing)
+# verbose (many rarely useful info, but not a mess like the debug level)
+# notice (moderately verbose, what you want in production probably)
+# warning (only very important / critical messages are logged)
+loglevel notice
+
+# Specify the log file name. Also the empty string can be used to force
+# Redis to log on the standard output. Note that if you use standard
+# output for logging but daemonize, logs will be sent to /dev/null
+logfile ""
+
+# To enable logging to the system logger, just set 'syslog-enabled' to yes,
+# and optionally update the other syslog parameters to suit your needs.
+# syslog-enabled no
+
+# Specify the syslog identity.
+# syslog-ident redis
+
+# Specify the syslog facility. Must be USER or between LOCAL0-LOCAL7.
+# syslog-facility local0
+
+# To disable the built in crash log, which will possibly produce cleaner core
+# dumps when they are needed, uncomment the following:
+#
+# crash-log-enabled no
+
+# To disable the fast memory check that's run as part of the crash log, which
+# will possibly let redis terminate sooner, uncomment the following:
+#
+# crash-memcheck-enabled no
+
+# Set the number of databases. The default database is DB 0, you can select
+# a different one on a per-connection basis using SELECT <dbid> where
+# dbid is a number between 0 and 'databases'-1
+databases 16
+
+# By default Redis shows an ASCII art logo only when started to log to the
+# standard output and if the standard output is a TTY and syslog logging is
+# disabled. Basically this means that normally a logo is displayed only in
+# interactive sessions.
+#
+# However it is possible to force the pre-4.0 behavior and always show a
+# ASCII art logo in startup logs by setting the following option to yes.
+always-show-logo no
+
+# By default, Redis modifies the process title (as seen in 'top' and 'ps') to
+# provide some runtime information. It is possible to disable this and leave
+# the process name as executed by setting the following to no.
+set-proc-title yes
+
+# When changing the process title, Redis uses the following template to construct
+# the modified title.
+#
+# Template variables are specified in curly brackets. The following variables are
+# supported:
+#
+# {title}           Name of process as executed if parent, or type of child process.
+# {listen-addr}     Bind address or '*' followed by TCP or TLS port listening on, or
+#                   Unix socket if only that's available.
+# {server-mode}     Special mode, i.e. "[sentinel]" or "[cluster]".
+# {port}            TCP port listening on, or 0.
+# {tls-port}        TLS port listening on, or 0.
+# {unixsocket}      Unix domain socket listening on, or "".
+# {config-file}     Name of configuration file used.
+#
+proc-title-template "{title} {listen-addr} {server-mode}"
+
+################################ SNAPSHOTTING  ################################
+
+# Save the DB to disk.
+#
+# save <seconds> <changes>
+#
+# Redis will save the DB if both the given number of seconds and the given
+# number of write operations against the DB occurred.
+#
+# Snapshotting can be completely disabled with a single empty string argument
+# as in following example:
+#
+# save ""
+#
+# Unless specified otherwise, by default Redis will save the DB:
+#   * After 3600 seconds (an hour) if at least 1 key changed
+#   * After 300 seconds (5 minutes) if at least 100 keys changed
+#   * After 60 seconds if at least 10000 keys changed
+#
+# You can set these explicitly by uncommenting the three following lines.
+#
+# save 3600 1
+# save 300 100
+# save 60 10000
+
+# By default Redis will stop accepting writes if RDB snapshots are enabled
+# (at least one save point) and the latest background save failed.
+# This will make the user aware (in a hard way) that data is not persisting
+# on disk properly, otherwise chances are that no one will notice and some
+# disaster will happen.
+#
+# If the background saving process will start working again Redis will
+# automatically allow writes again.
+#
+# However if you have setup your proper monitoring of the Redis server
+# and persistence, you may want to disable this feature so that Redis will
+# continue to work as usual even if there are problems with disk,
+# permissions, and so forth.
+stop-writes-on-bgsave-error yes
+
+# Compress string objects using LZF when dump .rdb databases?
+# By default compression is enabled as it's almost always a win.
+# If you want to save some CPU in the saving child set it to 'no' but
+# the dataset will likely be bigger if you have compressible values or keys.
+rdbcompression yes
+
+# Since version 5 of RDB a CRC64 checksum is placed at the end of the file.
+# This makes the format more resistant to corruption but there is a performance
+# hit to pay (around 10%) when saving and loading RDB files, so you can disable it
+# for maximum performances.
+#
+# RDB files created with checksum disabled have a checksum of zero that will
+# tell the loading code to skip the check.
+rdbchecksum yes
+
+# Enables or disables full sanitation checks for ziplist and listpack etc when
+# loading an RDB or RESTORE payload. This reduces the chances of a assertion or
+# crash later on while processing commands.
+# Options:
+#   no         - Never perform full sanitation
+#   yes        - Always perform full sanitation
+#   clients    - Perform full sanitation only for user connections.
+#                Excludes: RDB files, RESTORE commands received from the master
+#                connection, and client connections which have the
+#                skip-sanitize-payload ACL flag.
+# The default should be 'clients' but since it currently affects cluster
+# resharding via MIGRATE, it is temporarily set to 'no' by default.
+#
+# sanitize-dump-payload no
+
+# The filename where to dump the DB
+dbfilename dump.rdb
+
+# Remove RDB files used by replication in instances without persistence
+# enabled. By default this option is disabled, however there are environments
+# where for regulations or other security concerns, RDB files persisted on
+# disk by masters in order to feed replicas, or stored on disk by replicas
+# in order to load them for the initial synchronization, should be deleted
+# ASAP. Note that this option ONLY WORKS in instances that have both AOF
+# and RDB persistence disabled, otherwise is completely ignored.
+#
+# An alternative (and sometimes better) way to obtain the same effect is
+# to use diskless replication on both master and replicas instances. However
+# in the case of replicas, diskless is not always an option.
+rdb-del-sync-files no
+
+# The working directory.
+#
+# The DB will be written inside this directory, with the filename specified
+# above using the 'dbfilename' configuration directive.
+#
+# The Append Only File will also be created inside this directory.
+#
+# Note that you must specify a directory here, not a file name.
+dir ./
+
+################################# REPLICATION #################################
+
+# Master-Replica replication. Use replicaof to make a Redis instance a copy of
+# another Redis server. A few things to understand ASAP about Redis replication.
+#
+#   +------------------+      +---------------+
+#   |      Master      | ---> |    Replica    |
+#   | (receive writes) |      |  (exact copy) |
+#   +------------------+      +---------------+
+#
+# 1) Redis replication is asynchronous, but you can configure a master to
+#    stop accepting writes if it appears to be not connected with at least
+#    a given number of replicas.
+# 2) Redis replicas are able to perform a partial resynchronization with the
+#    master if the replication link is lost for a relatively small amount of
+#    time. You may want to configure the replication backlog size (see the next
+#    sections of this file) with a sensible value depending on your needs.
+# 3) Replication is automatic and does not need user intervention. After a
+#    network partition replicas automatically try to reconnect to masters
+#    and resynchronize with them.
+#
+# replicaof <masterip> <masterport>
+
+# If the master is password protected (using the "requirepass" configuration
+# directive below) it is possible to tell the replica to authenticate before
+# starting the replication synchronization process, otherwise the master will
+# refuse the replica request.
+#
+# masterauth <master-password>
+#
+# However this is not enough if you are using Redis ACLs (for Redis version
+# 6 or greater), and the default user is not capable of running the PSYNC
+# command and/or other commands needed for replication. In this case it's
+# better to configure a special user to use with replication, and specify the
+# masteruser configuration as such:
+#
+# masteruser <username>
+#
+# When masteruser is specified, the replica will authenticate against its
+# master using the new AUTH form: AUTH <username> <password>.
+
+# When a replica loses its connection with the master, or when the replication
+# is still in progress, the replica can act in two different ways:
+#
+# 1) if replica-serve-stale-data is set to 'yes' (the default) the replica will
+#    still reply to client requests, possibly with out of date data, or the
+#    data set may just be empty if this is the first synchronization.
+#
+# 2) If replica-serve-stale-data is set to 'no' the replica will reply with
+#    an error "SYNC with master in progress" to all commands except:
+#    INFO, REPLICAOF, AUTH, PING, SHUTDOWN, REPLCONF, ROLE, CONFIG, SUBSCRIBE,
+#    UNSUBSCRIBE, PSUBSCRIBE, PUNSUBSCRIBE, PUBLISH, PUBSUB, COMMAND, POST,
+#    HOST and LATENCY.
+#
+replica-serve-stale-data yes
+
+# You can configure a replica instance to accept writes or not. Writing against
+# a replica instance may be useful to store some ephemeral data (because data
+# written on a replica will be easily deleted after resync with the master) but
+# may also cause problems if clients are writing to it because of a
+# misconfiguration.
+#
+# Since Redis 2.6 by default replicas are read-only.
+#
+# Note: read only replicas are not designed to be exposed to untrusted clients
+# on the internet. It's just a protection layer against misuse of the instance.
+# Still a read only replica exports by default all the administrative commands
+# such as CONFIG, DEBUG, and so forth. To a limited extent you can improve
+# security of read only replicas using 'rename-command' to shadow all the
+# administrative / dangerous commands.
+replica-read-only yes
+
+# Replication SYNC strategy: disk or socket.
+#
+# New replicas and reconnecting replicas that are not able to continue the
+# replication process just receiving differences, need to do what is called a
+# "full synchronization". An RDB file is transmitted from the master to the
+# replicas.
+#
+# The transmission can happen in two different ways:
+#
+# 1) Disk-backed: The Redis master creates a new process that writes the RDB
+#                 file on disk. Later the file is transferred by the parent
+#                 process to the replicas incrementally.
+# 2) Diskless: The Redis master creates a new process that directly writes the
+#              RDB file to replica sockets, without touching the disk at all.
+#
+# With disk-backed replication, while the RDB file is generated, more replicas
+# can be queued and served with the RDB file as soon as the current child
+# producing the RDB file finishes its work. With diskless replication instead
+# once the transfer starts, new replicas arriving will be queued and a new
+# transfer will start when the current one terminates.
+#
+# When diskless replication is used, the master waits a configurable amount of
+# time (in seconds) before starting the transfer in the hope that multiple
+# replicas will arrive and the transfer can be parallelized.
+#
+# With slow disks and fast (large bandwidth) networks, diskless replication
+# works better.
+repl-diskless-sync no
+
+# When diskless replication is enabled, it is possible to configure the delay
+# the server waits in order to spawn the child that transfers the RDB via socket
+# to the replicas.
+#
+# This is important since once the transfer starts, it is not possible to serve
+# new replicas arriving, that will be queued for the next RDB transfer, so the
+# server waits a delay in order to let more replicas arrive.
+#
+# The delay is specified in seconds, and by default is 5 seconds. To disable
+# it entirely just set it to 0 seconds and the transfer will start ASAP.
+repl-diskless-sync-delay 5
+
+# -----------------------------------------------------------------------------
+# WARNING: RDB diskless load is experimental. Since in this setup the replica
+# does not immediately store an RDB on disk, it may cause data loss during
+# failovers. RDB diskless load + Redis modules not handling I/O reads may also
+# cause Redis to abort in case of I/O errors during the initial synchronization
+# stage with the master. Use only if you know what you are doing.
+# -----------------------------------------------------------------------------
+#
+# Replica can load the RDB it reads from the replication link directly from the
+# socket, or store the RDB to a file and read that file after it was completely
+# received from the master.
+#
+# In many cases the disk is slower than the network, and storing and loading
+# the RDB file may increase replication time (and even increase the master's
+# Copy on Write memory and salve buffers).
+# However, parsing the RDB file directly from the socket may mean that we have
+# to flush the contents of the current database before the full rdb was
+# received. For this reason we have the following options:
+#
+# "disabled"    - Don't use diskless load (store the rdb file to the disk first)
+# "on-empty-db" - Use diskless load only when it is completely safe.
+# "swapdb"      - Keep a copy of the current db contents in RAM while parsing
+#                 the data directly from the socket. note that this requires
+#                 sufficient memory, if you don't have it, you risk an OOM kill.
+repl-diskless-load disabled
+
+# Replicas send PINGs to server in a predefined interval. It's possible to
+# change this interval with the repl_ping_replica_period option. The default
+# value is 10 seconds.
+#
+# repl-ping-replica-period 10
+
+# The following option sets the replication timeout for:
+#
+# 1) Bulk transfer I/O during SYNC, from the point of view of replica.
+# 2) Master timeout from the point of view of replicas (data, pings).
+# 3) Replica timeout from the point of view of masters (REPLCONF ACK pings).
+#
+# It is important to make sure that this value is greater than the value
+# specified for repl-ping-replica-period otherwise a timeout will be detected
+# every time there is low traffic between the master and the replica. The default
+# value is 60 seconds.
+#
+# repl-timeout 60
+
+# Disable TCP_NODELAY on the replica socket after SYNC?
+#
+# If you select "yes" Redis will use a smaller number of TCP packets and
+# less bandwidth to send data to replicas. But this can add a delay for
+# the data to appear on the replica side, up to 40 milliseconds with
+# Linux kernels using a default configuration.
+#
+# If you select "no" the delay for data to appear on the replica side will
+# be reduced but more bandwidth will be used for replication.
+#
+# By default we optimize for low latency, but in very high traffic conditions
+# or when the master and replicas are many hops away, turning this to "yes" may
+# be a good idea.
+repl-disable-tcp-nodelay no
+
+# Set the replication backlog size. The backlog is a buffer that accumulates
+# replica data when replicas are disconnected for some time, so that when a
+# replica wants to reconnect again, often a full resync is not needed, but a
+# partial resync is enough, just passing the portion of data the replica
+# missed while disconnected.
+#
+# The bigger the replication backlog, the longer the replica can endure the
+# disconnect and later be able to perform a partial resynchronization.
+#
+# The backlog is only allocated if there is at least one replica connected.
+#
+# repl-backlog-size 1mb
+
+# After a master has no connected replicas for some time, the backlog will be
+# freed. The following option configures the amount of seconds that need to
+# elapse, starting from the time the last replica disconnected, for the backlog
+# buffer to be freed.
+#
+# Note that replicas never free the backlog for timeout, since they may be
+# promoted to masters later, and should be able to correctly "partially
+# resynchronize" with other replicas: hence they should always accumulate backlog.
+#
+# A value of 0 means to never release the backlog.
+#
+# repl-backlog-ttl 3600
+
+# The replica priority is an integer number published by Redis in the INFO
+# output. It is used by Redis Sentinel in order to select a replica to promote
+# into a master if the master is no longer working correctly.
+#
+# A replica with a low priority number is considered better for promotion, so
+# for instance if there are three replicas with priority 10, 100, 25 Sentinel
+# will pick the one with priority 10, that is the lowest.
+#
+# However a special priority of 0 marks the replica as not able to perform the
+# role of master, so a replica with priority of 0 will never be selected by
+# Redis Sentinel for promotion.
+#
+# By default the priority is 100.
+replica-priority 100
+
+# -----------------------------------------------------------------------------
+# By default, Redis Sentinel includes all replicas in its reports. A replica
+# can be excluded from Redis Sentinel's announcements. An unannounced replica
+# will be ignored by the 'sentinel replicas <master>' command and won't be
+# exposed to Redis Sentinel's clients.
+#
+# This option does not change the behavior of replica-priority. Even with
+# replica-announced set to 'no', the replica can be promoted to master. To
+# prevent this behavior, set replica-priority to 0.
+#
+# replica-announced yes
+
+# It is possible for a master to stop accepting writes if there are less than
+# N replicas connected, having a lag less or equal than M seconds.
+#
+# The N replicas need to be in "online" state.
+#
+# The lag in seconds, that must be <= the specified value, is calculated from
+# the last ping received from the replica, that is usually sent every second.
+#
+# This option does not GUARANTEE that N replicas will accept the write, but
+# will limit the window of exposure for lost writes in case not enough replicas
+# are available, to the specified number of seconds.
+#
+# For example to require at least 3 replicas with a lag <= 10 seconds use:
+#
+# min-replicas-to-write 3
+# min-replicas-max-lag 10
+#
+# Setting one or the other to 0 disables the feature.
+#
+# By default min-replicas-to-write is set to 0 (feature disabled) and
+# min-replicas-max-lag is set to 10.
+
+# A Redis master is able to list the address and port of the attached
+# replicas in different ways. For example the "INFO replication" section
+# offers this information, which is used, among other tools, by
+# Redis Sentinel in order to discover replica instances.
+# Another place where this info is available is in the output of the
+# "ROLE" command of a master.
+#
+# The listed IP address and port normally reported by a replica is
+# obtained in the following way:
+#
+#   IP: The address is auto detected by checking the peer address
+#   of the socket used by the replica to connect with the master.
+#
+#   Port: The port is communicated by the replica during the replication
+#   handshake, and is normally the port that the replica is using to
+#   listen for connections.
+#
+# However when port forwarding or Network Address Translation (NAT) is
+# used, the replica may actually be reachable via different IP and port
+# pairs. The following two options can be used by a replica in order to
+# report to its master a specific set of IP and port, so that both INFO
+# and ROLE will report those values.
+#
+# There is no need to use both the options if you need to override just
+# the port or the IP address.
+#
+# replica-announce-ip 5.5.5.5
+# replica-announce-port 1234
+
+############################### KEYS TRACKING #################################
+
+# Redis implements server assisted support for client side caching of values.
+# This is implemented using an invalidation table that remembers, using
+# a radix key indexed by key name, what clients have which keys. In turn
+# this is used in order to send invalidation messages to clients. Please
+# check this page to understand more about the feature:
+#
+#   https://redis.io/topics/client-side-caching
+#
+# When tracking is enabled for a client, all the read only queries are assumed
+# to be cached: this will force Redis to store information in the invalidation
+# table. When keys are modified, such information is flushed away, and
+# invalidation messages are sent to the clients. However if the workload is
+# heavily dominated by reads, Redis could use more and more memory in order
+# to track the keys fetched by many clients.
+#
+# For this reason it is possible to configure a maximum fill value for the
+# invalidation table. By default it is set to 1M of keys, and once this limit
+# is reached, Redis will start to evict keys in the invalidation table
+# even if they were not modified, just to reclaim memory: this will in turn
+# force the clients to invalidate the cached values. Basically the table
+# maximum size is a trade off between the memory you want to spend server
+# side to track information about who cached what, and the ability of clients
+# to retain cached objects in memory.
+#
+# If you set the value to 0, it means there are no limits, and Redis will
+# retain as many keys as needed in the invalidation table.
+# In the "stats" INFO section, you can find information about the number of
+# keys in the invalidation table at every given moment.
+#
+# Note: when key tracking is used in broadcasting mode, no memory is used
+# in the server side so this setting is useless.
+#
+# tracking-table-max-keys 1000000
+
+################################## SECURITY ###################################
+
+# Warning: since Redis is pretty fast, an outside user can try up to
+# 1 million passwords per second against a modern box. This means that you
+# should use very strong passwords, otherwise they will be very easy to break.
+# Note that because the password is really a shared secret between the client
+# and the server, and should not be memorized by any human, the password
+# can be easily a long string from /dev/urandom or whatever, so by using a
+# long and unguessable password no brute force attack will be possible.
+
+# Redis ACL users are defined in the following format:
+#
+#   user <username> ... acl rules ...
+#
+# For example:
+#
+#   user worker +@list +@connection ~jobs:* on >ffa9203c493aa99
+#
+# The special username "default" is used for new connections. If this user
+# has the "nopass" rule, then new connections will be immediately authenticated
+# as the "default" user without the need of any password provided via the
+# AUTH command. Otherwise if the "default" user is not flagged with "nopass"
+# the connections will start in not authenticated state, and will require
+# AUTH (or the HELLO command AUTH option) in order to be authenticated and
+# start to work.
+#
+# The ACL rules that describe what a user can do are the following:
+#
+#  on           Enable the user: it is possible to authenticate as this user.
+#  off          Disable the user: it's no longer possible to authenticate
+#               with this user, however the already authenticated connections
+#               will still work.
+#  skip-sanitize-payload    RESTORE dump-payload sanitation is skipped.
+#  sanitize-payload         RESTORE dump-payload is sanitized (default).
+#  +<command>   Allow the execution of that command
+#  -<command>   Disallow the execution of that command
+#  +@<category> Allow the execution of all the commands in such category
+#               with valid categories are like @admin, @set, @sortedset, ...
+#               and so forth, see the full list in the server.c file where
+#               the Redis command table is described and defined.
+#               The special category @all means all the commands, but currently
+#               present in the server, and that will be loaded in the future
+#               via modules.
+#  +<command>|subcommand    Allow a specific subcommand of an otherwise
+#                           disabled command. Note that this form is not
+#                           allowed as negative like -DEBUG|SEGFAULT, but
+#                           only additive starting with "+".
+#  allcommands  Alias for +@all. Note that it implies the ability to execute
+#               all the future commands loaded via the modules system.
+#  nocommands   Alias for -@all.
+#  ~<pattern>   Add a pattern of keys that can be mentioned as part of
+#               commands. For instance ~* allows all the keys. The pattern
+#               is a glob-style pattern like the one of KEYS.
+#               It is possible to specify multiple patterns.
+#  allkeys      Alias for ~*
+#  resetkeys    Flush the list of allowed keys patterns.
+#  &<pattern>   Add a glob-style pattern of Pub/Sub channels that can be
+#               accessed by the user. It is possible to specify multiple channel
+#               patterns.
+#  allchannels  Alias for &*
+#  resetchannels            Flush the list of allowed channel patterns.
+#  ><password>  Add this password to the list of valid password for the user.
+#               For example >mypass will add "mypass" to the list.
+#               This directive clears the "nopass" flag (see later).
+#  <<password>  Remove this password from the list of valid passwords.
+#  nopass       All the set passwords of the user are removed, and the user
+#               is flagged as requiring no password: it means that every
+#               password will work against this user. If this directive is
+#               used for the default user, every new connection will be
+#               immediately authenticated with the default user without
+#               any explicit AUTH command required. Note that the "resetpass"
+#               directive will clear this condition.
+#  resetpass    Flush the list of allowed passwords. Moreover removes the
+#               "nopass" status. After "resetpass" the user has no associated
+#               passwords and there is no way to authenticate without adding
+#               some password (or setting it as "nopass" later).
+#  reset        Performs the following actions: resetpass, resetkeys, off,
+#               -@all. The user returns to the same state it has immediately
+#               after its creation.
+#
+# ACL rules can be specified in any order: for instance you can start with
+# passwords, then flags, or key patterns. However note that the additive
+# and subtractive rules will CHANGE MEANING depending on the ordering.
+# For instance see the following example:
+#
+#   user alice on +@all -DEBUG ~* >somepassword
+#
+# This will allow "alice" to use all the commands with the exception of the
+# DEBUG command, since +@all added all the commands to the set of the commands
+# alice can use, and later DEBUG was removed. However if we invert the order
+# of two ACL rules the result will be different:
+#
+#   user alice on -DEBUG +@all ~* >somepassword
+#
+# Now DEBUG was removed when alice had yet no commands in the set of allowed
+# commands, later all the commands are added, so the user will be able to
+# execute everything.
+#
+# Basically ACL rules are processed left-to-right.
+#
+# For more information about ACL configuration please refer to
+# the Redis web site at https://redis.io/topics/acl
+
+# ACL LOG
+#
+# The ACL Log tracks failed commands and authentication events associated
+# with ACLs. The ACL Log is useful to troubleshoot failed commands blocked 
+# by ACLs. The ACL Log is stored in memory. You can reclaim memory with 
+# ACL LOG RESET. Define the maximum entry length of the ACL Log below.
+acllog-max-len 128
+
+# Using an external ACL file
+#
+# Instead of configuring users here in this file, it is possible to use
+# a stand-alone file just listing users. The two methods cannot be mixed:
+# if you configure users here and at the same time you activate the external
+# ACL file, the server will refuse to start.
+#
+# The format of the external ACL user file is exactly the same as the
+# format that is used inside redis.conf to describe users.
+#
+# aclfile /etc/redis/users.acl
+
+# IMPORTANT NOTE: starting with Redis 6 "requirepass" is just a compatibility
+# layer on top of the new ACL system. The option effect will be just setting
+# the password for the default user. Clients will still authenticate using
+# AUTH <password> as usually, or more explicitly with AUTH default <password>
+# if they follow the new protocol: both will work.
+#
+# The requirepass is not compatable with aclfile option and the ACL LOAD
+# command, these will cause requirepass to be ignored.
+#
+# requirepass foobared
+
+# New users are initialized with restrictive permissions by default, via the
+# equivalent of this ACL rule 'off resetkeys -@all'. Starting with Redis 6.2, it
+# is possible to manage access to Pub/Sub channels with ACL rules as well. The
+# default Pub/Sub channels permission if new users is controlled by the 
+# acl-pubsub-default configuration directive, which accepts one of these values:
+#
+# allchannels: grants access to all Pub/Sub channels
+# resetchannels: revokes access to all Pub/Sub channels
+#
+# To ensure backward compatibility while upgrading Redis 6.0, acl-pubsub-default
+# defaults to the 'allchannels' permission.
+#
+# Future compatibility note: it is very likely that in a future version of Redis
+# the directive's default of 'allchannels' will be changed to 'resetchannels' in
+# order to provide better out-of-the-box Pub/Sub security. Therefore, it is
+# recommended that you explicitly define Pub/Sub permissions for all users
+# rather then rely on implicit default values. Once you've set explicit
+# Pub/Sub for all existing users, you should uncomment the following line.
+#
+# acl-pubsub-default resetchannels
+
+# Command renaming (DEPRECATED).
+#
+# ------------------------------------------------------------------------
+# WARNING: avoid using this option if possible. Instead use ACLs to remove
+# commands from the default user, and put them only in some admin user you
+# create for administrative purposes.
+# ------------------------------------------------------------------------
+#
+# It is possible to change the name of dangerous commands in a shared
+# environment. For instance the CONFIG command may be renamed into something
+# hard to guess so that it will still be available for internal-use tools
+# but not available for general clients.
+#
+# Example:
+#
+# rename-command CONFIG b840fc02d524045429941cc15f59e41cb7be6c52
+#
+# It is also possible to completely kill a command by renaming it into
+# an empty string:
+#
+# rename-command CONFIG ""
+#
+# Please note that changing the name of commands that are logged into the
+# AOF file or transmitted to replicas may cause problems.
+
+################################### CLIENTS ####################################
+
+# Set the max number of connected clients at the same time. By default
+# this limit is set to 10000 clients, however if the Redis server is not
+# able to configure the process file limit to allow for the specified limit
+# the max number of allowed clients is set to the current file limit
+# minus 32 (as Redis reserves a few file descriptors for internal uses).
+#
+# Once the limit is reached Redis will close all the new connections sending
+# an error 'max number of clients reached'.
+#
+# IMPORTANT: When Redis Cluster is used, the max number of connections is also
+# shared with the cluster bus: every node in the cluster will use two
+# connections, one incoming and another outgoing. It is important to size the
+# limit accordingly in case of very large clusters.
+#
+# maxclients 10000
+
+############################## MEMORY MANAGEMENT ################################
+
+# Set a memory usage limit to the specified amount of bytes.
+# When the memory limit is reached Redis will try to remove keys
+# according to the eviction policy selected (see maxmemory-policy).
+#
+# If Redis can't remove keys according to the policy, or if the policy is
+# set to 'noeviction', Redis will start to reply with errors to commands
+# that would use more memory, like SET, LPUSH, and so on, and will continue
+# to reply to read-only commands like GET.
+#
+# This option is usually useful when using Redis as an LRU or LFU cache, or to
+# set a hard memory limit for an instance (using the 'noeviction' policy).
+#
+# WARNING: If you have replicas attached to an instance with maxmemory on,
+# the size of the output buffers needed to feed the replicas are subtracted
+# from the used memory count, so that network problems / resyncs will
+# not trigger a loop where keys are evicted, and in turn the output
+# buffer of replicas is full with DELs of keys evicted triggering the deletion
+# of more keys, and so forth until the database is completely emptied.
+#
+# In short... if you have replicas attached it is suggested that you set a lower
+# limit for maxmemory so that there is some free RAM on the system for replica
+# output buffers (but this is not needed if the policy is 'noeviction').
+#
+# maxmemory <bytes>
+
+# MAXMEMORY POLICY: how Redis will select what to remove when maxmemory
+# is reached. You can select one from the following behaviors:
+#
+# volatile-lru -> Evict using approximated LRU, only keys with an expire set.
+# allkeys-lru -> Evict any key using approximated LRU.
+# volatile-lfu -> Evict using approximated LFU, only keys with an expire set.
+# allkeys-lfu -> Evict any key using approximated LFU.
+# volatile-random -> Remove a random key having an expire set.
+# allkeys-random -> Remove a random key, any key.
+# volatile-ttl -> Remove the key with the nearest expire time (minor TTL)
+# noeviction -> Don't evict anything, just return an error on write operations.
+#
+# LRU means Least Recently Used
+# LFU means Least Frequently Used
+#
+# Both LRU, LFU and volatile-ttl are implemented using approximated
+# randomized algorithms.
+#
+# Note: with any of the above policies, when there are no suitable keys for
+# eviction, Redis will return an error on write operations that require
+# more memory. These are usually commands that create new keys, add data or
+# modify existing keys. A few examples are: SET, INCR, HSET, LPUSH, SUNIONSTORE,
+# SORT (due to the STORE argument), and EXEC (if the transaction includes any
+# command that requires memory).
+#
+# The default is:
+#
+# maxmemory-policy noeviction
+
+# LRU, LFU and minimal TTL algorithms are not precise algorithms but approximated
+# algorithms (in order to save memory), so you can tune it for speed or
+# accuracy. By default Redis will check five keys and pick the one that was
+# used least recently, you can change the sample size using the following
+# configuration directive.
+#
+# The default of 5 produces good enough results. 10 Approximates very closely
+# true LRU but costs more CPU. 3 is faster but not very accurate.
+#
+# maxmemory-samples 5
+
+# Eviction processing is designed to function well with the default setting.
+# If there is an unusually large amount of write traffic, this value may need to
+# be increased.  Decreasing this value may reduce latency at the risk of 
+# eviction processing effectiveness
+#   0 = minimum latency, 10 = default, 100 = process without regard to latency
+#
+# maxmemory-eviction-tenacity 10
+
+# Starting from Redis 5, by default a replica will ignore its maxmemory setting
+# (unless it is promoted to master after a failover or manually). It means
+# that the eviction of keys will be just handled by the master, sending the
+# DEL commands to the replica as keys evict in the master side.
+#
+# This behavior ensures that masters and replicas stay consistent, and is usually
+# what you want, however if your replica is writable, or you want the replica
+# to have a different memory setting, and you are sure all the writes performed
+# to the replica are idempotent, then you may change this default (but be sure
+# to understand what you are doing).
+#
+# Note that since the replica by default does not evict, it may end using more
+# memory than the one set via maxmemory (there are certain buffers that may
+# be larger on the replica, or data structures may sometimes take more memory
+# and so forth). So make sure you monitor your replicas and make sure they
+# have enough memory to never hit a real out-of-memory condition before the
+# master hits the configured maxmemory setting.
+#
+# replica-ignore-maxmemory yes
+
+# Redis reclaims expired keys in two ways: upon access when those keys are
+# found to be expired, and also in background, in what is called the
+# "active expire key". The key space is slowly and interactively scanned
+# looking for expired keys to reclaim, so that it is possible to free memory
+# of keys that are expired and will never be accessed again in a short time.
+#
+# The default effort of the expire cycle will try to avoid having more than
+# ten percent of expired keys still in memory, and will try to avoid consuming
+# more than 25% of total memory and to add latency to the system. However
+# it is possible to increase the expire "effort" that is normally set to
+# "1", to a greater value, up to the value "10". At its maximum value the
+# system will use more CPU, longer cycles (and technically may introduce
+# more latency), and will tolerate less already expired keys still present
+# in the system. It's a tradeoff between memory, CPU and latency.
+#
+# active-expire-effort 1
+
+############################# LAZY FREEING ####################################
+
+# Redis has two primitives to delete keys. One is called DEL and is a blocking
+# deletion of the object. It means that the server stops processing new commands
+# in order to reclaim all the memory associated with an object in a synchronous
+# way. If the key deleted is associated with a small object, the time needed
+# in order to execute the DEL command is very small and comparable to most other
+# O(1) or O(log_N) commands in Redis. However if the key is associated with an
+# aggregated value containing millions of elements, the server can block for
+# a long time (even seconds) in order to complete the operation.
+#
+# For the above reasons Redis also offers non blocking deletion primitives
+# such as UNLINK (non blocking DEL) and the ASYNC option of FLUSHALL and
+# FLUSHDB commands, in order to reclaim memory in background. Those commands
+# are executed in constant time. Another thread will incrementally free the
+# object in the background as fast as possible.
+#
+# DEL, UNLINK and ASYNC option of FLUSHALL and FLUSHDB are user-controlled.
+# It's up to the design of the application to understand when it is a good
+# idea to use one or the other. However the Redis server sometimes has to
+# delete keys or flush the whole database as a side effect of other operations.
+# Specifically Redis deletes objects independently of a user call in the
+# following scenarios:
+#
+# 1) On eviction, because of the maxmemory and maxmemory policy configurations,
+#    in order to make room for new data, without going over the specified
+#    memory limit.
+# 2) Because of expire: when a key with an associated time to live (see the
+#    EXPIRE command) must be deleted from memory.
+# 3) Because of a side effect of a command that stores data on a key that may
+#    already exist. For example the RENAME command may delete the old key
+#    content when it is replaced with another one. Similarly SUNIONSTORE
+#    or SORT with STORE option may delete existing keys. The SET command
+#    itself removes any old content of the specified key in order to replace
+#    it with the specified string.
+# 4) During replication, when a replica performs a full resynchronization with
+#    its master, the content of the whole database is removed in order to
+#    load the RDB file just transferred.
+#
+# In all the above cases the default is to delete objects in a blocking way,
+# like if DEL was called. However you can configure each case specifically
+# in order to instead release memory in a non-blocking way like if UNLINK
+# was called, using the following configuration directives.
+
+lazyfree-lazy-eviction no
+lazyfree-lazy-expire no
+lazyfree-lazy-server-del no
+replica-lazy-flush no
+
+# It is also possible, for the case when to replace the user code DEL calls
+# with UNLINK calls is not easy, to modify the default behavior of the DEL
+# command to act exactly like UNLINK, using the following configuration
+# directive:
+
+lazyfree-lazy-user-del no
+
+# FLUSHDB, FLUSHALL, and SCRIPT FLUSH support both asynchronous and synchronous
+# deletion, which can be controlled by passing the [SYNC|ASYNC] flags into the
+# commands. When neither flag is passed, this directive will be used to determine
+# if the data should be deleted asynchronously.
+
+lazyfree-lazy-user-flush no
+
+################################ THREADED I/O #################################
+
+# Redis is mostly single threaded, however there are certain threaded
+# operations such as UNLINK, slow I/O accesses and other things that are
+# performed on side threads.
+#
+# Now it is also possible to handle Redis clients socket reads and writes
+# in different I/O threads. Since especially writing is so slow, normally
+# Redis users use pipelining in order to speed up the Redis performances per
+# core, and spawn multiple instances in order to scale more. Using I/O
+# threads it is possible to easily speedup two times Redis without resorting
+# to pipelining nor sharding of the instance.
+#
+# By default threading is disabled, we suggest enabling it only in machines
+# that have at least 4 or more cores, leaving at least one spare core.
+# Using more than 8 threads is unlikely to help much. We also recommend using
+# threaded I/O only if you actually have performance problems, with Redis
+# instances being able to use a quite big percentage of CPU time, otherwise
+# there is no point in using this feature.
+#
+# So for instance if you have a four cores boxes, try to use 2 or 3 I/O
+# threads, if you have a 8 cores, try to use 6 threads. In order to
+# enable I/O threads use the following configuration directive:
+#
+# io-threads 4
+#
+# Setting io-threads to 1 will just use the main thread as usual.
+# When I/O threads are enabled, we only use threads for writes, that is
+# to thread the write(2) syscall and transfer the client buffers to the
+# socket. However it is also possible to enable threading of reads and
+# protocol parsing using the following configuration directive, by setting
+# it to yes:
+#
+# io-threads-do-reads no
+#
+# Usually threading reads doesn't help much.
+#
+# NOTE 1: This configuration directive cannot be changed at runtime via
+# CONFIG SET. Aso this feature currently does not work when SSL is
+# enabled.
+#
+# NOTE 2: If you want to test the Redis speedup using redis-benchmark, make
+# sure you also run the benchmark itself in threaded mode, using the
+# --threads option to match the number of Redis threads, otherwise you'll not
+# be able to notice the improvements.
+
+############################ KERNEL OOM CONTROL ##############################
+
+# On Linux, it is possible to hint the kernel OOM killer on what processes
+# should be killed first when out of memory.
+#
+# Enabling this feature makes Redis actively control the oom_score_adj value
+# for all its processes, depending on their role. The default scores will
+# attempt to have background child processes killed before all others, and
+# replicas killed before masters.
+#
+# Redis supports three options:
+#
+# no:       Don't make changes to oom-score-adj (default).
+# yes:      Alias to "relative" see below.
+# absolute: Values in oom-score-adj-values are written as is to the kernel.
+# relative: Values are used relative to the initial value of oom_score_adj when
+#           the server starts and are then clamped to a range of -1000 to 1000.
+#           Because typically the initial value is 0, they will often match the
+#           absolute values.
+oom-score-adj no
+
+# When oom-score-adj is used, this directive controls the specific values used
+# for master, replica and background child processes. Values range -2000 to
+# 2000 (higher means more likely to be killed).
+#
+# Unprivileged processes (not root, and without CAP_SYS_RESOURCE capabilities)
+# can freely increase their value, but not decrease it below its initial
+# settings. This means that setting oom-score-adj to "relative" and setting the
+# oom-score-adj-values to positive values will always succeed.
+oom-score-adj-values 0 200 800
+
+
+#################### KERNEL transparent hugepage CONTROL ######################
+
+# Usually the kernel Transparent Huge Pages control is set to "madvise" or
+# or "never" by default (/sys/kernel/mm/transparent_hugepage/enabled), in which
+# case this config has no effect. On systems in which it is set to "always",
+# redis will attempt to disable it specifically for the redis process in order
+# to avoid latency problems specifically with fork(2) and CoW.
+# If for some reason you prefer to keep it enabled, you can set this config to
+# "no" and the kernel global to "always".
+
+disable-thp yes
+
+############################## APPEND ONLY MODE ###############################
+
+# By default Redis asynchronously dumps the dataset on disk. This mode is
+# good enough in many applications, but an issue with the Redis process or
+# a power outage may result into a few minutes of writes lost (depending on
+# the configured save points).
+#
+# The Append Only File is an alternative persistence mode that provides
+# much better durability. For instance using the default data fsync policy
+# (see later in the config file) Redis can lose just one second of writes in a
+# dramatic event like a server power outage, or a single write if something
+# wrong with the Redis process itself happens, but the operating system is
+# still running correctly.
+#
+# AOF and RDB persistence can be enabled at the same time without problems.
+# If the AOF is enabled on startup Redis will load the AOF, that is the file
+# with the better durability guarantees.
+#
+# Please check https://redis.io/topics/persistence for more information.
+
+appendonly no
+
+# The name of the append only file (default: "appendonly.aof")
+
+appendfilename "appendonly.aof"
+
+# The fsync() call tells the Operating System to actually write data on disk
+# instead of waiting for more data in the output buffer. Some OS will really flush
+# data on disk, some other OS will just try to do it ASAP.
+#
+# Redis supports three different modes:
+#
+# no: don't fsync, just let the OS flush the data when it wants. Faster.
+# always: fsync after every write to the append only log. Slow, Safest.
+# everysec: fsync only one time every second. Compromise.
+#
+# The default is "everysec", as that's usually the right compromise between
+# speed and data safety. It's up to you to understand if you can relax this to
+# "no" that will let the operating system flush the output buffer when
+# it wants, for better performances (but if you can live with the idea of
+# some data loss consider the default persistence mode that's snapshotting),
+# or on the contrary, use "always" that's very slow but a bit safer than
+# everysec.
+#
+# More details please check the following article:
+# http://antirez.com/post/redis-persistence-demystified.html
+#
+# If unsure, use "everysec".
+
+# appendfsync always
+appendfsync everysec
+# appendfsync no
+
+# When the AOF fsync policy is set to always or everysec, and a background
+# saving process (a background save or AOF log background rewriting) is
+# performing a lot of I/O against the disk, in some Linux configurations
+# Redis may block too long on the fsync() call. Note that there is no fix for
+# this currently, as even performing fsync in a different thread will block
+# our synchronous write(2) call.
+#
+# In order to mitigate this problem it's possible to use the following option
+# that will prevent fsync() from being called in the main process while a
+# BGSAVE or BGREWRITEAOF is in progress.
+#
+# This means that while another child is saving, the durability of Redis is
+# the same as "appendfsync none". In practical terms, this means that it is
+# possible to lose up to 30 seconds of log in the worst scenario (with the
+# default Linux settings).
+#
+# If you have latency problems turn this to "yes". Otherwise leave it as
+# "no" that is the safest pick from the point of view of durability.
+
+no-appendfsync-on-rewrite no
+
+# Automatic rewrite of the append only file.
+# Redis is able to automatically rewrite the log file implicitly calling
+# BGREWRITEAOF when the AOF log size grows by the specified percentage.
+#
+# This is how it works: Redis remembers the size of the AOF file after the
+# latest rewrite (if no rewrite has happened since the restart, the size of
+# the AOF at startup is used).
+#
+# This base size is compared to the current size. If the current size is
+# bigger than the specified percentage, the rewrite is triggered. Also
+# you need to specify a minimal size for the AOF file to be rewritten, this
+# is useful to avoid rewriting the AOF file even if the percentage increase
+# is reached but it is still pretty small.
+#
+# Specify a percentage of zero in order to disable the automatic AOF
+# rewrite feature.
+
+auto-aof-rewrite-percentage 100
+auto-aof-rewrite-min-size 64mb
+
+# An AOF file may be found to be truncated at the end during the Redis
+# startup process, when the AOF data gets loaded back into memory.
+# This may happen when the system where Redis is running
+# crashes, especially when an ext4 filesystem is mounted without the
+# data=ordered option (however this can't happen when Redis itself
+# crashes or aborts but the operating system still works correctly).
+#
+# Redis can either exit with an error when this happens, or load as much
+# data as possible (the default now) and start if the AOF file is found
+# to be truncated at the end. The following option controls this behavior.
+#
+# If aof-load-truncated is set to yes, a truncated AOF file is loaded and
+# the Redis server starts emitting a log to inform the user of the event.
+# Otherwise if the option is set to no, the server aborts with an error
+# and refuses to start. When the option is set to no, the user requires
+# to fix the AOF file using the "redis-check-aof" utility before to restart
+# the server.
+#
+# Note that if the AOF file will be found to be corrupted in the middle
+# the server will still exit with an error. This option only applies when
+# Redis will try to read more data from the AOF file but not enough bytes
+# will be found.
+aof-load-truncated yes
+
+# When rewriting the AOF file, Redis is able to use an RDB preamble in the
+# AOF file for faster rewrites and recoveries. When this option is turned
+# on the rewritten AOF file is composed of two different stanzas:
+#
+#   [RDB file][AOF tail]
+#
+# When loading, Redis recognizes that the AOF file starts with the "REDIS"
+# string and loads the prefixed RDB file, then continues loading the AOF
+# tail.
+aof-use-rdb-preamble yes
+
+################################ LUA SCRIPTING  ###############################
+
+# Max execution time of a Lua script in milliseconds.
+#
+# If the maximum execution time is reached Redis will log that a script is
+# still in execution after the maximum allowed time and will start to
+# reply to queries with an error.
+#
+# When a long running script exceeds the maximum execution time only the
+# SCRIPT KILL and SHUTDOWN NOSAVE commands are available. The first can be
+# used to stop a script that did not yet call any write commands. The second
+# is the only way to shut down the server in the case a write command was
+# already issued by the script but the user doesn't want to wait for the natural
+# termination of the script.
+#
+# Set it to 0 or a negative value for unlimited execution without warnings.
+lua-time-limit 5000
+
+################################ REDIS CLUSTER  ###############################
+
+# Normal Redis instances can't be part of a Redis Cluster; only nodes that are
+# started as cluster nodes can. In order to start a Redis instance as a
+# cluster node enable the cluster support uncommenting the following:
+#
+# cluster-enabled yes
+
+# Every cluster node has a cluster configuration file. This file is not
+# intended to be edited by hand. It is created and updated by Redis nodes.
+# Every Redis Cluster node requires a different cluster configuration file.
+# Make sure that instances running in the same system do not have
+# overlapping cluster configuration file names.
+#
+# cluster-config-file nodes-6379.conf
+
+# Cluster node timeout is the amount of milliseconds a node must be unreachable
+# for it to be considered in failure state.
+# Most other internal time limits are a multiple of the node timeout.
+#
+# cluster-node-timeout 15000
+
+# A replica of a failing master will avoid to start a failover if its data
+# looks too old.
+#
+# There is no simple way for a replica to actually have an exact measure of
+# its "data age", so the following two checks are performed:
+#
+# 1) If there are multiple replicas able to failover, they exchange messages
+#    in order to try to give an advantage to the replica with the best
+#    replication offset (more data from the master processed).
+#    Replicas will try to get their rank by offset, and apply to the start
+#    of the failover a delay proportional to their rank.
+#
+# 2) Every single replica computes the time of the last interaction with
+#    its master. This can be the last ping or command received (if the master
+#    is still in the "connected" state), or the time that elapsed since the
+#    disconnection with the master (if the replication link is currently down).
+#    If the last interaction is too old, the replica will not try to failover
+#    at all.
+#
+# The point "2" can be tuned by user. Specifically a replica will not perform
+# the failover if, since the last interaction with the master, the time
+# elapsed is greater than:
+#
+#   (node-timeout * cluster-replica-validity-factor) + repl-ping-replica-period
+#
+# So for example if node-timeout is 30 seconds, and the cluster-replica-validity-factor
+# is 10, and assuming a default repl-ping-replica-period of 10 seconds, the
+# replica will not try to failover if it was not able to talk with the master
+# for longer than 310 seconds.
+#
+# A large cluster-replica-validity-factor may allow replicas with too old data to failover
+# a master, while a too small value may prevent the cluster from being able to
+# elect a replica at all.
+#
+# For maximum availability, it is possible to set the cluster-replica-validity-factor
+# to a value of 0, which means, that replicas will always try to failover the
+# master regardless of the last time they interacted with the master.
+# (However they'll always try to apply a delay proportional to their
+# offset rank).
+#
+# Zero is the only value able to guarantee that when all the partitions heal
+# the cluster will always be able to continue.
+#
+# cluster-replica-validity-factor 10
+
+# Cluster replicas are able to migrate to orphaned masters, that are masters
+# that are left without working replicas. This improves the cluster ability
+# to resist to failures as otherwise an orphaned master can't be failed over
+# in case of failure if it has no working replicas.
+#
+# Replicas migrate to orphaned masters only if there are still at least a
+# given number of other working replicas for their old master. This number
+# is the "migration barrier". A migration barrier of 1 means that a replica
+# will migrate only if there is at least 1 other working replica for its master
+# and so forth. It usually reflects the number of replicas you want for every
+# master in your cluster.
+#
+# Default is 1 (replicas migrate only if their masters remain with at least
+# one replica). To disable migration just set it to a very large value or
+# set cluster-allow-replica-migration to 'no'.
+# A value of 0 can be set but is useful only for debugging and dangerous
+# in production.
+#
+# cluster-migration-barrier 1
+
+# Turning off this option allows to use less automatic cluster configuration.
+# It both disables migration to orphaned masters and migration from masters
+# that became empty.
+#
+# Default is 'yes' (allow automatic migrations).
+#
+# cluster-allow-replica-migration yes
+
+# By default Redis Cluster nodes stop accepting queries if they detect there
+# is at least a hash slot uncovered (no available node is serving it).
+# This way if the cluster is partially down (for example a range of hash slots
+# are no longer covered) all the cluster becomes, eventually, unavailable.
+# It automatically returns available as soon as all the slots are covered again.
+#
+# However sometimes you want the subset of the cluster which is working,
+# to continue to accept queries for the part of the key space that is still
+# covered. In order to do so, just set the cluster-require-full-coverage
+# option to no.
+#
+# cluster-require-full-coverage yes
+
+# This option, when set to yes, prevents replicas from trying to failover its
+# master during master failures. However the replica can still perform a
+# manual failover, if forced to do so.
+#
+# This is useful in different scenarios, especially in the case of multiple
+# data center operations, where we want one side to never be promoted if not
+# in the case of a total DC failure.
+#
+# cluster-replica-no-failover no
+
+# This option, when set to yes, allows nodes to serve read traffic while the
+# the cluster is in a down state, as long as it believes it owns the slots. 
+#
+# This is useful for two cases.  The first case is for when an application 
+# doesn't require consistency of data during node failures or network partitions.
+# One example of this is a cache, where as long as the node has the data it
+# should be able to serve it. 
+#
+# The second use case is for configurations that don't meet the recommended  
+# three shards but want to enable cluster mode and scale later. A 
+# master outage in a 1 or 2 shard configuration causes a read/write outage to the
+# entire cluster without this option set, with it set there is only a write outage.
+# Without a quorum of masters, slot ownership will not change automatically. 
+#
+# cluster-allow-reads-when-down no
+
+# In order to setup your cluster make sure to read the documentation
+# available at https://redis.io web site.
+
+########################## CLUSTER DOCKER/NAT support  ########################
+
+# In certain deployments, Redis Cluster nodes address discovery fails, because
+# addresses are NAT-ted or because ports are forwarded (the typical case is
+# Docker and other containers).
+#
+# In order to make Redis Cluster working in such environments, a static
+# configuration where each node knows its public address is needed. The
+# following four options are used for this scope, and are:
+#
+# * cluster-announce-ip
+# * cluster-announce-port
+# * cluster-announce-tls-port
+# * cluster-announce-bus-port
+#
+# Each instructs the node about its address, client ports (for connections
+# without and with TLS) and cluster message bus port. The information is then
+# published in the header of the bus packets so that other nodes will be able to
+# correctly map the address of the node publishing the information.
+#
+# If cluster-tls is set to yes and cluster-announce-tls-port is omitted or set
+# to zero, then cluster-announce-port refers to the TLS port. Note also that
+# cluster-announce-tls-port has no effect if cluster-tls is set to no.
+#
+# If the above options are not used, the normal Redis Cluster auto-detection
+# will be used instead.
+#
+# Note that when remapped, the bus port may not be at the fixed offset of
+# clients port + 10000, so you can specify any port and bus-port depending
+# on how they get remapped. If the bus-port is not set, a fixed offset of
+# 10000 will be used as usual.
+#
+# Example:
+#
+# cluster-announce-ip 10.1.1.5
+# cluster-announce-tls-port 6379
+# cluster-announce-port 0
+# cluster-announce-bus-port 6380
+
+################################## SLOW LOG ###################################
+
+# The Redis Slow Log is a system to log queries that exceeded a specified
+# execution time. The execution time does not include the I/O operations
+# like talking with the client, sending the reply and so forth,
+# but just the time needed to actually execute the command (this is the only
+# stage of command execution where the thread is blocked and can not serve
+# other requests in the meantime).
+#
+# You can configure the slow log with two parameters: one tells Redis
+# what is the execution time, in microseconds, to exceed in order for the
+# command to get logged, and the other parameter is the length of the
+# slow log. When a new command is logged the oldest one is removed from the
+# queue of logged commands.
+
+# The following time is expressed in microseconds, so 1000000 is equivalent
+# to one second. Note that a negative number disables the slow log, while
+# a value of zero forces the logging of every command.
+slowlog-log-slower-than 10000
+
+# There is no limit to this length. Just be aware that it will consume memory.
+# You can reclaim memory used by the slow log with SLOWLOG RESET.
+slowlog-max-len 128
+
+################################ LATENCY MONITOR ##############################
+
+# The Redis latency monitoring subsystem samples different operations
+# at runtime in order to collect data related to possible sources of
+# latency of a Redis instance.
+#
+# Via the LATENCY command this information is available to the user that can
+# print graphs and obtain reports.
+#
+# The system only logs operations that were performed in a time equal or
+# greater than the amount of milliseconds specified via the
+# latency-monitor-threshold configuration directive. When its value is set
+# to zero, the latency monitor is turned off.
+#
+# By default latency monitoring is disabled since it is mostly not needed
+# if you don't have latency issues, and collecting data has a performance
+# impact, that while very small, can be measured under big load. Latency
+# monitoring can easily be enabled at runtime using the command
+# "CONFIG SET latency-monitor-threshold <milliseconds>" if needed.
+latency-monitor-threshold 0
+
+############################# EVENT NOTIFICATION ##############################
+
+# Redis can notify Pub/Sub clients about events happening in the key space.
+# This feature is documented at https://redis.io/topics/notifications
+#
+# For instance if keyspace events notification is enabled, and a client
+# performs a DEL operation on key "foo" stored in the Database 0, two
+# messages will be published via Pub/Sub:
+#
+# PUBLISH __keyspace@0__:foo del
+# PUBLISH __keyevent@0__:del foo
+#
+# It is possible to select the events that Redis will notify among a set
+# of classes. Every class is identified by a single character:
+#
+#  K     Keyspace events, published with __keyspace@<db>__ prefix.
+#  E     Keyevent events, published with __keyevent@<db>__ prefix.
+#  g     Generic commands (non-type specific) like DEL, EXPIRE, RENAME, ...
+#  $     String commands
+#  l     List commands
+#  s     Set commands
+#  h     Hash commands
+#  z     Sorted set commands
+#  x     Expired events (events generated every time a key expires)
+#  e     Evicted events (events generated when a key is evicted for maxmemory)
+#  t     Stream commands
+#  d     Module key type events
+#  m     Key-miss events (Note: It is not included in the 'A' class)
+#  A     Alias for g$lshzxetd, so that the "AKE" string means all the events
+#        (Except key-miss events which are excluded from 'A' due to their
+#         unique nature).
+#
+#  The "notify-keyspace-events" takes as argument a string that is composed
+#  of zero or multiple characters. The empty string means that notifications
+#  are disabled.
+#
+#  Example: to enable list and generic events, from the point of view of the
+#           event name, use:
+#
+#  notify-keyspace-events Elg
+#
+#  Example 2: to get the stream of the expired keys subscribing to channel
+#             name __keyevent@0__:expired use:
+#
+#  notify-keyspace-events Ex
+#
+#  By default all notifications are disabled because most users don't need
+#  this feature and the feature has some overhead. Note that if you don't
+#  specify at least one of K or E, no events will be delivered.
+notify-keyspace-events ""
+
+############################### GOPHER SERVER #################################
+
+# Redis contains an implementation of the Gopher protocol, as specified in
+# the RFC 1436 (https://www.ietf.org/rfc/rfc1436.txt).
+#
+# The Gopher protocol was very popular in the late '90s. It is an alternative
+# to the web, and the implementation both server and client side is so simple
+# that the Redis server has just 100 lines of code in order to implement this
+# support.
+#
+# What do you do with Gopher nowadays? Well Gopher never *really* died, and
+# lately there is a movement in order for the Gopher more hierarchical content
+# composed of just plain text documents to be resurrected. Some want a simpler
+# internet, others believe that the mainstream internet became too much
+# controlled, and it's cool to create an alternative space for people that
+# want a bit of fresh air.
+#
+# Anyway for the 10nth birthday of the Redis, we gave it the Gopher protocol
+# as a gift.
+#
+# --- HOW IT WORKS? ---
+#
+# The Redis Gopher support uses the inline protocol of Redis, and specifically
+# two kind of inline requests that were anyway illegal: an empty request
+# or any request that starts with "/" (there are no Redis commands starting
+# with such a slash). Normal RESP2/RESP3 requests are completely out of the
+# path of the Gopher protocol implementation and are served as usual as well.
+#
+# If you open a connection to Redis when Gopher is enabled and send it
+# a string like "/foo", if there is a key named "/foo" it is served via the
+# Gopher protocol.
+#
+# In order to create a real Gopher "hole" (the name of a Gopher site in Gopher
+# talking), you likely need a script like the following:
+#
+#   https://github.com/antirez/gopher2redis
+#
+# --- SECURITY WARNING ---
+#
+# If you plan to put Redis on the internet in a publicly accessible address
+# to server Gopher pages MAKE SURE TO SET A PASSWORD to the instance.
+# Once a password is set:
+#
+#   1. The Gopher server (when enabled, not by default) will still serve
+#      content via Gopher.
+#   2. However other commands cannot be called before the client will
+#      authenticate.
+#
+# So use the 'requirepass' option to protect your instance.
+#
+# Note that Gopher is not currently supported when 'io-threads-do-reads'
+# is enabled.
+#
+# To enable Gopher support, uncomment the following line and set the option
+# from no (the default) to yes.
+#
+# gopher-enabled no
+
+############################### ADVANCED CONFIG ###############################
+
+# Hashes are encoded using a memory efficient data structure when they have a
+# small number of entries, and the biggest entry does not exceed a given
+# threshold. These thresholds can be configured using the following directives.
+hash-max-ziplist-entries 512
+hash-max-ziplist-value 64
+
+# Lists are also encoded in a special way to save a lot of space.
+# The number of entries allowed per internal list node can be specified
+# as a fixed maximum size or a maximum number of elements.
+# For a fixed maximum size, use -5 through -1, meaning:
+# -5: max size: 64 Kb  <-- not recommended for normal workloads
+# -4: max size: 32 Kb  <-- not recommended
+# -3: max size: 16 Kb  <-- probably not recommended
+# -2: max size: 8 Kb   <-- good
+# -1: max size: 4 Kb   <-- good
+# Positive numbers mean store up to _exactly_ that number of elements
+# per list node.
+# The highest performing option is usually -2 (8 Kb size) or -1 (4 Kb size),
+# but if your use case is unique, adjust the settings as necessary.
+list-max-ziplist-size -2
+
+# Lists may also be compressed.
+# Compress depth is the number of quicklist ziplist nodes from *each* side of
+# the list to *exclude* from compression.  The head and tail of the list
+# are always uncompressed for fast push/pop operations.  Settings are:
+# 0: disable all list compression
+# 1: depth 1 means "don't start compressing until after 1 node into the list,
+#    going from either the head or tail"
+#    So: [head]->node->node->...->node->[tail]
+#    [head], [tail] will always be uncompressed; inner nodes will compress.
+# 2: [head]->[next]->node->node->...->node->[prev]->[tail]
+#    2 here means: don't compress head or head->next or tail->prev or tail,
+#    but compress all nodes between them.
+# 3: [head]->[next]->[next]->node->node->...->node->[prev]->[prev]->[tail]
+# etc.
+list-compress-depth 0
+
+# Sets have a special encoding in just one case: when a set is composed
+# of just strings that happen to be integers in radix 10 in the range
+# of 64 bit signed integers.
+# The following configuration setting sets the limit in the size of the
+# set in order to use this special memory saving encoding.
+set-max-intset-entries 512
+
+# Similarly to hashes and lists, sorted sets are also specially encoded in
+# order to save a lot of space. This encoding is only used when the length and
+# elements of a sorted set are below the following limits:
+zset-max-ziplist-entries 128
+zset-max-ziplist-value 64
+
+# HyperLogLog sparse representation bytes limit. The limit includes the
+# 16 bytes header. When an HyperLogLog using the sparse representation crosses
+# this limit, it is converted into the dense representation.
+#
+# A value greater than 16000 is totally useless, since at that point the
+# dense representation is more memory efficient.
+#
+# The suggested value is ~ 3000 in order to have the benefits of
+# the space efficient encoding without slowing down too much PFADD,
+# which is O(N) with the sparse encoding. The value can be raised to
+# ~ 10000 when CPU is not a concern, but space is, and the data set is
+# composed of many HyperLogLogs with cardinality in the 0 - 15000 range.
+hll-sparse-max-bytes 3000
+
+# Streams macro node max size / items. The stream data structure is a radix
+# tree of big nodes that encode multiple items inside. Using this configuration
+# it is possible to configure how big a single node can be in bytes, and the
+# maximum number of items it may contain before switching to a new node when
+# appending new stream entries. If any of the following settings are set to
+# zero, the limit is ignored, so for instance it is possible to set just a
+# max entries limit by setting max-bytes to 0 and max-entries to the desired
+# value.
+stream-node-max-bytes 4096
+stream-node-max-entries 100
+
+# Active rehashing uses 1 millisecond every 100 milliseconds of CPU time in
+# order to help rehashing the main Redis hash table (the one mapping top-level
+# keys to values). The hash table implementation Redis uses (see dict.c)
+# performs a lazy rehashing: the more operation you run into a hash table
+# that is rehashing, the more rehashing "steps" are performed, so if the
+# server is idle the rehashing is never complete and some more memory is used
+# by the hash table.
+#
+# The default is to use this millisecond 10 times every second in order to
+# actively rehash the main dictionaries, freeing memory when possible.
+#
+# If unsure:
+# use "activerehashing no" if you have hard latency requirements and it is
+# not a good thing in your environment that Redis can reply from time to time
+# to queries with 2 milliseconds delay.
+#
+# use "activerehashing yes" if you don't have such hard requirements but
+# want to free memory asap when possible.
+activerehashing yes
+
+# The client output buffer limits can be used to force disconnection of clients
+# that are not reading data from the server fast enough for some reason (a
+# common reason is that a Pub/Sub client can't consume messages as fast as the
+# publisher can produce them).
+#
+# The limit can be set differently for the three different classes of clients:
+#
+# normal -> normal clients including MONITOR clients
+# replica  -> replica clients
+# pubsub -> clients subscribed to at least one pubsub channel or pattern
+#
+# The syntax of every client-output-buffer-limit directive is the following:
+#
+# client-output-buffer-limit <class> <hard limit> <soft limit> <soft seconds>
+#
+# A client is immediately disconnected once the hard limit is reached, or if
+# the soft limit is reached and remains reached for the specified number of
+# seconds (continuously).
+# So for instance if the hard limit is 32 megabytes and the soft limit is
+# 16 megabytes / 10 seconds, the client will get disconnected immediately
+# if the size of the output buffers reach 32 megabytes, but will also get
+# disconnected if the client reaches 16 megabytes and continuously overcomes
+# the limit for 10 seconds.
+#
+# By default normal clients are not limited because they don't receive data
+# without asking (in a push way), but just after a request, so only
+# asynchronous clients may create a scenario where data is requested faster
+# than it can read.
+#
+# Instead there is a default limit for pubsub and replica clients, since
+# subscribers and replicas receive data in a push fashion.
+#
+# Both the hard or the soft limit can be disabled by setting them to zero.
+client-output-buffer-limit normal 0 0 0
+client-output-buffer-limit replica 256mb 64mb 60
+client-output-buffer-limit pubsub 32mb 8mb 60
+
+# Client query buffers accumulate new commands. They are limited to a fixed
+# amount by default in order to avoid that a protocol desynchronization (for
+# instance due to a bug in the client) will lead to unbound memory usage in
+# the query buffer. However you can configure it here if you have very special
+# needs, such us huge multi/exec requests or alike.
+#
+# client-query-buffer-limit 1gb
+
+# In the Redis protocol, bulk requests, that are, elements representing single
+# strings, are normally limited to 512 mb. However you can change this limit
+# here, but must be 1mb or greater
+#
+# proto-max-bulk-len 512mb
+
+# Redis calls an internal function to perform many background tasks, like
+# closing connections of clients in timeout, purging expired keys that are
+# never requested, and so forth.
+#
+# Not all tasks are performed with the same frequency, but Redis checks for
+# tasks to perform according to the specified "hz" value.
+#
+# By default "hz" is set to 10. Raising the value will use more CPU when
+# Redis is idle, but at the same time will make Redis more responsive when
+# there are many keys expiring at the same time, and timeouts may be
+# handled with more precision.
+#
+# The range is between 1 and 500, however a value over 100 is usually not
+# a good idea. Most users should use the default of 10 and raise this up to
+# 100 only in environments where very low latency is required.
+hz 10
+
+# Normally it is useful to have an HZ value which is proportional to the
+# number of clients connected. This is useful in order, for instance, to
+# avoid too many clients are processed for each background task invocation
+# in order to avoid latency spikes.
+#
+# Since the default HZ value by default is conservatively set to 10, Redis
+# offers, and enables by default, the ability to use an adaptive HZ value
+# which will temporarily raise when there are many connected clients.
+#
+# When dynamic HZ is enabled, the actual configured HZ will be used
+# as a baseline, but multiples of the configured HZ value will be actually
+# used as needed once more clients are connected. In this way an idle
+# instance will use very little CPU time while a busy instance will be
+# more responsive.
+dynamic-hz yes
+
+# When a child rewrites the AOF file, if the following option is enabled
+# the file will be fsync-ed every 32 MB of data generated. This is useful
+# in order to commit the file to the disk more incrementally and avoid
+# big latency spikes.
+aof-rewrite-incremental-fsync yes
+
+# When redis saves RDB file, if the following option is enabled
+# the file will be fsync-ed every 32 MB of data generated. This is useful
+# in order to commit the file to the disk more incrementally and avoid
+# big latency spikes.
+rdb-save-incremental-fsync yes
+
+# Redis LFU eviction (see maxmemory setting) can be tuned. However it is a good
+# idea to start with the default settings and only change them after investigating
+# how to improve the performances and how the keys LFU change over time, which
+# is possible to inspect via the OBJECT FREQ command.
+#
+# There are two tunable parameters in the Redis LFU implementation: the
+# counter logarithm factor and the counter decay time. It is important to
+# understand what the two parameters mean before changing them.
+#
+# The LFU counter is just 8 bits per key, it's maximum value is 255, so Redis
+# uses a probabilistic increment with logarithmic behavior. Given the value
+# of the old counter, when a key is accessed, the counter is incremented in
+# this way:
+#
+# 1. A random number R between 0 and 1 is extracted.
+# 2. A probability P is calculated as 1/(old_value*lfu_log_factor+1).
+# 3. The counter is incremented only if R < P.
+#
+# The default lfu-log-factor is 10. This is a table of how the frequency
+# counter changes with a different number of accesses with different
+# logarithmic factors:
+#
+# +--------+------------+------------+------------+------------+------------+
+# | factor | 100 hits   | 1000 hits  | 100K hits  | 1M hits    | 10M hits   |
+# +--------+------------+------------+------------+------------+------------+
+# | 0      | 104        | 255        | 255        | 255        | 255        |
+# +--------+------------+------------+------------+------------+------------+
+# | 1      | 18         | 49         | 255        | 255        | 255        |
+# +--------+------------+------------+------------+------------+------------+
+# | 10     | 10         | 18         | 142        | 255        | 255        |
+# +--------+------------+------------+------------+------------+------------+
+# | 100    | 8          | 11         | 49         | 143        | 255        |
+# +--------+------------+------------+------------+------------+------------+
+#
+# NOTE: The above table was obtained by running the following commands:
+#
+#   redis-benchmark -n 1000000 incr foo
+#   redis-cli object freq foo
+#
+# NOTE 2: The counter initial value is 5 in order to give new objects a chance
+# to accumulate hits.
+#
+# The counter decay time is the time, in minutes, that must elapse in order
+# for the key counter to be divided by two (or decremented if it has a value
+# less <= 10).
+#
+# The default value for the lfu-decay-time is 1. A special value of 0 means to
+# decay the counter every time it happens to be scanned.
+#
+# lfu-log-factor 10
+# lfu-decay-time 1
+
+########################### ACTIVE DEFRAGMENTATION #######################
+#
+# What is active defragmentation?
+# -------------------------------
+#
+# Active (online) defragmentation allows a Redis server to compact the
+# spaces left between small allocations and deallocations of data in memory,
+# thus allowing to reclaim back memory.
+#
+# Fragmentation is a natural process that happens with every allocator (but
+# less so with Jemalloc, fortunately) and certain workloads. Normally a server
+# restart is needed in order to lower the fragmentation, or at least to flush
+# away all the data and create it again. However thanks to this feature
+# implemented by Oran Agra for Redis 4.0 this process can happen at runtime
+# in a "hot" way, while the server is running.
+#
+# Basically when the fragmentation is over a certain level (see the
+# configuration options below) Redis will start to create new copies of the
+# values in contiguous memory regions by exploiting certain specific Jemalloc
+# features (in order to understand if an allocation is causing fragmentation
+# and to allocate it in a better place), and at the same time, will release the
+# old copies of the data. This process, repeated incrementally for all the keys
+# will cause the fragmentation to drop back to normal values.
+#
+# Important things to understand:
+#
+# 1. This feature is disabled by default, and only works if you compiled Redis
+#    to use the copy of Jemalloc we ship with the source code of Redis.
+#    This is the default with Linux builds.
+#
+# 2. You never need to enable this feature if you don't have fragmentation
+#    issues.
+#
+# 3. Once you experience fragmentation, you can enable this feature when
+#    needed with the command "CONFIG SET activedefrag yes".
+#
+# The configuration parameters are able to fine tune the behavior of the
+# defragmentation process. If you are not sure about what they mean it is
+# a good idea to leave the defaults untouched.
+
+# Enabled active defragmentation
+# activedefrag no
+
+# Minimum amount of fragmentation waste to start active defrag
+# active-defrag-ignore-bytes 100mb
+
+# Minimum percentage of fragmentation to start active defrag
+# active-defrag-threshold-lower 10
+
+# Maximum percentage of fragmentation at which we use maximum effort
+# active-defrag-threshold-upper 100
+
+# Minimal effort for defrag in CPU percentage, to be used when the lower
+# threshold is reached
+# active-defrag-cycle-min 1
+
+# Maximal effort for defrag in CPU percentage, to be used when the upper
+# threshold is reached
+# active-defrag-cycle-max 25
+
+# Maximum number of set/hash/zset/list fields that will be processed from
+# the main dictionary scan
+# active-defrag-max-scan-fields 1000
+
+# Jemalloc background thread for purging will be enabled by default
+jemalloc-bg-thread yes
+
+# It is possible to pin different threads and processes of Redis to specific
+# CPUs in your system, in order to maximize the performances of the server.
+# This is useful both in order to pin different Redis threads in different
+# CPUs, but also in order to make sure that multiple Redis instances running
+# in the same host will be pinned to different CPUs.
+#
+# Normally you can do this using the "taskset" command, however it is also
+# possible to this via Redis configuration directly, both in Linux and FreeBSD.
+#
+# You can pin the server/IO threads, bio threads, aof rewrite child process, and
+# the bgsave child process. The syntax to specify the cpu list is the same as
+# the taskset command:
+#
+# Set redis server/io threads to cpu affinity 0,2,4,6:
+# server_cpulist 0-7:2
+#
+# Set bio threads to cpu affinity 1,3:
+# bio_cpulist 1,3
+#
+# Set aof rewrite child process to cpu affinity 8,9,10,11:
+# aof_rewrite_cpulist 8-11
+#
+# Set bgsave child process to cpu affinity 1,10,11
+# bgsave_cpulist 1,10-11
+
+# In some cases redis will emit warnings and even refuse to start if it detects
+# that the system is in bad state, it is possible to suppress these warnings
+# by setting the following config which takes a space delimited list of warnings
+# to suppress
+#
+# ignore-warnings ARM64-COW-BUG
diff --git a/redis-stable/runtest b/redis-stable/runtest
new file mode 100755
index 00000000..ade1bd09
--- /dev/null
+++ b/redis-stable/runtest
@@ -0,0 +1,14 @@
+#!/bin/sh
+TCL_VERSIONS="8.5 8.6"
+TCLSH=""
+
+for VERSION in $TCL_VERSIONS; do
+	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
+done
+
+if [ -z $TCLSH ]
+then
+    echo "You need tcl 8.5 or newer in order to run the Redis test"
+    exit 1
+fi
+$TCLSH tests/test_helper.tcl "${@}"
diff --git a/redis-stable/runtest-cluster b/redis-stable/runtest-cluster
new file mode 100755
index 00000000..a86e9314
--- /dev/null
+++ b/redis-stable/runtest-cluster
@@ -0,0 +1,14 @@
+#!/bin/sh
+TCL_VERSIONS="8.5 8.6"
+TCLSH=""
+
+for VERSION in $TCL_VERSIONS; do
+	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
+done
+
+if [ -z $TCLSH ]
+then
+    echo "You need tcl 8.5 or newer in order to run the Redis Cluster test"
+    exit 1
+fi
+$TCLSH tests/cluster/run.tcl $*
diff --git a/redis-stable/runtest-moduleapi b/redis-stable/runtest-moduleapi
new file mode 100755
index 00000000..56d14960
--- /dev/null
+++ b/redis-stable/runtest-moduleapi
@@ -0,0 +1,39 @@
+#!/bin/sh
+TCL_VERSIONS="8.5 8.6"
+TCLSH=""
+[ -z "$MAKE" ] && MAKE=make
+
+for VERSION in $TCL_VERSIONS; do
+	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
+done
+
+if [ -z $TCLSH ]
+then
+    echo "You need tcl 8.5 or newer in order to run the Redis ModuleApi test"
+    exit 1
+fi
+
+$MAKE -C tests/modules && \
+$TCLSH tests/test_helper.tcl \
+--single unit/moduleapi/commandfilter \
+--single unit/moduleapi/basics \
+--single unit/moduleapi/fork \
+--single unit/moduleapi/testrdb \
+--single unit/moduleapi/infotest \
+--single unit/moduleapi/propagate \
+--single unit/moduleapi/hooks \
+--single unit/moduleapi/misc \
+--single unit/moduleapi/blockonkeys \
+--single unit/moduleapi/blockonbackground \
+--single unit/moduleapi/scan \
+--single unit/moduleapi/datatype \
+--single unit/moduleapi/auth \
+--single unit/moduleapi/keyspace_events \
+--single unit/moduleapi/blockedclient \
+--single unit/moduleapi/getkeys \
+--single unit/moduleapi/test_lazyfree \
+--single unit/moduleapi/defrag \
+--single unit/moduleapi/hash \
+--single unit/moduleapi/zset \
+--single unit/moduleapi/stream \
+"${@}"
diff --git a/redis-stable/runtest-sentinel b/redis-stable/runtest-sentinel
new file mode 100755
index 00000000..3fb1ef61
--- /dev/null
+++ b/redis-stable/runtest-sentinel
@@ -0,0 +1,14 @@
+#!/bin/sh
+TCL_VERSIONS="8.5 8.6"
+TCLSH=""
+
+for VERSION in $TCL_VERSIONS; do
+	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
+done
+
+if [ -z $TCLSH ]
+then
+    echo "You need tcl 8.5 or newer in order to run the Redis Sentinel test"
+    exit 1
+fi
+$TCLSH tests/sentinel/run.tcl $*
diff --git a/redis-stable/sentinel.conf b/redis-stable/sentinel.conf
new file mode 100644
index 00000000..8647379d
--- /dev/null
+++ b/redis-stable/sentinel.conf
@@ -0,0 +1,341 @@
+# Example sentinel.conf
+
+# *** IMPORTANT ***
+#
+# By default Sentinel will not be reachable from interfaces different than
+# localhost, either use the 'bind' directive to bind to a list of network
+# interfaces, or disable protected mode with "protected-mode no" by
+# adding it to this configuration file.
+#
+# Before doing that MAKE SURE the instance is protected from the outside
+# world via firewalling or other means.
+#
+# For example you may use one of the following:
+#
+# bind 127.0.0.1 192.168.1.1
+#
+# protected-mode no
+
+# port <sentinel-port>
+# The port that this sentinel instance will run on
+port 26379
+
+# By default Redis Sentinel does not run as a daemon. Use 'yes' if you need it.
+# Note that Redis will write a pid file in /var/run/redis-sentinel.pid when
+# daemonized.
+daemonize no
+
+# When running daemonized, Redis Sentinel writes a pid file in
+# /var/run/redis-sentinel.pid by default. You can specify a custom pid file
+# location here.
+pidfile /var/run/redis-sentinel.pid
+
+# Specify the log file name. Also the empty string can be used to force
+# Sentinel to log on the standard output. Note that if you use standard
+# output for logging but daemonize, logs will be sent to /dev/null
+logfile ""
+
+# sentinel announce-ip <ip>
+# sentinel announce-port <port>
+#
+# The above two configuration directives are useful in environments where,
+# because of NAT, Sentinel is reachable from outside via a non-local address.
+#
+# When announce-ip is provided, the Sentinel will claim the specified IP address
+# in HELLO messages used to gossip its presence, instead of auto-detecting the
+# local address as it usually does.
+#
+# Similarly when announce-port is provided and is valid and non-zero, Sentinel
+# will announce the specified TCP port.
+#
+# The two options don't need to be used together, if only announce-ip is
+# provided, the Sentinel will announce the specified IP and the server port
+# as specified by the "port" option. If only announce-port is provided, the
+# Sentinel will announce the auto-detected local IP and the specified port.
+#
+# Example:
+#
+# sentinel announce-ip 1.2.3.4
+
+# dir <working-directory>
+# Every long running process should have a well-defined working directory.
+# For Redis Sentinel to chdir to /tmp at startup is the simplest thing
+# for the process to don't interfere with administrative tasks such as
+# unmounting filesystems.
+dir /tmp
+
+# sentinel monitor <master-name> <ip> <redis-port> <quorum>
+#
+# Tells Sentinel to monitor this master, and to consider it in O_DOWN
+# (Objectively Down) state only if at least <quorum> sentinels agree.
+#
+# Note that whatever is the ODOWN quorum, a Sentinel will require to
+# be elected by the majority of the known Sentinels in order to
+# start a failover, so no failover can be performed in minority.
+#
+# Replicas are auto-discovered, so you don't need to specify replicas in
+# any way. Sentinel itself will rewrite this configuration file adding
+# the replicas using additional configuration options.
+# Also note that the configuration file is rewritten when a
+# replica is promoted to master.
+#
+# Note: master name should not include special characters or spaces.
+# The valid charset is A-z 0-9 and the three characters ".-_".
+sentinel monitor mymaster 127.0.0.1 6379 2
+
+# sentinel auth-pass <master-name> <password>
+#
+# Set the password to use to authenticate with the master and replicas.
+# Useful if there is a password set in the Redis instances to monitor.
+#
+# Note that the master password is also used for replicas, so it is not
+# possible to set a different password in masters and replicas instances
+# if you want to be able to monitor these instances with Sentinel.
+#
+# However you can have Redis instances without the authentication enabled
+# mixed with Redis instances requiring the authentication (as long as the
+# password set is the same for all the instances requiring the password) as
+# the AUTH command will have no effect in Redis instances with authentication
+# switched off.
+#
+# Example:
+#
+# sentinel auth-pass mymaster MySUPER--secret-0123passw0rd
+
+# sentinel auth-user <master-name> <username>
+#
+# This is useful in order to authenticate to instances having ACL capabilities,
+# that is, running Redis 6.0 or greater. When just auth-pass is provided the
+# Sentinel instance will authenticate to Redis using the old "AUTH <pass>"
+# method. When also an username is provided, it will use "AUTH <user> <pass>".
+# In the Redis servers side, the ACL to provide just minimal access to
+# Sentinel instances, should be configured along the following lines:
+#
+#     user sentinel-user >somepassword +client +subscribe +publish \
+#                        +ping +info +multi +slaveof +config +client +exec on
+
+# sentinel down-after-milliseconds <master-name> <milliseconds>
+#
+# Number of milliseconds the master (or any attached replica or sentinel) should
+# be unreachable (as in, not acceptable reply to PING, continuously, for the
+# specified period) in order to consider it in S_DOWN state (Subjectively
+# Down).
+#
+# Default is 30 seconds.
+sentinel down-after-milliseconds mymaster 30000
+
+# IMPORTANT NOTE: starting with Redis 6.2 ACL capability is supported for
+# Sentinel mode, please refer to the Redis website https://redis.io/topics/acl
+# for more details.
+
+# Sentinel's ACL users are defined in the following format:
+#
+#   user <username> ... acl rules ...
+#
+# For example:
+#
+#   user worker +@admin +@connection ~* on >ffa9203c493aa99
+#
+# For more information about ACL configuration please refer to the Redis
+# website at https://redis.io/topics/acl and redis server configuration 
+# template redis.conf.
+
+# ACL LOG
+#
+# The ACL Log tracks failed commands and authentication events associated
+# with ACLs. The ACL Log is useful to troubleshoot failed commands blocked 
+# by ACLs. The ACL Log is stored in memory. You can reclaim memory with 
+# ACL LOG RESET. Define the maximum entry length of the ACL Log below.
+acllog-max-len 128
+
+# Using an external ACL file
+#
+# Instead of configuring users here in this file, it is possible to use
+# a stand-alone file just listing users. The two methods cannot be mixed:
+# if you configure users here and at the same time you activate the external
+# ACL file, the server will refuse to start.
+#
+# The format of the external ACL user file is exactly the same as the
+# format that is used inside redis.conf to describe users.
+#
+# aclfile /etc/redis/sentinel-users.acl
+
+# requirepass <password>
+#
+# You can configure Sentinel itself to require a password, however when doing
+# so Sentinel will try to authenticate with the same password to all the
+# other Sentinels. So you need to configure all your Sentinels in a given
+# group with the same "requirepass" password. Check the following documentation
+# for more info: https://redis.io/topics/sentinel
+#
+# IMPORTANT NOTE: starting with Redis 6.2 "requirepass" is a compatibility
+# layer on top of the ACL system. The option effect will be just setting
+# the password for the default user. Clients will still authenticate using
+# AUTH <password> as usually, or more explicitly with AUTH default <password>
+# if they follow the new protocol: both will work.
+#
+# New config files are advised to use separate authentication control for
+# incoming connections (via ACL), and for outgoing connections (via
+# sentinel-user and sentinel-pass) 
+#
+# The requirepass is not compatable with aclfile option and the ACL LOAD
+# command, these will cause requirepass to be ignored.
+
+# sentinel sentinel-user <username>
+#
+# You can configure Sentinel to authenticate with other Sentinels with specific
+# user name. 
+
+# sentinel sentinel-pass <password>
+#
+# The password for Sentinel to authenticate with other Sentinels. If sentinel-user
+# is not configured, Sentinel will use 'default' user with sentinel-pass to authenticate.
+
+# sentinel parallel-syncs <master-name> <numreplicas>
+#
+# How many replicas we can reconfigure to point to the new replica simultaneously
+# during the failover. Use a low number if you use the replicas to serve query
+# to avoid that all the replicas will be unreachable at about the same
+# time while performing the synchronization with the master.
+sentinel parallel-syncs mymaster 1
+
+# sentinel failover-timeout <master-name> <milliseconds>
+#
+# Specifies the failover timeout in milliseconds. It is used in many ways:
+#
+# - The time needed to re-start a failover after a previous failover was
+#   already tried against the same master by a given Sentinel, is two
+#   times the failover timeout.
+#
+# - The time needed for a replica replicating to a wrong master according
+#   to a Sentinel current configuration, to be forced to replicate
+#   with the right master, is exactly the failover timeout (counting since
+#   the moment a Sentinel detected the misconfiguration).
+#
+# - The time needed to cancel a failover that is already in progress but
+#   did not produced any configuration change (SLAVEOF NO ONE yet not
+#   acknowledged by the promoted replica).
+#
+# - The maximum time a failover in progress waits for all the replicas to be
+#   reconfigured as replicas of the new master. However even after this time
+#   the replicas will be reconfigured by the Sentinels anyway, but not with
+#   the exact parallel-syncs progression as specified.
+#
+# Default is 3 minutes.
+sentinel failover-timeout mymaster 180000
+
+# SCRIPTS EXECUTION
+#
+# sentinel notification-script and sentinel reconfig-script are used in order
+# to configure scripts that are called to notify the system administrator
+# or to reconfigure clients after a failover. The scripts are executed
+# with the following rules for error handling:
+#
+# If script exits with "1" the execution is retried later (up to a maximum
+# number of times currently set to 10).
+#
+# If script exits with "2" (or an higher value) the script execution is
+# not retried.
+#
+# If script terminates because it receives a signal the behavior is the same
+# as exit code 1.
+#
+# A script has a maximum running time of 60 seconds. After this limit is
+# reached the script is terminated with a SIGKILL and the execution retried.
+
+# NOTIFICATION SCRIPT
+#
+# sentinel notification-script <master-name> <script-path>
+# 
+# Call the specified notification script for any sentinel event that is
+# generated in the WARNING level (for instance -sdown, -odown, and so forth).
+# This script should notify the system administrator via email, SMS, or any
+# other messaging system, that there is something wrong with the monitored
+# Redis systems.
+#
+# The script is called with just two arguments: the first is the event type
+# and the second the event description.
+#
+# The script must exist and be executable in order for sentinel to start if
+# this option is provided.
+#
+# Example:
+#
+# sentinel notification-script mymaster /var/redis/notify.sh
+
+# CLIENTS RECONFIGURATION SCRIPT
+#
+# sentinel client-reconfig-script <master-name> <script-path>
+#
+# When the master changed because of a failover a script can be called in
+# order to perform application-specific tasks to notify the clients that the
+# configuration has changed and the master is at a different address.
+# 
+# The following arguments are passed to the script:
+#
+# <master-name> <role> <state> <from-ip> <from-port> <to-ip> <to-port>
+#
+# <state> is currently always "failover"
+# <role> is either "leader" or "observer"
+# 
+# The arguments from-ip, from-port, to-ip, to-port are used to communicate
+# the old address of the master and the new address of the elected replica
+# (now a master).
+#
+# This script should be resistant to multiple invocations.
+#
+# Example:
+#
+# sentinel client-reconfig-script mymaster /var/redis/reconfig.sh
+
+# SECURITY
+#
+# By default SENTINEL SET will not be able to change the notification-script
+# and client-reconfig-script at runtime. This avoids a trivial security issue
+# where clients can set the script to anything and trigger a failover in order
+# to get the program executed.
+
+sentinel deny-scripts-reconfig yes
+
+# REDIS COMMANDS RENAMING
+#
+# Sometimes the Redis server has certain commands, that are needed for Sentinel
+# to work correctly, renamed to unguessable strings. This is often the case
+# of CONFIG and SLAVEOF in the context of providers that provide Redis as
+# a service, and don't want the customers to reconfigure the instances outside
+# of the administration console.
+#
+# In such case it is possible to tell Sentinel to use different command names
+# instead of the normal ones. For example if the master "mymaster", and the
+# associated replicas, have "CONFIG" all renamed to "GUESSME", I could use:
+#
+# SENTINEL rename-command mymaster CONFIG GUESSME
+#
+# After such configuration is set, every time Sentinel would use CONFIG it will
+# use GUESSME instead. Note that there is no actual need to respect the command
+# case, so writing "config guessme" is the same in the example above.
+#
+# SENTINEL SET can also be used in order to perform this configuration at runtime.
+#
+# In order to set a command back to its original name (undo the renaming), it
+# is possible to just rename a command to itself:
+#
+# SENTINEL rename-command mymaster CONFIG CONFIG
+
+# HOSTNAMES SUPPORT
+#
+# Normally Sentinel uses only IP addresses and requires SENTINEL MONITOR
+# to specify an IP address. Also, it requires the Redis replica-announce-ip
+# keyword to specify only IP addresses.
+#
+# You may enable hostnames support by enabling resolve-hostnames. Note
+# that you must make sure your DNS is configured properly and that DNS
+# resolution does not introduce very long delays.
+#
+SENTINEL resolve-hostnames no
+
+# When resolve-hostnames is enabled, Sentinel still uses IP addresses
+# when exposing instances to users, configuration files, etc. If you want
+# to retain the hostnames when announced, enable announce-hostnames below.
+#
+SENTINEL announce-hostnames no
diff --git a/redis-stable/src/.gitignore b/redis-stable/src/.gitignore
new file mode 100644
index 00000000..aee7aacf
--- /dev/null
+++ b/redis-stable/src/.gitignore
@@ -0,0 +1,5 @@
+*.gcda
+*.gcno
+*.gcov
+redis.info
+lcov-html
diff --git a/redis-stable/src/Makefile b/redis-stable/src/Makefile
new file mode 100644
index 00000000..1001f5b3
--- /dev/null
+++ b/redis-stable/src/Makefile
@@ -0,0 +1,443 @@
+# Redis Makefile
+# Copyright (C) 2009 Salvatore Sanfilippo <antirez at gmail dot com>
+# This file is released under the BSD license, see the COPYING file
+#
+# The Makefile composes the final FINAL_CFLAGS and FINAL_LDFLAGS using
+# what is needed for Redis plus the standard CFLAGS and LDFLAGS passed.
+# However when building the dependencies (Jemalloc, Lua, Hiredis, ...)
+# CFLAGS and LDFLAGS are propagated to the dependencies, so to pass
+# flags only to be used when compiling / linking Redis itself REDIS_CFLAGS
+# and REDIS_LDFLAGS are used instead (this is the case of 'make gcov').
+#
+# Dependencies are stored in the Makefile.dep file. To rebuild this file
+# Just use 'make dep', but this is only needed by developers.
+
+release_hdr := $(shell sh -c './mkreleasehdr.sh')
+uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
+uname_M := $(shell sh -c 'uname -m 2>/dev/null || echo not')
+OPTIMIZATION?=-O2
+DEPENDENCY_TARGETS=hiredis linenoise lua hdr_histogram
+NODEPS:=clean distclean
+
+# Default settings
+STD=-pedantic -DREDIS_STATIC=''
+
+# Use -Wno-c11-extensions on clang, either where explicitly used or on
+# platforms we can assume it's being used.
+ifneq (,$(findstring clang,$(CC)))
+  STD+=-Wno-c11-extensions
+else
+ifneq (,$(findstring FreeBSD,$(uname_S)))
+  STD+=-Wno-c11-extensions
+endif
+endif
+WARN=-Wall -W -Wno-missing-field-initializers
+OPT=$(OPTIMIZATION)
+
+# Detect if the compiler supports C11 _Atomic
+C11_ATOMIC := $(shell sh -c 'echo "\#include <stdatomic.h>" > foo.c; \
+	$(CC) -std=c11 -c foo.c -o foo.o > /dev/null 2>&1; \
+	if [ -f foo.o ]; then echo "yes"; rm foo.o; fi; rm foo.c')
+ifeq ($(C11_ATOMIC),yes)
+	STD+=-std=c11
+else
+	STD+=-std=c99
+endif
+
+PREFIX?=/usr/local
+INSTALL_BIN=$(PREFIX)/bin
+INSTALL=install
+PKG_CONFIG?=pkg-config
+
+# Default allocator defaults to Jemalloc if it's not an ARM
+MALLOC=libc
+ifneq ($(uname_M),armv6l)
+ifneq ($(uname_M),armv7l)
+ifeq ($(uname_S),Linux)
+	MALLOC=jemalloc
+endif
+endif
+endif
+
+# To get ARM stack traces if Redis crashes we need a special C flag.
+ifneq (,$(filter aarch64 armv,$(uname_M)))
+        CFLAGS+=-funwind-tables
+else
+ifneq (,$(findstring armv,$(uname_M)))
+        CFLAGS+=-funwind-tables
+endif
+endif
+
+# Backwards compatibility for selecting an allocator
+ifeq ($(USE_TCMALLOC),yes)
+	MALLOC=tcmalloc
+endif
+
+ifeq ($(USE_TCMALLOC_MINIMAL),yes)
+	MALLOC=tcmalloc_minimal
+endif
+
+ifeq ($(USE_JEMALLOC),yes)
+	MALLOC=jemalloc
+endif
+
+ifeq ($(USE_JEMALLOC),no)
+	MALLOC=libc
+endif
+
+# Override default settings if possible
+-include .make-settings
+
+FINAL_CFLAGS=$(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS) $(REDIS_CFLAGS)
+FINAL_LDFLAGS=$(LDFLAGS) $(REDIS_LDFLAGS) $(DEBUG)
+FINAL_LIBS=-lm
+DEBUG=-g -ggdb
+
+# Linux ARM32 needs -latomic at linking time
+ifneq (,$(findstring armv,$(uname_M)))
+        FINAL_LIBS+=-latomic
+endif
+
+ifeq ($(uname_S),SunOS)
+	# SunOS
+	ifeq ($(findstring -m32,$(FINAL_CFLAGS)),)
+		CFLAGS+=-m64
+	endif
+	ifeq ($(findstring -m32,$(FINAL_LDFLAGS)),)
+		LDFLAGS+=-m64
+	endif
+	DEBUG=-g
+	DEBUG_FLAGS=-g
+	export CFLAGS LDFLAGS DEBUG DEBUG_FLAGS
+	INSTALL=cp -pf
+	FINAL_CFLAGS+= -D__EXTENSIONS__ -D_XPG6
+	FINAL_LIBS+= -ldl -lnsl -lsocket -lresolv -lpthread -lrt
+else
+ifeq ($(uname_S),Darwin)
+	# Darwin
+	FINAL_LIBS+= -ldl
+	# Homebrew's OpenSSL is not linked to /usr/local to avoid
+	# conflicts with the system's LibreSSL installation so it
+	# must be referenced explicitly during build.
+ifeq ($(uname_M),arm64)
+	# Homebrew arm64 uses /opt/homebrew as HOMEBREW_PREFIX
+	OPENSSL_PREFIX?=/opt/homebrew/opt/openssl
+else
+	# Homebrew x86/ppc uses /usr/local as HOMEBREW_PREFIX
+	OPENSSL_PREFIX?=/usr/local/opt/openssl
+endif
+else
+ifeq ($(uname_S),AIX)
+        # AIX
+        FINAL_LDFLAGS+= -Wl,-bexpall
+        FINAL_LIBS+=-ldl -pthread -lcrypt -lbsd
+else
+ifeq ($(uname_S),OpenBSD)
+	# OpenBSD
+	FINAL_LIBS+= -lpthread
+	ifeq ($(USE_BACKTRACE),yes)
+	    FINAL_CFLAGS+= -DUSE_BACKTRACE -I/usr/local/include
+	    FINAL_LDFLAGS+= -L/usr/local/lib
+	    FINAL_LIBS+= -lexecinfo
+    	endif
+
+else
+ifeq ($(uname_S),NetBSD)
+	# NetBSD
+	FINAL_LIBS+= -lpthread
+	ifeq ($(USE_BACKTRACE),yes)
+	    FINAL_CFLAGS+= -DUSE_BACKTRACE -I/usr/pkg/include
+	    FINAL_LDFLAGS+= -L/usr/pkg/lib
+	    FINAL_LIBS+= -lexecinfo
+    	endif
+else
+ifeq ($(uname_S),FreeBSD)
+	# FreeBSD
+	FINAL_LIBS+= -lpthread -lexecinfo
+else
+ifeq ($(uname_S),DragonFly)
+	# DragonFly
+	FINAL_LIBS+= -lpthread -lexecinfo
+else
+ifeq ($(uname_S),OpenBSD)
+	# OpenBSD
+	FINAL_LIBS+= -lpthread -lexecinfo
+else
+ifeq ($(uname_S),NetBSD)
+	# NetBSD
+	FINAL_LIBS+= -lpthread -lexecinfo
+else
+ifeq ($(uname_S),Haiku)
+	# Haiku
+	FINAL_CFLAGS+= -DBSD_SOURCE
+	FINAL_LDFLAGS+= -lbsd -lnetwork
+	FINAL_LIBS+= -lpthread
+else
+	# All the other OSes (notably Linux)
+	FINAL_LDFLAGS+= -rdynamic
+	FINAL_LIBS+=-ldl -pthread -lrt
+endif
+endif
+endif
+endif
+endif
+endif
+endif
+endif
+endif
+endif
+
+ifdef OPENSSL_PREFIX
+	OPENSSL_CFLAGS=-I$(OPENSSL_PREFIX)/include
+	OPENSSL_LDFLAGS=-L$(OPENSSL_PREFIX)/lib
+	# Also export OPENSSL_PREFIX so it ends up in deps sub-Makefiles
+	export OPENSSL_PREFIX
+endif
+
+# Include paths to dependencies
+FINAL_CFLAGS+= -I../deps/hiredis -I../deps/linenoise -I../deps/lua/src -I../deps/hdr_histogram
+
+# Determine systemd support and/or build preference (defaulting to auto-detection)
+BUILD_WITH_SYSTEMD=no
+LIBSYSTEMD_LIBS=-lsystemd
+
+# If 'USE_SYSTEMD' in the environment is neither "no" nor "yes", try to
+# auto-detect libsystemd's presence and link accordingly.
+ifneq ($(USE_SYSTEMD),no)
+	LIBSYSTEMD_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libsystemd && echo $$?)
+# If libsystemd cannot be detected, continue building without support for it
+# (unless a later check tells us otherwise)
+ifeq ($(LIBSYSTEMD_PKGCONFIG),0)
+	BUILD_WITH_SYSTEMD=yes
+	LIBSYSTEMD_LIBS=$(shell $(PKG_CONFIG) --libs libsystemd)
+endif
+endif
+
+# If 'USE_SYSTEMD' is set to "yes" use pkg-config if available or fall back to
+# default -lsystemd.
+ifeq ($(USE_SYSTEMD),yes)
+	BUILD_WITH_SYSTEMD=yes
+endif
+
+ifeq ($(BUILD_WITH_SYSTEMD),yes)
+	FINAL_LIBS+=$(LIBSYSTEMD_LIBS)
+	FINAL_CFLAGS+= -DHAVE_LIBSYSTEMD
+endif
+
+ifeq ($(MALLOC),tcmalloc)
+	FINAL_CFLAGS+= -DUSE_TCMALLOC
+	FINAL_LIBS+= -ltcmalloc
+endif
+
+ifeq ($(MALLOC),tcmalloc_minimal)
+	FINAL_CFLAGS+= -DUSE_TCMALLOC
+	FINAL_LIBS+= -ltcmalloc_minimal
+endif
+
+ifeq ($(MALLOC),jemalloc)
+	DEPENDENCY_TARGETS+= jemalloc
+	FINAL_CFLAGS+= -DUSE_JEMALLOC -I../deps/jemalloc/include
+	FINAL_LIBS := ../deps/jemalloc/lib/libjemalloc.a $(FINAL_LIBS)
+endif
+
+ifeq ($(BUILD_TLS),yes)
+	FINAL_CFLAGS+=-DUSE_OPENSSL $(OPENSSL_CFLAGS)
+	FINAL_LDFLAGS+=$(OPENSSL_LDFLAGS)
+	LIBSSL_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libssl && echo $$?)
+ifeq ($(LIBSSL_PKGCONFIG),0)
+	LIBSSL_LIBS=$(shell $(PKG_CONFIG) --libs libssl)
+else
+	LIBSSL_LIBS=-lssl
+endif
+	LIBCRYPTO_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libcrypto && echo $$?)
+ifeq ($(LIBCRYPTO_PKGCONFIG),0)
+	LIBCRYPTO_LIBS=$(shell $(PKG_CONFIG) --libs libcrypto)
+else
+	LIBCRYPTO_LIBS=-lcrypto
+endif
+	FINAL_LIBS += ../deps/hiredis/libhiredis_ssl.a $(LIBSSL_LIBS) $(LIBCRYPTO_LIBS)
+endif
+
+ifndef V
+    define MAKE_INSTALL
+        @printf '    %b %b\n' $(LINKCOLOR)INSTALL$(ENDCOLOR) $(BINCOLOR)$(1)$(ENDCOLOR) 1>&2
+        @$(INSTALL) $(1) $(2)
+    endef
+else
+    define MAKE_INSTALL
+        $(INSTALL) $(1) $(2)
+    endef
+endif
+
+REDIS_CC=$(QUIET_CC)$(CC) $(FINAL_CFLAGS)
+REDIS_LD=$(QUIET_LINK)$(CC) $(FINAL_LDFLAGS)
+REDIS_INSTALL=$(QUIET_INSTALL)$(INSTALL)
+
+CCCOLOR="\033[34m"
+LINKCOLOR="\033[34;1m"
+SRCCOLOR="\033[33m"
+BINCOLOR="\033[37;1m"
+MAKECOLOR="\033[32;1m"
+ENDCOLOR="\033[0m"
+
+ifndef V
+QUIET_CC = @printf '    %b %b\n' $(CCCOLOR)CC$(ENDCOLOR) $(SRCCOLOR)$@$(ENDCOLOR) 1>&2;
+QUIET_LINK = @printf '    %b %b\n' $(LINKCOLOR)LINK$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR) 1>&2;
+QUIET_INSTALL = @printf '    %b %b\n' $(LINKCOLOR)INSTALL$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR) 1>&2;
+endif
+
+REDIS_SERVER_NAME=redis-server$(PROG_SUFFIX)
+REDIS_SENTINEL_NAME=redis-sentinel$(PROG_SUFFIX)
+REDIS_SERVER_OBJ=adlist.o quicklist.o ae.o anet.o dict.o server.o sds.o zmalloc.o lzf_c.o lzf_d.o pqsort.o zipmap.o sha1.o ziplist.o release.o networking.o util.o object.o db.o replication.o rdb.o t_string.o t_list.o t_set.o t_zset.o t_hash.o config.o aof.o pubsub.o multi.o debug.o sort.o intset.o syncio.o cluster.o crc16.o endianconv.o slowlog.o scripting.o bio.o rio.o rand.o memtest.o crcspeed.o crc64.o bitops.o sentinel.o notify.o setproctitle.o blocked.o hyperloglog.o latency.o sparkline.o redis-check-rdb.o redis-check-aof.o geo.o lazyfree.o module.o evict.o expire.o geohash.o geohash_helper.o childinfo.o defrag.o siphash.o rax.o t_stream.o listpack.o localtime.o lolwut.o lolwut5.o lolwut6.o acl.o gopher.o tracking.o connection.o tls.o sha256.o timeout.o setcpuaffinity.o monotonic.o mt19937-64.o
+REDIS_CLI_NAME=redis-cli$(PROG_SUFFIX)
+REDIS_CLI_OBJ=anet.o adlist.o dict.o redis-cli.o zmalloc.o release.o ae.o crcspeed.o crc64.o siphash.o crc16.o monotonic.o cli_common.o mt19937-64.o
+REDIS_BENCHMARK_NAME=redis-benchmark$(PROG_SUFFIX)
+REDIS_BENCHMARK_OBJ=ae.o anet.o redis-benchmark.o adlist.o dict.o zmalloc.o release.o crcspeed.o crc64.o siphash.o crc16.o monotonic.o cli_common.o mt19937-64.o
+REDIS_CHECK_RDB_NAME=redis-check-rdb$(PROG_SUFFIX)
+REDIS_CHECK_AOF_NAME=redis-check-aof$(PROG_SUFFIX)
+
+all: $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME) $(REDIS_CHECK_RDB_NAME) $(REDIS_CHECK_AOF_NAME)
+	@echo ""
+	@echo "Hint: It's a good idea to run 'make test' ;)"
+	@echo ""
+
+Makefile.dep:
+	-$(REDIS_CC) -MM *.c > Makefile.dep 2> /dev/null || true
+
+ifeq (0, $(words $(findstring $(MAKECMDGOALS), $(NODEPS))))
+-include Makefile.dep
+endif
+
+.PHONY: all
+
+persist-settings: distclean
+	echo STD=$(STD) >> .make-settings
+	echo WARN=$(WARN) >> .make-settings
+	echo OPT=$(OPT) >> .make-settings
+	echo MALLOC=$(MALLOC) >> .make-settings
+	echo BUILD_TLS=$(BUILD_TLS) >> .make-settings
+	echo USE_SYSTEMD=$(USE_SYSTEMD) >> .make-settings
+	echo CFLAGS=$(CFLAGS) >> .make-settings
+	echo LDFLAGS=$(LDFLAGS) >> .make-settings
+	echo REDIS_CFLAGS=$(REDIS_CFLAGS) >> .make-settings
+	echo REDIS_LDFLAGS=$(REDIS_LDFLAGS) >> .make-settings
+	echo PREV_FINAL_CFLAGS=$(FINAL_CFLAGS) >> .make-settings
+	echo PREV_FINAL_LDFLAGS=$(FINAL_LDFLAGS) >> .make-settings
+	-(cd ../deps && $(MAKE) $(DEPENDENCY_TARGETS))
+
+.PHONY: persist-settings
+
+# Prerequisites target
+.make-prerequisites:
+	@touch $@
+
+# Clean everything, persist settings and build dependencies if anything changed
+ifneq ($(strip $(PREV_FINAL_CFLAGS)), $(strip $(FINAL_CFLAGS)))
+.make-prerequisites: persist-settings
+endif
+
+ifneq ($(strip $(PREV_FINAL_LDFLAGS)), $(strip $(FINAL_LDFLAGS)))
+.make-prerequisites: persist-settings
+endif
+
+# redis-server
+$(REDIS_SERVER_NAME): $(REDIS_SERVER_OBJ)
+	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/lua/src/liblua.a $(FINAL_LIBS)
+
+# redis-sentinel
+$(REDIS_SENTINEL_NAME): $(REDIS_SERVER_NAME)
+	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME)
+
+# redis-check-rdb
+$(REDIS_CHECK_RDB_NAME): $(REDIS_SERVER_NAME)
+	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_CHECK_RDB_NAME)
+
+# redis-check-aof
+$(REDIS_CHECK_AOF_NAME): $(REDIS_SERVER_NAME)
+	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_CHECK_AOF_NAME)
+
+# redis-cli
+$(REDIS_CLI_NAME): $(REDIS_CLI_OBJ)
+	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/linenoise/linenoise.o $(FINAL_LIBS)
+
+# redis-benchmark
+$(REDIS_BENCHMARK_NAME): $(REDIS_BENCHMARK_OBJ)
+	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/hdr_histogram/hdr_histogram.o $(FINAL_LIBS)
+
+DEP = $(REDIS_SERVER_OBJ:%.o=%.d) $(REDIS_CLI_OBJ:%.o=%.d) $(REDIS_BENCHMARK_OBJ:%.o=%.d)
+-include $(DEP)
+
+# Because the jemalloc.h header is generated as a part of the jemalloc build,
+# building it should complete before building any other object. Instead of
+# depending on a single artifact, build all dependencies first.
+%.o: %.c .make-prerequisites
+	$(REDIS_CC) -MMD -o $@ -c $<
+
+clean:
+	rm -rf $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME) $(REDIS_CHECK_RDB_NAME) $(REDIS_CHECK_AOF_NAME) *.o *.gcda *.gcno *.gcov redis.info lcov-html Makefile.dep
+	rm -f $(DEP)
+
+.PHONY: clean
+
+distclean: clean
+	-(cd ../deps && $(MAKE) distclean)
+	-(cd modules && $(MAKE) clean)
+	-(cd ../tests/modules && $(MAKE) clean)
+	-(rm -f .make-*)
+
+.PHONY: distclean
+
+test: $(REDIS_SERVER_NAME) $(REDIS_CHECK_AOF_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME)
+	@(cd ..; ./runtest)
+
+test-modules: $(REDIS_SERVER_NAME)
+	@(cd ..; ./runtest-moduleapi)
+
+test-sentinel: $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME)
+	@(cd ..; ./runtest-sentinel)
+
+check: test
+
+lcov:
+	$(MAKE) gcov
+	@(set -e; cd ..; ./runtest --clients 1)
+	@geninfo -o redis.info .
+	@genhtml --legend -o lcov-html redis.info
+
+.PHONY: lcov
+
+bench: $(REDIS_BENCHMARK_NAME)
+	./$(REDIS_BENCHMARK_NAME)
+
+32bit:
+	@echo ""
+	@echo "WARNING: if it fails under Linux you probably need to install libc6-dev-i386"
+	@echo ""
+	$(MAKE) CFLAGS="-m32" LDFLAGS="-m32"
+
+gcov:
+	$(MAKE) REDIS_CFLAGS="-fprofile-arcs -ftest-coverage -DCOVERAGE_TEST" REDIS_LDFLAGS="-fprofile-arcs -ftest-coverage"
+
+noopt:
+	$(MAKE) OPTIMIZATION="-O0"
+
+valgrind:
+	$(MAKE) OPTIMIZATION="-O0" MALLOC="libc"
+
+helgrind:
+	$(MAKE) OPTIMIZATION="-O0" MALLOC="libc" CFLAGS="-D__ATOMIC_VAR_FORCE_SYNC_MACROS" REDIS_CFLAGS="-I/usr/local/include" REDIS_LDFLAGS="-L/usr/local/lib"
+
+src/help.h:
+	@../utils/generate-command-help.rb > help.h
+
+install: all
+	@mkdir -p $(INSTALL_BIN)
+	$(call MAKE_INSTALL,$(REDIS_SERVER_NAME),$(INSTALL_BIN))
+	$(call MAKE_INSTALL,$(REDIS_BENCHMARK_NAME),$(INSTALL_BIN))
+	$(call MAKE_INSTALL,$(REDIS_CLI_NAME),$(INSTALL_BIN))
+	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_CHECK_RDB_NAME)
+	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_CHECK_AOF_NAME)
+	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_SENTINEL_NAME)
+
+uninstall:
+	rm -f $(INSTALL_BIN)/{$(REDIS_SERVER_NAME),$(REDIS_BENCHMARK_NAME),$(REDIS_CLI_NAME),$(REDIS_CHECK_RDB_NAME),$(REDIS_CHECK_AOF_NAME),$(REDIS_SENTINEL_NAME)}
diff --git a/redis-stable/src/acl.c b/redis-stable/src/acl.c
new file mode 100644
index 00000000..86f73fe7
--- /dev/null
+++ b/redis-stable/src/acl.c
@@ -0,0 +1,2292 @@
+/*
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "sha256.h"
+#include <fcntl.h>
+#include <ctype.h>
+
+/* =============================================================================
+ * Global state for ACLs
+ * ==========================================================================*/
+
+rax *Users; /* Table mapping usernames to user structures. */
+
+user *DefaultUser;  /* Global reference to the default user.
+                       Every new connection is associated to it, if no
+                       AUTH or HELLO is used to authenticate with a
+                       different user. */
+
+list *UsersToLoad;  /* This is a list of users found in the configuration file
+                       that we'll need to load in the final stage of Redis
+                       initialization, after all the modules are already
+                       loaded. Every list element is a NULL terminated
+                       array of SDS pointers: the first is the user name,
+                       all the remaining pointers are ACL rules in the same
+                       format as ACLSetUser(). */
+list *ACLLog;       /* Our security log, the user is able to inspect that
+                       using the ACL LOG command .*/
+
+static rax *commandId = NULL; /* Command name to id mapping */
+
+static unsigned long nextid = 0; /* Next command id that has not been assigned */
+
+struct ACLCategoryItem {
+    const char *name;
+    uint64_t flag;
+} ACLCommandCategories[] = {
+    {"keyspace", CMD_CATEGORY_KEYSPACE},
+    {"read", CMD_CATEGORY_READ},
+    {"write", CMD_CATEGORY_WRITE},
+    {"set", CMD_CATEGORY_SET},
+    {"sortedset", CMD_CATEGORY_SORTEDSET},
+    {"list", CMD_CATEGORY_LIST},
+    {"hash", CMD_CATEGORY_HASH},
+    {"string", CMD_CATEGORY_STRING},
+    {"bitmap", CMD_CATEGORY_BITMAP},
+    {"hyperloglog", CMD_CATEGORY_HYPERLOGLOG},
+    {"geo", CMD_CATEGORY_GEO},
+    {"stream", CMD_CATEGORY_STREAM},
+    {"pubsub", CMD_CATEGORY_PUBSUB},
+    {"admin", CMD_CATEGORY_ADMIN},
+    {"fast", CMD_CATEGORY_FAST},
+    {"slow", CMD_CATEGORY_SLOW},
+    {"blocking", CMD_CATEGORY_BLOCKING},
+    {"dangerous", CMD_CATEGORY_DANGEROUS},
+    {"connection", CMD_CATEGORY_CONNECTION},
+    {"transaction", CMD_CATEGORY_TRANSACTION},
+    {"scripting", CMD_CATEGORY_SCRIPTING},
+    {NULL,0} /* Terminator. */
+};
+
+struct ACLUserFlag {
+    const char *name;
+    uint64_t flag;
+} ACLUserFlags[] = {
+    /* Note: the order here dictates the emitted order at ACLDescribeUser */
+    {"on", USER_FLAG_ENABLED},
+    {"off", USER_FLAG_DISABLED},
+    {"allkeys", USER_FLAG_ALLKEYS},
+    {"allchannels", USER_FLAG_ALLCHANNELS},
+    {"allcommands", USER_FLAG_ALLCOMMANDS},
+    {"nopass", USER_FLAG_NOPASS},
+    {"skip-sanitize-payload", USER_FLAG_SANITIZE_PAYLOAD_SKIP},
+    {"sanitize-payload", USER_FLAG_SANITIZE_PAYLOAD},
+    {NULL,0} /* Terminator. */
+};
+
+void ACLResetSubcommandsForCommand(user *u, unsigned long id);
+void ACLResetSubcommands(user *u);
+void ACLAddAllowedSubcommand(user *u, unsigned long id, const char *sub);
+void ACLFreeLogEntry(void *le);
+
+/* The length of the string representation of a hashed password. */
+#define HASH_PASSWORD_LEN SHA256_BLOCK_SIZE*2
+
+/* =============================================================================
+ * Helper functions for the rest of the ACL implementation
+ * ==========================================================================*/
+
+/* Return zero if strings are the same, non-zero if they are not.
+ * The comparison is performed in a way that prevents an attacker to obtain
+ * information about the nature of the strings just monitoring the execution
+ * time of the function.
+ *
+ * Note that limiting the comparison length to strings up to 512 bytes we
+ * can avoid leaking any information about the password length and any
+ * possible branch misprediction related leak.
+ */
+int time_independent_strcmp(char *a, char *b) {
+    char bufa[CONFIG_AUTHPASS_MAX_LEN], bufb[CONFIG_AUTHPASS_MAX_LEN];
+    /* The above two strlen perform len(a) + len(b) operations where either
+     * a or b are fixed (our password) length, and the difference is only
+     * relative to the length of the user provided string, so no information
+     * leak is possible in the following two lines of code. */
+    unsigned int alen = strlen(a);
+    unsigned int blen = strlen(b);
+    unsigned int j;
+    int diff = 0;
+
+    /* We can't compare strings longer than our static buffers.
+     * Note that this will never pass the first test in practical circumstances
+     * so there is no info leak. */
+    if (alen > sizeof(bufa) || blen > sizeof(bufb)) return 1;
+
+    memset(bufa,0,sizeof(bufa));        /* Constant time. */
+    memset(bufb,0,sizeof(bufb));        /* Constant time. */
+    /* Again the time of the following two copies is proportional to
+     * len(a) + len(b) so no info is leaked. */
+    memcpy(bufa,a,alen);
+    memcpy(bufb,b,blen);
+
+    /* Always compare all the chars in the two buffers without
+     * conditional expressions. */
+    for (j = 0; j < sizeof(bufa); j++) {
+        diff |= (bufa[j] ^ bufb[j]);
+    }
+    /* Length must be equal as well. */
+    diff |= alen ^ blen;
+    return diff; /* If zero strings are the same. */
+}
+
+/* Given an SDS string, returns the SHA256 hex representation as a
+ * new SDS string. */
+sds ACLHashPassword(unsigned char *cleartext, size_t len) {
+    SHA256_CTX ctx;
+    unsigned char hash[SHA256_BLOCK_SIZE];
+    char hex[HASH_PASSWORD_LEN];
+    char *cset = "0123456789abcdef";
+
+    sha256_init(&ctx);
+    sha256_update(&ctx,(unsigned char*)cleartext,len);
+    sha256_final(&ctx,hash);
+
+    for (int j = 0; j < SHA256_BLOCK_SIZE; j++) {
+        hex[j*2] = cset[((hash[j]&0xF0)>>4)];
+        hex[j*2+1] = cset[(hash[j]&0xF)];
+    }
+    return sdsnewlen(hex,HASH_PASSWORD_LEN);
+}
+
+/* Given a hash and the hash length, returns C_OK if it is a valid password
+ * hash, or C_ERR otherwise. */
+int ACLCheckPasswordHash(unsigned char *hash, int hashlen) {
+    if (hashlen != HASH_PASSWORD_LEN) {
+        return C_ERR;
+    }
+
+    /* Password hashes can only be characters that represent
+     * hexadecimal values, which are numbers and lowercase
+     * characters 'a' through 'f'. */
+    for(int i = 0; i < HASH_PASSWORD_LEN; i++) {
+        char c = hash[i];
+        if ((c < 'a' || c > 'f') && (c < '0' || c > '9')) {
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* =============================================================================
+ * Low level ACL API
+ * ==========================================================================*/
+
+/* Return 1 if the specified string contains spaces or null characters.
+ * We do this for usernames and key patterns for simpler rewriting of
+ * ACL rules, presentation on ACL list, and to avoid subtle security bugs
+ * that may arise from parsing the rules in presence of escapes.
+ * The function returns 0 if the string has no spaces. */
+int ACLStringHasSpaces(const char *s, size_t len) {
+    for (size_t i = 0; i < len; i++) {
+        if (isspace(s[i]) || s[i] == 0) return 1;
+    }
+    return 0;
+}
+
+/* Given the category name the command returns the corresponding flag, or
+ * zero if there is no match. */
+uint64_t ACLGetCommandCategoryFlagByName(const char *name) {
+    for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
+        if (!strcasecmp(name,ACLCommandCategories[j].name)) {
+            return ACLCommandCategories[j].flag;
+        }
+    }
+    return 0; /* No match. */
+}
+
+/* Method for passwords/pattern comparison used for the user->passwords list
+ * so that we can search for items with listSearchKey(). */
+int ACLListMatchSds(void *a, void *b) {
+    return sdscmp(a,b) == 0;
+}
+
+/* Method to free list elements from ACL users password/patterns lists. */
+void ACLListFreeSds(void *item) {
+    sdsfree(item);
+}
+
+/* Method to duplicate list elements from ACL users password/patterns lists. */
+void *ACLListDupSds(void *item) {
+    return sdsdup(item);
+}
+
+/* Create a new user with the specified name, store it in the list
+ * of users (the Users global radix tree), and returns a reference to
+ * the structure representing the user.
+ *
+ * If the user with such name already exists NULL is returned. */
+user *ACLCreateUser(const char *name, size_t namelen) {
+    if (raxFind(Users,(unsigned char*)name,namelen) != raxNotFound) return NULL;
+    user *u = zmalloc(sizeof(*u));
+    u->name = sdsnewlen(name,namelen);
+    u->flags = USER_FLAG_DISABLED | server.acl_pubsub_default;
+    u->allowed_subcommands = NULL;
+    u->passwords = listCreate();
+    u->patterns = listCreate();
+    u->channels = listCreate();
+    listSetMatchMethod(u->passwords,ACLListMatchSds);
+    listSetFreeMethod(u->passwords,ACLListFreeSds);
+    listSetDupMethod(u->passwords,ACLListDupSds);
+    listSetMatchMethod(u->patterns,ACLListMatchSds);
+    listSetFreeMethod(u->patterns,ACLListFreeSds);
+    listSetDupMethod(u->patterns,ACLListDupSds);
+    listSetMatchMethod(u->channels,ACLListMatchSds);
+    listSetFreeMethod(u->channels,ACLListFreeSds);
+    listSetDupMethod(u->channels,ACLListDupSds);
+    memset(u->allowed_commands,0,sizeof(u->allowed_commands));
+    raxInsert(Users,(unsigned char*)name,namelen,u,NULL);
+    return u;
+}
+
+/* This function should be called when we need an unlinked "fake" user
+ * we can use in order to validate ACL rules or for other similar reasons.
+ * The user will not get linked to the Users radix tree. The returned
+ * user should be released with ACLFreeUser() as usually. */
+user *ACLCreateUnlinkedUser(void) {
+    char username[64];
+    for (int j = 0; ; j++) {
+        snprintf(username,sizeof(username),"__fakeuser:%d__",j);
+        user *fakeuser = ACLCreateUser(username,strlen(username));
+        if (fakeuser == NULL) continue;
+        int retval = raxRemove(Users,(unsigned char*) username,
+                               strlen(username),NULL);
+        serverAssert(retval != 0);
+        return fakeuser;
+    }
+}
+
+/* Release the memory used by the user structure. Note that this function
+ * will not remove the user from the Users global radix tree. */
+void ACLFreeUser(user *u) {
+    sdsfree(u->name);
+    listRelease(u->passwords);
+    listRelease(u->patterns);
+    listRelease(u->channels);
+    ACLResetSubcommands(u);
+    zfree(u);
+}
+
+/* When a user is deleted we need to cycle the active
+ * connections in order to kill all the pending ones that
+ * are authenticated with such user. */
+void ACLFreeUserAndKillClients(user *u) {
+    listIter li;
+    listNode *ln;
+    listRewind(server.clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        client *c = listNodeValue(ln);
+        if (c->user == u) {
+            /* We'll free the connection asynchronously, so
+             * in theory to set a different user is not needed.
+             * However if there are bugs in Redis, soon or later
+             * this may result in some security hole: it's much
+             * more defensive to set the default user and put
+             * it in non authenticated mode. */
+            c->user = DefaultUser;
+            c->authenticated = 0;
+            /* We will write replies to this client later, so we can't
+             * close it directly even if async. */
+            if (c == server.current_client) {
+                c->flags |= CLIENT_CLOSE_AFTER_COMMAND;
+            } else {
+                freeClientAsync(c);
+            }
+        }
+    }
+    ACLFreeUser(u);
+}
+
+/* Copy the user ACL rules from the source user 'src' to the destination
+ * user 'dst' so that at the end of the process they'll have exactly the
+ * same rules (but the names will continue to be the original ones). */
+void ACLCopyUser(user *dst, user *src) {
+    listRelease(dst->passwords);
+    listRelease(dst->patterns);
+    listRelease(dst->channels);
+    dst->passwords = listDup(src->passwords);
+    dst->patterns = listDup(src->patterns);
+    dst->channels = listDup(src->channels);
+    memcpy(dst->allowed_commands,src->allowed_commands,
+           sizeof(dst->allowed_commands));
+    dst->flags = src->flags;
+    ACLResetSubcommands(dst);
+    /* Copy the allowed subcommands array of array of SDS strings. */
+    if (src->allowed_subcommands) {
+        for (int j = 0; j < USER_COMMAND_BITS_COUNT; j++) {
+            if (src->allowed_subcommands[j]) {
+                for (int i = 0; src->allowed_subcommands[j][i]; i++)
+                {
+                    ACLAddAllowedSubcommand(dst, j,
+                        src->allowed_subcommands[j][i]);
+                }
+            }
+        }
+    }
+}
+
+/* Free all the users registered in the radix tree 'users' and free the
+ * radix tree itself. */
+void ACLFreeUsersSet(rax *users) {
+    raxFreeWithCallback(users,(void(*)(void*))ACLFreeUserAndKillClients);
+}
+
+/* Given a command ID, this function set by reference 'word' and 'bit'
+ * so that user->allowed_commands[word] will address the right word
+ * where the corresponding bit for the provided ID is stored, and
+ * so that user->allowed_commands[word]&bit will identify that specific
+ * bit. The function returns C_ERR in case the specified ID overflows
+ * the bitmap in the user representation. */
+int ACLGetCommandBitCoordinates(uint64_t id, uint64_t *word, uint64_t *bit) {
+    if (id >= USER_COMMAND_BITS_COUNT) return C_ERR;
+    *word = id / sizeof(uint64_t) / 8;
+    *bit = 1ULL << (id % (sizeof(uint64_t) * 8));
+    return C_OK;
+}
+
+/* Check if the specified command bit is set for the specified user.
+ * The function returns 1 is the bit is set or 0 if it is not.
+ * Note that this function does not check the ALLCOMMANDS flag of the user
+ * but just the lowlevel bitmask.
+ *
+ * If the bit overflows the user internal representation, zero is returned
+ * in order to disallow the execution of the command in such edge case. */
+int ACLGetUserCommandBit(user *u, unsigned long id) {
+    uint64_t word, bit;
+    if (ACLGetCommandBitCoordinates(id,&word,&bit) == C_ERR) return 0;
+    return (u->allowed_commands[word] & bit) != 0;
+}
+
+/* When +@all or allcommands is given, we set a reserved bit as well that we
+ * can later test, to see if the user has the right to execute "future commands",
+ * that is, commands loaded later via modules. */
+int ACLUserCanExecuteFutureCommands(user *u) {
+    return ACLGetUserCommandBit(u,USER_COMMAND_BITS_COUNT-1);
+}
+
+/* Set the specified command bit for the specified user to 'value' (0 or 1).
+ * If the bit overflows the user internal representation, no operation
+ * is performed. As a side effect of calling this function with a value of
+ * zero, the user flag ALLCOMMANDS is cleared since it is no longer possible
+ * to skip the command bit explicit test. */
+void ACLSetUserCommandBit(user *u, unsigned long id, int value) {
+    uint64_t word, bit;
+    if (ACLGetCommandBitCoordinates(id,&word,&bit) == C_ERR) return;
+    if (value) {
+        u->allowed_commands[word] |= bit;
+    } else {
+        u->allowed_commands[word] &= ~bit;
+        u->flags &= ~USER_FLAG_ALLCOMMANDS;
+    }
+}
+
+/* This is like ACLSetUserCommandBit(), but instead of setting the specified
+ * ID, it will check all the commands in the category specified as argument,
+ * and will set all the bits corresponding to such commands to the specified
+ * value. Since the category passed by the user may be non existing, the
+ * function returns C_ERR if the category was not found, or C_OK if it was
+ * found and the operation was performed. */
+int ACLSetUserCommandBitsForCategory(user *u, const char *category, int value) {
+    uint64_t cflag = ACLGetCommandCategoryFlagByName(category);
+    if (!cflag) return C_ERR;
+    dictIterator *di = dictGetIterator(server.orig_commands);
+    dictEntry *de;
+    while ((de = dictNext(di)) != NULL) {
+        struct redisCommand *cmd = dictGetVal(de);
+        if (cmd->flags & CMD_MODULE) continue; /* Ignore modules commands. */
+        if (cmd->flags & cflag) {
+            ACLSetUserCommandBit(u,cmd->id,value);
+            ACLResetSubcommandsForCommand(u,cmd->id);
+        }
+    }
+    dictReleaseIterator(di);
+    return C_OK;
+}
+
+/* Return the number of commands allowed (on) and denied (off) for the user 'u'
+ * in the subset of commands flagged with the specified category name.
+ * If the category name is not valid, C_ERR is returned, otherwise C_OK is
+ * returned and on and off are populated by reference. */
+int ACLCountCategoryBitsForUser(user *u, unsigned long *on, unsigned long *off,
+                                const char *category)
+{
+    uint64_t cflag = ACLGetCommandCategoryFlagByName(category);
+    if (!cflag) return C_ERR;
+
+    *on = *off = 0;
+    dictIterator *di = dictGetIterator(server.orig_commands);
+    dictEntry *de;
+    while ((de = dictNext(di)) != NULL) {
+        struct redisCommand *cmd = dictGetVal(de);
+        if (cmd->flags & cflag) {
+            if (ACLGetUserCommandBit(u,cmd->id))
+                (*on)++;
+            else
+                (*off)++;
+        }
+    }
+    dictReleaseIterator(di);
+    return C_OK;
+}
+
+/* This function returns an SDS string representing the specified user ACL
+ * rules related to command execution, in the same format you could set them
+ * back using ACL SETUSER. The function will return just the set of rules needed
+ * to recreate the user commands bitmap, without including other user flags such
+ * as on/off, passwords and so forth. The returned string always starts with
+ * the +@all or -@all rule, depending on the user bitmap, and is followed, if
+ * needed, by the other rules needed to narrow or extend what the user can do. */
+sds ACLDescribeUserCommandRules(user *u) {
+    sds rules = sdsempty();
+    int additive;   /* If true we start from -@all and add, otherwise if
+                       false we start from +@all and remove. */
+
+    /* This code is based on a trick: as we generate the rules, we apply
+     * them to a fake user, so that as we go we still know what are the
+     * bit differences we should try to address by emitting more rules. */
+    user fu = {0};
+    user *fakeuser = &fu;
+
+    /* Here we want to understand if we should start with +@all and remove
+     * the commands corresponding to the bits that are not set in the user
+     * commands bitmap, or the contrary. Note that semantically the two are
+     * different. For instance starting with +@all and subtracting, the user
+     * will be able to execute future commands, while -@all and adding will just
+     * allow the user the run the selected commands and/or categories.
+     * How do we test for that? We use the trick of a reserved command ID bit
+     * that is set only by +@all (and its alias "allcommands"). */
+    if (ACLUserCanExecuteFutureCommands(u)) {
+        additive = 0;
+        rules = sdscat(rules,"+@all ");
+        ACLSetUser(fakeuser,"+@all",-1);
+    } else {
+        additive = 1;
+        rules = sdscat(rules,"-@all ");
+        ACLSetUser(fakeuser,"-@all",-1);
+    }
+
+    /* Attempt to find a good approximation for categories and commands
+     * based on the current bits used, by looping over the category list
+     * and applying the best fit each time. Often a set of categories will not 
+     * perfectly match the set of commands into it, so at the end we do a 
+     * final pass adding/removing the single commands needed to make the bitmap
+     * exactly match. A temp user is maintained to keep track of categories 
+     * already applied. */
+    user tu = {0};
+    user *tempuser = &tu;
+    
+    /* Keep track of the categories that have been applied, to prevent
+     * applying them twice.  */
+    char applied[sizeof(ACLCommandCategories)/sizeof(ACLCommandCategories[0])];
+    memset(applied, 0, sizeof(applied));
+
+    memcpy(tempuser->allowed_commands,
+        u->allowed_commands, 
+        sizeof(u->allowed_commands));
+    while (1) {
+        int best = -1;
+        unsigned long mindiff = INT_MAX, maxsame = 0;
+        for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
+            if (applied[j]) continue;
+
+            unsigned long on, off, diff, same;
+            ACLCountCategoryBitsForUser(tempuser,&on,&off,ACLCommandCategories[j].name);
+            /* Check if the current category is the best this loop:
+             * * It has more commands in common with the user than commands
+             *   that are different.
+             * AND EITHER
+             * * It has the fewest number of differences
+             *    than the best match we have found so far. 
+             * * OR it matches the fewest number of differences
+             *   that we've seen but it has more in common. */
+            diff = additive ? off : on;
+            same = additive ? on : off;
+            if (same > diff && 
+                ((diff < mindiff) || (diff == mindiff && same > maxsame)))
+            {
+                best = j;
+                mindiff = diff;
+                maxsame = same;
+            }
+        }
+
+        /* We didn't find a match */
+        if (best == -1) break;
+
+        sds op = sdsnewlen(additive ? "+@" : "-@", 2);
+        op = sdscat(op,ACLCommandCategories[best].name);
+        ACLSetUser(fakeuser,op,-1);
+
+        sds invop = sdsnewlen(additive ? "-@" : "+@", 2);
+        invop = sdscat(invop,ACLCommandCategories[best].name);
+        ACLSetUser(tempuser,invop,-1);
+
+        rules = sdscatsds(rules,op);
+        rules = sdscatlen(rules," ",1);
+        sdsfree(op);
+        sdsfree(invop);
+
+        applied[best] = 1;
+    }
+
+    /* Fix the final ACLs with single commands differences. */
+    dictIterator *di = dictGetIterator(server.orig_commands);
+    dictEntry *de;
+    while ((de = dictNext(di)) != NULL) {
+        struct redisCommand *cmd = dictGetVal(de);
+        int userbit = ACLGetUserCommandBit(u,cmd->id);
+        int fakebit = ACLGetUserCommandBit(fakeuser,cmd->id);
+        if (userbit != fakebit) {
+            rules = sdscatlen(rules, userbit ? "+" : "-", 1);
+            rules = sdscat(rules,cmd->name);
+            rules = sdscatlen(rules," ",1);
+            ACLSetUserCommandBit(fakeuser,cmd->id,userbit);
+        }
+
+        /* Emit the subcommands if there are any. */
+        if (userbit == 0 && u->allowed_subcommands &&
+            u->allowed_subcommands[cmd->id])
+        {
+            for (int j = 0; u->allowed_subcommands[cmd->id][j]; j++) {
+                rules = sdscatlen(rules,"+",1);
+                rules = sdscat(rules,cmd->name);
+                rules = sdscatlen(rules,"|",1);
+                rules = sdscatsds(rules,u->allowed_subcommands[cmd->id][j]);
+                rules = sdscatlen(rules," ",1);
+            }
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Trim the final useless space. */
+    sdsrange(rules,0,-2);
+
+    /* This is technically not needed, but we want to verify that now the
+     * predicted bitmap is exactly the same as the user bitmap, and abort
+     * otherwise, because aborting is better than a security risk in this
+     * code path. */
+    if (memcmp(fakeuser->allowed_commands,
+                        u->allowed_commands,
+                        sizeof(u->allowed_commands)) != 0)
+    {
+        serverLog(LL_WARNING,
+            "CRITICAL ERROR: User ACLs don't match final bitmap: '%s'",
+            rules);
+        serverPanic("No bitmap match in ACLDescribeUserCommandRules()");
+    }
+    return rules;
+}
+
+/* This is similar to ACLDescribeUserCommandRules(), however instead of
+ * describing just the user command rules, everything is described: user
+ * flags, keys, passwords and finally the command rules obtained via
+ * the ACLDescribeUserCommandRules() function. This is the function we call
+ * when we want to rewrite the configuration files describing ACLs and
+ * in order to show users with ACL LIST. */
+sds ACLDescribeUser(user *u) {
+    sds res = sdsempty();
+
+    /* Flags. */
+    for (int j = 0; ACLUserFlags[j].flag; j++) {
+        /* Skip the allcommands, allkeys and allchannels flags because they'll
+         * be emitted later as +@all, ~* and &*. */
+        if (ACLUserFlags[j].flag == USER_FLAG_ALLKEYS ||
+            ACLUserFlags[j].flag == USER_FLAG_ALLCHANNELS ||
+            ACLUserFlags[j].flag == USER_FLAG_ALLCOMMANDS) continue;
+        if (u->flags & ACLUserFlags[j].flag) {
+            res = sdscat(res,ACLUserFlags[j].name);
+            res = sdscatlen(res," ",1);
+        }
+    }
+
+    /* Passwords. */
+    listIter li;
+    listNode *ln;
+    listRewind(u->passwords,&li);
+    while((ln = listNext(&li))) {
+        sds thispass = listNodeValue(ln);
+        res = sdscatlen(res,"#",1);
+        res = sdscatsds(res,thispass);
+        res = sdscatlen(res," ",1);
+    }
+
+    /* Key patterns. */
+    if (u->flags & USER_FLAG_ALLKEYS) {
+        res = sdscatlen(res,"~* ",3);
+    } else {
+        listRewind(u->patterns,&li);
+        while((ln = listNext(&li))) {
+            sds thispat = listNodeValue(ln);
+            res = sdscatlen(res,"~",1);
+            res = sdscatsds(res,thispat);
+            res = sdscatlen(res," ",1);
+        }
+    }
+
+    /* Pub/sub channel patterns. */
+    if (u->flags & USER_FLAG_ALLCHANNELS) {
+        res = sdscatlen(res,"&* ",3);
+    } else {
+        res = sdscatlen(res,"resetchannels ",14);
+        listRewind(u->channels,&li);
+        while((ln = listNext(&li))) {
+            sds thispat = listNodeValue(ln);
+            res = sdscatlen(res,"&",1);
+            res = sdscatsds(res,thispat);
+            res = sdscatlen(res," ",1);
+        }
+    }
+
+    /* Command rules. */
+    sds rules = ACLDescribeUserCommandRules(u);
+    res = sdscatsds(res,rules);
+    sdsfree(rules);
+    return res;
+}
+
+/* Get a command from the original command table, that is not affected
+ * by the command renaming operations: we base all the ACL work from that
+ * table, so that ACLs are valid regardless of command renaming. */
+struct redisCommand *ACLLookupCommand(const char *name) {
+    struct redisCommand *cmd;
+    sds sdsname = sdsnew(name);
+    cmd = dictFetchValue(server.orig_commands, sdsname);
+    sdsfree(sdsname);
+    return cmd;
+}
+
+/* Flush the array of allowed subcommands for the specified user
+ * and command ID. */
+void ACLResetSubcommandsForCommand(user *u, unsigned long id) {
+    if (u->allowed_subcommands && u->allowed_subcommands[id]) {
+        for (int i = 0; u->allowed_subcommands[id][i]; i++)
+            sdsfree(u->allowed_subcommands[id][i]);
+        zfree(u->allowed_subcommands[id]);
+        u->allowed_subcommands[id] = NULL;
+    }
+}
+
+/* Flush the entire table of subcommands. This is useful on +@all, -@all
+ * or similar to return back to the minimal memory usage (and checks to do)
+ * for the user. */
+void ACLResetSubcommands(user *u) {
+    if (u->allowed_subcommands == NULL) return;
+    for (int j = 0; j < USER_COMMAND_BITS_COUNT; j++) {
+        if (u->allowed_subcommands[j]) {
+            for (int i = 0; u->allowed_subcommands[j][i]; i++)
+                sdsfree(u->allowed_subcommands[j][i]);
+            zfree(u->allowed_subcommands[j]);
+        }
+    }
+    zfree(u->allowed_subcommands);
+    u->allowed_subcommands = NULL;
+}
+
+/* Add a subcommand to the list of subcommands for the user 'u' and
+ * the command id specified. */
+void ACLAddAllowedSubcommand(user *u, unsigned long id, const char *sub) {
+    /* If this is the first subcommand to be configured for
+     * this user, we have to allocate the subcommands array. */
+    if (u->allowed_subcommands == NULL) {
+        u->allowed_subcommands = zcalloc(USER_COMMAND_BITS_COUNT *
+                                 sizeof(sds*));
+    }
+
+    /* We also need to enlarge the allocation pointing to the
+     * null terminated SDS array, to make space for this one.
+     * To start check the current size, and while we are here
+     * make sure the subcommand is not already specified inside. */
+    long items = 0;
+    if (u->allowed_subcommands[id]) {
+        while(u->allowed_subcommands[id][items]) {
+            /* If it's already here do not add it again. */
+            if (!strcasecmp(u->allowed_subcommands[id][items],sub)) return;
+            items++;
+        }
+    }
+
+    /* Now we can make space for the new item (and the null term). */
+    items += 2;
+    u->allowed_subcommands[id] = zrealloc(u->allowed_subcommands[id],
+                                 sizeof(sds)*items);
+    u->allowed_subcommands[id][items-2] = sdsnew(sub);
+    u->allowed_subcommands[id][items-1] = NULL;
+}
+
+/* Set user properties according to the string "op". The following
+ * is a description of what different strings will do:
+ *
+ * on           Enable the user: it is possible to authenticate as this user.
+ * off          Disable the user: it's no longer possible to authenticate
+ *              with this user, however the already authenticated connections
+ *              will still work.
+ * +<command>   Allow the execution of that command
+ * -<command>   Disallow the execution of that command
+ * +@<category> Allow the execution of all the commands in such category
+ *              with valid categories are like @admin, @set, @sortedset, ...
+ *              and so forth, see the full list in the server.c file where
+ *              the Redis command table is described and defined.
+ *              The special category @all means all the commands, but currently
+ *              present in the server, and that will be loaded in the future
+ *              via modules.
+ * +<command>|subcommand    Allow a specific subcommand of an otherwise
+ *                          disabled command. Note that this form is not
+ *                          allowed as negative like -DEBUG|SEGFAULT, but
+ *                          only additive starting with "+".
+ * allcommands  Alias for +@all. Note that it implies the ability to execute
+ *              all the future commands loaded via the modules system.
+ * nocommands   Alias for -@all.
+ * ~<pattern>   Add a pattern of keys that can be mentioned as part of
+ *              commands. For instance ~* allows all the keys. The pattern
+ *              is a glob-style pattern like the one of KEYS.
+ *              It is possible to specify multiple patterns.
+ * allkeys      Alias for ~*
+ * resetkeys    Flush the list of allowed keys patterns.
+ * &<pattern>   Add a pattern of channels that can be mentioned as part of
+ *              Pub/Sub commands. For instance &* allows all the channels. The
+ *              pattern is a glob-style pattern like the one of PSUBSCRIBE.
+ *              It is possible to specify multiple patterns.
+ * allchannels              Alias for &*
+ * resetchannels            Flush the list of allowed keys patterns.
+ * ><password>  Add this password to the list of valid password for the user.
+ *              For example >mypass will add "mypass" to the list.
+ *              This directive clears the "nopass" flag (see later).
+ * #<hash>      Add this password hash to the list of valid hashes for
+ *              the user. This is useful if you have previously computed
+ *              the hash, and don't want to store it in plaintext.
+ *              This directive clears the "nopass" flag (see later).
+ * <<password>  Remove this password from the list of valid passwords.
+ * !<hash>      Remove this hashed password from the list of valid passwords.
+ *              This is useful when you want to remove a password just by
+ *              hash without knowing its plaintext version at all.
+ * nopass       All the set passwords of the user are removed, and the user
+ *              is flagged as requiring no password: it means that every
+ *              password will work against this user. If this directive is
+ *              used for the default user, every new connection will be
+ *              immediately authenticated with the default user without
+ *              any explicit AUTH command required. Note that the "resetpass"
+ *              directive will clear this condition.
+ * resetpass    Flush the list of allowed passwords. Moreover removes the
+ *              "nopass" status. After "resetpass" the user has no associated
+ *              passwords and there is no way to authenticate without adding
+ *              some password (or setting it as "nopass" later).
+ * reset        Performs the following actions: resetpass, resetkeys, off,
+ *              -@all. The user returns to the same state it has immediately
+ *              after its creation.
+ *
+ * The 'op' string must be null terminated. The 'oplen' argument should
+ * specify the length of the 'op' string in case the caller requires to pass
+ * binary data (for instance the >password form may use a binary password).
+ * Otherwise the field can be set to -1 and the function will use strlen()
+ * to determine the length.
+ *
+ * The function returns C_OK if the action to perform was understood because
+ * the 'op' string made sense. Otherwise C_ERR is returned if the operation
+ * is unknown or has some syntax error.
+ *
+ * When an error is returned, errno is set to the following values:
+ *
+ * EINVAL: The specified opcode is not understood or the key/channel pattern is
+ *         invalid (contains non allowed characters).
+ * ENOENT: The command name or command category provided with + or - is not
+ *         known.
+ * EEXIST: You are adding a key pattern after "*" was already added. This is
+ *         almost surely an error on the user side.
+ * EISDIR: You are adding a channel pattern after "*" was already added. This is
+ *         almost surely an error on the user side.
+ * ENODEV: The password you are trying to remove from the user does not exist.
+ * EBADMSG: The hash you are trying to add is not a valid hash.
+ */
+int ACLSetUser(user *u, const char *op, ssize_t oplen) {
+    if (oplen == -1) oplen = strlen(op);
+    if (oplen == 0) return C_OK; /* Empty string is a no-operation. */
+    if (!strcasecmp(op,"on")) {
+        u->flags |= USER_FLAG_ENABLED;
+        u->flags &= ~USER_FLAG_DISABLED;
+    } else if (!strcasecmp(op,"off")) {
+        u->flags |= USER_FLAG_DISABLED;
+        u->flags &= ~USER_FLAG_ENABLED;
+    } else if (!strcasecmp(op,"skip-sanitize-payload")) {
+        u->flags |= USER_FLAG_SANITIZE_PAYLOAD_SKIP;
+        u->flags &= ~USER_FLAG_SANITIZE_PAYLOAD;
+    } else if (!strcasecmp(op,"sanitize-payload")) {
+        u->flags &= ~USER_FLAG_SANITIZE_PAYLOAD_SKIP;
+        u->flags |= USER_FLAG_SANITIZE_PAYLOAD;
+    } else if (!strcasecmp(op,"allkeys") ||
+               !strcasecmp(op,"~*"))
+    {
+        u->flags |= USER_FLAG_ALLKEYS;
+        listEmpty(u->patterns);
+    } else if (!strcasecmp(op,"resetkeys")) {
+        u->flags &= ~USER_FLAG_ALLKEYS;
+        listEmpty(u->patterns);
+    } else if (!strcasecmp(op,"allchannels") ||
+               !strcasecmp(op,"&*"))
+    {
+        u->flags |= USER_FLAG_ALLCHANNELS;
+        listEmpty(u->channels);
+    } else if (!strcasecmp(op,"resetchannels")) {
+        u->flags &= ~USER_FLAG_ALLCHANNELS;
+        listEmpty(u->channels);
+    } else if (!strcasecmp(op,"allcommands") ||
+               !strcasecmp(op,"+@all"))
+    {
+        memset(u->allowed_commands,255,sizeof(u->allowed_commands));
+        u->flags |= USER_FLAG_ALLCOMMANDS;
+        ACLResetSubcommands(u);
+    } else if (!strcasecmp(op,"nocommands") ||
+               !strcasecmp(op,"-@all"))
+    {
+        memset(u->allowed_commands,0,sizeof(u->allowed_commands));
+        u->flags &= ~USER_FLAG_ALLCOMMANDS;
+        ACLResetSubcommands(u);
+    } else if (!strcasecmp(op,"nopass")) {
+        u->flags |= USER_FLAG_NOPASS;
+        listEmpty(u->passwords);
+    } else if (!strcasecmp(op,"resetpass")) {
+        u->flags &= ~USER_FLAG_NOPASS;
+        listEmpty(u->passwords);
+    } else if (op[0] == '>' || op[0] == '#') {
+        sds newpass;
+        if (op[0] == '>') {
+            newpass = ACLHashPassword((unsigned char*)op+1,oplen-1);
+        } else {
+            if (ACLCheckPasswordHash((unsigned char*)op+1,oplen-1) == C_ERR) {
+                errno = EBADMSG;
+                return C_ERR;
+            }
+            newpass = sdsnewlen(op+1,oplen-1);
+        }
+
+        listNode *ln = listSearchKey(u->passwords,newpass);
+        /* Avoid re-adding the same password multiple times. */
+        if (ln == NULL)
+            listAddNodeTail(u->passwords,newpass);
+        else
+            sdsfree(newpass);
+        u->flags &= ~USER_FLAG_NOPASS;
+    } else if (op[0] == '<' || op[0] == '!') {
+        sds delpass;
+        if (op[0] == '<') {
+            delpass = ACLHashPassword((unsigned char*)op+1,oplen-1);
+        } else {
+            if (ACLCheckPasswordHash((unsigned char*)op+1,oplen-1) == C_ERR) {
+                errno = EBADMSG;
+                return C_ERR;
+            }
+            delpass = sdsnewlen(op+1,oplen-1);
+        }
+        listNode *ln = listSearchKey(u->passwords,delpass);
+        sdsfree(delpass);
+        if (ln) {
+            listDelNode(u->passwords,ln);
+        } else {
+            errno = ENODEV;
+            return C_ERR;
+        }
+    } else if (op[0] == '~') {
+        if (u->flags & USER_FLAG_ALLKEYS) {
+            errno = EEXIST;
+            return C_ERR;
+        }
+        if (ACLStringHasSpaces(op+1,oplen-1)) {
+            errno = EINVAL;
+            return C_ERR;
+        }
+        sds newpat = sdsnewlen(op+1,oplen-1);
+        listNode *ln = listSearchKey(u->patterns,newpat);
+        /* Avoid re-adding the same key pattern multiple times. */
+        if (ln == NULL)
+            listAddNodeTail(u->patterns,newpat);
+        else
+            sdsfree(newpat);
+        u->flags &= ~USER_FLAG_ALLKEYS;
+    } else if (op[0] == '&') {
+        if (u->flags & USER_FLAG_ALLCHANNELS) {
+            errno = EISDIR;
+            return C_ERR;
+        }
+        if (ACLStringHasSpaces(op+1,oplen-1)) {
+            errno = EINVAL;
+            return C_ERR;
+        }
+        sds newpat = sdsnewlen(op+1,oplen-1);
+        listNode *ln = listSearchKey(u->channels,newpat);
+        /* Avoid re-adding the same channel pattern multiple times. */
+        if (ln == NULL)
+            listAddNodeTail(u->channels,newpat);
+        else
+            sdsfree(newpat);
+        u->flags &= ~USER_FLAG_ALLCHANNELS;
+    } else if (op[0] == '+' && op[1] != '@') {
+        if (strchr(op,'|') == NULL) {
+            if (ACLLookupCommand(op+1) == NULL) {
+                errno = ENOENT;
+                return C_ERR;
+            }
+            unsigned long id = ACLGetCommandID(op+1);
+            ACLSetUserCommandBit(u,id,1);
+            ACLResetSubcommandsForCommand(u,id);
+        } else {
+            /* Split the command and subcommand parts. */
+            char *copy = zstrdup(op+1);
+            char *sub = strchr(copy,'|');
+            sub[0] = '\0';
+            sub++;
+
+            /* Check if the command exists. We can't check the
+             * subcommand to see if it is valid. */
+            if (ACLLookupCommand(copy) == NULL) {
+                zfree(copy);
+                errno = ENOENT;
+                return C_ERR;
+            }
+
+            /* The subcommand cannot be empty, so things like DEBUG|
+             * are syntax errors of course. */
+            if (strlen(sub) == 0) {
+                zfree(copy);
+                errno = EINVAL;
+                return C_ERR;
+            }
+
+            unsigned long id = ACLGetCommandID(copy);
+            /* Add the subcommand to the list of valid ones, if the command is not set. */
+            if (ACLGetUserCommandBit(u,id) == 0) {
+                ACLAddAllowedSubcommand(u,id,sub);
+            }
+
+            zfree(copy);
+        }
+    } else if (op[0] == '-' && op[1] != '@') {
+        if (ACLLookupCommand(op+1) == NULL) {
+            errno = ENOENT;
+            return C_ERR;
+        }
+        unsigned long id = ACLGetCommandID(op+1);
+        ACLSetUserCommandBit(u,id,0);
+        ACLResetSubcommandsForCommand(u,id);
+    } else if ((op[0] == '+' || op[0] == '-') && op[1] == '@') {
+        int bitval = op[0] == '+' ? 1 : 0;
+        if (ACLSetUserCommandBitsForCategory(u,op+2,bitval) == C_ERR) {
+            errno = ENOENT;
+            return C_ERR;
+        }
+    } else if (!strcasecmp(op,"reset")) {
+        serverAssert(ACLSetUser(u,"resetpass",-1) == C_OK);
+        serverAssert(ACLSetUser(u,"resetkeys",-1) == C_OK);
+        serverAssert(ACLSetUser(u,"resetchannels",-1) == C_OK);
+        if (server.acl_pubsub_default & USER_FLAG_ALLCHANNELS)
+            serverAssert(ACLSetUser(u,"allchannels",-1) == C_OK);
+        serverAssert(ACLSetUser(u,"off",-1) == C_OK);
+        serverAssert(ACLSetUser(u,"sanitize-payload",-1) == C_OK);
+        serverAssert(ACLSetUser(u,"-@all",-1) == C_OK);
+    } else {
+        errno = EINVAL;
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+/* Return a description of the error that occurred in ACLSetUser() according to
+ * the errno value set by the function on error. */
+const char *ACLSetUserStringError(void) {
+    const char *errmsg = "Wrong format";
+    if (errno == ENOENT)
+        errmsg = "Unknown command or category name in ACL";
+    else if (errno == EINVAL)
+        errmsg = "Syntax error";
+    else if (errno == EEXIST)
+        errmsg = "Adding a pattern after the * pattern (or the "
+                 "'allkeys' flag) is not valid and does not have any "
+                 "effect. Try 'resetkeys' to start with an empty "
+                 "list of patterns";
+    else if (errno == EISDIR)
+        errmsg = "Adding a pattern after the * pattern (or the "
+                 "'allchannels' flag) is not valid and does not have any "
+                 "effect. Try 'resetchannels' to start with an empty "
+                 "list of channels";
+    else if (errno == ENODEV)
+        errmsg = "The password you are trying to remove from the user does "
+                 "not exist";
+    else if (errno == EBADMSG)
+        errmsg = "The password hash must be exactly 64 characters and contain "
+                 "only lowercase hexadecimal characters";
+    return errmsg;
+}
+
+/* Initialize the default user, that will always exist for all the process
+ * lifetime. */
+void ACLInitDefaultUser(void) {
+    DefaultUser = ACLCreateUser("default",7);
+    ACLSetUser(DefaultUser,"+@all",-1);
+    ACLSetUser(DefaultUser,"~*",-1);
+    ACLSetUser(DefaultUser,"&*",-1);
+    ACLSetUser(DefaultUser,"on",-1);
+    ACLSetUser(DefaultUser,"nopass",-1);
+}
+
+/* Initialization of the ACL subsystem. */
+void ACLInit(void) {
+    Users = raxNew();
+    UsersToLoad = listCreate();
+    ACLLog = listCreate();
+    ACLInitDefaultUser();
+}
+
+/* Check the username and password pair and return C_OK if they are valid,
+ * otherwise C_ERR is returned and errno is set to:
+ *
+ *  EINVAL: if the username-password do not match.
+ *  ENONENT: if the specified user does not exist at all.
+ */
+int ACLCheckUserCredentials(robj *username, robj *password) {
+    user *u = ACLGetUserByName(username->ptr,sdslen(username->ptr));
+    if (u == NULL) {
+        errno = ENOENT;
+        return C_ERR;
+    }
+
+    /* Disabled users can't login. */
+    if (u->flags & USER_FLAG_DISABLED) {
+        errno = EINVAL;
+        return C_ERR;
+    }
+
+    /* If the user is configured to don't require any password, we
+     * are already fine here. */
+    if (u->flags & USER_FLAG_NOPASS) return C_OK;
+
+    /* Check all the user passwords for at least one to match. */
+    listIter li;
+    listNode *ln;
+    listRewind(u->passwords,&li);
+    sds hashed = ACLHashPassword(password->ptr,sdslen(password->ptr));
+    while((ln = listNext(&li))) {
+        sds thispass = listNodeValue(ln);
+        if (!time_independent_strcmp(hashed, thispass)) {
+            sdsfree(hashed);
+            return C_OK;
+        }
+    }
+    sdsfree(hashed);
+
+    /* If we reached this point, no password matched. */
+    errno = EINVAL;
+    return C_ERR;
+}
+
+/* This is like ACLCheckUserCredentials(), however if the user/pass
+ * are correct, the connection is put in authenticated state and the
+ * connection user reference is populated.
+ *
+ * The return value is C_OK or C_ERR with the same meaning as
+ * ACLCheckUserCredentials(). */
+int ACLAuthenticateUser(client *c, robj *username, robj *password) {
+    if (ACLCheckUserCredentials(username,password) == C_OK) {
+        c->authenticated = 1;
+        c->user = ACLGetUserByName(username->ptr,sdslen(username->ptr));
+        moduleNotifyUserChanged(c);
+        return C_OK;
+    } else {
+        addACLLogEntry(c,ACL_DENIED_AUTH,0,username->ptr);
+        return C_ERR;
+    }
+}
+
+/* For ACL purposes, every user has a bitmap with the commands that such
+ * user is allowed to execute. In order to populate the bitmap, every command
+ * should have an assigned ID (that is used to index the bitmap). This function
+ * creates such an ID: it uses sequential IDs, reusing the same ID for the same
+ * command name, so that a command retains the same ID in case of modules that
+ * are unloaded and later reloaded. */
+unsigned long ACLGetCommandID(const char *cmdname) {
+
+    sds lowername = sdsnew(cmdname);
+    sdstolower(lowername);
+    if (commandId == NULL) commandId = raxNew();
+    void *id = raxFind(commandId,(unsigned char*)lowername,sdslen(lowername));
+    if (id != raxNotFound) {
+        sdsfree(lowername);
+        return (unsigned long)id;
+    }
+    raxInsert(commandId,(unsigned char*)lowername,strlen(lowername),
+              (void*)nextid,NULL);
+    sdsfree(lowername);
+    unsigned long thisid = nextid;
+    nextid++;
+
+    /* We never assign the last bit in the user commands bitmap structure,
+     * this way we can later check if this bit is set, understanding if the
+     * current ACL for the user was created starting with a +@all to add all
+     * the possible commands and just subtracting other single commands or
+     * categories, or if, instead, the ACL was created just adding commands
+     * and command categories from scratch, not allowing future commands by
+     * default (loaded via modules). This is useful when rewriting the ACLs
+     * with ACL SAVE. */
+    if (nextid == USER_COMMAND_BITS_COUNT-1) nextid++;
+    return thisid;
+}
+
+/* Clear command id table and reset nextid to 0. */
+void ACLClearCommandID(void) {
+    if (commandId) raxFree(commandId);
+    commandId = NULL;
+    nextid = 0;
+}
+
+/* Return an username by its name, or NULL if the user does not exist. */
+user *ACLGetUserByName(const char *name, size_t namelen) {
+    void *myuser = raxFind(Users,(unsigned char*)name,namelen);
+    if (myuser == raxNotFound) return NULL;
+    return myuser;
+}
+
+/* Check if the command is ready to be executed in the client 'c', already
+ * referenced by c->cmd, and can be executed by this client according to the
+ * ACLs associated to the client user c->user.
+ *
+ * If the user can execute the command ACL_OK is returned, otherwise
+ * ACL_DENIED_CMD or ACL_DENIED_KEY is returned: the first in case the
+ * command cannot be executed because the user is not allowed to run such
+ * command, the second if the command is denied because the user is trying
+ * to access keys that are not among the specified patterns. */
+int ACLCheckCommandPerm(client *c, int *keyidxptr) {
+    user *u = c->user;
+    uint64_t id = c->cmd->id;
+
+    /* If there is no associated user, the connection can run anything. */
+    if (u == NULL) return ACL_OK;
+
+    /* Check if the user can execute this command or if the command
+     * doesn't need to be authenticated (hello, auth). */
+    if (!(u->flags & USER_FLAG_ALLCOMMANDS) && !(c->cmd->flags & CMD_NO_AUTH))
+    {
+        /* If the bit is not set we have to check further, in case the
+         * command is allowed just with that specific subcommand. */
+        if (ACLGetUserCommandBit(u,id) == 0) {
+            /* Check if the subcommand matches. */
+            if (c->argc < 2 ||
+                u->allowed_subcommands == NULL ||
+                u->allowed_subcommands[id] == NULL)
+            {
+                return ACL_DENIED_CMD;
+            }
+
+            long subid = 0;
+            while (1) {
+                if (u->allowed_subcommands[id][subid] == NULL)
+                    return ACL_DENIED_CMD;
+                if (!strcasecmp(c->argv[1]->ptr,
+                                u->allowed_subcommands[id][subid]))
+                    break; /* Subcommand match found. Stop here. */
+                subid++;
+            }
+        }
+    }
+
+    /* Check if the user can execute commands explicitly touching the keys
+     * mentioned in the command arguments. */
+    if (!(c->user->flags & USER_FLAG_ALLKEYS) &&
+        (c->cmd->getkeys_proc || c->cmd->firstkey))
+    {
+        getKeysResult result = GETKEYS_RESULT_INIT;
+        int numkeys = getKeysFromCommand(c->cmd,c->argv,c->argc,&result);
+        int *keyidx = result.keys;
+        for (int j = 0; j < numkeys; j++) {
+            listIter li;
+            listNode *ln;
+            listRewind(u->patterns,&li);
+
+            /* Test this key against every pattern. */
+            int match = 0;
+            while((ln = listNext(&li))) {
+                sds pattern = listNodeValue(ln);
+                size_t plen = sdslen(pattern);
+                int idx = keyidx[j];
+                if (stringmatchlen(pattern,plen,c->argv[idx]->ptr,
+                                   sdslen(c->argv[idx]->ptr),0))
+                {
+                    match = 1;
+                    break;
+                }
+            }
+            if (!match) {
+                if (keyidxptr) *keyidxptr = keyidx[j];
+                getKeysFreeResult(&result);
+                return ACL_DENIED_KEY;
+            }
+        }
+        getKeysFreeResult(&result);
+    }
+
+    /* If we survived all the above checks, the user can execute the
+     * command. */
+    return ACL_OK;
+}
+
+/* Check if the provided channel is whitelisted by the given allowed channels
+ * list. Glob-style pattern matching is employed, unless the literal flag is
+ * set. Returns ACL_OK if access is granted or ACL_DENIED_CHANNEL otherwise. */
+int ACLCheckPubsubChannelPerm(sds channel, list *allowed, int literal) {
+    listIter li;
+    listNode *ln;
+    size_t clen = sdslen(channel);
+    int match = 0;
+
+    listRewind(allowed,&li);
+    while((ln = listNext(&li))) {
+        sds pattern = listNodeValue(ln);
+        size_t plen = sdslen(pattern);
+
+        if ((literal && !sdscmp(pattern,channel)) || 
+            (!literal && stringmatchlen(pattern,plen,channel,clen,0)))
+        {
+            match = 1;
+            break;
+        }
+    }
+    if (!match) {
+        return ACL_DENIED_CHANNEL;
+    }
+    return ACL_OK;
+}
+
+/* Check if the user's existing pub/sub clients violate the ACL pub/sub
+ * permissions specified via the upcoming argument, and kill them if so. */
+void ACLKillPubsubClientsIfNeeded(user *u, list *upcoming) {
+    listIter li, lpi;
+    listNode *ln, *lpn;
+    robj *o;
+    int kill = 0;
+    
+    /* Nothing to kill when the upcoming are a literal super set of the original
+     * permissions. */
+    listRewind(u->channels,&li);
+    while (!kill && ((ln = listNext(&li)) != NULL)) {
+        sds pattern = listNodeValue(ln);
+        kill = (ACLCheckPubsubChannelPerm(pattern,upcoming,1) ==
+                ACL_DENIED_CHANNEL);
+    }
+    if (!kill) return;
+
+    /* Scan all connected clients to find the user's pub/subs. */
+    listRewind(server.clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        client *c = listNodeValue(ln);
+        kill = 0;
+
+        if (c->user == u && getClientType(c) == CLIENT_TYPE_PUBSUB) {
+            /* Check for pattern violations. */
+            listRewind(c->pubsub_patterns,&lpi);
+            while (!kill && ((lpn = listNext(&lpi)) != NULL)) {
+                o = lpn->value;
+                kill = (ACLCheckPubsubChannelPerm(o->ptr,upcoming,1) == 
+                        ACL_DENIED_CHANNEL);
+            }
+            /* Check for channel violations. */
+            if (!kill) {
+                dictIterator *di = dictGetIterator(c->pubsub_channels);
+                dictEntry *de;                
+                while (!kill && ((de = dictNext(di)) != NULL)) {
+                    o = dictGetKey(de);
+                    kill = (ACLCheckPubsubChannelPerm(o->ptr,upcoming,0) ==
+                            ACL_DENIED_CHANNEL);
+                }
+                dictReleaseIterator(di);
+            }
+
+            /* Kill it. */
+            if (kill) {
+                freeClient(c);
+            }
+        }
+    }
+}
+
+/* Check if the pub/sub channels of the command, that's ready to be executed in
+ * the client 'c', can be executed by this client according to the ACLs channels
+ * associated to the client user c->user.
+ * 
+ * idx and count are the index and count of channel arguments from the
+ * command. The literal argument controls whether the user's ACL channels are 
+ * evaluated as literal values or matched as glob-like patterns.
+ *
+ * If the user can execute the command ACL_OK is returned, otherwise 
+ * ACL_DENIED_CHANNEL. */
+int ACLCheckPubsubPerm(client *c, int idx, int count, int literal, int *idxptr) {
+    user *u = c->user;
+
+    /* If there is no associated user, the connection can run anything. */
+    if (u == NULL) return ACL_OK;
+
+    /* Check if the user can access the channels mentioned in the command's
+     * arguments. */
+    if (!(c->user->flags & USER_FLAG_ALLCHANNELS)) {
+        for (int j = idx; j < idx+count; j++) {
+            if (ACLCheckPubsubChannelPerm(c->argv[j]->ptr,u->channels,literal)
+                != ACL_OK) {
+                if (idxptr) *idxptr = j;
+                return ACL_DENIED_CHANNEL;
+            }
+        }
+    }
+
+    /* If we survived all the above checks, the user can execute the
+     * command. */
+    return ACL_OK;
+
+}
+
+/* Check whether the command is ready to be exceuted by ACLCheckCommandPerm.
+ * If check passes, then check whether pub/sub channels of the command is
+ * ready to be executed by ACLCheckPubsubPerm */
+int ACLCheckAllPerm(client *c, int *idxptr) {
+    int acl_retval = ACLCheckCommandPerm(c,idxptr);
+    if (acl_retval != ACL_OK)
+        return acl_retval;
+    if (c->cmd->proc == publishCommand)
+        acl_retval = ACLCheckPubsubPerm(c,1,1,0,idxptr);
+    else if (c->cmd->proc == subscribeCommand)
+        acl_retval = ACLCheckPubsubPerm(c,1,c->argc-1,0,idxptr);
+    else if (c->cmd->proc == psubscribeCommand)
+        acl_retval = ACLCheckPubsubPerm(c,1,c->argc-1,1,idxptr);
+    return acl_retval;
+}
+
+/* =============================================================================
+ * ACL loading / saving functions
+ * ==========================================================================*/
+
+/* Given an argument vector describing a user in the form:
+ *
+ *      user <username> ... ACL rules and flags ...
+ *
+ * this function validates, and if the syntax is valid, appends
+ * the user definition to a list for later loading.
+ *
+ * The rules are tested for validity and if there obvious syntax errors
+ * the function returns C_ERR and does nothing, otherwise C_OK is returned
+ * and the user is appended to the list.
+ *
+ * Note that this function cannot stop in case of commands that are not found
+ * and, in that case, the error will be emitted later, because certain
+ * commands may be defined later once modules are loaded.
+ *
+ * When an error is detected and C_ERR is returned, the function populates
+ * by reference (if not set to NULL) the argc_err argument with the index
+ * of the argv vector that caused the error. */
+int ACLAppendUserForLoading(sds *argv, int argc, int *argc_err) {
+    if (argc < 2 || strcasecmp(argv[0],"user")) {
+        if (argc_err) *argc_err = 0;
+        return C_ERR;
+    }
+
+    /* Try to apply the user rules in a fake user to see if they
+     * are actually valid. */
+    user *fakeuser = ACLCreateUnlinkedUser();
+
+    for (int j = 2; j < argc; j++) {
+        if (ACLSetUser(fakeuser,argv[j],sdslen(argv[j])) == C_ERR) {
+            if (errno != ENOENT) {
+                ACLFreeUser(fakeuser);
+                if (argc_err) *argc_err = j;
+                return C_ERR;
+            }
+        }
+    }
+
+    /* Rules look valid, let's append the user to the list. */
+    sds *copy = zmalloc(sizeof(sds)*argc);
+    for (int j = 1; j < argc; j++) copy[j-1] = sdsdup(argv[j]);
+    copy[argc-1] = NULL;
+    listAddNodeTail(UsersToLoad,copy);
+    ACLFreeUser(fakeuser);
+    return C_OK;
+}
+
+/* This function will load the configured users appended to the server
+ * configuration via ACLAppendUserForLoading(). On loading errors it will
+ * log an error and return C_ERR, otherwise C_OK will be returned. */
+int ACLLoadConfiguredUsers(void) {
+    listIter li;
+    listNode *ln;
+    listRewind(UsersToLoad,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        sds *aclrules = listNodeValue(ln);
+        sds username = aclrules[0];
+
+        if (ACLStringHasSpaces(aclrules[0],sdslen(aclrules[0]))) {
+            serverLog(LL_WARNING,"Spaces not allowed in ACL usernames");
+            return C_ERR;
+        }
+
+        user *u = ACLCreateUser(username,sdslen(username));
+        if (!u) {
+            u = ACLGetUserByName(username,sdslen(username));
+            serverAssert(u != NULL);
+            ACLSetUser(u,"reset",-1);
+        }
+
+        /* Load every rule defined for this user. */
+        for (int j = 1; aclrules[j]; j++) {
+            if (ACLSetUser(u,aclrules[j],sdslen(aclrules[j])) != C_OK) {
+                const char *errmsg = ACLSetUserStringError();
+                serverLog(LL_WARNING,"Error loading ACL rule '%s' for "
+                                     "the user named '%s': %s",
+                          aclrules[j],aclrules[0],errmsg);
+                return C_ERR;
+            }
+        }
+
+        /* Having a disabled user in the configuration may be an error,
+         * warn about it without returning any error to the caller. */
+        if (u->flags & USER_FLAG_DISABLED) {
+            serverLog(LL_NOTICE, "The user '%s' is disabled (there is no "
+                                 "'on' modifier in the user description). Make "
+                                 "sure this is not a configuration error.",
+                      aclrules[0]);
+        }
+    }
+    return C_OK;
+}
+
+/* This function loads the ACL from the specified filename: every line
+ * is validated and should be either empty or in the format used to specify
+ * users in the redis.conf configuration or in the ACL file, that is:
+ *
+ *  user <username> ... rules ...
+ *
+ * Note that this function considers comments starting with '#' as errors
+ * because the ACL file is meant to be rewritten, and comments would be
+ * lost after the rewrite. Yet empty lines are allowed to avoid being too
+ * strict.
+ *
+ * One important part of implementing ACL LOAD, that uses this function, is
+ * to avoid ending with broken rules if the ACL file is invalid for some
+ * reason, so the function will attempt to validate the rules before loading
+ * each user. For every line that will be found broken the function will
+ * collect an error message.
+ *
+ * IMPORTANT: If there is at least a single error, nothing will be loaded
+ * and the rules will remain exactly as they were.
+ *
+ * At the end of the process, if no errors were found in the whole file then
+ * NULL is returned. Otherwise an SDS string describing in a single line
+ * a description of all the issues found is returned. */
+sds ACLLoadFromFile(const char *filename) {
+    FILE *fp;
+    char buf[1024];
+
+    /* Open the ACL file. */
+    if ((fp = fopen(filename,"r")) == NULL) {
+        sds errors = sdscatprintf(sdsempty(),
+            "Error loading ACLs, opening file '%s': %s",
+            filename, strerror(errno));
+        return errors;
+    }
+
+    /* Load the whole file as a single string in memory. */
+    sds acls = sdsempty();
+    while(fgets(buf,sizeof(buf),fp) != NULL)
+        acls = sdscat(acls,buf);
+    fclose(fp);
+
+    /* Split the file into lines and attempt to load each line. */
+    int totlines;
+    sds *lines, errors = sdsempty();
+    lines = sdssplitlen(acls,strlen(acls),"\n",1,&totlines);
+    sdsfree(acls);
+
+    /* We need a fake user to validate the rules before making changes
+     * to the real user mentioned in the ACL line. */
+    user *fakeuser = ACLCreateUnlinkedUser();
+
+    /* We do all the loading in a fresh instance of the Users radix tree,
+     * so if there are errors loading the ACL file we can rollback to the
+     * old version. */
+    rax *old_users = Users;
+    user *old_default_user = DefaultUser;
+    Users = raxNew();
+    ACLInitDefaultUser();
+
+    /* Load each line of the file. */
+    for (int i = 0; i < totlines; i++) {
+        sds *argv;
+        int argc;
+        int linenum = i+1;
+
+        lines[i] = sdstrim(lines[i]," \t\r\n");
+
+        /* Skip blank lines */
+        if (lines[i][0] == '\0') continue;
+
+        /* Split into arguments */
+        argv = sdssplitlen(lines[i],sdslen(lines[i])," ",1,&argc);
+        if (argv == NULL) {
+            errors = sdscatprintf(errors,
+                     "%s:%d: unbalanced quotes in acl line. ",
+                     server.acl_filename, linenum);
+            continue;
+        }
+
+        /* Skip this line if the resulting command vector is empty. */
+        if (argc == 0) {
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* The line should start with the "user" keyword. */
+        if (strcmp(argv[0],"user") || argc < 2) {
+            errors = sdscatprintf(errors,
+                     "%s:%d should start with user keyword followed "
+                     "by the username. ", server.acl_filename,
+                     linenum);
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* Spaces are not allowed in usernames. */
+        if (ACLStringHasSpaces(argv[1],sdslen(argv[1]))) {
+            errors = sdscatprintf(errors,
+                     "'%s:%d: username '%s' contains invalid characters. ",
+                     server.acl_filename, linenum, argv[1]);
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* Try to process the line using the fake user to validate if
+         * the rules are able to apply cleanly. At this stage we also
+         * trim trailing spaces, so that we don't have to handle that
+         * in ACLSetUser(). */
+        ACLSetUser(fakeuser,"reset",-1);
+        int j;
+        for (j = 2; j < argc; j++) {
+            argv[j] = sdstrim(argv[j],"\t\r\n");
+            if (ACLSetUser(fakeuser,argv[j],sdslen(argv[j])) != C_OK) {
+                const char *errmsg = ACLSetUserStringError();
+                errors = sdscatprintf(errors,
+                         "%s:%d: %s. ",
+                         server.acl_filename, linenum, errmsg);
+                continue;
+            }
+        }
+
+        /* Apply the rule to the new users set only if so far there
+         * are no errors, otherwise it's useless since we are going
+         * to discard the new users set anyway. */
+        if (sdslen(errors) != 0) {
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* We can finally lookup the user and apply the rule. If the
+         * user already exists we always reset it to start. */
+        user *u = ACLCreateUser(argv[1],sdslen(argv[1]));
+        if (!u) {
+            u = ACLGetUserByName(argv[1],sdslen(argv[1]));
+            serverAssert(u != NULL);
+            ACLSetUser(u,"reset",-1);
+        }
+
+        /* Note that the same rules already applied to the fake user, so
+         * we just assert that everything goes well: it should. */
+        for (j = 2; j < argc; j++)
+            serverAssert(ACLSetUser(u,argv[j],sdslen(argv[j])) == C_OK);
+
+        sdsfreesplitres(argv,argc);
+    }
+
+    ACLFreeUser(fakeuser);
+    sdsfreesplitres(lines,totlines);
+    DefaultUser = old_default_user; /* This pointer must never change. */
+
+    /* Check if we found errors and react accordingly. */
+    if (sdslen(errors) == 0) {
+        /* The default user pointer is referenced in different places: instead
+         * of replacing such occurrences it is much simpler to copy the new
+         * default user configuration in the old one. */
+        user *new = ACLGetUserByName("default",7);
+        serverAssert(new != NULL);
+        ACLCopyUser(DefaultUser,new);
+        ACLFreeUser(new);
+        raxInsert(Users,(unsigned char*)"default",7,DefaultUser,NULL);
+        raxRemove(old_users,(unsigned char*)"default",7,NULL);
+        ACLFreeUsersSet(old_users);
+        sdsfree(errors);
+        return NULL;
+    } else {
+        ACLFreeUsersSet(Users);
+        Users = old_users;
+        errors = sdscat(errors,"WARNING: ACL errors detected, no change to the previously active ACL rules was performed");
+        return errors;
+    }
+}
+
+/* Generate a copy of the ACLs currently in memory in the specified filename.
+ * Returns C_OK on success or C_ERR if there was an error during the I/O.
+ * When C_ERR is returned a log is produced with hints about the issue. */
+int ACLSaveToFile(const char *filename) {
+    sds acl = sdsempty();
+    int fd = -1;
+    sds tmpfilename = NULL;
+    int retval = C_ERR;
+
+    /* Let's generate an SDS string containing the new version of the
+     * ACL file. */
+    raxIterator ri;
+    raxStart(&ri,Users);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        user *u = ri.data;
+        /* Return information in the configuration file format. */
+        sds user = sdsnew("user ");
+        user = sdscatsds(user,u->name);
+        user = sdscatlen(user," ",1);
+        sds descr = ACLDescribeUser(u);
+        user = sdscatsds(user,descr);
+        sdsfree(descr);
+        acl = sdscatsds(acl,user);
+        acl = sdscatlen(acl,"\n",1);
+        sdsfree(user);
+    }
+    raxStop(&ri);
+
+    /* Create a temp file with the new content. */
+    tmpfilename = sdsnew(filename);
+    tmpfilename = sdscatfmt(tmpfilename,".tmp-%i-%I",
+        (int)getpid(),(int)mstime());
+    if ((fd = open(tmpfilename,O_WRONLY|O_CREAT,0644)) == -1) {
+        serverLog(LL_WARNING,"Opening temp ACL file for ACL SAVE: %s",
+            strerror(errno));
+        goto cleanup;
+    }
+
+    /* Write it. */
+    if (write(fd,acl,sdslen(acl)) != (ssize_t)sdslen(acl)) {
+        serverLog(LL_WARNING,"Writing ACL file for ACL SAVE: %s",
+            strerror(errno));
+        goto cleanup;
+    }
+    close(fd); fd = -1;
+
+    /* Let's replace the new file with the old one. */
+    if (rename(tmpfilename,filename) == -1) {
+        serverLog(LL_WARNING,"Renaming ACL file for ACL SAVE: %s",
+            strerror(errno));
+        goto cleanup;
+    }
+    sdsfree(tmpfilename); tmpfilename = NULL;
+    retval = C_OK; /* If we reached this point, everything is fine. */
+
+cleanup:
+    if (fd != -1) close(fd);
+    if (tmpfilename) unlink(tmpfilename);
+    sdsfree(tmpfilename);
+    sdsfree(acl);
+    return retval;
+}
+
+/* This function is called once the server is already running, modules are
+ * loaded, and we are ready to start, in order to load the ACLs either from
+ * the pending list of users defined in redis.conf, or from the ACL file.
+ * The function will just exit with an error if the user is trying to mix
+ * both the loading methods. */
+void ACLLoadUsersAtStartup(void) {
+    if (server.acl_filename[0] != '\0' && listLength(UsersToLoad) != 0) {
+        serverLog(LL_WARNING,
+            "Configuring Redis with users defined in redis.conf and at "
+            "the same setting an ACL file path is invalid. This setup "
+            "is very likely to lead to configuration errors and security "
+            "holes, please define either an ACL file or declare users "
+            "directly in your redis.conf, but not both.");
+        exit(1);
+    }
+
+    if (ACLLoadConfiguredUsers() == C_ERR) {
+        serverLog(LL_WARNING,
+            "Critical error while loading ACLs. Exiting.");
+        exit(1);
+    }
+
+    if (server.acl_filename[0] != '\0') {
+        sds errors = ACLLoadFromFile(server.acl_filename);
+        if (errors) {
+            serverLog(LL_WARNING,
+                "Aborting Redis startup because of ACL errors: %s", errors);
+            sdsfree(errors);
+            exit(1);
+        }
+    }
+}
+
+/* =============================================================================
+ * ACL log
+ * ==========================================================================*/
+
+#define ACL_LOG_CTX_TOPLEVEL 0
+#define ACL_LOG_CTX_LUA 1
+#define ACL_LOG_CTX_MULTI 2
+#define ACL_LOG_GROUPING_MAX_TIME_DELTA 60000
+
+/* This structure defines an entry inside the ACL log. */
+typedef struct ACLLogEntry {
+    uint64_t count;     /* Number of times this happened recently. */
+    int reason;         /* Reason for denying the command. ACL_DENIED_*. */
+    int context;        /* Toplevel, Lua or MULTI/EXEC? ACL_LOG_CTX_*. */
+    sds object;         /* The key name or command name. */
+    sds username;       /* User the client is authenticated with. */
+    mstime_t ctime;     /* Milliseconds time of last update to this entry. */
+    sds cinfo;          /* Client info (last client if updated). */
+} ACLLogEntry;
+
+/* This function will check if ACL entries 'a' and 'b' are similar enough
+ * that we should actually update the existing entry in our ACL log instead
+ * of creating a new one. */
+int ACLLogMatchEntry(ACLLogEntry *a, ACLLogEntry *b) {
+    if (a->reason != b->reason) return 0;
+    if (a->context != b->context) return 0;
+    mstime_t delta = a->ctime - b->ctime;
+    if (delta < 0) delta = -delta;
+    if (delta > ACL_LOG_GROUPING_MAX_TIME_DELTA) return 0;
+    if (sdscmp(a->object,b->object) != 0) return 0;
+    if (sdscmp(a->username,b->username) != 0) return 0;
+    return 1;
+}
+
+/* Release an ACL log entry. */
+void ACLFreeLogEntry(void *leptr) {
+    ACLLogEntry *le = leptr;
+    sdsfree(le->object);
+    sdsfree(le->username);
+    sdsfree(le->cinfo);
+    zfree(le);
+}
+
+/* Adds a new entry in the ACL log, making sure to delete the old entry
+ * if we reach the maximum length allowed for the log. This function attempts
+ * to find similar entries in the current log in order to bump the counter of
+ * the log entry instead of creating many entries for very similar ACL
+ * rules issues.
+ *
+ * The argpos argument is used when the reason is ACL_DENIED_KEY or 
+ * ACL_DENIED_CHANNEL, since it allows the function to log the key or channel
+ * name that caused the problem. Similarly the username is only passed when we
+ * failed to authenticate the user with AUTH or HELLO, for the ACL_DENIED_AUTH
+ * reason. Otherwise it will just be NULL.
+ */
+void addACLLogEntry(client *c, int reason, int argpos, sds username) {
+    /* Create a new entry. */
+    struct ACLLogEntry *le = zmalloc(sizeof(*le));
+    le->count = 1;
+    le->reason = reason;
+    le->username = sdsdup(reason == ACL_DENIED_AUTH ? username : c->user->name);
+    le->ctime = mstime();
+
+    switch(reason) {
+    case ACL_DENIED_CMD: le->object = sdsnew(c->cmd->name); break;
+    case ACL_DENIED_KEY: le->object = sdsdup(c->argv[argpos]->ptr); break;
+    case ACL_DENIED_CHANNEL: le->object = sdsdup(c->argv[argpos]->ptr); break;
+    case ACL_DENIED_AUTH: le->object = sdsdup(c->argv[0]->ptr); break;
+    default: le->object = sdsempty();
+    }
+
+    client *realclient = c;
+    if (realclient->flags & CLIENT_LUA) realclient = server.lua_caller;
+
+    le->cinfo = catClientInfoString(sdsempty(),realclient);
+    if (c->flags & CLIENT_MULTI) {
+        le->context = ACL_LOG_CTX_MULTI;
+    } else if (c->flags & CLIENT_LUA) {
+        le->context = ACL_LOG_CTX_LUA;
+    } else {
+        le->context = ACL_LOG_CTX_TOPLEVEL;
+    }
+
+    /* Try to match this entry with past ones, to see if we can just
+     * update an existing entry instead of creating a new one. */
+    long toscan = 10; /* Do a limited work trying to find duplicated. */
+    listIter li;
+    listNode *ln;
+    listRewind(ACLLog,&li);
+    ACLLogEntry *match = NULL;
+    while (toscan-- && (ln = listNext(&li)) != NULL) {
+        ACLLogEntry *current = listNodeValue(ln);
+        if (ACLLogMatchEntry(current,le)) {
+            match = current;
+            listDelNode(ACLLog,ln);
+            listAddNodeHead(ACLLog,current);
+            break;
+        }
+    }
+
+    /* If there is a match update the entry, otherwise add it as a
+     * new one. */
+    if (match) {
+        /* We update a few fields of the existing entry and bump the
+         * counter of events for this entry. */
+        sdsfree(match->cinfo);
+        match->cinfo = le->cinfo;
+        match->ctime = le->ctime;
+        match->count++;
+
+        /* Release the old entry. */
+        le->cinfo = NULL;
+        ACLFreeLogEntry(le);
+    } else {
+        /* Add it to our list of entries. We'll have to trim the list
+         * to its maximum size. */
+        listAddNodeHead(ACLLog, le);
+        while(listLength(ACLLog) > server.acllog_max_len) {
+            listNode *ln = listLast(ACLLog);
+            ACLLogEntry *le = listNodeValue(ln);
+            ACLFreeLogEntry(le);
+            listDelNode(ACLLog,ln);
+        }
+    }
+}
+
+/* =============================================================================
+ * ACL related commands
+ * ==========================================================================*/
+
+/* ACL -- show and modify the configuration of ACL users.
+ * ACL HELP
+ * ACL LOAD
+ * ACL SAVE
+ * ACL LIST
+ * ACL USERS
+ * ACL CAT [<category>]
+ * ACL SETUSER <username> ... acl rules ...
+ * ACL DELUSER <username> [...]
+ * ACL GETUSER <username>
+ * ACL GENPASS [<bits>]
+ * ACL WHOAMI
+ * ACL LOG [<count> | RESET]
+ */
+void aclCommand(client *c) {
+    char *sub = c->argv[1]->ptr;
+    if (!strcasecmp(sub,"setuser") && c->argc >= 3) {
+        sds username = c->argv[2]->ptr;
+        /* Check username validity. */
+        if (ACLStringHasSpaces(username,sdslen(username))) {
+            addReplyErrorFormat(c,
+                "Usernames can't contain spaces or null characters");
+            return;
+        }
+
+        /* Create a temporary user to validate and stage all changes against
+         * before applying to an existing user or creating a new user. If all
+         * arguments are valid the user parameters will all be applied together.
+         * If there are any errors then none of the changes will be applied. */
+        user *tempu = ACLCreateUnlinkedUser();
+        user *u = ACLGetUserByName(username,sdslen(username));
+        if (u) ACLCopyUser(tempu, u);
+
+        /* Initially redact all of the arguments to not leak any information
+         * about the user. */
+        for (int j = 2; j < c->argc; j++) {
+            redactClientCommandArgument(c, j);
+        }
+
+        for (int j = 3; j < c->argc; j++) {
+            if (ACLSetUser(tempu,c->argv[j]->ptr,sdslen(c->argv[j]->ptr)) != C_OK) {
+                const char *errmsg = ACLSetUserStringError();
+                addReplyErrorFormat(c,
+                    "Error in ACL SETUSER modifier '%s': %s",
+                    (char*)c->argv[j]->ptr, errmsg);
+
+                ACLFreeUser(tempu);
+                return;
+            }
+        }
+
+        /* Existing pub/sub clients authenticated with the user may need to be
+         * disconnected if (some of) their channel permissions were revoked. */
+        if (u && !(tempu->flags & USER_FLAG_ALLCHANNELS))
+            ACLKillPubsubClientsIfNeeded(u,tempu->channels);
+
+        /* Overwrite the user with the temporary user we modified above. */
+        if (!u) u = ACLCreateUser(username,sdslen(username));
+        serverAssert(u != NULL);
+        ACLCopyUser(u, tempu);
+        ACLFreeUser(tempu);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(sub,"deluser") && c->argc >= 3) {
+        int deleted = 0;
+        for (int j = 2; j < c->argc; j++) {
+            sds username = c->argv[j]->ptr;
+            if (!strcmp(username,"default")) {
+                addReplyError(c,"The 'default' user cannot be removed");
+                return;
+            }
+        }
+
+        for (int j = 2; j < c->argc; j++) {
+            sds username = c->argv[j]->ptr;
+            user *u;
+            if (raxRemove(Users,(unsigned char*)username,
+                          sdslen(username),
+                          (void**)&u))
+            {
+                ACLFreeUserAndKillClients(u);
+                deleted++;
+            }
+        }
+        addReplyLongLong(c,deleted);
+    } else if (!strcasecmp(sub,"getuser") && c->argc == 3) {
+        user *u = ACLGetUserByName(c->argv[2]->ptr,sdslen(c->argv[2]->ptr));
+        if (u == NULL) {
+            addReplyNull(c);
+            return;
+        }
+
+        addReplyMapLen(c,5);
+
+        /* Flags */
+        addReplyBulkCString(c,"flags");
+        void *deflen = addReplyDeferredLen(c);
+        int numflags = 0;
+        for (int j = 0; ACLUserFlags[j].flag; j++) {
+            if (u->flags & ACLUserFlags[j].flag) {
+                addReplyBulkCString(c,ACLUserFlags[j].name);
+                numflags++;
+            }
+        }
+        setDeferredSetLen(c,deflen,numflags);
+
+        /* Passwords */
+        addReplyBulkCString(c,"passwords");
+        addReplyArrayLen(c,listLength(u->passwords));
+        listIter li;
+        listNode *ln;
+        listRewind(u->passwords,&li);
+        while((ln = listNext(&li))) {
+            sds thispass = listNodeValue(ln);
+            addReplyBulkCBuffer(c,thispass,sdslen(thispass));
+        }
+
+        /* Commands */
+        addReplyBulkCString(c,"commands");
+        sds cmddescr = ACLDescribeUserCommandRules(u);
+        addReplyBulkSds(c,cmddescr);
+
+        /* Key patterns */
+        addReplyBulkCString(c,"keys");
+        if (u->flags & USER_FLAG_ALLKEYS) {
+            addReplyArrayLen(c,1);
+            addReplyBulkCBuffer(c,"*",1);
+        } else {
+            addReplyArrayLen(c,listLength(u->patterns));
+            listIter li;
+            listNode *ln;
+            listRewind(u->patterns,&li);
+            while((ln = listNext(&li))) {
+                sds thispat = listNodeValue(ln);
+                addReplyBulkCBuffer(c,thispat,sdslen(thispat));
+            }
+        }
+
+        /* Pub/sub patterns */
+        addReplyBulkCString(c,"channels");
+        if (u->flags & USER_FLAG_ALLCHANNELS) {
+            addReplyArrayLen(c,1);
+            addReplyBulkCBuffer(c,"*",1);
+        } else {
+            addReplyArrayLen(c,listLength(u->channels));
+            listIter li;
+            listNode *ln;
+            listRewind(u->channels,&li);
+            while((ln = listNext(&li))) {
+                sds thispat = listNodeValue(ln);
+                addReplyBulkCBuffer(c,thispat,sdslen(thispat));
+            }
+        }
+    } else if ((!strcasecmp(sub,"list") || !strcasecmp(sub,"users")) &&
+               c->argc == 2)
+    {
+        int justnames = !strcasecmp(sub,"users");
+        addReplyArrayLen(c,raxSize(Users));
+        raxIterator ri;
+        raxStart(&ri,Users);
+        raxSeek(&ri,"^",NULL,0);
+        while(raxNext(&ri)) {
+            user *u = ri.data;
+            if (justnames) {
+                addReplyBulkCBuffer(c,u->name,sdslen(u->name));
+            } else {
+                /* Return information in the configuration file format. */
+                sds config = sdsnew("user ");
+                config = sdscatsds(config,u->name);
+                config = sdscatlen(config," ",1);
+                sds descr = ACLDescribeUser(u);
+                config = sdscatsds(config,descr);
+                sdsfree(descr);
+                addReplyBulkSds(c,config);
+            }
+        }
+        raxStop(&ri);
+    } else if (!strcasecmp(sub,"whoami") && c->argc == 2) {
+        if (c->user != NULL) {
+            addReplyBulkCBuffer(c,c->user->name,sdslen(c->user->name));
+        } else {
+            addReplyNull(c);
+        }
+    } else if (server.acl_filename[0] == '\0' &&
+               (!strcasecmp(sub,"load") || !strcasecmp(sub,"save")))
+    {
+        addReplyError(c,"This Redis instance is not configured to use an ACL file. You may want to specify users via the ACL SETUSER command and then issue a CONFIG REWRITE (assuming you have a Redis configuration file set) in order to store users in the Redis configuration.");
+        return;
+    } else if (!strcasecmp(sub,"load") && c->argc == 2) {
+        sds errors = ACLLoadFromFile(server.acl_filename);
+        if (errors == NULL) {
+            addReply(c,shared.ok);
+        } else {
+            addReplyError(c,errors);
+            sdsfree(errors);
+        }
+    } else if (!strcasecmp(sub,"save") && c->argc == 2) {
+        if (ACLSaveToFile(server.acl_filename) == C_OK) {
+            addReply(c,shared.ok);
+        } else {
+            addReplyError(c,"There was an error trying to save the ACLs. "
+                            "Please check the server logs for more "
+                            "information");
+        }
+    } else if (!strcasecmp(sub,"cat") && c->argc == 2) {
+        void *dl = addReplyDeferredLen(c);
+        int j;
+        for (j = 0; ACLCommandCategories[j].flag != 0; j++)
+            addReplyBulkCString(c,ACLCommandCategories[j].name);
+        setDeferredArrayLen(c,dl,j);
+    } else if (!strcasecmp(sub,"cat") && c->argc == 3) {
+        uint64_t cflag = ACLGetCommandCategoryFlagByName(c->argv[2]->ptr);
+        if (cflag == 0) {
+            addReplyErrorFormat(c, "Unknown category '%s'", (char*)c->argv[2]->ptr);
+            return;
+        }
+        int arraylen = 0;
+        void *dl = addReplyDeferredLen(c);
+        dictIterator *di = dictGetIterator(server.orig_commands);
+        dictEntry *de;
+        while ((de = dictNext(di)) != NULL) {
+            struct redisCommand *cmd = dictGetVal(de);
+            if (cmd->flags & CMD_MODULE) continue;
+            if (cmd->flags & cflag) {
+                addReplyBulkCString(c,cmd->name);
+                arraylen++;
+            }
+        }
+        dictReleaseIterator(di);
+        setDeferredArrayLen(c,dl,arraylen);
+    } else if (!strcasecmp(sub,"genpass") && (c->argc == 2 || c->argc == 3)) {
+        #define GENPASS_MAX_BITS 4096
+        char pass[GENPASS_MAX_BITS/8*2]; /* Hex representation. */
+        long bits = 256; /* By default generate 256 bits passwords. */
+
+        if (c->argc == 3 && getLongFromObjectOrReply(c,c->argv[2],&bits,NULL)
+            != C_OK) return;
+
+        if (bits <= 0 || bits > GENPASS_MAX_BITS) {
+            addReplyErrorFormat(c,
+                "ACL GENPASS argument must be the number of "
+                "bits for the output password, a positive number "
+                "up to %d",GENPASS_MAX_BITS);
+            return;
+        }
+
+        long chars = (bits+3)/4; /* Round to number of characters to emit. */
+        getRandomHexChars(pass,chars);
+        addReplyBulkCBuffer(c,pass,chars);
+    } else if (!strcasecmp(sub,"log") && (c->argc == 2 || c->argc ==3)) {
+        long count = 10; /* Number of entries to emit by default. */
+
+        /* Parse the only argument that LOG may have: it could be either
+         * the number of entries the user wants to display, or alternatively
+         * the "RESET" command in order to flush the old entries. */
+        if (c->argc == 3) {
+            if (!strcasecmp(c->argv[2]->ptr,"reset")) {
+                listSetFreeMethod(ACLLog,ACLFreeLogEntry);
+                listEmpty(ACLLog);
+                listSetFreeMethod(ACLLog,NULL);
+                addReply(c,shared.ok);
+                return;
+            } else if (getLongFromObjectOrReply(c,c->argv[2],&count,NULL)
+                       != C_OK)
+            {
+                return;
+            }
+            if (count < 0) count = 0;
+        }
+
+        /* Fix the count according to the number of entries we got. */
+        if ((size_t)count > listLength(ACLLog))
+            count = listLength(ACLLog);
+
+        addReplyArrayLen(c,count);
+        listIter li;
+        listNode *ln;
+        listRewind(ACLLog,&li);
+        mstime_t now = mstime();
+        while (count-- && (ln = listNext(&li)) != NULL) {
+            ACLLogEntry *le = listNodeValue(ln);
+            addReplyMapLen(c,7);
+            addReplyBulkCString(c,"count");
+            addReplyLongLong(c,le->count);
+
+            addReplyBulkCString(c,"reason");
+            char *reasonstr;
+            switch(le->reason) {
+            case ACL_DENIED_CMD: reasonstr="command"; break;
+            case ACL_DENIED_KEY: reasonstr="key"; break;
+            case ACL_DENIED_CHANNEL: reasonstr="channel"; break;
+            case ACL_DENIED_AUTH: reasonstr="auth"; break;
+            default: reasonstr="unknown";
+            }
+            addReplyBulkCString(c,reasonstr);
+
+            addReplyBulkCString(c,"context");
+            char *ctxstr;
+            switch(le->context) {
+            case ACL_LOG_CTX_TOPLEVEL: ctxstr="toplevel"; break;
+            case ACL_LOG_CTX_MULTI: ctxstr="multi"; break;
+            case ACL_LOG_CTX_LUA: ctxstr="lua"; break;
+            default: ctxstr="unknown";
+            }
+            addReplyBulkCString(c,ctxstr);
+
+            addReplyBulkCString(c,"object");
+            addReplyBulkCBuffer(c,le->object,sdslen(le->object));
+            addReplyBulkCString(c,"username");
+            addReplyBulkCBuffer(c,le->username,sdslen(le->username));
+            addReplyBulkCString(c,"age-seconds");
+            double age = (double)(now - le->ctime)/1000;
+            addReplyDouble(c,age);
+            addReplyBulkCString(c,"client-info");
+            addReplyBulkCBuffer(c,le->cinfo,sdslen(le->cinfo));
+        }
+    } else if (c->argc == 2 && !strcasecmp(sub,"help")) {
+        const char *help[] = {
+"CAT [<category>]",
+"    List all commands that belong to <category>, or all command categories",
+"    when no category is specified.",
+"DELUSER <username> [<username> ...]",
+"    Delete a list of users.",
+"GETUSER <username>",
+"    Get the user's details.",
+"GENPASS [<bits>]",
+"    Generate a secure 256-bit user password. The optional `bits` argument can",
+"    be used to specify a different size.",
+"LIST",
+"    Show users details in config file format.",
+"LOAD",
+"    Reload users from the ACL file.",
+"LOG [<count> | RESET]",
+"    Show the ACL log entries.",
+"SAVE",
+"    Save the current config to the ACL file.",
+"SETUSER <username> <attribute> [<attribute> ...]",
+"    Create or modify a user with the specified attributes.",
+"USERS",
+"    List all the registered usernames.",
+"WHOAMI",
+"    Return the current connection username.",
+NULL
+        };
+        addReplyHelp(c,help);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+void addReplyCommandCategories(client *c, struct redisCommand *cmd) {
+    int flagcount = 0;
+    void *flaglen = addReplyDeferredLen(c);
+    for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
+        if (cmd->flags & ACLCommandCategories[j].flag) {
+            addReplyStatusFormat(c, "@%s", ACLCommandCategories[j].name);
+            flagcount++;
+        }
+    }
+    setDeferredSetLen(c, flaglen, flagcount);
+}
+
+/* AUTH <password>
+ * AUTH <username> <password> (Redis >= 6.0 form)
+ *
+ * When the user is omitted it means that we are trying to authenticate
+ * against the default user. */
+void authCommand(client *c) {
+    /* Only two or three argument forms are allowed. */
+    if (c->argc > 3) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+    /* Always redact the second argument */
+    redactClientCommandArgument(c, 1);
+
+    /* Handle the two different forms here. The form with two arguments
+     * will just use "default" as username. */
+    robj *username, *password;
+    if (c->argc == 2) {
+        /* Mimic the old behavior of giving an error for the two commands
+         * from if no password is configured. */
+        if (DefaultUser->flags & USER_FLAG_NOPASS) {
+            addReplyError(c,"AUTH <password> called without any password "
+                            "configured for the default user. Are you sure "
+                            "your configuration is correct?");
+            return;
+        }
+
+        username = shared.default_username; 
+        password = c->argv[1];
+    } else {
+        username = c->argv[1];
+        password = c->argv[2];
+        redactClientCommandArgument(c, 2);
+    }
+
+    if (ACLAuthenticateUser(c,username,password) == C_OK) {
+        addReply(c,shared.ok);
+    } else {
+        addReplyError(c,"-WRONGPASS invalid username-password pair or user is disabled.");
+    }
+}
+
+/* Set the password for the "default" ACL user. This implements supports for
+ * requirepass config, so passing in NULL will set the user to be nopass. */
+void ACLUpdateDefaultUserPassword(sds password) {
+    ACLSetUser(DefaultUser,"resetpass",-1);
+    if (password) {
+        sds aclop = sdscatlen(sdsnew(">"), password, sdslen(password));
+        ACLSetUser(DefaultUser,aclop,sdslen(aclop));
+        sdsfree(aclop);
+    } else {
+        ACLSetUser(DefaultUser,"nopass",-1);
+    }
+}
diff --git a/redis-stable/src/adlist.c b/redis-stable/src/adlist.c
new file mode 100644
index 00000000..7670b2c1
--- /dev/null
+++ b/redis-stable/src/adlist.c
@@ -0,0 +1,378 @@
+/* adlist.c - A generic doubly linked list implementation
+ *
+ * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <stdlib.h>
+#include "adlist.h"
+#include "zmalloc.h"
+
+/* Create a new list. The created list can be freed with
+ * listRelease(), but private value of every node need to be freed
+ * by the user before to call listRelease(), or by setting a free method using
+ * listSetFreeMethod.
+ *
+ * On error, NULL is returned. Otherwise the pointer to the new list. */
+list *listCreate(void)
+{
+    struct list *list;
+
+    if ((list = zmalloc(sizeof(*list))) == NULL)
+        return NULL;
+    list->head = list->tail = NULL;
+    list->len = 0;
+    list->dup = NULL;
+    list->free = NULL;
+    list->match = NULL;
+    return list;
+}
+
+/* Remove all the elements from the list without destroying the list itself. */
+void listEmpty(list *list)
+{
+    unsigned long len;
+    listNode *current, *next;
+
+    current = list->head;
+    len = list->len;
+    while(len--) {
+        next = current->next;
+        if (list->free) list->free(current->value);
+        zfree(current);
+        current = next;
+    }
+    list->head = list->tail = NULL;
+    list->len = 0;
+}
+
+/* Free the whole list.
+ *
+ * This function can't fail. */
+void listRelease(list *list)
+{
+    listEmpty(list);
+    zfree(list);
+}
+
+/* Add a new node to the list, to head, containing the specified 'value'
+ * pointer as value.
+ *
+ * On error, NULL is returned and no operation is performed (i.e. the
+ * list remains unaltered).
+ * On success the 'list' pointer you pass to the function is returned. */
+list *listAddNodeHead(list *list, void *value)
+{
+    listNode *node;
+
+    if ((node = zmalloc(sizeof(*node))) == NULL)
+        return NULL;
+    node->value = value;
+    if (list->len == 0) {
+        list->head = list->tail = node;
+        node->prev = node->next = NULL;
+    } else {
+        node->prev = NULL;
+        node->next = list->head;
+        list->head->prev = node;
+        list->head = node;
+    }
+    list->len++;
+    return list;
+}
+
+/* Add a new node to the list, to tail, containing the specified 'value'
+ * pointer as value.
+ *
+ * On error, NULL is returned and no operation is performed (i.e. the
+ * list remains unaltered).
+ * On success the 'list' pointer you pass to the function is returned. */
+list *listAddNodeTail(list *list, void *value)
+{
+    listNode *node;
+
+    if ((node = zmalloc(sizeof(*node))) == NULL)
+        return NULL;
+    node->value = value;
+    if (list->len == 0) {
+        list->head = list->tail = node;
+        node->prev = node->next = NULL;
+    } else {
+        node->prev = list->tail;
+        node->next = NULL;
+        list->tail->next = node;
+        list->tail = node;
+    }
+    list->len++;
+    return list;
+}
+
+list *listInsertNode(list *list, listNode *old_node, void *value, int after) {
+    listNode *node;
+
+    if ((node = zmalloc(sizeof(*node))) == NULL)
+        return NULL;
+    node->value = value;
+    if (after) {
+        node->prev = old_node;
+        node->next = old_node->next;
+        if (list->tail == old_node) {
+            list->tail = node;
+        }
+    } else {
+        node->next = old_node;
+        node->prev = old_node->prev;
+        if (list->head == old_node) {
+            list->head = node;
+        }
+    }
+    if (node->prev != NULL) {
+        node->prev->next = node;
+    }
+    if (node->next != NULL) {
+        node->next->prev = node;
+    }
+    list->len++;
+    return list;
+}
+
+/* Remove the specified node from the specified list.
+ * It's up to the caller to free the private value of the node.
+ *
+ * This function can't fail. */
+void listDelNode(list *list, listNode *node)
+{
+    if (node->prev)
+        node->prev->next = node->next;
+    else
+        list->head = node->next;
+    if (node->next)
+        node->next->prev = node->prev;
+    else
+        list->tail = node->prev;
+    if (list->free) list->free(node->value);
+    zfree(node);
+    list->len--;
+}
+
+/* Returns a list iterator 'iter'. After the initialization every
+ * call to listNext() will return the next element of the list.
+ *
+ * This function can't fail. */
+listIter *listGetIterator(list *list, int direction)
+{
+    listIter *iter;
+
+    if ((iter = zmalloc(sizeof(*iter))) == NULL) return NULL;
+    if (direction == AL_START_HEAD)
+        iter->next = list->head;
+    else
+        iter->next = list->tail;
+    iter->direction = direction;
+    return iter;
+}
+
+/* Release the iterator memory */
+void listReleaseIterator(listIter *iter) {
+    zfree(iter);
+}
+
+/* Create an iterator in the list private iterator structure */
+void listRewind(list *list, listIter *li) {
+    li->next = list->head;
+    li->direction = AL_START_HEAD;
+}
+
+void listRewindTail(list *list, listIter *li) {
+    li->next = list->tail;
+    li->direction = AL_START_TAIL;
+}
+
+/* Return the next element of an iterator.
+ * It's valid to remove the currently returned element using
+ * listDelNode(), but not to remove other elements.
+ *
+ * The function returns a pointer to the next element of the list,
+ * or NULL if there are no more elements, so the classical usage
+ * pattern is:
+ *
+ * iter = listGetIterator(list,<direction>);
+ * while ((node = listNext(iter)) != NULL) {
+ *     doSomethingWith(listNodeValue(node));
+ * }
+ *
+ * */
+listNode *listNext(listIter *iter)
+{
+    listNode *current = iter->next;
+
+    if (current != NULL) {
+        if (iter->direction == AL_START_HEAD)
+            iter->next = current->next;
+        else
+            iter->next = current->prev;
+    }
+    return current;
+}
+
+/* Duplicate the whole list. On out of memory NULL is returned.
+ * On success a copy of the original list is returned.
+ *
+ * The 'Dup' method set with listSetDupMethod() function is used
+ * to copy the node value. Otherwise the same pointer value of
+ * the original node is used as value of the copied node.
+ *
+ * The original list both on success or error is never modified. */
+list *listDup(list *orig)
+{
+    list *copy;
+    listIter iter;
+    listNode *node;
+
+    if ((copy = listCreate()) == NULL)
+        return NULL;
+    copy->dup = orig->dup;
+    copy->free = orig->free;
+    copy->match = orig->match;
+    listRewind(orig, &iter);
+    while((node = listNext(&iter)) != NULL) {
+        void *value;
+
+        if (copy->dup) {
+            value = copy->dup(node->value);
+            if (value == NULL) {
+                listRelease(copy);
+                return NULL;
+            }
+        } else
+            value = node->value;
+        if (listAddNodeTail(copy, value) == NULL) {
+            listRelease(copy);
+            return NULL;
+        }
+    }
+    return copy;
+}
+
+/* Search the list for a node matching a given key.
+ * The match is performed using the 'match' method
+ * set with listSetMatchMethod(). If no 'match' method
+ * is set, the 'value' pointer of every node is directly
+ * compared with the 'key' pointer.
+ *
+ * On success the first matching node pointer is returned
+ * (search starts from head). If no matching node exists
+ * NULL is returned. */
+listNode *listSearchKey(list *list, void *key)
+{
+    listIter iter;
+    listNode *node;
+
+    listRewind(list, &iter);
+    while((node = listNext(&iter)) != NULL) {
+        if (list->match) {
+            if (list->match(node->value, key)) {
+                return node;
+            }
+        } else {
+            if (key == node->value) {
+                return node;
+            }
+        }
+    }
+    return NULL;
+}
+
+/* Return the element at the specified zero-based index
+ * where 0 is the head, 1 is the element next to head
+ * and so on. Negative integers are used in order to count
+ * from the tail, -1 is the last element, -2 the penultimate
+ * and so on. If the index is out of range NULL is returned. */
+listNode *listIndex(list *list, long index) {
+    listNode *n;
+
+    if (index < 0) {
+        index = (-index)-1;
+        n = list->tail;
+        while(index-- && n) n = n->prev;
+    } else {
+        n = list->head;
+        while(index-- && n) n = n->next;
+    }
+    return n;
+}
+
+/* Rotate the list removing the tail node and inserting it to the head. */
+void listRotateTailToHead(list *list) {
+    if (listLength(list) <= 1) return;
+
+    /* Detach current tail */
+    listNode *tail = list->tail;
+    list->tail = tail->prev;
+    list->tail->next = NULL;
+    /* Move it as head */
+    list->head->prev = tail;
+    tail->prev = NULL;
+    tail->next = list->head;
+    list->head = tail;
+}
+
+/* Rotate the list removing the head node and inserting it to the tail. */
+void listRotateHeadToTail(list *list) {
+    if (listLength(list) <= 1) return;
+
+    listNode *head = list->head;
+    /* Detach current head */
+    list->head = head->next;
+    list->head->prev = NULL;
+    /* Move it as tail */
+    list->tail->next = head;
+    head->next = NULL;
+    head->prev = list->tail;
+    list->tail = head;
+}
+
+/* Add all the elements of the list 'o' at the end of the
+ * list 'l'. The list 'other' remains empty but otherwise valid. */
+void listJoin(list *l, list *o) {
+    if (o->len == 0) return;
+
+    o->head->prev = l->tail;
+
+    if (l->tail)
+        l->tail->next = o->head;
+    else
+        l->head = o->head;
+
+    l->tail = o->tail;
+    l->len += o->len;
+
+    /* Setup other as an empty list. */
+    o->head = o->tail = NULL;
+    o->len = 0;
+}
diff --git a/redis-stable/src/adlist.h b/redis-stable/src/adlist.h
new file mode 100644
index 00000000..dd8a8d69
--- /dev/null
+++ b/redis-stable/src/adlist.h
@@ -0,0 +1,96 @@
+/* adlist.h - A generic doubly linked list implementation
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __ADLIST_H__
+#define __ADLIST_H__
+
+/* Node, List, and Iterator are the only data structures used currently. */
+
+typedef struct listNode {
+    struct listNode *prev;
+    struct listNode *next;
+    void *value;
+} listNode;
+
+typedef struct listIter {
+    listNode *next;
+    int direction;
+} listIter;
+
+typedef struct list {
+    listNode *head;
+    listNode *tail;
+    void *(*dup)(void *ptr);
+    void (*free)(void *ptr);
+    int (*match)(void *ptr, void *key);
+    unsigned long len;
+} list;
+
+/* Functions implemented as macros */
+#define listLength(l) ((l)->len)
+#define listFirst(l) ((l)->head)
+#define listLast(l) ((l)->tail)
+#define listPrevNode(n) ((n)->prev)
+#define listNextNode(n) ((n)->next)
+#define listNodeValue(n) ((n)->value)
+
+#define listSetDupMethod(l,m) ((l)->dup = (m))
+#define listSetFreeMethod(l,m) ((l)->free = (m))
+#define listSetMatchMethod(l,m) ((l)->match = (m))
+
+#define listGetDupMethod(l) ((l)->dup)
+#define listGetFreeMethod(l) ((l)->free)
+#define listGetMatchMethod(l) ((l)->match)
+
+/* Prototypes */
+list *listCreate(void);
+void listRelease(list *list);
+void listEmpty(list *list);
+list *listAddNodeHead(list *list, void *value);
+list *listAddNodeTail(list *list, void *value);
+list *listInsertNode(list *list, listNode *old_node, void *value, int after);
+void listDelNode(list *list, listNode *node);
+listIter *listGetIterator(list *list, int direction);
+listNode *listNext(listIter *iter);
+void listReleaseIterator(listIter *iter);
+list *listDup(list *orig);
+listNode *listSearchKey(list *list, void *key);
+listNode *listIndex(list *list, long index);
+void listRewind(list *list, listIter *li);
+void listRewindTail(list *list, listIter *li);
+void listRotateTailToHead(list *list);
+void listRotateHeadToTail(list *list);
+void listJoin(list *l, list *o);
+
+/* Directions for iterators */
+#define AL_START_HEAD 0
+#define AL_START_TAIL 1
+
+#endif /* __ADLIST_H__ */
diff --git a/redis-stable/src/ae.c b/redis-stable/src/ae.c
new file mode 100644
index 00000000..48fb63ed
--- /dev/null
+++ b/redis-stable/src/ae.c
@@ -0,0 +1,503 @@
+/* A simple event-driven programming library. Originally I wrote this code
+ * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated
+ * it in form of a library for easy reuse.
+ *
+ * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "ae.h"
+#include "anet.h"
+
+#include <stdio.h>
+#include <sys/time.h>
+#include <sys/types.h>
+#include <unistd.h>
+#include <stdlib.h>
+#include <poll.h>
+#include <string.h>
+#include <time.h>
+#include <errno.h>
+
+#include "zmalloc.h"
+#include "config.h"
+
+/* Include the best multiplexing layer supported by this system.
+ * The following should be ordered by performances, descending. */
+#ifdef HAVE_EVPORT
+#include "ae_evport.c"
+#else
+    #ifdef HAVE_EPOLL
+    #include "ae_epoll.c"
+    #else
+        #ifdef HAVE_KQUEUE
+        #include "ae_kqueue.c"
+        #else
+        #include "ae_select.c"
+        #endif
+    #endif
+#endif
+
+
+aeEventLoop *aeCreateEventLoop(int setsize) {
+    aeEventLoop *eventLoop;
+    int i;
+
+    monotonicInit();    /* just in case the calling app didn't initialize */
+
+    if ((eventLoop = zmalloc(sizeof(*eventLoop))) == NULL) goto err;
+    eventLoop->events = zmalloc(sizeof(aeFileEvent)*setsize);
+    eventLoop->fired = zmalloc(sizeof(aeFiredEvent)*setsize);
+    if (eventLoop->events == NULL || eventLoop->fired == NULL) goto err;
+    eventLoop->setsize = setsize;
+    eventLoop->timeEventHead = NULL;
+    eventLoop->timeEventNextId = 0;
+    eventLoop->stop = 0;
+    eventLoop->maxfd = -1;
+    eventLoop->beforesleep = NULL;
+    eventLoop->aftersleep = NULL;
+    eventLoop->flags = 0;
+    if (aeApiCreate(eventLoop) == -1) goto err;
+    /* Events with mask == AE_NONE are not set. So let's initialize the
+     * vector with it. */
+    for (i = 0; i < setsize; i++)
+        eventLoop->events[i].mask = AE_NONE;
+    return eventLoop;
+
+err:
+    if (eventLoop) {
+        zfree(eventLoop->events);
+        zfree(eventLoop->fired);
+        zfree(eventLoop);
+    }
+    return NULL;
+}
+
+/* Return the current set size. */
+int aeGetSetSize(aeEventLoop *eventLoop) {
+    return eventLoop->setsize;
+}
+
+/* Tells the next iteration/s of the event processing to set timeout of 0. */
+void aeSetDontWait(aeEventLoop *eventLoop, int noWait) {
+    if (noWait)
+        eventLoop->flags |= AE_DONT_WAIT;
+    else
+        eventLoop->flags &= ~AE_DONT_WAIT;
+}
+
+/* Resize the maximum set size of the event loop.
+ * If the requested set size is smaller than the current set size, but
+ * there is already a file descriptor in use that is >= the requested
+ * set size minus one, AE_ERR is returned and the operation is not
+ * performed at all.
+ *
+ * Otherwise AE_OK is returned and the operation is successful. */
+int aeResizeSetSize(aeEventLoop *eventLoop, int setsize) {
+    int i;
+
+    if (setsize == eventLoop->setsize) return AE_OK;
+    if (eventLoop->maxfd >= setsize) return AE_ERR;
+    if (aeApiResize(eventLoop,setsize) == -1) return AE_ERR;
+
+    eventLoop->events = zrealloc(eventLoop->events,sizeof(aeFileEvent)*setsize);
+    eventLoop->fired = zrealloc(eventLoop->fired,sizeof(aeFiredEvent)*setsize);
+    eventLoop->setsize = setsize;
+
+    /* Make sure that if we created new slots, they are initialized with
+     * an AE_NONE mask. */
+    for (i = eventLoop->maxfd+1; i < setsize; i++)
+        eventLoop->events[i].mask = AE_NONE;
+    return AE_OK;
+}
+
+void aeDeleteEventLoop(aeEventLoop *eventLoop) {
+    aeApiFree(eventLoop);
+    zfree(eventLoop->events);
+    zfree(eventLoop->fired);
+
+    /* Free the time events list. */
+    aeTimeEvent *next_te, *te = eventLoop->timeEventHead;
+    while (te) {
+        next_te = te->next;
+        zfree(te);
+        te = next_te;
+    }
+    zfree(eventLoop);
+}
+
+void aeStop(aeEventLoop *eventLoop) {
+    eventLoop->stop = 1;
+}
+
+int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,
+        aeFileProc *proc, void *clientData)
+{
+    if (fd >= eventLoop->setsize) {
+        errno = ERANGE;
+        return AE_ERR;
+    }
+    aeFileEvent *fe = &eventLoop->events[fd];
+
+    if (aeApiAddEvent(eventLoop, fd, mask) == -1)
+        return AE_ERR;
+    fe->mask |= mask;
+    if (mask & AE_READABLE) fe->rfileProc = proc;
+    if (mask & AE_WRITABLE) fe->wfileProc = proc;
+    fe->clientData = clientData;
+    if (fd > eventLoop->maxfd)
+        eventLoop->maxfd = fd;
+    return AE_OK;
+}
+
+void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask)
+{
+    if (fd >= eventLoop->setsize) return;
+    aeFileEvent *fe = &eventLoop->events[fd];
+    if (fe->mask == AE_NONE) return;
+
+    /* We want to always remove AE_BARRIER if set when AE_WRITABLE
+     * is removed. */
+    if (mask & AE_WRITABLE) mask |= AE_BARRIER;
+
+    aeApiDelEvent(eventLoop, fd, mask);
+    fe->mask = fe->mask & (~mask);
+    if (fd == eventLoop->maxfd && fe->mask == AE_NONE) {
+        /* Update the max fd */
+        int j;
+
+        for (j = eventLoop->maxfd-1; j >= 0; j--)
+            if (eventLoop->events[j].mask != AE_NONE) break;
+        eventLoop->maxfd = j;
+    }
+}
+
+int aeGetFileEvents(aeEventLoop *eventLoop, int fd) {
+    if (fd >= eventLoop->setsize) return 0;
+    aeFileEvent *fe = &eventLoop->events[fd];
+
+    return fe->mask;
+}
+
+long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
+        aeTimeProc *proc, void *clientData,
+        aeEventFinalizerProc *finalizerProc)
+{
+    long long id = eventLoop->timeEventNextId++;
+    aeTimeEvent *te;
+
+    te = zmalloc(sizeof(*te));
+    if (te == NULL) return AE_ERR;
+    te->id = id;
+    te->when = getMonotonicUs() + milliseconds * 1000;
+    te->timeProc = proc;
+    te->finalizerProc = finalizerProc;
+    te->clientData = clientData;
+    te->prev = NULL;
+    te->next = eventLoop->timeEventHead;
+    te->refcount = 0;
+    if (te->next)
+        te->next->prev = te;
+    eventLoop->timeEventHead = te;
+    return id;
+}
+
+int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id)
+{
+    aeTimeEvent *te = eventLoop->timeEventHead;
+    while(te) {
+        if (te->id == id) {
+            te->id = AE_DELETED_EVENT_ID;
+            return AE_OK;
+        }
+        te = te->next;
+    }
+    return AE_ERR; /* NO event with the specified ID found */
+}
+
+/* How many microseconds until the first timer should fire.
+ * If there are no timers, -1 is returned.
+ *
+ * Note that's O(N) since time events are unsorted.
+ * Possible optimizations (not needed by Redis so far, but...):
+ * 1) Insert the event in order, so that the nearest is just the head.
+ *    Much better but still insertion or deletion of timers is O(N).
+ * 2) Use a skiplist to have this operation as O(1) and insertion as O(log(N)).
+ */
+static int64_t usUntilEarliestTimer(aeEventLoop *eventLoop) {
+    aeTimeEvent *te = eventLoop->timeEventHead;
+    if (te == NULL) return -1;
+
+    aeTimeEvent *earliest = NULL;
+    while (te) {
+        if (!earliest || te->when < earliest->when)
+            earliest = te;
+        te = te->next;
+    }
+
+    monotime now = getMonotonicUs();
+    return (now >= earliest->when) ? 0 : earliest->when - now;
+}
+
+/* Process time events */
+static int processTimeEvents(aeEventLoop *eventLoop) {
+    int processed = 0;
+    aeTimeEvent *te;
+    long long maxId;
+
+    te = eventLoop->timeEventHead;
+    maxId = eventLoop->timeEventNextId-1;
+    monotime now = getMonotonicUs();
+    while(te) {
+        long long id;
+
+        /* Remove events scheduled for deletion. */
+        if (te->id == AE_DELETED_EVENT_ID) {
+            aeTimeEvent *next = te->next;
+            /* If a reference exists for this timer event,
+             * don't free it. This is currently incremented
+             * for recursive timerProc calls */
+            if (te->refcount) {
+                te = next;
+                continue;
+            }
+            if (te->prev)
+                te->prev->next = te->next;
+            else
+                eventLoop->timeEventHead = te->next;
+            if (te->next)
+                te->next->prev = te->prev;
+            if (te->finalizerProc) {
+                te->finalizerProc(eventLoop, te->clientData);
+                now = getMonotonicUs();
+            }
+            zfree(te);
+            te = next;
+            continue;
+        }
+
+        /* Make sure we don't process time events created by time events in
+         * this iteration. Note that this check is currently useless: we always
+         * add new timers on the head, however if we change the implementation
+         * detail, this check may be useful again: we keep it here for future
+         * defense. */
+        if (te->id > maxId) {
+            te = te->next;
+            continue;
+        }
+
+        if (te->when <= now) {
+            int retval;
+
+            id = te->id;
+            te->refcount++;
+            retval = te->timeProc(eventLoop, id, te->clientData);
+            te->refcount--;
+            processed++;
+            now = getMonotonicUs();
+            if (retval != AE_NOMORE) {
+                te->when = now + retval * 1000;
+            } else {
+                te->id = AE_DELETED_EVENT_ID;
+            }
+        }
+        te = te->next;
+    }
+    return processed;
+}
+
+/* Process every pending time event, then every pending file event
+ * (that may be registered by time event callbacks just processed).
+ * Without special flags the function sleeps until some file event
+ * fires, or when the next time event occurs (if any).
+ *
+ * If flags is 0, the function does nothing and returns.
+ * if flags has AE_ALL_EVENTS set, all the kind of events are processed.
+ * if flags has AE_FILE_EVENTS set, file events are processed.
+ * if flags has AE_TIME_EVENTS set, time events are processed.
+ * if flags has AE_DONT_WAIT set the function returns ASAP until all
+ * the events that's possible to process without to wait are processed.
+ * if flags has AE_CALL_AFTER_SLEEP set, the aftersleep callback is called.
+ * if flags has AE_CALL_BEFORE_SLEEP set, the beforesleep callback is called.
+ *
+ * The function returns the number of events processed. */
+int aeProcessEvents(aeEventLoop *eventLoop, int flags)
+{
+    int processed = 0, numevents;
+
+    /* Nothing to do? return ASAP */
+    if (!(flags & AE_TIME_EVENTS) && !(flags & AE_FILE_EVENTS)) return 0;
+
+    /* Note that we want to call select() even if there are no
+     * file events to process as long as we want to process time
+     * events, in order to sleep until the next time event is ready
+     * to fire. */
+    if (eventLoop->maxfd != -1 ||
+        ((flags & AE_TIME_EVENTS) && !(flags & AE_DONT_WAIT))) {
+        int j;
+        struct timeval tv, *tvp;
+        int64_t usUntilTimer = -1;
+
+        if (flags & AE_TIME_EVENTS && !(flags & AE_DONT_WAIT))
+            usUntilTimer = usUntilEarliestTimer(eventLoop);
+
+        if (usUntilTimer >= 0) {
+            tv.tv_sec = usUntilTimer / 1000000;
+            tv.tv_usec = usUntilTimer % 1000000;
+            tvp = &tv;
+        } else {
+            /* If we have to check for events but need to return
+             * ASAP because of AE_DONT_WAIT we need to set the timeout
+             * to zero */
+            if (flags & AE_DONT_WAIT) {
+                tv.tv_sec = tv.tv_usec = 0;
+                tvp = &tv;
+            } else {
+                /* Otherwise we can block */
+                tvp = NULL; /* wait forever */
+            }
+        }
+
+        if (eventLoop->flags & AE_DONT_WAIT) {
+            tv.tv_sec = tv.tv_usec = 0;
+            tvp = &tv;
+        }
+
+        if (eventLoop->beforesleep != NULL && flags & AE_CALL_BEFORE_SLEEP)
+            eventLoop->beforesleep(eventLoop);
+
+        /* Call the multiplexing API, will return only on timeout or when
+         * some event fires. */
+        numevents = aeApiPoll(eventLoop, tvp);
+
+        /* After sleep callback. */
+        if (eventLoop->aftersleep != NULL && flags & AE_CALL_AFTER_SLEEP)
+            eventLoop->aftersleep(eventLoop);
+
+        for (j = 0; j < numevents; j++) {
+            aeFileEvent *fe = &eventLoop->events[eventLoop->fired[j].fd];
+            int mask = eventLoop->fired[j].mask;
+            int fd = eventLoop->fired[j].fd;
+            int fired = 0; /* Number of events fired for current fd. */
+
+            /* Normally we execute the readable event first, and the writable
+             * event later. This is useful as sometimes we may be able
+             * to serve the reply of a query immediately after processing the
+             * query.
+             *
+             * However if AE_BARRIER is set in the mask, our application is
+             * asking us to do the reverse: never fire the writable event
+             * after the readable. In such a case, we invert the calls.
+             * This is useful when, for instance, we want to do things
+             * in the beforeSleep() hook, like fsyncing a file to disk,
+             * before replying to a client. */
+            int invert = fe->mask & AE_BARRIER;
+
+            /* Note the "fe->mask & mask & ..." code: maybe an already
+             * processed event removed an element that fired and we still
+             * didn't processed, so we check if the event is still valid.
+             *
+             * Fire the readable event if the call sequence is not
+             * inverted. */
+            if (!invert && fe->mask & mask & AE_READABLE) {
+                fe->rfileProc(eventLoop,fd,fe->clientData,mask);
+                fired++;
+                fe = &eventLoop->events[fd]; /* Refresh in case of resize. */
+            }
+
+            /* Fire the writable event. */
+            if (fe->mask & mask & AE_WRITABLE) {
+                if (!fired || fe->wfileProc != fe->rfileProc) {
+                    fe->wfileProc(eventLoop,fd,fe->clientData,mask);
+                    fired++;
+                }
+            }
+
+            /* If we have to invert the call, fire the readable event now
+             * after the writable one. */
+            if (invert) {
+                fe = &eventLoop->events[fd]; /* Refresh in case of resize. */
+                if ((fe->mask & mask & AE_READABLE) &&
+                    (!fired || fe->wfileProc != fe->rfileProc))
+                {
+                    fe->rfileProc(eventLoop,fd,fe->clientData,mask);
+                    fired++;
+                }
+            }
+
+            processed++;
+        }
+    }
+    /* Check time events */
+    if (flags & AE_TIME_EVENTS)
+        processed += processTimeEvents(eventLoop);
+
+    return processed; /* return the number of processed file/time events */
+}
+
+/* Wait for milliseconds until the given file descriptor becomes
+ * writable/readable/exception */
+int aeWait(int fd, int mask, long long milliseconds) {
+    struct pollfd pfd;
+    int retmask = 0, retval;
+
+    memset(&pfd, 0, sizeof(pfd));
+    pfd.fd = fd;
+    if (mask & AE_READABLE) pfd.events |= POLLIN;
+    if (mask & AE_WRITABLE) pfd.events |= POLLOUT;
+
+    if ((retval = poll(&pfd, 1, milliseconds))== 1) {
+        if (pfd.revents & POLLIN) retmask |= AE_READABLE;
+        if (pfd.revents & POLLOUT) retmask |= AE_WRITABLE;
+        if (pfd.revents & POLLERR) retmask |= AE_WRITABLE;
+        if (pfd.revents & POLLHUP) retmask |= AE_WRITABLE;
+        return retmask;
+    } else {
+        return retval;
+    }
+}
+
+void aeMain(aeEventLoop *eventLoop) {
+    eventLoop->stop = 0;
+    while (!eventLoop->stop) {
+        aeProcessEvents(eventLoop, AE_ALL_EVENTS|
+                                   AE_CALL_BEFORE_SLEEP|
+                                   AE_CALL_AFTER_SLEEP);
+    }
+}
+
+char *aeGetApiName(void) {
+    return aeApiName();
+}
+
+void aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep) {
+    eventLoop->beforesleep = beforesleep;
+}
+
+void aeSetAfterSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *aftersleep) {
+    eventLoop->aftersleep = aftersleep;
+}
diff --git a/redis-stable/src/ae.h b/redis-stable/src/ae.h
new file mode 100644
index 00000000..4a1edb68
--- /dev/null
+++ b/redis-stable/src/ae.h
@@ -0,0 +1,135 @@
+/* A simple event-driven programming library. Originally I wrote this code
+ * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated
+ * it in form of a library for easy reuse.
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __AE_H__
+#define __AE_H__
+
+#include "monotonic.h"
+
+#define AE_OK 0
+#define AE_ERR -1
+
+#define AE_NONE 0       /* No events registered. */
+#define AE_READABLE 1   /* Fire when descriptor is readable. */
+#define AE_WRITABLE 2   /* Fire when descriptor is writable. */
+#define AE_BARRIER 4    /* With WRITABLE, never fire the event if the
+                           READABLE event already fired in the same event
+                           loop iteration. Useful when you want to persist
+                           things to disk before sending replies, and want
+                           to do that in a group fashion. */
+
+#define AE_FILE_EVENTS (1<<0)
+#define AE_TIME_EVENTS (1<<1)
+#define AE_ALL_EVENTS (AE_FILE_EVENTS|AE_TIME_EVENTS)
+#define AE_DONT_WAIT (1<<2)
+#define AE_CALL_BEFORE_SLEEP (1<<3)
+#define AE_CALL_AFTER_SLEEP (1<<4)
+
+#define AE_NOMORE -1
+#define AE_DELETED_EVENT_ID -1
+
+/* Macros */
+#define AE_NOTUSED(V) ((void) V)
+
+struct aeEventLoop;
+
+/* Types and data structures */
+typedef void aeFileProc(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask);
+typedef int aeTimeProc(struct aeEventLoop *eventLoop, long long id, void *clientData);
+typedef void aeEventFinalizerProc(struct aeEventLoop *eventLoop, void *clientData);
+typedef void aeBeforeSleepProc(struct aeEventLoop *eventLoop);
+
+/* File event structure */
+typedef struct aeFileEvent {
+    int mask; /* one of AE_(READABLE|WRITABLE|BARRIER) */
+    aeFileProc *rfileProc;
+    aeFileProc *wfileProc;
+    void *clientData;
+} aeFileEvent;
+
+/* Time event structure */
+typedef struct aeTimeEvent {
+    long long id; /* time event identifier. */
+    monotime when;
+    aeTimeProc *timeProc;
+    aeEventFinalizerProc *finalizerProc;
+    void *clientData;
+    struct aeTimeEvent *prev;
+    struct aeTimeEvent *next;
+    int refcount; /* refcount to prevent timer events from being
+  		   * freed in recursive time event calls. */
+} aeTimeEvent;
+
+/* A fired event */
+typedef struct aeFiredEvent {
+    int fd;
+    int mask;
+} aeFiredEvent;
+
+/* State of an event based program */
+typedef struct aeEventLoop {
+    int maxfd;   /* highest file descriptor currently registered */
+    int setsize; /* max number of file descriptors tracked */
+    long long timeEventNextId;
+    aeFileEvent *events; /* Registered events */
+    aeFiredEvent *fired; /* Fired events */
+    aeTimeEvent *timeEventHead;
+    int stop;
+    void *apidata; /* This is used for polling API specific data */
+    aeBeforeSleepProc *beforesleep;
+    aeBeforeSleepProc *aftersleep;
+    int flags;
+} aeEventLoop;
+
+/* Prototypes */
+aeEventLoop *aeCreateEventLoop(int setsize);
+void aeDeleteEventLoop(aeEventLoop *eventLoop);
+void aeStop(aeEventLoop *eventLoop);
+int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,
+        aeFileProc *proc, void *clientData);
+void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask);
+int aeGetFileEvents(aeEventLoop *eventLoop, int fd);
+long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
+        aeTimeProc *proc, void *clientData,
+        aeEventFinalizerProc *finalizerProc);
+int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id);
+int aeProcessEvents(aeEventLoop *eventLoop, int flags);
+int aeWait(int fd, int mask, long long milliseconds);
+void aeMain(aeEventLoop *eventLoop);
+char *aeGetApiName(void);
+void aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep);
+void aeSetAfterSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *aftersleep);
+int aeGetSetSize(aeEventLoop *eventLoop);
+int aeResizeSetSize(aeEventLoop *eventLoop, int setsize);
+void aeSetDontWait(aeEventLoop *eventLoop, int noWait);
+
+#endif
diff --git a/redis-stable/src/ae_epoll.c b/redis-stable/src/ae_epoll.c
new file mode 100644
index 00000000..023c93a1
--- /dev/null
+++ b/redis-stable/src/ae_epoll.c
@@ -0,0 +1,136 @@
+/* Linux epoll(2) based ae.c module
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <sys/epoll.h>
+
+typedef struct aeApiState {
+    int epfd;
+    struct epoll_event *events;
+} aeApiState;
+
+static int aeApiCreate(aeEventLoop *eventLoop) {
+    aeApiState *state = zmalloc(sizeof(aeApiState));
+
+    if (!state) return -1;
+    state->events = zmalloc(sizeof(struct epoll_event)*eventLoop->setsize);
+    if (!state->events) {
+        zfree(state);
+        return -1;
+    }
+    state->epfd = epoll_create(1024); /* 1024 is just a hint for the kernel */
+    if (state->epfd == -1) {
+        zfree(state->events);
+        zfree(state);
+        return -1;
+    }
+    anetCloexec(state->epfd);
+    eventLoop->apidata = state;
+    return 0;
+}
+
+static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
+    aeApiState *state = eventLoop->apidata;
+
+    state->events = zrealloc(state->events, sizeof(struct epoll_event)*setsize);
+    return 0;
+}
+
+static void aeApiFree(aeEventLoop *eventLoop) {
+    aeApiState *state = eventLoop->apidata;
+
+    close(state->epfd);
+    zfree(state->events);
+    zfree(state);
+}
+
+static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+    struct epoll_event ee = {0}; /* avoid valgrind warning */
+    /* If the fd was already monitored for some event, we need a MOD
+     * operation. Otherwise we need an ADD operation. */
+    int op = eventLoop->events[fd].mask == AE_NONE ?
+            EPOLL_CTL_ADD : EPOLL_CTL_MOD;
+
+    ee.events = 0;
+    mask |= eventLoop->events[fd].mask; /* Merge old events */
+    if (mask & AE_READABLE) ee.events |= EPOLLIN;
+    if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;
+    ee.data.fd = fd;
+    if (epoll_ctl(state->epfd,op,fd,&ee) == -1) return -1;
+    return 0;
+}
+
+static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int delmask) {
+    aeApiState *state = eventLoop->apidata;
+    struct epoll_event ee = {0}; /* avoid valgrind warning */
+    int mask = eventLoop->events[fd].mask & (~delmask);
+
+    ee.events = 0;
+    if (mask & AE_READABLE) ee.events |= EPOLLIN;
+    if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;
+    ee.data.fd = fd;
+    if (mask != AE_NONE) {
+        epoll_ctl(state->epfd,EPOLL_CTL_MOD,fd,&ee);
+    } else {
+        /* Note, Kernel < 2.6.9 requires a non null event pointer even for
+         * EPOLL_CTL_DEL. */
+        epoll_ctl(state->epfd,EPOLL_CTL_DEL,fd,&ee);
+    }
+}
+
+static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
+    aeApiState *state = eventLoop->apidata;
+    int retval, numevents = 0;
+
+    retval = epoll_wait(state->epfd,state->events,eventLoop->setsize,
+            tvp ? (tvp->tv_sec*1000 + (tvp->tv_usec + 999)/1000) : -1);
+    if (retval > 0) {
+        int j;
+
+        numevents = retval;
+        for (j = 0; j < numevents; j++) {
+            int mask = 0;
+            struct epoll_event *e = state->events+j;
+
+            if (e->events & EPOLLIN) mask |= AE_READABLE;
+            if (e->events & EPOLLOUT) mask |= AE_WRITABLE;
+            if (e->events & EPOLLERR) mask |= AE_WRITABLE|AE_READABLE;
+            if (e->events & EPOLLHUP) mask |= AE_WRITABLE|AE_READABLE;
+            eventLoop->fired[j].fd = e->data.fd;
+            eventLoop->fired[j].mask = mask;
+        }
+    }
+    return numevents;
+}
+
+static char *aeApiName(void) {
+    return "epoll";
+}
diff --git a/redis-stable/src/ae_evport.c b/redis-stable/src/ae_evport.c
new file mode 100644
index 00000000..7a0b03ae
--- /dev/null
+++ b/redis-stable/src/ae_evport.c
@@ -0,0 +1,323 @@
+/* ae.c module for illumos event ports.
+ *
+ * Copyright (c) 2012, Joyent, Inc. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <assert.h>
+#include <errno.h>
+#include <port.h>
+#include <poll.h>
+
+#include <sys/types.h>
+#include <sys/time.h>
+
+#include <stdio.h>
+
+static int evport_debug = 0;
+
+/*
+ * This file implements the ae API using event ports, present on Solaris-based
+ * systems since Solaris 10.  Using the event port interface, we associate file
+ * descriptors with the port.  Each association also includes the set of poll(2)
+ * events that the consumer is interested in (e.g., POLLIN and POLLOUT).
+ *
+ * There's one tricky piece to this implementation: when we return events via
+ * aeApiPoll, the corresponding file descriptors become dissociated from the
+ * port.  This is necessary because poll events are level-triggered, so if the
+ * fd didn't become dissociated, it would immediately fire another event since
+ * the underlying state hasn't changed yet.  We must re-associate the file
+ * descriptor, but only after we know that our caller has actually read from it.
+ * The ae API does not tell us exactly when that happens, but we do know that
+ * it must happen by the time aeApiPoll is called again.  Our solution is to
+ * keep track of the last fds returned by aeApiPoll and re-associate them next
+ * time aeApiPoll is invoked.
+ *
+ * To summarize, in this module, each fd association is EITHER (a) represented
+ * only via the in-kernel association OR (b) represented by pending_fds and
+ * pending_masks.  (b) is only true for the last fds we returned from aeApiPoll,
+ * and only until we enter aeApiPoll again (at which point we restore the
+ * in-kernel association).
+ */
+#define MAX_EVENT_BATCHSZ 512
+
+typedef struct aeApiState {
+    int     portfd;                             /* event port */
+    uint_t  npending;                           /* # of pending fds */
+    int     pending_fds[MAX_EVENT_BATCHSZ];     /* pending fds */
+    int     pending_masks[MAX_EVENT_BATCHSZ];   /* pending fds' masks */
+} aeApiState;
+
+static int aeApiCreate(aeEventLoop *eventLoop) {
+    int i;
+    aeApiState *state = zmalloc(sizeof(aeApiState));
+    if (!state) return -1;
+
+    state->portfd = port_create();
+    if (state->portfd == -1) {
+        zfree(state);
+        return -1;
+    }
+    anetCloexec(state->portfd);
+
+    state->npending = 0;
+
+    for (i = 0; i < MAX_EVENT_BATCHSZ; i++) {
+        state->pending_fds[i] = -1;
+        state->pending_masks[i] = AE_NONE;
+    }
+
+    eventLoop->apidata = state;
+    return 0;
+}
+
+static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
+    (void) eventLoop;
+    (void) setsize;
+    /* Nothing to resize here. */
+    return 0;
+}
+
+static void aeApiFree(aeEventLoop *eventLoop) {
+    aeApiState *state = eventLoop->apidata;
+
+    close(state->portfd);
+    zfree(state);
+}
+
+static int aeApiLookupPending(aeApiState *state, int fd) {
+    uint_t i;
+
+    for (i = 0; i < state->npending; i++) {
+        if (state->pending_fds[i] == fd)
+            return (i);
+    }
+
+    return (-1);
+}
+
+/*
+ * Helper function to invoke port_associate for the given fd and mask.
+ */
+static int aeApiAssociate(const char *where, int portfd, int fd, int mask) {
+    int events = 0;
+    int rv, err;
+
+    if (mask & AE_READABLE)
+        events |= POLLIN;
+    if (mask & AE_WRITABLE)
+        events |= POLLOUT;
+
+    if (evport_debug)
+        fprintf(stderr, "%s: port_associate(%d, 0x%x) = ", where, fd, events);
+
+    rv = port_associate(portfd, PORT_SOURCE_FD, fd, events,
+        (void *)(uintptr_t)mask);
+    err = errno;
+
+    if (evport_debug)
+        fprintf(stderr, "%d (%s)\n", rv, rv == 0 ? "no error" : strerror(err));
+
+    if (rv == -1) {
+        fprintf(stderr, "%s: port_associate: %s\n", where, strerror(err));
+
+        if (err == EAGAIN)
+            fprintf(stderr, "aeApiAssociate: event port limit exceeded.");
+    }
+
+    return rv;
+}
+
+static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+    int fullmask, pfd;
+
+    if (evport_debug)
+        fprintf(stderr, "aeApiAddEvent: fd %d mask 0x%x\n", fd, mask);
+
+    /*
+     * Since port_associate's "events" argument replaces any existing events, we
+     * must be sure to include whatever events are already associated when
+     * we call port_associate() again.
+     */
+    fullmask = mask | eventLoop->events[fd].mask;
+    pfd = aeApiLookupPending(state, fd);
+
+    if (pfd != -1) {
+        /*
+         * This fd was recently returned from aeApiPoll.  It should be safe to
+         * assume that the consumer has processed that poll event, but we play
+         * it safer by simply updating pending_mask.  The fd will be
+         * re-associated as usual when aeApiPoll is called again.
+         */
+        if (evport_debug)
+            fprintf(stderr, "aeApiAddEvent: adding to pending fd %d\n", fd);
+        state->pending_masks[pfd] |= fullmask;
+        return 0;
+    }
+
+    return (aeApiAssociate("aeApiAddEvent", state->portfd, fd, fullmask));
+}
+
+static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+    int fullmask, pfd;
+
+    if (evport_debug)
+        fprintf(stderr, "del fd %d mask 0x%x\n", fd, mask);
+
+    pfd = aeApiLookupPending(state, fd);
+
+    if (pfd != -1) {
+        if (evport_debug)
+            fprintf(stderr, "deleting event from pending fd %d\n", fd);
+
+        /*
+         * This fd was just returned from aeApiPoll, so it's not currently
+         * associated with the port.  All we need to do is update
+         * pending_mask appropriately.
+         */
+        state->pending_masks[pfd] &= ~mask;
+
+        if (state->pending_masks[pfd] == AE_NONE)
+            state->pending_fds[pfd] = -1;
+
+        return;
+    }
+
+    /*
+     * The fd is currently associated with the port.  Like with the add case
+     * above, we must look at the full mask for the file descriptor before
+     * updating that association.  We don't have a good way of knowing what the
+     * events are without looking into the eventLoop state directly.  We rely on
+     * the fact that our caller has already updated the mask in the eventLoop.
+     */
+
+    fullmask = eventLoop->events[fd].mask;
+    if (fullmask == AE_NONE) {
+        /*
+         * We're removing *all* events, so use port_dissociate to remove the
+         * association completely.  Failure here indicates a bug.
+         */
+        if (evport_debug)
+            fprintf(stderr, "aeApiDelEvent: port_dissociate(%d)\n", fd);
+
+        if (port_dissociate(state->portfd, PORT_SOURCE_FD, fd) != 0) {
+            perror("aeApiDelEvent: port_dissociate");
+            abort(); /* will not return */
+        }
+    } else if (aeApiAssociate("aeApiDelEvent", state->portfd, fd,
+        fullmask) != 0) {
+        /*
+         * ENOMEM is a potentially transient condition, but the kernel won't
+         * generally return it unless things are really bad.  EAGAIN indicates
+         * we've reached a resource limit, for which it doesn't make sense to
+         * retry (counter-intuitively).  All other errors indicate a bug.  In any
+         * of these cases, the best we can do is to abort.
+         */
+        abort(); /* will not return */
+    }
+}
+
+static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
+    aeApiState *state = eventLoop->apidata;
+    struct timespec timeout, *tsp;
+    uint_t mask, i;
+    uint_t nevents;
+    port_event_t event[MAX_EVENT_BATCHSZ];
+
+    /*
+     * If we've returned fd events before, we must re-associate them with the
+     * port now, before calling port_get().  See the block comment at the top of
+     * this file for an explanation of why.
+     */
+    for (i = 0; i < state->npending; i++) {
+        if (state->pending_fds[i] == -1)
+            /* This fd has since been deleted. */
+            continue;
+
+        if (aeApiAssociate("aeApiPoll", state->portfd,
+            state->pending_fds[i], state->pending_masks[i]) != 0) {
+            /* See aeApiDelEvent for why this case is fatal. */
+            abort();
+        }
+
+        state->pending_masks[i] = AE_NONE;
+        state->pending_fds[i] = -1;
+    }
+
+    state->npending = 0;
+
+    if (tvp != NULL) {
+        timeout.tv_sec = tvp->tv_sec;
+        timeout.tv_nsec = tvp->tv_usec * 1000;
+        tsp = &timeout;
+    } else {
+        tsp = NULL;
+    }
+
+    /*
+     * port_getn can return with errno == ETIME having returned some events (!).
+     * So if we get ETIME, we check nevents, too.
+     */
+    nevents = 1;
+    if (port_getn(state->portfd, event, MAX_EVENT_BATCHSZ, &nevents,
+        tsp) == -1 && (errno != ETIME || nevents == 0)) {
+        if (errno == ETIME || errno == EINTR)
+            return 0;
+
+        /* Any other error indicates a bug. */
+        perror("aeApiPoll: port_get");
+        abort();
+    }
+
+    state->npending = nevents;
+
+    for (i = 0; i < nevents; i++) {
+            mask = 0;
+            if (event[i].portev_events & POLLIN)
+                mask |= AE_READABLE;
+            if (event[i].portev_events & POLLOUT)
+                mask |= AE_WRITABLE;
+
+            eventLoop->fired[i].fd = event[i].portev_object;
+            eventLoop->fired[i].mask = mask;
+
+            if (evport_debug)
+                fprintf(stderr, "aeApiPoll: fd %d mask 0x%x\n",
+                    (int)event[i].portev_object, mask);
+
+            state->pending_fds[i] = event[i].portev_object;
+            state->pending_masks[i] = (uintptr_t)event[i].portev_user;
+    }
+
+    return nevents;
+}
+
+static char *aeApiName(void) {
+    return "evport";
+}
diff --git a/redis-stable/src/ae_kqueue.c b/redis-stable/src/ae_kqueue.c
new file mode 100644
index 00000000..6d62720b
--- /dev/null
+++ b/redis-stable/src/ae_kqueue.c
@@ -0,0 +1,187 @@
+/* Kqueue(2)-based ae.c module
+ *
+ * Copyright (C) 2009 Harish Mallipeddi - harish.mallipeddi@gmail.com
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <sys/types.h>
+#include <sys/event.h>
+#include <sys/time.h>
+
+typedef struct aeApiState {
+    int kqfd;
+    struct kevent *events;
+
+    /* Events mask for merge read and write event.
+     * To reduce memory consumption, we use 2 bits to store the mask
+     * of an event, so that 1 byte will store the mask of 4 events. */
+    char *eventsMask; 
+} aeApiState;
+
+#define EVENT_MASK_MALLOC_SIZE(sz) (((sz) + 3) / 4)
+#define EVENT_MASK_OFFSET(fd) ((fd) % 4 * 2)
+#define EVENT_MASK_ENCODE(fd, mask) (((mask) & 0x3) << EVENT_MASK_OFFSET(fd))
+
+static inline int getEventMask(const char *eventsMask, int fd) {
+    return (eventsMask[fd/4] >> EVENT_MASK_OFFSET(fd)) & 0x3;
+}
+
+static inline void addEventMask(char *eventsMask, int fd, int mask) {
+    eventsMask[fd/4] |= EVENT_MASK_ENCODE(fd, mask);
+}
+
+static inline void resetEventMask(char *eventsMask, int fd) {
+    eventsMask[fd/4] &= ~EVENT_MASK_ENCODE(fd, 0x3);
+}
+
+static int aeApiCreate(aeEventLoop *eventLoop) {
+    aeApiState *state = zmalloc(sizeof(aeApiState));
+
+    if (!state) return -1;
+    state->events = zmalloc(sizeof(struct kevent)*eventLoop->setsize);
+    if (!state->events) {
+        zfree(state);
+        return -1;
+    }
+    state->kqfd = kqueue();
+    if (state->kqfd == -1) {
+        zfree(state->events);
+        zfree(state);
+        return -1;
+    }
+    anetCloexec(state->kqfd);
+    state->eventsMask = zmalloc(EVENT_MASK_MALLOC_SIZE(eventLoop->setsize));
+    memset(state->eventsMask, 0, EVENT_MASK_MALLOC_SIZE(eventLoop->setsize));
+    eventLoop->apidata = state;
+    return 0;
+}
+
+static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
+    aeApiState *state = eventLoop->apidata;
+
+    state->events = zrealloc(state->events, sizeof(struct kevent)*setsize);
+    state->eventsMask = zrealloc(state->eventsMask, EVENT_MASK_MALLOC_SIZE(setsize));
+    memset(state->eventsMask, 0, EVENT_MASK_MALLOC_SIZE(setsize));
+    return 0;
+}
+
+static void aeApiFree(aeEventLoop *eventLoop) {
+    aeApiState *state = eventLoop->apidata;
+
+    close(state->kqfd);
+    zfree(state->events);
+    zfree(state->eventsMask);
+    zfree(state);
+}
+
+static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+    struct kevent ke;
+
+    if (mask & AE_READABLE) {
+        EV_SET(&ke, fd, EVFILT_READ, EV_ADD, 0, 0, NULL);
+        if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;
+    }
+    if (mask & AE_WRITABLE) {
+        EV_SET(&ke, fd, EVFILT_WRITE, EV_ADD, 0, 0, NULL);
+        if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;
+    }
+    return 0;
+}
+
+static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+    struct kevent ke;
+
+    if (mask & AE_READABLE) {
+        EV_SET(&ke, fd, EVFILT_READ, EV_DELETE, 0, 0, NULL);
+        kevent(state->kqfd, &ke, 1, NULL, 0, NULL);
+    }
+    if (mask & AE_WRITABLE) {
+        EV_SET(&ke, fd, EVFILT_WRITE, EV_DELETE, 0, 0, NULL);
+        kevent(state->kqfd, &ke, 1, NULL, 0, NULL);
+    }
+}
+
+static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
+    aeApiState *state = eventLoop->apidata;
+    int retval, numevents = 0;
+
+    if (tvp != NULL) {
+        struct timespec timeout;
+        timeout.tv_sec = tvp->tv_sec;
+        timeout.tv_nsec = tvp->tv_usec * 1000;
+        retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,
+                        &timeout);
+    } else {
+        retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,
+                        NULL);
+    }
+
+    if (retval > 0) {
+        int j;
+
+        /* Normally we execute the read event first and then the write event.
+         * When the barrier is set, we will do it reverse.
+         * 
+         * However, under kqueue, read and write events would be separate
+         * events, which would make it impossible to control the order of
+         * reads and writes. So we store the event's mask we've got and merge
+         * the same fd events later. */
+        for (j = 0; j < retval; j++) {
+            struct kevent *e = state->events+j;
+            int fd = e->ident;
+            int mask = 0; 
+
+            if (e->filter == EVFILT_READ) mask = AE_READABLE;
+            else if (e->filter == EVFILT_WRITE) mask = AE_WRITABLE;
+            addEventMask(state->eventsMask, fd, mask);
+        }
+
+        /* Re-traversal to merge read and write events, and set the fd's mask to
+         * 0 so that events are not added again when the fd is encountered again. */
+        numevents = 0;
+        for (j = 0; j < retval; j++) {
+            struct kevent *e = state->events+j;
+            int fd = e->ident;
+            int mask = getEventMask(state->eventsMask, fd);
+
+            if (mask) {
+                eventLoop->fired[numevents].fd = fd;
+                eventLoop->fired[numevents].mask = mask;
+                resetEventMask(state->eventsMask, fd);
+                numevents++;
+            }
+        }
+    }
+    return numevents;
+}
+
+static char *aeApiName(void) {
+    return "kqueue";
+}
diff --git a/redis-stable/src/ae_select.c b/redis-stable/src/ae_select.c
new file mode 100644
index 00000000..c039a8ea
--- /dev/null
+++ b/redis-stable/src/ae_select.c
@@ -0,0 +1,106 @@
+/* Select()-based ae.c module.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <sys/select.h>
+#include <string.h>
+
+typedef struct aeApiState {
+    fd_set rfds, wfds;
+    /* We need to have a copy of the fd sets as it's not safe to reuse
+     * FD sets after select(). */
+    fd_set _rfds, _wfds;
+} aeApiState;
+
+static int aeApiCreate(aeEventLoop *eventLoop) {
+    aeApiState *state = zmalloc(sizeof(aeApiState));
+
+    if (!state) return -1;
+    FD_ZERO(&state->rfds);
+    FD_ZERO(&state->wfds);
+    eventLoop->apidata = state;
+    return 0;
+}
+
+static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
+    /* Just ensure we have enough room in the fd_set type. */
+    if (setsize >= FD_SETSIZE) return -1;
+    return 0;
+}
+
+static void aeApiFree(aeEventLoop *eventLoop) {
+    zfree(eventLoop->apidata);
+}
+
+static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+
+    if (mask & AE_READABLE) FD_SET(fd,&state->rfds);
+    if (mask & AE_WRITABLE) FD_SET(fd,&state->wfds);
+    return 0;
+}
+
+static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
+    aeApiState *state = eventLoop->apidata;
+
+    if (mask & AE_READABLE) FD_CLR(fd,&state->rfds);
+    if (mask & AE_WRITABLE) FD_CLR(fd,&state->wfds);
+}
+
+static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
+    aeApiState *state = eventLoop->apidata;
+    int retval, j, numevents = 0;
+
+    memcpy(&state->_rfds,&state->rfds,sizeof(fd_set));
+    memcpy(&state->_wfds,&state->wfds,sizeof(fd_set));
+
+    retval = select(eventLoop->maxfd+1,
+                &state->_rfds,&state->_wfds,NULL,tvp);
+    if (retval > 0) {
+        for (j = 0; j <= eventLoop->maxfd; j++) {
+            int mask = 0;
+            aeFileEvent *fe = &eventLoop->events[j];
+
+            if (fe->mask == AE_NONE) continue;
+            if (fe->mask & AE_READABLE && FD_ISSET(j,&state->_rfds))
+                mask |= AE_READABLE;
+            if (fe->mask & AE_WRITABLE && FD_ISSET(j,&state->_wfds))
+                mask |= AE_WRITABLE;
+            eventLoop->fired[numevents].fd = j;
+            eventLoop->fired[numevents].mask = mask;
+            numevents++;
+        }
+    }
+    return numevents;
+}
+
+static char *aeApiName(void) {
+    return "select";
+}
diff --git a/redis-stable/src/anet.c b/redis-stable/src/anet.c
new file mode 100644
index 00000000..a121c276
--- /dev/null
+++ b/redis-stable/src/anet.c
@@ -0,0 +1,595 @@
+/* anet.c -- Basic TCP socket stuff made a bit less boring
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+
+#include <sys/types.h>
+#include <sys/socket.h>
+#include <sys/stat.h>
+#include <sys/un.h>
+#include <sys/time.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <arpa/inet.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <string.h>
+#include <netdb.h>
+#include <errno.h>
+#include <stdarg.h>
+#include <stdio.h>
+
+#include "anet.h"
+
+static void anetSetError(char *err, const char *fmt, ...)
+{
+    va_list ap;
+
+    if (!err) return;
+    va_start(ap, fmt);
+    vsnprintf(err, ANET_ERR_LEN, fmt, ap);
+    va_end(ap);
+}
+
+int anetSetBlock(char *err, int fd, int non_block) {
+    int flags;
+
+    /* Set the socket blocking (if non_block is zero) or non-blocking.
+     * Note that fcntl(2) for F_GETFL and F_SETFL can't be
+     * interrupted by a signal. */
+    if ((flags = fcntl(fd, F_GETFL)) == -1) {
+        anetSetError(err, "fcntl(F_GETFL): %s", strerror(errno));
+        return ANET_ERR;
+    }
+
+    /* Check if this flag has been set or unset, if so, 
+     * then there is no need to call fcntl to set/unset it again. */
+    if (!!(flags & O_NONBLOCK) == !!non_block)
+        return ANET_OK;
+
+    if (non_block)
+        flags |= O_NONBLOCK;
+    else
+        flags &= ~O_NONBLOCK;
+
+    if (fcntl(fd, F_SETFL, flags) == -1) {
+        anetSetError(err, "fcntl(F_SETFL,O_NONBLOCK): %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+int anetNonBlock(char *err, int fd) {
+    return anetSetBlock(err,fd,1);
+}
+
+int anetBlock(char *err, int fd) {
+    return anetSetBlock(err,fd,0);
+}
+
+/* Enable the FD_CLOEXEC on the given fd to avoid fd leaks. 
+ * This function should be invoked for fd's on specific places 
+ * where fork + execve system calls are called. */
+int anetCloexec(int fd) {
+    int r;
+    int flags;
+
+    do {
+        r = fcntl(fd, F_GETFD);
+    } while (r == -1 && errno == EINTR);
+
+    if (r == -1 || (r & FD_CLOEXEC))
+        return r;
+
+    flags = r | FD_CLOEXEC;
+
+    do {
+        r = fcntl(fd, F_SETFD, flags);
+    } while (r == -1 && errno == EINTR);
+
+    return r;
+}
+
+/* Set TCP keep alive option to detect dead peers. The interval option
+ * is only used for Linux as we are using Linux-specific APIs to set
+ * the probe send time, interval, and count. */
+int anetKeepAlive(char *err, int fd, int interval)
+{
+    int val = 1;
+
+    if (setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &val, sizeof(val)) == -1)
+    {
+        anetSetError(err, "setsockopt SO_KEEPALIVE: %s", strerror(errno));
+        return ANET_ERR;
+    }
+
+#ifdef __linux__
+    /* Default settings are more or less garbage, with the keepalive time
+     * set to 7200 by default on Linux. Modify settings to make the feature
+     * actually useful. */
+
+    /* Send first probe after interval. */
+    val = interval;
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPIDLE, &val, sizeof(val)) < 0) {
+        anetSetError(err, "setsockopt TCP_KEEPIDLE: %s\n", strerror(errno));
+        return ANET_ERR;
+    }
+
+    /* Send next probes after the specified interval. Note that we set the
+     * delay as interval / 3, as we send three probes before detecting
+     * an error (see the next setsockopt call). */
+    val = interval/3;
+    if (val == 0) val = 1;
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPINTVL, &val, sizeof(val)) < 0) {
+        anetSetError(err, "setsockopt TCP_KEEPINTVL: %s\n", strerror(errno));
+        return ANET_ERR;
+    }
+
+    /* Consider the socket in error state after three we send three ACK
+     * probes without getting a reply. */
+    val = 3;
+    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPCNT, &val, sizeof(val)) < 0) {
+        anetSetError(err, "setsockopt TCP_KEEPCNT: %s\n", strerror(errno));
+        return ANET_ERR;
+    }
+#else
+    ((void) interval); /* Avoid unused var warning for non Linux systems. */
+#endif
+
+    return ANET_OK;
+}
+
+static int anetSetTcpNoDelay(char *err, int fd, int val)
+{
+    if (setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &val, sizeof(val)) == -1)
+    {
+        anetSetError(err, "setsockopt TCP_NODELAY: %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+int anetEnableTcpNoDelay(char *err, int fd)
+{
+    return anetSetTcpNoDelay(err, fd, 1);
+}
+
+int anetDisableTcpNoDelay(char *err, int fd)
+{
+    return anetSetTcpNoDelay(err, fd, 0);
+}
+
+/* Set the socket send timeout (SO_SNDTIMEO socket option) to the specified
+ * number of milliseconds, or disable it if the 'ms' argument is zero. */
+int anetSendTimeout(char *err, int fd, long long ms) {
+    struct timeval tv;
+
+    tv.tv_sec = ms/1000;
+    tv.tv_usec = (ms%1000)*1000;
+    if (setsockopt(fd, SOL_SOCKET, SO_SNDTIMEO, &tv, sizeof(tv)) == -1) {
+        anetSetError(err, "setsockopt SO_SNDTIMEO: %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+/* Set the socket receive timeout (SO_RCVTIMEO socket option) to the specified
+ * number of milliseconds, or disable it if the 'ms' argument is zero. */
+int anetRecvTimeout(char *err, int fd, long long ms) {
+    struct timeval tv;
+
+    tv.tv_sec = ms/1000;
+    tv.tv_usec = (ms%1000)*1000;
+    if (setsockopt(fd, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)) == -1) {
+        anetSetError(err, "setsockopt SO_RCVTIMEO: %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+/* Resolve the hostname "host" and set the string representation of the
+ * IP address into the buffer pointed by "ipbuf".
+ *
+ * If flags is set to ANET_IP_ONLY the function only resolves hostnames
+ * that are actually already IPv4 or IPv6 addresses. This turns the function
+ * into a validating / normalizing function. */
+int anetResolve(char *err, char *host, char *ipbuf, size_t ipbuf_len,
+                       int flags)
+{
+    struct addrinfo hints, *info;
+    int rv;
+
+    memset(&hints,0,sizeof(hints));
+    if (flags & ANET_IP_ONLY) hints.ai_flags = AI_NUMERICHOST;
+    hints.ai_family = AF_UNSPEC;
+    hints.ai_socktype = SOCK_STREAM;  /* specify socktype to avoid dups */
+
+    if ((rv = getaddrinfo(host, NULL, &hints, &info)) != 0) {
+        anetSetError(err, "%s", gai_strerror(rv));
+        return ANET_ERR;
+    }
+    if (info->ai_family == AF_INET) {
+        struct sockaddr_in *sa = (struct sockaddr_in *)info->ai_addr;
+        inet_ntop(AF_INET, &(sa->sin_addr), ipbuf, ipbuf_len);
+    } else {
+        struct sockaddr_in6 *sa = (struct sockaddr_in6 *)info->ai_addr;
+        inet_ntop(AF_INET6, &(sa->sin6_addr), ipbuf, ipbuf_len);
+    }
+
+    freeaddrinfo(info);
+    return ANET_OK;
+}
+
+static int anetSetReuseAddr(char *err, int fd) {
+    int yes = 1;
+    /* Make sure connection-intensive things like the redis benchmark
+     * will be able to close/open sockets a zillion of times */
+    if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes)) == -1) {
+        anetSetError(err, "setsockopt SO_REUSEADDR: %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+static int anetCreateSocket(char *err, int domain) {
+    int s;
+    if ((s = socket(domain, SOCK_STREAM, 0)) == -1) {
+        anetSetError(err, "creating socket: %s", strerror(errno));
+        return ANET_ERR;
+    }
+
+    /* Make sure connection-intensive things like the redis benchmark
+     * will be able to close/open sockets a zillion of times */
+    if (anetSetReuseAddr(err,s) == ANET_ERR) {
+        close(s);
+        return ANET_ERR;
+    }
+    return s;
+}
+
+#define ANET_CONNECT_NONE 0
+#define ANET_CONNECT_NONBLOCK 1
+#define ANET_CONNECT_BE_BINDING 2 /* Best effort binding. */
+static int anetTcpGenericConnect(char *err, const char *addr, int port,
+                                 const char *source_addr, int flags)
+{
+    int s = ANET_ERR, rv;
+    char portstr[6];  /* strlen("65535") + 1; */
+    struct addrinfo hints, *servinfo, *bservinfo, *p, *b;
+
+    snprintf(portstr,sizeof(portstr),"%d",port);
+    memset(&hints,0,sizeof(hints));
+    hints.ai_family = AF_UNSPEC;
+    hints.ai_socktype = SOCK_STREAM;
+
+    if ((rv = getaddrinfo(addr,portstr,&hints,&servinfo)) != 0) {
+        anetSetError(err, "%s", gai_strerror(rv));
+        return ANET_ERR;
+    }
+    for (p = servinfo; p != NULL; p = p->ai_next) {
+        /* Try to create the socket and to connect it.
+         * If we fail in the socket() call, or on connect(), we retry with
+         * the next entry in servinfo. */
+        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == -1)
+            continue;
+        if (anetSetReuseAddr(err,s) == ANET_ERR) goto error;
+        if (flags & ANET_CONNECT_NONBLOCK && anetNonBlock(err,s) != ANET_OK)
+            goto error;
+        if (source_addr) {
+            int bound = 0;
+            /* Using getaddrinfo saves us from self-determining IPv4 vs IPv6 */
+            if ((rv = getaddrinfo(source_addr, NULL, &hints, &bservinfo)) != 0)
+            {
+                anetSetError(err, "%s", gai_strerror(rv));
+                goto error;
+            }
+            for (b = bservinfo; b != NULL; b = b->ai_next) {
+                if (bind(s,b->ai_addr,b->ai_addrlen) != -1) {
+                    bound = 1;
+                    break;
+                }
+            }
+            freeaddrinfo(bservinfo);
+            if (!bound) {
+                anetSetError(err, "bind: %s", strerror(errno));
+                goto error;
+            }
+        }
+        if (connect(s,p->ai_addr,p->ai_addrlen) == -1) {
+            /* If the socket is non-blocking, it is ok for connect() to
+             * return an EINPROGRESS error here. */
+            if (errno == EINPROGRESS && flags & ANET_CONNECT_NONBLOCK)
+                goto end;
+            close(s);
+            s = ANET_ERR;
+            continue;
+        }
+
+        /* If we ended an iteration of the for loop without errors, we
+         * have a connected socket. Let's return to the caller. */
+        goto end;
+    }
+    if (p == NULL)
+        anetSetError(err, "creating socket: %s", strerror(errno));
+
+error:
+    if (s != ANET_ERR) {
+        close(s);
+        s = ANET_ERR;
+    }
+
+end:
+    freeaddrinfo(servinfo);
+
+    /* Handle best effort binding: if a binding address was used, but it is
+     * not possible to create a socket, try again without a binding address. */
+    if (s == ANET_ERR && source_addr && (flags & ANET_CONNECT_BE_BINDING)) {
+        return anetTcpGenericConnect(err,addr,port,NULL,flags);
+    } else {
+        return s;
+    }
+}
+
+int anetTcpNonBlockConnect(char *err, const char *addr, int port)
+{
+    return anetTcpGenericConnect(err,addr,port,NULL,ANET_CONNECT_NONBLOCK);
+}
+
+int anetTcpNonBlockBestEffortBindConnect(char *err, const char *addr, int port,
+                                         const char *source_addr)
+{
+    return anetTcpGenericConnect(err,addr,port,source_addr,
+            ANET_CONNECT_NONBLOCK|ANET_CONNECT_BE_BINDING);
+}
+
+int anetUnixGenericConnect(char *err, const char *path, int flags)
+{
+    int s;
+    struct sockaddr_un sa;
+
+    if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR)
+        return ANET_ERR;
+
+    sa.sun_family = AF_LOCAL;
+    strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1);
+    if (flags & ANET_CONNECT_NONBLOCK) {
+        if (anetNonBlock(err,s) != ANET_OK) {
+            close(s);
+            return ANET_ERR;
+        }
+    }
+    if (connect(s,(struct sockaddr*)&sa,sizeof(sa)) == -1) {
+        if (errno == EINPROGRESS &&
+            flags & ANET_CONNECT_NONBLOCK)
+            return s;
+
+        anetSetError(err, "connect: %s", strerror(errno));
+        close(s);
+        return ANET_ERR;
+    }
+    return s;
+}
+
+static int anetListen(char *err, int s, struct sockaddr *sa, socklen_t len, int backlog) {
+    if (bind(s,sa,len) == -1) {
+        anetSetError(err, "bind: %s", strerror(errno));
+        close(s);
+        return ANET_ERR;
+    }
+
+    if (listen(s, backlog) == -1) {
+        anetSetError(err, "listen: %s", strerror(errno));
+        close(s);
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+static int anetV6Only(char *err, int s) {
+    int yes = 1;
+    if (setsockopt(s,IPPROTO_IPV6,IPV6_V6ONLY,&yes,sizeof(yes)) == -1) {
+        anetSetError(err, "setsockopt: %s", strerror(errno));
+        return ANET_ERR;
+    }
+    return ANET_OK;
+}
+
+static int _anetTcpServer(char *err, int port, char *bindaddr, int af, int backlog)
+{
+    int s = -1, rv;
+    char _port[6];  /* strlen("65535") */
+    struct addrinfo hints, *servinfo, *p;
+
+    snprintf(_port,6,"%d",port);
+    memset(&hints,0,sizeof(hints));
+    hints.ai_family = af;
+    hints.ai_socktype = SOCK_STREAM;
+    hints.ai_flags = AI_PASSIVE;    /* No effect if bindaddr != NULL */
+    if (bindaddr && !strcmp("*", bindaddr))
+        bindaddr = NULL;
+    if (af == AF_INET6 && bindaddr && !strcmp("::*", bindaddr))
+        bindaddr = NULL;
+
+    if ((rv = getaddrinfo(bindaddr,_port,&hints,&servinfo)) != 0) {
+        anetSetError(err, "%s", gai_strerror(rv));
+        return ANET_ERR;
+    }
+    for (p = servinfo; p != NULL; p = p->ai_next) {
+        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == -1)
+            continue;
+
+        if (af == AF_INET6 && anetV6Only(err,s) == ANET_ERR) goto error;
+        if (anetSetReuseAddr(err,s) == ANET_ERR) goto error;
+        if (anetListen(err,s,p->ai_addr,p->ai_addrlen,backlog) == ANET_ERR) s = ANET_ERR;
+        goto end;
+    }
+    if (p == NULL) {
+        anetSetError(err, "unable to bind socket, errno: %d", errno);
+        goto error;
+    }
+
+error:
+    if (s != -1) close(s);
+    s = ANET_ERR;
+end:
+    freeaddrinfo(servinfo);
+    return s;
+}
+
+int anetTcpServer(char *err, int port, char *bindaddr, int backlog)
+{
+    return _anetTcpServer(err, port, bindaddr, AF_INET, backlog);
+}
+
+int anetTcp6Server(char *err, int port, char *bindaddr, int backlog)
+{
+    return _anetTcpServer(err, port, bindaddr, AF_INET6, backlog);
+}
+
+int anetUnixServer(char *err, char *path, mode_t perm, int backlog)
+{
+    int s;
+    struct sockaddr_un sa;
+
+    if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR)
+        return ANET_ERR;
+
+    memset(&sa,0,sizeof(sa));
+    sa.sun_family = AF_LOCAL;
+    strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1);
+    if (anetListen(err,s,(struct sockaddr*)&sa,sizeof(sa),backlog) == ANET_ERR)
+        return ANET_ERR;
+    if (perm)
+        chmod(sa.sun_path, perm);
+    return s;
+}
+
+static int anetGenericAccept(char *err, int s, struct sockaddr *sa, socklen_t *len) {
+    int fd;
+    while(1) {
+        fd = accept(s,sa,len);
+        if (fd == -1) {
+            if (errno == EINTR)
+                continue;
+            else {
+                anetSetError(err, "accept: %s", strerror(errno));
+                return ANET_ERR;
+            }
+        }
+        break;
+    }
+    return fd;
+}
+
+int anetTcpAccept(char *err, int s, char *ip, size_t ip_len, int *port) {
+    int fd;
+    struct sockaddr_storage sa;
+    socklen_t salen = sizeof(sa);
+    if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == -1)
+        return ANET_ERR;
+
+    if (sa.ss_family == AF_INET) {
+        struct sockaddr_in *s = (struct sockaddr_in *)&sa;
+        if (ip) inet_ntop(AF_INET,(void*)&(s->sin_addr),ip,ip_len);
+        if (port) *port = ntohs(s->sin_port);
+    } else {
+        struct sockaddr_in6 *s = (struct sockaddr_in6 *)&sa;
+        if (ip) inet_ntop(AF_INET6,(void*)&(s->sin6_addr),ip,ip_len);
+        if (port) *port = ntohs(s->sin6_port);
+    }
+    return fd;
+}
+
+int anetUnixAccept(char *err, int s) {
+    int fd;
+    struct sockaddr_un sa;
+    socklen_t salen = sizeof(sa);
+    if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == -1)
+        return ANET_ERR;
+
+    return fd;
+}
+
+int anetFdToString(int fd, char *ip, size_t ip_len, int *port, int fd_to_str_type) {
+    struct sockaddr_storage sa;
+    socklen_t salen = sizeof(sa);
+
+    if (fd_to_str_type == FD_TO_PEER_NAME) {
+        if (getpeername(fd, (struct sockaddr *)&sa, &salen) == -1) goto error;
+    } else {
+        if (getsockname(fd, (struct sockaddr *)&sa, &salen) == -1) goto error;
+    }
+    if (ip_len == 0) goto error;
+
+    if (sa.ss_family == AF_INET) {
+        struct sockaddr_in *s = (struct sockaddr_in *)&sa;
+        if (ip) inet_ntop(AF_INET,(void*)&(s->sin_addr),ip,ip_len);
+        if (port) *port = ntohs(s->sin_port);
+    } else if (sa.ss_family == AF_INET6) {
+        struct sockaddr_in6 *s = (struct sockaddr_in6 *)&sa;
+        if (ip) inet_ntop(AF_INET6,(void*)&(s->sin6_addr),ip,ip_len);
+        if (port) *port = ntohs(s->sin6_port);
+    } else if (sa.ss_family == AF_UNIX) {
+        if (ip) snprintf(ip, ip_len, "/unixsocket");
+        if (port) *port = 0;
+    } else {
+        goto error;
+    }
+    return 0;
+
+error:
+    if (ip) {
+        if (ip_len >= 2) {
+            ip[0] = '?';
+            ip[1] = '\0';
+        } else if (ip_len == 1) {
+            ip[0] = '\0';
+        }
+    }
+    if (port) *port = 0;
+    return -1;
+}
+
+/* Format an IP,port pair into something easy to parse. If IP is IPv6
+ * (matches for ":"), the ip is surrounded by []. IP and port are just
+ * separated by colons. This the standard to display addresses within Redis. */
+int anetFormatAddr(char *buf, size_t buf_len, char *ip, int port) {
+    return snprintf(buf,buf_len, strchr(ip,':') ?
+           "[%s]:%d" : "%s:%d", ip, port);
+}
+
+/* Like anetFormatAddr() but extract ip and port from the socket's peer/sockname. */
+int anetFormatFdAddr(int fd, char *buf, size_t buf_len, int fd_to_str_type) {
+    char ip[INET6_ADDRSTRLEN];
+    int port;
+
+    anetFdToString(fd,ip,sizeof(ip),&port,fd_to_str_type);
+    return anetFormatAddr(buf, buf_len, ip, port);
+}
diff --git a/redis-stable/src/anet.h b/redis-stable/src/anet.h
new file mode 100644
index 00000000..2a685cc0
--- /dev/null
+++ b/redis-stable/src/anet.h
@@ -0,0 +1,76 @@
+/* anet.c -- Basic TCP socket stuff made a bit less boring
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef ANET_H
+#define ANET_H
+
+#include <sys/types.h>
+
+#define ANET_OK 0
+#define ANET_ERR -1
+#define ANET_ERR_LEN 256
+
+/* Flags used with certain functions. */
+#define ANET_NONE 0
+#define ANET_IP_ONLY (1<<0)
+
+#if defined(__sun) || defined(_AIX)
+#define AF_LOCAL AF_UNIX
+#endif
+
+#ifdef _AIX
+#undef ip_len
+#endif
+
+/* FD to address string conversion types */
+#define FD_TO_PEER_NAME 0
+#define FD_TO_SOCK_NAME 1
+
+int anetTcpNonBlockConnect(char *err, const char *addr, int port);
+int anetTcpNonBlockBestEffortBindConnect(char *err, const char *addr, int port, const char *source_addr);
+int anetResolve(char *err, char *host, char *ipbuf, size_t ipbuf_len, int flags);
+int anetTcpServer(char *err, int port, char *bindaddr, int backlog);
+int anetTcp6Server(char *err, int port, char *bindaddr, int backlog);
+int anetUnixServer(char *err, char *path, mode_t perm, int backlog);
+int anetTcpAccept(char *err, int serversock, char *ip, size_t ip_len, int *port);
+int anetUnixAccept(char *err, int serversock);
+int anetNonBlock(char *err, int fd);
+int anetBlock(char *err, int fd);
+int anetCloexec(int fd);
+int anetEnableTcpNoDelay(char *err, int fd);
+int anetDisableTcpNoDelay(char *err, int fd);
+int anetSendTimeout(char *err, int fd, long long ms);
+int anetRecvTimeout(char *err, int fd, long long ms);
+int anetFdToString(int fd, char *ip, size_t ip_len, int *port, int fd_to_str_type);
+int anetKeepAlive(char *err, int fd, int interval);
+int anetFormatAddr(char *fmt, size_t fmt_len, char *ip, int port);
+int anetFormatFdAddr(int fd, char *buf, size_t buf_len, int fd_to_str_type);
+
+#endif
diff --git a/redis-stable/src/aof.c b/redis-stable/src/aof.c
new file mode 100644
index 00000000..566a9864
--- /dev/null
+++ b/redis-stable/src/aof.c
@@ -0,0 +1,2010 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "bio.h"
+#include "rio.h"
+
+#include <signal.h>
+#include <fcntl.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include <sys/time.h>
+#include <sys/resource.h>
+#include <sys/wait.h>
+#include <sys/param.h>
+
+void aofUpdateCurrentSize(void);
+void aofClosePipes(void);
+
+/* ----------------------------------------------------------------------------
+ * AOF rewrite buffer implementation.
+ *
+ * The following code implement a simple buffer used in order to accumulate
+ * changes while the background process is rewriting the AOF file.
+ *
+ * We only need to append, but can't just use realloc with a large block
+ * because 'huge' reallocs are not always handled as one could expect
+ * (via remapping of pages at OS level) but may involve copying data.
+ *
+ * For this reason we use a list of blocks, every block is
+ * AOF_RW_BUF_BLOCK_SIZE bytes.
+ * ------------------------------------------------------------------------- */
+
+#define AOF_RW_BUF_BLOCK_SIZE (1024*1024*10)    /* 10 MB per block */
+
+typedef struct aofrwblock {
+    unsigned long used, free;
+    char buf[AOF_RW_BUF_BLOCK_SIZE];
+} aofrwblock;
+
+/* This function free the old AOF rewrite buffer if needed, and initialize
+ * a fresh new one. It tests for server.aof_rewrite_buf_blocks equal to NULL
+ * so can be used for the first initialization as well. */
+void aofRewriteBufferReset(void) {
+    if (server.aof_rewrite_buf_blocks)
+        listRelease(server.aof_rewrite_buf_blocks);
+
+    server.aof_rewrite_buf_blocks = listCreate();
+    listSetFreeMethod(server.aof_rewrite_buf_blocks,zfree);
+}
+
+/* Return the current size of the AOF rewrite buffer. */
+unsigned long aofRewriteBufferSize(void) {
+    listNode *ln;
+    listIter li;
+    unsigned long size = 0;
+
+    listRewind(server.aof_rewrite_buf_blocks,&li);
+    while((ln = listNext(&li))) {
+        aofrwblock *block = listNodeValue(ln);
+        size += block->used;
+    }
+    return size;
+}
+
+/* Event handler used to send data to the child process doing the AOF
+ * rewrite. We send pieces of our AOF differences buffer so that the final
+ * write when the child finishes the rewrite will be small. */
+void aofChildWriteDiffData(aeEventLoop *el, int fd, void *privdata, int mask) {
+    listNode *ln;
+    aofrwblock *block;
+    ssize_t nwritten;
+    UNUSED(el);
+    UNUSED(fd);
+    UNUSED(privdata);
+    UNUSED(mask);
+
+    while(1) {
+        ln = listFirst(server.aof_rewrite_buf_blocks);
+        block = ln ? ln->value : NULL;
+        if (server.aof_stop_sending_diff || !block) {
+            aeDeleteFileEvent(server.el,server.aof_pipe_write_data_to_child,
+                              AE_WRITABLE);
+            return;
+        }
+        if (block->used > 0) {
+            nwritten = write(server.aof_pipe_write_data_to_child,
+                             block->buf,block->used);
+            if (nwritten <= 0) return;
+            memmove(block->buf,block->buf+nwritten,block->used-nwritten);
+            block->used -= nwritten;
+            block->free += nwritten;
+        }
+        if (block->used == 0) listDelNode(server.aof_rewrite_buf_blocks,ln);
+    }
+}
+
+/* Append data to the AOF rewrite buffer, allocating new blocks if needed. */
+void aofRewriteBufferAppend(unsigned char *s, unsigned long len) {
+    listNode *ln = listLast(server.aof_rewrite_buf_blocks);
+    aofrwblock *block = ln ? ln->value : NULL;
+
+    while(len) {
+        /* If we already got at least an allocated block, try appending
+         * at least some piece into it. */
+        if (block) {
+            unsigned long thislen = (block->free < len) ? block->free : len;
+            if (thislen) {  /* The current block is not already full. */
+                memcpy(block->buf+block->used, s, thislen);
+                block->used += thislen;
+                block->free -= thislen;
+                s += thislen;
+                len -= thislen;
+            }
+        }
+
+        if (len) { /* First block to allocate, or need another block. */
+            int numblocks;
+
+            block = zmalloc(sizeof(*block));
+            block->free = AOF_RW_BUF_BLOCK_SIZE;
+            block->used = 0;
+            listAddNodeTail(server.aof_rewrite_buf_blocks,block);
+
+            /* Log every time we cross more 10 or 100 blocks, respectively
+             * as a notice or warning. */
+            numblocks = listLength(server.aof_rewrite_buf_blocks);
+            if (((numblocks+1) % 10) == 0) {
+                int level = ((numblocks+1) % 100) == 0 ? LL_WARNING :
+                                                         LL_NOTICE;
+                serverLog(level,"Background AOF buffer size: %lu MB",
+                    aofRewriteBufferSize()/(1024*1024));
+            }
+        }
+    }
+
+    /* Install a file event to send data to the rewrite child if there is
+     * not one already. */
+    if (!server.aof_stop_sending_diff &&
+        aeGetFileEvents(server.el,server.aof_pipe_write_data_to_child) == 0)
+    {
+        aeCreateFileEvent(server.el, server.aof_pipe_write_data_to_child,
+            AE_WRITABLE, aofChildWriteDiffData, NULL);
+    }
+}
+
+/* Write the buffer (possibly composed of multiple blocks) into the specified
+ * fd. If a short write or any other error happens -1 is returned,
+ * otherwise the number of bytes written is returned. */
+ssize_t aofRewriteBufferWrite(int fd) {
+    listNode *ln;
+    listIter li;
+    ssize_t count = 0;
+
+    listRewind(server.aof_rewrite_buf_blocks,&li);
+    while((ln = listNext(&li))) {
+        aofrwblock *block = listNodeValue(ln);
+        ssize_t nwritten;
+
+        if (block->used) {
+            nwritten = write(fd,block->buf,block->used);
+            if (nwritten != (ssize_t)block->used) {
+                if (nwritten == 0) errno = EIO;
+                return -1;
+            }
+            count += nwritten;
+        }
+    }
+    return count;
+}
+
+/* ----------------------------------------------------------------------------
+ * AOF file implementation
+ * ------------------------------------------------------------------------- */
+
+/* Return true if an AOf fsync is currently already in progress in a
+ * BIO thread. */
+int aofFsyncInProgress(void) {
+    return bioPendingJobsOfType(BIO_AOF_FSYNC) != 0;
+}
+
+/* Starts a background task that performs fsync() against the specified
+ * file descriptor (the one of the AOF file) in another thread. */
+void aof_background_fsync(int fd) {
+    bioCreateFsyncJob(fd);
+}
+
+/* Kills an AOFRW child process if exists */
+void killAppendOnlyChild(void) {
+    int statloc;
+    /* No AOFRW child? return. */
+    if (server.child_type != CHILD_TYPE_AOF) return;
+    /* Kill AOFRW child, wait for child exit. */
+    serverLog(LL_NOTICE,"Killing running AOF rewrite child: %ld",
+        (long) server.child_pid);
+    if (kill(server.child_pid,SIGUSR1) != -1) {
+        while(waitpid(-1, &statloc, 0) != server.child_pid);
+    }
+    /* Reset the buffer accumulating changes while the child saves. */
+    aofRewriteBufferReset();
+    aofRemoveTempFile(server.child_pid);
+    resetChildState();
+    server.aof_rewrite_time_start = -1;
+    /* Close pipes used for IPC between the two processes. */
+    aofClosePipes();
+}
+
+/* Called when the user switches from "appendonly yes" to "appendonly no"
+ * at runtime using the CONFIG command. */
+void stopAppendOnly(void) {
+    serverAssert(server.aof_state != AOF_OFF);
+    flushAppendOnlyFile(1);
+    if (redis_fsync(server.aof_fd) == -1) {
+        serverLog(LL_WARNING,"Fail to fsync the AOF file: %s",strerror(errno));
+    } else {
+        server.aof_fsync_offset = server.aof_current_size;
+        server.aof_last_fsync = server.unixtime;
+    }
+    close(server.aof_fd);
+
+    server.aof_fd = -1;
+    server.aof_selected_db = -1;
+    server.aof_state = AOF_OFF;
+    server.aof_rewrite_scheduled = 0;
+    killAppendOnlyChild();
+    sdsfree(server.aof_buf);
+    server.aof_buf = sdsempty();
+}
+
+/* Called when the user switches from "appendonly no" to "appendonly yes"
+ * at runtime using the CONFIG command. */
+int startAppendOnly(void) {
+    char cwd[MAXPATHLEN]; /* Current working dir path for error messages. */
+    int newfd;
+
+    newfd = open(server.aof_filename,O_WRONLY|O_APPEND|O_CREAT,0644);
+    serverAssert(server.aof_state == AOF_OFF);
+    if (newfd == -1) {
+        char *cwdp = getcwd(cwd,MAXPATHLEN);
+
+        serverLog(LL_WARNING,
+            "Redis needs to enable the AOF but can't open the "
+            "append only file %s (in server root dir %s): %s",
+            server.aof_filename,
+            cwdp ? cwdp : "unknown",
+            strerror(errno));
+        return C_ERR;
+    }
+    if (hasActiveChildProcess() && server.child_type != CHILD_TYPE_AOF) {
+        server.aof_rewrite_scheduled = 1;
+        serverLog(LL_WARNING,"AOF was enabled but there is already another background operation. An AOF background was scheduled to start when possible.");
+    } else {
+        /* If there is a pending AOF rewrite, we need to switch it off and
+         * start a new one: the old one cannot be reused because it is not
+         * accumulating the AOF buffer. */
+        if (server.child_type == CHILD_TYPE_AOF) {
+            serverLog(LL_WARNING,"AOF was enabled but there is already an AOF rewriting in background. Stopping background AOF and starting a rewrite now.");
+            killAppendOnlyChild();
+        }
+        if (rewriteAppendOnlyFileBackground() == C_ERR) {
+            close(newfd);
+            serverLog(LL_WARNING,"Redis needs to enable the AOF but can't trigger a background AOF rewrite operation. Check the above logs for more info about the error.");
+            return C_ERR;
+        }
+    }
+    /* We correctly switched on AOF, now wait for the rewrite to be complete
+     * in order to append data on disk. */
+    server.aof_state = AOF_WAIT_REWRITE;
+    server.aof_last_fsync = server.unixtime;
+    server.aof_fd = newfd;
+
+    /* If AOF fsync error in bio job, we just ignore it and log the event. */
+    int aof_bio_fsync_status;
+    atomicGet(server.aof_bio_fsync_status, aof_bio_fsync_status);
+    if (aof_bio_fsync_status == C_ERR) {
+        serverLog(LL_WARNING,
+            "AOF reopen, just ignore the AOF fsync error in bio job");
+        atomicSet(server.aof_bio_fsync_status,C_OK);
+    }
+
+    /* If AOF was in error state, we just ignore it and log the event. */
+    if (server.aof_last_write_status == C_ERR) {
+        serverLog(LL_WARNING,"AOF reopen, just ignore the last error.");
+        server.aof_last_write_status = C_OK;
+    }
+    return C_OK;
+}
+
+/* This is a wrapper to the write syscall in order to retry on short writes
+ * or if the syscall gets interrupted. It could look strange that we retry
+ * on short writes given that we are writing to a block device: normally if
+ * the first call is short, there is a end-of-space condition, so the next
+ * is likely to fail. However apparently in modern systems this is no longer
+ * true, and in general it looks just more resilient to retry the write. If
+ * there is an actual error condition we'll get it at the next try. */
+ssize_t aofWrite(int fd, const char *buf, size_t len) {
+    ssize_t nwritten = 0, totwritten = 0;
+
+    while(len) {
+        nwritten = write(fd, buf, len);
+
+        if (nwritten < 0) {
+            if (errno == EINTR) continue;
+            return totwritten ? totwritten : -1;
+        }
+
+        len -= nwritten;
+        buf += nwritten;
+        totwritten += nwritten;
+    }
+
+    return totwritten;
+}
+
+/* Write the append only file buffer on disk.
+ *
+ * Since we are required to write the AOF before replying to the client,
+ * and the only way the client socket can get a write is entering when the
+ * the event loop, we accumulate all the AOF writes in a memory
+ * buffer and write it on disk using this function just before entering
+ * the event loop again.
+ *
+ * About the 'force' argument:
+ *
+ * When the fsync policy is set to 'everysec' we may delay the flush if there
+ * is still an fsync() going on in the background thread, since for instance
+ * on Linux write(2) will be blocked by the background fsync anyway.
+ * When this happens we remember that there is some aof buffer to be
+ * flushed ASAP, and will try to do that in the serverCron() function.
+ *
+ * However if force is set to 1 we'll write regardless of the background
+ * fsync. */
+#define AOF_WRITE_LOG_ERROR_RATE 30 /* Seconds between errors logging. */
+void flushAppendOnlyFile(int force) {
+    ssize_t nwritten;
+    int sync_in_progress = 0;
+    mstime_t latency;
+
+    if (sdslen(server.aof_buf) == 0) {
+        /* Check if we need to do fsync even the aof buffer is empty,
+         * because previously in AOF_FSYNC_EVERYSEC mode, fsync is
+         * called only when aof buffer is not empty, so if users
+         * stop write commands before fsync called in one second,
+         * the data in page cache cannot be flushed in time. */
+        if (server.aof_fsync == AOF_FSYNC_EVERYSEC &&
+            server.aof_fsync_offset != server.aof_current_size &&
+            server.unixtime > server.aof_last_fsync &&
+            !(sync_in_progress = aofFsyncInProgress())) {
+            goto try_fsync;
+        } else {
+            return;
+        }
+    }
+
+    if (server.aof_fsync == AOF_FSYNC_EVERYSEC)
+        sync_in_progress = aofFsyncInProgress();
+
+    if (server.aof_fsync == AOF_FSYNC_EVERYSEC && !force) {
+        /* With this append fsync policy we do background fsyncing.
+         * If the fsync is still in progress we can try to delay
+         * the write for a couple of seconds. */
+        if (sync_in_progress) {
+            if (server.aof_flush_postponed_start == 0) {
+                /* No previous write postponing, remember that we are
+                 * postponing the flush and return. */
+                server.aof_flush_postponed_start = server.unixtime;
+                return;
+            } else if (server.unixtime - server.aof_flush_postponed_start < 2) {
+                /* We were already waiting for fsync to finish, but for less
+                 * than two seconds this is still ok. Postpone again. */
+                return;
+            }
+            /* Otherwise fall trough, and go write since we can't wait
+             * over two seconds. */
+            server.aof_delayed_fsync++;
+            serverLog(LL_NOTICE,"Asynchronous AOF fsync is taking too long (disk is busy?). Writing the AOF buffer without waiting for fsync to complete, this may slow down Redis.");
+        }
+    }
+    /* We want to perform a single write. This should be guaranteed atomic
+     * at least if the filesystem we are writing is a real physical one.
+     * While this will save us against the server being killed I don't think
+     * there is much to do about the whole server stopping for power problems
+     * or alike */
+
+    if (server.aof_flush_sleep && sdslen(server.aof_buf)) {
+        usleep(server.aof_flush_sleep);
+    }
+
+    latencyStartMonitor(latency);
+    nwritten = aofWrite(server.aof_fd,server.aof_buf,sdslen(server.aof_buf));
+    latencyEndMonitor(latency);
+    /* We want to capture different events for delayed writes:
+     * when the delay happens with a pending fsync, or with a saving child
+     * active, and when the above two conditions are missing.
+     * We also use an additional event name to save all samples which is
+     * useful for graphing / monitoring purposes. */
+    if (sync_in_progress) {
+        latencyAddSampleIfNeeded("aof-write-pending-fsync",latency);
+    } else if (hasActiveChildProcess()) {
+        latencyAddSampleIfNeeded("aof-write-active-child",latency);
+    } else {
+        latencyAddSampleIfNeeded("aof-write-alone",latency);
+    }
+    latencyAddSampleIfNeeded("aof-write",latency);
+
+    /* We performed the write so reset the postponed flush sentinel to zero. */
+    server.aof_flush_postponed_start = 0;
+
+    if (nwritten != (ssize_t)sdslen(server.aof_buf)) {
+        static time_t last_write_error_log = 0;
+        int can_log = 0;
+
+        /* Limit logging rate to 1 line per AOF_WRITE_LOG_ERROR_RATE seconds. */
+        if ((server.unixtime - last_write_error_log) > AOF_WRITE_LOG_ERROR_RATE) {
+            can_log = 1;
+            last_write_error_log = server.unixtime;
+        }
+
+        /* Log the AOF write error and record the error code. */
+        if (nwritten == -1) {
+            if (can_log) {
+                serverLog(LL_WARNING,"Error writing to the AOF file: %s",
+                    strerror(errno));
+                server.aof_last_write_errno = errno;
+            }
+        } else {
+            if (can_log) {
+                serverLog(LL_WARNING,"Short write while writing to "
+                                       "the AOF file: (nwritten=%lld, "
+                                       "expected=%lld)",
+                                       (long long)nwritten,
+                                       (long long)sdslen(server.aof_buf));
+            }
+
+            if (ftruncate(server.aof_fd, server.aof_current_size) == -1) {
+                if (can_log) {
+                    serverLog(LL_WARNING, "Could not remove short write "
+                             "from the append-only file.  Redis may refuse "
+                             "to load the AOF the next time it starts.  "
+                             "ftruncate: %s", strerror(errno));
+                }
+            } else {
+                /* If the ftruncate() succeeded we can set nwritten to
+                 * -1 since there is no longer partial data into the AOF. */
+                nwritten = -1;
+            }
+            server.aof_last_write_errno = ENOSPC;
+        }
+
+        /* Handle the AOF write error. */
+        if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
+            /* We can't recover when the fsync policy is ALWAYS since the reply
+             * for the client is already in the output buffers (both writes and
+             * reads), and the changes to the db can't be rolled back. Since we
+             * have a contract with the user that on acknowledged or observed
+             * writes are is synced on disk, we must exit. */
+            serverLog(LL_WARNING,"Can't recover from AOF write error when the AOF fsync policy is 'always'. Exiting...");
+            exit(1);
+        } else {
+            /* Recover from failed write leaving data into the buffer. However
+             * set an error to stop accepting writes as long as the error
+             * condition is not cleared. */
+            server.aof_last_write_status = C_ERR;
+
+            /* Trim the sds buffer if there was a partial write, and there
+             * was no way to undo it with ftruncate(2). */
+            if (nwritten > 0) {
+                server.aof_current_size += nwritten;
+                sdsrange(server.aof_buf,nwritten,-1);
+            }
+            return; /* We'll try again on the next call... */
+        }
+    } else {
+        /* Successful write(2). If AOF was in error state, restore the
+         * OK state and log the event. */
+        if (server.aof_last_write_status == C_ERR) {
+            serverLog(LL_WARNING,
+                "AOF write error looks solved, Redis can write again.");
+            server.aof_last_write_status = C_OK;
+        }
+    }
+    server.aof_current_size += nwritten;
+
+    /* Re-use AOF buffer when it is small enough. The maximum comes from the
+     * arena size of 4k minus some overhead (but is otherwise arbitrary). */
+    if ((sdslen(server.aof_buf)+sdsavail(server.aof_buf)) < 4000) {
+        sdsclear(server.aof_buf);
+    } else {
+        sdsfree(server.aof_buf);
+        server.aof_buf = sdsempty();
+    }
+
+try_fsync:
+    /* Don't fsync if no-appendfsync-on-rewrite is set to yes and there are
+     * children doing I/O in the background. */
+    if (server.aof_no_fsync_on_rewrite && hasActiveChildProcess())
+        return;
+
+    /* Perform the fsync if needed. */
+    if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
+        /* redis_fsync is defined as fdatasync() for Linux in order to avoid
+         * flushing metadata. */
+        latencyStartMonitor(latency);
+        /* Let's try to get this data on the disk. To guarantee data safe when
+         * the AOF fsync policy is 'always', we should exit if failed to fsync
+         * AOF (see comment next to the exit(1) after write error above). */
+        if (redis_fsync(server.aof_fd) == -1) {
+            serverLog(LL_WARNING,"Can't persist AOF for fsync error when the "
+              "AOF fsync policy is 'always': %s. Exiting...", strerror(errno));
+            exit(1);
+        }
+        latencyEndMonitor(latency);
+        latencyAddSampleIfNeeded("aof-fsync-always",latency);
+        server.aof_fsync_offset = server.aof_current_size;
+        server.aof_last_fsync = server.unixtime;
+    } else if ((server.aof_fsync == AOF_FSYNC_EVERYSEC &&
+                server.unixtime > server.aof_last_fsync)) {
+        if (!sync_in_progress) {
+            aof_background_fsync(server.aof_fd);
+            server.aof_fsync_offset = server.aof_current_size;
+        }
+        server.aof_last_fsync = server.unixtime;
+    }
+}
+
+sds catAppendOnlyGenericCommand(sds dst, int argc, robj **argv) {
+    char buf[32];
+    int len, j;
+    robj *o;
+
+    buf[0] = '*';
+    len = 1+ll2string(buf+1,sizeof(buf)-1,argc);
+    buf[len++] = '\r';
+    buf[len++] = '\n';
+    dst = sdscatlen(dst,buf,len);
+
+    for (j = 0; j < argc; j++) {
+        o = getDecodedObject(argv[j]);
+        buf[0] = '$';
+        len = 1+ll2string(buf+1,sizeof(buf)-1,sdslen(o->ptr));
+        buf[len++] = '\r';
+        buf[len++] = '\n';
+        dst = sdscatlen(dst,buf,len);
+        dst = sdscatlen(dst,o->ptr,sdslen(o->ptr));
+        dst = sdscatlen(dst,"\r\n",2);
+        decrRefCount(o);
+    }
+    return dst;
+}
+
+/* Create the sds representation of a PEXPIREAT command, using
+ * 'seconds' as time to live and 'cmd' to understand what command
+ * we are translating into a PEXPIREAT.
+ *
+ * This command is used in order to translate EXPIRE and PEXPIRE commands
+ * into PEXPIREAT command so that we retain precision in the append only
+ * file, and the time is always absolute and not relative. */
+sds catAppendOnlyExpireAtCommand(sds buf, struct redisCommand *cmd, robj *key, robj *seconds) {
+    long long when;
+    robj *argv[3];
+
+    /* Make sure we can use strtoll */
+    seconds = getDecodedObject(seconds);
+    when = strtoll(seconds->ptr,NULL,10);
+    /* Convert argument into milliseconds for EXPIRE, SETEX, EXPIREAT */
+    if (cmd->proc == expireCommand || cmd->proc == setexCommand ||
+        cmd->proc == expireatCommand)
+    {
+        when *= 1000;
+    }
+    /* Convert into absolute time for EXPIRE, PEXPIRE, SETEX, PSETEX */
+    if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||
+        cmd->proc == setexCommand || cmd->proc == psetexCommand)
+    {
+        when += mstime();
+    }
+    decrRefCount(seconds);
+
+    argv[0] = shared.pexpireat;
+    argv[1] = key;
+    argv[2] = createStringObjectFromLongLong(when);
+    buf = catAppendOnlyGenericCommand(buf, 3, argv);
+    decrRefCount(argv[2]);
+    return buf;
+}
+
+void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc) {
+    sds buf = sdsempty();
+    /* The DB this command was targeting is not the same as the last command
+     * we appended. To issue a SELECT command is needed. */
+    if (dictid != server.aof_selected_db) {
+        char seldb[64];
+
+        snprintf(seldb,sizeof(seldb),"%d",dictid);
+        buf = sdscatprintf(buf,"*2\r\n$6\r\nSELECT\r\n$%lu\r\n%s\r\n",
+            (unsigned long)strlen(seldb),seldb);
+        server.aof_selected_db = dictid;
+    }
+
+    if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||
+        cmd->proc == expireatCommand) {
+        /* Translate EXPIRE/PEXPIRE/EXPIREAT into PEXPIREAT */
+        buf = catAppendOnlyExpireAtCommand(buf,cmd,argv[1],argv[2]);
+    } else if (cmd->proc == setCommand && argc > 3) {
+        robj *pxarg = NULL;
+        /* When SET is used with EX/PX argument setGenericCommand propagates them with PX millisecond argument.
+         * So since the command arguments are re-written there, we can rely here on the index of PX being 3. */
+        if (!strcasecmp(argv[3]->ptr, "px")) {
+            pxarg = argv[4];
+        }
+        /* For AOF we convert SET key value relative time in milliseconds to SET key value absolute time in
+         * millisecond. Whenever the condition is true it implies that original SET has been transformed
+         * to SET PX with millisecond time argument so we do not need to worry about unit here.*/
+        if (pxarg) {
+            robj *millisecond = getDecodedObject(pxarg);
+            long long when = strtoll(millisecond->ptr,NULL,10);
+            when += mstime();
+
+            decrRefCount(millisecond);
+
+            robj *newargs[5];
+            newargs[0] = argv[0];
+            newargs[1] = argv[1];
+            newargs[2] = argv[2];
+            newargs[3] = shared.pxat;
+            newargs[4] = createStringObjectFromLongLong(when);
+            buf = catAppendOnlyGenericCommand(buf,5,newargs);
+            decrRefCount(newargs[4]);
+        } else {
+            buf = catAppendOnlyGenericCommand(buf,argc,argv);
+        }
+    } else {
+        /* All the other commands don't need translation or need the
+         * same translation already operated in the command vector
+         * for the replication itself. */
+        buf = catAppendOnlyGenericCommand(buf,argc,argv);
+    }
+
+    /* Append to the AOF buffer. This will be flushed on disk just before
+     * of re-entering the event loop, so before the client will get a
+     * positive reply about the operation performed. */
+    if (server.aof_state == AOF_ON)
+        server.aof_buf = sdscatlen(server.aof_buf,buf,sdslen(buf));
+
+    /* If a background append only file rewriting is in progress we want to
+     * accumulate the differences between the child DB and the current one
+     * in a buffer, so that when the child process will do its work we
+     * can append the differences to the new append only file. */
+    if (server.child_type == CHILD_TYPE_AOF)
+        aofRewriteBufferAppend((unsigned char*)buf,sdslen(buf));
+
+    sdsfree(buf);
+}
+
+/* ----------------------------------------------------------------------------
+ * AOF loading
+ * ------------------------------------------------------------------------- */
+
+/* In Redis commands are always executed in the context of a client, so in
+ * order to load the append only file we need to create a fake client. */
+struct client *createAOFClient(void) {
+    struct client *c = zmalloc(sizeof(*c));
+
+    selectDb(c,0);
+    c->id = CLIENT_ID_AOF; /* So modules can identify it's the AOF client. */
+    c->conn = NULL;
+    c->name = NULL;
+    c->querybuf = sdsempty();
+    c->querybuf_peak = 0;
+    c->argc = 0;
+    c->argv = NULL;
+    c->original_argc = 0;
+    c->original_argv = NULL;
+    c->argv_len_sum = 0;
+    c->bufpos = 0;
+
+    /*
+     * The AOF client should never be blocked (unlike master
+     * replication connection).
+     * This is because blocking the AOF client might cause
+     * deadlock (because potentially no one will unblock it).
+     * Also, if the AOF client will be blocked just for
+     * background processing there is a chance that the
+     * command execution order will be violated.
+     */
+    c->flags = CLIENT_DENY_BLOCKING;
+
+    c->btype = BLOCKED_NONE;
+    /* We set the fake client as a slave waiting for the synchronization
+     * so that Redis will not try to send replies to this client. */
+    c->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
+    c->reply = listCreate();
+    c->reply_bytes = 0;
+    c->obuf_soft_limit_reached_time = 0;
+    c->watched_keys = listCreate();
+    c->peerid = NULL;
+    c->sockname = NULL;
+    c->resp = 2;
+    c->user = NULL;
+    listSetFreeMethod(c->reply,freeClientReplyValue);
+    listSetDupMethod(c->reply,dupClientReplyValue);
+    initClientMultiState(c);
+    return c;
+}
+
+void freeFakeClientArgv(struct client *c) {
+    int j;
+
+    for (j = 0; j < c->argc; j++)
+        decrRefCount(c->argv[j]);
+    zfree(c->argv);
+    c->argv_len_sum = 0;
+}
+
+void freeFakeClient(struct client *c) {
+    sdsfree(c->querybuf);
+    listRelease(c->reply);
+    listRelease(c->watched_keys);
+    freeClientMultiState(c);
+    freeClientOriginalArgv(c);
+    zfree(c);
+}
+
+/* Replay the append log file. On success C_OK is returned. On non fatal
+ * error (the append only file is zero-length) C_ERR is returned. On
+ * fatal error an error message is logged and the program exists. */
+int loadAppendOnlyFile(char *filename) {
+    struct client *fakeClient;
+    FILE *fp = fopen(filename,"r");
+    struct redis_stat sb;
+    int old_aof_state = server.aof_state;
+    long loops = 0;
+    off_t valid_up_to = 0; /* Offset of latest well-formed command loaded. */
+    off_t valid_before_multi = 0; /* Offset before MULTI command loaded. */
+
+    if (fp == NULL) {
+        serverLog(LL_WARNING,"Fatal error: can't open the append log file for reading: %s",strerror(errno));
+        exit(1);
+    }
+
+    /* Handle a zero-length AOF file as a special case. An empty AOF file
+     * is a valid AOF because an empty server with AOF enabled will create
+     * a zero length file at startup, that will remain like that if no write
+     * operation is received. */
+    if (fp && redis_fstat(fileno(fp),&sb) != -1 && sb.st_size == 0) {
+        server.aof_current_size = 0;
+        server.aof_fsync_offset = server.aof_current_size;
+        fclose(fp);
+        return C_ERR;
+    }
+
+    /* Temporarily disable AOF, to prevent EXEC from feeding a MULTI
+     * to the same file we're about to read. */
+    server.aof_state = AOF_OFF;
+
+    fakeClient = createAOFClient();
+    startLoadingFile(fp, filename, RDBFLAGS_AOF_PREAMBLE);
+
+    /* Check if this AOF file has an RDB preamble. In that case we need to
+     * load the RDB file and later continue loading the AOF tail. */
+    char sig[5]; /* "REDIS" */
+    if (fread(sig,1,5,fp) != 5 || memcmp(sig,"REDIS",5) != 0) {
+        /* No RDB preamble, seek back at 0 offset. */
+        if (fseek(fp,0,SEEK_SET) == -1) goto readerr;
+    } else {
+        /* RDB preamble. Pass loading the RDB functions. */
+        rio rdb;
+
+        serverLog(LL_NOTICE,"Reading RDB preamble from AOF file...");
+        if (fseek(fp,0,SEEK_SET) == -1) goto readerr;
+        rioInitWithFile(&rdb,fp);
+        if (rdbLoadRio(&rdb,RDBFLAGS_AOF_PREAMBLE,NULL) != C_OK) {
+            serverLog(LL_WARNING,"Error reading the RDB preamble of the AOF file, AOF loading aborted");
+            goto readerr;
+        } else {
+            serverLog(LL_NOTICE,"Reading the remaining AOF tail...");
+        }
+    }
+
+    /* Read the actual AOF file, in REPL format, command by command. */
+    while(1) {
+        int argc, j;
+        unsigned long len;
+        robj **argv;
+        char buf[128];
+        sds argsds;
+        struct redisCommand *cmd;
+
+        /* Serve the clients from time to time */
+        if (!(loops++ % 1000)) {
+            loadingProgress(ftello(fp));
+            processEventsWhileBlocked();
+            processModuleLoadingProgressEvent(1);
+        }
+
+        if (fgets(buf,sizeof(buf),fp) == NULL) {
+            if (feof(fp))
+                break;
+            else
+                goto readerr;
+        }
+        if (buf[0] != '*') goto fmterr;
+        if (buf[1] == '\0') goto readerr;
+        argc = atoi(buf+1);
+        if (argc < 1) goto fmterr;
+
+        /* Load the next command in the AOF as our fake client
+         * argv. */
+        argv = zmalloc(sizeof(robj*)*argc);
+        fakeClient->argc = argc;
+        fakeClient->argv = argv;
+
+        for (j = 0; j < argc; j++) {
+            /* Parse the argument len. */
+            char *readres = fgets(buf,sizeof(buf),fp);
+            if (readres == NULL || buf[0] != '$') {
+                fakeClient->argc = j; /* Free up to j-1. */
+                freeFakeClientArgv(fakeClient);
+                if (readres == NULL)
+                    goto readerr;
+                else
+                    goto fmterr;
+            }
+            len = strtol(buf+1,NULL,10);
+
+            /* Read it into a string object. */
+            argsds = sdsnewlen(SDS_NOINIT,len);
+            if (len && fread(argsds,len,1,fp) == 0) {
+                sdsfree(argsds);
+                fakeClient->argc = j; /* Free up to j-1. */
+                freeFakeClientArgv(fakeClient);
+                goto readerr;
+            }
+            argv[j] = createObject(OBJ_STRING,argsds);
+
+            /* Discard CRLF. */
+            if (fread(buf,2,1,fp) == 0) {
+                fakeClient->argc = j+1; /* Free up to j. */
+                freeFakeClientArgv(fakeClient);
+                goto readerr;
+            }
+        }
+
+        /* Command lookup */
+        cmd = lookupCommand(argv[0]->ptr);
+        if (!cmd) {
+            serverLog(LL_WARNING,
+                "Unknown command '%s' reading the append only file",
+                (char*)argv[0]->ptr);
+            exit(1);
+        }
+
+        if (cmd == server.multiCommand) valid_before_multi = valid_up_to;
+
+        /* Run the command in the context of a fake client */
+        fakeClient->cmd = fakeClient->lastcmd = cmd;
+        if (fakeClient->flags & CLIENT_MULTI &&
+            fakeClient->cmd->proc != execCommand)
+        {
+            queueMultiCommand(fakeClient);
+        } else {
+            cmd->proc(fakeClient);
+        }
+
+        /* The fake client should not have a reply */
+        serverAssert(fakeClient->bufpos == 0 &&
+                     listLength(fakeClient->reply) == 0);
+
+        /* The fake client should never get blocked */
+        serverAssert((fakeClient->flags & CLIENT_BLOCKED) == 0);
+
+        /* Clean up. Command code may have changed argv/argc so we use the
+         * argv/argc of the client instead of the local variables. */
+        freeFakeClientArgv(fakeClient);
+        fakeClient->cmd = NULL;
+        if (server.aof_load_truncated) valid_up_to = ftello(fp);
+        if (server.key_load_delay)
+            debugDelay(server.key_load_delay);
+    }
+
+    /* This point can only be reached when EOF is reached without errors.
+     * If the client is in the middle of a MULTI/EXEC, handle it as it was
+     * a short read, even if technically the protocol is correct: we want
+     * to remove the unprocessed tail and continue. */
+    if (fakeClient->flags & CLIENT_MULTI) {
+        serverLog(LL_WARNING,
+            "Revert incomplete MULTI/EXEC transaction in AOF file");
+        valid_up_to = valid_before_multi;
+        goto uxeof;
+    }
+
+loaded_ok: /* DB loaded, cleanup and return C_OK to the caller. */
+    fclose(fp);
+    freeFakeClient(fakeClient);
+    server.aof_state = old_aof_state;
+    stopLoading(1);
+    aofUpdateCurrentSize();
+    server.aof_rewrite_base_size = server.aof_current_size;
+    server.aof_fsync_offset = server.aof_current_size;
+    return C_OK;
+
+readerr: /* Read error. If feof(fp) is true, fall through to unexpected EOF. */
+    if (!feof(fp)) {
+        if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
+        fclose(fp);
+        serverLog(LL_WARNING,"Unrecoverable error reading the append only file: %s", strerror(errno));
+        exit(1);
+    }
+
+uxeof: /* Unexpected AOF end of file. */
+    if (server.aof_load_truncated) {
+        serverLog(LL_WARNING,"!!! Warning: short read while loading the AOF file !!!");
+        serverLog(LL_WARNING,"!!! Truncating the AOF at offset %llu !!!",
+            (unsigned long long) valid_up_to);
+        if (valid_up_to == -1 || truncate(filename,valid_up_to) == -1) {
+            if (valid_up_to == -1) {
+                serverLog(LL_WARNING,"Last valid command offset is invalid");
+            } else {
+                serverLog(LL_WARNING,"Error truncating the AOF file: %s",
+                    strerror(errno));
+            }
+        } else {
+            /* Make sure the AOF file descriptor points to the end of the
+             * file after the truncate call. */
+            if (server.aof_fd != -1 && lseek(server.aof_fd,0,SEEK_END) == -1) {
+                serverLog(LL_WARNING,"Can't seek the end of the AOF file: %s",
+                    strerror(errno));
+            } else {
+                serverLog(LL_WARNING,
+                    "AOF loaded anyway because aof-load-truncated is enabled");
+                goto loaded_ok;
+            }
+        }
+    }
+    if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
+    fclose(fp);
+    serverLog(LL_WARNING,"Unexpected end of file reading the append only file. You can: 1) Make a backup of your AOF file, then use ./redis-check-aof --fix <filename>. 2) Alternatively you can set the 'aof-load-truncated' configuration option to yes and restart the server.");
+    exit(1);
+
+fmterr: /* Format error. */
+    if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
+    fclose(fp);
+    serverLog(LL_WARNING,"Bad file format reading the append only file: make a backup of your AOF file, then use ./redis-check-aof --fix <filename>");
+    exit(1);
+}
+
+/* ----------------------------------------------------------------------------
+ * AOF rewrite
+ * ------------------------------------------------------------------------- */
+
+/* Delegate writing an object to writing a bulk string or bulk long long.
+ * This is not placed in rio.c since that adds the server.h dependency. */
+int rioWriteBulkObject(rio *r, robj *obj) {
+    /* Avoid using getDecodedObject to help copy-on-write (we are often
+     * in a child process when this function is called). */
+    if (obj->encoding == OBJ_ENCODING_INT) {
+        return rioWriteBulkLongLong(r,(long)obj->ptr);
+    } else if (sdsEncodedObject(obj)) {
+        return rioWriteBulkString(r,obj->ptr,sdslen(obj->ptr));
+    } else {
+        serverPanic("Unknown string encoding");
+    }
+}
+
+/* Emit the commands needed to rebuild a list object.
+ * The function returns 0 on error, 1 on success. */
+int rewriteListObject(rio *r, robj *key, robj *o) {
+    long long count = 0, items = listTypeLength(o);
+
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklist *list = o->ptr;
+        quicklistIter *li = quicklistGetIterator(list, AL_START_HEAD);
+        quicklistEntry entry;
+
+        while (quicklistNext(li,&entry)) {
+            if (count == 0) {
+                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                    AOF_REWRITE_ITEMS_PER_CMD : items;
+                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
+                    !rioWriteBulkString(r,"RPUSH",5) ||
+                    !rioWriteBulkObject(r,key)) 
+                {
+                    quicklistReleaseIterator(li);
+                    return 0;
+                }
+            }
+
+            if (entry.value) {
+                if (!rioWriteBulkString(r,(char*)entry.value,entry.sz)) {
+                    quicklistReleaseIterator(li);
+                    return 0;
+                }
+            } else {
+                if (!rioWriteBulkLongLong(r,entry.longval)) {
+                    quicklistReleaseIterator(li);
+                    return 0;
+                }
+            }
+            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+            items--;
+        }
+        quicklistReleaseIterator(li);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+    return 1;
+}
+
+/* Emit the commands needed to rebuild a set object.
+ * The function returns 0 on error, 1 on success. */
+int rewriteSetObject(rio *r, robj *key, robj *o) {
+    long long count = 0, items = setTypeSize(o);
+
+    if (o->encoding == OBJ_ENCODING_INTSET) {
+        int ii = 0;
+        int64_t llval;
+
+        while(intsetGet(o->ptr,ii++,&llval)) {
+            if (count == 0) {
+                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                    AOF_REWRITE_ITEMS_PER_CMD : items;
+
+                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
+                    !rioWriteBulkString(r,"SADD",4) ||
+                    !rioWriteBulkObject(r,key)) 
+                {
+                    return 0;
+                }
+            }
+            if (!rioWriteBulkLongLong(r,llval)) return 0;
+            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+            items--;
+        }
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        dictIterator *di = dictGetIterator(o->ptr);
+        dictEntry *de;
+
+        while((de = dictNext(di)) != NULL) {
+            sds ele = dictGetKey(de);
+            if (count == 0) {
+                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                    AOF_REWRITE_ITEMS_PER_CMD : items;
+
+                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
+                    !rioWriteBulkString(r,"SADD",4) ||
+                    !rioWriteBulkObject(r,key)) 
+                {
+                    dictReleaseIterator(di);
+                    return 0;
+                }
+            }
+            if (!rioWriteBulkString(r,ele,sdslen(ele))) {
+                dictReleaseIterator(di);
+                return 0;          
+            }
+            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+            items--;
+        }
+        dictReleaseIterator(di);
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return 1;
+}
+
+/* Emit the commands needed to rebuild a sorted set object.
+ * The function returns 0 on error, 1 on success. */
+int rewriteSortedSetObject(rio *r, robj *key, robj *o) {
+    long long count = 0, items = zsetLength(o);
+
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = o->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vll;
+        double score;
+
+        eptr = ziplistIndex(zl,0);
+        serverAssert(eptr != NULL);
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+
+        while (eptr != NULL) {
+            serverAssert(ziplistGet(eptr,&vstr,&vlen,&vll));
+            score = zzlGetScore(sptr);
+
+            if (count == 0) {
+                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                    AOF_REWRITE_ITEMS_PER_CMD : items;
+
+                if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
+                    !rioWriteBulkString(r,"ZADD",4) ||
+                    !rioWriteBulkObject(r,key)) 
+                {
+                    return 0;
+                }
+            }
+            if (!rioWriteBulkDouble(r,score)) return 0;
+            if (vstr != NULL) {
+                if (!rioWriteBulkString(r,(char*)vstr,vlen)) return 0;
+            } else {
+                if (!rioWriteBulkLongLong(r,vll)) return 0;
+            }
+            zzlNext(zl,&eptr,&sptr);
+            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+            items--;
+        }
+    } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = o->ptr;
+        dictIterator *di = dictGetIterator(zs->dict);
+        dictEntry *de;
+
+        while((de = dictNext(di)) != NULL) {
+            sds ele = dictGetKey(de);
+            double *score = dictGetVal(de);
+
+            if (count == 0) {
+                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                    AOF_REWRITE_ITEMS_PER_CMD : items;
+
+                if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
+                    !rioWriteBulkString(r,"ZADD",4) ||
+                    !rioWriteBulkObject(r,key)) 
+                {
+                    dictReleaseIterator(di);
+                    return 0;
+                }
+            }
+            if (!rioWriteBulkDouble(r,*score) ||
+                !rioWriteBulkString(r,ele,sdslen(ele)))
+            {
+                dictReleaseIterator(di);
+                return 0;
+            }
+            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+            items--;
+        }
+        dictReleaseIterator(di);
+    } else {
+        serverPanic("Unknown sorted zset encoding");
+    }
+    return 1;
+}
+
+/* Write either the key or the value of the currently selected item of a hash.
+ * The 'hi' argument passes a valid Redis hash iterator.
+ * The 'what' filed specifies if to write a key or a value and can be
+ * either OBJ_HASH_KEY or OBJ_HASH_VALUE.
+ *
+ * The function returns 0 on error, non-zero on success. */
+static int rioWriteHashIteratorCursor(rio *r, hashTypeIterator *hi, int what) {
+    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *vstr = NULL;
+        unsigned int vlen = UINT_MAX;
+        long long vll = LLONG_MAX;
+
+        hashTypeCurrentFromZiplist(hi, what, &vstr, &vlen, &vll);
+        if (vstr)
+            return rioWriteBulkString(r, (char*)vstr, vlen);
+        else
+            return rioWriteBulkLongLong(r, vll);
+    } else if (hi->encoding == OBJ_ENCODING_HT) {
+        sds value = hashTypeCurrentFromHashTable(hi, what);
+        return rioWriteBulkString(r, value, sdslen(value));
+    }
+
+    serverPanic("Unknown hash encoding");
+    return 0;
+}
+
+/* Emit the commands needed to rebuild a hash object.
+ * The function returns 0 on error, 1 on success. */
+int rewriteHashObject(rio *r, robj *key, robj *o) {
+    hashTypeIterator *hi;
+    long long count = 0, items = hashTypeLength(o);
+
+    hi = hashTypeInitIterator(o);
+    while (hashTypeNext(hi) != C_ERR) {
+        if (count == 0) {
+            int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
+                AOF_REWRITE_ITEMS_PER_CMD : items;
+
+            if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
+                !rioWriteBulkString(r,"HMSET",5) ||
+                !rioWriteBulkObject(r,key)) 
+            {
+                hashTypeReleaseIterator(hi);
+                return 0;
+            }
+        }
+
+        if (!rioWriteHashIteratorCursor(r, hi, OBJ_HASH_KEY) ||
+            !rioWriteHashIteratorCursor(r, hi, OBJ_HASH_VALUE))
+        {
+            hashTypeReleaseIterator(hi);
+            return 0;           
+        }
+        if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
+        items--;
+    }
+
+    hashTypeReleaseIterator(hi);
+
+    return 1;
+}
+
+/* Helper for rewriteStreamObject() that generates a bulk string into the
+ * AOF representing the ID 'id'. */
+int rioWriteBulkStreamID(rio *r,streamID *id) {
+    int retval;
+
+    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
+    retval = rioWriteBulkString(r,replyid,sdslen(replyid));
+    sdsfree(replyid);
+    return retval;
+}
+
+/* Helper for rewriteStreamObject(): emit the XCLAIM needed in order to
+ * add the message described by 'nack' having the id 'rawid', into the pending
+ * list of the specified consumer. All this in the context of the specified
+ * key and group. */
+int rioWriteStreamPendingEntry(rio *r, robj *key, const char *groupname, size_t groupname_len, streamConsumer *consumer, unsigned char *rawid, streamNACK *nack) {
+     /* XCLAIM <key> <group> <consumer> 0 <id> TIME <milliseconds-unix-time>
+               RETRYCOUNT <count> JUSTID FORCE. */
+    streamID id;
+    streamDecodeID(rawid,&id);
+    if (rioWriteBulkCount(r,'*',12) == 0) return 0;
+    if (rioWriteBulkString(r,"XCLAIM",6) == 0) return 0;
+    if (rioWriteBulkObject(r,key) == 0) return 0;
+    if (rioWriteBulkString(r,groupname,groupname_len) == 0) return 0;
+    if (rioWriteBulkString(r,consumer->name,sdslen(consumer->name)) == 0) return 0;
+    if (rioWriteBulkString(r,"0",1) == 0) return 0;
+    if (rioWriteBulkStreamID(r,&id) == 0) return 0;
+    if (rioWriteBulkString(r,"TIME",4) == 0) return 0;
+    if (rioWriteBulkLongLong(r,nack->delivery_time) == 0) return 0;
+    if (rioWriteBulkString(r,"RETRYCOUNT",10) == 0) return 0;
+    if (rioWriteBulkLongLong(r,nack->delivery_count) == 0) return 0;
+    if (rioWriteBulkString(r,"JUSTID",6) == 0) return 0;
+    if (rioWriteBulkString(r,"FORCE",5) == 0) return 0;
+    return 1;
+}
+
+/* Helper for rewriteStreamObject(): emit the XGROUP CREATECONSUMER is
+ * needed in order to create consumers that do not have any pending entries.
+ * All this in the context of the specified key and group. */
+int rioWriteStreamEmptyConsumer(rio *r, robj *key, const char *groupname, size_t groupname_len, streamConsumer *consumer) {
+    /* XGROUP CREATECONSUMER <key> <group> <consumer> */
+    if (rioWriteBulkCount(r,'*',5) == 0) return 0;
+    if (rioWriteBulkString(r,"XGROUP",6) == 0) return 0;
+    if (rioWriteBulkString(r,"CREATECONSUMER",14) == 0) return 0;
+    if (rioWriteBulkObject(r,key) == 0) return 0;
+    if (rioWriteBulkString(r,groupname,groupname_len) == 0) return 0;
+    if (rioWriteBulkString(r,consumer->name,sdslen(consumer->name)) == 0) return 0;
+    return 1;
+}
+
+/* Emit the commands needed to rebuild a stream object.
+ * The function returns 0 on error, 1 on success. */
+int rewriteStreamObject(rio *r, robj *key, robj *o) {
+    stream *s = o->ptr;
+    streamIterator si;
+    streamIteratorStart(&si,s,NULL,NULL,0);
+    streamID id;
+    int64_t numfields;
+
+    if (s->length) {
+        /* Reconstruct the stream data using XADD commands. */
+        while(streamIteratorGetID(&si,&id,&numfields)) {
+            /* Emit a two elements array for each item. The first is
+             * the ID, the second is an array of field-value pairs. */
+
+            /* Emit the XADD <key> <id> ...fields... command. */
+            if (!rioWriteBulkCount(r,'*',3+numfields*2) || 
+                !rioWriteBulkString(r,"XADD",4) ||
+                !rioWriteBulkObject(r,key) ||
+                !rioWriteBulkStreamID(r,&id)) 
+            {
+                streamIteratorStop(&si);
+                return 0;
+            }
+            while(numfields--) {
+                unsigned char *field, *value;
+                int64_t field_len, value_len;
+                streamIteratorGetField(&si,&field,&value,&field_len,&value_len);
+                if (!rioWriteBulkString(r,(char*)field,field_len) ||
+                    !rioWriteBulkString(r,(char*)value,value_len)) 
+                {
+                    streamIteratorStop(&si);
+                    return 0;                  
+                }
+            }
+        }
+    } else {
+        /* Use the XADD MAXLEN 0 trick to generate an empty stream if
+         * the key we are serializing is an empty string, which is possible
+         * for the Stream type. */
+        id.ms = 0; id.seq = 1; 
+        if (!rioWriteBulkCount(r,'*',7) ||
+            !rioWriteBulkString(r,"XADD",4) ||
+            !rioWriteBulkObject(r,key) ||
+            !rioWriteBulkString(r,"MAXLEN",6) ||
+            !rioWriteBulkString(r,"0",1) ||
+            !rioWriteBulkStreamID(r,&id) ||
+            !rioWriteBulkString(r,"x",1) ||
+            !rioWriteBulkString(r,"y",1))
+        {
+            streamIteratorStop(&si);
+            return 0;     
+        }
+    }
+
+    /* Append XSETID after XADD, make sure lastid is correct,
+     * in case of XDEL lastid. */
+    if (!rioWriteBulkCount(r,'*',3) ||
+        !rioWriteBulkString(r,"XSETID",6) ||
+        !rioWriteBulkObject(r,key) ||
+        !rioWriteBulkStreamID(r,&s->last_id)) 
+    {
+        streamIteratorStop(&si);
+        return 0; 
+    }
+
+
+    /* Create all the stream consumer groups. */
+    if (s->cgroups) {
+        raxIterator ri;
+        raxStart(&ri,s->cgroups);
+        raxSeek(&ri,"^",NULL,0);
+        while(raxNext(&ri)) {
+            streamCG *group = ri.data;
+            /* Emit the XGROUP CREATE in order to create the group. */
+            if (!rioWriteBulkCount(r,'*',5) ||
+                !rioWriteBulkString(r,"XGROUP",6) ||
+                !rioWriteBulkString(r,"CREATE",6) ||
+                !rioWriteBulkObject(r,key) ||
+                !rioWriteBulkString(r,(char*)ri.key,ri.key_len) ||
+                !rioWriteBulkStreamID(r,&group->last_id)) 
+            {
+                raxStop(&ri);
+                streamIteratorStop(&si);
+                return 0;
+            }
+
+            /* Generate XCLAIMs for each consumer that happens to
+             * have pending entries. Empty consumers would be generated with
+             * XGROUP CREATECONSUMER. */
+            raxIterator ri_cons;
+            raxStart(&ri_cons,group->consumers);
+            raxSeek(&ri_cons,"^",NULL,0);
+            while(raxNext(&ri_cons)) {
+                streamConsumer *consumer = ri_cons.data;
+                /* If there are no pending entries, just emit XGROUP CREATECONSUMER */
+                if (raxSize(consumer->pel) == 0) {
+                    if (rioWriteStreamEmptyConsumer(r,key,(char*)ri.key,
+                                                    ri.key_len,consumer) == 0)
+                    {
+                        raxStop(&ri_cons);
+                        raxStop(&ri);
+                        streamIteratorStop(&si);
+                        return 0;
+                    }
+                    continue;
+                }
+                /* For the current consumer, iterate all the PEL entries
+                 * to emit the XCLAIM protocol. */
+                raxIterator ri_pel;
+                raxStart(&ri_pel,consumer->pel);
+                raxSeek(&ri_pel,"^",NULL,0);
+                while(raxNext(&ri_pel)) {
+                    streamNACK *nack = ri_pel.data;
+                    if (rioWriteStreamPendingEntry(r,key,(char*)ri.key,
+                                                   ri.key_len,consumer,
+                                                   ri_pel.key,nack) == 0)
+                    {
+                        raxStop(&ri_pel);
+                        raxStop(&ri_cons);
+                        raxStop(&ri);
+                        streamIteratorStop(&si);
+                        return 0;
+                    }
+                }
+                raxStop(&ri_pel);
+            }
+            raxStop(&ri_cons);
+        }
+        raxStop(&ri);
+    }
+
+    streamIteratorStop(&si);
+    return 1;
+}
+
+/* Call the module type callback in order to rewrite a data type
+ * that is exported by a module and is not handled by Redis itself.
+ * The function returns 0 on error, 1 on success. */
+int rewriteModuleObject(rio *r, robj *key, robj *o) {
+    RedisModuleIO io;
+    moduleValue *mv = o->ptr;
+    moduleType *mt = mv->type;
+    moduleInitIOContext(io,mt,r,key);
+    mt->aof_rewrite(&io,key,mv->value);
+    if (io.ctx) {
+        moduleFreeContext(io.ctx);
+        zfree(io.ctx);
+    }
+    return io.error ? 0 : 1;
+}
+
+/* This function is called by the child rewriting the AOF file to read
+ * the difference accumulated from the parent into a buffer, that is
+ * concatenated at the end of the rewrite. */
+ssize_t aofReadDiffFromParent(void) {
+    char buf[65536]; /* Default pipe buffer size on most Linux systems. */
+    ssize_t nread, total = 0;
+
+    while ((nread =
+            read(server.aof_pipe_read_data_from_parent,buf,sizeof(buf))) > 0) {
+        server.aof_child_diff = sdscatlen(server.aof_child_diff,buf,nread);
+        total += nread;
+    }
+    return total;
+}
+
+int rewriteAppendOnlyFileRio(rio *aof) {
+    dictIterator *di = NULL;
+    dictEntry *de;
+    size_t processed = 0;
+    int j;
+    long key_count = 0;
+    long long updated_time = 0;
+
+    for (j = 0; j < server.dbnum; j++) {
+        char selectcmd[] = "*2\r\n$6\r\nSELECT\r\n";
+        redisDb *db = server.db+j;
+        dict *d = db->dict;
+        if (dictSize(d) == 0) continue;
+        di = dictGetSafeIterator(d);
+
+        /* SELECT the new DB */
+        if (rioWrite(aof,selectcmd,sizeof(selectcmd)-1) == 0) goto werr;
+        if (rioWriteBulkLongLong(aof,j) == 0) goto werr;
+
+        /* Iterate this DB writing every entry */
+        while((de = dictNext(di)) != NULL) {
+            sds keystr;
+            robj key, *o;
+            long long expiretime;
+
+            keystr = dictGetKey(de);
+            o = dictGetVal(de);
+            initStaticStringObject(key,keystr);
+
+            expiretime = getExpire(db,&key);
+
+            /* Save the key and associated value */
+            if (o->type == OBJ_STRING) {
+                /* Emit a SET command */
+                char cmd[]="*3\r\n$3\r\nSET\r\n";
+                if (rioWrite(aof,cmd,sizeof(cmd)-1) == 0) goto werr;
+                /* Key and value */
+                if (rioWriteBulkObject(aof,&key) == 0) goto werr;
+                if (rioWriteBulkObject(aof,o) == 0) goto werr;
+            } else if (o->type == OBJ_LIST) {
+                if (rewriteListObject(aof,&key,o) == 0) goto werr;
+            } else if (o->type == OBJ_SET) {
+                if (rewriteSetObject(aof,&key,o) == 0) goto werr;
+            } else if (o->type == OBJ_ZSET) {
+                if (rewriteSortedSetObject(aof,&key,o) == 0) goto werr;
+            } else if (o->type == OBJ_HASH) {
+                if (rewriteHashObject(aof,&key,o) == 0) goto werr;
+            } else if (o->type == OBJ_STREAM) {
+                if (rewriteStreamObject(aof,&key,o) == 0) goto werr;
+            } else if (o->type == OBJ_MODULE) {
+                if (rewriteModuleObject(aof,&key,o) == 0) goto werr;
+            } else {
+                serverPanic("Unknown object type");
+            }
+            /* Save the expire time */
+            if (expiretime != -1) {
+                char cmd[]="*3\r\n$9\r\nPEXPIREAT\r\n";
+                if (rioWrite(aof,cmd,sizeof(cmd)-1) == 0) goto werr;
+                if (rioWriteBulkObject(aof,&key) == 0) goto werr;
+                if (rioWriteBulkLongLong(aof,expiretime) == 0) goto werr;
+            }
+            /* Read some diff from the parent process from time to time. */
+            if (aof->processed_bytes > processed+AOF_READ_DIFF_INTERVAL_BYTES) {
+                processed = aof->processed_bytes;
+                aofReadDiffFromParent();
+            }
+
+            /* Update info every 1 second (approximately).
+             * in order to avoid calling mstime() on each iteration, we will
+             * check the diff every 1024 keys */
+            if ((key_count++ & 1023) == 0) {
+                long long now = mstime();
+                if (now - updated_time >= 1000) {
+                    sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, "AOF rewrite");
+                    updated_time = now;
+                }
+            }
+        }
+        dictReleaseIterator(di);
+        di = NULL;
+    }
+    return C_OK;
+
+werr:
+    if (di) dictReleaseIterator(di);
+    return C_ERR;
+}
+
+/* Write a sequence of commands able to fully rebuild the dataset into
+ * "filename". Used both by REWRITEAOF and BGREWRITEAOF.
+ *
+ * In order to minimize the number of commands needed in the rewritten
+ * log Redis uses variadic commands when possible, such as RPUSH, SADD
+ * and ZADD. However at max AOF_REWRITE_ITEMS_PER_CMD items per time
+ * are inserted using a single command. */
+int rewriteAppendOnlyFile(char *filename) {
+    rio aof;
+    FILE *fp = NULL;
+    char tmpfile[256];
+    char byte;
+
+    /* Note that we have to use a different temp name here compared to the
+     * one used by rewriteAppendOnlyFileBackground() function. */
+    snprintf(tmpfile,256,"temp-rewriteaof-%d.aof", (int) getpid());
+    fp = fopen(tmpfile,"w");
+    if (!fp) {
+        serverLog(LL_WARNING, "Opening the temp file for AOF rewrite in rewriteAppendOnlyFile(): %s", strerror(errno));
+        return C_ERR;
+    }
+
+    server.aof_child_diff = sdsempty();
+    rioInitWithFile(&aof,fp);
+
+    if (server.aof_rewrite_incremental_fsync)
+        rioSetAutoSync(&aof,REDIS_AUTOSYNC_BYTES);
+
+    startSaving(RDBFLAGS_AOF_PREAMBLE);
+
+    if (server.aof_use_rdb_preamble) {
+        int error;
+        if (rdbSaveRio(&aof,&error,RDBFLAGS_AOF_PREAMBLE,NULL) == C_ERR) {
+            errno = error;
+            goto werr;
+        }
+    } else {
+        if (rewriteAppendOnlyFileRio(&aof) == C_ERR) goto werr;
+    }
+
+    /* Do an initial slow fsync here while the parent is still sending
+     * data, in order to make the next final fsync faster. */
+    if (fflush(fp) == EOF) goto werr;
+    if (fsync(fileno(fp)) == -1) goto werr;
+
+    /* Read again a few times to get more data from the parent.
+     * We can't read forever (the server may receive data from clients
+     * faster than it is able to send data to the child), so we try to read
+     * some more data in a loop as soon as there is a good chance more data
+     * will come. If it looks like we are wasting time, we abort (this
+     * happens after 20 ms without new data). */
+    int nodata = 0;
+    mstime_t start = mstime();
+    while(mstime()-start < 1000 && nodata < 20) {
+        if (aeWait(server.aof_pipe_read_data_from_parent, AE_READABLE, 1) <= 0)
+        {
+            nodata++;
+            continue;
+        }
+        nodata = 0; /* Start counting from zero, we stop on N *contiguous*
+                       timeouts. */
+        aofReadDiffFromParent();
+    }
+
+    /* Ask the master to stop sending diffs. */
+    if (write(server.aof_pipe_write_ack_to_parent,"!",1) != 1) goto werr;
+    if (anetNonBlock(NULL,server.aof_pipe_read_ack_from_parent) != ANET_OK)
+        goto werr;
+    /* We read the ACK from the server using a 5 seconds timeout. Normally
+     * it should reply ASAP, but just in case we lose its reply, we are sure
+     * the child will eventually get terminated. */
+    if (syncRead(server.aof_pipe_read_ack_from_parent,&byte,1,5000) != 1 ||
+        byte != '!') goto werr;
+    serverLog(LL_NOTICE,"Parent agreed to stop sending diffs. Finalizing AOF...");
+
+    /* Read the final diff if any. */
+    aofReadDiffFromParent();
+
+    /* Write the received diff to the file. */
+    serverLog(LL_NOTICE,
+        "Concatenating %.2f MB of AOF diff received from parent.",
+        (double) sdslen(server.aof_child_diff) / (1024*1024));
+
+    /* Now we write the entire AOF buffer we received from the parent
+     * via the pipe during the life of this fork child.
+     * once a second, we'll take a break and send updated COW info to the parent */
+    size_t bytes_to_write = sdslen(server.aof_child_diff);
+    const char *buf = server.aof_child_diff;
+    long long cow_updated_time = mstime();
+    long long key_count = dbTotalServerKeyCount();
+    while (bytes_to_write) {
+        /* We write the AOF buffer in chunk of 8MB so that we can check the time in between them */
+        size_t chunk_size = bytes_to_write < (8<<20) ? bytes_to_write : (8<<20);
+
+        if (rioWrite(&aof,buf,chunk_size) == 0)
+            goto werr;
+
+        bytes_to_write -= chunk_size;
+        buf += chunk_size;
+
+        /* Update COW info */
+        long long now = mstime();
+        if (now - cow_updated_time >= 1000) {
+            sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, "AOF rewrite");
+            cow_updated_time = now;
+        }
+    }
+
+    /* Make sure data will not remain on the OS's output buffers */
+    if (fflush(fp)) goto werr;
+    if (fsync(fileno(fp))) goto werr;
+    if (fclose(fp)) { fp = NULL; goto werr; }
+    fp = NULL;
+
+    /* Use RENAME to make sure the DB file is changed atomically only
+     * if the generate DB file is ok. */
+    if (rename(tmpfile,filename) == -1) {
+        serverLog(LL_WARNING,"Error moving temp append only file on the final destination: %s", strerror(errno));
+        unlink(tmpfile);
+        stopSaving(0);
+        return C_ERR;
+    }
+    serverLog(LL_NOTICE,"SYNC append only file rewrite performed");
+    stopSaving(1);
+    return C_OK;
+
+werr:
+    serverLog(LL_WARNING,"Write error writing append only file on disk: %s", strerror(errno));
+    if (fp) fclose(fp);
+    unlink(tmpfile);
+    stopSaving(0);
+    return C_ERR;
+}
+
+/* ----------------------------------------------------------------------------
+ * AOF rewrite pipes for IPC
+ * -------------------------------------------------------------------------- */
+
+/* This event handler is called when the AOF rewriting child sends us a
+ * single '!' char to signal we should stop sending buffer diffs. The
+ * parent sends a '!' as well to acknowledge. */
+void aofChildPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask) {
+    char byte;
+    UNUSED(el);
+    UNUSED(privdata);
+    UNUSED(mask);
+
+    if (read(fd,&byte,1) == 1 && byte == '!') {
+        serverLog(LL_NOTICE,"AOF rewrite child asks to stop sending diffs.");
+        server.aof_stop_sending_diff = 1;
+        if (write(server.aof_pipe_write_ack_to_child,"!",1) != 1) {
+            /* If we can't send the ack, inform the user, but don't try again
+             * since in the other side the children will use a timeout if the
+             * kernel can't buffer our write, or, the children was
+             * terminated. */
+            serverLog(LL_WARNING,"Can't send ACK to AOF child: %s",
+                strerror(errno));
+        }
+    }
+    /* Remove the handler since this can be called only one time during a
+     * rewrite. */
+    aeDeleteFileEvent(server.el,server.aof_pipe_read_ack_from_child,AE_READABLE);
+}
+
+/* Create the pipes used for parent - child process IPC during rewrite.
+ * We have a data pipe used to send AOF incremental diffs to the child,
+ * and two other pipes used by the children to signal it finished with
+ * the rewrite so no more data should be written, and another for the
+ * parent to acknowledge it understood this new condition. */
+int aofCreatePipes(void) {
+    int fds[6] = {-1, -1, -1, -1, -1, -1};
+    int j;
+
+    if (pipe(fds) == -1) goto error; /* parent -> children data. */
+    if (pipe(fds+2) == -1) goto error; /* children -> parent ack. */
+    if (pipe(fds+4) == -1) goto error; /* parent -> children ack. */
+    /* Parent -> children data is non blocking. */
+    if (anetNonBlock(NULL,fds[0]) != ANET_OK) goto error;
+    if (anetNonBlock(NULL,fds[1]) != ANET_OK) goto error;
+    if (aeCreateFileEvent(server.el, fds[2], AE_READABLE, aofChildPipeReadable, NULL) == AE_ERR) goto error;
+
+    server.aof_pipe_write_data_to_child = fds[1];
+    server.aof_pipe_read_data_from_parent = fds[0];
+    server.aof_pipe_write_ack_to_parent = fds[3];
+    server.aof_pipe_read_ack_from_child = fds[2];
+    server.aof_pipe_write_ack_to_child = fds[5];
+    server.aof_pipe_read_ack_from_parent = fds[4];
+    server.aof_stop_sending_diff = 0;
+    return C_OK;
+
+error:
+    serverLog(LL_WARNING,"Error opening /setting AOF rewrite IPC pipes: %s",
+        strerror(errno));
+    for (j = 0; j < 6; j++) if(fds[j] != -1) close(fds[j]);
+    return C_ERR;
+}
+
+void aofClosePipes(void) {
+    aeDeleteFileEvent(server.el,server.aof_pipe_read_ack_from_child,AE_READABLE);
+    aeDeleteFileEvent(server.el,server.aof_pipe_write_data_to_child,AE_WRITABLE);
+    close(server.aof_pipe_write_data_to_child);
+    close(server.aof_pipe_read_data_from_parent);
+    close(server.aof_pipe_write_ack_to_parent);
+    close(server.aof_pipe_read_ack_from_child);
+    close(server.aof_pipe_write_ack_to_child);
+    close(server.aof_pipe_read_ack_from_parent);
+}
+
+/* ----------------------------------------------------------------------------
+ * AOF background rewrite
+ * ------------------------------------------------------------------------- */
+
+/* This is how rewriting of the append only file in background works:
+ *
+ * 1) The user calls BGREWRITEAOF
+ * 2) Redis calls this function, that forks():
+ *    2a) the child rewrite the append only file in a temp file.
+ *    2b) the parent accumulates differences in server.aof_rewrite_buf.
+ * 3) When the child finished '2a' exists.
+ * 4) The parent will trap the exit code, if it's OK, will append the
+ *    data accumulated into server.aof_rewrite_buf into the temp file, and
+ *    finally will rename(2) the temp file in the actual file name.
+ *    The the new file is reopened as the new append only file. Profit!
+ */
+int rewriteAppendOnlyFileBackground(void) {
+    pid_t childpid;
+
+    if (hasActiveChildProcess()) return C_ERR;
+    if (aofCreatePipes() != C_OK) return C_ERR;
+    if ((childpid = redisFork(CHILD_TYPE_AOF)) == 0) {
+        char tmpfile[256];
+
+        /* Child */
+        redisSetProcTitle("redis-aof-rewrite");
+        redisSetCpuAffinity(server.aof_rewrite_cpulist);
+        snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) getpid());
+        if (rewriteAppendOnlyFile(tmpfile) == C_OK) {
+            sendChildCowInfo(CHILD_INFO_TYPE_AOF_COW_SIZE, "AOF rewrite");
+            exitFromChild(0);
+        } else {
+            exitFromChild(1);
+        }
+    } else {
+        /* Parent */
+        if (childpid == -1) {
+            serverLog(LL_WARNING,
+                "Can't rewrite append only file in background: fork: %s",
+                strerror(errno));
+            aofClosePipes();
+            return C_ERR;
+        }
+        serverLog(LL_NOTICE,
+            "Background append only file rewriting started by pid %ld",(long) childpid);
+        server.aof_rewrite_scheduled = 0;
+        server.aof_rewrite_time_start = time(NULL);
+
+        /* We set appendseldb to -1 in order to force the next call to the
+         * feedAppendOnlyFile() to issue a SELECT command, so the differences
+         * accumulated by the parent into server.aof_rewrite_buf will start
+         * with a SELECT statement and it will be safe to merge. */
+        server.aof_selected_db = -1;
+        replicationScriptCacheFlush();
+        return C_OK;
+    }
+    return C_OK; /* unreached */
+}
+
+void bgrewriteaofCommand(client *c) {
+    if (server.child_type == CHILD_TYPE_AOF) {
+        addReplyError(c,"Background append only file rewriting already in progress");
+    } else if (hasActiveChildProcess()) {
+        server.aof_rewrite_scheduled = 1;
+        addReplyStatus(c,"Background append only file rewriting scheduled");
+    } else if (rewriteAppendOnlyFileBackground() == C_OK) {
+        addReplyStatus(c,"Background append only file rewriting started");
+    } else {
+        addReplyError(c,"Can't execute an AOF background rewriting. "
+                        "Please check the server logs for more information.");
+    }
+}
+
+void aofRemoveTempFile(pid_t childpid) {
+    char tmpfile[256];
+
+    snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) childpid);
+    bg_unlink(tmpfile);
+
+    snprintf(tmpfile,256,"temp-rewriteaof-%d.aof", (int) childpid);
+    bg_unlink(tmpfile);
+}
+
+/* Update the server.aof_current_size field explicitly using stat(2)
+ * to check the size of the file. This is useful after a rewrite or after
+ * a restart, normally the size is updated just adding the write length
+ * to the current length, that is much faster. */
+void aofUpdateCurrentSize(void) {
+    struct redis_stat sb;
+    mstime_t latency;
+
+    latencyStartMonitor(latency);
+    if (redis_fstat(server.aof_fd,&sb) == -1) {
+        serverLog(LL_WARNING,"Unable to obtain the AOF file length. stat: %s",
+            strerror(errno));
+    } else {
+        server.aof_current_size = sb.st_size;
+    }
+    latencyEndMonitor(latency);
+    latencyAddSampleIfNeeded("aof-fstat",latency);
+}
+
+/* A background append only file rewriting (BGREWRITEAOF) terminated its work.
+ * Handle this. */
+void backgroundRewriteDoneHandler(int exitcode, int bysignal) {
+    if (!bysignal && exitcode == 0) {
+        int newfd, oldfd;
+        char tmpfile[256];
+        long long now = ustime();
+        mstime_t latency;
+
+        serverLog(LL_NOTICE,
+            "Background AOF rewrite terminated with success");
+
+        /* Flush the differences accumulated by the parent to the
+         * rewritten AOF. */
+        latencyStartMonitor(latency);
+        snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof",
+            (int)server.child_pid);
+        newfd = open(tmpfile,O_WRONLY|O_APPEND);
+        if (newfd == -1) {
+            serverLog(LL_WARNING,
+                "Unable to open the temporary AOF produced by the child: %s", strerror(errno));
+            goto cleanup;
+        }
+
+        if (aofRewriteBufferWrite(newfd) == -1) {
+            serverLog(LL_WARNING,
+                "Error trying to flush the parent diff to the rewritten AOF: %s", strerror(errno));
+            close(newfd);
+            goto cleanup;
+        }
+        latencyEndMonitor(latency);
+        latencyAddSampleIfNeeded("aof-rewrite-diff-write",latency);
+  
+        if (server.aof_fsync == AOF_FSYNC_EVERYSEC) {
+            aof_background_fsync(newfd);
+        } else if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
+            latencyStartMonitor(latency);
+            if (redis_fsync(newfd) == -1) {
+                serverLog(LL_WARNING,
+                    "Error trying to fsync the parent diff to the rewritten AOF: %s", strerror(errno));
+                close(newfd);
+                goto cleanup;
+            }
+            latencyEndMonitor(latency);
+            latencyAddSampleIfNeeded("aof-rewrite-done-fsync",latency);
+        }
+
+        serverLog(LL_NOTICE,
+            "Residual parent diff successfully flushed to the rewritten AOF (%.2f MB)", (double) aofRewriteBufferSize() / (1024*1024));
+
+        /* The only remaining thing to do is to rename the temporary file to
+         * the configured file and switch the file descriptor used to do AOF
+         * writes. We don't want close(2) or rename(2) calls to block the
+         * server on old file deletion.
+         *
+         * There are two possible scenarios:
+         *
+         * 1) AOF is DISABLED and this was a one time rewrite. The temporary
+         * file will be renamed to the configured file. When this file already
+         * exists, it will be unlinked, which may block the server.
+         *
+         * 2) AOF is ENABLED and the rewritten AOF will immediately start
+         * receiving writes. After the temporary file is renamed to the
+         * configured file, the original AOF file descriptor will be closed.
+         * Since this will be the last reference to that file, closing it
+         * causes the underlying file to be unlinked, which may block the
+         * server.
+         *
+         * To mitigate the blocking effect of the unlink operation (either
+         * caused by rename(2) in scenario 1, or by close(2) in scenario 2), we
+         * use a background thread to take care of this. First, we
+         * make scenario 1 identical to scenario 2 by opening the target file
+         * when it exists. The unlink operation after the rename(2) will then
+         * be executed upon calling close(2) for its descriptor. Everything to
+         * guarantee atomicity for this switch has already happened by then, so
+         * we don't care what the outcome or duration of that close operation
+         * is, as long as the file descriptor is released again. */
+        if (server.aof_fd == -1) {
+            /* AOF disabled */
+
+            /* Don't care if this fails: oldfd will be -1 and we handle that.
+             * One notable case of -1 return is if the old file does
+             * not exist. */
+            oldfd = open(server.aof_filename,O_RDONLY|O_NONBLOCK);
+        } else {
+            /* AOF enabled */
+            oldfd = -1; /* We'll set this to the current AOF filedes later. */
+        }
+
+        /* Rename the temporary file. This will not unlink the target file if
+         * it exists, because we reference it with "oldfd". */
+        latencyStartMonitor(latency);
+        if (rename(tmpfile,server.aof_filename) == -1) {
+            serverLog(LL_WARNING,
+                "Error trying to rename the temporary AOF file %s into %s: %s",
+                tmpfile,
+                server.aof_filename,
+                strerror(errno));
+            close(newfd);
+            if (oldfd != -1) close(oldfd);
+            goto cleanup;
+        }
+        latencyEndMonitor(latency);
+        latencyAddSampleIfNeeded("aof-rename",latency);
+
+        if (server.aof_fd == -1) {
+            /* AOF disabled, we don't need to set the AOF file descriptor
+             * to this new file, so we can close it. */
+            close(newfd);
+        } else {
+            /* AOF enabled, replace the old fd with the new one. */
+            oldfd = server.aof_fd;
+            server.aof_fd = newfd;
+            server.aof_selected_db = -1; /* Make sure SELECT is re-issued */
+            aofUpdateCurrentSize();
+            server.aof_rewrite_base_size = server.aof_current_size;
+            server.aof_fsync_offset = server.aof_current_size;
+            server.aof_last_fsync = server.unixtime;
+
+            /* Clear regular AOF buffer since its contents was just written to
+             * the new AOF from the background rewrite buffer. */
+            sdsfree(server.aof_buf);
+            server.aof_buf = sdsempty();
+        }
+
+        server.aof_lastbgrewrite_status = C_OK;
+
+        serverLog(LL_NOTICE, "Background AOF rewrite finished successfully");
+        /* Change state from WAIT_REWRITE to ON if needed */
+        if (server.aof_state == AOF_WAIT_REWRITE)
+            server.aof_state = AOF_ON;
+
+        /* Asynchronously close the overwritten AOF. */
+        if (oldfd != -1) bioCreateCloseJob(oldfd);
+
+        serverLog(LL_VERBOSE,
+            "Background AOF rewrite signal handler took %lldus", ustime()-now);
+    } else if (!bysignal && exitcode != 0) {
+        server.aof_lastbgrewrite_status = C_ERR;
+
+        serverLog(LL_WARNING,
+            "Background AOF rewrite terminated with error");
+    } else {
+        /* SIGUSR1 is whitelisted, so we have a way to kill a child without
+         * triggering an error condition. */
+        if (bysignal != SIGUSR1)
+            server.aof_lastbgrewrite_status = C_ERR;
+
+        serverLog(LL_WARNING,
+            "Background AOF rewrite terminated by signal %d", bysignal);
+    }
+
+cleanup:
+    aofClosePipes();
+    aofRewriteBufferReset();
+    aofRemoveTempFile(server.child_pid);
+    server.aof_rewrite_time_last = time(NULL)-server.aof_rewrite_time_start;
+    server.aof_rewrite_time_start = -1;
+    /* Schedule a new rewrite if we are waiting for it to switch the AOF ON. */
+    if (server.aof_state == AOF_WAIT_REWRITE)
+        server.aof_rewrite_scheduled = 1;
+}
diff --git a/redis-stable/src/asciilogo.h b/redis-stable/src/asciilogo.h
new file mode 100644
index 00000000..a62f68cf
--- /dev/null
+++ b/redis-stable/src/asciilogo.h
@@ -0,0 +1,47 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+const char *ascii_logo =
+"                _._                                                  \n"
+"           _.-``__ ''-._                                             \n"
+"      _.-``    `.  `_.  ''-._           Redis %s (%s/%d) %s bit\n"
+"  .-`` .-```.  ```\\/    _.,_ ''-._                                  \n"
+" (    '      ,       .-`  | `,    )     Running in %s mode\n"
+" |`-._`-...-` __...-.``-._|'` _.-'|     Port: %d\n"
+" |    `-._   `._    /     _.-'    |     PID: %ld\n"
+"  `-._    `-._  `-./  _.-'    _.-'                                   \n"
+" |`-._`-._    `-.__.-'    _.-'_.-'|                                  \n"
+" |    `-._`-._        _.-'_.-'    |           https://redis.io       \n"
+"  `-._    `-._`-.__.-'_.-'    _.-'                                   \n"
+" |`-._`-._    `-.__.-'    _.-'_.-'|                                  \n"
+" |    `-._`-._        _.-'_.-'    |                                  \n"
+"  `-._    `-._`-.__.-'_.-'    _.-'                                   \n"
+"      `-._    `-.__.-'    _.-'                                       \n"
+"          `-._        _.-'                                           \n"
+"              `-.__.-'                                               \n\n";
diff --git a/redis-stable/src/atomicvar.h b/redis-stable/src/atomicvar.h
new file mode 100644
index 00000000..222b8269
--- /dev/null
+++ b/redis-stable/src/atomicvar.h
@@ -0,0 +1,158 @@
+/* This file implements atomic counters using c11 _Atomic, __atomic or __sync
+ * macros if available, otherwise we will throw an error when compile.
+ *
+ * The exported interface is composed of three macros:
+ *
+ * atomicIncr(var,count) -- Increment the atomic counter
+ * atomicGetIncr(var,oldvalue_var,count) -- Get and increment the atomic counter
+ * atomicDecr(var,count) -- Decrement the atomic counter
+ * atomicGet(var,dstvar) -- Fetch the atomic counter value
+ * atomicSet(var,value)  -- Set the atomic counter value
+ * atomicGetWithSync(var,value)  -- 'atomicGet' with inter-thread synchronization
+ * atomicSetWithSync(var,value)  -- 'atomicSet' with inter-thread synchronization
+ *
+ * Never use return value from the macros, instead use the AtomicGetIncr()
+ * if you need to get the current value and increment it atomically, like
+ * in the following example:
+ *
+ *  long oldvalue;
+ *  atomicGetIncr(myvar,oldvalue,1);
+ *  doSomethingWith(oldvalue);
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <pthread.h>
+#include "config.h"
+
+#ifndef __ATOMIC_VAR_H
+#define __ATOMIC_VAR_H
+
+/* Define redisAtomic for atomic variable. */
+#define redisAtomic
+
+/* To test Redis with Helgrind (a Valgrind tool) it is useful to define
+ * the following macro, so that __sync macros are used: those can be detected
+ * by Helgrind (even if they are less efficient) so that no false positive
+ * is reported. */
+// #define __ATOMIC_VAR_FORCE_SYNC_MACROS
+
+/* There will be many false positives if we test Redis with Helgrind, since
+ * Helgrind can't understand we have imposed ordering on the program, so
+ * we use macros in helgrind.h to tell Helgrind inter-thread happens-before
+ * relationship explicitly for avoiding false positives.
+ *
+ * For more details, please see: valgrind/helgrind.h and
+ * https://www.valgrind.org/docs/manual/hg-manual.html#hg-manual.effective-use
+ *
+ * These macros take effect only when 'make helgrind', and you must first
+ * install Valgrind in the default path configuration. */
+#ifdef __ATOMIC_VAR_FORCE_SYNC_MACROS
+#include <valgrind/helgrind.h>
+#else
+#define ANNOTATE_HAPPENS_BEFORE(v) ((void) v)
+#define ANNOTATE_HAPPENS_AFTER(v)  ((void) v)
+#endif
+
+#if !defined(__ATOMIC_VAR_FORCE_SYNC_MACROS) && defined(__STDC_VERSION__) && \
+    (__STDC_VERSION__ >= 201112L) && !defined(__STDC_NO_ATOMICS__)
+/* Use '_Atomic' keyword if the compiler supports. */
+#undef  redisAtomic
+#define redisAtomic _Atomic
+/* Implementation using _Atomic in C11. */
+
+#include <stdatomic.h>
+#define atomicIncr(var,count) atomic_fetch_add_explicit(&var,(count),memory_order_relaxed)
+#define atomicGetIncr(var,oldvalue_var,count) do { \
+    oldvalue_var = atomic_fetch_add_explicit(&var,(count),memory_order_relaxed); \
+} while(0)
+#define atomicDecr(var,count) atomic_fetch_sub_explicit(&var,(count),memory_order_relaxed)
+#define atomicGet(var,dstvar) do { \
+    dstvar = atomic_load_explicit(&var,memory_order_relaxed); \
+} while(0)
+#define atomicSet(var,value) atomic_store_explicit(&var,value,memory_order_relaxed)
+#define atomicGetWithSync(var,dstvar) do { \
+    dstvar = atomic_load_explicit(&var,memory_order_seq_cst); \
+} while(0)
+#define atomicSetWithSync(var,value) \
+    atomic_store_explicit(&var,value,memory_order_seq_cst)
+#define REDIS_ATOMIC_API "c11-builtin"
+
+#elif !defined(__ATOMIC_VAR_FORCE_SYNC_MACROS) && \
+    (!defined(__clang__) || !defined(__APPLE__) || __apple_build_version__ > 4210057) && \
+    defined(__ATOMIC_RELAXED) && defined(__ATOMIC_SEQ_CST)
+/* Implementation using __atomic macros. */
+
+#define atomicIncr(var,count) __atomic_add_fetch(&var,(count),__ATOMIC_RELAXED)
+#define atomicGetIncr(var,oldvalue_var,count) do { \
+    oldvalue_var = __atomic_fetch_add(&var,(count),__ATOMIC_RELAXED); \
+} while(0)
+#define atomicDecr(var,count) __atomic_sub_fetch(&var,(count),__ATOMIC_RELAXED)
+#define atomicGet(var,dstvar) do { \
+    dstvar = __atomic_load_n(&var,__ATOMIC_RELAXED); \
+} while(0)
+#define atomicSet(var,value) __atomic_store_n(&var,value,__ATOMIC_RELAXED)
+#define atomicGetWithSync(var,dstvar) do { \
+    dstvar = __atomic_load_n(&var,__ATOMIC_SEQ_CST); \
+} while(0)
+#define atomicSetWithSync(var,value) \
+    __atomic_store_n(&var,value,__ATOMIC_SEQ_CST)
+#define REDIS_ATOMIC_API "atomic-builtin"
+
+#elif defined(HAVE_ATOMIC)
+/* Implementation using __sync macros. */
+
+#define atomicIncr(var,count) __sync_add_and_fetch(&var,(count))
+#define atomicGetIncr(var,oldvalue_var,count) do { \
+    oldvalue_var = __sync_fetch_and_add(&var,(count)); \
+} while(0)
+#define atomicDecr(var,count) __sync_sub_and_fetch(&var,(count))
+#define atomicGet(var,dstvar) do { \
+    dstvar = __sync_sub_and_fetch(&var,0); \
+} while(0)
+#define atomicSet(var,value) do { \
+    while(!__sync_bool_compare_and_swap(&var,var,value)); \
+} while(0)
+/* Actually the builtin issues a full memory barrier by default. */
+#define atomicGetWithSync(var,dstvar) { \
+    dstvar = __sync_sub_and_fetch(&var,0,__sync_synchronize); \
+    ANNOTATE_HAPPENS_AFTER(&var); \
+} while(0)
+#define atomicSetWithSync(var,value) do { \
+    ANNOTATE_HAPPENS_BEFORE(&var);  \
+    while(!__sync_bool_compare_and_swap(&var,var,value,__sync_synchronize)); \
+} while(0)
+#define REDIS_ATOMIC_API "sync-builtin"
+
+#else
+#error "Unable to determine atomic operations for your platform"
+
+#endif
+#endif /* __ATOMIC_VAR_H */
diff --git a/redis-stable/src/bio.c b/redis-stable/src/bio.c
new file mode 100644
index 00000000..ff18c4fe
--- /dev/null
+++ b/redis-stable/src/bio.c
@@ -0,0 +1,309 @@
+/* Background I/O service for Redis.
+ *
+ * This file implements operations that we need to perform in the background.
+ * Currently there is only a single operation, that is a background close(2)
+ * system call. This is needed as when the process is the last owner of a
+ * reference to a file closing it means unlinking it, and the deletion of the
+ * file is slow, blocking the server.
+ *
+ * In the future we'll either continue implementing new things we need or
+ * we'll switch to libeio. However there are probably long term uses for this
+ * file as we may want to put here Redis specific background tasks (for instance
+ * it is not impossible that we'll need a non blocking FLUSHDB/FLUSHALL
+ * implementation).
+ *
+ * DESIGN
+ * ------
+ *
+ * The design is trivial, we have a structure representing a job to perform
+ * and a different thread and job queue for every job type.
+ * Every thread waits for new jobs in its queue, and process every job
+ * sequentially.
+ *
+ * Jobs of the same type are guaranteed to be processed from the least
+ * recently inserted to the most recently inserted (older jobs processed
+ * first).
+ *
+ * Currently there is no way for the creator of the job to be notified about
+ * the completion of the operation, this will only be added when/if needed.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "server.h"
+#include "bio.h"
+
+static pthread_t bio_threads[BIO_NUM_OPS];
+static pthread_mutex_t bio_mutex[BIO_NUM_OPS];
+static pthread_cond_t bio_newjob_cond[BIO_NUM_OPS];
+static pthread_cond_t bio_step_cond[BIO_NUM_OPS];
+static list *bio_jobs[BIO_NUM_OPS];
+/* The following array is used to hold the number of pending jobs for every
+ * OP type. This allows us to export the bioPendingJobsOfType() API that is
+ * useful when the main thread wants to perform some operation that may involve
+ * objects shared with the background thread. The main thread will just wait
+ * that there are no longer jobs of this type to be executed before performing
+ * the sensible operation. This data is also useful for reporting. */
+static unsigned long long bio_pending[BIO_NUM_OPS];
+
+/* This structure represents a background Job. It is only used locally to this
+ * file as the API does not expose the internals at all. */
+struct bio_job {
+    time_t time; /* Time at which the job was created. */
+    /* Job specific arguments.*/
+    int fd; /* Fd for file based background jobs */
+    lazy_free_fn *free_fn; /* Function that will free the provided arguments */
+    void *free_args[]; /* List of arguments to be passed to the free function */
+};
+
+void *bioProcessBackgroundJobs(void *arg);
+
+/* Make sure we have enough stack to perform all the things we do in the
+ * main thread. */
+#define REDIS_THREAD_STACK_SIZE (1024*1024*4)
+
+/* Initialize the background system, spawning the thread. */
+void bioInit(void) {
+    pthread_attr_t attr;
+    pthread_t thread;
+    size_t stacksize;
+    int j;
+
+    /* Initialization of state vars and objects */
+    for (j = 0; j < BIO_NUM_OPS; j++) {
+        pthread_mutex_init(&bio_mutex[j],NULL);
+        pthread_cond_init(&bio_newjob_cond[j],NULL);
+        pthread_cond_init(&bio_step_cond[j],NULL);
+        bio_jobs[j] = listCreate();
+        bio_pending[j] = 0;
+    }
+
+    /* Set the stack size as by default it may be small in some system */
+    pthread_attr_init(&attr);
+    pthread_attr_getstacksize(&attr,&stacksize);
+    if (!stacksize) stacksize = 1; /* The world is full of Solaris Fixes */
+    while (stacksize < REDIS_THREAD_STACK_SIZE) stacksize *= 2;
+    pthread_attr_setstacksize(&attr, stacksize);
+
+    /* Ready to spawn our threads. We use the single argument the thread
+     * function accepts in order to pass the job ID the thread is
+     * responsible of. */
+    for (j = 0; j < BIO_NUM_OPS; j++) {
+        void *arg = (void*)(unsigned long) j;
+        if (pthread_create(&thread,&attr,bioProcessBackgroundJobs,arg) != 0) {
+            serverLog(LL_WARNING,"Fatal: Can't initialize Background Jobs.");
+            exit(1);
+        }
+        bio_threads[j] = thread;
+    }
+}
+
+void bioSubmitJob(int type, struct bio_job *job) {
+    job->time = time(NULL);
+    pthread_mutex_lock(&bio_mutex[type]);
+    listAddNodeTail(bio_jobs[type],job);
+    bio_pending[type]++;
+    pthread_cond_signal(&bio_newjob_cond[type]);
+    pthread_mutex_unlock(&bio_mutex[type]);
+}
+
+void bioCreateLazyFreeJob(lazy_free_fn free_fn, int arg_count, ...) {
+    va_list valist;
+    /* Allocate memory for the job structure and all required
+     * arguments */
+    struct bio_job *job = zmalloc(sizeof(*job) + sizeof(void *) * (arg_count));
+    job->free_fn = free_fn;
+
+    va_start(valist, arg_count);
+    for (int i = 0; i < arg_count; i++) {
+        job->free_args[i] = va_arg(valist, void *);
+    }
+    va_end(valist);
+    bioSubmitJob(BIO_LAZY_FREE, job);
+}
+
+void bioCreateCloseJob(int fd) {
+    struct bio_job *job = zmalloc(sizeof(*job));
+    job->fd = fd;
+
+    bioSubmitJob(BIO_CLOSE_FILE, job);
+}
+
+void bioCreateFsyncJob(int fd) {
+    struct bio_job *job = zmalloc(sizeof(*job));
+    job->fd = fd;
+
+    bioSubmitJob(BIO_AOF_FSYNC, job);
+}
+
+void *bioProcessBackgroundJobs(void *arg) {
+    struct bio_job *job;
+    unsigned long type = (unsigned long) arg;
+    sigset_t sigset;
+
+    /* Check that the type is within the right interval. */
+    if (type >= BIO_NUM_OPS) {
+        serverLog(LL_WARNING,
+            "Warning: bio thread started with wrong type %lu",type);
+        return NULL;
+    }
+
+    switch (type) {
+    case BIO_CLOSE_FILE:
+        redis_set_thread_title("bio_close_file");
+        break;
+    case BIO_AOF_FSYNC:
+        redis_set_thread_title("bio_aof_fsync");
+        break;
+    case BIO_LAZY_FREE:
+        redis_set_thread_title("bio_lazy_free");
+        break;
+    }
+
+    redisSetCpuAffinity(server.bio_cpulist);
+
+    makeThreadKillable();
+
+    pthread_mutex_lock(&bio_mutex[type]);
+    /* Block SIGALRM so we are sure that only the main thread will
+     * receive the watchdog signal. */
+    sigemptyset(&sigset);
+    sigaddset(&sigset, SIGALRM);
+    if (pthread_sigmask(SIG_BLOCK, &sigset, NULL))
+        serverLog(LL_WARNING,
+            "Warning: can't mask SIGALRM in bio.c thread: %s", strerror(errno));
+
+    while(1) {
+        listNode *ln;
+
+        /* The loop always starts with the lock hold. */
+        if (listLength(bio_jobs[type]) == 0) {
+            pthread_cond_wait(&bio_newjob_cond[type],&bio_mutex[type]);
+            continue;
+        }
+        /* Pop the job from the queue. */
+        ln = listFirst(bio_jobs[type]);
+        job = ln->value;
+        /* It is now possible to unlock the background system as we know have
+         * a stand alone job structure to process.*/
+        pthread_mutex_unlock(&bio_mutex[type]);
+
+        /* Process the job accordingly to its type. */
+        if (type == BIO_CLOSE_FILE) {
+            close(job->fd);
+        } else if (type == BIO_AOF_FSYNC) {
+            /* The fd may be closed by main thread and reused for another
+             * socket, pipe, or file. We just ignore these errno because
+             * aof fsync did not really fail. */
+            if (redis_fsync(job->fd) == -1 &&
+                errno != EBADF && errno != EINVAL)
+            {
+                int last_status;
+                atomicGet(server.aof_bio_fsync_status,last_status);
+                atomicSet(server.aof_bio_fsync_status,C_ERR);
+                atomicSet(server.aof_bio_fsync_errno,errno);
+                if (last_status == C_OK) {
+                    serverLog(LL_WARNING,
+                        "Fail to fsync the AOF file: %s",strerror(errno));
+                }
+            } else {
+                atomicSet(server.aof_bio_fsync_status,C_OK);
+            }
+        } else if (type == BIO_LAZY_FREE) {
+            job->free_fn(job->free_args);
+        } else {
+            serverPanic("Wrong job type in bioProcessBackgroundJobs().");
+        }
+        zfree(job);
+
+        /* Lock again before reiterating the loop, if there are no longer
+         * jobs to process we'll block again in pthread_cond_wait(). */
+        pthread_mutex_lock(&bio_mutex[type]);
+        listDelNode(bio_jobs[type],ln);
+        bio_pending[type]--;
+
+        /* Unblock threads blocked on bioWaitStepOfType() if any. */
+        pthread_cond_broadcast(&bio_step_cond[type]);
+    }
+}
+
+/* Return the number of pending jobs of the specified type. */
+unsigned long long bioPendingJobsOfType(int type) {
+    unsigned long long val;
+    pthread_mutex_lock(&bio_mutex[type]);
+    val = bio_pending[type];
+    pthread_mutex_unlock(&bio_mutex[type]);
+    return val;
+}
+
+/* If there are pending jobs for the specified type, the function blocks
+ * and waits that the next job was processed. Otherwise the function
+ * does not block and returns ASAP.
+ *
+ * The function returns the number of jobs still to process of the
+ * requested type.
+ *
+ * This function is useful when from another thread, we want to wait
+ * a bio.c thread to do more work in a blocking way.
+ */
+unsigned long long bioWaitStepOfType(int type) {
+    unsigned long long val;
+    pthread_mutex_lock(&bio_mutex[type]);
+    val = bio_pending[type];
+    if (val != 0) {
+        pthread_cond_wait(&bio_step_cond[type],&bio_mutex[type]);
+        val = bio_pending[type];
+    }
+    pthread_mutex_unlock(&bio_mutex[type]);
+    return val;
+}
+
+/* Kill the running bio threads in an unclean way. This function should be
+ * used only when it's critical to stop the threads for some reason.
+ * Currently Redis does this only on crash (for instance on SIGSEGV) in order
+ * to perform a fast memory check without other threads messing with memory. */
+void bioKillThreads(void) {
+    int err, j;
+
+    for (j = 0; j < BIO_NUM_OPS; j++) {
+        if (bio_threads[j] == pthread_self()) continue;
+        if (bio_threads[j] && pthread_cancel(bio_threads[j]) == 0) {
+            if ((err = pthread_join(bio_threads[j],NULL)) != 0) {
+                serverLog(LL_WARNING,
+                    "Bio thread for job type #%d can not be joined: %s",
+                        j, strerror(err));
+            } else {
+                serverLog(LL_WARNING,
+                    "Bio thread for job type #%d terminated",j);
+            }
+        }
+    }
+}
diff --git a/redis-stable/src/bio.h b/redis-stable/src/bio.h
new file mode 100644
index 00000000..1e6e9729
--- /dev/null
+++ b/redis-stable/src/bio.h
@@ -0,0 +1,51 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __BIO_H
+#define __BIO_H
+
+typedef void lazy_free_fn(void *args[]);
+
+/* Exported API */
+void bioInit(void);
+unsigned long long bioPendingJobsOfType(int type);
+unsigned long long bioWaitStepOfType(int type);
+time_t bioOlderJobOfType(int type);
+void bioKillThreads(void);
+void bioCreateCloseJob(int fd);
+void bioCreateFsyncJob(int fd);
+void bioCreateLazyFreeJob(lazy_free_fn free_fn, int arg_count, ...);
+
+/* Background job opcodes */
+#define BIO_CLOSE_FILE    0 /* Deferred close(2) syscall. */
+#define BIO_AOF_FSYNC     1 /* Deferred AOF fsync. */
+#define BIO_LAZY_FREE     2 /* Deferred objects freeing. */
+#define BIO_NUM_OPS       3
+
+#endif
diff --git a/redis-stable/src/bitops.c b/redis-stable/src/bitops.c
new file mode 100644
index 00000000..f1c563a4
--- /dev/null
+++ b/redis-stable/src/bitops.c
@@ -0,0 +1,1165 @@
+/* Bit operations.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* -----------------------------------------------------------------------------
+ * Helpers and low level bit functions.
+ * -------------------------------------------------------------------------- */
+
+/* Count number of bits set in the binary array pointed by 's' and long
+ * 'count' bytes. The implementation of this function is required to
+ * work with an input string length up to 512 MB or more (server.proto_max_bulk_len) */
+long long redisPopcount(void *s, long count) {
+    long long bits = 0;
+    unsigned char *p = s;
+    uint32_t *p4;
+    static const unsigned char bitsinbyte[256] = {0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8};
+
+    /* Count initial bytes not aligned to 32 bit. */
+    while((unsigned long)p & 3 && count) {
+        bits += bitsinbyte[*p++];
+        count--;
+    }
+
+    /* Count bits 28 bytes at a time */
+    p4 = (uint32_t*)p;
+    while(count>=28) {
+        uint32_t aux1, aux2, aux3, aux4, aux5, aux6, aux7;
+
+        aux1 = *p4++;
+        aux2 = *p4++;
+        aux3 = *p4++;
+        aux4 = *p4++;
+        aux5 = *p4++;
+        aux6 = *p4++;
+        aux7 = *p4++;
+        count -= 28;
+
+        aux1 = aux1 - ((aux1 >> 1) & 0x55555555);
+        aux1 = (aux1 & 0x33333333) + ((aux1 >> 2) & 0x33333333);
+        aux2 = aux2 - ((aux2 >> 1) & 0x55555555);
+        aux2 = (aux2 & 0x33333333) + ((aux2 >> 2) & 0x33333333);
+        aux3 = aux3 - ((aux3 >> 1) & 0x55555555);
+        aux3 = (aux3 & 0x33333333) + ((aux3 >> 2) & 0x33333333);
+        aux4 = aux4 - ((aux4 >> 1) & 0x55555555);
+        aux4 = (aux4 & 0x33333333) + ((aux4 >> 2) & 0x33333333);
+        aux5 = aux5 - ((aux5 >> 1) & 0x55555555);
+        aux5 = (aux5 & 0x33333333) + ((aux5 >> 2) & 0x33333333);
+        aux6 = aux6 - ((aux6 >> 1) & 0x55555555);
+        aux6 = (aux6 & 0x33333333) + ((aux6 >> 2) & 0x33333333);
+        aux7 = aux7 - ((aux7 >> 1) & 0x55555555);
+        aux7 = (aux7 & 0x33333333) + ((aux7 >> 2) & 0x33333333);
+        bits += ((((aux1 + (aux1 >> 4)) & 0x0F0F0F0F) +
+                    ((aux2 + (aux2 >> 4)) & 0x0F0F0F0F) +
+                    ((aux3 + (aux3 >> 4)) & 0x0F0F0F0F) +
+                    ((aux4 + (aux4 >> 4)) & 0x0F0F0F0F) +
+                    ((aux5 + (aux5 >> 4)) & 0x0F0F0F0F) +
+                    ((aux6 + (aux6 >> 4)) & 0x0F0F0F0F) +
+                    ((aux7 + (aux7 >> 4)) & 0x0F0F0F0F))* 0x01010101) >> 24;
+    }
+    /* Count the remaining bytes. */
+    p = (unsigned char*)p4;
+    while(count--) bits += bitsinbyte[*p++];
+    return bits;
+}
+
+/* Return the position of the first bit set to one (if 'bit' is 1) or
+ * zero (if 'bit' is 0) in the bitmap starting at 's' and long 'count' bytes.
+ *
+ * The function is guaranteed to return a value >= 0 if 'bit' is 0 since if
+ * no zero bit is found, it returns count*8 assuming the string is zero
+ * padded on the right. However if 'bit' is 1 it is possible that there is
+ * not a single set bit in the bitmap. In this special case -1 is returned. */
+long long redisBitpos(void *s, unsigned long count, int bit) {
+    unsigned long *l;
+    unsigned char *c;
+    unsigned long skipval, word = 0, one;
+    long long pos = 0; /* Position of bit, to return to the caller. */
+    unsigned long j;
+    int found;
+
+    /* Process whole words first, seeking for first word that is not
+     * all ones or all zeros respectively if we are looking for zeros
+     * or ones. This is much faster with large strings having contiguous
+     * blocks of 1 or 0 bits compared to the vanilla bit per bit processing.
+     *
+     * Note that if we start from an address that is not aligned
+     * to sizeof(unsigned long) we consume it byte by byte until it is
+     * aligned. */
+
+    /* Skip initial bits not aligned to sizeof(unsigned long) byte by byte. */
+    skipval = bit ? 0 : UCHAR_MAX;
+    c = (unsigned char*) s;
+    found = 0;
+    while((unsigned long)c & (sizeof(*l)-1) && count) {
+        if (*c != skipval) {
+            found = 1;
+            break;
+        }
+        c++;
+        count--;
+        pos += 8;
+    }
+
+    /* Skip bits with full word step. */
+    l = (unsigned long*) c;
+    if (!found) {
+        skipval = bit ? 0 : ULONG_MAX;
+        while (count >= sizeof(*l)) {
+            if (*l != skipval) break;
+            l++;
+            count -= sizeof(*l);
+            pos += sizeof(*l)*8;
+        }
+    }
+
+    /* Load bytes into "word" considering the first byte as the most significant
+     * (we basically consider it as written in big endian, since we consider the
+     * string as a set of bits from left to right, with the first bit at position
+     * zero.
+     *
+     * Note that the loading is designed to work even when the bytes left
+     * (count) are less than a full word. We pad it with zero on the right. */
+    c = (unsigned char*)l;
+    for (j = 0; j < sizeof(*l); j++) {
+        word <<= 8;
+        if (count) {
+            word |= *c;
+            c++;
+            count--;
+        }
+    }
+
+    /* Special case:
+     * If bits in the string are all zero and we are looking for one,
+     * return -1 to signal that there is not a single "1" in the whole
+     * string. This can't happen when we are looking for "0" as we assume
+     * that the right of the string is zero padded. */
+    if (bit == 1 && word == 0) return -1;
+
+    /* Last word left, scan bit by bit. The first thing we need is to
+     * have a single "1" set in the most significant position in an
+     * unsigned long. We don't know the size of the long so we use a
+     * simple trick. */
+    one = ULONG_MAX; /* All bits set to 1.*/
+    one >>= 1;       /* All bits set to 1 but the MSB. */
+    one = ~one;      /* All bits set to 0 but the MSB. */
+
+    while(one) {
+        if (((one & word) != 0) == bit) return pos;
+        pos++;
+        one >>= 1;
+    }
+
+    /* If we reached this point, there is a bug in the algorithm, since
+     * the case of no match is handled as a special case before. */
+    serverPanic("End of redisBitpos() reached.");
+    return 0; /* Just to avoid warnings. */
+}
+
+/* The following set.*Bitfield and get.*Bitfield functions implement setting
+ * and getting arbitrary size (up to 64 bits) signed and unsigned integers
+ * at arbitrary positions into a bitmap.
+ *
+ * The representation considers the bitmap as having the bit number 0 to be
+ * the most significant bit of the first byte, and so forth, so for example
+ * setting a 5 bits unsigned integer to value 23 at offset 7 into a bitmap
+ * previously set to all zeroes, will produce the following representation:
+ *
+ * +--------+--------+
+ * |00000001|01110000|
+ * +--------+--------+
+ *
+ * When offsets and integer sizes are aligned to bytes boundaries, this is the
+ * same as big endian, however when such alignment does not exist, its important
+ * to also understand how the bits inside a byte are ordered.
+ *
+ * Note that this format follows the same convention as SETBIT and related
+ * commands.
+ */
+
+void setUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, uint64_t value) {
+    uint64_t byte, bit, byteval, bitval, j;
+
+    for (j = 0; j < bits; j++) {
+        bitval = (value & ((uint64_t)1<<(bits-1-j))) != 0;
+        byte = offset >> 3;
+        bit = 7 - (offset & 0x7);
+        byteval = p[byte];
+        byteval &= ~(1 << bit);
+        byteval |= bitval << bit;
+        p[byte] = byteval & 0xff;
+        offset++;
+    }
+}
+
+void setSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, int64_t value) {
+    uint64_t uv = value; /* Casting will add UINT64_MAX + 1 if v is negative. */
+    setUnsignedBitfield(p,offset,bits,uv);
+}
+
+uint64_t getUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {
+    uint64_t byte, bit, byteval, bitval, j, value = 0;
+
+    for (j = 0; j < bits; j++) {
+        byte = offset >> 3;
+        bit = 7 - (offset & 0x7);
+        byteval = p[byte];
+        bitval = (byteval >> bit) & 1;
+        value = (value<<1) | bitval;
+        offset++;
+    }
+    return value;
+}
+
+int64_t getSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {
+    int64_t value;
+    union {uint64_t u; int64_t i;} conv;
+
+    /* Converting from unsigned to signed is undefined when the value does
+     * not fit, however here we assume two's complement and the original value
+     * was obtained from signed -> unsigned conversion, so we'll find the
+     * most significant bit set if the original value was negative.
+     *
+     * Note that two's complement is mandatory for exact-width types
+     * according to the C99 standard. */
+    conv.u = getUnsignedBitfield(p,offset,bits);
+    value = conv.i;
+
+    /* If the top significant bit is 1, propagate it to all the
+     * higher bits for two's complement representation of signed
+     * integers. */
+    if (bits < 64 && (value & ((uint64_t)1 << (bits-1))))
+        value |= ((uint64_t)-1) << bits;
+    return value;
+}
+
+/* The following two functions detect overflow of a value in the context
+ * of storing it as an unsigned or signed integer with the specified
+ * number of bits. The functions both take the value and a possible increment.
+ * If no overflow could happen and the value+increment fit inside the limits,
+ * then zero is returned, otherwise in case of overflow, 1 is returned,
+ * otherwise in case of underflow, -1 is returned.
+ *
+ * When non-zero is returned (overflow or underflow), if not NULL, *limit is
+ * set to the value the operation should result when an overflow happens,
+ * depending on the specified overflow semantics:
+ *
+ * For BFOVERFLOW_SAT if 1 is returned, *limit it is set maximum value that
+ * you can store in that integer. when -1 is returned, *limit is set to the
+ * minimum value that an integer of that size can represent.
+ *
+ * For BFOVERFLOW_WRAP *limit is set by performing the operation in order to
+ * "wrap" around towards zero for unsigned integers, or towards the most
+ * negative number that is possible to represent for signed integers. */
+
+#define BFOVERFLOW_WRAP 0
+#define BFOVERFLOW_SAT 1
+#define BFOVERFLOW_FAIL 2 /* Used by the BITFIELD command implementation. */
+
+int checkUnsignedBitfieldOverflow(uint64_t value, int64_t incr, uint64_t bits, int owtype, uint64_t *limit) {
+    uint64_t max = (bits == 64) ? UINT64_MAX : (((uint64_t)1<<bits)-1);
+    int64_t maxincr = max-value;
+    int64_t minincr = -value;
+
+    if (value > max || (incr > 0 && incr > maxincr)) {
+        if (limit) {
+            if (owtype == BFOVERFLOW_WRAP) {
+                goto handle_wrap;
+            } else if (owtype == BFOVERFLOW_SAT) {
+                *limit = max;
+            }
+        }
+        return 1;
+    } else if (incr < 0 && incr < minincr) {
+        if (limit) {
+            if (owtype == BFOVERFLOW_WRAP) {
+                goto handle_wrap;
+            } else if (owtype == BFOVERFLOW_SAT) {
+                *limit = 0;
+            }
+        }
+        return -1;
+    }
+    return 0;
+
+handle_wrap:
+    {
+        uint64_t mask = ((uint64_t)-1) << bits;
+        uint64_t res = value+incr;
+
+        res &= ~mask;
+        *limit = res;
+    }
+    return 1;
+}
+
+int checkSignedBitfieldOverflow(int64_t value, int64_t incr, uint64_t bits, int owtype, int64_t *limit) {
+    int64_t max = (bits == 64) ? INT64_MAX : (((int64_t)1<<(bits-1))-1);
+    int64_t min = (-max)-1;
+
+    /* Note that maxincr and minincr could overflow, but we use the values
+     * only after checking 'value' range, so when we use it no overflow
+     * happens. */
+    int64_t maxincr = max-value;
+    int64_t minincr = min-value;
+
+    if (value > max || (bits != 64 && incr > maxincr) || (value >= 0 && incr > 0 && incr > maxincr))
+    {
+        if (limit) {
+            if (owtype == BFOVERFLOW_WRAP) {
+                goto handle_wrap;
+            } else if (owtype == BFOVERFLOW_SAT) {
+                *limit = max;
+            }
+        }
+        return 1;
+    } else if (value < min || (bits != 64 && incr < minincr) || (value < 0 && incr < 0 && incr < minincr)) {
+        if (limit) {
+            if (owtype == BFOVERFLOW_WRAP) {
+                goto handle_wrap;
+            } else if (owtype == BFOVERFLOW_SAT) {
+                *limit = min;
+            }
+        }
+        return -1;
+    }
+    return 0;
+
+handle_wrap:
+    {
+        uint64_t msb = (uint64_t)1 << (bits-1);
+        uint64_t a = value, b = incr, c;
+        c = a+b; /* Perform addition as unsigned so that's defined. */
+
+        /* If the sign bit is set, propagate to all the higher order
+         * bits, to cap the negative value. If it's clear, mask to
+         * the positive integer limit. */
+        if (bits < 64) {
+            uint64_t mask = ((uint64_t)-1) << bits;
+            if (c & msb) {
+                c |= mask;
+            } else {
+                c &= ~mask;
+            }
+        }
+        *limit = c;
+    }
+    return 1;
+}
+
+/* Debugging function. Just show bits in the specified bitmap. Not used
+ * but here for not having to rewrite it when debugging is needed. */
+void printBits(unsigned char *p, unsigned long count) {
+    unsigned long j, i, byte;
+
+    for (j = 0; j < count; j++) {
+        byte = p[j];
+        for (i = 0x80; i > 0; i /= 2)
+            printf("%c", (byte & i) ? '1' : '0');
+        printf("|");
+    }
+    printf("\n");
+}
+
+/* -----------------------------------------------------------------------------
+ * Bits related string commands: GETBIT, SETBIT, BITCOUNT, BITOP.
+ * -------------------------------------------------------------------------- */
+
+#define BITOP_AND   0
+#define BITOP_OR    1
+#define BITOP_XOR   2
+#define BITOP_NOT   3
+
+#define BITFIELDOP_GET 0
+#define BITFIELDOP_SET 1
+#define BITFIELDOP_INCRBY 2
+
+/* This helper function used by GETBIT / SETBIT parses the bit offset argument
+ * making sure an error is returned if it is negative or if it overflows
+ * Redis 512 MB limit for the string value or more (server.proto_max_bulk_len).
+ *
+ * If the 'hash' argument is true, and 'bits is positive, then the command
+ * will also parse bit offsets prefixed by "#". In such a case the offset
+ * is multiplied by 'bits'. This is useful for the BITFIELD command. */
+int getBitOffsetFromArgument(client *c, robj *o, uint64_t *offset, int hash, int bits) {
+    long long loffset;
+    char *err = "bit offset is not an integer or out of range";
+    char *p = o->ptr;
+    size_t plen = sdslen(p);
+    int usehash = 0;
+
+    /* Handle #<offset> form. */
+    if (p[0] == '#' && hash && bits > 0) usehash = 1;
+
+    if (string2ll(p+usehash,plen-usehash,&loffset) == 0) {
+        addReplyError(c,err);
+        return C_ERR;
+    }
+
+    /* Adjust the offset by 'bits' for #<offset> form. */
+    if (usehash) loffset *= bits;
+
+    /* Limit offset to server.proto_max_bulk_len (512MB in bytes by default) */
+    if ((loffset < 0) || (loffset >> 3) >= server.proto_max_bulk_len)
+    {
+        addReplyError(c,err);
+        return C_ERR;
+    }
+
+    *offset = loffset;
+    return C_OK;
+}
+
+/* This helper function for BITFIELD parses a bitfield type in the form
+ * <sign><bits> where sign is 'u' or 'i' for unsigned and signed, and
+ * the bits is a value between 1 and 64. However 64 bits unsigned integers
+ * are reported as an error because of current limitations of Redis protocol
+ * to return unsigned integer values greater than INT64_MAX.
+ *
+ * On error C_ERR is returned and an error is sent to the client. */
+int getBitfieldTypeFromArgument(client *c, robj *o, int *sign, int *bits) {
+    char *p = o->ptr;
+    char *err = "Invalid bitfield type. Use something like i16 u8. Note that u64 is not supported but i64 is.";
+    long long llbits;
+
+    if (p[0] == 'i') {
+        *sign = 1;
+    } else if (p[0] == 'u') {
+        *sign = 0;
+    } else {
+        addReplyError(c,err);
+        return C_ERR;
+    }
+
+    if ((string2ll(p+1,strlen(p+1),&llbits)) == 0 ||
+        llbits < 1 ||
+        (*sign == 1 && llbits > 64) ||
+        (*sign == 0 && llbits > 63))
+    {
+        addReplyError(c,err);
+        return C_ERR;
+    }
+    *bits = llbits;
+    return C_OK;
+}
+
+/* This is an helper function for commands implementations that need to write
+ * bits to a string object. The command creates or pad with zeroes the string
+ * so that the 'maxbit' bit can be addressed. The object is finally
+ * returned. Otherwise if the key holds a wrong type NULL is returned and
+ * an error is sent to the client. */
+robj *lookupStringForBitCommand(client *c, uint64_t maxbit) {
+    size_t byte = maxbit >> 3;
+    robj *o = lookupKeyWrite(c->db,c->argv[1]);
+    if (checkType(c,o,OBJ_STRING)) return NULL;
+
+    if (o == NULL) {
+        o = createObject(OBJ_STRING,sdsnewlen(NULL, byte+1));
+        dbAdd(c->db,c->argv[1],o);
+    } else {
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+        o->ptr = sdsgrowzero(o->ptr,byte+1);
+    }
+    return o;
+}
+
+/* Return a pointer to the string object content, and stores its length
+ * in 'len'. The user is required to pass (likely stack allocated) buffer
+ * 'llbuf' of at least LONG_STR_SIZE bytes. Such a buffer is used in the case
+ * the object is integer encoded in order to provide the representation
+ * without using heap allocation.
+ *
+ * The function returns the pointer to the object array of bytes representing
+ * the string it contains, that may be a pointer to 'llbuf' or to the
+ * internal object representation. As a side effect 'len' is filled with
+ * the length of such buffer.
+ *
+ * If the source object is NULL the function is guaranteed to return NULL
+ * and set 'len' to 0. */
+unsigned char *getObjectReadOnlyString(robj *o, long *len, char *llbuf) {
+    serverAssert(o->type == OBJ_STRING);
+    unsigned char *p = NULL;
+
+    /* Set the 'p' pointer to the string, that can be just a stack allocated
+     * array if our string was integer encoded. */
+    if (o && o->encoding == OBJ_ENCODING_INT) {
+        p = (unsigned char*) llbuf;
+        if (len) *len = ll2string(llbuf,LONG_STR_SIZE,(long)o->ptr);
+    } else if (o) {
+        p = (unsigned char*) o->ptr;
+        if (len) *len = sdslen(o->ptr);
+    } else {
+        if (len) *len = 0;
+    }
+    return p;
+}
+
+/* SETBIT key offset bitvalue */
+void setbitCommand(client *c) {
+    robj *o;
+    char *err = "bit is not an integer or out of range";
+    uint64_t bitoffset;
+    ssize_t byte, bit;
+    int byteval, bitval;
+    long on;
+
+    if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != C_OK)
+        return;
+
+    if (getLongFromObjectOrReply(c,c->argv[3],&on,err) != C_OK)
+        return;
+
+    /* Bits can only be set or cleared... */
+    if (on & ~1) {
+        addReplyError(c,err);
+        return;
+    }
+
+    if ((o = lookupStringForBitCommand(c,bitoffset)) == NULL) return;
+
+    /* Get current values */
+    byte = bitoffset >> 3;
+    byteval = ((uint8_t*)o->ptr)[byte];
+    bit = 7 - (bitoffset & 0x7);
+    bitval = byteval & (1 << bit);
+
+    /* Update byte with new bit value and return original value */
+    byteval &= ~(1 << bit);
+    byteval |= ((on & 0x1) << bit);
+    ((uint8_t*)o->ptr)[byte] = byteval;
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_STRING,"setbit",c->argv[1],c->db->id);
+    server.dirty++;
+    addReply(c, bitval ? shared.cone : shared.czero);
+}
+
+/* GETBIT key offset */
+void getbitCommand(client *c) {
+    robj *o;
+    char llbuf[32];
+    uint64_t bitoffset;
+    size_t byte, bit;
+    size_t bitval = 0;
+
+    if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != C_OK)
+        return;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_STRING)) return;
+
+    byte = bitoffset >> 3;
+    bit = 7 - (bitoffset & 0x7);
+    if (sdsEncodedObject(o)) {
+        if (byte < sdslen(o->ptr))
+            bitval = ((uint8_t*)o->ptr)[byte] & (1 << bit);
+    } else {
+        if (byte < (size_t)ll2string(llbuf,sizeof(llbuf),(long)o->ptr))
+            bitval = llbuf[byte] & (1 << bit);
+    }
+
+    addReply(c, bitval ? shared.cone : shared.czero);
+}
+
+/* BITOP op_name target_key src_key1 src_key2 src_key3 ... src_keyN */
+void bitopCommand(client *c) {
+    char *opname = c->argv[1]->ptr;
+    robj *o, *targetkey = c->argv[2];
+    unsigned long op, j, numkeys;
+    robj **objects;      /* Array of source objects. */
+    unsigned char **src; /* Array of source strings pointers. */
+    unsigned long *len, maxlen = 0; /* Array of length of src strings,
+                                       and max len. */
+    unsigned long minlen = 0;    /* Min len among the input keys. */
+    unsigned char *res = NULL; /* Resulting string. */
+
+    /* Parse the operation name. */
+    if ((opname[0] == 'a' || opname[0] == 'A') && !strcasecmp(opname,"and"))
+        op = BITOP_AND;
+    else if((opname[0] == 'o' || opname[0] == 'O') && !strcasecmp(opname,"or"))
+        op = BITOP_OR;
+    else if((opname[0] == 'x' || opname[0] == 'X') && !strcasecmp(opname,"xor"))
+        op = BITOP_XOR;
+    else if((opname[0] == 'n' || opname[0] == 'N') && !strcasecmp(opname,"not"))
+        op = BITOP_NOT;
+    else {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Sanity check: NOT accepts only a single key argument. */
+    if (op == BITOP_NOT && c->argc != 4) {
+        addReplyError(c,"BITOP NOT must be called with a single source key.");
+        return;
+    }
+
+    /* Lookup keys, and store pointers to the string objects into an array. */
+    numkeys = c->argc - 3;
+    src = zmalloc(sizeof(unsigned char*) * numkeys);
+    len = zmalloc(sizeof(long) * numkeys);
+    objects = zmalloc(sizeof(robj*) * numkeys);
+    for (j = 0; j < numkeys; j++) {
+        o = lookupKeyRead(c->db,c->argv[j+3]);
+        /* Handle non-existing keys as empty strings. */
+        if (o == NULL) {
+            objects[j] = NULL;
+            src[j] = NULL;
+            len[j] = 0;
+            minlen = 0;
+            continue;
+        }
+        /* Return an error if one of the keys is not a string. */
+        if (checkType(c,o,OBJ_STRING)) {
+            unsigned long i;
+            for (i = 0; i < j; i++) {
+                if (objects[i])
+                    decrRefCount(objects[i]);
+            }
+            zfree(src);
+            zfree(len);
+            zfree(objects);
+            return;
+        }
+        objects[j] = getDecodedObject(o);
+        src[j] = objects[j]->ptr;
+        len[j] = sdslen(objects[j]->ptr);
+        if (len[j] > maxlen) maxlen = len[j];
+        if (j == 0 || len[j] < minlen) minlen = len[j];
+    }
+
+    /* Compute the bit operation, if at least one string is not empty. */
+    if (maxlen) {
+        res = (unsigned char*) sdsnewlen(NULL,maxlen);
+        unsigned char output, byte;
+        unsigned long i;
+
+        /* Fast path: as far as we have data for all the input bitmaps we
+         * can take a fast path that performs much better than the
+         * vanilla algorithm. On ARM we skip the fast path since it will
+         * result in GCC compiling the code using multiple-words load/store
+         * operations that are not supported even in ARM >= v6. */
+        j = 0;
+        #ifndef USE_ALIGNED_ACCESS
+        if (minlen >= sizeof(unsigned long)*4 && numkeys <= 16) {
+            unsigned long *lp[16];
+            unsigned long *lres = (unsigned long*) res;
+
+            /* Note: sds pointer is always aligned to 8 byte boundary. */
+            memcpy(lp,src,sizeof(unsigned long*)*numkeys);
+            memcpy(res,src[0],minlen);
+
+            /* Different branches per different operations for speed (sorry). */
+            if (op == BITOP_AND) {
+                while(minlen >= sizeof(unsigned long)*4) {
+                    for (i = 1; i < numkeys; i++) {
+                        lres[0] &= lp[i][0];
+                        lres[1] &= lp[i][1];
+                        lres[2] &= lp[i][2];
+                        lres[3] &= lp[i][3];
+                        lp[i]+=4;
+                    }
+                    lres+=4;
+                    j += sizeof(unsigned long)*4;
+                    minlen -= sizeof(unsigned long)*4;
+                }
+            } else if (op == BITOP_OR) {
+                while(minlen >= sizeof(unsigned long)*4) {
+                    for (i = 1; i < numkeys; i++) {
+                        lres[0] |= lp[i][0];
+                        lres[1] |= lp[i][1];
+                        lres[2] |= lp[i][2];
+                        lres[3] |= lp[i][3];
+                        lp[i]+=4;
+                    }
+                    lres+=4;
+                    j += sizeof(unsigned long)*4;
+                    minlen -= sizeof(unsigned long)*4;
+                }
+            } else if (op == BITOP_XOR) {
+                while(minlen >= sizeof(unsigned long)*4) {
+                    for (i = 1; i < numkeys; i++) {
+                        lres[0] ^= lp[i][0];
+                        lres[1] ^= lp[i][1];
+                        lres[2] ^= lp[i][2];
+                        lres[3] ^= lp[i][3];
+                        lp[i]+=4;
+                    }
+                    lres+=4;
+                    j += sizeof(unsigned long)*4;
+                    minlen -= sizeof(unsigned long)*4;
+                }
+            } else if (op == BITOP_NOT) {
+                while(minlen >= sizeof(unsigned long)*4) {
+                    lres[0] = ~lres[0];
+                    lres[1] = ~lres[1];
+                    lres[2] = ~lres[2];
+                    lres[3] = ~lres[3];
+                    lres+=4;
+                    j += sizeof(unsigned long)*4;
+                    minlen -= sizeof(unsigned long)*4;
+                }
+            }
+        }
+        #endif
+
+        /* j is set to the next byte to process by the previous loop. */
+        for (; j < maxlen; j++) {
+            output = (len[0] <= j) ? 0 : src[0][j];
+            if (op == BITOP_NOT) output = ~output;
+            for (i = 1; i < numkeys; i++) {
+                int skip = 0;
+                byte = (len[i] <= j) ? 0 : src[i][j];
+                switch(op) {
+                case BITOP_AND:
+                    output &= byte;
+                    skip = (output == 0);
+                    break;
+                case BITOP_OR:
+                    output |= byte;
+                    skip = (output == 0xff);
+                    break;
+                case BITOP_XOR: output ^= byte; break;
+                }
+
+                if (skip) {
+                    break;
+                }
+            }
+            res[j] = output;
+        }
+    }
+    for (j = 0; j < numkeys; j++) {
+        if (objects[j])
+            decrRefCount(objects[j]);
+    }
+    zfree(src);
+    zfree(len);
+    zfree(objects);
+
+    /* Store the computed value into the target key */
+    if (maxlen) {
+        o = createObject(OBJ_STRING,res);
+        setKey(c,c->db,targetkey,o);
+        notifyKeyspaceEvent(NOTIFY_STRING,"set",targetkey,c->db->id);
+        decrRefCount(o);
+        server.dirty++;
+    } else if (dbDelete(c->db,targetkey)) {
+        signalModifiedKey(c,c->db,targetkey);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",targetkey,c->db->id);
+        server.dirty++;
+    }
+    addReplyLongLong(c,maxlen); /* Return the output string length in bytes. */
+}
+
+/* BITCOUNT key [start end] */
+void bitcountCommand(client *c) {
+    robj *o;
+    long start, end, strlen;
+    unsigned char *p;
+    char llbuf[LONG_STR_SIZE];
+
+    /* Lookup, check for type, and return 0 for non existing keys. */
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_STRING)) return;
+    p = getObjectReadOnlyString(o,&strlen,llbuf);
+
+    /* Parse start/end range if any. */
+    if (c->argc == 4) {
+        if (getLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK)
+            return;
+        if (getLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK)
+            return;
+        /* Convert negative indexes */
+        if (start < 0 && end < 0 && start > end) {
+            addReply(c,shared.czero);
+            return;
+        }
+        if (start < 0) start = strlen+start;
+        if (end < 0) end = strlen+end;
+        if (start < 0) start = 0;
+        if (end < 0) end = 0;
+        if (end >= strlen) end = strlen-1;
+    } else if (c->argc == 2) {
+        /* The whole string. */
+        start = 0;
+        end = strlen-1;
+    } else {
+        /* Syntax error. */
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Precondition: end >= 0 && end < strlen, so the only condition where
+     * zero can be returned is: start > end. */
+    if (start > end) {
+        addReply(c,shared.czero);
+    } else {
+        long bytes = end-start+1;
+
+        addReplyLongLong(c,redisPopcount(p+start,bytes));
+    }
+}
+
+/* BITPOS key bit [start [end]] */
+void bitposCommand(client *c) {
+    robj *o;
+    long bit, start, end, strlen;
+    unsigned char *p;
+    char llbuf[LONG_STR_SIZE];
+    int end_given = 0;
+
+    /* Parse the bit argument to understand what we are looking for, set
+     * or clear bits. */
+    if (getLongFromObjectOrReply(c,c->argv[2],&bit,NULL) != C_OK)
+        return;
+    if (bit != 0 && bit != 1) {
+        addReplyError(c, "The bit argument must be 1 or 0.");
+        return;
+    }
+
+    /* If the key does not exist, from our point of view it is an infinite
+     * array of 0 bits. If the user is looking for the fist clear bit return 0,
+     * If the user is looking for the first set bit, return -1. */
+    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
+        addReplyLongLong(c, bit ? -1 : 0);
+        return;
+    }
+    if (checkType(c,o,OBJ_STRING)) return;
+    p = getObjectReadOnlyString(o,&strlen,llbuf);
+
+    /* Parse start/end range if any. */
+    if (c->argc == 4 || c->argc == 5) {
+        if (getLongFromObjectOrReply(c,c->argv[3],&start,NULL) != C_OK)
+            return;
+        if (c->argc == 5) {
+            if (getLongFromObjectOrReply(c,c->argv[4],&end,NULL) != C_OK)
+                return;
+            end_given = 1;
+        } else {
+            end = strlen-1;
+        }
+        /* Convert negative indexes */
+        if (start < 0) start = strlen+start;
+        if (end < 0) end = strlen+end;
+        if (start < 0) start = 0;
+        if (end < 0) end = 0;
+        if (end >= strlen) end = strlen-1;
+    } else if (c->argc == 3) {
+        /* The whole string. */
+        start = 0;
+        end = strlen-1;
+    } else {
+        /* Syntax error. */
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* For empty ranges (start > end) we return -1 as an empty range does
+     * not contain a 0 nor a 1. */
+    if (start > end) {
+        addReplyLongLong(c, -1);
+    } else {
+        long bytes = end-start+1;
+        long long pos = redisBitpos(p+start,bytes,bit);
+
+        /* If we are looking for clear bits, and the user specified an exact
+         * range with start-end, we can't consider the right of the range as
+         * zero padded (as we do when no explicit end is given).
+         *
+         * So if redisBitpos() returns the first bit outside the range,
+         * we return -1 to the caller, to mean, in the specified range there
+         * is not a single "0" bit. */
+        if (end_given && bit == 0 && pos == (long long)bytes<<3) {
+            addReplyLongLong(c,-1);
+            return;
+        }
+        if (pos != -1) pos += (long long)start<<3; /* Adjust for the bytes we skipped. */
+        addReplyLongLong(c,pos);
+    }
+}
+
+/* BITFIELD key subcommmand-1 arg ... subcommand-2 arg ... subcommand-N ...
+ *
+ * Supported subcommands:
+ *
+ * GET <type> <offset>
+ * SET <type> <offset> <value>
+ * INCRBY <type> <offset> <increment>
+ * OVERFLOW [WRAP|SAT|FAIL]
+ */
+
+#define BITFIELD_FLAG_NONE      0
+#define BITFIELD_FLAG_READONLY  (1<<0)
+
+struct bitfieldOp {
+    uint64_t offset;    /* Bitfield offset. */
+    int64_t i64;        /* Increment amount (INCRBY) or SET value */
+    int opcode;         /* Operation id. */
+    int owtype;         /* Overflow type to use. */
+    int bits;           /* Integer bitfield bits width. */
+    int sign;           /* True if signed, otherwise unsigned op. */
+};
+
+/* This implements both the BITFIELD command and the BITFIELD_RO command
+ * when flags is set to BITFIELD_FLAG_READONLY: in this case only the
+ * GET subcommand is allowed, other subcommands will return an error. */
+void bitfieldGeneric(client *c, int flags) {
+    robj *o;
+    uint64_t bitoffset;
+    int j, numops = 0, changes = 0;
+    struct bitfieldOp *ops = NULL; /* Array of ops to execute at end. */
+    int owtype = BFOVERFLOW_WRAP; /* Overflow type. */
+    int readonly = 1;
+    uint64_t highest_write_offset = 0;
+
+    for (j = 2; j < c->argc; j++) {
+        int remargs = c->argc-j-1; /* Remaining args other than current. */
+        char *subcmd = c->argv[j]->ptr; /* Current command name. */
+        int opcode; /* Current operation code. */
+        long long i64 = 0;  /* Signed SET value. */
+        int sign = 0; /* Signed or unsigned type? */
+        int bits = 0; /* Bitfield width in bits. */
+
+        if (!strcasecmp(subcmd,"get") && remargs >= 2)
+            opcode = BITFIELDOP_GET;
+        else if (!strcasecmp(subcmd,"set") && remargs >= 3)
+            opcode = BITFIELDOP_SET;
+        else if (!strcasecmp(subcmd,"incrby") && remargs >= 3)
+            opcode = BITFIELDOP_INCRBY;
+        else if (!strcasecmp(subcmd,"overflow") && remargs >= 1) {
+            char *owtypename = c->argv[j+1]->ptr;
+            j++;
+            if (!strcasecmp(owtypename,"wrap"))
+                owtype = BFOVERFLOW_WRAP;
+            else if (!strcasecmp(owtypename,"sat"))
+                owtype = BFOVERFLOW_SAT;
+            else if (!strcasecmp(owtypename,"fail"))
+                owtype = BFOVERFLOW_FAIL;
+            else {
+                addReplyError(c,"Invalid OVERFLOW type specified");
+                zfree(ops);
+                return;
+            }
+            continue;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            zfree(ops);
+            return;
+        }
+
+        /* Get the type and offset arguments, common to all the ops. */
+        if (getBitfieldTypeFromArgument(c,c->argv[j+1],&sign,&bits) != C_OK) {
+            zfree(ops);
+            return;
+        }
+
+        if (getBitOffsetFromArgument(c,c->argv[j+2],&bitoffset,1,bits) != C_OK){
+            zfree(ops);
+            return;
+        }
+
+        if (opcode != BITFIELDOP_GET) {
+            readonly = 0;
+            if (highest_write_offset < bitoffset + bits - 1)
+                highest_write_offset = bitoffset + bits - 1;
+            /* INCRBY and SET require another argument. */
+            if (getLongLongFromObjectOrReply(c,c->argv[j+3],&i64,NULL) != C_OK){
+                zfree(ops);
+                return;
+            }
+        }
+
+        /* Populate the array of operations we'll process. */
+        ops = zrealloc(ops,sizeof(*ops)*(numops+1));
+        ops[numops].offset = bitoffset;
+        ops[numops].i64 = i64;
+        ops[numops].opcode = opcode;
+        ops[numops].owtype = owtype;
+        ops[numops].bits = bits;
+        ops[numops].sign = sign;
+        numops++;
+
+        j += 3 - (opcode == BITFIELDOP_GET);
+    }
+
+    if (readonly) {
+        /* Lookup for read is ok if key doesn't exit, but errors
+         * if it's not a string. */
+        o = lookupKeyRead(c->db,c->argv[1]);
+        if (o != NULL && checkType(c,o,OBJ_STRING)) {
+            zfree(ops);
+            return;
+        }
+    } else {
+        if (flags & BITFIELD_FLAG_READONLY) {
+            zfree(ops);
+            addReplyError(c, "BITFIELD_RO only supports the GET subcommand");
+            return;
+        }
+
+        /* Lookup by making room up to the farest bit reached by
+         * this operation. */
+        if ((o = lookupStringForBitCommand(c,
+            highest_write_offset)) == NULL) {
+            zfree(ops);
+            return;
+        }
+    }
+
+    addReplyArrayLen(c,numops);
+
+    /* Actually process the operations. */
+    for (j = 0; j < numops; j++) {
+        struct bitfieldOp *thisop = ops+j;
+
+        /* Execute the operation. */
+        if (thisop->opcode == BITFIELDOP_SET ||
+            thisop->opcode == BITFIELDOP_INCRBY)
+        {
+            /* SET and INCRBY: We handle both with the same code path
+             * for simplicity. SET return value is the previous value so
+             * we need fetch & store as well. */
+
+            /* We need two different but very similar code paths for signed
+             * and unsigned operations, since the set of functions to get/set
+             * the integers and the used variables types are different. */
+            if (thisop->sign) {
+                int64_t oldval, newval, wrapped, retval;
+                int overflow;
+
+                oldval = getSignedBitfield(o->ptr,thisop->offset,
+                        thisop->bits);
+
+                if (thisop->opcode == BITFIELDOP_INCRBY) {
+                    newval = oldval + thisop->i64;
+                    overflow = checkSignedBitfieldOverflow(oldval,
+                            thisop->i64,thisop->bits,thisop->owtype,&wrapped);
+                    if (overflow) newval = wrapped;
+                    retval = newval;
+                } else {
+                    newval = thisop->i64;
+                    overflow = checkSignedBitfieldOverflow(newval,
+                            0,thisop->bits,thisop->owtype,&wrapped);
+                    if (overflow) newval = wrapped;
+                    retval = oldval;
+                }
+
+                /* On overflow of type is "FAIL", don't write and return
+                 * NULL to signal the condition. */
+                if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {
+                    addReplyLongLong(c,retval);
+                    setSignedBitfield(o->ptr,thisop->offset,
+                                      thisop->bits,newval);
+                } else {
+                    addReplyNull(c);
+                }
+            } else {
+                uint64_t oldval, newval, wrapped, retval;
+                int overflow;
+
+                oldval = getUnsignedBitfield(o->ptr,thisop->offset,
+                        thisop->bits);
+
+                if (thisop->opcode == BITFIELDOP_INCRBY) {
+                    newval = oldval + thisop->i64;
+                    overflow = checkUnsignedBitfieldOverflow(oldval,
+                            thisop->i64,thisop->bits,thisop->owtype,&wrapped);
+                    if (overflow) newval = wrapped;
+                    retval = newval;
+                } else {
+                    newval = thisop->i64;
+                    overflow = checkUnsignedBitfieldOverflow(newval,
+                            0,thisop->bits,thisop->owtype,&wrapped);
+                    if (overflow) newval = wrapped;
+                    retval = oldval;
+                }
+                /* On overflow of type is "FAIL", don't write and return
+                 * NULL to signal the condition. */
+                if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {
+                    addReplyLongLong(c,retval);
+                    setUnsignedBitfield(o->ptr,thisop->offset,
+                                        thisop->bits,newval);
+                } else {
+                    addReplyNull(c);
+                }
+            }
+            changes++;
+        } else {
+            /* GET */
+            unsigned char buf[9];
+            long strlen = 0;
+            unsigned char *src = NULL;
+            char llbuf[LONG_STR_SIZE];
+
+            if (o != NULL)
+                src = getObjectReadOnlyString(o,&strlen,llbuf);
+
+            /* For GET we use a trick: before executing the operation
+             * copy up to 9 bytes to a local buffer, so that we can easily
+             * execute up to 64 bit operations that are at actual string
+             * object boundaries. */
+            memset(buf,0,9);
+            int i;
+            uint64_t byte = thisop->offset >> 3;
+            for (i = 0; i < 9; i++) {
+                if (src == NULL || i+byte >= (uint64_t)strlen) break;
+                buf[i] = src[i+byte];
+            }
+
+            /* Now operate on the copied buffer which is guaranteed
+             * to be zero-padded. */
+            if (thisop->sign) {
+                int64_t val = getSignedBitfield(buf,thisop->offset-(byte*8),
+                                            thisop->bits);
+                addReplyLongLong(c,val);
+            } else {
+                uint64_t val = getUnsignedBitfield(buf,thisop->offset-(byte*8),
+                                            thisop->bits);
+                addReplyLongLong(c,val);
+            }
+        }
+    }
+
+    if (changes) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_STRING,"setbit",c->argv[1],c->db->id);
+        server.dirty += changes;
+    }
+    zfree(ops);
+}
+
+void bitfieldCommand(client *c) {
+    bitfieldGeneric(c, BITFIELD_FLAG_NONE);
+}
+
+void bitfieldroCommand(client *c) {
+    bitfieldGeneric(c, BITFIELD_FLAG_READONLY);
+}
diff --git a/redis-stable/src/blocked.c b/redis-stable/src/blocked.c
new file mode 100644
index 00000000..df3b6a92
--- /dev/null
+++ b/redis-stable/src/blocked.c
@@ -0,0 +1,768 @@
+/* blocked.c - generic support for blocking operations like BLPOP & WAIT.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ---------------------------------------------------------------------------
+ *
+ * API:
+ *
+ * blockClient() set the CLIENT_BLOCKED flag in the client, and set the
+ * specified block type 'btype' filed to one of BLOCKED_* macros.
+ *
+ * unblockClient() unblocks the client doing the following:
+ * 1) It calls the btype-specific function to cleanup the state.
+ * 2) It unblocks the client by unsetting the CLIENT_BLOCKED flag.
+ * 3) It puts the client into a list of just unblocked clients that are
+ *    processed ASAP in the beforeSleep() event loop callback, so that
+ *    if there is some query buffer to process, we do it. This is also
+ *    required because otherwise there is no 'readable' event fired, we
+ *    already read the pending commands. We also set the CLIENT_UNBLOCKED
+ *    flag to remember the client is in the unblocked_clients list.
+ *
+ * processUnblockedClients() is called inside the beforeSleep() function
+ * to process the query buffer from unblocked clients and remove the clients
+ * from the blocked_clients queue.
+ *
+ * replyToBlockedClientTimedOut() is called by the cron function when
+ * a client blocked reaches the specified timeout (if the timeout is set
+ * to 0, no timeout is processed).
+ * It usually just needs to send a reply to the client.
+ *
+ * When implementing a new type of blocking operation, the implementation
+ * should modify unblockClient() and replyToBlockedClientTimedOut() in order
+ * to handle the btype-specific behavior of this two functions.
+ * If the blocking operation waits for certain keys to change state, the
+ * clusterRedirectBlockedClientIfNeeded() function should also be updated.
+ */
+
+#include "server.h"
+#include "slowlog.h"
+#include "latency.h"
+#include "monotonic.h"
+
+int serveClientBlockedOnList(client *receiver, robj *key, robj *dstkey, redisDb *db, robj *value, int wherefrom, int whereto);
+int getListPositionFromObjectOrReply(client *c, robj *arg, int *position);
+
+/* This structure represents the blocked key information that we store
+ * in the client structure. Each client blocked on keys, has a
+ * client->bpop.keys hash table. The keys of the hash table are Redis
+ * keys pointers to 'robj' structures. The value is this structure.
+ * The structure has two goals: firstly we store the list node that this
+ * client uses to be listed in the database "blocked clients for this key"
+ * list, so we can later unblock in O(1) without a list scan.
+ * Secondly for certain blocking types, we have additional info. Right now
+ * the only use for additional info we have is when clients are blocked
+ * on streams, as we have to remember the ID it blocked for. */
+typedef struct bkinfo {
+    listNode *listnode;     /* List node for db->blocking_keys[key] list. */
+    streamID stream_id;     /* Stream ID if we blocked in a stream. */
+} bkinfo;
+
+/* Block a client for the specific operation type. Once the CLIENT_BLOCKED
+ * flag is set client query buffer is not longer processed, but accumulated,
+ * and will be processed when the client is unblocked. */
+void blockClient(client *c, int btype) {
+    /* Master client should never be blocked unless pause or module */
+    serverAssert(!(c->flags & CLIENT_MASTER &&
+                   btype != BLOCKED_MODULE &&
+                   btype != BLOCKED_PAUSE));
+
+    c->flags |= CLIENT_BLOCKED;
+    c->btype = btype;
+    server.blocked_clients++;
+    server.blocked_clients_by_type[btype]++;
+    addClientToTimeoutTable(c);
+    if (btype == BLOCKED_PAUSE) {
+        listAddNodeTail(server.paused_clients, c);
+        c->paused_list_node = listLast(server.paused_clients);
+        /* Mark this client to execute its command */
+        c->flags |= CLIENT_PENDING_COMMAND;
+    }
+}
+
+/* This function is called after a client has finished a blocking operation
+ * in order to update the total command duration, log the command into
+ * the Slow log if needed, and log the reply duration event if needed. */
+void updateStatsOnUnblock(client *c, long blocked_us, long reply_us){
+    const ustime_t total_cmd_duration = c->duration + blocked_us + reply_us;
+    c->lastcmd->microseconds += total_cmd_duration;
+
+    /* Log the command into the Slow log if needed. */
+    slowlogPushCurrentCommand(c, c->lastcmd, total_cmd_duration);
+    /* Log the reply duration event. */
+    latencyAddSampleIfNeeded("command-unblocking",reply_us/1000);
+}
+
+/* This function is called in the beforeSleep() function of the event loop
+ * in order to process the pending input buffer of clients that were
+ * unblocked after a blocking operation. */
+void processUnblockedClients(void) {
+    listNode *ln;
+    client *c;
+
+    while (listLength(server.unblocked_clients)) {
+        ln = listFirst(server.unblocked_clients);
+        serverAssert(ln != NULL);
+        c = ln->value;
+        listDelNode(server.unblocked_clients,ln);
+        c->flags &= ~CLIENT_UNBLOCKED;
+
+        /* Process remaining data in the input buffer, unless the client
+         * is blocked again. Actually processInputBuffer() checks that the
+         * client is not blocked before to proceed, but things may change and
+         * the code is conceptually more correct this way. */
+        if (!(c->flags & CLIENT_BLOCKED)) {
+            /* If we have a queued command, execute it now. */
+            if (processPendingCommandsAndResetClient(c) == C_ERR) {
+                continue;
+            }
+            /* Then process client if it has more data in it's buffer. */
+            if (c->querybuf && sdslen(c->querybuf) > 0) {
+                processInputBuffer(c);
+            }
+        }
+    }
+}
+
+/* This function will schedule the client for reprocessing at a safe time.
+ *
+ * This is useful when a client was blocked for some reason (blocking operation,
+ * CLIENT PAUSE, or whatever), because it may end with some accumulated query
+ * buffer that needs to be processed ASAP:
+ *
+ * 1. When a client is blocked, its readable handler is still active.
+ * 2. However in this case it only gets data into the query buffer, but the
+ *    query is not parsed or executed once there is enough to proceed as
+ *    usually (because the client is blocked... so we can't execute commands).
+ * 3. When the client is unblocked, without this function, the client would
+ *    have to write some query in order for the readable handler to finally
+ *    call processQueryBuffer*() on it.
+ * 4. With this function instead we can put the client in a queue that will
+ *    process it for queries ready to be executed at a safe time.
+ */
+void queueClientForReprocessing(client *c) {
+    /* The client may already be into the unblocked list because of a previous
+     * blocking operation, don't add back it into the list multiple times. */
+    if (!(c->flags & CLIENT_UNBLOCKED)) {
+        c->flags |= CLIENT_UNBLOCKED;
+        listAddNodeTail(server.unblocked_clients,c);
+    }
+}
+
+/* Unblock a client calling the right function depending on the kind
+ * of operation the client is blocking for. */
+void unblockClient(client *c) {
+    if (c->btype == BLOCKED_LIST ||
+        c->btype == BLOCKED_ZSET ||
+        c->btype == BLOCKED_STREAM) {
+        unblockClientWaitingData(c);
+    } else if (c->btype == BLOCKED_WAIT) {
+        unblockClientWaitingReplicas(c);
+    } else if (c->btype == BLOCKED_MODULE) {
+        if (moduleClientIsBlockedOnKeys(c)) unblockClientWaitingData(c);
+        unblockClientFromModule(c);
+    } else if (c->btype == BLOCKED_PAUSE) {
+        listDelNode(server.paused_clients,c->paused_list_node);
+        c->paused_list_node = NULL;
+    } else {
+        serverPanic("Unknown btype in unblockClient().");
+    }
+
+    /* Reset the client for a new query since, for blocking commands
+     * we do not do it immediately after the command returns (when the
+     * client got blocked) in order to be still able to access the argument
+     * vector from module callbacks and updateStatsOnUnblock. */
+    if (c->btype != BLOCKED_PAUSE) {
+        freeClientOriginalArgv(c);
+        resetClient(c);
+    }
+
+    /* Clear the flags, and put the client in the unblocked list so that
+     * we'll process new commands in its query buffer ASAP. */
+    server.blocked_clients--;
+    server.blocked_clients_by_type[c->btype]--;
+    c->flags &= ~CLIENT_BLOCKED;
+    c->btype = BLOCKED_NONE;
+    removeClientFromTimeoutTable(c);
+    queueClientForReprocessing(c);
+}
+
+/* This function gets called when a blocked client timed out in order to
+ * send it a reply of some kind. After this function is called,
+ * unblockClient() will be called with the same client as argument. */
+void replyToBlockedClientTimedOut(client *c) {
+    if (c->btype == BLOCKED_LIST ||
+        c->btype == BLOCKED_ZSET ||
+        c->btype == BLOCKED_STREAM) {
+        addReplyNullArray(c);
+    } else if (c->btype == BLOCKED_WAIT) {
+        addReplyLongLong(c,replicationCountAcksByOffset(c->bpop.reploffset));
+    } else if (c->btype == BLOCKED_MODULE) {
+        moduleBlockedClientTimedOut(c);
+    } else {
+        serverPanic("Unknown btype in replyToBlockedClientTimedOut().");
+    }
+}
+
+/* Mass-unblock clients because something changed in the instance that makes
+ * blocking no longer safe. For example clients blocked in list operations
+ * in an instance which turns from master to slave is unsafe, so this function
+ * is called when a master turns into a slave.
+ *
+ * The semantics is to send an -UNBLOCKED error to the client, disconnecting
+ * it at the same time. */
+void disconnectAllBlockedClients(void) {
+    listNode *ln;
+    listIter li;
+
+    listRewind(server.clients,&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+
+        if (c->flags & CLIENT_BLOCKED) {
+            /* PAUSED clients are an exception, when they'll be unblocked, the
+             * command processing will start from scratch, and the command will
+             * be either executed or rejected. (unlike LIST blocked clients for
+             * which the command is already in progress in a way. */
+            if (c->btype == BLOCKED_PAUSE)
+                continue;
+
+            addReplyError(c,
+                "-UNBLOCKED force unblock from blocking operation, "
+                "instance state changed (master -> replica?)");
+            unblockClient(c);
+            c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+        }
+    }
+}
+
+/* Helper function for handleClientsBlockedOnKeys(). This function is called
+ * when there may be clients blocked on a list key, and there may be new
+ * data to fetch (the key is ready). */
+void serveClientsBlockedOnListKey(robj *o, readyList *rl) {
+    /* We serve clients in the same order they blocked for
+     * this key, from the first blocked to the last. */
+    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
+    if (de) {
+        list *clients = dictGetVal(de);
+        int numclients = listLength(clients);
+
+        while(numclients--) {
+            listNode *clientnode = listFirst(clients);
+            client *receiver = clientnode->value;
+
+            if (receiver->btype != BLOCKED_LIST) {
+                /* Put at the tail, so that at the next call
+                 * we'll not run into it again. */
+                listRotateHeadToTail(clients);
+                continue;
+            }
+
+            robj *dstkey = receiver->bpop.target;
+            int wherefrom = receiver->bpop.listpos.wherefrom;
+            int whereto = receiver->bpop.listpos.whereto;
+            robj *value = listTypePop(o, wherefrom);
+
+            if (value) {
+                /* Protect receiver->bpop.target, that will be
+                 * freed by the next unblockClient()
+                 * call. */
+                if (dstkey) incrRefCount(dstkey);
+
+                monotime replyTimer;
+                elapsedStart(&replyTimer);
+                if (serveClientBlockedOnList(receiver,
+                    rl->key,dstkey,rl->db,value,
+                    wherefrom, whereto) == C_ERR)
+                {
+                    /* If we failed serving the client we need
+                     * to also undo the POP operation. */
+                    listTypePush(o,value,wherefrom);
+                }
+                updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
+                unblockClient(receiver);
+
+                if (dstkey) decrRefCount(dstkey);
+                decrRefCount(value);
+            } else {
+                break;
+            }
+        }
+    }
+
+    if (listTypeLength(o) == 0) {
+        dbDelete(rl->db,rl->key);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",rl->key,rl->db->id);
+    }
+    /* We don't call signalModifiedKey() as it was already called
+     * when an element was pushed on the list. */
+}
+
+/* Helper function for handleClientsBlockedOnKeys(). This function is called
+ * when there may be clients blocked on a sorted set key, and there may be new
+ * data to fetch (the key is ready). */
+void serveClientsBlockedOnSortedSetKey(robj *o, readyList *rl) {
+    /* We serve clients in the same order they blocked for
+     * this key, from the first blocked to the last. */
+    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
+    if (de) {
+        list *clients = dictGetVal(de);
+        int numclients = listLength(clients);
+        unsigned long zcard = zsetLength(o);
+
+        while(numclients-- && zcard) {
+            listNode *clientnode = listFirst(clients);
+            client *receiver = clientnode->value;
+
+            if (receiver->btype != BLOCKED_ZSET) {
+                /* Put at the tail, so that at the next call
+                 * we'll not run into it again. */
+                listRotateHeadToTail(clients);
+                continue;
+            }
+
+            int where = (receiver->lastcmd &&
+                         receiver->lastcmd->proc == bzpopminCommand)
+                         ? ZSET_MIN : ZSET_MAX;
+            monotime replyTimer;
+            elapsedStart(&replyTimer);
+            genericZpopCommand(receiver,&rl->key,1,where,1,NULL);
+            updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
+            unblockClient(receiver);
+            zcard--;
+
+            /* Replicate the command. */
+            robj *argv[2];
+            struct redisCommand *cmd = where == ZSET_MIN ?
+                                       server.zpopminCommand :
+                                       server.zpopmaxCommand;
+            argv[0] = createStringObject(cmd->name,strlen(cmd->name));
+            argv[1] = rl->key;
+            incrRefCount(rl->key);
+            propagate(cmd,receiver->db->id,
+                      argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
+            decrRefCount(argv[0]);
+            decrRefCount(argv[1]);
+        }
+    }
+}
+
+/* Helper function for handleClientsBlockedOnKeys(). This function is called
+ * when there may be clients blocked on a stream key, and there may be new
+ * data to fetch (the key is ready). */
+void serveClientsBlockedOnStreamKey(robj *o, readyList *rl) {
+    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
+    stream *s = o->ptr;
+
+    /* We need to provide the new data arrived on the stream
+     * to all the clients that are waiting for an offset smaller
+     * than the current top item. */
+    if (de) {
+        list *clients = dictGetVal(de);
+        listNode *ln;
+        listIter li;
+        listRewind(clients,&li);
+
+        while((ln = listNext(&li))) {
+            client *receiver = listNodeValue(ln);
+            if (receiver->btype != BLOCKED_STREAM) continue;
+            bkinfo *bki = dictFetchValue(receiver->bpop.keys,rl->key);
+            streamID *gt = &bki->stream_id;
+
+            /* If we blocked in the context of a consumer
+             * group, we need to resolve the group and update the
+             * last ID the client is blocked for: this is needed
+             * because serving other clients in the same consumer
+             * group will alter the "last ID" of the consumer
+             * group, and clients blocked in a consumer group are
+             * always blocked for the ">" ID: we need to deliver
+             * only new messages and avoid unblocking the client
+             * otherwise. */
+            streamCG *group = NULL;
+            if (receiver->bpop.xread_group) {
+                group = streamLookupCG(s,
+                        receiver->bpop.xread_group->ptr);
+                /* If the group was not found, send an error
+                 * to the consumer. */
+                if (!group) {
+                    addReplyError(receiver,
+                        "-NOGROUP the consumer group this client "
+                        "was blocked on no longer exists");
+                    unblockClient(receiver);
+                    continue;
+                } else {
+                    *gt = group->last_id;
+                }
+            }
+
+            if (streamCompareID(&s->last_id, gt) > 0) {
+                streamID start = *gt;
+                streamIncrID(&start);
+
+                /* Lookup the consumer for the group, if any. */
+                streamConsumer *consumer = NULL;
+                int noack = 0;
+
+                if (group) {
+                    int created = 0;
+                    consumer =
+                        streamLookupConsumer(group,
+                                             receiver->bpop.xread_consumer->ptr,
+                                             SLC_NONE,
+                                             &created);
+                    noack = receiver->bpop.xread_group_noack;
+                    if (created && noack) {
+                        streamPropagateConsumerCreation(receiver,rl->key,
+                                                        receiver->bpop.xread_group,
+                                                        consumer->name);
+                    }
+                }
+
+                monotime replyTimer;
+                elapsedStart(&replyTimer);
+                /* Emit the two elements sub-array consisting of
+                 * the name of the stream and the data we
+                 * extracted from it. Wrapped in a single-item
+                 * array, since we have just one key. */
+                if (receiver->resp == 2) {
+                    addReplyArrayLen(receiver,1);
+                    addReplyArrayLen(receiver,2);
+                } else {
+                    addReplyMapLen(receiver,1);
+                }
+                addReplyBulk(receiver,rl->key);
+
+                streamPropInfo pi = {
+                    rl->key,
+                    receiver->bpop.xread_group
+                };
+                streamReplyWithRange(receiver,s,&start,NULL,
+                                     receiver->bpop.xread_count,
+                                     0, group, consumer, noack, &pi);
+                updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
+
+                /* Note that after we unblock the client, 'gt'
+                 * and other receiver->bpop stuff are no longer
+                 * valid, so we must do the setup above before
+                 * this call. */
+                unblockClient(receiver);
+            }
+        }
+    }
+}
+
+/* Helper function for handleClientsBlockedOnKeys(). This function is called
+ * in order to check if we can serve clients blocked by modules using
+ * RM_BlockClientOnKeys(), when the corresponding key was signaled as ready:
+ * our goal here is to call the RedisModuleBlockedClient reply() callback to
+ * see if the key is really able to serve the client, and in that case,
+ * unblock it. */
+void serveClientsBlockedOnKeyByModule(readyList *rl) {
+    dictEntry *de;
+
+    /* Optimization: If no clients are in type BLOCKED_MODULE,
+     * we can skip this loop. */
+    if (!server.blocked_clients_by_type[BLOCKED_MODULE]) return;
+
+    /* We serve clients in the same order they blocked for
+     * this key, from the first blocked to the last. */
+    de = dictFind(rl->db->blocking_keys,rl->key);
+    if (de) {
+        list *clients = dictGetVal(de);
+        int numclients = listLength(clients);
+
+        while(numclients--) {
+            listNode *clientnode = listFirst(clients);
+            client *receiver = clientnode->value;
+
+            /* Put at the tail, so that at the next call
+             * we'll not run into it again: clients here may not be
+             * ready to be served, so they'll remain in the list
+             * sometimes. We want also be able to skip clients that are
+             * not blocked for the MODULE type safely. */
+            listRotateHeadToTail(clients);
+
+            if (receiver->btype != BLOCKED_MODULE) continue;
+
+            /* Note that if *this* client cannot be served by this key,
+             * it does not mean that another client that is next into the
+             * list cannot be served as well: they may be blocked by
+             * different modules with different triggers to consider if a key
+             * is ready or not. This means we can't exit the loop but need
+             * to continue after the first failure. */
+            monotime replyTimer;
+            elapsedStart(&replyTimer);
+            if (!moduleTryServeClientBlockedOnKey(receiver, rl->key)) continue;
+            updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
+
+            moduleUnblockClient(receiver);
+        }
+    }
+}
+
+/* This function should be called by Redis every time a single command,
+ * a MULTI/EXEC block, or a Lua script, terminated its execution after
+ * being called by a client. It handles serving clients blocked in
+ * lists, streams, and sorted sets, via a blocking commands.
+ *
+ * All the keys with at least one client blocked that received at least
+ * one new element via some write operation are accumulated into
+ * the server.ready_keys list. This function will run the list and will
+ * serve clients accordingly. Note that the function will iterate again and
+ * again as a result of serving BLMOVE we can have new blocking clients
+ * to serve because of the PUSH side of BLMOVE.
+ *
+ * This function is normally "fair", that is, it will server clients
+ * using a FIFO behavior. However this fairness is violated in certain
+ * edge cases, that is, when we have clients blocked at the same time
+ * in a sorted set and in a list, for the same key (a very odd thing to
+ * do client side, indeed!). Because mismatching clients (blocking for
+ * a different type compared to the current key type) are moved in the
+ * other side of the linked list. However as long as the key starts to
+ * be used only for a single type, like virtually any Redis application will
+ * do, the function is already fair. */
+void handleClientsBlockedOnKeys(void) {
+    while(listLength(server.ready_keys) != 0) {
+        list *l;
+
+        /* Point server.ready_keys to a fresh list and save the current one
+         * locally. This way as we run the old list we are free to call
+         * signalKeyAsReady() that may push new elements in server.ready_keys
+         * when handling clients blocked into BLMOVE. */
+        l = server.ready_keys;
+        server.ready_keys = listCreate();
+
+        while(listLength(l) != 0) {
+            listNode *ln = listFirst(l);
+            readyList *rl = ln->value;
+
+            /* First of all remove this key from db->ready_keys so that
+             * we can safely call signalKeyAsReady() against this key. */
+            dictDelete(rl->db->ready_keys,rl->key);
+
+            /* Even if we are not inside call(), increment the call depth
+             * in order to make sure that keys are expired against a fixed
+             * reference time, and not against the wallclock time. This
+             * way we can lookup an object multiple times (BLMOVE does
+             * that) without the risk of it being freed in the second
+             * lookup, invalidating the first one.
+             * See https://github.com/redis/redis/pull/6554. */
+            server.fixed_time_expire++;
+            updateCachedTime(0);
+
+            /* Serve clients blocked on the key. */
+            robj *o = lookupKeyWrite(rl->db,rl->key);
+
+            if (o != NULL) {
+                if (o->type == OBJ_LIST)
+                    serveClientsBlockedOnListKey(o,rl);
+                else if (o->type == OBJ_ZSET)
+                    serveClientsBlockedOnSortedSetKey(o,rl);
+                else if (o->type == OBJ_STREAM)
+                    serveClientsBlockedOnStreamKey(o,rl);
+                /* We want to serve clients blocked on module keys
+                 * regardless of the object type: we don't know what the
+                 * module is trying to accomplish right now. */
+                serveClientsBlockedOnKeyByModule(rl);
+            }
+            server.fixed_time_expire--;
+
+            /* Free this item. */
+            decrRefCount(rl->key);
+            zfree(rl);
+            listDelNode(l,ln);
+        }
+        listRelease(l); /* We have the new list on place at this point. */
+    }
+}
+
+/* This is how the current blocking lists/sorted sets/streams work, we use
+ * BLPOP as example, but the concept is the same for other list ops, sorted
+ * sets and XREAD.
+ * - If the user calls BLPOP and the key exists and contains a non empty list
+ *   then LPOP is called instead. So BLPOP is semantically the same as LPOP
+ *   if blocking is not required.
+ * - If instead BLPOP is called and the key does not exists or the list is
+ *   empty we need to block. In order to do so we remove the notification for
+ *   new data to read in the client socket (so that we'll not serve new
+ *   requests if the blocking request is not served). Also we put the client
+ *   in a dictionary (db->blocking_keys) mapping keys to a list of clients
+ *   blocking for this keys.
+ * - If a PUSH operation against a key with blocked clients waiting is
+ *   performed, we mark this key as "ready", and after the current command,
+ *   MULTI/EXEC block, or script, is executed, we serve all the clients waiting
+ *   for this list, from the one that blocked first, to the last, accordingly
+ *   to the number of elements we have in the ready list.
+ */
+
+/* Set a client in blocking mode for the specified key (list, zset or stream),
+ * with the specified timeout. The 'type' argument is BLOCKED_LIST,
+ * BLOCKED_ZSET or BLOCKED_STREAM depending on the kind of operation we are
+ * waiting for an empty key in order to awake the client. The client is blocked
+ * for all the 'numkeys' keys as in the 'keys' argument. When we block for
+ * stream keys, we also provide an array of streamID structures: clients will
+ * be unblocked only when items with an ID greater or equal to the specified
+ * one is appended to the stream. */
+void blockForKeys(client *c, int btype, robj **keys, int numkeys, mstime_t timeout, robj *target, struct listPos *listpos, streamID *ids) {
+    dictEntry *de;
+    list *l;
+    int j;
+
+    c->bpop.timeout = timeout;
+    c->bpop.target = target;
+
+    if (listpos != NULL) c->bpop.listpos = *listpos;
+
+    if (target != NULL) incrRefCount(target);
+
+    for (j = 0; j < numkeys; j++) {
+        /* Allocate our bkinfo structure, associated to each key the client
+         * is blocked for. */
+        bkinfo *bki = zmalloc(sizeof(*bki));
+        if (btype == BLOCKED_STREAM)
+            bki->stream_id = ids[j];
+
+        /* If the key already exists in the dictionary ignore it. */
+        if (dictAdd(c->bpop.keys,keys[j],bki) != DICT_OK) {
+            zfree(bki);
+            continue;
+        }
+        incrRefCount(keys[j]);
+
+        /* And in the other "side", to map keys -> clients */
+        de = dictFind(c->db->blocking_keys,keys[j]);
+        if (de == NULL) {
+            int retval;
+
+            /* For every key we take a list of clients blocked for it */
+            l = listCreate();
+            retval = dictAdd(c->db->blocking_keys,keys[j],l);
+            incrRefCount(keys[j]);
+            serverAssertWithInfo(c,keys[j],retval == DICT_OK);
+        } else {
+            l = dictGetVal(de);
+        }
+        listAddNodeTail(l,c);
+        bki->listnode = listLast(l);
+    }
+    blockClient(c,btype);
+}
+
+/* Unblock a client that's waiting in a blocking operation such as BLPOP.
+ * You should never call this function directly, but unblockClient() instead. */
+void unblockClientWaitingData(client *c) {
+    dictEntry *de;
+    dictIterator *di;
+    list *l;
+
+    serverAssertWithInfo(c,NULL,dictSize(c->bpop.keys) != 0);
+    di = dictGetIterator(c->bpop.keys);
+    /* The client may wait for multiple keys, so unblock it for every key. */
+    while((de = dictNext(di)) != NULL) {
+        robj *key = dictGetKey(de);
+        bkinfo *bki = dictGetVal(de);
+
+        /* Remove this client from the list of clients waiting for this key. */
+        l = dictFetchValue(c->db->blocking_keys,key);
+        serverAssertWithInfo(c,key,l != NULL);
+        listDelNode(l,bki->listnode);
+        /* If the list is empty we need to remove it to avoid wasting memory */
+        if (listLength(l) == 0)
+            dictDelete(c->db->blocking_keys,key);
+    }
+    dictReleaseIterator(di);
+
+    /* Cleanup the client structure */
+    dictEmpty(c->bpop.keys,NULL);
+    if (c->bpop.target) {
+        decrRefCount(c->bpop.target);
+        c->bpop.target = NULL;
+    }
+    if (c->bpop.xread_group) {
+        decrRefCount(c->bpop.xread_group);
+        decrRefCount(c->bpop.xread_consumer);
+        c->bpop.xread_group = NULL;
+        c->bpop.xread_consumer = NULL;
+    }
+}
+
+static int getBlockedTypeByType(int type) {
+    switch (type) {
+        case OBJ_LIST: return BLOCKED_LIST;
+        case OBJ_ZSET: return BLOCKED_ZSET;
+        case OBJ_MODULE: return BLOCKED_MODULE;
+        case OBJ_STREAM: return BLOCKED_STREAM;
+        default: return BLOCKED_NONE;
+    }
+}
+
+/* If the specified key has clients blocked waiting for list pushes, this
+ * function will put the key reference into the server.ready_keys list.
+ * Note that db->ready_keys is a hash table that allows us to avoid putting
+ * the same key again and again in the list in case of multiple pushes
+ * made by a script or in the context of MULTI/EXEC.
+ *
+ * The list will be finally processed by handleClientsBlockedOnKeys() */
+void signalKeyAsReady(redisDb *db, robj *key, int type) {
+    readyList *rl;
+
+    /* Quick returns. */
+    int btype = getBlockedTypeByType(type);
+    if (btype == BLOCKED_NONE) {
+        /* The type can never block. */
+        return;
+    }
+    if (!server.blocked_clients_by_type[btype] &&
+        !server.blocked_clients_by_type[BLOCKED_MODULE]) {
+        /* No clients block on this type. Note: Blocked modules are represented
+         * by BLOCKED_MODULE, even if the intention is to wake up by normal
+         * types (list, zset, stream), so we need to check that there are no
+         * blocked modules before we do a quick return here. */
+        return;
+    }
+
+    /* No clients blocking for this key? No need to queue it. */
+    if (dictFind(db->blocking_keys,key) == NULL) return;
+
+    /* Key was already signaled? No need to queue it again. */
+    if (dictFind(db->ready_keys,key) != NULL) return;
+
+    /* Ok, we need to queue this key into server.ready_keys. */
+    rl = zmalloc(sizeof(*rl));
+    rl->key = key;
+    rl->db = db;
+    incrRefCount(key);
+    listAddNodeTail(server.ready_keys,rl);
+
+    /* We also add the key in the db->ready_keys dictionary in order
+     * to avoid adding it multiple times into a list with a simple O(1)
+     * check. */
+    incrRefCount(key);
+    serverAssert(dictAdd(db->ready_keys,key,NULL) == DICT_OK);
+}
+
diff --git a/redis-stable/src/childinfo.c b/redis-stable/src/childinfo.c
new file mode 100644
index 00000000..5e94a4f2
--- /dev/null
+++ b/redis-stable/src/childinfo.c
@@ -0,0 +1,173 @@
+/*
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <unistd.h>
+
+typedef struct {
+    size_t keys;
+    size_t cow;
+    monotime cow_updated;
+    double progress;
+    childInfoType information_type; /* Type of information */
+} child_info_data;
+
+/* Open a child-parent channel used in order to move information about the
+ * RDB / AOF saving process from the child to the parent (for instance
+ * the amount of copy on write memory used) */
+void openChildInfoPipe(void) {
+    if (pipe(server.child_info_pipe) == -1) {
+        /* On error our two file descriptors should be still set to -1,
+         * but we call anyway closeChildInfoPipe() since can't hurt. */
+        closeChildInfoPipe();
+    } else if (anetNonBlock(NULL,server.child_info_pipe[0]) != ANET_OK) {
+        closeChildInfoPipe();
+    } else {
+        server.child_info_nread = 0;
+    }
+}
+
+/* Close the pipes opened with openChildInfoPipe(). */
+void closeChildInfoPipe(void) {
+    if (server.child_info_pipe[0] != -1 ||
+        server.child_info_pipe[1] != -1)
+    {
+        close(server.child_info_pipe[0]);
+        close(server.child_info_pipe[1]);
+        server.child_info_pipe[0] = -1;
+        server.child_info_pipe[1] = -1;
+        server.child_info_nread = 0;
+    }
+}
+
+/* Send save data to parent. */
+void sendChildInfoGeneric(childInfoType info_type, size_t keys, double progress, char *pname) {
+    if (server.child_info_pipe[1] == -1) return;
+
+    static monotime cow_updated = 0;
+    static uint64_t cow_update_cost = 0;
+    static size_t cow = 0;
+
+    child_info_data data = {0}; /* zero everything, including padding to satisfy valgrind */
+
+    /* When called to report current info, we need to throttle down CoW updates as they
+     * can be very expensive. To do that, we measure the time it takes to get a reading
+     * and schedule the next reading to happen not before time*CHILD_COW_COST_FACTOR
+     * passes. */
+
+    monotime now = getMonotonicUs();
+    if (info_type != CHILD_INFO_TYPE_CURRENT_INFO ||
+        !cow_updated ||
+        now - cow_updated > cow_update_cost * CHILD_COW_DUTY_CYCLE)
+    {
+        cow = zmalloc_get_private_dirty(-1);
+        cow_updated = getMonotonicUs();
+        cow_update_cost = cow_updated - now;
+
+        if (cow) {
+            serverLog((info_type == CHILD_INFO_TYPE_CURRENT_INFO) ? LL_VERBOSE : LL_NOTICE,
+                      "%s: %zu MB of memory used by copy-on-write",
+                      pname, cow / (1024 * 1024));
+        }
+    }
+
+    data.information_type = info_type;
+    data.keys = keys;
+    data.cow = cow;
+    data.cow_updated = cow_updated;
+    data.progress = progress;
+
+    ssize_t wlen = sizeof(data);
+
+    if (write(server.child_info_pipe[1], &data, wlen) != wlen) {
+        /* Nothing to do on error, this will be detected by the other side. */
+    }
+}
+
+/* Update Child info. */
+void updateChildInfo(childInfoType information_type, size_t cow, monotime cow_updated, size_t keys, double progress) {
+    if (information_type == CHILD_INFO_TYPE_CURRENT_INFO) {
+        server.stat_current_cow_bytes = cow;
+        server.stat_current_cow_updated = cow_updated;
+        server.stat_current_save_keys_processed = keys;
+        if (progress != -1) server.stat_module_progress = progress;
+    } else if (information_type == CHILD_INFO_TYPE_AOF_COW_SIZE) {
+        server.stat_aof_cow_bytes = cow;
+    } else if (information_type == CHILD_INFO_TYPE_RDB_COW_SIZE) {
+        server.stat_rdb_cow_bytes = cow;
+    } else if (information_type == CHILD_INFO_TYPE_MODULE_COW_SIZE) {
+        server.stat_module_cow_bytes = cow;
+    }
+}
+
+/* Read child info data from the pipe.
+ * if complete data read into the buffer, 
+ * data is stored into *buffer, and returns 1.
+ * otherwise, the partial data is left in the buffer, waiting for the next read, and returns 0. */
+int readChildInfo(childInfoType *information_type, size_t *cow, monotime *cow_updated, size_t *keys, double* progress) {
+    /* We are using here a static buffer in combination with the server.child_info_nread to handle short reads */
+    static child_info_data buffer;
+    ssize_t wlen = sizeof(buffer);
+
+    /* Do not overlap */
+    if (server.child_info_nread == wlen) server.child_info_nread = 0;
+
+    int nread = read(server.child_info_pipe[0], (char *)&buffer + server.child_info_nread, wlen - server.child_info_nread);
+    if (nread > 0) {
+        server.child_info_nread += nread;
+    }
+
+    /* We have complete child info */
+    if (server.child_info_nread == wlen) {
+        *information_type = buffer.information_type;
+        *cow = buffer.cow;
+        *cow_updated = buffer.cow_updated;
+        *keys = buffer.keys;
+        *progress = buffer.progress;
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Receive info data from child. */
+void receiveChildInfo(void) {
+    if (server.child_info_pipe[0] == -1) return;
+
+    size_t cow;
+    monotime cow_updated;
+    size_t keys;
+    double progress;
+    childInfoType information_type;
+
+    /* Drain the pipe and update child info so that we get the final message. */
+    while (readChildInfo(&information_type, &cow, &cow_updated, &keys, &progress)) {
+        updateChildInfo(information_type, cow, cow_updated, keys, progress);
+    }
+}
diff --git a/redis-stable/src/cli_common.c b/redis-stable/src/cli_common.c
new file mode 100644
index 00000000..e88327ac
--- /dev/null
+++ b/redis-stable/src/cli_common.c
@@ -0,0 +1,194 @@
+/* CLI (command line interface) common methods
+ * 
+ * Copyright (c) 2020, Redis Labs
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "cli_common.h"
+#include <errno.h>
+#include <hiredis.h>
+#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
+#include <sds.h> /* use sds.h from hiredis, so that only one set of sds functions will be present in the binary */
+#ifdef USE_OPENSSL
+#include <openssl/ssl.h>
+#include <openssl/err.h>
+#include <hiredis_ssl.h>
+#endif
+
+
+/* Wrapper around redisSecureConnection to avoid hiredis_ssl dependencies if
+ * not building with TLS support.
+ */
+int cliSecureConnection(redisContext *c, cliSSLconfig config, const char **err) {
+#ifdef USE_OPENSSL
+    static SSL_CTX *ssl_ctx = NULL;
+
+    if (!ssl_ctx) {
+        ssl_ctx = SSL_CTX_new(SSLv23_client_method());
+        if (!ssl_ctx) {
+            *err = "Failed to create SSL_CTX";
+            goto error;
+        }
+        SSL_CTX_set_options(ssl_ctx, SSL_OP_NO_SSLv2 | SSL_OP_NO_SSLv3);
+        SSL_CTX_set_verify(ssl_ctx, config.skip_cert_verify ? SSL_VERIFY_NONE : SSL_VERIFY_PEER, NULL);
+
+        if (config.cacert || config.cacertdir) {
+            if (!SSL_CTX_load_verify_locations(ssl_ctx, config.cacert, config.cacertdir)) {
+                *err = "Invalid CA Certificate File/Directory";
+                goto error;
+            }
+        } else {
+            if (!SSL_CTX_set_default_verify_paths(ssl_ctx)) {
+                *err = "Failed to use default CA paths";
+                goto error;
+            }
+        }
+
+        if (config.cert && !SSL_CTX_use_certificate_chain_file(ssl_ctx, config.cert)) {
+            *err = "Invalid client certificate";
+            goto error;
+        }
+
+        if (config.key && !SSL_CTX_use_PrivateKey_file(ssl_ctx, config.key, SSL_FILETYPE_PEM)) {
+            *err = "Invalid private key";
+            goto error;
+        }
+        if (config.ciphers && !SSL_CTX_set_cipher_list(ssl_ctx, config.ciphers)) {
+            *err = "Error while configuring ciphers";
+            goto error;
+        }
+#ifdef TLS1_3_VERSION
+        if (config.ciphersuites && !SSL_CTX_set_ciphersuites(ssl_ctx, config.ciphersuites)) {
+            *err = "Error while setting cypher suites";
+            goto error;
+        }
+#endif
+    }
+
+    SSL *ssl = SSL_new(ssl_ctx);
+    if (!ssl) {
+        *err = "Failed to create SSL object";
+        return REDIS_ERR;
+    }
+
+    if (config.sni && !SSL_set_tlsext_host_name(ssl, config.sni)) {
+        *err = "Failed to configure SNI";
+        SSL_free(ssl);
+        return REDIS_ERR;
+    }
+
+    return redisInitiateSSL(c, ssl);
+
+error:
+    SSL_CTX_free(ssl_ctx);
+    ssl_ctx = NULL;
+    return REDIS_ERR;
+#else
+    (void) config;
+    (void) c;
+    (void) err;
+    return REDIS_OK;
+#endif
+}
+
+/* Wrapper around hiredis to allow arbitrary reads and writes.
+ *
+ * We piggybacks on top of hiredis to achieve transparent TLS support,
+ * and use its internal buffers so it can co-exist with commands
+ * previously/later issued on the connection.
+ *
+ * Interface is close to enough to read()/write() so things should mostly
+ * work transparently.
+ */
+
+/* Write a raw buffer through a redisContext. If we already have something
+ * in the buffer (leftovers from hiredis operations) it will be written
+ * as well.
+ */
+ssize_t cliWriteConn(redisContext *c, const char *buf, size_t buf_len)
+{
+    int done = 0;
+
+    /* Append data to buffer which is *usually* expected to be empty
+     * but we don't assume that, and write.
+     */
+    c->obuf = sdscatlen(c->obuf, buf, buf_len);
+    if (redisBufferWrite(c, &done) == REDIS_ERR) {
+        if (!(c->flags & REDIS_BLOCK))
+            errno = EAGAIN;
+
+        /* On error, we assume nothing was written and we roll back the
+         * buffer to its original state.
+         */
+        if (sdslen(c->obuf) > buf_len)
+            sdsrange(c->obuf, 0, -(buf_len+1));
+        else
+            sdsclear(c->obuf);
+
+        return -1;
+    }
+
+    /* If we're done, free up everything. We may have written more than
+     * buf_len (if c->obuf was not initially empty) but we don't have to
+     * tell.
+     */
+    if (done) {
+        sdsclear(c->obuf);
+        return buf_len;
+    }
+
+    /* Write was successful but we have some leftovers which we should
+     * remove from the buffer.
+     *
+     * Do we still have data that was there prior to our buf? If so,
+     * restore buffer to it's original state and report no new data was
+     * writen.
+     */
+    if (sdslen(c->obuf) > buf_len) {
+        sdsrange(c->obuf, 0, -(buf_len+1));
+        return 0;
+    }
+
+    /* At this point we're sure no prior data is left. We flush the buffer
+     * and report how much we've written.
+     */
+    size_t left = sdslen(c->obuf);
+    sdsclear(c->obuf);
+    return buf_len - left;
+}
+
+/* Wrapper around OpenSSL (libssl and libcrypto) initialisation
+ */
+int cliSecureInit()
+{
+#ifdef USE_OPENSSL
+    ERR_load_crypto_strings();
+    SSL_load_error_strings();
+    SSL_library_init();
+#endif
+    return REDIS_OK;
+}
diff --git a/redis-stable/src/cli_common.h b/redis-stable/src/cli_common.h
new file mode 100644
index 00000000..16d6ec2a
--- /dev/null
+++ b/redis-stable/src/cli_common.h
@@ -0,0 +1,50 @@
+#ifndef __CLICOMMON_H
+#define __CLICOMMON_H
+
+#include <hiredis.h>
+
+typedef struct cliSSLconfig {
+    /* Requested SNI, or NULL */
+    char *sni;
+    /* CA Certificate file, or NULL */
+    char *cacert;
+    /* Directory where trusted CA certificates are stored, or NULL */
+    char *cacertdir;
+    /* Skip server certificate verification. */
+    int skip_cert_verify;
+    /* Client certificate to authenticate with, or NULL */
+    char *cert;
+    /* Private key file to authenticate with, or NULL */
+    char *key;
+    /* Prefered cipher list, or NULL (applies only to <= TLSv1.2) */
+    char* ciphers;
+    /* Prefered ciphersuites list, or NULL (applies only to TLSv1.3) */
+    char* ciphersuites;
+} cliSSLconfig;
+
+/* Wrapper around redisSecureConnection to avoid hiredis_ssl dependencies if
+ * not building with TLS support.
+ */
+int cliSecureConnection(redisContext *c, cliSSLconfig config, const char **err);
+
+/* Wrapper around hiredis to allow arbitrary reads and writes.
+ *
+ * We piggybacks on top of hiredis to achieve transparent TLS support,
+ * and use its internal buffers so it can co-exist with commands
+ * previously/later issued on the connection.
+ *
+ * Interface is close to enough to read()/write() so things should mostly
+ * work transparently.
+ */
+
+/* Write a raw buffer through a redisContext. If we already have something
+ * in the buffer (leftovers from hiredis operations) it will be written
+ * as well.
+ */
+ssize_t cliWriteConn(redisContext *c, const char *buf, size_t buf_len);
+
+/* Wrapper around OpenSSL (libssl and libcrypto) initialisation.
+ */
+int cliSecureInit();
+
+#endif /* __CLICOMMON_H */
diff --git a/redis-stable/src/cluster.c b/redis-stable/src/cluster.c
new file mode 100644
index 00000000..b305353d
--- /dev/null
+++ b/redis-stable/src/cluster.c
@@ -0,0 +1,6032 @@
+/* Redis Cluster implementation.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "cluster.h"
+#include "endianconv.h"
+
+#include <sys/types.h>
+#include <sys/socket.h>
+#include <arpa/inet.h>
+#include <fcntl.h>
+#include <unistd.h>
+#include <sys/stat.h>
+#include <sys/file.h>
+#include <math.h>
+
+/* A global reference to myself is handy to make code more clear.
+ * Myself always points to server.cluster->myself, that is, the clusterNode
+ * that represents this node. */
+clusterNode *myself = NULL;
+
+clusterNode *createClusterNode(char *nodename, int flags);
+void clusterAddNode(clusterNode *node);
+void clusterAcceptHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+void clusterReadHandler(connection *conn);
+void clusterSendPing(clusterLink *link, int type);
+void clusterSendFail(char *nodename);
+void clusterSendFailoverAuthIfNeeded(clusterNode *node, clusterMsg *request);
+void clusterUpdateState(void);
+int clusterNodeGetSlotBit(clusterNode *n, int slot);
+sds clusterGenNodesDescription(int filter, int use_pport);
+clusterNode *clusterLookupNode(const char *name);
+int clusterNodeAddSlave(clusterNode *master, clusterNode *slave);
+int clusterAddSlot(clusterNode *n, int slot);
+int clusterDelSlot(int slot);
+int clusterDelNodeSlots(clusterNode *node);
+int clusterNodeSetSlotBit(clusterNode *n, int slot);
+void clusterSetMaster(clusterNode *n);
+void clusterHandleSlaveFailover(void);
+void clusterHandleSlaveMigration(int max_slaves);
+int bitmapTestBit(unsigned char *bitmap, int pos);
+void clusterDoBeforeSleep(int flags);
+void clusterSendUpdate(clusterLink *link, clusterNode *node);
+void resetManualFailover(void);
+void clusterCloseAllSlots(void);
+void clusterSetNodeAsMaster(clusterNode *n);
+void clusterDelNode(clusterNode *delnode);
+sds representClusterNodeFlags(sds ci, uint16_t flags);
+uint64_t clusterGetMaxEpoch(void);
+int clusterBumpConfigEpochWithoutConsensus(void);
+void moduleCallClusterReceivers(const char *sender_id, uint64_t module_id, uint8_t type, const unsigned char *payload, uint32_t len);
+
+#define RCVBUF_INIT_LEN 1024
+#define RCVBUF_MAX_PREALLOC (1<<20) /* 1MB */
+
+/* -----------------------------------------------------------------------------
+ * Initialization
+ * -------------------------------------------------------------------------- */
+
+/* Load the cluster config from 'filename'.
+ *
+ * If the file does not exist or is zero-length (this may happen because
+ * when we lock the nodes.conf file, we create a zero-length one for the
+ * sake of locking if it does not already exist), C_ERR is returned.
+ * If the configuration was loaded from the file, C_OK is returned. */
+int clusterLoadConfig(char *filename) {
+    FILE *fp = fopen(filename,"r");
+    struct stat sb;
+    char *line;
+    int maxline, j;
+
+    if (fp == NULL) {
+        if (errno == ENOENT) {
+            return C_ERR;
+        } else {
+            serverLog(LL_WARNING,
+                "Loading the cluster node config from %s: %s",
+                filename, strerror(errno));
+            exit(1);
+        }
+    }
+
+    /* Check if the file is zero-length: if so return C_ERR to signal
+     * we have to write the config. */
+    if (fstat(fileno(fp),&sb) != -1 && sb.st_size == 0) {
+        fclose(fp);
+        return C_ERR;
+    }
+
+    /* Parse the file. Note that single lines of the cluster config file can
+     * be really long as they include all the hash slots of the node.
+     * This means in the worst possible case, half of the Redis slots will be
+     * present in a single line, possibly in importing or migrating state, so
+     * together with the node ID of the sender/receiver.
+     *
+     * To simplify we allocate 1024+CLUSTER_SLOTS*128 bytes per line. */
+    maxline = 1024+CLUSTER_SLOTS*128;
+    line = zmalloc(maxline);
+    while(fgets(line,maxline,fp) != NULL) {
+        int argc;
+        sds *argv;
+        clusterNode *n, *master;
+        char *p, *s;
+
+        /* Skip blank lines, they can be created either by users manually
+         * editing nodes.conf or by the config writing process if stopped
+         * before the truncate() call. */
+        if (line[0] == '\n' || line[0] == '\0') continue;
+
+        /* Split the line into arguments for processing. */
+        argv = sdssplitargs(line,&argc);
+        if (argv == NULL) goto fmterr;
+
+        /* Handle the special "vars" line. Don't pretend it is the last
+         * line even if it actually is when generated by Redis. */
+        if (strcasecmp(argv[0],"vars") == 0) {
+            if (!(argc % 2)) goto fmterr;
+            for (j = 1; j < argc; j += 2) {
+                if (strcasecmp(argv[j],"currentEpoch") == 0) {
+                    server.cluster->currentEpoch =
+                            strtoull(argv[j+1],NULL,10);
+                } else if (strcasecmp(argv[j],"lastVoteEpoch") == 0) {
+                    server.cluster->lastVoteEpoch =
+                            strtoull(argv[j+1],NULL,10);
+                } else {
+                    serverLog(LL_WARNING,
+                        "Skipping unknown cluster config variable '%s'",
+                        argv[j]);
+                }
+            }
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* Regular config lines have at least eight fields */
+        if (argc < 8) {
+            sdsfreesplitres(argv,argc);
+            goto fmterr;
+        }
+
+        /* Create this node if it does not exist */
+        n = clusterLookupNode(argv[0]);
+        if (!n) {
+            n = createClusterNode(argv[0],0);
+            clusterAddNode(n);
+        }
+        /* Address and port */
+        if ((p = strrchr(argv[1],':')) == NULL) {
+            sdsfreesplitres(argv,argc);
+            goto fmterr;
+        }
+        *p = '\0';
+        memcpy(n->ip,argv[1],strlen(argv[1])+1);
+        char *port = p+1;
+        char *busp = strchr(port,'@');
+        if (busp) {
+            *busp = '\0';
+            busp++;
+        }
+        n->port = atoi(port);
+        /* In older versions of nodes.conf the "@busport" part is missing.
+         * In this case we set it to the default offset of 10000 from the
+         * base port. */
+        n->cport = busp ? atoi(busp) : n->port + CLUSTER_PORT_INCR;
+
+        /* The plaintext port for client in a TLS cluster (n->pport) is not
+         * stored in nodes.conf. It is received later over the bus protocol. */
+
+        /* Parse flags */
+        p = s = argv[2];
+        while(p) {
+            p = strchr(s,',');
+            if (p) *p = '\0';
+            if (!strcasecmp(s,"myself")) {
+                serverAssert(server.cluster->myself == NULL);
+                myself = server.cluster->myself = n;
+                n->flags |= CLUSTER_NODE_MYSELF;
+            } else if (!strcasecmp(s,"master")) {
+                n->flags |= CLUSTER_NODE_MASTER;
+            } else if (!strcasecmp(s,"slave")) {
+                n->flags |= CLUSTER_NODE_SLAVE;
+            } else if (!strcasecmp(s,"fail?")) {
+                n->flags |= CLUSTER_NODE_PFAIL;
+            } else if (!strcasecmp(s,"fail")) {
+                n->flags |= CLUSTER_NODE_FAIL;
+                n->fail_time = mstime();
+            } else if (!strcasecmp(s,"handshake")) {
+                n->flags |= CLUSTER_NODE_HANDSHAKE;
+            } else if (!strcasecmp(s,"noaddr")) {
+                n->flags |= CLUSTER_NODE_NOADDR;
+            } else if (!strcasecmp(s,"nofailover")) {
+                n->flags |= CLUSTER_NODE_NOFAILOVER;
+            } else if (!strcasecmp(s,"noflags")) {
+                /* nothing to do */
+            } else {
+                serverPanic("Unknown flag in redis cluster config file");
+            }
+            if (p) s = p+1;
+        }
+
+        /* Get master if any. Set the master and populate master's
+         * slave list. */
+        if (argv[3][0] != '-') {
+            master = clusterLookupNode(argv[3]);
+            if (!master) {
+                master = createClusterNode(argv[3],0);
+                clusterAddNode(master);
+            }
+            n->slaveof = master;
+            clusterNodeAddSlave(master,n);
+        }
+
+        /* Set ping sent / pong received timestamps */
+        if (atoi(argv[4])) n->ping_sent = mstime();
+        if (atoi(argv[5])) n->pong_received = mstime();
+
+        /* Set configEpoch for this node. */
+        n->configEpoch = strtoull(argv[6],NULL,10);
+
+        /* Populate hash slots served by this instance. */
+        for (j = 8; j < argc; j++) {
+            int start, stop;
+
+            if (argv[j][0] == '[') {
+                /* Here we handle migrating / importing slots */
+                int slot;
+                char direction;
+                clusterNode *cn;
+
+                p = strchr(argv[j],'-');
+                serverAssert(p != NULL);
+                *p = '\0';
+                direction = p[1]; /* Either '>' or '<' */
+                slot = atoi(argv[j]+1);
+                if (slot < 0 || slot >= CLUSTER_SLOTS) {
+                    sdsfreesplitres(argv,argc);
+                    goto fmterr;
+                }
+                p += 3;
+                cn = clusterLookupNode(p);
+                if (!cn) {
+                    cn = createClusterNode(p,0);
+                    clusterAddNode(cn);
+                }
+                if (direction == '>') {
+                    server.cluster->migrating_slots_to[slot] = cn;
+                } else {
+                    server.cluster->importing_slots_from[slot] = cn;
+                }
+                continue;
+            } else if ((p = strchr(argv[j],'-')) != NULL) {
+                *p = '\0';
+                start = atoi(argv[j]);
+                stop = atoi(p+1);
+            } else {
+                start = stop = atoi(argv[j]);
+            }
+            if (start < 0 || start >= CLUSTER_SLOTS ||
+                stop < 0 || stop >= CLUSTER_SLOTS)
+            {
+                sdsfreesplitres(argv,argc);
+                goto fmterr;
+            }
+            while(start <= stop) clusterAddSlot(n, start++);
+        }
+
+        sdsfreesplitres(argv,argc);
+    }
+    /* Config sanity check */
+    if (server.cluster->myself == NULL) goto fmterr;
+
+    zfree(line);
+    fclose(fp);
+
+    serverLog(LL_NOTICE,"Node configuration loaded, I'm %.40s", myself->name);
+
+    /* Something that should never happen: currentEpoch smaller than
+     * the max epoch found in the nodes configuration. However we handle this
+     * as some form of protection against manual editing of critical files. */
+    if (clusterGetMaxEpoch() > server.cluster->currentEpoch) {
+        server.cluster->currentEpoch = clusterGetMaxEpoch();
+    }
+    return C_OK;
+
+fmterr:
+    serverLog(LL_WARNING,
+        "Unrecoverable error: corrupted cluster config file.");
+    zfree(line);
+    if (fp) fclose(fp);
+    exit(1);
+}
+
+/* Cluster node configuration is exactly the same as CLUSTER NODES output.
+ *
+ * This function writes the node config and returns 0, on error -1
+ * is returned.
+ *
+ * Note: we need to write the file in an atomic way from the point of view
+ * of the POSIX filesystem semantics, so that if the server is stopped
+ * or crashes during the write, we'll end with either the old file or the
+ * new one. Since we have the full payload to write available we can use
+ * a single write to write the whole file. If the pre-existing file was
+ * bigger we pad our payload with newlines that are anyway ignored and truncate
+ * the file afterward. */
+int clusterSaveConfig(int do_fsync) {
+    sds ci;
+    size_t content_size;
+    struct stat sb;
+    int fd;
+
+    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_SAVE_CONFIG;
+
+    /* Get the nodes description and concatenate our "vars" directive to
+     * save currentEpoch and lastVoteEpoch. */
+    ci = clusterGenNodesDescription(CLUSTER_NODE_HANDSHAKE, 0);
+    ci = sdscatprintf(ci,"vars currentEpoch %llu lastVoteEpoch %llu\n",
+        (unsigned long long) server.cluster->currentEpoch,
+        (unsigned long long) server.cluster->lastVoteEpoch);
+    content_size = sdslen(ci);
+
+    if ((fd = open(server.cluster_configfile,O_WRONLY|O_CREAT,0644))
+        == -1) goto err;
+
+    /* Pad the new payload if the existing file length is greater. */
+    if (fstat(fd,&sb) != -1) {
+        if (sb.st_size > (off_t)content_size) {
+            ci = sdsgrowzero(ci,sb.st_size);
+            memset(ci+content_size,'\n',sb.st_size-content_size);
+        }
+    }
+    if (write(fd,ci,sdslen(ci)) != (ssize_t)sdslen(ci)) goto err;
+    if (do_fsync) {
+        server.cluster->todo_before_sleep &= ~CLUSTER_TODO_FSYNC_CONFIG;
+        if (fsync(fd) == -1) goto err;
+    }
+
+    /* Truncate the file if needed to remove the final \n padding that
+     * is just garbage. */
+    if (content_size != sdslen(ci) && ftruncate(fd,content_size) == -1) {
+        /* ftruncate() failing is not a critical error. */
+    }
+    close(fd);
+    sdsfree(ci);
+    return 0;
+
+err:
+    if (fd != -1) close(fd);
+    sdsfree(ci);
+    return -1;
+}
+
+void clusterSaveConfigOrDie(int do_fsync) {
+    if (clusterSaveConfig(do_fsync) == -1) {
+        serverLog(LL_WARNING,"Fatal: can't update cluster config file.");
+        exit(1);
+    }
+}
+
+/* Lock the cluster config using flock(), and leaks the file descriptor used to
+ * acquire the lock so that the file will be locked forever.
+ *
+ * This works because we always update nodes.conf with a new version
+ * in-place, reopening the file, and writing to it in place (later adjusting
+ * the length with ftruncate()).
+ *
+ * On success C_OK is returned, otherwise an error is logged and
+ * the function returns C_ERR to signal a lock was not acquired. */
+int clusterLockConfig(char *filename) {
+/* flock() does not exist on Solaris
+ * and a fcntl-based solution won't help, as we constantly re-open that file,
+ * which will release _all_ locks anyway
+ */
+#if !defined(__sun)
+    /* To lock it, we need to open the file in a way it is created if
+     * it does not exist, otherwise there is a race condition with other
+     * processes. */
+    int fd = open(filename,O_WRONLY|O_CREAT|O_CLOEXEC,0644);
+    if (fd == -1) {
+        serverLog(LL_WARNING,
+            "Can't open %s in order to acquire a lock: %s",
+            filename, strerror(errno));
+        return C_ERR;
+    }
+
+    if (flock(fd,LOCK_EX|LOCK_NB) == -1) {
+        if (errno == EWOULDBLOCK) {
+            serverLog(LL_WARNING,
+                 "Sorry, the cluster configuration file %s is already used "
+                 "by a different Redis Cluster node. Please make sure that "
+                 "different nodes use different cluster configuration "
+                 "files.", filename);
+        } else {
+            serverLog(LL_WARNING,
+                "Impossible to lock %s: %s", filename, strerror(errno));
+        }
+        close(fd);
+        return C_ERR;
+    }
+    /* Lock acquired: leak the 'fd' by not closing it, so that we'll retain the
+     * lock to the file as long as the process exists.
+     *
+     * After fork, the child process will get the fd opened by the parent process,
+     * we need save `fd` to `cluster_config_file_lock_fd`, so that in redisFork(),
+     * it will be closed in the child process.
+     * If it is not closed, when the main process is killed -9, but the child process
+     * (redis-aof-rewrite) is still alive, the fd(lock) will still be held by the
+     * child process, and the main process will fail to get lock, means fail to start. */
+    server.cluster_config_file_lock_fd = fd;
+#else
+    UNUSED(filename);
+#endif /* __sun */
+
+    return C_OK;
+}
+
+/* Derives our ports to be announced in the cluster bus. */
+void deriveAnnouncedPorts(int *announced_port, int *announced_pport,
+                          int *announced_cport) {
+    int port = server.tls_cluster ? server.tls_port : server.port;
+    /* Default announced ports. */
+    *announced_port = port;
+    *announced_pport = server.tls_cluster ? server.port : 0;
+    *announced_cport = port + CLUSTER_PORT_INCR;
+    /* Config overriding announced ports. */
+    if (server.tls_cluster && server.cluster_announce_tls_port) {
+        *announced_port = server.cluster_announce_tls_port;
+        *announced_pport = server.cluster_announce_port;
+    } else if (server.cluster_announce_port) {
+        *announced_port = server.cluster_announce_port;
+    }
+    if (server.cluster_announce_bus_port) {
+        *announced_cport = server.cluster_announce_bus_port;
+    }
+}
+
+/* Some flags (currently just the NOFAILOVER flag) may need to be updated
+ * in the "myself" node based on the current configuration of the node,
+ * that may change at runtime via CONFIG SET. This function changes the
+ * set of flags in myself->flags accordingly. */
+void clusterUpdateMyselfFlags(void) {
+    int oldflags = myself->flags;
+    int nofailover = server.cluster_slave_no_failover ?
+                     CLUSTER_NODE_NOFAILOVER : 0;
+    myself->flags &= ~CLUSTER_NODE_NOFAILOVER;
+    myself->flags |= nofailover;
+    if (myself->flags != oldflags) {
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                             CLUSTER_TODO_UPDATE_STATE);
+    }
+}
+
+void clusterInit(void) {
+    int saveconf = 0;
+
+    server.cluster = zmalloc(sizeof(clusterState));
+    server.cluster->myself = NULL;
+    server.cluster->currentEpoch = 0;
+    server.cluster->state = CLUSTER_FAIL;
+    server.cluster->size = 1;
+    server.cluster->todo_before_sleep = 0;
+    server.cluster->nodes = dictCreate(&clusterNodesDictType,NULL);
+    server.cluster->nodes_black_list =
+        dictCreate(&clusterNodesBlackListDictType,NULL);
+    server.cluster->failover_auth_time = 0;
+    server.cluster->failover_auth_count = 0;
+    server.cluster->failover_auth_rank = 0;
+    server.cluster->failover_auth_epoch = 0;
+    server.cluster->cant_failover_reason = CLUSTER_CANT_FAILOVER_NONE;
+    server.cluster->lastVoteEpoch = 0;
+    for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
+        server.cluster->stats_bus_messages_sent[i] = 0;
+        server.cluster->stats_bus_messages_received[i] = 0;
+    }
+    server.cluster->stats_pfail_nodes = 0;
+    memset(server.cluster->slots,0, sizeof(server.cluster->slots));
+    clusterCloseAllSlots();
+
+    /* Lock the cluster config file to make sure every node uses
+     * its own nodes.conf. */
+    server.cluster_config_file_lock_fd = -1;
+    if (clusterLockConfig(server.cluster_configfile) == C_ERR)
+        exit(1);
+
+    /* Load or create a new nodes configuration. */
+    if (clusterLoadConfig(server.cluster_configfile) == C_ERR) {
+        /* No configuration found. We will just use the random name provided
+         * by the createClusterNode() function. */
+        myself = server.cluster->myself =
+            createClusterNode(NULL,CLUSTER_NODE_MYSELF|CLUSTER_NODE_MASTER);
+        serverLog(LL_NOTICE,"No cluster configuration found, I'm %.40s",
+            myself->name);
+        clusterAddNode(myself);
+        saveconf = 1;
+    }
+    if (saveconf) clusterSaveConfigOrDie(1);
+
+    /* We need a listening TCP port for our cluster messaging needs. */
+    server.cfd.count = 0;
+
+    /* Port sanity check II
+     * The other handshake port check is triggered too late to stop
+     * us from trying to use a too-high cluster port number. */
+    int port = server.tls_cluster ? server.tls_port : server.port;
+    if (port > (65535-CLUSTER_PORT_INCR)) {
+        serverLog(LL_WARNING, "Redis port number too high. "
+                   "Cluster communication port is 10,000 port "
+                   "numbers higher than your Redis port. "
+                   "Your Redis port number must be 55535 or less.");
+        exit(1);
+    }
+    if (listenToPort(port+CLUSTER_PORT_INCR, &server.cfd) == C_ERR) {
+        exit(1);
+    }
+    if (createSocketAcceptHandler(&server.cfd, clusterAcceptHandler) != C_OK) {
+        serverPanic("Unrecoverable error creating Redis Cluster socket accept handler.");
+    }
+
+    /* The slots -> keys map is a radix tree. Initialize it here. */
+    server.cluster->slots_to_keys = raxNew();
+    memset(server.cluster->slots_keys_count,0,
+           sizeof(server.cluster->slots_keys_count));
+
+    /* Set myself->port/cport/pport to my listening ports, we'll just need to
+     * discover the IP address via MEET messages. */
+    deriveAnnouncedPorts(&myself->port, &myself->pport, &myself->cport);
+
+    server.cluster->mf_end = 0;
+    resetManualFailover();
+    clusterUpdateMyselfFlags();
+}
+
+/* Reset a node performing a soft or hard reset:
+ *
+ * 1) All other nodes are forgotten.
+ * 2) All the assigned / open slots are released.
+ * 3) If the node is a slave, it turns into a master.
+ * 4) Only for hard reset: a new Node ID is generated.
+ * 5) Only for hard reset: currentEpoch and configEpoch are set to 0.
+ * 6) The new configuration is saved and the cluster state updated.
+ * 7) If the node was a slave, the whole data set is flushed away. */
+void clusterReset(int hard) {
+    dictIterator *di;
+    dictEntry *de;
+    int j;
+
+    /* Turn into master. */
+    if (nodeIsSlave(myself)) {
+        clusterSetNodeAsMaster(myself);
+        replicationUnsetMaster();
+        emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
+    }
+
+    /* Close slots, reset manual failover state. */
+    clusterCloseAllSlots();
+    resetManualFailover();
+
+    /* Unassign all the slots. */
+    for (j = 0; j < CLUSTER_SLOTS; j++) clusterDelSlot(j);
+
+    /* Forget all the nodes, but myself. */
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (node == myself) continue;
+        clusterDelNode(node);
+    }
+    dictReleaseIterator(di);
+
+    /* Hard reset only: set epochs to 0, change node ID. */
+    if (hard) {
+        sds oldname;
+
+        server.cluster->currentEpoch = 0;
+        server.cluster->lastVoteEpoch = 0;
+        myself->configEpoch = 0;
+        serverLog(LL_WARNING, "configEpoch set to 0 via CLUSTER RESET HARD");
+
+        /* To change the Node ID we need to remove the old name from the
+         * nodes table, change the ID, and re-add back with new name. */
+        oldname = sdsnewlen(myself->name, CLUSTER_NAMELEN);
+        dictDelete(server.cluster->nodes,oldname);
+        sdsfree(oldname);
+        getRandomHexChars(myself->name, CLUSTER_NAMELEN);
+        clusterAddNode(myself);
+        serverLog(LL_NOTICE,"Node hard reset, now I'm %.40s", myself->name);
+    }
+
+    /* Make sure to persist the new config and update the state. */
+    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                         CLUSTER_TODO_UPDATE_STATE|
+                         CLUSTER_TODO_FSYNC_CONFIG);
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER communication link
+ * -------------------------------------------------------------------------- */
+
+clusterLink *createClusterLink(clusterNode *node) {
+    clusterLink *link = zmalloc(sizeof(*link));
+    link->ctime = mstime();
+    link->sndbuf = sdsempty();
+    link->rcvbuf = zmalloc(link->rcvbuf_alloc = RCVBUF_INIT_LEN);
+    link->rcvbuf_len = 0;
+    link->node = node;
+    link->conn = NULL;
+    return link;
+}
+
+/* Free a cluster link, but does not free the associated node of course.
+ * This function will just make sure that the original node associated
+ * with this link will have the 'link' field set to NULL. */
+void freeClusterLink(clusterLink *link) {
+    if (link->conn) {
+        connClose(link->conn);
+        link->conn = NULL;
+    }
+    sdsfree(link->sndbuf);
+    zfree(link->rcvbuf);
+    if (link->node)
+        link->node->link = NULL;
+    zfree(link);
+}
+
+static void clusterConnAcceptHandler(connection *conn) {
+    clusterLink *link;
+
+    if (connGetState(conn) != CONN_STATE_CONNECTED) {
+        serverLog(LL_VERBOSE,
+                "Error accepting cluster node connection: %s", connGetLastError(conn));
+        connClose(conn);
+        return;
+    }
+
+    /* Create a link object we use to handle the connection.
+     * It gets passed to the readable handler when data is available.
+     * Initially the link->node pointer is set to NULL as we don't know
+     * which node is, but the right node is references once we know the
+     * node identity. */
+    link = createClusterLink(NULL);
+    link->conn = conn;
+    connSetPrivateData(conn, link);
+
+    /* Register read handler */
+    connSetReadHandler(conn, clusterReadHandler);
+}
+
+#define MAX_CLUSTER_ACCEPTS_PER_CALL 1000
+void clusterAcceptHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    int cport, cfd;
+    int max = MAX_CLUSTER_ACCEPTS_PER_CALL;
+    char cip[NET_IP_STR_LEN];
+    UNUSED(el);
+    UNUSED(mask);
+    UNUSED(privdata);
+
+    /* If the server is starting up, don't accept cluster connections:
+     * UPDATE messages may interact with the database content. */
+    if (server.masterhost == NULL && server.loading) return;
+
+    while(max--) {
+        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
+        if (cfd == ANET_ERR) {
+            if (errno != EWOULDBLOCK)
+                serverLog(LL_VERBOSE,
+                    "Error accepting cluster node: %s", server.neterr);
+            return;
+        }
+
+        connection *conn = server.tls_cluster ?
+            connCreateAcceptedTLS(cfd, TLS_CLIENT_AUTH_YES) : connCreateAcceptedSocket(cfd);
+
+        /* Make sure connection is not in an error state */
+        if (connGetState(conn) != CONN_STATE_ACCEPTING) {
+            serverLog(LL_VERBOSE,
+                "Error creating an accepting connection for cluster node: %s",
+                    connGetLastError(conn));
+            connClose(conn);
+            return;
+        }
+        connNonBlock(conn);
+        connEnableTcpNoDelay(conn);
+        connKeepAlive(conn,server.cluster_node_timeout * 2);
+
+        /* Use non-blocking I/O for cluster messages. */
+        serverLog(LL_VERBOSE,"Accepting cluster node connection from %s:%d", cip, cport);
+
+        /* Accept the connection now.  connAccept() may call our handler directly
+         * or schedule it for later depending on connection implementation.
+         */
+        if (connAccept(conn, clusterConnAcceptHandler) == C_ERR) {
+            if (connGetState(conn) == CONN_STATE_ERROR)
+                serverLog(LL_VERBOSE,
+                        "Error accepting cluster node connection: %s",
+                        connGetLastError(conn));
+            connClose(conn);
+            return;
+        }
+    }
+}
+
+/* Return the approximated number of sockets we are using in order to
+ * take the cluster bus connections. */
+unsigned long getClusterConnectionsCount(void) {
+    /* We decrement the number of nodes by one, since there is the
+     * "myself" node too in the list. Each node uses two file descriptors,
+     * one incoming and one outgoing, thus the multiplication by 2. */
+    return server.cluster_enabled ?
+           ((dictSize(server.cluster->nodes)-1)*2) : 0;
+}
+
+/* -----------------------------------------------------------------------------
+ * Key space handling
+ * -------------------------------------------------------------------------- */
+
+/* We have 16384 hash slots. The hash slot of a given key is obtained
+ * as the least significant 14 bits of the crc16 of the key.
+ *
+ * However if the key contains the {...} pattern, only the part between
+ * { and } is hashed. This may be useful in the future to force certain
+ * keys to be in the same node (assuming no resharding is in progress). */
+unsigned int keyHashSlot(char *key, int keylen) {
+    int s, e; /* start-end indexes of { and } */
+
+    for (s = 0; s < keylen; s++)
+        if (key[s] == '{') break;
+
+    /* No '{' ? Hash the whole key. This is the base case. */
+    if (s == keylen) return crc16(key,keylen) & 0x3FFF;
+
+    /* '{' found? Check if we have the corresponding '}'. */
+    for (e = s+1; e < keylen; e++)
+        if (key[e] == '}') break;
+
+    /* No '}' or nothing between {} ? Hash the whole key. */
+    if (e == keylen || e == s+1) return crc16(key,keylen) & 0x3FFF;
+
+    /* If we are here there is both a { and a } on its right. Hash
+     * what is in the middle between { and }. */
+    return crc16(key+s+1,e-s-1) & 0x3FFF;
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER node API
+ * -------------------------------------------------------------------------- */
+
+/* Create a new cluster node, with the specified flags.
+ * If "nodename" is NULL this is considered a first handshake and a random
+ * node name is assigned to this node (it will be fixed later when we'll
+ * receive the first pong).
+ *
+ * The node is created and returned to the user, but it is not automatically
+ * added to the nodes hash table. */
+clusterNode *createClusterNode(char *nodename, int flags) {
+    clusterNode *node = zmalloc(sizeof(*node));
+
+    if (nodename)
+        memcpy(node->name, nodename, CLUSTER_NAMELEN);
+    else
+        getRandomHexChars(node->name, CLUSTER_NAMELEN);
+    node->ctime = mstime();
+    node->configEpoch = 0;
+    node->flags = flags;
+    memset(node->slots,0,sizeof(node->slots));
+    node->slots_info = NULL;
+    node->numslots = 0;
+    node->numslaves = 0;
+    node->slaves = NULL;
+    node->slaveof = NULL;
+    node->ping_sent = node->pong_received = 0;
+    node->data_received = 0;
+    node->fail_time = 0;
+    node->link = NULL;
+    memset(node->ip,0,sizeof(node->ip));
+    node->port = 0;
+    node->cport = 0;
+    node->pport = 0;
+    node->fail_reports = listCreate();
+    node->voted_time = 0;
+    node->orphaned_time = 0;
+    node->repl_offset_time = 0;
+    node->repl_offset = 0;
+    listSetFreeMethod(node->fail_reports,zfree);
+    return node;
+}
+
+/* This function is called every time we get a failure report from a node.
+ * The side effect is to populate the fail_reports list (or to update
+ * the timestamp of an existing report).
+ *
+ * 'failing' is the node that is in failure state according to the
+ * 'sender' node.
+ *
+ * The function returns 0 if it just updates a timestamp of an existing
+ * failure report from the same sender. 1 is returned if a new failure
+ * report is created. */
+int clusterNodeAddFailureReport(clusterNode *failing, clusterNode *sender) {
+    list *l = failing->fail_reports;
+    listNode *ln;
+    listIter li;
+    clusterNodeFailReport *fr;
+
+    /* If a failure report from the same sender already exists, just update
+     * the timestamp. */
+    listRewind(l,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        fr = ln->value;
+        if (fr->node == sender) {
+            fr->time = mstime();
+            return 0;
+        }
+    }
+
+    /* Otherwise create a new report. */
+    fr = zmalloc(sizeof(*fr));
+    fr->node = sender;
+    fr->time = mstime();
+    listAddNodeTail(l,fr);
+    return 1;
+}
+
+/* Remove failure reports that are too old, where too old means reasonably
+ * older than the global node timeout. Note that anyway for a node to be
+ * flagged as FAIL we need to have a local PFAIL state that is at least
+ * older than the global node timeout, so we don't just trust the number
+ * of failure reports from other nodes. */
+void clusterNodeCleanupFailureReports(clusterNode *node) {
+    list *l = node->fail_reports;
+    listNode *ln;
+    listIter li;
+    clusterNodeFailReport *fr;
+    mstime_t maxtime = server.cluster_node_timeout *
+                     CLUSTER_FAIL_REPORT_VALIDITY_MULT;
+    mstime_t now = mstime();
+
+    listRewind(l,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        fr = ln->value;
+        if (now - fr->time > maxtime) listDelNode(l,ln);
+    }
+}
+
+/* Remove the failing report for 'node' if it was previously considered
+ * failing by 'sender'. This function is called when a node informs us via
+ * gossip that a node is OK from its point of view (no FAIL or PFAIL flags).
+ *
+ * Note that this function is called relatively often as it gets called even
+ * when there are no nodes failing, and is O(N), however when the cluster is
+ * fine the failure reports list is empty so the function runs in constant
+ * time.
+ *
+ * The function returns 1 if the failure report was found and removed.
+ * Otherwise 0 is returned. */
+int clusterNodeDelFailureReport(clusterNode *node, clusterNode *sender) {
+    list *l = node->fail_reports;
+    listNode *ln;
+    listIter li;
+    clusterNodeFailReport *fr;
+
+    /* Search for a failure report from this sender. */
+    listRewind(l,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        fr = ln->value;
+        if (fr->node == sender) break;
+    }
+    if (!ln) return 0; /* No failure report from this sender. */
+
+    /* Remove the failure report. */
+    listDelNode(l,ln);
+    clusterNodeCleanupFailureReports(node);
+    return 1;
+}
+
+/* Return the number of external nodes that believe 'node' is failing,
+ * not including this node, that may have a PFAIL or FAIL state for this
+ * node as well. */
+int clusterNodeFailureReportsCount(clusterNode *node) {
+    clusterNodeCleanupFailureReports(node);
+    return listLength(node->fail_reports);
+}
+
+int clusterNodeRemoveSlave(clusterNode *master, clusterNode *slave) {
+    int j;
+
+    for (j = 0; j < master->numslaves; j++) {
+        if (master->slaves[j] == slave) {
+            if ((j+1) < master->numslaves) {
+                int remaining_slaves = (master->numslaves - j) - 1;
+                memmove(master->slaves+j,master->slaves+(j+1),
+                        (sizeof(*master->slaves) * remaining_slaves));
+            }
+            master->numslaves--;
+            if (master->numslaves == 0)
+                master->flags &= ~CLUSTER_NODE_MIGRATE_TO;
+            return C_OK;
+        }
+    }
+    return C_ERR;
+}
+
+int clusterNodeAddSlave(clusterNode *master, clusterNode *slave) {
+    int j;
+
+    /* If it's already a slave, don't add it again. */
+    for (j = 0; j < master->numslaves; j++)
+        if (master->slaves[j] == slave) return C_ERR;
+    master->slaves = zrealloc(master->slaves,
+        sizeof(clusterNode*)*(master->numslaves+1));
+    master->slaves[master->numslaves] = slave;
+    master->numslaves++;
+    master->flags |= CLUSTER_NODE_MIGRATE_TO;
+    return C_OK;
+}
+
+int clusterCountNonFailingSlaves(clusterNode *n) {
+    int j, okslaves = 0;
+
+    for (j = 0; j < n->numslaves; j++)
+        if (!nodeFailed(n->slaves[j])) okslaves++;
+    return okslaves;
+}
+
+/* Low level cleanup of the node structure. Only called by clusterDelNode(). */
+void freeClusterNode(clusterNode *n) {
+    sds nodename;
+    int j;
+
+    /* If the node has associated slaves, we have to set
+     * all the slaves->slaveof fields to NULL (unknown). */
+    for (j = 0; j < n->numslaves; j++)
+        n->slaves[j]->slaveof = NULL;
+
+    /* Remove this node from the list of slaves of its master. */
+    if (nodeIsSlave(n) && n->slaveof) clusterNodeRemoveSlave(n->slaveof,n);
+
+    /* Unlink from the set of nodes. */
+    nodename = sdsnewlen(n->name, CLUSTER_NAMELEN);
+    serverAssert(dictDelete(server.cluster->nodes,nodename) == DICT_OK);
+    sdsfree(nodename);
+
+    /* Release link and associated data structures. */
+    if (n->link) freeClusterLink(n->link);
+    listRelease(n->fail_reports);
+    zfree(n->slaves);
+    zfree(n);
+}
+
+/* Add a node to the nodes hash table */
+void clusterAddNode(clusterNode *node) {
+    int retval;
+
+    retval = dictAdd(server.cluster->nodes,
+            sdsnewlen(node->name,CLUSTER_NAMELEN), node);
+    serverAssert(retval == DICT_OK);
+}
+
+/* Remove a node from the cluster. The function performs the high level
+ * cleanup, calling freeClusterNode() for the low level cleanup.
+ * Here we do the following:
+ *
+ * 1) Mark all the slots handled by it as unassigned.
+ * 2) Remove all the failure reports sent by this node and referenced by
+ *    other nodes.
+ * 3) Free the node with freeClusterNode() that will in turn remove it
+ *    from the hash table and from the list of slaves of its master, if
+ *    it is a slave node.
+ */
+void clusterDelNode(clusterNode *delnode) {
+    int j;
+    dictIterator *di;
+    dictEntry *de;
+
+    /* 1) Mark slots as unassigned. */
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (server.cluster->importing_slots_from[j] == delnode)
+            server.cluster->importing_slots_from[j] = NULL;
+        if (server.cluster->migrating_slots_to[j] == delnode)
+            server.cluster->migrating_slots_to[j] = NULL;
+        if (server.cluster->slots[j] == delnode)
+            clusterDelSlot(j);
+    }
+
+    /* 2) Remove failure reports. */
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (node == delnode) continue;
+        clusterNodeDelFailureReport(node,delnode);
+    }
+    dictReleaseIterator(di);
+
+    /* 3) Free the node, unlinking it from the cluster. */
+    freeClusterNode(delnode);
+}
+
+/* Node lookup by name */
+clusterNode *clusterLookupNode(const char *name) {
+    sds s = sdsnewlen(name, CLUSTER_NAMELEN);
+    dictEntry *de;
+
+    de = dictFind(server.cluster->nodes,s);
+    sdsfree(s);
+    if (de == NULL) return NULL;
+    return dictGetVal(de);
+}
+
+/* This is only used after the handshake. When we connect a given IP/PORT
+ * as a result of CLUSTER MEET we don't have the node name yet, so we
+ * pick a random one, and will fix it when we receive the PONG request using
+ * this function. */
+void clusterRenameNode(clusterNode *node, char *newname) {
+    int retval;
+    sds s = sdsnewlen(node->name, CLUSTER_NAMELEN);
+
+    serverLog(LL_DEBUG,"Renaming node %.40s into %.40s",
+        node->name, newname);
+    retval = dictDelete(server.cluster->nodes, s);
+    sdsfree(s);
+    serverAssert(retval == DICT_OK);
+    memcpy(node->name, newname, CLUSTER_NAMELEN);
+    clusterAddNode(node);
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER config epoch handling
+ * -------------------------------------------------------------------------- */
+
+/* Return the greatest configEpoch found in the cluster, or the current
+ * epoch if greater than any node configEpoch. */
+uint64_t clusterGetMaxEpoch(void) {
+    uint64_t max = 0;
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+        if (node->configEpoch > max) max = node->configEpoch;
+    }
+    dictReleaseIterator(di);
+    if (max < server.cluster->currentEpoch) max = server.cluster->currentEpoch;
+    return max;
+}
+
+/* If this node epoch is zero or is not already the greatest across the
+ * cluster (from the POV of the local configuration), this function will:
+ *
+ * 1) Generate a new config epoch, incrementing the current epoch.
+ * 2) Assign the new epoch to this node, WITHOUT any consensus.
+ * 3) Persist the configuration on disk before sending packets with the
+ *    new configuration.
+ *
+ * If the new config epoch is generated and assigned, C_OK is returned,
+ * otherwise C_ERR is returned (since the node has already the greatest
+ * configuration around) and no operation is performed.
+ *
+ * Important note: this function violates the principle that config epochs
+ * should be generated with consensus and should be unique across the cluster.
+ * However Redis Cluster uses this auto-generated new config epochs in two
+ * cases:
+ *
+ * 1) When slots are closed after importing. Otherwise resharding would be
+ *    too expensive.
+ * 2) When CLUSTER FAILOVER is called with options that force a slave to
+ *    failover its master even if there is not master majority able to
+ *    create a new configuration epoch.
+ *
+ * Redis Cluster will not explode using this function, even in the case of
+ * a collision between this node and another node, generating the same
+ * configuration epoch unilaterally, because the config epoch conflict
+ * resolution algorithm will eventually move colliding nodes to different
+ * config epochs. However using this function may violate the "last failover
+ * wins" rule, so should only be used with care. */
+int clusterBumpConfigEpochWithoutConsensus(void) {
+    uint64_t maxEpoch = clusterGetMaxEpoch();
+
+    if (myself->configEpoch == 0 ||
+        myself->configEpoch != maxEpoch)
+    {
+        server.cluster->currentEpoch++;
+        myself->configEpoch = server.cluster->currentEpoch;
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                             CLUSTER_TODO_FSYNC_CONFIG);
+        serverLog(LL_WARNING,
+            "New configEpoch set to %llu",
+            (unsigned long long) myself->configEpoch);
+        return C_OK;
+    } else {
+        return C_ERR;
+    }
+}
+
+/* This function is called when this node is a master, and we receive from
+ * another master a configuration epoch that is equal to our configuration
+ * epoch.
+ *
+ * BACKGROUND
+ *
+ * It is not possible that different slaves get the same config
+ * epoch during a failover election, because the slaves need to get voted
+ * by a majority. However when we perform a manual resharding of the cluster
+ * the node will assign a configuration epoch to itself without to ask
+ * for agreement. Usually resharding happens when the cluster is working well
+ * and is supervised by the sysadmin, however it is possible for a failover
+ * to happen exactly while the node we are resharding a slot to assigns itself
+ * a new configuration epoch, but before it is able to propagate it.
+ *
+ * So technically it is possible in this condition that two nodes end with
+ * the same configuration epoch.
+ *
+ * Another possibility is that there are bugs in the implementation causing
+ * this to happen.
+ *
+ * Moreover when a new cluster is created, all the nodes start with the same
+ * configEpoch. This collision resolution code allows nodes to automatically
+ * end with a different configEpoch at startup automatically.
+ *
+ * In all the cases, we want a mechanism that resolves this issue automatically
+ * as a safeguard. The same configuration epoch for masters serving different
+ * set of slots is not harmful, but it is if the nodes end serving the same
+ * slots for some reason (manual errors or software bugs) without a proper
+ * failover procedure.
+ *
+ * In general we want a system that eventually always ends with different
+ * masters having different configuration epochs whatever happened, since
+ * nothing is worse than a split-brain condition in a distributed system.
+ *
+ * BEHAVIOR
+ *
+ * When this function gets called, what happens is that if this node
+ * has the lexicographically smaller Node ID compared to the other node
+ * with the conflicting epoch (the 'sender' node), it will assign itself
+ * the greatest configuration epoch currently detected among nodes plus 1.
+ *
+ * This means that even if there are multiple nodes colliding, the node
+ * with the greatest Node ID never moves forward, so eventually all the nodes
+ * end with a different configuration epoch.
+ */
+void clusterHandleConfigEpochCollision(clusterNode *sender) {
+    /* Prerequisites: nodes have the same configEpoch and are both masters. */
+    if (sender->configEpoch != myself->configEpoch ||
+        !nodeIsMaster(sender) || !nodeIsMaster(myself)) return;
+    /* Don't act if the colliding node has a smaller Node ID. */
+    if (memcmp(sender->name,myself->name,CLUSTER_NAMELEN) <= 0) return;
+    /* Get the next ID available at the best of this node knowledge. */
+    server.cluster->currentEpoch++;
+    myself->configEpoch = server.cluster->currentEpoch;
+    clusterSaveConfigOrDie(1);
+    serverLog(LL_VERBOSE,
+        "WARNING: configEpoch collision with node %.40s."
+        " configEpoch set to %llu",
+        sender->name,
+        (unsigned long long) myself->configEpoch);
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER nodes blacklist
+ *
+ * The nodes blacklist is just a way to ensure that a given node with a given
+ * Node ID is not readded before some time elapsed (this time is specified
+ * in seconds in CLUSTER_BLACKLIST_TTL).
+ *
+ * This is useful when we want to remove a node from the cluster completely:
+ * when CLUSTER FORGET is called, it also puts the node into the blacklist so
+ * that even if we receive gossip messages from other nodes that still remember
+ * about the node we want to remove, we don't re-add it before some time.
+ *
+ * Currently the CLUSTER_BLACKLIST_TTL is set to 1 minute, this means
+ * that redis-trib has 60 seconds to send CLUSTER FORGET messages to nodes
+ * in the cluster without dealing with the problem of other nodes re-adding
+ * back the node to nodes we already sent the FORGET command to.
+ *
+ * The data structure used is a hash table with an sds string representing
+ * the node ID as key, and the time when it is ok to re-add the node as
+ * value.
+ * -------------------------------------------------------------------------- */
+
+#define CLUSTER_BLACKLIST_TTL 60      /* 1 minute. */
+
+
+/* Before of the addNode() or Exists() operations we always remove expired
+ * entries from the black list. This is an O(N) operation but it is not a
+ * problem since add / exists operations are called very infrequently and
+ * the hash table is supposed to contain very little elements at max.
+ * However without the cleanup during long uptime and with some automated
+ * node add/removal procedures, entries could accumulate. */
+void clusterBlacklistCleanup(void) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(server.cluster->nodes_black_list);
+    while((de = dictNext(di)) != NULL) {
+        int64_t expire = dictGetUnsignedIntegerVal(de);
+
+        if (expire < server.unixtime)
+            dictDelete(server.cluster->nodes_black_list,dictGetKey(de));
+    }
+    dictReleaseIterator(di);
+}
+
+/* Cleanup the blacklist and add a new node ID to the black list. */
+void clusterBlacklistAddNode(clusterNode *node) {
+    dictEntry *de;
+    sds id = sdsnewlen(node->name,CLUSTER_NAMELEN);
+
+    clusterBlacklistCleanup();
+    if (dictAdd(server.cluster->nodes_black_list,id,NULL) == DICT_OK) {
+        /* If the key was added, duplicate the sds string representation of
+         * the key for the next lookup. We'll free it at the end. */
+        id = sdsdup(id);
+    }
+    de = dictFind(server.cluster->nodes_black_list,id);
+    dictSetUnsignedIntegerVal(de,time(NULL)+CLUSTER_BLACKLIST_TTL);
+    sdsfree(id);
+}
+
+/* Return non-zero if the specified node ID exists in the blacklist.
+ * You don't need to pass an sds string here, any pointer to 40 bytes
+ * will work. */
+int clusterBlacklistExists(char *nodeid) {
+    sds id = sdsnewlen(nodeid,CLUSTER_NAMELEN);
+    int retval;
+
+    clusterBlacklistCleanup();
+    retval = dictFind(server.cluster->nodes_black_list,id) != NULL;
+    sdsfree(id);
+    return retval;
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER messages exchange - PING/PONG and gossip
+ * -------------------------------------------------------------------------- */
+
+/* This function checks if a given node should be marked as FAIL.
+ * It happens if the following conditions are met:
+ *
+ * 1) We received enough failure reports from other master nodes via gossip.
+ *    Enough means that the majority of the masters signaled the node is
+ *    down recently.
+ * 2) We believe this node is in PFAIL state.
+ *
+ * If a failure is detected we also inform the whole cluster about this
+ * event trying to force every other node to set the FAIL flag for the node.
+ *
+ * Note that the form of agreement used here is weak, as we collect the majority
+ * of masters state during some time, and even if we force agreement by
+ * propagating the FAIL message, because of partitions we may not reach every
+ * node. However:
+ *
+ * 1) Either we reach the majority and eventually the FAIL state will propagate
+ *    to all the cluster.
+ * 2) Or there is no majority so no slave promotion will be authorized and the
+ *    FAIL flag will be cleared after some time.
+ */
+void markNodeAsFailingIfNeeded(clusterNode *node) {
+    int failures;
+    int needed_quorum = (server.cluster->size / 2) + 1;
+
+    if (!nodeTimedOut(node)) return; /* We can reach it. */
+    if (nodeFailed(node)) return; /* Already FAILing. */
+
+    failures = clusterNodeFailureReportsCount(node);
+    /* Also count myself as a voter if I'm a master. */
+    if (nodeIsMaster(myself)) failures++;
+    if (failures < needed_quorum) return; /* No weak agreement from masters. */
+
+    serverLog(LL_NOTICE,
+        "Marking node %.40s as failing (quorum reached).", node->name);
+
+    /* Mark the node as failing. */
+    node->flags &= ~CLUSTER_NODE_PFAIL;
+    node->flags |= CLUSTER_NODE_FAIL;
+    node->fail_time = mstime();
+
+    /* Broadcast the failing node name to everybody, forcing all the other
+     * reachable nodes to flag the node as FAIL.
+     * We do that even if this node is a replica and not a master: anyway
+     * the failing state is triggered collecting failure reports from masters,
+     * so here the replica is only helping propagating this status. */
+    clusterSendFail(node->name);
+    clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+}
+
+/* This function is called only if a node is marked as FAIL, but we are able
+ * to reach it again. It checks if there are the conditions to undo the FAIL
+ * state. */
+void clearNodeFailureIfNeeded(clusterNode *node) {
+    mstime_t now = mstime();
+
+    serverAssert(nodeFailed(node));
+
+    /* For slaves we always clear the FAIL flag if we can contact the
+     * node again. */
+    if (nodeIsSlave(node) || node->numslots == 0) {
+        serverLog(LL_NOTICE,
+            "Clear FAIL state for node %.40s: %s is reachable again.",
+                node->name,
+                nodeIsSlave(node) ? "replica" : "master without slots");
+        node->flags &= ~CLUSTER_NODE_FAIL;
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+    }
+
+    /* If it is a master and...
+     * 1) The FAIL state is old enough.
+     * 2) It is yet serving slots from our point of view (not failed over).
+     * Apparently no one is going to fix these slots, clear the FAIL flag. */
+    if (nodeIsMaster(node) && node->numslots > 0 &&
+        (now - node->fail_time) >
+        (server.cluster_node_timeout * CLUSTER_FAIL_UNDO_TIME_MULT))
+    {
+        serverLog(LL_NOTICE,
+            "Clear FAIL state for node %.40s: is reachable again and nobody is serving its slots after some time.",
+                node->name);
+        node->flags &= ~CLUSTER_NODE_FAIL;
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+    }
+}
+
+/* Return true if we already have a node in HANDSHAKE state matching the
+ * specified ip address and port number. This function is used in order to
+ * avoid adding a new handshake node for the same address multiple times. */
+int clusterHandshakeInProgress(char *ip, int port, int cport) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (!nodeInHandshake(node)) continue;
+        if (!strcasecmp(node->ip,ip) &&
+            node->port == port &&
+            node->cport == cport) break;
+    }
+    dictReleaseIterator(di);
+    return de != NULL;
+}
+
+/* Start a handshake with the specified address if there is not one
+ * already in progress. Returns non-zero if the handshake was actually
+ * started. On error zero is returned and errno is set to one of the
+ * following values:
+ *
+ * EAGAIN - There is already a handshake in progress for this address.
+ * EINVAL - IP or port are not valid. */
+int clusterStartHandshake(char *ip, int port, int cport) {
+    clusterNode *n;
+    char norm_ip[NET_IP_STR_LEN];
+    struct sockaddr_storage sa;
+
+    /* IP sanity check */
+    if (inet_pton(AF_INET,ip,
+            &(((struct sockaddr_in *)&sa)->sin_addr)))
+    {
+        sa.ss_family = AF_INET;
+    } else if (inet_pton(AF_INET6,ip,
+            &(((struct sockaddr_in6 *)&sa)->sin6_addr)))
+    {
+        sa.ss_family = AF_INET6;
+    } else {
+        errno = EINVAL;
+        return 0;
+    }
+
+    /* Port sanity check */
+    if (port <= 0 || port > 65535 || cport <= 0 || cport > 65535) {
+        errno = EINVAL;
+        return 0;
+    }
+
+    /* Set norm_ip as the normalized string representation of the node
+     * IP address. */
+    memset(norm_ip,0,NET_IP_STR_LEN);
+    if (sa.ss_family == AF_INET)
+        inet_ntop(AF_INET,
+            (void*)&(((struct sockaddr_in *)&sa)->sin_addr),
+            norm_ip,NET_IP_STR_LEN);
+    else
+        inet_ntop(AF_INET6,
+            (void*)&(((struct sockaddr_in6 *)&sa)->sin6_addr),
+            norm_ip,NET_IP_STR_LEN);
+
+    if (clusterHandshakeInProgress(norm_ip,port,cport)) {
+        errno = EAGAIN;
+        return 0;
+    }
+
+    /* Add the node with a random address (NULL as first argument to
+     * createClusterNode()). Everything will be fixed during the
+     * handshake. */
+    n = createClusterNode(NULL,CLUSTER_NODE_HANDSHAKE|CLUSTER_NODE_MEET);
+    memcpy(n->ip,norm_ip,sizeof(n->ip));
+    n->port = port;
+    n->cport = cport;
+    clusterAddNode(n);
+    return 1;
+}
+
+/* Process the gossip section of PING or PONG packets.
+ * Note that this function assumes that the packet is already sanity-checked
+ * by the caller, not in the content of the gossip section, but in the
+ * length. */
+void clusterProcessGossipSection(clusterMsg *hdr, clusterLink *link) {
+    uint16_t count = ntohs(hdr->count);
+    clusterMsgDataGossip *g = (clusterMsgDataGossip*) hdr->data.ping.gossip;
+    clusterNode *sender = link->node ? link->node : clusterLookupNode(hdr->sender);
+
+    while(count--) {
+        uint16_t flags = ntohs(g->flags);
+        clusterNode *node;
+        sds ci;
+
+        if (server.verbosity == LL_DEBUG) {
+            ci = representClusterNodeFlags(sdsempty(), flags);
+            serverLog(LL_DEBUG,"GOSSIP %.40s %s:%d@%d %s",
+                g->nodename,
+                g->ip,
+                ntohs(g->port),
+                ntohs(g->cport),
+                ci);
+            sdsfree(ci);
+        }
+
+        /* Update our state accordingly to the gossip sections */
+        node = clusterLookupNode(g->nodename);
+        if (node) {
+            /* We already know this node.
+               Handle failure reports, only when the sender is a master. */
+            if (sender && nodeIsMaster(sender) && node != myself) {
+                if (flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) {
+                    if (clusterNodeAddFailureReport(node,sender)) {
+                        serverLog(LL_VERBOSE,
+                            "Node %.40s reported node %.40s as not reachable.",
+                            sender->name, node->name);
+                    }
+                    markNodeAsFailingIfNeeded(node);
+                } else {
+                    if (clusterNodeDelFailureReport(node,sender)) {
+                        serverLog(LL_VERBOSE,
+                            "Node %.40s reported node %.40s is back online.",
+                            sender->name, node->name);
+                    }
+                }
+            }
+
+            /* If from our POV the node is up (no failure flags are set),
+             * we have no pending ping for the node, nor we have failure
+             * reports for this node, update the last pong time with the
+             * one we see from the other nodes. */
+            if (!(flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) &&
+                node->ping_sent == 0 &&
+                clusterNodeFailureReportsCount(node) == 0)
+            {
+                mstime_t pongtime = ntohl(g->pong_received);
+                pongtime *= 1000; /* Convert back to milliseconds. */
+
+                /* Replace the pong time with the received one only if
+                 * it's greater than our view but is not in the future
+                 * (with 500 milliseconds tolerance) from the POV of our
+                 * clock. */
+                if (pongtime <= (server.mstime+500) &&
+                    pongtime > node->pong_received)
+                {
+                    node->pong_received = pongtime;
+                }
+            }
+
+            /* If we already know this node, but it is not reachable, and
+             * we see a different address in the gossip section of a node that
+             * can talk with this other node, update the address, disconnect
+             * the old link if any, so that we'll attempt to connect with the
+             * new address. */
+            if (node->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL) &&
+                !(flags & CLUSTER_NODE_NOADDR) &&
+                !(flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) &&
+                (strcasecmp(node->ip,g->ip) ||
+                 node->port != ntohs(g->port) ||
+                 node->cport != ntohs(g->cport)))
+            {
+                if (node->link) freeClusterLink(node->link);
+                memcpy(node->ip,g->ip,NET_IP_STR_LEN);
+                node->port = ntohs(g->port);
+                node->pport = ntohs(g->pport);
+                node->cport = ntohs(g->cport);
+                node->flags &= ~CLUSTER_NODE_NOADDR;
+            }
+        } else {
+            /* If it's not in NOADDR state and we don't have it, we
+             * add it to our trusted dict with exact nodeid and flag.
+             * Note that we cannot simply start a handshake against
+             * this IP/PORT pairs, since IP/PORT can be reused already,
+             * otherwise we risk joining another cluster.
+             *
+             * Note that we require that the sender of this gossip message
+             * is a well known node in our cluster, otherwise we risk
+             * joining another cluster. */
+            if (sender &&
+                !(flags & CLUSTER_NODE_NOADDR) &&
+                !clusterBlacklistExists(g->nodename))
+            {
+                clusterNode *node;
+                node = createClusterNode(g->nodename, flags);
+                memcpy(node->ip,g->ip,NET_IP_STR_LEN);
+                node->port = ntohs(g->port);
+                node->pport = ntohs(g->pport);
+                node->cport = ntohs(g->cport);
+                clusterAddNode(node);
+            }
+        }
+
+        /* Next node */
+        g++;
+    }
+}
+
+/* IP -> string conversion. 'buf' is supposed to at least be 46 bytes.
+ * If 'announced_ip' length is non-zero, it is used instead of extracting
+ * the IP from the socket peer address. */
+void nodeIp2String(char *buf, clusterLink *link, char *announced_ip) {
+    if (announced_ip[0] != '\0') {
+        memcpy(buf,announced_ip,NET_IP_STR_LEN);
+        buf[NET_IP_STR_LEN-1] = '\0'; /* We are not sure the input is sane. */
+    } else {
+        connPeerToString(link->conn, buf, NET_IP_STR_LEN, NULL);
+    }
+}
+
+/* Update the node address to the IP address that can be extracted
+ * from link->fd, or if hdr->myip is non empty, to the address the node
+ * is announcing us. The port is taken from the packet header as well.
+ *
+ * If the address or port changed, disconnect the node link so that we'll
+ * connect again to the new address.
+ *
+ * If the ip/port pair are already correct no operation is performed at
+ * all.
+ *
+ * The function returns 0 if the node address is still the same,
+ * otherwise 1 is returned. */
+int nodeUpdateAddressIfNeeded(clusterNode *node, clusterLink *link,
+                              clusterMsg *hdr)
+{
+    char ip[NET_IP_STR_LEN] = {0};
+    int port = ntohs(hdr->port);
+    int pport = ntohs(hdr->pport);
+    int cport = ntohs(hdr->cport);
+
+    /* We don't proceed if the link is the same as the sender link, as this
+     * function is designed to see if the node link is consistent with the
+     * symmetric link that is used to receive PINGs from the node.
+     *
+     * As a side effect this function never frees the passed 'link', so
+     * it is safe to call during packet processing. */
+    if (link == node->link) return 0;
+
+    nodeIp2String(ip,link,hdr->myip);
+    if (node->port == port && node->cport == cport && node->pport == pport &&
+        strcmp(ip,node->ip) == 0) return 0;
+
+    /* IP / port is different, update it. */
+    memcpy(node->ip,ip,sizeof(ip));
+    node->port = port;
+    node->pport = pport;
+    node->cport = cport;
+    if (node->link) freeClusterLink(node->link);
+    node->flags &= ~CLUSTER_NODE_NOADDR;
+    serverLog(LL_WARNING,"Address updated for node %.40s, now %s:%d",
+        node->name, node->ip, node->port);
+
+    /* Check if this is our master and we have to change the
+     * replication target as well. */
+    if (nodeIsSlave(myself) && myself->slaveof == node)
+        replicationSetMaster(node->ip, node->port);
+    return 1;
+}
+
+/* Reconfigure the specified node 'n' as a master. This function is called when
+ * a node that we believed to be a slave is now acting as master in order to
+ * update the state of the node. */
+void clusterSetNodeAsMaster(clusterNode *n) {
+    if (nodeIsMaster(n)) return;
+
+    if (n->slaveof) {
+        clusterNodeRemoveSlave(n->slaveof,n);
+        if (n != myself) n->flags |= CLUSTER_NODE_MIGRATE_TO;
+    }
+    n->flags &= ~CLUSTER_NODE_SLAVE;
+    n->flags |= CLUSTER_NODE_MASTER;
+    n->slaveof = NULL;
+
+    /* Update config and state. */
+    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                         CLUSTER_TODO_UPDATE_STATE);
+}
+
+/* This function is called when we receive a master configuration via a
+ * PING, PONG or UPDATE packet. What we receive is a node, a configEpoch of the
+ * node, and the set of slots claimed under this configEpoch.
+ *
+ * What we do is to rebind the slots with newer configuration compared to our
+ * local configuration, and if needed, we turn ourself into a replica of the
+ * node (see the function comments for more info).
+ *
+ * The 'sender' is the node for which we received a configuration update.
+ * Sometimes it is not actually the "Sender" of the information, like in the
+ * case we receive the info via an UPDATE packet. */
+void clusterUpdateSlotsConfigWith(clusterNode *sender, uint64_t senderConfigEpoch, unsigned char *slots) {
+    int j;
+    clusterNode *curmaster = NULL, *newmaster = NULL;
+    /* The dirty slots list is a list of slots for which we lose the ownership
+     * while having still keys inside. This usually happens after a failover
+     * or after a manual cluster reconfiguration operated by the admin.
+     *
+     * If the update message is not able to demote a master to slave (in this
+     * case we'll resync with the master updating the whole key space), we
+     * need to delete all the keys in the slots we lost ownership. */
+    uint16_t dirty_slots[CLUSTER_SLOTS];
+    int dirty_slots_count = 0;
+
+    /* We should detect if sender is new master of our shard.
+     * We will know it if all our slots were migrated to sender, and sender
+     * has no slots except ours */
+    int sender_slots = 0;
+    int migrated_our_slots = 0;
+
+    /* Here we set curmaster to this node or the node this node
+     * replicates to if it's a slave. In the for loop we are
+     * interested to check if slots are taken away from curmaster. */
+    curmaster = nodeIsMaster(myself) ? myself : myself->slaveof;
+
+    if (sender == myself) {
+        serverLog(LL_WARNING,"Discarding UPDATE message about myself.");
+        return;
+    }
+
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (bitmapTestBit(slots,j)) {
+            sender_slots++;
+
+            /* The slot is already bound to the sender of this message. */
+            if (server.cluster->slots[j] == sender) continue;
+
+            /* The slot is in importing state, it should be modified only
+             * manually via redis-trib (example: a resharding is in progress
+             * and the migrating side slot was already closed and is advertising
+             * a new config. We still want the slot to be closed manually). */
+            if (server.cluster->importing_slots_from[j]) continue;
+
+            /* We rebind the slot to the new node claiming it if:
+             * 1) The slot was unassigned or the new node claims it with a
+             *    greater configEpoch.
+             * 2) We are not currently importing the slot. */
+            if (server.cluster->slots[j] == NULL ||
+                server.cluster->slots[j]->configEpoch < senderConfigEpoch)
+            {
+                /* Was this slot mine, and still contains keys? Mark it as
+                 * a dirty slot. */
+                if (server.cluster->slots[j] == myself &&
+                    countKeysInSlot(j) &&
+                    sender != myself)
+                {
+                    dirty_slots[dirty_slots_count] = j;
+                    dirty_slots_count++;
+                }
+
+                if (server.cluster->slots[j] == curmaster) {
+                    newmaster = sender;
+                    migrated_our_slots++;
+                }
+                clusterDelSlot(j);
+                clusterAddSlot(sender,j);
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                     CLUSTER_TODO_UPDATE_STATE|
+                                     CLUSTER_TODO_FSYNC_CONFIG);
+            }
+        }
+    }
+
+    /* After updating the slots configuration, don't do any actual change
+     * in the state of the server if a module disabled Redis Cluster
+     * keys redirections. */
+    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
+        return;
+
+    /* If at least one slot was reassigned from a node to another node
+     * with a greater configEpoch, it is possible that:
+     * 1) We are a master left without slots. This means that we were
+     *    failed over and we should turn into a replica of the new
+     *    master.
+     * 2) We are a slave and our master is left without slots. We need
+     *    to replicate to the new slots owner. */
+    if (newmaster && curmaster->numslots == 0 &&
+            (server.cluster_allow_replica_migration ||
+             sender_slots == migrated_our_slots)) {
+        serverLog(LL_WARNING,
+            "Configuration change detected. Reconfiguring myself "
+            "as a replica of %.40s", sender->name);
+        clusterSetMaster(sender);
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                             CLUSTER_TODO_UPDATE_STATE|
+                             CLUSTER_TODO_FSYNC_CONFIG);
+    } else if (dirty_slots_count) {
+        /* If we are here, we received an update message which removed
+         * ownership for certain slots we still have keys about, but still
+         * we are serving some slots, so this master node was not demoted to
+         * a slave.
+         *
+         * In order to maintain a consistent state between keys and slots
+         * we need to remove all the keys from the slots we lost. */
+        for (j = 0; j < dirty_slots_count; j++)
+            delKeysInSlot(dirty_slots[j]);
+    }
+}
+
+/* When this function is called, there is a packet to process starting
+ * at node->rcvbuf. Releasing the buffer is up to the caller, so this
+ * function should just handle the higher level stuff of processing the
+ * packet, modifying the cluster state if needed.
+ *
+ * The function returns 1 if the link is still valid after the packet
+ * was processed, otherwise 0 if the link was freed since the packet
+ * processing lead to some inconsistency error (for instance a PONG
+ * received from the wrong sender ID). */
+int clusterProcessPacket(clusterLink *link) {
+    clusterMsg *hdr = (clusterMsg*) link->rcvbuf;
+    uint32_t totlen = ntohl(hdr->totlen);
+    uint16_t type = ntohs(hdr->type);
+    mstime_t now = mstime();
+
+    if (type < CLUSTERMSG_TYPE_COUNT)
+        server.cluster->stats_bus_messages_received[type]++;
+    serverLog(LL_DEBUG,"--- Processing packet of type %d, %lu bytes",
+        type, (unsigned long) totlen);
+
+    /* Perform sanity checks */
+    if (totlen < 16) return 1; /* At least signature, version, totlen, count. */
+    if (totlen > link->rcvbuf_len) return 1;
+
+    if (ntohs(hdr->ver) != CLUSTER_PROTO_VER) {
+        /* Can't handle messages of different versions. */
+        return 1;
+    }
+
+    uint16_t flags = ntohs(hdr->flags);
+    uint64_t senderCurrentEpoch = 0, senderConfigEpoch = 0;
+    clusterNode *sender;
+
+    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_PONG ||
+        type == CLUSTERMSG_TYPE_MEET)
+    {
+        uint16_t count = ntohs(hdr->count);
+        uint32_t explen; /* expected length of this packet */
+
+        explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+        explen += (sizeof(clusterMsgDataGossip)*count);
+        if (totlen != explen) return 1;
+    } else if (type == CLUSTERMSG_TYPE_FAIL) {
+        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+
+        explen += sizeof(clusterMsgDataFail);
+        if (totlen != explen) return 1;
+    } else if (type == CLUSTERMSG_TYPE_PUBLISH) {
+        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+
+        explen += sizeof(clusterMsgDataPublish) -
+                8 +
+                ntohl(hdr->data.publish.msg.channel_len) +
+                ntohl(hdr->data.publish.msg.message_len);
+        if (totlen != explen) return 1;
+    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST ||
+               type == CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK ||
+               type == CLUSTERMSG_TYPE_MFSTART)
+    {
+        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+
+        if (totlen != explen) return 1;
+    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
+        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+
+        explen += sizeof(clusterMsgDataUpdate);
+        if (totlen != explen) return 1;
+    } else if (type == CLUSTERMSG_TYPE_MODULE) {
+        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+
+        explen += sizeof(clusterMsgModule) -
+                3 + ntohl(hdr->data.module.msg.len);
+        if (totlen != explen) return 1;
+    }
+
+    /* Check if the sender is a known node. Note that for incoming connections
+     * we don't store link->node information, but resolve the node by the
+     * ID in the header each time in the current implementation. */
+    sender = clusterLookupNode(hdr->sender);
+
+    /* Update the last time we saw any data from this node. We
+     * use this in order to avoid detecting a timeout from a node that
+     * is just sending a lot of data in the cluster bus, for instance
+     * because of Pub/Sub. */
+    if (sender) sender->data_received = now;
+
+    if (sender && !nodeInHandshake(sender)) {
+        /* Update our currentEpoch if we see a newer epoch in the cluster. */
+        senderCurrentEpoch = ntohu64(hdr->currentEpoch);
+        senderConfigEpoch = ntohu64(hdr->configEpoch);
+        if (senderCurrentEpoch > server.cluster->currentEpoch)
+            server.cluster->currentEpoch = senderCurrentEpoch;
+        /* Update the sender configEpoch if it is publishing a newer one. */
+        if (senderConfigEpoch > sender->configEpoch) {
+            sender->configEpoch = senderConfigEpoch;
+            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                 CLUSTER_TODO_FSYNC_CONFIG);
+        }
+        /* Update the replication offset info for this node. */
+        sender->repl_offset = ntohu64(hdr->offset);
+        sender->repl_offset_time = now;
+        /* If we are a slave performing a manual failover and our master
+         * sent its offset while already paused, populate the MF state. */
+        if (server.cluster->mf_end &&
+            nodeIsSlave(myself) &&
+            myself->slaveof == sender &&
+            hdr->mflags[0] & CLUSTERMSG_FLAG0_PAUSED &&
+            server.cluster->mf_master_offset == -1)
+        {
+            server.cluster->mf_master_offset = sender->repl_offset;
+            clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_MANUALFAILOVER);
+            serverLog(LL_WARNING,
+                "Received replication offset for paused "
+                "master manual failover: %lld",
+                server.cluster->mf_master_offset);
+        }
+    }
+
+    /* Initial processing of PING and MEET requests replying with a PONG. */
+    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_MEET) {
+        serverLog(LL_DEBUG,"Ping packet received: %p", (void*)link->node);
+
+        /* We use incoming MEET messages in order to set the address
+         * for 'myself', since only other cluster nodes will send us
+         * MEET messages on handshakes, when the cluster joins, or
+         * later if we changed address, and those nodes will use our
+         * official address to connect to us. So by obtaining this address
+         * from the socket is a simple way to discover / update our own
+         * address in the cluster without it being hardcoded in the config.
+         *
+         * However if we don't have an address at all, we update the address
+         * even with a normal PING packet. If it's wrong it will be fixed
+         * by MEET later. */
+        if ((type == CLUSTERMSG_TYPE_MEET || myself->ip[0] == '\0') &&
+            server.cluster_announce_ip == NULL)
+        {
+            char ip[NET_IP_STR_LEN];
+
+            if (connSockName(link->conn,ip,sizeof(ip),NULL) != -1 &&
+                strcmp(ip,myself->ip))
+            {
+                memcpy(myself->ip,ip,NET_IP_STR_LEN);
+                serverLog(LL_WARNING,"IP address for this node updated to %s",
+                    myself->ip);
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
+            }
+        }
+
+        /* Add this node if it is new for us and the msg type is MEET.
+         * In this stage we don't try to add the node with the right
+         * flags, slaveof pointer, and so forth, as this details will be
+         * resolved when we'll receive PONGs from the node. */
+        if (!sender && type == CLUSTERMSG_TYPE_MEET) {
+            clusterNode *node;
+
+            node = createClusterNode(NULL,CLUSTER_NODE_HANDSHAKE);
+            nodeIp2String(node->ip,link,hdr->myip);
+            node->port = ntohs(hdr->port);
+            node->pport = ntohs(hdr->pport);
+            node->cport = ntohs(hdr->cport);
+            clusterAddNode(node);
+            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
+        }
+
+        /* If this is a MEET packet from an unknown node, we still process
+         * the gossip section here since we have to trust the sender because
+         * of the message type. */
+        if (!sender && type == CLUSTERMSG_TYPE_MEET)
+            clusterProcessGossipSection(hdr,link);
+
+        /* Anyway reply with a PONG */
+        clusterSendPing(link,CLUSTERMSG_TYPE_PONG);
+    }
+
+    /* PING, PONG, MEET: process config information. */
+    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_PONG ||
+        type == CLUSTERMSG_TYPE_MEET)
+    {
+        serverLog(LL_DEBUG,"%s packet received: %p",
+            type == CLUSTERMSG_TYPE_PING ? "ping" : "pong",
+            (void*)link->node);
+        if (link->node) {
+            if (nodeInHandshake(link->node)) {
+                /* If we already have this node, try to change the
+                 * IP/port of the node with the new one. */
+                if (sender) {
+                    serverLog(LL_VERBOSE,
+                        "Handshake: we already know node %.40s, "
+                        "updating the address if needed.", sender->name);
+                    if (nodeUpdateAddressIfNeeded(sender,link,hdr))
+                    {
+                        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                             CLUSTER_TODO_UPDATE_STATE);
+                    }
+                    /* Free this node as we already have it. This will
+                     * cause the link to be freed as well. */
+                    clusterDelNode(link->node);
+                    return 0;
+                }
+
+                /* First thing to do is replacing the random name with the
+                 * right node name if this was a handshake stage. */
+                clusterRenameNode(link->node, hdr->sender);
+                serverLog(LL_DEBUG,"Handshake with node %.40s completed.",
+                    link->node->name);
+                link->node->flags &= ~CLUSTER_NODE_HANDSHAKE;
+                link->node->flags |= flags&(CLUSTER_NODE_MASTER|CLUSTER_NODE_SLAVE);
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
+            } else if (memcmp(link->node->name,hdr->sender,
+                        CLUSTER_NAMELEN) != 0)
+            {
+                /* If the reply has a non matching node ID we
+                 * disconnect this node and set it as not having an associated
+                 * address. */
+                serverLog(LL_DEBUG,"PONG contains mismatching sender ID. About node %.40s added %d ms ago, having flags %d",
+                    link->node->name,
+                    (int)(now-(link->node->ctime)),
+                    link->node->flags);
+                link->node->flags |= CLUSTER_NODE_NOADDR;
+                link->node->ip[0] = '\0';
+                link->node->port = 0;
+                link->node->pport = 0;
+                link->node->cport = 0;
+                freeClusterLink(link);
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
+                return 0;
+            }
+        }
+
+        /* Copy the CLUSTER_NODE_NOFAILOVER flag from what the sender
+         * announced. This is a dynamic flag that we receive from the
+         * sender, and the latest status must be trusted. We need it to
+         * be propagated because the slave ranking used to understand the
+         * delay of each slave in the voting process, needs to know
+         * what are the instances really competing. */
+        if (sender) {
+            int nofailover = flags & CLUSTER_NODE_NOFAILOVER;
+            sender->flags &= ~CLUSTER_NODE_NOFAILOVER;
+            sender->flags |= nofailover;
+        }
+
+        /* Update the node address if it changed. */
+        if (sender && type == CLUSTERMSG_TYPE_PING &&
+            !nodeInHandshake(sender) &&
+            nodeUpdateAddressIfNeeded(sender,link,hdr))
+        {
+            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                 CLUSTER_TODO_UPDATE_STATE);
+        }
+
+        /* Update our info about the node */
+        if (link->node && type == CLUSTERMSG_TYPE_PONG) {
+            link->node->pong_received = now;
+            link->node->ping_sent = 0;
+
+            /* The PFAIL condition can be reversed without external
+             * help if it is momentary (that is, if it does not
+             * turn into a FAIL state).
+             *
+             * The FAIL condition is also reversible under specific
+             * conditions detected by clearNodeFailureIfNeeded(). */
+            if (nodeTimedOut(link->node)) {
+                link->node->flags &= ~CLUSTER_NODE_PFAIL;
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                     CLUSTER_TODO_UPDATE_STATE);
+            } else if (nodeFailed(link->node)) {
+                clearNodeFailureIfNeeded(link->node);
+            }
+        }
+
+        /* Check for role switch: slave -> master or master -> slave. */
+        if (sender) {
+            if (!memcmp(hdr->slaveof,CLUSTER_NODE_NULL_NAME,
+                sizeof(hdr->slaveof)))
+            {
+                /* Node is a master. */
+                clusterSetNodeAsMaster(sender);
+            } else {
+                /* Node is a slave. */
+                clusterNode *master = clusterLookupNode(hdr->slaveof);
+
+                if (nodeIsMaster(sender)) {
+                    /* Master turned into a slave! Reconfigure the node. */
+                    clusterDelNodeSlots(sender);
+                    sender->flags &= ~(CLUSTER_NODE_MASTER|
+                                       CLUSTER_NODE_MIGRATE_TO);
+                    sender->flags |= CLUSTER_NODE_SLAVE;
+
+                    /* Update config and state. */
+                    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                         CLUSTER_TODO_UPDATE_STATE);
+                }
+
+                /* Master node changed for this slave? */
+                if (master && sender->slaveof != master) {
+                    if (sender->slaveof)
+                        clusterNodeRemoveSlave(sender->slaveof,sender);
+                    clusterNodeAddSlave(master,sender);
+                    sender->slaveof = master;
+
+                    /* Update config. */
+                    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
+                }
+            }
+        }
+
+        /* Update our info about served slots.
+         *
+         * Note: this MUST happen after we update the master/slave state
+         * so that CLUSTER_NODE_MASTER flag will be set. */
+
+        /* Many checks are only needed if the set of served slots this
+         * instance claims is different compared to the set of slots we have
+         * for it. Check this ASAP to avoid other computational expansive
+         * checks later. */
+        clusterNode *sender_master = NULL; /* Sender or its master if slave. */
+        int dirty_slots = 0; /* Sender claimed slots don't match my view? */
+
+        if (sender) {
+            sender_master = nodeIsMaster(sender) ? sender : sender->slaveof;
+            if (sender_master) {
+                dirty_slots = memcmp(sender_master->slots,
+                        hdr->myslots,sizeof(hdr->myslots)) != 0;
+            }
+        }
+
+        /* 1) If the sender of the message is a master, and we detected that
+         *    the set of slots it claims changed, scan the slots to see if we
+         *    need to update our configuration. */
+        if (sender && nodeIsMaster(sender) && dirty_slots)
+            clusterUpdateSlotsConfigWith(sender,senderConfigEpoch,hdr->myslots);
+
+        /* 2) We also check for the reverse condition, that is, the sender
+         *    claims to serve slots we know are served by a master with a
+         *    greater configEpoch. If this happens we inform the sender.
+         *
+         * This is useful because sometimes after a partition heals, a
+         * reappearing master may be the last one to claim a given set of
+         * hash slots, but with a configuration that other instances know to
+         * be deprecated. Example:
+         *
+         * A and B are master and slave for slots 1,2,3.
+         * A is partitioned away, B gets promoted.
+         * B is partitioned away, and A returns available.
+         *
+         * Usually B would PING A publishing its set of served slots and its
+         * configEpoch, but because of the partition B can't inform A of the
+         * new configuration, so other nodes that have an updated table must
+         * do it. In this way A will stop to act as a master (or can try to
+         * failover if there are the conditions to win the election). */
+        if (sender && dirty_slots) {
+            int j;
+
+            for (j = 0; j < CLUSTER_SLOTS; j++) {
+                if (bitmapTestBit(hdr->myslots,j)) {
+                    if (server.cluster->slots[j] == sender ||
+                        server.cluster->slots[j] == NULL) continue;
+                    if (server.cluster->slots[j]->configEpoch >
+                        senderConfigEpoch)
+                    {
+                        serverLog(LL_VERBOSE,
+                            "Node %.40s has old slots configuration, sending "
+                            "an UPDATE message about %.40s",
+                                sender->name, server.cluster->slots[j]->name);
+                        clusterSendUpdate(sender->link,
+                            server.cluster->slots[j]);
+
+                        /* TODO: instead of exiting the loop send every other
+                         * UPDATE packet for other nodes that are the new owner
+                         * of sender's slots. */
+                        break;
+                    }
+                }
+            }
+        }
+
+        /* If our config epoch collides with the sender's try to fix
+         * the problem. */
+        if (sender &&
+            nodeIsMaster(myself) && nodeIsMaster(sender) &&
+            senderConfigEpoch == myself->configEpoch)
+        {
+            clusterHandleConfigEpochCollision(sender);
+        }
+
+        /* Get info from the gossip section */
+        if (sender) clusterProcessGossipSection(hdr,link);
+    } else if (type == CLUSTERMSG_TYPE_FAIL) {
+        clusterNode *failing;
+
+        if (sender) {
+            failing = clusterLookupNode(hdr->data.fail.about.nodename);
+            if (failing &&
+                !(failing->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_MYSELF)))
+            {
+                serverLog(LL_NOTICE,
+                    "FAIL message received from %.40s about %.40s",
+                    hdr->sender, hdr->data.fail.about.nodename);
+                failing->flags |= CLUSTER_NODE_FAIL;
+                failing->fail_time = now;
+                failing->flags &= ~CLUSTER_NODE_PFAIL;
+                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                                     CLUSTER_TODO_UPDATE_STATE);
+            }
+        } else {
+            serverLog(LL_NOTICE,
+                "Ignoring FAIL message from unknown node %.40s about %.40s",
+                hdr->sender, hdr->data.fail.about.nodename);
+        }
+    } else if (type == CLUSTERMSG_TYPE_PUBLISH) {
+        robj *channel, *message;
+        uint32_t channel_len, message_len;
+
+        /* Don't bother creating useless objects if there are no
+         * Pub/Sub subscribers. */
+        if (dictSize(server.pubsub_channels) ||
+           dictSize(server.pubsub_patterns))
+        {
+            channel_len = ntohl(hdr->data.publish.msg.channel_len);
+            message_len = ntohl(hdr->data.publish.msg.message_len);
+            channel = createStringObject(
+                        (char*)hdr->data.publish.msg.bulk_data,channel_len);
+            message = createStringObject(
+                        (char*)hdr->data.publish.msg.bulk_data+channel_len,
+                        message_len);
+            pubsubPublishMessage(channel,message);
+            decrRefCount(channel);
+            decrRefCount(message);
+        }
+    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST) {
+        if (!sender) return 1;  /* We don't know that node. */
+        clusterSendFailoverAuthIfNeeded(sender,hdr);
+    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK) {
+        if (!sender) return 1;  /* We don't know that node. */
+        /* We consider this vote only if the sender is a master serving
+         * a non zero number of slots, and its currentEpoch is greater or
+         * equal to epoch where this node started the election. */
+        if (nodeIsMaster(sender) && sender->numslots > 0 &&
+            senderCurrentEpoch >= server.cluster->failover_auth_epoch)
+        {
+            server.cluster->failover_auth_count++;
+            /* Maybe we reached a quorum here, set a flag to make sure
+             * we check ASAP. */
+            clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
+        }
+    } else if (type == CLUSTERMSG_TYPE_MFSTART) {
+        /* This message is acceptable only if I'm a master and the sender
+         * is one of my slaves. */
+        if (!sender || sender->slaveof != myself) return 1;
+        /* Manual failover requested from slaves. Initialize the state
+         * accordingly. */
+        resetManualFailover();
+        server.cluster->mf_end = now + CLUSTER_MF_TIMEOUT;
+        server.cluster->mf_slave = sender;
+        pauseClients(now+(CLUSTER_MF_TIMEOUT*CLUSTER_MF_PAUSE_MULT),CLIENT_PAUSE_WRITE);
+        serverLog(LL_WARNING,"Manual failover requested by replica %.40s.",
+            sender->name);
+        /* We need to send a ping message to the replica, as it would carry
+         * `server.cluster->mf_master_offset`, which means the master paused clients
+         * at offset `server.cluster->mf_master_offset`, so that the replica would
+         * know that it is safe to set its `server.cluster->mf_can_start` to 1 so as
+         * to complete failover as quickly as possible. */
+        clusterSendPing(link, CLUSTERMSG_TYPE_PING);
+    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
+        clusterNode *n; /* The node the update is about. */
+        uint64_t reportedConfigEpoch =
+                    ntohu64(hdr->data.update.nodecfg.configEpoch);
+
+        if (!sender) return 1;  /* We don't know the sender. */
+        n = clusterLookupNode(hdr->data.update.nodecfg.nodename);
+        if (!n) return 1;   /* We don't know the reported node. */
+        if (n->configEpoch >= reportedConfigEpoch) return 1; /* Nothing new. */
+
+        /* If in our current config the node is a slave, set it as a master. */
+        if (nodeIsSlave(n)) clusterSetNodeAsMaster(n);
+
+        /* Update the node's configEpoch. */
+        n->configEpoch = reportedConfigEpoch;
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                             CLUSTER_TODO_FSYNC_CONFIG);
+
+        /* Check the bitmap of served slots and update our
+         * config accordingly. */
+        clusterUpdateSlotsConfigWith(n,reportedConfigEpoch,
+            hdr->data.update.nodecfg.slots);
+    } else if (type == CLUSTERMSG_TYPE_MODULE) {
+        if (!sender) return 1;  /* Protect the module from unknown nodes. */
+        /* We need to route this message back to the right module subscribed
+         * for the right message type. */
+        uint64_t module_id = hdr->data.module.msg.module_id; /* Endian-safe ID */
+        uint32_t len = ntohl(hdr->data.module.msg.len);
+        uint8_t type = hdr->data.module.msg.type;
+        unsigned char *payload = hdr->data.module.msg.bulk_data;
+        moduleCallClusterReceivers(sender->name,module_id,type,payload,len);
+    } else {
+        serverLog(LL_WARNING,"Received unknown packet type: %d", type);
+    }
+    return 1;
+}
+
+/* This function is called when we detect the link with this node is lost.
+   We set the node as no longer connected. The Cluster Cron will detect
+   this connection and will try to get it connected again.
+
+   Instead if the node is a temporary node used to accept a query, we
+   completely free the node on error. */
+void handleLinkIOError(clusterLink *link) {
+    freeClusterLink(link);
+}
+
+/* Send data. This is handled using a trivial send buffer that gets
+ * consumed by write(). We don't try to optimize this for speed too much
+ * as this is a very low traffic channel. */
+void clusterWriteHandler(connection *conn) {
+    clusterLink *link = connGetPrivateData(conn);
+    ssize_t nwritten;
+
+    nwritten = connWrite(conn, link->sndbuf, sdslen(link->sndbuf));
+    if (nwritten <= 0) {
+        serverLog(LL_DEBUG,"I/O error writing to node link: %s",
+            (nwritten == -1) ? connGetLastError(conn) : "short write");
+        handleLinkIOError(link);
+        return;
+    }
+    sdsrange(link->sndbuf,nwritten,-1);
+    if (sdslen(link->sndbuf) == 0)
+        connSetWriteHandler(link->conn, NULL);
+}
+
+/* A connect handler that gets called when a connection to another node
+ * gets established.
+ */
+void clusterLinkConnectHandler(connection *conn) {
+    clusterLink *link = connGetPrivateData(conn);
+    clusterNode *node = link->node;
+
+    /* Check if connection succeeded */
+    if (connGetState(conn) != CONN_STATE_CONNECTED) {
+        serverLog(LL_VERBOSE, "Connection with Node %.40s at %s:%d failed: %s",
+                node->name, node->ip, node->cport,
+                connGetLastError(conn));
+        freeClusterLink(link);
+        return;
+    }
+
+    /* Register a read handler from now on */
+    connSetReadHandler(conn, clusterReadHandler);
+
+    /* Queue a PING in the new connection ASAP: this is crucial
+     * to avoid false positives in failure detection.
+     *
+     * If the node is flagged as MEET, we send a MEET message instead
+     * of a PING one, to force the receiver to add us in its node
+     * table. */
+    mstime_t old_ping_sent = node->ping_sent;
+    clusterSendPing(link, node->flags & CLUSTER_NODE_MEET ?
+            CLUSTERMSG_TYPE_MEET : CLUSTERMSG_TYPE_PING);
+    if (old_ping_sent) {
+        /* If there was an active ping before the link was
+         * disconnected, we want to restore the ping time, otherwise
+         * replaced by the clusterSendPing() call. */
+        node->ping_sent = old_ping_sent;
+    }
+    /* We can clear the flag after the first packet is sent.
+     * If we'll never receive a PONG, we'll never send new packets
+     * to this node. Instead after the PONG is received and we
+     * are no longer in meet/handshake status, we want to send
+     * normal PING packets. */
+    node->flags &= ~CLUSTER_NODE_MEET;
+
+    serverLog(LL_DEBUG,"Connecting with Node %.40s at %s:%d",
+            node->name, node->ip, node->cport);
+}
+
+/* Read data. Try to read the first field of the header first to check the
+ * full length of the packet. When a whole packet is in memory this function
+ * will call the function to process the packet. And so forth. */
+void clusterReadHandler(connection *conn) {
+    clusterMsg buf[1];
+    ssize_t nread;
+    clusterMsg *hdr;
+    clusterLink *link = connGetPrivateData(conn);
+    unsigned int readlen, rcvbuflen;
+
+    while(1) { /* Read as long as there is data to read. */
+        rcvbuflen = link->rcvbuf_len;
+        if (rcvbuflen < 8) {
+            /* First, obtain the first 8 bytes to get the full message
+             * length. */
+            readlen = 8 - rcvbuflen;
+        } else {
+            /* Finally read the full message. */
+            hdr = (clusterMsg*) link->rcvbuf;
+            if (rcvbuflen == 8) {
+                /* Perform some sanity check on the message signature
+                 * and length. */
+                if (memcmp(hdr->sig,"RCmb",4) != 0 ||
+                    ntohl(hdr->totlen) < CLUSTERMSG_MIN_LEN)
+                {
+                    serverLog(LL_WARNING,
+                        "Bad message length or signature received "
+                        "from Cluster bus.");
+                    handleLinkIOError(link);
+                    return;
+                }
+            }
+            readlen = ntohl(hdr->totlen) - rcvbuflen;
+            if (readlen > sizeof(buf)) readlen = sizeof(buf);
+        }
+
+        nread = connRead(conn,buf,readlen);
+        if (nread == -1 && (connGetState(conn) == CONN_STATE_CONNECTED)) return; /* No more data ready. */
+
+        if (nread <= 0) {
+            /* I/O error... */
+            serverLog(LL_DEBUG,"I/O error reading from node link: %s",
+                (nread == 0) ? "connection closed" : connGetLastError(conn));
+            handleLinkIOError(link);
+            return;
+        } else {
+            /* Read data and recast the pointer to the new buffer. */
+            size_t unused = link->rcvbuf_alloc - link->rcvbuf_len;
+            if ((size_t)nread > unused) {
+                size_t required = link->rcvbuf_len + nread;
+                /* If less than 1mb, grow to twice the needed size, if larger grow by 1mb. */
+                link->rcvbuf_alloc = required < RCVBUF_MAX_PREALLOC ? required * 2: required + RCVBUF_MAX_PREALLOC;
+                link->rcvbuf = zrealloc(link->rcvbuf, link->rcvbuf_alloc);
+            }
+            memcpy(link->rcvbuf + link->rcvbuf_len, buf, nread);
+            link->rcvbuf_len += nread;
+            hdr = (clusterMsg*) link->rcvbuf;
+            rcvbuflen += nread;
+        }
+
+        /* Total length obtained? Process this packet. */
+        if (rcvbuflen >= 8 && rcvbuflen == ntohl(hdr->totlen)) {
+            if (clusterProcessPacket(link)) {
+                if (link->rcvbuf_alloc > RCVBUF_INIT_LEN) {
+                    zfree(link->rcvbuf);
+                    link->rcvbuf = zmalloc(link->rcvbuf_alloc = RCVBUF_INIT_LEN);
+                }
+                link->rcvbuf_len = 0;
+            } else {
+                return; /* Link no longer valid. */
+            }
+        }
+    }
+}
+
+/* Put stuff into the send buffer.
+ *
+ * It is guaranteed that this function will never have as a side effect
+ * the link to be invalidated, so it is safe to call this function
+ * from event handlers that will do stuff with the same link later. */
+void clusterSendMessage(clusterLink *link, unsigned char *msg, size_t msglen) {
+    if (sdslen(link->sndbuf) == 0 && msglen != 0)
+        connSetWriteHandlerWithBarrier(link->conn, clusterWriteHandler, 1);
+
+    link->sndbuf = sdscatlen(link->sndbuf, msg, msglen);
+
+    /* Populate sent messages stats. */
+    clusterMsg *hdr = (clusterMsg*) msg;
+    uint16_t type = ntohs(hdr->type);
+    if (type < CLUSTERMSG_TYPE_COUNT)
+        server.cluster->stats_bus_messages_sent[type]++;
+}
+
+/* Send a message to all the nodes that are part of the cluster having
+ * a connected link.
+ *
+ * It is guaranteed that this function will never have as a side effect
+ * some node->link to be invalidated, so it is safe to call this function
+ * from event handlers that will do stuff with node links later. */
+void clusterBroadcastMessage(void *buf, size_t len) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (!node->link) continue;
+        if (node->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_HANDSHAKE))
+            continue;
+        clusterSendMessage(node->link,buf,len);
+    }
+    dictReleaseIterator(di);
+}
+
+/* Build the message header. hdr must point to a buffer at least
+ * sizeof(clusterMsg) in bytes. */
+void clusterBuildMessageHdr(clusterMsg *hdr, int type) {
+    int totlen = 0;
+    uint64_t offset;
+    clusterNode *master;
+
+    /* If this node is a master, we send its slots bitmap and configEpoch.
+     * If this node is a slave we send the master's information instead (the
+     * node is flagged as slave so the receiver knows that it is NOT really
+     * in charge for this slots. */
+    master = (nodeIsSlave(myself) && myself->slaveof) ?
+              myself->slaveof : myself;
+
+    memset(hdr,0,sizeof(*hdr));
+    hdr->ver = htons(CLUSTER_PROTO_VER);
+    hdr->sig[0] = 'R';
+    hdr->sig[1] = 'C';
+    hdr->sig[2] = 'm';
+    hdr->sig[3] = 'b';
+    hdr->type = htons(type);
+    memcpy(hdr->sender,myself->name,CLUSTER_NAMELEN);
+
+    /* If cluster-announce-ip option is enabled, force the receivers of our
+     * packets to use the specified address for this node. Otherwise if the
+     * first byte is zero, they'll do auto discovery. */
+    memset(hdr->myip,0,NET_IP_STR_LEN);
+    if (server.cluster_announce_ip) {
+        strncpy(hdr->myip,server.cluster_announce_ip,NET_IP_STR_LEN);
+        hdr->myip[NET_IP_STR_LEN-1] = '\0';
+    }
+
+    /* Handle cluster-announce-[tls-|bus-]port. */
+    int announced_port, announced_pport, announced_cport;
+    deriveAnnouncedPorts(&announced_port, &announced_pport, &announced_cport);
+
+    memcpy(hdr->myslots,master->slots,sizeof(hdr->myslots));
+    memset(hdr->slaveof,0,CLUSTER_NAMELEN);
+    if (myself->slaveof != NULL)
+        memcpy(hdr->slaveof,myself->slaveof->name, CLUSTER_NAMELEN);
+    hdr->port = htons(announced_port);
+    hdr->pport = htons(announced_pport);
+    hdr->cport = htons(announced_cport);
+    hdr->flags = htons(myself->flags);
+    hdr->state = server.cluster->state;
+
+    /* Set the currentEpoch and configEpochs. */
+    hdr->currentEpoch = htonu64(server.cluster->currentEpoch);
+    hdr->configEpoch = htonu64(master->configEpoch);
+
+    /* Set the replication offset. */
+    if (nodeIsSlave(myself))
+        offset = replicationGetSlaveOffset();
+    else
+        offset = server.master_repl_offset;
+    hdr->offset = htonu64(offset);
+
+    /* Set the message flags. */
+    if (nodeIsMaster(myself) && server.cluster->mf_end)
+        hdr->mflags[0] |= CLUSTERMSG_FLAG0_PAUSED;
+
+    /* Compute the message length for certain messages. For other messages
+     * this is up to the caller. */
+    if (type == CLUSTERMSG_TYPE_FAIL) {
+        totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+        totlen += sizeof(clusterMsgDataFail);
+    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
+        totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+        totlen += sizeof(clusterMsgDataUpdate);
+    }
+    hdr->totlen = htonl(totlen);
+    /* For PING, PONG, and MEET, fixing the totlen field is up to the caller. */
+}
+
+/* Return non zero if the node is already present in the gossip section of the
+ * message pointed by 'hdr' and having 'count' gossip entries. Otherwise
+ * zero is returned. Helper for clusterSendPing(). */
+int clusterNodeIsInGossipSection(clusterMsg *hdr, int count, clusterNode *n) {
+    int j;
+    for (j = 0; j < count; j++) {
+        if (memcmp(hdr->data.ping.gossip[j].nodename,n->name,
+                CLUSTER_NAMELEN) == 0) break;
+    }
+    return j != count;
+}
+
+/* Set the i-th entry of the gossip section in the message pointed by 'hdr'
+ * to the info of the specified node 'n'. */
+void clusterSetGossipEntry(clusterMsg *hdr, int i, clusterNode *n) {
+    clusterMsgDataGossip *gossip;
+    gossip = &(hdr->data.ping.gossip[i]);
+    memcpy(gossip->nodename,n->name,CLUSTER_NAMELEN);
+    gossip->ping_sent = htonl(n->ping_sent/1000);
+    gossip->pong_received = htonl(n->pong_received/1000);
+    memcpy(gossip->ip,n->ip,sizeof(n->ip));
+    gossip->port = htons(n->port);
+    gossip->cport = htons(n->cport);
+    gossip->flags = htons(n->flags);
+    gossip->pport = htons(n->pport);
+    gossip->notused1 = 0;
+}
+
+/* Send a PING or PONG packet to the specified node, making sure to add enough
+ * gossip information. */
+void clusterSendPing(clusterLink *link, int type) {
+    unsigned char *buf;
+    clusterMsg *hdr;
+    int gossipcount = 0; /* Number of gossip sections added so far. */
+    int wanted; /* Number of gossip sections we want to append if possible. */
+    int totlen; /* Total packet length. */
+    /* freshnodes is the max number of nodes we can hope to append at all:
+     * nodes available minus two (ourself and the node we are sending the
+     * message to). However practically there may be less valid nodes since
+     * nodes in handshake state, disconnected, are not considered. */
+    int freshnodes = dictSize(server.cluster->nodes)-2;
+
+    /* How many gossip sections we want to add? 1/10 of the number of nodes
+     * and anyway at least 3. Why 1/10?
+     *
+     * If we have N masters, with N/10 entries, and we consider that in
+     * node_timeout we exchange with each other node at least 4 packets
+     * (we ping in the worst case in node_timeout/2 time, and we also
+     * receive two pings from the host), we have a total of 8 packets
+     * in the node_timeout*2 failure reports validity time. So we have
+     * that, for a single PFAIL node, we can expect to receive the following
+     * number of failure reports (in the specified window of time):
+     *
+     * PROB * GOSSIP_ENTRIES_PER_PACKET * TOTAL_PACKETS:
+     *
+     * PROB = probability of being featured in a single gossip entry,
+     *        which is 1 / NUM_OF_NODES.
+     * ENTRIES = 10.
+     * TOTAL_PACKETS = 2 * 4 * NUM_OF_MASTERS.
+     *
+     * If we assume we have just masters (so num of nodes and num of masters
+     * is the same), with 1/10 we always get over the majority, and specifically
+     * 80% of the number of nodes, to account for many masters failing at the
+     * same time.
+     *
+     * Since we have non-voting slaves that lower the probability of an entry
+     * to feature our node, we set the number of entries per packet as
+     * 10% of the total nodes we have. */
+    wanted = floor(dictSize(server.cluster->nodes)/10);
+    if (wanted < 3) wanted = 3;
+    if (wanted > freshnodes) wanted = freshnodes;
+
+    /* Include all the nodes in PFAIL state, so that failure reports are
+     * faster to propagate to go from PFAIL to FAIL state. */
+    int pfail_wanted = server.cluster->stats_pfail_nodes;
+
+    /* Compute the maximum totlen to allocate our buffer. We'll fix the totlen
+     * later according to the number of gossip sections we really were able
+     * to put inside the packet. */
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    totlen += (sizeof(clusterMsgDataGossip)*(wanted+pfail_wanted));
+    /* Note: clusterBuildMessageHdr() expects the buffer to be always at least
+     * sizeof(clusterMsg) or more. */
+    if (totlen < (int)sizeof(clusterMsg)) totlen = sizeof(clusterMsg);
+    buf = zcalloc(totlen);
+    hdr = (clusterMsg*) buf;
+
+    /* Populate the header. */
+    if (link->node && type == CLUSTERMSG_TYPE_PING)
+        link->node->ping_sent = mstime();
+    clusterBuildMessageHdr(hdr,type);
+
+    /* Populate the gossip fields */
+    int maxiterations = wanted*3;
+    while(freshnodes > 0 && gossipcount < wanted && maxiterations--) {
+        dictEntry *de = dictGetRandomKey(server.cluster->nodes);
+        clusterNode *this = dictGetVal(de);
+
+        /* Don't include this node: the whole packet header is about us
+         * already, so we just gossip about other nodes. */
+        if (this == myself) continue;
+
+        /* PFAIL nodes will be added later. */
+        if (this->flags & CLUSTER_NODE_PFAIL) continue;
+
+        /* In the gossip section don't include:
+         * 1) Nodes in HANDSHAKE state.
+         * 3) Nodes with the NOADDR flag set.
+         * 4) Disconnected nodes if they don't have configured slots.
+         */
+        if (this->flags & (CLUSTER_NODE_HANDSHAKE|CLUSTER_NODE_NOADDR) ||
+            (this->link == NULL && this->numslots == 0))
+        {
+            freshnodes--; /* Technically not correct, but saves CPU. */
+            continue;
+        }
+
+        /* Do not add a node we already have. */
+        if (clusterNodeIsInGossipSection(hdr,gossipcount,this)) continue;
+
+        /* Add it */
+        clusterSetGossipEntry(hdr,gossipcount,this);
+        freshnodes--;
+        gossipcount++;
+    }
+
+    /* If there are PFAIL nodes, add them at the end. */
+    if (pfail_wanted) {
+        dictIterator *di;
+        dictEntry *de;
+
+        di = dictGetSafeIterator(server.cluster->nodes);
+        while((de = dictNext(di)) != NULL && pfail_wanted > 0) {
+            clusterNode *node = dictGetVal(de);
+            if (node->flags & CLUSTER_NODE_HANDSHAKE) continue;
+            if (node->flags & CLUSTER_NODE_NOADDR) continue;
+            if (!(node->flags & CLUSTER_NODE_PFAIL)) continue;
+            clusterSetGossipEntry(hdr,gossipcount,node);
+            freshnodes--;
+            gossipcount++;
+            /* We take the count of the slots we allocated, since the
+             * PFAIL stats may not match perfectly with the current number
+             * of PFAIL nodes. */
+            pfail_wanted--;
+        }
+        dictReleaseIterator(di);
+    }
+
+    /* Ready to send... fix the totlen fiend and queue the message in the
+     * output buffer. */
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    totlen += (sizeof(clusterMsgDataGossip)*gossipcount);
+    hdr->count = htons(gossipcount);
+    hdr->totlen = htonl(totlen);
+    clusterSendMessage(link,buf,totlen);
+    zfree(buf);
+}
+
+/* Send a PONG packet to every connected node that's not in handshake state
+ * and for which we have a valid link.
+ *
+ * In Redis Cluster pongs are not used just for failure detection, but also
+ * to carry important configuration information. So broadcasting a pong is
+ * useful when something changes in the configuration and we want to make
+ * the cluster aware ASAP (for instance after a slave promotion).
+ *
+ * The 'target' argument specifies the receiving instances using the
+ * defines below:
+ *
+ * CLUSTER_BROADCAST_ALL -> All known instances.
+ * CLUSTER_BROADCAST_LOCAL_SLAVES -> All slaves in my master-slaves ring.
+ */
+#define CLUSTER_BROADCAST_ALL 0
+#define CLUSTER_BROADCAST_LOCAL_SLAVES 1
+void clusterBroadcastPong(int target) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (!node->link) continue;
+        if (node == myself || nodeInHandshake(node)) continue;
+        if (target == CLUSTER_BROADCAST_LOCAL_SLAVES) {
+            int local_slave =
+                nodeIsSlave(node) && node->slaveof &&
+                (node->slaveof == myself || node->slaveof == myself->slaveof);
+            if (!local_slave) continue;
+        }
+        clusterSendPing(node->link,CLUSTERMSG_TYPE_PONG);
+    }
+    dictReleaseIterator(di);
+}
+
+/* Send a PUBLISH message.
+ *
+ * If link is NULL, then the message is broadcasted to the whole cluster. */
+void clusterSendPublish(clusterLink *link, robj *channel, robj *message) {
+    unsigned char *payload;
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+    uint32_t totlen;
+    uint32_t channel_len, message_len;
+
+    channel = getDecodedObject(channel);
+    message = getDecodedObject(message);
+    channel_len = sdslen(channel->ptr);
+    message_len = sdslen(message->ptr);
+
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_PUBLISH);
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    totlen += sizeof(clusterMsgDataPublish) - 8 + channel_len + message_len;
+
+    hdr->data.publish.msg.channel_len = htonl(channel_len);
+    hdr->data.publish.msg.message_len = htonl(message_len);
+    hdr->totlen = htonl(totlen);
+
+    /* Try to use the local buffer if possible */
+    if (totlen < sizeof(buf)) {
+        payload = (unsigned char*)buf;
+    } else {
+        payload = zmalloc(totlen);
+        memcpy(payload,hdr,sizeof(*hdr));
+        hdr = (clusterMsg*) payload;
+    }
+    memcpy(hdr->data.publish.msg.bulk_data,channel->ptr,sdslen(channel->ptr));
+    memcpy(hdr->data.publish.msg.bulk_data+sdslen(channel->ptr),
+        message->ptr,sdslen(message->ptr));
+
+    if (link)
+        clusterSendMessage(link,payload,totlen);
+    else
+        clusterBroadcastMessage(payload,totlen);
+
+    decrRefCount(channel);
+    decrRefCount(message);
+    if (payload != (unsigned char*)buf) zfree(payload);
+}
+
+/* Send a FAIL message to all the nodes we are able to contact.
+ * The FAIL message is sent when we detect that a node is failing
+ * (CLUSTER_NODE_PFAIL) and we also receive a gossip confirmation of this:
+ * we switch the node state to CLUSTER_NODE_FAIL and ask all the other
+ * nodes to do the same ASAP. */
+void clusterSendFail(char *nodename) {
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAIL);
+    memcpy(hdr->data.fail.about.nodename,nodename,CLUSTER_NAMELEN);
+    clusterBroadcastMessage(buf,ntohl(hdr->totlen));
+}
+
+/* Send an UPDATE message to the specified link carrying the specified 'node'
+ * slots configuration. The node name, slots bitmap, and configEpoch info
+ * are included. */
+void clusterSendUpdate(clusterLink *link, clusterNode *node) {
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+
+    if (link == NULL) return;
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_UPDATE);
+    memcpy(hdr->data.update.nodecfg.nodename,node->name,CLUSTER_NAMELEN);
+    hdr->data.update.nodecfg.configEpoch = htonu64(node->configEpoch);
+    memcpy(hdr->data.update.nodecfg.slots,node->slots,sizeof(node->slots));
+    clusterSendMessage(link,(unsigned char*)buf,ntohl(hdr->totlen));
+}
+
+/* Send a MODULE message.
+ *
+ * If link is NULL, then the message is broadcasted to the whole cluster. */
+void clusterSendModule(clusterLink *link, uint64_t module_id, uint8_t type,
+                       unsigned char *payload, uint32_t len) {
+    unsigned char *heapbuf;
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+    uint32_t totlen;
+
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_MODULE);
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    totlen += sizeof(clusterMsgModule) - 3 + len;
+
+    hdr->data.module.msg.module_id = module_id; /* Already endian adjusted. */
+    hdr->data.module.msg.type = type;
+    hdr->data.module.msg.len = htonl(len);
+    hdr->totlen = htonl(totlen);
+
+    /* Try to use the local buffer if possible */
+    if (totlen < sizeof(buf)) {
+        heapbuf = (unsigned char*)buf;
+    } else {
+        heapbuf = zmalloc(totlen);
+        memcpy(heapbuf,hdr,sizeof(*hdr));
+        hdr = (clusterMsg*) heapbuf;
+    }
+    memcpy(hdr->data.module.msg.bulk_data,payload,len);
+
+    if (link)
+        clusterSendMessage(link,heapbuf,totlen);
+    else
+        clusterBroadcastMessage(heapbuf,totlen);
+
+    if (heapbuf != (unsigned char*)buf) zfree(heapbuf);
+}
+
+/* This function gets a cluster node ID string as target, the same way the nodes
+ * addresses are represented in the modules side, resolves the node, and sends
+ * the message. If the target is NULL the message is broadcasted.
+ *
+ * The function returns C_OK if the target is valid, otherwise C_ERR is
+ * returned. */
+int clusterSendModuleMessageToTarget(const char *target, uint64_t module_id, uint8_t type, unsigned char *payload, uint32_t len) {
+    clusterNode *node = NULL;
+
+    if (target != NULL) {
+        node = clusterLookupNode(target);
+        if (node == NULL || node->link == NULL) return C_ERR;
+    }
+
+    clusterSendModule(target ? node->link : NULL,
+                      module_id, type, payload, len);
+    return C_OK;
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER Pub/Sub support
+ *
+ * For now we do very little, just propagating PUBLISH messages across the whole
+ * cluster. In the future we'll try to get smarter and avoiding propagating those
+ * messages to hosts without receives for a given channel.
+ * -------------------------------------------------------------------------- */
+void clusterPropagatePublish(robj *channel, robj *message) {
+    clusterSendPublish(NULL, channel, message);
+}
+
+/* -----------------------------------------------------------------------------
+ * SLAVE node specific functions
+ * -------------------------------------------------------------------------- */
+
+/* This function sends a FAILOVER_AUTH_REQUEST message to every node in order to
+ * see if there is the quorum for this slave instance to failover its failing
+ * master.
+ *
+ * Note that we send the failover request to everybody, master and slave nodes,
+ * but only the masters are supposed to reply to our query. */
+void clusterRequestFailoverAuth(void) {
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+    uint32_t totlen;
+
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST);
+    /* If this is a manual failover, set the CLUSTERMSG_FLAG0_FORCEACK bit
+     * in the header to communicate the nodes receiving the message that
+     * they should authorized the failover even if the master is working. */
+    if (server.cluster->mf_end) hdr->mflags[0] |= CLUSTERMSG_FLAG0_FORCEACK;
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    hdr->totlen = htonl(totlen);
+    clusterBroadcastMessage(buf,totlen);
+}
+
+/* Send a FAILOVER_AUTH_ACK message to the specified node. */
+void clusterSendFailoverAuth(clusterNode *node) {
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+    uint32_t totlen;
+
+    if (!node->link) return;
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK);
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    hdr->totlen = htonl(totlen);
+    clusterSendMessage(node->link,(unsigned char*)buf,totlen);
+}
+
+/* Send a MFSTART message to the specified node. */
+void clusterSendMFStart(clusterNode *node) {
+    clusterMsg buf[1];
+    clusterMsg *hdr = (clusterMsg*) buf;
+    uint32_t totlen;
+
+    if (!node->link) return;
+    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_MFSTART);
+    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
+    hdr->totlen = htonl(totlen);
+    clusterSendMessage(node->link,(unsigned char*)buf,totlen);
+}
+
+/* Vote for the node asking for our vote if there are the conditions. */
+void clusterSendFailoverAuthIfNeeded(clusterNode *node, clusterMsg *request) {
+    clusterNode *master = node->slaveof;
+    uint64_t requestCurrentEpoch = ntohu64(request->currentEpoch);
+    uint64_t requestConfigEpoch = ntohu64(request->configEpoch);
+    unsigned char *claimed_slots = request->myslots;
+    int force_ack = request->mflags[0] & CLUSTERMSG_FLAG0_FORCEACK;
+    int j;
+
+    /* IF we are not a master serving at least 1 slot, we don't have the
+     * right to vote, as the cluster size in Redis Cluster is the number
+     * of masters serving at least one slot, and quorum is the cluster
+     * size + 1 */
+    if (nodeIsSlave(myself) || myself->numslots == 0) return;
+
+    /* Request epoch must be >= our currentEpoch.
+     * Note that it is impossible for it to actually be greater since
+     * our currentEpoch was updated as a side effect of receiving this
+     * request, if the request epoch was greater. */
+    if (requestCurrentEpoch < server.cluster->currentEpoch) {
+        serverLog(LL_WARNING,
+            "Failover auth denied to %.40s: reqEpoch (%llu) < curEpoch(%llu)",
+            node->name,
+            (unsigned long long) requestCurrentEpoch,
+            (unsigned long long) server.cluster->currentEpoch);
+        return;
+    }
+
+    /* I already voted for this epoch? Return ASAP. */
+    if (server.cluster->lastVoteEpoch == server.cluster->currentEpoch) {
+        serverLog(LL_WARNING,
+                "Failover auth denied to %.40s: already voted for epoch %llu",
+                node->name,
+                (unsigned long long) server.cluster->currentEpoch);
+        return;
+    }
+
+    /* Node must be a slave and its master down.
+     * The master can be non failing if the request is flagged
+     * with CLUSTERMSG_FLAG0_FORCEACK (manual failover). */
+    if (nodeIsMaster(node) || master == NULL ||
+        (!nodeFailed(master) && !force_ack))
+    {
+        if (nodeIsMaster(node)) {
+            serverLog(LL_WARNING,
+                    "Failover auth denied to %.40s: it is a master node",
+                    node->name);
+        } else if (master == NULL) {
+            serverLog(LL_WARNING,
+                    "Failover auth denied to %.40s: I don't know its master",
+                    node->name);
+        } else if (!nodeFailed(master)) {
+            serverLog(LL_WARNING,
+                    "Failover auth denied to %.40s: its master is up",
+                    node->name);
+        }
+        return;
+    }
+
+    /* We did not voted for a slave about this master for two
+     * times the node timeout. This is not strictly needed for correctness
+     * of the algorithm but makes the base case more linear. */
+    if (mstime() - node->slaveof->voted_time < server.cluster_node_timeout * 2)
+    {
+        serverLog(LL_WARNING,
+                "Failover auth denied to %.40s: "
+                "can't vote about this master before %lld milliseconds",
+                node->name,
+                (long long) ((server.cluster_node_timeout*2)-
+                             (mstime() - node->slaveof->voted_time)));
+        return;
+    }
+
+    /* The slave requesting the vote must have a configEpoch for the claimed
+     * slots that is >= the one of the masters currently serving the same
+     * slots in the current configuration. */
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (bitmapTestBit(claimed_slots, j) == 0) continue;
+        if (server.cluster->slots[j] == NULL ||
+            server.cluster->slots[j]->configEpoch <= requestConfigEpoch)
+        {
+            continue;
+        }
+        /* If we reached this point we found a slot that in our current slots
+         * is served by a master with a greater configEpoch than the one claimed
+         * by the slave requesting our vote. Refuse to vote for this slave. */
+        serverLog(LL_WARNING,
+                "Failover auth denied to %.40s: "
+                "slot %d epoch (%llu) > reqEpoch (%llu)",
+                node->name, j,
+                (unsigned long long) server.cluster->slots[j]->configEpoch,
+                (unsigned long long) requestConfigEpoch);
+        return;
+    }
+
+    /* We can vote for this slave. */
+    server.cluster->lastVoteEpoch = server.cluster->currentEpoch;
+    node->slaveof->voted_time = mstime();
+    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|CLUSTER_TODO_FSYNC_CONFIG);
+    clusterSendFailoverAuth(node);
+    serverLog(LL_WARNING, "Failover auth granted to %.40s for epoch %llu",
+        node->name, (unsigned long long) server.cluster->currentEpoch);
+}
+
+/* This function returns the "rank" of this instance, a slave, in the context
+ * of its master-slaves ring. The rank of the slave is given by the number of
+ * other slaves for the same master that have a better replication offset
+ * compared to the local one (better means, greater, so they claim more data).
+ *
+ * A slave with rank 0 is the one with the greatest (most up to date)
+ * replication offset, and so forth. Note that because how the rank is computed
+ * multiple slaves may have the same rank, in case they have the same offset.
+ *
+ * The slave rank is used to add a delay to start an election in order to
+ * get voted and replace a failing master. Slaves with better replication
+ * offsets are more likely to win. */
+int clusterGetSlaveRank(void) {
+    long long myoffset;
+    int j, rank = 0;
+    clusterNode *master;
+
+    serverAssert(nodeIsSlave(myself));
+    master = myself->slaveof;
+    if (master == NULL) return 0; /* Never called by slaves without master. */
+
+    myoffset = replicationGetSlaveOffset();
+    for (j = 0; j < master->numslaves; j++)
+        if (master->slaves[j] != myself &&
+            !nodeCantFailover(master->slaves[j]) &&
+            master->slaves[j]->repl_offset > myoffset) rank++;
+    return rank;
+}
+
+/* This function is called by clusterHandleSlaveFailover() in order to
+ * let the slave log why it is not able to failover. Sometimes there are
+ * not the conditions, but since the failover function is called again and
+ * again, we can't log the same things continuously.
+ *
+ * This function works by logging only if a given set of conditions are
+ * true:
+ *
+ * 1) The reason for which the failover can't be initiated changed.
+ *    The reasons also include a NONE reason we reset the state to
+ *    when the slave finds that its master is fine (no FAIL flag).
+ * 2) Also, the log is emitted again if the master is still down and
+ *    the reason for not failing over is still the same, but more than
+ *    CLUSTER_CANT_FAILOVER_RELOG_PERIOD seconds elapsed.
+ * 3) Finally, the function only logs if the slave is down for more than
+ *    five seconds + NODE_TIMEOUT. This way nothing is logged when a
+ *    failover starts in a reasonable time.
+ *
+ * The function is called with the reason why the slave can't failover
+ * which is one of the integer macros CLUSTER_CANT_FAILOVER_*.
+ *
+ * The function is guaranteed to be called only if 'myself' is a slave. */
+void clusterLogCantFailover(int reason) {
+    char *msg;
+    static time_t lastlog_time = 0;
+    mstime_t nolog_fail_time = server.cluster_node_timeout + 5000;
+
+    /* Don't log if we have the same reason for some time. */
+    if (reason == server.cluster->cant_failover_reason &&
+        time(NULL)-lastlog_time < CLUSTER_CANT_FAILOVER_RELOG_PERIOD)
+        return;
+
+    server.cluster->cant_failover_reason = reason;
+
+    /* We also don't emit any log if the master failed no long ago, the
+     * goal of this function is to log slaves in a stalled condition for
+     * a long time. */
+    if (myself->slaveof &&
+        nodeFailed(myself->slaveof) &&
+        (mstime() - myself->slaveof->fail_time) < nolog_fail_time) return;
+
+    switch(reason) {
+    case CLUSTER_CANT_FAILOVER_DATA_AGE:
+        msg = "Disconnected from master for longer than allowed. "
+              "Please check the 'cluster-replica-validity-factor' configuration "
+              "option.";
+        break;
+    case CLUSTER_CANT_FAILOVER_WAITING_DELAY:
+        msg = "Waiting the delay before I can start a new failover.";
+        break;
+    case CLUSTER_CANT_FAILOVER_EXPIRED:
+        msg = "Failover attempt expired.";
+        break;
+    case CLUSTER_CANT_FAILOVER_WAITING_VOTES:
+        msg = "Waiting for votes, but majority still not reached.";
+        break;
+    default:
+        msg = "Unknown reason code.";
+        break;
+    }
+    lastlog_time = time(NULL);
+    serverLog(LL_WARNING,"Currently unable to failover: %s", msg);
+}
+
+/* This function implements the final part of automatic and manual failovers,
+ * where the slave grabs its master's hash slots, and propagates the new
+ * configuration.
+ *
+ * Note that it's up to the caller to be sure that the node got a new
+ * configuration epoch already. */
+void clusterFailoverReplaceYourMaster(void) {
+    int j;
+    clusterNode *oldmaster = myself->slaveof;
+
+    if (nodeIsMaster(myself) || oldmaster == NULL) return;
+
+    /* 1) Turn this node into a master. */
+    clusterSetNodeAsMaster(myself);
+    replicationUnsetMaster();
+
+    /* 2) Claim all the slots assigned to our master. */
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (clusterNodeGetSlotBit(oldmaster,j)) {
+            clusterDelSlot(j);
+            clusterAddSlot(myself,j);
+        }
+    }
+
+    /* 3) Update state and save config. */
+    clusterUpdateState();
+    clusterSaveConfigOrDie(1);
+
+    /* 4) Pong all the other nodes so that they can update the state
+     *    accordingly and detect that we switched to master role. */
+    clusterBroadcastPong(CLUSTER_BROADCAST_ALL);
+
+    /* 5) If there was a manual failover in progress, clear the state. */
+    resetManualFailover();
+}
+
+/* This function is called if we are a slave node and our master serving
+ * a non-zero amount of hash slots is in FAIL state.
+ *
+ * The goal of this function is:
+ * 1) To check if we are able to perform a failover, is our data updated?
+ * 2) Try to get elected by masters.
+ * 3) Perform the failover informing all the other nodes.
+ */
+void clusterHandleSlaveFailover(void) {
+    mstime_t data_age;
+    mstime_t auth_age = mstime() - server.cluster->failover_auth_time;
+    int needed_quorum = (server.cluster->size / 2) + 1;
+    int manual_failover = server.cluster->mf_end != 0 &&
+                          server.cluster->mf_can_start;
+    mstime_t auth_timeout, auth_retry_time;
+
+    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_HANDLE_FAILOVER;
+
+    /* Compute the failover timeout (the max time we have to send votes
+     * and wait for replies), and the failover retry time (the time to wait
+     * before trying to get voted again).
+     *
+     * Timeout is MAX(NODE_TIMEOUT*2,2000) milliseconds.
+     * Retry is two times the Timeout.
+     */
+    auth_timeout = server.cluster_node_timeout*2;
+    if (auth_timeout < 2000) auth_timeout = 2000;
+    auth_retry_time = auth_timeout*2;
+
+    /* Pre conditions to run the function, that must be met both in case
+     * of an automatic or manual failover:
+     * 1) We are a slave.
+     * 2) Our master is flagged as FAIL, or this is a manual failover.
+     * 3) We don't have the no failover configuration set, and this is
+     *    not a manual failover.
+     * 4) It is serving slots. */
+    if (nodeIsMaster(myself) ||
+        myself->slaveof == NULL ||
+        (!nodeFailed(myself->slaveof) && !manual_failover) ||
+        (server.cluster_slave_no_failover && !manual_failover) ||
+        myself->slaveof->numslots == 0)
+    {
+        /* There are no reasons to failover, so we set the reason why we
+         * are returning without failing over to NONE. */
+        server.cluster->cant_failover_reason = CLUSTER_CANT_FAILOVER_NONE;
+        return;
+    }
+
+    /* Set data_age to the number of milliseconds we are disconnected from
+     * the master. */
+    if (server.repl_state == REPL_STATE_CONNECTED) {
+        data_age = (mstime_t)(server.unixtime - server.master->lastinteraction)
+                   * 1000;
+    } else {
+        data_age = (mstime_t)(server.unixtime - server.repl_down_since) * 1000;
+    }
+
+    /* Remove the node timeout from the data age as it is fine that we are
+     * disconnected from our master at least for the time it was down to be
+     * flagged as FAIL, that's the baseline. */
+    if (data_age > server.cluster_node_timeout)
+        data_age -= server.cluster_node_timeout;
+
+    /* Check if our data is recent enough according to the slave validity
+     * factor configured by the user.
+     *
+     * Check bypassed for manual failovers. */
+    if (server.cluster_slave_validity_factor &&
+        data_age >
+        (((mstime_t)server.repl_ping_slave_period * 1000) +
+         (server.cluster_node_timeout * server.cluster_slave_validity_factor)))
+    {
+        if (!manual_failover) {
+            clusterLogCantFailover(CLUSTER_CANT_FAILOVER_DATA_AGE);
+            return;
+        }
+    }
+
+    /* If the previous failover attempt timeout and the retry time has
+     * elapsed, we can setup a new one. */
+    if (auth_age > auth_retry_time) {
+        server.cluster->failover_auth_time = mstime() +
+            500 + /* Fixed delay of 500 milliseconds, let FAIL msg propagate. */
+            random() % 500; /* Random delay between 0 and 500 milliseconds. */
+        server.cluster->failover_auth_count = 0;
+        server.cluster->failover_auth_sent = 0;
+        server.cluster->failover_auth_rank = clusterGetSlaveRank();
+        /* We add another delay that is proportional to the slave rank.
+         * Specifically 1 second * rank. This way slaves that have a probably
+         * less updated replication offset, are penalized. */
+        server.cluster->failover_auth_time +=
+            server.cluster->failover_auth_rank * 1000;
+        /* However if this is a manual failover, no delay is needed. */
+        if (server.cluster->mf_end) {
+            server.cluster->failover_auth_time = mstime();
+            server.cluster->failover_auth_rank = 0;
+	    clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
+        }
+        serverLog(LL_WARNING,
+            "Start of election delayed for %lld milliseconds "
+            "(rank #%d, offset %lld).",
+            server.cluster->failover_auth_time - mstime(),
+            server.cluster->failover_auth_rank,
+            replicationGetSlaveOffset());
+        /* Now that we have a scheduled election, broadcast our offset
+         * to all the other slaves so that they'll updated their offsets
+         * if our offset is better. */
+        clusterBroadcastPong(CLUSTER_BROADCAST_LOCAL_SLAVES);
+        return;
+    }
+
+    /* It is possible that we received more updated offsets from other
+     * slaves for the same master since we computed our election delay.
+     * Update the delay if our rank changed.
+     *
+     * Not performed if this is a manual failover. */
+    if (server.cluster->failover_auth_sent == 0 &&
+        server.cluster->mf_end == 0)
+    {
+        int newrank = clusterGetSlaveRank();
+        if (newrank > server.cluster->failover_auth_rank) {
+            long long added_delay =
+                (newrank - server.cluster->failover_auth_rank) * 1000;
+            server.cluster->failover_auth_time += added_delay;
+            server.cluster->failover_auth_rank = newrank;
+            serverLog(LL_WARNING,
+                "Replica rank updated to #%d, added %lld milliseconds of delay.",
+                newrank, added_delay);
+        }
+    }
+
+    /* Return ASAP if we can't still start the election. */
+    if (mstime() < server.cluster->failover_auth_time) {
+        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_WAITING_DELAY);
+        return;
+    }
+
+    /* Return ASAP if the election is too old to be valid. */
+    if (auth_age > auth_timeout) {
+        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_EXPIRED);
+        return;
+    }
+
+    /* Ask for votes if needed. */
+    if (server.cluster->failover_auth_sent == 0) {
+        server.cluster->currentEpoch++;
+        server.cluster->failover_auth_epoch = server.cluster->currentEpoch;
+        serverLog(LL_WARNING,"Starting a failover election for epoch %llu.",
+            (unsigned long long) server.cluster->currentEpoch);
+        clusterRequestFailoverAuth();
+        server.cluster->failover_auth_sent = 1;
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
+                             CLUSTER_TODO_UPDATE_STATE|
+                             CLUSTER_TODO_FSYNC_CONFIG);
+        return; /* Wait for replies. */
+    }
+
+    /* Check if we reached the quorum. */
+    if (server.cluster->failover_auth_count >= needed_quorum) {
+        /* We have the quorum, we can finally failover the master. */
+
+        serverLog(LL_WARNING,
+            "Failover election won: I'm the new master.");
+
+        /* Update my configEpoch to the epoch of the election. */
+        if (myself->configEpoch < server.cluster->failover_auth_epoch) {
+            myself->configEpoch = server.cluster->failover_auth_epoch;
+            serverLog(LL_WARNING,
+                "configEpoch set to %llu after successful failover",
+                (unsigned long long) myself->configEpoch);
+        }
+
+        /* Take responsibility for the cluster slots. */
+        clusterFailoverReplaceYourMaster();
+    } else {
+        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_WAITING_VOTES);
+    }
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER slave migration
+ *
+ * Slave migration is the process that allows a slave of a master that is
+ * already covered by at least another slave, to "migrate" to a master that
+ * is orphaned, that is, left with no working slaves.
+ * ------------------------------------------------------------------------- */
+
+/* This function is responsible to decide if this replica should be migrated
+ * to a different (orphaned) master. It is called by the clusterCron() function
+ * only if:
+ *
+ * 1) We are a slave node.
+ * 2) It was detected that there is at least one orphaned master in
+ *    the cluster.
+ * 3) We are a slave of one of the masters with the greatest number of
+ *    slaves.
+ *
+ * This checks are performed by the caller since it requires to iterate
+ * the nodes anyway, so we spend time into clusterHandleSlaveMigration()
+ * if definitely needed.
+ *
+ * The function is called with a pre-computed max_slaves, that is the max
+ * number of working (not in FAIL state) slaves for a single master.
+ *
+ * Additional conditions for migration are examined inside the function.
+ */
+void clusterHandleSlaveMigration(int max_slaves) {
+    int j, okslaves = 0;
+    clusterNode *mymaster = myself->slaveof, *target = NULL, *candidate = NULL;
+    dictIterator *di;
+    dictEntry *de;
+
+    /* Step 1: Don't migrate if the cluster state is not ok. */
+    if (server.cluster->state != CLUSTER_OK) return;
+
+    /* Step 2: Don't migrate if my master will not be left with at least
+     *         'migration-barrier' slaves after my migration. */
+    if (mymaster == NULL) return;
+    for (j = 0; j < mymaster->numslaves; j++)
+        if (!nodeFailed(mymaster->slaves[j]) &&
+            !nodeTimedOut(mymaster->slaves[j])) okslaves++;
+    if (okslaves <= server.cluster_migration_barrier) return;
+
+    /* Step 3: Identify a candidate for migration, and check if among the
+     * masters with the greatest number of ok slaves, I'm the one with the
+     * smallest node ID (the "candidate slave").
+     *
+     * Note: this means that eventually a replica migration will occur
+     * since slaves that are reachable again always have their FAIL flag
+     * cleared, so eventually there must be a candidate. At the same time
+     * this does not mean that there are no race conditions possible (two
+     * slaves migrating at the same time), but this is unlikely to
+     * happen, and harmless when happens. */
+    candidate = myself;
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+        int okslaves = 0, is_orphaned = 1;
+
+        /* We want to migrate only if this master is working, orphaned, and
+         * used to have slaves or if failed over a master that had slaves
+         * (MIGRATE_TO flag). This way we only migrate to instances that were
+         * supposed to have replicas. */
+        if (nodeIsSlave(node) || nodeFailed(node)) is_orphaned = 0;
+        if (!(node->flags & CLUSTER_NODE_MIGRATE_TO)) is_orphaned = 0;
+
+        /* Check number of working slaves. */
+        if (nodeIsMaster(node)) okslaves = clusterCountNonFailingSlaves(node);
+        if (okslaves > 0) is_orphaned = 0;
+
+        if (is_orphaned) {
+            if (!target && node->numslots > 0) target = node;
+
+            /* Track the starting time of the orphaned condition for this
+             * master. */
+            if (!node->orphaned_time) node->orphaned_time = mstime();
+        } else {
+            node->orphaned_time = 0;
+        }
+
+        /* Check if I'm the slave candidate for the migration: attached
+         * to a master with the maximum number of slaves and with the smallest
+         * node ID. */
+        if (okslaves == max_slaves) {
+            for (j = 0; j < node->numslaves; j++) {
+                if (memcmp(node->slaves[j]->name,
+                           candidate->name,
+                           CLUSTER_NAMELEN) < 0)
+                {
+                    candidate = node->slaves[j];
+                }
+            }
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Step 4: perform the migration if there is a target, and if I'm the
+     * candidate, but only if the master is continuously orphaned for a
+     * couple of seconds, so that during failovers, we give some time to
+     * the natural slaves of this instance to advertise their switch from
+     * the old master to the new one. */
+    if (target && candidate == myself &&
+        (mstime()-target->orphaned_time) > CLUSTER_SLAVE_MIGRATION_DELAY &&
+       !(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
+    {
+        serverLog(LL_WARNING,"Migrating to orphaned master %.40s",
+            target->name);
+        clusterSetMaster(target);
+    }
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER manual failover
+ *
+ * This are the important steps performed by slaves during a manual failover:
+ * 1) User send CLUSTER FAILOVER command. The failover state is initialized
+ *    setting mf_end to the millisecond unix time at which we'll abort the
+ *    attempt.
+ * 2) Slave sends a MFSTART message to the master requesting to pause clients
+ *    for two times the manual failover timeout CLUSTER_MF_TIMEOUT.
+ *    When master is paused for manual failover, it also starts to flag
+ *    packets with CLUSTERMSG_FLAG0_PAUSED.
+ * 3) Slave waits for master to send its replication offset flagged as PAUSED.
+ * 4) If slave received the offset from the master, and its offset matches,
+ *    mf_can_start is set to 1, and clusterHandleSlaveFailover() will perform
+ *    the failover as usually, with the difference that the vote request
+ *    will be modified to force masters to vote for a slave that has a
+ *    working master.
+ *
+ * From the point of view of the master things are simpler: when a
+ * PAUSE_CLIENTS packet is received the master sets mf_end as well and
+ * the sender in mf_slave. During the time limit for the manual failover
+ * the master will just send PINGs more often to this slave, flagged with
+ * the PAUSED flag, so that the slave will set mf_master_offset when receiving
+ * a packet from the master with this flag set.
+ *
+ * The gaol of the manual failover is to perform a fast failover without
+ * data loss due to the asynchronous master-slave replication.
+ * -------------------------------------------------------------------------- */
+
+/* Reset the manual failover state. This works for both masters and slaves
+ * as all the state about manual failover is cleared.
+ *
+ * The function can be used both to initialize the manual failover state at
+ * startup or to abort a manual failover in progress. */
+void resetManualFailover(void) {
+    if (server.cluster->mf_end) {
+        checkClientPauseTimeoutAndReturnIfPaused();
+    }
+    server.cluster->mf_end = 0; /* No manual failover in progress. */
+    server.cluster->mf_can_start = 0;
+    server.cluster->mf_slave = NULL;
+    server.cluster->mf_master_offset = -1;
+}
+
+/* If a manual failover timed out, abort it. */
+void manualFailoverCheckTimeout(void) {
+    if (server.cluster->mf_end && server.cluster->mf_end < mstime()) {
+        serverLog(LL_WARNING,"Manual failover timed out.");
+        resetManualFailover();
+    }
+}
+
+/* This function is called from the cluster cron function in order to go
+ * forward with a manual failover state machine. */
+void clusterHandleManualFailover(void) {
+    /* Return ASAP if no manual failover is in progress. */
+    if (server.cluster->mf_end == 0) return;
+
+    /* If mf_can_start is non-zero, the failover was already triggered so the
+     * next steps are performed by clusterHandleSlaveFailover(). */
+    if (server.cluster->mf_can_start) return;
+
+    if (server.cluster->mf_master_offset == -1) return; /* Wait for offset... */
+
+    if (server.cluster->mf_master_offset == replicationGetSlaveOffset()) {
+        /* Our replication offset matches the master replication offset
+         * announced after clients were paused. We can start the failover. */
+        server.cluster->mf_can_start = 1;
+        serverLog(LL_WARNING,
+            "All master replication stream processed, "
+            "manual failover can start.");
+        clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
+        return;
+    }
+    clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_MANUALFAILOVER);
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER cron job
+ * -------------------------------------------------------------------------- */
+
+/* This is executed 10 times every second */
+void clusterCron(void) {
+    dictIterator *di;
+    dictEntry *de;
+    int update_state = 0;
+    int orphaned_masters; /* How many masters there are without ok slaves. */
+    int max_slaves; /* Max number of ok slaves for a single master. */
+    int this_slaves; /* Number of ok slaves for our master (if we are slave). */
+    mstime_t min_pong = 0, now = mstime();
+    clusterNode *min_pong_node = NULL;
+    static unsigned long long iteration = 0;
+    mstime_t handshake_timeout;
+
+    iteration++; /* Number of times this function was called so far. */
+
+    /* We want to take myself->ip in sync with the cluster-announce-ip option.
+     * The option can be set at runtime via CONFIG SET, so we periodically check
+     * if the option changed to reflect this into myself->ip. */
+    {
+        static char *prev_ip = NULL;
+        char *curr_ip = server.cluster_announce_ip;
+        int changed = 0;
+
+        if (prev_ip == NULL && curr_ip != NULL) changed = 1;
+        else if (prev_ip != NULL && curr_ip == NULL) changed = 1;
+        else if (prev_ip && curr_ip && strcmp(prev_ip,curr_ip)) changed = 1;
+
+        if (changed) {
+            if (prev_ip) zfree(prev_ip);
+            prev_ip = curr_ip;
+
+            if (curr_ip) {
+                /* We always take a copy of the previous IP address, by
+                 * duplicating the string. This way later we can check if
+                 * the address really changed. */
+                prev_ip = zstrdup(prev_ip);
+                strncpy(myself->ip,server.cluster_announce_ip,NET_IP_STR_LEN);
+                myself->ip[NET_IP_STR_LEN-1] = '\0';
+            } else {
+                myself->ip[0] = '\0'; /* Force autodetection. */
+            }
+        }
+    }
+
+    /* The handshake timeout is the time after which a handshake node that was
+     * not turned into a normal node is removed from the nodes. Usually it is
+     * just the NODE_TIMEOUT value, but when NODE_TIMEOUT is too small we use
+     * the value of 1 second. */
+    handshake_timeout = server.cluster_node_timeout;
+    if (handshake_timeout < 1000) handshake_timeout = 1000;
+
+    /* Update myself flags. */
+    clusterUpdateMyselfFlags();
+
+    /* Check if we have disconnected nodes and re-establish the connection.
+     * Also update a few stats while we are here, that can be used to make
+     * better decisions in other part of the code. */
+    di = dictGetSafeIterator(server.cluster->nodes);
+    server.cluster->stats_pfail_nodes = 0;
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        /* Not interested in reconnecting the link with myself or nodes
+         * for which we have no address. */
+        if (node->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_NOADDR)) continue;
+
+        if (node->flags & CLUSTER_NODE_PFAIL)
+            server.cluster->stats_pfail_nodes++;
+
+        /* A Node in HANDSHAKE state has a limited lifespan equal to the
+         * configured node timeout. */
+        if (nodeInHandshake(node) && now - node->ctime > handshake_timeout) {
+            clusterDelNode(node);
+            continue;
+        }
+
+        if (node->link == NULL) {
+            clusterLink *link = createClusterLink(node);
+            link->conn = server.tls_cluster ? connCreateTLS() : connCreateSocket();
+            connSetPrivateData(link->conn, link);
+            if (connConnect(link->conn, node->ip, node->cport, NET_FIRST_BIND_ADDR,
+                        clusterLinkConnectHandler) == -1) {
+                /* We got a synchronous error from connect before
+                 * clusterSendPing() had a chance to be called.
+                 * If node->ping_sent is zero, failure detection can't work,
+                 * so we claim we actually sent a ping now (that will
+                 * be really sent as soon as the link is obtained). */
+                if (node->ping_sent == 0) node->ping_sent = mstime();
+                serverLog(LL_DEBUG, "Unable to connect to "
+                    "Cluster Node [%s]:%d -> %s", node->ip,
+                    node->cport, server.neterr);
+
+                freeClusterLink(link);
+                continue;
+            }
+            node->link = link;
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Ping some random node 1 time every 10 iterations, so that we usually ping
+     * one random node every second. */
+    if (!(iteration % 10)) {
+        int j;
+
+        /* Check a few random nodes and ping the one with the oldest
+         * pong_received time. */
+        for (j = 0; j < 5; j++) {
+            de = dictGetRandomKey(server.cluster->nodes);
+            clusterNode *this = dictGetVal(de);
+
+            /* Don't ping nodes disconnected or with a ping currently active. */
+            if (this->link == NULL || this->ping_sent != 0) continue;
+            if (this->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_HANDSHAKE))
+                continue;
+            if (min_pong_node == NULL || min_pong > this->pong_received) {
+                min_pong_node = this;
+                min_pong = this->pong_received;
+            }
+        }
+        if (min_pong_node) {
+            serverLog(LL_DEBUG,"Pinging node %.40s", min_pong_node->name);
+            clusterSendPing(min_pong_node->link, CLUSTERMSG_TYPE_PING);
+        }
+    }
+
+    /* Iterate nodes to check if we need to flag something as failing.
+     * This loop is also responsible to:
+     * 1) Check if there are orphaned masters (masters without non failing
+     *    slaves).
+     * 2) Count the max number of non failing slaves for a single master.
+     * 3) Count the number of slaves for our master, if we are a slave. */
+    orphaned_masters = 0;
+    max_slaves = 0;
+    this_slaves = 0;
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+        now = mstime(); /* Use an updated time at every iteration. */
+
+        if (node->flags &
+            (CLUSTER_NODE_MYSELF|CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE))
+                continue;
+
+        /* Orphaned master check, useful only if the current instance
+         * is a slave that may migrate to another master. */
+        if (nodeIsSlave(myself) && nodeIsMaster(node) && !nodeFailed(node)) {
+            int okslaves = clusterCountNonFailingSlaves(node);
+
+            /* A master is orphaned if it is serving a non-zero number of
+             * slots, have no working slaves, but used to have at least one
+             * slave, or failed over a master that used to have slaves. */
+            if (okslaves == 0 && node->numslots > 0 &&
+                node->flags & CLUSTER_NODE_MIGRATE_TO)
+            {
+                orphaned_masters++;
+            }
+            if (okslaves > max_slaves) max_slaves = okslaves;
+            if (nodeIsSlave(myself) && myself->slaveof == node)
+                this_slaves = okslaves;
+        }
+
+        /* If we are not receiving any data for more than half the cluster
+         * timeout, reconnect the link: maybe there is a connection
+         * issue even if the node is alive. */
+        mstime_t ping_delay = now - node->ping_sent;
+        mstime_t data_delay = now - node->data_received;
+        if (node->link && /* is connected */
+            now - node->link->ctime >
+            server.cluster_node_timeout && /* was not already reconnected */
+            node->ping_sent && /* we already sent a ping */
+            /* and we are waiting for the pong more than timeout/2 */
+            ping_delay > server.cluster_node_timeout/2 &&
+            /* and in such interval we are not seeing any traffic at all. */
+            data_delay > server.cluster_node_timeout/2)
+        {
+            /* Disconnect the link, it will be reconnected automatically. */
+            freeClusterLink(node->link);
+        }
+
+        /* If we have currently no active ping in this instance, and the
+         * received PONG is older than half the cluster timeout, send
+         * a new ping now, to ensure all the nodes are pinged without
+         * a too big delay. */
+        if (node->link &&
+            node->ping_sent == 0 &&
+            (now - node->pong_received) > server.cluster_node_timeout/2)
+        {
+            clusterSendPing(node->link, CLUSTERMSG_TYPE_PING);
+            continue;
+        }
+
+        /* If we are a master and one of the slaves requested a manual
+         * failover, ping it continuously. */
+        if (server.cluster->mf_end &&
+            nodeIsMaster(myself) &&
+            server.cluster->mf_slave == node &&
+            node->link)
+        {
+            clusterSendPing(node->link, CLUSTERMSG_TYPE_PING);
+            continue;
+        }
+
+        /* Check only if we have an active ping for this instance. */
+        if (node->ping_sent == 0) continue;
+
+        /* Check if this node looks unreachable.
+         * Note that if we already received the PONG, then node->ping_sent
+         * is zero, so can't reach this code at all, so we don't risk of
+         * checking for a PONG delay if we didn't sent the PING.
+         *
+         * We also consider every incoming data as proof of liveness, since
+         * our cluster bus link is also used for data: under heavy data
+         * load pong delays are possible. */
+        mstime_t node_delay = (ping_delay < data_delay) ? ping_delay :
+                                                          data_delay;
+
+        if (node_delay > server.cluster_node_timeout) {
+            /* Timeout reached. Set the node as possibly failing if it is
+             * not already in this state. */
+            if (!(node->flags & (CLUSTER_NODE_PFAIL|CLUSTER_NODE_FAIL))) {
+                serverLog(LL_DEBUG,"*** NODE %.40s possibly failing",
+                    node->name);
+                node->flags |= CLUSTER_NODE_PFAIL;
+                update_state = 1;
+            }
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* If we are a slave node but the replication is still turned off,
+     * enable it if we know the address of our master and it appears to
+     * be up. */
+    if (nodeIsSlave(myself) &&
+        server.masterhost == NULL &&
+        myself->slaveof &&
+        nodeHasAddr(myself->slaveof))
+    {
+        replicationSetMaster(myself->slaveof->ip, myself->slaveof->port);
+    }
+
+    /* Abort a manual failover if the timeout is reached. */
+    manualFailoverCheckTimeout();
+
+    if (nodeIsSlave(myself)) {
+        clusterHandleManualFailover();
+        if (!(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
+            clusterHandleSlaveFailover();
+        /* If there are orphaned slaves, and we are a slave among the masters
+         * with the max number of non-failing slaves, consider migrating to
+         * the orphaned masters. Note that it does not make sense to try
+         * a migration if there is no master with at least *two* working
+         * slaves. */
+        if (orphaned_masters && max_slaves >= 2 && this_slaves == max_slaves &&
+		server.cluster_allow_replica_migration)
+            clusterHandleSlaveMigration(max_slaves);
+    }
+
+    if (update_state || server.cluster->state == CLUSTER_FAIL)
+        clusterUpdateState();
+}
+
+/* This function is called before the event handler returns to sleep for
+ * events. It is useful to perform operations that must be done ASAP in
+ * reaction to events fired but that are not safe to perform inside event
+ * handlers, or to perform potentially expansive tasks that we need to do
+ * a single time before replying to clients. */
+void clusterBeforeSleep(void) {
+    int flags = server.cluster->todo_before_sleep;
+
+    /* Reset our flags (not strictly needed since every single function
+     * called for flags set should be able to clear its flag). */
+    server.cluster->todo_before_sleep = 0;
+
+    if (flags & CLUSTER_TODO_HANDLE_MANUALFAILOVER) {
+        /* Handle manual failover as soon as possible so that won't have a 100ms
+         * as it was handled only in clusterCron */
+        if(nodeIsSlave(myself)) {
+            clusterHandleManualFailover();
+            if (!(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
+                clusterHandleSlaveFailover();
+        }
+    } else if (flags & CLUSTER_TODO_HANDLE_FAILOVER) {
+        /* Handle failover, this is needed when it is likely that there is already
+         * the quorum from masters in order to react fast. */
+        clusterHandleSlaveFailover();
+    }
+
+    /* Update the cluster state. */
+    if (flags & CLUSTER_TODO_UPDATE_STATE)
+        clusterUpdateState();
+
+    /* Save the config, possibly using fsync. */
+    if (flags & CLUSTER_TODO_SAVE_CONFIG) {
+        int fsync = flags & CLUSTER_TODO_FSYNC_CONFIG;
+        clusterSaveConfigOrDie(fsync);
+    }
+}
+
+void clusterDoBeforeSleep(int flags) {
+    server.cluster->todo_before_sleep |= flags;
+}
+
+/* -----------------------------------------------------------------------------
+ * Slots management
+ * -------------------------------------------------------------------------- */
+
+/* Test bit 'pos' in a generic bitmap. Return 1 if the bit is set,
+ * otherwise 0. */
+int bitmapTestBit(unsigned char *bitmap, int pos) {
+    off_t byte = pos/8;
+    int bit = pos&7;
+    return (bitmap[byte] & (1<<bit)) != 0;
+}
+
+/* Set the bit at position 'pos' in a bitmap. */
+void bitmapSetBit(unsigned char *bitmap, int pos) {
+    off_t byte = pos/8;
+    int bit = pos&7;
+    bitmap[byte] |= 1<<bit;
+}
+
+/* Clear the bit at position 'pos' in a bitmap. */
+void bitmapClearBit(unsigned char *bitmap, int pos) {
+    off_t byte = pos/8;
+    int bit = pos&7;
+    bitmap[byte] &= ~(1<<bit);
+}
+
+/* Return non-zero if there is at least one master with slaves in the cluster.
+ * Otherwise zero is returned. Used by clusterNodeSetSlotBit() to set the
+ * MIGRATE_TO flag the when a master gets the first slot. */
+int clusterMastersHaveSlaves(void) {
+    dictIterator *di = dictGetSafeIterator(server.cluster->nodes);
+    dictEntry *de;
+    int slaves = 0;
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (nodeIsSlave(node)) continue;
+        slaves += node->numslaves;
+    }
+    dictReleaseIterator(di);
+    return slaves != 0;
+}
+
+/* Set the slot bit and return the old value. */
+int clusterNodeSetSlotBit(clusterNode *n, int slot) {
+    int old = bitmapTestBit(n->slots,slot);
+    bitmapSetBit(n->slots,slot);
+    if (!old) {
+        n->numslots++;
+        /* When a master gets its first slot, even if it has no slaves,
+         * it gets flagged with MIGRATE_TO, that is, the master is a valid
+         * target for replicas migration, if and only if at least one of
+         * the other masters has slaves right now.
+         *
+         * Normally masters are valid targets of replica migration if:
+         * 1. The used to have slaves (but no longer have).
+         * 2. They are slaves failing over a master that used to have slaves.
+         *
+         * However new masters with slots assigned are considered valid
+         * migration targets if the rest of the cluster is not a slave-less.
+         *
+         * See https://github.com/redis/redis/issues/3043 for more info. */
+        if (n->numslots == 1 && clusterMastersHaveSlaves())
+            n->flags |= CLUSTER_NODE_MIGRATE_TO;
+    }
+    return old;
+}
+
+/* Clear the slot bit and return the old value. */
+int clusterNodeClearSlotBit(clusterNode *n, int slot) {
+    int old = bitmapTestBit(n->slots,slot);
+    bitmapClearBit(n->slots,slot);
+    if (old) n->numslots--;
+    return old;
+}
+
+/* Return the slot bit from the cluster node structure. */
+int clusterNodeGetSlotBit(clusterNode *n, int slot) {
+    return bitmapTestBit(n->slots,slot);
+}
+
+/* Add the specified slot to the list of slots that node 'n' will
+ * serve. Return C_OK if the operation ended with success.
+ * If the slot is already assigned to another instance this is considered
+ * an error and C_ERR is returned. */
+int clusterAddSlot(clusterNode *n, int slot) {
+    if (server.cluster->slots[slot]) return C_ERR;
+    clusterNodeSetSlotBit(n,slot);
+    server.cluster->slots[slot] = n;
+    return C_OK;
+}
+
+/* Delete the specified slot marking it as unassigned.
+ * Returns C_OK if the slot was assigned, otherwise if the slot was
+ * already unassigned C_ERR is returned. */
+int clusterDelSlot(int slot) {
+    clusterNode *n = server.cluster->slots[slot];
+
+    if (!n) return C_ERR;
+    serverAssert(clusterNodeClearSlotBit(n,slot) == 1);
+    server.cluster->slots[slot] = NULL;
+    return C_OK;
+}
+
+/* Delete all the slots associated with the specified node.
+ * The number of deleted slots is returned. */
+int clusterDelNodeSlots(clusterNode *node) {
+    int deleted = 0, j;
+
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (clusterNodeGetSlotBit(node,j)) {
+            clusterDelSlot(j);
+            deleted++;
+        }
+    }
+    return deleted;
+}
+
+/* Clear the migrating / importing state for all the slots.
+ * This is useful at initialization and when turning a master into slave. */
+void clusterCloseAllSlots(void) {
+    memset(server.cluster->migrating_slots_to,0,
+        sizeof(server.cluster->migrating_slots_to));
+    memset(server.cluster->importing_slots_from,0,
+        sizeof(server.cluster->importing_slots_from));
+}
+
+/* -----------------------------------------------------------------------------
+ * Cluster state evaluation function
+ * -------------------------------------------------------------------------- */
+
+/* The following are defines that are only used in the evaluation function
+ * and are based on heuristics. Actually the main point about the rejoin and
+ * writable delay is that they should be a few orders of magnitude larger
+ * than the network latency. */
+#define CLUSTER_MAX_REJOIN_DELAY 5000
+#define CLUSTER_MIN_REJOIN_DELAY 500
+#define CLUSTER_WRITABLE_DELAY 2000
+
+void clusterUpdateState(void) {
+    int j, new_state;
+    int reachable_masters = 0;
+    static mstime_t among_minority_time;
+    static mstime_t first_call_time = 0;
+
+    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_UPDATE_STATE;
+
+    /* If this is a master node, wait some time before turning the state
+     * into OK, since it is not a good idea to rejoin the cluster as a writable
+     * master, after a reboot, without giving the cluster a chance to
+     * reconfigure this node. Note that the delay is calculated starting from
+     * the first call to this function and not since the server start, in order
+     * to don't count the DB loading time. */
+    if (first_call_time == 0) first_call_time = mstime();
+    if (nodeIsMaster(myself) &&
+        server.cluster->state == CLUSTER_FAIL &&
+        mstime() - first_call_time < CLUSTER_WRITABLE_DELAY) return;
+
+    /* Start assuming the state is OK. We'll turn it into FAIL if there
+     * are the right conditions. */
+    new_state = CLUSTER_OK;
+
+    /* Check if all the slots are covered. */
+    if (server.cluster_require_full_coverage) {
+        for (j = 0; j < CLUSTER_SLOTS; j++) {
+            if (server.cluster->slots[j] == NULL ||
+                server.cluster->slots[j]->flags & (CLUSTER_NODE_FAIL))
+            {
+                new_state = CLUSTER_FAIL;
+                break;
+            }
+        }
+    }
+
+    /* Compute the cluster size, that is the number of master nodes
+     * serving at least a single slot.
+     *
+     * At the same time count the number of reachable masters having
+     * at least one slot. */
+    {
+        dictIterator *di;
+        dictEntry *de;
+
+        server.cluster->size = 0;
+        di = dictGetSafeIterator(server.cluster->nodes);
+        while((de = dictNext(di)) != NULL) {
+            clusterNode *node = dictGetVal(de);
+
+            if (nodeIsMaster(node) && node->numslots) {
+                server.cluster->size++;
+                if ((node->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) == 0)
+                    reachable_masters++;
+            }
+        }
+        dictReleaseIterator(di);
+    }
+
+    /* If we are in a minority partition, change the cluster state
+     * to FAIL. */
+    {
+        int needed_quorum = (server.cluster->size / 2) + 1;
+
+        if (reachable_masters < needed_quorum) {
+            new_state = CLUSTER_FAIL;
+            among_minority_time = mstime();
+        }
+    }
+
+    /* Log a state change */
+    if (new_state != server.cluster->state) {
+        mstime_t rejoin_delay = server.cluster_node_timeout;
+
+        /* If the instance is a master and was partitioned away with the
+         * minority, don't let it accept queries for some time after the
+         * partition heals, to make sure there is enough time to receive
+         * a configuration update. */
+        if (rejoin_delay > CLUSTER_MAX_REJOIN_DELAY)
+            rejoin_delay = CLUSTER_MAX_REJOIN_DELAY;
+        if (rejoin_delay < CLUSTER_MIN_REJOIN_DELAY)
+            rejoin_delay = CLUSTER_MIN_REJOIN_DELAY;
+
+        if (new_state == CLUSTER_OK &&
+            nodeIsMaster(myself) &&
+            mstime() - among_minority_time < rejoin_delay)
+        {
+            return;
+        }
+
+        /* Change the state and log the event. */
+        serverLog(LL_WARNING,"Cluster state changed: %s",
+            new_state == CLUSTER_OK ? "ok" : "fail");
+        server.cluster->state = new_state;
+    }
+}
+
+/* This function is called after the node startup in order to verify that data
+ * loaded from disk is in agreement with the cluster configuration:
+ *
+ * 1) If we find keys about hash slots we have no responsibility for, the
+ *    following happens:
+ *    A) If no other node is in charge according to the current cluster
+ *       configuration, we add these slots to our node.
+ *    B) If according to our config other nodes are already in charge for
+ *       this slots, we set the slots as IMPORTING from our point of view
+ *       in order to justify we have those slots, and in order to make
+ *       redis-trib aware of the issue, so that it can try to fix it.
+ * 2) If we find data in a DB different than DB0 we return C_ERR to
+ *    signal the caller it should quit the server with an error message
+ *    or take other actions.
+ *
+ * The function always returns C_OK even if it will try to correct
+ * the error described in "1". However if data is found in DB different
+ * from DB0, C_ERR is returned.
+ *
+ * The function also uses the logging facility in order to warn the user
+ * about desynchronizations between the data we have in memory and the
+ * cluster configuration. */
+int verifyClusterConfigWithData(void) {
+    int j;
+    int update_config = 0;
+
+    /* Return ASAP if a module disabled cluster redirections. In that case
+     * every master can store keys about every possible hash slot. */
+    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
+        return C_OK;
+
+    /* If this node is a slave, don't perform the check at all as we
+     * completely depend on the replication stream. */
+    if (nodeIsSlave(myself)) return C_OK;
+
+    /* Make sure we only have keys in DB0. */
+    for (j = 1; j < server.dbnum; j++) {
+        if (dictSize(server.db[j].dict)) return C_ERR;
+    }
+
+    /* Check that all the slots we see populated memory have a corresponding
+     * entry in the cluster table. Otherwise fix the table. */
+    for (j = 0; j < CLUSTER_SLOTS; j++) {
+        if (!countKeysInSlot(j)) continue; /* No keys in this slot. */
+        /* Check if we are assigned to this slot or if we are importing it.
+         * In both cases check the next slot as the configuration makes
+         * sense. */
+        if (server.cluster->slots[j] == myself ||
+            server.cluster->importing_slots_from[j] != NULL) continue;
+
+        /* If we are here data and cluster config don't agree, and we have
+         * slot 'j' populated even if we are not importing it, nor we are
+         * assigned to this slot. Fix this condition. */
+
+        update_config++;
+        /* Case A: slot is unassigned. Take responsibility for it. */
+        if (server.cluster->slots[j] == NULL) {
+            serverLog(LL_WARNING, "I have keys for unassigned slot %d. "
+                                    "Taking responsibility for it.",j);
+            clusterAddSlot(myself,j);
+        } else {
+            serverLog(LL_WARNING, "I have keys for slot %d, but the slot is "
+                                    "assigned to another node. "
+                                    "Setting it to importing state.",j);
+            server.cluster->importing_slots_from[j] = server.cluster->slots[j];
+        }
+    }
+    if (update_config) clusterSaveConfigOrDie(1);
+    return C_OK;
+}
+
+/* -----------------------------------------------------------------------------
+ * SLAVE nodes handling
+ * -------------------------------------------------------------------------- */
+
+/* Set the specified node 'n' as master for this node.
+ * If this node is currently a master, it is turned into a slave. */
+void clusterSetMaster(clusterNode *n) {
+    serverAssert(n != myself);
+    serverAssert(myself->numslots == 0);
+
+    if (nodeIsMaster(myself)) {
+        myself->flags &= ~(CLUSTER_NODE_MASTER|CLUSTER_NODE_MIGRATE_TO);
+        myself->flags |= CLUSTER_NODE_SLAVE;
+        clusterCloseAllSlots();
+    } else {
+        if (myself->slaveof)
+            clusterNodeRemoveSlave(myself->slaveof,myself);
+    }
+    myself->slaveof = n;
+    clusterNodeAddSlave(n,myself);
+    replicationSetMaster(n->ip, n->port);
+    resetManualFailover();
+}
+
+/* -----------------------------------------------------------------------------
+ * Nodes to string representation functions.
+ * -------------------------------------------------------------------------- */
+
+struct redisNodeFlags {
+    uint16_t flag;
+    char *name;
+};
+
+static struct redisNodeFlags redisNodeFlagsTable[] = {
+    {CLUSTER_NODE_MYSELF,       "myself,"},
+    {CLUSTER_NODE_MASTER,       "master,"},
+    {CLUSTER_NODE_SLAVE,        "slave,"},
+    {CLUSTER_NODE_PFAIL,        "fail?,"},
+    {CLUSTER_NODE_FAIL,         "fail,"},
+    {CLUSTER_NODE_HANDSHAKE,    "handshake,"},
+    {CLUSTER_NODE_NOADDR,       "noaddr,"},
+    {CLUSTER_NODE_NOFAILOVER,   "nofailover,"}
+};
+
+/* Concatenate the comma separated list of node flags to the given SDS
+ * string 'ci'. */
+sds representClusterNodeFlags(sds ci, uint16_t flags) {
+    size_t orig_len = sdslen(ci);
+    int i, size = sizeof(redisNodeFlagsTable)/sizeof(struct redisNodeFlags);
+    for (i = 0; i < size; i++) {
+        struct redisNodeFlags *nodeflag = redisNodeFlagsTable + i;
+        if (flags & nodeflag->flag) ci = sdscat(ci, nodeflag->name);
+    }
+    /* If no flag was added, add the "noflags" special flag. */
+    if (sdslen(ci) == orig_len) ci = sdscat(ci,"noflags,");
+    sdsIncrLen(ci,-1); /* Remove trailing comma. */
+    return ci;
+}
+
+/* Generate a csv-alike representation of the specified cluster node.
+ * See clusterGenNodesDescription() top comment for more information.
+ *
+ * The function returns the string representation as an SDS string. */
+sds clusterGenNodeDescription(clusterNode *node, int use_pport) {
+    int j, start;
+    sds ci;
+    int port = use_pport && node->pport ? node->pport : node->port;
+
+    /* Node coordinates */
+    ci = sdscatlen(sdsempty(),node->name,CLUSTER_NAMELEN);
+    ci = sdscatfmt(ci," %s:%i@%i ",
+        node->ip,
+        port,
+        node->cport);
+
+    /* Flags */
+    ci = representClusterNodeFlags(ci, node->flags);
+
+    /* Slave of... or just "-" */
+    ci = sdscatlen(ci," ",1);
+    if (node->slaveof)
+        ci = sdscatlen(ci,node->slaveof->name,CLUSTER_NAMELEN);
+    else
+        ci = sdscatlen(ci,"-",1);
+
+    unsigned long long nodeEpoch = node->configEpoch;
+    if (nodeIsSlave(node) && node->slaveof) {
+        nodeEpoch = node->slaveof->configEpoch;
+    }
+    /* Latency from the POV of this node, config epoch, link status */
+    ci = sdscatfmt(ci," %I %I %U %s",
+        (long long) node->ping_sent,
+        (long long) node->pong_received,
+        nodeEpoch,
+        (node->link || node->flags & CLUSTER_NODE_MYSELF) ?
+                    "connected" : "disconnected");
+
+    /* Slots served by this instance. If we already have slots info,
+     * append it diretly, otherwise, generate slots only if it has. */
+    if (node->slots_info) {
+        ci = sdscatsds(ci, node->slots_info);
+    } else if (node->numslots > 0) {
+        start = -1;
+        for (j = 0; j < CLUSTER_SLOTS; j++) {
+            int bit;
+
+            if ((bit = clusterNodeGetSlotBit(node,j)) != 0) {
+                if (start == -1) start = j;
+            }
+            if (start != -1 && (!bit || j == CLUSTER_SLOTS-1)) {
+                if (bit && j == CLUSTER_SLOTS-1) j++;
+
+                if (start == j-1) {
+                    ci = sdscatfmt(ci," %i",start);
+                } else {
+                    ci = sdscatfmt(ci," %i-%i",start,j-1);
+                }
+                start = -1;
+            }
+        }
+    }
+
+    /* Just for MYSELF node we also dump info about slots that
+     * we are migrating to other instances or importing from other
+     * instances. */
+    if (node->flags & CLUSTER_NODE_MYSELF) {
+        for (j = 0; j < CLUSTER_SLOTS; j++) {
+            if (server.cluster->migrating_slots_to[j]) {
+                ci = sdscatprintf(ci," [%d->-%.40s]",j,
+                    server.cluster->migrating_slots_to[j]->name);
+            } else if (server.cluster->importing_slots_from[j]) {
+                ci = sdscatprintf(ci," [%d-<-%.40s]",j,
+                    server.cluster->importing_slots_from[j]->name);
+            }
+        }
+    }
+    return ci;
+}
+
+/* Generate the slot topology for all nodes and store the string representation
+ * in the slots_info struct on the node. This is used to improve the efficiency
+ * of clusterGenNodesDescription() because it removes looping of the slot space
+ * for generating the slot info for each node individually. */
+void clusterGenNodesSlotsInfo(int filter) {
+    clusterNode *n = NULL;
+    int start = -1;
+
+    for (int i = 0; i <= CLUSTER_SLOTS; i++) {
+        /* Find start node and slot id. */
+        if (n == NULL) {
+            if (i == CLUSTER_SLOTS) break;
+            n = server.cluster->slots[i];
+            start = i;
+            continue;
+        }
+
+        /* Generate slots info when occur different node with start
+         * or end of slot. */
+        if (i == CLUSTER_SLOTS || n != server.cluster->slots[i]) {
+            if (!(n->flags & filter)) {
+                if (n->slots_info == NULL) n->slots_info = sdsempty();
+                if (start == i-1) {
+                    n->slots_info = sdscatfmt(n->slots_info," %i",start);
+                } else {
+                    n->slots_info = sdscatfmt(n->slots_info," %i-%i",start,i-1);
+                }
+            }
+            if (i == CLUSTER_SLOTS) break;
+            n = server.cluster->slots[i];
+            start = i;
+        }
+    }
+}
+
+/* Generate a csv-alike representation of the nodes we are aware of,
+ * including the "myself" node, and return an SDS string containing the
+ * representation (it is up to the caller to free it).
+ *
+ * All the nodes matching at least one of the node flags specified in
+ * "filter" are excluded from the output, so using zero as a filter will
+ * include all the known nodes in the representation, including nodes in
+ * the HANDSHAKE state.
+ *
+ * Setting use_pport to 1 in a TLS cluster makes the result contain the
+ * plaintext client port rather then the TLS client port of each node.
+ *
+ * The representation obtained using this function is used for the output
+ * of the CLUSTER NODES function, and as format for the cluster
+ * configuration file (nodes.conf) for a given node. */
+sds clusterGenNodesDescription(int filter, int use_pport) {
+    sds ci = sdsempty(), ni;
+    dictIterator *di;
+    dictEntry *de;
+
+    /* Generate all nodes slots info firstly. */
+    clusterGenNodesSlotsInfo(filter);
+
+    di = dictGetSafeIterator(server.cluster->nodes);
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+
+        if (node->flags & filter) continue;
+        ni = clusterGenNodeDescription(node, use_pport);
+        ci = sdscatsds(ci,ni);
+        sdsfree(ni);
+        ci = sdscatlen(ci,"\n",1);
+
+        /* Release slots info. */
+        if (node->slots_info) {
+            sdsfree(node->slots_info);
+            node->slots_info = NULL;
+        }
+    }
+    dictReleaseIterator(di);
+    return ci;
+}
+
+/* -----------------------------------------------------------------------------
+ * CLUSTER command
+ * -------------------------------------------------------------------------- */
+
+const char *clusterGetMessageTypeString(int type) {
+    switch(type) {
+    case CLUSTERMSG_TYPE_PING: return "ping";
+    case CLUSTERMSG_TYPE_PONG: return "pong";
+    case CLUSTERMSG_TYPE_MEET: return "meet";
+    case CLUSTERMSG_TYPE_FAIL: return "fail";
+    case CLUSTERMSG_TYPE_PUBLISH: return "publish";
+    case CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST: return "auth-req";
+    case CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK: return "auth-ack";
+    case CLUSTERMSG_TYPE_UPDATE: return "update";
+    case CLUSTERMSG_TYPE_MFSTART: return "mfstart";
+    case CLUSTERMSG_TYPE_MODULE: return "module";
+    }
+    return "unknown";
+}
+
+int getSlotOrReply(client *c, robj *o) {
+    long long slot;
+
+    if (getLongLongFromObject(o,&slot) != C_OK ||
+        slot < 0 || slot >= CLUSTER_SLOTS)
+    {
+        addReplyError(c,"Invalid or out of range slot");
+        return -1;
+    }
+    return (int) slot;
+}
+
+void addNodeReplyForClusterSlot(client *c, clusterNode *node, int start_slot, int end_slot) {
+    int i, nested_elements = 3; /* slots (2) + master addr (1) */
+    void *nested_replylen = addReplyDeferredLen(c);
+    addReplyLongLong(c, start_slot);
+    addReplyLongLong(c, end_slot);
+    addReplyArrayLen(c, 3);
+    addReplyBulkCString(c, node->ip);
+    /* Report non-TLS ports to non-TLS client in TLS cluster if available. */
+    int use_pport = (server.tls_cluster &&
+                     c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
+    addReplyLongLong(c, use_pport && node->pport ? node->pport : node->port);
+    addReplyBulkCBuffer(c, node->name, CLUSTER_NAMELEN);
+
+    /* Remaining nodes in reply are replicas for slot range */
+    for (i = 0; i < node->numslaves; i++) {
+        /* This loop is copy/pasted from clusterGenNodeDescription()
+         * with modifications for per-slot node aggregation. */
+        if (nodeFailed(node->slaves[i])) continue;
+        addReplyArrayLen(c, 3);
+        addReplyBulkCString(c, node->slaves[i]->ip);
+        /* Report slave's non-TLS port to non-TLS client in TLS cluster */
+        addReplyLongLong(c, (use_pport && node->slaves[i]->pport ?
+                             node->slaves[i]->pport :
+                             node->slaves[i]->port));
+        addReplyBulkCBuffer(c, node->slaves[i]->name, CLUSTER_NAMELEN);
+        nested_elements++;
+    }
+    setDeferredArrayLen(c, nested_replylen, nested_elements);
+}
+
+void clusterReplyMultiBulkSlots(client * c) {
+    /* Format: 1) 1) start slot
+     *            2) end slot
+     *            3) 1) master IP
+     *               2) master port
+     *               3) node ID
+     *            4) 1) replica IP
+     *               2) replica port
+     *               3) node ID
+     *           ... continued until done
+     */
+    clusterNode *n = NULL;
+    int num_masters = 0, start = -1;
+    void *slot_replylen = addReplyDeferredLen(c);
+
+    for (int i = 0; i <= CLUSTER_SLOTS; i++) {
+        /* Find start node and slot id. */
+        if (n == NULL) {
+            if (i == CLUSTER_SLOTS) break;
+            n = server.cluster->slots[i];
+            start = i;
+            continue;
+        }
+
+        /* Add cluster slots info when occur different node with start
+         * or end of slot. */
+        if (i == CLUSTER_SLOTS || n != server.cluster->slots[i]) {
+            addNodeReplyForClusterSlot(c, n, start, i-1);
+            num_masters++;
+            if (i == CLUSTER_SLOTS) break;
+            n = server.cluster->slots[i];
+            start = i;
+        }
+    }
+    setDeferredArrayLen(c, slot_replylen, num_masters);
+}
+
+void clusterCommand(client *c) {
+    if (server.cluster_enabled == 0) {
+        addReplyError(c,"This instance has cluster support disabled");
+        return;
+    }
+
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"ADDSLOTS <slot> [<slot> ...]",
+"    Assign slots to current node.",
+"BUMPEPOCH",
+"    Advance the cluster config epoch.",
+"COUNT-FAILURE-REPORTS <node-id>",
+"    Return number of failure reports for <node-id>.",
+"COUNTKEYSINSLOT <slot>",
+"    Return the number of keys in <slot>.",
+"DELSLOTS <slot> [<slot> ...]",
+"    Delete slots information from current node.",
+"FAILOVER [FORCE|TAKEOVER]",
+"    Promote current replica node to being a master.",
+"FORGET <node-id>",
+"    Remove a node from the cluster.",
+"GETKEYSINSLOT <slot> <count>",
+"    Return key names stored by current node in a slot.",
+"FLUSHSLOTS",
+"    Delete current node own slots information.",
+"INFO",
+"    Return information about the cluster.",
+"KEYSLOT <key>",
+"    Return the hash slot for <key>.",
+"MEET <ip> <port> [<bus-port>]",
+"    Connect nodes into a working cluster.",
+"MYID",
+"    Return the node id.",
+"NODES",
+"    Return cluster configuration seen by node. Output format:",
+"    <id> <ip:port> <flags> <master> <pings> <pongs> <epoch> <link> <slot> ...",
+"REPLICATE <node-id>",
+"    Configure current node as replica to <node-id>.",
+"RESET [HARD|SOFT]",
+"    Reset current node (default: soft).",
+"SET-CONFIG-EPOCH <epoch>",
+"    Set config epoch of current node.",
+"SETSLOT <slot> (IMPORTING|MIGRATING|STABLE|NODE <node-id>)",
+"    Set slot state.",
+"REPLICAS <node-id>",
+"    Return <node-id> replicas.",
+"SAVECONFIG",
+"    Force saving cluster configuration on disk.",
+"SLOTS",
+"    Return information about slots range mappings. Each range is made of:",
+"    start, end, master and replicas IP addresses, ports and ids",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"meet") && (c->argc == 4 || c->argc == 5)) {
+        /* CLUSTER MEET <ip> <port> [cport] */
+        long long port, cport;
+
+        if (getLongLongFromObject(c->argv[3], &port) != C_OK) {
+            addReplyErrorFormat(c,"Invalid TCP base port specified: %s",
+                                (char*)c->argv[3]->ptr);
+            return;
+        }
+
+        if (c->argc == 5) {
+            if (getLongLongFromObject(c->argv[4], &cport) != C_OK) {
+                addReplyErrorFormat(c,"Invalid TCP bus port specified: %s",
+                                    (char*)c->argv[4]->ptr);
+                return;
+            }
+        } else {
+            cport = port + CLUSTER_PORT_INCR;
+        }
+
+        if (clusterStartHandshake(c->argv[2]->ptr,port,cport) == 0 &&
+            errno == EINVAL)
+        {
+            addReplyErrorFormat(c,"Invalid node address specified: %s:%s",
+                            (char*)c->argv[2]->ptr, (char*)c->argv[3]->ptr);
+        } else {
+            addReply(c,shared.ok);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"nodes") && c->argc == 2) {
+        /* CLUSTER NODES */
+        /* Report plaintext ports, only if cluster is TLS but client is known to
+         * be non-TLS). */
+        int use_pport = (server.tls_cluster &&
+                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
+        sds nodes = clusterGenNodesDescription(0, use_pport);
+        addReplyVerbatim(c,nodes,sdslen(nodes),"txt");
+        sdsfree(nodes);
+    } else if (!strcasecmp(c->argv[1]->ptr,"myid") && c->argc == 2) {
+        /* CLUSTER MYID */
+        addReplyBulkCBuffer(c,myself->name, CLUSTER_NAMELEN);
+    } else if (!strcasecmp(c->argv[1]->ptr,"slots") && c->argc == 2) {
+        /* CLUSTER SLOTS */
+        clusterReplyMultiBulkSlots(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"flushslots") && c->argc == 2) {
+        /* CLUSTER FLUSHSLOTS */
+        if (dictSize(server.db[0].dict) != 0) {
+            addReplyError(c,"DB must be empty to perform CLUSTER FLUSHSLOTS.");
+            return;
+        }
+        clusterDelNodeSlots(myself);
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+        addReply(c,shared.ok);
+    } else if ((!strcasecmp(c->argv[1]->ptr,"addslots") ||
+               !strcasecmp(c->argv[1]->ptr,"delslots")) && c->argc >= 3)
+    {
+        /* CLUSTER ADDSLOTS <slot> [slot] ... */
+        /* CLUSTER DELSLOTS <slot> [slot] ... */
+        int j, slot;
+        unsigned char *slots = zmalloc(CLUSTER_SLOTS);
+        int del = !strcasecmp(c->argv[1]->ptr,"delslots");
+
+        memset(slots,0,CLUSTER_SLOTS);
+        /* Check that all the arguments are parseable and that all the
+         * slots are not already busy. */
+        for (j = 2; j < c->argc; j++) {
+            if ((slot = getSlotOrReply(c,c->argv[j])) == -1) {
+                zfree(slots);
+                return;
+            }
+            if (del && server.cluster->slots[slot] == NULL) {
+                addReplyErrorFormat(c,"Slot %d is already unassigned", slot);
+                zfree(slots);
+                return;
+            } else if (!del && server.cluster->slots[slot]) {
+                addReplyErrorFormat(c,"Slot %d is already busy", slot);
+                zfree(slots);
+                return;
+            }
+            if (slots[slot]++ == 1) {
+                addReplyErrorFormat(c,"Slot %d specified multiple times",
+                    (int)slot);
+                zfree(slots);
+                return;
+            }
+        }
+        for (j = 0; j < CLUSTER_SLOTS; j++) {
+            if (slots[j]) {
+                int retval;
+
+                /* If this slot was set as importing we can clear this
+                 * state as now we are the real owner of the slot. */
+                if (server.cluster->importing_slots_from[j])
+                    server.cluster->importing_slots_from[j] = NULL;
+
+                retval = del ? clusterDelSlot(j) :
+                               clusterAddSlot(myself,j);
+                serverAssertWithInfo(c,NULL,retval == C_OK);
+            }
+        }
+        zfree(slots);
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"setslot") && c->argc >= 4) {
+        /* SETSLOT 10 MIGRATING <node ID> */
+        /* SETSLOT 10 IMPORTING <node ID> */
+        /* SETSLOT 10 STABLE */
+        /* SETSLOT 10 NODE <node ID> */
+        int slot;
+        clusterNode *n;
+
+        if (nodeIsSlave(myself)) {
+            addReplyError(c,"Please use SETSLOT only with masters.");
+            return;
+        }
+
+        if ((slot = getSlotOrReply(c,c->argv[2])) == -1) return;
+
+        if (!strcasecmp(c->argv[3]->ptr,"migrating") && c->argc == 5) {
+            if (server.cluster->slots[slot] != myself) {
+                addReplyErrorFormat(c,"I'm not the owner of hash slot %u",slot);
+                return;
+            }
+            if ((n = clusterLookupNode(c->argv[4]->ptr)) == NULL) {
+                addReplyErrorFormat(c,"I don't know about node %s",
+                    (char*)c->argv[4]->ptr);
+                return;
+            }
+            server.cluster->migrating_slots_to[slot] = n;
+        } else if (!strcasecmp(c->argv[3]->ptr,"importing") && c->argc == 5) {
+            if (server.cluster->slots[slot] == myself) {
+                addReplyErrorFormat(c,
+                    "I'm already the owner of hash slot %u",slot);
+                return;
+            }
+            if ((n = clusterLookupNode(c->argv[4]->ptr)) == NULL) {
+                addReplyErrorFormat(c,"I don't know about node %s",
+                    (char*)c->argv[4]->ptr);
+                return;
+            }
+            server.cluster->importing_slots_from[slot] = n;
+        } else if (!strcasecmp(c->argv[3]->ptr,"stable") && c->argc == 4) {
+            /* CLUSTER SETSLOT <SLOT> STABLE */
+            server.cluster->importing_slots_from[slot] = NULL;
+            server.cluster->migrating_slots_to[slot] = NULL;
+        } else if (!strcasecmp(c->argv[3]->ptr,"node") && c->argc == 5) {
+            /* CLUSTER SETSLOT <SLOT> NODE <NODE ID> */
+            clusterNode *n = clusterLookupNode(c->argv[4]->ptr);
+
+            if (!n) {
+                addReplyErrorFormat(c,"Unknown node %s",
+                    (char*)c->argv[4]->ptr);
+                return;
+            }
+            /* If this hash slot was served by 'myself' before to switch
+             * make sure there are no longer local keys for this hash slot. */
+            if (server.cluster->slots[slot] == myself && n != myself) {
+                if (countKeysInSlot(slot) != 0) {
+                    addReplyErrorFormat(c,
+                        "Can't assign hashslot %d to a different node "
+                        "while I still hold keys for this hash slot.", slot);
+                    return;
+                }
+            }
+            /* If this slot is in migrating status but we have no keys
+             * for it assigning the slot to another node will clear
+             * the migrating status. */
+            if (countKeysInSlot(slot) == 0 &&
+                server.cluster->migrating_slots_to[slot])
+                server.cluster->migrating_slots_to[slot] = NULL;
+
+            clusterDelSlot(slot);
+            clusterAddSlot(n,slot);
+
+            /* If this node was importing this slot, assigning the slot to
+             * itself also clears the importing status. */
+            if (n == myself &&
+                server.cluster->importing_slots_from[slot])
+            {
+                /* This slot was manually migrated, set this node configEpoch
+                 * to a new epoch so that the new version can be propagated
+                 * by the cluster.
+                 *
+                 * Note that if this ever results in a collision with another
+                 * node getting the same configEpoch, for example because a
+                 * failover happens at the same time we close the slot, the
+                 * configEpoch collision resolution will fix it assigning
+                 * a different epoch to each node. */
+                if (clusterBumpConfigEpochWithoutConsensus() == C_OK) {
+                    serverLog(LL_WARNING,
+                        "configEpoch updated after importing slot %d", slot);
+                }
+                server.cluster->importing_slots_from[slot] = NULL;
+                /* After importing this slot, let the other nodes know as
+                 * soon as possible. */
+                clusterBroadcastPong(CLUSTER_BROADCAST_ALL);
+            }
+        } else {
+            addReplyError(c,
+                "Invalid CLUSTER SETSLOT action or number of arguments. Try CLUSTER HELP");
+            return;
+        }
+        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|CLUSTER_TODO_UPDATE_STATE);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"bumpepoch") && c->argc == 2) {
+        /* CLUSTER BUMPEPOCH */
+        int retval = clusterBumpConfigEpochWithoutConsensus();
+        sds reply = sdscatprintf(sdsempty(),"+%s %llu\r\n",
+                (retval == C_OK) ? "BUMPED" : "STILL",
+                (unsigned long long) myself->configEpoch);
+        addReplySds(c,reply);
+    } else if (!strcasecmp(c->argv[1]->ptr,"info") && c->argc == 2) {
+        /* CLUSTER INFO */
+        char *statestr[] = {"ok","fail","needhelp"};
+        int slots_assigned = 0, slots_ok = 0, slots_pfail = 0, slots_fail = 0;
+        uint64_t myepoch;
+        int j;
+
+        for (j = 0; j < CLUSTER_SLOTS; j++) {
+            clusterNode *n = server.cluster->slots[j];
+
+            if (n == NULL) continue;
+            slots_assigned++;
+            if (nodeFailed(n)) {
+                slots_fail++;
+            } else if (nodeTimedOut(n)) {
+                slots_pfail++;
+            } else {
+                slots_ok++;
+            }
+        }
+
+        myepoch = (nodeIsSlave(myself) && myself->slaveof) ?
+                  myself->slaveof->configEpoch : myself->configEpoch;
+
+        sds info = sdscatprintf(sdsempty(),
+            "cluster_state:%s\r\n"
+            "cluster_slots_assigned:%d\r\n"
+            "cluster_slots_ok:%d\r\n"
+            "cluster_slots_pfail:%d\r\n"
+            "cluster_slots_fail:%d\r\n"
+            "cluster_known_nodes:%lu\r\n"
+            "cluster_size:%d\r\n"
+            "cluster_current_epoch:%llu\r\n"
+            "cluster_my_epoch:%llu\r\n"
+            , statestr[server.cluster->state],
+            slots_assigned,
+            slots_ok,
+            slots_pfail,
+            slots_fail,
+            dictSize(server.cluster->nodes),
+            server.cluster->size,
+            (unsigned long long) server.cluster->currentEpoch,
+            (unsigned long long) myepoch
+        );
+
+        /* Show stats about messages sent and received. */
+        long long tot_msg_sent = 0;
+        long long tot_msg_received = 0;
+
+        for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
+            if (server.cluster->stats_bus_messages_sent[i] == 0) continue;
+            tot_msg_sent += server.cluster->stats_bus_messages_sent[i];
+            info = sdscatprintf(info,
+                "cluster_stats_messages_%s_sent:%lld\r\n",
+                clusterGetMessageTypeString(i),
+                server.cluster->stats_bus_messages_sent[i]);
+        }
+        info = sdscatprintf(info,
+            "cluster_stats_messages_sent:%lld\r\n", tot_msg_sent);
+
+        for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
+            if (server.cluster->stats_bus_messages_received[i] == 0) continue;
+            tot_msg_received += server.cluster->stats_bus_messages_received[i];
+            info = sdscatprintf(info,
+                "cluster_stats_messages_%s_received:%lld\r\n",
+                clusterGetMessageTypeString(i),
+                server.cluster->stats_bus_messages_received[i]);
+        }
+        info = sdscatprintf(info,
+            "cluster_stats_messages_received:%lld\r\n", tot_msg_received);
+
+        /* Produce the reply protocol. */
+        addReplyVerbatim(c,info,sdslen(info),"txt");
+        sdsfree(info);
+    } else if (!strcasecmp(c->argv[1]->ptr,"saveconfig") && c->argc == 2) {
+        int retval = clusterSaveConfig(1);
+
+        if (retval == 0)
+            addReply(c,shared.ok);
+        else
+            addReplyErrorFormat(c,"error saving the cluster node config: %s",
+                strerror(errno));
+    } else if (!strcasecmp(c->argv[1]->ptr,"keyslot") && c->argc == 3) {
+        /* CLUSTER KEYSLOT <key> */
+        sds key = c->argv[2]->ptr;
+
+        addReplyLongLong(c,keyHashSlot(key,sdslen(key)));
+    } else if (!strcasecmp(c->argv[1]->ptr,"countkeysinslot") && c->argc == 3) {
+        /* CLUSTER COUNTKEYSINSLOT <slot> */
+        long long slot;
+
+        if (getLongLongFromObjectOrReply(c,c->argv[2],&slot,NULL) != C_OK)
+            return;
+        if (slot < 0 || slot >= CLUSTER_SLOTS) {
+            addReplyError(c,"Invalid slot");
+            return;
+        }
+        addReplyLongLong(c,countKeysInSlot(slot));
+    } else if (!strcasecmp(c->argv[1]->ptr,"getkeysinslot") && c->argc == 4) {
+        /* CLUSTER GETKEYSINSLOT <slot> <count> */
+        long long maxkeys, slot;
+        unsigned int numkeys, j;
+        robj **keys;
+
+        if (getLongLongFromObjectOrReply(c,c->argv[2],&slot,NULL) != C_OK)
+            return;
+        if (getLongLongFromObjectOrReply(c,c->argv[3],&maxkeys,NULL)
+            != C_OK)
+            return;
+        if (slot < 0 || slot >= CLUSTER_SLOTS || maxkeys < 0) {
+            addReplyError(c,"Invalid slot or number of keys");
+            return;
+        }
+
+        /* Avoid allocating more than needed in case of large COUNT argument
+         * and smaller actual number of keys. */
+        unsigned int keys_in_slot = countKeysInSlot(slot);
+        if (maxkeys > keys_in_slot) maxkeys = keys_in_slot;
+
+        keys = zmalloc(sizeof(robj*)*maxkeys);
+        numkeys = getKeysInSlot(slot, keys, maxkeys);
+        addReplyArrayLen(c,numkeys);
+        for (j = 0; j < numkeys; j++) {
+            addReplyBulk(c,keys[j]);
+            decrRefCount(keys[j]);
+        }
+        zfree(keys);
+    } else if (!strcasecmp(c->argv[1]->ptr,"forget") && c->argc == 3) {
+        /* CLUSTER FORGET <NODE ID> */
+        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
+
+        if (!n) {
+            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
+            return;
+        } else if (n == myself) {
+            addReplyError(c,"I tried hard but I can't forget myself...");
+            return;
+        } else if (nodeIsSlave(myself) && myself->slaveof == n) {
+            addReplyError(c,"Can't forget my master!");
+            return;
+        }
+        clusterBlacklistAddNode(n);
+        clusterDelNode(n);
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|
+                             CLUSTER_TODO_SAVE_CONFIG);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"replicate") && c->argc == 3) {
+        /* CLUSTER REPLICATE <NODE ID> */
+        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
+
+        /* Lookup the specified node in our table. */
+        if (!n) {
+            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
+            return;
+        }
+
+        /* I can't replicate myself. */
+        if (n == myself) {
+            addReplyError(c,"Can't replicate myself");
+            return;
+        }
+
+        /* Can't replicate a slave. */
+        if (nodeIsSlave(n)) {
+            addReplyError(c,"I can only replicate a master, not a replica.");
+            return;
+        }
+
+        /* If the instance is currently a master, it should have no assigned
+         * slots nor keys to accept to replicate some other node.
+         * Slaves can switch to another master without issues. */
+        if (nodeIsMaster(myself) &&
+            (myself->numslots != 0 || dictSize(server.db[0].dict) != 0)) {
+            addReplyError(c,
+                "To set a master the node must be empty and "
+                "without assigned slots.");
+            return;
+        }
+
+        /* Set the master. */
+        clusterSetMaster(n);
+        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
+        addReply(c,shared.ok);
+    } else if ((!strcasecmp(c->argv[1]->ptr,"slaves") ||
+                !strcasecmp(c->argv[1]->ptr,"replicas")) && c->argc == 3) {
+        /* CLUSTER SLAVES <NODE ID> */
+        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
+        int j;
+
+        /* Lookup the specified node in our table. */
+        if (!n) {
+            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
+            return;
+        }
+
+        if (nodeIsSlave(n)) {
+            addReplyError(c,"The specified node is not a master");
+            return;
+        }
+
+        /* Use plaintext port if cluster is TLS but client is non-TLS. */
+        int use_pport = (server.tls_cluster &&
+                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
+        addReplyArrayLen(c,n->numslaves);
+        for (j = 0; j < n->numslaves; j++) {
+            sds ni = clusterGenNodeDescription(n->slaves[j], use_pport);
+            addReplyBulkCString(c,ni);
+            sdsfree(ni);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"count-failure-reports") &&
+               c->argc == 3)
+    {
+        /* CLUSTER COUNT-FAILURE-REPORTS <NODE ID> */
+        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
+
+        if (!n) {
+            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
+            return;
+        } else {
+            addReplyLongLong(c,clusterNodeFailureReportsCount(n));
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"failover") &&
+               (c->argc == 2 || c->argc == 3))
+    {
+        /* CLUSTER FAILOVER [FORCE|TAKEOVER] */
+        int force = 0, takeover = 0;
+
+        if (c->argc == 3) {
+            if (!strcasecmp(c->argv[2]->ptr,"force")) {
+                force = 1;
+            } else if (!strcasecmp(c->argv[2]->ptr,"takeover")) {
+                takeover = 1;
+                force = 1; /* Takeover also implies force. */
+            } else {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+
+        /* Check preconditions. */
+        if (nodeIsMaster(myself)) {
+            addReplyError(c,"You should send CLUSTER FAILOVER to a replica");
+            return;
+        } else if (myself->slaveof == NULL) {
+            addReplyError(c,"I'm a replica but my master is unknown to me");
+            return;
+        } else if (!force &&
+                   (nodeFailed(myself->slaveof) ||
+                    myself->slaveof->link == NULL))
+        {
+            addReplyError(c,"Master is down or failed, "
+                            "please use CLUSTER FAILOVER FORCE");
+            return;
+        }
+        resetManualFailover();
+        server.cluster->mf_end = mstime() + CLUSTER_MF_TIMEOUT;
+
+        if (takeover) {
+            /* A takeover does not perform any initial check. It just
+             * generates a new configuration epoch for this node without
+             * consensus, claims the master's slots, and broadcast the new
+             * configuration. */
+            serverLog(LL_WARNING,"Taking over the master (user request).");
+            clusterBumpConfigEpochWithoutConsensus();
+            clusterFailoverReplaceYourMaster();
+        } else if (force) {
+            /* If this is a forced failover, we don't need to talk with our
+             * master to agree about the offset. We just failover taking over
+             * it without coordination. */
+            serverLog(LL_WARNING,"Forced failover user request accepted.");
+            server.cluster->mf_can_start = 1;
+        } else {
+            serverLog(LL_WARNING,"Manual failover user request accepted.");
+            clusterSendMFStart(myself->slaveof);
+        }
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"set-config-epoch") && c->argc == 3)
+    {
+        /* CLUSTER SET-CONFIG-EPOCH <epoch>
+         *
+         * The user is allowed to set the config epoch only when a node is
+         * totally fresh: no config epoch, no other known node, and so forth.
+         * This happens at cluster creation time to start with a cluster where
+         * every node has a different node ID, without to rely on the conflicts
+         * resolution system which is too slow when a big cluster is created. */
+        long long epoch;
+
+        if (getLongLongFromObjectOrReply(c,c->argv[2],&epoch,NULL) != C_OK)
+            return;
+
+        if (epoch < 0) {
+            addReplyErrorFormat(c,"Invalid config epoch specified: %lld",epoch);
+        } else if (dictSize(server.cluster->nodes) > 1) {
+            addReplyError(c,"The user can assign a config epoch only when the "
+                            "node does not know any other node.");
+        } else if (myself->configEpoch != 0) {
+            addReplyError(c,"Node config epoch is already non-zero");
+        } else {
+            myself->configEpoch = epoch;
+            serverLog(LL_WARNING,
+                "configEpoch set to %llu via CLUSTER SET-CONFIG-EPOCH",
+                (unsigned long long) myself->configEpoch);
+
+            if (server.cluster->currentEpoch < (uint64_t)epoch)
+                server.cluster->currentEpoch = epoch;
+            /* No need to fsync the config here since in the unlucky event
+             * of a failure to persist the config, the conflict resolution code
+             * will assign a unique config to this node. */
+            clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|
+                                 CLUSTER_TODO_SAVE_CONFIG);
+            addReply(c,shared.ok);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"reset") &&
+               (c->argc == 2 || c->argc == 3))
+    {
+        /* CLUSTER RESET [SOFT|HARD] */
+        int hard = 0;
+
+        /* Parse soft/hard argument. Default is soft. */
+        if (c->argc == 3) {
+            if (!strcasecmp(c->argv[2]->ptr,"hard")) {
+                hard = 1;
+            } else if (!strcasecmp(c->argv[2]->ptr,"soft")) {
+                hard = 0;
+            } else {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+
+        /* Slaves can be reset while containing data, but not master nodes
+         * that must be empty. */
+        if (nodeIsMaster(myself) && dictSize(c->db->dict) != 0) {
+            addReplyError(c,"CLUSTER RESET can't be called with "
+                            "master nodes containing keys");
+            return;
+        }
+        clusterReset(hard);
+        addReply(c,shared.ok);
+    } else {
+        addReplySubcommandSyntaxError(c);
+        return;
+    }
+}
+
+/* -----------------------------------------------------------------------------
+ * DUMP, RESTORE and MIGRATE commands
+ * -------------------------------------------------------------------------- */
+
+/* Generates a DUMP-format representation of the object 'o', adding it to the
+ * io stream pointed by 'rio'. This function can't fail. */
+void createDumpPayload(rio *payload, robj *o, robj *key) {
+    unsigned char buf[2];
+    uint64_t crc;
+
+    /* Serialize the object in an RDB-like format. It consist of an object type
+     * byte followed by the serialized object. This is understood by RESTORE. */
+    rioInitWithBuffer(payload,sdsempty());
+    serverAssert(rdbSaveObjectType(payload,o));
+    serverAssert(rdbSaveObject(payload,o,key));
+
+    /* Write the footer, this is how it looks like:
+     * ----------------+---------------------+---------------+
+     * ... RDB payload | 2 bytes RDB version | 8 bytes CRC64 |
+     * ----------------+---------------------+---------------+
+     * RDB version and CRC are both in little endian.
+     */
+
+    /* RDB version */
+    buf[0] = RDB_VERSION & 0xff;
+    buf[1] = (RDB_VERSION >> 8) & 0xff;
+    payload->io.buffer.ptr = sdscatlen(payload->io.buffer.ptr,buf,2);
+
+    /* CRC64 */
+    crc = crc64(0,(unsigned char*)payload->io.buffer.ptr,
+                sdslen(payload->io.buffer.ptr));
+    memrev64ifbe(&crc);
+    payload->io.buffer.ptr = sdscatlen(payload->io.buffer.ptr,&crc,8);
+}
+
+/* Verify that the RDB version of the dump payload matches the one of this Redis
+ * instance and that the checksum is ok.
+ * If the DUMP payload looks valid C_OK is returned, otherwise C_ERR
+ * is returned. */
+int verifyDumpPayload(unsigned char *p, size_t len) {
+    unsigned char *footer;
+    uint16_t rdbver;
+    uint64_t crc;
+
+    /* At least 2 bytes of RDB version and 8 of CRC64 should be present. */
+    if (len < 10) return C_ERR;
+    footer = p+(len-10);
+
+    /* Verify RDB version */
+    rdbver = (footer[1] << 8) | footer[0];
+    if (rdbver > RDB_VERSION) return C_ERR;
+
+    if (server.skip_checksum_validation)
+        return C_OK;
+
+    /* Verify CRC64 */
+    crc = crc64(0,p,len-8);
+    memrev64ifbe(&crc);
+    return (memcmp(&crc,footer+2,8) == 0) ? C_OK : C_ERR;
+}
+
+/* DUMP keyname
+ * DUMP is actually not used by Redis Cluster but it is the obvious
+ * complement of RESTORE and can be useful for different applications. */
+void dumpCommand(client *c) {
+    robj *o;
+    rio payload;
+
+    /* Check if the key is here. */
+    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
+        addReplyNull(c);
+        return;
+    }
+
+    /* Create the DUMP encoded representation. */
+    createDumpPayload(&payload,o,c->argv[1]);
+
+    /* Transfer to the client */
+    addReplyBulkSds(c,payload.io.buffer.ptr);
+    return;
+}
+
+/* RESTORE key ttl serialized-value [REPLACE] */
+void restoreCommand(client *c) {
+    long long ttl, lfu_freq = -1, lru_idle = -1, lru_clock = -1;
+    rio payload;
+    int j, type, replace = 0, absttl = 0;
+    robj *obj;
+
+    /* Parse additional options */
+    for (j = 4; j < c->argc; j++) {
+        int additional = c->argc-j-1;
+        if (!strcasecmp(c->argv[j]->ptr,"replace")) {
+            replace = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"absttl")) {
+            absttl = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"idletime") && additional >= 1 &&
+                   lfu_freq == -1)
+        {
+            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&lru_idle,NULL)
+                    != C_OK) return;
+            if (lru_idle < 0) {
+                addReplyError(c,"Invalid IDLETIME value, must be >= 0");
+                return;
+            }
+            lru_clock = LRU_CLOCK();
+            j++; /* Consume additional arg. */
+        } else if (!strcasecmp(c->argv[j]->ptr,"freq") && additional >= 1 &&
+                   lru_idle == -1)
+        {
+            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&lfu_freq,NULL)
+                    != C_OK) return;
+            if (lfu_freq < 0 || lfu_freq > 255) {
+                addReplyError(c,"Invalid FREQ value, must be >= 0 and <= 255");
+                return;
+            }
+            j++; /* Consume additional arg. */
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    /* Make sure this key does not already exist here... */
+    robj *key = c->argv[1];
+    if (!replace && lookupKeyWrite(c->db,key) != NULL) {
+        addReplyErrorObject(c,shared.busykeyerr);
+        return;
+    }
+
+    /* Check if the TTL value makes sense */
+    if (getLongLongFromObjectOrReply(c,c->argv[2],&ttl,NULL) != C_OK) {
+        return;
+    } else if (ttl < 0) {
+        addReplyError(c,"Invalid TTL value, must be >= 0");
+        return;
+    }
+
+    /* Verify RDB version and data checksum. */
+    if (verifyDumpPayload(c->argv[3]->ptr,sdslen(c->argv[3]->ptr)) == C_ERR)
+    {
+        addReplyError(c,"DUMP payload version or checksum are wrong");
+        return;
+    }
+
+    rioInitWithBuffer(&payload,c->argv[3]->ptr);
+    if (((type = rdbLoadObjectType(&payload)) == -1) ||
+        ((obj = rdbLoadObject(type,&payload,key->ptr,NULL)) == NULL))
+    {
+        addReplyError(c,"Bad data format");
+        return;
+    }
+
+    /* Remove the old key if needed. */
+    int deleted = 0;
+    if (replace)
+        deleted = dbDelete(c->db,key);
+
+    if (ttl && !absttl) ttl+=mstime();
+    if (ttl && checkAlreadyExpired(ttl)) {
+        if (deleted) {
+            rewriteClientCommandVector(c,2,shared.del,key);
+            signalModifiedKey(c,c->db,key);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
+            server.dirty++;
+        }
+        decrRefCount(obj);
+        addReply(c, shared.ok);
+        return;
+    }
+
+    /* Create the key and set the TTL if any */
+    dbAdd(c->db,key,obj);
+    if (ttl) {
+        setExpire(c,c->db,key,ttl);
+    }
+    objectSetLRUOrLFU(obj,lfu_freq,lru_idle,lru_clock,1000);
+    signalModifiedKey(c,c->db,key);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,"restore",key,c->db->id);
+    addReply(c,shared.ok);
+    server.dirty++;
+}
+
+/* MIGRATE socket cache implementation.
+ *
+ * We take a map between host:ip and a TCP socket that we used to connect
+ * to this instance in recent time.
+ * This sockets are closed when the max number we cache is reached, and also
+ * in serverCron() when they are around for more than a few seconds. */
+#define MIGRATE_SOCKET_CACHE_ITEMS 64 /* max num of items in the cache. */
+#define MIGRATE_SOCKET_CACHE_TTL 10 /* close cached sockets after 10 sec. */
+
+typedef struct migrateCachedSocket {
+    connection *conn;
+    long last_dbid;
+    time_t last_use_time;
+} migrateCachedSocket;
+
+/* Return a migrateCachedSocket containing a TCP socket connected with the
+ * target instance, possibly returning a cached one.
+ *
+ * This function is responsible of sending errors to the client if a
+ * connection can't be established. In this case -1 is returned.
+ * Otherwise on success the socket is returned, and the caller should not
+ * attempt to free it after usage.
+ *
+ * If the caller detects an error while using the socket, migrateCloseSocket()
+ * should be called so that the connection will be created from scratch
+ * the next time. */
+migrateCachedSocket* migrateGetSocket(client *c, robj *host, robj *port, long timeout) {
+    connection *conn;
+    sds name = sdsempty();
+    migrateCachedSocket *cs;
+
+    /* Check if we have an already cached socket for this ip:port pair. */
+    name = sdscatlen(name,host->ptr,sdslen(host->ptr));
+    name = sdscatlen(name,":",1);
+    name = sdscatlen(name,port->ptr,sdslen(port->ptr));
+    cs = dictFetchValue(server.migrate_cached_sockets,name);
+    if (cs) {
+        sdsfree(name);
+        cs->last_use_time = server.unixtime;
+        return cs;
+    }
+
+    /* No cached socket, create one. */
+    if (dictSize(server.migrate_cached_sockets) == MIGRATE_SOCKET_CACHE_ITEMS) {
+        /* Too many items, drop one at random. */
+        dictEntry *de = dictGetRandomKey(server.migrate_cached_sockets);
+        cs = dictGetVal(de);
+        connClose(cs->conn);
+        zfree(cs);
+        dictDelete(server.migrate_cached_sockets,dictGetKey(de));
+    }
+
+    /* Create the socket */
+    conn = server.tls_cluster ? connCreateTLS() : connCreateSocket();
+    if (connBlockingConnect(conn, c->argv[1]->ptr, atoi(c->argv[2]->ptr), timeout)
+            != C_OK) {
+        addReplyError(c,"-IOERR error or timeout connecting to the client");
+        connClose(conn);
+        sdsfree(name);
+        return NULL;
+    }
+    connEnableTcpNoDelay(conn);
+
+    /* Add to the cache and return it to the caller. */
+    cs = zmalloc(sizeof(*cs));
+    cs->conn = conn;
+
+    cs->last_dbid = -1;
+    cs->last_use_time = server.unixtime;
+    dictAdd(server.migrate_cached_sockets,name,cs);
+    return cs;
+}
+
+/* Free a migrate cached connection. */
+void migrateCloseSocket(robj *host, robj *port) {
+    sds name = sdsempty();
+    migrateCachedSocket *cs;
+
+    name = sdscatlen(name,host->ptr,sdslen(host->ptr));
+    name = sdscatlen(name,":",1);
+    name = sdscatlen(name,port->ptr,sdslen(port->ptr));
+    cs = dictFetchValue(server.migrate_cached_sockets,name);
+    if (!cs) {
+        sdsfree(name);
+        return;
+    }
+
+    connClose(cs->conn);
+    zfree(cs);
+    dictDelete(server.migrate_cached_sockets,name);
+    sdsfree(name);
+}
+
+void migrateCloseTimedoutSockets(void) {
+    dictIterator *di = dictGetSafeIterator(server.migrate_cached_sockets);
+    dictEntry *de;
+
+    while((de = dictNext(di)) != NULL) {
+        migrateCachedSocket *cs = dictGetVal(de);
+
+        if ((server.unixtime - cs->last_use_time) > MIGRATE_SOCKET_CACHE_TTL) {
+            connClose(cs->conn);
+            zfree(cs);
+            dictDelete(server.migrate_cached_sockets,dictGetKey(de));
+        }
+    }
+    dictReleaseIterator(di);
+}
+
+/* MIGRATE host port key dbid timeout [COPY | REPLACE | AUTH password |
+ *         AUTH2 username password]
+ *
+ * On in the multiple keys form:
+ *
+ * MIGRATE host port "" dbid timeout [COPY | REPLACE | AUTH password |
+ *         AUTH2 username password] KEYS key1 key2 ... keyN */
+void migrateCommand(client *c) {
+    migrateCachedSocket *cs;
+    int copy = 0, replace = 0, j;
+    char *username = NULL;
+    char *password = NULL;
+    long timeout;
+    long dbid;
+    robj **ov = NULL; /* Objects to migrate. */
+    robj **kv = NULL; /* Key names. */
+    robj **newargv = NULL; /* Used to rewrite the command as DEL ... keys ... */
+    rio cmd, payload;
+    int may_retry = 1;
+    int write_error = 0;
+    int argv_rewritten = 0;
+
+    /* To support the KEYS option we need the following additional state. */
+    int first_key = 3; /* Argument index of the first key. */
+    int num_keys = 1;  /* By default only migrate the 'key' argument. */
+
+    /* Parse additional options */
+    for (j = 6; j < c->argc; j++) {
+        int moreargs = (c->argc-1) - j;
+        if (!strcasecmp(c->argv[j]->ptr,"copy")) {
+            copy = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"replace")) {
+            replace = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"auth")) {
+            if (!moreargs) {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+            j++;
+            password = c->argv[j]->ptr;
+            redactClientCommandArgument(c,j);
+        } else if (!strcasecmp(c->argv[j]->ptr,"auth2")) {
+            if (moreargs < 2) {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+            username = c->argv[++j]->ptr;
+            redactClientCommandArgument(c,j);
+            password = c->argv[++j]->ptr;
+            redactClientCommandArgument(c,j);
+        } else if (!strcasecmp(c->argv[j]->ptr,"keys")) {
+            if (sdslen(c->argv[3]->ptr) != 0) {
+                addReplyError(c,
+                    "When using MIGRATE KEYS option, the key argument"
+                    " must be set to the empty string");
+                return;
+            }
+            first_key = j+1;
+            num_keys = c->argc - j - 1;
+            break; /* All the remaining args are keys. */
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    /* Sanity check */
+    if (getLongFromObjectOrReply(c,c->argv[5],&timeout,NULL) != C_OK ||
+        getLongFromObjectOrReply(c,c->argv[4],&dbid,NULL) != C_OK)
+    {
+        return;
+    }
+    if (timeout <= 0) timeout = 1000;
+
+    /* Check if the keys are here. If at least one key is to migrate, do it
+     * otherwise if all the keys are missing reply with "NOKEY" to signal
+     * the caller there was nothing to migrate. We don't return an error in
+     * this case, since often this is due to a normal condition like the key
+     * expiring in the meantime. */
+    ov = zrealloc(ov,sizeof(robj*)*num_keys);
+    kv = zrealloc(kv,sizeof(robj*)*num_keys);
+    int oi = 0;
+
+    for (j = 0; j < num_keys; j++) {
+        if ((ov[oi] = lookupKeyRead(c->db,c->argv[first_key+j])) != NULL) {
+            kv[oi] = c->argv[first_key+j];
+            oi++;
+        }
+    }
+    num_keys = oi;
+    if (num_keys == 0) {
+        zfree(ov); zfree(kv);
+        addReplySds(c,sdsnew("+NOKEY\r\n"));
+        return;
+    }
+
+try_again:
+    write_error = 0;
+
+    /* Connect */
+    cs = migrateGetSocket(c,c->argv[1],c->argv[2],timeout);
+    if (cs == NULL) {
+        zfree(ov); zfree(kv);
+        return; /* error sent to the client by migrateGetSocket() */
+    }
+
+    rioInitWithBuffer(&cmd,sdsempty());
+
+    /* Authentication */
+    if (password) {
+        int arity = username ? 3 : 2;
+        serverAssertWithInfo(c,NULL,rioWriteBulkCount(&cmd,'*',arity));
+        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"AUTH",4));
+        if (username) {
+            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,username,
+                                 sdslen(username)));
+        }
+        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,password,
+            sdslen(password)));
+    }
+
+    /* Send the SELECT command if the current DB is not already selected. */
+    int select = cs->last_dbid != dbid; /* Should we emit SELECT? */
+    if (select) {
+        serverAssertWithInfo(c,NULL,rioWriteBulkCount(&cmd,'*',2));
+        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"SELECT",6));
+        serverAssertWithInfo(c,NULL,rioWriteBulkLongLong(&cmd,dbid));
+    }
+
+    int non_expired = 0; /* Number of keys that we'll find non expired.
+                            Note that serializing large keys may take some time
+                            so certain keys that were found non expired by the
+                            lookupKey() function, may be expired later. */
+
+    /* Create RESTORE payload and generate the protocol to call the command. */
+    for (j = 0; j < num_keys; j++) {
+        long long ttl = 0;
+        long long expireat = getExpire(c->db,kv[j]);
+
+        if (expireat != -1) {
+            ttl = expireat-mstime();
+            if (ttl < 0) {
+                continue;
+            }
+            if (ttl < 1) ttl = 1;
+        }
+
+        /* Relocate valid (non expired) keys and values into the array in successive
+         * positions to remove holes created by the keys that were present
+         * in the first lookup but are now expired after the second lookup. */
+        ov[non_expired] = ov[j];
+        kv[non_expired++] = kv[j];
+
+        serverAssertWithInfo(c,NULL,
+            rioWriteBulkCount(&cmd,'*',replace ? 5 : 4));
+
+        if (server.cluster_enabled)
+            serverAssertWithInfo(c,NULL,
+                rioWriteBulkString(&cmd,"RESTORE-ASKING",14));
+        else
+            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"RESTORE",7));
+        serverAssertWithInfo(c,NULL,sdsEncodedObject(kv[j]));
+        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,kv[j]->ptr,
+                sdslen(kv[j]->ptr)));
+        serverAssertWithInfo(c,NULL,rioWriteBulkLongLong(&cmd,ttl));
+
+        /* Emit the payload argument, that is the serialized object using
+         * the DUMP format. */
+        createDumpPayload(&payload,ov[j],kv[j]);
+        serverAssertWithInfo(c,NULL,
+            rioWriteBulkString(&cmd,payload.io.buffer.ptr,
+                               sdslen(payload.io.buffer.ptr)));
+        sdsfree(payload.io.buffer.ptr);
+
+        /* Add the REPLACE option to the RESTORE command if it was specified
+         * as a MIGRATE option. */
+        if (replace)
+            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"REPLACE",7));
+    }
+
+    /* Fix the actual number of keys we are migrating. */
+    num_keys = non_expired;
+
+    /* Transfer the query to the other node in 64K chunks. */
+    errno = 0;
+    {
+        sds buf = cmd.io.buffer.ptr;
+        size_t pos = 0, towrite;
+        int nwritten = 0;
+
+        while ((towrite = sdslen(buf)-pos) > 0) {
+            towrite = (towrite > (64*1024) ? (64*1024) : towrite);
+            nwritten = connSyncWrite(cs->conn,buf+pos,towrite,timeout);
+            if (nwritten != (signed)towrite) {
+                write_error = 1;
+                goto socket_err;
+            }
+            pos += nwritten;
+        }
+    }
+
+    char buf0[1024]; /* Auth reply. */
+    char buf1[1024]; /* Select reply. */
+    char buf2[1024]; /* Restore reply. */
+
+    /* Read the AUTH reply if needed. */
+    if (password && connSyncReadLine(cs->conn, buf0, sizeof(buf0), timeout) <= 0)
+        goto socket_err;
+
+    /* Read the SELECT reply if needed. */
+    if (select && connSyncReadLine(cs->conn, buf1, sizeof(buf1), timeout) <= 0)
+        goto socket_err;
+
+    /* Read the RESTORE replies. */
+    int error_from_target = 0;
+    int socket_error = 0;
+    int del_idx = 1; /* Index of the key argument for the replicated DEL op. */
+
+    /* Allocate the new argument vector that will replace the current command,
+     * to propagate the MIGRATE as a DEL command (if no COPY option was given).
+     * We allocate num_keys+1 because the additional argument is for "DEL"
+     * command name itself. */
+    if (!copy) newargv = zmalloc(sizeof(robj*)*(num_keys+1));
+
+    for (j = 0; j < num_keys; j++) {
+        if (connSyncReadLine(cs->conn, buf2, sizeof(buf2), timeout) <= 0) {
+            socket_error = 1;
+            break;
+        }
+        if ((password && buf0[0] == '-') ||
+            (select && buf1[0] == '-') ||
+            buf2[0] == '-')
+        {
+            /* On error assume that last_dbid is no longer valid. */
+            if (!error_from_target) {
+                cs->last_dbid = -1;
+                char *errbuf;
+                if (password && buf0[0] == '-') errbuf = buf0;
+                else if (select && buf1[0] == '-') errbuf = buf1;
+                else errbuf = buf2;
+
+                error_from_target = 1;
+                addReplyErrorFormat(c,"Target instance replied with error: %s",
+                    errbuf+1);
+            }
+        } else {
+            if (!copy) {
+                /* No COPY option: remove the local key, signal the change. */
+                dbDelete(c->db,kv[j]);
+                signalModifiedKey(c,c->db,kv[j]);
+                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",kv[j],c->db->id);
+                server.dirty++;
+
+                /* Populate the argument vector to replace the old one. */
+                newargv[del_idx++] = kv[j];
+                incrRefCount(kv[j]);
+            }
+        }
+    }
+
+    /* On socket error, if we want to retry, do it now before rewriting the
+     * command vector. We only retry if we are sure nothing was processed
+     * and we failed to read the first reply (j == 0 test). */
+    if (!error_from_target && socket_error && j == 0 && may_retry &&
+        errno != ETIMEDOUT)
+    {
+        goto socket_err; /* A retry is guaranteed because of tested conditions.*/
+    }
+
+    /* On socket errors, close the migration socket now that we still have
+     * the original host/port in the ARGV. Later the original command may be
+     * rewritten to DEL and will be too later. */
+    if (socket_error) migrateCloseSocket(c->argv[1],c->argv[2]);
+
+    if (!copy) {
+        /* Translate MIGRATE as DEL for replication/AOF. Note that we do
+         * this only for the keys for which we received an acknowledgement
+         * from the receiving Redis server, by using the del_idx index. */
+        if (del_idx > 1) {
+            newargv[0] = createStringObject("DEL",3);
+            /* Note that the following call takes ownership of newargv. */
+            replaceClientCommandVector(c,del_idx,newargv);
+            argv_rewritten = 1;
+        } else {
+            /* No key transfer acknowledged, no need to rewrite as DEL. */
+            zfree(newargv);
+        }
+        newargv = NULL; /* Make it safe to call zfree() on it in the future. */
+    }
+
+    /* If we are here and a socket error happened, we don't want to retry.
+     * Just signal the problem to the client, but only do it if we did not
+     * already queue a different error reported by the destination server. */
+    if (!error_from_target && socket_error) {
+        may_retry = 0;
+        goto socket_err;
+    }
+
+    if (!error_from_target) {
+        /* Success! Update the last_dbid in migrateCachedSocket, so that we can
+         * avoid SELECT the next time if the target DB is the same. Reply +OK.
+         *
+         * Note: If we reached this point, even if socket_error is true
+         * still the SELECT command succeeded (otherwise the code jumps to
+         * socket_err label. */
+        cs->last_dbid = dbid;
+        addReply(c,shared.ok);
+    } else {
+        /* On error we already sent it in the for loop above, and set
+         * the currently selected socket to -1 to force SELECT the next time. */
+    }
+
+    sdsfree(cmd.io.buffer.ptr);
+    zfree(ov); zfree(kv); zfree(newargv);
+    return;
+
+/* On socket errors we try to close the cached socket and try again.
+ * It is very common for the cached socket to get closed, if just reopening
+ * it works it's a shame to notify the error to the caller. */
+socket_err:
+    /* Cleanup we want to perform in both the retry and no retry case.
+     * Note: Closing the migrate socket will also force SELECT next time. */
+    sdsfree(cmd.io.buffer.ptr);
+
+    /* If the command was rewritten as DEL and there was a socket error,
+     * we already closed the socket earlier. While migrateCloseSocket()
+     * is idempotent, the host/port arguments are now gone, so don't do it
+     * again. */
+    if (!argv_rewritten) migrateCloseSocket(c->argv[1],c->argv[2]);
+    zfree(newargv);
+    newargv = NULL; /* This will get reallocated on retry. */
+
+    /* Retry only if it's not a timeout and we never attempted a retry
+     * (or the code jumping here did not set may_retry to zero). */
+    if (errno != ETIMEDOUT && may_retry) {
+        may_retry = 0;
+        goto try_again;
+    }
+
+    /* Cleanup we want to do if no retry is attempted. */
+    zfree(ov); zfree(kv);
+    addReplySds(c,
+        sdscatprintf(sdsempty(),
+            "-IOERR error or timeout %s to target instance\r\n",
+            write_error ? "writing" : "reading"));
+    return;
+}
+
+/* -----------------------------------------------------------------------------
+ * Cluster functions related to serving / redirecting clients
+ * -------------------------------------------------------------------------- */
+
+/* The ASKING command is required after a -ASK redirection.
+ * The client should issue ASKING before to actually send the command to
+ * the target instance. See the Redis Cluster specification for more
+ * information. */
+void askingCommand(client *c) {
+    if (server.cluster_enabled == 0) {
+        addReplyError(c,"This instance has cluster support disabled");
+        return;
+    }
+    c->flags |= CLIENT_ASKING;
+    addReply(c,shared.ok);
+}
+
+/* The READONLY command is used by clients to enter the read-only mode.
+ * In this mode slaves will not redirect clients as long as clients access
+ * with read-only commands to keys that are served by the slave's master. */
+void readonlyCommand(client *c) {
+    if (server.cluster_enabled == 0) {
+        addReplyError(c,"This instance has cluster support disabled");
+        return;
+    }
+    c->flags |= CLIENT_READONLY;
+    addReply(c,shared.ok);
+}
+
+/* The READWRITE command just clears the READONLY command state. */
+void readwriteCommand(client *c) {
+    c->flags &= ~CLIENT_READONLY;
+    addReply(c,shared.ok);
+}
+
+/* Return the pointer to the cluster node that is able to serve the command.
+ * For the function to succeed the command should only target either:
+ *
+ * 1) A single key (even multiple times like LPOPRPUSH mylist mylist).
+ * 2) Multiple keys in the same hash slot, while the slot is stable (no
+ *    resharding in progress).
+ *
+ * On success the function returns the node that is able to serve the request.
+ * If the node is not 'myself' a redirection must be performed. The kind of
+ * redirection is specified setting the integer passed by reference
+ * 'error_code', which will be set to CLUSTER_REDIR_ASK or
+ * CLUSTER_REDIR_MOVED.
+ *
+ * When the node is 'myself' 'error_code' is set to CLUSTER_REDIR_NONE.
+ *
+ * If the command fails NULL is returned, and the reason of the failure is
+ * provided via 'error_code', which will be set to:
+ *
+ * CLUSTER_REDIR_CROSS_SLOT if the request contains multiple keys that
+ * don't belong to the same hash slot.
+ *
+ * CLUSTER_REDIR_UNSTABLE if the request contains multiple keys
+ * belonging to the same slot, but the slot is not stable (in migration or
+ * importing state, likely because a resharding is in progress).
+ *
+ * CLUSTER_REDIR_DOWN_UNBOUND if the request addresses a slot which is
+ * not bound to any node. In this case the cluster global state should be
+ * already "down" but it is fragile to rely on the update of the global state,
+ * so we also handle it here.
+ *
+ * CLUSTER_REDIR_DOWN_STATE and CLUSTER_REDIR_DOWN_RO_STATE if the cluster is
+ * down but the user attempts to execute a command that addresses one or more keys. */
+clusterNode *getNodeByQuery(client *c, struct redisCommand *cmd, robj **argv, int argc, int *hashslot, int *error_code) {
+    clusterNode *n = NULL;
+    robj *firstkey = NULL;
+    int multiple_keys = 0;
+    multiState *ms, _ms;
+    multiCmd mc;
+    int i, slot = 0, migrating_slot = 0, importing_slot = 0, missing_keys = 0;
+
+    /* Allow any key to be set if a module disabled cluster redirections. */
+    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
+        return myself;
+
+    /* Set error code optimistically for the base case. */
+    if (error_code) *error_code = CLUSTER_REDIR_NONE;
+
+    /* Modules can turn off Redis Cluster redirection: this is useful
+     * when writing a module that implements a completely different
+     * distributed system. */
+
+    /* We handle all the cases as if they were EXEC commands, so we have
+     * a common code path for everything */
+    if (cmd->proc == execCommand) {
+        /* If CLIENT_MULTI flag is not set EXEC is just going to return an
+         * error. */
+        if (!(c->flags & CLIENT_MULTI)) return myself;
+        ms = &c->mstate;
+    } else {
+        /* In order to have a single codepath create a fake Multi State
+         * structure if the client is not in MULTI/EXEC state, this way
+         * we have a single codepath below. */
+        ms = &_ms;
+        _ms.commands = &mc;
+        _ms.count = 1;
+        mc.argv = argv;
+        mc.argc = argc;
+        mc.cmd = cmd;
+    }
+
+    /* Check that all the keys are in the same hash slot, and obtain this
+     * slot and the node associated. */
+    for (i = 0; i < ms->count; i++) {
+        struct redisCommand *mcmd;
+        robj **margv;
+        int margc, *keyindex, numkeys, j;
+
+        mcmd = ms->commands[i].cmd;
+        margc = ms->commands[i].argc;
+        margv = ms->commands[i].argv;
+
+        getKeysResult result = GETKEYS_RESULT_INIT;
+        numkeys = getKeysFromCommand(mcmd,margv,margc,&result);
+        keyindex = result.keys;
+
+        for (j = 0; j < numkeys; j++) {
+            robj *thiskey = margv[keyindex[j]];
+            int thisslot = keyHashSlot((char*)thiskey->ptr,
+                                       sdslen(thiskey->ptr));
+
+            if (firstkey == NULL) {
+                /* This is the first key we see. Check what is the slot
+                 * and node. */
+                firstkey = thiskey;
+                slot = thisslot;
+                n = server.cluster->slots[slot];
+
+                /* Error: If a slot is not served, we are in "cluster down"
+                 * state. However the state is yet to be updated, so this was
+                 * not trapped earlier in processCommand(). Report the same
+                 * error to the client. */
+                if (n == NULL) {
+                    getKeysFreeResult(&result);
+                    if (error_code)
+                        *error_code = CLUSTER_REDIR_DOWN_UNBOUND;
+                    return NULL;
+                }
+
+                /* If we are migrating or importing this slot, we need to check
+                 * if we have all the keys in the request (the only way we
+                 * can safely serve the request, otherwise we return a TRYAGAIN
+                 * error). To do so we set the importing/migrating state and
+                 * increment a counter for every missing key. */
+                if (n == myself &&
+                    server.cluster->migrating_slots_to[slot] != NULL)
+                {
+                    migrating_slot = 1;
+                } else if (server.cluster->importing_slots_from[slot] != NULL) {
+                    importing_slot = 1;
+                }
+            } else {
+                /* If it is not the first key, make sure it is exactly
+                 * the same key as the first we saw. */
+                if (!equalStringObjects(firstkey,thiskey)) {
+                    if (slot != thisslot) {
+                        /* Error: multiple keys from different slots. */
+                        getKeysFreeResult(&result);
+                        if (error_code)
+                            *error_code = CLUSTER_REDIR_CROSS_SLOT;
+                        return NULL;
+                    } else {
+                        /* Flag this request as one with multiple different
+                         * keys. */
+                        multiple_keys = 1;
+                    }
+                }
+            }
+
+            /* Migrating / Importing slot? Count keys we don't have. */
+            if ((migrating_slot || importing_slot) &&
+                lookupKeyRead(&server.db[0],thiskey) == NULL)
+            {
+                missing_keys++;
+            }
+        }
+        getKeysFreeResult(&result);
+    }
+
+    /* No key at all in command? then we can serve the request
+     * without redirections or errors in all the cases. */
+    if (n == NULL) return myself;
+
+    /* Cluster is globally down but we got keys? We only serve the request
+     * if it is a read command and when allow_reads_when_down is enabled. */
+    if (server.cluster->state != CLUSTER_OK) {
+        if (!server.cluster_allow_reads_when_down) {
+            /* The cluster is configured to block commands when the
+             * cluster is down. */
+            if (error_code) *error_code = CLUSTER_REDIR_DOWN_STATE;
+            return NULL;
+        } else if (cmd->flags & CMD_WRITE) {
+            /* The cluster is configured to allow read only commands */
+            if (error_code) *error_code = CLUSTER_REDIR_DOWN_RO_STATE;
+            return NULL;
+        } else {
+            /* Fall through and allow the command to be executed:
+             * this happens when server.cluster_allow_reads_when_down is
+             * true and the command is not a write command */
+        }
+    }
+
+    /* Return the hashslot by reference. */
+    if (hashslot) *hashslot = slot;
+
+    /* MIGRATE always works in the context of the local node if the slot
+     * is open (migrating or importing state). We need to be able to freely
+     * move keys among instances in this case. */
+    if ((migrating_slot || importing_slot) && cmd->proc == migrateCommand)
+        return myself;
+
+    /* If we don't have all the keys and we are migrating the slot, send
+     * an ASK redirection. */
+    if (migrating_slot && missing_keys) {
+        if (error_code) *error_code = CLUSTER_REDIR_ASK;
+        return server.cluster->migrating_slots_to[slot];
+    }
+
+    /* If we are receiving the slot, and the client correctly flagged the
+     * request as "ASKING", we can serve the request. However if the request
+     * involves multiple keys and we don't have them all, the only option is
+     * to send a TRYAGAIN error. */
+    if (importing_slot &&
+        (c->flags & CLIENT_ASKING || cmd->flags & CMD_ASKING))
+    {
+        if (multiple_keys && missing_keys) {
+            if (error_code) *error_code = CLUSTER_REDIR_UNSTABLE;
+            return NULL;
+        } else {
+            return myself;
+        }
+    }
+
+    /* Handle the read-only client case reading from a slave: if this
+     * node is a slave and the request is about a hash slot our master
+     * is serving, we can reply without redirection. */
+    int is_write_command = (c->cmd->flags & CMD_WRITE) ||
+                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_WRITE));
+    if (c->flags & CLIENT_READONLY &&
+        !is_write_command &&
+        nodeIsSlave(myself) &&
+        myself->slaveof == n)
+    {
+        return myself;
+    }
+
+    /* Base case: just return the right node. However if this node is not
+     * myself, set error_code to MOVED since we need to issue a redirection. */
+    if (n != myself && error_code) *error_code = CLUSTER_REDIR_MOVED;
+    return n;
+}
+
+/* Send the client the right redirection code, according to error_code
+ * that should be set to one of CLUSTER_REDIR_* macros.
+ *
+ * If CLUSTER_REDIR_ASK or CLUSTER_REDIR_MOVED error codes
+ * are used, then the node 'n' should not be NULL, but should be the
+ * node we want to mention in the redirection. Moreover hashslot should
+ * be set to the hash slot that caused the redirection. */
+void clusterRedirectClient(client *c, clusterNode *n, int hashslot, int error_code) {
+    if (error_code == CLUSTER_REDIR_CROSS_SLOT) {
+        addReplyError(c,"-CROSSSLOT Keys in request don't hash to the same slot");
+    } else if (error_code == CLUSTER_REDIR_UNSTABLE) {
+        /* The request spawns multiple keys in the same slot,
+         * but the slot is not "stable" currently as there is
+         * a migration or import in progress. */
+        addReplyError(c,"-TRYAGAIN Multiple keys request during rehashing of slot");
+    } else if (error_code == CLUSTER_REDIR_DOWN_STATE) {
+        addReplyError(c,"-CLUSTERDOWN The cluster is down");
+    } else if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) {
+        addReplyError(c,"-CLUSTERDOWN The cluster is down and only accepts read commands");
+    } else if (error_code == CLUSTER_REDIR_DOWN_UNBOUND) {
+        addReplyError(c,"-CLUSTERDOWN Hash slot not served");
+    } else if (error_code == CLUSTER_REDIR_MOVED ||
+               error_code == CLUSTER_REDIR_ASK)
+    {
+        /* Redirect to IP:port. Include plaintext port if cluster is TLS but
+         * client is non-TLS. */
+        int use_pport = (server.tls_cluster &&
+                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
+        int port = use_pport && n->pport ? n->pport : n->port;
+        addReplyErrorSds(c,sdscatprintf(sdsempty(),
+            "-%s %d %s:%d",
+            (error_code == CLUSTER_REDIR_ASK) ? "ASK" : "MOVED",
+            hashslot, n->ip, port));
+    } else {
+        serverPanic("getNodeByQuery() unknown error.");
+    }
+}
+
+/* This function is called by the function processing clients incrementally
+ * to detect timeouts, in order to handle the following case:
+ *
+ * 1) A client blocks with BLPOP or similar blocking operation.
+ * 2) The master migrates the hash slot elsewhere or turns into a slave.
+ * 3) The client may remain blocked forever (or up to the max timeout time)
+ *    waiting for a key change that will never happen.
+ *
+ * If the client is found to be blocked into a hash slot this node no
+ * longer handles, the client is sent a redirection error, and the function
+ * returns 1. Otherwise 0 is returned and no operation is performed. */
+int clusterRedirectBlockedClientIfNeeded(client *c) {
+    if (c->flags & CLIENT_BLOCKED &&
+        (c->btype == BLOCKED_LIST ||
+         c->btype == BLOCKED_ZSET ||
+         c->btype == BLOCKED_STREAM))
+    {
+        dictEntry *de;
+        dictIterator *di;
+
+        /* If the cluster is down, unblock the client with the right error.
+         * If the cluster is configured to allow reads on cluster down, we
+         * still want to emit this error since a write will be required
+         * to unblock them which may never come.  */
+        if (server.cluster->state == CLUSTER_FAIL) {
+            clusterRedirectClient(c,NULL,0,CLUSTER_REDIR_DOWN_STATE);
+            return 1;
+        }
+
+        /* All keys must belong to the same slot, so check first key only. */
+        di = dictGetIterator(c->bpop.keys);
+        if ((de = dictNext(di)) != NULL) {
+            robj *key = dictGetKey(de);
+            int slot = keyHashSlot((char*)key->ptr, sdslen(key->ptr));
+            clusterNode *node = server.cluster->slots[slot];
+
+            /* if the client is read-only and attempting to access key that our
+             * replica can handle, allow it. */
+            if ((c->flags & CLIENT_READONLY) &&
+                !(c->lastcmd->flags & CMD_WRITE) &&
+                nodeIsSlave(myself) && myself->slaveof == node)
+            {
+                node = myself;
+            }
+
+            /* We send an error and unblock the client if:
+             * 1) The slot is unassigned, emitting a cluster down error.
+             * 2) The slot is not handled by this node, nor being imported. */
+            if (node != myself &&
+                server.cluster->importing_slots_from[slot] == NULL)
+            {
+                if (node == NULL) {
+                    clusterRedirectClient(c,NULL,0,
+                        CLUSTER_REDIR_DOWN_UNBOUND);
+                } else {
+                    clusterRedirectClient(c,node,slot,
+                        CLUSTER_REDIR_MOVED);
+                }
+                dictReleaseIterator(di);
+                return 1;
+            }
+        }
+        dictReleaseIterator(di);
+    }
+    return 0;
+}
diff --git a/redis-stable/src/cluster.h b/redis-stable/src/cluster.h
new file mode 100644
index 00000000..f476a50a
--- /dev/null
+++ b/redis-stable/src/cluster.h
@@ -0,0 +1,296 @@
+#ifndef __CLUSTER_H
+#define __CLUSTER_H
+
+/*-----------------------------------------------------------------------------
+ * Redis cluster data structures, defines, exported API.
+ *----------------------------------------------------------------------------*/
+
+#define CLUSTER_SLOTS 16384
+#define CLUSTER_OK 0          /* Everything looks ok */
+#define CLUSTER_FAIL 1        /* The cluster can't work */
+#define CLUSTER_NAMELEN 40    /* sha1 hex length */
+#define CLUSTER_PORT_INCR 10000 /* Cluster port = baseport + PORT_INCR */
+
+/* The following defines are amount of time, sometimes expressed as
+ * multiplicators of the node timeout value (when ending with MULT). */
+#define CLUSTER_FAIL_REPORT_VALIDITY_MULT 2 /* Fail report validity. */
+#define CLUSTER_FAIL_UNDO_TIME_MULT 2 /* Undo fail if master is back. */
+#define CLUSTER_FAIL_UNDO_TIME_ADD 10 /* Some additional time. */
+#define CLUSTER_FAILOVER_DELAY 5 /* Seconds */
+#define CLUSTER_MF_TIMEOUT 5000 /* Milliseconds to do a manual failover. */
+#define CLUSTER_MF_PAUSE_MULT 2 /* Master pause manual failover mult. */
+#define CLUSTER_SLAVE_MIGRATION_DELAY 5000 /* Delay for slave migration. */
+
+/* Redirection errors returned by getNodeByQuery(). */
+#define CLUSTER_REDIR_NONE 0          /* Node can serve the request. */
+#define CLUSTER_REDIR_CROSS_SLOT 1    /* -CROSSSLOT request. */
+#define CLUSTER_REDIR_UNSTABLE 2      /* -TRYAGAIN redirection required */
+#define CLUSTER_REDIR_ASK 3           /* -ASK redirection required. */
+#define CLUSTER_REDIR_MOVED 4         /* -MOVED redirection required. */
+#define CLUSTER_REDIR_DOWN_STATE 5    /* -CLUSTERDOWN, global state. */
+#define CLUSTER_REDIR_DOWN_UNBOUND 6  /* -CLUSTERDOWN, unbound slot. */
+#define CLUSTER_REDIR_DOWN_RO_STATE 7 /* -CLUSTERDOWN, allow reads. */
+
+struct clusterNode;
+
+/* clusterLink encapsulates everything needed to talk with a remote node. */
+typedef struct clusterLink {
+    mstime_t ctime;             /* Link creation time */
+    connection *conn;           /* Connection to remote node */
+    sds sndbuf;                 /* Packet send buffer */
+    char *rcvbuf;               /* Packet reception buffer */
+    size_t rcvbuf_len;          /* Used size of rcvbuf */
+    size_t rcvbuf_alloc;        /* Allocated size of rcvbuf */
+    struct clusterNode *node;   /* Node related to this link if any, or NULL */
+} clusterLink;
+
+/* Cluster node flags and macros. */
+#define CLUSTER_NODE_MASTER 1     /* The node is a master */
+#define CLUSTER_NODE_SLAVE 2      /* The node is a slave */
+#define CLUSTER_NODE_PFAIL 4      /* Failure? Need acknowledge */
+#define CLUSTER_NODE_FAIL 8       /* The node is believed to be malfunctioning */
+#define CLUSTER_NODE_MYSELF 16    /* This node is myself */
+#define CLUSTER_NODE_HANDSHAKE 32 /* We have still to exchange the first ping */
+#define CLUSTER_NODE_NOADDR   64  /* We don't know the address of this node */
+#define CLUSTER_NODE_MEET 128     /* Send a MEET message to this node */
+#define CLUSTER_NODE_MIGRATE_TO 256 /* Master eligible for replica migration. */
+#define CLUSTER_NODE_NOFAILOVER 512 /* Slave will not try to failover. */
+#define CLUSTER_NODE_NULL_NAME "\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000"
+
+#define nodeIsMaster(n) ((n)->flags & CLUSTER_NODE_MASTER)
+#define nodeIsSlave(n) ((n)->flags & CLUSTER_NODE_SLAVE)
+#define nodeInHandshake(n) ((n)->flags & CLUSTER_NODE_HANDSHAKE)
+#define nodeHasAddr(n) (!((n)->flags & CLUSTER_NODE_NOADDR))
+#define nodeWithoutAddr(n) ((n)->flags & CLUSTER_NODE_NOADDR)
+#define nodeTimedOut(n) ((n)->flags & CLUSTER_NODE_PFAIL)
+#define nodeFailed(n) ((n)->flags & CLUSTER_NODE_FAIL)
+#define nodeCantFailover(n) ((n)->flags & CLUSTER_NODE_NOFAILOVER)
+
+/* Reasons why a slave is not able to failover. */
+#define CLUSTER_CANT_FAILOVER_NONE 0
+#define CLUSTER_CANT_FAILOVER_DATA_AGE 1
+#define CLUSTER_CANT_FAILOVER_WAITING_DELAY 2
+#define CLUSTER_CANT_FAILOVER_EXPIRED 3
+#define CLUSTER_CANT_FAILOVER_WAITING_VOTES 4
+#define CLUSTER_CANT_FAILOVER_RELOG_PERIOD (60*5) /* seconds. */
+
+/* clusterState todo_before_sleep flags. */
+#define CLUSTER_TODO_HANDLE_FAILOVER (1<<0)
+#define CLUSTER_TODO_UPDATE_STATE (1<<1)
+#define CLUSTER_TODO_SAVE_CONFIG (1<<2)
+#define CLUSTER_TODO_FSYNC_CONFIG (1<<3)
+#define CLUSTER_TODO_HANDLE_MANUALFAILOVER (1<<4)
+
+/* Message types.
+ *
+ * Note that the PING, PONG and MEET messages are actually the same exact
+ * kind of packet. PONG is the reply to ping, in the exact format as a PING,
+ * while MEET is a special PING that forces the receiver to add the sender
+ * as a node (if it is not already in the list). */
+#define CLUSTERMSG_TYPE_PING 0          /* Ping */
+#define CLUSTERMSG_TYPE_PONG 1          /* Pong (reply to Ping) */
+#define CLUSTERMSG_TYPE_MEET 2          /* Meet "let's join" message */
+#define CLUSTERMSG_TYPE_FAIL 3          /* Mark node xxx as failing */
+#define CLUSTERMSG_TYPE_PUBLISH 4       /* Pub/Sub Publish propagation */
+#define CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST 5 /* May I failover? */
+#define CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK 6     /* Yes, you have my vote */
+#define CLUSTERMSG_TYPE_UPDATE 7        /* Another node slots configuration */
+#define CLUSTERMSG_TYPE_MFSTART 8       /* Pause clients for manual failover */
+#define CLUSTERMSG_TYPE_MODULE 9        /* Module cluster API message. */
+#define CLUSTERMSG_TYPE_COUNT 10        /* Total number of message types. */
+
+/* Flags that a module can set in order to prevent certain Redis Cluster
+ * features to be enabled. Useful when implementing a different distributed
+ * system on top of Redis Cluster message bus, using modules. */
+#define CLUSTER_MODULE_FLAG_NONE 0
+#define CLUSTER_MODULE_FLAG_NO_FAILOVER (1<<1)
+#define CLUSTER_MODULE_FLAG_NO_REDIRECTION (1<<2)
+
+/* This structure represent elements of node->fail_reports. */
+typedef struct clusterNodeFailReport {
+    struct clusterNode *node;  /* Node reporting the failure condition. */
+    mstime_t time;             /* Time of the last report from this node. */
+} clusterNodeFailReport;
+
+typedef struct clusterNode {
+    mstime_t ctime; /* Node object creation time. */
+    char name[CLUSTER_NAMELEN]; /* Node name, hex string, sha1-size */
+    int flags;      /* CLUSTER_NODE_... */
+    uint64_t configEpoch; /* Last configEpoch observed for this node */
+    unsigned char slots[CLUSTER_SLOTS/8]; /* slots handled by this node */
+    sds slots_info; /* Slots info represented by string. */
+    int numslots;   /* Number of slots handled by this node */
+    int numslaves;  /* Number of slave nodes, if this is a master */
+    struct clusterNode **slaves; /* pointers to slave nodes */
+    struct clusterNode *slaveof; /* pointer to the master node. Note that it
+                                    may be NULL even if the node is a slave
+                                    if we don't have the master node in our
+                                    tables. */
+    mstime_t ping_sent;      /* Unix time we sent latest ping */
+    mstime_t pong_received;  /* Unix time we received the pong */
+    mstime_t data_received;  /* Unix time we received any data */
+    mstime_t fail_time;      /* Unix time when FAIL flag was set */
+    mstime_t voted_time;     /* Last time we voted for a slave of this master */
+    mstime_t repl_offset_time;  /* Unix time we received offset for this node */
+    mstime_t orphaned_time;     /* Starting time of orphaned master condition */
+    long long repl_offset;      /* Last known repl offset for this node. */
+    char ip[NET_IP_STR_LEN];  /* Latest known IP address of this node */
+    int port;                   /* Latest known clients port (TLS or plain). */
+    int pport;                  /* Latest known clients plaintext port. Only used
+                                   if the main clients port is for TLS. */
+    int cport;                  /* Latest known cluster port of this node. */
+    clusterLink *link;          /* TCP/IP link with this node */
+    list *fail_reports;         /* List of nodes signaling this as failing */
+} clusterNode;
+
+typedef struct clusterState {
+    clusterNode *myself;  /* This node */
+    uint64_t currentEpoch;
+    int state;            /* CLUSTER_OK, CLUSTER_FAIL, ... */
+    int size;             /* Num of master nodes with at least one slot */
+    dict *nodes;          /* Hash table of name -> clusterNode structures */
+    dict *nodes_black_list; /* Nodes we don't re-add for a few seconds. */
+    clusterNode *migrating_slots_to[CLUSTER_SLOTS];
+    clusterNode *importing_slots_from[CLUSTER_SLOTS];
+    clusterNode *slots[CLUSTER_SLOTS];
+    uint64_t slots_keys_count[CLUSTER_SLOTS];
+    rax *slots_to_keys;
+    /* The following fields are used to take the slave state on elections. */
+    mstime_t failover_auth_time; /* Time of previous or next election. */
+    int failover_auth_count;    /* Number of votes received so far. */
+    int failover_auth_sent;     /* True if we already asked for votes. */
+    int failover_auth_rank;     /* This slave rank for current auth request. */
+    uint64_t failover_auth_epoch; /* Epoch of the current election. */
+    int cant_failover_reason;   /* Why a slave is currently not able to
+                                   failover. See the CANT_FAILOVER_* macros. */
+    /* Manual failover state in common. */
+    mstime_t mf_end;            /* Manual failover time limit (ms unixtime).
+                                   It is zero if there is no MF in progress. */
+    /* Manual failover state of master. */
+    clusterNode *mf_slave;      /* Slave performing the manual failover. */
+    /* Manual failover state of slave. */
+    long long mf_master_offset; /* Master offset the slave needs to start MF
+                                   or -1 if still not received. */
+    int mf_can_start;           /* If non-zero signal that the manual failover
+                                   can start requesting masters vote. */
+    /* The following fields are used by masters to take state on elections. */
+    uint64_t lastVoteEpoch;     /* Epoch of the last vote granted. */
+    int todo_before_sleep; /* Things to do in clusterBeforeSleep(). */
+    /* Messages received and sent by type. */
+    long long stats_bus_messages_sent[CLUSTERMSG_TYPE_COUNT];
+    long long stats_bus_messages_received[CLUSTERMSG_TYPE_COUNT];
+    long long stats_pfail_nodes;    /* Number of nodes in PFAIL status,
+                                       excluding nodes without address. */
+} clusterState;
+
+/* Redis cluster messages header */
+
+/* Initially we don't know our "name", but we'll find it once we connect
+ * to the first node, using the getsockname() function. Then we'll use this
+ * address for all the next messages. */
+typedef struct {
+    char nodename[CLUSTER_NAMELEN];
+    uint32_t ping_sent;
+    uint32_t pong_received;
+    char ip[NET_IP_STR_LEN];  /* IP address last time it was seen */
+    uint16_t port;              /* base port last time it was seen */
+    uint16_t cport;             /* cluster port last time it was seen */
+    uint16_t flags;             /* node->flags copy */
+    uint16_t pport;             /* plaintext-port, when base port is TLS */
+    uint16_t notused1;
+} clusterMsgDataGossip;
+
+typedef struct {
+    char nodename[CLUSTER_NAMELEN];
+} clusterMsgDataFail;
+
+typedef struct {
+    uint32_t channel_len;
+    uint32_t message_len;
+    unsigned char bulk_data[8]; /* 8 bytes just as placeholder. */
+} clusterMsgDataPublish;
+
+typedef struct {
+    uint64_t configEpoch; /* Config epoch of the specified instance. */
+    char nodename[CLUSTER_NAMELEN]; /* Name of the slots owner. */
+    unsigned char slots[CLUSTER_SLOTS/8]; /* Slots bitmap. */
+} clusterMsgDataUpdate;
+
+typedef struct {
+    uint64_t module_id;     /* ID of the sender module. */
+    uint32_t len;           /* ID of the sender module. */
+    uint8_t type;           /* Type from 0 to 255. */
+    unsigned char bulk_data[3]; /* 3 bytes just as placeholder. */
+} clusterMsgModule;
+
+union clusterMsgData {
+    /* PING, MEET and PONG */
+    struct {
+        /* Array of N clusterMsgDataGossip structures */
+        clusterMsgDataGossip gossip[1];
+    } ping;
+
+    /* FAIL */
+    struct {
+        clusterMsgDataFail about;
+    } fail;
+
+    /* PUBLISH */
+    struct {
+        clusterMsgDataPublish msg;
+    } publish;
+
+    /* UPDATE */
+    struct {
+        clusterMsgDataUpdate nodecfg;
+    } update;
+
+    /* MODULE */
+    struct {
+        clusterMsgModule msg;
+    } module;
+};
+
+#define CLUSTER_PROTO_VER 1 /* Cluster bus protocol version. */
+
+typedef struct {
+    char sig[4];        /* Signature "RCmb" (Redis Cluster message bus). */
+    uint32_t totlen;    /* Total length of this message */
+    uint16_t ver;       /* Protocol version, currently set to 1. */
+    uint16_t port;      /* TCP base port number. */
+    uint16_t type;      /* Message type */
+    uint16_t count;     /* Only used for some kind of messages. */
+    uint64_t currentEpoch;  /* The epoch accordingly to the sending node. */
+    uint64_t configEpoch;   /* The config epoch if it's a master, or the last
+                               epoch advertised by its master if it is a
+                               slave. */
+    uint64_t offset;    /* Master replication offset if node is a master or
+                           processed replication offset if node is a slave. */
+    char sender[CLUSTER_NAMELEN]; /* Name of the sender node */
+    unsigned char myslots[CLUSTER_SLOTS/8];
+    char slaveof[CLUSTER_NAMELEN];
+    char myip[NET_IP_STR_LEN];    /* Sender IP, if not all zeroed. */
+    char notused1[32];  /* 32 bytes reserved for future usage. */
+    uint16_t pport;      /* Sender TCP plaintext port, if base port is TLS */
+    uint16_t cport;      /* Sender TCP cluster bus port */
+    uint16_t flags;      /* Sender node flags */
+    unsigned char state; /* Cluster state from the POV of the sender */
+    unsigned char mflags[3]; /* Message flags: CLUSTERMSG_FLAG[012]_... */
+    union clusterMsgData data;
+} clusterMsg;
+
+#define CLUSTERMSG_MIN_LEN (sizeof(clusterMsg)-sizeof(union clusterMsgData))
+
+/* Message flags better specify the packet content or are used to
+ * provide some information about the node state. */
+#define CLUSTERMSG_FLAG0_PAUSED (1<<0) /* Master paused for manual failover. */
+#define CLUSTERMSG_FLAG0_FORCEACK (1<<1) /* Give ACK to AUTH_REQUEST even if
+                                            master is up. */
+
+/* ---------------------- API exported outside cluster.c -------------------- */
+clusterNode *getNodeByQuery(client *c, struct redisCommand *cmd, robj **argv, int argc, int *hashslot, int *ask);
+int clusterRedirectBlockedClientIfNeeded(client *c);
+void clusterRedirectClient(client *c, clusterNode *n, int hashslot, int error_code);
+unsigned long getClusterConnectionsCount(void);
+
+#endif /* __CLUSTER_H */
diff --git a/redis-stable/src/config.c b/redis-stable/src/config.c
new file mode 100644
index 00000000..e0eec2f6
--- /dev/null
+++ b/redis-stable/src/config.c
@@ -0,0 +1,2624 @@
+/* Configuration file parsing and CONFIG GET/SET commands implementation.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "cluster.h"
+
+#include <fcntl.h>
+#include <sys/stat.h>
+
+/*-----------------------------------------------------------------------------
+ * Config file name-value maps.
+ *----------------------------------------------------------------------------*/
+
+typedef struct configEnum {
+    const char *name;
+    const int val;
+} configEnum;
+
+configEnum maxmemory_policy_enum[] = {
+    {"volatile-lru", MAXMEMORY_VOLATILE_LRU},
+    {"volatile-lfu", MAXMEMORY_VOLATILE_LFU},
+    {"volatile-random",MAXMEMORY_VOLATILE_RANDOM},
+    {"volatile-ttl",MAXMEMORY_VOLATILE_TTL},
+    {"allkeys-lru",MAXMEMORY_ALLKEYS_LRU},
+    {"allkeys-lfu",MAXMEMORY_ALLKEYS_LFU},
+    {"allkeys-random",MAXMEMORY_ALLKEYS_RANDOM},
+    {"noeviction",MAXMEMORY_NO_EVICTION},
+    {NULL, 0}
+};
+
+configEnum syslog_facility_enum[] = {
+    {"user",    LOG_USER},
+    {"local0",  LOG_LOCAL0},
+    {"local1",  LOG_LOCAL1},
+    {"local2",  LOG_LOCAL2},
+    {"local3",  LOG_LOCAL3},
+    {"local4",  LOG_LOCAL4},
+    {"local5",  LOG_LOCAL5},
+    {"local6",  LOG_LOCAL6},
+    {"local7",  LOG_LOCAL7},
+    {NULL, 0}
+};
+
+configEnum loglevel_enum[] = {
+    {"debug", LL_DEBUG},
+    {"verbose", LL_VERBOSE},
+    {"notice", LL_NOTICE},
+    {"warning", LL_WARNING},
+    {NULL,0}
+};
+
+configEnum supervised_mode_enum[] = {
+    {"upstart", SUPERVISED_UPSTART},
+    {"systemd", SUPERVISED_SYSTEMD},
+    {"auto", SUPERVISED_AUTODETECT},
+    {"no", SUPERVISED_NONE},
+    {NULL, 0}
+};
+
+configEnum aof_fsync_enum[] = {
+    {"everysec", AOF_FSYNC_EVERYSEC},
+    {"always", AOF_FSYNC_ALWAYS},
+    {"no", AOF_FSYNC_NO},
+    {NULL, 0}
+};
+
+configEnum repl_diskless_load_enum[] = {
+    {"disabled", REPL_DISKLESS_LOAD_DISABLED},
+    {"on-empty-db", REPL_DISKLESS_LOAD_WHEN_DB_EMPTY},
+    {"swapdb", REPL_DISKLESS_LOAD_SWAPDB},
+    {NULL, 0}
+};
+
+configEnum tls_auth_clients_enum[] = {
+    {"no", TLS_CLIENT_AUTH_NO},
+    {"yes", TLS_CLIENT_AUTH_YES},
+    {"optional", TLS_CLIENT_AUTH_OPTIONAL},
+    {NULL, 0}
+};
+
+configEnum oom_score_adj_enum[] = {
+    {"no", OOM_SCORE_ADJ_NO},
+    {"yes", OOM_SCORE_RELATIVE},
+    {"relative", OOM_SCORE_RELATIVE},
+    {"absolute", OOM_SCORE_ADJ_ABSOLUTE},
+    {NULL, 0}
+};
+
+configEnum acl_pubsub_default_enum[] = {
+    {"allchannels", USER_FLAG_ALLCHANNELS},
+    {"resetchannels", 0},
+    {NULL, 0}
+};
+
+configEnum sanitize_dump_payload_enum[] = {
+    {"no", SANITIZE_DUMP_NO},
+    {"yes", SANITIZE_DUMP_YES},
+    {"clients", SANITIZE_DUMP_CLIENTS},
+    {NULL, 0}
+};
+
+/* Output buffer limits presets. */
+clientBufferLimitsConfig clientBufferLimitsDefaults[CLIENT_TYPE_OBUF_COUNT] = {
+    {0, 0, 0}, /* normal */
+    {1024*1024*256, 1024*1024*64, 60}, /* slave */
+    {1024*1024*32, 1024*1024*8, 60}  /* pubsub */
+};
+
+/* OOM Score defaults */
+int configOOMScoreAdjValuesDefaults[CONFIG_OOM_COUNT] = { 0, 200, 800 };
+
+/* Generic config infrastructure function pointers
+ * int is_valid_fn(val, err)
+ *     Return 1 when val is valid, and 0 when invalid.
+ *     Optionally set err to a static error string.
+ * int update_fn(val, prev, err)
+ *     This function is called only for CONFIG SET command (not at config file parsing)
+ *     It is called after the actual config is applied,
+ *     Return 1 for success, and 0 for failure.
+ *     Optionally set err to a static error string.
+ *     On failure the config change will be reverted.
+ */
+
+/* Configuration values that require no special handling to set, get, load or
+ * rewrite. */
+typedef struct boolConfigData {
+    int *config; /* The pointer to the server config this value is stored in */
+    const int default_value; /* The default value of the config on rewrite */
+    int (*is_valid_fn)(int val, const char **err); /* Optional function to check validity of new value (generic doc above) */
+    int (*update_fn)(int val, int prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
+} boolConfigData;
+
+typedef struct stringConfigData {
+    char **config; /* Pointer to the server config this value is stored in. */
+    const char *default_value; /* Default value of the config on rewrite. */
+    int (*is_valid_fn)(char* val, const char **err); /* Optional function to check validity of new value (generic doc above) */
+    int (*update_fn)(char* val, char* prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
+    int convert_empty_to_null; /* Boolean indicating if empty strings should
+                                  be stored as a NULL value. */
+} stringConfigData;
+
+typedef struct sdsConfigData {
+    sds *config; /* Pointer to the server config this value is stored in. */
+    const char *default_value; /* Default value of the config on rewrite. */
+    int (*is_valid_fn)(sds val, const char **err); /* Optional function to check validity of new value (generic doc above) */
+    int (*update_fn)(sds val, sds prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
+    int convert_empty_to_null; /* Boolean indicating if empty SDS strings should
+                                  be stored as a NULL value. */
+} sdsConfigData;
+
+typedef struct enumConfigData {
+    int *config; /* The pointer to the server config this value is stored in */
+    configEnum *enum_value; /* The underlying enum type this data represents */
+    const int default_value; /* The default value of the config on rewrite */
+    int (*is_valid_fn)(int val, const char **err); /* Optional function to check validity of new value (generic doc above) */
+    int (*update_fn)(int val, int prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
+} enumConfigData;
+
+typedef enum numericType {
+    NUMERIC_TYPE_INT,
+    NUMERIC_TYPE_UINT,
+    NUMERIC_TYPE_LONG,
+    NUMERIC_TYPE_ULONG,
+    NUMERIC_TYPE_LONG_LONG,
+    NUMERIC_TYPE_ULONG_LONG,
+    NUMERIC_TYPE_SIZE_T,
+    NUMERIC_TYPE_SSIZE_T,
+    NUMERIC_TYPE_OFF_T,
+    NUMERIC_TYPE_TIME_T,
+} numericType;
+
+typedef struct numericConfigData {
+    union {
+        int *i;
+        unsigned int *ui;
+        long *l;
+        unsigned long *ul;
+        long long *ll;
+        unsigned long long *ull;
+        size_t *st;
+        ssize_t *sst;
+        off_t *ot;
+        time_t *tt;
+    } config; /* The pointer to the numeric config this value is stored in */
+    int is_memory; /* Indicates if this value can be loaded as a memory value */
+    numericType numeric_type; /* An enum indicating the type of this value */
+    long long lower_bound; /* The lower bound of this numeric value */
+    long long upper_bound; /* The upper bound of this numeric value */
+    const long long default_value; /* The default value of the config on rewrite */
+    int (*is_valid_fn)(long long val, const char **err); /* Optional function to check validity of new value (generic doc above) */
+    int (*update_fn)(long long val, long long prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
+} numericConfigData;
+
+typedef union typeData {
+    boolConfigData yesno;
+    stringConfigData string;
+    sdsConfigData sds;
+    enumConfigData enumd;
+    numericConfigData numeric;
+} typeData;
+
+typedef struct typeInterface {
+    /* Called on server start, to init the server with default value */
+    void (*init)(typeData data);
+    /* Called on server startup and CONFIG SET, returns 1 on success, 0 on error
+     * and can set a verbose err string, update is true when called from CONFIG SET */
+    int (*set)(typeData data, sds value, int update, const char **err);
+    /* Called on CONFIG GET, required to add output to the client */
+    void (*get)(client *c, typeData data);
+    /* Called on CONFIG REWRITE, required to rewrite the config state */
+    void (*rewrite)(typeData data, const char *name, struct rewriteConfigState *state);
+} typeInterface;
+
+typedef struct standardConfig {
+    const char *name; /* The user visible name of this config */
+    const char *alias; /* An alias that can also be used for this config */
+    const unsigned int flags; /* Flags for this specific config */
+    typeInterface interface; /* The function pointers that define the type interface */
+    typeData data; /* The type specific data exposed used by the interface */
+} standardConfig;
+
+#define MODIFIABLE_CONFIG 0 /* This is the implied default for a standard 
+                             * config, which is mutable. */
+#define IMMUTABLE_CONFIG (1ULL<<0) /* Can this value only be set at startup? */
+#define SENSITIVE_CONFIG (1ULL<<1) /* Does this value contain sensitive information */
+
+standardConfig configs[];
+
+/*-----------------------------------------------------------------------------
+ * Enum access functions
+ *----------------------------------------------------------------------------*/
+
+/* Get enum value from name. If there is no match INT_MIN is returned. */
+int configEnumGetValue(configEnum *ce, char *name) {
+    while(ce->name != NULL) {
+        if (!strcasecmp(ce->name,name)) return ce->val;
+        ce++;
+    }
+    return INT_MIN;
+}
+
+/* Get enum name from value. If no match is found NULL is returned. */
+const char *configEnumGetName(configEnum *ce, int val) {
+    while(ce->name != NULL) {
+        if (ce->val == val) return ce->name;
+        ce++;
+    }
+    return NULL;
+}
+
+/* Wrapper for configEnumGetName() returning "unknown" instead of NULL if
+ * there is no match. */
+const char *configEnumGetNameOrUnknown(configEnum *ce, int val) {
+    const char *name = configEnumGetName(ce,val);
+    return name ? name : "unknown";
+}
+
+/* Used for INFO generation. */
+const char *evictPolicyToString(void) {
+    return configEnumGetNameOrUnknown(maxmemory_policy_enum,server.maxmemory_policy);
+}
+
+/*-----------------------------------------------------------------------------
+ * Config file parsing
+ *----------------------------------------------------------------------------*/
+
+int yesnotoi(char *s) {
+    if (!strcasecmp(s,"yes")) return 1;
+    else if (!strcasecmp(s,"no")) return 0;
+    else return -1;
+}
+
+void appendServerSaveParams(time_t seconds, int changes) {
+    server.saveparams = zrealloc(server.saveparams,sizeof(struct saveparam)*(server.saveparamslen+1));
+    server.saveparams[server.saveparamslen].seconds = seconds;
+    server.saveparams[server.saveparamslen].changes = changes;
+    server.saveparamslen++;
+}
+
+void resetServerSaveParams(void) {
+    zfree(server.saveparams);
+    server.saveparams = NULL;
+    server.saveparamslen = 0;
+}
+
+void queueLoadModule(sds path, sds *argv, int argc) {
+    int i;
+    struct moduleLoadQueueEntry *loadmod;
+
+    loadmod = zmalloc(sizeof(struct moduleLoadQueueEntry));
+    loadmod->argv = zmalloc(sizeof(robj*)*argc);
+    loadmod->path = sdsnew(path);
+    loadmod->argc = argc;
+    for (i = 0; i < argc; i++) {
+        loadmod->argv[i] = createRawStringObject(argv[i],sdslen(argv[i]));
+    }
+    listAddNodeTail(server.loadmodule_queue,loadmod);
+}
+
+/* Parse an array of CONFIG_OOM_COUNT sds strings, validate and populate
+ * server.oom_score_adj_values if valid.
+ */
+
+static int updateOOMScoreAdjValues(sds *args, const char **err, int apply) {
+    int i;
+    int values[CONFIG_OOM_COUNT];
+
+    for (i = 0; i < CONFIG_OOM_COUNT; i++) {
+        char *eptr;
+        long long val = strtoll(args[i], &eptr, 10);
+
+        if (*eptr != '\0' || val < -2000 || val > 2000) {
+            if (err) *err = "Invalid oom-score-adj-values, elements must be between -2000 and 2000.";
+            return C_ERR;
+        }
+
+        values[i] = val;
+    }
+
+    /* Verify that the values make sense. If they don't omit a warning but
+     * keep the configuration, which may still be valid for privileged processes.
+     */
+
+    if (values[CONFIG_OOM_REPLICA] < values[CONFIG_OOM_MASTER] ||
+        values[CONFIG_OOM_BGCHILD] < values[CONFIG_OOM_REPLICA]) {
+            serverLog(LOG_WARNING,
+                    "The oom-score-adj-values configuration may not work for non-privileged processes! "
+                    "Please consult the documentation.");
+    }
+
+    /* Store values, retain previous config for rollback in case we fail. */
+    int old_values[CONFIG_OOM_COUNT];
+    for (i = 0; i < CONFIG_OOM_COUNT; i++) {
+        old_values[i] = server.oom_score_adj_values[i];
+        server.oom_score_adj_values[i] = values[i];
+    }
+    
+    /* When parsing the config file, we want to apply only when all is done. */
+    if (!apply)
+        return C_OK;
+
+    /* Update */
+    if (setOOMScoreAdj(-1) == C_ERR) {
+        /* Roll back */
+        for (i = 0; i < CONFIG_OOM_COUNT; i++)
+            server.oom_score_adj_values[i] = old_values[i];
+
+        if (err)
+            *err = "Failed to apply oom-score-adj-values configuration, check server logs.";
+
+        return C_ERR;
+    }
+
+    return C_OK;
+}
+
+void initConfigValues() {
+    for (standardConfig *config = configs; config->name != NULL; config++) {
+        config->interface.init(config->data);
+    }
+}
+
+void loadServerConfigFromString(char *config) {
+    const char *err = NULL;
+    int linenum = 0, totlines, i;
+    int slaveof_linenum = 0;
+    sds *lines;
+    int save_loaded = 0;
+
+    lines = sdssplitlen(config,strlen(config),"\n",1,&totlines);
+
+    for (i = 0; i < totlines; i++) {
+        sds *argv;
+        int argc;
+
+        linenum = i+1;
+        lines[i] = sdstrim(lines[i]," \t\r\n");
+
+        /* Skip comments and blank lines */
+        if (lines[i][0] == '#' || lines[i][0] == '\0') continue;
+
+        /* Split into arguments */
+        argv = sdssplitargs(lines[i],&argc);
+        if (argv == NULL) {
+            err = "Unbalanced quotes in configuration line";
+            goto loaderr;
+        }
+
+        /* Skip this line if the resulting command vector is empty. */
+        if (argc == 0) {
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+        sdstolower(argv[0]);
+
+        /* Iterate the configs that are standard */
+        int match = 0;
+        for (standardConfig *config = configs; config->name != NULL; config++) {
+            if ((!strcasecmp(argv[0],config->name) ||
+                (config->alias && !strcasecmp(argv[0],config->alias))))
+            {
+                if (argc != 2) {
+                    err = "wrong number of arguments";
+                    goto loaderr;
+                }
+                if (!config->interface.set(config->data, argv[1], 0, &err)) {
+                    goto loaderr;
+                }
+
+                match = 1;
+                break;
+            }
+        }
+
+        if (match) {
+            sdsfreesplitres(argv,argc);
+            continue;
+        }
+
+        /* Execute config directives */
+        if (!strcasecmp(argv[0],"bind") && argc >= 2) {
+            int j, addresses = argc-1;
+
+            if (addresses > CONFIG_BINDADDR_MAX) {
+                err = "Too many bind addresses specified"; goto loaderr;
+            }
+            /* Free old bind addresses */
+            for (j = 0; j < server.bindaddr_count; j++) {
+                zfree(server.bindaddr[j]);
+            }
+            for (j = 0; j < addresses; j++)
+                server.bindaddr[j] = zstrdup(argv[j+1]);
+            server.bindaddr_count = addresses;
+        } else if (!strcasecmp(argv[0],"unixsocketperm") && argc == 2) {
+            errno = 0;
+            server.unixsocketperm = (mode_t)strtol(argv[1], NULL, 8);
+            if (errno || server.unixsocketperm > 0777) {
+                err = "Invalid socket file permissions"; goto loaderr;
+            }
+        } else if (!strcasecmp(argv[0],"save")) {
+            /* We don't reset save params before loading, because if they're not part
+             * of the file the defaults should be used.
+             */
+            if (!save_loaded) {
+                save_loaded = 1;
+                resetServerSaveParams();
+            }
+
+            if (argc == 3) {
+                int seconds = atoi(argv[1]);
+                int changes = atoi(argv[2]);
+                if (seconds < 1 || changes < 0) {
+                    err = "Invalid save parameters"; goto loaderr;
+                }
+                appendServerSaveParams(seconds,changes);
+            } else if (argc == 2 && !strcasecmp(argv[1],"")) {
+                resetServerSaveParams();
+            }
+        } else if (!strcasecmp(argv[0],"dir") && argc == 2) {
+            if (chdir(argv[1]) == -1) {
+                serverLog(LL_WARNING,"Can't chdir to '%s': %s",
+                    argv[1], strerror(errno));
+                exit(1);
+            }
+        } else if (!strcasecmp(argv[0],"logfile") && argc == 2) {
+            FILE *logfp;
+
+            zfree(server.logfile);
+            server.logfile = zstrdup(argv[1]);
+            if (server.logfile[0] != '\0') {
+                /* Test if we are able to open the file. The server will not
+                 * be able to abort just for this problem later... */
+                logfp = fopen(server.logfile,"a");
+                if (logfp == NULL) {
+                    err = sdscatprintf(sdsempty(),
+                        "Can't open the log file: %s", strerror(errno));
+                    goto loaderr;
+                }
+                fclose(logfp);
+            }
+        } else if (!strcasecmp(argv[0],"include") && argc == 2) {
+            loadServerConfig(argv[1], 0, NULL);
+        } else if ((!strcasecmp(argv[0],"slaveof") ||
+                    !strcasecmp(argv[0],"replicaof")) && argc == 3) {
+            slaveof_linenum = linenum;
+            sdsfree(server.masterhost);
+            if (!strcasecmp(argv[1], "no") && !strcasecmp(argv[2], "one")) {
+                server.masterhost = NULL;
+                continue;
+            }
+            server.masterhost = sdsnew(argv[1]);
+            char *ptr;
+            server.masterport = strtol(argv[2], &ptr, 10);
+            if (server.masterport < 0 || server.masterport > 65535 || *ptr != '\0') {
+                err = "Invalid master port"; goto loaderr;
+            }
+            server.repl_state = REPL_STATE_CONNECT;
+        } else if (!strcasecmp(argv[0],"list-max-ziplist-entries") && argc == 2){
+            /* DEAD OPTION */
+        } else if (!strcasecmp(argv[0],"list-max-ziplist-value") && argc == 2) {
+            /* DEAD OPTION */
+        } else if (!strcasecmp(argv[0],"rename-command") && argc == 3) {
+            struct redisCommand *cmd = lookupCommand(argv[1]);
+            int retval;
+
+            if (!cmd) {
+                err = "No such command in rename-command";
+                goto loaderr;
+            }
+
+            /* If the target command name is the empty string we just
+             * remove it from the command table. */
+            retval = dictDelete(server.commands, argv[1]);
+            serverAssert(retval == DICT_OK);
+
+            /* Otherwise we re-add the command under a different name. */
+            if (sdslen(argv[2]) != 0) {
+                sds copy = sdsdup(argv[2]);
+
+                retval = dictAdd(server.commands, copy, cmd);
+                if (retval != DICT_OK) {
+                    sdsfree(copy);
+                    err = "Target command name already exists"; goto loaderr;
+                }
+            }
+        } else if (!strcasecmp(argv[0],"cluster-config-file") && argc == 2) {
+            zfree(server.cluster_configfile);
+            server.cluster_configfile = zstrdup(argv[1]);
+        } else if (!strcasecmp(argv[0],"client-output-buffer-limit") &&
+                   argc == 5)
+        {
+            int class = getClientTypeByName(argv[1]);
+            unsigned long long hard, soft;
+            int soft_seconds;
+
+            if (class == -1 || class == CLIENT_TYPE_MASTER) {
+                err = "Unrecognized client limit class: the user specified "
+                "an invalid one, or 'master' which has no buffer limits.";
+                goto loaderr;
+            }
+            hard = memtoll(argv[2],NULL);
+            soft = memtoll(argv[3],NULL);
+            soft_seconds = atoi(argv[4]);
+            if (soft_seconds < 0) {
+                err = "Negative number of seconds in soft limit is invalid";
+                goto loaderr;
+            }
+            server.client_obuf_limits[class].hard_limit_bytes = hard;
+            server.client_obuf_limits[class].soft_limit_bytes = soft;
+            server.client_obuf_limits[class].soft_limit_seconds = soft_seconds;
+        } else if (!strcasecmp(argv[0],"oom-score-adj-values") && argc == 1 + CONFIG_OOM_COUNT) {
+            if (updateOOMScoreAdjValues(&argv[1], &err, 0) == C_ERR) goto loaderr;
+        } else if (!strcasecmp(argv[0],"notify-keyspace-events") && argc == 2) {
+            int flags = keyspaceEventsStringToFlags(argv[1]);
+
+            if (flags == -1) {
+                err = "Invalid event class character. Use 'g$lshzxeA'.";
+                goto loaderr;
+            }
+            server.notify_keyspace_events = flags;
+        } else if (!strcasecmp(argv[0],"user") && argc >= 2) {
+            int argc_err;
+            if (ACLAppendUserForLoading(argv,argc,&argc_err) == C_ERR) {
+                char buf[1024];
+                const char *errmsg = ACLSetUserStringError();
+                snprintf(buf,sizeof(buf),"Error in user declaration '%s': %s",
+                    argv[argc_err],errmsg);
+                err = buf;
+                goto loaderr;
+            }
+        } else if (!strcasecmp(argv[0],"loadmodule") && argc >= 2) {
+            queueLoadModule(argv[1],&argv[2],argc-2);
+        } else if (!strcasecmp(argv[0],"sentinel")) {
+            /* argc == 1 is handled by main() as we need to enter the sentinel
+             * mode ASAP. */
+            if (argc != 1) {
+                if (!server.sentinel_mode) {
+                    err = "sentinel directive while not in sentinel mode";
+                    goto loaderr;
+                }
+                queueSentinelConfig(argv+1,argc-1,linenum,lines[i]);
+            }
+        } else {
+            err = "Bad directive or wrong number of arguments"; goto loaderr;
+        }
+        sdsfreesplitres(argv,argc);
+    }
+
+    /* Sanity checks. */
+    if (server.cluster_enabled && server.masterhost) {
+        linenum = slaveof_linenum;
+        i = linenum-1;
+        err = "replicaof directive not allowed in cluster mode";
+        goto loaderr;
+    }
+
+    /* To ensure backward compatibility and work while hz is out of range */
+    if (server.config_hz < CONFIG_MIN_HZ) server.config_hz = CONFIG_MIN_HZ;
+    if (server.config_hz > CONFIG_MAX_HZ) server.config_hz = CONFIG_MAX_HZ;
+
+    sdsfreesplitres(lines,totlines);
+    return;
+
+loaderr:
+    fprintf(stderr, "\n*** FATAL CONFIG FILE ERROR (Redis %s) ***\n",
+        REDIS_VERSION);
+    fprintf(stderr, "Reading the configuration file, at line %d\n", linenum);
+    fprintf(stderr, ">>> '%s'\n", lines[i]);
+    fprintf(stderr, "%s\n", err);
+    exit(1);
+}
+
+/* Load the server configuration from the specified filename.
+ * The function appends the additional configuration directives stored
+ * in the 'options' string to the config file before loading.
+ *
+ * Both filename and options can be NULL, in such a case are considered
+ * empty. This way loadServerConfig can be used to just load a file or
+ * just load a string. */
+void loadServerConfig(char *filename, char config_from_stdin, char *options) {
+    sds config = sdsempty();
+    char buf[CONFIG_MAX_LINE+1];
+    FILE *fp;
+
+    /* Load the file content */
+    if (filename) {
+        if ((fp = fopen(filename,"r")) == NULL) {
+            serverLog(LL_WARNING,
+                    "Fatal error, can't open config file '%s': %s",
+                    filename, strerror(errno));
+            exit(1);
+        }
+        while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL)
+            config = sdscat(config,buf);
+        fclose(fp);
+    }
+    /* Append content from stdin */
+    if (config_from_stdin) {
+        serverLog(LL_WARNING,"Reading config from stdin");
+        fp = stdin;
+        while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL)
+            config = sdscat(config,buf);
+    }
+
+    /* Append the additional options */
+    if (options) {
+        config = sdscat(config,"\n");
+        config = sdscat(config,options);
+    }
+    loadServerConfigFromString(config);
+    sdsfree(config);
+}
+
+/*-----------------------------------------------------------------------------
+ * CONFIG SET implementation
+ *----------------------------------------------------------------------------*/
+
+#define config_set_bool_field(_name,_var) \
+    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
+        int yn = yesnotoi(o->ptr); \
+        if (yn == -1) goto badfmt; \
+        _var = yn;
+
+#define config_set_numerical_field(_name,_var,min,max) \
+    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
+        if (getLongLongFromObject(o,&ll) == C_ERR) goto badfmt; \
+        if (min != LLONG_MIN && ll < min) goto badfmt; \
+        if (max != LLONG_MAX && ll > max) goto badfmt; \
+        _var = ll;
+
+#define config_set_memory_field(_name,_var) \
+    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
+        ll = memtoll(o->ptr,&err); \
+        if (err || ll < 0) goto badfmt; \
+        _var = ll;
+
+#define config_set_special_field(_name) \
+    } else if (!strcasecmp(c->argv[2]->ptr,_name)) {
+
+#define config_set_special_field_with_alias(_name1,_name2) \
+    } else if (!strcasecmp(c->argv[2]->ptr,_name1) || \
+               !strcasecmp(c->argv[2]->ptr,_name2)) {
+
+#define config_set_else } else
+
+void configSetCommand(client *c) {
+    robj *o;
+    long long ll;
+    int err;
+    const char *errstr = NULL;
+    serverAssertWithInfo(c,c->argv[2],sdsEncodedObject(c->argv[2]));
+    serverAssertWithInfo(c,c->argv[3],sdsEncodedObject(c->argv[3]));
+    o = c->argv[3];
+
+    /* Iterate the configs that are standard */
+    for (standardConfig *config = configs; config->name != NULL; config++) {
+        if (!(config->flags & IMMUTABLE_CONFIG) && 
+            (!strcasecmp(c->argv[2]->ptr,config->name) ||
+            (config->alias && !strcasecmp(c->argv[2]->ptr,config->alias))))
+        {
+            if (config->flags & SENSITIVE_CONFIG) {
+                redactClientCommandArgument(c,3);
+            }
+            if (!config->interface.set(config->data,o->ptr,1,&errstr)) {
+                goto badfmt;
+            }
+            addReply(c,shared.ok);
+            return;
+        }
+    }
+
+    if (0) { /* this starts the config_set macros else-if chain. */
+
+    /* Special fields that can't be handled with general macros. */
+    config_set_special_field("bind") {
+        int vlen;
+        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
+
+        if (vlen < 1 || vlen > CONFIG_BINDADDR_MAX) {
+            addReplyError(c, "Too many bind addresses specified.");
+            sdsfreesplitres(v, vlen);
+            return;
+        }
+
+        if (changeBindAddr(v, vlen) == C_ERR) {
+            addReplyError(c, "Failed to bind to specified addresses.");
+            sdsfreesplitres(v, vlen);
+            return;
+        }
+        sdsfreesplitres(v, vlen);
+    } config_set_special_field("save") {
+        int vlen, j;
+        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
+
+        /* Perform sanity check before setting the new config:
+         * - Even number of args
+         * - Seconds >= 1, changes >= 0 */
+        if (vlen & 1) {
+            sdsfreesplitres(v,vlen);
+            goto badfmt;
+        }
+        for (j = 0; j < vlen; j++) {
+            char *eptr;
+            long val;
+
+            val = strtoll(v[j], &eptr, 10);
+            if (eptr[0] != '\0' ||
+                ((j & 1) == 0 && val < 1) ||
+                ((j & 1) == 1 && val < 0)) {
+                sdsfreesplitres(v,vlen);
+                goto badfmt;
+            }
+        }
+        /* Finally set the new config */
+        resetServerSaveParams();
+        for (j = 0; j < vlen; j += 2) {
+            time_t seconds;
+            int changes;
+
+            seconds = strtoll(v[j],NULL,10);
+            changes = strtoll(v[j+1],NULL,10);
+            appendServerSaveParams(seconds, changes);
+        }
+        sdsfreesplitres(v,vlen);
+    } config_set_special_field("dir") {
+        if (chdir((char*)o->ptr) == -1) {
+            addReplyErrorFormat(c,"Changing directory: %s", strerror(errno));
+            return;
+        }
+    } config_set_special_field("client-output-buffer-limit") {
+        int vlen, j;
+        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
+
+        /* We need a multiple of 4: <class> <hard> <soft> <soft_seconds> */
+        if (vlen % 4) {
+            sdsfreesplitres(v,vlen);
+            goto badfmt;
+        }
+
+        /* Sanity check of single arguments, so that we either refuse the
+         * whole configuration string or accept it all, even if a single
+         * error in a single client class is present. */
+        for (j = 0; j < vlen; j++) {
+            long val;
+
+            if ((j % 4) == 0) {
+                int class = getClientTypeByName(v[j]);
+                if (class == -1 || class == CLIENT_TYPE_MASTER) {
+                    sdsfreesplitres(v,vlen);
+                    goto badfmt;
+                }
+            } else {
+                val = memtoll(v[j], &err);
+                if (err || val < 0) {
+                    sdsfreesplitres(v,vlen);
+                    goto badfmt;
+                }
+            }
+        }
+        /* Finally set the new config */
+        for (j = 0; j < vlen; j += 4) {
+            int class;
+            unsigned long long hard, soft;
+            int soft_seconds;
+
+            class = getClientTypeByName(v[j]);
+            hard = memtoll(v[j+1],NULL);
+            soft = memtoll(v[j+2],NULL);
+            soft_seconds = strtoll(v[j+3],NULL,10);
+
+            server.client_obuf_limits[class].hard_limit_bytes = hard;
+            server.client_obuf_limits[class].soft_limit_bytes = soft;
+            server.client_obuf_limits[class].soft_limit_seconds = soft_seconds;
+        }
+        sdsfreesplitres(v,vlen);
+    } config_set_special_field("oom-score-adj-values") {
+        int vlen;
+        int success = 1;
+
+        sds *v = sdssplitlen(o->ptr, sdslen(o->ptr), " ", 1, &vlen);
+        if (vlen != CONFIG_OOM_COUNT || updateOOMScoreAdjValues(v, &errstr, 1) == C_ERR)
+            success = 0;
+
+        sdsfreesplitres(v, vlen);
+        if (!success)
+            goto badfmt;
+    } config_set_special_field("notify-keyspace-events") {
+        int flags = keyspaceEventsStringToFlags(o->ptr);
+
+        if (flags == -1) goto badfmt;
+        server.notify_keyspace_events = flags;
+    /* Numerical fields.
+     * config_set_numerical_field(name,var,min,max) */
+    } config_set_numerical_field(
+      "watchdog-period",ll,0,INT_MAX) {
+        if (ll)
+            enableWatchdog(ll);
+        else
+            disableWatchdog();
+    /* Everything else is an error... */
+    } config_set_else {
+        addReplyErrorFormat(c,"Unsupported CONFIG parameter: %s",
+            (char*)c->argv[2]->ptr);
+        return;
+    }
+
+    /* On success we just return a generic OK for all the options. */
+    addReply(c,shared.ok);
+    return;
+
+badfmt: /* Bad format errors */
+    if (errstr) {
+        addReplyErrorFormat(c,"Invalid argument '%s' for CONFIG SET '%s' - %s",
+                (char*)o->ptr,
+                (char*)c->argv[2]->ptr,
+                errstr);
+    } else {
+        addReplyErrorFormat(c,"Invalid argument '%s' for CONFIG SET '%s'",
+                (char*)o->ptr,
+                (char*)c->argv[2]->ptr);
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * CONFIG GET implementation
+ *----------------------------------------------------------------------------*/
+
+#define config_get_string_field(_name,_var) do { \
+    if (stringmatch(pattern,_name,1)) { \
+        addReplyBulkCString(c,_name); \
+        addReplyBulkCString(c,_var ? _var : ""); \
+        matches++; \
+    } \
+} while(0)
+
+#define config_get_bool_field(_name,_var) do { \
+    if (stringmatch(pattern,_name,1)) { \
+        addReplyBulkCString(c,_name); \
+        addReplyBulkCString(c,_var ? "yes" : "no"); \
+        matches++; \
+    } \
+} while(0)
+
+#define config_get_numerical_field(_name,_var) do { \
+    if (stringmatch(pattern,_name,1)) { \
+        ll2string(buf,sizeof(buf),_var); \
+        addReplyBulkCString(c,_name); \
+        addReplyBulkCString(c,buf); \
+        matches++; \
+    } \
+} while(0)
+
+void configGetCommand(client *c) {
+    robj *o = c->argv[2];
+    void *replylen = addReplyDeferredLen(c);
+    char *pattern = o->ptr;
+    char buf[128];
+    int matches = 0;
+    serverAssertWithInfo(c,o,sdsEncodedObject(o));
+
+    /* Iterate the configs that are standard */
+    for (standardConfig *config = configs; config->name != NULL; config++) {
+        if (stringmatch(pattern,config->name,1)) {
+            addReplyBulkCString(c,config->name);
+            config->interface.get(c,config->data);
+            matches++;
+        }
+        if (config->alias && stringmatch(pattern,config->alias,1)) {
+            addReplyBulkCString(c,config->alias);
+            config->interface.get(c,config->data);
+            matches++;
+        }
+    }
+
+    /* String values */
+    config_get_string_field("logfile",server.logfile);
+
+    /* Numerical values */
+    config_get_numerical_field("watchdog-period",server.watchdog_period);
+
+    /* Everything we can't handle with macros follows. */
+
+    if (stringmatch(pattern,"dir",1)) {
+        char buf[1024];
+
+        if (getcwd(buf,sizeof(buf)) == NULL)
+            buf[0] = '\0';
+
+        addReplyBulkCString(c,"dir");
+        addReplyBulkCString(c,buf);
+        matches++;
+    }
+    if (stringmatch(pattern,"save",1)) {
+        sds buf = sdsempty();
+        int j;
+
+        for (j = 0; j < server.saveparamslen; j++) {
+            buf = sdscatprintf(buf,"%jd %d",
+                    (intmax_t)server.saveparams[j].seconds,
+                    server.saveparams[j].changes);
+            if (j != server.saveparamslen-1)
+                buf = sdscatlen(buf," ",1);
+        }
+        addReplyBulkCString(c,"save");
+        addReplyBulkCString(c,buf);
+        sdsfree(buf);
+        matches++;
+    }
+    if (stringmatch(pattern,"client-output-buffer-limit",1)) {
+        sds buf = sdsempty();
+        int j;
+
+        for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++) {
+            buf = sdscatprintf(buf,"%s %llu %llu %ld",
+                    getClientTypeName(j),
+                    server.client_obuf_limits[j].hard_limit_bytes,
+                    server.client_obuf_limits[j].soft_limit_bytes,
+                    (long) server.client_obuf_limits[j].soft_limit_seconds);
+            if (j != CLIENT_TYPE_OBUF_COUNT-1)
+                buf = sdscatlen(buf," ",1);
+        }
+        addReplyBulkCString(c,"client-output-buffer-limit");
+        addReplyBulkCString(c,buf);
+        sdsfree(buf);
+        matches++;
+    }
+    if (stringmatch(pattern,"unixsocketperm",1)) {
+        char buf[32];
+        snprintf(buf,sizeof(buf),"%lo",(unsigned long) server.unixsocketperm);
+        addReplyBulkCString(c,"unixsocketperm");
+        addReplyBulkCString(c,buf);
+        matches++;
+    }
+    if (stringmatch(pattern,"slaveof",1) ||
+        stringmatch(pattern,"replicaof",1))
+    {
+        char *optname = stringmatch(pattern,"slaveof",1) ?
+                        "slaveof" : "replicaof";
+        char buf[256];
+
+        addReplyBulkCString(c,optname);
+        if (server.masterhost)
+            snprintf(buf,sizeof(buf),"%s %d",
+                server.masterhost, server.masterport);
+        else
+            buf[0] = '\0';
+        addReplyBulkCString(c,buf);
+        matches++;
+    }
+    if (stringmatch(pattern,"notify-keyspace-events",1)) {
+        sds flags = keyspaceEventsFlagsToString(server.notify_keyspace_events);
+
+        addReplyBulkCString(c,"notify-keyspace-events");
+        addReplyBulkSds(c,flags);
+        matches++;
+    }
+    if (stringmatch(pattern,"bind",1)) {
+        sds aux = sdsjoin(server.bindaddr,server.bindaddr_count," ");
+
+        addReplyBulkCString(c,"bind");
+        addReplyBulkCString(c,aux);
+        sdsfree(aux);
+        matches++;
+    }
+
+    if (stringmatch(pattern,"oom-score-adj-values",0)) {
+        sds buf = sdsempty();
+        int j;
+
+        for (j = 0; j < CONFIG_OOM_COUNT; j++) {
+            buf = sdscatprintf(buf,"%d", server.oom_score_adj_values[j]);
+            if (j != CONFIG_OOM_COUNT-1)
+                buf = sdscatlen(buf," ",1);
+        }
+
+        addReplyBulkCString(c,"oom-score-adj-values");
+        addReplyBulkCString(c,buf);
+        sdsfree(buf);
+        matches++;
+    }
+
+    setDeferredMapLen(c,replylen,matches);
+}
+
+/*-----------------------------------------------------------------------------
+ * CONFIG REWRITE implementation
+ *----------------------------------------------------------------------------*/
+
+#define REDIS_CONFIG_REWRITE_SIGNATURE "# Generated by CONFIG REWRITE"
+
+/* We use the following dictionary type to store where a configuration
+ * option is mentioned in the old configuration file, so it's
+ * like "maxmemory" -> list of line numbers (first line is zero). */
+uint64_t dictSdsCaseHash(const void *key);
+int dictSdsKeyCaseCompare(void *privdata, const void *key1, const void *key2);
+void dictSdsDestructor(void *privdata, void *val);
+void dictListDestructor(void *privdata, void *val);
+
+/* Sentinel config rewriting is implemented inside sentinel.c by
+ * rewriteConfigSentinelOption(). */
+void rewriteConfigSentinelOption(struct rewriteConfigState *state);
+
+dictType optionToLineDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    dictListDestructor,         /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+dictType optionSetDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* The config rewrite state. */
+struct rewriteConfigState {
+    dict *option_to_line; /* Option -> list of config file lines map */
+    dict *rewritten;      /* Dictionary of already processed options */
+    int numlines;         /* Number of lines in current config */
+    sds *lines;           /* Current lines as an array of sds strings */
+    int has_tail;         /* True if we already added directives that were
+                             not present in the original config file. */
+    int force_all;        /* True if we want all keywords to be force
+                             written. Currently only used for testing. */
+};
+
+/* Append the new line to the current configuration state. */
+void rewriteConfigAppendLine(struct rewriteConfigState *state, sds line) {
+    state->lines = zrealloc(state->lines, sizeof(char*) * (state->numlines+1));
+    state->lines[state->numlines++] = line;
+}
+
+/* Populate the option -> list of line numbers map. */
+void rewriteConfigAddLineNumberToOption(struct rewriteConfigState *state, sds option, int linenum) {
+    list *l = dictFetchValue(state->option_to_line,option);
+
+    if (l == NULL) {
+        l = listCreate();
+        dictAdd(state->option_to_line,sdsdup(option),l);
+    }
+    listAddNodeTail(l,(void*)(long)linenum);
+}
+
+/* Add the specified option to the set of processed options.
+ * This is useful as only unused lines of processed options will be blanked
+ * in the config file, while options the rewrite process does not understand
+ * remain untouched. */
+void rewriteConfigMarkAsProcessed(struct rewriteConfigState *state, const char *option) {
+    sds opt = sdsnew(option);
+
+    if (dictAdd(state->rewritten,opt,NULL) != DICT_OK) sdsfree(opt);
+}
+
+/* Read the old file, split it into lines to populate a newly created
+ * config rewrite state, and return it to the caller.
+ *
+ * If it is impossible to read the old file, NULL is returned.
+ * If the old file does not exist at all, an empty state is returned. */
+struct rewriteConfigState *rewriteConfigReadOldFile(char *path) {
+    FILE *fp = fopen(path,"r");
+    if (fp == NULL && errno != ENOENT) return NULL;
+
+    char buf[CONFIG_MAX_LINE+1];
+    int linenum = -1;
+    struct rewriteConfigState *state = zmalloc(sizeof(*state));
+    state->option_to_line = dictCreate(&optionToLineDictType,NULL);
+    state->rewritten = dictCreate(&optionSetDictType,NULL);
+    state->numlines = 0;
+    state->lines = NULL;
+    state->has_tail = 0;
+    state->force_all = 0;
+    if (fp == NULL) return state;
+
+    /* Read the old file line by line, populate the state. */
+    while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL) {
+        int argc;
+        sds *argv;
+        sds line = sdstrim(sdsnew(buf),"\r\n\t ");
+
+        linenum++; /* Zero based, so we init at -1 */
+
+        /* Handle comments and empty lines. */
+        if (line[0] == '#' || line[0] == '\0') {
+            if (!state->has_tail && !strcmp(line,REDIS_CONFIG_REWRITE_SIGNATURE))
+                state->has_tail = 1;
+            rewriteConfigAppendLine(state,line);
+            continue;
+        }
+
+        /* Not a comment, split into arguments. */
+        argv = sdssplitargs(line,&argc);
+        if (argv == NULL) {
+            /* Apparently the line is unparsable for some reason, for
+             * instance it may have unbalanced quotes. Load it as a
+             * comment. */
+            sds aux = sdsnew("# ??? ");
+            aux = sdscatsds(aux,line);
+            sdsfree(line);
+            rewriteConfigAppendLine(state,aux);
+            continue;
+        }
+
+        sdstolower(argv[0]); /* We only want lowercase config directives. */
+
+        /* Now we populate the state according to the content of this line.
+         * Append the line and populate the option -> line numbers map. */
+        rewriteConfigAppendLine(state,line);
+
+        /* Translate options using the word "slave" to the corresponding name
+         * "replica", before adding such option to the config name -> lines
+         * mapping. */
+        char *p = strstr(argv[0],"slave");
+        if (p) {
+            sds alt = sdsempty();
+            alt = sdscatlen(alt,argv[0],p-argv[0]);
+            alt = sdscatlen(alt,"replica",7);
+            alt = sdscatlen(alt,p+5,strlen(p+5));
+            sdsfree(argv[0]);
+            argv[0] = alt;
+        }
+        /* If this is sentinel config, we use sentinel "sentinel <config>" as option 
+            to avoid messing up the sequence. */
+        if (server.sentinel_mode && argc > 1 && !strcasecmp(argv[0],"sentinel")) {
+            sds sentinelOption = sdsempty();
+            sentinelOption = sdscatfmt(sentinelOption,"%S %S",argv[0],argv[1]);
+            rewriteConfigAddLineNumberToOption(state,sentinelOption,linenum);
+            sdsfree(sentinelOption);
+        } else {
+            rewriteConfigAddLineNumberToOption(state,argv[0],linenum);
+        }
+        sdsfreesplitres(argv,argc);
+    }
+    fclose(fp);
+    return state;
+}
+
+/* Rewrite the specified configuration option with the new "line".
+ * It progressively uses lines of the file that were already used for the same
+ * configuration option in the old version of the file, removing that line from
+ * the map of options -> line numbers.
+ *
+ * If there are lines associated with a given configuration option and
+ * "force" is non-zero, the line is appended to the configuration file.
+ * Usually "force" is true when an option has not its default value, so it
+ * must be rewritten even if not present previously.
+ *
+ * The first time a line is appended into a configuration file, a comment
+ * is added to show that starting from that point the config file was generated
+ * by CONFIG REWRITE.
+ *
+ * "line" is either used, or freed, so the caller does not need to free it
+ * in any way. */
+void rewriteConfigRewriteLine(struct rewriteConfigState *state, const char *option, sds line, int force) {
+    sds o = sdsnew(option);
+    list *l = dictFetchValue(state->option_to_line,o);
+
+    rewriteConfigMarkAsProcessed(state,option);
+
+    if (!l && !force && !state->force_all) {
+        /* Option not used previously, and we are not forced to use it. */
+        sdsfree(line);
+        sdsfree(o);
+        return;
+    }
+
+    if (l) {
+        listNode *ln = listFirst(l);
+        int linenum = (long) ln->value;
+
+        /* There are still lines in the old configuration file we can reuse
+         * for this option. Replace the line with the new one. */
+        listDelNode(l,ln);
+        if (listLength(l) == 0) dictDelete(state->option_to_line,o);
+        sdsfree(state->lines[linenum]);
+        state->lines[linenum] = line;
+    } else {
+        /* Append a new line. */
+        if (!state->has_tail) {
+            rewriteConfigAppendLine(state,
+                sdsnew(REDIS_CONFIG_REWRITE_SIGNATURE));
+            state->has_tail = 1;
+        }
+        rewriteConfigAppendLine(state,line);
+    }
+    sdsfree(o);
+}
+
+/* Write the long long 'bytes' value as a string in a way that is parsable
+ * inside redis.conf. If possible uses the GB, MB, KB notation. */
+int rewriteConfigFormatMemory(char *buf, size_t len, long long bytes) {
+    int gb = 1024*1024*1024;
+    int mb = 1024*1024;
+    int kb = 1024;
+
+    if (bytes && (bytes % gb) == 0) {
+        return snprintf(buf,len,"%lldgb",bytes/gb);
+    } else if (bytes && (bytes % mb) == 0) {
+        return snprintf(buf,len,"%lldmb",bytes/mb);
+    } else if (bytes && (bytes % kb) == 0) {
+        return snprintf(buf,len,"%lldkb",bytes/kb);
+    } else {
+        return snprintf(buf,len,"%lld",bytes);
+    }
+}
+
+/* Rewrite a simple "option-name <bytes>" configuration option. */
+void rewriteConfigBytesOption(struct rewriteConfigState *state, const char *option, long long value, long long defvalue) {
+    char buf[64];
+    int force = value != defvalue;
+    sds line;
+
+    rewriteConfigFormatMemory(buf,sizeof(buf),value);
+    line = sdscatprintf(sdsempty(),"%s %s",option,buf);
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite a yes/no option. */
+void rewriteConfigYesNoOption(struct rewriteConfigState *state, const char *option, int value, int defvalue) {
+    int force = value != defvalue;
+    sds line = sdscatprintf(sdsempty(),"%s %s",option,
+        value ? "yes" : "no");
+
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite a string option. */
+void rewriteConfigStringOption(struct rewriteConfigState *state, const char *option, char *value, const char *defvalue) {
+    int force = 1;
+    sds line;
+
+    /* String options set to NULL need to be not present at all in the
+     * configuration file to be set to NULL again at the next reboot. */
+    if (value == NULL) {
+        rewriteConfigMarkAsProcessed(state,option);
+        return;
+    }
+
+    /* Set force to zero if the value is set to its default. */
+    if (defvalue && strcmp(value,defvalue) == 0) force = 0;
+
+    line = sdsnew(option);
+    line = sdscatlen(line, " ", 1);
+    line = sdscatrepr(line, value, strlen(value));
+
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite a SDS string option. */
+void rewriteConfigSdsOption(struct rewriteConfigState *state, const char *option, sds value, const sds defvalue) {
+    int force = 1;
+    sds line;
+
+    /* If there is no value set, we don't want the SDS option
+     * to be present in the configuration at all. */
+    if (value == NULL) {
+        rewriteConfigMarkAsProcessed(state, option);
+        return;
+    }
+
+    /* Set force to zero if the value is set to its default. */
+    if (defvalue && sdscmp(value, defvalue) == 0) force = 0;
+
+    line = sdsnew(option);
+    line = sdscatlen(line, " ", 1);
+    line = sdscatrepr(line, value, sdslen(value));
+
+    rewriteConfigRewriteLine(state, option, line, force);
+}
+
+/* Rewrite a numerical (long long range) option. */
+void rewriteConfigNumericalOption(struct rewriteConfigState *state, const char *option, long long value, long long defvalue) {
+    int force = value != defvalue;
+    sds line = sdscatprintf(sdsempty(),"%s %lld",option,value);
+
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite an octal option. */
+void rewriteConfigOctalOption(struct rewriteConfigState *state, char *option, int value, int defvalue) {
+    int force = value != defvalue;
+    sds line = sdscatprintf(sdsempty(),"%s %o",option,value);
+
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite an enumeration option. It takes as usually state and option name,
+ * and in addition the enumeration array and the default value for the
+ * option. */
+void rewriteConfigEnumOption(struct rewriteConfigState *state, const char *option, int value, configEnum *ce, int defval) {
+    sds line;
+    const char *name = configEnumGetNameOrUnknown(ce,value);
+    int force = value != defval;
+
+    line = sdscatprintf(sdsempty(),"%s %s",option,name);
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite the save option. */
+void rewriteConfigSaveOption(struct rewriteConfigState *state) {
+    int j;
+    sds line;
+
+    /* In Sentinel mode we don't need to rewrite the save parameters */
+    if (server.sentinel_mode) {
+        rewriteConfigMarkAsProcessed(state,"save");
+        return;
+    }
+
+    /* Rewrite save parameters, or an empty 'save ""' line to avoid the
+     * defaults from being used.
+     */
+    if (!server.saveparamslen) {
+        rewriteConfigRewriteLine(state,"save",sdsnew("save \"\""),1);
+    } else {
+        for (j = 0; j < server.saveparamslen; j++) {
+            line = sdscatprintf(sdsempty(),"save %ld %d",
+                (long) server.saveparams[j].seconds, server.saveparams[j].changes);
+            rewriteConfigRewriteLine(state,"save",line,1);
+        }
+    }
+
+    /* Mark "save" as processed in case server.saveparamslen is zero. */
+    rewriteConfigMarkAsProcessed(state,"save");
+}
+
+/* Rewrite the user option. */
+void rewriteConfigUserOption(struct rewriteConfigState *state) {
+    /* If there is a user file defined we just mark this configuration
+     * directive as processed, so that all the lines containing users
+     * inside the config file gets discarded. */
+    if (server.acl_filename[0] != '\0') {
+        rewriteConfigMarkAsProcessed(state,"user");
+        return;
+    }
+
+    /* Otherwise scan the list of users and rewrite every line. Note that
+     * in case the list here is empty, the effect will just be to comment
+     * all the users directive inside the config file. */
+    raxIterator ri;
+    raxStart(&ri,Users);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        user *u = ri.data;
+        sds line = sdsnew("user ");
+        line = sdscatsds(line,u->name);
+        line = sdscatlen(line," ",1);
+        sds descr = ACLDescribeUser(u);
+        line = sdscatsds(line,descr);
+        sdsfree(descr);
+        rewriteConfigRewriteLine(state,"user",line,1);
+    }
+    raxStop(&ri);
+
+    /* Mark "user" as processed in case there are no defined users. */
+    rewriteConfigMarkAsProcessed(state,"user");
+}
+
+/* Rewrite the dir option, always using absolute paths.*/
+void rewriteConfigDirOption(struct rewriteConfigState *state) {
+    char cwd[1024];
+
+    if (getcwd(cwd,sizeof(cwd)) == NULL) {
+        rewriteConfigMarkAsProcessed(state,"dir");
+        return; /* no rewrite on error. */
+    }
+    rewriteConfigStringOption(state,"dir",cwd,NULL);
+}
+
+/* Rewrite the slaveof option. */
+void rewriteConfigSlaveofOption(struct rewriteConfigState *state, char *option) {
+    sds line;
+
+    /* If this is a master, we want all the slaveof config options
+     * in the file to be removed. Note that if this is a cluster instance
+     * we don't want a slaveof directive inside redis.conf. */
+    if (server.cluster_enabled || server.masterhost == NULL) {
+        rewriteConfigMarkAsProcessed(state,option);
+        return;
+    }
+    line = sdscatprintf(sdsempty(),"%s %s %d", option,
+        server.masterhost, server.masterport);
+    rewriteConfigRewriteLine(state,option,line,1);
+}
+
+/* Rewrite the notify-keyspace-events option. */
+void rewriteConfigNotifykeyspaceeventsOption(struct rewriteConfigState *state) {
+    int force = server.notify_keyspace_events != 0;
+    char *option = "notify-keyspace-events";
+    sds line, flags;
+
+    flags = keyspaceEventsFlagsToString(server.notify_keyspace_events);
+    line = sdsnew(option);
+    line = sdscatlen(line, " ", 1);
+    line = sdscatrepr(line, flags, sdslen(flags));
+    sdsfree(flags);
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite the client-output-buffer-limit option. */
+void rewriteConfigClientoutputbufferlimitOption(struct rewriteConfigState *state) {
+    int j;
+    char *option = "client-output-buffer-limit";
+
+    for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++) {
+        int force = (server.client_obuf_limits[j].hard_limit_bytes !=
+                    clientBufferLimitsDefaults[j].hard_limit_bytes) ||
+                    (server.client_obuf_limits[j].soft_limit_bytes !=
+                    clientBufferLimitsDefaults[j].soft_limit_bytes) ||
+                    (server.client_obuf_limits[j].soft_limit_seconds !=
+                    clientBufferLimitsDefaults[j].soft_limit_seconds);
+        sds line;
+        char hard[64], soft[64];
+
+        rewriteConfigFormatMemory(hard,sizeof(hard),
+                server.client_obuf_limits[j].hard_limit_bytes);
+        rewriteConfigFormatMemory(soft,sizeof(soft),
+                server.client_obuf_limits[j].soft_limit_bytes);
+
+        char *typename = getClientTypeName(j);
+        if (!strcmp(typename,"slave")) typename = "replica";
+        line = sdscatprintf(sdsempty(),"%s %s %s %s %ld",
+                option, typename, hard, soft,
+                (long) server.client_obuf_limits[j].soft_limit_seconds);
+        rewriteConfigRewriteLine(state,option,line,force);
+    }
+}
+
+/* Rewrite the oom-score-adj-values option. */
+void rewriteConfigOOMScoreAdjValuesOption(struct rewriteConfigState *state) {
+    int force = 0;
+    int j;
+    char *option = "oom-score-adj-values";
+    sds line;
+
+    line = sdsnew(option);
+    line = sdscatlen(line, " ", 1);
+    for (j = 0; j < CONFIG_OOM_COUNT; j++) {
+        if (server.oom_score_adj_values[j] != configOOMScoreAdjValuesDefaults[j])
+            force = 1;
+
+        line = sdscatprintf(line, "%d", server.oom_score_adj_values[j]);
+        if (j+1 != CONFIG_OOM_COUNT)
+            line = sdscatlen(line, " ", 1);
+    }
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Rewrite the bind option. */
+void rewriteConfigBindOption(struct rewriteConfigState *state) {
+    int force = 1;
+    sds line, addresses;
+    char *option = "bind";
+
+    /* Nothing to rewrite if we don't have bind addresses. */
+    if (server.bindaddr_count == 0) {
+        rewriteConfigMarkAsProcessed(state,option);
+        return;
+    }
+
+    /* Rewrite as bind <addr1> <addr2> ... <addrN> */
+    addresses = sdsjoin(server.bindaddr,server.bindaddr_count," ");
+    line = sdsnew(option);
+    line = sdscatlen(line, " ", 1);
+    line = sdscatsds(line, addresses);
+    sdsfree(addresses);
+
+    rewriteConfigRewriteLine(state,option,line,force);
+}
+
+/* Glue together the configuration lines in the current configuration
+ * rewrite state into a single string, stripping multiple empty lines. */
+sds rewriteConfigGetContentFromState(struct rewriteConfigState *state) {
+    sds content = sdsempty();
+    int j, was_empty = 0;
+
+    for (j = 0; j < state->numlines; j++) {
+        /* Every cluster of empty lines is turned into a single empty line. */
+        if (sdslen(state->lines[j]) == 0) {
+            if (was_empty) continue;
+            was_empty = 1;
+        } else {
+            was_empty = 0;
+        }
+        content = sdscatsds(content,state->lines[j]);
+        content = sdscatlen(content,"\n",1);
+    }
+    return content;
+}
+
+/* Free the configuration rewrite state. */
+void rewriteConfigReleaseState(struct rewriteConfigState *state) {
+    sdsfreesplitres(state->lines,state->numlines);
+    dictRelease(state->option_to_line);
+    dictRelease(state->rewritten);
+    zfree(state);
+}
+
+/* At the end of the rewrite process the state contains the remaining
+ * map between "option name" => "lines in the original config file".
+ * Lines used by the rewrite process were removed by the function
+ * rewriteConfigRewriteLine(), all the other lines are "orphaned" and
+ * should be replaced by empty lines.
+ *
+ * This function does just this, iterating all the option names and
+ * blanking all the lines still associated. */
+void rewriteConfigRemoveOrphaned(struct rewriteConfigState *state) {
+    dictIterator *di = dictGetIterator(state->option_to_line);
+    dictEntry *de;
+
+    while((de = dictNext(di)) != NULL) {
+        list *l = dictGetVal(de);
+        sds option = dictGetKey(de);
+
+        /* Don't blank lines about options the rewrite process
+         * don't understand. */
+        if (dictFind(state->rewritten,option) == NULL) {
+            serverLog(LL_DEBUG,"Not rewritten option: %s", option);
+            continue;
+        }
+
+        while(listLength(l)) {
+            listNode *ln = listFirst(l);
+            int linenum = (long) ln->value;
+
+            sdsfree(state->lines[linenum]);
+            state->lines[linenum] = sdsempty();
+            listDelNode(l,ln);
+        }
+    }
+    dictReleaseIterator(di);
+}
+
+/* This function replaces the old configuration file with the new content
+ * in an atomic manner.
+ *
+ * The function returns 0 on success, otherwise -1 is returned and errno
+ * is set accordingly. */
+int rewriteConfigOverwriteFile(char *configfile, sds content) {
+    int fd = -1;
+    int retval = -1;
+    char tmp_conffile[PATH_MAX];
+    const char *tmp_suffix = ".XXXXXX";
+    size_t offset = 0;
+    ssize_t written_bytes = 0;
+
+    int tmp_path_len = snprintf(tmp_conffile, sizeof(tmp_conffile), "%s%s", configfile, tmp_suffix);
+    if (tmp_path_len <= 0 || (unsigned int)tmp_path_len >= sizeof(tmp_conffile)) {
+        serverLog(LL_WARNING, "Config file full path is too long");
+        errno = ENAMETOOLONG;
+        return retval;
+    }
+
+#ifdef _GNU_SOURCE
+    fd = mkostemp(tmp_conffile, O_CLOEXEC);
+#else
+    /* There's a theoretical chance here to leak the FD if a module thread forks & execv in the middle */
+    fd = mkstemp(tmp_conffile);
+#endif
+
+    if (fd == -1) {
+        serverLog(LL_WARNING, "Could not create tmp config file (%s)", strerror(errno));
+        return retval;
+    }
+
+    while (offset < sdslen(content)) {
+         written_bytes = write(fd, content + offset, sdslen(content) - offset);
+         if (written_bytes <= 0) {
+             if (errno == EINTR) continue; /* FD is blocking, no other retryable errors */
+             serverLog(LL_WARNING, "Failed after writing (%zd) bytes to tmp config file (%s)", offset, strerror(errno));
+             goto cleanup;
+         }
+         offset+=written_bytes;
+    }
+
+    if (fsync(fd))
+        serverLog(LL_WARNING, "Could not sync tmp config file to disk (%s)", strerror(errno));
+    else if (fchmod(fd, 0644 & ~server.umask) == -1)
+        serverLog(LL_WARNING, "Could not chmod config file (%s)", strerror(errno));
+    else if (rename(tmp_conffile, configfile) == -1)
+        serverLog(LL_WARNING, "Could not rename tmp config file (%s)", strerror(errno));
+    else {
+        retval = 0;
+        serverLog(LL_DEBUG, "Rewritten config file (%s) successfully", configfile);
+    }
+
+cleanup:
+    close(fd);
+    if (retval) unlink(tmp_conffile);
+    return retval;
+}
+
+/* Rewrite the configuration file at "path".
+ * If the configuration file already exists, we try at best to retain comments
+ * and overall structure.
+ *
+ * Configuration parameters that are at their default value, unless already
+ * explicitly included in the old configuration file, are not rewritten.
+ * The force_all flag overrides this behavior and forces everything to be
+ * written. This is currently only used for testing purposes.
+ *
+ * On error -1 is returned and errno is set accordingly, otherwise 0. */
+int rewriteConfig(char *path, int force_all) {
+    struct rewriteConfigState *state;
+    sds newcontent;
+    int retval;
+
+    /* Step 1: read the old config into our rewrite state. */
+    if ((state = rewriteConfigReadOldFile(path)) == NULL) return -1;
+    if (force_all) state->force_all = 1;
+
+    /* Step 2: rewrite every single option, replacing or appending it inside
+     * the rewrite state. */
+
+    /* Iterate the configs that are standard */
+    for (standardConfig *config = configs; config->name != NULL; config++) {
+        config->interface.rewrite(config->data, config->name, state);
+    }
+
+    rewriteConfigBindOption(state);
+    rewriteConfigOctalOption(state,"unixsocketperm",server.unixsocketperm,CONFIG_DEFAULT_UNIX_SOCKET_PERM);
+    rewriteConfigStringOption(state,"logfile",server.logfile,CONFIG_DEFAULT_LOGFILE);
+    rewriteConfigSaveOption(state);
+    rewriteConfigUserOption(state);
+    rewriteConfigDirOption(state);
+    rewriteConfigSlaveofOption(state,"replicaof");
+    rewriteConfigStringOption(state,"cluster-config-file",server.cluster_configfile,CONFIG_DEFAULT_CLUSTER_CONFIG_FILE);
+    rewriteConfigNotifykeyspaceeventsOption(state);
+    rewriteConfigClientoutputbufferlimitOption(state);
+    rewriteConfigOOMScoreAdjValuesOption(state);
+
+    /* Rewrite Sentinel config if in Sentinel mode. */
+    if (server.sentinel_mode) rewriteConfigSentinelOption(state);
+
+    /* Step 3: remove all the orphaned lines in the old file, that is, lines
+     * that were used by a config option and are no longer used, like in case
+     * of multiple "save" options or duplicated options. */
+    rewriteConfigRemoveOrphaned(state);
+
+    /* Step 4: generate a new configuration file from the modified state
+     * and write it into the original file. */
+    newcontent = rewriteConfigGetContentFromState(state);
+    retval = rewriteConfigOverwriteFile(server.configfile,newcontent);
+
+    sdsfree(newcontent);
+    rewriteConfigReleaseState(state);
+    return retval;
+}
+
+/*-----------------------------------------------------------------------------
+ * Configs that fit one of the major types and require no special handling
+ *----------------------------------------------------------------------------*/
+#define LOADBUF_SIZE 256
+static char loadbuf[LOADBUF_SIZE];
+
+#define embedCommonConfig(config_name, config_alias, config_flags) \
+    .name = (config_name), \
+    .alias = (config_alias), \
+    .flags = (config_flags),
+
+#define embedConfigInterface(initfn, setfn, getfn, rewritefn) .interface = { \
+    .init = (initfn), \
+    .set = (setfn), \
+    .get = (getfn), \
+    .rewrite = (rewritefn) \
+},
+
+/* What follows is the generic config types that are supported. To add a new
+ * config with one of these types, add it to the standardConfig table with
+ * the creation macro for each type.
+ *
+ * Each type contains the following:
+ * * A function defining how to load this type on startup.
+ * * A function defining how to update this type on CONFIG SET.
+ * * A function defining how to serialize this type on CONFIG SET.
+ * * A function defining how to rewrite this type on CONFIG REWRITE.
+ * * A Macro defining how to create this type.
+ */
+
+/* Bool Configs */
+static void boolConfigInit(typeData data) {
+    *data.yesno.config = data.yesno.default_value;
+}
+
+static int boolConfigSet(typeData data, sds value, int update, const char **err) {
+    int yn = yesnotoi(value);
+    if (yn == -1) {
+        *err = "argument must be 'yes' or 'no'";
+        return 0;
+    }
+    if (data.yesno.is_valid_fn && !data.yesno.is_valid_fn(yn, err))
+        return 0;
+    int prev = *(data.yesno.config);
+    *(data.yesno.config) = yn;
+    if (update && data.yesno.update_fn && !data.yesno.update_fn(yn, prev, err)) {
+        *(data.yesno.config) = prev;
+        return 0;
+    }
+    return 1;
+}
+
+static void boolConfigGet(client *c, typeData data) {
+    addReplyBulkCString(c, *data.yesno.config ? "yes" : "no");
+}
+
+static void boolConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
+    rewriteConfigYesNoOption(state, name,*(data.yesno.config), data.yesno.default_value);
+}
+
+#define createBoolConfig(name, alias, flags, config_addr, default, is_valid, update) { \
+    embedCommonConfig(name, alias, flags) \
+    embedConfigInterface(boolConfigInit, boolConfigSet, boolConfigGet, boolConfigRewrite) \
+    .data.yesno = { \
+        .config = &(config_addr), \
+        .default_value = (default), \
+        .is_valid_fn = (is_valid), \
+        .update_fn = (update), \
+    } \
+}
+
+/* String Configs */
+static void stringConfigInit(typeData data) {
+    *data.string.config = (data.string.convert_empty_to_null && !data.string.default_value) ? NULL : zstrdup(data.string.default_value);
+}
+
+static int stringConfigSet(typeData data, sds value, int update, const char **err) {
+    if (data.string.is_valid_fn && !data.string.is_valid_fn(value, err))
+        return 0;
+    char *prev = *data.string.config;
+    *data.string.config = (data.string.convert_empty_to_null && !value[0]) ? NULL : zstrdup(value);
+    if (update && data.string.update_fn && !data.string.update_fn(*data.string.config, prev, err)) {
+        zfree(*data.string.config);
+        *data.string.config = prev;
+        return 0;
+    }
+    zfree(prev);
+    return 1;
+}
+
+static void stringConfigGet(client *c, typeData data) {
+    addReplyBulkCString(c, *data.string.config ? *data.string.config : "");
+}
+
+static void stringConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
+    rewriteConfigStringOption(state, name,*(data.string.config), data.string.default_value);
+}
+
+/* SDS Configs */
+static void sdsConfigInit(typeData data) {
+    *data.sds.config = (data.sds.convert_empty_to_null && !data.sds.default_value) ? NULL: sdsnew(data.sds.default_value);
+}
+
+static int sdsConfigSet(typeData data, sds value, int update, const char **err) {
+    if (data.sds.is_valid_fn && !data.sds.is_valid_fn(value, err))
+        return 0;
+    sds prev = *data.sds.config;
+    *data.sds.config = (data.sds.convert_empty_to_null && (sdslen(value) == 0)) ? NULL : sdsdup(value);
+    if (update && data.sds.update_fn && !data.sds.update_fn(*data.sds.config, prev, err)) {
+        sdsfree(*data.sds.config);
+        *data.sds.config = prev;
+        return 0;
+    }
+    sdsfree(prev);
+    return 1;
+}
+
+static void sdsConfigGet(client *c, typeData data) {
+    if (*data.sds.config) {
+        addReplyBulkSds(c, sdsdup(*data.sds.config));
+    } else {
+        addReplyBulkCString(c, "");
+    }
+}
+
+static void sdsConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
+    rewriteConfigSdsOption(state, name, *(data.sds.config), data.sds.default_value ? sdsnew(data.sds.default_value) : NULL);
+}
+
+
+#define ALLOW_EMPTY_STRING 0
+#define EMPTY_STRING_IS_NULL 1
+
+#define createStringConfig(name, alias, flags, empty_to_null, config_addr, default, is_valid, update) { \
+    embedCommonConfig(name, alias, flags) \
+    embedConfigInterface(stringConfigInit, stringConfigSet, stringConfigGet, stringConfigRewrite) \
+    .data.string = { \
+        .config = &(config_addr), \
+        .default_value = (default), \
+        .is_valid_fn = (is_valid), \
+        .update_fn = (update), \
+        .convert_empty_to_null = (empty_to_null), \
+    } \
+}
+
+#define createSDSConfig(name, alias, flags, empty_to_null, config_addr, default, is_valid, update) { \
+    embedCommonConfig(name, alias, flags) \
+    embedConfigInterface(sdsConfigInit, sdsConfigSet, sdsConfigGet, sdsConfigRewrite) \
+    .data.sds = { \
+        .config = &(config_addr), \
+        .default_value = (default), \
+        .is_valid_fn = (is_valid), \
+        .update_fn = (update), \
+        .convert_empty_to_null = (empty_to_null), \
+    } \
+}
+
+/* Enum configs */
+static void enumConfigInit(typeData data) {
+    *data.enumd.config = data.enumd.default_value;
+}
+
+static int enumConfigSet(typeData data, sds value, int update, const char **err) {
+    int enumval = configEnumGetValue(data.enumd.enum_value, value);
+    if (enumval == INT_MIN) {
+        sds enumerr = sdsnew("argument must be one of the following: ");
+        configEnum *enumNode = data.enumd.enum_value;
+        while(enumNode->name != NULL) {
+            enumerr = sdscatlen(enumerr, enumNode->name,
+                                strlen(enumNode->name));
+            enumerr = sdscatlen(enumerr, ", ", 2);
+            enumNode++;
+        }
+        sdsrange(enumerr,0,-3); /* Remove final ", ". */
+
+        strncpy(loadbuf, enumerr, LOADBUF_SIZE);
+        loadbuf[LOADBUF_SIZE - 1] = '\0';
+
+        sdsfree(enumerr);
+        *err = loadbuf;
+        return 0;
+    }
+    if (data.enumd.is_valid_fn && !data.enumd.is_valid_fn(enumval, err))
+        return 0;
+    int prev = *(data.enumd.config);
+    *(data.enumd.config) = enumval;
+    if (update && data.enumd.update_fn && !data.enumd.update_fn(enumval, prev, err)) {
+        *(data.enumd.config) = prev;
+        return 0;
+    }
+    return 1;
+}
+
+static void enumConfigGet(client *c, typeData data) {
+    addReplyBulkCString(c, configEnumGetNameOrUnknown(data.enumd.enum_value,*data.enumd.config));
+}
+
+static void enumConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
+    rewriteConfigEnumOption(state, name,*(data.enumd.config), data.enumd.enum_value, data.enumd.default_value);
+}
+
+#define createEnumConfig(name, alias, flags, enum, config_addr, default, is_valid, update) { \
+    embedCommonConfig(name, alias, flags) \
+    embedConfigInterface(enumConfigInit, enumConfigSet, enumConfigGet, enumConfigRewrite) \
+    .data.enumd = { \
+        .config = &(config_addr), \
+        .default_value = (default), \
+        .is_valid_fn = (is_valid), \
+        .update_fn = (update), \
+        .enum_value = (enum), \
+    } \
+}
+
+/* Gets a 'long long val' and sets it into the union, using a macro to get
+ * compile time type check. */
+#define SET_NUMERIC_TYPE(val) \
+    if (data.numeric.numeric_type == NUMERIC_TYPE_INT) { \
+        *(data.numeric.config.i) = (int) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_UINT) { \
+        *(data.numeric.config.ui) = (unsigned int) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG) { \
+        *(data.numeric.config.l) = (long) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG) { \
+        *(data.numeric.config.ul) = (unsigned long) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG_LONG) { \
+        *(data.numeric.config.ll) = (long long) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG) { \
+        *(data.numeric.config.ull) = (unsigned long long) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) { \
+        *(data.numeric.config.st) = (size_t) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SSIZE_T) { \
+        *(data.numeric.config.sst) = (ssize_t) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_OFF_T) { \
+        *(data.numeric.config.ot) = (off_t) val; \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_TIME_T) { \
+        *(data.numeric.config.tt) = (time_t) val; \
+    }
+
+/* Gets a 'long long val' and sets it with the value from the union, using a
+ * macro to get compile time type check. */
+#define GET_NUMERIC_TYPE(val) \
+    if (data.numeric.numeric_type == NUMERIC_TYPE_INT) { \
+        val = *(data.numeric.config.i); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_UINT) { \
+        val = *(data.numeric.config.ui); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG) { \
+        val = *(data.numeric.config.l); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG) { \
+        val = *(data.numeric.config.ul); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG_LONG) { \
+        val = *(data.numeric.config.ll); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG) { \
+        val = *(data.numeric.config.ull); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) { \
+        val = *(data.numeric.config.st); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SSIZE_T) { \
+        val = *(data.numeric.config.sst); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_OFF_T) { \
+        val = *(data.numeric.config.ot); \
+    } else if (data.numeric.numeric_type == NUMERIC_TYPE_TIME_T) { \
+        val = *(data.numeric.config.tt); \
+    }
+
+/* Numeric configs */
+static void numericConfigInit(typeData data) {
+    SET_NUMERIC_TYPE(data.numeric.default_value)
+}
+
+static int numericBoundaryCheck(typeData data, long long ll, const char **err) {
+    if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG ||
+        data.numeric.numeric_type == NUMERIC_TYPE_UINT ||
+        data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) {
+        /* Boundary check for unsigned types */
+        unsigned long long ull = ll;
+        unsigned long long upper_bound = data.numeric.upper_bound;
+        unsigned long long lower_bound = data.numeric.lower_bound;
+        if (ull > upper_bound || ull < lower_bound) {
+            snprintf(loadbuf, LOADBUF_SIZE,
+                "argument must be between %llu and %llu inclusive",
+                lower_bound,
+                upper_bound);
+            *err = loadbuf;
+            return 0;
+        }
+    } else {
+        /* Boundary check for signed types */
+        if (ll > data.numeric.upper_bound || ll < data.numeric.lower_bound) {
+            snprintf(loadbuf, LOADBUF_SIZE,
+                "argument must be between %lld and %lld inclusive",
+                data.numeric.lower_bound,
+                data.numeric.upper_bound);
+            *err = loadbuf;
+            return 0;
+        }
+    }
+    return 1;
+}
+
+static int numericConfigSet(typeData data, sds value, int update, const char **err) {
+    long long ll, prev = 0;
+    if (data.numeric.is_memory) {
+        int memerr;
+        ll = memtoll(value, &memerr);
+        if (memerr || ll < 0) {
+            *err = "argument must be a memory value";
+            return 0;
+        }
+    } else {
+        if (!string2ll(value, sdslen(value),&ll)) {
+            *err = "argument couldn't be parsed into an integer" ;
+            return 0;
+        }
+    }
+
+    if (!numericBoundaryCheck(data, ll, err))
+        return 0;
+
+    if (data.numeric.is_valid_fn && !data.numeric.is_valid_fn(ll, err))
+        return 0;
+
+    GET_NUMERIC_TYPE(prev)
+    SET_NUMERIC_TYPE(ll)
+
+    if (update && data.numeric.update_fn && !data.numeric.update_fn(ll, prev, err)) {
+        SET_NUMERIC_TYPE(prev)
+        return 0;
+    }
+    return 1;
+}
+
+static void numericConfigGet(client *c, typeData data) {
+    char buf[128];
+    long long value = 0;
+
+    GET_NUMERIC_TYPE(value)
+
+    ll2string(buf, sizeof(buf), value);
+    addReplyBulkCString(c, buf);
+}
+
+static void numericConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
+    long long value = 0;
+
+    GET_NUMERIC_TYPE(value)
+
+    if (data.numeric.is_memory) {
+        rewriteConfigBytesOption(state, name, value, data.numeric.default_value);
+    } else {
+        rewriteConfigNumericalOption(state, name, value, data.numeric.default_value);
+    }
+}
+
+#define INTEGER_CONFIG 0
+#define MEMORY_CONFIG 1
+
+#define embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) { \
+    embedCommonConfig(name, alias, flags) \
+    embedConfigInterface(numericConfigInit, numericConfigSet, numericConfigGet, numericConfigRewrite) \
+    .data.numeric = { \
+        .lower_bound = (lower), \
+        .upper_bound = (upper), \
+        .default_value = (default), \
+        .is_valid_fn = (is_valid), \
+        .update_fn = (update), \
+        .is_memory = (memory),
+
+#define createIntConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_INT, \
+        .config.i = &(config_addr) \
+    } \
+}
+
+#define createUIntConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_UINT, \
+        .config.ui = &(config_addr) \
+    } \
+}
+
+#define createLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_LONG, \
+        .config.l = &(config_addr) \
+    } \
+}
+
+#define createULongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_ULONG, \
+        .config.ul = &(config_addr) \
+    } \
+}
+
+#define createLongLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_LONG_LONG, \
+        .config.ll = &(config_addr) \
+    } \
+}
+
+#define createULongLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_ULONG_LONG, \
+        .config.ull = &(config_addr) \
+    } \
+}
+
+#define createSizeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_SIZE_T, \
+        .config.st = &(config_addr) \
+    } \
+}
+
+#define createSSizeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_SSIZE_T, \
+        .config.sst = &(config_addr) \
+    } \
+}
+
+#define createTimeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_TIME_T, \
+        .config.tt = &(config_addr) \
+    } \
+}
+
+#define createOffTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
+        .numeric_type = NUMERIC_TYPE_OFF_T, \
+        .config.ot = &(config_addr) \
+    } \
+}
+
+static int isValidActiveDefrag(int val, const char **err) {
+#ifndef HAVE_DEFRAG
+    if (val) {
+        *err = "Active defragmentation cannot be enabled: it "
+               "requires a Redis server compiled with a modified Jemalloc "
+               "like the one shipped by default with the Redis source "
+               "distribution";
+        return 0;
+    }
+#else
+    UNUSED(val);
+    UNUSED(err);
+#endif
+    return 1;
+}
+
+static int isValidDBfilename(char *val, const char **err) {
+    if (!pathIsBaseName(val)) {
+        *err = "dbfilename can't be a path, just a filename";
+        return 0;
+    }
+    return 1;
+}
+
+static int isValidAOFfilename(char *val, const char **err) {
+    if (!pathIsBaseName(val)) {
+        *err = "appendfilename can't be a path, just a filename";
+        return 0;
+    }
+    return 1;
+}
+
+/* Validate specified string is a valid proc-title-template */
+static int isValidProcTitleTemplate(char *val, const char **err) {
+    if (!validateProcTitleTemplate(val)) {
+        *err = "template format is invalid or contains unknown variables";
+        return 0;
+    }
+    return 1;
+}
+
+static int updateProcTitleTemplate(char *val, char *prev, const char **err) {
+    UNUSED(val);
+    UNUSED(prev);
+    if (redisSetProcTitle(NULL) == C_ERR) {
+        *err = "failed to set process title";
+        return 0;
+    }
+    return 1;
+}
+
+static int updateHZ(long long val, long long prev, const char **err) {
+    UNUSED(prev);
+    UNUSED(err);
+    /* Hz is more a hint from the user, so we accept values out of range
+     * but cap them to reasonable values. */
+    server.config_hz = val;
+    if (server.config_hz < CONFIG_MIN_HZ) server.config_hz = CONFIG_MIN_HZ;
+    if (server.config_hz > CONFIG_MAX_HZ) server.config_hz = CONFIG_MAX_HZ;
+    server.hz = server.config_hz;
+    return 1;
+}
+
+static int updatePort(long long val, long long prev, const char **err) {
+    /* Do nothing if port is unchanged */
+    if (val == prev) {
+        return 1;
+    }
+
+    if (changeListenPort(val, &server.ipfd, acceptTcpHandler) == C_ERR) {
+        *err = "Unable to listen on this port. Check server logs.";
+        return 0;
+    }
+
+    return 1;
+}
+
+static int updateJemallocBgThread(int val, int prev, const char **err) {
+    UNUSED(prev);
+    UNUSED(err);
+    set_jemalloc_bg_thread(val);
+    return 1;
+}
+
+static int updateReplBacklogSize(long long val, long long prev, const char **err) {
+    /* resizeReplicationBacklog sets server.repl_backlog_size, and relies on
+     * being able to tell when the size changes, so restore prev before calling it. */
+    UNUSED(err);
+    server.repl_backlog_size = prev;
+    resizeReplicationBacklog(val);
+    return 1;
+}
+
+static int updateMaxmemory(long long val, long long prev, const char **err) {
+    UNUSED(prev);
+    UNUSED(err);
+    if (val) {
+        size_t used = zmalloc_used_memory()-freeMemoryGetNotCountedMemory();
+        if ((unsigned long long)val < used) {
+            serverLog(LL_WARNING,"WARNING: the new maxmemory value set via CONFIG SET (%llu) is smaller than the current memory usage (%zu). This will result in key eviction and/or the inability to accept new write commands depending on the maxmemory-policy.", server.maxmemory, used);
+        }
+        performEvictions();
+    }
+    return 1;
+}
+
+static int updateGoodSlaves(long long val, long long prev, const char **err) {
+    UNUSED(val);
+    UNUSED(prev);
+    UNUSED(err);
+    refreshGoodSlavesCount();
+    return 1;
+}
+
+static int updateAppendonly(int val, int prev, const char **err) {
+    UNUSED(prev);
+    if (val == 0 && server.aof_state != AOF_OFF) {
+        stopAppendOnly();
+    } else if (val && server.aof_state == AOF_OFF) {
+        if (startAppendOnly() == C_ERR) {
+            *err = "Unable to turn on AOF. Check server logs.";
+            return 0;
+        }
+    }
+    return 1;
+}
+
+static int updateSighandlerEnabled(int val, int prev, const char **err) {
+    UNUSED(err);
+    UNUSED(prev);
+    if (val)
+        setupSignalHandlers();
+    else
+        removeSignalHandlers();
+    return 1;
+}
+
+static int updateMaxclients(long long val, long long prev, const char **err) {
+    /* Try to check if the OS is capable of supporting so many FDs. */
+    if (val > prev) {
+        adjustOpenFilesLimit();
+        if (server.maxclients != val) {
+            static char msg[128];
+            sprintf(msg, "The operating system is not able to handle the specified number of clients, try with %d", server.maxclients);
+            *err = msg;
+            if (server.maxclients > prev) {
+                server.maxclients = prev;
+                adjustOpenFilesLimit();
+            }
+            return 0;
+        }
+        if ((unsigned int) aeGetSetSize(server.el) <
+            server.maxclients + CONFIG_FDSET_INCR)
+        {
+            if (aeResizeSetSize(server.el,
+                server.maxclients + CONFIG_FDSET_INCR) == AE_ERR)
+            {
+                *err = "The event loop API used by Redis is not able to handle the specified number of clients";
+                return 0;
+            }
+        }
+    }
+    return 1;
+}
+
+static int updateOOMScoreAdj(int val, int prev, const char **err) {
+    UNUSED(prev);
+
+    if (val) {
+        if (setOOMScoreAdj(-1) == C_ERR) {
+            *err = "Failed to set current oom_score_adj. Check server logs.";
+            return 0;
+        }
+    }
+
+    return 1;
+}
+
+
+int updateRequirePass(sds val, sds prev, const char **err) {
+    UNUSED(prev);
+    UNUSED(err);
+    /* The old "requirepass" directive just translates to setting
+     * a password to the default user. The only thing we do
+     * additionally is to remember the cleartext password in this
+     * case, for backward compatibility with Redis <= 5. */
+    ACLUpdateDefaultUserPassword(val);
+    return 1;
+}
+
+#ifdef USE_OPENSSL
+static int updateTlsCfg(char *val, char *prev, const char **err) {
+    UNUSED(val);
+    UNUSED(prev);
+    UNUSED(err);
+
+    /* If TLS is enabled, try to configure OpenSSL. */
+    if ((server.tls_port || server.tls_replication || server.tls_cluster)
+            && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
+        *err = "Unable to update TLS configuration. Check server logs.";
+        return 0;
+    }
+    return 1;
+}
+static int updateTlsCfgBool(int val, int prev, const char **err) {
+    UNUSED(val);
+    UNUSED(prev);
+    return updateTlsCfg(NULL, NULL, err);
+}
+
+static int updateTlsCfgInt(long long val, long long prev, const char **err) {
+    UNUSED(val);
+    UNUSED(prev);
+    return updateTlsCfg(NULL, NULL, err);
+}
+
+static int updateTLSPort(long long val, long long prev, const char **err) {
+    /* Do nothing if port is unchanged */
+    if (val == prev) {
+        return 1;
+    }
+
+    /* Configure TLS if tls is enabled */
+    if (prev == 0 && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
+        *err = "Unable to update TLS configuration. Check server logs.";
+        return 0;
+    }
+
+    if (changeListenPort(val, &server.tlsfd, acceptTLSHandler) == C_ERR) {
+        *err = "Unable to listen on this port. Check server logs.";
+        return 0;
+    }
+
+    return 1;
+}
+
+#endif  /* USE_OPENSSL */
+
+standardConfig configs[] = {
+    /* Bool configs */
+    createBoolConfig("rdbchecksum", NULL, IMMUTABLE_CONFIG, server.rdb_checksum, 1, NULL, NULL),
+    createBoolConfig("daemonize", NULL, IMMUTABLE_CONFIG, server.daemonize, 0, NULL, NULL),
+    createBoolConfig("io-threads-do-reads", NULL, IMMUTABLE_CONFIG, server.io_threads_do_reads, 0,NULL, NULL), /* Read + parse from threads? */
+    createBoolConfig("lua-replicate-commands", NULL, MODIFIABLE_CONFIG, server.lua_always_replicate_commands, 1, NULL, NULL),
+    createBoolConfig("always-show-logo", NULL, IMMUTABLE_CONFIG, server.always_show_logo, 0, NULL, NULL),
+    createBoolConfig("protected-mode", NULL, MODIFIABLE_CONFIG, server.protected_mode, 1, NULL, NULL),
+    createBoolConfig("rdbcompression", NULL, MODIFIABLE_CONFIG, server.rdb_compression, 1, NULL, NULL),
+    createBoolConfig("rdb-del-sync-files", NULL, MODIFIABLE_CONFIG, server.rdb_del_sync_files, 0, NULL, NULL),
+    createBoolConfig("activerehashing", NULL, MODIFIABLE_CONFIG, server.activerehashing, 1, NULL, NULL),
+    createBoolConfig("stop-writes-on-bgsave-error", NULL, MODIFIABLE_CONFIG, server.stop_writes_on_bgsave_err, 1, NULL, NULL),
+    createBoolConfig("set-proc-title", NULL, IMMUTABLE_CONFIG, server.set_proc_title, 1, NULL, NULL), /* Should setproctitle be used? */
+    createBoolConfig("dynamic-hz", NULL, MODIFIABLE_CONFIG, server.dynamic_hz, 1, NULL, NULL), /* Adapt hz to # of clients.*/
+    createBoolConfig("lazyfree-lazy-eviction", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_eviction, 0, NULL, NULL),
+    createBoolConfig("lazyfree-lazy-expire", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_expire, 0, NULL, NULL),
+    createBoolConfig("lazyfree-lazy-server-del", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_server_del, 0, NULL, NULL),
+    createBoolConfig("lazyfree-lazy-user-del", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_user_del , 0, NULL, NULL),
+    createBoolConfig("lazyfree-lazy-user-flush", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_user_flush , 0, NULL, NULL),
+    createBoolConfig("repl-disable-tcp-nodelay", NULL, MODIFIABLE_CONFIG, server.repl_disable_tcp_nodelay, 0, NULL, NULL),
+    createBoolConfig("repl-diskless-sync", NULL, MODIFIABLE_CONFIG, server.repl_diskless_sync, 0, NULL, NULL),
+    createBoolConfig("gopher-enabled", NULL, MODIFIABLE_CONFIG, server.gopher_enabled, 0, NULL, NULL),
+    createBoolConfig("aof-rewrite-incremental-fsync", NULL, MODIFIABLE_CONFIG, server.aof_rewrite_incremental_fsync, 1, NULL, NULL),
+    createBoolConfig("no-appendfsync-on-rewrite", NULL, MODIFIABLE_CONFIG, server.aof_no_fsync_on_rewrite, 0, NULL, NULL),
+    createBoolConfig("cluster-require-full-coverage", NULL, MODIFIABLE_CONFIG, server.cluster_require_full_coverage, 1, NULL, NULL),
+    createBoolConfig("rdb-save-incremental-fsync", NULL, MODIFIABLE_CONFIG, server.rdb_save_incremental_fsync, 1, NULL, NULL),
+    createBoolConfig("aof-load-truncated", NULL, MODIFIABLE_CONFIG, server.aof_load_truncated, 1, NULL, NULL),
+    createBoolConfig("aof-use-rdb-preamble", NULL, MODIFIABLE_CONFIG, server.aof_use_rdb_preamble, 1, NULL, NULL),
+    createBoolConfig("cluster-replica-no-failover", "cluster-slave-no-failover", MODIFIABLE_CONFIG, server.cluster_slave_no_failover, 0, NULL, NULL), /* Failover by default. */
+    createBoolConfig("replica-lazy-flush", "slave-lazy-flush", MODIFIABLE_CONFIG, server.repl_slave_lazy_flush, 0, NULL, NULL),
+    createBoolConfig("replica-serve-stale-data", "slave-serve-stale-data", MODIFIABLE_CONFIG, server.repl_serve_stale_data, 1, NULL, NULL),
+    createBoolConfig("replica-read-only", "slave-read-only", MODIFIABLE_CONFIG, server.repl_slave_ro, 1, NULL, NULL),
+    createBoolConfig("replica-ignore-maxmemory", "slave-ignore-maxmemory", MODIFIABLE_CONFIG, server.repl_slave_ignore_maxmemory, 1, NULL, NULL),
+    createBoolConfig("jemalloc-bg-thread", NULL, MODIFIABLE_CONFIG, server.jemalloc_bg_thread, 1, NULL, updateJemallocBgThread),
+    createBoolConfig("activedefrag", NULL, MODIFIABLE_CONFIG, server.active_defrag_enabled, 0, isValidActiveDefrag, NULL),
+    createBoolConfig("syslog-enabled", NULL, IMMUTABLE_CONFIG, server.syslog_enabled, 0, NULL, NULL),
+    createBoolConfig("cluster-enabled", NULL, IMMUTABLE_CONFIG, server.cluster_enabled, 0, NULL, NULL),
+    createBoolConfig("appendonly", NULL, MODIFIABLE_CONFIG, server.aof_enabled, 0, NULL, updateAppendonly),
+    createBoolConfig("cluster-allow-reads-when-down", NULL, MODIFIABLE_CONFIG, server.cluster_allow_reads_when_down, 0, NULL, NULL),
+    createBoolConfig("crash-log-enabled", NULL, MODIFIABLE_CONFIG, server.crashlog_enabled, 1, NULL, updateSighandlerEnabled),
+    createBoolConfig("crash-memcheck-enabled", NULL, MODIFIABLE_CONFIG, server.memcheck_enabled, 1, NULL, NULL),
+    createBoolConfig("use-exit-on-panic", NULL, MODIFIABLE_CONFIG, server.use_exit_on_panic, 0, NULL, NULL),
+    createBoolConfig("disable-thp", NULL, MODIFIABLE_CONFIG, server.disable_thp, 1, NULL, NULL),
+    createBoolConfig("cluster-allow-replica-migration", NULL, MODIFIABLE_CONFIG, server.cluster_allow_replica_migration, 1, NULL, NULL),
+    createBoolConfig("replica-announced", NULL, MODIFIABLE_CONFIG, server.replica_announced, 1, NULL, NULL),
+
+    /* String Configs */
+    createStringConfig("aclfile", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.acl_filename, "", NULL, NULL),
+    createStringConfig("unixsocket", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.unixsocket, NULL, NULL, NULL),
+    createStringConfig("pidfile", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.pidfile, NULL, NULL, NULL),
+    createStringConfig("replica-announce-ip", "slave-announce-ip", MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.slave_announce_ip, NULL, NULL, NULL),
+    createStringConfig("masteruser", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.masteruser, NULL, NULL, NULL),
+    createStringConfig("cluster-announce-ip", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.cluster_announce_ip, NULL, NULL, NULL),
+    createStringConfig("syslog-ident", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.syslog_ident, "redis", NULL, NULL),
+    createStringConfig("dbfilename", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.rdb_filename, "dump.rdb", isValidDBfilename, NULL),
+    createStringConfig("appendfilename", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.aof_filename, "appendonly.aof", isValidAOFfilename, NULL),
+    createStringConfig("server_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.server_cpulist, NULL, NULL, NULL),
+    createStringConfig("bio_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.bio_cpulist, NULL, NULL, NULL),
+    createStringConfig("aof_rewrite_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.aof_rewrite_cpulist, NULL, NULL, NULL),
+    createStringConfig("bgsave_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.bgsave_cpulist, NULL, NULL, NULL),
+    createStringConfig("ignore-warnings", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.ignore_warnings, "", NULL, NULL),
+    createStringConfig("proc-title-template", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.proc_title_template, CONFIG_DEFAULT_PROC_TITLE_TEMPLATE, isValidProcTitleTemplate, updateProcTitleTemplate),
+
+    /* SDS Configs */
+    createSDSConfig("masterauth", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.masterauth, NULL, NULL, NULL),
+    createSDSConfig("requirepass", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.requirepass, NULL, NULL, updateRequirePass),
+
+    /* Enum Configs */
+    createEnumConfig("supervised", NULL, IMMUTABLE_CONFIG, supervised_mode_enum, server.supervised_mode, SUPERVISED_NONE, NULL, NULL),
+    createEnumConfig("syslog-facility", NULL, IMMUTABLE_CONFIG, syslog_facility_enum, server.syslog_facility, LOG_LOCAL0, NULL, NULL),
+    createEnumConfig("repl-diskless-load", NULL, MODIFIABLE_CONFIG, repl_diskless_load_enum, server.repl_diskless_load, REPL_DISKLESS_LOAD_DISABLED, NULL, NULL),
+    createEnumConfig("loglevel", NULL, MODIFIABLE_CONFIG, loglevel_enum, server.verbosity, LL_NOTICE, NULL, NULL),
+    createEnumConfig("maxmemory-policy", NULL, MODIFIABLE_CONFIG, maxmemory_policy_enum, server.maxmemory_policy, MAXMEMORY_NO_EVICTION, NULL, NULL),
+    createEnumConfig("appendfsync", NULL, MODIFIABLE_CONFIG, aof_fsync_enum, server.aof_fsync, AOF_FSYNC_EVERYSEC, NULL, NULL),
+    createEnumConfig("oom-score-adj", NULL, MODIFIABLE_CONFIG, oom_score_adj_enum, server.oom_score_adj, OOM_SCORE_ADJ_NO, NULL, updateOOMScoreAdj),
+    createEnumConfig("acl-pubsub-default", NULL, MODIFIABLE_CONFIG, acl_pubsub_default_enum, server.acl_pubsub_default, USER_FLAG_ALLCHANNELS, NULL, NULL),
+    createEnumConfig("sanitize-dump-payload", NULL, MODIFIABLE_CONFIG, sanitize_dump_payload_enum, server.sanitize_dump_payload, SANITIZE_DUMP_NO, NULL, NULL),
+
+    /* Integer configs */
+    createIntConfig("databases", NULL, IMMUTABLE_CONFIG, 1, INT_MAX, server.dbnum, 16, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.port, 6379, INTEGER_CONFIG, NULL, updatePort), /* TCP port. */
+    createIntConfig("io-threads", NULL, IMMUTABLE_CONFIG, 1, 128, server.io_threads_num, 1, INTEGER_CONFIG, NULL, NULL), /* Single threaded by default */
+    createIntConfig("auto-aof-rewrite-percentage", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.aof_rewrite_perc, 100, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("cluster-replica-validity-factor", "cluster-slave-validity-factor", MODIFIABLE_CONFIG, 0, INT_MAX, server.cluster_slave_validity_factor, 10, INTEGER_CONFIG, NULL, NULL), /* Slave max data age factor. */
+    createIntConfig("list-max-ziplist-size", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.list_max_ziplist_size, -2, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("tcp-keepalive", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tcpkeepalive, 300, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("cluster-migration-barrier", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.cluster_migration_barrier, 1, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("active-defrag-cycle-min", NULL, MODIFIABLE_CONFIG, 1, 99, server.active_defrag_cycle_min, 1, INTEGER_CONFIG, NULL, NULL), /* Default: 1% CPU min (at lower threshold) */
+    createIntConfig("active-defrag-cycle-max", NULL, MODIFIABLE_CONFIG, 1, 99, server.active_defrag_cycle_max, 25, INTEGER_CONFIG, NULL, NULL), /* Default: 25% CPU max (at upper threshold) */
+    createIntConfig("active-defrag-threshold-lower", NULL, MODIFIABLE_CONFIG, 0, 1000, server.active_defrag_threshold_lower, 10, INTEGER_CONFIG, NULL, NULL), /* Default: don't defrag when fragmentation is below 10% */
+    createIntConfig("active-defrag-threshold-upper", NULL, MODIFIABLE_CONFIG, 0, 1000, server.active_defrag_threshold_upper, 100, INTEGER_CONFIG, NULL, NULL), /* Default: maximum defrag force at 100% fragmentation */
+    createIntConfig("lfu-log-factor", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.lfu_log_factor, 10, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("lfu-decay-time", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.lfu_decay_time, 1, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("replica-priority", "slave-priority", MODIFIABLE_CONFIG, 0, INT_MAX, server.slave_priority, 100, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("repl-diskless-sync-delay", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_diskless_sync_delay, 5, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("maxmemory-samples", NULL, MODIFIABLE_CONFIG, 1, INT_MAX, server.maxmemory_samples, 5, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("maxmemory-eviction-tenacity", NULL, MODIFIABLE_CONFIG, 0, 100, server.maxmemory_eviction_tenacity, 10, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("timeout", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.maxidletime, 0, INTEGER_CONFIG, NULL, NULL), /* Default client timeout: infinite */
+    createIntConfig("replica-announce-port", "slave-announce-port", MODIFIABLE_CONFIG, 0, 65535, server.slave_announce_port, 0, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("tcp-backlog", NULL, IMMUTABLE_CONFIG, 0, INT_MAX, server.tcp_backlog, 511, INTEGER_CONFIG, NULL, NULL), /* TCP listen backlog. */
+    createIntConfig("cluster-announce-bus-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_bus_port, 0, INTEGER_CONFIG, NULL, NULL), /* Default: Use +10000 offset. */
+    createIntConfig("cluster-announce-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_port, 0, INTEGER_CONFIG, NULL, NULL), /* Use server.port */
+    createIntConfig("cluster-announce-tls-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_tls_port, 0, INTEGER_CONFIG, NULL, NULL), /* Use server.tls_port */
+    createIntConfig("repl-timeout", NULL, MODIFIABLE_CONFIG, 1, INT_MAX, server.repl_timeout, 60, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("repl-ping-replica-period", "repl-ping-slave-period", MODIFIABLE_CONFIG, 1, INT_MAX, server.repl_ping_slave_period, 10, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("list-compress-depth", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.list_compress_depth, 0, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("rdb-key-save-delay", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.rdb_key_save_delay, 0, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("key-load-delay", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.key_load_delay, 0, INTEGER_CONFIG, NULL, NULL),
+    createIntConfig("active-expire-effort", NULL, MODIFIABLE_CONFIG, 1, 10, server.active_expire_effort, 1, INTEGER_CONFIG, NULL, NULL), /* From 1 to 10. */
+    createIntConfig("hz", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.config_hz, CONFIG_DEFAULT_HZ, INTEGER_CONFIG, NULL, updateHZ),
+    createIntConfig("min-replicas-to-write", "min-slaves-to-write", MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_min_slaves_to_write, 0, INTEGER_CONFIG, NULL, updateGoodSlaves),
+    createIntConfig("min-replicas-max-lag", "min-slaves-max-lag", MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_min_slaves_max_lag, 10, INTEGER_CONFIG, NULL, updateGoodSlaves),
+
+    /* Unsigned int configs */
+    createUIntConfig("maxclients", NULL, MODIFIABLE_CONFIG, 1, UINT_MAX, server.maxclients, 10000, INTEGER_CONFIG, NULL, updateMaxclients),
+
+    /* Unsigned Long configs */
+    createULongConfig("active-defrag-max-scan-fields", NULL, MODIFIABLE_CONFIG, 1, LONG_MAX, server.active_defrag_max_scan_fields, 1000, INTEGER_CONFIG, NULL, NULL), /* Default: keys with more than 1000 fields will be processed separately */
+    createULongConfig("slowlog-max-len", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.slowlog_max_len, 128, INTEGER_CONFIG, NULL, NULL),
+    createULongConfig("acllog-max-len", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.acllog_max_len, 128, INTEGER_CONFIG, NULL, NULL),
+
+    /* Long Long configs */
+    createLongLongConfig("lua-time-limit", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.lua_time_limit, 5000, INTEGER_CONFIG, NULL, NULL),/* milliseconds */
+    createLongLongConfig("cluster-node-timeout", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.cluster_node_timeout, 15000, INTEGER_CONFIG, NULL, NULL),
+    createLongLongConfig("slowlog-log-slower-than", NULL, MODIFIABLE_CONFIG, -1, LLONG_MAX, server.slowlog_log_slower_than, 10000, INTEGER_CONFIG, NULL, NULL),
+    createLongLongConfig("latency-monitor-threshold", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.latency_monitor_threshold, 0, INTEGER_CONFIG, NULL, NULL),
+    createLongLongConfig("proto-max-bulk-len", NULL, MODIFIABLE_CONFIG, 1024*1024, LONG_MAX, server.proto_max_bulk_len, 512ll*1024*1024, MEMORY_CONFIG, NULL, NULL), /* Bulk request max size */
+    createLongLongConfig("stream-node-max-entries", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.stream_node_max_entries, 100, INTEGER_CONFIG, NULL, NULL),
+    createLongLongConfig("repl-backlog-size", NULL, MODIFIABLE_CONFIG, 1, LLONG_MAX, server.repl_backlog_size, 1024*1024, MEMORY_CONFIG, NULL, updateReplBacklogSize), /* Default: 1mb */
+
+    /* Unsigned Long Long configs */
+    createULongLongConfig("maxmemory", NULL, MODIFIABLE_CONFIG, 0, ULLONG_MAX, server.maxmemory, 0, MEMORY_CONFIG, NULL, updateMaxmemory),
+
+    /* Size_t configs */
+    createSizeTConfig("hash-max-ziplist-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hash_max_ziplist_entries, 512, INTEGER_CONFIG, NULL, NULL),
+    createSizeTConfig("set-max-intset-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.set_max_intset_entries, 512, INTEGER_CONFIG, NULL, NULL),
+    createSizeTConfig("zset-max-ziplist-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.zset_max_ziplist_entries, 128, INTEGER_CONFIG, NULL, NULL),
+    createSizeTConfig("active-defrag-ignore-bytes", NULL, MODIFIABLE_CONFIG, 1, LLONG_MAX, server.active_defrag_ignore_bytes, 100<<20, MEMORY_CONFIG, NULL, NULL), /* Default: don't defrag if frag overhead is below 100mb */
+    createSizeTConfig("hash-max-ziplist-value", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hash_max_ziplist_value, 64, MEMORY_CONFIG, NULL, NULL),
+    createSizeTConfig("stream-node-max-bytes", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.stream_node_max_bytes, 4096, MEMORY_CONFIG, NULL, NULL),
+    createSizeTConfig("zset-max-ziplist-value", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.zset_max_ziplist_value, 64, MEMORY_CONFIG, NULL, NULL),
+    createSizeTConfig("hll-sparse-max-bytes", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hll_sparse_max_bytes, 3000, MEMORY_CONFIG, NULL, NULL),
+    createSizeTConfig("tracking-table-max-keys", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.tracking_table_max_keys, 1000000, INTEGER_CONFIG, NULL, NULL), /* Default: 1 million keys max. */
+    createSizeTConfig("client-query-buffer-limit", NULL, MODIFIABLE_CONFIG, 1024*1024, LONG_MAX, server.client_max_querybuf_len, 1024*1024*1024, MEMORY_CONFIG, NULL, NULL), /* Default: 1GB max query buffer. */
+
+    /* Other configs */
+    createTimeTConfig("repl-backlog-ttl", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.repl_backlog_time_limit, 60*60, INTEGER_CONFIG, NULL, NULL), /* Default: 1 hour */
+    createOffTConfig("auto-aof-rewrite-min-size", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.aof_rewrite_min_size, 64*1024*1024, MEMORY_CONFIG, NULL, NULL),
+
+#ifdef USE_OPENSSL
+    createIntConfig("tls-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.tls_port, 0, INTEGER_CONFIG, NULL, updateTLSPort), /* TCP port. */
+    createIntConfig("tls-session-cache-size", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tls_ctx_config.session_cache_size, 20*1024, INTEGER_CONFIG, NULL, updateTlsCfgInt),
+    createIntConfig("tls-session-cache-timeout", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tls_ctx_config.session_cache_timeout, 300, INTEGER_CONFIG, NULL, updateTlsCfgInt),
+    createBoolConfig("tls-cluster", NULL, MODIFIABLE_CONFIG, server.tls_cluster, 0, NULL, updateTlsCfgBool),
+    createBoolConfig("tls-replication", NULL, MODIFIABLE_CONFIG, server.tls_replication, 0, NULL, updateTlsCfgBool),
+    createEnumConfig("tls-auth-clients", NULL, MODIFIABLE_CONFIG, tls_auth_clients_enum, server.tls_auth_clients, TLS_CLIENT_AUTH_YES, NULL, NULL),
+    createBoolConfig("tls-prefer-server-ciphers", NULL, MODIFIABLE_CONFIG, server.tls_ctx_config.prefer_server_ciphers, 0, NULL, updateTlsCfgBool),
+    createBoolConfig("tls-session-caching", NULL, MODIFIABLE_CONFIG, server.tls_ctx_config.session_caching, 1, NULL, updateTlsCfgBool),
+    createStringConfig("tls-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.cert_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-key-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.key_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-key-file-pass", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.key_file_pass, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-client-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_cert_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-client-key-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_key_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-client-key-file-pass", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_key_file_pass, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-dh-params-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.dh_params_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-ca-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ca_cert_file, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-ca-cert-dir", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ca_cert_dir, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-protocols", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.protocols, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-ciphers", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ciphers, NULL, NULL, updateTlsCfg),
+    createStringConfig("tls-ciphersuites", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ciphersuites, NULL, NULL, updateTlsCfg),
+#endif
+
+    /* NULL Terminator */
+    {NULL}
+};
+
+/*-----------------------------------------------------------------------------
+ * CONFIG command entry point
+ *----------------------------------------------------------------------------*/
+
+void configCommand(client *c) {
+    /* Only allow CONFIG GET while loading. */
+    if (server.loading && strcasecmp(c->argv[1]->ptr,"get")) {
+        addReplyError(c,"Only CONFIG GET is allowed during loading");
+        return;
+    }
+
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"GET <pattern>",
+"    Return parameters matching the glob-like <pattern> and their values.",
+"SET <directive> <value>",
+"    Set the configuration <directive> to <value>.",
+"RESETSTAT",
+"    Reset statistics reported by the INFO command.",
+"REWRITE",
+"    Rewrite the configuration file.",
+NULL
+        };
+
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"set") && c->argc == 4) {
+        configSetCommand(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"get") && c->argc == 3) {
+        configGetCommand(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"resetstat") && c->argc == 2) {
+        resetServerStats();
+        resetCommandTableStats();
+        resetErrorTableStats();
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"rewrite") && c->argc == 2) {
+        if (server.configfile == NULL) {
+            addReplyError(c,"The server is running without a config file");
+            return;
+        }
+        if (rewriteConfig(server.configfile, 0) == -1) {
+            serverLog(LL_WARNING,"CONFIG REWRITE failed: %s", strerror(errno));
+            addReplyErrorFormat(c,"Rewriting config file: %s", strerror(errno));
+        } else {
+            serverLog(LL_WARNING,"CONFIG REWRITE executed with success.");
+            addReply(c,shared.ok);
+        }
+    } else {
+        addReplySubcommandSyntaxError(c);
+        return;
+    }
+}
diff --git a/redis-stable/src/config.h b/redis-stable/src/config.h
new file mode 100644
index 00000000..2f351a1b
--- /dev/null
+++ b/redis-stable/src/config.h
@@ -0,0 +1,267 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __CONFIG_H
+#define __CONFIG_H
+
+#ifdef __APPLE__
+#include <AvailabilityMacros.h>
+#endif
+
+#ifdef __linux__
+#include <features.h>
+#include <fcntl.h>
+#endif
+
+/* Define redis_fstat to fstat or fstat64() */
+#if defined(__APPLE__) && !defined(MAC_OS_X_VERSION_10_6)
+#define redis_fstat fstat64
+#define redis_stat stat64
+#else
+#define redis_fstat fstat
+#define redis_stat stat
+#endif
+
+/* Test for proc filesystem */
+#ifdef __linux__
+#define HAVE_PROC_STAT 1
+#define HAVE_PROC_MAPS 1
+#define HAVE_PROC_SMAPS 1
+#define HAVE_PROC_SOMAXCONN 1
+#define HAVE_PROC_OOM_SCORE_ADJ 1
+#endif
+
+/* Test for task_info() */
+#if defined(__APPLE__)
+#define HAVE_TASKINFO 1
+#endif
+
+/* Test for backtrace() */
+#if defined(__APPLE__) || (defined(__linux__) && defined(__GLIBC__)) || \
+    defined(__FreeBSD__) || ((defined(__OpenBSD__) || defined(__NetBSD__)) && defined(USE_BACKTRACE))\
+ || defined(__DragonFly__) || (defined(__UCLIBC__) && defined(__UCLIBC_HAS_BACKTRACE__))
+#define HAVE_BACKTRACE 1
+#endif
+
+/* MSG_NOSIGNAL. */
+#ifdef __linux__
+#define HAVE_MSG_NOSIGNAL 1
+#endif
+
+/* Test for polling API */
+#ifdef __linux__
+#define HAVE_EPOLL 1
+#endif
+
+#if (defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)) || defined(__FreeBSD__) || defined(__OpenBSD__) || defined (__NetBSD__)
+#define HAVE_KQUEUE 1
+#endif
+
+#ifdef __sun
+#include <sys/feature_tests.h>
+#ifdef _DTRACE_VERSION
+#define HAVE_EVPORT 1
+#define HAVE_PSINFO 1
+#endif
+#endif
+
+/* Define redis_fsync to fdatasync() in Linux and fsync() for all the rest */
+#ifdef __linux__
+#define redis_fsync fdatasync
+#else
+#define redis_fsync fsync
+#endif
+
+#if __GNUC__ >= 4
+#define redis_unreachable __builtin_unreachable
+#else
+#define redis_unreachable abort
+#endif
+
+#if __GNUC__ >= 3
+#define likely(x) __builtin_expect(!!(x), 1)
+#define unlikely(x) __builtin_expect(!!(x), 0)
+#else
+#define likely(x) (x)
+#define unlikely(x) (x)
+#endif
+
+/* Define rdb_fsync_range to sync_file_range() on Linux, otherwise we use
+ * the plain fsync() call. */
+#if (defined(__linux__) && defined(SYNC_FILE_RANGE_WAIT_BEFORE))
+#define rdb_fsync_range(fd,off,size) sync_file_range(fd,off,size,SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE)
+#else
+#define rdb_fsync_range(fd,off,size) fsync(fd)
+#endif
+
+/* Check if we can use setproctitle().
+ * BSD systems have support for it, we provide an implementation for
+ * Linux and osx. */
+#if (defined __NetBSD__ || defined __FreeBSD__ || defined __OpenBSD__)
+#define USE_SETPROCTITLE
+#endif
+
+#if defined(__HAIKU__)
+#define ESOCKTNOSUPPORT 0
+#endif
+
+#if (defined __linux || defined __APPLE__)
+#define USE_SETPROCTITLE
+#define INIT_SETPROCTITLE_REPLACEMENT
+void spt_init(int argc, char *argv[]);
+void setproctitle(const char *fmt, ...);
+#endif
+
+/* Byte ordering detection */
+#include <sys/types.h> /* This will likely define BYTE_ORDER */
+
+#ifndef BYTE_ORDER
+#if (BSD >= 199103)
+# include <machine/endian.h>
+#else
+#if defined(linux) || defined(__linux__)
+# include <endian.h>
+#else
+#define	LITTLE_ENDIAN	1234	/* least-significant byte first (vax, pc) */
+#define	BIG_ENDIAN	4321	/* most-significant byte first (IBM, net) */
+#define	PDP_ENDIAN	3412	/* LSB first in word, MSW first in long (pdp)*/
+
+#if defined(__i386__) || defined(__x86_64__) || defined(__amd64__) || \
+   defined(vax) || defined(ns32000) || defined(sun386) || \
+   defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \
+   defined(__alpha__) || defined(__alpha)
+#define BYTE_ORDER    LITTLE_ENDIAN
+#endif
+
+#if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \
+    defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \
+    defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\
+    defined(apollo) || defined(__convex__) || defined(_CRAY) || \
+    defined(__hppa) || defined(__hp9000) || \
+    defined(__hp9000s300) || defined(__hp9000s700) || \
+    defined (BIT_ZERO_ON_LEFT) || defined(m68k) || defined(__sparc)
+#define BYTE_ORDER	BIG_ENDIAN
+#endif
+#endif /* linux */
+#endif /* BSD */
+#endif /* BYTE_ORDER */
+
+/* Sometimes after including an OS-specific header that defines the
+ * endianness we end with __BYTE_ORDER but not with BYTE_ORDER that is what
+ * the Redis code uses. In this case let's define everything without the
+ * underscores. */
+#ifndef BYTE_ORDER
+#ifdef __BYTE_ORDER
+#if defined(__LITTLE_ENDIAN) && defined(__BIG_ENDIAN)
+#ifndef LITTLE_ENDIAN
+#define LITTLE_ENDIAN __LITTLE_ENDIAN
+#endif
+#ifndef BIG_ENDIAN
+#define BIG_ENDIAN __BIG_ENDIAN
+#endif
+#if (__BYTE_ORDER == __LITTLE_ENDIAN)
+#define BYTE_ORDER LITTLE_ENDIAN
+#else
+#define BYTE_ORDER BIG_ENDIAN
+#endif
+#endif
+#endif
+#endif
+
+#if !defined(BYTE_ORDER) || \
+    (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN)
+	/* you must determine what the correct bit order is for
+	 * your compiler - the next line is an intentional error
+	 * which will force your compiles to bomb until you fix
+	 * the above macros.
+	 */
+#error "Undefined or invalid BYTE_ORDER"
+#endif
+
+#if (__i386 || __amd64 || __powerpc__) && __GNUC__
+#define GNUC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__)
+#if defined(__clang__)
+#define HAVE_ATOMIC
+#endif
+#if (defined(__GLIBC__) && defined(__GLIBC_PREREQ))
+#if (GNUC_VERSION >= 40100 && __GLIBC_PREREQ(2, 6))
+#define HAVE_ATOMIC
+#endif
+#endif
+#endif
+
+/* Make sure we can test for ARM just checking for __arm__, since sometimes
+ * __arm is defined but __arm__ is not. */
+#if defined(__arm) && !defined(__arm__)
+#define __arm__
+#endif
+#if defined (__aarch64__) && !defined(__arm64__)
+#define __arm64__
+#endif
+
+/* Make sure we can test for SPARC just checking for __sparc__. */
+#if defined(__sparc) && !defined(__sparc__)
+#define __sparc__
+#endif
+
+#if defined(__sparc__) || defined(__arm__)
+#define USE_ALIGNED_ACCESS
+#endif
+
+/* Define for redis_set_thread_title */
+#ifdef __linux__
+#define redis_set_thread_title(name) pthread_setname_np(pthread_self(), name)
+#else
+#if (defined __FreeBSD__ || defined __OpenBSD__)
+#include <pthread_np.h>
+#define redis_set_thread_title(name) pthread_set_name_np(pthread_self(), name)
+#elif defined __NetBSD__
+#include <pthread.h>
+#define redis_set_thread_title(name) pthread_setname_np(pthread_self(), "%s", name)
+#elif defined __HAIKU__
+#include <kernel/OS.h>
+#define redis_set_thread_title(name) rename_thread(find_thread(0), name)
+#else
+#if (defined __APPLE__ && defined(MAC_OS_X_VERSION_10_7))
+int pthread_setname_np(const char *name);
+#include <pthread.h>
+#define redis_set_thread_title(name) pthread_setname_np(name)
+#else
+#define redis_set_thread_title(name)
+#endif
+#endif
+#endif
+
+/* Check if we can use setcpuaffinity(). */
+#if (defined __linux || defined __NetBSD__ || defined __FreeBSD__ || defined __DragonFly__)
+#define USE_SETCPUAFFINITY
+void setcpuaffinity(const char *cpulist);
+#endif
+
+#endif
diff --git a/redis-stable/src/connection.c b/redis-stable/src/connection.c
new file mode 100644
index 00000000..a5946322
--- /dev/null
+++ b/redis-stable/src/connection.c
@@ -0,0 +1,433 @@
+/*
+ * Copyright (c) 2019, Redis Labs
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "connhelpers.h"
+
+/* The connections module provides a lean abstraction of network connections
+ * to avoid direct socket and async event management across the Redis code base.
+ *
+ * It does NOT provide advanced connection features commonly found in similar
+ * libraries such as complete in/out buffer management, throttling, etc. These
+ * functions remain in networking.c.
+ *
+ * The primary goal is to allow transparent handling of TCP and TLS based
+ * connections. To do so, connections have the following properties:
+ *
+ * 1. A connection may live before its corresponding socket exists.  This
+ *    allows various context and configuration setting to be handled before
+ *    establishing the actual connection.
+ * 2. The caller may register/unregister logical read/write handlers to be
+ *    called when the connection has data to read from/can accept writes.
+ *    These logical handlers may or may not correspond to actual AE events,
+ *    depending on the implementation (for TCP they are; for TLS they aren't).
+ */
+
+ConnectionType CT_Socket;
+
+/* When a connection is created we must know its type already, but the
+ * underlying socket may or may not exist:
+ *
+ * - For accepted connections, it exists as we do not model the listen/accept
+ *   part; So caller calls connCreateSocket() followed by connAccept().
+ * - For outgoing connections, the socket is created by the connection module
+ *   itself; So caller calls connCreateSocket() followed by connConnect(),
+ *   which registers a connect callback that fires on connected/error state
+ *   (and after any transport level handshake was done).
+ *
+ * NOTE: An earlier version relied on connections being part of other structs
+ * and not independently allocated. This could lead to further optimizations
+ * like using container_of(), etc.  However it was discontinued in favor of
+ * this approach for these reasons:
+ *
+ * 1. In some cases conns are created/handled outside the context of the
+ * containing struct, in which case it gets a bit awkward to copy them.
+ * 2. Future implementations may wish to allocate arbitrary data for the
+ * connection.
+ * 3. The container_of() approach is anyway risky because connections may
+ * be embedded in different structs, not just client.
+ */
+
+connection *connCreateSocket() {
+    connection *conn = zcalloc(sizeof(connection));
+    conn->type = &CT_Socket;
+    conn->fd = -1;
+
+    return conn;
+}
+
+/* Create a new socket-type connection that is already associated with
+ * an accepted connection.
+ *
+ * The socket is not ready for I/O until connAccept() was called and
+ * invoked the connection-level accept handler.
+ *
+ * Callers should use connGetState() and verify the created connection
+ * is not in an error state (which is not possible for a socket connection,
+ * but could but possible with other protocols).
+ */
+connection *connCreateAcceptedSocket(int fd) {
+    connection *conn = connCreateSocket();
+    conn->fd = fd;
+    conn->state = CONN_STATE_ACCEPTING;
+    return conn;
+}
+
+static int connSocketConnect(connection *conn, const char *addr, int port, const char *src_addr,
+        ConnectionCallbackFunc connect_handler) {
+    int fd = anetTcpNonBlockBestEffortBindConnect(NULL,addr,port,src_addr);
+    if (fd == -1) {
+        conn->state = CONN_STATE_ERROR;
+        conn->last_errno = errno;
+        return C_ERR;
+    }
+
+    conn->fd = fd;
+    conn->state = CONN_STATE_CONNECTING;
+
+    conn->conn_handler = connect_handler;
+    aeCreateFileEvent(server.el, conn->fd, AE_WRITABLE,
+            conn->type->ae_handler, conn);
+
+    return C_OK;
+}
+
+/* Returns true if a write handler is registered */
+int connHasWriteHandler(connection *conn) {
+    return conn->write_handler != NULL;
+}
+
+/* Returns true if a read handler is registered */
+int connHasReadHandler(connection *conn) {
+    return conn->read_handler != NULL;
+}
+
+/* Associate a private data pointer with the connection */
+void connSetPrivateData(connection *conn, void *data) {
+    conn->private_data = data;
+}
+
+/* Get the associated private data pointer */
+void *connGetPrivateData(connection *conn) {
+    return conn->private_data;
+}
+
+/* ------ Pure socket connections ------- */
+
+/* A very incomplete list of implementation-specific calls.  Much of the above shall
+ * move here as we implement additional connection types.
+ */
+
+/* Close the connection and free resources. */
+static void connSocketClose(connection *conn) {
+    if (conn->fd != -1) {
+        aeDeleteFileEvent(server.el,conn->fd, AE_READABLE | AE_WRITABLE);
+        close(conn->fd);
+        conn->fd = -1;
+    }
+
+    /* If called from within a handler, schedule the close but
+     * keep the connection until the handler returns.
+     */
+    if (connHasRefs(conn)) {
+        conn->flags |= CONN_FLAG_CLOSE_SCHEDULED;
+        return;
+    }
+
+    zfree(conn);
+}
+
+static int connSocketWrite(connection *conn, const void *data, size_t data_len) {
+    int ret = write(conn->fd, data, data_len);
+    if (ret < 0 && errno != EAGAIN) {
+        conn->last_errno = errno;
+
+        /* Don't overwrite the state of a connection that is not already
+         * connected, not to mess with handler callbacks.
+         */
+        if (conn->state == CONN_STATE_CONNECTED)
+            conn->state = CONN_STATE_ERROR;
+    }
+
+    return ret;
+}
+
+static int connSocketRead(connection *conn, void *buf, size_t buf_len) {
+    int ret = read(conn->fd, buf, buf_len);
+    if (!ret) {
+        conn->state = CONN_STATE_CLOSED;
+    } else if (ret < 0 && errno != EAGAIN) {
+        conn->last_errno = errno;
+
+        /* Don't overwrite the state of a connection that is not already
+         * connected, not to mess with handler callbacks.
+         */
+        if (conn->state == CONN_STATE_CONNECTED)
+            conn->state = CONN_STATE_ERROR;
+    }
+
+    return ret;
+}
+
+static int connSocketAccept(connection *conn, ConnectionCallbackFunc accept_handler) {
+    int ret = C_OK;
+
+    if (conn->state != CONN_STATE_ACCEPTING) return C_ERR;
+    conn->state = CONN_STATE_CONNECTED;
+
+    connIncrRefs(conn);
+    if (!callHandler(conn, accept_handler)) ret = C_ERR;
+    connDecrRefs(conn);
+
+    return ret;
+}
+
+/* Register a write handler, to be called when the connection is writable.
+ * If NULL, the existing handler is removed.
+ *
+ * The barrier flag indicates a write barrier is requested, resulting with
+ * CONN_FLAG_WRITE_BARRIER set. This will ensure that the write handler is
+ * always called before and not after the read handler in a single event
+ * loop.
+ */
+static int connSocketSetWriteHandler(connection *conn, ConnectionCallbackFunc func, int barrier) {
+    if (func == conn->write_handler) return C_OK;
+
+    conn->write_handler = func;
+    if (barrier)
+        conn->flags |= CONN_FLAG_WRITE_BARRIER;
+    else
+        conn->flags &= ~CONN_FLAG_WRITE_BARRIER;
+    if (!conn->write_handler)
+        aeDeleteFileEvent(server.el,conn->fd,AE_WRITABLE);
+    else
+        if (aeCreateFileEvent(server.el,conn->fd,AE_WRITABLE,
+                    conn->type->ae_handler,conn) == AE_ERR) return C_ERR;
+    return C_OK;
+}
+
+/* Register a read handler, to be called when the connection is readable.
+ * If NULL, the existing handler is removed.
+ */
+static int connSocketSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
+    if (func == conn->read_handler) return C_OK;
+
+    conn->read_handler = func;
+    if (!conn->read_handler)
+        aeDeleteFileEvent(server.el,conn->fd,AE_READABLE);
+    else
+        if (aeCreateFileEvent(server.el,conn->fd,
+                    AE_READABLE,conn->type->ae_handler,conn) == AE_ERR) return C_ERR;
+    return C_OK;
+}
+
+static const char *connSocketGetLastError(connection *conn) {
+    return strerror(conn->last_errno);
+}
+
+static void connSocketEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask)
+{
+    UNUSED(el);
+    UNUSED(fd);
+    connection *conn = clientData;
+
+    if (conn->state == CONN_STATE_CONNECTING &&
+            (mask & AE_WRITABLE) && conn->conn_handler) {
+
+        int conn_error = connGetSocketError(conn);
+        if (conn_error) {
+            conn->last_errno = conn_error;
+            conn->state = CONN_STATE_ERROR;
+        } else {
+            conn->state = CONN_STATE_CONNECTED;
+        }
+
+        if (!conn->write_handler) aeDeleteFileEvent(server.el,conn->fd,AE_WRITABLE);
+
+        if (!callHandler(conn, conn->conn_handler)) return;
+        conn->conn_handler = NULL;
+    }
+
+    /* Normally we execute the readable event first, and the writable
+     * event later. This is useful as sometimes we may be able
+     * to serve the reply of a query immediately after processing the
+     * query.
+     *
+     * However if WRITE_BARRIER is set in the mask, our application is
+     * asking us to do the reverse: never fire the writable event
+     * after the readable. In such a case, we invert the calls.
+     * This is useful when, for instance, we want to do things
+     * in the beforeSleep() hook, like fsync'ing a file to disk,
+     * before replying to a client. */
+    int invert = conn->flags & CONN_FLAG_WRITE_BARRIER;
+
+    int call_write = (mask & AE_WRITABLE) && conn->write_handler;
+    int call_read = (mask & AE_READABLE) && conn->read_handler;
+
+    /* Handle normal I/O flows */
+    if (!invert && call_read) {
+        if (!callHandler(conn, conn->read_handler)) return;
+    }
+    /* Fire the writable event. */
+    if (call_write) {
+        if (!callHandler(conn, conn->write_handler)) return;
+    }
+    /* If we have to invert the call, fire the readable event now
+     * after the writable one. */
+    if (invert && call_read) {
+        if (!callHandler(conn, conn->read_handler)) return;
+    }
+}
+
+static int connSocketBlockingConnect(connection *conn, const char *addr, int port, long long timeout) {
+    int fd = anetTcpNonBlockConnect(NULL,addr,port);
+    if (fd == -1) {
+        conn->state = CONN_STATE_ERROR;
+        conn->last_errno = errno;
+        return C_ERR;
+    }
+
+    if ((aeWait(fd, AE_WRITABLE, timeout) & AE_WRITABLE) == 0) {
+        conn->state = CONN_STATE_ERROR;
+        conn->last_errno = ETIMEDOUT;
+    }
+
+    conn->fd = fd;
+    conn->state = CONN_STATE_CONNECTED;
+    return C_OK;
+}
+
+/* Connection-based versions of syncio.c functions.
+ * NOTE: This should ideally be refactored out in favor of pure async work.
+ */
+
+static ssize_t connSocketSyncWrite(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return syncWrite(conn->fd, ptr, size, timeout);
+}
+
+static ssize_t connSocketSyncRead(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return syncRead(conn->fd, ptr, size, timeout);
+}
+
+static ssize_t connSocketSyncReadLine(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return syncReadLine(conn->fd, ptr, size, timeout);
+}
+
+static int connSocketGetType(connection *conn) {
+    (void) conn;
+
+    return CONN_TYPE_SOCKET;
+}
+
+ConnectionType CT_Socket = {
+    .ae_handler = connSocketEventHandler,
+    .close = connSocketClose,
+    .write = connSocketWrite,
+    .read = connSocketRead,
+    .accept = connSocketAccept,
+    .connect = connSocketConnect,
+    .set_write_handler = connSocketSetWriteHandler,
+    .set_read_handler = connSocketSetReadHandler,
+    .get_last_error = connSocketGetLastError,
+    .blocking_connect = connSocketBlockingConnect,
+    .sync_write = connSocketSyncWrite,
+    .sync_read = connSocketSyncRead,
+    .sync_readline = connSocketSyncReadLine,
+    .get_type = connSocketGetType
+};
+
+
+int connGetSocketError(connection *conn) {
+    int sockerr = 0;
+    socklen_t errlen = sizeof(sockerr);
+
+    if (getsockopt(conn->fd, SOL_SOCKET, SO_ERROR, &sockerr, &errlen) == -1)
+        sockerr = errno;
+    return sockerr;
+}
+
+int connPeerToString(connection *conn, char *ip, size_t ip_len, int *port) {
+    return anetFdToString(conn ? conn->fd : -1, ip, ip_len, port, FD_TO_PEER_NAME);
+}
+
+int connSockName(connection *conn, char *ip, size_t ip_len, int *port) {
+    return anetFdToString(conn->fd, ip, ip_len, port, FD_TO_SOCK_NAME);
+}
+
+int connFormatFdAddr(connection *conn, char *buf, size_t buf_len, int fd_to_str_type) {
+    return anetFormatFdAddr(conn ? conn->fd : -1, buf, buf_len, fd_to_str_type);
+}
+
+int connBlock(connection *conn) {
+    if (conn->fd == -1) return C_ERR;
+    return anetBlock(NULL, conn->fd);
+}
+
+int connNonBlock(connection *conn) {
+    if (conn->fd == -1) return C_ERR;
+    return anetNonBlock(NULL, conn->fd);
+}
+
+int connEnableTcpNoDelay(connection *conn) {
+    if (conn->fd == -1) return C_ERR;
+    return anetEnableTcpNoDelay(NULL, conn->fd);
+}
+
+int connDisableTcpNoDelay(connection *conn) {
+    if (conn->fd == -1) return C_ERR;
+    return anetDisableTcpNoDelay(NULL, conn->fd);
+}
+
+int connKeepAlive(connection *conn, int interval) {
+    if (conn->fd == -1) return C_ERR;
+    return anetKeepAlive(NULL, conn->fd, interval);
+}
+
+int connSendTimeout(connection *conn, long long ms) {
+    return anetSendTimeout(NULL, conn->fd, ms);
+}
+
+int connRecvTimeout(connection *conn, long long ms) {
+    return anetRecvTimeout(NULL, conn->fd, ms);
+}
+
+int connGetState(connection *conn) {
+    return conn->state;
+}
+
+/* Return a text that describes the connection, suitable for inclusion
+ * in CLIENT LIST and similar outputs.
+ *
+ * For sockets, we always return "fd=<fdnum>" to maintain compatibility.
+ */
+const char *connGetInfo(connection *conn, char *buf, size_t buf_len) {
+    snprintf(buf, buf_len-1, "fd=%i", conn == NULL ? -1 : conn->fd);
+    return buf;
+}
+
diff --git a/redis-stable/src/connection.h b/redis-stable/src/connection.h
new file mode 100644
index 00000000..60f1f70c
--- /dev/null
+++ b/redis-stable/src/connection.h
@@ -0,0 +1,237 @@
+
+/*
+ * Copyright (c) 2019, Redis Labs
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __REDIS_CONNECTION_H
+#define __REDIS_CONNECTION_H
+
+#define CONN_INFO_LEN   32
+
+struct aeEventLoop;
+typedef struct connection connection;
+
+typedef enum {
+    CONN_STATE_NONE = 0,
+    CONN_STATE_CONNECTING,
+    CONN_STATE_ACCEPTING,
+    CONN_STATE_CONNECTED,
+    CONN_STATE_CLOSED,
+    CONN_STATE_ERROR
+} ConnectionState;
+
+#define CONN_FLAG_CLOSE_SCHEDULED   (1<<0)      /* Closed scheduled by a handler */
+#define CONN_FLAG_WRITE_BARRIER     (1<<1)      /* Write barrier requested */
+
+#define CONN_TYPE_SOCKET            1
+#define CONN_TYPE_TLS               2
+
+typedef void (*ConnectionCallbackFunc)(struct connection *conn);
+
+typedef struct ConnectionType {
+    void (*ae_handler)(struct aeEventLoop *el, int fd, void *clientData, int mask);
+    int (*connect)(struct connection *conn, const char *addr, int port, const char *source_addr, ConnectionCallbackFunc connect_handler);
+    int (*write)(struct connection *conn, const void *data, size_t data_len);
+    int (*read)(struct connection *conn, void *buf, size_t buf_len);
+    void (*close)(struct connection *conn);
+    int (*accept)(struct connection *conn, ConnectionCallbackFunc accept_handler);
+    int (*set_write_handler)(struct connection *conn, ConnectionCallbackFunc handler, int barrier);
+    int (*set_read_handler)(struct connection *conn, ConnectionCallbackFunc handler);
+    const char *(*get_last_error)(struct connection *conn);
+    int (*blocking_connect)(struct connection *conn, const char *addr, int port, long long timeout);
+    ssize_t (*sync_write)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
+    ssize_t (*sync_read)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
+    ssize_t (*sync_readline)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
+    int (*get_type)(struct connection *conn);
+} ConnectionType;
+
+struct connection {
+    ConnectionType *type;
+    ConnectionState state;
+    short int flags;
+    short int refs;
+    int last_errno;
+    void *private_data;
+    ConnectionCallbackFunc conn_handler;
+    ConnectionCallbackFunc write_handler;
+    ConnectionCallbackFunc read_handler;
+    int fd;
+};
+
+/* The connection module does not deal with listening and accepting sockets,
+ * so we assume we have a socket when an incoming connection is created.
+ *
+ * The fd supplied should therefore be associated with an already accept()ed
+ * socket.
+ *
+ * connAccept() may directly call accept_handler(), or return and call it
+ * at a later time. This behavior is a bit awkward but aims to reduce the need
+ * to wait for the next event loop, if no additional handshake is required.
+ *
+ * IMPORTANT: accept_handler may decide to close the connection, calling connClose().
+ * To make this safe, the connection is only marked with CONN_FLAG_CLOSE_SCHEDULED
+ * in this case, and connAccept() returns with an error.
+ *
+ * connAccept() callers must always check the return value and on error (C_ERR)
+ * a connClose() must be called.
+ */
+
+static inline int connAccept(connection *conn, ConnectionCallbackFunc accept_handler) {
+    return conn->type->accept(conn, accept_handler);
+}
+
+/* Establish a connection.  The connect_handler will be called when the connection
+ * is established, or if an error has occurred.
+ *
+ * The connection handler will be responsible to set up any read/write handlers
+ * as needed.
+ *
+ * If C_ERR is returned, the operation failed and the connection handler shall
+ * not be expected.
+ */
+static inline int connConnect(connection *conn, const char *addr, int port, const char *src_addr,
+        ConnectionCallbackFunc connect_handler) {
+    return conn->type->connect(conn, addr, port, src_addr, connect_handler);
+}
+
+/* Blocking connect.
+ *
+ * NOTE: This is implemented in order to simplify the transition to the abstract
+ * connections, but should probably be refactored out of cluster.c and replication.c,
+ * in favor of a pure async implementation.
+ */
+static inline int connBlockingConnect(connection *conn, const char *addr, int port, long long timeout) {
+    return conn->type->blocking_connect(conn, addr, port, timeout);
+}
+
+/* Write to connection, behaves the same as write(2).
+ *
+ * Like write(2), a short write is possible. A -1 return indicates an error.
+ *
+ * The caller should NOT rely on errno. Testing for an EAGAIN-like condition, use
+ * connGetState() to see if the connection state is still CONN_STATE_CONNECTED.
+ */
+static inline int connWrite(connection *conn, const void *data, size_t data_len) {
+    return conn->type->write(conn, data, data_len);
+}
+
+/* Read from the connection, behaves the same as read(2).
+ * 
+ * Like read(2), a short read is possible.  A return value of 0 will indicate the
+ * connection was closed, and -1 will indicate an error.
+ *
+ * The caller should NOT rely on errno. Testing for an EAGAIN-like condition, use
+ * connGetState() to see if the connection state is still CONN_STATE_CONNECTED.
+ */
+static inline int connRead(connection *conn, void *buf, size_t buf_len) {
+    return conn->type->read(conn, buf, buf_len);
+}
+
+/* Register a write handler, to be called when the connection is writable.
+ * If NULL, the existing handler is removed.
+ */
+static inline int connSetWriteHandler(connection *conn, ConnectionCallbackFunc func) {
+    return conn->type->set_write_handler(conn, func, 0);
+}
+
+/* Register a read handler, to be called when the connection is readable.
+ * If NULL, the existing handler is removed.
+ */
+static inline int connSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
+    return conn->type->set_read_handler(conn, func);
+}
+
+/* Set a write handler, and possibly enable a write barrier, this flag is
+ * cleared when write handler is changed or removed.
+ * With barrier enabled, we never fire the event if the read handler already
+ * fired in the same event loop iteration. Useful when you want to persist
+ * things to disk before sending replies, and want to do that in a group fashion. */
+static inline int connSetWriteHandlerWithBarrier(connection *conn, ConnectionCallbackFunc func, int barrier) {
+    return conn->type->set_write_handler(conn, func, barrier);
+}
+
+static inline void connClose(connection *conn) {
+    conn->type->close(conn);
+}
+
+/* Returns the last error encountered by the connection, as a string.  If no error,
+ * a NULL is returned.
+ */
+static inline const char *connGetLastError(connection *conn) {
+    return conn->type->get_last_error(conn);
+}
+
+static inline ssize_t connSyncWrite(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return conn->type->sync_write(conn, ptr, size, timeout);
+}
+
+static inline ssize_t connSyncRead(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return conn->type->sync_read(conn, ptr, size, timeout);
+}
+
+static inline ssize_t connSyncReadLine(connection *conn, char *ptr, ssize_t size, long long timeout) {
+    return conn->type->sync_readline(conn, ptr, size, timeout);
+}
+
+/* Return CONN_TYPE_* for the specified connection */
+static inline int connGetType(connection *conn) {
+    return conn->type->get_type(conn);
+}
+
+connection *connCreateSocket();
+connection *connCreateAcceptedSocket(int fd);
+
+connection *connCreateTLS();
+connection *connCreateAcceptedTLS(int fd, int require_auth);
+
+void connSetPrivateData(connection *conn, void *data);
+void *connGetPrivateData(connection *conn);
+int connGetState(connection *conn);
+int connHasWriteHandler(connection *conn);
+int connHasReadHandler(connection *conn);
+int connGetSocketError(connection *conn);
+
+/* anet-style wrappers to conns */
+int connBlock(connection *conn);
+int connNonBlock(connection *conn);
+int connEnableTcpNoDelay(connection *conn);
+int connDisableTcpNoDelay(connection *conn);
+int connKeepAlive(connection *conn, int interval);
+int connSendTimeout(connection *conn, long long ms);
+int connRecvTimeout(connection *conn, long long ms);
+int connPeerToString(connection *conn, char *ip, size_t ip_len, int *port);
+int connFormatFdAddr(connection *conn, char *buf, size_t buf_len, int fd_to_str_type);
+int connSockName(connection *conn, char *ip, size_t ip_len, int *port);
+const char *connGetInfo(connection *conn, char *buf, size_t buf_len);
+
+/* Helpers for tls special considerations */
+sds connTLSGetPeerCert(connection *conn);
+int tlsHasPendingData();
+int tlsProcessPendingData();
+
+#endif  /* __REDIS_CONNECTION_H */
diff --git a/redis-stable/src/connhelpers.h b/redis-stable/src/connhelpers.h
new file mode 100644
index 00000000..86250d09
--- /dev/null
+++ b/redis-stable/src/connhelpers.h
@@ -0,0 +1,88 @@
+
+/*
+ * Copyright (c) 2019, Redis Labs
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __REDIS_CONNHELPERS_H
+#define __REDIS_CONNHELPERS_H
+
+#include "connection.h"
+
+/* These are helper functions that are common to different connection
+ * implementations (currently sockets in connection.c and TLS in tls.c).
+ *
+ * Currently helpers implement the mechanisms for invoking connection
+ * handlers and tracking connection references, to allow safe destruction
+ * of connections from within a handler.
+ */
+
+/* Incremenet connection references.
+ *
+ * Inside a connection handler, we guarantee refs >= 1 so it is always
+ * safe to connClose().
+ *
+ * In other cases where we don't want to prematurely lose the connection,
+ * it can go beyond 1 as well; currently it is only done by connAccept().
+ */
+static inline void connIncrRefs(connection *conn) {
+    conn->refs++;
+}
+
+/* Decrement connection references.
+ *
+ * Note that this is not intended to provide any automatic free logic!
+ * callHandler() takes care of that for the common flows, and anywhere an
+ * explicit connIncrRefs() is used, the caller is expected to take care of
+ * that.
+ */
+
+static inline void connDecrRefs(connection *conn) {
+    conn->refs--;
+}
+
+static inline int connHasRefs(connection *conn) {
+    return conn->refs;
+}
+
+/* Helper for connection implementations to call handlers:
+ * 1. Increment refs to protect the connection.
+ * 2. Execute the handler (if set).
+ * 3. Decrement refs and perform deferred close, if refs==0.
+ */
+static inline int callHandler(connection *conn, ConnectionCallbackFunc handler) {
+    connIncrRefs(conn);
+    if (handler) handler(conn);
+    connDecrRefs(conn);
+    if (conn->flags & CONN_FLAG_CLOSE_SCHEDULED) {
+        if (!connHasRefs(conn)) connClose(conn);
+        return 0;
+    }
+    return 1;
+}
+
+#endif  /* __REDIS_CONNHELPERS_H */
diff --git a/redis-stable/src/crc16.c b/redis-stable/src/crc16.c
new file mode 100644
index 00000000..7b8c1dad
--- /dev/null
+++ b/redis-stable/src/crc16.c
@@ -0,0 +1,88 @@
+#include "server.h"
+
+/*
+ * Copyright 2001-2010 Georges Menie (www.menie.org)
+ * Copyright 2010-2012 Salvatore Sanfilippo (adapted to Redis coding style)
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of the University of California, Berkeley nor the
+ *       names of its contributors may be used to endorse or promote products
+ *       derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* CRC16 implementation according to CCITT standards.
+ *
+ * Note by @antirez: this is actually the XMODEM CRC 16 algorithm, using the
+ * following parameters:
+ *
+ * Name                       : "XMODEM", also known as "ZMODEM", "CRC-16/ACORN"
+ * Width                      : 16 bit
+ * Poly                       : 1021 (That is actually x^16 + x^12 + x^5 + 1)
+ * Initialization             : 0000
+ * Reflect Input byte         : False
+ * Reflect Output CRC         : False
+ * Xor constant to output CRC : 0000
+ * Output for "123456789"     : 31C3
+ */
+
+static const uint16_t crc16tab[256]= {
+    0x0000,0x1021,0x2042,0x3063,0x4084,0x50a5,0x60c6,0x70e7,
+    0x8108,0x9129,0xa14a,0xb16b,0xc18c,0xd1ad,0xe1ce,0xf1ef,
+    0x1231,0x0210,0x3273,0x2252,0x52b5,0x4294,0x72f7,0x62d6,
+    0x9339,0x8318,0xb37b,0xa35a,0xd3bd,0xc39c,0xf3ff,0xe3de,
+    0x2462,0x3443,0x0420,0x1401,0x64e6,0x74c7,0x44a4,0x5485,
+    0xa56a,0xb54b,0x8528,0x9509,0xe5ee,0xf5cf,0xc5ac,0xd58d,
+    0x3653,0x2672,0x1611,0x0630,0x76d7,0x66f6,0x5695,0x46b4,
+    0xb75b,0xa77a,0x9719,0x8738,0xf7df,0xe7fe,0xd79d,0xc7bc,
+    0x48c4,0x58e5,0x6886,0x78a7,0x0840,0x1861,0x2802,0x3823,
+    0xc9cc,0xd9ed,0xe98e,0xf9af,0x8948,0x9969,0xa90a,0xb92b,
+    0x5af5,0x4ad4,0x7ab7,0x6a96,0x1a71,0x0a50,0x3a33,0x2a12,
+    0xdbfd,0xcbdc,0xfbbf,0xeb9e,0x9b79,0x8b58,0xbb3b,0xab1a,
+    0x6ca6,0x7c87,0x4ce4,0x5cc5,0x2c22,0x3c03,0x0c60,0x1c41,
+    0xedae,0xfd8f,0xcdec,0xddcd,0xad2a,0xbd0b,0x8d68,0x9d49,
+    0x7e97,0x6eb6,0x5ed5,0x4ef4,0x3e13,0x2e32,0x1e51,0x0e70,
+    0xff9f,0xefbe,0xdfdd,0xcffc,0xbf1b,0xaf3a,0x9f59,0x8f78,
+    0x9188,0x81a9,0xb1ca,0xa1eb,0xd10c,0xc12d,0xf14e,0xe16f,
+    0x1080,0x00a1,0x30c2,0x20e3,0x5004,0x4025,0x7046,0x6067,
+    0x83b9,0x9398,0xa3fb,0xb3da,0xc33d,0xd31c,0xe37f,0xf35e,
+    0x02b1,0x1290,0x22f3,0x32d2,0x4235,0x5214,0x6277,0x7256,
+    0xb5ea,0xa5cb,0x95a8,0x8589,0xf56e,0xe54f,0xd52c,0xc50d,
+    0x34e2,0x24c3,0x14a0,0x0481,0x7466,0x6447,0x5424,0x4405,
+    0xa7db,0xb7fa,0x8799,0x97b8,0xe75f,0xf77e,0xc71d,0xd73c,
+    0x26d3,0x36f2,0x0691,0x16b0,0x6657,0x7676,0x4615,0x5634,
+    0xd94c,0xc96d,0xf90e,0xe92f,0x99c8,0x89e9,0xb98a,0xa9ab,
+    0x5844,0x4865,0x7806,0x6827,0x18c0,0x08e1,0x3882,0x28a3,
+    0xcb7d,0xdb5c,0xeb3f,0xfb1e,0x8bf9,0x9bd8,0xabbb,0xbb9a,
+    0x4a75,0x5a54,0x6a37,0x7a16,0x0af1,0x1ad0,0x2ab3,0x3a92,
+    0xfd2e,0xed0f,0xdd6c,0xcd4d,0xbdaa,0xad8b,0x9de8,0x8dc9,
+    0x7c26,0x6c07,0x5c64,0x4c45,0x3ca2,0x2c83,0x1ce0,0x0cc1,
+    0xef1f,0xff3e,0xcf5d,0xdf7c,0xaf9b,0xbfba,0x8fd9,0x9ff8,
+    0x6e17,0x7e36,0x4e55,0x5e74,0x2e93,0x3eb2,0x0ed1,0x1ef0
+};
+
+uint16_t crc16(const char *buf, int len) {
+    int counter;
+    uint16_t crc = 0;
+    for (counter = 0; counter < len; counter++)
+            crc = (crc<<8) ^ crc16tab[((crc>>8) ^ *buf++)&0x00FF];
+    return crc;
+}
diff --git a/redis-stable/src/crc16_slottable.h b/redis-stable/src/crc16_slottable.h
new file mode 100644
index 00000000..652aea9e
--- /dev/null
+++ b/redis-stable/src/crc16_slottable.h
@@ -0,0 +1,835 @@
+#ifndef _CRC16_TABLE_H__
+#define _CRC16_TABLE_H__
+
+/* A table of the shortest possible alphanumeric string that is mapped by redis' crc16
+ * to any given redis cluster slot. 
+ * 
+ * The array indexes are slot numbers, so that given a desired slot, this string is guaranteed
+ * to make redis cluster route a request to the shard holding this slot 
+ */
+
+const char *crc16_slot_table[] = {
+"06S", "Qi", "5L5", "4Iu", "4gY", "460", "1Y7", "1LV", "0QG", "ru", "7Ok", "4ji", "4DE", "65n", "2JH", "I8", "F9", "SX", "7nF", "4KD", 
+"4eh", "6PK", "2ke", "1Ng", "0Sv", "4L", "491", "4hX", "4Ft", "5C4", "2Hy", "09R", "021", "0cX", "4Xv", "6mU", "6Cy", "42R", "0Mt", "nF", 
+"cv", "1Pe", "5kK", "6NI", "74L", "4UF", "0nh", "MZ", "2TJ", "0ai", "4ZG", "6od", "6AH", "40c", "0OE", "lw", "aG", "0Bu", "5iz", "6Lx", 
+"5R7", "4Ww", "0lY", "Ok", "5n3", "4ks", "8YE", "7g", "2KR", "1nP", "714", "64t", "69D", "4Ho", "07I", "Ps", "2hN", "1ML", "4fC", "7CA", 
+"avs", "4iB", "0Rl", "5V", "2Ic", "08H", "4Gn", "66E", "aUo", "b4e", "05x", "RB", "8f", "8VD", "4dr", "5a2", "4zp", "6OS", "bl", "355", 
+"0or", "1j2", "75V", "bno", "4Yl", "6lO", "Ap", "0bB", "0Ln", "2yM", "6Bc", "43H", "4xA", "6Mb", "22D", "14", "0mC", "Nq", "6cN", "4Vm", 
+"ban", "aDl", "CA", "14Z", "8GG", "mm", "549", "41y", "53t", "464", "1Y3", "1LR", "06W", "Qm", "5L1", "4Iq", "4DA", "65j", "2JL", "1oN", 
+"0QC", "6y", "7Oo", "4jm", "4el", "6PO", "9x", "1Nc", "04f", "2EM", "7nB", "bqs", "4Fp", "5C0", "d6F", "09V", "0Sr", "4H", "495", "bRo", 
+"aio", "42V", "0Mp", "nB", "025", "17u", "4Xr", "6mQ", "74H", "4UB", "0nl", "3Kn", "cr", "1Pa", "5kO", "6NM", "6AL", "40g", "0OA", "ls", 
+"2TN", "0am", "4ZC", "aEr", "5R3", "4Ws", "18t", "Oo", "aC", "0Bq", "bCl", "afn", "2KV", "1nT", "5Uz", "64p", "5n7", "4kw", "0PY", "7c", 
+"2hJ", "1MH", "4fG", "6Sd", "7mi", "4Hk", "07M", "Pw", "2Ig", "08L", "4Gj", "66A", "7LD", "4iF", "0Rh", "5R", "8b", "1Oy", "4dv", "5a6", 
+"7oX", "4JZ", "0qt", "RF", "0ov", "LD", "4A9", "4TX", "4zt", "6OW", "bh", "0AZ", "z9", "oX", "6Bg", "43L", "4Yh", "6lK", "At", "0bF", 
+"0mG", "Nu", "6cJ", "4Vi", "4xE", "6Mf", "2vH", "10", "8GC", "mi", "5p5", "4uu", "5Kx", "4N8", "CE", "1pV", "0QO", "6u", "7Oc", "4ja", 
+"4DM", "65f", "3Za", "I0", "0rS", "Qa", "68V", "b7F", "4gQ", "468", "dSo", "285", "274", "4D", "499", "4hP", "b8G", "67W", "0h3", "09Z", 
+"F1", "SP", "7nN", "4KL", "51I", "6PC", "9t", "1No", "21g", "1Pm", "5kC", "6NA", "74D", "4UN", "X3", "MR", "029", "0cP", "bbM", "79t", 
+"4c3", "42Z", "8Dd", "nN", "aO", "8Ke", "4yS", "4l2", "76u", "635", "0lQ", "Oc", "BS", "W2", "4ZO", "6ol", "7Qa", "40k", "0OM", "2zn", 
+"69L", "4Hg", "07A", "2Fj", "2hF", "k6", "4fK", "6Sh", "7Ny", "6K9", "0PU", "7o", "2KZ", "1nX", "4EW", "4P6", "7oT", "4JV", "05p", "RJ", 
+"8n", "1Ou", "4dz", "6QY", "7LH", "4iJ", "d7", "qV", "2Ik", "1li", "4Gf", "66M", "4Yd", "6lG", "Ax", "0bJ", "z5", "oT", "6Bk", "4wH", 
+"4zx", "aeI", "bd", "0AV", "0oz", "LH", "4A5", "4TT", "5Kt", "4N4", "CI", "14R", "0NW", "me", "541", "41q", "4xI", "6Mj", "22L", "u4", 
+"0mK", "Ny", "6cF", "4Ve", "4DI", "65b", "2JD", "I4", "0QK", "6q", "7Og", "4je", "4gU", "4r4", "2iX", "1LZ", "0rW", "Qe", "5L9", "4Iy", 
+"4Fx", "5C8", "0h7", "1mw", "0Sz", "pH", "7MV", "4hT", "4ed", "6PG", "9p", "1Nk", "F5", "ST", "7nJ", "4KH", "7pH", "4UJ", "X7", "MV", 
+"cz", "1Pi", "5kG", "6NE", "4c7", "4vV", "0Mx", "nJ", "0v5", "0cT", "4Xz", "6mY", "6bX", "5GZ", "0lU", "Og", "aK", "0By", "4yW", "4l6", 
+"6AD", "40o", "0OI", "2zj", "BW", "W6", "4ZK", "6oh", "2hB", "k2", "4fO", "6Sl", "69H", "4Hc", "07E", "2Fn", "d5e", "83m", "4ES", "4P2", 
+"a0F", "bQL", "0PQ", "7k", "8j", "1Oq", "50W", "hbv", "7oP", "4JR", "05t", "RN", "2Io", "08D", "4Gb", "66I", "7LL", "4iN", "d3", "5Z", 
+"z1", "oP", "6Bo", "43D", "5IA", "6lC", "2Wm", "0bN", "8ff", "LL", "4A1", "4TP", "cPn", "aeM", "0T3", "0AR", "0NS", "ma", "545", "41u", 
+"5Kp", "4N0", "CM", "14V", "0mO", "2Xl", "6cB", "4Va", "4xM", "6Mn", "22H", "18", "04s", "SI", "7nW", "4KU", "4ey", "6PZ", "9m", "1Nv", 
+"e4", "pU", "7MK", "4hI", "4Fe", "67N", "2Hh", "09C", "06B", "Qx", "68O", "4Id", "4gH", "6Rk", "2iE", "j5", "0QV", "6l", "5o8", "4jx", 
+"4DT", "4Q5", "2JY", "82j", "BJ", "0ax", "4ZV", "4O7", "552", "40r", "0OT", "lf", "aV", "t7", "4yJ", "6Li", "6bE", "4Wf", "0lH", "Oz", 
+"2Vj", "0cI", "4Xg", "6mD", "6Ch", "42C", "0Me", "nW", "cg", "1Pt", "5kZ", "6NX", "7pU", "4UW", "0ny", "MK", "7LQ", "4iS", "267", "5G", 
+"0i0", "08Y", "b9D", "66T", "7oM", "4JO", "G2", "RS", "8w", "1Ol", "4dc", "7Aa", "atS", "4kb", "0PL", "7v", "2KC", "H3", "4EN", "64e", 
+"69U", "b6E", "07X", "Pb", "dRl", "296", "4fR", "4s3", "4xP", "4m1", "22U", "8Jf", "0mR", "0x3", "77v", "626", "5Km", "6no", "CP", "V1", 
+"0NN", "3kL", "7Pb", "41h", "4za", "6OB", "20d", "0AO", "Y0", "LQ", "6an", "4TM", "bcN", "78w", "Aa", "0bS", "8Eg", "oM", "4b0", "43Y", 
+"51T", "azL", "9i", "1Nr", "04w", "SM", "7nS", "4KQ", "4Fa", "67J", "2Hl", "09G", "e0", "4Y", "7MO", "4hM", "4gL", "6Ro", "2iA", "j1", 
+"06F", "2Gm", "68K", "5YA", "4DP", "4Q1", "d4f", "82n", "0QR", "6h", "a1E", "bPO", "556", "40v", "0OP", "lb", "BN", "15U", "4ZR", "4O3", 
+"6bA", "4Wb", "0lL", "2Yo", "aR", "t3", "4yN", "6Lm", "6Cl", "42G", "0Ma", "nS", "2Vn", "0cM", "4Xc", "79i", "74Y", "4US", "8ge", "MO", 
+"cc", "1Pp", "bAL", "adN", "0i4", "1lt", "5WZ", "66P", "7LU", "4iW", "0Ry", "5C", "8s", "1Oh", "4dg", "6QD", "7oI", "4JK", "G6", "RW", 
+"2KG", "H7", "4EJ", "64a", "7Nd", "4kf", "0PH", "7r", "1X8", "1MY", "4fV", "4s7", "69Q", "4Hz", "0sT", "Pf", "0mV", "Nd", "5S8", "4Vx", 
+"4xT", "4m5", "22Q", "0Cz", "0NJ", "mx", "7Pf", "41l", "5Ki", "6nk", "CT", "V5", "Y4", "LU", "6aj", "4TI", "4ze", "6OF", "by", "0AK", 
+"2l9", "oI", "4b4", "4wU", "4Yy", "6lZ", "Ae", "0bW", "0So", "4U", "7MC", "4hA", "4Fm", "67F", "3XA", "09K", "0ps", "SA", "aTl", "b5f", 
+"4eq", "6PR", "9e", "8WG", "8XF", "6d", "5o0", "4jp", "707", "65w", "1z2", "1oS", "06J", "Qp", "68G", "4Il", "53i", "6Rc", "2iM", "1LO", 
+"23G", "07", "4yB", "6La", "6bM", "4Wn", "18i", "Or", "BB", "0ap", "c4D", "aEo", "5q2", "40z", "8FD", "ln", "co", "346", "5kR", "6NP", 
+"74U", "bol", "0nq", "MC", "2Vb", "0cA", "4Xo", "6mL", "7SA", "42K", "0Mm", "2xN", "7oE", "4JG", "05a", "2DJ", "2jf", "1Od", "4dk", "6QH", 
+"482", "5yz", "0Ru", "5O", "0i8", "08Q", "4Gw", "5B7", "5M6", "4Hv", "07P", "Pj", "1X4", "1MU", "4fZ", "473", "7Nh", "4kj", "0PD", "sv", 
+"2KK", "1nI", "4EF", "64m", "5Ke", "6ng", "CX", "V9", "0NF", "mt", "7Pj", "4uh", "4xX", "4m9", "1F6", "0Cv", "0mZ", "Nh", "5S4", "4Vt", 
+"4Yu", "6lV", "Ai", "16r", "0Lw", "oE", "4b8", "43Q", "4zi", "6OJ", "bu", "0AG", "Y8", "LY", "6af", "4TE", "4Fi", "67B", "2Hd", "09O", 
+"e8", "4Q", "7MG", "4hE", "4eu", "6PV", "9a", "1Nz", "0pw", "SE", "aTh", "4KY", "4DX", "4Q9", "1z6", "1oW", "0QZ", "rh", "5o4", "4jt", 
+"4gD", "6Rg", "2iI", "j9", "06N", "Qt", "68C", "4Ih", "6bI", "4Wj", "0lD", "Ov", "aZ", "03", "4yF", "6Le", "5q6", "4tv", "0OX", "lj", 
+"BF", "0at", "4ZZ", "6oy", "74Q", "5Ez", "0nu", "MG", "ck", "1Px", "5kV", "6NT", "6Cd", "42O", "0Mi", "2xJ", "2Vf", "0cE", "4Xk", "6mH", 
+"2jb", "8VY", "4do", "6QL", "7oA", "4JC", "05e", "2DN", "d7E", "08U", "4Gs", "5B3", "486", "bSl", "0Rq", "5K", "1X0", "1MQ", "52w", "477", 
+"5M2", "4Hr", "07T", "Pn", "2KO", "1nM", "4EB", "64i", "7Nl", "4kn", "8YX", "7z", "0NB", "mp", "7Pn", "41d", "5Ka", "6nc", "2UM", "14G", 
+"19w", "Nl", "5S0", "4Vp", "bBo", "agm", "1F2", "0Cr", "0Ls", "oA", "ahl", "43U", "4Yq", "6lR", "Am", "16v", "0oo", "2ZL", "6ab", "4TA", 
+"4zm", "6ON", "bq", "0AC", "2VY", "0cz", "4XT", "4M5", "570", "42p", "0MV", "nd", "cT", "v5", "5ki", "6Nk", "74n", "4Ud", "0nJ", "Mx", 
+"By", "0aK", "4Ze", "6oF", "6Aj", "40A", "y4", "lU", "ae", "0BW", "4yy", "581", "4B4", "4WU", "18R", "OI", "06q", "QK", "7lU", "4IW", 
+"53R", "6RX", "0I4", "1Lt", "g6", "rW", "7OI", "4jK", "4Dg", "65L", "2Jj", "1oh", "0pH", "Sz", "7nd", "4Kf", "4eJ", "6Pi", "2kG", "h7", 
+"0ST", "4n", "7Mx", "4hz", "4FV", "4S7", "1x8", "09p", "4zR", "4o3", "bN", "8Hd", "0oP", "Lb", "75t", "604", "4YN", "6lm", "AR", "T3", 
+"0LL", "2yo", "6BA", "43j", "4xc", "agR", "22f", "0CM", "0ma", "NS", "6cl", "4VO", "baL", "aDN", "Cc", "14x", "8Ge", "mO", "7PQ", "4uS", 
+"7NS", "4kQ", "245", "7E", "0k2", "1nr", "coo", "64V", "69f", "4HM", "E0", "PQ", "2hl", "1Mn", "4fa", "6SB", "7Lb", "5yA", "0RN", "5t", 
+"2IA", "J1", "4GL", "66g", "aUM", "b4G", "05Z", "0d3", "8D", "8Vf", "4dP", "459", "574", "42t", "0MR", "0X3", "dln", "17W", "4XP", "4M1", 
+"74j", "5EA", "0nN", "3KL", "cP", "29", "5km", "6No", "6An", "40E", "y0", "lQ", "2Tl", "0aO", "4Za", "6oB", "4B0", "4WQ", "18V", "OM", 
+"aa", "0BS", "bCN", "585", "53V", "axN", "0I0", "1Lp", "06u", "QO", "68x", "4IS", "4Dc", "65H", "2Jn", "1ol", "g2", "rS", "7OM", "4jO", 
+"4eN", "6Pm", "9Z", "h3", "04D", "2Eo", "aTS", "4Kb", "4FR", "4S3", "d6d", "09t", "0SP", "4j", "a3G", "bRM", "0oT", "Lf", "6aY", "4Tz", 
+"4zV", "4o7", "bJ", "0Ax", "0LH", "oz", "6BE", "43n", "4YJ", "6li", "AV", "T7", "0me", "NW", "6ch", "4VK", "4xg", "6MD", "22b", "0CI", 
+"0Ny", "mK", "7PU", "4uW", "5KZ", "6nX", "Cg", "1pt", "0k6", "1nv", "4Ey", "64R", "7NW", "4kU", "241", "7A", "2hh", "1Mj", "4fe", "6SF", 
+"69b", "4HI", "E4", "PU", "2IE", "J5", "4GH", "66c", "7Lf", "4id", "0RJ", "5p", "2jY", "8Vb", "4dT", "4q5", "5O8", "4Jx", "0qV", "Rd", 
+"21E", "25", "5ka", "6Nc", "74f", "4Ul", "0nB", "Mp", "1f2", "0cr", "bbo", "79V", "578", "42x", "395", "nl", "am", "364", "4yq", "589", 
+"76W", "bmn", "0ls", "OA", "Bq", "0aC", "4Zm", "6oN", "6Ab", "40I", "0Oo", "2zL", "0Qm", "6W", "7OA", "4jC", "4Do", "65D", "2Jb", "82Q", 
+"06y", "QC", "68t", "b7d", "4gs", "5b3", "dSM", "8UE", "8ZD", "4f", "5m2", "4hr", "725", "67u", "1x0", "09x", "04H", "Sr", "7nl", "4Kn", 
+"4eB", "6Pa", "9V", "1NM", "4YF", "6le", "AZ", "0bh", "0LD", "ov", "6BI", "43b", "4zZ", "6Oy", "bF", "0At", "0oX", "Lj", "5Q6", "4Tv", 
+"5KV", "6nT", "Ck", "14p", "0Nu", "mG", "7PY", "41S", "4xk", "6MH", "22n", "0CE", "0mi", "2XJ", "6cd", "4VG", "69n", "4HE", "E8", "PY", 
+"2hd", "1Mf", "4fi", "6SJ", "ath", "4kY", "0Pw", "7M", "2Kx", "1nz", "4Eu", "6pV", "5O4", "4Jt", "05R", "Rh", "8L", "1OW", "4dX", "451", 
+"7Lj", "4ih", "0RF", "qt", "2II", "J9", "4GD", "66o", "74b", "4Uh", "0nF", "Mt", "cX", "21", "5ke", "6Ng", "5s4", "4vt", "0MZ", "nh", 
+"1f6", "0cv", "4XX", "4M9", "4B8", "4WY", "0lw", "OE", "ai", "1Rz", "4yu", "6LV", "6Af", "40M", "y8", "lY", "Bu", "0aG", "4Zi", "6oJ", 
+"4Dk", "6qH", "2Jf", "1od", "0Qi", "6S", "7OE", "4jG", "4gw", "5b7", "0I8", "1Lx", "0ru", "QG", "68p", "5Yz", "4FZ", "67q", "1x4", "1mU", 
+"0SX", "4b", "5m6", "4hv", "4eF", "6Pe", "9R", "1NI", "04L", "Sv", "7nh", "4Kj", "8EX", "or", "6BM", "43f", "4YB", "6la", "2WO", "0bl", 
+"8fD", "Ln", "5Q2", "4Tr", "cPL", "aeo", "bB", "0Ap", "0Nq", "mC", "ajn", "41W", "5KR", "6nP", "Co", "14t", "0mm", "2XN", "77I", "4VC", 
+"4xo", "6ML", "22j", "0CA", "3xA", "1Mb", "4fm", "6SN", "69j", "4HA", "07g", "2FL", "d5G", "83O", "4Eq", "64Z", "a0d", "bQn", "0Ps", "7I", 
+"8H", "1OS", "50u", "455", "5O0", "4Jp", "05V", "Rl", "2IM", "08f", "5Wa", "66k", "7Ln", "4il", "0RB", "5x", "Bh", "0aZ", "4Zt", "6oW", 
+"4a9", "40P", "0Ov", "lD", "at", "0BF", "4yh", "6LK", "6bg", "4WD", "Z9", "OX", "2VH", "U8", "4XE", "6mf", "6CJ", "42a", "0MG", "nu", 
+"cE", "1PV", "5kx", "4n8", "5P5", "4Uu", "8gC", "Mi", "04Q", "Sk", "5N7", "4Kw", "51r", "442", "9O", "1NT", "0SE", "pw", "7Mi", "4hk", 
+"4FG", "67l", "2HJ", "09a", "3", "QZ", "68m", "4IF", "4gj", "6RI", "2ig", "1Le", "0Qt", "6N", "7OX", "4jZ", "4Dv", "5A6", "0j9", "1oy", 
+"4xr", "6MQ", "22w", "377", "0mp", "NB", "77T", "blm", "5KO", "6nM", "Cr", "14i", "0Nl", "3kn", "ajs", "41J", "4zC", "aer", "20F", "36", 
+"0oA", "Ls", "6aL", "4To", "bcl", "78U", "AC", "0bq", "386", "oo", "5r3", "4ws", "5l1", "4iq", "9Kf", "5e", "1y3", "1lR", "736", "66v", 
+"7oo", "4Jm", "05K", "Rq", "8U", "1ON", "4dA", "6Qb", "7NB", "bQs", "0Pn", "7T", "2Ka", "1nc", "4El", "64G", "69w", "b6g", "07z", "1v2", 
+"dRN", "8TF", "4fp", "5c0", "akm", "40T", "0Or", "1J2", "Bl", "15w", "4Zp", "6oS", "6bc", "5Ga", "0ln", "2YM", "ap", "0BB", "4yl", "6LO", 
+"6CN", "42e", "0MC", "nq", "2VL", "0co", "4XA", "6mb", "5P1", "4Uq", "8gG", "Mm", "cA", "1PR", "bAn", "adl", "51v", "446", "9K", "1NP", 
+"04U", "So", "5N3", "4Ks", "4FC", "67h", "2HN", "09e", "0SA", "ps", "7Mm", "4ho", "4gn", "6RM", "2ic", "1La", "7", "2GO", "68i", "4IB", 
+"4Dr", "5A2", "d4D", "82L", "0Qp", "6J", "a1g", "bPm", "0mt", "NF", "6cy", "4VZ", "4xv", "6MU", "0V9", "0CX", "0Nh", "mZ", "7PD", "41N", 
+"5KK", "6nI", "Cv", "14m", "0oE", "Lw", "6aH", "4Tk", "4zG", "6Od", "20B", "32", "0LY", "ok", "5r7", "4ww", "5Iz", "6lx", "AG", "0bu", 
+"1y7", "1lV", "4GY", "4R8", "5l5", "4iu", "1Bz", "5a", "8Q", "i8", "4dE", "6Qf", "7ok", "4Ji", "05O", "Ru", "2Ke", "1ng", "4Eh", "64C", 
+"7NF", "4kD", "f9", "7P", "2hy", "3m9", "4ft", "5c4", "69s", "4HX", "0sv", "PD", "23e", "0BN", "5iA", "6LC", "6bo", "4WL", "Z1", "OP", 
+"0t3", "0aR", "c4f", "aEM", "4a1", "40X", "8Ff", "lL", "cM", "8Ig", "5kp", "4n0", "74w", "617", "0nS", "Ma", "3Fa", "U0", "4XM", "6mn", 
+"6CB", "42i", "0MO", "2xl", "0SM", "4w", "7Ma", "4hc", "4FO", "67d", "2HB", "K2", "04Y", "Sc", "aTN", "b5D", "4eS", "4p2", "9G", "8We", 
+"256", "6F", "7OP", "4jR", "cnl", "65U", "0j1", "1oq", "D3", "QR", "68e", "4IN", "4gb", "6RA", "2io", "1Lm", "5KG", "6nE", "Cz", "14a", 
+"x7", "mV", "7PH", "41B", "4xz", "592", "0V5", "0CT", "0mx", "NJ", "4C7", "4VV", "4YW", "4L6", "AK", "0by", "0LU", "og", "563", "43s", 
+"4zK", "6Oh", "bW", "w6", "0oI", "2Zj", "6aD", "4Tg", "7og", "4Je", "05C", "Ry", "2jD", "i4", "4dI", "6Qj", "5l9", "4iy", "0RW", "5m", 
+"2IX", "08s", "4GU", "4R4", "7mV", "4HT", "07r", "PH", "0H7", "1Mw", "4fx", "5c8", "7NJ", "4kH", "f5", "sT", "2Ki", "1nk", "4Ed", "64O", 
+"6bk", "4WH", "Z5", "OT", "ax", "0BJ", "4yd", "6LG", "4a5", "4tT", "0Oz", "lH", "Bd", "0aV", "4Zx", "aEI", "5P9", "4Uy", "0nW", "Me", 
+"cI", "1PZ", "5kt", "4n4", "6CF", "42m", "0MK", "ny", "2VD", "U4", "4XI", "6mj", "4FK", "6sh", "2HF", "K6", "0SI", "4s", "7Me", "4hg", 
+"4eW", "4p6", "9C", "1NX", "0pU", "Sg", "7ny", "6k9", "4Dz", "65Q", "0j5", "1ou", "0Qx", "6B", "7OT", "4jV", "4gf", "6RE", "2ik", "1Li", 
+"D7", "QV", "68a", "4IJ", "x3", "mR", "7PL", "41F", "5KC", "6nA", "2Uo", "14e", "19U", "NN", "4C3", "4VR", "bBM", "596", "0V1", "0CP", 
+"0LQ", "oc", "567", "43w", "4YS", "4L2", "AO", "16T", "0oM", "2Zn", "75i", "4Tc", "4zO", "6Ol", "bS", "w2", "8Y", "i0", "4dM", "6Qn", 
+"7oc", "4Ja", "05G", "2Dl", "d7g", "08w", "4GQ", "4R0", "a2D", "bSN", "0RS", "5i", "0H3", "1Ms", "52U", "ayM", "7mR", "4HP", "07v", "PL", 
+"2Km", "1no", "5UA", "64K", "7NN", "4kL", "f1", "7X", "5nw", "4k7", "fJ", "0Ex", "0kT", "Hf", "6eY", "4Pz", "5Mk", "6hi", "EV", "P7", 
+"0HH", "kz", "6FE", "47n", "48o", "6ID", "26b", "0GI", "0ie", "JW", "6gh", "4RK", "5OZ", "6jX", "Gg", "0dU", "0Jy", "iK", "4d6", "4qW", 
+"4z4", "4oU", "1DZ", "3A", "Ye", "0zW", "4Ay", "5D9", "6yj", "4LI", "A4", "TU", "zy", "0YK", "4be", "6WF", "6XG", "4md", "0VJ", "1p", 
+"2ME", "N5", "4CH", "62c", "5K8", "4Nx", "0uV", "Vd", "xH", "8Rb", "5pu", "4u5", "D", "13W", "5Lq", "4I1", "534", "46t", "0IR", "28y", 
+"gP", "69", "5om", "6Jo", "6dC", "5AA", "0jN", "3OL", "2Pl", "0eO", "aT1", "6kB", "6En", "44E", "98", "hQ", "ea", "0FS", "49u", "abL", 
+"4F0", "4SQ", "8ag", "KM", "02u", "UO", "4X2", "4MS", "57V", "a8F", "0M0", "0XQ", "c2", "vS", "7KM", "4nO", "5PB", "61H", "2Nn", "1kl", 
+"00D", "2Ao", "6zA", "4Ob", "4aN", "6Tm", "yR", "l3", "0WP", "0j", "a7G", "58W", "4BR", "4W3", "ZN", "84l", "0kP", "Hb", "71t", "644", 
+"5ns", "4k3", "fN", "8Ld", "0HL", "29g", "6FA", "47j", "5Mo", "6hm", "ER", "P3", "0ia", "JS", "6gl", "4RO", "48k", "7Ya", "26f", "0GM", 
+"8Ce", "iO", "4d2", "4qS", "beL", "hYw", "Gc", "0dQ", "Ya", "0zS", "cko", "60V", "4z0", "4oQ", "205", "3E", "2ll", "0YO", "4ba", "6WB", 
+"6yn", "4LM", "A0", "TQ", "2MA", "N1", "4CL", "62g", "6XC", "59I", "0VN", "1t", "xL", "8Rf", "54y", "419", "aQM", "b0G", "01Z", "3PP", 
+"530", "46p", "0IV", "jd", "DH", "0gz", "5Lu", "4I5", "6dG", "4Qd", "0jJ", "Ix", "gT", "r5", "5oi", "6Jk", "6Ej", "44A", "0Kg", "hU", 
+"Fy", "0eK", "5ND", "6kF", "4F4", "4SU", "1xZ", "KI", "ee", "0FW", "49q", "5x9", "57R", "6VX", "0M4", "0XU", "02q", "UK", "4X6", "4MW", 
+"5PF", "61L", "2Nj", "1kh", "c6", "vW", "7KI", "4nK", "4aJ", "6Ti", "yV", "l7", "0tH", "Wz", "6zE", "4Of", "4BV", "4W7", "ZJ", "0yx", 
+"0WT", "0n", "6YY", "4lz", "5Mc", "6ha", "2SO", "0fl", "1Xa", "kr", "6FM", "47f", "bDm", "aao", "fB", "0Ep", "8bD", "Hn", "5U2", "4Pr", 
+"5OR", "5Z3", "Go", "10t", "0Jq", "iC", "ann", "45W", "48g", "6IL", "ds", "0GA", "0im", "3Lo", "73I", "4RC", "6yb", "4LA", "03g", "2BL", 
+"zq", "0YC", "4bm", "6WN", "a4d", "bUn", "0Ts", "3I", "Ym", "87O", "4Aq", "5D1", "5K0", "4Np", "01V", "Vl", "2nQ", "1KS", "54u", "415", 
+"6XO", "4ml", "0VB", "1x", "2MM", "0xn", "5Sa", "62k", "gX", "61", "5oe", "6Jg", "6dK", "4Qh", "0jF", "It", "L", "0gv", "5Ly", "4I9", 
+"5w4", "4rt", "0IZ", "jh", "ei", "1Vz", "5mT", "5x5", "4F8", "4SY", "0hw", "KE", "Fu", "0eG", "5NH", "6kJ", "6Ef", "44M", "90", "hY", 
+"0Ui", "2S", "7KE", "4nG", "5PJ", "6uH", "Xw", "1kd", "0vu", "UG", "6xx", "790", "4cw", "5f7", "0M8", "0XY", "0WX", "0b", "5i6", "4lv", 
+"4BZ", "63q", "ZF", "0yt", "00L", "Wv", "6zI", "4Oj", "4aF", "6Te", "yZ", "0Zh", "0HD", "kv", "6FI", "47b", "5Mg", "6he", "EZ", "0fh", 
+"0kX", "Hj", "5U6", "4Pv", "7N9", "6Ky", "fF", "0Et", "0Ju", "iG", "6Dx", "45S", "5OV", "5Z7", "Gk", "0dY", "0ii", "3Lk", "6gd", "4RG", 
+"48c", "6IH", "dw", "0GE", "zu", "0YG", "4bi", "6WJ", "6yf", "4LE", "A8", "TY", "Yi", "1jz", "4Au", "5D5", "4z8", "4oY", "0Tw", "3M", 
+"xD", "1KW", "54q", "411", "5K4", "4Nt", "01R", "Vh", "2MI", "N9", "4CD", "62o", "6XK", "4mh", "0VF", "ut", "6dO", "4Ql", "0jB", "Ip", 
+"25E", "65", "5oa", "6Jc", "538", "46x", "9Pg", "jl", "H", "0gr", "bfo", "aCm", "72W", "bin", "0hs", "KA", "em", "324", "49y", "5x1", 
+"6Eb", "44I", "94", "3nm", "Fq", "0eC", "5NL", "6kN", "5PN", "61D", "Xs", "86Q", "0Um", "2W", "7KA", "4nC", "4cs", "5f3", "39W", "8QE", 
+"02y", "UC", "aRn", "794", "765", "63u", "ZB", "0yp", "9Ne", "0f", "5i2", "4lr", "4aB", "6Ta", "2oO", "0Zl", "00H", "Wr", "6zM", "4On", 
+"5lW", "5y6", "dj", "0GX", "0it", "JF", "6gy", "4RZ", "5OK", "6jI", "Gv", "0dD", "83", "iZ", "6De", "45N", "5nf", "6Kd", "24B", "72", 
+"0kE", "Hw", "6eH", "4Pk", "5Mz", "6hx", "EG", "0fu", "0HY", "kk", "5v7", "4sw", "5h5", "4mu", "1Fz", "1a", "2MT", "0xw", "4CY", "4V8", 
+"7kk", "4Ni", "01O", "Vu", "xY", "m8", "54l", "6Uf", "6Zg", "4oD", "b9", "3P", "Yt", "0zF", "4Ah", "60C", "4Y9", "4LX", "0wv", "TD", 
+"zh", "0YZ", "4bt", "5g4", "Fl", "11w", "5NQ", "6kS", "aom", "44T", "0Kr", "1N2", "ep", "0FB", "49d", "6HO", "6fc", "5Ca", "0hn", "3Ml", 
+"U", "0go", "bfr", "6ib", "6GN", "46e", "0IC", "jq", "gA", "0Ds", "bEn", "hyU", "5T1", "4Qq", "8cG", "Im", "00U", "Wo", "5J3", "4Os", 
+"55v", "406", "yC", "0Zq", "0WA", "ts", "6YL", "4lo", "4BC", "63h", "2LN", "0ym", "02d", "2CO", "6xa", "4MB", "4cn", "6VM", "2mc", "1Ha", 
+"0Up", "2J", "a5g", "bTm", "5PS", "5E2", "Xn", "86L", "0ip", "JB", "73T", "bhm", "48z", "5y2", "dn", "337", "87", "3on", "6Da", "45J", 
+"5OO", "6jM", "Gr", "10i", "0kA", "Hs", "6eL", "4Po", "5nb", "aar", "24F", "76", "8AE", "ko", "5v3", "4ss", "bgl", "aBn", "EC", "0fq", 
+"2MP", "0xs", "776", "62v", "5h1", "4mq", "9Of", "1e", "2nL", "1KN", "54h", "6Ub", "7ko", "4Nm", "01K", "Vq", "Yp", "0zB", "4Al", "60G", 
+"6Zc", "bUs", "0Tn", "3T", "zl", "8PF", "4bp", "5g0", "aSm", "787", "03z", "1r2", "4e9", "44P", "0Kv", "hD", "Fh", "0eZ", "5NU", "6kW", 
+"6fg", "4SD", "0hj", "KX", "et", "0FF", "5mI", "6HK", "6GJ", "46a", "0IG", "ju", "Q", "Q8", "5Ld", "6if", "5T5", "4Qu", "1zz", "Ii", 
+"gE", "0Dw", "5ox", "4j8", "55r", "402", "yG", "0Zu", "00Q", "Wk", "5J7", "4Ow", "4BG", "63l", "2LJ", "0yi", "0WE", "tw", "6YH", "4lk", 
+"4cj", "6VI", "2mg", "0XD", "0vh", "UZ", "6xe", "4MF", "5PW", "5E6", "Xj", "1ky", "0Ut", "2N", "7KX", "4nZ", "5OC", "6jA", "2Qo", "0dL", 
+"1ZA", "iR", "6Dm", "45F", "48v", "acO", "db", "0GP", "94M", "JN", "4G3", "4RR", "5Mr", "4H2", "EO", "12T", "0HQ", "kc", "527", "47w", 
+"5nn", "6Kl", "fS", "s2", "0kM", "3NO", "71i", "4Pc", "7kc", "4Na", "01G", "3PM", "xQ", "m0", "54d", "6Un", "a6D", "59T", "0VS", "1i", 
+"197", "85o", "4CQ", "4V0", "4Y1", "4LP", "03v", "TL", "0L3", "0YR", "56U", "a9E", "6Zo", "4oL", "b1", "3X", "2Om", "0zN", "5QA", "60K", 
+"ex", "0FJ", "49l", "6HG", "6fk", "4SH", "0hf", "KT", "Fd", "0eV", "5NY", "aAI", "4e5", "4pT", "0Kz", "hH", "gI", "1TZ", "5ot", "4j4", 
+"5T9", "4Qy", "0jW", "Ie", "DU", "Q4", "5Lh", "6ij", "6GF", "46m", "0IK", "jy", "0WI", "0s", "6YD", "4lg", "4BK", "6wh", "ZW", "O6", 
+"0tU", "Wg", "6zX", "6o9", "4aW", "4t6", "yK", "0Zy", "0Ux", "2B", "7KT", "4nV", "bzI", "61Q", "Xf", "1ku", "02l", "UV", "6xi", "4MJ", 
+"4cf", "6VE", "2mk", "0XH", "0Jd", "iV", "6Di", "45B", "5OG", "6jE", "Gz", "0dH", "0ix", "JJ", "4G7", "4RV", "48r", "6IY", "df", "0GT", 
+"0HU", "kg", "523", "47s", "5Mv", "4H6", "EK", "0fy", "0kI", "3NK", "6eD", "4Pg", "5nj", "6Kh", "fW", "s6", "xU", "m4", "5ph", "6Uj", 
+"7kg", "4Ne", "01C", "Vy", "193", "1hZ", "4CU", "4V4", "5h9", "4my", "0VW", "1m", "zd", "0YV", "4bx", "5g8", "4Y5", "4LT", "03r", "TH", 
+"Yx", "0zJ", "4Ad", "60O", "6Zk", "4oH", "b5", "wT", "6fo", "4SL", "0hb", "KP", "27e", "0FN", "49h", "6HC", "4e1", "44X", "8Bf", "hL", 
+"0p3", "0eR", "bdO", "aAM", "70w", "657", "0jS", "Ia", "gM", "8Mg", "5op", "4j0", "6GB", "46i", "0IO", "28d", "Y", "Q0", "5Ll", "6in", 
+"4BO", "63d", "ZS", "O2", "0WM", "0w", "7Ia", "4lc", "4aS", "4t2", "yO", "8Se", "00Y", "Wc", "aPN", "b1D", "bzM", "61U", "Xb", "1kq", 
+"216", "2F", "7KP", "4nR", "4cb", "6VA", "2mo", "0XL", "02h", "UR", "6xm", "4MN", "5j7", "4ow", "0TY", "3c", "YG", "0zu", "5Qz", "60p", 
+"6yH", "4Lk", "03M", "Tw", "2lJ", "0Yi", "4bG", "6Wd", "6Xe", "4mF", "0Vh", "1R", "2Mg", "0xD", "4Cj", "62A", "7kX", "4NZ", "0ut", "VF", 
+"xj", "1Ky", "5pW", "5e6", "5nU", "6KW", "fh", "0EZ", "0kv", "HD", "4E9", "4PX", "5MI", "6hK", "Et", "0fF", "0Hj", "kX", "6Fg", "47L", 
+"48M", "6If", "dY", "50", "0iG", "Ju", "6gJ", "4Ri", "5Ox", "4J8", "GE", "0dw", "1Zz", "ii", "5t5", "4qu", "02W", "Um", "5H1", "4Mq", 
+"57t", "424", "2mP", "0Xs", "0UC", "2y", "7Ko", "4nm", "bzr", "61j", "2NL", "1kN", "00f", "2AM", "6zc", "bus", "4al", "6TO", "yp", "0ZB", 
+"0Wr", "0H", "a7e", "58u", "4Bp", "5G0", "Zl", "84N", "f", "13u", "5LS", "5Y2", "amo", "46V", "0Ip", "jB", "gr", "1Ta", "5oO", "6JM", 
+"6da", "4QB", "0jl", "3On", "2PN", "0em", "5Nb", "aAr", "6EL", "44g", "0KA", "hs", "eC", "0Fq", "49W", "abn", "5V3", "4Ss", "8aE", "Ko", 
+"YC", "0zq", "754", "60t", "5j3", "4os", "9Md", "3g", "2lN", "0Ym", "4bC", "7GA", "6yL", "4Lo", "03I", "Ts", "2Mc", "1ha", "4Cn", "62E", 
+"6Xa", "4mB", "0Vl", "1V", "xn", "8RD", "5pS", "5e2", "aQo", "b0e", "01x", "VB", "0kr", "1n2", "71V", "bjo", "5nQ", "6KS", "fl", "315", 
+"0Hn", "29E", "6Fc", "47H", "5MM", "6hO", "Ep", "0fB", "0iC", "Jq", "6gN", "4Rm", "48I", "6Ib", "26D", "54", "8CG", "im", "509", "45y", 
+"ben", "hYU", "GA", "0ds", "4cY", "420", "2mT", "0Xw", "02S", "Ui", "5H5", "4Mu", "5Pd", "61n", "XY", "M8", "0UG", "vu", "7Kk", "4ni", 
+"4ah", "6TK", "yt", "0ZF", "B9", "WX", "6zg", "4OD", "4Bt", "5G4", "Zh", "0yZ", "0Wv", "0L", "4y9", "4lX", "6Gy", "46R", "0It", "jF", 
+"b", "0gX", "5LW", "5Y6", "6de", "4QF", "0jh", "IZ", "gv", "0DD", "5oK", "6JI", "6EH", "44c", "0KE", "hw", "2PJ", "0ei", "5Nf", "6kd", 
+"5V7", "4Sw", "0hY", "Kk", "eG", "0Fu", "49S", "6Hx", "7ia", "4Lc", "03E", "2Bn", "zS", "o2", "4bO", "6Wl", "a4F", "bUL", "0TQ", "3k", 
+"YO", "87m", "4AS", "4T2", "7kP", "4NR", "01t", "VN", "xb", "1Kq", "54W", "hfv", "6Xm", "4mN", "1FA", "1Z", "2Mo", "0xL", "4Cb", "62I", 
+"5MA", "6hC", "2Sm", "0fN", "0Hb", "kP", "6Fo", "47D", "bDO", "aaM", "0P3", "0ER", "8bf", "HL", "4E1", "4PP", "5Op", "4J0", "GM", "10V", 
+"0JS", "ia", "505", "45u", "48E", "6In", "dQ", "58", "0iO", "3LM", "6gB", "4Ra", "0UK", "2q", "7Kg", "4ne", "5Ph", "61b", "XU", "M4", 
+"0vW", "Ue", "5H9", "4My", "4cU", "4v4", "2mX", "1HZ", "0Wz", "tH", "4y5", "4lT", "4Bx", "5G8", "Zd", "0yV", "B5", "WT", "6zk", "4OH", 
+"4ad", "6TG", "yx", "0ZJ", "gz", "0DH", "5oG", "6JE", "6di", "4QJ", "0jd", "IV", "n", "0gT", "680", "6iY", "4g7", "4rV", "0Ix", "jJ", 
+"eK", "0Fy", "5mv", "4h6", "6fX", "5CZ", "0hU", "Kg", "FW", "S6", "5Nj", "6kh", "6ED", "44o", "0KI", "3nK", "zW", "o6", "4bK", "6Wh", 
+"6yD", "4Lg", "03A", "2Bj", "YK", "0zy", "4AW", "4T6", "6ZX", "6O9", "0TU", "3o", "xf", "1Ku", "54S", "6UY", "7kT", "4NV", "01p", "VJ", 
+"2Mk", "0xH", "4Cf", "62M", "6Xi", "4mJ", "0Vd", "uV", "0Hf", "kT", "6Fk", "4sH", "5ME", "6hG", "Ex", "0fJ", "0kz", "HH", "4E5", "4PT", 
+"5nY", "aaI", "fd", "0EV", "0JW", "ie", "501", "45q", "5Ot", "4J4", "GI", "10R", "0iK", "Jy", "6gF", "4Re", "48A", "6Ij", "dU", "q4", 
+"5Pl", "61f", "XQ", "M0", "0UO", "2u", "7Kc", "4na", "4cQ", "428", "39u", "8Qg", "0vS", "Ua", "aRL", "b3F", "bxO", "63W", "0l3", "0yR", 
+"234", "0D", "4y1", "4lP", "55I", "6TC", "2om", "0ZN", "B1", "WP", "6zo", "4OL", "6dm", "4QN", "1zA", "IR", "25g", "0DL", "5oC", "6JA", 
+"4g3", "46Z", "9PE", "jN", "j", "0gP", "684", "aCO", "72u", "675", "0hQ", "Kc", "eO", "8Oe", "5mr", "4h2", "7Ua", "44k", "0KM", "3nO", 
+"FS", "S2", "5Nn", "6kl", "4x6", "4mW", "0Vy", "1C", "0m4", "0xU", "5SZ", "62P", "7kI", "4NK", "C6", "VW", "2nj", "1Kh", "54N", "6UD", 
+"6ZE", "4of", "0TH", "3r", "YV", "L7", "4AJ", "60a", "6yY", "4Lz", "0wT", "Tf", "zJ", "0Yx", "4bV", "4w7", "5lu", "4i5", "dH", "0Gz", 
+"0iV", "Jd", "5W8", "4Rx", "5Oi", "6jk", "GT", "R5", "0JJ", "ix", "6DG", "45l", "5nD", "6KF", "fy", "0EK", "0kg", "HU", "6ej", "4PI", 
+"5MX", "5X9", "Ee", "0fW", "1XZ", "kI", "4f4", "4sU", "00w", "WM", "4Z0", "4OQ", "55T", "hgu", "ya", "0ZS", "a0", "0Y", "6Yn", "4lM", 
+"4Ba", "63J", "2Ll", "0yO", "02F", "2Cm", "6xC", "aG0", "4cL", "6Vo", "2mA", "n1", "0UR", "2h", "a5E", "bTO", "5Pq", "4U1", "XL", "86n", 
+"FN", "11U", "5Ns", "4K3", "516", "44v", "0KP", "hb", "eR", "p3", "49F", "6Hm", "6fA", "4Sb", "0hL", "3MN", "w", "0gM", "5LB", "7ya", 
+"6Gl", "46G", "0Ia", "jS", "gc", "0DQ", "bEL", "hyw", "4D2", "4QS", "8ce", "IO", "0m0", "0xQ", "byL", "62T", "4x2", "4mS", "227", "1G", 
+"2nn", "1Kl", "54J", "7Ea", "7kM", "4NO", "C2", "VS", "YR", "L3", "4AN", "60e", "6ZA", "4ob", "0TL", "3v", "zN", "8Pd", "4bR", "4w3", 
+"aSO", "b2E", "03X", "Tb", "0iR", "3LP", "73v", "666", "48X", "4i1", "dL", "8Nf", "0JN", "3oL", "6DC", "45h", "5Om", "6jo", "GP", "R1", 
+"0kc", "HQ", "6en", "4PM", "a09", "6KB", "24d", "0EO", "8Ag", "kM", "4f0", "47Y", "697", "aBL", "Ea", "0fS", "4ay", "5d9", "ye", "0ZW", 
+"00s", "WI", "4Z4", "4OU", "4Be", "63N", "Zy", "0yK", "a4", "tU", "6Yj", "4lI", "4cH", "6Vk", "2mE", "n5", "02B", "Ux", "6xG", "4Md", 
+"5Pu", "4U5", "XH", "86j", "0UV", "2l", "5k8", "4nx", "512", "44r", "0KT", "hf", "FJ", "0ex", "5Nw", "4K7", "6fE", "4Sf", "0hH", "Kz", 
+"eV", "p7", "49B", "6Hi", "6Gh", "46C", "0Ie", "jW", "s", "0gI", "5LF", "6iD", "4D6", "4QW", "0jy", "IK", "gg", "0DU", "5oZ", "6JX", 
+"7kA", "4NC", "01e", "3Po", "xs", "8RY", "54F", "6UL", "a6f", "59v", "0Vq", "1K", "d3E", "85M", "4Cs", "5F3", "5I2", "4Lr", "03T", "Tn", 
+"zB", "0Yp", "56w", "437", "6ZM", "4on", "1Da", "3z", "2OO", "0zl", "4AB", "60i", "5Oa", "6jc", "2QM", "0dn", "0JB", "ip", "6DO", "45d", 
+"48T", "acm", "1B2", "0Gr", "94o", "Jl", "5W0", "4Rp", "5MP", "5X1", "Em", "12v", "0Hs", "kA", "all", "47U", "5nL", "6KN", "fq", "0EC", 
+"0ko", "3Nm", "6eb", "4PA", "a8", "0Q", "6Yf", "4lE", "4Bi", "63B", "Zu", "0yG", "0tw", "WE", "4Z8", "4OY", "4au", "5d5", "yi", "1Jz", 
+"0UZ", "vh", "5k4", "4nt", "5Py", "4U9", "XD", "1kW", "02N", "Ut", "6xK", "4Mh", "4cD", "6Vg", "2mI", "n9", "eZ", "43", "49N", "6He", 
+"6fI", "4Sj", "0hD", "Kv", "FF", "0et", "7n9", "6ky", "5u6", "4pv", "0KX", "hj", "gk", "0DY", "5oV", "5z7", "6dx", "5Az", "0ju", "IG", 
+"Dw", "0gE", "5LJ", "6iH", "6Gd", "46O", "0Ii", "28B", "xw", "1Kd", "54B", "6UH", "7kE", "4NG", "01a", "3Pk", "0m8", "0xY", "4Cw", "5F7", 
+"6Xx", "59r", "0Vu", "1O", "zF", "0Yt", "4bZ", "433", "5I6", "4Lv", "03P", "Tj", "YZ", "0zh", "4AF", "60m", "6ZI", "4oj", "0TD", "wv", 
+"0JF", "it", "6DK", "4qh", "5Oe", "6jg", "GX", "R9", "0iZ", "Jh", "5W4", "4Rt", "48P", "4i9", "dD", "0Gv", "0Hw", "kE", "4f8", "47Q", 
+"5MT", "5X5", "Ei", "12r", "0kk", "HY", "6ef", "4PE", "5nH", "6KJ", "fu", "0EG", "4Bm", "63F", "Zq", "0yC", "0Wo", "0U", "6Yb", "4lA", 
+"4aq", "5d1", "ym", "8SG", "0ts", "WA", "aPl", "b1f", "747", "61w", "2NQ", "1kS", "9Lg", "2d", "5k0", "4np", "57i", "6Vc", "2mM", "0Xn", 
+"02J", "Up", "6xO", "4Ml", "6fM", "4Sn", "1xa", "Kr", "27G", "47", "49J", "6Ha", "5u2", "44z", "8BD", "hn", "FB", "0ep", "bdm", "aAo", 
+"70U", "bkl", "0jq", "IC", "go", "306", "5oR", "5z3", "7WA", "46K", "0Im", "28F", "Ds", "0gA", "5LN", "6iL", "0cY", "020", "6mT", "4Xw", 
+"42S", "6Cx", "nG", "0Mu", "1Pd", "cw", "6NH", "5kJ", "4UG", "74M", "3Kk", "0ni", "0ah", "BZ", "6oe", "4ZF", "40b", "6AI", "lv", "0OD", 
+"0Bt", "aF", "6Ly", "4yZ", "4Wv", "5R6", "Oj", "0lX", "Qh", "06R", "4It", "5L4", "461", "4gX", "1LW", "1Y6", "rt", "0QF", "4jh", "7Oj", 
+"65o", "4DD", "I9", "2JI", "SY", "F8", "4KE", "7nG", "6PJ", "4ei", "1Nf", "2kd", "4M", "0Sw", "4hY", "490", "5C5", "4Fu", "09S", "2Hx", 
+"6OR", "4zq", "354", "bm", "LA", "0os", "bnn", "75W", "6lN", "4Ym", "0bC", "Aq", "2yL", "0Lo", "43I", "6Bb", "6Mc", "5ha", "15", "22E", 
+"Np", "0mB", "4Vl", "6cO", "aDm", "bao", "1pS", "1e2", "ml", "8GF", "41x", "548", "4kr", "5n2", "7f", "8YD", "1nQ", "2KS", "64u", "715", 
+"4Hn", "69E", "Pr", "07H", "1MM", "2hO", "6Sa", "4fB", "4iC", "7LA", "5W", "0Rm", "08I", "2Ib", "66D", "4Go", "b4d", "aUn", "RC", "05y", 
+"8VE", "8g", "5a3", "4ds", "42W", "ain", "nC", "0Mq", "17t", "024", "6mP", "4Xs", "4UC", "74I", "3Ko", "0nm", "8IY", "cs", "6NL", "5kN", 
+"40f", "6AM", "lr", "8FX", "0al", "2TO", "6oa", "4ZB", "4Wr", "5R2", "On", "18u", "0Bp", "aB", "afo", "bCm", "465", "53u", "1LS", "1Y2", 
+"Ql", "06V", "4Ip", "5L0", "65k", "5Ta", "1oO", "2JM", "6x", "0QB", "4jl", "7On", "6PN", "4em", "1Nb", "9y", "2EL", "04g", "4KA", "7nC", 
+"5C1", "4Fq", "09W", "d6G", "4I", "0Ss", "bRn", "494", "LE", "0ow", "4TY", "4A8", "6OV", "4zu", "1Qz", "bi", "oY", "z8", "43M", "6Bf", 
+"6lJ", "4Yi", "0bG", "Au", "Nt", "0mF", "4Vh", "6cK", "6Mg", "4xD", "11", "22A", "mh", "0NZ", "4ut", "5p4", "4N9", "5Ky", "1pW", "CD", 
+"1nU", "2KW", "64q", "4EZ", "4kv", "5n6", "7b", "0PX", "1MI", "2hK", "6Se", "4fF", "4Hj", "69A", "Pv", "07L", "08M", "2If", "6rH", "4Gk", 
+"4iG", "7LE", "5S", "0Ri", "1Ox", "8c", "5a7", "4dw", "5Zz", "7oY", "RG", "0qu", "1Pl", "21f", "adR", "5kB", "4UO", "74E", "MS", "X2", 
+"0cQ", "028", "79u", "bbL", "4vS", "4c2", "nO", "8De", "8Kd", "aN", "4l3", "4yR", "634", "76t", "Ob", "0lP", "W3", "BR", "6om", "4ZN", 
+"40j", "6AA", "2zo", "0OL", "6t", "0QN", "5zA", "7Ob", "65g", "4DL", "I1", "2JA", "0g3", "06Z", "b7G", "68W", "469", "4gP", "284", "dSn", 
+"4E", "275", "4hQ", "498", "67V", "b8F", "1mr", "0h2", "SQ", "F0", "4KM", "7nO", "6PB", "4ea", "1Nn", "9u", "6lF", "4Ye", "0bK", "Ay", 
+"oU", "z4", "43A", "6Bj", "6OZ", "4zy", "0AW", "be", "LI", "2O9", "4TU", "4A4", "4N5", "5Ku", "14S", "CH", "md", "0NV", "41p", "540", 
+"6Mk", "4xH", "u5", "22M", "Nx", "0mJ", "4Vd", "6cG", "4Hf", "69M", "Pz", "0sH", "k7", "2hG", "6Si", "4fJ", "4kz", "7Nx", "7n", "0PT", 
+"1nY", "dqh", "4P7", "4EV", "4JW", "7oU", "RK", "05q", "1Ot", "8o", "6QX", "50R", "4iK", "7LI", "qW", "d6", "08A", "2Ij", "66L", "4Gg", 
+"4UK", "74A", "MW", "X6", "1Ph", "21b", "6ND", "5kF", "4vW", "4c6", "nK", "0My", "0cU", "0v4", "6mX", "5HZ", "4Wz", "6bY", "Of", "0lT", 
+"0Bx", "aJ", "4l7", "4yV", "40n", "6AE", "lz", "0OH", "W7", "BV", "6oi", "4ZJ", "65c", "4DH", "I5", "2JE", "6p", "0QJ", "4jd", "7Of", 
+"4r5", "4gT", "280", "2iY", "Qd", "0rV", "4Ix", "5L8", "5C9", "4Fy", "1mv", "0h6", "4A", "1CZ", "4hU", "7MW", "6PF", "4ee", "1Nj", "9q", 
+"SU", "F4", "4KI", "7nK", "oQ", "z0", "43E", "6Bn", "6lB", "4Ya", "0bO", "2Wl", "LM", "8fg", "4TQ", "4A0", "aeL", "cPo", "0AS", "ba", 
+"3kP", "0NR", "41t", "544", "4N1", "5Kq", "14W", "CL", "2Xm", "0mN", "5FA", "6cC", "6Mo", "4xL", "19", "22I", "k3", "2hC", "6Sm", "4fN", 
+"4Hb", "69I", "2Fo", "07D", "83l", "d5d", "4P3", "4ER", "bQM", "a0G", "7j", "0PP", "1Op", "8k", "hbw", "50V", "4JS", "7oQ", "RO", "05u", 
+"08E", "2In", "66H", "4Gc", "4iO", "7LM", "qS", "d2", "0ay", "BK", "4O6", "4ZW", "40s", "553", "lg", "0OU", "t6", "aW", "6Lh", "4yK", 
+"4Wg", "6bD", "2Yj", "0lI", "0cH", "2Vk", "6mE", "4Xf", "42B", "6Ci", "nV", "0Md", "1Pu", "cf", "6NY", "bAI", "4UV", "7pT", "MJ", "0nx", 
+"SH", "04r", "4KT", "7nV", "azI", "4ex", "1Nw", "9l", "pT", "e5", "4hH", "7MJ", "67O", "4Fd", "09B", "2Hi", "Qy", "06C", "4Ie", "68N", 
+"6Rj", "4gI", "j4", "2iD", "6m", "0QW", "4jy", "5o9", "4Q4", "4DU", "1oZ", "2JX", "4m0", "4xQ", "8Jg", "22T", "Na", "0mS", "627", "77w", 
+"6nn", "5Kl", "V0", "CQ", "3kM", "0NO", "41i", "7Pc", "6OC", "5jA", "0AN", "20e", "LP", "Y1", "4TL", "6ao", "78v", "bcO", "0bR", "0w3", 
+"oL", "8Ef", "43X", "4b1", "4iR", "7LP", "5F", "266", "08X", "0i1", "66U", "b9E", "4JN", "7oL", "RR", "G3", "1Om", "8v", "6QA", "4db", 
+"4kc", "7Na", "7w", "0PM", "H2", "2KB", "64d", "4EO", "b6D", "69T", "Pc", "07Y", "297", "dRm", "4s2", "4fS", "40w", "557", "lc", "0OQ", 
+"15T", "BO", "4O2", "4ZS", "4Wc", "76i", "2Yn", "0lM", "t2", "aS", "6Ll", "4yO", "42F", "6Cm", "nR", "8Dx", "0cL", "2Vo", "6mA", "4Xb", 
+"4UR", "74X", "MN", "8gd", "1Pq", "cb", "adO", "bAM", "azM", "51U", "1Ns", "9h", "SL", "04v", "4KP", "7nR", "67K", "5VA", "09F", "2Hm", 
+"4X", "e1", "4hL", "7MN", "6Rn", "4gM", "j0", "3ya", "2Gl", "06G", "4Ia", "68J", "4Q0", "4DQ", "82o", "d4g", "6i", "0QS", "bPN", "a1D", 
+"Ne", "0mW", "4Vy", "5S9", "4m4", "4xU", "1SZ", "22P", "my", "0NK", "41m", "7Pg", "6nj", "5Kh", "V4", "CU", "LT", "Y5", "4TH", "6ak", 
+"6OG", "4zd", "0AJ", "bx", "oH", "0Lz", "4wT", "4b5", "78r", "4Yx", "0bV", "Ad", "1lu", "0i5", "66Q", "4Gz", "4iV", "7LT", "5B", "0Rx", 
+"1Oi", "8r", "6QE", "4df", "4JJ", "7oH", "RV", "G7", "H6", "2KF", "6ph", "4EK", "4kg", "7Ne", "7s", "0PI", "1MX", "1X9", "4s6", "4fW", 
+"5XZ", "69P", "Pg", "0sU", "06", "23F", "afr", "4yC", "4Wo", "6bL", "Os", "0lA", "0aq", "BC", "aEn", "c4E", "4ts", "5q3", "lo", "8FE", 
+"347", "cn", "6NQ", "5kS", "bom", "74T", "MB", "0np", "17i", "2Vc", "6mM", "4Xn", "42J", "6Ca", "2xO", "0Ml", "4T", "0Sn", "5xa", "7MB", 
+"67G", "4Fl", "09J", "2Ha", "1u2", "04z", "b5g", "aTm", "6PS", "4ep", "8WF", "9d", "6e", "8XG", "4jq", "5o1", "65v", "706", "1oR", "1z3", 
+"Qq", "06K", "4Im", "68F", "6Rb", "4gA", "1LN", "2iL", "6nf", "5Kd", "V8", "CY", "mu", "0NG", "41a", "7Pk", "4m8", "4xY", "0Cw", "1F7", 
+"Ni", "19r", "4Vu", "5S5", "6lW", "4Yt", "0bZ", "Ah", "oD", "0Lv", "43P", "4b9", "6OK", "4zh", "0AF", "bt", "LX", "Y9", "4TD", "6ag", 
+"4JF", "7oD", "RZ", "0qh", "1Oe", "2jg", "6QI", "4dj", "4iZ", "483", "5N", "0Rt", "08P", "0i9", "5B6", "4Gv", "4Hw", "5M7", "Pk", "07Q", 
+"1MT", "1X5", "472", "52r", "4kk", "7Ni", "sw", "0PE", "1nH", "2KJ", "64l", "4EG", "4Wk", "6bH", "Ow", "0lE", "02", "23B", "6Ld", "4yG", 
+"4tw", "5q7", "lk", "0OY", "0au", "BG", "6ox", "5Jz", "4UZ", "74P", "MF", "0nt", "1Py", "cj", "6NU", "5kW", "42N", "6Ce", "nZ", "0Mh", 
+"0cD", "2Vg", "6mI", "4Xj", "67C", "4Fh", "09N", "2He", "4P", "e9", "4hD", "7MF", "6PW", "4et", "3n9", "2ky", "SD", "0pv", "4KX", "7nZ", 
+"4Q8", "4DY", "1oV", "1z7", "6a", "1Az", "4ju", "5o5", "6Rf", "4gE", "j8", "2iH", "Qu", "06O", "4Ii", "68B", "mq", "0NC", "41e", "7Po", 
+"6nb", "bar", "14F", "2UL", "Nm", "19v", "4Vq", "5S1", "agl", "bBn", "0Cs", "1F3", "1I2", "0Lr", "43T", "ahm", "6lS", "4Yp", "16w", "Al", 
+"2ZM", "0on", "5Da", "6ac", "6OO", "4zl", "0AB", "bp", "1Oa", "8z", "6QM", "4dn", "4JB", "aUs", "2DO", "05d", "08T", "d7D", "5B2", "4Gr", 
+"bSm", "487", "5J", "0Rp", "1MP", "1X1", "476", "52v", "4Hs", "5M3", "Po", "07U", "1nL", "2KN", "64h", "4EC", "4ko", "7Nm", "ss", "0PA", 
+"QJ", "06p", "4IV", "7lT", "6RY", "4gz", "1Lu", "0I5", "rV", "g7", "4jJ", "7OH", "65M", "4Df", "1oi", "2Jk", "2Ej", "04A", "4Kg", "7ne", 
+"6Ph", "4eK", "h6", "2kF", "4o", "0SU", "5xZ", "7My", "4S6", "4FW", "09q", "1x9", "17R", "2VX", "4M4", "4XU", "42q", "571", "ne", "0MW", 
+"v4", "cU", "6Nj", "5kh", "4Ue", "74o", "My", "0nK", "0aJ", "Bx", "6oG", "4Zd", "4tH", "6Ak", "lT", "y5", "0BV", "ad", "580", "4yx", 
+"4WT", "4B5", "OH", "0lz", "4kP", "7NR", "7D", "244", "1ns", "0k3", "64W", "con", "4HL", "69g", "PP", "E1", "1Mo", "2hm", "6SC", "52I", 
+"4ia", "7Lc", "5u", "0RO", "J0", "3Ya", "66f", "4GM", "b4F", "aUL", "Ra", "0qS", "8Vg", "8E", "458", "4dQ", "4o2", "4zS", "8He", "bO", 
+"Lc", "0oQ", "605", "75u", "6ll", "4YO", "T2", "AS", "2yn", "0LM", "43k", "7Ra", "6MA", "4xb", "0CL", "22g", "NR", "19I", "4VN", "6cm", 
+"aDO", "baM", "14y", "Cb", "mN", "8Gd", "41Z", "7PP", "axO", "53W", "1Lq", "0I1", "QN", "06t", "4IR", "68y", "65I", "4Db", "1om", "2Jo", 
+"6Z", "g3", "4jN", "7OL", "6Pl", "4eO", "h2", "2kB", "2En", "04E", "4Kc", "7na", "4S2", "4FS", "09u", "d6e", "4k", "0SQ", "bRL", "a3F", 
+"42u", "575", "na", "0MS", "17V", "dlo", "4M0", "4XQ", "4Ua", "74k", "3KM", "0nO", "28", "cQ", "6Nn", "5kl", "40D", "6Ao", "lP", "y1", 
+"0aN", "2Tm", "6oC", "5JA", "4WP", "4B1", "OL", "18W", "0BR", "0W3", "584", "bCO", "1nw", "0k7", "64S", "4Ex", "4kT", "7NV", "sH", "0Pz", 
+"1Mk", "2hi", "6SG", "4fd", "4HH", "69c", "PT", "E5", "J4", "2ID", "66b", "4GI", "4ie", "7Lg", "5q", "0RK", "1OZ", "8A", "4q4", "4dU", 
+"4Jy", "5O9", "Re", "0qW", "Lg", "0oU", "5DZ", "6aX", "4o6", "4zW", "0Ay", "bK", "2yj", "0LI", "43o", "6BD", "6lh", "4YK", "T6", "AW", 
+"NV", "0md", "4VJ", "6ci", "6ME", "4xf", "0CH", "22c", "mJ", "0Nx", "4uV", "7PT", "6nY", "baI", "1pu", "Cf", "6V", "0Ql", "4jB", "aus", 
+"65E", "4Dn", "1oa", "2Jc", "QB", "06x", "b7e", "68u", "5b2", "4gr", "8UD", "dSL", "4g", "8ZE", "4hs", "5m3", "67t", "724", "09y", "1x1", 
+"Ss", "04I", "4Ko", "7nm", "azr", "4eC", "1NL", "9W", "24", "21D", "6Nb", "bAr", "4Um", "74g", "Mq", "0nC", "0cs", "1f3", "79W", "bbn", 
+"42y", "579", "nm", "394", "365", "al", "588", "4yp", "bmo", "76V", "1i2", "0lr", "0aB", "Bp", "6oO", "4Zl", "40H", "6Ac", "2zM", "0On", 
+"4HD", "69o", "PX", "E9", "1Mg", "2he", "6SK", "4fh", "4kX", "7NZ", "7L", "0Pv", "3N9", "2Ky", "6pW", "4Et", "4Ju", "5O5", "Ri", "05S", 
+"1OV", "8M", "450", "4dY", "4ii", "7Lk", "qu", "0RG", "J8", "2IH", "66n", "4GE", "6ld", "4YG", "0bi", "2WJ", "ow", "0LE", "43c", "6BH", 
+"6Ox", "5jz", "0Au", "bG", "Lk", "0oY", "4Tw", "5Q7", "6nU", "5KW", "14q", "Cj", "mF", "0Nt", "41R", "7PX", "6MI", "4xj", "0CD", "22o", 
+"NZ", "0mh", "4VF", "6ce", "65A", "4Dj", "1oe", "2Jg", "6R", "0Qh", "4jF", "7OD", "5b6", "4gv", "1Ly", "0I9", "QF", "0rt", "4IZ", "68q", 
+"67p", "5Vz", "1mT", "1x5", "4c", "0SY", "4hw", "5m7", "6Pd", "4eG", "1NH", "9S", "Sw", "04M", "4Kk", "7ni", "4Ui", "74c", "Mu", "0nG", 
+"20", "cY", "6Nf", "5kd", "4vu", "5s5", "ni", "390", "0cw", "1f7", "4M8", "4XY", "4WX", "4B9", "OD", "0lv", "0BZ", "ah", "6LW", "4yt", 
+"40L", "6Ag", "lX", "y9", "0aF", "Bt", "6oK", "4Zh", "1Mc", "2ha", "6SO", "4fl", "5Xa", "69k", "2FM", "07f", "83N", "d5F", "6pS", "4Ep", 
+"bQo", "a0e", "7H", "0Pr", "1OR", "8I", "454", "50t", "4Jq", "5O1", "Rm", "05W", "08g", "2IL", "66j", "4GA", "4im", "7Lo", "5y", "0RC", 
+"os", "0LA", "43g", "6BL", "78I", "4YC", "0bm", "2WN", "Lo", "8fE", "4Ts", "5Q3", "aen", "cPM", "0Aq", "bC", "mB", "0Np", "41V", "ajo", 
+"6nQ", "5KS", "14u", "Cn", "2XO", "0ml", "4VB", "6ca", "6MM", "4xn", "1Sa", "22k", "Sj", "04P", "4Kv", "5N6", "443", "4eZ", "1NU", "9N", 
+"pv", "0SD", "4hj", "7Mh", "67m", "4FF", "1mI", "2HK", "2GJ", "2", "4IG", "68l", "6RH", "4gk", "1Ld", "2if", "6O", "0Qu", "5zz", "7OY", 
+"5A7", "4Dw", "1ox", "0j8", "15r", "Bi", "6oV", "4Zu", "40Q", "4a8", "lE", "0Ow", "0BG", "au", "6LJ", "4yi", "4WE", "6bf", "OY", "Z8", 
+"U9", "2VI", "6mg", "4XD", "4vh", "6CK", "nt", "0MF", "1PW", "cD", "4n9", "5ky", "4Ut", "5P4", "Mh", "0nZ", "4ip", "5l0", "5d", "9Kg", 
+"08z", "1y2", "66w", "737", "4Jl", "7on", "Rp", "05J", "1OO", "8T", "6Qc", "50i", "4kA", "7NC", "7U", "0Po", "1nb", "dqS", "64F", "4Em", 
+"b6f", "69v", "PA", "0ss", "8TG", "dRO", "5c1", "4fq", "6MP", "4xs", "376", "22v", "NC", "0mq", "bll", "77U", "6nL", "5KN", "14h", "Cs", 
+"3ko", "0Nm", "41K", "7PA", "6Oa", "4zB", "37", "20G", "Lr", "8fX", "4Tn", "6aM", "78T", "bcm", "0bp", "AB", "on", "387", "43z", "5r2", 
+"447", "51w", "1NQ", "9J", "Sn", "04T", "4Kr", "5N2", "67i", "4FB", "09d", "2HO", "4z", "1Ca", "4hn", "7Ml", "6RL", "4go", "8UY", "2ib", 
+"2GN", "6", "4IC", "68h", "5A3", "4Ds", "82M", "d4E", "6K", "0Qq", "bPl", "a1f", "40U", "akl", "lA", "0Os", "15v", "Bm", "6oR", "4Zq", 
+"4WA", "6bb", "2YL", "0lo", "0BC", "aq", "6LN", "4ym", "42d", "6CO", "np", "0MB", "0cn", "2VM", "6mc", "5Ha", "4Up", "5P0", "Ml", "8gF", 
+"1PS", "1E2", "adm", "bAo", "1lW", "1y6", "4R9", "4GX", "4it", "5l4", "qh", "0RZ", "i9", "8P", "6Qg", "4dD", "4Jh", "7oj", "Rt", "05N", 
+"1nf", "2Kd", "64B", "4Ei", "4kE", "7NG", "7Q", "f8", "1Mz", "2hx", "5c5", "4fu", "4HY", "69r", "PE", "0sw", "NG", "0mu", "5Fz", "6cx", 
+"6MT", "4xw", "0CY", "0V8", "3kk", "0Ni", "41O", "7PE", "6nH", "5KJ", "14l", "Cw", "Lv", "0oD", "4Tj", "6aI", "6Oe", "4zF", "33", "bZ", 
+"oj", "0LX", "4wv", "5r6", "6ly", "4YZ", "0bt", "AF", "4v", "0SL", "4hb", "awS", "67e", "4FN", "K3", "2HC", "Sb", "04X", "b5E", "aTO", 
+"4p3", "4eR", "8Wd", "9F", "6G", "257", "4jS", "7OQ", "65T", "cnm", "1op", "0j0", "QS", "D2", "4IO", "68d", "7Ba", "4gc", "1Ll", "2in", 
+"0BO", "23d", "6LB", "4ya", "4WM", "6bn", "OQ", "Z0", "0aS", "Ba", "aEL", "c4g", "40Y", "4a0", "lM", "8Fg", "8If", "cL", "4n1", "5kq", 
+"616", "74v", "3KP", "0nR", "U1", "2VA", "6mo", "4XL", "42h", "6CC", "2xm", "0MN", "4Jd", "7of", "Rx", "05B", "i5", "2jE", "6Qk", "4dH", 
+"4ix", "5l8", "5l", "0RV", "08r", "2IY", "4R5", "4GT", "4HU", "7mW", "PI", "07s", "1Mv", "0H6", "5c9", "4fy", "4kI", "7NK", "sU", "f4", 
+"1nj", "2Kh", "64N", "4Ee", "6nD", "5KF", "1ph", "2Uj", "mW", "x6", "41C", "7PI", "593", "5hZ", "0CU", "0V4", "NK", "0my", "4VW", "4C6", 
+"4L7", "4YV", "0bx", "AJ", "of", "0LT", "43r", "562", "6Oi", "4zJ", "w7", "bV", "Lz", "0oH", "4Tf", "6aE", "67a", "4FJ", "K7", "2HG", 
+"4r", "0SH", "4hf", "7Md", "4p7", "4eV", "1NY", "9B", "Sf", "0pT", "4Kz", "7nx", "65P", "5TZ", "1ot", "0j4", "6C", "0Qy", "4jW", "7OU", 
+"6RD", "4gg", "1Lh", "2ij", "QW", "D6", "4IK", "7lI", "4WI", "6bj", "OU", "Z4", "0BK", "ay", "6LF", "4ye", "4tU", "4a4", "lI", "2o9", 
+"0aW", "Be", "6oZ", "4Zy", "4Ux", "5P8", "Md", "0nV", "8Ib", "cH", "4n5", "5ku", "42l", "6CG", "nx", "0MJ", "U5", "2VE", "6mk", "4XH", 
+"i1", "8X", "6Qo", "4dL", "5ZA", "7ob", "2Dm", "05F", "08v", "d7f", "4R1", "4GP", "bSO", "a2E", "5h", "0RR", "1Mr", "0H2", "ayL", "52T", 
+"4HQ", "69z", "PM", "07w", "1nn", "2Kl", "64J", "4Ea", "4kM", "7NO", "7Y", "f0", "mS", "x2", "41G", "7PM", "aDR", "5KB", "14d", "2Un", 
+"NO", "19T", "4VS", "4C2", "597", "bBL", "0CQ", "0V0", "ob", "0LP", "43v", "566", "4L3", "4YR", "16U", "AN", "2Zo", "0oL", "4Tb", "6aA", 
+"6Om", "4zN", "w3", "bR", "4oT", "4z5", "wH", "0Tz", "0zV", "Yd", "5D8", "4Ax", "4LH", "6yk", "TT", "A5", "0YJ", "zx", "6WG", "4bd", 
+"4me", "6XF", "1q", "0VK", "N4", "2MD", "62b", "4CI", "4Ny", "5K9", "Ve", "0uW", "1KZ", "xI", "4u4", "5pt", "4k6", "5nv", "0Ey", "fK", 
+"Hg", "0kU", "641", "6eX", "6hh", "5Mj", "P6", "EW", "29b", "0HI", "47o", "6FD", "6IE", "48n", "0GH", "dz", "JV", "0id", "4RJ", "6gi", 
+"6jY", "beI", "0dT", "Gf", "iJ", "0Jx", "4qV", "4d7", "UN", "02t", "4MR", "4X3", "a8G", "57W", "0XP", "0M1", "2Z", "c3", "4nN", "7KL", 
+"61I", "5PC", "1km", "2No", "2An", "00E", "4Oc", "7ja", "6Tl", "4aO", "l2", "yS", "0k", "0WQ", "58V", "a7F", "4W2", "4BS", "84m", "ZO", 
+"13V", "E", "4I0", "5Lp", "46u", "535", "ja", "0IS", "68", "gQ", "6Jn", "5ol", "4Qa", "6dB", "3OM", "0jO", "0eN", "2Pm", "6kC", "5NA", 
+"44D", "6Eo", "hP", "99", "0FR", "0S3", "abM", "49t", "4SP", "4F1", "KL", "8af", "0zR", "0o3", "60W", "ckn", "4oP", "4z1", "3D", "204", 
+"0YN", "2lm", "6WC", "56I", "4LL", "6yo", "TP", "A1", "N0", "903", "62f", "4CM", "4ma", "6XB", "1u", "0VO", "8Rg", "xM", "418", "54x", 
+"b0F", "aQL", "Va", "0uS", "Hc", "0kQ", "645", "71u", "4k2", "5nr", "8Le", "fO", "29f", "0HM", "47k", "7Va", "6hl", "5Mn", "P2", "ES", 
+"JR", "1yA", "4RN", "6gm", "6IA", "48j", "0GL", "26g", "iN", "8Cd", "45Z", "4d3", "hYv", "beM", "0dP", "Gb", "6VY", "4cz", "0XT", "0M5", 
+"UJ", "02p", "4MV", "4X7", "61M", "5PG", "1ki", "Xz", "vV", "c7", "4nJ", "7KH", "6Th", "4aK", "l6", "yW", "2Aj", "00A", "4Og", "6zD", 
+"4W6", "4BW", "0yy", "ZK", "0o", "0WU", "58R", "6YX", "46q", "531", "je", "0IW", "13R", "A", "4I4", "5Lt", "4Qe", "6dF", "Iy", "0jK", 
+"r4", "gU", "6Jj", "5oh", "4pH", "6Ek", "hT", "0Kf", "0eJ", "Fx", "6kG", "5NE", "4ST", "4F5", "KH", "0hz", "0FV", "ed", "5x8", "49p", 
+"bvs", "6yc", "2BM", "03f", "0YB", "zp", "6WO", "4bl", "bUo", "a4e", "3H", "0Tr", "87N", "Yl", "5D0", "4Ap", "4Nq", "5K1", "Vm", "01W", 
+"1KR", "xA", "414", "54t", "4mm", "6XN", "1y", "0VC", "0xo", "2ML", "62j", "4CA", "7xA", "5Mb", "0fm", "2SN", "ks", "0HA", "47g", "6FL", 
+"aan", "bDl", "0Eq", "fC", "Ho", "8bE", "4Ps", "5U3", "5Z2", "5OS", "10u", "Gn", "iB", "0Jp", "45V", "ano", "6IM", "48f", "1Wa", "dr", 
+"3Ln", "0il", "4RB", "6ga", "2R", "0Uh", "4nF", "7KD", "61A", "5PK", "1ke", "Xv", "UF", "0vt", "4MZ", "6xy", "5f6", "4cv", "0XX", "0M9", 
+"0c", "0WY", "4lw", "5i7", "63p", "5Rz", "0yu", "ZG", "Ww", "00M", "4Ok", "6zH", "6Td", "4aG", "0Zi", "2oJ", "60", "gY", "6Jf", "5od", 
+"4Qi", "6dJ", "Iu", "0jG", "0gw", "M", "4I8", "5Lx", "4ru", "5w5", "ji", "1Yz", "0FZ", "eh", "5x4", "5mU", "4SX", "4F9", "KD", "0hv", 
+"0eF", "Ft", "6kK", "5NI", "44L", "6Eg", "hX", "91", "0YF", "zt", "6WK", "4bh", "4LD", "6yg", "TX", "A9", "0zZ", "Yh", "5D4", "4At", 
+"4oX", "4z9", "3L", "0Tv", "1KV", "xE", "410", "54p", "4Nu", "5K5", "Vi", "01S", "N8", "2MH", "62n", "4CE", "4mi", "6XJ", "uu", "0VG", 
+"kw", "0HE", "47c", "6FH", "6hd", "5Mf", "0fi", "2SJ", "Hk", "0kY", "4Pw", "5U7", "6Kx", "5nz", "0Eu", "fG", "iF", "0Jt", "45R", "6Dy", 
+"5Z6", "5OW", "0dX", "Gj", "JZ", "0ih", "4RF", "6ge", "6II", "48b", "0GD", "dv", "61E", "5PO", "1ka", "Xr", "2V", "0Ul", "4nB", "aqs", 
+"5f2", "4cr", "8QD", "39V", "UB", "02x", "795", "aRo", "63t", "764", "0yq", "ZC", "0g", "9Nd", "4ls", "5i3", "7DA", "4aC", "0Zm", "2oN", 
+"Ws", "00I", "4Oo", "6zL", "4Qm", "6dN", "Iq", "0jC", "64", "25D", "6Jb", "bEr", "46y", "539", "jm", "9Pf", "0gs", "I", "aCl", "bfn", 
+"bio", "72V", "1m2", "0hr", "325", "el", "5x0", "49x", "44H", "6Ec", "3nl", "95", "0eB", "Fp", "6kO", "5NM", "4mt", "5h4", "uh", "0VZ", 
+"0xv", "2MU", "4V9", "4CX", "4Nh", "7kj", "Vt", "01N", "m9", "xX", "6Ug", "54m", "4oE", "6Zf", "3Q", "b8", "0zG", "Yu", "60B", "4Ai", 
+"4LY", "4Y8", "TE", "0ww", "1Iz", "zi", "5g5", "4bu", "5y7", "5lV", "0GY", "dk", "JG", "0iu", "5Bz", "6gx", "6jH", "5OJ", "0dE", "Gw", 
+"3ok", "82", "45O", "6Dd", "6Ke", "5ng", "73", "fZ", "Hv", "0kD", "4Pj", "6eI", "6hy", "7m9", "0ft", "EF", "kj", "0HX", "4sv", "5v6", 
+"Wn", "00T", "4Or", "5J2", "407", "55w", "0Zp", "yB", "0z", "1Ga", "4ln", "6YM", "63i", "4BB", "0yl", "2LO", "2CN", "02e", "4MC", "7hA", 
+"6VL", "4co", "0XA", "2mb", "2K", "0Uq", "bTl", "a5f", "5E3", "5PR", "86M", "Xo", "11v", "Fm", "6kR", "5NP", "44U", "aol", "hA", "0Ks", 
+"0FC", "eq", "6HN", "49e", "4SA", "6fb", "3Mm", "0ho", "0gn", "T", "6ic", "5La", "46d", "6GO", "jp", "0IB", "0Dr", "1A2", "hyT", "bEo", 
+"4Qp", "5T0", "Il", "8cF", "0xr", "2MQ", "62w", "777", "4mp", "5h0", "1d", "9Og", "1KO", "2nM", "6Uc", "54i", "4Nl", "7kn", "Vp", "01J", 
+"0zC", "Yq", "60F", "4Am", "4oA", "6Zb", "3U", "0To", "8PG", "zm", "5g1", "4bq", "786", "aSl", "TA", "0ws", "JC", "0iq", "bhl", "73U", 
+"5y3", "5lR", "336", "do", "3oo", "86", "45K", "7TA", "6jL", "5ON", "0dA", "Gs", "Hr", "8bX", "4Pn", "6eM", "6Ka", "5nc", "77", "24G", 
+"kn", "8AD", "47z", "5v2", "aBo", "bgm", "0fp", "EB", "403", "4aZ", "0Zt", "yF", "Wj", "00P", "4Ov", "5J6", "63m", "4BF", "0yh", "ZZ", 
+"tv", "0WD", "4lj", "6YI", "6VH", "4ck", "0XE", "2mf", "2CJ", "02a", "4MG", "6xd", "5E7", "5PV", "1kx", "Xk", "2O", "0Uu", "bTh", "7KY", 
+"44Q", "4e8", "hE", "0Kw", "11r", "Fi", "6kV", "5NT", "4SE", "6ff", "KY", "0hk", "0FG", "eu", "6HJ", "49a", "4rh", "6GK", "jt", "0IF", 
+"Q9", "P", "6ig", "5Le", "4Qt", "5T4", "Ih", "0jZ", "0Dv", "gD", "4j9", "5oy", "aD0", "7kb", "3PL", "01F", "m1", "xP", "6Uo", "54e", 
+"59U", "a6E", "1h", "0VR", "85n", "196", "4V1", "4CP", "4LQ", "4Y0", "TM", "03w", "0YS", "za", "a9D", "56T", "4oM", "6Zn", "3Y", "b0", 
+"0zO", "2Ol", "60J", "4Aa", "7za", "5OB", "0dM", "2Qn", "iS", "0Ja", "45G", "6Dl", "acN", "48w", "0GQ", "dc", "JO", "94L", "4RS", "4G2", 
+"4H3", "5Ms", "12U", "EN", "kb", "0HP", "47v", "526", "6Km", "5no", "s3", "fR", "3NN", "0kL", "4Pb", "6eA", "0r", "0WH", "4lf", "6YE", 
+"63a", "4BJ", "O7", "ZV", "Wf", "0tT", "4Oz", "6zY", "4t7", "4aV", "0Zx", "yJ", "2C", "0Uy", "4nW", "7KU", "61P", "5PZ", "1kt", "Xg", 
+"UW", "02m", "4MK", "6xh", "6VD", "4cg", "0XI", "2mj", "0FK", "ey", "6HF", "49m", "4SI", "6fj", "KU", "0hg", "0eW", "Fe", "6kZ", "5NX", 
+"4pU", "4e4", "hI", "2k9", "0Dz", "gH", "4j5", "5ou", "4Qx", "5T8", "Id", "0jV", "Q5", "DT", "6ik", "5Li", "46l", "6GG", "jx", "0IJ", 
+"m5", "xT", "6Uk", "54a", "4Nd", "7kf", "Vx", "01B", "0xz", "192", "4V5", "4CT", "4mx", "5h8", "1l", "0VV", "0YW", "ze", "5g9", "4by", 
+"4LU", "4Y4", "TI", "03s", "0zK", "Yy", "60N", "4Ae", "4oI", "6Zj", "wU", "b4", "iW", "0Je", "45C", "6Dh", "6jD", "5OF", "0dI", "2Qj", 
+"JK", "0iy", "4RW", "4G6", "6IX", "48s", "0GU", "dg", "kf", "0HT", "47r", "522", "4H7", "5Mw", "0fx", "EJ", "Hz", "0kH", "4Pf", "6eE", 
+"6Ki", "5nk", "s7", "fV", "63e", "4BN", "O3", "ZR", "0v", "0WL", "4lb", "6YA", "4t3", "4aR", "8Sd", "yN", "Wb", "00X", "b1E", "aPO", 
+"61T", "bzL", "1kp", "Xc", "2G", "217", "4nS", "7KQ", "7Fa", "4cc", "0XM", "2mn", "US", "02i", "4MO", "6xl", "4SM", "6fn", "KQ", "0hc", 
+"0FO", "27d", "6HB", "49i", "44Y", "4e0", "hM", "8Bg", "0eS", "Fa", "aAL", "bdN", "656", "70v", "3OP", "0jR", "8Mf", "gL", "4j1", "5oq", 
+"46h", "6GC", "28e", "0IN", "Q1", "X", "6io", "5Lm", "6KV", "5nT", "1Uz", "fi", "HE", "0kw", "4PY", "4E8", "6hJ", "5MH", "0fG", "Eu", 
+"kY", "0Hk", "47M", "6Ff", "6Ig", "48L", "51", "dX", "Jt", "0iF", "4Rh", "6gK", "4J9", "5Oy", "0dv", "GD", "ih", "0JZ", "4qt", "5t4", 
+"4ov", "5j6", "3b", "0TX", "0zt", "YF", "60q", "4AZ", "4Lj", "6yI", "Tv", "03L", "0Yh", "zZ", "6We", "4bF", "4mG", "6Xd", "1S", "0Vi", 
+"0xE", "2Mf", "6vH", "4Ck", "bth", "7kY", "VG", "0uu", "1Kx", "xk", "5e7", "5pV", "13t", "g", "5Y3", "5LR", "46W", "amn", "jC", "0Iq", 
+"0DA", "gs", "6JL", "5oN", "4QC", "70I", "3Oo", "0jm", "0el", "2PO", "6ka", "5Nc", "44f", "6EM", "hr", "8BX", "0Fp", "eB", "abo", "49V", 
+"4Sr", "5V2", "Kn", "8aD", "Ul", "02V", "4Mp", "5H0", "425", "57u", "0Xr", "2mQ", "2x", "0UB", "4nl", "7Kn", "61k", "5Pa", "1kO", "2NM", 
+"2AL", "00g", "4OA", "6zb", "6TN", "4am", "0ZC", "yq", "0I", "0Ws", "58t", "a7d", "5G1", "4Bq", "84O", "Zm", "HA", "0ks", "bjn", "71W", 
+"6KR", "5nP", "314", "fm", "29D", "0Ho", "47I", "6Fb", "6hN", "5ML", "0fC", "Eq", "Jp", "0iB", "4Rl", "6gO", "6Ic", "48H", "55", "26E", 
+"il", "8CF", "45x", "508", "hYT", "beo", "0dr", "1a2", "0zp", "YB", "60u", "755", "4or", "5j2", "3f", "9Me", "0Yl", "2lO", "6Wa", "4bB", 
+"4Ln", "6yM", "Tr", "03H", "0xA", "2Mb", "62D", "4Co", "4mC", "7HA", "1W", "0Vm", "8RE", "xo", "5e3", "54Z", "b0d", "aQn", "VC", "01y", 
+"46S", "6Gx", "jG", "0Iu", "0gY", "c", "5Y7", "5LV", "4QG", "6dd", "3Ok", "0ji", "0DE", "gw", "6JH", "5oJ", "44b", "6EI", "hv", "0KD", 
+"0eh", "FZ", "6ke", "5Ng", "4Sv", "5V6", "Kj", "0hX", "0Ft", "eF", "6Hy", "49R", "421", "4cX", "0Xv", "2mU", "Uh", "02R", "4Mt", "5H4", 
+"61o", "5Pe", "M9", "XX", "vt", "0UF", "4nh", "7Kj", "6TJ", "4ai", "0ZG", "yu", "WY", "B8", "4OE", "6zf", "5G5", "4Bu", "1iz", "Zi", 
+"0M", "0Ww", "4lY", "4y8", "6hB", "aW1", "0fO", "2Sl", "kQ", "0Hc", "47E", "6Fn", "aaL", "bDN", "0ES", "fa", "HM", "8bg", "4PQ", "4E0", 
+"4J1", "5Oq", "10W", "GL", "3oP", "0JR", "45t", "504", "6Io", "48D", "59", "dP", "3LL", "0iN", "5BA", "6gC", "4Lb", "6yA", "2Bo", "03D", 
+"o3", "zR", "6Wm", "4bN", "bUM", "a4G", "3j", "0TP", "87l", "YN", "4T3", "4AR", "4NS", "7kQ", "VO", "01u", "1Kp", "xc", "hfw", "54V", 
+"4mO", "6Xl", "uS", "0Va", "0xM", "2Mn", "62H", "4Cc", "0DI", "25b", "6JD", "5oF", "4QK", "6dh", "IW", "0je", "0gU", "o", "6iX", "5LZ", 
+"4rW", "4g6", "jK", "0Iy", "0Fx", "eJ", "4h7", "5mw", "4Sz", "6fY", "Kf", "0hT", "S7", "FV", "6ki", "5Nk", "44n", "6EE", "hz", "0KH", 
+"2p", "0UJ", "4nd", "7Kf", "61c", "5Pi", "M5", "XT", "Ud", "0vV", "4Mx", "5H8", "4v5", "4cT", "0Xz", "2mY", "0A", "1GZ", "4lU", "4y4", 
+"5G9", "4By", "0yW", "Ze", "WU", "B4", "4OI", "6zj", "6TF", "4ae", "0ZK", "yy", "kU", "0Hg", "47A", "6Fj", "6hF", "5MD", "0fK", "Ey", 
+"HI", "2K9", "4PU", "4E4", "6KZ", "5nX", "0EW", "fe", "id", "0JV", "45p", "500", "4J5", "5Ou", "0dz", "GH", "Jx", "0iJ", "4Rd", "6gG", 
+"6Ik", "5li", "q5", "dT", "o7", "zV", "6Wi", "4bJ", "4Lf", "6yE", "Tz", "0wH", "0zx", "YJ", "4T7", "4AV", "4oz", "6ZY", "3n", "0TT", 
+"1Kt", "xg", "6UX", "54R", "4NW", "7kU", "VK", "01q", "0xI", "2Mj", "62L", "4Cg", "4mK", "6Xh", "uW", "0Ve", "4QO", "6dl", "IS", "0ja", 
+"0DM", "25f", "7Za", "5oB", "4rS", "4g2", "jO", "9PD", "0gQ", "k", "aCN", "685", "674", "72t", "Kb", "0hP", "8Od", "eN", "4h3", "49Z", 
+"44j", "6EA", "3nN", "0KL", "S3", "FR", "6km", "5No", "61g", "5Pm", "M1", "XP", "2t", "0UN", "ad0", "7Kb", "429", "4cP", "8Qf", "39t", 
+"0c3", "02Z", "b3G", "aRM", "63V", "bxN", "0yS", "Za", "0E", "235", "4lQ", "4y0", "6TB", "4aa", "0ZO", "2ol", "WQ", "B0", "4OM", "6zn", 
+"4i4", "5lt", "1WZ", "dI", "Je", "0iW", "4Ry", "5W9", "6jj", "5Oh", "R4", "GU", "iy", "0JK", "45m", "6DF", "6KG", "5nE", "0EJ", "fx", 
+"HT", "0kf", "4PH", "6ek", "5X8", "5MY", "0fV", "Ed", "kH", "0Hz", "4sT", "4f5", "4mV", "4x7", "1B", "0Vx", "0xT", "0m5", "62Q", "4Cz", 
+"4NJ", "7kH", "VV", "C7", "1Ki", "xz", "6UE", "54O", "4og", "6ZD", "3s", "0TI", "L6", "YW", "6th", "4AK", "6l9", "6yX", "Tg", "0wU", 
+"0Yy", "zK", "4w6", "4bW", "11T", "FO", "4K2", "5Nr", "44w", "517", "hc", "0KQ", "p2", "eS", "6Hl", "49G", "4Sc", "72i", "3MO", "0hM", 
+"0gL", "v", "6iA", "5LC", "46F", "6Gm", "jR", "1YA", "0DP", "gb", "hyv", "bEM", "4QR", "4D3", "IN", "8cd", "WL", "00v", "4OP", "4Z1", 
+"hgt", "55U", "0ZR", "0O3", "0X", "a1", "4lL", "6Yo", "63K", "5RA", "0yN", "2Lm", "2Cl", "02G", "4Ma", "6xB", "6Vn", "4cM", "n0", "39i", 
+"2i", "0US", "bTN", "a5D", "4U0", "5Pp", "86o", "XM", "Ja", "0iS", "667", "73w", "4i0", "48Y", "8Ng", "dM", "3oM", "0JO", "45i", "6DB", 
+"6jn", "5Ol", "R0", "GQ", "HP", "0kb", "4PL", "6eo", "6KC", "5nA", "0EN", "24e", "kL", "8Af", "47X", "4f1", "aBM", "696", "0fR", "0s3", 
+"0xP", "0m1", "62U", "byM", "4mR", "4x3", "1F", "226", "1Km", "2no", "6UA", "54K", "4NN", "7kL", "VR", "C3", "L2", "YS", "60d", "4AO", 
+"4oc", "7Ja", "3w", "0TM", "8Pe", "zO", "4w2", "4bS", "b2D", "aSN", "Tc", "03Y", "44s", "513", "hg", "0KU", "0ey", "FK", "4K6", "5Nv", 
+"4Sg", "6fD", "3MK", "0hI", "p6", "eW", "6Hh", "49C", "46B", "6Gi", "jV", "0Id", "0gH", "r", "6iE", "5LG", "4QV", "4D7", "IJ", "0jx", 
+"0DT", "gf", "6JY", "bEI", "5d8", "4ax", "0ZV", "yd", "WH", "00r", "4OT", "4Z5", "63O", "4Bd", "0yJ", "Zx", "tT", "a5", "4lH", "6Yk", 
+"6Vj", "4cI", "n4", "2mD", "Uy", "02C", "4Me", "6xF", "4U4", "5Pt", "1kZ", "XI", "2m", "0UW", "4ny", "5k9", "6jb", "ber", "0do", "2QL", 
+"iq", "0JC", "45e", "6DN", "acl", "48U", "0Gs", "dA", "Jm", "94n", "4Rq", "5W1", "5X0", "5MQ", "12w", "El", "1M2", "0Hr", "47T", "alm", 
+"6KO", "5nM", "0EB", "fp", "3Nl", "0kn", "bjs", "6ec", "4NB", "aQs", "3Pn", "01d", "1Ka", "xr", "6UM", "54G", "59w", "a6g", "1J", "0Vp", 
+"85L", "d3D", "5F2", "4Cr", "4Ls", "5I3", "To", "03U", "0Yq", "zC", "436", "56v", "4oo", "6ZL", "ws", "0TA", "0zm", "2ON", "60h", "4AC", 
+"42", "27B", "6Hd", "49O", "4Sk", "6fH", "Kw", "0hE", "0eu", "FG", "6kx", "5Nz", "4pw", "5u7", "hk", "0KY", "0DX", "gj", "5z6", "5oW", 
+"4QZ", "6dy", "IF", "0jt", "0gD", "Dv", "6iI", "5LK", "46N", "6Ge", "jZ", "0Ih", "0P", "a9", "4lD", "6Yg", "63C", "4Bh", "0yF", "Zt", 
+"WD", "0tv", "4OX", "4Z9", "5d4", "4at", "0ZZ", "yh", "2a", "1Ez", "4nu", "5k5", "4U8", "5Px", "1kV", "XE", "Uu", "02O", "4Mi", "6xJ", 
+"6Vf", "4cE", "n8", "2mH", "iu", "0JG", "45a", "6DJ", "6jf", "5Od", "R8", "GY", "Ji", "1yz", "4Ru", "5W5", "4i8", "48Q", "0Gw", "dE", 
+"kD", "0Hv", "47P", "4f9", "5X4", "5MU", "0fZ", "Eh", "HX", "0kj", "4PD", "6eg", "6KK", "5nI", "0EF", "ft", "1Ke", "xv", "6UI", "54C", 
+"4NF", "7kD", "VZ", "0uh", "0xX", "0m9", "5F6", "4Cv", "4mZ", "6Xy", "1N", "0Vt", "0Yu", "zG", "432", "56r", "4Lw", "5I7", "Tk", "03Q", 
+"0zi", "2OJ", "60l", "4AG", "4ok", "6ZH", "ww", "0TE", "4So", "6fL", "Ks", "0hA", "46", "27F", "7XA", "49K", "4ps", "5u3", "ho", "8BE", 
+"0eq", "FC", "aAn", "bdl", "bkm", "70T", "IB", "0jp", "307", "gn", "5z2", "5oS", "46J", "6Ga", "28G", "0Il", "13i", "z", "6iM", "5LO", 
+"63G", "4Bl", "0yB", "Zp", "0T", "0Wn", "58i", "6Yc", "5d0", "4ap", "8SF", "yl", "1q2", "00z", "b1g", "aPm", "61v", "746", "1kR", "XA", 
+"2e", "9Lf", "4nq", "5k1", "6Vb", "4cA", "0Xo", "2mL", "Uq", "02K", "4Mm", "6xN", "8YG", "7e", "5n1", "4kq", "716", "64v", "2KP", "1nR", 
+"07K", "Pq", "69F", "4Hm", "4fA", "6Sb", "2hL", "1MN", "0Rn", "5T", "7LB", "5ya", "4Gl", "66G", "2Ia", "08J", "05z", "1t2", "aUm", "b4g", 
+"4dp", "5a0", "8d", "8VF", "bn", "357", "4zr", "6OQ", "75T", "bnm", "0op", "LB", "Ar", "16i", "4Yn", "6lM", "6Ba", "43J", "0Ll", "2yO", 
+"22F", "16", "4xC", "agr", "6cL", "4Vo", "0mA", "Ns", "CC", "14X", "bal", "aDn", "5p3", "4us", "8GE", "mo", "5L7", "4Iw", "06Q", "Qk", 
+"1Y5", "1LT", "53r", "462", "7Oi", "4jk", "0QE", "rw", "2JJ", "1oH", "4DG", "65l", "7nD", "4KF", "0ph", "SZ", "2kg", "1Ne", "4ej", "6PI", 
+"493", "4hZ", "0St", "4N", "0h9", "09P", "4Fv", "5C6", "4Xt", "6mW", "023", "0cZ", "0Mv", "nD", "4c9", "42P", "5kI", "6NK", "ct", "1Pg", 
+"X9", "MX", "74N", "4UD", "4ZE", "6of", "BY", "W8", "0OG", "lu", "6AJ", "40a", "4yY", "4l8", "aE", "0Bw", "18r", "Oi", "5R5", "4Wu", 
+"4EY", "4P8", "2KT", "1nV", "8YC", "7a", "5n5", "4ku", "4fE", "6Sf", "2hH", "k8", "07O", "Pu", "69B", "4Hi", "4Gh", "66C", "2Ie", "08N", 
+"d9", "5P", "7LF", "4iD", "4dt", "5a4", "2jy", "3o9", "0qv", "RD", "7oZ", "4JX", "6ay", "4TZ", "0ot", "LF", "bj", "0AX", "4zv", "6OU", 
+"6Be", "43N", "0Lh", "oZ", "Av", "0bD", "4Yj", "6lI", "6cH", "4Vk", "0mE", "Nw", "22B", "12", "4xG", "6Md", "5p7", "4uw", "0NY", "mk", 
+"CG", "1pT", "5Kz", "6nx", "1Y1", "1LP", "53v", "466", "5L3", "4Is", "06U", "Qo", "2JN", "1oL", "4DC", "65h", "7Om", "4jo", "0QA", "rs", 
+"9z", "1Na", "4en", "6PM", "aTs", "4KB", "04d", "2EO", "d6D", "09T", "4Fr", "5C2", "497", "bRm", "0Sp", "4J", "0Mr", "1H2", "aim", "42T", 
+"4Xp", "6mS", "027", "17w", "0nn", "3Kl", "74J", "5Ea", "5kM", "6NO", "cp", "1Pc", "0OC", "lq", "6AN", "40e", "4ZA", "6ob", "2TL", "0ao", 
+"18v", "Om", "5R1", "4Wq", "bCn", "afl", "aA", "0Bs", "07C", "Py", "69N", "4He", "4fI", "6Sj", "2hD", "k4", "0PW", "7m", "5n9", "4ky", 
+"4EU", "4P4", "2KX", "1nZ", "05r", "RH", "7oV", "4JT", "4dx", "5a8", "8l", "1Ow", "d5", "qT", "7LJ", "4iH", "4Gd", "66O", "2Ii", "08B", 
+"Az", "0bH", "4Yf", "6lE", "6Bi", "43B", "z7", "oV", "bf", "0AT", "4zz", "6OY", "4A7", "4TV", "0ox", "LJ", "CK", "14P", "5Kv", "4N6", 
+"543", "41s", "0NU", "mg", "22N", "u6", "4xK", "6Mh", "6cD", "4Vg", "0mI", "2Xj", "7Oa", "4jc", "0QM", "6w", "2JB", "I2", "4DO", "65d", 
+"68T", "b7D", "06Y", "Qc", "dSm", "287", "4gS", "4r2", "7MP", "4hR", "276", "4F", "0h1", "09X", "b8E", "67U", "7nL", "4KN", "F3", "SR", 
+"9v", "1Nm", "4eb", "6PA", "5kA", "6NC", "21e", "1Po", "X1", "MP", "74F", "4UL", "bbO", "79v", "0v3", "0cR", "8Df", "nL", "4c1", "42X", 
+"4yQ", "4l0", "aM", "8Kg", "0lS", "Oa", "76w", "637", "4ZM", "6on", "BQ", "W0", "0OO", "2zl", "6AB", "40i", "4fM", "6Sn", "3xa", "k0", 
+"07G", "2Fl", "69J", "4Ha", "4EQ", "4P0", "d5g", "83o", "0PS", "7i", "a0D", "bQN", "50U", "hbt", "8h", "1Os", "05v", "RL", "7oR", "4JP", 
+"5WA", "66K", "2Im", "08F", "d1", "5X", "7LN", "4iL", "6Bm", "43F", "z3", "oR", "2Wo", "0bL", "4Yb", "6lA", "4A3", "4TR", "8fd", "LN", 
+"bb", "0AP", "cPl", "aeO", "547", "41w", "0NQ", "mc", "CO", "14T", "5Kr", "4N2", "77i", "4Vc", "0mM", "2Xn", "22J", "u2", "4xO", "6Ml", 
+"2JF", "I6", "4DK", "6qh", "7Oe", "4jg", "0QI", "6s", "1Y9", "1LX", "4gW", "4r6", "68P", "5YZ", "0rU", "Qg", "0h5", "1mu", "4Fz", "67Q", 
+"7MT", "4hV", "0Sx", "4B", "9r", "1Ni", "4ef", "6PE", "7nH", "4KJ", "F7", "SV", "X5", "MT", "74B", "4UH", "5kE", "6NG", "cx", "1Pk", 
+"0Mz", "nH", "4c5", "4vT", "4Xx", "79r", "0v7", "0cV", "0lW", "Oe", "5R9", "4Wy", "4yU", "4l4", "aI", "1RZ", "0OK", "ly", "6AF", "40m", 
+"4ZI", "6oj", "BU", "W4", "265", "5E", "488", "4iQ", "b9F", "66V", "0i2", "1lr", "G0", "RQ", "7oO", "4JM", "4da", "6QB", "8u", "1On", 
+"0PN", "7t", "7Nb", "aa0", "4EL", "64g", "2KA", "H1", "07Z", "0f3", "69W", "b6G", "4fP", "479", "dRn", "294", "22W", "8Jd", "4xR", "4m3", 
+"77t", "624", "0mP", "Nb", "CR", "V3", "5Ko", "6nm", "ajS", "41j", "0NL", "3kN", "20f", "0AM", "4zc", "aeR", "6al", "4TO", "Y2", "LS", 
+"Ac", "0bQ", "bcL", "78u", "4b2", "4wS", "8Ee", "oO", "7nU", "4KW", "04q", "SK", "9o", "1Nt", "51R", "6PX", "7MI", "4hK", "e6", "pW", 
+"2Hj", "09A", "4Fg", "67L", "68M", "4If", "0rH", "Qz", "2iG", "j7", "4gJ", "6Ri", "7Ox", "4jz", "0QT", "6n", "1z8", "1oY", "4DV", "4Q7", 
+"4ZT", "4O5", "BH", "0az", "0OV", "ld", "550", "40p", "4yH", "6Lk", "aT", "t5", "0lJ", "Ox", "6bG", "4Wd", "4Xe", "6mF", "2Vh", "0cK", 
+"0Mg", "nU", "6Cj", "42A", "5kX", "6NZ", "ce", "1Pv", "2N9", "MI", "7pW", "4UU", "4Gy", "5B9", "0i6", "1lv", "1BZ", "5A", "7LW", "4iU", 
+"4de", "6QF", "8q", "1Oj", "G4", "RU", "7oK", "4JI", "4EH", "64c", "2KE", "H5", "0PJ", "7p", "7Nf", "4kd", "4fT", "4s5", "2hY", "290", 
+"0sV", "Pd", "5M8", "4Hx", "6cY", "4Vz", "0mT", "Nf", "1F8", "0Cx", "4xV", "4m7", "7Pd", "41n", "0NH", "mz", "CV", "V7", "5Kk", "6ni", 
+"6ah", "4TK", "Y6", "LW", "20b", "0AI", "4zg", "6OD", "4b6", "4wW", "0Ly", "oK", "Ag", "0bU", "5IZ", "6lX", "9k", "1Np", "51V", "azN", 
+"7nQ", "4KS", "04u", "SO", "2Hn", "09E", "4Fc", "67H", "7MM", "4hO", "e2", "pS", "2iC", "j3", "4gN", "6Rm", "68I", "4Ib", "06D", "2Go", 
+"d4d", "82l", "4DR", "4Q3", "a1G", "bPM", "0QP", "6j", "0OR", "0Z3", "554", "40t", "4ZP", "4O1", "BL", "15W", "0lN", "2Ym", "6bC", "5GA", 
+"4yL", "6Lo", "aP", "09", "0Mc", "nQ", "6Cn", "42E", "4Xa", "6mB", "2Vl", "0cO", "8gg", "MM", "7pS", "4UQ", "bAN", "adL", "ca", "1Pr", 
+"G8", "RY", "7oG", "4JE", "4di", "6QJ", "2jd", "1Of", "0Rw", "5M", "480", "4iY", "4Gu", "5B5", "2Ix", "08S", "07R", "Ph", "5M4", "4Ht", 
+"4fX", "471", "1X6", "1MW", "0PF", "st", "7Nj", "4kh", "4ED", "64o", "2KI", "H9", "CZ", "14A", "5Kg", "6ne", "7Ph", "41b", "0ND", "mv", 
+"1F4", "0Ct", "4xZ", "6My", "5S6", "4Vv", "0mX", "Nj", "Ak", "0bY", "4Yw", "6lT", "6Bx", "43S", "0Lu", "oG", "bw", "0AE", "4zk", "6OH", 
+"6ad", "4TG", "0oi", "2ZJ", "7MA", "4hC", "0Sm", "4W", "2Hb", "09I", "4Fo", "67D", "aTn", "b5d", "04y", "SC", "9g", "8WE", "4es", "6PP", 
+"5o2", "4jr", "8XD", "6f", "1z0", "1oQ", "705", "65u", "68E", "4In", "06H", "Qr", "2iO", "1LM", "4gB", "6Ra", "5ia", "6Lc", "23E", "05", 
+"0lB", "Op", "6bO", "4Wl", "c4F", "aEm", "1d2", "0ar", "8FF", "ll", "558", "40x", "5kP", "6NR", "cm", "344", "0ns", "MA", "74W", "bon", 
+"4Xm", "6mN", "3FA", "0cC", "0Mo", "2xL", "6Cb", "42I", "4dm", "6QN", "8y", "1Ob", "05g", "2DL", "7oC", "4JA", "4Gq", "5B1", "d7G", "08W", 
+"0Rs", "5I", "484", "bSn", "52u", "475", "1X2", "1MS", "07V", "Pl", "5M0", "4Hp", "5Ua", "64k", "2KM", "1nO", "0PB", "7x", "7Nn", "4kl", 
+"7Pl", "41f", "8GX", "mr", "2UO", "14E", "5Kc", "6na", "5S2", "4Vr", "19u", "Nn", "1F0", "0Cp", "bBm", "ago", "ahn", "43W", "0Lq", "oC", 
+"Ao", "16t", "4Ys", "6lP", "75I", "4TC", "0om", "2ZN", "bs", "0AA", "4zo", "6OL", "2Hf", "09M", "4Fk", "6sH", "7ME", "4hG", "0Si", "4S", 
+"9c", "1Nx", "4ew", "6PT", "7nY", "bqh", "0pu", "SG", "1z4", "1oU", "4DZ", "65q", "5o6", "4jv", "0QX", "6b", "2iK", "1LI", "4gF", "6Re", 
+"68A", "4Ij", "06L", "Qv", "0lF", "Ot", "6bK", "4Wh", "4yD", "6Lg", "aX", "01", "0OZ", "lh", "5q4", "4tt", "4ZX", "4O9", "BD", "0av", 
+"0nw", "ME", "74S", "4UY", "5kT", "6NV", "ci", "1Pz", "0Mk", "nY", "6Cf", "42M", "4Xi", "6mJ", "2Vd", "0cG", "bL", "8Hf", "4zP", "4o1", 
+"75v", "606", "0oR", "0z3", "AP", "T1", "4YL", "6lo", "6BC", "43h", "0LN", "2ym", "22d", "0CO", "4xa", "6MB", "6cn", "4VM", "0mc", "NQ", 
+"Ca", "14z", "baN", "aDL", "7PS", "41Y", "8Gg", "mM", "247", "7G", "7NQ", "4kS", "com", "64T", "0k0", "1np", "E2", "PS", "69d", "4HO", 
+"4fc", "7Ca", "2hn", "1Ml", "0RL", "5v", "avS", "4ib", "4GN", "66e", "2IC", "J3", "05X", "Rb", "aUO", "b4E", "4dR", "4q3", "8F", "8Vd", 
+"4XV", "4M7", "1f8", "0cx", "0MT", "nf", "572", "42r", "5kk", "6Ni", "cV", "v7", "0nH", "Mz", "74l", "4Uf", "4Zg", "6oD", "2Tj", "0aI", 
+"y6", "lW", "6Ah", "40C", "5iZ", "583", "ag", "0BU", "0ly", "OK", "4B6", "4WW", "7lW", "4IU", "06s", "QI", "0I6", "1Lv", "4gy", "5b9", 
+"7OK", "4jI", "g4", "rU", "2Jh", "1oj", "4De", "65N", "7nf", "4Kd", "04B", "Sx", "2kE", "h5", "4eH", "6Pk", "5m8", "4hx", "0SV", "4l", 
+"2HY", "09r", "4FT", "4S5", "5Q8", "4Tx", "0oV", "Ld", "bH", "0Az", "4zT", "4o5", "6BG", "43l", "0LJ", "ox", "AT", "T5", "4YH", "6lk", 
+"6cj", "4VI", "0mg", "NU", "2vh", "0CK", "4xe", "6MF", "7PW", "4uU", "2n9", "mI", "Ce", "1pv", "5KX", "6nZ", "5UZ", "64P", "0k4", "1nt", 
+"0Py", "7C", "7NU", "4kW", "4fg", "6SD", "2hj", "1Mh", "E6", "PW", "7mI", "4HK", "4GJ", "66a", "2IG", "J7", "0RH", "5r", "7Ld", "4if", 
+"4dV", "4q7", "8B", "1OY", "0qT", "Rf", "7ox", "4Jz", "0MP", "nb", "576", "42v", "4XR", "4M3", "dll", "17U", "0nL", "3KN", "74h", "4Ub", 
+"5ko", "6Nm", "cR", "v3", "y2", "lS", "6Al", "40G", "4Zc", "aER", "2Tn", "0aM", "18T", "OO", "4B2", "4WS", "bCL", "587", "ac", "0BQ", 
+"0I2", "1Lr", "53T", "axL", "68z", "4IQ", "06w", "QM", "2Jl", "1on", "4Da", "65J", "7OO", "4jM", "g0", "6Y", "9X", "h1", "4eL", "6Po", 
+"7nb", "aA0", "04F", "2Em", "d6f", "09v", "4FP", "4S1", "a3E", "bRO", "0SR", "4h", "AX", "T9", "4YD", "6lg", "6BK", "4wh", "0LF", "ot", 
+"bD", "0Av", "4zX", "4o9", "5Q4", "4Tt", "0oZ", "Lh", "Ci", "14r", "5KT", "6nV", "ajh", "41Q", "0Nw", "mE", "22l", "0CG", "4xi", "6MJ", 
+"6cf", "4VE", "0mk", "NY", "07a", "2FJ", "69l", "4HG", "4fk", "6SH", "2hf", "1Md", "0Pu", "7O", "7NY", "bQh", "4Ew", "6pT", "0k8", "1nx", 
+"05P", "Rj", "5O6", "4Jv", "4dZ", "453", "8N", "1OU", "0RD", "qv", "7Lh", "4ij", "4GF", "66m", "2IK", "1lI", "5kc", "6Na", "21G", "27", 
+"8gX", "Mr", "74d", "4Un", "bbm", "79T", "1f0", "0cp", "397", "nn", "5s2", "42z", "4ys", "6LP", "ao", "366", "0lq", "OC", "76U", "bml", 
+"4Zo", "6oL", "Bs", "0aA", "0Om", "2zN", "7QA", "40K", "7OC", "4jA", "0Qo", "6U", "3ZA", "1ob", "4Dm", "65F", "68v", "b7f", "0rs", "QA", 
+"dSO", "8UG", "4gq", "5b1", "5m0", "4hp", "8ZF", "4d", "1x2", "09z", "727", "67w", "7nn", "4Kl", "04J", "Sp", "9T", "1NO", "51i", "6Pc", 
+"6BO", "43d", "0LB", "op", "2WM", "0bn", "5Ia", "6lc", "5Q0", "4Tp", "8fF", "Ll", "1D2", "0Ar", "cPN", "aem", "ajl", "41U", "0Ns", "mA", 
+"Cm", "14v", "5KP", "6nR", "6cb", "4VA", "0mo", "2XL", "22h", "0CC", "4xm", "6MN", "4fo", "6SL", "2hb", "8TY", "07e", "2FN", "69h", "4HC", 
+"4Es", "64X", "d5E", "83M", "0Pq", "7K", "a0f", "bQl", "50w", "457", "8J", "1OQ", "05T", "Rn", "5O2", "4Jr", "4GB", "66i", "2IO", "08d", 
+"1Ba", "5z", "7Ll", "4in", "0nD", "Mv", "7ph", "4Uj", "5kg", "6Ne", "cZ", "23", "0MX", "nj", "5s6", "4vv", "4XZ", "6my", "1f4", "0ct", 
+"0lu", "OG", "6bx", "5Gz", "4yw", "6LT", "ak", "0BY", "0Oi", "2zJ", "6Ad", "40O", "4Zk", "6oH", "Bw", "0aE", "2Jd", "1of", "4Di", "65B", 
+"7OG", "4jE", "g8", "6Q", "2ix", "1Lz", "4gu", "5b5", "68r", "4IY", "0rw", "QE", "1x6", "1mW", "4FX", "4S9", "5m4", "4ht", "0SZ", "ph", 
+"9P", "h9", "4eD", "6Pg", "7nj", "4Kh", "04N", "St", "22u", "375", "4xp", "598", "77V", "blo", "0mr", "1h2", "Cp", "14k", "5KM", "6nO", 
+"7PB", "41H", "0Nn", "3kl", "20D", "34", "4zA", "6Ob", "6aN", "4Tm", "0oC", "Lq", "AA", "0bs", "bcn", "78W", "569", "43y", "384", "om", 
+"9Kd", "5g", "5l3", "4is", "734", "66t", "1y1", "08y", "05I", "Rs", "7om", "4Jo", "4dC", "7AA", "8W", "1OL", "0Pl", "7V", "ats", "4kB", 
+"4En", "64E", "2Kc", "1na", "07x", "PB", "69u", "b6e", "4fr", "5c2", "dRL", "8TD", "4Zv", "6oU", "Bj", "0aX", "0Ot", "lF", "6Ay", "40R", 
+"4yj", "6LI", "av", "0BD", "0lh", "OZ", "6be", "4WF", "4XG", "6md", "2VJ", "0ci", "0ME", "nw", "6CH", "42c", "5kz", "6Nx", "cG", "1PT", 
+"0nY", "Mk", "5P7", "4Uw", "5N5", "4Ku", "04S", "Si", "9M", "1NV", "4eY", "440", "7Mk", "4hi", "0SG", "pu", "2HH", "K8", "4FE", "67n", 
+"68o", "4ID", "1", "QX", "2ie", "1Lg", "4gh", "6RK", "7OZ", "4jX", "0Qv", "6L", "2Jy", "3O9", "4Dt", "5A4", "4C9", "4VX", "0mv", "ND", 
+"22q", "0CZ", "4xt", "6MW", "7PF", "41L", "x9", "mX", "Ct", "14o", "5KI", "6nK", "6aJ", "4Ti", "0oG", "Lu", "bY", "30", "4zE", "6Of", 
+"5r5", "4wu", "380", "oi", "AE", "0bw", "4YY", "4L8", "5Wz", "66p", "1y5", "1lT", "0RY", "5c", "5l7", "4iw", "4dG", "6Qd", "8S", "1OH", 
+"05M", "Rw", "7oi", "4Jk", "4Ej", "64A", "2Kg", "1ne", "0Ph", "7R", "7ND", "4kF", "4fv", "5c6", "0H9", "1My", "0st", "PF", "69q", "4HZ", 
+"0Op", "lB", "ako", "40V", "4Zr", "6oQ", "Bn", "15u", "0ll", "2YO", "6ba", "4WB", "4yn", "6LM", "ar", "1Ra", "0MA", "ns", "6CL", "42g", 
+"4XC", "79I", "2VN", "0cm", "8gE", "Mo", "5P3", "4Us", "bAl", "adn", "cC", "1PP", "9I", "1NR", "51t", "444", "5N1", "4Kq", "04W", "Sm", 
+"2HL", "09g", "4FA", "67j", "7Mo", "4hm", "0SC", "4y", "2ia", "1Lc", "4gl", "6RO", "68k", "5Ya", "5", "2GM", "d4F", "82N", "4Dp", "5A0", 
+"a1e", "bPo", "0Qr", "6H", "Cx", "14c", "5KE", "6nG", "7PJ", "4uH", "x5", "mT", "0V7", "0CV", "4xx", "590", "4C5", "4VT", "0mz", "NH", 
+"AI", "16R", "4YU", "4L4", "561", "43q", "0LW", "oe", "bU", "w4", "4zI", "6Oj", "6aF", "4Te", "0oK", "Ly", "05A", "2Dj", "7oe", "4Jg", 
+"4dK", "6Qh", "2jF", "i6", "0RU", "5o", "7Ly", "5yZ", "4GW", "4R6", "1y9", "08q", "07p", "PJ", "7mT", "4HV", "4fz", "6SY", "0H5", "1Mu", 
+"f7", "sV", "7NH", "4kJ", "4Ef", "64M", "2Kk", "1ni", "4yb", "6LA", "23g", "0BL", "Z3", "OR", "6bm", "4WN", "c4d", "aEO", "Bb", "0aP", 
+"8Fd", "lN", "4a3", "40Z", "5kr", "4n2", "cO", "8Ie", "0nQ", "Mc", "74u", "615", "4XO", "6ml", "2VB", "U2", "0MM", "2xn", "7Sa", "42k", 
+"7Mc", "4ha", "0SO", "4u", "3Xa", "K0", "4FM", "67f", "aTL", "b5F", "0pS", "Sa", "9E", "8Wg", "4eQ", "448", "7OR", "4jP", "254", "6D", 
+"0j3", "1os", "cnn", "65W", "68g", "4IL", "9", "QP", "2im", "1Lo", "53I", "6RC", "7PN", "41D", "x1", "mP", "2Um", "14g", "5KA", "6nC", 
+"4C1", "4VP", "19W", "NL", "0V3", "0CR", "bBO", "594", "565", "43u", "0LS", "oa", "AM", "16V", "4YQ", "4L0", "6aB", "4Ta", "0oO", "2Zl", 
+"bQ", "38", "4zM", "6On", "4dO", "6Ql", "2jB", "i2", "05E", "2Dn", "7oa", "4Jc", "4GS", "4R2", "d7e", "08u", "0RQ", "5k", "a2F", "bSL", 
+"52W", "ayO", "0H1", "1Mq", "07t", "PN", "69y", "4HR", "4Eb", "64I", "2Ko", "1nm", "f3", "7Z", "7NL", "4kN", "Z7", "OV", "6bi", "4WJ", 
+"4yf", "6LE", "az", "0BH", "0Ox", "lJ", "4a7", "4tV", "4Zz", "6oY", "Bf", "0aT", "0nU", "Mg", "74q", "5EZ", "5kv", "4n6", "cK", "1PX", 
+"0MI", "2xj", "6CD", "42o", "4XK", "6mh", "2VF", "U6", "2HD", "K4", "4FI", "67b", "7Mg", "4he", "0SK", "4q", "9A", "1NZ", "4eU", "4p4", 
+"5N9", "4Ky", "0pW", "Se", "0j7", "1ow", "4Dx", "5A8", "7OV", "4jT", "0Qz", "rH", "2ii", "1Lk", "4gd", "6RG", "68c", "4IH", "D5", "QT", 
+"5Ls", "4I3", "F", "13U", "0IP", "jb", "536", "46v", "5oo", "6Jm", "gR", "r3", "0jL", "3ON", "6dA", "4Qb", "5NB", "aAR", "2Pn", "0eM", 
+"0Ka", "hS", "6El", "44G", "49w", "abN", "ec", "0FQ", "8ae", "KO", "4F2", "4SS", "4X0", "4MQ", "02w", "UM", "0M2", "0XS", "57T", "a8D", 
+"7KO", "4nM", "c0", "2Y", "2Nl", "1kn", "aJ1", "61J", "6zC", "aE0", "00F", "2Am", "yP", "l1", "4aL", "6To", "a7E", "58U", "0WR", "0h", 
+"ZL", "84n", "4BP", "4W1", "fH", "0Ez", "5nu", "4k5", "5U8", "4Px", "0kV", "Hd", "ET", "P5", "5Mi", "6hk", "6FG", "47l", "0HJ", "kx", 
+"dy", "0GK", "48m", "6IF", "6gj", "4RI", "0ig", "JU", "Ge", "0dW", "5OX", "5Z9", "4d4", "4qU", "1ZZ", "iI", "0Ty", "3C", "4z6", "4oW", 
+"5QZ", "60P", "Yg", "0zU", "A6", "TW", "6yh", "4LK", "4bg", "6WD", "2lj", "0YI", "0VH", "1r", "6XE", "4mf", "4CJ", "62a", "2MG", "N7", 
+"0uT", "Vf", "7kx", "4Nz", "5pw", "4u7", "xJ", "1KY", "0IT", "jf", "532", "46r", "5Lw", "4I7", "B", "0gx", "0jH", "Iz", "6dE", "4Qf", 
+"5ok", "6Ji", "gV", "r7", "0Ke", "hW", "6Eh", "44C", "5NF", "6kD", "2Pj", "0eI", "0hy", "KK", "4F6", "4SW", "49s", "6HX", "eg", "0FU", 
+"0M6", "0XW", "4cy", "5f9", "4X4", "4MU", "02s", "UI", "Xy", "1kj", "5PD", "61N", "7KK", "4nI", "c4", "vU", "yT", "l5", "4aH", "6Tk", 
+"6zG", "4Od", "00B", "Wx", "ZH", "0yz", "4BT", "4W5", "5i8", "4lx", "0WV", "0l", "71v", "646", "0kR", "3NP", "fL", "8Lf", "5nq", "4k1", 
+"6FC", "47h", "0HN", "29e", "EP", "P1", "5Mm", "6ho", "6gn", "4RM", "0ic", "JQ", "26d", "0GO", "48i", "6IB", "4d0", "45Y", "8Cg", "iM", 
+"Ga", "0dS", "beN", "hYu", "ckm", "60T", "Yc", "0zQ", "207", "3G", "4z2", "4oS", "4bc", "7Ga", "2ln", "0YM", "A2", "TS", "6yl", "4LO", 
+"4CN", "62e", "2MC", "N3", "0VL", "1v", "6XA", "4mb", "5ps", "4u3", "xN", "8Rd", "01X", "Vb", "aQO", "b0E", "5og", "6Je", "gZ", "63", 
+"0jD", "Iv", "6dI", "4Qj", "7l9", "6iy", "N", "0gt", "0IX", "jj", "5w6", "4rv", "5mV", "5x7", "ek", "0FY", "0hu", "KG", "6fx", "5Cz", 
+"5NJ", "6kH", "Fw", "0eE", "92", "3nk", "6Ed", "44O", "7KG", "4nE", "c8", "2Q", "Xu", "1kf", "5PH", "61B", "4X8", "4MY", "0vw", "UE", 
+"2mx", "1Hz", "4cu", "5f5", "5i4", "4lt", "0WZ", "th", "ZD", "0yv", "4BX", "4W9", "6zK", "4Oh", "00N", "Wt", "yX", "l9", "4aD", "6Tg", 
+"2SM", "0fn", "5Ma", "6hc", "6FO", "47d", "0HB", "kp", "24Y", "0Er", "bDo", "aam", "5U0", "4Pp", "8bF", "Hl", "Gm", "10v", "5OP", "5Z1", 
+"anl", "45U", "0Js", "iA", "dq", "0GC", "48e", "6IN", "6gb", "4RA", "0io", "3Lm", "03e", "2BN", "7iA", "4LC", "4bo", "6WL", "zs", "0YA", 
+"0Tq", "3K", "a4f", "bUl", "4As", "5D3", "Yo", "87M", "01T", "Vn", "5K2", "4Nr", "54w", "417", "xB", "1KQ", "1Fa", "1z", "6XM", "4mn", 
+"4CB", "62i", "2MO", "0xl", "1za", "Ir", "6dM", "4Qn", "5oc", "6Ja", "25G", "67", "9Pe", "jn", "5w2", "46z", "bfm", "aCo", "J", "0gp", 
+"0hq", "KC", "72U", "bil", "5mR", "5x3", "eo", "326", "96", "3no", "7UA", "44K", "5NN", "6kL", "Fs", "0eA", "Xq", "1kb", "5PL", "61F", 
+"7KC", "4nA", "0Uo", "2U", "39U", "8QG", "4cq", "5f1", "aRl", "796", "0vs", "UA", "2LQ", "0yr", "767", "63w", "5i0", "4lp", "9Ng", "0d", 
+"2oM", "0Zn", "55i", "6Tc", "6zO", "4Ol", "00J", "Wp", "6FK", "4sh", "0HF", "kt", "EX", "P9", "5Me", "6hg", "5U4", "4Pt", "0kZ", "Hh", 
+"fD", "0Ev", "5ny", "4k9", "4d8", "45Q", "0Jw", "iE", "Gi", "10r", "5OT", "5Z5", "6gf", "4RE", "0ik", "JY", "du", "0GG", "48a", "6IJ", 
+"4bk", "6WH", "zw", "0YE", "03a", "2BJ", "6yd", "4LG", "4Aw", "5D7", "Yk", "0zY", "0Tu", "3O", "6Zx", "bUh", "54s", "413", "xF", "1KU", 
+"01P", "Vj", "5K6", "4Nv", "4CF", "62m", "2MK", "0xh", "0VD", "uv", "6XI", "4mj", "5NS", "6kQ", "Fn", "11u", "0Kp", "hB", "aoo", "44V", 
+"49f", "6HM", "er", "1Va", "0hl", "3Mn", "6fa", "4SB", "5Lb", "7yA", "W", "0gm", "0IA", "js", "6GL", "46g", "bEl", "hyW", "gC", "0Dq", 
+"8cE", "Io", "5T3", "4Qs", "5J1", "4Oq", "00W", "Wm", "yA", "0Zs", "55t", "404", "6YN", "4lm", "0WC", "0y", "2LL", "0yo", "4BA", "63j", 
+"6xc", "bws", "02f", "2CM", "2ma", "0XB", "4cl", "6VO", "a5e", "bTo", "0Ur", "2H", "Xl", "86N", "5PQ", "5E0", "dh", "0GZ", "5lU", "5y4", 
+"4G9", "4RX", "0iv", "JD", "Gt", "0dF", "5OI", "6jK", "6Dg", "45L", "81", "iX", "fY", "70", "5nd", "6Kf", "6eJ", "4Pi", "0kG", "Hu", 
+"EE", "0fw", "5Mx", "4H8", "5v5", "4su", "1Xz", "ki", "0VY", "1c", "5h7", "4mw", "5Sz", "62p", "2MV", "0xu", "01M", "Vw", "7ki", "4Nk", 
+"54n", "6Ud", "2nJ", "1KH", "0Th", "3R", "6Ze", "4oF", "4Aj", "60A", "Yv", "0zD", "0wt", "TF", "6yy", "4LZ", "4bv", "5g6", "zj", "0YX", 
+"0Kt", "hF", "6Ey", "44R", "5NW", "6kU", "Fj", "0eX", "0hh", "KZ", "6fe", "4SF", "49b", "6HI", "ev", "0FD", "0IE", "jw", "6GH", "46c", 
+"5Lf", "6id", "S", "0gi", "0jY", "Ik", "5T7", "4Qw", "5oz", "6Jx", "gG", "0Du", "yE", "0Zw", "4aY", "400", "5J5", "4Ou", "00S", "Wi", 
+"ZY", "O8", "4BE", "63n", "6YJ", "4li", "0WG", "tu", "2me", "0XF", "4ch", "6VK", "6xg", "4MD", "02b", "UX", "Xh", "3K9", "5PU", "5E4", 
+"7KZ", "4nX", "0Uv", "2L", "73V", "bho", "0ir", "1l2", "dl", "335", "48x", "5y0", "6Dc", "45H", "85", "3ol", "Gp", "0dB", "5OM", "6jO", 
+"6eN", "4Pm", "0kC", "Hq", "24D", "74", "bDr", "6Kb", "529", "47y", "8AG", "km", "EA", "0fs", "bgn", "aBl", "774", "62t", "199", "0xq", 
+"9Od", "1g", "5h3", "4ms", "54j", "7EA", "2nN", "1KL", "01I", "Vs", "7km", "4No", "4An", "60E", "Yr", "1ja", "0Tl", "3V", "6Za", "4oB", 
+"4br", "5g2", "zn", "8PD", "03x", "TB", "aSo", "785", "49n", "6HE", "ez", "0FH", "0hd", "KV", "6fi", "4SJ", "bdI", "6kY", "Ff", "0eT", 
+"0Kx", "hJ", "4e7", "4pV", "5ov", "4j6", "gK", "0Dy", "0jU", "Ig", "6dX", "5AZ", "5Lj", "6ih", "DW", "Q6", "0II", "28b", "6GD", "46o", 
+"6YF", "4le", "0WK", "0q", "ZU", "O4", "4BI", "63b", "5J9", "4Oy", "0tW", "We", "yI", "1JZ", "4aU", "4t4", "7KV", "4nT", "0Uz", "vH", 
+"Xd", "1kw", "5PY", "5E8", "6xk", "4MH", "02n", "UT", "2mi", "0XJ", "4cd", "6VG", "2Qm", "0dN", "5OA", "6jC", "6Do", "45D", "89", "iP", 
+"0R3", "0GR", "48t", "acM", "4G1", "4RP", "94O", "JL", "EM", "12V", "5Mp", "4H0", "525", "47u", "0HS", "ka", "fQ", "78", "5nl", "6Kn", 
+"6eB", "4Pa", "0kO", "3NM", "01E", "3PO", "7ka", "4Nc", "54f", "6Ul", "xS", "m2", "0VQ", "1k", "a6F", "59V", "4CS", "4V2", "195", "85m", 
+"03t", "TN", "4Y3", "4LR", "56W", "a9G", "zb", "0YP", "b3", "3Z", "6Zm", "4oN", "4Ab", "60I", "2Oo", "0zL", "1xA", "KR", "6fm", "4SN", 
+"49j", "6HA", "27g", "0FL", "8Bd", "hN", "4e3", "44Z", "bdM", "aAO", "Fb", "0eP", "0jQ", "Ic", "70u", "655", "5or", "4j2", "gO", "8Me", 
+"0IM", "28f", "7Wa", "46k", "5Ln", "6il", "DS", "Q2", "ZQ", "O0", "4BM", "63f", "6YB", "4la", "0WO", "0u", "yM", "8Sg", "4aQ", "408", 
+"aPL", "b1F", "0tS", "Wa", "0n3", "1ks", "bzO", "61W", "7KR", "4nP", "214", "2D", "2mm", "0XN", "57I", "6VC", "6xo", "4ML", "02j", "UP", 
+"6Dk", "4qH", "0Jf", "iT", "Gx", "0dJ", "5OE", "6jG", "4G5", "4RT", "0iz", "JH", "dd", "0GV", "48p", "5y8", "521", "47q", "0HW", "ke", 
+"EI", "12R", "5Mt", "4H4", "6eF", "4Pe", "0kK", "Hy", "fU", "s4", "5nh", "6Kj", "54b", "6Uh", "xW", "m6", "01A", "3PK", "7ke", "4Ng", 
+"4CW", "4V6", "191", "0xy", "0VU", "1o", "6XX", "59R", "4bz", "6WY", "zf", "0YT", "03p", "TJ", "4Y7", "4LV", "4Af", "60M", "Yz", "0zH", 
+"b7", "wV", "6Zi", "4oJ", "5H3", "4Ms", "02U", "Uo", "2mR", "0Xq", "57v", "426", "7Km", "4no", "0UA", "vs", "2NN", "1kL", "5Pb", "61h", 
+"6za", "4OB", "00d", "2AO", "yr", "1Ja", "4an", "6TM", "a7g", "58w", "0Wp", "0J", "Zn", "84L", "4Br", "5G2", "5LQ", "5Y0", "d", "13w", 
+"0Ir", "1L2", "amm", "46T", "5oM", "6JO", "gp", "0DB", "0jn", "3Ol", "6dc", "5Aa", "bdr", "6kb", "2PL", "0eo", "0KC", "hq", "6EN", "44e", 
+"49U", "abl", "eA", "0Fs", "8aG", "Km", "5V1", "4Sq", "1Dz", "3a", "5j5", "4ou", "4AY", "4T8", "YE", "0zw", "03O", "Tu", "6yJ", "4Li", 
+"4bE", "6Wf", "zY", "o8", "0Vj", "1P", "6Xg", "4mD", "4Ch", "62C", "2Me", "0xF", "0uv", "VD", "7kZ", "4NX", "5pU", "5e4", "xh", "3k9", 
+"fj", "0EX", "5nW", "6KU", "6ey", "4PZ", "0kt", "HF", "Ev", "0fD", "5MK", "6hI", "6Fe", "47N", "0Hh", "kZ", "26B", "52", "48O", "6Id", 
+"6gH", "4Rk", "0iE", "Jw", "GG", "0du", "5Oz", "6jx", "5t7", "4qw", "0JY", "ik", "2mV", "0Xu", "57r", "422", "5H7", "4Mw", "02Q", "Uk", 
+"2NJ", "1kH", "5Pf", "61l", "7Ki", "4nk", "0UE", "vw", "yv", "0ZD", "4aj", "6TI", "6ze", "4OF", "0th", "WZ", "Zj", "0yX", "4Bv", "5G6", 
+"6Yy", "4lZ", "0Wt", "0N", "0Iv", "jD", "4g9", "46P", "5LU", "5Y4", "Dh", "0gZ", "0jj", "IX", "6dg", "4QD", "5oI", "6JK", "gt", "0DF", 
+"0KG", "hu", "6EJ", "44a", "5Nd", "6kf", "FY", "S8", "1xz", "Ki", "5V5", "4Su", "49Q", "4h8", "eE", "0Fw", "756", "60v", "YA", "0zs", 
+"9Mf", "3e", "5j1", "4oq", "4bA", "6Wb", "2lL", "0Yo", "03K", "Tq", "6yN", "4Lm", "4Cl", "62G", "2Ma", "0xB", "0Vn", "1T", "6Xc", "59i", 
+"54Y", "5e0", "xl", "8RF", "01z", "1p2", "aQm", "b0g", "71T", "bjm", "0kp", "HB", "fn", "317", "5nS", "6KQ", "6Fa", "47J", "0Hl", "29G", 
+"Er", "12i", "5MO", "6hM", "6gL", "4Ro", "0iA", "Js", "26F", "56", "48K", "7YA", "5t3", "4qs", "8CE", "io", "GC", "0dq", "bel", "hYW", 
+"7Ke", "4ng", "0UI", "2s", "XW", "M6", "5Pj", "6uh", "6xX", "6m9", "0vU", "Ug", "2mZ", "0Xy", "4cW", "4v6", "4y7", "4lV", "0Wx", "0B", 
+"Zf", "0yT", "4Bz", "63Q", "6zi", "4OJ", "B7", "WV", "yz", "0ZH", "4af", "6TE", "5oE", "6JG", "gx", "0DJ", "0jf", "IT", "6dk", "4QH", 
+"5LY", "5Y8", "l", "0gV", "0Iz", "jH", "4g5", "4rT", "5mt", "4h4", "eI", "1VZ", "0hW", "Ke", "5V9", "4Sy", "5Nh", "6kj", "FU", "S4", 
+"0KK", "hy", "6EF", "44m", "03G", "2Bl", "6yB", "4La", "4bM", "6Wn", "zQ", "o0", "0TS", "3i", "a4D", "bUN", "4AQ", "4T0", "YM", "87o", 
+"01v", "VL", "7kR", "4NP", "54U", "hft", "0N3", "1Ks", "0Vb", "1X", "6Xo", "4mL", "5SA", "62K", "2Mm", "0xN", "2So", "0fL", "5MC", "6hA", 
+"6Fm", "47F", "1XA", "kR", "fb", "0EP", "bDM", "aaO", "4E3", "4PR", "8bd", "HN", "GO", "10T", "5Or", "4J2", "507", "45w", "0JQ", "ic", 
+"dS", "q2", "48G", "6Il", "73i", "4Rc", "0iM", "3LO", "XS", "M2", "5Pn", "61d", "7Ka", "4nc", "0UM", "2w", "39w", "8Qe", "4cS", "4v2", 
+"aRN", "b3D", "02Y", "Uc", "Zb", "0yP", "bxM", "63U", "4y3", "4lR", "236", "0F", "2oo", "0ZL", "4ab", "6TA", "6zm", "4ON", "B3", "WR", 
+"0jb", "IP", "6do", "4QL", "5oA", "6JC", "25e", "0DN", "9PG", "jL", "4g1", "46X", "686", "aCM", "h", "0gR", "0hS", "Ka", "72w", "677", 
+"49Y", "4h0", "eM", "8Og", "0KO", "3nM", "6EB", "44i", "5Nl", "6kn", "FQ", "S0", "4bI", "6Wj", "zU", "o4", "03C", "Ty", "6yF", "4Le", 
+"4AU", "4T4", "YI", "1jZ", "0TW", "3m", "5j9", "4oy", "54Q", "5e8", "xd", "1Kw", "01r", "VH", "7kV", "4NT", "4Cd", "62O", "2Mi", "0xJ", 
+"0Vf", "uT", "6Xk", "4mH", "6Fi", "47B", "0Hd", "kV", "Ez", "0fH", "5MG", "6hE", "4E7", "4PV", "0kx", "HJ", "ff", "0ET", "bDI", "6KY", 
+"503", "45s", "0JU", "ig", "GK", "0dy", "5Ov", "4J6", "6gD", "4Rg", "0iI", "3LK", "dW", "q6", "48C", "6Ih", "4Z2", "4OS", "00u", "WO", 
+"yc", "0ZQ", "55V", "hgw", "6Yl", "4lO", "a2", "tS", "2Ln", "0yM", "4Bc", "63H", "6xA", "4Mb", "02D", "2Co", "2mC", "n3", "4cN", "6Vm", 
+"a5G", "bTM", "0UP", "2j", "XN", "86l", "5Ps", "4U3", "5Nq", "4K1", "FL", "11W", "0KR", "3nP", "514", "44t", "49D", "6Ho", "eP", "49", 
+"0hN", "3ML", "6fC", "5CA", "aV1", "6iB", "u", "0gO", "0Ic", "jQ", "6Gn", "46E", "bEN", "hyu", "ga", "0DS", "8cg", "IM", "4D0", "4QQ", 
+"1FZ", "1A", "4x4", "4mU", "4Cy", "5F9", "0m6", "0xW", "C4", "VU", "7kK", "4NI", "54L", "6UF", "xy", "1Kj", "0TJ", "3p", "6ZG", "4od", 
+"4AH", "60c", "YT", "L5", "0wV", "Td", "5I8", "4Lx", "4bT", "4w5", "zH", "0Yz", "dJ", "0Gx", "5lw", "4i7", "6gY", "4Rz", "0iT", "Jf", 
+"GV", "R7", "5Ok", "6ji", "6DE", "45n", "0JH", "iz", "24b", "0EI", "5nF", "6KD", "6eh", "4PK", "0ke", "HW", "Eg", "0fU", "5MZ", "6hX", 
+"4f6", "4sW", "0Hy", "kK", "yg", "0ZU", "55R", "6TX", "4Z6", "4OW", "00q", "WK", "2Lj", "0yI", "4Bg", "63L", "6Yh", "4lK", "a6", "tW", 
+"2mG", "n7", "4cJ", "6Vi", "6xE", "4Mf", "0vH", "Uz", "XJ", "1kY", "5Pw", "4U7", "7Kx", "4nz", "0UT", "2n", "0KV", "hd", "510", "44p", 
+"5Nu", "4K5", "FH", "0ez", "0hJ", "Kx", "6fG", "4Sd", "5mi", "6Hk", "eT", "p5", "0Ig", "jU", "6Gj", "46A", "5LD", "6iF", "q", "0gK", 
+"1zZ", "II", "4D4", "4QU", "5oX", "5z9", "ge", "0DW", "byN", "62V", "0m2", "0xS", "225", "1E", "4x0", "4mQ", "54H", "6UB", "2nl", "1Kn", 
+"C0", "VQ", "7kO", "4NM", "4AL", "60g", "YP", "L1", "0TN", "3t", "6ZC", "ae0", "4bP", "439", "zL", "8Pf", "03Z", "0b3", "aSM", "b2G", 
+"73t", "664", "0iP", "Jb", "dN", "8Nd", "48Z", "4i3", "6DA", "45j", "0JL", "3oN", "GR", "R3", "5Oo", "6jm", "6el", "4PO", "0ka", "HS", 
+"24f", "0EM", "5nB", "aaR", "4f2", "4sS", "8Ae", "kO", "Ec", "0fQ", "695", "aBN", "6Yd", "4lG", "0Wi", "0S", "Zw", "0yE", "4Bk", "6wH", 
+"6zx", "buh", "0tu", "WG", "yk", "0ZY", "4aw", "5d7", "5k6", "4nv", "0UX", "2b", "XF", "1kU", "741", "61q", "6xI", "4Mj", "02L", "Uv", 
+"2mK", "0Xh", "4cF", "6Ve", "49L", "6Hg", "eX", "41", "0hF", "Kt", "6fK", "4Sh", "5Ny", "4K9", "FD", "0ev", "0KZ", "hh", "5u4", "4pt", 
+"5oT", "5z5", "gi", "1Tz", "0jw", "IE", "4D8", "4QY", "5LH", "6iJ", "Du", "0gG", "0Ik", "jY", "6Gf", "46M", "01g", "3Pm", "7kC", "4NA", 
+"54D", "6UN", "xq", "1Kb", "0Vs", "1I", "a6d", "59t", "4Cq", "5F1", "d3G", "85O", "03V", "Tl", "5I0", "4Lp", "56u", "435", "2lQ", "0Yr", 
+"0TB", "3x", "6ZO", "4ol", "5Qa", "60k", "2OM", "0zn", "2QO", "0dl", "5Oc", "6ja", "6DM", "45f", "1Za", "ir", "dB", "0Gp", "48V", "aco", 
+"5W2", "4Rr", "94m", "Jn", "Eo", "12t", "5MR", "5X3", "aln", "47W", "0Hq", "kC", "fs", "0EA", "5nN", "6KL", "71I", "4PC", "0km", "3No", 
+"Zs", "0yA", "4Bo", "63D", "7IA", "4lC", "0Wm", "0W", "yo", "8SE", "4as", "5d3", "aPn", "b1d", "00y", "WC", "XB", "1kQ", "745", "61u", 
+"5k2", "4nr", "9Le", "2f", "2mO", "0Xl", "4cB", "6Va", "6xM", "4Mn", "02H", "Ur", "0hB", "Kp", "6fO", "4Sl", "49H", "6Hc", "27E", "45", 
+"8BF", "hl", "518", "44x", "bdo", "aAm", "2PQ", "0er", "0js", "IA", "70W", "bkn", "5oP", "5z1", "gm", "304", "0Io", "28D", "6Gb", "46I", 
+"5LL", "6iN", "y", "0gC", "5pH", "6UJ", "xu", "1Kf", "C8", "VY", "7kG", "4NE", "4Cu", "5F5", "2Mx", "1hz", "0Vw", "1M", "4x8", "4mY", 
+"4bX", "431", "zD", "0Yv", "03R", "Th", "5I4", "4Lt", "4AD", "60o", "YX", "L9", "0TF", "wt", "6ZK", "4oh", "6DI", "45b", "0JD", "iv", 
+"GZ", "0dh", "5Og", "6je", "5W6", "4Rv", "0iX", "Jj", "dF", "0Gt", "48R", "6Iy", "6Fx", "47S", "0Hu", "kG", "Ek", "0fY", "5MV", "5X7", 
+"6ed", "4PG", "0ki", "3Nk", "fw", "0EE", "5nJ", "6KH", "356", "bo", "6OP", "4zs", "bnl", "75U", "LC", "0oq", "0bA", "As", "6lL", "4Yo", 
+"43K", "7RA", "2yN", "0Lm", "17", "22G", "6Ma", "4xB", "4Vn", "6cM", "Nr", "19i", "14Y", "CB", "aDo", "bam", "41z", "5p2", "mn", "8GD", 
+"7d", "8YF", "4kp", "5n0", "64w", "717", "1nS", "2KQ", "Pp", "07J", "4Hl", "69G", "6Sc", "52i", "1MO", "2hM", "5U", "0Ro", "4iA", "7LC", 
+"66F", "4Gm", "08K", "3YA", "RA", "0qs", "b4f", "aUl", "5a1", "4dq", "8VG", "8e", "6mV", "4Xu", "17r", "022", "nE", "0Mw", "42Q", "4c8", 
+"6NJ", "5kH", "1Pf", "cu", "MY", "X8", "4UE", "74O", "6og", "4ZD", "W9", "BX", "lt", "0OF", "4th", "6AK", "4l9", "4yX", "0Bv", "aD", 
+"Oh", "0lZ", "4Wt", "5R4", "4Iv", "5L6", "Qj", "06P", "1LU", "1Y4", "463", "4gZ", "4jj", "7Oh", "rv", "0QD", "1oI", "2JK", "65m", "4DF", 
+"4KG", "7nE", "2EJ", "04a", "1Nd", "2kf", "6PH", "4ek", "5xz", "492", "4O", "0Su", "09Q", "0h8", "5C7", "4Fw", "5Dz", "6ax", "LG", "0ou", 
+"0AY", "bk", "6OT", "4zw", "43O", "6Bd", "2yJ", "0Li", "0bE", "Aw", "6lH", "4Yk", "4Vj", "6cI", "Nv", "0mD", "13", "22C", "6Me", "4xF", 
+"4uv", "5p6", "mj", "0NX", "1pU", "CF", "6ny", "7k9", "4P9", "4EX", "1nW", "2KU", "sh", "0PZ", "4kt", "5n4", "6Sg", "4fD", "k9", "2hI", 
+"Pt", "07N", "4Hh", "69C", "66B", "4Gi", "08O", "2Id", "5Q", "d8", "4iE", "7LG", "5a5", "4du", "1Oz", "8a", "RE", "0qw", "4JY", "aUh", 
+"nA", "0Ms", "42U", "ail", "6mR", "4Xq", "17v", "026", "3Km", "0no", "4UA", "74K", "6NN", "5kL", "1Pb", "cq", "lp", "0OB", "40d", "6AO", 
+"6oc", "5Ja", "0an", "2TM", "Ol", "18w", "4Wp", "5R0", "afm", "bCo", "0Br", "1G2", "1LQ", "1Y0", "467", "53w", "4Ir", "5L2", "Qn", "06T", 
+"1oM", "2JO", "65i", "4DB", "4jn", "7Ol", "6z", "1Aa", "8WY", "2kb", "6PL", "4eo", "4KC", "7nA", "2EN", "04e", "09U", "d6E", "5C3", "4Fs", 
+"bRl", "496", "4K", "0Sq", "0bI", "2Wj", "6lD", "4Yg", "43C", "6Bh", "oW", "z6", "0AU", "bg", "6OX", "5jZ", "4TW", "4A6", "LK", "0oy", 
+"14Q", "CJ", "4N7", "5Kw", "41r", "542", "mf", "0NT", "u7", "22O", "6Mi", "4xJ", "4Vf", "6cE", "Nz", "0mH", "Px", "07B", "4Hd", "69O", 
+"6Sk", "4fH", "k5", "2hE", "7l", "0PV", "4kx", "5n8", "4P5", "4ET", "83j", "2KY", "RI", "05s", "4JU", "7oW", "5a9", "4dy", "1Ov", "8m", 
+"qU", "d4", "4iI", "7LK", "66N", "4Ge", "08C", "2Ih", "6NB", "a59", "1Pn", "21d", "MQ", "X0", "4UM", "74G", "79w", "bbN", "0cS", "0v2", 
+"nM", "8Dg", "42Y", "4c0", "4l1", "4yP", "8Kf", "aL", "0y3", "0lR", "636", "76v", "6oo", "4ZL", "W1", "BP", "2zm", "0ON", "40h", "6AC", 
+"4jb", "auS", "6v", "0QL", "I3", "2JC", "65e", "4DN", "b7E", "68U", "Qb", "06X", "286", "dSl", "4r3", "4gR", "4hS", "7MQ", "4G", "277", 
+"09Y", "0h0", "67T", "b8D", "4KO", "7nM", "SS", "F2", "1Nl", "9w", "azR", "4ec", "43G", "6Bl", "oS", "z2", "0bM", "2Wn", "78i", "4Yc", 
+"4TS", "4A2", "LO", "8fe", "0AQ", "bc", "aeN", "cPm", "41v", "546", "mb", "0NP", "14U", "CN", "4N3", "5Ks", "4Vb", "6cA", "2Xo", "0mL", 
+"u3", "22K", "6Mm", "4xN", "6So", "4fL", "k1", "2hA", "2Fm", "07F", "5XA", "69K", "4P1", "4EP", "83n", "d5f", "7h", "0PR", "bQO", "a0E", 
+"hbu", "50T", "1Or", "8i", "RM", "05w", "4JQ", "7oS", "66J", "4Ga", "08G", "2Il", "5Y", "d0", "4iM", "7LO", "MU", "X4", "4UI", "74C", 
+"6NF", "5kD", "1Pj", "cy", "nI", "2m9", "4vU", "4c4", "6mZ", "4Xy", "0cW", "0v6", "Od", "0lV", "4Wx", "5R8", "4l5", "4yT", "0Bz", "aH", 
+"lx", "0OJ", "40l", "6AG", "6ok", "4ZH", "W5", "BT", "I7", "2JG", "65a", "4DJ", "4jf", "7Od", "6r", "0QH", "1LY", "1Y8", "4r7", "4gV", 
+"4Iz", "68Q", "Qf", "0rT", "1mt", "0h4", "67P", "5VZ", "4hW", "7MU", "4C", "0Sy", "1Nh", "9s", "6PD", "4eg", "4KK", "7nI", "SW", "F6", 
+"8Je", "22V", "4m2", "4xS", "625", "77u", "Nc", "0mQ", "V2", "CS", "6nl", "5Kn", "41k", "7Pa", "3kO", "0NM", "0AL", "20g", "6OA", "4zb", 
+"4TN", "6am", "LR", "Y3", "0bP", "Ab", "78t", "bcM", "43Z", "4b3", "oN", "8Ed", "5D", "264", "4iP", "489", "66W", "b9G", "08Z", "0i3", 
+"RP", "G1", "4JL", "7oN", "6QC", "50I", "1Oo", "8t", "7u", "0PO", "4ka", "7Nc", "64f", "4EM", "H0", "963", "Pa", "0sS", "b6F", "69V", 
+"478", "4fQ", "295", "dRo", "4O4", "4ZU", "15R", "BI", "le", "0OW", "40q", "551", "6Lj", "4yI", "t4", "aU", "Oy", "0lK", "4We", "6bF", 
+"6mG", "4Xd", "0cJ", "2Vi", "nT", "0Mf", "4vH", "6Ck", "adI", "5kY", "1Pw", "cd", "MH", "0nz", "4UT", "7pV", "4KV", "7nT", "SJ", "04p", 
+"1Nu", "9n", "6PY", "4ez", "4hJ", "7MH", "pV", "e7", "1mi", "2Hk", "67M", "4Ff", "4Ig", "68L", "2Gj", "06A", "j6", "2iF", "6Rh", "4gK", 
+"5zZ", "7Oy", "6o", "0QU", "1oX", "1z9", "4Q6", "4DW", "5FZ", "6cX", "Ng", "0mU", "0Cy", "1F9", "4m6", "4xW", "41o", "7Pe", "3kK", "0NI", 
+"V6", "CW", "6nh", "5Kj", "4TJ", "6ai", "LV", "Y7", "0AH", "bz", "6OE", "4zf", "4wV", "4b7", "oJ", "0Lx", "0bT", "Af", "6lY", "4Yz", 
+"5B8", "4Gx", "1lw", "0i7", "qH", "0Rz", "4iT", "7LV", "6QG", "4dd", "1Ok", "8p", "RT", "G5", "4JH", "7oJ", "64b", "4EI", "H4", "2KD", 
+"7q", "0PK", "4ke", "7Ng", "4s4", "4fU", "1MZ", "2hX", "Pe", "0sW", "4Hy", "5M9", "la", "0OS", "40u", "555", "4O0", "4ZQ", "15V", "BM", 
+"2Yl", "0lO", "4Wa", "6bB", "6Ln", "4yM", "08", "aQ", "nP", "0Mb", "42D", "6Co", "6mC", "5HA", "0cN", "2Vm", "ML", "8gf", "4UP", "74Z", 
+"adM", "bAO", "1Ps", "0U3", "1Nq", "9j", "azO", "51W", "4KR", "7nP", "SN", "04t", "09D", "2Ho", "67I", "4Fb", "4hN", "7ML", "4Z", "e3", 
+"j2", "2iB", "6Rl", "4gO", "4Ic", "68H", "2Gn", "06E", "82m", "d4e", "4Q2", "4DS", "bPL", "a1F", "6k", "0QQ", "1pH", "2UJ", "6nd", "5Kf", 
+"41c", "7Pi", "mw", "0NE", "0Cu", "1F5", "6Mx", "5hz", "4Vw", "5S7", "Nk", "0mY", "0bX", "Aj", "6lU", "4Yv", "43R", "6By", "oF", "0Lt", 
+"0AD", "bv", "6OI", "4zj", "4TF", "6ae", "LZ", "0oh", "RX", "G9", "4JD", "7oF", "6QK", "4dh", "1Og", "2je", "5L", "0Rv", "4iX", "481", 
+"5B4", "4Gt", "08R", "2Iy", "Pi", "07S", "4Hu", "5M5", "470", "4fY", "1MV", "1X7", "su", "0PG", "4ki", "7Nk", "64n", "4EE", "H8", "2KH", 
+"6Lb", "4yA", "04", "23D", "Oq", "0lC", "4Wm", "6bN", "aEl", "c4G", "0as", "BA", "lm", "8FG", "40y", "559", "6NS", "5kQ", "345", "cl", 
+"1k2", "0nr", "boo", "74V", "6mO", "4Xl", "0cB", "2Va", "2xM", "0Mn", "42H", "6Cc", "4hB", "aws", "4V", "0Sl", "09H", "2Hc", "67E", "4Fn", 
+"b5e", "aTo", "SB", "04x", "8WD", "9f", "6PQ", "4er", "4js", "5o3", "6g", "8XE", "1oP", "1z1", "65t", "704", "4Io", "68D", "Qs", "06I", 
+"1LL", "2iN", "7BA", "4gC", "41g", "7Pm", "ms", "0NA", "14D", "2UN", "aDr", "5Kb", "4Vs", "5S3", "No", "19t", "0Cq", "1F1", "agn", "bBl", 
+"43V", "aho", "oB", "0Lp", "16u", "An", "6lQ", "4Yr", "4TB", "6aa", "2ZO", "0ol", "1Qa", "br", "6OM", "4zn", "6QO", "4dl", "1Oc", "8x", 
+"2DM", "05f", "5Za", "7oB", "5B0", "4Gp", "08V", "d7F", "5H", "0Rr", "bSo", "485", "474", "52t", "1MR", "1X3", "Pm", "07W", "4Hq", "5M1", 
+"64j", "4EA", "1nN", "2KL", "7y", "0PC", "4km", "7No", "Ou", "0lG", "4Wi", "6bJ", "6Lf", "4yE", "00", "aY", "li", "8FC", "4tu", "5q5", 
+"4O8", "4ZY", "0aw", "BE", "MD", "0nv", "4UX", "74R", "6NW", "5kU", "341", "ch", "nX", "0Mj", "42L", "6Cg", "6mK", "4Xh", "0cF", "2Ve", 
+"09L", "2Hg", "67A", "4Fj", "4hF", "7MD", "4R", "0Sh", "1Ny", "9b", "6PU", "4ev", "4KZ", "7nX", "SF", "0pt", "1oT", "1z5", "65p", "5Tz", 
+"4jw", "5o7", "6c", "0QY", "1LH", "2iJ", "6Rd", "4gG", "4Ik", "7li", "Qw", "06M", "7F", "246", "4kR", "7NP", "64U", "col", "1nq", "0k1", 
+"PR", "E3", "4HN", "69e", "6SA", "4fb", "1Mm", "2ho", "5w", "0RM", "4ic", "7La", "66d", "4GO", "J2", "2IB", "Rc", "05Y", "b4D", "aUN", 
+"4q2", "4dS", "8Ve", "8G", "8Hg", "bM", "4o0", "4zQ", "607", "75w", "La", "0oS", "T0", "AQ", "6ln", "4YM", "43i", "6BB", "2yl", "0LO", 
+"0CN", "22e", "6MC", "5hA", "4VL", "6co", "NP", "0mb", "1ps", "0u3", "aDM", "baO", "41X", "7PR", "mL", "8Gf", "4IT", "7lV", "QH", "06r", 
+"1Lw", "0I7", "5b8", "4gx", "4jH", "7OJ", "rT", "g5", "1ok", "2Ji", "65O", "4Dd", "4Ke", "7ng", "Sy", "04C", "h4", "2kD", "6Pj", "4eI", 
+"4hy", "5m9", "4m", "0SW", "09s", "2HX", "4S4", "4FU", "4M6", "4XW", "0cy", "1f9", "ng", "0MU", "42s", "573", "6Nh", "5kj", "v6", "cW", 
+"3KK", "0nI", "4Ug", "74m", "6oE", "4Zf", "0aH", "Bz", "lV", "y7", "40B", "6Ai", "582", "4yz", "0BT", "af", "OJ", "0lx", "4WV", "4B7", 
+"64Q", "4Ez", "1nu", "0k5", "7B", "0Px", "4kV", "7NT", "6SE", "4ff", "1Mi", "2hk", "PV", "E7", "4HJ", "69a", "6rh", "4GK", "J6", "2IF", 
+"5s", "0RI", "4ig", "7Le", "4q6", "4dW", "1OX", "8C", "Rg", "0qU", "5ZZ", "7oy", "4Ty", "5Q9", "Le", "0oW", "1QZ", "bI", "4o4", "4zU", 
+"43m", "6BF", "oy", "0LK", "T4", "AU", "6lj", "4YI", "4VH", "6ck", "NT", "0mf", "0CJ", "22a", "6MG", "4xd", "4uT", "7PV", "mH", "0Nz", 
+"1pw", "Cd", "aDI", "5KY", "1Ls", "0I3", "axM", "53U", "4IP", "7lR", "QL", "06v", "1oo", "2Jm", "65K", "5TA", "4jL", "7ON", "6X", "g1", 
+"h0", "9Y", "6Pn", "4eM", "4Ka", "7nc", "2El", "04G", "09w", "d6g", "4S0", "4FQ", "bRN", "a3D", "4i", "0SS", "nc", "0MQ", "42w", "577", 
+"4M2", "4XS", "17T", "dlm", "3KO", "0nM", "4Uc", "74i", "6Nl", "5kn", "v2", "cS", "lR", "y3", "40F", "6Am", "6oA", "4Zb", "0aL", "2To", 
+"ON", "18U", "4WR", "4B3", "586", "bCM", "0BP", "ab", "PZ", "0sh", "4HF", "69m", "6SI", "4fj", "1Me", "2hg", "7N", "0Pt", "4kZ", "7NX", 
+"6pU", "4Ev", "1ny", "0k9", "Rk", "05Q", "4Jw", "5O7", "452", "50r", "1OT", "8O", "qw", "0RE", "4ik", "7Li", "66l", "4GG", "08a", "2IJ", 
+"T8", "AY", "6lf", "4YE", "43a", "6BJ", "ou", "0LG", "0Aw", "bE", "4o8", "4zY", "4Tu", "5Q5", "Li", "8fC", "14s", "Ch", "6nW", "5KU", 
+"41P", "7PZ", "mD", "0Nv", "0CF", "22m", "6MK", "4xh", "4VD", "6cg", "NX", "0mj", "5za", "7OB", "6T", "0Qn", "1oc", "2Ja", "65G", "4Dl", 
+"b7g", "68w", "1w2", "06z", "8UF", "dSN", "5b0", "4gp", "4hq", "5m1", "4e", "8ZG", "1mR", "1x3", "67v", "726", "4Km", "7no", "Sq", "04K", 
+"1NN", "9U", "6Pb", "4eA", "adr", "5kb", "26", "21F", "Ms", "0nA", "4Uo", "74e", "79U", "bbl", "0cq", "1f1", "no", "396", "4vs", "5s3", 
+"6LQ", "4yr", "367", "an", "OB", "0lp", "bmm", "76T", "6oM", "4Zn", "15i", "Br", "2zO", "0Ol", "40J", "6Aa", "6SM", "4fn", "1Ma", "2hc", 
+"2FO", "07d", "4HB", "69i", "64Y", "4Er", "83L", "d5D", "7J", "0Pp", "bQm", "a0g", "456", "50v", "1OP", "8K", "Ro", "05U", "4Js", "5O3", 
+"66h", "4GC", "08e", "2IN", "qs", "0RA", "4io", "7Lm", "43e", "6BN", "oq", "0LC", "0bo", "2WL", "6lb", "4YA", "4Tq", "5Q1", "Lm", "8fG", 
+"0As", "bA", "ael", "cPO", "41T", "ajm", "1K2", "0Nr", "14w", "Cl", "6nS", "5KQ", "5Fa", "6cc", "2XM", "0mn", "0CB", "22i", "6MO", "4xl", 
+"1og", "2Je", "65C", "4Dh", "4jD", "7OF", "6P", "g9", "3l9", "2iy", "5b4", "4gt", "4IX", "68s", "QD", "0rv", "1mV", "1x7", "4S8", "4FY", 
+"4hu", "5m5", "4a", "1Cz", "h8", "9Q", "6Pf", "4eE", "4Ki", "7nk", "Su", "04O", "Mw", "0nE", "4Uk", "74a", "6Nd", "5kf", "22", "21B", 
+"nk", "0MY", "4vw", "5s7", "6mx", "5Hz", "0cu", "1f5", "OF", "0lt", "4WZ", "6by", "6LU", "4yv", "0BX", "aj", "lZ", "0Oh", "40N", "6Ae", 
+"6oI", "4Zj", "0aD", "Bv", "5f", "9Ke", "4ir", "5l2", "66u", "735", "08x", "1y0", "Rr", "05H", "4Jn", "7ol", "6Qa", "4dB", "1OM", "8V", 
+"7W", "0Pm", "4kC", "7NA", "64D", "4Eo", "83Q", "2Kb", "PC", "07y", "b6d", "69t", "5c3", "4fs", "8TE", "dRM", "374", "22t", "599", "4xq", 
+"bln", "77W", "NA", "0ms", "14j", "Cq", "6nN", "5KL", "41I", "7PC", "3km", "0No", "35", "20E", "6Oc", "5ja", "4Tl", "6aO", "Lp", "0oB", 
+"0br", "1g2", "78V", "bco", "43x", "568", "ol", "385", "4Kt", "5N4", "Sh", "04R", "1NW", "9L", "441", "4eX", "4hh", "7Mj", "pt", "0SF", 
+"K9", "2HI", "67o", "4FD", "4IE", "68n", "QY", "0", "1Lf", "2id", "6RJ", "4gi", "4jY", "auh", "6M", "0Qw", "1oz", "2Jx", "5A5", "4Du", 
+"6oT", "4Zw", "0aY", "Bk", "lG", "0Ou", "40S", "6Ax", "6LH", "4yk", "0BE", "aw", "2YJ", "0li", "4WG", "6bd", "6me", "4XF", "0ch", "2VK", 
+"nv", "0MD", "42b", "6CI", "6Ny", "7K9", "1PU", "cF", "Mj", "0nX", "4Uv", "5P6", "66q", "4GZ", "1lU", "1y4", "5b", "0RX", "4iv", "5l6", 
+"6Qe", "4dF", "1OI", "8R", "Rv", "05L", "4Jj", "7oh", "6pH", "4Ek", "1nd", "2Kf", "7S", "0Pi", "4kG", "7NE", "5c7", "4fw", "1Mx", "0H8", 
+"PG", "0su", "5Xz", "69p", "4VY", "4C8", "NE", "0mw", "1Sz", "22p", "6MV", "4xu", "41M", "7PG", "mY", "x8", "14n", "Cu", "6nJ", "5KH", 
+"4Th", "6aK", "Lt", "0oF", "31", "bX", "6Og", "4zD", "4wt", "5r4", "oh", "0LZ", "0bv", "AD", "4L9", "4YX", "1NS", "9H", "445", "51u", 
+"4Kp", "5N0", "Sl", "04V", "09f", "2HM", "67k", "5Va", "4hl", "7Mn", "4x", "0SB", "1Lb", "3yA", "6RN", "4gm", "4IA", "68j", "2GL", "4", 
+"82O", "d4G", "5A1", "4Dq", "bPn", "a1d", "6I", "0Qs", "lC", "0Oq", "40W", "akn", "6oP", "4Zs", "15t", "Bo", "2YN", "0lm", "4WC", "76I", 
+"6LL", "4yo", "0BA", "as", "nr", "8DX", "42f", "6CM", "6ma", "4XB", "0cl", "2VO", "Mn", "8gD", "4Ur", "5P2", "ado", "bAm", "1PQ", "cB", 
+"Rz", "0qH", "4Jf", "7od", "6Qi", "4dJ", "i7", "2jG", "5n", "0RT", "4iz", "7Lx", "4R7", "4GV", "08p", "1y8", "PK", "07q", "4HW", "7mU", 
+"6SX", "52R", "1Mt", "0H4", "sW", "f6", "4kK", "7NI", "64L", "4Eg", "1nh", "2Kj", "14b", "Cy", "6nF", "5KD", "41A", "7PK", "mU", "x4", 
+"0CW", "0V6", "591", "4xy", "4VU", "4C4", "NI", "19R", "0bz", "AH", "4L5", "4YT", "43p", "560", "od", "0LV", "w5", "bT", "6Ok", "4zH", 
+"4Td", "6aG", "Lx", "0oJ", "5xA", "7Mb", "4t", "0SN", "K1", "2HA", "67g", "4FL", "b5G", "aTM", "0e3", "04Z", "8Wf", "9D", "449", "4eP", 
+"4jQ", "7OS", "6E", "255", "1or", "0j2", "65V", "cno", "4IM", "68f", "QQ", "8", "1Ln", "2il", "6RB", "4ga", "afR", "4yc", "0BM", "23f", 
+"OS", "Z2", "4WO", "6bl", "aEN", "c4e", "0aQ", "Bc", "lO", "8Fe", "4tS", "4a2", "4n3", "5ks", "8Id", "cN", "Mb", "0nP", "614", "74t", 
+"6mm", "4XN", "U3", "2VC", "2xo", "0ML", "42j", "6CA", "6Qm", "4dN", "i3", "8Z", "2Do", "05D", "4Jb", "aUS", "4R3", "4GR", "08t", "d7d", 
+"5j", "0RP", "bSM", "a2G", "ayN", "52V", "1Mp", "0H0", "PO", "07u", "4HS", "69x", "64H", "4Ec", "1nl", "2Kn", "sS", "f2", "4kO", "7NM", 
+"41E", "7PO", "mQ", "x0", "14f", "2Ul", "6nB", "aQ1", "4VQ", "4C0", "NM", "19V", "0CS", "0V2", "595", "bBN", "43t", "564", "0Y3", "0LR", 
+"16W", "AL", "4L1", "4YP", "5DA", "6aC", "2Zm", "0oN", "39", "bP", "6Oo", "4zL", "K5", "2HE", "67c", "4FH", "4hd", "7Mf", "4p", "0SJ", 
+"8Wb", "2kY", "4p5", "4eT", "4Kx", "5N8", "Sd", "0pV", "1ov", "0j6", "5A9", "4Dy", "4jU", "7OW", "6A", "1AZ", "1Lj", "2ih", "6RF", "4ge", 
+"4II", "68b", "QU", "D4", "OW", "Z6", "4WK", "6bh", "6LD", "4yg", "0BI", "23b", "lK", "0Oy", "4tW", "4a6", "6oX", "5JZ", "0aU", "Bg", 
+"Mf", "0nT", "4Uz", "74p", "4n7", "5kw", "1PY", "cJ", "nz", "0MH", "42n", "6CE", "6mi", "4XJ", "U7", "2VG", "4MP", "4X1", "UL", "02v", 
+"0XR", "0M3", "a8E", "57U", "4nL", "7KN", "2X", "c1", "1ko", "2Nm", "61K", "5PA", "4Oa", "6zB", "2Al", "00G", "l0", "yQ", "6Tn", "4aM", 
+"58T", "a7D", "0i", "0WS", "84o", "ZM", "4W0", "4BQ", "4I2", "5Lr", "13T", "G", "jc", "0IQ", "46w", "537", "6Jl", "5on", "r2", "gS", 
+"3OO", "0jM", "4Qc", "70i", "6kA", "5NC", "0eL", "2Po", "hR", "8Bx", "44F", "6Em", "abO", "49v", "0FP", "eb", "KN", "8ad", "4SR", "4F3", 
+"3B", "0Tx", "4oV", "4z7", "60Q", "4Az", "0zT", "Yf", "TV", "A7", "4LJ", "6yi", "6WE", "4bf", "0YH", "zz", "1s", "0VI", "4mg", "6XD", 
+"6vh", "4CK", "N6", "2MF", "Vg", "0uU", "6n9", "7ky", "4u6", "5pv", "1KX", "xK", "1UZ", "fI", "4k4", "5nt", "4Py", "5U9", "He", "0kW", 
+"P4", "EU", "6hj", "5Mh", "47m", "6FF", "ky", "0HK", "0GJ", "dx", "6IG", "48l", "4RH", "6gk", "JT", "0if", "0dV", "Gd", "5Z8", "5OY", 
+"4qT", "4d5", "iH", "0Jz", "0XV", "0M7", "5f8", "4cx", "4MT", "4X5", "UH", "02r", "1kk", "Xx", "61O", "5PE", "4nH", "7KJ", "vT", "c5", 
+"l4", "yU", "6Tj", "4aI", "4Oe", "6zF", "Wy", "00C", "1iZ", "ZI", "4W4", "4BU", "4ly", "5i9", "0m", "0WW", "jg", "0IU", "46s", "533", 
+"4I6", "5Lv", "0gy", "C", "3OK", "0jI", "4Qg", "6dD", "6Jh", "5oj", "r6", "gW", "hV", "0Kd", "44B", "6Ei", "6kE", "5NG", "0eH", "Fz", 
+"KJ", "0hx", "4SV", "4F7", "6HY", "49r", "0FT", "ef", "60U", "ckl", "0zP", "Yb", "3F", "206", "4oR", "4z3", "6WA", "4bb", "0YL", "2lo", 
+"TR", "A3", "4LN", "6ym", "62d", "4CO", "N2", "2MB", "1w", "0VM", "4mc", "7Ha", "4u2", "54z", "8Re", "xO", "Vc", "01Y", "b0D", "aQN", 
+"647", "71w", "Ha", "0kS", "8Lg", "fM", "4k0", "5np", "47i", "6FB", "29d", "0HO", "P0", "EQ", "6hn", "5Ml", "4RL", "6go", "JP", "0ib", 
+"0GN", "26e", "6IC", "48h", "45X", "4d1", "iL", "8Cf", "0dR", "0q3", "hYt", "beO", "4nD", "7KF", "2P", "c9", "1kg", "Xt", "61C", "5PI", 
+"4MX", "4X9", "UD", "0vv", "0XZ", "2my", "5f4", "4ct", "4lu", "5i5", "0a", "1Gz", "0yw", "ZE", "4W8", "4BY", "4Oi", "6zJ", "Wu", "00O", 
+"l8", "yY", "6Tf", "4aE", "6Jd", "5of", "62", "25B", "Iw", "0jE", "4Qk", "6dH", "6ix", "5Lz", "0gu", "O", "jk", "0IY", "4rw", "5w7", 
+"5x6", "5mW", "0FX", "ej", "KF", "0ht", "4SZ", "6fy", "6kI", "5NK", "0eD", "Fv", "hZ", "93", "44N", "6Ee", "2BO", "03d", "4LB", "6ya", 
+"6WM", "4bn", "1Ia", "zr", "3J", "0Tp", "bUm", "a4g", "5D2", "4Ar", "87L", "Yn", "Vo", "01U", "4Ns", "5K3", "416", "54v", "1KP", "xC", 
+"us", "0VA", "4mo", "6XL", "62h", "4CC", "0xm", "2MN", "0fo", "2SL", "6hb", "bgr", "47e", "6FN", "kq", "0HC", "0Es", "fA", "aal", "bDn", 
+"4Pq", "5U1", "Hm", "8bG", "10w", "Gl", "5Z0", "5OQ", "45T", "anm", "1O2", "0Jr", "0GB", "dp", "6IO", "48d", "5Ba", "6gc", "3Ll", "0in", 
+"1kc", "Xp", "61G", "5PM", "bTs", "7KB", "2T", "0Un", "8QF", "39T", "5f0", "4cp", "797", "aRm", "1s2", "02z", "0ys", "ZA", "63v", "766", 
+"4lq", "5i1", "0e", "9Nf", "0Zo", "2oL", "6Tb", "4aA", "4Om", "6zN", "Wq", "00K", "Is", "0jA", "4Qo", "6dL", "7ZA", "5ob", "66", "25F", 
+"jo", "9Pd", "4rs", "5w3", "aCn", "bfl", "0gq", "K", "KB", "0hp", "bim", "72T", "5x2", "49z", "327", "en", "3nn", "97", "44J", "6Ea", 
+"6kM", "5NO", "11i", "Fr", "6WI", "4bj", "0YD", "zv", "TZ", "0wh", "4LF", "6ye", "5D6", "4Av", "0zX", "Yj", "3N", "0Tt", "4oZ", "6Zy", 
+"412", "54r", "1KT", "xG", "Vk", "01Q", "4Nw", "5K7", "62l", "4CG", "0xi", "2MJ", "uw", "0VE", "4mk", "6XH", "47a", "6FJ", "ku", "0HG", 
+"P8", "EY", "6hf", "5Md", "4Pu", "5U5", "Hi", "8bC", "0Ew", "fE", "4k8", "5nx", "45P", "4d9", "iD", "0Jv", "0dZ", "Gh", "5Z4", "5OU", 
+"4RD", "6gg", "JX", "0ij", "0GF", "dt", "6IK", "5lI", "4Op", "5J0", "Wl", "00V", "0Zr", "2oQ", "405", "55u", "4ll", "6YO", "0x", "0WB", 
+"0yn", "2LM", "63k", "5Ra", "4MA", "6xb", "2CL", "02g", "0XC", "39I", "6VN", "4cm", "bTn", "a5d", "2I", "0Us", "86O", "Xm", "5E1", "5PP", 
+"6kP", "5NR", "11t", "Fo", "hC", "0Kq", "44W", "aon", "6HL", "49g", "0FA", "es", "3Mo", "0hm", "4SC", "72I", "6ia", "5Lc", "0gl", "V", 
+"jr", "1Ya", "46f", "6GM", "hyV", "bEm", "0Dp", "gB", "In", "8cD", "4Qr", "5T2", "1b", "0VX", "4mv", "5h6", "62q", "4CZ", "0xt", "2MW", 
+"Vv", "01L", "4Nj", "7kh", "6Ue", "54o", "1KI", "xZ", "3S", "0Ti", "4oG", "6Zd", "6tH", "4Ak", "0zE", "Yw", "TG", "0wu", "780", "6yx", 
+"5g7", "4bw", "0YY", "zk", "1Wz", "di", "5y5", "5lT", "4RY", "4G8", "JE", "0iw", "0dG", "Gu", "6jJ", "5OH", "45M", "6Df", "iY", "80", 
+"71", "fX", "6Kg", "5ne", "4Ph", "6eK", "Ht", "0kF", "0fv", "ED", "4H9", "5My", "4st", "5v4", "kh", "0HZ", "0Zv", "yD", "401", "4aX", 
+"4Ot", "5J4", "Wh", "00R", "O9", "ZX", "63o", "4BD", "4lh", "6YK", "tt", "0WF", "0XG", "2md", "6VJ", "4ci", "4ME", "6xf", "UY", "02c", 
+"1kz", "Xi", "5E5", "5PT", "4nY", "aqh", "2M", "0Uw", "hG", "0Ku", "44S", "6Ex", "6kT", "5NV", "0eY", "Fk", "3Mk", "0hi", "4SG", "6fd", 
+"6HH", "49c", "0FE", "ew", "jv", "0ID", "46b", "6GI", "6ie", "5Lg", "0gh", "R", "Ij", "0jX", "4Qv", "5T6", "6Jy", "7O9", "0Dt", "gF", 
+"62u", "775", "0xp", "198", "1f", "9Oe", "4mr", "5h2", "6Ua", "54k", "1KM", "2nO", "Vr", "01H", "4Nn", "7kl", "60D", "4Ao", "0zA", "Ys", 
+"3W", "0Tm", "4oC", "7JA", "5g3", "4bs", "8PE", "zo", "TC", "03y", "784", "aSn", "bhn", "73W", "JA", "0is", "334", "dm", "5y1", "48y", 
+"45I", "6Db", "3om", "84", "0dC", "Gq", "6jN", "5OL", "4Pl", "6eO", "Hp", "0kB", "75", "24E", "6Kc", "5na", "47x", "528", "kl", "8AF", 
+"0fr", "1c2", "aBm", "bgo", "4ld", "6YG", "0p", "0WJ", "O5", "ZT", "63c", "4BH", "4Ox", "5J8", "Wd", "0tV", "0Zz", "yH", "4t5", "4aT", 
+"4nU", "7KW", "2A", "1EZ", "1kv", "Xe", "5E9", "5PX", "4MI", "6xj", "UU", "02o", "0XK", "2mh", "6VF", "4ce", "6HD", "49o", "0FI", "27b", 
+"KW", "0he", "4SK", "6fh", "6kX", "5NZ", "0eU", "Fg", "hK", "0Ky", "4pW", "4e6", "4j7", "5ow", "0Dx", "gJ", "If", "0jT", "4Qz", "6dY", 
+"6ii", "5Lk", "Q7", "DV", "jz", "0IH", "46n", "6GE", "3PN", "01D", "4Nb", "aQS", "6Um", "54g", "m3", "xR", "1j", "0VP", "59W", "a6G", 
+"4V3", "4CR", "85l", "194", "TO", "03u", "4LS", "4Y2", "a9F", "56V", "0YQ", "zc", "wS", "b2", "4oO", "6Zl", "60H", "4Ac", "0zM", "2On", 
+"0dO", "2Ql", "6jB", "aU1", "45E", "6Dn", "iQ", "88", "0GS", "da", "acL", "48u", "4RQ", "4G0", "JM", "94N", "12W", "EL", "4H1", "5Mq", 
+"47t", "524", "29y", "0HR", "79", "fP", "6Ko", "5nm", "aZ0", "6eC", "3NL", "0kN", "O1", "ZP", "63g", "4BL", "58I", "6YC", "0t", "0WN", 
+"8Sf", "yL", "409", "4aP", "b1G", "aPM", "0a3", "00Z", "1kr", "Xa", "61V", "bzN", "4nQ", "7KS", "2E", "215", "0XO", "2ml", "6VB", "4ca", 
+"4MM", "6xn", "UQ", "02k", "KS", "0ha", "4SO", "6fl", "7Xa", "49k", "0FM", "27f", "hO", "8Be", "4pS", "4e2", "aAN", "bdL", "0eQ", "Fc", 
+"Ib", "0jP", "654", "70t", "4j3", "5os", "8Md", "gN", "28g", "0IL", "46j", "6GA", "6im", "5Lo", "Q3", "Z", "6Ui", "54c", "m7", "xV", 
+"Vz", "0uH", "4Nf", "7kd", "4V7", "4CV", "0xx", "190", "1n", "0VT", "4mz", "6XY", "6WX", "56R", "0YU", "zg", "TK", "03q", "4LW", "4Y6", 
+"60L", "4Ag", "0zI", "2Oj", "wW", "b6", "4oK", "6Zh", "45A", "6Dj", "iU", "0Jg", "0dK", "Gy", "6jF", "5OD", "4RU", "4G4", "JI", "1yZ", 
+"0GW", "de", "5y9", "48q", "47p", "520", "kd", "0HV", "0fz", "EH", "4H5", "5Mu", "4Pd", "6eG", "Hx", "0kJ", "s5", "fT", "6Kk", "5ni", 
+"5Y1", "5LP", "13v", "e", "jA", "0Is", "46U", "aml", "6JN", "5oL", "0DC", "gq", "3Om", "0jo", "4QA", "6db", "6kc", "5Na", "0en", "2PM", 
+"hp", "0KB", "44d", "6EO", "abm", "49T", "0Fr", "1C2", "Kl", "8aF", "4Sp", "5V0", "4Mr", "5H2", "Un", "02T", "0Xp", "2mS", "427", "57w", 
+"4nn", "7Kl", "2z", "1Ea", "1kM", "2NO", "61i", "5Pc", "4OC", "7jA", "2AN", "00e", "0ZA", "ys", "6TL", "4ao", "58v", "a7f", "0K", "0Wq", 
+"84M", "Zo", "5G3", "4Bs", "0EY", "fk", "6KT", "5nV", "bjh", "6ex", "HG", "0ku", "0fE", "Ew", "6hH", "5MJ", "47O", "6Fd", "29B", "0Hi", 
+"53", "dZ", "6Ie", "48N", "4Rj", "6gI", "Jv", "0iD", "0dt", "GF", "6jy", "7o9", "4qv", "5t6", "ij", "0JX", "wh", "0TZ", "4ot", "5j4", 
+"4T9", "4AX", "0zv", "YD", "Tt", "03N", "4Lh", "6yK", "6Wg", "4bD", "o9", "zX", "1Q", "0Vk", "4mE", "6Xf", "62B", "4Ci", "0xG", "2Md", 
+"VE", "0uw", "4NY", "aQh", "5e5", "5pT", "1Kz", "xi", "jE", "0Iw", "46Q", "4g8", "5Y5", "5LT", "13r", "a", "IY", "0jk", "4QE", "6df", 
+"6JJ", "5oH", "0DG", "gu", "ht", "0KF", "4ph", "6EK", "6kg", "5Ne", "S9", "FX", "Kh", "0hZ", "4St", "5V4", "4h9", "49P", "0Fv", "eD", 
+"0Xt", "2mW", "423", "4cZ", "4Mv", "5H6", "Uj", "02P", "1kI", "XZ", "61m", "5Pg", "4nj", "7Kh", "vv", "0UD", "0ZE", "yw", "6TH", "4ak", 
+"4OG", "6zd", "2AJ", "00a", "0yY", "Zk", "5G7", "4Bw", "58r", "6Yx", "0O", "0Wu", "bjl", "71U", "HC", "0kq", "316", "fo", "6KP", "5nR", 
+"47K", "7VA", "29F", "0Hm", "0fA", "Es", "6hL", "5MN", "4Rn", "6gM", "Jr", "1ya", "57", "26G", "6Ia", "48J", "45z", "5t2", "in", "8CD", 
+"0dp", "GB", "hYV", "bem", "60w", "757", "0zr", "2OQ", "3d", "9Mg", "4op", "5j0", "6Wc", "56i", "0Yn", "2lM", "Tp", "03J", "4Ll", "6yO", 
+"62F", "4Cm", "0xC", "dwS", "1U", "0Vo", "4mA", "6Xb", "5e1", "54X", "8RG", "xm", "VA", "0us", "b0f", "aQl", "6JF", "5oD", "0DK", "gy", 
+"IU", "0jg", "4QI", "6dj", "5Y9", "5LX", "0gW", "m", "jI", "1YZ", "4rU", "4g4", "4h5", "5mu", "0Fz", "eH", "Kd", "0hV", "4Sx", "5V8", 
+"6kk", "5Ni", "S5", "FT", "hx", "0KJ", "44l", "6EG", "4nf", "7Kd", "2r", "0UH", "M7", "XV", "61a", "5Pk", "4Mz", "6xY", "Uf", "0vT", 
+"0Xx", "39r", "4v7", "4cV", "4lW", "4y6", "0C", "0Wy", "0yU", "Zg", "63P", "5RZ", "4OK", "6zh", "WW", "B6", "0ZI", "2oj", "6TD", "4ag", 
+"0fM", "2Sn", "7xa", "5MB", "47G", "6Fl", "kS", "0Ha", "0EQ", "fc", "aaN", "bDL", "4PS", "4E2", "HO", "8be", "10U", "GN", "4J3", "5Os", 
+"45v", "506", "ib", "0JP", "q3", "dR", "6Im", "48F", "4Rb", "6gA", "3LN", "0iL", "2Bm", "03F", "aF0", "6yC", "6Wo", "4bL", "o1", "zP", 
+"3h", "0TR", "bUO", "a4E", "4T1", "4AP", "87n", "YL", "VM", "01w", "4NQ", "7kS", "hfu", "54T", "1Kr", "xa", "1Y", "0Vc", "4mM", "6Xn", 
+"62J", "4Ca", "0xO", "2Ml", "IQ", "0jc", "4QM", "6dn", "6JB", "a19", "0DO", "25d", "jM", "9PF", "46Y", "4g0", "aCL", "687", "0gS", "i", 
+"3MP", "0hR", "676", "72v", "4h1", "49X", "8Of", "eL", "3nL", "0KN", "44h", "6EC", "6ko", "5Nm", "S1", "FP", "M3", "XR", "61e", "5Po", 
+"4nb", "aqS", "2v", "0UL", "8Qd", "39v", "4v3", "4cR", "b3E", "aRO", "Ub", "02X", "0yQ", "Zc", "63T", "bxL", "4lS", "4y2", "0G", "237", 
+"0ZM", "2on", "7Da", "4ac", "4OO", "6zl", "WS", "B2", "47C", "6Fh", "kW", "0He", "0fI", "2Sj", "6hD", "5MF", "4PW", "4E6", "HK", "0ky", 
+"0EU", "fg", "6KX", "5nZ", "45r", "502", "if", "0JT", "0dx", "GJ", "4J7", "5Ow", "4Rf", "6gE", "Jz", "0iH", "q7", "dV", "6Ii", "48B", 
+"6Wk", "4bH", "o5", "zT", "Tx", "03B", "4Ld", "6yG", "4T5", "4AT", "0zz", "YH", "3l", "0TV", "4ox", "5j8", "5e9", "54P", "1Kv", "xe", 
+"VI", "01s", "4NU", "7kW", "62N", "4Ce", "0xK", "2Mh", "uU", "0Vg", "4mI", "6Xj", "4K0", "5Np", "11V", "FM", "ha", "0KS", "44u", "515", 
+"6Hn", "49E", "48", "eQ", "3MM", "0hO", "4Sa", "6fB", "6iC", "5LA", "0gN", "t", "jP", "0Ib", "46D", "6Go", "hyt", "bEO", "0DR", "0Q3", 
+"IL", "8cf", "4QP", "4D1", "4OR", "4Z3", "WN", "00t", "0ZP", "yb", "hgv", "55W", "4lN", "6Ym", "0Z", "a3", "0yL", "2Lo", "63I", "4Bb", 
+"4Mc", "7ha", "2Cn", "02E", "n2", "2mB", "6Vl", "4cO", "bTL", "a5F", "2k", "0UQ", "86m", "XO", "4U2", "5Pr", "0Gy", "dK", "4i6", "5lv", 
+"5BZ", "6gX", "Jg", "0iU", "R6", "GW", "6jh", "5Oj", "45o", "6DD", "3oK", "0JI", "0EH", "fz", "6KE", "5nG", "4PJ", "6ei", "HV", "0kd", 
+"0fT", "Ef", "6hY", "690", "4sV", "4f7", "kJ", "0Hx", "uH", "0Vz", "4mT", "4x5", "5F8", "4Cx", "0xV", "0m7", "VT", "C5", "4NH", "7kJ", 
+"6UG", "54M", "1Kk", "xx", "3q", "0TK", "4oe", "6ZF", "60b", "4AI", "L4", "YU", "Te", "0wW", "4Ly", "5I9", "4w4", "4bU", "1IZ", "zI", 
+"he", "0KW", "44q", "511", "4K4", "5Nt", "11R", "FI", "Ky", "0hK", "4Se", "6fF", "6Hj", "49A", "p4", "eU", "jT", "0If", "4rH", "6Gk", 
+"6iG", "5LE", "0gJ", "p", "IH", "0jz", "4QT", "4D5", "5z8", "5oY", "0DV", "gd", "0ZT", "yf", "6TY", "4az", "4OV", "4Z7", "WJ", "00p", 
+"0yH", "Zz", "63M", "4Bf", "4lJ", "6Yi", "tV", "a7", "n6", "2mF", "6Vh", "4cK", "4Mg", "6xD", "2Cj", "02A", "1kX", "XK", "4U6", "5Pv", 
+"6N9", "7Ky", "2o", "0UU", "665", "73u", "Jc", "0iQ", "8Ne", "dO", "4i2", "5lr", "45k", "7Ta", "3oO", "0JM", "R2", "GS", "6jl", "5On", 
+"4PN", "6em", "HR", "8bx", "0EL", "24g", "6KA", "5nC", "47Z", "4f3", "kN", "8Ad", "0fP", "Eb", "aBO", "694", "62W", "byO", "0xR", "0m3", 
+"1D", "224", "4mP", "4x1", "6UC", "54I", "1Ko", "2nm", "VP", "C1", "4NL", "7kN", "60f", "4AM", "L0", "YQ", "3u", "0TO", "4oa", "6ZB", 
+"438", "4bQ", "8Pg", "zM", "Ta", "0wS", "b2F", "aSL", "6Hf", "49M", "40", "eY", "Ku", "0hG", "4Si", "6fJ", "4K8", "5Nx", "0ew", "FE", 
+"hi", "8BC", "4pu", "5u5", "5z4", "5oU", "0DZ", "gh", "ID", "0jv", "4QX", "4D9", "6iK", "5LI", "0gF", "Dt", "jX", "0Ij", "46L", "6Gg", 
+"4lF", "6Ye", "0R", "0Wh", "0yD", "Zv", "63A", "4Bj", "4OZ", "6zy", "WF", "0tt", "0ZX", "yj", "5d6", "4av", "4nw", "5k7", "2c", "0UY", 
+"1kT", "XG", "61p", "5Pz", "4Mk", "6xH", "Uw", "02M", "0Xi", "2mJ", "6Vd", "4cG", "0dm", "2QN", "7zA", "5Ob", "45g", "6DL", "is", "0JA", 
+"0Gq", "dC", "acn", "48W", "4Rs", "5W3", "Jo", "94l", "12u", "En", "5X2", "5MS", "47V", "alo", "kB", "0Hp", "1Ua", "fr", "6KM", "5nO", 
+"4PB", "6ea", "3Nn", "0kl", "3Pl", "01f", "bts", "7kB", "6UO", "54E", "1Kc", "xp", "1H", "0Vr", "59u", "a6e", "5F0", "4Cp", "85N", "d3F", 
+"Tm", "03W", "4Lq", "5I1", "434", "56t", "0Ys", "zA", "3y", "0TC", "4om", "6ZN", "60j", "4AA", "0zo", "2OL", "Kq", "0hC", "4Sm", "6fN", 
+"6Hb", "49I", "44", "27D", "hm", "8BG", "44y", "519", "aAl", "bdn", "0es", "FA", "1o2", "0jr", "bko", "70V", "5z0", "5oQ", "305", "gl", 
+"28E", "0In", "46H", "6Gc", "6iO", "5LM", "0gB", "x", "1ia", "Zr", "63E", "4Bn", "4lB", "6Ya", "0V", "0Wl", "8SD", "yn", "5d2", "4ar", 
+"b1e", "aPo", "WB", "00x", "1kP", "XC", "61t", "744", "4ns", "5k3", "2g", "9Ld", "0Xm", "2mN", "7FA", "4cC", "4Mo", "6xL", "Us", "02I", 
+"45c", "6DH", "iw", "0JE", "0di", "2QJ", "6jd", "5Of", "4Rw", "5W7", "Jk", "0iY", "0Gu", "dG", "6Ix", "48S", "47R", "6Fy", "kF", "0Ht", 
+"0fX", "Ej", "5X6", "5MW", "4PF", "6ee", "HZ", "0kh", "0ED", "fv", "6KI", "5nK", "6UK", "54A", "1Kg", "xt", "VX", "C9", "4ND", "7kF", 
+"5F4", "4Ct", "0xZ", "2My", "1L", "0Vv", "4mX", "4x9", "430", "4bY", "0Yw", "zE", "Ti", "03S", "4Lu", "5I5", "60n", "4AE", "L8", "YY", 
+"wu", "0TG", "4oi", "6ZJ" };
+
+
+#endif
+
diff --git a/redis-stable/src/crc64.c b/redis-stable/src/crc64.c
new file mode 100644
index 00000000..d4db4158
--- /dev/null
+++ b/redis-stable/src/crc64.c
@@ -0,0 +1,161 @@
+/* Copyright (c) 2014, Matt Stancliff <matt@genges.com>
+ * Copyright (c) 2020, Amazon Web Services
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE. */
+
+#include "crc64.h"
+#include "crcspeed.h"
+static uint64_t crc64_table[8][256] = {{0}};
+
+#define POLY UINT64_C(0xad93d23594c935a9)
+/******************** BEGIN GENERATED PYCRC FUNCTIONS ********************/
+/**
+ * Generated on Sun Dec 21 14:14:07 2014,
+ * by pycrc v0.8.2, https://www.tty1.net/pycrc/
+ *
+ * LICENSE ON GENERATED CODE:
+ * ==========================
+ * As of version 0.6, pycrc is released under the terms of the MIT licence.
+ * The code generated by pycrc is not considered a substantial portion of the
+ * software, therefore the author of pycrc will not claim any copyright on
+ * the generated code.
+ * ==========================
+ *
+ * CRC configuration:
+ *    Width        = 64
+ *    Poly         = 0xad93d23594c935a9
+ *    XorIn        = 0xffffffffffffffff
+ *    ReflectIn    = True
+ *    XorOut       = 0x0000000000000000
+ *    ReflectOut   = True
+ *    Algorithm    = bit-by-bit-fast
+ *
+ * Modifications after generation (by matt):
+ *   - included finalize step in-line with update for single-call generation
+ *   - re-worked some inner variable architectures
+ *   - adjusted function parameters to match expected prototypes.
+ *****************************************************************************/
+
+/**
+ * Reflect all bits of a \a data word of \a data_len bytes.
+ *
+ * \param data         The data word to be reflected.
+ * \param data_len     The width of \a data expressed in number of bits.
+ * \return             The reflected data.
+ *****************************************************************************/
+static inline uint_fast64_t crc_reflect(uint_fast64_t data, size_t data_len) {
+    uint_fast64_t ret = data & 0x01;
+
+    for (size_t i = 1; i < data_len; i++) {
+        data >>= 1;
+        ret = (ret << 1) | (data & 0x01);
+    }
+
+    return ret;
+}
+
+/**
+ *  Update the crc value with new data.
+ *
+ * \param crc      The current crc value.
+ * \param data     Pointer to a buffer of \a data_len bytes.
+ * \param data_len Number of bytes in the \a data buffer.
+ * \return         The updated crc value.
+ ******************************************************************************/
+uint64_t _crc64(uint_fast64_t crc, const void *in_data, const uint64_t len) {
+    const uint8_t *data = in_data;
+    unsigned long long bit;
+
+    for (uint64_t offset = 0; offset < len; offset++) {
+        uint8_t c = data[offset];
+        for (uint_fast8_t i = 0x01; i & 0xff; i <<= 1) {
+            bit = crc & 0x8000000000000000;
+            if (c & i) {
+                bit = !bit;
+            }
+
+            crc <<= 1;
+            if (bit) {
+                crc ^= POLY;
+            }
+        }
+
+        crc &= 0xffffffffffffffff;
+    }
+
+    crc = crc & 0xffffffffffffffff;
+    return crc_reflect(crc, 64) ^ 0x0000000000000000;
+}
+
+/******************** END GENERATED PYCRC FUNCTIONS ********************/
+
+/* Initializes the 16KB lookup tables. */
+void crc64_init(void) {
+    crcspeed64native_init(_crc64, crc64_table);
+}
+
+/* Compute crc64 */
+uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l) {
+    return crcspeed64native(crc64_table, crc, (void *) s, l);
+}
+
+/* Test main */
+#ifdef REDIS_TEST
+#include <stdio.h>
+
+#define UNUSED(x) (void)(x)
+int crc64Test(int argc, char *argv[], int accurate) {
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+    crc64_init();
+    printf("[calcula]: e9c6d914c4b8d9ca == %016" PRIx64 "\n",
+           (uint64_t)_crc64(0, "123456789", 9));
+    printf("[64speed]: e9c6d914c4b8d9ca == %016" PRIx64 "\n",
+           (uint64_t)crc64(0, (unsigned char*)"123456789", 9));
+    char li[] = "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed "
+                "do eiusmod tempor incididunt ut labore et dolore magna "
+                "aliqua. Ut enim ad minim veniam, quis nostrud exercitation "
+                "ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis "
+                "aute irure dolor in reprehenderit in voluptate velit esse "
+                "cillum dolore eu fugiat nulla pariatur. Excepteur sint "
+                "occaecat cupidatat non proident, sunt in culpa qui officia "
+                "deserunt mollit anim id est laborum.";
+    printf("[calcula]: c7794709e69683b3 == %016" PRIx64 "\n",
+           (uint64_t)_crc64(0, li, sizeof(li)));
+    printf("[64speed]: c7794709e69683b3 == %016" PRIx64 "\n",
+           (uint64_t)crc64(0, (unsigned char*)li, sizeof(li)));
+    return 0;
+}
+
+#endif
+
+#ifdef REDIS_TEST_MAIN
+int main(int argc, char *argv[]) {
+    return crc64Test(argc, argv);
+}
+
+#endif
diff --git a/redis-stable/src/crc64.h b/redis-stable/src/crc64.h
new file mode 100644
index 00000000..38b0b638
--- /dev/null
+++ b/redis-stable/src/crc64.h
@@ -0,0 +1,13 @@
+#ifndef CRC64_H
+#define CRC64_H
+
+#include <stdint.h>
+
+void crc64_init(void);
+uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l);
+
+#ifdef REDIS_TEST
+int crc64Test(int argc, char *argv[], int accurate);
+#endif
+
+#endif
diff --git a/redis-stable/src/crcspeed.c b/redis-stable/src/crcspeed.c
new file mode 100644
index 00000000..67cb8fd9
--- /dev/null
+++ b/redis-stable/src/crcspeed.c
@@ -0,0 +1,282 @@
+/*
+ * Copyright (C) 2013 Mark Adler
+ * Originally by: crc64.c Version 1.4  16 Dec 2013  Mark Adler
+ * Modifications by Matt Stancliff <matt@genges.com>:
+ *   - removed CRC64-specific behavior
+ *   - added generation of lookup tables by parameters
+ *   - removed inversion of CRC input/result
+ *   - removed automatic initialization in favor of explicit initialization
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler
+  madler@alumni.caltech.edu
+ */
+
+#include "crcspeed.h"
+
+/* Fill in a CRC constants table. */
+void crcspeed64little_init(crcfn64 crcfn, uint64_t table[8][256]) {
+    uint64_t crc;
+
+    /* generate CRCs for all single byte sequences */
+    for (int n = 0; n < 256; n++) {
+        unsigned char v = n;
+        table[0][n] = crcfn(0, &v, 1);
+    }
+
+    /* generate nested CRC table for future slice-by-8 lookup */
+    for (int n = 0; n < 256; n++) {
+        crc = table[0][n];
+        for (int k = 1; k < 8; k++) {
+            crc = table[0][crc & 0xff] ^ (crc >> 8);
+            table[k][n] = crc;
+        }
+    }
+}
+
+void crcspeed16little_init(crcfn16 crcfn, uint16_t table[8][256]) {
+    uint16_t crc;
+
+    /* generate CRCs for all single byte sequences */
+    for (int n = 0; n < 256; n++) {
+        table[0][n] = crcfn(0, &n, 1);
+    }
+
+    /* generate nested CRC table for future slice-by-8 lookup */
+    for (int n = 0; n < 256; n++) {
+        crc = table[0][n];
+        for (int k = 1; k < 8; k++) {
+            crc = table[0][(crc >> 8) & 0xff] ^ (crc << 8);
+            table[k][n] = crc;
+        }
+    }
+}
+
+/* Reverse the bytes in a 64-bit word. */
+static inline uint64_t rev8(uint64_t a) {
+#if defined(__GNUC__) || defined(__clang__)
+    return __builtin_bswap64(a);
+#else
+    uint64_t m;
+
+    m = UINT64_C(0xff00ff00ff00ff);
+    a = ((a >> 8) & m) | (a & m) << 8;
+    m = UINT64_C(0xffff0000ffff);
+    a = ((a >> 16) & m) | (a & m) << 16;
+    return a >> 32 | a << 32;
+#endif
+}
+
+/* This function is called once to initialize the CRC table for use on a
+   big-endian architecture. */
+void crcspeed64big_init(crcfn64 fn, uint64_t big_table[8][256]) {
+    /* Create the little endian table then reverse all the entries. */
+    crcspeed64little_init(fn, big_table);
+    for (int k = 0; k < 8; k++) {
+        for (int n = 0; n < 256; n++) {
+            big_table[k][n] = rev8(big_table[k][n]);
+        }
+    }
+}
+
+void crcspeed16big_init(crcfn16 fn, uint16_t big_table[8][256]) {
+    /* Create the little endian table then reverse all the entries. */
+    crcspeed16little_init(fn, big_table);
+    for (int k = 0; k < 8; k++) {
+        for (int n = 0; n < 256; n++) {
+            big_table[k][n] = rev8(big_table[k][n]);
+        }
+    }
+}
+
+/* Calculate a non-inverted CRC multiple bytes at a time on a little-endian
+ * architecture. If you need inverted CRC, invert *before* calling and invert
+ * *after* calling.
+ * 64 bit crc = process 8 bytes at once;
+ */
+uint64_t crcspeed64little(uint64_t little_table[8][256], uint64_t crc,
+                          void *buf, size_t len) {
+    unsigned char *next = buf;
+
+    /* process individual bytes until we reach an 8-byte aligned pointer */
+    while (len && ((uintptr_t)next & 7) != 0) {
+        crc = little_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);
+        len--;
+    }
+
+    /* fast middle processing, 8 bytes (aligned!) per loop */
+    while (len >= 8) {
+        crc ^= *(uint64_t *)next;
+        crc = little_table[7][crc & 0xff] ^
+              little_table[6][(crc >> 8) & 0xff] ^
+              little_table[5][(crc >> 16) & 0xff] ^
+              little_table[4][(crc >> 24) & 0xff] ^
+              little_table[3][(crc >> 32) & 0xff] ^
+              little_table[2][(crc >> 40) & 0xff] ^
+              little_table[1][(crc >> 48) & 0xff] ^
+              little_table[0][crc >> 56];
+        next += 8;
+        len -= 8;
+    }
+
+    /* process remaining bytes (can't be larger than 8) */
+    while (len) {
+        crc = little_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);
+        len--;
+    }
+
+    return crc;
+}
+
+uint16_t crcspeed16little(uint16_t little_table[8][256], uint16_t crc,
+                          void *buf, size_t len) {
+    unsigned char *next = buf;
+
+    /* process individual bytes until we reach an 8-byte aligned pointer */
+    while (len && ((uintptr_t)next & 7) != 0) {
+        crc = little_table[0][((crc >> 8) ^ *next++) & 0xff] ^ (crc << 8);
+        len--;
+    }
+
+    /* fast middle processing, 8 bytes (aligned!) per loop */
+    while (len >= 8) {
+        uint64_t n = *(uint64_t *)next;
+        crc = little_table[7][(n & 0xff) ^ ((crc >> 8) & 0xff)] ^
+              little_table[6][((n >> 8) & 0xff) ^ (crc & 0xff)] ^
+              little_table[5][(n >> 16) & 0xff] ^
+              little_table[4][(n >> 24) & 0xff] ^
+              little_table[3][(n >> 32) & 0xff] ^
+              little_table[2][(n >> 40) & 0xff] ^
+              little_table[1][(n >> 48) & 0xff] ^
+              little_table[0][n >> 56];
+        next += 8;
+        len -= 8;
+    }
+
+    /* process remaining bytes (can't be larger than 8) */
+    while (len) {
+        crc = little_table[0][((crc >> 8) ^ *next++) & 0xff] ^ (crc << 8);
+        len--;
+    }
+
+    return crc;
+}
+
+/* Calculate a non-inverted CRC eight bytes at a time on a big-endian
+ * architecture.
+ */
+uint64_t crcspeed64big(uint64_t big_table[8][256], uint64_t crc, void *buf,
+                       size_t len) {
+    unsigned char *next = buf;
+
+    crc = rev8(crc);
+    while (len && ((uintptr_t)next & 7) != 0) {
+        crc = big_table[0][(crc >> 56) ^ *next++] ^ (crc << 8);
+        len--;
+    }
+
+    while (len >= 8) {
+        crc ^= *(uint64_t *)next;
+        crc = big_table[0][crc & 0xff] ^
+              big_table[1][(crc >> 8) & 0xff] ^
+              big_table[2][(crc >> 16) & 0xff] ^
+              big_table[3][(crc >> 24) & 0xff] ^
+              big_table[4][(crc >> 32) & 0xff] ^
+              big_table[5][(crc >> 40) & 0xff] ^
+              big_table[6][(crc >> 48) & 0xff] ^
+              big_table[7][crc >> 56];
+        next += 8;
+        len -= 8;
+    }
+
+    while (len) {
+        crc = big_table[0][(crc >> 56) ^ *next++] ^ (crc << 8);
+        len--;
+    }
+
+    return rev8(crc);
+}
+
+/* WARNING: Completely untested on big endian architecture.  Possibly broken. */
+uint16_t crcspeed16big(uint16_t big_table[8][256], uint16_t crc_in, void *buf,
+                       size_t len) {
+    unsigned char *next = buf;
+    uint64_t crc = crc_in;
+
+    crc = rev8(crc);
+    while (len && ((uintptr_t)next & 7) != 0) {
+        crc = big_table[0][((crc >> (56 - 8)) ^ *next++) & 0xff] ^ (crc >> 8);
+        len--;
+    }
+
+    while (len >= 8) {
+        uint64_t n = *(uint64_t *)next;
+        crc = big_table[0][(n & 0xff) ^ ((crc >> (56 - 8)) & 0xff)] ^
+              big_table[1][((n >> 8) & 0xff) ^ (crc & 0xff)] ^
+              big_table[2][(n >> 16) & 0xff] ^
+              big_table[3][(n >> 24) & 0xff] ^
+              big_table[4][(n >> 32) & 0xff] ^
+              big_table[5][(n >> 40) & 0xff] ^
+              big_table[6][(n >> 48) & 0xff] ^
+              big_table[7][n >> 56];
+        next += 8;
+        len -= 8;
+    }
+
+    while (len) {
+        crc = big_table[0][((crc >> (56 - 8)) ^ *next++) & 0xff] ^ (crc >> 8);
+        len--;
+    }
+
+    return rev8(crc);
+}
+
+/* Return the CRC of buf[0..len-1] with initial crc, processing eight bytes
+   at a time using passed-in lookup table.
+   This selects one of two routines depending on the endianess of
+   the architecture. */
+uint64_t crcspeed64native(uint64_t table[8][256], uint64_t crc, void *buf,
+                          size_t len) {
+    uint64_t n = 1;
+
+    return *(char *)&n ? crcspeed64little(table, crc, buf, len)
+                       : crcspeed64big(table, crc, buf, len);
+}
+
+uint16_t crcspeed16native(uint16_t table[8][256], uint16_t crc, void *buf,
+                          size_t len) {
+    uint64_t n = 1;
+
+    return *(char *)&n ? crcspeed16little(table, crc, buf, len)
+                       : crcspeed16big(table, crc, buf, len);
+}
+
+/* Initialize CRC lookup table in architecture-dependent manner. */
+void crcspeed64native_init(crcfn64 fn, uint64_t table[8][256]) {
+    uint64_t n = 1;
+
+    *(char *)&n ? crcspeed64little_init(fn, table)
+                : crcspeed64big_init(fn, table);
+}
+
+void crcspeed16native_init(crcfn16 fn, uint16_t table[8][256]) {
+    uint64_t n = 1;
+
+    *(char *)&n ? crcspeed16little_init(fn, table)
+                : crcspeed16big_init(fn, table);
+}
diff --git a/redis-stable/src/crcspeed.h b/redis-stable/src/crcspeed.h
new file mode 100644
index 00000000..d7ee95eb
--- /dev/null
+++ b/redis-stable/src/crcspeed.h
@@ -0,0 +1,60 @@
+/* Copyright (c) 2014, Matt Stancliff <matt@genges.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE. */
+
+#ifndef CRCSPEED_H
+#define CRCSPEED_H
+
+#include <inttypes.h>
+#include <stdio.h>
+
+typedef uint64_t (*crcfn64)(uint64_t, const void *, const uint64_t);
+typedef uint16_t (*crcfn16)(uint16_t, const void *, const uint64_t);
+
+/* CRC-64 */
+void crcspeed64little_init(crcfn64 fn, uint64_t table[8][256]);
+void crcspeed64big_init(crcfn64 fn, uint64_t table[8][256]);
+void crcspeed64native_init(crcfn64 fn, uint64_t table[8][256]);
+
+uint64_t crcspeed64little(uint64_t table[8][256], uint64_t crc, void *buf,
+                          size_t len);
+uint64_t crcspeed64big(uint64_t table[8][256], uint64_t crc, void *buf,
+                       size_t len);
+uint64_t crcspeed64native(uint64_t table[8][256], uint64_t crc, void *buf,
+                          size_t len);
+
+/* CRC-16 */
+void crcspeed16little_init(crcfn16 fn, uint16_t table[8][256]);
+void crcspeed16big_init(crcfn16 fn, uint16_t table[8][256]);
+void crcspeed16native_init(crcfn16 fn, uint16_t table[8][256]);
+
+uint16_t crcspeed16little(uint16_t table[8][256], uint16_t crc, void *buf,
+                          size_t len);
+uint16_t crcspeed16big(uint16_t table[8][256], uint16_t crc, void *buf,
+                       size_t len);
+uint16_t crcspeed16native(uint16_t table[8][256], uint16_t crc, void *buf,
+                          size_t len);
+#endif
diff --git a/redis-stable/src/db.c b/redis-stable/src/db.c
new file mode 100644
index 00000000..c8d6199d
--- /dev/null
+++ b/redis-stable/src/db.c
@@ -0,0 +1,2009 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "cluster.h"
+#include "atomicvar.h"
+#include "latency.h"
+
+#include <signal.h>
+#include <ctype.h>
+
+/* Database backup. */
+struct dbBackup {
+    redisDb *dbarray;
+    rax *slots_to_keys;
+    uint64_t slots_keys_count[CLUSTER_SLOTS];
+};
+
+/*-----------------------------------------------------------------------------
+ * C-level DB API
+ *----------------------------------------------------------------------------*/
+
+int keyIsExpired(redisDb *db, robj *key);
+
+/* Update LFU when an object is accessed.
+ * Firstly, decrement the counter if the decrement time is reached.
+ * Then logarithmically increment the counter, and update the access time. */
+void updateLFU(robj *val) {
+    unsigned long counter = LFUDecrAndReturn(val);
+    counter = LFULogIncr(counter);
+    val->lru = (LFUGetTimeInMinutes()<<8) | counter;
+}
+
+/* Low level key lookup API, not actually called directly from commands
+ * implementations that should instead rely on lookupKeyRead(),
+ * lookupKeyWrite() and lookupKeyReadWithFlags(). */
+robj *lookupKey(redisDb *db, robj *key, int flags) {
+    dictEntry *de = dictFind(db->dict,key->ptr);
+    if (de) {
+        robj *val = dictGetVal(de);
+
+        /* Update the access time for the ageing algorithm.
+         * Don't do it if we have a saving child, as this will trigger
+         * a copy on write madness. */
+        if (!hasActiveChildProcess() && !(flags & LOOKUP_NOTOUCH)){
+            if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+                updateLFU(val);
+            } else {
+                val->lru = LRU_CLOCK();
+            }
+        }
+        return val;
+    } else {
+        return NULL;
+    }
+}
+
+/* Lookup a key for read operations, or return NULL if the key is not found
+ * in the specified DB.
+ *
+ * As a side effect of calling this function:
+ * 1. A key gets expired if it reached it's TTL.
+ * 2. The key last access time is updated.
+ * 3. The global keys hits/misses stats are updated (reported in INFO).
+ * 4. If keyspace notifications are enabled, a "keymiss" notification is fired.
+ *
+ * This API should not be used when we write to the key after obtaining
+ * the object linked to the key, but only for read only operations.
+ *
+ * Flags change the behavior of this command:
+ *
+ *  LOOKUP_NONE (or zero): no special flags are passed.
+ *  LOOKUP_NOTOUCH: don't alter the last access time of the key.
+ *
+ * Note: this function also returns NULL if the key is logically expired
+ * but still existing, in case this is a slave, since this API is called only
+ * for read operations. Even if the key expiry is master-driven, we can
+ * correctly report a key is expired on slaves even if the master is lagging
+ * expiring our key via DELs in the replication link. */
+robj *lookupKeyReadWithFlags(redisDb *db, robj *key, int flags) {
+    robj *val;
+
+    if (expireIfNeeded(db,key) == 1) {
+        /* If we are in the context of a master, expireIfNeeded() returns 1
+         * when the key is no longer valid, so we can return NULL ASAP. */
+        if (server.masterhost == NULL)
+            goto keymiss;
+
+        /* However if we are in the context of a slave, expireIfNeeded() will
+         * not really try to expire the key, it only returns information
+         * about the "logical" status of the key: key expiring is up to the
+         * master in order to have a consistent view of master's data set.
+         *
+         * However, if the command caller is not the master, and as additional
+         * safety measure, the command invoked is a read-only command, we can
+         * safely return NULL here, and provide a more consistent behavior
+         * to clients accessing expired values in a read-only fashion, that
+         * will say the key as non existing.
+         *
+         * Notably this covers GETs when slaves are used to scale reads. */
+        if (server.current_client &&
+            server.current_client != server.master &&
+            server.current_client->cmd &&
+            server.current_client->cmd->flags & CMD_READONLY)
+        {
+            goto keymiss;
+        }
+    }
+    val = lookupKey(db,key,flags);
+    if (val == NULL)
+        goto keymiss;
+    server.stat_keyspace_hits++;
+    return val;
+
+keymiss:
+    if (!(flags & LOOKUP_NONOTIFY)) {
+        notifyKeyspaceEvent(NOTIFY_KEY_MISS, "keymiss", key, db->id);
+    }
+    server.stat_keyspace_misses++;
+    return NULL;
+}
+
+/* Like lookupKeyReadWithFlags(), but does not use any flag, which is the
+ * common case. */
+robj *lookupKeyRead(redisDb *db, robj *key) {
+    return lookupKeyReadWithFlags(db,key,LOOKUP_NONE);
+}
+
+/* Lookup a key for write operations, and as a side effect, if needed, expires
+ * the key if its TTL is reached.
+ *
+ * Returns the linked value object if the key exists or NULL if the key
+ * does not exist in the specified DB. */
+robj *lookupKeyWriteWithFlags(redisDb *db, robj *key, int flags) {
+    expireIfNeeded(db,key);
+    return lookupKey(db,key,flags);
+}
+
+robj *lookupKeyWrite(redisDb *db, robj *key) {
+    return lookupKeyWriteWithFlags(db, key, LOOKUP_NONE);
+}
+void SentReplyOnKeyMiss(client *c, robj *reply){
+    serverAssert(sdsEncodedObject(reply));
+    sds rep = reply->ptr;
+    if (sdslen(rep) > 1 && rep[0] == '-'){
+        addReplyErrorObject(c, reply);
+    } else {
+        addReply(c,reply);
+    }
+}
+robj *lookupKeyReadOrReply(client *c, robj *key, robj *reply) {
+    robj *o = lookupKeyRead(c->db, key);
+    if (!o) SentReplyOnKeyMiss(c, reply);
+    return o;
+}
+
+robj *lookupKeyWriteOrReply(client *c, robj *key, robj *reply) {
+    robj *o = lookupKeyWrite(c->db, key);
+    if (!o) SentReplyOnKeyMiss(c, reply);
+    return o;
+}
+
+/* Add the key to the DB. It's up to the caller to increment the reference
+ * counter of the value if needed.
+ *
+ * The program is aborted if the key already exists. */
+void dbAdd(redisDb *db, robj *key, robj *val) {
+    sds copy = sdsdup(key->ptr);
+    int retval = dictAdd(db->dict, copy, val);
+
+    serverAssertWithInfo(NULL,key,retval == DICT_OK);
+    signalKeyAsReady(db, key, val->type);
+    if (server.cluster_enabled) slotToKeyAdd(key->ptr);
+}
+
+/* This is a special version of dbAdd() that is used only when loading
+ * keys from the RDB file: the key is passed as an SDS string that is
+ * retained by the function (and not freed by the caller).
+ *
+ * Moreover this function will not abort if the key is already busy, to
+ * give more control to the caller, nor will signal the key as ready
+ * since it is not useful in this context.
+ *
+ * The function returns 1 if the key was added to the database, taking
+ * ownership of the SDS string, otherwise 0 is returned, and is up to the
+ * caller to free the SDS string. */
+int dbAddRDBLoad(redisDb *db, sds key, robj *val) {
+    int retval = dictAdd(db->dict, key, val);
+    if (retval != DICT_OK) return 0;
+    if (server.cluster_enabled) slotToKeyAdd(key);
+    return 1;
+}
+
+/* Overwrite an existing key with a new value. Incrementing the reference
+ * count of the new value is up to the caller.
+ * This function does not modify the expire time of the existing key.
+ *
+ * The program is aborted if the key was not already present. */
+void dbOverwrite(redisDb *db, robj *key, robj *val) {
+    dictEntry *de = dictFind(db->dict,key->ptr);
+
+    serverAssertWithInfo(NULL,key,de != NULL);
+    dictEntry auxentry = *de;
+    robj *old = dictGetVal(de);
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+        val->lru = old->lru;
+    }
+    /* Although the key is not really deleted from the database, we regard 
+    overwrite as two steps of unlink+add, so we still need to call the unlink 
+    callback of the module. */
+    moduleNotifyKeyUnlink(key,old);
+    dictSetVal(db->dict, de, val);
+
+    if (server.lazyfree_lazy_server_del) {
+        freeObjAsync(key,old);
+        dictSetVal(db->dict, &auxentry, NULL);
+    }
+
+    dictFreeVal(db->dict, &auxentry);
+}
+
+/* High level Set operation. This function can be used in order to set
+ * a key, whatever it was existing or not, to a new object.
+ *
+ * 1) The ref count of the value object is incremented.
+ * 2) clients WATCHing for the destination key notified.
+ * 3) The expire time of the key is reset (the key is made persistent),
+ *    unless 'keepttl' is true.
+ *
+ * All the new keys in the database should be created via this interface.
+ * The client 'c' argument may be set to NULL if the operation is performed
+ * in a context where there is no clear client performing the operation. */
+void genericSetKey(client *c, redisDb *db, robj *key, robj *val, int keepttl, int signal) {
+    if (lookupKeyWrite(db,key) == NULL) {
+        dbAdd(db,key,val);
+    } else {
+        dbOverwrite(db,key,val);
+    }
+    incrRefCount(val);
+    if (!keepttl) removeExpire(db,key);
+    if (signal) signalModifiedKey(c,db,key);
+}
+
+/* Common case for genericSetKey() where the TTL is not retained. */
+void setKey(client *c, redisDb *db, robj *key, robj *val) {
+    genericSetKey(c,db,key,val,0,1);
+}
+
+/* Return a random key, in form of a Redis object.
+ * If there are no keys, NULL is returned.
+ *
+ * The function makes sure to return keys not already expired. */
+robj *dbRandomKey(redisDb *db) {
+    dictEntry *de;
+    int maxtries = 100;
+    int allvolatile = dictSize(db->dict) == dictSize(db->expires);
+
+    while(1) {
+        sds key;
+        robj *keyobj;
+
+        de = dictGetFairRandomKey(db->dict);
+        if (de == NULL) return NULL;
+
+        key = dictGetKey(de);
+        keyobj = createStringObject(key,sdslen(key));
+        if (dictFind(db->expires,key)) {
+            if (allvolatile && server.masterhost && --maxtries == 0) {
+                /* If the DB is composed only of keys with an expire set,
+                 * it could happen that all the keys are already logically
+                 * expired in the slave, so the function cannot stop because
+                 * expireIfNeeded() is false, nor it can stop because
+                 * dictGetRandomKey() returns NULL (there are keys to return).
+                 * To prevent the infinite loop we do some tries, but if there
+                 * are the conditions for an infinite loop, eventually we
+                 * return a key name that may be already expired. */
+                return keyobj;
+            }
+            if (expireIfNeeded(db,keyobj)) {
+                decrRefCount(keyobj);
+                continue; /* search for another key. This expired. */
+            }
+        }
+        return keyobj;
+    }
+}
+
+/* Delete a key, value, and associated expiration entry if any, from the DB */
+int dbSyncDelete(redisDb *db, robj *key) {
+    /* Deleting an entry from the expires dict will not free the sds of
+     * the key, because it is shared with the main dictionary. */
+    if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr);
+    dictEntry *de = dictUnlink(db->dict,key->ptr);
+    if (de) {
+        robj *val = dictGetVal(de);
+        /* Tells the module that the key has been unlinked from the database. */
+        moduleNotifyKeyUnlink(key,val);
+        dictFreeUnlinkedEntry(db->dict,de);
+        if (server.cluster_enabled) slotToKeyDel(key->ptr);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* This is a wrapper whose behavior depends on the Redis lazy free
+ * configuration. Deletes the key synchronously or asynchronously. */
+int dbDelete(redisDb *db, robj *key) {
+    return server.lazyfree_lazy_server_del ? dbAsyncDelete(db,key) :
+                                             dbSyncDelete(db,key);
+}
+
+/* Prepare the string object stored at 'key' to be modified destructively
+ * to implement commands like SETBIT or APPEND.
+ *
+ * An object is usually ready to be modified unless one of the two conditions
+ * are true:
+ *
+ * 1) The object 'o' is shared (refcount > 1), we don't want to affect
+ *    other users.
+ * 2) The object encoding is not "RAW".
+ *
+ * If the object is found in one of the above conditions (or both) by the
+ * function, an unshared / not-encoded copy of the string object is stored
+ * at 'key' in the specified 'db'. Otherwise the object 'o' itself is
+ * returned.
+ *
+ * USAGE:
+ *
+ * The object 'o' is what the caller already obtained by looking up 'key'
+ * in 'db', the usage pattern looks like this:
+ *
+ * o = lookupKeyWrite(db,key);
+ * if (checkType(c,o,OBJ_STRING)) return;
+ * o = dbUnshareStringValue(db,key,o);
+ *
+ * At this point the caller is ready to modify the object, for example
+ * using an sdscat() call to append some data, or anything else.
+ */
+robj *dbUnshareStringValue(redisDb *db, robj *key, robj *o) {
+    serverAssert(o->type == OBJ_STRING);
+    if (o->refcount != 1 || o->encoding != OBJ_ENCODING_RAW) {
+        robj *decoded = getDecodedObject(o);
+        o = createRawStringObject(decoded->ptr, sdslen(decoded->ptr));
+        decrRefCount(decoded);
+        dbOverwrite(db,key,o);
+    }
+    return o;
+}
+
+/* Remove all keys from the database(s) structure. The dbarray argument
+ * may not be the server main DBs (could be a backup).
+ *
+ * The dbnum can be -1 if all the DBs should be emptied, or the specified
+ * DB index if we want to empty only a single database.
+ * The function returns the number of keys removed from the database(s). */
+long long emptyDbStructure(redisDb *dbarray, int dbnum, int async,
+                           void(callback)(void*))
+{
+    long long removed = 0;
+    int startdb, enddb;
+
+    if (dbnum == -1) {
+        startdb = 0;
+        enddb = server.dbnum-1;
+    } else {
+        startdb = enddb = dbnum;
+    }
+
+    for (int j = startdb; j <= enddb; j++) {
+        removed += dictSize(dbarray[j].dict);
+        if (async) {
+            emptyDbAsync(&dbarray[j]);
+        } else {
+            dictEmpty(dbarray[j].dict,callback);
+            dictEmpty(dbarray[j].expires,callback);
+        }
+        /* Because all keys of database are removed, reset average ttl. */
+        dbarray[j].avg_ttl = 0;
+        dbarray[j].expires_cursor = 0;
+    }
+
+    return removed;
+}
+
+/* Remove all keys from all the databases in a Redis server.
+ * If callback is given the function is called from time to time to
+ * signal that work is in progress.
+ *
+ * The dbnum can be -1 if all the DBs should be flushed, or the specified
+ * DB number if we want to flush only a single Redis database number.
+ *
+ * Flags are be EMPTYDB_NO_FLAGS if no special flags are specified or
+ * EMPTYDB_ASYNC if we want the memory to be freed in a different thread
+ * and the function to return ASAP.
+ *
+ * On success the function returns the number of keys removed from the
+ * database(s). Otherwise -1 is returned in the specific case the
+ * DB number is out of range, and errno is set to EINVAL. */
+long long emptyDb(int dbnum, int flags, void(callback)(void*)) {
+    int async = (flags & EMPTYDB_ASYNC);
+    RedisModuleFlushInfoV1 fi = {REDISMODULE_FLUSHINFO_VERSION,!async,dbnum};
+    long long removed = 0;
+
+    if (dbnum < -1 || dbnum >= server.dbnum) {
+        errno = EINVAL;
+        return -1;
+    }
+
+    /* Fire the flushdb modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_FLUSHDB,
+                          REDISMODULE_SUBEVENT_FLUSHDB_START,
+                          &fi);
+
+    /* Make sure the WATCHed keys are affected by the FLUSH* commands.
+     * Note that we need to call the function while the keys are still
+     * there. */
+    signalFlushedDb(dbnum, async);
+
+    /* Empty redis database structure. */
+    removed = emptyDbStructure(server.db, dbnum, async, callback);
+
+    /* Flush slots to keys map if enable cluster, we can flush entire
+     * slots to keys map whatever dbnum because only support one DB
+     * in cluster mode. */
+    if (server.cluster_enabled) slotToKeyFlush(async);
+
+    if (dbnum == -1) flushSlaveKeysWithExpireList();
+
+    /* Also fire the end event. Note that this event will fire almost
+     * immediately after the start event if the flush is asynchronous. */
+    moduleFireServerEvent(REDISMODULE_EVENT_FLUSHDB,
+                          REDISMODULE_SUBEVENT_FLUSHDB_END,
+                          &fi);
+
+    return removed;
+}
+
+/* Store a backup of the database for later use, and put an empty one
+ * instead of it. */
+dbBackup *backupDb(void) {
+    dbBackup *backup = zmalloc(sizeof(dbBackup));
+
+    /* Backup main DBs. */
+    backup->dbarray = zmalloc(sizeof(redisDb)*server.dbnum);
+    for (int i=0; i<server.dbnum; i++) {
+        backup->dbarray[i] = server.db[i];
+        server.db[i].dict = dictCreate(&dbDictType,NULL);
+        server.db[i].expires = dictCreate(&dbExpiresDictType,NULL);
+    }
+
+    /* Backup cluster slots to keys map if enable cluster. */
+    if (server.cluster_enabled) {
+        backup->slots_to_keys = server.cluster->slots_to_keys;
+        memcpy(backup->slots_keys_count, server.cluster->slots_keys_count,
+            sizeof(server.cluster->slots_keys_count));
+        server.cluster->slots_to_keys = raxNew();
+        memset(server.cluster->slots_keys_count, 0,
+            sizeof(server.cluster->slots_keys_count));
+    }
+
+    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
+                          REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE,
+                          NULL);
+
+    return backup;
+}
+
+/* Discard a previously created backup, this can be slow (similar to FLUSHALL)
+ * Arguments are similar to the ones of emptyDb, see EMPTYDB_ flags. */
+void discardDbBackup(dbBackup *buckup, int flags, void(callback)(void*)) {
+    int async = (flags & EMPTYDB_ASYNC);
+
+    /* Release main DBs backup . */
+    emptyDbStructure(buckup->dbarray, -1, async, callback);
+    for (int i=0; i<server.dbnum; i++) {
+        dictRelease(buckup->dbarray[i].dict);
+        dictRelease(buckup->dbarray[i].expires);
+    }
+
+    /* Release slots to keys map backup if enable cluster. */
+    if (server.cluster_enabled) freeSlotsToKeysMap(buckup->slots_to_keys, async);
+
+    /* Release buckup. */
+    zfree(buckup->dbarray);
+    zfree(buckup);
+
+    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
+                          REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD,
+                          NULL);
+}
+
+/* Restore the previously created backup (discarding what currently resides
+ * in the db).
+ * This function should be called after the current contents of the database
+ * was emptied with a previous call to emptyDb (possibly using the async mode). */
+void restoreDbBackup(dbBackup *buckup) {
+    /* Restore main DBs. */
+    for (int i=0; i<server.dbnum; i++) {
+        serverAssert(dictSize(server.db[i].dict) == 0);
+        serverAssert(dictSize(server.db[i].expires) == 0);
+        dictRelease(server.db[i].dict);
+        dictRelease(server.db[i].expires);
+        server.db[i] = buckup->dbarray[i];
+    }
+
+    /* Restore slots to keys map backup if enable cluster. */
+    if (server.cluster_enabled) {
+        serverAssert(server.cluster->slots_to_keys->numele == 0);
+        raxFree(server.cluster->slots_to_keys);
+        server.cluster->slots_to_keys = buckup->slots_to_keys;
+        memcpy(server.cluster->slots_keys_count, buckup->slots_keys_count,
+                sizeof(server.cluster->slots_keys_count));
+    }
+
+    /* Release buckup. */
+    zfree(buckup->dbarray);
+    zfree(buckup);
+
+    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
+                          REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE,
+                          NULL);
+}
+
+int selectDb(client *c, int id) {
+    if (id < 0 || id >= server.dbnum)
+        return C_ERR;
+    c->db = &server.db[id];
+    return C_OK;
+}
+
+long long dbTotalServerKeyCount() {
+    long long total = 0;
+    int j;
+    for (j = 0; j < server.dbnum; j++) {
+        total += dictSize(server.db[j].dict);
+    }
+    return total;
+}
+
+/*-----------------------------------------------------------------------------
+ * Hooks for key space changes.
+ *
+ * Every time a key in the database is modified the function
+ * signalModifiedKey() is called.
+ *
+ * Every time a DB is flushed the function signalFlushDb() is called.
+ *----------------------------------------------------------------------------*/
+
+/* Note that the 'c' argument may be NULL if the key was modified out of
+ * a context of a client. */
+void signalModifiedKey(client *c, redisDb *db, robj *key) {
+    touchWatchedKey(db,key);
+    trackingInvalidateKey(c,key);
+}
+
+void signalFlushedDb(int dbid, int async) {
+    int startdb, enddb;
+    if (dbid == -1) {
+        startdb = 0;
+        enddb = server.dbnum-1;
+    } else {
+        startdb = enddb = dbid;
+    }
+
+    for (int j = startdb; j <= enddb; j++) {
+        touchAllWatchedKeysInDb(&server.db[j], NULL);
+    }
+
+    trackingInvalidateKeysOnFlush(async);
+}
+
+/*-----------------------------------------------------------------------------
+ * Type agnostic commands operating on the key space
+ *----------------------------------------------------------------------------*/
+
+/* Return the set of flags to use for the emptyDb() call for FLUSHALL
+ * and FLUSHDB commands.
+ *
+ * sync: flushes the database in an sync manner.
+ * async: flushes the database in an async manner.
+ * no option: determine sync or async according to the value of lazyfree-lazy-user-flush.
+ *
+ * On success C_OK is returned and the flags are stored in *flags, otherwise
+ * C_ERR is returned and the function sends an error to the client. */
+int getFlushCommandFlags(client *c, int *flags) {
+    /* Parse the optional ASYNC option. */
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"sync")) {
+        *flags = EMPTYDB_NO_FLAGS;
+    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"async")) {
+        *flags = EMPTYDB_ASYNC;
+    } else if (c->argc == 1) {
+        *flags = server.lazyfree_lazy_user_flush ? EMPTYDB_ASYNC : EMPTYDB_NO_FLAGS;
+    } else {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+/* Flushes the whole server data set. */
+void flushAllDataAndResetRDB(int flags) {
+    server.dirty += emptyDb(-1,flags,NULL);
+    if (server.child_type == CHILD_TYPE_RDB) killRDBChild();
+    if (server.saveparamslen > 0) {
+        /* Normally rdbSave() will reset dirty, but we don't want this here
+         * as otherwise FLUSHALL will not be replicated nor put into the AOF. */
+        int saved_dirty = server.dirty;
+        rdbSaveInfo rsi, *rsiptr;
+        rsiptr = rdbPopulateSaveInfo(&rsi);
+        rdbSave(server.rdb_filename,rsiptr);
+        server.dirty = saved_dirty;
+    }
+
+    /* Without that extra dirty++, when db was already empty, FLUSHALL will
+     * not be replicated nor put into the AOF. */
+    server.dirty++;
+#if defined(USE_JEMALLOC)
+    /* jemalloc 5 doesn't release pages back to the OS when there's no traffic.
+     * for large databases, flushdb blocks for long anyway, so a bit more won't
+     * harm and this way the flush and purge will be synchroneus. */
+    if (!(flags & EMPTYDB_ASYNC))
+        jemalloc_purge();
+#endif
+}
+
+/* FLUSHDB [ASYNC]
+ *
+ * Flushes the currently SELECTed Redis DB. */
+void flushdbCommand(client *c) {
+    int flags;
+
+    if (getFlushCommandFlags(c,&flags) == C_ERR) return;
+    server.dirty += emptyDb(c->db->id,flags,NULL);
+    addReply(c,shared.ok);
+#if defined(USE_JEMALLOC)
+    /* jemalloc 5 doesn't release pages back to the OS when there's no traffic.
+     * for large databases, flushdb blocks for long anyway, so a bit more won't
+     * harm and this way the flush and purge will be synchroneus. */
+    if (!(flags & EMPTYDB_ASYNC))
+        jemalloc_purge();
+#endif
+}
+
+/* FLUSHALL [ASYNC]
+ *
+ * Flushes the whole server data set. */
+void flushallCommand(client *c) {
+    int flags;
+    if (getFlushCommandFlags(c,&flags) == C_ERR) return;
+    flushAllDataAndResetRDB(flags);
+    addReply(c,shared.ok);
+}
+
+/* This command implements DEL and LAZYDEL. */
+void delGenericCommand(client *c, int lazy) {
+    int numdel = 0, j;
+
+    for (j = 1; j < c->argc; j++) {
+        expireIfNeeded(c->db,c->argv[j]);
+        int deleted  = lazy ? dbAsyncDelete(c->db,c->argv[j]) :
+                              dbSyncDelete(c->db,c->argv[j]);
+        if (deleted) {
+            signalModifiedKey(c,c->db,c->argv[j]);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,
+                "del",c->argv[j],c->db->id);
+            server.dirty++;
+            numdel++;
+        }
+    }
+    addReplyLongLong(c,numdel);
+}
+
+void delCommand(client *c) {
+    delGenericCommand(c,server.lazyfree_lazy_user_del);
+}
+
+void unlinkCommand(client *c) {
+    delGenericCommand(c,1);
+}
+
+/* EXISTS key1 key2 ... key_N.
+ * Return value is the number of keys existing. */
+void existsCommand(client *c) {
+    long long count = 0;
+    int j;
+
+    for (j = 1; j < c->argc; j++) {
+        if (lookupKeyReadWithFlags(c->db,c->argv[j],LOOKUP_NOTOUCH)) count++;
+    }
+    addReplyLongLong(c,count);
+}
+
+void selectCommand(client *c) {
+    int id;
+
+    if (getIntFromObjectOrReply(c, c->argv[1], &id, NULL) != C_OK)
+        return;
+
+    if (server.cluster_enabled && id != 0) {
+        addReplyError(c,"SELECT is not allowed in cluster mode");
+        return;
+    }
+    if (selectDb(c,id) == C_ERR) {
+        addReplyError(c,"DB index is out of range");
+    } else {
+        addReply(c,shared.ok);
+    }
+}
+
+void randomkeyCommand(client *c) {
+    robj *key;
+
+    if ((key = dbRandomKey(c->db)) == NULL) {
+        addReplyNull(c);
+        return;
+    }
+
+    addReplyBulk(c,key);
+    decrRefCount(key);
+}
+
+void keysCommand(client *c) {
+    dictIterator *di;
+    dictEntry *de;
+    sds pattern = c->argv[1]->ptr;
+    int plen = sdslen(pattern), allkeys;
+    unsigned long numkeys = 0;
+    void *replylen = addReplyDeferredLen(c);
+
+    di = dictGetSafeIterator(c->db->dict);
+    allkeys = (pattern[0] == '*' && plen == 1);
+    while((de = dictNext(di)) != NULL) {
+        sds key = dictGetKey(de);
+        robj *keyobj;
+
+        if (allkeys || stringmatchlen(pattern,plen,key,sdslen(key),0)) {
+            keyobj = createStringObject(key,sdslen(key));
+            if (!keyIsExpired(c->db,keyobj)) {
+                addReplyBulk(c,keyobj);
+                numkeys++;
+            }
+            decrRefCount(keyobj);
+        }
+    }
+    dictReleaseIterator(di);
+    setDeferredArrayLen(c,replylen,numkeys);
+}
+
+/* This callback is used by scanGenericCommand in order to collect elements
+ * returned by the dictionary iterator into a list. */
+void scanCallback(void *privdata, const dictEntry *de) {
+    void **pd = (void**) privdata;
+    list *keys = pd[0];
+    robj *o = pd[1];
+    robj *key, *val = NULL;
+
+    if (o == NULL) {
+        sds sdskey = dictGetKey(de);
+        key = createStringObject(sdskey, sdslen(sdskey));
+    } else if (o->type == OBJ_SET) {
+        sds keysds = dictGetKey(de);
+        key = createStringObject(keysds,sdslen(keysds));
+    } else if (o->type == OBJ_HASH) {
+        sds sdskey = dictGetKey(de);
+        sds sdsval = dictGetVal(de);
+        key = createStringObject(sdskey,sdslen(sdskey));
+        val = createStringObject(sdsval,sdslen(sdsval));
+    } else if (o->type == OBJ_ZSET) {
+        sds sdskey = dictGetKey(de);
+        key = createStringObject(sdskey,sdslen(sdskey));
+        val = createStringObjectFromLongDouble(*(double*)dictGetVal(de),0);
+    } else {
+        serverPanic("Type not handled in SCAN callback.");
+    }
+
+    listAddNodeTail(keys, key);
+    if (val) listAddNodeTail(keys, val);
+}
+
+/* Try to parse a SCAN cursor stored at object 'o':
+ * if the cursor is valid, store it as unsigned integer into *cursor and
+ * returns C_OK. Otherwise return C_ERR and send an error to the
+ * client. */
+int parseScanCursorOrReply(client *c, robj *o, unsigned long *cursor) {
+    char *eptr;
+
+    /* Use strtoul() because we need an *unsigned* long, so
+     * getLongLongFromObject() does not cover the whole cursor space. */
+    errno = 0;
+    *cursor = strtoul(o->ptr, &eptr, 10);
+    if (isspace(((char*)o->ptr)[0]) || eptr[0] != '\0' || errno == ERANGE)
+    {
+        addReplyError(c, "invalid cursor");
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+/* This command implements SCAN, HSCAN and SSCAN commands.
+ * If object 'o' is passed, then it must be a Hash, Set or Zset object, otherwise
+ * if 'o' is NULL the command will operate on the dictionary associated with
+ * the current database.
+ *
+ * When 'o' is not NULL the function assumes that the first argument in
+ * the client arguments vector is a key so it skips it before iterating
+ * in order to parse options.
+ *
+ * In the case of a Hash object the function returns both the field and value
+ * of every element on the Hash. */
+void scanGenericCommand(client *c, robj *o, unsigned long cursor) {
+    int i, j;
+    list *keys = listCreate();
+    listNode *node, *nextnode;
+    long count = 10;
+    sds pat = NULL;
+    sds typename = NULL;
+    int patlen = 0, use_pattern = 0;
+    dict *ht;
+
+    /* Object must be NULL (to iterate keys names), or the type of the object
+     * must be Set, Sorted Set, or Hash. */
+    serverAssert(o == NULL || o->type == OBJ_SET || o->type == OBJ_HASH ||
+                o->type == OBJ_ZSET);
+
+    /* Set i to the first option argument. The previous one is the cursor. */
+    i = (o == NULL) ? 2 : 3; /* Skip the key argument if needed. */
+
+    /* Step 1: Parse options. */
+    while (i < c->argc) {
+        j = c->argc - i;
+        if (!strcasecmp(c->argv[i]->ptr, "count") && j >= 2) {
+            if (getLongFromObjectOrReply(c, c->argv[i+1], &count, NULL)
+                != C_OK)
+            {
+                goto cleanup;
+            }
+
+            if (count < 1) {
+                addReplyErrorObject(c,shared.syntaxerr);
+                goto cleanup;
+            }
+
+            i += 2;
+        } else if (!strcasecmp(c->argv[i]->ptr, "match") && j >= 2) {
+            pat = c->argv[i+1]->ptr;
+            patlen = sdslen(pat);
+
+            /* The pattern always matches if it is exactly "*", so it is
+             * equivalent to disabling it. */
+            use_pattern = !(pat[0] == '*' && patlen == 1);
+
+            i += 2;
+        } else if (!strcasecmp(c->argv[i]->ptr, "type") && o == NULL && j >= 2) {
+            /* SCAN for a particular type only applies to the db dict */
+            typename = c->argv[i+1]->ptr;
+            i+= 2;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            goto cleanup;
+        }
+    }
+
+    /* Step 2: Iterate the collection.
+     *
+     * Note that if the object is encoded with a ziplist, intset, or any other
+     * representation that is not a hash table, we are sure that it is also
+     * composed of a small number of elements. So to avoid taking state we
+     * just return everything inside the object in a single call, setting the
+     * cursor to zero to signal the end of the iteration. */
+
+    /* Handle the case of a hash table. */
+    ht = NULL;
+    if (o == NULL) {
+        ht = c->db->dict;
+    } else if (o->type == OBJ_SET && o->encoding == OBJ_ENCODING_HT) {
+        ht = o->ptr;
+    } else if (o->type == OBJ_HASH && o->encoding == OBJ_ENCODING_HT) {
+        ht = o->ptr;
+        count *= 2; /* We return key / value for this type. */
+    } else if (o->type == OBJ_ZSET && o->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = o->ptr;
+        ht = zs->dict;
+        count *= 2; /* We return key / value for this type. */
+    }
+
+    if (ht) {
+        void *privdata[2];
+        /* We set the max number of iterations to ten times the specified
+         * COUNT, so if the hash table is in a pathological state (very
+         * sparsely populated) we avoid to block too much time at the cost
+         * of returning no or very few elements. */
+        long maxiterations = count*10;
+
+        /* We pass two pointers to the callback: the list to which it will
+         * add new elements, and the object containing the dictionary so that
+         * it is possible to fetch more data in a type-dependent way. */
+        privdata[0] = keys;
+        privdata[1] = o;
+        do {
+            cursor = dictScan(ht, cursor, scanCallback, NULL, privdata);
+        } while (cursor &&
+              maxiterations-- &&
+              listLength(keys) < (unsigned long)count);
+    } else if (o->type == OBJ_SET) {
+        int pos = 0;
+        int64_t ll;
+
+        while(intsetGet(o->ptr,pos++,&ll))
+            listAddNodeTail(keys,createStringObjectFromLongLong(ll));
+        cursor = 0;
+    } else if (o->type == OBJ_HASH || o->type == OBJ_ZSET) {
+        unsigned char *p = ziplistIndex(o->ptr,0);
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vll;
+
+        while(p) {
+            ziplistGet(p,&vstr,&vlen,&vll);
+            listAddNodeTail(keys,
+                (vstr != NULL) ? createStringObject((char*)vstr,vlen) :
+                                 createStringObjectFromLongLong(vll));
+            p = ziplistNext(o->ptr,p);
+        }
+        cursor = 0;
+    } else {
+        serverPanic("Not handled encoding in SCAN.");
+    }
+
+    /* Step 3: Filter elements. */
+    node = listFirst(keys);
+    while (node) {
+        robj *kobj = listNodeValue(node);
+        nextnode = listNextNode(node);
+        int filter = 0;
+
+        /* Filter element if it does not match the pattern. */
+        if (use_pattern) {
+            if (sdsEncodedObject(kobj)) {
+                if (!stringmatchlen(pat, patlen, kobj->ptr, sdslen(kobj->ptr), 0))
+                    filter = 1;
+            } else {
+                char buf[LONG_STR_SIZE];
+                int len;
+
+                serverAssert(kobj->encoding == OBJ_ENCODING_INT);
+                len = ll2string(buf,sizeof(buf),(long)kobj->ptr);
+                if (!stringmatchlen(pat, patlen, buf, len, 0)) filter = 1;
+            }
+        }
+
+        /* Filter an element if it isn't the type we want. */
+        if (!filter && o == NULL && typename){
+            robj* typecheck = lookupKeyReadWithFlags(c->db, kobj, LOOKUP_NOTOUCH);
+            char* type = getObjectTypeName(typecheck);
+            if (strcasecmp((char*) typename, type)) filter = 1;
+        }
+
+        /* Filter element if it is an expired key. */
+        if (!filter && o == NULL && expireIfNeeded(c->db, kobj)) filter = 1;
+
+        /* Remove the element and its associated value if needed. */
+        if (filter) {
+            decrRefCount(kobj);
+            listDelNode(keys, node);
+        }
+
+        /* If this is a hash or a sorted set, we have a flat list of
+         * key-value elements, so if this element was filtered, remove the
+         * value, or skip it if it was not filtered: we only match keys. */
+        if (o && (o->type == OBJ_ZSET || o->type == OBJ_HASH)) {
+            node = nextnode;
+            serverAssert(node); /* assertion for valgrind (avoid NPD) */
+            nextnode = listNextNode(node);
+            if (filter) {
+                kobj = listNodeValue(node);
+                decrRefCount(kobj);
+                listDelNode(keys, node);
+            }
+        }
+        node = nextnode;
+    }
+
+    /* Step 4: Reply to the client. */
+    addReplyArrayLen(c, 2);
+    addReplyBulkLongLong(c,cursor);
+
+    addReplyArrayLen(c, listLength(keys));
+    while ((node = listFirst(keys)) != NULL) {
+        robj *kobj = listNodeValue(node);
+        addReplyBulk(c, kobj);
+        decrRefCount(kobj);
+        listDelNode(keys, node);
+    }
+
+cleanup:
+    listSetFreeMethod(keys,decrRefCountVoid);
+    listRelease(keys);
+}
+
+/* The SCAN command completely relies on scanGenericCommand. */
+void scanCommand(client *c) {
+    unsigned long cursor;
+    if (parseScanCursorOrReply(c,c->argv[1],&cursor) == C_ERR) return;
+    scanGenericCommand(c,NULL,cursor);
+}
+
+void dbsizeCommand(client *c) {
+    addReplyLongLong(c,dictSize(c->db->dict));
+}
+
+void lastsaveCommand(client *c) {
+    addReplyLongLong(c,server.lastsave);
+}
+
+char* getObjectTypeName(robj *o) {
+    char* type;
+    if (o == NULL) {
+        type = "none";
+    } else {
+        switch(o->type) {
+        case OBJ_STRING: type = "string"; break;
+        case OBJ_LIST: type = "list"; break;
+        case OBJ_SET: type = "set"; break;
+        case OBJ_ZSET: type = "zset"; break;
+        case OBJ_HASH: type = "hash"; break;
+        case OBJ_STREAM: type = "stream"; break;
+        case OBJ_MODULE: {
+            moduleValue *mv = o->ptr;
+            type = mv->type->name;
+        }; break;
+        default: type = "unknown"; break;
+        }
+    }
+    return type;
+}
+
+void typeCommand(client *c) {
+    robj *o;
+    o = lookupKeyReadWithFlags(c->db,c->argv[1],LOOKUP_NOTOUCH);
+    addReplyStatus(c, getObjectTypeName(o));
+}
+
+void shutdownCommand(client *c) {
+    int flags = 0;
+
+    if (c->argc > 2) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    } else if (c->argc == 2) {
+        if (!strcasecmp(c->argv[1]->ptr,"nosave")) {
+            flags |= SHUTDOWN_NOSAVE;
+        } else if (!strcasecmp(c->argv[1]->ptr,"save")) {
+            flags |= SHUTDOWN_SAVE;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+    if (prepareForShutdown(flags) == C_OK) exit(0);
+    addReplyError(c,"Errors trying to SHUTDOWN. Check logs.");
+}
+
+void renameGenericCommand(client *c, int nx) {
+    robj *o;
+    long long expire;
+    int samekey = 0;
+
+    /* When source and dest key is the same, no operation is performed,
+     * if the key exists, however we still return an error on unexisting key. */
+    if (sdscmp(c->argv[1]->ptr,c->argv[2]->ptr) == 0) samekey = 1;
+
+    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr)) == NULL)
+        return;
+
+    if (samekey) {
+        addReply(c,nx ? shared.czero : shared.ok);
+        return;
+    }
+
+    incrRefCount(o);
+    expire = getExpire(c->db,c->argv[1]);
+    if (lookupKeyWrite(c->db,c->argv[2]) != NULL) {
+        if (nx) {
+            decrRefCount(o);
+            addReply(c,shared.czero);
+            return;
+        }
+        /* Overwrite: delete the old key before creating the new one
+         * with the same name. */
+        dbDelete(c->db,c->argv[2]);
+    }
+    dbAdd(c->db,c->argv[2],o);
+    if (expire != -1) setExpire(c,c->db,c->argv[2],expire);
+    dbDelete(c->db,c->argv[1]);
+    signalModifiedKey(c,c->db,c->argv[1]);
+    signalModifiedKey(c,c->db,c->argv[2]);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,"rename_from",
+        c->argv[1],c->db->id);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,"rename_to",
+        c->argv[2],c->db->id);
+    server.dirty++;
+    addReply(c,nx ? shared.cone : shared.ok);
+}
+
+void renameCommand(client *c) {
+    renameGenericCommand(c,0);
+}
+
+void renamenxCommand(client *c) {
+    renameGenericCommand(c,1);
+}
+
+void moveCommand(client *c) {
+    robj *o;
+    redisDb *src, *dst;
+    int srcid, dbid;
+    long long expire;
+
+    if (server.cluster_enabled) {
+        addReplyError(c,"MOVE is not allowed in cluster mode");
+        return;
+    }
+
+    /* Obtain source and target DB pointers */
+    src = c->db;
+    srcid = c->db->id;
+
+    if (getIntFromObjectOrReply(c, c->argv[2], &dbid, NULL) != C_OK)
+        return;
+
+    if (selectDb(c,dbid) == C_ERR) {
+        addReplyError(c,"DB index is out of range");
+        return;
+    }
+    dst = c->db;
+    selectDb(c,srcid); /* Back to the source DB */
+
+    /* If the user is moving using as target the same
+     * DB as the source DB it is probably an error. */
+    if (src == dst) {
+        addReplyErrorObject(c,shared.sameobjecterr);
+        return;
+    }
+
+    /* Check if the element exists and get a reference */
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (!o) {
+        addReply(c,shared.czero);
+        return;
+    }
+    expire = getExpire(c->db,c->argv[1]);
+
+    /* Return zero if the key already exists in the target DB */
+    if (lookupKeyWrite(dst,c->argv[1]) != NULL) {
+        addReply(c,shared.czero);
+        return;
+    }
+    dbAdd(dst,c->argv[1],o);
+    if (expire != -1) setExpire(c,dst,c->argv[1],expire);
+    incrRefCount(o);
+
+    /* OK! key moved, free the entry in the source DB */
+    dbDelete(src,c->argv[1]);
+    signalModifiedKey(c,src,c->argv[1]);
+    signalModifiedKey(c,dst,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,
+                "move_from",c->argv[1],src->id);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,
+                "move_to",c->argv[1],dst->id);
+
+    server.dirty++;
+    addReply(c,shared.cone);
+}
+
+void copyCommand(client *c) {
+    robj *o;
+    redisDb *src, *dst;
+    int srcid, dbid;
+    long long expire;
+    int j, replace = 0, delete = 0;
+
+    /* Obtain source and target DB pointers 
+     * Default target DB is the same as the source DB 
+     * Parse the REPLACE option and targetDB option. */
+    src = c->db;
+    dst = c->db;
+    srcid = c->db->id;
+    dbid = c->db->id;
+    for (j = 3; j < c->argc; j++) {
+        int additional = c->argc - j - 1;
+        if (!strcasecmp(c->argv[j]->ptr,"replace")) {
+            replace = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr, "db") && additional >= 1) {
+            if (getIntFromObjectOrReply(c, c->argv[j+1], &dbid, NULL) != C_OK)
+                return;
+
+            if (selectDb(c, dbid) == C_ERR) {
+                addReplyError(c,"DB index is out of range");
+                return;
+            }
+            dst = c->db;
+            selectDb(c,srcid); /* Back to the source DB */
+            j++; /* Consume additional arg. */
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    if ((server.cluster_enabled == 1) && (srcid != 0 || dbid != 0)) {
+        addReplyError(c,"Copying to another database is not allowed in cluster mode");
+        return;
+    }
+
+    /* If the user select the same DB as
+     * the source DB and using newkey as the same key
+     * it is probably an error. */
+    robj *key = c->argv[1];
+    robj *newkey = c->argv[2];
+    if (src == dst && (sdscmp(key->ptr, newkey->ptr) == 0)) {
+        addReplyErrorObject(c,shared.sameobjecterr);
+        return;
+    }
+
+    /* Check if the element exists and get a reference */
+    o = lookupKeyWrite(c->db, key);
+    if (!o) {
+        addReply(c,shared.czero);
+        return;
+    }
+    expire = getExpire(c->db,key);
+
+    /* Return zero if the key already exists in the target DB. 
+     * If REPLACE option is selected, delete newkey from targetDB. */
+    if (lookupKeyWrite(dst,newkey) != NULL) {
+        if (replace) {
+            delete = 1;
+        } else {
+            addReply(c,shared.czero);
+            return;
+        }
+    }
+
+    /* Duplicate object according to object's type. */
+    robj *newobj;
+    switch(o->type) {
+        case OBJ_STRING: newobj = dupStringObject(o); break;
+        case OBJ_LIST: newobj = listTypeDup(o); break;
+        case OBJ_SET: newobj = setTypeDup(o); break;
+        case OBJ_ZSET: newobj = zsetDup(o); break;
+        case OBJ_HASH: newobj = hashTypeDup(o); break;
+        case OBJ_STREAM: newobj = streamDup(o); break;
+        case OBJ_MODULE:
+            newobj = moduleTypeDupOrReply(c, key, newkey, o);
+            if (!newobj) return;
+            break;
+        default:
+            addReplyError(c, "unknown type object");
+            return;
+    }
+
+    if (delete) {
+        dbDelete(dst,newkey);
+    }
+
+    dbAdd(dst,newkey,newobj);
+    if (expire != -1) setExpire(c, dst, newkey, expire);
+
+    /* OK! key copied */
+    signalModifiedKey(c,dst,c->argv[2]);
+    notifyKeyspaceEvent(NOTIFY_GENERIC,"copy_to",c->argv[2],dst->id);
+
+    server.dirty++;
+    addReply(c,shared.cone);
+}
+
+/* Helper function for dbSwapDatabases(): scans the list of keys that have
+ * one or more blocked clients for B[LR]POP or other blocking commands
+ * and signal the keys as ready if they are of the right type. See the comment
+ * where the function is used for more info. */
+void scanDatabaseForReadyLists(redisDb *db) {
+    dictEntry *de;
+    dictIterator *di = dictGetSafeIterator(db->blocking_keys);
+    while((de = dictNext(di)) != NULL) {
+        robj *key = dictGetKey(de);
+        robj *value = lookupKey(db,key,LOOKUP_NOTOUCH);
+        if (value) signalKeyAsReady(db, key, value->type);
+    }
+    dictReleaseIterator(di);
+}
+
+/* Swap two databases at runtime so that all clients will magically see
+ * the new database even if already connected. Note that the client
+ * structure c->db points to a given DB, so we need to be smarter and
+ * swap the underlying referenced structures, otherwise we would need
+ * to fix all the references to the Redis DB structure.
+ *
+ * Returns C_ERR if at least one of the DB ids are out of range, otherwise
+ * C_OK is returned. */
+int dbSwapDatabases(int id1, int id2) {
+    if (id1 < 0 || id1 >= server.dbnum ||
+        id2 < 0 || id2 >= server.dbnum) return C_ERR;
+    if (id1 == id2) return C_OK;
+    redisDb aux = server.db[id1];
+    redisDb *db1 = &server.db[id1], *db2 = &server.db[id2];
+
+    /* Swap hash tables. Note that we don't swap blocking_keys,
+     * ready_keys and watched_keys, since we want clients to
+     * remain in the same DB they were. */
+    db1->dict = db2->dict;
+    db1->expires = db2->expires;
+    db1->avg_ttl = db2->avg_ttl;
+    db1->expires_cursor = db2->expires_cursor;
+
+    db2->dict = aux.dict;
+    db2->expires = aux.expires;
+    db2->avg_ttl = aux.avg_ttl;
+    db2->expires_cursor = aux.expires_cursor;
+
+    /* Now we need to handle clients blocked on lists: as an effect
+     * of swapping the two DBs, a client that was waiting for list
+     * X in a given DB, may now actually be unblocked if X happens
+     * to exist in the new version of the DB, after the swap.
+     *
+     * However normally we only do this check for efficiency reasons
+     * in dbAdd() when a list is created. So here we need to rescan
+     * the list of clients blocked on lists and signal lists as ready
+     * if needed.
+     *
+     * Also the swapdb should make transaction fail if there is any
+     * client watching keys */
+    scanDatabaseForReadyLists(db1);
+    touchAllWatchedKeysInDb(db1, db2);
+    scanDatabaseForReadyLists(db2);
+    touchAllWatchedKeysInDb(db2, db1);
+    return C_OK;
+}
+
+/* SWAPDB db1 db2 */
+void swapdbCommand(client *c) {
+    int id1, id2;
+
+    /* Not allowed in cluster mode: we have just DB 0 there. */
+    if (server.cluster_enabled) {
+        addReplyError(c,"SWAPDB is not allowed in cluster mode");
+        return;
+    }
+
+    /* Get the two DBs indexes. */
+    if (getIntFromObjectOrReply(c, c->argv[1], &id1,
+        "invalid first DB index") != C_OK)
+        return;
+
+    if (getIntFromObjectOrReply(c, c->argv[2], &id2,
+        "invalid second DB index") != C_OK)
+        return;
+
+    /* Swap... */
+    if (dbSwapDatabases(id1,id2) == C_ERR) {
+        addReplyError(c,"DB index is out of range");
+        return;
+    } else {
+        RedisModuleSwapDbInfo si = {REDISMODULE_SWAPDBINFO_VERSION,id1,id2};
+        moduleFireServerEvent(REDISMODULE_EVENT_SWAPDB,0,&si);
+        server.dirty++;
+        addReply(c,shared.ok);
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Expires API
+ *----------------------------------------------------------------------------*/
+
+int removeExpire(redisDb *db, robj *key) {
+    /* An expire may only be removed if there is a corresponding entry in the
+     * main dict. Otherwise, the key will never be freed. */
+    serverAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
+    return dictDelete(db->expires,key->ptr) == DICT_OK;
+}
+
+/* Set an expire to the specified key. If the expire is set in the context
+ * of an user calling a command 'c' is the client, otherwise 'c' is set
+ * to NULL. The 'when' parameter is the absolute unix time in milliseconds
+ * after which the key will no longer be considered valid. */
+void setExpire(client *c, redisDb *db, robj *key, long long when) {
+    dictEntry *kde, *de;
+
+    /* Reuse the sds from the main dict in the expire dict */
+    kde = dictFind(db->dict,key->ptr);
+    serverAssertWithInfo(NULL,key,kde != NULL);
+    de = dictAddOrFind(db->expires,dictGetKey(kde));
+    dictSetSignedIntegerVal(de,when);
+
+    int writable_slave = server.masterhost && server.repl_slave_ro == 0;
+    if (c && writable_slave && !(c->flags & CLIENT_MASTER))
+        rememberSlaveKeyWithExpire(db,key);
+}
+
+/* Return the expire time of the specified key, or -1 if no expire
+ * is associated with this key (i.e. the key is non volatile) */
+long long getExpire(redisDb *db, robj *key) {
+    dictEntry *de;
+
+    /* No expire? return ASAP */
+    if (dictSize(db->expires) == 0 ||
+       (de = dictFind(db->expires,key->ptr)) == NULL) return -1;
+
+    /* The entry was found in the expire dict, this means it should also
+     * be present in the main dict (safety check). */
+    serverAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
+    return dictGetSignedIntegerVal(de);
+}
+
+/* Delete the specified expired key and propagate expire. */
+void deleteExpiredKeyAndPropagate(redisDb *db, robj *keyobj) {
+    mstime_t expire_latency;
+    latencyStartMonitor(expire_latency);
+    if (server.lazyfree_lazy_expire)
+        dbAsyncDelete(db,keyobj);
+    else
+        dbSyncDelete(db,keyobj);
+    latencyEndMonitor(expire_latency);
+    latencyAddSampleIfNeeded("expire-del",expire_latency);
+    notifyKeyspaceEvent(NOTIFY_EXPIRED,"expired",keyobj,db->id);
+    signalModifiedKey(NULL, db, keyobj);
+    propagateExpire(db,keyobj,server.lazyfree_lazy_expire);
+    server.stat_expiredkeys++;
+}
+
+/* Propagate expires into slaves and the AOF file.
+ * When a key expires in the master, a DEL operation for this key is sent
+ * to all the slaves and the AOF file if enabled.
+ *
+ * This way the key expiry is centralized in one place, and since both
+ * AOF and the master->slave link guarantee operation ordering, everything
+ * will be consistent even if we allow write operations against expiring
+ * keys. */
+void propagateExpire(redisDb *db, robj *key, int lazy) {
+    robj *argv[2];
+
+    argv[0] = lazy ? shared.unlink : shared.del;
+    argv[1] = key;
+    incrRefCount(argv[0]);
+    incrRefCount(argv[1]);
+
+    /* If the master decided to expire a key we must propagate it to replicas no matter what..
+     * Even if module executed a command without asking for propagation. */
+    int prev_replication_allowed = server.replication_allowed;
+    server.replication_allowed = 1;
+    propagate(server.delCommand,db->id,argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
+    server.replication_allowed = prev_replication_allowed;
+
+    decrRefCount(argv[0]);
+    decrRefCount(argv[1]);
+}
+
+/* Check if the key is expired. */
+int keyIsExpired(redisDb *db, robj *key) {
+    mstime_t when = getExpire(db,key);
+    mstime_t now;
+
+    if (when < 0) return 0; /* No expire for this key */
+
+    /* Don't expire anything while loading. It will be done later. */
+    if (server.loading) return 0;
+
+    /* If we are in the context of a Lua script, we pretend that time is
+     * blocked to when the Lua script started. This way a key can expire
+     * only the first time it is accessed and not in the middle of the
+     * script execution, making propagation to slaves / AOF consistent.
+     * See issue #1525 on Github for more information. */
+    if (server.lua_caller) {
+        now = server.lua_time_snapshot;
+    }
+    /* If we are in the middle of a command execution, we still want to use
+     * a reference time that does not change: in that case we just use the
+     * cached time, that we update before each call in the call() function.
+     * This way we avoid that commands such as RPOPLPUSH or similar, that
+     * may re-open the same key multiple times, can invalidate an already
+     * open object in a next call, if the next call will see the key expired,
+     * while the first did not. */
+    else if (server.fixed_time_expire > 0) {
+        now = server.mstime;
+    }
+    /* For the other cases, we want to use the most fresh time we have. */
+    else {
+        now = mstime();
+    }
+
+    /* The key expired if the current (virtual or real) time is greater
+     * than the expire time of the key. */
+    return now > when;
+}
+
+/* This function is called when we are going to perform some operation
+ * in a given key, but such key may be already logically expired even if
+ * it still exists in the database. The main way this function is called
+ * is via lookupKey*() family of functions.
+ *
+ * The behavior of the function depends on the replication role of the
+ * instance, because slave instances do not expire keys, they wait
+ * for DELs from the master for consistency matters. However even
+ * slaves will try to have a coherent return value for the function,
+ * so that read commands executed in the slave side will be able to
+ * behave like if the key is expired even if still present (because the
+ * master has yet to propagate the DEL).
+ *
+ * In masters as a side effect of finding a key which is expired, such
+ * key will be evicted from the database. Also this may trigger the
+ * propagation of a DEL/UNLINK command in AOF / replication stream.
+ *
+ * The return value of the function is 0 if the key is still valid,
+ * otherwise the function returns 1 if the key is expired. */
+int expireIfNeeded(redisDb *db, robj *key) {
+    if (!keyIsExpired(db,key)) return 0;
+
+    /* If we are running in the context of a slave, instead of
+     * evicting the expired key from the database, we return ASAP:
+     * the slave key expiration is controlled by the master that will
+     * send us synthesized DEL operations for expired keys.
+     *
+     * Still we try to return the right information to the caller,
+     * that is, 0 if we think the key should be still valid, 1 if
+     * we think the key is expired at this time. */
+    if (server.masterhost != NULL) return 1;
+
+    /* If clients are paused, we keep the current dataset constant,
+     * but return to the client what we believe is the right state. Typically,
+     * at the end of the pause we will properly expire the key OR we will
+     * have failed over and the new primary will send us the expire. */
+    if (checkClientPauseTimeoutAndReturnIfPaused()) return 1;
+
+    /* Delete the key */
+    deleteExpiredKeyAndPropagate(db,key);
+    return 1;
+}
+
+/* -----------------------------------------------------------------------------
+ * API to get key arguments from commands
+ * ---------------------------------------------------------------------------*/
+
+/* Prepare the getKeysResult struct to hold numkeys, either by using the
+ * pre-allocated keysbuf or by allocating a new array on the heap.
+ *
+ * This function must be called at least once before starting to populate
+ * the result, and can be called repeatedly to enlarge the result array.
+ */
+int *getKeysPrepareResult(getKeysResult *result, int numkeys) {
+    /* GETKEYS_RESULT_INIT initializes keys to NULL, point it to the pre-allocated stack
+     * buffer here. */
+    if (!result->keys) {
+        serverAssert(!result->numkeys);
+        result->keys = result->keysbuf;
+    }
+
+    /* Resize if necessary */
+    if (numkeys > result->size) {
+        if (result->keys != result->keysbuf) {
+            /* We're not using a static buffer, just (re)alloc */
+            result->keys = zrealloc(result->keys, numkeys * sizeof(int));
+        } else {
+            /* We are using a static buffer, copy its contents */
+            result->keys = zmalloc(numkeys * sizeof(int));
+            if (result->numkeys)
+                memcpy(result->keys, result->keysbuf, result->numkeys * sizeof(int));
+        }
+        result->size = numkeys;
+    }
+
+    return result->keys;
+}
+
+/* The base case is to use the keys position as given in the command table
+ * (firstkey, lastkey, step). */
+int getKeysUsingCommandTable(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result) {
+    int j, i = 0, last, *keys;
+    UNUSED(argv);
+
+    if (cmd->firstkey == 0) {
+        result->numkeys = 0;
+        return 0;
+    }
+
+    last = cmd->lastkey;
+    if (last < 0) last = argc+last;
+
+    int count = ((last - cmd->firstkey)+1);
+    keys = getKeysPrepareResult(result, count);
+
+    for (j = cmd->firstkey; j <= last; j += cmd->keystep) {
+        if (j >= argc) {
+            /* Modules commands, and standard commands with a not fixed number
+             * of arguments (negative arity parameter) do not have dispatch
+             * time arity checks, so we need to handle the case where the user
+             * passed an invalid number of arguments here. In this case we
+             * return no keys and expect the command implementation to report
+             * an arity or syntax error. */
+            if (cmd->flags & CMD_MODULE || cmd->arity < 0) {
+                result->numkeys = 0;
+                return 0;
+            } else {
+                serverPanic("Redis built-in command declared keys positions not matching the arity requirements.");
+            }
+        }
+        keys[i++] = j;
+    }
+    result->numkeys = i;
+    return i;
+}
+
+/* Return all the arguments that are keys in the command passed via argc / argv.
+ *
+ * The command returns the positions of all the key arguments inside the array,
+ * so the actual return value is a heap allocated array of integers. The
+ * length of the array is returned by reference into *numkeys.
+ *
+ * 'cmd' must be point to the corresponding entry into the redisCommand
+ * table, according to the command name in argv[0].
+ *
+ * This function uses the command table if a command-specific helper function
+ * is not required, otherwise it calls the command-specific function. */
+int getKeysFromCommand(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    if (cmd->flags & CMD_MODULE_GETKEYS) {
+        return moduleGetCommandKeysViaAPI(cmd,argv,argc,result);
+    } else if (!(cmd->flags & CMD_MODULE) && cmd->getkeys_proc) {
+        return cmd->getkeys_proc(cmd,argv,argc,result);
+    } else {
+        return getKeysUsingCommandTable(cmd,argv,argc,result);
+    }
+}
+
+/* Free the result of getKeysFromCommand. */
+void getKeysFreeResult(getKeysResult *result) {
+    if (result && result->keys != result->keysbuf)
+        zfree(result->keys);
+}
+
+/* Helper function to extract keys from following commands:
+ * COMMAND [destkey] <num-keys> <key> [...] <key> [...] ... <options>
+ *
+ * eg:
+ * ZUNION <num-keys> <key> <key> ... <key> <options>
+ * ZUNIONSTORE <destkey> <num-keys> <key> <key> ... <key> <options>
+ *
+ * 'storeKeyOfs': destkey index, 0 means destkey not exists.
+ * 'keyCountOfs': num-keys index.
+ * 'firstKeyOfs': firstkey index.
+ * 'keyStep': the interval of each key, usually this value is 1.
+ * */
+int genericGetKeys(int storeKeyOfs, int keyCountOfs, int firstKeyOfs, int keyStep,
+                    robj **argv, int argc, getKeysResult *result) {
+    int i, num, *keys;
+
+    num = atoi(argv[keyCountOfs]->ptr);
+    /* Sanity check. Don't return any key if the command is going to
+     * reply with syntax error. (no input keys). */
+    if (num < 1 || num > (argc - firstKeyOfs)/keyStep) {
+        result->numkeys = 0;
+        return 0;
+    }
+
+    int numkeys = storeKeyOfs ? num + 1 : num;
+    keys = getKeysPrepareResult(result, numkeys);
+    result->numkeys = numkeys;
+
+    /* Add all key positions for argv[firstKeyOfs...n] to keys[] */
+    for (i = 0; i < num; i++) keys[i] = firstKeyOfs+(i*keyStep);
+
+    if (storeKeyOfs) keys[num] = storeKeyOfs;
+    return result->numkeys;
+}
+
+int zunionInterDiffStoreGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    UNUSED(cmd);
+    return genericGetKeys(1, 2, 3, 1, argv, argc, result);
+}
+
+int zunionInterDiffGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    UNUSED(cmd);
+    return genericGetKeys(0, 1, 2, 1, argv, argc, result);
+}
+
+int evalGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    UNUSED(cmd);
+    return genericGetKeys(0, 2, 3, 1, argv, argc, result);
+}
+
+/* Helper function to extract keys from the SORT command.
+ *
+ * SORT <sort-key> ... STORE <store-key> ...
+ *
+ * The first argument of SORT is always a key, however a list of options
+ * follow in SQL-alike style. Here we parse just the minimum in order to
+ * correctly identify keys in the "STORE" option. */
+int sortGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    int i, j, num, *keys, found_store = 0;
+    UNUSED(cmd);
+
+    num = 0;
+    keys = getKeysPrepareResult(result, 2); /* Alloc 2 places for the worst case. */
+    keys[num++] = 1; /* <sort-key> is always present. */
+
+    /* Search for STORE option. By default we consider options to don't
+     * have arguments, so if we find an unknown option name we scan the
+     * next. However there are options with 1 or 2 arguments, so we
+     * provide a list here in order to skip the right number of args. */
+    struct {
+        char *name;
+        int skip;
+    } skiplist[] = {
+        {"limit", 2},
+        {"get", 1},
+        {"by", 1},
+        {NULL, 0} /* End of elements. */
+    };
+
+    for (i = 2; i < argc; i++) {
+        for (j = 0; skiplist[j].name != NULL; j++) {
+            if (!strcasecmp(argv[i]->ptr,skiplist[j].name)) {
+                i += skiplist[j].skip;
+                break;
+            } else if (!strcasecmp(argv[i]->ptr,"store") && i+1 < argc) {
+                /* Note: we don't increment "num" here and continue the loop
+                 * to be sure to process the *last* "STORE" option if multiple
+                 * ones are provided. This is same behavior as SORT. */
+                found_store = 1;
+                keys[num] = i+1; /* <store-key> */
+                break;
+            }
+        }
+    }
+    result->numkeys = num + found_store;
+    return result->numkeys;
+}
+
+int migrateGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    int i, num, first, *keys;
+    UNUSED(cmd);
+
+    /* Assume the obvious form. */
+    first = 3;
+    num = 1;
+
+    /* But check for the extended one with the KEYS option. */
+    if (argc > 6) {
+        for (i = 6; i < argc; i++) {
+            if (!strcasecmp(argv[i]->ptr,"keys") &&
+                sdslen(argv[3]->ptr) == 0)
+            {
+                first = i+1;
+                num = argc-first;
+                break;
+            }
+        }
+    }
+
+    keys = getKeysPrepareResult(result, num);
+    for (i = 0; i < num; i++) keys[i] = first+i;
+    result->numkeys = num;
+    return num;
+}
+
+/* Helper function to extract keys from following commands:
+ * GEORADIUS key x y radius unit [WITHDIST] [WITHHASH] [WITHCOORD] [ASC|DESC]
+ *                             [COUNT count] [STORE key] [STOREDIST key]
+ * GEORADIUSBYMEMBER key member radius unit ... options ... */
+int georadiusGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    int i, num, *keys;
+    UNUSED(cmd);
+
+    /* Check for the presence of the stored key in the command */
+    int stored_key = -1;
+    for (i = 5; i < argc; i++) {
+        char *arg = argv[i]->ptr;
+        /* For the case when user specifies both "store" and "storedist" options, the
+         * second key specified would override the first key. This behavior is kept
+         * the same as in georadiusCommand method.
+         */
+        if ((!strcasecmp(arg, "store") || !strcasecmp(arg, "storedist")) && ((i+1) < argc)) {
+            stored_key = i+1;
+            i++;
+        }
+    }
+    num = 1 + (stored_key == -1 ? 0 : 1);
+
+    /* Keys in the command come from two places:
+     * argv[1] = key,
+     * argv[5...n] = stored key if present
+     */
+    keys = getKeysPrepareResult(result, num);
+
+    /* Add all key positions to keys[] */
+    keys[0] = 1;
+    if(num > 1) {
+         keys[1] = stored_key;
+    }
+    result->numkeys = num;
+    return num;
+}
+
+/* LCS ... [KEYS <key1> <key2>] ... */
+int lcsGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    int i;
+    int *keys = getKeysPrepareResult(result, 2);
+    UNUSED(cmd);
+
+    /* We need to parse the options of the command in order to check for the
+     * "KEYS" argument before the "STRINGS" argument. */
+    for (i = 1; i < argc; i++) {
+        char *arg = argv[i]->ptr;
+        int moreargs = (argc-1) - i;
+
+        if (!strcasecmp(arg, "strings")) {
+            break;
+        } else if (!strcasecmp(arg, "keys") && moreargs >= 2) {
+            keys[0] = i+1;
+            keys[1] = i+2;
+            result->numkeys = 2;
+            return result->numkeys;
+        }
+    }
+    result->numkeys = 0;
+    return result->numkeys;
+}
+
+/* Helper function to extract keys from memory command.
+ * MEMORY USAGE <key> */
+int memoryGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    UNUSED(cmd);
+
+    getKeysPrepareResult(result, 1);
+    if (argc >= 3 && !strcasecmp(argv[1]->ptr,"usage")) {
+        result->keys[0] = 2;
+        result->numkeys = 1;
+        return result->numkeys;
+    }
+    result->numkeys = 0;
+    return 0;
+}
+
+/* XREAD [BLOCK <milliseconds>] [COUNT <count>] [GROUP <groupname> <ttl>]
+ *       STREAMS key_1 key_2 ... key_N ID_1 ID_2 ... ID_N */
+int xreadGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    int i, num = 0, *keys;
+    UNUSED(cmd);
+
+    /* We need to parse the options of the command in order to seek the first
+     * "STREAMS" string which is actually the option. This is needed because
+     * "STREAMS" could also be the name of the consumer group and even the
+     * name of the stream key. */
+    int streams_pos = -1;
+    for (i = 1; i < argc; i++) {
+        char *arg = argv[i]->ptr;
+        if (!strcasecmp(arg, "block")) {
+            i++; /* Skip option argument. */
+        } else if (!strcasecmp(arg, "count")) {
+            i++; /* Skip option argument. */
+        } else if (!strcasecmp(arg, "group")) {
+            i += 2; /* Skip option argument. */
+        } else if (!strcasecmp(arg, "noack")) {
+            /* Nothing to do. */
+        } else if (!strcasecmp(arg, "streams")) {
+            streams_pos = i;
+            break;
+        } else {
+            break; /* Syntax error. */
+        }
+    }
+    if (streams_pos != -1) num = argc - streams_pos - 1;
+
+    /* Syntax error. */
+    if (streams_pos == -1 || num == 0 || num % 2 != 0) {
+        result->numkeys = 0;
+        return 0;
+    }
+    num /= 2; /* We have half the keys as there are arguments because
+                 there are also the IDs, one per key. */
+
+    keys = getKeysPrepareResult(result, num);
+    for (i = streams_pos+1; i < argc-num; i++) keys[i-streams_pos-1] = i;
+    result->numkeys = num;
+    return num;
+}
+
+/* Slot to Key API. This is used by Redis Cluster in order to obtain in
+ * a fast way a key that belongs to a specified hash slot. This is useful
+ * while rehashing the cluster and in other conditions when we need to
+ * understand if we have keys for a given hash slot. */
+void slotToKeyUpdateKey(sds key, int add) {
+    size_t keylen = sdslen(key);
+    unsigned int hashslot = keyHashSlot(key,keylen);
+    unsigned char buf[64];
+    unsigned char *indexed = buf;
+
+    server.cluster->slots_keys_count[hashslot] += add ? 1 : -1;
+    if (keylen+2 > 64) indexed = zmalloc(keylen+2);
+    indexed[0] = (hashslot >> 8) & 0xff;
+    indexed[1] = hashslot & 0xff;
+    memcpy(indexed+2,key,keylen);
+    if (add) {
+        raxInsert(server.cluster->slots_to_keys,indexed,keylen+2,NULL,NULL);
+    } else {
+        raxRemove(server.cluster->slots_to_keys,indexed,keylen+2,NULL);
+    }
+    if (indexed != buf) zfree(indexed);
+}
+
+void slotToKeyAdd(sds key) {
+    slotToKeyUpdateKey(key,1);
+}
+
+void slotToKeyDel(sds key) {
+    slotToKeyUpdateKey(key,0);
+}
+
+/* Release the radix tree mapping Redis Cluster keys to slots. If 'async'
+ * is true, we release it asynchronously. */
+void freeSlotsToKeysMap(rax *rt, int async) {
+    if (async) {
+        freeSlotsToKeysMapAsync(rt);
+    } else {
+        raxFree(rt);
+    }
+}
+
+/* Empty the slots-keys map of Redis CLuster by creating a new empty one and
+ * freeing the old one. */
+void slotToKeyFlush(int async) {
+    rax *old = server.cluster->slots_to_keys;
+
+    server.cluster->slots_to_keys = raxNew();
+    memset(server.cluster->slots_keys_count,0,
+           sizeof(server.cluster->slots_keys_count));
+    freeSlotsToKeysMap(old, async);
+}
+
+/* Populate the specified array of objects with keys in the specified slot.
+ * New objects are returned to represent keys, it's up to the caller to
+ * decrement the reference count to release the keys names. */
+unsigned int getKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count) {
+    raxIterator iter;
+    int j = 0;
+    unsigned char indexed[2];
+
+    indexed[0] = (hashslot >> 8) & 0xff;
+    indexed[1] = hashslot & 0xff;
+    raxStart(&iter,server.cluster->slots_to_keys);
+    raxSeek(&iter,">=",indexed,2);
+    while(count-- && raxNext(&iter)) {
+        if (iter.key[0] != indexed[0] || iter.key[1] != indexed[1]) break;
+        keys[j++] = createStringObject((char*)iter.key+2,iter.key_len-2);
+    }
+    raxStop(&iter);
+    return j;
+}
+
+/* Remove all the keys in the specified hash slot.
+ * The number of removed items is returned. */
+unsigned int delKeysInSlot(unsigned int hashslot) {
+    raxIterator iter;
+    int j = 0;
+    unsigned char indexed[2];
+
+    indexed[0] = (hashslot >> 8) & 0xff;
+    indexed[1] = hashslot & 0xff;
+    raxStart(&iter,server.cluster->slots_to_keys);
+    while(server.cluster->slots_keys_count[hashslot]) {
+        raxSeek(&iter,">=",indexed,2);
+        raxNext(&iter);
+
+        robj *key = createStringObject((char*)iter.key+2,iter.key_len-2);
+        dbDelete(&server.db[0],key);
+        decrRefCount(key);
+        j++;
+    }
+    raxStop(&iter);
+    return j;
+}
+
+unsigned int countKeysInSlot(unsigned int hashslot) {
+    return server.cluster->slots_keys_count[hashslot];
+}
diff --git a/redis-stable/src/debug.c b/redis-stable/src/debug.c
new file mode 100644
index 00000000..f521490a
--- /dev/null
+++ b/redis-stable/src/debug.c
@@ -0,0 +1,1988 @@
+/*
+ * Copyright (c) 2009-2020, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2020, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "sha1.h"   /* SHA1 is used for DEBUG DIGEST */
+#include "crc64.h"
+#include "bio.h"
+
+#include <arpa/inet.h>
+#include <signal.h>
+#include <dlfcn.h>
+#include <fcntl.h>
+#include <unistd.h>
+
+#ifdef HAVE_BACKTRACE
+#include <execinfo.h>
+#ifndef __OpenBSD__
+#include <ucontext.h>
+#else
+typedef ucontext_t sigcontext_t;
+#endif
+#endif /* HAVE_BACKTRACE */
+
+#ifdef __CYGWIN__
+#ifndef SA_ONSTACK
+#define SA_ONSTACK 0x08000000
+#endif
+#endif
+
+#if defined(__APPLE__) && defined(__arm64__)
+#include <mach/mach.h>
+#endif
+
+/* Globals */
+static int bug_report_start = 0; /* True if bug report header was already logged. */
+static pthread_mutex_t bug_report_start_mutex = PTHREAD_MUTEX_INITIALIZER;
+
+/* Forward declarations */
+void bugReportStart(void);
+void printCrashReport(void);
+void bugReportEnd(int killViaSignal, int sig);
+void logStackTrace(void *eip, int uplevel);
+
+/* ================================= Debugging ============================== */
+
+/* Compute the sha1 of string at 's' with 'len' bytes long.
+ * The SHA1 is then xored against the string pointed by digest.
+ * Since xor is commutative, this operation is used in order to
+ * "add" digests relative to unordered elements.
+ *
+ * So digest(a,b,c,d) will be the same of digest(b,a,c,d) */
+void xorDigest(unsigned char *digest, void *ptr, size_t len) {
+    SHA1_CTX ctx;
+    unsigned char hash[20], *s = ptr;
+    int j;
+
+    SHA1Init(&ctx);
+    SHA1Update(&ctx,s,len);
+    SHA1Final(hash,&ctx);
+
+    for (j = 0; j < 20; j++)
+        digest[j] ^= hash[j];
+}
+
+void xorStringObjectDigest(unsigned char *digest, robj *o) {
+    o = getDecodedObject(o);
+    xorDigest(digest,o->ptr,sdslen(o->ptr));
+    decrRefCount(o);
+}
+
+/* This function instead of just computing the SHA1 and xoring it
+ * against digest, also perform the digest of "digest" itself and
+ * replace the old value with the new one.
+ *
+ * So the final digest will be:
+ *
+ * digest = SHA1(digest xor SHA1(data))
+ *
+ * This function is used every time we want to preserve the order so
+ * that digest(a,b,c,d) will be different than digest(b,c,d,a)
+ *
+ * Also note that mixdigest("foo") followed by mixdigest("bar")
+ * will lead to a different digest compared to "fo", "obar".
+ */
+void mixDigest(unsigned char *digest, void *ptr, size_t len) {
+    SHA1_CTX ctx;
+    char *s = ptr;
+
+    xorDigest(digest,s,len);
+    SHA1Init(&ctx);
+    SHA1Update(&ctx,digest,20);
+    SHA1Final(digest,&ctx);
+}
+
+void mixStringObjectDigest(unsigned char *digest, robj *o) {
+    o = getDecodedObject(o);
+    mixDigest(digest,o->ptr,sdslen(o->ptr));
+    decrRefCount(o);
+}
+
+/* This function computes the digest of a data structure stored in the
+ * object 'o'. It is the core of the DEBUG DIGEST command: when taking the
+ * digest of a whole dataset, we take the digest of the key and the value
+ * pair, and xor all those together.
+ *
+ * Note that this function does not reset the initial 'digest' passed, it
+ * will continue mixing this object digest to anything that was already
+ * present. */
+void xorObjectDigest(redisDb *db, robj *keyobj, unsigned char *digest, robj *o) {
+    uint32_t aux = htonl(o->type);
+    mixDigest(digest,&aux,sizeof(aux));
+    long long expiretime = getExpire(db,keyobj);
+    char buf[128];
+
+    /* Save the key and associated value */
+    if (o->type == OBJ_STRING) {
+        mixStringObjectDigest(digest,o);
+    } else if (o->type == OBJ_LIST) {
+        listTypeIterator *li = listTypeInitIterator(o,0,LIST_TAIL);
+        listTypeEntry entry;
+        while(listTypeNext(li,&entry)) {
+            robj *eleobj = listTypeGet(&entry);
+            mixStringObjectDigest(digest,eleobj);
+            decrRefCount(eleobj);
+        }
+        listTypeReleaseIterator(li);
+    } else if (o->type == OBJ_SET) {
+        setTypeIterator *si = setTypeInitIterator(o);
+        sds sdsele;
+        while((sdsele = setTypeNextObject(si)) != NULL) {
+            xorDigest(digest,sdsele,sdslen(sdsele));
+            sdsfree(sdsele);
+        }
+        setTypeReleaseIterator(si);
+    } else if (o->type == OBJ_ZSET) {
+        unsigned char eledigest[20];
+
+        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            unsigned char *zl = o->ptr;
+            unsigned char *eptr, *sptr;
+            unsigned char *vstr;
+            unsigned int vlen;
+            long long vll;
+            double score;
+
+            eptr = ziplistIndex(zl,0);
+            serverAssert(eptr != NULL);
+            sptr = ziplistNext(zl,eptr);
+            serverAssert(sptr != NULL);
+
+            while (eptr != NULL) {
+                serverAssert(ziplistGet(eptr,&vstr,&vlen,&vll));
+                score = zzlGetScore(sptr);
+
+                memset(eledigest,0,20);
+                if (vstr != NULL) {
+                    mixDigest(eledigest,vstr,vlen);
+                } else {
+                    ll2string(buf,sizeof(buf),vll);
+                    mixDigest(eledigest,buf,strlen(buf));
+                }
+
+                snprintf(buf,sizeof(buf),"%.17g",score);
+                mixDigest(eledigest,buf,strlen(buf));
+                xorDigest(digest,eledigest,20);
+                zzlNext(zl,&eptr,&sptr);
+            }
+        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = o->ptr;
+            dictIterator *di = dictGetIterator(zs->dict);
+            dictEntry *de;
+
+            while((de = dictNext(di)) != NULL) {
+                sds sdsele = dictGetKey(de);
+                double *score = dictGetVal(de);
+
+                snprintf(buf,sizeof(buf),"%.17g",*score);
+                memset(eledigest,0,20);
+                mixDigest(eledigest,sdsele,sdslen(sdsele));
+                mixDigest(eledigest,buf,strlen(buf));
+                xorDigest(digest,eledigest,20);
+            }
+            dictReleaseIterator(di);
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else if (o->type == OBJ_HASH) {
+        hashTypeIterator *hi = hashTypeInitIterator(o);
+        while (hashTypeNext(hi) != C_ERR) {
+            unsigned char eledigest[20];
+            sds sdsele;
+
+            memset(eledigest,0,20);
+            sdsele = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
+            mixDigest(eledigest,sdsele,sdslen(sdsele));
+            sdsfree(sdsele);
+            sdsele = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
+            mixDigest(eledigest,sdsele,sdslen(sdsele));
+            sdsfree(sdsele);
+            xorDigest(digest,eledigest,20);
+        }
+        hashTypeReleaseIterator(hi);
+    } else if (o->type == OBJ_STREAM) {
+        streamIterator si;
+        streamIteratorStart(&si,o->ptr,NULL,NULL,0);
+        streamID id;
+        int64_t numfields;
+
+        while(streamIteratorGetID(&si,&id,&numfields)) {
+            sds itemid = sdscatfmt(sdsempty(),"%U.%U",id.ms,id.seq);
+            mixDigest(digest,itemid,sdslen(itemid));
+            sdsfree(itemid);
+
+            while(numfields--) {
+                unsigned char *field, *value;
+                int64_t field_len, value_len;
+                streamIteratorGetField(&si,&field,&value,
+                                           &field_len,&value_len);
+                mixDigest(digest,field,field_len);
+                mixDigest(digest,value,value_len);
+            }
+        }
+        streamIteratorStop(&si);
+    } else if (o->type == OBJ_MODULE) {
+        RedisModuleDigest md = {{0},{0}};
+        moduleValue *mv = o->ptr;
+        moduleType *mt = mv->type;
+        moduleInitDigestContext(md);
+        if (mt->digest) {
+            mt->digest(&md,mv->value);
+            xorDigest(digest,md.x,sizeof(md.x));
+        }
+    } else {
+        serverPanic("Unknown object type");
+    }
+    /* If the key has an expire, add it to the mix */
+    if (expiretime != -1) xorDigest(digest,"!!expire!!",10);
+}
+
+/* Compute the dataset digest. Since keys, sets elements, hashes elements
+ * are not ordered, we use a trick: every aggregate digest is the xor
+ * of the digests of their elements. This way the order will not change
+ * the result. For list instead we use a feedback entering the output digest
+ * as input in order to ensure that a different ordered list will result in
+ * a different digest. */
+void computeDatasetDigest(unsigned char *final) {
+    unsigned char digest[20];
+    dictIterator *di = NULL;
+    dictEntry *de;
+    int j;
+    uint32_t aux;
+
+    memset(final,0,20); /* Start with a clean result */
+
+    for (j = 0; j < server.dbnum; j++) {
+        redisDb *db = server.db+j;
+
+        if (dictSize(db->dict) == 0) continue;
+        di = dictGetSafeIterator(db->dict);
+
+        /* hash the DB id, so the same dataset moved in a different
+         * DB will lead to a different digest */
+        aux = htonl(j);
+        mixDigest(final,&aux,sizeof(aux));
+
+        /* Iterate this DB writing every entry */
+        while((de = dictNext(di)) != NULL) {
+            sds key;
+            robj *keyobj, *o;
+
+            memset(digest,0,20); /* This key-val digest */
+            key = dictGetKey(de);
+            keyobj = createStringObject(key,sdslen(key));
+
+            mixDigest(digest,key,sdslen(key));
+
+            o = dictGetVal(de);
+            xorObjectDigest(db,keyobj,digest,o);
+
+            /* We can finally xor the key-val digest to the final digest */
+            xorDigest(final,digest,20);
+            decrRefCount(keyobj);
+        }
+        dictReleaseIterator(di);
+    }
+}
+
+#ifdef USE_JEMALLOC
+void mallctl_int(client *c, robj **argv, int argc) {
+    int ret;
+    /* start with the biggest size (int64), and if that fails, try smaller sizes (int32, bool) */
+    int64_t old = 0, val;
+    if (argc > 1) {
+        long long ll;
+        if (getLongLongFromObjectOrReply(c, argv[1], &ll, NULL) != C_OK)
+            return;
+        val = ll;
+    }
+    size_t sz = sizeof(old);
+    while (sz > 0) {
+        if ((ret=je_mallctl(argv[0]->ptr, &old, &sz, argc > 1? &val: NULL, argc > 1?sz: 0))) {
+            if (ret == EPERM && argc > 1) {
+                /* if this option is write only, try just writing to it. */
+                if (!(ret=je_mallctl(argv[0]->ptr, NULL, 0, &val, sz))) {
+                    addReply(c, shared.ok);
+                    return;
+                }
+            }
+            if (ret==EINVAL) {
+                /* size might be wrong, try a smaller one */
+                sz /= 2;
+#if BYTE_ORDER == BIG_ENDIAN
+                val <<= 8*sz;
+#endif
+                continue;
+            }
+            addReplyErrorFormat(c,"%s", strerror(ret));
+            return;
+        } else {
+#if BYTE_ORDER == BIG_ENDIAN
+            old >>= 64 - 8*sz;
+#endif
+            addReplyLongLong(c, old);
+            return;
+        }
+    }
+    addReplyErrorFormat(c,"%s", strerror(EINVAL));
+}
+
+void mallctl_string(client *c, robj **argv, int argc) {
+    int rret, wret;
+    char *old;
+    size_t sz = sizeof(old);
+    /* for strings, it seems we need to first get the old value, before overriding it. */
+    if ((rret=je_mallctl(argv[0]->ptr, &old, &sz, NULL, 0))) {
+        /* return error unless this option is write only. */
+        if (!(rret == EPERM && argc > 1)) {
+            addReplyErrorFormat(c,"%s", strerror(rret));
+            return;
+        }
+    }
+    if(argc > 1) {
+        char *val = argv[1]->ptr;
+        char **valref = &val;
+        if ((!strcmp(val,"VOID")))
+            valref = NULL, sz = 0;
+        wret = je_mallctl(argv[0]->ptr, NULL, 0, valref, sz);
+    }
+    if (!rret)
+        addReplyBulkCString(c, old);
+    else if (wret)
+        addReplyErrorFormat(c,"%s", strerror(wret));
+    else
+        addReply(c, shared.ok);
+}
+#endif
+
+void debugCommand(client *c) {
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"AOF-FLUSH-SLEEP <microsec>",
+"    Server will sleep before flushing the AOF, this is used for testing.",
+"ASSERT",
+"    Crash by assertion failed.",
+"CHANGE-REPL-ID"
+"    Change the replication IDs of the instance.",
+"    Dangerous: should be used only for testing the replication subsystem.",
+"CONFIG-REWRITE-FORCE-ALL",
+"    Like CONFIG REWRITE but writes all configuration options, including",
+"    keywords not listed in original configuration file or default values.",
+"CRASH-AND-RECOVER <milliseconds>",
+"    Hard crash and restart after a <milliseconds> delay.",
+"DIGEST",
+"    Output a hex signature representing the current DB content.",
+"DIGEST-VALUE <key> [<key> ...]",
+"    Output a hex signature of the values of all the specified keys.",
+"ERROR <string>",
+"    Return a Redis protocol error with <string> as message. Useful for clients",
+"    unit tests to simulate Redis errors.",
+"LOG <message>",
+"    Write <message> to the server log.",
+"HTSTATS <dbid>",
+"    Return hash table statistics of the specified Redis database.",
+"HTSTATS-KEY <key>",
+"    Like HTSTATS but for the hash table stored at <key>'s value.",
+"LOADAOF",
+"    Flush the AOF buffers on disk and reload the AOF in memory.",
+"LUA-ALWAYS-REPLICATE-COMMANDS <0|1>",
+"    Setting it to 1 makes Lua replication defaulting to replicating single",
+"    commands, without the script having to enable effects replication.",
+#ifdef USE_JEMALLOC
+"MALLCTL <key> [<val>]",
+"    Get or set a malloc tuning integer.",
+"MALLCTL-STR <key> [<val>]",
+"    Get or set a malloc tuning string.",
+#endif
+"OBJECT <key>",
+"    Show low level info about `key` and associated value.",
+"OOM",
+"    Crash the server simulating an out-of-memory error.",
+"PANIC",
+"    Crash the server simulating a panic.",
+"POPULATE <count> [<prefix>] [<size>]",
+"    Create <count> string keys named key:<num>. If <prefix> is specified then",
+"    it is used instead of the 'key' prefix.",
+"DEBUG PROTOCOL <type>",
+"    Reply with a test value of the specified type. <type> can be: string,",
+"    integer, double, bignum, null, array, set, map, attrib, push, verbatim,",
+"    true, false.",
+"RELOAD [option ...]",
+"    Save the RDB on disk and reload it back to memory. Valid <option> values:",
+"    * MERGE: conflicting keys will be loaded from RDB.",
+"    * NOFLUSH: the existing database will not be removed before load, but",
+"      conflicting keys will generate an exception and kill the server."
+"    * NOSAVE: the database will be loaded from an existing RDB file.",
+"    Examples:",
+"    * DEBUG RELOAD: verify that the server is able to persist, flush and reload",
+"      the database.",
+"    * DEBUG RELOAD NOSAVE: replace the current database with the contents of an",
+"      existing RDB file.",
+"    * DEBUG RELOAD NOSAVE NOFLUSH MERGE: add the contents of an existing RDB",
+"      file to the database.",
+"RESTART",
+"    Graceful restart: save config, db, restart.",
+"SDSLEN <key>",
+"    Show low level SDS string info representing `key` and value.",
+"SEGFAULT",
+"    Crash the server with sigsegv.",
+"SET-ACTIVE-EXPIRE <0|1>",
+"    Setting it to 0 disables expiring keys in background when they are not",
+"    accessed (otherwise the Redis behavior). Setting it to 1 reenables back the",
+"    default.",
+"SET-SKIP-CHECKSUM-VALIDATION <0|1>",
+"    Enables or disables checksum checks for RDB files and RESTORE's payload.",
+"SLEEP <seconds>",
+"    Stop the server for <seconds>. Decimals allowed.",
+"STRINGMATCH-TEST",
+"    Run a fuzz tester against the stringmatchlen() function.",
+"STRUCTSIZE",
+"    Return the size of different Redis core C structures.",
+"ZIPLIST <key>",
+"    Show low level info about the ziplist encoding of <key>.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"segfault")) {
+        *((char*)-1) = 'x';
+    } else if (!strcasecmp(c->argv[1]->ptr,"panic")) {
+        serverPanic("DEBUG PANIC called at Unix time %lld", (long long)time(NULL));
+    } else if (!strcasecmp(c->argv[1]->ptr,"restart") ||
+               !strcasecmp(c->argv[1]->ptr,"crash-and-recover"))
+    {
+        long long delay = 0;
+        if (c->argc >= 3) {
+            if (getLongLongFromObjectOrReply(c, c->argv[2], &delay, NULL)
+                != C_OK) return;
+            if (delay < 0) delay = 0;
+        }
+        int flags = !strcasecmp(c->argv[1]->ptr,"restart") ?
+            (RESTART_SERVER_GRACEFULLY|RESTART_SERVER_CONFIG_REWRITE) :
+             RESTART_SERVER_NONE;
+        restartServer(flags,delay);
+        addReplyError(c,"failed to restart the server. Check server logs.");
+    } else if (!strcasecmp(c->argv[1]->ptr,"oom")) {
+        void *ptr = zmalloc(ULONG_MAX); /* Should trigger an out of memory. */
+        zfree(ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"assert")) {
+        serverAssertWithInfo(c,c->argv[0],1 == 2);
+    } else if (!strcasecmp(c->argv[1]->ptr,"log") && c->argc == 3) {
+        serverLog(LL_WARNING, "DEBUG LOG: %s", (char*)c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"leak") && c->argc == 3) {
+        sdsdup(c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"reload")) {
+        int flush = 1, save = 1;
+        int flags = RDBFLAGS_NONE;
+
+        /* Parse the additional options that modify the RELOAD
+         * behavior. */
+        for (int j = 2; j < c->argc; j++) {
+            char *opt = c->argv[j]->ptr;
+            if (!strcasecmp(opt,"MERGE")) {
+                flags |= RDBFLAGS_ALLOW_DUP;
+            } else if (!strcasecmp(opt,"NOFLUSH")) {
+                flush = 0;
+            } else if (!strcasecmp(opt,"NOSAVE")) {
+                save = 0;
+            } else {
+                addReplyError(c,"DEBUG RELOAD only supports the "
+                                "MERGE, NOFLUSH and NOSAVE options.");
+                return;
+            }
+        }
+
+        /* The default behavior is to save the RDB file before loading
+         * it back. */
+        if (save) {
+            rdbSaveInfo rsi, *rsiptr;
+            rsiptr = rdbPopulateSaveInfo(&rsi);
+            if (rdbSave(server.rdb_filename,rsiptr) != C_OK) {
+                addReplyErrorObject(c,shared.err);
+                return;
+            }
+        }
+
+        /* The default behavior is to remove the current dataset from
+         * memory before loading the RDB file, however when MERGE is
+         * used together with NOFLUSH, we are able to merge two datasets. */
+        if (flush) emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
+
+        protectClient(c);
+        int ret = rdbLoad(server.rdb_filename,NULL,flags);
+        unprotectClient(c);
+        if (ret != C_OK) {
+            addReplyError(c,"Error trying to load the RDB dump");
+            return;
+        }
+        serverLog(LL_WARNING,"DB reloaded by DEBUG RELOAD");
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"loadaof")) {
+        if (server.aof_state != AOF_OFF) flushAppendOnlyFile(1);
+        emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
+        protectClient(c);
+        int ret = loadAppendOnlyFile(server.aof_filename);
+        unprotectClient(c);
+        if (ret != C_OK) {
+            addReplyErrorObject(c,shared.err);
+            return;
+        }
+        server.dirty = 0; /* Prevent AOF / replication */
+        serverLog(LL_WARNING,"Append Only File loaded by DEBUG LOADAOF");
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"object") && c->argc == 3) {
+        dictEntry *de;
+        robj *val;
+        char *strenc;
+
+        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
+            addReplyErrorObject(c,shared.nokeyerr);
+            return;
+        }
+        val = dictGetVal(de);
+        strenc = strEncoding(val->encoding);
+
+        char extra[138] = {0};
+        if (val->encoding == OBJ_ENCODING_QUICKLIST) {
+            char *nextra = extra;
+            int remaining = sizeof(extra);
+            quicklist *ql = val->ptr;
+            /* Add number of quicklist nodes */
+            int used = snprintf(nextra, remaining, " ql_nodes:%lu", ql->len);
+            nextra += used;
+            remaining -= used;
+            /* Add average quicklist fill factor */
+            double avg = (double)ql->count/ql->len;
+            used = snprintf(nextra, remaining, " ql_avg_node:%.2f", avg);
+            nextra += used;
+            remaining -= used;
+            /* Add quicklist fill level / max ziplist size */
+            used = snprintf(nextra, remaining, " ql_ziplist_max:%d", ql->fill);
+            nextra += used;
+            remaining -= used;
+            /* Add isCompressed? */
+            int compressed = ql->compress != 0;
+            used = snprintf(nextra, remaining, " ql_compressed:%d", compressed);
+            nextra += used;
+            remaining -= used;
+            /* Add total uncompressed size */
+            unsigned long sz = 0;
+            for (quicklistNode *node = ql->head; node; node = node->next) {
+                sz += node->sz;
+            }
+            used = snprintf(nextra, remaining, " ql_uncompressed_size:%lu", sz);
+            nextra += used;
+            remaining -= used;
+        }
+
+        addReplyStatusFormat(c,
+            "Value at:%p refcount:%d "
+            "encoding:%s serializedlength:%zu "
+            "lru:%d lru_seconds_idle:%llu%s",
+            (void*)val, val->refcount,
+            strenc, rdbSavedObjectLen(val, c->argv[2]),
+            val->lru, estimateObjectIdleTime(val)/1000, extra);
+    } else if (!strcasecmp(c->argv[1]->ptr,"sdslen") && c->argc == 3) {
+        dictEntry *de;
+        robj *val;
+        sds key;
+
+        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
+            addReplyErrorObject(c,shared.nokeyerr);
+            return;
+        }
+        val = dictGetVal(de);
+        key = dictGetKey(de);
+
+        if (val->type != OBJ_STRING || !sdsEncodedObject(val)) {
+            addReplyError(c,"Not an sds encoded string.");
+        } else {
+            addReplyStatusFormat(c,
+                "key_sds_len:%lld, key_sds_avail:%lld, key_zmalloc: %lld, "
+                "val_sds_len:%lld, val_sds_avail:%lld, val_zmalloc: %lld",
+                (long long) sdslen(key),
+                (long long) sdsavail(key),
+                (long long) sdsZmallocSize(key),
+                (long long) sdslen(val->ptr),
+                (long long) sdsavail(val->ptr),
+                (long long) getStringObjectSdsUsedMemory(val));
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"ziplist") && c->argc == 3) {
+        robj *o;
+
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.nokeyerr))
+                == NULL) return;
+
+        if (o->encoding != OBJ_ENCODING_ZIPLIST) {
+            addReplyError(c,"Not a ziplist encoded object.");
+        } else {
+            ziplistRepr(o->ptr);
+            addReplyStatus(c,"Ziplist structure printed on stdout");
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"populate") &&
+               c->argc >= 3 && c->argc <= 5) {
+        long keys, j;
+        robj *key, *val;
+        char buf[128];
+
+        if (getPositiveLongFromObjectOrReply(c, c->argv[2], &keys, NULL) != C_OK)
+            return;
+
+        dictExpand(c->db->dict,keys);
+        long valsize = 0;
+        if ( c->argc == 5 && getPositiveLongFromObjectOrReply(c, c->argv[4], &valsize, NULL) != C_OK ) 
+            return;
+
+        for (j = 0; j < keys; j++) {
+            snprintf(buf,sizeof(buf),"%s:%lu",
+                (c->argc == 3) ? "key" : (char*)c->argv[3]->ptr, j);
+            key = createStringObject(buf,strlen(buf));
+            if (lookupKeyWrite(c->db,key) != NULL) {
+                decrRefCount(key);
+                continue;
+            }
+            snprintf(buf,sizeof(buf),"value:%lu",j);
+            if (valsize==0)
+                val = createStringObject(buf,strlen(buf));
+            else {
+                int buflen = strlen(buf);
+                val = createStringObject(NULL,valsize);
+                memcpy(val->ptr, buf, valsize<=buflen? valsize: buflen);
+            }
+            dbAdd(c->db,key,val);
+            signalModifiedKey(c,c->db,key);
+            decrRefCount(key);
+        }
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"digest") && c->argc == 2) {
+        /* DEBUG DIGEST (form without keys specified) */
+        unsigned char digest[20];
+        sds d = sdsempty();
+
+        computeDatasetDigest(digest);
+        for (int i = 0; i < 20; i++) d = sdscatprintf(d, "%02x",digest[i]);
+        addReplyStatus(c,d);
+        sdsfree(d);
+    } else if (!strcasecmp(c->argv[1]->ptr,"digest-value") && c->argc >= 2) {
+        /* DEBUG DIGEST-VALUE key key key ... key. */
+        addReplyArrayLen(c,c->argc-2);
+        for (int j = 2; j < c->argc; j++) {
+            unsigned char digest[20];
+            memset(digest,0,20); /* Start with a clean result */
+
+            /* We don't use lookupKey because a debug command should
+             * work on logically expired keys */
+            dictEntry *de;
+            robj *o = ((de = dictFind(c->db->dict,c->argv[j]->ptr)) == NULL) ? NULL : dictGetVal(de);
+            if (o) xorObjectDigest(c->db,c->argv[j],digest,o);
+
+            sds d = sdsempty();
+            for (int i = 0; i < 20; i++) d = sdscatprintf(d, "%02x",digest[i]);
+            addReplyStatus(c,d);
+            sdsfree(d);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"protocol") && c->argc == 3) {
+        /* DEBUG PROTOCOL [string|integer|double|bignum|null|array|set|map|
+         *                 attrib|push|verbatim|true|false] */
+        char *name = c->argv[2]->ptr;
+        if (!strcasecmp(name,"string")) {
+            addReplyBulkCString(c,"Hello World");
+        } else if (!strcasecmp(name,"integer")) {
+            addReplyLongLong(c,12345);
+        } else if (!strcasecmp(name,"double")) {
+            addReplyDouble(c,3.14159265359);
+        } else if (!strcasecmp(name,"bignum")) {
+            addReplyBigNum(c,"1234567999999999999999999999999999999",37);
+        } else if (!strcasecmp(name,"null")) {
+            addReplyNull(c);
+        } else if (!strcasecmp(name,"array")) {
+            addReplyArrayLen(c,3);
+            for (int j = 0; j < 3; j++) addReplyLongLong(c,j);
+        } else if (!strcasecmp(name,"set")) {
+            addReplySetLen(c,3);
+            for (int j = 0; j < 3; j++) addReplyLongLong(c,j);
+        } else if (!strcasecmp(name,"map")) {
+            addReplyMapLen(c,3);
+            for (int j = 0; j < 3; j++) {
+                addReplyLongLong(c,j);
+                addReplyBool(c, j == 1);
+            }
+        } else if (!strcasecmp(name,"attrib")) {
+            if (c->resp >= 3) {
+                addReplyAttributeLen(c,1);
+                addReplyBulkCString(c,"key-popularity");
+                addReplyArrayLen(c,2);
+                addReplyBulkCString(c,"key:123");
+                addReplyLongLong(c,90);
+            }
+            /* Attributes are not real replies, so a well formed reply should
+             * also have a normal reply type after the attribute. */
+            addReplyBulkCString(c,"Some real reply following the attribute");
+        } else if (!strcasecmp(name,"push")) {
+            addReplyPushLen(c,2);
+            addReplyBulkCString(c,"server-cpu-usage");
+            addReplyLongLong(c,42);
+            /* Push replies are not synchronous replies, so we emit also a
+             * normal reply in order for blocking clients just discarding the
+             * push reply, to actually consume the reply and continue. */
+            addReplyBulkCString(c,"Some real reply following the push reply");
+        } else if (!strcasecmp(name,"true")) {
+            addReplyBool(c,1);
+        } else if (!strcasecmp(name,"false")) {
+            addReplyBool(c,0);
+        } else if (!strcasecmp(name,"verbatim")) {
+            addReplyVerbatim(c,"This is a verbatim\nstring",25,"txt");
+        } else {
+            addReplyError(c,"Wrong protocol type name. Please use one of the following: string|integer|double|bignum|null|array|set|map|attrib|push|verbatim|true|false");
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"sleep") && c->argc == 3) {
+        double dtime = strtod(c->argv[2]->ptr,NULL);
+        long long utime = dtime*1000000;
+        struct timespec tv;
+
+        tv.tv_sec = utime / 1000000;
+        tv.tv_nsec = (utime % 1000000) * 1000;
+        nanosleep(&tv, NULL);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"set-active-expire") &&
+               c->argc == 3)
+    {
+        server.active_expire_enabled = atoi(c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"set-skip-checksum-validation") &&
+               c->argc == 3)
+    {
+        server.skip_checksum_validation = atoi(c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"aof-flush-sleep") &&
+               c->argc == 3)
+    {
+        server.aof_flush_sleep = atoi(c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"lua-always-replicate-commands") &&
+               c->argc == 3)
+    {
+        server.lua_always_replicate_commands = atoi(c->argv[2]->ptr);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"error") && c->argc == 3) {
+        sds errstr = sdsnewlen("-",1);
+
+        errstr = sdscatsds(errstr,c->argv[2]->ptr);
+        errstr = sdsmapchars(errstr,"\n\r","  ",2); /* no newlines in errors. */
+        errstr = sdscatlen(errstr,"\r\n",2);
+        addReplySds(c,errstr);
+    } else if (!strcasecmp(c->argv[1]->ptr,"structsize") && c->argc == 2) {
+        sds sizes = sdsempty();
+        sizes = sdscatprintf(sizes,"bits:%d ",(sizeof(void*) == 8)?64:32);
+        sizes = sdscatprintf(sizes,"robj:%d ",(int)sizeof(robj));
+        sizes = sdscatprintf(sizes,"dictentry:%d ",(int)sizeof(dictEntry));
+        sizes = sdscatprintf(sizes,"sdshdr5:%d ",(int)sizeof(struct sdshdr5));
+        sizes = sdscatprintf(sizes,"sdshdr8:%d ",(int)sizeof(struct sdshdr8));
+        sizes = sdscatprintf(sizes,"sdshdr16:%d ",(int)sizeof(struct sdshdr16));
+        sizes = sdscatprintf(sizes,"sdshdr32:%d ",(int)sizeof(struct sdshdr32));
+        sizes = sdscatprintf(sizes,"sdshdr64:%d ",(int)sizeof(struct sdshdr64));
+        addReplyBulkSds(c,sizes);
+    } else if (!strcasecmp(c->argv[1]->ptr,"htstats") && c->argc == 3) {
+        long dbid;
+        sds stats = sdsempty();
+        char buf[4096];
+
+        if (getLongFromObjectOrReply(c, c->argv[2], &dbid, NULL) != C_OK) {
+            sdsfree(stats);
+            return;
+        }
+        if (dbid < 0 || dbid >= server.dbnum) {
+            sdsfree(stats);
+            addReplyError(c,"Out of range database");
+            return;
+        }
+
+        stats = sdscatprintf(stats,"[Dictionary HT]\n");
+        dictGetStats(buf,sizeof(buf),server.db[dbid].dict);
+        stats = sdscat(stats,buf);
+
+        stats = sdscatprintf(stats,"[Expires HT]\n");
+        dictGetStats(buf,sizeof(buf),server.db[dbid].expires);
+        stats = sdscat(stats,buf);
+
+        addReplyVerbatim(c,stats,sdslen(stats),"txt");
+        sdsfree(stats);
+    } else if (!strcasecmp(c->argv[1]->ptr,"htstats-key") && c->argc == 3) {
+        robj *o;
+        dict *ht = NULL;
+
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.nokeyerr))
+                == NULL) return;
+
+        /* Get the hash table reference from the object, if possible. */
+        switch (o->encoding) {
+        case OBJ_ENCODING_SKIPLIST:
+            {
+                zset *zs = o->ptr;
+                ht = zs->dict;
+            }
+            break;
+        case OBJ_ENCODING_HT:
+            ht = o->ptr;
+            break;
+        }
+
+        if (ht == NULL) {
+            addReplyError(c,"The value stored at the specified key is not "
+                            "represented using an hash table");
+        } else {
+            char buf[4096];
+            dictGetStats(buf,sizeof(buf),ht);
+            addReplyVerbatim(c,buf,strlen(buf),"txt");
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"change-repl-id") && c->argc == 2) {
+        serverLog(LL_WARNING,"Changing replication IDs after receiving DEBUG change-repl-id");
+        changeReplicationId();
+        clearReplicationId2();
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"stringmatch-test") && c->argc == 2)
+    {
+        stringmatchlen_fuzz_test();
+        addReplyStatus(c,"Apparently Redis did not crash: test passed");
+    } else if (!strcasecmp(c->argv[1]->ptr,"config-rewrite-force-all") && c->argc == 2)
+    {
+        if (rewriteConfig(server.configfile, 1) == -1)
+            addReplyError(c, "CONFIG-REWRITE-FORCE-ALL failed");
+        else
+            addReply(c, shared.ok);
+#ifdef USE_JEMALLOC
+    } else if(!strcasecmp(c->argv[1]->ptr,"mallctl") && c->argc >= 3) {
+        mallctl_int(c, c->argv+2, c->argc-2);
+        return;
+    } else if(!strcasecmp(c->argv[1]->ptr,"mallctl-str") && c->argc >= 3) {
+        mallctl_string(c, c->argv+2, c->argc-2);
+        return;
+#endif
+    } else {
+        addReplySubcommandSyntaxError(c);
+        return;
+    }
+}
+
+/* =========================== Crash handling  ============================== */
+
+void _serverAssert(const char *estr, const char *file, int line) {
+    bugReportStart();
+    serverLog(LL_WARNING,"=== ASSERTION FAILED ===");
+    serverLog(LL_WARNING,"==> %s:%d '%s' is not true",file,line,estr);
+
+    if (server.crashlog_enabled) {
+#ifdef HAVE_BACKTRACE
+        logStackTrace(NULL, 1);
+#endif
+        printCrashReport();
+    }
+
+    // remove the signal handler so on abort() we will output the crash report.
+    removeSignalHandlers();
+    bugReportEnd(0, 0);
+}
+
+void _serverAssertPrintClientInfo(const client *c) {
+    int j;
+    char conninfo[CONN_INFO_LEN];
+
+    bugReportStart();
+    serverLog(LL_WARNING,"=== ASSERTION FAILED CLIENT CONTEXT ===");
+    serverLog(LL_WARNING,"client->flags = %llu", (unsigned long long) c->flags);
+    serverLog(LL_WARNING,"client->conn = %s", connGetInfo(c->conn, conninfo, sizeof(conninfo)));
+    serverLog(LL_WARNING,"client->argc = %d", c->argc);
+    for (j=0; j < c->argc; j++) {
+        char buf[128];
+        char *arg;
+
+        if (c->argv[j]->type == OBJ_STRING && sdsEncodedObject(c->argv[j])) {
+            arg = (char*) c->argv[j]->ptr;
+        } else {
+            snprintf(buf,sizeof(buf),"Object type: %u, encoding: %u",
+                c->argv[j]->type, c->argv[j]->encoding);
+            arg = buf;
+        }
+        serverLog(LL_WARNING,"client->argv[%d] = \"%s\" (refcount: %d)",
+            j, arg, c->argv[j]->refcount);
+    }
+}
+
+void serverLogObjectDebugInfo(const robj *o) {
+    serverLog(LL_WARNING,"Object type: %d", o->type);
+    serverLog(LL_WARNING,"Object encoding: %d", o->encoding);
+    serverLog(LL_WARNING,"Object refcount: %d", o->refcount);
+#if UNSAFE_CRASH_REPORT
+    /* This code is now disabled. o->ptr may be unreliable to print. in some
+     * cases a ziplist could have already been freed by realloc, but not yet
+     * updated to o->ptr. in other cases the call to ziplistLen may need to
+     * iterate on all the items in the list (and possibly crash again).
+     * For some cases it may be ok to crash here again, but these could cause
+     * invalid memory access which will bother valgrind and also possibly cause
+     * random memory portion to be "leaked" into the logfile. */
+    if (o->type == OBJ_STRING && sdsEncodedObject(o)) {
+        serverLog(LL_WARNING,"Object raw string len: %zu", sdslen(o->ptr));
+        if (sdslen(o->ptr) < 4096) {
+            sds repr = sdscatrepr(sdsempty(),o->ptr,sdslen(o->ptr));
+            serverLog(LL_WARNING,"Object raw string content: %s", repr);
+            sdsfree(repr);
+        }
+    } else if (o->type == OBJ_LIST) {
+        serverLog(LL_WARNING,"List length: %d", (int) listTypeLength(o));
+    } else if (o->type == OBJ_SET) {
+        serverLog(LL_WARNING,"Set size: %d", (int) setTypeSize(o));
+    } else if (o->type == OBJ_HASH) {
+        serverLog(LL_WARNING,"Hash size: %d", (int) hashTypeLength(o));
+    } else if (o->type == OBJ_ZSET) {
+        serverLog(LL_WARNING,"Sorted set size: %d", (int) zsetLength(o));
+        if (o->encoding == OBJ_ENCODING_SKIPLIST)
+            serverLog(LL_WARNING,"Skiplist level: %d", (int) ((const zset*)o->ptr)->zsl->level);
+    } else if (o->type == OBJ_STREAM) {
+        serverLog(LL_WARNING,"Stream size: %d", (int) streamLength(o));
+    }
+#endif
+}
+
+void _serverAssertPrintObject(const robj *o) {
+    bugReportStart();
+    serverLog(LL_WARNING,"=== ASSERTION FAILED OBJECT CONTEXT ===");
+    serverLogObjectDebugInfo(o);
+}
+
+void _serverAssertWithInfo(const client *c, const robj *o, const char *estr, const char *file, int line) {
+    if (c) _serverAssertPrintClientInfo(c);
+    if (o) _serverAssertPrintObject(o);
+    _serverAssert(estr,file,line);
+}
+
+void _serverPanic(const char *file, int line, const char *msg, ...) {
+    va_list ap;
+    va_start(ap,msg);
+    char fmtmsg[256];
+    vsnprintf(fmtmsg,sizeof(fmtmsg),msg,ap);
+    va_end(ap);
+
+    bugReportStart();
+    serverLog(LL_WARNING,"------------------------------------------------");
+    serverLog(LL_WARNING,"!!! Software Failure. Press left mouse button to continue");
+    serverLog(LL_WARNING,"Guru Meditation: %s #%s:%d",fmtmsg,file,line);
+
+    if (server.crashlog_enabled) {
+#ifdef HAVE_BACKTRACE
+        logStackTrace(NULL, 1);
+#endif
+        printCrashReport();
+    }
+
+    // remove the signal handler so on abort() we will output the crash report.
+    removeSignalHandlers();
+    bugReportEnd(0, 0);
+}
+
+void bugReportStart(void) {
+    pthread_mutex_lock(&bug_report_start_mutex);
+    if (bug_report_start == 0) {
+        serverLogRaw(LL_WARNING|LL_RAW,
+        "\n\n=== REDIS BUG REPORT START: Cut & paste starting from here ===\n");
+        bug_report_start = 1;
+    }
+    pthread_mutex_unlock(&bug_report_start_mutex);
+}
+
+#ifdef HAVE_BACKTRACE
+static void *getMcontextEip(ucontext_t *uc) {
+#if defined(__APPLE__) && !defined(MAC_OS_X_VERSION_10_6)
+    /* OSX < 10.6 */
+    #if defined(__x86_64__)
+    return (void*) uc->uc_mcontext->__ss.__rip;
+    #elif defined(__i386__)
+    return (void*) uc->uc_mcontext->__ss.__eip;
+    #else
+    return (void*) uc->uc_mcontext->__ss.__srr0;
+    #endif
+#elif defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)
+    /* OSX >= 10.6 */
+    #if defined(_STRUCT_X86_THREAD_STATE64) && !defined(__i386__)
+    return (void*) uc->uc_mcontext->__ss.__rip;
+    #elif defined(__i386__)
+    return (void*) uc->uc_mcontext->__ss.__eip;
+    #else
+    /* OSX ARM64 */
+    return (void*) arm_thread_state64_get_pc(uc->uc_mcontext->__ss);
+    #endif
+#elif defined(__linux__)
+    /* Linux */
+    #if defined(__i386__) || ((defined(__X86_64__) || defined(__x86_64__)) && defined(__ILP32__))
+    return (void*) uc->uc_mcontext.gregs[14]; /* Linux 32 */
+    #elif defined(__X86_64__) || defined(__x86_64__)
+    return (void*) uc->uc_mcontext.gregs[16]; /* Linux 64 */
+    #elif defined(__ia64__) /* Linux IA64 */
+    return (void*) uc->uc_mcontext.sc_ip;
+    #elif defined(__arm__) /* Linux ARM */
+    return (void*) uc->uc_mcontext.arm_pc;
+    #elif defined(__aarch64__) /* Linux AArch64 */
+    return (void*) uc->uc_mcontext.pc;
+    #endif
+#elif defined(__FreeBSD__)
+    /* FreeBSD */
+    #if defined(__i386__)
+    return (void*) uc->uc_mcontext.mc_eip;
+    #elif defined(__x86_64__)
+    return (void*) uc->uc_mcontext.mc_rip;
+    #endif
+#elif defined(__OpenBSD__)
+    /* OpenBSD */
+    #if defined(__i386__)
+    return (void*) uc->sc_eip;
+    #elif defined(__x86_64__)
+    return (void*) uc->sc_rip;
+    #endif
+#elif defined(__NetBSD__)
+    #if defined(__i386__)
+    return (void*) uc->uc_mcontext.__gregs[_REG_EIP];
+    #elif defined(__x86_64__)
+    return (void*) uc->uc_mcontext.__gregs[_REG_RIP];
+    #endif
+#elif defined(__DragonFly__)
+    return (void*) uc->uc_mcontext.mc_rip;
+#else
+    return NULL;
+#endif
+}
+
+void logStackContent(void **sp) {
+    int i;
+    for (i = 15; i >= 0; i--) {
+        unsigned long addr = (unsigned long) sp+i;
+        unsigned long val = (unsigned long) sp[i];
+
+        if (sizeof(long) == 4)
+            serverLog(LL_WARNING, "(%08lx) -> %08lx", addr, val);
+        else
+            serverLog(LL_WARNING, "(%016lx) -> %016lx", addr, val);
+    }
+}
+
+/* Log dump of processor registers */
+void logRegisters(ucontext_t *uc) {
+    serverLog(LL_WARNING|LL_RAW, "\n------ REGISTERS ------\n");
+
+/* OSX */
+#if defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)
+  /* OSX AMD64 */
+    #if defined(_STRUCT_X86_THREAD_STATE64) && !defined(__i386__)
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCS :%016lx FS:%016lx  GS:%016lx",
+        (unsigned long) uc->uc_mcontext->__ss.__rax,
+        (unsigned long) uc->uc_mcontext->__ss.__rbx,
+        (unsigned long) uc->uc_mcontext->__ss.__rcx,
+        (unsigned long) uc->uc_mcontext->__ss.__rdx,
+        (unsigned long) uc->uc_mcontext->__ss.__rdi,
+        (unsigned long) uc->uc_mcontext->__ss.__rsi,
+        (unsigned long) uc->uc_mcontext->__ss.__rbp,
+        (unsigned long) uc->uc_mcontext->__ss.__rsp,
+        (unsigned long) uc->uc_mcontext->__ss.__r8,
+        (unsigned long) uc->uc_mcontext->__ss.__r9,
+        (unsigned long) uc->uc_mcontext->__ss.__r10,
+        (unsigned long) uc->uc_mcontext->__ss.__r11,
+        (unsigned long) uc->uc_mcontext->__ss.__r12,
+        (unsigned long) uc->uc_mcontext->__ss.__r13,
+        (unsigned long) uc->uc_mcontext->__ss.__r14,
+        (unsigned long) uc->uc_mcontext->__ss.__r15,
+        (unsigned long) uc->uc_mcontext->__ss.__rip,
+        (unsigned long) uc->uc_mcontext->__ss.__rflags,
+        (unsigned long) uc->uc_mcontext->__ss.__cs,
+        (unsigned long) uc->uc_mcontext->__ss.__fs,
+        (unsigned long) uc->uc_mcontext->__ss.__gs
+    );
+    logStackContent((void**)uc->uc_mcontext->__ss.__rsp);
+    #elif defined(__i386__)
+    /* OSX x86 */
+    serverLog(LL_WARNING,
+    "\n"
+    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
+    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
+    "SS:%08lx  EFL:%08lx EIP:%08lx CS :%08lx\n"
+    "DS:%08lx  ES:%08lx  FS :%08lx GS :%08lx",
+        (unsigned long) uc->uc_mcontext->__ss.__eax,
+        (unsigned long) uc->uc_mcontext->__ss.__ebx,
+        (unsigned long) uc->uc_mcontext->__ss.__ecx,
+        (unsigned long) uc->uc_mcontext->__ss.__edx,
+        (unsigned long) uc->uc_mcontext->__ss.__edi,
+        (unsigned long) uc->uc_mcontext->__ss.__esi,
+        (unsigned long) uc->uc_mcontext->__ss.__ebp,
+        (unsigned long) uc->uc_mcontext->__ss.__esp,
+        (unsigned long) uc->uc_mcontext->__ss.__ss,
+        (unsigned long) uc->uc_mcontext->__ss.__eflags,
+        (unsigned long) uc->uc_mcontext->__ss.__eip,
+        (unsigned long) uc->uc_mcontext->__ss.__cs,
+        (unsigned long) uc->uc_mcontext->__ss.__ds,
+        (unsigned long) uc->uc_mcontext->__ss.__es,
+        (unsigned long) uc->uc_mcontext->__ss.__fs,
+        (unsigned long) uc->uc_mcontext->__ss.__gs
+    );
+    logStackContent((void**)uc->uc_mcontext->__ss.__esp);
+    #else
+    /* OSX ARM64 */
+    serverLog(LL_WARNING,
+    "\n"
+    "x0:%016lx x1:%016lx x2:%016lx x3:%016lx\n"
+    "x4:%016lx x5:%016lx x6:%016lx x7:%016lx\n"
+    "x8:%016lx x9:%016lx x10:%016lx x11:%016lx\n"
+    "x12:%016lx x13:%016lx x14:%016lx x15:%016lx\n"
+    "x16:%016lx x17:%016lx x18:%016lx x19:%016lx\n"
+    "x20:%016lx x21:%016lx x22:%016lx x23:%016lx\n"
+    "x24:%016lx x25:%016lx x26:%016lx x27:%016lx\n"
+    "x28:%016lx fp:%016lx lr:%016lx\n"
+    "sp:%016lx pc:%016lx cpsr:%08lx\n",
+        (unsigned long) uc->uc_mcontext->__ss.__x[0],
+        (unsigned long) uc->uc_mcontext->__ss.__x[1],
+        (unsigned long) uc->uc_mcontext->__ss.__x[2],
+        (unsigned long) uc->uc_mcontext->__ss.__x[3],
+        (unsigned long) uc->uc_mcontext->__ss.__x[4],
+        (unsigned long) uc->uc_mcontext->__ss.__x[5],
+        (unsigned long) uc->uc_mcontext->__ss.__x[6],
+        (unsigned long) uc->uc_mcontext->__ss.__x[7],
+        (unsigned long) uc->uc_mcontext->__ss.__x[8],
+        (unsigned long) uc->uc_mcontext->__ss.__x[9],
+        (unsigned long) uc->uc_mcontext->__ss.__x[10],
+        (unsigned long) uc->uc_mcontext->__ss.__x[11],
+        (unsigned long) uc->uc_mcontext->__ss.__x[12],
+        (unsigned long) uc->uc_mcontext->__ss.__x[13],
+        (unsigned long) uc->uc_mcontext->__ss.__x[14],
+        (unsigned long) uc->uc_mcontext->__ss.__x[15],
+        (unsigned long) uc->uc_mcontext->__ss.__x[16],
+        (unsigned long) uc->uc_mcontext->__ss.__x[17],
+        (unsigned long) uc->uc_mcontext->__ss.__x[18],
+        (unsigned long) uc->uc_mcontext->__ss.__x[19],
+        (unsigned long) uc->uc_mcontext->__ss.__x[20],
+        (unsigned long) uc->uc_mcontext->__ss.__x[21],
+        (unsigned long) uc->uc_mcontext->__ss.__x[22],
+        (unsigned long) uc->uc_mcontext->__ss.__x[23],
+        (unsigned long) uc->uc_mcontext->__ss.__x[24],
+        (unsigned long) uc->uc_mcontext->__ss.__x[25],
+        (unsigned long) uc->uc_mcontext->__ss.__x[26],
+        (unsigned long) uc->uc_mcontext->__ss.__x[27],
+        (unsigned long) uc->uc_mcontext->__ss.__x[28],
+        (unsigned long) arm_thread_state64_get_fp(uc->uc_mcontext->__ss),
+        (unsigned long) arm_thread_state64_get_lr(uc->uc_mcontext->__ss),
+        (unsigned long) arm_thread_state64_get_sp(uc->uc_mcontext->__ss),
+        (unsigned long) arm_thread_state64_get_pc(uc->uc_mcontext->__ss),
+        (unsigned long) uc->uc_mcontext->__ss.__cpsr
+    );
+    logStackContent((void**) arm_thread_state64_get_sp(uc->uc_mcontext->__ss));
+    #endif
+/* Linux */
+#elif defined(__linux__)
+    /* Linux x86 */
+    #if defined(__i386__) || ((defined(__X86_64__) || defined(__x86_64__)) && defined(__ILP32__))
+    serverLog(LL_WARNING,
+    "\n"
+    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
+    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
+    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
+    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
+        (unsigned long) uc->uc_mcontext.gregs[11],
+        (unsigned long) uc->uc_mcontext.gregs[8],
+        (unsigned long) uc->uc_mcontext.gregs[10],
+        (unsigned long) uc->uc_mcontext.gregs[9],
+        (unsigned long) uc->uc_mcontext.gregs[4],
+        (unsigned long) uc->uc_mcontext.gregs[5],
+        (unsigned long) uc->uc_mcontext.gregs[6],
+        (unsigned long) uc->uc_mcontext.gregs[7],
+        (unsigned long) uc->uc_mcontext.gregs[18],
+        (unsigned long) uc->uc_mcontext.gregs[17],
+        (unsigned long) uc->uc_mcontext.gregs[14],
+        (unsigned long) uc->uc_mcontext.gregs[15],
+        (unsigned long) uc->uc_mcontext.gregs[3],
+        (unsigned long) uc->uc_mcontext.gregs[2],
+        (unsigned long) uc->uc_mcontext.gregs[1],
+        (unsigned long) uc->uc_mcontext.gregs[0]
+    );
+    logStackContent((void**)uc->uc_mcontext.gregs[7]);
+    #elif defined(__X86_64__) || defined(__x86_64__)
+    /* Linux AMD64 */
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
+        (unsigned long) uc->uc_mcontext.gregs[13],
+        (unsigned long) uc->uc_mcontext.gregs[11],
+        (unsigned long) uc->uc_mcontext.gregs[14],
+        (unsigned long) uc->uc_mcontext.gregs[12],
+        (unsigned long) uc->uc_mcontext.gregs[8],
+        (unsigned long) uc->uc_mcontext.gregs[9],
+        (unsigned long) uc->uc_mcontext.gregs[10],
+        (unsigned long) uc->uc_mcontext.gregs[15],
+        (unsigned long) uc->uc_mcontext.gregs[0],
+        (unsigned long) uc->uc_mcontext.gregs[1],
+        (unsigned long) uc->uc_mcontext.gregs[2],
+        (unsigned long) uc->uc_mcontext.gregs[3],
+        (unsigned long) uc->uc_mcontext.gregs[4],
+        (unsigned long) uc->uc_mcontext.gregs[5],
+        (unsigned long) uc->uc_mcontext.gregs[6],
+        (unsigned long) uc->uc_mcontext.gregs[7],
+        (unsigned long) uc->uc_mcontext.gregs[16],
+        (unsigned long) uc->uc_mcontext.gregs[17],
+        (unsigned long) uc->uc_mcontext.gregs[18]
+    );
+    logStackContent((void**)uc->uc_mcontext.gregs[15]);
+    #elif defined(__aarch64__) /* Linux AArch64 */
+    serverLog(LL_WARNING,
+	      "\n"
+	      "X18:%016lx X19:%016lx\nX20:%016lx X21:%016lx\n"
+	      "X22:%016lx X23:%016lx\nX24:%016lx X25:%016lx\n"
+	      "X26:%016lx X27:%016lx\nX28:%016lx X29:%016lx\n"
+	      "X30:%016lx\n"
+	      "pc:%016lx sp:%016lx\npstate:%016lx fault_address:%016lx\n",
+	      (unsigned long) uc->uc_mcontext.regs[18],
+	      (unsigned long) uc->uc_mcontext.regs[19],
+	      (unsigned long) uc->uc_mcontext.regs[20],
+	      (unsigned long) uc->uc_mcontext.regs[21],
+	      (unsigned long) uc->uc_mcontext.regs[22],
+	      (unsigned long) uc->uc_mcontext.regs[23],
+	      (unsigned long) uc->uc_mcontext.regs[24],
+	      (unsigned long) uc->uc_mcontext.regs[25],
+	      (unsigned long) uc->uc_mcontext.regs[26],
+	      (unsigned long) uc->uc_mcontext.regs[27],
+	      (unsigned long) uc->uc_mcontext.regs[28],
+	      (unsigned long) uc->uc_mcontext.regs[29],
+	      (unsigned long) uc->uc_mcontext.regs[30],
+	      (unsigned long) uc->uc_mcontext.pc,
+	      (unsigned long) uc->uc_mcontext.sp,
+	      (unsigned long) uc->uc_mcontext.pstate,
+	      (unsigned long) uc->uc_mcontext.fault_address
+		      );
+	      logStackContent((void**)uc->uc_mcontext.sp);
+    #elif defined(__arm__) /* Linux ARM */
+    serverLog(LL_WARNING,
+	      "\n"
+	      "R10:%016lx R9 :%016lx\nR8 :%016lx R7 :%016lx\n"
+	      "R6 :%016lx R5 :%016lx\nR4 :%016lx R3 :%016lx\n"
+	      "R2 :%016lx R1 :%016lx\nR0 :%016lx EC :%016lx\n"
+	      "fp: %016lx ip:%016lx\n"
+	      "pc:%016lx sp:%016lx\ncpsr:%016lx fault_address:%016lx\n",
+	      (unsigned long) uc->uc_mcontext.arm_r10,
+	      (unsigned long) uc->uc_mcontext.arm_r9,
+	      (unsigned long) uc->uc_mcontext.arm_r8,
+	      (unsigned long) uc->uc_mcontext.arm_r7,
+	      (unsigned long) uc->uc_mcontext.arm_r6,
+	      (unsigned long) uc->uc_mcontext.arm_r5,
+	      (unsigned long) uc->uc_mcontext.arm_r4,
+	      (unsigned long) uc->uc_mcontext.arm_r3,
+	      (unsigned long) uc->uc_mcontext.arm_r2,
+	      (unsigned long) uc->uc_mcontext.arm_r1,
+	      (unsigned long) uc->uc_mcontext.arm_r0,
+	      (unsigned long) uc->uc_mcontext.error_code,
+	      (unsigned long) uc->uc_mcontext.arm_fp,
+	      (unsigned long) uc->uc_mcontext.arm_ip,
+	      (unsigned long) uc->uc_mcontext.arm_pc,
+	      (unsigned long) uc->uc_mcontext.arm_sp,
+	      (unsigned long) uc->uc_mcontext.arm_cpsr,
+	      (unsigned long) uc->uc_mcontext.fault_address
+		      );
+	      logStackContent((void**)uc->uc_mcontext.arm_sp);
+    #endif
+#elif defined(__FreeBSD__)
+    #if defined(__x86_64__)
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
+        (unsigned long) uc->uc_mcontext.mc_rax,
+        (unsigned long) uc->uc_mcontext.mc_rbx,
+        (unsigned long) uc->uc_mcontext.mc_rcx,
+        (unsigned long) uc->uc_mcontext.mc_rdx,
+        (unsigned long) uc->uc_mcontext.mc_rdi,
+        (unsigned long) uc->uc_mcontext.mc_rsi,
+        (unsigned long) uc->uc_mcontext.mc_rbp,
+        (unsigned long) uc->uc_mcontext.mc_rsp,
+        (unsigned long) uc->uc_mcontext.mc_r8,
+        (unsigned long) uc->uc_mcontext.mc_r9,
+        (unsigned long) uc->uc_mcontext.mc_r10,
+        (unsigned long) uc->uc_mcontext.mc_r11,
+        (unsigned long) uc->uc_mcontext.mc_r12,
+        (unsigned long) uc->uc_mcontext.mc_r13,
+        (unsigned long) uc->uc_mcontext.mc_r14,
+        (unsigned long) uc->uc_mcontext.mc_r15,
+        (unsigned long) uc->uc_mcontext.mc_rip,
+        (unsigned long) uc->uc_mcontext.mc_rflags,
+        (unsigned long) uc->uc_mcontext.mc_cs
+    );
+    logStackContent((void**)uc->uc_mcontext.mc_rsp);
+    #elif defined(__i386__)
+    serverLog(LL_WARNING,
+    "\n"
+    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
+    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
+    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
+    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
+        (unsigned long) uc->uc_mcontext.mc_eax,
+        (unsigned long) uc->uc_mcontext.mc_ebx,
+        (unsigned long) uc->uc_mcontext.mc_ebx,
+        (unsigned long) uc->uc_mcontext.mc_edx,
+        (unsigned long) uc->uc_mcontext.mc_edi,
+        (unsigned long) uc->uc_mcontext.mc_esi,
+        (unsigned long) uc->uc_mcontext.mc_ebp,
+        (unsigned long) uc->uc_mcontext.mc_esp,
+        (unsigned long) uc->uc_mcontext.mc_ss,
+        (unsigned long) uc->uc_mcontext.mc_eflags,
+        (unsigned long) uc->uc_mcontext.mc_eip,
+        (unsigned long) uc->uc_mcontext.mc_cs,
+        (unsigned long) uc->uc_mcontext.mc_es,
+        (unsigned long) uc->uc_mcontext.mc_fs,
+        (unsigned long) uc->uc_mcontext.mc_gs
+    );
+    logStackContent((void**)uc->uc_mcontext.mc_esp);
+    #endif
+#elif defined(__OpenBSD__)
+    #if defined(__x86_64__)
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
+        (unsigned long) uc->sc_rax,
+        (unsigned long) uc->sc_rbx,
+        (unsigned long) uc->sc_rcx,
+        (unsigned long) uc->sc_rdx,
+        (unsigned long) uc->sc_rdi,
+        (unsigned long) uc->sc_rsi,
+        (unsigned long) uc->sc_rbp,
+        (unsigned long) uc->sc_rsp,
+        (unsigned long) uc->sc_r8,
+        (unsigned long) uc->sc_r9,
+        (unsigned long) uc->sc_r10,
+        (unsigned long) uc->sc_r11,
+        (unsigned long) uc->sc_r12,
+        (unsigned long) uc->sc_r13,
+        (unsigned long) uc->sc_r14,
+        (unsigned long) uc->sc_r15,
+        (unsigned long) uc->sc_rip,
+        (unsigned long) uc->sc_rflags,
+        (unsigned long) uc->sc_cs
+    );
+    logStackContent((void**)uc->sc_rsp);
+    #elif defined(__i386__)
+    serverLog(LL_WARNING,
+    "\n"
+    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
+    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
+    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
+    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
+        (unsigned long) uc->sc_eax,
+        (unsigned long) uc->sc_ebx,
+        (unsigned long) uc->sc_ebx,
+        (unsigned long) uc->sc_edx,
+        (unsigned long) uc->sc_edi,
+        (unsigned long) uc->sc_esi,
+        (unsigned long) uc->sc_ebp,
+        (unsigned long) uc->sc_esp,
+        (unsigned long) uc->sc_ss,
+        (unsigned long) uc->sc_eflags,
+        (unsigned long) uc->sc_eip,
+        (unsigned long) uc->sc_cs,
+        (unsigned long) uc->sc_es,
+        (unsigned long) uc->sc_fs,
+        (unsigned long) uc->sc_gs
+    );
+    logStackContent((void**)uc->sc_esp);
+    #endif
+#elif defined(__NetBSD__)
+    #if defined(__x86_64__)
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RAX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RBX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RCX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RDX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RDI],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RSI],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RBP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RSP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R8],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R9],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R10],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R11],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R12],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R13],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R14],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_R15],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RIP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_RFLAGS],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_CS]
+    );
+    logStackContent((void**)uc->uc_mcontext.__gregs[_REG_RSP]);
+    #elif defined(__i386__)
+    serverLog(LL_WARNING,
+    "\n"
+    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
+    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
+    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
+    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EAX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EBX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EDX],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EDI],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_ESI],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EBP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_ESP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_SS],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EFLAGS],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_EIP],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_CS],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_ES],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_FS],
+        (unsigned long) uc->uc_mcontext.__gregs[_REG_GS]
+    );
+    #endif
+#elif defined(__DragonFly__)
+    serverLog(LL_WARNING,
+    "\n"
+    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
+    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
+    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
+    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
+    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
+        (unsigned long) uc->uc_mcontext.mc_rax,
+        (unsigned long) uc->uc_mcontext.mc_rbx,
+        (unsigned long) uc->uc_mcontext.mc_rcx,
+        (unsigned long) uc->uc_mcontext.mc_rdx,
+        (unsigned long) uc->uc_mcontext.mc_rdi,
+        (unsigned long) uc->uc_mcontext.mc_rsi,
+        (unsigned long) uc->uc_mcontext.mc_rbp,
+        (unsigned long) uc->uc_mcontext.mc_rsp,
+        (unsigned long) uc->uc_mcontext.mc_r8,
+        (unsigned long) uc->uc_mcontext.mc_r9,
+        (unsigned long) uc->uc_mcontext.mc_r10,
+        (unsigned long) uc->uc_mcontext.mc_r11,
+        (unsigned long) uc->uc_mcontext.mc_r12,
+        (unsigned long) uc->uc_mcontext.mc_r13,
+        (unsigned long) uc->uc_mcontext.mc_r14,
+        (unsigned long) uc->uc_mcontext.mc_r15,
+        (unsigned long) uc->uc_mcontext.mc_rip,
+        (unsigned long) uc->uc_mcontext.mc_rflags,
+        (unsigned long) uc->uc_mcontext.mc_cs
+    );
+    logStackContent((void**)uc->uc_mcontext.mc_rsp);
+#else
+    serverLog(LL_WARNING,
+        "  Dumping of registers not supported for this OS/arch");
+#endif
+}
+
+#endif /* HAVE_BACKTRACE */
+
+/* Return a file descriptor to write directly to the Redis log with the
+ * write(2) syscall, that can be used in critical sections of the code
+ * where the rest of Redis can't be trusted (for example during the memory
+ * test) or when an API call requires a raw fd.
+ *
+ * Close it with closeDirectLogFiledes(). */
+int openDirectLogFiledes(void) {
+    int log_to_stdout = server.logfile[0] == '\0';
+    int fd = log_to_stdout ?
+        STDOUT_FILENO :
+        open(server.logfile, O_APPEND|O_CREAT|O_WRONLY, 0644);
+    return fd;
+}
+
+/* Used to close what closeDirectLogFiledes() returns. */
+void closeDirectLogFiledes(int fd) {
+    int log_to_stdout = server.logfile[0] == '\0';
+    if (!log_to_stdout) close(fd);
+}
+
+#ifdef HAVE_BACKTRACE
+
+/* Logs the stack trace using the backtrace() call. This function is designed
+ * to be called from signal handlers safely.
+ * The eip argument is optional (can take NULL).
+ * The uplevel argument indicates how many of the calling functions to skip.
+ */
+void logStackTrace(void *eip, int uplevel) {
+    void *trace[100];
+    int trace_size = 0, fd = openDirectLogFiledes();
+    char *msg;
+    uplevel++; /* skip this function */
+
+    if (fd == -1) return; /* If we can't log there is anything to do. */
+
+    /* Get the stack trace first! */
+    trace_size = backtrace(trace, 100);
+
+    msg = "\n------ STACK TRACE ------\n";
+    if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
+
+    if (eip) {
+        /* Write EIP to the log file*/
+        msg = "EIP:\n";
+        if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
+        backtrace_symbols_fd(&eip, 1, fd);
+    }
+
+    /* Write symbols to log file */
+    msg = "\nBacktrace:\n";
+    if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
+    backtrace_symbols_fd(trace+uplevel, trace_size-uplevel, fd);
+
+    /* Cleanup */
+    closeDirectLogFiledes(fd);
+}
+
+#endif /* HAVE_BACKTRACE */
+
+/* Log global server info */
+void logServerInfo(void) {
+    sds infostring, clients;
+    serverLogRaw(LL_WARNING|LL_RAW, "\n------ INFO OUTPUT ------\n");
+    infostring = genRedisInfoString("all");
+    serverLogRaw(LL_WARNING|LL_RAW, infostring);
+    serverLogRaw(LL_WARNING|LL_RAW, "\n------ CLIENT LIST OUTPUT ------\n");
+    clients = getAllClientsInfoString(-1);
+    serverLogRaw(LL_WARNING|LL_RAW, clients);
+    sdsfree(infostring);
+    sdsfree(clients);
+}
+
+/* Log modules info. Something we wanna do last since we fear it may crash. */
+void logModulesInfo(void) {
+    serverLogRaw(LL_WARNING|LL_RAW, "\n------ MODULES INFO OUTPUT ------\n");
+    sds infostring = modulesCollectInfo(sdsempty(), NULL, 1, 0);
+    serverLogRaw(LL_WARNING|LL_RAW, infostring);
+    sdsfree(infostring);
+}
+
+/* Log information about the "current" client, that is, the client that is
+ * currently being served by Redis. May be NULL if Redis is not serving a
+ * client right now. */
+void logCurrentClient(void) {
+    if (server.current_client == NULL) return;
+
+    client *cc = server.current_client;
+    sds client;
+    int j;
+
+    serverLogRaw(LL_WARNING|LL_RAW, "\n------ CURRENT CLIENT INFO ------\n");
+    client = catClientInfoString(sdsempty(),cc);
+    serverLog(LL_WARNING|LL_RAW,"%s\n", client);
+    sdsfree(client);
+    for (j = 0; j < cc->argc; j++) {
+        robj *decoded;
+
+        decoded = getDecodedObject(cc->argv[j]);
+        serverLog(LL_WARNING|LL_RAW,"argv[%d]: '%s'\n", j,
+            (char*)decoded->ptr);
+        decrRefCount(decoded);
+    }
+    /* Check if the first argument, usually a key, is found inside the
+     * selected DB, and if so print info about the associated object. */
+    if (cc->argc > 1) {
+        robj *val, *key;
+        dictEntry *de;
+
+        key = getDecodedObject(cc->argv[1]);
+        de = dictFind(cc->db->dict, key->ptr);
+        if (de) {
+            val = dictGetVal(de);
+            serverLog(LL_WARNING,"key '%s' found in DB containing the following object:", (char*)key->ptr);
+            serverLogObjectDebugInfo(val);
+        }
+        decrRefCount(key);
+    }
+}
+
+#if defined(HAVE_PROC_MAPS)
+
+#define MEMTEST_MAX_REGIONS 128
+
+/* A non destructive memory test executed during segfault. */
+int memtest_test_linux_anonymous_maps(void) {
+    FILE *fp;
+    char line[1024];
+    char logbuf[1024];
+    size_t start_addr, end_addr, size;
+    size_t start_vect[MEMTEST_MAX_REGIONS];
+    size_t size_vect[MEMTEST_MAX_REGIONS];
+    int regions = 0, j;
+
+    int fd = openDirectLogFiledes();
+    if (!fd) return 0;
+
+    fp = fopen("/proc/self/maps","r");
+    if (!fp) return 0;
+    while(fgets(line,sizeof(line),fp) != NULL) {
+        char *start, *end, *p = line;
+
+        start = p;
+        p = strchr(p,'-');
+        if (!p) continue;
+        *p++ = '\0';
+        end = p;
+        p = strchr(p,' ');
+        if (!p) continue;
+        *p++ = '\0';
+        if (strstr(p,"stack") ||
+            strstr(p,"vdso") ||
+            strstr(p,"vsyscall")) continue;
+        if (!strstr(p,"00:00")) continue;
+        if (!strstr(p,"rw")) continue;
+
+        start_addr = strtoul(start,NULL,16);
+        end_addr = strtoul(end,NULL,16);
+        size = end_addr-start_addr;
+
+        start_vect[regions] = start_addr;
+        size_vect[regions] = size;
+        snprintf(logbuf,sizeof(logbuf),
+            "*** Preparing to test memory region %lx (%lu bytes)\n",
+                (unsigned long) start_vect[regions],
+                (unsigned long) size_vect[regions]);
+        if (write(fd,logbuf,strlen(logbuf)) == -1) { /* Nothing to do. */ }
+        regions++;
+    }
+
+    int errors = 0;
+    for (j = 0; j < regions; j++) {
+        if (write(fd,".",1) == -1) { /* Nothing to do. */ }
+        errors += memtest_preserving_test((void*)start_vect[j],size_vect[j],1);
+        if (write(fd, errors ? "E" : "O",1) == -1) { /* Nothing to do. */ }
+    }
+    if (write(fd,"\n",1) == -1) { /* Nothing to do. */ }
+
+    /* NOTE: It is very important to close the file descriptor only now
+     * because closing it before may result into unmapping of some memory
+     * region that we are testing. */
+    fclose(fp);
+    closeDirectLogFiledes(fd);
+    return errors;
+}
+#endif /* HAVE_PROC_MAPS */
+
+static void killMainThread(void) {
+    int err;
+    if (pthread_self() != server.main_thread_id && pthread_cancel(server.main_thread_id) == 0) {
+        if ((err = pthread_join(server.main_thread_id,NULL)) != 0) {
+            serverLog(LL_WARNING, "main thread can not be joined: %s", strerror(err));
+        } else {
+            serverLog(LL_WARNING, "main thread terminated");
+        }
+    }
+}
+
+/* Kill the running threads (other than current) in an unclean way. This function
+ * should be used only when it's critical to stop the threads for some reason.
+ * Currently Redis does this only on crash (for instance on SIGSEGV) in order
+ * to perform a fast memory check without other threads messing with memory. */
+void killThreads(void) {
+    killMainThread();
+    bioKillThreads();
+    killIOThreads();
+}
+
+void doFastMemoryTest(void) {
+#if defined(HAVE_PROC_MAPS)
+    if (server.memcheck_enabled) {
+        /* Test memory */
+        serverLogRaw(LL_WARNING|LL_RAW, "\n------ FAST MEMORY TEST ------\n");
+        killThreads();
+        if (memtest_test_linux_anonymous_maps()) {
+            serverLogRaw(LL_WARNING|LL_RAW,
+                "!!! MEMORY ERROR DETECTED! Check your memory ASAP !!!\n");
+        } else {
+            serverLogRaw(LL_WARNING|LL_RAW,
+                "Fast memory test PASSED, however your memory can still be broken. Please run a memory test for several hours if possible.\n");
+        }
+    }
+#endif /* HAVE_PROC_MAPS */
+}
+
+/* Scans the (assumed) x86 code starting at addr, for a max of `len`
+ * bytes, searching for E8 (callq) opcodes, and dumping the symbols
+ * and the call offset if they appear to be valid. */
+void dumpX86Calls(void *addr, size_t len) {
+    size_t j;
+    unsigned char *p = addr;
+    Dl_info info;
+    /* Hash table to best-effort avoid printing the same symbol
+     * multiple times. */
+    unsigned long ht[256] = {0};
+
+    if (len < 5) return;
+    for (j = 0; j < len-4; j++) {
+        if (p[j] != 0xE8) continue; /* Not an E8 CALL opcode. */
+        unsigned long target = (unsigned long)addr+j+5;
+        target += *((int32_t*)(p+j+1));
+        if (dladdr((void*)target, &info) != 0 && info.dli_sname != NULL) {
+            if (ht[target&0xff] != target) {
+                printf("Function at 0x%lx is %s\n",target,info.dli_sname);
+                ht[target&0xff] = target;
+            }
+            j += 4; /* Skip the 32 bit immediate. */
+        }
+    }
+}
+
+void dumpCodeAroundEIP(void *eip) {
+    Dl_info info;
+    if (dladdr(eip, &info) != 0) {
+        serverLog(LL_WARNING|LL_RAW,
+            "\n------ DUMPING CODE AROUND EIP ------\n"
+            "Symbol: %s (base: %p)\n"
+            "Module: %s (base %p)\n"
+            "$ xxd -r -p /tmp/dump.hex /tmp/dump.bin\n"
+            "$ objdump --adjust-vma=%p -D -b binary -m i386:x86-64 /tmp/dump.bin\n"
+            "------\n",
+            info.dli_sname, info.dli_saddr, info.dli_fname, info.dli_fbase,
+            info.dli_saddr);
+        size_t len = (long)eip - (long)info.dli_saddr;
+        unsigned long sz = sysconf(_SC_PAGESIZE);
+        if (len < 1<<13) { /* we don't have functions over 8k (verified) */
+            /* Find the address of the next page, which is our "safety"
+             * limit when dumping. Then try to dump just 128 bytes more
+             * than EIP if there is room, or stop sooner. */
+            void *base = (void *)info.dli_saddr;
+            unsigned long next = ((unsigned long)eip + sz) & ~(sz-1);
+            unsigned long end = (unsigned long)eip + 128;
+            if (end > next) end = next;
+            len = end - (unsigned long)base;
+            serverLogHexDump(LL_WARNING, "dump of function",
+                base, len);
+            dumpX86Calls(base, len);
+        }
+    }
+}
+
+void sigsegvHandler(int sig, siginfo_t *info, void *secret) {
+    UNUSED(secret);
+    UNUSED(info);
+
+    bugReportStart();
+    serverLog(LL_WARNING,
+        "Redis %s crashed by signal: %d, si_code: %d", REDIS_VERSION, sig, info->si_code);
+    if (sig == SIGSEGV || sig == SIGBUS) {
+        serverLog(LL_WARNING,
+        "Accessing address: %p", (void*)info->si_addr);
+    }
+    if (info->si_code <= SI_USER && info->si_pid != -1) {
+        serverLog(LL_WARNING, "Killed by PID: %ld, UID: %d", (long) info->si_pid, info->si_uid);
+    }
+
+#ifdef HAVE_BACKTRACE
+    ucontext_t *uc = (ucontext_t*) secret;
+    void *eip = getMcontextEip(uc);
+    if (eip != NULL) {
+        serverLog(LL_WARNING,
+        "Crashed running the instruction at: %p", eip);
+    }
+
+    logStackTrace(getMcontextEip(uc), 1);
+
+    logRegisters(uc);
+#endif
+
+    printCrashReport();
+
+#ifdef HAVE_BACKTRACE
+    if (eip != NULL)
+        dumpCodeAroundEIP(eip);
+#endif
+
+    bugReportEnd(1, sig);
+}
+
+void printCrashReport(void) {
+    /* Log INFO and CLIENT LIST */
+    logServerInfo();
+
+    /* Log the current client */
+    logCurrentClient();
+
+    /* Log modules info. Something we wanna do last since we fear it may crash. */
+    logModulesInfo();
+
+    /* Run memory test in case the crash was triggered by memory corruption. */
+    doFastMemoryTest();
+}
+
+void bugReportEnd(int killViaSignal, int sig) {
+    struct sigaction act;
+
+    serverLogRaw(LL_WARNING|LL_RAW,
+"\n=== REDIS BUG REPORT END. Make sure to include from START to END. ===\n\n"
+"       Please report the crash by opening an issue on github:\n\n"
+"           http://github.com/redis/redis/issues\n\n"
+"  Suspect RAM error? Use redis-server --test-memory to verify it.\n\n"
+);
+
+    /* free(messages); Don't call free() with possibly corrupted memory. */
+    if (server.daemonize && server.supervised == 0 && server.pidfile) unlink(server.pidfile);
+
+    if (!killViaSignal) {
+        if (server.use_exit_on_panic)
+            exit(1);
+        abort();
+    }
+
+    /* Make sure we exit with the right signal at the end. So for instance
+     * the core will be dumped if enabled. */
+    sigemptyset (&act.sa_mask);
+    act.sa_flags = SA_NODEFER | SA_ONSTACK | SA_RESETHAND;
+    act.sa_handler = SIG_DFL;
+    sigaction (sig, &act, NULL);
+    kill(getpid(),sig);
+}
+
+/* ==================== Logging functions for debugging ===================== */
+
+void serverLogHexDump(int level, char *descr, void *value, size_t len) {
+    char buf[65], *b;
+    unsigned char *v = value;
+    char charset[] = "0123456789abcdef";
+
+    serverLog(level,"%s (hexdump of %zu bytes):", descr, len);
+    b = buf;
+    while(len) {
+        b[0] = charset[(*v)>>4];
+        b[1] = charset[(*v)&0xf];
+        b[2] = '\0';
+        b += 2;
+        len--;
+        v++;
+        if (b-buf == 64 || len == 0) {
+            serverLogRaw(level|LL_RAW,buf);
+            b = buf;
+        }
+    }
+    serverLogRaw(level|LL_RAW,"\n");
+}
+
+/* =========================== Software Watchdog ============================ */
+#include <sys/time.h>
+
+void watchdogSignalHandler(int sig, siginfo_t *info, void *secret) {
+#ifdef HAVE_BACKTRACE
+    ucontext_t *uc = (ucontext_t*) secret;
+#else
+    (void)secret;
+#endif
+    UNUSED(info);
+    UNUSED(sig);
+
+    serverLogFromHandler(LL_WARNING,"\n--- WATCHDOG TIMER EXPIRED ---");
+#ifdef HAVE_BACKTRACE
+    logStackTrace(getMcontextEip(uc), 1);
+#else
+    serverLogFromHandler(LL_WARNING,"Sorry: no support for backtrace().");
+#endif
+    serverLogFromHandler(LL_WARNING,"--------\n");
+}
+
+/* Schedule a SIGALRM delivery after the specified period in milliseconds.
+ * If a timer is already scheduled, this function will re-schedule it to the
+ * specified time. If period is 0 the current timer is disabled. */
+void watchdogScheduleSignal(int period) {
+    struct itimerval it;
+
+    /* Will stop the timer if period is 0. */
+    it.it_value.tv_sec = period/1000;
+    it.it_value.tv_usec = (period%1000)*1000;
+    /* Don't automatically restart. */
+    it.it_interval.tv_sec = 0;
+    it.it_interval.tv_usec = 0;
+    setitimer(ITIMER_REAL, &it, NULL);
+}
+
+/* Enable the software watchdog with the specified period in milliseconds. */
+void enableWatchdog(int period) {
+    int min_period;
+
+    if (server.watchdog_period == 0) {
+        struct sigaction act;
+
+        /* Watchdog was actually disabled, so we have to setup the signal
+         * handler. */
+        sigemptyset(&act.sa_mask);
+        act.sa_flags = SA_SIGINFO;
+        act.sa_sigaction = watchdogSignalHandler;
+        sigaction(SIGALRM, &act, NULL);
+    }
+    /* If the configured period is smaller than twice the timer period, it is
+     * too short for the software watchdog to work reliably. Fix it now
+     * if needed. */
+    min_period = (1000/server.hz)*2;
+    if (period < min_period) period = min_period;
+    watchdogScheduleSignal(period); /* Adjust the current timer. */
+    server.watchdog_period = period;
+}
+
+/* Disable the software watchdog. */
+void disableWatchdog(void) {
+    struct sigaction act;
+    if (server.watchdog_period == 0) return; /* Already disabled. */
+    watchdogScheduleSignal(0); /* Stop the current timer. */
+
+    /* Set the signal handler to SIG_IGN, this will also remove pending
+     * signals from the queue. */
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = 0;
+    act.sa_handler = SIG_IGN;
+    sigaction(SIGALRM, &act, NULL);
+    server.watchdog_period = 0;
+}
+
+/* Positive input is sleep time in microseconds. Negative input is fractions
+ * of microseconds, i.e. -10 means 100 nanoseconds. */
+void debugDelay(int usec) {
+    /* Since even the shortest sleep results in context switch and system call,
+     * the way we achive short sleeps is by statistically sleeping less often. */
+    if (usec < 0) usec = (rand() % -usec) == 0 ? 1: 0;
+    if (usec) usleep(usec);
+}
diff --git a/redis-stable/src/debugmacro.h b/redis-stable/src/debugmacro.h
new file mode 100644
index 00000000..58e6577e
--- /dev/null
+++ b/redis-stable/src/debugmacro.h
@@ -0,0 +1,41 @@
+/* This file contains debugging macros to be used when investigating issues.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#define D(...)                                                               \
+    do {                                                                     \
+        FILE *fp = fopen("/tmp/log.txt","a");                                \
+        fprintf(fp,"%s:%s:%d:\t", __FILE__, __func__, __LINE__);             \
+        fprintf(fp,__VA_ARGS__);                                             \
+        fprintf(fp,"\n");                                                    \
+        fclose(fp);                                                          \
+    } while (0)
diff --git a/redis-stable/src/defrag.c b/redis-stable/src/defrag.c
new file mode 100644
index 00000000..3dfb8679
--- /dev/null
+++ b/redis-stable/src/defrag.c
@@ -0,0 +1,1215 @@
+/* 
+ * Active memory defragmentation
+ * Try to find key / value allocations that need to be re-allocated in order 
+ * to reduce external fragmentation.
+ * We do that by scanning the keyspace and for each pointer we have, we can try to
+ * ask the allocator if moving it to a new address will help reduce fragmentation.
+ *
+ * Copyright (c) 2020, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <time.h>
+#include <assert.h>
+#include <stddef.h>
+
+#ifdef HAVE_DEFRAG
+
+/* this method was added to jemalloc in order to help us understand which
+ * pointers are worthwhile moving and which aren't */
+int je_get_defrag_hint(void* ptr);
+
+/* forward declarations*/
+void defragDictBucketCallback(void *privdata, dictEntry **bucketref);
+dictEntry* replaceSatelliteDictKeyPtrAndOrDefragDictEntry(dict *d, sds oldkey, sds newkey, uint64_t hash, long *defragged);
+
+/* Defrag helper for generic allocations.
+ *
+ * returns NULL in case the allocation wasn't moved.
+ * when it returns a non-null value, the old pointer was already released
+ * and should NOT be accessed. */
+void* activeDefragAlloc(void *ptr) {
+    size_t size;
+    void *newptr;
+    if(!je_get_defrag_hint(ptr)) {
+        server.stat_active_defrag_misses++;
+        return NULL;
+    }
+    /* move this allocation to a new allocation.
+     * make sure not to use the thread cache. so that we don't get back the same
+     * pointers we try to free */
+    size = zmalloc_size(ptr);
+    newptr = zmalloc_no_tcache(size);
+    memcpy(newptr, ptr, size);
+    zfree_no_tcache(ptr);
+    return newptr;
+}
+
+/*Defrag helper for sds strings
+ *
+ * returns NULL in case the allocation wasn't moved.
+ * when it returns a non-null value, the old pointer was already released
+ * and should NOT be accessed. */
+sds activeDefragSds(sds sdsptr) {
+    void* ptr = sdsAllocPtr(sdsptr);
+    void* newptr = activeDefragAlloc(ptr);
+    if (newptr) {
+        size_t offset = sdsptr - (char*)ptr;
+        sdsptr = (char*)newptr + offset;
+        return sdsptr;
+    }
+    return NULL;
+}
+
+/* Defrag helper for robj and/or string objects
+ *
+ * returns NULL in case the allocation wasn't moved.
+ * when it returns a non-null value, the old pointer was already released
+ * and should NOT be accessed. */
+robj *activeDefragStringOb(robj* ob, long *defragged) {
+    robj *ret = NULL;
+    if (ob->refcount!=1)
+        return NULL;
+
+    /* try to defrag robj (only if not an EMBSTR type (handled below). */
+    if (ob->type!=OBJ_STRING || ob->encoding!=OBJ_ENCODING_EMBSTR) {
+        if ((ret = activeDefragAlloc(ob))) {
+            ob = ret;
+            (*defragged)++;
+        }
+    }
+
+    /* try to defrag string object */
+    if (ob->type == OBJ_STRING) {
+        if(ob->encoding==OBJ_ENCODING_RAW) {
+            sds newsds = activeDefragSds((sds)ob->ptr);
+            if (newsds) {
+                ob->ptr = newsds;
+                (*defragged)++;
+            }
+        } else if (ob->encoding==OBJ_ENCODING_EMBSTR) {
+            /* The sds is embedded in the object allocation, calculate the
+             * offset and update the pointer in the new allocation. */
+            long ofs = (intptr_t)ob->ptr - (intptr_t)ob;
+            if ((ret = activeDefragAlloc(ob))) {
+                ret->ptr = (void*)((intptr_t)ret + ofs);
+                (*defragged)++;
+            }
+        } else if (ob->encoding!=OBJ_ENCODING_INT) {
+            serverPanic("Unknown string encoding");
+        }
+    }
+    return ret;
+}
+
+/* Defrag helper for dictEntries to be used during dict iteration (called on
+ * each step). Returns a stat of how many pointers were moved. */
+long dictIterDefragEntry(dictIterator *iter) {
+    /* This function is a little bit dirty since it messes with the internals
+     * of the dict and it's iterator, but the benefit is that it is very easy
+     * to use, and require no other changes in the dict. */
+    long defragged = 0;
+    dictht *ht;
+    /* Handle the next entry (if there is one), and update the pointer in the
+     * current entry. */
+    if (iter->nextEntry) {
+        dictEntry *newde = activeDefragAlloc(iter->nextEntry);
+        if (newde) {
+            defragged++;
+            iter->nextEntry = newde;
+            iter->entry->next = newde;
+        }
+    }
+    /* handle the case of the first entry in the hash bucket. */
+    ht = &iter->d->ht[iter->table];
+    if (ht->table[iter->index] == iter->entry) {
+        dictEntry *newde = activeDefragAlloc(iter->entry);
+        if (newde) {
+            iter->entry = newde;
+            ht->table[iter->index] = newde;
+            defragged++;
+        }
+    }
+    return defragged;
+}
+
+/* Defrag helper for dict main allocations (dict struct, and hash tables).
+ * receives a pointer to the dict* and implicitly updates it when the dict
+ * struct itself was moved. Returns a stat of how many pointers were moved. */
+long dictDefragTables(dict* d) {
+    dictEntry **newtable;
+    long defragged = 0;
+    /* handle the first hash table */
+    newtable = activeDefragAlloc(d->ht[0].table);
+    if (newtable)
+        defragged++, d->ht[0].table = newtable;
+    /* handle the second hash table */
+    if (d->ht[1].table) {
+        newtable = activeDefragAlloc(d->ht[1].table);
+        if (newtable)
+            defragged++, d->ht[1].table = newtable;
+    }
+    return defragged;
+}
+
+/* Internal function used by zslDefrag */
+void zslUpdateNode(zskiplist *zsl, zskiplistNode *oldnode, zskiplistNode *newnode, zskiplistNode **update) {
+    int i;
+    for (i = 0; i < zsl->level; i++) {
+        if (update[i]->level[i].forward == oldnode)
+            update[i]->level[i].forward = newnode;
+    }
+    serverAssert(zsl->header!=oldnode);
+    if (newnode->level[0].forward) {
+        serverAssert(newnode->level[0].forward->backward==oldnode);
+        newnode->level[0].forward->backward = newnode;
+    } else {
+        serverAssert(zsl->tail==oldnode);
+        zsl->tail = newnode;
+    }
+}
+
+/* Defrag helper for sorted set.
+ * Update the robj pointer, defrag the skiplist struct and return the new score
+ * reference. We may not access oldele pointer (not even the pointer stored in
+ * the skiplist), as it was already freed. Newele may be null, in which case we
+ * only need to defrag the skiplist, but not update the obj pointer.
+ * When return value is non-NULL, it is the score reference that must be updated
+ * in the dict record. */
+double *zslDefrag(zskiplist *zsl, double score, sds oldele, sds newele) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x, *newx;
+    int i;
+    sds ele = newele? newele: oldele;
+
+    /* find the skiplist node referring to the object that was moved,
+     * and all pointers that need to be updated if we'll end up moving the skiplist node. */
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+            x->level[i].forward->ele != oldele && /* make sure not to access the
+                                                     ->obj pointer if it matches
+                                                     oldele */
+            (x->level[i].forward->score < score ||
+                (x->level[i].forward->score == score &&
+                sdscmp(x->level[i].forward->ele,ele) < 0)))
+            x = x->level[i].forward;
+        update[i] = x;
+    }
+
+    /* update the robj pointer inside the skip list record. */
+    x = x->level[0].forward;
+    serverAssert(x && score == x->score && x->ele==oldele);
+    if (newele)
+        x->ele = newele;
+
+    /* try to defrag the skiplist record itself */
+    newx = activeDefragAlloc(x);
+    if (newx) {
+        zslUpdateNode(zsl, x, newx, update);
+        return &newx->score;
+    }
+    return NULL;
+}
+
+/* Defrag helper for sorted set.
+ * Defrag a single dict entry key name, and corresponding skiplist struct */
+long activeDefragZsetEntry(zset *zs, dictEntry *de) {
+    sds newsds;
+    double* newscore;
+    long defragged = 0;
+    sds sdsele = dictGetKey(de);
+    if ((newsds = activeDefragSds(sdsele)))
+        defragged++, de->key = newsds;
+    newscore = zslDefrag(zs->zsl, *(double*)dictGetVal(de), sdsele, newsds);
+    if (newscore) {
+        dictSetVal(zs->dict, de, newscore);
+        defragged++;
+    }
+    return defragged;
+}
+
+#define DEFRAG_SDS_DICT_NO_VAL 0
+#define DEFRAG_SDS_DICT_VAL_IS_SDS 1
+#define DEFRAG_SDS_DICT_VAL_IS_STROB 2
+#define DEFRAG_SDS_DICT_VAL_VOID_PTR 3
+
+/* Defrag a dict with sds key and optional value (either ptr, sds or robj string) */
+long activeDefragSdsDict(dict* d, int val_type) {
+    dictIterator *di;
+    dictEntry *de;
+    long defragged = 0;
+    di = dictGetIterator(d);
+    while((de = dictNext(di)) != NULL) {
+        sds sdsele = dictGetKey(de), newsds;
+        if ((newsds = activeDefragSds(sdsele)))
+            de->key = newsds, defragged++;
+        /* defrag the value */
+        if (val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
+            sdsele = dictGetVal(de);
+            if ((newsds = activeDefragSds(sdsele)))
+                de->v.val = newsds, defragged++;
+        } else if (val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
+            robj *newele, *ele = dictGetVal(de);
+            if ((newele = activeDefragStringOb(ele, &defragged)))
+                de->v.val = newele;
+        } else if (val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
+            void *newptr, *ptr = dictGetVal(de);
+            if ((newptr = activeDefragAlloc(ptr)))
+                de->v.val = newptr, defragged++;
+        }
+        defragged += dictIterDefragEntry(di);
+    }
+    dictReleaseIterator(di);
+    return defragged;
+}
+
+/* Defrag a list of ptr, sds or robj string values */
+long activeDefragList(list *l, int val_type) {
+    long defragged = 0;
+    listNode *ln, *newln;
+    for (ln = l->head; ln; ln = ln->next) {
+        if ((newln = activeDefragAlloc(ln))) {
+            if (newln->prev)
+                newln->prev->next = newln;
+            else
+                l->head = newln;
+            if (newln->next)
+                newln->next->prev = newln;
+            else
+                l->tail = newln;
+            ln = newln;
+            defragged++;
+        }
+        if (val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
+            sds newsds, sdsele = ln->value;
+            if ((newsds = activeDefragSds(sdsele)))
+                ln->value = newsds, defragged++;
+        } else if (val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
+            robj *newele, *ele = ln->value;
+            if ((newele = activeDefragStringOb(ele, &defragged)))
+                ln->value = newele;
+        } else if (val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
+            void *newptr, *ptr = ln->value;
+            if ((newptr = activeDefragAlloc(ptr)))
+                ln->value = newptr, defragged++;
+        }
+    }
+    return defragged;
+}
+
+/* Defrag a list of sds values and a dict with the same sds keys */
+long activeDefragSdsListAndDict(list *l, dict *d, int dict_val_type) {
+    long defragged = 0;
+    sds newsds, sdsele;
+    listNode *ln, *newln;
+    dictIterator *di;
+    dictEntry *de;
+    /* Defrag the list and it's sds values */
+    for (ln = l->head; ln; ln = ln->next) {
+        if ((newln = activeDefragAlloc(ln))) {
+            if (newln->prev)
+                newln->prev->next = newln;
+            else
+                l->head = newln;
+            if (newln->next)
+                newln->next->prev = newln;
+            else
+                l->tail = newln;
+            ln = newln;
+            defragged++;
+        }
+        sdsele = ln->value;
+        if ((newsds = activeDefragSds(sdsele))) {
+            /* When defragging an sds value, we need to update the dict key */
+            uint64_t hash = dictGetHash(d, newsds);
+            dictEntry **deref = dictFindEntryRefByPtrAndHash(d, sdsele, hash);
+            if (deref)
+                (*deref)->key = newsds;
+            ln->value = newsds;
+            defragged++;
+        }
+    }
+
+    /* Defrag the dict values (keys were already handled) */
+    di = dictGetIterator(d);
+    while((de = dictNext(di)) != NULL) {
+        if (dict_val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
+            sds newsds, sdsele = dictGetVal(de);
+            if ((newsds = activeDefragSds(sdsele)))
+                de->v.val = newsds, defragged++;
+        } else if (dict_val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
+            robj *newele, *ele = dictGetVal(de);
+            if ((newele = activeDefragStringOb(ele, &defragged)))
+                de->v.val = newele, defragged++;
+        } else if (dict_val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
+            void *newptr, *ptr = dictGetVal(de);
+            if ((newptr = activeDefragAlloc(ptr)))
+                de->v.val = newptr, defragged++;
+        }
+        defragged += dictIterDefragEntry(di);
+    }
+    dictReleaseIterator(di);
+
+    return defragged;
+}
+
+/* Utility function that replaces an old key pointer in the dictionary with a
+ * new pointer. Additionally, we try to defrag the dictEntry in that dict.
+ * Oldkey mey be a dead pointer and should not be accessed (we get a
+ * pre-calculated hash value). Newkey may be null if the key pointer wasn't
+ * moved. Return value is the the dictEntry if found, or NULL if not found.
+ * NOTE: this is very ugly code, but it let's us avoid the complication of
+ * doing a scan on another dict. */
+dictEntry* replaceSatelliteDictKeyPtrAndOrDefragDictEntry(dict *d, sds oldkey, sds newkey, uint64_t hash, long *defragged) {
+    dictEntry **deref = dictFindEntryRefByPtrAndHash(d, oldkey, hash);
+    if (deref) {
+        dictEntry *de = *deref;
+        dictEntry *newde = activeDefragAlloc(de);
+        if (newde) {
+            de = *deref = newde;
+            (*defragged)++;
+        }
+        if (newkey)
+            de->key = newkey;
+        return de;
+    }
+    return NULL;
+}
+
+long activeDefragQuickListNode(quicklist *ql, quicklistNode **node_ref) {
+    quicklistNode *newnode, *node = *node_ref;
+    long defragged = 0;
+    unsigned char *newzl;
+    if ((newnode = activeDefragAlloc(node))) {
+        if (newnode->prev)
+            newnode->prev->next = newnode;
+        else
+            ql->head = newnode;
+        if (newnode->next)
+            newnode->next->prev = newnode;
+        else
+            ql->tail = newnode;
+        *node_ref = node = newnode;
+        defragged++;
+    }
+    if ((newzl = activeDefragAlloc(node->zl)))
+        defragged++, node->zl = newzl;
+    return defragged;
+}
+
+long activeDefragQuickListNodes(quicklist *ql) {
+    quicklistNode *node = ql->head;
+    long defragged = 0;
+    while (node) {
+        defragged += activeDefragQuickListNode(ql, &node);
+        node = node->next;
+    }
+    return defragged;
+}
+
+/* when the value has lots of elements, we want to handle it later and not as
+ * part of the main dictionary scan. this is needed in order to prevent latency
+ * spikes when handling large items */
+void defragLater(redisDb *db, dictEntry *kde) {
+    sds key = sdsdup(dictGetKey(kde));
+    listAddNodeTail(db->defrag_later, key);
+}
+
+/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
+long scanLaterList(robj *ob, unsigned long *cursor, long long endtime, long long *defragged) {
+    quicklist *ql = ob->ptr;
+    quicklistNode *node;
+    long iterations = 0;
+    int bookmark_failed = 0;
+    if (ob->type != OBJ_LIST || ob->encoding != OBJ_ENCODING_QUICKLIST)
+        return 0;
+
+    if (*cursor == 0) {
+        /* if cursor is 0, we start new iteration */
+        node = ql->head;
+    } else {
+        node = quicklistBookmarkFind(ql, "_AD");
+        if (!node) {
+            /* if the bookmark was deleted, it means we reached the end. */
+            *cursor = 0;
+            return 0;
+        }
+        node = node->next;
+    }
+
+    (*cursor)++;
+    while (node) {
+        (*defragged) += activeDefragQuickListNode(ql, &node);
+        server.stat_active_defrag_scanned++;
+        if (++iterations > 128 && !bookmark_failed) {
+            if (ustime() > endtime) {
+                if (!quicklistBookmarkCreate(&ql, "_AD", node)) {
+                    bookmark_failed = 1;
+                } else {
+                    ob->ptr = ql; /* bookmark creation may have re-allocated the quicklist */
+                    return 1;
+                }
+            }
+            iterations = 0;
+        }
+        node = node->next;
+    }
+    quicklistBookmarkDelete(ql, "_AD");
+    *cursor = 0;
+    return bookmark_failed? 1: 0;
+}
+
+typedef struct {
+    zset *zs;
+    long defragged;
+} scanLaterZsetData;
+
+void scanLaterZsetCallback(void *privdata, const dictEntry *_de) {
+    dictEntry *de = (dictEntry*)_de;
+    scanLaterZsetData *data = privdata;
+    data->defragged += activeDefragZsetEntry(data->zs, de);
+    server.stat_active_defrag_scanned++;
+}
+
+long scanLaterZset(robj *ob, unsigned long *cursor) {
+    if (ob->type != OBJ_ZSET || ob->encoding != OBJ_ENCODING_SKIPLIST)
+        return 0;
+    zset *zs = (zset*)ob->ptr;
+    dict *d = zs->dict;
+    scanLaterZsetData data = {zs, 0};
+    *cursor = dictScan(d, *cursor, scanLaterZsetCallback, defragDictBucketCallback, &data);
+    return data.defragged;
+}
+
+void scanLaterSetCallback(void *privdata, const dictEntry *_de) {
+    dictEntry *de = (dictEntry*)_de;
+    long *defragged = privdata;
+    sds sdsele = dictGetKey(de), newsds;
+    if ((newsds = activeDefragSds(sdsele)))
+        (*defragged)++, de->key = newsds;
+    server.stat_active_defrag_scanned++;
+}
+
+long scanLaterSet(robj *ob, unsigned long *cursor) {
+    long defragged = 0;
+    if (ob->type != OBJ_SET || ob->encoding != OBJ_ENCODING_HT)
+        return 0;
+    dict *d = ob->ptr;
+    *cursor = dictScan(d, *cursor, scanLaterSetCallback, defragDictBucketCallback, &defragged);
+    return defragged;
+}
+
+void scanLaterHashCallback(void *privdata, const dictEntry *_de) {
+    dictEntry *de = (dictEntry*)_de;
+    long *defragged = privdata;
+    sds sdsele = dictGetKey(de), newsds;
+    if ((newsds = activeDefragSds(sdsele)))
+        (*defragged)++, de->key = newsds;
+    sdsele = dictGetVal(de);
+    if ((newsds = activeDefragSds(sdsele)))
+        (*defragged)++, de->v.val = newsds;
+    server.stat_active_defrag_scanned++;
+}
+
+long scanLaterHash(robj *ob, unsigned long *cursor) {
+    long defragged = 0;
+    if (ob->type != OBJ_HASH || ob->encoding != OBJ_ENCODING_HT)
+        return 0;
+    dict *d = ob->ptr;
+    *cursor = dictScan(d, *cursor, scanLaterHashCallback, defragDictBucketCallback, &defragged);
+    return defragged;
+}
+
+long defragQuicklist(redisDb *db, dictEntry *kde) {
+    robj *ob = dictGetVal(kde);
+    long defragged = 0;
+    quicklist *ql = ob->ptr, *newql;
+    serverAssert(ob->type == OBJ_LIST && ob->encoding == OBJ_ENCODING_QUICKLIST);
+    if ((newql = activeDefragAlloc(ql)))
+        defragged++, ob->ptr = ql = newql;
+    if (ql->len > server.active_defrag_max_scan_fields)
+        defragLater(db, kde);
+    else
+        defragged += activeDefragQuickListNodes(ql);
+    return defragged;
+}
+
+long defragZsetSkiplist(redisDb *db, dictEntry *kde) {
+    robj *ob = dictGetVal(kde);
+    long defragged = 0;
+    zset *zs = (zset*)ob->ptr;
+    zset *newzs;
+    zskiplist *newzsl;
+    dict *newdict;
+    dictEntry *de;
+    struct zskiplistNode *newheader;
+    serverAssert(ob->type == OBJ_ZSET && ob->encoding == OBJ_ENCODING_SKIPLIST);
+    if ((newzs = activeDefragAlloc(zs)))
+        defragged++, ob->ptr = zs = newzs;
+    if ((newzsl = activeDefragAlloc(zs->zsl)))
+        defragged++, zs->zsl = newzsl;
+    if ((newheader = activeDefragAlloc(zs->zsl->header)))
+        defragged++, zs->zsl->header = newheader;
+    if (dictSize(zs->dict) > server.active_defrag_max_scan_fields)
+        defragLater(db, kde);
+    else {
+        dictIterator *di = dictGetIterator(zs->dict);
+        while((de = dictNext(di)) != NULL) {
+            defragged += activeDefragZsetEntry(zs, de);
+        }
+        dictReleaseIterator(di);
+    }
+    /* handle the dict struct */
+    if ((newdict = activeDefragAlloc(zs->dict)))
+        defragged++, zs->dict = newdict;
+    /* defrag the dict tables */
+    defragged += dictDefragTables(zs->dict);
+    return defragged;
+}
+
+long defragHash(redisDb *db, dictEntry *kde) {
+    long defragged = 0;
+    robj *ob = dictGetVal(kde);
+    dict *d, *newd;
+    serverAssert(ob->type == OBJ_HASH && ob->encoding == OBJ_ENCODING_HT);
+    d = ob->ptr;
+    if (dictSize(d) > server.active_defrag_max_scan_fields)
+        defragLater(db, kde);
+    else
+        defragged += activeDefragSdsDict(d, DEFRAG_SDS_DICT_VAL_IS_SDS);
+    /* handle the dict struct */
+    if ((newd = activeDefragAlloc(ob->ptr)))
+        defragged++, ob->ptr = newd;
+    /* defrag the dict tables */
+    defragged += dictDefragTables(ob->ptr);
+    return defragged;
+}
+
+long defragSet(redisDb *db, dictEntry *kde) {
+    long defragged = 0;
+    robj *ob = dictGetVal(kde);
+    dict *d, *newd;
+    serverAssert(ob->type == OBJ_SET && ob->encoding == OBJ_ENCODING_HT);
+    d = ob->ptr;
+    if (dictSize(d) > server.active_defrag_max_scan_fields)
+        defragLater(db, kde);
+    else
+        defragged += activeDefragSdsDict(d, DEFRAG_SDS_DICT_NO_VAL);
+    /* handle the dict struct */
+    if ((newd = activeDefragAlloc(ob->ptr)))
+        defragged++, ob->ptr = newd;
+    /* defrag the dict tables */
+    defragged += dictDefragTables(ob->ptr);
+    return defragged;
+}
+
+/* Defrag callback for radix tree iterator, called for each node,
+ * used in order to defrag the nodes allocations. */
+int defragRaxNode(raxNode **noderef) {
+    raxNode *newnode = activeDefragAlloc(*noderef);
+    if (newnode) {
+        *noderef = newnode;
+        return 1;
+    }
+    return 0;
+}
+
+/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
+int scanLaterStreamListpacks(robj *ob, unsigned long *cursor, long long endtime, long long *defragged) {
+    static unsigned char last[sizeof(streamID)];
+    raxIterator ri;
+    long iterations = 0;
+    if (ob->type != OBJ_STREAM || ob->encoding != OBJ_ENCODING_STREAM) {
+        *cursor = 0;
+        return 0;
+    }
+
+    stream *s = ob->ptr;
+    raxStart(&ri,s->rax);
+    if (*cursor == 0) {
+        /* if cursor is 0, we start new iteration */
+        defragRaxNode(&s->rax->head);
+        /* assign the iterator node callback before the seek, so that the
+         * initial nodes that are processed till the first item are covered */
+        ri.node_cb = defragRaxNode;
+        raxSeek(&ri,"^",NULL,0);
+    } else {
+        /* if cursor is non-zero, we seek to the static 'last' */
+        if (!raxSeek(&ri,">", last, sizeof(last))) {
+            *cursor = 0;
+            raxStop(&ri);
+            return 0;
+        }
+        /* assign the iterator node callback after the seek, so that the
+         * initial nodes that are processed till now aren't covered */
+        ri.node_cb = defragRaxNode;
+    }
+
+    (*cursor)++;
+    while (raxNext(&ri)) {
+        void *newdata = activeDefragAlloc(ri.data);
+        if (newdata)
+            raxSetData(ri.node, ri.data=newdata), (*defragged)++;
+        server.stat_active_defrag_scanned++;
+        if (++iterations > 128) {
+            if (ustime() > endtime) {
+                serverAssert(ri.key_len==sizeof(last));
+                memcpy(last,ri.key,ri.key_len);
+                raxStop(&ri);
+                return 1;
+            }
+            iterations = 0;
+        }
+    }
+    raxStop(&ri);
+    *cursor = 0;
+    return 0;
+}
+
+/* optional callback used defrag each rax element (not including the element pointer itself) */
+typedef void *(raxDefragFunction)(raxIterator *ri, void *privdata, long *defragged);
+
+/* defrag radix tree including:
+ * 1) rax struct
+ * 2) rax nodes
+ * 3) rax entry data (only if defrag_data is specified)
+ * 4) call a callback per element, and allow the callback to return a new pointer for the element */
+long defragRadixTree(rax **raxref, int defrag_data, raxDefragFunction *element_cb, void *element_cb_data) {
+    long defragged = 0;
+    raxIterator ri;
+    rax* rax;
+    if ((rax = activeDefragAlloc(*raxref)))
+        defragged++, *raxref = rax;
+    rax = *raxref;
+    raxStart(&ri,rax);
+    ri.node_cb = defragRaxNode;
+    defragRaxNode(&rax->head);
+    raxSeek(&ri,"^",NULL,0);
+    while (raxNext(&ri)) {
+        void *newdata = NULL;
+        if (element_cb)
+            newdata = element_cb(&ri, element_cb_data, &defragged);
+        if (defrag_data && !newdata)
+            newdata = activeDefragAlloc(ri.data);
+        if (newdata)
+            raxSetData(ri.node, ri.data=newdata), defragged++;
+    }
+    raxStop(&ri);
+    return defragged;
+}
+
+typedef struct {
+    streamCG *cg;
+    streamConsumer *c;
+} PendingEntryContext;
+
+void* defragStreamConsumerPendingEntry(raxIterator *ri, void *privdata, long *defragged) {
+    UNUSED(defragged);
+    PendingEntryContext *ctx = privdata;
+    streamNACK *nack = ri->data, *newnack;
+    nack->consumer = ctx->c; /* update nack pointer to consumer */
+    newnack = activeDefragAlloc(nack);
+    if (newnack) {
+        /* update consumer group pointer to the nack */
+        void *prev;
+        raxInsert(ctx->cg->pel, ri->key, ri->key_len, newnack, &prev);
+        serverAssert(prev==nack);
+        /* note: we don't increment 'defragged' that's done by the caller */
+    }
+    return newnack;
+}
+
+void* defragStreamConsumer(raxIterator *ri, void *privdata, long *defragged) {
+    streamConsumer *c = ri->data;
+    streamCG *cg = privdata;
+    void *newc = activeDefragAlloc(c);
+    if (newc) {
+        /* note: we don't increment 'defragged' that's done by the caller */
+        c = newc;
+    }
+    sds newsds = activeDefragSds(c->name);
+    if (newsds)
+        (*defragged)++, c->name = newsds;
+    if (c->pel) {
+        PendingEntryContext pel_ctx = {cg, c};
+        *defragged += defragRadixTree(&c->pel, 0, defragStreamConsumerPendingEntry, &pel_ctx);
+    }
+    return newc; /* returns NULL if c was not defragged */
+}
+
+void* defragStreamConsumerGroup(raxIterator *ri, void *privdata, long *defragged) {
+    streamCG *cg = ri->data;
+    UNUSED(privdata);
+    if (cg->consumers)
+        *defragged += defragRadixTree(&cg->consumers, 0, defragStreamConsumer, cg);
+    if (cg->pel)
+        *defragged += defragRadixTree(&cg->pel, 0, NULL, NULL);
+    return NULL;
+}
+
+long defragStream(redisDb *db, dictEntry *kde) {
+    long defragged = 0;
+    robj *ob = dictGetVal(kde);
+    serverAssert(ob->type == OBJ_STREAM && ob->encoding == OBJ_ENCODING_STREAM);
+    stream *s = ob->ptr, *news;
+
+    /* handle the main struct */
+    if ((news = activeDefragAlloc(s)))
+        defragged++, ob->ptr = s = news;
+
+    if (raxSize(s->rax) > server.active_defrag_max_scan_fields) {
+        rax *newrax = activeDefragAlloc(s->rax);
+        if (newrax)
+            defragged++, s->rax = newrax;
+        defragLater(db, kde);
+    } else
+        defragged += defragRadixTree(&s->rax, 1, NULL, NULL);
+
+    if (s->cgroups)
+        defragged += defragRadixTree(&s->cgroups, 1, defragStreamConsumerGroup, NULL);
+    return defragged;
+}
+
+/* Defrag a module key. This is either done immediately or scheduled
+ * for later. Returns then number of pointers defragged.
+ */
+long defragModule(redisDb *db, dictEntry *kde) {
+    robj *obj = dictGetVal(kde);
+    serverAssert(obj->type == OBJ_MODULE);
+    long defragged = 0;
+
+    if (!moduleDefragValue(dictGetKey(kde), obj, &defragged))
+        defragLater(db, kde);
+
+    return defragged;
+}
+
+/* for each key we scan in the main dict, this function will attempt to defrag
+ * all the various pointers it has. Returns a stat of how many pointers were
+ * moved. */
+long defragKey(redisDb *db, dictEntry *de) {
+    sds keysds = dictGetKey(de);
+    robj *newob, *ob;
+    unsigned char *newzl;
+    long defragged = 0;
+    sds newsds;
+
+    /* Try to defrag the key name. */
+    newsds = activeDefragSds(keysds);
+    if (newsds)
+        defragged++, de->key = newsds;
+    if (dictSize(db->expires)) {
+         /* Dirty code:
+          * I can't search in db->expires for that key after i already released
+          * the pointer it holds it won't be able to do the string compare */
+        uint64_t hash = dictGetHash(db->dict, de->key);
+        replaceSatelliteDictKeyPtrAndOrDefragDictEntry(db->expires, keysds, newsds, hash, &defragged);
+    }
+
+    /* Try to defrag robj and / or string value. */
+    ob = dictGetVal(de);
+    if ((newob = activeDefragStringOb(ob, &defragged))) {
+        de->v.val = newob;
+        ob = newob;
+    }
+
+    if (ob->type == OBJ_STRING) {
+        /* Already handled in activeDefragStringOb. */
+    } else if (ob->type == OBJ_LIST) {
+        if (ob->encoding == OBJ_ENCODING_QUICKLIST) {
+            defragged += defragQuicklist(db, de);
+        } else if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
+            if ((newzl = activeDefragAlloc(ob->ptr)))
+                defragged++, ob->ptr = newzl;
+        } else {
+            serverPanic("Unknown list encoding");
+        }
+    } else if (ob->type == OBJ_SET) {
+        if (ob->encoding == OBJ_ENCODING_HT) {
+            defragged += defragSet(db, de);
+        } else if (ob->encoding == OBJ_ENCODING_INTSET) {
+            intset *newis, *is = ob->ptr;
+            if ((newis = activeDefragAlloc(is)))
+                defragged++, ob->ptr = newis;
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (ob->type == OBJ_ZSET) {
+        if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
+            if ((newzl = activeDefragAlloc(ob->ptr)))
+                defragged++, ob->ptr = newzl;
+        } else if (ob->encoding == OBJ_ENCODING_SKIPLIST) {
+            defragged += defragZsetSkiplist(db, de);
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else if (ob->type == OBJ_HASH) {
+        if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
+            if ((newzl = activeDefragAlloc(ob->ptr)))
+                defragged++, ob->ptr = newzl;
+        } else if (ob->encoding == OBJ_ENCODING_HT) {
+            defragged += defragHash(db, de);
+        } else {
+            serverPanic("Unknown hash encoding");
+        }
+    } else if (ob->type == OBJ_STREAM) {
+        defragged += defragStream(db, de);
+    } else if (ob->type == OBJ_MODULE) {
+        defragged += defragModule(db, de);
+    } else {
+        serverPanic("Unknown object type");
+    }
+    return defragged;
+}
+
+/* Defrag scan callback for the main db dictionary. */
+void defragScanCallback(void *privdata, const dictEntry *de) {
+    long defragged = defragKey((redisDb*)privdata, (dictEntry*)de);
+    server.stat_active_defrag_hits += defragged;
+    if(defragged)
+        server.stat_active_defrag_key_hits++;
+    else
+        server.stat_active_defrag_key_misses++;
+    server.stat_active_defrag_scanned++;
+}
+
+/* Defrag scan callback for each hash table bucket,
+ * used in order to defrag the dictEntry allocations. */
+void defragDictBucketCallback(void *privdata, dictEntry **bucketref) {
+    UNUSED(privdata); /* NOTE: this function is also used by both activeDefragCycle and scanLaterHash, etc. don't use privdata */
+    while(*bucketref) {
+        dictEntry *de = *bucketref, *newde;
+        if ((newde = activeDefragAlloc(de))) {
+            *bucketref = newde;
+        }
+        bucketref = &(*bucketref)->next;
+    }
+}
+
+/* Utility function to get the fragmentation ratio from jemalloc.
+ * It is critical to do that by comparing only heap maps that belong to
+ * jemalloc, and skip ones the jemalloc keeps as spare. Since we use this
+ * fragmentation ratio in order to decide if a defrag action should be taken
+ * or not, a false detection can cause the defragmenter to waste a lot of CPU
+ * without the possibility of getting any results. */
+float getAllocatorFragmentation(size_t *out_frag_bytes) {
+    size_t resident, active, allocated;
+    zmalloc_get_allocator_info(&allocated, &active, &resident);
+    float frag_pct = ((float)active / allocated)*100 - 100;
+    size_t frag_bytes = active - allocated;
+    float rss_pct = ((float)resident / allocated)*100 - 100;
+    size_t rss_bytes = resident - allocated;
+    if(out_frag_bytes)
+        *out_frag_bytes = frag_bytes;
+    serverLog(LL_DEBUG,
+        "allocated=%zu, active=%zu, resident=%zu, frag=%.0f%% (%.0f%% rss), frag_bytes=%zu (%zu rss)",
+        allocated, active, resident, frag_pct, rss_pct, frag_bytes, rss_bytes);
+    return frag_pct;
+}
+
+/* We may need to defrag other globals, one small allocation can hold a full allocator run.
+ * so although small, it is still important to defrag these */
+long defragOtherGlobals() {
+    long defragged = 0;
+
+    /* there are many more pointers to defrag (e.g. client argv, output / aof buffers, etc.
+     * but we assume most of these are short lived, we only need to defrag allocations
+     * that remain static for a long time */
+    defragged += activeDefragSdsDict(server.lua_scripts, DEFRAG_SDS_DICT_VAL_IS_STROB);
+    defragged += activeDefragSdsListAndDict(server.repl_scriptcache_fifo, server.repl_scriptcache_dict, DEFRAG_SDS_DICT_NO_VAL);
+    defragged += moduleDefragGlobals();
+    return defragged;
+}
+
+/* returns 0 more work may or may not be needed (see non-zero cursor),
+ * and 1 if time is up and more work is needed. */
+int defragLaterItem(dictEntry *de, unsigned long *cursor, long long endtime) {
+    if (de) {
+        robj *ob = dictGetVal(de);
+        if (ob->type == OBJ_LIST) {
+            return scanLaterList(ob, cursor, endtime, &server.stat_active_defrag_hits);
+        } else if (ob->type == OBJ_SET) {
+            server.stat_active_defrag_hits += scanLaterSet(ob, cursor);
+        } else if (ob->type == OBJ_ZSET) {
+            server.stat_active_defrag_hits += scanLaterZset(ob, cursor);
+        } else if (ob->type == OBJ_HASH) {
+            server.stat_active_defrag_hits += scanLaterHash(ob, cursor);
+        } else if (ob->type == OBJ_STREAM) {
+            return scanLaterStreamListpacks(ob, cursor, endtime, &server.stat_active_defrag_hits);
+        } else if (ob->type == OBJ_MODULE) {
+            return moduleLateDefrag(dictGetKey(de), ob, cursor, endtime, &server.stat_active_defrag_hits);
+        } else {
+            *cursor = 0; /* object type may have changed since we schedule it for later */
+        }
+    } else {
+        *cursor = 0; /* object may have been deleted already */
+    }
+    return 0;
+}
+
+/* static variables serving defragLaterStep to continue scanning a key from were we stopped last time. */
+static sds defrag_later_current_key = NULL;
+static unsigned long defrag_later_cursor = 0;
+
+/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
+int defragLaterStep(redisDb *db, long long endtime) {
+    unsigned int iterations = 0;
+    unsigned long long prev_defragged = server.stat_active_defrag_hits;
+    unsigned long long prev_scanned = server.stat_active_defrag_scanned;
+    long long key_defragged;
+
+    do {
+        /* if we're not continuing a scan from the last call or loop, start a new one */
+        if (!defrag_later_cursor) {
+            listNode *head = listFirst(db->defrag_later);
+
+            /* Move on to next key */
+            if (defrag_later_current_key) {
+                serverAssert(defrag_later_current_key == head->value);
+                listDelNode(db->defrag_later, head);
+                defrag_later_cursor = 0;
+                defrag_later_current_key = NULL;
+            }
+
+            /* stop if we reached the last one. */
+            head = listFirst(db->defrag_later);
+            if (!head)
+                return 0;
+
+            /* start a new key */
+            defrag_later_current_key = head->value;
+            defrag_later_cursor = 0;
+        }
+
+        /* each time we enter this function we need to fetch the key from the dict again (if it still exists) */
+        dictEntry *de = dictFind(db->dict, defrag_later_current_key);
+        key_defragged = server.stat_active_defrag_hits;
+        do {
+            int quit = 0;
+            if (defragLaterItem(de, &defrag_later_cursor, endtime))
+                quit = 1; /* time is up, we didn't finish all the work */
+
+            /* Once in 16 scan iterations, 512 pointer reallocations, or 64 fields
+             * (if we have a lot of pointers in one hash bucket, or rehashing),
+             * check if we reached the time limit. */
+            if (quit || (++iterations > 16 ||
+                            server.stat_active_defrag_hits - prev_defragged > 512 ||
+                            server.stat_active_defrag_scanned - prev_scanned > 64)) {
+                if (quit || ustime() > endtime) {
+                    if(key_defragged != server.stat_active_defrag_hits)
+                        server.stat_active_defrag_key_hits++;
+                    else
+                        server.stat_active_defrag_key_misses++;
+                    return 1;
+                }
+                iterations = 0;
+                prev_defragged = server.stat_active_defrag_hits;
+                prev_scanned = server.stat_active_defrag_scanned;
+            }
+        } while(defrag_later_cursor);
+        if(key_defragged != server.stat_active_defrag_hits)
+            server.stat_active_defrag_key_hits++;
+        else
+            server.stat_active_defrag_key_misses++;
+    } while(1);
+}
+
+#define INTERPOLATE(x, x1, x2, y1, y2) ( (y1) + ((x)-(x1)) * ((y2)-(y1)) / ((x2)-(x1)) )
+#define LIMIT(y, min, max) ((y)<(min)? min: ((y)>(max)? max: (y)))
+
+/* decide if defrag is needed, and at what CPU effort to invest in it */
+void computeDefragCycles() {
+    size_t frag_bytes;
+    float frag_pct = getAllocatorFragmentation(&frag_bytes);
+    /* If we're not already running, and below the threshold, exit. */
+    if (!server.active_defrag_running) {
+        if(frag_pct < server.active_defrag_threshold_lower || frag_bytes < server.active_defrag_ignore_bytes)
+            return;
+    }
+
+    /* Calculate the adaptive aggressiveness of the defrag */
+    int cpu_pct = INTERPOLATE(frag_pct,
+            server.active_defrag_threshold_lower,
+            server.active_defrag_threshold_upper,
+            server.active_defrag_cycle_min,
+            server.active_defrag_cycle_max);
+    cpu_pct = LIMIT(cpu_pct,
+            server.active_defrag_cycle_min,
+            server.active_defrag_cycle_max);
+     /* We allow increasing the aggressiveness during a scan, but don't
+      * reduce it. */
+    if (!server.active_defrag_running ||
+        cpu_pct > server.active_defrag_running)
+    {
+        server.active_defrag_running = cpu_pct;
+        serverLog(LL_VERBOSE,
+            "Starting active defrag, frag=%.0f%%, frag_bytes=%zu, cpu=%d%%",
+            frag_pct, frag_bytes, cpu_pct);
+    }
+}
+
+/* Perform incremental defragmentation work from the serverCron.
+ * This works in a similar way to activeExpireCycle, in the sense that
+ * we do incremental work across calls. */
+void activeDefragCycle(void) {
+    static int current_db = -1;
+    static unsigned long cursor = 0;
+    static redisDb *db = NULL;
+    static long long start_scan, start_stat;
+    unsigned int iterations = 0;
+    unsigned long long prev_defragged = server.stat_active_defrag_hits;
+    unsigned long long prev_scanned = server.stat_active_defrag_scanned;
+    long long start, timelimit, endtime;
+    mstime_t latency;
+    int quit = 0;
+
+    if (!server.active_defrag_enabled) {
+        if (server.active_defrag_running) {
+            /* if active defrag was disabled mid-run, start from fresh next time. */
+            server.active_defrag_running = 0;
+            if (db)
+                listEmpty(db->defrag_later);
+            defrag_later_current_key = NULL;
+            defrag_later_cursor = 0;
+            current_db = -1;
+            cursor = 0;
+            db = NULL;
+        }
+        return;
+    }
+
+    if (hasActiveChildProcess())
+        return; /* Defragging memory while there's a fork will just do damage. */
+
+    /* Once a second, check if the fragmentation justfies starting a scan
+     * or making it more aggressive. */
+    run_with_period(1000) {
+        computeDefragCycles();
+    }
+    if (!server.active_defrag_running)
+        return;
+
+    /* See activeExpireCycle for how timelimit is handled. */
+    start = ustime();
+    timelimit = 1000000*server.active_defrag_running/server.hz/100;
+    if (timelimit <= 0) timelimit = 1;
+    endtime = start + timelimit;
+    latencyStartMonitor(latency);
+
+    do {
+        /* if we're not continuing a scan from the last call or loop, start a new one */
+        if (!cursor) {
+            /* finish any leftovers from previous db before moving to the next one */
+            if (db && defragLaterStep(db, endtime)) {
+                quit = 1; /* time is up, we didn't finish all the work */
+                break; /* this will exit the function and we'll continue on the next cycle */
+            }
+
+            /* Move on to next database, and stop if we reached the last one. */
+            if (++current_db >= server.dbnum) {
+                /* defrag other items not part of the db / keys */
+                defragOtherGlobals();
+
+                long long now = ustime();
+                size_t frag_bytes;
+                float frag_pct = getAllocatorFragmentation(&frag_bytes);
+                serverLog(LL_VERBOSE,
+                    "Active defrag done in %dms, reallocated=%d, frag=%.0f%%, frag_bytes=%zu",
+                    (int)((now - start_scan)/1000), (int)(server.stat_active_defrag_hits - start_stat), frag_pct, frag_bytes);
+
+                start_scan = now;
+                current_db = -1;
+                cursor = 0;
+                db = NULL;
+                server.active_defrag_running = 0;
+
+                computeDefragCycles(); /* if another scan is needed, start it right away */
+                if (server.active_defrag_running != 0 && ustime() < endtime)
+                    continue;
+                break;
+            }
+            else if (current_db==0) {
+                /* Start a scan from the first database. */
+                start_scan = ustime();
+                start_stat = server.stat_active_defrag_hits;
+            }
+
+            db = &server.db[current_db];
+            cursor = 0;
+        }
+
+        do {
+            /* before scanning the next bucket, see if we have big keys left from the previous bucket to scan */
+            if (defragLaterStep(db, endtime)) {
+                quit = 1; /* time is up, we didn't finish all the work */
+                break; /* this will exit the function and we'll continue on the next cycle */
+            }
+
+            cursor = dictScan(db->dict, cursor, defragScanCallback, defragDictBucketCallback, db);
+
+            /* Once in 16 scan iterations, 512 pointer reallocations. or 64 keys
+             * (if we have a lot of pointers in one hash bucket or rehasing),
+             * check if we reached the time limit.
+             * But regardless, don't start a new db in this loop, this is because after
+             * the last db we call defragOtherGlobals, which must be done in one cycle */
+            if (!cursor || (++iterations > 16 ||
+                            server.stat_active_defrag_hits - prev_defragged > 512 ||
+                            server.stat_active_defrag_scanned - prev_scanned > 64)) {
+                if (!cursor || ustime() > endtime) {
+                    quit = 1;
+                    break;
+                }
+                iterations = 0;
+                prev_defragged = server.stat_active_defrag_hits;
+                prev_scanned = server.stat_active_defrag_scanned;
+            }
+        } while(cursor && !quit);
+    } while(!quit);
+
+    latencyEndMonitor(latency);
+    latencyAddSampleIfNeeded("active-defrag-cycle",latency);
+}
+
+#else /* HAVE_DEFRAG */
+
+void activeDefragCycle(void) {
+    /* Not implemented yet. */
+}
+
+void *activeDefragAlloc(void *ptr) {
+    UNUSED(ptr);
+    return NULL;
+}
+
+robj *activeDefragStringOb(robj *ob, long *defragged) {
+    UNUSED(ob);
+    UNUSED(defragged);
+    return NULL;
+}
+
+#endif
diff --git a/redis-stable/src/dict.c b/redis-stable/src/dict.c
new file mode 100644
index 00000000..1bbdc211
--- /dev/null
+++ b/redis-stable/src/dict.c
@@ -0,0 +1,1315 @@
+/* Hash Tables Implementation.
+ *
+ * This file implements in memory hash tables with insert/del/replace/find/
+ * get-random-element operations. Hash tables will auto resize if needed
+ * tables of power of two in size are used, collisions are handled by
+ * chaining. See the source code for more information... :)
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+#include <stdarg.h>
+#include <limits.h>
+#include <sys/time.h>
+
+#include "dict.h"
+#include "zmalloc.h"
+#include "redisassert.h"
+
+/* Using dictEnableResize() / dictDisableResize() we make possible to
+ * enable/disable resizing of the hash table as needed. This is very important
+ * for Redis, as we use copy-on-write and don't want to move too much memory
+ * around when there is a child performing saving operations.
+ *
+ * Note that even when dict_can_resize is set to 0, not all resizes are
+ * prevented: a hash table is still allowed to grow if the ratio between
+ * the number of elements and the buckets > dict_force_resize_ratio. */
+static int dict_can_resize = 1;
+static unsigned int dict_force_resize_ratio = 5;
+
+/* -------------------------- private prototypes ---------------------------- */
+
+static int _dictExpandIfNeeded(dict *ht);
+static unsigned long _dictNextPower(unsigned long size);
+static long _dictKeyIndex(dict *ht, const void *key, uint64_t hash, dictEntry **existing);
+static int _dictInit(dict *ht, dictType *type, void *privDataPtr);
+
+/* -------------------------- hash functions -------------------------------- */
+
+static uint8_t dict_hash_function_seed[16];
+
+void dictSetHashFunctionSeed(uint8_t *seed) {
+    memcpy(dict_hash_function_seed,seed,sizeof(dict_hash_function_seed));
+}
+
+uint8_t *dictGetHashFunctionSeed(void) {
+    return dict_hash_function_seed;
+}
+
+/* The default hashing function uses SipHash implementation
+ * in siphash.c. */
+
+uint64_t siphash(const uint8_t *in, const size_t inlen, const uint8_t *k);
+uint64_t siphash_nocase(const uint8_t *in, const size_t inlen, const uint8_t *k);
+
+uint64_t dictGenHashFunction(const void *key, int len) {
+    return siphash(key,len,dict_hash_function_seed);
+}
+
+uint64_t dictGenCaseHashFunction(const unsigned char *buf, int len) {
+    return siphash_nocase(buf,len,dict_hash_function_seed);
+}
+
+/* ----------------------------- API implementation ------------------------- */
+
+/* Reset a hash table already initialized with ht_init().
+ * NOTE: This function should only be called by ht_destroy(). */
+static void _dictReset(dictht *ht)
+{
+    ht->table = NULL;
+    ht->size = 0;
+    ht->sizemask = 0;
+    ht->used = 0;
+}
+
+/* Create a new hash table */
+dict *dictCreate(dictType *type,
+        void *privDataPtr)
+{
+    dict *d = zmalloc(sizeof(*d));
+
+    _dictInit(d,type,privDataPtr);
+    return d;
+}
+
+/* Initialize the hash table */
+int _dictInit(dict *d, dictType *type,
+        void *privDataPtr)
+{
+    _dictReset(&d->ht[0]);
+    _dictReset(&d->ht[1]);
+    d->type = type;
+    d->privdata = privDataPtr;
+    d->rehashidx = -1;
+    d->pauserehash = 0;
+    return DICT_OK;
+}
+
+/* Resize the table to the minimal size that contains all the elements,
+ * but with the invariant of a USED/BUCKETS ratio near to <= 1 */
+int dictResize(dict *d)
+{
+    unsigned long minimal;
+
+    if (!dict_can_resize || dictIsRehashing(d)) return DICT_ERR;
+    minimal = d->ht[0].used;
+    if (minimal < DICT_HT_INITIAL_SIZE)
+        minimal = DICT_HT_INITIAL_SIZE;
+    return dictExpand(d, minimal);
+}
+
+/* Expand or create the hash table,
+ * when malloc_failed is non-NULL, it'll avoid panic if malloc fails (in which case it'll be set to 1).
+ * Returns DICT_OK if expand was performed, and DICT_ERR if skipped. */
+int _dictExpand(dict *d, unsigned long size, int* malloc_failed)
+{
+    if (malloc_failed) *malloc_failed = 0;
+
+    /* the size is invalid if it is smaller than the number of
+     * elements already inside the hash table */
+    if (dictIsRehashing(d) || d->ht[0].used > size)
+        return DICT_ERR;
+
+    dictht n; /* the new hash table */
+    unsigned long realsize = _dictNextPower(size);
+
+    /* Detect overflows */
+    if (realsize < size || realsize * sizeof(dictEntry*) < realsize)
+        return DICT_ERR;
+
+    /* Rehashing to the same table size is not useful. */
+    if (realsize == d->ht[0].size) return DICT_ERR;
+
+    /* Allocate the new hash table and initialize all pointers to NULL */
+    n.size = realsize;
+    n.sizemask = realsize-1;
+    if (malloc_failed) {
+        n.table = ztrycalloc(realsize*sizeof(dictEntry*));
+        *malloc_failed = n.table == NULL;
+        if (*malloc_failed)
+            return DICT_ERR;
+    } else
+        n.table = zcalloc(realsize*sizeof(dictEntry*));
+
+    n.used = 0;
+
+    /* Is this the first initialization? If so it's not really a rehashing
+     * we just set the first hash table so that it can accept keys. */
+    if (d->ht[0].table == NULL) {
+        d->ht[0] = n;
+        return DICT_OK;
+    }
+
+    /* Prepare a second hash table for incremental rehashing */
+    d->ht[1] = n;
+    d->rehashidx = 0;
+    return DICT_OK;
+}
+
+/* return DICT_ERR if expand was not performed */
+int dictExpand(dict *d, unsigned long size) {
+    return _dictExpand(d, size, NULL);
+}
+
+/* return DICT_ERR if expand failed due to memory allocation failure */
+int dictTryExpand(dict *d, unsigned long size) {
+    int malloc_failed;
+    _dictExpand(d, size, &malloc_failed);
+    return malloc_failed? DICT_ERR : DICT_OK;
+}
+
+/* Performs N steps of incremental rehashing. Returns 1 if there are still
+ * keys to move from the old to the new hash table, otherwise 0 is returned.
+ *
+ * Note that a rehashing step consists in moving a bucket (that may have more
+ * than one key as we use chaining) from the old to the new hash table, however
+ * since part of the hash table may be composed of empty spaces, it is not
+ * guaranteed that this function will rehash even a single bucket, since it
+ * will visit at max N*10 empty buckets in total, otherwise the amount of
+ * work it does would be unbound and the function may block for a long time. */
+int dictRehash(dict *d, int n) {
+    int empty_visits = n*10; /* Max number of empty buckets to visit. */
+    if (!dictIsRehashing(d)) return 0;
+
+    while(n-- && d->ht[0].used != 0) {
+        dictEntry *de, *nextde;
+
+        /* Note that rehashidx can't overflow as we are sure there are more
+         * elements because ht[0].used != 0 */
+        assert(d->ht[0].size > (unsigned long)d->rehashidx);
+        while(d->ht[0].table[d->rehashidx] == NULL) {
+            d->rehashidx++;
+            if (--empty_visits == 0) return 1;
+        }
+        de = d->ht[0].table[d->rehashidx];
+        /* Move all the keys in this bucket from the old to the new hash HT */
+        while(de) {
+            uint64_t h;
+
+            nextde = de->next;
+            /* Get the index in the new hash table */
+            h = dictHashKey(d, de->key) & d->ht[1].sizemask;
+            de->next = d->ht[1].table[h];
+            d->ht[1].table[h] = de;
+            d->ht[0].used--;
+            d->ht[1].used++;
+            de = nextde;
+        }
+        d->ht[0].table[d->rehashidx] = NULL;
+        d->rehashidx++;
+    }
+
+    /* Check if we already rehashed the whole table... */
+    if (d->ht[0].used == 0) {
+        zfree(d->ht[0].table);
+        d->ht[0] = d->ht[1];
+        _dictReset(&d->ht[1]);
+        d->rehashidx = -1;
+        return 0;
+    }
+
+    /* More to rehash... */
+    return 1;
+}
+
+long long timeInMilliseconds(void) {
+    struct timeval tv;
+
+    gettimeofday(&tv,NULL);
+    return (((long long)tv.tv_sec)*1000)+(tv.tv_usec/1000);
+}
+
+/* Rehash in ms+"delta" milliseconds. The value of "delta" is larger 
+ * than 0, and is smaller than 1 in most cases. The exact upper bound 
+ * depends on the running time of dictRehash(d,100).*/
+int dictRehashMilliseconds(dict *d, int ms) {
+    if (d->pauserehash > 0) return 0;
+
+    long long start = timeInMilliseconds();
+    int rehashes = 0;
+
+    while(dictRehash(d,100)) {
+        rehashes += 100;
+        if (timeInMilliseconds()-start > ms) break;
+    }
+    return rehashes;
+}
+
+/* This function performs just a step of rehashing, and only if hashing has
+ * not been paused for our hash table. When we have iterators in the
+ * middle of a rehashing we can't mess with the two hash tables otherwise
+ * some element can be missed or duplicated.
+ *
+ * This function is called by common lookup or update operations in the
+ * dictionary so that the hash table automatically migrates from H1 to H2
+ * while it is actively used. */
+static void _dictRehashStep(dict *d) {
+    if (d->pauserehash == 0) dictRehash(d,1);
+}
+
+/* Add an element to the target hash table */
+int dictAdd(dict *d, void *key, void *val)
+{
+    dictEntry *entry = dictAddRaw(d,key,NULL);
+
+    if (!entry) return DICT_ERR;
+    dictSetVal(d, entry, val);
+    return DICT_OK;
+}
+
+/* Low level add or find:
+ * This function adds the entry but instead of setting a value returns the
+ * dictEntry structure to the user, that will make sure to fill the value
+ * field as they wish.
+ *
+ * This function is also directly exposed to the user API to be called
+ * mainly in order to store non-pointers inside the hash value, example:
+ *
+ * entry = dictAddRaw(dict,mykey,NULL);
+ * if (entry != NULL) dictSetSignedIntegerVal(entry,1000);
+ *
+ * Return values:
+ *
+ * If key already exists NULL is returned, and "*existing" is populated
+ * with the existing entry if existing is not NULL.
+ *
+ * If key was added, the hash entry is returned to be manipulated by the caller.
+ */
+dictEntry *dictAddRaw(dict *d, void *key, dictEntry **existing)
+{
+    long index;
+    dictEntry *entry;
+    dictht *ht;
+
+    if (dictIsRehashing(d)) _dictRehashStep(d);
+
+    /* Get the index of the new element, or -1 if
+     * the element already exists. */
+    if ((index = _dictKeyIndex(d, key, dictHashKey(d,key), existing)) == -1)
+        return NULL;
+
+    /* Allocate the memory and store the new entry.
+     * Insert the element in top, with the assumption that in a database
+     * system it is more likely that recently added entries are accessed
+     * more frequently. */
+    ht = dictIsRehashing(d) ? &d->ht[1] : &d->ht[0];
+    entry = zmalloc(sizeof(*entry));
+    entry->next = ht->table[index];
+    ht->table[index] = entry;
+    ht->used++;
+
+    /* Set the hash entry fields. */
+    dictSetKey(d, entry, key);
+    return entry;
+}
+
+/* Add or Overwrite:
+ * Add an element, discarding the old value if the key already exists.
+ * Return 1 if the key was added from scratch, 0 if there was already an
+ * element with such key and dictReplace() just performed a value update
+ * operation. */
+int dictReplace(dict *d, void *key, void *val)
+{
+    dictEntry *entry, *existing, auxentry;
+
+    /* Try to add the element. If the key
+     * does not exists dictAdd will succeed. */
+    entry = dictAddRaw(d,key,&existing);
+    if (entry) {
+        dictSetVal(d, entry, val);
+        return 1;
+    }
+
+    /* Set the new value and free the old one. Note that it is important
+     * to do that in this order, as the value may just be exactly the same
+     * as the previous one. In this context, think to reference counting,
+     * you want to increment (set), and then decrement (free), and not the
+     * reverse. */
+    auxentry = *existing;
+    dictSetVal(d, existing, val);
+    dictFreeVal(d, &auxentry);
+    return 0;
+}
+
+/* Add or Find:
+ * dictAddOrFind() is simply a version of dictAddRaw() that always
+ * returns the hash entry of the specified key, even if the key already
+ * exists and can't be added (in that case the entry of the already
+ * existing key is returned.)
+ *
+ * See dictAddRaw() for more information. */
+dictEntry *dictAddOrFind(dict *d, void *key) {
+    dictEntry *entry, *existing;
+    entry = dictAddRaw(d,key,&existing);
+    return entry ? entry : existing;
+}
+
+/* Search and remove an element. This is an helper function for
+ * dictDelete() and dictUnlink(), please check the top comment
+ * of those functions. */
+static dictEntry *dictGenericDelete(dict *d, const void *key, int nofree) {
+    uint64_t h, idx;
+    dictEntry *he, *prevHe;
+    int table;
+
+    if (d->ht[0].used == 0 && d->ht[1].used == 0) return NULL;
+
+    if (dictIsRehashing(d)) _dictRehashStep(d);
+    h = dictHashKey(d, key);
+
+    for (table = 0; table <= 1; table++) {
+        idx = h & d->ht[table].sizemask;
+        he = d->ht[table].table[idx];
+        prevHe = NULL;
+        while(he) {
+            if (key==he->key || dictCompareKeys(d, key, he->key)) {
+                /* Unlink the element from the list */
+                if (prevHe)
+                    prevHe->next = he->next;
+                else
+                    d->ht[table].table[idx] = he->next;
+                if (!nofree) {
+                    dictFreeKey(d, he);
+                    dictFreeVal(d, he);
+                    zfree(he);
+                }
+                d->ht[table].used--;
+                return he;
+            }
+            prevHe = he;
+            he = he->next;
+        }
+        if (!dictIsRehashing(d)) break;
+    }
+    return NULL; /* not found */
+}
+
+/* Remove an element, returning DICT_OK on success or DICT_ERR if the
+ * element was not found. */
+int dictDelete(dict *ht, const void *key) {
+    return dictGenericDelete(ht,key,0) ? DICT_OK : DICT_ERR;
+}
+
+/* Remove an element from the table, but without actually releasing
+ * the key, value and dictionary entry. The dictionary entry is returned
+ * if the element was found (and unlinked from the table), and the user
+ * should later call `dictFreeUnlinkedEntry()` with it in order to release it.
+ * Otherwise if the key is not found, NULL is returned.
+ *
+ * This function is useful when we want to remove something from the hash
+ * table but want to use its value before actually deleting the entry.
+ * Without this function the pattern would require two lookups:
+ *
+ *  entry = dictFind(...);
+ *  // Do something with entry
+ *  dictDelete(dictionary,entry);
+ *
+ * Thanks to this function it is possible to avoid this, and use
+ * instead:
+ *
+ * entry = dictUnlink(dictionary,entry);
+ * // Do something with entry
+ * dictFreeUnlinkedEntry(entry); // <- This does not need to lookup again.
+ */
+dictEntry *dictUnlink(dict *ht, const void *key) {
+    return dictGenericDelete(ht,key,1);
+}
+
+/* You need to call this function to really free the entry after a call
+ * to dictUnlink(). It's safe to call this function with 'he' = NULL. */
+void dictFreeUnlinkedEntry(dict *d, dictEntry *he) {
+    if (he == NULL) return;
+    dictFreeKey(d, he);
+    dictFreeVal(d, he);
+    zfree(he);
+}
+
+/* Destroy an entire dictionary */
+int _dictClear(dict *d, dictht *ht, void(callback)(void *)) {
+    unsigned long i;
+
+    /* Free all the elements */
+    for (i = 0; i < ht->size && ht->used > 0; i++) {
+        dictEntry *he, *nextHe;
+
+        if (callback && (i & 65535) == 0) callback(d->privdata);
+
+        if ((he = ht->table[i]) == NULL) continue;
+        while(he) {
+            nextHe = he->next;
+            dictFreeKey(d, he);
+            dictFreeVal(d, he);
+            zfree(he);
+            ht->used--;
+            he = nextHe;
+        }
+    }
+    /* Free the table and the allocated cache structure */
+    zfree(ht->table);
+    /* Re-initialize the table */
+    _dictReset(ht);
+    return DICT_OK; /* never fails */
+}
+
+/* Clear & Release the hash table */
+void dictRelease(dict *d)
+{
+    _dictClear(d,&d->ht[0],NULL);
+    _dictClear(d,&d->ht[1],NULL);
+    zfree(d);
+}
+
+dictEntry *dictFind(dict *d, const void *key)
+{
+    dictEntry *he;
+    uint64_t h, idx, table;
+
+    if (dictSize(d) == 0) return NULL; /* dict is empty */
+    if (dictIsRehashing(d)) _dictRehashStep(d);
+    h = dictHashKey(d, key);
+    for (table = 0; table <= 1; table++) {
+        idx = h & d->ht[table].sizemask;
+        he = d->ht[table].table[idx];
+        while(he) {
+            if (key==he->key || dictCompareKeys(d, key, he->key))
+                return he;
+            he = he->next;
+        }
+        if (!dictIsRehashing(d)) return NULL;
+    }
+    return NULL;
+}
+
+void *dictFetchValue(dict *d, const void *key) {
+    dictEntry *he;
+
+    he = dictFind(d,key);
+    return he ? dictGetVal(he) : NULL;
+}
+
+/* A fingerprint is a 64 bit number that represents the state of the dictionary
+ * at a given time, it's just a few dict properties xored together.
+ * When an unsafe iterator is initialized, we get the dict fingerprint, and check
+ * the fingerprint again when the iterator is released.
+ * If the two fingerprints are different it means that the user of the iterator
+ * performed forbidden operations against the dictionary while iterating. */
+long long dictFingerprint(dict *d) {
+    long long integers[6], hash = 0;
+    int j;
+
+    integers[0] = (long) d->ht[0].table;
+    integers[1] = d->ht[0].size;
+    integers[2] = d->ht[0].used;
+    integers[3] = (long) d->ht[1].table;
+    integers[4] = d->ht[1].size;
+    integers[5] = d->ht[1].used;
+
+    /* We hash N integers by summing every successive integer with the integer
+     * hashing of the previous sum. Basically:
+     *
+     * Result = hash(hash(hash(int1)+int2)+int3) ...
+     *
+     * This way the same set of integers in a different order will (likely) hash
+     * to a different number. */
+    for (j = 0; j < 6; j++) {
+        hash += integers[j];
+        /* For the hashing step we use Tomas Wang's 64 bit integer hash. */
+        hash = (~hash) + (hash << 21); // hash = (hash << 21) - hash - 1;
+        hash = hash ^ (hash >> 24);
+        hash = (hash + (hash << 3)) + (hash << 8); // hash * 265
+        hash = hash ^ (hash >> 14);
+        hash = (hash + (hash << 2)) + (hash << 4); // hash * 21
+        hash = hash ^ (hash >> 28);
+        hash = hash + (hash << 31);
+    }
+    return hash;
+}
+
+dictIterator *dictGetIterator(dict *d)
+{
+    dictIterator *iter = zmalloc(sizeof(*iter));
+
+    iter->d = d;
+    iter->table = 0;
+    iter->index = -1;
+    iter->safe = 0;
+    iter->entry = NULL;
+    iter->nextEntry = NULL;
+    return iter;
+}
+
+dictIterator *dictGetSafeIterator(dict *d) {
+    dictIterator *i = dictGetIterator(d);
+
+    i->safe = 1;
+    return i;
+}
+
+dictEntry *dictNext(dictIterator *iter)
+{
+    while (1) {
+        if (iter->entry == NULL) {
+            dictht *ht = &iter->d->ht[iter->table];
+            if (iter->index == -1 && iter->table == 0) {
+                if (iter->safe)
+                    dictPauseRehashing(iter->d);
+                else
+                    iter->fingerprint = dictFingerprint(iter->d);
+            }
+            iter->index++;
+            if (iter->index >= (long) ht->size) {
+                if (dictIsRehashing(iter->d) && iter->table == 0) {
+                    iter->table++;
+                    iter->index = 0;
+                    ht = &iter->d->ht[1];
+                } else {
+                    break;
+                }
+            }
+            iter->entry = ht->table[iter->index];
+        } else {
+            iter->entry = iter->nextEntry;
+        }
+        if (iter->entry) {
+            /* We need to save the 'next' here, the iterator user
+             * may delete the entry we are returning. */
+            iter->nextEntry = iter->entry->next;
+            return iter->entry;
+        }
+    }
+    return NULL;
+}
+
+void dictReleaseIterator(dictIterator *iter)
+{
+    if (!(iter->index == -1 && iter->table == 0)) {
+        if (iter->safe)
+            dictResumeRehashing(iter->d);
+        else
+            assert(iter->fingerprint == dictFingerprint(iter->d));
+    }
+    zfree(iter);
+}
+
+/* Return a random entry from the hash table. Useful to
+ * implement randomized algorithms */
+dictEntry *dictGetRandomKey(dict *d)
+{
+    dictEntry *he, *orighe;
+    unsigned long h;
+    int listlen, listele;
+
+    if (dictSize(d) == 0) return NULL;
+    if (dictIsRehashing(d)) _dictRehashStep(d);
+    if (dictIsRehashing(d)) {
+        do {
+            /* We are sure there are no elements in indexes from 0
+             * to rehashidx-1 */
+            h = d->rehashidx + (randomULong() % (dictSlots(d) - d->rehashidx));
+            he = (h >= d->ht[0].size) ? d->ht[1].table[h - d->ht[0].size] :
+                                      d->ht[0].table[h];
+        } while(he == NULL);
+    } else {
+        do {
+            h = randomULong() & d->ht[0].sizemask;
+            he = d->ht[0].table[h];
+        } while(he == NULL);
+    }
+
+    /* Now we found a non empty bucket, but it is a linked
+     * list and we need to get a random element from the list.
+     * The only sane way to do so is counting the elements and
+     * select a random index. */
+    listlen = 0;
+    orighe = he;
+    while(he) {
+        he = he->next;
+        listlen++;
+    }
+    listele = random() % listlen;
+    he = orighe;
+    while(listele--) he = he->next;
+    return he;
+}
+
+/* This function samples the dictionary to return a few keys from random
+ * locations.
+ *
+ * It does not guarantee to return all the keys specified in 'count', nor
+ * it does guarantee to return non-duplicated elements, however it will make
+ * some effort to do both things.
+ *
+ * Returned pointers to hash table entries are stored into 'des' that
+ * points to an array of dictEntry pointers. The array must have room for
+ * at least 'count' elements, that is the argument we pass to the function
+ * to tell how many random elements we need.
+ *
+ * The function returns the number of items stored into 'des', that may
+ * be less than 'count' if the hash table has less than 'count' elements
+ * inside, or if not enough elements were found in a reasonable amount of
+ * steps.
+ *
+ * Note that this function is not suitable when you need a good distribution
+ * of the returned items, but only when you need to "sample" a given number
+ * of continuous elements to run some kind of algorithm or to produce
+ * statistics. However the function is much faster than dictGetRandomKey()
+ * at producing N elements. */
+unsigned int dictGetSomeKeys(dict *d, dictEntry **des, unsigned int count) {
+    unsigned long j; /* internal hash table id, 0 or 1. */
+    unsigned long tables; /* 1 or 2 tables? */
+    unsigned long stored = 0, maxsizemask;
+    unsigned long maxsteps;
+
+    if (dictSize(d) < count) count = dictSize(d);
+    maxsteps = count*10;
+
+    /* Try to do a rehashing work proportional to 'count'. */
+    for (j = 0; j < count; j++) {
+        if (dictIsRehashing(d))
+            _dictRehashStep(d);
+        else
+            break;
+    }
+
+    tables = dictIsRehashing(d) ? 2 : 1;
+    maxsizemask = d->ht[0].sizemask;
+    if (tables > 1 && maxsizemask < d->ht[1].sizemask)
+        maxsizemask = d->ht[1].sizemask;
+
+    /* Pick a random point inside the larger table. */
+    unsigned long i = randomULong() & maxsizemask;
+    unsigned long emptylen = 0; /* Continuous empty entries so far. */
+    while(stored < count && maxsteps--) {
+        for (j = 0; j < tables; j++) {
+            /* Invariant of the dict.c rehashing: up to the indexes already
+             * visited in ht[0] during the rehashing, there are no populated
+             * buckets, so we can skip ht[0] for indexes between 0 and idx-1. */
+            if (tables == 2 && j == 0 && i < (unsigned long) d->rehashidx) {
+                /* Moreover, if we are currently out of range in the second
+                 * table, there will be no elements in both tables up to
+                 * the current rehashing index, so we jump if possible.
+                 * (this happens when going from big to small table). */
+                if (i >= d->ht[1].size)
+                    i = d->rehashidx;
+                else
+                    continue;
+            }
+            if (i >= d->ht[j].size) continue; /* Out of range for this table. */
+            dictEntry *he = d->ht[j].table[i];
+
+            /* Count contiguous empty buckets, and jump to other
+             * locations if they reach 'count' (with a minimum of 5). */
+            if (he == NULL) {
+                emptylen++;
+                if (emptylen >= 5 && emptylen > count) {
+                    i = randomULong() & maxsizemask;
+                    emptylen = 0;
+                }
+            } else {
+                emptylen = 0;
+                while (he) {
+                    /* Collect all the elements of the buckets found non
+                     * empty while iterating. */
+                    *des = he;
+                    des++;
+                    he = he->next;
+                    stored++;
+                    if (stored == count) return stored;
+                }
+            }
+        }
+        i = (i+1) & maxsizemask;
+    }
+    return stored;
+}
+
+/* This is like dictGetRandomKey() from the POV of the API, but will do more
+ * work to ensure a better distribution of the returned element.
+ *
+ * This function improves the distribution because the dictGetRandomKey()
+ * problem is that it selects a random bucket, then it selects a random
+ * element from the chain in the bucket. However elements being in different
+ * chain lengths will have different probabilities of being reported. With
+ * this function instead what we do is to consider a "linear" range of the table
+ * that may be constituted of N buckets with chains of different lengths
+ * appearing one after the other. Then we report a random element in the range.
+ * In this way we smooth away the problem of different chain lengths. */
+#define GETFAIR_NUM_ENTRIES 15
+dictEntry *dictGetFairRandomKey(dict *d) {
+    dictEntry *entries[GETFAIR_NUM_ENTRIES];
+    unsigned int count = dictGetSomeKeys(d,entries,GETFAIR_NUM_ENTRIES);
+    /* Note that dictGetSomeKeys() may return zero elements in an unlucky
+     * run() even if there are actually elements inside the hash table. So
+     * when we get zero, we call the true dictGetRandomKey() that will always
+     * yield the element if the hash table has at least one. */
+    if (count == 0) return dictGetRandomKey(d);
+    unsigned int idx = rand() % count;
+    return entries[idx];
+}
+
+/* Function to reverse bits. Algorithm from:
+ * http://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel */
+static unsigned long rev(unsigned long v) {
+    unsigned long s = CHAR_BIT * sizeof(v); // bit size; must be power of 2
+    unsigned long mask = ~0UL;
+    while ((s >>= 1) > 0) {
+        mask ^= (mask << s);
+        v = ((v >> s) & mask) | ((v << s) & ~mask);
+    }
+    return v;
+}
+
+/* dictScan() is used to iterate over the elements of a dictionary.
+ *
+ * Iterating works the following way:
+ *
+ * 1) Initially you call the function using a cursor (v) value of 0.
+ * 2) The function performs one step of the iteration, and returns the
+ *    new cursor value you must use in the next call.
+ * 3) When the returned cursor is 0, the iteration is complete.
+ *
+ * The function guarantees all elements present in the
+ * dictionary get returned between the start and end of the iteration.
+ * However it is possible some elements get returned multiple times.
+ *
+ * For every element returned, the callback argument 'fn' is
+ * called with 'privdata' as first argument and the dictionary entry
+ * 'de' as second argument.
+ *
+ * HOW IT WORKS.
+ *
+ * The iteration algorithm was designed by Pieter Noordhuis.
+ * The main idea is to increment a cursor starting from the higher order
+ * bits. That is, instead of incrementing the cursor normally, the bits
+ * of the cursor are reversed, then the cursor is incremented, and finally
+ * the bits are reversed again.
+ *
+ * This strategy is needed because the hash table may be resized between
+ * iteration calls.
+ *
+ * dict.c hash tables are always power of two in size, and they
+ * use chaining, so the position of an element in a given table is given
+ * by computing the bitwise AND between Hash(key) and SIZE-1
+ * (where SIZE-1 is always the mask that is equivalent to taking the rest
+ *  of the division between the Hash of the key and SIZE).
+ *
+ * For example if the current hash table size is 16, the mask is
+ * (in binary) 1111. The position of a key in the hash table will always be
+ * the last four bits of the hash output, and so forth.
+ *
+ * WHAT HAPPENS IF THE TABLE CHANGES IN SIZE?
+ *
+ * If the hash table grows, elements can go anywhere in one multiple of
+ * the old bucket: for example let's say we already iterated with
+ * a 4 bit cursor 1100 (the mask is 1111 because hash table size = 16).
+ *
+ * If the hash table will be resized to 64 elements, then the new mask will
+ * be 111111. The new buckets you obtain by substituting in ??1100
+ * with either 0 or 1 can be targeted only by keys we already visited
+ * when scanning the bucket 1100 in the smaller hash table.
+ *
+ * By iterating the higher bits first, because of the inverted counter, the
+ * cursor does not need to restart if the table size gets bigger. It will
+ * continue iterating using cursors without '1100' at the end, and also
+ * without any other combination of the final 4 bits already explored.
+ *
+ * Similarly when the table size shrinks over time, for example going from
+ * 16 to 8, if a combination of the lower three bits (the mask for size 8
+ * is 111) were already completely explored, it would not be visited again
+ * because we are sure we tried, for example, both 0111 and 1111 (all the
+ * variations of the higher bit) so we don't need to test it again.
+ *
+ * WAIT... YOU HAVE *TWO* TABLES DURING REHASHING!
+ *
+ * Yes, this is true, but we always iterate the smaller table first, then
+ * we test all the expansions of the current cursor into the larger
+ * table. For example if the current cursor is 101 and we also have a
+ * larger table of size 16, we also test (0)101 and (1)101 inside the larger
+ * table. This reduces the problem back to having only one table, where
+ * the larger one, if it exists, is just an expansion of the smaller one.
+ *
+ * LIMITATIONS
+ *
+ * This iterator is completely stateless, and this is a huge advantage,
+ * including no additional memory used.
+ *
+ * The disadvantages resulting from this design are:
+ *
+ * 1) It is possible we return elements more than once. However this is usually
+ *    easy to deal with in the application level.
+ * 2) The iterator must return multiple elements per call, as it needs to always
+ *    return all the keys chained in a given bucket, and all the expansions, so
+ *    we are sure we don't miss keys moving during rehashing.
+ * 3) The reverse cursor is somewhat hard to understand at first, but this
+ *    comment is supposed to help.
+ */
+unsigned long dictScan(dict *d,
+                       unsigned long v,
+                       dictScanFunction *fn,
+                       dictScanBucketFunction* bucketfn,
+                       void *privdata)
+{
+    dictht *t0, *t1;
+    const dictEntry *de, *next;
+    unsigned long m0, m1;
+
+    if (dictSize(d) == 0) return 0;
+
+    /* This is needed in case the scan callback tries to do dictFind or alike. */
+    dictPauseRehashing(d);
+
+    if (!dictIsRehashing(d)) {
+        t0 = &(d->ht[0]);
+        m0 = t0->sizemask;
+
+        /* Emit entries at cursor */
+        if (bucketfn) bucketfn(privdata, &t0->table[v & m0]);
+        de = t0->table[v & m0];
+        while (de) {
+            next = de->next;
+            fn(privdata, de);
+            de = next;
+        }
+
+        /* Set unmasked bits so incrementing the reversed cursor
+         * operates on the masked bits */
+        v |= ~m0;
+
+        /* Increment the reverse cursor */
+        v = rev(v);
+        v++;
+        v = rev(v);
+
+    } else {
+        t0 = &d->ht[0];
+        t1 = &d->ht[1];
+
+        /* Make sure t0 is the smaller and t1 is the bigger table */
+        if (t0->size > t1->size) {
+            t0 = &d->ht[1];
+            t1 = &d->ht[0];
+        }
+
+        m0 = t0->sizemask;
+        m1 = t1->sizemask;
+
+        /* Emit entries at cursor */
+        if (bucketfn) bucketfn(privdata, &t0->table[v & m0]);
+        de = t0->table[v & m0];
+        while (de) {
+            next = de->next;
+            fn(privdata, de);
+            de = next;
+        }
+
+        /* Iterate over indices in larger table that are the expansion
+         * of the index pointed to by the cursor in the smaller table */
+        do {
+            /* Emit entries at cursor */
+            if (bucketfn) bucketfn(privdata, &t1->table[v & m1]);
+            de = t1->table[v & m1];
+            while (de) {
+                next = de->next;
+                fn(privdata, de);
+                de = next;
+            }
+
+            /* Increment the reverse cursor not covered by the smaller mask.*/
+            v |= ~m1;
+            v = rev(v);
+            v++;
+            v = rev(v);
+
+            /* Continue while bits covered by mask difference is non-zero */
+        } while (v & (m0 ^ m1));
+    }
+
+    dictResumeRehashing(d);
+
+    return v;
+}
+
+/* ------------------------- private functions ------------------------------ */
+
+/* Because we may need to allocate huge memory chunk at once when dict
+ * expands, we will check this allocation is allowed or not if the dict
+ * type has expandAllowed member function. */
+static int dictTypeExpandAllowed(dict *d) {
+    if (d->type->expandAllowed == NULL) return 1;
+    return d->type->expandAllowed(
+                    _dictNextPower(d->ht[0].used + 1) * sizeof(dictEntry*),
+                    (double)d->ht[0].used / d->ht[0].size);
+}
+
+/* Expand the hash table if needed */
+static int _dictExpandIfNeeded(dict *d)
+{
+    /* Incremental rehashing already in progress. Return. */
+    if (dictIsRehashing(d)) return DICT_OK;
+
+    /* If the hash table is empty expand it to the initial size. */
+    if (d->ht[0].size == 0) return dictExpand(d, DICT_HT_INITIAL_SIZE);
+
+    /* If we reached the 1:1 ratio, and we are allowed to resize the hash
+     * table (global setting) or we should avoid it but the ratio between
+     * elements/buckets is over the "safe" threshold, we resize doubling
+     * the number of buckets. */
+    if (d->ht[0].used >= d->ht[0].size &&
+        (dict_can_resize ||
+         d->ht[0].used/d->ht[0].size > dict_force_resize_ratio) &&
+        dictTypeExpandAllowed(d))
+    {
+        return dictExpand(d, d->ht[0].used + 1);
+    }
+    return DICT_OK;
+}
+
+/* Our hash table capability is a power of two */
+static unsigned long _dictNextPower(unsigned long size)
+{
+    unsigned long i = DICT_HT_INITIAL_SIZE;
+
+    if (size >= LONG_MAX) return LONG_MAX + 1LU;
+    while(1) {
+        if (i >= size)
+            return i;
+        i *= 2;
+    }
+}
+
+/* Returns the index of a free slot that can be populated with
+ * a hash entry for the given 'key'.
+ * If the key already exists, -1 is returned
+ * and the optional output parameter may be filled.
+ *
+ * Note that if we are in the process of rehashing the hash table, the
+ * index is always returned in the context of the second (new) hash table. */
+static long _dictKeyIndex(dict *d, const void *key, uint64_t hash, dictEntry **existing)
+{
+    unsigned long idx, table;
+    dictEntry *he;
+    if (existing) *existing = NULL;
+
+    /* Expand the hash table if needed */
+    if (_dictExpandIfNeeded(d) == DICT_ERR)
+        return -1;
+    for (table = 0; table <= 1; table++) {
+        idx = hash & d->ht[table].sizemask;
+        /* Search if this slot does not already contain the given key */
+        he = d->ht[table].table[idx];
+        while(he) {
+            if (key==he->key || dictCompareKeys(d, key, he->key)) {
+                if (existing) *existing = he;
+                return -1;
+            }
+            he = he->next;
+        }
+        if (!dictIsRehashing(d)) break;
+    }
+    return idx;
+}
+
+void dictEmpty(dict *d, void(callback)(void*)) {
+    _dictClear(d,&d->ht[0],callback);
+    _dictClear(d,&d->ht[1],callback);
+    d->rehashidx = -1;
+    d->pauserehash = 0;
+}
+
+void dictEnableResize(void) {
+    dict_can_resize = 1;
+}
+
+void dictDisableResize(void) {
+    dict_can_resize = 0;
+}
+
+uint64_t dictGetHash(dict *d, const void *key) {
+    return dictHashKey(d, key);
+}
+
+/* Finds the dictEntry reference by using pointer and pre-calculated hash.
+ * oldkey is a dead pointer and should not be accessed.
+ * the hash value should be provided using dictGetHash.
+ * no string / key comparison is performed.
+ * return value is the reference to the dictEntry if found, or NULL if not found. */
+dictEntry **dictFindEntryRefByPtrAndHash(dict *d, const void *oldptr, uint64_t hash) {
+    dictEntry *he, **heref;
+    unsigned long idx, table;
+
+    if (dictSize(d) == 0) return NULL; /* dict is empty */
+    for (table = 0; table <= 1; table++) {
+        idx = hash & d->ht[table].sizemask;
+        heref = &d->ht[table].table[idx];
+        he = *heref;
+        while(he) {
+            if (oldptr==he->key)
+                return heref;
+            heref = &he->next;
+            he = *heref;
+        }
+        if (!dictIsRehashing(d)) return NULL;
+    }
+    return NULL;
+}
+
+/* ------------------------------- Debugging ---------------------------------*/
+
+#define DICT_STATS_VECTLEN 50
+size_t _dictGetStatsHt(char *buf, size_t bufsize, dictht *ht, int tableid) {
+    unsigned long i, slots = 0, chainlen, maxchainlen = 0;
+    unsigned long totchainlen = 0;
+    unsigned long clvector[DICT_STATS_VECTLEN];
+    size_t l = 0;
+
+    if (ht->used == 0) {
+        return snprintf(buf,bufsize,
+            "No stats available for empty dictionaries\n");
+    }
+
+    /* Compute stats. */
+    for (i = 0; i < DICT_STATS_VECTLEN; i++) clvector[i] = 0;
+    for (i = 0; i < ht->size; i++) {
+        dictEntry *he;
+
+        if (ht->table[i] == NULL) {
+            clvector[0]++;
+            continue;
+        }
+        slots++;
+        /* For each hash entry on this slot... */
+        chainlen = 0;
+        he = ht->table[i];
+        while(he) {
+            chainlen++;
+            he = he->next;
+        }
+        clvector[(chainlen < DICT_STATS_VECTLEN) ? chainlen : (DICT_STATS_VECTLEN-1)]++;
+        if (chainlen > maxchainlen) maxchainlen = chainlen;
+        totchainlen += chainlen;
+    }
+
+    /* Generate human readable stats. */
+    l += snprintf(buf+l,bufsize-l,
+        "Hash table %d stats (%s):\n"
+        " table size: %lu\n"
+        " number of elements: %lu\n"
+        " different slots: %lu\n"
+        " max chain length: %lu\n"
+        " avg chain length (counted): %.02f\n"
+        " avg chain length (computed): %.02f\n"
+        " Chain length distribution:\n",
+        tableid, (tableid == 0) ? "main hash table" : "rehashing target",
+        ht->size, ht->used, slots, maxchainlen,
+        (float)totchainlen/slots, (float)ht->used/slots);
+
+    for (i = 0; i < DICT_STATS_VECTLEN-1; i++) {
+        if (clvector[i] == 0) continue;
+        if (l >= bufsize) break;
+        l += snprintf(buf+l,bufsize-l,
+            "   %s%ld: %ld (%.02f%%)\n",
+            (i == DICT_STATS_VECTLEN-1)?">= ":"",
+            i, clvector[i], ((float)clvector[i]/ht->size)*100);
+    }
+
+    /* Unlike snprintf(), return the number of characters actually written. */
+    if (bufsize) buf[bufsize-1] = '\0';
+    return strlen(buf);
+}
+
+void dictGetStats(char *buf, size_t bufsize, dict *d) {
+    size_t l;
+    char *orig_buf = buf;
+    size_t orig_bufsize = bufsize;
+
+    l = _dictGetStatsHt(buf,bufsize,&d->ht[0],0);
+    buf += l;
+    bufsize -= l;
+    if (dictIsRehashing(d) && bufsize > 0) {
+        _dictGetStatsHt(buf,bufsize,&d->ht[1],1);
+    }
+    /* Make sure there is a NULL term at the end. */
+    if (orig_bufsize) orig_buf[orig_bufsize-1] = '\0';
+}
+
+/* ------------------------------- Benchmark ---------------------------------*/
+
+#ifdef REDIS_TEST
+
+uint64_t hashCallback(const void *key) {
+    return dictGenHashFunction((unsigned char*)key, strlen((char*)key));
+}
+
+int compareCallback(void *privdata, const void *key1, const void *key2) {
+    int l1,l2;
+    DICT_NOTUSED(privdata);
+
+    l1 = strlen((char*)key1);
+    l2 = strlen((char*)key2);
+    if (l1 != l2) return 0;
+    return memcmp(key1, key2, l1) == 0;
+}
+
+void freeCallback(void *privdata, void *val) {
+    DICT_NOTUSED(privdata);
+
+    zfree(val);
+}
+
+char *stringFromLongLong(long long value) {
+    char buf[32];
+    int len;
+    char *s;
+
+    len = sprintf(buf,"%lld",value);
+    s = zmalloc(len+1);
+    memcpy(s, buf, len);
+    s[len] = '\0';
+    return s;
+}
+
+dictType BenchmarkDictType = {
+    hashCallback,
+    NULL,
+    NULL,
+    compareCallback,
+    freeCallback,
+    NULL,
+    NULL
+};
+
+#define start_benchmark() start = timeInMilliseconds()
+#define end_benchmark(msg) do { \
+    elapsed = timeInMilliseconds()-start; \
+    printf(msg ": %ld items in %lld ms\n", count, elapsed); \
+} while(0)
+
+/* ./redis-server test dict [<count> | --accurate] */
+int dictTest(int argc, char **argv, int accurate) {
+    long j;
+    long long start, elapsed;
+    dict *dict = dictCreate(&BenchmarkDictType,NULL);
+    long count = 0;
+
+    if (argc == 4) {
+        if (accurate) {
+            count = 5000000;
+        } else {
+            count = strtol(argv[3],NULL,10);
+        }
+    } else {
+        count = 5000;
+    }
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        int retval = dictAdd(dict,stringFromLongLong(j),(void*)j);
+        assert(retval == DICT_OK);
+    }
+    end_benchmark("Inserting");
+    assert((long)dictSize(dict) == count);
+
+    /* Wait for rehashing. */
+    while (dictIsRehashing(dict)) {
+        dictRehashMilliseconds(dict,100);
+    }
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        char *key = stringFromLongLong(j);
+        dictEntry *de = dictFind(dict,key);
+        assert(de != NULL);
+        zfree(key);
+    }
+    end_benchmark("Linear access of existing elements");
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        char *key = stringFromLongLong(j);
+        dictEntry *de = dictFind(dict,key);
+        assert(de != NULL);
+        zfree(key);
+    }
+    end_benchmark("Linear access of existing elements (2nd round)");
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        char *key = stringFromLongLong(rand() % count);
+        dictEntry *de = dictFind(dict,key);
+        assert(de != NULL);
+        zfree(key);
+    }
+    end_benchmark("Random access of existing elements");
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        dictEntry *de = dictGetRandomKey(dict);
+        assert(de != NULL);
+    }
+    end_benchmark("Accessing random keys");
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        char *key = stringFromLongLong(rand() % count);
+        key[0] = 'X';
+        dictEntry *de = dictFind(dict,key);
+        assert(de == NULL);
+        zfree(key);
+    }
+    end_benchmark("Accessing missing");
+
+    start_benchmark();
+    for (j = 0; j < count; j++) {
+        char *key = stringFromLongLong(j);
+        int retval = dictDelete(dict,key);
+        assert(retval == DICT_OK);
+        key[0] += 17; /* Change first number to letter. */
+        retval = dictAdd(dict,key,(void*)j);
+        assert(retval == DICT_OK);
+    }
+    end_benchmark("Removing and adding");
+    dictRelease(dict);
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/dict.h b/redis-stable/src/dict.h
new file mode 100644
index 00000000..7e225896
--- /dev/null
+++ b/redis-stable/src/dict.h
@@ -0,0 +1,208 @@
+/* Hash Tables Implementation.
+ *
+ * This file implements in-memory hash tables with insert/del/replace/find/
+ * get-random-element operations. Hash tables will auto-resize if needed
+ * tables of power of two in size are used, collisions are handled by
+ * chaining. See the source code for more information... :)
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __DICT_H
+#define __DICT_H
+
+#include "mt19937-64.h"
+#include <limits.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+#define DICT_OK 0
+#define DICT_ERR 1
+
+/* Unused arguments generate annoying warnings... */
+#define DICT_NOTUSED(V) ((void) V)
+
+typedef struct dictEntry {
+    void *key;
+    union {
+        void *val;
+        uint64_t u64;
+        int64_t s64;
+        double d;
+    } v;
+    struct dictEntry *next;
+} dictEntry;
+
+typedef struct dictType {
+    uint64_t (*hashFunction)(const void *key);
+    void *(*keyDup)(void *privdata, const void *key);
+    void *(*valDup)(void *privdata, const void *obj);
+    int (*keyCompare)(void *privdata, const void *key1, const void *key2);
+    void (*keyDestructor)(void *privdata, void *key);
+    void (*valDestructor)(void *privdata, void *obj);
+    int (*expandAllowed)(size_t moreMem, double usedRatio);
+} dictType;
+
+/* This is our hash table structure. Every dictionary has two of this as we
+ * implement incremental rehashing, for the old to the new table. */
+typedef struct dictht {
+    dictEntry **table;
+    unsigned long size;
+    unsigned long sizemask;
+    unsigned long used;
+} dictht;
+
+typedef struct dict {
+    dictType *type;
+    void *privdata;
+    dictht ht[2];
+    long rehashidx; /* rehashing not in progress if rehashidx == -1 */
+    int16_t pauserehash; /* If >0 rehashing is paused (<0 indicates coding error) */
+} dict;
+
+/* If safe is set to 1 this is a safe iterator, that means, you can call
+ * dictAdd, dictFind, and other functions against the dictionary even while
+ * iterating. Otherwise it is a non safe iterator, and only dictNext()
+ * should be called while iterating. */
+typedef struct dictIterator {
+    dict *d;
+    long index;
+    int table, safe;
+    dictEntry *entry, *nextEntry;
+    /* unsafe iterator fingerprint for misuse detection. */
+    long long fingerprint;
+} dictIterator;
+
+typedef void (dictScanFunction)(void *privdata, const dictEntry *de);
+typedef void (dictScanBucketFunction)(void *privdata, dictEntry **bucketref);
+
+/* This is the initial size of every hash table */
+#define DICT_HT_INITIAL_SIZE     4
+
+/* ------------------------------- Macros ------------------------------------*/
+#define dictFreeVal(d, entry) \
+    if ((d)->type->valDestructor) \
+        (d)->type->valDestructor((d)->privdata, (entry)->v.val)
+
+#define dictSetVal(d, entry, _val_) do { \
+    if ((d)->type->valDup) \
+        (entry)->v.val = (d)->type->valDup((d)->privdata, _val_); \
+    else \
+        (entry)->v.val = (_val_); \
+} while(0)
+
+#define dictSetSignedIntegerVal(entry, _val_) \
+    do { (entry)->v.s64 = _val_; } while(0)
+
+#define dictSetUnsignedIntegerVal(entry, _val_) \
+    do { (entry)->v.u64 = _val_; } while(0)
+
+#define dictSetDoubleVal(entry, _val_) \
+    do { (entry)->v.d = _val_; } while(0)
+
+#define dictFreeKey(d, entry) \
+    if ((d)->type->keyDestructor) \
+        (d)->type->keyDestructor((d)->privdata, (entry)->key)
+
+#define dictSetKey(d, entry, _key_) do { \
+    if ((d)->type->keyDup) \
+        (entry)->key = (d)->type->keyDup((d)->privdata, _key_); \
+    else \
+        (entry)->key = (_key_); \
+} while(0)
+
+#define dictCompareKeys(d, key1, key2) \
+    (((d)->type->keyCompare) ? \
+        (d)->type->keyCompare((d)->privdata, key1, key2) : \
+        (key1) == (key2))
+
+#define dictHashKey(d, key) (d)->type->hashFunction(key)
+#define dictGetKey(he) ((he)->key)
+#define dictGetVal(he) ((he)->v.val)
+#define dictGetSignedIntegerVal(he) ((he)->v.s64)
+#define dictGetUnsignedIntegerVal(he) ((he)->v.u64)
+#define dictGetDoubleVal(he) ((he)->v.d)
+#define dictSlots(d) ((d)->ht[0].size+(d)->ht[1].size)
+#define dictSize(d) ((d)->ht[0].used+(d)->ht[1].used)
+#define dictIsRehashing(d) ((d)->rehashidx != -1)
+#define dictPauseRehashing(d) (d)->pauserehash++
+#define dictResumeRehashing(d) (d)->pauserehash--
+
+/* If our unsigned long type can store a 64 bit number, use a 64 bit PRNG. */
+#if ULONG_MAX >= 0xffffffffffffffff
+#define randomULong() ((unsigned long) genrand64_int64())
+#else
+#define randomULong() random()
+#endif
+
+/* API */
+dict *dictCreate(dictType *type, void *privDataPtr);
+int dictExpand(dict *d, unsigned long size);
+int dictTryExpand(dict *d, unsigned long size);
+int dictAdd(dict *d, void *key, void *val);
+dictEntry *dictAddRaw(dict *d, void *key, dictEntry **existing);
+dictEntry *dictAddOrFind(dict *d, void *key);
+int dictReplace(dict *d, void *key, void *val);
+int dictDelete(dict *d, const void *key);
+dictEntry *dictUnlink(dict *ht, const void *key);
+void dictFreeUnlinkedEntry(dict *d, dictEntry *he);
+void dictRelease(dict *d);
+dictEntry * dictFind(dict *d, const void *key);
+void *dictFetchValue(dict *d, const void *key);
+int dictResize(dict *d);
+dictIterator *dictGetIterator(dict *d);
+dictIterator *dictGetSafeIterator(dict *d);
+dictEntry *dictNext(dictIterator *iter);
+void dictReleaseIterator(dictIterator *iter);
+dictEntry *dictGetRandomKey(dict *d);
+dictEntry *dictGetFairRandomKey(dict *d);
+unsigned int dictGetSomeKeys(dict *d, dictEntry **des, unsigned int count);
+void dictGetStats(char *buf, size_t bufsize, dict *d);
+uint64_t dictGenHashFunction(const void *key, int len);
+uint64_t dictGenCaseHashFunction(const unsigned char *buf, int len);
+void dictEmpty(dict *d, void(callback)(void*));
+void dictEnableResize(void);
+void dictDisableResize(void);
+int dictRehash(dict *d, int n);
+int dictRehashMilliseconds(dict *d, int ms);
+void dictSetHashFunctionSeed(uint8_t *seed);
+uint8_t *dictGetHashFunctionSeed(void);
+unsigned long dictScan(dict *d, unsigned long v, dictScanFunction *fn, dictScanBucketFunction *bucketfn, void *privdata);
+uint64_t dictGetHash(dict *d, const void *key);
+dictEntry **dictFindEntryRefByPtrAndHash(dict *d, const void *oldptr, uint64_t hash);
+
+/* Hash table types */
+extern dictType dictTypeHeapStringCopyKey;
+extern dictType dictTypeHeapStrings;
+extern dictType dictTypeHeapStringCopyKeyValue;
+
+#ifdef REDIS_TEST
+int dictTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif /* __DICT_H */
diff --git a/redis-stable/src/endianconv.c b/redis-stable/src/endianconv.c
new file mode 100644
index 00000000..98ed405a
--- /dev/null
+++ b/redis-stable/src/endianconv.c
@@ -0,0 +1,129 @@
+/* endinconv.c -- Endian conversions utilities.
+ *
+ * This functions are never called directly, but always using the macros
+ * defined into endianconv.h, this way we define everything is a non-operation
+ * if the arch is already little endian.
+ *
+ * Redis tries to encode everything as little endian (but a few things that need
+ * to be backward compatible are still in big endian) because most of the
+ * production environments are little endian, and we have a lot of conversions
+ * in a few places because ziplists, intsets, zipmaps, need to be endian-neutral
+ * even in memory, since they are serialized on RDB files directly with a single
+ * write(2) without other additional steps.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2011-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include <stdint.h>
+
+/* Toggle the 16 bit unsigned integer pointed by *p from little endian to
+ * big endian */
+void memrev16(void *p) {
+    unsigned char *x = p, t;
+
+    t = x[0];
+    x[0] = x[1];
+    x[1] = t;
+}
+
+/* Toggle the 32 bit unsigned integer pointed by *p from little endian to
+ * big endian */
+void memrev32(void *p) {
+    unsigned char *x = p, t;
+
+    t = x[0];
+    x[0] = x[3];
+    x[3] = t;
+    t = x[1];
+    x[1] = x[2];
+    x[2] = t;
+}
+
+/* Toggle the 64 bit unsigned integer pointed by *p from little endian to
+ * big endian */
+void memrev64(void *p) {
+    unsigned char *x = p, t;
+
+    t = x[0];
+    x[0] = x[7];
+    x[7] = t;
+    t = x[1];
+    x[1] = x[6];
+    x[6] = t;
+    t = x[2];
+    x[2] = x[5];
+    x[5] = t;
+    t = x[3];
+    x[3] = x[4];
+    x[4] = t;
+}
+
+uint16_t intrev16(uint16_t v) {
+    memrev16(&v);
+    return v;
+}
+
+uint32_t intrev32(uint32_t v) {
+    memrev32(&v);
+    return v;
+}
+
+uint64_t intrev64(uint64_t v) {
+    memrev64(&v);
+    return v;
+}
+
+#ifdef REDIS_TEST
+#include <stdio.h>
+
+#define UNUSED(x) (void)(x)
+int endianconvTest(int argc, char *argv[], int accurate) {
+    char buf[32];
+
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    sprintf(buf,"ciaoroma");
+    memrev16(buf);
+    printf("%s\n", buf);
+
+    sprintf(buf,"ciaoroma");
+    memrev32(buf);
+    printf("%s\n", buf);
+
+    sprintf(buf,"ciaoroma");
+    memrev64(buf);
+    printf("%s\n", buf);
+
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/endianconv.h b/redis-stable/src/endianconv.h
new file mode 100644
index 00000000..00474978
--- /dev/null
+++ b/redis-stable/src/endianconv.h
@@ -0,0 +1,78 @@
+/* See endianconv.c top comments for more information
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2011-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __ENDIANCONV_H
+#define __ENDIANCONV_H
+
+#include "config.h"
+#include <stdint.h>
+
+void memrev16(void *p);
+void memrev32(void *p);
+void memrev64(void *p);
+uint16_t intrev16(uint16_t v);
+uint32_t intrev32(uint32_t v);
+uint64_t intrev64(uint64_t v);
+
+/* variants of the function doing the actual conversion only if the target
+ * host is big endian */
+#if (BYTE_ORDER == LITTLE_ENDIAN)
+#define memrev16ifbe(p) ((void)(0))
+#define memrev32ifbe(p) ((void)(0))
+#define memrev64ifbe(p) ((void)(0))
+#define intrev16ifbe(v) (v)
+#define intrev32ifbe(v) (v)
+#define intrev64ifbe(v) (v)
+#else
+#define memrev16ifbe(p) memrev16(p)
+#define memrev32ifbe(p) memrev32(p)
+#define memrev64ifbe(p) memrev64(p)
+#define intrev16ifbe(v) intrev16(v)
+#define intrev32ifbe(v) intrev32(v)
+#define intrev64ifbe(v) intrev64(v)
+#endif
+
+/* The functions htonu64() and ntohu64() convert the specified value to
+ * network byte ordering and back. In big endian systems they are no-ops. */
+#if (BYTE_ORDER == BIG_ENDIAN)
+#define htonu64(v) (v)
+#define ntohu64(v) (v)
+#else
+#define htonu64(v) intrev64(v)
+#define ntohu64(v) intrev64(v)
+#endif
+
+#ifdef REDIS_TEST
+int endianconvTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif
diff --git a/redis-stable/src/evict.c b/redis-stable/src/evict.c
new file mode 100644
index 00000000..d3cdaaa8
--- /dev/null
+++ b/redis-stable/src/evict.c
@@ -0,0 +1,710 @@
+/* Maxmemory directive handling (LRU eviction and other policies).
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "bio.h"
+#include "atomicvar.h"
+#include <math.h>
+
+/* ----------------------------------------------------------------------------
+ * Data structures
+ * --------------------------------------------------------------------------*/
+
+/* To improve the quality of the LRU approximation we take a set of keys
+ * that are good candidate for eviction across performEvictions() calls.
+ *
+ * Entries inside the eviction pool are taken ordered by idle time, putting
+ * greater idle times to the right (ascending order).
+ *
+ * When an LFU policy is used instead, a reverse frequency indication is used
+ * instead of the idle time, so that we still evict by larger value (larger
+ * inverse frequency means to evict keys with the least frequent accesses).
+ *
+ * Empty entries have the key pointer set to NULL. */
+#define EVPOOL_SIZE 16
+#define EVPOOL_CACHED_SDS_SIZE 255
+struct evictionPoolEntry {
+    unsigned long long idle;    /* Object idle time (inverse frequency for LFU) */
+    sds key;                    /* Key name. */
+    sds cached;                 /* Cached SDS object for key name. */
+    int dbid;                   /* Key DB number. */
+};
+
+static struct evictionPoolEntry *EvictionPoolLRU;
+
+/* ----------------------------------------------------------------------------
+ * Implementation of eviction, aging and LRU
+ * --------------------------------------------------------------------------*/
+
+/* Return the LRU clock, based on the clock resolution. This is a time
+ * in a reduced-bits format that can be used to set and check the
+ * object->lru field of redisObject structures. */
+unsigned int getLRUClock(void) {
+    return (mstime()/LRU_CLOCK_RESOLUTION) & LRU_CLOCK_MAX;
+}
+
+/* This function is used to obtain the current LRU clock.
+ * If the current resolution is lower than the frequency we refresh the
+ * LRU clock (as it should be in production servers) we return the
+ * precomputed value, otherwise we need to resort to a system call. */
+unsigned int LRU_CLOCK(void) {
+    unsigned int lruclock;
+    if (1000/server.hz <= LRU_CLOCK_RESOLUTION) {
+        atomicGet(server.lruclock,lruclock);
+    } else {
+        lruclock = getLRUClock();
+    }
+    return lruclock;
+}
+
+/* Given an object returns the min number of milliseconds the object was never
+ * requested, using an approximated LRU algorithm. */
+unsigned long long estimateObjectIdleTime(robj *o) {
+    unsigned long long lruclock = LRU_CLOCK();
+    if (lruclock >= o->lru) {
+        return (lruclock - o->lru) * LRU_CLOCK_RESOLUTION;
+    } else {
+        return (lruclock + (LRU_CLOCK_MAX - o->lru)) *
+                    LRU_CLOCK_RESOLUTION;
+    }
+}
+
+/* LRU approximation algorithm
+ *
+ * Redis uses an approximation of the LRU algorithm that runs in constant
+ * memory. Every time there is a key to expire, we sample N keys (with
+ * N very small, usually in around 5) to populate a pool of best keys to
+ * evict of M keys (the pool size is defined by EVPOOL_SIZE).
+ *
+ * The N keys sampled are added in the pool of good keys to expire (the one
+ * with an old access time) if they are better than one of the current keys
+ * in the pool.
+ *
+ * After the pool is populated, the best key we have in the pool is expired.
+ * However note that we don't remove keys from the pool when they are deleted
+ * so the pool may contain keys that no longer exist.
+ *
+ * When we try to evict a key, and all the entries in the pool don't exist
+ * we populate it again. This time we'll be sure that the pool has at least
+ * one key that can be evicted, if there is at least one key that can be
+ * evicted in the whole database. */
+
+/* Create a new eviction pool. */
+void evictionPoolAlloc(void) {
+    struct evictionPoolEntry *ep;
+    int j;
+
+    ep = zmalloc(sizeof(*ep)*EVPOOL_SIZE);
+    for (j = 0; j < EVPOOL_SIZE; j++) {
+        ep[j].idle = 0;
+        ep[j].key = NULL;
+        ep[j].cached = sdsnewlen(NULL,EVPOOL_CACHED_SDS_SIZE);
+        ep[j].dbid = 0;
+    }
+    EvictionPoolLRU = ep;
+}
+
+/* This is an helper function for performEvictions(), it is used in order
+ * to populate the evictionPool with a few entries every time we want to
+ * expire a key. Keys with idle time bigger than one of the current
+ * keys are added. Keys are always added if there are free entries.
+ *
+ * We insert keys on place in ascending order, so keys with the smaller
+ * idle time are on the left, and keys with the higher idle time on the
+ * right. */
+
+void evictionPoolPopulate(int dbid, dict *sampledict, dict *keydict, struct evictionPoolEntry *pool) {
+    int j, k, count;
+    dictEntry *samples[server.maxmemory_samples];
+
+    count = dictGetSomeKeys(sampledict,samples,server.maxmemory_samples);
+    for (j = 0; j < count; j++) {
+        unsigned long long idle;
+        sds key;
+        robj *o;
+        dictEntry *de;
+
+        de = samples[j];
+        key = dictGetKey(de);
+
+        /* If the dictionary we are sampling from is not the main
+         * dictionary (but the expires one) we need to lookup the key
+         * again in the key dictionary to obtain the value object. */
+        if (server.maxmemory_policy != MAXMEMORY_VOLATILE_TTL) {
+            if (sampledict != keydict) de = dictFind(keydict, key);
+            o = dictGetVal(de);
+        }
+
+        /* Calculate the idle time according to the policy. This is called
+         * idle just because the code initially handled LRU, but is in fact
+         * just a score where an higher score means better candidate. */
+        if (server.maxmemory_policy & MAXMEMORY_FLAG_LRU) {
+            idle = estimateObjectIdleTime(o);
+        } else if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+            /* When we use an LRU policy, we sort the keys by idle time
+             * so that we expire keys starting from greater idle time.
+             * However when the policy is an LFU one, we have a frequency
+             * estimation, and we want to evict keys with lower frequency
+             * first. So inside the pool we put objects using the inverted
+             * frequency subtracting the actual frequency to the maximum
+             * frequency of 255. */
+            idle = 255-LFUDecrAndReturn(o);
+        } else if (server.maxmemory_policy == MAXMEMORY_VOLATILE_TTL) {
+            /* In this case the sooner the expire the better. */
+            idle = ULLONG_MAX - (long)dictGetVal(de);
+        } else {
+            serverPanic("Unknown eviction policy in evictionPoolPopulate()");
+        }
+
+        /* Insert the element inside the pool.
+         * First, find the first empty bucket or the first populated
+         * bucket that has an idle time smaller than our idle time. */
+        k = 0;
+        while (k < EVPOOL_SIZE &&
+               pool[k].key &&
+               pool[k].idle < idle) k++;
+        if (k == 0 && pool[EVPOOL_SIZE-1].key != NULL) {
+            /* Can't insert if the element is < the worst element we have
+             * and there are no empty buckets. */
+            continue;
+        } else if (k < EVPOOL_SIZE && pool[k].key == NULL) {
+            /* Inserting into empty position. No setup needed before insert. */
+        } else {
+            /* Inserting in the middle. Now k points to the first element
+             * greater than the element to insert.  */
+            if (pool[EVPOOL_SIZE-1].key == NULL) {
+                /* Free space on the right? Insert at k shifting
+                 * all the elements from k to end to the right. */
+
+                /* Save SDS before overwriting. */
+                sds cached = pool[EVPOOL_SIZE-1].cached;
+                memmove(pool+k+1,pool+k,
+                    sizeof(pool[0])*(EVPOOL_SIZE-k-1));
+                pool[k].cached = cached;
+            } else {
+                /* No free space on right? Insert at k-1 */
+                k--;
+                /* Shift all elements on the left of k (included) to the
+                 * left, so we discard the element with smaller idle time. */
+                sds cached = pool[0].cached; /* Save SDS before overwriting. */
+                if (pool[0].key != pool[0].cached) sdsfree(pool[0].key);
+                memmove(pool,pool+1,sizeof(pool[0])*k);
+                pool[k].cached = cached;
+            }
+        }
+
+        /* Try to reuse the cached SDS string allocated in the pool entry,
+         * because allocating and deallocating this object is costly
+         * (according to the profiler, not my fantasy. Remember:
+         * premature optimization bla bla bla. */
+        int klen = sdslen(key);
+        if (klen > EVPOOL_CACHED_SDS_SIZE) {
+            pool[k].key = sdsdup(key);
+        } else {
+            memcpy(pool[k].cached,key,klen+1);
+            sdssetlen(pool[k].cached,klen);
+            pool[k].key = pool[k].cached;
+        }
+        pool[k].idle = idle;
+        pool[k].dbid = dbid;
+    }
+}
+
+/* ----------------------------------------------------------------------------
+ * LFU (Least Frequently Used) implementation.
+
+ * We have 24 total bits of space in each object in order to implement
+ * an LFU (Least Frequently Used) eviction policy, since we re-use the
+ * LRU field for this purpose.
+ *
+ * We split the 24 bits into two fields:
+ *
+ *          16 bits      8 bits
+ *     +----------------+--------+
+ *     + Last decr time | LOG_C  |
+ *     +----------------+--------+
+ *
+ * LOG_C is a logarithmic counter that provides an indication of the access
+ * frequency. However this field must also be decremented otherwise what used
+ * to be a frequently accessed key in the past, will remain ranked like that
+ * forever, while we want the algorithm to adapt to access pattern changes.
+ *
+ * So the remaining 16 bits are used in order to store the "decrement time",
+ * a reduced-precision Unix time (we take 16 bits of the time converted
+ * in minutes since we don't care about wrapping around) where the LOG_C
+ * counter is halved if it has an high value, or just decremented if it
+ * has a low value.
+ *
+ * New keys don't start at zero, in order to have the ability to collect
+ * some accesses before being trashed away, so they start at COUNTER_INIT_VAL.
+ * The logarithmic increment performed on LOG_C takes care of COUNTER_INIT_VAL
+ * when incrementing the key, so that keys starting at COUNTER_INIT_VAL
+ * (or having a smaller value) have a very high chance of being incremented
+ * on access.
+ *
+ * During decrement, the value of the logarithmic counter is halved if
+ * its current value is greater than two times the COUNTER_INIT_VAL, otherwise
+ * it is just decremented by one.
+ * --------------------------------------------------------------------------*/
+
+/* Return the current time in minutes, just taking the least significant
+ * 16 bits. The returned time is suitable to be stored as LDT (last decrement
+ * time) for the LFU implementation. */
+unsigned long LFUGetTimeInMinutes(void) {
+    return (server.unixtime/60) & 65535;
+}
+
+/* Given an object last access time, compute the minimum number of minutes
+ * that elapsed since the last access. Handle overflow (ldt greater than
+ * the current 16 bits minutes time) considering the time as wrapping
+ * exactly once. */
+unsigned long LFUTimeElapsed(unsigned long ldt) {
+    unsigned long now = LFUGetTimeInMinutes();
+    if (now >= ldt) return now-ldt;
+    return 65535-ldt+now;
+}
+
+/* Logarithmically increment a counter. The greater is the current counter value
+ * the less likely is that it gets really implemented. Saturate it at 255. */
+uint8_t LFULogIncr(uint8_t counter) {
+    if (counter == 255) return 255;
+    double r = (double)rand()/RAND_MAX;
+    double baseval = counter - LFU_INIT_VAL;
+    if (baseval < 0) baseval = 0;
+    double p = 1.0/(baseval*server.lfu_log_factor+1);
+    if (r < p) counter++;
+    return counter;
+}
+
+/* If the object decrement time is reached decrement the LFU counter but
+ * do not update LFU fields of the object, we update the access time
+ * and counter in an explicit way when the object is really accessed.
+ * And we will times halve the counter according to the times of
+ * elapsed time than server.lfu_decay_time.
+ * Return the object frequency counter.
+ *
+ * This function is used in order to scan the dataset for the best object
+ * to fit: as we check for the candidate, we incrementally decrement the
+ * counter of the scanned objects if needed. */
+unsigned long LFUDecrAndReturn(robj *o) {
+    unsigned long ldt = o->lru >> 8;
+    unsigned long counter = o->lru & 255;
+    unsigned long num_periods = server.lfu_decay_time ? LFUTimeElapsed(ldt) / server.lfu_decay_time : 0;
+    if (num_periods)
+        counter = (num_periods > counter) ? 0 : counter - num_periods;
+    return counter;
+}
+
+/* We don't want to count AOF buffers and slaves output buffers as
+ * used memory: the eviction should use mostly data size. This function
+ * returns the sum of AOF and slaves buffer. */
+size_t freeMemoryGetNotCountedMemory(void) {
+    size_t overhead = 0;
+    int slaves = listLength(server.slaves);
+
+    if (slaves) {
+        listIter li;
+        listNode *ln;
+
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = listNodeValue(ln);
+            overhead += getClientOutputBufferMemoryUsage(slave);
+        }
+    }
+    if (server.aof_state != AOF_OFF) {
+        overhead += sdsalloc(server.aof_buf)+aofRewriteBufferSize();
+    }
+    return overhead;
+}
+
+/* Get the memory status from the point of view of the maxmemory directive:
+ * if the memory used is under the maxmemory setting then C_OK is returned.
+ * Otherwise, if we are over the memory limit, the function returns
+ * C_ERR.
+ *
+ * The function may return additional info via reference, only if the
+ * pointers to the respective arguments is not NULL. Certain fields are
+ * populated only when C_ERR is returned:
+ *
+ *  'total'     total amount of bytes used.
+ *              (Populated both for C_ERR and C_OK)
+ *
+ *  'logical'   the amount of memory used minus the slaves/AOF buffers.
+ *              (Populated when C_ERR is returned)
+ *
+ *  'tofree'    the amount of memory that should be released
+ *              in order to return back into the memory limits.
+ *              (Populated when C_ERR is returned)
+ *
+ *  'level'     this usually ranges from 0 to 1, and reports the amount of
+ *              memory currently used. May be > 1 if we are over the memory
+ *              limit.
+ *              (Populated both for C_ERR and C_OK)
+ */
+int getMaxmemoryState(size_t *total, size_t *logical, size_t *tofree, float *level) {
+    size_t mem_reported, mem_used, mem_tofree;
+
+    /* Check if we are over the memory usage limit. If we are not, no need
+     * to subtract the slaves output buffers. We can just return ASAP. */
+    mem_reported = zmalloc_used_memory();
+    if (total) *total = mem_reported;
+
+    /* We may return ASAP if there is no need to compute the level. */
+    int return_ok_asap = !server.maxmemory || mem_reported <= server.maxmemory;
+    if (return_ok_asap && !level) return C_OK;
+
+    /* Remove the size of slaves output buffers and AOF buffer from the
+     * count of used memory. */
+    mem_used = mem_reported;
+    size_t overhead = freeMemoryGetNotCountedMemory();
+    mem_used = (mem_used > overhead) ? mem_used-overhead : 0;
+
+    /* Compute the ratio of memory usage. */
+    if (level) {
+        if (!server.maxmemory) {
+            *level = 0;
+        } else {
+            *level = (float)mem_used / (float)server.maxmemory;
+        }
+    }
+
+    if (return_ok_asap) return C_OK;
+
+    /* Check if we are still over the memory limit. */
+    if (mem_used <= server.maxmemory) return C_OK;
+
+    /* Compute how much memory we need to free. */
+    mem_tofree = mem_used - server.maxmemory;
+
+    if (logical) *logical = mem_used;
+    if (tofree) *tofree = mem_tofree;
+
+    return C_ERR;
+}
+
+/* Return 1 if used memory is more than maxmemory after allocating more memory,
+ * return 0 if not. Redis may reject user's requests or evict some keys if used
+ * memory exceeds maxmemory, especially, when we allocate huge memory at once. */
+int overMaxmemoryAfterAlloc(size_t moremem) {
+    if (!server.maxmemory) return  0; /* No limit. */
+
+    /* Check quickly. */
+    size_t mem_used = zmalloc_used_memory();
+    if (mem_used + moremem <= server.maxmemory) return 0;
+
+    size_t overhead = freeMemoryGetNotCountedMemory();
+    mem_used = (mem_used > overhead) ? mem_used - overhead : 0;
+    return mem_used + moremem > server.maxmemory;
+}
+
+/* The evictionTimeProc is started when "maxmemory" has been breached and
+ * could not immediately be resolved.  This will spin the event loop with short
+ * eviction cycles until the "maxmemory" condition has resolved or there are no
+ * more evictable items.  */
+static int isEvictionProcRunning = 0;
+static int evictionTimeProc(
+        struct aeEventLoop *eventLoop, long long id, void *clientData) {
+    UNUSED(eventLoop);
+    UNUSED(id);
+    UNUSED(clientData);
+
+    if (performEvictions() == EVICT_RUNNING) return 0;  /* keep evicting */
+
+    /* For EVICT_OK - things are good, no need to keep evicting.
+     * For EVICT_FAIL - there is nothing left to evict.  */
+    isEvictionProcRunning = 0;
+    return AE_NOMORE;
+}
+
+/* Check if it's safe to perform evictions.
+ *   Returns 1 if evictions can be performed
+ *   Returns 0 if eviction processing should be skipped
+ */
+static int isSafeToPerformEvictions(void) {
+    /* - There must be no script in timeout condition.
+     * - Nor we are loading data right now.  */
+    if (server.lua_timedout || server.loading) return 0;
+
+    /* By default replicas should ignore maxmemory
+     * and just be masters exact copies. */
+    if (server.masterhost && server.repl_slave_ignore_maxmemory) return 0;
+
+    /* When clients are paused the dataset should be static not just from the
+     * POV of clients not being able to write, but also from the POV of
+     * expires and evictions of keys not being performed. */
+    if (checkClientPauseTimeoutAndReturnIfPaused()) return 0;
+
+    return 1;
+}
+
+/* Algorithm for converting tenacity (0-100) to a time limit.  */
+static unsigned long evictionTimeLimitUs() {
+    serverAssert(server.maxmemory_eviction_tenacity >= 0);
+    serverAssert(server.maxmemory_eviction_tenacity <= 100);
+
+    if (server.maxmemory_eviction_tenacity <= 10) {
+        /* A linear progression from 0..500us */
+        return 50uL * server.maxmemory_eviction_tenacity;
+    }
+
+    if (server.maxmemory_eviction_tenacity < 100) {
+        /* A 15% geometric progression, resulting in a limit of ~2 min at tenacity==99  */
+        return (unsigned long)(500.0 * pow(1.15, server.maxmemory_eviction_tenacity - 10.0));
+    }
+
+    return ULONG_MAX;   /* No limit to eviction time */
+}
+
+/* Check that memory usage is within the current "maxmemory" limit.  If over
+ * "maxmemory", attempt to free memory by evicting data (if it's safe to do so).
+ *
+ * It's possible for Redis to suddenly be significantly over the "maxmemory"
+ * setting.  This can happen if there is a large allocation (like a hash table
+ * resize) or even if the "maxmemory" setting is manually adjusted.  Because of
+ * this, it's important to evict for a managed period of time - otherwise Redis
+ * would become unresponsive while evicting.
+ *
+ * The goal of this function is to improve the memory situation - not to
+ * immediately resolve it.  In the case that some items have been evicted but
+ * the "maxmemory" limit has not been achieved, an aeTimeProc will be started
+ * which will continue to evict items until memory limits are achieved or
+ * nothing more is evictable.
+ *
+ * This should be called before execution of commands.  If EVICT_FAIL is
+ * returned, commands which will result in increased memory usage should be
+ * rejected.
+ *
+ * Returns:
+ *   EVICT_OK       - memory is OK or it's not possible to perform evictions now
+ *   EVICT_RUNNING  - memory is over the limit, but eviction is still processing
+ *   EVICT_FAIL     - memory is over the limit, and there's nothing to evict
+ * */
+int performEvictions(void) {
+    if (!isSafeToPerformEvictions()) return EVICT_OK;
+
+    int keys_freed = 0;
+    size_t mem_reported, mem_tofree;
+    long long mem_freed; /* May be negative */
+    mstime_t latency, eviction_latency;
+    long long delta;
+    int slaves = listLength(server.slaves);
+    int result = EVICT_FAIL;
+
+    if (getMaxmemoryState(&mem_reported,NULL,&mem_tofree,NULL) == C_OK)
+        return EVICT_OK;
+
+    if (server.maxmemory_policy == MAXMEMORY_NO_EVICTION)
+        return EVICT_FAIL;  /* We need to free memory, but policy forbids. */
+
+    unsigned long eviction_time_limit_us = evictionTimeLimitUs();
+
+    mem_freed = 0;
+
+    latencyStartMonitor(latency);
+
+    monotime evictionTimer;
+    elapsedStart(&evictionTimer);
+
+    while (mem_freed < (long long)mem_tofree) {
+        int j, k, i;
+        static unsigned int next_db = 0;
+        sds bestkey = NULL;
+        int bestdbid;
+        redisDb *db;
+        dict *dict;
+        dictEntry *de;
+
+        if (server.maxmemory_policy & (MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_LFU) ||
+            server.maxmemory_policy == MAXMEMORY_VOLATILE_TTL)
+        {
+            struct evictionPoolEntry *pool = EvictionPoolLRU;
+
+            while(bestkey == NULL) {
+                unsigned long total_keys = 0, keys;
+
+                /* We don't want to make local-db choices when expiring keys,
+                 * so to start populate the eviction pool sampling keys from
+                 * every DB. */
+                for (i = 0; i < server.dbnum; i++) {
+                    db = server.db+i;
+                    dict = (server.maxmemory_policy & MAXMEMORY_FLAG_ALLKEYS) ?
+                            db->dict : db->expires;
+                    if ((keys = dictSize(dict)) != 0) {
+                        evictionPoolPopulate(i, dict, db->dict, pool);
+                        total_keys += keys;
+                    }
+                }
+                if (!total_keys) break; /* No keys to evict. */
+
+                /* Go backward from best to worst element to evict. */
+                for (k = EVPOOL_SIZE-1; k >= 0; k--) {
+                    if (pool[k].key == NULL) continue;
+                    bestdbid = pool[k].dbid;
+
+                    if (server.maxmemory_policy & MAXMEMORY_FLAG_ALLKEYS) {
+                        de = dictFind(server.db[pool[k].dbid].dict,
+                            pool[k].key);
+                    } else {
+                        de = dictFind(server.db[pool[k].dbid].expires,
+                            pool[k].key);
+                    }
+
+                    /* Remove the entry from the pool. */
+                    if (pool[k].key != pool[k].cached)
+                        sdsfree(pool[k].key);
+                    pool[k].key = NULL;
+                    pool[k].idle = 0;
+
+                    /* If the key exists, is our pick. Otherwise it is
+                     * a ghost and we need to try the next element. */
+                    if (de) {
+                        bestkey = dictGetKey(de);
+                        break;
+                    } else {
+                        /* Ghost... Iterate again. */
+                    }
+                }
+            }
+        }
+
+        /* volatile-random and allkeys-random policy */
+        else if (server.maxmemory_policy == MAXMEMORY_ALLKEYS_RANDOM ||
+                 server.maxmemory_policy == MAXMEMORY_VOLATILE_RANDOM)
+        {
+            /* When evicting a random key, we try to evict a key for
+             * each DB, so we use the static 'next_db' variable to
+             * incrementally visit all DBs. */
+            for (i = 0; i < server.dbnum; i++) {
+                j = (++next_db) % server.dbnum;
+                db = server.db+j;
+                dict = (server.maxmemory_policy == MAXMEMORY_ALLKEYS_RANDOM) ?
+                        db->dict : db->expires;
+                if (dictSize(dict) != 0) {
+                    de = dictGetRandomKey(dict);
+                    bestkey = dictGetKey(de);
+                    bestdbid = j;
+                    break;
+                }
+            }
+        }
+
+        /* Finally remove the selected key. */
+        if (bestkey) {
+            db = server.db+bestdbid;
+            robj *keyobj = createStringObject(bestkey,sdslen(bestkey));
+            propagateExpire(db,keyobj,server.lazyfree_lazy_eviction);
+            /* We compute the amount of memory freed by db*Delete() alone.
+             * It is possible that actually the memory needed to propagate
+             * the DEL in AOF and replication link is greater than the one
+             * we are freeing removing the key, but we can't account for
+             * that otherwise we would never exit the loop.
+             *
+             * Same for CSC invalidation messages generated by signalModifiedKey.
+             *
+             * AOF and Output buffer memory will be freed eventually so
+             * we only care about memory used by the key space. */
+            delta = (long long) zmalloc_used_memory();
+            latencyStartMonitor(eviction_latency);
+            if (server.lazyfree_lazy_eviction)
+                dbAsyncDelete(db,keyobj);
+            else
+                dbSyncDelete(db,keyobj);
+            latencyEndMonitor(eviction_latency);
+            latencyAddSampleIfNeeded("eviction-del",eviction_latency);
+            delta -= (long long) zmalloc_used_memory();
+            mem_freed += delta;
+            server.stat_evictedkeys++;
+            signalModifiedKey(NULL,db,keyobj);
+            notifyKeyspaceEvent(NOTIFY_EVICTED, "evicted",
+                keyobj, db->id);
+            decrRefCount(keyobj);
+            keys_freed++;
+
+            if (keys_freed % 16 == 0) {
+                /* When the memory to free starts to be big enough, we may
+                 * start spending so much time here that is impossible to
+                 * deliver data to the replicas fast enough, so we force the
+                 * transmission here inside the loop. */
+                if (slaves) flushSlavesOutputBuffers();
+
+                /* Normally our stop condition is the ability to release
+                 * a fixed, pre-computed amount of memory. However when we
+                 * are deleting objects in another thread, it's better to
+                 * check, from time to time, if we already reached our target
+                 * memory, since the "mem_freed" amount is computed only
+                 * across the dbAsyncDelete() call, while the thread can
+                 * release the memory all the time. */
+                if (server.lazyfree_lazy_eviction) {
+                    if (getMaxmemoryState(NULL,NULL,NULL,NULL) == C_OK) {
+                        break;
+                    }
+                }
+
+                /* After some time, exit the loop early - even if memory limit
+                 * hasn't been reached.  If we suddenly need to free a lot of
+                 * memory, don't want to spend too much time here.  */
+                if (elapsedUs(evictionTimer) > eviction_time_limit_us) {
+                    // We still need to free memory - start eviction timer proc
+                    if (!isEvictionProcRunning) {
+                        isEvictionProcRunning = 1;
+                        aeCreateTimeEvent(server.el, 0,
+                                evictionTimeProc, NULL, NULL);
+                    }
+                    break;
+                }
+            }
+        } else {
+            goto cant_free; /* nothing to free... */
+        }
+    }
+    /* at this point, the memory is OK, or we have reached the time limit */
+    result = (isEvictionProcRunning) ? EVICT_RUNNING : EVICT_OK;
+
+cant_free:
+    if (result == EVICT_FAIL) {
+        /* At this point, we have run out of evictable items.  It's possible
+         * that some items are being freed in the lazyfree thread.  Perform a
+         * short wait here if such jobs exist, but don't wait long.  */
+        if (bioPendingJobsOfType(BIO_LAZY_FREE)) {
+            usleep(eviction_time_limit_us);
+            if (getMaxmemoryState(NULL,NULL,NULL,NULL) == C_OK) {
+                result = EVICT_OK;
+            }
+        }
+    }
+
+    latencyEndMonitor(latency);
+    latencyAddSampleIfNeeded("eviction-cycle",latency);
+    return result;
+}
+
diff --git a/redis-stable/src/expire.c b/redis-stable/src/expire.c
new file mode 100644
index 00000000..f23a79b8
--- /dev/null
+++ b/redis-stable/src/expire.c
@@ -0,0 +1,612 @@
+/* Implementation of EXPIRE (keys with fixed time to live).
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/*-----------------------------------------------------------------------------
+ * Incremental collection of expired keys.
+ *
+ * When keys are accessed they are expired on-access. However we need a
+ * mechanism in order to ensure keys are eventually removed when expired even
+ * if no access is performed on them.
+ *----------------------------------------------------------------------------*/
+
+/* Helper function for the activeExpireCycle() function.
+ * This function will try to expire the key that is stored in the hash table
+ * entry 'de' of the 'expires' hash table of a Redis database.
+ *
+ * If the key is found to be expired, it is removed from the database and
+ * 1 is returned. Otherwise no operation is performed and 0 is returned.
+ *
+ * When a key is expired, server.stat_expiredkeys is incremented.
+ *
+ * The parameter 'now' is the current time in milliseconds as is passed
+ * to the function to avoid too many gettimeofday() syscalls. */
+int activeExpireCycleTryExpire(redisDb *db, dictEntry *de, long long now) {
+    long long t = dictGetSignedIntegerVal(de);
+    if (now > t) {
+        sds key = dictGetKey(de);
+        robj *keyobj = createStringObject(key,sdslen(key));
+        deleteExpiredKeyAndPropagate(db,keyobj);
+        decrRefCount(keyobj);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Try to expire a few timed out keys. The algorithm used is adaptive and
+ * will use few CPU cycles if there are few expiring keys, otherwise
+ * it will get more aggressive to avoid that too much memory is used by
+ * keys that can be removed from the keyspace.
+ *
+ * Every expire cycle tests multiple databases: the next call will start
+ * again from the next db. No more than CRON_DBS_PER_CALL databases are
+ * tested at every iteration.
+ *
+ * The function can perform more or less work, depending on the "type"
+ * argument. It can execute a "fast cycle" or a "slow cycle". The slow
+ * cycle is the main way we collect expired cycles: this happens with
+ * the "server.hz" frequency (usually 10 hertz).
+ *
+ * However the slow cycle can exit for timeout, since it used too much time.
+ * For this reason the function is also invoked to perform a fast cycle
+ * at every event loop cycle, in the beforeSleep() function. The fast cycle
+ * will try to perform less work, but will do it much more often.
+ *
+ * The following are the details of the two expire cycles and their stop
+ * conditions:
+ *
+ * If type is ACTIVE_EXPIRE_CYCLE_FAST the function will try to run a
+ * "fast" expire cycle that takes no longer than ACTIVE_EXPIRE_CYCLE_FAST_DURATION
+ * microseconds, and is not repeated again before the same amount of time.
+ * The cycle will also refuse to run at all if the latest slow cycle did not
+ * terminate because of a time limit condition.
+ *
+ * If type is ACTIVE_EXPIRE_CYCLE_SLOW, that normal expire cycle is
+ * executed, where the time limit is a percentage of the REDIS_HZ period
+ * as specified by the ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC define. In the
+ * fast cycle, the check of every database is interrupted once the number
+ * of already expired keys in the database is estimated to be lower than
+ * a given percentage, in order to avoid doing too much work to gain too
+ * little memory.
+ *
+ * The configured expire "effort" will modify the baseline parameters in
+ * order to do more work in both the fast and slow expire cycles.
+ */
+
+#define ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP 20 /* Keys for each DB loop. */
+#define ACTIVE_EXPIRE_CYCLE_FAST_DURATION 1000 /* Microseconds. */
+#define ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC 25 /* Max % of CPU to use. */
+#define ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE 10 /* % of stale keys after which
+                                                   we do extra efforts. */
+
+void activeExpireCycle(int type) {
+    /* Adjust the running parameters according to the configured expire
+     * effort. The default effort is 1, and the maximum configurable effort
+     * is 10. */
+    unsigned long
+    effort = server.active_expire_effort-1, /* Rescale from 0 to 9. */
+    config_keys_per_loop = ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP +
+                           ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP/4*effort,
+    config_cycle_fast_duration = ACTIVE_EXPIRE_CYCLE_FAST_DURATION +
+                                 ACTIVE_EXPIRE_CYCLE_FAST_DURATION/4*effort,
+    config_cycle_slow_time_perc = ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC +
+                                  2*effort,
+    config_cycle_acceptable_stale = ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE-
+                                    effort;
+
+    /* This function has some global state in order to continue the work
+     * incrementally across calls. */
+    static unsigned int current_db = 0; /* Next DB to test. */
+    static int timelimit_exit = 0;      /* Time limit hit in previous call? */
+    static long long last_fast_cycle = 0; /* When last fast cycle ran. */
+
+    int j, iteration = 0;
+    int dbs_per_call = CRON_DBS_PER_CALL;
+    long long start = ustime(), timelimit, elapsed;
+
+    /* When clients are paused the dataset should be static not just from the
+     * POV of clients not being able to write, but also from the POV of
+     * expires and evictions of keys not being performed. */
+    if (checkClientPauseTimeoutAndReturnIfPaused()) return;
+
+    if (type == ACTIVE_EXPIRE_CYCLE_FAST) {
+        /* Don't start a fast cycle if the previous cycle did not exit
+         * for time limit, unless the percentage of estimated stale keys is
+         * too high. Also never repeat a fast cycle for the same period
+         * as the fast cycle total duration itself. */
+        if (!timelimit_exit &&
+            server.stat_expired_stale_perc < config_cycle_acceptable_stale)
+            return;
+
+        if (start < last_fast_cycle + (long long)config_cycle_fast_duration*2)
+            return;
+
+        last_fast_cycle = start;
+    }
+
+    /* We usually should test CRON_DBS_PER_CALL per iteration, with
+     * two exceptions:
+     *
+     * 1) Don't test more DBs than we have.
+     * 2) If last time we hit the time limit, we want to scan all DBs
+     * in this iteration, as there is work to do in some DB and we don't want
+     * expired keys to use memory for too much time. */
+    if (dbs_per_call > server.dbnum || timelimit_exit)
+        dbs_per_call = server.dbnum;
+
+    /* We can use at max 'config_cycle_slow_time_perc' percentage of CPU
+     * time per iteration. Since this function gets called with a frequency of
+     * server.hz times per second, the following is the max amount of
+     * microseconds we can spend in this function. */
+    timelimit = config_cycle_slow_time_perc*1000000/server.hz/100;
+    timelimit_exit = 0;
+    if (timelimit <= 0) timelimit = 1;
+
+    if (type == ACTIVE_EXPIRE_CYCLE_FAST)
+        timelimit = config_cycle_fast_duration; /* in microseconds. */
+
+    /* Accumulate some global stats as we expire keys, to have some idea
+     * about the number of keys that are already logically expired, but still
+     * existing inside the database. */
+    long total_sampled = 0;
+    long total_expired = 0;
+
+    for (j = 0; j < dbs_per_call && timelimit_exit == 0; j++) {
+        /* Expired and checked in a single loop. */
+        unsigned long expired, sampled;
+
+        redisDb *db = server.db+(current_db % server.dbnum);
+
+        /* Increment the DB now so we are sure if we run out of time
+         * in the current DB we'll restart from the next. This allows to
+         * distribute the time evenly across DBs. */
+        current_db++;
+
+        /* Continue to expire if at the end of the cycle there are still
+         * a big percentage of keys to expire, compared to the number of keys
+         * we scanned. The percentage, stored in config_cycle_acceptable_stale
+         * is not fixed, but depends on the Redis configured "expire effort". */
+        do {
+            unsigned long num, slots;
+            long long now, ttl_sum;
+            int ttl_samples;
+            iteration++;
+
+            /* If there is nothing to expire try next DB ASAP. */
+            if ((num = dictSize(db->expires)) == 0) {
+                db->avg_ttl = 0;
+                break;
+            }
+            slots = dictSlots(db->expires);
+            now = mstime();
+
+            /* When there are less than 1% filled slots, sampling the key
+             * space is expensive, so stop here waiting for better times...
+             * The dictionary will be resized asap. */
+            if (slots > DICT_HT_INITIAL_SIZE &&
+                (num*100/slots < 1)) break;
+
+            /* The main collection cycle. Sample random keys among keys
+             * with an expire set, checking for expired ones. */
+            expired = 0;
+            sampled = 0;
+            ttl_sum = 0;
+            ttl_samples = 0;
+
+            if (num > config_keys_per_loop)
+                num = config_keys_per_loop;
+
+            /* Here we access the low level representation of the hash table
+             * for speed concerns: this makes this code coupled with dict.c,
+             * but it hardly changed in ten years.
+             *
+             * Note that certain places of the hash table may be empty,
+             * so we want also a stop condition about the number of
+             * buckets that we scanned. However scanning for free buckets
+             * is very fast: we are in the cache line scanning a sequential
+             * array of NULL pointers, so we can scan a lot more buckets
+             * than keys in the same time. */
+            long max_buckets = num*20;
+            long checked_buckets = 0;
+
+            while (sampled < num && checked_buckets < max_buckets) {
+                for (int table = 0; table < 2; table++) {
+                    if (table == 1 && !dictIsRehashing(db->expires)) break;
+
+                    unsigned long idx = db->expires_cursor;
+                    idx &= db->expires->ht[table].sizemask;
+                    dictEntry *de = db->expires->ht[table].table[idx];
+                    long long ttl;
+
+                    /* Scan the current bucket of the current table. */
+                    checked_buckets++;
+                    while(de) {
+                        /* Get the next entry now since this entry may get
+                         * deleted. */
+                        dictEntry *e = de;
+                        de = de->next;
+
+                        ttl = dictGetSignedIntegerVal(e)-now;
+                        if (activeExpireCycleTryExpire(db,e,now)) expired++;
+                        if (ttl > 0) {
+                            /* We want the average TTL of keys yet
+                             * not expired. */
+                            ttl_sum += ttl;
+                            ttl_samples++;
+                        }
+                        sampled++;
+                    }
+                }
+                db->expires_cursor++;
+            }
+            total_expired += expired;
+            total_sampled += sampled;
+
+            /* Update the average TTL stats for this database. */
+            if (ttl_samples) {
+                long long avg_ttl = ttl_sum/ttl_samples;
+
+                /* Do a simple running average with a few samples.
+                 * We just use the current estimate with a weight of 2%
+                 * and the previous estimate with a weight of 98%. */
+                if (db->avg_ttl == 0) db->avg_ttl = avg_ttl;
+                db->avg_ttl = (db->avg_ttl/50)*49 + (avg_ttl/50);
+            }
+
+            /* We can't block forever here even if there are many keys to
+             * expire. So after a given amount of milliseconds return to the
+             * caller waiting for the other active expire cycle. */
+            if ((iteration & 0xf) == 0) { /* check once every 16 iterations. */
+                elapsed = ustime()-start;
+                if (elapsed > timelimit) {
+                    timelimit_exit = 1;
+                    server.stat_expired_time_cap_reached_count++;
+                    break;
+                }
+            }
+            /* We don't repeat the cycle for the current database if there are
+             * an acceptable amount of stale keys (logically expired but yet
+             * not reclaimed). */
+        } while (sampled == 0 ||
+                 (expired*100/sampled) > config_cycle_acceptable_stale);
+    }
+
+    elapsed = ustime()-start;
+    server.stat_expire_cycle_time_used += elapsed;
+    latencyAddSampleIfNeeded("expire-cycle",elapsed/1000);
+
+    /* Update our estimate of keys existing but yet to be expired.
+     * Running average with this sample accounting for 5%. */
+    double current_perc;
+    if (total_sampled) {
+        current_perc = (double)total_expired/total_sampled;
+    } else
+        current_perc = 0;
+    server.stat_expired_stale_perc = (current_perc*0.05)+
+                                     (server.stat_expired_stale_perc*0.95);
+}
+
+/*-----------------------------------------------------------------------------
+ * Expires of keys created in writable slaves
+ *
+ * Normally slaves do not process expires: they wait the masters to synthesize
+ * DEL operations in order to retain consistency. However writable slaves are
+ * an exception: if a key is created in the slave and an expire is assigned
+ * to it, we need a way to expire such a key, since the master does not know
+ * anything about such a key.
+ *
+ * In order to do so, we track keys created in the slave side with an expire
+ * set, and call the expireSlaveKeys() function from time to time in order to
+ * reclaim the keys if they already expired.
+ *
+ * Note that the use case we are trying to cover here, is a popular one where
+ * slaves are put in writable mode in order to compute slow operations in
+ * the slave side that are mostly useful to actually read data in a more
+ * processed way. Think at sets intersections in a tmp key, with an expire so
+ * that it is also used as a cache to avoid intersecting every time.
+ *
+ * This implementation is currently not perfect but a lot better than leaking
+ * the keys as implemented in 3.2.
+ *----------------------------------------------------------------------------*/
+
+/* The dictionary where we remember key names and database ID of keys we may
+ * want to expire from the slave. Since this function is not often used we
+ * don't even care to initialize the database at startup. We'll do it once
+ * the feature is used the first time, that is, when rememberSlaveKeyWithExpire()
+ * is called.
+ *
+ * The dictionary has an SDS string representing the key as the hash table
+ * key, while the value is a 64 bit unsigned integer with the bits corresponding
+ * to the DB where the keys may exist set to 1. Currently the keys created
+ * with a DB id > 63 are not expired, but a trivial fix is to set the bitmap
+ * to the max 64 bit unsigned value when we know there is a key with a DB
+ * ID greater than 63, and check all the configured DBs in such a case. */
+dict *slaveKeysWithExpire = NULL;
+
+/* Check the set of keys created by the master with an expire set in order to
+ * check if they should be evicted. */
+void expireSlaveKeys(void) {
+    if (slaveKeysWithExpire == NULL ||
+        dictSize(slaveKeysWithExpire) == 0) return;
+
+    int cycles = 0, noexpire = 0;
+    mstime_t start = mstime();
+    while(1) {
+        dictEntry *de = dictGetRandomKey(slaveKeysWithExpire);
+        sds keyname = dictGetKey(de);
+        uint64_t dbids = dictGetUnsignedIntegerVal(de);
+        uint64_t new_dbids = 0;
+
+        /* Check the key against every database corresponding to the
+         * bits set in the value bitmap. */
+        int dbid = 0;
+        while(dbids && dbid < server.dbnum) {
+            if ((dbids & 1) != 0) {
+                redisDb *db = server.db+dbid;
+                dictEntry *expire = dictFind(db->expires,keyname);
+                int expired = 0;
+
+                if (expire &&
+                    activeExpireCycleTryExpire(server.db+dbid,expire,start))
+                {
+                    expired = 1;
+                }
+
+                /* If the key was not expired in this DB, we need to set the
+                 * corresponding bit in the new bitmap we set as value.
+                 * At the end of the loop if the bitmap is zero, it means we
+                 * no longer need to keep track of this key. */
+                if (expire && !expired) {
+                    noexpire++;
+                    new_dbids |= (uint64_t)1 << dbid;
+                }
+            }
+            dbid++;
+            dbids >>= 1;
+        }
+
+        /* Set the new bitmap as value of the key, in the dictionary
+         * of keys with an expire set directly in the writable slave. Otherwise
+         * if the bitmap is zero, we no longer need to keep track of it. */
+        if (new_dbids)
+            dictSetUnsignedIntegerVal(de,new_dbids);
+        else
+            dictDelete(slaveKeysWithExpire,keyname);
+
+        /* Stop conditions: found 3 keys we can't expire in a row or
+         * time limit was reached. */
+        cycles++;
+        if (noexpire > 3) break;
+        if ((cycles % 64) == 0 && mstime()-start > 1) break;
+        if (dictSize(slaveKeysWithExpire) == 0) break;
+    }
+}
+
+/* Track keys that received an EXPIRE or similar command in the context
+ * of a writable slave. */
+void rememberSlaveKeyWithExpire(redisDb *db, robj *key) {
+    if (slaveKeysWithExpire == NULL) {
+        static dictType dt = {
+            dictSdsHash,                /* hash function */
+            NULL,                       /* key dup */
+            NULL,                       /* val dup */
+            dictSdsKeyCompare,          /* key compare */
+            dictSdsDestructor,          /* key destructor */
+            NULL,                       /* val destructor */
+            NULL                        /* allow to expand */
+        };
+        slaveKeysWithExpire = dictCreate(&dt,NULL);
+    }
+    if (db->id > 63) return;
+
+    dictEntry *de = dictAddOrFind(slaveKeysWithExpire,key->ptr);
+    /* If the entry was just created, set it to a copy of the SDS string
+     * representing the key: we don't want to need to take those keys
+     * in sync with the main DB. The keys will be removed by expireSlaveKeys()
+     * as it scans to find keys to remove. */
+    if (de->key == key->ptr) {
+        de->key = sdsdup(key->ptr);
+        dictSetUnsignedIntegerVal(de,0);
+    }
+
+    uint64_t dbids = dictGetUnsignedIntegerVal(de);
+    dbids |= (uint64_t)1 << db->id;
+    dictSetUnsignedIntegerVal(de,dbids);
+}
+
+/* Return the number of keys we are tracking. */
+size_t getSlaveKeyWithExpireCount(void) {
+    if (slaveKeysWithExpire == NULL) return 0;
+    return dictSize(slaveKeysWithExpire);
+}
+
+/* Remove the keys in the hash table. We need to do that when data is
+ * flushed from the server. We may receive new keys from the master with
+ * the same name/db and it is no longer a good idea to expire them.
+ *
+ * Note: technically we should handle the case of a single DB being flushed
+ * but it is not worth it since anyway race conditions using the same set
+ * of key names in a writable slave and in its master will lead to
+ * inconsistencies. This is just a best-effort thing we do. */
+void flushSlaveKeysWithExpireList(void) {
+    if (slaveKeysWithExpire) {
+        dictRelease(slaveKeysWithExpire);
+        slaveKeysWithExpire = NULL;
+    }
+}
+
+int checkAlreadyExpired(long long when) {
+    /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
+     * should never be executed as a DEL when load the AOF or in the context
+     * of a slave instance.
+     *
+     * Instead we add the already expired key to the database with expire time
+     * (possibly in the past) and wait for an explicit DEL from the master. */
+    return (when <= mstime() && !server.loading && !server.masterhost);
+}
+
+/*-----------------------------------------------------------------------------
+ * Expires Commands
+ *----------------------------------------------------------------------------*/
+
+/* This is the generic command implementation for EXPIRE, PEXPIRE, EXPIREAT
+ * and PEXPIREAT. Because the command second argument may be relative or absolute
+ * the "basetime" argument is used to signal what the base time is (either 0
+ * for *AT variants of the command, or the current time for relative expires).
+ *
+ * unit is either UNIT_SECONDS or UNIT_MILLISECONDS, and is only used for
+ * the argv[2] parameter. The basetime is always specified in milliseconds. */
+void expireGenericCommand(client *c, long long basetime, int unit) {
+    robj *key = c->argv[1], *param = c->argv[2];
+    long long when; /* unix time in milliseconds when the key will expire. */
+
+    if (getLongLongFromObjectOrReply(c, param, &when, NULL) != C_OK)
+        return;
+    int negative_when = when < 0;
+    if (unit == UNIT_SECONDS) when *= 1000;
+    when += basetime;
+    if (((when < 0) && !negative_when) || ((when-basetime > 0) && negative_when)) {
+        /* EXPIRE allows negative numbers, but we can at least detect an
+         * overflow by either unit conversion or basetime addition. */
+        addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
+        return;
+    }
+    /* No key, return zero. */
+    if (lookupKeyWrite(c->db,key) == NULL) {
+        addReply(c,shared.czero);
+        return;
+    }
+
+    if (checkAlreadyExpired(when)) {
+        robj *aux;
+
+        int deleted = server.lazyfree_lazy_expire ? dbAsyncDelete(c->db,key) :
+                                                    dbSyncDelete(c->db,key);
+        serverAssertWithInfo(c,key,deleted);
+        server.dirty++;
+
+        /* Replicate/AOF this as an explicit DEL or UNLINK. */
+        aux = server.lazyfree_lazy_expire ? shared.unlink : shared.del;
+        rewriteClientCommandVector(c,2,aux,key);
+        signalModifiedKey(c,c->db,key);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
+        addReply(c, shared.cone);
+        return;
+    } else {
+        setExpire(c,c->db,key,when);
+        addReply(c,shared.cone);
+        signalModifiedKey(c,c->db,key);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",key,c->db->id);
+        server.dirty++;
+        return;
+    }
+}
+
+/* EXPIRE key seconds */
+void expireCommand(client *c) {
+    expireGenericCommand(c,mstime(),UNIT_SECONDS);
+}
+
+/* EXPIREAT key time */
+void expireatCommand(client *c) {
+    expireGenericCommand(c,0,UNIT_SECONDS);
+}
+
+/* PEXPIRE key milliseconds */
+void pexpireCommand(client *c) {
+    expireGenericCommand(c,mstime(),UNIT_MILLISECONDS);
+}
+
+/* PEXPIREAT key ms_time */
+void pexpireatCommand(client *c) {
+    expireGenericCommand(c,0,UNIT_MILLISECONDS);
+}
+
+/* Implements TTL and PTTL */
+void ttlGenericCommand(client *c, int output_ms) {
+    long long expire, ttl = -1;
+
+    /* If the key does not exist at all, return -2 */
+    if (lookupKeyReadWithFlags(c->db,c->argv[1],LOOKUP_NOTOUCH) == NULL) {
+        addReplyLongLong(c,-2);
+        return;
+    }
+    /* The key exists. Return -1 if it has no expire, or the actual
+     * TTL value otherwise. */
+    expire = getExpire(c->db,c->argv[1]);
+    if (expire != -1) {
+        ttl = expire-mstime();
+        if (ttl < 0) ttl = 0;
+    }
+    if (ttl == -1) {
+        addReplyLongLong(c,-1);
+    } else {
+        addReplyLongLong(c,output_ms ? ttl : ((ttl+500)/1000));
+    }
+}
+
+/* TTL key */
+void ttlCommand(client *c) {
+    ttlGenericCommand(c, 0);
+}
+
+/* PTTL key */
+void pttlCommand(client *c) {
+    ttlGenericCommand(c, 1);
+}
+
+/* PERSIST key */
+void persistCommand(client *c) {
+    if (lookupKeyWrite(c->db,c->argv[1])) {
+        if (removeExpire(c->db,c->argv[1])) {
+            signalModifiedKey(c,c->db,c->argv[1]);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"persist",c->argv[1],c->db->id);
+            addReply(c,shared.cone);
+            server.dirty++;
+        } else {
+            addReply(c,shared.czero);
+        }
+    } else {
+        addReply(c,shared.czero);
+    }
+}
+
+/* TOUCH key1 [key2 key3 ... keyN] */
+void touchCommand(client *c) {
+    int touched = 0;
+    for (int j = 1; j < c->argc; j++)
+        if (lookupKeyRead(c->db,c->argv[j]) != NULL) touched++;
+    addReplyLongLong(c,touched);
+}
+
diff --git a/redis-stable/src/fmacros.h b/redis-stable/src/fmacros.h
new file mode 100644
index 00000000..a97d21a4
--- /dev/null
+++ b/redis-stable/src/fmacros.h
@@ -0,0 +1,66 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _REDIS_FMACRO_H
+#define _REDIS_FMACRO_H
+
+#define _BSD_SOURCE
+
+#if defined(__linux__)
+#define _GNU_SOURCE
+#define _DEFAULT_SOURCE
+#endif
+
+#if defined(_AIX)
+#define _ALL_SOURCE
+#endif
+
+#if defined(__linux__) || defined(__OpenBSD__)
+#define _XOPEN_SOURCE 700
+/*
+ * On NetBSD, _XOPEN_SOURCE undefines _NETBSD_SOURCE and
+ * thus hides inet_aton etc.
+ */
+#elif !defined(__NetBSD__)
+#define _XOPEN_SOURCE
+#endif
+
+#if defined(__sun)
+#define _POSIX_C_SOURCE 199506L
+#endif
+
+#define _LARGEFILE_SOURCE
+#define _FILE_OFFSET_BITS 64
+
+#ifdef __linux__
+/* features.h uses the defines above to set feature specific defines.  */
+#include <features.h>
+#endif
+
+#endif
diff --git a/redis-stable/src/geo.c b/redis-stable/src/geo.c
new file mode 100644
index 00000000..c3f6c922
--- /dev/null
+++ b/redis-stable/src/geo.c
@@ -0,0 +1,998 @@
+/*
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
+ * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "geo.h"
+#include "geohash_helper.h"
+#include "debugmacro.h"
+#include "pqsort.h"
+
+/* Things exported from t_zset.c only for geo.c, since it is the only other
+ * part of Redis that requires close zset introspection. */
+unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range);
+int zslValueLteMax(double value, zrangespec *spec);
+
+/* ====================================================================
+ * This file implements the following commands:
+ *
+ *   - geoadd - add coordinates for value to geoset
+ *   - georadius - search radius by coordinates in geoset
+ *   - georadiusbymember - search radius based on geoset member position
+ * ==================================================================== */
+
+/* ====================================================================
+ * geoArray implementation
+ * ==================================================================== */
+
+/* Create a new array of geoPoints. */
+geoArray *geoArrayCreate(void) {
+    geoArray *ga = zmalloc(sizeof(*ga));
+    /* It gets allocated on first geoArrayAppend() call. */
+    ga->array = NULL;
+    ga->buckets = 0;
+    ga->used = 0;
+    return ga;
+}
+
+/* Add a new entry and return its pointer so that the caller can populate
+ * it with data. */
+geoPoint *geoArrayAppend(geoArray *ga) {
+    if (ga->used == ga->buckets) {
+        ga->buckets = (ga->buckets == 0) ? 8 : ga->buckets*2;
+        ga->array = zrealloc(ga->array,sizeof(geoPoint)*ga->buckets);
+    }
+    geoPoint *gp = ga->array+ga->used;
+    ga->used++;
+    return gp;
+}
+
+/* Destroy a geoArray created with geoArrayCreate(). */
+void geoArrayFree(geoArray *ga) {
+    size_t i;
+    for (i = 0; i < ga->used; i++) sdsfree(ga->array[i].member);
+    zfree(ga->array);
+    zfree(ga);
+}
+
+/* ====================================================================
+ * Helpers
+ * ==================================================================== */
+int decodeGeohash(double bits, double *xy) {
+    GeoHashBits hash = { .bits = (uint64_t)bits, .step = GEO_STEP_MAX };
+    return geohashDecodeToLongLatWGS84(hash, xy);
+}
+
+/* Input Argument Helper */
+/* Take a pointer to the latitude arg then use the next arg for longitude.
+ * On parse error C_ERR is returned, otherwise C_OK. */
+int extractLongLatOrReply(client *c, robj **argv, double *xy) {
+    int i;
+    for (i = 0; i < 2; i++) {
+        if (getDoubleFromObjectOrReply(c, argv[i], xy + i, NULL) !=
+            C_OK) {
+            return C_ERR;
+        }
+    }
+    if (xy[0] < GEO_LONG_MIN || xy[0] > GEO_LONG_MAX ||
+        xy[1] < GEO_LAT_MIN  || xy[1] > GEO_LAT_MAX) {
+        addReplyErrorFormat(c,
+            "-ERR invalid longitude,latitude pair %f,%f\r\n",xy[0],xy[1]);
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+/* Input Argument Helper */
+/* Decode lat/long from a zset member's score.
+ * Returns C_OK on successful decoding, otherwise C_ERR is returned. */
+int longLatFromMember(robj *zobj, robj *member, double *xy) {
+    double score = 0;
+
+    if (zsetScore(zobj, member->ptr, &score) == C_ERR) return C_ERR;
+    if (!decodeGeohash(score, xy)) return C_ERR;
+    return C_OK;
+}
+
+/* Check that the unit argument matches one of the known units, and returns
+ * the conversion factor to meters (you need to divide meters by the conversion
+ * factor to convert to the right unit).
+ *
+ * If the unit is not valid, an error is reported to the client, and a value
+ * less than zero is returned. */
+double extractUnitOrReply(client *c, robj *unit) {
+    char *u = unit->ptr;
+
+    if (!strcmp(u, "m")) {
+        return 1;
+    } else if (!strcmp(u, "km")) {
+        return 1000;
+    } else if (!strcmp(u, "ft")) {
+        return 0.3048;
+    } else if (!strcmp(u, "mi")) {
+        return 1609.34;
+    } else {
+        addReplyError(c,
+            "unsupported unit provided. please use m, km, ft, mi");
+        return -1;
+    }
+}
+
+/* Input Argument Helper.
+ * Extract the distance from the specified two arguments starting at 'argv'
+ * that should be in the form: <number> <unit>, and return C_OK or C_ERR means success or failure
+ * *conversions is populated with the coefficient to use in order to convert meters to the unit.*/
+int extractDistanceOrReply(client *c, robj **argv,
+                              double *conversion, double *radius) {
+    double distance;
+    if (getDoubleFromObjectOrReply(c, argv[0], &distance,
+                                   "need numeric radius") != C_OK) {
+        return C_ERR;
+    }
+
+    if (distance < 0) {
+        addReplyError(c,"radius cannot be negative");
+        return C_ERR;
+    }
+    if (radius) *radius = distance;
+
+    double to_meters = extractUnitOrReply(c,argv[1]);
+    if (to_meters < 0) {
+        return C_ERR;
+    }
+
+    if (conversion) *conversion = to_meters;
+    return C_OK;
+}
+
+/* Input Argument Helper.
+ * Extract height and width from the specified three arguments starting at 'argv'
+ * that should be in the form: <number> <number> <unit>, and return C_OK or C_ERR means success or failure
+ * *conversions is populated with the coefficient to use in order to convert meters to the unit.*/
+int extractBoxOrReply(client *c, robj **argv, double *conversion,
+                         double *width, double *height) {
+    double h, w;
+    if ((getDoubleFromObjectOrReply(c, argv[0], &w, "need numeric width") != C_OK) ||
+        (getDoubleFromObjectOrReply(c, argv[1], &h, "need numeric height") != C_OK)) {
+        return C_ERR;
+    }
+
+    if (h < 0 || w < 0) {
+        addReplyError(c, "height or width cannot be negative");
+        return C_ERR;
+    }
+    if (height) *height = h;
+    if (width) *width = w;
+
+    double to_meters = extractUnitOrReply(c,argv[2]);
+    if (to_meters < 0) {
+        return C_ERR;
+    }
+
+    if (conversion) *conversion = to_meters;
+    return C_OK;
+}
+
+/* The default addReplyDouble has too much accuracy.  We use this
+ * for returning location distances. "5.2145 meters away" is nicer
+ * than "5.2144992818115 meters away." We provide 4 digits after the dot
+ * so that the returned value is decently accurate even when the unit is
+ * the kilometer. */
+void addReplyDoubleDistance(client *c, double d) {
+    char dbuf[128];
+    int dlen = snprintf(dbuf, sizeof(dbuf), "%.4f", d);
+    addReplyBulkCBuffer(c, dbuf, dlen);
+}
+
+/* Helper function for geoGetPointsInRange(): given a sorted set score
+ * representing a point, and a GeoShape, appends this entry as a geoPoint
+ * into the specified geoArray only if the point is within the search area.
+ *
+ * returns C_OK if the point is included, or REIDS_ERR if it is outside. */
+int geoAppendIfWithinShape(geoArray *ga, GeoShape *shape, double score, sds member) {
+    double distance = 0, xy[2];
+
+    if (!decodeGeohash(score,xy)) return C_ERR; /* Can't decode. */
+    /* Note that geohashGetDistanceIfInRadiusWGS84() takes arguments in
+     * reverse order: longitude first, latitude later. */
+    if (shape->type == CIRCULAR_TYPE) {
+        if (!geohashGetDistanceIfInRadiusWGS84(shape->xy[0], shape->xy[1], xy[0], xy[1],
+                                               shape->t.radius*shape->conversion, &distance)) return C_ERR;
+    } else if (shape->type == RECTANGLE_TYPE) {
+        if (!geohashGetDistanceIfInRectangle(shape->t.r.width * shape->conversion,
+                                             shape->t.r.height * shape->conversion,
+                                             shape->xy[0], shape->xy[1], xy[0], xy[1], &distance))
+            return C_ERR;
+    }
+
+    /* Append the new element. */
+    geoPoint *gp = geoArrayAppend(ga);
+    gp->longitude = xy[0];
+    gp->latitude = xy[1];
+    gp->dist = distance;
+    gp->member = member;
+    gp->score = score;
+    return C_OK;
+}
+
+/* Query a Redis sorted set to extract all the elements between 'min' and
+ * 'max', appending them into the array of geoPoint structures 'gparray'.
+ * The command returns the number of elements added to the array.
+ *
+ * Elements which are farest than 'radius' from the specified 'x' and 'y'
+ * coordinates are not included.
+ *
+ * The ability of this function to append to an existing set of points is
+ * important for good performances because querying by radius is performed
+ * using multiple queries to the sorted set, that we later need to sort
+ * via qsort. Similarly we need to be able to reject points outside the search
+ * radius area ASAP in order to allocate and process more points than needed. */
+int geoGetPointsInRange(robj *zobj, double min, double max, GeoShape *shape, geoArray *ga, unsigned long limit) {
+    /* minex 0 = include min in range; maxex 1 = exclude max in range */
+    /* That's: min <= val < max */
+    zrangespec range = { .min = min, .max = max, .minex = 0, .maxex = 1 };
+    size_t origincount = ga->used;
+    sds member;
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr = NULL;
+        unsigned int vlen = 0;
+        long long vlong = 0;
+        double score = 0;
+
+        if ((eptr = zzlFirstInRange(zl, &range)) == NULL) {
+            /* Nothing exists starting at our min.  No results. */
+            return 0;
+        }
+
+        sptr = ziplistNext(zl, eptr);
+        while (eptr) {
+            score = zzlGetScore(sptr);
+
+            /* If we fell out of range, break. */
+            if (!zslValueLteMax(score, &range))
+                break;
+
+            /* We know the element exists. ziplistGet should always succeed */
+            ziplistGet(eptr, &vstr, &vlen, &vlong);
+            member = (vstr == NULL) ? sdsfromlonglong(vlong) :
+                                      sdsnewlen(vstr,vlen);
+            if (geoAppendIfWithinShape(ga,shape,score,member)
+                == C_ERR) sdsfree(member);
+            if (ga->used && limit && ga->used >= limit) break;
+            zzlNext(zl, &eptr, &sptr);
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+
+        if ((ln = zslFirstInRange(zsl, &range)) == NULL) {
+            /* Nothing exists starting at our min.  No results. */
+            return 0;
+        }
+
+        while (ln) {
+            sds ele = ln->ele;
+            /* Abort when the node is no longer in range. */
+            if (!zslValueLteMax(ln->score, &range))
+                break;
+
+            ele = sdsdup(ele);
+            if (geoAppendIfWithinShape(ga,shape,ln->score,ele)
+                == C_ERR) sdsfree(ele);
+            if (ga->used && limit && ga->used >= limit) break;
+            ln = ln->level[0].forward;
+        }
+    }
+    return ga->used - origincount;
+}
+
+/* Compute the sorted set scores min (inclusive), max (exclusive) we should
+ * query in order to retrieve all the elements inside the specified area
+ * 'hash'. The two scores are returned by reference in *min and *max. */
+void scoresOfGeoHashBox(GeoHashBits hash, GeoHashFix52Bits *min, GeoHashFix52Bits *max) {
+    /* We want to compute the sorted set scores that will include all the
+     * elements inside the specified Geohash 'hash', which has as many
+     * bits as specified by hash.step * 2.
+     *
+     * So if step is, for example, 3, and the hash value in binary
+     * is 101010, since our score is 52 bits we want every element which
+     * is in binary: 101010?????????????????????????????????????????????
+     * Where ? can be 0 or 1.
+     *
+     * To get the min score we just use the initial hash value left
+     * shifted enough to get the 52 bit value. Later we increment the
+     * 6 bit prefis (see the hash.bits++ statement), and get the new
+     * prefix: 101011, which we align again to 52 bits to get the maximum
+     * value (which is excluded from the search). So we get everything
+     * between the two following scores (represented in binary):
+     *
+     * 1010100000000000000000000000000000000000000000000000 (included)
+     * and
+     * 1010110000000000000000000000000000000000000000000000 (excluded).
+     */
+    *min = geohashAlign52Bits(hash);
+    hash.bits++;
+    *max = geohashAlign52Bits(hash);
+}
+
+/* Obtain all members between the min/max of this geohash bounding box.
+ * Populate a geoArray of GeoPoints by calling geoGetPointsInRange().
+ * Return the number of points added to the array. */
+int membersOfGeoHashBox(robj *zobj, GeoHashBits hash, geoArray *ga, GeoShape *shape, unsigned long limit) {
+    GeoHashFix52Bits min, max;
+
+    scoresOfGeoHashBox(hash,&min,&max);
+    return geoGetPointsInRange(zobj, min, max, shape, ga, limit);
+}
+
+/* Search all eight neighbors + self geohash box */
+int membersOfAllNeighbors(robj *zobj, GeoHashRadius n, GeoShape *shape, geoArray *ga, unsigned long limit) {
+    GeoHashBits neighbors[9];
+    unsigned int i, count = 0, last_processed = 0;
+    int debugmsg = 0;
+
+    neighbors[0] = n.hash;
+    neighbors[1] = n.neighbors.north;
+    neighbors[2] = n.neighbors.south;
+    neighbors[3] = n.neighbors.east;
+    neighbors[4] = n.neighbors.west;
+    neighbors[5] = n.neighbors.north_east;
+    neighbors[6] = n.neighbors.north_west;
+    neighbors[7] = n.neighbors.south_east;
+    neighbors[8] = n.neighbors.south_west;
+
+    /* For each neighbor (*and* our own hashbox), get all the matching
+     * members and add them to the potential result list. */
+    for (i = 0; i < sizeof(neighbors) / sizeof(*neighbors); i++) {
+        if (HASHISZERO(neighbors[i])) {
+            if (debugmsg) D("neighbors[%d] is zero",i);
+            continue;
+        }
+
+        /* Debugging info. */
+        if (debugmsg) {
+            GeoHashRange long_range, lat_range;
+            geohashGetCoordRange(&long_range,&lat_range);
+            GeoHashArea myarea = {{0}};
+            geohashDecode(long_range, lat_range, neighbors[i], &myarea);
+
+            /* Dump center square. */
+            D("neighbors[%d]:\n",i);
+            D("area.longitude.min: %f\n", myarea.longitude.min);
+            D("area.longitude.max: %f\n", myarea.longitude.max);
+            D("area.latitude.min: %f\n", myarea.latitude.min);
+            D("area.latitude.max: %f\n", myarea.latitude.max);
+            D("\n");
+        }
+
+        /* When a huge Radius (in the 5000 km range or more) is used,
+         * adjacent neighbors can be the same, leading to duplicated
+         * elements. Skip every range which is the same as the one
+         * processed previously. */
+        if (last_processed &&
+            neighbors[i].bits == neighbors[last_processed].bits &&
+            neighbors[i].step == neighbors[last_processed].step)
+        {
+            if (debugmsg)
+                D("Skipping processing of %d, same as previous\n",i);
+            continue;
+        }
+        if (ga->used && limit && ga->used >= limit) break;
+        count += membersOfGeoHashBox(zobj, neighbors[i], ga, shape, limit);
+        last_processed = i;
+    }
+    return count;
+}
+
+/* Sort comparators for qsort() */
+static int sort_gp_asc(const void *a, const void *b) {
+    const struct geoPoint *gpa = a, *gpb = b;
+    /* We can't do adist - bdist because they are doubles and
+     * the comparator returns an int. */
+    if (gpa->dist > gpb->dist)
+        return 1;
+    else if (gpa->dist == gpb->dist)
+        return 0;
+    else
+        return -1;
+}
+
+static int sort_gp_desc(const void *a, const void *b) {
+    return -sort_gp_asc(a, b);
+}
+
+/* ====================================================================
+ * Commands
+ * ==================================================================== */
+
+/* GEOADD key [CH] [NX|XX] long lat name [long2 lat2 name2 ... longN latN nameN] */
+void geoaddCommand(client *c) {
+    int xx = 0, nx = 0, longidx = 2;
+    int i;
+
+    /* Parse options. At the end 'longidx' is set to the argument position
+     * of the longitude of the first element. */
+    while (longidx < c->argc) {
+        char *opt = c->argv[longidx]->ptr;
+        if (!strcasecmp(opt,"nx")) nx = 1;
+        else if (!strcasecmp(opt,"xx")) xx = 1;
+        else if (!strcasecmp(opt,"ch")) {}
+        else break;
+        longidx++;
+    }
+
+    if ((c->argc - longidx) % 3 || (xx && nx)) {
+        /* Need an odd number of arguments if we got this far... */
+            addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Set up the vector for calling ZADD. */
+    int elements = (c->argc - longidx) / 3;
+    int argc = longidx+elements*2; /* ZADD key [CH] [NX|XX] score ele ... */
+    robj **argv = zcalloc(argc*sizeof(robj*));
+    argv[0] = createRawStringObject("zadd",4);
+    for (i = 1; i < longidx; i++) {
+        argv[i] = c->argv[i];
+        incrRefCount(argv[i]);
+    }
+
+    /* Create the argument vector to call ZADD in order to add all
+     * the score,value pairs to the requested zset, where score is actually
+     * an encoded version of lat,long. */
+    for (i = 0; i < elements; i++) {
+        double xy[2];
+
+        if (extractLongLatOrReply(c, (c->argv+longidx)+(i*3),xy) == C_ERR) {
+            for (i = 0; i < argc; i++)
+                if (argv[i]) decrRefCount(argv[i]);
+            zfree(argv);
+            return;
+        }
+
+        /* Turn the coordinates into the score of the element. */
+        GeoHashBits hash;
+        geohashEncodeWGS84(xy[0], xy[1], GEO_STEP_MAX, &hash);
+        GeoHashFix52Bits bits = geohashAlign52Bits(hash);
+        robj *score = createObject(OBJ_STRING, sdsfromlonglong(bits));
+        robj *val = c->argv[longidx + i * 3 + 2];
+        argv[longidx+i*2] = score;
+        argv[longidx+1+i*2] = val;
+        incrRefCount(val);
+    }
+
+    /* Finally call ZADD that will do the work for us. */
+    replaceClientCommandVector(c,argc,argv);
+    zaddCommand(c);
+}
+
+#define SORT_NONE 0
+#define SORT_ASC 1
+#define SORT_DESC 2
+
+#define RADIUS_COORDS (1<<0)    /* Search around coordinates. */
+#define RADIUS_MEMBER (1<<1)    /* Search around member. */
+#define RADIUS_NOSTORE (1<<2)   /* Do not accept STORE/STOREDIST option. */
+#define GEOSEARCH (1<<3)        /* GEOSEARCH command variant (different arguments supported) */
+#define GEOSEARCHSTORE (1<<4)   /* GEOSEARCHSTORE just accept STOREDIST option */
+
+/* GEORADIUS key x y radius unit [WITHDIST] [WITHHASH] [WITHCOORD] [ASC|DESC]
+ *                               [COUNT count [ANY]] [STORE key] [STOREDIST key]
+ * GEORADIUSBYMEMBER key member radius unit ... options ...
+ * GEOSEARCH key [FROMMEMBER member] [FROMLONLAT long lat] [BYRADIUS radius unit]
+ *               [BYBOX width height unit] [WITHCOORD] [WITHDIST] [WITHASH] [COUNT count [ANY]] [ASC|DESC]
+ * GEOSEARCHSTORE dest_key src_key [FROMMEMBER member] [FROMLONLAT long lat] [BYRADIUS radius unit]
+ *               [BYBOX width height unit] [WITHCORD] [WITHDIST] [WITHASH] [COUNT count [ANY]] [ASC|DESC] [STOREDIST]
+ *  */
+void georadiusGeneric(client *c, int srcKeyIndex, int flags) {
+    robj *storekey = NULL;
+    int storedist = 0; /* 0 for STORE, 1 for STOREDIST. */
+
+    /* Look up the requested zset */
+    robj *zobj = lookupKeyRead(c->db, c->argv[srcKeyIndex]);
+    if (checkType(c, zobj, OBJ_ZSET)) return;
+
+    /* Find long/lat to use for radius or box search based on inquiry type */
+    int base_args;
+    GeoShape shape = {0};
+    if (flags & RADIUS_COORDS) {
+        /* GEORADIUS or GEORADIUS_RO */
+        base_args = 6;
+        shape.type = CIRCULAR_TYPE;
+        if (extractLongLatOrReply(c, c->argv + 2, shape.xy) == C_ERR) return;
+        if (extractDistanceOrReply(c, c->argv+base_args-2, &shape.conversion, &shape.t.radius) != C_OK) return;
+    } else if ((flags & RADIUS_MEMBER) && !zobj) {
+        /* We don't have a source key, but we need to proceed with argument
+         * parsing, so we know which reply to use depending on the STORE flag. */
+        base_args = 5;
+    } else if (flags & RADIUS_MEMBER) {
+        /* GEORADIUSBYMEMBER or GEORADIUSBYMEMBER_RO */
+        base_args = 5;
+        shape.type = CIRCULAR_TYPE;
+        robj *member = c->argv[2];
+        if (longLatFromMember(zobj, member, shape.xy) == C_ERR) {
+            addReplyError(c, "could not decode requested zset member");
+            return;
+        }
+        if (extractDistanceOrReply(c, c->argv+base_args-2, &shape.conversion, &shape.t.radius) != C_OK) return;
+    } else if (flags & GEOSEARCH) {
+        /* GEOSEARCH or GEOSEARCHSTORE */
+        base_args = 2;
+        if (flags & GEOSEARCHSTORE) {
+            base_args = 3;
+            storekey = c->argv[1];
+        }
+    } else {
+        addReplyError(c, "Unknown georadius search type");
+        return;
+    }
+
+    /* Discover and populate all optional parameters. */
+    int withdist = 0, withhash = 0, withcoords = 0;
+    int frommember = 0, fromloc = 0, byradius = 0, bybox = 0;
+    int sort = SORT_NONE;
+    int any = 0; /* any=1 means a limited search, stop as soon as enough results were found. */
+    long long count = 0;  /* Max number of results to return. 0 means unlimited. */
+    if (c->argc > base_args) {
+        int remaining = c->argc - base_args;
+        for (int i = 0; i < remaining; i++) {
+            char *arg = c->argv[base_args + i]->ptr;
+            if (!strcasecmp(arg, "withdist")) {
+                withdist = 1;
+            } else if (!strcasecmp(arg, "withhash")) {
+                withhash = 1;
+            } else if (!strcasecmp(arg, "withcoord")) {
+                withcoords = 1;
+            } else if (!strcasecmp(arg, "any")) {
+                any = 1;
+            } else if (!strcasecmp(arg, "asc")) {
+                sort = SORT_ASC;
+            } else if (!strcasecmp(arg, "desc")) {
+                sort = SORT_DESC;
+            } else if (!strcasecmp(arg, "count") && (i+1) < remaining) {
+                if (getLongLongFromObjectOrReply(c, c->argv[base_args+i+1],
+                                                 &count, NULL) != C_OK) return;
+                if (count <= 0) {
+                    addReplyError(c,"COUNT must be > 0");
+                    return;
+                }
+                i++;
+            } else if (!strcasecmp(arg, "store") &&
+                       (i+1) < remaining &&
+                       !(flags & RADIUS_NOSTORE) &&
+                       !(flags & GEOSEARCH))
+            {
+                storekey = c->argv[base_args+i+1];
+                storedist = 0;
+                i++;
+            } else if (!strcasecmp(arg, "storedist") &&
+                       (i+1) < remaining &&
+                       !(flags & RADIUS_NOSTORE) &&
+                       !(flags & GEOSEARCH))
+            {
+                storekey = c->argv[base_args+i+1];
+                storedist = 1;
+                i++;
+            } else if (!strcasecmp(arg, "storedist") &&
+                       (flags & GEOSEARCH) &&
+                       (flags & GEOSEARCHSTORE))
+            {
+                storedist = 1;
+            } else if (!strcasecmp(arg, "frommember") &&
+                      (i+1) < remaining &&
+                      flags & GEOSEARCH &&
+                      !fromloc)
+            {
+                /* No source key, proceed with argument parsing and return an error when done. */
+                if (zobj == NULL) {
+                    frommember = 1;
+                    i++;
+                    continue;
+                }
+
+                if (longLatFromMember(zobj, c->argv[base_args+i+1], shape.xy) == C_ERR) {
+                    addReplyError(c, "could not decode requested zset member");
+                    return;
+                }
+                frommember = 1;
+                i++;
+            } else if (!strcasecmp(arg, "fromlonlat") &&
+                       (i+2) < remaining &&
+                       flags & GEOSEARCH &&
+                       !frommember)
+            {
+                if (extractLongLatOrReply(c, c->argv+base_args+i+1, shape.xy) == C_ERR) return;
+                fromloc = 1;
+                i += 2;
+            } else if (!strcasecmp(arg, "byradius") &&
+                       (i+2) < remaining &&
+                       flags & GEOSEARCH &&
+                       !bybox)
+            {
+                if (extractDistanceOrReply(c, c->argv+base_args+i+1, &shape.conversion, &shape.t.radius) != C_OK)
+                    return;
+                shape.type = CIRCULAR_TYPE;
+                byradius = 1;
+                i += 2;
+            } else if (!strcasecmp(arg, "bybox") &&
+                       (i+3) < remaining &&
+                       flags & GEOSEARCH &&
+                       !byradius)
+            {
+                if (extractBoxOrReply(c, c->argv+base_args+i+1, &shape.conversion, &shape.t.r.width,
+                        &shape.t.r.height) != C_OK) return;
+                shape.type = RECTANGLE_TYPE;
+                bybox = 1;
+                i += 3;
+            } else {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+    }
+
+    /* Trap options not compatible with STORE and STOREDIST. */
+    if (storekey && (withdist || withhash || withcoords)) {
+        addReplyError(c,
+            "STORE option in GEORADIUS is not compatible with "
+            "WITHDIST, WITHHASH and WITHCOORDS options");
+        return;
+    }
+
+    if ((flags & GEOSEARCH) && !(frommember || fromloc)) {
+        addReplyErrorFormat(c,
+            "exactly one of FROMMEMBER or FROMLONLAT can be specified for %s",
+            (char *)c->argv[0]->ptr);
+        return;
+    }
+
+    if ((flags & GEOSEARCH) && !(byradius || bybox)) {
+        addReplyErrorFormat(c,
+            "exactly one of BYRADIUS and BYBOX can be specified for %s",
+            (char *)c->argv[0]->ptr);
+        return;
+    }
+
+    if (any && !count) {
+        addReplyErrorFormat(c, "the ANY argument requires COUNT argument");
+        return;
+    }
+
+    /* Return ASAP when src key does not exist. */
+    if (zobj == NULL) {
+        if (storekey) {
+            /* store key is not NULL, try to delete it and return 0. */
+            if (dbDelete(c->db, storekey)) {
+                signalModifiedKey(c, c->db, storekey);
+                notifyKeyspaceEvent(NOTIFY_GENERIC, "del", storekey, c->db->id);
+                server.dirty++;
+            }
+            addReply(c, shared.czero);
+        } else {
+            /* Otherwise we return an empty array. */
+            addReply(c, shared.emptyarray);
+        }
+        return;
+    }
+
+    /* COUNT without ordering does not make much sense (we need to
+     * sort in order to return the closest N entries),
+     * force ASC ordering if COUNT was specified but no sorting was
+     * requested. Note that this is not needed for ANY option. */
+    if (count != 0 && sort == SORT_NONE && !any) sort = SORT_ASC;
+
+    /* Get all neighbor geohash boxes for our radius search */
+    GeoHashRadius georadius = geohashCalculateAreasByShapeWGS84(&shape);
+
+    /* Search the zset for all matching points */
+    geoArray *ga = geoArrayCreate();
+    membersOfAllNeighbors(zobj, georadius, &shape, ga, any ? count : 0);
+
+    /* If no matching results, the user gets an empty reply. */
+    if (ga->used == 0 && storekey == NULL) {
+        addReply(c,shared.emptyarray);
+        geoArrayFree(ga);
+        return;
+    }
+
+    long result_length = ga->used;
+    long returned_items = (count == 0 || result_length < count) ?
+                          result_length : count;
+    long option_length = 0;
+
+    /* Process [optional] requested sorting */
+    if (sort != SORT_NONE) {
+        int (*sort_gp_callback)(const void *a, const void *b) = NULL;
+        if (sort == SORT_ASC) {
+            sort_gp_callback = sort_gp_asc;
+        } else if (sort == SORT_DESC) {
+            sort_gp_callback = sort_gp_desc;
+        }
+
+        if (returned_items == result_length) {
+            qsort(ga->array, result_length, sizeof(geoPoint), sort_gp_callback);
+        } else {
+            pqsort(ga->array, result_length, sizeof(geoPoint), sort_gp_callback,
+                0, (returned_items - 1));
+        }
+    }
+
+    if (storekey == NULL) {
+        /* No target key, return results to user. */
+
+        /* Our options are self-contained nested multibulk replies, so we
+         * only need to track how many of those nested replies we return. */
+        if (withdist)
+            option_length++;
+
+        if (withcoords)
+            option_length++;
+
+        if (withhash)
+            option_length++;
+
+        /* The array len we send is exactly result_length. The result is
+         * either all strings of just zset members  *or* a nested multi-bulk
+         * reply containing the zset member string _and_ all the additional
+         * options the user enabled for this request. */
+        addReplyArrayLen(c, returned_items);
+
+        /* Finally send results back to the caller */
+        int i;
+        for (i = 0; i < returned_items; i++) {
+            geoPoint *gp = ga->array+i;
+            gp->dist /= shape.conversion; /* Fix according to unit. */
+
+            /* If we have options in option_length, return each sub-result
+             * as a nested multi-bulk.  Add 1 to account for result value
+             * itself. */
+            if (option_length)
+                addReplyArrayLen(c, option_length + 1);
+
+            addReplyBulkSds(c,gp->member);
+            gp->member = NULL;
+
+            if (withdist)
+                addReplyDoubleDistance(c, gp->dist);
+
+            if (withhash)
+                addReplyLongLong(c, gp->score);
+
+            if (withcoords) {
+                addReplyArrayLen(c, 2);
+                addReplyHumanLongDouble(c, gp->longitude);
+                addReplyHumanLongDouble(c, gp->latitude);
+            }
+        }
+    } else {
+        /* Target key, create a sorted set with the results. */
+        robj *zobj;
+        zset *zs;
+        int i;
+        size_t maxelelen = 0, totelelen = 0;
+
+        if (returned_items) {
+            zobj = createZsetObject();
+            zs = zobj->ptr;
+        }
+
+        for (i = 0; i < returned_items; i++) {
+            zskiplistNode *znode;
+            geoPoint *gp = ga->array+i;
+            gp->dist /= shape.conversion; /* Fix according to unit. */
+            double score = storedist ? gp->dist : gp->score;
+            size_t elelen = sdslen(gp->member);
+
+            if (maxelelen < elelen) maxelelen = elelen;
+            totelelen += elelen;
+            znode = zslInsert(zs->zsl,score,gp->member);
+            serverAssert(dictAdd(zs->dict,gp->member,&znode->score) == DICT_OK);
+            gp->member = NULL;
+        }
+
+        if (returned_items) {
+            zsetConvertToZiplistIfNeeded(zobj,maxelelen,totelelen);
+            setKey(c,c->db,storekey,zobj);
+            decrRefCount(zobj);
+            notifyKeyspaceEvent(NOTIFY_ZSET,flags & GEOSEARCH ? "geosearchstore" : "georadiusstore",storekey,
+                                c->db->id);
+            server.dirty += returned_items;
+        } else if (dbDelete(c->db,storekey)) {
+            signalModifiedKey(c,c->db,storekey);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",storekey,c->db->id);
+            server.dirty++;
+        }
+        addReplyLongLong(c, returned_items);
+    }
+    geoArrayFree(ga);
+}
+
+/* GEORADIUS wrapper function. */
+void georadiusCommand(client *c) {
+    georadiusGeneric(c, 1, RADIUS_COORDS);
+}
+
+/* GEORADIUSBYMEMBER wrapper function. */
+void georadiusbymemberCommand(client *c) {
+    georadiusGeneric(c, 1, RADIUS_MEMBER);
+}
+
+/* GEORADIUS_RO wrapper function. */
+void georadiusroCommand(client *c) {
+    georadiusGeneric(c, 1, RADIUS_COORDS|RADIUS_NOSTORE);
+}
+
+/* GEORADIUSBYMEMBER_RO wrapper function. */
+void georadiusbymemberroCommand(client *c) {
+    georadiusGeneric(c, 1, RADIUS_MEMBER|RADIUS_NOSTORE);
+}
+
+void geosearchCommand(client *c) {
+    georadiusGeneric(c, 1, GEOSEARCH);
+}
+
+void geosearchstoreCommand(client *c) {
+    georadiusGeneric(c, 2, GEOSEARCH|GEOSEARCHSTORE);
+}
+
+/* GEOHASH key ele1 ele2 ... eleN
+ *
+ * Returns an array with an 11 characters geohash representation of the
+ * position of the specified elements. */
+void geohashCommand(client *c) {
+    char *geoalphabet= "0123456789bcdefghjkmnpqrstuvwxyz";
+    int j;
+
+    /* Look up the requested zset */
+    robj *zobj = lookupKeyRead(c->db, c->argv[1]);
+    if (checkType(c, zobj, OBJ_ZSET)) return;
+
+    /* Geohash elements one after the other, using a null bulk reply for
+     * missing elements. */
+    addReplyArrayLen(c,c->argc-2);
+    for (j = 2; j < c->argc; j++) {
+        double score;
+        if (!zobj || zsetScore(zobj, c->argv[j]->ptr, &score) == C_ERR) {
+            addReplyNull(c);
+        } else {
+            /* The internal format we use for geocoding is a bit different
+             * than the standard, since we use as initial latitude range
+             * -85,85, while the normal geohashing algorithm uses -90,90.
+             * So we have to decode our position and re-encode using the
+             * standard ranges in order to output a valid geohash string. */
+
+            /* Decode... */
+            double xy[2];
+            if (!decodeGeohash(score,xy)) {
+                addReplyNull(c);
+                continue;
+            }
+
+            /* Re-encode */
+            GeoHashRange r[2];
+            GeoHashBits hash;
+            r[0].min = -180;
+            r[0].max = 180;
+            r[1].min = -90;
+            r[1].max = 90;
+            geohashEncode(&r[0],&r[1],xy[0],xy[1],26,&hash);
+
+            char buf[12];
+            int i;
+            for (i = 0; i < 11; i++) {
+                int idx;
+                if (i == 10) {
+                    /* We have just 52 bits, but the API used to output
+                     * an 11 bytes geohash. For compatibility we assume
+                     * zero. */
+                    idx = 0;
+                } else {
+                    idx = (hash.bits >> (52-((i+1)*5))) & 0x1f;
+                }
+                buf[i] = geoalphabet[idx];
+            }
+            buf[11] = '\0';
+            addReplyBulkCBuffer(c,buf,11);
+        }
+    }
+}
+
+/* GEOPOS key ele1 ele2 ... eleN
+ *
+ * Returns an array of two-items arrays representing the x,y position of each
+ * element specified in the arguments. For missing elements NULL is returned. */
+void geoposCommand(client *c) {
+    int j;
+
+    /* Look up the requested zset */
+    robj *zobj = lookupKeyRead(c->db, c->argv[1]);
+    if (checkType(c, zobj, OBJ_ZSET)) return;
+
+    /* Report elements one after the other, using a null bulk reply for
+     * missing elements. */
+    addReplyArrayLen(c,c->argc-2);
+    for (j = 2; j < c->argc; j++) {
+        double score;
+        if (!zobj || zsetScore(zobj, c->argv[j]->ptr, &score) == C_ERR) {
+            addReplyNullArray(c);
+        } else {
+            /* Decode... */
+            double xy[2];
+            if (!decodeGeohash(score,xy)) {
+                addReplyNullArray(c);
+                continue;
+            }
+            addReplyArrayLen(c,2);
+            addReplyHumanLongDouble(c,xy[0]);
+            addReplyHumanLongDouble(c,xy[1]);
+        }
+    }
+}
+
+/* GEODIST key ele1 ele2 [unit]
+ *
+ * Return the distance, in meters by default, otherwise according to "unit",
+ * between points ele1 and ele2. If one or more elements are missing NULL
+ * is returned. */
+void geodistCommand(client *c) {
+    double to_meter = 1;
+
+    /* Check if there is the unit to extract, otherwise assume meters. */
+    if (c->argc == 5) {
+        to_meter = extractUnitOrReply(c,c->argv[4]);
+        if (to_meter < 0) return;
+    } else if (c->argc > 5) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Look up the requested zset */
+    robj *zobj = NULL;
+    if ((zobj = lookupKeyReadOrReply(c, c->argv[1], shared.null[c->resp]))
+        == NULL || checkType(c, zobj, OBJ_ZSET)) return;
+
+    /* Get the scores. We need both otherwise NULL is returned. */
+    double score1, score2, xyxy[4];
+    if (zsetScore(zobj, c->argv[2]->ptr, &score1) == C_ERR ||
+        zsetScore(zobj, c->argv[3]->ptr, &score2) == C_ERR)
+    {
+        addReplyNull(c);
+        return;
+    }
+
+    /* Decode & compute the distance. */
+    if (!decodeGeohash(score1,xyxy) || !decodeGeohash(score2,xyxy+2))
+        addReplyNull(c);
+    else
+        addReplyDoubleDistance(c,
+            geohashGetDistance(xyxy[0],xyxy[1],xyxy[2],xyxy[3]) / to_meter);
+}
diff --git a/redis-stable/src/geo.h b/redis-stable/src/geo.h
new file mode 100644
index 00000000..79d0a6a4
--- /dev/null
+++ b/redis-stable/src/geo.h
@@ -0,0 +1,22 @@
+#ifndef __GEO_H__
+#define __GEO_H__
+
+#include "server.h"
+
+/* Structures used inside geo.c in order to represent points and array of
+ * points on the earth. */
+typedef struct geoPoint {
+    double longitude;
+    double latitude;
+    double dist;
+    double score;
+    char *member;
+} geoPoint;
+
+typedef struct geoArray {
+    struct geoPoint *array;
+    size_t buckets;
+    size_t used;
+} geoArray;
+
+#endif
diff --git a/redis-stable/src/geohash.c b/redis-stable/src/geohash.c
new file mode 100644
index 00000000..de9620b7
--- /dev/null
+++ b/redis-stable/src/geohash.c
@@ -0,0 +1,299 @@
+/*
+ * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
+ * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *  * Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *  * Neither the name of Redis nor the names of its contributors may be used
+ *    to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ * THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#include "geohash.h"
+
+/**
+ * Hashing works like this:
+ * Divide the world into 4 buckets.  Label each one as such:
+ *  -----------------
+ *  |       |       |
+ *  |       |       |
+ *  | 0,1   | 1,1   |
+ *  -----------------
+ *  |       |       |
+ *  |       |       |
+ *  | 0,0   | 1,0   |
+ *  -----------------
+ */
+
+/* Interleave lower bits of x and y, so the bits of x
+ * are in the even positions and bits from y in the odd;
+ * x and y must initially be less than 2**32 (65536).
+ * From:  https://graphics.stanford.edu/~seander/bithacks.html#InterleaveBMN
+ */
+static inline uint64_t interleave64(uint32_t xlo, uint32_t ylo) {
+    static const uint64_t B[] = {0x5555555555555555ULL, 0x3333333333333333ULL,
+                                 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
+                                 0x0000FFFF0000FFFFULL};
+    static const unsigned int S[] = {1, 2, 4, 8, 16};
+
+    uint64_t x = xlo;
+    uint64_t y = ylo;
+
+    x = (x | (x << S[4])) & B[4];
+    y = (y | (y << S[4])) & B[4];
+
+    x = (x | (x << S[3])) & B[3];
+    y = (y | (y << S[3])) & B[3];
+
+    x = (x | (x << S[2])) & B[2];
+    y = (y | (y << S[2])) & B[2];
+
+    x = (x | (x << S[1])) & B[1];
+    y = (y | (y << S[1])) & B[1];
+
+    x = (x | (x << S[0])) & B[0];
+    y = (y | (y << S[0])) & B[0];
+
+    return x | (y << 1);
+}
+
+/* reverse the interleave process
+ * derived from http://stackoverflow.com/questions/4909263
+ */
+static inline uint64_t deinterleave64(uint64_t interleaved) {
+    static const uint64_t B[] = {0x5555555555555555ULL, 0x3333333333333333ULL,
+                                 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
+                                 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL};
+    static const unsigned int S[] = {0, 1, 2, 4, 8, 16};
+
+    uint64_t x = interleaved;
+    uint64_t y = interleaved >> 1;
+
+    x = (x | (x >> S[0])) & B[0];
+    y = (y | (y >> S[0])) & B[0];
+
+    x = (x | (x >> S[1])) & B[1];
+    y = (y | (y >> S[1])) & B[1];
+
+    x = (x | (x >> S[2])) & B[2];
+    y = (y | (y >> S[2])) & B[2];
+
+    x = (x | (x >> S[3])) & B[3];
+    y = (y | (y >> S[3])) & B[3];
+
+    x = (x | (x >> S[4])) & B[4];
+    y = (y | (y >> S[4])) & B[4];
+
+    x = (x | (x >> S[5])) & B[5];
+    y = (y | (y >> S[5])) & B[5];
+
+    return x | (y << 32);
+}
+
+void geohashGetCoordRange(GeoHashRange *long_range, GeoHashRange *lat_range) {
+    /* These are constraints from EPSG:900913 / EPSG:3785 / OSGEO:41001 */
+    /* We can't geocode at the north/south pole. */
+    long_range->max = GEO_LONG_MAX;
+    long_range->min = GEO_LONG_MIN;
+    lat_range->max = GEO_LAT_MAX;
+    lat_range->min = GEO_LAT_MIN;
+}
+
+int geohashEncode(const GeoHashRange *long_range, const GeoHashRange *lat_range,
+                  double longitude, double latitude, uint8_t step,
+                  GeoHashBits *hash) {
+    /* Check basic arguments sanity. */
+    if (hash == NULL || step > 32 || step == 0 ||
+        RANGEPISZERO(lat_range) || RANGEPISZERO(long_range)) return 0;
+
+    /* Return an error when trying to index outside the supported
+     * constraints. */
+    if (longitude > GEO_LONG_MAX || longitude < GEO_LONG_MIN ||
+        latitude > GEO_LAT_MAX || latitude < GEO_LAT_MIN) return 0;
+
+    hash->bits = 0;
+    hash->step = step;
+
+    if (latitude < lat_range->min || latitude > lat_range->max ||
+        longitude < long_range->min || longitude > long_range->max) {
+        return 0;
+    }
+
+    double lat_offset =
+        (latitude - lat_range->min) / (lat_range->max - lat_range->min);
+    double long_offset =
+        (longitude - long_range->min) / (long_range->max - long_range->min);
+
+    /* convert to fixed point based on the step size */
+    lat_offset *= (1ULL << step);
+    long_offset *= (1ULL << step);
+    hash->bits = interleave64(lat_offset, long_offset);
+    return 1;
+}
+
+int geohashEncodeType(double longitude, double latitude, uint8_t step, GeoHashBits *hash) {
+    GeoHashRange r[2] = {{0}};
+    geohashGetCoordRange(&r[0], &r[1]);
+    return geohashEncode(&r[0], &r[1], longitude, latitude, step, hash);
+}
+
+int geohashEncodeWGS84(double longitude, double latitude, uint8_t step,
+                       GeoHashBits *hash) {
+    return geohashEncodeType(longitude, latitude, step, hash);
+}
+
+int geohashDecode(const GeoHashRange long_range, const GeoHashRange lat_range,
+                   const GeoHashBits hash, GeoHashArea *area) {
+    if (HASHISZERO(hash) || NULL == area || RANGEISZERO(lat_range) ||
+        RANGEISZERO(long_range)) {
+        return 0;
+    }
+
+    area->hash = hash;
+    uint8_t step = hash.step;
+    uint64_t hash_sep = deinterleave64(hash.bits); /* hash = [LAT][LONG] */
+
+    double lat_scale = lat_range.max - lat_range.min;
+    double long_scale = long_range.max - long_range.min;
+
+    uint32_t ilato = hash_sep;       /* get lat part of deinterleaved hash */
+    uint32_t ilono = hash_sep >> 32; /* shift over to get long part of hash */
+
+    /* divide by 2**step.
+     * Then, for 0-1 coordinate, multiply times scale and add
+       to the min to get the absolute coordinate. */
+    area->latitude.min =
+        lat_range.min + (ilato * 1.0 / (1ull << step)) * lat_scale;
+    area->latitude.max =
+        lat_range.min + ((ilato + 1) * 1.0 / (1ull << step)) * lat_scale;
+    area->longitude.min =
+        long_range.min + (ilono * 1.0 / (1ull << step)) * long_scale;
+    area->longitude.max =
+        long_range.min + ((ilono + 1) * 1.0 / (1ull << step)) * long_scale;
+
+    return 1;
+}
+
+int geohashDecodeType(const GeoHashBits hash, GeoHashArea *area) {
+    GeoHashRange r[2] = {{0}};
+    geohashGetCoordRange(&r[0], &r[1]);
+    return geohashDecode(r[0], r[1], hash, area);
+}
+
+int geohashDecodeWGS84(const GeoHashBits hash, GeoHashArea *area) {
+    return geohashDecodeType(hash, area);
+}
+
+int geohashDecodeAreaToLongLat(const GeoHashArea *area, double *xy) {
+    if (!xy) return 0;
+    xy[0] = (area->longitude.min + area->longitude.max) / 2;
+    if (xy[0] > GEO_LONG_MAX) xy[0] = GEO_LONG_MAX;
+    if (xy[0] < GEO_LONG_MIN) xy[0] = GEO_LONG_MIN;
+    xy[1] = (area->latitude.min + area->latitude.max) / 2;
+    if (xy[1] > GEO_LAT_MAX) xy[1] = GEO_LAT_MAX;
+    if (xy[1] < GEO_LAT_MIN) xy[1] = GEO_LAT_MIN;
+    return 1;
+}
+
+int geohashDecodeToLongLatType(const GeoHashBits hash, double *xy) {
+    GeoHashArea area = {{0}};
+    if (!xy || !geohashDecodeType(hash, &area))
+        return 0;
+    return geohashDecodeAreaToLongLat(&area, xy);
+}
+
+int geohashDecodeToLongLatWGS84(const GeoHashBits hash, double *xy) {
+    return geohashDecodeToLongLatType(hash, xy);
+}
+
+static void geohash_move_x(GeoHashBits *hash, int8_t d) {
+    if (d == 0)
+        return;
+
+    uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL;
+    uint64_t y = hash->bits & 0x5555555555555555ULL;
+
+    uint64_t zz = 0x5555555555555555ULL >> (64 - hash->step * 2);
+
+    if (d > 0) {
+        x = x + (zz + 1);
+    } else {
+        x = x | zz;
+        x = x - (zz + 1);
+    }
+
+    x &= (0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2));
+    hash->bits = (x | y);
+}
+
+static void geohash_move_y(GeoHashBits *hash, int8_t d) {
+    if (d == 0)
+        return;
+
+    uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL;
+    uint64_t y = hash->bits & 0x5555555555555555ULL;
+
+    uint64_t zz = 0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2);
+    if (d > 0) {
+        y = y + (zz + 1);
+    } else {
+        y = y | zz;
+        y = y - (zz + 1);
+    }
+    y &= (0x5555555555555555ULL >> (64 - hash->step * 2));
+    hash->bits = (x | y);
+}
+
+void geohashNeighbors(const GeoHashBits *hash, GeoHashNeighbors *neighbors) {
+    neighbors->east = *hash;
+    neighbors->west = *hash;
+    neighbors->north = *hash;
+    neighbors->south = *hash;
+    neighbors->south_east = *hash;
+    neighbors->south_west = *hash;
+    neighbors->north_east = *hash;
+    neighbors->north_west = *hash;
+
+    geohash_move_x(&neighbors->east, 1);
+    geohash_move_y(&neighbors->east, 0);
+
+    geohash_move_x(&neighbors->west, -1);
+    geohash_move_y(&neighbors->west, 0);
+
+    geohash_move_x(&neighbors->south, 0);
+    geohash_move_y(&neighbors->south, -1);
+
+    geohash_move_x(&neighbors->north, 0);
+    geohash_move_y(&neighbors->north, 1);
+
+    geohash_move_x(&neighbors->north_west, -1);
+    geohash_move_y(&neighbors->north_west, 1);
+
+    geohash_move_x(&neighbors->north_east, 1);
+    geohash_move_y(&neighbors->north_east, 1);
+
+    geohash_move_x(&neighbors->south_east, 1);
+    geohash_move_y(&neighbors->south_east, -1);
+
+    geohash_move_x(&neighbors->south_west, -1);
+    geohash_move_y(&neighbors->south_west, -1);
+}
diff --git a/redis-stable/src/geohash.h b/redis-stable/src/geohash.h
new file mode 100644
index 00000000..ebe52ff3
--- /dev/null
+++ b/redis-stable/src/geohash.h
@@ -0,0 +1,137 @@
+/*
+ * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
+ * Copyright (c) 2015, Salvatore Sanfilippo <antirez@gmail.com>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *  * Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *  * Neither the name of Redis nor the names of its contributors may be used
+ *    to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ * THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef GEOHASH_H_
+#define GEOHASH_H_
+
+#include <stddef.h>
+#include <stdint.h>
+#include <stdint.h>
+
+#if defined(__cplusplus)
+extern "C" {
+#endif
+
+#define HASHISZERO(r) (!(r).bits && !(r).step)
+#define RANGEISZERO(r) (!(r).max && !(r).min)
+#define RANGEPISZERO(r) (r == NULL || RANGEISZERO(*r))
+
+#define GEO_STEP_MAX 26 /* 26*2 = 52 bits. */
+
+/* Limits from EPSG:900913 / EPSG:3785 / OSGEO:41001 */
+#define GEO_LAT_MIN -85.05112878
+#define GEO_LAT_MAX 85.05112878
+#define GEO_LONG_MIN -180
+#define GEO_LONG_MAX 180
+
+typedef enum {
+    GEOHASH_NORTH = 0,
+    GEOHASH_EAST,
+    GEOHASH_WEST,
+    GEOHASH_SOUTH,
+    GEOHASH_SOUTH_WEST,
+    GEOHASH_SOUTH_EAST,
+    GEOHASH_NORT_WEST,
+    GEOHASH_NORT_EAST
+} GeoDirection;
+
+typedef struct {
+    uint64_t bits;
+    uint8_t step;
+} GeoHashBits;
+
+typedef struct {
+    double min;
+    double max;
+} GeoHashRange;
+
+typedef struct {
+    GeoHashBits hash;
+    GeoHashRange longitude;
+    GeoHashRange latitude;
+} GeoHashArea;
+
+typedef struct {
+    GeoHashBits north;
+    GeoHashBits east;
+    GeoHashBits west;
+    GeoHashBits south;
+    GeoHashBits north_east;
+    GeoHashBits south_east;
+    GeoHashBits north_west;
+    GeoHashBits south_west;
+} GeoHashNeighbors;
+
+#define CIRCULAR_TYPE 1
+#define RECTANGLE_TYPE 2
+typedef struct {
+    int type; /* search type */
+    double xy[2]; /* search center point, xy[0]: lon, xy[1]: lat */
+    double conversion; /* km: 1000 */
+    double bounds[4]; /* bounds[0]: min_lon, bounds[1]: min_lat
+                       * bounds[2]: max_lon, bounds[3]: max_lat */
+    union {
+        /* CIRCULAR_TYPE */
+        double radius;
+        /* RECTANGLE_TYPE */
+        struct {
+            double height;
+            double width;
+        } r;
+    } t;
+} GeoShape;
+
+/*
+ * 0:success
+ * -1:failed
+ */
+void geohashGetCoordRange(GeoHashRange *long_range, GeoHashRange *lat_range);
+int geohashEncode(const GeoHashRange *long_range, const GeoHashRange *lat_range,
+                  double longitude, double latitude, uint8_t step,
+                  GeoHashBits *hash);
+int geohashEncodeType(double longitude, double latitude,
+                      uint8_t step, GeoHashBits *hash);
+int geohashEncodeWGS84(double longitude, double latitude, uint8_t step,
+                       GeoHashBits *hash);
+int geohashDecode(const GeoHashRange long_range, const GeoHashRange lat_range,
+                  const GeoHashBits hash, GeoHashArea *area);
+int geohashDecodeType(const GeoHashBits hash, GeoHashArea *area);
+int geohashDecodeWGS84(const GeoHashBits hash, GeoHashArea *area);
+int geohashDecodeAreaToLongLat(const GeoHashArea *area, double *xy);
+int geohashDecodeToLongLatType(const GeoHashBits hash, double *xy);
+int geohashDecodeToLongLatWGS84(const GeoHashBits hash, double *xy);
+int geohashDecodeToLongLatMercator(const GeoHashBits hash, double *xy);
+void geohashNeighbors(const GeoHashBits *hash, GeoHashNeighbors *neighbors);
+
+#if defined(__cplusplus)
+}
+#endif
+#endif /* GEOHASH_H_ */
diff --git a/redis-stable/src/geohash_helper.c b/redis-stable/src/geohash_helper.c
new file mode 100644
index 00000000..fec193e8
--- /dev/null
+++ b/redis-stable/src/geohash_helper.c
@@ -0,0 +1,263 @@
+/*
+ * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
+ * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *  * Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *  * Neither the name of Redis nor the names of its contributors may be used
+ *    to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ * THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* This is a C++ to C conversion from the ardb project.
+ * This file started out as:
+ * https://github.com/yinqiwen/ardb/blob/d42503/src/geo/geohash_helper.cpp
+ */
+
+#include "fmacros.h"
+#include "geohash_helper.h"
+#include "debugmacro.h"
+#include <math.h>
+
+#define D_R (M_PI / 180.0)
+#define R_MAJOR 6378137.0
+#define R_MINOR 6356752.3142
+#define RATIO (R_MINOR / R_MAJOR)
+#define ECCENT (sqrt(1.0 - (RATIO *RATIO)))
+#define COM (0.5 * ECCENT)
+
+/// @brief The usual PI/180 constant
+const double DEG_TO_RAD = 0.017453292519943295769236907684886;
+/// @brief Earth's quatratic mean radius for WGS-84
+const double EARTH_RADIUS_IN_METERS = 6372797.560856;
+
+const double MERCATOR_MAX = 20037726.37;
+const double MERCATOR_MIN = -20037726.37;
+
+static inline double deg_rad(double ang) { return ang * D_R; }
+static inline double rad_deg(double ang) { return ang / D_R; }
+
+/* This function is used in order to estimate the step (bits precision)
+ * of the 9 search area boxes during radius queries. */
+uint8_t geohashEstimateStepsByRadius(double range_meters, double lat) {
+    if (range_meters == 0) return 26;
+    int step = 1;
+    while (range_meters < MERCATOR_MAX) {
+        range_meters *= 2;
+        step++;
+    }
+    step -= 2; /* Make sure range is included in most of the base cases. */
+
+    /* Wider range towards the poles... Note: it is possible to do better
+     * than this approximation by computing the distance between meridians
+     * at this latitude, but this does the trick for now. */
+    if (lat > 66 || lat < -66) {
+        step--;
+        if (lat > 80 || lat < -80) step--;
+    }
+
+    /* Frame to valid range. */
+    if (step < 1) step = 1;
+    if (step > 26) step = 26;
+    return step;
+}
+
+/* Return the bounding box of the search area by shape (see geohash.h GeoShape)
+ * bounds[0] - bounds[2] is the minimum and maximum longitude
+ * while bounds[1] - bounds[3] is the minimum and maximum latitude.
+ * since the higher the latitude, the shorter the arc length, the box shape is as follows
+ * (left and right edges are actually bent), as shown in the following diagram:
+ *
+ *    \-----------------/          --------               \-----------------/
+ *     \               /         /          \              \               /
+ *      \  (long,lat) /         / (long,lat) \              \  (long,lat) /
+ *       \           /         /              \              /            \
+ *         ---------          /----------------\            /--------------\
+ *  Northern Hemisphere       Southern Hemisphere         Around the equator
+ */
+int geohashBoundingBox(GeoShape *shape, double *bounds) {
+    if (!bounds) return 0;
+    double longitude = shape->xy[0];
+    double latitude = shape->xy[1];
+    double height = shape->conversion * (shape->type == CIRCULAR_TYPE ? shape->t.radius : shape->t.r.height/2);
+    double width = shape->conversion * (shape->type == CIRCULAR_TYPE ? shape->t.radius : shape->t.r.width/2);
+
+    const double lat_delta = rad_deg(height/EARTH_RADIUS_IN_METERS);
+    const double long_delta_top = rad_deg(width/EARTH_RADIUS_IN_METERS/cos(deg_rad(latitude+lat_delta)));
+    const double long_delta_bottom = rad_deg(width/EARTH_RADIUS_IN_METERS/cos(deg_rad(latitude-lat_delta)));
+    /* The directions of the northern and southern hemispheres
+     * are opposite, so we choice different points as min/max long/lat */
+    int southern_hemisphere = latitude < 0 ? 1 : 0;
+    bounds[0] = southern_hemisphere ? longitude-long_delta_bottom : longitude-long_delta_top;
+    bounds[2] = southern_hemisphere ? longitude+long_delta_bottom : longitude+long_delta_top;
+    bounds[1] = latitude - lat_delta;
+    bounds[3] = latitude + lat_delta;
+    return 1;
+}
+
+/* Calculate a set of areas (center + 8) that are able to cover a range query
+ * for the specified position and shape (see geohash.h GeoShape).
+ * the bounding box saved in shaple.bounds */
+GeoHashRadius geohashCalculateAreasByShapeWGS84(GeoShape *shape) {
+    GeoHashRange long_range, lat_range;
+    GeoHashRadius radius;
+    GeoHashBits hash;
+    GeoHashNeighbors neighbors;
+    GeoHashArea area;
+    double min_lon, max_lon, min_lat, max_lat;
+    int steps;
+
+    geohashBoundingBox(shape, shape->bounds);
+    min_lon = shape->bounds[0];
+    min_lat = shape->bounds[1];
+    max_lon = shape->bounds[2];
+    max_lat = shape->bounds[3];
+
+    double longitude = shape->xy[0];
+    double latitude = shape->xy[1];
+    /* radius_meters is calculated differently in different search types:
+     * 1) CIRCULAR_TYPE, just use radius.
+     * 2) RECTANGLE_TYPE, we use sqrt((width/2)^2 + (height/2)^2) to
+     * calculate the distance from the center point to the corner */
+    double radius_meters = shape->type == CIRCULAR_TYPE ? shape->t.radius :
+            sqrt((shape->t.r.width/2)*(shape->t.r.width/2) + (shape->t.r.height/2)*(shape->t.r.height/2));
+    radius_meters *= shape->conversion;
+
+    steps = geohashEstimateStepsByRadius(radius_meters,latitude);
+
+    geohashGetCoordRange(&long_range,&lat_range);
+    geohashEncode(&long_range,&lat_range,longitude,latitude,steps,&hash);
+    geohashNeighbors(&hash,&neighbors);
+    geohashDecode(long_range,lat_range,hash,&area);
+
+    /* Check if the step is enough at the limits of the covered area.
+     * Sometimes when the search area is near an edge of the
+     * area, the estimated step is not small enough, since one of the
+     * north / south / west / east square is too near to the search area
+     * to cover everything. */
+    int decrease_step = 0;
+    {
+        GeoHashArea north, south, east, west;
+
+        geohashDecode(long_range, lat_range, neighbors.north, &north);
+        geohashDecode(long_range, lat_range, neighbors.south, &south);
+        geohashDecode(long_range, lat_range, neighbors.east, &east);
+        geohashDecode(long_range, lat_range, neighbors.west, &west);
+
+        if (geohashGetDistance(longitude,latitude,longitude,north.latitude.max)
+            < radius_meters) decrease_step = 1;
+        if (geohashGetDistance(longitude,latitude,longitude,south.latitude.min)
+            < radius_meters) decrease_step = 1;
+        if (geohashGetDistance(longitude,latitude,east.longitude.max,latitude)
+            < radius_meters) decrease_step = 1;
+        if (geohashGetDistance(longitude,latitude,west.longitude.min,latitude)
+            < radius_meters) decrease_step = 1;
+    }
+
+    if (steps > 1 && decrease_step) {
+        steps--;
+        geohashEncode(&long_range,&lat_range,longitude,latitude,steps,&hash);
+        geohashNeighbors(&hash,&neighbors);
+        geohashDecode(long_range,lat_range,hash,&area);
+    }
+
+    /* Exclude the search areas that are useless. */
+    if (steps >= 2) {
+        if (area.latitude.min < min_lat) {
+            GZERO(neighbors.south);
+            GZERO(neighbors.south_west);
+            GZERO(neighbors.south_east);
+        }
+        if (area.latitude.max > max_lat) {
+            GZERO(neighbors.north);
+            GZERO(neighbors.north_east);
+            GZERO(neighbors.north_west);
+        }
+        if (area.longitude.min < min_lon) {
+            GZERO(neighbors.west);
+            GZERO(neighbors.south_west);
+            GZERO(neighbors.north_west);
+        }
+        if (area.longitude.max > max_lon) {
+            GZERO(neighbors.east);
+            GZERO(neighbors.south_east);
+            GZERO(neighbors.north_east);
+        }
+    }
+    radius.hash = hash;
+    radius.neighbors = neighbors;
+    radius.area = area;
+    return radius;
+}
+
+GeoHashFix52Bits geohashAlign52Bits(const GeoHashBits hash) {
+    uint64_t bits = hash.bits;
+    bits <<= (52 - hash.step * 2);
+    return bits;
+}
+
+/* Calculate distance using haversin great circle distance formula. */
+double geohashGetDistance(double lon1d, double lat1d, double lon2d, double lat2d) {
+    double lat1r, lon1r, lat2r, lon2r, u, v;
+    lat1r = deg_rad(lat1d);
+    lon1r = deg_rad(lon1d);
+    lat2r = deg_rad(lat2d);
+    lon2r = deg_rad(lon2d);
+    u = sin((lat2r - lat1r) / 2);
+    v = sin((lon2r - lon1r) / 2);
+    return 2.0 * EARTH_RADIUS_IN_METERS *
+           asin(sqrt(u * u + cos(lat1r) * cos(lat2r) * v * v));
+}
+
+int geohashGetDistanceIfInRadius(double x1, double y1,
+                                 double x2, double y2, double radius,
+                                 double *distance) {
+    *distance = geohashGetDistance(x1, y1, x2, y2);
+    if (*distance > radius) return 0;
+    return 1;
+}
+
+int geohashGetDistanceIfInRadiusWGS84(double x1, double y1, double x2,
+                                      double y2, double radius,
+                                      double *distance) {
+    return geohashGetDistanceIfInRadius(x1, y1, x2, y2, radius, distance);
+}
+
+/* Judge whether a point is in the axis-aligned rectangle, when the distance
+ * between a searched point and the center point is less than or equal to
+ * height/2 or width/2 in height and width, the point is in the rectangle.
+ *
+ * width_m, height_m: the rectangle
+ * x1, y1 : the center of the box
+ * x2, y2 : the point to be searched
+ */
+int geohashGetDistanceIfInRectangle(double width_m, double height_m, double x1, double y1,
+                                    double x2, double y2, double *distance) {
+    double lon_distance = geohashGetDistance(x2, y2, x1, y2);
+    double lat_distance = geohashGetDistance(x2, y2, x2, y1);
+    if (lon_distance > width_m/2 || lat_distance > height_m/2) {
+        return 0;
+    }
+    *distance = geohashGetDistance(x1, y1, x2, y2);
+    return 1;
+}
diff --git a/redis-stable/src/geohash_helper.h b/redis-stable/src/geohash_helper.h
new file mode 100644
index 00000000..630a89e3
--- /dev/null
+++ b/redis-stable/src/geohash_helper.h
@@ -0,0 +1,66 @@
+/*
+ * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
+ * Copyright (c) 2015, Salvatore Sanfilippo <antirez@gmail.com>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *  * Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *  * Neither the name of Redis nor the names of its contributors may be used
+ *    to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ * THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef GEOHASH_HELPER_HPP_
+#define GEOHASH_HELPER_HPP_
+
+#include "geohash.h"
+
+#define GZERO(s) s.bits = s.step = 0;
+#define GISZERO(s) (!s.bits && !s.step)
+#define GISNOTZERO(s) (s.bits || s.step)
+
+typedef uint64_t GeoHashFix52Bits;
+typedef uint64_t GeoHashVarBits;
+
+typedef struct {
+    GeoHashBits hash;
+    GeoHashArea area;
+    GeoHashNeighbors neighbors;
+} GeoHashRadius;
+
+int GeoHashBitsComparator(const GeoHashBits *a, const GeoHashBits *b);
+uint8_t geohashEstimateStepsByRadius(double range_meters, double lat);
+int geohashBoundingBox(GeoShape *shape, double *bounds);
+GeoHashRadius geohashCalculateAreasByShapeWGS84(GeoShape *shape);
+GeoHashFix52Bits geohashAlign52Bits(const GeoHashBits hash);
+double geohashGetDistance(double lon1d, double lat1d,
+                          double lon2d, double lat2d);
+int geohashGetDistanceIfInRadius(double x1, double y1,
+                                 double x2, double y2, double radius,
+                                 double *distance);
+int geohashGetDistanceIfInRadiusWGS84(double x1, double y1, double x2,
+                                      double y2, double radius,
+                                      double *distance);
+int geohashGetDistanceIfInRectangle(double width_m, double height_m, double x1, double y1,
+                                    double x2, double y2, double *distance);
+
+#endif /* GEOHASH_HELPER_HPP_ */
diff --git a/redis-stable/src/gopher.c b/redis-stable/src/gopher.c
new file mode 100644
index 00000000..38e44f75
--- /dev/null
+++ b/redis-stable/src/gopher.c
@@ -0,0 +1,97 @@
+/*
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* Emit an item in Gopher directory listing format:
+ * <type><descr><TAB><selector><TAB><hostname><TAB><port>
+ * If descr or selector are NULL, then the "(NULL)" string is used instead. */
+void addReplyGopherItem(client *c, const char *type, const char *descr,
+                        const char *selector, const char *hostname, int port)
+{
+    sds item = sdscatfmt(sdsempty(),"%s%s\t%s\t%s\t%i\r\n",
+                         type, descr,
+                         selector ? selector : "(NULL)",
+                         hostname ? hostname : "(NULL)",
+                         port);
+    addReplyProto(c,item,sdslen(item));
+    sdsfree(item);
+}
+
+/* This is called by processInputBuffer() when an inline request is processed
+ * with Gopher mode enabled, and the request happens to have zero or just one
+ * argument. In such case we get the relevant key and reply using the Gopher
+ * protocol. */
+void processGopherRequest(client *c) {
+    robj *keyname = c->argc == 0 ? createStringObject("/",1) : c->argv[0];
+    robj *o = lookupKeyRead(c->db,keyname);
+
+    /* If there is no such key, return with a Gopher error. */
+    if (o == NULL || o->type != OBJ_STRING) {
+        char *errstr;
+        if (o == NULL)
+            errstr = "Error: no content at the specified key";
+        else
+            errstr = "Error: selected key type is invalid "
+                     "for Gopher output";
+        addReplyGopherItem(c,"i",errstr,NULL,NULL,0);
+        addReplyGopherItem(c,"i","Redis Gopher server",NULL,NULL,0);
+    } else {
+        addReply(c,o);
+    }
+
+    /* Cleanup, also make sure to emit the final ".CRLF" line. Note that
+     * the connection will be closed immediately after this because the client
+     * will be flagged with CLIENT_CLOSE_AFTER_REPLY, in accordance with the
+     * Gopher protocol. */
+    if (c->argc == 0) decrRefCount(keyname);
+
+    /* Note that in theory we should terminate the Gopher request with
+     * ".<CR><LF>" (called Lastline in the RFC) like that:
+     *
+     * addReplyProto(c,".\r\n",3);
+     *
+     * However after examining the current clients landscape, it's probably
+     * going to do more harm than good for several reasons:
+     *
+     * 1. Clients should not have any issue with missing .<CR><LF> as for
+     *    specification, and in the real world indeed certain servers
+     *    implementations never used to send the terminator.
+     *
+     * 2. Redis does not know if it's serving a text file or a binary file:
+     *    at the same time clients will not remove the ".<CR><LF>" bytes at
+     *    tne end when downloading a binary file from the server, so adding
+     *    the "Lastline" terminator without knowing the content is just
+     *    dangerous.
+     *
+     * 3. The utility gopher2redis.rb that we provide for Redis, and any
+     *    other similar tool you may use as Gopher authoring system for
+     *    Redis, can just add the "Lastline" when needed.
+     */
+}
diff --git a/redis-stable/src/help.h b/redis-stable/src/help.h
new file mode 100644
index 00000000..c14b53ab
--- /dev/null
+++ b/redis-stable/src/help.h
@@ -0,0 +1,1438 @@
+/* Automatically generated by ./utils/generate-command-help.rb, do not edit. */
+
+#ifndef __REDIS_HELP_H
+#define __REDIS_HELP_H
+
+static char *commandGroups[] = {
+    "generic",
+    "string",
+    "list",
+    "set",
+    "sorted_set",
+    "hash",
+    "pubsub",
+    "transactions",
+    "connection",
+    "server",
+    "scripting",
+    "hyperloglog",
+    "cluster",
+    "geo",
+    "stream"
+};
+
+struct commandHelp {
+  char *name;
+  char *params;
+  char *summary;
+  int group;
+  char *since;
+} commandHelp[] = {
+    { "ACL CAT",
+    "[categoryname]",
+    "List the ACL categories or the commands inside a category",
+    9,
+    "6.0.0" },
+    { "ACL DELUSER",
+    "username [username ...]",
+    "Remove the specified ACL users and the associated rules",
+    9,
+    "6.0.0" },
+    { "ACL GENPASS",
+    "[bits]",
+    "Generate a pseudorandom secure password to use for ACL users",
+    9,
+    "6.0.0" },
+    { "ACL GETUSER",
+    "username",
+    "Get the rules for a specific ACL user",
+    9,
+    "6.0.0" },
+    { "ACL HELP",
+    "-",
+    "Show helpful text about the different subcommands",
+    9,
+    "6.0.0" },
+    { "ACL LIST",
+    "-",
+    "List the current ACL rules in ACL config file format",
+    9,
+    "6.0.0" },
+    { "ACL LOAD",
+    "-",
+    "Reload the ACLs from the configured ACL file",
+    9,
+    "6.0.0" },
+    { "ACL LOG",
+    "[count or RESET]",
+    "List latest events denied because of ACLs in place",
+    9,
+    "6.0.0" },
+    { "ACL SAVE",
+    "-",
+    "Save the current ACL rules in the configured ACL file",
+    9,
+    "6.0.0" },
+    { "ACL SETUSER",
+    "username [rule [rule ...]]",
+    "Modify or create the rules for a specific ACL user",
+    9,
+    "6.0.0" },
+    { "ACL USERS",
+    "-",
+    "List the username of all the configured ACL rules",
+    9,
+    "6.0.0" },
+    { "ACL WHOAMI",
+    "-",
+    "Return the name of the user associated to the current connection",
+    9,
+    "6.0.0" },
+    { "APPEND",
+    "key value",
+    "Append a value to a key",
+    1,
+    "2.0.0" },
+    { "AUTH",
+    "[username] password",
+    "Authenticate to the server",
+    8,
+    "1.0.0" },
+    { "BGREWRITEAOF",
+    "-",
+    "Asynchronously rewrite the append-only file",
+    9,
+    "1.0.0" },
+    { "BGSAVE",
+    "[SCHEDULE]",
+    "Asynchronously save the dataset to disk",
+    9,
+    "1.0.0" },
+    { "BITCOUNT",
+    "key [start end]",
+    "Count set bits in a string",
+    1,
+    "2.6.0" },
+    { "BITFIELD",
+    "key [GET type offset] [SET type offset value] [INCRBY type offset increment] [OVERFLOW WRAP|SAT|FAIL]",
+    "Perform arbitrary bitfield integer operations on strings",
+    1,
+    "3.2.0" },
+    { "BITOP",
+    "operation destkey key [key ...]",
+    "Perform bitwise operations between strings",
+    1,
+    "2.6.0" },
+    { "BITPOS",
+    "key bit [start] [end]",
+    "Find first bit set or clear in a string",
+    1,
+    "2.8.7" },
+    { "BLMOVE",
+    "source destination LEFT|RIGHT LEFT|RIGHT timeout",
+    "Pop an element from a list, push it to another list and return it; or block until one is available",
+    2,
+    "6.2.0" },
+    { "BLPOP",
+    "key [key ...] timeout",
+    "Remove and get the first element in a list, or block until one is available",
+    2,
+    "2.0.0" },
+    { "BRPOP",
+    "key [key ...] timeout",
+    "Remove and get the last element in a list, or block until one is available",
+    2,
+    "2.0.0" },
+    { "BRPOPLPUSH",
+    "source destination timeout",
+    "Pop an element from a list, push it to another list and return it; or block until one is available",
+    2,
+    "2.2.0" },
+    { "BZPOPMAX",
+    "key [key ...] timeout",
+    "Remove and return the member with the highest score from one or more sorted sets, or block until one is available",
+    4,
+    "5.0.0" },
+    { "BZPOPMIN",
+    "key [key ...] timeout",
+    "Remove and return the member with the lowest score from one or more sorted sets, or block until one is available",
+    4,
+    "5.0.0" },
+    { "CLIENT CACHING",
+    "YES|NO",
+    "Instruct the server about tracking or not keys in the next request",
+    8,
+    "6.0.0" },
+    { "CLIENT GETNAME",
+    "-",
+    "Get the current connection name",
+    8,
+    "2.6.9" },
+    { "CLIENT GETREDIR",
+    "-",
+    "Get tracking notifications redirection client ID if any",
+    8,
+    "6.0.0" },
+    { "CLIENT ID",
+    "-",
+    "Returns the client ID for the current connection",
+    8,
+    "5.0.0" },
+    { "CLIENT INFO",
+    "-",
+    "Returns information about the current client connection.",
+    8,
+    "6.2.0" },
+    { "CLIENT KILL",
+    "[ip:port] [ID client-id] [TYPE normal|master|slave|pubsub] [USER username] [ADDR ip:port] [LADDR ip:port] [SKIPME yes/no]",
+    "Kill the connection of a client",
+    8,
+    "2.4.0" },
+    { "CLIENT LIST",
+    "[TYPE normal|master|replica|pubsub] [ID client-id [client-id ...]]",
+    "Get the list of client connections",
+    8,
+    "2.4.0" },
+    { "CLIENT PAUSE",
+    "timeout [WRITE|ALL]",
+    "Stop processing commands from clients for some time",
+    8,
+    "2.9.50" },
+    { "CLIENT REPLY",
+    "ON|OFF|SKIP",
+    "Instruct the server whether to reply to commands",
+    8,
+    "3.2.0" },
+    { "CLIENT SETNAME",
+    "connection-name",
+    "Set the current connection name",
+    8,
+    "2.6.9" },
+    { "CLIENT TRACKING",
+    "ON|OFF [REDIRECT client-id] [PREFIX prefix [PREFIX prefix ...]] [BCAST] [OPTIN] [OPTOUT] [NOLOOP]",
+    "Enable or disable server assisted client side caching support",
+    8,
+    "6.0.0" },
+    { "CLIENT TRACKINGINFO",
+    "-",
+    "Return information about server assisted client side caching for the current connection",
+    8,
+    "6.2.0" },
+    { "CLIENT UNBLOCK",
+    "client-id [TIMEOUT|ERROR]",
+    "Unblock a client blocked in a blocking command from a different connection",
+    8,
+    "5.0.0" },
+    { "CLIENT UNPAUSE",
+    "-",
+    "Resume processing of clients that were paused",
+    8,
+    "6.2.0" },
+    { "CLUSTER ADDSLOTS",
+    "slot [slot ...]",
+    "Assign new hash slots to receiving node",
+    12,
+    "3.0.0" },
+    { "CLUSTER BUMPEPOCH",
+    "-",
+    "Advance the cluster config epoch",
+    12,
+    "3.0.0" },
+    { "CLUSTER COUNT-FAILURE-REPORTS",
+    "node-id",
+    "Return the number of failure reports active for a given node",
+    12,
+    "3.0.0" },
+    { "CLUSTER COUNTKEYSINSLOT",
+    "slot",
+    "Return the number of local keys in the specified hash slot",
+    12,
+    "3.0.0" },
+    { "CLUSTER DELSLOTS",
+    "slot [slot ...]",
+    "Set hash slots as unbound in receiving node",
+    12,
+    "3.0.0" },
+    { "CLUSTER FAILOVER",
+    "[FORCE|TAKEOVER]",
+    "Forces a replica to perform a manual failover of its master.",
+    12,
+    "3.0.0" },
+    { "CLUSTER FLUSHSLOTS",
+    "-",
+    "Delete a node's own slots information",
+    12,
+    "3.0.0" },
+    { "CLUSTER FORGET",
+    "node-id",
+    "Remove a node from the nodes table",
+    12,
+    "3.0.0" },
+    { "CLUSTER GETKEYSINSLOT",
+    "slot count",
+    "Return local key names in the specified hash slot",
+    12,
+    "3.0.0" },
+    { "CLUSTER INFO",
+    "-",
+    "Provides info about Redis Cluster node state",
+    12,
+    "3.0.0" },
+    { "CLUSTER KEYSLOT",
+    "key",
+    "Returns the hash slot of the specified key",
+    12,
+    "3.0.0" },
+    { "CLUSTER MEET",
+    "ip port",
+    "Force a node cluster to handshake with another node",
+    12,
+    "3.0.0" },
+    { "CLUSTER MYID",
+    "-",
+    "Return the node id",
+    12,
+    "3.0.0" },
+    { "CLUSTER NODES",
+    "-",
+    "Get Cluster config for the node",
+    12,
+    "3.0.0" },
+    { "CLUSTER REPLICAS",
+    "node-id",
+    "List replica nodes of the specified master node",
+    12,
+    "5.0.0" },
+    { "CLUSTER REPLICATE",
+    "node-id",
+    "Reconfigure a node as a replica of the specified master node",
+    12,
+    "3.0.0" },
+    { "CLUSTER RESET",
+    "[HARD|SOFT]",
+    "Reset a Redis Cluster node",
+    12,
+    "3.0.0" },
+    { "CLUSTER SAVECONFIG",
+    "-",
+    "Forces the node to save cluster state on disk",
+    12,
+    "3.0.0" },
+    { "CLUSTER SET-CONFIG-EPOCH",
+    "config-epoch",
+    "Set the configuration epoch in a new node",
+    12,
+    "3.0.0" },
+    { "CLUSTER SETSLOT",
+    "slot IMPORTING|MIGRATING|STABLE|NODE [node-id]",
+    "Bind a hash slot to a specific node",
+    12,
+    "3.0.0" },
+    { "CLUSTER SLAVES",
+    "node-id",
+    "List replica nodes of the specified master node",
+    12,
+    "3.0.0" },
+    { "CLUSTER SLOTS",
+    "-",
+    "Get array of Cluster slot to node mappings",
+    12,
+    "3.0.0" },
+    { "COMMAND",
+    "-",
+    "Get array of Redis command details",
+    9,
+    "2.8.13" },
+    { "COMMAND COUNT",
+    "-",
+    "Get total number of Redis commands",
+    9,
+    "2.8.13" },
+    { "COMMAND GETKEYS",
+    "-",
+    "Extract keys given a full Redis command",
+    9,
+    "2.8.13" },
+    { "COMMAND INFO",
+    "command-name [command-name ...]",
+    "Get array of specific Redis command details",
+    9,
+    "2.8.13" },
+    { "CONFIG GET",
+    "parameter",
+    "Get the value of a configuration parameter",
+    9,
+    "2.0.0" },
+    { "CONFIG RESETSTAT",
+    "-",
+    "Reset the stats returned by INFO",
+    9,
+    "2.0.0" },
+    { "CONFIG REWRITE",
+    "-",
+    "Rewrite the configuration file with the in memory configuration",
+    9,
+    "2.8.0" },
+    { "CONFIG SET",
+    "parameter value",
+    "Set a configuration parameter to the given value",
+    9,
+    "2.0.0" },
+    { "COPY",
+    "source destination [DB destination-db] [REPLACE]",
+    "Copy a key",
+    0,
+    "6.2.0" },
+    { "DBSIZE",
+    "-",
+    "Return the number of keys in the selected database",
+    9,
+    "1.0.0" },
+    { "DEBUG OBJECT",
+    "key",
+    "Get debugging information about a key",
+    9,
+    "1.0.0" },
+    { "DEBUG SEGFAULT",
+    "-",
+    "Make the server crash",
+    9,
+    "1.0.0" },
+    { "DECR",
+    "key",
+    "Decrement the integer value of a key by one",
+    1,
+    "1.0.0" },
+    { "DECRBY",
+    "key decrement",
+    "Decrement the integer value of a key by the given number",
+    1,
+    "1.0.0" },
+    { "DEL",
+    "key [key ...]",
+    "Delete a key",
+    0,
+    "1.0.0" },
+    { "DISCARD",
+    "-",
+    "Discard all commands issued after MULTI",
+    7,
+    "2.0.0" },
+    { "DUMP",
+    "key",
+    "Return a serialized version of the value stored at the specified key.",
+    0,
+    "2.6.0" },
+    { "ECHO",
+    "message",
+    "Echo the given string",
+    8,
+    "1.0.0" },
+    { "EVAL",
+    "script numkeys key [key ...] arg [arg ...]",
+    "Execute a Lua script server side",
+    10,
+    "2.6.0" },
+    { "EVALSHA",
+    "sha1 numkeys key [key ...] arg [arg ...]",
+    "Execute a Lua script server side",
+    10,
+    "2.6.0" },
+    { "EXEC",
+    "-",
+    "Execute all commands issued after MULTI",
+    7,
+    "1.2.0" },
+    { "EXISTS",
+    "key [key ...]",
+    "Determine if a key exists",
+    0,
+    "1.0.0" },
+    { "EXPIRE",
+    "key seconds",
+    "Set a key's time to live in seconds",
+    0,
+    "1.0.0" },
+    { "EXPIREAT",
+    "key timestamp",
+    "Set the expiration for a key as a UNIX timestamp",
+    0,
+    "1.2.0" },
+    { "FAILOVER",
+    "[TO host port [FORCE]] [ABORT] [TIMEOUT milliseconds]",
+    "Start a coordinated failover between this server and one of its replicas.",
+    9,
+    "6.2.0" },
+    { "FLUSHALL",
+    "[ASYNC|SYNC]",
+    "Remove all keys from all databases",
+    9,
+    "1.0.0" },
+    { "FLUSHDB",
+    "[ASYNC|SYNC]",
+    "Remove all keys from the current database",
+    9,
+    "1.0.0" },
+    { "GEOADD",
+    "key [NX|XX] [CH] longitude latitude member [longitude latitude member ...]",
+    "Add one or more geospatial items in the geospatial index represented using a sorted set",
+    13,
+    "3.2.0" },
+    { "GEODIST",
+    "key member1 member2 [m|km|ft|mi]",
+    "Returns the distance between two members of a geospatial index",
+    13,
+    "3.2.0" },
+    { "GEOHASH",
+    "key member [member ...]",
+    "Returns members of a geospatial index as standard geohash strings",
+    13,
+    "3.2.0" },
+    { "GEOPOS",
+    "key member [member ...]",
+    "Returns longitude and latitude of members of a geospatial index",
+    13,
+    "3.2.0" },
+    { "GEORADIUS",
+    "key longitude latitude radius m|km|ft|mi [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]",
+    "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point",
+    13,
+    "3.2.0" },
+    { "GEORADIUSBYMEMBER",
+    "key member radius m|km|ft|mi [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]",
+    "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member",
+    13,
+    "3.2.0" },
+    { "GEOSEARCH",
+    "key [FROMMEMBER member] [FROMLONLAT longitude latitude] [BYRADIUS radius m|km|ft|mi] [BYBOX width height m|km|ft|mi] [ASC|DESC] [COUNT count [ANY]] [WITHCOORD] [WITHDIST] [WITHHASH]",
+    "Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle.",
+    13,
+    "6.2" },
+    { "GEOSEARCHSTORE",
+    "destination source [FROMMEMBER member] [FROMLONLAT longitude latitude] [BYRADIUS radius m|km|ft|mi] [BYBOX width height m|km|ft|mi] [ASC|DESC] [COUNT count [ANY]] [WITHCOORD] [WITHDIST] [WITHHASH] [STOREDIST]",
+    "Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle, and store the result in another key.",
+    13,
+    "6.2" },
+    { "GET",
+    "key",
+    "Get the value of a key",
+    1,
+    "1.0.0" },
+    { "GETBIT",
+    "key offset",
+    "Returns the bit value at offset in the string value stored at key",
+    1,
+    "2.2.0" },
+    { "GETDEL",
+    "key",
+    "Get the value of a key and delete the key",
+    1,
+    "6.2.0" },
+    { "GETEX",
+    "key [EX seconds|PX milliseconds|EXAT timestamp|PXAT milliseconds-timestamp|PERSIST]",
+    "Get the value of a key and optionally set its expiration",
+    1,
+    "6.2.0" },
+    { "GETRANGE",
+    "key start end",
+    "Get a substring of the string stored at a key",
+    1,
+    "2.4.0" },
+    { "GETSET",
+    "key value",
+    "Set the string value of a key and return its old value",
+    1,
+    "1.0.0" },
+    { "HDEL",
+    "key field [field ...]",
+    "Delete one or more hash fields",
+    5,
+    "2.0.0" },
+    { "HELLO",
+    "[protover [AUTH username password] [SETNAME clientname]]",
+    "Handshake with Redis",
+    8,
+    "6.0.0" },
+    { "HEXISTS",
+    "key field",
+    "Determine if a hash field exists",
+    5,
+    "2.0.0" },
+    { "HGET",
+    "key field",
+    "Get the value of a hash field",
+    5,
+    "2.0.0" },
+    { "HGETALL",
+    "key",
+    "Get all the fields and values in a hash",
+    5,
+    "2.0.0" },
+    { "HINCRBY",
+    "key field increment",
+    "Increment the integer value of a hash field by the given number",
+    5,
+    "2.0.0" },
+    { "HINCRBYFLOAT",
+    "key field increment",
+    "Increment the float value of a hash field by the given amount",
+    5,
+    "2.6.0" },
+    { "HKEYS",
+    "key",
+    "Get all the fields in a hash",
+    5,
+    "2.0.0" },
+    { "HLEN",
+    "key",
+    "Get the number of fields in a hash",
+    5,
+    "2.0.0" },
+    { "HMGET",
+    "key field [field ...]",
+    "Get the values of all the given hash fields",
+    5,
+    "2.0.0" },
+    { "HMSET",
+    "key field value [field value ...]",
+    "Set multiple hash fields to multiple values",
+    5,
+    "2.0.0" },
+    { "HRANDFIELD",
+    "key [count [WITHVALUES]]",
+    "Get one or multiple random fields from a hash",
+    5,
+    "6.2.0" },
+    { "HSCAN",
+    "key cursor [MATCH pattern] [COUNT count]",
+    "Incrementally iterate hash fields and associated values",
+    5,
+    "2.8.0" },
+    { "HSET",
+    "key field value [field value ...]",
+    "Set the string value of a hash field",
+    5,
+    "2.0.0" },
+    { "HSETNX",
+    "key field value",
+    "Set the value of a hash field, only if the field does not exist",
+    5,
+    "2.0.0" },
+    { "HSTRLEN",
+    "key field",
+    "Get the length of the value of a hash field",
+    5,
+    "3.2.0" },
+    { "HVALS",
+    "key",
+    "Get all the values in a hash",
+    5,
+    "2.0.0" },
+    { "INCR",
+    "key",
+    "Increment the integer value of a key by one",
+    1,
+    "1.0.0" },
+    { "INCRBY",
+    "key increment",
+    "Increment the integer value of a key by the given amount",
+    1,
+    "1.0.0" },
+    { "INCRBYFLOAT",
+    "key increment",
+    "Increment the float value of a key by the given amount",
+    1,
+    "2.6.0" },
+    { "INFO",
+    "[section]",
+    "Get information and statistics about the server",
+    9,
+    "1.0.0" },
+    { "KEYS",
+    "pattern",
+    "Find all keys matching the given pattern",
+    0,
+    "1.0.0" },
+    { "LASTSAVE",
+    "-",
+    "Get the UNIX time stamp of the last successful save to disk",
+    9,
+    "1.0.0" },
+    { "LATENCY DOCTOR",
+    "-",
+    "Return a human readable latency analysis report.",
+    9,
+    "2.8.13" },
+    { "LATENCY GRAPH",
+    "event",
+    "Return a latency graph for the event.",
+    9,
+    "2.8.13" },
+    { "LATENCY HELP",
+    "-",
+    "Show helpful text about the different subcommands.",
+    9,
+    "2.8.13" },
+    { "LATENCY HISTORY",
+    "event",
+    "Return timestamp-latency samples for the event.",
+    9,
+    "2.8.13" },
+    { "LATENCY LATEST",
+    "-",
+    "Return the latest latency samples for all events.",
+    9,
+    "2.8.13" },
+    { "LATENCY RESET",
+    "[event [event ...]]",
+    "Reset latency data for one or more events.",
+    9,
+    "2.8.13" },
+    { "LINDEX",
+    "key index",
+    "Get an element from a list by its index",
+    2,
+    "1.0.0" },
+    { "LINSERT",
+    "key BEFORE|AFTER pivot element",
+    "Insert an element before or after another element in a list",
+    2,
+    "2.2.0" },
+    { "LLEN",
+    "key",
+    "Get the length of a list",
+    2,
+    "1.0.0" },
+    { "LMOVE",
+    "source destination LEFT|RIGHT LEFT|RIGHT",
+    "Pop an element from a list, push it to another list and return it",
+    2,
+    "6.2.0" },
+    { "LOLWUT",
+    "[VERSION version]",
+    "Display some computer art and the Redis version",
+    9,
+    "5.0.0" },
+    { "LPOP",
+    "key [count]",
+    "Remove and get the first elements in a list",
+    2,
+    "1.0.0" },
+    { "LPOS",
+    "key element [RANK rank] [COUNT num-matches] [MAXLEN len]",
+    "Return the index of matching elements on a list",
+    2,
+    "6.0.6" },
+    { "LPUSH",
+    "key element [element ...]",
+    "Prepend one or multiple elements to a list",
+    2,
+    "1.0.0" },
+    { "LPUSHX",
+    "key element [element ...]",
+    "Prepend an element to a list, only if the list exists",
+    2,
+    "2.2.0" },
+    { "LRANGE",
+    "key start stop",
+    "Get a range of elements from a list",
+    2,
+    "1.0.0" },
+    { "LREM",
+    "key count element",
+    "Remove elements from a list",
+    2,
+    "1.0.0" },
+    { "LSET",
+    "key index element",
+    "Set the value of an element in a list by its index",
+    2,
+    "1.0.0" },
+    { "LTRIM",
+    "key start stop",
+    "Trim a list to the specified range",
+    2,
+    "1.0.0" },
+    { "MEMORY DOCTOR",
+    "-",
+    "Outputs memory problems report",
+    9,
+    "4.0.0" },
+    { "MEMORY HELP",
+    "-",
+    "Show helpful text about the different subcommands",
+    9,
+    "4.0.0" },
+    { "MEMORY MALLOC-STATS",
+    "-",
+    "Show allocator internal stats",
+    9,
+    "4.0.0" },
+    { "MEMORY PURGE",
+    "-",
+    "Ask the allocator to release memory",
+    9,
+    "4.0.0" },
+    { "MEMORY STATS",
+    "-",
+    "Show memory usage details",
+    9,
+    "4.0.0" },
+    { "MEMORY USAGE",
+    "key [SAMPLES count]",
+    "Estimate the memory usage of a key",
+    9,
+    "4.0.0" },
+    { "MGET",
+    "key [key ...]",
+    "Get the values of all the given keys",
+    1,
+    "1.0.0" },
+    { "MIGRATE",
+    "host port key|"" destination-db timeout [COPY] [REPLACE] [AUTH password] [AUTH2 username password] [KEYS key]",
+    "Atomically transfer a key from a Redis instance to another one.",
+    0,
+    "2.6.0" },
+    { "MODULE LIST",
+    "-",
+    "List all modules loaded by the server",
+    9,
+    "4.0.0" },
+    { "MODULE LOAD",
+    "path [arg]",
+    "Load a module",
+    9,
+    "4.0.0" },
+    { "MODULE UNLOAD",
+    "name",
+    "Unload a module",
+    9,
+    "4.0.0" },
+    { "MONITOR",
+    "-",
+    "Listen for all requests received by the server in real time",
+    9,
+    "1.0.0" },
+    { "MOVE",
+    "key db",
+    "Move a key to another database",
+    0,
+    "1.0.0" },
+    { "MSET",
+    "key value [key value ...]",
+    "Set multiple keys to multiple values",
+    1,
+    "1.0.1" },
+    { "MSETNX",
+    "key value [key value ...]",
+    "Set multiple keys to multiple values, only if none of the keys exist",
+    1,
+    "1.0.1" },
+    { "MULTI",
+    "-",
+    "Mark the start of a transaction block",
+    7,
+    "1.2.0" },
+    { "OBJECT",
+    "subcommand [arguments [arguments ...]]",
+    "Inspect the internals of Redis objects",
+    0,
+    "2.2.3" },
+    { "PERSIST",
+    "key",
+    "Remove the expiration from a key",
+    0,
+    "2.2.0" },
+    { "PEXPIRE",
+    "key milliseconds",
+    "Set a key's time to live in milliseconds",
+    0,
+    "2.6.0" },
+    { "PEXPIREAT",
+    "key milliseconds-timestamp",
+    "Set the expiration for a key as a UNIX timestamp specified in milliseconds",
+    0,
+    "2.6.0" },
+    { "PFADD",
+    "key element [element ...]",
+    "Adds the specified elements to the specified HyperLogLog.",
+    11,
+    "2.8.9" },
+    { "PFCOUNT",
+    "key [key ...]",
+    "Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).",
+    11,
+    "2.8.9" },
+    { "PFMERGE",
+    "destkey sourcekey [sourcekey ...]",
+    "Merge N different HyperLogLogs into a single one.",
+    11,
+    "2.8.9" },
+    { "PING",
+    "[message]",
+    "Ping the server",
+    8,
+    "1.0.0" },
+    { "PSETEX",
+    "key milliseconds value",
+    "Set the value and expiration in milliseconds of a key",
+    1,
+    "2.6.0" },
+    { "PSUBSCRIBE",
+    "pattern [pattern ...]",
+    "Listen for messages published to channels matching the given patterns",
+    6,
+    "2.0.0" },
+    { "PSYNC",
+    "replicationid offset",
+    "Internal command used for replication",
+    9,
+    "2.8.0" },
+    { "PTTL",
+    "key",
+    "Get the time to live for a key in milliseconds",
+    0,
+    "2.6.0" },
+    { "PUBLISH",
+    "channel message",
+    "Post a message to a channel",
+    6,
+    "2.0.0" },
+    { "PUBSUB",
+    "subcommand [argument [argument ...]]",
+    "Inspect the state of the Pub/Sub subsystem",
+    6,
+    "2.8.0" },
+    { "PUNSUBSCRIBE",
+    "[pattern [pattern ...]]",
+    "Stop listening for messages posted to channels matching the given patterns",
+    6,
+    "2.0.0" },
+    { "QUIT",
+    "-",
+    "Close the connection",
+    8,
+    "1.0.0" },
+    { "RANDOMKEY",
+    "-",
+    "Return a random key from the keyspace",
+    0,
+    "1.0.0" },
+    { "READONLY",
+    "-",
+    "Enables read queries for a connection to a cluster replica node",
+    12,
+    "3.0.0" },
+    { "READWRITE",
+    "-",
+    "Disables read queries for a connection to a cluster replica node",
+    12,
+    "3.0.0" },
+    { "RENAME",
+    "key newkey",
+    "Rename a key",
+    0,
+    "1.0.0" },
+    { "RENAMENX",
+    "key newkey",
+    "Rename a key, only if the new key does not exist",
+    0,
+    "1.0.0" },
+    { "REPLICAOF",
+    "host port",
+    "Make the server a replica of another instance, or promote it as master.",
+    9,
+    "5.0.0" },
+    { "RESET",
+    "-",
+    "Reset the connection",
+    8,
+    "6.2" },
+    { "RESTORE",
+    "key ttl serialized-value [REPLACE] [ABSTTL] [IDLETIME seconds] [FREQ frequency]",
+    "Create a key using the provided serialized value, previously obtained using DUMP.",
+    0,
+    "2.6.0" },
+    { "ROLE",
+    "-",
+    "Return the role of the instance in the context of replication",
+    9,
+    "2.8.12" },
+    { "RPOP",
+    "key [count]",
+    "Remove and get the last elements in a list",
+    2,
+    "1.0.0" },
+    { "RPOPLPUSH",
+    "source destination",
+    "Remove the last element in a list, prepend it to another list and return it",
+    2,
+    "1.2.0" },
+    { "RPUSH",
+    "key element [element ...]",
+    "Append one or multiple elements to a list",
+    2,
+    "1.0.0" },
+    { "RPUSHX",
+    "key element [element ...]",
+    "Append an element to a list, only if the list exists",
+    2,
+    "2.2.0" },
+    { "SADD",
+    "key member [member ...]",
+    "Add one or more members to a set",
+    3,
+    "1.0.0" },
+    { "SAVE",
+    "-",
+    "Synchronously save the dataset to disk",
+    9,
+    "1.0.0" },
+    { "SCAN",
+    "cursor [MATCH pattern] [COUNT count] [TYPE type]",
+    "Incrementally iterate the keys space",
+    0,
+    "2.8.0" },
+    { "SCARD",
+    "key",
+    "Get the number of members in a set",
+    3,
+    "1.0.0" },
+    { "SCRIPT DEBUG",
+    "YES|SYNC|NO",
+    "Set the debug mode for executed scripts.",
+    10,
+    "3.2.0" },
+    { "SCRIPT EXISTS",
+    "sha1 [sha1 ...]",
+    "Check existence of scripts in the script cache.",
+    10,
+    "2.6.0" },
+    { "SCRIPT FLUSH",
+    "[ASYNC|SYNC]",
+    "Remove all the scripts from the script cache.",
+    10,
+    "2.6.0" },
+    { "SCRIPT KILL",
+    "-",
+    "Kill the script currently in execution.",
+    10,
+    "2.6.0" },
+    { "SCRIPT LOAD",
+    "script",
+    "Load the specified Lua script into the script cache.",
+    10,
+    "2.6.0" },
+    { "SDIFF",
+    "key [key ...]",
+    "Subtract multiple sets",
+    3,
+    "1.0.0" },
+    { "SDIFFSTORE",
+    "destination key [key ...]",
+    "Subtract multiple sets and store the resulting set in a key",
+    3,
+    "1.0.0" },
+    { "SELECT",
+    "index",
+    "Change the selected database for the current connection",
+    8,
+    "1.0.0" },
+    { "SET",
+    "key value [EX seconds|PX milliseconds|EXAT timestamp|PXAT milliseconds-timestamp|KEEPTTL] [NX|XX] [GET]",
+    "Set the string value of a key",
+    1,
+    "1.0.0" },
+    { "SETBIT",
+    "key offset value",
+    "Sets or clears the bit at offset in the string value stored at key",
+    1,
+    "2.2.0" },
+    { "SETEX",
+    "key seconds value",
+    "Set the value and expiration of a key",
+    1,
+    "2.0.0" },
+    { "SETNX",
+    "key value",
+    "Set the value of a key, only if the key does not exist",
+    1,
+    "1.0.0" },
+    { "SETRANGE",
+    "key offset value",
+    "Overwrite part of a string at key starting at the specified offset",
+    1,
+    "2.2.0" },
+    { "SHUTDOWN",
+    "[NOSAVE|SAVE]",
+    "Synchronously save the dataset to disk and then shut down the server",
+    9,
+    "1.0.0" },
+    { "SINTER",
+    "key [key ...]",
+    "Intersect multiple sets",
+    3,
+    "1.0.0" },
+    { "SINTERSTORE",
+    "destination key [key ...]",
+    "Intersect multiple sets and store the resulting set in a key",
+    3,
+    "1.0.0" },
+    { "SISMEMBER",
+    "key member",
+    "Determine if a given value is a member of a set",
+    3,
+    "1.0.0" },
+    { "SLAVEOF",
+    "host port",
+    "Make the server a replica of another instance, or promote it as master. Deprecated starting with Redis 5. Use REPLICAOF instead.",
+    9,
+    "1.0.0" },
+    { "SLOWLOG",
+    "subcommand [argument]",
+    "Manages the Redis slow queries log",
+    9,
+    "2.2.12" },
+    { "SMEMBERS",
+    "key",
+    "Get all the members in a set",
+    3,
+    "1.0.0" },
+    { "SMISMEMBER",
+    "key member [member ...]",
+    "Returns the membership associated with the given elements for a set",
+    3,
+    "6.2.0" },
+    { "SMOVE",
+    "source destination member",
+    "Move a member from one set to another",
+    3,
+    "1.0.0" },
+    { "SORT",
+    "key [BY pattern] [LIMIT offset count] [GET pattern [GET pattern ...]] [ASC|DESC] [ALPHA] [STORE destination]",
+    "Sort the elements in a list, set or sorted set",
+    0,
+    "1.0.0" },
+    { "SPOP",
+    "key [count]",
+    "Remove and return one or multiple random members from a set",
+    3,
+    "1.0.0" },
+    { "SRANDMEMBER",
+    "key [count]",
+    "Get one or multiple random members from a set",
+    3,
+    "1.0.0" },
+    { "SREM",
+    "key member [member ...]",
+    "Remove one or more members from a set",
+    3,
+    "1.0.0" },
+    { "SSCAN",
+    "key cursor [MATCH pattern] [COUNT count]",
+    "Incrementally iterate Set elements",
+    3,
+    "2.8.0" },
+    { "STRALGO",
+    "LCS algo-specific-argument [algo-specific-argument ...]",
+    "Run algorithms (currently LCS) against strings",
+    1,
+    "6.0.0" },
+    { "STRLEN",
+    "key",
+    "Get the length of the value stored in a key",
+    1,
+    "2.2.0" },
+    { "SUBSCRIBE",
+    "channel [channel ...]",
+    "Listen for messages published to the given channels",
+    6,
+    "2.0.0" },
+    { "SUNION",
+    "key [key ...]",
+    "Add multiple sets",
+    3,
+    "1.0.0" },
+    { "SUNIONSTORE",
+    "destination key [key ...]",
+    "Add multiple sets and store the resulting set in a key",
+    3,
+    "1.0.0" },
+    { "SWAPDB",
+    "index1 index2",
+    "Swaps two Redis databases",
+    9,
+    "4.0.0" },
+    { "SYNC",
+    "-",
+    "Internal command used for replication",
+    9,
+    "1.0.0" },
+    { "TIME",
+    "-",
+    "Return the current server time",
+    9,
+    "2.6.0" },
+    { "TOUCH",
+    "key [key ...]",
+    "Alters the last access time of a key(s). Returns the number of existing keys specified.",
+    0,
+    "3.2.1" },
+    { "TTL",
+    "key",
+    "Get the time to live for a key",
+    0,
+    "1.0.0" },
+    { "TYPE",
+    "key",
+    "Determine the type stored at key",
+    0,
+    "1.0.0" },
+    { "UNLINK",
+    "key [key ...]",
+    "Delete a key asynchronously in another thread. Otherwise it is just as DEL, but non blocking.",
+    0,
+    "4.0.0" },
+    { "UNSUBSCRIBE",
+    "[channel [channel ...]]",
+    "Stop listening for messages posted to the given channels",
+    6,
+    "2.0.0" },
+    { "UNWATCH",
+    "-",
+    "Forget about all watched keys",
+    7,
+    "2.2.0" },
+    { "WAIT",
+    "numreplicas timeout",
+    "Wait for the synchronous replication of all the write commands sent in the context of the current connection",
+    0,
+    "3.0.0" },
+    { "WATCH",
+    "key [key ...]",
+    "Watch the given keys to determine execution of the MULTI/EXEC block",
+    7,
+    "2.2.0" },
+    { "XACK",
+    "key group ID [ID ...]",
+    "Marks a pending message as correctly processed, effectively removing it from the pending entries list of the consumer group. Return value of the command is the number of messages successfully acknowledged, that is, the IDs we were actually able to resolve in the PEL.",
+    14,
+    "5.0.0" },
+    { "XADD",
+    "key [NOMKSTREAM] [MAXLEN|MINID [=|~] threshold [LIMIT count]] *|ID field value [field value ...]",
+    "Appends a new entry to a stream",
+    14,
+    "5.0.0" },
+    { "XAUTOCLAIM",
+    "key group consumer min-idle-time start [COUNT count] [justid]",
+    "Changes (or acquires) ownership of messages in a consumer group, as if the messages were delivered to the specified consumer.",
+    14,
+    "6.2.0" },
+    { "XCLAIM",
+    "key group consumer min-idle-time ID [ID ...] [IDLE ms] [TIME ms-unix-time] [RETRYCOUNT count] [force] [justid]",
+    "Changes (or acquires) ownership of a message in a consumer group, as if the message was delivered to the specified consumer.",
+    14,
+    "5.0.0" },
+    { "XDEL",
+    "key ID [ID ...]",
+    "Removes the specified entries from the stream. Returns the number of items actually deleted, that may be different from the number of IDs passed in case certain IDs do not exist.",
+    14,
+    "5.0.0" },
+    { "XGROUP",
+    "[CREATE key groupname ID|$ [MKSTREAM]] [SETID key groupname ID|$] [DESTROY key groupname] [CREATECONSUMER key groupname consumername] [DELCONSUMER key groupname consumername]",
+    "Create, destroy, and manage consumer groups.",
+    14,
+    "5.0.0" },
+    { "XINFO",
+    "[CONSUMERS key groupname] [GROUPS key] [STREAM key] [HELP]",
+    "Get information on streams and consumer groups",
+    14,
+    "5.0.0" },
+    { "XLEN",
+    "key",
+    "Return the number of entries in a stream",
+    14,
+    "5.0.0" },
+    { "XPENDING",
+    "key group [[IDLE min-idle-time] start end count [consumer]]",
+    "Return information and entries from a stream consumer group pending entries list, that are messages fetched but never acknowledged.",
+    14,
+    "5.0.0" },
+    { "XRANGE",
+    "key start end [COUNT count]",
+    "Return a range of elements in a stream, with IDs matching the specified IDs interval",
+    14,
+    "5.0.0" },
+    { "XREAD",
+    "[COUNT count] [BLOCK milliseconds] STREAMS key [key ...] ID [ID ...]",
+    "Return never seen elements in multiple streams, with IDs greater than the ones reported by the caller for each stream. Can block.",
+    14,
+    "5.0.0" },
+    { "XREADGROUP",
+    "GROUP group consumer [COUNT count] [BLOCK milliseconds] [NOACK] STREAMS key [key ...] ID [ID ...]",
+    "Return new entries from a stream using a consumer group, or access the history of the pending entries for a given consumer. Can block.",
+    14,
+    "5.0.0" },
+    { "XREVRANGE",
+    "key end start [COUNT count]",
+    "Return a range of elements in a stream, with IDs matching the specified IDs interval, in reverse order (from greater to smaller IDs) compared to XRANGE",
+    14,
+    "5.0.0" },
+    { "XTRIM",
+    "key MAXLEN|MINID [=|~] threshold [LIMIT count]",
+    "Trims the stream to (approximately if '~' is passed) a certain size",
+    14,
+    "5.0.0" },
+    { "ZADD",
+    "key [NX|XX] [GT|LT] [CH] [INCR] score member [score member ...]",
+    "Add one or more members to a sorted set, or update its score if it already exists",
+    4,
+    "1.2.0" },
+    { "ZCARD",
+    "key",
+    "Get the number of members in a sorted set",
+    4,
+    "1.2.0" },
+    { "ZCOUNT",
+    "key min max",
+    "Count the members in a sorted set with scores within the given values",
+    4,
+    "2.0.0" },
+    { "ZDIFF",
+    "numkeys key [key ...] [WITHSCORES]",
+    "Subtract multiple sorted sets",
+    4,
+    "6.2.0" },
+    { "ZDIFFSTORE",
+    "destination numkeys key [key ...]",
+    "Subtract multiple sorted sets and store the resulting sorted set in a new key",
+    4,
+    "6.2.0" },
+    { "ZINCRBY",
+    "key increment member",
+    "Increment the score of a member in a sorted set",
+    4,
+    "1.2.0" },
+    { "ZINTER",
+    "numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX] [WITHSCORES]",
+    "Intersect multiple sorted sets",
+    4,
+    "6.2.0" },
+    { "ZINTERSTORE",
+    "destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]",
+    "Intersect multiple sorted sets and store the resulting sorted set in a new key",
+    4,
+    "2.0.0" },
+    { "ZLEXCOUNT",
+    "key min max",
+    "Count the number of members in a sorted set between a given lexicographical range",
+    4,
+    "2.8.9" },
+    { "ZMSCORE",
+    "key member [member ...]",
+    "Get the score associated with the given members in a sorted set",
+    4,
+    "6.2.0" },
+    { "ZPOPMAX",
+    "key [count]",
+    "Remove and return members with the highest scores in a sorted set",
+    4,
+    "5.0.0" },
+    { "ZPOPMIN",
+    "key [count]",
+    "Remove and return members with the lowest scores in a sorted set",
+    4,
+    "5.0.0" },
+    { "ZRANDMEMBER",
+    "key [count [WITHSCORES]]",
+    "Get one or multiple random elements from a sorted set",
+    4,
+    "6.2.0" },
+    { "ZRANGE",
+    "key min max [BYSCORE|BYLEX] [REV] [LIMIT offset count] [WITHSCORES]",
+    "Return a range of members in a sorted set",
+    4,
+    "1.2.0" },
+    { "ZRANGEBYLEX",
+    "key min max [LIMIT offset count]",
+    "Return a range of members in a sorted set, by lexicographical range",
+    4,
+    "2.8.9" },
+    { "ZRANGEBYSCORE",
+    "key min max [WITHSCORES] [LIMIT offset count]",
+    "Return a range of members in a sorted set, by score",
+    4,
+    "1.0.5" },
+    { "ZRANGESTORE",
+    "dst src min max [BYSCORE|BYLEX] [REV] [LIMIT offset count]",
+    "Store a range of members from sorted set into another key",
+    4,
+    "6.2.0" },
+    { "ZRANK",
+    "key member",
+    "Determine the index of a member in a sorted set",
+    4,
+    "2.0.0" },
+    { "ZREM",
+    "key member [member ...]",
+    "Remove one or more members from a sorted set",
+    4,
+    "1.2.0" },
+    { "ZREMRANGEBYLEX",
+    "key min max",
+    "Remove all members in a sorted set between the given lexicographical range",
+    4,
+    "2.8.9" },
+    { "ZREMRANGEBYRANK",
+    "key start stop",
+    "Remove all members in a sorted set within the given indexes",
+    4,
+    "2.0.0" },
+    { "ZREMRANGEBYSCORE",
+    "key min max",
+    "Remove all members in a sorted set within the given scores",
+    4,
+    "1.2.0" },
+    { "ZREVRANGE",
+    "key start stop [WITHSCORES]",
+    "Return a range of members in a sorted set, by index, with scores ordered from high to low",
+    4,
+    "1.2.0" },
+    { "ZREVRANGEBYLEX",
+    "key max min [LIMIT offset count]",
+    "Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.",
+    4,
+    "2.8.9" },
+    { "ZREVRANGEBYSCORE",
+    "key max min [WITHSCORES] [LIMIT offset count]",
+    "Return a range of members in a sorted set, by score, with scores ordered from high to low",
+    4,
+    "2.2.0" },
+    { "ZREVRANK",
+    "key member",
+    "Determine the index of a member in a sorted set, with scores ordered from high to low",
+    4,
+    "2.0.0" },
+    { "ZSCAN",
+    "key cursor [MATCH pattern] [COUNT count]",
+    "Incrementally iterate sorted sets elements and associated scores",
+    4,
+    "2.8.0" },
+    { "ZSCORE",
+    "key member",
+    "Get the score associated with the given member in a sorted set",
+    4,
+    "1.2.0" },
+    { "ZUNION",
+    "numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX] [WITHSCORES]",
+    "Add multiple sorted sets",
+    4,
+    "6.2.0" },
+    { "ZUNIONSTORE",
+    "destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]",
+    "Add multiple sorted sets and store the resulting sorted set in a new key",
+    4,
+    "2.0.0" }
+};
+
+#endif
diff --git a/redis-stable/src/hyperloglog.c b/redis-stable/src/hyperloglog.c
new file mode 100644
index 00000000..75a04227
--- /dev/null
+++ b/redis-stable/src/hyperloglog.c
@@ -0,0 +1,1595 @@
+/* hyperloglog.c - Redis HyperLogLog probabilistic cardinality approximation.
+ * This file implements the algorithm and the exported Redis commands.
+ *
+ * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+#include <stdint.h>
+#include <math.h>
+
+/* The Redis HyperLogLog implementation is based on the following ideas:
+ *
+ * * The use of a 64 bit hash function as proposed in [1], in order to estimate
+ *   cardinalities larger than 10^9, at the cost of just 1 additional bit per
+ *   register.
+ * * The use of 16384 6-bit registers for a great level of accuracy, using
+ *   a total of 12k per key.
+ * * The use of the Redis string data type. No new type is introduced.
+ * * No attempt is made to compress the data structure as in [1]. Also the
+ *   algorithm used is the original HyperLogLog Algorithm as in [2], with
+ *   the only difference that a 64 bit hash function is used, so no correction
+ *   is performed for values near 2^32 as in [1].
+ *
+ * [1] Heule, Nunkesser, Hall: HyperLogLog in Practice: Algorithmic
+ *     Engineering of a State of The Art Cardinality Estimation Algorithm.
+ *
+ * [2] P. Flajolet, Éric Fusy, O. Gandouet, and F. Meunier. Hyperloglog: The
+ *     analysis of a near-optimal cardinality estimation algorithm.
+ *
+ * Redis uses two representations:
+ *
+ * 1) A "dense" representation where every entry is represented by
+ *    a 6-bit integer.
+ * 2) A "sparse" representation using run length compression suitable
+ *    for representing HyperLogLogs with many registers set to 0 in
+ *    a memory efficient way.
+ *
+ *
+ * HLL header
+ * ===
+ *
+ * Both the dense and sparse representation have a 16 byte header as follows:
+ *
+ * +------+---+-----+----------+
+ * | HYLL | E | N/U | Cardin.  |
+ * +------+---+-----+----------+
+ *
+ * The first 4 bytes are a magic string set to the bytes "HYLL".
+ * "E" is one byte encoding, currently set to HLL_DENSE or
+ * HLL_SPARSE. N/U are three not used bytes.
+ *
+ * The "Cardin." field is a 64 bit integer stored in little endian format
+ * with the latest cardinality computed that can be reused if the data
+ * structure was not modified since the last computation (this is useful
+ * because there are high probabilities that HLLADD operations don't
+ * modify the actual data structure and hence the approximated cardinality).
+ *
+ * When the most significant bit in the most significant byte of the cached
+ * cardinality is set, it means that the data structure was modified and
+ * we can't reuse the cached value that must be recomputed.
+ *
+ * Dense representation
+ * ===
+ *
+ * The dense representation used by Redis is the following:
+ *
+ * +--------+--------+--------+------//      //--+
+ * |11000000|22221111|33333322|55444444 ....     |
+ * +--------+--------+--------+------//      //--+
+ *
+ * The 6 bits counters are encoded one after the other starting from the
+ * LSB to the MSB, and using the next bytes as needed.
+ *
+ * Sparse representation
+ * ===
+ *
+ * The sparse representation encodes registers using a run length
+ * encoding composed of three opcodes, two using one byte, and one using
+ * of two bytes. The opcodes are called ZERO, XZERO and VAL.
+ *
+ * ZERO opcode is represented as 00xxxxxx. The 6-bit integer represented
+ * by the six bits 'xxxxxx', plus 1, means that there are N registers set
+ * to 0. This opcode can represent from 1 to 64 contiguous registers set
+ * to the value of 0.
+ *
+ * XZERO opcode is represented by two bytes 01xxxxxx yyyyyyyy. The 14-bit
+ * integer represented by the bits 'xxxxxx' as most significant bits and
+ * 'yyyyyyyy' as least significant bits, plus 1, means that there are N
+ * registers set to 0. This opcode can represent from 0 to 16384 contiguous
+ * registers set to the value of 0.
+ *
+ * VAL opcode is represented as 1vvvvvxx. It contains a 5-bit integer
+ * representing the value of a register, and a 2-bit integer representing
+ * the number of contiguous registers set to that value 'vvvvv'.
+ * To obtain the value and run length, the integers vvvvv and xx must be
+ * incremented by one. This opcode can represent values from 1 to 32,
+ * repeated from 1 to 4 times.
+ *
+ * The sparse representation can't represent registers with a value greater
+ * than 32, however it is very unlikely that we find such a register in an
+ * HLL with a cardinality where the sparse representation is still more
+ * memory efficient than the dense representation. When this happens the
+ * HLL is converted to the dense representation.
+ *
+ * The sparse representation is purely positional. For example a sparse
+ * representation of an empty HLL is just: XZERO:16384.
+ *
+ * An HLL having only 3 non-zero registers at position 1000, 1020, 1021
+ * respectively set to 2, 3, 3, is represented by the following three
+ * opcodes:
+ *
+ * XZERO:1000 (Registers 0-999 are set to 0)
+ * VAL:2,1    (1 register set to value 2, that is register 1000)
+ * ZERO:19    (Registers 1001-1019 set to 0)
+ * VAL:3,2    (2 registers set to value 3, that is registers 1020,1021)
+ * XZERO:15362 (Registers 1022-16383 set to 0)
+ *
+ * In the example the sparse representation used just 7 bytes instead
+ * of 12k in order to represent the HLL registers. In general for low
+ * cardinality there is a big win in terms of space efficiency, traded
+ * with CPU time since the sparse representation is slower to access:
+ *
+ * The following table shows average cardinality vs bytes used, 100
+ * samples per cardinality (when the set was not representable because
+ * of registers with too big value, the dense representation size was used
+ * as a sample).
+ *
+ * 100 267
+ * 200 485
+ * 300 678
+ * 400 859
+ * 500 1033
+ * 600 1205
+ * 700 1375
+ * 800 1544
+ * 900 1713
+ * 1000 1882
+ * 2000 3480
+ * 3000 4879
+ * 4000 6089
+ * 5000 7138
+ * 6000 8042
+ * 7000 8823
+ * 8000 9500
+ * 9000 10088
+ * 10000 10591
+ *
+ * The dense representation uses 12288 bytes, so there is a big win up to
+ * a cardinality of ~2000-3000. For bigger cardinalities the constant times
+ * involved in updating the sparse representation is not justified by the
+ * memory savings. The exact maximum length of the sparse representation
+ * when this implementation switches to the dense representation is
+ * configured via the define server.hll_sparse_max_bytes.
+ */
+
+struct hllhdr {
+    char magic[4];      /* "HYLL" */
+    uint8_t encoding;   /* HLL_DENSE or HLL_SPARSE. */
+    uint8_t notused[3]; /* Reserved for future use, must be zero. */
+    uint8_t card[8];    /* Cached cardinality, little endian. */
+    uint8_t registers[]; /* Data bytes. */
+};
+
+/* The cached cardinality MSB is used to signal validity of the cached value. */
+#define HLL_INVALIDATE_CACHE(hdr) (hdr)->card[7] |= (1<<7)
+#define HLL_VALID_CACHE(hdr) (((hdr)->card[7] & (1<<7)) == 0)
+
+#define HLL_P 14 /* The greater is P, the smaller the error. */
+#define HLL_Q (64-HLL_P) /* The number of bits of the hash value used for
+                            determining the number of leading zeros. */
+#define HLL_REGISTERS (1<<HLL_P) /* With P=14, 16384 registers. */
+#define HLL_P_MASK (HLL_REGISTERS-1) /* Mask to index register. */
+#define HLL_BITS 6 /* Enough to count up to 63 leading zeroes. */
+#define HLL_REGISTER_MAX ((1<<HLL_BITS)-1)
+#define HLL_HDR_SIZE sizeof(struct hllhdr)
+#define HLL_DENSE_SIZE (HLL_HDR_SIZE+((HLL_REGISTERS*HLL_BITS+7)/8))
+#define HLL_DENSE 0 /* Dense encoding. */
+#define HLL_SPARSE 1 /* Sparse encoding. */
+#define HLL_RAW 255 /* Only used internally, never exposed. */
+#define HLL_MAX_ENCODING 1
+
+static char *invalid_hll_err = "-INVALIDOBJ Corrupted HLL object detected";
+
+/* =========================== Low level bit macros ========================= */
+
+/* Macros to access the dense representation.
+ *
+ * We need to get and set 6 bit counters in an array of 8 bit bytes.
+ * We use macros to make sure the code is inlined since speed is critical
+ * especially in order to compute the approximated cardinality in
+ * HLLCOUNT where we need to access all the registers at once.
+ * For the same reason we also want to avoid conditionals in this code path.
+ *
+ * +--------+--------+--------+------//
+ * |11000000|22221111|33333322|55444444
+ * +--------+--------+--------+------//
+ *
+ * Note: in the above representation the most significant bit (MSB)
+ * of every byte is on the left. We start using bits from the LSB to MSB,
+ * and so forth passing to the next byte.
+ *
+ * Example, we want to access to counter at pos = 1 ("111111" in the
+ * illustration above).
+ *
+ * The index of the first byte b0 containing our data is:
+ *
+ *  b0 = 6 * pos / 8 = 0
+ *
+ *   +--------+
+ *   |11000000|  <- Our byte at b0
+ *   +--------+
+ *
+ * The position of the first bit (counting from the LSB = 0) in the byte
+ * is given by:
+ *
+ *  fb = 6 * pos % 8 -> 6
+ *
+ * Right shift b0 of 'fb' bits.
+ *
+ *   +--------+
+ *   |11000000|  <- Initial value of b0
+ *   |00000011|  <- After right shift of 6 pos.
+ *   +--------+
+ *
+ * Left shift b1 of bits 8-fb bits (2 bits)
+ *
+ *   +--------+
+ *   |22221111|  <- Initial value of b1
+ *   |22111100|  <- After left shift of 2 bits.
+ *   +--------+
+ *
+ * OR the two bits, and finally AND with 111111 (63 in decimal) to
+ * clean the higher order bits we are not interested in:
+ *
+ *   +--------+
+ *   |00000011|  <- b0 right shifted
+ *   |22111100|  <- b1 left shifted
+ *   |22111111|  <- b0 OR b1
+ *   |  111111|  <- (b0 OR b1) AND 63, our value.
+ *   +--------+
+ *
+ * We can try with a different example, like pos = 0. In this case
+ * the 6-bit counter is actually contained in a single byte.
+ *
+ *  b0 = 6 * pos / 8 = 0
+ *
+ *   +--------+
+ *   |11000000|  <- Our byte at b0
+ *   +--------+
+ *
+ *  fb = 6 * pos % 8 = 0
+ *
+ *  So we right shift of 0 bits (no shift in practice) and
+ *  left shift the next byte of 8 bits, even if we don't use it,
+ *  but this has the effect of clearing the bits so the result
+ *  will not be affected after the OR.
+ *
+ * -------------------------------------------------------------------------
+ *
+ * Setting the register is a bit more complex, let's assume that 'val'
+ * is the value we want to set, already in the right range.
+ *
+ * We need two steps, in one we need to clear the bits, and in the other
+ * we need to bitwise-OR the new bits.
+ *
+ * Let's try with 'pos' = 1, so our first byte at 'b' is 0,
+ *
+ * "fb" is 6 in this case.
+ *
+ *   +--------+
+ *   |11000000|  <- Our byte at b0
+ *   +--------+
+ *
+ * To create an AND-mask to clear the bits about this position, we just
+ * initialize the mask with the value 63, left shift it of "fs" bits,
+ * and finally invert the result.
+ *
+ *   +--------+
+ *   |00111111|  <- "mask" starts at 63
+ *   |11000000|  <- "mask" after left shift of "ls" bits.
+ *   |00111111|  <- "mask" after invert.
+ *   +--------+
+ *
+ * Now we can bitwise-AND the byte at "b" with the mask, and bitwise-OR
+ * it with "val" left-shifted of "ls" bits to set the new bits.
+ *
+ * Now let's focus on the next byte b1:
+ *
+ *   +--------+
+ *   |22221111|  <- Initial value of b1
+ *   +--------+
+ *
+ * To build the AND mask we start again with the 63 value, right shift
+ * it by 8-fb bits, and invert it.
+ *
+ *   +--------+
+ *   |00111111|  <- "mask" set at 2&6-1
+ *   |00001111|  <- "mask" after the right shift by 8-fb = 2 bits
+ *   |11110000|  <- "mask" after bitwise not.
+ *   +--------+
+ *
+ * Now we can mask it with b+1 to clear the old bits, and bitwise-OR
+ * with "val" left-shifted by "rs" bits to set the new value.
+ */
+
+/* Note: if we access the last counter, we will also access the b+1 byte
+ * that is out of the array, but sds strings always have an implicit null
+ * term, so the byte exists, and we can skip the conditional (or the need
+ * to allocate 1 byte more explicitly). */
+
+/* Store the value of the register at position 'regnum' into variable 'target'.
+ * 'p' is an array of unsigned bytes. */
+#define HLL_DENSE_GET_REGISTER(target,p,regnum) do { \
+    uint8_t *_p = (uint8_t*) p; \
+    unsigned long _byte = regnum*HLL_BITS/8; \
+    unsigned long _fb = regnum*HLL_BITS&7; \
+    unsigned long _fb8 = 8 - _fb; \
+    unsigned long b0 = _p[_byte]; \
+    unsigned long b1 = _p[_byte+1]; \
+    target = ((b0 >> _fb) | (b1 << _fb8)) & HLL_REGISTER_MAX; \
+} while(0)
+
+/* Set the value of the register at position 'regnum' to 'val'.
+ * 'p' is an array of unsigned bytes. */
+#define HLL_DENSE_SET_REGISTER(p,regnum,val) do { \
+    uint8_t *_p = (uint8_t*) p; \
+    unsigned long _byte = regnum*HLL_BITS/8; \
+    unsigned long _fb = regnum*HLL_BITS&7; \
+    unsigned long _fb8 = 8 - _fb; \
+    unsigned long _v = val; \
+    _p[_byte] &= ~(HLL_REGISTER_MAX << _fb); \
+    _p[_byte] |= _v << _fb; \
+    _p[_byte+1] &= ~(HLL_REGISTER_MAX >> _fb8); \
+    _p[_byte+1] |= _v >> _fb8; \
+} while(0)
+
+/* Macros to access the sparse representation.
+ * The macros parameter is expected to be an uint8_t pointer. */
+#define HLL_SPARSE_XZERO_BIT 0x40 /* 01xxxxxx */
+#define HLL_SPARSE_VAL_BIT 0x80 /* 1vvvvvxx */
+#define HLL_SPARSE_IS_ZERO(p) (((*(p)) & 0xc0) == 0) /* 00xxxxxx */
+#define HLL_SPARSE_IS_XZERO(p) (((*(p)) & 0xc0) == HLL_SPARSE_XZERO_BIT)
+#define HLL_SPARSE_IS_VAL(p) ((*(p)) & HLL_SPARSE_VAL_BIT)
+#define HLL_SPARSE_ZERO_LEN(p) (((*(p)) & 0x3f)+1)
+#define HLL_SPARSE_XZERO_LEN(p) (((((*(p)) & 0x3f) << 8) | (*((p)+1)))+1)
+#define HLL_SPARSE_VAL_VALUE(p) ((((*(p)) >> 2) & 0x1f)+1)
+#define HLL_SPARSE_VAL_LEN(p) (((*(p)) & 0x3)+1)
+#define HLL_SPARSE_VAL_MAX_VALUE 32
+#define HLL_SPARSE_VAL_MAX_LEN 4
+#define HLL_SPARSE_ZERO_MAX_LEN 64
+#define HLL_SPARSE_XZERO_MAX_LEN 16384
+#define HLL_SPARSE_VAL_SET(p,val,len) do { \
+    *(p) = (((val)-1)<<2|((len)-1))|HLL_SPARSE_VAL_BIT; \
+} while(0)
+#define HLL_SPARSE_ZERO_SET(p,len) do { \
+    *(p) = (len)-1; \
+} while(0)
+#define HLL_SPARSE_XZERO_SET(p,len) do { \
+    int _l = (len)-1; \
+    *(p) = (_l>>8) | HLL_SPARSE_XZERO_BIT; \
+    *((p)+1) = (_l&0xff); \
+} while(0)
+#define HLL_ALPHA_INF 0.721347520444481703680 /* constant for 0.5/ln(2) */
+
+/* ========================= HyperLogLog algorithm  ========================= */
+
+/* Our hash function is MurmurHash2, 64 bit version.
+ * It was modified for Redis in order to provide the same result in
+ * big and little endian archs (endian neutral). */
+uint64_t MurmurHash64A (const void * key, int len, unsigned int seed) {
+    const uint64_t m = 0xc6a4a7935bd1e995;
+    const int r = 47;
+    uint64_t h = seed ^ (len * m);
+    const uint8_t *data = (const uint8_t *)key;
+    const uint8_t *end = data + (len-(len&7));
+
+    while(data != end) {
+        uint64_t k;
+
+#if (BYTE_ORDER == LITTLE_ENDIAN)
+    #ifdef USE_ALIGNED_ACCESS
+        memcpy(&k,data,sizeof(uint64_t));
+    #else
+        k = *((uint64_t*)data);
+    #endif
+#else
+        k = (uint64_t) data[0];
+        k |= (uint64_t) data[1] << 8;
+        k |= (uint64_t) data[2] << 16;
+        k |= (uint64_t) data[3] << 24;
+        k |= (uint64_t) data[4] << 32;
+        k |= (uint64_t) data[5] << 40;
+        k |= (uint64_t) data[6] << 48;
+        k |= (uint64_t) data[7] << 56;
+#endif
+
+        k *= m;
+        k ^= k >> r;
+        k *= m;
+        h ^= k;
+        h *= m;
+        data += 8;
+    }
+
+    switch(len & 7) {
+    case 7: h ^= (uint64_t)data[6] << 48; /* fall-thru */
+    case 6: h ^= (uint64_t)data[5] << 40; /* fall-thru */
+    case 5: h ^= (uint64_t)data[4] << 32; /* fall-thru */
+    case 4: h ^= (uint64_t)data[3] << 24; /* fall-thru */
+    case 3: h ^= (uint64_t)data[2] << 16; /* fall-thru */
+    case 2: h ^= (uint64_t)data[1] << 8; /* fall-thru */
+    case 1: h ^= (uint64_t)data[0];
+            h *= m; /* fall-thru */
+    };
+
+    h ^= h >> r;
+    h *= m;
+    h ^= h >> r;
+    return h;
+}
+
+/* Given a string element to add to the HyperLogLog, returns the length
+ * of the pattern 000..1 of the element hash. As a side effect 'regp' is
+ * set to the register index this element hashes to. */
+int hllPatLen(unsigned char *ele, size_t elesize, long *regp) {
+    uint64_t hash, bit, index;
+    int count;
+
+    /* Count the number of zeroes starting from bit HLL_REGISTERS
+     * (that is a power of two corresponding to the first bit we don't use
+     * as index). The max run can be 64-P+1 = Q+1 bits.
+     *
+     * Note that the final "1" ending the sequence of zeroes must be
+     * included in the count, so if we find "001" the count is 3, and
+     * the smallest count possible is no zeroes at all, just a 1 bit
+     * at the first position, that is a count of 1.
+     *
+     * This may sound like inefficient, but actually in the average case
+     * there are high probabilities to find a 1 after a few iterations. */
+    hash = MurmurHash64A(ele,elesize,0xadc83b19ULL);
+    index = hash & HLL_P_MASK; /* Register index. */
+    hash >>= HLL_P; /* Remove bits used to address the register. */
+    hash |= ((uint64_t)1<<HLL_Q); /* Make sure the loop terminates
+                                     and count will be <= Q+1. */
+    bit = 1;
+    count = 1; /* Initialized to 1 since we count the "00000...1" pattern. */
+    while((hash & bit) == 0) {
+        count++;
+        bit <<= 1;
+    }
+    *regp = (int) index;
+    return count;
+}
+
+/* ================== Dense representation implementation  ================== */
+
+/* Low level function to set the dense HLL register at 'index' to the
+ * specified value if the current value is smaller than 'count'.
+ *
+ * 'registers' is expected to have room for HLL_REGISTERS plus an
+ * additional byte on the right. This requirement is met by sds strings
+ * automatically since they are implicitly null terminated.
+ *
+ * The function always succeed, however if as a result of the operation
+ * the approximated cardinality changed, 1 is returned. Otherwise 0
+ * is returned. */
+int hllDenseSet(uint8_t *registers, long index, uint8_t count) {
+    uint8_t oldcount;
+
+    HLL_DENSE_GET_REGISTER(oldcount,registers,index);
+    if (count > oldcount) {
+        HLL_DENSE_SET_REGISTER(registers,index,count);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* "Add" the element in the dense hyperloglog data structure.
+ * Actually nothing is added, but the max 0 pattern counter of the subset
+ * the element belongs to is incremented if needed.
+ *
+ * This is just a wrapper to hllDenseSet(), performing the hashing of the
+ * element in order to retrieve the index and zero-run count. */
+int hllDenseAdd(uint8_t *registers, unsigned char *ele, size_t elesize) {
+    long index;
+    uint8_t count = hllPatLen(ele,elesize,&index);
+    /* Update the register if this element produced a longer run of zeroes. */
+    return hllDenseSet(registers,index,count);
+}
+
+/* Compute the register histogram in the dense representation. */
+void hllDenseRegHisto(uint8_t *registers, int* reghisto) {
+    int j;
+
+    /* Redis default is to use 16384 registers 6 bits each. The code works
+     * with other values by modifying the defines, but for our target value
+     * we take a faster path with unrolled loops. */
+    if (HLL_REGISTERS == 16384 && HLL_BITS == 6) {
+        uint8_t *r = registers;
+        unsigned long r0, r1, r2, r3, r4, r5, r6, r7, r8, r9,
+                      r10, r11, r12, r13, r14, r15;
+        for (j = 0; j < 1024; j++) {
+            /* Handle 16 registers per iteration. */
+            r0 = r[0] & 63;
+            r1 = (r[0] >> 6 | r[1] << 2) & 63;
+            r2 = (r[1] >> 4 | r[2] << 4) & 63;
+            r3 = (r[2] >> 2) & 63;
+            r4 = r[3] & 63;
+            r5 = (r[3] >> 6 | r[4] << 2) & 63;
+            r6 = (r[4] >> 4 | r[5] << 4) & 63;
+            r7 = (r[5] >> 2) & 63;
+            r8 = r[6] & 63;
+            r9 = (r[6] >> 6 | r[7] << 2) & 63;
+            r10 = (r[7] >> 4 | r[8] << 4) & 63;
+            r11 = (r[8] >> 2) & 63;
+            r12 = r[9] & 63;
+            r13 = (r[9] >> 6 | r[10] << 2) & 63;
+            r14 = (r[10] >> 4 | r[11] << 4) & 63;
+            r15 = (r[11] >> 2) & 63;
+
+            reghisto[r0]++;
+            reghisto[r1]++;
+            reghisto[r2]++;
+            reghisto[r3]++;
+            reghisto[r4]++;
+            reghisto[r5]++;
+            reghisto[r6]++;
+            reghisto[r7]++;
+            reghisto[r8]++;
+            reghisto[r9]++;
+            reghisto[r10]++;
+            reghisto[r11]++;
+            reghisto[r12]++;
+            reghisto[r13]++;
+            reghisto[r14]++;
+            reghisto[r15]++;
+
+            r += 12;
+        }
+    } else {
+        for(j = 0; j < HLL_REGISTERS; j++) {
+            unsigned long reg;
+            HLL_DENSE_GET_REGISTER(reg,registers,j);
+            reghisto[reg]++;
+        }
+    }
+}
+
+/* ================== Sparse representation implementation  ================= */
+
+/* Convert the HLL with sparse representation given as input in its dense
+ * representation. Both representations are represented by SDS strings, and
+ * the input representation is freed as a side effect.
+ *
+ * The function returns C_OK if the sparse representation was valid,
+ * otherwise C_ERR is returned if the representation was corrupted. */
+int hllSparseToDense(robj *o) {
+    sds sparse = o->ptr, dense;
+    struct hllhdr *hdr, *oldhdr = (struct hllhdr*)sparse;
+    int idx = 0, runlen, regval;
+    uint8_t *p = (uint8_t*)sparse, *end = p+sdslen(sparse);
+
+    /* If the representation is already the right one return ASAP. */
+    hdr = (struct hllhdr*) sparse;
+    if (hdr->encoding == HLL_DENSE) return C_OK;
+
+    /* Create a string of the right size filled with zero bytes.
+     * Note that the cached cardinality is set to 0 as a side effect
+     * that is exactly the cardinality of an empty HLL. */
+    dense = sdsnewlen(NULL,HLL_DENSE_SIZE);
+    hdr = (struct hllhdr*) dense;
+    *hdr = *oldhdr; /* This will copy the magic and cached cardinality. */
+    hdr->encoding = HLL_DENSE;
+
+    /* Now read the sparse representation and set non-zero registers
+     * accordingly. */
+    p += HLL_HDR_SIZE;
+    while(p < end) {
+        if (HLL_SPARSE_IS_ZERO(p)) {
+            runlen = HLL_SPARSE_ZERO_LEN(p);
+            idx += runlen;
+            p++;
+        } else if (HLL_SPARSE_IS_XZERO(p)) {
+            runlen = HLL_SPARSE_XZERO_LEN(p);
+            idx += runlen;
+            p += 2;
+        } else {
+            runlen = HLL_SPARSE_VAL_LEN(p);
+            regval = HLL_SPARSE_VAL_VALUE(p);
+            if ((runlen + idx) > HLL_REGISTERS) break; /* Overflow. */
+            while(runlen--) {
+                HLL_DENSE_SET_REGISTER(hdr->registers,idx,regval);
+                idx++;
+            }
+            p++;
+        }
+    }
+
+    /* If the sparse representation was valid, we expect to find idx
+     * set to HLL_REGISTERS. */
+    if (idx != HLL_REGISTERS) {
+        sdsfree(dense);
+        return C_ERR;
+    }
+
+    /* Free the old representation and set the new one. */
+    sdsfree(o->ptr);
+    o->ptr = dense;
+    return C_OK;
+}
+
+/* Low level function to set the sparse HLL register at 'index' to the
+ * specified value if the current value is smaller than 'count'.
+ *
+ * The object 'o' is the String object holding the HLL. The function requires
+ * a reference to the object in order to be able to enlarge the string if
+ * needed.
+ *
+ * On success, the function returns 1 if the cardinality changed, or 0
+ * if the register for this element was not updated.
+ * On error (if the representation is invalid) -1 is returned.
+ *
+ * As a side effect the function may promote the HLL representation from
+ * sparse to dense: this happens when a register requires to be set to a value
+ * not representable with the sparse representation, or when the resulting
+ * size would be greater than server.hll_sparse_max_bytes. */
+int hllSparseSet(robj *o, long index, uint8_t count) {
+    struct hllhdr *hdr;
+    uint8_t oldcount, *sparse, *end, *p, *prev, *next;
+    long first, span;
+    long is_zero = 0, is_xzero = 0, is_val = 0, runlen = 0;
+
+    /* If the count is too big to be representable by the sparse representation
+     * switch to dense representation. */
+    if (count > HLL_SPARSE_VAL_MAX_VALUE) goto promote;
+
+    /* When updating a sparse representation, sometimes we may need to
+     * enlarge the buffer for up to 3 bytes in the worst case (XZERO split
+     * into XZERO-VAL-XZERO). Make sure there is enough space right now
+     * so that the pointers we take during the execution of the function
+     * will be valid all the time. */
+    o->ptr = sdsMakeRoomFor(o->ptr,3);
+
+    /* Step 1: we need to locate the opcode we need to modify to check
+     * if a value update is actually needed. */
+    sparse = p = ((uint8_t*)o->ptr) + HLL_HDR_SIZE;
+    end = p + sdslen(o->ptr) - HLL_HDR_SIZE;
+
+    first = 0;
+    prev = NULL; /* Points to previous opcode at the end of the loop. */
+    next = NULL; /* Points to the next opcode at the end of the loop. */
+    span = 0;
+    while(p < end) {
+        long oplen;
+
+        /* Set span to the number of registers covered by this opcode.
+         *
+         * This is the most performance critical loop of the sparse
+         * representation. Sorting the conditionals from the most to the
+         * least frequent opcode in many-bytes sparse HLLs is faster. */
+        oplen = 1;
+        if (HLL_SPARSE_IS_ZERO(p)) {
+            span = HLL_SPARSE_ZERO_LEN(p);
+        } else if (HLL_SPARSE_IS_VAL(p)) {
+            span = HLL_SPARSE_VAL_LEN(p);
+        } else { /* XZERO. */
+            span = HLL_SPARSE_XZERO_LEN(p);
+            oplen = 2;
+        }
+        /* Break if this opcode covers the register as 'index'. */
+        if (index <= first+span-1) break;
+        prev = p;
+        p += oplen;
+        first += span;
+    }
+    if (span == 0 || p >= end) return -1; /* Invalid format. */
+
+    next = HLL_SPARSE_IS_XZERO(p) ? p+2 : p+1;
+    if (next >= end) next = NULL;
+
+    /* Cache current opcode type to avoid using the macro again and
+     * again for something that will not change.
+     * Also cache the run-length of the opcode. */
+    if (HLL_SPARSE_IS_ZERO(p)) {
+        is_zero = 1;
+        runlen = HLL_SPARSE_ZERO_LEN(p);
+    } else if (HLL_SPARSE_IS_XZERO(p)) {
+        is_xzero = 1;
+        runlen = HLL_SPARSE_XZERO_LEN(p);
+    } else {
+        is_val = 1;
+        runlen = HLL_SPARSE_VAL_LEN(p);
+    }
+
+    /* Step 2: After the loop:
+     *
+     * 'first' stores to the index of the first register covered
+     *  by the current opcode, which is pointed by 'p'.
+     *
+     * 'next' ad 'prev' store respectively the next and previous opcode,
+     *  or NULL if the opcode at 'p' is respectively the last or first.
+     *
+     * 'span' is set to the number of registers covered by the current
+     *  opcode.
+     *
+     * There are different cases in order to update the data structure
+     * in place without generating it from scratch:
+     *
+     * A) If it is a VAL opcode already set to a value >= our 'count'
+     *    no update is needed, regardless of the VAL run-length field.
+     *    In this case PFADD returns 0 since no changes are performed.
+     *
+     * B) If it is a VAL opcode with len = 1 (representing only our
+     *    register) and the value is less than 'count', we just update it
+     *    since this is a trivial case. */
+    if (is_val) {
+        oldcount = HLL_SPARSE_VAL_VALUE(p);
+        /* Case A. */
+        if (oldcount >= count) return 0;
+
+        /* Case B. */
+        if (runlen == 1) {
+            HLL_SPARSE_VAL_SET(p,count,1);
+            goto updated;
+        }
+    }
+
+    /* C) Another trivial to handle case is a ZERO opcode with a len of 1.
+     * We can just replace it with a VAL opcode with our value and len of 1. */
+    if (is_zero && runlen == 1) {
+        HLL_SPARSE_VAL_SET(p,count,1);
+        goto updated;
+    }
+
+    /* D) General case.
+     *
+     * The other cases are more complex: our register requires to be updated
+     * and is either currently represented by a VAL opcode with len > 1,
+     * by a ZERO opcode with len > 1, or by an XZERO opcode.
+     *
+     * In those cases the original opcode must be split into multiple
+     * opcodes. The worst case is an XZERO split in the middle resulting into
+     * XZERO - VAL - XZERO, so the resulting sequence max length is
+     * 5 bytes.
+     *
+     * We perform the split writing the new sequence into the 'new' buffer
+     * with 'newlen' as length. Later the new sequence is inserted in place
+     * of the old one, possibly moving what is on the right a few bytes
+     * if the new sequence is longer than the older one. */
+    uint8_t seq[5], *n = seq;
+    int last = first+span-1; /* Last register covered by the sequence. */
+    int len;
+
+    if (is_zero || is_xzero) {
+        /* Handle splitting of ZERO / XZERO. */
+        if (index != first) {
+            len = index-first;
+            if (len > HLL_SPARSE_ZERO_MAX_LEN) {
+                HLL_SPARSE_XZERO_SET(n,len);
+                n += 2;
+            } else {
+                HLL_SPARSE_ZERO_SET(n,len);
+                n++;
+            }
+        }
+        HLL_SPARSE_VAL_SET(n,count,1);
+        n++;
+        if (index != last) {
+            len = last-index;
+            if (len > HLL_SPARSE_ZERO_MAX_LEN) {
+                HLL_SPARSE_XZERO_SET(n,len);
+                n += 2;
+            } else {
+                HLL_SPARSE_ZERO_SET(n,len);
+                n++;
+            }
+        }
+    } else {
+        /* Handle splitting of VAL. */
+        int curval = HLL_SPARSE_VAL_VALUE(p);
+
+        if (index != first) {
+            len = index-first;
+            HLL_SPARSE_VAL_SET(n,curval,len);
+            n++;
+        }
+        HLL_SPARSE_VAL_SET(n,count,1);
+        n++;
+        if (index != last) {
+            len = last-index;
+            HLL_SPARSE_VAL_SET(n,curval,len);
+            n++;
+        }
+    }
+
+    /* Step 3: substitute the new sequence with the old one.
+     *
+     * Note that we already allocated space on the sds string
+     * calling sdsMakeRoomFor(). */
+     int seqlen = n-seq;
+     int oldlen = is_xzero ? 2 : 1;
+     int deltalen = seqlen-oldlen;
+
+     if (deltalen > 0 &&
+         sdslen(o->ptr)+deltalen > server.hll_sparse_max_bytes) goto promote;
+     if (deltalen && next) memmove(next+deltalen,next,end-next);
+     sdsIncrLen(o->ptr,deltalen);
+     memcpy(p,seq,seqlen);
+     end += deltalen;
+
+updated:
+    /* Step 4: Merge adjacent values if possible.
+     *
+     * The representation was updated, however the resulting representation
+     * may not be optimal: adjacent VAL opcodes can sometimes be merged into
+     * a single one. */
+    p = prev ? prev : sparse;
+    int scanlen = 5; /* Scan up to 5 upcodes starting from prev. */
+    while (p < end && scanlen--) {
+        if (HLL_SPARSE_IS_XZERO(p)) {
+            p += 2;
+            continue;
+        } else if (HLL_SPARSE_IS_ZERO(p)) {
+            p++;
+            continue;
+        }
+        /* We need two adjacent VAL opcodes to try a merge, having
+         * the same value, and a len that fits the VAL opcode max len. */
+        if (p+1 < end && HLL_SPARSE_IS_VAL(p+1)) {
+            int v1 = HLL_SPARSE_VAL_VALUE(p);
+            int v2 = HLL_SPARSE_VAL_VALUE(p+1);
+            if (v1 == v2) {
+                int len = HLL_SPARSE_VAL_LEN(p)+HLL_SPARSE_VAL_LEN(p+1);
+                if (len <= HLL_SPARSE_VAL_MAX_LEN) {
+                    HLL_SPARSE_VAL_SET(p+1,v1,len);
+                    memmove(p,p+1,end-p);
+                    sdsIncrLen(o->ptr,-1);
+                    end--;
+                    /* After a merge we reiterate without incrementing 'p'
+                     * in order to try to merge the just merged value with
+                     * a value on its right. */
+                    continue;
+                }
+            }
+        }
+        p++;
+    }
+
+    /* Invalidate the cached cardinality. */
+    hdr = o->ptr;
+    HLL_INVALIDATE_CACHE(hdr);
+    return 1;
+
+promote: /* Promote to dense representation. */
+    if (hllSparseToDense(o) == C_ERR) return -1; /* Corrupted HLL. */
+    hdr = o->ptr;
+
+    /* We need to call hllDenseAdd() to perform the operation after the
+     * conversion. However the result must be 1, since if we need to
+     * convert from sparse to dense a register requires to be updated.
+     *
+     * Note that this in turn means that PFADD will make sure the command
+     * is propagated to slaves / AOF, so if there is a sparse -> dense
+     * conversion, it will be performed in all the slaves as well. */
+    int dense_retval = hllDenseSet(hdr->registers,index,count);
+    serverAssert(dense_retval == 1);
+    return dense_retval;
+}
+
+/* "Add" the element in the sparse hyperloglog data structure.
+ * Actually nothing is added, but the max 0 pattern counter of the subset
+ * the element belongs to is incremented if needed.
+ *
+ * This function is actually a wrapper for hllSparseSet(), it only performs
+ * the hashshing of the element to obtain the index and zeros run length. */
+int hllSparseAdd(robj *o, unsigned char *ele, size_t elesize) {
+    long index;
+    uint8_t count = hllPatLen(ele,elesize,&index);
+    /* Update the register if this element produced a longer run of zeroes. */
+    return hllSparseSet(o,index,count);
+}
+
+/* Compute the register histogram in the sparse representation. */
+void hllSparseRegHisto(uint8_t *sparse, int sparselen, int *invalid, int* reghisto) {
+    int idx = 0, runlen, regval;
+    uint8_t *end = sparse+sparselen, *p = sparse;
+
+    while(p < end) {
+        if (HLL_SPARSE_IS_ZERO(p)) {
+            runlen = HLL_SPARSE_ZERO_LEN(p);
+            idx += runlen;
+            reghisto[0] += runlen;
+            p++;
+        } else if (HLL_SPARSE_IS_XZERO(p)) {
+            runlen = HLL_SPARSE_XZERO_LEN(p);
+            idx += runlen;
+            reghisto[0] += runlen;
+            p += 2;
+        } else {
+            runlen = HLL_SPARSE_VAL_LEN(p);
+            regval = HLL_SPARSE_VAL_VALUE(p);
+            idx += runlen;
+            reghisto[regval] += runlen;
+            p++;
+        }
+    }
+    if (idx != HLL_REGISTERS && invalid) *invalid = 1;
+}
+
+/* ========================= HyperLogLog Count ==============================
+ * This is the core of the algorithm where the approximated count is computed.
+ * The function uses the lower level hllDenseRegHisto() and hllSparseRegHisto()
+ * functions as helpers to compute histogram of register values part of the
+ * computation, which is representation-specific, while all the rest is common. */
+
+/* Implements the register histogram calculation for uint8_t data type
+ * which is only used internally as speedup for PFCOUNT with multiple keys. */
+void hllRawRegHisto(uint8_t *registers, int* reghisto) {
+    uint64_t *word = (uint64_t*) registers;
+    uint8_t *bytes;
+    int j;
+
+    for (j = 0; j < HLL_REGISTERS/8; j++) {
+        if (*word == 0) {
+            reghisto[0] += 8;
+        } else {
+            bytes = (uint8_t*) word;
+            reghisto[bytes[0]]++;
+            reghisto[bytes[1]]++;
+            reghisto[bytes[2]]++;
+            reghisto[bytes[3]]++;
+            reghisto[bytes[4]]++;
+            reghisto[bytes[5]]++;
+            reghisto[bytes[6]]++;
+            reghisto[bytes[7]]++;
+        }
+        word++;
+    }
+}
+
+/* Helper function sigma as defined in
+ * "New cardinality estimation algorithms for HyperLogLog sketches"
+ * Otmar Ertl, arXiv:1702.01284 */
+double hllSigma(double x) {
+    if (x == 1.) return INFINITY;
+    double zPrime;
+    double y = 1;
+    double z = x;
+    do {
+        x *= x;
+        zPrime = z;
+        z += x * y;
+        y += y;
+    } while(zPrime != z);
+    return z;
+}
+
+/* Helper function tau as defined in
+ * "New cardinality estimation algorithms for HyperLogLog sketches"
+ * Otmar Ertl, arXiv:1702.01284 */
+double hllTau(double x) {
+    if (x == 0. || x == 1.) return 0.;
+    double zPrime;
+    double y = 1.0;
+    double z = 1 - x;
+    do {
+        x = sqrt(x);
+        zPrime = z;
+        y *= 0.5;
+        z -= pow(1 - x, 2)*y;
+    } while(zPrime != z);
+    return z / 3;
+}
+
+/* Return the approximated cardinality of the set based on the harmonic
+ * mean of the registers values. 'hdr' points to the start of the SDS
+ * representing the String object holding the HLL representation.
+ *
+ * If the sparse representation of the HLL object is not valid, the integer
+ * pointed by 'invalid' is set to non-zero, otherwise it is left untouched.
+ *
+ * hllCount() supports a special internal-only encoding of HLL_RAW, that
+ * is, hdr->registers will point to an uint8_t array of HLL_REGISTERS element.
+ * This is useful in order to speedup PFCOUNT when called against multiple
+ * keys (no need to work with 6-bit integers encoding). */
+uint64_t hllCount(struct hllhdr *hdr, int *invalid) {
+    double m = HLL_REGISTERS;
+    double E;
+    int j;
+    /* Note that reghisto size could be just HLL_Q+2, because HLL_Q+1 is
+     * the maximum frequency of the "000...1" sequence the hash function is
+     * able to return. However it is slow to check for sanity of the
+     * input: instead we history array at a safe size: overflows will
+     * just write data to wrong, but correctly allocated, places. */
+    int reghisto[64] = {0};
+
+    /* Compute register histogram */
+    if (hdr->encoding == HLL_DENSE) {
+        hllDenseRegHisto(hdr->registers,reghisto);
+    } else if (hdr->encoding == HLL_SPARSE) {
+        hllSparseRegHisto(hdr->registers,
+                         sdslen((sds)hdr)-HLL_HDR_SIZE,invalid,reghisto);
+    } else if (hdr->encoding == HLL_RAW) {
+        hllRawRegHisto(hdr->registers,reghisto);
+    } else {
+        serverPanic("Unknown HyperLogLog encoding in hllCount()");
+    }
+
+    /* Estimate cardinality form register histogram. See:
+     * "New cardinality estimation algorithms for HyperLogLog sketches"
+     * Otmar Ertl, arXiv:1702.01284 */
+    double z = m * hllTau((m-reghisto[HLL_Q+1])/(double)m);
+    for (j = HLL_Q; j >= 1; --j) {
+        z += reghisto[j];
+        z *= 0.5;
+    }
+    z += m * hllSigma(reghisto[0]/(double)m);
+    E = llroundl(HLL_ALPHA_INF*m*m/z);
+
+    return (uint64_t) E;
+}
+
+/* Call hllDenseAdd() or hllSparseAdd() according to the HLL encoding. */
+int hllAdd(robj *o, unsigned char *ele, size_t elesize) {
+    struct hllhdr *hdr = o->ptr;
+    switch(hdr->encoding) {
+    case HLL_DENSE: return hllDenseAdd(hdr->registers,ele,elesize);
+    case HLL_SPARSE: return hllSparseAdd(o,ele,elesize);
+    default: return -1; /* Invalid representation. */
+    }
+}
+
+/* Merge by computing MAX(registers[i],hll[i]) the HyperLogLog 'hll'
+ * with an array of uint8_t HLL_REGISTERS registers pointed by 'max'.
+ *
+ * The hll object must be already validated via isHLLObjectOrReply()
+ * or in some other way.
+ *
+ * If the HyperLogLog is sparse and is found to be invalid, C_ERR
+ * is returned, otherwise the function always succeeds. */
+int hllMerge(uint8_t *max, robj *hll) {
+    struct hllhdr *hdr = hll->ptr;
+    int i;
+
+    if (hdr->encoding == HLL_DENSE) {
+        uint8_t val;
+
+        for (i = 0; i < HLL_REGISTERS; i++) {
+            HLL_DENSE_GET_REGISTER(val,hdr->registers,i);
+            if (val > max[i]) max[i] = val;
+        }
+    } else {
+        uint8_t *p = hll->ptr, *end = p + sdslen(hll->ptr);
+        long runlen, regval;
+
+        p += HLL_HDR_SIZE;
+        i = 0;
+        while(p < end) {
+            if (HLL_SPARSE_IS_ZERO(p)) {
+                runlen = HLL_SPARSE_ZERO_LEN(p);
+                i += runlen;
+                p++;
+            } else if (HLL_SPARSE_IS_XZERO(p)) {
+                runlen = HLL_SPARSE_XZERO_LEN(p);
+                i += runlen;
+                p += 2;
+            } else {
+                runlen = HLL_SPARSE_VAL_LEN(p);
+                regval = HLL_SPARSE_VAL_VALUE(p);
+                if ((runlen + i) > HLL_REGISTERS) break; /* Overflow. */
+                while(runlen--) {
+                    if (regval > max[i]) max[i] = regval;
+                    i++;
+                }
+                p++;
+            }
+        }
+        if (i != HLL_REGISTERS) return C_ERR;
+    }
+    return C_OK;
+}
+
+/* ========================== HyperLogLog commands ========================== */
+
+/* Create an HLL object. We always create the HLL using sparse encoding.
+ * This will be upgraded to the dense representation as needed. */
+robj *createHLLObject(void) {
+    robj *o;
+    struct hllhdr *hdr;
+    sds s;
+    uint8_t *p;
+    int sparselen = HLL_HDR_SIZE +
+                    (((HLL_REGISTERS+(HLL_SPARSE_XZERO_MAX_LEN-1)) /
+                     HLL_SPARSE_XZERO_MAX_LEN)*2);
+    int aux;
+
+    /* Populate the sparse representation with as many XZERO opcodes as
+     * needed to represent all the registers. */
+    aux = HLL_REGISTERS;
+    s = sdsnewlen(NULL,sparselen);
+    p = (uint8_t*)s + HLL_HDR_SIZE;
+    while(aux) {
+        int xzero = HLL_SPARSE_XZERO_MAX_LEN;
+        if (xzero > aux) xzero = aux;
+        HLL_SPARSE_XZERO_SET(p,xzero);
+        p += 2;
+        aux -= xzero;
+    }
+    serverAssert((p-(uint8_t*)s) == sparselen);
+
+    /* Create the actual object. */
+    o = createObject(OBJ_STRING,s);
+    hdr = o->ptr;
+    memcpy(hdr->magic,"HYLL",4);
+    hdr->encoding = HLL_SPARSE;
+    return o;
+}
+
+/* Check if the object is a String with a valid HLL representation.
+ * Return C_OK if this is true, otherwise reply to the client
+ * with an error and return C_ERR. */
+int isHLLObjectOrReply(client *c, robj *o) {
+    struct hllhdr *hdr;
+
+    /* Key exists, check type */
+    if (checkType(c,o,OBJ_STRING))
+        return C_ERR; /* Error already sent. */
+
+    if (!sdsEncodedObject(o)) goto invalid;
+    if (stringObjectLen(o) < sizeof(*hdr)) goto invalid;
+    hdr = o->ptr;
+
+    /* Magic should be "HYLL". */
+    if (hdr->magic[0] != 'H' || hdr->magic[1] != 'Y' ||
+        hdr->magic[2] != 'L' || hdr->magic[3] != 'L') goto invalid;
+
+    if (hdr->encoding > HLL_MAX_ENCODING) goto invalid;
+
+    /* Dense representation string length should match exactly. */
+    if (hdr->encoding == HLL_DENSE &&
+        stringObjectLen(o) != HLL_DENSE_SIZE) goto invalid;
+
+    /* All tests passed. */
+    return C_OK;
+
+invalid:
+    addReplyError(c,"-WRONGTYPE Key is not a valid "
+               "HyperLogLog string value.");
+    return C_ERR;
+}
+
+/* PFADD var ele ele ele ... ele => :0 or :1 */
+void pfaddCommand(client *c) {
+    robj *o = lookupKeyWrite(c->db,c->argv[1]);
+    struct hllhdr *hdr;
+    int updated = 0, j;
+
+    if (o == NULL) {
+        /* Create the key with a string value of the exact length to
+         * hold our HLL data structure. sdsnewlen() when NULL is passed
+         * is guaranteed to return bytes initialized to zero. */
+        o = createHLLObject();
+        dbAdd(c->db,c->argv[1],o);
+        updated++;
+    } else {
+        if (isHLLObjectOrReply(c,o) != C_OK) return;
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+    }
+    /* Perform the low level ADD operation for every element. */
+    for (j = 2; j < c->argc; j++) {
+        int retval = hllAdd(o, (unsigned char*)c->argv[j]->ptr,
+                               sdslen(c->argv[j]->ptr));
+        switch(retval) {
+        case 1:
+            updated++;
+            break;
+        case -1:
+            addReplyError(c,invalid_hll_err);
+            return;
+        }
+    }
+    hdr = o->ptr;
+    if (updated) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_STRING,"pfadd",c->argv[1],c->db->id);
+        server.dirty += updated;
+        HLL_INVALIDATE_CACHE(hdr);
+    }
+    addReply(c, updated ? shared.cone : shared.czero);
+}
+
+/* PFCOUNT var -> approximated cardinality of set. */
+void pfcountCommand(client *c) {
+    robj *o;
+    struct hllhdr *hdr;
+    uint64_t card;
+
+    /* Case 1: multi-key keys, cardinality of the union.
+     *
+     * When multiple keys are specified, PFCOUNT actually computes
+     * the cardinality of the merge of the N HLLs specified. */
+    if (c->argc > 2) {
+        uint8_t max[HLL_HDR_SIZE+HLL_REGISTERS], *registers;
+        int j;
+
+        /* Compute an HLL with M[i] = MAX(M[i]_j). */
+        memset(max,0,sizeof(max));
+        hdr = (struct hllhdr*) max;
+        hdr->encoding = HLL_RAW; /* Special internal-only encoding. */
+        registers = max + HLL_HDR_SIZE;
+        for (j = 1; j < c->argc; j++) {
+            /* Check type and size. */
+            robj *o = lookupKeyRead(c->db,c->argv[j]);
+            if (o == NULL) continue; /* Assume empty HLL for non existing var.*/
+            if (isHLLObjectOrReply(c,o) != C_OK) return;
+
+            /* Merge with this HLL with our 'max' HLL by setting max[i]
+             * to MAX(max[i],hll[i]). */
+            if (hllMerge(registers,o) == C_ERR) {
+                addReplyError(c,invalid_hll_err);
+                return;
+            }
+        }
+
+        /* Compute cardinality of the resulting set. */
+        addReplyLongLong(c,hllCount(hdr,NULL));
+        return;
+    }
+
+    /* Case 2: cardinality of the single HLL.
+     *
+     * The user specified a single key. Either return the cached value
+     * or compute one and update the cache. */
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (o == NULL) {
+        /* No key? Cardinality is zero since no element was added, otherwise
+         * we would have a key as HLLADD creates it as a side effect. */
+        addReply(c,shared.czero);
+    } else {
+        if (isHLLObjectOrReply(c,o) != C_OK) return;
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+
+        /* Check if the cached cardinality is valid. */
+        hdr = o->ptr;
+        if (HLL_VALID_CACHE(hdr)) {
+            /* Just return the cached value. */
+            card = (uint64_t)hdr->card[0];
+            card |= (uint64_t)hdr->card[1] << 8;
+            card |= (uint64_t)hdr->card[2] << 16;
+            card |= (uint64_t)hdr->card[3] << 24;
+            card |= (uint64_t)hdr->card[4] << 32;
+            card |= (uint64_t)hdr->card[5] << 40;
+            card |= (uint64_t)hdr->card[6] << 48;
+            card |= (uint64_t)hdr->card[7] << 56;
+        } else {
+            int invalid = 0;
+            /* Recompute it and update the cached value. */
+            card = hllCount(hdr,&invalid);
+            if (invalid) {
+                addReplyError(c,invalid_hll_err);
+                return;
+            }
+            hdr->card[0] = card & 0xff;
+            hdr->card[1] = (card >> 8) & 0xff;
+            hdr->card[2] = (card >> 16) & 0xff;
+            hdr->card[3] = (card >> 24) & 0xff;
+            hdr->card[4] = (card >> 32) & 0xff;
+            hdr->card[5] = (card >> 40) & 0xff;
+            hdr->card[6] = (card >> 48) & 0xff;
+            hdr->card[7] = (card >> 56) & 0xff;
+            /* This is not considered a read-only command even if the
+             * data structure is not modified, since the cached value
+             * may be modified and given that the HLL is a Redis string
+             * we need to propagate the change. */
+            signalModifiedKey(c,c->db,c->argv[1]);
+            server.dirty++;
+        }
+        addReplyLongLong(c,card);
+    }
+}
+
+/* PFMERGE dest src1 src2 src3 ... srcN => OK */
+void pfmergeCommand(client *c) {
+    uint8_t max[HLL_REGISTERS];
+    struct hllhdr *hdr;
+    int j;
+    int use_dense = 0; /* Use dense representation as target? */
+
+    /* Compute an HLL with M[i] = MAX(M[i]_j).
+     * We store the maximum into the max array of registers. We'll write
+     * it to the target variable later. */
+    memset(max,0,sizeof(max));
+    for (j = 1; j < c->argc; j++) {
+        /* Check type and size. */
+        robj *o = lookupKeyRead(c->db,c->argv[j]);
+        if (o == NULL) continue; /* Assume empty HLL for non existing var. */
+        if (isHLLObjectOrReply(c,o) != C_OK) return;
+
+        /* If at least one involved HLL is dense, use the dense representation
+         * as target ASAP to save time and avoid the conversion step. */
+        hdr = o->ptr;
+        if (hdr->encoding == HLL_DENSE) use_dense = 1;
+
+        /* Merge with this HLL with our 'max' HLL by setting max[i]
+         * to MAX(max[i],hll[i]). */
+        if (hllMerge(max,o) == C_ERR) {
+            addReplyError(c,invalid_hll_err);
+            return;
+        }
+    }
+
+    /* Create / unshare the destination key's value if needed. */
+    robj *o = lookupKeyWrite(c->db,c->argv[1]);
+    if (o == NULL) {
+        /* Create the key with a string value of the exact length to
+         * hold our HLL data structure. sdsnewlen() when NULL is passed
+         * is guaranteed to return bytes initialized to zero. */
+        o = createHLLObject();
+        dbAdd(c->db,c->argv[1],o);
+    } else {
+        /* If key exists we are sure it's of the right type/size
+         * since we checked when merging the different HLLs, so we
+         * don't check again. */
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+    }
+
+    /* Convert the destination object to dense representation if at least
+     * one of the inputs was dense. */
+    if (use_dense && hllSparseToDense(o) == C_ERR) {
+        addReplyError(c,invalid_hll_err);
+        return;
+    }
+
+    /* Write the resulting HLL to the destination HLL registers and
+     * invalidate the cached value. */
+    for (j = 0; j < HLL_REGISTERS; j++) {
+        if (max[j] == 0) continue;
+        hdr = o->ptr;
+        switch(hdr->encoding) {
+        case HLL_DENSE: hllDenseSet(hdr->registers,j,max[j]); break;
+        case HLL_SPARSE: hllSparseSet(o,j,max[j]); break;
+        }
+    }
+    hdr = o->ptr; /* o->ptr may be different now, as a side effect of
+                     last hllSparseSet() call. */
+    HLL_INVALIDATE_CACHE(hdr);
+
+    signalModifiedKey(c,c->db,c->argv[1]);
+    /* We generate a PFADD event for PFMERGE for semantical simplicity
+     * since in theory this is a mass-add of elements. */
+    notifyKeyspaceEvent(NOTIFY_STRING,"pfadd",c->argv[1],c->db->id);
+    server.dirty++;
+    addReply(c,shared.ok);
+}
+
+/* ========================== Testing / Debugging  ========================== */
+
+/* PFSELFTEST
+ * This command performs a self-test of the HLL registers implementation.
+ * Something that is not easy to test from within the outside. */
+#define HLL_TEST_CYCLES 1000
+void pfselftestCommand(client *c) {
+    unsigned int j, i;
+    sds bitcounters = sdsnewlen(NULL,HLL_DENSE_SIZE);
+    struct hllhdr *hdr = (struct hllhdr*) bitcounters, *hdr2;
+    robj *o = NULL;
+    uint8_t bytecounters[HLL_REGISTERS];
+
+    /* Test 1: access registers.
+     * The test is conceived to test that the different counters of our data
+     * structure are accessible and that setting their values both result in
+     * the correct value to be retained and not affect adjacent values. */
+    for (j = 0; j < HLL_TEST_CYCLES; j++) {
+        /* Set the HLL counters and an array of unsigned byes of the
+         * same size to the same set of random values. */
+        for (i = 0; i < HLL_REGISTERS; i++) {
+            unsigned int r = rand() & HLL_REGISTER_MAX;
+
+            bytecounters[i] = r;
+            HLL_DENSE_SET_REGISTER(hdr->registers,i,r);
+        }
+        /* Check that we are able to retrieve the same values. */
+        for (i = 0; i < HLL_REGISTERS; i++) {
+            unsigned int val;
+
+            HLL_DENSE_GET_REGISTER(val,hdr->registers,i);
+            if (val != bytecounters[i]) {
+                addReplyErrorFormat(c,
+                    "TESTFAILED Register %d should be %d but is %d",
+                    i, (int) bytecounters[i], (int) val);
+                goto cleanup;
+            }
+        }
+    }
+
+    /* Test 2: approximation error.
+     * The test adds unique elements and check that the estimated value
+     * is always reasonable bounds.
+     *
+     * We check that the error is smaller than a few times than the expected
+     * standard error, to make it very unlikely for the test to fail because
+     * of a "bad" run.
+     *
+     * The test is performed with both dense and sparse HLLs at the same
+     * time also verifying that the computed cardinality is the same. */
+    memset(hdr->registers,0,HLL_DENSE_SIZE-HLL_HDR_SIZE);
+    o = createHLLObject();
+    double relerr = 1.04/sqrt(HLL_REGISTERS);
+    int64_t checkpoint = 1;
+    uint64_t seed = (uint64_t)rand() | (uint64_t)rand() << 32;
+    uint64_t ele;
+    for (j = 1; j <= 10000000; j++) {
+        ele = j ^ seed;
+        hllDenseAdd(hdr->registers,(unsigned char*)&ele,sizeof(ele));
+        hllAdd(o,(unsigned char*)&ele,sizeof(ele));
+
+        /* Make sure that for small cardinalities we use sparse
+         * encoding. */
+        if (j == checkpoint && j < server.hll_sparse_max_bytes/2) {
+            hdr2 = o->ptr;
+            if (hdr2->encoding != HLL_SPARSE) {
+                addReplyError(c, "TESTFAILED sparse encoding not used");
+                goto cleanup;
+            }
+        }
+
+        /* Check that dense and sparse representations agree. */
+        if (j == checkpoint && hllCount(hdr,NULL) != hllCount(o->ptr,NULL)) {
+                addReplyError(c, "TESTFAILED dense/sparse disagree");
+                goto cleanup;
+        }
+
+        /* Check error. */
+        if (j == checkpoint) {
+            int64_t abserr = checkpoint - (int64_t)hllCount(hdr,NULL);
+            uint64_t maxerr = ceil(relerr*6*checkpoint);
+
+            /* Adjust the max error we expect for cardinality 10
+             * since from time to time it is statistically likely to get
+             * much higher error due to collision, resulting into a false
+             * positive. */
+            if (j == 10) maxerr = 1;
+
+            if (abserr < 0) abserr = -abserr;
+            if (abserr > (int64_t)maxerr) {
+                addReplyErrorFormat(c,
+                    "TESTFAILED Too big error. card:%llu abserr:%llu",
+                    (unsigned long long) checkpoint,
+                    (unsigned long long) abserr);
+                goto cleanup;
+            }
+            checkpoint *= 10;
+        }
+    }
+
+    /* Success! */
+    addReply(c,shared.ok);
+
+cleanup:
+    sdsfree(bitcounters);
+    if (o) decrRefCount(o);
+}
+
+/* PFDEBUG <subcommand> <key> ... args ...
+ * Different debugging related operations about the HLL implementation. */
+void pfdebugCommand(client *c) {
+    char *cmd = c->argv[1]->ptr;
+    struct hllhdr *hdr;
+    robj *o;
+    int j;
+
+    o = lookupKeyWrite(c->db,c->argv[2]);
+    if (o == NULL) {
+        addReplyError(c,"The specified key does not exist");
+        return;
+    }
+    if (isHLLObjectOrReply(c,o) != C_OK) return;
+    o = dbUnshareStringValue(c->db,c->argv[2],o);
+    hdr = o->ptr;
+
+    /* PFDEBUG GETREG <key> */
+    if (!strcasecmp(cmd,"getreg")) {
+        if (c->argc != 3) goto arityerr;
+
+        if (hdr->encoding == HLL_SPARSE) {
+            if (hllSparseToDense(o) == C_ERR) {
+                addReplyError(c,invalid_hll_err);
+                return;
+            }
+            server.dirty++; /* Force propagation on encoding change. */
+        }
+
+        hdr = o->ptr;
+        addReplyArrayLen(c,HLL_REGISTERS);
+        for (j = 0; j < HLL_REGISTERS; j++) {
+            uint8_t val;
+
+            HLL_DENSE_GET_REGISTER(val,hdr->registers,j);
+            addReplyLongLong(c,val);
+        }
+    }
+    /* PFDEBUG DECODE <key> */
+    else if (!strcasecmp(cmd,"decode")) {
+        if (c->argc != 3) goto arityerr;
+
+        uint8_t *p = o->ptr, *end = p+sdslen(o->ptr);
+        sds decoded = sdsempty();
+
+        if (hdr->encoding != HLL_SPARSE) {
+            sdsfree(decoded);
+            addReplyError(c,"HLL encoding is not sparse");
+            return;
+        }
+
+        p += HLL_HDR_SIZE;
+        while(p < end) {
+            int runlen, regval;
+
+            if (HLL_SPARSE_IS_ZERO(p)) {
+                runlen = HLL_SPARSE_ZERO_LEN(p);
+                p++;
+                decoded = sdscatprintf(decoded,"z:%d ",runlen);
+            } else if (HLL_SPARSE_IS_XZERO(p)) {
+                runlen = HLL_SPARSE_XZERO_LEN(p);
+                p += 2;
+                decoded = sdscatprintf(decoded,"Z:%d ",runlen);
+            } else {
+                runlen = HLL_SPARSE_VAL_LEN(p);
+                regval = HLL_SPARSE_VAL_VALUE(p);
+                p++;
+                decoded = sdscatprintf(decoded,"v:%d,%d ",regval,runlen);
+            }
+        }
+        decoded = sdstrim(decoded," ");
+        addReplyBulkCBuffer(c,decoded,sdslen(decoded));
+        sdsfree(decoded);
+    }
+    /* PFDEBUG ENCODING <key> */
+    else if (!strcasecmp(cmd,"encoding")) {
+        char *encodingstr[2] = {"dense","sparse"};
+        if (c->argc != 3) goto arityerr;
+
+        addReplyStatus(c,encodingstr[hdr->encoding]);
+    }
+    /* PFDEBUG TODENSE <key> */
+    else if (!strcasecmp(cmd,"todense")) {
+        int conv = 0;
+        if (c->argc != 3) goto arityerr;
+
+        if (hdr->encoding == HLL_SPARSE) {
+            if (hllSparseToDense(o) == C_ERR) {
+                addReplyError(c,invalid_hll_err);
+                return;
+            }
+            conv = 1;
+            server.dirty++; /* Force propagation on encoding change. */
+        }
+        addReply(c,conv ? shared.cone : shared.czero);
+    } else {
+        addReplyErrorFormat(c,"Unknown PFDEBUG subcommand '%s'", cmd);
+    }
+    return;
+
+arityerr:
+    addReplyErrorFormat(c,
+        "Wrong number of arguments for the '%s' subcommand",cmd);
+}
+
diff --git a/redis-stable/src/intset.c b/redis-stable/src/intset.c
new file mode 100644
index 00000000..e3668513
--- /dev/null
+++ b/redis-stable/src/intset.c
@@ -0,0 +1,547 @@
+/*
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "intset.h"
+#include "zmalloc.h"
+#include "endianconv.h"
+#include "redisassert.h"
+
+/* Note that these encodings are ordered, so:
+ * INTSET_ENC_INT16 < INTSET_ENC_INT32 < INTSET_ENC_INT64. */
+#define INTSET_ENC_INT16 (sizeof(int16_t))
+#define INTSET_ENC_INT32 (sizeof(int32_t))
+#define INTSET_ENC_INT64 (sizeof(int64_t))
+
+/* Return the required encoding for the provided value. */
+static uint8_t _intsetValueEncoding(int64_t v) {
+    if (v < INT32_MIN || v > INT32_MAX)
+        return INTSET_ENC_INT64;
+    else if (v < INT16_MIN || v > INT16_MAX)
+        return INTSET_ENC_INT32;
+    else
+        return INTSET_ENC_INT16;
+}
+
+/* Return the value at pos, given an encoding. */
+static int64_t _intsetGetEncoded(intset *is, int pos, uint8_t enc) {
+    int64_t v64;
+    int32_t v32;
+    int16_t v16;
+
+    if (enc == INTSET_ENC_INT64) {
+        memcpy(&v64,((int64_t*)is->contents)+pos,sizeof(v64));
+        memrev64ifbe(&v64);
+        return v64;
+    } else if (enc == INTSET_ENC_INT32) {
+        memcpy(&v32,((int32_t*)is->contents)+pos,sizeof(v32));
+        memrev32ifbe(&v32);
+        return v32;
+    } else {
+        memcpy(&v16,((int16_t*)is->contents)+pos,sizeof(v16));
+        memrev16ifbe(&v16);
+        return v16;
+    }
+}
+
+/* Return the value at pos, using the configured encoding. */
+static int64_t _intsetGet(intset *is, int pos) {
+    return _intsetGetEncoded(is,pos,intrev32ifbe(is->encoding));
+}
+
+/* Set the value at pos, using the configured encoding. */
+static void _intsetSet(intset *is, int pos, int64_t value) {
+    uint32_t encoding = intrev32ifbe(is->encoding);
+
+    if (encoding == INTSET_ENC_INT64) {
+        ((int64_t*)is->contents)[pos] = value;
+        memrev64ifbe(((int64_t*)is->contents)+pos);
+    } else if (encoding == INTSET_ENC_INT32) {
+        ((int32_t*)is->contents)[pos] = value;
+        memrev32ifbe(((int32_t*)is->contents)+pos);
+    } else {
+        ((int16_t*)is->contents)[pos] = value;
+        memrev16ifbe(((int16_t*)is->contents)+pos);
+    }
+}
+
+/* Create an empty intset. */
+intset *intsetNew(void) {
+    intset *is = zmalloc(sizeof(intset));
+    is->encoding = intrev32ifbe(INTSET_ENC_INT16);
+    is->length = 0;
+    return is;
+}
+
+/* Resize the intset */
+static intset *intsetResize(intset *is, uint32_t len) {
+    uint64_t size = (uint64_t)len*intrev32ifbe(is->encoding);
+    assert(size <= SIZE_MAX - sizeof(intset));
+    is = zrealloc(is,sizeof(intset)+size);
+    return is;
+}
+
+/* Search for the position of "value". Return 1 when the value was found and
+ * sets "pos" to the position of the value within the intset. Return 0 when
+ * the value is not present in the intset and sets "pos" to the position
+ * where "value" can be inserted. */
+static uint8_t intsetSearch(intset *is, int64_t value, uint32_t *pos) {
+    int min = 0, max = intrev32ifbe(is->length)-1, mid = -1;
+    int64_t cur = -1;
+
+    /* The value can never be found when the set is empty */
+    if (intrev32ifbe(is->length) == 0) {
+        if (pos) *pos = 0;
+        return 0;
+    } else {
+        /* Check for the case where we know we cannot find the value,
+         * but do know the insert position. */
+        if (value > _intsetGet(is,max)) {
+            if (pos) *pos = intrev32ifbe(is->length);
+            return 0;
+        } else if (value < _intsetGet(is,0)) {
+            if (pos) *pos = 0;
+            return 0;
+        }
+    }
+
+    while(max >= min) {
+        mid = ((unsigned int)min + (unsigned int)max) >> 1;
+        cur = _intsetGet(is,mid);
+        if (value > cur) {
+            min = mid+1;
+        } else if (value < cur) {
+            max = mid-1;
+        } else {
+            break;
+        }
+    }
+
+    if (value == cur) {
+        if (pos) *pos = mid;
+        return 1;
+    } else {
+        if (pos) *pos = min;
+        return 0;
+    }
+}
+
+/* Upgrades the intset to a larger encoding and inserts the given integer. */
+static intset *intsetUpgradeAndAdd(intset *is, int64_t value) {
+    uint8_t curenc = intrev32ifbe(is->encoding);
+    uint8_t newenc = _intsetValueEncoding(value);
+    int length = intrev32ifbe(is->length);
+    int prepend = value < 0 ? 1 : 0;
+
+    /* First set new encoding and resize */
+    is->encoding = intrev32ifbe(newenc);
+    is = intsetResize(is,intrev32ifbe(is->length)+1);
+
+    /* Upgrade back-to-front so we don't overwrite values.
+     * Note that the "prepend" variable is used to make sure we have an empty
+     * space at either the beginning or the end of the intset. */
+    while(length--)
+        _intsetSet(is,length+prepend,_intsetGetEncoded(is,length,curenc));
+
+    /* Set the value at the beginning or the end. */
+    if (prepend)
+        _intsetSet(is,0,value);
+    else
+        _intsetSet(is,intrev32ifbe(is->length),value);
+    is->length = intrev32ifbe(intrev32ifbe(is->length)+1);
+    return is;
+}
+
+static void intsetMoveTail(intset *is, uint32_t from, uint32_t to) {
+    void *src, *dst;
+    uint32_t bytes = intrev32ifbe(is->length)-from;
+    uint32_t encoding = intrev32ifbe(is->encoding);
+
+    if (encoding == INTSET_ENC_INT64) {
+        src = (int64_t*)is->contents+from;
+        dst = (int64_t*)is->contents+to;
+        bytes *= sizeof(int64_t);
+    } else if (encoding == INTSET_ENC_INT32) {
+        src = (int32_t*)is->contents+from;
+        dst = (int32_t*)is->contents+to;
+        bytes *= sizeof(int32_t);
+    } else {
+        src = (int16_t*)is->contents+from;
+        dst = (int16_t*)is->contents+to;
+        bytes *= sizeof(int16_t);
+    }
+    memmove(dst,src,bytes);
+}
+
+/* Insert an integer in the intset */
+intset *intsetAdd(intset *is, int64_t value, uint8_t *success) {
+    uint8_t valenc = _intsetValueEncoding(value);
+    uint32_t pos;
+    if (success) *success = 1;
+
+    /* Upgrade encoding if necessary. If we need to upgrade, we know that
+     * this value should be either appended (if > 0) or prepended (if < 0),
+     * because it lies outside the range of existing values. */
+    if (valenc > intrev32ifbe(is->encoding)) {
+        /* This always succeeds, so we don't need to curry *success. */
+        return intsetUpgradeAndAdd(is,value);
+    } else {
+        /* Abort if the value is already present in the set.
+         * This call will populate "pos" with the right position to insert
+         * the value when it cannot be found. */
+        if (intsetSearch(is,value,&pos)) {
+            if (success) *success = 0;
+            return is;
+        }
+
+        is = intsetResize(is,intrev32ifbe(is->length)+1);
+        if (pos < intrev32ifbe(is->length)) intsetMoveTail(is,pos,pos+1);
+    }
+
+    _intsetSet(is,pos,value);
+    is->length = intrev32ifbe(intrev32ifbe(is->length)+1);
+    return is;
+}
+
+/* Delete integer from intset */
+intset *intsetRemove(intset *is, int64_t value, int *success) {
+    uint8_t valenc = _intsetValueEncoding(value);
+    uint32_t pos;
+    if (success) *success = 0;
+
+    if (valenc <= intrev32ifbe(is->encoding) && intsetSearch(is,value,&pos)) {
+        uint32_t len = intrev32ifbe(is->length);
+
+        /* We know we can delete */
+        if (success) *success = 1;
+
+        /* Overwrite value with tail and update length */
+        if (pos < (len-1)) intsetMoveTail(is,pos+1,pos);
+        is = intsetResize(is,len-1);
+        is->length = intrev32ifbe(len-1);
+    }
+    return is;
+}
+
+/* Determine whether a value belongs to this set */
+uint8_t intsetFind(intset *is, int64_t value) {
+    uint8_t valenc = _intsetValueEncoding(value);
+    return valenc <= intrev32ifbe(is->encoding) && intsetSearch(is,value,NULL);
+}
+
+/* Return random member */
+int64_t intsetRandom(intset *is) {
+    uint32_t len = intrev32ifbe(is->length);
+    assert(len); /* avoid division by zero on corrupt intset payload. */
+    return _intsetGet(is,rand()%len);
+}
+
+/* Get the value at the given position. When this position is
+ * out of range the function returns 0, when in range it returns 1. */
+uint8_t intsetGet(intset *is, uint32_t pos, int64_t *value) {
+    if (pos < intrev32ifbe(is->length)) {
+        *value = _intsetGet(is,pos);
+        return 1;
+    }
+    return 0;
+}
+
+/* Return intset length */
+uint32_t intsetLen(const intset *is) {
+    return intrev32ifbe(is->length);
+}
+
+/* Return intset blob size in bytes. */
+size_t intsetBlobLen(intset *is) {
+    return sizeof(intset)+(size_t)intrev32ifbe(is->length)*intrev32ifbe(is->encoding);
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we make sure there are no duplicate or out of order records. */
+int intsetValidateIntegrity(const unsigned char *p, size_t size, int deep) {
+    intset *is = (intset *)p;
+    /* check that we can actually read the header. */
+    if (size < sizeof(*is))
+        return 0;
+
+    uint32_t encoding = intrev32ifbe(is->encoding);
+
+    size_t record_size;
+    if (encoding == INTSET_ENC_INT64) {
+        record_size = INTSET_ENC_INT64;
+    } else if (encoding == INTSET_ENC_INT32) {
+        record_size = INTSET_ENC_INT32;
+    } else if (encoding == INTSET_ENC_INT16){
+        record_size = INTSET_ENC_INT16;
+    } else {
+        return 0;
+    }
+
+    /* check that the size matchies (all records are inside the buffer). */
+    uint32_t count = intrev32ifbe(is->length);
+    if (sizeof(*is) + count*record_size != size)
+        return 0;
+
+    /* check that the set is not empty. */
+    if (count==0)
+        return 0;
+
+    if (!deep)
+        return 1;
+
+    /* check that there are no dup or out of order records. */
+    int64_t prev = _intsetGet(is,0);
+    for (uint32_t i=1; i<count; i++) {
+        int64_t cur = _intsetGet(is,i);
+        if (cur <= prev)
+            return 0;
+        prev = cur;
+    }
+
+    return 1;
+}
+
+#ifdef REDIS_TEST
+#include <sys/time.h>
+#include <time.h>
+
+#if 0
+static void intsetRepr(intset *is) {
+    for (uint32_t i = 0; i < intrev32ifbe(is->length); i++) {
+        printf("%lld\n", (uint64_t)_intsetGet(is,i));
+    }
+    printf("\n");
+}
+
+static void error(char *err) {
+    printf("%s\n", err);
+    exit(1);
+}
+#endif
+
+static void ok(void) {
+    printf("OK\n");
+}
+
+static long long usec(void) {
+    struct timeval tv;
+    gettimeofday(&tv,NULL);
+    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
+}
+
+static intset *createSet(int bits, int size) {
+    uint64_t mask = (1<<bits)-1;
+    uint64_t value;
+    intset *is = intsetNew();
+
+    for (int i = 0; i < size; i++) {
+        if (bits > 32) {
+            value = (rand()*rand()) & mask;
+        } else {
+            value = rand() & mask;
+        }
+        is = intsetAdd(is,value,NULL);
+    }
+    return is;
+}
+
+static void checkConsistency(intset *is) {
+    for (uint32_t i = 0; i < (intrev32ifbe(is->length)-1); i++) {
+        uint32_t encoding = intrev32ifbe(is->encoding);
+
+        if (encoding == INTSET_ENC_INT16) {
+            int16_t *i16 = (int16_t*)is->contents;
+            assert(i16[i] < i16[i+1]);
+        } else if (encoding == INTSET_ENC_INT32) {
+            int32_t *i32 = (int32_t*)is->contents;
+            assert(i32[i] < i32[i+1]);
+        } else {
+            int64_t *i64 = (int64_t*)is->contents;
+            assert(i64[i] < i64[i+1]);
+        }
+    }
+}
+
+#define UNUSED(x) (void)(x)
+int intsetTest(int argc, char **argv, int accurate) {
+    uint8_t success;
+    int i;
+    intset *is;
+    srand(time(NULL));
+
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    printf("Value encodings: "); {
+        assert(_intsetValueEncoding(-32768) == INTSET_ENC_INT16);
+        assert(_intsetValueEncoding(+32767) == INTSET_ENC_INT16);
+        assert(_intsetValueEncoding(-32769) == INTSET_ENC_INT32);
+        assert(_intsetValueEncoding(+32768) == INTSET_ENC_INT32);
+        assert(_intsetValueEncoding(-2147483648) == INTSET_ENC_INT32);
+        assert(_intsetValueEncoding(+2147483647) == INTSET_ENC_INT32);
+        assert(_intsetValueEncoding(-2147483649) == INTSET_ENC_INT64);
+        assert(_intsetValueEncoding(+2147483648) == INTSET_ENC_INT64);
+        assert(_intsetValueEncoding(-9223372036854775808ull) ==
+                    INTSET_ENC_INT64);
+        assert(_intsetValueEncoding(+9223372036854775807ull) ==
+                    INTSET_ENC_INT64);
+        ok();
+    }
+
+    printf("Basic adding: "); {
+        is = intsetNew();
+        is = intsetAdd(is,5,&success); assert(success);
+        is = intsetAdd(is,6,&success); assert(success);
+        is = intsetAdd(is,4,&success); assert(success);
+        is = intsetAdd(is,4,&success); assert(!success);
+        ok();
+        zfree(is);
+    }
+
+    printf("Large number of random adds: "); {
+        uint32_t inserts = 0;
+        is = intsetNew();
+        for (i = 0; i < 1024; i++) {
+            is = intsetAdd(is,rand()%0x800,&success);
+            if (success) inserts++;
+        }
+        assert(intrev32ifbe(is->length) == inserts);
+        checkConsistency(is);
+        ok();
+        zfree(is);
+    }
+
+    printf("Upgrade from int16 to int32: "); {
+        is = intsetNew();
+        is = intsetAdd(is,32,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
+        is = intsetAdd(is,65535,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
+        assert(intsetFind(is,32));
+        assert(intsetFind(is,65535));
+        checkConsistency(is);
+        zfree(is);
+
+        is = intsetNew();
+        is = intsetAdd(is,32,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
+        is = intsetAdd(is,-65535,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
+        assert(intsetFind(is,32));
+        assert(intsetFind(is,-65535));
+        checkConsistency(is);
+        ok();
+        zfree(is);
+    }
+
+    printf("Upgrade from int16 to int64: "); {
+        is = intsetNew();
+        is = intsetAdd(is,32,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
+        is = intsetAdd(is,4294967295,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
+        assert(intsetFind(is,32));
+        assert(intsetFind(is,4294967295));
+        checkConsistency(is);
+        zfree(is);
+
+        is = intsetNew();
+        is = intsetAdd(is,32,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
+        is = intsetAdd(is,-4294967295,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
+        assert(intsetFind(is,32));
+        assert(intsetFind(is,-4294967295));
+        checkConsistency(is);
+        ok();
+        zfree(is);
+    }
+
+    printf("Upgrade from int32 to int64: "); {
+        is = intsetNew();
+        is = intsetAdd(is,65535,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
+        is = intsetAdd(is,4294967295,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
+        assert(intsetFind(is,65535));
+        assert(intsetFind(is,4294967295));
+        checkConsistency(is);
+        zfree(is);
+
+        is = intsetNew();
+        is = intsetAdd(is,65535,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
+        is = intsetAdd(is,-4294967295,NULL);
+        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
+        assert(intsetFind(is,65535));
+        assert(intsetFind(is,-4294967295));
+        checkConsistency(is);
+        ok();
+        zfree(is);
+    }
+
+    printf("Stress lookups: "); {
+        long num = 100000, size = 10000;
+        int i, bits = 20;
+        long long start;
+        is = createSet(bits,size);
+        checkConsistency(is);
+
+        start = usec();
+        for (i = 0; i < num; i++) intsetSearch(is,rand() % ((1<<bits)-1),NULL);
+        printf("%ld lookups, %ld element set, %lldusec\n",
+               num,size,usec()-start);
+        zfree(is);
+    }
+
+    printf("Stress add+delete: "); {
+        int i, v1, v2;
+        is = intsetNew();
+        for (i = 0; i < 0xffff; i++) {
+            v1 = rand() % 0xfff;
+            is = intsetAdd(is,v1,NULL);
+            assert(intsetFind(is,v1));
+
+            v2 = rand() % 0xfff;
+            is = intsetRemove(is,v2,NULL);
+            assert(!intsetFind(is,v2));
+        }
+        checkConsistency(is);
+        ok();
+        zfree(is);
+    }
+
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/intset.h b/redis-stable/src/intset.h
new file mode 100644
index 00000000..22ea5feb
--- /dev/null
+++ b/redis-stable/src/intset.h
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __INTSET_H
+#define __INTSET_H
+#include <stdint.h>
+
+typedef struct intset {
+    uint32_t encoding;
+    uint32_t length;
+    int8_t contents[];
+} intset;
+
+intset *intsetNew(void);
+intset *intsetAdd(intset *is, int64_t value, uint8_t *success);
+intset *intsetRemove(intset *is, int64_t value, int *success);
+uint8_t intsetFind(intset *is, int64_t value);
+int64_t intsetRandom(intset *is);
+uint8_t intsetGet(intset *is, uint32_t pos, int64_t *value);
+uint32_t intsetLen(const intset *is);
+size_t intsetBlobLen(intset *is);
+int intsetValidateIntegrity(const unsigned char *is, size_t size, int deep);
+
+#ifdef REDIS_TEST
+int intsetTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif // __INTSET_H
diff --git a/redis-stable/src/latency.c b/redis-stable/src/latency.c
new file mode 100644
index 00000000..a5dfc5a7
--- /dev/null
+++ b/redis-stable/src/latency.c
@@ -0,0 +1,658 @@
+/* The latency monitor allows to easily observe the sources of latency
+ * in a Redis instance using the LATENCY command. Different latency
+ * sources are monitored, like disk I/O, execution of commands, fork
+ * system call, and so forth.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* Dictionary type for latency events. */
+int dictStringKeyCompare(void *privdata, const void *key1, const void *key2) {
+    UNUSED(privdata);
+    return strcmp(key1,key2) == 0;
+}
+
+uint64_t dictStringHash(const void *key) {
+    return dictGenHashFunction(key, strlen(key));
+}
+
+void dictVanillaFree(void *privdata, void *val);
+
+dictType latencyTimeSeriesDictType = {
+    dictStringHash,             /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictStringKeyCompare,       /* key compare */
+    dictVanillaFree,            /* key destructor */
+    dictVanillaFree,            /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* ------------------------- Utility functions ------------------------------ */
+
+#ifdef __linux__
+#include <sys/prctl.h>
+/* Returns 1 if Transparent Huge Pages support is enabled in the kernel.
+ * Otherwise (or if we are unable to check) 0 is returned. */
+int THPIsEnabled(void) {
+    char buf[1024];
+
+    FILE *fp = fopen("/sys/kernel/mm/transparent_hugepage/enabled","r");
+    if (!fp) return 0;
+    if (fgets(buf,sizeof(buf),fp) == NULL) {
+        fclose(fp);
+        return 0;
+    }
+    fclose(fp);
+    return (strstr(buf,"[always]") != NULL) ? 1 : 0;
+}
+
+/* since linux-3.5, kernel supports to set the state of the "THP disable" flag
+ * for the calling thread. PR_SET_THP_DISABLE is defined in linux/prctl.h */
+int THPDisable(void) {
+    int ret = -EINVAL;
+
+    if (!server.disable_thp)
+        return ret;
+
+#ifdef PR_SET_THP_DISABLE
+    ret = prctl(PR_SET_THP_DISABLE, 1, 0, 0, 0);
+#endif
+
+    return ret;
+}
+#endif
+
+/* Report the amount of AnonHugePages in smap, in bytes. If the return
+ * value of the function is non-zero, the process is being targeted by
+ * THP support, and is likely to have memory usage / latency issues. */
+int THPGetAnonHugePagesSize(void) {
+    return zmalloc_get_smap_bytes_by_field("AnonHugePages:",-1);
+}
+
+/* ---------------------------- Latency API --------------------------------- */
+
+/* Latency monitor initialization. We just need to create the dictionary
+ * of time series, each time series is created on demand in order to avoid
+ * having a fixed list to maintain. */
+void latencyMonitorInit(void) {
+    server.latency_events = dictCreate(&latencyTimeSeriesDictType,NULL);
+}
+
+/* Add the specified sample to the specified time series "event".
+ * This function is usually called via latencyAddSampleIfNeeded(), that
+ * is a macro that only adds the sample if the latency is higher than
+ * server.latency_monitor_threshold. */
+void latencyAddSample(const char *event, mstime_t latency) {
+    struct latencyTimeSeries *ts = dictFetchValue(server.latency_events,event);
+    time_t now = time(NULL);
+    int prev;
+
+    /* Create the time series if it does not exist. */
+    if (ts == NULL) {
+        ts = zmalloc(sizeof(*ts));
+        ts->idx = 0;
+        ts->max = 0;
+        memset(ts->samples,0,sizeof(ts->samples));
+        dictAdd(server.latency_events,zstrdup(event),ts);
+    }
+
+    if (latency > ts->max) ts->max = latency;
+
+    /* If the previous sample is in the same second, we update our old sample
+     * if this latency is > of the old one, or just return. */
+    prev = (ts->idx + LATENCY_TS_LEN - 1) % LATENCY_TS_LEN;
+    if (ts->samples[prev].time == now) {
+        if (latency > ts->samples[prev].latency)
+            ts->samples[prev].latency = latency;
+        return;
+    }
+
+    ts->samples[ts->idx].time = time(NULL);
+    ts->samples[ts->idx].latency = latency;
+
+    ts->idx++;
+    if (ts->idx == LATENCY_TS_LEN) ts->idx = 0;
+}
+
+/* Reset data for the specified event, or all the events data if 'event' is
+ * NULL.
+ *
+ * Note: this is O(N) even when event_to_reset is not NULL because makes
+ * the code simpler and we have a small fixed max number of events. */
+int latencyResetEvent(char *event_to_reset) {
+    dictIterator *di;
+    dictEntry *de;
+    int resets = 0;
+
+    di = dictGetSafeIterator(server.latency_events);
+    while((de = dictNext(di)) != NULL) {
+        char *event = dictGetKey(de);
+
+        if (event_to_reset == NULL || strcasecmp(event,event_to_reset) == 0) {
+            dictDelete(server.latency_events, event);
+            resets++;
+        }
+    }
+    dictReleaseIterator(di);
+    return resets;
+}
+
+/* ------------------------ Latency reporting (doctor) ---------------------- */
+
+/* Analyze the samples available for a given event and return a structure
+ * populate with different metrics, average, MAD, min, max, and so forth.
+ * Check latency.h definition of struct latencyStats for more info.
+ * If the specified event has no elements the structure is populate with
+ * zero values. */
+void analyzeLatencyForEvent(char *event, struct latencyStats *ls) {
+    struct latencyTimeSeries *ts = dictFetchValue(server.latency_events,event);
+    int j;
+    uint64_t sum;
+
+    ls->all_time_high = ts ? ts->max : 0;
+    ls->avg = 0;
+    ls->min = 0;
+    ls->max = 0;
+    ls->mad = 0;
+    ls->samples = 0;
+    ls->period = 0;
+    if (!ts) return;
+
+    /* First pass, populate everything but the MAD. */
+    sum = 0;
+    for (j = 0; j < LATENCY_TS_LEN; j++) {
+        if (ts->samples[j].time == 0) continue;
+        ls->samples++;
+        if (ls->samples == 1) {
+            ls->min = ls->max = ts->samples[j].latency;
+        } else {
+            if (ls->min > ts->samples[j].latency)
+                ls->min = ts->samples[j].latency;
+            if (ls->max < ts->samples[j].latency)
+                ls->max = ts->samples[j].latency;
+        }
+        sum += ts->samples[j].latency;
+
+        /* Track the oldest event time in ls->period. */
+        if (ls->period == 0 || ts->samples[j].time < ls->period)
+            ls->period = ts->samples[j].time;
+    }
+
+    /* So far avg is actually the sum of the latencies, and period is
+     * the oldest event time. We need to make the first an average and
+     * the second a range of seconds. */
+    if (ls->samples) {
+        ls->avg = sum / ls->samples;
+        ls->period = time(NULL) - ls->period;
+        if (ls->period == 0) ls->period = 1;
+    }
+
+    /* Second pass, compute MAD. */
+    sum = 0;
+    for (j = 0; j < LATENCY_TS_LEN; j++) {
+        int64_t delta;
+
+        if (ts->samples[j].time == 0) continue;
+        delta = (int64_t)ls->avg - ts->samples[j].latency;
+        if (delta < 0) delta = -delta;
+        sum += delta;
+    }
+    if (ls->samples) ls->mad = sum / ls->samples;
+}
+
+/* Create a human readable report of latency events for this Redis instance. */
+sds createLatencyReport(void) {
+    sds report = sdsempty();
+    int advise_better_vm = 0;       /* Better virtual machines. */
+    int advise_slowlog_enabled = 0; /* Enable slowlog. */
+    int advise_slowlog_tuning = 0;  /* Reconfigure slowlog. */
+    int advise_slowlog_inspect = 0; /* Check your slowlog. */
+    int advise_disk_contention = 0; /* Try to lower disk contention. */
+    int advise_scheduler = 0;       /* Intrinsic latency. */
+    int advise_data_writeback = 0;  /* data=writeback. */
+    int advise_no_appendfsync = 0;  /* don't fsync during rewrites. */
+    int advise_local_disk = 0;      /* Avoid remote disks. */
+    int advise_ssd = 0;             /* Use an SSD drive. */
+    int advise_write_load_info = 0; /* Print info about AOF and write load. */
+    int advise_hz = 0;              /* Use higher HZ. */
+    int advise_large_objects = 0;   /* Deletion of large objects. */
+    int advise_mass_eviction = 0;   /* Avoid mass eviction of keys. */
+    int advise_relax_fsync_policy = 0; /* appendfsync always is slow. */
+    int advise_disable_thp = 0;     /* AnonHugePages detected. */
+    int advices = 0;
+
+    /* Return ASAP if the latency engine is disabled and it looks like it
+     * was never enabled so far. */
+    if (dictSize(server.latency_events) == 0 &&
+        server.latency_monitor_threshold == 0)
+    {
+        report = sdscat(report,"I'm sorry, Dave, I can't do that. Latency monitoring is disabled in this Redis instance. You may use \"CONFIG SET latency-monitor-threshold <milliseconds>.\" in order to enable it. If we weren't in a deep space mission I'd suggest to take a look at https://redis.io/topics/latency-monitor.\n");
+        return report;
+    }
+
+    /* Show all the events stats and add for each event some event-related
+     * comment depending on the values. */
+    dictIterator *di;
+    dictEntry *de;
+    int eventnum = 0;
+
+    di = dictGetSafeIterator(server.latency_events);
+    while((de = dictNext(di)) != NULL) {
+        char *event = dictGetKey(de);
+        struct latencyTimeSeries *ts = dictGetVal(de);
+        struct latencyStats ls;
+
+        if (ts == NULL) continue;
+        eventnum++;
+        if (eventnum == 1) {
+            report = sdscat(report,"Dave, I have observed latency spikes in this Redis instance. You don't mind talking about it, do you Dave?\n\n");
+        }
+        analyzeLatencyForEvent(event,&ls);
+
+        report = sdscatprintf(report,
+            "%d. %s: %d latency spikes (average %lums, mean deviation %lums, period %.2f sec). Worst all time event %lums.",
+            eventnum, event,
+            ls.samples,
+            (unsigned long) ls.avg,
+            (unsigned long) ls.mad,
+            (double) ls.period/ls.samples,
+            (unsigned long) ts->max);
+
+        /* Fork */
+        if (!strcasecmp(event,"fork")) {
+            char *fork_quality;
+            if (server.stat_fork_rate < 10) {
+                fork_quality = "terrible";
+                advise_better_vm = 1;
+                advices++;
+            } else if (server.stat_fork_rate < 25) {
+                fork_quality = "poor";
+                advise_better_vm = 1;
+                advices++;
+            } else if (server.stat_fork_rate < 100) {
+                fork_quality = "good";
+            } else {
+                fork_quality = "excellent";
+            }
+            report = sdscatprintf(report,
+                " Fork rate is %.2f GB/sec (%s).", server.stat_fork_rate,
+                fork_quality);
+        }
+
+        /* Potentially commands. */
+        if (!strcasecmp(event,"command")) {
+            if (server.slowlog_log_slower_than < 0) {
+                advise_slowlog_enabled = 1;
+                advices++;
+            } else if (server.slowlog_log_slower_than/1000 >
+                       server.latency_monitor_threshold)
+            {
+                advise_slowlog_tuning = 1;
+                advices++;
+            }
+            advise_slowlog_inspect = 1;
+            advise_large_objects = 1;
+            advices += 2;
+        }
+
+        /* fast-command. */
+        if (!strcasecmp(event,"fast-command")) {
+            advise_scheduler = 1;
+            advices++;
+        }
+
+        /* AOF and I/O. */
+        if (!strcasecmp(event,"aof-write-pending-fsync")) {
+            advise_local_disk = 1;
+            advise_disk_contention = 1;
+            advise_ssd = 1;
+            advise_data_writeback = 1;
+            advices += 4;
+        }
+
+        if (!strcasecmp(event,"aof-write-active-child")) {
+            advise_no_appendfsync = 1;
+            advise_data_writeback = 1;
+            advise_ssd = 1;
+            advices += 3;
+        }
+
+        if (!strcasecmp(event,"aof-write-alone")) {
+            advise_local_disk = 1;
+            advise_data_writeback = 1;
+            advise_ssd = 1;
+            advices += 3;
+        }
+
+        if (!strcasecmp(event,"aof-fsync-always")) {
+            advise_relax_fsync_policy = 1;
+            advices++;
+        }
+
+        if (!strcasecmp(event,"aof-fstat") ||
+            !strcasecmp(event,"rdb-unlink-temp-file")) {
+            advise_disk_contention = 1;
+            advise_local_disk = 1;
+            advices += 2;
+        }
+
+        if (!strcasecmp(event,"aof-rewrite-diff-write") ||
+            !strcasecmp(event,"aof-rename")) {
+            advise_write_load_info = 1;
+            advise_data_writeback = 1;
+            advise_ssd = 1;
+            advise_local_disk = 1;
+            advices += 4;
+        }
+
+        /* Expire cycle. */
+        if (!strcasecmp(event,"expire-cycle")) {
+            advise_hz = 1;
+            advise_large_objects = 1;
+            advices += 2;
+        }
+
+        /* Eviction cycle. */
+        if (!strcasecmp(event,"eviction-del")) {
+            advise_large_objects = 1;
+            advices++;
+        }
+
+        if (!strcasecmp(event,"eviction-cycle")) {
+            advise_mass_eviction = 1;
+            advices++;
+        }
+
+        report = sdscatlen(report,"\n",1);
+    }
+    dictReleaseIterator(di);
+
+    /* Add non event based advices. */
+    if (THPGetAnonHugePagesSize() > 0) {
+        advise_disable_thp = 1;
+        advices++;
+    }
+
+    if (eventnum == 0 && advices == 0) {
+        report = sdscat(report,"Dave, no latency spike was observed during the lifetime of this Redis instance, not in the slightest bit. I honestly think you ought to sit down calmly, take a stress pill, and think things over.\n");
+    } else if (eventnum > 0 && advices == 0) {
+        report = sdscat(report,"\nWhile there are latency events logged, I'm not able to suggest any easy fix. Please use the Redis community to get some help, providing this report in your help request.\n");
+    } else {
+        /* Add all the suggestions accumulated so far. */
+
+        /* Better VM. */
+        report = sdscat(report,"\nI have a few advices for you:\n\n");
+        if (advise_better_vm) {
+            report = sdscat(report,"- If you are using a virtual machine, consider upgrading it with a faster one using a hypervisior that provides less latency during fork() calls. Xen is known to have poor fork() performance. Even in the context of the same VM provider, certain kinds of instances can execute fork faster than others.\n");
+        }
+
+        /* Slow log. */
+        if (advise_slowlog_enabled) {
+            report = sdscatprintf(report,"- There are latency issues with potentially slow commands you are using. Try to enable the Slow Log Redis feature using the command 'CONFIG SET slowlog-log-slower-than %llu'. If the Slow log is disabled Redis is not able to log slow commands execution for you.\n", (unsigned long long)server.latency_monitor_threshold*1000);
+        }
+
+        if (advise_slowlog_tuning) {
+            report = sdscatprintf(report,"- Your current Slow Log configuration only logs events that are slower than your configured latency monitor threshold. Please use 'CONFIG SET slowlog-log-slower-than %llu'.\n", (unsigned long long)server.latency_monitor_threshold*1000);
+        }
+
+        if (advise_slowlog_inspect) {
+            report = sdscat(report,"- Check your Slow Log to understand what are the commands you are running which are too slow to execute. Please check https://redis.io/commands/slowlog for more information.\n");
+        }
+
+        /* Intrinsic latency. */
+        if (advise_scheduler) {
+            report = sdscat(report,"- The system is slow to execute Redis code paths not containing system calls. This usually means the system does not provide Redis CPU time to run for long periods. You should try to:\n"
+            "  1) Lower the system load.\n"
+            "  2) Use a computer / VM just for Redis if you are running other software in the same system.\n"
+            "  3) Check if you have a \"noisy neighbour\" problem.\n"
+            "  4) Check with 'redis-cli --intrinsic-latency 100' what is the intrinsic latency in your system.\n"
+            "  5) Check if the problem is allocator-related by recompiling Redis with MALLOC=libc, if you are using Jemalloc. However this may create fragmentation problems.\n");
+        }
+
+        /* AOF / Disk latency. */
+        if (advise_local_disk) {
+            report = sdscat(report,"- It is strongly advised to use local disks for persistence, especially if you are using AOF. Remote disks provided by platform-as-a-service providers are known to be slow.\n");
+        }
+
+        if (advise_ssd) {
+            report = sdscat(report,"- SSD disks are able to reduce fsync latency, and total time needed for snapshotting and AOF log rewriting (resulting in smaller memory usage and smaller final AOF rewrite buffer flushes). With extremely high write load SSD disks can be a good option. However Redis should perform reasonably with high load using normal disks. Use this advice as a last resort.\n");
+        }
+
+        if (advise_data_writeback) {
+            report = sdscat(report,"- Mounting ext3/4 filesystems with data=writeback can provide a performance boost compared to data=ordered, however this mode of operation provides less guarantees, and sometimes it can happen that after a hard crash the AOF file will have a half-written command at the end and will require to be repaired before Redis restarts.\n");
+        }
+
+        if (advise_disk_contention) {
+            report = sdscat(report,"- Try to lower the disk contention. This is often caused by other disk intensive processes running in the same computer (including other Redis instances).\n");
+        }
+
+        if (advise_no_appendfsync) {
+            report = sdscat(report,"- Assuming from the point of view of data safety this is viable in your environment, you could try to enable the 'no-appendfsync-on-rewrite' option, so that fsync will not be performed while there is a child rewriting the AOF file or producing an RDB file (the moment where there is high disk contention).\n");
+        }
+
+        if (advise_relax_fsync_policy && server.aof_fsync == AOF_FSYNC_ALWAYS) {
+            report = sdscat(report,"- Your fsync policy is set to 'always'. It is very hard to get good performances with such a setup, if possible try to relax the fsync policy to 'onesec'.\n");
+        }
+
+        if (advise_write_load_info) {
+            report = sdscat(report,"- Latency during the AOF atomic rename operation or when the final difference is flushed to the AOF file at the end of the rewrite, sometimes is caused by very high write load, causing the AOF buffer to get very large. If possible try to send less commands to accomplish the same work, or use Lua scripts to group multiple operations into a single EVALSHA call.\n");
+        }
+
+        if (advise_hz && server.hz < 100) {
+            report = sdscat(report,"- In order to make the Redis keys expiring process more incremental, try to set the 'hz' configuration parameter to 100 using 'CONFIG SET hz 100'.\n");
+        }
+
+        if (advise_large_objects) {
+            report = sdscat(report,"- Deleting, expiring or evicting (because of maxmemory policy) large objects is a blocking operation. If you have very large objects that are often deleted, expired, or evicted, try to fragment those objects into multiple smaller objects.\n");
+        }
+
+        if (advise_mass_eviction) {
+            report = sdscat(report,"- Sudden changes to the 'maxmemory' setting via 'CONFIG SET', or allocation of large objects via sets or sorted sets intersections, STORE option of SORT, Redis Cluster large keys migrations (RESTORE command), may create sudden memory pressure forcing the server to block trying to evict keys. \n");
+        }
+
+        if (advise_disable_thp) {
+            report = sdscat(report,"- I detected a non zero amount of anonymous huge pages used by your process. This creates very serious latency events in different conditions, especially when Redis is persisting on disk. To disable THP support use the command 'echo never > /sys/kernel/mm/transparent_hugepage/enabled', make sure to also add it into /etc/rc.local so that the command will be executed again after a reboot. Note that even if you have already disabled THP, you still need to restart the Redis process to get rid of the huge pages already created.\n");
+        }
+    }
+
+    return report;
+}
+
+/* ---------------------- Latency command implementation -------------------- */
+
+/* latencyCommand() helper to produce a time-delay reply for all the samples
+ * in memory for the specified time series. */
+void latencyCommandReplyWithSamples(client *c, struct latencyTimeSeries *ts) {
+    void *replylen = addReplyDeferredLen(c);
+    int samples = 0, j;
+
+    for (j = 0; j < LATENCY_TS_LEN; j++) {
+        int i = (ts->idx + j) % LATENCY_TS_LEN;
+
+        if (ts->samples[i].time == 0) continue;
+        addReplyArrayLen(c,2);
+        addReplyLongLong(c,ts->samples[i].time);
+        addReplyLongLong(c,ts->samples[i].latency);
+        samples++;
+    }
+    setDeferredArrayLen(c,replylen,samples);
+}
+
+/* latencyCommand() helper to produce the reply for the LATEST subcommand,
+ * listing the last latency sample for every event type registered so far. */
+void latencyCommandReplyWithLatestEvents(client *c) {
+    dictIterator *di;
+    dictEntry *de;
+
+    addReplyArrayLen(c,dictSize(server.latency_events));
+    di = dictGetIterator(server.latency_events);
+    while((de = dictNext(di)) != NULL) {
+        char *event = dictGetKey(de);
+        struct latencyTimeSeries *ts = dictGetVal(de);
+        int last = (ts->idx + LATENCY_TS_LEN - 1) % LATENCY_TS_LEN;
+
+        addReplyArrayLen(c,4);
+        addReplyBulkCString(c,event);
+        addReplyLongLong(c,ts->samples[last].time);
+        addReplyLongLong(c,ts->samples[last].latency);
+        addReplyLongLong(c,ts->max);
+    }
+    dictReleaseIterator(di);
+}
+
+#define LATENCY_GRAPH_COLS 80
+sds latencyCommandGenSparkeline(char *event, struct latencyTimeSeries *ts) {
+    int j;
+    struct sequence *seq = createSparklineSequence();
+    sds graph = sdsempty();
+    uint32_t min = 0, max = 0;
+
+    for (j = 0; j < LATENCY_TS_LEN; j++) {
+        int i = (ts->idx + j) % LATENCY_TS_LEN;
+        int elapsed;
+        char buf[64];
+
+        if (ts->samples[i].time == 0) continue;
+        /* Update min and max. */
+        if (seq->length == 0) {
+            min = max = ts->samples[i].latency;
+        } else {
+            if (ts->samples[i].latency > max) max = ts->samples[i].latency;
+            if (ts->samples[i].latency < min) min = ts->samples[i].latency;
+        }
+        /* Use as label the number of seconds / minutes / hours / days
+         * ago the event happened. */
+        elapsed = time(NULL) - ts->samples[i].time;
+        if (elapsed < 60)
+            snprintf(buf,sizeof(buf),"%ds",elapsed);
+        else if (elapsed < 3600)
+            snprintf(buf,sizeof(buf),"%dm",elapsed/60);
+        else if (elapsed < 3600*24)
+            snprintf(buf,sizeof(buf),"%dh",elapsed/3600);
+        else
+            snprintf(buf,sizeof(buf),"%dd",elapsed/(3600*24));
+        sparklineSequenceAddSample(seq,ts->samples[i].latency,buf);
+    }
+
+    graph = sdscatprintf(graph,
+        "%s - high %lu ms, low %lu ms (all time high %lu ms)\n", event,
+        (unsigned long) max, (unsigned long) min, (unsigned long) ts->max);
+    for (j = 0; j < LATENCY_GRAPH_COLS; j++)
+        graph = sdscatlen(graph,"-",1);
+    graph = sdscatlen(graph,"\n",1);
+    graph = sparklineRender(graph,seq,LATENCY_GRAPH_COLS,4,SPARKLINE_FILL);
+    freeSparklineSequence(seq);
+    return graph;
+}
+
+/* LATENCY command implementations.
+ *
+ * LATENCY HISTORY: return time-latency samples for the specified event.
+ * LATENCY LATEST: return the latest latency for all the events classes.
+ * LATENCY DOCTOR: returns a human readable analysis of instance latency.
+ * LATENCY GRAPH: provide an ASCII graph of the latency of the specified event.
+ * LATENCY RESET: reset data of a specified event or all the data if no event provided.
+ */
+void latencyCommand(client *c) {
+    struct latencyTimeSeries *ts;
+
+    if (!strcasecmp(c->argv[1]->ptr,"history") && c->argc == 3) {
+        /* LATENCY HISTORY <event> */
+        ts = dictFetchValue(server.latency_events,c->argv[2]->ptr);
+        if (ts == NULL) {
+            addReplyArrayLen(c,0);
+        } else {
+            latencyCommandReplyWithSamples(c,ts);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"graph") && c->argc == 3) {
+        /* LATENCY GRAPH <event> */
+        sds graph;
+        dictEntry *de;
+        char *event;
+
+        de = dictFind(server.latency_events,c->argv[2]->ptr);
+        if (de == NULL) goto nodataerr;
+        ts = dictGetVal(de);
+        event = dictGetKey(de);
+
+        graph = latencyCommandGenSparkeline(event,ts);
+        addReplyVerbatim(c,graph,sdslen(graph),"txt");
+        sdsfree(graph);
+    } else if (!strcasecmp(c->argv[1]->ptr,"latest") && c->argc == 2) {
+        /* LATENCY LATEST */
+        latencyCommandReplyWithLatestEvents(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"doctor") && c->argc == 2) {
+        /* LATENCY DOCTOR */
+        sds report = createLatencyReport();
+
+        addReplyVerbatim(c,report,sdslen(report),"txt");
+        sdsfree(report);
+    } else if (!strcasecmp(c->argv[1]->ptr,"reset") && c->argc >= 2) {
+        /* LATENCY RESET */
+        if (c->argc == 2) {
+            addReplyLongLong(c,latencyResetEvent(NULL));
+        } else {
+            int j, resets = 0;
+
+            for (j = 2; j < c->argc; j++)
+                resets += latencyResetEvent(c->argv[j]->ptr);
+            addReplyLongLong(c,resets);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"help") && c->argc == 2) {
+        const char *help[] = {
+"DOCTOR",
+"    Return a human readable latency analysis report.",
+"GRAPH <event>",
+"    Return an ASCII latency graph for the <event> class.",
+"HISTORY <event>",
+"    Return time-latency samples for the <event> class.",
+"LATEST",
+"    Return the latest latency samples for all events.",
+"RESET [<event> ...]",
+"    Reset latency data of one or more <event> classes.",
+"    (default: reset all data for all event classes)",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+    return;
+
+nodataerr:
+    /* Common error when the user asks for an event we have no latency
+     * information about. */
+    addReplyErrorFormat(c,
+        "No samples available for event '%s'", (char*) c->argv[2]->ptr);
+}
+
diff --git a/redis-stable/src/latency.h b/redis-stable/src/latency.h
new file mode 100644
index 00000000..b17f403a
--- /dev/null
+++ b/redis-stable/src/latency.h
@@ -0,0 +1,94 @@
+/* latency.h -- latency monitor API header file
+ * See latency.c for more information.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __LATENCY_H
+#define __LATENCY_H
+
+#define LATENCY_TS_LEN 160 /* History length for every monitored event. */
+
+/* Representation of a latency sample: the sampling time and the latency
+ * observed in milliseconds. */
+struct latencySample {
+    int32_t time; /* We don't use time_t to force 4 bytes usage everywhere. */
+    uint32_t latency; /* Latency in milliseconds. */
+};
+
+/* The latency time series for a given event. */
+struct latencyTimeSeries {
+    int idx; /* Index of the next sample to store. */
+    uint32_t max; /* Max latency observed for this event. */
+    struct latencySample samples[LATENCY_TS_LEN]; /* Latest history. */
+};
+
+/* Latency statistics structure. */
+struct latencyStats {
+    uint32_t all_time_high; /* Absolute max observed since latest reset. */
+    uint32_t avg;           /* Average of current samples. */
+    uint32_t min;           /* Min of current samples. */
+    uint32_t max;           /* Max of current samples. */
+    uint32_t mad;           /* Mean absolute deviation. */
+    uint32_t samples;       /* Number of non-zero samples. */
+    time_t period;          /* Number of seconds since first event and now. */
+};
+
+void latencyMonitorInit(void);
+void latencyAddSample(const char *event, mstime_t latency);
+int THPIsEnabled(void);
+int THPDisable(void);
+
+/* Latency monitoring macros. */
+
+/* Start monitoring an event. We just set the current time. */
+#define latencyStartMonitor(var) if (server.latency_monitor_threshold) { \
+    var = mstime(); \
+} else { \
+    var = 0; \
+}
+
+/* End monitoring an event, compute the difference with the current time
+ * to check the amount of time elapsed. */
+#define latencyEndMonitor(var) if (server.latency_monitor_threshold) { \
+    var = mstime() - var; \
+}
+
+/* Add the sample only if the elapsed time is >= to the configured threshold. */
+#define latencyAddSampleIfNeeded(event,var) \
+    if (server.latency_monitor_threshold && \
+        (var) >= server.latency_monitor_threshold) \
+          latencyAddSample((event),(var));
+
+/* Remove time from a nested event. */
+#define latencyRemoveNestedEvent(event_var,nested_var) \
+    event_var += nested_var;
+
+#endif /* __LATENCY_H */
diff --git a/redis-stable/src/lazyfree.c b/redis-stable/src/lazyfree.c
new file mode 100644
index 00000000..180a4349
--- /dev/null
+++ b/redis-stable/src/lazyfree.c
@@ -0,0 +1,231 @@
+#include "server.h"
+#include "bio.h"
+#include "atomicvar.h"
+#include "cluster.h"
+
+static redisAtomic size_t lazyfree_objects = 0;
+static redisAtomic size_t lazyfreed_objects = 0;
+
+/* Release objects from the lazyfree thread. It's just decrRefCount()
+ * updating the count of objects to release. */
+void lazyfreeFreeObject(void *args[]) {
+    robj *o = (robj *) args[0];
+    decrRefCount(o);
+    atomicDecr(lazyfree_objects,1);
+    atomicIncr(lazyfreed_objects,1);
+}
+
+/* Release a database from the lazyfree thread. The 'db' pointer is the
+ * database which was substituted with a fresh one in the main thread
+ * when the database was logically deleted. */
+void lazyfreeFreeDatabase(void *args[]) {
+    dict *ht1 = (dict *) args[0];
+    dict *ht2 = (dict *) args[1];
+
+    size_t numkeys = dictSize(ht1);
+    dictRelease(ht1);
+    dictRelease(ht2);
+    atomicDecr(lazyfree_objects,numkeys);
+    atomicIncr(lazyfreed_objects,numkeys);
+}
+
+/* Release the skiplist mapping Redis Cluster keys to slots in the
+ * lazyfree thread. */
+void lazyfreeFreeSlotsMap(void *args[]) {
+    rax *rt = args[0];
+    size_t len = rt->numele;
+    raxFree(rt);
+    atomicDecr(lazyfree_objects,len);
+    atomicIncr(lazyfreed_objects,len);
+}
+
+/* Release the key tracking table. */
+void lazyFreeTrackingTable(void *args[]) {
+    rax *rt = args[0];
+    size_t len = rt->numele;
+    freeTrackingRadixTree(rt);
+    atomicDecr(lazyfree_objects,len);
+    atomicIncr(lazyfreed_objects,len);
+}
+
+void lazyFreeLuaScripts(void *args[]) {
+    dict *lua_scripts = args[0];
+    long long len = dictSize(lua_scripts);
+    dictRelease(lua_scripts);
+    atomicDecr(lazyfree_objects,len);
+    atomicIncr(lazyfreed_objects,len);
+}
+
+/* Return the number of currently pending objects to free. */
+size_t lazyfreeGetPendingObjectsCount(void) {
+    size_t aux;
+    atomicGet(lazyfree_objects,aux);
+    return aux;
+}
+
+/* Return the number of objects that have been freed. */
+size_t lazyfreeGetFreedObjectsCount(void) {
+    size_t aux;
+    atomicGet(lazyfreed_objects,aux);
+    return aux;
+}
+
+/* Return the amount of work needed in order to free an object.
+ * The return value is not always the actual number of allocations the
+ * object is composed of, but a number proportional to it.
+ *
+ * For strings the function always returns 1.
+ *
+ * For aggregated objects represented by hash tables or other data structures
+ * the function just returns the number of elements the object is composed of.
+ *
+ * Objects composed of single allocations are always reported as having a
+ * single item even if they are actually logical composed of multiple
+ * elements.
+ *
+ * For lists the function returns the number of elements in the quicklist
+ * representing the list. */
+size_t lazyfreeGetFreeEffort(robj *key, robj *obj) {
+    if (obj->type == OBJ_LIST) {
+        quicklist *ql = obj->ptr;
+        return ql->len;
+    } else if (obj->type == OBJ_SET && obj->encoding == OBJ_ENCODING_HT) {
+        dict *ht = obj->ptr;
+        return dictSize(ht);
+    } else if (obj->type == OBJ_ZSET && obj->encoding == OBJ_ENCODING_SKIPLIST){
+        zset *zs = obj->ptr;
+        return zs->zsl->length;
+    } else if (obj->type == OBJ_HASH && obj->encoding == OBJ_ENCODING_HT) {
+        dict *ht = obj->ptr;
+        return dictSize(ht);
+    } else if (obj->type == OBJ_STREAM) {
+        size_t effort = 0;
+        stream *s = obj->ptr;
+
+        /* Make a best effort estimate to maintain constant runtime. Every macro
+         * node in the Stream is one allocation. */
+        effort += s->rax->numnodes;
+
+        /* Every consumer group is an allocation and so are the entries in its
+         * PEL. We use size of the first group's PEL as an estimate for all
+         * others. */
+        if (s->cgroups && raxSize(s->cgroups)) {
+            raxIterator ri;
+            streamCG *cg;
+            raxStart(&ri,s->cgroups);
+            raxSeek(&ri,"^",NULL,0);
+            /* There must be at least one group so the following should always
+             * work. */
+            serverAssert(raxNext(&ri));
+            cg = ri.data;
+            effort += raxSize(s->cgroups)*(1+raxSize(cg->pel));
+            raxStop(&ri);
+        }
+        return effort;
+    } else if (obj->type == OBJ_MODULE) {
+        moduleValue *mv = obj->ptr;
+        moduleType *mt = mv->type;
+        if (mt->free_effort != NULL) {
+            size_t effort  = mt->free_effort(key,mv->value);
+            /* If the module's free_effort returns 0, it will use asynchronous free
+             memory by default */
+            return effort == 0 ? ULONG_MAX : effort;
+        } else {
+            return 1;
+        }
+    } else {
+        return 1; /* Everything else is a single allocation. */
+    }
+}
+
+/* Delete a key, value, and associated expiration entry if any, from the DB.
+ * If there are enough allocations to free the value object may be put into
+ * a lazy free list instead of being freed synchronously. The lazy free list
+ * will be reclaimed in a different bio.c thread. */
+#define LAZYFREE_THRESHOLD 64
+int dbAsyncDelete(redisDb *db, robj *key) {
+    /* Deleting an entry from the expires dict will not free the sds of
+     * the key, because it is shared with the main dictionary. */
+    if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr);
+
+    /* If the value is composed of a few allocations, to free in a lazy way
+     * is actually just slower... So under a certain limit we just free
+     * the object synchronously. */
+    dictEntry *de = dictUnlink(db->dict,key->ptr);
+    if (de) {
+        robj *val = dictGetVal(de);
+
+        /* Tells the module that the key has been unlinked from the database. */
+        moduleNotifyKeyUnlink(key,val);
+
+        size_t free_effort = lazyfreeGetFreeEffort(key,val);
+
+        /* If releasing the object is too much work, do it in the background
+         * by adding the object to the lazy free list.
+         * Note that if the object is shared, to reclaim it now it is not
+         * possible. This rarely happens, however sometimes the implementation
+         * of parts of the Redis core may call incrRefCount() to protect
+         * objects, and then call dbDelete(). In this case we'll fall
+         * through and reach the dictFreeUnlinkedEntry() call, that will be
+         * equivalent to just calling decrRefCount(). */
+        if (free_effort > LAZYFREE_THRESHOLD && val->refcount == 1) {
+            atomicIncr(lazyfree_objects,1);
+            bioCreateLazyFreeJob(lazyfreeFreeObject,1, val);
+            dictSetVal(db->dict,de,NULL);
+        }
+    }
+
+    /* Release the key-val pair, or just the key if we set the val
+     * field to NULL in order to lazy free it later. */
+    if (de) {
+        dictFreeUnlinkedEntry(db->dict,de);
+        if (server.cluster_enabled) slotToKeyDel(key->ptr);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Free an object, if the object is huge enough, free it in async way. */
+void freeObjAsync(robj *key, robj *obj) {
+    size_t free_effort = lazyfreeGetFreeEffort(key,obj);
+    if (free_effort > LAZYFREE_THRESHOLD && obj->refcount == 1) {
+        atomicIncr(lazyfree_objects,1);
+        bioCreateLazyFreeJob(lazyfreeFreeObject,1,obj);
+    } else {
+        decrRefCount(obj);
+    }
+}
+
+/* Empty a Redis DB asynchronously. What the function does actually is to
+ * create a new empty set of hash tables and scheduling the old ones for
+ * lazy freeing. */
+void emptyDbAsync(redisDb *db) {
+    dict *oldht1 = db->dict, *oldht2 = db->expires;
+    db->dict = dictCreate(&dbDictType,NULL);
+    db->expires = dictCreate(&dbExpiresDictType,NULL);
+    atomicIncr(lazyfree_objects,dictSize(oldht1));
+    bioCreateLazyFreeJob(lazyfreeFreeDatabase,2,oldht1,oldht2);
+}
+
+/* Release the radix tree mapping Redis Cluster keys to slots asynchronously. */
+void freeSlotsToKeysMapAsync(rax *rt) {
+    atomicIncr(lazyfree_objects,rt->numele);
+    bioCreateLazyFreeJob(lazyfreeFreeSlotsMap,1,rt);
+}
+
+/* Free an object, if the object is huge enough, free it in async way. */
+void freeTrackingRadixTreeAsync(rax *tracking) {
+    atomicIncr(lazyfree_objects,tracking->numele);
+    bioCreateLazyFreeJob(lazyFreeTrackingTable,1,tracking);
+}
+
+/* Free lua_scripts dict, if the dict is huge enough, free it in async way. */
+void freeLuaScriptsAsync(dict *lua_scripts) {
+    if (dictSize(lua_scripts) > LAZYFREE_THRESHOLD) {
+        atomicIncr(lazyfree_objects,dictSize(lua_scripts));
+        bioCreateLazyFreeJob(lazyFreeLuaScripts,1,lua_scripts);
+    } else {
+        dictRelease(lua_scripts);
+    }
+}
diff --git a/redis-stable/src/listpack.c b/redis-stable/src/listpack.c
new file mode 100644
index 00000000..8424da87
--- /dev/null
+++ b/redis-stable/src/listpack.c
@@ -0,0 +1,965 @@
+/* Listpack -- A lists of strings serialization format
+ *
+ * This file implements the specification you can find at:
+ *
+ *  https://github.com/antirez/listpack
+ *
+ * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2020, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdint.h>
+#include <limits.h>
+#include <sys/types.h>
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+
+#include "listpack.h"
+#include "listpack_malloc.h"
+#include "redisassert.h"
+
+#define LP_HDR_SIZE 6       /* 32 bit total len + 16 bit number of elements. */
+#define LP_HDR_NUMELE_UNKNOWN UINT16_MAX
+#define LP_MAX_INT_ENCODING_LEN 9
+#define LP_MAX_BACKLEN_SIZE 5
+#define LP_MAX_ENTRY_BACKLEN 34359738367ULL
+#define LP_ENCODING_INT 0
+#define LP_ENCODING_STRING 1
+
+#define LP_ENCODING_7BIT_UINT 0
+#define LP_ENCODING_7BIT_UINT_MASK 0x80
+#define LP_ENCODING_IS_7BIT_UINT(byte) (((byte)&LP_ENCODING_7BIT_UINT_MASK)==LP_ENCODING_7BIT_UINT)
+
+#define LP_ENCODING_6BIT_STR 0x80
+#define LP_ENCODING_6BIT_STR_MASK 0xC0
+#define LP_ENCODING_IS_6BIT_STR(byte) (((byte)&LP_ENCODING_6BIT_STR_MASK)==LP_ENCODING_6BIT_STR)
+
+#define LP_ENCODING_13BIT_INT 0xC0
+#define LP_ENCODING_13BIT_INT_MASK 0xE0
+#define LP_ENCODING_IS_13BIT_INT(byte) (((byte)&LP_ENCODING_13BIT_INT_MASK)==LP_ENCODING_13BIT_INT)
+
+#define LP_ENCODING_12BIT_STR 0xE0
+#define LP_ENCODING_12BIT_STR_MASK 0xF0
+#define LP_ENCODING_IS_12BIT_STR(byte) (((byte)&LP_ENCODING_12BIT_STR_MASK)==LP_ENCODING_12BIT_STR)
+
+#define LP_ENCODING_16BIT_INT 0xF1
+#define LP_ENCODING_16BIT_INT_MASK 0xFF
+#define LP_ENCODING_IS_16BIT_INT(byte) (((byte)&LP_ENCODING_16BIT_INT_MASK)==LP_ENCODING_16BIT_INT)
+
+#define LP_ENCODING_24BIT_INT 0xF2
+#define LP_ENCODING_24BIT_INT_MASK 0xFF
+#define LP_ENCODING_IS_24BIT_INT(byte) (((byte)&LP_ENCODING_24BIT_INT_MASK)==LP_ENCODING_24BIT_INT)
+
+#define LP_ENCODING_32BIT_INT 0xF3
+#define LP_ENCODING_32BIT_INT_MASK 0xFF
+#define LP_ENCODING_IS_32BIT_INT(byte) (((byte)&LP_ENCODING_32BIT_INT_MASK)==LP_ENCODING_32BIT_INT)
+
+#define LP_ENCODING_64BIT_INT 0xF4
+#define LP_ENCODING_64BIT_INT_MASK 0xFF
+#define LP_ENCODING_IS_64BIT_INT(byte) (((byte)&LP_ENCODING_64BIT_INT_MASK)==LP_ENCODING_64BIT_INT)
+
+#define LP_ENCODING_32BIT_STR 0xF0
+#define LP_ENCODING_32BIT_STR_MASK 0xFF
+#define LP_ENCODING_IS_32BIT_STR(byte) (((byte)&LP_ENCODING_32BIT_STR_MASK)==LP_ENCODING_32BIT_STR)
+
+#define LP_EOF 0xFF
+
+#define LP_ENCODING_6BIT_STR_LEN(p) ((p)[0] & 0x3F)
+#define LP_ENCODING_12BIT_STR_LEN(p) ((((p)[0] & 0xF) << 8) | (p)[1])
+#define LP_ENCODING_32BIT_STR_LEN(p) (((uint32_t)(p)[1]<<0) | \
+                                      ((uint32_t)(p)[2]<<8) | \
+                                      ((uint32_t)(p)[3]<<16) | \
+                                      ((uint32_t)(p)[4]<<24))
+
+#define lpGetTotalBytes(p)           (((uint32_t)(p)[0]<<0) | \
+                                      ((uint32_t)(p)[1]<<8) | \
+                                      ((uint32_t)(p)[2]<<16) | \
+                                      ((uint32_t)(p)[3]<<24))
+
+#define lpGetNumElements(p)          (((uint32_t)(p)[4]<<0) | \
+                                      ((uint32_t)(p)[5]<<8))
+#define lpSetTotalBytes(p,v) do { \
+    (p)[0] = (v)&0xff; \
+    (p)[1] = ((v)>>8)&0xff; \
+    (p)[2] = ((v)>>16)&0xff; \
+    (p)[3] = ((v)>>24)&0xff; \
+} while(0)
+
+#define lpSetNumElements(p,v) do { \
+    (p)[4] = (v)&0xff; \
+    (p)[5] = ((v)>>8)&0xff; \
+} while(0)
+
+/* Validates that 'p' is not ouside the listpack.
+ * All function that return a pointer to an element in the listpack will assert
+ * that this element is valid, so it can be freely used.
+ * Generally functions such lpNext and lpDelete assume the input pointer is
+ * already validated (since it's the return value of another function). */
+#define ASSERT_INTEGRITY(lp, p) do { \
+    assert((p) >= (lp)+LP_HDR_SIZE && (p) < (lp)+lpGetTotalBytes((lp))); \
+} while (0)
+
+/* Similar to the above, but validates the entire element lenth rather than just
+ * it's pointer. */
+#define ASSERT_INTEGRITY_LEN(lp, p, len) do { \
+    assert((p) >= (lp)+LP_HDR_SIZE && (p)+(len) < (lp)+lpGetTotalBytes((lp))); \
+} while (0)
+
+static inline void lpAssertValidEntry(unsigned char* lp, size_t lpbytes, unsigned char *p);
+
+/* Convert a string into a signed 64 bit integer.
+ * The function returns 1 if the string could be parsed into a (non-overflowing)
+ * signed 64 bit int, 0 otherwise. The 'value' will be set to the parsed value
+ * when the function returns success.
+ *
+ * Note that this function demands that the string strictly represents
+ * a int64 value: no spaces or other characters before or after the string
+ * representing the number are accepted, nor zeroes at the start if not
+ * for the string "0" representing the zero number.
+ *
+ * Because of its strictness, it is safe to use this function to check if
+ * you can convert a string into a long long, and obtain back the string
+ * from the number without any loss in the string representation. *
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Credits: this function was adapted from the Redis source code, file
+ * "utils.c", function string2ll(), and is copyright:
+ *
+ * Copyright(C) 2011, Pieter Noordhuis
+ * Copyright(C) 2011, Salvatore Sanfilippo
+ *
+ * The function is released under the BSD 3-clause license.
+ */
+int lpStringToInt64(const char *s, unsigned long slen, int64_t *value) {
+    const char *p = s;
+    unsigned long plen = 0;
+    int negative = 0;
+    uint64_t v;
+
+    if (plen == slen)
+        return 0;
+
+    /* Special case: first and only digit is 0. */
+    if (slen == 1 && p[0] == '0') {
+        if (value != NULL) *value = 0;
+        return 1;
+    }
+
+    if (p[0] == '-') {
+        negative = 1;
+        p++; plen++;
+
+        /* Abort on only a negative sign. */
+        if (plen == slen)
+            return 0;
+    }
+
+    /* First digit should be 1-9, otherwise the string should just be 0. */
+    if (p[0] >= '1' && p[0] <= '9') {
+        v = p[0]-'0';
+        p++; plen++;
+    } else if (p[0] == '0' && slen == 1) {
+        *value = 0;
+        return 1;
+    } else {
+        return 0;
+    }
+
+    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
+        if (v > (UINT64_MAX / 10)) /* Overflow. */
+            return 0;
+        v *= 10;
+
+        if (v > (UINT64_MAX - (p[0]-'0'))) /* Overflow. */
+            return 0;
+        v += p[0]-'0';
+
+        p++; plen++;
+    }
+
+    /* Return if not all bytes were used. */
+    if (plen < slen)
+        return 0;
+
+    if (negative) {
+        if (v > ((uint64_t)(-(INT64_MIN+1))+1)) /* Overflow. */
+            return 0;
+        if (value != NULL) *value = -v;
+    } else {
+        if (v > INT64_MAX) /* Overflow. */
+            return 0;
+        if (value != NULL) *value = v;
+    }
+    return 1;
+}
+
+/* Create a new, empty listpack.
+ * On success the new listpack is returned, otherwise an error is returned.
+ * Pre-allocate at least `capacity` bytes of memory,
+ * over-allocated memory can be shrinked by `lpShrinkToFit`.
+ * */
+unsigned char *lpNew(size_t capacity) {
+    unsigned char *lp = lp_malloc(capacity > LP_HDR_SIZE+1 ? capacity : LP_HDR_SIZE+1);
+    if (lp == NULL) return NULL;
+    lpSetTotalBytes(lp,LP_HDR_SIZE+1);
+    lpSetNumElements(lp,0);
+    lp[LP_HDR_SIZE] = LP_EOF;
+    return lp;
+}
+
+/* Free the specified listpack. */
+void lpFree(unsigned char *lp) {
+    lp_free(lp);
+}
+
+/* Shrink the memory to fit. */
+unsigned char* lpShrinkToFit(unsigned char *lp) {
+    size_t size = lpGetTotalBytes(lp);
+    if (size < lp_malloc_size(lp)) {
+        return lp_realloc(lp, size);
+    } else {
+        return lp;
+    }
+}
+
+/* Given an element 'ele' of size 'size', determine if the element can be
+ * represented inside the listpack encoded as integer, and returns
+ * LP_ENCODING_INT if so. Otherwise returns LP_ENCODING_STR if no integer
+ * encoding is possible.
+ *
+ * If the LP_ENCODING_INT is returned, the function stores the integer encoded
+ * representation of the element in the 'intenc' buffer.
+ *
+ * Regardless of the returned encoding, 'enclen' is populated by reference to
+ * the number of bytes that the string or integer encoded element will require
+ * in order to be represented. */
+int lpEncodeGetType(unsigned char *ele, uint32_t size, unsigned char *intenc, uint64_t *enclen) {
+    int64_t v;
+    if (lpStringToInt64((const char*)ele, size, &v)) {
+        if (v >= 0 && v <= 127) {
+            /* Single byte 0-127 integer. */
+            intenc[0] = v;
+            *enclen = 1;
+        } else if (v >= -4096 && v <= 4095) {
+            /* 13 bit integer. */
+            if (v < 0) v = ((int64_t)1<<13)+v;
+            intenc[0] = (v>>8)|LP_ENCODING_13BIT_INT;
+            intenc[1] = v&0xff;
+            *enclen = 2;
+        } else if (v >= -32768 && v <= 32767) {
+            /* 16 bit integer. */
+            if (v < 0) v = ((int64_t)1<<16)+v;
+            intenc[0] = LP_ENCODING_16BIT_INT;
+            intenc[1] = v&0xff;
+            intenc[2] = v>>8;
+            *enclen = 3;
+        } else if (v >= -8388608 && v <= 8388607) {
+            /* 24 bit integer. */
+            if (v < 0) v = ((int64_t)1<<24)+v;
+            intenc[0] = LP_ENCODING_24BIT_INT;
+            intenc[1] = v&0xff;
+            intenc[2] = (v>>8)&0xff;
+            intenc[3] = v>>16;
+            *enclen = 4;
+        } else if (v >= -2147483648 && v <= 2147483647) {
+            /* 32 bit integer. */
+            if (v < 0) v = ((int64_t)1<<32)+v;
+            intenc[0] = LP_ENCODING_32BIT_INT;
+            intenc[1] = v&0xff;
+            intenc[2] = (v>>8)&0xff;
+            intenc[3] = (v>>16)&0xff;
+            intenc[4] = v>>24;
+            *enclen = 5;
+        } else {
+            /* 64 bit integer. */
+            uint64_t uv = v;
+            intenc[0] = LP_ENCODING_64BIT_INT;
+            intenc[1] = uv&0xff;
+            intenc[2] = (uv>>8)&0xff;
+            intenc[3] = (uv>>16)&0xff;
+            intenc[4] = (uv>>24)&0xff;
+            intenc[5] = (uv>>32)&0xff;
+            intenc[6] = (uv>>40)&0xff;
+            intenc[7] = (uv>>48)&0xff;
+            intenc[8] = uv>>56;
+            *enclen = 9;
+        }
+        return LP_ENCODING_INT;
+    } else {
+        if (size < 64) *enclen = 1+size;
+        else if (size < 4096) *enclen = 2+size;
+        else *enclen = 5+(uint64_t)size;
+        return LP_ENCODING_STRING;
+    }
+}
+
+/* Store a reverse-encoded variable length field, representing the length
+ * of the previous element of size 'l', in the target buffer 'buf'.
+ * The function returns the number of bytes used to encode it, from
+ * 1 to 5. If 'buf' is NULL the function just returns the number of bytes
+ * needed in order to encode the backlen. */
+unsigned long lpEncodeBacklen(unsigned char *buf, uint64_t l) {
+    if (l <= 127) {
+        if (buf) buf[0] = l;
+        return 1;
+    } else if (l < 16383) {
+        if (buf) {
+            buf[0] = l>>7;
+            buf[1] = (l&127)|128;
+        }
+        return 2;
+    } else if (l < 2097151) {
+        if (buf) {
+            buf[0] = l>>14;
+            buf[1] = ((l>>7)&127)|128;
+            buf[2] = (l&127)|128;
+        }
+        return 3;
+    } else if (l < 268435455) {
+        if (buf) {
+            buf[0] = l>>21;
+            buf[1] = ((l>>14)&127)|128;
+            buf[2] = ((l>>7)&127)|128;
+            buf[3] = (l&127)|128;
+        }
+        return 4;
+    } else {
+        if (buf) {
+            buf[0] = l>>28;
+            buf[1] = ((l>>21)&127)|128;
+            buf[2] = ((l>>14)&127)|128;
+            buf[3] = ((l>>7)&127)|128;
+            buf[4] = (l&127)|128;
+        }
+        return 5;
+    }
+}
+
+/* Decode the backlen and returns it. If the encoding looks invalid (more than
+ * 5 bytes are used), UINT64_MAX is returned to report the problem. */
+uint64_t lpDecodeBacklen(unsigned char *p) {
+    uint64_t val = 0;
+    uint64_t shift = 0;
+    do {
+        val |= (uint64_t)(p[0] & 127) << shift;
+        if (!(p[0] & 128)) break;
+        shift += 7;
+        p--;
+        if (shift > 28) return UINT64_MAX;
+    } while(1);
+    return val;
+}
+
+/* Encode the string element pointed by 's' of size 'len' in the target
+ * buffer 's'. The function should be called with 'buf' having always enough
+ * space for encoding the string. This is done by calling lpEncodeGetType()
+ * before calling this function. */
+void lpEncodeString(unsigned char *buf, unsigned char *s, uint32_t len) {
+    if (len < 64) {
+        buf[0] = len | LP_ENCODING_6BIT_STR;
+        memcpy(buf+1,s,len);
+    } else if (len < 4096) {
+        buf[0] = (len >> 8) | LP_ENCODING_12BIT_STR;
+        buf[1] = len & 0xff;
+        memcpy(buf+2,s,len);
+    } else {
+        buf[0] = LP_ENCODING_32BIT_STR;
+        buf[1] = len & 0xff;
+        buf[2] = (len >> 8) & 0xff;
+        buf[3] = (len >> 16) & 0xff;
+        buf[4] = (len >> 24) & 0xff;
+        memcpy(buf+5,s,len);
+    }
+}
+
+/* Return the encoded length of the listpack element pointed by 'p'.
+ * This includes the encoding byte, length bytes, and the element data itself.
+ * If the element encoding is wrong then 0 is returned.
+ * Note that this method may access additional bytes (in case of 12 and 32 bit
+ * str), so should only be called when we know 'p' was already validated by
+ * lpCurrentEncodedSizeBytes or ASSERT_INTEGRITY_LEN (possibly since 'p' is
+ * a return value of another function that validated its return. */
+uint32_t lpCurrentEncodedSizeUnsafe(unsigned char *p) {
+    if (LP_ENCODING_IS_7BIT_UINT(p[0])) return 1;
+    if (LP_ENCODING_IS_6BIT_STR(p[0])) return 1+LP_ENCODING_6BIT_STR_LEN(p);
+    if (LP_ENCODING_IS_13BIT_INT(p[0])) return 2;
+    if (LP_ENCODING_IS_16BIT_INT(p[0])) return 3;
+    if (LP_ENCODING_IS_24BIT_INT(p[0])) return 4;
+    if (LP_ENCODING_IS_32BIT_INT(p[0])) return 5;
+    if (LP_ENCODING_IS_64BIT_INT(p[0])) return 9;
+    if (LP_ENCODING_IS_12BIT_STR(p[0])) return 2+LP_ENCODING_12BIT_STR_LEN(p);
+    if (LP_ENCODING_IS_32BIT_STR(p[0])) return 5+LP_ENCODING_32BIT_STR_LEN(p);
+    if (p[0] == LP_EOF) return 1;
+    return 0;
+}
+
+/* Return bytes needed to encode the length of the listpack element pointed by 'p'.
+ * This includes just the encodign byte, and the bytes needed to encode the length
+ * of the element (excluding the element data itself)
+ * If the element encoding is wrong then 0 is returned. */
+uint32_t lpCurrentEncodedSizeBytes(unsigned char *p) {
+    if (LP_ENCODING_IS_7BIT_UINT(p[0])) return 1;
+    if (LP_ENCODING_IS_6BIT_STR(p[0])) return 1;
+    if (LP_ENCODING_IS_13BIT_INT(p[0])) return 1;
+    if (LP_ENCODING_IS_16BIT_INT(p[0])) return 1;
+    if (LP_ENCODING_IS_24BIT_INT(p[0])) return 1;
+    if (LP_ENCODING_IS_32BIT_INT(p[0])) return 1;
+    if (LP_ENCODING_IS_64BIT_INT(p[0])) return 1;
+    if (LP_ENCODING_IS_12BIT_STR(p[0])) return 2;
+    if (LP_ENCODING_IS_32BIT_STR(p[0])) return 5;
+    if (p[0] == LP_EOF) return 1;
+    return 0;
+}
+
+/* Skip the current entry returning the next. It is invalid to call this
+ * function if the current element is the EOF element at the end of the
+ * listpack, however, while this function is used to implement lpNext(),
+ * it does not return NULL when the EOF element is encountered. */
+unsigned char *lpSkip(unsigned char *p) {
+    unsigned long entrylen = lpCurrentEncodedSizeUnsafe(p);
+    entrylen += lpEncodeBacklen(NULL,entrylen);
+    p += entrylen;
+    return p;
+}
+
+/* If 'p' points to an element of the listpack, calling lpNext() will return
+ * the pointer to the next element (the one on the right), or NULL if 'p'
+ * already pointed to the last element of the listpack. */
+unsigned char *lpNext(unsigned char *lp, unsigned char *p) {
+    assert(p);
+    p = lpSkip(p);
+    if (p[0] == LP_EOF) return NULL;
+    lpAssertValidEntry(lp, lpBytes(lp), p);
+    return p;
+}
+
+/* If 'p' points to an element of the listpack, calling lpPrev() will return
+ * the pointer to the previous element (the one on the left), or NULL if 'p'
+ * already pointed to the first element of the listpack. */
+unsigned char *lpPrev(unsigned char *lp, unsigned char *p) {
+    assert(p);
+    if (p-lp == LP_HDR_SIZE) return NULL;
+    p--; /* Seek the first backlen byte of the last element. */
+    uint64_t prevlen = lpDecodeBacklen(p);
+    prevlen += lpEncodeBacklen(NULL,prevlen);
+    p -= prevlen-1; /* Seek the first byte of the previous entry. */
+    lpAssertValidEntry(lp, lpBytes(lp), p);
+    return p;
+}
+
+/* Return a pointer to the first element of the listpack, or NULL if the
+ * listpack has no elements. */
+unsigned char *lpFirst(unsigned char *lp) {
+    unsigned char *p = lp + LP_HDR_SIZE; /* Skip the header. */
+    if (p[0] == LP_EOF) return NULL;
+    lpAssertValidEntry(lp, lpBytes(lp), p);
+    return p;
+}
+
+/* Return a pointer to the last element of the listpack, or NULL if the
+ * listpack has no elements. */
+unsigned char *lpLast(unsigned char *lp) {
+    unsigned char *p = lp+lpGetTotalBytes(lp)-1; /* Seek EOF element. */
+    return lpPrev(lp,p); /* Will return NULL if EOF is the only element. */
+}
+
+/* Return the number of elements inside the listpack. This function attempts
+ * to use the cached value when within range, otherwise a full scan is
+ * needed. As a side effect of calling this function, the listpack header
+ * could be modified, because if the count is found to be already within
+ * the 'numele' header field range, the new value is set. */
+uint32_t lpLength(unsigned char *lp) {
+    uint32_t numele = lpGetNumElements(lp);
+    if (numele != LP_HDR_NUMELE_UNKNOWN) return numele;
+
+    /* Too many elements inside the listpack. We need to scan in order
+     * to get the total number. */
+    uint32_t count = 0;
+    unsigned char *p = lpFirst(lp);
+    while(p) {
+        count++;
+        p = lpNext(lp,p);
+    }
+
+    /* If the count is again within range of the header numele field,
+     * set it. */
+    if (count < LP_HDR_NUMELE_UNKNOWN) lpSetNumElements(lp,count);
+    return count;
+}
+
+/* Return the listpack element pointed by 'p'.
+ *
+ * The function changes behavior depending on the passed 'intbuf' value.
+ * Specifically, if 'intbuf' is NULL:
+ *
+ * If the element is internally encoded as an integer, the function returns
+ * NULL and populates the integer value by reference in 'count'. Otherwise if
+ * the element is encoded as a string a pointer to the string (pointing inside
+ * the listpack itself) is returned, and 'count' is set to the length of the
+ * string.
+ *
+ * If instead 'intbuf' points to a buffer passed by the caller, that must be
+ * at least LP_INTBUF_SIZE bytes, the function always returns the element as
+ * it was a string (returning the pointer to the string and setting the
+ * 'count' argument to the string length by reference). However if the element
+ * is encoded as an integer, the 'intbuf' buffer is used in order to store
+ * the string representation.
+ *
+ * The user should use one or the other form depending on what the value will
+ * be used for. If there is immediate usage for an integer value returned
+ * by the function, than to pass a buffer (and convert it back to a number)
+ * is of course useless.
+ *
+ * If the function is called against a badly encoded ziplist, so that there
+ * is no valid way to parse it, the function returns like if there was an
+ * integer encoded with value 12345678900000000 + <unrecognized byte>, this may
+ * be an hint to understand that something is wrong. To crash in this case is
+ * not sensible because of the different requirements of the application using
+ * this lib.
+ *
+ * Similarly, there is no error returned since the listpack normally can be
+ * assumed to be valid, so that would be a very high API cost. However a function
+ * in order to check the integrity of the listpack at load time is provided,
+ * check lpIsValid(). */
+unsigned char *lpGet(unsigned char *p, int64_t *count, unsigned char *intbuf) {
+    int64_t val;
+    uint64_t uval, negstart, negmax;
+
+    assert(p); /* assertion for valgrind (avoid NPD) */
+    if (LP_ENCODING_IS_7BIT_UINT(p[0])) {
+        negstart = UINT64_MAX; /* 7 bit ints are always positive. */
+        negmax = 0;
+        uval = p[0] & 0x7f;
+    } else if (LP_ENCODING_IS_6BIT_STR(p[0])) {
+        *count = LP_ENCODING_6BIT_STR_LEN(p);
+        return p+1;
+    } else if (LP_ENCODING_IS_13BIT_INT(p[0])) {
+        uval = ((p[0]&0x1f)<<8) | p[1];
+        negstart = (uint64_t)1<<12;
+        negmax = 8191;
+    } else if (LP_ENCODING_IS_16BIT_INT(p[0])) {
+        uval = (uint64_t)p[1] |
+               (uint64_t)p[2]<<8;
+        negstart = (uint64_t)1<<15;
+        negmax = UINT16_MAX;
+    } else if (LP_ENCODING_IS_24BIT_INT(p[0])) {
+        uval = (uint64_t)p[1] |
+               (uint64_t)p[2]<<8 |
+               (uint64_t)p[3]<<16;
+        negstart = (uint64_t)1<<23;
+        negmax = UINT32_MAX>>8;
+    } else if (LP_ENCODING_IS_32BIT_INT(p[0])) {
+        uval = (uint64_t)p[1] |
+               (uint64_t)p[2]<<8 |
+               (uint64_t)p[3]<<16 |
+               (uint64_t)p[4]<<24;
+        negstart = (uint64_t)1<<31;
+        negmax = UINT32_MAX;
+    } else if (LP_ENCODING_IS_64BIT_INT(p[0])) {
+        uval = (uint64_t)p[1] |
+               (uint64_t)p[2]<<8 |
+               (uint64_t)p[3]<<16 |
+               (uint64_t)p[4]<<24 |
+               (uint64_t)p[5]<<32 |
+               (uint64_t)p[6]<<40 |
+               (uint64_t)p[7]<<48 |
+               (uint64_t)p[8]<<56;
+        negstart = (uint64_t)1<<63;
+        negmax = UINT64_MAX;
+    } else if (LP_ENCODING_IS_12BIT_STR(p[0])) {
+        *count = LP_ENCODING_12BIT_STR_LEN(p);
+        return p+2;
+    } else if (LP_ENCODING_IS_32BIT_STR(p[0])) {
+        *count = LP_ENCODING_32BIT_STR_LEN(p);
+        return p+5;
+    } else {
+        uval = 12345678900000000ULL + p[0];
+        negstart = UINT64_MAX;
+        negmax = 0;
+    }
+
+    /* We reach this code path only for integer encodings.
+     * Convert the unsigned value to the signed one using two's complement
+     * rule. */
+    if (uval >= negstart) {
+        /* This three steps conversion should avoid undefined behaviors
+         * in the unsigned -> signed conversion. */
+        uval = negmax-uval;
+        val = uval;
+        val = -val-1;
+    } else {
+        val = uval;
+    }
+
+    /* Return the string representation of the integer or the value itself
+     * depending on intbuf being NULL or not. */
+    if (intbuf) {
+        *count = snprintf((char*)intbuf,LP_INTBUF_SIZE,"%lld",(long long)val);
+        return intbuf;
+    } else {
+        *count = val;
+        return NULL;
+    }
+}
+
+/* Insert, delete or replace the specified element 'ele' of length 'len' at
+ * the specified position 'p', with 'p' being a listpack element pointer
+ * obtained with lpFirst(), lpLast(), lpNext(), lpPrev() or lpSeek().
+ *
+ * The element is inserted before, after, or replaces the element pointed
+ * by 'p' depending on the 'where' argument, that can be LP_BEFORE, LP_AFTER
+ * or LP_REPLACE.
+ *
+ * If 'ele' is set to NULL, the function removes the element pointed by 'p'
+ * instead of inserting one.
+ *
+ * Returns NULL on out of memory or when the listpack total length would exceed
+ * the max allowed size of 2^32-1, otherwise the new pointer to the listpack
+ * holding the new element is returned (and the old pointer passed is no longer
+ * considered valid)
+ *
+ * If 'newp' is not NULL, at the end of a successful call '*newp' will be set
+ * to the address of the element just added, so that it will be possible to
+ * continue an interation with lpNext() and lpPrev().
+ *
+ * For deletion operations ('ele' set to NULL) 'newp' is set to the next
+ * element, on the right of the deleted one, or to NULL if the deleted element
+ * was the last one. */
+unsigned char *lpInsert(unsigned char *lp, unsigned char *ele, uint32_t size, unsigned char *p, int where, unsigned char **newp) {
+    unsigned char intenc[LP_MAX_INT_ENCODING_LEN];
+    unsigned char backlen[LP_MAX_BACKLEN_SIZE];
+
+    uint64_t enclen; /* The length of the encoded element. */
+
+    /* An element pointer set to NULL means deletion, which is conceptually
+     * replacing the element with a zero-length element. So whatever we
+     * get passed as 'where', set it to LP_REPLACE. */
+    if (ele == NULL) where = LP_REPLACE;
+
+    /* If we need to insert after the current element, we just jump to the
+     * next element (that could be the EOF one) and handle the case of
+     * inserting before. So the function will actually deal with just two
+     * cases: LP_BEFORE and LP_REPLACE. */
+    if (where == LP_AFTER) {
+        p = lpSkip(p);
+        where = LP_BEFORE;
+        ASSERT_INTEGRITY(lp, p);
+    }
+
+    /* Store the offset of the element 'p', so that we can obtain its
+     * address again after a reallocation. */
+    unsigned long poff = p-lp;
+
+    /* Calling lpEncodeGetType() results into the encoded version of the
+     * element to be stored into 'intenc' in case it is representable as
+     * an integer: in that case, the function returns LP_ENCODING_INT.
+     * Otherwise if LP_ENCODING_STR is returned, we'll have to call
+     * lpEncodeString() to actually write the encoded string on place later.
+     *
+     * Whatever the returned encoding is, 'enclen' is populated with the
+     * length of the encoded element. */
+    int enctype;
+    if (ele) {
+        enctype = lpEncodeGetType(ele,size,intenc,&enclen);
+    } else {
+        enctype = -1;
+        enclen = 0;
+    }
+
+    /* We need to also encode the backward-parsable length of the element
+     * and append it to the end: this allows to traverse the listpack from
+     * the end to the start. */
+    unsigned long backlen_size = ele ? lpEncodeBacklen(backlen,enclen) : 0;
+    uint64_t old_listpack_bytes = lpGetTotalBytes(lp);
+    uint32_t replaced_len  = 0;
+    if (where == LP_REPLACE) {
+        replaced_len = lpCurrentEncodedSizeUnsafe(p);
+        replaced_len += lpEncodeBacklen(NULL,replaced_len);
+        ASSERT_INTEGRITY_LEN(lp, p, replaced_len);
+    }
+
+    uint64_t new_listpack_bytes = old_listpack_bytes + enclen + backlen_size
+                                  - replaced_len;
+    if (new_listpack_bytes > UINT32_MAX) return NULL;
+
+    /* We now need to reallocate in order to make space or shrink the
+     * allocation (in case 'when' value is LP_REPLACE and the new element is
+     * smaller). However we do that before memmoving the memory to
+     * make room for the new element if the final allocation will get
+     * larger, or we do it after if the final allocation will get smaller. */
+
+    unsigned char *dst = lp + poff; /* May be updated after reallocation. */
+
+    /* Realloc before: we need more room. */
+    if (new_listpack_bytes > old_listpack_bytes &&
+        new_listpack_bytes > lp_malloc_size(lp)) {
+        if ((lp = lp_realloc(lp,new_listpack_bytes)) == NULL) return NULL;
+        dst = lp + poff;
+    }
+
+    /* Setup the listpack relocating the elements to make the exact room
+     * we need to store the new one. */
+    if (where == LP_BEFORE) {
+        memmove(dst+enclen+backlen_size,dst,old_listpack_bytes-poff);
+    } else { /* LP_REPLACE. */
+        long lendiff = (enclen+backlen_size)-replaced_len;
+        memmove(dst+replaced_len+lendiff,
+                dst+replaced_len,
+                old_listpack_bytes-poff-replaced_len);
+    }
+
+    /* Realloc after: we need to free space. */
+    if (new_listpack_bytes < old_listpack_bytes) {
+        if ((lp = lp_realloc(lp,new_listpack_bytes)) == NULL) return NULL;
+        dst = lp + poff;
+    }
+
+    /* Store the entry. */
+    if (newp) {
+        *newp = dst;
+        /* In case of deletion, set 'newp' to NULL if the next element is
+         * the EOF element. */
+        if (!ele && dst[0] == LP_EOF) *newp = NULL;
+    }
+    if (ele) {
+        if (enctype == LP_ENCODING_INT) {
+            memcpy(dst,intenc,enclen);
+        } else {
+            lpEncodeString(dst,ele,size);
+        }
+        dst += enclen;
+        memcpy(dst,backlen,backlen_size);
+        dst += backlen_size;
+    }
+
+    /* Update header. */
+    if (where != LP_REPLACE || ele == NULL) {
+        uint32_t num_elements = lpGetNumElements(lp);
+        if (num_elements != LP_HDR_NUMELE_UNKNOWN) {
+            if (ele)
+                lpSetNumElements(lp,num_elements+1);
+            else
+                lpSetNumElements(lp,num_elements-1);
+        }
+    }
+    lpSetTotalBytes(lp,new_listpack_bytes);
+
+#if 0
+    /* This code path is normally disabled: what it does is to force listpack
+     * to return *always* a new pointer after performing some modification to
+     * the listpack, even if the previous allocation was enough. This is useful
+     * in order to spot bugs in code using listpacks: by doing so we can find
+     * if the caller forgets to set the new pointer where the listpack reference
+     * is stored, after an update. */
+    unsigned char *oldlp = lp;
+    lp = lp_malloc(new_listpack_bytes);
+    memcpy(lp,oldlp,new_listpack_bytes);
+    if (newp) {
+        unsigned long offset = (*newp)-oldlp;
+        *newp = lp + offset;
+    }
+    /* Make sure the old allocation contains garbage. */
+    memset(oldlp,'A',new_listpack_bytes);
+    lp_free(oldlp);
+#endif
+
+    return lp;
+}
+
+/* Append the specified element 'ele' of length 'len' at the end of the
+ * listpack. It is implemented in terms of lpInsert(), so the return value is
+ * the same as lpInsert(). */
+unsigned char *lpAppend(unsigned char *lp, unsigned char *ele, uint32_t size) {
+    uint64_t listpack_bytes = lpGetTotalBytes(lp);
+    unsigned char *eofptr = lp + listpack_bytes - 1;
+    return lpInsert(lp,ele,size,eofptr,LP_BEFORE,NULL);
+}
+
+/* Remove the element pointed by 'p', and return the resulting listpack.
+ * If 'newp' is not NULL, the next element pointer (to the right of the
+ * deleted one) is returned by reference. If the deleted element was the
+ * last one, '*newp' is set to NULL. */
+unsigned char *lpDelete(unsigned char *lp, unsigned char *p, unsigned char **newp) {
+    return lpInsert(lp,NULL,0,p,LP_REPLACE,newp);
+}
+
+/* Return the total number of bytes the listpack is composed of. */
+uint32_t lpBytes(unsigned char *lp) {
+    return lpGetTotalBytes(lp);
+}
+
+/* Seek the specified element and returns the pointer to the seeked element.
+ * Positive indexes specify the zero-based element to seek from the head to
+ * the tail, negative indexes specify elements starting from the tail, where
+ * -1 means the last element, -2 the penultimate and so forth. If the index
+ * is out of range, NULL is returned. */
+unsigned char *lpSeek(unsigned char *lp, long index) {
+    int forward = 1; /* Seek forward by default. */
+
+    /* We want to seek from left to right or the other way around
+     * depending on the listpack length and the element position.
+     * However if the listpack length cannot be obtained in constant time,
+     * we always seek from left to right. */
+    uint32_t numele = lpGetNumElements(lp);
+    if (numele != LP_HDR_NUMELE_UNKNOWN) {
+        if (index < 0) index = (long)numele+index;
+        if (index < 0) return NULL; /* Index still < 0 means out of range. */
+        if (index >= (long)numele) return NULL; /* Out of range the other side. */
+        /* We want to scan right-to-left if the element we are looking for
+         * is past the half of the listpack. */
+        if (index > (long)numele/2) {
+            forward = 0;
+            /* Right to left scanning always expects a negative index. Convert
+             * our index to negative form. */
+            index -= numele;
+        }
+    } else {
+        /* If the listpack length is unspecified, for negative indexes we
+         * want to always scan right-to-left. */
+        if (index < 0) forward = 0;
+    }
+
+    /* Forward and backward scanning is trivially based on lpNext()/lpPrev(). */
+    if (forward) {
+        unsigned char *ele = lpFirst(lp);
+        while (index > 0 && ele) {
+            ele = lpNext(lp,ele);
+            index--;
+        }
+        return ele;
+    } else {
+        unsigned char *ele = lpLast(lp);
+        while (index < -1 && ele) {
+            ele = lpPrev(lp,ele);
+            index++;
+        }
+        return ele;
+    }
+}
+
+/* Same as lpFirst but without validation assert, to be used right before lpValidateNext. */
+unsigned char *lpValidateFirst(unsigned char *lp) {
+    unsigned char *p = lp + LP_HDR_SIZE; /* Skip the header. */
+    if (p[0] == LP_EOF) return NULL;
+    return p;
+}
+
+/* Validate the integrity of a single listpack entry and move to the next one.
+ * The input argument 'pp' is a reference to the current record and is advanced on exit.
+ * Returns 1 if valid, 0 if invalid. */
+int lpValidateNext(unsigned char *lp, unsigned char **pp, size_t lpbytes) {
+#define OUT_OF_RANGE(p) ( \
+        (p) < lp + LP_HDR_SIZE || \
+        (p) > lp + lpbytes - 1)
+    unsigned char *p = *pp;
+    if (!p)
+        return 0;
+
+    /* Before accessing p, make sure it's valid. */
+    if (OUT_OF_RANGE(p))
+        return 0;
+
+    if (*p == LP_EOF) {
+        *pp = NULL;
+        return 1;
+    }
+
+    /* check that we can read the encoded size */
+    uint32_t lenbytes = lpCurrentEncodedSizeBytes(p);
+    if (!lenbytes)
+        return 0;
+
+    /* make sure the encoded entry length doesn't rech outside the edge of the listpack */
+    if (OUT_OF_RANGE(p + lenbytes))
+        return 0;
+
+    /* get the entry length and encoded backlen. */
+    unsigned long entrylen = lpCurrentEncodedSizeUnsafe(p);
+    unsigned long encodedBacklen = lpEncodeBacklen(NULL,entrylen);
+    entrylen += encodedBacklen;
+
+    /* make sure the entry doesn't rech outside the edge of the listpack */
+    if (OUT_OF_RANGE(p + entrylen))
+        return 0;
+
+    /* move to the next entry */
+    p += entrylen;
+
+    /* make sure the encoded length at the end patches the one at the beginning. */
+    uint64_t prevlen = lpDecodeBacklen(p-1);
+    if (prevlen + encodedBacklen != entrylen)
+        return 0;
+
+    *pp = p;
+    return 1;
+#undef OUT_OF_RANGE
+}
+
+/* Validate that the entry doesn't reach outside the listpack allocation. */
+static inline void lpAssertValidEntry(unsigned char* lp, size_t lpbytes, unsigned char *p) {
+    assert(lpValidateNext(lp, &p, lpbytes));
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we scan all the entries one by one. */
+int lpValidateIntegrity(unsigned char *lp, size_t size, int deep){
+    /* Check that we can actually read the header. (and EOF) */
+    if (size < LP_HDR_SIZE + 1)
+        return 0;
+
+    /* Check that the encoded size in the header must match the allocated size. */
+    size_t bytes = lpGetTotalBytes(lp);
+    if (bytes != size)
+        return 0;
+
+    /* The last byte must be the terminator. */
+    if (lp[size-1] != LP_EOF)
+        return 0;
+
+    if (!deep)
+        return 1;
+
+    /* Validate the invividual entries. */
+    uint32_t count = 0;
+    unsigned char *p = lp + LP_HDR_SIZE;
+    while(p && p[0] != LP_EOF) {
+        if (!lpValidateNext(lp, &p, bytes))
+            return 0;
+        count++;
+    }
+
+    /* Check that the count in the header is correct */
+    uint32_t numele = lpGetNumElements(lp);
+    if (numele != LP_HDR_NUMELE_UNKNOWN && numele != count)
+        return 0;
+
+    return 1;
+}
diff --git a/redis-stable/src/listpack.h b/redis-stable/src/listpack.h
new file mode 100644
index 00000000..9a5115ba
--- /dev/null
+++ b/redis-stable/src/listpack.h
@@ -0,0 +1,66 @@
+/* Listpack -- A lists of strings serialization format
+ *
+ * This file implements the specification you can find at:
+ *
+ *  https://github.com/antirez/listpack
+ *
+ * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __LISTPACK_H
+#define __LISTPACK_H
+
+#include <stdlib.h>
+#include <stdint.h>
+
+#define LP_INTBUF_SIZE 21 /* 20 digits of -2^63 + 1 null term = 21. */
+
+/* lpInsert() where argument possible values: */
+#define LP_BEFORE 0
+#define LP_AFTER 1
+#define LP_REPLACE 2
+
+unsigned char *lpNew(size_t capacity);
+void lpFree(unsigned char *lp);
+unsigned char* lpShrinkToFit(unsigned char *lp);
+unsigned char *lpInsert(unsigned char *lp, unsigned char *ele, uint32_t size, unsigned char *p, int where, unsigned char **newp);
+unsigned char *lpAppend(unsigned char *lp, unsigned char *ele, uint32_t size);
+unsigned char *lpDelete(unsigned char *lp, unsigned char *p, unsigned char **newp);
+uint32_t lpLength(unsigned char *lp);
+unsigned char *lpGet(unsigned char *p, int64_t *count, unsigned char *intbuf);
+unsigned char *lpFirst(unsigned char *lp);
+unsigned char *lpLast(unsigned char *lp);
+unsigned char *lpNext(unsigned char *lp, unsigned char *p);
+unsigned char *lpPrev(unsigned char *lp, unsigned char *p);
+uint32_t lpBytes(unsigned char *lp);
+unsigned char *lpSeek(unsigned char *lp, long index);
+int lpValidateIntegrity(unsigned char *lp, size_t size, int deep);
+unsigned char *lpValidateFirst(unsigned char *lp);
+int lpValidateNext(unsigned char *lp, unsigned char **pp, size_t lpbytes);
+
+#endif
diff --git a/redis-stable/src/listpack_malloc.h b/redis-stable/src/listpack_malloc.h
new file mode 100644
index 00000000..3a905005
--- /dev/null
+++ b/redis-stable/src/listpack_malloc.h
@@ -0,0 +1,46 @@
+/* Listpack -- A lists of strings serialization format
+ * https://github.com/antirez/listpack
+ *
+ * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* Allocator selection.
+ *
+ * This file is used in order to change the Rax allocator at compile time.
+ * Just define the following defines to what you want to use. Also add
+ * the include of your alternate allocator if needed (not needed in order
+ * to use the default libc allocator). */
+
+#ifndef LISTPACK_ALLOC_H
+#define LISTPACK_ALLOC_H
+#include "zmalloc.h"
+#define lp_malloc zmalloc
+#define lp_realloc zrealloc
+#define lp_free zfree
+#define lp_malloc_size zmalloc_usable_size
+#endif
diff --git a/redis-stable/src/localtime.c b/redis-stable/src/localtime.c
new file mode 100644
index 00000000..e2ac81f9
--- /dev/null
+++ b/redis-stable/src/localtime.c
@@ -0,0 +1,123 @@
+/*
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <time.h>
+
+/* This is a safe version of localtime() which contains no locks and is
+ * fork() friendly. Even the _r version of localtime() cannot be used safely
+ * in Redis. Another thread may be calling localtime() while the main thread
+ * forks(). Later when the child process calls localtime() again, for instance
+ * in order to log something to the Redis log, it may deadlock: in the copy
+ * of the address space of the forked process the lock will never be released.
+ *
+ * This function takes the timezone 'tz' as argument, and the 'dst' flag is
+ * used to check if daylight saving time is currently in effect. The caller
+ * of this function should obtain such information calling tzset() ASAP in the
+ * main() function to obtain the timezone offset from the 'timezone' global
+ * variable. To obtain the daylight information, if it is currently active or not,
+ * one trick is to call localtime() in main() ASAP as well, and get the
+ * information from the tm_isdst field of the tm structure. However the daylight
+ * time may switch in the future for long running processes, so this information
+ * should be refreshed at safe times.
+ *
+ * Note that this function does not work for dates < 1/1/1970, it is solely
+ * designed to work with what time(NULL) may return, and to support Redis
+ * logging of the dates, it's not really a complete implementation. */
+static int is_leap_year(time_t year) {
+    if (year % 4) return 0;         /* A year not divisible by 4 is not leap. */
+    else if (year % 100) return 1;  /* If div by 4 and not 100 is surely leap. */
+    else if (year % 400) return 0;  /* If div by 100 *and* not by 400 is not leap. */
+    else return 1;                  /* If div by 100 and 400 is leap. */
+}
+
+void nolocks_localtime(struct tm *tmp, time_t t, time_t tz, int dst) {
+    const time_t secs_min = 60;
+    const time_t secs_hour = 3600;
+    const time_t secs_day = 3600*24;
+
+    t -= tz;                            /* Adjust for timezone. */
+    t += 3600*dst;                      /* Adjust for daylight time. */
+    time_t days = t / secs_day;         /* Days passed since epoch. */
+    time_t seconds = t % secs_day;      /* Remaining seconds. */
+
+    tmp->tm_isdst = dst;
+    tmp->tm_hour = seconds / secs_hour;
+    tmp->tm_min = (seconds % secs_hour) / secs_min;
+    tmp->tm_sec = (seconds % secs_hour) % secs_min;
+
+    /* 1/1/1970 was a Thursday, that is, day 4 from the POV of the tm structure
+     * where sunday = 0, so to calculate the day of the week we have to add 4
+     * and take the modulo by 7. */
+    tmp->tm_wday = (days+4)%7;
+
+    /* Calculate the current year. */
+    tmp->tm_year = 1970;
+    while(1) {
+        /* Leap years have one day more. */
+        time_t days_this_year = 365 + is_leap_year(tmp->tm_year);
+        if (days_this_year > days) break;
+        days -= days_this_year;
+        tmp->tm_year++;
+    }
+    tmp->tm_yday = days;  /* Number of day of the current year. */
+
+    /* We need to calculate in which month and day of the month we are. To do
+     * so we need to skip days according to how many days there are in each
+     * month, and adjust for the leap year that has one more day in February. */
+    int mdays[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+    mdays[1] += is_leap_year(tmp->tm_year);
+
+    tmp->tm_mon = 0;
+    while(days >= mdays[tmp->tm_mon]) {
+        days -= mdays[tmp->tm_mon];
+        tmp->tm_mon++;
+    }
+
+    tmp->tm_mday = days+1;  /* Add 1 since our 'days' is zero-based. */
+    tmp->tm_year -= 1900;   /* Surprisingly tm_year is year-1900. */
+}
+
+#ifdef LOCALTIME_TEST_MAIN
+#include <stdio.h>
+
+int main(void) {
+    /* Obtain timezone and daylight info. */
+    tzset(); /* Now 'timezome' global is populated. */
+    time_t t = time(NULL);
+    struct tm *aux = localtime(&t);
+    int daylight_active = aux->tm_isdst;
+
+    struct tm tm;
+    char buf[1024];
+
+    nolocks_localtime(&tm,t,timezone,daylight_active);
+    strftime(buf,sizeof(buf),"%d %b %H:%M:%S",&tm);
+    printf("[timezone: %d, dl: %d] %s\n", (int)timezone, (int)daylight_active, buf);
+}
+#endif
diff --git a/redis-stable/src/lolwut.c b/redis-stable/src/lolwut.c
new file mode 100644
index 00000000..931f311c
--- /dev/null
+++ b/redis-stable/src/lolwut.c
@@ -0,0 +1,188 @@
+/*
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * This file implements the LOLWUT command. The command should do something
+ * fun and interesting, and should be replaced by a new implementation at
+ * each new version of Redis.
+ */
+
+#include "server.h"
+#include "lolwut.h"
+#include <math.h>
+
+void lolwut5Command(client *c);
+void lolwut6Command(client *c);
+
+/* The default target for LOLWUT if no matching version was found.
+ * This is what unstable versions of Redis will display. */
+void lolwutUnstableCommand(client *c) {
+    sds rendered = sdsnew("Redis ver. ");
+    rendered = sdscat(rendered,REDIS_VERSION);
+    rendered = sdscatlen(rendered,"\n",1);
+    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
+    sdsfree(rendered);
+}
+
+/* LOLWUT [VERSION <version>] [... version specific arguments ...] */
+void lolwutCommand(client *c) {
+    char *v = REDIS_VERSION;
+    char verstr[64];
+
+    if (c->argc >= 3 && !strcasecmp(c->argv[1]->ptr,"version")) {
+        long ver;
+        if (getLongFromObjectOrReply(c,c->argv[2],&ver,NULL) != C_OK) return;
+        snprintf(verstr,sizeof(verstr),"%u.0.0",(unsigned int)ver);
+        v = verstr;
+
+        /* Adjust argv/argc to filter the "VERSION ..." option, since the
+         * specific LOLWUT version implementations don't know about it
+         * and expect their arguments. */
+        c->argv += 2;
+        c->argc -= 2;
+    }
+
+    if ((v[0] == '5' && v[1] == '.' && v[2] != '9') ||
+        (v[0] == '4' && v[1] == '.' && v[2] == '9'))
+        lolwut5Command(c);
+    else if ((v[0] == '6' && v[1] == '.' && v[2] != '9') ||
+             (v[0] == '5' && v[1] == '.' && v[2] == '9'))
+        lolwut6Command(c);
+    else
+        lolwutUnstableCommand(c);
+
+    /* Fix back argc/argv in case of VERSION argument. */
+    if (v == verstr) {
+        c->argv -= 2;
+        c->argc += 2;
+    }
+}
+
+/* ========================== LOLWUT Canvase ===============================
+ * Many LOLWUT versions will likely print some computer art to the screen.
+ * This is the case with LOLWUT 5 and LOLWUT 6, so here there is a generic
+ * canvas implementation that can be reused.  */
+
+/* Allocate and return a new canvas of the specified size. */
+lwCanvas *lwCreateCanvas(int width, int height, int bgcolor) {
+    lwCanvas *canvas = zmalloc(sizeof(*canvas));
+    canvas->width = width;
+    canvas->height = height;
+    canvas->pixels = zmalloc((size_t)width*height);
+    memset(canvas->pixels,bgcolor,(size_t)width*height);
+    return canvas;
+}
+
+/* Free the canvas created by lwCreateCanvas(). */
+void lwFreeCanvas(lwCanvas *canvas) {
+    zfree(canvas->pixels);
+    zfree(canvas);
+}
+
+/* Set a pixel to the specified color. Color is 0 or 1, where zero means no
+ * dot will be displayed, and 1 means dot will be displayed.
+ * Coordinates are arranged so that left-top corner is 0,0. You can write
+ * out of the size of the canvas without issues. */
+void lwDrawPixel(lwCanvas *canvas, int x, int y, int color) {
+    if (x < 0 || x >= canvas->width ||
+        y < 0 || y >= canvas->height) return;
+    canvas->pixels[x+y*canvas->width] = color;
+}
+
+/* Return the value of the specified pixel on the canvas. */
+int lwGetPixel(lwCanvas *canvas, int x, int y) {
+    if (x < 0 || x >= canvas->width ||
+        y < 0 || y >= canvas->height) return 0;
+    return canvas->pixels[x+y*canvas->width];
+}
+
+/* Draw a line from x1,y1 to x2,y2 using the Bresenham algorithm. */
+void lwDrawLine(lwCanvas *canvas, int x1, int y1, int x2, int y2, int color) {
+    int dx = abs(x2-x1);
+    int dy = abs(y2-y1);
+    int sx = (x1 < x2) ? 1 : -1;
+    int sy = (y1 < y2) ? 1 : -1;
+    int err = dx-dy, e2;
+
+    while(1) {
+        lwDrawPixel(canvas,x1,y1,color);
+        if (x1 == x2 && y1 == y2) break;
+        e2 = err*2;
+        if (e2 > -dy) {
+            err -= dy;
+            x1 += sx;
+        }
+        if (e2 < dx) {
+            err += dx;
+            y1 += sy;
+        }
+    }
+}
+
+/* Draw a square centered at the specified x,y coordinates, with the specified
+ * rotation angle and size. In order to write a rotated square, we use the
+ * trivial fact that the parametric equation:
+ *
+ *  x = sin(k)
+ *  y = cos(k)
+ *
+ * Describes a circle for values going from 0 to 2*PI. So basically if we start
+ * at 45 degrees, that is k = PI/4, with the first point, and then we find
+ * the other three points incrementing K by PI/2 (90 degrees), we'll have the
+ * points of the square. In order to rotate the square, we just start with
+ * k = PI/4 + rotation_angle, and we are done.
+ *
+ * Of course the vanilla equations above will describe the square inside a
+ * circle of radius 1, so in order to draw larger squares we'll have to
+ * multiply the obtained coordinates, and then translate them. However this
+ * is much simpler than implementing the abstract concept of 2D shape and then
+ * performing the rotation/translation transformation, so for LOLWUT it's
+ * a good approach. */
+void lwDrawSquare(lwCanvas *canvas, int x, int y, float size, float angle, int color) {
+    int px[4], py[4];
+
+    /* Adjust the desired size according to the fact that the square inscribed
+     * into a circle of radius 1 has the side of length SQRT(2). This way
+     * size becomes a simple multiplication factor we can use with our
+     * coordinates to magnify them. */
+    size /= 1.4142135623;
+    size = round(size);
+
+    /* Compute the four points. */
+    float k = M_PI/4 + angle;
+    for (int j = 0; j < 4; j++) {
+        px[j] = round(sin(k) * size + x);
+        py[j] = round(cos(k) * size + y);
+        k += M_PI/2;
+    }
+
+    /* Draw the square. */
+    for (int j = 0; j < 4; j++)
+        lwDrawLine(canvas,px[j],py[j],px[(j+1)%4],py[(j+1)%4],color);
+}
diff --git a/redis-stable/src/lolwut.h b/redis-stable/src/lolwut.h
new file mode 100644
index 00000000..682d0053
--- /dev/null
+++ b/redis-stable/src/lolwut.h
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2018-2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* This structure represents our canvas. Drawing functions will take a pointer
+ * to a canvas to write to it. Later the canvas can be rendered to a string
+ * suitable to be printed on the screen, using unicode Braille characters. */
+
+/* This represents a very simple generic canvas in order to draw stuff.
+ * It's up to each LOLWUT versions to translate what they draw to the
+ * screen, depending on the result to accomplish. */
+
+#ifndef __LOLWUT_H
+#define __LOLWUT_H
+
+typedef struct lwCanvas {
+    int width;
+    int height;
+    char *pixels;
+} lwCanvas;
+
+/* Drawing functions implemented inside lolwut.c. */
+lwCanvas *lwCreateCanvas(int width, int height, int bgcolor);
+void lwFreeCanvas(lwCanvas *canvas);
+void lwDrawPixel(lwCanvas *canvas, int x, int y, int color);
+int lwGetPixel(lwCanvas *canvas, int x, int y);
+void lwDrawLine(lwCanvas *canvas, int x1, int y1, int x2, int y2, int color);
+void lwDrawSquare(lwCanvas *canvas, int x, int y, float size, float angle, int color);
+
+#endif
diff --git a/redis-stable/src/lolwut5.c b/redis-stable/src/lolwut5.c
new file mode 100644
index 00000000..d864888b
--- /dev/null
+++ b/redis-stable/src/lolwut5.c
@@ -0,0 +1,177 @@
+/*
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * This file implements the LOLWUT command. The command should do something
+ * fun and interesting, and should be replaced by a new implementation at
+ * each new version of Redis.
+ */
+
+#include "server.h"
+#include "lolwut.h"
+#include <math.h>
+
+/* Translate a group of 8 pixels (2x4 vertical rectangle) to the corresponding
+ * braille character. The byte should correspond to the pixels arranged as
+ * follows, where 0 is the least significant bit, and 7 the most significant
+ * bit:
+ *
+ *   0 3
+ *   1 4
+ *   2 5
+ *   6 7
+ *
+ * The corresponding utf8 encoded character is set into the three bytes
+ * pointed by 'output'.
+ */
+#include <stdio.h>
+void lwTranslatePixelsGroup(int byte, char *output) {
+    int code = 0x2800 + byte;
+    /* Convert to unicode. This is in the U0800-UFFFF range, so we need to
+     * emit it like this in three bytes:
+     * 1110xxxx 10xxxxxx 10xxxxxx. */
+    output[0] = 0xE0 | (code >> 12);          /* 1110-xxxx */
+    output[1] = 0x80 | ((code >> 6) & 0x3F);  /* 10-xxxxxx */
+    output[2] = 0x80 | (code & 0x3F);         /* 10-xxxxxx */
+}
+
+/* Schotter, the output of LOLWUT of Redis 5, is a computer graphic art piece
+ * generated by Georg Nees in the 60s. It explores the relationship between
+ * caos and order.
+ *
+ * The function creates the canvas itself, depending on the columns available
+ * in the output display and the number of squares per row and per column
+ * requested by the caller. */
+lwCanvas *lwDrawSchotter(int console_cols, int squares_per_row, int squares_per_col) {
+    /* Calculate the canvas size. */
+    int canvas_width = console_cols*2;
+    int padding = canvas_width > 4 ? 2 : 0;
+    float square_side = (float)(canvas_width-padding*2) / squares_per_row;
+    int canvas_height = square_side * squares_per_col + padding*2;
+    lwCanvas *canvas = lwCreateCanvas(canvas_width, canvas_height, 0);
+
+    for (int y = 0; y < squares_per_col; y++) {
+        for (int x = 0; x < squares_per_row; x++) {
+            int sx = x * square_side + square_side/2 + padding;
+            int sy = y * square_side + square_side/2 + padding;
+            /* Rotate and translate randomly as we go down to lower
+             * rows. */
+            float angle = 0;
+            if (y > 1) {
+                float r1 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
+                float r2 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
+                float r3 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
+                if (rand() % 2) r1 = -r1;
+                if (rand() % 2) r2 = -r2;
+                if (rand() % 2) r3 = -r3;
+                angle = r1;
+                sx += r2*square_side/3;
+                sy += r3*square_side/3;
+            }
+            lwDrawSquare(canvas,sx,sy,square_side,angle,1);
+        }
+    }
+
+    return canvas;
+}
+
+/* Converts the canvas to an SDS string representing the UTF8 characters to
+ * print to the terminal in order to obtain a graphical representaiton of the
+ * logical canvas. The actual returned string will require a terminal that is
+ * width/2 large and height/4 tall in order to hold the whole image without
+ * overflowing or scrolling, since each Barille character is 2x4. */
+static sds renderCanvas(lwCanvas *canvas) {
+    sds text = sdsempty();
+    for (int y = 0; y < canvas->height; y += 4) {
+        for (int x = 0; x < canvas->width; x += 2) {
+            /* We need to emit groups of 8 bits according to a specific
+             * arrangement. See lwTranslatePixelsGroup() for more info. */
+            int byte = 0;
+            if (lwGetPixel(canvas,x,y)) byte |= (1<<0);
+            if (lwGetPixel(canvas,x,y+1)) byte |= (1<<1);
+            if (lwGetPixel(canvas,x,y+2)) byte |= (1<<2);
+            if (lwGetPixel(canvas,x+1,y)) byte |= (1<<3);
+            if (lwGetPixel(canvas,x+1,y+1)) byte |= (1<<4);
+            if (lwGetPixel(canvas,x+1,y+2)) byte |= (1<<5);
+            if (lwGetPixel(canvas,x,y+3)) byte |= (1<<6);
+            if (lwGetPixel(canvas,x+1,y+3)) byte |= (1<<7);
+            char unicode[3];
+            lwTranslatePixelsGroup(byte,unicode);
+            text = sdscatlen(text,unicode,3);
+        }
+        if (y != canvas->height-1) text = sdscatlen(text,"\n",1);
+    }
+    return text;
+}
+
+/* The LOLWUT command:
+ *
+ * LOLWUT [terminal columns] [squares-per-row] [squares-per-col]
+ *
+ * By default the command uses 66 columns, 8 squares per row, 12 squares
+ * per column.
+ */
+void lolwut5Command(client *c) {
+    long cols = 66;
+    long squares_per_row = 8;
+    long squares_per_col = 12;
+
+    /* Parse the optional arguments if any. */
+    if (c->argc > 1 &&
+        getLongFromObjectOrReply(c,c->argv[1],&cols,NULL) != C_OK)
+        return;
+
+    if (c->argc > 2 &&
+        getLongFromObjectOrReply(c,c->argv[2],&squares_per_row,NULL) != C_OK)
+        return;
+
+    if (c->argc > 3 &&
+        getLongFromObjectOrReply(c,c->argv[3],&squares_per_col,NULL) != C_OK)
+        return;
+
+    /* Limits. We want LOLWUT to be always reasonably fast and cheap to execute
+     * so we have maximum number of columns, rows, and output resolution. */
+    if (cols < 1) cols = 1;
+    if (cols > 1000) cols = 1000;
+    if (squares_per_row < 1) squares_per_row = 1;
+    if (squares_per_row > 200) squares_per_row = 200;
+    if (squares_per_col < 1) squares_per_col = 1;
+    if (squares_per_col > 200) squares_per_col = 200;
+
+    /* Generate some computer art and reply. */
+    lwCanvas *canvas = lwDrawSchotter(cols,squares_per_row,squares_per_col);
+    sds rendered = renderCanvas(canvas);
+    rendered = sdscat(rendered,
+        "\nGeorg Nees - schotter, plotter on paper, 1968. Redis ver. ");
+    rendered = sdscat(rendered,REDIS_VERSION);
+    rendered = sdscatlen(rendered,"\n",1);
+    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
+    sdsfree(rendered);
+    lwFreeCanvas(canvas);
+}
diff --git a/redis-stable/src/lolwut6.c b/redis-stable/src/lolwut6.c
new file mode 100644
index 00000000..471bf66c
--- /dev/null
+++ b/redis-stable/src/lolwut6.c
@@ -0,0 +1,201 @@
+/*
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * This file implements the LOLWUT command. The command should do something
+ * fun and interesting, and should be replaced by a new implementation at
+ * each new version of Redis.
+ *
+ * Thanks to Michele Hiki Falcone for the original image that ispired
+ * the image, part of his game, Plaguemon.
+ *
+ * Thanks to the Shhh computer art collective for the help in tuning the
+ * output to have a better artistic effect.
+ */
+
+#include "server.h"
+#include "lolwut.h"
+
+/* Render the canvas using the four gray levels of the standard color
+ * terminal: they match very well to the grayscale display of the gameboy. */
+static sds renderCanvas(lwCanvas *canvas) {
+    sds text = sdsempty();
+    for (int y = 0; y < canvas->height; y++) {
+        for (int x = 0; x < canvas->width; x++) {
+            int color = lwGetPixel(canvas,x,y);
+            char *ce; /* Color escape sequence. */
+
+            /* Note that we set both the foreground and background color.
+             * This way we are able to get a more consistent result among
+             * different terminals implementations. */
+            switch(color) {
+            case 0: ce = "0;30;40m"; break;    /* Black */
+            case 1: ce = "0;90;100m"; break;   /* Gray 1 */
+            case 2: ce = "0;37;47m"; break;    /* Gray 2 */
+            case 3: ce = "0;97;107m"; break;   /* White */
+            default: ce = "0;30;40m"; break;   /* Just for safety. */
+            }
+            text = sdscatprintf(text,"\033[%s \033[0m",ce);
+        }
+        if (y != canvas->height-1) text = sdscatlen(text,"\n",1);
+    }
+    return text;
+}
+
+/* Draw a skyscraper on the canvas, according to the parameters in the
+ * 'skyscraper' structure. Window colors are random and are always one
+ * of the two grays. */
+struct skyscraper {
+    int xoff;       /* X offset. */
+    int width;      /* Pixels width. */
+    int height;     /* Pixels height. */
+    int windows;    /* Draw windows if true. */
+    int color;      /* Color of the skyscraper. */
+};
+
+void generateSkyscraper(lwCanvas *canvas, struct skyscraper *si) {
+    int starty = canvas->height-1;
+    int endy = starty - si->height + 1;
+    for (int y = starty; y >= endy; y--) {
+        for (int x = si->xoff; x < si->xoff+si->width; x++) {
+            /* The roof is four pixels less wide. */
+            if (y == endy && (x <= si->xoff+1 || x >= si->xoff+si->width-2))
+                continue;
+            int color = si->color;
+            /* Alter the color if this is a place where we want to
+             * draw a window. We check that we are in the inner part of the
+             * skyscraper, so that windows are far from the borders. */
+            if (si->windows &&
+                x > si->xoff+1 &&
+                x < si->xoff+si->width-2 &&
+                y > endy+1 &&
+                y < starty-1)
+            {
+                /* Calculate the x,y position relative to the start of
+                 * the window area. */
+                int relx = x - (si->xoff+1);
+                int rely = y - (endy+1);
+
+                /* Note that we want the windows to be two pixels wide
+                 * but just one pixel tall, because terminal "pixels"
+                 * (characters) are not square. */
+                if (relx/2 % 2 && rely % 2) {
+                    do {
+                        color = 1 + rand() % 2;
+                    } while (color == si->color);
+                    /* Except we want adjacent pixels creating the same
+                     * window to be the same color. */
+                    if (relx % 2) color = lwGetPixel(canvas,x-1,y);
+                }
+            }
+            lwDrawPixel(canvas,x,y,color);
+        }
+    }
+}
+
+/* Generate a skyline inspired by the parallax backgrounds of 8 bit games. */
+void generateSkyline(lwCanvas *canvas) {
+    struct skyscraper si;
+
+    /* First draw the background skyscraper without windows, using the
+     * two different grays. We use two passes to make sure that the lighter
+     * ones are always in the background. */
+    for (int color = 2; color >= 1; color--) {
+        si.color = color;
+        for (int offset = -10; offset < canvas->width;) {
+            offset += rand() % 8;
+            si.xoff = offset;
+            si.width = 10 + rand()%9;
+            if (color == 2)
+                si.height = canvas->height/2 + rand()%canvas->height/2;
+            else
+                si.height = canvas->height/2 + rand()%canvas->height/3;
+            si.windows = 0;
+            generateSkyscraper(canvas, &si);
+            if (color == 2)
+                offset += si.width/2;
+            else
+                offset += si.width+1;
+        }
+    }
+
+    /* Now draw the foreground skyscraper with the windows. */
+    si.color = 0;
+    for (int offset = -10; offset < canvas->width;) {
+        offset += rand() % 8;
+        si.xoff = offset;
+        si.width = 5 + rand()%14;
+        if (si.width % 4) si.width += (si.width % 3);
+        si.height = canvas->height/3 + rand()%canvas->height/2;
+        si.windows = 1;
+        generateSkyscraper(canvas, &si);
+        offset += si.width+5;
+    }
+}
+
+/* The LOLWUT 6 command:
+ *
+ * LOLWUT [columns] [rows]
+ *
+ * By default the command uses 80 columns, 40 squares per row
+ * per column.
+ */
+void lolwut6Command(client *c) {
+    long cols = 80;
+    long rows = 20;
+
+    /* Parse the optional arguments if any. */
+    if (c->argc > 1 &&
+        getLongFromObjectOrReply(c,c->argv[1],&cols,NULL) != C_OK)
+        return;
+
+    if (c->argc > 2 &&
+        getLongFromObjectOrReply(c,c->argv[2],&rows,NULL) != C_OK)
+        return;
+
+    /* Limits. We want LOLWUT to be always reasonably fast and cheap to execute
+     * so we have maximum number of columns, rows, and output resulution. */
+    if (cols < 1) cols = 1;
+    if (cols > 1000) cols = 1000;
+    if (rows < 1) rows = 1;
+    if (rows > 1000) rows = 1000;
+
+    /* Generate the city skyline and reply. */
+    lwCanvas *canvas = lwCreateCanvas(cols,rows,3);
+    generateSkyline(canvas);
+    sds rendered = renderCanvas(canvas);
+    rendered = sdscat(rendered,
+        "\nDedicated to the 8 bit game developers of past and present.\n"
+        "Original 8 bit image from Plaguemon by hikikomori. Redis ver. ");
+    rendered = sdscat(rendered,REDIS_VERSION);
+    rendered = sdscatlen(rendered,"\n",1);
+    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
+    sdsfree(rendered);
+    lwFreeCanvas(canvas);
+}
diff --git a/redis-stable/src/lzf.h b/redis-stable/src/lzf.h
new file mode 100644
index 00000000..98e038f3
--- /dev/null
+++ b/redis-stable/src/lzf.h
@@ -0,0 +1,100 @@
+/*
+ * Copyright (c) 2000-2008 Marc Alexander Lehmann <schmorp@schmorp.de>
+ *
+ * Redistribution and use in source and binary forms, with or without modifica-
+ * tion, are permitted provided that the following conditions are met:
+ *
+ *   1.  Redistributions of source code must retain the above copyright notice,
+ *       this list of conditions and the following disclaimer.
+ *
+ *   2.  Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
+ * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+ * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
+ * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
+ * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * Alternatively, the contents of this file may be used under the terms of
+ * the GNU General Public License ("GPL") version 2 or any later version,
+ * in which case the provisions of the GPL are applicable instead of
+ * the above. If you wish to allow the use of your version of this file
+ * only under the terms of the GPL and not to allow others to use your
+ * version of this file under the BSD license, indicate your decision
+ * by deleting the provisions above and replace them with the notice
+ * and other provisions required by the GPL. If you do not delete the
+ * provisions above, a recipient may use your version of this file under
+ * either the BSD or the GPL.
+ */
+
+#ifndef LZF_H
+#define LZF_H
+
+/***********************************************************************
+**
+**	lzf -- an extremely fast/free compression/decompression-method
+**	http://liblzf.plan9.de/
+**
+**	This algorithm is believed to be patent-free.
+**
+***********************************************************************/
+
+#define LZF_VERSION 0x0105 /* 1.5, API version */
+
+/*
+ * Compress in_len bytes stored at the memory block starting at
+ * in_data and write the result to out_data, up to a maximum length
+ * of out_len bytes.
+ *
+ * If the output buffer is not large enough or any error occurs return 0,
+ * otherwise return the number of bytes used, which might be considerably
+ * more than in_len (but less than 104% of the original size), so it
+ * makes sense to always use out_len == in_len - 1), to ensure _some_
+ * compression, and store the data uncompressed otherwise (with a flag, of
+ * course.
+ *
+ * lzf_compress might use different algorithms on different systems and
+ * even different runs, thus might result in different compressed strings
+ * depending on the phase of the moon or similar factors. However, all
+ * these strings are architecture-independent and will result in the
+ * original data when decompressed using lzf_decompress.
+ *
+ * The buffers must not be overlapping.
+ *
+ * If the option LZF_STATE_ARG is enabled, an extra argument must be
+ * supplied which is not reflected in this header file. Refer to lzfP.h
+ * and lzf_c.c.
+ *
+ */
+unsigned int
+lzf_compress (const void *const in_data,  unsigned int in_len,
+              void             *out_data, unsigned int out_len);
+
+/*
+ * Decompress data compressed with some version of the lzf_compress
+ * function and stored at location in_data and length in_len. The result
+ * will be stored at out_data up to a maximum of out_len characters.
+ *
+ * If the output buffer is not large enough to hold the decompressed
+ * data, a 0 is returned and errno is set to E2BIG. Otherwise the number
+ * of decompressed bytes (i.e. the original length of the data) is
+ * returned.
+ *
+ * If an error in the compressed data is detected, a zero is returned and
+ * errno is set to EINVAL.
+ *
+ * This function is very fast, about as fast as a copying loop.
+ */
+unsigned int
+lzf_decompress (const void *const in_data,  unsigned int in_len,
+                void             *out_data, unsigned int out_len);
+
+#endif
+
diff --git a/redis-stable/src/lzfP.h b/redis-stable/src/lzfP.h
new file mode 100644
index 00000000..78c858fa
--- /dev/null
+++ b/redis-stable/src/lzfP.h
@@ -0,0 +1,189 @@
+/*
+ * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
+ *
+ * Redistribution and use in source and binary forms, with or without modifica-
+ * tion, are permitted provided that the following conditions are met:
+ *
+ *   1.  Redistributions of source code must retain the above copyright notice,
+ *       this list of conditions and the following disclaimer.
+ *
+ *   2.  Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
+ * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+ * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
+ * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
+ * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * Alternatively, the contents of this file may be used under the terms of
+ * the GNU General Public License ("GPL") version 2 or any later version,
+ * in which case the provisions of the GPL are applicable instead of
+ * the above. If you wish to allow the use of your version of this file
+ * only under the terms of the GPL and not to allow others to use your
+ * version of this file under the BSD license, indicate your decision
+ * by deleting the provisions above and replace them with the notice
+ * and other provisions required by the GPL. If you do not delete the
+ * provisions above, a recipient may use your version of this file under
+ * either the BSD or the GPL.
+ */
+
+#ifndef LZFP_h
+#define LZFP_h
+
+#define STANDALONE 1 /* at the moment, this is ok. */
+
+#ifndef STANDALONE
+# include "lzf.h"
+#endif
+
+/*
+ * Size of hashtable is (1 << HLOG) * sizeof (char *)
+ * decompression is independent of the hash table size
+ * the difference between 15 and 14 is very small
+ * for small blocks (and 14 is usually a bit faster).
+ * For a low-memory/faster configuration, use HLOG == 13;
+ * For best compression, use 15 or 16 (or more, up to 22).
+ */
+#ifndef HLOG
+# define HLOG 16
+#endif
+
+/*
+ * Sacrifice very little compression quality in favour of compression speed.
+ * This gives almost the same compression as the default code, and is
+ * (very roughly) 15% faster. This is the preferred mode of operation.
+ */
+#ifndef VERY_FAST
+# define VERY_FAST 1
+#endif
+
+/*
+ * Sacrifice some more compression quality in favour of compression speed.
+ * (roughly 1-2% worse compression for large blocks and
+ * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
+ * In short: when in need for speed, enable this for binary data,
+ * possibly disable this for text data.
+ */
+#ifndef ULTRA_FAST
+# define ULTRA_FAST 0
+#endif
+
+/*
+ * Unconditionally aligning does not cost very much, so do it if unsure
+ */
+#ifndef STRICT_ALIGN
+# if !(defined(__i386) || defined (__amd64))
+#  define STRICT_ALIGN 1
+# else
+#  define STRICT_ALIGN 0
+# endif
+#endif
+
+/*
+ * You may choose to pre-set the hash table (might be faster on some
+ * modern cpus and large (>>64k) blocks, and also makes compression
+ * deterministic/repeatable when the configuration otherwise is the same).
+ */
+#ifndef INIT_HTAB
+# define INIT_HTAB 0
+#endif
+
+/*
+ * Avoid assigning values to errno variable? for some embedding purposes
+ * (linux kernel for example), this is necessary. NOTE: this breaks
+ * the documentation in lzf.h. Avoiding errno has no speed impact.
+ */
+#ifndef AVOID_ERRNO
+# define AVOID_ERRNO 0
+#endif
+
+/*
+ * Whether to pass the LZF_STATE variable as argument, or allocate it
+ * on the stack. For small-stack environments, define this to 1.
+ * NOTE: this breaks the prototype in lzf.h.
+ */
+#ifndef LZF_STATE_ARG
+# define LZF_STATE_ARG 0
+#endif
+
+/*
+ * Whether to add extra checks for input validity in lzf_decompress
+ * and return EINVAL if the input stream has been corrupted. This
+ * only shields against overflowing the input buffer and will not
+ * detect most corrupted streams.
+ * This check is not normally noticeable on modern hardware
+ * (<1% slowdown), but might slow down older cpus considerably.
+ */
+#ifndef CHECK_INPUT
+# define CHECK_INPUT 1
+#endif
+
+/*
+ * Whether to store pointers or offsets inside the hash table. On
+ * 64 bit architectures, pointers take up twice as much space,
+ * and might also be slower. Default is to autodetect.
+ */
+/*#define LZF_USER_OFFSETS autodetect */
+
+/*****************************************************************************/
+/* nothing should be changed below */
+
+#ifdef __cplusplus
+# include <cstring>
+# include <climits>
+using namespace std;
+#else
+# include <string.h>
+# include <limits.h>
+#endif
+
+#ifndef LZF_USE_OFFSETS
+# if defined (WIN32)
+#  define LZF_USE_OFFSETS defined(_M_X64)
+# else
+#  if __cplusplus > 199711L
+#   include <cstdint>
+#  else
+#   include <stdint.h>
+#  endif
+#  define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
+# endif
+#endif
+
+typedef unsigned char u8;
+
+#if LZF_USE_OFFSETS
+# define LZF_HSLOT_BIAS ((const u8 *)in_data)
+  typedef unsigned int LZF_HSLOT;
+#else
+# define LZF_HSLOT_BIAS 0
+  typedef const u8 *LZF_HSLOT;
+#endif
+
+typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
+
+#if !STRICT_ALIGN
+/* for unaligned accesses we need a 16 bit datatype. */
+# if USHRT_MAX == 65535
+    typedef unsigned short u16;
+# elif UINT_MAX == 65535
+    typedef unsigned int u16;
+# else
+#  undef STRICT_ALIGN
+#  define STRICT_ALIGN 1
+# endif
+#endif
+
+#if ULTRA_FAST
+# undef VERY_FAST
+#endif
+
+#endif
+
diff --git a/redis-stable/src/lzf_c.c b/redis-stable/src/lzf_c.c
new file mode 100644
index 00000000..e9c69a0b
--- /dev/null
+++ b/redis-stable/src/lzf_c.c
@@ -0,0 +1,291 @@
+/*
+ * Copyright (c) 2000-2010 Marc Alexander Lehmann <schmorp@schmorp.de>
+ *
+ * Redistribution and use in source and binary forms, with or without modifica-
+ * tion, are permitted provided that the following conditions are met:
+ *
+ *   1.  Redistributions of source code must retain the above copyright notice,
+ *       this list of conditions and the following disclaimer.
+ *
+ *   2.  Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
+ * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+ * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
+ * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
+ * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * Alternatively, the contents of this file may be used under the terms of
+ * the GNU General Public License ("GPL") version 2 or any later version,
+ * in which case the provisions of the GPL are applicable instead of
+ * the above. If you wish to allow the use of your version of this file
+ * only under the terms of the GPL and not to allow others to use your
+ * version of this file under the BSD license, indicate your decision
+ * by deleting the provisions above and replace them with the notice
+ * and other provisions required by the GPL. If you do not delete the
+ * provisions above, a recipient may use your version of this file under
+ * either the BSD or the GPL.
+ */
+
+#include "lzfP.h"
+
+#define HSIZE (1 << (HLOG))
+
+/*
+ * don't play with this unless you benchmark!
+ * the data format is not dependent on the hash function.
+ * the hash function might seem strange, just believe me,
+ * it works ;)
+ */
+#ifndef FRST
+# define FRST(p) (((p[0]) << 8) | p[1])
+# define NEXT(v,p) (((v) << 8) | p[2])
+# if ULTRA_FAST
+#  define IDX(h) ((( h             >> (3*8 - HLOG)) - h  ) & (HSIZE - 1))
+# elif VERY_FAST
+#  define IDX(h) ((( h             >> (3*8 - HLOG)) - h*5) & (HSIZE - 1))
+# else
+#  define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1))
+# endif
+#endif
+/*
+ * IDX works because it is very similar to a multiplicative hash, e.g.
+ * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1))
+ * the latter is also quite fast on newer CPUs, and compresses similarly.
+ *
+ * the next one is also quite good, albeit slow ;)
+ * (int)(cos(h & 0xffffff) * 1e6)
+ */
+
+#if 0
+/* original lzv-like hash function, much worse and thus slower */
+# define FRST(p) (p[0] << 5) ^ p[1]
+# define NEXT(v,p) ((v) << 5) ^ p[2]
+# define IDX(h) ((h) & (HSIZE - 1))
+#endif
+
+#define        MAX_LIT        (1 <<  5)
+#define        MAX_OFF        (1 << 13)
+#define        MAX_REF        ((1 << 8) + (1 << 3))
+
+#if __GNUC__ >= 3
+# define expect(expr,value)         __builtin_expect ((expr),(value))
+# define inline                     inline
+#else
+# define expect(expr,value)         (expr)
+# define inline                     static
+#endif
+
+#define expect_false(expr) expect ((expr) != 0, 0)
+#define expect_true(expr)  expect ((expr) != 0, 1)
+
+/*
+ * compressed format
+ *
+ * 000LLLLL <L+1>    ; literal, L+1=1..33 octets
+ * LLLooooo oooooooo ; backref L+1=1..7 octets, o+1=1..4096 offset
+ * 111ooooo LLLLLLLL oooooooo ; backref L+8 octets, o+1=1..4096 offset
+ *
+ */
+
+unsigned int
+lzf_compress (const void *const in_data, unsigned int in_len,
+	      void *out_data, unsigned int out_len
+#if LZF_STATE_ARG
+              , LZF_STATE htab
+#endif
+              )
+{
+#if !LZF_STATE_ARG
+  LZF_STATE htab;
+#endif
+  const u8 *ip = (const u8 *)in_data;
+        u8 *op = (u8 *)out_data;
+  const u8 *in_end  = ip + in_len;
+        u8 *out_end = op + out_len;
+  const u8 *ref;
+
+  /* off requires a type wide enough to hold a general pointer difference.
+   * ISO C doesn't have that (size_t might not be enough and ptrdiff_t only
+   * works for differences within a single object). We also assume that no
+   * no bit pattern traps. Since the only platform that is both non-POSIX
+   * and fails to support both assumptions is windows 64 bit, we make a
+   * special workaround for it.
+   */
+#if defined (WIN32) && defined (_M_X64)
+  unsigned _int64 off; /* workaround for missing POSIX compliance */
+#else
+  unsigned long off;
+#endif
+  unsigned int hval;
+  int lit;
+
+  if (!in_len || !out_len)
+    return 0;
+
+#if INIT_HTAB
+  memset (htab, 0, sizeof (htab));
+#endif
+
+  lit = 0; op++; /* start run */
+
+  hval = FRST (ip);
+  while (ip < in_end - 2)
+    {
+      LZF_HSLOT *hslot;
+
+      hval = NEXT (hval, ip);
+      hslot = htab + IDX (hval);
+      ref = *hslot + LZF_HSLOT_BIAS; *hslot = ip - LZF_HSLOT_BIAS;
+
+      if (1
+#if INIT_HTAB
+          && ref < ip /* the next test will actually take care of this, but this is faster */
+#endif
+          && (off = ip - ref - 1) < MAX_OFF
+          && ref > (u8 *)in_data
+          && ref[2] == ip[2]
+#if STRICT_ALIGN
+          && ((ref[1] << 8) | ref[0]) == ((ip[1] << 8) | ip[0])
+#else
+          && *(u16 *)ref == *(u16 *)ip
+#endif
+        )
+        {
+          /* match found at *ref++ */
+          unsigned int len = 2;
+          unsigned int maxlen = in_end - ip - len;
+          maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
+
+          if (expect_false (op + 3 + 1 >= out_end)) /* first a faster conservative test */
+            if (op - !lit + 3 + 1 >= out_end) /* second the exact but rare test */
+              return 0;
+
+          op [- lit - 1] = lit - 1; /* stop run */
+          op -= !lit; /* undo run if length is zero */
+
+          for (;;)
+            {
+              if (expect_true (maxlen > 16))
+                {
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                  len++; if (ref [len] != ip [len]) break;
+                }
+
+              do
+                len++;
+              while (len < maxlen && ref[len] == ip[len]);
+
+              break;
+            }
+
+          len -= 2; /* len is now #octets - 1 */
+          ip++;
+
+          if (len < 7)
+            {
+              *op++ = (off >> 8) + (len << 5);
+            }
+          else
+            {
+              *op++ = (off >> 8) + (  7 << 5);
+              *op++ = len - 7;
+            }
+
+          *op++ = off;
+
+          lit = 0; op++; /* start run */
+
+          ip += len + 1;
+
+          if (expect_false (ip >= in_end - 2))
+            break;
+
+#if ULTRA_FAST || VERY_FAST
+          --ip;
+# if VERY_FAST && !ULTRA_FAST
+          --ip;
+# endif
+          hval = FRST (ip);
+
+          hval = NEXT (hval, ip);
+          htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
+          ip++;
+
+# if VERY_FAST && !ULTRA_FAST
+          hval = NEXT (hval, ip);
+          htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
+          ip++;
+# endif
+#else
+          ip -= len + 1;
+
+          do
+            {
+              hval = NEXT (hval, ip);
+              htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
+              ip++;
+            }
+          while (len--);
+#endif
+        }
+      else
+        {
+          /* one more literal byte we must copy */
+          if (expect_false (op >= out_end))
+            return 0;
+
+          lit++; *op++ = *ip++;
+
+          if (expect_false (lit == MAX_LIT))
+            {
+              op [- lit - 1] = lit - 1; /* stop run */
+              lit = 0; op++; /* start run */
+            }
+        }
+    }
+
+  if (op + 3 > out_end) /* at most 3 bytes can be missing here */
+    return 0;
+
+  while (ip < in_end)
+    {
+      lit++; *op++ = *ip++;
+
+      if (expect_false (lit == MAX_LIT))
+        {
+          op [- lit - 1] = lit - 1; /* stop run */
+          lit = 0; op++; /* start run */
+        }
+    }
+
+  op [- lit - 1] = lit - 1; /* end run */
+  op -= !lit; /* undo run if length is zero */
+
+  return op - (u8 *)out_data;
+}
+
diff --git a/redis-stable/src/lzf_d.c b/redis-stable/src/lzf_d.c
new file mode 100644
index 00000000..dbf1ae77
--- /dev/null
+++ b/redis-stable/src/lzf_d.c
@@ -0,0 +1,191 @@
+/*
+ * Copyright (c) 2000-2010 Marc Alexander Lehmann <schmorp@schmorp.de>
+ *
+ * Redistribution and use in source and binary forms, with or without modifica-
+ * tion, are permitted provided that the following conditions are met:
+ *
+ *   1.  Redistributions of source code must retain the above copyright notice,
+ *       this list of conditions and the following disclaimer.
+ *
+ *   2.  Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
+ * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
+ * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
+ * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
+ * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * Alternatively, the contents of this file may be used under the terms of
+ * the GNU General Public License ("GPL") version 2 or any later version,
+ * in which case the provisions of the GPL are applicable instead of
+ * the above. If you wish to allow the use of your version of this file
+ * only under the terms of the GPL and not to allow others to use your
+ * version of this file under the BSD license, indicate your decision
+ * by deleting the provisions above and replace them with the notice
+ * and other provisions required by the GPL. If you do not delete the
+ * provisions above, a recipient may use your version of this file under
+ * either the BSD or the GPL.
+ */
+
+#include "lzfP.h"
+
+#if AVOID_ERRNO
+# define SET_ERRNO(n)
+#else
+# include <errno.h>
+# define SET_ERRNO(n) errno = (n)
+#endif
+
+#if USE_REP_MOVSB /* small win on amd, big loss on intel */
+#if (__i386 || __amd64) && __GNUC__ >= 3
+# define lzf_movsb(dst, src, len)                \
+   asm ("rep movsb"                              \
+        : "=D" (dst), "=S" (src), "=c" (len)     \
+        :  "0" (dst),  "1" (src),  "2" (len));
+#endif
+#endif
+
+#if defined(__GNUC__) && __GNUC__ >= 7
+#pragma GCC diagnostic push
+#pragma GCC diagnostic ignored "-Wimplicit-fallthrough"
+#endif
+unsigned int
+lzf_decompress (const void *const in_data,  unsigned int in_len,
+                void             *out_data, unsigned int out_len)
+{
+  u8 const *ip = (const u8 *)in_data;
+  u8       *op = (u8 *)out_data;
+  u8 const *const in_end  = ip + in_len;
+  u8       *const out_end = op + out_len;
+
+  while (ip < in_end)
+    {
+      unsigned int ctrl;
+      ctrl = *ip++;
+
+      if (ctrl < (1 << 5)) /* literal run */
+        {
+          ctrl++;
+
+          if (op + ctrl > out_end)
+            {
+              SET_ERRNO (E2BIG);
+              return 0;
+            }
+
+#if CHECK_INPUT
+          if (ip + ctrl > in_end)
+            {
+              SET_ERRNO (EINVAL);
+              return 0;
+            }
+#endif
+
+#ifdef lzf_movsb
+          lzf_movsb (op, ip, ctrl);
+#else
+          switch (ctrl)
+            {
+              case 32: *op++ = *ip++; case 31: *op++ = *ip++; case 30: *op++ = *ip++; case 29: *op++ = *ip++;
+              case 28: *op++ = *ip++; case 27: *op++ = *ip++; case 26: *op++ = *ip++; case 25: *op++ = *ip++;
+              case 24: *op++ = *ip++; case 23: *op++ = *ip++; case 22: *op++ = *ip++; case 21: *op++ = *ip++;
+              case 20: *op++ = *ip++; case 19: *op++ = *ip++; case 18: *op++ = *ip++; case 17: *op++ = *ip++;
+              case 16: *op++ = *ip++; case 15: *op++ = *ip++; case 14: *op++ = *ip++; case 13: *op++ = *ip++;
+              case 12: *op++ = *ip++; case 11: *op++ = *ip++; case 10: *op++ = *ip++; case  9: *op++ = *ip++;
+              case  8: *op++ = *ip++; case  7: *op++ = *ip++; case  6: *op++ = *ip++; case  5: *op++ = *ip++;
+              case  4: *op++ = *ip++; case  3: *op++ = *ip++; case  2: *op++ = *ip++; case  1: *op++ = *ip++;
+            }
+#endif
+        }
+      else /* back reference */
+        {
+          unsigned int len = ctrl >> 5;
+
+          u8 *ref = op - ((ctrl & 0x1f) << 8) - 1;
+
+#if CHECK_INPUT
+          if (ip >= in_end)
+            {
+              SET_ERRNO (EINVAL);
+              return 0;
+            }
+#endif
+          if (len == 7)
+            {
+              len += *ip++;
+#if CHECK_INPUT
+              if (ip >= in_end)
+                {
+                  SET_ERRNO (EINVAL);
+                  return 0;
+                }
+#endif
+            }
+
+          ref -= *ip++;
+
+          if (op + len + 2 > out_end)
+            {
+              SET_ERRNO (E2BIG);
+              return 0;
+            }
+
+          if (ref < (u8 *)out_data)
+            {
+              SET_ERRNO (EINVAL);
+              return 0;
+            }
+
+#ifdef lzf_movsb
+          len += 2;
+          lzf_movsb (op, ref, len);
+#else
+          switch (len)
+            {
+              default:
+                len += 2;
+
+                if (op >= ref + len)
+                  {
+                    /* disjunct areas */
+                    memcpy (op, ref, len);
+                    op += len;
+                  }
+                else
+                  {
+                    /* overlapping, use octte by octte copying */
+                    do
+                      *op++ = *ref++;
+                    while (--len);
+                  }
+
+                break;
+
+              case 9: *op++ = *ref++; /* fall-thru */
+              case 8: *op++ = *ref++; /* fall-thru */
+              case 7: *op++ = *ref++; /* fall-thru */
+              case 6: *op++ = *ref++; /* fall-thru */
+              case 5: *op++ = *ref++; /* fall-thru */
+              case 4: *op++ = *ref++; /* fall-thru */
+              case 3: *op++ = *ref++; /* fall-thru */
+              case 2: *op++ = *ref++; /* fall-thru */
+              case 1: *op++ = *ref++; /* fall-thru */
+              case 0: *op++ = *ref++; /* two octets more */
+                      *op++ = *ref++; /* fall-thru */
+            }
+#endif
+        }
+    }
+
+  return op - (u8 *)out_data;
+}
+#if defined(__GNUC__) && __GNUC__ >= 5
+#pragma GCC diagnostic pop
+#endif
diff --git a/redis-stable/src/memtest.c b/redis-stable/src/memtest.c
new file mode 100644
index 00000000..bc0ac3a6
--- /dev/null
+++ b/redis-stable/src/memtest.c
@@ -0,0 +1,365 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+#include <stdint.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+#include <limits.h>
+#include <errno.h>
+#include <termios.h>
+#include <sys/ioctl.h>
+#if defined(__sun)
+#include <stropts.h>
+#endif
+#include "config.h"
+
+#if (ULONG_MAX == 4294967295UL)
+#define MEMTEST_32BIT
+#elif (ULONG_MAX == 18446744073709551615ULL)
+#define MEMTEST_64BIT
+#else
+#error "ULONG_MAX value not supported."
+#endif
+
+#ifdef MEMTEST_32BIT
+#define ULONG_ONEZERO 0xaaaaaaaaUL
+#define ULONG_ZEROONE 0x55555555UL
+#else
+#define ULONG_ONEZERO 0xaaaaaaaaaaaaaaaaUL
+#define ULONG_ZEROONE 0x5555555555555555UL
+#endif
+
+static struct winsize ws;
+size_t progress_printed; /* Printed chars in screen-wide progress bar. */
+size_t progress_full; /* How many chars to write to fill the progress bar. */
+
+void memtest_progress_start(char *title, int pass) {
+    int j;
+
+    printf("\x1b[H\x1b[2J");    /* Cursor home, clear screen. */
+    /* Fill with dots. */
+    for (j = 0; j < ws.ws_col*(ws.ws_row-2); j++) printf(".");
+    printf("Please keep the test running several minutes per GB of memory.\n");
+    printf("Also check http://www.memtest86.com/ and http://pyropus.ca/software/memtester/");
+    printf("\x1b[H\x1b[2K");          /* Cursor home, clear current line.  */
+    printf("%s [%d]\n", title, pass); /* Print title. */
+    progress_printed = 0;
+    progress_full = (size_t)ws.ws_col*(ws.ws_row-3);
+    fflush(stdout);
+}
+
+void memtest_progress_end(void) {
+    printf("\x1b[H\x1b[2J");    /* Cursor home, clear screen. */
+}
+
+void memtest_progress_step(size_t curr, size_t size, char c) {
+    size_t chars = ((unsigned long long)curr*progress_full)/size, j;
+
+    for (j = 0; j < chars-progress_printed; j++) printf("%c",c);
+    progress_printed = chars;
+    fflush(stdout);
+}
+
+/* Test that addressing is fine. Every location is populated with its own
+ * address, and finally verified. This test is very fast but may detect
+ * ASAP big issues with the memory subsystem. */
+int memtest_addressing(unsigned long *l, size_t bytes, int interactive) {
+    unsigned long words = bytes/sizeof(unsigned long);
+    unsigned long j, *p;
+
+    /* Fill */
+    p = l;
+    for (j = 0; j < words; j++) {
+        *p = (unsigned long)p;
+        p++;
+        if ((j & 0xffff) == 0 && interactive)
+            memtest_progress_step(j,words*2,'A');
+    }
+    /* Test */
+    p = l;
+    for (j = 0; j < words; j++) {
+        if (*p != (unsigned long)p) {
+            if (interactive) {
+                printf("\n*** MEMORY ADDRESSING ERROR: %p contains %lu\n",
+                    (void*) p, *p);
+                exit(1);
+            }
+            return 1;
+        }
+        p++;
+        if ((j & 0xffff) == 0 && interactive)
+            memtest_progress_step(j+words,words*2,'A');
+    }
+    return 0;
+}
+
+/* Fill words stepping a single page at every write, so we continue to
+ * touch all the pages in the smallest amount of time reducing the
+ * effectiveness of caches, and making it hard for the OS to transfer
+ * pages on the swap.
+ *
+ * In this test we can't call rand() since the system may be completely
+ * unable to handle library calls, so we have to resort to our own
+ * PRNG that only uses local state. We use an xorshift* PRNG. */
+#define xorshift64star_next() do { \
+        rseed ^= rseed >> 12; \
+        rseed ^= rseed << 25; \
+        rseed ^= rseed >> 27; \
+        rout = rseed * UINT64_C(2685821657736338717); \
+} while(0)
+
+void memtest_fill_random(unsigned long *l, size_t bytes, int interactive) {
+    unsigned long step = 4096/sizeof(unsigned long);
+    unsigned long words = bytes/sizeof(unsigned long)/2;
+    unsigned long iwords = words/step;  /* words per iteration */
+    unsigned long off, w, *l1, *l2;
+    uint64_t rseed = UINT64_C(0xd13133de9afdb566); /* Just a random seed. */
+    uint64_t rout = 0;
+
+    assert((bytes & 4095) == 0);
+    for (off = 0; off < step; off++) {
+        l1 = l+off;
+        l2 = l1+words;
+        for (w = 0; w < iwords; w++) {
+            xorshift64star_next();
+            *l1 = *l2 = (unsigned long) rout;
+            l1 += step;
+            l2 += step;
+            if ((w & 0xffff) == 0 && interactive)
+                memtest_progress_step(w+iwords*off,words,'R');
+        }
+    }
+}
+
+/* Like memtest_fill_random() but uses the two specified values to fill
+ * memory, in an alternated way (v1|v2|v1|v2|...) */
+void memtest_fill_value(unsigned long *l, size_t bytes, unsigned long v1,
+                        unsigned long v2, char sym, int interactive)
+{
+    unsigned long step = 4096/sizeof(unsigned long);
+    unsigned long words = bytes/sizeof(unsigned long)/2;
+    unsigned long iwords = words/step;  /* words per iteration */
+    unsigned long off, w, *l1, *l2, v;
+
+    assert((bytes & 4095) == 0);
+    for (off = 0; off < step; off++) {
+        l1 = l+off;
+        l2 = l1+words;
+        v = (off & 1) ? v2 : v1;
+        for (w = 0; w < iwords; w++) {
+#ifdef MEMTEST_32BIT
+            *l1 = *l2 = ((unsigned long)     v) |
+                        (((unsigned long)    v) << 16);
+#else
+            *l1 = *l2 = ((unsigned long)     v) |
+                        (((unsigned long)    v) << 16) |
+                        (((unsigned long)    v) << 32) |
+                        (((unsigned long)    v) << 48);
+#endif
+            l1 += step;
+            l2 += step;
+            if ((w & 0xffff) == 0 && interactive)
+                memtest_progress_step(w+iwords*off,words,sym);
+        }
+    }
+}
+
+int memtest_compare(unsigned long *l, size_t bytes, int interactive) {
+    unsigned long words = bytes/sizeof(unsigned long)/2;
+    unsigned long w, *l1, *l2;
+
+    assert((bytes & 4095) == 0);
+    l1 = l;
+    l2 = l1+words;
+    for (w = 0; w < words; w++) {
+        if (*l1 != *l2) {
+            if (interactive) {
+                printf("\n*** MEMORY ERROR DETECTED: %p != %p (%lu vs %lu)\n",
+                    (void*)l1, (void*)l2, *l1, *l2);
+                exit(1);
+            }
+            return 1;
+        }
+        l1 ++;
+        l2 ++;
+        if ((w & 0xffff) == 0 && interactive)
+            memtest_progress_step(w,words,'=');
+    }
+    return 0;
+}
+
+int memtest_compare_times(unsigned long *m, size_t bytes, int pass, int times,
+                          int interactive)
+{
+    int j;
+    int errors = 0;
+
+    for (j = 0; j < times; j++) {
+        if (interactive) memtest_progress_start("Compare",pass);
+        errors += memtest_compare(m,bytes,interactive);
+        if (interactive) memtest_progress_end();
+    }
+    return errors;
+}
+
+/* Test the specified memory. The number of bytes must be multiple of 4096.
+ * If interactive is true the program exists with an error and prints
+ * ASCII arts to show progresses. Instead when interactive is 0, it can
+ * be used as an API call, and returns 1 if memory errors were found or
+ * 0 if there were no errors detected. */
+int memtest_test(unsigned long *m, size_t bytes, int passes, int interactive) {
+    int pass = 0;
+    int errors = 0;
+
+    while (pass != passes) {
+        pass++;
+
+        if (interactive) memtest_progress_start("Addressing test",pass);
+        errors += memtest_addressing(m,bytes,interactive);
+        if (interactive) memtest_progress_end();
+
+        if (interactive) memtest_progress_start("Random fill",pass);
+        memtest_fill_random(m,bytes,interactive);
+        if (interactive) memtest_progress_end();
+        errors += memtest_compare_times(m,bytes,pass,4,interactive);
+
+        if (interactive) memtest_progress_start("Solid fill",pass);
+        memtest_fill_value(m,bytes,0,(unsigned long)-1,'S',interactive);
+        if (interactive) memtest_progress_end();
+        errors += memtest_compare_times(m,bytes,pass,4,interactive);
+
+        if (interactive) memtest_progress_start("Checkerboard fill",pass);
+        memtest_fill_value(m,bytes,ULONG_ONEZERO,ULONG_ZEROONE,'C',interactive);
+        if (interactive) memtest_progress_end();
+        errors += memtest_compare_times(m,bytes,pass,4,interactive);
+    }
+    return errors;
+}
+
+/* A version of memtest_test() that tests memory in small pieces
+ * in order to restore the memory content at exit.
+ *
+ * One problem we have with this approach, is that the cache can avoid
+ * real memory accesses, and we can't test big chunks of memory at the
+ * same time, because we need to backup them on the stack (the allocator
+ * may not be usable or we may be already in an out of memory condition).
+ * So what we do is to try to trash the cache with useless memory accesses
+ * between the fill and compare cycles. */
+#define MEMTEST_BACKUP_WORDS (1024*(1024/sizeof(long)))
+/* Random accesses of MEMTEST_DECACHE_SIZE are performed at the start and
+ * end of the region between fill and compare cycles in order to trash
+ * the cache. */
+#define MEMTEST_DECACHE_SIZE (1024*8)
+int memtest_preserving_test(unsigned long *m, size_t bytes, int passes) {
+    unsigned long backup[MEMTEST_BACKUP_WORDS];
+    unsigned long *p = m;
+    unsigned long *end = (unsigned long*) (((unsigned char*)m)+(bytes-MEMTEST_DECACHE_SIZE));
+    size_t left = bytes;
+    int errors = 0;
+
+    if (bytes & 4095) return 0; /* Can't test across 4k page boundaries. */
+    if (bytes < 4096*2) return 0; /* Can't test a single page. */
+
+    while(left) {
+        /* If we have to test a single final page, go back a single page
+         * so that we can test two pages, since the code can't test a single
+         * page but at least two. */
+        if (left == 4096) {
+            left += 4096;
+            p -= 4096/sizeof(unsigned long);
+        }
+
+        int pass = 0;
+        size_t len = (left > sizeof(backup)) ? sizeof(backup) : left;
+
+        /* Always test an even number of pages. */
+        if (len/4096 % 2) len -= 4096;
+
+        memcpy(backup,p,len); /* Backup. */
+        while(pass != passes) {
+            pass++;
+            errors += memtest_addressing(p,len,0);
+            memtest_fill_random(p,len,0);
+            if (bytes >= MEMTEST_DECACHE_SIZE) {
+                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
+                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
+            }
+            errors += memtest_compare_times(p,len,pass,4,0);
+            memtest_fill_value(p,len,0,(unsigned long)-1,'S',0);
+            if (bytes >= MEMTEST_DECACHE_SIZE) {
+                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
+                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
+            }
+            errors += memtest_compare_times(p,len,pass,4,0);
+            memtest_fill_value(p,len,ULONG_ONEZERO,ULONG_ZEROONE,'C',0);
+            if (bytes >= MEMTEST_DECACHE_SIZE) {
+                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
+                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
+            }
+            errors += memtest_compare_times(p,len,pass,4,0);
+        }
+        memcpy(p,backup,len); /* Restore. */
+        left -= len;
+        p += len/sizeof(unsigned long);
+    }
+    return errors;
+}
+
+/* Perform an interactive test allocating the specified number of megabytes. */
+void memtest_alloc_and_test(size_t megabytes, int passes) {
+    size_t bytes = megabytes*1024*1024;
+    unsigned long *m = malloc(bytes);
+
+    if (m == NULL) {
+        fprintf(stderr,"Unable to allocate %zu megabytes: %s",
+            megabytes, strerror(errno));
+        exit(1);
+    }
+    memtest_test(m,bytes,passes,1);
+    free(m);
+}
+
+void memtest(size_t megabytes, int passes) {
+#if !defined(__HAIKU__)
+    if (ioctl(1, TIOCGWINSZ, &ws) == -1) {
+        ws.ws_col = 80;
+        ws.ws_row = 20;
+    }
+#else
+    ws.ws_col = 80;
+    ws.ws_row = 20;
+#endif
+    memtest_alloc_and_test(megabytes,passes);
+    printf("\nYour memory passed this test.\n");
+    printf("Please if you are still in doubt use the following two tools:\n");
+    printf("1) memtest86: http://www.memtest86.com/\n");
+    printf("2) memtester: http://pyropus.ca/software/memtester/\n");
+    exit(0);
+}
diff --git a/redis-stable/src/mkreleasehdr.sh b/redis-stable/src/mkreleasehdr.sh
new file mode 100755
index 00000000..236c26c2
--- /dev/null
+++ b/redis-stable/src/mkreleasehdr.sh
@@ -0,0 +1,14 @@
+#!/bin/sh
+GIT_SHA1=`(git show-ref --head --hash=8 2> /dev/null || echo 00000000) | head -n1`
+GIT_DIRTY=`git diff --no-ext-diff 2> /dev/null | wc -l`
+BUILD_ID=`uname -n`"-"`date +%s`
+if [ -n "$SOURCE_DATE_EPOCH" ]; then
+  BUILD_ID=$(date -u -d "@$SOURCE_DATE_EPOCH" +%s 2>/dev/null || date -u -r "$SOURCE_DATE_EPOCH" +%s 2>/dev/null || date -u +%s)
+fi
+test -f release.h || touch release.h
+(cat release.h | grep SHA1 | grep $GIT_SHA1) && \
+(cat release.h | grep DIRTY | grep $GIT_DIRTY) && exit 0 # Already up-to-date
+echo "#define REDIS_GIT_SHA1 \"$GIT_SHA1\"" > release.h
+echo "#define REDIS_GIT_DIRTY \"$GIT_DIRTY\"" >> release.h
+echo "#define REDIS_BUILD_ID \"$BUILD_ID\"" >> release.h
+touch release.c # Force recompile of release.c
diff --git a/redis-stable/src/module.c b/redis-stable/src/module.c
new file mode 100644
index 00000000..adca9dc9
--- /dev/null
+++ b/redis-stable/src/module.c
@@ -0,0 +1,9506 @@
+/*
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* --------------------------------------------------------------------------
+ * Modules API documentation information
+ *
+ * The comments in this file are used to generate the API documentation on the
+ * Redis website.
+ *
+ * Each function starting with RM_ and preceded by a block comment is included
+ * in the API documentation. To hide an RM_ function, put a blank line between
+ * the comment and the function definition or put the comment inside the
+ * function body.
+ *
+ * The functions are divided into sections. Each section is preceded by a
+ * documentation block, which is comment block starting with a markdown level 2
+ * heading, i.e. a line starting with ##, on the first line of the comment block
+ * (with the exception of a ----- line which can appear first). Other comment
+ * blocks, which are not intended for the modules API user, such as this comment
+ * block, do NOT start with a markdown level 2 heading, so they are included in
+ * the generated a API documentation.
+ *
+ * The documentation comments may contain markdown formatting. Some automatic
+ * replacements are done, such as the replacement of RM with RedisModule in
+ * function names. For details, see the script src/modules/gendoc.rb.
+ * -------------------------------------------------------------------------- */
+
+#include "server.h"
+#include "cluster.h"
+#include "slowlog.h"
+#include "rdb.h"
+#include "monotonic.h"
+#include <dlfcn.h>
+#include <sys/stat.h>
+#include <sys/wait.h>
+
+/* --------------------------------------------------------------------------
+ * Private data structures used by the modules system. Those are data
+ * structures that are never exposed to Redis Modules, if not as void
+ * pointers that have an API the module can call with them)
+ * -------------------------------------------------------------------------- */
+
+typedef struct RedisModuleInfoCtx {
+    struct RedisModule *module;
+    const char *requested_section;
+    sds info;           /* info string we collected so far */
+    int sections;       /* number of sections we collected so far */
+    int in_section;     /* indication if we're in an active section or not */
+    int in_dict_field;  /* indication that we're currently appending to a dict */
+} RedisModuleInfoCtx;
+
+typedef void (*RedisModuleInfoFunc)(RedisModuleInfoCtx *ctx, int for_crash_report);
+typedef void (*RedisModuleDefragFunc)(struct RedisModuleDefragCtx *ctx);
+
+/* This structure represents a module inside the system. */
+struct RedisModule {
+    void *handle;   /* Module dlopen() handle. */
+    char *name;     /* Module name. */
+    int ver;        /* Module version. We use just progressive integers. */
+    int apiver;     /* Module API version as requested during initialization.*/
+    list *types;    /* Module data types. */
+    list *usedby;   /* List of modules using APIs from this one. */
+    list *using;    /* List of modules we use some APIs of. */
+    list *filters;  /* List of filters the module has registered. */
+    int in_call;    /* RM_Call() nesting level */
+    int in_hook;    /* Hooks callback nesting level for this module (0 or 1). */
+    int options;    /* Module options and capabilities. */
+    int blocked_clients;         /* Count of RedisModuleBlockedClient in this module. */
+    RedisModuleInfoFunc info_cb; /* Callback for module to add INFO fields. */
+    RedisModuleDefragFunc defrag_cb;    /* Callback for global data defrag. */
+};
+typedef struct RedisModule RedisModule;
+
+/* This represents a shared API. Shared APIs will be used to populate
+ * the server.sharedapi dictionary, mapping names of APIs exported by
+ * modules for other modules to use, to their structure specifying the
+ * function pointer that can be called. */
+struct RedisModuleSharedAPI {
+    void *func;
+    RedisModule *module;
+};
+typedef struct RedisModuleSharedAPI RedisModuleSharedAPI;
+
+static dict *modules; /* Hash table of modules. SDS -> RedisModule ptr.*/
+
+/* Entries in the context->amqueue array, representing objects to free
+ * when the callback returns. */
+struct AutoMemEntry {
+    void *ptr;
+    int type;
+};
+
+/* AutMemEntry type field values. */
+#define REDISMODULE_AM_KEY 0
+#define REDISMODULE_AM_STRING 1
+#define REDISMODULE_AM_REPLY 2
+#define REDISMODULE_AM_FREED 3 /* Explicitly freed by user already. */
+#define REDISMODULE_AM_DICT 4
+#define REDISMODULE_AM_INFO 5
+
+/* The pool allocator block. Redis Modules can allocate memory via this special
+ * allocator that will automatically release it all once the callback returns.
+ * This means that it can only be used for ephemeral allocations. However
+ * there are two advantages for modules to use this API:
+ *
+ * 1) The memory is automatically released when the callback returns.
+ * 2) This allocator is faster for many small allocations since whole blocks
+ *    are allocated, and small pieces returned to the caller just advancing
+ *    the index of the allocation.
+ *
+ * Allocations are always rounded to the size of the void pointer in order
+ * to always return aligned memory chunks. */
+
+#define REDISMODULE_POOL_ALLOC_MIN_SIZE (1024*8)
+#define REDISMODULE_POOL_ALLOC_ALIGN (sizeof(void*))
+
+typedef struct RedisModulePoolAllocBlock {
+    uint32_t size;
+    uint32_t used;
+    struct RedisModulePoolAllocBlock *next;
+    char memory[];
+} RedisModulePoolAllocBlock;
+
+/* This structure represents the context in which Redis modules operate.
+ * Most APIs module can access, get a pointer to the context, so that the API
+ * implementation can hold state across calls, or remember what to free after
+ * the call and so forth.
+ *
+ * Note that not all the context structure is always filled with actual values
+ * but only the fields needed in a given context. */
+
+struct RedisModuleBlockedClient;
+
+struct RedisModuleCtx {
+    void *getapifuncptr;            /* NOTE: Must be the first field. */
+    struct RedisModule *module;     /* Module reference. */
+    client *client;                 /* Client calling a command. */
+    struct RedisModuleBlockedClient *blocked_client; /* Blocked client for
+                                                        thread safe context. */
+    struct AutoMemEntry *amqueue;   /* Auto memory queue of objects to free. */
+    int amqueue_len;                /* Number of slots in amqueue. */
+    int amqueue_used;               /* Number of used slots in amqueue. */
+    int flags;                      /* REDISMODULE_CTX_... flags. */
+    void **postponed_arrays;        /* To set with RM_ReplySetArrayLength(). */
+    int postponed_arrays_count;     /* Number of entries in postponed_arrays. */
+    void *blocked_privdata;         /* Privdata set when unblocking a client. */
+    RedisModuleString *blocked_ready_key; /* Key ready when the reply callback
+                                             gets called for clients blocked
+                                             on keys. */
+
+    /* Used if there is the REDISMODULE_CTX_KEYS_POS_REQUEST flag set. */
+    getKeysResult *keys_result;
+
+    struct RedisModulePoolAllocBlock *pa_head;
+    redisOpArray saved_oparray;    /* When propagating commands in a callback
+                                      we reallocate the "also propagate" op
+                                      array. Here we save the old one to
+                                      restore it later. */
+};
+typedef struct RedisModuleCtx RedisModuleCtx;
+
+#define REDISMODULE_CTX_INIT {(void*)(unsigned long)&RM_GetApi, NULL, NULL, NULL, NULL, 0, 0, 0, NULL, 0, NULL, NULL, NULL, NULL, {0}}
+#define REDISMODULE_CTX_AUTO_MEMORY (1<<0)
+#define REDISMODULE_CTX_KEYS_POS_REQUEST (1<<1)
+#define REDISMODULE_CTX_BLOCKED_REPLY (1<<2)
+#define REDISMODULE_CTX_BLOCKED_TIMEOUT (1<<3)
+#define REDISMODULE_CTX_THREAD_SAFE (1<<4)
+#define REDISMODULE_CTX_BLOCKED_DISCONNECTED (1<<5)
+#define REDISMODULE_CTX_MODULE_COMMAND_CALL (1<<6)
+#define REDISMODULE_CTX_MULTI_EMITTED (1<<7)
+
+/* This represents a Redis key opened with RM_OpenKey(). */
+struct RedisModuleKey {
+    RedisModuleCtx *ctx;
+    redisDb *db;
+    robj *key;      /* Key name object. */
+    robj *value;    /* Value object, or NULL if the key was not found. */
+    void *iter;     /* Iterator. */
+    int mode;       /* Opening mode. */
+
+    union {
+        struct {
+            /* Zset iterator, use only if value->type == OBJ_ZSET */
+            uint32_t type;         /* REDISMODULE_ZSET_RANGE_* */
+            zrangespec rs;         /* Score range. */
+            zlexrangespec lrs;     /* Lex range. */
+            uint32_t start;        /* Start pos for positional ranges. */
+            uint32_t end;          /* End pos for positional ranges. */
+            void *current;         /* Zset iterator current node. */
+            int er;                /* Zset iterator end reached flag
+                                       (true if end was reached). */
+        } zset;
+        struct {
+            /* Stream, use only if value->type == OBJ_STREAM */
+            streamID currentid;    /* Current entry while iterating. */
+            int64_t numfieldsleft; /* Fields left to fetch for current entry. */
+            int signalready;       /* Flag that signalKeyAsReady() is needed. */
+        } stream;
+    } u;
+};
+typedef struct RedisModuleKey RedisModuleKey;
+
+/* RedisModuleKey 'ztype' values. */
+#define REDISMODULE_ZSET_RANGE_NONE 0       /* This must always be 0. */
+#define REDISMODULE_ZSET_RANGE_LEX 1
+#define REDISMODULE_ZSET_RANGE_SCORE 2
+#define REDISMODULE_ZSET_RANGE_POS 3
+
+/* Function pointer type of a function representing a command inside
+ * a Redis module. */
+struct RedisModuleBlockedClient;
+typedef int (*RedisModuleCmdFunc) (RedisModuleCtx *ctx, void **argv, int argc);
+typedef void (*RedisModuleDisconnectFunc) (RedisModuleCtx *ctx, struct RedisModuleBlockedClient *bc);
+
+/* This struct holds the information about a command registered by a module.*/
+struct RedisModuleCommandProxy {
+    struct RedisModule *module;
+    RedisModuleCmdFunc func;
+    struct redisCommand *rediscmd;
+};
+typedef struct RedisModuleCommandProxy RedisModuleCommandProxy;
+
+#define REDISMODULE_REPLYFLAG_NONE 0
+#define REDISMODULE_REPLYFLAG_TOPARSE (1<<0) /* Protocol must be parsed. */
+#define REDISMODULE_REPLYFLAG_NESTED (1<<1)  /* Nested reply object. No proto
+                                                or struct free. */
+
+/* Reply of RM_Call() function. The function is filled in a lazy
+ * way depending on the function called on the reply structure. By default
+ * only the type, proto and protolen are filled. */
+typedef struct RedisModuleCallReply {
+    RedisModuleCtx *ctx;
+    int type;       /* REDISMODULE_REPLY_... */
+    int flags;      /* REDISMODULE_REPLYFLAG_...  */
+    size_t len;     /* Len of strings or num of elements of arrays. */
+    char *proto;    /* Raw reply protocol. An SDS string at top-level object. */
+    size_t protolen;/* Length of protocol. */
+    union {
+        const char *str; /* String pointer for string and error replies. This
+                            does not need to be freed, always points inside
+                            a reply->proto buffer of the reply object or, in
+                            case of array elements, of parent reply objects. */
+        long long ll;    /* Reply value for integer reply. */
+        struct RedisModuleCallReply *array; /* Array of sub-reply elements. */
+    } val;
+} RedisModuleCallReply;
+
+/* Structure representing a blocked client. We get a pointer to such
+ * an object when blocking from modules. */
+typedef struct RedisModuleBlockedClient {
+    client *client;  /* Pointer to the blocked client. or NULL if the client
+                        was destroyed during the life of this object. */
+    RedisModule *module;    /* Module blocking the client. */
+    RedisModuleCmdFunc reply_callback; /* Reply callback on normal completion.*/
+    RedisModuleCmdFunc timeout_callback; /* Reply callback on timeout. */
+    RedisModuleDisconnectFunc disconnect_callback; /* Called on disconnection.*/
+    void (*free_privdata)(RedisModuleCtx*,void*);/* privdata cleanup callback.*/
+    void *privdata;     /* Module private data that may be used by the reply
+                           or timeout callback. It is set via the
+                           RedisModule_UnblockClient() API. */
+    client *reply_client;           /* Fake client used to accumulate replies
+                                       in thread safe contexts. */
+    int dbid;           /* Database number selected by the original client. */
+    int blocked_on_keys;    /* If blocked via RM_BlockClientOnKeys(). */
+    int unblocked;          /* Already on the moduleUnblocked list. */
+    monotime background_timer; /* Timer tracking the start of background work */
+    uint64_t background_duration; /* Current command background time duration.
+                                     Used for measuring latency of blocking cmds */
+} RedisModuleBlockedClient;
+
+static pthread_mutex_t moduleUnblockedClientsMutex = PTHREAD_MUTEX_INITIALIZER;
+static list *moduleUnblockedClients;
+
+/* We need a mutex that is unlocked / relocked in beforeSleep() in order to
+ * allow thread safe contexts to execute commands at a safe moment. */
+static pthread_mutex_t moduleGIL = PTHREAD_MUTEX_INITIALIZER;
+
+
+/* Function pointer type for keyspace event notification subscriptions from modules. */
+typedef int (*RedisModuleNotificationFunc) (RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key);
+
+/* Keyspace notification subscriber information.
+ * See RM_SubscribeToKeyspaceEvents() for more information. */
+typedef struct RedisModuleKeyspaceSubscriber {
+    /* The module subscribed to the event */
+    RedisModule *module;
+    /* Notification callback in the module*/
+    RedisModuleNotificationFunc notify_callback;
+    /* A bit mask of the events the module is interested in */
+    int event_mask;
+    /* Active flag set on entry, to avoid reentrant subscribers
+     * calling themselves */
+    int active;
+} RedisModuleKeyspaceSubscriber;
+
+/* The module keyspace notification subscribers list */
+static list *moduleKeyspaceSubscribers;
+
+/* Static client recycled for when we need to provide a context with a client
+ * in a situation where there is no client to provide. This avoids allocating
+ * a new client per round. For instance this is used in the keyspace
+ * notifications, timers and cluster messages callbacks. */
+static client *moduleFreeContextReusedClient;
+
+/* Data structures related to the exported dictionary data structure. */
+typedef struct RedisModuleDict {
+    rax *rax;                       /* The radix tree. */
+} RedisModuleDict;
+
+typedef struct RedisModuleDictIter {
+    RedisModuleDict *dict;
+    raxIterator ri;
+} RedisModuleDictIter;
+
+typedef struct RedisModuleCommandFilterCtx {
+    RedisModuleString **argv;
+    int argc;
+} RedisModuleCommandFilterCtx;
+
+typedef void (*RedisModuleCommandFilterFunc) (RedisModuleCommandFilterCtx *filter);
+
+typedef struct RedisModuleCommandFilter {
+    /* The module that registered the filter */
+    RedisModule *module;
+    /* Filter callback function */
+    RedisModuleCommandFilterFunc callback;
+    /* REDISMODULE_CMDFILTER_* flags */
+    int flags;
+} RedisModuleCommandFilter;
+
+/* Registered filters */
+static list *moduleCommandFilters;
+
+typedef void (*RedisModuleForkDoneHandler) (int exitcode, int bysignal, void *user_data);
+
+static struct RedisModuleForkInfo {
+    RedisModuleForkDoneHandler done_handler;
+    void* done_handler_user_data;
+} moduleForkInfo = {0};
+
+typedef struct RedisModuleServerInfoData {
+    rax *rax;                       /* parsed info data. */
+} RedisModuleServerInfoData;
+
+/* Flags for moduleCreateArgvFromUserFormat(). */
+#define REDISMODULE_ARGV_REPLICATE (1<<0)
+#define REDISMODULE_ARGV_NO_AOF (1<<1)
+#define REDISMODULE_ARGV_NO_REPLICAS (1<<2)
+
+/* Determine whether Redis should signalModifiedKey implicitly.
+ * In case 'ctx' has no 'module' member (and therefore no module->options),
+ * we assume default behavior, that is, Redis signals.
+ * (see RM_GetThreadSafeContext) */
+#define SHOULD_SIGNAL_MODIFIED_KEYS(ctx) \
+    ctx->module? !(ctx->module->options & REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED) : 1
+
+/* Server events hooks data structures and defines: this modules API
+ * allow modules to subscribe to certain events in Redis, such as
+ * the start and end of an RDB or AOF save, the change of role in replication,
+ * and similar other events. */
+
+typedef struct RedisModuleEventListener {
+    RedisModule *module;
+    RedisModuleEvent event;
+    RedisModuleEventCallback callback;
+} RedisModuleEventListener;
+
+list *RedisModule_EventListeners; /* Global list of all the active events. */
+unsigned long long ModulesInHooks = 0; /* Total number of modules in hooks
+                                          callbacks right now. */
+
+/* Data structures related to the redis module users */
+
+/* This is the object returned by RM_CreateModuleUser(). The module API is
+ * able to create users, set ACLs to such users, and later authenticate
+ * clients using such newly created users. */
+typedef struct RedisModuleUser {
+    user *user; /* Reference to the real redis user */
+} RedisModuleUser;
+
+
+/* --------------------------------------------------------------------------
+ * Prototypes
+ * -------------------------------------------------------------------------- */
+
+void RM_FreeCallReply(RedisModuleCallReply *reply);
+void RM_CloseKey(RedisModuleKey *key);
+void autoMemoryCollect(RedisModuleCtx *ctx);
+robj **moduleCreateArgvFromUserFormat(const char *cmdname, const char *fmt, int *argcp, int *flags, va_list ap);
+void moduleReplicateMultiIfNeeded(RedisModuleCtx *ctx);
+void RM_ZsetRangeStop(RedisModuleKey *kp);
+static void zsetKeyReset(RedisModuleKey *key);
+static void moduleInitKeyTypeSpecific(RedisModuleKey *key);
+void RM_FreeDict(RedisModuleCtx *ctx, RedisModuleDict *d);
+void RM_FreeServerInfo(RedisModuleCtx *ctx, RedisModuleServerInfoData *data);
+
+/* --------------------------------------------------------------------------
+ * ## Heap allocation raw functions
+ *
+ * Memory allocated with these functions are taken into account by Redis key
+ * eviction algorithms and are reported in Redis memory usage information.
+ * -------------------------------------------------------------------------- */
+
+/* Use like malloc(). Memory allocated with this function is reported in
+ * Redis INFO memory, used for keys eviction according to maxmemory settings
+ * and in general is taken into account as memory allocated by Redis.
+ * You should avoid using malloc(). */
+void *RM_Alloc(size_t bytes) {
+    return zmalloc(bytes);
+}
+
+/* Use like calloc(). Memory allocated with this function is reported in
+ * Redis INFO memory, used for keys eviction according to maxmemory settings
+ * and in general is taken into account as memory allocated by Redis.
+ * You should avoid using calloc() directly. */
+void *RM_Calloc(size_t nmemb, size_t size) {
+    return zcalloc(nmemb*size);
+}
+
+/* Use like realloc() for memory obtained with RedisModule_Alloc(). */
+void* RM_Realloc(void *ptr, size_t bytes) {
+    return zrealloc(ptr,bytes);
+}
+
+/* Use like free() for memory obtained by RedisModule_Alloc() and
+ * RedisModule_Realloc(). However you should never try to free with
+ * RedisModule_Free() memory allocated with malloc() inside your module. */
+void RM_Free(void *ptr) {
+    zfree(ptr);
+}
+
+/* Like strdup() but returns memory allocated with RedisModule_Alloc(). */
+char *RM_Strdup(const char *str) {
+    return zstrdup(str);
+}
+
+/* --------------------------------------------------------------------------
+ * Pool allocator
+ * -------------------------------------------------------------------------- */
+
+/* Release the chain of blocks used for pool allocations. */
+void poolAllocRelease(RedisModuleCtx *ctx) {
+    RedisModulePoolAllocBlock *head = ctx->pa_head, *next;
+
+    while(head != NULL) {
+        next = head->next;
+        zfree(head);
+        head = next;
+    }
+    ctx->pa_head = NULL;
+}
+
+/* Return heap allocated memory that will be freed automatically when the
+ * module callback function returns. Mostly suitable for small allocations
+ * that are short living and must be released when the callback returns
+ * anyway. The returned memory is aligned to the architecture word size
+ * if at least word size bytes are requested, otherwise it is just
+ * aligned to the next power of two, so for example a 3 bytes request is
+ * 4 bytes aligned while a 2 bytes request is 2 bytes aligned.
+ *
+ * There is no realloc style function since when this is needed to use the
+ * pool allocator is not a good idea.
+ *
+ * The function returns NULL if `bytes` is 0. */
+void *RM_PoolAlloc(RedisModuleCtx *ctx, size_t bytes) {
+    if (bytes == 0) return NULL;
+    RedisModulePoolAllocBlock *b = ctx->pa_head;
+    size_t left = b ? b->size - b->used : 0;
+
+    /* Fix alignment. */
+    if (left >= bytes) {
+        size_t alignment = REDISMODULE_POOL_ALLOC_ALIGN;
+        while (bytes < alignment && alignment/2 >= bytes) alignment /= 2;
+        if (b->used % alignment)
+            b->used += alignment - (b->used % alignment);
+        left = (b->used > b->size) ? 0 : b->size - b->used;
+    }
+
+    /* Create a new block if needed. */
+    if (left < bytes) {
+        size_t blocksize = REDISMODULE_POOL_ALLOC_MIN_SIZE;
+        if (blocksize < bytes) blocksize = bytes;
+        b = zmalloc(sizeof(*b) + blocksize);
+        b->size = blocksize;
+        b->used = 0;
+        b->next = ctx->pa_head;
+        ctx->pa_head = b;
+    }
+
+    char *retval = b->memory + b->used;
+    b->used += bytes;
+    return retval;
+}
+
+/* --------------------------------------------------------------------------
+ * Helpers for modules API implementation
+ * -------------------------------------------------------------------------- */
+
+/* Create an empty key of the specified type. `key` must point to a key object
+ * opened for writing where the `.value` member is set to NULL because the
+ * key was found to be non existing.
+ *
+ * On success REDISMODULE_OK is returned and the key is populated with
+ * the value of the specified type. The function fails and returns
+ * REDISMODULE_ERR if:
+ *
+ * 1. The key is not open for writing.
+ * 2. The key is not empty.
+ * 3. The specified type is unknown.
+ */
+int moduleCreateEmptyKey(RedisModuleKey *key, int type) {
+    robj *obj;
+
+    /* The key must be open for writing and non existing to proceed. */
+    if (!(key->mode & REDISMODULE_WRITE) || key->value)
+        return REDISMODULE_ERR;
+
+    switch(type) {
+    case REDISMODULE_KEYTYPE_LIST:
+        obj = createQuicklistObject();
+        quicklistSetOptions(obj->ptr, server.list_max_ziplist_size,
+                            server.list_compress_depth);
+        break;
+    case REDISMODULE_KEYTYPE_ZSET:
+        obj = createZsetZiplistObject();
+        break;
+    case REDISMODULE_KEYTYPE_HASH:
+        obj = createHashObject();
+        break;
+    case REDISMODULE_KEYTYPE_STREAM:
+        obj = createStreamObject();
+        break;
+    default: return REDISMODULE_ERR;
+    }
+    dbAdd(key->db,key->key,obj);
+    key->value = obj;
+    moduleInitKeyTypeSpecific(key);
+    return REDISMODULE_OK;
+}
+
+/* This function is called in low-level API implementation functions in order
+ * to check if the value associated with the key remained empty after an
+ * operation that removed elements from an aggregate data type.
+ *
+ * If this happens, the key is deleted from the DB and the key object state
+ * is set to the right one in order to be targeted again by write operations
+ * possibly recreating the key if needed.
+ *
+ * The function returns 1 if the key value object is found empty and is
+ * deleted, otherwise 0 is returned. */
+int moduleDelKeyIfEmpty(RedisModuleKey *key) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL) return 0;
+    int isempty;
+    robj *o = key->value;
+
+    switch(o->type) {
+    case OBJ_LIST: isempty = listTypeLength(o) == 0; break;
+    case OBJ_SET: isempty = setTypeSize(o) == 0; break;
+    case OBJ_ZSET: isempty = zsetLength(o) == 0; break;
+    case OBJ_HASH: isempty = hashTypeLength(o) == 0; break;
+    case OBJ_STREAM: isempty = streamLength(o) == 0; break;
+    default: isempty = 0;
+    }
+
+    if (isempty) {
+        dbDelete(key->db,key->key);
+        key->value = NULL;
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* --------------------------------------------------------------------------
+ * Service API exported to modules
+ *
+ * Note that all the exported APIs are called RM_<funcname> in the core
+ * and RedisModule_<funcname> in the module side (defined as function
+ * pointers in redismodule.h). In this way the dynamic linker does not
+ * mess with our global function pointers, overriding it with the symbols
+ * defined in the main executable having the same names.
+ * -------------------------------------------------------------------------- */
+
+int RM_GetApi(const char *funcname, void **targetPtrPtr) {
+    /* Lookup the requested module API and store the function pointer into the
+     * target pointer. The function returns REDISMODULE_ERR if there is no such
+     * named API, otherwise REDISMODULE_OK.
+     *
+     * This function is not meant to be used by modules developer, it is only
+     * used implicitly by including redismodule.h. */
+    dictEntry *he = dictFind(server.moduleapi, funcname);
+    if (!he) return REDISMODULE_ERR;
+    *targetPtrPtr = dictGetVal(he);
+    return REDISMODULE_OK;
+}
+
+/* Helper function for when a command callback is called, in order to handle
+ * details needed to correctly replicate commands. */
+void moduleHandlePropagationAfterCommandCallback(RedisModuleCtx *ctx) {
+    client *c = ctx->client;
+
+    /* We don't need to do anything here if the context was never used
+     * in order to propagate commands. */
+    if (!(ctx->flags & REDISMODULE_CTX_MULTI_EMITTED)) return;
+
+    /* We don't need to do anything here if the server isn't inside
+     * a transaction. */
+    if (!server.propagate_in_transaction) return;
+
+    /* If this command is executed from with Lua or MULTI/EXEC we do not
+     * need to propagate EXEC */
+    if (server.in_eval || server.in_exec) return;
+
+    /* Handle the replication of the final EXEC, since whatever a command
+     * emits is always wrapped around MULTI/EXEC. */
+    alsoPropagate(server.execCommand,c->db->id,&shared.exec,1,
+        PROPAGATE_AOF|PROPAGATE_REPL);
+    afterPropagateExec();
+
+    /* If this is not a module command context (but is instead a simple
+     * callback context), we have to handle directly the "also propagate"
+     * array and emit it. In a module command call this will be handled
+     * directly by call(). */
+    if (!(ctx->flags & REDISMODULE_CTX_MODULE_COMMAND_CALL) &&
+        server.also_propagate.numops)
+    {
+        for (int j = 0; j < server.also_propagate.numops; j++) {
+            redisOp *rop = &server.also_propagate.ops[j];
+            int target = rop->target;
+            if (target)
+                propagate(rop->cmd,rop->dbid,rop->argv,rop->argc,target);
+        }
+        redisOpArrayFree(&server.also_propagate);
+        /* Restore the previous oparray in case of nexted use of the API. */
+        server.also_propagate = ctx->saved_oparray;
+        /* We're done with saved_oparray, let's invalidate it. */
+        redisOpArrayInit(&ctx->saved_oparray);
+    }
+}
+
+/* Free the context after the user function was called. */
+void moduleFreeContext(RedisModuleCtx *ctx) {
+    moduleHandlePropagationAfterCommandCallback(ctx);
+    autoMemoryCollect(ctx);
+    poolAllocRelease(ctx);
+    if (ctx->postponed_arrays) {
+        zfree(ctx->postponed_arrays);
+        ctx->postponed_arrays_count = 0;
+        serverLog(LL_WARNING,
+            "API misuse detected in module %s: "
+            "RedisModule_ReplyWithArray(REDISMODULE_POSTPONED_ARRAY_LEN) "
+            "not matched by the same number of RedisModule_SetReplyArrayLen() "
+            "calls.",
+            ctx->module->name);
+    }
+    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) freeClient(ctx->client);
+}
+
+/* This Redis command binds the normal Redis command invocation with commands
+ * exported by modules. */
+void RedisModuleCommandDispatcher(client *c) {
+    RedisModuleCommandProxy *cp = (void*)(unsigned long)c->cmd->getkeys_proc;
+    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+
+    ctx.flags |= REDISMODULE_CTX_MODULE_COMMAND_CALL;
+    ctx.module = cp->module;
+    ctx.client = c;
+    cp->func(&ctx,(void**)c->argv,c->argc);
+    moduleFreeContext(&ctx);
+
+    /* In some cases processMultibulkBuffer uses sdsMakeRoomFor to
+     * expand the query buffer, and in order to avoid a big object copy
+     * the query buffer SDS may be used directly as the SDS string backing
+     * the client argument vectors: sometimes this will result in the SDS
+     * string having unused space at the end. Later if a module takes ownership
+     * of the RedisString, such space will be wasted forever. Inside the
+     * Redis core this is not a problem because tryObjectEncoding() is called
+     * before storing strings in the key space. Here we need to do it
+     * for the module. */
+    for (int i = 0; i < c->argc; i++) {
+        /* Only do the work if the module took ownership of the object:
+         * in that case the refcount is no longer 1. */
+        if (c->argv[i]->refcount > 1)
+            trimStringObjectIfNeeded(c->argv[i]);
+    }
+}
+
+/* This function returns the list of keys, with the same interface as the
+ * 'getkeys' function of the native commands, for module commands that exported
+ * the "getkeys-api" flag during the registration. This is done when the
+ * list of keys are not at fixed positions, so that first/last/step cannot
+ * be used.
+ *
+ * In order to accomplish its work, the module command is called, flagging
+ * the context in a way that the command can recognize this is a special
+ * "get keys" call by calling RedisModule_IsKeysPositionRequest(ctx). */
+int moduleGetCommandKeysViaAPI(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
+    RedisModuleCommandProxy *cp = (void*)(unsigned long)cmd->getkeys_proc;
+    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+
+    ctx.module = cp->module;
+    ctx.client = NULL;
+    ctx.flags |= REDISMODULE_CTX_KEYS_POS_REQUEST;
+
+    /* Initialize getKeysResult */
+    getKeysPrepareResult(result, MAX_KEYS_BUFFER);
+    ctx.keys_result = result;
+
+    cp->func(&ctx,(void**)argv,argc);
+    /* We currently always use the array allocated by RM_KeyAtPos() and don't try
+     * to optimize for the pre-allocated buffer.
+     */
+    moduleFreeContext(&ctx);
+    return result->numkeys;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Commands API
+ *
+ * These functions are used to implement custom Redis commands.
+ *
+ * For examples, see https://redis.io/topics/modules-intro.
+ * -------------------------------------------------------------------------- */
+
+/* Return non-zero if a module command, that was declared with the
+ * flag "getkeys-api", is called in a special way to get the keys positions
+ * and not to get executed. Otherwise zero is returned. */
+int RM_IsKeysPositionRequest(RedisModuleCtx *ctx) {
+    return (ctx->flags & REDISMODULE_CTX_KEYS_POS_REQUEST) != 0;
+}
+
+/* When a module command is called in order to obtain the position of
+ * keys, since it was flagged as "getkeys-api" during the registration,
+ * the command implementation checks for this special call using the
+ * RedisModule_IsKeysPositionRequest() API and uses this function in
+ * order to report keys, like in the following example:
+ *
+ *     if (RedisModule_IsKeysPositionRequest(ctx)) {
+ *         RedisModule_KeyAtPos(ctx,1);
+ *         RedisModule_KeyAtPos(ctx,2);
+ *     }
+ *
+ *  Note: in the example below the get keys API would not be needed since
+ *  keys are at fixed positions. This interface is only used for commands
+ *  with a more complex structure. */
+void RM_KeyAtPos(RedisModuleCtx *ctx, int pos) {
+    if (!(ctx->flags & REDISMODULE_CTX_KEYS_POS_REQUEST) || !ctx->keys_result) return;
+    if (pos <= 0) return;
+
+    getKeysResult *res = ctx->keys_result;
+
+    /* Check overflow */
+    if (res->numkeys == res->size) {
+        int newsize = res->size + (res->size > 8192 ? 8192 : res->size);
+        getKeysPrepareResult(res, newsize);
+    }
+
+    res->keys[res->numkeys++] = pos;
+}
+
+/* Helper for RM_CreateCommand(). Turns a string representing command
+ * flags into the command flags used by the Redis core.
+ *
+ * It returns the set of flags, or -1 if unknown flags are found. */
+int64_t commandFlagsFromString(char *s) {
+    int count, j;
+    int64_t flags = 0;
+    sds *tokens = sdssplitlen(s,strlen(s)," ",1,&count);
+    for (j = 0; j < count; j++) {
+        char *t = tokens[j];
+        if (!strcasecmp(t,"write")) flags |= CMD_WRITE;
+        else if (!strcasecmp(t,"readonly")) flags |= CMD_READONLY;
+        else if (!strcasecmp(t,"admin")) flags |= CMD_ADMIN;
+        else if (!strcasecmp(t,"deny-oom")) flags |= CMD_DENYOOM;
+        else if (!strcasecmp(t,"deny-script")) flags |= CMD_NOSCRIPT;
+        else if (!strcasecmp(t,"allow-loading")) flags |= CMD_LOADING;
+        else if (!strcasecmp(t,"pubsub")) flags |= CMD_PUBSUB;
+        else if (!strcasecmp(t,"random")) flags |= CMD_RANDOM;
+        else if (!strcasecmp(t,"allow-stale")) flags |= CMD_STALE;
+        else if (!strcasecmp(t,"no-monitor")) flags |= CMD_SKIP_MONITOR;
+        else if (!strcasecmp(t,"no-slowlog")) flags |= CMD_SKIP_SLOWLOG;
+        else if (!strcasecmp(t,"fast")) flags |= CMD_FAST;
+        else if (!strcasecmp(t,"no-auth")) flags |= CMD_NO_AUTH;
+        else if (!strcasecmp(t,"may-replicate")) flags |= CMD_MAY_REPLICATE;
+        else if (!strcasecmp(t,"getkeys-api")) flags |= CMD_MODULE_GETKEYS;
+        else if (!strcasecmp(t,"no-cluster")) flags |= CMD_MODULE_NO_CLUSTER;
+        else break;
+    }
+    sdsfreesplitres(tokens,count);
+    if (j != count) return -1; /* Some token not processed correctly. */
+    return flags;
+}
+
+/* Register a new command in the Redis server, that will be handled by
+ * calling the function pointer 'func' using the RedisModule calling
+ * convention. The function returns REDISMODULE_ERR if the specified command
+ * name is already busy or a set of invalid flags were passed, otherwise
+ * REDISMODULE_OK is returned and the new command is registered.
+ *
+ * This function must be called during the initialization of the module
+ * inside the RedisModule_OnLoad() function. Calling this function outside
+ * of the initialization function is not defined.
+ *
+ * The command function type is the following:
+ *
+ *      int MyCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc);
+ *
+ * And is supposed to always return REDISMODULE_OK.
+ *
+ * The set of flags 'strflags' specify the behavior of the command, and should
+ * be passed as a C string composed of space separated words, like for
+ * example "write deny-oom". The set of flags are:
+ *
+ * * **"write"**:     The command may modify the data set (it may also read
+ *                    from it).
+ * * **"readonly"**:  The command returns data from keys but never writes.
+ * * **"admin"**:     The command is an administrative command (may change
+ *                    replication or perform similar tasks).
+ * * **"deny-oom"**:  The command may use additional memory and should be
+ *                    denied during out of memory conditions.
+ * * **"deny-script"**:   Don't allow this command in Lua scripts.
+ * * **"allow-loading"**: Allow this command while the server is loading data.
+ *                        Only commands not interacting with the data set
+ *                        should be allowed to run in this mode. If not sure
+ *                        don't use this flag.
+ * * **"pubsub"**:    The command publishes things on Pub/Sub channels.
+ * * **"random"**:    The command may have different outputs even starting
+ *                    from the same input arguments and key values.
+ * * **"allow-stale"**: The command is allowed to run on slaves that don't
+ *                      serve stale data. Don't use if you don't know what
+ *                      this means.
+ * * **"no-monitor"**: Don't propagate the command on monitor. Use this if
+ *                     the command has sensible data among the arguments.
+ * * **"no-slowlog"**: Don't log this command in the slowlog. Use this if
+ *                     the command has sensible data among the arguments.
+ * * **"fast"**:      The command time complexity is not greater
+ *                    than O(log(N)) where N is the size of the collection or
+ *                    anything else representing the normal scalability
+ *                    issue with the command.
+ * * **"getkeys-api"**: The command implements the interface to return
+ *                      the arguments that are keys. Used when start/stop/step
+ *                      is not enough because of the command syntax.
+ * * **"no-cluster"**: The command should not register in Redis Cluster
+ *                     since is not designed to work with it because, for
+ *                     example, is unable to report the position of the
+ *                     keys, programmatically creates key names, or any
+ *                     other reason.
+ * * **"no-auth"**:    This command can be run by an un-authenticated client.
+ *                     Normally this is used by a command that is used
+ *                     to authenticate a client. 
+ * * **"may-replicate"**: This command may generate replication traffic, even
+ *                        though it's not a write command.  
+ */
+int RM_CreateCommand(RedisModuleCtx *ctx, const char *name, RedisModuleCmdFunc cmdfunc, const char *strflags, int firstkey, int lastkey, int keystep) {
+    int64_t flags = strflags ? commandFlagsFromString((char*)strflags) : 0;
+    if (flags == -1) return REDISMODULE_ERR;
+    if ((flags & CMD_MODULE_NO_CLUSTER) && server.cluster_enabled)
+        return REDISMODULE_ERR;
+
+    struct redisCommand *rediscmd;
+    RedisModuleCommandProxy *cp;
+    sds cmdname = sdsnew(name);
+
+    /* Check if the command name is busy. */
+    if (lookupCommand(cmdname) != NULL) {
+        sdsfree(cmdname);
+        return REDISMODULE_ERR;
+    }
+
+    /* Create a command "proxy", which is a structure that is referenced
+     * in the command table, so that the generic command that works as
+     * binding between modules and Redis, can know what function to call
+     * and what the module is.
+     *
+     * Note that we use the Redis command table 'getkeys_proc' in order to
+     * pass a reference to the command proxy structure. */
+    cp = zmalloc(sizeof(*cp));
+    cp->module = ctx->module;
+    cp->func = cmdfunc;
+    cp->rediscmd = zmalloc(sizeof(*rediscmd));
+    cp->rediscmd->name = cmdname;
+    cp->rediscmd->proc = RedisModuleCommandDispatcher;
+    cp->rediscmd->arity = -1;
+    cp->rediscmd->flags = flags | CMD_MODULE;
+    cp->rediscmd->getkeys_proc = (redisGetKeysProc*)(unsigned long)cp;
+    cp->rediscmd->firstkey = firstkey;
+    cp->rediscmd->lastkey = lastkey;
+    cp->rediscmd->keystep = keystep;
+    cp->rediscmd->microseconds = 0;
+    cp->rediscmd->calls = 0;
+    cp->rediscmd->rejected_calls = 0;
+    cp->rediscmd->failed_calls = 0;
+    dictAdd(server.commands,sdsdup(cmdname),cp->rediscmd);
+    dictAdd(server.orig_commands,sdsdup(cmdname),cp->rediscmd);
+    cp->rediscmd->id = ACLGetCommandID(cmdname); /* ID used for ACL. */
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Module information and time measurement
+ * -------------------------------------------------------------------------- */
+
+void RM_SetModuleAttribs(RedisModuleCtx *ctx, const char *name, int ver, int apiver) {
+    /* Called by RM_Init() to setup the `ctx->module` structure.
+     *
+     * This is an internal function, Redis modules developers don't need
+     * to use it. */
+    RedisModule *module;
+
+    if (ctx->module != NULL) return;
+    module = zmalloc(sizeof(*module));
+    module->name = sdsnew((char*)name);
+    module->ver = ver;
+    module->apiver = apiver;
+    module->types = listCreate();
+    module->usedby = listCreate();
+    module->using = listCreate();
+    module->filters = listCreate();
+    module->in_call = 0;
+    module->in_hook = 0;
+    module->options = 0;
+    module->info_cb = 0;
+    module->defrag_cb = 0;
+    ctx->module = module;
+}
+
+/* Return non-zero if the module name is busy.
+ * Otherwise zero is returned. */
+int RM_IsModuleNameBusy(const char *name) {
+    sds modulename = sdsnew(name);
+    dictEntry *de = dictFind(modules,modulename);
+    sdsfree(modulename);
+    return de != NULL;
+}
+
+/* Return the current UNIX time in milliseconds. */
+long long RM_Milliseconds(void) {
+    return mstime();
+}
+
+/* Mark a point in time that will be used as the start time to calculate
+ * the elapsed execution time when RM_BlockedClientMeasureTimeEnd() is called.
+ * Within the same command, you can call multiple times
+ * RM_BlockedClientMeasureTimeStart() and RM_BlockedClientMeasureTimeEnd()
+ * to accummulate indepedent time intervals to the background duration.
+ * This method always return REDISMODULE_OK. */
+int RM_BlockedClientMeasureTimeStart(RedisModuleBlockedClient *bc) {
+    elapsedStart(&(bc->background_timer));
+    return REDISMODULE_OK;
+}
+
+/* Mark a point in time that will be used as the end time
+ * to calculate the elapsed execution time.
+ * On success REDISMODULE_OK is returned.
+ * This method only returns REDISMODULE_ERR if no start time was
+ * previously defined ( meaning RM_BlockedClientMeasureTimeStart was not called ). */
+int RM_BlockedClientMeasureTimeEnd(RedisModuleBlockedClient *bc) {
+    // If the counter is 0 then we haven't called RM_BlockedClientMeasureTimeStart
+    if (!bc->background_timer)
+        return REDISMODULE_ERR;
+    bc->background_duration += elapsedUs(bc->background_timer);
+    return REDISMODULE_OK;
+}
+
+/* Set flags defining capabilities or behavior bit flags.
+ *
+ * REDISMODULE_OPTIONS_HANDLE_IO_ERRORS:
+ * Generally, modules don't need to bother with this, as the process will just
+ * terminate if a read error happens, however, setting this flag would allow
+ * repl-diskless-load to work if enabled.
+ * The module should use RedisModule_IsIOError after reads, before using the
+ * data that was read, and in case of error, propagate it upwards, and also be
+ * able to release the partially populated value and all it's allocations.
+ *
+ * REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED:
+ * See RM_SignalModifiedKey().
+ */
+void RM_SetModuleOptions(RedisModuleCtx *ctx, int options) {
+    ctx->module->options = options;
+}
+
+/* Signals that the key is modified from user's perspective (i.e. invalidate WATCH
+ * and client side caching).
+ *
+ * This is done automatically when a key opened for writing is closed, unless
+ * the option REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED has been set using
+ * RM_SetModuleOptions().
+*/
+int RM_SignalModifiedKey(RedisModuleCtx *ctx, RedisModuleString *keyname) {
+    signalModifiedKey(ctx->client,ctx->client->db,keyname);
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Automatic memory management for modules
+ * -------------------------------------------------------------------------- */
+
+/* Enable automatic memory management.
+ *
+ * The function must be called as the first function of a command implementation
+ * that wants to use automatic memory.
+ *
+ * When enabled, automatic memory management tracks and automatically frees
+ * keys, call replies and Redis string objects once the command returns. In most
+ * cases this eliminates the need of calling the following functions:
+ *
+ * 1. RedisModule_CloseKey()
+ * 2. RedisModule_FreeCallReply()
+ * 3. RedisModule_FreeString()
+ *
+ * These functions can still be used with automatic memory management enabled,
+ * to optimize loops that make numerous allocations for example. */
+void RM_AutoMemory(RedisModuleCtx *ctx) {
+    ctx->flags |= REDISMODULE_CTX_AUTO_MEMORY;
+}
+
+/* Add a new object to release automatically when the callback returns. */
+void autoMemoryAdd(RedisModuleCtx *ctx, int type, void *ptr) {
+    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return;
+    if (ctx->amqueue_used == ctx->amqueue_len) {
+        ctx->amqueue_len *= 2;
+        if (ctx->amqueue_len < 16) ctx->amqueue_len = 16;
+        ctx->amqueue = zrealloc(ctx->amqueue,sizeof(struct AutoMemEntry)*ctx->amqueue_len);
+    }
+    ctx->amqueue[ctx->amqueue_used].type = type;
+    ctx->amqueue[ctx->amqueue_used].ptr = ptr;
+    ctx->amqueue_used++;
+}
+
+/* Mark an object as freed in the auto release queue, so that users can still
+ * free things manually if they want.
+ *
+ * The function returns 1 if the object was actually found in the auto memory
+ * pool, otherwise 0 is returned. */
+int autoMemoryFreed(RedisModuleCtx *ctx, int type, void *ptr) {
+    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return 0;
+
+    int count = (ctx->amqueue_used+1)/2;
+    for (int j = 0; j < count; j++) {
+        for (int side = 0; side < 2; side++) {
+            /* For side = 0 check right side of the array, for
+             * side = 1 check the left side instead (zig-zag scanning). */
+            int i = (side == 0) ? (ctx->amqueue_used - 1 - j) : j;
+            if (ctx->amqueue[i].type == type &&
+                ctx->amqueue[i].ptr == ptr)
+            {
+                ctx->amqueue[i].type = REDISMODULE_AM_FREED;
+
+                /* Switch the freed element and the last element, to avoid growing
+                 * the queue unnecessarily if we allocate/free in a loop */
+                if (i != ctx->amqueue_used-1) {
+                    ctx->amqueue[i] = ctx->amqueue[ctx->amqueue_used-1];
+                }
+
+                /* Reduce the size of the queue because we either moved the top
+                 * element elsewhere or freed it */
+                ctx->amqueue_used--;
+                return 1;
+            }
+        }
+    }
+    return 0;
+}
+
+/* Release all the objects in queue. */
+void autoMemoryCollect(RedisModuleCtx *ctx) {
+    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return;
+    /* Clear the AUTO_MEMORY flag from the context, otherwise the functions
+     * we call to free the resources, will try to scan the auto release
+     * queue to mark the entries as freed. */
+    ctx->flags &= ~REDISMODULE_CTX_AUTO_MEMORY;
+    int j;
+    for (j = 0; j < ctx->amqueue_used; j++) {
+        void *ptr = ctx->amqueue[j].ptr;
+        switch(ctx->amqueue[j].type) {
+        case REDISMODULE_AM_STRING: decrRefCount(ptr); break;
+        case REDISMODULE_AM_REPLY: RM_FreeCallReply(ptr); break;
+        case REDISMODULE_AM_KEY: RM_CloseKey(ptr); break;
+        case REDISMODULE_AM_DICT: RM_FreeDict(NULL,ptr); break;
+        case REDISMODULE_AM_INFO: RM_FreeServerInfo(NULL,ptr); break;
+        }
+    }
+    ctx->flags |= REDISMODULE_CTX_AUTO_MEMORY;
+    zfree(ctx->amqueue);
+    ctx->amqueue = NULL;
+    ctx->amqueue_len = 0;
+    ctx->amqueue_used = 0;
+}
+
+/* --------------------------------------------------------------------------
+ * ## String objects APIs
+ * -------------------------------------------------------------------------- */
+
+/* Create a new module string object. The returned string must be freed
+ * with RedisModule_FreeString(), unless automatic memory is enabled.
+ *
+ * The string is created by copying the `len` bytes starting
+ * at `ptr`. No reference is retained to the passed buffer.
+ *
+ * The module context 'ctx' is optional and may be NULL if you want to create
+ * a string out of the context scope. However in that case, the automatic
+ * memory management will not be available, and the string memory must be
+ * managed manually. */
+RedisModuleString *RM_CreateString(RedisModuleCtx *ctx, const char *ptr, size_t len) {
+    RedisModuleString *o = createStringObject(ptr,len);
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
+    return o;
+}
+
+/* Create a new module string object from a printf format and arguments.
+ * The returned string must be freed with RedisModule_FreeString(), unless
+ * automatic memory is enabled.
+ *
+ * The string is created using the sds formatter function sdscatvprintf().
+ *
+ * The passed context 'ctx' may be NULL if necessary, see the
+ * RedisModule_CreateString() documentation for more info. */
+RedisModuleString *RM_CreateStringPrintf(RedisModuleCtx *ctx, const char *fmt, ...) {
+    sds s = sdsempty();
+
+    va_list ap;
+    va_start(ap, fmt);
+    s = sdscatvprintf(s, fmt, ap);
+    va_end(ap);
+
+    RedisModuleString *o = createObject(OBJ_STRING, s);
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
+
+    return o;
+}
+
+
+/* Like RedisModule_CreatString(), but creates a string starting from a long long
+ * integer instead of taking a buffer and its length.
+ *
+ * The returned string must be released with RedisModule_FreeString() or by
+ * enabling automatic memory management.
+ *
+ * The passed context 'ctx' may be NULL if necessary, see the
+ * RedisModule_CreateString() documentation for more info. */
+RedisModuleString *RM_CreateStringFromLongLong(RedisModuleCtx *ctx, long long ll) {
+    char buf[LONG_STR_SIZE];
+    size_t len = ll2string(buf,sizeof(buf),ll);
+    return RM_CreateString(ctx,buf,len);
+}
+
+/* Like RedisModule_CreatString(), but creates a string starting from a double
+ * instead of taking a buffer and its length.
+ *
+ * The returned string must be released with RedisModule_FreeString() or by
+ * enabling automatic memory management. */
+RedisModuleString *RM_CreateStringFromDouble(RedisModuleCtx *ctx, double d) {
+    char buf[128];
+    size_t len = d2string(buf,sizeof(buf),d);
+    return RM_CreateString(ctx,buf,len);
+}
+
+/* Like RedisModule_CreatString(), but creates a string starting from a long
+ * double.
+ *
+ * The returned string must be released with RedisModule_FreeString() or by
+ * enabling automatic memory management.
+ *
+ * The passed context 'ctx' may be NULL if necessary, see the
+ * RedisModule_CreateString() documentation for more info. */
+RedisModuleString *RM_CreateStringFromLongDouble(RedisModuleCtx *ctx, long double ld, int humanfriendly) {
+    char buf[MAX_LONG_DOUBLE_CHARS];
+    size_t len = ld2string(buf,sizeof(buf),ld,
+        (humanfriendly ? LD_STR_HUMAN : LD_STR_AUTO));
+    return RM_CreateString(ctx,buf,len);
+}
+
+/* Like RedisModule_CreatString(), but creates a string starting from another
+ * RedisModuleString.
+ *
+ * The returned string must be released with RedisModule_FreeString() or by
+ * enabling automatic memory management.
+ *
+ * The passed context 'ctx' may be NULL if necessary, see the
+ * RedisModule_CreateString() documentation for more info. */
+RedisModuleString *RM_CreateStringFromString(RedisModuleCtx *ctx, const RedisModuleString *str) {
+    RedisModuleString *o = dupStringObject(str);
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
+    return o;
+}
+
+/* Creates a string from a stream ID. The returned string must be released with
+ * RedisModule_FreeString(), unless automatic memory is enabled.
+ *
+ * The passed context `ctx` may be NULL if necessary. See the
+ * RedisModule_CreateString() documentation for more info. */
+RedisModuleString *RM_CreateStringFromStreamID(RedisModuleCtx *ctx, const RedisModuleStreamID *id) {
+    streamID streamid = {id->ms, id->seq};
+    RedisModuleString *o = createObjectFromStreamID(&streamid);
+    if (ctx != NULL) autoMemoryAdd(ctx, REDISMODULE_AM_STRING, o);
+    return o;
+}
+
+/* Free a module string object obtained with one of the Redis modules API calls
+ * that return new string objects.
+ *
+ * It is possible to call this function even when automatic memory management
+ * is enabled. In that case the string will be released ASAP and removed
+ * from the pool of string to release at the end.
+ *
+ * If the string was created with a NULL context 'ctx', it is also possible to
+ * pass ctx as NULL when releasing the string (but passing a context will not
+ * create any issue). Strings created with a context should be freed also passing
+ * the context, so if you want to free a string out of context later, make sure
+ * to create it using a NULL context. */
+void RM_FreeString(RedisModuleCtx *ctx, RedisModuleString *str) {
+    decrRefCount(str);
+    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_STRING,str);
+}
+
+/* Every call to this function, will make the string 'str' requiring
+ * an additional call to RedisModule_FreeString() in order to really
+ * free the string. Note that the automatic freeing of the string obtained
+ * enabling modules automatic memory management counts for one
+ * RedisModule_FreeString() call (it is just executed automatically).
+ *
+ * Normally you want to call this function when, at the same time
+ * the following conditions are true:
+ *
+ * 1. You have automatic memory management enabled.
+ * 2. You want to create string objects.
+ * 3. Those string objects you create need to live *after* the callback
+ *    function(for example a command implementation) creating them returns.
+ *
+ * Usually you want this in order to store the created string object
+ * into your own data structure, for example when implementing a new data
+ * type.
+ *
+ * Note that when memory management is turned off, you don't need
+ * any call to RetainString() since creating a string will always result
+ * into a string that lives after the callback function returns, if
+ * no FreeString() call is performed.
+ *
+ * It is possible to call this function with a NULL context. */
+void RM_RetainString(RedisModuleCtx *ctx, RedisModuleString *str) {
+    if (ctx == NULL || !autoMemoryFreed(ctx,REDISMODULE_AM_STRING,str)) {
+        /* Increment the string reference counting only if we can't
+         * just remove the object from the list of objects that should
+         * be reclaimed. Why we do that, instead of just incrementing
+         * the refcount in any case, and let the automatic FreeString()
+         * call at the end to bring the refcount back at the desired
+         * value? Because this way we ensure that the object refcount
+         * value is 1 (instead of going to 2 to be dropped later to 1)
+         * after the call to this function. This is needed for functions
+         * like RedisModule_StringAppendBuffer() to work. */
+        incrRefCount(str);
+    }
+}
+
+/**
+* This function can be used instead of RedisModule_RetainString().
+* The main difference between the two is that this function will always
+* succeed, whereas RedisModule_RetainString() may fail because of an
+* assertion.
+* 
+* The function returns a pointer to RedisModuleString, which is owned
+* by the caller. It requires a call to RedisModule_FreeString() to free
+* the string when automatic memory management is disabled for the context.
+* When automatic memory management is enabled, you can either call
+* RedisModule_FreeString() or let the automation free it.
+* 
+* This function is more efficient than RedisModule_CreateStringFromString()
+* because whenever possible, it avoids copying the underlying
+* RedisModuleString. The disadvantage of using this function is that it
+* might not be possible to use RedisModule_StringAppendBuffer() on the
+* returned RedisModuleString.
+* 
+* It is possible to call this function with a NULL context.
+*/
+RedisModuleString* RM_HoldString(RedisModuleCtx *ctx, RedisModuleString *str) {
+    if (str->refcount == OBJ_STATIC_REFCOUNT) {
+        return RM_CreateStringFromString(ctx, str);
+    }
+
+    incrRefCount(str);
+    if (ctx != NULL) {
+        /*
+         * Put the str in the auto memory management of the ctx.
+         * It might already be there, in this case, the ref count will
+         * be 2 and we will decrease the ref count twice and free the
+         * object in the auto memory free function.
+         *
+         * Why we can not do the same trick of just remove the object
+         * from the auto memory (like in RM_RetainString)?
+         * This code shows the issue:
+         *
+         * RM_AutoMemory(ctx);
+         * str1 = RM_CreateString(ctx, "test", 4);
+         * str2 = RM_HoldString(ctx, str1);
+         * RM_FreeString(str1);
+         * RM_FreeString(str2);
+         *
+         * If after the RM_HoldString we would just remove the string from
+         * the auto memory, this example will cause access to a freed memory
+         * on 'RM_FreeString(str2);' because the String will be free
+         * on 'RM_FreeString(str1);'.
+         *
+         * So it's safer to just increase the ref count
+         * and add the String to auto memory again.
+         *
+         * The limitation is that it is not possible to use RedisModule_StringAppendBuffer
+         * on the String.
+         */
+        autoMemoryAdd(ctx,REDISMODULE_AM_STRING,str);
+    }
+    return str;
+}
+
+/* Given a string module object, this function returns the string pointer
+ * and length of the string. The returned pointer and length should only
+ * be used for read only accesses and never modified. */
+const char *RM_StringPtrLen(const RedisModuleString *str, size_t *len) {
+    if (str == NULL) {
+        const char *errmsg = "(NULL string reply referenced in module)";
+        if (len) *len = strlen(errmsg);
+        return errmsg;
+    }
+    if (len) *len = sdslen(str->ptr);
+    return str->ptr;
+}
+
+/* --------------------------------------------------------------------------
+ * Higher level string operations
+ * ------------------------------------------------------------------------- */
+
+/* Convert the string into a long long integer, storing it at `*ll`.
+ * Returns REDISMODULE_OK on success. If the string can't be parsed
+ * as a valid, strict long long (no spaces before/after), REDISMODULE_ERR
+ * is returned. */
+int RM_StringToLongLong(const RedisModuleString *str, long long *ll) {
+    return string2ll(str->ptr,sdslen(str->ptr),ll) ? REDISMODULE_OK :
+                                                     REDISMODULE_ERR;
+}
+
+/* Convert the string into a double, storing it at `*d`.
+ * Returns REDISMODULE_OK on success or REDISMODULE_ERR if the string is
+ * not a valid string representation of a double value. */
+int RM_StringToDouble(const RedisModuleString *str, double *d) {
+    int retval = getDoubleFromObject(str,d);
+    return (retval == C_OK) ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Convert the string into a long double, storing it at `*ld`.
+ * Returns REDISMODULE_OK on success or REDISMODULE_ERR if the string is
+ * not a valid string representation of a double value. */
+int RM_StringToLongDouble(const RedisModuleString *str, long double *ld) {
+    int retval = string2ld(str->ptr,sdslen(str->ptr),ld);
+    return retval ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Convert the string into a stream ID, storing it at `*id`.
+ * Returns REDISMODULE_OK on success and returns REDISMODULE_ERR if the string
+ * is not a valid string representation of a stream ID. The special IDs "+" and
+ * "-" are allowed.
+ */
+int RM_StringToStreamID(const RedisModuleString *str, RedisModuleStreamID *id) {
+    streamID streamid;
+    if (streamParseID(str, &streamid) == C_OK) {
+        id->ms = streamid.ms;
+        id->seq = streamid.seq;
+        return REDISMODULE_OK;
+    } else {
+        return REDISMODULE_ERR;
+    }
+}
+
+/* Compare two string objects, returning -1, 0 or 1 respectively if
+ * a < b, a == b, a > b. Strings are compared byte by byte as two
+ * binary blobs without any encoding care / collation attempt. */
+int RM_StringCompare(RedisModuleString *a, RedisModuleString *b) {
+    return compareStringObjects(a,b);
+}
+
+/* Return the (possibly modified in encoding) input 'str' object if
+ * the string is unshared, otherwise NULL is returned. */
+RedisModuleString *moduleAssertUnsharedString(RedisModuleString *str) {
+    if (str->refcount != 1) {
+        serverLog(LL_WARNING,
+            "Module attempted to use an in-place string modify operation "
+            "with a string referenced multiple times. Please check the code "
+            "for API usage correctness.");
+        return NULL;
+    }
+    if (str->encoding == OBJ_ENCODING_EMBSTR) {
+        /* Note: here we "leak" the additional allocation that was
+         * used in order to store the embedded string in the object. */
+        str->ptr = sdsnewlen(str->ptr,sdslen(str->ptr));
+        str->encoding = OBJ_ENCODING_RAW;
+    } else if (str->encoding == OBJ_ENCODING_INT) {
+        /* Convert the string from integer to raw encoding. */
+        str->ptr = sdsfromlonglong((long)str->ptr);
+        str->encoding = OBJ_ENCODING_RAW;
+    }
+    return str;
+}
+
+/* Append the specified buffer to the string 'str'. The string must be a
+ * string created by the user that is referenced only a single time, otherwise
+ * REDISMODULE_ERR is returned and the operation is not performed. */
+int RM_StringAppendBuffer(RedisModuleCtx *ctx, RedisModuleString *str, const char *buf, size_t len) {
+    UNUSED(ctx);
+    str = moduleAssertUnsharedString(str);
+    if (str == NULL) return REDISMODULE_ERR;
+    str->ptr = sdscatlen(str->ptr,buf,len);
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Reply APIs
+ *
+ * These functions are used for sending replies to the client.
+ *
+ * Most functions always return REDISMODULE_OK so you can use it with
+ * 'return' in order to return from the command implementation with:
+ *
+ *     if (... some condition ...)
+ *         return RedisModule_ReplyWithLongLong(ctx,mycount);
+ * -------------------------------------------------------------------------- */
+
+/* Send an error about the number of arguments given to the command,
+ * citing the command name in the error message. Returns REDISMODULE_OK.
+ *
+ * Example:
+ *
+ *     if (argc != 3) return RedisModule_WrongArity(ctx);
+ */
+int RM_WrongArity(RedisModuleCtx *ctx) {
+    addReplyErrorFormat(ctx->client,
+        "wrong number of arguments for '%s' command",
+        (char*)ctx->client->argv[0]->ptr);
+    return REDISMODULE_OK;
+}
+
+/* Return the client object the `RM_Reply*` functions should target.
+ * Normally this is just `ctx->client`, that is the client that called
+ * the module command, however in the case of thread safe contexts there
+ * is no directly associated client (since it would not be safe to access
+ * the client from a thread), so instead the blocked client object referenced
+ * in the thread safe context, has a fake client that we just use to accumulate
+ * the replies. Later, when the client is unblocked, the accumulated replies
+ * are appended to the actual client.
+ *
+ * The function returns the client pointer depending on the context, or
+ * NULL if there is no potential client. This happens when we are in the
+ * context of a thread safe context that was not initialized with a blocked
+ * client object. Other contexts without associated clients are the ones
+ * initialized to run the timers callbacks. */
+client *moduleGetReplyClient(RedisModuleCtx *ctx) {
+    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) {
+        if (ctx->blocked_client)
+            return ctx->blocked_client->reply_client;
+        else
+            return NULL;
+    } else {
+        /* If this is a non thread safe context, just return the client
+         * that is running the command if any. This may be NULL as well
+         * in the case of contexts that are not executed with associated
+         * clients, like timer contexts. */
+        return ctx->client;
+    }
+}
+
+/* Send an integer reply to the client, with the specified long long value.
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithLongLong(RedisModuleCtx *ctx, long long ll) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyLongLong(c,ll);
+    return REDISMODULE_OK;
+}
+
+/* Reply with the error 'err'.
+ *
+ * Note that 'err' must contain all the error, including
+ * the initial error code. The function only provides the initial "-", so
+ * the usage is, for example:
+ *
+ *     RedisModule_ReplyWithError(ctx,"ERR Wrong Type");
+ *
+ * and not just:
+ *
+ *     RedisModule_ReplyWithError(ctx,"Wrong Type");
+ *
+ * The function always returns REDISMODULE_OK.
+ */
+int RM_ReplyWithError(RedisModuleCtx *ctx, const char *err) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyErrorFormat(c,"-%s",err);
+    return REDISMODULE_OK;
+}
+
+/* Reply with a simple string (`+... \r\n` in RESP protocol). This replies
+ * are suitable only when sending a small non-binary string with small
+ * overhead, like "OK" or similar replies.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithSimpleString(RedisModuleCtx *ctx, const char *msg) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyProto(c,"+",1);
+    addReplyProto(c,msg,strlen(msg));
+    addReplyProto(c,"\r\n",2);
+    return REDISMODULE_OK;
+}
+
+/* Reply with an array type of 'len' elements. However 'len' other calls
+ * to `ReplyWith*` style functions must follow in order to emit the elements
+ * of the array.
+ *
+ * When producing arrays with a number of element that is not known beforehand
+ * the function can be called with the special count
+ * REDISMODULE_POSTPONED_ARRAY_LEN, and the actual number of elements can be
+ * later set with RedisModule_ReplySetArrayLength() (which will set the
+ * latest "open" count if there are multiple ones).
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithArray(RedisModuleCtx *ctx, long len) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    if (len == REDISMODULE_POSTPONED_ARRAY_LEN) {
+        ctx->postponed_arrays = zrealloc(ctx->postponed_arrays,sizeof(void*)*
+                (ctx->postponed_arrays_count+1));
+        ctx->postponed_arrays[ctx->postponed_arrays_count] =
+            addReplyDeferredLen(c);
+        ctx->postponed_arrays_count++;
+    } else {
+        addReplyArrayLen(c,len);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Reply to the client with a null array, simply null in RESP3 
+ * null array in RESP2.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithNullArray(RedisModuleCtx *ctx) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyNullArray(c);
+    return REDISMODULE_OK;
+}
+
+/* Reply to the client with an empty array. 
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithEmptyArray(RedisModuleCtx *ctx) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReply(c,shared.emptyarray);
+    return REDISMODULE_OK;
+}
+
+/* When RedisModule_ReplyWithArray() is used with the argument
+ * REDISMODULE_POSTPONED_ARRAY_LEN, because we don't know beforehand the number
+ * of items we are going to output as elements of the array, this function
+ * will take care to set the array length.
+ *
+ * Since it is possible to have multiple array replies pending with unknown
+ * length, this function guarantees to always set the latest array length
+ * that was created in a postponed way.
+ *
+ * For example in order to output an array like [1,[10,20,30]] we
+ * could write:
+ *
+ *      RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+ *      RedisModule_ReplyWithLongLong(ctx,1);
+ *      RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+ *      RedisModule_ReplyWithLongLong(ctx,10);
+ *      RedisModule_ReplyWithLongLong(ctx,20);
+ *      RedisModule_ReplyWithLongLong(ctx,30);
+ *      RedisModule_ReplySetArrayLength(ctx,3); // Set len of 10,20,30 array.
+ *      RedisModule_ReplySetArrayLength(ctx,2); // Set len of top array
+ *
+ * Note that in the above example there is no reason to postpone the array
+ * length, since we produce a fixed number of elements, but in the practice
+ * the code may use an iterator or other ways of creating the output so
+ * that is not easy to calculate in advance the number of elements.
+ */
+void RM_ReplySetArrayLength(RedisModuleCtx *ctx, long len) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return;
+    if (ctx->postponed_arrays_count == 0) {
+        serverLog(LL_WARNING,
+            "API misuse detected in module %s: "
+            "RedisModule_ReplySetArrayLength() called without previous "
+            "RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN) "
+            "call.", ctx->module->name);
+            return;
+    }
+    ctx->postponed_arrays_count--;
+    setDeferredArrayLen(c,
+            ctx->postponed_arrays[ctx->postponed_arrays_count],
+            len);
+    if (ctx->postponed_arrays_count == 0) {
+        zfree(ctx->postponed_arrays);
+        ctx->postponed_arrays = NULL;
+    }
+}
+
+/* Reply with a bulk string, taking in input a C buffer pointer and length.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithStringBuffer(RedisModuleCtx *ctx, const char *buf, size_t len) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyBulkCBuffer(c,(char*)buf,len);
+    return REDISMODULE_OK;
+}
+
+/* Reply with a bulk string, taking in input a C buffer pointer that is
+ * assumed to be null-terminated.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithCString(RedisModuleCtx *ctx, const char *buf) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyBulkCString(c,(char*)buf);
+    return REDISMODULE_OK;
+}
+
+/* Reply with a bulk string, taking in input a RedisModuleString object.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithString(RedisModuleCtx *ctx, RedisModuleString *str) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyBulk(c,str);
+    return REDISMODULE_OK;
+}
+
+/* Reply with an empty string.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithEmptyString(RedisModuleCtx *ctx) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReply(c,shared.emptybulk);
+    return REDISMODULE_OK;
+}
+
+/* Reply with a binary safe string, which should not be escaped or filtered 
+ * taking in input a C buffer pointer and length.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithVerbatimString(RedisModuleCtx *ctx, const char *buf, size_t len) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyVerbatim(c, buf, len, "txt");
+    return REDISMODULE_OK;
+}
+
+/* Reply to the client with a NULL.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithNull(RedisModuleCtx *ctx) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyNull(c);
+    return REDISMODULE_OK;
+}
+
+/* Reply exactly what a Redis command returned us with RedisModule_Call().
+ * This function is useful when we use RedisModule_Call() in order to
+ * execute some command, as we want to reply to the client exactly the
+ * same reply we obtained by the command.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithCallReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    sds proto = sdsnewlen(reply->proto, reply->protolen);
+    addReplySds(c,proto);
+    return REDISMODULE_OK;
+}
+
+/* Send a string reply obtained converting the double 'd' into a bulk string.
+ * This function is basically equivalent to converting a double into
+ * a string into a C buffer, and then calling the function
+ * RedisModule_ReplyWithStringBuffer() with the buffer and length.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithDouble(RedisModuleCtx *ctx, double d) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyDouble(c,d);
+    return REDISMODULE_OK;
+}
+
+/* Send a string reply obtained converting the long double 'ld' into a bulk
+ * string. This function is basically equivalent to converting a long double
+ * into a string into a C buffer, and then calling the function
+ * RedisModule_ReplyWithStringBuffer() with the buffer and length.
+ * The double string uses human readable formatting (see
+ * `addReplyHumanLongDouble` in networking.c).
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplyWithLongDouble(RedisModuleCtx *ctx, long double ld) {
+    client *c = moduleGetReplyClient(ctx);
+    if (c == NULL) return REDISMODULE_OK;
+    addReplyHumanLongDouble(c, ld);
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Commands replication API
+ * -------------------------------------------------------------------------- */
+
+/* Helper function to replicate MULTI the first time we replicate something
+ * in the context of a command execution. EXEC will be handled by the
+ * RedisModuleCommandDispatcher() function. */
+void moduleReplicateMultiIfNeeded(RedisModuleCtx *ctx) {
+    /* Skip this if client explicitly wrap the command with MULTI, or if
+     * the module command was called by a script. */
+    if (server.in_eval || server.in_exec) return;
+    /* If we already emitted MULTI return ASAP. */
+    if (server.propagate_in_transaction) return;
+    /* If this is a thread safe context, we do not want to wrap commands
+     * executed into MULTI/EXEC, they are executed as single commands
+     * from an external client in essence. */
+    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) return;
+    /* If this is a callback context, and not a module command execution
+     * context, we have to setup the op array for the "also propagate" API
+     * so that RM_Replicate() will work. */
+    if (!(ctx->flags & REDISMODULE_CTX_MODULE_COMMAND_CALL)) {
+        serverAssert(ctx->saved_oparray.ops == NULL);
+        ctx->saved_oparray = server.also_propagate;
+        redisOpArrayInit(&server.also_propagate);
+    }
+    execCommandPropagateMulti(ctx->client->db->id);
+    ctx->flags |= REDISMODULE_CTX_MULTI_EMITTED;
+}
+
+/* Replicate the specified command and arguments to slaves and AOF, as effect
+ * of execution of the calling command implementation.
+ *
+ * The replicated commands are always wrapped into the MULTI/EXEC that
+ * contains all the commands replicated in a given module command
+ * execution. However the commands replicated with RedisModule_Call()
+ * are the first items, the ones replicated with RedisModule_Replicate()
+ * will all follow before the EXEC.
+ *
+ * Modules should try to use one interface or the other.
+ *
+ * This command follows exactly the same interface of RedisModule_Call(),
+ * so a set of format specifiers must be passed, followed by arguments
+ * matching the provided format specifiers.
+ *
+ * Please refer to RedisModule_Call() for more information.
+ *
+ * Using the special "A" and "R" modifiers, the caller can exclude either
+ * the AOF or the replicas from the propagation of the specified command.
+ * Otherwise, by default, the command will be propagated in both channels.
+ *
+ * #### Note about calling this function from a thread safe context:
+ *
+ * Normally when you call this function from the callback implementing a
+ * module command, or any other callback provided by the Redis Module API,
+ * Redis will accumulate all the calls to this function in the context of
+ * the callback, and will propagate all the commands wrapped in a MULTI/EXEC
+ * transaction. However when calling this function from a threaded safe context
+ * that can live an undefined amount of time, and can be locked/unlocked in
+ * at will, the behavior is different: MULTI/EXEC wrapper is not emitted
+ * and the command specified is inserted in the AOF and replication stream
+ * immediately.
+ *
+ * #### Return value
+ *
+ * The command returns REDISMODULE_ERR if the format specifiers are invalid
+ * or the command name does not belong to a known command. */
+int RM_Replicate(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) {
+    struct redisCommand *cmd;
+    robj **argv = NULL;
+    int argc = 0, flags = 0, j;
+    va_list ap;
+
+    cmd = lookupCommandByCString((char*)cmdname);
+    if (!cmd) return REDISMODULE_ERR;
+
+    /* Create the client and dispatch the command. */
+    va_start(ap, fmt);
+    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
+    va_end(ap);
+    if (argv == NULL) return REDISMODULE_ERR;
+
+    /* Select the propagation target. Usually is AOF + replicas, however
+     * the caller can exclude one or the other using the "A" or "R"
+     * modifiers. */
+    int target = 0;
+    if (!(flags & REDISMODULE_ARGV_NO_AOF)) target |= PROPAGATE_AOF;
+    if (!(flags & REDISMODULE_ARGV_NO_REPLICAS)) target |= PROPAGATE_REPL;
+
+    /* Replicate! When we are in a threaded context, we want to just insert
+     * the replicated command ASAP, since it is not clear when the context
+     * will stop being used, so accumulating stuff does not make much sense,
+     * nor we could easily use the alsoPropagate() API from threads. */
+    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) {
+        propagate(cmd,ctx->client->db->id,argv,argc,target);
+    } else {
+        moduleReplicateMultiIfNeeded(ctx);
+        alsoPropagate(cmd,ctx->client->db->id,argv,argc,target);
+    }
+
+    /* Release the argv. */
+    for (j = 0; j < argc; j++) decrRefCount(argv[j]);
+    zfree(argv);
+    server.dirty++;
+    return REDISMODULE_OK;
+}
+
+/* This function will replicate the command exactly as it was invoked
+ * by the client. Note that this function will not wrap the command into
+ * a MULTI/EXEC stanza, so it should not be mixed with other replication
+ * commands.
+ *
+ * Basically this form of replication is useful when you want to propagate
+ * the command to the slaves and AOF file exactly as it was called, since
+ * the command can just be re-executed to deterministically re-create the
+ * new state starting from the old one.
+ *
+ * The function always returns REDISMODULE_OK. */
+int RM_ReplicateVerbatim(RedisModuleCtx *ctx) {
+    alsoPropagate(ctx->client->cmd,ctx->client->db->id,
+        ctx->client->argv,ctx->client->argc,
+        PROPAGATE_AOF|PROPAGATE_REPL);
+    server.dirty++;
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## DB and Key APIs -- Generic API
+ * -------------------------------------------------------------------------- */
+
+/* Return the ID of the current client calling the currently active module
+ * command. The returned ID has a few guarantees:
+ *
+ * 1. The ID is different for each different client, so if the same client
+ *    executes a module command multiple times, it can be recognized as
+ *    having the same ID, otherwise the ID will be different.
+ * 2. The ID increases monotonically. Clients connecting to the server later
+ *    are guaranteed to get IDs greater than any past ID previously seen.
+ *
+ * Valid IDs are from 1 to 2^64 - 1. If 0 is returned it means there is no way
+ * to fetch the ID in the context the function was currently called.
+ *
+ * After obtaining the ID, it is possible to check if the command execution
+ * is actually happening in the context of AOF loading, using this macro:
+ *
+ *      if (RedisModule_IsAOFClient(RedisModule_GetClientId(ctx)) {
+ *          // Handle it differently.
+ *      }
+ */
+unsigned long long RM_GetClientId(RedisModuleCtx *ctx) {
+    if (ctx->client == NULL) return 0;
+    return ctx->client->id;
+}
+
+/* Return the ACL user name used by the client with the specified client ID.
+ * Client ID can be obtained with RM_GetClientId() API. If the client does not
+ * exist, NULL is returned and errno is set to ENOENT. If the client isn't 
+ * using an ACL user, NULL is returned and errno is set to ENOTSUP */
+RedisModuleString *RM_GetClientUserNameById(RedisModuleCtx *ctx, uint64_t id) {
+    client *client = lookupClientByID(id);
+    if (client == NULL) {
+        errno = ENOENT;
+        return NULL;
+    }
+    
+    if (client->user == NULL) {
+        errno = ENOTSUP;
+        return NULL;
+    }
+
+    sds name = sdsnew(client->user->name);
+    robj *str = createObject(OBJ_STRING, name);
+    autoMemoryAdd(ctx, REDISMODULE_AM_STRING, str);
+    return str;
+}
+
+/* This is an helper for RM_GetClientInfoById() and other functions: given
+ * a client, it populates the client info structure with the appropriate
+ * fields depending on the version provided. If the version is not valid
+ * then REDISMODULE_ERR is returned. Otherwise the function returns
+ * REDISMODULE_OK and the structure pointed by 'ci' gets populated. */
+
+int modulePopulateClientInfoStructure(void *ci, client *client, int structver) {
+    if (structver != 1) return REDISMODULE_ERR;
+
+    RedisModuleClientInfoV1 *ci1 = ci;
+    memset(ci1,0,sizeof(*ci1));
+    ci1->version = structver;
+    if (client->flags & CLIENT_MULTI)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_MULTI;
+    if (client->flags & CLIENT_PUBSUB)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_PUBSUB;
+    if (client->flags & CLIENT_UNIX_SOCKET)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET;
+    if (client->flags & CLIENT_TRACKING)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_TRACKING;
+    if (client->flags & CLIENT_BLOCKED)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_BLOCKED;
+    if (connGetType(client->conn) == CONN_TYPE_TLS)
+        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_SSL;
+
+    int port;
+    connPeerToString(client->conn,ci1->addr,sizeof(ci1->addr),&port);
+    ci1->port = port;
+    ci1->db = client->db->id;
+    ci1->id = client->id;
+    return REDISMODULE_OK;
+}
+
+/* This is an helper for moduleFireServerEvent() and other functions:
+ * It populates the replication info structure with the appropriate
+ * fields depending on the version provided. If the version is not valid
+ * then REDISMODULE_ERR is returned. Otherwise the function returns
+ * REDISMODULE_OK and the structure pointed by 'ri' gets populated. */
+int modulePopulateReplicationInfoStructure(void *ri, int structver) {
+    if (structver != 1) return REDISMODULE_ERR;
+
+    RedisModuleReplicationInfoV1 *ri1 = ri;
+    memset(ri1,0,sizeof(*ri1));
+    ri1->version = structver;
+    ri1->master = server.masterhost==NULL;
+    ri1->masterhost = server.masterhost? server.masterhost: "";
+    ri1->masterport = server.masterport;
+    ri1->replid1 = server.replid;
+    ri1->replid2 = server.replid2;
+    ri1->repl1_offset = server.master_repl_offset;
+    ri1->repl2_offset = server.second_replid_offset;
+    return REDISMODULE_OK;
+}
+
+/* Return information about the client with the specified ID (that was
+ * previously obtained via the RedisModule_GetClientId() API). If the
+ * client exists, REDISMODULE_OK is returned, otherwise REDISMODULE_ERR
+ * is returned.
+ *
+ * When the client exist and the `ci` pointer is not NULL, but points to
+ * a structure of type RedisModuleClientInfo, previously initialized with
+ * the correct REDISMODULE_CLIENTINFO_INITIALIZER, the structure is populated
+ * with the following fields:
+ *
+ *      uint64_t flags;         // REDISMODULE_CLIENTINFO_FLAG_*
+ *      uint64_t id;            // Client ID
+ *      char addr[46];          // IPv4 or IPv6 address.
+ *      uint16_t port;          // TCP port.
+ *      uint16_t db;            // Selected DB.
+ *
+ * Note: the client ID is useless in the context of this call, since we
+ *       already know, however the same structure could be used in other
+ *       contexts where we don't know the client ID, yet the same structure
+ *       is returned.
+ *
+ * With flags having the following meaning:
+ *
+ *     REDISMODULE_CLIENTINFO_FLAG_SSL          Client using SSL connection.
+ *     REDISMODULE_CLIENTINFO_FLAG_PUBSUB       Client in Pub/Sub mode.
+ *     REDISMODULE_CLIENTINFO_FLAG_BLOCKED      Client blocked in command.
+ *     REDISMODULE_CLIENTINFO_FLAG_TRACKING     Client with keys tracking on.
+ *     REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET   Client using unix domain socket.
+ *     REDISMODULE_CLIENTINFO_FLAG_MULTI        Client in MULTI state.
+ *
+ * However passing NULL is a way to just check if the client exists in case
+ * we are not interested in any additional information.
+ *
+ * This is the correct usage when we want the client info structure
+ * returned:
+ *
+ *      RedisModuleClientInfo ci = REDISMODULE_CLIENTINFO_INITIALIZER;
+ *      int retval = RedisModule_GetClientInfoById(&ci,client_id);
+ *      if (retval == REDISMODULE_OK) {
+ *          printf("Address: %s\n", ci.addr);
+ *      }
+ */
+int RM_GetClientInfoById(void *ci, uint64_t id) {
+    client *client = lookupClientByID(id);
+    if (client == NULL) return REDISMODULE_ERR;
+    if (ci == NULL) return REDISMODULE_OK;
+
+    /* Fill the info structure if passed. */
+    uint64_t structver = ((uint64_t*)ci)[0];
+    return modulePopulateClientInfoStructure(ci,client,structver);
+}
+
+/* Publish a message to subscribers (see PUBLISH command). */
+int RM_PublishMessage(RedisModuleCtx *ctx, RedisModuleString *channel, RedisModuleString *message) {
+    UNUSED(ctx);
+    int receivers = pubsubPublishMessage(channel, message);
+    if (server.cluster_enabled)
+        clusterPropagatePublish(channel, message);
+    return receivers;
+}
+
+/* Return the currently selected DB. */
+int RM_GetSelectedDb(RedisModuleCtx *ctx) {
+    return ctx->client->db->id;
+}
+
+
+/* Return the current context's flags. The flags provide information on the
+ * current request context (whether the client is a Lua script or in a MULTI),
+ * and about the Redis instance in general, i.e replication and persistence.
+ *
+ * It is possible to call this function even with a NULL context, however
+ * in this case the following flags will not be reported:
+ *
+ *  * LUA, MULTI, REPLICATED, DIRTY (see below for more info).
+ *
+ * Available flags and their meaning:
+ *
+ *  * REDISMODULE_CTX_FLAGS_LUA: The command is running in a Lua script
+ *
+ *  * REDISMODULE_CTX_FLAGS_MULTI: The command is running inside a transaction
+ *
+ *  * REDISMODULE_CTX_FLAGS_REPLICATED: The command was sent over the replication
+ *    link by the MASTER
+ *
+ *  * REDISMODULE_CTX_FLAGS_MASTER: The Redis instance is a master
+ *
+ *  * REDISMODULE_CTX_FLAGS_SLAVE: The Redis instance is a slave
+ *
+ *  * REDISMODULE_CTX_FLAGS_READONLY: The Redis instance is read-only
+ *
+ *  * REDISMODULE_CTX_FLAGS_CLUSTER: The Redis instance is in cluster mode
+ *
+ *  * REDISMODULE_CTX_FLAGS_AOF: The Redis instance has AOF enabled
+ *
+ *  * REDISMODULE_CTX_FLAGS_RDB: The instance has RDB enabled
+ *
+ *  * REDISMODULE_CTX_FLAGS_MAXMEMORY:  The instance has Maxmemory set
+ *
+ *  * REDISMODULE_CTX_FLAGS_EVICT:  Maxmemory is set and has an eviction
+ *    policy that may delete keys
+ *
+ *  * REDISMODULE_CTX_FLAGS_OOM: Redis is out of memory according to the
+ *    maxmemory setting.
+ *
+ *  * REDISMODULE_CTX_FLAGS_OOM_WARNING: Less than 25% of memory remains before
+ *                                       reaching the maxmemory level.
+ *
+ *  * REDISMODULE_CTX_FLAGS_LOADING: Server is loading RDB/AOF
+ *
+ *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE: No active link with the master.
+ *
+ *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING: The replica is trying to
+ *                                                 connect with the master.
+ *
+ *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING: Master -> Replica RDB
+ *                                                   transfer is in progress.
+ *
+ *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE: The replica has an active link
+ *                                             with its master. This is the
+ *                                             contrary of STALE state.
+ *
+ *  * REDISMODULE_CTX_FLAGS_ACTIVE_CHILD: There is currently some background
+ *                                        process active (RDB, AUX or module).
+ *
+ *  * REDISMODULE_CTX_FLAGS_MULTI_DIRTY: The next EXEC will fail due to dirty
+ *                                       CAS (touched keys).
+ *
+ *  * REDISMODULE_CTX_FLAGS_IS_CHILD: Redis is currently running inside
+ *                                    background child process.
+ */
+int RM_GetContextFlags(RedisModuleCtx *ctx) {
+    int flags = 0;
+
+    /* Client specific flags */
+    if (ctx) {
+        if (ctx->client) {
+            if (ctx->client->flags & CLIENT_DENY_BLOCKING)
+                flags |= REDISMODULE_CTX_FLAGS_DENY_BLOCKING;
+            /* Module command received from MASTER, is replicated. */
+            if (ctx->client->flags & CLIENT_MASTER)
+                flags |= REDISMODULE_CTX_FLAGS_REPLICATED;
+        }
+
+        /* For DIRTY flags, we need the blocked client if used */
+        client *c = ctx->blocked_client ? ctx->blocked_client->client : ctx->client;
+        if (c && (c->flags & (CLIENT_DIRTY_CAS|CLIENT_DIRTY_EXEC))) {
+            flags |= REDISMODULE_CTX_FLAGS_MULTI_DIRTY;
+        }
+    }
+
+    if (server.in_eval)
+        flags |= REDISMODULE_CTX_FLAGS_LUA;
+
+    if (server.in_exec)
+        flags |= REDISMODULE_CTX_FLAGS_MULTI;
+
+    if (server.cluster_enabled)
+        flags |= REDISMODULE_CTX_FLAGS_CLUSTER;
+
+    if (server.loading)
+        flags |= REDISMODULE_CTX_FLAGS_LOADING;
+
+    /* Maxmemory and eviction policy */
+    if (server.maxmemory > 0 && (!server.masterhost || !server.repl_slave_ignore_maxmemory)) {
+        flags |= REDISMODULE_CTX_FLAGS_MAXMEMORY;
+
+        if (server.maxmemory_policy != MAXMEMORY_NO_EVICTION)
+            flags |= REDISMODULE_CTX_FLAGS_EVICT;
+    }
+
+    /* Persistence flags */
+    if (server.aof_state != AOF_OFF)
+        flags |= REDISMODULE_CTX_FLAGS_AOF;
+    if (server.saveparamslen > 0)
+        flags |= REDISMODULE_CTX_FLAGS_RDB;
+
+    /* Replication flags */
+    if (server.masterhost == NULL) {
+        flags |= REDISMODULE_CTX_FLAGS_MASTER;
+    } else {
+        flags |= REDISMODULE_CTX_FLAGS_SLAVE;
+        if (server.repl_slave_ro)
+            flags |= REDISMODULE_CTX_FLAGS_READONLY;
+
+        /* Replica state flags. */
+        if (server.repl_state == REPL_STATE_CONNECT ||
+            server.repl_state == REPL_STATE_CONNECTING)
+        {
+            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING;
+        } else if (server.repl_state == REPL_STATE_TRANSFER) {
+            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING;
+        } else if (server.repl_state == REPL_STATE_CONNECTED) {
+            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE;
+        }
+
+        if (server.repl_state != REPL_STATE_CONNECTED)
+            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE;
+    }
+
+    /* OOM flag. */
+    float level;
+    int retval = getMaxmemoryState(NULL,NULL,NULL,&level);
+    if (retval == C_ERR) flags |= REDISMODULE_CTX_FLAGS_OOM;
+    if (level > 0.75) flags |= REDISMODULE_CTX_FLAGS_OOM_WARNING;
+
+    /* Presence of children processes. */
+    if (hasActiveChildProcess()) flags |= REDISMODULE_CTX_FLAGS_ACTIVE_CHILD;
+    if (server.in_fork_child) flags |= REDISMODULE_CTX_FLAGS_IS_CHILD;
+
+    return flags;
+}
+
+/* Returns true if some client sent the CLIENT PAUSE command to the server or
+ * if Redis Cluster is doing a manual failover, and paused tue clients.
+ * This is needed when we have a master with replicas, and want to write,
+ * without adding further data to the replication channel, that the replicas
+ * replication offset, match the one of the master. When this happens, it is
+ * safe to failover the master without data loss.
+ *
+ * However modules may generate traffic by calling RedisModule_Call() with
+ * the "!" flag, or by calling RedisModule_Replicate(), in a context outside
+ * commands execution, for instance in timeout callbacks, threads safe
+ * contexts, and so forth. When modules will generate too much traffic, it
+ * will be hard for the master and replicas offset to match, because there
+ * is more data to send in the replication channel.
+ *
+ * So modules may want to try to avoid very heavy background work that has
+ * the effect of creating data to the replication channel, when this function
+ * returns true. This is mostly useful for modules that have background
+ * garbage collection tasks, or that do writes and replicate such writes
+ * periodically in timer callbacks or other periodic callbacks.
+ */
+int RM_AvoidReplicaTraffic() {
+    return checkClientPauseTimeoutAndReturnIfPaused();
+}
+
+/* Change the currently selected DB. Returns an error if the id
+ * is out of range.
+ *
+ * Note that the client will retain the currently selected DB even after
+ * the Redis command implemented by the module calling this function
+ * returns.
+ *
+ * If the module command wishes to change something in a different DB and
+ * returns back to the original one, it should call RedisModule_GetSelectedDb()
+ * before in order to restore the old DB number before returning. */
+int RM_SelectDb(RedisModuleCtx *ctx, int newid) {
+    int retval = selectDb(ctx->client,newid);
+    return (retval == C_OK) ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Initialize a RedisModuleKey struct */
+static void moduleInitKey(RedisModuleKey *kp, RedisModuleCtx *ctx, robj *keyname, robj *value, int mode){
+    kp->ctx = ctx;
+    kp->db = ctx->client->db;
+    kp->key = keyname;
+    incrRefCount(keyname);
+    kp->value = value;
+    kp->iter = NULL;
+    kp->mode = mode;
+    if (kp->value) moduleInitKeyTypeSpecific(kp);
+}
+
+/* Initialize the type-specific part of the key. Only when key has a value. */
+static void moduleInitKeyTypeSpecific(RedisModuleKey *key) {
+    switch (key->value->type) {
+    case OBJ_ZSET: zsetKeyReset(key); break;
+    case OBJ_STREAM: key->u.stream.signalready = 0; break;
+    }
+}
+
+/* Return an handle representing a Redis key, so that it is possible
+ * to call other APIs with the key handle as argument to perform
+ * operations on the key.
+ *
+ * The return value is the handle representing the key, that must be
+ * closed with RM_CloseKey().
+ *
+ * If the key does not exist and WRITE mode is requested, the handle
+ * is still returned, since it is possible to perform operations on
+ * a yet not existing key (that will be created, for example, after
+ * a list push operation). If the mode is just READ instead, and the
+ * key does not exist, NULL is returned. However it is still safe to
+ * call RedisModule_CloseKey() and RedisModule_KeyType() on a NULL
+ * value. */
+void *RM_OpenKey(RedisModuleCtx *ctx, robj *keyname, int mode) {
+    RedisModuleKey *kp;
+    robj *value;
+    int flags = mode & REDISMODULE_OPEN_KEY_NOTOUCH? LOOKUP_NOTOUCH: 0;
+
+    if (mode & REDISMODULE_WRITE) {
+        value = lookupKeyWriteWithFlags(ctx->client->db,keyname, flags);
+    } else {
+        value = lookupKeyReadWithFlags(ctx->client->db,keyname, flags);
+        if (value == NULL) {
+            return NULL;
+        }
+    }
+
+    /* Setup the key handle. */
+    kp = zmalloc(sizeof(*kp));
+    moduleInitKey(kp, ctx, keyname, value, mode);
+    autoMemoryAdd(ctx,REDISMODULE_AM_KEY,kp);
+    return (void*)kp;
+}
+
+/* Destroy a RedisModuleKey struct (freeing is the responsibility of the caller). */
+static void moduleCloseKey(RedisModuleKey *key) {
+    int signal = SHOULD_SIGNAL_MODIFIED_KEYS(key->ctx);
+    if ((key->mode & REDISMODULE_WRITE) && signal)
+        signalModifiedKey(key->ctx->client,key->db,key->key);
+    if (key->iter) zfree(key->iter);
+    RM_ZsetRangeStop(key);
+    if (key && key->value && key->value->type == OBJ_STREAM &&
+        key->u.stream.signalready) {
+        /* One of more RM_StreamAdd() have been done. */
+        signalKeyAsReady(key->db, key->key, OBJ_STREAM);
+    }
+    decrRefCount(key->key);
+}
+
+/* Close a key handle. */
+void RM_CloseKey(RedisModuleKey *key) {
+    if (key == NULL) return;
+    moduleCloseKey(key);
+    autoMemoryFreed(key->ctx,REDISMODULE_AM_KEY,key);
+    zfree(key);
+}
+
+/* Return the type of the key. If the key pointer is NULL then
+ * REDISMODULE_KEYTYPE_EMPTY is returned. */
+int RM_KeyType(RedisModuleKey *key) {
+    if (key == NULL || key->value ==  NULL) return REDISMODULE_KEYTYPE_EMPTY;
+    /* We map between defines so that we are free to change the internal
+     * defines as desired. */
+    switch(key->value->type) {
+    case OBJ_STRING: return REDISMODULE_KEYTYPE_STRING;
+    case OBJ_LIST: return REDISMODULE_KEYTYPE_LIST;
+    case OBJ_SET: return REDISMODULE_KEYTYPE_SET;
+    case OBJ_ZSET: return REDISMODULE_KEYTYPE_ZSET;
+    case OBJ_HASH: return REDISMODULE_KEYTYPE_HASH;
+    case OBJ_MODULE: return REDISMODULE_KEYTYPE_MODULE;
+    case OBJ_STREAM: return REDISMODULE_KEYTYPE_STREAM;
+    default: return REDISMODULE_KEYTYPE_EMPTY;
+    }
+}
+
+/* Return the length of the value associated with the key.
+ * For strings this is the length of the string. For all the other types
+ * is the number of elements (just counting keys for hashes).
+ *
+ * If the key pointer is NULL or the key is empty, zero is returned. */
+size_t RM_ValueLength(RedisModuleKey *key) {
+    if (key == NULL || key->value == NULL) return 0;
+    switch(key->value->type) {
+    case OBJ_STRING: return stringObjectLen(key->value);
+    case OBJ_LIST: return listTypeLength(key->value);
+    case OBJ_SET: return setTypeSize(key->value);
+    case OBJ_ZSET: return zsetLength(key->value);
+    case OBJ_HASH: return hashTypeLength(key->value);
+    case OBJ_STREAM: return streamLength(key->value);
+    default: return 0;
+    }
+}
+
+/* If the key is open for writing, remove it, and setup the key to
+ * accept new writes as an empty key (that will be created on demand).
+ * On success REDISMODULE_OK is returned. If the key is not open for
+ * writing REDISMODULE_ERR is returned. */
+int RM_DeleteKey(RedisModuleKey *key) {
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value) {
+        dbDelete(key->db,key->key);
+        key->value = NULL;
+    }
+    return REDISMODULE_OK;
+}
+
+/* If the key is open for writing, unlink it (that is delete it in a
+ * non-blocking way, not reclaiming memory immediately) and setup the key to
+ * accept new writes as an empty key (that will be created on demand).
+ * On success REDISMODULE_OK is returned. If the key is not open for
+ * writing REDISMODULE_ERR is returned. */
+int RM_UnlinkKey(RedisModuleKey *key) {
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value) {
+        dbAsyncDelete(key->db,key->key);
+        key->value = NULL;
+    }
+    return REDISMODULE_OK;
+}
+
+/* Return the key expire value, as milliseconds of remaining TTL.
+ * If no TTL is associated with the key or if the key is empty,
+ * REDISMODULE_NO_EXPIRE is returned. */
+mstime_t RM_GetExpire(RedisModuleKey *key) {
+    mstime_t expire = getExpire(key->db,key->key);
+    if (expire == -1 || key->value == NULL) 
+        return REDISMODULE_NO_EXPIRE;
+    expire -= mstime();
+    return expire >= 0 ? expire : 0;
+}
+
+/* Set a new expire for the key. If the special expire
+ * REDISMODULE_NO_EXPIRE is set, the expire is cancelled if there was
+ * one (the same as the PERSIST command).
+ *
+ * Note that the expire must be provided as a positive integer representing
+ * the number of milliseconds of TTL the key should have.
+ *
+ * The function returns REDISMODULE_OK on success or REDISMODULE_ERR if
+ * the key was not open for writing or is an empty key. */
+int RM_SetExpire(RedisModuleKey *key, mstime_t expire) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL || (expire < 0 && expire != REDISMODULE_NO_EXPIRE))
+        return REDISMODULE_ERR;
+    if (expire != REDISMODULE_NO_EXPIRE) {
+        expire += mstime();
+        setExpire(key->ctx->client,key->db,key->key,expire);
+    } else {
+        removeExpire(key->db,key->key);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Return the key expire value, as absolute Unix timestamp.
+ * If no TTL is associated with the key or if the key is empty,
+ * REDISMODULE_NO_EXPIRE is returned. */
+mstime_t RM_GetAbsExpire(RedisModuleKey *key) {
+    mstime_t expire = getExpire(key->db,key->key);
+    if (expire == -1 || key->value == NULL) 
+        return REDISMODULE_NO_EXPIRE;
+    return expire;
+}
+
+/* Set a new expire for the key. If the special expire
+ * REDISMODULE_NO_EXPIRE is set, the expire is cancelled if there was
+ * one (the same as the PERSIST command).
+ * 
+ * Note that the expire must be provided as a positive integer representing
+ * the absolute Unix timestamp the key should have.
+ *
+ * The function returns REDISMODULE_OK on success or REDISMODULE_ERR if
+ * the key was not open for writing or is an empty key. */
+int RM_SetAbsExpire(RedisModuleKey *key, mstime_t expire) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL || (expire < 0 && expire != REDISMODULE_NO_EXPIRE))
+        return REDISMODULE_ERR;
+    if (expire != REDISMODULE_NO_EXPIRE) {
+        setExpire(key->ctx->client,key->db,key->key,expire);
+    } else {
+        removeExpire(key->db,key->key);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Performs similar operation to FLUSHALL, and optionally start a new AOF file (if enabled)
+ * If restart_aof is true, you must make sure the command that triggered this call is not
+ * propagated to the AOF file.
+ * When async is set to true, db contents will be freed by a background thread. */
+void RM_ResetDataset(int restart_aof, int async) {
+    if (restart_aof && server.aof_state != AOF_OFF) stopAppendOnly();
+    flushAllDataAndResetRDB(async? EMPTYDB_ASYNC: EMPTYDB_NO_FLAGS);
+    if (server.aof_enabled && restart_aof) restartAOFAfterSYNC();
+}
+
+/* Returns the number of keys in the current db. */
+unsigned long long RM_DbSize(RedisModuleCtx *ctx) {
+    return dictSize(ctx->client->db->dict);
+}
+
+/* Returns a name of a random key, or NULL if current db is empty. */
+RedisModuleString *RM_RandomKey(RedisModuleCtx *ctx) {
+    robj *key = dbRandomKey(ctx->client->db);
+    autoMemoryAdd(ctx,REDISMODULE_AM_STRING,key);
+    return key;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for String type
+ *
+ * See also RM_ValueLength(), which returns the length of a string.
+ * -------------------------------------------------------------------------- */
+
+/* If the key is open for writing, set the specified string 'str' as the
+ * value of the key, deleting the old value if any.
+ * On success REDISMODULE_OK is returned. If the key is not open for
+ * writing or there is an active iterator, REDISMODULE_ERR is returned. */
+int RM_StringSet(RedisModuleKey *key, RedisModuleString *str) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->iter) return REDISMODULE_ERR;
+    RM_DeleteKey(key);
+    genericSetKey(key->ctx->client,key->db,key->key,str,0,0);
+    key->value = str;
+    return REDISMODULE_OK;
+}
+
+/* Prepare the key associated string value for DMA access, and returns
+ * a pointer and size (by reference), that the user can use to read or
+ * modify the string in-place accessing it directly via pointer.
+ *
+ * The 'mode' is composed by bitwise OR-ing the following flags:
+ *
+ *     REDISMODULE_READ -- Read access
+ *     REDISMODULE_WRITE -- Write access
+ *
+ * If the DMA is not requested for writing, the pointer returned should
+ * only be accessed in a read-only fashion.
+ *
+ * On error (wrong type) NULL is returned.
+ *
+ * DMA access rules:
+ *
+ * 1. No other key writing function should be called since the moment
+ * the pointer is obtained, for all the time we want to use DMA access
+ * to read or modify the string.
+ *
+ * 2. Each time RM_StringTruncate() is called, to continue with the DMA
+ * access, RM_StringDMA() should be called again to re-obtain
+ * a new pointer and length.
+ *
+ * 3. If the returned pointer is not NULL, but the length is zero, no
+ * byte can be touched (the string is empty, or the key itself is empty)
+ * so a RM_StringTruncate() call should be used if there is to enlarge
+ * the string, and later call StringDMA() again to get the pointer.
+ */
+char *RM_StringDMA(RedisModuleKey *key, size_t *len, int mode) {
+    /* We need to return *some* pointer for empty keys, we just return
+     * a string literal pointer, that is the advantage to be mapped into
+     * a read only memory page, so the module will segfault if a write
+     * attempt is performed. */
+    char *emptystring = "<dma-empty-string>";
+    if (key->value == NULL) {
+        *len = 0;
+        return emptystring;
+    }
+
+    if (key->value->type != OBJ_STRING) return NULL;
+
+    /* For write access, and even for read access if the object is encoded,
+     * we unshare the string (that has the side effect of decoding it). */
+    if ((mode & REDISMODULE_WRITE) || key->value->encoding != OBJ_ENCODING_RAW)
+        key->value = dbUnshareStringValue(key->db, key->key, key->value);
+
+    *len = sdslen(key->value->ptr);
+    return key->value->ptr;
+}
+
+/* If the string is open for writing and is of string type, resize it, padding
+ * with zero bytes if the new length is greater than the old one.
+ *
+ * After this call, RM_StringDMA() must be called again to continue
+ * DMA access with the new pointer.
+ *
+ * The function returns REDISMODULE_OK on success, and REDISMODULE_ERR on
+ * error, that is, the key is not open for writing, is not a string
+ * or resizing for more than 512 MB is requested.
+ *
+ * If the key is empty, a string key is created with the new string value
+ * unless the new length value requested is zero. */
+int RM_StringTruncate(RedisModuleKey *key, size_t newlen) {
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value && key->value->type != OBJ_STRING) return REDISMODULE_ERR;
+    if (newlen > 512*1024*1024) return REDISMODULE_ERR;
+
+    /* Empty key and new len set to 0. Just return REDISMODULE_OK without
+     * doing anything. */
+    if (key->value == NULL && newlen == 0) return REDISMODULE_OK;
+
+    if (key->value == NULL) {
+        /* Empty key: create it with the new size. */
+        robj *o = createObject(OBJ_STRING,sdsnewlen(NULL, newlen));
+        genericSetKey(key->ctx->client,key->db,key->key,o,0,0);
+        key->value = o;
+        decrRefCount(o);
+    } else {
+        /* Unshare and resize. */
+        key->value = dbUnshareStringValue(key->db, key->key, key->value);
+        size_t curlen = sdslen(key->value->ptr);
+        if (newlen > curlen) {
+            key->value->ptr = sdsgrowzero(key->value->ptr,newlen);
+        } else if (newlen < curlen) {
+            sdssubstr(key->value->ptr,0,newlen);
+            /* If the string is too wasteful, reallocate it. */
+            if (sdslen(key->value->ptr) < sdsavail(key->value->ptr))
+                key->value->ptr = sdsRemoveFreeSpace(key->value->ptr);
+        }
+    }
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for List type
+ *
+ * See also RM_ValueLength(), which returns the length of a list.
+ * -------------------------------------------------------------------------- */
+
+/* Push an element into a list, on head or tail depending on 'where' argument.
+ * If the key pointer is about an empty key opened for writing, the key
+ * is created. On error (key opened for read-only operations or of the wrong
+ * type) REDISMODULE_ERR is returned, otherwise REDISMODULE_OK is returned. */
+int RM_ListPush(RedisModuleKey *key, int where, RedisModuleString *ele) {
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value && key->value->type != OBJ_LIST) return REDISMODULE_ERR;
+    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_LIST);
+    listTypePush(key->value, ele,
+        (where == REDISMODULE_LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL);
+    return REDISMODULE_OK;
+}
+
+/* Pop an element from the list, and returns it as a module string object
+ * that the user should be free with RM_FreeString() or by enabling
+ * automatic memory. 'where' specifies if the element should be popped from
+ * head or tail. The command returns NULL if:
+ *
+ * 1. The list is empty.
+ * 2. The key was not open for writing.
+ * 3. The key is not a list. */
+RedisModuleString *RM_ListPop(RedisModuleKey *key, int where) {
+    if (!(key->mode & REDISMODULE_WRITE) ||
+        key->value == NULL ||
+        key->value->type != OBJ_LIST) return NULL;
+    robj *ele = listTypePop(key->value,
+        (where == REDISMODULE_LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL);
+    robj *decoded = getDecodedObject(ele);
+    decrRefCount(ele);
+    moduleDelKeyIfEmpty(key);
+    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,decoded);
+    return decoded;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for Sorted Set type
+ *
+ * See also RM_ValueLength(), which returns the length of a sorted set.
+ * -------------------------------------------------------------------------- */
+
+/* Conversion from/to public flags of the Modules API and our private flags,
+ * so that we have everything decoupled. */
+int moduleZsetAddFlagsToCoreFlags(int flags) {
+    int retflags = 0;
+    if (flags & REDISMODULE_ZADD_XX) retflags |= ZADD_IN_XX;
+    if (flags & REDISMODULE_ZADD_NX) retflags |= ZADD_IN_NX;
+    if (flags & REDISMODULE_ZADD_GT) retflags |= ZADD_IN_GT;
+    if (flags & REDISMODULE_ZADD_LT) retflags |= ZADD_IN_LT;
+    return retflags;
+}
+
+/* See previous function comment. */
+int moduleZsetAddFlagsFromCoreFlags(int flags) {
+    int retflags = 0;
+    if (flags & ZADD_OUT_ADDED) retflags |= REDISMODULE_ZADD_ADDED;
+    if (flags & ZADD_OUT_UPDATED) retflags |= REDISMODULE_ZADD_UPDATED;
+    if (flags & ZADD_OUT_NOP) retflags |= REDISMODULE_ZADD_NOP;
+    return retflags;
+}
+
+/* Add a new element into a sorted set, with the specified 'score'.
+ * If the element already exists, the score is updated.
+ *
+ * A new sorted set is created at value if the key is an empty open key
+ * setup for writing.
+ *
+ * Additional flags can be passed to the function via a pointer, the flags
+ * are both used to receive input and to communicate state when the function
+ * returns. 'flagsptr' can be NULL if no special flags are used.
+ *
+ * The input flags are:
+ *
+ *     REDISMODULE_ZADD_XX: Element must already exist. Do nothing otherwise.
+ *     REDISMODULE_ZADD_NX: Element must not exist. Do nothing otherwise.
+ *     REDISMODULE_ZADD_GT: If element exists, new score must be greater than the current score. 
+ *                          Do nothing otherwise. Can optionally be combined with XX.
+ *     REDISMODULE_ZADD_LT: If element exists, new score must be less than the current score.
+ *                          Do nothing otherwise. Can optionally be combined with XX.
+ *
+ * The output flags are:
+ *
+ *     REDISMODULE_ZADD_ADDED: The new element was added to the sorted set.
+ *     REDISMODULE_ZADD_UPDATED: The score of the element was updated.
+ *     REDISMODULE_ZADD_NOP: No operation was performed because XX or NX flags.
+ *
+ * On success the function returns REDISMODULE_OK. On the following errors
+ * REDISMODULE_ERR is returned:
+ *
+ * * The key was not opened for writing.
+ * * The key is of the wrong type.
+ * * 'score' double value is not a number (NaN).
+ */
+int RM_ZsetAdd(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr) {
+    int in_flags = 0, out_flags = 0;
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_ZSET);
+    if (flagsptr) in_flags = moduleZsetAddFlagsToCoreFlags(*flagsptr);
+    if (zsetAdd(key->value,score,ele->ptr,in_flags,&out_flags,NULL) == 0) {
+        if (flagsptr) *flagsptr = 0;
+        return REDISMODULE_ERR;
+    }
+    if (flagsptr) *flagsptr = moduleZsetAddFlagsFromCoreFlags(out_flags);
+    return REDISMODULE_OK;
+}
+
+/* This function works exactly like RM_ZsetAdd(), but instead of setting
+ * a new score, the score of the existing element is incremented, or if the
+ * element does not already exist, it is added assuming the old score was
+ * zero.
+ *
+ * The input and output flags, and the return value, have the same exact
+ * meaning, with the only difference that this function will return
+ * REDISMODULE_ERR even when 'score' is a valid double number, but adding it
+ * to the existing score results into a NaN (not a number) condition.
+ *
+ * This function has an additional field 'newscore', if not NULL is filled
+ * with the new score of the element after the increment, if no error
+ * is returned. */
+int RM_ZsetIncrby(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr, double *newscore) {
+    int in_flags = 0, out_flags = 0;
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_ZSET);
+    if (flagsptr) in_flags = moduleZsetAddFlagsToCoreFlags(*flagsptr);
+    in_flags |= ZADD_IN_INCR;
+    if (zsetAdd(key->value,score,ele->ptr,in_flags,&out_flags,newscore) == 0) {
+        if (flagsptr) *flagsptr = 0;
+        return REDISMODULE_ERR;
+    }
+    if (flagsptr) *flagsptr = moduleZsetAddFlagsFromCoreFlags(out_flags);
+    return REDISMODULE_OK;
+}
+
+/* Remove the specified element from the sorted set.
+ * The function returns REDISMODULE_OK on success, and REDISMODULE_ERR
+ * on one of the following conditions:
+ *
+ * * The key was not opened for writing.
+ * * The key is of the wrong type.
+ *
+ * The return value does NOT indicate the fact the element was really
+ * removed (since it existed) or not, just if the function was executed
+ * with success.
+ *
+ * In order to know if the element was removed, the additional argument
+ * 'deleted' must be passed, that populates the integer by reference
+ * setting it to 1 or 0 depending on the outcome of the operation.
+ * The 'deleted' argument can be NULL if the caller is not interested
+ * to know if the element was really removed.
+ *
+ * Empty keys will be handled correctly by doing nothing. */
+int RM_ZsetRem(RedisModuleKey *key, RedisModuleString *ele, int *deleted) {
+    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
+    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+    if (key->value != NULL && zsetDel(key->value,ele->ptr)) {
+        if (deleted) *deleted = 1;
+        moduleDelKeyIfEmpty(key);
+    } else {
+        if (deleted) *deleted = 0;
+    }
+    return REDISMODULE_OK;
+}
+
+/* On success retrieve the double score associated at the sorted set element
+ * 'ele' and returns REDISMODULE_OK. Otherwise REDISMODULE_ERR is returned
+ * to signal one of the following conditions:
+ *
+ * * There is no such element 'ele' in the sorted set.
+ * * The key is not a sorted set.
+ * * The key is an open empty key.
+ */
+int RM_ZsetScore(RedisModuleKey *key, RedisModuleString *ele, double *score) {
+    if (key->value == NULL) return REDISMODULE_ERR;
+    if (key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+    if (zsetScore(key->value,ele->ptr,score) == C_ERR) return REDISMODULE_ERR;
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for Sorted Set iterator
+ * -------------------------------------------------------------------------- */
+
+void zsetKeyReset(RedisModuleKey *key) {
+    key->u.zset.type = REDISMODULE_ZSET_RANGE_NONE;
+    key->u.zset.current = NULL;
+    key->u.zset.er = 1;
+}
+
+/* Stop a sorted set iteration. */
+void RM_ZsetRangeStop(RedisModuleKey *key) {
+    if (!key->value || key->value->type != OBJ_ZSET) return;
+    /* Free resources if needed. */
+    if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX)
+        zslFreeLexRange(&key->u.zset.lrs);
+    /* Setup sensible values so that misused iteration API calls when an
+     * iterator is not active will result into something more sensible
+     * than crashing. */
+    zsetKeyReset(key);
+}
+
+/* Return the "End of range" flag value to signal the end of the iteration. */
+int RM_ZsetRangeEndReached(RedisModuleKey *key) {
+    if (!key->value || key->value->type != OBJ_ZSET) return 1;
+    return key->u.zset.er;
+}
+
+/* Helper function for RM_ZsetFirstInScoreRange() and RM_ZsetLastInScoreRange().
+ * Setup the sorted set iteration according to the specified score range
+ * (see the functions calling it for more info). If 'first' is true the
+ * first element in the range is used as a starting point for the iterator
+ * otherwise the last. Return REDISMODULE_OK on success otherwise
+ * REDISMODULE_ERR. */
+int zsetInitScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex, int first) {
+    if (!key->value || key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+
+    RM_ZsetRangeStop(key);
+    key->u.zset.type = REDISMODULE_ZSET_RANGE_SCORE;
+    key->u.zset.er = 0;
+
+    /* Setup the range structure used by the sorted set core implementation
+     * in order to seek at the specified element. */
+    zrangespec *zrs = &key->u.zset.rs;
+    zrs->min = min;
+    zrs->max = max;
+    zrs->minex = minex;
+    zrs->maxex = maxex;
+
+    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
+        key->u.zset.current = first ? zzlFirstInRange(key->value->ptr,zrs) :
+                                      zzlLastInRange(key->value->ptr,zrs);
+    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = key->value->ptr;
+        zskiplist *zsl = zs->zsl;
+        key->u.zset.current = first ? zslFirstInRange(zsl,zrs) :
+                                      zslLastInRange(zsl,zrs);
+    } else {
+        serverPanic("Unsupported zset encoding");
+    }
+    if (key->u.zset.current == NULL) key->u.zset.er = 1;
+    return REDISMODULE_OK;
+}
+
+/* Setup a sorted set iterator seeking the first element in the specified
+ * range. Returns REDISMODULE_OK if the iterator was correctly initialized
+ * otherwise REDISMODULE_ERR is returned in the following conditions:
+ *
+ * 1. The value stored at key is not a sorted set or the key is empty.
+ *
+ * The range is specified according to the two double values 'min' and 'max'.
+ * Both can be infinite using the following two macros:
+ *
+ * * REDISMODULE_POSITIVE_INFINITE for positive infinite value
+ * * REDISMODULE_NEGATIVE_INFINITE for negative infinite value
+ *
+ * 'minex' and 'maxex' parameters, if true, respectively setup a range
+ * where the min and max value are exclusive (not included) instead of
+ * inclusive. */
+int RM_ZsetFirstInScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex) {
+    return zsetInitScoreRange(key,min,max,minex,maxex,1);
+}
+
+/* Exactly like RedisModule_ZsetFirstInScoreRange() but the last element of
+ * the range is selected for the start of the iteration instead. */
+int RM_ZsetLastInScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex) {
+    return zsetInitScoreRange(key,min,max,minex,maxex,0);
+}
+
+/* Helper function for RM_ZsetFirstInLexRange() and RM_ZsetLastInLexRange().
+ * Setup the sorted set iteration according to the specified lexicographical
+ * range (see the functions calling it for more info). If 'first' is true the
+ * first element in the range is used as a starting point for the iterator
+ * otherwise the last. Return REDISMODULE_OK on success otherwise
+ * REDISMODULE_ERR.
+ *
+ * Note that this function takes 'min' and 'max' in the same form of the
+ * Redis ZRANGEBYLEX command. */
+int zsetInitLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max, int first) {
+    if (!key->value || key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
+
+    RM_ZsetRangeStop(key);
+    key->u.zset.er = 0;
+
+    /* Setup the range structure used by the sorted set core implementation
+     * in order to seek at the specified element. */
+    zlexrangespec *zlrs = &key->u.zset.lrs;
+    if (zslParseLexRange(min, max, zlrs) == C_ERR) return REDISMODULE_ERR;
+
+    /* Set the range type to lex only after successfully parsing the range,
+     * otherwise we don't want the zlexrangespec to be freed. */
+    key->u.zset.type = REDISMODULE_ZSET_RANGE_LEX;
+
+    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
+        key->u.zset.current = first ? zzlFirstInLexRange(key->value->ptr,zlrs) :
+                                      zzlLastInLexRange(key->value->ptr,zlrs);
+    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = key->value->ptr;
+        zskiplist *zsl = zs->zsl;
+        key->u.zset.current = first ? zslFirstInLexRange(zsl,zlrs) :
+                                      zslLastInLexRange(zsl,zlrs);
+    } else {
+        serverPanic("Unsupported zset encoding");
+    }
+    if (key->u.zset.current == NULL) key->u.zset.er = 1;
+
+    return REDISMODULE_OK;
+}
+
+/* Setup a sorted set iterator seeking the first element in the specified
+ * lexicographical range. Returns REDISMODULE_OK if the iterator was correctly
+ * initialized otherwise REDISMODULE_ERR is returned in the
+ * following conditions:
+ *
+ * 1. The value stored at key is not a sorted set or the key is empty.
+ * 2. The lexicographical range 'min' and 'max' format is invalid.
+ *
+ * 'min' and 'max' should be provided as two RedisModuleString objects
+ * in the same format as the parameters passed to the ZRANGEBYLEX command.
+ * The function does not take ownership of the objects, so they can be released
+ * ASAP after the iterator is setup. */
+int RM_ZsetFirstInLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) {
+    return zsetInitLexRange(key,min,max,1);
+}
+
+/* Exactly like RedisModule_ZsetFirstInLexRange() but the last element of
+ * the range is selected for the start of the iteration instead. */
+int RM_ZsetLastInLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) {
+    return zsetInitLexRange(key,min,max,0);
+}
+
+/* Return the current sorted set element of an active sorted set iterator
+ * or NULL if the range specified in the iterator does not include any
+ * element. */
+RedisModuleString *RM_ZsetRangeCurrentElement(RedisModuleKey *key, double *score) {
+    RedisModuleString *str;
+
+    if (!key->value || key->value->type != OBJ_ZSET) return NULL;
+    if (key->u.zset.current == NULL) return NULL;
+    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *eptr, *sptr;
+        eptr = key->u.zset.current;
+        sds ele = ziplistGetObject(eptr);
+        if (score) {
+            sptr = ziplistNext(key->value->ptr,eptr);
+            *score = zzlGetScore(sptr);
+        }
+        str = createObject(OBJ_STRING,ele);
+    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
+        zskiplistNode *ln = key->u.zset.current;
+        if (score) *score = ln->score;
+        str = createStringObject(ln->ele,sdslen(ln->ele));
+    } else {
+        serverPanic("Unsupported zset encoding");
+    }
+    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,str);
+    return str;
+}
+
+/* Go to the next element of the sorted set iterator. Returns 1 if there was
+ * a next element, 0 if we are already at the latest element or the range
+ * does not include any item at all. */
+int RM_ZsetRangeNext(RedisModuleKey *key) {
+    if (!key->value || key->value->type != OBJ_ZSET) return 0;
+    if (!key->u.zset.type || !key->u.zset.current) return 0; /* No active iterator. */
+
+    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = key->value->ptr;
+        unsigned char *eptr = key->u.zset.current;
+        unsigned char *next;
+        next = ziplistNext(zl,eptr); /* Skip element. */
+        if (next) next = ziplistNext(zl,next); /* Skip score. */
+        if (next == NULL) {
+            key->u.zset.er = 1;
+            return 0;
+        } else {
+            /* Are we still within the range? */
+            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE) {
+                /* Fetch the next element score for the
+                 * range check. */
+                unsigned char *saved_next = next;
+                next = ziplistNext(zl,next); /* Skip next element. */
+                double score = zzlGetScore(next); /* Obtain the next score. */
+                if (!zslValueLteMax(score,&key->u.zset.rs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+                next = saved_next;
+            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
+                if (!zzlLexValueLteMax(next,&key->u.zset.lrs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+            }
+            key->u.zset.current = next;
+            return 1;
+        }
+    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
+        zskiplistNode *ln = key->u.zset.current, *next = ln->level[0].forward;
+        if (next == NULL) {
+            key->u.zset.er = 1;
+            return 0;
+        } else {
+            /* Are we still within the range? */
+            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE &&
+                !zslValueLteMax(next->score,&key->u.zset.rs))
+            {
+                key->u.zset.er = 1;
+                return 0;
+            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
+                if (!zslLexValueLteMax(next->ele,&key->u.zset.lrs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+            }
+            key->u.zset.current = next;
+            return 1;
+        }
+    } else {
+        serverPanic("Unsupported zset encoding");
+    }
+}
+
+/* Go to the previous element of the sorted set iterator. Returns 1 if there was
+ * a previous element, 0 if we are already at the first element or the range
+ * does not include any item at all. */
+int RM_ZsetRangePrev(RedisModuleKey *key) {
+    if (!key->value || key->value->type != OBJ_ZSET) return 0;
+    if (!key->u.zset.type || !key->u.zset.current) return 0; /* No active iterator. */
+
+    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = key->value->ptr;
+        unsigned char *eptr = key->u.zset.current;
+        unsigned char *prev;
+        prev = ziplistPrev(zl,eptr); /* Go back to previous score. */
+        if (prev) prev = ziplistPrev(zl,prev); /* Back to previous ele. */
+        if (prev == NULL) {
+            key->u.zset.er = 1;
+            return 0;
+        } else {
+            /* Are we still within the range? */
+            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE) {
+                /* Fetch the previous element score for the
+                 * range check. */
+                unsigned char *saved_prev = prev;
+                prev = ziplistNext(zl,prev); /* Skip element to get the score.*/
+                double score = zzlGetScore(prev); /* Obtain the prev score. */
+                if (!zslValueGteMin(score,&key->u.zset.rs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+                prev = saved_prev;
+            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
+                if (!zzlLexValueGteMin(prev,&key->u.zset.lrs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+            }
+            key->u.zset.current = prev;
+            return 1;
+        }
+    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
+        zskiplistNode *ln = key->u.zset.current, *prev = ln->backward;
+        if (prev == NULL) {
+            key->u.zset.er = 1;
+            return 0;
+        } else {
+            /* Are we still within the range? */
+            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE &&
+                !zslValueGteMin(prev->score,&key->u.zset.rs))
+            {
+                key->u.zset.er = 1;
+                return 0;
+            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
+                if (!zslLexValueGteMin(prev->ele,&key->u.zset.lrs)) {
+                    key->u.zset.er = 1;
+                    return 0;
+                }
+            }
+            key->u.zset.current = prev;
+            return 1;
+        }
+    } else {
+        serverPanic("Unsupported zset encoding");
+    }
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for Hash type
+ *
+ * See also RM_ValueLength(), which returns the number of fields in a hash.
+ * -------------------------------------------------------------------------- */
+
+/* Set the field of the specified hash field to the specified value.
+ * If the key is an empty key open for writing, it is created with an empty
+ * hash value, in order to set the specified field.
+ *
+ * The function is variadic and the user must specify pairs of field
+ * names and values, both as RedisModuleString pointers (unless the
+ * CFIELD option is set, see later). At the end of the field/value-ptr pairs, 
+ * NULL must be specified as last argument to signal the end of the arguments 
+ * in the variadic function.
+ *
+ * Example to set the hash argv[1] to the value argv[2]:
+ *
+ *      RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[1],argv[2],NULL);
+ *
+ * The function can also be used in order to delete fields (if they exist)
+ * by setting them to the specified value of REDISMODULE_HASH_DELETE:
+ *
+ *      RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[1],
+ *                          REDISMODULE_HASH_DELETE,NULL);
+ *
+ * The behavior of the command changes with the specified flags, that can be
+ * set to REDISMODULE_HASH_NONE if no special behavior is needed.
+ *
+ *     REDISMODULE_HASH_NX: The operation is performed only if the field was not
+ *                          already existing in the hash.
+ *     REDISMODULE_HASH_XX: The operation is performed only if the field was
+ *                          already existing, so that a new value could be
+ *                          associated to an existing filed, but no new fields
+ *                          are created.
+ *     REDISMODULE_HASH_CFIELDS: The field names passed are null terminated C
+ *                               strings instead of RedisModuleString objects.
+ *     REDISMODULE_HASH_COUNT_ALL: Include the number of inserted fields in the
+ *                                 returned number, in addition to the number of
+ *                                 updated and deleted fields. (Added in Redis
+ *                                 6.2.)
+ *
+ * Unless NX is specified, the command overwrites the old field value with
+ * the new one.
+ *
+ * When using REDISMODULE_HASH_CFIELDS, field names are reported using
+ * normal C strings, so for example to delete the field "foo" the following
+ * code can be used:
+ *
+ *      RedisModule_HashSet(key,REDISMODULE_HASH_CFIELDS,"foo",
+ *                          REDISMODULE_HASH_DELETE,NULL);
+ *
+ * Return value:
+ *
+ * The number of fields existing in the hash prior to the call, which have been
+ * updated (its old value has been replaced by a new value) or deleted. If the
+ * flag REDISMODULE_HASH_COUNT_ALL is set, insterted fields not previously
+ * existing in the hash are also counted.
+ *
+ * If the return value is zero, `errno` is set (since Redis 6.2) as follows:
+ *
+ * - EINVAL if any unknown flags are set or if key is NULL.
+ * - ENOTSUP if the key is associated with a non Hash value.
+ * - EBADF if the key was not opened for writing.
+ * - ENOENT if no fields were counted as described under Return value above.
+ *   This is not actually an error. The return value can be zero if all fields
+ *   were just created and the COUNT_ALL flag was unset, or if changes were held
+ *   back due to the NX and XX flags.
+ *
+ * NOTICE: The return value semantics of this function are very different
+ * between Redis 6.2 and older versions. Modules that use it should determine
+ * the Redis version and handle it accordingly.
+ */
+int RM_HashSet(RedisModuleKey *key, int flags, ...) {
+    va_list ap;
+    if (!key || (flags & ~(REDISMODULE_HASH_NX |
+                           REDISMODULE_HASH_XX |
+                           REDISMODULE_HASH_CFIELDS |
+                           REDISMODULE_HASH_COUNT_ALL))) {
+        errno = EINVAL;
+        return 0;
+    } else if (key->value && key->value->type != OBJ_HASH) {
+        errno = ENOTSUP;
+        return 0;
+    } else if (!(key->mode & REDISMODULE_WRITE)) {
+        errno = EBADF;
+        return 0;
+    }
+    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_HASH);
+
+    int count = 0;
+    va_start(ap, flags);
+    while(1) {
+        RedisModuleString *field, *value;
+        /* Get the field and value objects. */
+        if (flags & REDISMODULE_HASH_CFIELDS) {
+            char *cfield = va_arg(ap,char*);
+            if (cfield == NULL) break;
+            field = createRawStringObject(cfield,strlen(cfield));
+        } else {
+            field = va_arg(ap,RedisModuleString*);
+            if (field == NULL) break;
+        }
+        value = va_arg(ap,RedisModuleString*);
+
+        /* Handle XX and NX */
+        if (flags & (REDISMODULE_HASH_XX|REDISMODULE_HASH_NX)) {
+            int exists = hashTypeExists(key->value, field->ptr);
+            if (((flags & REDISMODULE_HASH_XX) && !exists) ||
+                ((flags & REDISMODULE_HASH_NX) && exists))
+            {
+                if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
+                continue;
+            }
+        }
+
+        /* Handle deletion if value is REDISMODULE_HASH_DELETE. */
+        if (value == REDISMODULE_HASH_DELETE) {
+            count += hashTypeDelete(key->value, field->ptr);
+            if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
+            continue;
+        }
+
+        int low_flags = HASH_SET_COPY;
+        /* If CFIELDS is active, we can pass the ownership of the
+         * SDS object to the low level function that sets the field
+         * to avoid a useless copy. */
+        if (flags & REDISMODULE_HASH_CFIELDS)
+            low_flags |= HASH_SET_TAKE_FIELD;
+
+        robj *argv[2] = {field,value};
+        hashTypeTryConversion(key->value,argv,0,1);
+        int updated = hashTypeSet(key->value, field->ptr, value->ptr, low_flags);
+        count += (flags & REDISMODULE_HASH_COUNT_ALL) ? 1 : updated;
+
+        /* If CFIELDS is active, SDS string ownership is now of hashTypeSet(),
+         * however we still have to release the 'field' object shell. */
+        if (flags & REDISMODULE_HASH_CFIELDS) {
+           field->ptr = NULL; /* Prevent the SDS string from being freed. */
+           decrRefCount(field);
+        }
+    }
+    va_end(ap);
+    moduleDelKeyIfEmpty(key);
+    if (count == 0) errno = ENOENT;
+    return count;
+}
+
+/* Get fields from an hash value. This function is called using a variable
+ * number of arguments, alternating a field name (as a RedisModuleString
+ * pointer) with a pointer to a RedisModuleString pointer, that is set to the
+ * value of the field if the field exists, or NULL if the field does not exist.
+ * At the end of the field/value-ptr pairs, NULL must be specified as last
+ * argument to signal the end of the arguments in the variadic function.
+ *
+ * This is an example usage:
+ *
+ *      RedisModuleString *first, *second;
+ *      RedisModule_HashGet(mykey,REDISMODULE_HASH_NONE,argv[1],&first,
+ *                          argv[2],&second,NULL);
+ *
+ * As with RedisModule_HashSet() the behavior of the command can be specified
+ * passing flags different than REDISMODULE_HASH_NONE:
+ *
+ * REDISMODULE_HASH_CFIELDS: field names as null terminated C strings.
+ *
+ * REDISMODULE_HASH_EXISTS: instead of setting the value of the field
+ * expecting a RedisModuleString pointer to pointer, the function just
+ * reports if the field exists or not and expects an integer pointer
+ * as the second element of each pair.
+ *
+ * Example of REDISMODULE_HASH_CFIELDS:
+ *
+ *      RedisModuleString *username, *hashedpass;
+ *      RedisModule_HashGet(mykey,REDISMODULE_HASH_CFIELDS,"username",&username,"hp",&hashedpass, NULL);
+ *
+ * Example of REDISMODULE_HASH_EXISTS:
+ *
+ *      int exists;
+ *      RedisModule_HashGet(mykey,REDISMODULE_HASH_EXISTS,argv[1],&exists,NULL);
+ *
+ * The function returns REDISMODULE_OK on success and REDISMODULE_ERR if
+ * the key is not an hash value.
+ *
+ * Memory management:
+ *
+ * The returned RedisModuleString objects should be released with
+ * RedisModule_FreeString(), or by enabling automatic memory management.
+ */
+int RM_HashGet(RedisModuleKey *key, int flags, ...) {
+    va_list ap;
+    if (key->value && key->value->type != OBJ_HASH) return REDISMODULE_ERR;
+
+    va_start(ap, flags);
+    while(1) {
+        RedisModuleString *field, **valueptr;
+        int *existsptr;
+        /* Get the field object and the value pointer to pointer. */
+        if (flags & REDISMODULE_HASH_CFIELDS) {
+            char *cfield = va_arg(ap,char*);
+            if (cfield == NULL) break;
+            field = createRawStringObject(cfield,strlen(cfield));
+        } else {
+            field = va_arg(ap,RedisModuleString*);
+            if (field == NULL) break;
+        }
+
+        /* Query the hash for existence or value object. */
+        if (flags & REDISMODULE_HASH_EXISTS) {
+            existsptr = va_arg(ap,int*);
+            if (key->value)
+                *existsptr = hashTypeExists(key->value,field->ptr);
+            else
+                *existsptr = 0;
+        } else {
+            valueptr = va_arg(ap,RedisModuleString**);
+            if (key->value) {
+                *valueptr = hashTypeGetValueObject(key->value,field->ptr);
+                if (*valueptr) {
+                    robj *decoded = getDecodedObject(*valueptr);
+                    decrRefCount(*valueptr);
+                    *valueptr = decoded;
+                }
+                if (*valueptr)
+                    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,*valueptr);
+            } else {
+                *valueptr = NULL;
+            }
+        }
+
+        /* Cleanup */
+        if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
+    }
+    va_end(ap);
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key API for Stream type
+ *
+ * For an introduction to streams, see https://redis.io/topics/streams-intro.
+ *
+ * The type RedisModuleStreamID, which is used in stream functions, is a struct
+ * with two 64-bit fields and is defined as
+ *
+ *     typedef struct RedisModuleStreamID {
+ *         uint64_t ms;
+ *         uint64_t seq;
+ *     } RedisModuleStreamID;
+ *
+ * See also RM_ValueLength(), which returns the length of a stream, and the
+ * conversion functions RM_StringToStreamID() and RM_CreateStringFromStreamID().
+ * -------------------------------------------------------------------------- */
+
+/* Adds an entry to a stream. Like XADD without trimming.
+ *
+ * - `key`: The key where the stream is (or will be) stored
+ * - `flags`: A bit field of
+ *   - `REDISMODULE_STREAM_ADD_AUTOID`: Assign a stream ID automatically, like
+ *     `*` in the XADD command.
+ * - `id`: If the `AUTOID` flag is set, this is where the assigned ID is
+ *   returned. Can be NULL if `AUTOID` is set, if you don't care to receive the
+ *   ID. If `AUTOID` is not set, this is the requested ID.
+ * - `argv`: A pointer to an array of size `numfields * 2` containing the
+ *   fields and values.
+ * - `numfields`: The number of field-value pairs in `argv`.
+ *
+ * Returns REDISMODULE_OK if an entry has been added. On failure,
+ * REDISMODULE_ERR is returned and `errno` is set as follows:
+ *
+ * - EINVAL if called with invalid arguments
+ * - ENOTSUP if the key refers to a value of a type other than stream
+ * - EBADF if the key was not opened for writing
+ * - EDOM if the given ID was 0-0 or not greater than all other IDs in the
+ *   stream (only if the AUTOID flag is unset)
+ * - EFBIG if the stream has reached the last possible ID
+ * - ERANGE if the elements are too large to be stored.
+ */
+int RM_StreamAdd(RedisModuleKey *key, int flags, RedisModuleStreamID *id, RedisModuleString **argv, long numfields) {
+    /* Validate args */
+    if (!key || (numfields != 0 && !argv) || /* invalid key or argv */
+        (flags & ~(REDISMODULE_STREAM_ADD_AUTOID)) || /* invalid flags */
+        (!(flags & REDISMODULE_STREAM_ADD_AUTOID) && !id)) { /* id required */
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (key->value && key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP; /* wrong type */
+        return REDISMODULE_ERR;
+    } else if (!(key->mode & REDISMODULE_WRITE)) {
+        errno = EBADF; /* key not open for writing */
+        return REDISMODULE_ERR;
+    } else if (!(flags & REDISMODULE_STREAM_ADD_AUTOID) &&
+               id->ms == 0 && id->seq == 0) {
+        errno = EDOM; /* ID out of range */
+        return REDISMODULE_ERR;
+    }
+
+    /* Create key if necessery */
+    int created = 0;
+    if (key->value == NULL) {
+        moduleCreateEmptyKey(key, REDISMODULE_KEYTYPE_STREAM);
+        created = 1;
+    }
+
+    stream *s = key->value->ptr;
+    if (s->last_id.ms == UINT64_MAX && s->last_id.seq == UINT64_MAX) {
+        /* The stream has reached the last possible ID */
+        errno = EFBIG;
+        return REDISMODULE_ERR;
+    }
+
+    streamID added_id;
+    streamID use_id;
+    streamID *use_id_ptr = NULL;
+    if (!(flags & REDISMODULE_STREAM_ADD_AUTOID)) {
+        use_id.ms = id->ms;
+        use_id.seq = id->seq;
+        use_id_ptr = &use_id;
+    }
+    if (streamAppendItem(s, argv, numfields, &added_id, use_id_ptr) == C_ERR) {
+        /* Either the ID not greater than all existing IDs in the stream, or
+         * the elements are too large to be stored. either way, errno is already
+         * set by streamAppendItem. */
+        return REDISMODULE_ERR;
+    }
+    /* Postponed signalKeyAsReady(). Done implicitly by moduleCreateEmptyKey()
+     * so not needed if the stream has just been created. */
+    if (!created) key->u.stream.signalready = 1;
+
+    if (id != NULL) {
+        id->ms = added_id.ms;
+        id->seq = added_id.seq;
+    }
+
+    return REDISMODULE_OK;
+}
+
+/* Deletes an entry from a stream.
+ *
+ * - `key`: A key opened for writing, with no stream iterator started.
+ * - `id`: The stream ID of the entry to delete.
+ *
+ * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
+ * and `errno` is set as follows:
+ *
+ * - EINVAL if called with invalid arguments
+ * - ENOTSUP if the key refers to a value of a type other than stream or if the
+ *   key is empty
+ * - EBADF if the key was not opened for writing or if a stream iterator is
+ *   associated with the key
+ * - ENOENT if no entry with the given stream ID exists
+ *
+ * See also RM_StreamIteratorDelete() for deleting the current entry while
+ * iterating using a stream iterator.
+ */
+int RM_StreamDelete(RedisModuleKey *key, RedisModuleStreamID *id) {
+    if (!key || !id) {
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP; /* wrong type */
+        return REDISMODULE_ERR;
+    } else if (!(key->mode & REDISMODULE_WRITE) ||
+               key->iter != NULL) {
+        errno = EBADF; /* key not opened for writing or iterator started */
+        return REDISMODULE_ERR;
+    }
+    stream *s = key->value->ptr;
+    streamID streamid = {id->ms, id->seq};
+    if (streamDeleteItem(s, &streamid)) {
+        return REDISMODULE_OK;
+    } else {
+        errno = ENOENT; /* no entry with this id */
+        return REDISMODULE_ERR;
+    }
+}
+
+/* Sets up a stream iterator.
+ *
+ * - `key`: The stream key opened for reading using RedisModule_OpenKey().
+ * - `flags`:
+ *   - `REDISMODULE_STREAM_ITERATOR_EXCLUSIVE`: Don't include `start` and `end`
+ *     in the iterated range.
+ *   - `REDISMODULE_STREAM_ITERATOR_REVERSE`: Iterate in reverse order, starting
+ *     from the `end` of the range.
+ * - `start`: The lower bound of the range. Use NULL for the beginning of the
+ *   stream.
+ * - `end`: The upper bound of the range. Use NULL for the end of the stream.
+ *
+ * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
+ * and `errno` is set as follows:
+ *
+ * - EINVAL if called with invalid arguments
+ * - ENOTSUP if the key refers to a value of a type other than stream or if the
+ *   key is empty
+ * - EBADF if the key was not opened for writing or if a stream iterator is
+ *   already associated with the key
+ * - EDOM if `start` or `end` is outside the valid range
+ *
+ * Returns REDISMODULE_OK on success and REDISMODULE_ERR if the key doesn't
+ * refer to a stream or if invalid arguments were given.
+ *
+ * The stream IDs are retrieved using RedisModule_StreamIteratorNextID() and
+ * for each stream ID, the fields and values are retrieved using
+ * RedisModule_StreamIteratorNextField(). The iterator is freed by calling
+ * RedisModule_StreamIteratorStop().
+ *
+ * Example (error handling omitted):
+ *
+ *     RedisModule_StreamIteratorStart(key, 0, startid_ptr, endid_ptr);
+ *     RedisModuleStreamID id;
+ *     long numfields;
+ *     while (RedisModule_StreamIteratorNextID(key, &id, &numfields) ==
+ *            REDISMODULE_OK) {
+ *         RedisModuleString *field, *value;
+ *         while (RedisModule_StreamIteratorNextField(key, &field, &value) ==
+ *                REDISMODULE_OK) {
+ *             //
+ *             // ... Do stuff ...
+ *             //
+ *             RedisModule_FreeString(ctx, field);
+ *             RedisModule_FreeString(ctx, value);
+ *         }
+ *     }
+ *     RedisModule_StreamIteratorStop(key);
+ */
+int RM_StreamIteratorStart(RedisModuleKey *key, int flags, RedisModuleStreamID *start, RedisModuleStreamID *end) {
+    /* check args */
+    if (!key ||
+        (flags & ~(REDISMODULE_STREAM_ITERATOR_EXCLUSIVE |
+                   REDISMODULE_STREAM_ITERATOR_REVERSE))) {
+        errno = EINVAL; /* key missing or invalid flags */
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return REDISMODULE_ERR; /* not a stream */
+    } else if (key->iter) {
+        errno = EBADF; /* iterator already started */
+        return REDISMODULE_ERR;
+    }
+
+    /* define range for streamIteratorStart() */
+    streamID lower, upper;
+    if (start) lower = (streamID){start->ms, start->seq};
+    if (end)   upper = (streamID){end->ms,   end->seq};
+    if (flags & REDISMODULE_STREAM_ITERATOR_EXCLUSIVE) {
+        if ((start && streamIncrID(&lower) != C_OK) ||
+            (end   && streamDecrID(&upper) != C_OK)) {
+            errno = EDOM; /* end is 0-0 or start is MAX-MAX? */
+            return REDISMODULE_ERR;
+        }
+    }
+
+    /* create iterator */
+    stream *s = key->value->ptr;
+    int rev = flags & REDISMODULE_STREAM_ITERATOR_REVERSE;
+    streamIterator *si = zmalloc(sizeof(*si));
+    streamIteratorStart(si, s, start ? &lower : NULL, end ? &upper : NULL, rev);
+    key->iter = si;
+    key->u.stream.currentid.ms = 0; /* for RM_StreamIteratorDelete() */
+    key->u.stream.currentid.seq = 0;
+    key->u.stream.numfieldsleft = 0; /* for RM_StreamIteratorNextField() */
+    return REDISMODULE_OK;
+}
+
+/* Stops a stream iterator created using RedisModule_StreamIteratorStart() and
+ * reclaims its memory.
+ *
+ * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
+ * and `errno` is set as follows:
+ *
+ * - EINVAL if called with a NULL key
+ * - ENOTSUP if the key refers to a value of a type other than stream or if the
+ *   key is empty
+ * - EBADF if the key was not opened for writing or if no stream iterator is
+ *   associated with the key
+ */
+int RM_StreamIteratorStop(RedisModuleKey *key) {
+    if (!key) {
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return REDISMODULE_ERR;
+    } else if (!key->iter) {
+        errno = EBADF;
+        return REDISMODULE_ERR;
+    }
+    zfree(key->iter);
+    key->iter = NULL;
+    return REDISMODULE_OK;
+}
+
+/* Finds the next stream entry and returns its stream ID and the number of
+ * fields.
+ *
+ * - `key`: Key for which a stream iterator has been started using
+ *   RedisModule_StreamIteratorStart().
+ * - `id`: The stream ID returned. NULL if you don't care.
+ * - `numfields`: The number of fields in the found stream entry. NULL if you
+ *   don't care.
+ *
+ * Returns REDISMODULE_OK and sets `*id` and `*numfields` if an entry was found.
+ * On failure, REDISMODULE_ERR is returned and `errno` is set as follows:
+ *
+ * - EINVAL if called with a NULL key
+ * - ENOTSUP if the key refers to a value of a type other than stream or if the
+ *   key is empty
+ * - EBADF if no stream iterator is associated with the key
+ * - ENOENT if there are no more entries in the range of the iterator
+ *
+ * In practice, if RM_StreamIteratorNextID() is called after a successful call
+ * to RM_StreamIteratorStart() and with the same key, it is safe to assume that
+ * an REDISMODULE_ERR return value means that there are no more entries.
+ *
+ * Use RedisModule_StreamIteratorNextField() to retrieve the fields and values.
+ * See the example at RedisModule_StreamIteratorStart().
+ */
+int RM_StreamIteratorNextID(RedisModuleKey *key, RedisModuleStreamID *id, long *numfields) {
+    if (!key) {
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return REDISMODULE_ERR;
+    } else if (!key->iter) {
+        errno = EBADF;
+        return REDISMODULE_ERR;
+    }
+    streamIterator *si = key->iter;
+    int64_t *num_ptr = &key->u.stream.numfieldsleft;
+    streamID *streamid_ptr = &key->u.stream.currentid;
+    if (streamIteratorGetID(si, streamid_ptr, num_ptr)) {
+        if (id) {
+            id->ms = streamid_ptr->ms;
+            id->seq = streamid_ptr->seq;
+        }
+        if (numfields) *numfields = *num_ptr;
+        return REDISMODULE_OK;
+    } else {
+        /* No entry found. */
+        key->u.stream.currentid.ms = 0; /* for RM_StreamIteratorDelete() */
+        key->u.stream.currentid.seq = 0;
+        key->u.stream.numfieldsleft = 0; /* for RM_StreamIteratorNextField() */
+        errno = ENOENT;
+        return REDISMODULE_ERR;
+    }
+}
+
+/* Retrieves the next field of the current stream ID and its corresponding value
+ * in a stream iteration. This function should be called repeatedly after calling
+ * RedisModule_StreamIteratorNextID() to fetch each field-value pair.
+ *
+ * - `key`: Key where a stream iterator has been started.
+ * - `field_ptr`: This is where the field is returned.
+ * - `value_ptr`: This is where the value is returned.
+ *
+ * Returns REDISMODULE_OK and points `*field_ptr` and `*value_ptr` to freshly
+ * allocated RedisModuleString objects. The string objects are freed
+ * automatically when the callback finishes if automatic memory is enabled. On
+ * failure, REDISMODULE_ERR is returned and `errno` is set as follows:
+ *
+ * - EINVAL if called with a NULL key
+ * - ENOTSUP if the key refers to a value of a type other than stream or if the
+ *   key is empty
+ * - EBADF if no stream iterator is associated with the key
+ * - ENOENT if there are no more fields in the current stream entry
+ *
+ * In practice, if RM_StreamIteratorNextField() is called after a successful
+ * call to RM_StreamIteratorNextID() and with the same key, it is safe to assume
+ * that an REDISMODULE_ERR return value means that there are no more fields.
+ *
+ * See the example at RedisModule_StreamIteratorStart().
+ */
+int RM_StreamIteratorNextField(RedisModuleKey *key, RedisModuleString **field_ptr, RedisModuleString **value_ptr) {
+    if (!key) {
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return REDISMODULE_ERR;
+    } else if (!key->iter) {
+        errno = EBADF;
+        return REDISMODULE_ERR;
+    } else if (key->u.stream.numfieldsleft <= 0) {
+        errno = ENOENT;
+        return REDISMODULE_ERR;
+    }
+    streamIterator *si = key->iter;
+    unsigned char *field, *value;
+    int64_t field_len, value_len;
+    streamIteratorGetField(si, &field, &value, &field_len, &value_len);
+    if (field_ptr) {
+        *field_ptr = createRawStringObject((char *)field, field_len);
+        autoMemoryAdd(key->ctx, REDISMODULE_AM_STRING, *field_ptr);
+    }
+    if (value_ptr) {
+        *value_ptr = createRawStringObject((char *)value, value_len);
+        autoMemoryAdd(key->ctx, REDISMODULE_AM_STRING, *value_ptr);
+    }
+    key->u.stream.numfieldsleft--;
+    return REDISMODULE_OK;
+}
+
+/* Deletes the current stream entry while iterating.
+ *
+ * This function can be called after RM_StreamIteratorNextID() or after any
+ * calls to RM_StreamIteratorNextField().
+ *
+ * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
+ * and `errno` is set as follows:
+ *
+ * - EINVAL if key is NULL
+ * - ENOTSUP if the key is empty or is of another type than stream
+ * - EBADF if the key is not opened for writing, if no iterator has been started
+ * - ENOENT if the iterator has no current stream entry
+ */
+int RM_StreamIteratorDelete(RedisModuleKey *key) {
+    if (!key) {
+        errno = EINVAL;
+        return REDISMODULE_ERR;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return REDISMODULE_ERR;
+    } else if (!(key->mode & REDISMODULE_WRITE) || !key->iter) {
+        errno = EBADF;
+        return REDISMODULE_ERR;
+    } else if (key->u.stream.currentid.ms == 0 &&
+               key->u.stream.currentid.seq == 0) {
+        errno = ENOENT;
+        return REDISMODULE_ERR;
+    }
+    streamIterator *si = key->iter;
+    streamIteratorRemoveEntry(si, &key->u.stream.currentid);
+    key->u.stream.currentid.ms = 0; /* Make sure repeated Delete() fails */
+    key->u.stream.currentid.seq = 0;
+    key->u.stream.numfieldsleft = 0; /* Make sure NextField() fails */
+    return REDISMODULE_OK;
+}
+
+/* Trim a stream by length, similar to XTRIM with MAXLEN.
+ *
+ * - `key`: Key opened for writing.
+ * - `flags`: A bitfield of
+ *   - `REDISMODULE_STREAM_TRIM_APPROX`: Trim less if it improves performance,
+ *     like XTRIM with `~`.
+ * - `length`: The number of stream entries to keep after trimming.
+ *
+ * Returns the number of entries deleted. On failure, a negative value is
+ * returned and `errno` is set as follows:
+ *
+ * - EINVAL if called with invalid arguments
+ * - ENOTSUP if the key is empty or of a type other than stream
+ * - EBADF if the key is not opened for writing
+ */
+long long RM_StreamTrimByLength(RedisModuleKey *key, int flags, long long length) {
+    if (!key || (flags & ~(REDISMODULE_STREAM_TRIM_APPROX)) || length < 0) {
+        errno = EINVAL;
+        return -1;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return -1;
+    } else if (!(key->mode & REDISMODULE_WRITE)) {
+        errno = EBADF;
+        return -1;
+    }
+    int approx = flags & REDISMODULE_STREAM_TRIM_APPROX ? 1 : 0;
+    return streamTrimByLength((stream *)key->value->ptr, length, approx);
+}
+
+/* Trim a stream by ID, similar to XTRIM with MINID.
+ *
+ * - `key`: Key opened for writing.
+ * - `flags`: A bitfield of
+ *   - `REDISMODULE_STREAM_TRIM_APPROX`: Trim less if it improves performance,
+ *     like XTRIM with `~`.
+ * - `id`: The smallest stream ID to keep after trimming.
+ *
+ * Returns the number of entries deleted. On failure, a negative value is
+ * returned and `errno` is set as follows:
+ *
+ * - EINVAL if called with invalid arguments
+ * - ENOTSUP if the key is empty or of a type other than stream
+ * - EBADF if the key is not opened for writing
+ */
+long long RM_StreamTrimByID(RedisModuleKey *key, int flags, RedisModuleStreamID *id) {
+    if (!key || (flags & ~(REDISMODULE_STREAM_TRIM_APPROX)) || !id) {
+        errno = EINVAL;
+        return -1;
+    } else if (!key->value || key->value->type != OBJ_STREAM) {
+        errno = ENOTSUP;
+        return -1;
+    } else if (!(key->mode & REDISMODULE_WRITE)) {
+        errno = EBADF;
+        return -1;
+    }
+    int approx = flags & REDISMODULE_STREAM_TRIM_APPROX ? 1 : 0;
+    streamID minid = (streamID){id->ms, id->seq};
+    return streamTrimByID((stream *)key->value->ptr, minid, approx);
+}
+
+/* --------------------------------------------------------------------------
+ * ## Calling Redis commands from modules
+ *
+ * RM_Call() sends a command to Redis. The remaining functions handle the reply.
+ * -------------------------------------------------------------------------- */
+
+/* Create a new RedisModuleCallReply object. The processing of the reply
+ * is lazy, the object is just populated with the raw protocol and later
+ * is processed as needed. Initially we just make sure to set the right
+ * reply type, which is extremely cheap to do. */
+RedisModuleCallReply *moduleCreateCallReplyFromProto(RedisModuleCtx *ctx, sds proto) {
+    RedisModuleCallReply *reply = zmalloc(sizeof(*reply));
+    reply->ctx = ctx;
+    reply->proto = proto;
+    reply->protolen = sdslen(proto);
+    reply->flags = REDISMODULE_REPLYFLAG_TOPARSE; /* Lazy parsing. */
+    switch(proto[0]) {
+    case '$':
+    case '+': reply->type = REDISMODULE_REPLY_STRING; break;
+    case '-': reply->type = REDISMODULE_REPLY_ERROR; break;
+    case ':': reply->type = REDISMODULE_REPLY_INTEGER; break;
+    case '*': reply->type = REDISMODULE_REPLY_ARRAY; break;
+    default: reply->type = REDISMODULE_REPLY_UNKNOWN; break;
+    }
+    if ((proto[0] == '*' || proto[0] == '$') && proto[1] == '-')
+        reply->type = REDISMODULE_REPLY_NULL;
+    return reply;
+}
+
+void moduleParseCallReply_Int(RedisModuleCallReply *reply);
+void moduleParseCallReply_BulkString(RedisModuleCallReply *reply);
+void moduleParseCallReply_SimpleString(RedisModuleCallReply *reply);
+void moduleParseCallReply_Array(RedisModuleCallReply *reply);
+
+/* Do nothing if REDISMODULE_REPLYFLAG_TOPARSE is false, otherwise
+ * use the protocol of the reply in reply->proto in order to fill the
+ * reply with parsed data according to the reply type. */
+void moduleParseCallReply(RedisModuleCallReply *reply) {
+    if (!(reply->flags & REDISMODULE_REPLYFLAG_TOPARSE)) return;
+    reply->flags &= ~REDISMODULE_REPLYFLAG_TOPARSE;
+
+    switch(reply->proto[0]) {
+    case ':': moduleParseCallReply_Int(reply); break;
+    case '$': moduleParseCallReply_BulkString(reply); break;
+    case '-': /* handled by next item. */
+    case '+': moduleParseCallReply_SimpleString(reply); break;
+    case '*': moduleParseCallReply_Array(reply); break;
+    }
+}
+
+void moduleParseCallReply_Int(RedisModuleCallReply *reply) {
+    char *proto = reply->proto;
+    char *p = strchr(proto+1,'\r');
+
+    string2ll(proto+1,p-proto-1,&reply->val.ll);
+    reply->protolen = p-proto+2;
+    reply->type = REDISMODULE_REPLY_INTEGER;
+}
+
+void moduleParseCallReply_BulkString(RedisModuleCallReply *reply) {
+    char *proto = reply->proto;
+    char *p = strchr(proto+1,'\r');
+    long long bulklen;
+
+    string2ll(proto+1,p-proto-1,&bulklen);
+    if (bulklen == -1) {
+        reply->protolen = p-proto+2;
+        reply->type = REDISMODULE_REPLY_NULL;
+    } else {
+        reply->val.str = p+2;
+        reply->len = bulklen;
+        reply->protolen = p-proto+2+bulklen+2;
+        reply->type = REDISMODULE_REPLY_STRING;
+    }
+}
+
+void moduleParseCallReply_SimpleString(RedisModuleCallReply *reply) {
+    char *proto = reply->proto;
+    char *p = strchr(proto+1,'\r');
+
+    reply->val.str = proto+1;
+    reply->len = p-proto-1;
+    reply->protolen = p-proto+2;
+    reply->type = proto[0] == '+' ? REDISMODULE_REPLY_STRING :
+                                    REDISMODULE_REPLY_ERROR;
+}
+
+void moduleParseCallReply_Array(RedisModuleCallReply *reply) {
+    char *proto = reply->proto;
+    char *p = strchr(proto+1,'\r');
+    long long arraylen, j;
+
+    string2ll(proto+1,p-proto-1,&arraylen);
+    p += 2;
+
+    if (arraylen == -1) {
+        reply->protolen = p-proto;
+        reply->type = REDISMODULE_REPLY_NULL;
+        return;
+    }
+
+    reply->val.array = zmalloc(sizeof(RedisModuleCallReply)*arraylen);
+    reply->len = arraylen;
+    for (j = 0; j < arraylen; j++) {
+        RedisModuleCallReply *ele = reply->val.array+j;
+        ele->flags = REDISMODULE_REPLYFLAG_NESTED |
+                     REDISMODULE_REPLYFLAG_TOPARSE;
+        ele->proto = p;
+        ele->ctx = reply->ctx;
+        moduleParseCallReply(ele);
+        p += ele->protolen;
+    }
+    reply->protolen = p-proto;
+    reply->type = REDISMODULE_REPLY_ARRAY;
+}
+
+/* Recursive free reply function. */
+void moduleFreeCallReplyRec(RedisModuleCallReply *reply, int freenested){
+    /* Don't free nested replies by default: the user must always free the
+     * toplevel reply. However be gentle and don't crash if the module
+     * misuses the API. */
+    if (!freenested && reply->flags & REDISMODULE_REPLYFLAG_NESTED) return;
+
+    if (!(reply->flags & REDISMODULE_REPLYFLAG_TOPARSE)) {
+        if (reply->type == REDISMODULE_REPLY_ARRAY) {
+            size_t j;
+            for (j = 0; j < reply->len; j++)
+                moduleFreeCallReplyRec(reply->val.array+j,1);
+            zfree(reply->val.array);
+        }
+    }
+
+    /* For nested replies, we don't free reply->proto (which if not NULL
+     * references the parent reply->proto buffer), nor the structure
+     * itself which is allocated as an array of structures, and is freed
+     * when the array value is released. */
+    if (!(reply->flags & REDISMODULE_REPLYFLAG_NESTED)) {
+        if (reply->proto) sdsfree(reply->proto);
+        zfree(reply);
+    }
+}
+
+/* Free a Call reply and all the nested replies it contains if it's an
+ * array. */
+void RM_FreeCallReply(RedisModuleCallReply *reply) {
+    /* This is a wrapper for the recursive free reply function. This is needed
+     * in order to have the first level function to return on nested replies,
+     * but only if called by the module API. */
+    RedisModuleCtx *ctx = reply->ctx;
+    moduleFreeCallReplyRec(reply,0);
+    autoMemoryFreed(ctx,REDISMODULE_AM_REPLY,reply);
+}
+
+/* Return the reply type. */
+int RM_CallReplyType(RedisModuleCallReply *reply) {
+    if (!reply) return REDISMODULE_REPLY_UNKNOWN;
+    return reply->type;
+}
+
+/* Return the reply type length, where applicable. */
+size_t RM_CallReplyLength(RedisModuleCallReply *reply) {
+    moduleParseCallReply(reply);
+    switch(reply->type) {
+    case REDISMODULE_REPLY_STRING:
+    case REDISMODULE_REPLY_ERROR:
+    case REDISMODULE_REPLY_ARRAY:
+        return reply->len;
+    default:
+        return 0;
+    }
+}
+
+/* Return the 'idx'-th nested call reply element of an array reply, or NULL
+ * if the reply type is wrong or the index is out of range. */
+RedisModuleCallReply *RM_CallReplyArrayElement(RedisModuleCallReply *reply, size_t idx) {
+    moduleParseCallReply(reply);
+    if (reply->type != REDISMODULE_REPLY_ARRAY) return NULL;
+    if (idx >= reply->len) return NULL;
+    return reply->val.array+idx;
+}
+
+/* Return the long long of an integer reply. */
+long long RM_CallReplyInteger(RedisModuleCallReply *reply) {
+    moduleParseCallReply(reply);
+    if (reply->type != REDISMODULE_REPLY_INTEGER) return LLONG_MIN;
+    return reply->val.ll;
+}
+
+/* Return the pointer and length of a string or error reply. */
+const char *RM_CallReplyStringPtr(RedisModuleCallReply *reply, size_t *len) {
+    moduleParseCallReply(reply);
+    if (reply->type != REDISMODULE_REPLY_STRING &&
+        reply->type != REDISMODULE_REPLY_ERROR) return NULL;
+    if (len) *len = reply->len;
+    return reply->val.str;
+}
+
+/* Return a new string object from a call reply of type string, error or
+ * integer. Otherwise (wrong reply type) return NULL. */
+RedisModuleString *RM_CreateStringFromCallReply(RedisModuleCallReply *reply) {
+    moduleParseCallReply(reply);
+    switch(reply->type) {
+    case REDISMODULE_REPLY_STRING:
+    case REDISMODULE_REPLY_ERROR:
+        return RM_CreateString(reply->ctx,reply->val.str,reply->len);
+    case REDISMODULE_REPLY_INTEGER: {
+        char buf[64];
+        int len = ll2string(buf,sizeof(buf),reply->val.ll);
+        return RM_CreateString(reply->ctx,buf,len);
+        }
+    default: return NULL;
+    }
+}
+
+/* Returns an array of robj pointers, and populates *argc with the number
+ * of items, by parsing the format specifier "fmt" as described for
+ * the RM_Call(), RM_Replicate() and other module APIs.
+ *
+ * The integer pointed by 'flags' is populated with flags according
+ * to special modifiers in "fmt". For now only one exists:
+ *
+ *     "!" -> REDISMODULE_ARGV_REPLICATE
+ *     "A" -> REDISMODULE_ARGV_NO_AOF
+ *     "R" -> REDISMODULE_ARGV_NO_REPLICAS
+ *
+ * On error (format specifier error) NULL is returned and nothing is
+ * allocated. On success the argument vector is returned. */
+robj **moduleCreateArgvFromUserFormat(const char *cmdname, const char *fmt, int *argcp, int *flags, va_list ap) {
+    int argc = 0, argv_size, j;
+    robj **argv = NULL;
+
+    /* As a first guess to avoid useless reallocations, size argv to
+     * hold one argument for each char specifier in 'fmt'. */
+    argv_size = strlen(fmt)+1; /* +1 because of the command name. */
+    argv = zrealloc(argv,sizeof(robj*)*argv_size);
+
+    /* Build the arguments vector based on the format specifier. */
+    argv[0] = createStringObject(cmdname,strlen(cmdname));
+    argc++;
+
+    /* Create the client and dispatch the command. */
+    const char *p = fmt;
+    while(*p) {
+        if (*p == 'c') {
+            char *cstr = va_arg(ap,char*);
+            argv[argc++] = createStringObject(cstr,strlen(cstr));
+        } else if (*p == 's') {
+            robj *obj = va_arg(ap,void*);
+            if (obj->refcount == OBJ_STATIC_REFCOUNT)
+                obj = createStringObject(obj->ptr,sdslen(obj->ptr));
+            else
+                incrRefCount(obj);
+            argv[argc++] = obj;
+        } else if (*p == 'b') {
+            char *buf = va_arg(ap,char*);
+            size_t len = va_arg(ap,size_t);
+            argv[argc++] = createStringObject(buf,len);
+        } else if (*p == 'l') {
+            long long ll = va_arg(ap,long long);
+            argv[argc++] = createObject(OBJ_STRING,sdsfromlonglong(ll));
+        } else if (*p == 'v') {
+             /* A vector of strings */
+             robj **v = va_arg(ap, void*);
+             size_t vlen = va_arg(ap, size_t);
+
+             /* We need to grow argv to hold the vector's elements.
+              * We resize by vector_len-1 elements, because we held
+              * one element in argv for the vector already */
+             argv_size += vlen-1;
+             argv = zrealloc(argv,sizeof(robj*)*argv_size);
+
+             size_t i = 0;
+             for (i = 0; i < vlen; i++) {
+                 incrRefCount(v[i]);
+                 argv[argc++] = v[i];
+             }
+        } else if (*p == '!') {
+            if (flags) (*flags) |= REDISMODULE_ARGV_REPLICATE;
+        } else if (*p == 'A') {
+            if (flags) (*flags) |= REDISMODULE_ARGV_NO_AOF;
+        } else if (*p == 'R') {
+            if (flags) (*flags) |= REDISMODULE_ARGV_NO_REPLICAS;
+        } else {
+            goto fmterr;
+        }
+        p++;
+    }
+    *argcp = argc;
+    return argv;
+
+fmterr:
+    for (j = 0; j < argc; j++)
+        decrRefCount(argv[j]);
+    zfree(argv);
+    return NULL;
+}
+
+/* Exported API to call any Redis command from modules.
+ *
+ * * **cmdname**: The Redis command to call.
+ * * **fmt**: A format specifier string for the command's arguments. Each
+ *   of the arguments should be specified by a valid type specification. The
+ *   format specifier can also contain the modifiers `!`, `A` and `R` which
+ *   don't have a corresponding argument.
+ *
+ *     * `b` -- The argument is a buffer and is immediately followed by another
+ *              argument that is the buffer's length.
+ *     * `c` -- The argument is a pointer to a plain C string (null-terminated).
+ *     * `l` -- The argument is long long integer.
+ *     * `s` -- The argument is a RedisModuleString.
+ *     * `v` -- The argument(s) is a vector of RedisModuleString.
+ *     * `!` -- Sends the Redis command and its arguments to replicas and AOF.
+ *     * `A` -- Suppress AOF propagation, send only to replicas (requires `!`).
+ *     * `R` -- Suppress replicas propagation, send only to AOF (requires `!`).
+ * * **...**: The actual arguments to the Redis command.
+ *
+ * On success a RedisModuleCallReply object is returned, otherwise
+ * NULL is returned and errno is set to the following values:
+ *
+ * * EBADF: wrong format specifier.
+ * * EINVAL: wrong command arity.
+ * * ENOENT: command does not exist.
+ * * EPERM: operation in Cluster instance with key in non local slot.
+ * * EROFS: operation in Cluster instance when a write command is sent
+ *          in a readonly state.
+ * * ENETDOWN: operation in Cluster instance when cluster is down.
+ *
+ * Example code fragment:
+ * 
+ *      reply = RedisModule_Call(ctx,"INCRBY","sc",argv[1],"10");
+ *      if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_INTEGER) {
+ *        long long myval = RedisModule_CallReplyInteger(reply);
+ *        // Do something with myval.
+ *      }
+ *
+ * This API is documented here: https://redis.io/topics/modules-intro
+ */
+RedisModuleCallReply *RM_Call(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) {
+    struct redisCommand *cmd;
+    client *c = NULL;
+    robj **argv = NULL;
+    int argc = 0, flags = 0;
+    va_list ap;
+    RedisModuleCallReply *reply = NULL;
+    int replicate = 0; /* Replicate this command? */
+
+    /* Handle arguments. */
+    va_start(ap, fmt);
+    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
+    replicate = flags & REDISMODULE_ARGV_REPLICATE;
+    va_end(ap);
+
+    /* Setup our fake client for command execution. */
+    if (server.module_client == NULL) {
+        /* This is the first RM_Call() ever. Create reusable client. */
+        c = server.module_client = createClient(NULL);
+    } else if (server.module_client->argv == NULL) {
+        /* The reusable module client is not busy with a command. Use it. */
+        c = server.module_client;
+    } else {
+        /* The reusable module client is busy. (It is probably used in a
+         * recursive call to this module.) */
+        c = createClient(NULL);
+    }
+    c->user = NULL; /* Root user. */
+    c->flags = CLIENT_MODULE;
+
+    /* We do not want to allow block, the module do not expect it */
+    c->flags |= CLIENT_DENY_BLOCKING;
+    c->db = ctx->client->db;
+    c->argv = argv;
+    c->argc = argc;
+    if (ctx->module) ctx->module->in_call++;
+
+    /* We handle the above format error only when the client is setup so that
+     * we can free it normally. */
+    if (argv == NULL) {
+        errno = EBADF;
+        goto cleanup;
+    }
+
+    /* Call command filters */
+    moduleCallCommandFilters(c);
+
+    /* Lookup command now, after filters had a chance to make modifications
+     * if necessary.
+     */
+    cmd = lookupCommand(c->argv[0]->ptr);
+    if (!cmd) {
+        errno = ENOENT;
+        goto cleanup;
+    }
+    c->cmd = c->lastcmd = cmd;
+
+    /* Basic arity checks. */
+    if ((cmd->arity > 0 && cmd->arity != argc) || (argc < -cmd->arity)) {
+        errno = EINVAL;
+        goto cleanup;
+    }
+
+    /* If this is a Redis Cluster node, we need to make sure the module is not
+     * trying to access non-local keys, with the exception of commands
+     * received from our master. */
+    if (server.cluster_enabled && !(ctx->client->flags & CLIENT_MASTER)) {
+        int error_code;
+        /* Duplicate relevant flags in the module client. */
+        c->flags &= ~(CLIENT_READONLY|CLIENT_ASKING);
+        c->flags |= ctx->client->flags & (CLIENT_READONLY|CLIENT_ASKING);
+        if (getNodeByQuery(c,c->cmd,c->argv,c->argc,NULL,&error_code) !=
+                           server.cluster->myself)
+        {
+            if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) { 
+                errno = EROFS;
+            } else if (error_code == CLUSTER_REDIR_DOWN_STATE) { 
+                errno = ENETDOWN;
+            } else {
+                errno = EPERM;
+            }
+            goto cleanup;
+        }
+    }
+
+    /* We need to use a global replication_allowed flag in order to prevent
+     * replication of nested RM_Calls. Example:
+     * 1. module1.foo does RM_Call of module2.bar without replication (i.e. no '!')
+     * 2. module2.bar internally calls RM_Call of INCR with '!'
+     * 3. at the end of module1.foo we call RM_ReplicateVerbatim
+     * We want the replica/AOF to see only module1.foo and not the INCR from module2.bar */
+    int prev_replication_allowed = server.replication_allowed;
+    server.replication_allowed = replicate && server.replication_allowed;
+
+    /* Run the command */
+    int call_flags = CMD_CALL_SLOWLOG | CMD_CALL_STATS | CMD_CALL_NOWRAP;
+    if (replicate) {
+        /* If we are using single commands replication, we need to wrap what
+         * we propagate into a MULTI/EXEC block, so that it will be atomic like
+         * a Lua script in the context of AOF and slaves. */
+        moduleReplicateMultiIfNeeded(ctx);
+
+        if (!(flags & REDISMODULE_ARGV_NO_AOF))
+            call_flags |= CMD_CALL_PROPAGATE_AOF;
+        if (!(flags & REDISMODULE_ARGV_NO_REPLICAS))
+            call_flags |= CMD_CALL_PROPAGATE_REPL;
+    }
+    call(c,call_flags);
+    server.replication_allowed = prev_replication_allowed;
+
+    serverAssert((c->flags & CLIENT_BLOCKED) == 0);
+
+    /* Convert the result of the Redis command into a module reply. */
+    sds proto = sdsnewlen(c->buf,c->bufpos);
+    c->bufpos = 0;
+    while(listLength(c->reply)) {
+        clientReplyBlock *o = listNodeValue(listFirst(c->reply));
+
+        proto = sdscatlen(proto,o->buf,o->used);
+        listDelNode(c->reply,listFirst(c->reply));
+    }
+    reply = moduleCreateCallReplyFromProto(ctx,proto);
+    autoMemoryAdd(ctx,REDISMODULE_AM_REPLY,reply);
+
+cleanup:
+    if (ctx->module) ctx->module->in_call--;
+    if (c == server.module_client) {
+        /* reset shared client so it can be reused */
+        discardTransaction(c);
+        pubsubUnsubscribeAllChannels(c,0);
+        pubsubUnsubscribeAllPatterns(c,0);
+        resetClient(c); /* frees the contents of argv */
+        zfree(c->argv);
+        c->argv = NULL;
+        c->resp = 2;
+    } else {
+        freeClient(c); /* temporary client */
+    }
+    return reply;
+}
+
+/* Return a pointer, and a length, to the protocol returned by the command
+ * that returned the reply object. */
+const char *RM_CallReplyProto(RedisModuleCallReply *reply, size_t *len) {
+    if (reply->proto) *len = sdslen(reply->proto);
+    return reply->proto;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules data types
+ *
+ * When String DMA or using existing data structures is not enough, it is
+ * possible to create new data types from scratch and export them to
+ * Redis. The module must provide a set of callbacks for handling the
+ * new values exported (for example in order to provide RDB saving/loading,
+ * AOF rewrite, and so forth). In this section we define this API.
+ * -------------------------------------------------------------------------- */
+
+/* Turn a 9 chars name in the specified charset and a 10 bit encver into
+ * a single 64 bit unsigned integer that represents this exact module name
+ * and version. This final number is called a "type ID" and is used when
+ * writing module exported values to RDB files, in order to re-associate the
+ * value to the right module to load them during RDB loading.
+ *
+ * If the string is not of the right length or the charset is wrong, or
+ * if encver is outside the unsigned 10 bit integer range, 0 is returned,
+ * otherwise the function returns the right type ID.
+ *
+ * The resulting 64 bit integer is composed as follows:
+ *
+ *     (high order bits) 6|6|6|6|6|6|6|6|6|10 (low order bits)
+ *
+ * The first 6 bits value is the first character, name[0], while the last
+ * 6 bits value, immediately before the 10 bits integer, is name[8].
+ * The last 10 bits are the encoding version.
+ *
+ * Note that a name and encver combo of "AAAAAAAAA" and 0, will produce
+ * zero as return value, that is the same we use to signal errors, thus
+ * this combination is invalid, and also useless since type names should
+ * try to be vary to avoid collisions. */
+
+const char *ModuleTypeNameCharSet =
+             "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+             "abcdefghijklmnopqrstuvwxyz"
+             "0123456789-_";
+
+uint64_t moduleTypeEncodeId(const char *name, int encver) {
+    /* We use 64 symbols so that we can map each character into 6 bits
+     * of the final output. */
+    const char *cset = ModuleTypeNameCharSet;
+    if (strlen(name) != 9) return 0;
+    if (encver < 0 || encver > 1023) return 0;
+
+    uint64_t id = 0;
+    for (int j = 0; j < 9; j++) {
+        char *p = strchr(cset,name[j]);
+        if (!p) return 0;
+        unsigned long pos = p-cset;
+        id = (id << 6) | pos;
+    }
+    id = (id << 10) | encver;
+    return id;
+}
+
+/* Search, in the list of exported data types of all the modules registered,
+ * a type with the same name as the one given. Returns the moduleType
+ * structure pointer if such a module is found, or NULL otherwise. */
+moduleType *moduleTypeLookupModuleByName(const char *name) {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        listIter li;
+        listNode *ln;
+
+        listRewind(module->types,&li);
+        while((ln = listNext(&li))) {
+            moduleType *mt = ln->value;
+            if (memcmp(name,mt->name,sizeof(mt->name)) == 0) {
+                dictReleaseIterator(di);
+                return mt;
+            }
+        }
+    }
+    dictReleaseIterator(di);
+    return NULL;
+}
+
+/* Lookup a module by ID, with caching. This function is used during RDB
+ * loading. Modules exporting data types should never be able to unload, so
+ * our cache does not need to expire. */
+#define MODULE_LOOKUP_CACHE_SIZE 3
+
+moduleType *moduleTypeLookupModuleByID(uint64_t id) {
+    static struct {
+        uint64_t id;
+        moduleType *mt;
+    } cache[MODULE_LOOKUP_CACHE_SIZE];
+
+    /* Search in cache to start. */
+    int j;
+    for (j = 0; j < MODULE_LOOKUP_CACHE_SIZE && cache[j].mt != NULL; j++)
+        if (cache[j].id == id) return cache[j].mt;
+
+    /* Slow module by module lookup. */
+    moduleType *mt = NULL;
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL && mt == NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        listIter li;
+        listNode *ln;
+
+        listRewind(module->types,&li);
+        while((ln = listNext(&li))) {
+            moduleType *this_mt = ln->value;
+            /* Compare only the 54 bit module identifier and not the
+             * encoding version. */
+            if (this_mt->id >> 10 == id >> 10) {
+                mt = this_mt;
+                break;
+            }
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Add to cache if possible. */
+    if (mt && j < MODULE_LOOKUP_CACHE_SIZE) {
+        cache[j].id = id;
+        cache[j].mt = mt;
+    }
+    return mt;
+}
+
+/* Turn an (unresolved) module ID into a type name, to show the user an
+ * error when RDB files contain module data we can't load.
+ * The buffer pointed by 'name' must be 10 bytes at least. The function will
+ * fill it with a null terminated module name. */
+void moduleTypeNameByID(char *name, uint64_t moduleid) {
+    const char *cset = ModuleTypeNameCharSet;
+
+    name[9] = '\0';
+    char *p = name+8;
+    moduleid >>= 10;
+    for (int j = 0; j < 9; j++) {
+        *p-- = cset[moduleid & 63];
+        moduleid >>= 6;
+    }
+}
+
+/* Return the name of the module that owns the specified moduleType. */
+const char *moduleTypeModuleName(moduleType *mt) {
+    if (!mt || !mt->module) return NULL;
+    return mt->module->name;
+}
+
+/* Create a copy of a module type value using the copy callback. If failed
+ * or not supported, produce an error reply and return NULL.
+ */
+robj *moduleTypeDupOrReply(client *c, robj *fromkey, robj *tokey, robj *value) {
+    moduleValue *mv = value->ptr;
+    moduleType *mt = mv->type;
+    if (!mt->copy) {
+        addReplyError(c, "not supported for this module key");
+        return NULL;
+    }
+    void *newval = mt->copy(fromkey, tokey, mv->value);
+    if (!newval) {
+        addReplyError(c, "module key failed to copy");
+        return NULL;
+    }
+    return createModuleObject(mt, newval);
+}
+
+/* Register a new data type exported by the module. The parameters are the
+ * following. Please for in depth documentation check the modules API
+ * documentation, especially https://redis.io/topics/modules-native-types.
+ *
+ * * **name**: A 9 characters data type name that MUST be unique in the Redis
+ *   Modules ecosystem. Be creative... and there will be no collisions. Use
+ *   the charset A-Z a-z 9-0, plus the two "-_" characters. A good
+ *   idea is to use, for example `<typename>-<vendor>`. For example
+ *   "tree-AntZ" may mean "Tree data structure by @antirez". To use both
+ *   lower case and upper case letters helps in order to prevent collisions.
+ * * **encver**: Encoding version, which is, the version of the serialization
+ *   that a module used in order to persist data. As long as the "name"
+ *   matches, the RDB loading will be dispatched to the type callbacks
+ *   whatever 'encver' is used, however the module can understand if
+ *   the encoding it must load are of an older version of the module.
+ *   For example the module "tree-AntZ" initially used encver=0. Later
+ *   after an upgrade, it started to serialize data in a different format
+ *   and to register the type with encver=1. However this module may
+ *   still load old data produced by an older version if the rdb_load
+ *   callback is able to check the encver value and act accordingly.
+ *   The encver must be a positive value between 0 and 1023.
+ *
+ * * **typemethods_ptr** is a pointer to a RedisModuleTypeMethods structure
+ *   that should be populated with the methods callbacks and structure
+ *   version, like in the following example:
+ *
+ *         RedisModuleTypeMethods tm = {
+ *             .version = REDISMODULE_TYPE_METHOD_VERSION,
+ *             .rdb_load = myType_RDBLoadCallBack,
+ *             .rdb_save = myType_RDBSaveCallBack,
+ *             .aof_rewrite = myType_AOFRewriteCallBack,
+ *             .free = myType_FreeCallBack,
+ *
+ *             // Optional fields
+ *             .digest = myType_DigestCallBack,
+ *             .mem_usage = myType_MemUsageCallBack,
+ *             .aux_load = myType_AuxRDBLoadCallBack,
+ *             .aux_save = myType_AuxRDBSaveCallBack,
+ *             .free_effort = myType_FreeEffortCallBack,
+ *             .unlink = myType_UnlinkCallBack,
+ *             .copy = myType_CopyCallback,
+ *             .defrag = myType_DefragCallback
+ *         }
+ *
+ * * **rdb_load**: A callback function pointer that loads data from RDB files.
+ * * **rdb_save**: A callback function pointer that saves data to RDB files.
+ * * **aof_rewrite**: A callback function pointer that rewrites data as commands.
+ * * **digest**: A callback function pointer that is used for `DEBUG DIGEST`.
+ * * **free**: A callback function pointer that can free a type value.
+ * * **aux_save**: A callback function pointer that saves out of keyspace data to RDB files.
+ *   'when' argument is either REDISMODULE_AUX_BEFORE_RDB or REDISMODULE_AUX_AFTER_RDB.
+ * * **aux_load**: A callback function pointer that loads out of keyspace data from RDB files.
+ *   Similar to aux_save, returns REDISMODULE_OK on success, and ERR otherwise.
+ * * **free_effort**: A callback function pointer that used to determine whether the module's
+ *   memory needs to be lazy reclaimed. The module should return the complexity involved by
+ *   freeing the value. for example: how many pointers are gonna be freed. Note that if it 
+ *   returns 0, we'll always do an async free.
+ * * **unlink**: A callback function pointer that used to notifies the module that the key has 
+ *   been removed from the DB by redis, and may soon be freed by a background thread. Note that 
+ *   it won't be called on FLUSHALL/FLUSHDB (both sync and async), and the module can use the 
+ *   RedisModuleEvent_FlushDB to hook into that.
+ * * **copy**: A callback function pointer that is used to make a copy of the specified key.
+ *   The module is expected to perform a deep copy of the specified value and return it.
+ *   In addition, hints about the names of the source and destination keys is provided.
+ *   A NULL return value is considered an error and the copy operation fails.
+ *   Note: if the target key exists and is being overwritten, the copy callback will be
+ *   called first, followed by a free callback to the value that is being replaced.
+ * 
+ * * **defrag**: A callback function pointer that is used to request the module to defrag
+ *   a key. The module should then iterate pointers and call the relevant RM_Defrag*()
+ *   functions to defragment pointers or complex types. The module should continue
+ *   iterating as long as RM_DefragShouldStop() returns a zero value, and return a
+ *   zero value if finished or non-zero value if more work is left to be done. If more work
+ *   needs to be done, RM_DefragCursorSet() and RM_DefragCursorGet() can be used to track
+ *   this work across different calls.
+ *   Normally, the defrag mechanism invokes the callback without a time limit, so
+ *   RM_DefragShouldStop() always returns zero. The "late defrag" mechanism which has
+ *   a time limit and provides cursor support is used only for keys that are determined
+ *   to have significant internal complexity. To determine this, the defrag mechanism
+ *   uses the free_effort callback and the 'active-defrag-max-scan-fields' config directive.
+ *   NOTE: The value is passed as a `void**` and the function is expected to update the
+ *   pointer if the top-level value pointer is defragmented and consequentially changes.
+ *
+ * Note: the module name "AAAAAAAAA" is reserved and produces an error, it
+ * happens to be pretty lame as well.
+ *
+ * If there is already a module registering a type with the same name,
+ * and if the module name or encver is invalid, NULL is returned.
+ * Otherwise the new type is registered into Redis, and a reference of
+ * type RedisModuleType is returned: the caller of the function should store
+ * this reference into a global variable to make future use of it in the
+ * modules type API, since a single module may register multiple types.
+ * Example code fragment:
+ *
+ *      static RedisModuleType *BalancedTreeType;
+ *
+ *      int RedisModule_OnLoad(RedisModuleCtx *ctx) {
+ *          // some code here ...
+ *          BalancedTreeType = RM_CreateDataType(...);
+ *      }
+ */
+moduleType *RM_CreateDataType(RedisModuleCtx *ctx, const char *name, int encver, void *typemethods_ptr) {
+    uint64_t id = moduleTypeEncodeId(name,encver);
+    if (id == 0) return NULL;
+    if (moduleTypeLookupModuleByName(name) != NULL) return NULL;
+
+    long typemethods_version = ((long*)typemethods_ptr)[0];
+    if (typemethods_version == 0) return NULL;
+
+    struct typemethods {
+        uint64_t version;
+        moduleTypeLoadFunc rdb_load;
+        moduleTypeSaveFunc rdb_save;
+        moduleTypeRewriteFunc aof_rewrite;
+        moduleTypeMemUsageFunc mem_usage;
+        moduleTypeDigestFunc digest;
+        moduleTypeFreeFunc free;
+        struct {
+            moduleTypeAuxLoadFunc aux_load;
+            moduleTypeAuxSaveFunc aux_save;
+            int aux_save_triggers;
+        } v2;
+        struct {
+            moduleTypeFreeEffortFunc free_effort;
+            moduleTypeUnlinkFunc unlink;
+            moduleTypeCopyFunc copy;
+            moduleTypeDefragFunc defrag;
+        } v3;
+    } *tms = (struct typemethods*) typemethods_ptr;
+
+    moduleType *mt = zcalloc(sizeof(*mt));
+    mt->id = id;
+    mt->module = ctx->module;
+    mt->rdb_load = tms->rdb_load;
+    mt->rdb_save = tms->rdb_save;
+    mt->aof_rewrite = tms->aof_rewrite;
+    mt->mem_usage = tms->mem_usage;
+    mt->digest = tms->digest;
+    mt->free = tms->free;
+    if (tms->version >= 2) {
+        mt->aux_load = tms->v2.aux_load;
+        mt->aux_save = tms->v2.aux_save;
+        mt->aux_save_triggers = tms->v2.aux_save_triggers;
+    }
+    if (tms->version >= 3) {
+        mt->free_effort = tms->v3.free_effort;
+        mt->unlink = tms->v3.unlink;
+        mt->copy = tms->v3.copy;
+        mt->defrag = tms->v3.defrag;
+    }
+    memcpy(mt->name,name,sizeof(mt->name));
+    listAddNodeTail(ctx->module->types,mt);
+    return mt;
+}
+
+/* If the key is open for writing, set the specified module type object
+ * as the value of the key, deleting the old value if any.
+ * On success REDISMODULE_OK is returned. If the key is not open for
+ * writing or there is an active iterator, REDISMODULE_ERR is returned. */
+int RM_ModuleTypeSetValue(RedisModuleKey *key, moduleType *mt, void *value) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->iter) return REDISMODULE_ERR;
+    RM_DeleteKey(key);
+    robj *o = createModuleObject(mt,value);
+    genericSetKey(key->ctx->client,key->db,key->key,o,0,0);
+    decrRefCount(o);
+    key->value = o;
+    return REDISMODULE_OK;
+}
+
+/* Assuming RedisModule_KeyType() returned REDISMODULE_KEYTYPE_MODULE on
+ * the key, returns the module type pointer of the value stored at key.
+ *
+ * If the key is NULL, is not associated with a module type, or is empty,
+ * then NULL is returned instead. */
+moduleType *RM_ModuleTypeGetType(RedisModuleKey *key) {
+    if (key == NULL ||
+        key->value == NULL ||
+        RM_KeyType(key) != REDISMODULE_KEYTYPE_MODULE) return NULL;
+    moduleValue *mv = key->value->ptr;
+    return mv->type;
+}
+
+/* Assuming RedisModule_KeyType() returned REDISMODULE_KEYTYPE_MODULE on
+ * the key, returns the module type low-level value stored at key, as
+ * it was set by the user via RedisModule_ModuleTypeSetValue().
+ *
+ * If the key is NULL, is not associated with a module type, or is empty,
+ * then NULL is returned instead. */
+void *RM_ModuleTypeGetValue(RedisModuleKey *key) {
+    if (key == NULL ||
+        key->value == NULL ||
+        RM_KeyType(key) != REDISMODULE_KEYTYPE_MODULE) return NULL;
+    moduleValue *mv = key->value->ptr;
+    return mv->value;
+}
+
+/* --------------------------------------------------------------------------
+ * ## RDB loading and saving functions
+ * -------------------------------------------------------------------------- */
+
+/* Called when there is a load error in the context of a module. On some
+ * modules this cannot be recovered, but if the module declared capability
+ * to handle errors, we'll raise a flag rather than exiting. */
+void moduleRDBLoadError(RedisModuleIO *io) {
+    if (io->type->module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS) {
+        io->error = 1;
+        return;
+    }
+    serverPanic(
+        "Error loading data from RDB (short read or EOF). "
+        "Read performed by module '%s' about type '%s' "
+        "after reading '%llu' bytes of a value "
+        "for key named: '%s'.",
+        io->type->module->name,
+        io->type->name,
+        (unsigned long long)io->bytes,
+        io->key? (char*)io->key->ptr: "(null)");
+}
+
+/* Returns 0 if there's at least one registered data type that did not declare
+ * REDISMODULE_OPTIONS_HANDLE_IO_ERRORS, in which case diskless loading should
+ * be avoided since it could cause data loss. */
+int moduleAllDatatypesHandleErrors() {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        if (listLength(module->types) &&
+            !(module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS))
+        {
+            dictReleaseIterator(di);
+            return 0;
+        }
+    }
+    dictReleaseIterator(di);
+    return 1;
+}
+
+/* Returns true if any previous IO API failed.
+ * for `Load*` APIs the REDISMODULE_OPTIONS_HANDLE_IO_ERRORS flag must be set with
+ * RedisModule_SetModuleOptions first. */
+int RM_IsIOError(RedisModuleIO *io) {
+    return io->error;
+}
+
+/* Save an unsigned 64 bit value into the RDB file. This function should only
+ * be called in the context of the rdb_save method of modules implementing new
+ * data types. */
+void RM_SaveUnsigned(RedisModuleIO *io, uint64_t value) {
+    if (io->error) return;
+    /* Save opcode. */
+    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_UINT);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    /* Save value. */
+    retval = rdbSaveLen(io->rio, value);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    return;
+
+saveerr:
+    io->error = 1;
+}
+
+/* Load an unsigned 64 bit value from the RDB file. This function should only
+ * be called in the context of the `rdb_load` method of modules implementing
+ * new data types. */
+uint64_t RM_LoadUnsigned(RedisModuleIO *io) {
+    if (io->error) return 0;
+    if (io->ver == 2) {
+        uint64_t opcode = rdbLoadLen(io->rio,NULL);
+        if (opcode != RDB_MODULE_OPCODE_UINT) goto loaderr;
+    }
+    uint64_t value;
+    int retval = rdbLoadLenByRef(io->rio, NULL, &value);
+    if (retval == -1) goto loaderr;
+    return value;
+
+loaderr:
+    moduleRDBLoadError(io);
+    return 0;
+}
+
+/* Like RedisModule_SaveUnsigned() but for signed 64 bit values. */
+void RM_SaveSigned(RedisModuleIO *io, int64_t value) {
+    union {uint64_t u; int64_t i;} conv;
+    conv.i = value;
+    RM_SaveUnsigned(io,conv.u);
+}
+
+/* Like RedisModule_LoadUnsigned() but for signed 64 bit values. */
+int64_t RM_LoadSigned(RedisModuleIO *io) {
+    union {uint64_t u; int64_t i;} conv;
+    conv.u = RM_LoadUnsigned(io);
+    return conv.i;
+}
+
+/* In the context of the rdb_save method of a module type, saves a
+ * string into the RDB file taking as input a RedisModuleString.
+ *
+ * The string can be later loaded with RedisModule_LoadString() or
+ * other Load family functions expecting a serialized string inside
+ * the RDB file. */
+void RM_SaveString(RedisModuleIO *io, RedisModuleString *s) {
+    if (io->error) return;
+    /* Save opcode. */
+    ssize_t retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_STRING);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    /* Save value. */
+    retval = rdbSaveStringObject(io->rio, s);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    return;
+
+saveerr:
+    io->error = 1;
+}
+
+/* Like RedisModule_SaveString() but takes a raw C pointer and length
+ * as input. */
+void RM_SaveStringBuffer(RedisModuleIO *io, const char *str, size_t len) {
+    if (io->error) return;
+    /* Save opcode. */
+    ssize_t retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_STRING);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    /* Save value. */
+    retval = rdbSaveRawString(io->rio, (unsigned char*)str,len);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    return;
+
+saveerr:
+    io->error = 1;
+}
+
+/* Implements RM_LoadString() and RM_LoadStringBuffer() */
+void *moduleLoadString(RedisModuleIO *io, int plain, size_t *lenptr) {
+    if (io->error) return NULL;
+    if (io->ver == 2) {
+        uint64_t opcode = rdbLoadLen(io->rio,NULL);
+        if (opcode != RDB_MODULE_OPCODE_STRING) goto loaderr;
+    }
+    void *s = rdbGenericLoadStringObject(io->rio,
+              plain ? RDB_LOAD_PLAIN : RDB_LOAD_NONE, lenptr);
+    if (s == NULL) goto loaderr;
+    return s;
+
+loaderr:
+    moduleRDBLoadError(io);
+    return NULL;
+}
+
+/* In the context of the rdb_load method of a module data type, loads a string
+ * from the RDB file, that was previously saved with RedisModule_SaveString()
+ * functions family.
+ *
+ * The returned string is a newly allocated RedisModuleString object, and
+ * the user should at some point free it with a call to RedisModule_FreeString().
+ *
+ * If the data structure does not store strings as RedisModuleString objects,
+ * the similar function RedisModule_LoadStringBuffer() could be used instead. */
+RedisModuleString *RM_LoadString(RedisModuleIO *io) {
+    return moduleLoadString(io,0,NULL);
+}
+
+/* Like RedisModule_LoadString() but returns an heap allocated string that
+ * was allocated with RedisModule_Alloc(), and can be resized or freed with
+ * RedisModule_Realloc() or RedisModule_Free().
+ *
+ * The size of the string is stored at '*lenptr' if not NULL.
+ * The returned string is not automatically NULL terminated, it is loaded
+ * exactly as it was stored inside the RDB file. */
+char *RM_LoadStringBuffer(RedisModuleIO *io, size_t *lenptr) {
+    return moduleLoadString(io,1,lenptr);
+}
+
+/* In the context of the rdb_save method of a module data type, saves a double
+ * value to the RDB file. The double can be a valid number, a NaN or infinity.
+ * It is possible to load back the value with RedisModule_LoadDouble(). */
+void RM_SaveDouble(RedisModuleIO *io, double value) {
+    if (io->error) return;
+    /* Save opcode. */
+    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_DOUBLE);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    /* Save value. */
+    retval = rdbSaveBinaryDoubleValue(io->rio, value);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    return;
+
+saveerr:
+    io->error = 1;
+}
+
+/* In the context of the rdb_save method of a module data type, loads back the
+ * double value saved by RedisModule_SaveDouble(). */
+double RM_LoadDouble(RedisModuleIO *io) {
+    if (io->error) return 0;
+    if (io->ver == 2) {
+        uint64_t opcode = rdbLoadLen(io->rio,NULL);
+        if (opcode != RDB_MODULE_OPCODE_DOUBLE) goto loaderr;
+    }
+    double value;
+    int retval = rdbLoadBinaryDoubleValue(io->rio, &value);
+    if (retval == -1) goto loaderr;
+    return value;
+
+loaderr:
+    moduleRDBLoadError(io);
+    return 0;
+}
+
+/* In the context of the rdb_save method of a module data type, saves a float
+ * value to the RDB file. The float can be a valid number, a NaN or infinity.
+ * It is possible to load back the value with RedisModule_LoadFloat(). */
+void RM_SaveFloat(RedisModuleIO *io, float value) {
+    if (io->error) return;
+    /* Save opcode. */
+    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_FLOAT);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    /* Save value. */
+    retval = rdbSaveBinaryFloatValue(io->rio, value);
+    if (retval == -1) goto saveerr;
+    io->bytes += retval;
+    return;
+
+saveerr:
+    io->error = 1;
+}
+
+/* In the context of the rdb_save method of a module data type, loads back the
+ * float value saved by RedisModule_SaveFloat(). */
+float RM_LoadFloat(RedisModuleIO *io) {
+    if (io->error) return 0;
+    if (io->ver == 2) {
+        uint64_t opcode = rdbLoadLen(io->rio,NULL);
+        if (opcode != RDB_MODULE_OPCODE_FLOAT) goto loaderr;
+    }
+    float value;
+    int retval = rdbLoadBinaryFloatValue(io->rio, &value);
+    if (retval == -1) goto loaderr;
+    return value;
+
+loaderr:
+    moduleRDBLoadError(io);
+    return 0;
+}
+
+/* In the context of the rdb_save method of a module data type, saves a long double
+ * value to the RDB file. The double can be a valid number, a NaN or infinity.
+ * It is possible to load back the value with RedisModule_LoadLongDouble(). */
+void RM_SaveLongDouble(RedisModuleIO *io, long double value) {
+    if (io->error) return;
+    char buf[MAX_LONG_DOUBLE_CHARS];
+    /* Long double has different number of bits in different platforms, so we
+     * save it as a string type. */
+    size_t len = ld2string(buf,sizeof(buf),value,LD_STR_HEX);
+    RM_SaveStringBuffer(io,buf,len);
+}
+
+/* In the context of the rdb_save method of a module data type, loads back the
+ * long double value saved by RedisModule_SaveLongDouble(). */
+long double RM_LoadLongDouble(RedisModuleIO *io) {
+    if (io->error) return 0;
+    long double value;
+    size_t len;
+    char* str = RM_LoadStringBuffer(io,&len);
+    if (!str) return 0;
+    string2ld(str,len,&value);
+    RM_Free(str);
+    return value;
+}
+
+/* Iterate over modules, and trigger rdb aux saving for the ones modules types
+ * who asked for it. */
+ssize_t rdbSaveModulesAux(rio *rdb, int when) {
+    size_t total_written = 0;
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        listIter li;
+        listNode *ln;
+
+        listRewind(module->types,&li);
+        while((ln = listNext(&li))) {
+            moduleType *mt = ln->value;
+            if (!mt->aux_save || !(mt->aux_save_triggers & when))
+                continue;
+            ssize_t ret = rdbSaveSingleModuleAux(rdb, when, mt);
+            if (ret==-1) {
+                dictReleaseIterator(di);
+                return -1;
+            }
+            total_written += ret;
+        }
+    }
+
+    dictReleaseIterator(di);
+    return total_written;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key digest API (DEBUG DIGEST interface for modules types)
+ * -------------------------------------------------------------------------- */
+
+/* Add a new element to the digest. This function can be called multiple times
+ * one element after the other, for all the elements that constitute a given
+ * data structure. The function call must be followed by the call to
+ * `RedisModule_DigestEndSequence` eventually, when all the elements that are
+ * always in a given order are added. See the Redis Modules data types
+ * documentation for more info. However this is a quick example that uses Redis
+ * data types as an example.
+ *
+ * To add a sequence of unordered elements (for example in the case of a Redis
+ * Set), the pattern to use is:
+ *
+ *     foreach element {
+ *         AddElement(element);
+ *         EndSequence();
+ *     }
+ *
+ * Because Sets are not ordered, so every element added has a position that
+ * does not depend from the other. However if instead our elements are
+ * ordered in pairs, like field-value pairs of an Hash, then one should
+ * use:
+ *
+ *     foreach key,value {
+ *         AddElement(key);
+ *         AddElement(value);
+ *         EndSquence();
+ *     }
+ *
+ * Because the key and value will be always in the above order, while instead
+ * the single key-value pairs, can appear in any position into a Redis hash.
+ *
+ * A list of ordered elements would be implemented with:
+ *
+ *     foreach element {
+ *         AddElement(element);
+ *     }
+ *     EndSequence();
+ *
+ */
+void RM_DigestAddStringBuffer(RedisModuleDigest *md, unsigned char *ele, size_t len) {
+    mixDigest(md->o,ele,len);
+}
+
+/* Like `RedisModule_DigestAddStringBuffer()` but takes a long long as input
+ * that gets converted into a string before adding it to the digest. */
+void RM_DigestAddLongLong(RedisModuleDigest *md, long long ll) {
+    char buf[LONG_STR_SIZE];
+    size_t len = ll2string(buf,sizeof(buf),ll);
+    mixDigest(md->o,buf,len);
+}
+
+/* See the documentation for `RedisModule_DigestAddElement()`. */
+void RM_DigestEndSequence(RedisModuleDigest *md) {
+    xorDigest(md->x,md->o,sizeof(md->o));
+    memset(md->o,0,sizeof(md->o));
+}
+
+/* Decode a serialized representation of a module data type 'mt' from string
+ * 'str' and return a newly allocated value, or NULL if decoding failed.
+ *
+ * This call basically reuses the 'rdb_load' callback which module data types
+ * implement in order to allow a module to arbitrarily serialize/de-serialize
+ * keys, similar to how the Redis 'DUMP' and 'RESTORE' commands are implemented.
+ *
+ * Modules should generally use the REDISMODULE_OPTIONS_HANDLE_IO_ERRORS flag and
+ * make sure the de-serialization code properly checks and handles IO errors
+ * (freeing allocated buffers and returning a NULL).
+ *
+ * If this is NOT done, Redis will handle corrupted (or just truncated) serialized
+ * data by producing an error message and terminating the process.
+ */
+void *RM_LoadDataTypeFromString(const RedisModuleString *str, const moduleType *mt) {
+    rio payload;
+    RedisModuleIO io;
+    void *ret;
+
+    rioInitWithBuffer(&payload, str->ptr);
+    moduleInitIOContext(io,(moduleType *)mt,&payload,NULL);
+
+    /* All RM_Save*() calls always write a version 2 compatible format, so we
+     * need to make sure we read the same.
+     */
+    io.ver = 2;
+    ret = mt->rdb_load(&io,0);
+    if (io.ctx) {
+        moduleFreeContext(io.ctx);
+        zfree(io.ctx);
+    }
+    return ret;
+}
+
+/* Encode a module data type 'mt' value 'data' into serialized form, and return it
+ * as a newly allocated RedisModuleString.
+ *
+ * This call basically reuses the 'rdb_save' callback which module data types
+ * implement in order to allow a module to arbitrarily serialize/de-serialize
+ * keys, similar to how the Redis 'DUMP' and 'RESTORE' commands are implemented.
+ */
+RedisModuleString *RM_SaveDataTypeToString(RedisModuleCtx *ctx, void *data, const moduleType *mt) {
+    rio payload;
+    RedisModuleIO io;
+
+    rioInitWithBuffer(&payload,sdsempty());
+    moduleInitIOContext(io,(moduleType *)mt,&payload,NULL);
+    mt->rdb_save(&io,data);
+    if (io.ctx) {
+        moduleFreeContext(io.ctx);
+        zfree(io.ctx);
+    }
+    if (io.error) {
+        return NULL;
+    } else {
+        robj *str = createObject(OBJ_STRING,payload.io.buffer.ptr);
+        if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,str);
+        return str;
+    }
+}
+
+/* --------------------------------------------------------------------------
+ * ## AOF API for modules data types
+ * -------------------------------------------------------------------------- */
+
+/* Emits a command into the AOF during the AOF rewriting process. This function
+ * is only called in the context of the aof_rewrite method of data types exported
+ * by a module. The command works exactly like RedisModule_Call() in the way
+ * the parameters are passed, but it does not return anything as the error
+ * handling is performed by Redis itself. */
+void RM_EmitAOF(RedisModuleIO *io, const char *cmdname, const char *fmt, ...) {
+    if (io->error) return;
+    struct redisCommand *cmd;
+    robj **argv = NULL;
+    int argc = 0, flags = 0, j;
+    va_list ap;
+
+    cmd = lookupCommandByCString((char*)cmdname);
+    if (!cmd) {
+        serverLog(LL_WARNING,
+            "Fatal: AOF method for module data type '%s' tried to "
+            "emit unknown command '%s'",
+            io->type->name, cmdname);
+        io->error = 1;
+        errno = EINVAL;
+        return;
+    }
+
+    /* Emit the arguments into the AOF in Redis protocol format. */
+    va_start(ap, fmt);
+    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
+    va_end(ap);
+    if (argv == NULL) {
+        serverLog(LL_WARNING,
+            "Fatal: AOF method for module data type '%s' tried to "
+            "call RedisModule_EmitAOF() with wrong format specifiers '%s'",
+            io->type->name, fmt);
+        io->error = 1;
+        errno = EINVAL;
+        return;
+    }
+
+    /* Bulk count. */
+    if (!io->error && rioWriteBulkCount(io->rio,'*',argc) == 0)
+        io->error = 1;
+
+    /* Arguments. */
+    for (j = 0; j < argc; j++) {
+        if (!io->error && rioWriteBulkObject(io->rio,argv[j]) == 0)
+            io->error = 1;
+        decrRefCount(argv[j]);
+    }
+    zfree(argv);
+    return;
+}
+
+/* --------------------------------------------------------------------------
+ * ## IO context handling
+ * -------------------------------------------------------------------------- */
+
+RedisModuleCtx *RM_GetContextFromIO(RedisModuleIO *io) {
+    if (io->ctx) return io->ctx; /* Can't have more than one... */
+    RedisModuleCtx ctxtemplate = REDISMODULE_CTX_INIT;
+    io->ctx = zmalloc(sizeof(RedisModuleCtx));
+    *(io->ctx) = ctxtemplate;
+    io->ctx->module = io->type->module;
+    io->ctx->client = NULL;
+    return io->ctx;
+}
+
+/* Returns a RedisModuleString with the name of the key currently saving or
+ * loading, when an IO data type callback is called.  There is no guarantee
+ * that the key name is always available, so this may return NULL.
+ */
+const RedisModuleString *RM_GetKeyNameFromIO(RedisModuleIO *io) {
+    return io->key;
+}
+
+/* Returns a RedisModuleString with the name of the key from RedisModuleKey. */
+const RedisModuleString *RM_GetKeyNameFromModuleKey(RedisModuleKey *key) {
+    return key ? key->key : NULL;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Logging
+ * -------------------------------------------------------------------------- */
+
+/* This is the low level function implementing both:
+ *
+ *      RM_Log()
+ *      RM_LogIOError()
+ *
+ */
+void moduleLogRaw(RedisModule *module, const char *levelstr, const char *fmt, va_list ap) {
+    char msg[LOG_MAX_LEN];
+    size_t name_len;
+    int level;
+
+    if (!strcasecmp(levelstr,"debug")) level = LL_DEBUG;
+    else if (!strcasecmp(levelstr,"verbose")) level = LL_VERBOSE;
+    else if (!strcasecmp(levelstr,"notice")) level = LL_NOTICE;
+    else if (!strcasecmp(levelstr,"warning")) level = LL_WARNING;
+    else level = LL_VERBOSE; /* Default. */
+
+    if (level < server.verbosity) return;
+
+    name_len = snprintf(msg, sizeof(msg),"<%s> ", module? module->name: "module");
+    vsnprintf(msg + name_len, sizeof(msg) - name_len, fmt, ap);
+    serverLogRaw(level,msg);
+}
+
+/* Produces a log message to the standard Redis log, the format accepts
+ * printf-alike specifiers, while level is a string describing the log
+ * level to use when emitting the log, and must be one of the following:
+ *
+ * * "debug" (`REDISMODULE_LOGLEVEL_DEBUG`)
+ * * "verbose" (`REDISMODULE_LOGLEVEL_VERBOSE`)
+ * * "notice" (`REDISMODULE_LOGLEVEL_NOTICE`)
+ * * "warning" (`REDISMODULE_LOGLEVEL_WARNING`)
+ *
+ * If the specified log level is invalid, verbose is used by default.
+ * There is a fixed limit to the length of the log line this function is able
+ * to emit, this limit is not specified but is guaranteed to be more than
+ * a few lines of text.
+ *
+ * The ctx argument may be NULL if cannot be provided in the context of the
+ * caller for instance threads or callbacks, in which case a generic "module"
+ * will be used instead of the module name.
+ */
+void RM_Log(RedisModuleCtx *ctx, const char *levelstr, const char *fmt, ...) {
+    va_list ap;
+    va_start(ap, fmt);
+    moduleLogRaw(ctx? ctx->module: NULL,levelstr,fmt,ap);
+    va_end(ap);
+}
+
+/* Log errors from RDB / AOF serialization callbacks.
+ *
+ * This function should be used when a callback is returning a critical
+ * error to the caller since cannot load or save the data for some
+ * critical reason. */
+void RM_LogIOError(RedisModuleIO *io, const char *levelstr, const char *fmt, ...) {
+    va_list ap;
+    va_start(ap, fmt);
+    moduleLogRaw(io->type->module,levelstr,fmt,ap);
+    va_end(ap);
+}
+
+/* Redis-like assert function.
+ *
+ * The macro `RedisModule_Assert(expression)` is recommended, rather than
+ * calling this function directly.
+ *
+ * A failed assertion will shut down the server and produce logging information
+ * that looks identical to information generated by Redis itself.
+ */
+void RM__Assert(const char *estr, const char *file, int line) {
+    _serverAssert(estr, file, line);
+}
+
+/* Allows adding event to the latency monitor to be observed by the LATENCY
+ * command. The call is skipped if the latency is smaller than the configured
+ * latency-monitor-threshold. */
+void RM_LatencyAddSample(const char *event, mstime_t latency) {
+    if (latency >= server.latency_monitor_threshold)
+        latencyAddSample(event, latency);
+}
+
+/* --------------------------------------------------------------------------
+ * ## Blocking clients from modules
+ *
+ * For a guide about blocking commands in modules, see
+ * https://redis.io/topics/modules-blocking-ops.
+ * -------------------------------------------------------------------------- */
+
+/* Readable handler for the awake pipe. We do nothing here, the awake bytes
+ * will be actually read in a more appropriate place in the
+ * moduleHandleBlockedClients() function that is where clients are actually
+ * served. */
+void moduleBlockedClientPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask) {
+    UNUSED(el);
+    UNUSED(fd);
+    UNUSED(mask);
+    UNUSED(privdata);
+}
+
+/* This is called from blocked.c in order to unblock a client: may be called
+ * for multiple reasons while the client is in the middle of being blocked
+ * because the client is terminated, but is also called for cleanup when a
+ * client is unblocked in a clean way after replaying.
+ *
+ * What we do here is just to set the client to NULL in the redis module
+ * blocked client handle. This way if the client is terminated while there
+ * is a pending threaded operation involving the blocked client, we'll know
+ * that the client no longer exists and no reply callback should be called.
+ *
+ * The structure RedisModuleBlockedClient will be always deallocated when
+ * running the list of clients blocked by a module that need to be unblocked. */
+void unblockClientFromModule(client *c) {
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+
+    /* Call the disconnection callback if any. Note that
+     * bc->disconnect_callback is set to NULL if the client gets disconnected
+     * by the module itself or because of a timeout, so the callback will NOT
+     * get called if this is not an actual disconnection event. */
+    if (bc->disconnect_callback) {
+        RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+        ctx.blocked_privdata = bc->privdata;
+        ctx.module = bc->module;
+        ctx.client = bc->client;
+        bc->disconnect_callback(&ctx,bc);
+        moduleFreeContext(&ctx);
+    }
+
+    /* If we made it here and client is still blocked it means that the command
+     * timed-out, client was killed or disconnected and disconnect_callback was
+     * not implemented (or it was, but RM_UnblockClient was not called from
+     * within it, as it should).
+     * We must call moduleUnblockClient in order to free privdata and
+     * RedisModuleBlockedClient.
+     *
+     * Note that we only do that for clients that are blocked on keys, for which
+     * the contract is that the module should not call RM_UnblockClient under
+     * normal circumstances.
+     * Clients implementing threads and working with private data should be
+     * aware that calling RM_UnblockClient for every blocked client is their
+     * responsibility, and if they fail to do so memory may leak. Ideally they
+     * should implement the disconnect and timeout callbacks and call
+     * RM_UnblockClient, but any other way is also acceptable. */
+    if (bc->blocked_on_keys && !bc->unblocked)
+        moduleUnblockClient(c);
+
+    bc->client = NULL;
+}
+
+/* Block a client in the context of a module: this function implements both
+ * RM_BlockClient() and RM_BlockClientOnKeys() depending on the fact the
+ * keys are passed or not.
+ *
+ * When not blocking for keys, the keys, numkeys, and privdata parameters are
+ * not needed. The privdata in that case must be NULL, since later is
+ * RM_UnblockClient() that will provide some private data that the reply
+ * callback will receive.
+ *
+ * Instead when blocking for keys, normally RM_UnblockClient() will not be
+ * called (because the client will unblock when the key is modified), so
+ * 'privdata' should be provided in that case, so that once the client is
+ * unlocked and the reply callback is called, it will receive its associated
+ * private data.
+ *
+ * Even when blocking on keys, RM_UnblockClient() can be called however, but
+ * in that case the privdata argument is disregarded, because we pass the
+ * reply callback the privdata that is set here while blocking.
+ *
+ */
+RedisModuleBlockedClient *moduleBlockClient(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) {
+    client *c = ctx->client;
+    int islua = server.in_eval;
+    int ismulti = server.in_exec;
+
+    c->bpop.module_blocked_handle = zmalloc(sizeof(RedisModuleBlockedClient));
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+    ctx->module->blocked_clients++;
+
+    /* We need to handle the invalid operation of calling modules blocking
+     * commands from Lua or MULTI. We actually create an already aborted
+     * (client set to NULL) blocked client handle, and actually reply with
+     * an error. */
+    mstime_t timeout = timeout_ms ? (mstime()+timeout_ms) : 0;
+    bc->client = (islua || ismulti) ? NULL : c;
+    bc->module = ctx->module;
+    bc->reply_callback = reply_callback;
+    bc->timeout_callback = timeout_callback;
+    bc->disconnect_callback = NULL; /* Set by RM_SetDisconnectCallback() */
+    bc->free_privdata = free_privdata;
+    bc->privdata = privdata;
+    bc->reply_client = createClient(NULL);
+    bc->reply_client->flags |= CLIENT_MODULE;
+    bc->dbid = c->db->id;
+    bc->blocked_on_keys = keys != NULL;
+    bc->unblocked = 0;
+    bc->background_timer = 0;
+    bc->background_duration = 0;
+    c->bpop.timeout = timeout;
+
+    if (islua || ismulti) {
+        c->bpop.module_blocked_handle = NULL;
+        addReplyError(c, islua ?
+            "Blocking module command called from Lua script" :
+            "Blocking module command called from transaction");
+    } else {
+        if (keys) {
+            blockForKeys(c,BLOCKED_MODULE,keys,numkeys,timeout,NULL,NULL,NULL);
+        } else {
+            blockClient(c,BLOCKED_MODULE);
+        }
+    }
+    return bc;
+}
+
+/* This function is called from module.c in order to check if a module
+ * blocked for BLOCKED_MODULE and subtype 'on keys' (bc->blocked_on_keys true)
+ * can really be unblocked, since the module was able to serve the client.
+ * If the callback returns REDISMODULE_OK, then the client can be unblocked,
+ * otherwise the client remains blocked and we'll retry again when one of
+ * the keys it blocked for becomes "ready" again.
+ * This function returns 1 if client was served (and should be unblocked) */
+int moduleTryServeClientBlockedOnKey(client *c, robj *key) {
+    int served = 0;
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+
+    /* Protect against re-processing: don't serve clients that are already
+     * in the unblocking list for any reason (including RM_UnblockClient()
+     * explicit call). See #6798. */
+    if (bc->unblocked) return 0;
+
+    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+    ctx.flags |= REDISMODULE_CTX_BLOCKED_REPLY;
+    ctx.blocked_ready_key = key;
+    ctx.blocked_privdata = bc->privdata;
+    ctx.module = bc->module;
+    ctx.client = bc->client;
+    ctx.blocked_client = bc;
+    if (bc->reply_callback(&ctx,(void**)c->argv,c->argc) == REDISMODULE_OK)
+        served = 1;
+    moduleFreeContext(&ctx);
+    return served;
+}
+
+/* Block a client in the context of a blocking command, returning an handle
+ * which will be used, later, in order to unblock the client with a call to
+ * RedisModule_UnblockClient(). The arguments specify callback functions
+ * and a timeout after which the client is unblocked.
+ *
+ * The callbacks are called in the following contexts:
+ *
+ *     reply_callback:   called after a successful RedisModule_UnblockClient()
+ *                       call in order to reply to the client and unblock it.
+ *
+ *     timeout_callback: called when the timeout is reached or if `CLIENT UNBLOCK`
+ *                       is invoked, in order to send an error to the client.
+ *
+ *     free_privdata:    called in order to free the private data that is passed
+ *                       by RedisModule_UnblockClient() call.
+ *
+ * Note: RedisModule_UnblockClient should be called for every blocked client,
+ *       even if client was killed, timed-out or disconnected. Failing to do so
+ *       will result in memory leaks.
+ *
+ * There are some cases where RedisModule_BlockClient() cannot be used:
+ *
+ * 1. If the client is a Lua script.
+ * 2. If the client is executing a MULTI block.
+ *
+ * In these cases, a call to RedisModule_BlockClient() will **not** block the
+ * client, but instead produce a specific error reply.
+ *
+ * A module that registers a timeout_callback function can also be unblocked
+ * using the `CLIENT UNBLOCK` command, which will trigger the timeout callback.
+ * If a callback function is not registered, then the blocked client will be
+ * treated as if it is not in a blocked state and `CLIENT UNBLOCK` will return
+ * a zero value.
+ *
+ * Measuring background time: By default the time spent in the blocked command
+ * is not account for the total command duration. To include such time you should
+ * use RM_BlockedClientMeasureTimeStart() and RM_BlockedClientMeasureTimeEnd() one,
+ * or multiple times within the blocking command background work.
+ */
+RedisModuleBlockedClient *RM_BlockClient(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms) {
+    return moduleBlockClient(ctx,reply_callback,timeout_callback,free_privdata,timeout_ms, NULL,0,NULL);
+}
+
+/* This call is similar to RedisModule_BlockClient(), however in this case we
+ * don't just block the client, but also ask Redis to unblock it automatically
+ * once certain keys become "ready", that is, contain more data.
+ *
+ * Basically this is similar to what a typical Redis command usually does,
+ * like BLPOP or BZPOPMAX: the client blocks if it cannot be served ASAP,
+ * and later when the key receives new data (a list push for instance), the
+ * client is unblocked and served.
+ *
+ * However in the case of this module API, when the client is unblocked?
+ *
+ * 1. If you block on a key of a type that has blocking operations associated,
+ *    like a list, a sorted set, a stream, and so forth, the client may be
+ *    unblocked once the relevant key is targeted by an operation that normally
+ *    unblocks the native blocking operations for that type. So if we block
+ *    on a list key, an RPUSH command may unblock our client and so forth.
+ * 2. If you are implementing your native data type, or if you want to add new
+ *    unblocking conditions in addition to "1", you can call the modules API
+ *    RedisModule_SignalKeyAsReady().
+ *
+ * Anyway we can't be sure if the client should be unblocked just because the
+ * key is signaled as ready: for instance a successive operation may change the
+ * key, or a client in queue before this one can be served, modifying the key
+ * as well and making it empty again. So when a client is blocked with
+ * RedisModule_BlockClientOnKeys() the reply callback is not called after
+ * RM_UnblockClient() is called, but every time a key is signaled as ready:
+ * if the reply callback can serve the client, it returns REDISMODULE_OK
+ * and the client is unblocked, otherwise it will return REDISMODULE_ERR
+ * and we'll try again later.
+ *
+ * The reply callback can access the key that was signaled as ready by
+ * calling the API RedisModule_GetBlockedClientReadyKey(), that returns
+ * just the string name of the key as a RedisModuleString object.
+ *
+ * Thanks to this system we can setup complex blocking scenarios, like
+ * unblocking a client only if a list contains at least 5 items or other
+ * more fancy logics.
+ *
+ * Note that another difference with RedisModule_BlockClient(), is that here
+ * we pass the private data directly when blocking the client: it will
+ * be accessible later in the reply callback. Normally when blocking with
+ * RedisModule_BlockClient() the private data to reply to the client is
+ * passed when calling RedisModule_UnblockClient() but here the unblocking
+ * is performed by Redis itself, so we need to have some private data before
+ * hand. The private data is used to store any information about the specific
+ * unblocking operation that you are implementing. Such information will be
+ * freed using the free_privdata callback provided by the user.
+ *
+ * However the reply callback will be able to access the argument vector of
+ * the command, so the private data is often not needed.
+ *
+ * Note: Under normal circumstances RedisModule_UnblockClient should not be
+ *       called for clients that are blocked on keys (Either the key will
+ *       become ready or a timeout will occur). If for some reason you do want
+ *       to call RedisModule_UnblockClient it is possible: Client will be
+ *       handled as if it were timed-out (You must implement the timeout
+ *       callback in that case).
+ */
+RedisModuleBlockedClient *RM_BlockClientOnKeys(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) {
+    return moduleBlockClient(ctx,reply_callback,timeout_callback,free_privdata,timeout_ms, keys,numkeys,privdata);
+}
+
+/* This function is used in order to potentially unblock a client blocked
+ * on keys with RedisModule_BlockClientOnKeys(). When this function is called,
+ * all the clients blocked for this key will get their reply_callback called.
+ *
+ * Note: The function has no effect if the signaled key doesn't exist. */
+void RM_SignalKeyAsReady(RedisModuleCtx *ctx, RedisModuleString *key) {
+    signalKeyAsReady(ctx->client->db, key, OBJ_MODULE);
+}
+
+/* Implements RM_UnblockClient() and moduleUnblockClient(). */
+int moduleUnblockClientByHandle(RedisModuleBlockedClient *bc, void *privdata) {
+    pthread_mutex_lock(&moduleUnblockedClientsMutex);
+    if (!bc->blocked_on_keys) bc->privdata = privdata;
+    bc->unblocked = 1;
+    listAddNodeTail(moduleUnblockedClients,bc);
+    if (write(server.module_blocked_pipe[1],"A",1) != 1) {
+        /* Ignore the error, this is best-effort. */
+    }
+    pthread_mutex_unlock(&moduleUnblockedClientsMutex);
+    return REDISMODULE_OK;
+}
+
+/* This API is used by the Redis core to unblock a client that was blocked
+ * by a module. */
+void moduleUnblockClient(client *c) {
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+    moduleUnblockClientByHandle(bc,NULL);
+}
+
+/* Return true if the client 'c' was blocked by a module using
+ * RM_BlockClientOnKeys(). */
+int moduleClientIsBlockedOnKeys(client *c) {
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+    return bc->blocked_on_keys;
+}
+
+/* Unblock a client blocked by `RedisModule_BlockedClient`. This will trigger
+ * the reply callbacks to be called in order to reply to the client.
+ * The 'privdata' argument will be accessible by the reply callback, so
+ * the caller of this function can pass any value that is needed in order to
+ * actually reply to the client.
+ *
+ * A common usage for 'privdata' is a thread that computes something that
+ * needs to be passed to the client, included but not limited some slow
+ * to compute reply or some reply obtained via networking.
+ *
+ * Note 1: this function can be called from threads spawned by the module.
+ *
+ * Note 2: when we unblock a client that is blocked for keys using the API
+ * RedisModule_BlockClientOnKeys(), the privdata argument here is not used.
+ * Unblocking a client that was blocked for keys using this API will still
+ * require the client to get some reply, so the function will use the
+ * "timeout" handler in order to do so (The privdata provided in
+ * RedisModule_BlockClientOnKeys() is accessible from the timeout
+ * callback via RM_GetBlockedClientPrivateData). */
+int RM_UnblockClient(RedisModuleBlockedClient *bc, void *privdata) {
+    if (bc->blocked_on_keys) {
+        /* In theory the user should always pass the timeout handler as an
+         * argument, but better to be safe than sorry. */
+        if (bc->timeout_callback == NULL) return REDISMODULE_ERR;
+        if (bc->unblocked) return REDISMODULE_OK;
+        if (bc->client) moduleBlockedClientTimedOut(bc->client);
+    }
+    moduleUnblockClientByHandle(bc,privdata);
+    return REDISMODULE_OK;
+}
+
+/* Abort a blocked client blocking operation: the client will be unblocked
+ * without firing any callback. */
+int RM_AbortBlock(RedisModuleBlockedClient *bc) {
+    bc->reply_callback = NULL;
+    bc->disconnect_callback = NULL;
+    return RM_UnblockClient(bc,NULL);
+}
+
+/* Set a callback that will be called if a blocked client disconnects
+ * before the module has a chance to call RedisModule_UnblockClient()
+ *
+ * Usually what you want to do there, is to cleanup your module state
+ * so that you can call RedisModule_UnblockClient() safely, otherwise
+ * the client will remain blocked forever if the timeout is large.
+ *
+ * Notes:
+ *
+ * 1. It is not safe to call Reply* family functions here, it is also
+ *    useless since the client is gone.
+ *
+ * 2. This callback is not called if the client disconnects because of
+ *    a timeout. In such a case, the client is unblocked automatically
+ *    and the timeout callback is called.
+ */
+void RM_SetDisconnectCallback(RedisModuleBlockedClient *bc, RedisModuleDisconnectFunc callback) {
+    bc->disconnect_callback = callback;
+}
+
+/* This function will check the moduleUnblockedClients queue in order to
+ * call the reply callback and really unblock the client.
+ *
+ * Clients end into this list because of calls to RM_UnblockClient(),
+ * however it is possible that while the module was doing work for the
+ * blocked client, it was terminated by Redis (for timeout or other reasons).
+ * When this happens the RedisModuleBlockedClient structure in the queue
+ * will have the 'client' field set to NULL. */
+void moduleHandleBlockedClients(void) {
+    listNode *ln;
+    RedisModuleBlockedClient *bc;
+
+    pthread_mutex_lock(&moduleUnblockedClientsMutex);
+    /* Here we unblock all the pending clients blocked in modules operations
+     * so we can read every pending "awake byte" in the pipe. */
+    char buf[1];
+    while (read(server.module_blocked_pipe[0],buf,1) == 1);
+    while (listLength(moduleUnblockedClients)) {
+        ln = listFirst(moduleUnblockedClients);
+        bc = ln->value;
+        client *c = bc->client;
+        listDelNode(moduleUnblockedClients,ln);
+        pthread_mutex_unlock(&moduleUnblockedClientsMutex);
+
+        /* Release the lock during the loop, as long as we don't
+         * touch the shared list. */
+
+        /* Call the reply callback if the client is valid and we have
+         * any callback. However the callback is not called if the client
+         * was blocked on keys (RM_BlockClientOnKeys()), because we already
+         * called such callback in moduleTryServeClientBlockedOnKey() when
+         * the key was signaled as ready. */
+        uint64_t reply_us = 0;
+        if (c && !bc->blocked_on_keys && bc->reply_callback) {
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+            ctx.flags |= REDISMODULE_CTX_BLOCKED_REPLY;
+            ctx.blocked_privdata = bc->privdata;
+            ctx.blocked_ready_key = NULL;
+            ctx.module = bc->module;
+            ctx.client = bc->client;
+            ctx.blocked_client = bc;
+            monotime replyTimer;
+            elapsedStart(&replyTimer);
+            bc->reply_callback(&ctx,(void**)c->argv,c->argc);
+            reply_us = elapsedUs(replyTimer);
+            moduleFreeContext(&ctx);
+        }
+        /* Update stats now that we've finished the blocking operation.
+         * This needs to be out of the reply callback above given that a
+         * module might not define any callback and still do blocking ops.
+         */
+        if (c && !bc->blocked_on_keys) {
+            updateStatsOnUnblock(c, bc->background_duration, reply_us);
+        }
+
+        /* Free privdata if any. */
+        if (bc->privdata && bc->free_privdata) {
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+            if (c == NULL)
+                ctx.flags |= REDISMODULE_CTX_BLOCKED_DISCONNECTED;
+            ctx.blocked_privdata = bc->privdata;
+            ctx.module = bc->module;
+            ctx.client = bc->client;
+            bc->free_privdata(&ctx,bc->privdata);
+            moduleFreeContext(&ctx);
+        }
+
+        /* It is possible that this blocked client object accumulated
+         * replies to send to the client in a thread safe context.
+         * We need to glue such replies to the client output buffer and
+         * free the temporary client we just used for the replies. */
+        if (c) AddReplyFromClient(c, bc->reply_client);
+        freeClient(bc->reply_client);
+
+        if (c != NULL) {
+            /* Before unblocking the client, set the disconnect callback
+             * to NULL, because if we reached this point, the client was
+             * properly unblocked by the module. */
+            bc->disconnect_callback = NULL;
+            unblockClient(c);
+            /* Put the client in the list of clients that need to write
+             * if there are pending replies here. This is needed since
+             * during a non blocking command the client may receive output. */
+            if (clientHasPendingReplies(c) &&
+                !(c->flags & CLIENT_PENDING_WRITE))
+            {
+                c->flags |= CLIENT_PENDING_WRITE;
+                listAddNodeHead(server.clients_pending_write,c);
+            }
+        }
+
+        /* Free 'bc' only after unblocking the client, since it is
+         * referenced in the client blocking context, and must be valid
+         * when calling unblockClient(). */
+        bc->module->blocked_clients--;
+        zfree(bc);
+
+        /* Lock again before to iterate the loop. */
+        pthread_mutex_lock(&moduleUnblockedClientsMutex);
+    }
+    pthread_mutex_unlock(&moduleUnblockedClientsMutex);
+}
+
+/* Check if the specified client can be safely timed out using
+ * moduleBlockedClientTimedOut().
+ */
+int moduleBlockedClientMayTimeout(client *c) {
+    if (c->btype != BLOCKED_MODULE)
+        return 1;
+
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+    return (bc && bc->timeout_callback != NULL);
+}
+
+/* Called when our client timed out. After this function unblockClient()
+ * is called, and it will invalidate the blocked client. So this function
+ * does not need to do any cleanup. Eventually the module will call the
+ * API to unblock the client and the memory will be released. */
+void moduleBlockedClientTimedOut(client *c) {
+    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
+
+    /* Protect against re-processing: don't serve clients that are already
+     * in the unblocking list for any reason (including RM_UnblockClient()
+     * explicit call). See #6798. */
+    if (bc->unblocked) return;
+
+    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+    ctx.flags |= REDISMODULE_CTX_BLOCKED_TIMEOUT;
+    ctx.module = bc->module;
+    ctx.client = bc->client;
+    ctx.blocked_client = bc;
+    ctx.blocked_privdata = bc->privdata;
+    bc->timeout_callback(&ctx,(void**)c->argv,c->argc);
+    moduleFreeContext(&ctx);
+    if (!bc->blocked_on_keys) {
+        updateStatsOnUnblock(c, bc->background_duration, 0);
+    }
+    /* For timeout events, we do not want to call the disconnect callback,
+     * because the blocked client will be automatically disconnected in
+     * this case, and the user can still hook using the timeout callback. */
+    bc->disconnect_callback = NULL;
+}
+
+/* Return non-zero if a module command was called in order to fill the
+ * reply for a blocked client. */
+int RM_IsBlockedReplyRequest(RedisModuleCtx *ctx) {
+    return (ctx->flags & REDISMODULE_CTX_BLOCKED_REPLY) != 0;
+}
+
+/* Return non-zero if a module command was called in order to fill the
+ * reply for a blocked client that timed out. */
+int RM_IsBlockedTimeoutRequest(RedisModuleCtx *ctx) {
+    return (ctx->flags & REDISMODULE_CTX_BLOCKED_TIMEOUT) != 0;
+}
+
+/* Get the private data set by RedisModule_UnblockClient() */
+void *RM_GetBlockedClientPrivateData(RedisModuleCtx *ctx) {
+    return ctx->blocked_privdata;
+}
+
+/* Get the key that is ready when the reply callback is called in the context
+ * of a client blocked by RedisModule_BlockClientOnKeys(). */
+RedisModuleString *RM_GetBlockedClientReadyKey(RedisModuleCtx *ctx) {
+    return ctx->blocked_ready_key;
+}
+
+/* Get the blocked client associated with a given context.
+ * This is useful in the reply and timeout callbacks of blocked clients,
+ * before sometimes the module has the blocked client handle references
+ * around, and wants to cleanup it. */
+RedisModuleBlockedClient *RM_GetBlockedClientHandle(RedisModuleCtx *ctx) {
+    return ctx->blocked_client;
+}
+
+/* Return true if when the free callback of a blocked client is called,
+ * the reason for the client to be unblocked is that it disconnected
+ * while it was blocked. */
+int RM_BlockedClientDisconnected(RedisModuleCtx *ctx) {
+    return (ctx->flags & REDISMODULE_CTX_BLOCKED_DISCONNECTED) != 0;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Thread Safe Contexts
+ * -------------------------------------------------------------------------- */
+
+/* Return a context which can be used inside threads to make Redis context
+ * calls with certain modules APIs. If 'bc' is not NULL then the module will
+ * be bound to a blocked client, and it will be possible to use the
+ * `RedisModule_Reply*` family of functions to accumulate a reply for when the
+ * client will be unblocked. Otherwise the thread safe context will be
+ * detached by a specific client.
+ *
+ * To call non-reply APIs, the thread safe context must be prepared with:
+ *
+ *     RedisModule_ThreadSafeContextLock(ctx);
+ *     ... make your call here ...
+ *     RedisModule_ThreadSafeContextUnlock(ctx);
+ *
+ * This is not needed when using `RedisModule_Reply*` functions, assuming
+ * that a blocked client was used when the context was created, otherwise
+ * no RedisModule_Reply* call should be made at all.
+ *
+ * NOTE: If you're creating a detached thread safe context (bc is NULL),
+ * consider using `RM_GetDetachedThreadSafeContext` which will also retain
+ * the module ID and thus be more useful for logging. */
+RedisModuleCtx *RM_GetThreadSafeContext(RedisModuleBlockedClient *bc) {
+    RedisModuleCtx *ctx = zmalloc(sizeof(*ctx));
+    RedisModuleCtx empty = REDISMODULE_CTX_INIT;
+    memcpy(ctx,&empty,sizeof(empty));
+    if (bc) {
+        ctx->blocked_client = bc;
+        ctx->module = bc->module;
+    }
+    ctx->flags |= REDISMODULE_CTX_THREAD_SAFE;
+    /* Even when the context is associated with a blocked client, we can't
+     * access it safely from another thread, so we create a fake client here
+     * in order to keep things like the currently selected database and similar
+     * things. */
+    ctx->client = createClient(NULL);
+    if (bc) {
+        selectDb(ctx->client,bc->dbid);
+        if (bc->client) ctx->client->id = bc->client->id;
+    }
+    return ctx;
+}
+
+/* Return a detached thread safe context that is not associated with any
+ * specific blocked client, but is associated with the module's context.
+ *
+ * This is useful for modules that wish to hold a global context over
+ * a long term, for purposes such as logging. */
+RedisModuleCtx *RM_GetDetachedThreadSafeContext(RedisModuleCtx *ctx) {
+    RedisModuleCtx *new_ctx = zmalloc(sizeof(*new_ctx));
+    RedisModuleCtx empty = REDISMODULE_CTX_INIT;
+    memcpy(new_ctx,&empty,sizeof(empty));
+    new_ctx->module = ctx->module;
+    new_ctx->flags |= REDISMODULE_CTX_THREAD_SAFE;
+    new_ctx->client = createClient(NULL);
+    return new_ctx;
+}
+
+/* Release a thread safe context. */
+void RM_FreeThreadSafeContext(RedisModuleCtx *ctx) {
+    moduleFreeContext(ctx);
+    zfree(ctx);
+}
+
+/* Acquire the server lock before executing a thread safe API call.
+ * This is not needed for `RedisModule_Reply*` calls when there is
+ * a blocked client connected to the thread safe context. */
+void RM_ThreadSafeContextLock(RedisModuleCtx *ctx) {
+    UNUSED(ctx);
+    moduleAcquireGIL();
+}
+
+/* Similar to RM_ThreadSafeContextLock but this function
+ * would not block if the server lock is already acquired.
+ *
+ * If successful (lock acquired) REDISMODULE_OK is returned,
+ * otherwise REDISMODULE_ERR is returned and errno is set
+ * accordingly. */
+int RM_ThreadSafeContextTryLock(RedisModuleCtx *ctx) {
+    UNUSED(ctx);
+
+    int res = moduleTryAcquireGIL();
+    if(res != 0) {
+        errno = res;
+        return REDISMODULE_ERR;
+    }
+    return REDISMODULE_OK;
+}
+
+/* Release the server lock after a thread safe API call was executed. */
+void RM_ThreadSafeContextUnlock(RedisModuleCtx *ctx) {
+    UNUSED(ctx);
+    moduleReleaseGIL();
+}
+
+void moduleAcquireGIL(void) {
+    pthread_mutex_lock(&moduleGIL);
+}
+
+int moduleTryAcquireGIL(void) {
+    return pthread_mutex_trylock(&moduleGIL);
+}
+
+void moduleReleaseGIL(void) {
+    pthread_mutex_unlock(&moduleGIL);
+}
+
+
+/* --------------------------------------------------------------------------
+ * ## Module Keyspace Notifications API
+ * -------------------------------------------------------------------------- */
+
+/* Subscribe to keyspace notifications. This is a low-level version of the
+ * keyspace-notifications API. A module can register callbacks to be notified
+ * when keyspace events occur.
+ *
+ * Notification events are filtered by their type (string events, set events,
+ * etc), and the subscriber callback receives only events that match a specific
+ * mask of event types.
+ *
+ * When subscribing to notifications with RedisModule_SubscribeToKeyspaceEvents 
+ * the module must provide an event type-mask, denoting the events the subscriber
+ * is interested in. This can be an ORed mask of any of the following flags:
+ *
+ *  - REDISMODULE_NOTIFY_GENERIC: Generic commands like DEL, EXPIRE, RENAME
+ *  - REDISMODULE_NOTIFY_STRING: String events
+ *  - REDISMODULE_NOTIFY_LIST: List events
+ *  - REDISMODULE_NOTIFY_SET: Set events
+ *  - REDISMODULE_NOTIFY_HASH: Hash events
+ *  - REDISMODULE_NOTIFY_ZSET: Sorted Set events
+ *  - REDISMODULE_NOTIFY_EXPIRED: Expiration events
+ *  - REDISMODULE_NOTIFY_EVICTED: Eviction events
+ *  - REDISMODULE_NOTIFY_STREAM: Stream events
+ *  - REDISMODULE_NOTIFY_MODULE: Module types events
+ *  - REDISMODULE_NOTIFY_KEYMISS: Key-miss events
+ *  - REDISMODULE_NOTIFY_ALL: All events (Excluding REDISMODULE_NOTIFY_KEYMISS)
+ *  - REDISMODULE_NOTIFY_LOADED: A special notification available only for modules,
+ *                               indicates that the key was loaded from persistence.
+ *                               Notice, when this event fires, the given key
+ *                               can not be retained, use RM_CreateStringFromString
+ *                               instead.
+ *
+ * We do not distinguish between key events and keyspace events, and it is up
+ * to the module to filter the actions taken based on the key.
+ *
+ * The subscriber signature is:
+ *
+ *     int (*RedisModuleNotificationFunc) (RedisModuleCtx *ctx, int type,
+ *                                         const char *event,
+ *                                         RedisModuleString *key);
+ *
+ * `type` is the event type bit, that must match the mask given at registration
+ * time. The event string is the actual command being executed, and key is the
+ * relevant Redis key.
+ *
+ * Notification callback gets executed with a redis context that can not be
+ * used to send anything to the client, and has the db number where the event
+ * occurred as its selected db number.
+ *
+ * Notice that it is not necessary to enable notifications in redis.conf for
+ * module notifications to work.
+ *
+ * Warning: the notification callbacks are performed in a synchronous manner,
+ * so notification callbacks must to be fast, or they would slow Redis down.
+ * If you need to take long actions, use threads to offload them.
+ *
+ * See https://redis.io/topics/notifications for more information.
+ */
+int RM_SubscribeToKeyspaceEvents(RedisModuleCtx *ctx, int types, RedisModuleNotificationFunc callback) {
+    RedisModuleKeyspaceSubscriber *sub = zmalloc(sizeof(*sub));
+    sub->module = ctx->module;
+    sub->event_mask = types;
+    sub->notify_callback = callback;
+    sub->active = 0;
+
+    listAddNodeTail(moduleKeyspaceSubscribers, sub);
+    return REDISMODULE_OK;
+}
+
+/* Get the configured bitmap of notify-keyspace-events (Could be used
+ * for additional filtering in RedisModuleNotificationFunc) */
+int RM_GetNotifyKeyspaceEvents() {
+    return server.notify_keyspace_events;
+}
+
+/* Expose notifyKeyspaceEvent to modules */
+int RM_NotifyKeyspaceEvent(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
+    if (!ctx || !ctx->client)
+        return REDISMODULE_ERR;
+    notifyKeyspaceEvent(type, (char *)event, key, ctx->client->db->id);
+    return REDISMODULE_OK;
+}
+
+/* Dispatcher for keyspace notifications to module subscriber functions.
+ * This gets called  only if at least one module requested to be notified on
+ * keyspace notifications */
+void moduleNotifyKeyspaceEvent(int type, const char *event, robj *key, int dbid) {
+    /* Don't do anything if there aren't any subscribers */
+    if (listLength(moduleKeyspaceSubscribers) == 0) return;
+
+    listIter li;
+    listNode *ln;
+    listRewind(moduleKeyspaceSubscribers,&li);
+
+    /* Remove irrelevant flags from the type mask */
+    type &= ~(NOTIFY_KEYEVENT | NOTIFY_KEYSPACE);
+
+    while((ln = listNext(&li))) {
+        RedisModuleKeyspaceSubscriber *sub = ln->value;
+        /* Only notify subscribers on events matching they registration,
+         * and avoid subscribers triggering themselves */
+        if ((sub->event_mask & type) && sub->active == 0) {
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+            ctx.module = sub->module;
+            ctx.client = moduleFreeContextReusedClient;
+            selectDb(ctx.client, dbid);
+
+            /* mark the handler as active to avoid reentrant loops.
+             * If the subscriber performs an action triggering itself,
+             * it will not be notified about it. */
+            sub->active = 1;
+            sub->notify_callback(&ctx, type, event, key);
+            sub->active = 0;
+            moduleFreeContext(&ctx);
+        }
+    }
+}
+
+/* Unsubscribe any notification subscribers this module has upon unloading */
+void moduleUnsubscribeNotifications(RedisModule *module) {
+    listIter li;
+    listNode *ln;
+    listRewind(moduleKeyspaceSubscribers,&li);
+    while((ln = listNext(&li))) {
+        RedisModuleKeyspaceSubscriber *sub = ln->value;
+        if (sub->module == module) {
+            listDelNode(moduleKeyspaceSubscribers, ln);
+            zfree(sub);
+        }
+    }
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules Cluster API
+ * -------------------------------------------------------------------------- */
+
+/* The Cluster message callback function pointer type. */
+typedef void (*RedisModuleClusterMessageReceiver)(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len);
+
+/* This structure identifies a registered caller: it must match a given module
+ * ID, for a given message type. The callback function is just the function
+ * that was registered as receiver. */
+typedef struct moduleClusterReceiver {
+    uint64_t module_id;
+    RedisModuleClusterMessageReceiver callback;
+    struct RedisModule *module;
+    struct moduleClusterReceiver *next;
+} moduleClusterReceiver;
+
+typedef struct moduleClusterNodeInfo {
+    int flags;
+    char ip[NET_IP_STR_LEN];
+    int port;
+    char master_id[40]; /* Only if flags & REDISMODULE_NODE_MASTER is true. */
+} mdouleClusterNodeInfo;
+
+/* We have an array of message types: each bucket is a linked list of
+ * configured receivers. */
+static moduleClusterReceiver *clusterReceivers[UINT8_MAX];
+
+/* Dispatch the message to the right module receiver. */
+void moduleCallClusterReceivers(const char *sender_id, uint64_t module_id, uint8_t type, const unsigned char *payload, uint32_t len) {
+    moduleClusterReceiver *r = clusterReceivers[type];
+    while(r) {
+        if (r->module_id == module_id) {
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+            ctx.module = r->module;
+            ctx.client = moduleFreeContextReusedClient;
+            selectDb(ctx.client, 0);
+            r->callback(&ctx,sender_id,type,payload,len);
+            moduleFreeContext(&ctx);
+            return;
+        }
+        r = r->next;
+    }
+}
+
+/* Register a callback receiver for cluster messages of type 'type'. If there
+ * was already a registered callback, this will replace the callback function
+ * with the one provided, otherwise if the callback is set to NULL and there
+ * is already a callback for this function, the callback is unregistered
+ * (so this API call is also used in order to delete the receiver). */
+void RM_RegisterClusterMessageReceiver(RedisModuleCtx *ctx, uint8_t type, RedisModuleClusterMessageReceiver callback) {
+    if (!server.cluster_enabled) return;
+
+    uint64_t module_id = moduleTypeEncodeId(ctx->module->name,0);
+    moduleClusterReceiver *r = clusterReceivers[type], *prev = NULL;
+    while(r) {
+        if (r->module_id == module_id) {
+            /* Found! Set or delete. */
+            if (callback) {
+                r->callback = callback;
+            } else {
+                /* Delete the receiver entry if the user is setting
+                 * it to NULL. Just unlink the receiver node from the
+                 * linked list. */
+                if (prev)
+                    prev->next = r->next;
+                else
+                    clusterReceivers[type]->next = r->next;
+                zfree(r);
+            }
+            return;
+        }
+        prev = r;
+        r = r->next;
+    }
+
+    /* Not found, let's add it. */
+    if (callback) {
+        r = zmalloc(sizeof(*r));
+        r->module_id = module_id;
+        r->module = ctx->module;
+        r->callback = callback;
+        r->next = clusterReceivers[type];
+        clusterReceivers[type] = r;
+    }
+}
+
+/* Send a message to all the nodes in the cluster if `target` is NULL, otherwise
+ * at the specified target, which is a REDISMODULE_NODE_ID_LEN bytes node ID, as
+ * returned by the receiver callback or by the nodes iteration functions.
+ *
+ * The function returns REDISMODULE_OK if the message was successfully sent,
+ * otherwise if the node is not connected or such node ID does not map to any
+ * known cluster node, REDISMODULE_ERR is returned. */
+int RM_SendClusterMessage(RedisModuleCtx *ctx, char *target_id, uint8_t type, unsigned char *msg, uint32_t len) {
+    if (!server.cluster_enabled) return REDISMODULE_ERR;
+    uint64_t module_id = moduleTypeEncodeId(ctx->module->name,0);
+    if (clusterSendModuleMessageToTarget(target_id,module_id,type,msg,len) == C_OK)
+        return REDISMODULE_OK;
+    else
+        return REDISMODULE_ERR;
+}
+
+/* Return an array of string pointers, each string pointer points to a cluster
+ * node ID of exactly REDISMODULE_NODE_ID_SIZE bytes (without any null term).
+ * The number of returned node IDs is stored into `*numnodes`.
+ * However if this function is called by a module not running an a Redis
+ * instance with Redis Cluster enabled, NULL is returned instead.
+ *
+ * The IDs returned can be used with RedisModule_GetClusterNodeInfo() in order
+ * to get more information about single nodes.
+ *
+ * The array returned by this function must be freed using the function
+ * RedisModule_FreeClusterNodesList().
+ *
+ * Example:
+ *
+ *     size_t count, j;
+ *     char **ids = RedisModule_GetClusterNodesList(ctx,&count);
+ *     for (j = 0; j < count; j++) {
+ *         RedisModule_Log("notice","Node %.*s",
+ *             REDISMODULE_NODE_ID_LEN,ids[j]);
+ *     }
+ *     RedisModule_FreeClusterNodesList(ids);
+ */
+char **RM_GetClusterNodesList(RedisModuleCtx *ctx, size_t *numnodes) {
+    UNUSED(ctx);
+
+    if (!server.cluster_enabled) return NULL;
+    size_t count = dictSize(server.cluster->nodes);
+    char **ids = zmalloc((count+1)*REDISMODULE_NODE_ID_LEN);
+    dictIterator *di = dictGetIterator(server.cluster->nodes);
+    dictEntry *de;
+    int j = 0;
+    while((de = dictNext(di)) != NULL) {
+        clusterNode *node = dictGetVal(de);
+        if (node->flags & (CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE)) continue;
+        ids[j] = zmalloc(REDISMODULE_NODE_ID_LEN);
+        memcpy(ids[j],node->name,REDISMODULE_NODE_ID_LEN);
+        j++;
+    }
+    *numnodes = j;
+    ids[j] = NULL; /* Null term so that FreeClusterNodesList does not need
+                    * to also get the count argument. */
+    dictReleaseIterator(di);
+    return ids;
+}
+
+/* Free the node list obtained with RedisModule_GetClusterNodesList. */
+void RM_FreeClusterNodesList(char **ids) {
+    if (ids == NULL) return;
+    for (int j = 0; ids[j]; j++) zfree(ids[j]);
+    zfree(ids);
+}
+
+/* Return this node ID (REDISMODULE_CLUSTER_ID_LEN bytes) or NULL if the cluster
+ * is disabled. */
+const char *RM_GetMyClusterID(void) {
+    if (!server.cluster_enabled) return NULL;
+    return server.cluster->myself->name;
+}
+
+/* Return the number of nodes in the cluster, regardless of their state
+ * (handshake, noaddress, ...) so that the number of active nodes may actually
+ * be smaller, but not greater than this number. If the instance is not in
+ * cluster mode, zero is returned. */
+size_t RM_GetClusterSize(void) {
+    if (!server.cluster_enabled) return 0;
+    return dictSize(server.cluster->nodes);
+}
+
+clusterNode *clusterLookupNode(const char *name); /* We need access to internals */
+
+/* Populate the specified info for the node having as ID the specified 'id',
+ * then returns REDISMODULE_OK. Otherwise if the node ID does not exist from
+ * the POV of this local node, REDISMODULE_ERR is returned.
+ *
+ * The arguments `ip`, `master_id`, `port` and `flags` can be NULL in case we don't
+ * need to populate back certain info. If an `ip` and `master_id` (only populated
+ * if the instance is a slave) are specified, they point to buffers holding
+ * at least REDISMODULE_NODE_ID_LEN bytes. The strings written back as `ip`
+ * and `master_id` are not null terminated.
+ *
+ * The list of flags reported is the following:
+ *
+ * * REDISMODULE_NODE_MYSELF:       This node
+ * * REDISMODULE_NODE_MASTER:       The node is a master
+ * * REDISMODULE_NODE_SLAVE:        The node is a replica
+ * * REDISMODULE_NODE_PFAIL:        We see the node as failing
+ * * REDISMODULE_NODE_FAIL:         The cluster agrees the node is failing
+ * * REDISMODULE_NODE_NOFAILOVER:   The slave is configured to never failover
+ */
+int RM_GetClusterNodeInfo(RedisModuleCtx *ctx, const char *id, char *ip, char *master_id, int *port, int *flags) {
+    UNUSED(ctx);
+
+    clusterNode *node = clusterLookupNode(id);
+    if (node == NULL ||
+        node->flags & (CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE))
+    {
+        return REDISMODULE_ERR;
+    }
+
+    if (ip) strncpy(ip,node->ip,NET_IP_STR_LEN);
+
+    if (master_id) {
+        /* If the information is not available, the function will set the
+         * field to zero bytes, so that when the field can't be populated the
+         * function kinda remains predictable. */
+        if (node->flags & CLUSTER_NODE_SLAVE && node->slaveof)
+            memcpy(master_id,node->slaveof->name,REDISMODULE_NODE_ID_LEN);
+        else
+            memset(master_id,0,REDISMODULE_NODE_ID_LEN);
+    }
+    if (port) *port = node->port;
+
+    /* As usually we have to remap flags for modules, in order to ensure
+     * we can provide binary compatibility. */
+    if (flags) {
+        *flags = 0;
+        if (node->flags & CLUSTER_NODE_MYSELF) *flags |= REDISMODULE_NODE_MYSELF;
+        if (node->flags & CLUSTER_NODE_MASTER) *flags |= REDISMODULE_NODE_MASTER;
+        if (node->flags & CLUSTER_NODE_SLAVE) *flags |= REDISMODULE_NODE_SLAVE;
+        if (node->flags & CLUSTER_NODE_PFAIL) *flags |= REDISMODULE_NODE_PFAIL;
+        if (node->flags & CLUSTER_NODE_FAIL) *flags |= REDISMODULE_NODE_FAIL;
+        if (node->flags & CLUSTER_NODE_NOFAILOVER) *flags |= REDISMODULE_NODE_NOFAILOVER;
+    }
+    return REDISMODULE_OK;
+}
+
+/* Set Redis Cluster flags in order to change the normal behavior of
+ * Redis Cluster, especially with the goal of disabling certain functions.
+ * This is useful for modules that use the Cluster API in order to create
+ * a different distributed system, but still want to use the Redis Cluster
+ * message bus. Flags that can be set:
+ *
+ * * CLUSTER_MODULE_FLAG_NO_FAILOVER
+ * * CLUSTER_MODULE_FLAG_NO_REDIRECTION
+ *
+ * With the following effects:
+ *
+ * * NO_FAILOVER: prevent Redis Cluster slaves to failover a failing master.
+ *                Also disables the replica migration feature.
+ *
+ * * NO_REDIRECTION: Every node will accept any key, without trying to perform
+ *                   partitioning according to the user Redis Cluster algorithm.
+ *                   Slots informations will still be propagated across the
+ *                   cluster, but without effects. */
+void RM_SetClusterFlags(RedisModuleCtx *ctx, uint64_t flags) {
+    UNUSED(ctx);
+    if (flags & REDISMODULE_CLUSTER_FLAG_NO_FAILOVER)
+        server.cluster_module_flags |= CLUSTER_MODULE_FLAG_NO_FAILOVER;
+    if (flags & REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION)
+        server.cluster_module_flags |= CLUSTER_MODULE_FLAG_NO_REDIRECTION;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules Timers API
+ *
+ * Module timers are an high precision "green timers" abstraction where
+ * every module can register even millions of timers without problems, even if
+ * the actual event loop will just have a single timer that is used to awake the
+ * module timers subsystem in order to process the next event.
+ *
+ * All the timers are stored into a radix tree, ordered by expire time, when
+ * the main Redis event loop timer callback is called, we try to process all
+ * the timers already expired one after the other. Then we re-enter the event
+ * loop registering a timer that will expire when the next to process module
+ * timer will expire.
+ *
+ * Every time the list of active timers drops to zero, we unregister the
+ * main event loop timer, so that there is no overhead when such feature is
+ * not used.
+ * -------------------------------------------------------------------------- */
+
+static rax *Timers;     /* The radix tree of all the timers sorted by expire. */
+long long aeTimer = -1; /* Main event loop (ae.c) timer identifier. */
+
+typedef void (*RedisModuleTimerProc)(RedisModuleCtx *ctx, void *data);
+
+/* The timer descriptor, stored as value in the radix tree. */
+typedef struct RedisModuleTimer {
+    RedisModule *module;                /* Module reference. */
+    RedisModuleTimerProc callback;      /* The callback to invoke on expire. */
+    void *data;                         /* Private data for the callback. */
+    int dbid;                           /* Database number selected by the original client. */
+} RedisModuleTimer;
+
+/* This is the timer handler that is called by the main event loop. We schedule
+ * this timer to be called when the nearest of our module timers will expire. */
+int moduleTimerHandler(struct aeEventLoop *eventLoop, long long id, void *clientData) {
+    UNUSED(eventLoop);
+    UNUSED(id);
+    UNUSED(clientData);
+
+    /* To start let's try to fire all the timers already expired. */
+    raxIterator ri;
+    raxStart(&ri,Timers);
+    uint64_t now = ustime();
+    long long next_period = 0;
+    while(1) {
+        raxSeek(&ri,"^",NULL,0);
+        if (!raxNext(&ri)) break;
+        uint64_t expiretime;
+        memcpy(&expiretime,ri.key,sizeof(expiretime));
+        expiretime = ntohu64(expiretime);
+        if (now >= expiretime) {
+            RedisModuleTimer *timer = ri.data;
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+
+            ctx.module = timer->module;
+            ctx.client = moduleFreeContextReusedClient;
+            selectDb(ctx.client, timer->dbid);
+            timer->callback(&ctx,timer->data);
+            moduleFreeContext(&ctx);
+            raxRemove(Timers,(unsigned char*)ri.key,ri.key_len,NULL);
+            zfree(timer);
+        } else {
+            /* We call ustime() again instead of using the cached 'now' so that
+             * 'next_period' isn't affected by the time it took to execute
+             * previous calls to 'callback.
+             * We need to cast 'expiretime' so that the compiler will not treat
+             * the difference as unsigned (Causing next_period to be huge) in
+             * case expiretime < ustime() */
+            next_period = ((long long)expiretime-ustime())/1000; /* Scale to milliseconds. */
+            break;
+        }
+    }
+    raxStop(&ri);
+
+    /* Reschedule the next timer or cancel it. */
+    if (next_period <= 0) next_period = 1;
+    if (raxSize(Timers) > 0) {
+        return next_period;
+    } else {
+        aeTimer = -1;
+        return AE_NOMORE;
+    }
+}
+
+/* Create a new timer that will fire after `period` milliseconds, and will call
+ * the specified function using `data` as argument. The returned timer ID can be
+ * used to get information from the timer or to stop it before it fires.
+ * Note that for the common use case of a repeating timer (Re-registration
+ * of the timer inside the RedisModuleTimerProc callback) it matters when
+ * this API is called:
+ * If it is called at the beginning of 'callback' it means
+ * the event will triggered every 'period'.
+ * If it is called at the end of 'callback' it means
+ * there will 'period' milliseconds gaps between events.
+ * (If the time it takes to execute 'callback' is negligible the two
+ * statements above mean the same) */
+RedisModuleTimerID RM_CreateTimer(RedisModuleCtx *ctx, mstime_t period, RedisModuleTimerProc callback, void *data) {
+    RedisModuleTimer *timer = zmalloc(sizeof(*timer));
+    timer->module = ctx->module;
+    timer->callback = callback;
+    timer->data = data;
+    timer->dbid = ctx->client ? ctx->client->db->id : 0;
+    uint64_t expiretime = ustime()+period*1000;
+    uint64_t key;
+
+    while(1) {
+        key = htonu64(expiretime);
+        if (raxFind(Timers, (unsigned char*)&key,sizeof(key)) == raxNotFound) {
+            raxInsert(Timers,(unsigned char*)&key,sizeof(key),timer,NULL);
+            break;
+        } else {
+            expiretime++;
+        }
+    }
+
+    /* We need to install the main event loop timer if it's not already
+     * installed, or we may need to refresh its period if we just installed
+     * a timer that will expire sooner than any other else (i.e. the timer
+     * we just installed is the first timer in the Timers rax). */
+    if (aeTimer != -1) {
+        raxIterator ri;
+        raxStart(&ri,Timers);
+        raxSeek(&ri,"^",NULL,0);
+        raxNext(&ri);
+        if (memcmp(ri.key,&key,sizeof(key)) == 0) {
+            /* This is the first key, we need to re-install the timer according
+             * to the just added event. */
+            aeDeleteTimeEvent(server.el,aeTimer);
+            aeTimer = -1;
+        }
+        raxStop(&ri);
+    }
+
+    /* If we have no main timer (the old one was invalidated, or this is the
+     * first module timer we have), install one. */
+    if (aeTimer == -1)
+        aeTimer = aeCreateTimeEvent(server.el,period,moduleTimerHandler,NULL,NULL);
+
+    return key;
+}
+
+/* Stop a timer, returns REDISMODULE_OK if the timer was found, belonged to the
+ * calling module, and was stopped, otherwise REDISMODULE_ERR is returned.
+ * If not NULL, the data pointer is set to the value of the data argument when
+ * the timer was created. */
+int RM_StopTimer(RedisModuleCtx *ctx, RedisModuleTimerID id, void **data) {
+    RedisModuleTimer *timer = raxFind(Timers,(unsigned char*)&id,sizeof(id));
+    if (timer == raxNotFound || timer->module != ctx->module)
+        return REDISMODULE_ERR;
+    if (data) *data = timer->data;
+    raxRemove(Timers,(unsigned char*)&id,sizeof(id),NULL);
+    zfree(timer);
+    return REDISMODULE_OK;
+}
+
+/* Obtain information about a timer: its remaining time before firing
+ * (in milliseconds), and the private data pointer associated with the timer.
+ * If the timer specified does not exist or belongs to a different module
+ * no information is returned and the function returns REDISMODULE_ERR, otherwise
+ * REDISMODULE_OK is returned. The arguments remaining or data can be NULL if
+ * the caller does not need certain information. */
+int RM_GetTimerInfo(RedisModuleCtx *ctx, RedisModuleTimerID id, uint64_t *remaining, void **data) {
+    RedisModuleTimer *timer = raxFind(Timers,(unsigned char*)&id,sizeof(id));
+    if (timer == raxNotFound || timer->module != ctx->module)
+        return REDISMODULE_ERR;
+    if (remaining) {
+        int64_t rem = ntohu64(id)-ustime();
+        if (rem < 0) rem = 0;
+        *remaining = rem/1000; /* Scale to milliseconds. */
+    }
+    if (data) *data = timer->data;
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules ACL API
+ *
+ * Implements a hook into the authentication and authorization within Redis. 
+ * --------------------------------------------------------------------------*/
+
+/* This function is called when a client's user has changed and invokes the
+ * client's user changed callback if it was set. This callback should
+ * cleanup any state the module was tracking about this client. 
+ * 
+ * A client's user can be changed through the AUTH command, module 
+ * authentication, and when a client is freed. */
+void moduleNotifyUserChanged(client *c) {
+    if (c->auth_callback) {
+        c->auth_callback(c->id, c->auth_callback_privdata);
+
+        /* The callback will fire exactly once, even if the user remains 
+         * the same. It is expected to completely clean up the state
+         * so all references are cleared here. */
+        c->auth_callback = NULL;
+        c->auth_callback_privdata = NULL;
+        c->auth_module = NULL;
+    }
+}
+
+void revokeClientAuthentication(client *c) {
+    /* Freeing the client would result in moduleNotifyUserChanged() to be
+     * called later, however since we use revokeClientAuthentication() also
+     * in moduleFreeAuthenticatedClients() to implement module unloading, we
+     * do this action ASAP: this way if the module is unloaded, when the client
+     * is eventually freed we don't rely on the module to still exist. */
+    moduleNotifyUserChanged(c);
+
+    c->user = DefaultUser;
+    c->authenticated = 0;
+    /* We will write replies to this client later, so we can't close it
+     * directly even if async. */
+    if (c == server.current_client) {
+        c->flags |= CLIENT_CLOSE_AFTER_COMMAND;
+    } else {
+        freeClientAsync(c);
+    }
+}
+
+/* Cleanup all clients that have been authenticated with this module. This
+ * is called from onUnload() to give the module a chance to cleanup any
+ * resources associated with clients it has authenticated. */
+static void moduleFreeAuthenticatedClients(RedisModule *module) {
+    listIter li;
+    listNode *ln;
+    listRewind(server.clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        client *c = listNodeValue(ln);
+        if (!c->auth_module) continue;
+
+        RedisModule *auth_module = (RedisModule *) c->auth_module;
+        if (auth_module == module) { 
+            revokeClientAuthentication(c);
+        }
+    }
+}
+
+/* Creates a Redis ACL user that the module can use to authenticate a client.
+ * After obtaining the user, the module should set what such user can do
+ * using the RM_SetUserACL() function. Once configured, the user
+ * can be used in order to authenticate a connection, with the specified
+ * ACL rules, using the RedisModule_AuthClientWithUser() function.
+ *
+ * Note that:
+ *
+ * * Users created here are not listed by the ACL command.
+ * * Users created here are not checked for duplicated name, so it's up to
+ *   the module calling this function to take care of not creating users
+ *   with the same name.
+ * * The created user can be used to authenticate multiple Redis connections.
+ *
+ * The caller can later free the user using the function
+ * RM_FreeModuleUser(). When this function is called, if there are
+ * still clients authenticated with this user, they are disconnected.
+ * The function to free the user should only be used when the caller really
+ * wants to invalidate the user to define a new one with different
+ * capabilities. */
+RedisModuleUser *RM_CreateModuleUser(const char *name) {
+    RedisModuleUser *new_user = zmalloc(sizeof(RedisModuleUser));
+    new_user->user = ACLCreateUnlinkedUser();
+
+    /* Free the previous temporarily assigned name to assign the new one */
+    sdsfree(new_user->user->name);
+    new_user->user->name = sdsnew(name);
+    return new_user;
+}
+
+/* Frees a given user and disconnects all of the clients that have been
+ * authenticated with it. See RM_CreateModuleUser for detailed usage.*/
+int RM_FreeModuleUser(RedisModuleUser *user) {
+    ACLFreeUserAndKillClients(user->user);
+    zfree(user);
+    return REDISMODULE_OK;
+}
+
+/* Sets the permissions of a user created through the redis module 
+ * interface. The syntax is the same as ACL SETUSER, so refer to the 
+ * documentation in acl.c for more information. See RM_CreateModuleUser
+ * for detailed usage.
+ * 
+ * Returns REDISMODULE_OK on success and REDISMODULE_ERR on failure
+ * and will set an errno describing why the operation failed. */
+int RM_SetModuleUserACL(RedisModuleUser *user, const char* acl) {
+    return ACLSetUser(user->user, acl, -1);
+}
+
+/* Authenticate the client associated with the context with 
+ * the provided user. Returns REDISMODULE_OK on success and
+ * REDISMODULE_ERR on error.
+ * 
+ * This authentication can be tracked with the optional callback and private
+ * data fields. The callback will be called whenever the user of the client
+ * changes. This callback should be used to cleanup any state that is being
+ * kept in the module related to the client authentication. It will only be
+ * called once, even when the user hasn't changed, in order to allow for a
+ * new callback to be specified. If this authentication does not need to be
+ * tracked, pass in NULL for the callback and privdata. 
+ * 
+ * If client_id is not NULL, it will be filled with the id of the client
+ * that was authenticated. This can be used with the 
+ * RM_DeauthenticateAndCloseClient() API in order to deauthenticate a 
+ * previously authenticated client if the authentication is no longer valid. 
+ * 
+ * For expensive authentication operations, it is recommended to block the
+ * client and do the authentication in the background and then attach the user
+ * to the client in a threadsafe context.  */
+static int authenticateClientWithUser(RedisModuleCtx *ctx, user *user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
+    if (user->flags & USER_FLAG_DISABLED) {
+        return REDISMODULE_ERR;
+    }
+
+    /* Avoid settings which are meaningless and will be lost */
+    if (!ctx->client || (ctx->client->flags & CLIENT_MODULE)) {
+        return REDISMODULE_ERR;
+    }
+
+    moduleNotifyUserChanged(ctx->client);
+
+    ctx->client->user = user;
+    ctx->client->authenticated = 1;
+
+    if (callback) {
+        ctx->client->auth_callback = callback;
+        ctx->client->auth_callback_privdata = privdata;
+        ctx->client->auth_module = ctx->module;
+    }
+
+    if (client_id) {
+        *client_id = ctx->client->id;
+    }
+
+    return REDISMODULE_OK;
+}
+
+
+/* Authenticate the current context's user with the provided redis acl user. 
+ * Returns REDISMODULE_ERR if the user is disabled.
+ * 
+ * See authenticateClientWithUser for information about callback, client_id,
+ * and general usage for authentication. */
+int RM_AuthenticateClientWithUser(RedisModuleCtx *ctx, RedisModuleUser *module_user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
+    return authenticateClientWithUser(ctx, module_user->user, callback, privdata, client_id);
+}
+
+/* Authenticate the current context's user with the provided redis acl user. 
+ * Returns REDISMODULE_ERR if the user is disabled or the user does not exist.
+ * 
+ * See authenticateClientWithUser for information about callback, client_id,
+ * and general usage for authentication. */
+int RM_AuthenticateClientWithACLUser(RedisModuleCtx *ctx, const char *name, size_t len, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
+    user *acl_user = ACLGetUserByName(name, len);
+
+    if (!acl_user) {
+        return REDISMODULE_ERR;
+    }
+    return authenticateClientWithUser(ctx, acl_user, callback, privdata, client_id);
+}
+
+/* Deauthenticate and close the client. The client resources will not be
+ * be immediately freed, but will be cleaned up in a background job. This is 
+ * the recommended way to deauthenicate a client since most clients can't 
+ * handle users becoming deauthenticated. Returns REDISMODULE_ERR when the
+ * client doesn't exist and REDISMODULE_OK when the operation was successful. 
+ * 
+ * The client ID is returned from the RM_AuthenticateClientWithUser and
+ * RM_AuthenticateClientWithACLUser APIs, but can be obtained through
+ * the CLIENT api or through server events. 
+ * 
+ * This function is not thread safe, and must be executed within the context
+ * of a command or thread safe context. */
+int RM_DeauthenticateAndCloseClient(RedisModuleCtx *ctx, uint64_t client_id) {
+    UNUSED(ctx);
+    client *c = lookupClientByID(client_id);
+    if (c == NULL) return REDISMODULE_ERR;
+
+    /* Revoke also marks client to be closed ASAP */
+    revokeClientAuthentication(c);
+    return REDISMODULE_OK;
+}
+
+/* Return the X.509 client-side certificate used by the client to authenticate
+ * this connection.
+ *
+ * The return value is an allocated RedisModuleString that is a X.509 certificate
+ * encoded in PEM (Base64) format. It should be freed (or auto-freed) by the caller.
+ *
+ * A NULL value is returned in the following conditions:
+ *
+ * - Connection ID does not exist
+ * - Connection is not a TLS connection
+ * - Connection is a TLS connection but no client ceritifcate was used
+ */
+RedisModuleString *RM_GetClientCertificate(RedisModuleCtx *ctx, uint64_t client_id) {
+    client *c = lookupClientByID(client_id);
+    if (c == NULL) return NULL;
+
+    sds cert = connTLSGetPeerCert(c->conn);
+    if (!cert) return NULL;
+
+    RedisModuleString *s = createObject(OBJ_STRING, cert);
+    if (ctx != NULL) autoMemoryAdd(ctx, REDISMODULE_AM_STRING, s);
+
+    return s;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules Dictionary API
+ *
+ * Implements a sorted dictionary (actually backed by a radix tree) with
+ * the usual get / set / del / num-items API, together with an iterator
+ * capable of going back and forth.
+ * -------------------------------------------------------------------------- */
+
+/* Create a new dictionary. The 'ctx' pointer can be the current module context
+ * or NULL, depending on what you want. Please follow the following rules:
+ *
+ * 1. Use a NULL context if you plan to retain a reference to this dictionary
+ *    that will survive the time of the module callback where you created it.
+ * 2. Use a NULL context if no context is available at the time you are creating
+ *    the dictionary (of course...).
+ * 3. However use the current callback context as 'ctx' argument if the
+ *    dictionary time to live is just limited to the callback scope. In this
+ *    case, if enabled, you can enjoy the automatic memory management that will
+ *    reclaim the dictionary memory, as well as the strings returned by the
+ *    Next / Prev dictionary iterator calls.
+ */
+RedisModuleDict *RM_CreateDict(RedisModuleCtx *ctx) {
+    struct RedisModuleDict *d = zmalloc(sizeof(*d));
+    d->rax = raxNew();
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_DICT,d);
+    return d;
+}
+
+/* Free a dictionary created with RM_CreateDict(). You need to pass the
+ * context pointer 'ctx' only if the dictionary was created using the
+ * context instead of passing NULL. */
+void RM_FreeDict(RedisModuleCtx *ctx, RedisModuleDict *d) {
+    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_DICT,d);
+    raxFree(d->rax);
+    zfree(d);
+}
+
+/* Return the size of the dictionary (number of keys). */
+uint64_t RM_DictSize(RedisModuleDict *d) {
+    return raxSize(d->rax);
+}
+
+/* Store the specified key into the dictionary, setting its value to the
+ * pointer 'ptr'. If the key was added with success, since it did not
+ * already exist, REDISMODULE_OK is returned. Otherwise if the key already
+ * exists the function returns REDISMODULE_ERR. */
+int RM_DictSetC(RedisModuleDict *d, void *key, size_t keylen, void *ptr) {
+    int retval = raxTryInsert(d->rax,key,keylen,ptr,NULL);
+    return (retval == 1) ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Like RedisModule_DictSetC() but will replace the key with the new
+ * value if the key already exists. */
+int RM_DictReplaceC(RedisModuleDict *d, void *key, size_t keylen, void *ptr) {
+    int retval = raxInsert(d->rax,key,keylen,ptr,NULL);
+    return (retval == 1) ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Like RedisModule_DictSetC() but takes the key as a RedisModuleString. */
+int RM_DictSet(RedisModuleDict *d, RedisModuleString *key, void *ptr) {
+    return RM_DictSetC(d,key->ptr,sdslen(key->ptr),ptr);
+}
+
+/* Like RedisModule_DictReplaceC() but takes the key as a RedisModuleString. */
+int RM_DictReplace(RedisModuleDict *d, RedisModuleString *key, void *ptr) {
+    return RM_DictReplaceC(d,key->ptr,sdslen(key->ptr),ptr);
+}
+
+/* Return the value stored at the specified key. The function returns NULL
+ * both in the case the key does not exist, or if you actually stored
+ * NULL at key. So, optionally, if the 'nokey' pointer is not NULL, it will
+ * be set by reference to 1 if the key does not exist, or to 0 if the key
+ * exists. */
+void *RM_DictGetC(RedisModuleDict *d, void *key, size_t keylen, int *nokey) {
+    void *res = raxFind(d->rax,key,keylen);
+    if (nokey) *nokey = (res == raxNotFound);
+    return (res == raxNotFound) ? NULL : res;
+}
+
+/* Like RedisModule_DictGetC() but takes the key as a RedisModuleString. */
+void *RM_DictGet(RedisModuleDict *d, RedisModuleString *key, int *nokey) {
+    return RM_DictGetC(d,key->ptr,sdslen(key->ptr),nokey);
+}
+
+/* Remove the specified key from the dictionary, returning REDISMODULE_OK if
+ * the key was found and delted, or REDISMODULE_ERR if instead there was
+ * no such key in the dictionary. When the operation is successful, if
+ * 'oldval' is not NULL, then '*oldval' is set to the value stored at the
+ * key before it was deleted. Using this feature it is possible to get
+ * a pointer to the value (for instance in order to release it), without
+ * having to call RedisModule_DictGet() before deleting the key. */
+int RM_DictDelC(RedisModuleDict *d, void *key, size_t keylen, void *oldval) {
+    int retval = raxRemove(d->rax,key,keylen,oldval);
+    return retval ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Like RedisModule_DictDelC() but gets the key as a RedisModuleString. */
+int RM_DictDel(RedisModuleDict *d, RedisModuleString *key, void *oldval) {
+    return RM_DictDelC(d,key->ptr,sdslen(key->ptr),oldval);
+}
+
+/* Return an iterator, setup in order to start iterating from the specified
+ * key by applying the operator 'op', which is just a string specifying the
+ * comparison operator to use in order to seek the first element. The
+ * operators available are:
+ *
+ * * `^`   -- Seek the first (lexicographically smaller) key.
+ * * `$`   -- Seek the last  (lexicographically biffer) key.
+ * * `>`   -- Seek the first element greater than the specified key.
+ * * `>=`  -- Seek the first element greater or equal than the specified key.
+ * * `<`   -- Seek the first element smaller than the specified key.
+ * * `<=`  -- Seek the first element smaller or equal than the specified key.
+ * * `==`  -- Seek the first element matching exactly the specified key.
+ *
+ * Note that for `^` and `$` the passed key is not used, and the user may
+ * just pass NULL with a length of 0.
+ *
+ * If the element to start the iteration cannot be seeked based on the
+ * key and operator passed, RedisModule_DictNext() / Prev() will just return
+ * REDISMODULE_ERR at the first call, otherwise they'll produce elements.
+ */
+RedisModuleDictIter *RM_DictIteratorStartC(RedisModuleDict *d, const char *op, void *key, size_t keylen) {
+    RedisModuleDictIter *di = zmalloc(sizeof(*di));
+    di->dict = d;
+    raxStart(&di->ri,d->rax);
+    raxSeek(&di->ri,op,key,keylen);
+    return di;
+}
+
+/* Exactly like RedisModule_DictIteratorStartC, but the key is passed as a
+ * RedisModuleString. */
+RedisModuleDictIter *RM_DictIteratorStart(RedisModuleDict *d, const char *op, RedisModuleString *key) {
+    return RM_DictIteratorStartC(d,op,key->ptr,sdslen(key->ptr));
+}
+
+/* Release the iterator created with RedisModule_DictIteratorStart(). This call
+ * is mandatory otherwise a memory leak is introduced in the module. */
+void RM_DictIteratorStop(RedisModuleDictIter *di) {
+    raxStop(&di->ri);
+    zfree(di);
+}
+
+/* After its creation with RedisModule_DictIteratorStart(), it is possible to
+ * change the currently selected element of the iterator by using this
+ * API call. The result based on the operator and key is exactly like
+ * the function RedisModule_DictIteratorStart(), however in this case the
+ * return value is just REDISMODULE_OK in case the seeked element was found,
+ * or REDISMODULE_ERR in case it was not possible to seek the specified
+ * element. It is possible to reseek an iterator as many times as you want. */
+int RM_DictIteratorReseekC(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) {
+    return raxSeek(&di->ri,op,key,keylen);
+}
+
+/* Like RedisModule_DictIteratorReseekC() but takes the key as as a
+ * RedisModuleString. */
+int RM_DictIteratorReseek(RedisModuleDictIter *di, const char *op, RedisModuleString *key) {
+    return RM_DictIteratorReseekC(di,op,key->ptr,sdslen(key->ptr));
+}
+
+/* Return the current item of the dictionary iterator `di` and steps to the
+ * next element. If the iterator already yield the last element and there
+ * are no other elements to return, NULL is returned, otherwise a pointer
+ * to a string representing the key is provided, and the `*keylen` length
+ * is set by reference (if keylen is not NULL). The `*dataptr`, if not NULL
+ * is set to the value of the pointer stored at the returned key as auxiliary
+ * data (as set by the RedisModule_DictSet API).
+ *
+ * Usage example:
+ *
+ *      ... create the iterator here ...
+ *      char *key;
+ *      void *data;
+ *      while((key = RedisModule_DictNextC(iter,&keylen,&data)) != NULL) {
+ *          printf("%.*s %p\n", (int)keylen, key, data);
+ *      }
+ *
+ * The returned pointer is of type void because sometimes it makes sense
+ * to cast it to a `char*` sometimes to an unsigned `char*` depending on the
+ * fact it contains or not binary data, so this API ends being more
+ * comfortable to use.
+ *
+ * The validity of the returned pointer is until the next call to the
+ * next/prev iterator step. Also the pointer is no longer valid once the
+ * iterator is released. */
+void *RM_DictNextC(RedisModuleDictIter *di, size_t *keylen, void **dataptr) {
+    if (!raxNext(&di->ri)) return NULL;
+    if (keylen) *keylen = di->ri.key_len;
+    if (dataptr) *dataptr = di->ri.data;
+    return di->ri.key;
+}
+
+/* This function is exactly like RedisModule_DictNext() but after returning
+ * the currently selected element in the iterator, it selects the previous
+ * element (laxicographically smaller) instead of the next one. */
+void *RM_DictPrevC(RedisModuleDictIter *di, size_t *keylen, void **dataptr) {
+    if (!raxPrev(&di->ri)) return NULL;
+    if (keylen) *keylen = di->ri.key_len;
+    if (dataptr) *dataptr = di->ri.data;
+    return di->ri.key;
+}
+
+/* Like RedisModuleNextC(), but instead of returning an internally allocated
+ * buffer and key length, it returns directly a module string object allocated
+ * in the specified context 'ctx' (that may be NULL exactly like for the main
+ * API RedisModule_CreateString).
+ *
+ * The returned string object should be deallocated after use, either manually
+ * or by using a context that has automatic memory management active. */
+RedisModuleString *RM_DictNext(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) {
+    size_t keylen;
+    void *key = RM_DictNextC(di,&keylen,dataptr);
+    if (key == NULL) return NULL;
+    return RM_CreateString(ctx,key,keylen);
+}
+
+/* Like RedisModule_DictNext() but after returning the currently selected
+ * element in the iterator, it selects the previous element (laxicographically
+ * smaller) instead of the next one. */
+RedisModuleString *RM_DictPrev(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) {
+    size_t keylen;
+    void *key = RM_DictPrevC(di,&keylen,dataptr);
+    if (key == NULL) return NULL;
+    return RM_CreateString(ctx,key,keylen);
+}
+
+/* Compare the element currently pointed by the iterator to the specified
+ * element given by key/keylen, according to the operator 'op' (the set of
+ * valid operators are the same valid for RedisModule_DictIteratorStart).
+ * If the comparision is successful the command returns REDISMODULE_OK
+ * otherwise REDISMODULE_ERR is returned.
+ *
+ * This is useful when we want to just emit a lexicographical range, so
+ * in the loop, as we iterate elements, we can also check if we are still
+ * on range.
+ *
+ * The function return REDISMODULE_ERR if the iterator reached the
+ * end of elements condition as well. */
+int RM_DictCompareC(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) {
+    if (raxEOF(&di->ri)) return REDISMODULE_ERR;
+    int res = raxCompare(&di->ri,op,key,keylen);
+    return res ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+/* Like RedisModule_DictCompareC but gets the key to compare with the current
+ * iterator key as a RedisModuleString. */
+int RM_DictCompare(RedisModuleDictIter *di, const char *op, RedisModuleString *key) {
+    if (raxEOF(&di->ri)) return REDISMODULE_ERR;
+    int res = raxCompare(&di->ri,op,key->ptr,sdslen(key->ptr));
+    return res ? REDISMODULE_OK : REDISMODULE_ERR;
+}
+
+
+
+
+/* --------------------------------------------------------------------------
+ * ## Modules Info fields
+ * -------------------------------------------------------------------------- */
+
+int RM_InfoEndDictField(RedisModuleInfoCtx *ctx);
+
+/* Used to start a new section, before adding any fields. the section name will
+ * be prefixed by `<modulename>_` and must only include A-Z,a-z,0-9.
+ * NULL or empty string indicates the default section (only `<modulename>`) is used.
+ * When return value is REDISMODULE_ERR, the section should and will be skipped. */
+int RM_InfoAddSection(RedisModuleInfoCtx *ctx, char *name) {
+    sds full_name = sdsdup(ctx->module->name);
+    if (name != NULL && strlen(name) > 0)
+        full_name = sdscatfmt(full_name, "_%s", name);
+
+    /* Implicitly end dicts, instead of returning an error which is likely un checked. */
+    if (ctx->in_dict_field)
+        RM_InfoEndDictField(ctx);
+
+    /* proceed only if:
+     * 1) no section was requested (emit all)
+     * 2) the module name was requested (emit all)
+     * 3) this specific section was requested. */
+    if (ctx->requested_section) {
+        if (strcasecmp(ctx->requested_section, full_name) &&
+            strcasecmp(ctx->requested_section, ctx->module->name)) {
+            sdsfree(full_name);
+            ctx->in_section = 0;
+            return REDISMODULE_ERR;
+        }
+    }
+    if (ctx->sections++) ctx->info = sdscat(ctx->info,"\r\n");
+    ctx->info = sdscatfmt(ctx->info, "# %S\r\n", full_name);
+    ctx->in_section = 1;
+    sdsfree(full_name);
+    return REDISMODULE_OK;
+}
+
+/* Starts a dict field, similar to the ones in INFO KEYSPACE. Use normal
+ * RedisModule_InfoAddField* functions to add the items to this field, and
+ * terminate with RedisModule_InfoEndDictField. */
+int RM_InfoBeginDictField(RedisModuleInfoCtx *ctx, char *name) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    /* Implicitly end dicts, instead of returning an error which is likely un checked. */
+    if (ctx->in_dict_field)
+        RM_InfoEndDictField(ctx);
+    char *tmpmodname, *tmpname;
+    ctx->info = sdscatfmt(ctx->info,
+        "%s_%s:",
+        getSafeInfoString(ctx->module->name, strlen(ctx->module->name), &tmpmodname),
+        getSafeInfoString(name, strlen(name), &tmpname));
+    if (tmpmodname != NULL) zfree(tmpmodname);
+    if (tmpname != NULL) zfree(tmpname);
+    ctx->in_dict_field = 1;
+    return REDISMODULE_OK;
+}
+
+/* Ends a dict field, see RedisModule_InfoBeginDictField */
+int RM_InfoEndDictField(RedisModuleInfoCtx *ctx) {
+    if (!ctx->in_dict_field)
+        return REDISMODULE_ERR;
+    /* trim the last ',' if found. */
+    if (ctx->info[sdslen(ctx->info)-1]==',')
+        sdsIncrLen(ctx->info, -1);
+    ctx->info = sdscat(ctx->info, "\r\n");
+    ctx->in_dict_field = 0;
+    return REDISMODULE_OK;
+}
+
+/* Used by RedisModuleInfoFunc to add info fields.
+ * Each field will be automatically prefixed by `<modulename>_`.
+ * Field names or values must not include `\r\n` or `:`. */
+int RM_InfoAddFieldString(RedisModuleInfoCtx *ctx, char *field, RedisModuleString *value) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    if (ctx->in_dict_field) {
+        ctx->info = sdscatfmt(ctx->info,
+            "%s=%S,",
+            field,
+            (sds)value->ptr);
+        return REDISMODULE_OK;
+    }
+    ctx->info = sdscatfmt(ctx->info,
+        "%s_%s:%S\r\n",
+        ctx->module->name,
+        field,
+        (sds)value->ptr);
+    return REDISMODULE_OK;
+}
+
+/* See RedisModule_InfoAddFieldString(). */
+int RM_InfoAddFieldCString(RedisModuleInfoCtx *ctx, char *field, char *value) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    if (ctx->in_dict_field) {
+        ctx->info = sdscatfmt(ctx->info,
+            "%s=%s,",
+            field,
+            value);
+        return REDISMODULE_OK;
+    }
+    ctx->info = sdscatfmt(ctx->info,
+        "%s_%s:%s\r\n",
+        ctx->module->name,
+        field,
+        value);
+    return REDISMODULE_OK;
+}
+
+/* See RedisModule_InfoAddFieldString(). */
+int RM_InfoAddFieldDouble(RedisModuleInfoCtx *ctx, char *field, double value) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    if (ctx->in_dict_field) {
+        ctx->info = sdscatprintf(ctx->info,
+            "%s=%.17g,",
+            field,
+            value);
+        return REDISMODULE_OK;
+    }
+    ctx->info = sdscatprintf(ctx->info,
+        "%s_%s:%.17g\r\n",
+        ctx->module->name,
+        field,
+        value);
+    return REDISMODULE_OK;
+}
+
+/* See RedisModule_InfoAddFieldString(). */
+int RM_InfoAddFieldLongLong(RedisModuleInfoCtx *ctx, char *field, long long value) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    if (ctx->in_dict_field) {
+        ctx->info = sdscatfmt(ctx->info,
+            "%s=%I,",
+            field,
+            value);
+        return REDISMODULE_OK;
+    }
+    ctx->info = sdscatfmt(ctx->info,
+        "%s_%s:%I\r\n",
+        ctx->module->name,
+        field,
+        value);
+    return REDISMODULE_OK;
+}
+
+/* See RedisModule_InfoAddFieldString(). */
+int RM_InfoAddFieldULongLong(RedisModuleInfoCtx *ctx, char *field, unsigned long long value) {
+    if (!ctx->in_section)
+        return REDISMODULE_ERR;
+    if (ctx->in_dict_field) {
+        ctx->info = sdscatfmt(ctx->info,
+            "%s=%U,",
+            field,
+            value);
+        return REDISMODULE_OK;
+    }
+    ctx->info = sdscatfmt(ctx->info,
+        "%s_%s:%U\r\n",
+        ctx->module->name,
+        field,
+        value);
+    return REDISMODULE_OK;
+}
+
+/* Registers callback for the INFO command. The callback should add INFO fields
+ * by calling the `RedisModule_InfoAddField*()` functions. */
+int RM_RegisterInfoFunc(RedisModuleCtx *ctx, RedisModuleInfoFunc cb) {
+    ctx->module->info_cb = cb;
+    return REDISMODULE_OK;
+}
+
+sds modulesCollectInfo(sds info, const char *section, int for_crash_report, int sections) {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        if (!module->info_cb)
+            continue;
+        RedisModuleInfoCtx info_ctx = {module, section, info, sections, 0, 0};
+        module->info_cb(&info_ctx, for_crash_report);
+        /* Implicitly end dicts (no way to handle errors, and we must add the newline). */
+        if (info_ctx.in_dict_field)
+            RM_InfoEndDictField(&info_ctx);
+        info = info_ctx.info;
+        sections = info_ctx.sections;
+    }
+    dictReleaseIterator(di);
+    return info;
+}
+
+/* Get information about the server similar to the one that returns from the
+ * INFO command. This function takes an optional 'section' argument that may
+ * be NULL. The return value holds the output and can be used with
+ * RedisModule_ServerInfoGetField and alike to get the individual fields.
+ * When done, it needs to be freed with RedisModule_FreeServerInfo or with the
+ * automatic memory management mechanism if enabled. */
+RedisModuleServerInfoData *RM_GetServerInfo(RedisModuleCtx *ctx, const char *section) {
+    struct RedisModuleServerInfoData *d = zmalloc(sizeof(*d));
+    d->rax = raxNew();
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_INFO,d);
+    sds info = genRedisInfoString(section);
+    int totlines, i;
+    sds *lines = sdssplitlen(info, sdslen(info), "\r\n", 2, &totlines);
+    for(i=0; i<totlines; i++) {
+        sds line = lines[i];
+        if (line[0]=='#') continue;
+        char *sep = strchr(line, ':');
+        if (!sep) continue;
+        unsigned char *key = (unsigned char*)line;
+        size_t keylen = (intptr_t)sep-(intptr_t)line;
+        sds val = sdsnewlen(sep+1,sdslen(line)-((intptr_t)sep-(intptr_t)line)-1);
+        if (!raxTryInsert(d->rax,key,keylen,val,NULL))
+            sdsfree(val);
+    }
+    sdsfree(info);
+    sdsfreesplitres(lines,totlines);
+    return d;
+}
+
+/* Free data created with RM_GetServerInfo(). You need to pass the
+ * context pointer 'ctx' only if the dictionary was created using the
+ * context instead of passing NULL. */
+void RM_FreeServerInfo(RedisModuleCtx *ctx, RedisModuleServerInfoData *data) {
+    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_INFO,data);
+    raxIterator ri;
+    raxStart(&ri,data->rax);
+    while(1) {
+        raxSeek(&ri,"^",NULL,0);
+        if (!raxNext(&ri)) break;
+        raxRemove(data->rax,(unsigned char*)ri.key,ri.key_len,NULL);
+        sdsfree(ri.data);
+    }
+    raxStop(&ri);
+    raxFree(data->rax);
+    zfree(data);
+}
+
+/* Get the value of a field from data collected with RM_GetServerInfo(). You
+ * need to pass the context pointer 'ctx' only if you want to use auto memory
+ * mechanism to release the returned string. Return value will be NULL if the
+ * field was not found. */
+RedisModuleString *RM_ServerInfoGetField(RedisModuleCtx *ctx, RedisModuleServerInfoData *data, const char* field) {
+    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
+    if (val == raxNotFound) return NULL;
+    RedisModuleString *o = createStringObject(val,sdslen(val));
+    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
+    return o;
+}
+
+/* Similar to RM_ServerInfoGetField, but returns a char* which should not be freed but the caller. */
+const char *RM_ServerInfoGetFieldC(RedisModuleServerInfoData *data, const char* field) {
+    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
+    if (val == raxNotFound) return NULL;
+    return val;
+}
+
+/* Get the value of a field from data collected with RM_GetServerInfo(). If the
+ * field is not found, or is not numerical or out of range, return value will be
+ * 0, and the optional out_err argument will be set to REDISMODULE_ERR. */
+long long RM_ServerInfoGetFieldSigned(RedisModuleServerInfoData *data, const char* field, int *out_err) {
+    long long ll;
+    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
+    if (val == raxNotFound) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (!string2ll(val,sdslen(val),&ll)) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (out_err) *out_err = REDISMODULE_OK;
+    return ll;
+}
+
+/* Get the value of a field from data collected with RM_GetServerInfo(). If the
+ * field is not found, or is not numerical or out of range, return value will be
+ * 0, and the optional out_err argument will be set to REDISMODULE_ERR. */
+unsigned long long RM_ServerInfoGetFieldUnsigned(RedisModuleServerInfoData *data, const char* field, int *out_err) {
+    unsigned long long ll;
+    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
+    if (val == raxNotFound) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (!string2ull(val,&ll)) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (out_err) *out_err = REDISMODULE_OK;
+    return ll;
+}
+
+/* Get the value of a field from data collected with RM_GetServerInfo(). If the
+ * field is not found, or is not a double, return value will be 0, and the
+ * optional out_err argument will be set to REDISMODULE_ERR. */
+double RM_ServerInfoGetFieldDouble(RedisModuleServerInfoData *data, const char* field, int *out_err) {
+    double dbl;
+    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
+    if (val == raxNotFound) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (!string2d(val,sdslen(val),&dbl)) {
+        if (out_err) *out_err = REDISMODULE_ERR;
+        return 0;
+    }
+    if (out_err) *out_err = REDISMODULE_OK;
+    return dbl;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules utility APIs
+ * -------------------------------------------------------------------------- */
+
+/* Return random bytes using SHA1 in counter mode with a /dev/urandom
+ * initialized seed. This function is fast so can be used to generate
+ * many bytes without any effect on the operating system entropy pool.
+ * Currently this function is not thread safe. */
+void RM_GetRandomBytes(unsigned char *dst, size_t len) {
+    getRandomBytes(dst,len);
+}
+
+/* Like RedisModule_GetRandomBytes() but instead of setting the string to
+ * random bytes the string is set to random characters in the in the
+ * hex charset [0-9a-f]. */
+void RM_GetRandomHexChars(char *dst, size_t len) {
+    getRandomHexChars(dst,len);
+}
+
+/* --------------------------------------------------------------------------
+ * ## Modules API exporting / importing
+ * -------------------------------------------------------------------------- */
+
+/* This function is called by a module in order to export some API with a
+ * given name. Other modules will be able to use this API by calling the
+ * symmetrical function RM_GetSharedAPI() and casting the return value to
+ * the right function pointer.
+ *
+ * The function will return REDISMODULE_OK if the name is not already taken,
+ * otherwise REDISMODULE_ERR will be returned and no operation will be
+ * performed.
+ *
+ * IMPORTANT: the apiname argument should be a string literal with static
+ * lifetime. The API relies on the fact that it will always be valid in
+ * the future. */
+int RM_ExportSharedAPI(RedisModuleCtx *ctx, const char *apiname, void *func) {
+    RedisModuleSharedAPI *sapi = zmalloc(sizeof(*sapi));
+    sapi->module = ctx->module;
+    sapi->func = func;
+    if (dictAdd(server.sharedapi, (char*)apiname, sapi) != DICT_OK) {
+        zfree(sapi);
+        return REDISMODULE_ERR;
+    }
+    return REDISMODULE_OK;
+}
+
+/* Request an exported API pointer. The return value is just a void pointer
+ * that the caller of this function will be required to cast to the right
+ * function pointer, so this is a private contract between modules.
+ *
+ * If the requested API is not available then NULL is returned. Because
+ * modules can be loaded at different times with different order, this
+ * function calls should be put inside some module generic API registering
+ * step, that is called every time a module attempts to execute a
+ * command that requires external APIs: if some API cannot be resolved, the
+ * command should return an error.
+ *
+ * Here is an example:
+ *
+ *     int ... myCommandImplementation() {
+ *        if (getExternalAPIs() == 0) {
+ *             reply with an error here if we cannot have the APIs
+ *        }
+ *        // Use the API:
+ *        myFunctionPointer(foo);
+ *     }
+ *
+ * And the function registerAPI() is:
+ *
+ *     int getExternalAPIs(void) {
+ *         static int api_loaded = 0;
+ *         if (api_loaded != 0) return 1; // APIs already resolved.
+ *
+ *         myFunctionPointer = RedisModule_GetOtherModuleAPI("...");
+ *         if (myFunctionPointer == NULL) return 0;
+ *
+ *         return 1;
+ *     }
+ */
+void *RM_GetSharedAPI(RedisModuleCtx *ctx, const char *apiname) {
+    dictEntry *de = dictFind(server.sharedapi, apiname);
+    if (de == NULL) return NULL;
+    RedisModuleSharedAPI *sapi = dictGetVal(de);
+    if (listSearchKey(sapi->module->usedby,ctx->module) == NULL) {
+        listAddNodeTail(sapi->module->usedby,ctx->module);
+        listAddNodeTail(ctx->module->using,sapi->module);
+    }
+    return sapi->func;
+}
+
+/* Remove all the APIs registered by the specified module. Usually you
+ * want this when the module is going to be unloaded. This function
+ * assumes that's caller responsibility to make sure the APIs are not
+ * used by other modules.
+ *
+ * The number of unregistered APIs is returned. */
+int moduleUnregisterSharedAPI(RedisModule *module) {
+    int count = 0;
+    dictIterator *di = dictGetSafeIterator(server.sharedapi);
+    dictEntry *de;
+    while ((de = dictNext(di)) != NULL) {
+        const char *apiname = dictGetKey(de);
+        RedisModuleSharedAPI *sapi = dictGetVal(de);
+        if (sapi->module == module) {
+            dictDelete(server.sharedapi,apiname);
+            zfree(sapi);
+            count++;
+        }
+    }
+    dictReleaseIterator(di);
+    return count;
+}
+
+/* Remove the specified module as an user of APIs of ever other module.
+ * This is usually called when a module is unloaded.
+ *
+ * Returns the number of modules this module was using APIs from. */
+int moduleUnregisterUsedAPI(RedisModule *module) {
+    listIter li;
+    listNode *ln;
+    int count = 0;
+
+    listRewind(module->using,&li);
+    while((ln = listNext(&li))) {
+        RedisModule *used = ln->value;
+        listNode *ln = listSearchKey(used->usedby,module);
+        if (ln) {
+            listDelNode(used->usedby,ln);
+            count++;
+        }
+    }
+    return count;
+}
+
+/* Unregister all filters registered by a module.
+ * This is called when a module is being unloaded.
+ * 
+ * Returns the number of filters unregistered. */
+int moduleUnregisterFilters(RedisModule *module) {
+    listIter li;
+    listNode *ln;
+    int count = 0;
+
+    listRewind(module->filters,&li);
+    while((ln = listNext(&li))) {
+        RedisModuleCommandFilter *filter = ln->value;
+        listNode *ln = listSearchKey(moduleCommandFilters,filter);
+        if (ln) {
+            listDelNode(moduleCommandFilters,ln);
+            count++;
+        }
+        zfree(filter);
+    }
+    return count;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Module Command Filter API
+ * -------------------------------------------------------------------------- */
+
+/* Register a new command filter function.
+ *
+ * Command filtering makes it possible for modules to extend Redis by plugging
+ * into the execution flow of all commands.
+ *
+ * A registered filter gets called before Redis executes *any* command.  This
+ * includes both core Redis commands and commands registered by any module.  The
+ * filter applies in all execution paths including:
+ *
+ * 1. Invocation by a client.
+ * 2. Invocation through `RedisModule_Call()` by any module.
+ * 3. Invocation through Lua 'redis.call()`.
+ * 4. Replication of a command from a master.
+ *
+ * The filter executes in a special filter context, which is different and more
+ * limited than a RedisModuleCtx.  Because the filter affects any command, it
+ * must be implemented in a very efficient way to reduce the performance impact
+ * on Redis.  All Redis Module API calls that require a valid context (such as
+ * `RedisModule_Call()`, `RedisModule_OpenKey()`, etc.) are not supported in a
+ * filter context.
+ *
+ * The `RedisModuleCommandFilterCtx` can be used to inspect or modify the
+ * executed command and its arguments.  As the filter executes before Redis
+ * begins processing the command, any change will affect the way the command is
+ * processed.  For example, a module can override Redis commands this way:
+ *
+ * 1. Register a `MODULE.SET` command which implements an extended version of
+ *    the Redis `SET` command.
+ * 2. Register a command filter which detects invocation of `SET` on a specific
+ *    pattern of keys.  Once detected, the filter will replace the first
+ *    argument from `SET` to `MODULE.SET`.
+ * 3. When filter execution is complete, Redis considers the new command name
+ *    and therefore executes the module's own command.
+ *
+ * Note that in the above use case, if `MODULE.SET` itself uses
+ * `RedisModule_Call()` the filter will be applied on that call as well.  If
+ * that is not desired, the `REDISMODULE_CMDFILTER_NOSELF` flag can be set when
+ * registering the filter.
+ *
+ * The `REDISMODULE_CMDFILTER_NOSELF` flag prevents execution flows that
+ * originate from the module's own `RM_Call()` from reaching the filter.  This
+ * flag is effective for all execution flows, including nested ones, as long as
+ * the execution begins from the module's command context or a thread-safe
+ * context that is associated with a blocking command.
+ *
+ * Detached thread-safe contexts are *not* associated with the module and cannot
+ * be protected by this flag.
+ *
+ * If multiple filters are registered (by the same or different modules), they
+ * are executed in the order of registration.
+ */
+
+RedisModuleCommandFilter *RM_RegisterCommandFilter(RedisModuleCtx *ctx, RedisModuleCommandFilterFunc callback, int flags) {
+    RedisModuleCommandFilter *filter = zmalloc(sizeof(*filter));
+    filter->module = ctx->module;
+    filter->callback = callback;
+    filter->flags = flags;
+
+    listAddNodeTail(moduleCommandFilters, filter);
+    listAddNodeTail(ctx->module->filters, filter);
+    return filter;
+}
+
+/* Unregister a command filter.
+ */
+int RM_UnregisterCommandFilter(RedisModuleCtx *ctx, RedisModuleCommandFilter *filter) {
+    listNode *ln;
+
+    /* A module can only remove its own filters */
+    if (filter->module != ctx->module) return REDISMODULE_ERR;
+
+    ln = listSearchKey(moduleCommandFilters,filter);
+    if (!ln) return REDISMODULE_ERR;
+    listDelNode(moduleCommandFilters,ln);
+
+    ln = listSearchKey(ctx->module->filters,filter);
+    if (!ln) return REDISMODULE_ERR;    /* Shouldn't happen */
+    listDelNode(ctx->module->filters,ln);
+
+    zfree(filter);
+
+    return REDISMODULE_OK;
+}
+
+void moduleCallCommandFilters(client *c) {
+    if (listLength(moduleCommandFilters) == 0) return;
+
+    listIter li;
+    listNode *ln;
+    listRewind(moduleCommandFilters,&li);
+
+    RedisModuleCommandFilterCtx filter = {
+        .argv = c->argv,
+        .argc = c->argc
+    };
+
+    while((ln = listNext(&li))) {
+        RedisModuleCommandFilter *f = ln->value;
+
+        /* Skip filter if REDISMODULE_CMDFILTER_NOSELF is set and module is
+         * currently processing a command.
+         */
+        if ((f->flags & REDISMODULE_CMDFILTER_NOSELF) && f->module->in_call) continue;
+
+        /* Call filter */
+        f->callback(&filter);
+    }
+
+    c->argv = filter.argv;
+    c->argc = filter.argc;
+}
+
+/* Return the number of arguments a filtered command has.  The number of
+ * arguments include the command itself.
+ */
+int RM_CommandFilterArgsCount(RedisModuleCommandFilterCtx *fctx)
+{
+    return fctx->argc;
+}
+
+/* Return the specified command argument.  The first argument (position 0) is
+ * the command itself, and the rest are user-provided args.
+ */
+const RedisModuleString *RM_CommandFilterArgGet(RedisModuleCommandFilterCtx *fctx, int pos)
+{
+    if (pos < 0 || pos >= fctx->argc) return NULL;
+    return fctx->argv[pos];
+}
+
+/* Modify the filtered command by inserting a new argument at the specified
+ * position.  The specified RedisModuleString argument may be used by Redis
+ * after the filter context is destroyed, so it must not be auto-memory
+ * allocated, freed or used elsewhere.
+ */
+int RM_CommandFilterArgInsert(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg)
+{
+    int i;
+
+    if (pos < 0 || pos > fctx->argc) return REDISMODULE_ERR;
+
+    fctx->argv = zrealloc(fctx->argv, (fctx->argc+1)*sizeof(RedisModuleString *));
+    for (i = fctx->argc; i > pos; i--) {
+        fctx->argv[i] = fctx->argv[i-1];
+    }
+    fctx->argv[pos] = arg;
+    fctx->argc++;
+
+    return REDISMODULE_OK;
+}
+
+/* Modify the filtered command by replacing an existing argument with a new one.
+ * The specified RedisModuleString argument may be used by Redis after the
+ * filter context is destroyed, so it must not be auto-memory allocated, freed
+ * or used elsewhere.
+ */
+int RM_CommandFilterArgReplace(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg)
+{
+    if (pos < 0 || pos >= fctx->argc) return REDISMODULE_ERR;
+
+    decrRefCount(fctx->argv[pos]);
+    fctx->argv[pos] = arg;
+
+    return REDISMODULE_OK;
+}
+
+/* Modify the filtered command by deleting an argument at the specified
+ * position.
+ */
+int RM_CommandFilterArgDelete(RedisModuleCommandFilterCtx *fctx, int pos)
+{
+    int i;
+    if (pos < 0 || pos >= fctx->argc) return REDISMODULE_ERR;
+
+    decrRefCount(fctx->argv[pos]);
+    for (i = pos; i < fctx->argc-1; i++) {
+        fctx->argv[i] = fctx->argv[i+1];
+    }
+    fctx->argc--;
+
+    return REDISMODULE_OK;
+}
+
+/* For a given pointer allocated via RedisModule_Alloc() or
+ * RedisModule_Realloc(), return the amount of memory allocated for it.
+ * Note that this may be different (larger) than the memory we allocated
+ * with the allocation calls, since sometimes the underlying allocator
+ * will allocate more memory.
+ */
+size_t RM_MallocSize(void* ptr){
+    return zmalloc_size(ptr);
+}
+
+/* Return the a number between 0 to 1 indicating the amount of memory
+ * currently used, relative to the Redis "maxmemory" configuration.
+ *
+ * * 0 - No memory limit configured.
+ * * Between 0 and 1 - The percentage of the memory used normalized in 0-1 range.
+ * * Exactly 1 - Memory limit reached.
+ * * Greater 1 - More memory used than the configured limit.
+ */
+float RM_GetUsedMemoryRatio(){
+    float level;
+    getMaxmemoryState(NULL, NULL, NULL, &level);
+    return level;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Scanning keyspace and hashes
+ * -------------------------------------------------------------------------- */
+
+typedef void (*RedisModuleScanCB)(RedisModuleCtx *ctx, RedisModuleString *keyname, RedisModuleKey *key, void *privdata);
+typedef struct {
+    RedisModuleCtx *ctx;
+    void* user_data;
+    RedisModuleScanCB fn;
+} ScanCBData;
+
+typedef struct RedisModuleScanCursor{
+    int cursor;
+    int done;
+}RedisModuleScanCursor;
+
+static void moduleScanCallback(void *privdata, const dictEntry *de) {
+    ScanCBData *data = privdata;
+    sds key = dictGetKey(de);
+    robj* val = dictGetVal(de);
+    RedisModuleString *keyname = createObject(OBJ_STRING,sdsdup(key));
+
+    /* Setup the key handle. */
+    RedisModuleKey kp = {0};
+    moduleInitKey(&kp, data->ctx, keyname, val, REDISMODULE_READ);
+
+    data->fn(data->ctx, keyname, &kp, data->user_data);
+
+    moduleCloseKey(&kp);
+    decrRefCount(keyname);
+}
+
+/* Create a new cursor to be used with RedisModule_Scan */
+RedisModuleScanCursor *RM_ScanCursorCreate() {
+    RedisModuleScanCursor* cursor = zmalloc(sizeof(*cursor));
+    cursor->cursor = 0;
+    cursor->done = 0;
+    return cursor;
+}
+
+/* Restart an existing cursor. The keys will be rescanned. */
+void RM_ScanCursorRestart(RedisModuleScanCursor *cursor) {
+    cursor->cursor = 0;
+    cursor->done = 0;
+}
+
+/* Destroy the cursor struct. */
+void RM_ScanCursorDestroy(RedisModuleScanCursor *cursor) {
+    zfree(cursor);
+}
+
+/* Scan API that allows a module to scan all the keys and value in
+ * the selected db.
+ *
+ * Callback for scan implementation.
+ *
+ *     void scan_callback(RedisModuleCtx *ctx, RedisModuleString *keyname,
+ *                        RedisModuleKey *key, void *privdata);
+ *
+ * - `ctx`: the redis module context provided to for the scan.
+ * - `keyname`: owned by the caller and need to be retained if used after this
+ *   function.
+ * - `key`: holds info on the key and value, it is provided as best effort, in
+ *   some cases it might be NULL, in which case the user should (can) use
+ *   RedisModule_OpenKey() (and CloseKey too).
+ *   when it is provided, it is owned by the caller and will be free when the
+ *   callback returns.
+ * - `privdata`: the user data provided to RedisModule_Scan().
+ *
+ * The way it should be used:
+ *
+ *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
+ *      while(RedisModule_Scan(ctx, c, callback, privateData));
+ *      RedisModule_ScanCursorDestroy(c);
+ *
+ * It is also possible to use this API from another thread while the lock
+ * is acquired during the actuall call to RM_Scan:
+ *
+ *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
+ *      RedisModule_ThreadSafeContextLock(ctx);
+ *      while(RedisModule_Scan(ctx, c, callback, privateData)){
+ *          RedisModule_ThreadSafeContextUnlock(ctx);
+ *          // do some background job
+ *          RedisModule_ThreadSafeContextLock(ctx);
+ *      }
+ *      RedisModule_ScanCursorDestroy(c);
+ *
+ * The function will return 1 if there are more elements to scan and
+ * 0 otherwise, possibly setting errno if the call failed.
+ *
+ * It is also possible to restart an existing cursor using RM_ScanCursorRestart.
+ *
+ * IMPORTANT: This API is very similar to the Redis SCAN command from the
+ * point of view of the guarantees it provides. This means that the API
+ * may report duplicated keys, but guarantees to report at least one time
+ * every key that was there from the start to the end of the scanning process.
+ *
+ * NOTE: If you do database changes within the callback, you should be aware
+ * that the internal state of the database may change. For instance it is safe
+ * to delete or modify the current key, but may not be safe to delete any
+ * other key.
+ * Moreover playing with the Redis keyspace while iterating may have the
+ * effect of returning more duplicates. A safe pattern is to store the keys
+ * names you want to modify elsewhere, and perform the actions on the keys
+ * later when the iteration is complete. However this can cost a lot of
+ * memory, so it may make sense to just operate on the current key when
+ * possible during the iteration, given that this is safe. */
+int RM_Scan(RedisModuleCtx *ctx, RedisModuleScanCursor *cursor, RedisModuleScanCB fn, void *privdata) {
+    if (cursor->done) {
+        errno = ENOENT;
+        return 0;
+    }
+    int ret = 1;
+    ScanCBData data = { ctx, privdata, fn };
+    cursor->cursor = dictScan(ctx->client->db->dict, cursor->cursor, moduleScanCallback, NULL, &data);
+    if (cursor->cursor == 0) {
+        cursor->done = 1;
+        ret = 0;
+    }
+    errno = 0;
+    return ret;
+}
+
+typedef void (*RedisModuleScanKeyCB)(RedisModuleKey *key, RedisModuleString *field, RedisModuleString *value, void *privdata);
+typedef struct {
+    RedisModuleKey *key;
+    void* user_data;
+    RedisModuleScanKeyCB fn;
+} ScanKeyCBData;
+
+static void moduleScanKeyCallback(void *privdata, const dictEntry *de) {
+    ScanKeyCBData *data = privdata;
+    sds key = dictGetKey(de);
+    robj *o = data->key->value;
+    robj *field = createStringObject(key, sdslen(key));
+    robj *value = NULL;
+    if (o->type == OBJ_SET) {
+        value = NULL;
+    } else if (o->type == OBJ_HASH) {
+        sds val = dictGetVal(de);
+        value = createStringObject(val, sdslen(val));
+    } else if (o->type == OBJ_ZSET) {
+        double *val = (double*)dictGetVal(de);
+        value = createStringObjectFromLongDouble(*val, 0);
+    }
+
+    data->fn(data->key, field, value, data->user_data);
+    decrRefCount(field);
+    if (value) decrRefCount(value);
+}
+
+/* Scan api that allows a module to scan the elements in a hash, set or sorted set key
+ *
+ * Callback for scan implementation.
+ *
+ *     void scan_callback(RedisModuleKey *key, RedisModuleString* field, RedisModuleString* value, void *privdata);
+ *
+ * - key - the redis key context provided to for the scan.
+ * - field - field name, owned by the caller and need to be retained if used
+ *   after this function.
+ * - value - value string or NULL for set type, owned by the caller and need to
+ *   be retained if used after this function.
+ * - privdata - the user data provided to RedisModule_ScanKey.
+ *
+ * The way it should be used:
+ *
+ *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
+ *      RedisModuleKey *key = RedisModule_OpenKey(...)
+ *      while(RedisModule_ScanKey(key, c, callback, privateData));
+ *      RedisModule_CloseKey(key);
+ *      RedisModule_ScanCursorDestroy(c);
+ *
+ * It is also possible to use this API from another thread while the lock is acquired during
+ * the actuall call to RM_ScanKey, and re-opening the key each time:
+ *
+ *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
+ *      RedisModule_ThreadSafeContextLock(ctx);
+ *      RedisModuleKey *key = RedisModule_OpenKey(...)
+ *      while(RedisModule_ScanKey(ctx, c, callback, privateData)){
+ *          RedisModule_CloseKey(key);
+ *          RedisModule_ThreadSafeContextUnlock(ctx);
+ *          // do some background job
+ *          RedisModule_ThreadSafeContextLock(ctx);
+ *          RedisModuleKey *key = RedisModule_OpenKey(...)
+ *      }
+ *      RedisModule_CloseKey(key);
+ *      RedisModule_ScanCursorDestroy(c);
+ *
+ * The function will return 1 if there are more elements to scan and 0 otherwise,
+ * possibly setting errno if the call failed.
+ * It is also possible to restart an existing cursor using RM_ScanCursorRestart.
+ *
+ * NOTE: Certain operations are unsafe while iterating the object. For instance
+ * while the API guarantees to return at least one time all the elements that
+ * are present in the data structure consistently from the start to the end
+ * of the iteration (see HSCAN and similar commands documentation), the more
+ * you play with the elements, the more duplicates you may get. In general
+ * deleting the current element of the data structure is safe, while removing
+ * the key you are iterating is not safe. */
+int RM_ScanKey(RedisModuleKey *key, RedisModuleScanCursor *cursor, RedisModuleScanKeyCB fn, void *privdata) {
+    if (key == NULL || key->value == NULL) {
+        errno = EINVAL;
+        return 0;
+    }
+    dict *ht = NULL;
+    robj *o = key->value;
+    if (o->type == OBJ_SET) {
+        if (o->encoding == OBJ_ENCODING_HT)
+            ht = o->ptr;
+    } else if (o->type == OBJ_HASH) {
+        if (o->encoding == OBJ_ENCODING_HT)
+            ht = o->ptr;
+    } else if (o->type == OBJ_ZSET) {
+        if (o->encoding == OBJ_ENCODING_SKIPLIST)
+            ht = ((zset *)o->ptr)->dict;
+    } else {
+        errno = EINVAL;
+        return 0;
+    }
+    if (cursor->done) {
+        errno = ENOENT;
+        return 0;
+    }
+    int ret = 1;
+    if (ht) {
+        ScanKeyCBData data = { key, privdata, fn };
+        cursor->cursor = dictScan(ht, cursor->cursor, moduleScanKeyCallback, NULL, &data);
+        if (cursor->cursor == 0) {
+            cursor->done = 1;
+            ret = 0;
+        }
+    } else if (o->type == OBJ_SET && o->encoding == OBJ_ENCODING_INTSET) {
+        int pos = 0;
+        int64_t ll;
+        while(intsetGet(o->ptr,pos++,&ll)) {
+            robj *field = createObject(OBJ_STRING,sdsfromlonglong(ll));
+            fn(key, field, NULL, privdata);
+            decrRefCount(field);
+        }
+        cursor->cursor = 1;
+        cursor->done = 1;
+        ret = 0;
+    } else if (o->type == OBJ_HASH || o->type == OBJ_ZSET) {
+        unsigned char *p = ziplistIndex(o->ptr,0);
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vll;
+        while(p) {
+            ziplistGet(p,&vstr,&vlen,&vll);
+            robj *field = (vstr != NULL) ?
+                createStringObject((char*)vstr,vlen) :
+                createObject(OBJ_STRING,sdsfromlonglong(vll));
+            p = ziplistNext(o->ptr,p);
+            ziplistGet(p,&vstr,&vlen,&vll);
+            robj *value = (vstr != NULL) ?
+                createStringObject((char*)vstr,vlen) :
+                createObject(OBJ_STRING,sdsfromlonglong(vll));
+            fn(key, field, value, privdata);
+            p = ziplistNext(o->ptr,p);
+            decrRefCount(field);
+            decrRefCount(value);
+        }
+        cursor->cursor = 1;
+        cursor->done = 1;
+        ret = 0;
+    }
+    errno = 0;
+    return ret;
+}
+
+
+/* --------------------------------------------------------------------------
+ * ## Module fork API
+ * -------------------------------------------------------------------------- */
+
+/* Create a background child process with the current frozen snaphost of the
+ * main process where you can do some processing in the background without
+ * affecting / freezing the traffic and no need for threads and GIL locking.
+ * Note that Redis allows for only one concurrent fork.
+ * When the child wants to exit, it should call RedisModule_ExitFromChild.
+ * If the parent wants to kill the child it should call RedisModule_KillForkChild
+ * The done handler callback will be executed on the parent process when the
+ * child existed (but not when killed)
+ * Return: -1 on failure, on success the parent process will get a positive PID
+ * of the child, and the child process will get 0.
+ */
+int RM_Fork(RedisModuleForkDoneHandler cb, void *user_data) {
+    pid_t childpid;
+
+    if ((childpid = redisFork(CHILD_TYPE_MODULE)) == 0) {
+        /* Child */
+        redisSetProcTitle("redis-module-fork");
+    } else if (childpid == -1) {
+        serverLog(LL_WARNING,"Can't fork for module: %s", strerror(errno));
+    } else {
+        /* Parent */
+        moduleForkInfo.done_handler = cb;
+        moduleForkInfo.done_handler_user_data = user_data;
+        serverLog(LL_VERBOSE, "Module fork started pid: %ld ", (long) childpid);
+    }
+    return childpid;
+}
+
+/* The module is advised to call this function from the fork child once in a while,
+ * so that it can report progress and COW memory to the parent which will be
+ * reported in INFO.
+ * The `progress` argument should between 0 and 1, or -1 when not available. */
+void RM_SendChildHeartbeat(double progress) {
+    sendChildInfoGeneric(CHILD_INFO_TYPE_CURRENT_INFO, 0, progress, "Module fork");
+}
+
+/* Call from the child process when you want to terminate it.
+ * retcode will be provided to the done handler executed on the parent process.
+ */
+int RM_ExitFromChild(int retcode) {
+    sendChildCowInfo(CHILD_INFO_TYPE_MODULE_COW_SIZE, "Module fork");
+    exitFromChild(retcode);
+    return REDISMODULE_OK;
+}
+
+/* Kill the active module forked child, if there is one active and the
+ * pid matches, and returns C_OK. Otherwise if there is no active module
+ * child or the pid does not match, return C_ERR without doing anything. */
+int TerminateModuleForkChild(int child_pid, int wait) {
+    /* Module child should be active and pid should match. */
+    if (server.child_type != CHILD_TYPE_MODULE ||
+        server.child_pid != child_pid) return C_ERR;
+
+    int statloc;
+    serverLog(LL_VERBOSE,"Killing running module fork child: %ld",
+        (long) server.child_pid);
+    if (kill(server.child_pid,SIGUSR1) != -1 && wait) {
+        while(waitpid(server.child_pid, &statloc, 0) !=
+              server.child_pid);
+    }
+    /* Reset the buffer accumulating changes while the child saves. */
+    resetChildState();
+    moduleForkInfo.done_handler = NULL;
+    moduleForkInfo.done_handler_user_data = NULL;
+    return C_OK;
+}
+
+/* Can be used to kill the forked child process from the parent process.
+ * child_pid would be the return value of RedisModule_Fork. */
+int RM_KillForkChild(int child_pid) {
+    /* Kill module child, wait for child exit. */
+    if (TerminateModuleForkChild(child_pid,1) == C_OK)
+        return REDISMODULE_OK;
+    else
+        return REDISMODULE_ERR;
+}
+
+void ModuleForkDoneHandler(int exitcode, int bysignal) {
+    serverLog(LL_NOTICE,
+        "Module fork exited pid: %ld, retcode: %d, bysignal: %d",
+        (long) server.child_pid, exitcode, bysignal);
+    if (moduleForkInfo.done_handler) {
+        moduleForkInfo.done_handler(exitcode, bysignal,
+            moduleForkInfo.done_handler_user_data);
+    }
+
+    moduleForkInfo.done_handler = NULL;
+    moduleForkInfo.done_handler_user_data = NULL;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Server hooks implementation
+ * -------------------------------------------------------------------------- */
+
+/* Register to be notified, via a callback, when the specified server event
+ * happens. The callback is called with the event as argument, and an additional
+ * argument which is a void pointer and should be cased to a specific type
+ * that is event-specific (but many events will just use NULL since they do not
+ * have additional information to pass to the callback).
+ *
+ * If the callback is NULL and there was a previous subscription, the module
+ * will be unsubscribed. If there was a previous subscription and the callback
+ * is not null, the old callback will be replaced with the new one.
+ *
+ * The callback must be of this type:
+ *
+ *     int (*RedisModuleEventCallback)(RedisModuleCtx *ctx,
+ *                                     RedisModuleEvent eid,
+ *                                     uint64_t subevent,
+ *                                     void *data);
+ *
+ * The 'ctx' is a normal Redis module context that the callback can use in
+ * order to call other modules APIs. The 'eid' is the event itself, this
+ * is only useful in the case the module subscribed to multiple events: using
+ * the 'id' field of this structure it is possible to check if the event
+ * is one of the events we registered with this callback. The 'subevent' field
+ * depends on the event that fired.
+ *
+ * Finally the 'data' pointer may be populated, only for certain events, with
+ * more relevant data.
+ *
+ * Here is a list of events you can use as 'eid' and related sub events:
+ *
+ * * RedisModuleEvent_ReplicationRoleChanged:
+ *
+ *     This event is called when the instance switches from master
+ *     to replica or the other way around, however the event is
+ *     also called when the replica remains a replica but starts to
+ *     replicate with a different master.
+ *
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_REPLROLECHANGED_NOW_MASTER`
+ *     * `REDISMODULE_SUBEVENT_REPLROLECHANGED_NOW_REPLICA`
+ *
+ *     The 'data' field can be casted by the callback to a
+ *     `RedisModuleReplicationInfo` structure with the following fields:
+ *
+ *         int master; // true if master, false if replica
+ *         char *masterhost; // master instance hostname for NOW_REPLICA
+ *         int masterport; // master instance port for NOW_REPLICA
+ *         char *replid1; // Main replication ID
+ *         char *replid2; // Secondary replication ID
+ *         uint64_t repl1_offset; // Main replication offset
+ *         uint64_t repl2_offset; // Offset of replid2 validity
+ *
+ * * RedisModuleEvent_Persistence
+ *
+ *     This event is called when RDB saving or AOF rewriting starts
+ *     and ends. The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START`
+ *     * `REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START`
+ *     * `REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START`
+ *     * `REDISMODULE_SUBEVENT_PERSISTENCE_ENDED`
+ *     * `REDISMODULE_SUBEVENT_PERSISTENCE_FAILED`
+ *
+ *     The above events are triggered not just when the user calls the
+ *     relevant commands like BGSAVE, but also when a saving operation
+ *     or AOF rewriting occurs because of internal server triggers.
+ *     The SYNC_RDB_START sub events are happening in the forground due to
+ *     SAVE command, FLUSHALL, or server shutdown, and the other RDB and
+ *     AOF sub events are executed in a background fork child, so any
+ *     action the module takes can only affect the generated AOF or RDB,
+ *     but will not be reflected in the parent process and affect connected
+ *     clients and commands. Also note that the AOF_START sub event may end
+ *     up saving RDB content in case of an AOF with rdb-preamble.
+ *
+ * * RedisModuleEvent_FlushDB
+ *
+ *     The FLUSHALL, FLUSHDB or an internal flush (for instance
+ *     because of replication, after the replica synchronization)
+ *     happened. The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_FLUSHDB_START`
+ *     * `REDISMODULE_SUBEVENT_FLUSHDB_END`
+ *
+ *     The data pointer can be casted to a RedisModuleFlushInfo
+ *     structure with the following fields:
+ *
+ *         int32_t async;  // True if the flush is done in a thread.
+ *                         // See for instance FLUSHALL ASYNC.
+ *                         // In this case the END callback is invoked
+ *                         // immediately after the database is put
+ *                         // in the free list of the thread.
+ *         int32_t dbnum;  // Flushed database number, -1 for all the DBs
+ *                         // in the case of the FLUSHALL operation.
+ *
+ *     The start event is called *before* the operation is initated, thus
+ *     allowing the callback to call DBSIZE or other operation on the
+ *     yet-to-free keyspace.
+ *
+ * * RedisModuleEvent_Loading
+ *
+ *     Called on loading operations: at startup when the server is
+ *     started, but also after a first synchronization when the
+ *     replica is loading the RDB file from the master.
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_LOADING_RDB_START`
+ *     * `REDISMODULE_SUBEVENT_LOADING_AOF_START`
+ *     * `REDISMODULE_SUBEVENT_LOADING_REPL_START`
+ *     * `REDISMODULE_SUBEVENT_LOADING_ENDED`
+ *     * `REDISMODULE_SUBEVENT_LOADING_FAILED`
+ *
+ *     Note that AOF loading may start with an RDB data in case of
+ *     rdb-preamble, in which case you'll only receive an AOF_START event.
+ *
+ * * RedisModuleEvent_ClientChange
+ *
+ *     Called when a client connects or disconnects.
+ *     The data pointer can be casted to a RedisModuleClientInfo
+ *     structure, documented in RedisModule_GetClientInfoById().
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED`
+ *     * `REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED`
+ *
+ * * RedisModuleEvent_Shutdown
+ *
+ *     The server is shutting down. No subevents are available.
+ *
+ * * RedisModuleEvent_ReplicaChange
+ *
+ *     This event is called when the instance (that can be both a
+ *     master or a replica) get a new online replica, or lose a
+ *     replica since it gets disconnected.
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE`
+ *     * `REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE`
+ *
+ *     No additional information is available so far: future versions
+ *     of Redis will have an API in order to enumerate the replicas
+ *     connected and their state.
+ *
+ * * RedisModuleEvent_CronLoop
+ *
+ *     This event is called every time Redis calls the serverCron()
+ *     function in order to do certain bookkeeping. Modules that are
+ *     required to do operations from time to time may use this callback.
+ *     Normally Redis calls this function 10 times per second, but
+ *     this changes depending on the "hz" configuration.
+ *     No sub events are available.
+ *
+ *     The data pointer can be casted to a RedisModuleCronLoop
+ *     structure with the following fields:
+ *
+ *         int32_t hz;  // Approximate number of events per second.
+ *
+ * * RedisModuleEvent_MasterLinkChange
+ *
+ *     This is called for replicas in order to notify when the
+ *     replication link becomes functional (up) with our master,
+ *     or when it goes down. Note that the link is not considered
+ *     up when we just connected to the master, but only if the
+ *     replication is happening correctly.
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_MASTER_LINK_UP`
+ *     * `REDISMODULE_SUBEVENT_MASTER_LINK_DOWN`
+ *
+ * * RedisModuleEvent_ModuleChange
+ *
+ *     This event is called when a new module is loaded or one is unloaded.
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_MODULE_LOADED`
+ *     * `REDISMODULE_SUBEVENT_MODULE_UNLOADED`
+ *
+ *     The data pointer can be casted to a RedisModuleModuleChange
+ *     structure with the following fields:
+ *
+ *         const char* module_name;  // Name of module loaded or unloaded.
+ *         int32_t module_version;  // Module version.
+ *
+ * * RedisModuleEvent_LoadingProgress
+ *
+ *     This event is called repeatedly called while an RDB or AOF file
+ *     is being loaded.
+ *     The following sub events are availble:
+ *
+ *     * `REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB`
+ *     * `REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF`
+ *
+ *     The data pointer can be casted to a RedisModuleLoadingProgress
+ *     structure with the following fields:
+ *
+ *         int32_t hz;  // Approximate number of events per second.
+ *         int32_t progress;  // Approximate progress between 0 and 1024,
+ *                            // or -1 if unknown.
+ *
+ * * RedisModuleEvent_SwapDB
+ *
+ *     This event is called when a SWAPDB command has been successfully
+ *     Executed.
+ *     For this event call currently there is no subevents available.
+ *
+ *     The data pointer can be casted to a RedisModuleSwapDbInfo
+ *     structure with the following fields:
+ *
+ *         int32_t dbnum_first;    // Swap Db first dbnum
+ *         int32_t dbnum_second;   // Swap Db second dbnum
+ *
+ * * RedisModuleEvent_ReplBackup
+ *
+ *     Called when diskless-repl-load config is set to swapdb,
+ *     And redis needs to backup the the current database for the
+ *     possibility to be restored later. A module with global data and
+ *     maybe with aux_load and aux_save callbacks may need to use this
+ *     notification to backup / restore / discard its globals.
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE`
+ *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE`
+ *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD`
+ *
+ * * RedisModuleEvent_ForkChild
+ *
+ *     Called when a fork child (AOFRW, RDBSAVE, module fork...) is born/dies
+ *     The following sub events are available:
+ *
+ *     * `REDISMODULE_SUBEVENT_FORK_CHILD_BORN`
+ *     * `REDISMODULE_SUBEVENT_FORK_CHILD_DIED`
+ *
+ * The function returns REDISMODULE_OK if the module was successfully subscribed
+ * for the specified event. If the API is called from a wrong context or unsupported event
+ * is given then REDISMODULE_ERR is returned. */
+int RM_SubscribeToServerEvent(RedisModuleCtx *ctx, RedisModuleEvent event, RedisModuleEventCallback callback) {
+    RedisModuleEventListener *el;
+
+    /* Protect in case of calls from contexts without a module reference. */
+    if (ctx->module == NULL) return REDISMODULE_ERR;
+    if (event.id >= _REDISMODULE_EVENT_NEXT) return REDISMODULE_ERR;
+
+    /* Search an event matching this module and event ID. */
+    listIter li;
+    listNode *ln;
+    listRewind(RedisModule_EventListeners,&li);
+    while((ln = listNext(&li))) {
+        el = ln->value;
+        if (el->module == ctx->module && el->event.id == event.id)
+            break; /* Matching event found. */
+    }
+
+    /* Modify or remove the event listener if we already had one. */
+    if (ln) {
+        if (callback == NULL) {
+            listDelNode(RedisModule_EventListeners,ln);
+            zfree(el);
+        } else {
+            el->callback = callback; /* Update the callback with the new one. */
+        }
+        return REDISMODULE_OK;
+    }
+
+    /* No event found, we need to add a new one. */
+    el = zmalloc(sizeof(*el));
+    el->module = ctx->module;
+    el->event = event;
+    el->callback = callback;
+    listAddNodeTail(RedisModule_EventListeners,el);
+    return REDISMODULE_OK;
+}
+
+/**
+ * For a given server event and subevent, return zero if the
+ * subevent is not supported and non-zero otherwise.
+ */
+int RM_IsSubEventSupported(RedisModuleEvent event, int64_t subevent) {
+    switch (event.id) {
+    case REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED:
+        return subevent < _REDISMODULE_EVENT_REPLROLECHANGED_NEXT;
+    case REDISMODULE_EVENT_PERSISTENCE:
+        return subevent < _REDISMODULE_SUBEVENT_PERSISTENCE_NEXT;
+    case REDISMODULE_EVENT_FLUSHDB:
+        return subevent < _REDISMODULE_SUBEVENT_FLUSHDB_NEXT;
+    case REDISMODULE_EVENT_LOADING:
+        return subevent < _REDISMODULE_SUBEVENT_LOADING_NEXT;
+    case REDISMODULE_EVENT_CLIENT_CHANGE:
+        return subevent < _REDISMODULE_SUBEVENT_CLIENT_CHANGE_NEXT;
+    case REDISMODULE_EVENT_SHUTDOWN:
+        return subevent < _REDISMODULE_SUBEVENT_SHUTDOWN_NEXT;
+    case REDISMODULE_EVENT_REPLICA_CHANGE:
+        return subevent < _REDISMODULE_EVENT_REPLROLECHANGED_NEXT;
+    case REDISMODULE_EVENT_MASTER_LINK_CHANGE:
+        return subevent < _REDISMODULE_SUBEVENT_MASTER_NEXT;
+    case REDISMODULE_EVENT_CRON_LOOP:
+        return subevent < _REDISMODULE_SUBEVENT_CRON_LOOP_NEXT;
+    case REDISMODULE_EVENT_MODULE_CHANGE:
+        return subevent < _REDISMODULE_SUBEVENT_MODULE_NEXT;
+    case REDISMODULE_EVENT_LOADING_PROGRESS:
+        return subevent < _REDISMODULE_SUBEVENT_LOADING_PROGRESS_NEXT;
+    case REDISMODULE_EVENT_SWAPDB:
+        return subevent < _REDISMODULE_SUBEVENT_SWAPDB_NEXT;
+    case REDISMODULE_EVENT_REPL_BACKUP:
+        return subevent < _REDISMODULE_SUBEVENT_REPL_BACKUP_NEXT;
+    case REDISMODULE_EVENT_FORK_CHILD:
+        return subevent < _REDISMODULE_SUBEVENT_FORK_CHILD_NEXT;
+    default:
+        break;
+    }
+    return 0;
+}
+
+/* This is called by the Redis internals every time we want to fire an
+ * event that can be interceppted by some module. The pointer 'data' is useful
+ * in order to populate the event-specific structure when needed, in order
+ * to return the structure with more information to the callback.
+ *
+ * 'eid' and 'subid' are just the main event ID and the sub event associated
+ * with the event, depending on what exactly happened. */
+void moduleFireServerEvent(uint64_t eid, int subid, void *data) {
+    /* Fast path to return ASAP if there is nothing to do, avoiding to
+     * setup the iterator and so forth: we want this call to be extremely
+     * cheap if there are no registered modules. */
+    if (listLength(RedisModule_EventListeners) == 0) return;
+
+    int real_client_used = 0;
+    listIter li;
+    listNode *ln;
+    listRewind(RedisModule_EventListeners,&li);
+    while((ln = listNext(&li))) {
+        RedisModuleEventListener *el = ln->value;
+        if (el->event.id == eid) {
+            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+            ctx.module = el->module;
+
+            if (eid == REDISMODULE_EVENT_CLIENT_CHANGE) {
+                /* In the case of client changes, we're pushing the real client
+                 * so the event handler can mutate it if needed. For example,
+                 * to change its authentication state in a way that does not
+                 * depend on specific commands executed later.
+                 */
+                ctx.client = (client *) data;
+                real_client_used = 1;
+            } else if (ModulesInHooks == 0) {
+                ctx.client = moduleFreeContextReusedClient;
+            } else {
+                ctx.client = createClient(NULL);
+                ctx.client->flags |= CLIENT_MODULE;
+                ctx.client->user = NULL; /* Root user. */
+            }
+
+            void *moduledata = NULL;
+            RedisModuleClientInfoV1 civ1;
+            RedisModuleReplicationInfoV1 riv1;
+            RedisModuleModuleChangeV1 mcv1;
+            /* Start at DB zero by default when calling the handler. It's
+             * up to the specific event setup to change it when it makes
+             * sense. For instance for FLUSHDB events we select the correct
+             * DB automatically. */
+            selectDb(ctx.client, 0);
+
+            /* Event specific context and data pointer setup. */
+            if (eid == REDISMODULE_EVENT_CLIENT_CHANGE) {
+                modulePopulateClientInfoStructure(&civ1,data,
+                                                  el->event.dataver);
+                moduledata = &civ1;
+            } else if (eid == REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED) {
+                modulePopulateReplicationInfoStructure(&riv1,el->event.dataver);
+                moduledata = &riv1;
+            } else if (eid == REDISMODULE_EVENT_FLUSHDB) {
+                moduledata = data;
+                RedisModuleFlushInfoV1 *fi = data;
+                if (fi->dbnum != -1)
+                    selectDb(ctx.client, fi->dbnum);
+            } else if (eid == REDISMODULE_EVENT_MODULE_CHANGE) {
+                RedisModule *m = data;
+                if (m == el->module)
+                    continue;
+                mcv1.version = REDISMODULE_MODULE_CHANGE_VERSION;
+                mcv1.module_name = m->name;
+                mcv1.module_version = m->ver;
+                moduledata = &mcv1;
+            } else if (eid == REDISMODULE_EVENT_LOADING_PROGRESS) {
+                moduledata = data;
+            } else if (eid == REDISMODULE_EVENT_CRON_LOOP) {
+                moduledata = data;
+            } else if (eid == REDISMODULE_EVENT_SWAPDB) {
+                moduledata = data;
+            }
+
+            ModulesInHooks++;
+            el->module->in_hook++;
+            el->callback(&ctx,el->event,subid,moduledata);
+            el->module->in_hook--;
+            ModulesInHooks--;
+
+            if (ModulesInHooks != 0 && !real_client_used) freeClient(ctx.client);
+            moduleFreeContext(&ctx);
+        }
+    }
+}
+
+/* Remove all the listeners for this module: this is used before unloading
+ * a module. */
+void moduleUnsubscribeAllServerEvents(RedisModule *module) {
+    RedisModuleEventListener *el;
+    listIter li;
+    listNode *ln;
+    listRewind(RedisModule_EventListeners,&li);
+
+    while((ln = listNext(&li))) {
+        el = ln->value;
+        if (el->module == module) {
+            listDelNode(RedisModule_EventListeners,ln);
+            zfree(el);
+        }
+    }
+}
+
+void processModuleLoadingProgressEvent(int is_aof) {
+    long long now = server.ustime;
+    static long long next_event = 0;
+    if (now >= next_event) {
+        /* Fire the loading progress modules end event. */
+        int progress = -1;
+        if (server.loading_total_bytes)
+            progress = (server.loading_loaded_bytes<<10) / server.loading_total_bytes;
+        RedisModuleLoadingProgressV1 fi = {REDISMODULE_LOADING_PROGRESS_VERSION,
+                                     server.hz,
+                                     progress};
+        moduleFireServerEvent(REDISMODULE_EVENT_LOADING_PROGRESS,
+                              is_aof?
+                                REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF:
+                                REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB,
+                              &fi);
+        /* decide when the next event should fire. */
+        next_event = now + 1000000 / server.hz;
+    }
+}
+
+/* When a module key is deleted (in dbAsyncDelete/dbSyncDelete/dbOverwrite), it 
+*  will be called to tell the module which key is about to be released. */
+void moduleNotifyKeyUnlink(robj *key, robj *val) {
+    if (val->type == OBJ_MODULE) {
+        moduleValue *mv = val->ptr;
+        moduleType *mt = mv->type;
+        if (mt->unlink != NULL) {
+            mt->unlink(key,mv->value);
+        } 
+    }
+}
+
+/* --------------------------------------------------------------------------
+ * Modules API internals
+ * -------------------------------------------------------------------------- */
+
+/* server.moduleapi dictionary type. Only uses plain C strings since
+ * this gets queries from modules. */
+
+uint64_t dictCStringKeyHash(const void *key) {
+    return dictGenHashFunction((unsigned char*)key, strlen((char*)key));
+}
+
+int dictCStringKeyCompare(void *privdata, const void *key1, const void *key2) {
+    UNUSED(privdata);
+    return strcmp(key1,key2) == 0;
+}
+
+dictType moduleAPIDictType = {
+    dictCStringKeyHash,        /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictCStringKeyCompare,     /* key compare */
+    NULL,                      /* key destructor */
+    NULL,                      /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+int moduleRegisterApi(const char *funcname, void *funcptr) {
+    return dictAdd(server.moduleapi, (char*)funcname, funcptr);
+}
+
+#define REGISTER_API(name) \
+    moduleRegisterApi("RedisModule_" #name, (void *)(unsigned long)RM_ ## name)
+
+/* Global initialization at Redis startup. */
+void moduleRegisterCoreAPI(void);
+
+/* Some steps in module initialization need to be done last after server
+ * initialization.
+ * For example, selectDb() in createClient() requires that server.db has
+ * been initialized, see #7323. */
+void moduleInitModulesSystemLast(void) {
+    moduleFreeContextReusedClient = createClient(NULL);
+    moduleFreeContextReusedClient->flags |= CLIENT_MODULE;
+    moduleFreeContextReusedClient->user = NULL; /* root user. */
+}
+
+void moduleInitModulesSystem(void) {
+    moduleUnblockedClients = listCreate();
+    server.loadmodule_queue = listCreate();
+    modules = dictCreate(&modulesDictType,NULL);
+
+    /* Set up the keyspace notification subscriber list and static client */
+    moduleKeyspaceSubscribers = listCreate();
+
+    /* Set up filter list */
+    moduleCommandFilters = listCreate();
+
+    /* Reusable client for RM_Call() is created on first use */
+    server.module_client = NULL;
+
+    moduleRegisterCoreAPI();
+    if (pipe(server.module_blocked_pipe) == -1) {
+        serverLog(LL_WARNING,
+            "Can't create the pipe for module blocking commands: %s",
+            strerror(errno));
+        exit(1);
+    }
+    /* Make the pipe non blocking. This is just a best effort aware mechanism
+     * and we do not want to block not in the read nor in the write half. */
+    anetNonBlock(NULL,server.module_blocked_pipe[0]);
+    anetNonBlock(NULL,server.module_blocked_pipe[1]);
+
+    /* Enable close-on-exec flag on pipes in case of the fork-exec system calls in
+     * sentinels or redis servers. */
+    anetCloexec(server.module_blocked_pipe[0]);
+    anetCloexec(server.module_blocked_pipe[1]);
+
+    /* Create the timers radix tree. */
+    Timers = raxNew();
+
+    /* Setup the event listeners data structures. */
+    RedisModule_EventListeners = listCreate();
+
+    /* Our thread-safe contexts GIL must start with already locked:
+     * it is just unlocked when it's safe. */
+    pthread_mutex_lock(&moduleGIL);
+}
+
+/* Load all the modules in the server.loadmodule_queue list, which is
+ * populated by `loadmodule` directives in the configuration file.
+ * We can't load modules directly when processing the configuration file
+ * because the server must be fully initialized before loading modules.
+ *
+ * The function aborts the server on errors, since to start with missing
+ * modules is not considered sane: clients may rely on the existence of
+ * given commands, loading AOF also may need some modules to exist, and
+ * if this instance is a slave, it must understand commands from master. */
+void moduleLoadFromQueue(void) {
+    listIter li;
+    listNode *ln;
+
+    listRewind(server.loadmodule_queue,&li);
+    while((ln = listNext(&li))) {
+        struct moduleLoadQueueEntry *loadmod = ln->value;
+        if (moduleLoad(loadmod->path,(void **)loadmod->argv,loadmod->argc)
+            == C_ERR)
+        {
+            serverLog(LL_WARNING,
+                "Can't load module from %s: server aborting",
+                loadmod->path);
+            exit(1);
+        }
+    }
+}
+
+void moduleFreeModuleStructure(struct RedisModule *module) {
+    listRelease(module->types);
+    listRelease(module->filters);
+    listRelease(module->usedby);
+    listRelease(module->using);
+    sdsfree(module->name);
+    zfree(module);
+}
+
+void moduleUnregisterCommands(struct RedisModule *module) {
+    /* Unregister all the commands registered by this module. */
+    dictIterator *di = dictGetSafeIterator(server.commands);
+    dictEntry *de;
+    while ((de = dictNext(di)) != NULL) {
+        struct redisCommand *cmd = dictGetVal(de);
+        if (cmd->proc == RedisModuleCommandDispatcher) {
+            RedisModuleCommandProxy *cp =
+                (void*)(unsigned long)cmd->getkeys_proc;
+            sds cmdname = cp->rediscmd->name;
+            if (cp->module == module) {
+                dictDelete(server.commands,cmdname);
+                dictDelete(server.orig_commands,cmdname);
+                sdsfree(cmdname);
+                zfree(cp->rediscmd);
+                zfree(cp);
+            }
+        }
+    }
+    dictReleaseIterator(di);
+}
+
+/* Load a module and initialize it. On success C_OK is returned, otherwise
+ * C_ERR is returned. */
+int moduleLoad(const char *path, void **module_argv, int module_argc) {
+    int (*onload)(void *, void **, int);
+    void *handle;
+    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+    ctx.client = moduleFreeContextReusedClient;
+    selectDb(ctx.client, 0);
+
+    struct stat st;
+    if (stat(path, &st) == 0)
+    {   // this check is best effort
+        if (!(st.st_mode & (S_IXUSR  | S_IXGRP | S_IXOTH))) {
+            serverLog(LL_WARNING, "Module %s failed to load: It does not have execute permissions.", path);
+            return C_ERR;
+        }
+    }
+
+    handle = dlopen(path,RTLD_NOW|RTLD_LOCAL);
+    if (handle == NULL) {
+        serverLog(LL_WARNING, "Module %s failed to load: %s", path, dlerror());
+        return C_ERR;
+    }
+    onload = (int (*)(void *, void **, int))(unsigned long) dlsym(handle,"RedisModule_OnLoad");
+    if (onload == NULL) {
+        dlclose(handle);
+        serverLog(LL_WARNING,
+            "Module %s does not export RedisModule_OnLoad() "
+            "symbol. Module not loaded.",path);
+        return C_ERR;
+    }
+    if (onload((void*)&ctx,module_argv,module_argc) == REDISMODULE_ERR) {
+        if (ctx.module) {
+            moduleUnregisterCommands(ctx.module);
+            moduleUnregisterSharedAPI(ctx.module);
+            moduleUnregisterUsedAPI(ctx.module);
+            moduleFreeModuleStructure(ctx.module);
+        }
+        dlclose(handle);
+        serverLog(LL_WARNING,
+            "Module %s initialization failed. Module not loaded",path);
+        return C_ERR;
+    }
+
+    /* Redis module loaded! Register it. */
+    dictAdd(modules,ctx.module->name,ctx.module);
+    ctx.module->blocked_clients = 0;
+    ctx.module->handle = handle;
+    serverLog(LL_NOTICE,"Module '%s' loaded from %s",ctx.module->name,path);
+    /* Fire the loaded modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_MODULE_CHANGE,
+                          REDISMODULE_SUBEVENT_MODULE_LOADED,
+                          ctx.module);
+
+    moduleFreeContext(&ctx);
+    return C_OK;
+}
+
+
+/* Unload the module registered with the specified name. On success
+ * C_OK is returned, otherwise C_ERR is returned and errno is set
+ * to the following values depending on the type of error:
+ *
+ * * ENONET: No such module having the specified name.
+ * * EBUSY: The module exports a new data type and can only be reloaded. */
+int moduleUnload(sds name) {
+    struct RedisModule *module = dictFetchValue(modules,name);
+
+    if (module == NULL) {
+        errno = ENOENT;
+        return REDISMODULE_ERR;
+    } else if (listLength(module->types)) {
+        errno = EBUSY;
+        return REDISMODULE_ERR;
+    } else if (listLength(module->usedby)) {
+        errno = EPERM;
+        return REDISMODULE_ERR;
+    } else if (module->blocked_clients) {
+        errno = EAGAIN;
+        return REDISMODULE_ERR;
+    }
+
+    /* Give module a chance to clean up. */
+    int (*onunload)(void *);
+    onunload = (int (*)(void *))(unsigned long) dlsym(module->handle, "RedisModule_OnUnload");
+    if (onunload) {
+        RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
+        ctx.module = module;
+        ctx.client = moduleFreeContextReusedClient;
+        int unload_status = onunload((void*)&ctx);
+        moduleFreeContext(&ctx);
+
+        if (unload_status == REDISMODULE_ERR) {
+            serverLog(LL_WARNING, "Module %s OnUnload failed.  Unload canceled.", name);
+            errno = ECANCELED;
+            return REDISMODULE_ERR;
+        }
+    }
+
+    moduleFreeAuthenticatedClients(module);
+    moduleUnregisterCommands(module);
+    moduleUnregisterSharedAPI(module);
+    moduleUnregisterUsedAPI(module);
+    moduleUnregisterFilters(module);
+
+    /* Remove any notification subscribers this module might have */
+    moduleUnsubscribeNotifications(module);
+    moduleUnsubscribeAllServerEvents(module);
+
+    /* Unload the dynamic library. */
+    if (dlclose(module->handle) == -1) {
+        char *error = dlerror();
+        if (error == NULL) error = "Unknown error";
+        serverLog(LL_WARNING,"Error when trying to close the %s module: %s",
+            module->name, error);
+    }
+
+    /* Fire the unloaded modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_MODULE_CHANGE,
+                          REDISMODULE_SUBEVENT_MODULE_UNLOADED,
+                          module);
+
+    /* Remove from list of modules. */
+    serverLog(LL_NOTICE,"Module %s unloaded",module->name);
+    dictDelete(modules,module->name);
+    module->name = NULL; /* The name was already freed by dictDelete(). */
+    moduleFreeModuleStructure(module);
+
+    return REDISMODULE_OK;
+}
+
+/* Helper function for the MODULE and HELLO command: send the list of the
+ * loaded modules to the client. */
+void addReplyLoadedModules(client *c) {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    addReplyArrayLen(c,dictSize(modules));
+    while ((de = dictNext(di)) != NULL) {
+        sds name = dictGetKey(de);
+        struct RedisModule *module = dictGetVal(de);
+        addReplyMapLen(c,2);
+        addReplyBulkCString(c,"name");
+        addReplyBulkCBuffer(c,name,sdslen(name));
+        addReplyBulkCString(c,"ver");
+        addReplyLongLong(c,module->ver);
+    }
+    dictReleaseIterator(di);
+}
+
+/* Helper for genModulesInfoString(): given a list of modules, return
+ * am SDS string in the form "[modulename|modulename2|...]" */
+sds genModulesInfoStringRenderModulesList(list *l) {
+    listIter li;
+    listNode *ln;
+    listRewind(l,&li);
+    sds output = sdsnew("[");
+    while((ln = listNext(&li))) {
+        RedisModule *module = ln->value;
+        output = sdscat(output,module->name);
+        if (ln != listLast(l))
+            output = sdscat(output,"|");
+    }
+    output = sdscat(output,"]");
+    return output;
+}
+
+/* Helper for genModulesInfoString(): render module options as an SDS string. */
+sds genModulesInfoStringRenderModuleOptions(struct RedisModule *module) {
+    sds output = sdsnew("[");
+    if (module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS)
+        output = sdscat(output,"handle-io-errors|");
+    output = sdstrim(output,"|");
+    output = sdscat(output,"]");
+    return output;
+}
+
+
+/* Helper function for the INFO command: adds loaded modules as to info's
+ * output.
+ *
+ * After the call, the passed sds info string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds genModulesInfoString(sds info) {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+
+    while ((de = dictNext(di)) != NULL) {
+        sds name = dictGetKey(de);
+        struct RedisModule *module = dictGetVal(de);
+
+        sds usedby = genModulesInfoStringRenderModulesList(module->usedby);
+        sds using = genModulesInfoStringRenderModulesList(module->using);
+        sds options = genModulesInfoStringRenderModuleOptions(module);
+        info = sdscatfmt(info,
+            "module:name=%S,ver=%i,api=%i,filters=%i,"
+            "usedby=%S,using=%S,options=%S\r\n",
+                name, module->ver, module->apiver,
+                (int)listLength(module->filters), usedby, using, options);
+        sdsfree(usedby);
+        sdsfree(using);
+        sdsfree(options);
+    }
+    dictReleaseIterator(di);
+    return info;
+}
+
+/* Redis MODULE command.
+ *
+ * MODULE LIST
+ * MODULE LOAD <path> [args...]
+ * MODULE UNLOAD <name>
+ */
+void moduleCommand(client *c) {
+    char *subcmd = c->argv[1]->ptr;
+
+    if (c->argc == 2 && !strcasecmp(subcmd,"help")) {
+        const char *help[] = {
+"LIST",
+"    Return a list of loaded modules.",
+"LOAD <path> [<arg> ...]",
+"    Load a module library from <path>, passing to it any optional arguments.",
+"UNLOAD <name>",
+"    Unload a module.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else
+    if (!strcasecmp(subcmd,"load") && c->argc >= 3) {
+        robj **argv = NULL;
+        int argc = 0;
+
+        if (c->argc > 3) {
+            argc = c->argc - 3;
+            argv = &c->argv[3];
+        }
+
+        if (moduleLoad(c->argv[2]->ptr,(void **)argv,argc) == C_OK)
+            addReply(c,shared.ok);
+        else
+            addReplyError(c,
+                "Error loading the extension. Please check the server logs.");
+    } else if (!strcasecmp(subcmd,"unload") && c->argc == 3) {
+        if (moduleUnload(c->argv[2]->ptr) == C_OK)
+            addReply(c,shared.ok);
+        else {
+            char *errmsg;
+            switch(errno) {
+            case ENOENT:
+                errmsg = "no such module with that name";
+                break;
+            case EBUSY:
+                errmsg = "the module exports one or more module-side data "
+                         "types, can't unload";
+                break;
+            case EPERM:
+                errmsg = "the module exports APIs used by other modules. "
+                         "Please unload them first and try again";
+                break;
+            case EAGAIN:
+                errmsg = "the module has blocked clients. "
+                         "Please wait them unblocked and try again";
+                break;
+            default:
+                errmsg = "operation not possible.";
+                break;
+            }
+            addReplyErrorFormat(c,"Error unloading module: %s",errmsg);
+        }
+    } else if (!strcasecmp(subcmd,"list") && c->argc == 2) {
+        addReplyLoadedModules(c);
+    } else {
+        addReplySubcommandSyntaxError(c);
+        return;
+    }
+}
+
+/* Return the number of registered modules. */
+size_t moduleCount(void) {
+    return dictSize(modules);
+}
+
+/* --------------------------------------------------------------------------
+ * ## Key eviction API
+ * -------------------------------------------------------------------------- */
+
+/* Set the key last access time for LRU based eviction. not relevant if the
+ * servers's maxmemory policy is LFU based. Value is idle time in milliseconds.
+ * returns REDISMODULE_OK if the LRU was updated, REDISMODULE_ERR otherwise. */
+int RM_SetLRU(RedisModuleKey *key, mstime_t lru_idle) {
+    if (!key->value)
+        return REDISMODULE_ERR;
+    if (objectSetLRUOrLFU(key->value, -1, lru_idle, lru_idle>=0 ? LRU_CLOCK() : 0, 1))
+        return REDISMODULE_OK;
+    return REDISMODULE_ERR;
+}
+
+/* Gets the key last access time.
+ * Value is idletime in milliseconds or -1 if the server's eviction policy is
+ * LFU based.
+ * returns REDISMODULE_OK if when key is valid. */
+int RM_GetLRU(RedisModuleKey *key, mstime_t *lru_idle) {
+    *lru_idle = -1;
+    if (!key->value)
+        return REDISMODULE_ERR;
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU)
+        return REDISMODULE_OK;
+    *lru_idle = estimateObjectIdleTime(key->value);
+    return REDISMODULE_OK;
+}
+
+/* Set the key access frequency. only relevant if the server's maxmemory policy
+ * is LFU based.
+ * The frequency is a logarithmic counter that provides an indication of
+ * the access frequencyonly (must be <= 255).
+ * returns REDISMODULE_OK if the LFU was updated, REDISMODULE_ERR otherwise. */
+int RM_SetLFU(RedisModuleKey *key, long long lfu_freq) {
+    if (!key->value)
+        return REDISMODULE_ERR;
+    if (objectSetLRUOrLFU(key->value, lfu_freq, -1, 0, 1))
+        return REDISMODULE_OK;
+    return REDISMODULE_ERR;
+}
+
+/* Gets the key access frequency or -1 if the server's eviction policy is not
+ * LFU based.
+ * returns REDISMODULE_OK if when key is valid. */
+int RM_GetLFU(RedisModuleKey *key, long long *lfu_freq) {
+    *lfu_freq = -1;
+    if (!key->value)
+        return REDISMODULE_ERR;
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU)
+        *lfu_freq = LFUDecrAndReturn(key->value);
+    return REDISMODULE_OK;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Miscellaneous APIs
+ * -------------------------------------------------------------------------- */
+
+/**
+ * Returns the full ContextFlags mask, using the return value
+ * the module can check if a certain set of flags are supported
+ * by the redis server version in use.
+ * Example:
+ *
+ *        int supportedFlags = RM_GetContextFlagsAll();
+ *        if (supportedFlags & REDISMODULE_CTX_FLAGS_MULTI) {
+ *              // REDISMODULE_CTX_FLAGS_MULTI is supported
+ *        } else{
+ *              // REDISMODULE_CTX_FLAGS_MULTI is not supported
+ *        }
+ */
+int RM_GetContextFlagsAll() {
+    return _REDISMODULE_CTX_FLAGS_NEXT - 1;
+}
+
+/**
+ * Returns the full KeyspaceNotification mask, using the return value
+ * the module can check if a certain set of flags are supported
+ * by the redis server version in use.
+ * Example:
+ *
+ *        int supportedFlags = RM_GetKeyspaceNotificationFlagsAll();
+ *        if (supportedFlags & REDISMODULE_NOTIFY_LOADED) {
+ *              // REDISMODULE_NOTIFY_LOADED is supported
+ *        } else{
+ *              // REDISMODULE_NOTIFY_LOADED is not supported
+ *        }
+ */
+int RM_GetKeyspaceNotificationFlagsAll() {
+    return _REDISMODULE_NOTIFY_NEXT - 1;
+}
+
+/**
+ * Return the redis version in format of 0x00MMmmpp.
+ * Example for 6.0.7 the return value will be 0x00060007.
+ */
+int RM_GetServerVersion() {
+    return REDIS_VERSION_NUM;
+}
+
+/**
+ * Return the current redis-server runtime value of REDISMODULE_TYPE_METHOD_VERSION.
+ * You can use that when calling RM_CreateDataType to know which fields of
+ * RedisModuleTypeMethods are gonna be supported and which will be ignored.
+ */
+int RM_GetTypeMethodVersion() {
+    return REDISMODULE_TYPE_METHOD_VERSION;
+}
+
+/* Replace the value assigned to a module type.
+ *
+ * The key must be open for writing, have an existing value, and have a moduleType
+ * that matches the one specified by the caller.
+ *
+ * Unlike RM_ModuleTypeSetValue() which will free the old value, this function
+ * simply swaps the old value with the new value.
+ *
+ * The function returns REDISMODULE_OK on success, REDISMODULE_ERR on errors
+ * such as:
+ *
+ * 1. Key is not opened for writing.
+ * 2. Key is not a module data type key.
+ * 3. Key is a module datatype other than 'mt'.
+ *
+ * If old_value is non-NULL, the old value is returned by reference.
+ */
+int RM_ModuleTypeReplaceValue(RedisModuleKey *key, moduleType *mt, void *new_value, void **old_value) {
+    if (!(key->mode & REDISMODULE_WRITE) || key->iter)
+        return REDISMODULE_ERR;
+    if (!key->value || key->value->type != OBJ_MODULE)
+        return REDISMODULE_ERR;
+
+    moduleValue *mv = key->value->ptr;
+    if (mv->type != mt)
+        return REDISMODULE_ERR;
+
+    if (old_value)
+        *old_value = mv->value;
+    mv->value = new_value;
+
+    return REDISMODULE_OK;
+}
+
+/* For a specified command, parse its arguments and return an array that
+ * contains the indexes of all key name arguments. This function is
+ * essnetially a more efficient way to do COMMAND GETKEYS.
+ *
+ * A NULL return value indicates the specified command has no keys, or
+ * an error condition. Error conditions are indicated by setting errno
+ * as folllows:
+ *
+ * * ENOENT: Specified command does not exist.
+ * * EINVAL: Invalid command arity specified.
+ *
+ * NOTE: The returned array is not a Redis Module object so it does not
+ * get automatically freed even when auto-memory is used. The caller
+ * must explicitly call RM_Free() to free it.
+ */
+int *RM_GetCommandKeys(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, int *num_keys) {
+    UNUSED(ctx);
+    struct redisCommand *cmd;
+    int *res = NULL;
+
+    /* Find command */
+    if ((cmd = lookupCommand(argv[0]->ptr)) == NULL) {
+        errno = ENOENT;
+        return NULL;
+    }
+
+    /* Bail out if command has no keys */
+    if (cmd->getkeys_proc == NULL && cmd->firstkey == 0) {
+        errno = 0;
+        return NULL;
+    }
+
+    if ((cmd->arity > 0 && cmd->arity != argc) || (argc < -cmd->arity)) {
+        errno = EINVAL;
+        return NULL;
+    }
+
+    getKeysResult result = GETKEYS_RESULT_INIT;
+    getKeysFromCommand(cmd, argv, argc, &result);
+
+    *num_keys = result.numkeys;
+    if (!result.numkeys) {
+        errno = 0;
+        getKeysFreeResult(&result);
+        return NULL;
+    }
+
+    if (result.keys == result.keysbuf) {
+        /* If the result is using a stack based array, copy it. */
+        unsigned long int size = sizeof(int) * result.numkeys;
+        res = zmalloc(size);
+        memcpy(res, result.keys, size);
+    } else {
+        /* We return the heap based array and intentionally avoid calling
+         * getKeysFreeResult() here, as it is the caller's responsibility
+         * to free this array.
+         */
+        res = result.keys;
+    }
+
+    return res;
+}
+
+/* Return the name of the command currently running */
+const char *RM_GetCurrentCommandName(RedisModuleCtx *ctx) {
+    if (!ctx || !ctx->client || !ctx->client->cmd)
+        return NULL;
+
+    return (const char*)ctx->client->cmd->name;
+}
+
+/* --------------------------------------------------------------------------
+ * ## Defrag API
+ * -------------------------------------------------------------------------- */
+
+/* The defrag context, used to manage state during calls to the data type
+ * defrag callback.
+ */
+typedef struct RedisModuleDefragCtx {
+    long defragged;
+    long long int endtime;
+    unsigned long *cursor;
+} RedisModuleDefragCtx;
+
+/* Register a defrag callback for global data, i.e. anything that the module
+ * may allocate that is not tied to a specific data type.
+ */
+int RM_RegisterDefragFunc(RedisModuleCtx *ctx, RedisModuleDefragFunc cb) {
+    ctx->module->defrag_cb = cb;
+    return REDISMODULE_OK;
+}
+
+/* When the data type defrag callback iterates complex structures, this
+ * function should be called periodically. A zero (false) return
+ * indicates the callback may continue its work. A non-zero value (true)
+ * indicates it should stop.
+ *
+ * When stopped, the callback may use RM_DefragCursorSet() to store its
+ * position so it can later use RM_DefragCursorGet() to resume defragging.
+ *
+ * When stopped and more work is left to be done, the callback should
+ * return 1. Otherwise, it should return 0.
+ *
+ * NOTE: Modules should consider the frequency in which this function is called,
+ * so it generally makes sense to do small batches of work in between calls.
+ */
+int RM_DefragShouldStop(RedisModuleDefragCtx *ctx) {
+    return (ctx->endtime != 0 && ctx->endtime < ustime());
+}
+
+/* Store an arbitrary cursor value for future re-use.
+ *
+ * This should only be called if RM_DefragShouldStop() has returned a non-zero
+ * value and the defrag callback is about to exit without fully iterating its
+ * data type.
+ *
+ * This behavior is reserved to cases where late defrag is performed. Late
+ * defrag is selected for keys that implement the `free_effort` callback and
+ * return a `free_effort` value that is larger than the defrag
+ * 'active-defrag-max-scan-fields' configuration directive.
+ *
+ * Smaller keys, keys that do not implement `free_effort` or the global
+ * defrag callback are not called in late-defrag mode. In those cases, a
+ * call to this function will return REDISMODULE_ERR.
+ *
+ * The cursor may be used by the module to represent some progress into the
+ * module's data type. Modules may also store additional cursor-related
+ * information locally and use the cursor as a flag that indicates when
+ * traversal of a new key begins. This is possible because the API makes
+ * a guarantee that concurrent defragmentation of multiple keys will
+ * not be performed.
+ */
+int RM_DefragCursorSet(RedisModuleDefragCtx *ctx, unsigned long cursor) {
+    if (!ctx->cursor)
+        return REDISMODULE_ERR;
+
+    *ctx->cursor = cursor;
+    return REDISMODULE_OK;
+}
+
+/* Fetch a cursor value that has been previously stored using RM_DefragCursorSet().
+ *
+ * If not called for a late defrag operation, REDISMODULE_ERR will be returned and
+ * the cursor should be ignored. See RM_DefragCursorSet() for more details on
+ * defrag cursors.
+ */
+int RM_DefragCursorGet(RedisModuleDefragCtx *ctx, unsigned long *cursor) {
+    if (!ctx->cursor)
+        return REDISMODULE_ERR;
+
+    *cursor = *ctx->cursor;
+    return REDISMODULE_OK;
+}
+
+/* Defrag a memory allocation previously allocated by RM_Alloc, RM_Calloc, etc.
+ * The defragmentation process involves allocating a new memory block and copying
+ * the contents to it, like realloc().
+ *
+ * If defragmentation was not necessary, NULL is returned and the operation has
+ * no other effect.
+ *
+ * If a non-NULL value is returned, the caller should use the new pointer instead
+ * of the old one and update any reference to the old pointer, which must not
+ * be used again.
+ */
+void *RM_DefragAlloc(RedisModuleDefragCtx *ctx, void *ptr) {
+    void *newptr = activeDefragAlloc(ptr);
+    if (newptr)
+        ctx->defragged++;
+
+    return newptr;
+}
+
+/* Defrag a RedisModuleString previously allocated by RM_Alloc, RM_Calloc, etc.
+ * See RM_DefragAlloc() for more information on how the defragmentation process
+ * works.
+ *
+ * NOTE: It is only possible to defrag strings that have a single reference.
+ * Typically this means strings retained with RM_RetainString or RM_HoldString
+ * may not be defragmentable. One exception is command argvs which, if retained
+ * by the module, will end up with a single reference (because the reference
+ * on the Redis side is dropped as soon as the command callback returns).
+ */
+RedisModuleString *RM_DefragRedisModuleString(RedisModuleDefragCtx *ctx, RedisModuleString *str) {
+    return activeDefragStringOb(str, &ctx->defragged);
+}
+
+
+/* Perform a late defrag of a module datatype key.
+ *
+ * Returns a zero value (and initializes the cursor) if no more needs to be done,
+ * or a non-zero value otherwise.
+ */
+int moduleLateDefrag(robj *key, robj *value, unsigned long *cursor, long long endtime, long long *defragged) {
+    moduleValue *mv = value->ptr;
+    moduleType *mt = mv->type;
+
+    RedisModuleDefragCtx defrag_ctx = { 0, endtime, cursor };
+
+    /* Invoke callback. Note that the callback may be missing if the key has been
+     * replaced with a different type since our last visit.
+     */
+    int ret = 0;
+    if (mt->defrag)
+        ret = mt->defrag(&defrag_ctx, key, &mv->value);
+
+    *defragged += defrag_ctx.defragged;
+    if (!ret) {
+        *cursor = 0;    /* No more work to do */
+        return 0;
+    }
+
+    return 1;
+}
+
+/* Attempt to defrag a module data type value. Depending on complexity,
+ * the operation may happen immediately or be scheduled for later.
+ *
+ * Returns 1 if the operation has been completed or 0 if it needs to
+ * be scheduled for late defrag.
+ */
+int moduleDefragValue(robj *key, robj *value, long *defragged) {
+    moduleValue *mv = value->ptr;
+    moduleType *mt = mv->type;
+
+    /* Try to defrag moduleValue itself regardless of whether or not
+     * defrag callbacks are provided.
+     */
+    moduleValue *newmv = activeDefragAlloc(mv);
+    if (newmv) {
+        (*defragged)++;
+        value->ptr = mv = newmv;
+    }
+
+    if (!mt->defrag)
+        return 1;
+
+    /* Use free_effort to determine complexity of module value, and if
+     * necessary schedule it for defragLater instead of quick immediate
+     * defrag.
+     */
+    if (mt->free_effort) {
+        size_t effort = mt->free_effort(key, mv->value);
+        if (!effort)
+            effort = SIZE_MAX;
+        if (effort > server.active_defrag_max_scan_fields) {
+            return 0;  /* Defrag later */
+        }
+    }
+
+    RedisModuleDefragCtx defrag_ctx = { 0, 0, NULL };
+    mt->defrag(&defrag_ctx, key, &mv->value);
+    (*defragged) += defrag_ctx.defragged;
+    return 1;
+}
+
+/* Call registered module API defrag functions */
+long moduleDefragGlobals(void) {
+    dictIterator *di = dictGetIterator(modules);
+    dictEntry *de;
+    long defragged = 0;
+
+    while ((de = dictNext(di)) != NULL) {
+        struct RedisModule *module = dictGetVal(de);
+        if (!module->defrag_cb)
+            continue;
+        RedisModuleDefragCtx defrag_ctx = { 0, 0, NULL };
+        module->defrag_cb(&defrag_ctx);
+        defragged += defrag_ctx.defragged;
+    }
+    dictReleaseIterator(di);
+
+    return defragged;
+}
+
+/* Register all the APIs we export. Keep this function at the end of the
+ * file so that's easy to seek it to add new entries. */
+void moduleRegisterCoreAPI(void) {
+    server.moduleapi = dictCreate(&moduleAPIDictType,NULL);
+    server.sharedapi = dictCreate(&moduleAPIDictType,NULL);
+    REGISTER_API(Alloc);
+    REGISTER_API(Calloc);
+    REGISTER_API(Realloc);
+    REGISTER_API(Free);
+    REGISTER_API(Strdup);
+    REGISTER_API(CreateCommand);
+    REGISTER_API(SetModuleAttribs);
+    REGISTER_API(IsModuleNameBusy);
+    REGISTER_API(WrongArity);
+    REGISTER_API(ReplyWithLongLong);
+    REGISTER_API(ReplyWithError);
+    REGISTER_API(ReplyWithSimpleString);
+    REGISTER_API(ReplyWithArray);
+    REGISTER_API(ReplyWithNullArray);
+    REGISTER_API(ReplyWithEmptyArray);
+    REGISTER_API(ReplySetArrayLength);
+    REGISTER_API(ReplyWithString);
+    REGISTER_API(ReplyWithEmptyString);
+    REGISTER_API(ReplyWithVerbatimString);
+    REGISTER_API(ReplyWithStringBuffer);
+    REGISTER_API(ReplyWithCString);
+    REGISTER_API(ReplyWithNull);
+    REGISTER_API(ReplyWithCallReply);
+    REGISTER_API(ReplyWithDouble);
+    REGISTER_API(ReplyWithLongDouble);
+    REGISTER_API(GetSelectedDb);
+    REGISTER_API(SelectDb);
+    REGISTER_API(OpenKey);
+    REGISTER_API(CloseKey);
+    REGISTER_API(KeyType);
+    REGISTER_API(ValueLength);
+    REGISTER_API(ListPush);
+    REGISTER_API(ListPop);
+    REGISTER_API(StringToLongLong);
+    REGISTER_API(StringToDouble);
+    REGISTER_API(StringToLongDouble);
+    REGISTER_API(StringToStreamID);
+    REGISTER_API(Call);
+    REGISTER_API(CallReplyProto);
+    REGISTER_API(FreeCallReply);
+    REGISTER_API(CallReplyInteger);
+    REGISTER_API(CallReplyType);
+    REGISTER_API(CallReplyLength);
+    REGISTER_API(CallReplyArrayElement);
+    REGISTER_API(CallReplyStringPtr);
+    REGISTER_API(CreateStringFromCallReply);
+    REGISTER_API(CreateString);
+    REGISTER_API(CreateStringFromLongLong);
+    REGISTER_API(CreateStringFromDouble);
+    REGISTER_API(CreateStringFromLongDouble);
+    REGISTER_API(CreateStringFromString);
+    REGISTER_API(CreateStringFromStreamID);
+    REGISTER_API(CreateStringPrintf);
+    REGISTER_API(FreeString);
+    REGISTER_API(StringPtrLen);
+    REGISTER_API(AutoMemory);
+    REGISTER_API(Replicate);
+    REGISTER_API(ReplicateVerbatim);
+    REGISTER_API(DeleteKey);
+    REGISTER_API(UnlinkKey);
+    REGISTER_API(StringSet);
+    REGISTER_API(StringDMA);
+    REGISTER_API(StringTruncate);
+    REGISTER_API(SetExpire);
+    REGISTER_API(GetExpire);
+    REGISTER_API(ResetDataset);
+    REGISTER_API(DbSize);
+    REGISTER_API(RandomKey);
+    REGISTER_API(ZsetAdd);
+    REGISTER_API(ZsetIncrby);
+    REGISTER_API(ZsetScore);
+    REGISTER_API(ZsetRem);
+    REGISTER_API(ZsetRangeStop);
+    REGISTER_API(ZsetFirstInScoreRange);
+    REGISTER_API(ZsetLastInScoreRange);
+    REGISTER_API(ZsetFirstInLexRange);
+    REGISTER_API(ZsetLastInLexRange);
+    REGISTER_API(ZsetRangeCurrentElement);
+    REGISTER_API(ZsetRangeNext);
+    REGISTER_API(ZsetRangePrev);
+    REGISTER_API(ZsetRangeEndReached);
+    REGISTER_API(HashSet);
+    REGISTER_API(HashGet);
+    REGISTER_API(StreamAdd);
+    REGISTER_API(StreamDelete);
+    REGISTER_API(StreamIteratorStart);
+    REGISTER_API(StreamIteratorStop);
+    REGISTER_API(StreamIteratorNextID);
+    REGISTER_API(StreamIteratorNextField);
+    REGISTER_API(StreamIteratorDelete);
+    REGISTER_API(StreamTrimByLength);
+    REGISTER_API(StreamTrimByID);
+    REGISTER_API(IsKeysPositionRequest);
+    REGISTER_API(KeyAtPos);
+    REGISTER_API(GetClientId);
+    REGISTER_API(GetClientUserNameById);
+    REGISTER_API(GetContextFlags);
+    REGISTER_API(AvoidReplicaTraffic);
+    REGISTER_API(PoolAlloc);
+    REGISTER_API(CreateDataType);
+    REGISTER_API(ModuleTypeSetValue);
+    REGISTER_API(ModuleTypeReplaceValue);
+    REGISTER_API(ModuleTypeGetType);
+    REGISTER_API(ModuleTypeGetValue);
+    REGISTER_API(IsIOError);
+    REGISTER_API(SetModuleOptions);
+    REGISTER_API(SignalModifiedKey);
+    REGISTER_API(SaveUnsigned);
+    REGISTER_API(LoadUnsigned);
+    REGISTER_API(SaveSigned);
+    REGISTER_API(LoadSigned);
+    REGISTER_API(SaveString);
+    REGISTER_API(SaveStringBuffer);
+    REGISTER_API(LoadString);
+    REGISTER_API(LoadStringBuffer);
+    REGISTER_API(SaveDouble);
+    REGISTER_API(LoadDouble);
+    REGISTER_API(SaveFloat);
+    REGISTER_API(LoadFloat);
+    REGISTER_API(SaveLongDouble);
+    REGISTER_API(LoadLongDouble);
+    REGISTER_API(SaveDataTypeToString);
+    REGISTER_API(LoadDataTypeFromString);
+    REGISTER_API(EmitAOF);
+    REGISTER_API(Log);
+    REGISTER_API(LogIOError);
+    REGISTER_API(_Assert);
+    REGISTER_API(LatencyAddSample);
+    REGISTER_API(StringAppendBuffer);
+    REGISTER_API(RetainString);
+    REGISTER_API(HoldString);
+    REGISTER_API(StringCompare);
+    REGISTER_API(GetContextFromIO);
+    REGISTER_API(GetKeyNameFromIO);
+    REGISTER_API(GetKeyNameFromModuleKey);
+    REGISTER_API(BlockClient);
+    REGISTER_API(UnblockClient);
+    REGISTER_API(IsBlockedReplyRequest);
+    REGISTER_API(IsBlockedTimeoutRequest);
+    REGISTER_API(GetBlockedClientPrivateData);
+    REGISTER_API(AbortBlock);
+    REGISTER_API(Milliseconds);
+    REGISTER_API(BlockedClientMeasureTimeStart);
+    REGISTER_API(BlockedClientMeasureTimeEnd);
+    REGISTER_API(GetThreadSafeContext);
+    REGISTER_API(GetDetachedThreadSafeContext);
+    REGISTER_API(FreeThreadSafeContext);
+    REGISTER_API(ThreadSafeContextLock);
+    REGISTER_API(ThreadSafeContextTryLock);
+    REGISTER_API(ThreadSafeContextUnlock);
+    REGISTER_API(DigestAddStringBuffer);
+    REGISTER_API(DigestAddLongLong);
+    REGISTER_API(DigestEndSequence);
+    REGISTER_API(NotifyKeyspaceEvent);
+    REGISTER_API(GetNotifyKeyspaceEvents);
+    REGISTER_API(SubscribeToKeyspaceEvents);
+    REGISTER_API(RegisterClusterMessageReceiver);
+    REGISTER_API(SendClusterMessage);
+    REGISTER_API(GetClusterNodeInfo);
+    REGISTER_API(GetClusterNodesList);
+    REGISTER_API(FreeClusterNodesList);
+    REGISTER_API(CreateTimer);
+    REGISTER_API(StopTimer);
+    REGISTER_API(GetTimerInfo);
+    REGISTER_API(GetMyClusterID);
+    REGISTER_API(GetClusterSize);
+    REGISTER_API(GetRandomBytes);
+    REGISTER_API(GetRandomHexChars);
+    REGISTER_API(BlockedClientDisconnected);
+    REGISTER_API(SetDisconnectCallback);
+    REGISTER_API(GetBlockedClientHandle);
+    REGISTER_API(SetClusterFlags);
+    REGISTER_API(CreateDict);
+    REGISTER_API(FreeDict);
+    REGISTER_API(DictSize);
+    REGISTER_API(DictSetC);
+    REGISTER_API(DictReplaceC);
+    REGISTER_API(DictSet);
+    REGISTER_API(DictReplace);
+    REGISTER_API(DictGetC);
+    REGISTER_API(DictGet);
+    REGISTER_API(DictDelC);
+    REGISTER_API(DictDel);
+    REGISTER_API(DictIteratorStartC);
+    REGISTER_API(DictIteratorStart);
+    REGISTER_API(DictIteratorStop);
+    REGISTER_API(DictIteratorReseekC);
+    REGISTER_API(DictIteratorReseek);
+    REGISTER_API(DictNextC);
+    REGISTER_API(DictPrevC);
+    REGISTER_API(DictNext);
+    REGISTER_API(DictPrev);
+    REGISTER_API(DictCompareC);
+    REGISTER_API(DictCompare);
+    REGISTER_API(ExportSharedAPI);
+    REGISTER_API(GetSharedAPI);
+    REGISTER_API(RegisterCommandFilter);
+    REGISTER_API(UnregisterCommandFilter);
+    REGISTER_API(CommandFilterArgsCount);
+    REGISTER_API(CommandFilterArgGet);
+    REGISTER_API(CommandFilterArgInsert);
+    REGISTER_API(CommandFilterArgReplace);
+    REGISTER_API(CommandFilterArgDelete);
+    REGISTER_API(Fork);
+    REGISTER_API(SendChildHeartbeat);
+    REGISTER_API(ExitFromChild);
+    REGISTER_API(KillForkChild);
+    REGISTER_API(RegisterInfoFunc);
+    REGISTER_API(InfoAddSection);
+    REGISTER_API(InfoBeginDictField);
+    REGISTER_API(InfoEndDictField);
+    REGISTER_API(InfoAddFieldString);
+    REGISTER_API(InfoAddFieldCString);
+    REGISTER_API(InfoAddFieldDouble);
+    REGISTER_API(InfoAddFieldLongLong);
+    REGISTER_API(InfoAddFieldULongLong);
+    REGISTER_API(GetServerInfo);
+    REGISTER_API(FreeServerInfo);
+    REGISTER_API(ServerInfoGetField);
+    REGISTER_API(ServerInfoGetFieldC);
+    REGISTER_API(ServerInfoGetFieldSigned);
+    REGISTER_API(ServerInfoGetFieldUnsigned);
+    REGISTER_API(ServerInfoGetFieldDouble);
+    REGISTER_API(GetClientInfoById);
+    REGISTER_API(PublishMessage);
+    REGISTER_API(SubscribeToServerEvent);
+    REGISTER_API(SetLRU);
+    REGISTER_API(GetLRU);
+    REGISTER_API(SetLFU);
+    REGISTER_API(GetLFU);
+    REGISTER_API(BlockClientOnKeys);
+    REGISTER_API(SignalKeyAsReady);
+    REGISTER_API(GetBlockedClientReadyKey);
+    REGISTER_API(GetUsedMemoryRatio);
+    REGISTER_API(MallocSize);
+    REGISTER_API(ScanCursorCreate);
+    REGISTER_API(ScanCursorDestroy);
+    REGISTER_API(ScanCursorRestart);
+    REGISTER_API(Scan);
+    REGISTER_API(ScanKey);
+    REGISTER_API(CreateModuleUser);
+    REGISTER_API(SetModuleUserACL);
+    REGISTER_API(FreeModuleUser);
+    REGISTER_API(DeauthenticateAndCloseClient);
+    REGISTER_API(AuthenticateClientWithACLUser);
+    REGISTER_API(AuthenticateClientWithUser);
+    REGISTER_API(GetContextFlagsAll);
+    REGISTER_API(GetKeyspaceNotificationFlagsAll);
+    REGISTER_API(IsSubEventSupported);
+    REGISTER_API(GetServerVersion);
+    REGISTER_API(GetClientCertificate);
+    REGISTER_API(GetCommandKeys);
+    REGISTER_API(GetCurrentCommandName);
+    REGISTER_API(GetTypeMethodVersion);
+    REGISTER_API(RegisterDefragFunc);
+    REGISTER_API(DefragAlloc);
+    REGISTER_API(DefragRedisModuleString);
+    REGISTER_API(DefragShouldStop);
+    REGISTER_API(DefragCursorSet);
+    REGISTER_API(DefragCursorGet);
+}
diff --git a/redis-stable/src/modules/.gitignore b/redis-stable/src/modules/.gitignore
new file mode 100644
index 00000000..4de1735e
--- /dev/null
+++ b/redis-stable/src/modules/.gitignore
@@ -0,0 +1,2 @@
+*.so
+*.xo
diff --git a/redis-stable/src/modules/Makefile b/redis-stable/src/modules/Makefile
new file mode 100644
index 00000000..3db19e79
--- /dev/null
+++ b/redis-stable/src/modules/Makefile
@@ -0,0 +1,62 @@
+
+# find the OS
+uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
+
+# Compile flags for linux / osx
+ifeq ($(uname_S),Linux)
+	SHOBJ_CFLAGS ?= -W -Wall -fno-common -g -ggdb -std=c99 -O2
+	SHOBJ_LDFLAGS ?= -shared
+else
+	SHOBJ_CFLAGS ?= -W -Wall -dynamic -fno-common -g -ggdb -std=c99 -O2
+	SHOBJ_LDFLAGS ?= -bundle -undefined dynamic_lookup
+endif
+
+.SUFFIXES: .c .so .xo .o
+
+all: helloworld.so hellotype.so helloblock.so hellocluster.so hellotimer.so hellodict.so hellohook.so helloacl.so
+
+.c.xo:
+	$(CC) -I. $(CFLAGS) $(SHOBJ_CFLAGS) -fPIC -c $< -o $@
+
+helloworld.xo: ../redismodule.h
+
+helloworld.so: helloworld.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+hellotype.xo: ../redismodule.h
+
+hellotype.so: hellotype.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+helloblock.xo: ../redismodule.h
+
+helloblock.so: helloblock.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lpthread -lc
+
+hellocluster.xo: ../redismodule.h
+
+hellocluster.so: hellocluster.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+hellotimer.xo: ../redismodule.h
+
+hellotimer.so: hellotimer.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+hellodict.xo: ../redismodule.h
+
+hellodict.so: hellodict.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+hellohook.xo: ../redismodule.h
+
+hellohook.so: hellohook.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+helloacl.xo: ../redismodule.h
+
+helloacl.so: helloacl.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
+
+clean:
+	rm -rf *.xo *.so
diff --git a/redis-stable/src/modules/gendoc.rb b/redis-stable/src/modules/gendoc.rb
new file mode 100644
index 00000000..f83b1ad9
--- /dev/null
+++ b/redis-stable/src/modules/gendoc.rb
@@ -0,0 +1,174 @@
+# coding: utf-8
+# gendoc.rb -- Converts the top-comments inside module.c to modules API
+#              reference documentation in markdown format.
+
+# Convert the C comment to markdown
+def markdown(s)
+    s = s.gsub(/\*\/$/,"")
+    s = s.gsub(/^ ?\* ?/,"")
+    s = s.gsub(/^\/\*\*? ?/,"")
+    s.chop! while s[-1] == "\n" || s[-1] == " "
+    lines = s.split("\n")
+    newlines = []
+    # Fix some markdown, except in code blocks indented by 4 spaces.
+    lines.each{|l|
+        if not l.start_with?('    ')
+            # Rewrite RM_Xyz() to `RedisModule_Xyz()`. The () suffix is
+            # optional. Even RM_Xyz*() with * as wildcard is handled.
+            l = l.gsub(/(?<!`)RM_([A-z]+(?:\*?\(\))?)/, '`RedisModule_\1`')
+            # Add backquotes around RedisModule functions and type where missing.
+            l = l.gsub(/(?<!`)RedisModule[A-z]+(?:\*?\(\))?/){|x| "`#{x}`"}
+            # Add backquotes around c functions like malloc() where missing.
+            l = l.gsub(/(?<![`A-z])[a-z_]+\(\)/, '`\0`')
+            # Add backquotes around macro and var names containing underscores.
+            l = l.gsub(/(?<![`A-z\*])[A-Za-z]+_[A-Za-z0-9_]+/){|x| "`#{x}`"}
+            # Link URLs preceded by space or newline (not already linked)
+            l = l.gsub(/(^| )(https?:\/\/[A-Za-z0-9_\/\.\-]+[A-Za-z0-9\/])/,
+                       '\1[\2](\2)')
+            # Replace double-dash with unicode ndash
+            l = l.gsub(/ -- /, ' – ')
+        end
+        # Link function names to their definition within the page
+        l = l.gsub(/`(RedisModule_[A-z0-9]+)[()]*`/) {|x|
+            $index[$1] ? "[#{x}](\##{$1})" : x
+        }
+        newlines << l
+    }
+    return newlines.join("\n")
+end
+
+# Linebreak a prototype longer than 80 characters on the commas, but only
+# between balanced parentheses so that we don't linebreak args which are
+# function pointers, and then aligning each arg under each other.
+def linebreak_proto(proto, indent)
+    if proto.bytesize <= 80
+        return proto
+    end
+    parts = proto.split(/,\s*/);
+    if parts.length == 1
+        return proto;
+    end
+    align_pos = proto.index("(") + 1;
+    align = " " * align_pos
+    result = parts.shift;
+    bracket_balance = 0;
+    parts.each{|part|
+        if bracket_balance == 0
+            result += ",\n" + indent + align
+        else
+            result += ", "
+        end
+        result += part
+        bracket_balance += part.count("(") - part.count(")")
+    }
+    return result;
+end
+
+# Given the source code array and the index at which an exported symbol was
+# detected, extracts and outputs the documentation.
+def docufy(src,i)
+    m = /RM_[A-z0-9]+/.match(src[i])
+    name = m[0]
+    name = name.sub("RM_","RedisModule_")
+    proto = src[i].sub("{","").strip+";\n"
+    proto = proto.sub("RM_","RedisModule_")
+    proto = linebreak_proto(proto, "    ");
+    # Add a link target with the function name. (We don't trust the exact id of
+    # the generated one, which depends on the Markdown implementation.)
+    puts "<span id=\"#{name}\"></span>\n\n"
+    puts "### `#{name}`\n\n"
+    puts "    #{proto}\n"
+    comment = ""
+    while true
+        i = i-1
+        comment = src[i]+comment
+        break if src[i] =~ /\/\*/
+    end
+    comment = markdown(comment)
+    puts comment+"\n\n"
+end
+
+# Print a comment from line until */ is found, as markdown.
+def section_doc(src, i)
+    name = get_section_heading(src, i)
+    comment = "<span id=\"#{section_name_to_id(name)}\"></span>\n\n"
+    while true
+         # append line, except if it's a horizontal divider
+        comment = comment + src[i] if src[i] !~ /^[\/ ]?\*{1,2} ?-{50,}/
+        break if src[i] =~ /\*\//
+        i = i+1
+    end
+    comment = markdown(comment)
+    puts comment+"\n\n"
+end
+
+# generates an id suitable for links within the page
+def section_name_to_id(name)
+    return "section-" +
+           name.strip.downcase.gsub(/[^a-z0-9]+/, '-').gsub(/^-+|-+$/, '')
+end
+
+# Returns the name of the first section heading in the comment block for which
+# is_section_doc(src, i) is true
+def get_section_heading(src, i)
+    if src[i] =~ /^\/\*\*? \#+ *(.*)/
+        heading = $1
+    elsif src[i+1] =~ /^ ?\* \#+ *(.*)/
+        heading = $1
+    end
+    return heading.gsub(' -- ', ' – ')
+end
+
+# Returns true if the line is the start of a generic documentation section. Such
+# section must start with the # symbol, i.e. a markdown heading, on the first or
+# the second line.
+def is_section_doc(src, i)
+    return src[i] =~ /^\/\*\*? \#/ ||
+           (src[i] =~ /^\/\*/ && src[i+1] =~ /^ ?\* \#/)
+end
+
+def is_func_line(src, i)
+  line = src[i]
+  return line =~ /RM_/ &&
+         line[0] != ' ' && line[0] != '#' && line[0] != '/' &&
+         src[i-1] =~ /\*\//
+end
+
+puts "# Modules API reference\n\n"
+puts "<!-- This file is generated from module.c using gendoc.rb -->\n\n"
+src = File.open(File.dirname(__FILE__) ++ "/../module.c").to_a
+
+# Build function index
+$index = {}
+src.each_with_index do |line,i|
+    if is_func_line(src, i)
+        line =~ /RM_([A-z0-9]+)/
+        name = "RedisModule_#{$1}"
+        $index[name] = true
+    end
+end
+
+# Print TOC
+puts "## Sections\n\n"
+src.each_with_index do |_line,i|
+    if is_section_doc(src, i)
+        name = get_section_heading(src, i)
+        puts "* [#{name}](\##{section_name_to_id(name)})\n"
+    end
+end
+puts "* [Function index](#section-function-index)\n\n"
+
+# Docufy: Print function prototype and markdown docs
+src.each_with_index do |_line,i|
+    if is_func_line(src, i)
+        docufy(src, i)
+    elsif is_section_doc(src, i)
+        section_doc(src, i)
+    end
+end
+
+# Print function index
+puts "<span id=\"section-function-index\"></span>\n\n"
+puts "## Function index\n\n"
+$index.keys.sort.each{|x| puts "* [`#{x}`](\##{x})\n"}
+puts "\n"
diff --git a/redis-stable/src/modules/helloacl.c b/redis-stable/src/modules/helloacl.c
new file mode 100644
index 00000000..6766c0a5
--- /dev/null
+++ b/redis-stable/src/modules/helloacl.c
@@ -0,0 +1,191 @@
+/* ACL API example - An example for performing custom synchronous and
+ * asynchronous password authentication.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright 2019 Amazon.com, Inc. or its affiliates.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <pthread.h>
+#include <unistd.h>
+
+// A simple global user
+static RedisModuleUser *global;
+static uint64_t global_auth_client_id = 0;
+
+/* HELLOACL.REVOKE 
+ * Synchronously revoke access from a user. */
+int RevokeCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (global_auth_client_id) {
+        RedisModule_DeauthenticateAndCloseClient(ctx, global_auth_client_id);
+        return RedisModule_ReplyWithSimpleString(ctx, "OK");
+    } else {
+        return RedisModule_ReplyWithError(ctx, "Global user currently not used");    
+    }
+}
+
+/* HELLOACL.RESET 
+ * Synchronously delete and re-create a module user. */
+int ResetCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_FreeModuleUser(global);
+    global = RedisModule_CreateModuleUser("global");
+    RedisModule_SetModuleUserACL(global, "allcommands");
+    RedisModule_SetModuleUserACL(global, "allkeys");
+    RedisModule_SetModuleUserACL(global, "on");
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* Callback handler for user changes, use this to notify a module of 
+ * changes to users authenticated by the module */
+void HelloACL_UserChanged(uint64_t client_id, void *privdata) {
+    REDISMODULE_NOT_USED(privdata);
+    REDISMODULE_NOT_USED(client_id);
+    global_auth_client_id = 0;
+}
+
+/* HELLOACL.AUTHGLOBAL 
+ * Synchronously assigns a module user to the current context. */
+int AuthGlobalCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (global_auth_client_id) {
+        return RedisModule_ReplyWithError(ctx, "Global user currently used");    
+    }
+
+    RedisModule_AuthenticateClientWithUser(ctx, global, HelloACL_UserChanged, NULL, &global_auth_client_id);
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+#define TIMEOUT_TIME 1000
+
+/* Reply callback for auth command HELLOACL.AUTHASYNC */
+int HelloACL_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    size_t length;
+
+    RedisModuleString *user_string = RedisModule_GetBlockedClientPrivateData(ctx);
+    const char *name = RedisModule_StringPtrLen(user_string, &length);
+
+    if (RedisModule_AuthenticateClientWithACLUser(ctx, name, length, NULL, NULL, NULL) == 
+            REDISMODULE_ERR) {
+        return RedisModule_ReplyWithError(ctx, "Invalid Username or password");    
+    }
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* Timeout callback for auth command HELLOACL.AUTHASYNC */
+int HelloACL_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
+}
+
+/* Private data frees data for HELLOACL.AUTHASYNC command. */
+void HelloACL_FreeData(RedisModuleCtx *ctx, void *privdata) {
+    REDISMODULE_NOT_USED(ctx);
+    RedisModule_FreeString(NULL, privdata);
+}
+
+/* Background authentication can happen here. */
+void *HelloACL_ThreadMain(void *args) {
+    void **targs = args;
+    RedisModuleBlockedClient *bc = targs[0];
+    RedisModuleString *user = targs[1];
+    RedisModule_Free(targs);
+
+    RedisModule_UnblockClient(bc,user);
+    return NULL;
+}
+
+/* HELLOACL.AUTHASYNC 
+ * Asynchronously assigns an ACL user to the current context. */
+int AuthAsyncCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+
+    pthread_t tid;
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx, HelloACL_Reply, HelloACL_Timeout, HelloACL_FreeData, TIMEOUT_TIME);
+    
+
+    void **targs = RedisModule_Alloc(sizeof(void*)*2);
+    targs[0] = bc;
+    targs[1] = RedisModule_CreateStringFromString(NULL, argv[1]);
+
+    if (pthread_create(&tid, NULL, HelloACL_ThreadMain, targs) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx, "-ERR Can't start thread");
+    }
+
+    return REDISMODULE_OK;
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"helloacl",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"helloacl.reset",
+        ResetCommand_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"helloacl.revoke",
+        RevokeCommand_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"helloacl.authglobal",
+        AuthGlobalCommand_RedisCommand,"no-auth",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"helloacl.authasync",
+        AuthAsyncCommand_RedisCommand,"no-auth",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    global = RedisModule_CreateModuleUser("global");
+    RedisModule_SetModuleUserACL(global, "allcommands");
+    RedisModule_SetModuleUserACL(global, "allkeys");
+    RedisModule_SetModuleUserACL(global, "on");
+
+    global_auth_client_id = 0;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/helloblock.c b/redis-stable/src/modules/helloblock.c
new file mode 100644
index 00000000..b90ccaa5
--- /dev/null
+++ b/redis-stable/src/modules/helloblock.c
@@ -0,0 +1,219 @@
+/* Helloblock module -- An example of blocking command implementation
+ * with threads.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <pthread.h>
+#include <unistd.h>
+
+/* Reply callback for blocking command HELLO.BLOCK */
+int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    int *myint = RedisModule_GetBlockedClientPrivateData(ctx);
+    return RedisModule_ReplyWithLongLong(ctx,*myint);
+}
+
+/* Timeout callback for blocking command HELLO.BLOCK */
+int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
+}
+
+/* Private data freeing callback for HELLO.BLOCK command. */
+void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
+    REDISMODULE_NOT_USED(ctx);
+    RedisModule_Free(privdata);
+}
+
+/* The thread entry point that actually executes the blocking part
+ * of the command HELLO.BLOCK. */
+void *HelloBlock_ThreadMain(void *arg) {
+    void **targ = arg;
+    RedisModuleBlockedClient *bc = targ[0];
+    long long delay = (unsigned long)targ[1];
+    RedisModule_Free(targ);
+
+    sleep(delay);
+    int *r = RedisModule_Alloc(sizeof(int));
+    *r = rand();
+    RedisModule_UnblockClient(bc,r);
+    return NULL;
+}
+
+/* An example blocked client disconnection callback.
+ *
+ * Note that in the case of the HELLO.BLOCK command, the blocked client is now
+ * owned by the thread calling sleep(). In this specific case, there is not
+ * much we can do, however normally we could instead implement a way to
+ * signal the thread that the client disconnected, and sleep the specified
+ * amount of seconds with a while loop calling sleep(1), so that once we
+ * detect the client disconnection, we can terminate the thread ASAP. */
+void HelloBlock_Disconnected(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc) {
+    RedisModule_Log(ctx,"warning","Blocked client %p disconnected!",
+        (void*)bc);
+
+    /* Here you should cleanup your state / threads, and if possible
+     * call RedisModule_UnblockClient(), or notify the thread that will
+     * call the function ASAP. */
+}
+
+/* HELLO.BLOCK <delay> <timeout> -- Block for <count> seconds, then reply with
+ * a random number. Timeout is the command timeout, so that you can test
+ * what happens when the delay is greater than the timeout. */
+int HelloBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    long long delay;
+    long long timeout;
+
+    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    pthread_t tid;
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
+
+    /* Here we set a disconnection handler, however since this module will
+     * block in sleep() in a thread, there is not much we can do in the
+     * callback, so this is just to show you the API. */
+    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
+
+    /* Now that we setup a blocking client, we need to pass the control
+     * to the thread. However we need to pass arguments to the thread:
+     * the delay and a reference to the blocked client handle. */
+    void **targ = RedisModule_Alloc(sizeof(void*)*2);
+    targ[0] = bc;
+    targ[1] = (void*)(unsigned long) delay;
+
+    if (pthread_create(&tid,NULL,HelloBlock_ThreadMain,targ) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    }
+    return REDISMODULE_OK;
+}
+
+/* The thread entry point that actually executes the blocking part
+ * of the command HELLO.KEYS.
+ *
+ * Note: this implementation is very simple on purpose, so no duplicated
+ * keys (returned by SCAN) are filtered. However adding such a functionality
+ * would be trivial just using any data structure implementing a dictionary
+ * in order to filter the duplicated items. */
+void *HelloKeys_ThreadMain(void *arg) {
+    RedisModuleBlockedClient *bc = arg;
+    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bc);
+    long long cursor = 0;
+    size_t replylen = 0;
+
+    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+    do {
+        RedisModule_ThreadSafeContextLock(ctx);
+        RedisModuleCallReply *reply = RedisModule_Call(ctx,
+            "SCAN","l",(long long)cursor);
+        RedisModule_ThreadSafeContextUnlock(ctx);
+
+        RedisModuleCallReply *cr_cursor =
+            RedisModule_CallReplyArrayElement(reply,0);
+        RedisModuleCallReply *cr_keys =
+            RedisModule_CallReplyArrayElement(reply,1);
+
+        RedisModuleString *s = RedisModule_CreateStringFromCallReply(cr_cursor);
+        RedisModule_StringToLongLong(s,&cursor);
+        RedisModule_FreeString(ctx,s);
+
+        size_t items = RedisModule_CallReplyLength(cr_keys);
+        for (size_t j = 0; j < items; j++) {
+            RedisModuleCallReply *ele =
+                RedisModule_CallReplyArrayElement(cr_keys,j);
+            RedisModule_ReplyWithCallReply(ctx,ele);
+            replylen++;
+        }
+        RedisModule_FreeCallReply(reply);
+    } while (cursor != 0);
+    RedisModule_ReplySetArrayLength(ctx,replylen);
+
+    RedisModule_FreeThreadSafeContext(ctx);
+    RedisModule_UnblockClient(bc,NULL);
+    return NULL;
+}
+
+/* HELLO.KEYS -- Return all the keys in the current database without blocking
+ * the server. The keys do not represent a point-in-time state so only the keys
+ * that were in the database from the start to the end are guaranteed to be
+ * there. */
+int HelloKeys_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    if (argc != 1) return RedisModule_WrongArity(ctx);
+
+    pthread_t tid;
+
+    /* Note that when blocking the client we do not set any callback: no
+     * timeout is possible since we passed '0', nor we need a reply callback
+     * because we'll use the thread safe context to accumulate a reply. */
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,NULL,NULL,NULL,0);
+
+    /* Now that we setup a blocking client, we need to pass the control
+     * to the thread. However we need to pass arguments to the thread:
+     * the reference to the blocked client handle. */
+    if (pthread_create(&tid,NULL,HelloKeys_ThreadMain,bc) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    }
+    return REDISMODULE_OK;
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"helloblock",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.block",
+        HelloBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"hello.keys",
+        HelloKeys_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/hellocluster.c b/redis-stable/src/modules/hellocluster.c
new file mode 100644
index 00000000..cb78187f
--- /dev/null
+++ b/redis-stable/src/modules/hellocluster.c
@@ -0,0 +1,118 @@
+/* Helloworld cluster -- A ping/pong cluster API example.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+
+#define MSGTYPE_PING 1
+#define MSGTYPE_PONG 2
+
+/* HELLOCLUSTER.PINGALL */
+int PingallCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_SendClusterMessage(ctx,NULL,MSGTYPE_PING,(unsigned char*)"Hey",3);
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* HELLOCLUSTER.LIST */
+int ListCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    size_t numnodes;
+    char **ids = RedisModule_GetClusterNodesList(ctx,&numnodes);
+    if (ids == NULL) {
+        return RedisModule_ReplyWithError(ctx,"Cluster not enabled");
+    }
+
+    RedisModule_ReplyWithArray(ctx,numnodes);
+    for (size_t j = 0; j < numnodes; j++) {
+        int port;
+        RedisModule_GetClusterNodeInfo(ctx,ids[j],NULL,NULL,&port,NULL);
+        RedisModule_ReplyWithArray(ctx,2);
+        RedisModule_ReplyWithStringBuffer(ctx,ids[j],REDISMODULE_NODE_ID_LEN);
+        RedisModule_ReplyWithLongLong(ctx,port);
+    }
+    RedisModule_FreeClusterNodesList(ids);
+    return REDISMODULE_OK;
+}
+
+/* Callback for message MSGTYPE_PING */
+void PingReceiver(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len) {
+    RedisModule_Log(ctx,"notice","PING (type %d) RECEIVED from %.*s: '%.*s'",
+        type,REDISMODULE_NODE_ID_LEN,sender_id,(int)len, payload);
+    RedisModule_SendClusterMessage(ctx,NULL,MSGTYPE_PONG,(unsigned char*)"Ohi!",4);
+    RedisModule_Call(ctx, "INCR", "c", "pings_received");
+}
+
+/* Callback for message MSGTYPE_PONG. */
+void PongReceiver(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len) {
+    RedisModule_Log(ctx,"notice","PONG (type %d) RECEIVED from %.*s: '%.*s'",
+        type,REDISMODULE_NODE_ID_LEN,sender_id,(int)len, payload);
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"hellocluster",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellocluster.pingall",
+        PingallCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellocluster.list",
+        ListCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    /* Disable Redis Cluster sharding and redirections. This way every node
+     * will be able to access every possible key, regardless of the hash slot.
+     * This way the PING message handler will be able to increment a specific
+     * variable. Normally you do that in order for the distributed system
+     * you create as a module to have total freedom in the keyspace
+     * manipulation. */
+    RedisModule_SetClusterFlags(ctx,REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION);
+
+    /* Register our handlers for different message types. */
+    RedisModule_RegisterClusterMessageReceiver(ctx,MSGTYPE_PING,PingReceiver);
+    RedisModule_RegisterClusterMessageReceiver(ctx,MSGTYPE_PONG,PongReceiver);
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/hellodict.c b/redis-stable/src/modules/hellodict.c
new file mode 100644
index 00000000..1428a138
--- /dev/null
+++ b/redis-stable/src/modules/hellodict.c
@@ -0,0 +1,132 @@
+/* Hellodict -- An example of modules dictionary API
+ *
+ * This module implements a volatile key-value store on top of the
+ * dictionary exported by the Redis modules API.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+
+static RedisModuleDict *Keyspace;
+
+/* HELLODICT.SET <key> <value>
+ *
+ * Set the specified key to the specified value. */
+int cmd_SET(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    RedisModule_DictSet(Keyspace,argv[1],argv[2]);
+    /* We need to keep a reference to the value stored at the key, otherwise
+     * it would be freed when this callback returns. */
+    RedisModule_RetainString(NULL,argv[2]);
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* HELLODICT.GET <key>
+ *
+ * Return the value of the specified key, or a null reply if the key
+ * is not defined. */
+int cmd_GET(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    RedisModuleString *val = RedisModule_DictGet(Keyspace,argv[1],NULL);
+    if (val == NULL) {
+        return RedisModule_ReplyWithNull(ctx);
+    } else {
+        return RedisModule_ReplyWithString(ctx, val);
+    }
+}
+
+/* HELLODICT.KEYRANGE <startkey> <endkey> <count>
+ *
+ * Return a list of matching keys, lexicographically between startkey
+ * and endkey. No more than 'count' items are emitted. */
+int cmd_KEYRANGE(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+
+    /* Parse the count argument. */
+    long long count;
+    if (RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    /* Seek the iterator. */
+    RedisModuleDictIter *iter = RedisModule_DictIteratorStart(
+        Keyspace, ">=", argv[1]);
+
+    /* Reply with the matching items. */
+    char *key;
+    size_t keylen;
+    long long replylen = 0; /* Keep track of the amitted array len. */
+    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+    while((key = RedisModule_DictNextC(iter,&keylen,NULL)) != NULL) {
+        if (replylen >= count) break;
+        if (RedisModule_DictCompare(iter,"<=",argv[2]) == REDISMODULE_ERR)
+            break;
+        RedisModule_ReplyWithStringBuffer(ctx,key,keylen);
+        replylen++;
+    }
+    RedisModule_ReplySetArrayLength(ctx,replylen);
+
+    /* Cleanup. */
+    RedisModule_DictIteratorStop(iter);
+    return REDISMODULE_OK;
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"hellodict",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellodict.set",
+        cmd_SET,"write deny-oom",1,1,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellodict.get",
+        cmd_GET,"readonly",1,1,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellodict.keyrange",
+        cmd_KEYRANGE,"readonly",1,1,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    /* Create our global dictionary. Here we'll set our keys and values. */
+    Keyspace = RedisModule_CreateDict(NULL);
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/hellohook.c b/redis-stable/src/modules/hellohook.c
new file mode 100644
index 00000000..b451bd97
--- /dev/null
+++ b/redis-stable/src/modules/hellohook.c
@@ -0,0 +1,93 @@
+/* Server hooks API example
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+
+/* Client state change callback. */
+void clientChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(ctx);
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleClientInfo *ci = data;
+    printf("Client %s event for client #%llu %s:%d\n",
+        (sub == REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED) ?
+            "connection" : "disconnection",
+        (unsigned long long)ci->id,ci->addr,ci->port);
+}
+
+void flushdbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(ctx);
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleFlushInfo *fi = data;
+    if (sub == REDISMODULE_SUBEVENT_FLUSHDB_START) {
+        if (fi->dbnum != -1) {
+            RedisModuleCallReply *reply;
+            reply = RedisModule_Call(ctx,"DBSIZE","");
+            long long numkeys = RedisModule_CallReplyInteger(reply);
+            printf("FLUSHDB event of database %d started (%lld keys in DB)\n",
+                fi->dbnum, numkeys);
+            RedisModule_FreeCallReply(reply);
+        } else {
+            printf("FLUSHALL event started\n");
+        }
+    } else {
+        if (fi->dbnum != -1) {
+            printf("FLUSHDB event of database %d ended\n",fi->dbnum);
+        } else {
+            printf("FLUSHALL event ended\n");
+        }
+    }
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"hellohook",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ClientChange, clientChangeCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_FlushDB, flushdbCallback);
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/hellotimer.c b/redis-stable/src/modules/hellotimer.c
new file mode 100644
index 00000000..f6700df2
--- /dev/null
+++ b/redis-stable/src/modules/hellotimer.c
@@ -0,0 +1,76 @@
+/* Timer API example -- Register and handle timer events
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+
+/* Timer callback. */
+void timerHandler(RedisModuleCtx *ctx, void *data) {
+    REDISMODULE_NOT_USED(ctx);
+    printf("Fired %s!\n", (char *)data);
+    RedisModule_Free(data);
+}
+
+/* HELLOTIMER.TIMER*/
+int TimerCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    for (int j = 0; j < 10; j++) {
+        int delay = rand() % 5000;
+        char *buf = RedisModule_Alloc(256);
+        snprintf(buf,256,"After %d", delay);
+        RedisModuleTimerID tid = RedisModule_CreateTimer(ctx,delay,timerHandler,buf);
+        REDISMODULE_NOT_USED(tid);
+    }
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"hellotimer",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellotimer.timer",
+        TimerCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/hellotype.c b/redis-stable/src/modules/hellotype.c
new file mode 100644
index 00000000..4f2d1d73
--- /dev/null
+++ b/redis-stable/src/modules/hellotype.c
@@ -0,0 +1,362 @@
+/* This file implements a new module native data type called "HELLOTYPE".
+ * The data structure implemented is a very simple ordered linked list of
+ * 64 bit integers, in order to have something that is real world enough, but
+ * at the same time, extremely simple to understand, to show how the API
+ * works, how a new data type is created, and how to write basic methods
+ * for RDB loading, saving and AOF rewriting.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+#include <stdint.h>
+
+static RedisModuleType *HelloType;
+
+/* ========================== Internal data structure  =======================
+ * This is just a linked list of 64 bit integers where elements are inserted
+ * in-place, so it's ordered. There is no pop/push operation but just insert
+ * because it is enough to show the implementation of new data types without
+ * making things complex. */
+
+struct HelloTypeNode {
+    int64_t value;
+    struct HelloTypeNode *next;
+};
+
+struct HelloTypeObject {
+    struct HelloTypeNode *head;
+    size_t len; /* Number of elements added. */
+};
+
+struct HelloTypeObject *createHelloTypeObject(void) {
+    struct HelloTypeObject *o;
+    o = RedisModule_Alloc(sizeof(*o));
+    o->head = NULL;
+    o->len = 0;
+    return o;
+}
+
+void HelloTypeInsert(struct HelloTypeObject *o, int64_t ele) {
+    struct HelloTypeNode *next = o->head, *newnode, *prev = NULL;
+
+    while(next && next->value < ele) {
+        prev = next;
+        next = next->next;
+    }
+    newnode = RedisModule_Alloc(sizeof(*newnode));
+    newnode->value = ele;
+    newnode->next = next;
+    if (prev) {
+        prev->next = newnode;
+    } else {
+        o->head = newnode;
+    }
+    o->len++;
+}
+
+void HelloTypeReleaseObject(struct HelloTypeObject *o) {
+    struct HelloTypeNode *cur, *next;
+    cur = o->head;
+    while(cur) {
+        next = cur->next;
+        RedisModule_Free(cur);
+        cur = next;
+    }
+    RedisModule_Free(o);
+}
+
+/* ========================= "hellotype" type commands ======================= */
+
+/* HELLOTYPE.INSERT key value */
+int HelloTypeInsert_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != HelloType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    long long value;
+    if ((RedisModule_StringToLongLong(argv[2],&value) != REDISMODULE_OK)) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid value: must be a signed 64 bit integer");
+    }
+
+    /* Create an empty value object if the key is currently empty. */
+    struct HelloTypeObject *hto;
+    if (type == REDISMODULE_KEYTYPE_EMPTY) {
+        hto = createHelloTypeObject();
+        RedisModule_ModuleTypeSetValue(key,HelloType,hto);
+    } else {
+        hto = RedisModule_ModuleTypeGetValue(key);
+    }
+
+    /* Insert the new element. */
+    HelloTypeInsert(hto,value);
+    RedisModule_SignalKeyAsReady(ctx,argv[1]);
+
+    RedisModule_ReplyWithLongLong(ctx,hto->len);
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+/* HELLOTYPE.RANGE key first count */
+int HelloTypeRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != HelloType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    long long first, count;
+    if (RedisModule_StringToLongLong(argv[2],&first) != REDISMODULE_OK ||
+        RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK ||
+        first < 0 || count < 0)
+    {
+        return RedisModule_ReplyWithError(ctx,
+            "ERR invalid first or count parameters");
+    }
+
+    struct HelloTypeObject *hto = RedisModule_ModuleTypeGetValue(key);
+    struct HelloTypeNode *node = hto ? hto->head : NULL;
+    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+    long long arraylen = 0;
+    while(node && count--) {
+        RedisModule_ReplyWithLongLong(ctx,node->value);
+        arraylen++;
+        node = node->next;
+    }
+    RedisModule_ReplySetArrayLength(ctx,arraylen);
+    return REDISMODULE_OK;
+}
+
+/* HELLOTYPE.LEN key */
+int HelloTypeLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != HelloType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    struct HelloTypeObject *hto = RedisModule_ModuleTypeGetValue(key);
+    RedisModule_ReplyWithLongLong(ctx,hto ? hto->len : 0);
+    return REDISMODULE_OK;
+}
+
+/* ====================== Example of a blocking command ==================== */
+
+/* Reply callback for blocking command HELLOTYPE.BRANGE, this will get
+ * called when the key we blocked for is ready: we need to check if we
+ * can really serve the client, and reply OK or ERR accordingly. */
+int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,keyname,REDISMODULE_READ);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_MODULE ||
+        RedisModule_ModuleTypeGetType(key) != HelloType)
+    {
+        RedisModule_CloseKey(key);
+        return REDISMODULE_ERR;
+    }
+
+    /* In case the key is able to serve our blocked client, let's directly
+     * use our original command implementation to make this example simpler. */
+    RedisModule_CloseKey(key);
+    return HelloTypeRange_RedisCommand(ctx,argv,argc-1);
+}
+
+/* Timeout callback for blocking command HELLOTYPE.BRANGE */
+int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
+}
+
+/* Private data freeing callback for HELLOTYPE.BRANGE command. */
+void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
+    REDISMODULE_NOT_USED(ctx);
+    RedisModule_Free(privdata);
+}
+
+/* HELLOTYPE.BRANGE key first count timeout -- This is a blocking verison of
+ * the RANGE operation, in order to show how to use the API
+ * RedisModule_BlockClientOnKeys(). */
+int HelloTypeBRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 5) return RedisModule_WrongArity(ctx);
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != HelloType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    /* Parse the timeout before even trying to serve the client synchronously,
+     * so that we always fail ASAP on syntax errors. */
+    long long timeout;
+    if (RedisModule_StringToLongLong(argv[4],&timeout) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,
+            "ERR invalid timeout parameter");
+    }
+
+    /* Can we serve the reply synchronously? */
+    if (type != REDISMODULE_KEYTYPE_EMPTY) {
+        return HelloTypeRange_RedisCommand(ctx,argv,argc-1);
+    }
+
+    /* Otherwise let's block on the key. */
+    void *privdata = RedisModule_Alloc(100);
+    RedisModule_BlockClientOnKeys(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout,argv+1,1,privdata);
+    return REDISMODULE_OK;
+}
+
+/* ========================== "hellotype" type methods ======================= */
+
+void *HelloTypeRdbLoad(RedisModuleIO *rdb, int encver) {
+    if (encver != 0) {
+        /* RedisModule_Log("warning","Can't load data with version %d", encver);*/
+        return NULL;
+    }
+    uint64_t elements = RedisModule_LoadUnsigned(rdb);
+    struct HelloTypeObject *hto = createHelloTypeObject();
+    while(elements--) {
+        int64_t ele = RedisModule_LoadSigned(rdb);
+        HelloTypeInsert(hto,ele);
+    }
+    return hto;
+}
+
+void HelloTypeRdbSave(RedisModuleIO *rdb, void *value) {
+    struct HelloTypeObject *hto = value;
+    struct HelloTypeNode *node = hto->head;
+    RedisModule_SaveUnsigned(rdb,hto->len);
+    while(node) {
+        RedisModule_SaveSigned(rdb,node->value);
+        node = node->next;
+    }
+}
+
+void HelloTypeAofRewrite(RedisModuleIO *aof, RedisModuleString *key, void *value) {
+    struct HelloTypeObject *hto = value;
+    struct HelloTypeNode *node = hto->head;
+    while(node) {
+        RedisModule_EmitAOF(aof,"HELLOTYPE.INSERT","sl",key,node->value);
+        node = node->next;
+    }
+}
+
+/* The goal of this function is to return the amount of memory used by
+ * the HelloType value. */
+size_t HelloTypeMemUsage(const void *value) {
+    const struct HelloTypeObject *hto = value;
+    struct HelloTypeNode *node = hto->head;
+    return sizeof(*hto) + sizeof(*node)*hto->len;
+}
+
+void HelloTypeFree(void *value) {
+    HelloTypeReleaseObject(value);
+}
+
+void HelloTypeDigest(RedisModuleDigest *md, void *value) {
+    struct HelloTypeObject *hto = value;
+    struct HelloTypeNode *node = hto->head;
+    while(node) {
+        RedisModule_DigestAddLongLong(md,node->value);
+        node = node->next;
+    }
+    RedisModule_DigestEndSequence(md);
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"hellotype",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    RedisModuleTypeMethods tm = {
+        .version = REDISMODULE_TYPE_METHOD_VERSION,
+        .rdb_load = HelloTypeRdbLoad,
+        .rdb_save = HelloTypeRdbSave,
+        .aof_rewrite = HelloTypeAofRewrite,
+        .mem_usage = HelloTypeMemUsage,
+        .free = HelloTypeFree,
+        .digest = HelloTypeDigest
+    };
+
+    HelloType = RedisModule_CreateDataType(ctx,"hellotype",0,&tm);
+    if (HelloType == NULL) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellotype.insert",
+        HelloTypeInsert_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellotype.range",
+        HelloTypeRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellotype.len",
+        HelloTypeLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hellotype.brange",
+        HelloTypeBRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/modules/helloworld.c b/redis-stable/src/modules/helloworld.c
new file mode 100644
index 00000000..043f5be3
--- /dev/null
+++ b/redis-stable/src/modules/helloworld.c
@@ -0,0 +1,621 @@
+/* Helloworld module -- A few examples of the Redis Modules API in the form
+ * of commands showing how to accomplish common tasks.
+ *
+ * This module does not do anything useful, if not for a few commands. The
+ * examples are designed in order to show the API.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "../redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+
+/* HELLO.SIMPLE is among the simplest commands you can implement.
+ * It just returns the currently selected DB id, a functionality which is
+ * missing in Redis. The command uses two important API calls: one to
+ * fetch the currently selected DB, the other in order to send the client
+ * an integer reply as response. */
+int HelloSimple_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModule_ReplyWithLongLong(ctx,RedisModule_GetSelectedDb(ctx));
+    return REDISMODULE_OK;
+}
+
+/* HELLO.PUSH.NATIVE re-implements RPUSH, and shows the low level modules API
+ * where you can "open" keys, make low level operations, create new keys by
+ * pushing elements into non-existing keys, and so forth.
+ *
+ * You'll find this command to be roughly as fast as the actual RPUSH
+ * command. */
+int HelloPushNative_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+
+    RedisModule_ListPush(key,REDISMODULE_LIST_TAIL,argv[2]);
+    size_t newlen = RedisModule_ValueLength(key);
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithLongLong(ctx,newlen);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.PUSH.CALL implements RPUSH using an higher level approach, calling
+ * a Redis command instead of working with the key in a low level way. This
+ * approach is useful when you need to call Redis commands that are not
+ * available as low level APIs, or when you don't need the maximum speed
+ * possible but instead prefer implementation simplicity. */
+int HelloPushCall_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply *reply;
+
+    reply = RedisModule_Call(ctx,"RPUSH","ss",argv[1],argv[2]);
+    long long len = RedisModule_CallReplyInteger(reply);
+    RedisModule_FreeCallReply(reply);
+    RedisModule_ReplyWithLongLong(ctx,len);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.PUSH.CALL2
+ * This is exactly as HELLO.PUSH.CALL, but shows how we can reply to the
+ * client using directly a reply object that Call() returned. */
+int HelloPushCall2_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply *reply;
+
+    reply = RedisModule_Call(ctx,"RPUSH","ss",argv[1],argv[2]);
+    RedisModule_ReplyWithCallReply(ctx,reply);
+    RedisModule_FreeCallReply(reply);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.LIST.SUM.LEN returns the total length of all the items inside
+ * a Redis list, by using the high level Call() API.
+ * This command is an example of the array reply access. */
+int HelloListSumLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply *reply;
+
+    reply = RedisModule_Call(ctx,"LRANGE","sll",argv[1],(long long)0,(long long)-1);
+    size_t strlen = 0;
+    size_t items = RedisModule_CallReplyLength(reply);
+    size_t j;
+    for (j = 0; j < items; j++) {
+        RedisModuleCallReply *ele = RedisModule_CallReplyArrayElement(reply,j);
+        strlen += RedisModule_CallReplyLength(ele);
+    }
+    RedisModule_FreeCallReply(reply);
+    RedisModule_ReplyWithLongLong(ctx,strlen);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.LIST.SPLICE srclist dstlist count
+ * Moves 'count' elements from the tail of 'srclist' to the head of
+ * 'dstlist'. If less than count elements are available, it moves as much
+ * elements as possible. */
+int HelloListSplice_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *srckey = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    RedisModuleKey *dstkey = RedisModule_OpenKey(ctx,argv[2],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+
+    /* Src and dst key must be empty or lists. */
+    if ((RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_LIST &&
+         RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_EMPTY) ||
+        (RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_LIST &&
+         RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_EMPTY))
+    {
+        RedisModule_CloseKey(srckey);
+        RedisModule_CloseKey(dstkey);
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    long long count;
+    if ((RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) ||
+        (count < 0)) {
+        RedisModule_CloseKey(srckey);
+        RedisModule_CloseKey(dstkey);
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    while(count-- > 0) {
+        RedisModuleString *ele;
+
+        ele = RedisModule_ListPop(srckey,REDISMODULE_LIST_TAIL);
+        if (ele == NULL) break;
+        RedisModule_ListPush(dstkey,REDISMODULE_LIST_HEAD,ele);
+        RedisModule_FreeString(ctx,ele);
+    }
+
+    size_t len = RedisModule_ValueLength(srckey);
+    RedisModule_CloseKey(srckey);
+    RedisModule_CloseKey(dstkey);
+    RedisModule_ReplyWithLongLong(ctx,len);
+    return REDISMODULE_OK;
+}
+
+/* Like the HELLO.LIST.SPLICE above, but uses automatic memory management
+ * in order to avoid freeing stuff. */
+int HelloListSpliceAuto_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+
+    RedisModule_AutoMemory(ctx);
+
+    RedisModuleKey *srckey = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    RedisModuleKey *dstkey = RedisModule_OpenKey(ctx,argv[2],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+
+    /* Src and dst key must be empty or lists. */
+    if ((RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_LIST &&
+         RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_EMPTY) ||
+        (RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_LIST &&
+         RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_EMPTY))
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    long long count;
+    if ((RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) ||
+        (count < 0))
+    {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    while(count-- > 0) {
+        RedisModuleString *ele;
+
+        ele = RedisModule_ListPop(srckey,REDISMODULE_LIST_TAIL);
+        if (ele == NULL) break;
+        RedisModule_ListPush(dstkey,REDISMODULE_LIST_HEAD,ele);
+    }
+
+    size_t len = RedisModule_ValueLength(srckey);
+    RedisModule_ReplyWithLongLong(ctx,len);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.RAND.ARRAY <count>
+ * Shows how to generate arrays as commands replies.
+ * It just outputs <count> random numbers. */
+int HelloRandArray_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    long long count;
+    if (RedisModule_StringToLongLong(argv[1],&count) != REDISMODULE_OK ||
+        count < 0)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+
+    /* To reply with an array, we call RedisModule_ReplyWithArray() followed
+     * by other "count" calls to other reply functions in order to generate
+     * the elements of the array. */
+    RedisModule_ReplyWithArray(ctx,count);
+    while(count--) RedisModule_ReplyWithLongLong(ctx,rand());
+    return REDISMODULE_OK;
+}
+
+/* This is a simple command to test replication. Because of the "!" modified
+ * in the RedisModule_Call() call, the two INCRs get replicated.
+ * Also note how the ECHO is replicated in an unexpected position (check
+ * comments the function implementation). */
+int HelloRepl1_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModule_AutoMemory(ctx);
+
+    /* This will be replicated *after* the two INCR statements, since
+     * the Call() replication has precedence, so the actual replication
+     * stream will be:
+     *
+     * MULTI
+     * INCR foo
+     * INCR bar
+     * ECHO c foo
+     * EXEC
+     */
+    RedisModule_Replicate(ctx,"ECHO","c","foo");
+
+    /* Using the "!" modifier we replicate the command if it
+     * modified the dataset in some way. */
+    RedisModule_Call(ctx,"INCR","c!","foo");
+    RedisModule_Call(ctx,"INCR","c!","bar");
+
+    RedisModule_ReplyWithLongLong(ctx,0);
+
+    return REDISMODULE_OK;
+}
+
+/* Another command to show replication. In this case, we call
+ * RedisModule_ReplicateVerbatim() to mean we want just the command to be
+ * propagated to slaves / AOF exactly as it was called by the user.
+ *
+ * This command also shows how to work with string objects.
+ * It takes a list, and increments all the elements (that must have
+ * a numerical value) by 1, returning the sum of all the elements
+ * as reply.
+ *
+ * Usage: HELLO.REPL2 <list-key> */
+int HelloRepl2_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+
+    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_LIST)
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+
+    size_t listlen = RedisModule_ValueLength(key);
+    long long sum = 0;
+
+    /* Rotate and increment. */
+    while(listlen--) {
+        RedisModuleString *ele = RedisModule_ListPop(key,REDISMODULE_LIST_TAIL);
+        long long val;
+        if (RedisModule_StringToLongLong(ele,&val) != REDISMODULE_OK) val = 0;
+        val++;
+        sum += val;
+        RedisModuleString *newele = RedisModule_CreateStringFromLongLong(ctx,val);
+        RedisModule_ListPush(key,REDISMODULE_LIST_HEAD,newele);
+    }
+    RedisModule_ReplyWithLongLong(ctx,sum);
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+/* This is an example of strings DMA access. Given a key containing a string
+ * it toggles the case of each character from lower to upper case or the
+ * other way around.
+ *
+ * No automatic memory management is used in this example (for the sake
+ * of variety).
+ *
+ * HELLO.TOGGLE.CASE key */
+int HelloToggleCase_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+
+    int keytype = RedisModule_KeyType(key);
+    if (keytype != REDISMODULE_KEYTYPE_STRING &&
+        keytype != REDISMODULE_KEYTYPE_EMPTY)
+    {
+        RedisModule_CloseKey(key);
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    if (keytype == REDISMODULE_KEYTYPE_STRING) {
+        size_t len, j;
+        char *s = RedisModule_StringDMA(key,&len,REDISMODULE_WRITE);
+        for (j = 0; j < len; j++) {
+            if (isupper(s[j])) {
+                s[j] = tolower(s[j]);
+            } else {
+                s[j] = toupper(s[j]);
+            }
+        }
+    }
+
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.MORE.EXPIRE key milliseconds.
+ *
+ * If the key has already an associated TTL, extends it by "milliseconds"
+ * milliseconds. Otherwise no operation is performed. */
+int HelloMoreExpire_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+
+    mstime_t addms, expire;
+
+    if (RedisModule_StringToLongLong(argv[2],&addms) != REDISMODULE_OK)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid expire time");
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    expire = RedisModule_GetExpire(key);
+    if (expire != REDISMODULE_NO_EXPIRE) {
+        expire += addms;
+        RedisModule_SetExpire(key,expire);
+    }
+    return RedisModule_ReplyWithSimpleString(ctx,"OK");
+}
+
+/* HELLO.ZSUMRANGE key startscore endscore
+ * Return the sum of all the scores elements between startscore and endscore.
+ *
+ * The computation is performed two times, one time from start to end and
+ * another time backward. The two scores, returned as a two element array,
+ * should match.*/
+int HelloZsumRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    double score_start, score_end;
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+
+    if (RedisModule_StringToDouble(argv[2],&score_start) != REDISMODULE_OK ||
+        RedisModule_StringToDouble(argv[3],&score_end) != REDISMODULE_OK)
+    {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid range");
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_ZSET) {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    double scoresum_a = 0;
+    double scoresum_b = 0;
+
+    RedisModule_ZsetFirstInScoreRange(key,score_start,score_end,0,0);
+    while(!RedisModule_ZsetRangeEndReached(key)) {
+        double score;
+        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
+        RedisModule_FreeString(ctx,ele);
+        scoresum_a += score;
+        RedisModule_ZsetRangeNext(key);
+    }
+    RedisModule_ZsetRangeStop(key);
+
+    RedisModule_ZsetLastInScoreRange(key,score_start,score_end,0,0);
+    while(!RedisModule_ZsetRangeEndReached(key)) {
+        double score;
+        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
+        RedisModule_FreeString(ctx,ele);
+        scoresum_b += score;
+        RedisModule_ZsetRangePrev(key);
+    }
+
+    RedisModule_ZsetRangeStop(key);
+
+    RedisModule_CloseKey(key);
+
+    RedisModule_ReplyWithArray(ctx,2);
+    RedisModule_ReplyWithDouble(ctx,scoresum_a);
+    RedisModule_ReplyWithDouble(ctx,scoresum_b);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.LEXRANGE key min_lex max_lex min_age max_age
+ * This command expects a sorted set stored at key in the following form:
+ * - All the elements have score 0.
+ * - Elements are pairs of "<name>:<age>", for example "Anna:52".
+ * The command will return all the sorted set items that are lexicographically
+ * between the specified range (using the same format as ZRANGEBYLEX)
+ * and having an age between min_age and max_age. */
+int HelloLexRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 6) return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_ZSET) {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    if (RedisModule_ZsetFirstInLexRange(key,argv[2],argv[3]) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"invalid range");
+    }
+
+    int arraylen = 0;
+    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
+    while(!RedisModule_ZsetRangeEndReached(key)) {
+        double score;
+        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
+        RedisModule_ReplyWithString(ctx,ele);
+        RedisModule_FreeString(ctx,ele);
+        RedisModule_ZsetRangeNext(key);
+        arraylen++;
+    }
+    RedisModule_ZsetRangeStop(key);
+    RedisModule_ReplySetArrayLength(ctx,arraylen);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.HCOPY key srcfield dstfield
+ * This is just an example command that sets the hash field dstfield to the
+ * same value of srcfield. If srcfield does not exist no operation is
+ * performed.
+ *
+ * The command returns 1 if the copy is performed (srcfield exists) otherwise
+ * 0 is returned. */
+int HelloHCopy_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_HASH &&
+        type != REDISMODULE_KEYTYPE_EMPTY)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    /* Get the old field value. */
+    RedisModuleString *oldval;
+    RedisModule_HashGet(key,REDISMODULE_HASH_NONE,argv[2],&oldval,NULL);
+    if (oldval) {
+        RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[3],oldval,NULL);
+    }
+    RedisModule_ReplyWithLongLong(ctx,oldval != NULL);
+    return REDISMODULE_OK;
+}
+
+/* HELLO.LEFTPAD str len ch
+ * This is an implementation of the infamous LEFTPAD function, that
+ * was at the center of an issue with the npm modules system in March 2016.
+ *
+ * LEFTPAD is a good example of using a Redis Modules API called
+ * "pool allocator", that was a famous way to allocate memory in yet another
+ * open source project, the Apache web server.
+ *
+ * The concept is very simple: there is memory that is useful to allocate
+ * only in the context of serving a request, and must be freed anyway when
+ * the callback implementing the command returns. So in that case the module
+ * does not need to retain a reference to these allocations, it is just
+ * required to free the memory before returning. When this is the case the
+ * module can call RedisModule_PoolAlloc() instead, that works like malloc()
+ * but will automatically free the memory when the module callback returns.
+ *
+ * Note that PoolAlloc() does not necessarily require AutoMemory to be
+ * active. */
+int HelloLeftPad_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+    long long padlen;
+
+    if (argc != 4) return RedisModule_WrongArity(ctx);
+
+    if ((RedisModule_StringToLongLong(argv[2],&padlen) != REDISMODULE_OK) ||
+        (padlen< 0)) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid padding length");
+    }
+    size_t strlen, chlen;
+    const char *str = RedisModule_StringPtrLen(argv[1], &strlen);
+    const char *ch = RedisModule_StringPtrLen(argv[3], &chlen);
+
+    /* If the string is already larger than the target len, just return
+     * the string itself. */
+    if (strlen >= (size_t)padlen)
+        return RedisModule_ReplyWithString(ctx,argv[1]);
+
+    /* Padding must be a single character in this simple implementation. */
+    if (chlen != 1)
+        return RedisModule_ReplyWithError(ctx,
+            "ERR padding must be a single char");
+
+    /* Here we use our pool allocator, for our throw-away allocation. */
+    padlen -= strlen;
+    char *buf = RedisModule_PoolAlloc(ctx,padlen+strlen);
+    for (long long j = 0; j < padlen; j++) buf[j] = *ch;
+    memcpy(buf+padlen,str,strlen);
+
+    RedisModule_ReplyWithStringBuffer(ctx,buf,padlen+strlen);
+    return REDISMODULE_OK;
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (RedisModule_Init(ctx,"helloworld",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    /* Log the list of parameters passing loading the module. */
+    for (int j = 0; j < argc; j++) {
+        const char *s = RedisModule_StringPtrLen(argv[j],NULL);
+        printf("Module loaded with ARGV[%d] = %s\n", j, s);
+    }
+
+    if (RedisModule_CreateCommand(ctx,"hello.simple",
+        HelloSimple_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.push.native",
+        HelloPushNative_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.push.call",
+        HelloPushCall_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.push.call2",
+        HelloPushCall2_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.list.sum.len",
+        HelloListSumLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.list.splice",
+        HelloListSplice_RedisCommand,"write deny-oom",1,2,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.list.splice.auto",
+        HelloListSpliceAuto_RedisCommand,
+        "write deny-oom",1,2,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.rand.array",
+        HelloRandArray_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.repl1",
+        HelloRepl1_RedisCommand,"write",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.repl2",
+        HelloRepl2_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.toggle.case",
+        HelloToggleCase_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.more.expire",
+        HelloMoreExpire_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.zsumrange",
+        HelloZsumRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.lexrange",
+        HelloLexRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.hcopy",
+        HelloHCopy_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"hello.leftpad",
+        HelloLeftPad_RedisCommand,"",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/src/monotonic.c b/redis-stable/src/monotonic.c
new file mode 100644
index 00000000..5bb4f03b
--- /dev/null
+++ b/redis-stable/src/monotonic.c
@@ -0,0 +1,170 @@
+#include "monotonic.h"
+#include <stddef.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+
+#undef NDEBUG
+#include <assert.h>
+
+
+/* The function pointer for clock retrieval.  */
+monotime (*getMonotonicUs)(void) = NULL;
+
+static char monotonic_info_string[32];
+
+
+/* Using the processor clock (aka TSC on x86) can provide improved performance
+ * throughout Redis wherever the monotonic clock is used.  The processor clock
+ * is significantly faster than calling 'clock_getting' (POSIX).  While this is
+ * generally safe on modern systems, this link provides additional information
+ * about use of the x86 TSC: http://oliveryang.net/2015/09/pitfalls-of-TSC-usage
+ *
+ * To use the processor clock, either uncomment this line, or build with
+ *   CFLAGS="-DUSE_PROCESSOR_CLOCK"
+#define USE_PROCESSOR_CLOCK
+ */
+
+
+#if defined(USE_PROCESSOR_CLOCK) && defined(__x86_64__) && defined(__linux__)
+#include <regex.h>
+#include <x86intrin.h>
+
+static long mono_ticksPerMicrosecond = 0;
+
+static monotime getMonotonicUs_x86() {
+    return __rdtsc() / mono_ticksPerMicrosecond;
+}
+
+static void monotonicInit_x86linux() {
+    const int bufflen = 256;
+    char buf[bufflen];
+    regex_t cpuGhzRegex, constTscRegex;
+    const size_t nmatch = 2;
+    regmatch_t pmatch[nmatch];
+    int constantTsc = 0;
+    int rc;
+
+    /* Determine the number of TSC ticks in a micro-second.  This is
+     * a constant value matching the standard speed of the processor.
+     * On modern processors, this speed remains constant even though
+     * the actual clock speed varies dynamically for each core.  */
+    rc = regcomp(&cpuGhzRegex, "^model name\\s+:.*@ ([0-9.]+)GHz", REG_EXTENDED);
+    assert(rc == 0);
+
+    /* Also check that the constant_tsc flag is present.  (It should be
+     * unless this is a really old CPU.  */
+    rc = regcomp(&constTscRegex, "^flags\\s+:.* constant_tsc", REG_EXTENDED);
+    assert(rc == 0);
+
+    FILE *cpuinfo = fopen("/proc/cpuinfo", "r");
+    if (cpuinfo != NULL) {
+        while (fgets(buf, bufflen, cpuinfo) != NULL) {
+            if (regexec(&cpuGhzRegex, buf, nmatch, pmatch, 0) == 0) {
+                buf[pmatch[1].rm_eo] = '\0';
+                double ghz = atof(&buf[pmatch[1].rm_so]);
+                mono_ticksPerMicrosecond = (long)(ghz * 1000);
+                break;
+            }
+        }
+        while (fgets(buf, bufflen, cpuinfo) != NULL) {
+            if (regexec(&constTscRegex, buf, nmatch, pmatch, 0) == 0) {
+                constantTsc = 1;
+                break;
+            }
+        }
+
+        fclose(cpuinfo);
+    }
+    regfree(&cpuGhzRegex);
+    regfree(&constTscRegex);
+
+    if (mono_ticksPerMicrosecond == 0) {
+        fprintf(stderr, "monotonic: x86 linux, unable to determine clock rate");
+        return;
+    }
+    if (!constantTsc) {
+        fprintf(stderr, "monotonic: x86 linux, 'constant_tsc' flag not present");
+        return;
+    }
+
+    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
+            "X86 TSC @ %ld ticks/us", mono_ticksPerMicrosecond);
+    getMonotonicUs = getMonotonicUs_x86;
+}
+#endif
+
+
+#if defined(USE_PROCESSOR_CLOCK) && defined(__aarch64__)
+static long mono_ticksPerMicrosecond = 0;
+
+/* Read the clock value.  */
+static inline uint64_t __cntvct() {
+    uint64_t virtual_timer_value;
+    __asm__ volatile("mrs %0, cntvct_el0" : "=r"(virtual_timer_value));
+    return virtual_timer_value;
+}
+
+/* Read the Count-timer Frequency.  */
+static inline uint32_t cntfrq_hz() {
+    uint64_t virtual_freq_value;
+    __asm__ volatile("mrs %0, cntfrq_el0" : "=r"(virtual_freq_value));
+    return (uint32_t)virtual_freq_value;    /* top 32 bits are reserved */
+}
+
+static monotime getMonotonicUs_aarch64() {
+    return __cntvct() / mono_ticksPerMicrosecond;
+}
+
+static void monotonicInit_aarch64() {
+    mono_ticksPerMicrosecond = (long)cntfrq_hz() / 1000L / 1000L;
+    if (mono_ticksPerMicrosecond == 0) {
+        fprintf(stderr, "monotonic: aarch64, unable to determine clock rate");
+        return;
+    }
+
+    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
+            "ARM CNTVCT @ %ld ticks/us", mono_ticksPerMicrosecond);
+    getMonotonicUs = getMonotonicUs_aarch64;
+}
+#endif
+
+
+static monotime getMonotonicUs_posix() {
+    /* clock_gettime() is specified in POSIX.1b (1993).  Even so, some systems
+     * did not support this until much later.  CLOCK_MONOTONIC is technically
+     * optional and may not be supported - but it appears to be universal.
+     * If this is not supported, provide a system-specific alternate version.  */
+    struct timespec ts;
+    clock_gettime(CLOCK_MONOTONIC, &ts);
+    return ((uint64_t)ts.tv_sec) * 1000000 + ts.tv_nsec / 1000;
+}
+
+static void monotonicInit_posix() {
+    /* Ensure that CLOCK_MONOTONIC is supported.  This should be supported
+     * on any reasonably current OS.  If the assertion below fails, provide
+     * an appropriate alternate implementation.  */
+    struct timespec ts;
+    int rc = clock_gettime(CLOCK_MONOTONIC, &ts);
+    assert(rc == 0);
+
+    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
+            "POSIX clock_gettime");
+    getMonotonicUs = getMonotonicUs_posix;
+}
+
+
+
+const char * monotonicInit() {
+    #if defined(USE_PROCESSOR_CLOCK) && defined(__x86_64__) && defined(__linux__)
+    if (getMonotonicUs == NULL) monotonicInit_x86linux();
+    #endif
+
+    #if defined(USE_PROCESSOR_CLOCK) && defined(__aarch64__)
+    if (getMonotonicUs == NULL) monotonicInit_aarch64();
+    #endif
+
+    if (getMonotonicUs == NULL) monotonicInit_posix();
+
+    return monotonic_info_string;
+}
diff --git a/redis-stable/src/monotonic.h b/redis-stable/src/monotonic.h
new file mode 100644
index 00000000..4e82f9d5
--- /dev/null
+++ b/redis-stable/src/monotonic.h
@@ -0,0 +1,52 @@
+#ifndef __MONOTONIC_H
+#define __MONOTONIC_H
+/* The monotonic clock is an always increasing clock source.  It is unrelated to
+ * the actual time of day and should only be used for relative timings.  The
+ * monotonic clock is also not guaranteed to be chronologically precise; there
+ * may be slight skew/shift from a precise clock.
+ *
+ * Depending on system architecture, the monotonic time may be able to be
+ * retrieved much faster than a normal clock source by using an instruction
+ * counter on the CPU.  On x86 architectures (for example), the RDTSC
+ * instruction is a very fast clock source for this purpose.
+ */
+
+#include "fmacros.h"
+#include <stdint.h>
+#include <unistd.h>
+
+/* A counter in micro-seconds.  The 'monotime' type is provided for variables
+ * holding a monotonic time.  This will help distinguish & document that the
+ * variable is associated with the monotonic clock and should not be confused
+ * with other types of time.*/
+typedef uint64_t monotime;
+
+/* Retrieve counter of micro-seconds relative to an arbitrary point in time.  */
+extern monotime (*getMonotonicUs)(void);
+
+
+/* Call once at startup to initialize the monotonic clock.  Though this only
+ * needs to be called once, it may be called additional times without impact.
+ * Returns a printable string indicating the type of clock initialized.
+ * (The returned string is static and doesn't need to be freed.)  */
+const char * monotonicInit();
+
+
+/* Functions to measure elapsed time.  Example:
+ *     monotime myTimer;
+ *     elapsedStart(&myTimer);
+ *     while (elapsedMs(myTimer) < 10) {} // loops for 10ms
+ */
+static inline void elapsedStart(monotime *start_time) {
+    *start_time = getMonotonicUs();
+}
+
+static inline uint64_t elapsedUs(monotime start_time) {
+    return getMonotonicUs() - start_time;
+}
+
+static inline uint64_t elapsedMs(monotime start_time) {
+    return elapsedUs(start_time) / 1000;
+}
+
+#endif
diff --git a/redis-stable/src/mt19937-64.c b/redis-stable/src/mt19937-64.c
new file mode 100644
index 00000000..a0c897ff
--- /dev/null
+++ b/redis-stable/src/mt19937-64.c
@@ -0,0 +1,187 @@
+/*
+   A C-program for MT19937-64 (2004/9/29 version).
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   This is a 64-bit version of Mersenne Twister pseudorandom number
+   generator.
+
+   Before using, initialize the state by using init_genrand64(seed)
+   or init_by_array64(init_key, key_length).
+
+   Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   References:
+   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
+     ACM Transactions on Modeling and
+     Computer Simulation 10. (2000) 348--357.
+   M. Matsumoto and T. Nishimura,
+     ``Mersenne Twister: a 623-dimensionally equidistributed
+       uniform pseudorandom number generator''
+     ACM Transactions on Modeling and
+     Computer Simulation 8. (Jan. 1998) 3--30.
+
+   Any feedback is very welcome.
+   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
+*/
+
+
+#include "mt19937-64.h"
+#include <stdio.h>
+
+#define NN 312
+#define MM 156
+#define MATRIX_A 0xB5026F5AA96619E9ULL
+#define UM 0xFFFFFFFF80000000ULL /* Most significant 33 bits */
+#define LM 0x7FFFFFFFULL /* Least significant 31 bits */
+
+
+/* The array for the state vector */
+static unsigned long long mt[NN];
+/* mti==NN+1 means mt[NN] is not initialized */
+static int mti=NN+1;
+
+/* initializes mt[NN] with a seed */
+void init_genrand64(unsigned long long seed)
+{
+    mt[0] = seed;
+    for (mti=1; mti<NN; mti++)
+        mt[mti] =  (6364136223846793005ULL * (mt[mti-1] ^ (mt[mti-1] >> 62)) + mti);
+}
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+void init_by_array64(unsigned long long init_key[],
+                     unsigned long long key_length)
+{
+    unsigned long long i, j, k;
+    init_genrand64(19650218ULL);
+    i=1; j=0;
+    k = (NN>key_length ? NN : key_length);
+    for (; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * 3935559000370003845ULL))
+          + init_key[j] + j; /* non linear */
+        i++; j++;
+        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
+        if (j>=key_length) j=0;
+    }
+    for (k=NN-1; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * 2862933555777941757ULL))
+          - i; /* non linear */
+        i++;
+        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
+    }
+
+    mt[0] = 1ULL << 63; /* MSB is 1; assuring non-zero initial array */
+}
+
+/* generates a random number on [0, 2^64-1]-interval */
+unsigned long long genrand64_int64(void)
+{
+    int i;
+    unsigned long long x;
+    static unsigned long long mag01[2]={0ULL, MATRIX_A};
+
+    if (mti >= NN) { /* generate NN words at one time */
+
+        /* if init_genrand64() has not been called, */
+        /* a default initial seed is used     */
+        if (mti == NN+1)
+            init_genrand64(5489ULL);
+
+        for (i=0;i<NN-MM;i++) {
+            x = (mt[i]&UM)|(mt[i+1]&LM);
+            mt[i] = mt[i+MM] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
+        }
+        for (;i<NN-1;i++) {
+            x = (mt[i]&UM)|(mt[i+1]&LM);
+            mt[i] = mt[i+(MM-NN)] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
+        }
+        x = (mt[NN-1]&UM)|(mt[0]&LM);
+        mt[NN-1] = mt[MM-1] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
+
+        mti = 0;
+    }
+
+    x = mt[mti++];
+
+    x ^= (x >> 29) & 0x5555555555555555ULL;
+    x ^= (x << 17) & 0x71D67FFFEDA60000ULL;
+    x ^= (x << 37) & 0xFFF7EEE000000000ULL;
+    x ^= (x >> 43);
+
+    return x;
+}
+
+/* generates a random number on [0, 2^63-1]-interval */
+long long genrand64_int63(void)
+{
+    return (long long)(genrand64_int64() >> 1);
+}
+
+/* generates a random number on [0,1]-real-interval */
+double genrand64_real1(void)
+{
+    return (genrand64_int64() >> 11) * (1.0/9007199254740991.0);
+}
+
+/* generates a random number on [0,1)-real-interval */
+double genrand64_real2(void)
+{
+    return (genrand64_int64() >> 11) * (1.0/9007199254740992.0);
+}
+
+/* generates a random number on (0,1)-real-interval */
+double genrand64_real3(void)
+{
+    return ((genrand64_int64() >> 12) + 0.5) * (1.0/4503599627370496.0);
+}
+
+#ifdef MT19937_64_MAIN
+int main(void)
+{
+    int i;
+    unsigned long long init[4]={0x12345ULL, 0x23456ULL, 0x34567ULL, 0x45678ULL}, length=4;
+    init_by_array64(init, length);
+    printf("1000 outputs of genrand64_int64()\n");
+    for (i=0; i<1000; i++) {
+      printf("%20llu ", genrand64_int64());
+      if (i%5==4) printf("\n");
+    }
+    printf("\n1000 outputs of genrand64_real2()\n");
+    for (i=0; i<1000; i++) {
+      printf("%10.8f ", genrand64_real2());
+      if (i%5==4) printf("\n");
+    }
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/mt19937-64.h b/redis-stable/src/mt19937-64.h
new file mode 100644
index 00000000..b98348fd
--- /dev/null
+++ b/redis-stable/src/mt19937-64.h
@@ -0,0 +1,87 @@
+/*
+   A C-program for MT19937-64 (2004/9/29 version).
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   This is a 64-bit version of Mersenne Twister pseudorandom number
+   generator.
+
+   Before using, initialize the state by using init_genrand64(seed)
+   or init_by_array64(init_key, key_length).
+
+   Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+   References:
+   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
+     ACM Transactions on Modeling and
+     Computer Simulation 10. (2000) 348--357.
+   M. Matsumoto and T. Nishimura,
+     ``Mersenne Twister: a 623-dimensionally equidistributed
+       uniform pseudorandom number generator''
+     ACM Transactions on Modeling and
+     Computer Simulation 8. (Jan. 1998) 3--30.
+
+   Any feedback is very welcome.
+   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
+*/
+
+#ifndef __MT19937_64_H
+#define __MT19937_64_H
+
+/* initializes mt[NN] with a seed */
+void init_genrand64(unsigned long long seed);
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+void init_by_array64(unsigned long long init_key[],
+                     unsigned long long key_length);
+
+/* generates a random number on [0, 2^64-1]-interval */
+unsigned long long genrand64_int64(void);
+
+
+/* generates a random number on [0, 2^63-1]-interval */
+long long genrand64_int63(void);
+
+/* generates a random number on [0,1]-real-interval */
+double genrand64_real1(void);
+
+/* generates a random number on [0,1)-real-interval */
+double genrand64_real2(void);
+
+/* generates a random number on (0,1)-real-interval */
+double genrand64_real3(void);
+
+/* generates a random number on (0,1]-real-interval */
+double genrand64_real4(void);
+
+#endif
diff --git a/redis-stable/src/multi.c b/redis-stable/src/multi.c
new file mode 100644
index 00000000..ebbdabbf
--- /dev/null
+++ b/redis-stable/src/multi.c
@@ -0,0 +1,439 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* ================================ MULTI/EXEC ============================== */
+
+/* Client state initialization for MULTI/EXEC */
+void initClientMultiState(client *c) {
+    c->mstate.commands = NULL;
+    c->mstate.count = 0;
+    c->mstate.cmd_flags = 0;
+    c->mstate.cmd_inv_flags = 0;
+}
+
+/* Release all the resources associated with MULTI/EXEC state */
+void freeClientMultiState(client *c) {
+    int j;
+
+    for (j = 0; j < c->mstate.count; j++) {
+        int i;
+        multiCmd *mc = c->mstate.commands+j;
+
+        for (i = 0; i < mc->argc; i++)
+            decrRefCount(mc->argv[i]);
+        zfree(mc->argv);
+    }
+    zfree(c->mstate.commands);
+}
+
+/* Add a new command into the MULTI commands queue */
+void queueMultiCommand(client *c) {
+    multiCmd *mc;
+    int j;
+
+    /* No sense to waste memory if the transaction is already aborted.
+     * this is useful in case client sends these in a pipeline, or doesn't
+     * bother to read previous responses and didn't notice the multi was already
+     * aborted. */
+    if (c->flags & CLIENT_DIRTY_EXEC)
+        return;
+
+    c->mstate.commands = zrealloc(c->mstate.commands,
+            sizeof(multiCmd)*(c->mstate.count+1));
+    mc = c->mstate.commands+c->mstate.count;
+    mc->cmd = c->cmd;
+    mc->argc = c->argc;
+    mc->argv = zmalloc(sizeof(robj*)*c->argc);
+    memcpy(mc->argv,c->argv,sizeof(robj*)*c->argc);
+    for (j = 0; j < c->argc; j++)
+        incrRefCount(mc->argv[j]);
+    c->mstate.count++;
+    c->mstate.cmd_flags |= c->cmd->flags;
+    c->mstate.cmd_inv_flags |= ~c->cmd->flags;
+}
+
+void discardTransaction(client *c) {
+    freeClientMultiState(c);
+    initClientMultiState(c);
+    c->flags &= ~(CLIENT_MULTI|CLIENT_DIRTY_CAS|CLIENT_DIRTY_EXEC);
+    unwatchAllKeys(c);
+}
+
+/* Flag the transaction as DIRTY_EXEC so that EXEC will fail.
+ * Should be called every time there is an error while queueing a command. */
+void flagTransaction(client *c) {
+    if (c->flags & CLIENT_MULTI)
+        c->flags |= CLIENT_DIRTY_EXEC;
+}
+
+void multiCommand(client *c) {
+    if (c->flags & CLIENT_MULTI) {
+        addReplyError(c,"MULTI calls can not be nested");
+        return;
+    }
+    c->flags |= CLIENT_MULTI;
+
+    addReply(c,shared.ok);
+}
+
+void discardCommand(client *c) {
+    if (!(c->flags & CLIENT_MULTI)) {
+        addReplyError(c,"DISCARD without MULTI");
+        return;
+    }
+    discardTransaction(c);
+    addReply(c,shared.ok);
+}
+
+void beforePropagateMulti() {
+    /* Propagating MULTI */
+    serverAssert(!server.propagate_in_transaction);
+    server.propagate_in_transaction = 1;
+}
+
+void afterPropagateExec() {
+    /* Propagating EXEC */
+    serverAssert(server.propagate_in_transaction == 1);
+    server.propagate_in_transaction = 0;
+}
+
+/* Send a MULTI command to all the slaves and AOF file. Check the execCommand
+ * implementation for more information. */
+void execCommandPropagateMulti(int dbid) {
+    beforePropagateMulti();
+    propagate(server.multiCommand,dbid,&shared.multi,1,
+              PROPAGATE_AOF|PROPAGATE_REPL);
+}
+
+void execCommandPropagateExec(int dbid) {
+    propagate(server.execCommand,dbid,&shared.exec,1,
+              PROPAGATE_AOF|PROPAGATE_REPL);
+    afterPropagateExec();
+}
+
+/* Aborts a transaction, with a specific error message.
+ * The transaction is always aborted with -EXECABORT so that the client knows
+ * the server exited the multi state, but the actual reason for the abort is
+ * included too.
+ * Note: 'error' may or may not end with \r\n. see addReplyErrorFormat. */
+void execCommandAbort(client *c, sds error) {
+    discardTransaction(c);
+
+    if (error[0] == '-') error++;
+    addReplyErrorFormat(c, "-EXECABORT Transaction discarded because of: %s", error);
+
+    /* Send EXEC to clients waiting data from MONITOR. We did send a MULTI
+     * already, and didn't send any of the queued commands, now we'll just send
+     * EXEC so it is clear that the transaction is over. */
+    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
+}
+
+void execCommand(client *c) {
+    int j;
+    robj **orig_argv;
+    int orig_argc;
+    struct redisCommand *orig_cmd;
+    int was_master = server.masterhost == NULL;
+
+    if (!(c->flags & CLIENT_MULTI)) {
+        addReplyError(c,"EXEC without MULTI");
+        return;
+    }
+
+    /* EXEC with expired watched key is disallowed*/
+    if (isWatchedKeyExpired(c)) {
+        c->flags |= (CLIENT_DIRTY_CAS);
+    }
+
+    /* Check if we need to abort the EXEC because:
+     * 1) Some WATCHed key was touched.
+     * 2) There was a previous error while queueing commands.
+     * A failed EXEC in the first case returns a multi bulk nil object
+     * (technically it is not an error but a special behavior), while
+     * in the second an EXECABORT error is returned. */
+    if (c->flags & (CLIENT_DIRTY_CAS | CLIENT_DIRTY_EXEC)) {
+        if (c->flags & CLIENT_DIRTY_EXEC) {
+            addReplyErrorObject(c, shared.execaborterr);
+        } else {
+            addReply(c, shared.nullarray[c->resp]);
+        }
+
+        discardTransaction(c);
+        return;
+    }
+
+    uint64_t old_flags = c->flags;
+
+    /* we do not want to allow blocking commands inside multi */
+    c->flags |= CLIENT_DENY_BLOCKING;
+
+    /* Exec all the queued commands */
+    unwatchAllKeys(c); /* Unwatch ASAP otherwise we'll waste CPU cycles */
+
+    server.in_exec = 1;
+
+    orig_argv = c->argv;
+    orig_argc = c->argc;
+    orig_cmd = c->cmd;
+    addReplyArrayLen(c,c->mstate.count);
+    for (j = 0; j < c->mstate.count; j++) {
+        c->argc = c->mstate.commands[j].argc;
+        c->argv = c->mstate.commands[j].argv;
+        c->cmd = c->mstate.commands[j].cmd;
+
+        /* ACL permissions are also checked at the time of execution in case
+         * they were changed after the commands were queued. */
+        int acl_errpos;
+        int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
+        if (acl_retval != ACL_OK) {
+            char *reason;
+            switch (acl_retval) {
+            case ACL_DENIED_CMD:
+                reason = "no permission to execute the command or subcommand";
+                break;
+            case ACL_DENIED_KEY:
+                reason = "no permission to touch the specified keys";
+                break;
+            case ACL_DENIED_CHANNEL:
+                reason = "no permission to access one of the channels used "
+                         "as arguments";
+                break;
+            default:
+                reason = "no permission";
+                break;
+            }
+            addACLLogEntry(c,acl_retval,acl_errpos,NULL);
+            addReplyErrorFormat(c,
+                "-NOPERM ACLs rules changed between the moment the "
+                "transaction was accumulated and the EXEC call. "
+                "This command is no longer allowed for the "
+                "following reason: %s", reason);
+        } else {
+            call(c,server.loading ? CMD_CALL_NONE : CMD_CALL_FULL);
+            serverAssert((c->flags & CLIENT_BLOCKED) == 0);
+        }
+
+        /* Commands may alter argc/argv, restore mstate. */
+        c->mstate.commands[j].argc = c->argc;
+        c->mstate.commands[j].argv = c->argv;
+        c->mstate.commands[j].cmd = c->cmd;
+    }
+
+    // restore old DENY_BLOCKING value
+    if (!(old_flags & CLIENT_DENY_BLOCKING))
+        c->flags &= ~CLIENT_DENY_BLOCKING;
+
+    c->argv = orig_argv;
+    c->argc = orig_argc;
+    c->cmd = orig_cmd;
+    discardTransaction(c);
+
+    /* Make sure the EXEC command will be propagated as well if MULTI
+     * was already propagated. */
+    if (server.propagate_in_transaction) {
+        int is_master = server.masterhost == NULL;
+        server.dirty++;
+        /* If inside the MULTI/EXEC block this instance was suddenly
+         * switched from master to slave (using the SLAVEOF command), the
+         * initial MULTI was propagated into the replication backlog, but the
+         * rest was not. We need to make sure to at least terminate the
+         * backlog with the final EXEC. */
+        if (server.repl_backlog && was_master && !is_master) {
+            char *execcmd = "*1\r\n$4\r\nEXEC\r\n";
+            feedReplicationBacklog(execcmd,strlen(execcmd));
+        }
+        afterPropagateExec();
+    }
+
+    server.in_exec = 0;
+}
+
+/* ===================== WATCH (CAS alike for MULTI/EXEC) ===================
+ *
+ * The implementation uses a per-DB hash table mapping keys to list of clients
+ * WATCHing those keys, so that given a key that is going to be modified
+ * we can mark all the associated clients as dirty.
+ *
+ * Also every client contains a list of WATCHed keys so that's possible to
+ * un-watch such keys when the client is freed or when UNWATCH is called. */
+
+/* In the client->watched_keys list we need to use watchedKey structures
+ * as in order to identify a key in Redis we need both the key name and the
+ * DB */
+typedef struct watchedKey {
+    robj *key;
+    redisDb *db;
+} watchedKey;
+
+/* Watch for the specified key */
+void watchForKey(client *c, robj *key) {
+    list *clients = NULL;
+    listIter li;
+    listNode *ln;
+    watchedKey *wk;
+
+    /* Check if we are already watching for this key */
+    listRewind(c->watched_keys,&li);
+    while((ln = listNext(&li))) {
+        wk = listNodeValue(ln);
+        if (wk->db == c->db && equalStringObjects(key,wk->key))
+            return; /* Key already watched */
+    }
+    /* This key is not already watched in this DB. Let's add it */
+    clients = dictFetchValue(c->db->watched_keys,key);
+    if (!clients) {
+        clients = listCreate();
+        dictAdd(c->db->watched_keys,key,clients);
+        incrRefCount(key);
+    }
+    listAddNodeTail(clients,c);
+    /* Add the new key to the list of keys watched by this client */
+    wk = zmalloc(sizeof(*wk));
+    wk->key = key;
+    wk->db = c->db;
+    incrRefCount(key);
+    listAddNodeTail(c->watched_keys,wk);
+}
+
+/* Unwatch all the keys watched by this client. To clean the EXEC dirty
+ * flag is up to the caller. */
+void unwatchAllKeys(client *c) {
+    listIter li;
+    listNode *ln;
+
+    if (listLength(c->watched_keys) == 0) return;
+    listRewind(c->watched_keys,&li);
+    while((ln = listNext(&li))) {
+        list *clients;
+        watchedKey *wk;
+
+        /* Lookup the watched key -> clients list and remove the client
+         * from the list */
+        wk = listNodeValue(ln);
+        clients = dictFetchValue(wk->db->watched_keys, wk->key);
+        serverAssertWithInfo(c,NULL,clients != NULL);
+        listDelNode(clients,listSearchKey(clients,c));
+        /* Kill the entry at all if this was the only client */
+        if (listLength(clients) == 0)
+            dictDelete(wk->db->watched_keys, wk->key);
+        /* Remove this watched key from the client->watched list */
+        listDelNode(c->watched_keys,ln);
+        decrRefCount(wk->key);
+        zfree(wk);
+    }
+}
+
+/* iterates over the watched_keys list and
+ * look for an expired key . */
+int isWatchedKeyExpired(client *c) {
+    listIter li;
+    listNode *ln;
+    watchedKey *wk;
+    if (listLength(c->watched_keys) == 0) return 0;
+    listRewind(c->watched_keys,&li);
+    while ((ln = listNext(&li))) {
+        wk = listNodeValue(ln);
+        if (keyIsExpired(wk->db, wk->key)) return 1;
+    }
+
+    return 0;
+}
+
+/* "Touch" a key, so that if this key is being WATCHed by some client the
+ * next EXEC will fail. */
+void touchWatchedKey(redisDb *db, robj *key) {
+    list *clients;
+    listIter li;
+    listNode *ln;
+
+    if (dictSize(db->watched_keys) == 0) return;
+    clients = dictFetchValue(db->watched_keys, key);
+    if (!clients) return;
+
+    /* Mark all the clients watching this key as CLIENT_DIRTY_CAS */
+    /* Check if we are already watching for this key */
+    listRewind(clients,&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+
+        c->flags |= CLIENT_DIRTY_CAS;
+    }
+}
+
+/* Set CLIENT_DIRTY_CAS to all clients of DB when DB is dirty.
+ * It may happen in the following situations:
+ * FLUSHDB, FLUSHALL, SWAPDB
+ *
+ * replaced_with: for SWAPDB, the WATCH should be invalidated if
+ * the key exists in either of them, and skipped only if it
+ * doesn't exist in both. */
+void touchAllWatchedKeysInDb(redisDb *emptied, redisDb *replaced_with) {
+    listIter li;
+    listNode *ln;
+    dictEntry *de;
+
+    if (dictSize(emptied->watched_keys) == 0) return;
+
+    dictIterator *di = dictGetSafeIterator(emptied->watched_keys);
+    while((de = dictNext(di)) != NULL) {
+        robj *key = dictGetKey(de);
+        list *clients = dictGetVal(de);
+        if (!clients) continue;
+        listRewind(clients,&li);
+        while((ln = listNext(&li))) {
+            client *c = listNodeValue(ln);
+            if (dictFind(emptied->dict, key->ptr)) {
+                c->flags |= CLIENT_DIRTY_CAS;
+            } else if (replaced_with && dictFind(replaced_with->dict, key->ptr)) {
+                c->flags |= CLIENT_DIRTY_CAS;
+            }
+        }
+    }
+    dictReleaseIterator(di);
+}
+
+void watchCommand(client *c) {
+    int j;
+
+    if (c->flags & CLIENT_MULTI) {
+        addReplyError(c,"WATCH inside MULTI is not allowed");
+        return;
+    }
+    for (j = 1; j < c->argc; j++)
+        watchForKey(c,c->argv[j]);
+    addReply(c,shared.ok);
+}
+
+void unwatchCommand(client *c) {
+    unwatchAllKeys(c);
+    c->flags &= (~CLIENT_DIRTY_CAS);
+    addReply(c,shared.ok);
+}
diff --git a/redis-stable/src/networking.c b/redis-stable/src/networking.c
new file mode 100644
index 00000000..bf4a8daa
--- /dev/null
+++ b/redis-stable/src/networking.c
@@ -0,0 +1,3772 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "atomicvar.h"
+#include "cluster.h"
+#include <sys/socket.h>
+#include <sys/uio.h>
+#include <math.h>
+#include <ctype.h>
+
+static void setProtocolError(const char *errstr, client *c);
+int postponeClientRead(client *c);
+int ProcessingEventsWhileBlocked = 0; /* See processEventsWhileBlocked(). */
+
+/* Return the size consumed from the allocator, for the specified SDS string,
+ * including internal fragmentation. This function is used in order to compute
+ * the client output buffer size. */
+size_t sdsZmallocSize(sds s) {
+    void *sh = sdsAllocPtr(s);
+    return zmalloc_size(sh);
+}
+
+/* Return the amount of memory used by the sds string at object->ptr
+ * for a string object. This includes internal fragmentation. */
+size_t getStringObjectSdsUsedMemory(robj *o) {
+    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+    switch(o->encoding) {
+    case OBJ_ENCODING_RAW: return sdsZmallocSize(o->ptr);
+    case OBJ_ENCODING_EMBSTR: return zmalloc_size(o)-sizeof(robj);
+    default: return 0; /* Just integer encoding for now. */
+    }
+}
+
+/* Return the length of a string object.
+ * This does NOT includes internal fragmentation or sds unused space. */
+size_t getStringObjectLen(robj *o) {
+    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+    switch(o->encoding) {
+    case OBJ_ENCODING_RAW: return sdslen(o->ptr);
+    case OBJ_ENCODING_EMBSTR: return sdslen(o->ptr);
+    default: return 0; /* Just integer encoding for now. */
+    }
+}
+
+/* Client.reply list dup and free methods. */
+void *dupClientReplyValue(void *o) {
+    clientReplyBlock *old = o;
+    clientReplyBlock *buf = zmalloc(sizeof(clientReplyBlock) + old->size);
+    memcpy(buf, o, sizeof(clientReplyBlock) + old->size);
+    return buf;
+}
+
+void freeClientReplyValue(void *o) {
+    zfree(o);
+}
+
+int listMatchObjects(void *a, void *b) {
+    return equalStringObjects(a,b);
+}
+
+/* This function links the client to the global linked list of clients.
+ * unlinkClient() does the opposite, among other things. */
+void linkClient(client *c) {
+    listAddNodeTail(server.clients,c);
+    /* Note that we remember the linked list node where the client is stored,
+     * this way removing the client in unlinkClient() will not require
+     * a linear scan, but just a constant time operation. */
+    c->client_list_node = listLast(server.clients);
+    uint64_t id = htonu64(c->id);
+    raxInsert(server.clients_index,(unsigned char*)&id,sizeof(id),c,NULL);
+}
+
+/* Initialize client authentication state.
+ */
+static void clientSetDefaultAuth(client *c) {
+    /* If the default user does not require authentication, the user is
+     * directly authenticated. */
+    c->user = DefaultUser;
+    c->authenticated = (c->user->flags & USER_FLAG_NOPASS) &&
+                       !(c->user->flags & USER_FLAG_DISABLED);
+}
+
+int authRequired(client *c) {
+    /* Check if the user is authenticated. This check is skipped in case
+     * the default user is flagged as "nopass" and is active. */
+    int auth_required = (!(DefaultUser->flags & USER_FLAG_NOPASS) ||
+                          (DefaultUser->flags & USER_FLAG_DISABLED)) &&
+                        !c->authenticated;
+    return auth_required;
+}
+
+client *createClient(connection *conn) {
+    client *c = zmalloc(sizeof(client));
+
+    /* passing NULL as conn it is possible to create a non connected client.
+     * This is useful since all the commands needs to be executed
+     * in the context of a client. When commands are executed in other
+     * contexts (for instance a Lua script) we need a non connected client. */
+    if (conn) {
+        connNonBlock(conn);
+        connEnableTcpNoDelay(conn);
+        if (server.tcpkeepalive)
+            connKeepAlive(conn,server.tcpkeepalive);
+        connSetReadHandler(conn, readQueryFromClient);
+        connSetPrivateData(conn, c);
+    }
+
+    selectDb(c,0);
+    uint64_t client_id;
+    atomicGetIncr(server.next_client_id, client_id, 1);
+    c->id = client_id;
+    c->resp = 2;
+    c->conn = conn;
+    c->name = NULL;
+    c->bufpos = 0;
+    c->qb_pos = 0;
+    c->querybuf = sdsempty();
+    c->pending_querybuf = sdsempty();
+    c->querybuf_peak = 0;
+    c->reqtype = 0;
+    c->argc = 0;
+    c->argv = NULL;
+    c->argv_len_sum = 0;
+    c->original_argc = 0;
+    c->original_argv = NULL;
+    c->cmd = c->lastcmd = NULL;
+    c->multibulklen = 0;
+    c->bulklen = -1;
+    c->sentlen = 0;
+    c->flags = 0;
+    c->ctime = c->lastinteraction = server.unixtime;
+    clientSetDefaultAuth(c);
+    c->replstate = REPL_STATE_NONE;
+    c->repl_put_online_on_ack = 0;
+    c->reploff = 0;
+    c->read_reploff = 0;
+    c->repl_ack_off = 0;
+    c->repl_ack_time = 0;
+    c->repl_last_partial_write = 0;
+    c->slave_listening_port = 0;
+    c->slave_addr = NULL;
+    c->slave_capa = SLAVE_CAPA_NONE;
+    c->reply = listCreate();
+    c->reply_bytes = 0;
+    c->obuf_soft_limit_reached_time = 0;
+    listSetFreeMethod(c->reply,freeClientReplyValue);
+    listSetDupMethod(c->reply,dupClientReplyValue);
+    c->btype = BLOCKED_NONE;
+    c->bpop.timeout = 0;
+    c->bpop.keys = dictCreate(&objectKeyHeapPointerValueDictType,NULL);
+    c->bpop.target = NULL;
+    c->bpop.xread_group = NULL;
+    c->bpop.xread_consumer = NULL;
+    c->bpop.xread_group_noack = 0;
+    c->bpop.numreplicas = 0;
+    c->bpop.reploffset = 0;
+    c->woff = 0;
+    c->watched_keys = listCreate();
+    c->pubsub_channels = dictCreate(&objectKeyPointerValueDictType,NULL);
+    c->pubsub_patterns = listCreate();
+    c->peerid = NULL;
+    c->sockname = NULL;
+    c->client_list_node = NULL;
+    c->paused_list_node = NULL;
+    c->client_tracking_redirection = 0;
+    c->client_tracking_prefixes = NULL;
+    c->client_cron_last_memory_usage = 0;
+    c->client_cron_last_memory_type = CLIENT_TYPE_NORMAL;
+    c->auth_callback = NULL;
+    c->auth_callback_privdata = NULL;
+    c->auth_module = NULL;
+    listSetFreeMethod(c->pubsub_patterns,decrRefCountVoid);
+    listSetMatchMethod(c->pubsub_patterns,listMatchObjects);
+    if (conn) linkClient(c);
+    initClientMultiState(c);
+    return c;
+}
+
+/* This function puts the client in the queue of clients that should write
+ * their output buffers to the socket. Note that it does not *yet* install
+ * the write handler, to start clients are put in a queue of clients that need
+ * to write, so we try to do that before returning in the event loop (see the
+ * handleClientsWithPendingWrites() function).
+ * If we fail and there is more data to write, compared to what the socket
+ * buffers can hold, then we'll really install the handler. */
+void clientInstallWriteHandler(client *c) {
+    /* Schedule the client to write the output buffers to the socket only
+     * if not already done and, for slaves, if the slave can actually receive
+     * writes at this stage. */
+    if (!(c->flags & CLIENT_PENDING_WRITE) &&
+        (c->replstate == REPL_STATE_NONE ||
+         (c->replstate == SLAVE_STATE_ONLINE && !c->repl_put_online_on_ack)))
+    {
+        /* Here instead of installing the write handler, we just flag the
+         * client and put it into a list of clients that have something
+         * to write to the socket. This way before re-entering the event
+         * loop, we can try to directly write to the client sockets avoiding
+         * a system call. We'll only really install the write handler if
+         * we'll not be able to write the whole reply at once. */
+        c->flags |= CLIENT_PENDING_WRITE;
+        listAddNodeHead(server.clients_pending_write,c);
+    }
+}
+
+/* This function is called every time we are going to transmit new data
+ * to the client. The behavior is the following:
+ *
+ * If the client should receive new data (normal clients will) the function
+ * returns C_OK, and make sure to install the write handler in our event
+ * loop so that when the socket is writable new data gets written.
+ *
+ * If the client should not receive new data, because it is a fake client
+ * (used to load AOF in memory), a master or because the setup of the write
+ * handler failed, the function returns C_ERR.
+ *
+ * The function may return C_OK without actually installing the write
+ * event handler in the following cases:
+ *
+ * 1) The event handler should already be installed since the output buffer
+ *    already contains something.
+ * 2) The client is a slave but not yet online, so we want to just accumulate
+ *    writes in the buffer but not actually sending them yet.
+ *
+ * Typically gets called every time a reply is built, before adding more
+ * data to the clients output buffers. If the function returns C_ERR no
+ * data should be appended to the output buffers. */
+int prepareClientToWrite(client *c) {
+    /* If it's the Lua client we always return ok without installing any
+     * handler since there is no socket at all. */
+    if (c->flags & (CLIENT_LUA|CLIENT_MODULE)) return C_OK;
+
+    /* If CLIENT_CLOSE_ASAP flag is set, we need not write anything. */
+    if (c->flags & CLIENT_CLOSE_ASAP) return C_ERR;
+
+    /* CLIENT REPLY OFF / SKIP handling: don't send replies. */
+    if (c->flags & (CLIENT_REPLY_OFF|CLIENT_REPLY_SKIP)) return C_ERR;
+
+    /* Masters don't receive replies, unless CLIENT_MASTER_FORCE_REPLY flag
+     * is set. */
+    if ((c->flags & CLIENT_MASTER) &&
+        !(c->flags & CLIENT_MASTER_FORCE_REPLY)) return C_ERR;
+
+    if (!c->conn) return C_ERR; /* Fake client for AOF loading. */
+
+    /* Schedule the client to write the output buffers to the socket, unless
+     * it should already be setup to do so (it has already pending data).
+     *
+     * If CLIENT_PENDING_READ is set, we're in an IO thread and should
+     * not install a write handler. Instead, it will be done by
+     * handleClientsWithPendingReadsUsingThreads() upon return.
+     */
+    if (!clientHasPendingReplies(c) && !(c->flags & CLIENT_PENDING_READ))
+            clientInstallWriteHandler(c);
+
+    /* Authorize the caller to queue in the output buffer of this client. */
+    return C_OK;
+}
+
+/* -----------------------------------------------------------------------------
+ * Low level functions to add more data to output buffers.
+ * -------------------------------------------------------------------------- */
+
+/* Attempts to add the reply to the static buffer in the client struct.
+ * Returns C_ERR if the buffer is full, or the reply list is not empty,
+ * in which case the reply must be added to the reply list. */
+int _addReplyToBuffer(client *c, const char *s, size_t len) {
+    size_t available = sizeof(c->buf)-c->bufpos;
+
+    if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return C_OK;
+
+    /* If there already are entries in the reply list, we cannot
+     * add anything more to the static buffer. */
+    if (listLength(c->reply) > 0) return C_ERR;
+
+    /* Check that the buffer has enough space available for this string. */
+    if (len > available) return C_ERR;
+
+    memcpy(c->buf+c->bufpos,s,len);
+    c->bufpos+=len;
+    return C_OK;
+}
+
+/* Adds the reply to the reply linked list.
+ * Note: some edits to this function need to be relayed to AddReplyFromClient. */
+void _addReplyProtoToList(client *c, const char *s, size_t len) {
+    if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return;
+
+    listNode *ln = listLast(c->reply);
+    clientReplyBlock *tail = ln? listNodeValue(ln): NULL;
+
+    /* Note that 'tail' may be NULL even if we have a tail node, because when
+     * addReplyDeferredLen() is used, it sets a dummy node to NULL just
+     * fo fill it later, when the size of the bulk length is set. */
+
+    /* Append to tail string when possible. */
+    if (tail) {
+        /* Copy the part we can fit into the tail, and leave the rest for a
+         * new node */
+        size_t avail = tail->size - tail->used;
+        size_t copy = avail >= len? len: avail;
+        memcpy(tail->buf + tail->used, s, copy);
+        tail->used += copy;
+        s += copy;
+        len -= copy;
+    }
+    if (len) {
+        /* Create a new node, make sure it is allocated to at
+         * least PROTO_REPLY_CHUNK_BYTES */
+        size_t size = len < PROTO_REPLY_CHUNK_BYTES? PROTO_REPLY_CHUNK_BYTES: len;
+        tail = zmalloc(size + sizeof(clientReplyBlock));
+        /* take over the allocation's internal fragmentation */
+        tail->size = zmalloc_usable_size(tail) - sizeof(clientReplyBlock);
+        tail->used = len;
+        memcpy(tail->buf, s, len);
+        listAddNodeTail(c->reply, tail);
+        c->reply_bytes += tail->size;
+
+        closeClientOnOutputBufferLimitReached(c, 1);
+    }
+}
+
+/* -----------------------------------------------------------------------------
+ * Higher level functions to queue data on the client output buffer.
+ * The following functions are the ones that commands implementations will call.
+ * -------------------------------------------------------------------------- */
+
+/* Add the object 'obj' string representation to the client output buffer. */
+void addReply(client *c, robj *obj) {
+    if (prepareClientToWrite(c) != C_OK) return;
+
+    if (sdsEncodedObject(obj)) {
+        if (_addReplyToBuffer(c,obj->ptr,sdslen(obj->ptr)) != C_OK)
+            _addReplyProtoToList(c,obj->ptr,sdslen(obj->ptr));
+    } else if (obj->encoding == OBJ_ENCODING_INT) {
+        /* For integer encoded strings we just convert it into a string
+         * using our optimized function, and attach the resulting string
+         * to the output buffer. */
+        char buf[32];
+        size_t len = ll2string(buf,sizeof(buf),(long)obj->ptr);
+        if (_addReplyToBuffer(c,buf,len) != C_OK)
+            _addReplyProtoToList(c,buf,len);
+    } else {
+        serverPanic("Wrong obj->encoding in addReply()");
+    }
+}
+
+/* Add the SDS 's' string to the client output buffer, as a side effect
+ * the SDS string is freed. */
+void addReplySds(client *c, sds s) {
+    if (prepareClientToWrite(c) != C_OK) {
+        /* The caller expects the sds to be free'd. */
+        sdsfree(s);
+        return;
+    }
+    if (_addReplyToBuffer(c,s,sdslen(s)) != C_OK)
+        _addReplyProtoToList(c,s,sdslen(s));
+    sdsfree(s);
+}
+
+/* This low level function just adds whatever protocol you send it to the
+ * client buffer, trying the static buffer initially, and using the string
+ * of objects if not possible.
+ *
+ * It is efficient because does not create an SDS object nor an Redis object
+ * if not needed. The object will only be created by calling
+ * _addReplyProtoToList() if we fail to extend the existing tail object
+ * in the list of objects. */
+void addReplyProto(client *c, const char *s, size_t len) {
+    if (prepareClientToWrite(c) != C_OK) return;
+    if (_addReplyToBuffer(c,s,len) != C_OK)
+        _addReplyProtoToList(c,s,len);
+}
+
+/* Low level function called by the addReplyError...() functions.
+ * It emits the protocol for a Redis error, in the form:
+ *
+ * -ERRORCODE Error Message<CR><LF>
+ *
+ * If the error code is already passed in the string 's', the error
+ * code provided is used, otherwise the string "-ERR " for the generic
+ * error code is automatically added.
+ * Note that 's' must NOT end with \r\n. */
+void addReplyErrorLength(client *c, const char *s, size_t len) {
+    /* If the string already starts with "-..." then the error code
+     * is provided by the caller. Otherwise we use "-ERR". */
+    if (!len || s[0] != '-') addReplyProto(c,"-ERR ",5);
+    addReplyProto(c,s,len);
+    addReplyProto(c,"\r\n",2);
+}
+
+/* Do some actions after an error reply was sent (Log if needed, updates stats, etc.) */
+void afterErrorReply(client *c, const char *s, size_t len) {
+    /* Increment the global error counter */
+    server.stat_total_error_replies++;
+    /* Increment the error stats
+     * If the string already starts with "-..." then the error prefix
+     * is provided by the caller ( we limit the search to 32 chars). Otherwise we use "-ERR". */
+    if (s[0] != '-') {
+        incrementErrorCount("ERR", 3);
+    } else {
+        char *spaceloc = memchr(s, ' ', len < 32 ? len : 32);
+        if (spaceloc) {
+            const size_t errEndPos = (size_t)(spaceloc - s);
+            incrementErrorCount(s+1, errEndPos-1);
+        } else {
+            /* Fallback to ERR if we can't retrieve the error prefix */
+            incrementErrorCount("ERR", 3);
+        }
+    }
+
+    /* Sometimes it could be normal that a slave replies to a master with
+     * an error and this function gets called. Actually the error will never
+     * be sent because addReply*() against master clients has no effect...
+     * A notable example is:
+     *
+     *    EVAL 'redis.call("incr",KEYS[1]); redis.call("nonexisting")' 1 x
+     *
+     * Where the master must propagate the first change even if the second
+     * will produce an error. However it is useful to log such events since
+     * they are rare and may hint at errors in a script or a bug in Redis. */
+    int ctype = getClientType(c);
+    if (ctype == CLIENT_TYPE_MASTER || ctype == CLIENT_TYPE_SLAVE || c->id == CLIENT_ID_AOF) {
+        char *to, *from;
+
+        if (c->id == CLIENT_ID_AOF) {
+            to = "AOF-loading-client";
+            from = "server";
+        } else if (ctype == CLIENT_TYPE_MASTER) {
+            to = "master";
+            from = "replica";
+        } else {
+            to = "replica";
+            from = "master";
+        }
+
+        if (len > 4096) len = 4096;
+        char *cmdname = c->lastcmd ? c->lastcmd->name : "<unknown>";
+        serverLog(LL_WARNING,"== CRITICAL == This %s is sending an error "
+                             "to its %s: '%.*s' after processing the command "
+                             "'%s'", from, to, (int)len, s, cmdname);
+        if (ctype == CLIENT_TYPE_MASTER && server.repl_backlog &&
+            server.repl_backlog_histlen > 0)
+        {
+            showLatestBacklog();
+        }
+        server.stat_unexpected_error_replies++;
+    }
+}
+
+/* The 'err' object is expected to start with -ERRORCODE and end with \r\n.
+ * Unlike addReplyErrorSds and others alike which rely on addReplyErrorLength. */
+void addReplyErrorObject(client *c, robj *err) {
+    addReply(c, err);
+    afterErrorReply(c, err->ptr, sdslen(err->ptr)-2); /* Ignore trailing \r\n */
+}
+
+/* See addReplyErrorLength for expectations from the input string. */
+void addReplyError(client *c, const char *err) {
+    addReplyErrorLength(c,err,strlen(err));
+    afterErrorReply(c,err,strlen(err));
+}
+
+/* See addReplyErrorLength for expectations from the input string. */
+/* As a side effect the SDS string is freed. */
+void addReplyErrorSds(client *c, sds err) {
+    addReplyErrorLength(c,err,sdslen(err));
+    afterErrorReply(c,err,sdslen(err));
+    sdsfree(err);
+}
+
+/* See addReplyErrorLength for expectations from the formatted string.
+ * The formatted string is safe to contain \r and \n anywhere. */
+void addReplyErrorFormat(client *c, const char *fmt, ...) {
+    va_list ap;
+    va_start(ap,fmt);
+    sds s = sdscatvprintf(sdsempty(),fmt,ap);
+    va_end(ap);
+    /* Trim any newlines at the end (ones will be added by addReplyErrorLength) */
+    s = sdstrim(s, "\r\n");
+    /* Make sure there are no newlines in the middle of the string, otherwise
+     * invalid protocol is emitted. */
+    s = sdsmapchars(s, "\r\n", "  ",  2);
+    addReplyErrorLength(c,s,sdslen(s));
+    afterErrorReply(c,s,sdslen(s));
+    sdsfree(s);
+}
+
+void addReplyStatusLength(client *c, const char *s, size_t len) {
+    addReplyProto(c,"+",1);
+    addReplyProto(c,s,len);
+    addReplyProto(c,"\r\n",2);
+}
+
+void addReplyStatus(client *c, const char *status) {
+    addReplyStatusLength(c,status,strlen(status));
+}
+
+void addReplyStatusFormat(client *c, const char *fmt, ...) {
+    va_list ap;
+    va_start(ap,fmt);
+    sds s = sdscatvprintf(sdsempty(),fmt,ap);
+    va_end(ap);
+    addReplyStatusLength(c,s,sdslen(s));
+    sdsfree(s);
+}
+
+/* Sometimes we are forced to create a new reply node, and we can't append to
+ * the previous one, when that happens, we wanna try to trim the unused space
+ * at the end of the last reply node which we won't use anymore. */
+void trimReplyUnusedTailSpace(client *c) {
+    listNode *ln = listLast(c->reply);
+    clientReplyBlock *tail = ln? listNodeValue(ln): NULL;
+
+    /* Note that 'tail' may be NULL even if we have a tail node, because when
+     * addReplyDeferredLen() is used */
+    if (!tail) return;
+
+    /* We only try to trim the space is relatively high (more than a 1/4 of the
+     * allocation), otherwise there's a high chance realloc will NOP.
+     * Also, to avoid large memmove which happens as part of realloc, we only do
+     * that if the used part is small.  */
+    if (tail->size - tail->used > tail->size / 4 &&
+        tail->used < PROTO_REPLY_CHUNK_BYTES)
+    {
+        size_t old_size = tail->size;
+        tail = zrealloc(tail, tail->used + sizeof(clientReplyBlock));
+        /* take over the allocation's internal fragmentation (at least for
+         * memory usage tracking) */
+        tail->size = zmalloc_usable_size(tail) - sizeof(clientReplyBlock);
+        c->reply_bytes = c->reply_bytes + tail->size - old_size;
+        listNodeValue(ln) = tail;
+    }
+}
+
+/* Adds an empty object to the reply list that will contain the multi bulk
+ * length, which is not known when this function is called. */
+void *addReplyDeferredLen(client *c) {
+    /* Note that we install the write event here even if the object is not
+     * ready to be sent, since we are sure that before returning to the
+     * event loop setDeferredAggregateLen() will be called. */
+    if (prepareClientToWrite(c) != C_OK) return NULL;
+    trimReplyUnusedTailSpace(c);
+    listAddNodeTail(c->reply,NULL); /* NULL is our placeholder. */
+    return listLast(c->reply);
+}
+
+void setDeferredReply(client *c, void *node, const char *s, size_t length) {
+    listNode *ln = (listNode*)node;
+    clientReplyBlock *next, *prev;
+
+    /* Abort when *node is NULL: when the client should not accept writes
+     * we return NULL in addReplyDeferredLen() */
+    if (node == NULL) return;
+    serverAssert(!listNodeValue(ln));
+
+    /* Normally we fill this dummy NULL node, added by addReplyDeferredLen(),
+     * with a new buffer structure containing the protocol needed to specify
+     * the length of the array following. However sometimes there might be room
+     * in the previous/next node so we can instead remove this NULL node, and
+     * suffix/prefix our data in the node immediately before/after it, in order
+     * to save a write(2) syscall later. Conditions needed to do it:
+     *
+     * - The prev node is non-NULL and has space in it or
+     * - The next node is non-NULL,
+     * - It has enough room already allocated
+     * - And not too large (avoid large memmove) */
+    if (ln->prev != NULL && (prev = listNodeValue(ln->prev)) &&
+        prev->size - prev->used > 0)
+    {
+        size_t len_to_copy = prev->size - prev->used;
+        if (len_to_copy > length)
+            len_to_copy = length;
+        memcpy(prev->buf + prev->used, s, len_to_copy);
+        prev->used += len_to_copy;
+        length -= len_to_copy;
+        if (length == 0) {
+            listDelNode(c->reply, ln);
+            return;
+        }
+        s += len_to_copy;
+    }
+
+    if (ln->next != NULL && (next = listNodeValue(ln->next)) &&
+        next->size - next->used >= length &&
+        next->used < PROTO_REPLY_CHUNK_BYTES * 4)
+    {
+        memmove(next->buf + length, next->buf, next->used);
+        memcpy(next->buf, s, length);
+        next->used += length;
+        listDelNode(c->reply,ln);
+    } else {
+        /* Create a new node */
+        clientReplyBlock *buf = zmalloc(length + sizeof(clientReplyBlock));
+        /* Take over the allocation's internal fragmentation */
+        buf->size = zmalloc_usable_size(buf) - sizeof(clientReplyBlock);
+        buf->used = length;
+        memcpy(buf->buf, s, length);
+        listNodeValue(ln) = buf;
+        c->reply_bytes += buf->size;
+
+        closeClientOnOutputBufferLimitReached(c, 1);
+    }
+}
+
+/* Populate the length object and try gluing it to the next chunk. */
+void setDeferredAggregateLen(client *c, void *node, long length, char prefix) {
+    serverAssert(length >= 0);
+
+    /* Abort when *node is NULL: when the client should not accept writes
+     * we return NULL in addReplyDeferredLen() */
+    if (node == NULL) return;
+
+    char lenstr[128];
+    size_t lenstr_len = sprintf(lenstr, "%c%ld\r\n", prefix, length);
+    setDeferredReply(c, node, lenstr, lenstr_len);
+}
+
+void setDeferredArrayLen(client *c, void *node, long length) {
+    setDeferredAggregateLen(c,node,length,'*');
+}
+
+void setDeferredMapLen(client *c, void *node, long length) {
+    int prefix = c->resp == 2 ? '*' : '%';
+    if (c->resp == 2) length *= 2;
+    setDeferredAggregateLen(c,node,length,prefix);
+}
+
+void setDeferredSetLen(client *c, void *node, long length) {
+    int prefix = c->resp == 2 ? '*' : '~';
+    setDeferredAggregateLen(c,node,length,prefix);
+}
+
+void setDeferredAttributeLen(client *c, void *node, long length) {
+    serverAssert(c->resp >= 3);
+    setDeferredAggregateLen(c,node,length,'|');
+}
+
+void setDeferredPushLen(client *c, void *node, long length) {
+    serverAssert(c->resp >= 3);
+    setDeferredAggregateLen(c,node,length,'>');
+}
+
+/* Add a double as a bulk reply */
+void addReplyDouble(client *c, double d) {
+    if (isinf(d)) {
+        /* Libc in odd systems (Hi Solaris!) will format infinite in a
+         * different way, so better to handle it in an explicit way. */
+        if (c->resp == 2) {
+            addReplyBulkCString(c, d > 0 ? "inf" : "-inf");
+        } else {
+            addReplyProto(c, d > 0 ? ",inf\r\n" : ",-inf\r\n",
+                              d > 0 ? 6 : 7);
+        }
+    } else {
+        char dbuf[MAX_LONG_DOUBLE_CHARS+3],
+             sbuf[MAX_LONG_DOUBLE_CHARS+32];
+        int dlen, slen;
+        if (c->resp == 2) {
+            dlen = snprintf(dbuf,sizeof(dbuf),"%.17g",d);
+            slen = snprintf(sbuf,sizeof(sbuf),"$%d\r\n%s\r\n",dlen,dbuf);
+            addReplyProto(c,sbuf,slen);
+        } else {
+            dlen = snprintf(dbuf,sizeof(dbuf),",%.17g\r\n",d);
+            addReplyProto(c,dbuf,dlen);
+        }
+    }
+}
+
+void addReplyBigNum(client *c, const char* num, size_t len) {
+    if (c->resp == 2) {
+        addReplyBulkCBuffer(c, num, len);
+    } else {
+        addReplyProto(c,"(",1);
+        addReplyProto(c,num,len);
+        addReply(c,shared.crlf);
+    }
+}
+
+/* Add a long double as a bulk reply, but uses a human readable formatting
+ * of the double instead of exposing the crude behavior of doubles to the
+ * dear user. */
+void addReplyHumanLongDouble(client *c, long double d) {
+    if (c->resp == 2) {
+        robj *o = createStringObjectFromLongDouble(d,1);
+        addReplyBulk(c,o);
+        decrRefCount(o);
+    } else {
+        char buf[MAX_LONG_DOUBLE_CHARS];
+        int len = ld2string(buf,sizeof(buf),d,LD_STR_HUMAN);
+        addReplyProto(c,",",1);
+        addReplyProto(c,buf,len);
+        addReplyProto(c,"\r\n",2);
+    }
+}
+
+/* Add a long long as integer reply or bulk len / multi bulk count.
+ * Basically this is used to output <prefix><long long><crlf>. */
+void addReplyLongLongWithPrefix(client *c, long long ll, char prefix) {
+    char buf[128];
+    int len;
+
+    /* Things like $3\r\n or *2\r\n are emitted very often by the protocol
+     * so we have a few shared objects to use if the integer is small
+     * like it is most of the times. */
+    if (prefix == '*' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {
+        addReply(c,shared.mbulkhdr[ll]);
+        return;
+    } else if (prefix == '$' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {
+        addReply(c,shared.bulkhdr[ll]);
+        return;
+    }
+
+    buf[0] = prefix;
+    len = ll2string(buf+1,sizeof(buf)-1,ll);
+    buf[len+1] = '\r';
+    buf[len+2] = '\n';
+    addReplyProto(c,buf,len+3);
+}
+
+void addReplyLongLong(client *c, long long ll) {
+    if (ll == 0)
+        addReply(c,shared.czero);
+    else if (ll == 1)
+        addReply(c,shared.cone);
+    else
+        addReplyLongLongWithPrefix(c,ll,':');
+}
+
+void addReplyAggregateLen(client *c, long length, int prefix) {
+    serverAssert(length >= 0);
+    addReplyLongLongWithPrefix(c,length,prefix);
+}
+
+void addReplyArrayLen(client *c, long length) {
+    addReplyAggregateLen(c,length,'*');
+}
+
+void addReplyMapLen(client *c, long length) {
+    int prefix = c->resp == 2 ? '*' : '%';
+    if (c->resp == 2) length *= 2;
+    addReplyAggregateLen(c,length,prefix);
+}
+
+void addReplySetLen(client *c, long length) {
+    int prefix = c->resp == 2 ? '*' : '~';
+    addReplyAggregateLen(c,length,prefix);
+}
+
+void addReplyAttributeLen(client *c, long length) {
+    serverAssert(c->resp >= 3);
+    addReplyAggregateLen(c,length,'|');
+}
+
+void addReplyPushLen(client *c, long length) {
+    serverAssert(c->resp >= 3);
+    addReplyAggregateLen(c,length,'>');
+}
+
+void addReplyNull(client *c) {
+    if (c->resp == 2) {
+        addReplyProto(c,"$-1\r\n",5);
+    } else {
+        addReplyProto(c,"_\r\n",3);
+    }
+}
+
+void addReplyBool(client *c, int b) {
+    if (c->resp == 2) {
+        addReply(c, b ? shared.cone : shared.czero);
+    } else {
+        addReplyProto(c, b ? "#t\r\n" : "#f\r\n",4);
+    }
+}
+
+/* A null array is a concept that no longer exists in RESP3. However
+ * RESP2 had it, so API-wise we have this call, that will emit the correct
+ * RESP2 protocol, however for RESP3 the reply will always be just the
+ * Null type "_\r\n". */
+void addReplyNullArray(client *c) {
+    if (c->resp == 2) {
+        addReplyProto(c,"*-1\r\n",5);
+    } else {
+        addReplyProto(c,"_\r\n",3);
+    }
+}
+
+/* Create the length prefix of a bulk reply, example: $2234 */
+void addReplyBulkLen(client *c, robj *obj) {
+    size_t len = stringObjectLen(obj);
+
+    addReplyLongLongWithPrefix(c,len,'$');
+}
+
+/* Add a Redis Object as a bulk reply */
+void addReplyBulk(client *c, robj *obj) {
+    addReplyBulkLen(c,obj);
+    addReply(c,obj);
+    addReply(c,shared.crlf);
+}
+
+/* Add a C buffer as bulk reply */
+void addReplyBulkCBuffer(client *c, const void *p, size_t len) {
+    addReplyLongLongWithPrefix(c,len,'$');
+    addReplyProto(c,p,len);
+    addReply(c,shared.crlf);
+}
+
+/* Add sds to reply (takes ownership of sds and frees it) */
+void addReplyBulkSds(client *c, sds s)  {
+    addReplyLongLongWithPrefix(c,sdslen(s),'$');
+    addReplySds(c,s);
+    addReply(c,shared.crlf);
+}
+
+/* Set sds to a deferred reply (for symmetry with addReplyBulkSds it also frees the sds) */
+void setDeferredReplyBulkSds(client *c, void *node, sds s) {
+    sds reply = sdscatprintf(sdsempty(), "$%d\r\n%s\r\n", (unsigned)sdslen(s), s);
+    setDeferredReply(c, node, reply, sdslen(reply));
+    sdsfree(reply);
+    sdsfree(s);
+}
+
+/* Add a C null term string as bulk reply */
+void addReplyBulkCString(client *c, const char *s) {
+    if (s == NULL) {
+        addReplyNull(c);
+    } else {
+        addReplyBulkCBuffer(c,s,strlen(s));
+    }
+}
+
+/* Add a long long as a bulk reply */
+void addReplyBulkLongLong(client *c, long long ll) {
+    char buf[64];
+    int len;
+
+    len = ll2string(buf,64,ll);
+    addReplyBulkCBuffer(c,buf,len);
+}
+
+/* Reply with a verbatim type having the specified extension.
+ *
+ * The 'ext' is the "extension" of the file, actually just a three
+ * character type that describes the format of the verbatim string.
+ * For instance "txt" means it should be interpreted as a text only
+ * file by the receiver, "md " as markdown, and so forth. Only the
+ * three first characters of the extension are used, and if the
+ * provided one is shorter than that, the remaining is filled with
+ * spaces. */
+void addReplyVerbatim(client *c, const char *s, size_t len, const char *ext) {
+    if (c->resp == 2) {
+        addReplyBulkCBuffer(c,s,len);
+    } else {
+        char buf[32];
+        size_t preflen = snprintf(buf,sizeof(buf),"=%zu\r\nxxx:",len+4);
+        char *p = buf+preflen-4;
+        for (int i = 0; i < 3; i++) {
+            if (*ext == '\0') {
+                p[i] = ' ';
+            } else {
+                p[i] = *ext++;
+            }
+        }
+        addReplyProto(c,buf,preflen);
+        addReplyProto(c,s,len);
+        addReplyProto(c,"\r\n",2);
+    }
+}
+
+/* Add an array of C strings as status replies with a heading.
+ * This function is typically invoked by from commands that support
+ * subcommands in response to the 'help' subcommand. The help array
+ * is terminated by NULL sentinel. */
+void addReplyHelp(client *c, const char **help) {
+    sds cmd = sdsnew((char*) c->argv[0]->ptr);
+    void *blenp = addReplyDeferredLen(c);
+    int blen = 0;
+
+    sdstoupper(cmd);
+    addReplyStatusFormat(c,
+        "%s <subcommand> [<arg> [value] [opt] ...]. Subcommands are:",cmd);
+    sdsfree(cmd);
+
+    while (help[blen]) addReplyStatus(c,help[blen++]);
+
+    addReplyStatus(c,"HELP");
+    addReplyStatus(c,"    Prints this help.");
+
+    blen += 1;  /* Account for the header. */
+    blen += 2;  /* Account for the footer. */
+    setDeferredArrayLen(c,blenp,blen);
+}
+
+/* Add a suggestive error reply.
+ * This function is typically invoked by from commands that support
+ * subcommands in response to an unknown subcommand or argument error. */
+void addReplySubcommandSyntaxError(client *c) {
+    sds cmd = sdsnew((char*) c->argv[0]->ptr);
+    sdstoupper(cmd);
+    addReplyErrorFormat(c,
+        "Unknown subcommand or wrong number of arguments for '%s'. Try %s HELP.",
+        (char*)c->argv[1]->ptr,cmd);
+    sdsfree(cmd);
+}
+
+/* Append 'src' client output buffers into 'dst' client output buffers.
+ * This function clears the output buffers of 'src' */
+void AddReplyFromClient(client *dst, client *src) {
+    /* If the source client contains a partial response due to client output
+     * buffer limits, propagate that to the dest rather than copy a partial
+     * reply. We don't wanna run the risk of copying partial response in case
+     * for some reason the output limits don't reach the same decision (maybe
+     * they changed) */
+    if (src->flags & CLIENT_CLOSE_ASAP) {
+        sds client = catClientInfoString(sdsempty(),dst);
+        freeClientAsync(dst);
+        serverLog(LL_WARNING,"Client %s scheduled to be closed ASAP for overcoming of output buffer limits.", client);
+        sdsfree(client);
+        return;
+    }
+
+    /* First add the static buffer (either into the static buffer or reply list) */
+    addReplyProto(dst,src->buf, src->bufpos);
+
+    /* We need to check with prepareClientToWrite again (after addReplyProto)
+     * since addReplyProto may have changed something (like CLIENT_CLOSE_ASAP) */
+    if (prepareClientToWrite(dst) != C_OK)
+        return;
+
+    /* We're bypassing _addReplyProtoToList, so we need to add the pre/post
+     * checks in it. */
+    if (dst->flags & CLIENT_CLOSE_AFTER_REPLY) return;
+
+    /* Concatenate the reply list into the dest */
+    if (listLength(src->reply))
+        listJoin(dst->reply,src->reply);
+    dst->reply_bytes += src->reply_bytes;
+    src->reply_bytes = 0;
+    src->bufpos = 0;
+
+    /* Check output buffer limits */
+    closeClientOnOutputBufferLimitReached(dst, 1);
+}
+
+/* Copy 'src' client output buffers into 'dst' client output buffers.
+ * The function takes care of freeing the old output buffers of the
+ * destination client. */
+void copyClientOutputBuffer(client *dst, client *src) {
+    listRelease(dst->reply);
+    dst->sentlen = 0;
+    dst->reply = listDup(src->reply);
+    memcpy(dst->buf,src->buf,src->bufpos);
+    dst->bufpos = src->bufpos;
+    dst->reply_bytes = src->reply_bytes;
+}
+
+/* Return true if the specified client has pending reply buffers to write to
+ * the socket. */
+int clientHasPendingReplies(client *c) {
+    return c->bufpos || listLength(c->reply);
+}
+
+void clientAcceptHandler(connection *conn) {
+    client *c = connGetPrivateData(conn);
+
+    if (connGetState(conn) != CONN_STATE_CONNECTED) {
+        serverLog(LL_WARNING,
+                "Error accepting a client connection: %s",
+                connGetLastError(conn));
+        freeClientAsync(c);
+        return;
+    }
+
+    /* If the server is running in protected mode (the default) and there
+     * is no password set, nor a specific interface is bound, we don't accept
+     * requests from non loopback interfaces. Instead we try to explain the
+     * user what to do to fix it if needed. */
+    if (server.protected_mode &&
+        server.bindaddr_count == 0 &&
+        DefaultUser->flags & USER_FLAG_NOPASS &&
+        !(c->flags & CLIENT_UNIX_SOCKET))
+    {
+        char cip[NET_IP_STR_LEN+1] = { 0 };
+        connPeerToString(conn, cip, sizeof(cip)-1, NULL);
+
+        if (strcmp(cip,"127.0.0.1") && strcmp(cip,"::1")) {
+            char *err =
+                "-DENIED Redis is running in protected mode because protected "
+                "mode is enabled, no bind address was specified, no "
+                "authentication password is requested to clients. In this mode "
+                "connections are only accepted from the loopback interface. "
+                "If you want to connect from external computers to Redis you "
+                "may adopt one of the following solutions: "
+                "1) Just disable protected mode sending the command "
+                "'CONFIG SET protected-mode no' from the loopback interface "
+                "by connecting to Redis from the same host the server is "
+                "running, however MAKE SURE Redis is not publicly accessible "
+                "from internet if you do so. Use CONFIG REWRITE to make this "
+                "change permanent. "
+                "2) Alternatively you can just disable the protected mode by "
+                "editing the Redis configuration file, and setting the protected "
+                "mode option to 'no', and then restarting the server. "
+                "3) If you started the server manually just for testing, restart "
+                "it with the '--protected-mode no' option. "
+                "4) Setup a bind address or an authentication password. "
+                "NOTE: You only need to do one of the above things in order for "
+                "the server to start accepting connections from the outside.\r\n";
+            if (connWrite(c->conn,err,strlen(err)) == -1) {
+                /* Nothing to do, Just to avoid the warning... */
+            }
+            server.stat_rejected_conn++;
+            freeClientAsync(c);
+            return;
+        }
+    }
+
+    server.stat_numconnections++;
+    moduleFireServerEvent(REDISMODULE_EVENT_CLIENT_CHANGE,
+                          REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED,
+                          c);
+}
+
+#define MAX_ACCEPTS_PER_CALL 1000
+static void acceptCommonHandler(connection *conn, int flags, char *ip) {
+    client *c;
+    char conninfo[100];
+    UNUSED(ip);
+
+    if (connGetState(conn) != CONN_STATE_ACCEPTING) {
+        serverLog(LL_VERBOSE,
+            "Accepted client connection in error state: %s (conn: %s)",
+            connGetLastError(conn),
+            connGetInfo(conn, conninfo, sizeof(conninfo)));
+        connClose(conn);
+        return;
+    }
+
+    /* Limit the number of connections we take at the same time.
+     *
+     * Admission control will happen before a client is created and connAccept()
+     * called, because we don't want to even start transport-level negotiation
+     * if rejected. */
+    if (listLength(server.clients) + getClusterConnectionsCount()
+        >= server.maxclients)
+    {
+        char *err;
+        if (server.cluster_enabled)
+            err = "-ERR max number of clients + cluster "
+                  "connections reached\r\n";
+        else
+            err = "-ERR max number of clients reached\r\n";
+
+        /* That's a best effort error message, don't check write errors.
+         * Note that for TLS connections, no handshake was done yet so nothing
+         * is written and the connection will just drop. */
+        if (connWrite(conn,err,strlen(err)) == -1) {
+            /* Nothing to do, Just to avoid the warning... */
+        }
+        server.stat_rejected_conn++;
+        connClose(conn);
+        return;
+    }
+
+    /* Create connection and client */
+    if ((c = createClient(conn)) == NULL) {
+        serverLog(LL_WARNING,
+            "Error registering fd event for the new client: %s (conn: %s)",
+            connGetLastError(conn),
+            connGetInfo(conn, conninfo, sizeof(conninfo)));
+        connClose(conn); /* May be already closed, just ignore errors */
+        return;
+    }
+
+    /* Last chance to keep flags */
+    c->flags |= flags;
+
+    /* Initiate accept.
+     *
+     * Note that connAccept() is free to do two things here:
+     * 1. Call clientAcceptHandler() immediately;
+     * 2. Schedule a future call to clientAcceptHandler().
+     *
+     * Because of that, we must do nothing else afterwards.
+     */
+    if (connAccept(conn, clientAcceptHandler) == C_ERR) {
+        char conninfo[100];
+        if (connGetState(conn) == CONN_STATE_ERROR)
+            serverLog(LL_WARNING,
+                    "Error accepting a client connection: %s (conn: %s)",
+                    connGetLastError(conn), connGetInfo(conn, conninfo, sizeof(conninfo)));
+        freeClient(connGetPrivateData(conn));
+        return;
+    }
+}
+
+void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    int cport, cfd, max = MAX_ACCEPTS_PER_CALL;
+    char cip[NET_IP_STR_LEN];
+    UNUSED(el);
+    UNUSED(mask);
+    UNUSED(privdata);
+
+    while(max--) {
+        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
+        if (cfd == ANET_ERR) {
+            if (errno != EWOULDBLOCK)
+                serverLog(LL_WARNING,
+                    "Accepting client connection: %s", server.neterr);
+            return;
+        }
+        anetCloexec(cfd);
+        serverLog(LL_VERBOSE,"Accepted %s:%d", cip, cport);
+        acceptCommonHandler(connCreateAcceptedSocket(cfd),0,cip);
+    }
+}
+
+void acceptTLSHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    int cport, cfd, max = MAX_ACCEPTS_PER_CALL;
+    char cip[NET_IP_STR_LEN];
+    UNUSED(el);
+    UNUSED(mask);
+    UNUSED(privdata);
+
+    while(max--) {
+        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
+        if (cfd == ANET_ERR) {
+            if (errno != EWOULDBLOCK)
+                serverLog(LL_WARNING,
+                    "Accepting client connection: %s", server.neterr);
+            return;
+        }
+        anetCloexec(cfd);
+        serverLog(LL_VERBOSE,"Accepted %s:%d", cip, cport);
+        acceptCommonHandler(connCreateAcceptedTLS(cfd, server.tls_auth_clients),0,cip);
+    }
+}
+
+void acceptUnixHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    int cfd, max = MAX_ACCEPTS_PER_CALL;
+    UNUSED(el);
+    UNUSED(mask);
+    UNUSED(privdata);
+
+    while(max--) {
+        cfd = anetUnixAccept(server.neterr, fd);
+        if (cfd == ANET_ERR) {
+            if (errno != EWOULDBLOCK)
+                serverLog(LL_WARNING,
+                    "Accepting client connection: %s", server.neterr);
+            return;
+        }
+        anetCloexec(cfd);
+        serverLog(LL_VERBOSE,"Accepted connection to %s", server.unixsocket);
+        acceptCommonHandler(connCreateAcceptedSocket(cfd),CLIENT_UNIX_SOCKET,NULL);
+    }
+}
+
+void freeClientOriginalArgv(client *c) {
+    /* We didn't rewrite this client */
+    if (!c->original_argv) return;
+
+    for (int j = 0; j < c->original_argc; j++)
+        decrRefCount(c->original_argv[j]);
+    zfree(c->original_argv);
+    c->original_argv = NULL;
+    c->original_argc = 0;
+}
+
+static void freeClientArgv(client *c) {
+    int j;
+    for (j = 0; j < c->argc; j++)
+        decrRefCount(c->argv[j]);
+    c->argc = 0;
+    c->cmd = NULL;
+    c->argv_len_sum = 0;
+}
+
+/* Close all the slaves connections. This is useful in chained replication
+ * when we resync with our own master and want to force all our slaves to
+ * resync with us as well. */
+void disconnectSlaves(void) {
+    listIter li;
+    listNode *ln;
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        freeClient((client*)ln->value);
+    }
+}
+
+/* Check if there is any other slave waiting dumping RDB finished expect me.
+ * This function is useful to judge current dumping RDB can be used for full
+ * synchronization or not. */
+int anyOtherSlaveWaitRdb(client *except_me) {
+    listIter li;
+    listNode *ln;
+
+    listRewind(server.slaves, &li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+        if (slave != except_me &&
+            slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END)
+        {
+            return 1;
+        }
+    }
+    return 0;
+}
+
+/* Remove the specified client from global lists where the client could
+ * be referenced, not including the Pub/Sub channels.
+ * This is used by freeClient() and replicationCacheMaster(). */
+void unlinkClient(client *c) {
+    listNode *ln;
+
+    /* If this is marked as current client unset it. */
+    if (server.current_client == c) server.current_client = NULL;
+
+    /* Certain operations must be done only if the client has an active connection.
+     * If the client was already unlinked or if it's a "fake client" the
+     * conn is already set to NULL. */
+    if (c->conn) {
+        /* Remove from the list of active clients. */
+        if (c->client_list_node) {
+            uint64_t id = htonu64(c->id);
+            raxRemove(server.clients_index,(unsigned char*)&id,sizeof(id),NULL);
+            listDelNode(server.clients,c->client_list_node);
+            c->client_list_node = NULL;
+        }
+
+        /* Check if this is a replica waiting for diskless replication (rdb pipe),
+         * in which case it needs to be cleaned from that list */
+        if (c->flags & CLIENT_SLAVE &&
+            c->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
+            server.rdb_pipe_conns)
+        {
+            int i;
+            for (i=0; i < server.rdb_pipe_numconns; i++) {
+                if (server.rdb_pipe_conns[i] == c->conn) {
+                    rdbPipeWriteHandlerConnRemoved(c->conn);
+                    server.rdb_pipe_conns[i] = NULL;
+                    break;
+                }
+            }
+        }
+        connClose(c->conn);
+        c->conn = NULL;
+    }
+
+    /* Remove from the list of pending writes if needed. */
+    if (c->flags & CLIENT_PENDING_WRITE) {
+        ln = listSearchKey(server.clients_pending_write,c);
+        serverAssert(ln != NULL);
+        listDelNode(server.clients_pending_write,ln);
+        c->flags &= ~CLIENT_PENDING_WRITE;
+    }
+
+    /* Remove from the list of pending reads if needed. */
+    if (c->flags & CLIENT_PENDING_READ) {
+        ln = listSearchKey(server.clients_pending_read,c);
+        serverAssert(ln != NULL);
+        listDelNode(server.clients_pending_read,ln);
+        c->flags &= ~CLIENT_PENDING_READ;
+    }
+
+    /* When client was just unblocked because of a blocking operation,
+     * remove it from the list of unblocked clients. */
+    if (c->flags & CLIENT_UNBLOCKED) {
+        ln = listSearchKey(server.unblocked_clients,c);
+        serverAssert(ln != NULL);
+        listDelNode(server.unblocked_clients,ln);
+        c->flags &= ~CLIENT_UNBLOCKED;
+    }
+
+    /* Clear the tracking status. */
+    if (c->flags & CLIENT_TRACKING) disableTracking(c);
+}
+
+void freeClient(client *c) {
+    listNode *ln;
+
+    /* If a client is protected, yet we need to free it right now, make sure
+     * to at least use asynchronous freeing. */
+    if (c->flags & CLIENT_PROTECTED) {
+        freeClientAsync(c);
+        return;
+    }
+
+    /* For connected clients, call the disconnection event of modules hooks. */
+    if (c->conn) {
+        moduleFireServerEvent(REDISMODULE_EVENT_CLIENT_CHANGE,
+                              REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED,
+                              c);
+    }
+
+    /* Notify module system that this client auth status changed. */
+    moduleNotifyUserChanged(c);
+
+    /* If this client was scheduled for async freeing we need to remove it
+     * from the queue. Note that we need to do this here, because later
+     * we may call replicationCacheMaster() and the client should already
+     * be removed from the list of clients to free. */
+    if (c->flags & CLIENT_CLOSE_ASAP) {
+        ln = listSearchKey(server.clients_to_close,c);
+        serverAssert(ln != NULL);
+        listDelNode(server.clients_to_close,ln);
+    }
+
+    /* If it is our master that's being disconnected we should make sure
+     * to cache the state to try a partial resynchronization later.
+     *
+     * Note that before doing this we make sure that the client is not in
+     * some unexpected state, by checking its flags. */
+    if (server.master && c->flags & CLIENT_MASTER) {
+        serverLog(LL_WARNING,"Connection with master lost.");
+        if (!(c->flags & (CLIENT_PROTOCOL_ERROR|CLIENT_BLOCKED))) {
+            c->flags &= ~(CLIENT_CLOSE_ASAP|CLIENT_CLOSE_AFTER_REPLY);
+            replicationCacheMaster(c);
+            return;
+        }
+    }
+
+    /* Log link disconnection with slave */
+    if (getClientType(c) == CLIENT_TYPE_SLAVE) {
+        serverLog(LL_WARNING,"Connection with replica %s lost.",
+            replicationGetSlaveName(c));
+    }
+
+    /* Free the query buffer */
+    sdsfree(c->querybuf);
+    sdsfree(c->pending_querybuf);
+    c->querybuf = NULL;
+
+    /* Deallocate structures used to block on blocking ops. */
+    if (c->flags & CLIENT_BLOCKED) unblockClient(c);
+    dictRelease(c->bpop.keys);
+
+    /* UNWATCH all the keys */
+    unwatchAllKeys(c);
+    listRelease(c->watched_keys);
+
+    /* Unsubscribe from all the pubsub channels */
+    pubsubUnsubscribeAllChannels(c,0);
+    pubsubUnsubscribeAllPatterns(c,0);
+    dictRelease(c->pubsub_channels);
+    listRelease(c->pubsub_patterns);
+
+    /* Free data structures. */
+    listRelease(c->reply);
+    freeClientArgv(c);
+    freeClientOriginalArgv(c);
+
+    /* Unlink the client: this will close the socket, remove the I/O
+     * handlers, and remove references of the client from different
+     * places where active clients may be referenced. */
+    unlinkClient(c);
+
+    /* Master/slave cleanup Case 1:
+     * we lost the connection with a slave. */
+    if (c->flags & CLIENT_SLAVE) {
+        /* If there is no any other slave waiting dumping RDB finished, the
+         * current child process need not continue to dump RDB, then we kill it.
+         * So child process won't use more memory, and we also can fork a new
+         * child process asap to dump rdb for next full synchronization or bgsave.
+         * But we also need to check if users enable 'save' RDB, if enable, we
+         * should not remove directly since that means RDB is important for users
+         * to keep data safe and we may delay configured 'save' for full sync. */
+        if (server.saveparamslen == 0 &&
+            c->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
+            server.child_type == CHILD_TYPE_RDB &&
+            server.rdb_child_type == RDB_CHILD_TYPE_DISK &&
+            anyOtherSlaveWaitRdb(c) == 0)
+        {
+            killRDBChild();
+        }
+        if (c->replstate == SLAVE_STATE_SEND_BULK) {
+            if (c->repldbfd != -1) close(c->repldbfd);
+            if (c->replpreamble) sdsfree(c->replpreamble);
+        }
+        list *l = (c->flags & CLIENT_MONITOR) ? server.monitors : server.slaves;
+        ln = listSearchKey(l,c);
+        serverAssert(ln != NULL);
+        listDelNode(l,ln);
+        /* We need to remember the time when we started to have zero
+         * attached slaves, as after some time we'll free the replication
+         * backlog. */
+        if (getClientType(c) == CLIENT_TYPE_SLAVE && listLength(server.slaves) == 0)
+            server.repl_no_slaves_since = server.unixtime;
+        refreshGoodSlavesCount();
+        /* Fire the replica change modules event. */
+        if (c->replstate == SLAVE_STATE_ONLINE)
+            moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
+                                  REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE,
+                                  NULL);
+    }
+
+    /* Master/slave cleanup Case 2:
+     * we lost the connection with the master. */
+    if (c->flags & CLIENT_MASTER) replicationHandleMasterDisconnection();
+
+   /* Remove the contribution that this client gave to our
+     * incrementally computed memory usage. */
+    server.stat_clients_type_memory[c->client_cron_last_memory_type] -=
+        c->client_cron_last_memory_usage;
+
+    /* Release other dynamically allocated client structure fields,
+     * and finally release the client structure itself. */
+    if (c->name) decrRefCount(c->name);
+    zfree(c->argv);
+    c->argv_len_sum = 0;
+    freeClientMultiState(c);
+    sdsfree(c->peerid);
+    sdsfree(c->sockname);
+    sdsfree(c->slave_addr);
+    zfree(c);
+}
+
+/* Schedule a client to free it at a safe time in the serverCron() function.
+ * This function is useful when we need to terminate a client but we are in
+ * a context where calling freeClient() is not possible, because the client
+ * should be valid for the continuation of the flow of the program. */
+void freeClientAsync(client *c) {
+    /* We need to handle concurrent access to the server.clients_to_close list
+     * only in the freeClientAsync() function, since it's the only function that
+     * may access the list while Redis uses I/O threads. All the other accesses
+     * are in the context of the main thread while the other threads are
+     * idle. */
+    if (c->flags & CLIENT_CLOSE_ASAP || c->flags & CLIENT_LUA) return;
+    c->flags |= CLIENT_CLOSE_ASAP;
+    if (server.io_threads_num == 1) {
+        /* no need to bother with locking if there's just one thread (the main thread) */
+        listAddNodeTail(server.clients_to_close,c);
+        return;
+    }
+    static pthread_mutex_t async_free_queue_mutex = PTHREAD_MUTEX_INITIALIZER;
+    pthread_mutex_lock(&async_free_queue_mutex);
+    listAddNodeTail(server.clients_to_close,c);
+    pthread_mutex_unlock(&async_free_queue_mutex);
+}
+
+/* Free the clients marked as CLOSE_ASAP, return the number of clients
+ * freed. */
+int freeClientsInAsyncFreeQueue(void) {
+    int freed = 0;
+    listIter li;
+    listNode *ln;
+
+    listRewind(server.clients_to_close,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        client *c = listNodeValue(ln);
+
+        if (c->flags & CLIENT_PROTECTED) continue;
+
+        c->flags &= ~CLIENT_CLOSE_ASAP;
+        freeClient(c);
+        listDelNode(server.clients_to_close,ln);
+        freed++;
+    }
+    return freed;
+}
+
+/* Return a client by ID, or NULL if the client ID is not in the set
+ * of registered clients. Note that "fake clients", created with -1 as FD,
+ * are not registered clients. */
+client *lookupClientByID(uint64_t id) {
+    id = htonu64(id);
+    client *c = raxFind(server.clients_index,(unsigned char*)&id,sizeof(id));
+    return (c == raxNotFound) ? NULL : c;
+}
+
+/* Write data in output buffers to client. Return C_OK if the client
+ * is still valid after the call, C_ERR if it was freed because of some
+ * error.  If handler_installed is set, it will attempt to clear the
+ * write event.
+ *
+ * This function is called by threads, but always with handler_installed
+ * set to 0. So when handler_installed is set to 0 the function must be
+ * thread safe. */
+int writeToClient(client *c, int handler_installed) {
+    /* Update total number of writes on server */
+    atomicIncr(server.stat_total_writes_processed, 1);
+
+    ssize_t nwritten = 0, totwritten = 0;
+    size_t objlen;
+    clientReplyBlock *o;
+
+    while(clientHasPendingReplies(c)) {
+        if (c->bufpos > 0) {
+            nwritten = connWrite(c->conn,c->buf+c->sentlen,c->bufpos-c->sentlen);
+            if (nwritten <= 0) break;
+            c->sentlen += nwritten;
+            totwritten += nwritten;
+
+            /* If the buffer was sent, set bufpos to zero to continue with
+             * the remainder of the reply. */
+            if ((int)c->sentlen == c->bufpos) {
+                c->bufpos = 0;
+                c->sentlen = 0;
+            }
+        } else {
+            o = listNodeValue(listFirst(c->reply));
+            objlen = o->used;
+
+            if (objlen == 0) {
+                c->reply_bytes -= o->size;
+                listDelNode(c->reply,listFirst(c->reply));
+                continue;
+            }
+
+            nwritten = connWrite(c->conn, o->buf + c->sentlen, objlen - c->sentlen);
+            if (nwritten <= 0) break;
+            c->sentlen += nwritten;
+            totwritten += nwritten;
+
+            /* If we fully sent the object on head go to the next one */
+            if (c->sentlen == objlen) {
+                c->reply_bytes -= o->size;
+                listDelNode(c->reply,listFirst(c->reply));
+                c->sentlen = 0;
+                /* If there are no longer objects in the list, we expect
+                 * the count of reply bytes to be exactly zero. */
+                if (listLength(c->reply) == 0)
+                    serverAssert(c->reply_bytes == 0);
+            }
+        }
+        /* Note that we avoid to send more than NET_MAX_WRITES_PER_EVENT
+         * bytes, in a single threaded server it's a good idea to serve
+         * other clients as well, even if a very large request comes from
+         * super fast link that is always able to accept data (in real world
+         * scenario think about 'KEYS *' against the loopback interface).
+         *
+         * However if we are over the maxmemory limit we ignore that and
+         * just deliver as much data as it is possible to deliver.
+         *
+         * Moreover, we also send as much as possible if the client is
+         * a slave or a monitor (otherwise, on high-speed traffic, the
+         * replication/output buffer will grow indefinitely) */
+        if (totwritten > NET_MAX_WRITES_PER_EVENT &&
+            (server.maxmemory == 0 ||
+             zmalloc_used_memory() < server.maxmemory) &&
+            !(c->flags & CLIENT_SLAVE)) break;
+    }
+    atomicIncr(server.stat_net_output_bytes, totwritten);
+    if (nwritten == -1) {
+        if (connGetState(c->conn) != CONN_STATE_CONNECTED) {
+            serverLog(LL_VERBOSE,
+                "Error writing to client: %s", connGetLastError(c->conn));
+            freeClientAsync(c);
+            return C_ERR;
+        }
+    }
+    if (totwritten > 0) {
+        /* For clients representing masters we don't count sending data
+         * as an interaction, since we always send REPLCONF ACK commands
+         * that take some time to just fill the socket output buffer.
+         * We just rely on data / pings received for timeout detection. */
+        if (!(c->flags & CLIENT_MASTER)) c->lastinteraction = server.unixtime;
+    }
+    if (!clientHasPendingReplies(c)) {
+        c->sentlen = 0;
+        /* Note that writeToClient() is called in a threaded way, but
+         * adDeleteFileEvent() is not thread safe: however writeToClient()
+         * is always called with handler_installed set to 0 from threads
+         * so we are fine. */
+        if (handler_installed) connSetWriteHandler(c->conn, NULL);
+
+        /* Close connection after entire reply has been sent. */
+        if (c->flags & CLIENT_CLOSE_AFTER_REPLY) {
+            freeClientAsync(c);
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* Write event handler. Just send data to the client. */
+void sendReplyToClient(connection *conn) {
+    client *c = connGetPrivateData(conn);
+    writeToClient(c,1);
+}
+
+/* This function is called just before entering the event loop, in the hope
+ * we can just write the replies to the client output buffer without any
+ * need to use a syscall in order to install the writable event handler,
+ * get it called, and so forth. */
+int handleClientsWithPendingWrites(void) {
+    listIter li;
+    listNode *ln;
+    int processed = listLength(server.clients_pending_write);
+
+    listRewind(server.clients_pending_write,&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+        c->flags &= ~CLIENT_PENDING_WRITE;
+        listDelNode(server.clients_pending_write,ln);
+
+        /* If a client is protected, don't do anything,
+         * that may trigger write error or recreate handler. */
+        if (c->flags & CLIENT_PROTECTED) continue;
+
+        /* Don't write to clients that are going to be closed anyway. */
+        if (c->flags & CLIENT_CLOSE_ASAP) continue;
+
+        /* Try to write buffers to the client socket. */
+        if (writeToClient(c,0) == C_ERR) continue;
+
+        /* If after the synchronous writes above we still have data to
+         * output to the client, we need to install the writable handler. */
+        if (clientHasPendingReplies(c)) {
+            int ae_barrier = 0;
+            /* For the fsync=always policy, we want that a given FD is never
+             * served for reading and writing in the same event loop iteration,
+             * so that in the middle of receiving the query, and serving it
+             * to the client, we'll call beforeSleep() that will do the
+             * actual fsync of AOF to disk. the write barrier ensures that. */
+            if (server.aof_state == AOF_ON &&
+                server.aof_fsync == AOF_FSYNC_ALWAYS)
+            {
+                ae_barrier = 1;
+            }
+            if (connSetWriteHandlerWithBarrier(c->conn, sendReplyToClient, ae_barrier) == C_ERR) {
+                freeClientAsync(c);
+            }
+        }
+    }
+    return processed;
+}
+
+/* resetClient prepare the client to process the next command */
+void resetClient(client *c) {
+    redisCommandProc *prevcmd = c->cmd ? c->cmd->proc : NULL;
+
+    freeClientArgv(c);
+    c->reqtype = 0;
+    c->multibulklen = 0;
+    c->bulklen = -1;
+
+    /* We clear the ASKING flag as well if we are not inside a MULTI, and
+     * if what we just executed is not the ASKING command itself. */
+    if (!(c->flags & CLIENT_MULTI) && prevcmd != askingCommand)
+        c->flags &= ~CLIENT_ASKING;
+
+    /* We do the same for the CACHING command as well. It also affects
+     * the next command or transaction executed, in a way very similar
+     * to ASKING. */
+    if (!(c->flags & CLIENT_MULTI) && prevcmd != clientCommand)
+        c->flags &= ~CLIENT_TRACKING_CACHING;
+
+    /* Remove the CLIENT_REPLY_SKIP flag if any so that the reply
+     * to the next command will be sent, but set the flag if the command
+     * we just processed was "CLIENT REPLY SKIP". */
+    c->flags &= ~CLIENT_REPLY_SKIP;
+    if (c->flags & CLIENT_REPLY_SKIP_NEXT) {
+        c->flags |= CLIENT_REPLY_SKIP;
+        c->flags &= ~CLIENT_REPLY_SKIP_NEXT;
+    }
+}
+
+/* This function is used when we want to re-enter the event loop but there
+ * is the risk that the client we are dealing with will be freed in some
+ * way. This happens for instance in:
+ *
+ * * DEBUG RELOAD and similar.
+ * * When a Lua script is in -BUSY state.
+ *
+ * So the function will protect the client by doing two things:
+ *
+ * 1) It removes the file events. This way it is not possible that an
+ *    error is signaled on the socket, freeing the client.
+ * 2) Moreover it makes sure that if the client is freed in a different code
+ *    path, it is not really released, but only marked for later release. */
+void protectClient(client *c) {
+    c->flags |= CLIENT_PROTECTED;
+    if (c->conn) {
+        connSetReadHandler(c->conn,NULL);
+        connSetWriteHandler(c->conn,NULL);
+    }
+}
+
+/* This will undo the client protection done by protectClient() */
+void unprotectClient(client *c) {
+    if (c->flags & CLIENT_PROTECTED) {
+        c->flags &= ~CLIENT_PROTECTED;
+        if (c->conn) {
+            connSetReadHandler(c->conn,readQueryFromClient);
+            if (clientHasPendingReplies(c)) clientInstallWriteHandler(c);
+        }
+    }
+}
+
+/* Like processMultibulkBuffer(), but for the inline protocol instead of RESP,
+ * this function consumes the client query buffer and creates a command ready
+ * to be executed inside the client structure. Returns C_OK if the command
+ * is ready to be executed, or C_ERR if there is still protocol to read to
+ * have a well formed command. The function also returns C_ERR when there is
+ * a protocol error: in such a case the client structure is setup to reply
+ * with the error and close the connection. */
+int processInlineBuffer(client *c) {
+    char *newline;
+    int argc, j, linefeed_chars = 1;
+    sds *argv, aux;
+    size_t querylen;
+
+    /* Search for end of line */
+    newline = strchr(c->querybuf+c->qb_pos,'\n');
+
+    /* Nothing to do without a \r\n */
+    if (newline == NULL) {
+        if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
+            addReplyError(c,"Protocol error: too big inline request");
+            setProtocolError("too big inline request",c);
+        }
+        return C_ERR;
+    }
+
+    /* Handle the \r\n case. */
+    if (newline != c->querybuf+c->qb_pos && *(newline-1) == '\r')
+        newline--, linefeed_chars++;
+
+    /* Split the input buffer up to the \r\n */
+    querylen = newline-(c->querybuf+c->qb_pos);
+    aux = sdsnewlen(c->querybuf+c->qb_pos,querylen);
+    argv = sdssplitargs(aux,&argc);
+    sdsfree(aux);
+    if (argv == NULL) {
+        addReplyError(c,"Protocol error: unbalanced quotes in request");
+        setProtocolError("unbalanced quotes in inline request",c);
+        return C_ERR;
+    }
+
+    /* Newline from slaves can be used to refresh the last ACK time.
+     * This is useful for a slave to ping back while loading a big
+     * RDB file. */
+    if (querylen == 0 && getClientType(c) == CLIENT_TYPE_SLAVE)
+        c->repl_ack_time = server.unixtime;
+
+    /* Masters should never send us inline protocol to run actual
+     * commands. If this happens, it is likely due to a bug in Redis where
+     * we got some desynchronization in the protocol, for example
+     * beause of a PSYNC gone bad.
+     *
+     * However the is an exception: masters may send us just a newline
+     * to keep the connection active. */
+    if (querylen != 0 && c->flags & CLIENT_MASTER) {
+        sdsfreesplitres(argv,argc);
+        serverLog(LL_WARNING,"WARNING: Receiving inline protocol from master, master stream corruption? Closing the master connection and discarding the cached master.");
+        setProtocolError("Master using the inline protocol. Desync?",c);
+        return C_ERR;
+    }
+
+    /* Move querybuffer position to the next query in the buffer. */
+    c->qb_pos += querylen+linefeed_chars;
+
+    /* Setup argv array on client structure */
+    if (argc) {
+        if (c->argv) zfree(c->argv);
+        c->argv = zmalloc(sizeof(robj*)*argc);
+        c->argv_len_sum = 0;
+    }
+
+    /* Create redis objects for all arguments. */
+    for (c->argc = 0, j = 0; j < argc; j++) {
+        c->argv[c->argc] = createObject(OBJ_STRING,argv[j]);
+        c->argc++;
+        c->argv_len_sum += sdslen(argv[j]);
+    }
+    zfree(argv);
+    return C_OK;
+}
+
+/* Helper function. Record protocol erro details in server log,
+ * and set the client as CLIENT_CLOSE_AFTER_REPLY and
+ * CLIENT_PROTOCOL_ERROR. */
+#define PROTO_DUMP_LEN 128
+static void setProtocolError(const char *errstr, client *c) {
+    if (server.verbosity <= LL_VERBOSE || c->flags & CLIENT_MASTER) {
+        sds client = catClientInfoString(sdsempty(),c);
+
+        /* Sample some protocol to given an idea about what was inside. */
+        char buf[256];
+        if (sdslen(c->querybuf)-c->qb_pos < PROTO_DUMP_LEN) {
+            snprintf(buf,sizeof(buf),"Query buffer during protocol error: '%s'", c->querybuf+c->qb_pos);
+        } else {
+            snprintf(buf,sizeof(buf),"Query buffer during protocol error: '%.*s' (... more %zu bytes ...) '%.*s'", PROTO_DUMP_LEN/2, c->querybuf+c->qb_pos, sdslen(c->querybuf)-c->qb_pos-PROTO_DUMP_LEN, PROTO_DUMP_LEN/2, c->querybuf+sdslen(c->querybuf)-PROTO_DUMP_LEN/2);
+        }
+
+        /* Remove non printable chars. */
+        char *p = buf;
+        while (*p != '\0') {
+            if (!isprint(*p)) *p = '.';
+            p++;
+        }
+
+        /* Log all the client and protocol info. */
+        int loglevel = (c->flags & CLIENT_MASTER) ? LL_WARNING :
+                                                    LL_VERBOSE;
+        serverLog(loglevel,
+            "Protocol error (%s) from client: %s. %s", errstr, client, buf);
+        sdsfree(client);
+    }
+    c->flags |= (CLIENT_CLOSE_AFTER_REPLY|CLIENT_PROTOCOL_ERROR);
+}
+
+/* Process the query buffer for client 'c', setting up the client argument
+ * vector for command execution. Returns C_OK if after running the function
+ * the client has a well-formed ready to be processed command, otherwise
+ * C_ERR if there is still to read more buffer to get the full command.
+ * The function also returns C_ERR when there is a protocol error: in such a
+ * case the client structure is setup to reply with the error and close
+ * the connection.
+ *
+ * This function is called if processInputBuffer() detects that the next
+ * command is in RESP format, so the first byte in the command is found
+ * to be '*'. Otherwise for inline commands processInlineBuffer() is called. */
+int processMultibulkBuffer(client *c) {
+    char *newline = NULL;
+    int ok;
+    long long ll;
+
+    if (c->multibulklen == 0) {
+        /* The client should have been reset */
+        serverAssertWithInfo(c,NULL,c->argc == 0);
+
+        /* Multi bulk length cannot be read without a \r\n */
+        newline = strchr(c->querybuf+c->qb_pos,'\r');
+        if (newline == NULL) {
+            if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
+                addReplyError(c,"Protocol error: too big mbulk count string");
+                setProtocolError("too big mbulk count string",c);
+            }
+            return C_ERR;
+        }
+
+        /* Buffer should also contain \n */
+        if (newline-(c->querybuf+c->qb_pos) > (ssize_t)(sdslen(c->querybuf)-c->qb_pos-2))
+            return C_ERR;
+
+        /* We know for sure there is a whole line since newline != NULL,
+         * so go ahead and find out the multi bulk length. */
+        serverAssertWithInfo(c,NULL,c->querybuf[c->qb_pos] == '*');
+        ok = string2ll(c->querybuf+1+c->qb_pos,newline-(c->querybuf+1+c->qb_pos),&ll);
+        if (!ok || ll > 1024*1024) {
+            addReplyError(c,"Protocol error: invalid multibulk length");
+            setProtocolError("invalid mbulk count",c);
+            return C_ERR;
+        } else if (ll > 10 && authRequired(c)) {
+            addReplyError(c, "Protocol error: unauthenticated multibulk length");
+            setProtocolError("unauth mbulk count", c);
+            return C_ERR;
+        }
+
+        c->qb_pos = (newline-c->querybuf)+2;
+
+        if (ll <= 0) return C_OK;
+
+        c->multibulklen = ll;
+
+        /* Setup argv array on client structure */
+        if (c->argv) zfree(c->argv);
+        c->argv = zmalloc(sizeof(robj*)*c->multibulklen);
+        c->argv_len_sum = 0;
+    }
+
+    serverAssertWithInfo(c,NULL,c->multibulklen > 0);
+    while(c->multibulklen) {
+        /* Read bulk length if unknown */
+        if (c->bulklen == -1) {
+            newline = strchr(c->querybuf+c->qb_pos,'\r');
+            if (newline == NULL) {
+                if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
+                    addReplyError(c,
+                        "Protocol error: too big bulk count string");
+                    setProtocolError("too big bulk count string",c);
+                    return C_ERR;
+                }
+                break;
+            }
+
+            /* Buffer should also contain \n */
+            if (newline-(c->querybuf+c->qb_pos) > (ssize_t)(sdslen(c->querybuf)-c->qb_pos-2))
+                break;
+
+            if (c->querybuf[c->qb_pos] != '$') {
+                addReplyErrorFormat(c,
+                    "Protocol error: expected '$', got '%c'",
+                    c->querybuf[c->qb_pos]);
+                setProtocolError("expected $ but got something else",c);
+                return C_ERR;
+            }
+
+            ok = string2ll(c->querybuf+c->qb_pos+1,newline-(c->querybuf+c->qb_pos+1),&ll);
+            if (!ok || ll < 0 ||
+                (!(c->flags & CLIENT_MASTER) && ll > server.proto_max_bulk_len)) {
+                addReplyError(c,"Protocol error: invalid bulk length");
+                setProtocolError("invalid bulk length",c);
+                return C_ERR;
+            } else if (ll > 16384 && authRequired(c)) {
+                addReplyError(c, "Protocol error: unauthenticated bulk length");
+                setProtocolError("unauth bulk length", c);
+                return C_ERR;
+            }
+
+            c->qb_pos = newline-c->querybuf+2;
+            if (ll >= PROTO_MBULK_BIG_ARG) {
+                /* If we are going to read a large object from network
+                 * try to make it likely that it will start at c->querybuf
+                 * boundary so that we can optimize object creation
+                 * avoiding a large copy of data.
+                 *
+                 * But only when the data we have not parsed is less than
+                 * or equal to ll+2. If the data length is greater than
+                 * ll+2, trimming querybuf is just a waste of time, because
+                 * at this time the querybuf contains not only our bulk. */
+                if (sdslen(c->querybuf)-c->qb_pos <= (size_t)ll+2) {
+                    sdsrange(c->querybuf,c->qb_pos,-1);
+                    c->qb_pos = 0;
+                    /* Hint the sds library about the amount of bytes this string is
+                     * going to contain. */
+                    c->querybuf = sdsMakeRoomFor(c->querybuf,ll+2-sdslen(c->querybuf));
+                }
+            }
+            c->bulklen = ll;
+        }
+
+        /* Read bulk argument */
+        if (sdslen(c->querybuf)-c->qb_pos < (size_t)(c->bulklen+2)) {
+            /* Not enough data (+2 == trailing \r\n) */
+            break;
+        } else {
+            /* Optimization: if the buffer contains JUST our bulk element
+             * instead of creating a new object by *copying* the sds we
+             * just use the current sds string. */
+            if (c->qb_pos == 0 &&
+                c->bulklen >= PROTO_MBULK_BIG_ARG &&
+                sdslen(c->querybuf) == (size_t)(c->bulklen+2))
+            {
+                c->argv[c->argc++] = createObject(OBJ_STRING,c->querybuf);
+                c->argv_len_sum += c->bulklen;
+                sdsIncrLen(c->querybuf,-2); /* remove CRLF */
+                /* Assume that if we saw a fat argument we'll see another one
+                 * likely... */
+                c->querybuf = sdsnewlen(SDS_NOINIT,c->bulklen+2);
+                sdsclear(c->querybuf);
+            } else {
+                c->argv[c->argc++] =
+                    createStringObject(c->querybuf+c->qb_pos,c->bulklen);
+                c->argv_len_sum += c->bulklen;
+                c->qb_pos += c->bulklen+2;
+            }
+            c->bulklen = -1;
+            c->multibulklen--;
+        }
+    }
+
+    /* We're done when c->multibulk == 0 */
+    if (c->multibulklen == 0) return C_OK;
+
+    /* Still not ready to process the command */
+    return C_ERR;
+}
+
+/* Perform necessary tasks after a command was executed:
+ *
+ * 1. The client is reset unless there are reasons to avoid doing it.
+ * 2. In the case of master clients, the replication offset is updated.
+ * 3. Propagate commands we got from our master to replicas down the line. */
+void commandProcessed(client *c) {
+    /* If client is blocked(including paused), just return avoid reset and replicate.
+     *
+     * 1. Don't reset the client structure for blocked clients, so that the reply
+     *    callback will still be able to access the client argv and argc fields.
+     *    The client will be reset in unblockClient().
+     * 2. Don't update replication offset or propagate commands to replicas,
+     *    since we have not applied the command. */
+    if (c->flags & CLIENT_BLOCKED) return;
+
+    resetClient(c);
+
+    long long prev_offset = c->reploff;
+    if (c->flags & CLIENT_MASTER && !(c->flags & CLIENT_MULTI)) {
+        /* Update the applied replication offset of our master. */
+        c->reploff = c->read_reploff - sdslen(c->querybuf) + c->qb_pos;
+    }
+
+    /* If the client is a master we need to compute the difference
+     * between the applied offset before and after processing the buffer,
+     * to understand how much of the replication stream was actually
+     * applied to the master state: this quantity, and its corresponding
+     * part of the replication stream, will be propagated to the
+     * sub-replicas and to the replication backlog. */
+    if (c->flags & CLIENT_MASTER) {
+        long long applied = c->reploff - prev_offset;
+        if (applied) {
+            replicationFeedSlavesFromMasterStream(server.slaves,
+                    c->pending_querybuf, applied);
+            sdsrange(c->pending_querybuf,applied,-1);
+        }
+    }
+}
+
+/* This function calls processCommand(), but also performs a few sub tasks
+ * for the client that are useful in that context:
+ *
+ * 1. It sets the current client to the client 'c'.
+ * 2. calls commandProcessed() if the command was handled.
+ *
+ * The function returns C_ERR in case the client was freed as a side effect
+ * of processing the command, otherwise C_OK is returned. */
+int processCommandAndResetClient(client *c) {
+    int deadclient = 0;
+    client *old_client = server.current_client;
+    server.current_client = c;
+    if (processCommand(c) == C_OK) {
+        commandProcessed(c);
+    }
+    if (server.current_client == NULL) deadclient = 1;
+    /*
+     * Restore the old client, this is needed because when a script
+     * times out, we will get into this code from processEventsWhileBlocked.
+     * Which will cause to set the server.current_client. If not restored
+     * we will return 1 to our caller which will falsely indicate the client
+     * is dead and will stop reading from its buffer.
+     */
+    server.current_client = old_client;
+    /* performEvictions may flush slave output buffers. This may
+     * result in a slave, that may be the active client, to be
+     * freed. */
+    return deadclient ? C_ERR : C_OK;
+}
+
+
+/* This function will execute any fully parsed commands pending on
+ * the client. Returns C_ERR if the client is no longer valid after executing
+ * the command, and C_OK for all other cases. */
+int processPendingCommandsAndResetClient(client *c) {
+    if (c->flags & CLIENT_PENDING_COMMAND) {
+        c->flags &= ~CLIENT_PENDING_COMMAND;
+        if (processCommandAndResetClient(c) == C_ERR) {
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* This function is called every time, in the client structure 'c', there is
+ * more query buffer to process, because we read more data from the socket
+ * or because a client was blocked and later reactivated, so there could be
+ * pending query buffer, already representing a full command, to process. */
+void processInputBuffer(client *c) {
+    /* Keep processing while there is something in the input buffer */
+    while(c->qb_pos < sdslen(c->querybuf)) {
+        /* Immediately abort if the client is in the middle of something. */
+        if (c->flags & CLIENT_BLOCKED) break;
+
+        /* Don't process more buffers from clients that have already pending
+         * commands to execute in c->argv. */
+        if (c->flags & CLIENT_PENDING_COMMAND) break;
+
+        /* Don't process input from the master while there is a busy script
+         * condition on the slave. We want just to accumulate the replication
+         * stream (instead of replying -BUSY like we do with other clients) and
+         * later resume the processing. */
+        if (server.lua_timedout && c->flags & CLIENT_MASTER) break;
+
+        /* CLIENT_CLOSE_AFTER_REPLY closes the connection once the reply is
+         * written to the client. Make sure to not let the reply grow after
+         * this flag has been set (i.e. don't process more commands).
+         *
+         * The same applies for clients we want to terminate ASAP. */
+        if (c->flags & (CLIENT_CLOSE_AFTER_REPLY|CLIENT_CLOSE_ASAP)) break;
+
+        /* Determine request type when unknown. */
+        if (!c->reqtype) {
+            if (c->querybuf[c->qb_pos] == '*') {
+                c->reqtype = PROTO_REQ_MULTIBULK;
+            } else {
+                c->reqtype = PROTO_REQ_INLINE;
+            }
+        }
+
+        if (c->reqtype == PROTO_REQ_INLINE) {
+            if (processInlineBuffer(c) != C_OK) break;
+            /* If the Gopher mode and we got zero or one argument, process
+             * the request in Gopher mode. To avoid data race, Redis won't
+             * support Gopher if enable io threads to read queries. */
+            if (server.gopher_enabled && !server.io_threads_do_reads &&
+                ((c->argc == 1 && ((char*)(c->argv[0]->ptr))[0] == '/') ||
+                  c->argc == 0))
+            {
+                processGopherRequest(c);
+                resetClient(c);
+                c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+                break;
+            }
+        } else if (c->reqtype == PROTO_REQ_MULTIBULK) {
+            if (processMultibulkBuffer(c) != C_OK) break;
+        } else {
+            serverPanic("Unknown request type");
+        }
+
+        /* Multibulk processing could see a <= 0 length. */
+        if (c->argc == 0) {
+            resetClient(c);
+        } else {
+            /* If we are in the context of an I/O thread, we can't really
+             * execute the command here. All we can do is to flag the client
+             * as one that needs to process the command. */
+            if (c->flags & CLIENT_PENDING_READ) {
+                c->flags |= CLIENT_PENDING_COMMAND;
+                break;
+            }
+
+            /* We are finally ready to execute the command. */
+            if (processCommandAndResetClient(c) == C_ERR) {
+                /* If the client is no longer valid, we avoid exiting this
+                 * loop and trimming the client buffer later. So we return
+                 * ASAP in that case. */
+                return;
+            }
+        }
+    }
+
+    /* Trim to pos */
+    if (c->qb_pos) {
+        sdsrange(c->querybuf,c->qb_pos,-1);
+        c->qb_pos = 0;
+    }
+}
+
+void readQueryFromClient(connection *conn) {
+    client *c = connGetPrivateData(conn);
+    int nread, readlen;
+    size_t qblen;
+
+    /* Check if we want to read from the client later when exiting from
+     * the event loop. This is the case if threaded I/O is enabled. */
+    if (postponeClientRead(c)) return;
+
+    /* Update total number of reads on server */
+    atomicIncr(server.stat_total_reads_processed, 1);
+
+    readlen = PROTO_IOBUF_LEN;
+    /* If this is a multi bulk request, and we are processing a bulk reply
+     * that is large enough, try to maximize the probability that the query
+     * buffer contains exactly the SDS string representing the object, even
+     * at the risk of requiring more read(2) calls. This way the function
+     * processMultiBulkBuffer() can avoid copying buffers to create the
+     * Redis Object representing the argument. */
+    if (c->reqtype == PROTO_REQ_MULTIBULK && c->multibulklen && c->bulklen != -1
+        && c->bulklen >= PROTO_MBULK_BIG_ARG)
+    {
+        ssize_t remaining = (size_t)(c->bulklen+2)-sdslen(c->querybuf);
+
+        /* Note that the 'remaining' variable may be zero in some edge case,
+         * for example once we resume a blocked client after CLIENT PAUSE. */
+        if (remaining > 0 && remaining < readlen) readlen = remaining;
+    }
+
+    qblen = sdslen(c->querybuf);
+    if (c->querybuf_peak < qblen) c->querybuf_peak = qblen;
+    c->querybuf = sdsMakeRoomFor(c->querybuf, readlen);
+    nread = connRead(c->conn, c->querybuf+qblen, readlen);
+    if (nread == -1) {
+        if (connGetState(conn) == CONN_STATE_CONNECTED) {
+            return;
+        } else {
+            serverLog(LL_VERBOSE, "Reading from client: %s",connGetLastError(c->conn));
+            freeClientAsync(c);
+            return;
+        }
+    } else if (nread == 0) {
+        serverLog(LL_VERBOSE, "Client closed connection");
+        freeClientAsync(c);
+        return;
+    } else if (c->flags & CLIENT_MASTER) {
+        /* Append the query buffer to the pending (not applied) buffer
+         * of the master. We'll use this buffer later in order to have a
+         * copy of the string applied by the last command executed. */
+        c->pending_querybuf = sdscatlen(c->pending_querybuf,
+                                        c->querybuf+qblen,nread);
+    }
+
+    sdsIncrLen(c->querybuf,nread);
+    c->lastinteraction = server.unixtime;
+    if (c->flags & CLIENT_MASTER) c->read_reploff += nread;
+    atomicIncr(server.stat_net_input_bytes, nread);
+    if (sdslen(c->querybuf) > server.client_max_querybuf_len) {
+        sds ci = catClientInfoString(sdsempty(),c), bytes = sdsempty();
+
+        bytes = sdscatrepr(bytes,c->querybuf,64);
+        serverLog(LL_WARNING,"Closing client that reached max query buffer length: %s (qbuf initial bytes: %s)", ci, bytes);
+        sdsfree(ci);
+        sdsfree(bytes);
+        freeClientAsync(c);
+        return;
+    }
+
+    /* There is more data in the client input buffer, continue parsing it
+     * in case to check if there is a full command to execute. */
+     processInputBuffer(c);
+}
+
+void getClientsMaxBuffers(unsigned long *longest_output_list,
+                          unsigned long *biggest_input_buffer) {
+    client *c;
+    listNode *ln;
+    listIter li;
+    unsigned long lol = 0, bib = 0;
+
+    listRewind(server.clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        c = listNodeValue(ln);
+
+        if (listLength(c->reply) > lol) lol = listLength(c->reply);
+        if (sdslen(c->querybuf) > bib) bib = sdslen(c->querybuf);
+    }
+    *longest_output_list = lol;
+    *biggest_input_buffer = bib;
+}
+
+/* A Redis "Address String" is a colon separated ip:port pair.
+ * For IPv4 it's in the form x.y.z.k:port, example: "127.0.0.1:1234".
+ * For IPv6 addresses we use [] around the IP part, like in "[::1]:1234".
+ * For Unix sockets we use path:0, like in "/tmp/redis:0".
+ *
+ * An Address String always fits inside a buffer of NET_ADDR_STR_LEN bytes,
+ * including the null term.
+ *
+ * On failure the function still populates 'addr' with the "?:0" string in case
+ * you want to relax error checking or need to display something anyway (see
+ * anetFdToString implementation for more info). */
+void genClientAddrString(client *client, char *addr,
+                         size_t addr_len, int fd_to_str_type) {
+    if (client->flags & CLIENT_UNIX_SOCKET) {
+        /* Unix socket client. */
+        snprintf(addr,addr_len,"%s:0",server.unixsocket);
+    } else {
+        /* TCP client. */
+        connFormatFdAddr(client->conn,addr,addr_len,fd_to_str_type);
+    }
+}
+
+/* This function returns the client peer id, by creating and caching it
+ * if client->peerid is NULL, otherwise returning the cached value.
+ * The Peer ID never changes during the life of the client, however it
+ * is expensive to compute. */
+char *getClientPeerId(client *c) {
+    char peerid[NET_ADDR_STR_LEN];
+
+    if (c->peerid == NULL) {
+        genClientAddrString(c,peerid,sizeof(peerid),FD_TO_PEER_NAME);
+        c->peerid = sdsnew(peerid);
+    }
+    return c->peerid;
+}
+
+/* This function returns the client bound socket name, by creating and caching
+ * it if client->sockname is NULL, otherwise returning the cached value.
+ * The Socket Name never changes during the life of the client, however it
+ * is expensive to compute. */
+char *getClientSockname(client *c) {
+    char sockname[NET_ADDR_STR_LEN];
+
+    if (c->sockname == NULL) {
+        genClientAddrString(c,sockname,sizeof(sockname),FD_TO_SOCK_NAME);
+        c->sockname = sdsnew(sockname);
+    }
+    return c->sockname;
+}
+
+/* Concatenate a string representing the state of a client in a human
+ * readable format, into the sds string 's'. */
+sds catClientInfoString(sds s, client *client) {
+    char flags[16], events[3], conninfo[CONN_INFO_LEN], *p;
+
+    p = flags;
+    if (client->flags & CLIENT_SLAVE) {
+        if (client->flags & CLIENT_MONITOR)
+            *p++ = 'O';
+        else
+            *p++ = 'S';
+    }
+    if (client->flags & CLIENT_MASTER) *p++ = 'M';
+    if (client->flags & CLIENT_PUBSUB) *p++ = 'P';
+    if (client->flags & CLIENT_MULTI) *p++ = 'x';
+    if (client->flags & CLIENT_BLOCKED) *p++ = 'b';
+    if (client->flags & CLIENT_TRACKING) *p++ = 't';
+    if (client->flags & CLIENT_TRACKING_BROKEN_REDIR) *p++ = 'R';
+    if (client->flags & CLIENT_TRACKING_BCAST) *p++ = 'B';
+    if (client->flags & CLIENT_DIRTY_CAS) *p++ = 'd';
+    if (client->flags & CLIENT_CLOSE_AFTER_REPLY) *p++ = 'c';
+    if (client->flags & CLIENT_UNBLOCKED) *p++ = 'u';
+    if (client->flags & CLIENT_CLOSE_ASAP) *p++ = 'A';
+    if (client->flags & CLIENT_UNIX_SOCKET) *p++ = 'U';
+    if (client->flags & CLIENT_READONLY) *p++ = 'r';
+    if (p == flags) *p++ = 'N';
+    *p++ = '\0';
+
+    p = events;
+    if (client->conn) {
+        if (connHasReadHandler(client->conn)) *p++ = 'r';
+        if (connHasWriteHandler(client->conn)) *p++ = 'w';
+    }
+    *p = '\0';
+
+    /* Compute the total memory consumed by this client. */
+    size_t obufmem = getClientOutputBufferMemoryUsage(client);
+    size_t total_mem = obufmem;
+    total_mem += zmalloc_size(client); /* includes client->buf */
+    total_mem += sdsZmallocSize(client->querybuf);
+    /* For efficiency (less work keeping track of the argv memory), it doesn't include the used memory
+     * i.e. unused sds space and internal fragmentation, just the string length. but this is enough to
+     * spot problematic clients. */
+    total_mem += client->argv_len_sum;
+    if (client->argv)
+        total_mem += zmalloc_size(client->argv);
+
+    return sdscatfmt(s,
+        "id=%U addr=%s laddr=%s %s name=%s age=%I idle=%I flags=%s db=%i sub=%i psub=%i multi=%i qbuf=%U qbuf-free=%U argv-mem=%U obl=%U oll=%U omem=%U tot-mem=%U events=%s cmd=%s user=%s redir=%I",
+        (unsigned long long) client->id,
+        getClientPeerId(client),
+        getClientSockname(client),
+        connGetInfo(client->conn, conninfo, sizeof(conninfo)),
+        client->name ? (char*)client->name->ptr : "",
+        (long long)(server.unixtime - client->ctime),
+        (long long)(server.unixtime - client->lastinteraction),
+        flags,
+        client->db->id,
+        (int) dictSize(client->pubsub_channels),
+        (int) listLength(client->pubsub_patterns),
+        (client->flags & CLIENT_MULTI) ? client->mstate.count : -1,
+        (unsigned long long) sdslen(client->querybuf),
+        (unsigned long long) sdsavail(client->querybuf),
+        (unsigned long long) client->argv_len_sum,
+        (unsigned long long) client->bufpos,
+        (unsigned long long) listLength(client->reply),
+        (unsigned long long) obufmem, /* should not include client->buf since we want to see 0 for static clients. */
+        (unsigned long long) total_mem,
+        events,
+        client->lastcmd ? client->lastcmd->name : "NULL",
+        client->user ? client->user->name : "(superuser)",
+        (client->flags & CLIENT_TRACKING) ? (long long) client->client_tracking_redirection : -1);
+}
+
+sds getAllClientsInfoString(int type) {
+    listNode *ln;
+    listIter li;
+    client *client;
+    sds o = sdsnewlen(SDS_NOINIT,200*listLength(server.clients));
+    sdsclear(o);
+    listRewind(server.clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        client = listNodeValue(ln);
+        if (type != -1 && getClientType(client) != type) continue;
+        o = catClientInfoString(o,client);
+        o = sdscatlen(o,"\n",1);
+    }
+    return o;
+}
+
+/* This function implements CLIENT SETNAME, including replying to the
+ * user with an error if the charset is wrong (in that case C_ERR is
+ * returned). If the function succeeeded C_OK is returned, and it's up
+ * to the caller to send a reply if needed.
+ *
+ * Setting an empty string as name has the effect of unsetting the
+ * currently set name: the client will remain unnamed.
+ *
+ * This function is also used to implement the HELLO SETNAME option. */
+int clientSetNameOrReply(client *c, robj *name) {
+    int len = sdslen(name->ptr);
+    char *p = name->ptr;
+
+    /* Setting the client name to an empty string actually removes
+     * the current name. */
+    if (len == 0) {
+        if (c->name) decrRefCount(c->name);
+        c->name = NULL;
+        return C_OK;
+    }
+
+    /* Otherwise check if the charset is ok. We need to do this otherwise
+     * CLIENT LIST format will break. You should always be able to
+     * split by space to get the different fields. */
+    for (int j = 0; j < len; j++) {
+        if (p[j] < '!' || p[j] > '~') { /* ASCII is assumed. */
+            addReplyError(c,
+                "Client names cannot contain spaces, "
+                "newlines or special characters.");
+            return C_ERR;
+        }
+    }
+    if (c->name) decrRefCount(c->name);
+    c->name = name;
+    incrRefCount(name);
+    return C_OK;
+}
+
+/* Reset the client state to resemble a newly connected client.
+ */
+void resetCommand(client *c) {
+    listNode *ln;
+
+    /* MONITOR clients are also marked with CLIENT_SLAVE, we need to
+     * distinguish between the two.
+     */
+    if (c->flags & CLIENT_MONITOR) {
+        ln = listSearchKey(server.monitors,c);
+        serverAssert(ln != NULL);
+        listDelNode(server.monitors,ln);
+
+        c->flags &= ~(CLIENT_MONITOR|CLIENT_SLAVE);
+    }
+
+    if (c->flags & (CLIENT_SLAVE|CLIENT_MASTER|CLIENT_MODULE)) {
+        addReplyError(c,"can only reset normal client connections");
+        return;
+    }
+
+    if (c->flags & CLIENT_TRACKING) disableTracking(c);
+    selectDb(c,0);
+    c->resp = 2;
+
+    clientSetDefaultAuth(c);
+    moduleNotifyUserChanged(c);
+    discardTransaction(c);
+
+    pubsubUnsubscribeAllChannels(c,0);
+    pubsubUnsubscribeAllPatterns(c,0);
+
+    if (c->name) {
+        decrRefCount(c->name);
+        c->name = NULL;
+    }
+
+    /* Selectively clear state flags not covered above */
+    c->flags &= ~(CLIENT_ASKING|CLIENT_READONLY|CLIENT_PUBSUB|
+            CLIENT_REPLY_OFF|CLIENT_REPLY_SKIP_NEXT);
+
+    addReplyStatus(c,"RESET");
+}
+
+void clientCommand(client *c) {
+    listNode *ln;
+    listIter li;
+
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"CACHING (YES|NO)",
+"    Enable/disable tracking of the keys for next command in OPTIN/OPTOUT modes.",
+"GETREDIR",
+"    Return the client ID we are redirecting to when tracking is enabled.",
+"GETNAME",
+"    Return the name of the current connection.",
+"ID",
+"    Return the ID of the current connection.",
+"INFO",
+"    Return information about the current client connection.",
+"KILL <ip:port>",
+"    Kill connection made from <ip:port>.",
+"KILL <option> <value> [<option> <value> [...]]",
+"    Kill connections. Options are:",
+"    * ADDR (<ip:port>|<unixsocket>:0)",
+"      Kill connections made from the specified address",
+"    * LADDR (<ip:port>|<unixsocket>:0)",
+"      Kill connections made to specified local address",
+"    * TYPE (normal|master|replica|pubsub)",
+"      Kill connections by type.",
+"    * USER <username>",
+"      Kill connections authenticated by <username>.",
+"    * SKIPME (YES|NO)",
+"      Skip killing current connection (default: yes).",
+"LIST [options ...]",
+"    Return information about client connections. Options:",
+"    * TYPE (NORMAL|MASTER|REPLICA|PUBSUB)",
+"      Return clients of specified type.",
+"UNPAUSE",
+"    Stop the current client pause, resuming traffic.",
+"PAUSE <timeout> [WRITE|ALL]",
+"    Suspend all, or just write, clients for <timout> milliseconds.",
+"REPLY (ON|OFF|SKIP)",
+"    Control the replies sent to the current connection.",
+"SETNAME <name>",
+"    Assign the name <name> to the current connection.",
+"UNBLOCK <clientid> [TIMEOUT|ERROR]",
+"    Unblock the specified blocked client.",
+"TRACKING (ON|OFF) [REDIRECT <id>] [BCAST] [PREFIX <prefix> [...]]",
+"         [OPTIN] [OPTOUT]",
+"    Control server assisted client side caching.",
+"TRACKINGINFO",
+"    Report tracking status for the current connection.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"id") && c->argc == 2) {
+        /* CLIENT ID */
+        addReplyLongLong(c,c->id);
+    } else if (!strcasecmp(c->argv[1]->ptr,"info") && c->argc == 2) {
+        /* CLIENT INFO */
+        sds o = catClientInfoString(sdsempty(), c);
+        o = sdscatlen(o,"\n",1);
+        addReplyVerbatim(c,o,sdslen(o),"txt");
+        sdsfree(o);
+    } else if (!strcasecmp(c->argv[1]->ptr,"list")) {
+        /* CLIENT LIST */
+        int type = -1;
+        sds o = NULL;
+        if (c->argc == 4 && !strcasecmp(c->argv[2]->ptr,"type")) {
+            type = getClientTypeByName(c->argv[3]->ptr);
+            if (type == -1) {
+                addReplyErrorFormat(c,"Unknown client type '%s'",
+                    (char*) c->argv[3]->ptr);
+                return;
+            }
+        } else if (c->argc > 3 && !strcasecmp(c->argv[2]->ptr,"id")) {
+            int j;
+            o = sdsempty();
+            for (j = 3; j < c->argc; j++) {
+                long long cid;
+                if (getLongLongFromObjectOrReply(c, c->argv[j], &cid,
+                            "Invalid client ID")) {
+                    sdsfree(o);
+                    return;
+                }
+                client *cl = lookupClientByID(cid);
+                if (cl) {
+                    o = catClientInfoString(o, cl);
+                    o = sdscatlen(o, "\n", 1);
+                }
+            }
+        } else if (c->argc != 2) {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+
+        if (!o)
+            o = getAllClientsInfoString(type);
+        addReplyVerbatim(c,o,sdslen(o),"txt");
+        sdsfree(o);
+    } else if (!strcasecmp(c->argv[1]->ptr,"reply") && c->argc == 3) {
+        /* CLIENT REPLY ON|OFF|SKIP */
+        if (!strcasecmp(c->argv[2]->ptr,"on")) {
+            c->flags &= ~(CLIENT_REPLY_SKIP|CLIENT_REPLY_OFF);
+            addReply(c,shared.ok);
+        } else if (!strcasecmp(c->argv[2]->ptr,"off")) {
+            c->flags |= CLIENT_REPLY_OFF;
+        } else if (!strcasecmp(c->argv[2]->ptr,"skip")) {
+            if (!(c->flags & CLIENT_REPLY_OFF))
+                c->flags |= CLIENT_REPLY_SKIP_NEXT;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"kill")) {
+        /* CLIENT KILL <ip:port>
+         * CLIENT KILL <option> [value] ... <option> [value] */
+        char *addr = NULL;
+        char *laddr = NULL;
+        user *user = NULL;
+        int type = -1;
+        uint64_t id = 0;
+        int skipme = 1;
+        int killed = 0, close_this_client = 0;
+
+        if (c->argc == 3) {
+            /* Old style syntax: CLIENT KILL <addr> */
+            addr = c->argv[2]->ptr;
+            skipme = 0; /* With the old form, you can kill yourself. */
+        } else if (c->argc > 3) {
+            int i = 2; /* Next option index. */
+
+            /* New style syntax: parse options. */
+            while(i < c->argc) {
+                int moreargs = c->argc > i+1;
+
+                if (!strcasecmp(c->argv[i]->ptr,"id") && moreargs) {
+                    long long tmp;
+
+                    if (getLongLongFromObjectOrReply(c,c->argv[i+1],&tmp,NULL)
+                        != C_OK) return;
+                    id = tmp;
+                } else if (!strcasecmp(c->argv[i]->ptr,"type") && moreargs) {
+                    type = getClientTypeByName(c->argv[i+1]->ptr);
+                    if (type == -1) {
+                        addReplyErrorFormat(c,"Unknown client type '%s'",
+                            (char*) c->argv[i+1]->ptr);
+                        return;
+                    }
+                } else if (!strcasecmp(c->argv[i]->ptr,"addr") && moreargs) {
+                    addr = c->argv[i+1]->ptr;
+                } else if (!strcasecmp(c->argv[i]->ptr,"laddr") && moreargs) {
+                    laddr = c->argv[i+1]->ptr;
+                } else if (!strcasecmp(c->argv[i]->ptr,"user") && moreargs) {
+                    user = ACLGetUserByName(c->argv[i+1]->ptr,
+                                            sdslen(c->argv[i+1]->ptr));
+                    if (user == NULL) {
+                        addReplyErrorFormat(c,"No such user '%s'",
+                            (char*) c->argv[i+1]->ptr);
+                        return;
+                    }
+                } else if (!strcasecmp(c->argv[i]->ptr,"skipme") && moreargs) {
+                    if (!strcasecmp(c->argv[i+1]->ptr,"yes")) {
+                        skipme = 1;
+                    } else if (!strcasecmp(c->argv[i+1]->ptr,"no")) {
+                        skipme = 0;
+                    } else {
+                        addReplyErrorObject(c,shared.syntaxerr);
+                        return;
+                    }
+                } else {
+                    addReplyErrorObject(c,shared.syntaxerr);
+                    return;
+                }
+                i += 2;
+            }
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+
+        /* Iterate clients killing all the matching clients. */
+        listRewind(server.clients,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            client *client = listNodeValue(ln);
+            if (addr && strcmp(getClientPeerId(client),addr) != 0) continue;
+            if (laddr && strcmp(getClientSockname(client),laddr) != 0) continue;
+            if (type != -1 && getClientType(client) != type) continue;
+            if (id != 0 && client->id != id) continue;
+            if (user && client->user != user) continue;
+            if (c == client && skipme) continue;
+
+            /* Kill it. */
+            if (c == client) {
+                close_this_client = 1;
+            } else {
+                freeClient(client);
+            }
+            killed++;
+        }
+
+        /* Reply according to old/new format. */
+        if (c->argc == 3) {
+            if (killed == 0)
+                addReplyError(c,"No such client");
+            else
+                addReply(c,shared.ok);
+        } else {
+            addReplyLongLong(c,killed);
+        }
+
+        /* If this client has to be closed, flag it as CLOSE_AFTER_REPLY
+         * only after we queued the reply to its output buffers. */
+        if (close_this_client) c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+    } else if (!strcasecmp(c->argv[1]->ptr,"unblock") && (c->argc == 3 ||
+                                                          c->argc == 4))
+    {
+        /* CLIENT UNBLOCK <id> [timeout|error] */
+        long long id;
+        int unblock_error = 0;
+
+        if (c->argc == 4) {
+            if (!strcasecmp(c->argv[3]->ptr,"timeout")) {
+                unblock_error = 0;
+            } else if (!strcasecmp(c->argv[3]->ptr,"error")) {
+                unblock_error = 1;
+            } else {
+                addReplyError(c,
+                    "CLIENT UNBLOCK reason should be TIMEOUT or ERROR");
+                return;
+            }
+        }
+        if (getLongLongFromObjectOrReply(c,c->argv[2],&id,NULL)
+            != C_OK) return;
+        struct client *target = lookupClientByID(id);
+        if (target && target->flags & CLIENT_BLOCKED && moduleBlockedClientMayTimeout(target)) {
+            if (unblock_error)
+                addReplyError(target,
+                    "-UNBLOCKED client unblocked via CLIENT UNBLOCK");
+            else
+                replyToBlockedClientTimedOut(target);
+            unblockClient(target);
+            addReply(c,shared.cone);
+        } else {
+            addReply(c,shared.czero);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"setname") && c->argc == 3) {
+        /* CLIENT SETNAME */
+        if (clientSetNameOrReply(c,c->argv[2]) == C_OK)
+            addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"getname") && c->argc == 2) {
+        /* CLIENT GETNAME */
+        if (c->name)
+            addReplyBulk(c,c->name);
+        else
+            addReplyNull(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"unpause") && c->argc == 2) {
+        /* CLIENT UNPAUSE */
+        unpauseClients();
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"pause") && (c->argc == 3 ||
+                                                        c->argc == 4))
+    {
+        /* CLIENT PAUSE TIMEOUT [WRITE|ALL] */
+        mstime_t end;
+        int type = CLIENT_PAUSE_ALL;
+        if (c->argc == 4) {
+            if (!strcasecmp(c->argv[3]->ptr,"write")) {
+                type = CLIENT_PAUSE_WRITE;
+            } else if (!strcasecmp(c->argv[3]->ptr,"all")) {
+                type = CLIENT_PAUSE_ALL;
+            } else {
+                addReplyError(c,
+                    "CLIENT PAUSE mode must be WRITE or ALL");  
+                return;       
+            }
+        }
+
+        if (getTimeoutFromObjectOrReply(c,c->argv[2],&end,
+            UNIT_MILLISECONDS) != C_OK) return;
+        pauseClients(end, type);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"tracking") && c->argc >= 3) {
+        /* CLIENT TRACKING (on|off) [REDIRECT <id>] [BCAST] [PREFIX first]
+         *                          [PREFIX second] [OPTIN] [OPTOUT] ... */
+        long long redir = 0;
+        uint64_t options = 0;
+        robj **prefix = NULL;
+        size_t numprefix = 0;
+
+        /* Parse the options. */
+        for (int j = 3; j < c->argc; j++) {
+            int moreargs = (c->argc-1) - j;
+
+            if (!strcasecmp(c->argv[j]->ptr,"redirect") && moreargs) {
+                j++;
+                if (redir != 0) {
+                    addReplyError(c,"A client can only redirect to a single "
+                                    "other client");
+                    zfree(prefix);
+                    return;
+                }
+
+                if (getLongLongFromObjectOrReply(c,c->argv[j],&redir,NULL) !=
+                    C_OK)
+                {
+                    zfree(prefix);
+                    return;
+                }
+                /* We will require the client with the specified ID to exist
+                 * right now, even if it is possible that it gets disconnected
+                 * later. Still a valid sanity check. */
+                if (lookupClientByID(redir) == NULL) {
+                    addReplyError(c,"The client ID you want redirect to "
+                                    "does not exist");
+                    zfree(prefix);
+                    return;
+                }
+            } else if (!strcasecmp(c->argv[j]->ptr,"bcast")) {
+                options |= CLIENT_TRACKING_BCAST;
+            } else if (!strcasecmp(c->argv[j]->ptr,"optin")) {
+                options |= CLIENT_TRACKING_OPTIN;
+            } else if (!strcasecmp(c->argv[j]->ptr,"optout")) {
+                options |= CLIENT_TRACKING_OPTOUT;
+            } else if (!strcasecmp(c->argv[j]->ptr,"noloop")) {
+                options |= CLIENT_TRACKING_NOLOOP;
+            } else if (!strcasecmp(c->argv[j]->ptr,"prefix") && moreargs) {
+                j++;
+                prefix = zrealloc(prefix,sizeof(robj*)*(numprefix+1));
+                prefix[numprefix++] = c->argv[j];
+            } else {
+                zfree(prefix);
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+
+        /* Options are ok: enable or disable the tracking for this client. */
+        if (!strcasecmp(c->argv[2]->ptr,"on")) {
+            /* Before enabling tracking, make sure options are compatible
+             * among each other and with the current state of the client. */
+            if (!(options & CLIENT_TRACKING_BCAST) && numprefix) {
+                addReplyError(c,
+                    "PREFIX option requires BCAST mode to be enabled");
+                zfree(prefix);
+                return;
+            }
+
+            if (c->flags & CLIENT_TRACKING) {
+                int oldbcast = !!(c->flags & CLIENT_TRACKING_BCAST);
+                int newbcast = !!(options & CLIENT_TRACKING_BCAST);
+                if (oldbcast != newbcast) {
+                    addReplyError(c,
+                    "You can't switch BCAST mode on/off before disabling "
+                    "tracking for this client, and then re-enabling it with "
+                    "a different mode.");
+                    zfree(prefix);
+                    return;
+                }
+            }
+
+            if (options & CLIENT_TRACKING_BCAST &&
+                options & (CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT))
+            {
+                addReplyError(c,
+                "OPTIN and OPTOUT are not compatible with BCAST");
+                zfree(prefix);
+                return;
+            }
+
+            if (options & CLIENT_TRACKING_OPTIN && options & CLIENT_TRACKING_OPTOUT)
+            {
+                addReplyError(c,
+                "You can't specify both OPTIN mode and OPTOUT mode");
+                zfree(prefix);
+                return;
+            }
+
+            if ((options & CLIENT_TRACKING_OPTIN && c->flags & CLIENT_TRACKING_OPTOUT) ||
+                (options & CLIENT_TRACKING_OPTOUT && c->flags & CLIENT_TRACKING_OPTIN))
+            {
+                addReplyError(c,
+                "You can't switch OPTIN/OPTOUT mode before disabling "
+                "tracking for this client, and then re-enabling it with "
+                "a different mode.");
+                zfree(prefix);
+                return;
+            }
+
+            if (options & CLIENT_TRACKING_BCAST) {
+                if (!checkPrefixCollisionsOrReply(c,prefix,numprefix)) {
+                    zfree(prefix);
+                    return;
+                }
+            }
+
+            enableTracking(c,redir,options,prefix,numprefix);
+        } else if (!strcasecmp(c->argv[2]->ptr,"off")) {
+            disableTracking(c);
+        } else {
+            zfree(prefix);
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+        zfree(prefix);
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"caching") && c->argc >= 3) {
+        if (!(c->flags & CLIENT_TRACKING)) {
+            addReplyError(c,"CLIENT CACHING can be called only when the "
+                            "client is in tracking mode with OPTIN or "
+                            "OPTOUT mode enabled");
+            return;
+        }
+
+        char *opt = c->argv[2]->ptr;
+        if (!strcasecmp(opt,"yes")) {
+            if (c->flags & CLIENT_TRACKING_OPTIN) {
+                c->flags |= CLIENT_TRACKING_CACHING;
+            } else {
+                addReplyError(c,"CLIENT CACHING YES is only valid when tracking is enabled in OPTIN mode.");
+                return;
+            }
+        } else if (!strcasecmp(opt,"no")) {
+            if (c->flags & CLIENT_TRACKING_OPTOUT) {
+                c->flags |= CLIENT_TRACKING_CACHING;
+            } else {
+                addReplyError(c,"CLIENT CACHING NO is only valid when tracking is enabled in OPTOUT mode.");
+                return;
+            }
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+
+        /* Common reply for when we succeeded. */
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"getredir") && c->argc == 2) {
+        /* CLIENT GETREDIR */
+        if (c->flags & CLIENT_TRACKING) {
+            addReplyLongLong(c,c->client_tracking_redirection);
+        } else {
+            addReplyLongLong(c,-1);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"trackinginfo") && c->argc == 2) {
+        addReplyMapLen(c,3);
+
+        /* Flags */
+        addReplyBulkCString(c,"flags");
+        void *arraylen_ptr = addReplyDeferredLen(c);
+        int numflags = 0;
+        addReplyBulkCString(c,c->flags & CLIENT_TRACKING ? "on" : "off");
+        numflags++;
+        if (c->flags & CLIENT_TRACKING_BCAST) {
+            addReplyBulkCString(c,"bcast");
+            numflags++;
+        }
+        if (c->flags & CLIENT_TRACKING_OPTIN) {
+            addReplyBulkCString(c,"optin");
+            numflags++;
+            if (c->flags & CLIENT_TRACKING_CACHING) {
+                addReplyBulkCString(c,"caching-yes");
+                numflags++;        
+            }
+        }
+        if (c->flags & CLIENT_TRACKING_OPTOUT) {
+            addReplyBulkCString(c,"optout");
+            numflags++;
+            if (c->flags & CLIENT_TRACKING_CACHING) {
+                addReplyBulkCString(c,"caching-no");
+                numflags++;        
+            }
+        }
+        if (c->flags & CLIENT_TRACKING_NOLOOP) {
+            addReplyBulkCString(c,"noloop");
+            numflags++;
+        }
+        if (c->flags & CLIENT_TRACKING_BROKEN_REDIR) {
+            addReplyBulkCString(c,"broken_redirect");
+            numflags++;
+        }
+        setDeferredSetLen(c,arraylen_ptr,numflags);
+
+        /* Redirect */
+        addReplyBulkCString(c,"redirect");
+        if (c->flags & CLIENT_TRACKING) {
+            addReplyLongLong(c,c->client_tracking_redirection);
+        } else {
+            addReplyLongLong(c,-1);
+        }
+
+        /* Prefixes */
+        addReplyBulkCString(c,"prefixes");
+        if (c->client_tracking_prefixes) {
+            addReplyArrayLen(c,raxSize(c->client_tracking_prefixes));
+            raxIterator ri;
+            raxStart(&ri,c->client_tracking_prefixes);
+            raxSeek(&ri,"^",NULL,0);
+            while(raxNext(&ri)) {
+                addReplyBulkCBuffer(c,ri.key,ri.key_len);
+            }
+            raxStop(&ri);
+        } else {
+            addReplyArrayLen(c,0);
+        }
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* HELLO [<protocol-version> [AUTH <user> <password>] [SETNAME <name>] ] */
+void helloCommand(client *c) {
+    long long ver = 0;
+    int next_arg = 1;
+
+    if (c->argc >= 2) {
+        if (getLongLongFromObjectOrReply(c, c->argv[next_arg++], &ver,
+            "Protocol version is not an integer or out of range") != C_OK) {
+            return;
+        }
+
+        if (ver < 2 || ver > 3) {
+            addReplyError(c,"-NOPROTO unsupported protocol version");
+            return;
+        }
+    }
+
+    for (int j = next_arg; j < c->argc; j++) {
+        int moreargs = (c->argc-1) - j;
+        const char *opt = c->argv[j]->ptr;
+        if (!strcasecmp(opt,"AUTH") && moreargs >= 2) {
+            redactClientCommandArgument(c, j+1);
+            redactClientCommandArgument(c, j+2);
+            if (ACLAuthenticateUser(c, c->argv[j+1], c->argv[j+2]) == C_ERR) {
+                addReplyError(c,"-WRONGPASS invalid username-password pair or user is disabled.");
+                return;
+            }
+            j += 2;
+        } else if (!strcasecmp(opt,"SETNAME") && moreargs) {
+            if (clientSetNameOrReply(c, c->argv[j+1]) == C_ERR) return;
+            j++;
+        } else {
+            addReplyErrorFormat(c,"Syntax error in HELLO option '%s'",opt);
+            return;
+        }
+    }
+
+    /* At this point we need to be authenticated to continue. */
+    if (!c->authenticated) {
+        addReplyError(c,"-NOAUTH HELLO must be called with the client already "
+                        "authenticated, otherwise the HELLO AUTH <user> <pass> "
+                        "option can be used to authenticate the client and "
+                        "select the RESP protocol version at the same time");
+        return;
+    }
+
+    /* Let's switch to the specified RESP mode. */
+    if (ver) c->resp = ver;
+    addReplyMapLen(c,6 + !server.sentinel_mode);
+
+    addReplyBulkCString(c,"server");
+    addReplyBulkCString(c,"redis");
+
+    addReplyBulkCString(c,"version");
+    addReplyBulkCString(c,REDIS_VERSION);
+
+    addReplyBulkCString(c,"proto");
+    addReplyLongLong(c,c->resp);
+
+    addReplyBulkCString(c,"id");
+    addReplyLongLong(c,c->id);
+
+    addReplyBulkCString(c,"mode");
+    if (server.sentinel_mode) addReplyBulkCString(c,"sentinel");
+    else if (server.cluster_enabled) addReplyBulkCString(c,"cluster");
+    else addReplyBulkCString(c,"standalone");
+
+    if (!server.sentinel_mode) {
+        addReplyBulkCString(c,"role");
+        addReplyBulkCString(c,server.masterhost ? "replica" : "master");
+    }
+
+    addReplyBulkCString(c,"modules");
+    addReplyLoadedModules(c);
+}
+
+/* This callback is bound to POST and "Host:" command names. Those are not
+ * really commands, but are used in security attacks in order to talk to
+ * Redis instances via HTTP, with a technique called "cross protocol scripting"
+ * which exploits the fact that services like Redis will discard invalid
+ * HTTP headers and will process what follows.
+ *
+ * As a protection against this attack, Redis will terminate the connection
+ * when a POST or "Host:" header is seen, and will log the event from
+ * time to time (to avoid creating a DOS as a result of too many logs). */
+void securityWarningCommand(client *c) {
+    static time_t logged_time;
+    time_t now = time(NULL);
+
+    if (llabs(now-logged_time) > 60) {
+        serverLog(LL_WARNING,"Possible SECURITY ATTACK detected. It looks like somebody is sending POST or Host: commands to Redis. This is likely due to an attacker attempting to use Cross Protocol Scripting to compromise your Redis instance. Connection aborted.");
+        logged_time = now;
+    }
+    freeClientAsync(c);
+}
+
+/* Keep track of the original command arguments so that we can generate
+ * an accurate slowlog entry after the command has been executed. */
+static void retainOriginalCommandVector(client *c) {
+    /* We already rewrote this command, so don't rewrite it again */
+    if (c->original_argv) return;
+    c->original_argc = c->argc;
+    c->original_argv = zmalloc(sizeof(robj*)*(c->argc));
+    for (int j = 0; j < c->argc; j++) {
+        c->original_argv[j] = c->argv[j];
+        incrRefCount(c->argv[j]);
+    }
+}
+
+/* Redact a given argument to prevent it from being shown
+ * in the slowlog. This information is stored in the
+ * original_argv array. */
+void redactClientCommandArgument(client *c, int argc) {
+    retainOriginalCommandVector(c);
+    decrRefCount(c->argv[argc]);
+    c->original_argv[argc] = shared.redacted;
+}
+
+/* Rewrite the command vector of the client. All the new objects ref count
+ * is incremented. The old command vector is freed, and the old objects
+ * ref count is decremented. */
+void rewriteClientCommandVector(client *c, int argc, ...) {
+    va_list ap;
+    int j;
+    robj **argv; /* The new argument vector */
+
+    argv = zmalloc(sizeof(robj*)*argc);
+    va_start(ap,argc);
+    for (j = 0; j < argc; j++) {
+        robj *a;
+
+        a = va_arg(ap, robj*);
+        argv[j] = a;
+        incrRefCount(a);
+    }
+    replaceClientCommandVector(c, argc, argv);
+    va_end(ap);
+}
+
+/* Completely replace the client command vector with the provided one. */
+void replaceClientCommandVector(client *c, int argc, robj **argv) {
+    int j;
+    retainOriginalCommandVector(c);
+    freeClientArgv(c);
+    zfree(c->argv);
+    c->argv = argv;
+    c->argc = argc;
+    c->argv_len_sum = 0;
+    for (j = 0; j < c->argc; j++)
+        if (c->argv[j])
+            c->argv_len_sum += getStringObjectLen(c->argv[j]);
+    c->cmd = lookupCommandOrOriginal(c->argv[0]->ptr);
+    serverAssertWithInfo(c,NULL,c->cmd != NULL);
+}
+
+/* Rewrite a single item in the command vector.
+ * The new val ref count is incremented, and the old decremented.
+ *
+ * It is possible to specify an argument over the current size of the
+ * argument vector: in this case the array of objects gets reallocated
+ * and c->argc set to the max value. However it's up to the caller to
+ *
+ * 1. Make sure there are no "holes" and all the arguments are set.
+ * 2. If the original argument vector was longer than the one we
+ *    want to end with, it's up to the caller to set c->argc and
+ *    free the no longer used objects on c->argv. */
+void rewriteClientCommandArgument(client *c, int i, robj *newval) {
+    robj *oldval;
+    retainOriginalCommandVector(c);
+    if (i >= c->argc) {
+        c->argv = zrealloc(c->argv,sizeof(robj*)*(i+1));
+        c->argc = i+1;
+        c->argv[i] = NULL;
+    }
+    oldval = c->argv[i];
+    if (oldval) c->argv_len_sum -= getStringObjectLen(oldval);
+    if (newval) c->argv_len_sum += getStringObjectLen(newval);
+    c->argv[i] = newval;
+    incrRefCount(newval);
+    if (oldval) decrRefCount(oldval);
+
+    /* If this is the command name make sure to fix c->cmd. */
+    if (i == 0) {
+        c->cmd = lookupCommandOrOriginal(c->argv[0]->ptr);
+        serverAssertWithInfo(c,NULL,c->cmd != NULL);
+    }
+}
+
+/* This function returns the number of bytes that Redis is
+ * using to store the reply still not read by the client.
+ *
+ * Note: this function is very fast so can be called as many time as
+ * the caller wishes. The main usage of this function currently is
+ * enforcing the client output length limits. */
+unsigned long getClientOutputBufferMemoryUsage(client *c) {
+    unsigned long list_item_size = sizeof(listNode) + sizeof(clientReplyBlock);
+    return c->reply_bytes + (list_item_size*listLength(c->reply));
+}
+
+/* Get the class of a client, used in order to enforce limits to different
+ * classes of clients.
+ *
+ * The function will return one of the following:
+ * CLIENT_TYPE_NORMAL -> Normal client
+ * CLIENT_TYPE_SLAVE  -> Slave
+ * CLIENT_TYPE_PUBSUB -> Client subscribed to Pub/Sub channels
+ * CLIENT_TYPE_MASTER -> The client representing our replication master.
+ */
+int getClientType(client *c) {
+    if (c->flags & CLIENT_MASTER) return CLIENT_TYPE_MASTER;
+    /* Even though MONITOR clients are marked as replicas, we
+     * want the expose them as normal clients. */
+    if ((c->flags & CLIENT_SLAVE) && !(c->flags & CLIENT_MONITOR))
+        return CLIENT_TYPE_SLAVE;
+    if (c->flags & CLIENT_PUBSUB) return CLIENT_TYPE_PUBSUB;
+    return CLIENT_TYPE_NORMAL;
+}
+
+int getClientTypeByName(char *name) {
+    if (!strcasecmp(name,"normal")) return CLIENT_TYPE_NORMAL;
+    else if (!strcasecmp(name,"slave")) return CLIENT_TYPE_SLAVE;
+    else if (!strcasecmp(name,"replica")) return CLIENT_TYPE_SLAVE;
+    else if (!strcasecmp(name,"pubsub")) return CLIENT_TYPE_PUBSUB;
+    else if (!strcasecmp(name,"master")) return CLIENT_TYPE_MASTER;
+    else return -1;
+}
+
+char *getClientTypeName(int class) {
+    switch(class) {
+    case CLIENT_TYPE_NORMAL: return "normal";
+    case CLIENT_TYPE_SLAVE:  return "slave";
+    case CLIENT_TYPE_PUBSUB: return "pubsub";
+    case CLIENT_TYPE_MASTER: return "master";
+    default:                       return NULL;
+    }
+}
+
+/* The function checks if the client reached output buffer soft or hard
+ * limit, and also update the state needed to check the soft limit as
+ * a side effect.
+ *
+ * Return value: non-zero if the client reached the soft or the hard limit.
+ *               Otherwise zero is returned. */
+int checkClientOutputBufferLimits(client *c) {
+    int soft = 0, hard = 0, class;
+    unsigned long used_mem = getClientOutputBufferMemoryUsage(c);
+
+    class = getClientType(c);
+    /* For the purpose of output buffer limiting, masters are handled
+     * like normal clients. */
+    if (class == CLIENT_TYPE_MASTER) class = CLIENT_TYPE_NORMAL;
+
+    if (server.client_obuf_limits[class].hard_limit_bytes &&
+        used_mem >= server.client_obuf_limits[class].hard_limit_bytes)
+        hard = 1;
+    if (server.client_obuf_limits[class].soft_limit_bytes &&
+        used_mem >= server.client_obuf_limits[class].soft_limit_bytes)
+        soft = 1;
+
+    /* We need to check if the soft limit is reached continuously for the
+     * specified amount of seconds. */
+    if (soft) {
+        if (c->obuf_soft_limit_reached_time == 0) {
+            c->obuf_soft_limit_reached_time = server.unixtime;
+            soft = 0; /* First time we see the soft limit reached */
+        } else {
+            time_t elapsed = server.unixtime - c->obuf_soft_limit_reached_time;
+
+            if (elapsed <=
+                server.client_obuf_limits[class].soft_limit_seconds) {
+                soft = 0; /* The client still did not reached the max number of
+                             seconds for the soft limit to be considered
+                             reached. */
+            }
+        }
+    } else {
+        c->obuf_soft_limit_reached_time = 0;
+    }
+    return soft || hard;
+}
+
+/* Asynchronously close a client if soft or hard limit is reached on the
+ * output buffer size. The caller can check if the client will be closed
+ * checking if the client CLIENT_CLOSE_ASAP flag is set.
+ *
+ * Note: we need to close the client asynchronously because this function is
+ * called from contexts where the client can't be freed safely, i.e. from the
+ * lower level functions pushing data inside the client output buffers.
+ * When `async` is set to 0, we close the client immediately, this is
+ * useful when called from cron.
+ *
+ * Returns 1 if client was (flagged) closed. */
+int closeClientOnOutputBufferLimitReached(client *c, int async) {
+    if (!c->conn) return 0; /* It is unsafe to free fake clients. */
+    serverAssert(c->reply_bytes < SIZE_MAX-(1024*64));
+    if (c->reply_bytes == 0 || c->flags & CLIENT_CLOSE_ASAP) return 0;
+    if (checkClientOutputBufferLimits(c)) {
+        sds client = catClientInfoString(sdsempty(),c);
+
+        if (async) {
+            freeClientAsync(c);
+            serverLog(LL_WARNING,
+                      "Client %s scheduled to be closed ASAP for overcoming of output buffer limits.",
+                      client);
+        } else {
+            freeClient(c);
+            serverLog(LL_WARNING,
+                      "Client %s closed for overcoming of output buffer limits.",
+                      client);
+        }
+        sdsfree(client);
+        return  1;
+    }
+    return 0;
+}
+
+/* Helper function used by performEvictions() in order to flush slaves
+ * output buffers without returning control to the event loop.
+ * This is also called by SHUTDOWN for a best-effort attempt to send
+ * slaves the latest writes. */
+void flushSlavesOutputBuffers(void) {
+    listIter li;
+    listNode *ln;
+
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = listNodeValue(ln);
+        int can_receive_writes = connHasWriteHandler(slave->conn) ||
+                                 (slave->flags & CLIENT_PENDING_WRITE);
+
+        /* We don't want to send the pending data to the replica in a few
+         * cases:
+         *
+         * 1. For some reason there is neither the write handler installed
+         *    nor the client is flagged as to have pending writes: for some
+         *    reason this replica may not be set to receive data. This is
+         *    just for the sake of defensive programming.
+         *
+         * 2. The put_online_on_ack flag is true. To know why we don't want
+         *    to send data to the replica in this case, please grep for the
+         *    flag for this flag.
+         *
+         * 3. Obviously if the slave is not ONLINE.
+         */
+        if (slave->replstate == SLAVE_STATE_ONLINE &&
+            can_receive_writes &&
+            !slave->repl_put_online_on_ack &&
+            clientHasPendingReplies(slave))
+        {
+            writeToClient(slave,0);
+        }
+    }
+}
+
+/* Pause clients up to the specified unixtime (in ms) for a given type of
+ * commands.
+ *
+ * A main use case of this function is to allow pausing replication traffic
+ * so that a failover without data loss to occur. Replicas will continue to receive
+ * traffic to faciliate this functionality.
+ * 
+ * This function is also internally used by Redis Cluster for the manual
+ * failover procedure implemented by CLUSTER FAILOVER.
+ *
+ * The function always succeed, even if there is already a pause in progress.
+ * In such a case, the duration is set to the maximum and new end time and the
+ * type is set to the more restrictive type of pause. */
+void pauseClients(mstime_t end, pause_type type) {
+    if (type > server.client_pause_type) {
+        server.client_pause_type = type;
+    }
+
+    if (end > server.client_pause_end_time) {
+        server.client_pause_end_time = end;
+    }
+
+    /* We allow write commands that were queued
+     * up before and after to execute. We need
+     * to track this state so that we don't assert
+     * in propagate(). */
+    if (server.in_exec) {
+        server.client_pause_in_transaction = 1;
+    }
+}
+
+/* Unpause clients and queue them for reprocessing. */
+void unpauseClients(void) {
+    listNode *ln;
+    listIter li;
+    client *c;
+    
+    server.client_pause_type = CLIENT_PAUSE_OFF;
+    server.client_pause_end_time = 0;
+
+    /* Unblock all of the clients so they are reprocessed. */
+    listRewind(server.paused_clients,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        c = listNodeValue(ln);
+        unblockClient(c);
+    }
+}
+
+/* Returns true if clients are paused and false otherwise. */ 
+int areClientsPaused(void) {
+    return server.client_pause_type != CLIENT_PAUSE_OFF;
+}
+
+/* Checks if the current client pause has elapsed and unpause clients
+ * if it has. Also returns true if clients are now paused and false 
+ * otherwise. */
+int checkClientPauseTimeoutAndReturnIfPaused(void) {
+    if (!areClientsPaused())
+        return 0;
+    if (server.client_pause_end_time < server.mstime) {
+        unpauseClients();
+    }
+    return areClientsPaused();
+}
+
+/* This function is called by Redis in order to process a few events from
+ * time to time while blocked into some not interruptible operation.
+ * This allows to reply to clients with the -LOADING error while loading the
+ * data set at startup or after a full resynchronization with the master
+ * and so forth.
+ *
+ * It calls the event loop in order to process a few events. Specifically we
+ * try to call the event loop 4 times as long as we receive acknowledge that
+ * some event was processed, in order to go forward with the accept, read,
+ * write, close sequence needed to serve a client.
+ *
+ * The function returns the total number of events processed. */
+void processEventsWhileBlocked(void) {
+    int iterations = 4; /* See the function top-comment. */
+
+    /* Update our cached time since it is used to create and update the last
+     * interaction time with clients and for other important things. */
+    updateCachedTime(0);
+
+    /* Note: when we are processing events while blocked (for instance during
+     * busy Lua scripts), we set a global flag. When such flag is set, we
+     * avoid handling the read part of clients using threaded I/O.
+     * See https://github.com/redis/redis/issues/6988 for more info. */
+    ProcessingEventsWhileBlocked = 1;
+    while (iterations--) {
+        long long startval = server.events_processed_while_blocked;
+        long long ae_events = aeProcessEvents(server.el,
+            AE_FILE_EVENTS|AE_DONT_WAIT|
+            AE_CALL_BEFORE_SLEEP|AE_CALL_AFTER_SLEEP);
+        /* Note that server.events_processed_while_blocked will also get
+         * incremeted by callbacks called by the event loop handlers. */
+        server.events_processed_while_blocked += ae_events;
+        long long events = server.events_processed_while_blocked - startval;
+        if (!events) break;
+    }
+
+    whileBlockedCron();
+
+    ProcessingEventsWhileBlocked = 0;
+}
+
+/* ==========================================================================
+ * Threaded I/O
+ * ========================================================================== */
+
+#define IO_THREADS_MAX_NUM 128
+#define IO_THREADS_OP_READ 0
+#define IO_THREADS_OP_WRITE 1
+
+pthread_t io_threads[IO_THREADS_MAX_NUM];
+pthread_mutex_t io_threads_mutex[IO_THREADS_MAX_NUM];
+redisAtomic unsigned long io_threads_pending[IO_THREADS_MAX_NUM];
+int io_threads_op;      /* IO_THREADS_OP_WRITE or IO_THREADS_OP_READ. */
+
+/* This is the list of clients each thread will serve when threaded I/O is
+ * used. We spawn io_threads_num-1 threads, since one is the main thread
+ * itself. */
+list *io_threads_list[IO_THREADS_MAX_NUM];
+
+static inline unsigned long getIOPendingCount(int i) {
+    unsigned long count = 0;
+    atomicGetWithSync(io_threads_pending[i], count);
+    return count;
+}
+
+static inline void setIOPendingCount(int i, unsigned long count) {
+    atomicSetWithSync(io_threads_pending[i], count);
+}
+
+void *IOThreadMain(void *myid) {
+    /* The ID is the thread number (from 0 to server.iothreads_num-1), and is
+     * used by the thread to just manipulate a single sub-array of clients. */
+    long id = (unsigned long)myid;
+    char thdname[16];
+
+    snprintf(thdname, sizeof(thdname), "io_thd_%ld", id);
+    redis_set_thread_title(thdname);
+    redisSetCpuAffinity(server.server_cpulist);
+    makeThreadKillable();
+
+    while(1) {
+        /* Wait for start */
+        for (int j = 0; j < 1000000; j++) {
+            if (getIOPendingCount(id) != 0) break;
+        }
+
+        /* Give the main thread a chance to stop this thread. */
+        if (getIOPendingCount(id) == 0) {
+            pthread_mutex_lock(&io_threads_mutex[id]);
+            pthread_mutex_unlock(&io_threads_mutex[id]);
+            continue;
+        }
+
+        serverAssert(getIOPendingCount(id) != 0);
+
+        /* Process: note that the main thread will never touch our list
+         * before we drop the pending count to 0. */
+        listIter li;
+        listNode *ln;
+        listRewind(io_threads_list[id],&li);
+        while((ln = listNext(&li))) {
+            client *c = listNodeValue(ln);
+            if (io_threads_op == IO_THREADS_OP_WRITE) {
+                writeToClient(c,0);
+            } else if (io_threads_op == IO_THREADS_OP_READ) {
+                readQueryFromClient(c->conn);
+            } else {
+                serverPanic("io_threads_op value is unknown");
+            }
+        }
+        listEmpty(io_threads_list[id]);
+        setIOPendingCount(id, 0);
+    }
+}
+
+/* Initialize the data structures needed for threaded I/O. */
+void initThreadedIO(void) {
+    server.io_threads_active = 0; /* We start with threads not active. */
+
+    /* Don't spawn any thread if the user selected a single thread:
+     * we'll handle I/O directly from the main thread. */
+    if (server.io_threads_num == 1) return;
+
+    if (server.io_threads_num > IO_THREADS_MAX_NUM) {
+        serverLog(LL_WARNING,"Fatal: too many I/O threads configured. "
+                             "The maximum number is %d.", IO_THREADS_MAX_NUM);
+        exit(1);
+    }
+
+    /* Spawn and initialize the I/O threads. */
+    for (int i = 0; i < server.io_threads_num; i++) {
+        /* Things we do for all the threads including the main thread. */
+        io_threads_list[i] = listCreate();
+        if (i == 0) continue; /* Thread 0 is the main thread. */
+
+        /* Things we do only for the additional threads. */
+        pthread_t tid;
+        pthread_mutex_init(&io_threads_mutex[i],NULL);
+        setIOPendingCount(i, 0);
+        pthread_mutex_lock(&io_threads_mutex[i]); /* Thread will be stopped. */
+        if (pthread_create(&tid,NULL,IOThreadMain,(void*)(long)i) != 0) {
+            serverLog(LL_WARNING,"Fatal: Can't initialize IO thread.");
+            exit(1);
+        }
+        io_threads[i] = tid;
+    }
+}
+
+void killIOThreads(void) {
+    int err, j;
+    for (j = 0; j < server.io_threads_num; j++) {
+        if (io_threads[j] == pthread_self()) continue;
+        if (io_threads[j] && pthread_cancel(io_threads[j]) == 0) {
+            if ((err = pthread_join(io_threads[j],NULL)) != 0) {
+                serverLog(LL_WARNING,
+                    "IO thread(tid:%lu) can not be joined: %s",
+                        (unsigned long)io_threads[j], strerror(err));
+            } else {
+                serverLog(LL_WARNING,
+                    "IO thread(tid:%lu) terminated",(unsigned long)io_threads[j]);
+            }
+        }
+    }
+}
+
+void startThreadedIO(void) {
+    serverAssert(server.io_threads_active == 0);
+    for (int j = 1; j < server.io_threads_num; j++)
+        pthread_mutex_unlock(&io_threads_mutex[j]);
+    server.io_threads_active = 1;
+}
+
+void stopThreadedIO(void) {
+    /* We may have still clients with pending reads when this function
+     * is called: handle them before stopping the threads. */
+    handleClientsWithPendingReadsUsingThreads();
+    serverAssert(server.io_threads_active == 1);
+    for (int j = 1; j < server.io_threads_num; j++)
+        pthread_mutex_lock(&io_threads_mutex[j]);
+    server.io_threads_active = 0;
+}
+
+/* This function checks if there are not enough pending clients to justify
+ * taking the I/O threads active: in that case I/O threads are stopped if
+ * currently active. We track the pending writes as a measure of clients
+ * we need to handle in parallel, however the I/O threading is disabled
+ * globally for reads as well if we have too little pending clients.
+ *
+ * The function returns 0 if the I/O threading should be used because there
+ * are enough active threads, otherwise 1 is returned and the I/O threads
+ * could be possibly stopped (if already active) as a side effect. */
+int stopThreadedIOIfNeeded(void) {
+    int pending = listLength(server.clients_pending_write);
+
+    /* Return ASAP if IO threads are disabled (single threaded mode). */
+    if (server.io_threads_num == 1) return 1;
+
+    if (pending < (server.io_threads_num*2)) {
+        if (server.io_threads_active) stopThreadedIO();
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+int handleClientsWithPendingWritesUsingThreads(void) {
+    int processed = listLength(server.clients_pending_write);
+    if (processed == 0) return 0; /* Return ASAP if there are no clients. */
+
+    /* If I/O threads are disabled or we have few clients to serve, don't
+     * use I/O threads, but the boring synchronous code. */
+    if (server.io_threads_num == 1 || stopThreadedIOIfNeeded()) {
+        return handleClientsWithPendingWrites();
+    }
+
+    /* Start threads if needed. */
+    if (!server.io_threads_active) startThreadedIO();
+
+    /* Distribute the clients across N different lists. */
+    listIter li;
+    listNode *ln;
+    listRewind(server.clients_pending_write,&li);
+    int item_id = 0;
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+        c->flags &= ~CLIENT_PENDING_WRITE;
+
+        /* Remove clients from the list of pending writes since
+         * they are going to be closed ASAP. */
+        if (c->flags & CLIENT_CLOSE_ASAP) {
+            listDelNode(server.clients_pending_write, ln);
+            continue;
+        }
+
+        int target_id = item_id % server.io_threads_num;
+        listAddNodeTail(io_threads_list[target_id],c);
+        item_id++;
+    }
+
+    /* Give the start condition to the waiting threads, by setting the
+     * start condition atomic var. */
+    io_threads_op = IO_THREADS_OP_WRITE;
+    for (int j = 1; j < server.io_threads_num; j++) {
+        int count = listLength(io_threads_list[j]);
+        setIOPendingCount(j, count);
+    }
+
+    /* Also use the main thread to process a slice of clients. */
+    listRewind(io_threads_list[0],&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+        writeToClient(c,0);
+    }
+    listEmpty(io_threads_list[0]);
+
+    /* Wait for all the other threads to end their work. */
+    while(1) {
+        unsigned long pending = 0;
+        for (int j = 1; j < server.io_threads_num; j++)
+            pending += getIOPendingCount(j);
+        if (pending == 0) break;
+    }
+
+    /* Run the list of clients again to install the write handler where
+     * needed. */
+    listRewind(server.clients_pending_write,&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+
+        /* Install the write handler if there are pending writes in some
+         * of the clients. */
+        if (clientHasPendingReplies(c) &&
+                connSetWriteHandler(c->conn, sendReplyToClient) == AE_ERR)
+        {
+            freeClientAsync(c);
+        }
+    }
+    listEmpty(server.clients_pending_write);
+
+    /* Update processed count on server */
+    server.stat_io_writes_processed += processed;
+
+    return processed;
+}
+
+/* Return 1 if we want to handle the client read later using threaded I/O.
+ * This is called by the readable handler of the event loop.
+ * As a side effect of calling this function the client is put in the
+ * pending read clients and flagged as such. */
+int postponeClientRead(client *c) {
+    if (server.io_threads_active &&
+        server.io_threads_do_reads &&
+        !ProcessingEventsWhileBlocked &&
+        !(c->flags & (CLIENT_MASTER|CLIENT_SLAVE|CLIENT_PENDING_READ|CLIENT_BLOCKED))) 
+    {
+        c->flags |= CLIENT_PENDING_READ;
+        listAddNodeHead(server.clients_pending_read,c);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* When threaded I/O is also enabled for the reading + parsing side, the
+ * readable handler will just put normal clients into a queue of clients to
+ * process (instead of serving them synchronously). This function runs
+ * the queue using the I/O threads, and process them in order to accumulate
+ * the reads in the buffers, and also parse the first command available
+ * rendering it in the client structures. */
+int handleClientsWithPendingReadsUsingThreads(void) {
+    if (!server.io_threads_active || !server.io_threads_do_reads) return 0;
+    int processed = listLength(server.clients_pending_read);
+    if (processed == 0) return 0;
+
+    /* Distribute the clients across N different lists. */
+    listIter li;
+    listNode *ln;
+    listRewind(server.clients_pending_read,&li);
+    int item_id = 0;
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+        int target_id = item_id % server.io_threads_num;
+        listAddNodeTail(io_threads_list[target_id],c);
+        item_id++;
+    }
+
+    /* Give the start condition to the waiting threads, by setting the
+     * start condition atomic var. */
+    io_threads_op = IO_THREADS_OP_READ;
+    for (int j = 1; j < server.io_threads_num; j++) {
+        int count = listLength(io_threads_list[j]);
+        setIOPendingCount(j, count);
+    }
+
+    /* Also use the main thread to process a slice of clients. */
+    listRewind(io_threads_list[0],&li);
+    while((ln = listNext(&li))) {
+        client *c = listNodeValue(ln);
+        readQueryFromClient(c->conn);
+    }
+    listEmpty(io_threads_list[0]);
+
+    /* Wait for all the other threads to end their work. */
+    while(1) {
+        unsigned long pending = 0;
+        for (int j = 1; j < server.io_threads_num; j++)
+            pending += getIOPendingCount(j);
+        if (pending == 0) break;
+    }
+
+    /* Run the list of clients again to process the new buffers. */
+    while(listLength(server.clients_pending_read)) {
+        ln = listFirst(server.clients_pending_read);
+        client *c = listNodeValue(ln);
+        c->flags &= ~CLIENT_PENDING_READ;
+        listDelNode(server.clients_pending_read,ln);
+
+        serverAssert(!(c->flags & CLIENT_BLOCKED));
+        if (processPendingCommandsAndResetClient(c) == C_ERR) {
+            /* If the client is no longer valid, we avoid
+             * processing the client later. So we just go
+             * to the next. */
+            continue;
+        }
+
+        processInputBuffer(c);
+
+        /* We may have pending replies if a thread readQueryFromClient() produced
+         * replies and did not install a write handler (it can't).
+         */
+        if (!(c->flags & CLIENT_PENDING_WRITE) && clientHasPendingReplies(c))
+            clientInstallWriteHandler(c);
+    }
+
+    /* Update processed count on server */
+    server.stat_io_reads_processed += processed;
+
+    return processed;
+}
diff --git a/redis-stable/src/notify.c b/redis-stable/src/notify.c
new file mode 100644
index 00000000..afaddbfc
--- /dev/null
+++ b/redis-stable/src/notify.c
@@ -0,0 +1,142 @@
+/*
+ * Copyright (c) 2013, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* This file implements keyspace events notification via Pub/Sub and
+ * described at https://redis.io/topics/notifications. */
+
+/* Turn a string representing notification classes into an integer
+ * representing notification classes flags xored.
+ *
+ * The function returns -1 if the input contains characters not mapping to
+ * any class. */
+int keyspaceEventsStringToFlags(char *classes) {
+    char *p = classes;
+    int c, flags = 0;
+
+    while((c = *p++) != '\0') {
+        switch(c) {
+        case 'A': flags |= NOTIFY_ALL; break;
+        case 'g': flags |= NOTIFY_GENERIC; break;
+        case '$': flags |= NOTIFY_STRING; break;
+        case 'l': flags |= NOTIFY_LIST; break;
+        case 's': flags |= NOTIFY_SET; break;
+        case 'h': flags |= NOTIFY_HASH; break;
+        case 'z': flags |= NOTIFY_ZSET; break;
+        case 'x': flags |= NOTIFY_EXPIRED; break;
+        case 'e': flags |= NOTIFY_EVICTED; break;
+        case 'K': flags |= NOTIFY_KEYSPACE; break;
+        case 'E': flags |= NOTIFY_KEYEVENT; break;
+        case 't': flags |= NOTIFY_STREAM; break;
+        case 'm': flags |= NOTIFY_KEY_MISS; break;
+        case 'd': flags |= NOTIFY_MODULE; break;
+        default: return -1;
+        }
+    }
+    return flags;
+}
+
+/* This function does exactly the reverse of the function above: it gets
+ * as input an integer with the xored flags and returns a string representing
+ * the selected classes. The string returned is an sds string that needs to
+ * be released with sdsfree(). */
+sds keyspaceEventsFlagsToString(int flags) {
+    sds res;
+
+    res = sdsempty();
+    if ((flags & NOTIFY_ALL) == NOTIFY_ALL) {
+        res = sdscatlen(res,"A",1);
+    } else {
+        if (flags & NOTIFY_GENERIC) res = sdscatlen(res,"g",1);
+        if (flags & NOTIFY_STRING) res = sdscatlen(res,"$",1);
+        if (flags & NOTIFY_LIST) res = sdscatlen(res,"l",1);
+        if (flags & NOTIFY_SET) res = sdscatlen(res,"s",1);
+        if (flags & NOTIFY_HASH) res = sdscatlen(res,"h",1);
+        if (flags & NOTIFY_ZSET) res = sdscatlen(res,"z",1);
+        if (flags & NOTIFY_EXPIRED) res = sdscatlen(res,"x",1);
+        if (flags & NOTIFY_EVICTED) res = sdscatlen(res,"e",1);
+        if (flags & NOTIFY_STREAM) res = sdscatlen(res,"t",1);
+        if (flags & NOTIFY_MODULE) res = sdscatlen(res,"d",1);
+    }
+    if (flags & NOTIFY_KEYSPACE) res = sdscatlen(res,"K",1);
+    if (flags & NOTIFY_KEYEVENT) res = sdscatlen(res,"E",1);
+    if (flags & NOTIFY_KEY_MISS) res = sdscatlen(res,"m",1);
+    return res;
+}
+
+/* The API provided to the rest of the Redis core is a simple function:
+ *
+ * notifyKeyspaceEvent(char *event, robj *key, int dbid);
+ *
+ * 'event' is a C string representing the event name.
+ * 'key' is a Redis object representing the key name.
+ * 'dbid' is the database ID where the key lives.  */
+void notifyKeyspaceEvent(int type, char *event, robj *key, int dbid) {
+    sds chan;
+    robj *chanobj, *eventobj;
+    int len = -1;
+    char buf[24];
+
+    /* If any modules are interested in events, notify the module system now.
+     * This bypasses the notifications configuration, but the module engine
+     * will only call event subscribers if the event type matches the types
+     * they are interested in. */
+     moduleNotifyKeyspaceEvent(type, event, key, dbid);
+
+    /* If notifications for this class of events are off, return ASAP. */
+    if (!(server.notify_keyspace_events & type)) return;
+
+    eventobj = createStringObject(event,strlen(event));
+
+    /* __keyspace@<db>__:<key> <event> notifications. */
+    if (server.notify_keyspace_events & NOTIFY_KEYSPACE) {
+        chan = sdsnewlen("__keyspace@",11);
+        len = ll2string(buf,sizeof(buf),dbid);
+        chan = sdscatlen(chan, buf, len);
+        chan = sdscatlen(chan, "__:", 3);
+        chan = sdscatsds(chan, key->ptr);
+        chanobj = createObject(OBJ_STRING, chan);
+        pubsubPublishMessage(chanobj, eventobj);
+        decrRefCount(chanobj);
+    }
+
+    /* __keyevent@<db>__:<event> <key> notifications. */
+    if (server.notify_keyspace_events & NOTIFY_KEYEVENT) {
+        chan = sdsnewlen("__keyevent@",11);
+        if (len == -1) len = ll2string(buf,sizeof(buf),dbid);
+        chan = sdscatlen(chan, buf, len);
+        chan = sdscatlen(chan, "__:", 3);
+        chan = sdscatsds(chan, eventobj->ptr);
+        chanobj = createObject(OBJ_STRING, chan);
+        pubsubPublishMessage(chanobj, key);
+        decrRefCount(chanobj);
+    }
+    decrRefCount(eventobj);
+}
diff --git a/redis-stable/src/object.c b/redis-stable/src/object.c
new file mode 100644
index 00000000..8a5e80a6
--- /dev/null
+++ b/redis-stable/src/object.c
@@ -0,0 +1,1472 @@
+/* Redis Object implementation.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <math.h>
+#include <ctype.h>
+
+#ifdef __CYGWIN__
+#define strtold(a,b) ((long double)strtod((a),(b)))
+#endif
+
+/* ===================== Creation and parsing of objects ==================== */
+
+robj *createObject(int type, void *ptr) {
+    robj *o = zmalloc(sizeof(*o));
+    o->type = type;
+    o->encoding = OBJ_ENCODING_RAW;
+    o->ptr = ptr;
+    o->refcount = 1;
+
+    /* Set the LRU to the current lruclock (minutes resolution), or
+     * alternatively the LFU counter. */
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+        o->lru = (LFUGetTimeInMinutes()<<8) | LFU_INIT_VAL;
+    } else {
+        o->lru = LRU_CLOCK();
+    }
+    return o;
+}
+
+/* Set a special refcount in the object to make it "shared":
+ * incrRefCount and decrRefCount() will test for this special refcount
+ * and will not touch the object. This way it is free to access shared
+ * objects such as small integers from different threads without any
+ * mutex.
+ *
+ * A common patter to create shared objects:
+ *
+ * robj *myobject = makeObjectShared(createObject(...));
+ *
+ */
+robj *makeObjectShared(robj *o) {
+    serverAssert(o->refcount == 1);
+    o->refcount = OBJ_SHARED_REFCOUNT;
+    return o;
+}
+
+/* Create a string object with encoding OBJ_ENCODING_RAW, that is a plain
+ * string object where o->ptr points to a proper sds string. */
+robj *createRawStringObject(const char *ptr, size_t len) {
+    return createObject(OBJ_STRING, sdsnewlen(ptr,len));
+}
+
+/* Create a string object with encoding OBJ_ENCODING_EMBSTR, that is
+ * an object where the sds string is actually an unmodifiable string
+ * allocated in the same chunk as the object itself. */
+robj *createEmbeddedStringObject(const char *ptr, size_t len) {
+    robj *o = zmalloc(sizeof(robj)+sizeof(struct sdshdr8)+len+1);
+    struct sdshdr8 *sh = (void*)(o+1);
+
+    o->type = OBJ_STRING;
+    o->encoding = OBJ_ENCODING_EMBSTR;
+    o->ptr = sh+1;
+    o->refcount = 1;
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+        o->lru = (LFUGetTimeInMinutes()<<8) | LFU_INIT_VAL;
+    } else {
+        o->lru = LRU_CLOCK();
+    }
+
+    sh->len = len;
+    sh->alloc = len;
+    sh->flags = SDS_TYPE_8;
+    if (ptr == SDS_NOINIT)
+        sh->buf[len] = '\0';
+    else if (ptr) {
+        memcpy(sh->buf,ptr,len);
+        sh->buf[len] = '\0';
+    } else {
+        memset(sh->buf,0,len+1);
+    }
+    return o;
+}
+
+/* Create a string object with EMBSTR encoding if it is smaller than
+ * OBJ_ENCODING_EMBSTR_SIZE_LIMIT, otherwise the RAW encoding is
+ * used.
+ *
+ * The current limit of 44 is chosen so that the biggest string object
+ * we allocate as EMBSTR will still fit into the 64 byte arena of jemalloc. */
+#define OBJ_ENCODING_EMBSTR_SIZE_LIMIT 44
+robj *createStringObject(const char *ptr, size_t len) {
+    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT)
+        return createEmbeddedStringObject(ptr,len);
+    else
+        return createRawStringObject(ptr,len);
+}
+
+/* Same as CreateRawStringObject, can return NULL if allocation fails */
+robj *tryCreateRawStringObject(const char *ptr, size_t len) {
+    sds str = sdstrynewlen(ptr,len);
+    if (!str) return NULL;
+    return createObject(OBJ_STRING, str);
+}
+
+/* Same as createStringObject, can return NULL if allocation fails */
+robj *tryCreateStringObject(const char *ptr, size_t len) {
+    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT)
+        return createEmbeddedStringObject(ptr,len);
+    else
+        return tryCreateRawStringObject(ptr,len);
+}
+
+/* Create a string object from a long long value. When possible returns a
+ * shared integer object, or at least an integer encoded one.
+ *
+ * If valueobj is non zero, the function avoids returning a shared
+ * integer, because the object is going to be used as value in the Redis key
+ * space (for instance when the INCR command is used), so we want LFU/LRU
+ * values specific for each key. */
+robj *createStringObjectFromLongLongWithOptions(long long value, int valueobj) {
+    robj *o;
+
+    if (server.maxmemory == 0 ||
+        !(server.maxmemory_policy & MAXMEMORY_FLAG_NO_SHARED_INTEGERS))
+    {
+        /* If the maxmemory policy permits, we can still return shared integers
+         * even if valueobj is true. */
+        valueobj = 0;
+    }
+
+    if (value >= 0 && value < OBJ_SHARED_INTEGERS && valueobj == 0) {
+        incrRefCount(shared.integers[value]);
+        o = shared.integers[value];
+    } else {
+        if (value >= LONG_MIN && value <= LONG_MAX) {
+            o = createObject(OBJ_STRING, NULL);
+            o->encoding = OBJ_ENCODING_INT;
+            o->ptr = (void*)((long)value);
+        } else {
+            o = createObject(OBJ_STRING,sdsfromlonglong(value));
+        }
+    }
+    return o;
+}
+
+/* Wrapper for createStringObjectFromLongLongWithOptions() always demanding
+ * to create a shared object if possible. */
+robj *createStringObjectFromLongLong(long long value) {
+    return createStringObjectFromLongLongWithOptions(value,0);
+}
+
+/* Wrapper for createStringObjectFromLongLongWithOptions() avoiding a shared
+ * object when LFU/LRU info are needed, that is, when the object is used
+ * as a value in the key space, and Redis is configured to evict based on
+ * LFU/LRU. */
+robj *createStringObjectFromLongLongForValue(long long value) {
+    return createStringObjectFromLongLongWithOptions(value,1);
+}
+
+/* Create a string object from a long double. If humanfriendly is non-zero
+ * it does not use exponential format and trims trailing zeroes at the end,
+ * however this results in loss of precision. Otherwise exp format is used
+ * and the output of snprintf() is not modified.
+ *
+ * The 'humanfriendly' option is used for INCRBYFLOAT and HINCRBYFLOAT. */
+robj *createStringObjectFromLongDouble(long double value, int humanfriendly) {
+    char buf[MAX_LONG_DOUBLE_CHARS];
+    int len = ld2string(buf,sizeof(buf),value,humanfriendly? LD_STR_HUMAN: LD_STR_AUTO);
+    return createStringObject(buf,len);
+}
+
+/* Duplicate a string object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * This function also guarantees that duplicating a small integer object
+ * (or a string object that contains a representation of a small integer)
+ * will always result in a fresh object that is unshared (refcount == 1).
+ *
+ * The resulting object always has refcount set to 1. */
+robj *dupStringObject(const robj *o) {
+    robj *d;
+
+    serverAssert(o->type == OBJ_STRING);
+
+    switch(o->encoding) {
+    case OBJ_ENCODING_RAW:
+        return createRawStringObject(o->ptr,sdslen(o->ptr));
+    case OBJ_ENCODING_EMBSTR:
+        return createEmbeddedStringObject(o->ptr,sdslen(o->ptr));
+    case OBJ_ENCODING_INT:
+        d = createObject(OBJ_STRING, NULL);
+        d->encoding = OBJ_ENCODING_INT;
+        d->ptr = o->ptr;
+        return d;
+    default:
+        serverPanic("Wrong encoding.");
+        break;
+    }
+}
+
+robj *createQuicklistObject(void) {
+    quicklist *l = quicklistCreate();
+    robj *o = createObject(OBJ_LIST,l);
+    o->encoding = OBJ_ENCODING_QUICKLIST;
+    return o;
+}
+
+robj *createZiplistObject(void) {
+    unsigned char *zl = ziplistNew();
+    robj *o = createObject(OBJ_LIST,zl);
+    o->encoding = OBJ_ENCODING_ZIPLIST;
+    return o;
+}
+
+robj *createSetObject(void) {
+    dict *d = dictCreate(&setDictType,NULL);
+    robj *o = createObject(OBJ_SET,d);
+    o->encoding = OBJ_ENCODING_HT;
+    return o;
+}
+
+robj *createIntsetObject(void) {
+    intset *is = intsetNew();
+    robj *o = createObject(OBJ_SET,is);
+    o->encoding = OBJ_ENCODING_INTSET;
+    return o;
+}
+
+robj *createHashObject(void) {
+    unsigned char *zl = ziplistNew();
+    robj *o = createObject(OBJ_HASH, zl);
+    o->encoding = OBJ_ENCODING_ZIPLIST;
+    return o;
+}
+
+robj *createZsetObject(void) {
+    zset *zs = zmalloc(sizeof(*zs));
+    robj *o;
+
+    zs->dict = dictCreate(&zsetDictType,NULL);
+    zs->zsl = zslCreate();
+    o = createObject(OBJ_ZSET,zs);
+    o->encoding = OBJ_ENCODING_SKIPLIST;
+    return o;
+}
+
+robj *createZsetZiplistObject(void) {
+    unsigned char *zl = ziplistNew();
+    robj *o = createObject(OBJ_ZSET,zl);
+    o->encoding = OBJ_ENCODING_ZIPLIST;
+    return o;
+}
+
+robj *createStreamObject(void) {
+    stream *s = streamNew();
+    robj *o = createObject(OBJ_STREAM,s);
+    o->encoding = OBJ_ENCODING_STREAM;
+    return o;
+}
+
+robj *createModuleObject(moduleType *mt, void *value) {
+    moduleValue *mv = zmalloc(sizeof(*mv));
+    mv->type = mt;
+    mv->value = value;
+    return createObject(OBJ_MODULE,mv);
+}
+
+void freeStringObject(robj *o) {
+    if (o->encoding == OBJ_ENCODING_RAW) {
+        sdsfree(o->ptr);
+    }
+}
+
+void freeListObject(robj *o) {
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklistRelease(o->ptr);
+    } else {
+        serverPanic("Unknown list encoding type");
+    }
+}
+
+void freeSetObject(robj *o) {
+    switch (o->encoding) {
+    case OBJ_ENCODING_HT:
+        dictRelease((dict*) o->ptr);
+        break;
+    case OBJ_ENCODING_INTSET:
+        zfree(o->ptr);
+        break;
+    default:
+        serverPanic("Unknown set encoding type");
+    }
+}
+
+void freeZsetObject(robj *o) {
+    zset *zs;
+    switch (o->encoding) {
+    case OBJ_ENCODING_SKIPLIST:
+        zs = o->ptr;
+        dictRelease(zs->dict);
+        zslFree(zs->zsl);
+        zfree(zs);
+        break;
+    case OBJ_ENCODING_ZIPLIST:
+        zfree(o->ptr);
+        break;
+    default:
+        serverPanic("Unknown sorted set encoding");
+    }
+}
+
+void freeHashObject(robj *o) {
+    switch (o->encoding) {
+    case OBJ_ENCODING_HT:
+        dictRelease((dict*) o->ptr);
+        break;
+    case OBJ_ENCODING_ZIPLIST:
+        zfree(o->ptr);
+        break;
+    default:
+        serverPanic("Unknown hash encoding type");
+        break;
+    }
+}
+
+void freeModuleObject(robj *o) {
+    moduleValue *mv = o->ptr;
+    mv->type->free(mv->value);
+    zfree(mv);
+}
+
+void freeStreamObject(robj *o) {
+    freeStream(o->ptr);
+}
+
+void incrRefCount(robj *o) {
+    if (o->refcount < OBJ_FIRST_SPECIAL_REFCOUNT) {
+        o->refcount++;
+    } else {
+        if (o->refcount == OBJ_SHARED_REFCOUNT) {
+            /* Nothing to do: this refcount is immutable. */
+        } else if (o->refcount == OBJ_STATIC_REFCOUNT) {
+            serverPanic("You tried to retain an object allocated in the stack");
+        }
+    }
+}
+
+void decrRefCount(robj *o) {
+    if (o->refcount == 1) {
+        switch(o->type) {
+        case OBJ_STRING: freeStringObject(o); break;
+        case OBJ_LIST: freeListObject(o); break;
+        case OBJ_SET: freeSetObject(o); break;
+        case OBJ_ZSET: freeZsetObject(o); break;
+        case OBJ_HASH: freeHashObject(o); break;
+        case OBJ_MODULE: freeModuleObject(o); break;
+        case OBJ_STREAM: freeStreamObject(o); break;
+        default: serverPanic("Unknown object type"); break;
+        }
+        zfree(o);
+    } else {
+        if (o->refcount <= 0) serverPanic("decrRefCount against refcount <= 0");
+        if (o->refcount != OBJ_SHARED_REFCOUNT) o->refcount--;
+    }
+}
+
+/* This variant of decrRefCount() gets its argument as void, and is useful
+ * as free method in data structures that expect a 'void free_object(void*)'
+ * prototype for the free method. */
+void decrRefCountVoid(void *o) {
+    decrRefCount(o);
+}
+
+int checkType(client *c, robj *o, int type) {
+    /* A NULL is considered an empty key */
+    if (o && o->type != type) {
+        addReplyErrorObject(c,shared.wrongtypeerr);
+        return 1;
+    }
+    return 0;
+}
+
+int isSdsRepresentableAsLongLong(sds s, long long *llval) {
+    return string2ll(s,sdslen(s),llval) ? C_OK : C_ERR;
+}
+
+int isObjectRepresentableAsLongLong(robj *o, long long *llval) {
+    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+    if (o->encoding == OBJ_ENCODING_INT) {
+        if (llval) *llval = (long) o->ptr;
+        return C_OK;
+    } else {
+        return isSdsRepresentableAsLongLong(o->ptr,llval);
+    }
+}
+
+/* Optimize the SDS string inside the string object to require little space,
+ * in case there is more than 10% of free space at the end of the SDS
+ * string. This happens because SDS strings tend to overallocate to avoid
+ * wasting too much time in allocations when appending to the string. */
+void trimStringObjectIfNeeded(robj *o) {
+    if (o->encoding == OBJ_ENCODING_RAW &&
+        sdsavail(o->ptr) > sdslen(o->ptr)/10)
+    {
+        o->ptr = sdsRemoveFreeSpace(o->ptr);
+    }
+}
+
+/* Try to encode a string object in order to save space */
+robj *tryObjectEncoding(robj *o) {
+    long value;
+    sds s = o->ptr;
+    size_t len;
+
+    /* Make sure this is a string object, the only type we encode
+     * in this function. Other types use encoded memory efficient
+     * representations but are handled by the commands implementing
+     * the type. */
+    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+
+    /* We try some specialized encoding only for objects that are
+     * RAW or EMBSTR encoded, in other words objects that are still
+     * in represented by an actually array of chars. */
+    if (!sdsEncodedObject(o)) return o;
+
+    /* It's not safe to encode shared objects: shared objects can be shared
+     * everywhere in the "object space" of Redis and may end in places where
+     * they are not handled. We handle them only as values in the keyspace. */
+     if (o->refcount > 1) return o;
+
+    /* Check if we can represent this string as a long integer.
+     * Note that we are sure that a string larger than 20 chars is not
+     * representable as a 32 nor 64 bit integer. */
+    len = sdslen(s);
+    if (len <= 20 && string2l(s,len,&value)) {
+        /* This object is encodable as a long. Try to use a shared object.
+         * Note that we avoid using shared integers when maxmemory is used
+         * because every object needs to have a private LRU field for the LRU
+         * algorithm to work well. */
+        if ((server.maxmemory == 0 ||
+            !(server.maxmemory_policy & MAXMEMORY_FLAG_NO_SHARED_INTEGERS)) &&
+            value >= 0 &&
+            value < OBJ_SHARED_INTEGERS)
+        {
+            decrRefCount(o);
+            incrRefCount(shared.integers[value]);
+            return shared.integers[value];
+        } else {
+            if (o->encoding == OBJ_ENCODING_RAW) {
+                sdsfree(o->ptr);
+                o->encoding = OBJ_ENCODING_INT;
+                o->ptr = (void*) value;
+                return o;
+            } else if (o->encoding == OBJ_ENCODING_EMBSTR) {
+                decrRefCount(o);
+                return createStringObjectFromLongLongForValue(value);
+            }
+        }
+    }
+
+    /* If the string is small and is still RAW encoded,
+     * try the EMBSTR encoding which is more efficient.
+     * In this representation the object and the SDS string are allocated
+     * in the same chunk of memory to save space and cache misses. */
+    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT) {
+        robj *emb;
+
+        if (o->encoding == OBJ_ENCODING_EMBSTR) return o;
+        emb = createEmbeddedStringObject(s,sdslen(s));
+        decrRefCount(o);
+        return emb;
+    }
+
+    /* We can't encode the object...
+     *
+     * Do the last try, and at least optimize the SDS string inside
+     * the string object to require little space, in case there
+     * is more than 10% of free space at the end of the SDS string.
+     *
+     * We do that only for relatively large strings as this branch
+     * is only entered if the length of the string is greater than
+     * OBJ_ENCODING_EMBSTR_SIZE_LIMIT. */
+    trimStringObjectIfNeeded(o);
+
+    /* Return the original object. */
+    return o;
+}
+
+/* Get a decoded version of an encoded object (returned as a new object).
+ * If the object is already raw-encoded just increment the ref count. */
+robj *getDecodedObject(robj *o) {
+    robj *dec;
+
+    if (sdsEncodedObject(o)) {
+        incrRefCount(o);
+        return o;
+    }
+    if (o->type == OBJ_STRING && o->encoding == OBJ_ENCODING_INT) {
+        char buf[32];
+
+        ll2string(buf,32,(long)o->ptr);
+        dec = createStringObject(buf,strlen(buf));
+        return dec;
+    } else {
+        serverPanic("Unknown encoding type");
+    }
+}
+
+/* Compare two string objects via strcmp() or strcoll() depending on flags.
+ * Note that the objects may be integer-encoded. In such a case we
+ * use ll2string() to get a string representation of the numbers on the stack
+ * and compare the strings, it's much faster than calling getDecodedObject().
+ *
+ * Important note: when REDIS_COMPARE_BINARY is used a binary-safe comparison
+ * is used. */
+
+#define REDIS_COMPARE_BINARY (1<<0)
+#define REDIS_COMPARE_COLL (1<<1)
+
+int compareStringObjectsWithFlags(robj *a, robj *b, int flags) {
+    serverAssertWithInfo(NULL,a,a->type == OBJ_STRING && b->type == OBJ_STRING);
+    char bufa[128], bufb[128], *astr, *bstr;
+    size_t alen, blen, minlen;
+
+    if (a == b) return 0;
+    if (sdsEncodedObject(a)) {
+        astr = a->ptr;
+        alen = sdslen(astr);
+    } else {
+        alen = ll2string(bufa,sizeof(bufa),(long) a->ptr);
+        astr = bufa;
+    }
+    if (sdsEncodedObject(b)) {
+        bstr = b->ptr;
+        blen = sdslen(bstr);
+    } else {
+        blen = ll2string(bufb,sizeof(bufb),(long) b->ptr);
+        bstr = bufb;
+    }
+    if (flags & REDIS_COMPARE_COLL) {
+        return strcoll(astr,bstr);
+    } else {
+        int cmp;
+
+        minlen = (alen < blen) ? alen : blen;
+        cmp = memcmp(astr,bstr,minlen);
+        if (cmp == 0) return alen-blen;
+        return cmp;
+    }
+}
+
+/* Wrapper for compareStringObjectsWithFlags() using binary comparison. */
+int compareStringObjects(robj *a, robj *b) {
+    return compareStringObjectsWithFlags(a,b,REDIS_COMPARE_BINARY);
+}
+
+/* Wrapper for compareStringObjectsWithFlags() using collation. */
+int collateStringObjects(robj *a, robj *b) {
+    return compareStringObjectsWithFlags(a,b,REDIS_COMPARE_COLL);
+}
+
+/* Equal string objects return 1 if the two objects are the same from the
+ * point of view of a string comparison, otherwise 0 is returned. Note that
+ * this function is faster then checking for (compareStringObject(a,b) == 0)
+ * because it can perform some more optimization. */
+int equalStringObjects(robj *a, robj *b) {
+    if (a->encoding == OBJ_ENCODING_INT &&
+        b->encoding == OBJ_ENCODING_INT){
+        /* If both strings are integer encoded just check if the stored
+         * long is the same. */
+        return a->ptr == b->ptr;
+    } else {
+        return compareStringObjects(a,b) == 0;
+    }
+}
+
+size_t stringObjectLen(robj *o) {
+    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+    if (sdsEncodedObject(o)) {
+        return sdslen(o->ptr);
+    } else {
+        return sdigits10((long)o->ptr);
+    }
+}
+
+int getDoubleFromObject(const robj *o, double *target) {
+    double value;
+
+    if (o == NULL) {
+        value = 0;
+    } else {
+        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+        if (sdsEncodedObject(o)) {
+            if (!string2d(o->ptr, sdslen(o->ptr), &value))
+                return C_ERR;
+        } else if (o->encoding == OBJ_ENCODING_INT) {
+            value = (long)o->ptr;
+        } else {
+            serverPanic("Unknown string encoding");
+        }
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getDoubleFromObjectOrReply(client *c, robj *o, double *target, const char *msg) {
+    double value;
+    if (getDoubleFromObject(o, &value) != C_OK) {
+        if (msg != NULL) {
+            addReplyError(c,(char*)msg);
+        } else {
+            addReplyError(c,"value is not a valid float");
+        }
+        return C_ERR;
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getLongDoubleFromObject(robj *o, long double *target) {
+    long double value;
+
+    if (o == NULL) {
+        value = 0;
+    } else {
+        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+        if (sdsEncodedObject(o)) {
+            if (!string2ld(o->ptr, sdslen(o->ptr), &value))
+                return C_ERR;
+        } else if (o->encoding == OBJ_ENCODING_INT) {
+            value = (long)o->ptr;
+        } else {
+            serverPanic("Unknown string encoding");
+        }
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getLongDoubleFromObjectOrReply(client *c, robj *o, long double *target, const char *msg) {
+    long double value;
+    if (getLongDoubleFromObject(o, &value) != C_OK) {
+        if (msg != NULL) {
+            addReplyError(c,(char*)msg);
+        } else {
+            addReplyError(c,"value is not a valid float");
+        }
+        return C_ERR;
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getLongLongFromObject(robj *o, long long *target) {
+    long long value;
+
+    if (o == NULL) {
+        value = 0;
+    } else {
+        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
+        if (sdsEncodedObject(o)) {
+            if (string2ll(o->ptr,sdslen(o->ptr),&value) == 0) return C_ERR;
+        } else if (o->encoding == OBJ_ENCODING_INT) {
+            value = (long)o->ptr;
+        } else {
+            serverPanic("Unknown string encoding");
+        }
+    }
+    if (target) *target = value;
+    return C_OK;
+}
+
+int getLongLongFromObjectOrReply(client *c, robj *o, long long *target, const char *msg) {
+    long long value;
+    if (getLongLongFromObject(o, &value) != C_OK) {
+        if (msg != NULL) {
+            addReplyError(c,(char*)msg);
+        } else {
+            addReplyError(c,"value is not an integer or out of range");
+        }
+        return C_ERR;
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg) {
+    long long value;
+
+    if (getLongLongFromObjectOrReply(c, o, &value, msg) != C_OK) return C_ERR;
+    if (value < LONG_MIN || value > LONG_MAX) {
+        if (msg != NULL) {
+            addReplyError(c,(char*)msg);
+        } else {
+            addReplyError(c,"value is out of range");
+        }
+        return C_ERR;
+    }
+    *target = value;
+    return C_OK;
+}
+
+int getRangeLongFromObjectOrReply(client *c, robj *o, long min, long max, long *target, const char *msg) {
+    if (getLongFromObjectOrReply(c, o, target, msg) != C_OK) return C_ERR;
+    if (*target < min || *target > max) {
+        if (msg != NULL) {
+            addReplyError(c,(char*)msg);
+        } else {
+            addReplyErrorFormat(c,"value is out of range, value must between %ld and %ld", min, max);
+        }
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+int getPositiveLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg) {
+    if (msg) {
+        return getRangeLongFromObjectOrReply(c, o, 0, LONG_MAX, target, msg);
+    } else {
+        return getRangeLongFromObjectOrReply(c, o, 0, LONG_MAX, target, "value is out of range, must be positive");
+    }
+}
+
+int getIntFromObjectOrReply(client *c, robj *o, int *target, const char *msg) {
+    long value;
+
+    if (getRangeLongFromObjectOrReply(c, o, INT_MIN, INT_MAX, &value, msg) != C_OK)
+        return C_ERR;
+
+    *target = value;
+    return C_OK;
+}
+
+char *strEncoding(int encoding) {
+    switch(encoding) {
+    case OBJ_ENCODING_RAW: return "raw";
+    case OBJ_ENCODING_INT: return "int";
+    case OBJ_ENCODING_HT: return "hashtable";
+    case OBJ_ENCODING_QUICKLIST: return "quicklist";
+    case OBJ_ENCODING_ZIPLIST: return "ziplist";
+    case OBJ_ENCODING_INTSET: return "intset";
+    case OBJ_ENCODING_SKIPLIST: return "skiplist";
+    case OBJ_ENCODING_EMBSTR: return "embstr";
+    case OBJ_ENCODING_STREAM: return "stream";
+    default: return "unknown";
+    }
+}
+
+/* =========================== Memory introspection ========================= */
+
+
+/* This is an helper function with the goal of estimating the memory
+ * size of a radix tree that is used to store Stream IDs.
+ *
+ * Note: to guess the size of the radix tree is not trivial, so we
+ * approximate it considering 16 bytes of data overhead for each
+ * key (the ID), and then adding the number of bare nodes, plus some
+ * overhead due by the data and child pointers. This secret recipe
+ * was obtained by checking the average radix tree created by real
+ * workloads, and then adjusting the constants to get numbers that
+ * more or less match the real memory usage.
+ *
+ * Actually the number of nodes and keys may be different depending
+ * on the insertion speed and thus the ability of the radix tree
+ * to compress prefixes. */
+size_t streamRadixTreeMemoryUsage(rax *rax) {
+    size_t size;
+    size = rax->numele * sizeof(streamID);
+    size += rax->numnodes * sizeof(raxNode);
+    /* Add a fixed overhead due to the aux data pointer, children, ... */
+    size += rax->numnodes * sizeof(long)*30;
+    return size;
+}
+
+/* Returns the size in bytes consumed by the key's value in RAM.
+ * Note that the returned value is just an approximation, especially in the
+ * case of aggregated data types where only "sample_size" elements
+ * are checked and averaged to estimate the total size. */
+#define OBJ_COMPUTE_SIZE_DEF_SAMPLES 5 /* Default sample size. */
+size_t objectComputeSize(robj *o, size_t sample_size) {
+    sds ele, ele2;
+    dict *d;
+    dictIterator *di;
+    struct dictEntry *de;
+    size_t asize = 0, elesize = 0, samples = 0;
+
+    if (o->type == OBJ_STRING) {
+        if(o->encoding == OBJ_ENCODING_INT) {
+            asize = sizeof(*o);
+        } else if(o->encoding == OBJ_ENCODING_RAW) {
+            asize = sdsZmallocSize(o->ptr)+sizeof(*o);
+        } else if(o->encoding == OBJ_ENCODING_EMBSTR) {
+            asize = sdslen(o->ptr)+2+sizeof(*o);
+        } else {
+            serverPanic("Unknown string encoding");
+        }
+    } else if (o->type == OBJ_LIST) {
+        if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+            quicklist *ql = o->ptr;
+            quicklistNode *node = ql->head;
+            asize = sizeof(*o)+sizeof(quicklist);
+            do {
+                elesize += sizeof(quicklistNode)+ziplistBlobLen(node->zl);
+                samples++;
+            } while ((node = node->next) && samples < sample_size);
+            asize += (double)elesize/samples*ql->len;
+        } else if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            asize = sizeof(*o)+ziplistBlobLen(o->ptr);
+        } else {
+            serverPanic("Unknown list encoding");
+        }
+    } else if (o->type == OBJ_SET) {
+        if (o->encoding == OBJ_ENCODING_HT) {
+            d = o->ptr;
+            di = dictGetIterator(d);
+            asize = sizeof(*o)+sizeof(dict)+(sizeof(struct dictEntry*)*dictSlots(d));
+            while((de = dictNext(di)) != NULL && samples < sample_size) {
+                ele = dictGetKey(de);
+                elesize += sizeof(struct dictEntry) + sdsZmallocSize(ele);
+                samples++;
+            }
+            dictReleaseIterator(di);
+            if (samples) asize += (double)elesize/samples*dictSize(d);
+        } else if (o->encoding == OBJ_ENCODING_INTSET) {
+            intset *is = o->ptr;
+            asize = sizeof(*o)+sizeof(*is)+(size_t)is->encoding*is->length;
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (o->type == OBJ_ZSET) {
+        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            asize = sizeof(*o)+(ziplistBlobLen(o->ptr));
+        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
+            d = ((zset*)o->ptr)->dict;
+            zskiplist *zsl = ((zset*)o->ptr)->zsl;
+            zskiplistNode *znode = zsl->header->level[0].forward;
+            asize = sizeof(*o)+sizeof(zset)+sizeof(zskiplist)+sizeof(dict)+
+                    (sizeof(struct dictEntry*)*dictSlots(d))+
+                    zmalloc_size(zsl->header);
+            while(znode != NULL && samples < sample_size) {
+                elesize += sdsZmallocSize(znode->ele);
+                elesize += sizeof(struct dictEntry) + zmalloc_size(znode);
+                samples++;
+                znode = znode->level[0].forward;
+            }
+            if (samples) asize += (double)elesize/samples*dictSize(d);
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else if (o->type == OBJ_HASH) {
+        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            asize = sizeof(*o)+(ziplistBlobLen(o->ptr));
+        } else if (o->encoding == OBJ_ENCODING_HT) {
+            d = o->ptr;
+            di = dictGetIterator(d);
+            asize = sizeof(*o)+sizeof(dict)+(sizeof(struct dictEntry*)*dictSlots(d));
+            while((de = dictNext(di)) != NULL && samples < sample_size) {
+                ele = dictGetKey(de);
+                ele2 = dictGetVal(de);
+                elesize += sdsZmallocSize(ele) + sdsZmallocSize(ele2);
+                elesize += sizeof(struct dictEntry);
+                samples++;
+            }
+            dictReleaseIterator(di);
+            if (samples) asize += (double)elesize/samples*dictSize(d);
+        } else {
+            serverPanic("Unknown hash encoding");
+        }
+    } else if (o->type == OBJ_STREAM) {
+        stream *s = o->ptr;
+        asize = sizeof(*o)+sizeof(*s);
+        asize += streamRadixTreeMemoryUsage(s->rax);
+
+        /* Now we have to add the listpacks. The last listpack is often non
+         * complete, so we estimate the size of the first N listpacks, and
+         * use the average to compute the size of the first N-1 listpacks, and
+         * finally add the real size of the last node. */
+        raxIterator ri;
+        raxStart(&ri,s->rax);
+        raxSeek(&ri,"^",NULL,0);
+        size_t lpsize = 0, samples = 0;
+        while(samples < sample_size && raxNext(&ri)) {
+            unsigned char *lp = ri.data;
+            lpsize += lpBytes(lp);
+            samples++;
+        }
+        if (s->rax->numele <= samples) {
+            asize += lpsize;
+        } else {
+            if (samples) lpsize /= samples; /* Compute the average. */
+            asize += lpsize * (s->rax->numele-1);
+            /* No need to check if seek succeeded, we enter this branch only
+             * if there are a few elements in the radix tree. */
+            raxSeek(&ri,"$",NULL,0);
+            raxNext(&ri);
+            asize += lpBytes(ri.data);
+        }
+        raxStop(&ri);
+
+        /* Consumer groups also have a non trivial memory overhead if there
+         * are many consumers and many groups, let's count at least the
+         * overhead of the pending entries in the groups and consumers
+         * PELs. */
+        if (s->cgroups) {
+            raxStart(&ri,s->cgroups);
+            raxSeek(&ri,"^",NULL,0);
+            while(raxNext(&ri)) {
+                streamCG *cg = ri.data;
+                asize += sizeof(*cg);
+                asize += streamRadixTreeMemoryUsage(cg->pel);
+                asize += sizeof(streamNACK)*raxSize(cg->pel);
+
+                /* For each consumer we also need to add the basic data
+                 * structures and the PEL memory usage. */
+                raxIterator cri;
+                raxStart(&cri,cg->consumers);
+                raxSeek(&cri,"^",NULL,0);
+                while(raxNext(&cri)) {
+                    streamConsumer *consumer = cri.data;
+                    asize += sizeof(*consumer);
+                    asize += sdslen(consumer->name);
+                    asize += streamRadixTreeMemoryUsage(consumer->pel);
+                    /* Don't count NACKs again, they are shared with the
+                     * consumer group PEL. */
+                }
+                raxStop(&cri);
+            }
+            raxStop(&ri);
+        }
+    } else if (o->type == OBJ_MODULE) {
+        moduleValue *mv = o->ptr;
+        moduleType *mt = mv->type;
+        if (mt->mem_usage != NULL) {
+            asize = mt->mem_usage(mv->value);
+        } else {
+            asize = 0;
+        }
+    } else {
+        serverPanic("Unknown object type");
+    }
+    return asize;
+}
+
+/* Release data obtained with getMemoryOverheadData(). */
+void freeMemoryOverheadData(struct redisMemOverhead *mh) {
+    zfree(mh->db);
+    zfree(mh);
+}
+
+/* Return a struct redisMemOverhead filled with memory overhead
+ * information used for the MEMORY OVERHEAD and INFO command. The returned
+ * structure pointer should be freed calling freeMemoryOverheadData(). */
+struct redisMemOverhead *getMemoryOverheadData(void) {
+    int j;
+    size_t mem_total = 0;
+    size_t mem = 0;
+    size_t zmalloc_used = zmalloc_used_memory();
+    struct redisMemOverhead *mh = zcalloc(sizeof(*mh));
+
+    mh->total_allocated = zmalloc_used;
+    mh->startup_allocated = server.initial_memory_usage;
+    mh->peak_allocated = server.stat_peak_memory;
+    mh->total_frag =
+        (float)server.cron_malloc_stats.process_rss / server.cron_malloc_stats.zmalloc_used;
+    mh->total_frag_bytes =
+        server.cron_malloc_stats.process_rss - server.cron_malloc_stats.zmalloc_used;
+    mh->allocator_frag =
+        (float)server.cron_malloc_stats.allocator_active / server.cron_malloc_stats.allocator_allocated;
+    mh->allocator_frag_bytes =
+        server.cron_malloc_stats.allocator_active - server.cron_malloc_stats.allocator_allocated;
+    mh->allocator_rss =
+        (float)server.cron_malloc_stats.allocator_resident / server.cron_malloc_stats.allocator_active;
+    mh->allocator_rss_bytes =
+        server.cron_malloc_stats.allocator_resident - server.cron_malloc_stats.allocator_active;
+    mh->rss_extra =
+        (float)server.cron_malloc_stats.process_rss / server.cron_malloc_stats.allocator_resident;
+    mh->rss_extra_bytes =
+        server.cron_malloc_stats.process_rss - server.cron_malloc_stats.allocator_resident;
+
+    mem_total += server.initial_memory_usage;
+
+    mem = 0;
+    if (server.repl_backlog)
+        mem += zmalloc_size(server.repl_backlog);
+    mh->repl_backlog = mem;
+    mem_total += mem;
+
+    /* Computing the memory used by the clients would be O(N) if done
+     * here online. We use our values computed incrementally by
+     * clientsCronTrackClientsMemUsage(). */
+    mh->clients_slaves = server.stat_clients_type_memory[CLIENT_TYPE_SLAVE];
+    mh->clients_normal = server.stat_clients_type_memory[CLIENT_TYPE_MASTER]+
+                         server.stat_clients_type_memory[CLIENT_TYPE_PUBSUB]+
+                         server.stat_clients_type_memory[CLIENT_TYPE_NORMAL];
+    mem_total += mh->clients_slaves;
+    mem_total += mh->clients_normal;
+
+    mem = 0;
+    if (server.aof_state != AOF_OFF) {
+        mem += sdsZmallocSize(server.aof_buf);
+        mem += aofRewriteBufferSize();
+    }
+    mh->aof_buffer = mem;
+    mem_total+=mem;
+
+    mem = server.lua_scripts_mem;
+    mem += dictSize(server.lua_scripts) * sizeof(dictEntry) +
+        dictSlots(server.lua_scripts) * sizeof(dictEntry*);
+    mem += dictSize(server.repl_scriptcache_dict) * sizeof(dictEntry) +
+        dictSlots(server.repl_scriptcache_dict) * sizeof(dictEntry*);
+    if (listLength(server.repl_scriptcache_fifo) > 0) {
+        mem += listLength(server.repl_scriptcache_fifo) * (sizeof(listNode) +
+            sdsZmallocSize(listNodeValue(listFirst(server.repl_scriptcache_fifo))));
+    }
+    mh->lua_caches = mem;
+    mem_total+=mem;
+
+    for (j = 0; j < server.dbnum; j++) {
+        redisDb *db = server.db+j;
+        long long keyscount = dictSize(db->dict);
+        if (keyscount==0) continue;
+
+        mh->total_keys += keyscount;
+        mh->db = zrealloc(mh->db,sizeof(mh->db[0])*(mh->num_dbs+1));
+        mh->db[mh->num_dbs].dbid = j;
+
+        mem = dictSize(db->dict) * sizeof(dictEntry) +
+              dictSlots(db->dict) * sizeof(dictEntry*) +
+              dictSize(db->dict) * sizeof(robj);
+        mh->db[mh->num_dbs].overhead_ht_main = mem;
+        mem_total+=mem;
+
+        mem = dictSize(db->expires) * sizeof(dictEntry) +
+              dictSlots(db->expires) * sizeof(dictEntry*);
+        mh->db[mh->num_dbs].overhead_ht_expires = mem;
+        mem_total+=mem;
+
+        mh->num_dbs++;
+    }
+
+    mh->overhead_total = mem_total;
+    mh->dataset = zmalloc_used - mem_total;
+    mh->peak_perc = (float)zmalloc_used*100/mh->peak_allocated;
+
+    /* Metrics computed after subtracting the startup memory from
+     * the total memory. */
+    size_t net_usage = 1;
+    if (zmalloc_used > mh->startup_allocated)
+        net_usage = zmalloc_used - mh->startup_allocated;
+    mh->dataset_perc = (float)mh->dataset*100/net_usage;
+    mh->bytes_per_key = mh->total_keys ? (net_usage / mh->total_keys) : 0;
+
+    return mh;
+}
+
+/* Helper for "MEMORY allocator-stats", used as a callback for the jemalloc
+ * stats output. */
+void inputCatSds(void *result, const char *str) {
+    /* result is actually a (sds *), so re-cast it here */
+    sds *info = (sds *)result;
+    *info = sdscat(*info, str);
+}
+
+/* This implements MEMORY DOCTOR. An human readable analysis of the Redis
+ * memory condition. */
+sds getMemoryDoctorReport(void) {
+    int empty = 0;          /* Instance is empty or almost empty. */
+    int big_peak = 0;       /* Memory peak is much larger than used mem. */
+    int high_frag = 0;      /* High fragmentation. */
+    int high_alloc_frag = 0;/* High allocator fragmentation. */
+    int high_proc_rss = 0;  /* High process rss overhead. */
+    int high_alloc_rss = 0; /* High rss overhead. */
+    int big_slave_buf = 0;  /* Slave buffers are too big. */
+    int big_client_buf = 0; /* Client buffers are too big. */
+    int many_scripts = 0;   /* Script cache has too many scripts. */
+    int num_reports = 0;
+    struct redisMemOverhead *mh = getMemoryOverheadData();
+
+    if (mh->total_allocated < (1024*1024*5)) {
+        empty = 1;
+        num_reports++;
+    } else {
+        /* Peak is > 150% of current used memory? */
+        if (((float)mh->peak_allocated / mh->total_allocated) > 1.5) {
+            big_peak = 1;
+            num_reports++;
+        }
+
+        /* Fragmentation is higher than 1.4 and 10MB ?*/
+        if (mh->total_frag > 1.4 && mh->total_frag_bytes > 10<<20) {
+            high_frag = 1;
+            num_reports++;
+        }
+
+        /* External fragmentation is higher than 1.1 and 10MB? */
+        if (mh->allocator_frag > 1.1 && mh->allocator_frag_bytes > 10<<20) {
+            high_alloc_frag = 1;
+            num_reports++;
+        }
+
+        /* Allocator rss is higher than 1.1 and 10MB ? */
+        if (mh->allocator_rss > 1.1 && mh->allocator_rss_bytes > 10<<20) {
+            high_alloc_rss = 1;
+            num_reports++;
+        }
+
+        /* Non-Allocator rss is higher than 1.1 and 10MB ? */
+        if (mh->rss_extra > 1.1 && mh->rss_extra_bytes > 10<<20) {
+            high_proc_rss = 1;
+            num_reports++;
+        }
+
+        /* Clients using more than 200k each average? */
+        long numslaves = listLength(server.slaves);
+        long numclients = listLength(server.clients)-numslaves;
+        if (mh->clients_normal / numclients > (1024*200)) {
+            big_client_buf = 1;
+            num_reports++;
+        }
+
+        /* Slaves using more than 10 MB each? */
+        if (numslaves > 0 && mh->clients_slaves / numslaves > (1024*1024*10)) {
+            big_slave_buf = 1;
+            num_reports++;
+        }
+
+        /* Too many scripts are cached? */
+        if (dictSize(server.lua_scripts) > 1000) {
+            many_scripts = 1;
+            num_reports++;
+        }
+    }
+
+    sds s;
+    if (num_reports == 0) {
+        s = sdsnew(
+        "Hi Sam, I can't find any memory issue in your instance. "
+        "I can only account for what occurs on this base.\n");
+    } else if (empty == 1) {
+        s = sdsnew(
+        "Hi Sam, this instance is empty or is using very little memory, "
+        "my issues detector can't be used in these conditions. "
+        "Please, leave for your mission on Earth and fill it with some data. "
+        "The new Sam and I will be back to our programming as soon as I "
+        "finished rebooting.\n");
+    } else {
+        s = sdsnew("Sam, I detected a few issues in this Redis instance memory implants:\n\n");
+        if (big_peak) {
+            s = sdscat(s," * Peak memory: In the past this instance used more than 150% the memory that is currently using. The allocator is normally not able to release memory after a peak, so you can expect to see a big fragmentation ratio, however this is actually harmless and is only due to the memory peak, and if the Redis instance Resident Set Size (RSS) is currently bigger than expected, the memory will be used as soon as you fill the Redis instance with more data. If the memory peak was only occasional and you want to try to reclaim memory, please try the MEMORY PURGE command, otherwise the only other option is to shutdown and restart the instance.\n\n");
+        }
+        if (high_frag) {
+            s = sdscatprintf(s," * High total RSS: This instance has a memory fragmentation and RSS overhead greater than 1.4 (this means that the Resident Set Size of the Redis process is much larger than the sum of the logical allocations Redis performed). This problem is usually due either to a large peak memory (check if there is a peak memory entry above in the report) or may result from a workload that causes the allocator to fragment memory a lot. If the problem is a large peak memory, then there is no issue. Otherwise, make sure you are using the Jemalloc allocator and not the default libc malloc. Note: The currently used allocator is \"%s\".\n\n", ZMALLOC_LIB);
+        }
+        if (high_alloc_frag) {
+            s = sdscatprintf(s," * High allocator fragmentation: This instance has an allocator external fragmentation greater than 1.1. This problem is usually due either to a large peak memory (check if there is a peak memory entry above in the report) or may result from a workload that causes the allocator to fragment memory a lot. You can try enabling 'activedefrag' config option.\n\n");
+        }
+        if (high_alloc_rss) {
+            s = sdscatprintf(s," * High allocator RSS overhead: This instance has an RSS memory overhead is greater than 1.1 (this means that the Resident Set Size of the allocator is much larger than the sum what the allocator actually holds). This problem is usually due to a large peak memory (check if there is a peak memory entry above in the report), you can try the MEMORY PURGE command to reclaim it.\n\n");
+        }
+        if (high_proc_rss) {
+            s = sdscatprintf(s," * High process RSS overhead: This instance has non-allocator RSS memory overhead is greater than 1.1 (this means that the Resident Set Size of the Redis process is much larger than the RSS the allocator holds). This problem may be due to Lua scripts or Modules.\n\n");
+        }
+        if (big_slave_buf) {
+            s = sdscat(s," * Big replica buffers: The replica output buffers in this instance are greater than 10MB for each replica (on average). This likely means that there is some replica instance that is struggling receiving data, either because it is too slow or because of networking issues. As a result, data piles on the master output buffers. Please try to identify what replica is not receiving data correctly and why. You can use the INFO output in order to check the replicas delays and the CLIENT LIST command to check the output buffers of each replica.\n\n");
+        }
+        if (big_client_buf) {
+            s = sdscat(s," * Big client buffers: The clients output buffers in this instance are greater than 200K per client (on average). This may result from different causes, like Pub/Sub clients subscribed to channels bot not receiving data fast enough, so that data piles on the Redis instance output buffer, or clients sending commands with large replies or very large sequences of commands in the same pipeline. Please use the CLIENT LIST command in order to investigate the issue if it causes problems in your instance, or to understand better why certain clients are using a big amount of memory.\n\n");
+        }
+        if (many_scripts) {
+            s = sdscat(s," * Many scripts: There seem to be many cached scripts in this instance (more than 1000). This may be because scripts are generated and `EVAL`ed, instead of being parameterized (with KEYS and ARGV), `SCRIPT LOAD`ed and `EVALSHA`ed. Unless `SCRIPT FLUSH` is called periodically, the scripts' caches may end up consuming most of your memory.\n\n");
+        }
+        s = sdscat(s,"I'm here to keep you safe, Sam. I want to help you.\n");
+    }
+    freeMemoryOverheadData(mh);
+    return s;
+}
+
+/* Set the object LRU/LFU depending on server.maxmemory_policy.
+ * The lfu_freq arg is only relevant if policy is MAXMEMORY_FLAG_LFU.
+ * The lru_idle and lru_clock args are only relevant if policy
+ * is MAXMEMORY_FLAG_LRU.
+ * Either or both of them may be <0, in that case, nothing is set. */
+int objectSetLRUOrLFU(robj *val, long long lfu_freq, long long lru_idle,
+                       long long lru_clock, int lru_multiplier) {
+    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+        if (lfu_freq >= 0) {
+            serverAssert(lfu_freq <= 255);
+            val->lru = (LFUGetTimeInMinutes()<<8) | lfu_freq;
+            return 1;
+        }
+    } else if (lru_idle >= 0) {
+        /* Provided LRU idle time is in seconds. Scale
+         * according to the LRU clock resolution this Redis
+         * instance was compiled with (normally 1000 ms, so the
+         * below statement will expand to lru_idle*1000/1000. */
+        lru_idle = lru_idle*lru_multiplier/LRU_CLOCK_RESOLUTION;
+        long lru_abs = lru_clock - lru_idle; /* Absolute access time. */
+        /* If the LRU field underflows (since LRU it is a wrapping
+         * clock), the best we can do is to provide a large enough LRU
+         * that is half-way in the circlular LRU clock we use: this way
+         * the computed idle time for this object will stay high for quite
+         * some time. */
+        if (lru_abs < 0)
+            lru_abs = (lru_clock+(LRU_CLOCK_MAX/2)) % LRU_CLOCK_MAX;
+        val->lru = lru_abs;
+        return 1;
+    }
+    return 0;
+}
+
+/* ======================= The OBJECT and MEMORY commands =================== */
+
+/* This is a helper function for the OBJECT command. We need to lookup keys
+ * without any modification of LRU or other parameters. */
+robj *objectCommandLookup(client *c, robj *key) {
+    return lookupKeyReadWithFlags(c->db,key,LOOKUP_NOTOUCH|LOOKUP_NONOTIFY);
+}
+
+robj *objectCommandLookupOrReply(client *c, robj *key, robj *reply) {
+    robj *o = objectCommandLookup(c,key);
+    if (!o) SentReplyOnKeyMiss(c, reply);
+    return o;
+}
+
+/* Object command allows to inspect the internals of a Redis Object.
+ * Usage: OBJECT <refcount|encoding|idletime|freq> <key> */
+void objectCommand(client *c) {
+    robj *o;
+
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"ENCODING <key>",
+"    Return the kind of internal representation used in order to store the value",
+"    associated with a <key>.",
+"FREQ <key>",
+"    Return the access frequency index of the <key>. The returned integer is",
+"    proportional to the logarithm of the recent access frequency of the key.",
+"IDLETIME <key>",
+"    Return the idle time of the <key>, that is the approximated number of",
+"    seconds elapsed since the last access to the key.",
+"REFCOUNT <key>",
+"    Return the number of references of the value associated with the specified",
+"    <key>.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"refcount") && c->argc == 3) {
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
+                == NULL) return;
+        addReplyLongLong(c,o->refcount);
+    } else if (!strcasecmp(c->argv[1]->ptr,"encoding") && c->argc == 3) {
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
+                == NULL) return;
+        addReplyBulkCString(c,strEncoding(o->encoding));
+    } else if (!strcasecmp(c->argv[1]->ptr,"idletime") && c->argc == 3) {
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
+                == NULL) return;
+        if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
+            addReplyError(c,"An LFU maxmemory policy is selected, idle time not tracked. Please note that when switching between policies at runtime LRU and LFU data will take some time to adjust.");
+            return;
+        }
+        addReplyLongLong(c,estimateObjectIdleTime(o)/1000);
+    } else if (!strcasecmp(c->argv[1]->ptr,"freq") && c->argc == 3) {
+        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
+                == NULL) return;
+        if (!(server.maxmemory_policy & MAXMEMORY_FLAG_LFU)) {
+            addReplyError(c,"An LFU maxmemory policy is not selected, access frequency not tracked. Please note that when switching between policies at runtime LRU and LFU data will take some time to adjust.");
+            return;
+        }
+        /* LFUDecrAndReturn should be called
+         * in case of the key has not been accessed for a long time,
+         * because we update the access time only
+         * when the key is read or overwritten. */
+        addReplyLongLong(c,LFUDecrAndReturn(o));
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* The memory command will eventually be a complete interface for the
+ * memory introspection capabilities of Redis.
+ *
+ * Usage: MEMORY usage <key> */
+void memoryCommand(client *c) {
+    if (!strcasecmp(c->argv[1]->ptr,"help") && c->argc == 2) {
+        const char *help[] = {
+"DOCTOR",
+"    Return memory problems reports.",
+"MALLOC-STATS"
+"    Return internal statistics report from the memory allocator.",
+"PURGE",
+"    Attempt to purge dirty pages for reclamation by the allocator.",
+"STATS",
+"    Return information about the memory usage of the server.",
+"USAGE <key> [SAMPLES <count>]",
+"    Return memory in bytes used by <key> and its value. Nested values are",
+"    sampled up to <count> times (default: 5).",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"usage") && c->argc >= 3) {
+        dictEntry *de;
+        long long samples = OBJ_COMPUTE_SIZE_DEF_SAMPLES;
+        for (int j = 3; j < c->argc; j++) {
+            if (!strcasecmp(c->argv[j]->ptr,"samples") &&
+                j+1 < c->argc)
+            {
+                if (getLongLongFromObjectOrReply(c,c->argv[j+1],&samples,NULL)
+                     == C_ERR) return;
+                if (samples < 0) {
+                    addReplyErrorObject(c,shared.syntaxerr);
+                    return;
+                }
+                if (samples == 0) samples = LLONG_MAX;
+                j++; /* skip option argument. */
+            } else {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
+            addReplyNull(c);
+            return;
+        }
+        size_t usage = objectComputeSize(dictGetVal(de),samples);
+        usage += sdsZmallocSize(dictGetKey(de));
+        usage += sizeof(dictEntry);
+        addReplyLongLong(c,usage);
+    } else if (!strcasecmp(c->argv[1]->ptr,"stats") && c->argc == 2) {
+        struct redisMemOverhead *mh = getMemoryOverheadData();
+
+        addReplyMapLen(c,25+mh->num_dbs);
+
+        addReplyBulkCString(c,"peak.allocated");
+        addReplyLongLong(c,mh->peak_allocated);
+
+        addReplyBulkCString(c,"total.allocated");
+        addReplyLongLong(c,mh->total_allocated);
+
+        addReplyBulkCString(c,"startup.allocated");
+        addReplyLongLong(c,mh->startup_allocated);
+
+        addReplyBulkCString(c,"replication.backlog");
+        addReplyLongLong(c,mh->repl_backlog);
+
+        addReplyBulkCString(c,"clients.slaves");
+        addReplyLongLong(c,mh->clients_slaves);
+
+        addReplyBulkCString(c,"clients.normal");
+        addReplyLongLong(c,mh->clients_normal);
+
+        addReplyBulkCString(c,"aof.buffer");
+        addReplyLongLong(c,mh->aof_buffer);
+
+        addReplyBulkCString(c,"lua.caches");
+        addReplyLongLong(c,mh->lua_caches);
+
+        for (size_t j = 0; j < mh->num_dbs; j++) {
+            char dbname[32];
+            snprintf(dbname,sizeof(dbname),"db.%zd",mh->db[j].dbid);
+            addReplyBulkCString(c,dbname);
+            addReplyMapLen(c,2);
+
+            addReplyBulkCString(c,"overhead.hashtable.main");
+            addReplyLongLong(c,mh->db[j].overhead_ht_main);
+
+            addReplyBulkCString(c,"overhead.hashtable.expires");
+            addReplyLongLong(c,mh->db[j].overhead_ht_expires);
+        }
+
+        addReplyBulkCString(c,"overhead.total");
+        addReplyLongLong(c,mh->overhead_total);
+
+        addReplyBulkCString(c,"keys.count");
+        addReplyLongLong(c,mh->total_keys);
+
+        addReplyBulkCString(c,"keys.bytes-per-key");
+        addReplyLongLong(c,mh->bytes_per_key);
+
+        addReplyBulkCString(c,"dataset.bytes");
+        addReplyLongLong(c,mh->dataset);
+
+        addReplyBulkCString(c,"dataset.percentage");
+        addReplyDouble(c,mh->dataset_perc);
+
+        addReplyBulkCString(c,"peak.percentage");
+        addReplyDouble(c,mh->peak_perc);
+
+        addReplyBulkCString(c,"allocator.allocated");
+        addReplyLongLong(c,server.cron_malloc_stats.allocator_allocated);
+
+        addReplyBulkCString(c,"allocator.active");
+        addReplyLongLong(c,server.cron_malloc_stats.allocator_active);
+
+        addReplyBulkCString(c,"allocator.resident");
+        addReplyLongLong(c,server.cron_malloc_stats.allocator_resident);
+
+        addReplyBulkCString(c,"allocator-fragmentation.ratio");
+        addReplyDouble(c,mh->allocator_frag);
+
+        addReplyBulkCString(c,"allocator-fragmentation.bytes");
+        addReplyLongLong(c,mh->allocator_frag_bytes);
+
+        addReplyBulkCString(c,"allocator-rss.ratio");
+        addReplyDouble(c,mh->allocator_rss);
+
+        addReplyBulkCString(c,"allocator-rss.bytes");
+        addReplyLongLong(c,mh->allocator_rss_bytes);
+
+        addReplyBulkCString(c,"rss-overhead.ratio");
+        addReplyDouble(c,mh->rss_extra);
+
+        addReplyBulkCString(c,"rss-overhead.bytes");
+        addReplyLongLong(c,mh->rss_extra_bytes);
+
+        addReplyBulkCString(c,"fragmentation"); /* this is the total RSS overhead, including fragmentation */
+        addReplyDouble(c,mh->total_frag); /* it is kept here for backwards compatibility */
+
+        addReplyBulkCString(c,"fragmentation.bytes");
+        addReplyLongLong(c,mh->total_frag_bytes);
+
+        freeMemoryOverheadData(mh);
+    } else if (!strcasecmp(c->argv[1]->ptr,"malloc-stats") && c->argc == 2) {
+#if defined(USE_JEMALLOC)
+        sds info = sdsempty();
+        je_malloc_stats_print(inputCatSds, &info, NULL);
+        addReplyVerbatim(c,info,sdslen(info),"txt");
+        sdsfree(info);
+#else
+        addReplyBulkCString(c,"Stats not supported for the current allocator");
+#endif
+    } else if (!strcasecmp(c->argv[1]->ptr,"doctor") && c->argc == 2) {
+        sds report = getMemoryDoctorReport();
+        addReplyVerbatim(c,report,sdslen(report),"txt");
+        sdsfree(report);
+    } else if (!strcasecmp(c->argv[1]->ptr,"purge") && c->argc == 2) {
+        if (jemalloc_purge() == 0)
+            addReply(c, shared.ok);
+        else
+            addReplyError(c, "Error purging dirty pages");
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
diff --git a/redis-stable/src/pqsort.c b/redis-stable/src/pqsort.c
new file mode 100644
index 00000000..508c09f9
--- /dev/null
+++ b/redis-stable/src/pqsort.c
@@ -0,0 +1,185 @@
+/* The following is the NetBSD libc qsort implementation modified in order to
+ * support partial sorting of ranges for Redis.
+ *
+ * Copyright(C) 2009-2012 Salvatore Sanfilippo. All rights reserved.
+ *
+ * The original copyright notice follows. */
+
+
+/*	$NetBSD: qsort.c,v 1.19 2009/01/30 23:38:44 lukem Exp $	*/
+
+/*-
+ * Copyright (c) 1992, 1993
+ *	The Regents of the University of California.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+#include <sys/types.h>
+
+#include <errno.h>
+#include <stdlib.h>
+
+static inline char	*med3 (char *, char *, char *,
+    int (*)(const void *, const void *));
+static inline void	 swapfunc (char *, char *, size_t, int);
+
+#define min(a, b)	(a) < (b) ? a : b
+
+/*
+ * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
+ */
+#define swapcode(TYPE, parmi, parmj, n) { 		\
+	size_t i = (n) / sizeof (TYPE); 		\
+	TYPE *pi = (TYPE *)(void *)(parmi); 		\
+	TYPE *pj = (TYPE *)(void *)(parmj); 		\
+	do { 						\
+		TYPE	t = *pi;			\
+		*pi++ = *pj;				\
+		*pj++ = t;				\
+        } while (--i > 0);				\
+}
+
+#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
+	es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
+
+static inline void
+swapfunc(char *a, char *b, size_t n, int swaptype)
+{
+
+	if (swaptype <= 1)
+		swapcode(long, a, b, n)
+	else
+		swapcode(char, a, b, n)
+}
+
+#define swap(a, b)						\
+	if (swaptype == 0) {					\
+		long t = *(long *)(void *)(a);			\
+		*(long *)(void *)(a) = *(long *)(void *)(b);	\
+		*(long *)(void *)(b) = t;			\
+	} else							\
+		swapfunc(a, b, es, swaptype)
+
+#define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype)
+
+static inline char *
+med3(char *a, char *b, char *c,
+    int (*cmp) (const void *, const void *))
+{
+
+	return cmp(a, b) < 0 ?
+	       (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
+              :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
+}
+
+static void
+_pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), void *lrange, void *rrange)
+{
+	char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
+	size_t d, r;
+	int swaptype, cmp_result;
+
+loop:	SWAPINIT(a, es);
+	if (n < 7) {
+		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
+			for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
+			     pl -= es)
+				swap(pl, pl - es);
+		return;
+	}
+	pm = (char *) a + (n / 2) * es;
+	if (n > 7) {
+		pl = (char *) a;
+		pn = (char *) a + (n - 1) * es;
+		if (n > 40) {
+			d = (n / 8) * es;
+			pl = med3(pl, pl + d, pl + 2 * d, cmp);
+			pm = med3(pm - d, pm, pm + d, cmp);
+			pn = med3(pn - 2 * d, pn - d, pn, cmp);
+		}
+		pm = med3(pl, pm, pn, cmp);
+	}
+	swap(a, pm);
+	pa = pb = (char *) a + es;
+
+	pc = pd = (char *) a + (n - 1) * es;
+	for (;;) {
+		while (pb <= pc && (cmp_result = cmp(pb, a)) <= 0) {
+			if (cmp_result == 0) {
+				swap(pa, pb);
+				pa += es;
+			}
+			pb += es;
+		}
+		while (pb <= pc && (cmp_result = cmp(pc, a)) >= 0) {
+			if (cmp_result == 0) {
+				swap(pc, pd);
+				pd -= es;
+			}
+			pc -= es;
+		}
+		if (pb > pc)
+			break;
+		swap(pb, pc);
+		pb += es;
+		pc -= es;
+	}
+
+	pn = (char *) a + n * es;
+	r = min(pa - (char *) a, pb - pa);
+	vecswap(a, pb - r, r);
+	r = min((size_t)(pd - pc), pn - pd - es);
+	vecswap(pb, pn - r, r);
+	if ((r = pb - pa) > es) {
+                void *_l = a, *_r = ((unsigned char*)a)+r-1;
+                if (!((lrange < _l && rrange < _l) ||
+                    (lrange > _r && rrange > _r)))
+		    _pqsort(a, r / es, es, cmp, lrange, rrange);
+        }
+	if ((r = pd - pc) > es) {
+                void *_l, *_r;
+
+		/* Iterate rather than recurse to save stack space */
+		a = pn - r;
+		n = r / es;
+
+                _l = a;
+                _r = ((unsigned char*)a)+r-1;
+                if (!((lrange < _l && rrange < _l) ||
+                    (lrange > _r && rrange > _r)))
+		    goto loop;
+	}
+/*		qsort(pn - r, r / es, es, cmp);*/
+}
+
+void
+pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange)
+{
+    _pqsort(a,n,es,cmp,((unsigned char*)a)+(lrange*es),
+                       ((unsigned char*)a)+((rrange+1)*es)-1);
+}
diff --git a/redis-stable/src/pqsort.h b/redis-stable/src/pqsort.h
new file mode 100644
index 00000000..824ab5c0
--- /dev/null
+++ b/redis-stable/src/pqsort.h
@@ -0,0 +1,40 @@
+/* The following is the NetBSD libc qsort implementation modified in order to
+ * support partial sorting of ranges for Redis.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ * See the pqsort.c file for the original copyright notice. */
+
+#ifndef __PQSORT_H
+#define __PQSORT_H
+
+void
+pqsort(void *a, size_t n, size_t es,
+    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange);
+
+#endif
diff --git a/redis-stable/src/pubsub.c b/redis-stable/src/pubsub.c
new file mode 100644
index 00000000..3409deac
--- /dev/null
+++ b/redis-stable/src/pubsub.c
@@ -0,0 +1,469 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+int clientSubscriptionsCount(client *c);
+
+/*-----------------------------------------------------------------------------
+ * Pubsub client replies API
+ *----------------------------------------------------------------------------*/
+
+/* Send a pubsub message of type "message" to the client.
+ * Normally 'msg' is a Redis object containing the string to send as
+ * message. However if the caller sets 'msg' as NULL, it will be able
+ * to send a special message (for instance an Array type) by using the
+ * addReply*() API family. */
+void addReplyPubsubMessage(client *c, robj *channel, robj *msg) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[3]);
+    else
+        addReplyPushLen(c,3);
+    addReply(c,shared.messagebulk);
+    addReplyBulk(c,channel);
+    if (msg) addReplyBulk(c,msg);
+}
+
+/* Send a pubsub message of type "pmessage" to the client. The difference
+ * with the "message" type delivered by addReplyPubsubMessage() is that
+ * this message format also includes the pattern that matched the message. */
+void addReplyPubsubPatMessage(client *c, robj *pat, robj *channel, robj *msg) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[4]);
+    else
+        addReplyPushLen(c,4);
+    addReply(c,shared.pmessagebulk);
+    addReplyBulk(c,pat);
+    addReplyBulk(c,channel);
+    addReplyBulk(c,msg);
+}
+
+/* Send the pubsub subscription notification to the client. */
+void addReplyPubsubSubscribed(client *c, robj *channel) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[3]);
+    else
+        addReplyPushLen(c,3);
+    addReply(c,shared.subscribebulk);
+    addReplyBulk(c,channel);
+    addReplyLongLong(c,clientSubscriptionsCount(c));
+}
+
+/* Send the pubsub unsubscription notification to the client.
+ * Channel can be NULL: this is useful when the client sends a mass
+ * unsubscribe command but there are no channels to unsubscribe from: we
+ * still send a notification. */
+void addReplyPubsubUnsubscribed(client *c, robj *channel) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[3]);
+    else
+        addReplyPushLen(c,3);
+    addReply(c,shared.unsubscribebulk);
+    if (channel)
+        addReplyBulk(c,channel);
+    else
+        addReplyNull(c);
+    addReplyLongLong(c,clientSubscriptionsCount(c));
+}
+
+/* Send the pubsub pattern subscription notification to the client. */
+void addReplyPubsubPatSubscribed(client *c, robj *pattern) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[3]);
+    else
+        addReplyPushLen(c,3);
+    addReply(c,shared.psubscribebulk);
+    addReplyBulk(c,pattern);
+    addReplyLongLong(c,clientSubscriptionsCount(c));
+}
+
+/* Send the pubsub pattern unsubscription notification to the client.
+ * Pattern can be NULL: this is useful when the client sends a mass
+ * punsubscribe command but there are no pattern to unsubscribe from: we
+ * still send a notification. */
+void addReplyPubsubPatUnsubscribed(client *c, robj *pattern) {
+    if (c->resp == 2)
+        addReply(c,shared.mbulkhdr[3]);
+    else
+        addReplyPushLen(c,3);
+    addReply(c,shared.punsubscribebulk);
+    if (pattern)
+        addReplyBulk(c,pattern);
+    else
+        addReplyNull(c);
+    addReplyLongLong(c,clientSubscriptionsCount(c));
+}
+
+/*-----------------------------------------------------------------------------
+ * Pubsub low level API
+ *----------------------------------------------------------------------------*/
+
+/* Return the number of channels + patterns a client is subscribed to. */
+int clientSubscriptionsCount(client *c) {
+    return dictSize(c->pubsub_channels)+
+           listLength(c->pubsub_patterns);
+}
+
+/* Subscribe a client to a channel. Returns 1 if the operation succeeded, or
+ * 0 if the client was already subscribed to that channel. */
+int pubsubSubscribeChannel(client *c, robj *channel) {
+    dictEntry *de;
+    list *clients = NULL;
+    int retval = 0;
+
+    /* Add the channel to the client -> channels hash table */
+    if (dictAdd(c->pubsub_channels,channel,NULL) == DICT_OK) {
+        retval = 1;
+        incrRefCount(channel);
+        /* Add the client to the channel -> list of clients hash table */
+        de = dictFind(server.pubsub_channels,channel);
+        if (de == NULL) {
+            clients = listCreate();
+            dictAdd(server.pubsub_channels,channel,clients);
+            incrRefCount(channel);
+        } else {
+            clients = dictGetVal(de);
+        }
+        listAddNodeTail(clients,c);
+    }
+    /* Notify the client */
+    addReplyPubsubSubscribed(c,channel);
+    return retval;
+}
+
+/* Unsubscribe a client from a channel. Returns 1 if the operation succeeded, or
+ * 0 if the client was not subscribed to the specified channel. */
+int pubsubUnsubscribeChannel(client *c, robj *channel, int notify) {
+    dictEntry *de;
+    list *clients;
+    listNode *ln;
+    int retval = 0;
+
+    /* Remove the channel from the client -> channels hash table */
+    incrRefCount(channel); /* channel may be just a pointer to the same object
+                            we have in the hash tables. Protect it... */
+    if (dictDelete(c->pubsub_channels,channel) == DICT_OK) {
+        retval = 1;
+        /* Remove the client from the channel -> clients list hash table */
+        de = dictFind(server.pubsub_channels,channel);
+        serverAssertWithInfo(c,NULL,de != NULL);
+        clients = dictGetVal(de);
+        ln = listSearchKey(clients,c);
+        serverAssertWithInfo(c,NULL,ln != NULL);
+        listDelNode(clients,ln);
+        if (listLength(clients) == 0) {
+            /* Free the list and associated hash entry at all if this was
+             * the latest client, so that it will be possible to abuse
+             * Redis PUBSUB creating millions of channels. */
+            dictDelete(server.pubsub_channels,channel);
+        }
+    }
+    /* Notify the client */
+    if (notify) addReplyPubsubUnsubscribed(c,channel);
+    decrRefCount(channel); /* it is finally safe to release it */
+    return retval;
+}
+
+/* Subscribe a client to a pattern. Returns 1 if the operation succeeded, or 0 if the client was already subscribed to that pattern. */
+int pubsubSubscribePattern(client *c, robj *pattern) {
+    dictEntry *de;
+    list *clients;
+    int retval = 0;
+
+    if (listSearchKey(c->pubsub_patterns,pattern) == NULL) {
+        retval = 1;
+        listAddNodeTail(c->pubsub_patterns,pattern);
+        incrRefCount(pattern);
+        /* Add the client to the pattern -> list of clients hash table */
+        de = dictFind(server.pubsub_patterns,pattern);
+        if (de == NULL) {
+            clients = listCreate();
+            dictAdd(server.pubsub_patterns,pattern,clients);
+            incrRefCount(pattern);
+        } else {
+            clients = dictGetVal(de);
+        }
+        listAddNodeTail(clients,c);
+    }
+    /* Notify the client */
+    addReplyPubsubPatSubscribed(c,pattern);
+    return retval;
+}
+
+/* Unsubscribe a client from a channel. Returns 1 if the operation succeeded, or
+ * 0 if the client was not subscribed to the specified channel. */
+int pubsubUnsubscribePattern(client *c, robj *pattern, int notify) {
+    dictEntry *de;
+    list *clients;
+    listNode *ln;
+    int retval = 0;
+
+    incrRefCount(pattern); /* Protect the object. May be the same we remove */
+    if ((ln = listSearchKey(c->pubsub_patterns,pattern)) != NULL) {
+        retval = 1;
+        listDelNode(c->pubsub_patterns,ln);
+        /* Remove the client from the pattern -> clients list hash table */
+        de = dictFind(server.pubsub_patterns,pattern);
+        serverAssertWithInfo(c,NULL,de != NULL);
+        clients = dictGetVal(de);
+        ln = listSearchKey(clients,c);
+        serverAssertWithInfo(c,NULL,ln != NULL);
+        listDelNode(clients,ln);
+        if (listLength(clients) == 0) {
+            /* Free the list and associated hash entry at all if this was
+             * the latest client. */
+            dictDelete(server.pubsub_patterns,pattern);
+        }
+    }
+    /* Notify the client */
+    if (notify) addReplyPubsubPatUnsubscribed(c,pattern);
+    decrRefCount(pattern);
+    return retval;
+}
+
+/* Unsubscribe from all the channels. Return the number of channels the
+ * client was subscribed to. */
+int pubsubUnsubscribeAllChannels(client *c, int notify) {
+    int count = 0;
+    if (dictSize(c->pubsub_channels) > 0) {
+        dictIterator *di = dictGetSafeIterator(c->pubsub_channels);
+        dictEntry *de;
+
+        while((de = dictNext(di)) != NULL) {
+            robj *channel = dictGetKey(de);
+
+            count += pubsubUnsubscribeChannel(c,channel,notify);
+        }
+        dictReleaseIterator(di);
+    }
+    /* We were subscribed to nothing? Still reply to the client. */
+    if (notify && count == 0) addReplyPubsubUnsubscribed(c,NULL);
+    return count;
+}
+
+/* Unsubscribe from all the patterns. Return the number of patterns the
+ * client was subscribed from. */
+int pubsubUnsubscribeAllPatterns(client *c, int notify) {
+    listNode *ln;
+    listIter li;
+    int count = 0;
+
+    listRewind(c->pubsub_patterns,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        robj *pattern = ln->value;
+
+        count += pubsubUnsubscribePattern(c,pattern,notify);
+    }
+    if (notify && count == 0) addReplyPubsubPatUnsubscribed(c,NULL);
+    return count;
+}
+
+/* Publish a message */
+int pubsubPublishMessage(robj *channel, robj *message) {
+    int receivers = 0;
+    dictEntry *de;
+    dictIterator *di;
+    listNode *ln;
+    listIter li;
+
+    /* Send to clients listening for that channel */
+    de = dictFind(server.pubsub_channels,channel);
+    if (de) {
+        list *list = dictGetVal(de);
+        listNode *ln;
+        listIter li;
+
+        listRewind(list,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            client *c = ln->value;
+            addReplyPubsubMessage(c,channel,message);
+            receivers++;
+        }
+    }
+    /* Send to clients listening to matching channels */
+    di = dictGetIterator(server.pubsub_patterns);
+    if (di) {
+        channel = getDecodedObject(channel);
+        while((de = dictNext(di)) != NULL) {
+            robj *pattern = dictGetKey(de);
+            list *clients = dictGetVal(de);
+            if (!stringmatchlen((char*)pattern->ptr,
+                                sdslen(pattern->ptr),
+                                (char*)channel->ptr,
+                                sdslen(channel->ptr),0)) continue;
+
+            listRewind(clients,&li);
+            while ((ln = listNext(&li)) != NULL) {
+                client *c = listNodeValue(ln);
+                addReplyPubsubPatMessage(c,pattern,channel,message);
+                receivers++;
+            }
+        }
+        decrRefCount(channel);
+        dictReleaseIterator(di);
+    }
+    return receivers;
+}
+
+/*-----------------------------------------------------------------------------
+ * Pubsub commands implementation
+ *----------------------------------------------------------------------------*/
+
+/* SUBSCRIBE channel [channel ...] */
+void subscribeCommand(client *c) {
+    int j;
+    if ((c->flags & CLIENT_DENY_BLOCKING) && !(c->flags & CLIENT_MULTI)) {
+        /**
+         * A client that has CLIENT_DENY_BLOCKING flag on
+         * expect a reply per command and so can not execute subscribe.
+         *
+         * Notice that we have a special treatment for multi because of
+         * backword compatibility
+         */
+        addReplyError(c, "SUBSCRIBE isn't allowed for a DENY BLOCKING client");
+        return;
+    }
+
+    for (j = 1; j < c->argc; j++)
+        pubsubSubscribeChannel(c,c->argv[j]);
+    c->flags |= CLIENT_PUBSUB;
+}
+
+/* UNSUBSCRIBE [channel [channel ...]] */
+void unsubscribeCommand(client *c) {
+    if (c->argc == 1) {
+        pubsubUnsubscribeAllChannels(c,1);
+    } else {
+        int j;
+
+        for (j = 1; j < c->argc; j++)
+            pubsubUnsubscribeChannel(c,c->argv[j],1);
+    }
+    if (clientSubscriptionsCount(c) == 0) c->flags &= ~CLIENT_PUBSUB;
+}
+
+/* PSUBSCRIBE pattern [pattern ...] */
+void psubscribeCommand(client *c) {
+    int j;
+    if ((c->flags & CLIENT_DENY_BLOCKING) && !(c->flags & CLIENT_MULTI)) {
+        /**
+         * A client that has CLIENT_DENY_BLOCKING flag on
+         * expect a reply per command and so can not execute subscribe.
+         *
+         * Notice that we have a special treatment for multi because of
+         * backword compatibility
+         */
+        addReplyError(c, "PSUBSCRIBE isn't allowed for a DENY BLOCKING client");
+        return;
+    }
+
+    for (j = 1; j < c->argc; j++)
+        pubsubSubscribePattern(c,c->argv[j]);
+    c->flags |= CLIENT_PUBSUB;
+}
+
+/* PUNSUBSCRIBE [pattern [pattern ...]] */
+void punsubscribeCommand(client *c) {
+    if (c->argc == 1) {
+        pubsubUnsubscribeAllPatterns(c,1);
+    } else {
+        int j;
+
+        for (j = 1; j < c->argc; j++)
+            pubsubUnsubscribePattern(c,c->argv[j],1);
+    }
+    if (clientSubscriptionsCount(c) == 0) c->flags &= ~CLIENT_PUBSUB;
+}
+
+/* PUBLISH <channel> <message> */
+void publishCommand(client *c) {
+    int receivers = pubsubPublishMessage(c->argv[1],c->argv[2]);
+    if (server.cluster_enabled)
+        clusterPropagatePublish(c->argv[1],c->argv[2]);
+    else
+        forceCommandPropagation(c,PROPAGATE_REPL);
+    addReplyLongLong(c,receivers);
+}
+
+/* PUBSUB command for Pub/Sub introspection. */
+void pubsubCommand(client *c) {
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"CHANNELS [<pattern>]",
+"    Return the currently active channels matching a <pattern> (default: '*').",
+"NUMPAT",
+"    Return number of subscriptions to patterns.",
+"NUMSUB [<channel> ...]",
+"    Return the number of subscribers for the specified channels, excluding",
+"    pattern subscriptions(default: no channels).",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"channels") &&
+        (c->argc == 2 || c->argc == 3))
+    {
+        /* PUBSUB CHANNELS [<pattern>] */
+        sds pat = (c->argc == 2) ? NULL : c->argv[2]->ptr;
+        dictIterator *di = dictGetIterator(server.pubsub_channels);
+        dictEntry *de;
+        long mblen = 0;
+        void *replylen;
+
+        replylen = addReplyDeferredLen(c);
+        while((de = dictNext(di)) != NULL) {
+            robj *cobj = dictGetKey(de);
+            sds channel = cobj->ptr;
+
+            if (!pat || stringmatchlen(pat, sdslen(pat),
+                                       channel, sdslen(channel),0))
+            {
+                addReplyBulk(c,cobj);
+                mblen++;
+            }
+        }
+        dictReleaseIterator(di);
+        setDeferredArrayLen(c,replylen,mblen);
+    } else if (!strcasecmp(c->argv[1]->ptr,"numsub") && c->argc >= 2) {
+        /* PUBSUB NUMSUB [Channel_1 ... Channel_N] */
+        int j;
+
+        addReplyArrayLen(c,(c->argc-2)*2);
+        for (j = 2; j < c->argc; j++) {
+            list *l = dictFetchValue(server.pubsub_channels,c->argv[j]);
+
+            addReplyBulk(c,c->argv[j]);
+            addReplyLongLong(c,l ? listLength(l) : 0);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"numpat") && c->argc == 2) {
+        /* PUBSUB NUMPAT */
+        addReplyLongLong(c,dictSize(server.pubsub_patterns));
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
diff --git a/redis-stable/src/quicklist.c b/redis-stable/src/quicklist.c
new file mode 100644
index 00000000..a9f8b43b
--- /dev/null
+++ b/redis-stable/src/quicklist.c
@@ -0,0 +1,2785 @@
+/* quicklist.c - A doubly linked list of ziplists
+ *
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must start the above copyright notice,
+ *     this quicklist of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this quicklist of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <string.h> /* for memcpy */
+#include "quicklist.h"
+#include "zmalloc.h"
+#include "config.h"
+#include "ziplist.h"
+#include "util.h" /* for ll2string */
+#include "lzf.h"
+#include "redisassert.h"
+
+#if defined(REDIS_TEST) || defined(REDIS_TEST_VERBOSE)
+#include <stdio.h> /* for printf (debug printing), snprintf (genstr) */
+#endif
+
+#ifndef REDIS_STATIC
+#define REDIS_STATIC static
+#endif
+
+/* Optimization levels for size-based filling.
+ * Note that the largest possible limit is 16k, so even if each record takes
+ * just one byte, it still won't overflow the 16 bit count field. */
+static const size_t optimization_level[] = {4096, 8192, 16384, 32768, 65536};
+
+/* Maximum size in bytes of any multi-element ziplist.
+ * Larger values will live in their own isolated ziplists.
+ * This is used only if we're limited by record count. when we're limited by
+ * size, the maximum limit is bigger, but still safe.
+ * 8k is a recommended / default size limit */
+#define SIZE_SAFETY_LIMIT 8192
+
+/* Minimum ziplist size in bytes for attempting compression. */
+#define MIN_COMPRESS_BYTES 48
+
+/* Minimum size reduction in bytes to store compressed quicklistNode data.
+ * This also prevents us from storing compression if the compression
+ * resulted in a larger size than the original data. */
+#define MIN_COMPRESS_IMPROVE 8
+
+/* If not verbose testing, remove all debug printing. */
+#ifndef REDIS_TEST_VERBOSE
+#define D(...)
+#else
+#define D(...)                                                                 \
+    do {                                                                       \
+        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
+        printf(__VA_ARGS__);                                                   \
+        printf("\n");                                                          \
+    } while (0)
+#endif
+
+/* Bookmarks forward declarations */
+#define QL_MAX_BM ((1 << QL_BM_BITS)-1)
+quicklistBookmark *_quicklistBookmarkFindByName(quicklist *ql, const char *name);
+quicklistBookmark *_quicklistBookmarkFindByNode(quicklist *ql, quicklistNode *node);
+void _quicklistBookmarkDelete(quicklist *ql, quicklistBookmark *bm);
+
+/* Simple way to give quicklistEntry structs default values with one call. */
+#define initEntry(e)                                                           \
+    do {                                                                       \
+        (e)->zi = (e)->value = NULL;                                           \
+        (e)->longval = -123456789;                                             \
+        (e)->quicklist = NULL;                                                 \
+        (e)->node = NULL;                                                      \
+        (e)->offset = 123456789;                                               \
+        (e)->sz = 0;                                                           \
+    } while (0)
+
+/* Create a new quicklist.
+ * Free with quicklistRelease(). */
+quicklist *quicklistCreate(void) {
+    struct quicklist *quicklist;
+
+    quicklist = zmalloc(sizeof(*quicklist));
+    quicklist->head = quicklist->tail = NULL;
+    quicklist->len = 0;
+    quicklist->count = 0;
+    quicklist->compress = 0;
+    quicklist->fill = -2;
+    quicklist->bookmark_count = 0;
+    return quicklist;
+}
+
+#define COMPRESS_MAX ((1 << QL_COMP_BITS)-1)
+void quicklistSetCompressDepth(quicklist *quicklist, int compress) {
+    if (compress > COMPRESS_MAX) {
+        compress = COMPRESS_MAX;
+    } else if (compress < 0) {
+        compress = 0;
+    }
+    quicklist->compress = compress;
+}
+
+#define FILL_MAX ((1 << (QL_FILL_BITS-1))-1)
+void quicklistSetFill(quicklist *quicklist, int fill) {
+    if (fill > FILL_MAX) {
+        fill = FILL_MAX;
+    } else if (fill < -5) {
+        fill = -5;
+    }
+    quicklist->fill = fill;
+}
+
+void quicklistSetOptions(quicklist *quicklist, int fill, int depth) {
+    quicklistSetFill(quicklist, fill);
+    quicklistSetCompressDepth(quicklist, depth);
+}
+
+/* Create a new quicklist with some default parameters. */
+quicklist *quicklistNew(int fill, int compress) {
+    quicklist *quicklist = quicklistCreate();
+    quicklistSetOptions(quicklist, fill, compress);
+    return quicklist;
+}
+
+REDIS_STATIC quicklistNode *quicklistCreateNode(void) {
+    quicklistNode *node;
+    node = zmalloc(sizeof(*node));
+    node->zl = NULL;
+    node->count = 0;
+    node->sz = 0;
+    node->next = node->prev = NULL;
+    node->encoding = QUICKLIST_NODE_ENCODING_RAW;
+    node->container = QUICKLIST_NODE_CONTAINER_ZIPLIST;
+    node->recompress = 0;
+    return node;
+}
+
+/* Return cached quicklist count */
+unsigned long quicklistCount(const quicklist *ql) { return ql->count; }
+
+/* Free entire quicklist. */
+void quicklistRelease(quicklist *quicklist) {
+    unsigned long len;
+    quicklistNode *current, *next;
+
+    current = quicklist->head;
+    len = quicklist->len;
+    while (len--) {
+        next = current->next;
+
+        zfree(current->zl);
+        quicklist->count -= current->count;
+
+        zfree(current);
+
+        quicklist->len--;
+        current = next;
+    }
+    quicklistBookmarksClear(quicklist);
+    zfree(quicklist);
+}
+
+/* Compress the ziplist in 'node' and update encoding details.
+ * Returns 1 if ziplist compressed successfully.
+ * Returns 0 if compression failed or if ziplist too small to compress. */
+REDIS_STATIC int __quicklistCompressNode(quicklistNode *node) {
+#ifdef REDIS_TEST
+    node->attempted_compress = 1;
+#endif
+
+    /* Don't bother compressing small values */
+    if (node->sz < MIN_COMPRESS_BYTES)
+        return 0;
+
+    quicklistLZF *lzf = zmalloc(sizeof(*lzf) + node->sz);
+
+    /* Cancel if compression fails or doesn't compress small enough */
+    if (((lzf->sz = lzf_compress(node->zl, node->sz, lzf->compressed,
+                                 node->sz)) == 0) ||
+        lzf->sz + MIN_COMPRESS_IMPROVE >= node->sz) {
+        /* lzf_compress aborts/rejects compression if value not compressable. */
+        zfree(lzf);
+        return 0;
+    }
+    lzf = zrealloc(lzf, sizeof(*lzf) + lzf->sz);
+    zfree(node->zl);
+    node->zl = (unsigned char *)lzf;
+    node->encoding = QUICKLIST_NODE_ENCODING_LZF;
+    node->recompress = 0;
+    return 1;
+}
+
+/* Compress only uncompressed nodes. */
+#define quicklistCompressNode(_node)                                           \
+    do {                                                                       \
+        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_RAW) {     \
+            __quicklistCompressNode((_node));                                  \
+        }                                                                      \
+    } while (0)
+
+/* Uncompress the ziplist in 'node' and update encoding details.
+ * Returns 1 on successful decode, 0 on failure to decode. */
+REDIS_STATIC int __quicklistDecompressNode(quicklistNode *node) {
+#ifdef REDIS_TEST
+    node->attempted_compress = 0;
+#endif
+
+    void *decompressed = zmalloc(node->sz);
+    quicklistLZF *lzf = (quicklistLZF *)node->zl;
+    if (lzf_decompress(lzf->compressed, lzf->sz, decompressed, node->sz) == 0) {
+        /* Someone requested decompress, but we can't decompress.  Not good. */
+        zfree(decompressed);
+        return 0;
+    }
+    zfree(lzf);
+    node->zl = decompressed;
+    node->encoding = QUICKLIST_NODE_ENCODING_RAW;
+    return 1;
+}
+
+/* Decompress only compressed nodes. */
+#define quicklistDecompressNode(_node)                                         \
+    do {                                                                       \
+        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_LZF) {     \
+            __quicklistDecompressNode((_node));                                \
+        }                                                                      \
+    } while (0)
+
+/* Force node to not be immediately re-compresable */
+#define quicklistDecompressNodeForUse(_node)                                   \
+    do {                                                                       \
+        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_LZF) {     \
+            __quicklistDecompressNode((_node));                                \
+            (_node)->recompress = 1;                                           \
+        }                                                                      \
+    } while (0)
+
+/* Extract the raw LZF data from this quicklistNode.
+ * Pointer to LZF data is assigned to '*data'.
+ * Return value is the length of compressed LZF data. */
+size_t quicklistGetLzf(const quicklistNode *node, void **data) {
+    quicklistLZF *lzf = (quicklistLZF *)node->zl;
+    *data = lzf->compressed;
+    return lzf->sz;
+}
+
+#define quicklistAllowsCompression(_ql) ((_ql)->compress != 0)
+
+/* Force 'quicklist' to meet compression guidelines set by compress depth.
+ * The only way to guarantee interior nodes get compressed is to iterate
+ * to our "interior" compress depth then compress the next node we find.
+ * If compress depth is larger than the entire list, we return immediately. */
+REDIS_STATIC void __quicklistCompress(const quicklist *quicklist,
+                                      quicklistNode *node) {
+    /* If length is less than our compress depth (from both sides),
+     * we can't compress anything. */
+    if (!quicklistAllowsCompression(quicklist) ||
+        quicklist->len < (unsigned int)(quicklist->compress * 2))
+        return;
+
+#if 0
+    /* Optimized cases for small depth counts */
+    if (quicklist->compress == 1) {
+        quicklistNode *h = quicklist->head, *t = quicklist->tail;
+        quicklistDecompressNode(h);
+        quicklistDecompressNode(t);
+        if (h != node && t != node)
+            quicklistCompressNode(node);
+        return;
+    } else if (quicklist->compress == 2) {
+        quicklistNode *h = quicklist->head, *hn = h->next, *hnn = hn->next;
+        quicklistNode *t = quicklist->tail, *tp = t->prev, *tpp = tp->prev;
+        quicklistDecompressNode(h);
+        quicklistDecompressNode(hn);
+        quicklistDecompressNode(t);
+        quicklistDecompressNode(tp);
+        if (h != node && hn != node && t != node && tp != node) {
+            quicklistCompressNode(node);
+        }
+        if (hnn != t) {
+            quicklistCompressNode(hnn);
+        }
+        if (tpp != h) {
+            quicklistCompressNode(tpp);
+        }
+        return;
+    }
+#endif
+
+    /* Iterate until we reach compress depth for both sides of the list.a
+     * Note: because we do length checks at the *top* of this function,
+     *       we can skip explicit null checks below. Everything exists. */
+    quicklistNode *forward = quicklist->head;
+    quicklistNode *reverse = quicklist->tail;
+    int depth = 0;
+    int in_depth = 0;
+    while (depth++ < quicklist->compress) {
+        quicklistDecompressNode(forward);
+        quicklistDecompressNode(reverse);
+
+        if (forward == node || reverse == node)
+            in_depth = 1;
+
+        /* We passed into compress depth of opposite side of the quicklist
+         * so there's no need to compress anything and we can exit. */
+        if (forward == reverse || forward->next == reverse)
+            return;
+
+        forward = forward->next;
+        reverse = reverse->prev;
+    }
+
+    if (!in_depth)
+        quicklistCompressNode(node);
+
+    /* At this point, forward and reverse are one node beyond depth */
+    quicklistCompressNode(forward);
+    quicklistCompressNode(reverse);
+}
+
+#define quicklistCompress(_ql, _node)                                          \
+    do {                                                                       \
+        if ((_node)->recompress)                                               \
+            quicklistCompressNode((_node));                                    \
+        else                                                                   \
+            __quicklistCompress((_ql), (_node));                               \
+    } while (0)
+
+/* If we previously used quicklistDecompressNodeForUse(), just recompress. */
+#define quicklistRecompressOnly(_ql, _node)                                    \
+    do {                                                                       \
+        if ((_node)->recompress)                                               \
+            quicklistCompressNode((_node));                                    \
+    } while (0)
+
+/* Insert 'new_node' after 'old_node' if 'after' is 1.
+ * Insert 'new_node' before 'old_node' if 'after' is 0.
+ * Note: 'new_node' is *always* uncompressed, so if we assign it to
+ *       head or tail, we do not need to uncompress it. */
+REDIS_STATIC void __quicklistInsertNode(quicklist *quicklist,
+                                        quicklistNode *old_node,
+                                        quicklistNode *new_node, int after) {
+    if (after) {
+        new_node->prev = old_node;
+        if (old_node) {
+            new_node->next = old_node->next;
+            if (old_node->next)
+                old_node->next->prev = new_node;
+            old_node->next = new_node;
+        }
+        if (quicklist->tail == old_node)
+            quicklist->tail = new_node;
+    } else {
+        new_node->next = old_node;
+        if (old_node) {
+            new_node->prev = old_node->prev;
+            if (old_node->prev)
+                old_node->prev->next = new_node;
+            old_node->prev = new_node;
+        }
+        if (quicklist->head == old_node)
+            quicklist->head = new_node;
+    }
+    /* If this insert creates the only element so far, initialize head/tail. */
+    if (quicklist->len == 0) {
+        quicklist->head = quicklist->tail = new_node;
+    }
+
+    /* Update len first, so in __quicklistCompress we know exactly len */
+    quicklist->len++;
+
+    if (old_node)
+        quicklistCompress(quicklist, old_node);
+}
+
+/* Wrappers for node inserting around existing node. */
+REDIS_STATIC void _quicklistInsertNodeBefore(quicklist *quicklist,
+                                             quicklistNode *old_node,
+                                             quicklistNode *new_node) {
+    __quicklistInsertNode(quicklist, old_node, new_node, 0);
+}
+
+REDIS_STATIC void _quicklistInsertNodeAfter(quicklist *quicklist,
+                                            quicklistNode *old_node,
+                                            quicklistNode *new_node) {
+    __quicklistInsertNode(quicklist, old_node, new_node, 1);
+}
+
+REDIS_STATIC int
+_quicklistNodeSizeMeetsOptimizationRequirement(const size_t sz,
+                                               const int fill) {
+    if (fill >= 0)
+        return 0;
+
+    size_t offset = (-fill) - 1;
+    if (offset < (sizeof(optimization_level) / sizeof(*optimization_level))) {
+        if (sz <= optimization_level[offset]) {
+            return 1;
+        } else {
+            return 0;
+        }
+    } else {
+        return 0;
+    }
+}
+
+#define sizeMeetsSafetyLimit(sz) ((sz) <= SIZE_SAFETY_LIMIT)
+
+REDIS_STATIC int _quicklistNodeAllowInsert(const quicklistNode *node,
+                                           const int fill, const size_t sz) {
+    if (unlikely(!node))
+        return 0;
+
+    int ziplist_overhead;
+    /* size of previous offset */
+    if (sz < 254)
+        ziplist_overhead = 1;
+    else
+        ziplist_overhead = 5;
+
+    /* size of forward offset */
+    if (sz < 64)
+        ziplist_overhead += 1;
+    else if (likely(sz < 16384))
+        ziplist_overhead += 2;
+    else
+        ziplist_overhead += 5;
+
+    /* new_sz overestimates if 'sz' encodes to an integer type */
+    unsigned int new_sz = node->sz + sz + ziplist_overhead;
+    if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(new_sz, fill)))
+        return 1;
+    /* when we return 1 above we know that the limit is a size limit (which is
+     * safe, see comments next to optimization_level and SIZE_SAFETY_LIMIT) */
+    else if (!sizeMeetsSafetyLimit(new_sz))
+        return 0;
+    else if ((int)node->count < fill)
+        return 1;
+    else
+        return 0;
+}
+
+REDIS_STATIC int _quicklistNodeAllowMerge(const quicklistNode *a,
+                                          const quicklistNode *b,
+                                          const int fill) {
+    if (!a || !b)
+        return 0;
+
+    /* approximate merged ziplist size (- 11 to remove one ziplist
+     * header/trailer) */
+    unsigned int merge_sz = a->sz + b->sz - 11;
+    if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(merge_sz, fill)))
+        return 1;
+    /* when we return 1 above we know that the limit is a size limit (which is
+     * safe, see comments next to optimization_level and SIZE_SAFETY_LIMIT) */
+    else if (!sizeMeetsSafetyLimit(merge_sz))
+        return 0;
+    else if ((int)(a->count + b->count) <= fill)
+        return 1;
+    else
+        return 0;
+}
+
+#define quicklistNodeUpdateSz(node)                                            \
+    do {                                                                       \
+        (node)->sz = ziplistBlobLen((node)->zl);                               \
+    } while (0)
+
+/* Add new entry to head node of quicklist.
+ *
+ * Returns 0 if used existing head.
+ * Returns 1 if new head created. */
+int quicklistPushHead(quicklist *quicklist, void *value, size_t sz) {
+    quicklistNode *orig_head = quicklist->head;
+    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
+    if (likely(
+            _quicklistNodeAllowInsert(quicklist->head, quicklist->fill, sz))) {
+        quicklist->head->zl =
+            ziplistPush(quicklist->head->zl, value, sz, ZIPLIST_HEAD);
+        quicklistNodeUpdateSz(quicklist->head);
+    } else {
+        quicklistNode *node = quicklistCreateNode();
+        node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
+
+        quicklistNodeUpdateSz(node);
+        _quicklistInsertNodeBefore(quicklist, quicklist->head, node);
+    }
+    quicklist->count++;
+    quicklist->head->count++;
+    return (orig_head != quicklist->head);
+}
+
+/* Add new entry to tail node of quicklist.
+ *
+ * Returns 0 if used existing tail.
+ * Returns 1 if new tail created. */
+int quicklistPushTail(quicklist *quicklist, void *value, size_t sz) {
+    quicklistNode *orig_tail = quicklist->tail;
+    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
+    if (likely(
+            _quicklistNodeAllowInsert(quicklist->tail, quicklist->fill, sz))) {
+        quicklist->tail->zl =
+            ziplistPush(quicklist->tail->zl, value, sz, ZIPLIST_TAIL);
+        quicklistNodeUpdateSz(quicklist->tail);
+    } else {
+        quicklistNode *node = quicklistCreateNode();
+        node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_TAIL);
+
+        quicklistNodeUpdateSz(node);
+        _quicklistInsertNodeAfter(quicklist, quicklist->tail, node);
+    }
+    quicklist->count++;
+    quicklist->tail->count++;
+    return (orig_tail != quicklist->tail);
+}
+
+/* Create new node consisting of a pre-formed ziplist.
+ * Used for loading RDBs where entire ziplists have been stored
+ * to be retrieved later. */
+void quicklistAppendZiplist(quicklist *quicklist, unsigned char *zl) {
+    quicklistNode *node = quicklistCreateNode();
+
+    node->zl = zl;
+    node->count = ziplistLen(node->zl);
+    node->sz = ziplistBlobLen(zl);
+
+    _quicklistInsertNodeAfter(quicklist, quicklist->tail, node);
+    quicklist->count += node->count;
+}
+
+/* Append all values of ziplist 'zl' individually into 'quicklist'.
+ *
+ * This allows us to restore old RDB ziplists into new quicklists
+ * with smaller ziplist sizes than the saved RDB ziplist.
+ *
+ * Returns 'quicklist' argument. Frees passed-in ziplist 'zl' */
+quicklist *quicklistAppendValuesFromZiplist(quicklist *quicklist,
+                                            unsigned char *zl) {
+    unsigned char *value;
+    unsigned int sz;
+    long long longval;
+    char longstr[32] = {0};
+
+    unsigned char *p = ziplistIndex(zl, 0);
+    while (ziplistGet(p, &value, &sz, &longval)) {
+        if (!value) {
+            /* Write the longval as a string so we can re-add it */
+            sz = ll2string(longstr, sizeof(longstr), longval);
+            value = (unsigned char *)longstr;
+        }
+        quicklistPushTail(quicklist, value, sz);
+        p = ziplistNext(zl, p);
+    }
+    zfree(zl);
+    return quicklist;
+}
+
+/* Create new (potentially multi-node) quicklist from a single existing ziplist.
+ *
+ * Returns new quicklist.  Frees passed-in ziplist 'zl'. */
+quicklist *quicklistCreateFromZiplist(int fill, int compress,
+                                      unsigned char *zl) {
+    return quicklistAppendValuesFromZiplist(quicklistNew(fill, compress), zl);
+}
+
+#define quicklistDeleteIfEmpty(ql, n)                                          \
+    do {                                                                       \
+        if ((n)->count == 0) {                                                 \
+            __quicklistDelNode((ql), (n));                                     \
+            (n) = NULL;                                                        \
+        }                                                                      \
+    } while (0)
+
+REDIS_STATIC void __quicklistDelNode(quicklist *quicklist,
+                                     quicklistNode *node) {
+    /* Update the bookmark if any */
+    quicklistBookmark *bm = _quicklistBookmarkFindByNode(quicklist, node);
+    if (bm) {
+        bm->node = node->next;
+        /* if the bookmark was to the last node, delete it. */
+        if (!bm->node)
+            _quicklistBookmarkDelete(quicklist, bm);
+    }
+
+    if (node->next)
+        node->next->prev = node->prev;
+    if (node->prev)
+        node->prev->next = node->next;
+
+    if (node == quicklist->tail) {
+        quicklist->tail = node->prev;
+    }
+
+    if (node == quicklist->head) {
+        quicklist->head = node->next;
+    }
+
+    /* Update len first, so in __quicklistCompress we know exactly len */
+    quicklist->len--;
+    quicklist->count -= node->count;
+
+    /* If we deleted a node within our compress depth, we
+     * now have compressed nodes needing to be decompressed. */
+    __quicklistCompress(quicklist, NULL);
+
+    zfree(node->zl);
+    zfree(node);
+}
+
+/* Delete one entry from list given the node for the entry and a pointer
+ * to the entry in the node.
+ *
+ * Note: quicklistDelIndex() *requires* uncompressed nodes because you
+ *       already had to get *p from an uncompressed node somewhere.
+ *
+ * Returns 1 if the entire node was deleted, 0 if node still exists.
+ * Also updates in/out param 'p' with the next offset in the ziplist. */
+REDIS_STATIC int quicklistDelIndex(quicklist *quicklist, quicklistNode *node,
+                                   unsigned char **p) {
+    int gone = 0;
+
+    node->zl = ziplistDelete(node->zl, p);
+    node->count--;
+    if (node->count == 0) {
+        gone = 1;
+        __quicklistDelNode(quicklist, node);
+    } else {
+        quicklistNodeUpdateSz(node);
+    }
+    quicklist->count--;
+    /* If we deleted the node, the original node is no longer valid */
+    return gone ? 1 : 0;
+}
+
+/* Delete one element represented by 'entry'
+ *
+ * 'entry' stores enough metadata to delete the proper position in
+ * the correct ziplist in the correct quicklist node. */
+void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry) {
+    quicklistNode *prev = entry->node->prev;
+    quicklistNode *next = entry->node->next;
+    int deleted_node = quicklistDelIndex((quicklist *)entry->quicklist,
+                                         entry->node, &entry->zi);
+
+    /* after delete, the zi is now invalid for any future usage. */
+    iter->zi = NULL;
+
+    /* If current node is deleted, we must update iterator node and offset. */
+    if (deleted_node) {
+        if (iter->direction == AL_START_HEAD) {
+            iter->current = next;
+            iter->offset = 0;
+        } else if (iter->direction == AL_START_TAIL) {
+            iter->current = prev;
+            iter->offset = -1;
+        }
+    }
+    /* else if (!deleted_node), no changes needed.
+     * we already reset iter->zi above, and the existing iter->offset
+     * doesn't move again because:
+     *   - [1, 2, 3] => delete offset 1 => [1, 3]: next element still offset 1
+     *   - [1, 2, 3] => delete offset 0 => [2, 3]: next element still offset 0
+     *  if we deleted the last element at offet N and now
+     *  length of this ziplist is N-1, the next call into
+     *  quicklistNext() will jump to the next node. */
+}
+
+/* Replace quicklist entry at offset 'index' by 'data' with length 'sz'.
+ *
+ * Returns 1 if replace happened.
+ * Returns 0 if replace failed and no changes happened. */
+int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data,
+                            int sz) {
+    quicklistEntry entry;
+    if (likely(quicklistIndex(quicklist, index, &entry))) {
+        /* quicklistIndex provides an uncompressed node */
+        entry.node->zl = ziplistReplace(entry.node->zl, entry.zi, data, sz);
+        quicklistNodeUpdateSz(entry.node);
+        quicklistCompress(quicklist, entry.node);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Given two nodes, try to merge their ziplists.
+ *
+ * This helps us not have a quicklist with 3 element ziplists if
+ * our fill factor can handle much higher levels.
+ *
+ * Note: 'a' must be to the LEFT of 'b'.
+ *
+ * After calling this function, both 'a' and 'b' should be considered
+ * unusable.  The return value from this function must be used
+ * instead of re-using any of the quicklistNode input arguments.
+ *
+ * Returns the input node picked to merge against or NULL if
+ * merging was not possible. */
+REDIS_STATIC quicklistNode *_quicklistZiplistMerge(quicklist *quicklist,
+                                                   quicklistNode *a,
+                                                   quicklistNode *b) {
+    D("Requested merge (a,b) (%u, %u)", a->count, b->count);
+
+    quicklistDecompressNode(a);
+    quicklistDecompressNode(b);
+    if ((ziplistMerge(&a->zl, &b->zl))) {
+        /* We merged ziplists! Now remove the unused quicklistNode. */
+        quicklistNode *keep = NULL, *nokeep = NULL;
+        if (!a->zl) {
+            nokeep = a;
+            keep = b;
+        } else if (!b->zl) {
+            nokeep = b;
+            keep = a;
+        }
+        keep->count = ziplistLen(keep->zl);
+        quicklistNodeUpdateSz(keep);
+
+        nokeep->count = 0;
+        __quicklistDelNode(quicklist, nokeep);
+        quicklistCompress(quicklist, keep);
+        return keep;
+    } else {
+        /* else, the merge returned NULL and nothing changed. */
+        return NULL;
+    }
+}
+
+/* Attempt to merge ziplists within two nodes on either side of 'center'.
+ *
+ * We attempt to merge:
+ *   - (center->prev->prev, center->prev)
+ *   - (center->next, center->next->next)
+ *   - (center->prev, center)
+ *   - (center, center->next)
+ */
+REDIS_STATIC void _quicklistMergeNodes(quicklist *quicklist,
+                                       quicklistNode *center) {
+    int fill = quicklist->fill;
+    quicklistNode *prev, *prev_prev, *next, *next_next, *target;
+    prev = prev_prev = next = next_next = target = NULL;
+
+    if (center->prev) {
+        prev = center->prev;
+        if (center->prev->prev)
+            prev_prev = center->prev->prev;
+    }
+
+    if (center->next) {
+        next = center->next;
+        if (center->next->next)
+            next_next = center->next->next;
+    }
+
+    /* Try to merge prev_prev and prev */
+    if (_quicklistNodeAllowMerge(prev, prev_prev, fill)) {
+        _quicklistZiplistMerge(quicklist, prev_prev, prev);
+        prev_prev = prev = NULL; /* they could have moved, invalidate them. */
+    }
+
+    /* Try to merge next and next_next */
+    if (_quicklistNodeAllowMerge(next, next_next, fill)) {
+        _quicklistZiplistMerge(quicklist, next, next_next);
+        next = next_next = NULL; /* they could have moved, invalidate them. */
+    }
+
+    /* Try to merge center node and previous node */
+    if (_quicklistNodeAllowMerge(center, center->prev, fill)) {
+        target = _quicklistZiplistMerge(quicklist, center->prev, center);
+        center = NULL; /* center could have been deleted, invalidate it. */
+    } else {
+        /* else, we didn't merge here, but target needs to be valid below. */
+        target = center;
+    }
+
+    /* Use result of center merge (or original) to merge with next node. */
+    if (_quicklistNodeAllowMerge(target, target->next, fill)) {
+        _quicklistZiplistMerge(quicklist, target, target->next);
+    }
+}
+
+/* Split 'node' into two parts, parameterized by 'offset' and 'after'.
+ *
+ * The 'after' argument controls which quicklistNode gets returned.
+ * If 'after'==1, returned node has elements after 'offset'.
+ *                input node keeps elements up to 'offset', including 'offset'.
+ * If 'after'==0, returned node has elements up to 'offset'.
+ *                input node keeps elements after 'offset', including 'offset'.
+ *
+ * Or in other words:
+ * If 'after'==1, returned node will have elements after 'offset'.
+ *                The returned node will have elements [OFFSET+1, END].
+ *                The input node keeps elements [0, OFFSET].
+ * If 'after'==0, returned node will keep elements up to but not including 'offset'.
+ *                The returned node will have elements [0, OFFSET-1].
+ *                The input node keeps elements [OFFSET, END].
+ *
+ * The input node keeps all elements not taken by the returned node.
+ *
+ * Returns newly created node or NULL if split not possible. */
+REDIS_STATIC quicklistNode *_quicklistSplitNode(quicklistNode *node, int offset,
+                                                int after) {
+    size_t zl_sz = node->sz;
+
+    quicklistNode *new_node = quicklistCreateNode();
+    new_node->zl = zmalloc(zl_sz);
+
+    /* Copy original ziplist so we can split it */
+    memcpy(new_node->zl, node->zl, zl_sz);
+
+    /* Ranges to be trimmed: -1 here means "continue deleting until the list ends" */
+    int orig_start = after ? offset + 1 : 0;
+    int orig_extent = after ? -1 : offset;
+    int new_start = after ? 0 : offset;
+    int new_extent = after ? offset + 1 : -1;
+
+    D("After %d (%d); ranges: [%d, %d], [%d, %d]", after, offset, orig_start,
+      orig_extent, new_start, new_extent);
+
+    node->zl = ziplistDeleteRange(node->zl, orig_start, orig_extent);
+    node->count = ziplistLen(node->zl);
+    quicklistNodeUpdateSz(node);
+
+    new_node->zl = ziplistDeleteRange(new_node->zl, new_start, new_extent);
+    new_node->count = ziplistLen(new_node->zl);
+    quicklistNodeUpdateSz(new_node);
+
+    D("After split lengths: orig (%d), new (%d)", node->count, new_node->count);
+    return new_node;
+}
+
+/* Insert a new entry before or after existing entry 'entry'.
+ *
+ * If after==1, the new value is inserted after 'entry', otherwise
+ * the new value is inserted before 'entry'. */
+REDIS_STATIC void _quicklistInsert(quicklist *quicklist, quicklistEntry *entry,
+                                   void *value, const size_t sz, int after) {
+    int full = 0, at_tail = 0, at_head = 0, full_next = 0, full_prev = 0;
+    int fill = quicklist->fill;
+    quicklistNode *node = entry->node;
+    quicklistNode *new_node = NULL;
+    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
+
+    if (!node) {
+        /* we have no reference node, so let's create only node in the list */
+        D("No node given!");
+        new_node = quicklistCreateNode();
+        new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
+        __quicklistInsertNode(quicklist, NULL, new_node, after);
+        new_node->count++;
+        quicklist->count++;
+        return;
+    }
+
+    /* Populate accounting flags for easier boolean checks later */
+    if (!_quicklistNodeAllowInsert(node, fill, sz)) {
+        D("Current node is full with count %d with requested fill %lu",
+          node->count, fill);
+        full = 1;
+    }
+
+    if (after && (entry->offset == node->count)) {
+        D("At Tail of current ziplist");
+        at_tail = 1;
+        if (!_quicklistNodeAllowInsert(node->next, fill, sz)) {
+            D("Next node is full too.");
+            full_next = 1;
+        }
+    }
+
+    if (!after && (entry->offset == 0)) {
+        D("At Head");
+        at_head = 1;
+        if (!_quicklistNodeAllowInsert(node->prev, fill, sz)) {
+            D("Prev node is full too.");
+            full_prev = 1;
+        }
+    }
+
+    /* Now determine where and how to insert the new element */
+    if (!full && after) {
+        D("Not full, inserting after current position.");
+        quicklistDecompressNodeForUse(node);
+        unsigned char *next = ziplistNext(node->zl, entry->zi);
+        if (next == NULL) {
+            node->zl = ziplistPush(node->zl, value, sz, ZIPLIST_TAIL);
+        } else {
+            node->zl = ziplistInsert(node->zl, next, value, sz);
+        }
+        node->count++;
+        quicklistNodeUpdateSz(node);
+        quicklistRecompressOnly(quicklist, node);
+    } else if (!full && !after) {
+        D("Not full, inserting before current position.");
+        quicklistDecompressNodeForUse(node);
+        node->zl = ziplistInsert(node->zl, entry->zi, value, sz);
+        node->count++;
+        quicklistNodeUpdateSz(node);
+        quicklistRecompressOnly(quicklist, node);
+    } else if (full && at_tail && node->next && !full_next && after) {
+        /* If we are: at tail, next has free space, and inserting after:
+         *   - insert entry at head of next node. */
+        D("Full and tail, but next isn't full; inserting next node head");
+        new_node = node->next;
+        quicklistDecompressNodeForUse(new_node);
+        new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_HEAD);
+        new_node->count++;
+        quicklistNodeUpdateSz(new_node);
+        quicklistRecompressOnly(quicklist, new_node);
+    } else if (full && at_head && node->prev && !full_prev && !after) {
+        /* If we are: at head, previous has free space, and inserting before:
+         *   - insert entry at tail of previous node. */
+        D("Full and head, but prev isn't full, inserting prev node tail");
+        new_node = node->prev;
+        quicklistDecompressNodeForUse(new_node);
+        new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_TAIL);
+        new_node->count++;
+        quicklistNodeUpdateSz(new_node);
+        quicklistRecompressOnly(quicklist, new_node);
+    } else if (full && ((at_tail && node->next && full_next && after) ||
+                        (at_head && node->prev && full_prev && !after))) {
+        /* If we are: full, and our prev/next is full, then:
+         *   - create new node and attach to quicklist */
+        D("\tprovisioning new node...");
+        new_node = quicklistCreateNode();
+        new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
+        new_node->count++;
+        quicklistNodeUpdateSz(new_node);
+        __quicklistInsertNode(quicklist, node, new_node, after);
+    } else if (full) {
+        /* else, node is full we need to split it. */
+        /* covers both after and !after cases */
+        D("\tsplitting node...");
+        quicklistDecompressNodeForUse(node);
+        new_node = _quicklistSplitNode(node, entry->offset, after);
+        new_node->zl = ziplistPush(new_node->zl, value, sz,
+                                   after ? ZIPLIST_HEAD : ZIPLIST_TAIL);
+        new_node->count++;
+        quicklistNodeUpdateSz(new_node);
+        __quicklistInsertNode(quicklist, node, new_node, after);
+        _quicklistMergeNodes(quicklist, node);
+    }
+
+    quicklist->count++;
+}
+
+void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *entry,
+                           void *value, const size_t sz) {
+    _quicklistInsert(quicklist, entry, value, sz, 0);
+}
+
+void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *entry,
+                          void *value, const size_t sz) {
+    _quicklistInsert(quicklist, entry, value, sz, 1);
+}
+
+/* Delete a range of elements from the quicklist.
+ *
+ * elements may span across multiple quicklistNodes, so we
+ * have to be careful about tracking where we start and end.
+ *
+ * Returns 1 if entries were deleted, 0 if nothing was deleted. */
+int quicklistDelRange(quicklist *quicklist, const long start,
+                      const long count) {
+    if (count <= 0)
+        return 0;
+
+    unsigned long extent = count; /* range is inclusive of start position */
+
+    if (start >= 0 && extent > (quicklist->count - start)) {
+        /* if requesting delete more elements than exist, limit to list size. */
+        extent = quicklist->count - start;
+    } else if (start < 0 && extent > (unsigned long)(-start)) {
+        /* else, if at negative offset, limit max size to rest of list. */
+        extent = -start; /* c.f. LREM -29 29; just delete until end. */
+    }
+
+    quicklistEntry entry;
+    if (!quicklistIndex(quicklist, start, &entry))
+        return 0;
+
+    D("Quicklist delete request for start %ld, count %ld, extent: %ld", start,
+      count, extent);
+    quicklistNode *node = entry.node;
+
+    /* iterate over next nodes until everything is deleted. */
+    while (extent) {
+        quicklistNode *next = node->next;
+
+        unsigned long del;
+        int delete_entire_node = 0;
+        if (entry.offset == 0 && extent >= node->count) {
+            /* If we are deleting more than the count of this node, we
+             * can just delete the entire node without ziplist math. */
+            delete_entire_node = 1;
+            del = node->count;
+        } else if (entry.offset >= 0 && extent + entry.offset >= node->count) {
+            /* If deleting more nodes after this one, calculate delete based
+             * on size of current node. */
+            del = node->count - entry.offset;
+        } else if (entry.offset < 0) {
+            /* If offset is negative, we are in the first run of this loop
+             * and we are deleting the entire range
+             * from this start offset to end of list.  Since the Negative
+             * offset is the number of elements until the tail of the list,
+             * just use it directly as the deletion count. */
+            del = -entry.offset;
+
+            /* If the positive offset is greater than the remaining extent,
+             * we only delete the remaining extent, not the entire offset.
+             */
+            if (del > extent)
+                del = extent;
+        } else {
+            /* else, we are deleting less than the extent of this node, so
+             * use extent directly. */
+            del = extent;
+        }
+
+        D("[%ld]: asking to del: %ld because offset: %d; (ENTIRE NODE: %d), "
+          "node count: %u",
+          extent, del, entry.offset, delete_entire_node, node->count);
+
+        if (delete_entire_node) {
+            __quicklistDelNode(quicklist, node);
+        } else {
+            quicklistDecompressNodeForUse(node);
+            node->zl = ziplistDeleteRange(node->zl, entry.offset, del);
+            quicklistNodeUpdateSz(node);
+            node->count -= del;
+            quicklist->count -= del;
+            quicklistDeleteIfEmpty(quicklist, node);
+            if (node)
+                quicklistRecompressOnly(quicklist, node);
+        }
+
+        extent -= del;
+
+        node = next;
+
+        entry.offset = 0;
+    }
+    return 1;
+}
+
+/* Passthrough to ziplistCompare() */
+int quicklistCompare(unsigned char *p1, unsigned char *p2, int p2_len) {
+    return ziplistCompare(p1, p2, p2_len);
+}
+
+/* Returns a quicklist iterator 'iter'. After the initialization every
+ * call to quicklistNext() will return the next element of the quicklist. */
+quicklistIter *quicklistGetIterator(const quicklist *quicklist, int direction) {
+    quicklistIter *iter;
+
+    iter = zmalloc(sizeof(*iter));
+
+    if (direction == AL_START_HEAD) {
+        iter->current = quicklist->head;
+        iter->offset = 0;
+    } else if (direction == AL_START_TAIL) {
+        iter->current = quicklist->tail;
+        iter->offset = -1;
+    }
+
+    iter->direction = direction;
+    iter->quicklist = quicklist;
+
+    iter->zi = NULL;
+
+    return iter;
+}
+
+/* Initialize an iterator at a specific offset 'idx' and make the iterator
+ * return nodes in 'direction' direction. */
+quicklistIter *quicklistGetIteratorAtIdx(const quicklist *quicklist,
+                                         const int direction,
+                                         const long long idx) {
+    quicklistEntry entry;
+
+    if (quicklistIndex(quicklist, idx, &entry)) {
+        quicklistIter *base = quicklistGetIterator(quicklist, direction);
+        base->zi = NULL;
+        base->current = entry.node;
+        base->offset = entry.offset;
+        return base;
+    } else {
+        return NULL;
+    }
+}
+
+/* Release iterator.
+ * If we still have a valid current node, then re-encode current node. */
+void quicklistReleaseIterator(quicklistIter *iter) {
+    if (iter->current)
+        quicklistCompress(iter->quicklist, iter->current);
+
+    zfree(iter);
+}
+
+/* Get next element in iterator.
+ *
+ * Note: You must NOT insert into the list while iterating over it.
+ * You *may* delete from the list while iterating using the
+ * quicklistDelEntry() function.
+ * If you insert into the quicklist while iterating, you should
+ * re-create the iterator after your addition.
+ *
+ * iter = quicklistGetIterator(quicklist,<direction>);
+ * quicklistEntry entry;
+ * while (quicklistNext(iter, &entry)) {
+ *     if (entry.value)
+ *          [[ use entry.value with entry.sz ]]
+ *     else
+ *          [[ use entry.longval ]]
+ * }
+ *
+ * Populates 'entry' with values for this iteration.
+ * Returns 0 when iteration is complete or if iteration not possible.
+ * If return value is 0, the contents of 'entry' are not valid.
+ */
+int quicklistNext(quicklistIter *iter, quicklistEntry *entry) {
+    initEntry(entry);
+
+    if (!iter) {
+        D("Returning because no iter!");
+        return 0;
+    }
+
+    entry->quicklist = iter->quicklist;
+    entry->node = iter->current;
+
+    if (!iter->current) {
+        D("Returning because current node is NULL")
+        return 0;
+    }
+
+    unsigned char *(*nextFn)(unsigned char *, unsigned char *) = NULL;
+    int offset_update = 0;
+
+    if (!iter->zi) {
+        /* If !zi, use current index. */
+        quicklistDecompressNodeForUse(iter->current);
+        iter->zi = ziplistIndex(iter->current->zl, iter->offset);
+    } else {
+        /* else, use existing iterator offset and get prev/next as necessary. */
+        if (iter->direction == AL_START_HEAD) {
+            nextFn = ziplistNext;
+            offset_update = 1;
+        } else if (iter->direction == AL_START_TAIL) {
+            nextFn = ziplistPrev;
+            offset_update = -1;
+        }
+        iter->zi = nextFn(iter->current->zl, iter->zi);
+        iter->offset += offset_update;
+    }
+
+    entry->zi = iter->zi;
+    entry->offset = iter->offset;
+
+    if (iter->zi) {
+        /* Populate value from existing ziplist position */
+        ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval);
+        return 1;
+    } else {
+        /* We ran out of ziplist entries.
+         * Pick next node, update offset, then re-run retrieval. */
+        quicklistCompress(iter->quicklist, iter->current);
+        if (iter->direction == AL_START_HEAD) {
+            /* Forward traversal */
+            D("Jumping to start of next node");
+            iter->current = iter->current->next;
+            iter->offset = 0;
+        } else if (iter->direction == AL_START_TAIL) {
+            /* Reverse traversal */
+            D("Jumping to end of previous node");
+            iter->current = iter->current->prev;
+            iter->offset = -1;
+        }
+        iter->zi = NULL;
+        return quicklistNext(iter, entry);
+    }
+}
+
+/* Duplicate the quicklist.
+ * On success a copy of the original quicklist is returned.
+ *
+ * The original quicklist both on success or error is never modified.
+ *
+ * Returns newly allocated quicklist. */
+quicklist *quicklistDup(quicklist *orig) {
+    quicklist *copy;
+
+    copy = quicklistNew(orig->fill, orig->compress);
+
+    for (quicklistNode *current = orig->head; current;
+         current = current->next) {
+        quicklistNode *node = quicklistCreateNode();
+
+        if (current->encoding == QUICKLIST_NODE_ENCODING_LZF) {
+            quicklistLZF *lzf = (quicklistLZF *)current->zl;
+            size_t lzf_sz = sizeof(*lzf) + lzf->sz;
+            node->zl = zmalloc(lzf_sz);
+            memcpy(node->zl, current->zl, lzf_sz);
+        } else if (current->encoding == QUICKLIST_NODE_ENCODING_RAW) {
+            node->zl = zmalloc(current->sz);
+            memcpy(node->zl, current->zl, current->sz);
+        }
+
+        node->count = current->count;
+        copy->count += node->count;
+        node->sz = current->sz;
+        node->encoding = current->encoding;
+
+        _quicklistInsertNodeAfter(copy, copy->tail, node);
+    }
+
+    /* copy->count must equal orig->count here */
+    return copy;
+}
+
+/* Populate 'entry' with the element at the specified zero-based index
+ * where 0 is the head, 1 is the element next to head
+ * and so on. Negative integers are used in order to count
+ * from the tail, -1 is the last element, -2 the penultimate
+ * and so on. If the index is out of range 0 is returned.
+ *
+ * Returns 1 if element found
+ * Returns 0 if element not found */
+int quicklistIndex(const quicklist *quicklist, const long long idx,
+                   quicklistEntry *entry) {
+    quicklistNode *n;
+    unsigned long long accum = 0;
+    unsigned long long index;
+    int forward = idx < 0 ? 0 : 1; /* < 0 -> reverse, 0+ -> forward */
+
+    initEntry(entry);
+    entry->quicklist = quicklist;
+
+    if (!forward) {
+        index = (-idx) - 1;
+        n = quicklist->tail;
+    } else {
+        index = idx;
+        n = quicklist->head;
+    }
+
+    if (index >= quicklist->count)
+        return 0;
+
+    while (likely(n)) {
+        if ((accum + n->count) > index) {
+            break;
+        } else {
+            D("Skipping over (%p) %u at accum %lld", (void *)n, n->count,
+              accum);
+            accum += n->count;
+            n = forward ? n->next : n->prev;
+        }
+    }
+
+    if (!n)
+        return 0;
+
+    D("Found node: %p at accum %llu, idx %llu, sub+ %llu, sub- %llu", (void *)n,
+      accum, index, index - accum, (-index) - 1 + accum);
+
+    entry->node = n;
+    if (forward) {
+        /* forward = normal head-to-tail offset. */
+        entry->offset = index - accum;
+    } else {
+        /* reverse = need negative offset for tail-to-head, so undo
+         * the result of the original if (index < 0) above. */
+        entry->offset = (-index) - 1 + accum;
+    }
+
+    quicklistDecompressNodeForUse(entry->node);
+    entry->zi = ziplistIndex(entry->node->zl, entry->offset);
+    if (!ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval))
+        assert(0); /* This can happen on corrupt ziplist with fake entry count. */
+    /* The caller will use our result, so we don't re-compress here.
+     * The caller can recompress or delete the node as needed. */
+    return 1;
+}
+
+/* Rotate quicklist by moving the tail element to the head. */
+void quicklistRotate(quicklist *quicklist) {
+    if (quicklist->count <= 1)
+        return;
+
+    /* First, get the tail entry */
+    unsigned char *p = ziplistIndex(quicklist->tail->zl, -1);
+    unsigned char *value, *tmp;
+    long long longval;
+    unsigned int sz;
+    char longstr[32] = {0};
+    ziplistGet(p, &tmp, &sz, &longval);
+
+    /* If value found is NULL, then ziplistGet populated longval instead */
+    if (!tmp) {
+        /* Write the longval as a string so we can re-add it */
+        sz = ll2string(longstr, sizeof(longstr), longval);
+        value = (unsigned char *)longstr;
+    } else if (quicklist->len == 1) {
+        /* Copy buffer since there could be a memory overlap when move
+         * entity from tail to head in the same ziplist. */
+        value = zmalloc(sz);
+        memcpy(value, tmp, sz);
+    } else {
+        value = tmp;
+    }
+
+    /* Add tail entry to head (must happen before tail is deleted). */
+    quicklistPushHead(quicklist, value, sz);
+
+    /* If quicklist has only one node, the head ziplist is also the
+     * tail ziplist and PushHead() could have reallocated our single ziplist,
+     * which would make our pre-existing 'p' unusable. */
+    if (quicklist->len == 1) {
+        p = ziplistIndex(quicklist->tail->zl, -1);
+    }
+
+    /* Remove tail entry. */
+    quicklistDelIndex(quicklist, quicklist->tail, &p);
+    if (value != (unsigned char*)longstr && value != tmp)
+        zfree(value);
+}
+
+/* pop from quicklist and return result in 'data' ptr.  Value of 'data'
+ * is the return value of 'saver' function pointer if the data is NOT a number.
+ *
+ * If the quicklist element is a long long, then the return value is returned in
+ * 'sval'.
+ *
+ * Return value of 0 means no elements available.
+ * Return value of 1 means check 'data' and 'sval' for values.
+ * If 'data' is set, use 'data' and 'sz'.  Otherwise, use 'sval'. */
+int quicklistPopCustom(quicklist *quicklist, int where, unsigned char **data,
+                       unsigned int *sz, long long *sval,
+                       void *(*saver)(unsigned char *data, unsigned int sz)) {
+    unsigned char *p;
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vlong;
+    int pos = (where == QUICKLIST_HEAD) ? 0 : -1;
+
+    if (quicklist->count == 0)
+        return 0;
+
+    if (data)
+        *data = NULL;
+    if (sz)
+        *sz = 0;
+    if (sval)
+        *sval = -123456789;
+
+    quicklistNode *node;
+    if (where == QUICKLIST_HEAD && quicklist->head) {
+        node = quicklist->head;
+    } else if (where == QUICKLIST_TAIL && quicklist->tail) {
+        node = quicklist->tail;
+    } else {
+        return 0;
+    }
+
+    p = ziplistIndex(node->zl, pos);
+    if (ziplistGet(p, &vstr, &vlen, &vlong)) {
+        if (vstr) {
+            if (data)
+                *data = saver(vstr, vlen);
+            if (sz)
+                *sz = vlen;
+        } else {
+            if (data)
+                *data = NULL;
+            if (sval)
+                *sval = vlong;
+        }
+        quicklistDelIndex(quicklist, node, &p);
+        return 1;
+    }
+    return 0;
+}
+
+/* Return a malloc'd copy of data passed in */
+REDIS_STATIC void *_quicklistSaver(unsigned char *data, unsigned int sz) {
+    unsigned char *vstr;
+    if (data) {
+        vstr = zmalloc(sz);
+        memcpy(vstr, data, sz);
+        return vstr;
+    }
+    return NULL;
+}
+
+/* Default pop function
+ *
+ * Returns malloc'd value from quicklist */
+int quicklistPop(quicklist *quicklist, int where, unsigned char **data,
+                 unsigned int *sz, long long *slong) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vlong;
+    if (quicklist->count == 0)
+        return 0;
+    int ret = quicklistPopCustom(quicklist, where, &vstr, &vlen, &vlong,
+                                 _quicklistSaver);
+    if (data)
+        *data = vstr;
+    if (slong)
+        *slong = vlong;
+    if (sz)
+        *sz = vlen;
+    return ret;
+}
+
+/* Wrapper to allow argument-based switching between HEAD/TAIL pop */
+void quicklistPush(quicklist *quicklist, void *value, const size_t sz,
+                   int where) {
+    if (where == QUICKLIST_HEAD) {
+        quicklistPushHead(quicklist, value, sz);
+    } else if (where == QUICKLIST_TAIL) {
+        quicklistPushTail(quicklist, value, sz);
+    }
+}
+
+/* Create or update a bookmark in the list which will be updated to the next node
+ * automatically when the one referenced gets deleted.
+ * Returns 1 on success (creation of new bookmark or override of an existing one).
+ * Returns 0 on failure (reached the maximum supported number of bookmarks).
+ * NOTE: use short simple names, so that string compare on find is quick.
+ * NOTE: bookmark creation may re-allocate the quicklist, so the input pointer
+         may change and it's the caller responsibilty to update the reference.
+ */
+int quicklistBookmarkCreate(quicklist **ql_ref, const char *name, quicklistNode *node) {
+    quicklist *ql = *ql_ref;
+    if (ql->bookmark_count >= QL_MAX_BM)
+        return 0;
+    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
+    if (bm) {
+        bm->node = node;
+        return 1;
+    }
+    ql = zrealloc(ql, sizeof(quicklist) + (ql->bookmark_count+1) * sizeof(quicklistBookmark));
+    *ql_ref = ql;
+    ql->bookmarks[ql->bookmark_count].node = node;
+    ql->bookmarks[ql->bookmark_count].name = zstrdup(name);
+    ql->bookmark_count++;
+    return 1;
+}
+
+/* Find the quicklist node referenced by a named bookmark.
+ * When the bookmarked node is deleted the bookmark is updated to the next node,
+ * and if that's the last node, the bookmark is deleted (so find returns NULL). */
+quicklistNode *quicklistBookmarkFind(quicklist *ql, const char *name) {
+    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
+    if (!bm) return NULL;
+    return bm->node;
+}
+
+/* Delete a named bookmark.
+ * returns 0 if bookmark was not found, and 1 if deleted.
+ * Note that the bookmark memory is not freed yet, and is kept for future use. */
+int quicklistBookmarkDelete(quicklist *ql, const char *name) {
+    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
+    if (!bm)
+        return 0;
+    _quicklistBookmarkDelete(ql, bm);
+    return 1;
+}
+
+quicklistBookmark *_quicklistBookmarkFindByName(quicklist *ql, const char *name) {
+    unsigned i;
+    for (i=0; i<ql->bookmark_count; i++) {
+        if (!strcmp(ql->bookmarks[i].name, name)) {
+            return &ql->bookmarks[i];
+        }
+    }
+    return NULL;
+}
+
+quicklistBookmark *_quicklistBookmarkFindByNode(quicklist *ql, quicklistNode *node) {
+    unsigned i;
+    for (i=0; i<ql->bookmark_count; i++) {
+        if (ql->bookmarks[i].node == node) {
+            return &ql->bookmarks[i];
+        }
+    }
+    return NULL;
+}
+
+void _quicklistBookmarkDelete(quicklist *ql, quicklistBookmark *bm) {
+    int index = bm - ql->bookmarks;
+    zfree(bm->name);
+    ql->bookmark_count--;
+    memmove(bm, bm+1, (ql->bookmark_count - index)* sizeof(*bm));
+    /* NOTE: We do not shrink (realloc) the quicklist yet (to avoid resonance,
+     * it may be re-used later (a call to realloc may NOP). */
+}
+
+void quicklistBookmarksClear(quicklist *ql) {
+    while (ql->bookmark_count)
+        zfree(ql->bookmarks[--ql->bookmark_count].name);
+    /* NOTE: We do not shrink (realloc) the quick list. main use case for this
+     * function is just before releasing the allocation. */
+}
+
+/* The rest of this file is test cases and test helpers. */
+#ifdef REDIS_TEST
+#include <stdint.h>
+#include <sys/time.h>
+
+#define yell(str, ...) printf("ERROR! " str "\n\n", __VA_ARGS__)
+
+#define ERROR                                                                  \
+    do {                                                                       \
+        printf("\tERROR!\n");                                                  \
+        err++;                                                                 \
+    } while (0)
+
+#define ERR(x, ...)                                                            \
+    do {                                                                       \
+        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
+        printf("ERROR! " x "\n", __VA_ARGS__);                                 \
+        err++;                                                                 \
+    } while (0)
+
+#define TEST(name) printf("test — %s\n", name);
+#define TEST_DESC(name, ...) printf("test — " name "\n", __VA_ARGS__);
+
+#define QL_TEST_VERBOSE 0
+
+#define UNUSED(x) (void)(x)
+static void ql_info(quicklist *ql) {
+#if QL_TEST_VERBOSE
+    printf("Container length: %lu\n", ql->len);
+    printf("Container size: %lu\n", ql->count);
+    if (ql->head)
+        printf("\t(zsize head: %d)\n", ziplistLen(ql->head->zl));
+    if (ql->tail)
+        printf("\t(zsize tail: %d)\n", ziplistLen(ql->tail->zl));
+    printf("\n");
+#else
+    UNUSED(ql);
+#endif
+}
+
+/* Return the UNIX time in microseconds */
+static long long ustime(void) {
+    struct timeval tv;
+    long long ust;
+
+    gettimeofday(&tv, NULL);
+    ust = ((long long)tv.tv_sec) * 1000000;
+    ust += tv.tv_usec;
+    return ust;
+}
+
+/* Return the UNIX time in milliseconds */
+static long long mstime(void) { return ustime() / 1000; }
+
+/* Iterate over an entire quicklist.
+ * Print the list if 'print' == 1.
+ *
+ * Returns physical count of elements found by iterating over the list. */
+static int _itrprintr(quicklist *ql, int print, int forward) {
+    quicklistIter *iter =
+        quicklistGetIterator(ql, forward ? AL_START_HEAD : AL_START_TAIL);
+    quicklistEntry entry;
+    int i = 0;
+    int p = 0;
+    quicklistNode *prev = NULL;
+    while (quicklistNext(iter, &entry)) {
+        if (entry.node != prev) {
+            /* Count the number of list nodes too */
+            p++;
+            prev = entry.node;
+        }
+        if (print) {
+            printf("[%3d (%2d)]: [%.*s] (%lld)\n", i, p, entry.sz,
+                   (char *)entry.value, entry.longval);
+        }
+        i++;
+    }
+    quicklistReleaseIterator(iter);
+    return i;
+}
+static int itrprintr(quicklist *ql, int print) {
+    return _itrprintr(ql, print, 1);
+}
+
+static int itrprintr_rev(quicklist *ql, int print) {
+    return _itrprintr(ql, print, 0);
+}
+
+#define ql_verify(a, b, c, d, e)                                               \
+    do {                                                                       \
+        err += _ql_verify((a), (b), (c), (d), (e));                            \
+    } while (0)
+
+/* Verify list metadata matches physical list contents. */
+static int _ql_verify(quicklist *ql, uint32_t len, uint32_t count,
+                      uint32_t head_count, uint32_t tail_count) {
+    int errors = 0;
+
+    ql_info(ql);
+    if (len != ql->len) {
+        yell("quicklist length wrong: expected %d, got %lu", len, ql->len);
+        errors++;
+    }
+
+    if (count != ql->count) {
+        yell("quicklist count wrong: expected %d, got %lu", count, ql->count);
+        errors++;
+    }
+
+    int loopr = itrprintr(ql, 0);
+    if (loopr != (int)ql->count) {
+        yell("quicklist cached count not match actual count: expected %lu, got "
+             "%d",
+             ql->count, loopr);
+        errors++;
+    }
+
+    int rloopr = itrprintr_rev(ql, 0);
+    if (loopr != rloopr) {
+        yell("quicklist has different forward count than reverse count!  "
+             "Forward count is %d, reverse count is %d.",
+             loopr, rloopr);
+        errors++;
+    }
+
+    if (ql->len == 0 && !errors) {
+        return errors;
+    }
+
+    if (ql->head && head_count != ql->head->count &&
+        head_count != ziplistLen(ql->head->zl)) {
+        yell("quicklist head count wrong: expected %d, "
+             "got cached %d vs. actual %d",
+             head_count, ql->head->count, ziplistLen(ql->head->zl));
+        errors++;
+    }
+
+    if (ql->tail && tail_count != ql->tail->count &&
+        tail_count != ziplistLen(ql->tail->zl)) {
+        yell("quicklist tail count wrong: expected %d, "
+             "got cached %u vs. actual %d",
+             tail_count, ql->tail->count, ziplistLen(ql->tail->zl));
+        errors++;
+    }
+
+    if (quicklistAllowsCompression(ql)) {
+        quicklistNode *node = ql->head;
+        unsigned int low_raw = ql->compress;
+        unsigned int high_raw = ql->len - ql->compress;
+
+        for (unsigned int at = 0; at < ql->len; at++, node = node->next) {
+            if (node && (at < low_raw || at >= high_raw)) {
+                if (node->encoding != QUICKLIST_NODE_ENCODING_RAW) {
+                    yell("Incorrect compression: node %d is "
+                         "compressed at depth %d ((%u, %u); total "
+                         "nodes: %lu; size: %u; recompress: %d)",
+                         at, ql->compress, low_raw, high_raw, ql->len, node->sz,
+                         node->recompress);
+                    errors++;
+                }
+            } else {
+                if (node->encoding != QUICKLIST_NODE_ENCODING_LZF &&
+                    !node->attempted_compress) {
+                    yell("Incorrect non-compression: node %d is NOT "
+                         "compressed at depth %d ((%u, %u); total "
+                         "nodes: %lu; size: %u; recompress: %d; attempted: %d)",
+                         at, ql->compress, low_raw, high_raw, ql->len, node->sz,
+                         node->recompress, node->attempted_compress);
+                    errors++;
+                }
+            }
+        }
+    }
+
+    return errors;
+}
+
+/* Generate new string concatenating integer i against string 'prefix' */
+static char *genstr(char *prefix, int i) {
+    static char result[64] = {0};
+    snprintf(result, sizeof(result), "%s%d", prefix, i);
+    return result;
+}
+
+/* main test, but callable from other files */
+int quicklistTest(int argc, char *argv[], int accurate) {
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    unsigned int err = 0;
+    int optimize_start =
+        -(int)(sizeof(optimization_level) / sizeof(*optimization_level));
+
+    printf("Starting optimization offset at: %d\n", optimize_start);
+
+    int options[] = {0, 1, 2, 3, 4, 5, 6, 10};
+    int fills[] = {-5, -4, -3, -2, -1, 0,
+                   1, 2, 32, 66, 128, 999};
+    size_t option_count = sizeof(options) / sizeof(*options);
+    int fill_count = (int)(sizeof(fills) / sizeof(*fills));
+    long long runtime[option_count];
+
+    for (int _i = 0; _i < (int)option_count; _i++) {
+        printf("Testing Compression option %d\n", options[_i]);
+        long long start = mstime();
+
+        TEST("create list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("add to tail of empty list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushTail(ql, "hello", 6);
+            /* 1 for head and 1 for tail because 1 node = head = tail */
+            ql_verify(ql, 1, 1, 1, 1);
+            quicklistRelease(ql);
+        }
+
+        TEST("add to head of empty list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushHead(ql, "hello", 6);
+            /* 1 for head and 1 for tail because 1 node = head = tail */
+            ql_verify(ql, 1, 1, 1, 1);
+            quicklistRelease(ql);
+        }
+
+        TEST_DESC("add to tail 5x at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 5; i++)
+                    quicklistPushTail(ql, genstr("hello", i), 32);
+                if (ql->count != 5)
+                    ERROR;
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 5, 5, 5);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("add to head 5x at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 5; i++)
+                    quicklistPushHead(ql, genstr("hello", i), 32);
+                if (ql->count != 5)
+                    ERROR;
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 5, 5, 5);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("add to tail 500x at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushTail(ql, genstr("hello", i), 64);
+                if (ql->count != 500)
+                    ERROR;
+                if (fills[f] == 32)
+                    ql_verify(ql, 16, 500, 32, 20);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("add to head 500x at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushHead(ql, genstr("hello", i), 32);
+                if (ql->count != 500)
+                    ERROR;
+                if (fills[f] == 32)
+                    ql_verify(ql, 16, 500, 20, 32);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST("rotate empty") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistRotate(ql);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("rotate one val once") {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                quicklistPushHead(ql, "hello", 6);
+                quicklistRotate(ql);
+                /* Ignore compression verify because ziplist is
+                 * too small to compress. */
+                ql_verify(ql, 1, 1, 1, 1);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("rotate 500 val 5000 times at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                quicklistPushHead(ql, "900", 3);
+                quicklistPushHead(ql, "7000", 4);
+                quicklistPushHead(ql, "-1200", 5);
+                quicklistPushHead(ql, "42", 2);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushHead(ql, genstr("hello", i), 64);
+                ql_info(ql);
+                for (int i = 0; i < 5000; i++) {
+                    ql_info(ql);
+                    quicklistRotate(ql);
+                }
+                if (fills[f] == 1)
+                    ql_verify(ql, 504, 504, 1, 1);
+                else if (fills[f] == 2)
+                    ql_verify(ql, 252, 504, 2, 2);
+                else if (fills[f] == 32)
+                    ql_verify(ql, 16, 504, 32, 24);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST("pop empty") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPop(ql, QUICKLIST_HEAD, NULL, NULL, NULL);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("pop 1 string from 1") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            char *populate = genstr("hello", 331);
+            quicklistPushHead(ql, populate, 32);
+            unsigned char *data;
+            unsigned int sz;
+            long long lv;
+            ql_info(ql);
+            quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
+            assert(data != NULL);
+            assert(sz == 32);
+            if (strcmp(populate, (char *)data))
+                ERR("Pop'd value (%.*s) didn't equal original value (%s)", sz,
+                    data, populate);
+            zfree(data);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("pop head 1 number from 1") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushHead(ql, "55513", 5);
+            unsigned char *data;
+            unsigned int sz;
+            long long lv;
+            ql_info(ql);
+            quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
+            assert(data == NULL);
+            assert(lv == 55513);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("pop head 500 from 500") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            for (int i = 0; i < 500; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            ql_info(ql);
+            for (int i = 0; i < 500; i++) {
+                unsigned char *data;
+                unsigned int sz;
+                long long lv;
+                int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
+                assert(ret == 1);
+                assert(data != NULL);
+                assert(sz == 32);
+                if (strcmp(genstr("hello", 499 - i), (char *)data))
+                    ERR("Pop'd value (%.*s) didn't equal original value (%s)",
+                        sz, data, genstr("hello", 499 - i));
+                zfree(data);
+            }
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("pop head 5000 from 500") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            for (int i = 0; i < 500; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            for (int i = 0; i < 5000; i++) {
+                unsigned char *data;
+                unsigned int sz;
+                long long lv;
+                int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
+                if (i < 500) {
+                    assert(ret == 1);
+                    assert(data != NULL);
+                    assert(sz == 32);
+                    if (strcmp(genstr("hello", 499 - i), (char *)data))
+                        ERR("Pop'd value (%.*s) didn't equal original value "
+                            "(%s)",
+                            sz, data, genstr("hello", 499 - i));
+                    zfree(data);
+                } else {
+                    assert(ret == 0);
+                }
+            }
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("iterate forward over 500 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
+            quicklistEntry entry;
+            int i = 499, count = 0;
+            while (quicklistNext(iter, &entry)) {
+                char *h = genstr("hello", i);
+                if (strcmp((char *)entry.value, h))
+                    ERR("value [%s] didn't match [%s] at position %d",
+                        entry.value, h, i);
+                i--;
+                count++;
+            }
+            if (count != 500)
+                ERR("Didn't iterate over exactly 500 elements (%d)", i);
+            ql_verify(ql, 16, 500, 20, 32);
+            quicklistReleaseIterator(iter);
+            quicklistRelease(ql);
+        }
+
+        TEST("iterate reverse over 500 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            quicklistIter *iter = quicklistGetIterator(ql, AL_START_TAIL);
+            quicklistEntry entry;
+            int i = 0;
+            while (quicklistNext(iter, &entry)) {
+                char *h = genstr("hello", i);
+                if (strcmp((char *)entry.value, h))
+                    ERR("value [%s] didn't match [%s] at position %d",
+                        entry.value, h, i);
+                i++;
+            }
+            if (i != 500)
+                ERR("Didn't iterate over exactly 500 elements (%d)", i);
+            ql_verify(ql, 16, 500, 20, 32);
+            quicklistReleaseIterator(iter);
+            quicklistRelease(ql);
+        }
+
+        TEST("insert before with 0 elements") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistEntry entry;
+            quicklistIndex(ql, 0, &entry);
+            quicklistInsertBefore(ql, &entry, "abc", 4);
+            ql_verify(ql, 1, 1, 1, 1);
+            quicklistRelease(ql);
+        }
+
+        TEST("insert after with 0 elements") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistEntry entry;
+            quicklistIndex(ql, 0, &entry);
+            quicklistInsertAfter(ql, &entry, "abc", 4);
+            ql_verify(ql, 1, 1, 1, 1);
+            quicklistRelease(ql);
+        }
+
+        TEST("insert after 1 element") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushHead(ql, "hello", 6);
+            quicklistEntry entry;
+            quicklistIndex(ql, 0, &entry);
+            quicklistInsertAfter(ql, &entry, "abc", 4);
+            ql_verify(ql, 1, 2, 2, 2);
+            quicklistRelease(ql);
+        }
+
+        TEST("insert before 1 element") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushHead(ql, "hello", 6);
+            quicklistEntry entry;
+            quicklistIndex(ql, 0, &entry);
+            quicklistInsertAfter(ql, &entry, "abc", 4);
+            ql_verify(ql, 1, 2, 2, 2);
+            quicklistRelease(ql);
+        }
+
+        TEST_DESC("insert once in elements while iterating at compress %d",
+                  options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                quicklistPushTail(ql, "abc", 3);
+                quicklistSetFill(ql, 1);
+                quicklistPushTail(ql, "def", 3); /* force to unique node */
+                quicklistSetFill(ql, f);
+                quicklistPushTail(ql, "bob", 3); /* force to reset for +3 */
+                quicklistPushTail(ql, "foo", 3);
+                quicklistPushTail(ql, "zoo", 3);
+
+                itrprintr(ql, 0);
+                /* insert "bar" before "bob" while iterating over list. */
+                quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
+                quicklistEntry entry;
+                while (quicklistNext(iter, &entry)) {
+                    if (!strncmp((char *)entry.value, "bob", 3)) {
+                        /* Insert as fill = 1 so it spills into new node. */
+                        quicklistInsertBefore(ql, &entry, "bar", 3);
+                        break; /* didn't we fix insert-while-iterating? */
+                    }
+                }
+                itrprintr(ql, 0);
+
+                /* verify results */
+                quicklistIndex(ql, 0, &entry);
+                if (strncmp((char *)entry.value, "abc", 3))
+                    ERR("Value 0 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistIndex(ql, 1, &entry);
+                if (strncmp((char *)entry.value, "def", 3))
+                    ERR("Value 1 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistIndex(ql, 2, &entry);
+                if (strncmp((char *)entry.value, "bar", 3))
+                    ERR("Value 2 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistIndex(ql, 3, &entry);
+                if (strncmp((char *)entry.value, "bob", 3))
+                    ERR("Value 3 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistIndex(ql, 4, &entry);
+                if (strncmp((char *)entry.value, "foo", 3))
+                    ERR("Value 4 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistIndex(ql, 5, &entry);
+                if (strncmp((char *)entry.value, "zoo", 3))
+                    ERR("Value 5 didn't match, instead got: %.*s", entry.sz,
+                        entry.value);
+                quicklistReleaseIterator(iter);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("insert [before] 250 new in middle of 500 elements at compress %d",
+                  options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushTail(ql, genstr("hello", i), 32);
+                for (int i = 0; i < 250; i++) {
+                    quicklistEntry entry;
+                    quicklistIndex(ql, 250, &entry);
+                    quicklistInsertBefore(ql, &entry, genstr("abc", i), 32);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 25, 750, 32, 20);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("insert [after] 250 new in middle of 500 elements at compress %d",
+                  options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushHead(ql, genstr("hello", i), 32);
+                for (int i = 0; i < 250; i++) {
+                    quicklistEntry entry;
+                    quicklistIndex(ql, 250, &entry);
+                    quicklistInsertAfter(ql, &entry, genstr("abc", i), 32);
+                }
+
+                if (ql->count != 750)
+                    ERR("List size not 750, but rather %ld", ql->count);
+
+                if (fills[f] == 32)
+                    ql_verify(ql, 26, 750, 20, 32);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST("duplicate empty list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklist *copy = quicklistDup(ql);
+            ql_verify(copy, 0, 0, 0, 0);
+            quicklistRelease(ql);
+            quicklistRelease(copy);
+        }
+
+        TEST("duplicate list of 1 element") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushHead(ql, genstr("hello", 3), 32);
+            ql_verify(ql, 1, 1, 1, 1);
+            quicklist *copy = quicklistDup(ql);
+            ql_verify(copy, 1, 1, 1, 1);
+            quicklistRelease(ql);
+            quicklistRelease(copy);
+        }
+
+        TEST("duplicate list of 500") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            ql_verify(ql, 16, 500, 20, 32);
+
+            quicklist *copy = quicklistDup(ql);
+            ql_verify(copy, 16, 500, 20, 32);
+            quicklistRelease(ql);
+            quicklistRelease(copy);
+        }
+
+        for (int f = 0; f < fill_count; f++) {
+            TEST_DESC("index 1,200 from 500 list at fill %d at compress %d", f,
+                      options[_i]) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
+                quicklistEntry entry;
+                quicklistIndex(ql, 1, &entry);
+                if (strcmp((char *)entry.value, "hello2") != 0)
+                    ERR("Value: %s", entry.value);
+                quicklistIndex(ql, 200, &entry);
+                if (strcmp((char *)entry.value, "hello201") != 0)
+                    ERR("Value: %s", entry.value);
+                quicklistRelease(ql);
+            }
+
+            TEST_DESC("index -1,-2 from 500 list at fill %d at compress %d",
+                      fills[f], options[_i]) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
+                quicklistEntry entry;
+                quicklistIndex(ql, -1, &entry);
+                if (strcmp((char *)entry.value, "hello500") != 0)
+                    ERR("Value: %s", entry.value);
+                quicklistIndex(ql, -2, &entry);
+                if (strcmp((char *)entry.value, "hello499") != 0)
+                    ERR("Value: %s", entry.value);
+                quicklistRelease(ql);
+            }
+
+            TEST_DESC("index -100 from 500 list at fill %d at compress %d",
+                      fills[f], options[_i]) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 500; i++)
+                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
+                quicklistEntry entry;
+                quicklistIndex(ql, -100, &entry);
+                if (strcmp((char *)entry.value, "hello401") != 0)
+                    ERR("Value: %s", entry.value);
+                quicklistRelease(ql);
+            }
+
+            TEST_DESC("index too big +1 from 50 list at fill %d at compress %d",
+                      fills[f], options[_i]) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                for (int i = 0; i < 50; i++)
+                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
+                quicklistEntry entry;
+                if (quicklistIndex(ql, 50, &entry))
+                    ERR("Index found at 50 with 50 list: %.*s", entry.sz,
+                        entry.value);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST("delete range empty list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistDelRange(ql, 5, 20);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete range of entire node in list of one node") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            for (int i = 0; i < 32; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            ql_verify(ql, 1, 32, 32, 32);
+            quicklistDelRange(ql, 0, 32);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete range of entire node with overflow counts") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            for (int i = 0; i < 32; i++)
+                quicklistPushHead(ql, genstr("hello", i), 32);
+            ql_verify(ql, 1, 32, 32, 32);
+            quicklistDelRange(ql, 0, 128);
+            ql_verify(ql, 0, 0, 0, 0);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete middle 100 of 500 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            ql_verify(ql, 16, 500, 32, 20);
+            quicklistDelRange(ql, 200, 100);
+            ql_verify(ql, 14, 400, 32, 20);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete less than fill but across nodes") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            ql_verify(ql, 16, 500, 32, 20);
+            quicklistDelRange(ql, 60, 10);
+            ql_verify(ql, 16, 490, 32, 20);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete negative 1 from 500 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            ql_verify(ql, 16, 500, 32, 20);
+            quicklistDelRange(ql, -1, 1);
+            ql_verify(ql, 16, 499, 32, 19);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete negative 1 from 500 list with overflow counts") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            ql_verify(ql, 16, 500, 32, 20);
+            quicklistDelRange(ql, -1, 128);
+            ql_verify(ql, 16, 499, 32, 19);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete negative 100 from 500 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 500; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            quicklistDelRange(ql, -100, 100);
+            ql_verify(ql, 13, 400, 32, 16);
+            quicklistRelease(ql);
+        }
+
+        TEST("delete -10 count 5 from 50 list") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            for (int i = 0; i < 50; i++)
+                quicklistPushTail(ql, genstr("hello", i + 1), 32);
+            ql_verify(ql, 2, 50, 32, 18);
+            quicklistDelRange(ql, -10, 5);
+            ql_verify(ql, 2, 45, 32, 13);
+            quicklistRelease(ql);
+        }
+
+        TEST("numbers only list read") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushTail(ql, "1111", 4);
+            quicklistPushTail(ql, "2222", 4);
+            quicklistPushTail(ql, "3333", 4);
+            quicklistPushTail(ql, "4444", 4);
+            ql_verify(ql, 1, 4, 4, 4);
+            quicklistEntry entry;
+            quicklistIndex(ql, 0, &entry);
+            if (entry.longval != 1111)
+                ERR("Not 1111, %lld", entry.longval);
+            quicklistIndex(ql, 1, &entry);
+            if (entry.longval != 2222)
+                ERR("Not 2222, %lld", entry.longval);
+            quicklistIndex(ql, 2, &entry);
+            if (entry.longval != 3333)
+                ERR("Not 3333, %lld", entry.longval);
+            quicklistIndex(ql, 3, &entry);
+            if (entry.longval != 4444)
+                ERR("Not 4444, %lld", entry.longval);
+            if (quicklistIndex(ql, 4, &entry))
+                ERR("Index past elements: %lld", entry.longval);
+            quicklistIndex(ql, -1, &entry);
+            if (entry.longval != 4444)
+                ERR("Not 4444 (reverse), %lld", entry.longval);
+            quicklistIndex(ql, -2, &entry);
+            if (entry.longval != 3333)
+                ERR("Not 3333 (reverse), %lld", entry.longval);
+            quicklistIndex(ql, -3, &entry);
+            if (entry.longval != 2222)
+                ERR("Not 2222 (reverse), %lld", entry.longval);
+            quicklistIndex(ql, -4, &entry);
+            if (entry.longval != 1111)
+                ERR("Not 1111 (reverse), %lld", entry.longval);
+            if (quicklistIndex(ql, -5, &entry))
+                ERR("Index past elements (reverse), %lld", entry.longval);
+            quicklistRelease(ql);
+        }
+
+        TEST("numbers larger list read") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistSetFill(ql, 32);
+            char num[32];
+            long long nums[5000];
+            for (int i = 0; i < 5000; i++) {
+                nums[i] = -5157318210846258176 + i;
+                int sz = ll2string(num, sizeof(num), nums[i]);
+                quicklistPushTail(ql, num, sz);
+            }
+            quicklistPushTail(ql, "xxxxxxxxxxxxxxxxxxxx", 20);
+            quicklistEntry entry;
+            for (int i = 0; i < 5000; i++) {
+                quicklistIndex(ql, i, &entry);
+                if (entry.longval != nums[i])
+                    ERR("[%d] Not longval %lld but rather %lld", i, nums[i],
+                        entry.longval);
+                entry.longval = 0xdeadbeef;
+            }
+            quicklistIndex(ql, 5000, &entry);
+            if (strncmp((char *)entry.value, "xxxxxxxxxxxxxxxxxxxx", 20))
+                ERR("String val not match: %s", entry.value);
+            ql_verify(ql, 157, 5001, 32, 9);
+            quicklistRelease(ql);
+        }
+
+        TEST("numbers larger list read B") {
+            quicklist *ql = quicklistNew(-2, options[_i]);
+            quicklistPushTail(ql, "99", 2);
+            quicklistPushTail(ql, "98", 2);
+            quicklistPushTail(ql, "xxxxxxxxxxxxxxxxxxxx", 20);
+            quicklistPushTail(ql, "96", 2);
+            quicklistPushTail(ql, "95", 2);
+            quicklistReplaceAtIndex(ql, 1, "foo", 3);
+            quicklistReplaceAtIndex(ql, -1, "bar", 3);
+            quicklistRelease(ql);
+        }
+
+        TEST_DESC("lrem test at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                char *words[] = {"abc", "foo", "bar",  "foobar", "foobared",
+                                 "zap", "bar", "test", "foo"};
+                char *result[] = {"abc", "foo",  "foobar", "foobared",
+                                  "zap", "test", "foo"};
+                char *resultB[] = {"abc",      "foo", "foobar",
+                                   "foobared", "zap", "test"};
+                for (int i = 0; i < 9; i++)
+                    quicklistPushTail(ql, words[i], strlen(words[i]));
+
+                /* lrem 0 bar */
+                quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
+                quicklistEntry entry;
+                int i = 0;
+                while (quicklistNext(iter, &entry)) {
+                    if (quicklistCompare(entry.zi, (unsigned char *)"bar", 3)) {
+                        quicklistDelEntry(iter, &entry);
+                    }
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+
+                /* check result of lrem 0 bar */
+                iter = quicklistGetIterator(ql, AL_START_HEAD);
+                i = 0;
+                while (quicklistNext(iter, &entry)) {
+                    /* Result must be: abc, foo, foobar, foobared, zap, test,
+                     * foo */
+                    if (strncmp((char *)entry.value, result[i], entry.sz)) {
+                        ERR("No match at position %d, got %.*s instead of %s",
+                            i, entry.sz, entry.value, result[i]);
+                    }
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+
+                quicklistPushTail(ql, "foo", 3);
+
+                /* lrem -2 foo */
+                iter = quicklistGetIterator(ql, AL_START_TAIL);
+                i = 0;
+                int del = 2;
+                while (quicklistNext(iter, &entry)) {
+                    if (quicklistCompare(entry.zi, (unsigned char *)"foo", 3)) {
+                        quicklistDelEntry(iter, &entry);
+                        del--;
+                    }
+                    if (!del)
+                        break;
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+
+                /* check result of lrem -2 foo */
+                /* (we're ignoring the '2' part and still deleting all foo
+                 * because
+                 * we only have two foo) */
+                iter = quicklistGetIterator(ql, AL_START_TAIL);
+                i = 0;
+                size_t resB = sizeof(resultB) / sizeof(*resultB);
+                while (quicklistNext(iter, &entry)) {
+                    /* Result must be: abc, foo, foobar, foobared, zap, test,
+                     * foo */
+                    if (strncmp((char *)entry.value, resultB[resB - 1 - i],
+                                entry.sz)) {
+                        ERR("No match at position %d, got %.*s instead of %s",
+                            i, entry.sz, entry.value, resultB[resB - 1 - i]);
+                    }
+                    i++;
+                }
+
+                quicklistReleaseIterator(iter);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("iterate reverse + delete at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                quicklistPushTail(ql, "abc", 3);
+                quicklistPushTail(ql, "def", 3);
+                quicklistPushTail(ql, "hij", 3);
+                quicklistPushTail(ql, "jkl", 3);
+                quicklistPushTail(ql, "oop", 3);
+
+                quicklistEntry entry;
+                quicklistIter *iter = quicklistGetIterator(ql, AL_START_TAIL);
+                int i = 0;
+                while (quicklistNext(iter, &entry)) {
+                    if (quicklistCompare(entry.zi, (unsigned char *)"hij", 3)) {
+                        quicklistDelEntry(iter, &entry);
+                    }
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+
+                if (i != 5)
+                    ERR("Didn't iterate 5 times, iterated %d times.", i);
+
+                /* Check results after deletion of "hij" */
+                iter = quicklistGetIterator(ql, AL_START_HEAD);
+                i = 0;
+                char *vals[] = {"abc", "def", "jkl", "oop"};
+                while (quicklistNext(iter, &entry)) {
+                    if (!quicklistCompare(entry.zi, (unsigned char *)vals[i],
+                                          3)) {
+                        ERR("Value at %d didn't match %s\n", i, vals[i]);
+                    }
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("iterator at index test at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                char num[32];
+                long long nums[5000];
+                for (int i = 0; i < 760; i++) {
+                    nums[i] = -5157318210846258176 + i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    quicklistPushTail(ql, num, sz);
+                }
+
+                quicklistEntry entry;
+                quicklistIter *iter =
+                    quicklistGetIteratorAtIdx(ql, AL_START_HEAD, 437);
+                int i = 437;
+                while (quicklistNext(iter, &entry)) {
+                    if (entry.longval != nums[i])
+                        ERR("Expected %lld, but got %lld", entry.longval,
+                            nums[i]);
+                    i++;
+                }
+                quicklistReleaseIterator(iter);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("ltrim test A at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                char num[32];
+                long long nums[5000];
+                for (int i = 0; i < 32; i++) {
+                    nums[i] = -5157318210846258176 + i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    quicklistPushTail(ql, num, sz);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 32, 32, 32);
+                /* ltrim 25 53 (keep [25,32] inclusive = 7 remaining) */
+                quicklistDelRange(ql, 0, 25);
+                quicklistDelRange(ql, 0, 0);
+                quicklistEntry entry;
+                for (int i = 0; i < 7; i++) {
+                    quicklistIndex(ql, i, &entry);
+                    if (entry.longval != nums[25 + i])
+                        ERR("Deleted invalid range!  Expected %lld but got "
+                            "%lld",
+                            entry.longval, nums[25 + i]);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 7, 7, 7);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("ltrim test B at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                /* Force-disable compression because our 33 sequential
+                 * integers don't compress and the check always fails. */
+                quicklist *ql = quicklistNew(fills[f], QUICKLIST_NOCOMPRESS);
+                char num[32];
+                long long nums[5000];
+                for (int i = 0; i < 33; i++) {
+                    nums[i] = i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    quicklistPushTail(ql, num, sz);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 2, 33, 32, 1);
+                /* ltrim 5 16 (keep [5,16] inclusive = 12 remaining) */
+                quicklistDelRange(ql, 0, 5);
+                quicklistDelRange(ql, -16, 16);
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 12, 12, 12);
+                quicklistEntry entry;
+                quicklistIndex(ql, 0, &entry);
+                if (entry.longval != 5)
+                    ERR("A: longval not 5, but %lld", entry.longval);
+                quicklistIndex(ql, -1, &entry);
+                if (entry.longval != 16)
+                    ERR("B! got instead: %lld", entry.longval);
+                quicklistPushTail(ql, "bobobob", 7);
+                quicklistIndex(ql, -1, &entry);
+                if (strncmp((char *)entry.value, "bobobob", 7))
+                    ERR("Tail doesn't match bobobob, it's %.*s instead",
+                        entry.sz, entry.value);
+                for (int i = 0; i < 12; i++) {
+                    quicklistIndex(ql, i, &entry);
+                    if (entry.longval != nums[5 + i])
+                        ERR("Deleted invalid range!  Expected %lld but got "
+                            "%lld",
+                            entry.longval, nums[5 + i]);
+                }
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("ltrim test C at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                char num[32];
+                long long nums[5000];
+                for (int i = 0; i < 33; i++) {
+                    nums[i] = -5157318210846258176 + i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    quicklistPushTail(ql, num, sz);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 2, 33, 32, 1);
+                /* ltrim 3 3 (keep [3,3] inclusive = 1 remaining) */
+                quicklistDelRange(ql, 0, 3);
+                quicklistDelRange(ql, -29,
+                                  4000); /* make sure not loop forever */
+                if (fills[f] == 32)
+                    ql_verify(ql, 1, 1, 1, 1);
+                quicklistEntry entry;
+                quicklistIndex(ql, 0, &entry);
+                if (entry.longval != -5157318210846258173)
+                    ERROR;
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("ltrim test D at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                quicklist *ql = quicklistNew(fills[f], options[_i]);
+                char num[32];
+                long long nums[5000];
+                for (int i = 0; i < 33; i++) {
+                    nums[i] = -5157318210846258176 + i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    quicklistPushTail(ql, num, sz);
+                }
+                if (fills[f] == 32)
+                    ql_verify(ql, 2, 33, 32, 1);
+                quicklistDelRange(ql, -12, 3);
+                if (ql->count != 30)
+                    ERR("Didn't delete exactly three elements!  Count is: %lu",
+                        ql->count);
+                quicklistRelease(ql);
+            }
+        }
+
+        TEST_DESC("create quicklist from ziplist at compress %d", options[_i]) {
+            for (int f = 0; f < fill_count; f++) {
+                unsigned char *zl = ziplistNew();
+                long long nums[64];
+                char num[64];
+                for (int i = 0; i < 33; i++) {
+                    nums[i] = -5157318210846258176 + i;
+                    int sz = ll2string(num, sizeof(num), nums[i]);
+                    zl =
+                        ziplistPush(zl, (unsigned char *)num, sz, ZIPLIST_TAIL);
+                }
+                for (int i = 0; i < 33; i++) {
+                    zl = ziplistPush(zl, (unsigned char *)genstr("hello", i),
+                                     32, ZIPLIST_TAIL);
+                }
+                quicklist *ql = quicklistCreateFromZiplist(fills[f], options[_i], zl);
+                if (fills[f] == 1)
+                    ql_verify(ql, 66, 66, 1, 1);
+                else if (fills[f] == 32)
+                    ql_verify(ql, 3, 66, 32, 2);
+                else if (fills[f] == 66)
+                    ql_verify(ql, 1, 66, 66, 66);
+                quicklistRelease(ql);
+            }
+        }
+
+        long long stop = mstime();
+        runtime[_i] = stop - start;
+    }
+
+    /* Run a longer test of compression depth outside of primary test loop. */
+    int list_sizes[] = {250, 251, 500, 999, 1000};
+    long long start = mstime();
+    int list_count = accurate ? (int)(sizeof(list_sizes) / sizeof(*list_sizes)) : 1;
+    for (int list = 0; list < list_count; list++) {
+        TEST_DESC("verify specific compression of interior nodes with %d list ",
+                  list_sizes[list]) {
+            for (int f = 0; f < fill_count; f++) {
+                for (int depth = 1; depth < 40; depth++) {
+                    /* skip over many redundant test cases */
+                    quicklist *ql = quicklistNew(fills[f], depth);
+                    for (int i = 0; i < list_sizes[list]; i++) {
+                        quicklistPushTail(ql, genstr("hello TAIL", i + 1), 64);
+                        quicklistPushHead(ql, genstr("hello HEAD", i + 1), 64);
+                    }
+
+                    for (int step = 0; step < 2; step++) {
+                        /* test remove node */
+                        if (step == 1) {
+                            for (int i = 0; i < list_sizes[list] / 2; i++) {
+                                unsigned char *data;
+                                quicklistPop(ql, QUICKLIST_HEAD, &data, NULL, NULL);
+                                zfree(data);
+                                quicklistPop(ql, QUICKLIST_TAIL, &data, NULL, NULL);
+                                zfree(data);
+                            }
+                        }
+                        quicklistNode *node = ql->head;
+                        unsigned int low_raw = ql->compress;
+                        unsigned int high_raw = ql->len - ql->compress;
+
+                        for (unsigned int at = 0; at < ql->len;
+                            at++, node = node->next) {
+                            if (at < low_raw || at >= high_raw) {
+                                if (node->encoding != QUICKLIST_NODE_ENCODING_RAW) {
+                                    ERR("Incorrect compression: node %d is "
+                                        "compressed at depth %d ((%u, %u); total "
+                                        "nodes: %lu; size: %u)",
+                                        at, depth, low_raw, high_raw, ql->len,
+                                        node->sz);
+                                }
+                            } else {
+                                if (node->encoding != QUICKLIST_NODE_ENCODING_LZF) {
+                                    ERR("Incorrect non-compression: node %d is NOT "
+                                        "compressed at depth %d ((%u, %u); total "
+                                        "nodes: %lu; size: %u; attempted: %d)",
+                                        at, depth, low_raw, high_raw, ql->len,
+                                        node->sz, node->attempted_compress);
+                                }
+                            }
+                        }
+                    }
+
+                    quicklistRelease(ql);
+                }
+            }
+        }
+    }
+    long long stop = mstime();
+
+    printf("\n");
+    for (size_t i = 0; i < option_count; i++)
+        printf("Test Loop %02d: %0.2f seconds.\n", options[i],
+               (float)runtime[i] / 1000);
+    printf("Compressions: %0.2f seconds.\n", (float)(stop - start) / 1000);
+    printf("\n");
+
+    TEST("bookmark get updated to next item") {
+        quicklist *ql = quicklistNew(1, 0);
+        quicklistPushTail(ql, "1", 1);
+        quicklistPushTail(ql, "2", 1);
+        quicklistPushTail(ql, "3", 1);
+        quicklistPushTail(ql, "4", 1);
+        quicklistPushTail(ql, "5", 1);
+        assert(ql->len==5);
+        /* add two bookmarks, one pointing to the node before the last. */
+        assert(quicklistBookmarkCreate(&ql, "_dummy", ql->head->next));
+        assert(quicklistBookmarkCreate(&ql, "_test", ql->tail->prev));
+        /* test that the bookmark returns the right node, delete it and see that the bookmark points to the last node */
+        assert(quicklistBookmarkFind(ql, "_test") == ql->tail->prev);
+        assert(quicklistDelRange(ql, -2, 1));
+        assert(quicklistBookmarkFind(ql, "_test") == ql->tail);
+        /* delete the last node, and see that the bookmark was deleted. */
+        assert(quicklistDelRange(ql, -1, 1));
+        assert(quicklistBookmarkFind(ql, "_test") == NULL);
+        /* test that other bookmarks aren't affected */
+        assert(quicklistBookmarkFind(ql, "_dummy") == ql->head->next);
+        assert(quicklistBookmarkFind(ql, "_missing") == NULL);
+        assert(ql->len==3);
+        quicklistBookmarksClear(ql); /* for coverage */
+        assert(quicklistBookmarkFind(ql, "_dummy") == NULL);
+        quicklistRelease(ql);
+    }
+
+    TEST("bookmark limit") {
+        int i;
+        quicklist *ql = quicklistNew(1, 0);
+        quicklistPushHead(ql, "1", 1);
+        for (i=0; i<QL_MAX_BM; i++)
+            assert(quicklistBookmarkCreate(&ql, genstr("",i), ql->head));
+        /* when all bookmarks are used, creation fails */
+        assert(!quicklistBookmarkCreate(&ql, "_test", ql->head));
+        /* delete one and see that we can now create another */
+        assert(quicklistBookmarkDelete(ql, "0"));
+        assert(quicklistBookmarkCreate(&ql, "_test", ql->head));
+        /* delete one and see that the rest survive */
+        assert(quicklistBookmarkDelete(ql, "_test"));
+        for (i=1; i<QL_MAX_BM; i++)
+            assert(quicklistBookmarkFind(ql, genstr("",i)) == ql->head);
+        /* make sure the deleted ones are indeed gone */
+        assert(!quicklistBookmarkFind(ql, "0"));
+        assert(!quicklistBookmarkFind(ql, "_test"));
+        quicklistRelease(ql);
+    }
+
+    if (!err)
+        printf("ALL TESTS PASSED!\n");
+    else
+        ERR("Sorry, not all tests passed!  In fact, %d tests failed.", err);
+
+    return err;
+}
+#endif
diff --git a/redis-stable/src/quicklist.h b/redis-stable/src/quicklist.h
new file mode 100644
index 00000000..c9f493d8
--- /dev/null
+++ b/redis-stable/src/quicklist.h
@@ -0,0 +1,209 @@
+/* quicklist.h - A generic doubly linked quicklist implementation
+ *
+ * Copyright (c) 2014, Matt Stancliff <matt@genges.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this quicklist of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this quicklist of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdint.h> // for UINTPTR_MAX
+
+#ifndef __QUICKLIST_H__
+#define __QUICKLIST_H__
+
+/* Node, quicklist, and Iterator are the only data structures used currently. */
+
+/* quicklistNode is a 32 byte struct describing a ziplist for a quicklist.
+ * We use bit fields keep the quicklistNode at 32 bytes.
+ * count: 16 bits, max 65536 (max zl bytes is 65k, so max count actually < 32k).
+ * encoding: 2 bits, RAW=1, LZF=2.
+ * container: 2 bits, NONE=1, ZIPLIST=2.
+ * recompress: 1 bit, bool, true if node is temporary decompressed for usage.
+ * attempted_compress: 1 bit, boolean, used for verifying during testing.
+ * extra: 10 bits, free for future use; pads out the remainder of 32 bits */
+typedef struct quicklistNode {
+    struct quicklistNode *prev;
+    struct quicklistNode *next;
+    unsigned char *zl;
+    unsigned int sz;             /* ziplist size in bytes */
+    unsigned int count : 16;     /* count of items in ziplist */
+    unsigned int encoding : 2;   /* RAW==1 or LZF==2 */
+    unsigned int container : 2;  /* NONE==1 or ZIPLIST==2 */
+    unsigned int recompress : 1; /* was this node previous compressed? */
+    unsigned int attempted_compress : 1; /* node can't compress; too small */
+    unsigned int extra : 10; /* more bits to steal for future usage */
+} quicklistNode;
+
+/* quicklistLZF is a 4+N byte struct holding 'sz' followed by 'compressed'.
+ * 'sz' is byte length of 'compressed' field.
+ * 'compressed' is LZF data with total (compressed) length 'sz'
+ * NOTE: uncompressed length is stored in quicklistNode->sz.
+ * When quicklistNode->zl is compressed, node->zl points to a quicklistLZF */
+typedef struct quicklistLZF {
+    unsigned int sz; /* LZF size in bytes*/
+    char compressed[];
+} quicklistLZF;
+
+/* Bookmarks are padded with realloc at the end of of the quicklist struct.
+ * They should only be used for very big lists if thousands of nodes were the
+ * excess memory usage is negligible, and there's a real need to iterate on them
+ * in portions.
+ * When not used, they don't add any memory overhead, but when used and then
+ * deleted, some overhead remains (to avoid resonance).
+ * The number of bookmarks used should be kept to minimum since it also adds
+ * overhead on node deletion (searching for a bookmark to update). */
+typedef struct quicklistBookmark {
+    quicklistNode *node;
+    char *name;
+} quicklistBookmark;
+
+#if UINTPTR_MAX == 0xffffffff
+/* 32-bit */
+#   define QL_FILL_BITS 14
+#   define QL_COMP_BITS 14
+#   define QL_BM_BITS 4
+#elif UINTPTR_MAX == 0xffffffffffffffff
+/* 64-bit */
+#   define QL_FILL_BITS 16
+#   define QL_COMP_BITS 16
+#   define QL_BM_BITS 4 /* we can encode more, but we rather limit the user
+                           since they cause performance degradation. */
+#else
+#   error unknown arch bits count
+#endif
+
+/* quicklist is a 40 byte struct (on 64-bit systems) describing a quicklist.
+ * 'count' is the number of total entries.
+ * 'len' is the number of quicklist nodes.
+ * 'compress' is: 0 if compression disabled, otherwise it's the number
+ *                of quicklistNodes to leave uncompressed at ends of quicklist.
+ * 'fill' is the user-requested (or default) fill factor.
+ * 'bookmakrs are an optional feature that is used by realloc this struct,
+ *      so that they don't consume memory when not used. */
+typedef struct quicklist {
+    quicklistNode *head;
+    quicklistNode *tail;
+    unsigned long count;        /* total count of all entries in all ziplists */
+    unsigned long len;          /* number of quicklistNodes */
+    int fill : QL_FILL_BITS;              /* fill factor for individual nodes */
+    unsigned int compress : QL_COMP_BITS; /* depth of end nodes not to compress;0=off */
+    unsigned int bookmark_count: QL_BM_BITS;
+    quicklistBookmark bookmarks[];
+} quicklist;
+
+typedef struct quicklistIter {
+    const quicklist *quicklist;
+    quicklistNode *current;
+    unsigned char *zi;
+    long offset; /* offset in current ziplist */
+    int direction;
+} quicklistIter;
+
+typedef struct quicklistEntry {
+    const quicklist *quicklist;
+    quicklistNode *node;
+    unsigned char *zi;
+    unsigned char *value;
+    long long longval;
+    unsigned int sz;
+    int offset;
+} quicklistEntry;
+
+#define QUICKLIST_HEAD 0
+#define QUICKLIST_TAIL -1
+
+/* quicklist node encodings */
+#define QUICKLIST_NODE_ENCODING_RAW 1
+#define QUICKLIST_NODE_ENCODING_LZF 2
+
+/* quicklist compression disable */
+#define QUICKLIST_NOCOMPRESS 0
+
+/* quicklist container formats */
+#define QUICKLIST_NODE_CONTAINER_NONE 1
+#define QUICKLIST_NODE_CONTAINER_ZIPLIST 2
+
+#define quicklistNodeIsCompressed(node)                                        \
+    ((node)->encoding == QUICKLIST_NODE_ENCODING_LZF)
+
+/* Prototypes */
+quicklist *quicklistCreate(void);
+quicklist *quicklistNew(int fill, int compress);
+void quicklistSetCompressDepth(quicklist *quicklist, int depth);
+void quicklistSetFill(quicklist *quicklist, int fill);
+void quicklistSetOptions(quicklist *quicklist, int fill, int depth);
+void quicklistRelease(quicklist *quicklist);
+int quicklistPushHead(quicklist *quicklist, void *value, const size_t sz);
+int quicklistPushTail(quicklist *quicklist, void *value, const size_t sz);
+void quicklistPush(quicklist *quicklist, void *value, const size_t sz,
+                   int where);
+void quicklistAppendZiplist(quicklist *quicklist, unsigned char *zl);
+quicklist *quicklistAppendValuesFromZiplist(quicklist *quicklist,
+                                            unsigned char *zl);
+quicklist *quicklistCreateFromZiplist(int fill, int compress,
+                                      unsigned char *zl);
+void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *node,
+                          void *value, const size_t sz);
+void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *node,
+                           void *value, const size_t sz);
+void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry);
+int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data,
+                            int sz);
+int quicklistDelRange(quicklist *quicklist, const long start, const long stop);
+quicklistIter *quicklistGetIterator(const quicklist *quicklist, int direction);
+quicklistIter *quicklistGetIteratorAtIdx(const quicklist *quicklist,
+                                         int direction, const long long idx);
+int quicklistNext(quicklistIter *iter, quicklistEntry *node);
+void quicklistReleaseIterator(quicklistIter *iter);
+quicklist *quicklistDup(quicklist *orig);
+int quicklistIndex(const quicklist *quicklist, const long long index,
+                   quicklistEntry *entry);
+void quicklistRewind(quicklist *quicklist, quicklistIter *li);
+void quicklistRewindTail(quicklist *quicklist, quicklistIter *li);
+void quicklistRotate(quicklist *quicklist);
+int quicklistPopCustom(quicklist *quicklist, int where, unsigned char **data,
+                       unsigned int *sz, long long *sval,
+                       void *(*saver)(unsigned char *data, unsigned int sz));
+int quicklistPop(quicklist *quicklist, int where, unsigned char **data,
+                 unsigned int *sz, long long *slong);
+unsigned long quicklistCount(const quicklist *ql);
+int quicklistCompare(unsigned char *p1, unsigned char *p2, int p2_len);
+size_t quicklistGetLzf(const quicklistNode *node, void **data);
+
+/* bookmarks */
+int quicklistBookmarkCreate(quicklist **ql_ref, const char *name, quicklistNode *node);
+int quicklistBookmarkDelete(quicklist *ql, const char *name);
+quicklistNode *quicklistBookmarkFind(quicklist *ql, const char *name);
+void quicklistBookmarksClear(quicklist *ql);
+
+#ifdef REDIS_TEST
+int quicklistTest(int argc, char *argv[], int accurate);
+#endif
+
+/* Directions for iterators */
+#define AL_START_HEAD 0
+#define AL_START_TAIL 1
+
+#endif /* __QUICKLIST_H__ */
diff --git a/redis-stable/src/rand.c b/redis-stable/src/rand.c
new file mode 100644
index 00000000..09b0508f
--- /dev/null
+++ b/redis-stable/src/rand.c
@@ -0,0 +1,93 @@
+/* Pseudo random number generation functions derived from the drand48()
+ * function obtained from pysam source code.
+ *
+ * This functions are used in order to replace the default math.random()
+ * Lua implementation with something having exactly the same behavior
+ * across different systems (by default Lua uses libc's rand() that is not
+ * required to implement a specific PRNG generating the same sequence
+ * in different systems if seeded with the same integer).
+ *
+ * The original code appears to be under the public domain.
+ * I modified it removing the non needed functions and all the
+ * 1960-style C coding stuff...
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2010-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdint.h>
+
+#define N	16
+#define MASK	((1 << (N - 1)) + (1 << (N - 1)) - 1)
+#define LOW(x)	((unsigned)(x) & MASK)
+#define HIGH(x)	LOW((x) >> N)
+#define MUL(x, y, z)	{ int32_t l = (long)(x) * (long)(y); \
+		(z)[0] = LOW(l); (z)[1] = HIGH(l); }
+#define CARRY(x, y)	((int32_t)(x) + (long)(y) > MASK)
+#define ADDEQU(x, y, z)	(z = CARRY(x, (y)), x = LOW(x + (y)))
+#define X0	0x330E
+#define X1	0xABCD
+#define X2	0x1234
+#define A0	0xE66D
+#define A1	0xDEEC
+#define A2	0x5
+#define C	0xB
+#define SET3(x, x0, x1, x2)	((x)[0] = (x0), (x)[1] = (x1), (x)[2] = (x2))
+#define SETLOW(x, y, n) SET3(x, LOW((y)[n]), LOW((y)[(n)+1]), LOW((y)[(n)+2]))
+#define SEED(x0, x1, x2) (SET3(x, x0, x1, x2), SET3(a, A0, A1, A2), c = C)
+#define REST(v)	for (i = 0; i < 3; i++) { xsubi[i] = x[i]; x[i] = temp[i]; } \
+		return (v);
+#define HI_BIT	(1L << (2 * N - 1))
+
+static uint32_t x[3] = { X0, X1, X2 }, a[3] = { A0, A1, A2 }, c = C;
+static void next(void);
+
+int32_t redisLrand48() {
+    next();
+    return (((int32_t)x[2] << (N - 1)) + (x[1] >> 1));
+}
+
+void redisSrand48(int32_t seedval) {
+    SEED(X0, LOW(seedval), HIGH(seedval));
+}
+
+static void next(void) {
+    uint32_t p[2], q[2], r[2], carry0, carry1;
+
+    MUL(a[0], x[0], p);
+    ADDEQU(p[0], c, carry0);
+    ADDEQU(p[1], carry0, carry1);
+    MUL(a[0], x[1], q);
+    ADDEQU(p[1], q[0], carry0);
+    MUL(a[1], x[0], r);
+    x[2] = LOW(carry0 + carry1 + CARRY(p[1], r[0]) + q[1] + r[1] +
+            a[0] * x[2] + a[1] * x[1] + a[2] * x[0]);
+    x[1] = LOW(p[1] + r[0]);
+    x[0] = LOW(p[0]);
+}
diff --git a/redis-stable/src/rand.h b/redis-stable/src/rand.h
new file mode 100644
index 00000000..1dce3e8b
--- /dev/null
+++ b/redis-stable/src/rand.h
@@ -0,0 +1,38 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef REDIS_RANDOM_H
+#define REDIS_RANDOM_H
+
+int32_t redisLrand48();
+void redisSrand48(int32_t seedval);
+
+#define REDIS_LRAND48_MAX INT32_MAX
+
+#endif
diff --git a/redis-stable/src/rax.c b/redis-stable/src/rax.c
new file mode 100644
index 00000000..0826b974
--- /dev/null
+++ b/redis-stable/src/rax.c
@@ -0,0 +1,1948 @@
+/* Rax -- A radix tree implementation.
+ *
+ * Version 1.2 -- 7 February 2019
+ *
+ * Copyright (c) 2017-2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+#include <stdio.h>
+#include <errno.h>
+#include <math.h>
+#include "rax.h"
+
+#ifndef RAX_MALLOC_INCLUDE
+#define RAX_MALLOC_INCLUDE "rax_malloc.h"
+#endif
+
+#include RAX_MALLOC_INCLUDE
+
+/* This is a special pointer that is guaranteed to never have the same value
+ * of a radix tree node. It's used in order to report "not found" error without
+ * requiring the function to have multiple return values. */
+void *raxNotFound = (void*)"rax-not-found-pointer";
+
+/* -------------------------------- Debugging ------------------------------ */
+
+void raxDebugShowNode(const char *msg, raxNode *n);
+
+/* Turn debugging messages on/off by compiling with RAX_DEBUG_MSG macro on.
+ * When RAX_DEBUG_MSG is defined by default Rax operations will emit a lot
+ * of debugging info to the standard output, however you can still turn
+ * debugging on/off in order to enable it only when you suspect there is an
+ * operation causing a bug using the function raxSetDebugMsg(). */
+#ifdef RAX_DEBUG_MSG
+#define debugf(...)                                                            \
+    if (raxDebugMsg) {                                                         \
+        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
+        printf(__VA_ARGS__);                                                   \
+        fflush(stdout);                                                        \
+    }
+
+#define debugnode(msg,n) raxDebugShowNode(msg,n)
+#else
+#define debugf(...)
+#define debugnode(msg,n)
+#endif
+
+/* By default log debug info if RAX_DEBUG_MSG is defined. */
+static int raxDebugMsg = 1;
+
+/* When debug messages are enabled, turn them on/off dynamically. By
+ * default they are enabled. Set the state to 0 to disable, and 1 to
+ * re-enable. */
+void raxSetDebugMsg(int onoff) {
+    raxDebugMsg = onoff;
+}
+
+/* ------------------------- raxStack functions --------------------------
+ * The raxStack is a simple stack of pointers that is capable of switching
+ * from using a stack-allocated array to dynamic heap once a given number of
+ * items are reached. It is used in order to retain the list of parent nodes
+ * while walking the radix tree in order to implement certain operations that
+ * need to navigate the tree upward.
+ * ------------------------------------------------------------------------- */
+
+/* Initialize the stack. */
+static inline void raxStackInit(raxStack *ts) {
+    ts->stack = ts->static_items;
+    ts->items = 0;
+    ts->maxitems = RAX_STACK_STATIC_ITEMS;
+    ts->oom = 0;
+}
+
+/* Push an item into the stack, returns 1 on success, 0 on out of memory. */
+static inline int raxStackPush(raxStack *ts, void *ptr) {
+    if (ts->items == ts->maxitems) {
+        if (ts->stack == ts->static_items) {
+            ts->stack = rax_malloc(sizeof(void*)*ts->maxitems*2);
+            if (ts->stack == NULL) {
+                ts->stack = ts->static_items;
+                ts->oom = 1;
+                errno = ENOMEM;
+                return 0;
+            }
+            memcpy(ts->stack,ts->static_items,sizeof(void*)*ts->maxitems);
+        } else {
+            void **newalloc = rax_realloc(ts->stack,sizeof(void*)*ts->maxitems*2);
+            if (newalloc == NULL) {
+                ts->oom = 1;
+                errno = ENOMEM;
+                return 0;
+            }
+            ts->stack = newalloc;
+        }
+        ts->maxitems *= 2;
+    }
+    ts->stack[ts->items] = ptr;
+    ts->items++;
+    return 1;
+}
+
+/* Pop an item from the stack, the function returns NULL if there are no
+ * items to pop. */
+static inline void *raxStackPop(raxStack *ts) {
+    if (ts->items == 0) return NULL;
+    ts->items--;
+    return ts->stack[ts->items];
+}
+
+/* Return the stack item at the top of the stack without actually consuming
+ * it. */
+static inline void *raxStackPeek(raxStack *ts) {
+    if (ts->items == 0) return NULL;
+    return ts->stack[ts->items-1];
+}
+
+/* Free the stack in case we used heap allocation. */
+static inline void raxStackFree(raxStack *ts) {
+    if (ts->stack != ts->static_items) rax_free(ts->stack);
+}
+
+/* ----------------------------------------------------------------------------
+ * Radix tree implementation
+ * --------------------------------------------------------------------------*/
+
+/* Return the padding needed in the characters section of a node having size
+ * 'nodesize'. The padding is needed to store the child pointers to aligned
+ * addresses. Note that we add 4 to the node size because the node has a four
+ * bytes header. */
+#define raxPadding(nodesize) ((sizeof(void*)-((nodesize+4) % sizeof(void*))) & (sizeof(void*)-1))
+
+/* Return the pointer to the last child pointer in a node. For the compressed
+ * nodes this is the only child pointer. */
+#define raxNodeLastChildPtr(n) ((raxNode**) ( \
+    ((char*)(n)) + \
+    raxNodeCurrentLength(n) - \
+    sizeof(raxNode*) - \
+    (((n)->iskey && !(n)->isnull) ? sizeof(void*) : 0) \
+))
+
+/* Return the pointer to the first child pointer. */
+#define raxNodeFirstChildPtr(n) ((raxNode**) ( \
+    (n)->data + \
+    (n)->size + \
+    raxPadding((n)->size)))
+
+/* Return the current total size of the node. Note that the second line
+ * computes the padding after the string of characters, needed in order to
+ * save pointers to aligned addresses. */
+#define raxNodeCurrentLength(n) ( \
+    sizeof(raxNode)+(n)->size+ \
+    raxPadding((n)->size)+ \
+    ((n)->iscompr ? sizeof(raxNode*) : sizeof(raxNode*)*(n)->size)+ \
+    (((n)->iskey && !(n)->isnull)*sizeof(void*)) \
+)
+
+/* Allocate a new non compressed node with the specified number of children.
+ * If datafiled is true, the allocation is made large enough to hold the
+ * associated data pointer.
+ * Returns the new node pointer. On out of memory NULL is returned. */
+raxNode *raxNewNode(size_t children, int datafield) {
+    size_t nodesize = sizeof(raxNode)+children+raxPadding(children)+
+                      sizeof(raxNode*)*children;
+    if (datafield) nodesize += sizeof(void*);
+    raxNode *node = rax_malloc(nodesize);
+    if (node == NULL) return NULL;
+    node->iskey = 0;
+    node->isnull = 0;
+    node->iscompr = 0;
+    node->size = children;
+    return node;
+}
+
+/* Allocate a new rax and return its pointer. On out of memory the function
+ * returns NULL. */
+rax *raxNew(void) {
+    rax *rax = rax_malloc(sizeof(*rax));
+    if (rax == NULL) return NULL;
+    rax->numele = 0;
+    rax->numnodes = 1;
+    rax->head = raxNewNode(0,0);
+    if (rax->head == NULL) {
+        rax_free(rax);
+        return NULL;
+    } else {
+        return rax;
+    }
+}
+
+/* realloc the node to make room for auxiliary data in order
+ * to store an item in that node. On out of memory NULL is returned. */
+raxNode *raxReallocForData(raxNode *n, void *data) {
+    if (data == NULL) return n; /* No reallocation needed, setting isnull=1 */
+    size_t curlen = raxNodeCurrentLength(n);
+    return rax_realloc(n,curlen+sizeof(void*));
+}
+
+/* Set the node auxiliary data to the specified pointer. */
+void raxSetData(raxNode *n, void *data) {
+    n->iskey = 1;
+    if (data != NULL) {
+        n->isnull = 0;
+        void **ndata = (void**)
+            ((char*)n+raxNodeCurrentLength(n)-sizeof(void*));
+        memcpy(ndata,&data,sizeof(data));
+    } else {
+        n->isnull = 1;
+    }
+}
+
+/* Get the node auxiliary data. */
+void *raxGetData(raxNode *n) {
+    if (n->isnull) return NULL;
+    void **ndata =(void**)((char*)n+raxNodeCurrentLength(n)-sizeof(void*));
+    void *data;
+    memcpy(&data,ndata,sizeof(data));
+    return data;
+}
+
+/* Add a new child to the node 'n' representing the character 'c' and return
+ * its new pointer, as well as the child pointer by reference. Additionally
+ * '***parentlink' is populated with the raxNode pointer-to-pointer of where
+ * the new child was stored, which is useful for the caller to replace the
+ * child pointer if it gets reallocated.
+ *
+ * On success the new parent node pointer is returned (it may change because
+ * of the realloc, so the caller should discard 'n' and use the new value).
+ * On out of memory NULL is returned, and the old node is still valid. */
+raxNode *raxAddChild(raxNode *n, unsigned char c, raxNode **childptr, raxNode ***parentlink) {
+    assert(n->iscompr == 0);
+
+    size_t curlen = raxNodeCurrentLength(n);
+    n->size++;
+    size_t newlen = raxNodeCurrentLength(n);
+    n->size--; /* For now restore the orignal size. We'll update it only on
+                  success at the end. */
+
+    /* Alloc the new child we will link to 'n'. */
+    raxNode *child = raxNewNode(0,0);
+    if (child == NULL) return NULL;
+
+    /* Make space in the original node. */
+    raxNode *newn = rax_realloc(n,newlen);
+    if (newn == NULL) {
+        rax_free(child);
+        return NULL;
+    }
+    n = newn;
+
+    /* After the reallocation, we have up to 8/16 (depending on the system
+     * pointer size, and the required node padding) bytes at the end, that is,
+     * the additional char in the 'data' section, plus one pointer to the new
+     * child, plus the padding needed in order to store addresses into aligned
+     * locations.
+     *
+     * So if we start with the following node, having "abde" edges.
+     *
+     * Note:
+     * - We assume 4 bytes pointer for simplicity.
+     * - Each space below corresponds to one byte
+     *
+     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr]|AUXP|
+     *
+     * After the reallocation we need: 1 byte for the new edge character
+     * plus 4 bytes for a new child pointer (assuming 32 bit machine).
+     * However after adding 1 byte to the edge char, the header + the edge
+     * characters are no longer aligned, so we also need 3 bytes of padding.
+     * In total the reallocation will add 1+4+3 bytes = 8 bytes:
+     *
+     * (Blank bytes are represented by ".")
+     *
+     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr]|AUXP|[....][....]
+     *
+     * Let's find where to insert the new child in order to make sure
+     * it is inserted in-place lexicographically. Assuming we are adding
+     * a child "c" in our case pos will be = 2 after the end of the following
+     * loop. */
+    int pos;
+    for (pos = 0; pos < n->size; pos++) {
+        if (n->data[pos] > c) break;
+    }
+
+    /* Now, if present, move auxiliary data pointer at the end
+     * so that we can mess with the other data without overwriting it.
+     * We will obtain something like that:
+     *
+     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr][....][....]|AUXP|
+     */
+    unsigned char *src, *dst;
+    if (n->iskey && !n->isnull) {
+        src = ((unsigned char*)n+curlen-sizeof(void*));
+        dst = ((unsigned char*)n+newlen-sizeof(void*));
+        memmove(dst,src,sizeof(void*));
+    }
+
+    /* Compute the "shift", that is, how many bytes we need to move the
+     * pointers section forward because of the addition of the new child
+     * byte in the string section. Note that if we had no padding, that
+     * would be always "1", since we are adding a single byte in the string
+     * section of the node (where now there is "abde" basically).
+     *
+     * However we have padding, so it could be zero, or up to 8.
+     *
+     * Another way to think at the shift is, how many bytes we need to
+     * move child pointers forward *other than* the obvious sizeof(void*)
+     * needed for the additional pointer itself. */
+    size_t shift = newlen - curlen - sizeof(void*);
+
+    /* We said we are adding a node with edge 'c'. The insertion
+     * point is between 'b' and 'd', so the 'pos' variable value is
+     * the index of the first child pointer that we need to move forward
+     * to make space for our new pointer.
+     *
+     * To start, move all the child pointers after the insertion point
+     * of shift+sizeof(pointer) bytes on the right, to obtain:
+     *
+     * [HDR*][abde][Aptr][Bptr][....][....][Dptr][Eptr]|AUXP|
+     */
+    src = n->data+n->size+
+          raxPadding(n->size)+
+          sizeof(raxNode*)*pos;
+    memmove(src+shift+sizeof(raxNode*),src,sizeof(raxNode*)*(n->size-pos));
+
+    /* Move the pointers to the left of the insertion position as well. Often
+     * we don't need to do anything if there was already some padding to use. In
+     * that case the final destination of the pointers will be the same, however
+     * in our example there was no pre-existing padding, so we added one byte
+     * plus thre bytes of padding. After the next memmove() things will look
+     * like thata:
+     *
+     * [HDR*][abde][....][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
+     */
+    if (shift) {
+        src = (unsigned char*) raxNodeFirstChildPtr(n);
+        memmove(src+shift,src,sizeof(raxNode*)*pos);
+    }
+
+    /* Now make the space for the additional char in the data section,
+     * but also move the pointers before the insertion point to the right
+     * by shift bytes, in order to obtain the following:
+     *
+     * [HDR*][ab.d][e...][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
+     */
+    src = n->data+pos;
+    memmove(src+1,src,n->size-pos);
+
+    /* We can now set the character and its child node pointer to get:
+     *
+     * [HDR*][abcd][e...][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
+     * [HDR*][abcd][e...][Aptr][Bptr][Cptr][Dptr][Eptr]|AUXP|
+     */
+    n->data[pos] = c;
+    n->size++;
+    src = (unsigned char*) raxNodeFirstChildPtr(n);
+    raxNode **childfield = (raxNode**)(src+sizeof(raxNode*)*pos);
+    memcpy(childfield,&child,sizeof(child));
+    *childptr = child;
+    *parentlink = childfield;
+    return n;
+}
+
+/* Turn the node 'n', that must be a node without any children, into a
+ * compressed node representing a set of nodes linked one after the other
+ * and having exactly one child each. The node can be a key or not: this
+ * property and the associated value if any will be preserved.
+ *
+ * The function also returns a child node, since the last node of the
+ * compressed chain cannot be part of the chain: it has zero children while
+ * we can only compress inner nodes with exactly one child each. */
+raxNode *raxCompressNode(raxNode *n, unsigned char *s, size_t len, raxNode **child) {
+    assert(n->size == 0 && n->iscompr == 0);
+    void *data = NULL; /* Initialized only to avoid warnings. */
+    size_t newsize;
+
+    debugf("Compress node: %.*s\n", (int)len,s);
+
+    /* Allocate the child to link to this node. */
+    *child = raxNewNode(0,0);
+    if (*child == NULL) return NULL;
+
+    /* Make space in the parent node. */
+    newsize = sizeof(raxNode)+len+raxPadding(len)+sizeof(raxNode*);
+    if (n->iskey) {
+        data = raxGetData(n); /* To restore it later. */
+        if (!n->isnull) newsize += sizeof(void*);
+    }
+    raxNode *newn = rax_realloc(n,newsize);
+    if (newn == NULL) {
+        rax_free(*child);
+        return NULL;
+    }
+    n = newn;
+
+    n->iscompr = 1;
+    n->size = len;
+    memcpy(n->data,s,len);
+    if (n->iskey) raxSetData(n,data);
+    raxNode **childfield = raxNodeLastChildPtr(n);
+    memcpy(childfield,child,sizeof(*child));
+    return n;
+}
+
+/* Low level function that walks the tree looking for the string
+ * 's' of 'len' bytes. The function returns the number of characters
+ * of the key that was possible to process: if the returned integer
+ * is the same as 'len', then it means that the node corresponding to the
+ * string was found (however it may not be a key in case the node->iskey is
+ * zero or if simply we stopped in the middle of a compressed node, so that
+ * 'splitpos' is non zero).
+ *
+ * Otherwise if the returned integer is not the same as 'len', there was an
+ * early stop during the tree walk because of a character mismatch.
+ *
+ * The node where the search ended (because the full string was processed
+ * or because there was an early stop) is returned by reference as
+ * '*stopnode' if the passed pointer is not NULL. This node link in the
+ * parent's node is returned as '*plink' if not NULL. Finally, if the
+ * search stopped in a compressed node, '*splitpos' returns the index
+ * inside the compressed node where the search ended. This is useful to
+ * know where to split the node for insertion.
+ *
+ * Note that when we stop in the middle of a compressed node with
+ * a perfect match, this function will return a length equal to the
+ * 'len' argument (all the key matched), and will return a *splitpos which is
+ * always positive (that will represent the index of the character immediately
+ * *after* the last match in the current compressed node).
+ *
+ * When instead we stop at a compressed node and *splitpos is zero, it
+ * means that the current node represents the key (that is, none of the
+ * compressed node characters are needed to represent the key, just all
+ * its parents nodes). */
+static inline size_t raxLowWalk(rax *rax, unsigned char *s, size_t len, raxNode **stopnode, raxNode ***plink, int *splitpos, raxStack *ts) {
+    raxNode *h = rax->head;
+    raxNode **parentlink = &rax->head;
+
+    size_t i = 0; /* Position in the string. */
+    size_t j = 0; /* Position in the node children (or bytes if compressed).*/
+    while(h->size && i < len) {
+        debugnode("Lookup current node",h);
+        unsigned char *v = h->data;
+
+        if (h->iscompr) {
+            for (j = 0; j < h->size && i < len; j++, i++) {
+                if (v[j] != s[i]) break;
+            }
+            if (j != h->size) break;
+        } else {
+            /* Even when h->size is large, linear scan provides good
+             * performances compared to other approaches that are in theory
+             * more sounding, like performing a binary search. */
+            for (j = 0; j < h->size; j++) {
+                if (v[j] == s[i]) break;
+            }
+            if (j == h->size) break;
+            i++;
+        }
+
+        if (ts) raxStackPush(ts,h); /* Save stack of parent nodes. */
+        raxNode **children = raxNodeFirstChildPtr(h);
+        if (h->iscompr) j = 0; /* Compressed node only child is at index 0. */
+        memcpy(&h,children+j,sizeof(h));
+        parentlink = children+j;
+        j = 0; /* If the new node is non compressed and we do not
+                  iterate again (since i == len) set the split
+                  position to 0 to signal this node represents
+                  the searched key. */
+    }
+    debugnode("Lookup stop node is",h);
+    if (stopnode) *stopnode = h;
+    if (plink) *plink = parentlink;
+    if (splitpos && h->iscompr) *splitpos = j;
+    return i;
+}
+
+/* Insert the element 's' of size 'len', setting as auxiliary data
+ * the pointer 'data'. If the element is already present, the associated
+ * data is updated (only if 'overwrite' is set to 1), and 0 is returned,
+ * otherwise the element is inserted and 1 is returned. On out of memory the
+ * function returns 0 as well but sets errno to ENOMEM, otherwise errno will
+ * be set to 0.
+ */
+int raxGenericInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old, int overwrite) {
+    size_t i;
+    int j = 0; /* Split position. If raxLowWalk() stops in a compressed
+                  node, the index 'j' represents the char we stopped within the
+                  compressed node, that is, the position where to split the
+                  node for insertion. */
+    raxNode *h, **parentlink;
+
+    debugf("### Insert %.*s with value %p\n", (int)len, s, data);
+    i = raxLowWalk(rax,s,len,&h,&parentlink,&j,NULL);
+
+    /* If i == len we walked following the whole string. If we are not
+     * in the middle of a compressed node, the string is either already
+     * inserted or this middle node is currently not a key, but can represent
+     * our key. We have just to reallocate the node and make space for the
+     * data pointer. */
+    if (i == len && (!h->iscompr || j == 0 /* not in the middle if j is 0 */)) {
+        debugf("### Insert: node representing key exists\n");
+        /* Make space for the value pointer if needed. */
+        if (!h->iskey || (h->isnull && overwrite)) {
+            h = raxReallocForData(h,data);
+            if (h) memcpy(parentlink,&h,sizeof(h));
+        }
+        if (h == NULL) {
+            errno = ENOMEM;
+            return 0;
+        }
+
+        /* Update the existing key if there is already one. */
+        if (h->iskey) {
+            if (old) *old = raxGetData(h);
+            if (overwrite) raxSetData(h,data);
+            errno = 0;
+            return 0; /* Element already exists. */
+        }
+
+        /* Otherwise set the node as a key. Note that raxSetData()
+         * will set h->iskey. */
+        raxSetData(h,data);
+        rax->numele++;
+        return 1; /* Element inserted. */
+    }
+
+    /* If the node we stopped at is a compressed node, we need to
+     * split it before to continue.
+     *
+     * Splitting a compressed node have a few possible cases.
+     * Imagine that the node 'h' we are currently at is a compressed
+     * node containing the string "ANNIBALE" (it means that it represents
+     * nodes A -> N -> N -> I -> B -> A -> L -> E with the only child
+     * pointer of this node pointing at the 'E' node, because remember that
+     * we have characters at the edges of the graph, not inside the nodes
+     * themselves.
+     *
+     * In order to show a real case imagine our node to also point to
+     * another compressed node, that finally points at the node without
+     * children, representing 'O':
+     *
+     *     "ANNIBALE" -> "SCO" -> []
+     *
+     * When inserting we may face the following cases. Note that all the cases
+     * require the insertion of a non compressed node with exactly two
+     * children, except for the last case which just requires splitting a
+     * compressed node.
+     *
+     * 1) Inserting "ANNIENTARE"
+     *
+     *               |B| -> "ALE" -> "SCO" -> []
+     *     "ANNI" -> |-|
+     *               |E| -> (... continue algo ...) "NTARE" -> []
+     *
+     * 2) Inserting "ANNIBALI"
+     *
+     *                  |E| -> "SCO" -> []
+     *     "ANNIBAL" -> |-|
+     *                  |I| -> (... continue algo ...) []
+     *
+     * 3) Inserting "AGO" (Like case 1, but set iscompr = 0 into original node)
+     *
+     *            |N| -> "NIBALE" -> "SCO" -> []
+     *     |A| -> |-|
+     *            |G| -> (... continue algo ...) |O| -> []
+     *
+     * 4) Inserting "CIAO"
+     *
+     *     |A| -> "NNIBALE" -> "SCO" -> []
+     *     |-|
+     *     |C| -> (... continue algo ...) "IAO" -> []
+     *
+     * 5) Inserting "ANNI"
+     *
+     *     "ANNI" -> "BALE" -> "SCO" -> []
+     *
+     * The final algorithm for insertion covering all the above cases is as
+     * follows.
+     *
+     * ============================= ALGO 1 =============================
+     *
+     * For the above cases 1 to 4, that is, all cases where we stopped in
+     * the middle of a compressed node for a character mismatch, do:
+     *
+     * Let $SPLITPOS be the zero-based index at which, in the
+     * compressed node array of characters, we found the mismatching
+     * character. For example if the node contains "ANNIBALE" and we add
+     * "ANNIENTARE" the $SPLITPOS is 4, that is, the index at which the
+     * mismatching character is found.
+     *
+     * 1. Save the current compressed node $NEXT pointer (the pointer to the
+     *    child element, that is always present in compressed nodes).
+     *
+     * 2. Create "split node" having as child the non common letter
+     *    at the compressed node. The other non common letter (at the key)
+     *    will be added later as we continue the normal insertion algorithm
+     *    at step "6".
+     *
+     * 3a. IF $SPLITPOS == 0:
+     *     Replace the old node with the split node, by copying the auxiliary
+     *     data if any. Fix parent's reference. Free old node eventually
+     *     (we still need its data for the next steps of the algorithm).
+     *
+     * 3b. IF $SPLITPOS != 0:
+     *     Trim the compressed node (reallocating it as well) in order to
+     *     contain $splitpos characters. Change child pointer in order to link
+     *     to the split node. If new compressed node len is just 1, set
+     *     iscompr to 0 (layout is the same). Fix parent's reference.
+     *
+     * 4a. IF the postfix len (the length of the remaining string of the
+     *     original compressed node after the split character) is non zero,
+     *     create a "postfix node". If the postfix node has just one character
+     *     set iscompr to 0, otherwise iscompr to 1. Set the postfix node
+     *     child pointer to $NEXT.
+     *
+     * 4b. IF the postfix len is zero, just use $NEXT as postfix pointer.
+     *
+     * 5. Set child[0] of split node to postfix node.
+     *
+     * 6. Set the split node as the current node, set current index at child[1]
+     *    and continue insertion algorithm as usually.
+     *
+     * ============================= ALGO 2 =============================
+     *
+     * For case 5, that is, if we stopped in the middle of a compressed
+     * node but no mismatch was found, do:
+     *
+     * Let $SPLITPOS be the zero-based index at which, in the
+     * compressed node array of characters, we stopped iterating because
+     * there were no more keys character to match. So in the example of
+     * the node "ANNIBALE", addig the string "ANNI", the $SPLITPOS is 4.
+     *
+     * 1. Save the current compressed node $NEXT pointer (the pointer to the
+     *    child element, that is always present in compressed nodes).
+     *
+     * 2. Create a "postfix node" containing all the characters from $SPLITPOS
+     *    to the end. Use $NEXT as the postfix node child pointer.
+     *    If the postfix node length is 1, set iscompr to 0.
+     *    Set the node as a key with the associated value of the new
+     *    inserted key.
+     *
+     * 3. Trim the current node to contain the first $SPLITPOS characters.
+     *    As usually if the new node length is just 1, set iscompr to 0.
+     *    Take the iskey / associated value as it was in the orignal node.
+     *    Fix the parent's reference.
+     *
+     * 4. Set the postfix node as the only child pointer of the trimmed
+     *    node created at step 1.
+     */
+
+    /* ------------------------- ALGORITHM 1 --------------------------- */
+    if (h->iscompr && i != len) {
+        debugf("ALGO 1: Stopped at compressed node %.*s (%p)\n",
+            h->size, h->data, (void*)h);
+        debugf("Still to insert: %.*s\n", (int)(len-i), s+i);
+        debugf("Splitting at %d: '%c'\n", j, ((char*)h->data)[j]);
+        debugf("Other (key) letter is '%c'\n", s[i]);
+
+        /* 1: Save next pointer. */
+        raxNode **childfield = raxNodeLastChildPtr(h);
+        raxNode *next;
+        memcpy(&next,childfield,sizeof(next));
+        debugf("Next is %p\n", (void*)next);
+        debugf("iskey %d\n", h->iskey);
+        if (h->iskey) {
+            debugf("key value is %p\n", raxGetData(h));
+        }
+
+        /* Set the length of the additional nodes we will need. */
+        size_t trimmedlen = j;
+        size_t postfixlen = h->size - j - 1;
+        int split_node_is_key = !trimmedlen && h->iskey && !h->isnull;
+        size_t nodesize;
+
+        /* 2: Create the split node. Also allocate the other nodes we'll need
+         *    ASAP, so that it will be simpler to handle OOM. */
+        raxNode *splitnode = raxNewNode(1, split_node_is_key);
+        raxNode *trimmed = NULL;
+        raxNode *postfix = NULL;
+
+        if (trimmedlen) {
+            nodesize = sizeof(raxNode)+trimmedlen+raxPadding(trimmedlen)+
+                       sizeof(raxNode*);
+            if (h->iskey && !h->isnull) nodesize += sizeof(void*);
+            trimmed = rax_malloc(nodesize);
+        }
+
+        if (postfixlen) {
+            nodesize = sizeof(raxNode)+postfixlen+raxPadding(postfixlen)+
+                       sizeof(raxNode*);
+            postfix = rax_malloc(nodesize);
+        }
+
+        /* OOM? Abort now that the tree is untouched. */
+        if (splitnode == NULL ||
+            (trimmedlen && trimmed == NULL) ||
+            (postfixlen && postfix == NULL))
+        {
+            rax_free(splitnode);
+            rax_free(trimmed);
+            rax_free(postfix);
+            errno = ENOMEM;
+            return 0;
+        }
+        splitnode->data[0] = h->data[j];
+
+        if (j == 0) {
+            /* 3a: Replace the old node with the split node. */
+            if (h->iskey) {
+                void *ndata = raxGetData(h);
+                raxSetData(splitnode,ndata);
+            }
+            memcpy(parentlink,&splitnode,sizeof(splitnode));
+        } else {
+            /* 3b: Trim the compressed node. */
+            trimmed->size = j;
+            memcpy(trimmed->data,h->data,j);
+            trimmed->iscompr = j > 1 ? 1 : 0;
+            trimmed->iskey = h->iskey;
+            trimmed->isnull = h->isnull;
+            if (h->iskey && !h->isnull) {
+                void *ndata = raxGetData(h);
+                raxSetData(trimmed,ndata);
+            }
+            raxNode **cp = raxNodeLastChildPtr(trimmed);
+            memcpy(cp,&splitnode,sizeof(splitnode));
+            memcpy(parentlink,&trimmed,sizeof(trimmed));
+            parentlink = cp; /* Set parentlink to splitnode parent. */
+            rax->numnodes++;
+        }
+
+        /* 4: Create the postfix node: what remains of the original
+         * compressed node after the split. */
+        if (postfixlen) {
+            /* 4a: create a postfix node. */
+            postfix->iskey = 0;
+            postfix->isnull = 0;
+            postfix->size = postfixlen;
+            postfix->iscompr = postfixlen > 1;
+            memcpy(postfix->data,h->data+j+1,postfixlen);
+            raxNode **cp = raxNodeLastChildPtr(postfix);
+            memcpy(cp,&next,sizeof(next));
+            rax->numnodes++;
+        } else {
+            /* 4b: just use next as postfix node. */
+            postfix = next;
+        }
+
+        /* 5: Set splitnode first child as the postfix node. */
+        raxNode **splitchild = raxNodeLastChildPtr(splitnode);
+        memcpy(splitchild,&postfix,sizeof(postfix));
+
+        /* 6. Continue insertion: this will cause the splitnode to
+         * get a new child (the non common character at the currently
+         * inserted key). */
+        rax_free(h);
+        h = splitnode;
+    } else if (h->iscompr && i == len) {
+    /* ------------------------- ALGORITHM 2 --------------------------- */
+        debugf("ALGO 2: Stopped at compressed node %.*s (%p) j = %d\n",
+            h->size, h->data, (void*)h, j);
+
+        /* Allocate postfix & trimmed nodes ASAP to fail for OOM gracefully. */
+        size_t postfixlen = h->size - j;
+        size_t nodesize = sizeof(raxNode)+postfixlen+raxPadding(postfixlen)+
+                          sizeof(raxNode*);
+        if (data != NULL) nodesize += sizeof(void*);
+        raxNode *postfix = rax_malloc(nodesize);
+
+        nodesize = sizeof(raxNode)+j+raxPadding(j)+sizeof(raxNode*);
+        if (h->iskey && !h->isnull) nodesize += sizeof(void*);
+        raxNode *trimmed = rax_malloc(nodesize);
+
+        if (postfix == NULL || trimmed == NULL) {
+            rax_free(postfix);
+            rax_free(trimmed);
+            errno = ENOMEM;
+            return 0;
+        }
+
+        /* 1: Save next pointer. */
+        raxNode **childfield = raxNodeLastChildPtr(h);
+        raxNode *next;
+        memcpy(&next,childfield,sizeof(next));
+
+        /* 2: Create the postfix node. */
+        postfix->size = postfixlen;
+        postfix->iscompr = postfixlen > 1;
+        postfix->iskey = 1;
+        postfix->isnull = 0;
+        memcpy(postfix->data,h->data+j,postfixlen);
+        raxSetData(postfix,data);
+        raxNode **cp = raxNodeLastChildPtr(postfix);
+        memcpy(cp,&next,sizeof(next));
+        rax->numnodes++;
+
+        /* 3: Trim the compressed node. */
+        trimmed->size = j;
+        trimmed->iscompr = j > 1;
+        trimmed->iskey = 0;
+        trimmed->isnull = 0;
+        memcpy(trimmed->data,h->data,j);
+        memcpy(parentlink,&trimmed,sizeof(trimmed));
+        if (h->iskey) {
+            void *aux = raxGetData(h);
+            raxSetData(trimmed,aux);
+        }
+
+        /* Fix the trimmed node child pointer to point to
+         * the postfix node. */
+        cp = raxNodeLastChildPtr(trimmed);
+        memcpy(cp,&postfix,sizeof(postfix));
+
+        /* Finish! We don't need to continue with the insertion
+         * algorithm for ALGO 2. The key is already inserted. */
+        rax->numele++;
+        rax_free(h);
+        return 1; /* Key inserted. */
+    }
+
+    /* We walked the radix tree as far as we could, but still there are left
+     * chars in our string. We need to insert the missing nodes. */
+    while(i < len) {
+        raxNode *child;
+
+        /* If this node is going to have a single child, and there
+         * are other characters, so that that would result in a chain
+         * of single-childed nodes, turn it into a compressed node. */
+        if (h->size == 0 && len-i > 1) {
+            debugf("Inserting compressed node\n");
+            size_t comprsize = len-i;
+            if (comprsize > RAX_NODE_MAX_SIZE)
+                comprsize = RAX_NODE_MAX_SIZE;
+            raxNode *newh = raxCompressNode(h,s+i,comprsize,&child);
+            if (newh == NULL) goto oom;
+            h = newh;
+            memcpy(parentlink,&h,sizeof(h));
+            parentlink = raxNodeLastChildPtr(h);
+            i += comprsize;
+        } else {
+            debugf("Inserting normal node\n");
+            raxNode **new_parentlink;
+            raxNode *newh = raxAddChild(h,s[i],&child,&new_parentlink);
+            if (newh == NULL) goto oom;
+            h = newh;
+            memcpy(parentlink,&h,sizeof(h));
+            parentlink = new_parentlink;
+            i++;
+        }
+        rax->numnodes++;
+        h = child;
+    }
+    raxNode *newh = raxReallocForData(h,data);
+    if (newh == NULL) goto oom;
+    h = newh;
+    if (!h->iskey) rax->numele++;
+    raxSetData(h,data);
+    memcpy(parentlink,&h,sizeof(h));
+    return 1; /* Element inserted. */
+
+oom:
+    /* This code path handles out of memory after part of the sub-tree was
+     * already modified. Set the node as a key, and then remove it. However we
+     * do that only if the node is a terminal node, otherwise if the OOM
+     * happened reallocating a node in the middle, we don't need to free
+     * anything. */
+    if (h->size == 0) {
+        h->isnull = 1;
+        h->iskey = 1;
+        rax->numele++; /* Compensate the next remove. */
+        assert(raxRemove(rax,s,i,NULL) != 0);
+    }
+    errno = ENOMEM;
+    return 0;
+}
+
+/* Overwriting insert. Just a wrapper for raxGenericInsert() that will
+ * update the element if there is already one for the same key. */
+int raxInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old) {
+    return raxGenericInsert(rax,s,len,data,old,1);
+}
+
+/* Non overwriting insert function: this if an element with the same key
+ * exists, the value is not updated and the function returns 0.
+ * This is a just a wrapper for raxGenericInsert(). */
+int raxTryInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old) {
+    return raxGenericInsert(rax,s,len,data,old,0);
+}
+
+/* Find a key in the rax, returns raxNotFound special void pointer value
+ * if the item was not found, otherwise the value associated with the
+ * item is returned. */
+void *raxFind(rax *rax, unsigned char *s, size_t len) {
+    raxNode *h;
+
+    debugf("### Lookup: %.*s\n", (int)len, s);
+    int splitpos = 0;
+    size_t i = raxLowWalk(rax,s,len,&h,NULL,&splitpos,NULL);
+    if (i != len || (h->iscompr && splitpos != 0) || !h->iskey)
+        return raxNotFound;
+    return raxGetData(h);
+}
+
+/* Return the memory address where the 'parent' node stores the specified
+ * 'child' pointer, so that the caller can update the pointer with another
+ * one if needed. The function assumes it will find a match, otherwise the
+ * operation is an undefined behavior (it will continue scanning the
+ * memory without any bound checking). */
+raxNode **raxFindParentLink(raxNode *parent, raxNode *child) {
+    raxNode **cp = raxNodeFirstChildPtr(parent);
+    raxNode *c;
+    while(1) {
+        memcpy(&c,cp,sizeof(c));
+        if (c == child) break;
+        cp++;
+    }
+    return cp;
+}
+
+/* Low level child removal from node. The new node pointer (after the child
+ * removal) is returned. Note that this function does not fix the pointer
+ * of the parent node in its parent, so this task is up to the caller.
+ * The function never fails for out of memory. */
+raxNode *raxRemoveChild(raxNode *parent, raxNode *child) {
+    debugnode("raxRemoveChild before", parent);
+    /* If parent is a compressed node (having a single child, as for definition
+     * of the data structure), the removal of the child consists into turning
+     * it into a normal node without children. */
+    if (parent->iscompr) {
+        void *data = NULL;
+        if (parent->iskey) data = raxGetData(parent);
+        parent->isnull = 0;
+        parent->iscompr = 0;
+        parent->size = 0;
+        if (parent->iskey) raxSetData(parent,data);
+        debugnode("raxRemoveChild after", parent);
+        return parent;
+    }
+
+    /* Otherwise we need to scan for the child pointer and memmove()
+     * accordingly.
+     *
+     * 1. To start we seek the first element in both the children
+     *    pointers and edge bytes in the node. */
+    raxNode **cp = raxNodeFirstChildPtr(parent);
+    raxNode **c = cp;
+    unsigned char *e = parent->data;
+
+    /* 2. Search the child pointer to remove inside the array of children
+     *    pointers. */
+    while(1) {
+        raxNode *aux;
+        memcpy(&aux,c,sizeof(aux));
+        if (aux == child) break;
+        c++;
+        e++;
+    }
+
+    /* 3. Remove the edge and the pointer by memmoving the remaining children
+     *    pointer and edge bytes one position before. */
+    int taillen = parent->size - (e - parent->data) - 1;
+    debugf("raxRemoveChild tail len: %d\n", taillen);
+    memmove(e,e+1,taillen);
+
+    /* Compute the shift, that is the amount of bytes we should move our
+     * child pointers to the left, since the removal of one edge character
+     * and the corresponding padding change, may change the layout.
+     * We just check if in the old version of the node there was at the
+     * end just a single byte and all padding: in that case removing one char
+     * will remove a whole sizeof(void*) word. */
+    size_t shift = ((parent->size+4) % sizeof(void*)) == 1 ? sizeof(void*) : 0;
+
+    /* Move the children pointers before the deletion point. */
+    if (shift)
+        memmove(((char*)cp)-shift,cp,(parent->size-taillen-1)*sizeof(raxNode**));
+
+    /* Move the remaining "tail" pointers at the right position as well. */
+    size_t valuelen = (parent->iskey && !parent->isnull) ? sizeof(void*) : 0;
+    memmove(((char*)c)-shift,c+1,taillen*sizeof(raxNode**)+valuelen);
+
+    /* 4. Update size. */
+    parent->size--;
+
+    /* realloc the node according to the theoretical memory usage, to free
+     * data if we are over-allocating right now. */
+    raxNode *newnode = rax_realloc(parent,raxNodeCurrentLength(parent));
+    if (newnode) {
+        debugnode("raxRemoveChild after", newnode);
+    }
+    /* Note: if rax_realloc() fails we just return the old address, which
+     * is valid. */
+    return newnode ? newnode : parent;
+}
+
+/* Remove the specified item. Returns 1 if the item was found and
+ * deleted, 0 otherwise. */
+int raxRemove(rax *rax, unsigned char *s, size_t len, void **old) {
+    raxNode *h;
+    raxStack ts;
+
+    debugf("### Delete: %.*s\n", (int)len, s);
+    raxStackInit(&ts);
+    int splitpos = 0;
+    size_t i = raxLowWalk(rax,s,len,&h,NULL,&splitpos,&ts);
+    if (i != len || (h->iscompr && splitpos != 0) || !h->iskey) {
+        raxStackFree(&ts);
+        return 0;
+    }
+    if (old) *old = raxGetData(h);
+    h->iskey = 0;
+    rax->numele--;
+
+    /* If this node has no children, the deletion needs to reclaim the
+     * no longer used nodes. This is an iterative process that needs to
+     * walk the three upward, deleting all the nodes with just one child
+     * that are not keys, until the head of the rax is reached or the first
+     * node with more than one child is found. */
+
+    int trycompress = 0; /* Will be set to 1 if we should try to optimize the
+                            tree resulting from the deletion. */
+
+    if (h->size == 0) {
+        debugf("Key deleted in node without children. Cleanup needed.\n");
+        raxNode *child = NULL;
+        while(h != rax->head) {
+            child = h;
+            debugf("Freeing child %p [%.*s] key:%d\n", (void*)child,
+                (int)child->size, (char*)child->data, child->iskey);
+            rax_free(child);
+            rax->numnodes--;
+            h = raxStackPop(&ts);
+             /* If this node has more then one child, or actually holds
+              * a key, stop here. */
+            if (h->iskey || (!h->iscompr && h->size != 1)) break;
+        }
+        if (child) {
+            debugf("Unlinking child %p from parent %p\n",
+                (void*)child, (void*)h);
+            raxNode *new = raxRemoveChild(h,child);
+            if (new != h) {
+                raxNode *parent = raxStackPeek(&ts);
+                raxNode **parentlink;
+                if (parent == NULL) {
+                    parentlink = &rax->head;
+                } else {
+                    parentlink = raxFindParentLink(parent,h);
+                }
+                memcpy(parentlink,&new,sizeof(new));
+            }
+
+            /* If after the removal the node has just a single child
+             * and is not a key, we need to try to compress it. */
+            if (new->size == 1 && new->iskey == 0) {
+                trycompress = 1;
+                h = new;
+            }
+        }
+    } else if (h->size == 1) {
+        /* If the node had just one child, after the removal of the key
+         * further compression with adjacent nodes is potentially possible. */
+        trycompress = 1;
+    }
+
+    /* Don't try node compression if our nodes pointers stack is not
+     * complete because of OOM while executing raxLowWalk() */
+    if (trycompress && ts.oom) trycompress = 0;
+
+    /* Recompression: if trycompress is true, 'h' points to a radix tree node
+     * that changed in a way that could allow to compress nodes in this
+     * sub-branch. Compressed nodes represent chains of nodes that are not
+     * keys and have a single child, so there are two deletion events that
+     * may alter the tree so that further compression is needed:
+     *
+     * 1) A node with a single child was a key and now no longer is a key.
+     * 2) A node with two children now has just one child.
+     *
+     * We try to navigate upward till there are other nodes that can be
+     * compressed, when we reach the upper node which is not a key and has
+     * a single child, we scan the chain of children to collect the
+     * compressable part of the tree, and replace the current node with the
+     * new one, fixing the child pointer to reference the first non
+     * compressable node.
+     *
+     * Example of case "1". A tree stores the keys "FOO" = 1 and
+     * "FOOBAR" = 2:
+     *
+     *
+     * "FOO" -> "BAR" -> [] (2)
+     *           (1)
+     *
+     * After the removal of "FOO" the tree can be compressed as:
+     *
+     * "FOOBAR" -> [] (2)
+     *
+     *
+     * Example of case "2". A tree stores the keys "FOOBAR" = 1 and
+     * "FOOTER" = 2:
+     *
+     *          |B| -> "AR" -> [] (1)
+     * "FOO" -> |-|
+     *          |T| -> "ER" -> [] (2)
+     *
+     * After the removal of "FOOTER" the resulting tree is:
+     *
+     * "FOO" -> |B| -> "AR" -> [] (1)
+     *
+     * That can be compressed into:
+     *
+     * "FOOBAR" -> [] (1)
+     */
+    if (trycompress) {
+        debugf("After removing %.*s:\n", (int)len, s);
+        debugnode("Compression may be needed",h);
+        debugf("Seek start node\n");
+
+        /* Try to reach the upper node that is compressible.
+         * At the end of the loop 'h' will point to the first node we
+         * can try to compress and 'parent' to its parent. */
+        raxNode *parent;
+        while(1) {
+            parent = raxStackPop(&ts);
+            if (!parent || parent->iskey ||
+                (!parent->iscompr && parent->size != 1)) break;
+            h = parent;
+            debugnode("Going up to",h);
+        }
+        raxNode *start = h; /* Compression starting node. */
+
+        /* Scan chain of nodes we can compress. */
+        size_t comprsize = h->size;
+        int nodes = 1;
+        while(h->size != 0) {
+            raxNode **cp = raxNodeLastChildPtr(h);
+            memcpy(&h,cp,sizeof(h));
+            if (h->iskey || (!h->iscompr && h->size != 1)) break;
+            /* Stop here if going to the next node would result into
+             * a compressed node larger than h->size can hold. */
+            if (comprsize + h->size > RAX_NODE_MAX_SIZE) break;
+            nodes++;
+            comprsize += h->size;
+        }
+        if (nodes > 1) {
+            /* If we can compress, create the new node and populate it. */
+            size_t nodesize =
+                sizeof(raxNode)+comprsize+raxPadding(comprsize)+sizeof(raxNode*);
+            raxNode *new = rax_malloc(nodesize);
+            /* An out of memory here just means we cannot optimize this
+             * node, but the tree is left in a consistent state. */
+            if (new == NULL) {
+                raxStackFree(&ts);
+                return 1;
+            }
+            new->iskey = 0;
+            new->isnull = 0;
+            new->iscompr = 1;
+            new->size = comprsize;
+            rax->numnodes++;
+
+            /* Scan again, this time to populate the new node content and
+             * to fix the new node child pointer. At the same time we free
+             * all the nodes that we'll no longer use. */
+            comprsize = 0;
+            h = start;
+            while(h->size != 0) {
+                memcpy(new->data+comprsize,h->data,h->size);
+                comprsize += h->size;
+                raxNode **cp = raxNodeLastChildPtr(h);
+                raxNode *tofree = h;
+                memcpy(&h,cp,sizeof(h));
+                rax_free(tofree); rax->numnodes--;
+                if (h->iskey || (!h->iscompr && h->size != 1)) break;
+            }
+            debugnode("New node",new);
+
+            /* Now 'h' points to the first node that we still need to use,
+             * so our new node child pointer will point to it. */
+            raxNode **cp = raxNodeLastChildPtr(new);
+            memcpy(cp,&h,sizeof(h));
+
+            /* Fix parent link. */
+            if (parent) {
+                raxNode **parentlink = raxFindParentLink(parent,start);
+                memcpy(parentlink,&new,sizeof(new));
+            } else {
+                rax->head = new;
+            }
+
+            debugf("Compressed %d nodes, %d total bytes\n",
+                nodes, (int)comprsize);
+        }
+    }
+    raxStackFree(&ts);
+    return 1;
+}
+
+/* This is the core of raxFree(): performs a depth-first scan of the
+ * tree and releases all the nodes found. */
+void raxRecursiveFree(rax *rax, raxNode *n, void (*free_callback)(void*)) {
+    debugnode("free traversing",n);
+    int numchildren = n->iscompr ? 1 : n->size;
+    raxNode **cp = raxNodeLastChildPtr(n);
+    while(numchildren--) {
+        raxNode *child;
+        memcpy(&child,cp,sizeof(child));
+        raxRecursiveFree(rax,child,free_callback);
+        cp--;
+    }
+    debugnode("free depth-first",n);
+    if (free_callback && n->iskey && !n->isnull)
+        free_callback(raxGetData(n));
+    rax_free(n);
+    rax->numnodes--;
+}
+
+/* Free a whole radix tree, calling the specified callback in order to
+ * free the auxiliary data. */
+void raxFreeWithCallback(rax *rax, void (*free_callback)(void*)) {
+    raxRecursiveFree(rax,rax->head,free_callback);
+    assert(rax->numnodes == 0);
+    rax_free(rax);
+}
+
+/* Free a whole radix tree. */
+void raxFree(rax *rax) {
+    raxFreeWithCallback(rax,NULL);
+}
+
+/* ------------------------------- Iterator --------------------------------- */
+
+/* Initialize a Rax iterator. This call should be performed a single time
+ * to initialize the iterator, and must be followed by a raxSeek() call,
+ * otherwise the raxPrev()/raxNext() functions will just return EOF. */
+void raxStart(raxIterator *it, rax *rt) {
+    it->flags = RAX_ITER_EOF; /* No crash if the iterator is not seeked. */
+    it->rt = rt;
+    it->key_len = 0;
+    it->key = it->key_static_string;
+    it->key_max = RAX_ITER_STATIC_LEN;
+    it->data = NULL;
+    it->node_cb = NULL;
+    raxStackInit(&it->stack);
+}
+
+/* Append characters at the current key string of the iterator 'it'. This
+ * is a low level function used to implement the iterator, not callable by
+ * the user. Returns 0 on out of memory, otherwise 1 is returned. */
+int raxIteratorAddChars(raxIterator *it, unsigned char *s, size_t len) {
+    if (it->key_max < it->key_len+len) {
+        unsigned char *old = (it->key == it->key_static_string) ? NULL :
+                                                                  it->key;
+        size_t new_max = (it->key_len+len)*2;
+        it->key = rax_realloc(old,new_max);
+        if (it->key == NULL) {
+            it->key = (!old) ? it->key_static_string : old;
+            errno = ENOMEM;
+            return 0;
+        }
+        if (old == NULL) memcpy(it->key,it->key_static_string,it->key_len);
+        it->key_max = new_max;
+    }
+    /* Use memmove since there could be an overlap between 's' and
+     * it->key when we use the current key in order to re-seek. */
+    memmove(it->key+it->key_len,s,len);
+    it->key_len += len;
+    return 1;
+}
+
+/* Remove the specified number of chars from the right of the current
+ * iterator key. */
+void raxIteratorDelChars(raxIterator *it, size_t count) {
+    it->key_len -= count;
+}
+
+/* Do an iteration step towards the next element. At the end of the step the
+ * iterator key will represent the (new) current key. If it is not possible
+ * to step in the specified direction since there are no longer elements, the
+ * iterator is flagged with RAX_ITER_EOF.
+ *
+ * If 'noup' is true the function starts directly scanning for the next
+ * lexicographically smaller children, and the current node is already assumed
+ * to be the parent of the last key node, so the first operation to go back to
+ * the parent will be skipped. This option is used by raxSeek() when
+ * implementing seeking a non existing element with the ">" or "<" options:
+ * the starting node is not a key in that particular case, so we start the scan
+ * from a node that does not represent the key set.
+ *
+ * The function returns 1 on success or 0 on out of memory. */
+int raxIteratorNextStep(raxIterator *it, int noup) {
+    if (it->flags & RAX_ITER_EOF) {
+        return 1;
+    } else if (it->flags & RAX_ITER_JUST_SEEKED) {
+        it->flags &= ~RAX_ITER_JUST_SEEKED;
+        return 1;
+    }
+
+    /* Save key len, stack items and the node where we are currently
+     * so that on iterator EOF we can restore the current key and state. */
+    size_t orig_key_len = it->key_len;
+    size_t orig_stack_items = it->stack.items;
+    raxNode *orig_node = it->node;
+
+    while(1) {
+        int children = it->node->iscompr ? 1 : it->node->size;
+        if (!noup && children) {
+            debugf("GO DEEPER\n");
+            /* Seek the lexicographically smaller key in this subtree, which
+             * is the first one found always going towards the first child
+             * of every successive node. */
+            if (!raxStackPush(&it->stack,it->node)) return 0;
+            raxNode **cp = raxNodeFirstChildPtr(it->node);
+            if (!raxIteratorAddChars(it,it->node->data,
+                it->node->iscompr ? it->node->size : 1)) return 0;
+            memcpy(&it->node,cp,sizeof(it->node));
+            /* Call the node callback if any, and replace the node pointer
+             * if the callback returns true. */
+            if (it->node_cb && it->node_cb(&it->node))
+                memcpy(cp,&it->node,sizeof(it->node));
+            /* For "next" step, stop every time we find a key along the
+             * way, since the key is lexicograhically smaller compared to
+             * what follows in the sub-children. */
+            if (it->node->iskey) {
+                it->data = raxGetData(it->node);
+                return 1;
+            }
+        } else {
+            /* If we finished exploring the previous sub-tree, switch to the
+             * new one: go upper until a node is found where there are
+             * children representing keys lexicographically greater than the
+             * current key. */
+            while(1) {
+                int old_noup = noup;
+
+                /* Already on head? Can't go up, iteration finished. */
+                if (!noup && it->node == it->rt->head) {
+                    it->flags |= RAX_ITER_EOF;
+                    it->stack.items = orig_stack_items;
+                    it->key_len = orig_key_len;
+                    it->node = orig_node;
+                    return 1;
+                }
+                /* If there are no children at the current node, try parent's
+                 * next child. */
+                unsigned char prevchild = it->key[it->key_len-1];
+                if (!noup) {
+                    it->node = raxStackPop(&it->stack);
+                } else {
+                    noup = 0;
+                }
+                /* Adjust the current key to represent the node we are
+                 * at. */
+                int todel = it->node->iscompr ? it->node->size : 1;
+                raxIteratorDelChars(it,todel);
+
+                /* Try visiting the next child if there was at least one
+                 * additional child. */
+                if (!it->node->iscompr && it->node->size > (old_noup ? 0 : 1)) {
+                    raxNode **cp = raxNodeFirstChildPtr(it->node);
+                    int i = 0;
+                    while (i < it->node->size) {
+                        debugf("SCAN NEXT %c\n", it->node->data[i]);
+                        if (it->node->data[i] > prevchild) break;
+                        i++;
+                        cp++;
+                    }
+                    if (i != it->node->size) {
+                        debugf("SCAN found a new node\n");
+                        raxIteratorAddChars(it,it->node->data+i,1);
+                        if (!raxStackPush(&it->stack,it->node)) return 0;
+                        memcpy(&it->node,cp,sizeof(it->node));
+                        /* Call the node callback if any, and replace the node
+                         * pointer if the callback returns true. */
+                        if (it->node_cb && it->node_cb(&it->node))
+                            memcpy(cp,&it->node,sizeof(it->node));
+                        if (it->node->iskey) {
+                            it->data = raxGetData(it->node);
+                            return 1;
+                        }
+                        break;
+                    }
+                }
+            }
+        }
+    }
+}
+
+/* Seek the greatest key in the subtree at the current node. Return 0 on
+ * out of memory, otherwise 1. This is an helper function for different
+ * iteration functions below. */
+int raxSeekGreatest(raxIterator *it) {
+    while(it->node->size) {
+        if (it->node->iscompr) {
+            if (!raxIteratorAddChars(it,it->node->data,
+                it->node->size)) return 0;
+        } else {
+            if (!raxIteratorAddChars(it,it->node->data+it->node->size-1,1))
+                return 0;
+        }
+        raxNode **cp = raxNodeLastChildPtr(it->node);
+        if (!raxStackPush(&it->stack,it->node)) return 0;
+        memcpy(&it->node,cp,sizeof(it->node));
+    }
+    return 1;
+}
+
+/* Like raxIteratorNextStep() but implements an iteration step moving
+ * to the lexicographically previous element. The 'noup' option has a similar
+ * effect to the one of raxIteratorNextStep(). */
+int raxIteratorPrevStep(raxIterator *it, int noup) {
+    if (it->flags & RAX_ITER_EOF) {
+        return 1;
+    } else if (it->flags & RAX_ITER_JUST_SEEKED) {
+        it->flags &= ~RAX_ITER_JUST_SEEKED;
+        return 1;
+    }
+
+    /* Save key len, stack items and the node where we are currently
+     * so that on iterator EOF we can restore the current key and state. */
+    size_t orig_key_len = it->key_len;
+    size_t orig_stack_items = it->stack.items;
+    raxNode *orig_node = it->node;
+
+    while(1) {
+        int old_noup = noup;
+
+        /* Already on head? Can't go up, iteration finished. */
+        if (!noup && it->node == it->rt->head) {
+            it->flags |= RAX_ITER_EOF;
+            it->stack.items = orig_stack_items;
+            it->key_len = orig_key_len;
+            it->node = orig_node;
+            return 1;
+        }
+
+        unsigned char prevchild = it->key[it->key_len-1];
+        if (!noup) {
+            it->node = raxStackPop(&it->stack);
+        } else {
+            noup = 0;
+        }
+
+        /* Adjust the current key to represent the node we are
+         * at. */
+        int todel = it->node->iscompr ? it->node->size : 1;
+        raxIteratorDelChars(it,todel);
+
+        /* Try visiting the prev child if there is at least one
+         * child. */
+        if (!it->node->iscompr && it->node->size > (old_noup ? 0 : 1)) {
+            raxNode **cp = raxNodeLastChildPtr(it->node);
+            int i = it->node->size-1;
+            while (i >= 0) {
+                debugf("SCAN PREV %c\n", it->node->data[i]);
+                if (it->node->data[i] < prevchild) break;
+                i--;
+                cp--;
+            }
+            /* If we found a new subtree to explore in this node,
+             * go deeper following all the last children in order to
+             * find the key lexicographically greater. */
+            if (i != -1) {
+                debugf("SCAN found a new node\n");
+                /* Enter the node we just found. */
+                if (!raxIteratorAddChars(it,it->node->data+i,1)) return 0;
+                if (!raxStackPush(&it->stack,it->node)) return 0;
+                memcpy(&it->node,cp,sizeof(it->node));
+                /* Seek sub-tree max. */
+                if (!raxSeekGreatest(it)) return 0;
+            }
+        }
+
+        /* Return the key: this could be the key we found scanning a new
+         * subtree, or if we did not find a new subtree to explore here,
+         * before giving up with this node, check if it's a key itself. */
+        if (it->node->iskey) {
+            it->data = raxGetData(it->node);
+            return 1;
+        }
+    }
+}
+
+/* Seek an iterator at the specified element.
+ * Return 0 if the seek failed for syntax error or out of memory. Otherwise
+ * 1 is returned. When 0 is returned for out of memory, errno is set to
+ * the ENOMEM value. */
+int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len) {
+    int eq = 0, lt = 0, gt = 0, first = 0, last = 0;
+
+    it->stack.items = 0; /* Just resetting. Initialized by raxStart(). */
+    it->flags |= RAX_ITER_JUST_SEEKED;
+    it->flags &= ~RAX_ITER_EOF;
+    it->key_len = 0;
+    it->node = NULL;
+
+    /* Set flags according to the operator used to perform the seek. */
+    if (op[0] == '>') {
+        gt = 1;
+        if (op[1] == '=') eq = 1;
+    } else if (op[0] == '<') {
+        lt = 1;
+        if (op[1] == '=') eq = 1;
+    } else if (op[0] == '=') {
+        eq = 1;
+    } else if (op[0] == '^') {
+        first = 1;
+    } else if (op[0] == '$') {
+        last = 1;
+    } else {
+        errno = 0;
+        return 0; /* Error. */
+    }
+
+    /* If there are no elements, set the EOF condition immediately and
+     * return. */
+    if (it->rt->numele == 0) {
+        it->flags |= RAX_ITER_EOF;
+        return 1;
+    }
+
+    if (first) {
+        /* Seeking the first key greater or equal to the empty string
+         * is equivalent to seeking the smaller key available. */
+        return raxSeek(it,">=",NULL,0);
+    }
+
+    if (last) {
+        /* Find the greatest key taking always the last child till a
+         * final node is found. */
+        it->node = it->rt->head;
+        if (!raxSeekGreatest(it)) return 0;
+        assert(it->node->iskey);
+        it->data = raxGetData(it->node);
+        return 1;
+    }
+
+    /* We need to seek the specified key. What we do here is to actually
+     * perform a lookup, and later invoke the prev/next key code that
+     * we already use for iteration. */
+    int splitpos = 0;
+    size_t i = raxLowWalk(it->rt,ele,len,&it->node,NULL,&splitpos,&it->stack);
+
+    /* Return OOM on incomplete stack info. */
+    if (it->stack.oom) return 0;
+
+    if (eq && i == len && (!it->node->iscompr || splitpos == 0) &&
+        it->node->iskey)
+    {
+        /* We found our node, since the key matches and we have an
+         * "equal" condition. */
+        if (!raxIteratorAddChars(it,ele,len)) return 0; /* OOM. */
+        it->data = raxGetData(it->node);
+    } else if (lt || gt) {
+        /* Exact key not found or eq flag not set. We have to set as current
+         * key the one represented by the node we stopped at, and perform
+         * a next/prev operation to seek. To reconstruct the key at this node
+         * we start from the parent and go to the current node, accumulating
+         * the characters found along the way. */
+        if (!raxStackPush(&it->stack,it->node)) return 0;
+        for (size_t j = 1; j < it->stack.items; j++) {
+            raxNode *parent = it->stack.stack[j-1];
+            raxNode *child = it->stack.stack[j];
+            if (parent->iscompr) {
+                if (!raxIteratorAddChars(it,parent->data,parent->size))
+                    return 0;
+            } else {
+                raxNode **cp = raxNodeFirstChildPtr(parent);
+                unsigned char *p = parent->data;
+                while(1) {
+                    raxNode *aux;
+                    memcpy(&aux,cp,sizeof(aux));
+                    if (aux == child) break;
+                    cp++;
+                    p++;
+                }
+                if (!raxIteratorAddChars(it,p,1)) return 0;
+            }
+        }
+        raxStackPop(&it->stack);
+
+        /* We need to set the iterator in the correct state to call next/prev
+         * step in order to seek the desired element. */
+        debugf("After initial seek: i=%d len=%d key=%.*s\n",
+            (int)i, (int)len, (int)it->key_len, it->key);
+        if (i != len && !it->node->iscompr) {
+            /* If we stopped in the middle of a normal node because of a
+             * mismatch, add the mismatching character to the current key
+             * and call the iterator with the 'noup' flag so that it will try
+             * to seek the next/prev child in the current node directly based
+             * on the mismatching character. */
+            if (!raxIteratorAddChars(it,ele+i,1)) return 0;
+            debugf("Seek normal node on mismatch: %.*s\n",
+                (int)it->key_len, (char*)it->key);
+
+            it->flags &= ~RAX_ITER_JUST_SEEKED;
+            if (lt && !raxIteratorPrevStep(it,1)) return 0;
+            if (gt && !raxIteratorNextStep(it,1)) return 0;
+            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
+        } else if (i != len && it->node->iscompr) {
+            debugf("Compressed mismatch: %.*s\n",
+                (int)it->key_len, (char*)it->key);
+            /* In case of a mismatch within a compressed node. */
+            int nodechar = it->node->data[splitpos];
+            int keychar = ele[i];
+            it->flags &= ~RAX_ITER_JUST_SEEKED;
+            if (gt) {
+                /* If the key the compressed node represents is greater
+                 * than our seek element, continue forward, otherwise set the
+                 * state in order to go back to the next sub-tree. */
+                if (nodechar > keychar) {
+                    if (!raxIteratorNextStep(it,0)) return 0;
+                } else {
+                    if (!raxIteratorAddChars(it,it->node->data,it->node->size))
+                        return 0;
+                    if (!raxIteratorNextStep(it,1)) return 0;
+                }
+            }
+            if (lt) {
+                /* If the key the compressed node represents is smaller
+                 * than our seek element, seek the greater key in this
+                 * subtree, otherwise set the state in order to go back to
+                 * the previous sub-tree. */
+                if (nodechar < keychar) {
+                    if (!raxSeekGreatest(it)) return 0;
+                    it->data = raxGetData(it->node);
+                } else {
+                    if (!raxIteratorAddChars(it,it->node->data,it->node->size))
+                        return 0;
+                    if (!raxIteratorPrevStep(it,1)) return 0;
+                }
+            }
+            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
+        } else {
+            debugf("No mismatch: %.*s\n",
+                (int)it->key_len, (char*)it->key);
+            /* If there was no mismatch we are into a node representing the
+             * key, (but which is not a key or the seek operator does not
+             * include 'eq'), or we stopped in the middle of a compressed node
+             * after processing all the key. Continue iterating as this was
+             * a legitimate key we stopped at. */
+            it->flags &= ~RAX_ITER_JUST_SEEKED;
+            if (it->node->iscompr && it->node->iskey && splitpos && lt) {
+                /* If we stopped in the middle of a compressed node with
+                 * perfect match, and the condition is to seek a key "<" than
+                 * the specified one, then if this node is a key it already
+                 * represents our match. For instance we may have nodes:
+                 *
+                 * "f" -> "oobar" = 1 -> "" = 2
+                 *
+                 * Representing keys "f" = 1, "foobar" = 2. A seek for
+                 * the key < "foo" will stop in the middle of the "oobar"
+                 * node, but will be our match, representing the key "f".
+                 *
+                 * So in that case, we don't seek backward. */
+                it->data = raxGetData(it->node);
+            } else {
+                if (gt && !raxIteratorNextStep(it,0)) return 0;
+                if (lt && !raxIteratorPrevStep(it,0)) return 0;
+            }
+            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
+        }
+    } else {
+        /* If we are here just eq was set but no match was found. */
+        it->flags |= RAX_ITER_EOF;
+        return 1;
+    }
+    return 1;
+}
+
+/* Go to the next element in the scope of the iterator 'it'.
+ * If EOF (or out of memory) is reached, 0 is returned, otherwise 1 is
+ * returned. In case 0 is returned because of OOM, errno is set to ENOMEM. */
+int raxNext(raxIterator *it) {
+    if (!raxIteratorNextStep(it,0)) {
+        errno = ENOMEM;
+        return 0;
+    }
+    if (it->flags & RAX_ITER_EOF) {
+        errno = 0;
+        return 0;
+    }
+    return 1;
+}
+
+/* Go to the previous element in the scope of the iterator 'it'.
+ * If EOF (or out of memory) is reached, 0 is returned, otherwise 1 is
+ * returned. In case 0 is returned because of OOM, errno is set to ENOMEM. */
+int raxPrev(raxIterator *it) {
+    if (!raxIteratorPrevStep(it,0)) {
+        errno = ENOMEM;
+        return 0;
+    }
+    if (it->flags & RAX_ITER_EOF) {
+        errno = 0;
+        return 0;
+    }
+    return 1;
+}
+
+/* Perform a random walk starting in the current position of the iterator.
+ * Return 0 if the tree is empty or on out of memory. Otherwise 1 is returned
+ * and the iterator is set to the node reached after doing a random walk
+ * of 'steps' steps. If the 'steps' argument is 0, the random walk is performed
+ * using a random number of steps between 1 and two times the logarithm of
+ * the number of elements.
+ *
+ * NOTE: if you use this function to generate random elements from the radix
+ * tree, expect a disappointing distribution. A random walk produces good
+ * random elements if the tree is not sparse, however in the case of a radix
+ * tree certain keys will be reported much more often than others. At least
+ * this function should be able to explore every possible element eventually. */
+int raxRandomWalk(raxIterator *it, size_t steps) {
+    if (it->rt->numele == 0) {
+        it->flags |= RAX_ITER_EOF;
+        return 0;
+    }
+
+    if (steps == 0) {
+        size_t fle = 1+floor(log(it->rt->numele));
+        fle *= 2;
+        steps = 1 + rand() % fle;
+    }
+
+    raxNode *n = it->node;
+    while(steps > 0 || !n->iskey) {
+        int numchildren = n->iscompr ? 1 : n->size;
+        int r = rand() % (numchildren+(n != it->rt->head));
+
+        if (r == numchildren) {
+            /* Go up to parent. */
+            n = raxStackPop(&it->stack);
+            int todel = n->iscompr ? n->size : 1;
+            raxIteratorDelChars(it,todel);
+        } else {
+            /* Select a random child. */
+            if (n->iscompr) {
+                if (!raxIteratorAddChars(it,n->data,n->size)) return 0;
+            } else {
+                if (!raxIteratorAddChars(it,n->data+r,1)) return 0;
+            }
+            raxNode **cp = raxNodeFirstChildPtr(n)+r;
+            if (!raxStackPush(&it->stack,n)) return 0;
+            memcpy(&n,cp,sizeof(n));
+        }
+        if (n->iskey) steps--;
+    }
+    it->node = n;
+    it->data = raxGetData(it->node);
+    return 1;
+}
+
+/* Compare the key currently pointed by the iterator to the specified
+ * key according to the specified operator. Returns 1 if the comparison is
+ * true, otherwise 0 is returned. */
+int raxCompare(raxIterator *iter, const char *op, unsigned char *key, size_t key_len) {
+    int eq = 0, lt = 0, gt = 0;
+
+    if (op[0] == '=' || op[1] == '=') eq = 1;
+    if (op[0] == '>') gt = 1;
+    else if (op[0] == '<') lt = 1;
+    else if (op[1] != '=') return 0; /* Syntax error. */
+
+    size_t minlen = key_len < iter->key_len ? key_len : iter->key_len;
+    int cmp = memcmp(iter->key,key,minlen);
+
+    /* Handle == */
+    if (lt == 0 && gt == 0) return cmp == 0 && key_len == iter->key_len;
+
+    /* Handle >, >=, <, <= */
+    if (cmp == 0) {
+        /* Same prefix: longer wins. */
+        if (eq && key_len == iter->key_len) return 1;
+        else if (lt) return iter->key_len < key_len;
+        else if (gt) return iter->key_len > key_len;
+        else return 0; /* Avoid warning, just 'eq' is handled before. */
+    } else if (cmp > 0) {
+        return gt ? 1 : 0;
+    } else /* (cmp < 0) */ {
+        return lt ? 1 : 0;
+    }
+}
+
+/* Free the iterator. */
+void raxStop(raxIterator *it) {
+    if (it->key != it->key_static_string) rax_free(it->key);
+    raxStackFree(&it->stack);
+}
+
+/* Return if the iterator is in an EOF state. This happens when raxSeek()
+ * failed to seek an appropriate element, so that raxNext() or raxPrev()
+ * will return zero, or when an EOF condition was reached while iterating
+ * with raxNext() and raxPrev(). */
+int raxEOF(raxIterator *it) {
+    return it->flags & RAX_ITER_EOF;
+}
+
+/* Return the number of elements inside the radix tree. */
+uint64_t raxSize(rax *rax) {
+    return rax->numele;
+}
+
+/* ----------------------------- Introspection ------------------------------ */
+
+/* This function is mostly used for debugging and learning purposes.
+ * It shows an ASCII representation of a tree on standard output, outline
+ * all the nodes and the contained keys.
+ *
+ * The representation is as follow:
+ *
+ *  "foobar" (compressed node)
+ *  [abc] (normal node with three children)
+ *  [abc]=0x12345678 (node is a key, pointing to value 0x12345678)
+ *  [] (a normal empty node)
+ *
+ *  Children are represented in new indented lines, each children prefixed by
+ *  the "`-(x)" string, where "x" is the edge byte.
+ *
+ *  [abc]
+ *   `-(a) "ladin"
+ *   `-(b) [kj]
+ *   `-(c) []
+ *
+ *  However when a node has a single child the following representation
+ *  is used instead:
+ *
+ *  [abc] -> "ladin" -> []
+ */
+
+/* The actual implementation of raxShow(). */
+void raxRecursiveShow(int level, int lpad, raxNode *n) {
+    char s = n->iscompr ? '"' : '[';
+    char e = n->iscompr ? '"' : ']';
+
+    int numchars = printf("%c%.*s%c", s, n->size, n->data, e);
+    if (n->iskey) {
+        numchars += printf("=%p",raxGetData(n));
+    }
+
+    int numchildren = n->iscompr ? 1 : n->size;
+    /* Note that 7 and 4 magic constants are the string length
+     * of " `-(x) " and " -> " respectively. */
+    if (level) {
+        lpad += (numchildren > 1) ? 7 : 4;
+        if (numchildren == 1) lpad += numchars;
+    }
+    raxNode **cp = raxNodeFirstChildPtr(n);
+    for (int i = 0; i < numchildren; i++) {
+        char *branch = " `-(%c) ";
+        if (numchildren > 1) {
+            printf("\n");
+            for (int j = 0; j < lpad; j++) putchar(' ');
+            printf(branch,n->data[i]);
+        } else {
+            printf(" -> ");
+        }
+        raxNode *child;
+        memcpy(&child,cp,sizeof(child));
+        raxRecursiveShow(level+1,lpad,child);
+        cp++;
+    }
+}
+
+/* Show a tree, as outlined in the comment above. */
+void raxShow(rax *rax) {
+    raxRecursiveShow(0,0,rax->head);
+    putchar('\n');
+}
+
+/* Used by debugnode() macro to show info about a given node. */
+void raxDebugShowNode(const char *msg, raxNode *n) {
+    if (raxDebugMsg == 0) return;
+    printf("%s: %p [%.*s] key:%u size:%u children:",
+        msg, (void*)n, (int)n->size, (char*)n->data, n->iskey, n->size);
+    int numcld = n->iscompr ? 1 : n->size;
+    raxNode **cldptr = raxNodeLastChildPtr(n) - (numcld-1);
+    while(numcld--) {
+        raxNode *child;
+        memcpy(&child,cldptr,sizeof(child));
+        cldptr++;
+        printf("%p ", (void*)child);
+    }
+    printf("\n");
+    fflush(stdout);
+}
+
+/* Touch all the nodes of a tree returning a check sum. This is useful
+ * in order to make Valgrind detect if there is something wrong while
+ * reading the data structure.
+ *
+ * This function was used in order to identify Rax bugs after a big refactoring
+ * using this technique:
+ *
+ * 1. The rax-test is executed using Valgrind, adding a printf() so that for
+ *    the fuzz tester we see what iteration in the loop we are in.
+ * 2. After every modification of the radix tree made by the fuzz tester
+ *    in rax-test.c, we add a call to raxTouch().
+ * 3. Now as soon as an operation will corrupt the tree, raxTouch() will
+ *    detect it (via Valgrind) immediately. We can add more calls to narrow
+ *    the state.
+ * 4. At this point a good idea is to enable Rax debugging messages immediately
+ *    before the moment the tree is corrupted, to see what happens.
+ */
+unsigned long raxTouch(raxNode *n) {
+    debugf("Touching %p\n", (void*)n);
+    unsigned long sum = 0;
+    if (n->iskey) {
+        sum += (unsigned long)raxGetData(n);
+    }
+
+    int numchildren = n->iscompr ? 1 : n->size;
+    raxNode **cp = raxNodeFirstChildPtr(n);
+    int count = 0;
+    for (int i = 0; i < numchildren; i++) {
+        if (numchildren > 1) {
+            sum += (long)n->data[i];
+        }
+        raxNode *child;
+        memcpy(&child,cp,sizeof(child));
+        if (child == (void*)0x65d1760) count++;
+        if (count > 1) exit(1);
+        sum += raxTouch(child);
+        cp++;
+    }
+    return sum;
+}
diff --git a/redis-stable/src/rax.h b/redis-stable/src/rax.h
new file mode 100644
index 00000000..6b1fd418
--- /dev/null
+++ b/redis-stable/src/rax.h
@@ -0,0 +1,216 @@
+/* Rax -- A radix tree implementation.
+ *
+ * Copyright (c) 2017-2018, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef RAX_H
+#define RAX_H
+
+#include <stdint.h>
+
+/* Representation of a radix tree as implemented in this file, that contains
+ * the strings "foo", "foobar" and "footer" after the insertion of each
+ * word. When the node represents a key inside the radix tree, we write it
+ * between [], otherwise it is written between ().
+ *
+ * This is the vanilla representation:
+ *
+ *              (f) ""
+ *                \
+ *                (o) "f"
+ *                  \
+ *                  (o) "fo"
+ *                    \
+ *                  [t   b] "foo"
+ *                  /     \
+ *         "foot" (e)     (a) "foob"
+ *                /         \
+ *      "foote" (r)         (r) "fooba"
+ *              /             \
+ *    "footer" []             [] "foobar"
+ *
+ * However, this implementation implements a very common optimization where
+ * successive nodes having a single child are "compressed" into the node
+ * itself as a string of characters, each representing a next-level child,
+ * and only the link to the node representing the last character node is
+ * provided inside the representation. So the above representation is turned
+ * into:
+ *
+ *                  ["foo"] ""
+ *                     |
+ *                  [t   b] "foo"
+ *                  /     \
+ *        "foot" ("er")    ("ar") "foob"
+ *                 /          \
+ *       "footer" []          [] "foobar"
+ *
+ * However this optimization makes the implementation a bit more complex.
+ * For instance if a key "first" is added in the above radix tree, a
+ * "node splitting" operation is needed, since the "foo" prefix is no longer
+ * composed of nodes having a single child one after the other. This is the
+ * above tree and the resulting node splitting after this event happens:
+ *
+ *
+ *                    (f) ""
+ *                    /
+ *                 (i o) "f"
+ *                 /   \
+ *    "firs"  ("rst")  (o) "fo"
+ *              /        \
+ *    "first" []       [t   b] "foo"
+ *                     /     \
+ *           "foot" ("er")    ("ar") "foob"
+ *                    /          \
+ *          "footer" []          [] "foobar"
+ *
+ * Similarly after deletion, if a new chain of nodes having a single child
+ * is created (the chain must also not include nodes that represent keys),
+ * it must be compressed back into a single node.
+ *
+ */
+
+#define RAX_NODE_MAX_SIZE ((1<<29)-1)
+typedef struct raxNode {
+    uint32_t iskey:1;     /* Does this node contain a key? */
+    uint32_t isnull:1;    /* Associated value is NULL (don't store it). */
+    uint32_t iscompr:1;   /* Node is compressed. */
+    uint32_t size:29;     /* Number of children, or compressed string len. */
+    /* Data layout is as follows:
+     *
+     * If node is not compressed we have 'size' bytes, one for each children
+     * character, and 'size' raxNode pointers, point to each child node.
+     * Note how the character is not stored in the children but in the
+     * edge of the parents:
+     *
+     * [header iscompr=0][abc][a-ptr][b-ptr][c-ptr](value-ptr?)
+     *
+     * if node is compressed (iscompr bit is 1) the node has 1 children.
+     * In that case the 'size' bytes of the string stored immediately at
+     * the start of the data section, represent a sequence of successive
+     * nodes linked one after the other, for which only the last one in
+     * the sequence is actually represented as a node, and pointed to by
+     * the current compressed node.
+     *
+     * [header iscompr=1][xyz][z-ptr](value-ptr?)
+     *
+     * Both compressed and not compressed nodes can represent a key
+     * with associated data in the radix tree at any level (not just terminal
+     * nodes).
+     *
+     * If the node has an associated key (iskey=1) and is not NULL
+     * (isnull=0), then after the raxNode pointers pointing to the
+     * children, an additional value pointer is present (as you can see
+     * in the representation above as "value-ptr" field).
+     */
+    unsigned char data[];
+} raxNode;
+
+typedef struct rax {
+    raxNode *head;
+    uint64_t numele;
+    uint64_t numnodes;
+} rax;
+
+/* Stack data structure used by raxLowWalk() in order to, optionally, return
+ * a list of parent nodes to the caller. The nodes do not have a "parent"
+ * field for space concerns, so we use the auxiliary stack when needed. */
+#define RAX_STACK_STATIC_ITEMS 32
+typedef struct raxStack {
+    void **stack; /* Points to static_items or an heap allocated array. */
+    size_t items, maxitems; /* Number of items contained and total space. */
+    /* Up to RAXSTACK_STACK_ITEMS items we avoid to allocate on the heap
+     * and use this static array of pointers instead. */
+    void *static_items[RAX_STACK_STATIC_ITEMS];
+    int oom; /* True if pushing into this stack failed for OOM at some point. */
+} raxStack;
+
+/* Optional callback used for iterators and be notified on each rax node,
+ * including nodes not representing keys. If the callback returns true
+ * the callback changed the node pointer in the iterator structure, and the
+ * iterator implementation will have to replace the pointer in the radix tree
+ * internals. This allows the callback to reallocate the node to perform
+ * very special operations, normally not needed by normal applications.
+ *
+ * This callback is used to perform very low level analysis of the radix tree
+ * structure, scanning each possible node (but the root node), or in order to
+ * reallocate the nodes to reduce the allocation fragmentation (this is the
+ * Redis application for this callback).
+ *
+ * This is currently only supported in forward iterations (raxNext) */
+typedef int (*raxNodeCallback)(raxNode **noderef);
+
+/* Radix tree iterator state is encapsulated into this data structure. */
+#define RAX_ITER_STATIC_LEN 128
+#define RAX_ITER_JUST_SEEKED (1<<0) /* Iterator was just seeked. Return current
+                                       element for the first iteration and
+                                       clear the flag. */
+#define RAX_ITER_EOF (1<<1)    /* End of iteration reached. */
+#define RAX_ITER_SAFE (1<<2)   /* Safe iterator, allows operations while
+                                  iterating. But it is slower. */
+typedef struct raxIterator {
+    int flags;
+    rax *rt;                /* Radix tree we are iterating. */
+    unsigned char *key;     /* The current string. */
+    void *data;             /* Data associated to this key. */
+    size_t key_len;         /* Current key length. */
+    size_t key_max;         /* Max key len the current key buffer can hold. */
+    unsigned char key_static_string[RAX_ITER_STATIC_LEN];
+    raxNode *node;          /* Current node. Only for unsafe iteration. */
+    raxStack stack;         /* Stack used for unsafe iteration. */
+    raxNodeCallback node_cb; /* Optional node callback. Normally set to NULL. */
+} raxIterator;
+
+/* A special pointer returned for not found items. */
+extern void *raxNotFound;
+
+/* Exported API. */
+rax *raxNew(void);
+int raxInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old);
+int raxTryInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old);
+int raxRemove(rax *rax, unsigned char *s, size_t len, void **old);
+void *raxFind(rax *rax, unsigned char *s, size_t len);
+void raxFree(rax *rax);
+void raxFreeWithCallback(rax *rax, void (*free_callback)(void*));
+void raxStart(raxIterator *it, rax *rt);
+int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len);
+int raxNext(raxIterator *it);
+int raxPrev(raxIterator *it);
+int raxRandomWalk(raxIterator *it, size_t steps);
+int raxCompare(raxIterator *iter, const char *op, unsigned char *key, size_t key_len);
+void raxStop(raxIterator *it);
+int raxEOF(raxIterator *it);
+void raxShow(rax *rax);
+uint64_t raxSize(rax *rax);
+unsigned long raxTouch(raxNode *n);
+void raxSetDebugMsg(int onoff);
+
+/* Internal API. May be used by the node callback in order to access rax nodes
+ * in a low level way, so this function is exported as well. */
+void raxSetData(raxNode *n, void *data);
+
+#endif
diff --git a/redis-stable/src/rax_malloc.h b/redis-stable/src/rax_malloc.h
new file mode 100644
index 00000000..9295985c
--- /dev/null
+++ b/redis-stable/src/rax_malloc.h
@@ -0,0 +1,44 @@
+/* Rax -- A radix tree implementation.
+ *
+ * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* Allocator selection.
+ *
+ * This file is used in order to change the Rax allocator at compile time.
+ * Just define the following defines to what you want to use. Also add
+ * the include of your alternate allocator if needed (not needed in order
+ * to use the default libc allocator). */
+
+#ifndef RAX_ALLOC_H
+#define RAX_ALLOC_H
+#include "zmalloc.h"
+#define rax_malloc zmalloc
+#define rax_realloc zrealloc
+#define rax_free zfree
+#endif
diff --git a/redis-stable/src/rdb.c b/redis-stable/src/rdb.c
new file mode 100644
index 00000000..3a1eeb91
--- /dev/null
+++ b/redis-stable/src/rdb.c
@@ -0,0 +1,3070 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "lzf.h"    /* LZF compression library */
+#include "zipmap.h"
+#include "endianconv.h"
+#include "stream.h"
+
+#include <math.h>
+#include <fcntl.h>
+#include <sys/types.h>
+#include <sys/time.h>
+#include <sys/resource.h>
+#include <sys/wait.h>
+#include <arpa/inet.h>
+#include <sys/stat.h>
+#include <sys/param.h>
+
+/* This macro is called when the internal RDB structure is corrupt */
+#define rdbReportCorruptRDB(...) rdbReportError(1, __LINE__,__VA_ARGS__)
+/* This macro is called when RDB read failed (possibly a short read) */
+#define rdbReportReadError(...) rdbReportError(0, __LINE__,__VA_ARGS__)
+
+char* rdbFileBeingLoaded = NULL; /* used for rdb checking on read error */
+extern int rdbCheckMode;
+void rdbCheckError(const char *fmt, ...);
+void rdbCheckSetError(const char *fmt, ...);
+
+#ifdef __GNUC__
+void rdbReportError(int corruption_error, int linenum, char *reason, ...) __attribute__ ((format (printf, 3, 4)));
+#endif
+void rdbReportError(int corruption_error, int linenum, char *reason, ...) {
+    va_list ap;
+    char msg[1024];
+    int len;
+
+    len = snprintf(msg,sizeof(msg),
+        "Internal error in RDB reading offset %llu, function at rdb.c:%d -> ",
+        (unsigned long long)server.loading_loaded_bytes, linenum);
+    va_start(ap,reason);
+    vsnprintf(msg+len,sizeof(msg)-len,reason,ap);
+    va_end(ap);
+
+    if (!server.loading) {
+        /* If we're in the context of a RESTORE command, just propagate the error. */
+        /* log in VERBOSE, and return (don't exit). */
+        serverLog(LL_VERBOSE, "%s", msg);
+        return;
+    } else if (rdbCheckMode) {
+        /* If we're inside the rdb checker, let it handle the error. */
+        rdbCheckError("%s",msg);
+    } else if (rdbFileBeingLoaded) {
+        /* If we're loading an rdb file form disk, run rdb check (and exit) */
+        serverLog(LL_WARNING, "%s", msg);
+        char *argv[2] = {"",rdbFileBeingLoaded};
+        redis_check_rdb_main(2,argv,NULL);
+    } else if (corruption_error) {
+        /* In diskless loading, in case of corrupt file, log and exit. */
+        serverLog(LL_WARNING, "%s. Failure loading rdb format", msg);
+    } else {
+        /* In diskless loading, in case of a short read (not a corrupt
+         * file), log and proceed (don't exit). */
+        serverLog(LL_WARNING, "%s. Failure loading rdb format from socket, assuming connection error, resuming operation.", msg);
+        return;
+    }
+    serverLog(LL_WARNING, "Terminating server after rdb file reading failure.");
+    exit(1);
+}
+
+static ssize_t rdbWriteRaw(rio *rdb, void *p, size_t len) {
+    if (rdb && rioWrite(rdb,p,len) == 0)
+        return -1;
+    return len;
+}
+
+int rdbSaveType(rio *rdb, unsigned char type) {
+    return rdbWriteRaw(rdb,&type,1);
+}
+
+/* Load a "type" in RDB format, that is a one byte unsigned integer.
+ * This function is not only used to load object types, but also special
+ * "types" like the end-of-file type, the EXPIRE type, and so forth. */
+int rdbLoadType(rio *rdb) {
+    unsigned char type;
+    if (rioRead(rdb,&type,1) == 0) return -1;
+    return type;
+}
+
+/* This is only used to load old databases stored with the RDB_OPCODE_EXPIRETIME
+ * opcode. New versions of Redis store using the RDB_OPCODE_EXPIRETIME_MS
+ * opcode. On error -1 is returned, however this could be a valid time, so
+ * to check for loading errors the caller should call rioGetReadError() after
+ * calling this function. */
+time_t rdbLoadTime(rio *rdb) {
+    int32_t t32;
+    if (rioRead(rdb,&t32,4) == 0) return -1;
+    return (time_t)t32;
+}
+
+int rdbSaveMillisecondTime(rio *rdb, long long t) {
+    int64_t t64 = (int64_t) t;
+    memrev64ifbe(&t64); /* Store in little endian. */
+    return rdbWriteRaw(rdb,&t64,8);
+}
+
+/* This function loads a time from the RDB file. It gets the version of the
+ * RDB because, unfortunately, before Redis 5 (RDB version 9), the function
+ * failed to convert data to/from little endian, so RDB files with keys having
+ * expires could not be shared between big endian and little endian systems
+ * (because the expire time will be totally wrong). The fix for this is just
+ * to call memrev64ifbe(), however if we fix this for all the RDB versions,
+ * this call will introduce an incompatibility for big endian systems:
+ * after upgrading to Redis version 5 they will no longer be able to load their
+ * own old RDB files. Because of that, we instead fix the function only for new
+ * RDB versions, and load older RDB versions as we used to do in the past,
+ * allowing big endian systems to load their own old RDB files.
+ *
+ * On I/O error the function returns LLONG_MAX, however if this is also a
+ * valid stored value, the caller should use rioGetReadError() to check for
+ * errors after calling this function. */
+long long rdbLoadMillisecondTime(rio *rdb, int rdbver) {
+    int64_t t64;
+    if (rioRead(rdb,&t64,8) == 0) return LLONG_MAX;
+    if (rdbver >= 9) /* Check the top comment of this function. */
+        memrev64ifbe(&t64); /* Convert in big endian if the system is BE. */
+    return (long long)t64;
+}
+
+/* Saves an encoded length. The first two bits in the first byte are used to
+ * hold the encoding type. See the RDB_* definitions for more information
+ * on the types of encoding. */
+int rdbSaveLen(rio *rdb, uint64_t len) {
+    unsigned char buf[2];
+    size_t nwritten;
+
+    if (len < (1<<6)) {
+        /* Save a 6 bit len */
+        buf[0] = (len&0xFF)|(RDB_6BITLEN<<6);
+        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
+        nwritten = 1;
+    } else if (len < (1<<14)) {
+        /* Save a 14 bit len */
+        buf[0] = ((len>>8)&0xFF)|(RDB_14BITLEN<<6);
+        buf[1] = len&0xFF;
+        if (rdbWriteRaw(rdb,buf,2) == -1) return -1;
+        nwritten = 2;
+    } else if (len <= UINT32_MAX) {
+        /* Save a 32 bit len */
+        buf[0] = RDB_32BITLEN;
+        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
+        uint32_t len32 = htonl(len);
+        if (rdbWriteRaw(rdb,&len32,4) == -1) return -1;
+        nwritten = 1+4;
+    } else {
+        /* Save a 64 bit len */
+        buf[0] = RDB_64BITLEN;
+        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
+        len = htonu64(len);
+        if (rdbWriteRaw(rdb,&len,8) == -1) return -1;
+        nwritten = 1+8;
+    }
+    return nwritten;
+}
+
+
+/* Load an encoded length. If the loaded length is a normal length as stored
+ * with rdbSaveLen(), the read length is set to '*lenptr'. If instead the
+ * loaded length describes a special encoding that follows, then '*isencoded'
+ * is set to 1 and the encoding format is stored at '*lenptr'.
+ *
+ * See the RDB_ENC_* definitions in rdb.h for more information on special
+ * encodings.
+ *
+ * The function returns -1 on error, 0 on success. */
+int rdbLoadLenByRef(rio *rdb, int *isencoded, uint64_t *lenptr) {
+    unsigned char buf[2];
+    int type;
+
+    if (isencoded) *isencoded = 0;
+    if (rioRead(rdb,buf,1) == 0) return -1;
+    type = (buf[0]&0xC0)>>6;
+    if (type == RDB_ENCVAL) {
+        /* Read a 6 bit encoding type. */
+        if (isencoded) *isencoded = 1;
+        *lenptr = buf[0]&0x3F;
+    } else if (type == RDB_6BITLEN) {
+        /* Read a 6 bit len. */
+        *lenptr = buf[0]&0x3F;
+    } else if (type == RDB_14BITLEN) {
+        /* Read a 14 bit len. */
+        if (rioRead(rdb,buf+1,1) == 0) return -1;
+        *lenptr = ((buf[0]&0x3F)<<8)|buf[1];
+    } else if (buf[0] == RDB_32BITLEN) {
+        /* Read a 32 bit len. */
+        uint32_t len;
+        if (rioRead(rdb,&len,4) == 0) return -1;
+        *lenptr = ntohl(len);
+    } else if (buf[0] == RDB_64BITLEN) {
+        /* Read a 64 bit len. */
+        uint64_t len;
+        if (rioRead(rdb,&len,8) == 0) return -1;
+        *lenptr = ntohu64(len);
+    } else {
+        rdbReportCorruptRDB(
+            "Unknown length encoding %d in rdbLoadLen()",type);
+        return -1; /* Never reached. */
+    }
+    return 0;
+}
+
+/* This is like rdbLoadLenByRef() but directly returns the value read
+ * from the RDB stream, signaling an error by returning RDB_LENERR
+ * (since it is a too large count to be applicable in any Redis data
+ * structure). */
+uint64_t rdbLoadLen(rio *rdb, int *isencoded) {
+    uint64_t len;
+
+    if (rdbLoadLenByRef(rdb,isencoded,&len) == -1) return RDB_LENERR;
+    return len;
+}
+
+/* Encodes the "value" argument as integer when it fits in the supported ranges
+ * for encoded types. If the function successfully encodes the integer, the
+ * representation is stored in the buffer pointer to by "enc" and the string
+ * length is returned. Otherwise 0 is returned. */
+int rdbEncodeInteger(long long value, unsigned char *enc) {
+    if (value >= -(1<<7) && value <= (1<<7)-1) {
+        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT8;
+        enc[1] = value&0xFF;
+        return 2;
+    } else if (value >= -(1<<15) && value <= (1<<15)-1) {
+        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT16;
+        enc[1] = value&0xFF;
+        enc[2] = (value>>8)&0xFF;
+        return 3;
+    } else if (value >= -((long long)1<<31) && value <= ((long long)1<<31)-1) {
+        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT32;
+        enc[1] = value&0xFF;
+        enc[2] = (value>>8)&0xFF;
+        enc[3] = (value>>16)&0xFF;
+        enc[4] = (value>>24)&0xFF;
+        return 5;
+    } else {
+        return 0;
+    }
+}
+
+/* Loads an integer-encoded object with the specified encoding type "enctype".
+ * The returned value changes according to the flags, see
+ * rdbGenericLoadStringObject() for more info. */
+void *rdbLoadIntegerObject(rio *rdb, int enctype, int flags, size_t *lenptr) {
+    int plain = flags & RDB_LOAD_PLAIN;
+    int sds = flags & RDB_LOAD_SDS;
+    int encode = flags & RDB_LOAD_ENC;
+    unsigned char enc[4];
+    long long val;
+
+    if (enctype == RDB_ENC_INT8) {
+        if (rioRead(rdb,enc,1) == 0) return NULL;
+        val = (signed char)enc[0];
+    } else if (enctype == RDB_ENC_INT16) {
+        uint16_t v;
+        if (rioRead(rdb,enc,2) == 0) return NULL;
+        v = enc[0]|(enc[1]<<8);
+        val = (int16_t)v;
+    } else if (enctype == RDB_ENC_INT32) {
+        uint32_t v;
+        if (rioRead(rdb,enc,4) == 0) return NULL;
+        v = enc[0]|(enc[1]<<8)|(enc[2]<<16)|(enc[3]<<24);
+        val = (int32_t)v;
+    } else {
+        rdbReportCorruptRDB("Unknown RDB integer encoding type %d",enctype);
+        return NULL; /* Never reached. */
+    }
+    if (plain || sds) {
+        char buf[LONG_STR_SIZE], *p;
+        int len = ll2string(buf,sizeof(buf),val);
+        if (lenptr) *lenptr = len;
+        p = plain ? zmalloc(len) : sdsnewlen(SDS_NOINIT,len);
+        memcpy(p,buf,len);
+        return p;
+    } else if (encode) {
+        return createStringObjectFromLongLongForValue(val);
+    } else {
+        return createObject(OBJ_STRING,sdsfromlonglong(val));
+    }
+}
+
+/* String objects in the form "2391" "-100" without any space and with a
+ * range of values that can fit in an 8, 16 or 32 bit signed value can be
+ * encoded as integers to save space */
+int rdbTryIntegerEncoding(char *s, size_t len, unsigned char *enc) {
+    long long value;
+    char *endptr, buf[32];
+
+    /* Check if it's possible to encode this value as a number */
+    value = strtoll(s, &endptr, 10);
+    if (endptr[0] != '\0') return 0;
+    ll2string(buf,32,value);
+
+    /* If the number converted back into a string is not identical
+     * then it's not possible to encode the string as integer */
+    if (strlen(buf) != len || memcmp(buf,s,len)) return 0;
+
+    return rdbEncodeInteger(value,enc);
+}
+
+ssize_t rdbSaveLzfBlob(rio *rdb, void *data, size_t compress_len,
+                       size_t original_len) {
+    unsigned char byte;
+    ssize_t n, nwritten = 0;
+
+    /* Data compressed! Let's save it on disk */
+    byte = (RDB_ENCVAL<<6)|RDB_ENC_LZF;
+    if ((n = rdbWriteRaw(rdb,&byte,1)) == -1) goto writeerr;
+    nwritten += n;
+
+    if ((n = rdbSaveLen(rdb,compress_len)) == -1) goto writeerr;
+    nwritten += n;
+
+    if ((n = rdbSaveLen(rdb,original_len)) == -1) goto writeerr;
+    nwritten += n;
+
+    if ((n = rdbWriteRaw(rdb,data,compress_len)) == -1) goto writeerr;
+    nwritten += n;
+
+    return nwritten;
+
+writeerr:
+    return -1;
+}
+
+ssize_t rdbSaveLzfStringObject(rio *rdb, unsigned char *s, size_t len) {
+    size_t comprlen, outlen;
+    void *out;
+
+    /* We require at least four bytes compression for this to be worth it */
+    if (len <= 4) return 0;
+    outlen = len-4;
+    if ((out = zmalloc(outlen+1)) == NULL) return 0;
+    comprlen = lzf_compress(s, len, out, outlen);
+    if (comprlen == 0) {
+        zfree(out);
+        return 0;
+    }
+    ssize_t nwritten = rdbSaveLzfBlob(rdb, out, comprlen, len);
+    zfree(out);
+    return nwritten;
+}
+
+/* Load an LZF compressed string in RDB format. The returned value
+ * changes according to 'flags'. For more info check the
+ * rdbGenericLoadStringObject() function. */
+void *rdbLoadLzfStringObject(rio *rdb, int flags, size_t *lenptr) {
+    int plain = flags & RDB_LOAD_PLAIN;
+    int sds = flags & RDB_LOAD_SDS;
+    uint64_t len, clen;
+    unsigned char *c = NULL;
+    char *val = NULL;
+
+    if ((clen = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+    if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+    if ((c = ztrymalloc(clen)) == NULL) {
+        serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbLoadLzfStringObject failed allocating %llu bytes", (unsigned long long)clen);
+        goto err;
+    }
+
+    /* Allocate our target according to the uncompressed size. */
+    if (plain) {
+        val = ztrymalloc(len);
+    } else {
+        val = sdstrynewlen(SDS_NOINIT,len);
+    }
+    if (!val) {
+        serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbLoadLzfStringObject failed allocating %llu bytes", (unsigned long long)len);
+        goto err;
+    }
+
+    if (lenptr) *lenptr = len;
+
+    /* Load the compressed representation and uncompress it to target. */
+    if (rioRead(rdb,c,clen) == 0) goto err;
+    if (lzf_decompress(c,clen,val,len) != len) {
+        rdbReportCorruptRDB("Invalid LZF compressed string");
+        goto err;
+    }
+    zfree(c);
+
+    if (plain || sds) {
+        return val;
+    } else {
+        return createObject(OBJ_STRING,val);
+    }
+err:
+    zfree(c);
+    if (plain)
+        zfree(val);
+    else
+        sdsfree(val);
+    return NULL;
+}
+
+/* Save a string object as [len][data] on disk. If the object is a string
+ * representation of an integer value we try to save it in a special form */
+ssize_t rdbSaveRawString(rio *rdb, unsigned char *s, size_t len) {
+    int enclen;
+    ssize_t n, nwritten = 0;
+
+    /* Try integer encoding */
+    if (len <= 11) {
+        unsigned char buf[5];
+        if ((enclen = rdbTryIntegerEncoding((char*)s,len,buf)) > 0) {
+            if (rdbWriteRaw(rdb,buf,enclen) == -1) return -1;
+            return enclen;
+        }
+    }
+
+    /* Try LZF compression - under 20 bytes it's unable to compress even
+     * aaaaaaaaaaaaaaaaaa so skip it */
+    if (server.rdb_compression && len > 20) {
+        n = rdbSaveLzfStringObject(rdb,s,len);
+        if (n == -1) return -1;
+        if (n > 0) return n;
+        /* Return value of 0 means data can't be compressed, save the old way */
+    }
+
+    /* Store verbatim */
+    if ((n = rdbSaveLen(rdb,len)) == -1) return -1;
+    nwritten += n;
+    if (len > 0) {
+        if (rdbWriteRaw(rdb,s,len) == -1) return -1;
+        nwritten += len;
+    }
+    return nwritten;
+}
+
+/* Save a long long value as either an encoded string or a string. */
+ssize_t rdbSaveLongLongAsStringObject(rio *rdb, long long value) {
+    unsigned char buf[32];
+    ssize_t n, nwritten = 0;
+    int enclen = rdbEncodeInteger(value,buf);
+    if (enclen > 0) {
+        return rdbWriteRaw(rdb,buf,enclen);
+    } else {
+        /* Encode as string */
+        enclen = ll2string((char*)buf,32,value);
+        serverAssert(enclen < 32);
+        if ((n = rdbSaveLen(rdb,enclen)) == -1) return -1;
+        nwritten += n;
+        if ((n = rdbWriteRaw(rdb,buf,enclen)) == -1) return -1;
+        nwritten += n;
+    }
+    return nwritten;
+}
+
+/* Like rdbSaveRawString() gets a Redis object instead. */
+ssize_t rdbSaveStringObject(rio *rdb, robj *obj) {
+    /* Avoid to decode the object, then encode it again, if the
+     * object is already integer encoded. */
+    if (obj->encoding == OBJ_ENCODING_INT) {
+        return rdbSaveLongLongAsStringObject(rdb,(long)obj->ptr);
+    } else {
+        serverAssertWithInfo(NULL,obj,sdsEncodedObject(obj));
+        return rdbSaveRawString(rdb,obj->ptr,sdslen(obj->ptr));
+    }
+}
+
+/* Load a string object from an RDB file according to flags:
+ *
+ * RDB_LOAD_NONE (no flags): load an RDB object, unencoded.
+ * RDB_LOAD_ENC: If the returned type is a Redis object, try to
+ *               encode it in a special way to be more memory
+ *               efficient. When this flag is passed the function
+ *               no longer guarantees that obj->ptr is an SDS string.
+ * RDB_LOAD_PLAIN: Return a plain string allocated with zmalloc()
+ *                 instead of a Redis object with an sds in it.
+ * RDB_LOAD_SDS: Return an SDS string instead of a Redis object.
+ *
+ * On I/O error NULL is returned.
+ */
+void *rdbGenericLoadStringObject(rio *rdb, int flags, size_t *lenptr) {
+    int encode = flags & RDB_LOAD_ENC;
+    int plain = flags & RDB_LOAD_PLAIN;
+    int sds = flags & RDB_LOAD_SDS;
+    int isencoded;
+    unsigned long long len;
+
+    len = rdbLoadLen(rdb,&isencoded);
+    if (len == RDB_LENERR) return NULL;
+
+    if (isencoded) {
+        switch(len) {
+        case RDB_ENC_INT8:
+        case RDB_ENC_INT16:
+        case RDB_ENC_INT32:
+            return rdbLoadIntegerObject(rdb,len,flags,lenptr);
+        case RDB_ENC_LZF:
+            return rdbLoadLzfStringObject(rdb,flags,lenptr);
+        default:
+            rdbReportCorruptRDB("Unknown RDB string encoding type %llu",len);
+            return NULL;
+        }
+    }
+
+    if (plain || sds) {
+        void *buf = plain ? ztrymalloc(len) : sdstrynewlen(SDS_NOINIT,len);
+        if (!buf) {
+            serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbGenericLoadStringObject failed allocating %llu bytes", len);
+            return NULL;
+        }
+        if (lenptr) *lenptr = len;
+        if (len && rioRead(rdb,buf,len) == 0) {
+            if (plain)
+                zfree(buf);
+            else
+                sdsfree(buf);
+            return NULL;
+        }
+        return buf;
+    } else {
+        robj *o = encode ? tryCreateStringObject(SDS_NOINIT,len) :
+                           tryCreateRawStringObject(SDS_NOINIT,len);
+        if (!o) {
+            serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbGenericLoadStringObject failed allocating %llu bytes", len);
+            return NULL;
+        }
+        if (len && rioRead(rdb,o->ptr,len) == 0) {
+            decrRefCount(o);
+            return NULL;
+        }
+        return o;
+    }
+}
+
+robj *rdbLoadStringObject(rio *rdb) {
+    return rdbGenericLoadStringObject(rdb,RDB_LOAD_NONE,NULL);
+}
+
+robj *rdbLoadEncodedStringObject(rio *rdb) {
+    return rdbGenericLoadStringObject(rdb,RDB_LOAD_ENC,NULL);
+}
+
+/* Save a double value. Doubles are saved as strings prefixed by an unsigned
+ * 8 bit integer specifying the length of the representation.
+ * This 8 bit integer has special values in order to specify the following
+ * conditions:
+ * 253: not a number
+ * 254: + inf
+ * 255: - inf
+ */
+int rdbSaveDoubleValue(rio *rdb, double val) {
+    unsigned char buf[128];
+    int len;
+
+    if (isnan(val)) {
+        buf[0] = 253;
+        len = 1;
+    } else if (!isfinite(val)) {
+        len = 1;
+        buf[0] = (val < 0) ? 255 : 254;
+    } else {
+#if (DBL_MANT_DIG >= 52) && (LLONG_MAX == 0x7fffffffffffffffLL)
+        /* Check if the float is in a safe range to be casted into a
+         * long long. We are assuming that long long is 64 bit here.
+         * Also we are assuming that there are no implementations around where
+         * double has precision < 52 bit.
+         *
+         * Under this assumptions we test if a double is inside an interval
+         * where casting to long long is safe. Then using two castings we
+         * make sure the decimal part is zero. If all this is true we use
+         * integer printing function that is much faster. */
+        double min = -4503599627370495; /* (2^52)-1 */
+        double max = 4503599627370496; /* -(2^52) */
+        if (val > min && val < max && val == ((double)((long long)val)))
+            ll2string((char*)buf+1,sizeof(buf)-1,(long long)val);
+        else
+#endif
+            snprintf((char*)buf+1,sizeof(buf)-1,"%.17g",val);
+        buf[0] = strlen((char*)buf+1);
+        len = buf[0]+1;
+    }
+    return rdbWriteRaw(rdb,buf,len);
+}
+
+/* For information about double serialization check rdbSaveDoubleValue() */
+int rdbLoadDoubleValue(rio *rdb, double *val) {
+    char buf[256];
+    unsigned char len;
+
+    if (rioRead(rdb,&len,1) == 0) return -1;
+    switch(len) {
+    case 255: *val = R_NegInf; return 0;
+    case 254: *val = R_PosInf; return 0;
+    case 253: *val = R_Nan; return 0;
+    default:
+        if (rioRead(rdb,buf,len) == 0) return -1;
+        buf[len] = '\0';
+        if (sscanf(buf, "%lg", val)!=1) return -1;
+        return 0;
+    }
+}
+
+/* Saves a double for RDB 8 or greater, where IE754 binary64 format is assumed.
+ * We just make sure the integer is always stored in little endian, otherwise
+ * the value is copied verbatim from memory to disk.
+ *
+ * Return -1 on error, the size of the serialized value on success. */
+int rdbSaveBinaryDoubleValue(rio *rdb, double val) {
+    memrev64ifbe(&val);
+    return rdbWriteRaw(rdb,&val,sizeof(val));
+}
+
+/* Loads a double from RDB 8 or greater. See rdbSaveBinaryDoubleValue() for
+ * more info. On error -1 is returned, otherwise 0. */
+int rdbLoadBinaryDoubleValue(rio *rdb, double *val) {
+    if (rioRead(rdb,val,sizeof(*val)) == 0) return -1;
+    memrev64ifbe(val);
+    return 0;
+}
+
+/* Like rdbSaveBinaryDoubleValue() but single precision. */
+int rdbSaveBinaryFloatValue(rio *rdb, float val) {
+    memrev32ifbe(&val);
+    return rdbWriteRaw(rdb,&val,sizeof(val));
+}
+
+/* Like rdbLoadBinaryDoubleValue() but single precision. */
+int rdbLoadBinaryFloatValue(rio *rdb, float *val) {
+    if (rioRead(rdb,val,sizeof(*val)) == 0) return -1;
+    memrev32ifbe(val);
+    return 0;
+}
+
+/* Save the object type of object "o". */
+int rdbSaveObjectType(rio *rdb, robj *o) {
+    switch (o->type) {
+    case OBJ_STRING:
+        return rdbSaveType(rdb,RDB_TYPE_STRING);
+    case OBJ_LIST:
+        if (o->encoding == OBJ_ENCODING_QUICKLIST)
+            return rdbSaveType(rdb,RDB_TYPE_LIST_QUICKLIST);
+        else
+            serverPanic("Unknown list encoding");
+    case OBJ_SET:
+        if (o->encoding == OBJ_ENCODING_INTSET)
+            return rdbSaveType(rdb,RDB_TYPE_SET_INTSET);
+        else if (o->encoding == OBJ_ENCODING_HT)
+            return rdbSaveType(rdb,RDB_TYPE_SET);
+        else
+            serverPanic("Unknown set encoding");
+    case OBJ_ZSET:
+        if (o->encoding == OBJ_ENCODING_ZIPLIST)
+            return rdbSaveType(rdb,RDB_TYPE_ZSET_ZIPLIST);
+        else if (o->encoding == OBJ_ENCODING_SKIPLIST)
+            return rdbSaveType(rdb,RDB_TYPE_ZSET_2);
+        else
+            serverPanic("Unknown sorted set encoding");
+    case OBJ_HASH:
+        if (o->encoding == OBJ_ENCODING_ZIPLIST)
+            return rdbSaveType(rdb,RDB_TYPE_HASH_ZIPLIST);
+        else if (o->encoding == OBJ_ENCODING_HT)
+            return rdbSaveType(rdb,RDB_TYPE_HASH);
+        else
+            serverPanic("Unknown hash encoding");
+    case OBJ_STREAM:
+        return rdbSaveType(rdb,RDB_TYPE_STREAM_LISTPACKS);
+    case OBJ_MODULE:
+        return rdbSaveType(rdb,RDB_TYPE_MODULE_2);
+    default:
+        serverPanic("Unknown object type");
+    }
+    return -1; /* avoid warning */
+}
+
+/* Use rdbLoadType() to load a TYPE in RDB format, but returns -1 if the
+ * type is not specifically a valid Object Type. */
+int rdbLoadObjectType(rio *rdb) {
+    int type;
+    if ((type = rdbLoadType(rdb)) == -1) return -1;
+    if (!rdbIsObjectType(type)) return -1;
+    return type;
+}
+
+/* This helper function serializes a consumer group Pending Entries List (PEL)
+ * into the RDB file. The 'nacks' argument tells the function if also persist
+ * the informations about the not acknowledged message, or if to persist
+ * just the IDs: this is useful because for the global consumer group PEL
+ * we serialized the NACKs as well, but when serializing the local consumer
+ * PELs we just add the ID, that will be resolved inside the global PEL to
+ * put a reference to the same structure. */
+ssize_t rdbSaveStreamPEL(rio *rdb, rax *pel, int nacks) {
+    ssize_t n, nwritten = 0;
+
+    /* Number of entries in the PEL. */
+    if ((n = rdbSaveLen(rdb,raxSize(pel))) == -1) return -1;
+    nwritten += n;
+
+    /* Save each entry. */
+    raxIterator ri;
+    raxStart(&ri,pel);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        /* We store IDs in raw form as 128 big big endian numbers, like
+         * they are inside the radix tree key. */
+        if ((n = rdbWriteRaw(rdb,ri.key,sizeof(streamID))) == -1) {
+            raxStop(&ri);
+            return -1;
+        }
+        nwritten += n;
+
+        if (nacks) {
+            streamNACK *nack = ri.data;
+            if ((n = rdbSaveMillisecondTime(rdb,nack->delivery_time)) == -1) {
+                raxStop(&ri);
+                return -1;
+            }
+            nwritten += n;
+            if ((n = rdbSaveLen(rdb,nack->delivery_count)) == -1) {
+                raxStop(&ri);
+                return -1;
+            }
+            nwritten += n;
+            /* We don't save the consumer name: we'll save the pending IDs
+             * for each consumer in the consumer PEL, and resolve the consumer
+             * at loading time. */
+        }
+    }
+    raxStop(&ri);
+    return nwritten;
+}
+
+/* Serialize the consumers of a stream consumer group into the RDB. Helper
+ * function for the stream data type serialization. What we do here is to
+ * persist the consumer metadata, and it's PEL, for each consumer. */
+size_t rdbSaveStreamConsumers(rio *rdb, streamCG *cg) {
+    ssize_t n, nwritten = 0;
+
+    /* Number of consumers in this consumer group. */
+    if ((n = rdbSaveLen(rdb,raxSize(cg->consumers))) == -1) return -1;
+    nwritten += n;
+
+    /* Save each consumer. */
+    raxIterator ri;
+    raxStart(&ri,cg->consumers);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        streamConsumer *consumer = ri.data;
+
+        /* Consumer name. */
+        if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
+            raxStop(&ri);
+            return -1;
+        }
+        nwritten += n;
+
+        /* Last seen time. */
+        if ((n = rdbSaveMillisecondTime(rdb,consumer->seen_time)) == -1) {
+            raxStop(&ri);
+            return -1;
+        }
+        nwritten += n;
+
+        /* Consumer PEL, without the ACKs (see last parameter of the function
+         * passed with value of 0), at loading time we'll lookup the ID
+         * in the consumer group global PEL and will put a reference in the
+         * consumer local PEL. */
+        if ((n = rdbSaveStreamPEL(rdb,consumer->pel,0)) == -1) {
+            raxStop(&ri);
+            return -1;
+        }
+        nwritten += n;
+    }
+    raxStop(&ri);
+    return nwritten;
+}
+
+/* Save a Redis object.
+ * Returns -1 on error, number of bytes written on success. */
+ssize_t rdbSaveObject(rio *rdb, robj *o, robj *key) {
+    ssize_t n = 0, nwritten = 0;
+
+    if (o->type == OBJ_STRING) {
+        /* Save a string value */
+        if ((n = rdbSaveStringObject(rdb,o)) == -1) return -1;
+        nwritten += n;
+    } else if (o->type == OBJ_LIST) {
+        /* Save a list value */
+        if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+            quicklist *ql = o->ptr;
+            quicklistNode *node = ql->head;
+
+            if ((n = rdbSaveLen(rdb,ql->len)) == -1) return -1;
+            nwritten += n;
+
+            while(node) {
+                if (quicklistNodeIsCompressed(node)) {
+                    void *data;
+                    size_t compress_len = quicklistGetLzf(node, &data);
+                    if ((n = rdbSaveLzfBlob(rdb,data,compress_len,node->sz)) == -1) return -1;
+                    nwritten += n;
+                } else {
+                    if ((n = rdbSaveRawString(rdb,node->zl,node->sz)) == -1) return -1;
+                    nwritten += n;
+                }
+                node = node->next;
+            }
+        } else {
+            serverPanic("Unknown list encoding");
+        }
+    } else if (o->type == OBJ_SET) {
+        /* Save a set value */
+        if (o->encoding == OBJ_ENCODING_HT) {
+            dict *set = o->ptr;
+            dictIterator *di = dictGetIterator(set);
+            dictEntry *de;
+
+            if ((n = rdbSaveLen(rdb,dictSize(set))) == -1) {
+                dictReleaseIterator(di);
+                return -1;
+            }
+            nwritten += n;
+
+            while((de = dictNext(di)) != NULL) {
+                sds ele = dictGetKey(de);
+                if ((n = rdbSaveRawString(rdb,(unsigned char*)ele,sdslen(ele)))
+                    == -1)
+                {
+                    dictReleaseIterator(di);
+                    return -1;
+                }
+                nwritten += n;
+            }
+            dictReleaseIterator(di);
+        } else if (o->encoding == OBJ_ENCODING_INTSET) {
+            size_t l = intsetBlobLen((intset*)o->ptr);
+
+            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
+            nwritten += n;
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (o->type == OBJ_ZSET) {
+        /* Save a sorted set value */
+        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            size_t l = ziplistBlobLen((unsigned char*)o->ptr);
+
+            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
+            nwritten += n;
+        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = o->ptr;
+            zskiplist *zsl = zs->zsl;
+
+            if ((n = rdbSaveLen(rdb,zsl->length)) == -1) return -1;
+            nwritten += n;
+
+            /* We save the skiplist elements from the greatest to the smallest
+             * (that's trivial since the elements are already ordered in the
+             * skiplist): this improves the load process, since the next loaded
+             * element will always be the smaller, so adding to the skiplist
+             * will always immediately stop at the head, making the insertion
+             * O(1) instead of O(log(N)). */
+            zskiplistNode *zn = zsl->tail;
+            while (zn != NULL) {
+                if ((n = rdbSaveRawString(rdb,
+                    (unsigned char*)zn->ele,sdslen(zn->ele))) == -1)
+                {
+                    return -1;
+                }
+                nwritten += n;
+                if ((n = rdbSaveBinaryDoubleValue(rdb,zn->score)) == -1)
+                    return -1;
+                nwritten += n;
+                zn = zn->backward;
+            }
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else if (o->type == OBJ_HASH) {
+        /* Save a hash value */
+        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+            size_t l = ziplistBlobLen((unsigned char*)o->ptr);
+
+            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
+            nwritten += n;
+
+        } else if (o->encoding == OBJ_ENCODING_HT) {
+            dictIterator *di = dictGetIterator(o->ptr);
+            dictEntry *de;
+
+            if ((n = rdbSaveLen(rdb,dictSize((dict*)o->ptr))) == -1) {
+                dictReleaseIterator(di);
+                return -1;
+            }
+            nwritten += n;
+
+            while((de = dictNext(di)) != NULL) {
+                sds field = dictGetKey(de);
+                sds value = dictGetVal(de);
+
+                if ((n = rdbSaveRawString(rdb,(unsigned char*)field,
+                        sdslen(field))) == -1)
+                {
+                    dictReleaseIterator(di);
+                    return -1;
+                }
+                nwritten += n;
+                if ((n = rdbSaveRawString(rdb,(unsigned char*)value,
+                        sdslen(value))) == -1)
+                {
+                    dictReleaseIterator(di);
+                    return -1;
+                }
+                nwritten += n;
+            }
+            dictReleaseIterator(di);
+        } else {
+            serverPanic("Unknown hash encoding");
+        }
+    } else if (o->type == OBJ_STREAM) {
+        /* Store how many listpacks we have inside the radix tree. */
+        stream *s = o->ptr;
+        rax *rax = s->rax;
+        if ((n = rdbSaveLen(rdb,raxSize(rax))) == -1) return -1;
+        nwritten += n;
+
+        /* Serialize all the listpacks inside the radix tree as they are,
+         * when loading back, we'll use the first entry of each listpack
+         * to insert it back into the radix tree. */
+        raxIterator ri;
+        raxStart(&ri,rax);
+        raxSeek(&ri,"^",NULL,0);
+        while (raxNext(&ri)) {
+            unsigned char *lp = ri.data;
+            size_t lp_bytes = lpBytes(lp);
+            if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
+                raxStop(&ri);
+                return -1;
+            }
+            nwritten += n;
+            if ((n = rdbSaveRawString(rdb,lp,lp_bytes)) == -1) {
+                raxStop(&ri);
+                return -1;
+            }
+            nwritten += n;
+        }
+        raxStop(&ri);
+
+        /* Save the number of elements inside the stream. We cannot obtain
+         * this easily later, since our macro nodes should be checked for
+         * number of items: not a great CPU / space tradeoff. */
+        if ((n = rdbSaveLen(rdb,s->length)) == -1) return -1;
+        nwritten += n;
+        /* Save the last entry ID. */
+        if ((n = rdbSaveLen(rdb,s->last_id.ms)) == -1) return -1;
+        nwritten += n;
+        if ((n = rdbSaveLen(rdb,s->last_id.seq)) == -1) return -1;
+        nwritten += n;
+
+        /* The consumer groups and their clients are part of the stream
+         * type, so serialize every consumer group. */
+
+        /* Save the number of groups. */
+        size_t num_cgroups = s->cgroups ? raxSize(s->cgroups) : 0;
+        if ((n = rdbSaveLen(rdb,num_cgroups)) == -1) return -1;
+        nwritten += n;
+
+        if (num_cgroups) {
+            /* Serialize each consumer group. */
+            raxStart(&ri,s->cgroups);
+            raxSeek(&ri,"^",NULL,0);
+            while(raxNext(&ri)) {
+                streamCG *cg = ri.data;
+
+                /* Save the group name. */
+                if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
+                    raxStop(&ri);
+                    return -1;
+                }
+                nwritten += n;
+
+                /* Last ID. */
+                if ((n = rdbSaveLen(rdb,cg->last_id.ms)) == -1) {
+                    raxStop(&ri);
+                    return -1;
+                }
+                nwritten += n;
+                if ((n = rdbSaveLen(rdb,cg->last_id.seq)) == -1) {
+                    raxStop(&ri);
+                    return -1;
+                }
+                nwritten += n;
+
+                /* Save the global PEL. */
+                if ((n = rdbSaveStreamPEL(rdb,cg->pel,1)) == -1) {
+                    raxStop(&ri);
+                    return -1;
+                }
+                nwritten += n;
+
+                /* Save the consumers of this group. */
+                if ((n = rdbSaveStreamConsumers(rdb,cg)) == -1) {
+                    raxStop(&ri);
+                    return -1;
+                }
+                nwritten += n;
+            }
+            raxStop(&ri);
+        }
+    } else if (o->type == OBJ_MODULE) {
+        /* Save a module-specific value. */
+        RedisModuleIO io;
+        moduleValue *mv = o->ptr;
+        moduleType *mt = mv->type;
+
+        /* Write the "module" identifier as prefix, so that we'll be able
+         * to call the right module during loading. */
+        int retval = rdbSaveLen(rdb,mt->id);
+        if (retval == -1) return -1;
+        moduleInitIOContext(io,mt,rdb,key);
+        io.bytes += retval;
+
+        /* Then write the module-specific representation + EOF marker. */
+        mt->rdb_save(&io,mv->value);
+        retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_EOF);
+        if (retval == -1)
+            io.error = 1;
+        else
+            io.bytes += retval;
+
+        if (io.ctx) {
+            moduleFreeContext(io.ctx);
+            zfree(io.ctx);
+        }
+        return io.error ? -1 : (ssize_t)io.bytes;
+    } else {
+        serverPanic("Unknown object type");
+    }
+    return nwritten;
+}
+
+/* Return the length the object will have on disk if saved with
+ * the rdbSaveObject() function. Currently we use a trick to get
+ * this length with very little changes to the code. In the future
+ * we could switch to a faster solution. */
+size_t rdbSavedObjectLen(robj *o, robj *key) {
+    ssize_t len = rdbSaveObject(NULL,o,key);
+    serverAssertWithInfo(NULL,o,len != -1);
+    return len;
+}
+
+/* Save a key-value pair, with expire time, type, key, value.
+ * On error -1 is returned.
+ * On success if the key was actually saved 1 is returned. */
+int rdbSaveKeyValuePair(rio *rdb, robj *key, robj *val, long long expiretime) {
+    int savelru = server.maxmemory_policy & MAXMEMORY_FLAG_LRU;
+    int savelfu = server.maxmemory_policy & MAXMEMORY_FLAG_LFU;
+
+    /* Save the expire time */
+    if (expiretime != -1) {
+        if (rdbSaveType(rdb,RDB_OPCODE_EXPIRETIME_MS) == -1) return -1;
+        if (rdbSaveMillisecondTime(rdb,expiretime) == -1) return -1;
+    }
+
+    /* Save the LRU info. */
+    if (savelru) {
+        uint64_t idletime = estimateObjectIdleTime(val);
+        idletime /= 1000; /* Using seconds is enough and requires less space.*/
+        if (rdbSaveType(rdb,RDB_OPCODE_IDLE) == -1) return -1;
+        if (rdbSaveLen(rdb,idletime) == -1) return -1;
+    }
+
+    /* Save the LFU info. */
+    if (savelfu) {
+        uint8_t buf[1];
+        buf[0] = LFUDecrAndReturn(val);
+        /* We can encode this in exactly two bytes: the opcode and an 8
+         * bit counter, since the frequency is logarithmic with a 0-255 range.
+         * Note that we do not store the halving time because to reset it
+         * a single time when loading does not affect the frequency much. */
+        if (rdbSaveType(rdb,RDB_OPCODE_FREQ) == -1) return -1;
+        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
+    }
+
+    /* Save type, key, value */
+    if (rdbSaveObjectType(rdb,val) == -1) return -1;
+    if (rdbSaveStringObject(rdb,key) == -1) return -1;
+    if (rdbSaveObject(rdb,val,key) == -1) return -1;
+
+    /* Delay return if required (for testing) */
+    if (server.rdb_key_save_delay)
+        debugDelay(server.rdb_key_save_delay);
+
+    return 1;
+}
+
+/* Save an AUX field. */
+ssize_t rdbSaveAuxField(rio *rdb, void *key, size_t keylen, void *val, size_t vallen) {
+    ssize_t ret, len = 0;
+    if ((ret = rdbSaveType(rdb,RDB_OPCODE_AUX)) == -1) return -1;
+    len += ret;
+    if ((ret = rdbSaveRawString(rdb,key,keylen)) == -1) return -1;
+    len += ret;
+    if ((ret = rdbSaveRawString(rdb,val,vallen)) == -1) return -1;
+    len += ret;
+    return len;
+}
+
+/* Wrapper for rdbSaveAuxField() used when key/val length can be obtained
+ * with strlen(). */
+ssize_t rdbSaveAuxFieldStrStr(rio *rdb, char *key, char *val) {
+    return rdbSaveAuxField(rdb,key,strlen(key),val,strlen(val));
+}
+
+/* Wrapper for strlen(key) + integer type (up to long long range). */
+ssize_t rdbSaveAuxFieldStrInt(rio *rdb, char *key, long long val) {
+    char buf[LONG_STR_SIZE];
+    int vlen = ll2string(buf,sizeof(buf),val);
+    return rdbSaveAuxField(rdb,key,strlen(key),buf,vlen);
+}
+
+/* Save a few default AUX fields with information about the RDB generated. */
+int rdbSaveInfoAuxFields(rio *rdb, int rdbflags, rdbSaveInfo *rsi) {
+    int redis_bits = (sizeof(void*) == 8) ? 64 : 32;
+    int aof_preamble = (rdbflags & RDBFLAGS_AOF_PREAMBLE) != 0;
+
+    /* Add a few fields about the state when the RDB was created. */
+    if (rdbSaveAuxFieldStrStr(rdb,"redis-ver",REDIS_VERSION) == -1) return -1;
+    if (rdbSaveAuxFieldStrInt(rdb,"redis-bits",redis_bits) == -1) return -1;
+    if (rdbSaveAuxFieldStrInt(rdb,"ctime",time(NULL)) == -1) return -1;
+    if (rdbSaveAuxFieldStrInt(rdb,"used-mem",zmalloc_used_memory()) == -1) return -1;
+
+    /* Handle saving options that generate aux fields. */
+    if (rsi) {
+        if (rdbSaveAuxFieldStrInt(rdb,"repl-stream-db",rsi->repl_stream_db)
+            == -1) return -1;
+        if (rdbSaveAuxFieldStrStr(rdb,"repl-id",server.replid)
+            == -1) return -1;
+        if (rdbSaveAuxFieldStrInt(rdb,"repl-offset",server.master_repl_offset)
+            == -1) return -1;
+    }
+    if (rdbSaveAuxFieldStrInt(rdb,"aof-preamble",aof_preamble) == -1) return -1;
+    return 1;
+}
+
+ssize_t rdbSaveSingleModuleAux(rio *rdb, int when, moduleType *mt) {
+    /* Save a module-specific aux value. */
+    RedisModuleIO io;
+    int retval = rdbSaveType(rdb, RDB_OPCODE_MODULE_AUX);
+    if (retval == -1) return -1;
+    moduleInitIOContext(io,mt,rdb,NULL);
+    io.bytes += retval;
+
+    /* Write the "module" identifier as prefix, so that we'll be able
+     * to call the right module during loading. */
+    retval = rdbSaveLen(rdb,mt->id);
+    if (retval == -1) return -1;
+    io.bytes += retval;
+
+    /* write the 'when' so that we can provide it on loading. add a UINT opcode
+     * for backwards compatibility, everything after the MT needs to be prefixed
+     * by an opcode. */
+    retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_UINT);
+    if (retval == -1) return -1;
+    io.bytes += retval;
+    retval = rdbSaveLen(rdb,when);
+    if (retval == -1) return -1;
+    io.bytes += retval;
+
+    /* Then write the module-specific representation + EOF marker. */
+    mt->aux_save(&io,when);
+    retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_EOF);
+    if (retval == -1)
+        io.error = 1;
+    else
+        io.bytes += retval;
+
+    if (io.ctx) {
+        moduleFreeContext(io.ctx);
+        zfree(io.ctx);
+    }
+    if (io.error)
+        return -1;
+    return io.bytes;
+}
+
+/* Produces a dump of the database in RDB format sending it to the specified
+ * Redis I/O channel. On success C_OK is returned, otherwise C_ERR
+ * is returned and part of the output, or all the output, can be
+ * missing because of I/O errors.
+ *
+ * When the function returns C_ERR and if 'error' is not NULL, the
+ * integer pointed by 'error' is set to the value of errno just after the I/O
+ * error. */
+int rdbSaveRio(rio *rdb, int *error, int rdbflags, rdbSaveInfo *rsi) {
+    dictIterator *di = NULL;
+    dictEntry *de;
+    char magic[10];
+    uint64_t cksum;
+    size_t processed = 0;
+    int j;
+    long key_count = 0;
+    long long info_updated_time = 0;
+    char *pname = (rdbflags & RDBFLAGS_AOF_PREAMBLE) ? "AOF rewrite" :  "RDB";
+
+    if (server.rdb_checksum)
+        rdb->update_cksum = rioGenericUpdateChecksum;
+    snprintf(magic,sizeof(magic),"REDIS%04d",RDB_VERSION);
+    if (rdbWriteRaw(rdb,magic,9) == -1) goto werr;
+    if (rdbSaveInfoAuxFields(rdb,rdbflags,rsi) == -1) goto werr;
+    if (rdbSaveModulesAux(rdb, REDISMODULE_AUX_BEFORE_RDB) == -1) goto werr;
+
+    for (j = 0; j < server.dbnum; j++) {
+        redisDb *db = server.db+j;
+        dict *d = db->dict;
+        if (dictSize(d) == 0) continue;
+        di = dictGetSafeIterator(d);
+
+        /* Write the SELECT DB opcode */
+        if (rdbSaveType(rdb,RDB_OPCODE_SELECTDB) == -1) goto werr;
+        if (rdbSaveLen(rdb,j) == -1) goto werr;
+
+        /* Write the RESIZE DB opcode. */
+        uint64_t db_size, expires_size;
+        db_size = dictSize(db->dict);
+        expires_size = dictSize(db->expires);
+        if (rdbSaveType(rdb,RDB_OPCODE_RESIZEDB) == -1) goto werr;
+        if (rdbSaveLen(rdb,db_size) == -1) goto werr;
+        if (rdbSaveLen(rdb,expires_size) == -1) goto werr;
+
+        /* Iterate this DB writing every entry */
+        while((de = dictNext(di)) != NULL) {
+            sds keystr = dictGetKey(de);
+            robj key, *o = dictGetVal(de);
+            long long expire;
+
+            initStaticStringObject(key,keystr);
+            expire = getExpire(db,&key);
+            if (rdbSaveKeyValuePair(rdb,&key,o,expire) == -1) goto werr;
+
+            /* When this RDB is produced as part of an AOF rewrite, move
+             * accumulated diff from parent to child while rewriting in
+             * order to have a smaller final write. */
+            if (rdbflags & RDBFLAGS_AOF_PREAMBLE &&
+                rdb->processed_bytes > processed+AOF_READ_DIFF_INTERVAL_BYTES)
+            {
+                processed = rdb->processed_bytes;
+                aofReadDiffFromParent();
+            }
+
+            /* Update child info every 1 second (approximately).
+             * in order to avoid calling mstime() on each iteration, we will
+             * check the diff every 1024 keys */
+            if ((key_count++ & 1023) == 0) {
+                long long now = mstime();
+                if (now - info_updated_time >= 1000) {
+                    sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, pname);
+                    info_updated_time = now;
+                }
+            }
+        }
+        dictReleaseIterator(di);
+        di = NULL; /* So that we don't release it again on error. */
+    }
+
+    /* If we are storing the replication information on disk, persist
+     * the script cache as well: on successful PSYNC after a restart, we need
+     * to be able to process any EVALSHA inside the replication backlog the
+     * master will send us. */
+    if (rsi && dictSize(server.lua_scripts)) {
+        di = dictGetIterator(server.lua_scripts);
+        while((de = dictNext(di)) != NULL) {
+            robj *body = dictGetVal(de);
+            if (rdbSaveAuxField(rdb,"lua",3,body->ptr,sdslen(body->ptr)) == -1)
+                goto werr;
+        }
+        dictReleaseIterator(di);
+        di = NULL; /* So that we don't release it again on error. */
+    }
+
+    if (rdbSaveModulesAux(rdb, REDISMODULE_AUX_AFTER_RDB) == -1) goto werr;
+
+    /* EOF opcode */
+    if (rdbSaveType(rdb,RDB_OPCODE_EOF) == -1) goto werr;
+
+    /* CRC64 checksum. It will be zero if checksum computation is disabled, the
+     * loading code skips the check in this case. */
+    cksum = rdb->cksum;
+    memrev64ifbe(&cksum);
+    if (rioWrite(rdb,&cksum,8) == 0) goto werr;
+    return C_OK;
+
+werr:
+    if (error) *error = errno;
+    if (di) dictReleaseIterator(di);
+    return C_ERR;
+}
+
+/* This is just a wrapper to rdbSaveRio() that additionally adds a prefix
+ * and a suffix to the generated RDB dump. The prefix is:
+ *
+ * $EOF:<40 bytes unguessable hex string>\r\n
+ *
+ * While the suffix is the 40 bytes hex string we announced in the prefix.
+ * This way processes receiving the payload can understand when it ends
+ * without doing any processing of the content. */
+int rdbSaveRioWithEOFMark(rio *rdb, int *error, rdbSaveInfo *rsi) {
+    char eofmark[RDB_EOF_MARK_SIZE];
+
+    startSaving(RDBFLAGS_REPLICATION);
+    getRandomHexChars(eofmark,RDB_EOF_MARK_SIZE);
+    if (error) *error = 0;
+    if (rioWrite(rdb,"$EOF:",5) == 0) goto werr;
+    if (rioWrite(rdb,eofmark,RDB_EOF_MARK_SIZE) == 0) goto werr;
+    if (rioWrite(rdb,"\r\n",2) == 0) goto werr;
+    if (rdbSaveRio(rdb,error,RDBFLAGS_NONE,rsi) == C_ERR) goto werr;
+    if (rioWrite(rdb,eofmark,RDB_EOF_MARK_SIZE) == 0) goto werr;
+    stopSaving(1);
+    return C_OK;
+
+werr: /* Write error. */
+    /* Set 'error' only if not already set by rdbSaveRio() call. */
+    if (error && *error == 0) *error = errno;
+    stopSaving(0);
+    return C_ERR;
+}
+
+/* Save the DB on disk. Return C_ERR on error, C_OK on success. */
+int rdbSave(char *filename, rdbSaveInfo *rsi) {
+    char tmpfile[256];
+    char cwd[MAXPATHLEN]; /* Current working dir path for error messages. */
+    FILE *fp = NULL;
+    rio rdb;
+    int error = 0;
+
+    snprintf(tmpfile,256,"temp-%d.rdb", (int) getpid());
+    fp = fopen(tmpfile,"w");
+    if (!fp) {
+        char *cwdp = getcwd(cwd,MAXPATHLEN);
+        serverLog(LL_WARNING,
+            "Failed opening the RDB file %s (in server root dir %s) "
+            "for saving: %s",
+            filename,
+            cwdp ? cwdp : "unknown",
+            strerror(errno));
+        return C_ERR;
+    }
+
+    rioInitWithFile(&rdb,fp);
+    startSaving(RDBFLAGS_NONE);
+
+    if (server.rdb_save_incremental_fsync)
+        rioSetAutoSync(&rdb,REDIS_AUTOSYNC_BYTES);
+
+    if (rdbSaveRio(&rdb,&error,RDBFLAGS_NONE,rsi) == C_ERR) {
+        errno = error;
+        goto werr;
+    }
+
+    /* Make sure data will not remain on the OS's output buffers */
+    if (fflush(fp)) goto werr;
+    if (fsync(fileno(fp))) goto werr;
+    if (fclose(fp)) { fp = NULL; goto werr; }
+    fp = NULL;
+    
+    /* Use RENAME to make sure the DB file is changed atomically only
+     * if the generate DB file is ok. */
+    if (rename(tmpfile,filename) == -1) {
+        char *cwdp = getcwd(cwd,MAXPATHLEN);
+        serverLog(LL_WARNING,
+            "Error moving temp DB file %s on the final "
+            "destination %s (in server root dir %s): %s",
+            tmpfile,
+            filename,
+            cwdp ? cwdp : "unknown",
+            strerror(errno));
+        unlink(tmpfile);
+        stopSaving(0);
+        return C_ERR;
+    }
+
+    serverLog(LL_NOTICE,"DB saved on disk");
+    server.dirty = 0;
+    server.lastsave = time(NULL);
+    server.lastbgsave_status = C_OK;
+    stopSaving(1);
+    return C_OK;
+
+werr:
+    serverLog(LL_WARNING,"Write error saving DB on disk: %s", strerror(errno));
+    if (fp) fclose(fp);
+    unlink(tmpfile);
+    stopSaving(0);
+    return C_ERR;
+}
+
+int rdbSaveBackground(char *filename, rdbSaveInfo *rsi) {
+    pid_t childpid;
+
+    if (hasActiveChildProcess()) return C_ERR;
+
+    server.dirty_before_bgsave = server.dirty;
+    server.lastbgsave_try = time(NULL);
+
+    if ((childpid = redisFork(CHILD_TYPE_RDB)) == 0) {
+        int retval;
+
+        /* Child */
+        redisSetProcTitle("redis-rdb-bgsave");
+        redisSetCpuAffinity(server.bgsave_cpulist);
+        retval = rdbSave(filename,rsi);
+        if (retval == C_OK) {
+            sendChildCowInfo(CHILD_INFO_TYPE_RDB_COW_SIZE, "RDB");
+        }
+        exitFromChild((retval == C_OK) ? 0 : 1);
+    } else {
+        /* Parent */
+        if (childpid == -1) {
+            server.lastbgsave_status = C_ERR;
+            serverLog(LL_WARNING,"Can't save in background: fork: %s",
+                strerror(errno));
+            return C_ERR;
+        }
+        serverLog(LL_NOTICE,"Background saving started by pid %ld",(long) childpid);
+        server.rdb_save_time_start = time(NULL);
+        server.rdb_child_type = RDB_CHILD_TYPE_DISK;
+        return C_OK;
+    }
+    return C_OK; /* unreached */
+}
+
+/* Note that we may call this function in signal handle 'sigShutdownHandler',
+ * so we need guarantee all functions we call are async-signal-safe.
+ * If  we call this function from signal handle, we won't call bg_unlink that
+ * is not async-signal-safe. */
+void rdbRemoveTempFile(pid_t childpid, int from_signal) {
+    char tmpfile[256];
+    char pid[32];
+
+    /* Generate temp rdb file name using aync-signal safe functions. */
+    int pid_len = ll2string(pid, sizeof(pid), childpid);
+    strcpy(tmpfile, "temp-");
+    strncpy(tmpfile+5, pid, pid_len);
+    strcpy(tmpfile+5+pid_len, ".rdb");
+
+    if (from_signal) {
+        /* bg_unlink is not async-signal-safe, but in this case we don't really
+         * need to close the fd, it'll be released when the process exists. */
+        int fd = open(tmpfile, O_RDONLY|O_NONBLOCK);
+        UNUSED(fd);
+        unlink(tmpfile);
+    } else {
+        bg_unlink(tmpfile);
+    }
+}
+
+/* This function is called by rdbLoadObject() when the code is in RDB-check
+ * mode and we find a module value of type 2 that can be parsed without
+ * the need of the actual module. The value is parsed for errors, finally
+ * a dummy redis object is returned just to conform to the API. */
+robj *rdbLoadCheckModuleValue(rio *rdb, char *modulename) {
+    uint64_t opcode;
+    while((opcode = rdbLoadLen(rdb,NULL)) != RDB_MODULE_OPCODE_EOF) {
+        if (opcode == RDB_MODULE_OPCODE_SINT ||
+            opcode == RDB_MODULE_OPCODE_UINT)
+        {
+            uint64_t len;
+            if (rdbLoadLenByRef(rdb,NULL,&len) == -1) {
+                rdbReportCorruptRDB(
+                    "Error reading integer from module %s value", modulename);
+            }
+        } else if (opcode == RDB_MODULE_OPCODE_STRING) {
+            robj *o = rdbGenericLoadStringObject(rdb,RDB_LOAD_NONE,NULL);
+            if (o == NULL) {
+                rdbReportCorruptRDB(
+                    "Error reading string from module %s value", modulename);
+            }
+            decrRefCount(o);
+        } else if (opcode == RDB_MODULE_OPCODE_FLOAT) {
+            float val;
+            if (rdbLoadBinaryFloatValue(rdb,&val) == -1) {
+                rdbReportCorruptRDB(
+                    "Error reading float from module %s value", modulename);
+            }
+        } else if (opcode == RDB_MODULE_OPCODE_DOUBLE) {
+            double val;
+            if (rdbLoadBinaryDoubleValue(rdb,&val) == -1) {
+                rdbReportCorruptRDB(
+                    "Error reading double from module %s value", modulename);
+            }
+        }
+    }
+    return createStringObject("module-dummy-value",18);
+}
+
+/* Load a Redis object of the specified type from the specified file.
+ * On success a newly allocated object is returned, otherwise NULL.
+ * When the function returns NULL and if 'error' is not NULL, the
+ * integer pointed by 'error' is set to the type of error that occurred */
+robj *rdbLoadObject(int rdbtype, rio *rdb, sds key, int *error) {
+    robj *o = NULL, *ele, *dec;
+    uint64_t len;
+    unsigned int i;
+
+    /* Set default error of load object, it will be set to 0 on success. */
+    if (error) *error = RDB_LOAD_ERR_OTHER;
+
+    int deep_integrity_validation = server.sanitize_dump_payload == SANITIZE_DUMP_YES;
+    if (server.sanitize_dump_payload == SANITIZE_DUMP_CLIENTS) {
+        /* Skip sanitization when loading (an RDB), or getting a RESTORE command
+         * from either the master or a client using an ACL user with the skip-sanitize-payload flag. */
+        int skip = server.loading ||
+            (server.current_client && (server.current_client->flags & CLIENT_MASTER));
+        if (!skip && server.current_client && server.current_client->user)
+            skip = !!(server.current_client->user->flags & USER_FLAG_SANITIZE_PAYLOAD_SKIP);
+        deep_integrity_validation = !skip;
+    }
+
+    if (rdbtype == RDB_TYPE_STRING) {
+        /* Read string value */
+        if ((o = rdbLoadEncodedStringObject(rdb)) == NULL) return NULL;
+        o = tryObjectEncoding(o);
+    } else if (rdbtype == RDB_TYPE_LIST) {
+        /* Read list value */
+        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+        if (len == 0) goto emptykey;
+
+        o = createQuicklistObject();
+        quicklistSetOptions(o->ptr, server.list_max_ziplist_size,
+                            server.list_compress_depth);
+
+        /* Load every single element of the list */
+        while(len--) {
+            if ((ele = rdbLoadEncodedStringObject(rdb)) == NULL) {
+                decrRefCount(o);
+                return NULL;
+            }
+            dec = getDecodedObject(ele);
+            size_t len = sdslen(dec->ptr);
+            quicklistPushTail(o->ptr, dec->ptr, len);
+            decrRefCount(dec);
+            decrRefCount(ele);
+        }
+    } else if (rdbtype == RDB_TYPE_SET) {
+        /* Read Set value */
+        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+        if (len == 0) goto emptykey;
+
+        /* Use a regular set when there are too many entries. */
+        size_t max_entries = server.set_max_intset_entries;
+        if (max_entries >= 1<<30) max_entries = 1<<30;
+        if (len > max_entries) {
+            o = createSetObject();
+            /* It's faster to expand the dict to the right size asap in order
+             * to avoid rehashing */
+            if (len > DICT_HT_INITIAL_SIZE && dictTryExpand(o->ptr,len) != DICT_OK) {
+                rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
+                decrRefCount(o);
+                return NULL;
+            }
+        } else {
+            o = createIntsetObject();
+        }
+
+        /* Load every single element of the set */
+        for (i = 0; i < len; i++) {
+            long long llval;
+            sds sdsele;
+
+            if ((sdsele = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                decrRefCount(o);
+                return NULL;
+            }
+
+            if (o->encoding == OBJ_ENCODING_INTSET) {
+                /* Fetch integer value from element. */
+                if (isSdsRepresentableAsLongLong(sdsele,&llval) == C_OK) {
+                    uint8_t success;
+                    o->ptr = intsetAdd(o->ptr,llval,&success);
+                    if (!success) {
+                        rdbReportCorruptRDB("Duplicate set members detected");
+                        decrRefCount(o);
+                        sdsfree(sdsele);
+                        return NULL;
+                    }
+                } else {
+                    setTypeConvert(o,OBJ_ENCODING_HT);
+                    if (dictTryExpand(o->ptr,len) != DICT_OK) {
+                        rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
+                        sdsfree(sdsele);
+                        decrRefCount(o);
+                        return NULL;
+                    }
+                }
+            }
+
+            /* This will also be called when the set was just converted
+             * to a regular hash table encoded set. */
+            if (o->encoding == OBJ_ENCODING_HT) {
+                if (dictAdd((dict*)o->ptr,sdsele,NULL) != DICT_OK) {
+                    rdbReportCorruptRDB("Duplicate set members detected");
+                    decrRefCount(o);
+                    sdsfree(sdsele);
+                    return NULL;
+                }
+            } else {
+                sdsfree(sdsele);
+            }
+        }
+    } else if (rdbtype == RDB_TYPE_ZSET_2 || rdbtype == RDB_TYPE_ZSET) {
+        /* Read list/set value. */
+        uint64_t zsetlen;
+        size_t maxelelen = 0, totelelen = 0;
+        zset *zs;
+
+        if ((zsetlen = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+        if (zsetlen == 0) goto emptykey;
+
+        o = createZsetObject();
+        zs = o->ptr;
+
+        if (zsetlen > DICT_HT_INITIAL_SIZE && dictTryExpand(zs->dict,zsetlen) != DICT_OK) {
+            rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)zsetlen);
+            decrRefCount(o);
+            return NULL;
+        }
+
+        /* Load every single element of the sorted set. */
+        while(zsetlen--) {
+            sds sdsele;
+            double score;
+            zskiplistNode *znode;
+
+            if ((sdsele = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                decrRefCount(o);
+                return NULL;
+            }
+
+            if (rdbtype == RDB_TYPE_ZSET_2) {
+                if (rdbLoadBinaryDoubleValue(rdb,&score) == -1) {
+                    decrRefCount(o);
+                    sdsfree(sdsele);
+                    return NULL;
+                }
+            } else {
+                if (rdbLoadDoubleValue(rdb,&score) == -1) {
+                    decrRefCount(o);
+                    sdsfree(sdsele);
+                    return NULL;
+                }
+            }
+
+            /* Don't care about integer-encoded strings. */
+            if (sdslen(sdsele) > maxelelen) maxelelen = sdslen(sdsele);
+            totelelen += sdslen(sdsele);
+
+            znode = zslInsert(zs->zsl,score,sdsele);
+            if (dictAdd(zs->dict,sdsele,&znode->score) != DICT_OK) {
+                rdbReportCorruptRDB("Duplicate zset fields detected");
+                decrRefCount(o);
+                /* no need to free 'sdsele', will be released by zslFree together with 'o' */
+                return NULL;
+            }
+        }
+
+        /* Convert *after* loading, since sorted sets are not stored ordered. */
+        if (zsetLength(o) <= server.zset_max_ziplist_entries &&
+            maxelelen <= server.zset_max_ziplist_value &&
+            ziplistSafeToAdd(NULL, totelelen))
+        {
+            zsetConvert(o,OBJ_ENCODING_ZIPLIST);
+        }
+    } else if (rdbtype == RDB_TYPE_HASH) {
+        uint64_t len;
+        int ret;
+        sds field, value;
+        dict *dupSearchDict = NULL;
+
+        len = rdbLoadLen(rdb, NULL);
+        if (len == RDB_LENERR) return NULL;
+        if (len == 0) goto emptykey;
+
+        o = createHashObject();
+
+        /* Too many entries? Use a hash table right from the start. */
+        if (len > server.hash_max_ziplist_entries)
+            hashTypeConvert(o, OBJ_ENCODING_HT);
+        else if (deep_integrity_validation) {
+            /* In this mode, we need to guarantee that the server won't crash
+             * later when the ziplist is converted to a dict.
+             * Create a set (dict with no values) to for a dup search.
+             * We can dismiss it as soon as we convert the ziplist to a hash. */
+            dupSearchDict = dictCreate(&hashDictType, NULL);
+        }
+
+
+        /* Load every field and value into the ziplist */
+        while (o->encoding == OBJ_ENCODING_ZIPLIST && len > 0) {
+            len--;
+            /* Load raw strings */
+            if ((field = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                decrRefCount(o);
+                if (dupSearchDict) dictRelease(dupSearchDict);
+                return NULL;
+            }
+            if ((value = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                sdsfree(field);
+                decrRefCount(o);
+                if (dupSearchDict) dictRelease(dupSearchDict);
+                return NULL;
+            }
+
+            if (dupSearchDict) {
+                sds field_dup = sdsdup(field);
+                if (dictAdd(dupSearchDict, field_dup, NULL) != DICT_OK) {
+                    rdbReportCorruptRDB("Hash with dup elements");
+                    dictRelease(dupSearchDict);
+                    decrRefCount(o);
+                    sdsfree(field_dup);
+                    sdsfree(field);
+                    sdsfree(value);
+                    return NULL;
+                }
+            }
+
+            /* Convert to hash table if size threshold is exceeded */
+            if (sdslen(field) > server.hash_max_ziplist_value ||
+                sdslen(value) > server.hash_max_ziplist_value ||
+                !ziplistSafeToAdd(o->ptr, sdslen(field)+sdslen(value)))
+            {
+                hashTypeConvert(o, OBJ_ENCODING_HT);
+                ret = dictAdd((dict*)o->ptr, field, value);
+                if (ret == DICT_ERR) {
+                    rdbReportCorruptRDB("Duplicate hash fields detected");
+                    if (dupSearchDict) dictRelease(dupSearchDict);
+                    sdsfree(value);
+                    sdsfree(field);
+                    decrRefCount(o);
+                    return NULL;
+                }
+                break;
+            }
+
+            /* Add pair to ziplist */
+            o->ptr = ziplistPush(o->ptr, (unsigned char*)field,
+                    sdslen(field), ZIPLIST_TAIL);
+            o->ptr = ziplistPush(o->ptr, (unsigned char*)value,
+                    sdslen(value), ZIPLIST_TAIL);
+
+            sdsfree(field);
+            sdsfree(value);
+        }
+
+        if (dupSearchDict) {
+            /* We no longer need this, from now on the entries are added
+             * to a dict so the check is performed implicitly. */
+            dictRelease(dupSearchDict);
+            dupSearchDict = NULL;
+        }
+
+        if (o->encoding == OBJ_ENCODING_HT && len > DICT_HT_INITIAL_SIZE) {
+            if (dictTryExpand(o->ptr,len) != DICT_OK) {
+                rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
+                decrRefCount(o);
+                return NULL;
+            }
+        }
+
+        /* Load remaining fields and values into the hash table */
+        while (o->encoding == OBJ_ENCODING_HT && len > 0) {
+            len--;
+            /* Load encoded strings */
+            if ((field = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                decrRefCount(o);
+                return NULL;
+            }
+            if ((value = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
+                sdsfree(field);
+                decrRefCount(o);
+                return NULL;
+            }
+
+            /* Add pair to hash table */
+            ret = dictAdd((dict*)o->ptr, field, value);
+            if (ret == DICT_ERR) {
+                rdbReportCorruptRDB("Duplicate hash fields detected");
+                sdsfree(value);
+                sdsfree(field);
+                decrRefCount(o);
+                return NULL;
+            }
+        }
+
+        /* All pairs should be read by now */
+        serverAssert(len == 0);
+    } else if (rdbtype == RDB_TYPE_LIST_QUICKLIST) {
+        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
+        if (len == 0) goto emptykey;
+
+        o = createQuicklistObject();
+        quicklistSetOptions(o->ptr, server.list_max_ziplist_size,
+                            server.list_compress_depth);
+
+        while (len--) {
+            size_t encoded_len;
+            unsigned char *zl =
+                rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&encoded_len);
+            if (zl == NULL) {
+                decrRefCount(o);
+                return NULL;
+            }
+            if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+            if (!ziplistValidateIntegrity(zl, encoded_len, deep_integrity_validation, NULL, NULL)) {
+                rdbReportCorruptRDB("Ziplist integrity check failed.");
+                decrRefCount(o);
+                zfree(zl);
+                return NULL;
+            }
+
+            /* Silently skip empty ziplists, if we'll end up with empty quicklist we'll fail later. */
+            if (ziplistLen(zl) == 0) {
+                zfree(zl);
+                continue;
+            } else {
+                quicklistAppendZiplist(o->ptr, zl);
+            }
+        }
+
+        if (quicklistCount(o->ptr) == 0) {
+            decrRefCount(o);
+            goto emptykey;
+        }
+    } else if (rdbtype == RDB_TYPE_HASH_ZIPMAP  ||
+               rdbtype == RDB_TYPE_LIST_ZIPLIST ||
+               rdbtype == RDB_TYPE_SET_INTSET   ||
+               rdbtype == RDB_TYPE_ZSET_ZIPLIST ||
+               rdbtype == RDB_TYPE_HASH_ZIPLIST)
+    {
+        size_t encoded_len;
+        unsigned char *encoded =
+            rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&encoded_len);
+        if (encoded == NULL) return NULL;
+
+        o = createObject(OBJ_STRING,encoded); /* Obj type fixed below. */
+
+        /* Fix the object encoding, and make sure to convert the encoded
+         * data type into the base type if accordingly to the current
+         * configuration there are too many elements in the encoded data
+         * type. Note that we only check the length and not max element
+         * size as this is an O(N) scan. Eventually everything will get
+         * converted. */
+        switch(rdbtype) {
+            case RDB_TYPE_HASH_ZIPMAP:
+                /* Since we don't keep zipmaps anymore, the rdb loading for these
+                 * is O(n) anyway, use `deep` validation. */
+                if (!zipmapValidateIntegrity(encoded, encoded_len, 1)) {
+                    rdbReportCorruptRDB("Zipmap integrity check failed.");
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    return NULL;
+                }
+                /* Convert to ziplist encoded hash. This must be deprecated
+                 * when loading dumps created by Redis 2.4 gets deprecated. */
+                {
+                    unsigned char *zl = ziplistNew();
+                    unsigned char *zi = zipmapRewind(o->ptr);
+                    unsigned char *fstr, *vstr;
+                    unsigned int flen, vlen;
+                    unsigned int maxlen = 0;
+                    dict *dupSearchDict = dictCreate(&hashDictType, NULL);
+
+                    while ((zi = zipmapNext(zi, &fstr, &flen, &vstr, &vlen)) != NULL) {
+                        if (flen > maxlen) maxlen = flen;
+                        if (vlen > maxlen) maxlen = vlen;
+
+                        /* search for duplicate records */
+                        sds field = sdstrynewlen(fstr, flen);
+                        if (!field || dictAdd(dupSearchDict, field, NULL) != DICT_OK ||
+                            !ziplistSafeToAdd(zl, (size_t)flen + vlen)) {
+                            rdbReportCorruptRDB("Hash zipmap with dup elements, or big length (%u)", flen);
+                            dictRelease(dupSearchDict);
+                            sdsfree(field);
+                            zfree(encoded);
+                            o->ptr = NULL;
+                            decrRefCount(o);
+                            return NULL;
+                        }
+
+                        zl = ziplistPush(zl, fstr, flen, ZIPLIST_TAIL);
+                        zl = ziplistPush(zl, vstr, vlen, ZIPLIST_TAIL);
+                    }
+
+                    dictRelease(dupSearchDict);
+                    zfree(o->ptr);
+                    o->ptr = zl;
+                    o->type = OBJ_HASH;
+                    o->encoding = OBJ_ENCODING_ZIPLIST;
+
+                    if (hashTypeLength(o) > server.hash_max_ziplist_entries ||
+                        maxlen > server.hash_max_ziplist_value)
+                    {
+                        hashTypeConvert(o, OBJ_ENCODING_HT);
+                    }
+                }
+                break;
+            case RDB_TYPE_LIST_ZIPLIST:
+                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+                if (!ziplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation, NULL, NULL)) {
+                    rdbReportCorruptRDB("List ziplist integrity check failed.");
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    return NULL;
+                }
+
+                if (ziplistLen(encoded) == 0) {
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    goto emptykey;
+                }
+
+                o->type = OBJ_LIST;
+                o->encoding = OBJ_ENCODING_ZIPLIST;
+                listTypeConvert(o,OBJ_ENCODING_QUICKLIST);
+                break;
+            case RDB_TYPE_SET_INTSET:
+                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+                if (!intsetValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
+                    rdbReportCorruptRDB("Intset integrity check failed.");
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    return NULL;
+                }
+                o->type = OBJ_SET;
+                o->encoding = OBJ_ENCODING_INTSET;
+                if (intsetLen(o->ptr) > server.set_max_intset_entries)
+                    setTypeConvert(o,OBJ_ENCODING_HT);
+                break;
+            case RDB_TYPE_ZSET_ZIPLIST:
+                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+                if (!zsetZiplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
+                    rdbReportCorruptRDB("Zset ziplist integrity check failed.");
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    return NULL;
+                }
+                o->type = OBJ_ZSET;
+                o->encoding = OBJ_ENCODING_ZIPLIST;
+                if (zsetLength(o) == 0) {
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    goto emptykey;
+                }
+
+                if (zsetLength(o) > server.zset_max_ziplist_entries)
+                    zsetConvert(o,OBJ_ENCODING_SKIPLIST);
+                break;
+            case RDB_TYPE_HASH_ZIPLIST:
+                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+                if (!hashZiplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
+                    rdbReportCorruptRDB("Hash ziplist integrity check failed.");
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    return NULL;
+                }
+                o->type = OBJ_HASH;
+                o->encoding = OBJ_ENCODING_ZIPLIST;
+                if (hashTypeLength(o) == 0) {
+                    zfree(encoded);
+                    o->ptr = NULL;
+                    decrRefCount(o);
+                    goto emptykey;
+                }
+
+                if (hashTypeLength(o) > server.hash_max_ziplist_entries)
+                    hashTypeConvert(o, OBJ_ENCODING_HT);
+                break;
+            default:
+                /* totally unreachable */
+                rdbReportCorruptRDB("Unknown RDB encoding type %d",rdbtype);
+                break;
+        }
+    } else if (rdbtype == RDB_TYPE_STREAM_LISTPACKS) {
+        o = createStreamObject();
+        stream *s = o->ptr;
+        uint64_t listpacks = rdbLoadLen(rdb,NULL);
+        if (listpacks == RDB_LENERR) {
+            rdbReportReadError("Stream listpacks len loading failed.");
+            decrRefCount(o);
+            return NULL;
+        }
+
+        while(listpacks--) {
+            /* Get the master ID, the one we'll use as key of the radix tree
+             * node: the entries inside the listpack itself are delta-encoded
+             * relatively to this ID. */
+            sds nodekey = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
+            if (nodekey == NULL) {
+                rdbReportReadError("Stream master ID loading failed: invalid encoding or I/O error.");
+                decrRefCount(o);
+                return NULL;
+            }
+            if (sdslen(nodekey) != sizeof(streamID)) {
+                rdbReportCorruptRDB("Stream node key entry is not the "
+                                        "size of a stream ID");
+                sdsfree(nodekey);
+                decrRefCount(o);
+                return NULL;
+            }
+
+            /* Load the listpack. */
+            size_t lp_size;
+            unsigned char *lp =
+                rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&lp_size);
+            if (lp == NULL) {
+                rdbReportReadError("Stream listpacks loading failed.");
+                sdsfree(nodekey);
+                decrRefCount(o);
+                return NULL;
+            }
+            if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
+            if (!streamValidateListpackIntegrity(lp, lp_size, deep_integrity_validation)) {
+                rdbReportCorruptRDB("Stream listpack integrity check failed.");
+                sdsfree(nodekey);
+                decrRefCount(o);
+                zfree(lp);
+                return NULL;
+            }
+
+            unsigned char *first = lpFirst(lp);
+            if (first == NULL) {
+                /* Serialized listpacks should never be empty, since on
+                 * deletion we should remove the radix tree key if the
+                 * resulting listpack is empty. */
+                rdbReportCorruptRDB("Empty listpack inside stream");
+                sdsfree(nodekey);
+                decrRefCount(o);
+                zfree(lp);
+                return NULL;
+            }
+
+            /* Insert the key in the radix tree. */
+            int retval = raxTryInsert(s->rax,
+                (unsigned char*)nodekey,sizeof(streamID),lp,NULL);
+            sdsfree(nodekey);
+            if (!retval) {
+                rdbReportCorruptRDB("Listpack re-added with existing key");
+                decrRefCount(o);
+                zfree(lp);
+                return NULL;
+            }
+        }
+        /* Load total number of items inside the stream. */
+        s->length = rdbLoadLen(rdb,NULL);
+
+        /* Load the last entry ID. */
+        s->last_id.ms = rdbLoadLen(rdb,NULL);
+        s->last_id.seq = rdbLoadLen(rdb,NULL);
+
+        if (rioGetReadError(rdb)) {
+            rdbReportReadError("Stream object metadata loading failed.");
+            decrRefCount(o);
+            return NULL;
+        }
+
+        /* Consumer groups loading */
+        uint64_t cgroups_count = rdbLoadLen(rdb,NULL);
+        if (cgroups_count == RDB_LENERR) {
+            rdbReportReadError("Stream cgroup count loading failed.");
+            decrRefCount(o);
+            return NULL;
+        }
+        while(cgroups_count--) {
+            /* Get the consumer group name and ID. We can then create the
+             * consumer group ASAP and populate its structure as
+             * we read more data. */
+            streamID cg_id;
+            sds cgname = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
+            if (cgname == NULL) {
+                rdbReportReadError(
+                    "Error reading the consumer group name from Stream");
+                decrRefCount(o);
+                return NULL;
+            }
+
+            cg_id.ms = rdbLoadLen(rdb,NULL);
+            cg_id.seq = rdbLoadLen(rdb,NULL);
+            if (rioGetReadError(rdb)) {
+                rdbReportReadError("Stream cgroup ID loading failed.");
+                sdsfree(cgname);
+                decrRefCount(o);
+                return NULL;
+            }
+
+            streamCG *cgroup = streamCreateCG(s,cgname,sdslen(cgname),&cg_id);
+            if (cgroup == NULL) {
+                rdbReportCorruptRDB("Duplicated consumer group name %s",
+                                         cgname);
+                decrRefCount(o);
+                sdsfree(cgname);
+                return NULL;
+            }
+            sdsfree(cgname);
+
+            /* Load the global PEL for this consumer group, however we'll
+             * not yet populate the NACK structures with the message
+             * owner, since consumers for this group and their messages will
+             * be read as a next step. So for now leave them not resolved
+             * and later populate it. */
+            uint64_t pel_size = rdbLoadLen(rdb,NULL);
+            if (pel_size == RDB_LENERR) {
+                rdbReportReadError("Stream PEL size loading failed.");
+                decrRefCount(o);
+                return NULL;
+            }
+            while(pel_size--) {
+                unsigned char rawid[sizeof(streamID)];
+                if (rioRead(rdb,rawid,sizeof(rawid)) == 0) {
+                    rdbReportReadError("Stream PEL ID loading failed.");
+                    decrRefCount(o);
+                    return NULL;
+                }
+                streamNACK *nack = streamCreateNACK(NULL);
+                nack->delivery_time = rdbLoadMillisecondTime(rdb,RDB_VERSION);
+                nack->delivery_count = rdbLoadLen(rdb,NULL);
+                if (rioGetReadError(rdb)) {
+                    rdbReportReadError("Stream PEL NACK loading failed.");
+                    decrRefCount(o);
+                    streamFreeNACK(nack);
+                    return NULL;
+                }
+                if (!raxTryInsert(cgroup->pel,rawid,sizeof(rawid),nack,NULL)) {
+                    rdbReportCorruptRDB("Duplicated global PEL entry "
+                                            "loading stream consumer group");
+                    decrRefCount(o);
+                    streamFreeNACK(nack);
+                    return NULL;
+                }
+            }
+
+            /* Now that we loaded our global PEL, we need to load the
+             * consumers and their local PELs. */
+            uint64_t consumers_num = rdbLoadLen(rdb,NULL);
+            if (consumers_num == RDB_LENERR) {
+                rdbReportReadError("Stream consumers num loading failed.");
+                decrRefCount(o);
+                return NULL;
+            }
+            while(consumers_num--) {
+                sds cname = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
+                if (cname == NULL) {
+                    rdbReportReadError(
+                        "Error reading the consumer name from Stream group.");
+                    decrRefCount(o);
+                    return NULL;
+                }
+                streamConsumer *consumer =
+                    streamLookupConsumer(cgroup,cname,SLC_NONE,NULL);
+                sdsfree(cname);
+                consumer->seen_time = rdbLoadMillisecondTime(rdb,RDB_VERSION);
+                if (rioGetReadError(rdb)) {
+                    rdbReportReadError("Stream short read reading seen time.");
+                    decrRefCount(o);
+                    return NULL;
+                }
+
+                /* Load the PEL about entries owned by this specific
+                 * consumer. */
+                pel_size = rdbLoadLen(rdb,NULL);
+                if (pel_size == RDB_LENERR) {
+                    rdbReportReadError(
+                        "Stream consumer PEL num loading failed.");
+                    decrRefCount(o);
+                    return NULL;
+                }
+                while(pel_size--) {
+                    unsigned char rawid[sizeof(streamID)];
+                    if (rioRead(rdb,rawid,sizeof(rawid)) == 0) {
+                        rdbReportReadError(
+                            "Stream short read reading PEL streamID.");
+                        decrRefCount(o);
+                        return NULL;
+                    }
+                    streamNACK *nack = raxFind(cgroup->pel,rawid,sizeof(rawid));
+                    if (nack == raxNotFound) {
+                        rdbReportCorruptRDB("Consumer entry not found in "
+                                                "group global PEL");
+                        decrRefCount(o);
+                        return NULL;
+                    }
+
+                    /* Set the NACK consumer, that was left to NULL when
+                     * loading the global PEL. Then set the same shared
+                     * NACK structure also in the consumer-specific PEL. */
+                    nack->consumer = consumer;
+                    if (!raxTryInsert(consumer->pel,rawid,sizeof(rawid),nack,NULL)) {
+                        rdbReportCorruptRDB("Duplicated consumer PEL entry "
+                                                " loading a stream consumer "
+                                                "group");
+                        decrRefCount(o);
+                        streamFreeNACK(nack);
+                        return NULL;
+                    }
+                }
+            }
+
+            /* Verify that each PEL eventually got a consumer assigned to it. */
+            if (deep_integrity_validation) {
+                raxIterator ri_cg_pel;
+                raxStart(&ri_cg_pel,cgroup->pel);
+                raxSeek(&ri_cg_pel,"^",NULL,0);
+                while(raxNext(&ri_cg_pel)) {
+                    streamNACK *nack = ri_cg_pel.data;
+                    if (!nack->consumer) {
+                        raxStop(&ri_cg_pel);
+                        rdbReportCorruptRDB("Stream CG PEL entry without consumer");
+                        decrRefCount(o);
+                        return NULL;
+                    }
+                }
+                raxStop(&ri_cg_pel);
+            }
+        }
+    } else if (rdbtype == RDB_TYPE_MODULE || rdbtype == RDB_TYPE_MODULE_2) {
+        uint64_t moduleid = rdbLoadLen(rdb,NULL);
+        if (rioGetReadError(rdb)) {
+            rdbReportReadError("Short read module id");
+            return NULL;
+        }
+        moduleType *mt = moduleTypeLookupModuleByID(moduleid);
+
+        if (rdbCheckMode && rdbtype == RDB_TYPE_MODULE_2) {
+            char name[10];
+            moduleTypeNameByID(name,moduleid);
+            return rdbLoadCheckModuleValue(rdb,name);
+        }
+
+        if (mt == NULL) {
+            char name[10];
+            moduleTypeNameByID(name,moduleid);
+            rdbReportCorruptRDB("The RDB file contains module data I can't load: no matching module type '%s'", name);
+            return NULL;
+        }
+        RedisModuleIO io;
+        robj keyobj;
+        initStaticStringObject(keyobj,key);
+        moduleInitIOContext(io,mt,rdb,&keyobj);
+        io.ver = (rdbtype == RDB_TYPE_MODULE) ? 1 : 2;
+        /* Call the rdb_load method of the module providing the 10 bit
+         * encoding version in the lower 10 bits of the module ID. */
+        void *ptr = mt->rdb_load(&io,moduleid&1023);
+        if (io.ctx) {
+            moduleFreeContext(io.ctx);
+            zfree(io.ctx);
+        }
+
+        /* Module v2 serialization has an EOF mark at the end. */
+        if (io.ver == 2) {
+            uint64_t eof = rdbLoadLen(rdb,NULL);
+            if (eof == RDB_LENERR) {
+                if (ptr) {
+                    o = createModuleObject(mt,ptr); /* creating just in order to easily destroy */
+                    decrRefCount(o);
+                }
+                return NULL;
+            }
+            if (eof != RDB_MODULE_OPCODE_EOF) {
+                rdbReportCorruptRDB("The RDB file contains module data for the module '%s' that is not terminated by "
+                                    "the proper module value EOF marker", moduleTypeModuleName(mt));
+                if (ptr) {
+                    o = createModuleObject(mt,ptr); /* creating just in order to easily destroy */
+                    decrRefCount(o);
+                }
+                return NULL;
+            }
+        }
+
+        if (ptr == NULL) {
+            rdbReportCorruptRDB("The RDB file contains module data for the module type '%s', that the responsible "
+                                "module is not able to load. Check for modules log above for additional clues.",
+                                moduleTypeModuleName(mt));
+            return NULL;
+        }
+        o = createModuleObject(mt,ptr);
+    } else {
+        rdbReportReadError("Unknown RDB encoding type %d",rdbtype);
+        return NULL;
+    }
+    if (error) *error = 0;
+    return o;
+
+emptykey:
+    if (error) *error = RDB_LOAD_ERR_EMPTY_KEY;
+    return NULL;
+}
+
+/* Mark that we are loading in the global state and setup the fields
+ * needed to provide loading stats. */
+void startLoading(size_t size, int rdbflags) {
+    /* Load the DB */
+    server.loading = 1;
+    server.loading_start_time = time(NULL);
+    server.loading_loaded_bytes = 0;
+    server.loading_total_bytes = size;
+    server.loading_rdb_used_mem = 0;
+    blockingOperationStarts();
+
+    /* Fire the loading modules start event. */
+    int subevent;
+    if (rdbflags & RDBFLAGS_AOF_PREAMBLE)
+        subevent = REDISMODULE_SUBEVENT_LOADING_AOF_START;
+    else if(rdbflags & RDBFLAGS_REPLICATION)
+        subevent = REDISMODULE_SUBEVENT_LOADING_REPL_START;
+    else
+        subevent = REDISMODULE_SUBEVENT_LOADING_RDB_START;
+    moduleFireServerEvent(REDISMODULE_EVENT_LOADING,subevent,NULL);
+}
+
+/* Mark that we are loading in the global state and setup the fields
+ * needed to provide loading stats.
+ * 'filename' is optional and used for rdb-check on error */
+void startLoadingFile(FILE *fp, char* filename, int rdbflags) {
+    struct stat sb;
+    if (fstat(fileno(fp), &sb) == -1)
+        sb.st_size = 0;
+    rdbFileBeingLoaded = filename;
+    startLoading(sb.st_size, rdbflags);
+}
+
+/* Refresh the loading progress info */
+void loadingProgress(off_t pos) {
+    server.loading_loaded_bytes = pos;
+    if (server.stat_peak_memory < zmalloc_used_memory())
+        server.stat_peak_memory = zmalloc_used_memory();
+}
+
+/* Loading finished */
+void stopLoading(int success) {
+    server.loading = 0;
+    blockingOperationEnds();
+    rdbFileBeingLoaded = NULL;
+
+    /* Fire the loading modules end event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_LOADING,
+                          success?
+                            REDISMODULE_SUBEVENT_LOADING_ENDED:
+                            REDISMODULE_SUBEVENT_LOADING_FAILED,
+                          NULL);
+}
+
+void startSaving(int rdbflags) {
+    /* Fire the persistence modules end event. */
+    int subevent;
+    if (rdbflags & RDBFLAGS_AOF_PREAMBLE)
+        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START;
+    else if (getpid()!=server.pid)
+        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START;
+    else
+        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START;
+    moduleFireServerEvent(REDISMODULE_EVENT_PERSISTENCE,subevent,NULL);
+}
+
+void stopSaving(int success) {
+    /* Fire the persistence modules end event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_PERSISTENCE,
+                          success?
+                            REDISMODULE_SUBEVENT_PERSISTENCE_ENDED:
+                            REDISMODULE_SUBEVENT_PERSISTENCE_FAILED,
+                          NULL);
+}
+
+/* Track loading progress in order to serve client's from time to time
+   and if needed calculate rdb checksum  */
+void rdbLoadProgressCallback(rio *r, const void *buf, size_t len) {
+    if (server.rdb_checksum)
+        rioGenericUpdateChecksum(r, buf, len);
+    if (server.loading_process_events_interval_bytes &&
+        (r->processed_bytes + len)/server.loading_process_events_interval_bytes > r->processed_bytes/server.loading_process_events_interval_bytes)
+    {
+        if (server.masterhost && server.repl_state == REPL_STATE_TRANSFER)
+            replicationSendNewlineToMaster();
+        loadingProgress(r->processed_bytes);
+        processEventsWhileBlocked();
+        processModuleLoadingProgressEvent(0);
+    }
+}
+
+/* Load an RDB file from the rio stream 'rdb'. On success C_OK is returned,
+ * otherwise C_ERR is returned and 'errno' is set accordingly. */
+int rdbLoadRio(rio *rdb, int rdbflags, rdbSaveInfo *rsi) {
+    uint64_t dbid;
+    int type, rdbver;
+    redisDb *db = server.db+0;
+    char buf[1024];
+    int error;
+    long long empty_keys_skipped = 0, expired_keys_skipped = 0, keys_loaded = 0;
+
+    rdb->update_cksum = rdbLoadProgressCallback;
+    rdb->max_processing_chunk = server.loading_process_events_interval_bytes;
+    if (rioRead(rdb,buf,9) == 0) goto eoferr;
+    buf[9] = '\0';
+    if (memcmp(buf,"REDIS",5) != 0) {
+        serverLog(LL_WARNING,"Wrong signature trying to load DB from file");
+        errno = EINVAL;
+        return C_ERR;
+    }
+    rdbver = atoi(buf+5);
+    if (rdbver < 1 || rdbver > RDB_VERSION) {
+        serverLog(LL_WARNING,"Can't handle RDB format version %d",rdbver);
+        errno = EINVAL;
+        return C_ERR;
+    }
+
+    /* Key-specific attributes, set by opcodes before the key type. */
+    long long lru_idle = -1, lfu_freq = -1, expiretime = -1, now = mstime();
+    long long lru_clock = LRU_CLOCK();
+
+    while(1) {
+        sds key;
+        robj *val;
+
+        /* Read type. */
+        if ((type = rdbLoadType(rdb)) == -1) goto eoferr;
+
+        /* Handle special types. */
+        if (type == RDB_OPCODE_EXPIRETIME) {
+            /* EXPIRETIME: load an expire associated with the next key
+             * to load. Note that after loading an expire we need to
+             * load the actual type, and continue. */
+            expiretime = rdbLoadTime(rdb);
+            expiretime *= 1000;
+            if (rioGetReadError(rdb)) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_EXPIRETIME_MS) {
+            /* EXPIRETIME_MS: milliseconds precision expire times introduced
+             * with RDB v3. Like EXPIRETIME but no with more precision. */
+            expiretime = rdbLoadMillisecondTime(rdb,rdbver);
+            if (rioGetReadError(rdb)) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_FREQ) {
+            /* FREQ: LFU frequency. */
+            uint8_t byte;
+            if (rioRead(rdb,&byte,1) == 0) goto eoferr;
+            lfu_freq = byte;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_IDLE) {
+            /* IDLE: LRU idle time. */
+            uint64_t qword;
+            if ((qword = rdbLoadLen(rdb,NULL)) == RDB_LENERR) goto eoferr;
+            lru_idle = qword;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_EOF) {
+            /* EOF: End of file, exit the main loop. */
+            break;
+        } else if (type == RDB_OPCODE_SELECTDB) {
+            /* SELECTDB: Select the specified database. */
+            if ((dbid = rdbLoadLen(rdb,NULL)) == RDB_LENERR) goto eoferr;
+            if (dbid >= (unsigned)server.dbnum) {
+                serverLog(LL_WARNING,
+                    "FATAL: Data file was created with a Redis "
+                    "server configured to handle more than %d "
+                    "databases. Exiting\n", server.dbnum);
+                exit(1);
+            }
+            db = server.db+dbid;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_RESIZEDB) {
+            /* RESIZEDB: Hint about the size of the keys in the currently
+             * selected data base, in order to avoid useless rehashing. */
+            uint64_t db_size, expires_size;
+            if ((db_size = rdbLoadLen(rdb,NULL)) == RDB_LENERR)
+                goto eoferr;
+            if ((expires_size = rdbLoadLen(rdb,NULL)) == RDB_LENERR)
+                goto eoferr;
+            dictExpand(db->dict,db_size);
+            dictExpand(db->expires,expires_size);
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_AUX) {
+            /* AUX: generic string-string fields. Use to add state to RDB
+             * which is backward compatible. Implementations of RDB loading
+             * are required to skip AUX fields they don't understand.
+             *
+             * An AUX field is composed of two strings: key and value. */
+            robj *auxkey, *auxval;
+            if ((auxkey = rdbLoadStringObject(rdb)) == NULL) goto eoferr;
+            if ((auxval = rdbLoadStringObject(rdb)) == NULL) goto eoferr;
+
+            if (((char*)auxkey->ptr)[0] == '%') {
+                /* All the fields with a name staring with '%' are considered
+                 * information fields and are logged at startup with a log
+                 * level of NOTICE. */
+                serverLog(LL_NOTICE,"RDB '%s': %s",
+                    (char*)auxkey->ptr,
+                    (char*)auxval->ptr);
+            } else if (!strcasecmp(auxkey->ptr,"repl-stream-db")) {
+                if (rsi) rsi->repl_stream_db = atoi(auxval->ptr);
+            } else if (!strcasecmp(auxkey->ptr,"repl-id")) {
+                if (rsi && sdslen(auxval->ptr) == CONFIG_RUN_ID_SIZE) {
+                    memcpy(rsi->repl_id,auxval->ptr,CONFIG_RUN_ID_SIZE+1);
+                    rsi->repl_id_is_set = 1;
+                }
+            } else if (!strcasecmp(auxkey->ptr,"repl-offset")) {
+                if (rsi) rsi->repl_offset = strtoll(auxval->ptr,NULL,10);
+            } else if (!strcasecmp(auxkey->ptr,"lua")) {
+                /* Load the script back in memory. */
+                if (luaCreateFunction(NULL,server.lua,auxval) == NULL) {
+                    rdbReportCorruptRDB(
+                        "Can't load Lua script from RDB file! "
+                        "BODY: %s", (char*)auxval->ptr);
+                }
+            } else if (!strcasecmp(auxkey->ptr,"redis-ver")) {
+                serverLog(LL_NOTICE,"Loading RDB produced by version %s",
+                    (char*)auxval->ptr);
+            } else if (!strcasecmp(auxkey->ptr,"ctime")) {
+                time_t age = time(NULL)-strtol(auxval->ptr,NULL,10);
+                if (age < 0) age = 0;
+                serverLog(LL_NOTICE,"RDB age %ld seconds",
+                    (unsigned long) age);
+            } else if (!strcasecmp(auxkey->ptr,"used-mem")) {
+                long long usedmem = strtoll(auxval->ptr,NULL,10);
+                serverLog(LL_NOTICE,"RDB memory usage when created %.2f Mb",
+                    (double) usedmem / (1024*1024));
+                server.loading_rdb_used_mem = usedmem;
+            } else if (!strcasecmp(auxkey->ptr,"aof-preamble")) {
+                long long haspreamble = strtoll(auxval->ptr,NULL,10);
+                if (haspreamble) serverLog(LL_NOTICE,"RDB has an AOF tail");
+            } else if (!strcasecmp(auxkey->ptr,"redis-bits")) {
+                /* Just ignored. */
+            } else {
+                /* We ignore fields we don't understand, as by AUX field
+                 * contract. */
+                serverLog(LL_DEBUG,"Unrecognized RDB AUX field: '%s'",
+                    (char*)auxkey->ptr);
+            }
+
+            decrRefCount(auxkey);
+            decrRefCount(auxval);
+            continue; /* Read type again. */
+        } else if (type == RDB_OPCODE_MODULE_AUX) {
+            /* Load module data that is not related to the Redis key space.
+             * Such data can be potentially be stored both before and after the
+             * RDB keys-values section. */
+            uint64_t moduleid = rdbLoadLen(rdb,NULL);
+            int when_opcode = rdbLoadLen(rdb,NULL);
+            int when = rdbLoadLen(rdb,NULL);
+            if (rioGetReadError(rdb)) goto eoferr;
+            if (when_opcode != RDB_MODULE_OPCODE_UINT) {
+                rdbReportReadError("bad when_opcode");
+                goto eoferr;
+            }
+            moduleType *mt = moduleTypeLookupModuleByID(moduleid);
+            char name[10];
+            moduleTypeNameByID(name,moduleid);
+
+            if (!rdbCheckMode && mt == NULL) {
+                /* Unknown module. */
+                serverLog(LL_WARNING,"The RDB file contains AUX module data I can't load: no matching module '%s'", name);
+                exit(1);
+            } else if (!rdbCheckMode && mt != NULL) {
+                if (!mt->aux_load) {
+                    /* Module doesn't support AUX. */
+                    serverLog(LL_WARNING,"The RDB file contains module AUX data, but the module '%s' doesn't seem to support it.", name);
+                    exit(1);
+                }
+
+                RedisModuleIO io;
+                moduleInitIOContext(io,mt,rdb,NULL);
+                io.ver = 2;
+                /* Call the rdb_load method of the module providing the 10 bit
+                 * encoding version in the lower 10 bits of the module ID. */
+                if (mt->aux_load(&io,moduleid&1023, when) != REDISMODULE_OK || io.error) {
+                    moduleTypeNameByID(name,moduleid);
+                    serverLog(LL_WARNING,"The RDB file contains module AUX data for the module type '%s', that the responsible module is not able to load. Check for modules log above for additional clues.", name);
+                    goto eoferr;
+                }
+                if (io.ctx) {
+                    moduleFreeContext(io.ctx);
+                    zfree(io.ctx);
+                }
+                uint64_t eof = rdbLoadLen(rdb,NULL);
+                if (eof != RDB_MODULE_OPCODE_EOF) {
+                    serverLog(LL_WARNING,"The RDB file contains module AUX data for the module '%s' that is not terminated by the proper module value EOF marker", name);
+                    goto eoferr;
+                }
+                continue;
+            } else {
+                /* RDB check mode. */
+                robj *aux = rdbLoadCheckModuleValue(rdb,name);
+                decrRefCount(aux);
+                continue; /* Read next opcode. */
+            }
+        }
+
+        /* Read key */
+        if ((key = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL)
+            goto eoferr;
+        /* Read value */
+        val = rdbLoadObject(type,rdb,key,&error);
+
+        /* Check if the key already expired. This function is used when loading
+         * an RDB file from disk, either at startup, or when an RDB was
+         * received from the master. In the latter case, the master is
+         * responsible for key expiry. If we would expire keys here, the
+         * snapshot taken by the master may not be reflected on the slave.
+         * Similarly if the RDB is the preamble of an AOF file, we want to
+         * load all the keys as they are, since the log of operations later
+         * assume to work in an exact keyspace state. */
+        if (val == NULL) {
+            /* Since we used to have bug that could lead to empty keys
+             * (See #8453), we rather not fail when empty key is encountered
+             * in an RDB file, instead we will silently discard it and
+             * continue loading. */
+            if (error == RDB_LOAD_ERR_EMPTY_KEY) {
+                if(empty_keys_skipped++ < 10)
+                    serverLog(LL_WARNING, "rdbLoadObject skipping empty key: %s", key);
+                sdsfree(key);
+            } else {
+                sdsfree(key);
+                goto eoferr;
+            }
+        } else if (iAmMaster() &&
+            !(rdbflags&RDBFLAGS_AOF_PREAMBLE) &&
+            expiretime != -1 && expiretime < now)
+        {
+            sdsfree(key);
+            decrRefCount(val);
+            expired_keys_skipped++;
+        } else {
+            robj keyobj;
+            initStaticStringObject(keyobj,key);
+
+            /* Add the new object in the hash table */
+            int added = dbAddRDBLoad(db,key,val);
+            keys_loaded++;
+            if (!added) {
+                if (rdbflags & RDBFLAGS_ALLOW_DUP) {
+                    /* This flag is useful for DEBUG RELOAD special modes.
+                     * When it's set we allow new keys to replace the current
+                     * keys with the same name. */
+                    dbSyncDelete(db,&keyobj);
+                    dbAddRDBLoad(db,key,val);
+                } else {
+                    serverLog(LL_WARNING,
+                        "RDB has duplicated key '%s' in DB %d",key,db->id);
+                    serverPanic("Duplicated key found in RDB file");
+                }
+            }
+
+            /* Set the expire time if needed */
+            if (expiretime != -1) {
+                setExpire(NULL,db,&keyobj,expiretime);
+            }
+
+            /* Set usage information (for eviction). */
+            objectSetLRUOrLFU(val,lfu_freq,lru_idle,lru_clock,1000);
+
+            /* call key space notification on key loaded for modules only */
+            moduleNotifyKeyspaceEvent(NOTIFY_LOADED, "loaded", &keyobj, db->id);
+        }
+
+        /* Loading the database more slowly is useful in order to test
+         * certain edge cases. */
+        if (server.key_load_delay)
+            debugDelay(server.key_load_delay);
+
+        /* Reset the state that is key-specified and is populated by
+         * opcodes before the key, so that we start from scratch again. */
+        expiretime = -1;
+        lfu_freq = -1;
+        lru_idle = -1;
+    }
+    /* Verify the checksum if RDB version is >= 5 */
+    if (rdbver >= 5) {
+        uint64_t cksum, expected = rdb->cksum;
+
+        if (rioRead(rdb,&cksum,8) == 0) goto eoferr;
+        if (server.rdb_checksum && !server.skip_checksum_validation) {
+            memrev64ifbe(&cksum);
+            if (cksum == 0) {
+                serverLog(LL_WARNING,"RDB file was saved with checksum disabled: no check performed.");
+            } else if (cksum != expected) {
+                serverLog(LL_WARNING,"Wrong RDB checksum expected: (%llx) but "
+                    "got (%llx). Aborting now.",
+                        (unsigned long long)expected,
+                        (unsigned long long)cksum);
+                rdbReportCorruptRDB("RDB CRC error");
+                return C_ERR;
+            }
+        }
+    }
+
+    if (empty_keys_skipped) {
+        serverLog(LL_WARNING,
+            "Done loading RDB, keys loaded: %lld, keys expired: %lld, empty keys skipped: %lld.",
+                keys_loaded, expired_keys_skipped, empty_keys_skipped);
+    } else {
+        serverLog(LL_WARNING,
+            "Done loading RDB, keys loaded: %lld, keys expired: %lld.",
+                keys_loaded, expired_keys_skipped);
+    }
+    return C_OK;
+
+    /* Unexpected end of file is handled here calling rdbReportReadError():
+     * this will in turn either abort Redis in most cases, or if we are loading
+     * the RDB file from a socket during initial SYNC (diskless replica mode),
+     * we'll report the error to the caller, so that we can retry. */
+eoferr:
+    serverLog(LL_WARNING,
+        "Short read or OOM loading DB. Unrecoverable error, aborting now.");
+    rdbReportReadError("Unexpected EOF reading RDB file");
+    return C_ERR;
+}
+
+/* Like rdbLoadRio() but takes a filename instead of a rio stream. The
+ * filename is open for reading and a rio stream object created in order
+ * to do the actual loading. Moreover the ETA displayed in the INFO
+ * output is initialized and finalized.
+ *
+ * If you pass an 'rsi' structure initialied with RDB_SAVE_OPTION_INIT, the
+ * loading code will fiil the information fields in the structure. */
+int rdbLoad(char *filename, rdbSaveInfo *rsi, int rdbflags) {
+    FILE *fp;
+    rio rdb;
+    int retval;
+
+    if ((fp = fopen(filename,"r")) == NULL) return C_ERR;
+    startLoadingFile(fp, filename,rdbflags);
+    rioInitWithFile(&rdb,fp);
+    retval = rdbLoadRio(&rdb,rdbflags,rsi);
+    fclose(fp);
+    stopLoading(retval==C_OK);
+    return retval;
+}
+
+/* A background saving child (BGSAVE) terminated its work. Handle this.
+ * This function covers the case of actual BGSAVEs. */
+static void backgroundSaveDoneHandlerDisk(int exitcode, int bysignal) {
+    if (!bysignal && exitcode == 0) {
+        serverLog(LL_NOTICE,
+            "Background saving terminated with success");
+        server.dirty = server.dirty - server.dirty_before_bgsave;
+        server.lastsave = time(NULL);
+        server.lastbgsave_status = C_OK;
+    } else if (!bysignal && exitcode != 0) {
+        serverLog(LL_WARNING, "Background saving error");
+        server.lastbgsave_status = C_ERR;
+    } else {
+        mstime_t latency;
+
+        serverLog(LL_WARNING,
+            "Background saving terminated by signal %d", bysignal);
+        latencyStartMonitor(latency);
+        rdbRemoveTempFile(server.child_pid, 0);
+        latencyEndMonitor(latency);
+        latencyAddSampleIfNeeded("rdb-unlink-temp-file",latency);
+        /* SIGUSR1 is whitelisted, so we have a way to kill a child without
+         * triggering an error condition. */
+        if (bysignal != SIGUSR1)
+            server.lastbgsave_status = C_ERR;
+    }
+}
+
+/* A background saving child (BGSAVE) terminated its work. Handle this.
+ * This function covers the case of RDB -> Slaves socket transfers for
+ * diskless replication. */
+static void backgroundSaveDoneHandlerSocket(int exitcode, int bysignal) {
+    if (!bysignal && exitcode == 0) {
+        serverLog(LL_NOTICE,
+            "Background RDB transfer terminated with success");
+    } else if (!bysignal && exitcode != 0) {
+        serverLog(LL_WARNING, "Background transfer error");
+    } else {
+        serverLog(LL_WARNING,
+            "Background transfer terminated by signal %d", bysignal);
+    }
+    if (server.rdb_child_exit_pipe!=-1)
+        close(server.rdb_child_exit_pipe);
+    aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
+    close(server.rdb_pipe_read);
+    server.rdb_child_exit_pipe = -1;
+    server.rdb_pipe_read = -1;
+    zfree(server.rdb_pipe_conns);
+    server.rdb_pipe_conns = NULL;
+    server.rdb_pipe_numconns = 0;
+    server.rdb_pipe_numconns_writing = 0;
+    zfree(server.rdb_pipe_buff);
+    server.rdb_pipe_buff = NULL;
+    server.rdb_pipe_bufflen = 0;
+}
+
+/* When a background RDB saving/transfer terminates, call the right handler. */
+void backgroundSaveDoneHandler(int exitcode, int bysignal) {
+    int type = server.rdb_child_type;
+    switch(server.rdb_child_type) {
+    case RDB_CHILD_TYPE_DISK:
+        backgroundSaveDoneHandlerDisk(exitcode,bysignal);
+        break;
+    case RDB_CHILD_TYPE_SOCKET:
+        backgroundSaveDoneHandlerSocket(exitcode,bysignal);
+        break;
+    default:
+        serverPanic("Unknown RDB child type.");
+        break;
+    }
+
+    server.rdb_child_type = RDB_CHILD_TYPE_NONE;
+    server.rdb_save_time_last = time(NULL)-server.rdb_save_time_start;
+    server.rdb_save_time_start = -1;
+    /* Possibly there are slaves waiting for a BGSAVE in order to be served
+     * (the first stage of SYNC is a bulk transfer of dump.rdb) */
+    updateSlavesWaitingBgsave((!bysignal && exitcode == 0) ? C_OK : C_ERR, type);
+}
+
+/* Kill the RDB saving child using SIGUSR1 (so that the parent will know
+ * the child did not exit for an error, but because we wanted), and performs
+ * the cleanup needed. */
+void killRDBChild(void) {
+    kill(server.child_pid, SIGUSR1);
+    /* Because we are not using here waitpid (like we have in killAppendOnlyChild
+     * and TerminateModuleForkChild), all the cleanup operations is done by
+     * checkChildrenDone, that later will find that the process killed.
+     * This includes:
+     * - resetChildState
+     * - rdbRemoveTempFile */
+}
+
+/* Spawn an RDB child that writes the RDB to the sockets of the slaves
+ * that are currently in SLAVE_STATE_WAIT_BGSAVE_START state. */
+int rdbSaveToSlavesSockets(rdbSaveInfo *rsi) {
+    listNode *ln;
+    listIter li;
+    pid_t childpid;
+    int pipefds[2], rdb_pipe_write, safe_to_exit_pipe;
+
+    if (hasActiveChildProcess()) return C_ERR;
+
+    /* Even if the previous fork child exited, don't start a new one until we
+     * drained the pipe. */
+    if (server.rdb_pipe_conns) return C_ERR;
+
+    /* Before to fork, create a pipe that is used to transfer the rdb bytes to
+     * the parent, we can't let it write directly to the sockets, since in case
+     * of TLS we must let the parent handle a continuous TLS state when the
+     * child terminates and parent takes over. */
+    if (pipe(pipefds) == -1) return C_ERR;
+    server.rdb_pipe_read = pipefds[0]; /* read end */
+    rdb_pipe_write = pipefds[1]; /* write end */
+    anetNonBlock(NULL, server.rdb_pipe_read);
+
+    /* create another pipe that is used by the parent to signal to the child
+     * that it can exit. */
+    if (pipe(pipefds) == -1) {
+        close(rdb_pipe_write);
+        close(server.rdb_pipe_read);
+        return C_ERR;
+    }
+    safe_to_exit_pipe = pipefds[0]; /* read end */
+    server.rdb_child_exit_pipe = pipefds[1]; /* write end */
+
+    /* Collect the connections of the replicas we want to transfer
+     * the RDB to, which are i WAIT_BGSAVE_START state. */
+    server.rdb_pipe_conns = zmalloc(sizeof(connection *)*listLength(server.slaves));
+    server.rdb_pipe_numconns = 0;
+    server.rdb_pipe_numconns_writing = 0;
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+        if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
+            server.rdb_pipe_conns[server.rdb_pipe_numconns++] = slave->conn;
+            replicationSetupSlaveForFullResync(slave,getPsyncInitialOffset());
+        }
+    }
+
+    /* Create the child process. */
+    if ((childpid = redisFork(CHILD_TYPE_RDB)) == 0) {
+        /* Child */
+        int retval, dummy;
+        rio rdb;
+
+        rioInitWithFd(&rdb,rdb_pipe_write);
+
+        redisSetProcTitle("redis-rdb-to-slaves");
+        redisSetCpuAffinity(server.bgsave_cpulist);
+
+        retval = rdbSaveRioWithEOFMark(&rdb,NULL,rsi);
+        if (retval == C_OK && rioFlush(&rdb) == 0)
+            retval = C_ERR;
+
+        if (retval == C_OK) {
+            sendChildCowInfo(CHILD_INFO_TYPE_RDB_COW_SIZE, "RDB");
+        }
+
+        rioFreeFd(&rdb);
+        /* wake up the reader, tell it we're done. */
+        close(rdb_pipe_write);
+        close(server.rdb_child_exit_pipe); /* close write end so that we can detect the close on the parent. */
+        /* hold exit until the parent tells us it's safe. we're not expecting
+         * to read anything, just get the error when the pipe is closed. */
+        dummy = read(safe_to_exit_pipe, pipefds, 1);
+        UNUSED(dummy);
+        exitFromChild((retval == C_OK) ? 0 : 1);
+    } else {
+        /* Parent */
+        close(safe_to_exit_pipe);
+        if (childpid == -1) {
+            serverLog(LL_WARNING,"Can't save in background: fork: %s",
+                strerror(errno));
+
+            /* Undo the state change. The caller will perform cleanup on
+             * all the slaves in BGSAVE_START state, but an early call to
+             * replicationSetupSlaveForFullResync() turned it into BGSAVE_END */
+            listRewind(server.slaves,&li);
+            while((ln = listNext(&li))) {
+                client *slave = ln->value;
+                if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END) {
+                    slave->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
+                }
+            }
+            close(rdb_pipe_write);
+            close(server.rdb_pipe_read);
+            zfree(server.rdb_pipe_conns);
+            server.rdb_pipe_conns = NULL;
+            server.rdb_pipe_numconns = 0;
+            server.rdb_pipe_numconns_writing = 0;
+        } else {
+            serverLog(LL_NOTICE,"Background RDB transfer started by pid %ld",
+                (long) childpid);
+            server.rdb_save_time_start = time(NULL);
+            server.rdb_child_type = RDB_CHILD_TYPE_SOCKET;
+            close(rdb_pipe_write); /* close write in parent so that it can detect the close on the child. */
+            if (aeCreateFileEvent(server.el, server.rdb_pipe_read, AE_READABLE, rdbPipeReadHandler,NULL) == AE_ERR) {
+                serverPanic("Unrecoverable error creating server.rdb_pipe_read file event.");
+            }
+        }
+        return (childpid == -1) ? C_ERR : C_OK;
+    }
+    return C_OK; /* Unreached. */
+}
+
+void saveCommand(client *c) {
+    if (server.child_type == CHILD_TYPE_RDB) {
+        addReplyError(c,"Background save already in progress");
+        return;
+    }
+    rdbSaveInfo rsi, *rsiptr;
+    rsiptr = rdbPopulateSaveInfo(&rsi);
+    if (rdbSave(server.rdb_filename,rsiptr) == C_OK) {
+        addReply(c,shared.ok);
+    } else {
+        addReplyErrorObject(c,shared.err);
+    }
+}
+
+/* BGSAVE [SCHEDULE] */
+void bgsaveCommand(client *c) {
+    int schedule = 0;
+
+    /* The SCHEDULE option changes the behavior of BGSAVE when an AOF rewrite
+     * is in progress. Instead of returning an error a BGSAVE gets scheduled. */
+    if (c->argc > 1) {
+        if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"schedule")) {
+            schedule = 1;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    rdbSaveInfo rsi, *rsiptr;
+    rsiptr = rdbPopulateSaveInfo(&rsi);
+
+    if (server.child_type == CHILD_TYPE_RDB) {
+        addReplyError(c,"Background save already in progress");
+    } else if (hasActiveChildProcess()) {
+        if (schedule) {
+            server.rdb_bgsave_scheduled = 1;
+            addReplyStatus(c,"Background saving scheduled");
+        } else {
+            addReplyError(c,
+            "Another child process is active (AOF?): can't BGSAVE right now. "
+            "Use BGSAVE SCHEDULE in order to schedule a BGSAVE whenever "
+            "possible.");
+        }
+    } else if (rdbSaveBackground(server.rdb_filename,rsiptr) == C_OK) {
+        addReplyStatus(c,"Background saving started");
+    } else {
+        addReplyErrorObject(c,shared.err);
+    }
+}
+
+/* Populate the rdbSaveInfo structure used to persist the replication
+ * information inside the RDB file. Currently the structure explicitly
+ * contains just the currently selected DB from the master stream, however
+ * if the rdbSave*() family functions receive a NULL rsi structure also
+ * the Replication ID/offset is not saved. The function popultes 'rsi'
+ * that is normally stack-allocated in the caller, returns the populated
+ * pointer if the instance has a valid master client, otherwise NULL
+ * is returned, and the RDB saving will not persist any replication related
+ * information. */
+rdbSaveInfo *rdbPopulateSaveInfo(rdbSaveInfo *rsi) {
+    rdbSaveInfo rsi_init = RDB_SAVE_INFO_INIT;
+    *rsi = rsi_init;
+
+    /* If the instance is a master, we can populate the replication info
+     * only when repl_backlog is not NULL. If the repl_backlog is NULL,
+     * it means that the instance isn't in any replication chains. In this
+     * scenario the replication info is useless, because when a slave
+     * connects to us, the NULL repl_backlog will trigger a full
+     * synchronization, at the same time we will use a new replid and clear
+     * replid2. */
+    if (!server.masterhost && server.repl_backlog) {
+        /* Note that when server.slaveseldb is -1, it means that this master
+         * didn't apply any write commands after a full synchronization.
+         * So we can let repl_stream_db be 0, this allows a restarted slave
+         * to reload replication ID/offset, it's safe because the next write
+         * command must generate a SELECT statement. */
+        rsi->repl_stream_db = server.slaveseldb == -1 ? 0 : server.slaveseldb;
+        return rsi;
+    }
+
+    /* If the instance is a slave we need a connected master
+     * in order to fetch the currently selected DB. */
+    if (server.master) {
+        rsi->repl_stream_db = server.master->db->id;
+        return rsi;
+    }
+
+    /* If we have a cached master we can use it in order to populate the
+     * replication selected DB info inside the RDB file: the slave can
+     * increment the master_repl_offset only from data arriving from the
+     * master, so if we are disconnected the offset in the cached master
+     * is valid. */
+    if (server.cached_master) {
+        rsi->repl_stream_db = server.cached_master->db->id;
+        return rsi;
+    }
+    return NULL;
+}
diff --git a/redis-stable/src/rdb.h b/redis-stable/src/rdb.h
new file mode 100644
index 00000000..ec34a208
--- /dev/null
+++ b/redis-stable/src/rdb.h
@@ -0,0 +1,170 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __RDB_H
+#define __RDB_H
+
+#include <stdio.h>
+#include "rio.h"
+
+/* TBD: include only necessary headers. */
+#include "server.h"
+
+/* The current RDB version. When the format changes in a way that is no longer
+ * backward compatible this number gets incremented. */
+#define RDB_VERSION 9
+
+/* Defines related to the dump file format. To store 32 bits lengths for short
+ * keys requires a lot of space, so we check the most significant 2 bits of
+ * the first byte to interpreter the length:
+ *
+ * 00|XXXXXX => if the two MSB are 00 the len is the 6 bits of this byte
+ * 01|XXXXXX XXXXXXXX =>  01, the len is 14 bits, 6 bits + 8 bits of next byte
+ * 10|000000 [32 bit integer] => A full 32 bit len in net byte order will follow
+ * 10|000001 [64 bit integer] => A full 64 bit len in net byte order will follow
+ * 11|OBKIND this means: specially encoded object will follow. The six bits
+ *           number specify the kind of object that follows.
+ *           See the RDB_ENC_* defines.
+ *
+ * Lengths up to 63 are stored using a single byte, most DB keys, and may
+ * values, will fit inside. */
+#define RDB_6BITLEN 0
+#define RDB_14BITLEN 1
+#define RDB_32BITLEN 0x80
+#define RDB_64BITLEN 0x81
+#define RDB_ENCVAL 3
+#define RDB_LENERR UINT64_MAX
+
+/* When a length of a string object stored on disk has the first two bits
+ * set, the remaining six bits specify a special encoding for the object
+ * accordingly to the following defines: */
+#define RDB_ENC_INT8 0        /* 8 bit signed integer */
+#define RDB_ENC_INT16 1       /* 16 bit signed integer */
+#define RDB_ENC_INT32 2       /* 32 bit signed integer */
+#define RDB_ENC_LZF 3         /* string compressed with FASTLZ */
+
+/* Map object types to RDB object types. Macros starting with OBJ_ are for
+ * memory storage and may change. Instead RDB types must be fixed because
+ * we store them on disk. */
+#define RDB_TYPE_STRING 0
+#define RDB_TYPE_LIST   1
+#define RDB_TYPE_SET    2
+#define RDB_TYPE_ZSET   3
+#define RDB_TYPE_HASH   4
+#define RDB_TYPE_ZSET_2 5 /* ZSET version 2 with doubles stored in binary. */
+#define RDB_TYPE_MODULE 6
+#define RDB_TYPE_MODULE_2 7 /* Module value with annotations for parsing without
+                               the generating module being loaded. */
+/* NOTE: WHEN ADDING NEW RDB TYPE, UPDATE rdbIsObjectType() BELOW */
+
+/* Object types for encoded objects. */
+#define RDB_TYPE_HASH_ZIPMAP    9
+#define RDB_TYPE_LIST_ZIPLIST  10
+#define RDB_TYPE_SET_INTSET    11
+#define RDB_TYPE_ZSET_ZIPLIST  12
+#define RDB_TYPE_HASH_ZIPLIST  13
+#define RDB_TYPE_LIST_QUICKLIST 14
+#define RDB_TYPE_STREAM_LISTPACKS 15
+/* NOTE: WHEN ADDING NEW RDB TYPE, UPDATE rdbIsObjectType() BELOW */
+
+/* Test if a type is an object type. */
+#define rdbIsObjectType(t) ((t >= 0 && t <= 7) || (t >= 9 && t <= 15))
+
+/* Special RDB opcodes (saved/loaded with rdbSaveType/rdbLoadType). */
+#define RDB_OPCODE_MODULE_AUX 247   /* Module auxiliary data. */
+#define RDB_OPCODE_IDLE       248   /* LRU idle time. */
+#define RDB_OPCODE_FREQ       249   /* LFU frequency. */
+#define RDB_OPCODE_AUX        250   /* RDB aux field. */
+#define RDB_OPCODE_RESIZEDB   251   /* Hash table resize hint. */
+#define RDB_OPCODE_EXPIRETIME_MS 252    /* Expire time in milliseconds. */
+#define RDB_OPCODE_EXPIRETIME 253       /* Old expire time in seconds. */
+#define RDB_OPCODE_SELECTDB   254   /* DB number of the following keys. */
+#define RDB_OPCODE_EOF        255   /* End of the RDB file. */
+
+/* Module serialized values sub opcodes */
+#define RDB_MODULE_OPCODE_EOF   0   /* End of module value. */
+#define RDB_MODULE_OPCODE_SINT  1   /* Signed integer. */
+#define RDB_MODULE_OPCODE_UINT  2   /* Unsigned integer. */
+#define RDB_MODULE_OPCODE_FLOAT 3   /* Float. */
+#define RDB_MODULE_OPCODE_DOUBLE 4  /* Double. */
+#define RDB_MODULE_OPCODE_STRING 5  /* String. */
+
+/* rdbLoad...() functions flags. */
+#define RDB_LOAD_NONE   0
+#define RDB_LOAD_ENC    (1<<0)
+#define RDB_LOAD_PLAIN  (1<<1)
+#define RDB_LOAD_SDS    (1<<2)
+
+/* flags on the purpose of rdb save or load */
+#define RDBFLAGS_NONE 0                 /* No special RDB loading. */
+#define RDBFLAGS_AOF_PREAMBLE (1<<0)    /* Load/save the RDB as AOF preamble. */
+#define RDBFLAGS_REPLICATION (1<<1)     /* Load/save for SYNC. */
+#define RDBFLAGS_ALLOW_DUP (1<<2)       /* Allow duplicated keys when loading.*/
+
+/* When rdbLoadObject() returns NULL, the err flag is
+ * set to hold the type of error that occurred */
+#define RDB_LOAD_ERR_EMPTY_KEY  1   /* Error of empty key */
+#define RDB_LOAD_ERR_OTHER      2   /* Any other errors */
+
+int rdbSaveType(rio *rdb, unsigned char type);
+int rdbLoadType(rio *rdb);
+int rdbSaveTime(rio *rdb, time_t t);
+time_t rdbLoadTime(rio *rdb);
+int rdbSaveLen(rio *rdb, uint64_t len);
+int rdbSaveMillisecondTime(rio *rdb, long long t);
+long long rdbLoadMillisecondTime(rio *rdb, int rdbver);
+uint64_t rdbLoadLen(rio *rdb, int *isencoded);
+int rdbLoadLenByRef(rio *rdb, int *isencoded, uint64_t *lenptr);
+int rdbSaveObjectType(rio *rdb, robj *o);
+int rdbLoadObjectType(rio *rdb);
+int rdbLoad(char *filename, rdbSaveInfo *rsi, int rdbflags);
+int rdbSaveBackground(char *filename, rdbSaveInfo *rsi);
+int rdbSaveToSlavesSockets(rdbSaveInfo *rsi);
+void rdbRemoveTempFile(pid_t childpid, int from_signal);
+int rdbSave(char *filename, rdbSaveInfo *rsi);
+ssize_t rdbSaveObject(rio *rdb, robj *o, robj *key);
+size_t rdbSavedObjectLen(robj *o, robj *key);
+robj *rdbLoadObject(int type, rio *rdb, sds key, int *error);
+void backgroundSaveDoneHandler(int exitcode, int bysignal);
+int rdbSaveKeyValuePair(rio *rdb, robj *key, robj *val, long long expiretime);
+ssize_t rdbSaveSingleModuleAux(rio *rdb, int when, moduleType *mt);
+robj *rdbLoadCheckModuleValue(rio *rdb, char *modulename);
+robj *rdbLoadStringObject(rio *rdb);
+ssize_t rdbSaveStringObject(rio *rdb, robj *obj);
+ssize_t rdbSaveRawString(rio *rdb, unsigned char *s, size_t len);
+void *rdbGenericLoadStringObject(rio *rdb, int flags, size_t *lenptr);
+int rdbSaveBinaryDoubleValue(rio *rdb, double val);
+int rdbLoadBinaryDoubleValue(rio *rdb, double *val);
+int rdbSaveBinaryFloatValue(rio *rdb, float val);
+int rdbLoadBinaryFloatValue(rio *rdb, float *val);
+int rdbLoadRio(rio *rdb, int rdbflags, rdbSaveInfo *rsi);
+int rdbSaveRio(rio *rdb, int *error, int rdbflags, rdbSaveInfo *rsi);
+rdbSaveInfo *rdbPopulateSaveInfo(rdbSaveInfo *rsi);
+
+#endif
diff --git a/redis-stable/src/redis-benchmark.c b/redis-stable/src/redis-benchmark.c
new file mode 100644
index 00000000..8d510d7d
--- /dev/null
+++ b/redis-stable/src/redis-benchmark.c
@@ -0,0 +1,1982 @@
+/* Redis benchmark utility.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include "version.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <errno.h>
+#include <time.h>
+#include <sys/time.h>
+#include <signal.h>
+#include <assert.h>
+#include <math.h>
+#include <pthread.h>
+
+#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
+#include <sds.h> /* Use hiredis sds. */
+#include "ae.h"
+#include <hiredis.h>
+#ifdef USE_OPENSSL
+#include <openssl/ssl.h>
+#include <openssl/err.h>
+#include <hiredis_ssl.h>
+#endif
+#include "adlist.h"
+#include "dict.h"
+#include "zmalloc.h"
+#include "atomicvar.h"
+#include "crc16_slottable.h"
+#include "hdr_histogram.h"
+#include "cli_common.h"
+#include "mt19937-64.h"
+
+#define UNUSED(V) ((void) V)
+#define RANDPTR_INITIAL_SIZE 8
+#define DEFAULT_LATENCY_PRECISION 3
+#define MAX_LATENCY_PRECISION 4
+#define MAX_THREADS 500
+#define CLUSTER_SLOTS 16384
+#define CONFIG_LATENCY_HISTOGRAM_MIN_VALUE 10L          /* >= 10 usecs */
+#define CONFIG_LATENCY_HISTOGRAM_MAX_VALUE 3000000L          /* <= 30 secs(us precision) */
+#define CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE 3000000L   /* <= 3 secs(us precision) */
+
+#define CLIENT_GET_EVENTLOOP(c) \
+    (c->thread_id >= 0 ? config.threads[c->thread_id]->el : config.el)
+
+struct benchmarkThread;
+struct clusterNode;
+struct redisConfig;
+
+static struct config {
+    aeEventLoop *el;
+    const char *hostip;
+    int hostport;
+    const char *hostsocket;
+    int tls;
+    struct cliSSLconfig sslconfig;
+    int numclients;
+    redisAtomic int liveclients;
+    int requests;
+    redisAtomic int requests_issued;
+    redisAtomic int requests_finished;
+    redisAtomic int previous_requests_finished;
+    int last_printed_bytes;
+    long long previous_tick;
+    int keysize;
+    int datasize;
+    int randomkeys;
+    int randomkeys_keyspacelen;
+    int keepalive;
+    int pipeline;
+    long long start;
+    long long totlatency;
+    const char *title;
+    list *clients;
+    int quiet;
+    int csv;
+    int loop;
+    int idlemode;
+    int dbnum;
+    sds dbnumstr;
+    char *tests;
+    char *auth;
+    const char *user;
+    int precision;
+    int num_threads;
+    struct benchmarkThread **threads;
+    int cluster_mode;
+    int cluster_node_count;
+    struct clusterNode **cluster_nodes;
+    struct redisConfig *redis_config;
+    struct hdr_histogram* latency_histogram;
+    struct hdr_histogram* current_sec_latency_histogram;
+    redisAtomic int is_fetching_slots;
+    redisAtomic int is_updating_slots;
+    redisAtomic int slots_last_update;
+    int enable_tracking;
+    pthread_mutex_t liveclients_mutex;
+    pthread_mutex_t is_updating_slots_mutex;
+} config;
+
+typedef struct _client {
+    redisContext *context;
+    sds obuf;
+    char **randptr;         /* Pointers to :rand: strings inside the command buf */
+    size_t randlen;         /* Number of pointers in client->randptr */
+    size_t randfree;        /* Number of unused pointers in client->randptr */
+    char **stagptr;         /* Pointers to slot hashtags (cluster mode only) */
+    size_t staglen;         /* Number of pointers in client->stagptr */
+    size_t stagfree;        /* Number of unused pointers in client->stagptr */
+    size_t written;         /* Bytes of 'obuf' already written */
+    long long start;        /* Start time of a request */
+    long long latency;      /* Request latency */
+    int pending;            /* Number of pending requests (replies to consume) */
+    int prefix_pending;     /* If non-zero, number of pending prefix commands. Commands
+                               such as auth and select are prefixed to the pipeline of
+                               benchmark commands and discarded after the first send. */
+    int prefixlen;          /* Size in bytes of the pending prefix commands */
+    int thread_id;
+    struct clusterNode *cluster_node;
+    int slots_last_update;
+} *client;
+
+/* Threads. */
+
+typedef struct benchmarkThread {
+    int index;
+    pthread_t thread;
+    aeEventLoop *el;
+} benchmarkThread;
+
+/* Cluster. */
+typedef struct clusterNode {
+    char *ip;
+    int port;
+    sds name;
+    int flags;
+    sds replicate;  /* Master ID if node is a slave */
+    int *slots;
+    int slots_count;
+    int current_slot_index;
+    int *updated_slots;         /* Used by updateClusterSlotsConfiguration */
+    int updated_slots_count;    /* Used by updateClusterSlotsConfiguration */
+    int replicas_count;
+    sds *migrating; /* An array of sds where even strings are slots and odd
+                     * strings are the destination node IDs. */
+    sds *importing; /* An array of sds where even strings are slots and odd
+                     * strings are the source node IDs. */
+    int migrating_count; /* Length of the migrating array (migrating slots*2) */
+    int importing_count; /* Length of the importing array (importing slots*2) */
+    struct redisConfig *redis_config;
+} clusterNode;
+
+typedef struct redisConfig {
+    sds save;
+    sds appendonly;
+} redisConfig;
+
+/* Prototypes */
+char *redisGitSHA1(void);
+char *redisGitDirty(void);
+static void writeHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+static void createMissingClients(client c);
+static benchmarkThread *createBenchmarkThread(int index);
+static void freeBenchmarkThread(benchmarkThread *thread);
+static void freeBenchmarkThreads();
+static void *execBenchmarkThread(void *ptr);
+static clusterNode *createClusterNode(char *ip, int port);
+static redisConfig *getRedisConfig(const char *ip, int port,
+                                   const char *hostsocket);
+static redisContext *getRedisContext(const char *ip, int port,
+                                     const char *hostsocket);
+static void freeRedisConfig(redisConfig *cfg);
+static int fetchClusterSlotsConfiguration(client c);
+static void updateClusterSlotsConfiguration();
+int showThroughput(struct aeEventLoop *eventLoop, long long id,
+                   void *clientData);
+
+static sds benchmarkVersion(void) {
+    sds version;
+    version = sdscatprintf(sdsempty(), "%s", REDIS_VERSION);
+
+    /* Add git commit and working tree status when available */
+    if (strtoll(redisGitSHA1(),NULL,16)) {
+        version = sdscatprintf(version, " (git:%s", redisGitSHA1());
+        if (strtoll(redisGitDirty(),NULL,10))
+            version = sdscatprintf(version, "-dirty");
+        version = sdscat(version, ")");
+    }
+    return version;
+}
+
+/* Dict callbacks */
+static uint64_t dictSdsHash(const void *key);
+static int dictSdsKeyCompare(void *privdata, const void *key1,
+    const void *key2);
+
+/* Implementation */
+static long long ustime(void) {
+    struct timeval tv;
+    long long ust;
+
+    gettimeofday(&tv, NULL);
+    ust = ((long)tv.tv_sec)*1000000;
+    ust += tv.tv_usec;
+    return ust;
+}
+
+static long long mstime(void) {
+    struct timeval tv;
+    long long mst;
+
+    gettimeofday(&tv, NULL);
+    mst = ((long long)tv.tv_sec)*1000;
+    mst += tv.tv_usec/1000;
+    return mst;
+}
+
+static uint64_t dictSdsHash(const void *key) {
+    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
+}
+
+static int dictSdsKeyCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    int l1,l2;
+    DICT_NOTUSED(privdata);
+
+    l1 = sdslen((sds)key1);
+    l2 = sdslen((sds)key2);
+    if (l1 != l2) return 0;
+    return memcmp(key1, key2, l1) == 0;
+}
+
+/* _serverAssert is needed by dict */
+void _serverAssert(const char *estr, const char *file, int line) {
+    fprintf(stderr, "=== ASSERTION FAILED ===");
+    fprintf(stderr, "==> %s:%d '%s' is not true",file,line,estr);
+    *((char*)-1) = 'x';
+}
+
+static redisContext *getRedisContext(const char *ip, int port,
+                                     const char *hostsocket)
+{
+    redisContext *ctx = NULL;
+    redisReply *reply =  NULL;
+    if (hostsocket == NULL)
+        ctx = redisConnect(ip, port);
+    else
+        ctx = redisConnectUnix(hostsocket);
+    if (ctx == NULL || ctx->err) {
+        fprintf(stderr,"Could not connect to Redis at ");
+        char *err = (ctx != NULL ? ctx->errstr : "");
+        if (hostsocket == NULL)
+            fprintf(stderr,"%s:%d: %s\n",ip,port,err);
+        else
+            fprintf(stderr,"%s: %s\n",hostsocket,err);
+        goto cleanup;
+    }
+    if (config.tls==1) {
+        const char *err = NULL;
+        if (cliSecureConnection(ctx, config.sslconfig, &err) == REDIS_ERR && err) {
+            fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
+            goto cleanup;
+        }
+    }
+    if (config.auth == NULL)
+        return ctx;
+    if (config.user == NULL)
+        reply = redisCommand(ctx,"AUTH %s", config.auth);
+    else
+        reply = redisCommand(ctx,"AUTH %s %s", config.user, config.auth);
+    if (reply != NULL) {
+        if (reply->type == REDIS_REPLY_ERROR) {
+            if (hostsocket == NULL)
+                fprintf(stderr, "Node %s:%d replied with error:\n%s\n", ip, port, reply->str);
+            else
+                fprintf(stderr, "Node %s replied with error:\n%s\n", hostsocket, reply->str);
+            freeReplyObject(reply);
+            redisFree(ctx);
+            exit(1);
+        }
+        freeReplyObject(reply);
+        return ctx;
+    }
+    fprintf(stderr, "ERROR: failed to fetch reply from ");
+    if (hostsocket == NULL)
+        fprintf(stderr, "%s:%d\n", ip, port);
+    else
+        fprintf(stderr, "%s\n", hostsocket);
+cleanup:
+    freeReplyObject(reply);
+    redisFree(ctx);
+    return NULL;
+}
+
+
+
+static redisConfig *getRedisConfig(const char *ip, int port,
+                                   const char *hostsocket)
+{
+    redisConfig *cfg = zcalloc(sizeof(*cfg));
+    if (!cfg) return NULL;
+    redisContext *c = NULL;
+    redisReply *reply = NULL, *sub_reply = NULL;
+    c = getRedisContext(ip, port, hostsocket);
+    if (c == NULL) {
+        freeRedisConfig(cfg);
+        return NULL;
+    }
+    redisAppendCommand(c, "CONFIG GET %s", "save");
+    redisAppendCommand(c, "CONFIG GET %s", "appendonly");
+    int i = 0;
+    void *r = NULL;
+    for (; i < 2; i++) {
+        int res = redisGetReply(c, &r);
+        if (reply) freeReplyObject(reply);
+        reply = res == REDIS_OK ? ((redisReply *) r) : NULL;
+        if (res != REDIS_OK || !r) goto fail;
+        if (reply->type == REDIS_REPLY_ERROR) {
+            fprintf(stderr, "ERROR: %s\n", reply->str);
+            goto fail;
+        }
+        if (reply->type != REDIS_REPLY_ARRAY || reply->elements < 2) goto fail;
+        sub_reply = reply->element[1];
+        char *value = sub_reply->str;
+        if (!value) value = "";
+        switch (i) {
+        case 0: cfg->save = sdsnew(value); break;
+        case 1: cfg->appendonly = sdsnew(value); break;
+        }
+    }
+    freeReplyObject(reply);
+    redisFree(c);
+    return cfg;
+fail:
+    fprintf(stderr, "ERROR: failed to fetch CONFIG from ");
+    if (hostsocket == NULL) fprintf(stderr, "%s:%d\n", ip, port);
+    else fprintf(stderr, "%s\n", hostsocket);
+    int abort_test = 0;
+    if (reply && reply->type == REDIS_REPLY_ERROR &&
+        (!strncmp(reply->str,"NOAUTH",5) ||
+         !strncmp(reply->str,"WRONGPASS",9) ||
+         !strncmp(reply->str,"NOPERM",5)))
+        abort_test = 1;
+    freeReplyObject(reply);
+    redisFree(c);
+    freeRedisConfig(cfg);
+    if (abort_test) exit(1);
+    return NULL;
+}
+static void freeRedisConfig(redisConfig *cfg) {
+    if (cfg->save) sdsfree(cfg->save);
+    if (cfg->appendonly) sdsfree(cfg->appendonly);
+    zfree(cfg);
+}
+
+static void freeClient(client c) {
+    aeEventLoop *el = CLIENT_GET_EVENTLOOP(c);
+    listNode *ln;
+    aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
+    aeDeleteFileEvent(el,c->context->fd,AE_READABLE);
+    if (c->thread_id >= 0) {
+        int requests_finished = 0;
+        atomicGet(config.requests_finished, requests_finished);
+        if (requests_finished >= config.requests) {
+            aeStop(el);
+        }
+    }
+    redisFree(c->context);
+    sdsfree(c->obuf);
+    zfree(c->randptr);
+    zfree(c->stagptr);
+    zfree(c);
+    if (config.num_threads) pthread_mutex_lock(&(config.liveclients_mutex));
+    config.liveclients--;
+    ln = listSearchKey(config.clients,c);
+    assert(ln != NULL);
+    listDelNode(config.clients,ln);
+    if (config.num_threads) pthread_mutex_unlock(&(config.liveclients_mutex));
+}
+
+static void freeAllClients(void) {
+    listNode *ln = config.clients->head, *next;
+
+    while(ln) {
+        next = ln->next;
+        freeClient(ln->value);
+        ln = next;
+    }
+}
+
+static void resetClient(client c) {
+    aeEventLoop *el = CLIENT_GET_EVENTLOOP(c);
+    aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
+    aeDeleteFileEvent(el,c->context->fd,AE_READABLE);
+    aeCreateFileEvent(el,c->context->fd,AE_WRITABLE,writeHandler,c);
+    c->written = 0;
+    c->pending = config.pipeline;
+}
+
+static void randomizeClientKey(client c) {
+    size_t i;
+
+    for (i = 0; i < c->randlen; i++) {
+        char *p = c->randptr[i]+11;
+        size_t r = 0;
+        if (config.randomkeys_keyspacelen != 0)
+            r = random() % config.randomkeys_keyspacelen;
+        size_t j;
+
+        for (j = 0; j < 12; j++) {
+            *p = '0'+r%10;
+            r/=10;
+            p--;
+        }
+    }
+}
+
+static void setClusterKeyHashTag(client c) {
+    assert(c->thread_id >= 0);
+    clusterNode *node = c->cluster_node;
+    assert(node);
+    assert(node->current_slot_index < node->slots_count);
+    int is_updating_slots = 0;
+    atomicGet(config.is_updating_slots, is_updating_slots);
+    /* If updateClusterSlotsConfiguration is updating the slots array,
+     * call updateClusterSlotsConfiguration is order to block the thread
+     * since the mutex is locked. When the slots will be updated by the
+     * thread that's actually performing the update, the execution of
+     * updateClusterSlotsConfiguration won't actually do anything, since
+     * the updated_slots_count array will be already NULL. */
+    if (is_updating_slots) updateClusterSlotsConfiguration();
+    int slot = node->slots[node->current_slot_index];
+    const char *tag = crc16_slot_table[slot];
+    int taglen = strlen(tag);
+    size_t i;
+    for (i = 0; i < c->staglen; i++) {
+        char *p = c->stagptr[i] + 1;
+        p[0] = tag[0];
+        p[1] = (taglen >= 2 ? tag[1] : '}');
+        p[2] = (taglen == 3 ? tag[2] : '}');
+    }
+}
+
+static void clientDone(client c) {
+    int requests_finished = 0;
+    atomicGet(config.requests_finished, requests_finished);
+    if (requests_finished >= config.requests) {
+        freeClient(c);
+        if (!config.num_threads && config.el) aeStop(config.el);
+        return;
+    }
+    if (config.keepalive) {
+        resetClient(c);
+    } else {
+        if (config.num_threads) pthread_mutex_lock(&(config.liveclients_mutex));
+        config.liveclients--;
+        createMissingClients(c);
+        config.liveclients++;
+        if (config.num_threads)
+            pthread_mutex_unlock(&(config.liveclients_mutex));
+        freeClient(c);
+    }
+}
+
+static void readHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    client c = privdata;
+    void *reply = NULL;
+    UNUSED(el);
+    UNUSED(fd);
+    UNUSED(mask);
+
+    /* Calculate latency only for the first read event. This means that the
+     * server already sent the reply and we need to parse it. Parsing overhead
+     * is not part of the latency, so calculate it only once, here. */
+    if (c->latency < 0) c->latency = ustime()-(c->start);
+
+    if (redisBufferRead(c->context) != REDIS_OK) {
+        fprintf(stderr,"Error: %s\n",c->context->errstr);
+        exit(1);
+    } else {
+        while(c->pending) {
+            if (redisGetReply(c->context,&reply) != REDIS_OK) {
+                fprintf(stderr,"Error: %s\n",c->context->errstr);
+                exit(1);
+            }
+            if (reply != NULL) {
+                if (reply == (void*)REDIS_REPLY_ERROR) {
+                    fprintf(stderr,"Unexpected error reply, exiting...\n");
+                    exit(1);
+                }
+                redisReply *r = reply;
+                if (r->type == REDIS_REPLY_ERROR) {
+                    /* Try to update slots configuration if reply error is
+                    * MOVED/ASK/CLUSTERDOWN and the key(s) used by the command
+                    * contain(s) the slot hash tag.
+                    * If the error is not topology-update related then we
+                    * immediately exit to avoid false results. */
+                    if (c->cluster_node && c->staglen) {
+                        int fetch_slots = 0, do_wait = 0;
+                        if (!strncmp(r->str,"MOVED",5) || !strncmp(r->str,"ASK",3))
+                            fetch_slots = 1;
+                        else if (!strncmp(r->str,"CLUSTERDOWN",11)) {
+                            /* Usually the cluster is able to recover itself after
+                            * a CLUSTERDOWN error, so try to sleep one second
+                            * before requesting the new configuration. */
+                            fetch_slots = 1;
+                            do_wait = 1;
+                            printf("Error from server %s:%d: %s.\n",
+                                   c->cluster_node->ip,
+                                   c->cluster_node->port,
+                                   r->str);
+                        }
+                        if (do_wait) sleep(1);
+                        if (fetch_slots && !fetchClusterSlotsConfiguration(c))
+                            exit(1);
+                    } else {
+                        if (c->cluster_node) {
+                            printf("Error from server %s:%d: %s\n",
+                                c->cluster_node->ip,
+                                c->cluster_node->port,
+                                r->str);
+                        } else printf("Error from server: %s\n", r->str);
+                        exit(1);
+                    }
+                }
+
+                freeReplyObject(reply);
+                /* This is an OK for prefix commands such as auth and select.*/
+                if (c->prefix_pending > 0) {
+                    c->prefix_pending--;
+                    c->pending--;
+                    /* Discard prefix commands on first response.*/
+                    if (c->prefixlen > 0) {
+                        size_t j;
+                        sdsrange(c->obuf, c->prefixlen, -1);
+                        /* We also need to fix the pointers to the strings
+                        * we need to randomize. */
+                        for (j = 0; j < c->randlen; j++)
+                            c->randptr[j] -= c->prefixlen;
+                        /* Fix the pointers to the slot hash tags */
+                        for (j = 0; j < c->staglen; j++)
+                            c->stagptr[j] -= c->prefixlen;
+                        c->prefixlen = 0;
+                    }
+                    continue;
+                }
+                int requests_finished = 0;
+                atomicGetIncr(config.requests_finished, requests_finished, 1);
+                if (requests_finished < config.requests){
+                        if (config.num_threads == 0) {
+                            hdr_record_value(
+                            config.latency_histogram,  // Histogram to record to
+                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_MAX_VALUE);  // Value to record
+                            hdr_record_value(
+                            config.current_sec_latency_histogram,  // Histogram to record to
+                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE);  // Value to record
+                        } else {
+                            hdr_record_value_atomic(
+                            config.latency_histogram,  // Histogram to record to
+                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_MAX_VALUE);  // Value to record
+                            hdr_record_value_atomic(
+                            config.current_sec_latency_histogram,  // Histogram to record to
+                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE);  // Value to record
+                        }
+                }
+                c->pending--;
+                if (c->pending == 0) {
+                    clientDone(c);
+                    break;
+                }
+            } else {
+                break;
+            }
+        }
+    }
+}
+
+static void writeHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
+    client c = privdata;
+    UNUSED(el);
+    UNUSED(fd);
+    UNUSED(mask);
+
+    /* Initialize request when nothing was written. */
+    if (c->written == 0) {
+        /* Enforce upper bound to number of requests. */
+        int requests_issued = 0;
+        atomicGetIncr(config.requests_issued, requests_issued, config.pipeline);
+        if (requests_issued >= config.requests) {
+            return;
+        }
+
+        /* Really initialize: randomize keys and set start time. */
+        if (config.randomkeys) randomizeClientKey(c);
+        if (config.cluster_mode && c->staglen > 0) setClusterKeyHashTag(c);
+        atomicGet(config.slots_last_update, c->slots_last_update);
+        c->start = ustime();
+        c->latency = -1;
+    }
+    const ssize_t buflen = sdslen(c->obuf);
+    const ssize_t writeLen = buflen-c->written;
+    if (writeLen > 0) {
+        void *ptr = c->obuf+c->written;
+        while(1) {
+            /* Optimistically try to write before checking if the file descriptor
+             * is actually writable. At worst we get EAGAIN. */
+            const ssize_t nwritten = cliWriteConn(c->context,ptr,writeLen);
+            if (nwritten != writeLen) {
+                if (nwritten == -1 && errno != EAGAIN) {
+                    if (errno != EPIPE)
+                        fprintf(stderr, "Error writing to the server: %s\n", strerror(errno));
+                    freeClient(c);
+                    return;
+                }
+            } else {
+                aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
+                aeCreateFileEvent(el,c->context->fd,AE_READABLE,readHandler,c);
+                return;
+            }
+        }
+    }
+}
+
+/* Create a benchmark client, configured to send the command passed as 'cmd' of
+ * 'len' bytes.
+ *
+ * The command is copied N times in the client output buffer (that is reused
+ * again and again to send the request to the server) accordingly to the configured
+ * pipeline size.
+ *
+ * Also an initial SELECT command is prepended in order to make sure the right
+ * database is selected, if needed. The initial SELECT will be discarded as soon
+ * as the first reply is received.
+ *
+ * To create a client from scratch, the 'from' pointer is set to NULL. If instead
+ * we want to create a client using another client as reference, the 'from' pointer
+ * points to the client to use as reference. In such a case the following
+ * information is take from the 'from' client:
+ *
+ * 1) The command line to use.
+ * 2) The offsets of the __rand_int__ elements inside the command line, used
+ *    for arguments randomization.
+ *
+ * Even when cloning another client, prefix commands are applied if needed.*/
+static client createClient(char *cmd, size_t len, client from, int thread_id) {
+    int j;
+    int is_cluster_client = (config.cluster_mode && thread_id >= 0);
+    client c = zmalloc(sizeof(struct _client));
+
+    const char *ip = NULL;
+    int port = 0;
+    c->cluster_node = NULL;
+    if (config.hostsocket == NULL || is_cluster_client) {
+        if (!is_cluster_client) {
+            ip = config.hostip;
+            port = config.hostport;
+        } else {
+            int node_idx = 0;
+            if (config.num_threads < config.cluster_node_count)
+                node_idx = config.liveclients % config.cluster_node_count;
+            else
+                node_idx = thread_id % config.cluster_node_count;
+            clusterNode *node = config.cluster_nodes[node_idx];
+            assert(node != NULL);
+            ip = (const char *) node->ip;
+            port = node->port;
+            c->cluster_node = node;
+        }
+        c->context = redisConnectNonBlock(ip,port);
+    } else {
+        c->context = redisConnectUnixNonBlock(config.hostsocket);
+    }
+    if (c->context->err) {
+        fprintf(stderr,"Could not connect to Redis at ");
+        if (config.hostsocket == NULL || is_cluster_client)
+            fprintf(stderr,"%s:%d: %s\n",ip,port,c->context->errstr);
+        else
+            fprintf(stderr,"%s: %s\n",config.hostsocket,c->context->errstr);
+        exit(1);
+    }
+    if (config.tls==1) {
+        const char *err = NULL;
+        if (cliSecureConnection(c->context, config.sslconfig, &err) == REDIS_ERR && err) {
+            fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
+            exit(1);
+        }
+    }
+    c->thread_id = thread_id;
+    /* Suppress hiredis cleanup of unused buffers for max speed. */
+    c->context->reader->maxbuf = 0;
+
+    /* Build the request buffer:
+     * Queue N requests accordingly to the pipeline size, or simply clone
+     * the example client buffer. */
+    c->obuf = sdsempty();
+    /* Prefix the request buffer with AUTH and/or SELECT commands, if applicable.
+     * These commands are discarded after the first response, so if the client is
+     * reused the commands will not be used again. */
+    c->prefix_pending = 0;
+    if (config.auth) {
+        char *buf = NULL;
+        int len;
+        if (config.user == NULL)
+            len = redisFormatCommand(&buf, "AUTH %s", config.auth);
+        else
+            len = redisFormatCommand(&buf, "AUTH %s %s",
+                                     config.user, config.auth);
+        c->obuf = sdscatlen(c->obuf, buf, len);
+        free(buf);
+        c->prefix_pending++;
+    }
+
+    if (config.enable_tracking) {
+        char *buf = NULL;
+        int len = redisFormatCommand(&buf, "CLIENT TRACKING on");
+        c->obuf = sdscatlen(c->obuf, buf, len);
+        free(buf);
+        c->prefix_pending++;
+    }
+
+    /* If a DB number different than zero is selected, prefix our request
+     * buffer with the SELECT command, that will be discarded the first
+     * time the replies are received, so if the client is reused the
+     * SELECT command will not be used again. */
+    if (config.dbnum != 0 && !is_cluster_client) {
+        c->obuf = sdscatprintf(c->obuf,"*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
+            (int)sdslen(config.dbnumstr),config.dbnumstr);
+        c->prefix_pending++;
+    }
+    c->prefixlen = sdslen(c->obuf);
+    /* Append the request itself. */
+    if (from) {
+        c->obuf = sdscatlen(c->obuf,
+            from->obuf+from->prefixlen,
+            sdslen(from->obuf)-from->prefixlen);
+    } else {
+        for (j = 0; j < config.pipeline; j++)
+            c->obuf = sdscatlen(c->obuf,cmd,len);
+    }
+
+    c->written = 0;
+    c->pending = config.pipeline+c->prefix_pending;
+    c->randptr = NULL;
+    c->randlen = 0;
+    c->stagptr = NULL;
+    c->staglen = 0;
+
+    /* Find substrings in the output buffer that need to be randomized. */
+    if (config.randomkeys) {
+        if (from) {
+            c->randlen = from->randlen;
+            c->randfree = 0;
+            c->randptr = zmalloc(sizeof(char*)*c->randlen);
+            /* copy the offsets. */
+            for (j = 0; j < (int)c->randlen; j++) {
+                c->randptr[j] = c->obuf + (from->randptr[j]-from->obuf);
+                /* Adjust for the different select prefix length. */
+                c->randptr[j] += c->prefixlen - from->prefixlen;
+            }
+        } else {
+            char *p = c->obuf;
+
+            c->randlen = 0;
+            c->randfree = RANDPTR_INITIAL_SIZE;
+            c->randptr = zmalloc(sizeof(char*)*c->randfree);
+            while ((p = strstr(p,"__rand_int__")) != NULL) {
+                if (c->randfree == 0) {
+                    c->randptr = zrealloc(c->randptr,sizeof(char*)*c->randlen*2);
+                    c->randfree += c->randlen;
+                }
+                c->randptr[c->randlen++] = p;
+                c->randfree--;
+                p += 12; /* 12 is strlen("__rand_int__). */
+            }
+        }
+    }
+    /* If cluster mode is enabled, set slot hashtags pointers. */
+    if (config.cluster_mode) {
+        if (from) {
+            c->staglen = from->staglen;
+            c->stagfree = 0;
+            c->stagptr = zmalloc(sizeof(char*)*c->staglen);
+            /* copy the offsets. */
+            for (j = 0; j < (int)c->staglen; j++) {
+                c->stagptr[j] = c->obuf + (from->stagptr[j]-from->obuf);
+                /* Adjust for the different select prefix length. */
+                c->stagptr[j] += c->prefixlen - from->prefixlen;
+            }
+        } else {
+            char *p = c->obuf;
+
+            c->staglen = 0;
+            c->stagfree = RANDPTR_INITIAL_SIZE;
+            c->stagptr = zmalloc(sizeof(char*)*c->stagfree);
+            while ((p = strstr(p,"{tag}")) != NULL) {
+                if (c->stagfree == 0) {
+                    c->stagptr = zrealloc(c->stagptr,
+                                          sizeof(char*) * c->staglen*2);
+                    c->stagfree += c->staglen;
+                }
+                c->stagptr[c->staglen++] = p;
+                c->stagfree--;
+                p += 5; /* 5 is strlen("{tag}"). */
+            }
+        }
+    }
+    aeEventLoop *el = NULL;
+    if (thread_id < 0) el = config.el;
+    else {
+        benchmarkThread *thread = config.threads[thread_id];
+        el = thread->el;
+    }
+    if (config.idlemode == 0)
+        aeCreateFileEvent(el,c->context->fd,AE_WRITABLE,writeHandler,c);
+    listAddNodeTail(config.clients,c);
+    atomicIncr(config.liveclients, 1);
+    atomicGet(config.slots_last_update, c->slots_last_update);
+    return c;
+}
+
+static void createMissingClients(client c) {
+    int n = 0;
+    while(config.liveclients < config.numclients) {
+        int thread_id = -1;
+        if (config.num_threads)
+            thread_id = config.liveclients % config.num_threads;
+        createClient(NULL,0,c,thread_id);
+
+        /* Listen backlog is quite limited on most systems */
+        if (++n > 64) {
+            usleep(50000);
+            n = 0;
+        }
+    }
+}
+
+static void showLatencyReport(void) {
+
+    const float reqpersec = (float)config.requests_finished/((float)config.totlatency/1000.0f);
+    const float p0 = ((float) hdr_min(config.latency_histogram))/1000.0f;
+    const float p50 = hdr_value_at_percentile(config.latency_histogram, 50.0 )/1000.0f;
+    const float p95 = hdr_value_at_percentile(config.latency_histogram, 95.0 )/1000.0f;
+    const float p99 = hdr_value_at_percentile(config.latency_histogram, 99.0 )/1000.0f;
+    const float p100 = ((float) hdr_max(config.latency_histogram))/1000.0f;
+    const float avg = hdr_mean(config.latency_histogram)/1000.0f;
+
+    if (!config.quiet && !config.csv) {
+        printf("%*s\r", config.last_printed_bytes, " "); // ensure there is a clean line
+        printf("====== %s ======\n", config.title);
+        printf("  %d requests completed in %.2f seconds\n", config.requests_finished,
+            (float)config.totlatency/1000);
+        printf("  %d parallel clients\n", config.numclients);
+        printf("  %d bytes payload\n", config.datasize);
+        printf("  keep alive: %d\n", config.keepalive);
+        if (config.cluster_mode) {
+            printf("  cluster mode: yes (%d masters)\n",
+                   config.cluster_node_count);
+            int m ;
+            for (m = 0; m < config.cluster_node_count; m++) {
+                clusterNode *node =  config.cluster_nodes[m];
+                redisConfig *cfg = node->redis_config;
+                if (cfg == NULL) continue;
+                printf("  node [%d] configuration:\n",m );
+                printf("    save: %s\n",
+                    sdslen(cfg->save) ? cfg->save : "NONE");
+                printf("    appendonly: %s\n", cfg->appendonly);
+            }
+        } else {
+            if (config.redis_config) {
+                printf("  host configuration \"save\": %s\n",
+                       config.redis_config->save);
+                printf("  host configuration \"appendonly\": %s\n",
+                       config.redis_config->appendonly);
+            }
+        }
+        printf("  multi-thread: %s\n", (config.num_threads ? "yes" : "no"));
+        if (config.num_threads)
+            printf("  threads: %d\n", config.num_threads);
+
+        printf("\n");
+        printf("Latency by percentile distribution:\n");
+        struct hdr_iter iter;
+        long long previous_cumulative_count = -1;
+        const long long total_count = config.latency_histogram->total_count;
+        hdr_iter_percentile_init(&iter, config.latency_histogram, 1);
+        struct hdr_iter_percentiles *percentiles = &iter.specifics.percentiles;
+        while (hdr_iter_next(&iter))
+        {
+            const double value = iter.highest_equivalent_value / 1000.0f;
+            const double percentile = percentiles->percentile;
+            const long long cumulative_count = iter.cumulative_count;
+            if( previous_cumulative_count != cumulative_count || cumulative_count == total_count ){
+                printf("%3.3f%% <= %.3f milliseconds (cumulative count %lld)\n", percentile, value, cumulative_count);
+            }
+            previous_cumulative_count = cumulative_count;
+        }
+        printf("\n");
+        printf("Cumulative distribution of latencies:\n");
+        previous_cumulative_count = -1;
+        hdr_iter_linear_init(&iter, config.latency_histogram, 100);
+        while (hdr_iter_next(&iter))
+        {
+            const double value = iter.highest_equivalent_value / 1000.0f;
+            const long long cumulative_count = iter.cumulative_count;
+            const double percentile = ((double)cumulative_count/(double)total_count)*100.0;
+            if( previous_cumulative_count != cumulative_count || cumulative_count == total_count ){
+                printf("%3.3f%% <= %.3f milliseconds (cumulative count %lld)\n", percentile, value, cumulative_count);
+            }
+            /* After the 2 milliseconds latency to have percentages split
+             * by decimals will just add a lot of noise to the output. */
+            if(iter.highest_equivalent_value > 2000){
+                hdr_iter_linear_set_value_units_per_bucket(&iter,1000);
+            }
+            previous_cumulative_count = cumulative_count;
+        }
+        printf("\n");
+        printf("Summary:\n");
+        printf("  throughput summary: %.2f requests per second\n", reqpersec);
+        printf("  latency summary (msec):\n");
+        printf("    %9s %9s %9s %9s %9s %9s\n", "avg", "min", "p50", "p95", "p99", "max");
+        printf("    %9.3f %9.3f %9.3f %9.3f %9.3f %9.3f\n", avg, p0, p50, p95, p99, p100);
+    } else if (config.csv) {
+        printf("\"%s\",\"%.2f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\"\n", config.title, reqpersec, avg, p0, p50, p95, p99, p100);
+    } else {
+        printf("%*s\r", config.last_printed_bytes, " "); // ensure there is a clean line
+        printf("%s: %.2f requests per second, p50=%.3f msec\n", config.title, reqpersec, p50);
+    }
+}
+
+static void initBenchmarkThreads() {
+    int i;
+    if (config.threads) freeBenchmarkThreads();
+    config.threads = zmalloc(config.num_threads * sizeof(benchmarkThread*));
+    for (i = 0; i < config.num_threads; i++) {
+        benchmarkThread *thread = createBenchmarkThread(i);
+        config.threads[i] = thread;
+    }
+}
+
+static void startBenchmarkThreads() {
+    int i;
+    for (i = 0; i < config.num_threads; i++) {
+        benchmarkThread *t = config.threads[i];
+        if (pthread_create(&(t->thread), NULL, execBenchmarkThread, t)){
+            fprintf(stderr, "FATAL: Failed to start thread %d.\n", i);
+            exit(1);
+        }
+    }
+    for (i = 0; i < config.num_threads; i++)
+        pthread_join(config.threads[i]->thread, NULL);
+}
+
+static void benchmark(char *title, char *cmd, int len) {
+    client c;
+
+    config.title = title;
+    config.requests_issued = 0;
+    config.requests_finished = 0;
+    config.previous_requests_finished = 0;
+    config.last_printed_bytes = 0;
+    hdr_init(
+        CONFIG_LATENCY_HISTOGRAM_MIN_VALUE,  // Minimum value
+        CONFIG_LATENCY_HISTOGRAM_MAX_VALUE,  // Maximum value
+        config.precision,  // Number of significant figures
+        &config.latency_histogram);  // Pointer to initialise
+    hdr_init(
+        CONFIG_LATENCY_HISTOGRAM_MIN_VALUE,  // Minimum value
+        CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE,  // Maximum value
+        config.precision,  // Number of significant figures
+        &config.current_sec_latency_histogram);  // Pointer to initialise
+
+    if (config.num_threads) initBenchmarkThreads();
+
+    int thread_id = config.num_threads > 0 ? 0 : -1;
+    c = createClient(cmd,len,NULL,thread_id);
+    createMissingClients(c);
+
+    config.start = mstime();
+    if (!config.num_threads) aeMain(config.el);
+    else startBenchmarkThreads();
+    config.totlatency = mstime()-config.start;
+
+    showLatencyReport();
+    freeAllClients();
+    if (config.threads) freeBenchmarkThreads();
+    if (config.current_sec_latency_histogram) hdr_close(config.current_sec_latency_histogram);
+    if (config.latency_histogram) hdr_close(config.latency_histogram);
+
+}
+
+/* Thread functions. */
+
+static benchmarkThread *createBenchmarkThread(int index) {
+    benchmarkThread *thread = zmalloc(sizeof(*thread));
+    if (thread == NULL) return NULL;
+    thread->index = index;
+    thread->el = aeCreateEventLoop(1024*10);
+    aeCreateTimeEvent(thread->el,1,showThroughput,NULL,NULL);
+    return thread;
+}
+
+static void freeBenchmarkThread(benchmarkThread *thread) {
+    if (thread->el) aeDeleteEventLoop(thread->el);
+    zfree(thread);
+}
+
+static void freeBenchmarkThreads() {
+    int i = 0;
+    for (; i < config.num_threads; i++) {
+        benchmarkThread *thread = config.threads[i];
+        if (thread) freeBenchmarkThread(thread);
+    }
+    zfree(config.threads);
+    config.threads = NULL;
+}
+
+static void *execBenchmarkThread(void *ptr) {
+    benchmarkThread *thread = (benchmarkThread *) ptr;
+    aeMain(thread->el);
+    return NULL;
+}
+
+/* Cluster helper functions. */
+
+static clusterNode *createClusterNode(char *ip, int port) {
+    clusterNode *node = zmalloc(sizeof(*node));
+    if (!node) return NULL;
+    node->ip = ip;
+    node->port = port;
+    node->name = NULL;
+    node->flags = 0;
+    node->replicate = NULL;
+    node->replicas_count = 0;
+    node->slots = zmalloc(CLUSTER_SLOTS * sizeof(int));
+    node->slots_count = 0;
+    node->current_slot_index = 0;
+    node->updated_slots = NULL;
+    node->updated_slots_count = 0;
+    node->migrating = NULL;
+    node->importing = NULL;
+    node->migrating_count = 0;
+    node->importing_count = 0;
+    node->redis_config = NULL;
+    return node;
+}
+
+static void freeClusterNode(clusterNode *node) {
+    int i;
+    if (node->name) sdsfree(node->name);
+    if (node->replicate) sdsfree(node->replicate);
+    if (node->migrating != NULL) {
+        for (i = 0; i < node->migrating_count; i++) sdsfree(node->migrating[i]);
+        zfree(node->migrating);
+    }
+    if (node->importing != NULL) {
+        for (i = 0; i < node->importing_count; i++) sdsfree(node->importing[i]);
+        zfree(node->importing);
+    }
+    /* If the node is not the reference node, that uses the address from
+     * config.hostip and config.hostport, then the node ip has been
+     * allocated by fetchClusterConfiguration, so it must be freed. */
+    if (node->ip && strcmp(node->ip, config.hostip) != 0) sdsfree(node->ip);
+    if (node->redis_config != NULL) freeRedisConfig(node->redis_config);
+    zfree(node->slots);
+    zfree(node);
+}
+
+static void freeClusterNodes() {
+    int i = 0;
+    for (; i < config.cluster_node_count; i++) {
+        clusterNode *n = config.cluster_nodes[i];
+        if (n) freeClusterNode(n);
+    }
+    zfree(config.cluster_nodes);
+    config.cluster_nodes = NULL;
+}
+
+static clusterNode **addClusterNode(clusterNode *node) {
+    int count = config.cluster_node_count + 1;
+    config.cluster_nodes = zrealloc(config.cluster_nodes,
+                                    count * sizeof(*node));
+    if (!config.cluster_nodes) return NULL;
+    config.cluster_nodes[config.cluster_node_count++] = node;
+    return config.cluster_nodes;
+}
+
+static int fetchClusterConfiguration() {
+    int success = 1;
+    redisContext *ctx = NULL;
+    redisReply *reply =  NULL;
+    ctx = getRedisContext(config.hostip, config.hostport, config.hostsocket);
+    if (ctx == NULL) {
+        exit(1);
+    }
+    clusterNode *firstNode = createClusterNode((char *) config.hostip,
+                                               config.hostport);
+    if (!firstNode) {success = 0; goto cleanup;}
+    reply = redisCommand(ctx, "CLUSTER NODES");
+    success = (reply != NULL);
+    if (!success) goto cleanup;
+    success = (reply->type != REDIS_REPLY_ERROR);
+    if (!success) {
+        if (config.hostsocket == NULL) {
+            fprintf(stderr, "Cluster node %s:%d replied with error:\n%s\n",
+                    config.hostip, config.hostport, reply->str);
+        } else {
+            fprintf(stderr, "Cluster node %s replied with error:\n%s\n",
+                    config.hostsocket, reply->str);
+        }
+        goto cleanup;
+    }
+    char *lines = reply->str, *p, *line;
+    while ((p = strstr(lines, "\n")) != NULL) {
+        *p = '\0';
+        line = lines;
+        lines = p + 1;
+        char *name = NULL, *addr = NULL, *flags = NULL, *master_id = NULL;
+        int i = 0;
+        while ((p = strchr(line, ' ')) != NULL) {
+            *p = '\0';
+            char *token = line;
+            line = p + 1;
+            switch(i++){
+            case 0: name = token; break;
+            case 1: addr = token; break;
+            case 2: flags = token; break;
+            case 3: master_id = token; break;
+            }
+            if (i == 8) break; // Slots
+        }
+        if (!flags) {
+            fprintf(stderr, "Invalid CLUSTER NODES reply: missing flags.\n");
+            success = 0;
+            goto cleanup;
+        }
+        int myself = (strstr(flags, "myself") != NULL);
+        int is_replica = (strstr(flags, "slave") != NULL ||
+                         (master_id != NULL && master_id[0] != '-'));
+        if (is_replica) continue;
+        if (addr == NULL) {
+            fprintf(stderr, "Invalid CLUSTER NODES reply: missing addr.\n");
+            success = 0;
+            goto cleanup;
+        }
+        clusterNode *node = NULL;
+        char *ip = NULL;
+        int port = 0;
+        char *paddr = strchr(addr, ':');
+        if (paddr != NULL) {
+            *paddr = '\0';
+            ip = addr;
+            addr = paddr + 1;
+            /* If internal bus is specified, then just drop it. */
+            if ((paddr = strchr(addr, '@')) != NULL) *paddr = '\0';
+            port = atoi(addr);
+        }
+        if (myself) {
+            node = firstNode;
+            if (ip != NULL && strcmp(node->ip, ip) != 0) {
+                node->ip = sdsnew(ip);
+                node->port = port;
+            }
+        } else {
+            node = createClusterNode(sdsnew(ip), port);
+        }
+        if (node == NULL) {
+            success = 0;
+            goto cleanup;
+        }
+        if (name != NULL) node->name = sdsnew(name);
+        if (i == 8) {
+            int remaining = strlen(line);
+            while (remaining > 0) {
+                p = strchr(line, ' ');
+                if (p == NULL) p = line + remaining;
+                remaining -= (p - line);
+
+                char *slotsdef = line;
+                *p = '\0';
+                if (remaining) {
+                    line = p + 1;
+                    remaining--;
+                } else line = p;
+                char *dash = NULL;
+                if (slotsdef[0] == '[') {
+                    slotsdef++;
+                    if ((p = strstr(slotsdef, "->-"))) { // Migrating
+                        *p = '\0';
+                        p += 3;
+                        char *closing_bracket = strchr(p, ']');
+                        if (closing_bracket) *closing_bracket = '\0';
+                        sds slot = sdsnew(slotsdef);
+                        sds dst = sdsnew(p);
+                        node->migrating_count += 2;
+                        node->migrating =
+                            zrealloc(node->migrating,
+                                (node->migrating_count * sizeof(sds)));
+                        node->migrating[node->migrating_count - 2] =
+                            slot;
+                        node->migrating[node->migrating_count - 1] =
+                            dst;
+                    }  else if ((p = strstr(slotsdef, "-<-"))) {//Importing
+                        *p = '\0';
+                        p += 3;
+                        char *closing_bracket = strchr(p, ']');
+                        if (closing_bracket) *closing_bracket = '\0';
+                        sds slot = sdsnew(slotsdef);
+                        sds src = sdsnew(p);
+                        node->importing_count += 2;
+                        node->importing = zrealloc(node->importing,
+                            (node->importing_count * sizeof(sds)));
+                        node->importing[node->importing_count - 2] =
+                            slot;
+                        node->importing[node->importing_count - 1] =
+                            src;
+                    }
+                } else if ((dash = strchr(slotsdef, '-')) != NULL) {
+                    p = dash;
+                    int start, stop;
+                    *p = '\0';
+                    start = atoi(slotsdef);
+                    stop = atoi(p + 1);
+                    while (start <= stop) {
+                        int slot = start++;
+                        node->slots[node->slots_count++] = slot;
+                    }
+                } else if (p > slotsdef) {
+                    int slot = atoi(slotsdef);
+                    node->slots[node->slots_count++] = slot;
+                }
+            }
+        }
+        if (node->slots_count == 0) {
+            printf("WARNING: master node %s:%d has no slots, skipping...\n",
+                   node->ip, node->port);
+            continue;
+        }
+        if (!addClusterNode(node)) {
+            success = 0;
+            goto cleanup;
+        }
+    }
+cleanup:
+    if (ctx) redisFree(ctx);
+    if (!success) {
+        if (config.cluster_nodes) freeClusterNodes();
+    }
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+/* Request the current cluster slots configuration by calling CLUSTER SLOTS
+ * and atomically update the slots after a successful reply. */
+static int fetchClusterSlotsConfiguration(client c) {
+    UNUSED(c);
+    int success = 1, is_fetching_slots = 0, last_update = 0;
+    size_t i;
+    atomicGet(config.slots_last_update, last_update);
+    if (c->slots_last_update < last_update) {
+        c->slots_last_update = last_update;
+        return -1;
+    }
+    redisReply *reply = NULL;
+    atomicGetIncr(config.is_fetching_slots, is_fetching_slots, 1);
+    if (is_fetching_slots) return -1; //TODO: use other codes || errno ?
+    atomicSet(config.is_fetching_slots, 1);
+    printf("WARNING: Cluster slots configuration changed, fetching new one...\n");
+    const char *errmsg = "Failed to update cluster slots configuration";
+    static dictType dtype = {
+        dictSdsHash,               /* hash function */
+        NULL,                      /* key dup */
+        NULL,                      /* val dup */
+        dictSdsKeyCompare,         /* key compare */
+        NULL,                      /* key destructor */
+        NULL,                      /* val destructor */
+        NULL                       /* allow to expand */
+    };
+    /* printf("[%d] fetchClusterSlotsConfiguration\n", c->thread_id); */
+    dict *masters = dictCreate(&dtype, NULL);
+    redisContext *ctx = NULL;
+    for (i = 0; i < (size_t) config.cluster_node_count; i++) {
+        clusterNode *node = config.cluster_nodes[i];
+        assert(node->ip != NULL);
+        assert(node->name != NULL);
+        assert(node->port);
+        /* Use first node as entry point to connect to. */
+        if (ctx == NULL) {
+            ctx = getRedisContext(node->ip, node->port, NULL);
+            if (!ctx) {
+                success = 0;
+                goto cleanup;
+            }
+        }
+        if (node->updated_slots != NULL)
+            zfree(node->updated_slots);
+        node->updated_slots = NULL;
+        node->updated_slots_count = 0;
+        dictReplace(masters, node->name, node) ;
+    }
+    reply = redisCommand(ctx, "CLUSTER SLOTS");
+    if (reply == NULL || reply->type == REDIS_REPLY_ERROR) {
+        success = 0;
+        if (reply)
+            fprintf(stderr,"%s\nCLUSTER SLOTS ERROR: %s\n",errmsg,reply->str);
+        goto cleanup;
+    }
+    assert(reply->type == REDIS_REPLY_ARRAY);
+    for (i = 0; i < reply->elements; i++) {
+        redisReply *r = reply->element[i];
+        assert(r->type == REDIS_REPLY_ARRAY);
+        assert(r->elements >= 3);
+        int from, to, slot;
+        from = r->element[0]->integer;
+        to = r->element[1]->integer;
+        redisReply *nr =  r->element[2];
+        assert(nr->type == REDIS_REPLY_ARRAY && nr->elements >= 3);
+        assert(nr->element[2]->str != NULL);
+        sds name =  sdsnew(nr->element[2]->str);
+        dictEntry *entry = dictFind(masters, name);
+        if (entry == NULL) {
+            success = 0;
+            fprintf(stderr, "%s: could not find node with ID %s in current "
+                            "configuration.\n", errmsg, name);
+            if (name) sdsfree(name);
+            goto cleanup;
+        }
+        sdsfree(name);
+        clusterNode *node = dictGetVal(entry);
+        if (node->updated_slots == NULL)
+            node->updated_slots = zcalloc(CLUSTER_SLOTS * sizeof(int));
+        for (slot = from; slot <= to; slot++)
+            node->updated_slots[node->updated_slots_count++] = slot;
+    }
+    updateClusterSlotsConfiguration();
+cleanup:
+    freeReplyObject(reply);
+    redisFree(ctx);
+    dictRelease(masters);
+    atomicSet(config.is_fetching_slots, 0);
+    return success;
+}
+
+/* Atomically update the new slots configuration. */
+static void updateClusterSlotsConfiguration() {
+    pthread_mutex_lock(&config.is_updating_slots_mutex);
+    atomicSet(config.is_updating_slots, 1);
+    int i;
+    for (i = 0; i < config.cluster_node_count; i++) {
+        clusterNode *node = config.cluster_nodes[i];
+        if (node->updated_slots != NULL) {
+            int *oldslots = node->slots;
+            node->slots = node->updated_slots;
+            node->slots_count = node->updated_slots_count;
+            node->current_slot_index = 0;
+            node->updated_slots = NULL;
+            node->updated_slots_count = 0;
+            zfree(oldslots);
+        }
+    }
+    atomicSet(config.is_updating_slots, 0);
+    atomicIncr(config.slots_last_update, 1);
+    pthread_mutex_unlock(&config.is_updating_slots_mutex);
+}
+
+/* Generate random data for redis benchmark. See #7196. */
+static void genBenchmarkRandomData(char *data, int count) {
+    static uint32_t state = 1234;
+    int i = 0;
+
+    while (count--) {
+        state = (state*1103515245+12345);
+        data[i++] = '0'+((state>>16)&63);
+    }
+}
+
+/* Returns number of consumed options. */
+int parseOptions(int argc, const char **argv) {
+    int i;
+    int lastarg;
+    int exit_status = 1;
+
+    for (i = 1; i < argc; i++) {
+        lastarg = (i == (argc-1));
+
+        if (!strcmp(argv[i],"-c")) {
+            if (lastarg) goto invalid;
+            config.numclients = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"-v") || !strcmp(argv[i], "--version")) {
+            sds version = benchmarkVersion();
+            printf("redis-benchmark %s\n", version);
+            sdsfree(version);
+            exit(0);
+        } else if (!strcmp(argv[i],"-n")) {
+            if (lastarg) goto invalid;
+            config.requests = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"-k")) {
+            if (lastarg) goto invalid;
+            config.keepalive = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"-h")) {
+            if (lastarg) goto invalid;
+            config.hostip = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"-p")) {
+            if (lastarg) goto invalid;
+            config.hostport = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"-s")) {
+            if (lastarg) goto invalid;
+            config.hostsocket = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"-a") ) {
+            if (lastarg) goto invalid;
+            config.auth = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--user")) {
+            if (lastarg) goto invalid;
+            config.user = argv[++i];
+        } else if (!strcmp(argv[i],"-d")) {
+            if (lastarg) goto invalid;
+            config.datasize = atoi(argv[++i]);
+            if (config.datasize < 1) config.datasize=1;
+            if (config.datasize > 1024*1024*1024) config.datasize = 1024*1024*1024;
+        } else if (!strcmp(argv[i],"-P")) {
+            if (lastarg) goto invalid;
+            config.pipeline = atoi(argv[++i]);
+            if (config.pipeline <= 0) config.pipeline=1;
+        } else if (!strcmp(argv[i],"-r")) {
+            if (lastarg) goto invalid;
+            const char *next = argv[++i], *p = next;
+            if (*p == '-') {
+                p++;
+                if (*p < '0' || *p > '9') goto invalid;
+            }
+            config.randomkeys = 1;
+            config.randomkeys_keyspacelen = atoi(next);
+            if (config.randomkeys_keyspacelen < 0)
+                config.randomkeys_keyspacelen = 0;
+        } else if (!strcmp(argv[i],"-q")) {
+            config.quiet = 1;
+        } else if (!strcmp(argv[i],"--csv")) {
+            config.csv = 1;
+        } else if (!strcmp(argv[i],"-l")) {
+            config.loop = 1;
+        } else if (!strcmp(argv[i],"-I")) {
+            config.idlemode = 1;
+        } else if (!strcmp(argv[i],"-e")) {
+            printf("WARNING: -e option has been deprecated. "
+                   "We now immediatly exit on error to avoid false results.\n");
+        } else if (!strcmp(argv[i],"-t")) {
+            if (lastarg) goto invalid;
+            /* We get the list of tests to run as a string in the form
+             * get,set,lrange,...,test_N. Then we add a comma before and
+             * after the string in order to make sure that searching
+             * for ",testname," will always get a match if the test is
+             * enabled. */
+            config.tests = sdsnew(",");
+            config.tests = sdscat(config.tests,(char*)argv[++i]);
+            config.tests = sdscat(config.tests,",");
+            sdstolower(config.tests);
+        } else if (!strcmp(argv[i],"--dbnum")) {
+            if (lastarg) goto invalid;
+            config.dbnum = atoi(argv[++i]);
+            config.dbnumstr = sdsfromlonglong(config.dbnum);
+        } else if (!strcmp(argv[i],"--precision")) {
+            if (lastarg) goto invalid;
+            config.precision = atoi(argv[++i]);
+            if (config.precision < 0) config.precision = DEFAULT_LATENCY_PRECISION;
+            if (config.precision > MAX_LATENCY_PRECISION) config.precision = MAX_LATENCY_PRECISION;
+        } else if (!strcmp(argv[i],"--threads")) {
+             if (lastarg) goto invalid;
+             config.num_threads = atoi(argv[++i]);
+             if (config.num_threads > MAX_THREADS) {
+                printf("WARNING: too many threads, limiting threads to %d.\n",
+                       MAX_THREADS);
+                config.num_threads = MAX_THREADS;
+             } else if (config.num_threads < 0) config.num_threads = 0;
+        } else if (!strcmp(argv[i],"--cluster")) {
+            config.cluster_mode = 1;
+        } else if (!strcmp(argv[i],"--enable-tracking")) {
+            config.enable_tracking = 1;
+        } else if (!strcmp(argv[i],"--help")) {
+            exit_status = 0;
+            goto usage;
+        #ifdef USE_OPENSSL
+        } else if (!strcmp(argv[i],"--tls")) {
+            config.tls = 1;
+        } else if (!strcmp(argv[i],"--sni")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.sni = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--cacertdir")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.cacertdir = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--cacert")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.cacert = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--insecure")) {
+            config.sslconfig.skip_cert_verify = 1;
+        } else if (!strcmp(argv[i],"--cert")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.cert = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--key")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.key = strdup(argv[++i]);
+        } else if (!strcmp(argv[i],"--tls-ciphers")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.ciphers = strdup(argv[++i]);
+        #ifdef TLS1_3_VERSION
+        } else if (!strcmp(argv[i],"--tls-ciphersuites")) {
+            if (lastarg) goto invalid;
+            config.sslconfig.ciphersuites = strdup(argv[++i]);
+        #endif
+        #endif
+        } else {
+            /* Assume the user meant to provide an option when the arg starts
+             * with a dash. We're done otherwise and should use the remainder
+             * as the command and arguments for running the benchmark. */
+            if (argv[i][0] == '-') goto invalid;
+            return i;
+        }
+    }
+
+    return i;
+
+invalid:
+    printf("Invalid option \"%s\" or option argument missing\n\n",argv[i]);
+
+usage:
+    printf(
+"Usage: redis-benchmark [-h <host>] [-p <port>] [-c <clients>] [-n <requests>] [-k <boolean>]\n\n"
+" -h <hostname>      Server hostname (default 127.0.0.1)\n"
+" -p <port>          Server port (default 6379)\n"
+" -s <socket>        Server socket (overrides host and port)\n"
+" -a <password>      Password for Redis Auth\n"
+" --user <username>  Used to send ACL style 'AUTH username pass'. Needs -a.\n"
+" -c <clients>       Number of parallel connections (default 50)\n"
+" -n <requests>      Total number of requests (default 100000)\n"
+" -d <size>          Data size of SET/GET value in bytes (default 3)\n"
+" --dbnum <db>       SELECT the specified db number (default 0)\n"
+" --threads <num>    Enable multi-thread mode.\n"
+" --cluster          Enable cluster mode.\n"
+" --enable-tracking  Send CLIENT TRACKING on before starting benchmark.\n"
+" -k <boolean>       1=keep alive 0=reconnect (default 1)\n"
+" -r <keyspacelen>   Use random keys for SET/GET/INCR, random values for SADD,\n"
+"                    random members and scores for ZADD.\n"
+"  Using this option the benchmark will expand the string __rand_int__\n"
+"  inside an argument with a 12 digits number in the specified range\n"
+"  from 0 to keyspacelen-1. The substitution changes every time a command\n"
+"  is executed. Default tests use this to hit random keys in the\n"
+"  specified range.\n"
+" -P <numreq>        Pipeline <numreq> requests. Default 1 (no pipeline).\n"
+" -q                 Quiet. Just show query/sec values\n"
+" --precision        Number of decimal places to display in latency output (default 0)\n"
+" --csv              Output in CSV format\n"
+" -l                 Loop. Run the tests forever\n"
+" -t <tests>         Only run the comma separated list of tests. The test\n"
+"                    names are the same as the ones produced as output.\n"
+" -I                 Idle mode. Just open N idle connections and wait.\n"
+#ifdef USE_OPENSSL
+" --tls              Establish a secure TLS connection.\n"
+" --sni <host>       Server name indication for TLS.\n"
+" --cacert <file>    CA Certificate file to verify with.\n"
+" --cacertdir <dir>  Directory where trusted CA certificates are stored.\n"
+"                    If neither cacert nor cacertdir are specified, the default\n"
+"                    system-wide trusted root certs configuration will apply.\n"
+" --insecure         Allow insecure TLS connection by skipping cert validation.\n"
+" --cert <file>      Client certificate to authenticate with.\n"
+" --key <file>       Private key file to authenticate with.\n"
+" --tls-ciphers <list> Sets the list of prefered ciphers (TLSv1.2 and below)\n"
+"                    in order of preference from highest to lowest separated by colon (\":\").\n"
+"                    See the ciphers(1ssl) manpage for more information about the syntax of this string.\n"
+#ifdef TLS1_3_VERSION
+" --tls-ciphersuites <list> Sets the list of prefered ciphersuites (TLSv1.3)\n"
+"                    in order of preference from highest to lowest separated by colon (\":\").\n"
+"                    See the ciphers(1ssl) manpage for more information about the syntax of this string,\n"
+"                    and specifically for TLSv1.3 ciphersuites.\n"
+#endif
+#endif
+" --help             Output this help and exit.\n"
+" --version          Output version and exit.\n\n"
+"Examples:\n\n"
+" Run the benchmark with the default configuration against 127.0.0.1:6379:\n"
+"   $ redis-benchmark\n\n"
+" Use 20 parallel clients, for a total of 100k requests, against 192.168.1.1:\n"
+"   $ redis-benchmark -h 192.168.1.1 -p 6379 -n 100000 -c 20\n\n"
+" Fill 127.0.0.1:6379 with about 1 million keys only using the SET test:\n"
+"   $ redis-benchmark -t set -n 1000000 -r 100000000\n\n"
+" Benchmark 127.0.0.1:6379 for a few commands producing CSV output:\n"
+"   $ redis-benchmark -t ping,set,get -n 100000 --csv\n\n"
+" Benchmark a specific command line:\n"
+"   $ redis-benchmark -r 10000 -n 10000 eval 'return redis.call(\"ping\")' 0\n\n"
+" Fill a list with 10000 random elements:\n"
+"   $ redis-benchmark -r 10000 -n 10000 lpush mylist __rand_int__\n\n"
+" On user specified command lines __rand_int__ is replaced with a random integer\n"
+" with a range of values selected by the -r option.\n"
+    );
+    exit(exit_status);
+}
+
+int showThroughput(struct aeEventLoop *eventLoop, long long id, void *clientData) {
+    UNUSED(eventLoop);
+    UNUSED(id);
+    UNUSED(clientData);
+    int liveclients = 0;
+    int requests_finished = 0;
+    int previous_requests_finished = 0;
+    long long current_tick = mstime();
+    atomicGet(config.liveclients, liveclients);
+    atomicGet(config.requests_finished, requests_finished);
+    atomicGet(config.previous_requests_finished, previous_requests_finished);
+    
+    if (liveclients == 0 && requests_finished != config.requests) {
+        fprintf(stderr,"All clients disconnected... aborting.\n");
+        exit(1);
+    }
+    if (config.num_threads && requests_finished >= config.requests) {
+        aeStop(eventLoop);
+        return AE_NOMORE;
+    }
+    if (config.csv) return 250;
+    if (config.idlemode == 1) {
+        printf("clients: %d\r", config.liveclients);
+        fflush(stdout);
+	return 250;
+    }
+    const float dt = (float)(current_tick-config.start)/1000.0;
+    const float rps = (float)requests_finished/dt;
+    const float instantaneous_dt = (float)(current_tick-config.previous_tick)/1000.0;
+    const float instantaneous_rps = (float)(requests_finished-previous_requests_finished)/instantaneous_dt;
+    config.previous_tick = current_tick;
+    atomicSet(config.previous_requests_finished,requests_finished);
+    int printed_bytes = printf("%s: rps=%.1f (overall: %.1f) avg_msec=%.3f (overall: %.3f)\r", config.title, instantaneous_rps, rps, hdr_mean(config.current_sec_latency_histogram)/1000.0f, hdr_mean(config.latency_histogram)/1000.0f);
+    if (printed_bytes > config.last_printed_bytes){
+       config.last_printed_bytes = printed_bytes;
+    }
+    hdr_reset(config.current_sec_latency_histogram);
+    fflush(stdout);
+    return 250; /* every 250ms */
+}
+
+/* Return true if the named test was selected using the -t command line
+ * switch, or if all the tests are selected (no -t passed by user). */
+int test_is_selected(char *name) {
+    char buf[256];
+    int l = strlen(name);
+
+    if (config.tests == NULL) return 1;
+    buf[0] = ',';
+    memcpy(buf+1,name,l);
+    buf[l+1] = ',';
+    buf[l+2] = '\0';
+    return strstr(config.tests,buf) != NULL;
+}
+
+int main(int argc, const char **argv) {
+    int i;
+    char *data, *cmd, *tag;
+    int len;
+
+    client c;
+
+    srandom(time(NULL) ^ getpid());
+    init_genrand64(ustime() ^ getpid());
+    signal(SIGHUP, SIG_IGN);
+    signal(SIGPIPE, SIG_IGN);
+
+    memset(&config.sslconfig, 0, sizeof(config.sslconfig));
+    config.numclients = 50;
+    config.requests = 100000;
+    config.liveclients = 0;
+    config.el = aeCreateEventLoop(1024*10);
+    aeCreateTimeEvent(config.el,1,showThroughput,NULL,NULL);
+    config.keepalive = 1;
+    config.datasize = 3;
+    config.pipeline = 1;
+    config.randomkeys = 0;
+    config.randomkeys_keyspacelen = 0;
+    config.quiet = 0;
+    config.csv = 0;
+    config.loop = 0;
+    config.idlemode = 0;
+    config.clients = listCreate();
+    config.hostip = "127.0.0.1";
+    config.hostport = 6379;
+    config.hostsocket = NULL;
+    config.tests = NULL;
+    config.dbnum = 0;
+    config.auth = NULL;
+    config.precision = DEFAULT_LATENCY_PRECISION;
+    config.num_threads = 0;
+    config.threads = NULL;
+    config.cluster_mode = 0;
+    config.cluster_node_count = 0;
+    config.cluster_nodes = NULL;
+    config.redis_config = NULL;
+    config.is_fetching_slots = 0;
+    config.is_updating_slots = 0;
+    config.slots_last_update = 0;
+    config.enable_tracking = 0;
+
+    i = parseOptions(argc,argv);
+    argc -= i;
+    argv += i;
+
+    tag = "";
+
+#ifdef USE_OPENSSL
+    if (config.tls) {
+        cliSecureInit();
+    }
+#endif
+
+    if (config.cluster_mode) {
+        // We only include the slot placeholder {tag} if cluster mode is enabled
+        tag = ":{tag}";
+
+        /* Fetch cluster configuration. */
+        if (!fetchClusterConfiguration() || !config.cluster_nodes) {
+            if (!config.hostsocket) {
+                fprintf(stderr, "Failed to fetch cluster configuration from "
+                                "%s:%d\n", config.hostip, config.hostport);
+            } else {
+                fprintf(stderr, "Failed to fetch cluster configuration from "
+                                "%s\n", config.hostsocket);
+            }
+            exit(1);
+        }
+        if (config.cluster_node_count <= 1) {
+            fprintf(stderr, "Invalid cluster: %d node(s).\n",
+                    config.cluster_node_count);
+            exit(1);
+        }
+        printf("Cluster has %d master nodes:\n\n", config.cluster_node_count);
+        int i = 0;
+        for (; i < config.cluster_node_count; i++) {
+            clusterNode *node = config.cluster_nodes[i];
+            if (!node) {
+                fprintf(stderr, "Invalid cluster node #%d\n", i);
+                exit(1);
+            }
+            printf("Master %d: ", i);
+            if (node->name) printf("%s ", node->name);
+            printf("%s:%d\n", node->ip, node->port);
+            node->redis_config = getRedisConfig(node->ip, node->port, NULL);
+            if (node->redis_config == NULL) {
+                fprintf(stderr, "WARN: could not fetch node CONFIG %s:%d\n",
+                        node->ip, node->port);
+            }
+        }
+        printf("\n");
+        /* Automatically set thread number to node count if not specified
+         * by the user. */
+        if (config.num_threads == 0)
+            config.num_threads = config.cluster_node_count;
+    } else {
+        config.redis_config =
+            getRedisConfig(config.hostip, config.hostport, config.hostsocket);
+        if (config.redis_config == NULL) {
+            fprintf(stderr, "WARN: could not fetch server CONFIG\n");
+        }
+    }
+    if (config.num_threads > 0) {
+        pthread_mutex_init(&(config.liveclients_mutex), NULL);
+        pthread_mutex_init(&(config.is_updating_slots_mutex), NULL);
+    }
+
+    if (config.keepalive == 0) {
+        printf("WARNING: keepalive disabled, you probably need 'echo 1 > /proc/sys/net/ipv4/tcp_tw_reuse' for Linux and 'sudo sysctl -w net.inet.tcp.msl=1000' for Mac OS X in order to use a lot of clients/requests\n");
+    }
+
+    if (config.idlemode) {
+        printf("Creating %d idle connections and waiting forever (Ctrl+C when done)\n", config.numclients);
+        int thread_id = -1, use_threads = (config.num_threads > 0);
+        if (use_threads) {
+            thread_id = 0;
+            initBenchmarkThreads();
+        }
+        c = createClient("",0,NULL,thread_id); /* will never receive a reply */
+        createMissingClients(c);
+        if (use_threads) startBenchmarkThreads();
+        else aeMain(config.el);
+        /* and will wait for every */
+    }
+    if(config.csv){
+        printf("\"test\",\"rps\",\"avg_latency_ms\",\"min_latency_ms\",\"p50_latency_ms\",\"p95_latency_ms\",\"p99_latency_ms\",\"max_latency_ms\"\n");
+    }
+    /* Run benchmark with command in the remainder of the arguments. */
+    if (argc) {
+        sds title = sdsnew(argv[0]);
+        for (i = 1; i < argc; i++) {
+            title = sdscatlen(title, " ", 1);
+            title = sdscatlen(title, (char*)argv[i], strlen(argv[i]));
+        }
+
+        do {
+            len = redisFormatCommandArgv(&cmd,argc,argv,NULL);
+            // adjust the datasize to the parsed command
+            config.datasize = len;
+            benchmark(title,cmd,len);
+            free(cmd);
+        } while(config.loop);
+
+        if (config.redis_config != NULL) freeRedisConfig(config.redis_config);
+        return 0;
+    }
+
+    /* Run default benchmark suite. */
+    data = zmalloc(config.datasize+1);
+    do {
+        genBenchmarkRandomData(data, config.datasize);
+        data[config.datasize] = '\0';
+
+        if (test_is_selected("ping_inline") || test_is_selected("ping"))
+            benchmark("PING_INLINE","PING\r\n",6);
+
+        if (test_is_selected("ping_mbulk") || test_is_selected("ping")) {
+            len = redisFormatCommand(&cmd,"PING");
+            benchmark("PING_MBULK",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("set")) {
+            len = redisFormatCommand(&cmd,"SET key%s:__rand_int__ %s",tag,data);
+            benchmark("SET",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("get")) {
+            len = redisFormatCommand(&cmd,"GET key%s:__rand_int__",tag);
+            benchmark("GET",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("incr")) {
+            len = redisFormatCommand(&cmd,"INCR counter%s:__rand_int__",tag);
+            benchmark("INCR",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lpush")) {
+            len = redisFormatCommand(&cmd,"LPUSH mylist%s %s",tag,data);
+            benchmark("LPUSH",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("rpush")) {
+            len = redisFormatCommand(&cmd,"RPUSH mylist%s %s",tag,data);
+            benchmark("RPUSH",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lpop")) {
+            len = redisFormatCommand(&cmd,"LPOP mylist%s",tag);
+            benchmark("LPOP",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("rpop")) {
+            len = redisFormatCommand(&cmd,"RPOP mylist%s",tag);
+            benchmark("RPOP",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("sadd")) {
+            len = redisFormatCommand(&cmd,
+                "SADD myset%s element:__rand_int__",tag);
+            benchmark("SADD",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("hset")) {
+            len = redisFormatCommand(&cmd,
+                "HSET myhash%s element:__rand_int__ %s",tag,data);
+            benchmark("HSET",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("spop")) {
+            len = redisFormatCommand(&cmd,"SPOP myset%s",tag);
+            benchmark("SPOP",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("zadd")) {
+            char *score = "0";
+            if (config.randomkeys) score = "__rand_int__";
+            len = redisFormatCommand(&cmd,
+                "ZADD myzset%s %s element:__rand_int__",tag,score);
+            benchmark("ZADD",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("zpopmin")) {
+            len = redisFormatCommand(&cmd,"ZPOPMIN myzset%s",tag);
+            benchmark("ZPOPMIN",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lrange") ||
+            test_is_selected("lrange_100") ||
+            test_is_selected("lrange_300") ||
+            test_is_selected("lrange_500") ||
+            test_is_selected("lrange_600"))
+        {
+            len = redisFormatCommand(&cmd,"LPUSH mylist%s %s",tag,data);
+            benchmark("LPUSH (needed to benchmark LRANGE)",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lrange") || test_is_selected("lrange_100")) {
+            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 99",tag);
+            benchmark("LRANGE_100 (first 100 elements)",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lrange") || test_is_selected("lrange_300")) {
+            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 299",tag);
+            benchmark("LRANGE_300 (first 300 elements)",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lrange") || test_is_selected("lrange_500")) {
+            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 499",tag);
+            benchmark("LRANGE_500 (first 500 elements)",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("lrange") || test_is_selected("lrange_600")) {
+            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 599",tag);
+            benchmark("LRANGE_600 (first 600 elements)",cmd,len);
+            free(cmd);
+        }
+
+        if (test_is_selected("mset")) {
+            const char *cmd_argv[21];
+            cmd_argv[0] = "MSET";
+            sds key_placeholder = sdscatprintf(sdsnew(""),"key%s:__rand_int__",tag);
+            for (i = 1; i < 21; i += 2) {
+                cmd_argv[i] = key_placeholder;
+                cmd_argv[i+1] = data;
+            }
+            len = redisFormatCommandArgv(&cmd,21,cmd_argv,NULL);
+            benchmark("MSET (10 keys)",cmd,len);
+            free(cmd);
+            sdsfree(key_placeholder);
+        }
+
+        if (!config.csv) printf("\n");
+    } while(config.loop);
+
+    zfree(data);
+    if (config.redis_config != NULL) freeRedisConfig(config.redis_config);
+
+    return 0;
+}
diff --git a/redis-stable/src/redis-check-aof.c b/redis-stable/src/redis-check-aof.c
new file mode 100644
index 00000000..1507e0a0
--- /dev/null
+++ b/redis-stable/src/redis-check-aof.c
@@ -0,0 +1,235 @@
+/*
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <sys/stat.h>
+
+#define ERROR(...) { \
+    char __buf[1024]; \
+    snprintf(__buf, sizeof(__buf), __VA_ARGS__); \
+    snprintf(error, sizeof(error), "0x%16llx: %s", (long long)epos, __buf); \
+}
+
+static char error[1044];
+static off_t epos;
+static long long line = 1;
+
+int consumeNewline(char *buf) {
+    if (strncmp(buf,"\r\n",2) != 0) {
+        ERROR("Expected \\r\\n, got: %02x%02x",buf[0],buf[1]);
+        return 0;
+    }
+    line += 1;
+    return 1;
+}
+
+int readLong(FILE *fp, char prefix, long *target) {
+    char buf[128], *eptr;
+    epos = ftello(fp);
+    if (fgets(buf,sizeof(buf),fp) == NULL) {
+        return 0;
+    }
+    if (buf[0] != prefix) {
+        ERROR("Expected prefix '%c', got: '%c'",prefix,buf[0]);
+        return 0;
+    }
+    *target = strtol(buf+1,&eptr,10);
+    return consumeNewline(eptr);
+}
+
+int readBytes(FILE *fp, char *target, long length) {
+    long real;
+    epos = ftello(fp);
+    real = fread(target,1,length,fp);
+    if (real != length) {
+        ERROR("Expected to read %ld bytes, got %ld bytes",length,real);
+        return 0;
+    }
+    return 1;
+}
+
+int readString(FILE *fp, char** target) {
+    long len;
+    *target = NULL;
+    if (!readLong(fp,'$',&len)) {
+        return 0;
+    }
+
+    /* Increase length to also consume \r\n */
+    len += 2;
+    *target = (char*)zmalloc(len);
+    if (!readBytes(fp,*target,len)) {
+        return 0;
+    }
+    if (!consumeNewline(*target+len-2)) {
+        return 0;
+    }
+    (*target)[len-2] = '\0';
+    return 1;
+}
+
+int readArgc(FILE *fp, long *target) {
+    return readLong(fp,'*',target);
+}
+
+off_t process(FILE *fp) {
+    long argc;
+    off_t pos = 0;
+    int i, multi = 0;
+    char *str;
+
+    while(1) {
+        if (!multi) pos = ftello(fp);
+        if (!readArgc(fp, &argc)) break;
+
+        for (i = 0; i < argc; i++) {
+            if (!readString(fp,&str)) break;
+            if (i == 0) {
+                if (strcasecmp(str, "multi") == 0) {
+                    if (multi++) {
+                        ERROR("Unexpected MULTI");
+                        break;
+                    }
+                } else if (strcasecmp(str, "exec") == 0) {
+                    if (--multi) {
+                        ERROR("Unexpected EXEC");
+                        break;
+                    }
+                }
+            }
+            zfree(str);
+        }
+
+        /* Stop if the loop did not finish */
+        if (i < argc) {
+            if (str) zfree(str);
+            break;
+        }
+    }
+
+    if (feof(fp) && multi && strlen(error) == 0) {
+        ERROR("Reached EOF before reading EXEC for MULTI");
+    }
+    if (strlen(error) > 0) {
+        printf("%s\n", error);
+    }
+    return pos;
+}
+
+int redis_check_aof_main(int argc, char **argv) {
+    char *filename;
+    int fix = 0;
+
+    if (argc < 2) {
+        printf("Usage: %s [--fix] <file.aof>\n", argv[0]);
+        exit(1);
+    } else if (argc == 2) {
+        filename = argv[1];
+    } else if (argc == 3) {
+        if (strcmp(argv[1],"--fix") != 0) {
+            printf("Invalid argument: %s\n", argv[1]);
+            exit(1);
+        }
+        filename = argv[2];
+        fix = 1;
+    } else {
+        printf("Invalid arguments\n");
+        exit(1);
+    }
+
+    FILE *fp = fopen(filename,"r+");
+    if (fp == NULL) {
+        printf("Cannot open file: %s\n", filename);
+        exit(1);
+    }
+
+    struct redis_stat sb;
+    if (redis_fstat(fileno(fp),&sb) == -1) {
+        printf("Cannot stat file: %s\n", filename);
+        exit(1);
+    }
+
+    off_t size = sb.st_size;
+    if (size == 0) {
+        printf("Empty file: %s\n", filename);
+        exit(1);
+    }
+
+    /* This AOF file may have an RDB preamble. Check this to start, and if this
+     * is the case, start processing the RDB part. */
+    if (size >= 8) {    /* There must be at least room for the RDB header. */
+        char sig[5];
+        int has_preamble = fread(sig,sizeof(sig),1,fp) == 1 &&
+                            memcmp(sig,"REDIS",sizeof(sig)) == 0;
+        rewind(fp);
+        if (has_preamble) {
+            printf("The AOF appears to start with an RDB preamble.\n"
+                   "Checking the RDB preamble to start:\n");
+            if (redis_check_rdb_main(argc,argv,fp) == C_ERR) {
+                printf("RDB preamble of AOF file is not sane, aborting.\n");
+                exit(1);
+            } else {
+                printf("RDB preamble is OK, proceeding with AOF tail...\n");
+            }
+        }
+    }
+
+    off_t pos = process(fp);
+    off_t diff = size-pos;
+    printf("AOF analyzed: size=%lld, ok_up_to=%lld, ok_up_to_line=%lld, diff=%lld\n",
+        (long long) size, (long long) pos, line, (long long) diff);
+    if (diff > 0) {
+        if (fix) {
+            char buf[2];
+            printf("This will shrink the AOF from %lld bytes, with %lld bytes, to %lld bytes\n",(long long)size,(long long)diff,(long long)pos);
+            printf("Continue? [y/N]: ");
+            if (fgets(buf,sizeof(buf),stdin) == NULL ||
+                strncasecmp(buf,"y",1) != 0) {
+                    printf("Aborting...\n");
+                    exit(1);
+            }
+            if (ftruncate(fileno(fp), pos) == -1) {
+                printf("Failed to truncate AOF\n");
+                exit(1);
+            } else {
+                printf("Successfully truncated AOF\n");
+            }
+        } else {
+            printf("AOF is not valid. "
+                   "Use the --fix option to try fixing it.\n");
+            exit(1);
+        }
+    } else {
+        printf("AOF is valid\n");
+    }
+
+    fclose(fp);
+    exit(0);
+}
diff --git a/redis-stable/src/redis-check-rdb.c b/redis-stable/src/redis-check-rdb.c
new file mode 100644
index 00000000..bb655248
--- /dev/null
+++ b/redis-stable/src/redis-check-rdb.c
@@ -0,0 +1,395 @@
+/*
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "mt19937-64.h"
+#include "server.h"
+#include "rdb.h"
+
+#include <stdarg.h>
+#include <sys/time.h>
+#include <unistd.h>
+
+void createSharedObjects(void);
+void rdbLoadProgressCallback(rio *r, const void *buf, size_t len);
+int rdbCheckMode = 0;
+
+struct {
+    rio *rio;
+    robj *key;                      /* Current key we are reading. */
+    int key_type;                   /* Current key type if != -1. */
+    unsigned long keys;             /* Number of keys processed. */
+    unsigned long expires;          /* Number of keys with an expire. */
+    unsigned long already_expired;  /* Number of keys already expired. */
+    int doing;                      /* The state while reading the RDB. */
+    int error_set;                  /* True if error is populated. */
+    char error[1024];
+} rdbstate;
+
+/* At every loading step try to remember what we were about to do, so that
+ * we can log this information when an error is encountered. */
+#define RDB_CHECK_DOING_START 0
+#define RDB_CHECK_DOING_READ_TYPE 1
+#define RDB_CHECK_DOING_READ_EXPIRE 2
+#define RDB_CHECK_DOING_READ_KEY 3
+#define RDB_CHECK_DOING_READ_OBJECT_VALUE 4
+#define RDB_CHECK_DOING_CHECK_SUM 5
+#define RDB_CHECK_DOING_READ_LEN 6
+#define RDB_CHECK_DOING_READ_AUX 7
+#define RDB_CHECK_DOING_READ_MODULE_AUX 8
+
+char *rdb_check_doing_string[] = {
+    "start",
+    "read-type",
+    "read-expire",
+    "read-key",
+    "read-object-value",
+    "check-sum",
+    "read-len",
+    "read-aux",
+    "read-module-aux"
+};
+
+char *rdb_type_string[] = {
+    "string",
+    "list-linked",
+    "set-hashtable",
+    "zset-v1",
+    "hash-hashtable",
+    "zset-v2",
+    "module-value",
+    "","",
+    "hash-zipmap",
+    "list-ziplist",
+    "set-intset",
+    "zset-ziplist",
+    "hash-ziplist",
+    "quicklist",
+    "stream"
+};
+
+/* Show a few stats collected into 'rdbstate' */
+void rdbShowGenericInfo(void) {
+    printf("[info] %lu keys read\n", rdbstate.keys);
+    printf("[info] %lu expires\n", rdbstate.expires);
+    printf("[info] %lu already expired\n", rdbstate.already_expired);
+}
+
+/* Called on RDB errors. Provides details about the RDB and the offset
+ * we were when the error was detected. */
+void rdbCheckError(const char *fmt, ...) {
+    char msg[1024];
+    va_list ap;
+
+    va_start(ap, fmt);
+    vsnprintf(msg, sizeof(msg), fmt, ap);
+    va_end(ap);
+
+    printf("--- RDB ERROR DETECTED ---\n");
+    printf("[offset %llu] %s\n",
+        (unsigned long long) (rdbstate.rio ?
+            rdbstate.rio->processed_bytes : 0), msg);
+    printf("[additional info] While doing: %s\n",
+        rdb_check_doing_string[rdbstate.doing]);
+    if (rdbstate.key)
+        printf("[additional info] Reading key '%s'\n",
+            (char*)rdbstate.key->ptr);
+    if (rdbstate.key_type != -1)
+        printf("[additional info] Reading type %d (%s)\n",
+            rdbstate.key_type,
+            ((unsigned)rdbstate.key_type <
+             sizeof(rdb_type_string)/sizeof(char*)) ?
+                rdb_type_string[rdbstate.key_type] : "unknown");
+    rdbShowGenericInfo();
+}
+
+/* Print informations during RDB checking. */
+void rdbCheckInfo(const char *fmt, ...) {
+    char msg[1024];
+    va_list ap;
+
+    va_start(ap, fmt);
+    vsnprintf(msg, sizeof(msg), fmt, ap);
+    va_end(ap);
+
+    printf("[offset %llu] %s\n",
+        (unsigned long long) (rdbstate.rio ?
+            rdbstate.rio->processed_bytes : 0), msg);
+}
+
+/* Used inside rdb.c in order to log specific errors happening inside
+ * the RDB loading internals. */
+void rdbCheckSetError(const char *fmt, ...) {
+    va_list ap;
+
+    va_start(ap, fmt);
+    vsnprintf(rdbstate.error, sizeof(rdbstate.error), fmt, ap);
+    va_end(ap);
+    rdbstate.error_set = 1;
+}
+
+/* During RDB check we setup a special signal handler for memory violations
+ * and similar conditions, so that we can log the offending part of the RDB
+ * if the crash is due to broken content. */
+void rdbCheckHandleCrash(int sig, siginfo_t *info, void *secret) {
+    UNUSED(sig);
+    UNUSED(info);
+    UNUSED(secret);
+
+    rdbCheckError("Server crash checking the specified RDB file!");
+    exit(1);
+}
+
+void rdbCheckSetupSignals(void) {
+    struct sigaction act;
+
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = SA_NODEFER | SA_RESETHAND | SA_SIGINFO;
+    act.sa_sigaction = rdbCheckHandleCrash;
+    sigaction(SIGSEGV, &act, NULL);
+    sigaction(SIGBUS, &act, NULL);
+    sigaction(SIGFPE, &act, NULL);
+    sigaction(SIGILL, &act, NULL);
+    sigaction(SIGABRT, &act, NULL);
+}
+
+/* Check the specified RDB file. Return 0 if the RDB looks sane, otherwise
+ * 1 is returned.
+ * The file is specified as a filename in 'rdbfilename' if 'fp' is not NULL,
+ * otherwise the already open file 'fp' is checked. */
+int redis_check_rdb(char *rdbfilename, FILE *fp) {
+    uint64_t dbid;
+    int type, rdbver;
+    char buf[1024];
+    long long expiretime, now = mstime();
+    static rio rdb; /* Pointed by global struct riostate. */
+
+    int closefile = (fp == NULL);
+    if (fp == NULL && (fp = fopen(rdbfilename,"r")) == NULL) return 1;
+
+    startLoadingFile(fp, rdbfilename, RDBFLAGS_NONE);
+    rioInitWithFile(&rdb,fp);
+    rdbstate.rio = &rdb;
+    rdb.update_cksum = rdbLoadProgressCallback;
+    if (rioRead(&rdb,buf,9) == 0) goto eoferr;
+    buf[9] = '\0';
+    if (memcmp(buf,"REDIS",5) != 0) {
+        rdbCheckError("Wrong signature trying to load DB from file");
+        goto err;
+    }
+    rdbver = atoi(buf+5);
+    if (rdbver < 1 || rdbver > RDB_VERSION) {
+        rdbCheckError("Can't handle RDB format version %d",rdbver);
+        goto err;
+    }
+
+    expiretime = -1;
+    while(1) {
+        robj *key, *val;
+
+        /* Read type. */
+        rdbstate.doing = RDB_CHECK_DOING_READ_TYPE;
+        if ((type = rdbLoadType(&rdb)) == -1) goto eoferr;
+
+        /* Handle special types. */
+        if (type == RDB_OPCODE_EXPIRETIME) {
+            rdbstate.doing = RDB_CHECK_DOING_READ_EXPIRE;
+            /* EXPIRETIME: load an expire associated with the next key
+             * to load. Note that after loading an expire we need to
+             * load the actual type, and continue. */
+            expiretime = rdbLoadTime(&rdb);
+            expiretime *= 1000;
+            if (rioGetReadError(&rdb)) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_EXPIRETIME_MS) {
+            /* EXPIRETIME_MS: milliseconds precision expire times introduced
+             * with RDB v3. Like EXPIRETIME but no with more precision. */
+            rdbstate.doing = RDB_CHECK_DOING_READ_EXPIRE;
+            expiretime = rdbLoadMillisecondTime(&rdb, rdbver);
+            if (rioGetReadError(&rdb)) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_FREQ) {
+            /* FREQ: LFU frequency. */
+            uint8_t byte;
+            if (rioRead(&rdb,&byte,1) == 0) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_IDLE) {
+            /* IDLE: LRU idle time. */
+            if (rdbLoadLen(&rdb,NULL) == RDB_LENERR) goto eoferr;
+            continue; /* Read next opcode. */
+        } else if (type == RDB_OPCODE_EOF) {
+            /* EOF: End of file, exit the main loop. */
+            break;
+        } else if (type == RDB_OPCODE_SELECTDB) {
+            /* SELECTDB: Select the specified database. */
+            rdbstate.doing = RDB_CHECK_DOING_READ_LEN;
+            if ((dbid = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
+                goto eoferr;
+            rdbCheckInfo("Selecting DB ID %llu", (unsigned long long)dbid);
+            continue; /* Read type again. */
+        } else if (type == RDB_OPCODE_RESIZEDB) {
+            /* RESIZEDB: Hint about the size of the keys in the currently
+             * selected data base, in order to avoid useless rehashing. */
+            uint64_t db_size, expires_size;
+            rdbstate.doing = RDB_CHECK_DOING_READ_LEN;
+            if ((db_size = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
+                goto eoferr;
+            if ((expires_size = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
+                goto eoferr;
+            continue; /* Read type again. */
+        } else if (type == RDB_OPCODE_AUX) {
+            /* AUX: generic string-string fields. Use to add state to RDB
+             * which is backward compatible. Implementations of RDB loading
+             * are requierd to skip AUX fields they don't understand.
+             *
+             * An AUX field is composed of two strings: key and value. */
+            robj *auxkey, *auxval;
+            rdbstate.doing = RDB_CHECK_DOING_READ_AUX;
+            if ((auxkey = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
+            if ((auxval = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
+
+            rdbCheckInfo("AUX FIELD %s = '%s'",
+                (char*)auxkey->ptr, (char*)auxval->ptr);
+            decrRefCount(auxkey);
+            decrRefCount(auxval);
+            continue; /* Read type again. */
+        } else if (type == RDB_OPCODE_MODULE_AUX) {
+            /* AUX: Auxiliary data for modules. */
+            uint64_t moduleid, when_opcode, when;
+            rdbstate.doing = RDB_CHECK_DOING_READ_MODULE_AUX;
+            if ((moduleid = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
+            if ((when_opcode = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
+            if ((when = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
+
+            char name[10];
+            moduleTypeNameByID(name,moduleid);
+            rdbCheckInfo("MODULE AUX for: %s", name);
+
+            robj *o = rdbLoadCheckModuleValue(&rdb,name);
+            decrRefCount(o);
+            continue; /* Read type again. */
+        } else {
+            if (!rdbIsObjectType(type)) {
+                rdbCheckError("Invalid object type: %d", type);
+                goto err;
+            }
+            rdbstate.key_type = type;
+        }
+
+        /* Read key */
+        rdbstate.doing = RDB_CHECK_DOING_READ_KEY;
+        if ((key = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
+        rdbstate.key = key;
+        rdbstate.keys++;
+        /* Read value */
+        rdbstate.doing = RDB_CHECK_DOING_READ_OBJECT_VALUE;
+        if ((val = rdbLoadObject(type,&rdb,key->ptr,NULL)) == NULL) goto eoferr;
+        /* Check if the key already expired. */
+        if (expiretime != -1 && expiretime < now)
+            rdbstate.already_expired++;
+        if (expiretime != -1) rdbstate.expires++;
+        rdbstate.key = NULL;
+        decrRefCount(key);
+        decrRefCount(val);
+        rdbstate.key_type = -1;
+        expiretime = -1;
+    }
+    /* Verify the checksum if RDB version is >= 5 */
+    if (rdbver >= 5 && server.rdb_checksum) {
+        uint64_t cksum, expected = rdb.cksum;
+
+        rdbstate.doing = RDB_CHECK_DOING_CHECK_SUM;
+        if (rioRead(&rdb,&cksum,8) == 0) goto eoferr;
+        memrev64ifbe(&cksum);
+        if (cksum == 0) {
+            rdbCheckInfo("RDB file was saved with checksum disabled: no check performed.");
+        } else if (cksum != expected) {
+            rdbCheckError("RDB CRC error");
+            goto err;
+        } else {
+            rdbCheckInfo("Checksum OK");
+        }
+    }
+
+    if (closefile) fclose(fp);
+    stopLoading(1);
+    return 0;
+
+eoferr: /* unexpected end of file is handled here with a fatal exit */
+    if (rdbstate.error_set) {
+        rdbCheckError(rdbstate.error);
+    } else {
+        rdbCheckError("Unexpected EOF reading RDB file");
+    }
+err:
+    if (closefile) fclose(fp);
+    stopLoading(0);
+    return 1;
+}
+
+/* RDB check main: called form server.c when Redis is executed with the
+ * redis-check-rdb alias, on during RDB loading errors.
+ *
+ * The function works in two ways: can be called with argc/argv as a
+ * standalone executable, or called with a non NULL 'fp' argument if we
+ * already have an open file to check. This happens when the function
+ * is used to check an RDB preamble inside an AOF file.
+ *
+ * When called with fp = NULL, the function never returns, but exits with the
+ * status code according to success (RDB is sane) or error (RDB is corrupted).
+ * Otherwise if called with a non NULL fp, the function returns C_OK or
+ * C_ERR depending on the success or failure. */
+int redis_check_rdb_main(int argc, char **argv, FILE *fp) {
+    struct timeval tv;
+
+    if (argc != 2 && fp == NULL) {
+        fprintf(stderr, "Usage: %s <rdb-file-name>\n", argv[0]);
+        exit(1);
+    }
+
+    gettimeofday(&tv, NULL);
+    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
+
+    /* In order to call the loading functions we need to create the shared
+     * integer objects, however since this function may be called from
+     * an already initialized Redis instance, check if we really need to. */
+    if (shared.integers[0] == NULL)
+        createSharedObjects();
+    server.loading_process_events_interval_bytes = 0;
+    server.sanitize_dump_payload = SANITIZE_DUMP_YES;
+    rdbCheckMode = 1;
+    rdbCheckInfo("Checking RDB file %s", argv[1]);
+    rdbCheckSetupSignals();
+    int retval = redis_check_rdb(argv[1],fp);
+    if (retval == 0) {
+        rdbCheckInfo("\\o/ RDB looks OK! \\o/");
+        rdbShowGenericInfo();
+    }
+    if (fp) return (retval == 0) ? C_OK : C_ERR;
+    exit(retval);
+}
diff --git a/redis-stable/src/redis-cli.c b/redis-stable/src/redis-cli.c
new file mode 100644
index 00000000..ace37858
--- /dev/null
+++ b/redis-stable/src/redis-cli.c
@@ -0,0 +1,8472 @@
+/* Redis CLI (command line interface)
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include "version.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <signal.h>
+#include <unistd.h>
+#include <time.h>
+#include <ctype.h>
+#include <errno.h>
+#include <sys/stat.h>
+#include <sys/time.h>
+#include <assert.h>
+#include <fcntl.h>
+#include <limits.h>
+#include <math.h>
+
+#include <hiredis.h>
+#ifdef USE_OPENSSL
+#include <openssl/ssl.h>
+#include <openssl/err.h>
+#include <hiredis_ssl.h>
+#endif
+#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
+#include <sds.h> /* use sds.h from hiredis, so that only one set of sds functions will be present in the binary */
+#include "dict.h"
+#include "adlist.h"
+#include "zmalloc.h"
+#include "linenoise.h"
+#include "help.h"
+#include "anet.h"
+#include "ae.h"
+#include "cli_common.h"
+#include "mt19937-64.h"
+
+#define UNUSED(V) ((void) V)
+
+#define OUTPUT_STANDARD 0
+#define OUTPUT_RAW 1
+#define OUTPUT_CSV 2
+#define REDIS_CLI_KEEPALIVE_INTERVAL 15 /* seconds */
+#define REDIS_CLI_DEFAULT_PIPE_TIMEOUT 30 /* seconds */
+#define REDIS_CLI_HISTFILE_ENV "REDISCLI_HISTFILE"
+#define REDIS_CLI_HISTFILE_DEFAULT ".rediscli_history"
+#define REDIS_CLI_RCFILE_ENV "REDISCLI_RCFILE"
+#define REDIS_CLI_RCFILE_DEFAULT ".redisclirc"
+#define REDIS_CLI_AUTH_ENV "REDISCLI_AUTH"
+#define REDIS_CLI_CLUSTER_YES_ENV "REDISCLI_CLUSTER_YES"
+
+#define CLUSTER_MANAGER_SLOTS               16384
+#define CLUSTER_MANAGER_MIGRATE_TIMEOUT     60000
+#define CLUSTER_MANAGER_MIGRATE_PIPELINE    10
+#define CLUSTER_MANAGER_REBALANCE_THRESHOLD 2
+
+#define CLUSTER_MANAGER_INVALID_HOST_ARG \
+    "[ERR] Invalid arguments: you need to pass either a valid " \
+    "address (ie. 120.0.0.1:7000) or space separated IP " \
+    "and port (ie. 120.0.0.1 7000)\n"
+#define CLUSTER_MANAGER_MODE() (config.cluster_manager_command.name != NULL)
+#define CLUSTER_MANAGER_MASTERS_COUNT(nodes, replicas) (nodes/(replicas + 1))
+#define CLUSTER_MANAGER_COMMAND(n,...) \
+        (redisCommand(n->context, __VA_ARGS__))
+
+#define CLUSTER_MANAGER_NODE_ARRAY_FREE(array) zfree(array->alloc)
+
+#define CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, err) \
+    clusterManagerLogErr("Node %s:%d replied with error:\n%s\n", \
+                         n->ip, n->port, err);
+
+#define clusterManagerLogInfo(...) \
+    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_INFO,__VA_ARGS__)
+
+#define clusterManagerLogErr(...) \
+    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_ERR,__VA_ARGS__)
+
+#define clusterManagerLogWarn(...) \
+    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_WARN,__VA_ARGS__)
+
+#define clusterManagerLogOk(...) \
+    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_SUCCESS,__VA_ARGS__)
+
+#define CLUSTER_MANAGER_FLAG_MYSELF     1 << 0
+#define CLUSTER_MANAGER_FLAG_SLAVE      1 << 1
+#define CLUSTER_MANAGER_FLAG_FRIEND     1 << 2
+#define CLUSTER_MANAGER_FLAG_NOADDR     1 << 3
+#define CLUSTER_MANAGER_FLAG_DISCONNECT 1 << 4
+#define CLUSTER_MANAGER_FLAG_FAIL       1 << 5
+
+#define CLUSTER_MANAGER_CMD_FLAG_FIX            1 << 0
+#define CLUSTER_MANAGER_CMD_FLAG_SLAVE          1 << 1
+#define CLUSTER_MANAGER_CMD_FLAG_YES            1 << 2
+#define CLUSTER_MANAGER_CMD_FLAG_AUTOWEIGHTS    1 << 3
+#define CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER    1 << 4
+#define CLUSTER_MANAGER_CMD_FLAG_SIMULATE       1 << 5
+#define CLUSTER_MANAGER_CMD_FLAG_REPLACE        1 << 6
+#define CLUSTER_MANAGER_CMD_FLAG_COPY           1 << 7
+#define CLUSTER_MANAGER_CMD_FLAG_COLOR          1 << 8
+#define CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS   1 << 9
+#define CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS 1 << 10
+#define CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY   1 << 11
+#define CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY    1 << 12
+
+#define CLUSTER_MANAGER_OPT_GETFRIENDS  1 << 0
+#define CLUSTER_MANAGER_OPT_COLD        1 << 1
+#define CLUSTER_MANAGER_OPT_UPDATE      1 << 2
+#define CLUSTER_MANAGER_OPT_QUIET       1 << 6
+#define CLUSTER_MANAGER_OPT_VERBOSE     1 << 7
+
+#define CLUSTER_MANAGER_LOG_LVL_INFO    1
+#define CLUSTER_MANAGER_LOG_LVL_WARN    2
+#define CLUSTER_MANAGER_LOG_LVL_ERR     3
+#define CLUSTER_MANAGER_LOG_LVL_SUCCESS 4
+
+#define CLUSTER_JOIN_CHECK_AFTER        20
+
+#define LOG_COLOR_BOLD      "29;1m"
+#define LOG_COLOR_RED       "31;1m"
+#define LOG_COLOR_GREEN     "32;1m"
+#define LOG_COLOR_YELLOW    "33;1m"
+#define LOG_COLOR_RESET     "0m"
+
+/* cliConnect() flags. */
+#define CC_FORCE (1<<0)         /* Re-connect if already connected. */
+#define CC_QUIET (1<<1)         /* Don't log connecting errors. */
+
+/* --latency-dist palettes. */
+int spectrum_palette_color_size = 19;
+int spectrum_palette_color[] = {0,233,234,235,237,239,241,243,245,247,144,143,142,184,226,214,208,202,196};
+
+int spectrum_palette_mono_size = 13;
+int spectrum_palette_mono[] = {0,233,234,235,237,239,241,243,245,247,249,251,253};
+
+/* The actual palette in use. */
+int *spectrum_palette;
+int spectrum_palette_size;
+
+/* Dict Helpers */
+
+static uint64_t dictSdsHash(const void *key);
+static int dictSdsKeyCompare(void *privdata, const void *key1,
+    const void *key2);
+static void dictSdsDestructor(void *privdata, void *val);
+static void dictListDestructor(void *privdata, void *val);
+
+/* Cluster Manager Command Info */
+typedef struct clusterManagerCommand {
+    char *name;
+    int argc;
+    char **argv;
+    int flags;
+    int replicas;
+    char *from;
+    char *to;
+    char **weight;
+    int weight_argc;
+    char *master_id;
+    int slots;
+    int timeout;
+    int pipeline;
+    float threshold;
+    char *backup_dir;
+    char *from_user;
+    char *from_pass;
+    int from_askpass;
+} clusterManagerCommand;
+
+static void createClusterManagerCommand(char *cmdname, int argc, char **argv);
+
+
+static redisContext *context;
+static struct config {
+    char *hostip;
+    int hostport;
+    char *hostsocket;
+    int tls;
+    cliSSLconfig sslconfig;
+    long repeat;
+    long interval;
+    int dbnum; /* db num currently selected */
+    int input_dbnum; /* db num user input */
+    int interactive;
+    int shutdown;
+    int monitor_mode;
+    int pubsub_mode;
+    int latency_mode;
+    int latency_dist_mode;
+    int latency_history;
+    int lru_test_mode;
+    long long lru_test_sample_size;
+    int cluster_mode;
+    int cluster_reissue_command;
+    int cluster_send_asking;
+    int slave_mode;
+    int pipe_mode;
+    int pipe_timeout;
+    int getrdb_mode;
+    int stat_mode;
+    int scan_mode;
+    int intrinsic_latency_mode;
+    int intrinsic_latency_duration;
+    sds pattern;
+    char *rdb_filename;
+    int bigkeys;
+    int memkeys;
+    unsigned memkeys_samples;
+    int hotkeys;
+    int stdinarg; /* get last arg from stdin. (-x option) */
+    char *auth;
+    int askpass;
+    char *user;
+    int quoted_input;   /* Force input args to be treated as quoted strings */
+    int output; /* output mode, see OUTPUT_* defines */
+    int push_output; /* Should we display spontaneous PUSH replies */
+    sds mb_delim;
+    sds cmd_delim;
+    char prompt[128];
+    char *eval;
+    int eval_ldb;
+    int eval_ldb_sync;  /* Ask for synchronous mode of the Lua debugger. */
+    int eval_ldb_end;   /* Lua debugging session ended. */
+    int enable_ldb_on_eval; /* Handle manual SCRIPT DEBUG + EVAL commands. */
+    int last_cmd_type;
+    int verbose;
+    int set_errcode;
+    clusterManagerCommand cluster_manager_command;
+    int no_auth_warning;
+    int resp3;
+    int in_multi;
+    int pre_multi_dbnum;
+} config;
+
+/* User preferences. */
+static struct pref {
+    int hints;
+} pref;
+
+static volatile sig_atomic_t force_cancel_loop = 0;
+static void usage(void);
+static void slaveMode(void);
+char *redisGitSHA1(void);
+char *redisGitDirty(void);
+static int cliConnect(int force);
+
+static char *getInfoField(char *info, char *field);
+static long getLongInfoField(char *info, char *field);
+
+/*------------------------------------------------------------------------------
+ * Utility functions
+ *--------------------------------------------------------------------------- */
+
+static void cliPushHandler(void *, void *);
+
+uint16_t crc16(const char *buf, int len);
+
+static long long ustime(void) {
+    struct timeval tv;
+    long long ust;
+
+    gettimeofday(&tv, NULL);
+    ust = ((long long)tv.tv_sec)*1000000;
+    ust += tv.tv_usec;
+    return ust;
+}
+
+static long long mstime(void) {
+    return ustime()/1000;
+}
+
+static void cliRefreshPrompt(void) {
+    if (config.eval_ldb) return;
+
+    sds prompt = sdsempty();
+    if (config.hostsocket != NULL) {
+        prompt = sdscatfmt(prompt,"redis %s",config.hostsocket);
+    } else {
+        char addr[256];
+        anetFormatAddr(addr, sizeof(addr), config.hostip, config.hostport);
+        prompt = sdscatlen(prompt,addr,strlen(addr));
+    }
+
+    /* Add [dbnum] if needed */
+    if (config.dbnum != 0)
+        prompt = sdscatfmt(prompt,"[%i]",config.dbnum);
+
+    /* Add TX if in transaction state*/
+    if (config.in_multi)  
+        prompt = sdscatlen(prompt,"(TX)",4);
+
+    /* Copy the prompt in the static buffer. */
+    prompt = sdscatlen(prompt,"> ",2);
+    snprintf(config.prompt,sizeof(config.prompt),"%s",prompt);
+    sdsfree(prompt);
+}
+
+/* Return the name of the dotfile for the specified 'dotfilename'.
+ * Normally it just concatenates user $HOME to the file specified
+ * in 'dotfilename'. However if the environment variable 'envoverride'
+ * is set, its value is taken as the path.
+ *
+ * The function returns NULL (if the file is /dev/null or cannot be
+ * obtained for some error), or an SDS string that must be freed by
+ * the user. */
+static sds getDotfilePath(char *envoverride, char *dotfilename) {
+    char *path = NULL;
+    sds dotPath = NULL;
+
+    /* Check the env for a dotfile override. */
+    path = getenv(envoverride);
+    if (path != NULL && *path != '\0') {
+        if (!strcmp("/dev/null", path)) {
+            return NULL;
+        }
+
+        /* If the env is set, return it. */
+        dotPath = sdsnew(path);
+    } else {
+        char *home = getenv("HOME");
+        if (home != NULL && *home != '\0') {
+            /* If no override is set use $HOME/<dotfilename>. */
+            dotPath = sdscatprintf(sdsempty(), "%s/%s", home, dotfilename);
+        }
+    }
+    return dotPath;
+}
+
+/* URL-style percent decoding. */
+#define isHexChar(c) (isdigit(c) || (c >= 'a' && c <= 'f'))
+#define decodeHexChar(c) (isdigit(c) ? c - '0' : c - 'a' + 10)
+#define decodeHex(h, l) ((decodeHexChar(h) << 4) + decodeHexChar(l))
+
+static sds percentDecode(const char *pe, size_t len) {
+    const char *end = pe + len;
+    sds ret = sdsempty();
+    const char *curr = pe;
+
+    while (curr < end) {
+        if (*curr == '%') {
+            if ((end - curr) < 2) {
+                fprintf(stderr, "Incomplete URI encoding\n");
+                exit(1);
+            }
+
+            char h = tolower(*(++curr));
+            char l = tolower(*(++curr));
+            if (!isHexChar(h) || !isHexChar(l)) {
+                fprintf(stderr, "Illegal character in URI encoding\n");
+                exit(1);
+            }
+            char c = decodeHex(h, l);
+            ret = sdscatlen(ret, &c, 1);
+            curr++;
+        } else {
+            ret = sdscatlen(ret, curr++, 1);
+        }
+    }
+
+    return ret;
+}
+
+/* Parse a URI and extract the server connection information.
+ * URI scheme is based on the the provisional specification[1] excluding support
+ * for query parameters. Valid URIs are:
+ *   scheme:    "redis://"
+ *   authority: [[<username> ":"] <password> "@"] [<hostname> [":" <port>]]
+ *   path:      ["/" [<db>]]
+ *
+ *  [1]: https://www.iana.org/assignments/uri-schemes/prov/redis */
+static void parseRedisUri(const char *uri) {
+
+    const char *scheme = "redis://";
+    const char *tlsscheme = "rediss://";
+    const char *curr = uri;
+    const char *end = uri + strlen(uri);
+    const char *userinfo, *username, *port, *host, *path;
+
+    /* URI must start with a valid scheme. */
+    if (!strncasecmp(tlsscheme, curr, strlen(tlsscheme))) {
+#ifdef USE_OPENSSL
+        config.tls = 1;
+        curr += strlen(tlsscheme);
+#else
+        fprintf(stderr,"rediss:// is only supported when redis-cli is compiled with OpenSSL\n");
+        exit(1);
+#endif
+    } else if (!strncasecmp(scheme, curr, strlen(scheme))) {
+        curr += strlen(scheme);
+    } else {
+        fprintf(stderr,"Invalid URI scheme\n");
+        exit(1);
+    }
+    if (curr == end) return;
+
+    /* Extract user info. */
+    if ((userinfo = strchr(curr,'@'))) {
+        if ((username = strchr(curr, ':')) && username < userinfo) {
+            config.user = percentDecode(curr, username - curr);
+            curr = username + 1;
+        }
+
+        config.auth = percentDecode(curr, userinfo - curr);
+        curr = userinfo + 1;
+    }
+    if (curr == end) return;
+
+    /* Extract host and port. */
+    path = strchr(curr, '/');
+    if (*curr != '/') {
+        host = path ? path - 1 : end;
+        if ((port = strchr(curr, ':'))) {
+            config.hostport = atoi(port + 1);
+            host = port - 1;
+        }
+        config.hostip = sdsnewlen(curr, host - curr + 1);
+    }
+    curr = path ? path + 1 : end;
+    if (curr == end) return;
+
+    /* Extract database number. */
+    config.input_dbnum = atoi(curr);
+}
+
+static uint64_t dictSdsHash(const void *key) {
+    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
+}
+
+static int dictSdsKeyCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    int l1,l2;
+    DICT_NOTUSED(privdata);
+
+    l1 = sdslen((sds)key1);
+    l2 = sdslen((sds)key2);
+    if (l1 != l2) return 0;
+    return memcmp(key1, key2, l1) == 0;
+}
+
+static void dictSdsDestructor(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+    sdsfree(val);
+}
+
+void dictListDestructor(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+    listRelease((list*)val);
+}
+
+/* _serverAssert is needed by dict */
+void _serverAssert(const char *estr, const char *file, int line) {
+    fprintf(stderr, "=== ASSERTION FAILED ===");
+    fprintf(stderr, "==> %s:%d '%s' is not true",file,line,estr);
+    *((char*)-1) = 'x';
+}
+
+/*------------------------------------------------------------------------------
+ * Help functions
+ *--------------------------------------------------------------------------- */
+
+#define CLI_HELP_COMMAND 1
+#define CLI_HELP_GROUP 2
+
+typedef struct {
+    int type;
+    int argc;
+    sds *argv;
+    sds full;
+
+    /* Only used for help on commands */
+    struct commandHelp *org;
+} helpEntry;
+
+static helpEntry *helpEntries;
+static int helpEntriesLen;
+
+static sds cliVersion(void) {
+    sds version;
+    version = sdscatprintf(sdsempty(), "%s", REDIS_VERSION);
+
+    /* Add git commit and working tree status when available */
+    if (strtoll(redisGitSHA1(),NULL,16)) {
+        version = sdscatprintf(version, " (git:%s", redisGitSHA1());
+        if (strtoll(redisGitDirty(),NULL,10))
+            version = sdscatprintf(version, "-dirty");
+        version = sdscat(version, ")");
+    }
+    return version;
+}
+
+static void cliInitHelp(void) {
+    int commandslen = sizeof(commandHelp)/sizeof(struct commandHelp);
+    int groupslen = sizeof(commandGroups)/sizeof(char*);
+    int i, len, pos = 0;
+    helpEntry tmp;
+
+    helpEntriesLen = len = commandslen+groupslen;
+    helpEntries = zmalloc(sizeof(helpEntry)*len);
+
+    for (i = 0; i < groupslen; i++) {
+        tmp.argc = 1;
+        tmp.argv = zmalloc(sizeof(sds));
+        tmp.argv[0] = sdscatprintf(sdsempty(),"@%s",commandGroups[i]);
+        tmp.full = tmp.argv[0];
+        tmp.type = CLI_HELP_GROUP;
+        tmp.org = NULL;
+        helpEntries[pos++] = tmp;
+    }
+
+    for (i = 0; i < commandslen; i++) {
+        tmp.argv = sdssplitargs(commandHelp[i].name,&tmp.argc);
+        tmp.full = sdsnew(commandHelp[i].name);
+        tmp.type = CLI_HELP_COMMAND;
+        tmp.org = &commandHelp[i];
+        helpEntries[pos++] = tmp;
+    }
+}
+
+/* cliInitHelp() setups the helpEntries array with the command and group
+ * names from the help.h file. However the Redis instance we are connecting
+ * to may support more commands, so this function integrates the previous
+ * entries with additional entries obtained using the COMMAND command
+ * available in recent versions of Redis. */
+static void cliIntegrateHelp(void) {
+    if (cliConnect(CC_QUIET) == REDIS_ERR) return;
+
+    redisReply *reply = redisCommand(context, "COMMAND");
+    if(reply == NULL || reply->type != REDIS_REPLY_ARRAY) return;
+
+    /* Scan the array reported by COMMAND and fill only the entries that
+     * don't already match what we have. */
+    for (size_t j = 0; j < reply->elements; j++) {
+        redisReply *entry = reply->element[j];
+        if (entry->type != REDIS_REPLY_ARRAY || entry->elements < 4 ||
+            entry->element[0]->type != REDIS_REPLY_STRING ||
+            entry->element[1]->type != REDIS_REPLY_INTEGER ||
+            entry->element[3]->type != REDIS_REPLY_INTEGER) return;
+        char *cmdname = entry->element[0]->str;
+        int i;
+
+        for (i = 0; i < helpEntriesLen; i++) {
+            helpEntry *he = helpEntries+i;
+            if (!strcasecmp(he->argv[0],cmdname))
+                break;
+        }
+        if (i != helpEntriesLen) continue;
+
+        helpEntriesLen++;
+        helpEntries = zrealloc(helpEntries,sizeof(helpEntry)*helpEntriesLen);
+        helpEntry *new = helpEntries+(helpEntriesLen-1);
+
+        new->argc = 1;
+        new->argv = zmalloc(sizeof(sds));
+        new->argv[0] = sdsnew(cmdname);
+        new->full = new->argv[0];
+        new->type = CLI_HELP_COMMAND;
+        sdstoupper(new->argv[0]);
+
+        struct commandHelp *ch = zmalloc(sizeof(*ch));
+        ch->name = new->argv[0];
+        ch->params = sdsempty();
+        int args = llabs(entry->element[1]->integer);
+        args--; /* Remove the command name itself. */
+        if (entry->element[3]->integer == 1) {
+            ch->params = sdscat(ch->params,"key ");
+            args--;
+        }
+        while(args-- > 0) ch->params = sdscat(ch->params,"arg ");
+        if (entry->element[1]->integer < 0)
+            ch->params = sdscat(ch->params,"...options...");
+        ch->summary = "Help not available";
+        ch->group = 0;
+        ch->since = "not known";
+        new->org = ch;
+    }
+    freeReplyObject(reply);
+}
+
+/* Output command help to stdout. */
+static void cliOutputCommandHelp(struct commandHelp *help, int group) {
+    printf("\r\n  \x1b[1m%s\x1b[0m \x1b[90m%s\x1b[0m\r\n", help->name, help->params);
+    printf("  \x1b[33msummary:\x1b[0m %s\r\n", help->summary);
+    printf("  \x1b[33msince:\x1b[0m %s\r\n", help->since);
+    if (group) {
+        printf("  \x1b[33mgroup:\x1b[0m %s\r\n", commandGroups[help->group]);
+    }
+}
+
+/* Print generic help. */
+static void cliOutputGenericHelp(void) {
+    sds version = cliVersion();
+    printf(
+        "redis-cli %s\n"
+        "To get help about Redis commands type:\n"
+        "      \"help @<group>\" to get a list of commands in <group>\n"
+        "      \"help <command>\" for help on <command>\n"
+        "      \"help <tab>\" to get a list of possible help topics\n"
+        "      \"quit\" to exit\n"
+        "\n"
+        "To set redis-cli preferences:\n"
+        "      \":set hints\" enable online hints\n"
+        "      \":set nohints\" disable online hints\n"
+        "Set your preferences in ~/.redisclirc\n",
+        version
+    );
+    sdsfree(version);
+}
+
+/* Output all command help, filtering by group or command name. */
+static void cliOutputHelp(int argc, char **argv) {
+    int i, j, len;
+    int group = -1;
+    helpEntry *entry;
+    struct commandHelp *help;
+
+    if (argc == 0) {
+        cliOutputGenericHelp();
+        return;
+    } else if (argc > 0 && argv[0][0] == '@') {
+        len = sizeof(commandGroups)/sizeof(char*);
+        for (i = 0; i < len; i++) {
+            if (strcasecmp(argv[0]+1,commandGroups[i]) == 0) {
+                group = i;
+                break;
+            }
+        }
+    }
+
+    assert(argc > 0);
+    for (i = 0; i < helpEntriesLen; i++) {
+        entry = &helpEntries[i];
+        if (entry->type != CLI_HELP_COMMAND) continue;
+
+        help = entry->org;
+        if (group == -1) {
+            /* Compare all arguments */
+            if (argc <= entry->argc) {
+                for (j = 0; j < argc; j++) {
+                    if (strcasecmp(argv[j],entry->argv[j]) != 0) break;
+                }
+                if (j == argc) {
+                    cliOutputCommandHelp(help,1);
+                }
+            }
+        } else {
+            if (group == help->group) {
+                cliOutputCommandHelp(help,0);
+            }
+        }
+    }
+    printf("\r\n");
+}
+
+/* Linenoise completion callback. */
+static void completionCallback(const char *buf, linenoiseCompletions *lc) {
+    size_t startpos = 0;
+    int mask;
+    int i;
+    size_t matchlen;
+    sds tmp;
+
+    if (strncasecmp(buf,"help ",5) == 0) {
+        startpos = 5;
+        while (isspace(buf[startpos])) startpos++;
+        mask = CLI_HELP_COMMAND | CLI_HELP_GROUP;
+    } else {
+        mask = CLI_HELP_COMMAND;
+    }
+
+    for (i = 0; i < helpEntriesLen; i++) {
+        if (!(helpEntries[i].type & mask)) continue;
+
+        matchlen = strlen(buf+startpos);
+        if (strncasecmp(buf+startpos,helpEntries[i].full,matchlen) == 0) {
+            tmp = sdsnewlen(buf,startpos);
+            tmp = sdscat(tmp,helpEntries[i].full);
+            linenoiseAddCompletion(lc,tmp);
+            sdsfree(tmp);
+        }
+    }
+}
+
+/* Linenoise hints callback. */
+static char *hintsCallback(const char *buf, int *color, int *bold) {
+    if (!pref.hints) return NULL;
+
+    int i, argc, buflen = strlen(buf);
+    sds *argv = sdssplitargs(buf,&argc);
+    int endspace = buflen && isspace(buf[buflen-1]);
+
+    /* Check if the argument list is empty and return ASAP. */
+    if (argc == 0) {
+        sdsfreesplitres(argv,argc);
+        return NULL;
+    }
+
+    for (i = 0; i < helpEntriesLen; i++) {
+        if (!(helpEntries[i].type & CLI_HELP_COMMAND)) continue;
+
+        if (strcasecmp(argv[0],helpEntries[i].full) == 0 ||
+            strcasecmp(buf,helpEntries[i].full) == 0)
+        {
+            *color = 90;
+            *bold = 0;
+            sds hint = sdsnew(helpEntries[i].org->params);
+
+            /* Remove arguments from the returned hint to show only the
+             * ones the user did not yet typed. */
+            int toremove = argc-1;
+            while(toremove > 0 && sdslen(hint)) {
+                if (hint[0] == '[') break;
+                if (hint[0] == ' ') toremove--;
+                sdsrange(hint,1,-1);
+            }
+
+            /* Add an initial space if needed. */
+            if (!endspace) {
+                sds newhint = sdsnewlen(" ",1);
+                newhint = sdscatsds(newhint,hint);
+                sdsfree(hint);
+                hint = newhint;
+            }
+
+            sdsfreesplitres(argv,argc);
+            return hint;
+        }
+    }
+    sdsfreesplitres(argv,argc);
+    return NULL;
+}
+
+static void freeHintsCallback(void *ptr) {
+    sdsfree(ptr);
+}
+
+/*------------------------------------------------------------------------------
+ * Networking / parsing
+ *--------------------------------------------------------------------------- */
+
+/* Unquote a null-terminated string and return it as a binary-safe sds. */
+static sds unquoteCString(char *str) {
+    int count;
+    sds *unquoted = sdssplitargs(str, &count);
+    sds res = NULL;
+
+    if (unquoted && count == 1) {
+        res = unquoted[0];
+        unquoted[0] = NULL;
+    }
+
+    if (unquoted)
+        sdsfreesplitres(unquoted, count);
+
+    return res;
+}
+
+/* Send AUTH command to the server */
+static int cliAuth(redisContext *ctx, char *user, char *auth) {
+    redisReply *reply;
+    if (auth == NULL) return REDIS_OK;
+
+    if (user == NULL)
+        reply = redisCommand(ctx,"AUTH %s",auth);
+    else
+        reply = redisCommand(ctx,"AUTH %s %s",user,auth);
+
+    if (reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        return REDIS_ERR;
+    }
+
+    int result = REDIS_OK;
+    if (reply->type == REDIS_REPLY_ERROR) {
+        result = REDIS_ERR;
+        fprintf(stderr, "AUTH failed: %s\n", reply->str);
+    }
+    freeReplyObject(reply);
+    return result;
+}
+
+/* Send SELECT input_dbnum to the server */
+static int cliSelect(void) {
+    redisReply *reply;
+    if (config.input_dbnum == config.dbnum) return REDIS_OK;
+
+    reply = redisCommand(context,"SELECT %d",config.input_dbnum);
+    if (reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        return REDIS_ERR;
+    }
+
+    int result = REDIS_OK;
+    if (reply->type == REDIS_REPLY_ERROR) {
+        result = REDIS_ERR;
+        fprintf(stderr,"SELECT %d failed: %s\n",config.input_dbnum,reply->str);
+    } else {
+        config.dbnum = config.input_dbnum;
+        cliRefreshPrompt();
+    }
+    freeReplyObject(reply);
+    return result;
+}
+
+/* Select RESP3 mode if redis-cli was started with the -3 option.  */
+static int cliSwitchProto(void) {
+    redisReply *reply;
+    if (config.resp3 == 0) return REDIS_OK;
+
+    reply = redisCommand(context,"HELLO 3");
+    if (reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        return REDIS_ERR;
+    }
+
+    int result = REDIS_OK;
+    if (reply->type == REDIS_REPLY_ERROR) {
+        result = REDIS_ERR;
+        fprintf(stderr,"HELLO 3 failed: %s\n",reply->str);
+    }
+    freeReplyObject(reply);
+    return result;
+}
+
+/* Connect to the server. It is possible to pass certain flags to the function:
+ *      CC_FORCE: The connection is performed even if there is already
+ *                a connected socket.
+ *      CC_QUIET: Don't print errors if connection fails. */
+static int cliConnect(int flags) {
+    if (context == NULL || flags & CC_FORCE) {
+        if (context != NULL) {
+            redisFree(context);
+            config.dbnum = 0;
+            config.in_multi = 0;
+            cliRefreshPrompt();
+        }
+
+        /* Do not use hostsocket when we got redirected in cluster mode */
+        if (config.hostsocket == NULL ||
+            (config.cluster_mode && config.cluster_reissue_command)) {
+            context = redisConnect(config.hostip,config.hostport);
+        } else {
+            context = redisConnectUnix(config.hostsocket);
+        }
+
+        if (!context->err && config.tls) {
+            const char *err = NULL;
+            if (cliSecureConnection(context, config.sslconfig, &err) == REDIS_ERR && err) {
+                fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
+                redisFree(context);
+                context = NULL;
+                return REDIS_ERR;
+            }
+        }
+
+        if (context->err) {
+            if (!(flags & CC_QUIET)) {
+                fprintf(stderr,"Could not connect to Redis at ");
+                if (config.hostsocket == NULL ||
+                    (config.cluster_mode && config.cluster_reissue_command))
+                {
+                    fprintf(stderr, "%s:%d: %s\n",
+                        config.hostip,config.hostport,context->errstr);
+                } else {
+                    fprintf(stderr,"%s: %s\n",
+                        config.hostsocket,context->errstr);
+                }
+            }
+            redisFree(context);
+            context = NULL;
+            return REDIS_ERR;
+        }
+
+
+        /* Set aggressive KEEP_ALIVE socket option in the Redis context socket
+         * in order to prevent timeouts caused by the execution of long
+         * commands. At the same time this improves the detection of real
+         * errors. */
+        anetKeepAlive(NULL, context->fd, REDIS_CLI_KEEPALIVE_INTERVAL);
+
+        /* Do AUTH, select the right DB, switch to RESP3 if needed. */
+        if (cliAuth(context, config.user, config.auth) != REDIS_OK)
+            return REDIS_ERR;
+        if (cliSelect() != REDIS_OK)
+            return REDIS_ERR;
+        if (cliSwitchProto() != REDIS_OK)
+            return REDIS_ERR;
+    }
+
+    /* Set a PUSH handler if configured to do so. */
+    if (config.push_output) {
+        redisSetPushCallback(context, cliPushHandler);
+    }
+
+    return REDIS_OK;
+}
+
+/* In cluster, if server replies ASK, we will redirect to a different node.
+ * Before sending the real command, we need to send ASKING command first. */
+static int cliSendAsking() {
+    redisReply *reply;
+
+    config.cluster_send_asking = 0;
+    if (context == NULL) {
+        return REDIS_ERR;
+    }
+    reply = redisCommand(context,"ASKING");
+    if (reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        return REDIS_ERR;
+    }
+    int result = REDIS_OK;
+    if (reply->type == REDIS_REPLY_ERROR) {
+        result = REDIS_ERR;
+        fprintf(stderr,"ASKING failed: %s\n",reply->str);
+    }
+    freeReplyObject(reply);
+    return result;
+}
+
+static void cliPrintContextError(void) {
+    if (context == NULL) return;
+    fprintf(stderr,"Error: %s\n",context->errstr);
+}
+
+static int isInvalidateReply(redisReply *reply) {
+    return reply->type == REDIS_REPLY_PUSH && reply->elements == 2 &&
+        reply->element[0]->type == REDIS_REPLY_STRING &&
+        !strncmp(reply->element[0]->str, "invalidate", 10) &&
+        reply->element[1]->type == REDIS_REPLY_ARRAY;
+}
+
+/* Special display handler for RESP3 'invalidate' messages.
+ * This function does not validate the reply, so it should
+ * already be confirmed correct */
+static sds cliFormatInvalidateTTY(redisReply *r) {
+    sds out = sdsnew("-> invalidate: ");
+
+    for (size_t i = 0; i < r->element[1]->elements; i++) {
+        redisReply *key = r->element[1]->element[i];
+        assert(key->type == REDIS_REPLY_STRING);
+
+        out = sdscatfmt(out, "'%s'", key->str, key->len);
+        if (i < r->element[1]->elements - 1)
+            out = sdscatlen(out, ", ", 2);
+    }
+
+    return sdscatlen(out, "\n", 1);
+}
+
+static sds cliFormatReplyTTY(redisReply *r, char *prefix) {
+    sds out = sdsempty();
+    switch (r->type) {
+    case REDIS_REPLY_ERROR:
+        out = sdscatprintf(out,"(error) %s\n", r->str);
+    break;
+    case REDIS_REPLY_STATUS:
+        out = sdscat(out,r->str);
+        out = sdscat(out,"\n");
+    break;
+    case REDIS_REPLY_INTEGER:
+        out = sdscatprintf(out,"(integer) %lld\n",r->integer);
+    break;
+    case REDIS_REPLY_DOUBLE:
+        out = sdscatprintf(out,"(double) %s\n",r->str);
+    break;
+    case REDIS_REPLY_STRING:
+    case REDIS_REPLY_VERB:
+        /* If you are producing output for the standard output we want
+        * a more interesting output with quoted characters and so forth,
+        * unless it's a verbatim string type. */
+        if (r->type == REDIS_REPLY_STRING) {
+            out = sdscatrepr(out,r->str,r->len);
+            out = sdscat(out,"\n");
+        } else {
+            out = sdscatlen(out,r->str,r->len);
+            out = sdscat(out,"\n");
+        }
+    break;
+    case REDIS_REPLY_NIL:
+        out = sdscat(out,"(nil)\n");
+    break;
+    case REDIS_REPLY_BOOL:
+        out = sdscat(out,r->integer ? "(true)\n" : "(false)\n");
+    break;
+    case REDIS_REPLY_ARRAY:
+    case REDIS_REPLY_MAP:
+    case REDIS_REPLY_SET:
+    case REDIS_REPLY_PUSH:
+        if (r->elements == 0) {
+            if (r->type == REDIS_REPLY_ARRAY)
+                out = sdscat(out,"(empty array)\n");
+            else if (r->type == REDIS_REPLY_MAP)
+                out = sdscat(out,"(empty hash)\n");
+            else if (r->type == REDIS_REPLY_SET)
+                out = sdscat(out,"(empty set)\n");
+            else if (r->type == REDIS_REPLY_PUSH)
+                out = sdscat(out,"(empty push)\n");
+            else
+                out = sdscat(out,"(empty aggregate type)\n");
+        } else {
+            unsigned int i, idxlen = 0;
+            char _prefixlen[16];
+            char _prefixfmt[16];
+            sds _prefix;
+            sds tmp;
+
+            /* Calculate chars needed to represent the largest index */
+            i = r->elements;
+            if (r->type == REDIS_REPLY_MAP) i /= 2;
+            do {
+                idxlen++;
+                i /= 10;
+            } while(i);
+
+            /* Prefix for nested multi bulks should grow with idxlen+2 spaces */
+            memset(_prefixlen,' ',idxlen+2);
+            _prefixlen[idxlen+2] = '\0';
+            _prefix = sdscat(sdsnew(prefix),_prefixlen);
+
+            /* Setup prefix format for every entry */
+            char numsep;
+            if (r->type == REDIS_REPLY_SET) numsep = '~';
+            else if (r->type == REDIS_REPLY_MAP) numsep = '#';
+            else numsep = ')';
+            snprintf(_prefixfmt,sizeof(_prefixfmt),"%%s%%%ud%c ",idxlen,numsep);
+
+            for (i = 0; i < r->elements; i++) {
+                unsigned int human_idx = (r->type == REDIS_REPLY_MAP) ?
+                                         i/2 : i;
+                human_idx++; /* Make it 1-based. */
+
+                /* Don't use the prefix for the first element, as the parent
+                 * caller already prepended the index number. */
+                out = sdscatprintf(out,_prefixfmt,i == 0 ? "" : prefix,human_idx);
+
+                /* Format the multi bulk entry */
+                tmp = cliFormatReplyTTY(r->element[i],_prefix);
+                out = sdscatlen(out,tmp,sdslen(tmp));
+                sdsfree(tmp);
+
+                /* For maps, format the value as well. */
+                if (r->type == REDIS_REPLY_MAP) {
+                    i++;
+                    sdsrange(out,0,-2);
+                    out = sdscat(out," => ");
+                    tmp = cliFormatReplyTTY(r->element[i],_prefix);
+                    out = sdscatlen(out,tmp,sdslen(tmp));
+                    sdsfree(tmp);
+                }
+            }
+            sdsfree(_prefix);
+        }
+    break;
+    default:
+        fprintf(stderr,"Unknown reply type: %d\n", r->type);
+        exit(1);
+    }
+    return out;
+}
+
+int isColorTerm(void) {
+    char *t = getenv("TERM");
+    return t != NULL && strstr(t,"xterm") != NULL;
+}
+
+/* Helper  function for sdsCatColorizedLdbReply() appending colorize strings
+ * to an SDS string. */
+sds sdscatcolor(sds o, char *s, size_t len, char *color) {
+    if (!isColorTerm()) return sdscatlen(o,s,len);
+
+    int bold = strstr(color,"bold") != NULL;
+    int ccode = 37; /* Defaults to white. */
+    if (strstr(color,"red")) ccode = 31;
+    else if (strstr(color,"green")) ccode = 32;
+    else if (strstr(color,"yellow")) ccode = 33;
+    else if (strstr(color,"blue")) ccode = 34;
+    else if (strstr(color,"magenta")) ccode = 35;
+    else if (strstr(color,"cyan")) ccode = 36;
+    else if (strstr(color,"white")) ccode = 37;
+
+    o = sdscatfmt(o,"\033[%i;%i;49m",bold,ccode);
+    o = sdscatlen(o,s,len);
+    o = sdscat(o,"\033[0m");
+    return o;
+}
+
+/* Colorize Lua debugger status replies according to the prefix they
+ * have. */
+sds sdsCatColorizedLdbReply(sds o, char *s, size_t len) {
+    char *color = "white";
+
+    if (strstr(s,"<debug>")) color = "bold";
+    if (strstr(s,"<redis>")) color = "green";
+    if (strstr(s,"<reply>")) color = "cyan";
+    if (strstr(s,"<error>")) color = "red";
+    if (strstr(s,"<hint>")) color = "bold";
+    if (strstr(s,"<value>") || strstr(s,"<retval>")) color = "magenta";
+    if (len > 4 && isdigit(s[3])) {
+        if (s[1] == '>') color = "yellow"; /* Current line. */
+        else if (s[2] == '#') color = "bold"; /* Break point. */
+    }
+    return sdscatcolor(o,s,len,color);
+}
+
+static sds cliFormatReplyRaw(redisReply *r) {
+    sds out = sdsempty(), tmp;
+    size_t i;
+
+    switch (r->type) {
+    case REDIS_REPLY_NIL:
+        /* Nothing... */
+        break;
+    case REDIS_REPLY_ERROR:
+        out = sdscatlen(out,r->str,r->len);
+        out = sdscatlen(out,"\n",1);
+        break;
+    case REDIS_REPLY_STATUS:
+    case REDIS_REPLY_STRING:
+    case REDIS_REPLY_VERB:
+        if (r->type == REDIS_REPLY_STATUS && config.eval_ldb) {
+            /* The Lua debugger replies with arrays of simple (status)
+             * strings. We colorize the output for more fun if this
+             * is a debugging session. */
+
+            /* Detect the end of a debugging session. */
+            if (strstr(r->str,"<endsession>") == r->str) {
+                config.enable_ldb_on_eval = 0;
+                config.eval_ldb = 0;
+                config.eval_ldb_end = 1; /* Signal the caller session ended. */
+                config.output = OUTPUT_STANDARD;
+                cliRefreshPrompt();
+            } else {
+                out = sdsCatColorizedLdbReply(out,r->str,r->len);
+            }
+        } else {
+            out = sdscatlen(out,r->str,r->len);
+        }
+        break;
+    case REDIS_REPLY_BOOL:
+        out = sdscat(out,r->integer ? "(true)" : "(false)");
+    break;
+    case REDIS_REPLY_INTEGER:
+        out = sdscatprintf(out,"%lld",r->integer);
+        break;
+    case REDIS_REPLY_DOUBLE:
+        out = sdscatprintf(out,"%s",r->str);
+        break;
+    case REDIS_REPLY_SET:
+    case REDIS_REPLY_ARRAY:
+    case REDIS_REPLY_PUSH:
+        for (i = 0; i < r->elements; i++) {
+            if (i > 0) out = sdscat(out,config.mb_delim);
+            tmp = cliFormatReplyRaw(r->element[i]);
+            out = sdscatlen(out,tmp,sdslen(tmp));
+            sdsfree(tmp);
+        }
+        break;
+    case REDIS_REPLY_MAP:
+        for (i = 0; i < r->elements; i += 2) {
+            if (i > 0) out = sdscat(out,config.mb_delim);
+            tmp = cliFormatReplyRaw(r->element[i]);
+            out = sdscatlen(out,tmp,sdslen(tmp));
+            sdsfree(tmp);
+
+            out = sdscatlen(out," ",1);
+            tmp = cliFormatReplyRaw(r->element[i+1]);
+            out = sdscatlen(out,tmp,sdslen(tmp));
+            sdsfree(tmp);
+        }
+        break;
+    default:
+        fprintf(stderr,"Unknown reply type: %d\n", r->type);
+        exit(1);
+    }
+    return out;
+}
+
+static sds cliFormatReplyCSV(redisReply *r) {
+    unsigned int i;
+
+    sds out = sdsempty();
+    switch (r->type) {
+    case REDIS_REPLY_ERROR:
+        out = sdscat(out,"ERROR,");
+        out = sdscatrepr(out,r->str,strlen(r->str));
+    break;
+    case REDIS_REPLY_STATUS:
+        out = sdscatrepr(out,r->str,r->len);
+    break;
+    case REDIS_REPLY_INTEGER:
+        out = sdscatprintf(out,"%lld",r->integer);
+    break;
+    case REDIS_REPLY_DOUBLE:
+        out = sdscatprintf(out,"%s",r->str);
+        break;
+    case REDIS_REPLY_STRING:
+    case REDIS_REPLY_VERB:
+        out = sdscatrepr(out,r->str,r->len);
+    break;
+    case REDIS_REPLY_NIL:
+        out = sdscat(out,"NULL");
+    break;
+    case REDIS_REPLY_BOOL:
+        out = sdscat(out,r->integer ? "true" : "false");
+    break;
+    case REDIS_REPLY_ARRAY:
+    case REDIS_REPLY_SET:
+    case REDIS_REPLY_PUSH:
+    case REDIS_REPLY_MAP: /* CSV has no map type, just output flat list. */
+        for (i = 0; i < r->elements; i++) {
+            sds tmp = cliFormatReplyCSV(r->element[i]);
+            out = sdscatlen(out,tmp,sdslen(tmp));
+            if (i != r->elements-1) out = sdscat(out,",");
+            sdsfree(tmp);
+        }
+    break;
+    default:
+        fprintf(stderr,"Unknown reply type: %d\n", r->type);
+        exit(1);
+    }
+    return out;
+}
+
+/* Generate reply strings in various output modes */
+static sds cliFormatReply(redisReply *reply, int mode, int verbatim) {
+    sds out;
+
+    if (verbatim) {
+        out = cliFormatReplyRaw(reply);
+    }  else if (mode == OUTPUT_STANDARD) {
+        out = cliFormatReplyTTY(reply, "");
+    } else if (mode == OUTPUT_RAW) {
+        out = cliFormatReplyRaw(reply);
+        out = sdscatsds(out, config.cmd_delim);
+    } else if (mode == OUTPUT_CSV) {
+        out = cliFormatReplyCSV(reply);
+        out = sdscatlen(out, "\n", 1);
+    } else {
+        fprintf(stderr, "Error:  Unknown output encoding %d\n", mode);
+        exit(1);
+    }
+
+    return out;
+}
+
+/* Output any spontaneous PUSH reply we receive */
+static void cliPushHandler(void *privdata, void *reply) {
+    UNUSED(privdata);
+    sds out;
+
+    if (config.output == OUTPUT_STANDARD && isInvalidateReply(reply)) {
+        out = cliFormatInvalidateTTY(reply);
+    } else {
+        out = cliFormatReply(reply, config.output, 0);
+    }
+
+    fwrite(out, sdslen(out), 1, stdout);
+
+    freeReplyObject(reply);
+    sdsfree(out);
+}
+
+static int cliReadReply(int output_raw_strings) {
+    void *_reply;
+    redisReply *reply;
+    sds out = NULL;
+    int output = 1;
+
+    if (redisGetReply(context,&_reply) != REDIS_OK) {
+        if (config.shutdown) {
+            redisFree(context);
+            context = NULL;
+            return REDIS_OK;
+        }
+        if (config.interactive) {
+            /* Filter cases where we should reconnect */
+            if (context->err == REDIS_ERR_IO &&
+                (errno == ECONNRESET || errno == EPIPE))
+                return REDIS_ERR;
+            if (context->err == REDIS_ERR_EOF)
+                return REDIS_ERR;
+        }
+        cliPrintContextError();
+        exit(1);
+        return REDIS_ERR; /* avoid compiler warning */
+    }
+
+    reply = (redisReply*)_reply;
+
+    config.last_cmd_type = reply->type;
+
+    /* Check if we need to connect to a different node and reissue the
+     * request. */
+    if (config.cluster_mode && reply->type == REDIS_REPLY_ERROR &&
+        (!strncmp(reply->str,"MOVED ",6) || !strncmp(reply->str,"ASK ",4)))
+    {
+        char *p = reply->str, *s;
+        int slot;
+
+        output = 0;
+        /* Comments show the position of the pointer as:
+         *
+         * [S] for pointer 's'
+         * [P] for pointer 'p'
+         */
+        s = strchr(p,' ');      /* MOVED[S]3999 127.0.0.1:6381 */
+        p = strchr(s+1,' ');    /* MOVED[S]3999[P]127.0.0.1:6381 */
+        *p = '\0';
+        slot = atoi(s+1);
+        s = strrchr(p+1,':');    /* MOVED 3999[P]127.0.0.1[S]6381 */
+        *s = '\0';
+        sdsfree(config.hostip);
+        config.hostip = sdsnew(p+1);
+        config.hostport = atoi(s+1);
+        if (config.interactive)
+            printf("-> Redirected to slot [%d] located at %s:%d\n",
+                slot, config.hostip, config.hostport);
+        config.cluster_reissue_command = 1;
+        if (!strncmp(reply->str,"ASK ",4)) {
+            config.cluster_send_asking = 1;
+        }
+        cliRefreshPrompt();
+    } else if (!config.interactive && config.set_errcode && 
+        reply->type == REDIS_REPLY_ERROR) 
+    {
+        fprintf(stderr,"%s\n",reply->str);
+        exit(1);
+        return REDIS_ERR; /* avoid compiler warning */
+    }
+
+    if (output) {
+        out = cliFormatReply(reply, config.output, output_raw_strings);
+        fwrite(out,sdslen(out),1,stdout);
+        fflush(stdout);
+        sdsfree(out);
+    }
+    freeReplyObject(reply);
+    return REDIS_OK;
+}
+
+static int cliSendCommand(int argc, char **argv, long repeat) {
+    char *command = argv[0];
+    size_t *argvlen;
+    int j, output_raw;
+
+    if (!config.eval_ldb && /* In debugging mode, let's pass "help" to Redis. */
+        (!strcasecmp(command,"help") || !strcasecmp(command,"?"))) {
+        cliOutputHelp(--argc, ++argv);
+        return REDIS_OK;
+    }
+
+    if (context == NULL) return REDIS_ERR;
+
+    output_raw = 0;
+    if (!strcasecmp(command,"info") ||
+        !strcasecmp(command,"lolwut") ||
+        (argc >= 2 && !strcasecmp(command,"debug") &&
+                       !strcasecmp(argv[1],"htstats")) ||
+        (argc >= 2 && !strcasecmp(command,"debug") &&
+                       !strcasecmp(argv[1],"htstats-key")) ||
+        (argc >= 2 && !strcasecmp(command,"memory") &&
+                      (!strcasecmp(argv[1],"malloc-stats") ||
+                       !strcasecmp(argv[1],"doctor"))) ||
+        (argc == 2 && !strcasecmp(command,"cluster") &&
+                      (!strcasecmp(argv[1],"nodes") ||
+                       !strcasecmp(argv[1],"info"))) ||
+        (argc >= 2 && !strcasecmp(command,"client") &&
+                       (!strcasecmp(argv[1],"list") ||
+                        !strcasecmp(argv[1],"info"))) ||
+        (argc == 3 && !strcasecmp(command,"latency") &&
+                       !strcasecmp(argv[1],"graph")) ||
+        (argc == 2 && !strcasecmp(command,"latency") &&
+                       !strcasecmp(argv[1],"doctor")) ||
+        /* Format PROXY INFO command for Redis Cluster Proxy:
+         * https://github.com/artix75/redis-cluster-proxy */
+        (argc >= 2 && !strcasecmp(command,"proxy") &&
+                       !strcasecmp(argv[1],"info")))
+    {
+        output_raw = 1;
+    }
+
+    if (!strcasecmp(command,"shutdown")) config.shutdown = 1;
+    if (!strcasecmp(command,"monitor")) config.monitor_mode = 1;
+    if (!strcasecmp(command,"subscribe") ||
+        !strcasecmp(command,"psubscribe")) config.pubsub_mode = 1;
+    if (!strcasecmp(command,"sync") ||
+        !strcasecmp(command,"psync")) config.slave_mode = 1;
+
+    /* When the user manually calls SCRIPT DEBUG, setup the activation of
+     * debugging mode on the next eval if needed. */
+    if (argc == 3 && !strcasecmp(argv[0],"script") &&
+                     !strcasecmp(argv[1],"debug"))
+    {
+        if (!strcasecmp(argv[2],"yes") || !strcasecmp(argv[2],"sync")) {
+            config.enable_ldb_on_eval = 1;
+        } else {
+            config.enable_ldb_on_eval = 0;
+        }
+    }
+
+    /* Actually activate LDB on EVAL if needed. */
+    if (!strcasecmp(command,"eval") && config.enable_ldb_on_eval) {
+        config.eval_ldb = 1;
+        config.output = OUTPUT_RAW;
+    }
+
+    /* Setup argument length */
+    argvlen = zmalloc(argc*sizeof(size_t));
+    for (j = 0; j < argc; j++)
+        argvlen[j] = sdslen(argv[j]);
+
+    /* Negative repeat is allowed and causes infinite loop,
+       works well with the interval option. */
+    while(repeat < 0 || repeat-- > 0) {
+        redisAppendCommandArgv(context,argc,(const char**)argv,argvlen);
+        while (config.monitor_mode) {
+            if (cliReadReply(output_raw) != REDIS_OK) exit(1);
+            fflush(stdout);
+        }
+
+        if (config.pubsub_mode) {
+            if (config.output != OUTPUT_RAW)
+                printf("Reading messages... (press Ctrl-C to quit)\n");
+
+            /* Unset our default PUSH handler so this works in RESP2/RESP3 */
+            redisSetPushCallback(context, NULL);
+
+            while (config.pubsub_mode) {
+                if (cliReadReply(output_raw) != REDIS_OK) exit(1);
+                if (config.last_cmd_type == REDIS_REPLY_ERROR) {
+                    if (config.push_output) {
+                        redisSetPushCallback(context, cliPushHandler);
+                    }
+                    config.pubsub_mode = 0;
+                }
+            }
+            continue;
+        }
+
+        if (config.slave_mode) {
+            printf("Entering replica output mode...  (press Ctrl-C to quit)\n");
+            slaveMode();
+            config.slave_mode = 0;
+            zfree(argvlen);
+            return REDIS_ERR;  /* Error = slaveMode lost connection to master */
+        }
+
+        if (cliReadReply(output_raw) != REDIS_OK) {
+            zfree(argvlen);
+            return REDIS_ERR;
+        } else {
+            /* Store database number when SELECT was successfully executed. */
+            if (!strcasecmp(command,"select") && argc == 2 && 
+                config.last_cmd_type != REDIS_REPLY_ERROR) 
+            {
+                config.input_dbnum = config.dbnum = atoi(argv[1]);
+                cliRefreshPrompt();
+            } else if (!strcasecmp(command,"auth") && (argc == 2 || argc == 3)) {
+                cliSelect();
+            } else if (!strcasecmp(command,"multi") && argc == 1 &&
+                config.last_cmd_type != REDIS_REPLY_ERROR) 
+            {
+                config.in_multi = 1;
+                config.pre_multi_dbnum = config.dbnum;
+                cliRefreshPrompt();
+            } else if (!strcasecmp(command,"exec") && argc == 1 && config.in_multi) {
+                config.in_multi = 0;
+                if (config.last_cmd_type == REDIS_REPLY_ERROR ||
+                    config.last_cmd_type == REDIS_REPLY_NIL)
+                {
+                    config.input_dbnum = config.dbnum = config.pre_multi_dbnum;
+                }
+                cliRefreshPrompt();
+            } else if (!strcasecmp(command,"discard") && argc == 1 && 
+                config.last_cmd_type != REDIS_REPLY_ERROR) 
+            {
+                config.in_multi = 0;
+                config.input_dbnum = config.dbnum = config.pre_multi_dbnum;
+                cliRefreshPrompt();
+            } 
+        }
+        if (config.cluster_reissue_command){
+            /* If we need to reissue the command, break to prevent a
+               further 'repeat' number of dud interactions */
+            break;
+        }
+        if (config.interval) usleep(config.interval);
+        fflush(stdout); /* Make it grep friendly */
+    }
+
+    zfree(argvlen);
+    return REDIS_OK;
+}
+
+/* Send a command reconnecting the link if needed. */
+static redisReply *reconnectingRedisCommand(redisContext *c, const char *fmt, ...) {
+    redisReply *reply = NULL;
+    int tries = 0;
+    va_list ap;
+
+    assert(!c->err);
+    while(reply == NULL) {
+        while (c->err & (REDIS_ERR_IO | REDIS_ERR_EOF)) {
+            printf("\r\x1b[0K"); /* Cursor to left edge + clear line. */
+            printf("Reconnecting... %d\r", ++tries);
+            fflush(stdout);
+
+            redisFree(c);
+            c = redisConnect(config.hostip,config.hostport);
+            if (!c->err && config.tls) {
+                const char *err = NULL;
+                if (cliSecureConnection(c, config.sslconfig, &err) == REDIS_ERR && err) {
+                    fprintf(stderr, "TLS Error: %s\n", err);
+                    exit(1);
+                }
+            }
+            usleep(1000000);
+        }
+
+        va_start(ap,fmt);
+        reply = redisvCommand(c,fmt,ap);
+        va_end(ap);
+
+        if (c->err && !(c->err & (REDIS_ERR_IO | REDIS_ERR_EOF))) {
+            fprintf(stderr, "Error: %s\n", c->errstr);
+            exit(1);
+        } else if (tries > 0) {
+            printf("\r\x1b[0K"); /* Cursor to left edge + clear line. */
+        }
+    }
+
+    context = c;
+    return reply;
+}
+
+/*------------------------------------------------------------------------------
+ * User interface
+ *--------------------------------------------------------------------------- */
+
+static int parseOptions(int argc, char **argv) {
+    int i;
+
+    for (i = 1; i < argc; i++) {
+        int lastarg = i==argc-1;
+
+        if (!strcmp(argv[i],"-h") && !lastarg) {
+            sdsfree(config.hostip);
+            config.hostip = sdsnew(argv[++i]);
+        } else if (!strcmp(argv[i],"-h") && lastarg) {
+            usage();
+        } else if (!strcmp(argv[i],"--help")) {
+            usage();
+        } else if (!strcmp(argv[i],"-x")) {
+            config.stdinarg = 1;
+        } else if (!strcmp(argv[i],"-p") && !lastarg) {
+            config.hostport = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"-s") && !lastarg) {
+            config.hostsocket = argv[++i];
+        } else if (!strcmp(argv[i],"-r") && !lastarg) {
+            config.repeat = strtoll(argv[++i],NULL,10);
+        } else if (!strcmp(argv[i],"-i") && !lastarg) {
+            double seconds = atof(argv[++i]);
+            config.interval = seconds*1000000;
+        } else if (!strcmp(argv[i],"-n") && !lastarg) {
+            config.input_dbnum = atoi(argv[++i]);
+        } else if (!strcmp(argv[i], "--no-auth-warning")) {
+            config.no_auth_warning = 1;
+        } else if (!strcmp(argv[i], "--askpass")) {
+            config.askpass = 1;
+        } else if ((!strcmp(argv[i],"-a") || !strcmp(argv[i],"--pass"))
+                   && !lastarg)
+        {
+            config.auth = argv[++i];
+        } else if (!strcmp(argv[i],"--user") && !lastarg) {
+            config.user = argv[++i];
+        } else if (!strcmp(argv[i],"-u") && !lastarg) {
+            parseRedisUri(argv[++i]);
+        } else if (!strcmp(argv[i],"--raw")) {
+            config.output = OUTPUT_RAW;
+        } else if (!strcmp(argv[i],"--no-raw")) {
+            config.output = OUTPUT_STANDARD;
+        } else if (!strcmp(argv[i],"--quoted-input")) {
+            config.quoted_input = 1;
+        } else if (!strcmp(argv[i],"--csv")) {
+            config.output = OUTPUT_CSV;
+        } else if (!strcmp(argv[i],"--latency")) {
+            config.latency_mode = 1;
+        } else if (!strcmp(argv[i],"--latency-dist")) {
+            config.latency_dist_mode = 1;
+        } else if (!strcmp(argv[i],"--mono")) {
+            spectrum_palette = spectrum_palette_mono;
+            spectrum_palette_size = spectrum_palette_mono_size;
+        } else if (!strcmp(argv[i],"--latency-history")) {
+            config.latency_mode = 1;
+            config.latency_history = 1;
+        } else if (!strcmp(argv[i],"--lru-test") && !lastarg) {
+            config.lru_test_mode = 1;
+            config.lru_test_sample_size = strtoll(argv[++i],NULL,10);
+        } else if (!strcmp(argv[i],"--slave")) {
+            config.slave_mode = 1;
+        } else if (!strcmp(argv[i],"--replica")) {
+            config.slave_mode = 1;
+        } else if (!strcmp(argv[i],"--stat")) {
+            config.stat_mode = 1;
+        } else if (!strcmp(argv[i],"--scan")) {
+            config.scan_mode = 1;
+        } else if (!strcmp(argv[i],"--pattern") && !lastarg) {
+            sdsfree(config.pattern);
+            config.pattern = sdsnew(argv[++i]);
+        } else if (!strcmp(argv[i],"--quoted-pattern") && !lastarg) {
+            sdsfree(config.pattern);
+            config.pattern = unquoteCString(argv[++i]);
+            if (!config.pattern) {
+                fprintf(stderr,"Invalid quoted string specified for --quoted-pattern.\n");
+                exit(1);
+            }
+        } else if (!strcmp(argv[i],"--intrinsic-latency") && !lastarg) {
+            config.intrinsic_latency_mode = 1;
+            config.intrinsic_latency_duration = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--rdb") && !lastarg) {
+            config.getrdb_mode = 1;
+            config.rdb_filename = argv[++i];
+        } else if (!strcmp(argv[i],"--pipe")) {
+            config.pipe_mode = 1;
+        } else if (!strcmp(argv[i],"--pipe-timeout") && !lastarg) {
+            config.pipe_timeout = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--bigkeys")) {
+            config.bigkeys = 1;
+        } else if (!strcmp(argv[i],"--memkeys")) {
+            config.memkeys = 1;
+            config.memkeys_samples = 0; /* use redis default */
+        } else if (!strcmp(argv[i],"--memkeys-samples")) {
+            config.memkeys = 1;
+            config.memkeys_samples = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--hotkeys")) {
+            config.hotkeys = 1;
+        } else if (!strcmp(argv[i],"--eval") && !lastarg) {
+            config.eval = argv[++i];
+        } else if (!strcmp(argv[i],"--ldb")) {
+            config.eval_ldb = 1;
+            config.output = OUTPUT_RAW;
+        } else if (!strcmp(argv[i],"--ldb-sync-mode")) {
+            config.eval_ldb = 1;
+            config.eval_ldb_sync = 1;
+            config.output = OUTPUT_RAW;
+        } else if (!strcmp(argv[i],"-c")) {
+            config.cluster_mode = 1;
+        } else if (!strcmp(argv[i],"-d") && !lastarg) {
+            sdsfree(config.mb_delim);
+            config.mb_delim = sdsnew(argv[++i]);
+        } else if (!strcmp(argv[i],"-D") && !lastarg) {
+            sdsfree(config.cmd_delim);
+            config.cmd_delim = sdsnew(argv[++i]);
+        } else if (!strcmp(argv[i],"-e")) {
+            config.set_errcode = 1;
+        } else if (!strcmp(argv[i],"--verbose")) {
+            config.verbose = 1;
+        } else if (!strcmp(argv[i],"--cluster") && !lastarg) {
+            if (CLUSTER_MANAGER_MODE()) usage();
+            char *cmd = argv[++i];
+            int j = i;
+            while (j < argc && argv[j][0] != '-') j++;
+            if (j > i) j--;
+            createClusterManagerCommand(cmd, j - i, argv + i + 1);
+            i = j;
+        } else if (!strcmp(argv[i],"--cluster") && lastarg) {
+            usage();
+        } else if ((!strcmp(argv[i],"--cluster-only-masters"))) {
+            config.cluster_manager_command.flags |=
+                    CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY;
+        } else if ((!strcmp(argv[i],"--cluster-only-replicas"))) {
+            config.cluster_manager_command.flags |=
+                    CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY;
+        } else if (!strcmp(argv[i],"--cluster-replicas") && !lastarg) {
+            config.cluster_manager_command.replicas = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--cluster-master-id") && !lastarg) {
+            config.cluster_manager_command.master_id = argv[++i];
+        } else if (!strcmp(argv[i],"--cluster-from") && !lastarg) {
+            config.cluster_manager_command.from = argv[++i];
+        } else if (!strcmp(argv[i],"--cluster-to") && !lastarg) {
+            config.cluster_manager_command.to = argv[++i];
+        } else if (!strcmp(argv[i],"--cluster-from-user") && !lastarg) {
+            config.cluster_manager_command.from_user = argv[++i];
+        } else if (!strcmp(argv[i],"--cluster-from-pass") && !lastarg) {
+            config.cluster_manager_command.from_pass = argv[++i];
+        } else if (!strcmp(argv[i], "--cluster-from-askpass")) {
+            config.cluster_manager_command.from_askpass = 1;
+        } else if (!strcmp(argv[i],"--cluster-weight") && !lastarg) {
+            if (config.cluster_manager_command.weight != NULL) {
+                fprintf(stderr, "WARNING: you cannot use --cluster-weight "
+                                "more than once.\n"
+                                "You can set more weights by adding them "
+                                "as a space-separated list, ie:\n"
+                                "--cluster-weight n1=w n2=w\n");
+                exit(1);
+            }
+            int widx = i + 1;
+            char **weight = argv + widx;
+            int wargc = 0;
+            for (; widx < argc; widx++) {
+                if (strstr(argv[widx], "--") == argv[widx]) break;
+                if (strchr(argv[widx], '=') == NULL) break;
+                wargc++;
+            }
+            if (wargc > 0) {
+                config.cluster_manager_command.weight = weight;
+                config.cluster_manager_command.weight_argc = wargc;
+                i += wargc;
+            }
+        } else if (!strcmp(argv[i],"--cluster-slots") && !lastarg) {
+            config.cluster_manager_command.slots = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--cluster-timeout") && !lastarg) {
+            config.cluster_manager_command.timeout = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--cluster-pipeline") && !lastarg) {
+            config.cluster_manager_command.pipeline = atoi(argv[++i]);
+        } else if (!strcmp(argv[i],"--cluster-threshold") && !lastarg) {
+            config.cluster_manager_command.threshold = atof(argv[++i]);
+        } else if (!strcmp(argv[i],"--cluster-yes")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_YES;
+        } else if (!strcmp(argv[i],"--cluster-simulate")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_SIMULATE;
+        } else if (!strcmp(argv[i],"--cluster-replace")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_REPLACE;
+        } else if (!strcmp(argv[i],"--cluster-copy")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_COPY;
+        } else if (!strcmp(argv[i],"--cluster-slave")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_SLAVE;
+        } else if (!strcmp(argv[i],"--cluster-use-empty-masters")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER;
+        } else if (!strcmp(argv[i],"--cluster-search-multiple-owners")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS;
+        } else if (!strcmp(argv[i],"--cluster-fix-with-unreachable-masters")) {
+            config.cluster_manager_command.flags |=
+                CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
+#ifdef USE_OPENSSL
+        } else if (!strcmp(argv[i],"--tls")) {
+            config.tls = 1;
+        } else if (!strcmp(argv[i],"--sni") && !lastarg) {
+            config.sslconfig.sni = argv[++i];
+        } else if (!strcmp(argv[i],"--cacertdir") && !lastarg) {
+            config.sslconfig.cacertdir = argv[++i];
+        } else if (!strcmp(argv[i],"--cacert") && !lastarg) {
+            config.sslconfig.cacert = argv[++i];
+        } else if (!strcmp(argv[i],"--cert") && !lastarg) {
+            config.sslconfig.cert = argv[++i];
+        } else if (!strcmp(argv[i],"--key") && !lastarg) {
+            config.sslconfig.key = argv[++i];
+        } else if (!strcmp(argv[i],"--tls-ciphers") && !lastarg) {
+            config.sslconfig.ciphers = argv[++i];
+        } else if (!strcmp(argv[i],"--insecure")) {
+            config.sslconfig.skip_cert_verify = 1;
+        #ifdef TLS1_3_VERSION
+        } else if (!strcmp(argv[i],"--tls-ciphersuites") && !lastarg) {
+            config.sslconfig.ciphersuites = argv[++i];
+        #endif
+#endif
+        } else if (!strcmp(argv[i],"-v") || !strcmp(argv[i], "--version")) {
+            sds version = cliVersion();
+            printf("redis-cli %s\n", version);
+            sdsfree(version);
+            exit(0);
+        } else if (!strcmp(argv[i],"-3")) {
+            config.resp3 = 1;
+        } else if (!strcmp(argv[i],"--show-pushes") && !lastarg) {
+            char *argval = argv[++i];
+            if (!strncasecmp(argval, "n", 1)) {
+                config.push_output = 0;
+            } else if (!strncasecmp(argval, "y", 1)) {
+                config.push_output = 1;
+            } else {
+                fprintf(stderr, "Unknown --show-pushes value '%s' "
+                        "(valid: '[y]es', '[n]o')\n", argval);
+            }
+        } else if (CLUSTER_MANAGER_MODE() && argv[i][0] != '-') {
+            if (config.cluster_manager_command.argc == 0) {
+                int j = i + 1;
+                while (j < argc && argv[j][0] != '-') j++;
+                int cmd_argc = j - i;
+                config.cluster_manager_command.argc = cmd_argc;
+                config.cluster_manager_command.argv = argv + i;
+                if (cmd_argc > 1) i = j - 1;
+            }
+        } else {
+            if (argv[i][0] == '-') {
+                fprintf(stderr,
+                    "Unrecognized option or bad number of args for: '%s'\n",
+                    argv[i]);
+                exit(1);
+            } else {
+                /* Likely the command name, stop here. */
+                break;
+            }
+        }
+    }
+
+    if (config.hostsocket && config.cluster_mode) {
+        fprintf(stderr,"Options -c and -s are mutually exclusive.\n");
+        exit(1);
+    }
+
+    /* --ldb requires --eval. */
+    if (config.eval_ldb && config.eval == NULL) {
+        fprintf(stderr,"Options --ldb and --ldb-sync-mode require --eval.\n");
+        fprintf(stderr,"Try %s --help for more information.\n", argv[0]);
+        exit(1);
+    }
+
+    if (!config.no_auth_warning && config.auth != NULL) {
+        fputs("Warning: Using a password with '-a' or '-u' option on the command"
+              " line interface may not be safe.\n", stderr);
+    }
+
+    return i;
+}
+
+static void parseEnv() {
+    /* Set auth from env, but do not overwrite CLI arguments if passed */
+    char *auth = getenv(REDIS_CLI_AUTH_ENV);
+    if (auth != NULL && config.auth == NULL) {
+        config.auth = auth;
+    }
+
+    char *cluster_yes = getenv(REDIS_CLI_CLUSTER_YES_ENV);
+    if (cluster_yes != NULL && !strcmp(cluster_yes, "1")) {
+        config.cluster_manager_command.flags |= CLUSTER_MANAGER_CMD_FLAG_YES;
+    }
+}
+
+static sds readArgFromStdin(void) {
+    char buf[1024];
+    sds arg = sdsempty();
+
+    while(1) {
+        int nread = read(fileno(stdin),buf,1024);
+
+        if (nread == 0) break;
+        else if (nread == -1) {
+            perror("Reading from standard input");
+            exit(1);
+        }
+        arg = sdscatlen(arg,buf,nread);
+    }
+    return arg;
+}
+
+static void usage(void) {
+    sds version = cliVersion();
+    fprintf(stderr,
+"redis-cli %s\n"
+"\n"
+"Usage: redis-cli [OPTIONS] [cmd [arg [arg ...]]]\n"
+"  -h <hostname>      Server hostname (default: 127.0.0.1).\n"
+"  -p <port>          Server port (default: 6379).\n"
+"  -s <socket>        Server socket (overrides hostname and port).\n"
+"  -a <password>      Password to use when connecting to the server.\n"
+"                     You can also use the " REDIS_CLI_AUTH_ENV " environment\n"
+"                     variable to pass this password more safely\n"
+"                     (if both are used, this argument takes precedence).\n"
+"  --user <username>  Used to send ACL style 'AUTH username pass'. Needs -a.\n"
+"  --pass <password>  Alias of -a for consistency with the new --user option.\n"
+"  --askpass          Force user to input password with mask from STDIN.\n"
+"                     If this argument is used, '-a' and " REDIS_CLI_AUTH_ENV "\n"
+"                     environment variable will be ignored.\n"
+"  -u <uri>           Server URI.\n"
+"  -r <repeat>        Execute specified command N times.\n"
+"  -i <interval>      When -r is used, waits <interval> seconds per command.\n"
+"                     It is possible to specify sub-second times like -i 0.1.\n"
+"  -n <db>            Database number.\n"
+"  -3                 Start session in RESP3 protocol mode.\n"
+"  -x                 Read last argument from STDIN.\n"
+"  -d <delimiter>     Delimiter between response bulks for raw formatting (default: \\n).\n"
+"  -D <delimiter>     Delimiter between responses for raw formatting (default: \\n).\n"
+"  -c                 Enable cluster mode (follow -ASK and -MOVED redirections).\n"
+"  -e                 Return exit error code when command execution fails.\n"
+#ifdef USE_OPENSSL
+"  --tls              Establish a secure TLS connection.\n"
+"  --sni <host>       Server name indication for TLS.\n"
+"  --cacert <file>    CA Certificate file to verify with.\n"
+"  --cacertdir <dir>  Directory where trusted CA certificates are stored.\n"
+"                     If neither cacert nor cacertdir are specified, the default\n"
+"                     system-wide trusted root certs configuration will apply.\n"
+"  --insecure         Allow insecure TLS connection by skipping cert validation.\n"
+"  --cert <file>      Client certificate to authenticate with.\n"
+"  --key <file>       Private key file to authenticate with.\n"
+"  --tls-ciphers <list> Sets the list of prefered ciphers (TLSv1.2 and below)\n"
+"                     in order of preference from highest to lowest separated by colon (\":\").\n"
+"                     See the ciphers(1ssl) manpage for more information about the syntax of this string.\n"
+#ifdef TLS1_3_VERSION
+"  --tls-ciphersuites <list> Sets the list of prefered ciphersuites (TLSv1.3)\n"
+"                     in order of preference from highest to lowest separated by colon (\":\").\n"
+"                     See the ciphers(1ssl) manpage for more information about the syntax of this string,\n"
+"                     and specifically for TLSv1.3 ciphersuites.\n"
+#endif
+#endif
+"  --raw              Use raw formatting for replies (default when STDOUT is\n"
+"                     not a tty).\n"
+"  --no-raw           Force formatted output even when STDOUT is not a tty.\n"
+"  --quoted-input     Force input to be handled as quoted strings.\n"
+"  --csv              Output in CSV format.\n"
+"  --show-pushes <yn> Whether to print RESP3 PUSH messages.  Enabled by default when\n"
+"                     STDOUT is a tty but can be overriden with --show-pushes no.\n"
+"  --stat             Print rolling stats about server: mem, clients, ...\n"
+"  --latency          Enter a special mode continuously sampling latency.\n"
+"                     If you use this mode in an interactive session it runs\n"
+"                     forever displaying real-time stats. Otherwise if --raw or\n"
+"                     --csv is specified, or if you redirect the output to a non\n"
+"                     TTY, it samples the latency for 1 second (you can use\n"
+"                     -i to change the interval), then produces a single output\n"
+"                     and exits.\n",version);
+
+    fprintf(stderr,
+"  --latency-history  Like --latency but tracking latency changes over time.\n"
+"                     Default time interval is 15 sec. Change it using -i.\n"
+"  --latency-dist     Shows latency as a spectrum, requires xterm 256 colors.\n"
+"                     Default time interval is 1 sec. Change it using -i.\n"
+"  --lru-test <keys>  Simulate a cache workload with an 80-20 distribution.\n"
+"  --replica          Simulate a replica showing commands received from the master.\n"
+"  --rdb <filename>   Transfer an RDB dump from remote server to local file.\n"
+"                     Use filename of \"-\" to write to stdout.\n"
+"  --pipe             Transfer raw Redis protocol from stdin to server.\n"
+"  --pipe-timeout <n> In --pipe mode, abort with error if after sending all data.\n"
+"                     no reply is received within <n> seconds.\n"
+"                     Default timeout: %d. Use 0 to wait forever.\n",
+    REDIS_CLI_DEFAULT_PIPE_TIMEOUT);
+    fprintf(stderr,
+"  --bigkeys          Sample Redis keys looking for keys with many elements (complexity).\n"
+"  --memkeys          Sample Redis keys looking for keys consuming a lot of memory.\n"
+"  --memkeys-samples <n> Sample Redis keys looking for keys consuming a lot of memory.\n"
+"                     And define number of key elements to sample\n"
+"  --hotkeys          Sample Redis keys looking for hot keys.\n"
+"                     only works when maxmemory-policy is *lfu.\n"
+"  --scan             List all keys using the SCAN command.\n"
+"  --pattern <pat>    Keys pattern when using the --scan, --bigkeys or --hotkeys\n"
+"                     options (default: *).\n"
+"  --quoted-pattern <pat> Same as --pattern, but the specified string can be\n"
+"                         quoted, in order to pass an otherwise non binary-safe string.\n"
+"  --intrinsic-latency <sec> Run a test to measure intrinsic system latency.\n"
+"                     The test will run for the specified amount of seconds.\n"
+"  --eval <file>      Send an EVAL command using the Lua script at <file>.\n"
+"  --ldb              Used with --eval enable the Redis Lua debugger.\n"
+"  --ldb-sync-mode    Like --ldb but uses the synchronous Lua debugger, in\n"
+"                     this mode the server is blocked and script changes are\n"
+"                     not rolled back from the server memory.\n"
+"  --cluster <command> [args...] [opts...]\n"
+"                     Cluster Manager command and arguments (see below).\n"
+"  --verbose          Verbose mode.\n"
+"  --no-auth-warning  Don't show warning message when using password on command\n"
+"                     line interface.\n"
+"  --help             Output this help and exit.\n"
+"  --version          Output version and exit.\n"
+"\n");
+    /* Using another fprintf call to avoid -Woverlength-strings compile warning */
+    fprintf(stderr,
+"Cluster Manager Commands:\n"
+"  Use --cluster help to list all available cluster manager commands.\n"
+"\n"
+"Examples:\n"
+"  cat /etc/passwd | redis-cli -x set mypasswd\n"
+"  redis-cli get mypasswd\n"
+"  redis-cli -r 100 lpush mylist x\n"
+"  redis-cli -r 100 -i 1 info | grep used_memory_human:\n"
+"  redis-cli --quoted-input set '\"null-\\x00-separated\"' value\n"
+"  redis-cli --eval myscript.lua key1 key2 , arg1 arg2 arg3\n"
+"  redis-cli --scan --pattern '*:12345*'\n"
+"\n"
+"  (Note: when using --eval the comma separates KEYS[] from ARGV[] items)\n"
+"\n"
+"When no command is given, redis-cli starts in interactive mode.\n"
+"Type \"help\" in interactive mode for information on available commands\n"
+"and settings.\n"
+"\n");
+    sdsfree(version);
+    exit(1);
+}
+
+static int confirmWithYes(char *msg, int ignore_force) {
+    /* if --cluster-yes option is set and ignore_force is false,
+     * do not prompt for an answer */
+    if (!ignore_force &&
+        (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_YES)) {
+        return 1;
+    }
+
+    printf("%s (type 'yes' to accept): ", msg);
+    fflush(stdout);
+    char buf[4];
+    int nread = read(fileno(stdin),buf,4);
+    buf[3] = '\0';
+    return (nread != 0 && !strcmp("yes", buf));
+}
+
+/* Create an sds array from argv, either as-is or by dequoting every
+ * element. When quoted is non-zero, may return a NULL to indicate an
+ * invalid quoted string.
+ */
+static sds *getSdsArrayFromArgv(int argc, char **argv, int quoted) {
+    sds *res = sds_malloc(sizeof(sds) * argc);
+
+    for (int j = 0; j < argc; j++) {
+        if (quoted) {
+            sds unquoted = unquoteCString(argv[j]);
+            if (!unquoted) {
+                while (--j >= 0) sdsfree(res[j]);
+                sds_free(res);
+                return NULL;
+            }
+            res[j] = unquoted;
+        } else {
+            res[j] = sdsnew(argv[j]);
+        }
+    }
+
+    return res;
+}
+
+static int issueCommandRepeat(int argc, char **argv, long repeat) {
+    while (1) {
+        if (config.cluster_reissue_command || context == NULL ||
+            context->err == REDIS_ERR_IO || context->err == REDIS_ERR_EOF)
+        {
+            if (cliConnect(CC_FORCE) != REDIS_OK) {
+                cliPrintContextError();
+                config.cluster_reissue_command = 0;
+                return REDIS_ERR;
+            }
+        }
+        config.cluster_reissue_command = 0;
+        if (config.cluster_send_asking) {
+            if (cliSendAsking() != REDIS_OK) {
+                cliPrintContextError();
+                return REDIS_ERR;
+            }
+        }
+        if (cliSendCommand(argc,argv,repeat) != REDIS_OK) {
+            cliPrintContextError();
+            return REDIS_ERR;
+        }
+
+        /* Issue the command again if we got redirected in cluster mode */
+        if (config.cluster_mode && config.cluster_reissue_command) {
+            continue;
+        }
+        break;
+    }
+    return REDIS_OK;
+}
+
+static int issueCommand(int argc, char **argv) {
+    return issueCommandRepeat(argc, argv, config.repeat);
+}
+
+/* Split the user provided command into multiple SDS arguments.
+ * This function normally uses sdssplitargs() from sds.c which is able
+ * to understand "quoted strings", escapes and so forth. However when
+ * we are in Lua debugging mode and the "eval" command is used, we want
+ * the remaining Lua script (after "e " or "eval ") to be passed verbatim
+ * as a single big argument. */
+static sds *cliSplitArgs(char *line, int *argc) {
+    if (config.eval_ldb && (strstr(line,"eval ") == line ||
+                            strstr(line,"e ") == line))
+    {
+        sds *argv = sds_malloc(sizeof(sds)*2);
+        *argc = 2;
+        int len = strlen(line);
+        int elen = line[1] == ' ' ? 2 : 5; /* "e " or "eval "? */
+        argv[0] = sdsnewlen(line,elen-1);
+        argv[1] = sdsnewlen(line+elen,len-elen);
+        return argv;
+    } else {
+        return sdssplitargs(line,argc);
+    }
+}
+
+/* Set the CLI preferences. This function is invoked when an interactive
+ * ":command" is called, or when reading ~/.redisclirc file, in order to
+ * set user preferences. */
+void cliSetPreferences(char **argv, int argc, int interactive) {
+    if (!strcasecmp(argv[0],":set") && argc >= 2) {
+        if (!strcasecmp(argv[1],"hints")) pref.hints = 1;
+        else if (!strcasecmp(argv[1],"nohints")) pref.hints = 0;
+        else {
+            printf("%sunknown redis-cli preference '%s'\n",
+                interactive ? "" : ".redisclirc: ",
+                argv[1]);
+        }
+    } else {
+        printf("%sunknown redis-cli internal command '%s'\n",
+            interactive ? "" : ".redisclirc: ",
+            argv[0]);
+    }
+}
+
+/* Load the ~/.redisclirc file if any. */
+void cliLoadPreferences(void) {
+    sds rcfile = getDotfilePath(REDIS_CLI_RCFILE_ENV,REDIS_CLI_RCFILE_DEFAULT);
+    if (rcfile == NULL) return;
+    FILE *fp = fopen(rcfile,"r");
+    char buf[1024];
+
+    if (fp) {
+        while(fgets(buf,sizeof(buf),fp) != NULL) {
+            sds *argv;
+            int argc;
+
+            argv = sdssplitargs(buf,&argc);
+            if (argc > 0) cliSetPreferences(argv,argc,0);
+            sdsfreesplitres(argv,argc);
+        }
+        fclose(fp);
+    }
+    sdsfree(rcfile);
+}
+
+static void repl(void) {
+    sds historyfile = NULL;
+    int history = 0;
+    char *line;
+    int argc;
+    sds *argv;
+
+    /* Initialize the help and, if possible, use the COMMAND command in order
+     * to retrieve missing entries. */
+    cliInitHelp();
+    cliIntegrateHelp();
+
+    config.interactive = 1;
+    linenoiseSetMultiLine(1);
+    linenoiseSetCompletionCallback(completionCallback);
+    linenoiseSetHintsCallback(hintsCallback);
+    linenoiseSetFreeHintsCallback(freeHintsCallback);
+
+    /* Only use history and load the rc file when stdin is a tty. */
+    if (isatty(fileno(stdin))) {
+        historyfile = getDotfilePath(REDIS_CLI_HISTFILE_ENV,REDIS_CLI_HISTFILE_DEFAULT);
+        //keep in-memory history always regardless if history file can be determined
+        history = 1;
+        if (historyfile != NULL) {
+            linenoiseHistoryLoad(historyfile);
+        }
+        cliLoadPreferences();
+    }
+
+    cliRefreshPrompt();
+    while((line = linenoise(context ? config.prompt : "not connected> ")) != NULL) {
+        if (line[0] != '\0') {
+            long repeat = 1;
+            int skipargs = 0;
+            char *endptr = NULL;
+
+            argv = cliSplitArgs(line,&argc);
+
+            /* check if we have a repeat command option and
+             * need to skip the first arg */
+            if (argv && argc > 0) {
+                errno = 0;
+                repeat = strtol(argv[0], &endptr, 10);
+                if (argc > 1 && *endptr == '\0') {
+                    if (errno == ERANGE || errno == EINVAL || repeat <= 0) {
+                        fputs("Invalid redis-cli repeat command option value.\n", stdout);
+                        sdsfreesplitres(argv, argc);
+                        linenoiseFree(line);
+                        continue;
+                    }
+                    skipargs = 1;
+                } else {
+                    repeat = 1;
+                }
+            }
+
+            /* Won't save auth or acl setuser commands in history file */
+            int dangerous = 0;
+            if (argv && argc > 0) {
+                if (!strcasecmp(argv[skipargs], "auth")) {
+                    dangerous = 1;
+                } else if (skipargs+1 < argc &&
+                           !strcasecmp(argv[skipargs], "acl") &&
+                           !strcasecmp(argv[skipargs+1], "setuser"))
+                {
+                    dangerous = 1;
+                }
+            }
+
+            if (!dangerous) {
+                if (history) linenoiseHistoryAdd(line);
+                if (historyfile) linenoiseHistorySave(historyfile);
+            }
+
+            if (argv == NULL) {
+                printf("Invalid argument(s)\n");
+                fflush(stdout);
+                linenoiseFree(line);
+                continue;
+            } else if (argc > 0) {
+                if (strcasecmp(argv[0],"quit") == 0 ||
+                    strcasecmp(argv[0],"exit") == 0)
+                {
+                    exit(0);
+                } else if (argv[0][0] == ':') {
+                    cliSetPreferences(argv,argc,1);
+                    sdsfreesplitres(argv,argc);
+                    linenoiseFree(line);
+                    continue;
+                } else if (strcasecmp(argv[0],"restart") == 0) {
+                    if (config.eval) {
+                        config.eval_ldb = 1;
+                        config.output = OUTPUT_RAW;
+                        sdsfreesplitres(argv,argc);
+                        linenoiseFree(line);
+                        return; /* Return to evalMode to restart the session. */
+                    } else {
+                        printf("Use 'restart' only in Lua debugging mode.");
+                    }
+                } else if (argc == 3 && !strcasecmp(argv[0],"connect")) {
+                    sdsfree(config.hostip);
+                    config.hostip = sdsnew(argv[1]);
+                    config.hostport = atoi(argv[2]);
+                    cliRefreshPrompt();
+                    cliConnect(CC_FORCE);
+                } else if (argc == 1 && !strcasecmp(argv[0],"clear")) {
+                    linenoiseClearScreen();
+                } else {
+                    long long start_time = mstime(), elapsed;
+
+                    issueCommandRepeat(argc-skipargs, argv+skipargs, repeat);
+
+                    /* If our debugging session ended, show the EVAL final
+                     * reply. */
+                    if (config.eval_ldb_end) {
+                        config.eval_ldb_end = 0;
+                        cliReadReply(0);
+                        printf("\n(Lua debugging session ended%s)\n\n",
+                            config.eval_ldb_sync ? "" :
+                            " -- dataset changes rolled back");
+                    }
+
+                    elapsed = mstime()-start_time;
+                    if (elapsed >= 500 &&
+                        config.output == OUTPUT_STANDARD)
+                    {
+                        printf("(%.2fs)\n",(double)elapsed/1000);
+                    }
+                }
+            }
+            /* Free the argument vector */
+            sdsfreesplitres(argv,argc);
+        }
+        /* linenoise() returns malloc-ed lines like readline() */
+        linenoiseFree(line);
+    }
+    exit(0);
+}
+
+static int noninteractive(int argc, char **argv) {
+    int retval = 0;
+    sds *sds_args = getSdsArrayFromArgv(argc, argv, config.quoted_input);
+    if (!sds_args) {
+        printf("Invalid quoted string\n");
+        return 1;
+    }
+    if (config.stdinarg) {
+        sds_args = sds_realloc(sds_args, (argc + 1) * sizeof(sds));
+        sds_args[argc] = readArgFromStdin();
+        argc++;
+    }
+
+    retval = issueCommand(argc, sds_args);
+    sdsfreesplitres(sds_args, argc);
+    return retval;
+}
+
+/*------------------------------------------------------------------------------
+ * Eval mode
+ *--------------------------------------------------------------------------- */
+
+static int evalMode(int argc, char **argv) {
+    sds script = NULL;
+    FILE *fp;
+    char buf[1024];
+    size_t nread;
+    char **argv2;
+    int j, got_comma, keys;
+    int retval = REDIS_OK;
+
+    while(1) {
+        if (config.eval_ldb) {
+            printf(
+            "Lua debugging session started, please use:\n"
+            "quit    -- End the session.\n"
+            "restart -- Restart the script in debug mode again.\n"
+            "help    -- Show Lua script debugging commands.\n\n"
+            );
+        }
+
+        sdsfree(script);
+        script = sdsempty();
+        got_comma = 0;
+        keys = 0;
+
+        /* Load the script from the file, as an sds string. */
+        fp = fopen(config.eval,"r");
+        if (!fp) {
+            fprintf(stderr,
+                "Can't open file '%s': %s\n", config.eval, strerror(errno));
+            exit(1);
+        }
+        while((nread = fread(buf,1,sizeof(buf),fp)) != 0) {
+            script = sdscatlen(script,buf,nread);
+        }
+        fclose(fp);
+
+        /* If we are debugging a script, enable the Lua debugger. */
+        if (config.eval_ldb) {
+            redisReply *reply = redisCommand(context,
+                    config.eval_ldb_sync ?
+                    "SCRIPT DEBUG sync": "SCRIPT DEBUG yes");
+            if (reply) freeReplyObject(reply);
+        }
+
+        /* Create our argument vector */
+        argv2 = zmalloc(sizeof(sds)*(argc+3));
+        argv2[0] = sdsnew("EVAL");
+        argv2[1] = script;
+        for (j = 0; j < argc; j++) {
+            if (!got_comma && argv[j][0] == ',' && argv[j][1] == 0) {
+                got_comma = 1;
+                continue;
+            }
+            argv2[j+3-got_comma] = sdsnew(argv[j]);
+            if (!got_comma) keys++;
+        }
+        argv2[2] = sdscatprintf(sdsempty(),"%d",keys);
+
+        /* Call it */
+        int eval_ldb = config.eval_ldb; /* Save it, may be reverted. */
+        retval = issueCommand(argc+3-got_comma, argv2);
+        if (eval_ldb) {
+            if (!config.eval_ldb) {
+                /* If the debugging session ended immediately, there was an
+                 * error compiling the script. Show it and they don't enter
+                 * the REPL at all. */
+                printf("Eval debugging session can't start:\n");
+                cliReadReply(0);
+                break; /* Return to the caller. */
+            } else {
+                strncpy(config.prompt,"lua debugger> ",sizeof(config.prompt));
+                repl();
+                /* Restart the session if repl() returned. */
+                cliConnect(CC_FORCE);
+                printf("\n");
+            }
+        } else {
+            break; /* Return to the caller. */
+        }
+    }
+    return retval;
+}
+
+/*------------------------------------------------------------------------------
+ * Cluster Manager
+ *--------------------------------------------------------------------------- */
+
+/* The Cluster Manager global structure */
+static struct clusterManager {
+    list *nodes;    /* List of nodes in the configuration. */
+    list *errors;
+    int unreachable_masters;    /* Masters we are not able to reach. */
+} cluster_manager;
+
+/* Used by clusterManagerFixSlotsCoverage */
+dict *clusterManagerUncoveredSlots = NULL;
+
+typedef struct clusterManagerNode {
+    redisContext *context;
+    sds name;
+    char *ip;
+    int port;
+    uint64_t current_epoch;
+    time_t ping_sent;
+    time_t ping_recv;
+    int flags;
+    list *flags_str; /* Flags string representations */
+    sds replicate;  /* Master ID if node is a slave */
+    int dirty;      /* Node has changes that can be flushed */
+    uint8_t slots[CLUSTER_MANAGER_SLOTS];
+    int slots_count;
+    int replicas_count;
+    list *friends;
+    sds *migrating; /* An array of sds where even strings are slots and odd
+                     * strings are the destination node IDs. */
+    sds *importing; /* An array of sds where even strings are slots and odd
+                     * strings are the source node IDs. */
+    int migrating_count; /* Length of the migrating array (migrating slots*2) */
+    int importing_count; /* Length of the importing array (importing slots*2) */
+    float weight;   /* Weight used by rebalance */
+    int balance;    /* Used by rebalance */
+} clusterManagerNode;
+
+/* Data structure used to represent a sequence of cluster nodes. */
+typedef struct clusterManagerNodeArray {
+    clusterManagerNode **nodes; /* Actual nodes array */
+    clusterManagerNode **alloc; /* Pointer to the allocated memory */
+    int len;                    /* Actual length of the array */
+    int count;                  /* Non-NULL nodes count */
+} clusterManagerNodeArray;
+
+/* Used for the reshard table. */
+typedef struct clusterManagerReshardTableItem {
+    clusterManagerNode *source;
+    int slot;
+} clusterManagerReshardTableItem;
+
+/* Info about a cluster internal link. */
+
+typedef struct clusterManagerLink {
+    sds node_name;
+    sds node_addr;
+    int connected;
+    int handshaking;
+} clusterManagerLink;
+
+static dictType clusterManagerDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* key destructor */
+    dictSdsDestructor,         /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+static dictType clusterManagerLinkDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    dictSdsDestructor,         /* key destructor */
+    dictListDestructor,        /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+typedef int clusterManagerCommandProc(int argc, char **argv);
+typedef int (*clusterManagerOnReplyError)(redisReply *reply,
+    clusterManagerNode *n, int bulk_idx);
+
+/* Cluster Manager helper functions */
+
+static clusterManagerNode *clusterManagerNewNode(char *ip, int port);
+static clusterManagerNode *clusterManagerNodeByName(const char *name);
+static clusterManagerNode *clusterManagerNodeByAbbreviatedName(const char *n);
+static void clusterManagerNodeResetSlots(clusterManagerNode *node);
+static int clusterManagerNodeIsCluster(clusterManagerNode *node, char **err);
+static void clusterManagerPrintNotClusterNodeError(clusterManagerNode *node,
+                                                   char *err);
+static int clusterManagerNodeLoadInfo(clusterManagerNode *node, int opts,
+                                      char **err);
+static int clusterManagerLoadInfoFromNode(clusterManagerNode *node, int opts);
+static int clusterManagerNodeIsEmpty(clusterManagerNode *node, char **err);
+static int clusterManagerGetAntiAffinityScore(clusterManagerNodeArray *ipnodes,
+    int ip_count, clusterManagerNode ***offending, int *offending_len);
+static void clusterManagerOptimizeAntiAffinity(clusterManagerNodeArray *ipnodes,
+    int ip_count);
+static sds clusterManagerNodeInfo(clusterManagerNode *node, int indent);
+static void clusterManagerShowNodes(void);
+static void clusterManagerShowClusterInfo(void);
+static int clusterManagerFlushNodeConfig(clusterManagerNode *node, char **err);
+static void clusterManagerWaitForClusterJoin(void);
+static int clusterManagerCheckCluster(int quiet);
+static void clusterManagerLog(int level, const char* fmt, ...);
+static int clusterManagerIsConfigConsistent(void);
+static dict *clusterManagerGetLinkStatus(void);
+static void clusterManagerOnError(sds err);
+static void clusterManagerNodeArrayInit(clusterManagerNodeArray *array,
+                                        int len);
+static void clusterManagerNodeArrayReset(clusterManagerNodeArray *array);
+static void clusterManagerNodeArrayShift(clusterManagerNodeArray *array,
+                                         clusterManagerNode **nodeptr);
+static void clusterManagerNodeArrayAdd(clusterManagerNodeArray *array,
+                                       clusterManagerNode *node);
+
+/* Cluster Manager commands. */
+
+static int clusterManagerCommandCreate(int argc, char **argv);
+static int clusterManagerCommandAddNode(int argc, char **argv);
+static int clusterManagerCommandDeleteNode(int argc, char **argv);
+static int clusterManagerCommandInfo(int argc, char **argv);
+static int clusterManagerCommandCheck(int argc, char **argv);
+static int clusterManagerCommandFix(int argc, char **argv);
+static int clusterManagerCommandReshard(int argc, char **argv);
+static int clusterManagerCommandRebalance(int argc, char **argv);
+static int clusterManagerCommandSetTimeout(int argc, char **argv);
+static int clusterManagerCommandImport(int argc, char **argv);
+static int clusterManagerCommandCall(int argc, char **argv);
+static int clusterManagerCommandHelp(int argc, char **argv);
+static int clusterManagerCommandBackup(int argc, char **argv);
+
+typedef struct clusterManagerCommandDef {
+    char *name;
+    clusterManagerCommandProc *proc;
+    int arity;
+    char *args;
+    char *options;
+} clusterManagerCommandDef;
+
+clusterManagerCommandDef clusterManagerCommands[] = {
+    {"create", clusterManagerCommandCreate, -2, "host1:port1 ... hostN:portN",
+     "replicas <arg>"},
+    {"check", clusterManagerCommandCheck, -1, "host:port",
+     "search-multiple-owners"},
+    {"info", clusterManagerCommandInfo, -1, "host:port", NULL},
+    {"fix", clusterManagerCommandFix, -1, "host:port",
+     "search-multiple-owners,fix-with-unreachable-masters"},
+    {"reshard", clusterManagerCommandReshard, -1, "host:port",
+     "from <arg>,to <arg>,slots <arg>,yes,timeout <arg>,pipeline <arg>,"
+     "replace"},
+    {"rebalance", clusterManagerCommandRebalance, -1, "host:port",
+     "weight <node1=w1...nodeN=wN>,use-empty-masters,"
+     "timeout <arg>,simulate,pipeline <arg>,threshold <arg>,replace"},
+    {"add-node", clusterManagerCommandAddNode, 2,
+     "new_host:new_port existing_host:existing_port", "slave,master-id <arg>"},
+    {"del-node", clusterManagerCommandDeleteNode, 2, "host:port node_id",NULL},
+    {"call", clusterManagerCommandCall, -2,
+        "host:port command arg arg .. arg", "only-masters,only-replicas"},
+    {"set-timeout", clusterManagerCommandSetTimeout, 2,
+     "host:port milliseconds", NULL},
+    {"import", clusterManagerCommandImport, 1, "host:port",
+     "from <arg>,from-user <arg>,from-pass <arg>,from-askpass,copy,replace"},
+    {"backup", clusterManagerCommandBackup, 2,  "host:port backup_directory",
+     NULL},
+    {"help", clusterManagerCommandHelp, 0, NULL, NULL}
+};
+
+typedef struct clusterManagerOptionDef {
+    char *name;
+    char *desc;
+} clusterManagerOptionDef;
+
+clusterManagerOptionDef clusterManagerOptions[] = {
+    {"--cluster-yes", "Automatic yes to cluster commands prompts"}
+};
+
+static void getRDB(clusterManagerNode *node);
+
+static void createClusterManagerCommand(char *cmdname, int argc, char **argv) {
+    clusterManagerCommand *cmd = &config.cluster_manager_command;
+    cmd->name = cmdname;
+    cmd->argc = argc;
+    cmd->argv = argc ? argv : NULL;
+    if (isColorTerm()) cmd->flags |= CLUSTER_MANAGER_CMD_FLAG_COLOR;
+}
+
+
+static clusterManagerCommandProc *validateClusterManagerCommand(void) {
+    int i, commands_count = sizeof(clusterManagerCommands) /
+                            sizeof(clusterManagerCommandDef);
+    clusterManagerCommandProc *proc = NULL;
+    char *cmdname = config.cluster_manager_command.name;
+    int argc = config.cluster_manager_command.argc;
+    for (i = 0; i < commands_count; i++) {
+        clusterManagerCommandDef cmddef = clusterManagerCommands[i];
+        if (!strcmp(cmddef.name, cmdname)) {
+            if ((cmddef.arity > 0 && argc != cmddef.arity) ||
+                (cmddef.arity < 0 && argc < (cmddef.arity * -1))) {
+                fprintf(stderr, "[ERR] Wrong number of arguments for "
+                                "specified --cluster sub command\n");
+                return NULL;
+            }
+            proc = cmddef.proc;
+        }
+    }
+    if (!proc) fprintf(stderr, "Unknown --cluster subcommand\n");
+    return proc;
+}
+
+static int parseClusterNodeAddress(char *addr, char **ip_ptr, int *port_ptr,
+                                   int *bus_port_ptr)
+{
+    char *c = strrchr(addr, '@');
+    if (c != NULL) {
+        *c = '\0';
+        if (bus_port_ptr != NULL)
+            *bus_port_ptr = atoi(c + 1);
+    }
+    c = strrchr(addr, ':');
+    if (c != NULL) {
+        *c = '\0';
+        *ip_ptr = addr;
+        *port_ptr = atoi(++c);
+    } else return 0;
+    return 1;
+}
+
+/* Get host ip and port from command arguments. If only one argument has
+ * been provided it must be in the form of 'ip:port', elsewhere
+ * the first argument must be the ip and the second one the port.
+ * If host and port can be detected, it returns 1 and it stores host and
+ * port into variables referenced by'ip_ptr' and 'port_ptr' pointers,
+ * elsewhere it returns 0. */
+static int getClusterHostFromCmdArgs(int argc, char **argv,
+                                     char **ip_ptr, int *port_ptr) {
+    int port = 0;
+    char *ip = NULL;
+    if (argc == 1) {
+        char *addr = argv[0];
+        if (!parseClusterNodeAddress(addr, &ip, &port, NULL)) return 0;
+    } else {
+        ip = argv[0];
+        port = atoi(argv[1]);
+    }
+    if (!ip || !port) return 0;
+    else {
+        *ip_ptr = ip;
+        *port_ptr = port;
+    }
+    return 1;
+}
+
+static void freeClusterManagerNodeFlags(list *flags) {
+    listIter li;
+    listNode *ln;
+    listRewind(flags, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        sds flag = ln->value;
+        sdsfree(flag);
+    }
+    listRelease(flags);
+}
+
+static void freeClusterManagerNode(clusterManagerNode *node) {
+    if (node->context != NULL) redisFree(node->context);
+    if (node->friends != NULL) {
+        listIter li;
+        listNode *ln;
+        listRewind(node->friends,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *fn = ln->value;
+            freeClusterManagerNode(fn);
+        }
+        listRelease(node->friends);
+        node->friends = NULL;
+    }
+    if (node->name != NULL) sdsfree(node->name);
+    if (node->replicate != NULL) sdsfree(node->replicate);
+    if ((node->flags & CLUSTER_MANAGER_FLAG_FRIEND) && node->ip)
+        sdsfree(node->ip);
+    int i;
+    if (node->migrating != NULL) {
+        for (i = 0; i < node->migrating_count; i++) sdsfree(node->migrating[i]);
+        zfree(node->migrating);
+    }
+    if (node->importing != NULL) {
+        for (i = 0; i < node->importing_count; i++) sdsfree(node->importing[i]);
+        zfree(node->importing);
+    }
+    if (node->flags_str != NULL) {
+        freeClusterManagerNodeFlags(node->flags_str);
+        node->flags_str = NULL;
+    }
+    zfree(node);
+}
+
+static void freeClusterManager(void) {
+    listIter li;
+    listNode *ln;
+    if (cluster_manager.nodes != NULL) {
+        listRewind(cluster_manager.nodes,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            freeClusterManagerNode(n);
+        }
+        listRelease(cluster_manager.nodes);
+        cluster_manager.nodes = NULL;
+    }
+    if (cluster_manager.errors != NULL) {
+        listRewind(cluster_manager.errors,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            sds err = ln->value;
+            sdsfree(err);
+        }
+        listRelease(cluster_manager.errors);
+        cluster_manager.errors = NULL;
+    }
+    if (clusterManagerUncoveredSlots != NULL)
+        dictRelease(clusterManagerUncoveredSlots);
+}
+
+static clusterManagerNode *clusterManagerNewNode(char *ip, int port) {
+    clusterManagerNode *node = zmalloc(sizeof(*node));
+    node->context = NULL;
+    node->name = NULL;
+    node->ip = ip;
+    node->port = port;
+    node->current_epoch = 0;
+    node->ping_sent = 0;
+    node->ping_recv = 0;
+    node->flags = 0;
+    node->flags_str = NULL;
+    node->replicate = NULL;
+    node->dirty = 0;
+    node->friends = NULL;
+    node->migrating = NULL;
+    node->importing = NULL;
+    node->migrating_count = 0;
+    node->importing_count = 0;
+    node->replicas_count = 0;
+    node->weight = 1.0f;
+    node->balance = 0;
+    clusterManagerNodeResetSlots(node);
+    return node;
+}
+
+static sds clusterManagerGetNodeRDBFilename(clusterManagerNode *node) {
+    assert(config.cluster_manager_command.backup_dir);
+    sds filename = sdsnew(config.cluster_manager_command.backup_dir);
+    if (filename[sdslen(filename) - 1] != '/')
+        filename = sdscat(filename, "/");
+    filename = sdscatprintf(filename, "redis-node-%s-%d-%s.rdb", node->ip,
+                            node->port, node->name);
+    return filename;
+}
+
+/* Check whether reply is NULL or its type is REDIS_REPLY_ERROR. In the
+ * latest case, if the 'err' arg is not NULL, it gets allocated with a copy
+ * of reply error (it's up to the caller function to free it), elsewhere
+ * the error is directly printed. */
+static int clusterManagerCheckRedisReply(clusterManagerNode *n,
+                                         redisReply *r, char **err)
+{
+    int is_err = 0;
+    if (!r || (is_err = (r->type == REDIS_REPLY_ERROR))) {
+        if (is_err) {
+            if (err != NULL) {
+                *err = zmalloc((r->len + 1) * sizeof(char));
+                strcpy(*err, r->str);
+            } else CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, r->str);
+        }
+        return 0;
+    }
+    return 1;
+}
+
+/* Call MULTI command on a cluster node. */
+static int clusterManagerStartTransaction(clusterManagerNode *node) {
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "MULTI");
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+/* Call EXEC command on a cluster node. */
+static int clusterManagerExecTransaction(clusterManagerNode *node,
+                                         clusterManagerOnReplyError onerror)
+{
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "EXEC");
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (success) {
+        if (reply->type != REDIS_REPLY_ARRAY) {
+            success = 0;
+            goto cleanup;
+        }
+        size_t i;
+        for (i = 0; i < reply->elements; i++) {
+            redisReply *r = reply->element[i];
+            char *err = NULL;
+            success = clusterManagerCheckRedisReply(node, r, &err);
+            if (!success && onerror) success = onerror(r, node, i);
+            if (err) {
+                if (!success)
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+                zfree(err);
+            }
+            if (!success) break;
+        }
+    }
+cleanup:
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+static int clusterManagerNodeConnect(clusterManagerNode *node) {
+    if (node->context) redisFree(node->context);
+    node->context = redisConnect(node->ip, node->port);
+    if (!node->context->err && config.tls) {
+        const char *err = NULL;
+        if (cliSecureConnection(node->context, config.sslconfig, &err) == REDIS_ERR && err) {
+            fprintf(stderr,"TLS Error: %s\n", err);
+            redisFree(node->context);
+            node->context = NULL;
+            return 0;
+        }
+    }
+    if (node->context->err) {
+        fprintf(stderr,"Could not connect to Redis at ");
+        fprintf(stderr,"%s:%d: %s\n", node->ip, node->port,
+                node->context->errstr);
+        redisFree(node->context);
+        node->context = NULL;
+        return 0;
+    }
+    /* Set aggressive KEEP_ALIVE socket option in the Redis context socket
+     * in order to prevent timeouts caused by the execution of long
+     * commands. At the same time this improves the detection of real
+     * errors. */
+    anetKeepAlive(NULL, node->context->fd, REDIS_CLI_KEEPALIVE_INTERVAL);
+    if (config.auth) {
+        redisReply *reply;
+        if (config.user == NULL)
+            reply = redisCommand(node->context,"AUTH %s", config.auth);
+        else
+            reply = redisCommand(node->context,"AUTH %s %s",
+                                 config.user,config.auth);
+        int ok = clusterManagerCheckRedisReply(node, reply, NULL);
+        if (reply != NULL) freeReplyObject(reply);
+        if (!ok) return 0;
+    }
+    return 1;
+}
+
+static void clusterManagerRemoveNodeFromList(list *nodelist,
+                                             clusterManagerNode *node) {
+    listIter li;
+    listNode *ln;
+    listRewind(nodelist, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        if (node == ln->value) {
+            listDelNode(nodelist, ln);
+            break;
+        }
+    }
+}
+
+/* Return the node with the specified name (ID) or NULL. */
+static clusterManagerNode *clusterManagerNodeByName(const char *name) {
+    if (cluster_manager.nodes == NULL) return NULL;
+    clusterManagerNode *found = NULL;
+    sds lcname = sdsempty();
+    lcname = sdscpy(lcname, name);
+    sdstolower(lcname);
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->name && !sdscmp(n->name, lcname)) {
+            found = n;
+            break;
+        }
+    }
+    sdsfree(lcname);
+    return found;
+}
+
+/* Like clusterManagerNodeByName but the specified name can be just the first
+ * part of the node ID as long as the prefix in unique across the
+ * cluster.
+ */
+static clusterManagerNode *clusterManagerNodeByAbbreviatedName(const char*name)
+{
+    if (cluster_manager.nodes == NULL) return NULL;
+    clusterManagerNode *found = NULL;
+    sds lcname = sdsempty();
+    lcname = sdscpy(lcname, name);
+    sdstolower(lcname);
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->name &&
+            strstr(n->name, lcname) == n->name) {
+            found = n;
+            break;
+        }
+    }
+    sdsfree(lcname);
+    return found;
+}
+
+static void clusterManagerNodeResetSlots(clusterManagerNode *node) {
+    memset(node->slots, 0, sizeof(node->slots));
+    node->slots_count = 0;
+}
+
+/* Call "INFO" redis command on the specified node and return the reply. */
+static redisReply *clusterManagerGetNodeRedisInfo(clusterManagerNode *node,
+                                                  char **err)
+{
+    redisReply *info = CLUSTER_MANAGER_COMMAND(node, "INFO");
+    if (err != NULL) *err = NULL;
+    if (info == NULL) return NULL;
+    if (info->type == REDIS_REPLY_ERROR) {
+        if (err != NULL) {
+            *err = zmalloc((info->len + 1) * sizeof(char));
+            strcpy(*err, info->str);
+        }
+        freeReplyObject(info);
+        return  NULL;
+    }
+    return info;
+}
+
+static int clusterManagerNodeIsCluster(clusterManagerNode *node, char **err) {
+    redisReply *info = clusterManagerGetNodeRedisInfo(node, err);
+    if (info == NULL) return 0;
+    int is_cluster = (int) getLongInfoField(info->str, "cluster_enabled");
+    freeReplyObject(info);
+    return is_cluster;
+}
+
+/* Checks whether the node is empty. Node is considered not-empty if it has
+ * some key or if it already knows other nodes */
+static int clusterManagerNodeIsEmpty(clusterManagerNode *node, char **err) {
+    redisReply *info = clusterManagerGetNodeRedisInfo(node, err);
+    int is_empty = 1;
+    if (info == NULL) return 0;
+    if (strstr(info->str, "db0:") != NULL) {
+        is_empty = 0;
+        goto result;
+    }
+    freeReplyObject(info);
+    info = CLUSTER_MANAGER_COMMAND(node, "CLUSTER INFO");
+    if (err != NULL) *err = NULL;
+    if (!clusterManagerCheckRedisReply(node, info, err)) {
+        is_empty = 0;
+        goto result;
+    }
+    long known_nodes = getLongInfoField(info->str, "cluster_known_nodes");
+    is_empty = (known_nodes == 1);
+result:
+    freeReplyObject(info);
+    return is_empty;
+}
+
+/* Return the anti-affinity score, which is a measure of the amount of
+ * violations of anti-affinity in the current cluster layout, that is, how
+ * badly the masters and slaves are distributed in the different IP
+ * addresses so that slaves of the same master are not in the master
+ * host and are also in different hosts.
+ *
+ * The score is calculated as follows:
+ *
+ * SAME_AS_MASTER = 10000 * each slave in the same IP of its master.
+ * SAME_AS_SLAVE  = 1 * each slave having the same IP as another slave
+                      of the same master.
+ * FINAL_SCORE = SAME_AS_MASTER + SAME_AS_SLAVE
+ *
+ * So a greater score means a worse anti-affinity level, while zero
+ * means perfect anti-affinity.
+ *
+ * The anti affinity optimizator will try to get a score as low as
+ * possible. Since we do not want to sacrifice the fact that slaves should
+ * not be in the same host as the master, we assign 10000 times the score
+ * to this violation, so that we'll optimize for the second factor only
+ * if it does not impact the first one.
+ *
+ * The ipnodes argument is an array of clusterManagerNodeArray, one for
+ * each IP, while ip_count is the total number of IPs in the configuration.
+ *
+ * The function returns the above score, and the list of
+ * offending slaves can be stored into the 'offending' argument,
+ * so that the optimizer can try changing the configuration of the
+ * slaves violating the anti-affinity goals. */
+static int clusterManagerGetAntiAffinityScore(clusterManagerNodeArray *ipnodes,
+    int ip_count, clusterManagerNode ***offending, int *offending_len)
+{
+    int score = 0, i, j;
+    int node_len = cluster_manager.nodes->len;
+    clusterManagerNode **offending_p = NULL;
+    if (offending != NULL) {
+        *offending = zcalloc(node_len * sizeof(clusterManagerNode*));
+        offending_p = *offending;
+    }
+    /* For each set of nodes in the same host, split by
+     * related nodes (masters and slaves which are involved in
+     * replication of each other) */
+    for (i = 0; i < ip_count; i++) {
+        clusterManagerNodeArray *node_array = &(ipnodes[i]);
+        dict *related = dictCreate(&clusterManagerDictType, NULL);
+        char *ip = NULL;
+        for (j = 0; j < node_array->len; j++) {
+            clusterManagerNode *node = node_array->nodes[j];
+            if (node == NULL) continue;
+            if (!ip) ip = node->ip;
+            sds types;
+            /* We always use the Master ID as key. */
+            sds key = (!node->replicate ? node->name : node->replicate);
+            assert(key != NULL);
+            dictEntry *entry = dictFind(related, key);
+            if (entry) types = sdsdup((sds) dictGetVal(entry));
+            else types = sdsempty();
+            /* Master type 'm' is always set as the first character of the
+             * types string. */
+            if (node->replicate) types = sdscat(types, "s");
+            else {
+                sds s = sdscatsds(sdsnew("m"), types);
+                sdsfree(types);
+                types = s;
+            }
+            dictReplace(related, key, types);
+        }
+        /* Now it's trivial to check, for each related group having the
+         * same host, what is their local score. */
+        dictIterator *iter = dictGetIterator(related);
+        dictEntry *entry;
+        while ((entry = dictNext(iter)) != NULL) {
+            sds types = (sds) dictGetVal(entry);
+            sds name = (sds) dictGetKey(entry);
+            int typeslen = sdslen(types);
+            if (typeslen < 2) continue;
+            if (types[0] == 'm') score += (10000 * (typeslen - 1));
+            else score += (1 * typeslen);
+            if (offending == NULL) continue;
+            /* Populate the list of offending nodes. */
+            listIter li;
+            listNode *ln;
+            listRewind(cluster_manager.nodes, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                clusterManagerNode *n = ln->value;
+                if (n->replicate == NULL) continue;
+                if (!strcmp(n->replicate, name) && !strcmp(n->ip, ip)) {
+                    *(offending_p++) = n;
+                    if (offending_len != NULL) (*offending_len)++;
+                    break;
+                }
+            }
+        }
+        //if (offending_len != NULL) *offending_len = offending_p - *offending;
+        dictReleaseIterator(iter);
+        dictRelease(related);
+    }
+    return score;
+}
+
+static void clusterManagerOptimizeAntiAffinity(clusterManagerNodeArray *ipnodes,
+    int ip_count)
+{
+    clusterManagerNode **offenders = NULL;
+    int score = clusterManagerGetAntiAffinityScore(ipnodes, ip_count,
+                                                   NULL, NULL);
+    if (score == 0) goto cleanup;
+    clusterManagerLogInfo(">>> Trying to optimize slaves allocation "
+                          "for anti-affinity\n");
+    int node_len = cluster_manager.nodes->len;
+    int maxiter = 500 * node_len; // Effort is proportional to cluster size...
+    srand(time(NULL));
+    while (maxiter > 0) {
+        int offending_len = 0;
+        if (offenders != NULL) {
+            zfree(offenders);
+            offenders = NULL;
+        }
+        score = clusterManagerGetAntiAffinityScore(ipnodes,
+                                                   ip_count,
+                                                   &offenders,
+                                                   &offending_len);
+        if (score == 0 || offending_len == 0) break; // Optimal anti affinity reached
+        /* We'll try to randomly swap a slave's assigned master causing
+         * an affinity problem with another random slave, to see if we
+         * can improve the affinity. */
+        int rand_idx = rand() % offending_len;
+        clusterManagerNode *first = offenders[rand_idx],
+                           *second = NULL;
+        clusterManagerNode **other_replicas = zcalloc((node_len - 1) *
+                                                      sizeof(*other_replicas));
+        int other_replicas_count = 0;
+        listIter li;
+        listNode *ln;
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n != first && n->replicate != NULL)
+                other_replicas[other_replicas_count++] = n;
+        }
+        if (other_replicas_count == 0) {
+            zfree(other_replicas);
+            break;
+        }
+        rand_idx = rand() % other_replicas_count;
+        second = other_replicas[rand_idx];
+        char *first_master = first->replicate,
+             *second_master = second->replicate;
+        first->replicate = second_master, first->dirty = 1;
+        second->replicate = first_master, second->dirty = 1;
+        int new_score = clusterManagerGetAntiAffinityScore(ipnodes,
+                                                           ip_count,
+                                                           NULL, NULL);
+        /* If the change actually makes thing worse, revert. Otherwise
+         * leave as it is because the best solution may need a few
+         * combined swaps. */
+        if (new_score > score) {
+            first->replicate = first_master;
+            second->replicate = second_master;
+        }
+        zfree(other_replicas);
+        maxiter--;
+    }
+    score = clusterManagerGetAntiAffinityScore(ipnodes, ip_count, NULL, NULL);
+    char *msg;
+    int perfect = (score == 0);
+    int log_level = (perfect ? CLUSTER_MANAGER_LOG_LVL_SUCCESS :
+                               CLUSTER_MANAGER_LOG_LVL_WARN);
+    if (perfect) msg = "[OK] Perfect anti-affinity obtained!";
+    else if (score >= 10000)
+        msg = ("[WARNING] Some slaves are in the same host as their master");
+    else
+        msg=("[WARNING] Some slaves of the same master are in the same host");
+    clusterManagerLog(log_level, "%s\n", msg);
+cleanup:
+    zfree(offenders);
+}
+
+/* Return a representable string of the node's flags */
+static sds clusterManagerNodeFlagString(clusterManagerNode *node) {
+    sds flags = sdsempty();
+    if (!node->flags_str) return flags;
+    int empty = 1;
+    listIter li;
+    listNode *ln;
+    listRewind(node->flags_str, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        sds flag = ln->value;
+        if (strcmp(flag, "myself") == 0) continue;
+        if (!empty) flags = sdscat(flags, ",");
+        flags = sdscatfmt(flags, "%S", flag);
+        empty = 0;
+    }
+    return flags;
+}
+
+/* Return a representable string of the node's slots */
+static sds clusterManagerNodeSlotsString(clusterManagerNode *node) {
+    sds slots = sdsempty();
+    int first_range_idx = -1, last_slot_idx = -1, i;
+    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
+        int has_slot = node->slots[i];
+        if (has_slot) {
+            if (first_range_idx == -1) {
+                if (sdslen(slots)) slots = sdscat(slots, ",");
+                first_range_idx = i;
+                slots = sdscatfmt(slots, "[%u", i);
+            }
+            last_slot_idx = i;
+        } else {
+            if (last_slot_idx >= 0) {
+                if (first_range_idx == last_slot_idx)
+                    slots = sdscat(slots, "]");
+                else slots = sdscatfmt(slots, "-%u]", last_slot_idx);
+            }
+            last_slot_idx = -1;
+            first_range_idx = -1;
+        }
+    }
+    if (last_slot_idx >= 0) {
+        if (first_range_idx == last_slot_idx) slots = sdscat(slots, "]");
+        else slots = sdscatfmt(slots, "-%u]", last_slot_idx);
+    }
+    return slots;
+}
+
+static sds clusterManagerNodeGetJSON(clusterManagerNode *node,
+                                     unsigned long error_count)
+{
+    sds json = sdsempty();
+    sds replicate = sdsempty();
+    if (node->replicate)
+        replicate = sdscatprintf(replicate, "\"%s\"", node->replicate);
+    else
+        replicate = sdscat(replicate, "null");
+    sds slots = clusterManagerNodeSlotsString(node);
+    sds flags = clusterManagerNodeFlagString(node);
+    char *p = slots;
+    while ((p = strchr(p, '-')) != NULL)
+        *(p++) = ',';
+    json = sdscatprintf(json,
+        "  {\n"
+        "    \"name\": \"%s\",\n"
+        "    \"host\": \"%s\",\n"
+        "    \"port\": %d,\n"
+        "    \"replicate\": %s,\n"
+        "    \"slots\": [%s],\n"
+        "    \"slots_count\": %d,\n"
+        "    \"flags\": \"%s\",\n"
+        "    \"current_epoch\": %llu",
+        node->name,
+        node->ip,
+        node->port,
+        replicate,
+        slots,
+        node->slots_count,
+        flags,
+        (unsigned long long)node->current_epoch
+    );
+    if (error_count > 0) {
+        json = sdscatprintf(json, ",\n    \"cluster_errors\": %lu",
+                            error_count);
+    }
+    if (node->migrating_count > 0 && node->migrating != NULL) {
+        int i = 0;
+        sds migrating = sdsempty();
+        for (; i < node->migrating_count; i += 2) {
+            sds slot = node->migrating[i];
+            sds dest = node->migrating[i + 1];
+            if (slot && dest) {
+                if (sdslen(migrating) > 0) migrating = sdscat(migrating, ",");
+                migrating = sdscatfmt(migrating, "\"%S\": \"%S\"", slot, dest);
+            }
+        }
+        if (sdslen(migrating) > 0)
+            json = sdscatfmt(json, ",\n    \"migrating\": {%S}", migrating);
+        sdsfree(migrating);
+    }
+    if (node->importing_count > 0 && node->importing != NULL) {
+        int i = 0;
+        sds importing = sdsempty();
+        for (; i < node->importing_count; i += 2) {
+            sds slot = node->importing[i];
+            sds from = node->importing[i + 1];
+            if (slot && from) {
+                if (sdslen(importing) > 0) importing = sdscat(importing, ",");
+                importing = sdscatfmt(importing, "\"%S\": \"%S\"", slot, from);
+            }
+        }
+        if (sdslen(importing) > 0)
+            json = sdscatfmt(json, ",\n    \"importing\": {%S}", importing);
+        sdsfree(importing);
+    }
+    json = sdscat(json, "\n  }");
+    sdsfree(replicate);
+    sdsfree(slots);
+    sdsfree(flags);
+    return json;
+}
+
+
+/* -----------------------------------------------------------------------------
+ * Key space handling
+ * -------------------------------------------------------------------------- */
+
+/* We have 16384 hash slots. The hash slot of a given key is obtained
+ * as the least significant 14 bits of the crc16 of the key.
+ *
+ * However if the key contains the {...} pattern, only the part between
+ * { and } is hashed. This may be useful in the future to force certain
+ * keys to be in the same node (assuming no resharding is in progress). */
+static unsigned int clusterManagerKeyHashSlot(char *key, int keylen) {
+    int s, e; /* start-end indexes of { and } */
+
+    for (s = 0; s < keylen; s++)
+        if (key[s] == '{') break;
+
+    /* No '{' ? Hash the whole key. This is the base case. */
+    if (s == keylen) return crc16(key,keylen) & 0x3FFF;
+
+    /* '{' found? Check if we have the corresponding '}'. */
+    for (e = s+1; e < keylen; e++)
+        if (key[e] == '}') break;
+
+    /* No '}' or nothing between {} ? Hash the whole key. */
+    if (e == keylen || e == s+1) return crc16(key,keylen) & 0x3FFF;
+
+    /* If we are here there is both a { and a } on its right. Hash
+     * what is in the middle between { and }. */
+    return crc16(key+s+1,e-s-1) & 0x3FFF;
+}
+
+/* Return a string representation of the cluster node. */
+static sds clusterManagerNodeInfo(clusterManagerNode *node, int indent) {
+    sds info = sdsempty();
+    sds spaces = sdsempty();
+    int i;
+    for (i = 0; i < indent; i++) spaces = sdscat(spaces, " ");
+    if (indent) info = sdscat(info, spaces);
+    int is_master = !(node->flags & CLUSTER_MANAGER_FLAG_SLAVE);
+    char *role = (is_master ? "M" : "S");
+    sds slots = NULL;
+    if (node->dirty && node->replicate != NULL)
+        info = sdscatfmt(info, "S: %S %s:%u", node->name, node->ip, node->port);
+    else {
+        slots = clusterManagerNodeSlotsString(node);
+        sds flags = clusterManagerNodeFlagString(node);
+        info = sdscatfmt(info, "%s: %S %s:%u\n"
+                               "%s   slots:%S (%u slots) "
+                               "%S",
+                               role, node->name, node->ip, node->port, spaces,
+                               slots, node->slots_count, flags);
+        sdsfree(slots);
+        sdsfree(flags);
+    }
+    if (node->replicate != NULL)
+        info = sdscatfmt(info, "\n%s   replicates %S", spaces, node->replicate);
+    else if (node->replicas_count)
+        info = sdscatfmt(info, "\n%s   %U additional replica(s)",
+                         spaces, node->replicas_count);
+    sdsfree(spaces);
+    return info;
+}
+
+static void clusterManagerShowNodes(void) {
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        sds info = clusterManagerNodeInfo(node, 0);
+        printf("%s\n", (char *) info);
+        sdsfree(info);
+    }
+}
+
+static void clusterManagerShowClusterInfo(void) {
+    int masters = 0;
+    int keys = 0;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        if (!(node->flags & CLUSTER_MANAGER_FLAG_SLAVE)) {
+            if (!node->name) continue;
+            int replicas = 0;
+            int dbsize = -1;
+            char name[9];
+            memcpy(name, node->name, 8);
+            name[8] = '\0';
+            listIter ri;
+            listNode *rn;
+            listRewind(cluster_manager.nodes, &ri);
+            while ((rn = listNext(&ri)) != NULL) {
+                clusterManagerNode *n = rn->value;
+                if (n == node || !(n->flags & CLUSTER_MANAGER_FLAG_SLAVE))
+                    continue;
+                if (n->replicate && !strcmp(n->replicate, node->name))
+                    replicas++;
+            }
+            redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "DBSIZE");
+            if (reply != NULL && reply->type == REDIS_REPLY_INTEGER)
+                dbsize = reply->integer;
+            if (dbsize < 0) {
+                char *err = "";
+                if (reply != NULL && reply->type == REDIS_REPLY_ERROR)
+                    err = reply->str;
+                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+                if (reply != NULL) freeReplyObject(reply);
+                return;
+            };
+            if (reply != NULL) freeReplyObject(reply);
+            printf("%s:%d (%s...) -> %d keys | %d slots | %d slaves.\n",
+                   node->ip, node->port, name, dbsize,
+                   node->slots_count, replicas);
+            masters++;
+            keys += dbsize;
+        }
+    }
+    clusterManagerLogOk("[OK] %d keys in %d masters.\n", keys, masters);
+    float keys_per_slot = keys / (float) CLUSTER_MANAGER_SLOTS;
+    printf("%.2f keys per slot on average.\n", keys_per_slot);
+}
+
+/* Flush dirty slots configuration of the node by calling CLUSTER ADDSLOTS */
+static int clusterManagerAddSlots(clusterManagerNode *node, char**err)
+{
+    redisReply *reply = NULL;
+    void *_reply = NULL;
+    int success = 1;
+    /* First two args are used for the command itself. */
+    int argc = node->slots_count + 2;
+    sds *argv = zmalloc(argc * sizeof(*argv));
+    size_t *argvlen = zmalloc(argc * sizeof(*argvlen));
+    argv[0] = "CLUSTER";
+    argv[1] = "ADDSLOTS";
+    argvlen[0] = 7;
+    argvlen[1] = 8;
+    *err = NULL;
+    int i, argv_idx = 2;
+    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
+        if (argv_idx >= argc) break;
+        if (node->slots[i]) {
+            argv[argv_idx] = sdsfromlonglong((long long) i);
+            argvlen[argv_idx] = sdslen(argv[argv_idx]);
+            argv_idx++;
+        }
+    }
+    if (!argv_idx) {
+        success = 0;
+        goto cleanup;
+    }
+    redisAppendCommandArgv(node->context,argc,(const char**)argv,argvlen);
+    if (redisGetReply(node->context, &_reply) != REDIS_OK) {
+        success = 0;
+        goto cleanup;
+    }
+    reply = (redisReply*) _reply;
+    success = clusterManagerCheckRedisReply(node, reply, err);
+cleanup:
+    zfree(argvlen);
+    if (argv != NULL) {
+        for (i = 2; i < argc; i++) sdsfree(argv[i]);
+        zfree(argv);
+    }
+    if (reply != NULL) freeReplyObject(reply);
+    return success;
+}
+
+/* Get the node the slot is assigned to from the point of view of node *n.
+ * If the slot is unassigned or if the reply is an error, return NULL.
+ * Use the **err argument in order to check wether the slot is unassigned
+ * or the reply resulted in an error. */
+static clusterManagerNode *clusterManagerGetSlotOwner(clusterManagerNode *n,
+                                                      int slot, char **err)
+{
+    assert(slot >= 0 && slot < CLUSTER_MANAGER_SLOTS);
+    clusterManagerNode *owner = NULL;
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(n, "CLUSTER SLOTS");
+    if (clusterManagerCheckRedisReply(n, reply, err)) {
+        assert(reply->type == REDIS_REPLY_ARRAY);
+        size_t i;
+        for (i = 0; i < reply->elements; i++) {
+            redisReply *r = reply->element[i];
+            assert(r->type == REDIS_REPLY_ARRAY && r->elements >= 3);
+            int from, to;
+            from = r->element[0]->integer;
+            to = r->element[1]->integer;
+            if (slot < from || slot > to) continue;
+            redisReply *nr =  r->element[2];
+            assert(nr->type == REDIS_REPLY_ARRAY && nr->elements >= 2);
+            char *name = NULL;
+            if (nr->elements >= 3)
+                name =  nr->element[2]->str;
+            if (name != NULL)
+                owner = clusterManagerNodeByName(name);
+            else {
+                char *ip = nr->element[0]->str;
+                assert(ip != NULL);
+                int port = (int) nr->element[1]->integer;
+                listIter li;
+                listNode *ln;
+                listRewind(cluster_manager.nodes, &li);
+                while ((ln = listNext(&li)) != NULL) {
+                    clusterManagerNode *nd = ln->value;
+                    if (strcmp(nd->ip, ip) == 0 && port == nd->port) {
+                        owner = nd;
+                        break;
+                    }
+                }
+            }
+            if (owner) break;
+        }
+    }
+    if (reply) freeReplyObject(reply);
+    return owner;
+}
+
+/* Set slot status to "importing" or "migrating" */
+static int clusterManagerSetSlot(clusterManagerNode *node1,
+                                 clusterManagerNode *node2,
+                                 int slot, const char *status, char **err) {
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node1, "CLUSTER "
+                                                "SETSLOT %d %s %s",
+                                                slot, status,
+                                                (char *) node2->name);
+    if (err != NULL) *err = NULL;
+    if (!reply) return 0;
+    int success = 1;
+    if (reply->type == REDIS_REPLY_ERROR) {
+        success = 0;
+        if (err != NULL) {
+            *err = zmalloc((reply->len + 1) * sizeof(char));
+            strcpy(*err, reply->str);
+        } else CLUSTER_MANAGER_PRINT_REPLY_ERROR(node1, reply->str);
+        goto cleanup;
+    }
+cleanup:
+    freeReplyObject(reply);
+    return success;
+}
+
+static int clusterManagerClearSlotStatus(clusterManagerNode *node, int slot) {
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
+        "CLUSTER SETSLOT %d %s", slot, "STABLE");
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+static int clusterManagerDelSlot(clusterManagerNode *node, int slot,
+                                 int ignore_unassigned_err)
+{
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
+        "CLUSTER DELSLOTS %d", slot);
+    char *err = NULL;
+    int success = clusterManagerCheckRedisReply(node, reply, &err);
+    if (!success && reply && reply->type == REDIS_REPLY_ERROR &&
+        ignore_unassigned_err)
+    {
+        char *get_owner_err = NULL;
+        clusterManagerNode *assigned_to =
+            clusterManagerGetSlotOwner(node, slot, &get_owner_err);
+        if (!assigned_to) {
+            if (get_owner_err == NULL) success = 1;
+            else {
+                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, get_owner_err);
+                zfree(get_owner_err);
+            }
+        }
+    }
+    if (!success && err != NULL) {
+        CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+        zfree(err);
+    }
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+static int clusterManagerAddSlot(clusterManagerNode *node, int slot) {
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
+        "CLUSTER ADDSLOTS %d", slot);
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+static signed int clusterManagerCountKeysInSlot(clusterManagerNode *node,
+                                                int slot)
+{
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
+        "CLUSTER COUNTKEYSINSLOT %d", slot);
+    int count = -1;
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (success && reply->type == REDIS_REPLY_INTEGER) count = reply->integer;
+    if (reply) freeReplyObject(reply);
+    return count;
+}
+
+static int clusterManagerBumpEpoch(clusterManagerNode *node) {
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER BUMPEPOCH");
+    int success = clusterManagerCheckRedisReply(node, reply, NULL);
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+/* Callback used by clusterManagerSetSlotOwner transaction. It should ignore
+ * errors except for ADDSLOTS errors.
+ * Return 1 if the error should be ignored. */
+static int clusterManagerOnSetOwnerErr(redisReply *reply,
+    clusterManagerNode *n, int bulk_idx)
+{
+    UNUSED(reply);
+    UNUSED(n);
+    /* Only raise error when ADDSLOTS fail (bulk_idx == 1). */
+    return (bulk_idx != 1);
+}
+
+static int clusterManagerSetSlotOwner(clusterManagerNode *owner,
+                                      int slot,
+                                      int do_clear)
+{
+    int success = clusterManagerStartTransaction(owner);
+    if (!success) return 0;
+    /* Ensure the slot is not already assigned. */
+    clusterManagerDelSlot(owner, slot, 1);
+    /* Add the slot and bump epoch. */
+    clusterManagerAddSlot(owner, slot);
+    if (do_clear) clusterManagerClearSlotStatus(owner, slot);
+    clusterManagerBumpEpoch(owner);
+    success = clusterManagerExecTransaction(owner, clusterManagerOnSetOwnerErr);
+    return success;
+}
+
+/* Get the hash for the values of the specified keys in *keys_reply for the
+ * specified nodes *n1 and *n2, by calling DEBUG DIGEST-VALUE redis command
+ * on both nodes. Every key with same name on both nodes but having different
+ * values will be added to the *diffs list. Return 0 in case of reply
+ * error. */
+static int clusterManagerCompareKeysValues(clusterManagerNode *n1,
+                                          clusterManagerNode *n2,
+                                          redisReply *keys_reply,
+                                          list *diffs)
+{
+    size_t i, argc = keys_reply->elements + 2;
+    static const char *hash_zero = "0000000000000000000000000000000000000000";
+    char **argv = zcalloc(argc * sizeof(char *));
+    size_t  *argv_len = zcalloc(argc * sizeof(size_t));
+    argv[0] = "DEBUG";
+    argv_len[0] = 5;
+    argv[1] = "DIGEST-VALUE";
+    argv_len[1] = 12;
+    for (i = 0; i < keys_reply->elements; i++) {
+        redisReply *entry = keys_reply->element[i];
+        int idx = i + 2;
+        argv[idx] = entry->str;
+        argv_len[idx] = entry->len;
+    }
+    int success = 0;
+    void *_reply1 = NULL, *_reply2 = NULL;
+    redisReply *r1 = NULL, *r2 = NULL;
+    redisAppendCommandArgv(n1->context,argc, (const char**)argv,argv_len);
+    success = (redisGetReply(n1->context, &_reply1) == REDIS_OK);
+    if (!success) goto cleanup;
+    r1 = (redisReply *) _reply1;
+    redisAppendCommandArgv(n2->context,argc, (const char**)argv,argv_len);
+    success = (redisGetReply(n2->context, &_reply2) == REDIS_OK);
+    if (!success) goto cleanup;
+    r2 = (redisReply *) _reply2;
+    success = (r1->type != REDIS_REPLY_ERROR && r2->type != REDIS_REPLY_ERROR);
+    if (r1->type == REDIS_REPLY_ERROR) {
+        CLUSTER_MANAGER_PRINT_REPLY_ERROR(n1, r1->str);
+        success = 0;
+    }
+    if (r2->type == REDIS_REPLY_ERROR) {
+        CLUSTER_MANAGER_PRINT_REPLY_ERROR(n2, r2->str);
+        success = 0;
+    }
+    if (!success) goto cleanup;
+    assert(keys_reply->elements == r1->elements &&
+           keys_reply->elements == r2->elements);
+    for (i = 0; i < keys_reply->elements; i++) {
+        char *key = keys_reply->element[i]->str;
+        char *hash1 = r1->element[i]->str;
+        char *hash2 = r2->element[i]->str;
+        /* Ignore keys that don't exist in both nodes. */
+        if (strcmp(hash1, hash_zero) == 0 || strcmp(hash2, hash_zero) == 0)
+            continue;
+        if (strcmp(hash1, hash2) != 0) listAddNodeTail(diffs, key);
+    }
+cleanup:
+    if (r1) freeReplyObject(r1);
+    if (r2) freeReplyObject(r2);
+    zfree(argv);
+    zfree(argv_len);
+    return success;
+}
+
+/* Migrate keys taken from reply->elements. It returns the reply from the
+ * MIGRATE command, or NULL if something goes wrong. If the argument 'dots'
+ * is not NULL, a dot will be printed for every migrated key. */
+static redisReply *clusterManagerMigrateKeysInReply(clusterManagerNode *source,
+                                                    clusterManagerNode *target,
+                                                    redisReply *reply,
+                                                    int replace, int timeout,
+                                                    char *dots)
+{
+    redisReply *migrate_reply = NULL;
+    char **argv = NULL;
+    size_t *argv_len = NULL;
+    int c = (replace ? 8 : 7);
+    if (config.auth) c += 2;
+    if (config.user) c += 1;
+    size_t argc = c + reply->elements;
+    size_t i, offset = 6; // Keys Offset
+    argv = zcalloc(argc * sizeof(char *));
+    argv_len = zcalloc(argc * sizeof(size_t));
+    char portstr[255];
+    char timeoutstr[255];
+    snprintf(portstr, 10, "%d", target->port);
+    snprintf(timeoutstr, 10, "%d", timeout);
+    argv[0] = "MIGRATE";
+    argv_len[0] = 7;
+    argv[1] = target->ip;
+    argv_len[1] = strlen(target->ip);
+    argv[2] = portstr;
+    argv_len[2] = strlen(portstr);
+    argv[3] = "";
+    argv_len[3] = 0;
+    argv[4] = "0";
+    argv_len[4] = 1;
+    argv[5] = timeoutstr;
+    argv_len[5] = strlen(timeoutstr);
+    if (replace) {
+        argv[offset] = "REPLACE";
+        argv_len[offset] = 7;
+        offset++;
+    }
+    if (config.auth) {
+        if (config.user) {
+            argv[offset] = "AUTH2";
+            argv_len[offset] = 5;
+            offset++;
+            argv[offset] = config.user;
+            argv_len[offset] = strlen(config.user);
+            offset++;
+            argv[offset] = config.auth;
+            argv_len[offset] = strlen(config.auth);
+            offset++;
+        } else {
+            argv[offset] = "AUTH";
+            argv_len[offset] = 4;
+            offset++;
+            argv[offset] = config.auth;
+            argv_len[offset] = strlen(config.auth);
+            offset++;
+        }
+    }
+    argv[offset] = "KEYS";
+    argv_len[offset] = 4;
+    offset++;
+    for (i = 0; i < reply->elements; i++) {
+        redisReply *entry = reply->element[i];
+        size_t idx = i + offset;
+        assert(entry->type == REDIS_REPLY_STRING);
+        argv[idx] = (char *) sdsnewlen(entry->str, entry->len);
+        argv_len[idx] = entry->len;
+        if (dots) dots[i] = '.';
+    }
+    if (dots) dots[reply->elements] = '\0';
+    void *_reply = NULL;
+    redisAppendCommandArgv(source->context,argc,
+                           (const char**)argv,argv_len);
+    int success = (redisGetReply(source->context, &_reply) == REDIS_OK);
+    for (i = 0; i < reply->elements; i++) sdsfree(argv[i + offset]);
+    if (!success) goto cleanup;
+    migrate_reply = (redisReply *) _reply;
+cleanup:
+    zfree(argv);
+    zfree(argv_len);
+    return migrate_reply;
+}
+
+/* Migrate all keys in the given slot from source to target.*/
+static int clusterManagerMigrateKeysInSlot(clusterManagerNode *source,
+                                           clusterManagerNode *target,
+                                           int slot, int timeout,
+                                           int pipeline, int verbose,
+                                           char **err)
+{
+    int success = 1;
+    int do_fix = config.cluster_manager_command.flags &
+                 CLUSTER_MANAGER_CMD_FLAG_FIX;
+    int do_replace = config.cluster_manager_command.flags &
+                     CLUSTER_MANAGER_CMD_FLAG_REPLACE;
+    while (1) {
+        char *dots = NULL;
+        redisReply *reply = NULL, *migrate_reply = NULL;
+        reply = CLUSTER_MANAGER_COMMAND(source, "CLUSTER "
+                                        "GETKEYSINSLOT %d %d", slot,
+                                        pipeline);
+        success = (reply != NULL);
+        if (!success) return 0;
+        if (reply->type == REDIS_REPLY_ERROR) {
+            success = 0;
+            if (err != NULL) {
+                *err = zmalloc((reply->len + 1) * sizeof(char));
+                strcpy(*err, reply->str);
+                CLUSTER_MANAGER_PRINT_REPLY_ERROR(source, *err);
+            }
+            goto next;
+        }
+        assert(reply->type == REDIS_REPLY_ARRAY);
+        size_t count = reply->elements;
+        if (count == 0) {
+            freeReplyObject(reply);
+            break;
+        }
+        if (verbose) dots = zmalloc((count+1) * sizeof(char));
+        /* Calling MIGRATE command. */
+        migrate_reply = clusterManagerMigrateKeysInReply(source, target,
+                                                         reply, 0, timeout,
+                                                         dots);
+        if (migrate_reply == NULL) goto next;
+        if (migrate_reply->type == REDIS_REPLY_ERROR) {
+            int is_busy = strstr(migrate_reply->str, "BUSYKEY") != NULL;
+            int not_served = 0;
+            if (!is_busy) {
+                /* Check if the slot is unassigned (not served) in the
+                 * source node's configuration. */
+                char *get_owner_err = NULL;
+                clusterManagerNode *served_by =
+                    clusterManagerGetSlotOwner(source, slot, &get_owner_err);
+                if (!served_by) {
+                    if (get_owner_err == NULL) not_served = 1;
+                    else {
+                        CLUSTER_MANAGER_PRINT_REPLY_ERROR(source,
+                                                          get_owner_err);
+                        zfree(get_owner_err);
+                    }
+                }
+            }
+            /* Try to handle errors. */
+            if (is_busy || not_served) {
+                /* If the key's slot is not served, try to assign slot
+                 * to the target node. */
+                if (do_fix && not_served) {
+                    clusterManagerLogWarn("*** Slot was not served, setting "
+                                          "owner to node %s:%d.\n",
+                                          target->ip, target->port);
+                    clusterManagerSetSlot(source, target, slot, "node", NULL);
+                }
+                /* If the key already exists in the target node (BUSYKEY),
+                 * check whether its value is the same in both nodes.
+                 * In case of equal values, retry migration with the
+                 * REPLACE option.
+                 * In case of different values:
+                 *  - If the migration is requested by the fix command, stop
+                 *    and warn the user.
+                 *  - In other cases (ie. reshard), proceed only if the user
+                 *    launched the command with the --cluster-replace option.*/
+                if (is_busy) {
+                    clusterManagerLogWarn("\n*** Target key exists\n");
+                    if (!do_replace) {
+                        clusterManagerLogWarn("*** Checking key values on "
+                                              "both nodes...\n");
+                        list *diffs = listCreate();
+                        success = clusterManagerCompareKeysValues(source,
+                            target, reply, diffs);
+                        if (!success) {
+                            clusterManagerLogErr("*** Value check failed!\n");
+                            listRelease(diffs);
+                            goto next;
+                        }
+                        if (listLength(diffs) > 0) {
+                            success = 0;
+                            clusterManagerLogErr(
+                                "*** Found %d key(s) in both source node and "
+                                "target node having different values.\n"
+                                "    Source node: %s:%d\n"
+                                "    Target node: %s:%d\n"
+                                "    Keys(s):\n",
+                                listLength(diffs),
+                                source->ip, source->port,
+                                target->ip, target->port);
+                            listIter dli;
+                            listNode *dln;
+                            listRewind(diffs, &dli);
+                            while((dln = listNext(&dli)) != NULL) {
+                                char *k = dln->value;
+                                clusterManagerLogErr("    - %s\n", k);
+                            }
+                            clusterManagerLogErr("Please fix the above key(s) "
+                                                 "manually and try again "
+                                                 "or relaunch the command \n"
+                                                 "with --cluster-replace "
+                                                 "option to force key "
+                                                 "overriding.\n");
+                            listRelease(diffs);
+                            goto next;
+                        }
+                        listRelease(diffs);
+                    }
+                    clusterManagerLogWarn("*** Replacing target keys...\n");
+                }
+                freeReplyObject(migrate_reply);
+                migrate_reply = clusterManagerMigrateKeysInReply(source,
+                                                                 target,
+                                                                 reply,
+                                                                 is_busy,
+                                                                 timeout,
+                                                                 NULL);
+                success = (migrate_reply != NULL &&
+                           migrate_reply->type != REDIS_REPLY_ERROR);
+            } else success = 0;
+            if (!success) {
+                if (migrate_reply != NULL) {
+                    if (err) {
+                        *err = zmalloc((migrate_reply->len + 1) * sizeof(char));
+                        strcpy(*err, migrate_reply->str);
+                    }
+                    printf("\n");
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(source,
+                                                      migrate_reply->str);
+                }
+                goto next;
+            }
+        }
+        if (verbose) {
+            printf("%s", dots);
+            fflush(stdout);
+        }
+next:
+        if (reply != NULL) freeReplyObject(reply);
+        if (migrate_reply != NULL) freeReplyObject(migrate_reply);
+        if (dots) zfree(dots);
+        if (!success) break;
+    }
+    return success;
+}
+
+/* Move slots between source and target nodes using MIGRATE.
+ *
+ * Options:
+ * CLUSTER_MANAGER_OPT_VERBOSE -- Print a dot for every moved key.
+ * CLUSTER_MANAGER_OPT_COLD    -- Move keys without opening slots /
+ *                                reconfiguring the nodes.
+ * CLUSTER_MANAGER_OPT_UPDATE  -- Update node->slots for source/target nodes.
+ * CLUSTER_MANAGER_OPT_QUIET   -- Don't print info messages.
+*/
+static int clusterManagerMoveSlot(clusterManagerNode *source,
+                                  clusterManagerNode *target,
+                                  int slot, int opts,  char**err)
+{
+    if (!(opts & CLUSTER_MANAGER_OPT_QUIET)) {
+        printf("Moving slot %d from %s:%d to %s:%d: ", slot, source->ip,
+               source->port, target->ip, target->port);
+        fflush(stdout);
+    }
+    if (err != NULL) *err = NULL;
+    int pipeline = config.cluster_manager_command.pipeline,
+        timeout = config.cluster_manager_command.timeout,
+        print_dots = (opts & CLUSTER_MANAGER_OPT_VERBOSE),
+        option_cold = (opts & CLUSTER_MANAGER_OPT_COLD),
+        success = 1;
+    if (!option_cold) {
+        success = clusterManagerSetSlot(target, source, slot,
+                                        "importing", err);
+        if (!success) return 0;
+        success = clusterManagerSetSlot(source, target, slot,
+                                        "migrating", err);
+        if (!success) return 0;
+    }
+    success = clusterManagerMigrateKeysInSlot(source, target, slot, timeout,
+                                              pipeline, print_dots, err);
+    if (!(opts & CLUSTER_MANAGER_OPT_QUIET)) printf("\n");
+    if (!success) return 0;
+    /* Set the new node as the owner of the slot in all the known nodes. */
+    if (!option_cold) {
+        listIter li;
+        listNode *ln;
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER "
+                                                    "SETSLOT %d %s %s",
+                                                    slot, "node",
+                                                    target->name);
+            success = (r != NULL);
+            if (!success) return 0;
+            if (r->type == REDIS_REPLY_ERROR) {
+                success = 0;
+                if (err != NULL) {
+                    *err = zmalloc((r->len + 1) * sizeof(char));
+                    strcpy(*err, r->str);
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, *err);
+                }
+            }
+            freeReplyObject(r);
+            if (!success) return 0;
+        }
+    }
+    /* Update the node logical config */
+    if (opts & CLUSTER_MANAGER_OPT_UPDATE) {
+        source->slots[slot] = 0;
+        target->slots[slot] = 1;
+    }
+    return 1;
+}
+
+/* Flush the dirty node configuration by calling replicate for slaves or
+ * adding the slots defined in the masters. */
+static int clusterManagerFlushNodeConfig(clusterManagerNode *node, char **err) {
+    if (!node->dirty) return 0;
+    redisReply *reply = NULL;
+    int is_err = 0, success = 1;
+    if (err != NULL) *err = NULL;
+    if (node->replicate != NULL) {
+        reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER REPLICATE %s",
+                                        node->replicate);
+        if (reply == NULL || (is_err = (reply->type == REDIS_REPLY_ERROR))) {
+            if (is_err && err != NULL) {
+                *err = zmalloc((reply->len + 1) * sizeof(char));
+                strcpy(*err, reply->str);
+            }
+            success = 0;
+            /* If the cluster did not already joined it is possible that
+             * the slave does not know the master node yet. So on errors
+             * we return ASAP leaving the dirty flag set, to flush the
+             * config later. */
+            goto cleanup;
+        }
+    } else {
+        int added = clusterManagerAddSlots(node, err);
+        if (!added || *err != NULL) success = 0;
+    }
+    node->dirty = 0;
+cleanup:
+    if (reply != NULL) freeReplyObject(reply);
+    return success;
+}
+
+/* Wait until the cluster configuration is consistent. */
+static void clusterManagerWaitForClusterJoin(void) {
+    printf("Waiting for the cluster to join\n");
+    int counter = 0,
+        check_after = CLUSTER_JOIN_CHECK_AFTER +
+                      (int)(listLength(cluster_manager.nodes) * 0.15f);
+    while(!clusterManagerIsConfigConsistent()) {
+        printf(".");
+        fflush(stdout);
+        sleep(1);
+        if (++counter > check_after) {
+            dict *status = clusterManagerGetLinkStatus();
+            dictIterator *iter = NULL;
+            if (status != NULL && dictSize(status) > 0) {
+                printf("\n");
+                clusterManagerLogErr("Warning: %d node(s) may "
+                                     "be unreachable\n", dictSize(status));
+                iter = dictGetIterator(status);
+                dictEntry *entry;
+                while ((entry = dictNext(iter)) != NULL) {
+                    sds nodeaddr = (sds) dictGetKey(entry);
+                    char *node_ip = NULL;
+                    int node_port = 0, node_bus_port = 0;
+                    list *from = (list *) dictGetVal(entry);
+                    if (parseClusterNodeAddress(nodeaddr, &node_ip,
+                        &node_port, &node_bus_port) && node_bus_port) {
+                        clusterManagerLogErr(" - The port %d of node %s may "
+                                             "be unreachable from:\n",
+                                             node_bus_port, node_ip);
+                    } else {
+                        clusterManagerLogErr(" - Node %s may be unreachable "
+                                             "from:\n", nodeaddr);
+                    }
+                    listIter li;
+                    listNode *ln;
+                    listRewind(from, &li);
+                    while ((ln = listNext(&li)) != NULL) {
+                        sds from_addr = ln->value;
+                        clusterManagerLogErr("   %s\n", from_addr);
+                        sdsfree(from_addr);
+                    }
+                    clusterManagerLogErr("Cluster bus ports must be reachable "
+                                         "by every node.\nRemember that "
+                                         "cluster bus ports are different "
+                                         "from standard instance ports.\n");
+                    listEmpty(from);
+                }
+            }
+            if (iter != NULL) dictReleaseIterator(iter);
+            if (status != NULL) dictRelease(status);
+            counter = 0;
+        }
+    }
+    printf("\n");
+}
+
+/* Load node's cluster configuration by calling "CLUSTER NODES" command.
+ * Node's configuration (name, replicate, slots, ...) is then updated.
+ * If CLUSTER_MANAGER_OPT_GETFRIENDS flag is set into 'opts' argument,
+ * and node already knows other nodes, the node's friends list is populated
+ * with the other nodes info. */
+static int clusterManagerNodeLoadInfo(clusterManagerNode *node, int opts,
+                                      char **err)
+{
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
+    int success = 1;
+    *err = NULL;
+    if (!clusterManagerCheckRedisReply(node, reply, err)) {
+        success = 0;
+        goto cleanup;
+    }
+    int getfriends = (opts & CLUSTER_MANAGER_OPT_GETFRIENDS);
+    char *lines = reply->str, *p, *line;
+    while ((p = strstr(lines, "\n")) != NULL) {
+        *p = '\0';
+        line = lines;
+        lines = p + 1;
+        char *name = NULL, *addr = NULL, *flags = NULL, *master_id = NULL,
+             *ping_sent = NULL, *ping_recv = NULL, *config_epoch = NULL,
+             *link_status = NULL;
+        UNUSED(link_status);
+        int i = 0;
+        while ((p = strchr(line, ' ')) != NULL) {
+            *p = '\0';
+            char *token = line;
+            line = p + 1;
+            switch(i++){
+            case 0: name = token; break;
+            case 1: addr = token; break;
+            case 2: flags = token; break;
+            case 3: master_id = token; break;
+            case 4: ping_sent = token; break;
+            case 5: ping_recv = token; break;
+            case 6: config_epoch = token; break;
+            case 7: link_status = token; break;
+            }
+            if (i == 8) break; // Slots
+        }
+        if (!flags) {
+            success = 0;
+            goto cleanup;
+        }
+        int myself = (strstr(flags, "myself") != NULL);
+        clusterManagerNode *currentNode = NULL;
+        if (myself) {
+            node->flags |= CLUSTER_MANAGER_FLAG_MYSELF;
+            currentNode = node;
+            clusterManagerNodeResetSlots(node);
+            if (i == 8) {
+                int remaining = strlen(line);
+                while (remaining > 0) {
+                    p = strchr(line, ' ');
+                    if (p == NULL) p = line + remaining;
+                    remaining -= (p - line);
+
+                    char *slotsdef = line;
+                    *p = '\0';
+                    if (remaining) {
+                        line = p + 1;
+                        remaining--;
+                    } else line = p;
+                    char *dash = NULL;
+                    if (slotsdef[0] == '[') {
+                        slotsdef++;
+                        if ((p = strstr(slotsdef, "->-"))) { // Migrating
+                            *p = '\0';
+                            p += 3;
+                            char *closing_bracket = strchr(p, ']');
+                            if (closing_bracket) *closing_bracket = '\0';
+                            sds slot = sdsnew(slotsdef);
+                            sds dst = sdsnew(p);
+                            node->migrating_count += 2;
+                            node->migrating = zrealloc(node->migrating,
+                                (node->migrating_count * sizeof(sds)));
+                            node->migrating[node->migrating_count - 2] =
+                                slot;
+                            node->migrating[node->migrating_count - 1] =
+                                dst;
+                        }  else if ((p = strstr(slotsdef, "-<-"))) {//Importing
+                            *p = '\0';
+                            p += 3;
+                            char *closing_bracket = strchr(p, ']');
+                            if (closing_bracket) *closing_bracket = '\0';
+                            sds slot = sdsnew(slotsdef);
+                            sds src = sdsnew(p);
+                            node->importing_count += 2;
+                            node->importing = zrealloc(node->importing,
+                                (node->importing_count * sizeof(sds)));
+                            node->importing[node->importing_count - 2] =
+                                slot;
+                            node->importing[node->importing_count - 1] =
+                                src;
+                        }
+                    } else if ((dash = strchr(slotsdef, '-')) != NULL) {
+                        p = dash;
+                        int start, stop;
+                        *p = '\0';
+                        start = atoi(slotsdef);
+                        stop = atoi(p + 1);
+                        node->slots_count += (stop - (start - 1));
+                        while (start <= stop) node->slots[start++] = 1;
+                    } else if (p > slotsdef) {
+                        node->slots[atoi(slotsdef)] = 1;
+                        node->slots_count++;
+                    }
+                }
+            }
+            node->dirty = 0;
+        } else if (!getfriends) {
+            if (!(node->flags & CLUSTER_MANAGER_FLAG_MYSELF)) continue;
+            else break;
+        } else {
+            if (addr == NULL) {
+                fprintf(stderr, "Error: invalid CLUSTER NODES reply\n");
+                success = 0;
+                goto cleanup;
+            }
+            char *c = strrchr(addr, '@');
+            if (c != NULL) *c = '\0';
+            c = strrchr(addr, ':');
+            if (c == NULL) {
+                fprintf(stderr, "Error: invalid CLUSTER NODES reply\n");
+                success = 0;
+                goto cleanup;
+            }
+            *c = '\0';
+            int port = atoi(++c);
+            currentNode = clusterManagerNewNode(sdsnew(addr), port);
+            currentNode->flags |= CLUSTER_MANAGER_FLAG_FRIEND;
+            if (node->friends == NULL) node->friends = listCreate();
+            listAddNodeTail(node->friends, currentNode);
+        }
+        if (name != NULL) {
+            if (currentNode->name) sdsfree(currentNode->name);
+            currentNode->name = sdsnew(name);
+        }
+        if (currentNode->flags_str != NULL)
+            freeClusterManagerNodeFlags(currentNode->flags_str);
+        currentNode->flags_str = listCreate();
+        int flag_len;
+        while ((flag_len = strlen(flags)) > 0) {
+            sds flag = NULL;
+            char *fp = strchr(flags, ',');
+            if (fp) {
+                *fp = '\0';
+                flag = sdsnew(flags);
+                flags = fp + 1;
+            } else {
+                flag = sdsnew(flags);
+                flags += flag_len;
+            }
+            if (strcmp(flag, "noaddr") == 0)
+                currentNode->flags |= CLUSTER_MANAGER_FLAG_NOADDR;
+            else if (strcmp(flag, "disconnected") == 0)
+                currentNode->flags |= CLUSTER_MANAGER_FLAG_DISCONNECT;
+            else if (strcmp(flag, "fail") == 0)
+                currentNode->flags |= CLUSTER_MANAGER_FLAG_FAIL;
+            else if (strcmp(flag, "slave") == 0) {
+                currentNode->flags |= CLUSTER_MANAGER_FLAG_SLAVE;
+                if (master_id != NULL) {
+                    if (currentNode->replicate) sdsfree(currentNode->replicate);
+                    currentNode->replicate = sdsnew(master_id);
+                }
+            }
+            listAddNodeTail(currentNode->flags_str, flag);
+        }
+        if (config_epoch != NULL)
+            currentNode->current_epoch = atoll(config_epoch);
+        if (ping_sent != NULL) currentNode->ping_sent = atoll(ping_sent);
+        if (ping_recv != NULL) currentNode->ping_recv = atoll(ping_recv);
+        if (!getfriends && myself) break;
+    }
+cleanup:
+    if (reply) freeReplyObject(reply);
+    return success;
+}
+
+/* Retrieves info about the cluster using argument 'node' as the starting
+ * point. All nodes will be loaded inside the cluster_manager.nodes list.
+ * Warning: if something goes wrong, it will free the starting node before
+ * returning 0. */
+static int clusterManagerLoadInfoFromNode(clusterManagerNode *node, int opts) {
+    if (node->context == NULL && !clusterManagerNodeConnect(node)) {
+        freeClusterManagerNode(node);
+        return 0;
+    }
+    opts |= CLUSTER_MANAGER_OPT_GETFRIENDS;
+    char *e = NULL;
+    if (!clusterManagerNodeIsCluster(node, &e)) {
+        clusterManagerPrintNotClusterNodeError(node, e);
+        if (e) zfree(e);
+        freeClusterManagerNode(node);
+        return 0;
+    }
+    e = NULL;
+    if (!clusterManagerNodeLoadInfo(node, opts, &e)) {
+        if (e) {
+            CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, e);
+            zfree(e);
+        }
+        freeClusterManagerNode(node);
+        return 0;
+    }
+    listIter li;
+    listNode *ln;
+    if (cluster_manager.nodes != NULL) {
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL)
+            freeClusterManagerNode((clusterManagerNode *) ln->value);
+        listRelease(cluster_manager.nodes);
+    }
+    cluster_manager.nodes = listCreate();
+    listAddNodeTail(cluster_manager.nodes, node);
+    if (node->friends != NULL) {
+        listRewind(node->friends, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *friend = ln->value;
+            if (!friend->ip || !friend->port) goto invalid_friend;
+            if (!friend->context && !clusterManagerNodeConnect(friend))
+                goto invalid_friend;
+            e = NULL;
+            if (clusterManagerNodeLoadInfo(friend, 0, &e)) {
+                if (friend->flags & (CLUSTER_MANAGER_FLAG_NOADDR |
+                                     CLUSTER_MANAGER_FLAG_DISCONNECT |
+                                     CLUSTER_MANAGER_FLAG_FAIL))
+                {
+                    goto invalid_friend;
+                }
+                listAddNodeTail(cluster_manager.nodes, friend);
+            } else {
+                clusterManagerLogErr("[ERR] Unable to load info for "
+                                     "node %s:%d\n",
+                                     friend->ip, friend->port);
+                goto invalid_friend;
+            }
+            continue;
+invalid_friend:
+            if (!(friend->flags & CLUSTER_MANAGER_FLAG_SLAVE))
+                cluster_manager.unreachable_masters++;
+            freeClusterManagerNode(friend);
+        }
+        listRelease(node->friends);
+        node->friends = NULL;
+    }
+    // Count replicas for each node
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->replicate != NULL) {
+            clusterManagerNode *master = clusterManagerNodeByName(n->replicate);
+            if (master == NULL) {
+                clusterManagerLogWarn("*** WARNING: %s:%d claims to be "
+                                      "slave of unknown node ID %s.\n",
+                                      n->ip, n->port, n->replicate);
+            } else master->replicas_count++;
+        }
+    }
+    return 1;
+}
+
+/* Compare functions used by various sorting operations. */
+int clusterManagerSlotCompare(const void *slot1, const void *slot2) {
+    const char **i1 = (const char **)slot1;
+    const char **i2 = (const char **)slot2;
+    return strcmp(*i1, *i2);
+}
+
+int clusterManagerSlotCountCompareDesc(const void *n1, const void *n2) {
+    clusterManagerNode *node1 = *((clusterManagerNode **) n1);
+    clusterManagerNode *node2 = *((clusterManagerNode **) n2);
+    return node2->slots_count - node1->slots_count;
+}
+
+int clusterManagerCompareNodeBalance(const void *n1, const void *n2) {
+    clusterManagerNode *node1 = *((clusterManagerNode **) n1);
+    clusterManagerNode *node2 = *((clusterManagerNode **) n2);
+    return node1->balance - node2->balance;
+}
+
+static sds clusterManagerGetConfigSignature(clusterManagerNode *node) {
+    sds signature = NULL;
+    int node_count = 0, i = 0, name_len = 0;
+    char **node_configs = NULL;
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
+    if (reply == NULL || reply->type == REDIS_REPLY_ERROR)
+        goto cleanup;
+    char *lines = reply->str, *p, *line;
+    while ((p = strstr(lines, "\n")) != NULL) {
+        i = 0;
+        *p = '\0';
+        line = lines;
+        lines = p + 1;
+        char *nodename = NULL;
+        int tot_size = 0;
+        while ((p = strchr(line, ' ')) != NULL) {
+            *p = '\0';
+            char *token = line;
+            line = p + 1;
+            if (i == 0) {
+                nodename = token;
+                tot_size = (p - token);
+                name_len = tot_size++; // Make room for ':' in tot_size
+            }
+            if (++i == 8) break;
+        }
+        if (i != 8) continue;
+        if (nodename == NULL) continue;
+        int remaining = strlen(line);
+        if (remaining == 0) continue;
+        char **slots = NULL;
+        int c = 0;
+        while (remaining > 0) {
+            p = strchr(line, ' ');
+            if (p == NULL) p = line + remaining;
+            int size = (p - line);
+            remaining -= size;
+            tot_size += size;
+            char *slotsdef = line;
+            *p = '\0';
+            if (remaining) {
+                line = p + 1;
+                remaining--;
+            } else line = p;
+            if (slotsdef[0] != '[') {
+                c++;
+                slots = zrealloc(slots, (c * sizeof(char *)));
+                slots[c - 1] = slotsdef;
+            }
+        }
+        if (c > 0) {
+            if (c > 1)
+                qsort(slots, c, sizeof(char *), clusterManagerSlotCompare);
+            node_count++;
+            node_configs =
+                zrealloc(node_configs, (node_count * sizeof(char *)));
+            /* Make room for '|' separators. */
+            tot_size += (sizeof(char) * (c - 1));
+            char *cfg = zmalloc((sizeof(char) * tot_size) + 1);
+            memcpy(cfg, nodename, name_len);
+            char *sp = cfg + name_len;
+            *(sp++) = ':';
+            for (i = 0; i < c; i++) {
+                if (i > 0) *(sp++) = ',';
+                int slen = strlen(slots[i]);
+                memcpy(sp, slots[i], slen);
+                sp += slen;
+            }
+            *(sp++) = '\0';
+            node_configs[node_count - 1] = cfg;
+        }
+        zfree(slots);
+    }
+    if (node_count > 0) {
+        if (node_count > 1) {
+            qsort(node_configs, node_count, sizeof(char *),
+                  clusterManagerSlotCompare);
+        }
+        signature = sdsempty();
+        for (i = 0; i < node_count; i++) {
+            if (i > 0) signature = sdscatprintf(signature, "%c", '|');
+            signature = sdscatfmt(signature, "%s", node_configs[i]);
+        }
+    }
+cleanup:
+    if (reply != NULL) freeReplyObject(reply);
+    if (node_configs != NULL) {
+        for (i = 0; i < node_count; i++) zfree(node_configs[i]);
+        zfree(node_configs);
+    }
+    return signature;
+}
+
+static int clusterManagerIsConfigConsistent(void) {
+    if (cluster_manager.nodes == NULL) return 0;
+    int consistent = (listLength(cluster_manager.nodes) <= 1);
+    // If the Cluster has only one node, it's always consistent
+    if (consistent) return 1;
+    sds first_cfg = NULL;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        sds cfg = clusterManagerGetConfigSignature(node);
+        if (cfg == NULL) {
+            consistent = 0;
+            break;
+        }
+        if (first_cfg == NULL) first_cfg = cfg;
+        else {
+            consistent = !sdscmp(first_cfg, cfg);
+            sdsfree(cfg);
+            if (!consistent) break;
+        }
+    }
+    if (first_cfg != NULL) sdsfree(first_cfg);
+    return consistent;
+}
+
+static list *clusterManagerGetDisconnectedLinks(clusterManagerNode *node) {
+    list *links = NULL;
+    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
+    if (!clusterManagerCheckRedisReply(node, reply, NULL)) goto cleanup;
+    links = listCreate();
+    char *lines = reply->str, *p, *line;
+    while ((p = strstr(lines, "\n")) != NULL) {
+        int i = 0;
+        *p = '\0';
+        line = lines;
+        lines = p + 1;
+        char *nodename = NULL, *addr = NULL, *flags = NULL, *link_status = NULL;
+        while ((p = strchr(line, ' ')) != NULL) {
+            *p = '\0';
+            char *token = line;
+            line = p + 1;
+            if (i == 0) nodename = token;
+            else if (i == 1) addr = token;
+            else if (i == 2) flags = token;
+            else if (i == 7) link_status = token;
+            else if (i == 8) break;
+            i++;
+        }
+        if (i == 7) link_status = line;
+        if (nodename == NULL || addr == NULL || flags == NULL ||
+            link_status == NULL) continue;
+        if (strstr(flags, "myself") != NULL) continue;
+        int disconnected = ((strstr(flags, "disconnected") != NULL) ||
+                            (strstr(link_status, "disconnected")));
+        int handshaking = (strstr(flags, "handshake") != NULL);
+        if (disconnected || handshaking) {
+            clusterManagerLink *link = zmalloc(sizeof(*link));
+            link->node_name = sdsnew(nodename);
+            link->node_addr = sdsnew(addr);
+            link->connected = 0;
+            link->handshaking = handshaking;
+            listAddNodeTail(links, link);
+        }
+    }
+cleanup:
+    if (reply != NULL) freeReplyObject(reply);
+    return links;
+}
+
+/* Check for disconnected cluster links. It returns a dict whose keys
+ * are the unreachable node addresses and the values are lists of
+ * node addresses that cannot reach the unreachable node. */
+static dict *clusterManagerGetLinkStatus(void) {
+    if (cluster_manager.nodes == NULL) return NULL;
+    dict *status = dictCreate(&clusterManagerLinkDictType, NULL);
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        list *links = clusterManagerGetDisconnectedLinks(node);
+        if (links) {
+            listIter lli;
+            listNode *lln;
+            listRewind(links, &lli);
+            while ((lln = listNext(&lli)) != NULL) {
+                clusterManagerLink *link = lln->value;
+                list *from = NULL;
+                dictEntry *entry = dictFind(status, link->node_addr);
+                if (entry) from = dictGetVal(entry);
+                else {
+                    from = listCreate();
+                    dictAdd(status, sdsdup(link->node_addr), from);
+                }
+                sds myaddr = sdsempty();
+                myaddr = sdscatfmt(myaddr, "%s:%u", node->ip, node->port);
+                listAddNodeTail(from, myaddr);
+                sdsfree(link->node_name);
+                sdsfree(link->node_addr);
+                zfree(link);
+            }
+            listRelease(links);
+        }
+    }
+    return status;
+}
+
+/* Add the error string to cluster_manager.errors and print it. */
+static void clusterManagerOnError(sds err) {
+    if (cluster_manager.errors == NULL)
+        cluster_manager.errors = listCreate();
+    listAddNodeTail(cluster_manager.errors, err);
+    clusterManagerLogErr("%s\n", (char *) err);
+}
+
+/* Check the slots coverage of the cluster. The 'all_slots' argument must be
+ * and array of 16384 bytes. Every covered slot will be set to 1 in the
+ * 'all_slots' array. The function returns the total number if covered slots.*/
+static int clusterManagerGetCoveredSlots(char *all_slots) {
+    if (cluster_manager.nodes == NULL) return 0;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    int totslots = 0, i;
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
+            if (node->slots[i] && !all_slots[i]) {
+                all_slots[i] = 1;
+                totslots++;
+            }
+        }
+    }
+    return totslots;
+}
+
+static void clusterManagerPrintSlotsList(list *slots) {
+    clusterManagerNode n = {0};
+    listIter li;
+    listNode *ln;
+    listRewind(slots, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        int slot = atoi(ln->value);
+        if (slot >= 0 && slot < CLUSTER_MANAGER_SLOTS)
+            n.slots[slot] = 1;
+    }
+    sds nodeslist = clusterManagerNodeSlotsString(&n);
+    printf("%s\n", nodeslist);
+    sdsfree(nodeslist);
+}
+
+/* Return the node, among 'nodes' with the greatest number of keys
+ * in the specified slot. */
+static clusterManagerNode * clusterManagerGetNodeWithMostKeysInSlot(list *nodes,
+                                                                    int slot,
+                                                                    char **err)
+{
+    clusterManagerNode *node = NULL;
+    int numkeys = 0;
+    listIter li;
+    listNode *ln;
+    listRewind(nodes, &li);
+    if (err) *err = NULL;
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
+            continue;
+        redisReply *r =
+            CLUSTER_MANAGER_COMMAND(n, "CLUSTER COUNTKEYSINSLOT %d", slot);
+        int success = clusterManagerCheckRedisReply(n, r, err);
+        if (success) {
+            if (r->integer > numkeys || node == NULL) {
+                numkeys = r->integer;
+                node = n;
+            }
+        }
+        if (r != NULL) freeReplyObject(r);
+        /* If the reply contains errors */
+        if (!success) {
+            if (err != NULL && *err != NULL)
+                CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, err);
+            node = NULL;
+            break;
+        }
+    }
+    return node;
+}
+
+/* This function returns the master that has the least number of replicas
+ * in the cluster. If there are multiple masters with the same smaller
+ * number of replicas, one at random is returned. */
+
+static clusterManagerNode *clusterManagerNodeWithLeastReplicas() {
+    clusterManagerNode *node = NULL;
+    int lowest_count = 0;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        if (node == NULL || n->replicas_count < lowest_count) {
+            node = n;
+            lowest_count = n->replicas_count;
+        }
+    }
+    return node;
+}
+
+/* This function returns a random master node, return NULL if none */
+
+static clusterManagerNode *clusterManagerNodeMasterRandom() {
+    int master_count = 0;
+    int idx;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        master_count++;
+    }
+
+    srand(time(NULL));
+    idx = rand() % master_count;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        if (!idx--) {
+            return n;
+        }
+    }
+    /* Can not be reached */
+    return NULL;
+}
+
+static int clusterManagerFixSlotsCoverage(char *all_slots) {
+    int force_fix = config.cluster_manager_command.flags &
+                    CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
+
+    if (cluster_manager.unreachable_masters > 0 && !force_fix) {
+        clusterManagerLogWarn("*** Fixing slots coverage with %d unreachable masters is dangerous: redis-cli will assume that slots about masters that are not reachable are not covered, and will try to reassign them to the reachable nodes. This can cause data loss and is rarely what you want to do. If you really want to proceed use the --cluster-fix-with-unreachable-masters option.\n", cluster_manager.unreachable_masters);
+        exit(1);
+    }
+
+    int i, fixed = 0;
+    list *none = NULL, *single = NULL, *multi = NULL;
+    clusterManagerLogInfo(">>> Fixing slots coverage...\n");
+    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
+        int covered = all_slots[i];
+        if (!covered) {
+            sds slot = sdsfromlonglong((long long) i);
+            list *slot_nodes = listCreate();
+            sds slot_nodes_str = sdsempty();
+            listIter li;
+            listNode *ln;
+            listRewind(cluster_manager.nodes, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                clusterManagerNode *n = ln->value;
+                if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
+                    continue;
+                redisReply *reply = CLUSTER_MANAGER_COMMAND(n,
+                    "CLUSTER GETKEYSINSLOT %d %d", i, 1);
+                if (!clusterManagerCheckRedisReply(n, reply, NULL)) {
+                    fixed = -1;
+                    if (reply) freeReplyObject(reply);
+                    goto cleanup;
+                }
+                assert(reply->type == REDIS_REPLY_ARRAY);
+                if (reply->elements > 0) {
+                    listAddNodeTail(slot_nodes, n);
+                    if (listLength(slot_nodes) > 1)
+                        slot_nodes_str = sdscat(slot_nodes_str, ", ");
+                    slot_nodes_str = sdscatfmt(slot_nodes_str,
+                                               "%s:%u", n->ip, n->port);
+                }
+                freeReplyObject(reply);
+            }
+            sdsfree(slot_nodes_str);
+            dictAdd(clusterManagerUncoveredSlots, slot, slot_nodes);
+        }
+    }
+
+    /* For every slot, take action depending on the actual condition:
+     * 1) No node has keys for this slot.
+     * 2) A single node has keys for this slot.
+     * 3) Multiple nodes have keys for this slot. */
+    none = listCreate();
+    single = listCreate();
+    multi = listCreate();
+    dictIterator *iter = dictGetIterator(clusterManagerUncoveredSlots);
+    dictEntry *entry;
+    while ((entry = dictNext(iter)) != NULL) {
+        sds slot = (sds) dictGetKey(entry);
+        list *nodes = (list *) dictGetVal(entry);
+        switch (listLength(nodes)){
+        case 0: listAddNodeTail(none, slot); break;
+        case 1: listAddNodeTail(single, slot); break;
+        default: listAddNodeTail(multi, slot); break;
+        }
+    }
+    dictReleaseIterator(iter);
+
+    /* we want explicit manual confirmation from users for all the fix cases */
+    int ignore_force = 1;
+
+    /*  Handle case "1": keys in no node. */
+    if (listLength(none) > 0) {
+        printf("The following uncovered slots have no keys "
+               "across the cluster:\n");
+        clusterManagerPrintSlotsList(none);
+        if (confirmWithYes("Fix these slots by covering with a random node?",
+                           ignore_force)) {
+            listIter li;
+            listNode *ln;
+            listRewind(none, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                sds slot = ln->value;
+                int s = atoi(slot);
+                clusterManagerNode *n = clusterManagerNodeMasterRandom();
+                clusterManagerLogInfo(">>> Covering slot %s with %s:%d\n",
+                                      slot, n->ip, n->port);
+                if (!clusterManagerSetSlotOwner(n, s, 0)) {
+                    fixed = -1;
+                    goto cleanup;
+                }
+                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
+                 * info into the node struct, in order to keep it synced */
+                n->slots[s] = 1;
+                fixed++;
+            }
+        }
+    }
+
+    /*  Handle case "2": keys only in one node. */
+    if (listLength(single) > 0) {
+        printf("The following uncovered slots have keys in just one node:\n");
+        clusterManagerPrintSlotsList(single);
+        if (confirmWithYes("Fix these slots by covering with those nodes?",
+                           ignore_force)) {
+            listIter li;
+            listNode *ln;
+            listRewind(single, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                sds slot = ln->value;
+                int s = atoi(slot);
+                dictEntry *entry = dictFind(clusterManagerUncoveredSlots, slot);
+                assert(entry != NULL);
+                list *nodes = (list *) dictGetVal(entry);
+                listNode *fn = listFirst(nodes);
+                assert(fn != NULL);
+                clusterManagerNode *n = fn->value;
+                clusterManagerLogInfo(">>> Covering slot %s with %s:%d\n",
+                                      slot, n->ip, n->port);
+                if (!clusterManagerSetSlotOwner(n, s, 0)) {
+                    fixed = -1;
+                    goto cleanup;
+                }
+                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
+                 * info into the node struct, in order to keep it synced */
+                n->slots[atoi(slot)] = 1;
+                fixed++;
+            }
+        }
+    }
+
+    /* Handle case "3": keys in multiple nodes. */
+    if (listLength(multi) > 0) {
+        printf("The following uncovered slots have keys in multiple nodes:\n");
+        clusterManagerPrintSlotsList(multi);
+        if (confirmWithYes("Fix these slots by moving keys "
+                           "into a single node?", ignore_force)) {
+            listIter li;
+            listNode *ln;
+            listRewind(multi, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                sds slot = ln->value;
+                dictEntry *entry = dictFind(clusterManagerUncoveredSlots, slot);
+                assert(entry != NULL);
+                list *nodes = (list *) dictGetVal(entry);
+                int s = atoi(slot);
+                clusterManagerNode *target =
+                    clusterManagerGetNodeWithMostKeysInSlot(nodes, s, NULL);
+                if (target == NULL) {
+                    fixed = -1;
+                    goto cleanup;
+                }
+                clusterManagerLogInfo(">>> Covering slot %s moving keys "
+                                      "to %s:%d\n", slot,
+                                      target->ip, target->port);
+                if (!clusterManagerSetSlotOwner(target, s, 1)) {
+                    fixed = -1;
+                    goto cleanup;
+                }
+                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
+                 * info into the node struct, in order to keep it synced */
+                target->slots[atoi(slot)] = 1;
+                listIter nli;
+                listNode *nln;
+                listRewind(nodes, &nli);
+                while ((nln = listNext(&nli)) != NULL) {
+                    clusterManagerNode *src = nln->value;
+                    if (src == target) continue;
+                    /* Assign the slot to target node in the source node. */
+                    if (!clusterManagerSetSlot(src, target, s, "NODE", NULL))
+                        fixed = -1;
+                    if (fixed < 0) goto cleanup;
+                    /* Set the source node in 'importing' state
+                     * (even if we will actually migrate keys away)
+                     * in order to avoid receiving redirections
+                     * for MIGRATE. */
+                    if (!clusterManagerSetSlot(src, target, s,
+                                               "IMPORTING", NULL)) fixed = -1;
+                    if (fixed < 0) goto cleanup;
+                    int opts = CLUSTER_MANAGER_OPT_VERBOSE |
+                               CLUSTER_MANAGER_OPT_COLD;
+                    if (!clusterManagerMoveSlot(src, target, s, opts, NULL)) {
+                        fixed = -1;
+                        goto cleanup;
+                    }
+                    if (!clusterManagerClearSlotStatus(src, s))
+                        fixed = -1;
+                    if (fixed < 0) goto cleanup;
+                }
+                fixed++;
+            }
+        }
+    }
+cleanup:
+    if (none) listRelease(none);
+    if (single) listRelease(single);
+    if (multi) listRelease(multi);
+    return fixed;
+}
+
+/* Slot 'slot' was found to be in importing or migrating state in one or
+ * more nodes. This function fixes this condition by migrating keys where
+ * it seems more sensible. */
+static int clusterManagerFixOpenSlot(int slot) {
+    int force_fix = config.cluster_manager_command.flags &
+                    CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
+
+    if (cluster_manager.unreachable_masters > 0 && !force_fix) {
+        clusterManagerLogWarn("*** Fixing open slots with %d unreachable masters is dangerous: redis-cli will assume that slots about masters that are not reachable are not covered, and will try to reassign them to the reachable nodes. This can cause data loss and is rarely what you want to do. If you really want to proceed use the --cluster-fix-with-unreachable-masters option.\n", cluster_manager.unreachable_masters);
+        exit(1);
+    }
+
+    clusterManagerLogInfo(">>> Fixing open slot %d\n", slot);
+    /* Try to obtain the current slot owner, according to the current
+     * nodes configuration. */
+    int success = 1;
+    list *owners = listCreate();    /* List of nodes claiming some ownership.
+                                       it could be stating in the configuration
+                                       to have the node ownership, or just
+                                       holding keys for such slot. */
+    list *migrating = listCreate();
+    list *importing = listCreate();
+    sds migrating_str = sdsempty();
+    sds importing_str = sdsempty();
+    clusterManagerNode *owner = NULL; /* The obvious slot owner if any. */
+
+    /* Iterate all the nodes, looking for potential owners of this slot. */
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        if (n->slots[slot]) {
+            listAddNodeTail(owners, n);
+        } else {
+            redisReply *r = CLUSTER_MANAGER_COMMAND(n,
+                "CLUSTER COUNTKEYSINSLOT %d", slot);
+            success = clusterManagerCheckRedisReply(n, r, NULL);
+            if (success && r->integer > 0) {
+                clusterManagerLogWarn("*** Found keys about slot %d "
+                                      "in non-owner node %s:%d!\n", slot,
+                                      n->ip, n->port);
+                listAddNodeTail(owners, n);
+            }
+            if (r) freeReplyObject(r);
+            if (!success) goto cleanup;
+        }
+    }
+
+    /* If we have only a single potential owner for this slot,
+     * set it as "owner". */
+    if (listLength(owners) == 1) owner = listFirst(owners)->value;
+
+    /* Scan the list of nodes again, in order to populate the
+     * list of nodes in importing or migrating state for
+     * this slot. */
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        int is_migrating = 0, is_importing = 0;
+        if (n->migrating) {
+            for (int i = 0; i < n->migrating_count; i += 2) {
+                sds migrating_slot = n->migrating[i];
+                if (atoi(migrating_slot) == slot) {
+                    char *sep = (listLength(migrating) == 0 ? "" : ",");
+                    migrating_str = sdscatfmt(migrating_str, "%s%s:%u",
+                                              sep, n->ip, n->port);
+                    listAddNodeTail(migrating, n);
+                    is_migrating = 1;
+                    break;
+                }
+            }
+        }
+        if (!is_migrating && n->importing) {
+            for (int i = 0; i < n->importing_count; i += 2) {
+                sds importing_slot = n->importing[i];
+                if (atoi(importing_slot) == slot) {
+                    char *sep = (listLength(importing) == 0 ? "" : ",");
+                    importing_str = sdscatfmt(importing_str, "%s%s:%u",
+                                              sep, n->ip, n->port);
+                    listAddNodeTail(importing, n);
+                    is_importing = 1;
+                    break;
+                }
+            }
+        }
+
+        /* If the node is neither migrating nor importing and it's not
+         * the owner, then is added to the importing list in case
+         * it has keys in the slot. */
+        if (!is_migrating && !is_importing && n != owner) {
+            redisReply *r = CLUSTER_MANAGER_COMMAND(n,
+                "CLUSTER COUNTKEYSINSLOT %d", slot);
+            success = clusterManagerCheckRedisReply(n, r, NULL);
+            if (success && r->integer > 0) {
+                clusterManagerLogWarn("*** Found keys about slot %d "
+                                      "in node %s:%d!\n", slot, n->ip,
+                                      n->port);
+                char *sep = (listLength(importing) == 0 ? "" : ",");
+                importing_str = sdscatfmt(importing_str, "%s%S:%u",
+                                          sep, n->ip, n->port);
+                listAddNodeTail(importing, n);
+            }
+            if (r) freeReplyObject(r);
+            if (!success) goto cleanup;
+        }
+    }
+    if (sdslen(migrating_str) > 0)
+        printf("Set as migrating in: %s\n", migrating_str);
+    if (sdslen(importing_str) > 0)
+        printf("Set as importing in: %s\n", importing_str);
+
+    /* If there is no slot owner, set as owner the node with the biggest
+     * number of keys, among the set of migrating / importing nodes. */
+    if (owner == NULL) {
+        clusterManagerLogInfo(">>> No single clear owner for the slot, "
+                              "selecting an owner by # of keys...\n");
+        owner = clusterManagerGetNodeWithMostKeysInSlot(cluster_manager.nodes,
+                                                        slot, NULL);
+        // If we still don't have an owner, we can't fix it.
+        if (owner == NULL) {
+            clusterManagerLogErr("[ERR] Can't select a slot owner. "
+                                 "Impossible to fix.\n");
+            success = 0;
+            goto cleanup;
+        }
+
+        // Use ADDSLOTS to assign the slot.
+        clusterManagerLogWarn("*** Configuring %s:%d as the slot owner\n",
+                              owner->ip, owner->port);
+        success = clusterManagerClearSlotStatus(owner, slot);
+        if (!success) goto cleanup;
+        success = clusterManagerSetSlotOwner(owner, slot, 0);
+        if (!success) goto cleanup;
+        /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
+         * info into the node struct, in order to keep it synced */
+        owner->slots[slot] = 1;
+        /* Make sure this information will propagate. Not strictly needed
+         * since there is no past owner, so all the other nodes will accept
+         * whatever epoch this node will claim the slot with. */
+        success = clusterManagerBumpEpoch(owner);
+        if (!success) goto cleanup;
+        /* Remove the owner from the list of migrating/importing
+         * nodes. */
+        clusterManagerRemoveNodeFromList(migrating, owner);
+        clusterManagerRemoveNodeFromList(importing, owner);
+    }
+
+    /* If there are multiple owners of the slot, we need to fix it
+     * so that a single node is the owner and all the other nodes
+     * are in importing state. Later the fix can be handled by one
+     * of the base cases above.
+     *
+     * Note that this case also covers multiple nodes having the slot
+     * in migrating state, since migrating is a valid state only for
+     * slot owners. */
+    if (listLength(owners) > 1) {
+        /* Owner cannot be NULL at this point, since if there are more owners,
+         * the owner has been set in the previous condition (owner == NULL). */
+        assert(owner != NULL);
+        listRewind(owners, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n == owner) continue;
+            success = clusterManagerDelSlot(n, slot, 1);
+            if (!success) goto cleanup;
+            n->slots[slot] = 0;
+            /* Assign the slot to the owner in the node 'n' configuration.' */
+            success = clusterManagerSetSlot(n, owner, slot, "node", NULL);
+            if (!success) goto cleanup;
+            success = clusterManagerSetSlot(n, owner, slot, "importing", NULL);
+            if (!success) goto cleanup;
+            /* Avoid duplicates. */
+            clusterManagerRemoveNodeFromList(importing, n);
+            listAddNodeTail(importing, n);
+            /* Ensure that the node is not in the migrating list. */
+            clusterManagerRemoveNodeFromList(migrating, n);
+        }
+    }
+    int move_opts = CLUSTER_MANAGER_OPT_VERBOSE;
+
+    /* Case 1: The slot is in migrating state in one node, and in
+     *         importing state in 1 node. That's trivial to address. */
+    if (listLength(migrating) == 1 && listLength(importing) == 1) {
+        clusterManagerNode *src = listFirst(migrating)->value;
+        clusterManagerNode *dst = listFirst(importing)->value;
+        clusterManagerLogInfo(">>> Case 1: Moving slot %d from "
+                              "%s:%d to %s:%d\n", slot,
+                              src->ip, src->port, dst->ip, dst->port);
+        move_opts |= CLUSTER_MANAGER_OPT_UPDATE;
+        success = clusterManagerMoveSlot(src, dst, slot, move_opts, NULL);
+    }
+
+    /* Case 2: There are multiple nodes that claim the slot as importing,
+     * they probably got keys about the slot after a restart so opened
+     * the slot. In this case we just move all the keys to the owner
+     * according to the configuration. */
+    else if (listLength(migrating) == 0 && listLength(importing) > 0) {
+        clusterManagerLogInfo(">>> Case 2: Moving all the %d slot keys to its "
+                              "owner %s:%d\n", slot, owner->ip, owner->port);
+        move_opts |= CLUSTER_MANAGER_OPT_COLD;
+        listRewind(importing, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n == owner) continue;
+            success = clusterManagerMoveSlot(n, owner, slot, move_opts, NULL);
+            if (!success) goto cleanup;
+            clusterManagerLogInfo(">>> Setting %d as STABLE in "
+                                  "%s:%d\n", slot, n->ip, n->port);
+            success = clusterManagerClearSlotStatus(n, slot);
+            if (!success) goto cleanup;
+        }
+        /* Since the slot has been moved in "cold" mode, ensure that all the
+         * other nodes update their own configuration about the slot itself. */
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n == owner) continue;
+            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+            success = clusterManagerSetSlot(n, owner, slot, "NODE", NULL);
+            if (!success) goto cleanup;
+        }
+    }
+
+    /* Case 3: The slot is in migrating state in one node but multiple
+     * other nodes claim to be in importing state and don't have any key in
+     * the slot. We search for the importing node having the same ID as
+     * the destination node of the migrating node.
+     * In that case we move the slot from the migrating node to this node and
+     * we close the importing states on all the other importing nodes.
+     * If no importing node has the same ID as the destination node of the
+     * migrating node, the slot's state is closed on both the migrating node
+     * and the importing nodes. */
+    else if (listLength(migrating) == 1 && listLength(importing) > 1) {
+        int try_to_fix = 1;
+        clusterManagerNode *src = listFirst(migrating)->value;
+        clusterManagerNode *dst = NULL;
+        sds target_id = NULL;
+        for (int i = 0; i < src->migrating_count; i += 2) {
+            sds migrating_slot = src->migrating[i];
+            if (atoi(migrating_slot) == slot) {
+                target_id = src->migrating[i + 1];
+                break;
+            }
+        }
+        assert(target_id != NULL);
+        listIter li;
+        listNode *ln;
+        listRewind(importing, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            int count = clusterManagerCountKeysInSlot(n, slot);
+            if (count > 0) {
+                try_to_fix = 0;
+                break;
+            }
+            if (strcmp(n->name, target_id) == 0) dst = n;
+        }
+        if (!try_to_fix) goto unhandled_case;
+        if (dst != NULL) {
+            clusterManagerLogInfo(">>> Case 3: Moving slot %d from %s:%d to "
+                                  "%s:%d and closing it on all the other "
+                                  "importing nodes.\n",
+                                  slot, src->ip, src->port,
+                                  dst->ip, dst->port);
+            /* Move the slot to the destination node. */
+            success = clusterManagerMoveSlot(src, dst, slot, move_opts, NULL);
+            if (!success) goto cleanup;
+            /* Close slot on all the other importing nodes. */
+            listRewind(importing, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                clusterManagerNode *n = ln->value;
+                if (dst == n) continue;
+                success = clusterManagerClearSlotStatus(n, slot);
+                if (!success) goto cleanup;
+            }
+        } else {
+            clusterManagerLogInfo(">>> Case 3: Closing slot %d on both "
+                                  "migrating and importing nodes.\n", slot);
+            /* Close the slot on both the migrating node and the importing
+             * nodes. */
+            success = clusterManagerClearSlotStatus(src, slot);
+            if (!success) goto cleanup;
+            listRewind(importing, &li);
+            while ((ln = listNext(&li)) != NULL) {
+                clusterManagerNode *n = ln->value;
+                success = clusterManagerClearSlotStatus(n, slot);
+                if (!success) goto cleanup;
+            }
+        }
+    } else {
+        int try_to_close_slot = (listLength(importing) == 0 &&
+                                 listLength(migrating) == 1);
+        if (try_to_close_slot) {
+            clusterManagerNode *n = listFirst(migrating)->value;
+            if (!owner || owner != n) {
+                redisReply *r = CLUSTER_MANAGER_COMMAND(n,
+                    "CLUSTER GETKEYSINSLOT %d %d", slot, 10);
+                success = clusterManagerCheckRedisReply(n, r, NULL);
+                if (r) {
+                    if (success) try_to_close_slot = (r->elements == 0);
+                    freeReplyObject(r);
+                }
+                if (!success) goto cleanup;
+            }
+        }
+        /* Case 4: There are no slots claiming to be in importing state, but
+         * there is a migrating node that actually don't have any key or is the
+         * slot owner. We can just close the slot, probably a reshard
+         * interrupted in the middle. */
+        if (try_to_close_slot) {
+            clusterManagerNode *n = listFirst(migrating)->value;
+            clusterManagerLogInfo(">>> Case 4: Closing slot %d on %s:%d\n",
+                                  slot, n->ip, n->port);
+            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER SETSLOT %d %s",
+                                                    slot, "STABLE");
+            success = clusterManagerCheckRedisReply(n, r, NULL);
+            if (r) freeReplyObject(r);
+            if (!success) goto cleanup;
+        } else {
+unhandled_case:
+            success = 0;
+            clusterManagerLogErr("[ERR] Sorry, redis-cli can't fix this slot "
+                                 "yet (work in progress). Slot is set as "
+                                 "migrating in %s, as importing in %s, "
+                                 "owner is %s:%d\n", migrating_str,
+                                 importing_str, owner->ip, owner->port);
+        }
+    }
+cleanup:
+    listRelease(owners);
+    listRelease(migrating);
+    listRelease(importing);
+    sdsfree(migrating_str);
+    sdsfree(importing_str);
+    return success;
+}
+
+static int clusterManagerFixMultipleSlotOwners(int slot, list *owners) {
+    clusterManagerLogInfo(">>> Fixing multiple owners for slot %d...\n", slot);
+    int success = 0;
+    assert(listLength(owners) > 1);
+    clusterManagerNode *owner = clusterManagerGetNodeWithMostKeysInSlot(owners,
+                                                                        slot,
+                                                                        NULL);
+    if (!owner) owner = listFirst(owners)->value;
+    clusterManagerLogInfo(">>> Setting slot %d owner: %s:%d\n",
+                          slot, owner->ip, owner->port);
+    /* Set the slot owner. */
+    if (!clusterManagerSetSlotOwner(owner, slot, 0)) return 0;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    /* Update configuration in all the other master nodes by assigning the slot
+     * itself to the new owner, and by eventually migrating keys if the node
+     * has keys for the slot. */
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n == owner) continue;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+        int count = clusterManagerCountKeysInSlot(n, slot);
+        success = (count >= 0);
+        if (!success) break;
+        clusterManagerDelSlot(n, slot, 1);
+        if (!clusterManagerSetSlot(n, owner, slot, "node", NULL)) return 0;
+        if (count > 0) {
+            int opts = CLUSTER_MANAGER_OPT_VERBOSE |
+                       CLUSTER_MANAGER_OPT_COLD;
+            success = clusterManagerMoveSlot(n, owner, slot, opts, NULL);
+            if (!success) break;
+        }
+    }
+    return success;
+}
+
+static int clusterManagerCheckCluster(int quiet) {
+    listNode *ln = listFirst(cluster_manager.nodes);
+    if (!ln) return 0;
+    clusterManagerNode *node = ln->value;
+    clusterManagerLogInfo(">>> Performing Cluster Check (using node %s:%d)\n",
+                          node->ip, node->port);
+    int result = 1, consistent = 0;
+    int do_fix = config.cluster_manager_command.flags &
+                 CLUSTER_MANAGER_CMD_FLAG_FIX;
+    if (!quiet) clusterManagerShowNodes();
+    consistent = clusterManagerIsConfigConsistent();
+    if (!consistent) {
+        sds err = sdsnew("[ERR] Nodes don't agree about configuration!");
+        clusterManagerOnError(err);
+        result = 0;
+    } else {
+        clusterManagerLogOk("[OK] All nodes agree about slots "
+                            "configuration.\n");
+    }
+    /* Check open slots */
+    clusterManagerLogInfo(">>> Check for open slots...\n");
+    listIter li;
+    listRewind(cluster_manager.nodes, &li);
+    int i;
+    dict *open_slots = NULL;
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->migrating != NULL) {
+            if (open_slots == NULL)
+                open_slots = dictCreate(&clusterManagerDictType, NULL);
+            sds errstr = sdsempty();
+            errstr = sdscatprintf(errstr,
+                                "[WARNING] Node %s:%d has slots in "
+                                "migrating state ",
+                                n->ip,
+                                n->port);
+            for (i = 0; i < n->migrating_count; i += 2) {
+                sds slot = n->migrating[i];
+                dictReplace(open_slots, slot, sdsdup(n->migrating[i + 1]));
+                char *fmt = (i > 0 ? ",%S" : "%S");
+                errstr = sdscatfmt(errstr, fmt, slot);
+            }
+            errstr = sdscat(errstr, ".");
+            clusterManagerOnError(errstr);
+        }
+        if (n->importing != NULL) {
+            if (open_slots == NULL)
+                open_slots = dictCreate(&clusterManagerDictType, NULL);
+            sds errstr = sdsempty();
+            errstr = sdscatprintf(errstr,
+                                "[WARNING] Node %s:%d has slots in "
+                                "importing state ",
+                                n->ip,
+                                n->port);
+            for (i = 0; i < n->importing_count; i += 2) {
+                sds slot = n->importing[i];
+                dictReplace(open_slots, slot, sdsdup(n->importing[i + 1]));
+                char *fmt = (i > 0 ? ",%S" : "%S");
+                errstr = sdscatfmt(errstr, fmt, slot);
+            }
+            errstr = sdscat(errstr, ".");
+            clusterManagerOnError(errstr);
+        }
+    }
+    if (open_slots != NULL) {
+        result = 0;
+        dictIterator *iter = dictGetIterator(open_slots);
+        dictEntry *entry;
+        sds errstr = sdsnew("[WARNING] The following slots are open: ");
+        i = 0;
+        while ((entry = dictNext(iter)) != NULL) {
+            sds slot = (sds) dictGetKey(entry);
+            char *fmt = (i++ > 0 ? ",%S" : "%S");
+            errstr = sdscatfmt(errstr, fmt, slot);
+        }
+        clusterManagerLogErr("%s.\n", (char *) errstr);
+        sdsfree(errstr);
+        if (do_fix) {
+            /* Fix open slots. */
+            dictReleaseIterator(iter);
+            iter = dictGetIterator(open_slots);
+            while ((entry = dictNext(iter)) != NULL) {
+                sds slot = (sds) dictGetKey(entry);
+                result = clusterManagerFixOpenSlot(atoi(slot));
+                if (!result) break;
+            }
+        }
+        dictReleaseIterator(iter);
+        dictRelease(open_slots);
+    }
+    clusterManagerLogInfo(">>> Check slots coverage...\n");
+    char slots[CLUSTER_MANAGER_SLOTS];
+    memset(slots, 0, CLUSTER_MANAGER_SLOTS);
+    int coverage = clusterManagerGetCoveredSlots(slots);
+    if (coverage == CLUSTER_MANAGER_SLOTS) {
+        clusterManagerLogOk("[OK] All %d slots covered.\n",
+                            CLUSTER_MANAGER_SLOTS);
+    } else {
+        sds err = sdsempty();
+        err = sdscatprintf(err, "[ERR] Not all %d slots are "
+                                "covered by nodes.\n",
+                                CLUSTER_MANAGER_SLOTS);
+        clusterManagerOnError(err);
+        result = 0;
+        if (do_fix/* && result*/) {
+            dictType dtype = clusterManagerDictType;
+            dtype.keyDestructor = dictSdsDestructor;
+            dtype.valDestructor = dictListDestructor;
+            clusterManagerUncoveredSlots = dictCreate(&dtype, NULL);
+            int fixed = clusterManagerFixSlotsCoverage(slots);
+            if (fixed > 0) result = 1;
+        }
+    }
+    int search_multiple_owners = config.cluster_manager_command.flags &
+                                 CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS;
+    if (search_multiple_owners) {
+        /* Check whether there are multiple owners, even when slots are
+         * fully covered and there are no open slots. */
+        clusterManagerLogInfo(">>> Check for multiple slot owners...\n");
+        int slot = 0, slots_with_multiple_owners = 0;
+        for (; slot < CLUSTER_MANAGER_SLOTS; slot++) {
+            listIter li;
+            listNode *ln;
+            listRewind(cluster_manager.nodes, &li);
+            list *owners = listCreate();
+            while ((ln = listNext(&li)) != NULL) {
+                clusterManagerNode *n = ln->value;
+                if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+                if (n->slots[slot]) listAddNodeTail(owners, n);
+                else {
+                    /* Nodes having keys for the slot will be considered
+                     * owners too. */
+                    int count = clusterManagerCountKeysInSlot(n, slot);
+                    if (count > 0) listAddNodeTail(owners, n);
+                }
+            }
+            if (listLength(owners) > 1) {
+                result = 0;
+                clusterManagerLogErr("[WARNING] Slot %d has %d owners:\n",
+                                     slot, listLength(owners));
+                listRewind(owners, &li);
+                while ((ln = listNext(&li)) != NULL) {
+                    clusterManagerNode *n = ln->value;
+                    clusterManagerLogErr("    %s:%d\n", n->ip, n->port);
+                }
+                slots_with_multiple_owners++;
+                if (do_fix) {
+                    result = clusterManagerFixMultipleSlotOwners(slot, owners);
+                    if (!result) {
+                        clusterManagerLogErr("Failed to fix multiple owners "
+                                             "for slot %d\n", slot);
+                        listRelease(owners);
+                        break;
+                    } else slots_with_multiple_owners--;
+                }
+            }
+            listRelease(owners);
+        }
+        if (slots_with_multiple_owners == 0)
+            clusterManagerLogOk("[OK] No multiple owners found.\n");
+    }
+    return result;
+}
+
+static clusterManagerNode *clusterNodeForResharding(char *id,
+                                                    clusterManagerNode *target,
+                                                    int *raise_err)
+{
+    clusterManagerNode *node = NULL;
+    const char *invalid_node_msg = "*** The specified node (%s) is not known "
+                                   "or not a master, please retry.\n";
+    node = clusterManagerNodeByName(id);
+    *raise_err = 0;
+    if (!node || node->flags & CLUSTER_MANAGER_FLAG_SLAVE) {
+        clusterManagerLogErr(invalid_node_msg, id);
+        *raise_err = 1;
+        return NULL;
+    } else if (target != NULL) {
+        if (!strcmp(node->name, target->name)) {
+            clusterManagerLogErr( "*** It is not possible to use "
+                                  "the target node as "
+                                  "source node.\n");
+            return NULL;
+        }
+    }
+    return node;
+}
+
+static list *clusterManagerComputeReshardTable(list *sources, int numslots) {
+    list *moved = listCreate();
+    int src_count = listLength(sources), i = 0, tot_slots = 0, j;
+    clusterManagerNode **sorted = zmalloc(src_count * sizeof(*sorted));
+    listIter li;
+    listNode *ln;
+    listRewind(sources, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *node = ln->value;
+        tot_slots += node->slots_count;
+        sorted[i++] = node;
+    }
+    qsort(sorted, src_count, sizeof(clusterManagerNode *),
+          clusterManagerSlotCountCompareDesc);
+    for (i = 0; i < src_count; i++) {
+        clusterManagerNode *node = sorted[i];
+        float n = ((float) numslots / tot_slots * node->slots_count);
+        if (i == 0) n = ceil(n);
+        else n = floor(n);
+        int max = (int) n, count = 0;
+        for (j = 0; j < CLUSTER_MANAGER_SLOTS; j++) {
+            int slot = node->slots[j];
+            if (!slot) continue;
+            if (count >= max || (int)listLength(moved) >= numslots) break;
+            clusterManagerReshardTableItem *item = zmalloc(sizeof(*item));
+            item->source = node;
+            item->slot = j;
+            listAddNodeTail(moved, item);
+            count++;
+        }
+    }
+    zfree(sorted);
+    return moved;
+}
+
+static void clusterManagerShowReshardTable(list *table) {
+    listIter li;
+    listNode *ln;
+    listRewind(table, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerReshardTableItem *item = ln->value;
+        clusterManagerNode *n = item->source;
+        printf("    Moving slot %d from %s\n", item->slot, (char *) n->name);
+    }
+}
+
+static void clusterManagerReleaseReshardTable(list *table) {
+    if (table != NULL) {
+        listIter li;
+        listNode *ln;
+        listRewind(table, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerReshardTableItem *item = ln->value;
+            zfree(item);
+        }
+        listRelease(table);
+    }
+}
+
+static void clusterManagerLog(int level, const char* fmt, ...) {
+    int use_colors =
+        (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_COLOR);
+    if (use_colors) {
+        printf("\033[");
+        switch (level) {
+        case CLUSTER_MANAGER_LOG_LVL_INFO: printf(LOG_COLOR_BOLD); break;
+        case CLUSTER_MANAGER_LOG_LVL_WARN: printf(LOG_COLOR_YELLOW); break;
+        case CLUSTER_MANAGER_LOG_LVL_ERR: printf(LOG_COLOR_RED); break;
+        case CLUSTER_MANAGER_LOG_LVL_SUCCESS: printf(LOG_COLOR_GREEN); break;
+        default: printf(LOG_COLOR_RESET); break;
+        }
+    }
+    va_list ap;
+    va_start(ap, fmt);
+    vprintf(fmt, ap);
+    va_end(ap);
+    if (use_colors) printf("\033[" LOG_COLOR_RESET);
+}
+
+static void clusterManagerNodeArrayInit(clusterManagerNodeArray *array,
+                                        int alloc_len)
+{
+    array->nodes = zcalloc(alloc_len * sizeof(clusterManagerNode*));
+    array->alloc = array->nodes;
+    array->len = alloc_len;
+    array->count = 0;
+}
+
+/* Reset array->nodes to the original array allocation and re-count non-NULL
+ * nodes. */
+static void clusterManagerNodeArrayReset(clusterManagerNodeArray *array) {
+    if (array->nodes > array->alloc) {
+        array->len = array->nodes - array->alloc;
+        array->nodes = array->alloc;
+        array->count = 0;
+        int i = 0;
+        for(; i < array->len; i++) {
+            if (array->nodes[i] != NULL) array->count++;
+        }
+    }
+}
+
+/* Shift array->nodes and store the shifted node into 'nodeptr'. */
+static void clusterManagerNodeArrayShift(clusterManagerNodeArray *array,
+                                         clusterManagerNode **nodeptr)
+{
+    assert(array->len > 0);
+    /* If the first node to be shifted is not NULL, decrement count. */
+    if (*array->nodes != NULL) array->count--;
+    /* Store the first node to be shifted into 'nodeptr'. */
+    *nodeptr = *array->nodes;
+    /* Shift the nodes array and decrement length. */
+    array->nodes++;
+    array->len--;
+}
+
+static void clusterManagerNodeArrayAdd(clusterManagerNodeArray *array,
+                                       clusterManagerNode *node)
+{
+    assert(array->len > 0);
+    assert(node != NULL);
+    assert(array->count < array->len);
+    array->nodes[array->count++] = node;
+}
+
+static void clusterManagerPrintNotEmptyNodeError(clusterManagerNode *node,
+                                                 char *err)
+{
+    char *msg;
+    if (err) msg = err;
+    else {
+        msg = "is not empty. Either the node already knows other "
+              "nodes (check with CLUSTER NODES) or contains some "
+              "key in database 0.";
+    }
+    clusterManagerLogErr("[ERR] Node %s:%d %s\n", node->ip, node->port, msg);
+}
+
+static void clusterManagerPrintNotClusterNodeError(clusterManagerNode *node,
+                                                   char *err)
+{
+    char *msg = (err ? err : "is not configured as a cluster node.");
+    clusterManagerLogErr("[ERR] Node %s:%d %s\n", node->ip, node->port, msg);
+}
+
+/* Execute redis-cli in Cluster Manager mode */
+static void clusterManagerMode(clusterManagerCommandProc *proc) {
+    int argc = config.cluster_manager_command.argc;
+    char **argv = config.cluster_manager_command.argv;
+    cluster_manager.nodes = NULL;
+    if (!proc(argc, argv)) goto cluster_manager_err;
+    freeClusterManager();
+    exit(0);
+cluster_manager_err:
+    freeClusterManager();
+    exit(1);
+}
+
+/* Cluster Manager Commands */
+
+static int clusterManagerCommandCreate(int argc, char **argv) {
+    int i, j, success = 1;
+    cluster_manager.nodes = listCreate();
+    for (i = 0; i < argc; i++) {
+        char *addr = argv[i];
+        char *c = strrchr(addr, '@');
+        if (c != NULL) *c = '\0';
+        c = strrchr(addr, ':');
+        if (c == NULL) {
+            fprintf(stderr, "Invalid address format: %s\n", addr);
+            return 0;
+        }
+        *c = '\0';
+        char *ip = addr;
+        int port = atoi(++c);
+        clusterManagerNode *node = clusterManagerNewNode(ip, port);
+        if (!clusterManagerNodeConnect(node)) {
+            freeClusterManagerNode(node);
+            return 0;
+        }
+        char *err = NULL;
+        if (!clusterManagerNodeIsCluster(node, &err)) {
+            clusterManagerPrintNotClusterNodeError(node, err);
+            if (err) zfree(err);
+            freeClusterManagerNode(node);
+            return 0;
+        }
+        err = NULL;
+        if (!clusterManagerNodeLoadInfo(node, 0, &err)) {
+            if (err) {
+                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+                zfree(err);
+            }
+            freeClusterManagerNode(node);
+            return 0;
+        }
+        err = NULL;
+        if (!clusterManagerNodeIsEmpty(node, &err)) {
+            clusterManagerPrintNotEmptyNodeError(node, err);
+            if (err) zfree(err);
+            freeClusterManagerNode(node);
+            return 0;
+        }
+        listAddNodeTail(cluster_manager.nodes, node);
+    }
+    int node_len = cluster_manager.nodes->len;
+    int replicas = config.cluster_manager_command.replicas;
+    int masters_count = CLUSTER_MANAGER_MASTERS_COUNT(node_len, replicas);
+    if (masters_count < 3) {
+        clusterManagerLogErr(
+            "*** ERROR: Invalid configuration for cluster creation.\n"
+            "*** Redis Cluster requires at least 3 master nodes.\n"
+            "*** This is not possible with %d nodes and %d replicas per node.",
+            node_len, replicas);
+        clusterManagerLogErr("\n*** At least %d nodes are required.\n",
+                             3 * (replicas + 1));
+        return 0;
+    }
+    clusterManagerLogInfo(">>> Performing hash slots allocation "
+                          "on %d nodes...\n", node_len);
+    int interleaved_len = 0, ip_count = 0;
+    clusterManagerNode **interleaved = zcalloc(node_len*sizeof(**interleaved));
+    char **ips = zcalloc(node_len * sizeof(char*));
+    clusterManagerNodeArray *ip_nodes = zcalloc(node_len * sizeof(*ip_nodes));
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        int found = 0;
+        for (i = 0; i < ip_count; i++) {
+            char *ip = ips[i];
+            if (!strcmp(ip, n->ip)) {
+                found = 1;
+                break;
+            }
+        }
+        if (!found) {
+            ips[ip_count++] = n->ip;
+        }
+        clusterManagerNodeArray *node_array = &(ip_nodes[i]);
+        if (node_array->nodes == NULL)
+            clusterManagerNodeArrayInit(node_array, node_len);
+        clusterManagerNodeArrayAdd(node_array, n);
+    }
+    while (interleaved_len < node_len) {
+        for (i = 0; i < ip_count; i++) {
+            clusterManagerNodeArray *node_array = &(ip_nodes[i]);
+            if (node_array->count > 0) {
+                clusterManagerNode *n = NULL;
+                clusterManagerNodeArrayShift(node_array, &n);
+                interleaved[interleaved_len++] = n;
+            }
+        }
+    }
+    clusterManagerNode **masters = interleaved;
+    interleaved += masters_count;
+    interleaved_len -= masters_count;
+    float slots_per_node = CLUSTER_MANAGER_SLOTS / (float) masters_count;
+    long first = 0;
+    float cursor = 0.0f;
+    for (i = 0; i < masters_count; i++) {
+        clusterManagerNode *master = masters[i];
+        long last = lround(cursor + slots_per_node - 1);
+        if (last > CLUSTER_MANAGER_SLOTS || i == (masters_count - 1))
+            last = CLUSTER_MANAGER_SLOTS - 1;
+        if (last < first) last = first;
+        printf("Master[%d] -> Slots %ld - %ld\n", i, first, last);
+        master->slots_count = 0;
+        for (j = first; j <= last; j++) {
+            master->slots[j] = 1;
+            master->slots_count++;
+        }
+        master->dirty = 1;
+        first = last + 1;
+        cursor += slots_per_node;
+    }
+
+    /* Rotating the list sometimes helps to get better initial
+     * anti-affinity before the optimizer runs. */
+    clusterManagerNode *first_node = interleaved[0];
+    for (i = 0; i < (interleaved_len - 1); i++)
+        interleaved[i] = interleaved[i + 1];
+    interleaved[interleaved_len - 1] = first_node;
+    int assign_unused = 0, available_count = interleaved_len;
+assign_replicas:
+    for (i = 0; i < masters_count; i++) {
+        clusterManagerNode *master = masters[i];
+        int assigned_replicas = 0;
+        while (assigned_replicas < replicas) {
+            if (available_count == 0) break;
+            clusterManagerNode *found = NULL, *slave = NULL;
+            int firstNodeIdx = -1;
+            for (j = 0; j < interleaved_len; j++) {
+                clusterManagerNode *n = interleaved[j];
+                if (n == NULL) continue;
+                if (strcmp(n->ip, master->ip)) {
+                    found = n;
+                    interleaved[j] = NULL;
+                    break;
+                }
+                if (firstNodeIdx < 0) firstNodeIdx = j;
+            }
+            if (found) slave = found;
+            else if (firstNodeIdx >= 0) {
+                slave = interleaved[firstNodeIdx];
+                interleaved_len -= (interleaved - (interleaved + firstNodeIdx));
+                interleaved += (firstNodeIdx + 1);
+            }
+            if (slave != NULL) {
+                assigned_replicas++;
+                available_count--;
+                if (slave->replicate) sdsfree(slave->replicate);
+                slave->replicate = sdsnew(master->name);
+                slave->dirty = 1;
+            } else break;
+            printf("Adding replica %s:%d to %s:%d\n", slave->ip, slave->port,
+                   master->ip, master->port);
+            if (assign_unused) break;
+        }
+    }
+    if (!assign_unused && available_count > 0) {
+        assign_unused = 1;
+        printf("Adding extra replicas...\n");
+        goto assign_replicas;
+    }
+    for (i = 0; i < ip_count; i++) {
+        clusterManagerNodeArray *node_array = ip_nodes + i;
+        clusterManagerNodeArrayReset(node_array);
+    }
+    clusterManagerOptimizeAntiAffinity(ip_nodes, ip_count);
+    clusterManagerShowNodes();
+    int ignore_force = 0;
+    if (confirmWithYes("Can I set the above configuration?", ignore_force)) {
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *node = ln->value;
+            char *err = NULL;
+            int flushed = clusterManagerFlushNodeConfig(node, &err);
+            if (!flushed && node->dirty && !node->replicate) {
+                if (err != NULL) {
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+                    zfree(err);
+                }
+                success = 0;
+                goto cleanup;
+            } else if (err != NULL) zfree(err);
+        }
+        clusterManagerLogInfo(">>> Nodes configuration updated\n");
+        clusterManagerLogInfo(">>> Assign a different config epoch to "
+                              "each node\n");
+        int config_epoch = 1;
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *node = ln->value;
+            redisReply *reply = NULL;
+            reply = CLUSTER_MANAGER_COMMAND(node,
+                                            "cluster set-config-epoch %d",
+                                            config_epoch++);
+            if (reply != NULL) freeReplyObject(reply);
+        }
+        clusterManagerLogInfo(">>> Sending CLUSTER MEET messages to join "
+                              "the cluster\n");
+        clusterManagerNode *first = NULL;
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *node = ln->value;
+            if (first == NULL) {
+                first = node;
+                continue;
+            }
+            redisReply *reply = NULL;
+            reply = CLUSTER_MANAGER_COMMAND(node, "cluster meet %s %d",
+                                            first->ip, first->port);
+            int is_err = 0;
+            if (reply != NULL) {
+                if ((is_err = reply->type == REDIS_REPLY_ERROR))
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, reply->str);
+                freeReplyObject(reply);
+            } else {
+                is_err = 1;
+                fprintf(stderr, "Failed to send CLUSTER MEET command.\n");
+            }
+            if (is_err) {
+                success = 0;
+                goto cleanup;
+            }
+        }
+        /* Give one second for the join to start, in order to avoid that
+         * waiting for cluster join will find all the nodes agree about
+         * the config as they are still empty with unassigned slots. */
+        sleep(1);
+        clusterManagerWaitForClusterJoin();
+        /* Useful for the replicas */
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *node = ln->value;
+            if (!node->dirty) continue;
+            char *err = NULL;
+            int flushed = clusterManagerFlushNodeConfig(node, &err);
+            if (!flushed && !node->replicate) {
+                if (err != NULL) {
+                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
+                    zfree(err);
+                }
+                success = 0;
+                goto cleanup;
+            }
+        }
+        // Reset Nodes
+        listRewind(cluster_manager.nodes, &li);
+        clusterManagerNode *first_node = NULL;
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *node = ln->value;
+            if (!first_node) first_node = node;
+            else freeClusterManagerNode(node);
+        }
+        listEmpty(cluster_manager.nodes);
+        if (!clusterManagerLoadInfoFromNode(first_node, 0)) {
+            success = 0;
+            goto cleanup;
+        }
+        clusterManagerCheckCluster(0);
+    }
+cleanup:
+    /* Free everything */
+    zfree(masters);
+    zfree(ips);
+    for (i = 0; i < node_len; i++) {
+        clusterManagerNodeArray *node_array = ip_nodes + i;
+        CLUSTER_MANAGER_NODE_ARRAY_FREE(node_array);
+    }
+    zfree(ip_nodes);
+    return success;
+}
+
+static int clusterManagerCommandAddNode(int argc, char **argv) {
+    int success = 1;
+    redisReply *reply = NULL;
+    char *ref_ip = NULL, *ip = NULL;
+    int ref_port = 0, port = 0;
+    if (!getClusterHostFromCmdArgs(argc - 1, argv + 1, &ref_ip, &ref_port))
+        goto invalid_args;
+    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port))
+        goto invalid_args;
+    clusterManagerLogInfo(">>> Adding node %s:%d to cluster %s:%d\n", ip, port,
+                          ref_ip, ref_port);
+    // Check the existing cluster
+    clusterManagerNode *refnode = clusterManagerNewNode(ref_ip, ref_port);
+    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
+    if (!clusterManagerCheckCluster(0)) return 0;
+
+    /* If --cluster-master-id was specified, try to resolve it now so that we
+     * abort before starting with the node configuration. */
+    clusterManagerNode *master_node = NULL;
+    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_SLAVE) {
+        char *master_id = config.cluster_manager_command.master_id;
+        if (master_id != NULL) {
+            master_node = clusterManagerNodeByName(master_id);
+            if (master_node == NULL) {
+                clusterManagerLogErr("[ERR] No such master ID %s\n", master_id);
+                return 0;
+            }
+        } else {
+            master_node = clusterManagerNodeWithLeastReplicas();
+            assert(master_node != NULL);
+            printf("Automatically selected master %s:%d\n", master_node->ip,
+                   master_node->port);
+        }
+    }
+
+    // Add the new node
+    clusterManagerNode *new_node = clusterManagerNewNode(ip, port);
+    int added = 0;
+    if (!clusterManagerNodeConnect(new_node)) {
+        clusterManagerLogErr("[ERR] Sorry, can't connect to node %s:%d\n",
+                             ip, port);
+        success = 0;
+        goto cleanup;
+    }
+    char *err = NULL;
+    if (!(success = clusterManagerNodeIsCluster(new_node, &err))) {
+        clusterManagerPrintNotClusterNodeError(new_node, err);
+        if (err) zfree(err);
+        goto cleanup;
+    }
+    if (!clusterManagerNodeLoadInfo(new_node, 0, &err)) {
+        if (err) {
+            CLUSTER_MANAGER_PRINT_REPLY_ERROR(new_node, err);
+            zfree(err);
+        }
+        success = 0;
+        goto cleanup;
+    }
+    if (!(success = clusterManagerNodeIsEmpty(new_node, &err))) {
+        clusterManagerPrintNotEmptyNodeError(new_node, err);
+        if (err) zfree(err);
+        goto cleanup;
+    }
+    clusterManagerNode *first = listFirst(cluster_manager.nodes)->value;
+    listAddNodeTail(cluster_manager.nodes, new_node);
+    added = 1;
+
+    // Send CLUSTER MEET command to the new node
+    clusterManagerLogInfo(">>> Send CLUSTER MEET to node %s:%d to make it "
+                          "join the cluster.\n", ip, port);
+    reply = CLUSTER_MANAGER_COMMAND(new_node, "CLUSTER MEET %s %d",
+                                    first->ip, first->port);
+    if (!(success = clusterManagerCheckRedisReply(new_node, reply, NULL)))
+        goto cleanup;
+
+    /* Additional configuration is needed if the node is added as a slave. */
+    if (master_node) {
+        sleep(1);
+        clusterManagerWaitForClusterJoin();
+        clusterManagerLogInfo(">>> Configure node as replica of %s:%d.\n",
+                              master_node->ip, master_node->port);
+        freeReplyObject(reply);
+        reply = CLUSTER_MANAGER_COMMAND(new_node, "CLUSTER REPLICATE %s",
+                                        master_node->name);
+        if (!(success = clusterManagerCheckRedisReply(new_node, reply, NULL)))
+            goto cleanup;
+    }
+    clusterManagerLogOk("[OK] New node added correctly.\n");
+cleanup:
+    if (!added && new_node) freeClusterManagerNode(new_node);
+    if (reply) freeReplyObject(reply);
+    return success;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandDeleteNode(int argc, char **argv) {
+    UNUSED(argc);
+    int success = 1;
+    int port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
+    char *node_id = argv[1];
+    clusterManagerLogInfo(">>> Removing node %s from cluster %s:%d\n",
+                          node_id, ip, port);
+    clusterManagerNode *ref_node = clusterManagerNewNode(ip, port);
+    clusterManagerNode *node = NULL;
+
+    // Load cluster information
+    if (!clusterManagerLoadInfoFromNode(ref_node, 0)) return 0;
+
+    // Check if the node exists and is not empty
+    node = clusterManagerNodeByName(node_id);
+    if (node == NULL) {
+        clusterManagerLogErr("[ERR] No such node ID %s\n", node_id);
+        return 0;
+    }
+    if (node->slots_count != 0) {
+        clusterManagerLogErr("[ERR] Node %s:%d is not empty! Reshard data "
+                             "away and try again.\n", node->ip, node->port);
+        return 0;
+    }
+
+    // Send CLUSTER FORGET to all the nodes but the node to remove
+    clusterManagerLogInfo(">>> Sending CLUSTER FORGET messages to the "
+                          "cluster...\n");
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n == node) continue;
+        if (n->replicate && !strcasecmp(n->replicate, node_id)) {
+            // Reconfigure the slave to replicate with some other node
+            clusterManagerNode *master = clusterManagerNodeWithLeastReplicas();
+            assert(master != NULL);
+            clusterManagerLogInfo(">>> %s:%d as replica of %s:%d\n",
+                                  n->ip, n->port, master->ip, master->port);
+            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER REPLICATE %s",
+                                                    master->name);
+            success = clusterManagerCheckRedisReply(n, r, NULL);
+            if (r) freeReplyObject(r);
+            if (!success) return 0;
+        }
+        redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER FORGET %s",
+                                                node_id);
+        success = clusterManagerCheckRedisReply(n, r, NULL);
+        if (r) freeReplyObject(r);
+        if (!success) return 0;
+    }
+
+    /* Finally send CLUSTER RESET to the node. */
+    clusterManagerLogInfo(">>> Sending CLUSTER RESET SOFT to the "
+                          "deleted node.\n");
+    redisReply *r = redisCommand(node->context, "CLUSTER RESET %s", "SOFT");
+    success = clusterManagerCheckRedisReply(node, r, NULL);
+    if (r) freeReplyObject(r);
+    return success;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandInfo(int argc, char **argv) {
+    int port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *node = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
+    clusterManagerShowClusterInfo();
+    return 1;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandCheck(int argc, char **argv) {
+    int port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *node = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
+    clusterManagerShowClusterInfo();
+    return clusterManagerCheckCluster(0);
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandFix(int argc, char **argv) {
+    config.cluster_manager_command.flags |= CLUSTER_MANAGER_CMD_FLAG_FIX;
+    return clusterManagerCommandCheck(argc, argv);
+}
+
+static int clusterManagerCommandReshard(int argc, char **argv) {
+    int port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *node = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
+    clusterManagerCheckCluster(0);
+    if (cluster_manager.errors && listLength(cluster_manager.errors) > 0) {
+        fflush(stdout);
+        fprintf(stderr,
+                "*** Please fix your cluster problems before resharding\n");
+        return 0;
+    }
+    int slots = config.cluster_manager_command.slots;
+    if (!slots) {
+        while (slots <= 0 || slots > CLUSTER_MANAGER_SLOTS) {
+            printf("How many slots do you want to move (from 1 to %d)? ",
+                   CLUSTER_MANAGER_SLOTS);
+            fflush(stdout);
+            char buf[6];
+            int nread = read(fileno(stdin),buf,6);
+            if (nread <= 0) continue;
+            int last_idx = nread - 1;
+            if (buf[last_idx] != '\n') {
+                int ch;
+                while ((ch = getchar()) != '\n' && ch != EOF) {}
+            }
+            buf[last_idx] = '\0';
+            slots = atoi(buf);
+        }
+    }
+    char buf[255];
+    char *to = config.cluster_manager_command.to,
+         *from = config.cluster_manager_command.from;
+    while (to == NULL) {
+        printf("What is the receiving node ID? ");
+        fflush(stdout);
+        int nread = read(fileno(stdin),buf,255);
+        if (nread <= 0) continue;
+        int last_idx = nread - 1;
+        if (buf[last_idx] != '\n') {
+            int ch;
+            while ((ch = getchar()) != '\n' && ch != EOF) {}
+        }
+        buf[last_idx] = '\0';
+        if (strlen(buf) > 0) to = buf;
+    }
+    int raise_err = 0;
+    clusterManagerNode *target = clusterNodeForResharding(to, NULL, &raise_err);
+    if (target == NULL) return 0;
+    list *sources = listCreate();
+    list *table = NULL;
+    int all = 0, result = 1;
+    if (from == NULL) {
+        printf("Please enter all the source node IDs.\n");
+        printf("  Type 'all' to use all the nodes as source nodes for "
+               "the hash slots.\n");
+        printf("  Type 'done' once you entered all the source nodes IDs.\n");
+        while (1) {
+            printf("Source node #%lu: ", listLength(sources) + 1);
+            fflush(stdout);
+            int nread = read(fileno(stdin),buf,255);
+            if (nread <= 0) continue;
+            int last_idx = nread - 1;
+            if (buf[last_idx] != '\n') {
+                int ch;
+                while ((ch = getchar()) != '\n' && ch != EOF) {}
+            }
+            buf[last_idx] = '\0';
+            if (!strcmp(buf, "done")) break;
+            else if (!strcmp(buf, "all")) {
+                all = 1;
+                break;
+            } else {
+                clusterManagerNode *src =
+                    clusterNodeForResharding(buf, target, &raise_err);
+                if (src != NULL) listAddNodeTail(sources, src);
+                else if (raise_err) {
+                    result = 0;
+                    goto cleanup;
+                }
+            }
+        }
+    } else {
+        char *p;
+        while((p = strchr(from, ',')) != NULL) {
+            *p = '\0';
+            if (!strcmp(from, "all")) {
+                all = 1;
+                break;
+            } else {
+                clusterManagerNode *src =
+                    clusterNodeForResharding(from, target, &raise_err);
+                if (src != NULL) listAddNodeTail(sources, src);
+                else if (raise_err) {
+                    result = 0;
+                    goto cleanup;
+                }
+            }
+            from = p + 1;
+        }
+        /* Check if there's still another source to process. */
+        if (!all && strlen(from) > 0) {
+            if (!strcmp(from, "all")) all = 1;
+            if (!all) {
+                clusterManagerNode *src =
+                    clusterNodeForResharding(from, target, &raise_err);
+                if (src != NULL) listAddNodeTail(sources, src);
+                else if (raise_err) {
+                    result = 0;
+                    goto cleanup;
+                }
+            }
+        }
+    }
+    listIter li;
+    listNode *ln;
+    if (all) {
+        listEmpty(sources);
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
+                continue;
+            if (!sdscmp(n->name, target->name)) continue;
+            listAddNodeTail(sources, n);
+        }
+    }
+    if (listLength(sources) == 0) {
+        fprintf(stderr, "*** No source nodes given, operation aborted.\n");
+        result = 0;
+        goto cleanup;
+    }
+    printf("\nReady to move %d slots.\n", slots);
+    printf("  Source nodes:\n");
+    listRewind(sources, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *src = ln->value;
+        sds info = clusterManagerNodeInfo(src, 4);
+        printf("%s\n", info);
+        sdsfree(info);
+    }
+    printf("  Destination node:\n");
+    sds info = clusterManagerNodeInfo(target, 4);
+    printf("%s\n", info);
+    sdsfree(info);
+    table = clusterManagerComputeReshardTable(sources, slots);
+    printf("  Resharding plan:\n");
+    clusterManagerShowReshardTable(table);
+    if (!(config.cluster_manager_command.flags &
+          CLUSTER_MANAGER_CMD_FLAG_YES))
+    {
+        printf("Do you want to proceed with the proposed "
+               "reshard plan (yes/no)? ");
+        fflush(stdout);
+        char buf[4];
+        int nread = read(fileno(stdin),buf,4);
+        buf[3] = '\0';
+        if (nread <= 0 || strcmp("yes", buf) != 0) {
+            result = 0;
+            goto cleanup;
+        }
+    }
+    int opts = CLUSTER_MANAGER_OPT_VERBOSE;
+    listRewind(table, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerReshardTableItem *item = ln->value;
+        char *err = NULL;
+        result = clusterManagerMoveSlot(item->source, target, item->slot,
+                                        opts, &err);
+        if (!result) {
+            if (err != NULL) {
+                //clusterManagerLogErr("\n%s\n", err);
+                zfree(err);
+            }
+            goto cleanup;
+        }
+    }
+cleanup:
+    listRelease(sources);
+    clusterManagerReleaseReshardTable(table);
+    return result;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandRebalance(int argc, char **argv) {
+    int port = 0;
+    char *ip = NULL;
+    clusterManagerNode **weightedNodes = NULL;
+    list *involved = NULL;
+    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *node = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
+    int result = 1, i;
+    if (config.cluster_manager_command.weight != NULL) {
+        for (i = 0; i < config.cluster_manager_command.weight_argc; i++) {
+            char *name = config.cluster_manager_command.weight[i];
+            char *p = strchr(name, '=');
+            if (p == NULL) {
+                result = 0;
+                goto cleanup;
+            }
+            *p = '\0';
+            float w = atof(++p);
+            clusterManagerNode *n = clusterManagerNodeByAbbreviatedName(name);
+            if (n == NULL) {
+                clusterManagerLogErr("*** No such master node %s\n", name);
+                result = 0;
+                goto cleanup;
+            }
+            n->weight = w;
+        }
+    }
+    float total_weight = 0;
+    int nodes_involved = 0;
+    int use_empty = config.cluster_manager_command.flags &
+                    CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER;
+    involved = listCreate();
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    /* Compute the total cluster weight. */
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
+            continue;
+        if (!use_empty && n->slots_count == 0) {
+            n->weight = 0;
+            continue;
+        }
+        total_weight += n->weight;
+        nodes_involved++;
+        listAddNodeTail(involved, n);
+    }
+    weightedNodes = zmalloc(nodes_involved * sizeof(clusterManagerNode *));
+    if (weightedNodes == NULL) goto cleanup;
+    /* Check cluster, only proceed if it looks sane. */
+    clusterManagerCheckCluster(1);
+    if (cluster_manager.errors && listLength(cluster_manager.errors) > 0) {
+        clusterManagerLogErr("*** Please fix your cluster problems "
+                             "before rebalancing\n");
+        result = 0;
+        goto cleanup;
+    }
+    /* Calculate the slots balance for each node. It's the number of
+     * slots the node should lose (if positive) or gain (if negative)
+     * in order to be balanced. */
+    int threshold_reached = 0, total_balance = 0;
+    float threshold = config.cluster_manager_command.threshold;
+    i = 0;
+    listRewind(involved, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        weightedNodes[i++] = n;
+        int expected = (int) (((float)CLUSTER_MANAGER_SLOTS / total_weight) *
+                        n->weight);
+        n->balance = n->slots_count - expected;
+        total_balance += n->balance;
+        /* Compute the percentage of difference between the
+         * expected number of slots and the real one, to see
+         * if it's over the threshold specified by the user. */
+        int over_threshold = 0;
+        if (threshold > 0) {
+            if (n->slots_count > 0) {
+                float err_perc = fabs((100-(100.0*expected/n->slots_count)));
+                if (err_perc > threshold) over_threshold = 1;
+            } else if (expected > 1) {
+                over_threshold = 1;
+            }
+        }
+        if (over_threshold) threshold_reached = 1;
+    }
+    if (!threshold_reached) {
+        clusterManagerLogWarn("*** No rebalancing needed! "
+                             "All nodes are within the %.2f%% threshold.\n",
+                             config.cluster_manager_command.threshold);
+        goto cleanup;
+    }
+    /* Because of rounding, it is possible that the balance of all nodes
+     * summed does not give 0. Make sure that nodes that have to provide
+     * slots are always matched by nodes receiving slots. */
+    while (total_balance > 0) {
+        listRewind(involved, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n->balance <= 0 && total_balance > 0) {
+                n->balance--;
+                total_balance--;
+            }
+        }
+    }
+    /* Sort nodes by their slots balance. */
+    qsort(weightedNodes, nodes_involved, sizeof(clusterManagerNode *),
+          clusterManagerCompareNodeBalance);
+    clusterManagerLogInfo(">>> Rebalancing across %d nodes. "
+                          "Total weight = %.2f\n",
+                          nodes_involved, total_weight);
+    if (config.verbose) {
+        for (i = 0; i < nodes_involved; i++) {
+            clusterManagerNode *n = weightedNodes[i];
+            printf("%s:%d balance is %d slots\n", n->ip, n->port, n->balance);
+        }
+    }
+    /* Now we have at the start of the 'sn' array nodes that should get
+     * slots, at the end nodes that must give slots.
+     * We take two indexes, one at the start, and one at the end,
+     * incrementing or decrementing the indexes accordingly til we
+     * find nodes that need to get/provide slots. */
+    int dst_idx = 0;
+    int src_idx = nodes_involved - 1;
+    int simulate = config.cluster_manager_command.flags &
+                   CLUSTER_MANAGER_CMD_FLAG_SIMULATE;
+    while (dst_idx < src_idx) {
+        clusterManagerNode *dst = weightedNodes[dst_idx];
+        clusterManagerNode *src = weightedNodes[src_idx];
+        int db = abs(dst->balance);
+        int sb = abs(src->balance);
+        int numslots = (db < sb ? db : sb);
+        if (numslots > 0) {
+            printf("Moving %d slots from %s:%d to %s:%d\n", numslots,
+                                                            src->ip,
+                                                            src->port,
+                                                            dst->ip,
+                                                            dst->port);
+            /* Actually move the slots. */
+            list *lsrc = listCreate(), *table = NULL;
+            listAddNodeTail(lsrc, src);
+            table = clusterManagerComputeReshardTable(lsrc, numslots);
+            listRelease(lsrc);
+            int table_len = (int) listLength(table);
+            if (!table || table_len != numslots) {
+                clusterManagerLogErr("*** Assertion failed: Reshard table "
+                                     "!= number of slots");
+                result = 0;
+                goto end_move;
+            }
+            if (simulate) {
+                for (i = 0; i < table_len; i++) printf("#");
+            } else {
+                int opts = CLUSTER_MANAGER_OPT_QUIET |
+                           CLUSTER_MANAGER_OPT_UPDATE;
+                listRewind(table, &li);
+                while ((ln = listNext(&li)) != NULL) {
+                    clusterManagerReshardTableItem *item = ln->value;
+                    result = clusterManagerMoveSlot(item->source,
+                                                    dst,
+                                                    item->slot,
+                                                    opts, NULL);
+                    if (!result) goto end_move;
+                    printf("#");
+                    fflush(stdout);
+                }
+
+            }
+            printf("\n");
+end_move:
+            clusterManagerReleaseReshardTable(table);
+            if (!result) goto cleanup;
+        }
+        /* Update nodes balance. */
+        dst->balance += numslots;
+        src->balance -= numslots;
+        if (dst->balance == 0) dst_idx++;
+        if (src->balance == 0) src_idx --;
+    }
+cleanup:
+    if (involved != NULL) listRelease(involved);
+    if (weightedNodes != NULL) zfree(weightedNodes);
+    return result;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandSetTimeout(int argc, char **argv) {
+    UNUSED(argc);
+    int port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
+    int timeout = atoi(argv[1]);
+    if (timeout < 100) {
+        fprintf(stderr, "Setting a node timeout of less than 100 "
+                "milliseconds is a bad idea.\n");
+        return 0;
+    }
+    // Load cluster information
+    clusterManagerNode *node = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
+    int ok_count = 0, err_count = 0;
+
+    clusterManagerLogInfo(">>> Reconfiguring node timeout in every "
+                          "cluster node...\n");
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        char *err = NULL;
+        redisReply *reply = CLUSTER_MANAGER_COMMAND(n, "CONFIG %s %s %d",
+                                                    "SET",
+                                                    "cluster-node-timeout",
+                                                    timeout);
+        if (reply == NULL) goto reply_err;
+        int ok = clusterManagerCheckRedisReply(n, reply, &err);
+        freeReplyObject(reply);
+        if (!ok) goto reply_err;
+        reply = CLUSTER_MANAGER_COMMAND(n, "CONFIG %s", "REWRITE");
+        if (reply == NULL) goto reply_err;
+        ok = clusterManagerCheckRedisReply(n, reply, &err);
+        freeReplyObject(reply);
+        if (!ok) goto reply_err;
+        clusterManagerLogWarn("*** New timeout set for %s:%d\n", n->ip,
+                              n->port);
+        ok_count++;
+        continue;
+reply_err:;
+        int need_free = 0;
+        if (err == NULL) err = "";
+        else need_free = 1;
+        clusterManagerLogErr("ERR setting node-timeot for %s:%d: %s\n", n->ip,
+                             n->port, err);
+        if (need_free) zfree(err);
+        err_count++;
+    }
+    clusterManagerLogInfo(">>> New node timeout set. %d OK, %d ERR.\n",
+                          ok_count, err_count);
+    return 1;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandImport(int argc, char **argv) {
+    int success = 1;
+    int port = 0, src_port = 0;
+    char *ip = NULL, *src_ip = NULL;
+    char *invalid_args_msg = NULL;
+    sds cmdfmt = NULL;
+    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) {
+        invalid_args_msg = CLUSTER_MANAGER_INVALID_HOST_ARG;
+        goto invalid_args;
+    }
+    if (config.cluster_manager_command.from == NULL) {
+        invalid_args_msg = "[ERR] Option '--cluster-from' is required for "
+                           "subcommand 'import'.\n";
+        goto invalid_args;
+    }
+    char *src_host[] = {config.cluster_manager_command.from};
+    if (!getClusterHostFromCmdArgs(1, src_host, &src_ip, &src_port)) {
+        invalid_args_msg = "[ERR] Invalid --cluster-from host. You need to "
+                           "pass a valid address (ie. 120.0.0.1:7000).\n";
+        goto invalid_args;
+    }
+    clusterManagerLogInfo(">>> Importing data from %s:%d to cluster %s:%d\n",
+                          src_ip, src_port, ip, port);
+
+    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
+    if (!clusterManagerCheckCluster(0)) return 0;
+    char *reply_err = NULL;
+    redisReply *src_reply = NULL;
+    // Connect to the source node.
+    redisContext *src_ctx = redisConnect(src_ip, src_port);
+    if (src_ctx->err) {
+        success = 0;
+        fprintf(stderr,"Could not connect to Redis at %s:%d: %s.\n", src_ip,
+                src_port, src_ctx->errstr);
+        goto cleanup;
+    }
+    // Auth for the source node. 
+    char *from_user = config.cluster_manager_command.from_user;
+    char *from_pass = config.cluster_manager_command.from_pass;
+    if (cliAuth(src_ctx, from_user, from_pass) == REDIS_ERR) {
+        success = 0;
+        goto cleanup;
+    }
+
+    src_reply = reconnectingRedisCommand(src_ctx, "INFO");
+    if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
+        if (src_reply && src_reply->str) reply_err = src_reply->str;
+        success = 0;
+        goto cleanup;
+    }
+    if (getLongInfoField(src_reply->str, "cluster_enabled")) {
+        clusterManagerLogErr("[ERR] The source node should not be a "
+                             "cluster node.\n");
+        success = 0;
+        goto cleanup;
+    }
+    freeReplyObject(src_reply);
+    src_reply = reconnectingRedisCommand(src_ctx, "DBSIZE");
+    if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
+        if (src_reply && src_reply->str) reply_err = src_reply->str;
+        success = 0;
+        goto cleanup;
+    }
+    int size = src_reply->integer, i;
+    clusterManagerLogWarn("*** Importing %d keys from DB 0\n", size);
+
+    // Build a slot -> node map
+    clusterManagerNode  *slots_map[CLUSTER_MANAGER_SLOTS];
+    memset(slots_map, 0, sizeof(slots_map));
+    listIter li;
+    listNode *ln;
+    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
+        listRewind(cluster_manager.nodes, &li);
+        while ((ln = listNext(&li)) != NULL) {
+            clusterManagerNode *n = ln->value;
+            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
+            if (n->slots_count == 0) continue;
+            if (n->slots[i]) {
+                slots_map[i] = n;
+                break;
+            }
+        }
+    }
+    cmdfmt = sdsnew("MIGRATE %s %d %s %d %d");
+    if (config.auth) {
+        if (config.user) {
+            cmdfmt = sdscatfmt(cmdfmt," AUTH2 %s %s", config.user, config.auth); 
+        } else {
+            cmdfmt = sdscatfmt(cmdfmt," AUTH %s", config.auth);
+        }
+    }
+
+    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_COPY)
+        cmdfmt = sdscat(cmdfmt," COPY");
+    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_REPLACE)
+        cmdfmt = sdscat(cmdfmt," REPLACE");
+
+    /* Use SCAN to iterate over the keys, migrating to the
+     * right node as needed. */
+    int cursor = -999, timeout = config.cluster_manager_command.timeout;
+    while (cursor != 0) {
+        if (cursor < 0) cursor = 0;
+        freeReplyObject(src_reply);
+        src_reply = reconnectingRedisCommand(src_ctx, "SCAN %d COUNT %d",
+                                             cursor, 1000);
+        if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
+            if (src_reply && src_reply->str) reply_err = src_reply->str;
+            success = 0;
+            goto cleanup;
+        }
+        assert(src_reply->type == REDIS_REPLY_ARRAY);
+        assert(src_reply->elements >= 2);
+        assert(src_reply->element[1]->type == REDIS_REPLY_ARRAY);
+        if (src_reply->element[0]->type == REDIS_REPLY_STRING)
+            cursor = atoi(src_reply->element[0]->str);
+        else if (src_reply->element[0]->type == REDIS_REPLY_INTEGER)
+            cursor = src_reply->element[0]->integer;
+        int keycount = src_reply->element[1]->elements;
+        for (i = 0; i < keycount; i++) {
+            redisReply *kr = src_reply->element[1]->element[i];
+            assert(kr->type == REDIS_REPLY_STRING);
+            char *key = kr->str;
+            uint16_t slot = clusterManagerKeyHashSlot(key, kr->len);
+            clusterManagerNode *target = slots_map[slot];
+            printf("Migrating %s to %s:%d: ", key, target->ip, target->port);
+            redisReply *r = reconnectingRedisCommand(src_ctx, cmdfmt,
+                                                     target->ip, target->port,
+                                                     key, 0, timeout);
+            if (!r || r->type == REDIS_REPLY_ERROR) {
+                if (r && r->str) {
+                    clusterManagerLogErr("Source %s:%d replied with "
+                                         "error:\n%s\n", src_ip, src_port,
+                                         r->str);
+                }
+                success = 0;
+            }
+            freeReplyObject(r);
+            if (!success) goto cleanup;
+            clusterManagerLogOk("OK\n");
+        }
+    }
+cleanup:
+    if (reply_err)
+        clusterManagerLogErr("Source %s:%d replied with error:\n%s\n",
+                             src_ip, src_port, reply_err);
+    if (src_ctx) redisFree(src_ctx);
+    if (src_reply) freeReplyObject(src_reply);
+    if (cmdfmt) sdsfree(cmdfmt);
+    return success;
+invalid_args:
+    fprintf(stderr, "%s", invalid_args_msg);
+    return 0;
+}
+
+static int clusterManagerCommandCall(int argc, char **argv) {
+    int port = 0, i;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
+    argc--;
+    argv++;
+    size_t *argvlen = zmalloc(argc*sizeof(size_t));
+    clusterManagerLogInfo(">>> Calling");
+    for (i = 0; i < argc; i++) {
+        argvlen[i] = strlen(argv[i]);
+        printf(" %s", argv[i]);
+    }
+    printf("\n");
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        clusterManagerNode *n = ln->value;
+        if ((config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY)
+              && (n->replicate != NULL)) continue;  // continue if node is slave
+        if ((config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY)
+              && (n->replicate == NULL)) continue;   // continue if node is master
+        if (!n->context && !clusterManagerNodeConnect(n)) continue;
+        redisReply *reply = NULL;
+        redisAppendCommandArgv(n->context, argc, (const char **) argv, argvlen);
+        int status = redisGetReply(n->context, (void **)(&reply));
+        if (status != REDIS_OK || reply == NULL )
+            printf("%s:%d: Failed!\n", n->ip, n->port);
+        else {
+            sds formatted_reply = cliFormatReplyRaw(reply);
+            printf("%s:%d: %s\n", n->ip, n->port, (char *) formatted_reply);
+            sdsfree(formatted_reply);
+        }
+        if (reply != NULL) freeReplyObject(reply);
+    }
+    zfree(argvlen);
+    return 1;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandBackup(int argc, char **argv) {
+    UNUSED(argc);
+    int success = 1, port = 0;
+    char *ip = NULL;
+    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
+    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
+    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
+    int no_issues = clusterManagerCheckCluster(0);
+    int cluster_errors_count = (no_issues ? 0 :
+                                listLength(cluster_manager.errors));
+    config.cluster_manager_command.backup_dir = argv[1];
+    /* TODO: check if backup_dir is a valid directory. */
+    sds json = sdsnew("[\n");
+    int first_node = 0;
+    listIter li;
+    listNode *ln;
+    listRewind(cluster_manager.nodes, &li);
+    while ((ln = listNext(&li)) != NULL) {
+        if (!first_node) first_node = 1;
+        else json = sdscat(json, ",\n");
+        clusterManagerNode *node = ln->value;
+        sds node_json = clusterManagerNodeGetJSON(node, cluster_errors_count);
+        json = sdscat(json, node_json);
+        sdsfree(node_json);
+        if (node->replicate)
+            continue;
+        clusterManagerLogInfo(">>> Node %s:%d -> Saving RDB...\n",
+                              node->ip, node->port);
+        fflush(stdout);
+        getRDB(node);
+    }
+    json = sdscat(json, "\n]");
+    sds jsonpath = sdsnew(config.cluster_manager_command.backup_dir);
+    if (jsonpath[sdslen(jsonpath) - 1] != '/')
+        jsonpath = sdscat(jsonpath, "/");
+    jsonpath = sdscat(jsonpath, "nodes.json");
+    fflush(stdout);
+    clusterManagerLogInfo("Saving cluster configuration to: %s\n", jsonpath);
+    FILE *out = fopen(jsonpath, "w+");
+    if (!out) {
+        clusterManagerLogErr("Could not save nodes to: %s\n", jsonpath);
+        success = 0;
+        goto cleanup;
+    }
+    fputs(json, out);
+    fclose(out);
+cleanup:
+    sdsfree(json);
+    sdsfree(jsonpath);
+    if (success) {
+        if (!no_issues) {
+            clusterManagerLogWarn("*** Cluster seems to have some problems, "
+                                  "please be aware of it if you're going "
+                                  "to restore this backup.\n");
+        }
+        clusterManagerLogOk("[OK] Backup created into: %s\n",
+                            config.cluster_manager_command.backup_dir);
+    } else clusterManagerLogOk("[ERR] Failed to back cluster!\n");
+    return success;
+invalid_args:
+    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
+    return 0;
+}
+
+static int clusterManagerCommandHelp(int argc, char **argv) {
+    UNUSED(argc);
+    UNUSED(argv);
+    int commands_count = sizeof(clusterManagerCommands) /
+                         sizeof(clusterManagerCommandDef);
+    int i = 0, j;
+    fprintf(stderr, "Cluster Manager Commands:\n");
+    int padding = 15;
+    for (; i < commands_count; i++) {
+        clusterManagerCommandDef *def = &(clusterManagerCommands[i]);
+        int namelen = strlen(def->name), padlen = padding - namelen;
+        fprintf(stderr, "  %s", def->name);
+        for (j = 0; j < padlen; j++) fprintf(stderr, " ");
+        fprintf(stderr, "%s\n", (def->args ? def->args : ""));
+        if (def->options != NULL) {
+            int optslen = strlen(def->options);
+            char *p = def->options, *eos = p + optslen;
+            char *comma = NULL;
+            while ((comma = strchr(p, ',')) != NULL) {
+                int deflen = (int)(comma - p);
+                char buf[255];
+                memcpy(buf, p, deflen);
+                buf[deflen] = '\0';
+                for (j = 0; j < padding; j++) fprintf(stderr, " ");
+                fprintf(stderr, "  --cluster-%s\n", buf);
+                p = comma + 1;
+                if (p >= eos) break;
+            }
+            if (p < eos) {
+                for (j = 0; j < padding; j++) fprintf(stderr, " ");
+                fprintf(stderr, "  --cluster-%s\n", p);
+            }
+        }
+    }
+    fprintf(stderr, "\nFor check, fix, reshard, del-node, set-timeout you "
+                    "can specify the host and port of any working node in "
+                    "the cluster.\n");
+
+    int options_count = sizeof(clusterManagerOptions) /
+                        sizeof(clusterManagerOptionDef);
+    i = 0;
+    fprintf(stderr, "\nCluster Manager Options:\n");
+    for (; i < options_count; i++) {
+        clusterManagerOptionDef *def = &(clusterManagerOptions[i]);
+        int namelen = strlen(def->name), padlen = padding - namelen;
+        fprintf(stderr, "  %s", def->name);
+        for (j = 0; j < padlen; j++) fprintf(stderr, " ");
+        fprintf(stderr, "%s\n", def->desc);
+    }
+
+    fprintf(stderr, "\n");
+    return 0;
+}
+
+/*------------------------------------------------------------------------------
+ * Latency and latency history modes
+ *--------------------------------------------------------------------------- */
+
+static void latencyModePrint(long long min, long long max, double avg, long long count) {
+    if (config.output == OUTPUT_STANDARD) {
+        printf("min: %lld, max: %lld, avg: %.2f (%lld samples)",
+                min, max, avg, count);
+        fflush(stdout);
+    } else if (config.output == OUTPUT_CSV) {
+        printf("%lld,%lld,%.2f,%lld\n", min, max, avg, count);
+    } else if (config.output == OUTPUT_RAW) {
+        printf("%lld %lld %.2f %lld\n", min, max, avg, count);
+    }
+}
+
+#define LATENCY_SAMPLE_RATE 10 /* milliseconds. */
+#define LATENCY_HISTORY_DEFAULT_INTERVAL 15000 /* milliseconds. */
+static void latencyMode(void) {
+    redisReply *reply;
+    long long start, latency, min = 0, max = 0, tot = 0, count = 0;
+    long long history_interval =
+        config.interval ? config.interval/1000 :
+                          LATENCY_HISTORY_DEFAULT_INTERVAL;
+    double avg;
+    long long history_start = mstime();
+
+    /* Set a default for the interval in case of --latency option
+     * with --raw, --csv or when it is redirected to non tty. */
+    if (config.interval == 0) {
+        config.interval = 1000;
+    } else {
+        config.interval /= 1000; /* We need to convert to milliseconds. */
+    }
+
+    if (!context) exit(1);
+    while(1) {
+        start = mstime();
+        reply = reconnectingRedisCommand(context,"PING");
+        if (reply == NULL) {
+            fprintf(stderr,"\nI/O error\n");
+            exit(1);
+        }
+        latency = mstime()-start;
+        freeReplyObject(reply);
+        count++;
+        if (count == 1) {
+            min = max = tot = latency;
+            avg = (double) latency;
+        } else {
+            if (latency < min) min = latency;
+            if (latency > max) max = latency;
+            tot += latency;
+            avg = (double) tot/count;
+        }
+
+        if (config.output == OUTPUT_STANDARD) {
+            printf("\x1b[0G\x1b[2K"); /* Clear the line. */
+            latencyModePrint(min,max,avg,count);
+        } else {
+            if (config.latency_history) {
+                latencyModePrint(min,max,avg,count);
+            } else if (mstime()-history_start > config.interval) {
+                latencyModePrint(min,max,avg,count);
+                exit(0);
+            }
+        }
+
+        if (config.latency_history && mstime()-history_start > history_interval)
+        {
+            printf(" -- %.2f seconds range\n", (float)(mstime()-history_start)/1000);
+            history_start = mstime();
+            min = max = tot = count = 0;
+        }
+        usleep(LATENCY_SAMPLE_RATE * 1000);
+    }
+}
+
+/*------------------------------------------------------------------------------
+ * Latency distribution mode -- requires 256 colors xterm
+ *--------------------------------------------------------------------------- */
+
+#define LATENCY_DIST_DEFAULT_INTERVAL 1000 /* milliseconds. */
+
+/* Structure to store samples distribution. */
+struct distsamples {
+    long long max;   /* Max latency to fit into this interval (usec). */
+    long long count; /* Number of samples in this interval. */
+    int character;   /* Associated character in visualization. */
+};
+
+/* Helper function for latencyDistMode(). Performs the spectrum visualization
+ * of the collected samples targeting an xterm 256 terminal.
+ *
+ * Takes an array of distsamples structures, ordered from smaller to bigger
+ * 'max' value. Last sample max must be 0, to mean that it olds all the
+ * samples greater than the previous one, and is also the stop sentinel.
+ *
+ * "tot' is the total number of samples in the different buckets, so it
+ * is the SUM(samples[i].count) for i to 0 up to the max sample.
+ *
+ * As a side effect the function sets all the buckets count to 0. */
+void showLatencyDistSamples(struct distsamples *samples, long long tot) {
+    int j;
+
+     /* We convert samples into an index inside the palette
+     * proportional to the percentage a given bucket represents.
+     * This way intensity of the different parts of the spectrum
+     * don't change relative to the number of requests, which avoids to
+     * pollute the visualization with non-latency related info. */
+    printf("\033[38;5;0m"); /* Set foreground color to black. */
+    for (j = 0; ; j++) {
+        int coloridx =
+            ceil((double) samples[j].count / tot * (spectrum_palette_size-1));
+        int color = spectrum_palette[coloridx];
+        printf("\033[48;5;%dm%c", (int)color, samples[j].character);
+        samples[j].count = 0;
+        if (samples[j].max == 0) break; /* Last sample. */
+    }
+    printf("\033[0m\n");
+    fflush(stdout);
+}
+
+/* Show the legend: different buckets values and colors meaning, so
+ * that the spectrum is more easily readable. */
+void showLatencyDistLegend(void) {
+    int j;
+
+    printf("---------------------------------------------\n");
+    printf(". - * #          .01 .125 .25 .5 milliseconds\n");
+    printf("1,2,3,...,9      from 1 to 9     milliseconds\n");
+    printf("A,B,C,D,E        10,20,30,40,50  milliseconds\n");
+    printf("F,G,H,I,J        .1,.2,.3,.4,.5       seconds\n");
+    printf("K,L,M,N,O,P,Q,?  1,2,4,8,16,30,60,>60 seconds\n");
+    printf("From 0 to 100%%: ");
+    for (j = 0; j < spectrum_palette_size; j++) {
+        printf("\033[48;5;%dm ", spectrum_palette[j]);
+    }
+    printf("\033[0m\n");
+    printf("---------------------------------------------\n");
+}
+
+static void latencyDistMode(void) {
+    redisReply *reply;
+    long long start, latency, count = 0;
+    long long history_interval =
+        config.interval ? config.interval/1000 :
+                          LATENCY_DIST_DEFAULT_INTERVAL;
+    long long history_start = ustime();
+    int j, outputs = 0;
+
+    struct distsamples samples[] = {
+        /* We use a mostly logarithmic scale, with certain linear intervals
+         * which are more interesting than others, like 1-10 milliseconds
+         * range. */
+        {10,0,'.'},         /* 0.01 ms */
+        {125,0,'-'},        /* 0.125 ms */
+        {250,0,'*'},        /* 0.25 ms */
+        {500,0,'#'},        /* 0.5 ms */
+        {1000,0,'1'},       /* 1 ms */
+        {2000,0,'2'},       /* 2 ms */
+        {3000,0,'3'},       /* 3 ms */
+        {4000,0,'4'},       /* 4 ms */
+        {5000,0,'5'},       /* 5 ms */
+        {6000,0,'6'},       /* 6 ms */
+        {7000,0,'7'},       /* 7 ms */
+        {8000,0,'8'},       /* 8 ms */
+        {9000,0,'9'},       /* 9 ms */
+        {10000,0,'A'},      /* 10 ms */
+        {20000,0,'B'},      /* 20 ms */
+        {30000,0,'C'},      /* 30 ms */
+        {40000,0,'D'},      /* 40 ms */
+        {50000,0,'E'},      /* 50 ms */
+        {100000,0,'F'},     /* 0.1 s */
+        {200000,0,'G'},     /* 0.2 s */
+        {300000,0,'H'},     /* 0.3 s */
+        {400000,0,'I'},     /* 0.4 s */
+        {500000,0,'J'},     /* 0.5 s */
+        {1000000,0,'K'},    /* 1 s */
+        {2000000,0,'L'},    /* 2 s */
+        {4000000,0,'M'},    /* 4 s */
+        {8000000,0,'N'},    /* 8 s */
+        {16000000,0,'O'},   /* 16 s */
+        {30000000,0,'P'},   /* 30 s */
+        {60000000,0,'Q'},   /* 1 minute */
+        {0,0,'?'},          /* > 1 minute */
+    };
+
+    if (!context) exit(1);
+    while(1) {
+        start = ustime();
+        reply = reconnectingRedisCommand(context,"PING");
+        if (reply == NULL) {
+            fprintf(stderr,"\nI/O error\n");
+            exit(1);
+        }
+        latency = ustime()-start;
+        freeReplyObject(reply);
+        count++;
+
+        /* Populate the relevant bucket. */
+        for (j = 0; ; j++) {
+            if (samples[j].max == 0 || latency <= samples[j].max) {
+                samples[j].count++;
+                break;
+            }
+        }
+
+        /* From time to time show the spectrum. */
+        if (count && (ustime()-history_start)/1000 > history_interval) {
+            if ((outputs++ % 20) == 0)
+                showLatencyDistLegend();
+            showLatencyDistSamples(samples,count);
+            history_start = ustime();
+            count = 0;
+        }
+        usleep(LATENCY_SAMPLE_RATE * 1000);
+    }
+}
+
+/*------------------------------------------------------------------------------
+ * Slave mode
+ *--------------------------------------------------------------------------- */
+
+#define RDB_EOF_MARK_SIZE 40
+
+void sendReplconf(const char* arg1, const char* arg2) {
+    fprintf(stderr, "sending REPLCONF %s %s\n", arg1, arg2);
+    redisReply *reply = redisCommand(context, "REPLCONF %s %s", arg1, arg2);
+
+    /* Handle any error conditions */
+    if(reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        exit(1);
+    } else if(reply->type == REDIS_REPLY_ERROR) {
+        fprintf(stderr, "REPLCONF %s error: %s\n", arg1, reply->str);
+        /* non fatal, old versions may not support it */
+    }
+    freeReplyObject(reply);
+}
+
+void sendCapa() {
+    sendReplconf("capa", "eof");
+}
+
+void sendRdbOnly(void) {
+    sendReplconf("rdb-only", "1");
+}
+
+/* Read raw bytes through a redisContext. The read operation is not greedy
+ * and may not fill the buffer entirely.
+ */
+static ssize_t readConn(redisContext *c, char *buf, size_t len)
+{
+    return c->funcs->read(c, buf, len);
+}
+
+/* Sends SYNC and reads the number of bytes in the payload. Used both by
+ * slaveMode() and getRDB().
+ * returns 0 in case an EOF marker is used. */
+unsigned long long sendSync(redisContext *c, char *out_eof) {
+    /* To start we need to send the SYNC command and return the payload.
+     * The hiredis client lib does not understand this part of the protocol
+     * and we don't want to mess with its buffers, so everything is performed
+     * using direct low-level I/O. */
+    char buf[4096], *p;
+    ssize_t nread;
+
+    /* Send the SYNC command. */
+    if (cliWriteConn(c, "SYNC\r\n", 6) != 6) {
+        fprintf(stderr,"Error writing to master\n");
+        exit(1);
+    }
+
+    /* Read $<payload>\r\n, making sure to read just up to "\n" */
+    p = buf;
+    while(1) {
+        nread = readConn(c,p,1);
+        if (nread <= 0) {
+            fprintf(stderr,"Error reading bulk length while SYNCing\n");
+            exit(1);
+        }
+        if (*p == '\n' && p != buf) break;
+        if (*p != '\n') p++;
+    }
+    *p = '\0';
+    if (buf[0] == '-') {
+        fprintf(stderr, "SYNC with master failed: %s\n", buf);
+        exit(1);
+    }
+    if (strncmp(buf+1,"EOF:",4) == 0 && strlen(buf+5) >= RDB_EOF_MARK_SIZE) {
+        memcpy(out_eof, buf+5, RDB_EOF_MARK_SIZE);
+        return 0;
+    }
+    return strtoull(buf+1,NULL,10);
+}
+
+static void slaveMode(void) {
+    static char eofmark[RDB_EOF_MARK_SIZE];
+    static char lastbytes[RDB_EOF_MARK_SIZE];
+    static int usemark = 0;
+    unsigned long long payload = sendSync(context,eofmark);
+    char buf[1024];
+    int original_output = config.output;
+
+    if (payload == 0) {
+        payload = ULLONG_MAX;
+        memset(lastbytes,0,RDB_EOF_MARK_SIZE);
+        usemark = 1;
+        fprintf(stderr,"SYNC with master, discarding "
+                       "bytes of bulk transfer until EOF marker...\n");
+    } else {
+        fprintf(stderr,"SYNC with master, discarding %llu "
+                       "bytes of bulk transfer...\n", payload);
+    }
+
+
+    /* Discard the payload. */
+    while(payload) {
+        ssize_t nread;
+
+        nread = readConn(context,buf,(payload > sizeof(buf)) ? sizeof(buf) : payload);
+        if (nread <= 0) {
+            fprintf(stderr,"Error reading RDB payload while SYNCing\n");
+            exit(1);
+        }
+        payload -= nread;
+
+        if (usemark) {
+            /* Update the last bytes array, and check if it matches our delimiter.*/
+            if (nread >= RDB_EOF_MARK_SIZE) {
+                memcpy(lastbytes,buf+nread-RDB_EOF_MARK_SIZE,RDB_EOF_MARK_SIZE);
+            } else {
+                int rem = RDB_EOF_MARK_SIZE-nread;
+                memmove(lastbytes,lastbytes+nread,rem);
+                memcpy(lastbytes+rem,buf,nread);
+            }
+            if (memcmp(lastbytes,eofmark,RDB_EOF_MARK_SIZE) == 0)
+                break;
+        }
+    }
+
+    if (usemark) {
+        unsigned long long offset = ULLONG_MAX - payload;
+        fprintf(stderr,"SYNC done after %llu bytes. Logging commands from master.\n", offset);
+        /* put the slave online */
+        sleep(1);
+        sendReplconf("ACK", "0");
+    } else
+        fprintf(stderr,"SYNC done. Logging commands from master.\n");
+
+    /* Now we can use hiredis to read the incoming protocol. */
+    config.output = OUTPUT_CSV;
+    while (cliReadReply(0) == REDIS_OK);
+    config.output = original_output;
+}
+
+/*------------------------------------------------------------------------------
+ * RDB transfer mode
+ *--------------------------------------------------------------------------- */
+
+/* This function implements --rdb, so it uses the replication protocol in order
+ * to fetch the RDB file from a remote server. */
+static void getRDB(clusterManagerNode *node) {
+    int fd;
+    redisContext *s;
+    char *filename;
+    if (node != NULL) {
+        assert(node->context);
+        s = node->context;
+        filename = clusterManagerGetNodeRDBFilename(node);
+    } else {
+        s = context;
+        filename = config.rdb_filename;
+    }
+    static char eofmark[RDB_EOF_MARK_SIZE];
+    static char lastbytes[RDB_EOF_MARK_SIZE];
+    static int usemark = 0;
+    unsigned long long payload = sendSync(s, eofmark);
+    char buf[4096];
+
+    if (payload == 0) {
+        payload = ULLONG_MAX;
+        memset(lastbytes,0,RDB_EOF_MARK_SIZE);
+        usemark = 1;
+        fprintf(stderr,"SYNC sent to master, writing bytes of bulk transfer "
+                "until EOF marker to '%s'\n", filename);
+    } else {
+        fprintf(stderr,"SYNC sent to master, writing %llu bytes to '%s'\n",
+            payload, filename);
+    }
+
+    int write_to_stdout = !strcmp(filename,"-");
+    /* Write to file. */
+    if (write_to_stdout) {
+        fd = STDOUT_FILENO;
+    } else {
+        fd = open(filename, O_CREAT|O_WRONLY, 0644);
+        if (fd == -1) {
+            fprintf(stderr, "Error opening '%s': %s\n", filename,
+                strerror(errno));
+            exit(1);
+        }
+    }
+
+    while(payload) {
+        ssize_t nread, nwritten;
+
+        nread = readConn(s,buf,(payload > sizeof(buf)) ? sizeof(buf) : payload);
+        if (nread <= 0) {
+            fprintf(stderr,"I/O Error reading RDB payload from socket\n");
+            exit(1);
+        }
+        nwritten = write(fd, buf, nread);
+        if (nwritten != nread) {
+            fprintf(stderr,"Error writing data to file: %s\n",
+                (nwritten == -1) ? strerror(errno) : "short write");
+            exit(1);
+        }
+        payload -= nread;
+
+        if (usemark) {
+            /* Update the last bytes array, and check if it matches our delimiter.*/
+            if (nread >= RDB_EOF_MARK_SIZE) {
+                memcpy(lastbytes,buf+nread-RDB_EOF_MARK_SIZE,RDB_EOF_MARK_SIZE);
+            } else {
+                int rem = RDB_EOF_MARK_SIZE-nread;
+                memmove(lastbytes,lastbytes+nread,rem);
+                memcpy(lastbytes+rem,buf,nread);
+            }
+            if (memcmp(lastbytes,eofmark,RDB_EOF_MARK_SIZE) == 0)
+                break;
+        }
+    }
+    if (usemark) {
+        payload = ULLONG_MAX - payload - RDB_EOF_MARK_SIZE;
+        if (!write_to_stdout && ftruncate(fd, payload) == -1)
+            fprintf(stderr,"ftruncate failed: %s.\n", strerror(errno));
+        fprintf(stderr,"Transfer finished with success after %llu bytes\n", payload);
+    } else {
+        fprintf(stderr,"Transfer finished with success.\n");
+    }
+    redisFree(s); /* Close the connection ASAP as fsync() may take time. */
+    if (node)
+        node->context = NULL;
+    if (!write_to_stdout && fsync(fd) == -1) {
+        fprintf(stderr,"Fail to fsync '%s': %s\n", filename, strerror(errno));
+        exit(1);
+    }
+    close(fd);
+    if (node) {
+        sdsfree(filename);
+        return;
+    }
+    exit(0);
+}
+
+/*------------------------------------------------------------------------------
+ * Bulk import (pipe) mode
+ *--------------------------------------------------------------------------- */
+
+#define PIPEMODE_WRITE_LOOP_MAX_BYTES (128*1024)
+static void pipeMode(void) {
+    long long errors = 0, replies = 0, obuf_len = 0, obuf_pos = 0;
+    char obuf[1024*16]; /* Output buffer */
+    char aneterr[ANET_ERR_LEN];
+    redisReply *reply;
+    int eof = 0; /* True once we consumed all the standard input. */
+    int done = 0;
+    char magic[20]; /* Special reply we recognize. */
+    time_t last_read_time = time(NULL);
+
+    srand(time(NULL));
+
+    /* Use non blocking I/O. */
+    if (anetNonBlock(aneterr,context->fd) == ANET_ERR) {
+        fprintf(stderr, "Can't set the socket in non blocking mode: %s\n",
+            aneterr);
+        exit(1);
+    }
+
+    context->flags &= ~REDIS_BLOCK;
+
+    /* Transfer raw protocol and read replies from the server at the same
+     * time. */
+    while(!done) {
+        int mask = AE_READABLE;
+
+        if (!eof || obuf_len != 0) mask |= AE_WRITABLE;
+        mask = aeWait(context->fd,mask,1000);
+
+        /* Handle the readable state: we can read replies from the server. */
+        if (mask & AE_READABLE) {
+            int read_error = 0;
+
+            do {
+                if (!read_error && redisBufferRead(context) == REDIS_ERR) {
+                    read_error = 1;
+                }
+
+                reply = NULL;
+                if (redisGetReply(context, (void **) &reply) == REDIS_ERR) {
+                    fprintf(stderr, "Error reading replies from server\n");
+                    exit(1);
+                }
+                if (reply) {
+                    last_read_time = time(NULL);
+                    if (reply->type == REDIS_REPLY_ERROR) {
+                        fprintf(stderr,"%s\n", reply->str);
+                        errors++;
+                    } else if (eof && reply->type == REDIS_REPLY_STRING &&
+                                      reply->len == 20) {
+                        /* Check if this is the reply to our final ECHO
+                         * command. If so everything was received
+                         * from the server. */
+                        if (memcmp(reply->str,magic,20) == 0) {
+                            printf("Last reply received from server.\n");
+                            done = 1;
+                            replies--;
+                        }
+                    }
+                    replies++;
+                    freeReplyObject(reply);
+                }
+            } while(reply);
+
+            /* Abort on read errors. We abort here because it is important
+             * to consume replies even after a read error: this way we can
+             * show a potential problem to the user. */
+            if (read_error) exit(1);
+        }
+
+        /* Handle the writable state: we can send protocol to the server. */
+        if (mask & AE_WRITABLE) {
+            ssize_t loop_nwritten = 0;
+
+            while(1) {
+                /* Transfer current buffer to server. */
+                if (obuf_len != 0) {
+                    ssize_t nwritten = cliWriteConn(context,obuf+obuf_pos,obuf_len);
+
+                    if (nwritten == -1) {
+                        if (errno != EAGAIN && errno != EINTR) {
+                            fprintf(stderr, "Error writing to the server: %s\n",
+                                strerror(errno));
+                            exit(1);
+                        } else {
+                            nwritten = 0;
+                        }
+                    }
+                    obuf_len -= nwritten;
+                    obuf_pos += nwritten;
+                    loop_nwritten += nwritten;
+                    if (obuf_len != 0) break; /* Can't accept more data. */
+                }
+                if (context->err) {
+                    fprintf(stderr, "Server I/O Error: %s\n", context->errstr);
+                    exit(1);
+                }
+                /* If buffer is empty, load from stdin. */
+                if (obuf_len == 0 && !eof) {
+                    ssize_t nread = read(STDIN_FILENO,obuf,sizeof(obuf));
+
+                    if (nread == 0) {
+                        /* The ECHO sequence starts with a "\r\n" so that if there
+                         * is garbage in the protocol we read from stdin, the ECHO
+                         * will likely still be properly formatted.
+                         * CRLF is ignored by Redis, so it has no effects. */
+                        char echo[] =
+                        "\r\n*2\r\n$4\r\nECHO\r\n$20\r\n01234567890123456789\r\n";
+                        int j;
+
+                        eof = 1;
+                        /* Everything transferred, so we queue a special
+                         * ECHO command that we can match in the replies
+                         * to make sure everything was read from the server. */
+                        for (j = 0; j < 20; j++)
+                            magic[j] = rand() & 0xff;
+                        memcpy(echo+21,magic,20);
+                        memcpy(obuf,echo,sizeof(echo)-1);
+                        obuf_len = sizeof(echo)-1;
+                        obuf_pos = 0;
+                        printf("All data transferred. Waiting for the last reply...\n");
+                    } else if (nread == -1) {
+                        fprintf(stderr, "Error reading from stdin: %s\n",
+                            strerror(errno));
+                        exit(1);
+                    } else {
+                        obuf_len = nread;
+                        obuf_pos = 0;
+                    }
+                }
+                if ((obuf_len == 0 && eof) ||
+                    loop_nwritten > PIPEMODE_WRITE_LOOP_MAX_BYTES) break;
+            }
+        }
+
+        /* Handle timeout, that is, we reached EOF, and we are not getting
+         * replies from the server for a few seconds, nor the final ECHO is
+         * received. */
+        if (eof && config.pipe_timeout > 0 &&
+            time(NULL)-last_read_time > config.pipe_timeout)
+        {
+            fprintf(stderr,"No replies for %d seconds: exiting.\n",
+                config.pipe_timeout);
+            errors++;
+            break;
+        }
+    }
+    printf("errors: %lld, replies: %lld\n", errors, replies);
+    if (errors)
+        exit(1);
+    else
+        exit(0);
+}
+
+/*------------------------------------------------------------------------------
+ * Find big keys
+ *--------------------------------------------------------------------------- */
+
+static redisReply *sendScan(unsigned long long *it) {
+    redisReply *reply;
+
+    if (config.pattern)
+        reply = redisCommand(context, "SCAN %llu MATCH %b",
+            *it, config.pattern, sdslen(config.pattern));
+    else
+        reply = redisCommand(context,"SCAN %llu",*it);
+
+    /* Handle any error conditions */
+    if(reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        exit(1);
+    } else if(reply->type == REDIS_REPLY_ERROR) {
+        fprintf(stderr, "SCAN error: %s\n", reply->str);
+        exit(1);
+    } else if(reply->type != REDIS_REPLY_ARRAY) {
+        fprintf(stderr, "Non ARRAY response from SCAN!\n");
+        exit(1);
+    } else if(reply->elements != 2) {
+        fprintf(stderr, "Invalid element count from SCAN!\n");
+        exit(1);
+    }
+
+    /* Validate our types are correct */
+    assert(reply->element[0]->type == REDIS_REPLY_STRING);
+    assert(reply->element[1]->type == REDIS_REPLY_ARRAY);
+
+    /* Update iterator */
+    *it = strtoull(reply->element[0]->str, NULL, 10);
+
+    return reply;
+}
+
+static int getDbSize(void) {
+    redisReply *reply;
+    int size;
+
+    reply = redisCommand(context, "DBSIZE");
+
+    if (reply == NULL) {
+        fprintf(stderr, "\nI/O error\n");
+        exit(1);
+    } else if (reply->type == REDIS_REPLY_ERROR) {
+        fprintf(stderr, "Couldn't determine DBSIZE: %s\n", reply->str);
+        exit(1);
+    } else if (reply->type != REDIS_REPLY_INTEGER) {
+        fprintf(stderr, "Non INTEGER response from DBSIZE!\n");
+        exit(1);
+    }
+
+    /* Grab the number of keys and free our reply */
+    size = reply->integer;
+    freeReplyObject(reply);
+
+    return size;
+}
+
+typedef struct {
+    char *name;
+    char *sizecmd;
+    char *sizeunit;
+    unsigned long long biggest;
+    unsigned long long count;
+    unsigned long long totalsize;
+    sds biggest_key;
+} typeinfo;
+
+typeinfo type_string = { "string", "STRLEN", "bytes" };
+typeinfo type_list = { "list", "LLEN", "items" };
+typeinfo type_set = { "set", "SCARD", "members" };
+typeinfo type_hash = { "hash", "HLEN", "fields" };
+typeinfo type_zset = { "zset", "ZCARD", "members" };
+typeinfo type_stream = { "stream", "XLEN", "entries" };
+typeinfo type_other = { "other", NULL, "?" };
+
+static typeinfo* typeinfo_add(dict *types, char* name, typeinfo* type_template) {
+    typeinfo *info = zmalloc(sizeof(typeinfo));
+    *info = *type_template;
+    info->name = sdsnew(name);
+    dictAdd(types, info->name, info);
+    return info;
+}
+
+void type_free(void* priv_data, void* val) {
+    typeinfo *info = val;
+    UNUSED(priv_data);
+    if (info->biggest_key)
+        sdsfree(info->biggest_key);
+    sdsfree(info->name);
+    zfree(info);
+}
+
+static dictType typeinfoDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* key destructor (owned by the value)*/
+    type_free,                 /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+static void getKeyTypes(dict *types_dict, redisReply *keys, typeinfo **types) {
+    redisReply *reply;
+    unsigned int i;
+
+    /* Pipeline TYPE commands */
+    for(i=0;i<keys->elements;i++) {
+        const char* argv[] = {"TYPE", keys->element[i]->str};
+        size_t lens[] = {4, keys->element[i]->len};
+        redisAppendCommandArgv(context, 2, argv, lens);
+    }
+
+    /* Retrieve types */
+    for(i=0;i<keys->elements;i++) {
+        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
+            fprintf(stderr, "Error getting type for key '%s' (%d: %s)\n",
+                keys->element[i]->str, context->err, context->errstr);
+            exit(1);
+        } else if(reply->type != REDIS_REPLY_STATUS) {
+            if(reply->type == REDIS_REPLY_ERROR) {
+                fprintf(stderr, "TYPE returned an error: %s\n", reply->str);
+            } else {
+                fprintf(stderr,
+                    "Invalid reply type (%d) for TYPE on key '%s'!\n",
+                    reply->type, keys->element[i]->str);
+            }
+            exit(1);
+        }
+
+        sds typereply = sdsnew(reply->str);
+        dictEntry *de = dictFind(types_dict, typereply);
+        sdsfree(typereply);
+        typeinfo *type = NULL;
+        if (de)
+            type = dictGetVal(de);
+        else if (strcmp(reply->str, "none")) /* create new types for modules, (but not for deleted keys) */
+            type = typeinfo_add(types_dict, reply->str, &type_other);
+        types[i] = type;
+        freeReplyObject(reply);
+    }
+}
+
+static void getKeySizes(redisReply *keys, typeinfo **types,
+                        unsigned long long *sizes, int memkeys,
+                        unsigned memkeys_samples)
+{
+    redisReply *reply;
+    unsigned int i;
+
+    /* Pipeline size commands */
+    for(i=0;i<keys->elements;i++) {
+        /* Skip keys that disappeared between SCAN and TYPE (or unknown types when not in memkeys mode) */
+        if(!types[i] || (!types[i]->sizecmd && !memkeys))
+            continue;
+
+        if (!memkeys) {
+            const char* argv[] = {types[i]->sizecmd, keys->element[i]->str};
+            size_t lens[] = {strlen(types[i]->sizecmd), keys->element[i]->len};
+            redisAppendCommandArgv(context, 2, argv, lens);
+        } else if (memkeys_samples==0) {
+            const char* argv[] = {"MEMORY", "USAGE", keys->element[i]->str};
+            size_t lens[] = {6, 5, keys->element[i]->len};
+            redisAppendCommandArgv(context, 3, argv, lens);
+        } else {
+            sds samplesstr = sdsfromlonglong(memkeys_samples);
+            const char* argv[] = {"MEMORY", "USAGE", keys->element[i]->str, "SAMPLES", samplesstr};
+            size_t lens[] = {6, 5, keys->element[i]->len, 7, sdslen(samplesstr)};
+            redisAppendCommandArgv(context, 5, argv, lens);
+            sdsfree(samplesstr);
+        }
+    }
+
+    /* Retrieve sizes */
+    for(i=0;i<keys->elements;i++) {
+        /* Skip keys that disappeared between SCAN and TYPE (or unknown types when not in memkeys mode) */
+        if(!types[i] || (!types[i]->sizecmd && !memkeys)) {
+            sizes[i] = 0;
+            continue;
+        }
+
+        /* Retrieve size */
+        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
+            fprintf(stderr, "Error getting size for key '%s' (%d: %s)\n",
+                keys->element[i]->str, context->err, context->errstr);
+            exit(1);
+        } else if(reply->type != REDIS_REPLY_INTEGER) {
+            /* Theoretically the key could have been removed and
+             * added as a different type between TYPE and SIZE */
+            fprintf(stderr,
+                "Warning:  %s on '%s' failed (may have changed type)\n",
+                !memkeys? types[i]->sizecmd: "MEMORY USAGE",
+                keys->element[i]->str);
+            sizes[i] = 0;
+        } else {
+            sizes[i] = reply->integer;
+        }
+
+        freeReplyObject(reply);
+    }
+}
+
+static void findBigKeys(int memkeys, unsigned memkeys_samples) {
+    unsigned long long sampled = 0, total_keys, totlen=0, *sizes=NULL, it=0;
+    redisReply *reply, *keys;
+    unsigned int arrsize=0, i;
+    dictIterator *di;
+    dictEntry *de;
+    typeinfo **types = NULL;
+    double pct;
+
+    dict *types_dict = dictCreate(&typeinfoDictType, NULL);
+    typeinfo_add(types_dict, "string", &type_string);
+    typeinfo_add(types_dict, "list", &type_list);
+    typeinfo_add(types_dict, "set", &type_set);
+    typeinfo_add(types_dict, "hash", &type_hash);
+    typeinfo_add(types_dict, "zset", &type_zset);
+    typeinfo_add(types_dict, "stream", &type_stream);
+
+    /* Total keys pre scanning */
+    total_keys = getDbSize();
+
+    /* Status message */
+    printf("\n# Scanning the entire keyspace to find biggest keys as well as\n");
+    printf("# average sizes per key type.  You can use -i 0.1 to sleep 0.1 sec\n");
+    printf("# per 100 SCAN commands (not usually needed).\n\n");
+
+    /* SCAN loop */
+    do {
+        /* Calculate approximate percentage completion */
+        pct = 100 * (double)sampled/total_keys;
+
+        /* Grab some keys and point to the keys array */
+        reply = sendScan(&it);
+        keys  = reply->element[1];
+
+        /* Reallocate our type and size array if we need to */
+        if(keys->elements > arrsize) {
+            types = zrealloc(types, sizeof(typeinfo*)*keys->elements);
+            sizes = zrealloc(sizes, sizeof(unsigned long long)*keys->elements);
+
+            if(!types || !sizes) {
+                fprintf(stderr, "Failed to allocate storage for keys!\n");
+                exit(1);
+            }
+
+            arrsize = keys->elements;
+        }
+
+        /* Retrieve types and then sizes */
+        getKeyTypes(types_dict, keys, types);
+        getKeySizes(keys, types, sizes, memkeys, memkeys_samples);
+
+        /* Now update our stats */
+        for(i=0;i<keys->elements;i++) {
+            typeinfo *type = types[i];
+            /* Skip keys that disappeared between SCAN and TYPE */
+            if(!type)
+                continue;
+
+            type->totalsize += sizes[i];
+            type->count++;
+            totlen += keys->element[i]->len;
+            sampled++;
+
+            if(type->biggest<sizes[i]) {
+                /* Keep track of biggest key name for this type */
+                if (type->biggest_key)
+                    sdsfree(type->biggest_key);
+                type->biggest_key = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
+                if(!type->biggest_key) {
+                    fprintf(stderr, "Failed to allocate memory for key!\n");
+                    exit(1);
+                }
+
+                printf(
+                   "[%05.2f%%] Biggest %-6s found so far '%s' with %llu %s\n",
+                   pct, type->name, type->biggest_key, sizes[i],
+                   !memkeys? type->sizeunit: "bytes");
+
+                /* Keep track of the biggest size for this type */
+                type->biggest = sizes[i];
+            }
+
+            /* Update overall progress */
+            if(sampled % 1000000 == 0) {
+                printf("[%05.2f%%] Sampled %llu keys so far\n", pct, sampled);
+            }
+        }
+
+        /* Sleep if we've been directed to do so */
+        if(sampled && (sampled %100) == 0 && config.interval) {
+            usleep(config.interval);
+        }
+
+        freeReplyObject(reply);
+    } while(it != 0);
+
+    if(types) zfree(types);
+    if(sizes) zfree(sizes);
+
+    /* We're done */
+    printf("\n-------- summary -------\n\n");
+
+    printf("Sampled %llu keys in the keyspace!\n", sampled);
+    printf("Total key length in bytes is %llu (avg len %.2f)\n\n",
+       totlen, totlen ? (double)totlen/sampled : 0);
+
+    /* Output the biggest keys we found, for types we did find */
+    di = dictGetIterator(types_dict);
+    while ((de = dictNext(di))) {
+        typeinfo *type = dictGetVal(de);
+        if(type->biggest_key) {
+            printf("Biggest %6s found '%s' has %llu %s\n", type->name, type->biggest_key,
+               type->biggest, !memkeys? type->sizeunit: "bytes");
+        }
+    }
+    dictReleaseIterator(di);
+
+    printf("\n");
+
+    di = dictGetIterator(types_dict);
+    while ((de = dictNext(di))) {
+        typeinfo *type = dictGetVal(de);
+        printf("%llu %ss with %llu %s (%05.2f%% of keys, avg size %.2f)\n",
+           type->count, type->name, type->totalsize, !memkeys? type->sizeunit: "bytes",
+           sampled ? 100 * (double)type->count/sampled : 0,
+           type->count ? (double)type->totalsize/type->count : 0);
+    }
+    dictReleaseIterator(di);
+
+    dictRelease(types_dict);
+
+    /* Success! */
+    exit(0);
+}
+
+static void getKeyFreqs(redisReply *keys, unsigned long long *freqs) {
+    redisReply *reply;
+    unsigned int i;
+
+    /* Pipeline OBJECT freq commands */
+    for(i=0;i<keys->elements;i++) {
+        const char* argv[] = {"OBJECT", "FREQ", keys->element[i]->str};
+        size_t lens[] = {6, 4, keys->element[i]->len};
+        redisAppendCommandArgv(context, 3, argv, lens);
+    }
+
+    /* Retrieve freqs */
+    for(i=0;i<keys->elements;i++) {
+        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
+            sds keyname = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
+            fprintf(stderr, "Error getting freq for key '%s' (%d: %s)\n",
+                keyname, context->err, context->errstr);
+            sdsfree(keyname);
+            exit(1);
+        } else if(reply->type != REDIS_REPLY_INTEGER) {
+            if(reply->type == REDIS_REPLY_ERROR) {
+                fprintf(stderr, "Error: %s\n", reply->str);
+                exit(1);
+            } else {
+                sds keyname = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
+                fprintf(stderr, "Warning: OBJECT freq on '%s' failed (may have been deleted)\n", keyname);
+                sdsfree(keyname);
+                freqs[i] = 0;
+            }
+        } else {
+            freqs[i] = reply->integer;
+        }
+        freeReplyObject(reply);
+    }
+}
+
+#define HOTKEYS_SAMPLE 16
+static void findHotKeys(void) {
+    redisReply *keys, *reply;
+    unsigned long long counters[HOTKEYS_SAMPLE] = {0};
+    sds hotkeys[HOTKEYS_SAMPLE] = {NULL};
+    unsigned long long sampled = 0, total_keys, *freqs = NULL, it = 0;
+    unsigned int arrsize = 0, i, k;
+    double pct;
+
+    /* Total keys pre scanning */
+    total_keys = getDbSize();
+
+    /* Status message */
+    printf("\n# Scanning the entire keyspace to find hot keys as well as\n");
+    printf("# average sizes per key type.  You can use -i 0.1 to sleep 0.1 sec\n");
+    printf("# per 100 SCAN commands (not usually needed).\n\n");
+
+    /* SCAN loop */
+    do {
+        /* Calculate approximate percentage completion */
+        pct = 100 * (double)sampled/total_keys;
+
+        /* Grab some keys and point to the keys array */
+        reply = sendScan(&it);
+        keys  = reply->element[1];
+
+        /* Reallocate our freqs array if we need to */
+        if(keys->elements > arrsize) {
+            freqs = zrealloc(freqs, sizeof(unsigned long long)*keys->elements);
+
+            if(!freqs) {
+                fprintf(stderr, "Failed to allocate storage for keys!\n");
+                exit(1);
+            }
+
+            arrsize = keys->elements;
+        }
+
+        getKeyFreqs(keys, freqs);
+
+        /* Now update our stats */
+        for(i=0;i<keys->elements;i++) {
+            sampled++;
+            /* Update overall progress */
+            if(sampled % 1000000 == 0) {
+                printf("[%05.2f%%] Sampled %llu keys so far\n", pct, sampled);
+            }
+
+            /* Use eviction pool here */
+            k = 0;
+            while (k < HOTKEYS_SAMPLE && freqs[i] > counters[k]) k++;
+            if (k == 0) continue;
+            k--;
+            if (k == 0 || counters[k] == 0) {
+                sdsfree(hotkeys[k]);
+            } else {
+                sdsfree(hotkeys[0]);
+                memmove(counters,counters+1,sizeof(counters[0])*k);
+                memmove(hotkeys,hotkeys+1,sizeof(hotkeys[0])*k);
+            }
+            counters[k] = freqs[i];
+            hotkeys[k] = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
+            printf(
+               "[%05.2f%%] Hot key '%s' found so far with counter %llu\n",
+               pct, hotkeys[k], freqs[i]);
+        }
+
+        /* Sleep if we've been directed to do so */
+        if(sampled && (sampled %100) == 0 && config.interval) {
+            usleep(config.interval);
+        }
+
+        freeReplyObject(reply);
+    } while(it != 0);
+
+    if (freqs) zfree(freqs);
+
+    /* We're done */
+    printf("\n-------- summary -------\n\n");
+
+    printf("Sampled %llu keys in the keyspace!\n", sampled);
+
+    for (i=1; i<= HOTKEYS_SAMPLE; i++) {
+        k = HOTKEYS_SAMPLE - i;
+        if(counters[k]>0) {
+            printf("hot key found with counter: %llu\tkeyname: %s\n", counters[k], hotkeys[k]);
+            sdsfree(hotkeys[k]);
+        }
+    }
+
+    exit(0);
+}
+
+/*------------------------------------------------------------------------------
+ * Stats mode
+ *--------------------------------------------------------------------------- */
+
+/* Return the specified INFO field from the INFO command output "info".
+ * A new buffer is allocated for the result, that needs to be free'd.
+ * If the field is not found NULL is returned. */
+static char *getInfoField(char *info, char *field) {
+    char *p = strstr(info,field);
+    char *n1, *n2;
+    char *result;
+
+    if (!p) return NULL;
+    p += strlen(field)+1;
+    n1 = strchr(p,'\r');
+    n2 = strchr(p,',');
+    if (n2 && n2 < n1) n1 = n2;
+    result = zmalloc(sizeof(char)*(n1-p)+1);
+    memcpy(result,p,(n1-p));
+    result[n1-p] = '\0';
+    return result;
+}
+
+/* Like the above function but automatically convert the result into
+ * a long. On error (missing field) LONG_MIN is returned. */
+static long getLongInfoField(char *info, char *field) {
+    char *value = getInfoField(info,field);
+    long l;
+
+    if (!value) return LONG_MIN;
+    l = strtol(value,NULL,10);
+    zfree(value);
+    return l;
+}
+
+/* Convert number of bytes into a human readable string of the form:
+ * 100B, 2G, 100M, 4K, and so forth. */
+void bytesToHuman(char *s, long long n) {
+    double d;
+
+    if (n < 0) {
+        *s = '-';
+        s++;
+        n = -n;
+    }
+    if (n < 1024) {
+        /* Bytes */
+        sprintf(s,"%lldB",n);
+        return;
+    } else if (n < (1024*1024)) {
+        d = (double)n/(1024);
+        sprintf(s,"%.2fK",d);
+    } else if (n < (1024LL*1024*1024)) {
+        d = (double)n/(1024*1024);
+        sprintf(s,"%.2fM",d);
+    } else if (n < (1024LL*1024*1024*1024)) {
+        d = (double)n/(1024LL*1024*1024);
+        sprintf(s,"%.2fG",d);
+    }
+}
+
+static void statMode(void) {
+    redisReply *reply;
+    long aux, requests = 0;
+    int i = 0;
+
+    while(1) {
+        char buf[64];
+        int j;
+
+        reply = reconnectingRedisCommand(context,"INFO");
+        if (reply->type == REDIS_REPLY_ERROR) {
+            printf("ERROR: %s\n", reply->str);
+            exit(1);
+        }
+
+        if ((i++ % 20) == 0) {
+            printf(
+"------- data ------ --------------------- load -------------------- - child -\n"
+"keys       mem      clients blocked requests            connections          \n");
+        }
+
+        /* Keys */
+        aux = 0;
+        for (j = 0; j < 20; j++) {
+            long k;
+
+            sprintf(buf,"db%d:keys",j);
+            k = getLongInfoField(reply->str,buf);
+            if (k == LONG_MIN) continue;
+            aux += k;
+        }
+        sprintf(buf,"%ld",aux);
+        printf("%-11s",buf);
+
+        /* Used memory */
+        aux = getLongInfoField(reply->str,"used_memory");
+        bytesToHuman(buf,aux);
+        printf("%-8s",buf);
+
+        /* Clients */
+        aux = getLongInfoField(reply->str,"connected_clients");
+        sprintf(buf,"%ld",aux);
+        printf(" %-8s",buf);
+
+        /* Blocked (BLPOPPING) Clients */
+        aux = getLongInfoField(reply->str,"blocked_clients");
+        sprintf(buf,"%ld",aux);
+        printf("%-8s",buf);
+
+        /* Requests */
+        aux = getLongInfoField(reply->str,"total_commands_processed");
+        sprintf(buf,"%ld (+%ld)",aux,requests == 0 ? 0 : aux-requests);
+        printf("%-19s",buf);
+        requests = aux;
+
+        /* Connections */
+        aux = getLongInfoField(reply->str,"total_connections_received");
+        sprintf(buf,"%ld",aux);
+        printf(" %-12s",buf);
+
+        /* Children */
+        aux = getLongInfoField(reply->str,"bgsave_in_progress");
+        aux |= getLongInfoField(reply->str,"aof_rewrite_in_progress") << 1;
+        aux |= getLongInfoField(reply->str,"loading") << 2;
+        switch(aux) {
+        case 0: break;
+        case 1:
+            printf("SAVE");
+            break;
+        case 2:
+            printf("AOF");
+            break;
+        case 3:
+            printf("SAVE+AOF");
+            break;
+        case 4:
+            printf("LOAD");
+            break;
+        }
+
+        printf("\n");
+        freeReplyObject(reply);
+        usleep(config.interval);
+    }
+}
+
+/*------------------------------------------------------------------------------
+ * Scan mode
+ *--------------------------------------------------------------------------- */
+
+static void scanMode(void) {
+    redisReply *reply;
+    unsigned long long cur = 0;
+
+    do {
+        reply = sendScan(&cur);
+        for (unsigned int j = 0; j < reply->element[1]->elements; j++) {
+            if (config.output == OUTPUT_STANDARD) {
+                sds out = sdscatrepr(sdsempty(), reply->element[1]->element[j]->str,
+                                     reply->element[1]->element[j]->len);
+                printf("%s\n", out);
+                sdsfree(out);
+            } else {
+                printf("%s\n", reply->element[1]->element[j]->str);
+            }
+        }
+        freeReplyObject(reply);
+    } while(cur != 0);
+
+    exit(0);
+}
+
+/*------------------------------------------------------------------------------
+ * LRU test mode
+ *--------------------------------------------------------------------------- */
+
+/* Return an integer from min to max (both inclusive) using a power-law
+ * distribution, depending on the value of alpha: the greater the alpha
+ * the more bias towards lower values.
+ *
+ * With alpha = 6.2 the output follows the 80-20 rule where 20% of
+ * the returned numbers will account for 80% of the frequency. */
+long long powerLawRand(long long min, long long max, double alpha) {
+    double pl, r;
+
+    max += 1;
+    r = ((double)rand()) / RAND_MAX;
+    pl = pow(
+        ((pow(max,alpha+1) - pow(min,alpha+1))*r + pow(min,alpha+1)),
+        (1.0/(alpha+1)));
+    return (max-1-(long long)pl)+min;
+}
+
+/* Generates a key name among a set of lru_test_sample_size keys, using
+ * an 80-20 distribution. */
+void LRUTestGenKey(char *buf, size_t buflen) {
+    snprintf(buf, buflen, "lru:%lld",
+        powerLawRand(1, config.lru_test_sample_size, 6.2));
+}
+
+#define LRU_CYCLE_PERIOD 1000 /* 1000 milliseconds. */
+#define LRU_CYCLE_PIPELINE_SIZE 250
+static void LRUTestMode(void) {
+    redisReply *reply;
+    char key[128];
+    long long start_cycle;
+    int j;
+
+    srand(time(NULL)^getpid());
+    while(1) {
+        /* Perform cycles of 1 second with 50% writes and 50% reads.
+         * We use pipelining batching writes / reads N times per cycle in order
+         * to fill the target instance easily. */
+        start_cycle = mstime();
+        long long hits = 0, misses = 0;
+        while(mstime() - start_cycle < LRU_CYCLE_PERIOD) {
+            /* Write cycle. */
+            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
+                char val[6];
+                val[5] = '\0';
+                for (int i = 0; i < 5; i++) val[i] = 'A'+rand()%('z'-'A');
+                LRUTestGenKey(key,sizeof(key));
+                redisAppendCommand(context, "SET %s %s",key,val);
+            }
+            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++)
+                redisGetReply(context, (void**)&reply);
+
+            /* Read cycle. */
+            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
+                LRUTestGenKey(key,sizeof(key));
+                redisAppendCommand(context, "GET %s",key);
+            }
+            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
+                if (redisGetReply(context, (void**)&reply) == REDIS_OK) {
+                    switch(reply->type) {
+                        case REDIS_REPLY_ERROR:
+                            printf("%s\n", reply->str);
+                            break;
+                        case REDIS_REPLY_NIL:
+                            misses++;
+                            break;
+                        default:
+                            hits++;
+                            break;
+                    }
+                }
+            }
+
+            if (context->err) {
+                fprintf(stderr,"I/O error during LRU test\n");
+                exit(1);
+            }
+        }
+        /* Print stats. */
+        printf(
+            "%lld Gets/sec | Hits: %lld (%.2f%%) | Misses: %lld (%.2f%%)\n",
+            hits+misses,
+            hits, (double)hits/(hits+misses)*100,
+            misses, (double)misses/(hits+misses)*100);
+    }
+    exit(0);
+}
+
+/*------------------------------------------------------------------------------
+ * Intrisic latency mode.
+ *
+ * Measure max latency of a running process that does not result from
+ * syscalls. Basically this software should provide a hint about how much
+ * time the kernel leaves the process without a chance to run.
+ *--------------------------------------------------------------------------- */
+
+/* This is just some computation the compiler can't optimize out.
+ * Should run in less than 100-200 microseconds even using very
+ * slow hardware. Runs in less than 10 microseconds in modern HW. */
+unsigned long compute_something_fast(void) {
+    unsigned char s[256], i, j, t;
+    int count = 1000, k;
+    unsigned long output = 0;
+
+    for (k = 0; k < 256; k++) s[k] = k;
+
+    i = 0;
+    j = 0;
+    while(count--) {
+        i++;
+        j = j + s[i];
+        t = s[i];
+        s[i] = s[j];
+        s[j] = t;
+        output += s[(s[i]+s[j])&255];
+    }
+    return output;
+}
+
+static void intrinsicLatencyModeStop(int s) {
+    UNUSED(s);
+    force_cancel_loop = 1;
+}
+
+static void intrinsicLatencyMode(void) {
+    long long test_end, run_time, max_latency = 0, runs = 0;
+
+    run_time = config.intrinsic_latency_duration*1000000;
+    test_end = ustime() + run_time;
+    signal(SIGINT, intrinsicLatencyModeStop);
+
+    while(1) {
+        long long start, end, latency;
+
+        start = ustime();
+        compute_something_fast();
+        end = ustime();
+        latency = end-start;
+        runs++;
+        if (latency <= 0) continue;
+
+        /* Reporting */
+        if (latency > max_latency) {
+            max_latency = latency;
+            printf("Max latency so far: %lld microseconds.\n", max_latency);
+        }
+
+        double avg_us = (double)run_time/runs;
+        double avg_ns = avg_us * 1e3;
+        if (force_cancel_loop || end > test_end) {
+            printf("\n%lld total runs "
+                "(avg latency: "
+                "%.4f microseconds / %.2f nanoseconds per run).\n",
+                runs, avg_us, avg_ns);
+            printf("Worst run took %.0fx longer than the average latency.\n",
+                max_latency / avg_us);
+            exit(0);
+        }
+    }
+}
+
+static sds askPassword(const char *msg) {
+    linenoiseMaskModeEnable();
+    sds auth = linenoise(msg);
+    linenoiseMaskModeDisable();
+    return auth;
+}
+
+/*------------------------------------------------------------------------------
+ * Program main()
+ *--------------------------------------------------------------------------- */
+
+int main(int argc, char **argv) {
+    int firstarg;
+    struct timeval tv;
+
+    memset(&config.sslconfig, 0, sizeof(config.sslconfig));
+    config.hostip = sdsnew("127.0.0.1");
+    config.hostport = 6379;
+    config.hostsocket = NULL;
+    config.repeat = 1;
+    config.interval = 0;
+    config.dbnum = 0;
+    config.input_dbnum = 0;
+    config.interactive = 0;
+    config.shutdown = 0;
+    config.monitor_mode = 0;
+    config.pubsub_mode = 0;
+    config.latency_mode = 0;
+    config.latency_dist_mode = 0;
+    config.latency_history = 0;
+    config.lru_test_mode = 0;
+    config.lru_test_sample_size = 0;
+    config.cluster_mode = 0;
+    config.cluster_send_asking = 0;
+    config.slave_mode = 0;
+    config.getrdb_mode = 0;
+    config.stat_mode = 0;
+    config.scan_mode = 0;
+    config.intrinsic_latency_mode = 0;
+    config.pattern = NULL;
+    config.rdb_filename = NULL;
+    config.pipe_mode = 0;
+    config.pipe_timeout = REDIS_CLI_DEFAULT_PIPE_TIMEOUT;
+    config.bigkeys = 0;
+    config.hotkeys = 0;
+    config.stdinarg = 0;
+    config.auth = NULL;
+    config.askpass = 0;
+    config.user = NULL;
+    config.eval = NULL;
+    config.eval_ldb = 0;
+    config.eval_ldb_end = 0;
+    config.eval_ldb_sync = 0;
+    config.enable_ldb_on_eval = 0;
+    config.last_cmd_type = -1;
+    config.verbose = 0;
+    config.set_errcode = 0;
+    config.no_auth_warning = 0;
+    config.in_multi = 0;
+    config.cluster_manager_command.name = NULL;
+    config.cluster_manager_command.argc = 0;
+    config.cluster_manager_command.argv = NULL;
+    config.cluster_manager_command.flags = 0;
+    config.cluster_manager_command.replicas = 0;
+    config.cluster_manager_command.from = NULL;
+    config.cluster_manager_command.to = NULL;
+    config.cluster_manager_command.from_user = NULL;
+    config.cluster_manager_command.from_pass = NULL;
+    config.cluster_manager_command.from_askpass = 0;
+    config.cluster_manager_command.weight = NULL;
+    config.cluster_manager_command.weight_argc = 0;
+    config.cluster_manager_command.slots = 0;
+    config.cluster_manager_command.timeout = CLUSTER_MANAGER_MIGRATE_TIMEOUT;
+    config.cluster_manager_command.pipeline = CLUSTER_MANAGER_MIGRATE_PIPELINE;
+    config.cluster_manager_command.threshold =
+        CLUSTER_MANAGER_REBALANCE_THRESHOLD;
+    config.cluster_manager_command.backup_dir = NULL;
+    pref.hints = 1;
+
+    spectrum_palette = spectrum_palette_color;
+    spectrum_palette_size = spectrum_palette_color_size;
+
+    if (!isatty(fileno(stdout)) && (getenv("FAKETTY") == NULL)) {
+        config.output = OUTPUT_RAW;
+        config.push_output = 0;
+    } else {
+        config.output = OUTPUT_STANDARD;
+        config.push_output = 1;
+    }
+    config.mb_delim = sdsnew("\n");
+    config.cmd_delim = sdsnew("\n");
+
+    firstarg = parseOptions(argc,argv);
+    argc -= firstarg;
+    argv += firstarg;
+
+    parseEnv();
+
+    if (config.askpass) {
+        config.auth = askPassword("Please input password: ");
+    }
+
+    if (config.cluster_manager_command.from_askpass) {
+        config.cluster_manager_command.from_pass = askPassword(
+            "Please input import source node password: ");
+    }
+
+#ifdef USE_OPENSSL
+    if (config.tls) {
+        cliSecureInit();
+    }
+#endif
+
+    gettimeofday(&tv, NULL);
+    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
+
+    /* Cluster Manager mode */
+    if (CLUSTER_MANAGER_MODE()) {
+        clusterManagerCommandProc *proc = validateClusterManagerCommand();
+        if (!proc) {
+            exit(1);
+        }
+        clusterManagerMode(proc);
+    }
+
+    /* Latency mode */
+    if (config.latency_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        latencyMode();
+    }
+
+    /* Latency distribution mode */
+    if (config.latency_dist_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        latencyDistMode();
+    }
+
+    /* Slave mode */
+    if (config.slave_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        sendCapa();
+        slaveMode();
+    }
+
+    /* Get RDB mode. */
+    if (config.getrdb_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        sendCapa();
+        sendRdbOnly();
+        getRDB(NULL);
+    }
+
+    /* Pipe mode */
+    if (config.pipe_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        pipeMode();
+    }
+
+    /* Find big keys */
+    if (config.bigkeys) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        findBigKeys(0, 0);
+    }
+
+    /* Find large keys */
+    if (config.memkeys) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        findBigKeys(1, config.memkeys_samples);
+    }
+
+    /* Find hot keys */
+    if (config.hotkeys) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        findHotKeys();
+    }
+
+    /* Stat mode */
+    if (config.stat_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        if (config.interval == 0) config.interval = 1000000;
+        statMode();
+    }
+
+    /* Scan mode */
+    if (config.scan_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        scanMode();
+    }
+
+    /* LRU test mode */
+    if (config.lru_test_mode) {
+        if (cliConnect(0) == REDIS_ERR) exit(1);
+        LRUTestMode();
+    }
+
+    /* Intrinsic latency mode */
+    if (config.intrinsic_latency_mode) intrinsicLatencyMode();
+
+    /* Start interactive mode when no command is provided */
+    if (argc == 0 && !config.eval) {
+        /* Ignore SIGPIPE in interactive mode to force a reconnect */
+        signal(SIGPIPE, SIG_IGN);
+
+        /* Note that in repl mode we don't abort on connection error.
+         * A new attempt will be performed for every command send. */
+        cliConnect(0);
+        repl();
+    }
+
+    /* Otherwise, we have some arguments to execute */
+    if (cliConnect(0) != REDIS_OK) exit(1);
+    if (config.eval) {
+        return evalMode(argc,argv);
+    } else {
+        return noninteractive(argc,argv);
+    }
+}
diff --git a/redis-stable/src/redis-trib.rb b/redis-stable/src/redis-trib.rb
new file mode 100755
index 00000000..b1af8306
--- /dev/null
+++ b/redis-stable/src/redis-trib.rb
@@ -0,0 +1,129 @@
+#!/usr/bin/env ruby
+
+def colorized(str, color)
+    return str if !(ENV['TERM'] || '')["xterm"]
+    color_code = {
+        white: 29,
+        bold: '29;1',
+        black: 30,
+        red: 31,
+        green: 32,
+        yellow: 33,
+        blue: 34,
+        magenta: 35,
+        cyan: 36,
+        gray: 37
+    }[color]
+    return str if !color_code
+    "\033[#{color_code}m#{str}\033[0m"
+end
+
+class String
+
+    %w(white bold black red green yellow blue magenta cyan gray).each{|color|
+        color = :"#{color}"
+        define_method(color){
+            colorized(self, color)
+        }
+    }
+
+end
+
+COMMANDS = %w(create check info fix reshard rebalance add-node 
+              del-node set-timeout call import help)
+
+ALLOWED_OPTIONS={
+    "create" => {"replicas" => true},
+    "add-node" => {"slave" => false, "master-id" => true},
+    "import" => {"from" => :required, "copy" => false, "replace" => false},
+    "reshard" => {"from" => true, "to" => true, "slots" => true, "yes" => false, "timeout" => true, "pipeline" => true},
+    "rebalance" => {"weight" => [], "auto-weights" => false, "use-empty-masters" => false, "timeout" => true, "simulate" => false, "pipeline" => true, "threshold" => true},
+    "fix" => {"timeout" => 0},
+}
+
+def parse_options(cmd)
+    cmd = cmd.downcase
+    idx = 0
+    options = {}
+    args = []
+    while (arg = ARGV.shift)
+        if arg[0..1] == "--"
+            option = arg[2..-1]
+
+            # --verbose is a global option
+            if option == "--verbose"
+                options['verbose'] = true
+                next
+            end
+            if ALLOWED_OPTIONS[cmd] == nil || 
+               ALLOWED_OPTIONS[cmd][option] == nil
+                next
+            end
+            if ALLOWED_OPTIONS[cmd][option] != false
+                value = ARGV.shift
+                next if !value
+            else
+                value = true
+            end
+
+            # If the option is set to [], it's a multiple arguments
+            # option. We just queue every new value into an array.
+            if ALLOWED_OPTIONS[cmd][option] == []
+                options[option] = [] if !options[option]
+                options[option] << value
+            else
+                options[option] = value
+            end
+        else
+            next if arg[0,1] == '-'
+            args << arg
+        end
+    end
+
+    return options,args
+end
+
+def command_example(cmd, args, opts)
+    cmd = "redis-cli --cluster #{cmd}"
+    args.each{|a| 
+        a = a.to_s
+        a = a.inspect if a[' ']
+        cmd << " #{a}"
+    }
+    opts.each{|opt, val|
+        opt = " --cluster-#{opt.downcase}"
+        if val != true
+            val = val.join(' ') if val.is_a? Array
+            opt << " #{val}"
+        end
+        cmd << opt
+    }
+    cmd
+end
+
+$command = ARGV.shift
+$opts, $args = parse_options($command) if $command
+
+puts "WARNING: redis-trib.rb is not longer available!".yellow
+puts "You should use #{'redis-cli'.bold} instead."
+puts ''
+puts "All commands and features belonging to redis-trib.rb "+
+     "have been moved\nto redis-cli."
+puts "In order to use them you should call redis-cli with the #{'--cluster'.bold}"
+puts "option followed by the subcommand name, arguments and options."
+puts ''
+puts "Use the following syntax:"
+puts "redis-cli --cluster SUBCOMMAND [ARGUMENTS] [OPTIONS]".bold
+puts ''
+puts "Example:"
+if $command
+    example = command_example $command, $args, $opts
+else
+    example = "redis-cli --cluster info 127.0.0.1:7000"
+end
+puts example.bold
+puts ''
+puts "To get help about all subcommands, type:"
+puts "redis-cli --cluster help".bold
+puts ''
+exit 1
diff --git a/redis-stable/src/redisassert.h b/redis-stable/src/redisassert.h
new file mode 100644
index 00000000..dd792055
--- /dev/null
+++ b/redis-stable/src/redisassert.h
@@ -0,0 +1,49 @@
+/* redisassert.h -- Drop in replacements assert.h that prints the stack trace
+ *                  in the Redis logs.
+ *
+ * This file should be included instead of "assert.h" inside libraries used by
+ * Redis that are using assertions, so instead of Redis disappearing with
+ * SIGABORT, we get the details and stack trace inside the log file.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __REDIS_ASSERT_H__
+#define __REDIS_ASSERT_H__
+
+#include "config.h"
+
+#define assert(_e) (likely((_e))?(void)0 : (_serverAssert(#_e,__FILE__,__LINE__),redis_unreachable()))
+#define panic(...) _serverPanic(__FILE__,__LINE__,__VA_ARGS__),redis_unreachable()
+
+void _serverAssert(char *estr, char *file, int line);
+void _serverPanic(const char *file, int line, const char *msg, ...);
+
+#endif
diff --git a/redis-stable/src/redismodule.h b/redis-stable/src/redismodule.h
new file mode 100644
index 00000000..48a3a9df
--- /dev/null
+++ b/redis-stable/src/redismodule.h
@@ -0,0 +1,1137 @@
+#ifndef REDISMODULE_H
+#define REDISMODULE_H
+
+#include <sys/types.h>
+#include <stdint.h>
+#include <stdio.h>
+
+/* ---------------- Defines common between core and modules --------------- */
+
+/* Error status return values. */
+#define REDISMODULE_OK 0
+#define REDISMODULE_ERR 1
+
+/* API versions. */
+#define REDISMODULE_APIVER_1 1
+
+/* Version of the RedisModuleTypeMethods structure. Once the RedisModuleTypeMethods 
+ * structure is changed, this version number needs to be changed synchronistically. */
+#define REDISMODULE_TYPE_METHOD_VERSION 3
+
+/* API flags and constants */
+#define REDISMODULE_READ (1<<0)
+#define REDISMODULE_WRITE (1<<1)
+
+/* RedisModule_OpenKey extra flags for the 'mode' argument.
+ * Avoid touching the LRU/LFU of the key when opened. */
+#define REDISMODULE_OPEN_KEY_NOTOUCH (1<<16)
+
+#define REDISMODULE_LIST_HEAD 0
+#define REDISMODULE_LIST_TAIL 1
+
+/* Key types. */
+#define REDISMODULE_KEYTYPE_EMPTY 0
+#define REDISMODULE_KEYTYPE_STRING 1
+#define REDISMODULE_KEYTYPE_LIST 2
+#define REDISMODULE_KEYTYPE_HASH 3
+#define REDISMODULE_KEYTYPE_SET 4
+#define REDISMODULE_KEYTYPE_ZSET 5
+#define REDISMODULE_KEYTYPE_MODULE 6
+#define REDISMODULE_KEYTYPE_STREAM 7
+
+/* Reply types. */
+#define REDISMODULE_REPLY_UNKNOWN -1
+#define REDISMODULE_REPLY_STRING 0
+#define REDISMODULE_REPLY_ERROR 1
+#define REDISMODULE_REPLY_INTEGER 2
+#define REDISMODULE_REPLY_ARRAY 3
+#define REDISMODULE_REPLY_NULL 4
+
+/* Postponed array length. */
+#define REDISMODULE_POSTPONED_ARRAY_LEN -1
+
+/* Expire */
+#define REDISMODULE_NO_EXPIRE -1
+
+/* Sorted set API flags. */
+#define REDISMODULE_ZADD_XX      (1<<0)
+#define REDISMODULE_ZADD_NX      (1<<1)
+#define REDISMODULE_ZADD_ADDED   (1<<2)
+#define REDISMODULE_ZADD_UPDATED (1<<3)
+#define REDISMODULE_ZADD_NOP     (1<<4)
+#define REDISMODULE_ZADD_GT      (1<<5)
+#define REDISMODULE_ZADD_LT      (1<<6)
+
+/* Hash API flags. */
+#define REDISMODULE_HASH_NONE       0
+#define REDISMODULE_HASH_NX         (1<<0)
+#define REDISMODULE_HASH_XX         (1<<1)
+#define REDISMODULE_HASH_CFIELDS    (1<<2)
+#define REDISMODULE_HASH_EXISTS     (1<<3)
+#define REDISMODULE_HASH_COUNT_ALL  (1<<4)
+
+/* StreamID type. */
+typedef struct RedisModuleStreamID {
+    uint64_t ms;
+    uint64_t seq;
+} RedisModuleStreamID;
+
+/* StreamAdd() flags. */
+#define REDISMODULE_STREAM_ADD_AUTOID (1<<0)
+/* StreamIteratorStart() flags. */
+#define REDISMODULE_STREAM_ITERATOR_EXCLUSIVE (1<<0)
+#define REDISMODULE_STREAM_ITERATOR_REVERSE (1<<1)
+/* StreamIteratorTrim*() flags. */
+#define REDISMODULE_STREAM_TRIM_APPROX (1<<0)
+
+/* Context Flags: Info about the current context returned by
+ * RM_GetContextFlags(). */
+
+/* The command is running in the context of a Lua script */
+#define REDISMODULE_CTX_FLAGS_LUA (1<<0)
+/* The command is running inside a Redis transaction */
+#define REDISMODULE_CTX_FLAGS_MULTI (1<<1)
+/* The instance is a master */
+#define REDISMODULE_CTX_FLAGS_MASTER (1<<2)
+/* The instance is a slave */
+#define REDISMODULE_CTX_FLAGS_SLAVE (1<<3)
+/* The instance is read-only (usually meaning it's a slave as well) */
+#define REDISMODULE_CTX_FLAGS_READONLY (1<<4)
+/* The instance is running in cluster mode */
+#define REDISMODULE_CTX_FLAGS_CLUSTER (1<<5)
+/* The instance has AOF enabled */
+#define REDISMODULE_CTX_FLAGS_AOF (1<<6)
+/* The instance has RDB enabled */
+#define REDISMODULE_CTX_FLAGS_RDB (1<<7)
+/* The instance has Maxmemory set */
+#define REDISMODULE_CTX_FLAGS_MAXMEMORY (1<<8)
+/* Maxmemory is set and has an eviction policy that may delete keys */
+#define REDISMODULE_CTX_FLAGS_EVICT (1<<9)
+/* Redis is out of memory according to the maxmemory flag. */
+#define REDISMODULE_CTX_FLAGS_OOM (1<<10)
+/* Less than 25% of memory available according to maxmemory. */
+#define REDISMODULE_CTX_FLAGS_OOM_WARNING (1<<11)
+/* The command was sent over the replication link. */
+#define REDISMODULE_CTX_FLAGS_REPLICATED (1<<12)
+/* Redis is currently loading either from AOF or RDB. */
+#define REDISMODULE_CTX_FLAGS_LOADING (1<<13)
+/* The replica has no link with its master, note that
+ * there is the inverse flag as well:
+ *
+ *  REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE
+ *
+ * The two flags are exclusive, one or the other can be set. */
+#define REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE (1<<14)
+/* The replica is trying to connect with the master.
+ * (REPL_STATE_CONNECT and REPL_STATE_CONNECTING states) */
+#define REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING (1<<15)
+/* THe replica is receiving an RDB file from its master. */
+#define REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING (1<<16)
+/* The replica is online, receiving updates from its master. */
+#define REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE (1<<17)
+/* There is currently some background process active. */
+#define REDISMODULE_CTX_FLAGS_ACTIVE_CHILD (1<<18)
+/* The next EXEC will fail due to dirty CAS (touched keys). */
+#define REDISMODULE_CTX_FLAGS_MULTI_DIRTY (1<<19)
+/* Redis is currently running inside background child process. */
+#define REDISMODULE_CTX_FLAGS_IS_CHILD (1<<20)
+/* The current client does not allow blocking, either called from
+ * within multi, lua, or from another module using RM_Call */
+#define REDISMODULE_CTX_FLAGS_DENY_BLOCKING (1<<21)
+
+/* Next context flag, must be updated when adding new flags above!
+This flag should not be used directly by the module.
+ * Use RedisModule_GetContextFlagsAll instead. */
+#define _REDISMODULE_CTX_FLAGS_NEXT (1<<22)
+
+/* Keyspace changes notification classes. Every class is associated with a
+ * character for configuration purposes.
+ * NOTE: These have to be in sync with NOTIFY_* in server.h */
+#define REDISMODULE_NOTIFY_KEYSPACE (1<<0)    /* K */
+#define REDISMODULE_NOTIFY_KEYEVENT (1<<1)    /* E */
+#define REDISMODULE_NOTIFY_GENERIC (1<<2)     /* g */
+#define REDISMODULE_NOTIFY_STRING (1<<3)      /* $ */
+#define REDISMODULE_NOTIFY_LIST (1<<4)        /* l */
+#define REDISMODULE_NOTIFY_SET (1<<5)         /* s */
+#define REDISMODULE_NOTIFY_HASH (1<<6)        /* h */
+#define REDISMODULE_NOTIFY_ZSET (1<<7)        /* z */
+#define REDISMODULE_NOTIFY_EXPIRED (1<<8)     /* x */
+#define REDISMODULE_NOTIFY_EVICTED (1<<9)     /* e */
+#define REDISMODULE_NOTIFY_STREAM (1<<10)     /* t */
+#define REDISMODULE_NOTIFY_KEY_MISS (1<<11)   /* m (Note: This one is excluded from REDISMODULE_NOTIFY_ALL on purpose) */
+#define REDISMODULE_NOTIFY_LOADED (1<<12)     /* module only key space notification, indicate a key loaded from rdb */
+#define REDISMODULE_NOTIFY_MODULE (1<<13)     /* d, module key space notification */
+
+/* Next notification flag, must be updated when adding new flags above!
+This flag should not be used directly by the module.
+ * Use RedisModule_GetKeyspaceNotificationFlagsAll instead. */
+#define _REDISMODULE_NOTIFY_NEXT (1<<14)
+
+#define REDISMODULE_NOTIFY_ALL (REDISMODULE_NOTIFY_GENERIC | REDISMODULE_NOTIFY_STRING | REDISMODULE_NOTIFY_LIST | REDISMODULE_NOTIFY_SET | REDISMODULE_NOTIFY_HASH | REDISMODULE_NOTIFY_ZSET | REDISMODULE_NOTIFY_EXPIRED | REDISMODULE_NOTIFY_EVICTED | REDISMODULE_NOTIFY_STREAM | REDISMODULE_NOTIFY_MODULE)      /* A */
+
+/* A special pointer that we can use between the core and the module to signal
+ * field deletion, and that is impossible to be a valid pointer. */
+#define REDISMODULE_HASH_DELETE ((RedisModuleString*)(long)1)
+
+/* Error messages. */
+#define REDISMODULE_ERRORMSG_WRONGTYPE "WRONGTYPE Operation against a key holding the wrong kind of value"
+
+#define REDISMODULE_POSITIVE_INFINITE (1.0/0.0)
+#define REDISMODULE_NEGATIVE_INFINITE (-1.0/0.0)
+
+/* Cluster API defines. */
+#define REDISMODULE_NODE_ID_LEN 40
+#define REDISMODULE_NODE_MYSELF     (1<<0)
+#define REDISMODULE_NODE_MASTER     (1<<1)
+#define REDISMODULE_NODE_SLAVE      (1<<2)
+#define REDISMODULE_NODE_PFAIL      (1<<3)
+#define REDISMODULE_NODE_FAIL       (1<<4)
+#define REDISMODULE_NODE_NOFAILOVER (1<<5)
+
+#define REDISMODULE_CLUSTER_FLAG_NONE 0
+#define REDISMODULE_CLUSTER_FLAG_NO_FAILOVER (1<<1)
+#define REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION (1<<2)
+
+#define REDISMODULE_NOT_USED(V) ((void) V)
+
+/* Logging level strings */
+#define REDISMODULE_LOGLEVEL_DEBUG "debug"
+#define REDISMODULE_LOGLEVEL_VERBOSE "verbose"
+#define REDISMODULE_LOGLEVEL_NOTICE "notice"
+#define REDISMODULE_LOGLEVEL_WARNING "warning"
+
+/* Bit flags for aux_save_triggers and the aux_load and aux_save callbacks */
+#define REDISMODULE_AUX_BEFORE_RDB (1<<0)
+#define REDISMODULE_AUX_AFTER_RDB (1<<1)
+
+/* This type represents a timer handle, and is returned when a timer is
+ * registered and used in order to invalidate a timer. It's just a 64 bit
+ * number, because this is how each timer is represented inside the radix tree
+ * of timers that are going to expire, sorted by expire time. */
+typedef uint64_t RedisModuleTimerID;
+
+/* CommandFilter Flags */
+
+/* Do filter RedisModule_Call() commands initiated by module itself. */
+#define REDISMODULE_CMDFILTER_NOSELF    (1<<0)
+
+/* Declare that the module can handle errors with RedisModule_SetModuleOptions. */
+#define REDISMODULE_OPTIONS_HANDLE_IO_ERRORS    (1<<0)
+/* When set, Redis will not call RedisModule_SignalModifiedKey(), implicitly in
+ * RedisModule_CloseKey, and the module needs to do that when manually when keys
+ * are modified from the user's sperspective, to invalidate WATCH. */
+#define REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED (1<<1)
+
+/* Server events definitions.
+ * Those flags should not be used directly by the module, instead
+ * the module should use RedisModuleEvent_* variables */
+#define REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED 0
+#define REDISMODULE_EVENT_PERSISTENCE 1
+#define REDISMODULE_EVENT_FLUSHDB 2
+#define REDISMODULE_EVENT_LOADING 3
+#define REDISMODULE_EVENT_CLIENT_CHANGE 4
+#define REDISMODULE_EVENT_SHUTDOWN 5
+#define REDISMODULE_EVENT_REPLICA_CHANGE 6
+#define REDISMODULE_EVENT_MASTER_LINK_CHANGE 7
+#define REDISMODULE_EVENT_CRON_LOOP 8
+#define REDISMODULE_EVENT_MODULE_CHANGE 9
+#define REDISMODULE_EVENT_LOADING_PROGRESS 10
+#define REDISMODULE_EVENT_SWAPDB 11
+#define REDISMODULE_EVENT_REPL_BACKUP 12
+#define REDISMODULE_EVENT_FORK_CHILD 13
+#define _REDISMODULE_EVENT_NEXT 14 /* Next event flag, should be updated if a new event added. */
+
+typedef struct RedisModuleEvent {
+    uint64_t id;        /* REDISMODULE_EVENT_... defines. */
+    uint64_t dataver;   /* Version of the structure we pass as 'data'. */
+} RedisModuleEvent;
+
+struct RedisModuleCtx;
+struct RedisModuleDefragCtx;
+typedef void (*RedisModuleEventCallback)(struct RedisModuleCtx *ctx, RedisModuleEvent eid, uint64_t subevent, void *data);
+
+static const RedisModuleEvent
+    RedisModuleEvent_ReplicationRoleChanged = {
+        REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
+        1
+    },
+    RedisModuleEvent_Persistence = {
+        REDISMODULE_EVENT_PERSISTENCE,
+        1
+    },
+    RedisModuleEvent_FlushDB = {
+        REDISMODULE_EVENT_FLUSHDB,
+        1
+    },
+    RedisModuleEvent_Loading = {
+        REDISMODULE_EVENT_LOADING,
+        1
+    },
+    RedisModuleEvent_ClientChange = {
+        REDISMODULE_EVENT_CLIENT_CHANGE,
+        1
+    },
+    RedisModuleEvent_Shutdown = {
+        REDISMODULE_EVENT_SHUTDOWN,
+        1
+    },
+    RedisModuleEvent_ReplicaChange = {
+        REDISMODULE_EVENT_REPLICA_CHANGE,
+        1
+    },
+    RedisModuleEvent_CronLoop = {
+        REDISMODULE_EVENT_CRON_LOOP,
+        1
+    },
+    RedisModuleEvent_MasterLinkChange = {
+        REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+        1
+    },
+    RedisModuleEvent_ModuleChange = {
+        REDISMODULE_EVENT_MODULE_CHANGE,
+        1
+    },
+    RedisModuleEvent_LoadingProgress = {
+        REDISMODULE_EVENT_LOADING_PROGRESS,
+        1
+    },
+    RedisModuleEvent_SwapDB = {
+        REDISMODULE_EVENT_SWAPDB,
+        1
+    },
+    RedisModuleEvent_ReplBackup = {
+        REDISMODULE_EVENT_REPL_BACKUP,
+        1
+    },
+    RedisModuleEvent_ForkChild = {
+        REDISMODULE_EVENT_FORK_CHILD,
+        1
+    };
+
+/* Those are values that are used for the 'subevent' callback argument. */
+#define REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START 0
+#define REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START 1
+#define REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START 2
+#define REDISMODULE_SUBEVENT_PERSISTENCE_ENDED 3
+#define REDISMODULE_SUBEVENT_PERSISTENCE_FAILED 4
+#define _REDISMODULE_SUBEVENT_PERSISTENCE_NEXT 5
+
+#define REDISMODULE_SUBEVENT_LOADING_RDB_START 0
+#define REDISMODULE_SUBEVENT_LOADING_AOF_START 1
+#define REDISMODULE_SUBEVENT_LOADING_REPL_START 2
+#define REDISMODULE_SUBEVENT_LOADING_ENDED 3
+#define REDISMODULE_SUBEVENT_LOADING_FAILED 4
+#define _REDISMODULE_SUBEVENT_LOADING_NEXT 5
+
+#define REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED 0
+#define REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED 1
+#define _REDISMODULE_SUBEVENT_CLIENT_CHANGE_NEXT 2
+
+#define REDISMODULE_SUBEVENT_MASTER_LINK_UP 0
+#define REDISMODULE_SUBEVENT_MASTER_LINK_DOWN 1
+#define _REDISMODULE_SUBEVENT_MASTER_NEXT 2
+
+#define REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE 0
+#define REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE 1
+#define _REDISMODULE_SUBEVENT_REPLICA_CHANGE_NEXT 2
+
+#define REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER 0
+#define REDISMODULE_EVENT_REPLROLECHANGED_NOW_REPLICA 1
+#define _REDISMODULE_EVENT_REPLROLECHANGED_NEXT 2
+
+#define REDISMODULE_SUBEVENT_FLUSHDB_START 0
+#define REDISMODULE_SUBEVENT_FLUSHDB_END 1
+#define _REDISMODULE_SUBEVENT_FLUSHDB_NEXT 2
+
+#define REDISMODULE_SUBEVENT_MODULE_LOADED 0
+#define REDISMODULE_SUBEVENT_MODULE_UNLOADED 1
+#define _REDISMODULE_SUBEVENT_MODULE_NEXT 2
+
+#define REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB 0
+#define REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF 1
+#define _REDISMODULE_SUBEVENT_LOADING_PROGRESS_NEXT 2
+
+#define REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE 0
+#define REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE 1
+#define REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD 2
+#define _REDISMODULE_SUBEVENT_REPL_BACKUP_NEXT 3
+
+#define REDISMODULE_SUBEVENT_FORK_CHILD_BORN 0
+#define REDISMODULE_SUBEVENT_FORK_CHILD_DIED 1
+#define _REDISMODULE_SUBEVENT_FORK_CHILD_NEXT 2
+
+#define _REDISMODULE_SUBEVENT_SHUTDOWN_NEXT 0
+#define _REDISMODULE_SUBEVENT_CRON_LOOP_NEXT 0
+#define _REDISMODULE_SUBEVENT_SWAPDB_NEXT 0
+
+/* RedisModuleClientInfo flags. */
+#define REDISMODULE_CLIENTINFO_FLAG_SSL (1<<0)
+#define REDISMODULE_CLIENTINFO_FLAG_PUBSUB (1<<1)
+#define REDISMODULE_CLIENTINFO_FLAG_BLOCKED (1<<2)
+#define REDISMODULE_CLIENTINFO_FLAG_TRACKING (1<<3)
+#define REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET (1<<4)
+#define REDISMODULE_CLIENTINFO_FLAG_MULTI (1<<5)
+
+/* Here we take all the structures that the module pass to the core
+ * and the other way around. Notably the list here contains the structures
+ * used by the hooks API RedisModule_RegisterToServerEvent().
+ *
+ * The structures always start with a 'version' field. This is useful
+ * when we want to pass a reference to the structure to the core APIs,
+ * for the APIs to fill the structure. In that case, the structure 'version'
+ * field is initialized before passing it to the core, so that the core is
+ * able to cast the pointer to the appropriate structure version. In this
+ * way we obtain ABI compatibility.
+ *
+ * Here we'll list all the structure versions in case they evolve over time,
+ * however using a define, we'll make sure to use the last version as the
+ * public name for the module to use. */
+
+#define REDISMODULE_CLIENTINFO_VERSION 1
+typedef struct RedisModuleClientInfo {
+    uint64_t version;       /* Version of this structure for ABI compat. */
+    uint64_t flags;         /* REDISMODULE_CLIENTINFO_FLAG_* */
+    uint64_t id;            /* Client ID. */
+    char addr[46];          /* IPv4 or IPv6 address. */
+    uint16_t port;          /* TCP port. */
+    uint16_t db;            /* Selected DB. */
+} RedisModuleClientInfoV1;
+
+#define RedisModuleClientInfo RedisModuleClientInfoV1
+
+#define REDISMODULE_REPLICATIONINFO_VERSION 1
+typedef struct RedisModuleReplicationInfo {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    int master;             /* true if master, false if replica */
+    char *masterhost;       /* master instance hostname for NOW_REPLICA */
+    int masterport;         /* master instance port for NOW_REPLICA */
+    char *replid1;          /* Main replication ID */
+    char *replid2;          /* Secondary replication ID */
+    uint64_t repl1_offset;  /* Main replication offset */
+    uint64_t repl2_offset;  /* Offset of replid2 validity */
+} RedisModuleReplicationInfoV1;
+
+#define RedisModuleReplicationInfo RedisModuleReplicationInfoV1
+
+#define REDISMODULE_FLUSHINFO_VERSION 1
+typedef struct RedisModuleFlushInfo {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    int32_t sync;           /* Synchronous or threaded flush?. */
+    int32_t dbnum;          /* Flushed database number, -1 for ALL. */
+} RedisModuleFlushInfoV1;
+
+#define RedisModuleFlushInfo RedisModuleFlushInfoV1
+
+#define REDISMODULE_MODULE_CHANGE_VERSION 1
+typedef struct RedisModuleModuleChange {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    const char* module_name;/* Name of module loaded or unloaded. */
+    int32_t module_version; /* Module version. */
+} RedisModuleModuleChangeV1;
+
+#define RedisModuleModuleChange RedisModuleModuleChangeV1
+
+#define REDISMODULE_CRON_LOOP_VERSION 1
+typedef struct RedisModuleCronLoopInfo {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    int32_t hz;             /* Approximate number of events per second. */
+} RedisModuleCronLoopV1;
+
+#define RedisModuleCronLoop RedisModuleCronLoopV1
+
+#define REDISMODULE_LOADING_PROGRESS_VERSION 1
+typedef struct RedisModuleLoadingProgressInfo {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    int32_t hz;             /* Approximate number of events per second. */
+    int32_t progress;       /* Approximate progress between 0 and 1024, or -1
+                             * if unknown. */
+} RedisModuleLoadingProgressV1;
+
+#define RedisModuleLoadingProgress RedisModuleLoadingProgressV1
+
+#define REDISMODULE_SWAPDBINFO_VERSION 1
+typedef struct RedisModuleSwapDbInfo {
+    uint64_t version;       /* Not used since this structure is never passed
+                               from the module to the core right now. Here
+                               for future compatibility. */
+    int32_t dbnum_first;    /* Swap Db first dbnum */
+    int32_t dbnum_second;   /* Swap Db second dbnum */
+} RedisModuleSwapDbInfoV1;
+
+#define RedisModuleSwapDbInfo RedisModuleSwapDbInfoV1
+
+/* ------------------------- End of common defines ------------------------ */
+
+#ifndef REDISMODULE_CORE
+
+typedef long long mstime_t;
+
+/* Macro definitions specific to individual compilers */
+#ifndef REDISMODULE_ATTR_UNUSED
+#    ifdef __GNUC__
+#        define REDISMODULE_ATTR_UNUSED __attribute__((unused))
+#    else
+#        define REDISMODULE_ATTR_UNUSED
+#    endif
+#endif
+
+#ifndef REDISMODULE_ATTR_PRINTF
+#    ifdef __GNUC__
+#        define REDISMODULE_ATTR_PRINTF(idx,cnt) __attribute__((format(printf,idx,cnt)))
+#    else
+#        define REDISMODULE_ATTR_PRINTF(idx,cnt)
+#    endif
+#endif
+
+#ifndef REDISMODULE_ATTR_COMMON
+#    if defined(__GNUC__) && !defined(__clang__)
+#        define REDISMODULE_ATTR_COMMON __attribute__((__common__))
+#    else
+#        define REDISMODULE_ATTR_COMMON
+#    endif
+#endif
+
+/* Incomplete structures for compiler checks but opaque access. */
+typedef struct RedisModuleCtx RedisModuleCtx;
+typedef struct RedisModuleKey RedisModuleKey;
+typedef struct RedisModuleString RedisModuleString;
+typedef struct RedisModuleCallReply RedisModuleCallReply;
+typedef struct RedisModuleIO RedisModuleIO;
+typedef struct RedisModuleType RedisModuleType;
+typedef struct RedisModuleDigest RedisModuleDigest;
+typedef struct RedisModuleBlockedClient RedisModuleBlockedClient;
+typedef struct RedisModuleClusterInfo RedisModuleClusterInfo;
+typedef struct RedisModuleDict RedisModuleDict;
+typedef struct RedisModuleDictIter RedisModuleDictIter;
+typedef struct RedisModuleCommandFilterCtx RedisModuleCommandFilterCtx;
+typedef struct RedisModuleCommandFilter RedisModuleCommandFilter;
+typedef struct RedisModuleInfoCtx RedisModuleInfoCtx;
+typedef struct RedisModuleServerInfoData RedisModuleServerInfoData;
+typedef struct RedisModuleScanCursor RedisModuleScanCursor;
+typedef struct RedisModuleDefragCtx RedisModuleDefragCtx;
+typedef struct RedisModuleUser RedisModuleUser;
+
+typedef int (*RedisModuleCmdFunc)(RedisModuleCtx *ctx, RedisModuleString **argv, int argc);
+typedef void (*RedisModuleDisconnectFunc)(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc);
+typedef int (*RedisModuleNotificationFunc)(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key);
+typedef void *(*RedisModuleTypeLoadFunc)(RedisModuleIO *rdb, int encver);
+typedef void (*RedisModuleTypeSaveFunc)(RedisModuleIO *rdb, void *value);
+typedef int (*RedisModuleTypeAuxLoadFunc)(RedisModuleIO *rdb, int encver, int when);
+typedef void (*RedisModuleTypeAuxSaveFunc)(RedisModuleIO *rdb, int when);
+typedef void (*RedisModuleTypeRewriteFunc)(RedisModuleIO *aof, RedisModuleString *key, void *value);
+typedef size_t (*RedisModuleTypeMemUsageFunc)(const void *value);
+typedef void (*RedisModuleTypeDigestFunc)(RedisModuleDigest *digest, void *value);
+typedef void (*RedisModuleTypeFreeFunc)(void *value);
+typedef size_t (*RedisModuleTypeFreeEffortFunc)(RedisModuleString *key, const void *value);
+typedef void (*RedisModuleTypeUnlinkFunc)(RedisModuleString *key, const void *value);
+typedef void *(*RedisModuleTypeCopyFunc)(RedisModuleString *fromkey, RedisModuleString *tokey, const void *value);
+typedef int (*RedisModuleTypeDefragFunc)(RedisModuleDefragCtx *ctx, RedisModuleString *key, void **value);
+typedef void (*RedisModuleClusterMessageReceiver)(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len);
+typedef void (*RedisModuleTimerProc)(RedisModuleCtx *ctx, void *data);
+typedef void (*RedisModuleCommandFilterFunc) (RedisModuleCommandFilterCtx *filter);
+typedef void (*RedisModuleForkDoneHandler) (int exitcode, int bysignal, void *user_data);
+typedef void (*RedisModuleInfoFunc)(RedisModuleInfoCtx *ctx, int for_crash_report);
+typedef void (*RedisModuleScanCB)(RedisModuleCtx *ctx, RedisModuleString *keyname, RedisModuleKey *key, void *privdata);
+typedef void (*RedisModuleScanKeyCB)(RedisModuleKey *key, RedisModuleString *field, RedisModuleString *value, void *privdata);
+typedef void (*RedisModuleUserChangedFunc) (uint64_t client_id, void *privdata);
+typedef int (*RedisModuleDefragFunc)(RedisModuleDefragCtx *ctx);
+
+typedef struct RedisModuleTypeMethods {
+    uint64_t version;
+    RedisModuleTypeLoadFunc rdb_load;
+    RedisModuleTypeSaveFunc rdb_save;
+    RedisModuleTypeRewriteFunc aof_rewrite;
+    RedisModuleTypeMemUsageFunc mem_usage;
+    RedisModuleTypeDigestFunc digest;
+    RedisModuleTypeFreeFunc free;
+    RedisModuleTypeAuxLoadFunc aux_load;
+    RedisModuleTypeAuxSaveFunc aux_save;
+    int aux_save_triggers;
+    RedisModuleTypeFreeEffortFunc free_effort;
+    RedisModuleTypeUnlinkFunc unlink;
+    RedisModuleTypeCopyFunc copy;
+    RedisModuleTypeDefragFunc defrag;
+} RedisModuleTypeMethods;
+
+#define REDISMODULE_GET_API(name) \
+    RedisModule_GetApi("RedisModule_" #name, ((void **)&RedisModule_ ## name))
+
+/* Default API declaration prefix (not 'extern' for backwards compatibility) */
+#ifndef REDISMODULE_API
+#define REDISMODULE_API
+#endif
+
+/* Default API declaration suffix (compiler attributes) */
+#ifndef REDISMODULE_ATTR
+#define REDISMODULE_ATTR REDISMODULE_ATTR_COMMON
+#endif
+
+REDISMODULE_API void * (*RedisModule_Alloc)(size_t bytes) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_Realloc)(void *ptr, size_t bytes) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_Free)(void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_Calloc)(size_t nmemb, size_t size) REDISMODULE_ATTR;
+REDISMODULE_API char * (*RedisModule_Strdup)(const char *str) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetApi)(const char *, void *) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CreateCommand)(RedisModuleCtx *ctx, const char *name, RedisModuleCmdFunc cmdfunc, const char *strflags, int firstkey, int lastkey, int keystep) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SetModuleAttribs)(RedisModuleCtx *ctx, const char *name, int ver, int apiver) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsModuleNameBusy)(const char *name) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_WrongArity)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithLongLong)(RedisModuleCtx *ctx, long long ll) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetSelectedDb)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SelectDb)(RedisModuleCtx *ctx, int newid) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_OpenKey)(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_CloseKey)(RedisModuleKey *kp) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_KeyType)(RedisModuleKey *kp) REDISMODULE_ATTR;
+REDISMODULE_API size_t (*RedisModule_ValueLength)(RedisModuleKey *kp) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ListPush)(RedisModuleKey *kp, int where, RedisModuleString *ele) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_ListPop)(RedisModuleKey *key, int where) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCallReply * (*RedisModule_Call)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
+REDISMODULE_API const char * (*RedisModule_CallReplyProto)(RedisModuleCallReply *reply, size_t *len) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeCallReply)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CallReplyType)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API long long (*RedisModule_CallReplyInteger)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API size_t (*RedisModule_CallReplyLength)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCallReply * (*RedisModule_CallReplyArrayElement)(RedisModuleCallReply *reply, size_t idx) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateString)(RedisModuleCtx *ctx, const char *ptr, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromLongLong)(RedisModuleCtx *ctx, long long ll) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromDouble)(RedisModuleCtx *ctx, double d) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromLongDouble)(RedisModuleCtx *ctx, long double ld, int humanfriendly) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromString)(RedisModuleCtx *ctx, const RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromStreamID)(RedisModuleCtx *ctx, const RedisModuleStreamID *id) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringPrintf)(RedisModuleCtx *ctx, const char *fmt, ...) REDISMODULE_ATTR_PRINTF(2,3) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API const char * (*RedisModule_StringPtrLen)(const RedisModuleString *str, size_t *len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithError)(RedisModuleCtx *ctx, const char *err) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithSimpleString)(RedisModuleCtx *ctx, const char *msg) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithArray)(RedisModuleCtx *ctx, long len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithNullArray)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithEmptyArray)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ReplySetArrayLength)(RedisModuleCtx *ctx, long len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithStringBuffer)(RedisModuleCtx *ctx, const char *buf, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithCString)(RedisModuleCtx *ctx, const char *buf) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithEmptyString)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithVerbatimString)(RedisModuleCtx *ctx, const char *buf, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithNull)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithDouble)(RedisModuleCtx *ctx, double d) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithLongDouble)(RedisModuleCtx *ctx, long double d) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplyWithCallReply)(RedisModuleCtx *ctx, RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringToLongLong)(const RedisModuleString *str, long long *ll) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringToDouble)(const RedisModuleString *str, double *d) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringToLongDouble)(const RedisModuleString *str, long double *d) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringToStreamID)(const RedisModuleString *str, RedisModuleStreamID *id) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_AutoMemory)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_Replicate)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ReplicateVerbatim)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API const char * (*RedisModule_CallReplyStringPtr)(RedisModuleCallReply *reply, size_t *len) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromCallReply)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DeleteKey)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_UnlinkKey)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringSet)(RedisModuleKey *key, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API char * (*RedisModule_StringDMA)(RedisModuleKey *key, size_t *len, int mode) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringTruncate)(RedisModuleKey *key, size_t newlen) REDISMODULE_ATTR;
+REDISMODULE_API mstime_t (*RedisModule_GetExpire)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SetExpire)(RedisModuleKey *key, mstime_t expire) REDISMODULE_ATTR;
+REDISMODULE_API mstime_t (*RedisModule_GetAbsExpire)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SetAbsExpire)(RedisModuleKey *key, mstime_t expire) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ResetDataset)(int restart_aof, int async) REDISMODULE_ATTR;
+REDISMODULE_API unsigned long long (*RedisModule_DbSize)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_RandomKey)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetAdd)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetIncrby)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr, double *newscore) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetScore)(RedisModuleKey *key, RedisModuleString *ele, double *score) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetRem)(RedisModuleKey *key, RedisModuleString *ele, int *deleted) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ZsetRangeStop)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetFirstInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetLastInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetFirstInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetLastInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_ZsetRangeCurrentElement)(RedisModuleKey *key, double *score) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetRangeNext)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetRangePrev)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ZsetRangeEndReached)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_HashSet)(RedisModuleKey *key, int flags, ...) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_HashGet)(RedisModuleKey *key, int flags, ...) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamAdd)(RedisModuleKey *key, int flags, RedisModuleStreamID *id, RedisModuleString **argv, int64_t numfields) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamDelete)(RedisModuleKey *key, RedisModuleStreamID *id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamIteratorStart)(RedisModuleKey *key, int flags, RedisModuleStreamID *startid, RedisModuleStreamID *endid) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamIteratorStop)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamIteratorNextID)(RedisModuleKey *key, RedisModuleStreamID *id, long *numfields) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamIteratorNextField)(RedisModuleKey *key, RedisModuleString **field_ptr, RedisModuleString **value_ptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StreamIteratorDelete)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API long long (*RedisModule_StreamTrimByLength)(RedisModuleKey *key, int flags, long long length) REDISMODULE_ATTR;
+REDISMODULE_API long long (*RedisModule_StreamTrimByID)(RedisModuleKey *key, int flags, RedisModuleStreamID *id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsKeysPositionRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_KeyAtPos)(RedisModuleCtx *ctx, int pos) REDISMODULE_ATTR;
+REDISMODULE_API unsigned long long (*RedisModule_GetClientId)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_GetClientUserNameById)(RedisModuleCtx *ctx, uint64_t id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetClientInfoById)(void *ci, uint64_t id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_PublishMessage)(RedisModuleCtx *ctx, RedisModuleString *channel, RedisModuleString *message) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetContextFlags)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_AvoidReplicaTraffic)() REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_PoolAlloc)(RedisModuleCtx *ctx, size_t bytes) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleType * (*RedisModule_CreateDataType)(RedisModuleCtx *ctx, const char *name, int encver, RedisModuleTypeMethods *typemethods) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ModuleTypeSetValue)(RedisModuleKey *key, RedisModuleType *mt, void *value) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ModuleTypeReplaceValue)(RedisModuleKey *key, RedisModuleType *mt, void *new_value, void **old_value) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleType * (*RedisModule_ModuleTypeGetType)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_ModuleTypeGetValue)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsIOError)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SetModuleOptions)(RedisModuleCtx *ctx, int options) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SignalModifiedKey)(RedisModuleCtx *ctx, RedisModuleString *keyname) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveUnsigned)(RedisModuleIO *io, uint64_t value) REDISMODULE_ATTR;
+REDISMODULE_API uint64_t (*RedisModule_LoadUnsigned)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveSigned)(RedisModuleIO *io, int64_t value) REDISMODULE_ATTR;
+REDISMODULE_API int64_t (*RedisModule_LoadSigned)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_EmitAOF)(RedisModuleIO *io, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveString)(RedisModuleIO *io, RedisModuleString *s) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveStringBuffer)(RedisModuleIO *io, const char *str, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_LoadString)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API char * (*RedisModule_LoadStringBuffer)(RedisModuleIO *io, size_t *lenptr) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveDouble)(RedisModuleIO *io, double value) REDISMODULE_ATTR;
+REDISMODULE_API double (*RedisModule_LoadDouble)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveFloat)(RedisModuleIO *io, float value) REDISMODULE_ATTR;
+REDISMODULE_API float (*RedisModule_LoadFloat)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SaveLongDouble)(RedisModuleIO *io, long double value) REDISMODULE_ATTR;
+REDISMODULE_API long double (*RedisModule_LoadLongDouble)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_LoadDataTypeFromString)(const RedisModuleString *str, const RedisModuleType *mt) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_SaveDataTypeToString)(RedisModuleCtx *ctx, void *data, const RedisModuleType *mt) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_Log)(RedisModuleCtx *ctx, const char *level, const char *fmt, ...) REDISMODULE_ATTR REDISMODULE_ATTR_PRINTF(3,4);
+REDISMODULE_API void (*RedisModule_LogIOError)(RedisModuleIO *io, const char *levelstr, const char *fmt, ...) REDISMODULE_ATTR REDISMODULE_ATTR_PRINTF(3,4);
+REDISMODULE_API void (*RedisModule__Assert)(const char *estr, const char *file, int line) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_LatencyAddSample)(const char *event, mstime_t latency) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringAppendBuffer)(RedisModuleCtx *ctx, RedisModuleString *str, const char *buf, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_RetainString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_HoldString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StringCompare)(RedisModuleString *a, RedisModuleString *b) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCtx * (*RedisModule_GetContextFromIO)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API const RedisModuleString * (*RedisModule_GetKeyNameFromIO)(RedisModuleIO *io) REDISMODULE_ATTR;
+REDISMODULE_API const RedisModuleString * (*RedisModule_GetKeyNameFromModuleKey)(RedisModuleKey *key) REDISMODULE_ATTR;
+REDISMODULE_API long long (*RedisModule_Milliseconds)(void) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_DigestAddStringBuffer)(RedisModuleDigest *md, unsigned char *ele, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_DigestAddLongLong)(RedisModuleDigest *md, long long ele) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_DigestEndSequence)(RedisModuleDigest *md) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleDict * (*RedisModule_CreateDict)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeDict)(RedisModuleCtx *ctx, RedisModuleDict *d) REDISMODULE_ATTR;
+REDISMODULE_API uint64_t (*RedisModule_DictSize)(RedisModuleDict *d) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictSetC)(RedisModuleDict *d, void *key, size_t keylen, void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictReplaceC)(RedisModuleDict *d, void *key, size_t keylen, void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictSet)(RedisModuleDict *d, RedisModuleString *key, void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictReplace)(RedisModuleDict *d, RedisModuleString *key, void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_DictGetC)(RedisModuleDict *d, void *key, size_t keylen, int *nokey) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_DictGet)(RedisModuleDict *d, RedisModuleString *key, int *nokey) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictDelC)(RedisModuleDict *d, void *key, size_t keylen, void *oldval) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictDel)(RedisModuleDict *d, RedisModuleString *key, void *oldval) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleDictIter * (*RedisModule_DictIteratorStartC)(RedisModuleDict *d, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleDictIter * (*RedisModule_DictIteratorStart)(RedisModuleDict *d, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_DictIteratorStop)(RedisModuleDictIter *di) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictIteratorReseekC)(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictIteratorReseek)(RedisModuleDictIter *di, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_DictNextC)(RedisModuleDictIter *di, size_t *keylen, void **dataptr) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_DictPrevC)(RedisModuleDictIter *di, size_t *keylen, void **dataptr) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_DictNext)(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_DictPrev)(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictCompareC)(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DictCompare)(RedisModuleDictIter *di, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_RegisterInfoFunc)(RedisModuleCtx *ctx, RedisModuleInfoFunc cb) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddSection)(RedisModuleInfoCtx *ctx, char *name) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoBeginDictField)(RedisModuleInfoCtx *ctx, char *name) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoEndDictField)(RedisModuleInfoCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddFieldString)(RedisModuleInfoCtx *ctx, char *field, RedisModuleString *value) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddFieldCString)(RedisModuleInfoCtx *ctx, char *field, char *value) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddFieldDouble)(RedisModuleInfoCtx *ctx, char *field, double value) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddFieldLongLong)(RedisModuleInfoCtx *ctx, char *field, long long value) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_InfoAddFieldULongLong)(RedisModuleInfoCtx *ctx, char *field, unsigned long long value) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleServerInfoData * (*RedisModule_GetServerInfo)(RedisModuleCtx *ctx, const char *section) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeServerInfo)(RedisModuleCtx *ctx, RedisModuleServerInfoData *data) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_ServerInfoGetField)(RedisModuleCtx *ctx, RedisModuleServerInfoData *data, const char* field) REDISMODULE_ATTR;
+REDISMODULE_API const char * (*RedisModule_ServerInfoGetFieldC)(RedisModuleServerInfoData *data, const char* field) REDISMODULE_ATTR;
+REDISMODULE_API long long (*RedisModule_ServerInfoGetFieldSigned)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
+REDISMODULE_API unsigned long long (*RedisModule_ServerInfoGetFieldUnsigned)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
+REDISMODULE_API double (*RedisModule_ServerInfoGetFieldDouble)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SubscribeToServerEvent)(RedisModuleCtx *ctx, RedisModuleEvent event, RedisModuleEventCallback callback) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SetLRU)(RedisModuleKey *key, mstime_t lru_idle) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetLRU)(RedisModuleKey *key, mstime_t *lru_idle) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SetLFU)(RedisModuleKey *key, long long lfu_freq) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetLFU)(RedisModuleKey *key, long long *lfu_freq) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_BlockClientOnKeys)(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SignalKeyAsReady)(RedisModuleCtx *ctx, RedisModuleString *key) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_GetBlockedClientReadyKey)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleScanCursor * (*RedisModule_ScanCursorCreate)() REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ScanCursorRestart)(RedisModuleScanCursor *cursor) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ScanCursorDestroy)(RedisModuleScanCursor *cursor) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_Scan)(RedisModuleCtx *ctx, RedisModuleScanCursor *cursor, RedisModuleScanCB fn, void *privdata) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ScanKey)(RedisModuleKey *key, RedisModuleScanCursor *cursor, RedisModuleScanKeyCB fn, void *privdata) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetContextFlagsAll)() REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetKeyspaceNotificationFlagsAll)() REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsSubEventSupported)(RedisModuleEvent event, uint64_t subevent) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetServerVersion)() REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetTypeMethodVersion)() REDISMODULE_ATTR;
+
+/* Experimental APIs */
+#ifdef REDISMODULE_EXPERIMENTAL_API
+#define REDISMODULE_EXPERIMENTAL_API_VERSION 3
+REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_BlockClient)(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_UnblockClient)(RedisModuleBlockedClient *bc, void *privdata) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsBlockedReplyRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_IsBlockedTimeoutRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_GetBlockedClientPrivateData)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_GetBlockedClientHandle)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_AbortBlock)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_BlockedClientMeasureTimeStart)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_BlockedClientMeasureTimeEnd)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCtx * (*RedisModule_GetThreadSafeContext)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCtx * (*RedisModule_GetDetachedThreadSafeContext)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeThreadSafeContext)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ThreadSafeContextLock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ThreadSafeContextTryLock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_ThreadSafeContextUnlock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SubscribeToKeyspaceEvents)(RedisModuleCtx *ctx, int types, RedisModuleNotificationFunc cb) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_NotifyKeyspaceEvent)(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetNotifyKeyspaceEvents)() REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_BlockedClientDisconnected)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_RegisterClusterMessageReceiver)(RedisModuleCtx *ctx, uint8_t type, RedisModuleClusterMessageReceiver callback) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SendClusterMessage)(RedisModuleCtx *ctx, char *target_id, uint8_t type, unsigned char *msg, uint32_t len) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetClusterNodeInfo)(RedisModuleCtx *ctx, const char *id, char *ip, char *master_id, int *port, int *flags) REDISMODULE_ATTR;
+REDISMODULE_API char ** (*RedisModule_GetClusterNodesList)(RedisModuleCtx *ctx, size_t *numnodes) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeClusterNodesList)(char **ids) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleTimerID (*RedisModule_CreateTimer)(RedisModuleCtx *ctx, mstime_t period, RedisModuleTimerProc callback, void *data) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_StopTimer)(RedisModuleCtx *ctx, RedisModuleTimerID id, void **data) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_GetTimerInfo)(RedisModuleCtx *ctx, RedisModuleTimerID id, uint64_t *remaining, void **data) REDISMODULE_ATTR;
+REDISMODULE_API const char * (*RedisModule_GetMyClusterID)(void) REDISMODULE_ATTR;
+REDISMODULE_API size_t (*RedisModule_GetClusterSize)(void) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_GetRandomBytes)(unsigned char *dst, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_GetRandomHexChars)(char *dst, size_t len) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SetDisconnectCallback)(RedisModuleBlockedClient *bc, RedisModuleDisconnectFunc callback) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SetClusterFlags)(RedisModuleCtx *ctx, uint64_t flags) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ExportSharedAPI)(RedisModuleCtx *ctx, const char *apiname, void *func) REDISMODULE_ATTR;
+REDISMODULE_API void * (*RedisModule_GetSharedAPI)(RedisModuleCtx *ctx, const char *apiname) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleCommandFilter * (*RedisModule_RegisterCommandFilter)(RedisModuleCtx *ctx, RedisModuleCommandFilterFunc cb, int flags) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_UnregisterCommandFilter)(RedisModuleCtx *ctx, RedisModuleCommandFilter *filter) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CommandFilterArgsCount)(RedisModuleCommandFilterCtx *fctx) REDISMODULE_ATTR;
+REDISMODULE_API const RedisModuleString * (*RedisModule_CommandFilterArgGet)(RedisModuleCommandFilterCtx *fctx, int pos) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CommandFilterArgInsert)(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CommandFilterArgReplace)(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_CommandFilterArgDelete)(RedisModuleCommandFilterCtx *fctx, int pos) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_Fork)(RedisModuleForkDoneHandler cb, void *user_data) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_SendChildHeartbeat)(double progress) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_ExitFromChild)(int retcode) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_KillForkChild)(int child_pid) REDISMODULE_ATTR;
+REDISMODULE_API float (*RedisModule_GetUsedMemoryRatio)() REDISMODULE_ATTR;
+REDISMODULE_API size_t (*RedisModule_MallocSize)(void* ptr) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleUser * (*RedisModule_CreateModuleUser)(const char *name) REDISMODULE_ATTR;
+REDISMODULE_API void (*RedisModule_FreeModuleUser)(RedisModuleUser *user) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_SetModuleUserACL)(RedisModuleUser *user, const char* acl) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_AuthenticateClientWithACLUser)(RedisModuleCtx *ctx, const char *name, size_t len, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_AuthenticateClientWithUser)(RedisModuleCtx *ctx, RedisModuleUser *user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DeauthenticateAndCloseClient)(RedisModuleCtx *ctx, uint64_t client_id) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString * (*RedisModule_GetClientCertificate)(RedisModuleCtx *ctx, uint64_t id) REDISMODULE_ATTR;
+REDISMODULE_API int *(*RedisModule_GetCommandKeys)(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, int *num_keys) REDISMODULE_ATTR;
+REDISMODULE_API const char *(*RedisModule_GetCurrentCommandName)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_RegisterDefragFunc)(RedisModuleCtx *ctx, RedisModuleDefragFunc func) REDISMODULE_ATTR;
+REDISMODULE_API void *(*RedisModule_DefragAlloc)(RedisModuleDefragCtx *ctx, void *ptr) REDISMODULE_ATTR;
+REDISMODULE_API RedisModuleString *(*RedisModule_DefragRedisModuleString)(RedisModuleDefragCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DefragShouldStop)(RedisModuleDefragCtx *ctx) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DefragCursorSet)(RedisModuleDefragCtx *ctx, unsigned long cursor) REDISMODULE_ATTR;
+REDISMODULE_API int (*RedisModule_DefragCursorGet)(RedisModuleDefragCtx *ctx, unsigned long *cursor) REDISMODULE_ATTR;
+#endif
+
+#define RedisModule_IsAOFClient(id) ((id) == UINT64_MAX)
+
+/* This is included inline inside each Redis module. */
+static int RedisModule_Init(RedisModuleCtx *ctx, const char *name, int ver, int apiver) REDISMODULE_ATTR_UNUSED;
+static int RedisModule_Init(RedisModuleCtx *ctx, const char *name, int ver, int apiver) {
+    void *getapifuncptr = ((void**)ctx)[0];
+    RedisModule_GetApi = (int (*)(const char *, void *)) (unsigned long)getapifuncptr;
+    REDISMODULE_GET_API(Alloc);
+    REDISMODULE_GET_API(Calloc);
+    REDISMODULE_GET_API(Free);
+    REDISMODULE_GET_API(Realloc);
+    REDISMODULE_GET_API(Strdup);
+    REDISMODULE_GET_API(CreateCommand);
+    REDISMODULE_GET_API(SetModuleAttribs);
+    REDISMODULE_GET_API(IsModuleNameBusy);
+    REDISMODULE_GET_API(WrongArity);
+    REDISMODULE_GET_API(ReplyWithLongLong);
+    REDISMODULE_GET_API(ReplyWithError);
+    REDISMODULE_GET_API(ReplyWithSimpleString);
+    REDISMODULE_GET_API(ReplyWithArray);
+    REDISMODULE_GET_API(ReplyWithNullArray);
+    REDISMODULE_GET_API(ReplyWithEmptyArray);
+    REDISMODULE_GET_API(ReplySetArrayLength);
+    REDISMODULE_GET_API(ReplyWithStringBuffer);
+    REDISMODULE_GET_API(ReplyWithCString);
+    REDISMODULE_GET_API(ReplyWithString);
+    REDISMODULE_GET_API(ReplyWithEmptyString);
+    REDISMODULE_GET_API(ReplyWithVerbatimString);
+    REDISMODULE_GET_API(ReplyWithNull);
+    REDISMODULE_GET_API(ReplyWithCallReply);
+    REDISMODULE_GET_API(ReplyWithDouble);
+    REDISMODULE_GET_API(ReplyWithLongDouble);
+    REDISMODULE_GET_API(GetSelectedDb);
+    REDISMODULE_GET_API(SelectDb);
+    REDISMODULE_GET_API(OpenKey);
+    REDISMODULE_GET_API(CloseKey);
+    REDISMODULE_GET_API(KeyType);
+    REDISMODULE_GET_API(ValueLength);
+    REDISMODULE_GET_API(ListPush);
+    REDISMODULE_GET_API(ListPop);
+    REDISMODULE_GET_API(StringToLongLong);
+    REDISMODULE_GET_API(StringToDouble);
+    REDISMODULE_GET_API(StringToLongDouble);
+    REDISMODULE_GET_API(StringToStreamID);
+    REDISMODULE_GET_API(Call);
+    REDISMODULE_GET_API(CallReplyProto);
+    REDISMODULE_GET_API(FreeCallReply);
+    REDISMODULE_GET_API(CallReplyInteger);
+    REDISMODULE_GET_API(CallReplyType);
+    REDISMODULE_GET_API(CallReplyLength);
+    REDISMODULE_GET_API(CallReplyArrayElement);
+    REDISMODULE_GET_API(CallReplyStringPtr);
+    REDISMODULE_GET_API(CreateStringFromCallReply);
+    REDISMODULE_GET_API(CreateString);
+    REDISMODULE_GET_API(CreateStringFromLongLong);
+    REDISMODULE_GET_API(CreateStringFromDouble);
+    REDISMODULE_GET_API(CreateStringFromLongDouble);
+    REDISMODULE_GET_API(CreateStringFromString);
+    REDISMODULE_GET_API(CreateStringFromStreamID);
+    REDISMODULE_GET_API(CreateStringPrintf);
+    REDISMODULE_GET_API(FreeString);
+    REDISMODULE_GET_API(StringPtrLen);
+    REDISMODULE_GET_API(AutoMemory);
+    REDISMODULE_GET_API(Replicate);
+    REDISMODULE_GET_API(ReplicateVerbatim);
+    REDISMODULE_GET_API(DeleteKey);
+    REDISMODULE_GET_API(UnlinkKey);
+    REDISMODULE_GET_API(StringSet);
+    REDISMODULE_GET_API(StringDMA);
+    REDISMODULE_GET_API(StringTruncate);
+    REDISMODULE_GET_API(GetExpire);
+    REDISMODULE_GET_API(SetExpire);
+    REDISMODULE_GET_API(GetAbsExpire);
+    REDISMODULE_GET_API(SetAbsExpire);
+    REDISMODULE_GET_API(ResetDataset);
+    REDISMODULE_GET_API(DbSize);
+    REDISMODULE_GET_API(RandomKey);
+    REDISMODULE_GET_API(ZsetAdd);
+    REDISMODULE_GET_API(ZsetIncrby);
+    REDISMODULE_GET_API(ZsetScore);
+    REDISMODULE_GET_API(ZsetRem);
+    REDISMODULE_GET_API(ZsetRangeStop);
+    REDISMODULE_GET_API(ZsetFirstInScoreRange);
+    REDISMODULE_GET_API(ZsetLastInScoreRange);
+    REDISMODULE_GET_API(ZsetFirstInLexRange);
+    REDISMODULE_GET_API(ZsetLastInLexRange);
+    REDISMODULE_GET_API(ZsetRangeCurrentElement);
+    REDISMODULE_GET_API(ZsetRangeNext);
+    REDISMODULE_GET_API(ZsetRangePrev);
+    REDISMODULE_GET_API(ZsetRangeEndReached);
+    REDISMODULE_GET_API(HashSet);
+    REDISMODULE_GET_API(HashGet);
+    REDISMODULE_GET_API(StreamAdd);
+    REDISMODULE_GET_API(StreamDelete);
+    REDISMODULE_GET_API(StreamIteratorStart);
+    REDISMODULE_GET_API(StreamIteratorStop);
+    REDISMODULE_GET_API(StreamIteratorNextID);
+    REDISMODULE_GET_API(StreamIteratorNextField);
+    REDISMODULE_GET_API(StreamIteratorDelete);
+    REDISMODULE_GET_API(StreamTrimByLength);
+    REDISMODULE_GET_API(StreamTrimByID);
+    REDISMODULE_GET_API(IsKeysPositionRequest);
+    REDISMODULE_GET_API(KeyAtPos);
+    REDISMODULE_GET_API(GetClientId);
+    REDISMODULE_GET_API(GetClientUserNameById);
+    REDISMODULE_GET_API(GetContextFlags);
+    REDISMODULE_GET_API(AvoidReplicaTraffic);
+    REDISMODULE_GET_API(PoolAlloc);
+    REDISMODULE_GET_API(CreateDataType);
+    REDISMODULE_GET_API(ModuleTypeSetValue);
+    REDISMODULE_GET_API(ModuleTypeReplaceValue);
+    REDISMODULE_GET_API(ModuleTypeGetType);
+    REDISMODULE_GET_API(ModuleTypeGetValue);
+    REDISMODULE_GET_API(IsIOError);
+    REDISMODULE_GET_API(SetModuleOptions);
+    REDISMODULE_GET_API(SignalModifiedKey);
+    REDISMODULE_GET_API(SaveUnsigned);
+    REDISMODULE_GET_API(LoadUnsigned);
+    REDISMODULE_GET_API(SaveSigned);
+    REDISMODULE_GET_API(LoadSigned);
+    REDISMODULE_GET_API(SaveString);
+    REDISMODULE_GET_API(SaveStringBuffer);
+    REDISMODULE_GET_API(LoadString);
+    REDISMODULE_GET_API(LoadStringBuffer);
+    REDISMODULE_GET_API(SaveDouble);
+    REDISMODULE_GET_API(LoadDouble);
+    REDISMODULE_GET_API(SaveFloat);
+    REDISMODULE_GET_API(LoadFloat);
+    REDISMODULE_GET_API(SaveLongDouble);
+    REDISMODULE_GET_API(LoadLongDouble);
+    REDISMODULE_GET_API(SaveDataTypeToString);
+    REDISMODULE_GET_API(LoadDataTypeFromString);
+    REDISMODULE_GET_API(EmitAOF);
+    REDISMODULE_GET_API(Log);
+    REDISMODULE_GET_API(LogIOError);
+    REDISMODULE_GET_API(_Assert);
+    REDISMODULE_GET_API(LatencyAddSample);
+    REDISMODULE_GET_API(StringAppendBuffer);
+    REDISMODULE_GET_API(RetainString);
+    REDISMODULE_GET_API(HoldString);
+    REDISMODULE_GET_API(StringCompare);
+    REDISMODULE_GET_API(GetContextFromIO);
+    REDISMODULE_GET_API(GetKeyNameFromIO);
+    REDISMODULE_GET_API(GetKeyNameFromModuleKey);
+    REDISMODULE_GET_API(Milliseconds);
+    REDISMODULE_GET_API(DigestAddStringBuffer);
+    REDISMODULE_GET_API(DigestAddLongLong);
+    REDISMODULE_GET_API(DigestEndSequence);
+    REDISMODULE_GET_API(CreateDict);
+    REDISMODULE_GET_API(FreeDict);
+    REDISMODULE_GET_API(DictSize);
+    REDISMODULE_GET_API(DictSetC);
+    REDISMODULE_GET_API(DictReplaceC);
+    REDISMODULE_GET_API(DictSet);
+    REDISMODULE_GET_API(DictReplace);
+    REDISMODULE_GET_API(DictGetC);
+    REDISMODULE_GET_API(DictGet);
+    REDISMODULE_GET_API(DictDelC);
+    REDISMODULE_GET_API(DictDel);
+    REDISMODULE_GET_API(DictIteratorStartC);
+    REDISMODULE_GET_API(DictIteratorStart);
+    REDISMODULE_GET_API(DictIteratorStop);
+    REDISMODULE_GET_API(DictIteratorReseekC);
+    REDISMODULE_GET_API(DictIteratorReseek);
+    REDISMODULE_GET_API(DictNextC);
+    REDISMODULE_GET_API(DictPrevC);
+    REDISMODULE_GET_API(DictNext);
+    REDISMODULE_GET_API(DictPrev);
+    REDISMODULE_GET_API(DictCompare);
+    REDISMODULE_GET_API(DictCompareC);
+    REDISMODULE_GET_API(RegisterInfoFunc);
+    REDISMODULE_GET_API(InfoAddSection);
+    REDISMODULE_GET_API(InfoBeginDictField);
+    REDISMODULE_GET_API(InfoEndDictField);
+    REDISMODULE_GET_API(InfoAddFieldString);
+    REDISMODULE_GET_API(InfoAddFieldCString);
+    REDISMODULE_GET_API(InfoAddFieldDouble);
+    REDISMODULE_GET_API(InfoAddFieldLongLong);
+    REDISMODULE_GET_API(InfoAddFieldULongLong);
+    REDISMODULE_GET_API(GetServerInfo);
+    REDISMODULE_GET_API(FreeServerInfo);
+    REDISMODULE_GET_API(ServerInfoGetField);
+    REDISMODULE_GET_API(ServerInfoGetFieldC);
+    REDISMODULE_GET_API(ServerInfoGetFieldSigned);
+    REDISMODULE_GET_API(ServerInfoGetFieldUnsigned);
+    REDISMODULE_GET_API(ServerInfoGetFieldDouble);
+    REDISMODULE_GET_API(GetClientInfoById);
+    REDISMODULE_GET_API(PublishMessage);
+    REDISMODULE_GET_API(SubscribeToServerEvent);
+    REDISMODULE_GET_API(SetLRU);
+    REDISMODULE_GET_API(GetLRU);
+    REDISMODULE_GET_API(SetLFU);
+    REDISMODULE_GET_API(GetLFU);
+    REDISMODULE_GET_API(BlockClientOnKeys);
+    REDISMODULE_GET_API(SignalKeyAsReady);
+    REDISMODULE_GET_API(GetBlockedClientReadyKey);
+    REDISMODULE_GET_API(ScanCursorCreate);
+    REDISMODULE_GET_API(ScanCursorRestart);
+    REDISMODULE_GET_API(ScanCursorDestroy);
+    REDISMODULE_GET_API(Scan);
+    REDISMODULE_GET_API(ScanKey);
+    REDISMODULE_GET_API(GetContextFlagsAll);
+    REDISMODULE_GET_API(GetKeyspaceNotificationFlagsAll);
+    REDISMODULE_GET_API(IsSubEventSupported);
+    REDISMODULE_GET_API(GetServerVersion);
+    REDISMODULE_GET_API(GetTypeMethodVersion);
+
+#ifdef REDISMODULE_EXPERIMENTAL_API
+    REDISMODULE_GET_API(GetThreadSafeContext);
+    REDISMODULE_GET_API(GetDetachedThreadSafeContext);
+    REDISMODULE_GET_API(FreeThreadSafeContext);
+    REDISMODULE_GET_API(ThreadSafeContextLock);
+    REDISMODULE_GET_API(ThreadSafeContextTryLock);
+    REDISMODULE_GET_API(ThreadSafeContextUnlock);
+    REDISMODULE_GET_API(BlockClient);
+    REDISMODULE_GET_API(UnblockClient);
+    REDISMODULE_GET_API(IsBlockedReplyRequest);
+    REDISMODULE_GET_API(IsBlockedTimeoutRequest);
+    REDISMODULE_GET_API(GetBlockedClientPrivateData);
+    REDISMODULE_GET_API(GetBlockedClientHandle);
+    REDISMODULE_GET_API(AbortBlock);
+    REDISMODULE_GET_API(BlockedClientMeasureTimeStart);
+    REDISMODULE_GET_API(BlockedClientMeasureTimeEnd);
+    REDISMODULE_GET_API(SetDisconnectCallback);
+    REDISMODULE_GET_API(SubscribeToKeyspaceEvents);
+    REDISMODULE_GET_API(NotifyKeyspaceEvent);
+    REDISMODULE_GET_API(GetNotifyKeyspaceEvents);
+    REDISMODULE_GET_API(BlockedClientDisconnected);
+    REDISMODULE_GET_API(RegisterClusterMessageReceiver);
+    REDISMODULE_GET_API(SendClusterMessage);
+    REDISMODULE_GET_API(GetClusterNodeInfo);
+    REDISMODULE_GET_API(GetClusterNodesList);
+    REDISMODULE_GET_API(FreeClusterNodesList);
+    REDISMODULE_GET_API(CreateTimer);
+    REDISMODULE_GET_API(StopTimer);
+    REDISMODULE_GET_API(GetTimerInfo);
+    REDISMODULE_GET_API(GetMyClusterID);
+    REDISMODULE_GET_API(GetClusterSize);
+    REDISMODULE_GET_API(GetRandomBytes);
+    REDISMODULE_GET_API(GetRandomHexChars);
+    REDISMODULE_GET_API(SetClusterFlags);
+    REDISMODULE_GET_API(ExportSharedAPI);
+    REDISMODULE_GET_API(GetSharedAPI);
+    REDISMODULE_GET_API(RegisterCommandFilter);
+    REDISMODULE_GET_API(UnregisterCommandFilter);
+    REDISMODULE_GET_API(CommandFilterArgsCount);
+    REDISMODULE_GET_API(CommandFilterArgGet);
+    REDISMODULE_GET_API(CommandFilterArgInsert);
+    REDISMODULE_GET_API(CommandFilterArgReplace);
+    REDISMODULE_GET_API(CommandFilterArgDelete);
+    REDISMODULE_GET_API(Fork);
+    REDISMODULE_GET_API(SendChildHeartbeat);
+    REDISMODULE_GET_API(ExitFromChild);
+    REDISMODULE_GET_API(KillForkChild);
+    REDISMODULE_GET_API(GetUsedMemoryRatio);
+    REDISMODULE_GET_API(MallocSize);
+    REDISMODULE_GET_API(CreateModuleUser);
+    REDISMODULE_GET_API(FreeModuleUser);
+    REDISMODULE_GET_API(SetModuleUserACL);
+    REDISMODULE_GET_API(DeauthenticateAndCloseClient);
+    REDISMODULE_GET_API(AuthenticateClientWithACLUser);
+    REDISMODULE_GET_API(AuthenticateClientWithUser);
+    REDISMODULE_GET_API(GetClientCertificate);
+    REDISMODULE_GET_API(GetCommandKeys);
+    REDISMODULE_GET_API(GetCurrentCommandName);
+    REDISMODULE_GET_API(RegisterDefragFunc);
+    REDISMODULE_GET_API(DefragAlloc);
+    REDISMODULE_GET_API(DefragRedisModuleString);
+    REDISMODULE_GET_API(DefragShouldStop);
+    REDISMODULE_GET_API(DefragCursorSet);
+    REDISMODULE_GET_API(DefragCursorGet);
+#endif
+
+    if (RedisModule_IsModuleNameBusy && RedisModule_IsModuleNameBusy(name)) return REDISMODULE_ERR;
+    RedisModule_SetModuleAttribs(ctx,name,ver,apiver);
+    return REDISMODULE_OK;
+}
+
+#define RedisModule_Assert(_e) ((_e)?(void)0 : (RedisModule__Assert(#_e,__FILE__,__LINE__),exit(1)))
+
+#define RMAPI_FUNC_SUPPORTED(func) (func != NULL)
+
+#else
+
+/* Things only defined for the modules core, not exported to modules
+ * including this file. */
+#define RedisModuleString robj
+
+#endif /* REDISMODULE_CORE */
+#endif /* REDISMODULE_H */
diff --git a/redis-stable/src/release.c b/redis-stable/src/release.c
new file mode 100644
index 00000000..e0bd018f
--- /dev/null
+++ b/redis-stable/src/release.c
@@ -0,0 +1,66 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* Every time the Redis Git SHA1 or Dirty status changes only this small
+ * file is recompiled, as we access this information in all the other
+ * files using this functions. */
+
+#include <string.h>
+#include <stdio.h>
+
+#include "release.h"
+#include "version.h"
+#include "crc64.h"
+
+char *redisGitSHA1(void) {
+    return REDIS_GIT_SHA1;
+}
+
+char *redisGitDirty(void) {
+    return REDIS_GIT_DIRTY;
+}
+
+uint64_t redisBuildId(void) {
+    char *buildid = REDIS_VERSION REDIS_BUILD_ID REDIS_GIT_DIRTY REDIS_GIT_SHA1;
+
+    return crc64(0,(unsigned char*)buildid,strlen(buildid));
+}
+
+/* Return a cached value of the build string in order to avoid recomputing
+ * and converting it in hex every time: this string is shown in the INFO
+ * output that should be fast. */
+char *redisBuildIdString(void) {
+    static char buf[32];
+    static int cached = 0;
+    if (!cached) {
+        snprintf(buf,sizeof(buf),"%llx",(unsigned long long) redisBuildId());
+        cached = 1;
+    }
+    return buf;
+}
diff --git a/redis-stable/src/replication.c b/redis-stable/src/replication.c
new file mode 100644
index 00000000..932ce1de
--- /dev/null
+++ b/redis-stable/src/replication.c
@@ -0,0 +1,3790 @@
+/* Asynchronous replication implementation.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "server.h"
+#include "cluster.h"
+#include "bio.h"
+
+#include <sys/time.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <sys/socket.h>
+#include <sys/stat.h>
+
+void replicationDiscardCachedMaster(void);
+void replicationResurrectCachedMaster(connection *conn);
+void replicationSendAck(void);
+void putSlaveOnline(client *slave);
+int cancelReplicationHandshake(int reconnect);
+
+/* We take a global flag to remember if this instance generated an RDB
+ * because of replication, so that we can remove the RDB file in case
+ * the instance is configured to have no persistence. */
+int RDBGeneratedByReplication = 0;
+
+/* --------------------------- Utility functions ---------------------------- */
+
+/* Return the pointer to a string representing the slave ip:listening_port
+ * pair. Mostly useful for logging, since we want to log a slave using its
+ * IP address and its listening port which is more clear for the user, for
+ * example: "Closing connection with replica 10.1.2.3:6380". */
+char *replicationGetSlaveName(client *c) {
+    static char buf[NET_HOST_PORT_STR_LEN];
+    char ip[NET_IP_STR_LEN];
+
+    ip[0] = '\0';
+    buf[0] = '\0';
+    if (c->slave_addr ||
+        connPeerToString(c->conn,ip,sizeof(ip),NULL) != -1)
+    {
+        char *addr = c->slave_addr ? c->slave_addr : ip;
+        if (c->slave_listening_port)
+            anetFormatAddr(buf,sizeof(buf),addr,c->slave_listening_port);
+        else
+            snprintf(buf,sizeof(buf),"%s:<unknown-replica-port>",addr);
+    } else {
+        snprintf(buf,sizeof(buf),"client id #%llu",
+            (unsigned long long) c->id);
+    }
+    return buf;
+}
+
+/* Plain unlink() can block for quite some time in order to actually apply
+ * the file deletion to the filesystem. This call removes the file in a
+ * background thread instead. We actually just do close() in the thread,
+ * by using the fact that if there is another instance of the same file open,
+ * the foreground unlink() will only remove the fs name, and deleting the
+ * file's storage space will only happen once the last reference is lost. */
+int bg_unlink(const char *filename) {
+    int fd = open(filename,O_RDONLY|O_NONBLOCK);
+    if (fd == -1) {
+        /* Can't open the file? Fall back to unlinking in the main thread. */
+        return unlink(filename);
+    } else {
+        /* The following unlink() removes the name but doesn't free the
+         * file contents because a process still has it open. */
+        int retval = unlink(filename);
+        if (retval == -1) {
+            /* If we got an unlink error, we just return it, closing the
+             * new reference we have to the file. */
+            int old_errno = errno;
+            close(fd);  /* This would overwrite our errno. So we saved it. */
+            errno = old_errno;
+            return -1;
+        }
+        bioCreateCloseJob(fd);
+        return 0; /* Success. */
+    }
+}
+
+/* ---------------------------------- MASTER -------------------------------- */
+
+void createReplicationBacklog(void) {
+    serverAssert(server.repl_backlog == NULL);
+    server.repl_backlog = zmalloc(server.repl_backlog_size);
+    server.repl_backlog_histlen = 0;
+    server.repl_backlog_idx = 0;
+
+    /* We don't have any data inside our buffer, but virtually the first
+     * byte we have is the next byte that will be generated for the
+     * replication stream. */
+    server.repl_backlog_off = server.master_repl_offset+1;
+}
+
+/* This function is called when the user modifies the replication backlog
+ * size at runtime. It is up to the function to both update the
+ * server.repl_backlog_size and to resize the buffer and setup it so that
+ * it contains the same data as the previous one (possibly less data, but
+ * the most recent bytes, or the same data and more free space in case the
+ * buffer is enlarged). */
+void resizeReplicationBacklog(long long newsize) {
+    if (newsize < CONFIG_REPL_BACKLOG_MIN_SIZE)
+        newsize = CONFIG_REPL_BACKLOG_MIN_SIZE;
+    if (server.repl_backlog_size == newsize) return;
+
+    server.repl_backlog_size = newsize;
+    if (server.repl_backlog != NULL) {
+        /* What we actually do is to flush the old buffer and realloc a new
+         * empty one. It will refill with new data incrementally.
+         * The reason is that copying a few gigabytes adds latency and even
+         * worse often we need to alloc additional space before freeing the
+         * old buffer. */
+        zfree(server.repl_backlog);
+        server.repl_backlog = zmalloc(server.repl_backlog_size);
+        server.repl_backlog_histlen = 0;
+        server.repl_backlog_idx = 0;
+        /* Next byte we have is... the next since the buffer is empty. */
+        server.repl_backlog_off = server.master_repl_offset+1;
+    }
+}
+
+void freeReplicationBacklog(void) {
+    serverAssert(listLength(server.slaves) == 0);
+    zfree(server.repl_backlog);
+    server.repl_backlog = NULL;
+}
+
+/* Add data to the replication backlog.
+ * This function also increments the global replication offset stored at
+ * server.master_repl_offset, because there is no case where we want to feed
+ * the backlog without incrementing the offset. */
+void feedReplicationBacklog(void *ptr, size_t len) {
+    unsigned char *p = ptr;
+
+    server.master_repl_offset += len;
+
+    /* This is a circular buffer, so write as much data we can at every
+     * iteration and rewind the "idx" index if we reach the limit. */
+    while(len) {
+        size_t thislen = server.repl_backlog_size - server.repl_backlog_idx;
+        if (thislen > len) thislen = len;
+        memcpy(server.repl_backlog+server.repl_backlog_idx,p,thislen);
+        server.repl_backlog_idx += thislen;
+        if (server.repl_backlog_idx == server.repl_backlog_size)
+            server.repl_backlog_idx = 0;
+        len -= thislen;
+        p += thislen;
+        server.repl_backlog_histlen += thislen;
+    }
+    if (server.repl_backlog_histlen > server.repl_backlog_size)
+        server.repl_backlog_histlen = server.repl_backlog_size;
+    /* Set the offset of the first byte we have in the backlog. */
+    server.repl_backlog_off = server.master_repl_offset -
+                              server.repl_backlog_histlen + 1;
+}
+
+/* Wrapper for feedReplicationBacklog() that takes Redis string objects
+ * as input. */
+void feedReplicationBacklogWithObject(robj *o) {
+    char llstr[LONG_STR_SIZE];
+    void *p;
+    size_t len;
+
+    if (o->encoding == OBJ_ENCODING_INT) {
+        len = ll2string(llstr,sizeof(llstr),(long)o->ptr);
+        p = llstr;
+    } else {
+        len = sdslen(o->ptr);
+        p = o->ptr;
+    }
+    feedReplicationBacklog(p,len);
+}
+
+int canFeedReplicaReplBuffer(client *replica) {
+    /* Don't feed replicas that only want the RDB. */
+    if (replica->flags & CLIENT_REPL_RDBONLY) return 0;
+
+    /* Don't feed replicas that are still waiting for BGSAVE to start. */
+    if (replica->replstate == SLAVE_STATE_WAIT_BGSAVE_START) return 0;
+
+    return 1;
+}
+
+/* Propagate write commands to slaves, and populate the replication backlog
+ * as well. This function is used if the instance is a master: we use
+ * the commands received by our clients in order to create the replication
+ * stream. Instead if the instance is a slave and has sub-slaves attached,
+ * we use replicationFeedSlavesFromMasterStream() */
+void replicationFeedSlaves(list *slaves, int dictid, robj **argv, int argc) {
+    listNode *ln;
+    listIter li;
+    int j, len;
+    char llstr[LONG_STR_SIZE];
+
+    /* If the instance is not a top level master, return ASAP: we'll just proxy
+     * the stream of data we receive from our master instead, in order to
+     * propagate *identical* replication stream. In this way this slave can
+     * advertise the same replication ID as the master (since it shares the
+     * master replication history and has the same backlog and offsets). */
+    if (server.masterhost != NULL) return;
+
+    /* If there aren't slaves, and there is no backlog buffer to populate,
+     * we can return ASAP. */
+    if (server.repl_backlog == NULL && listLength(slaves) == 0) return;
+
+    /* We can't have slaves attached and no backlog. */
+    serverAssert(!(listLength(slaves) != 0 && server.repl_backlog == NULL));
+
+    /* Send SELECT command to every slave if needed. */
+    if (server.slaveseldb != dictid) {
+        robj *selectcmd;
+
+        /* For a few DBs we have pre-computed SELECT command. */
+        if (dictid >= 0 && dictid < PROTO_SHARED_SELECT_CMDS) {
+            selectcmd = shared.select[dictid];
+        } else {
+            int dictid_len;
+
+            dictid_len = ll2string(llstr,sizeof(llstr),dictid);
+            selectcmd = createObject(OBJ_STRING,
+                sdscatprintf(sdsempty(),
+                "*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
+                dictid_len, llstr));
+        }
+
+        /* Add the SELECT command into the backlog. */
+        if (server.repl_backlog) feedReplicationBacklogWithObject(selectcmd);
+
+        /* Send it to slaves. */
+        listRewind(slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+
+            if (!canFeedReplicaReplBuffer(slave)) continue;
+            addReply(slave,selectcmd);
+        }
+
+        if (dictid < 0 || dictid >= PROTO_SHARED_SELECT_CMDS)
+            decrRefCount(selectcmd);
+    }
+    server.slaveseldb = dictid;
+
+    /* Write the command to the replication backlog if any. */
+    if (server.repl_backlog) {
+        char aux[LONG_STR_SIZE+3];
+
+        /* Add the multi bulk reply length. */
+        aux[0] = '*';
+        len = ll2string(aux+1,sizeof(aux)-1,argc);
+        aux[len+1] = '\r';
+        aux[len+2] = '\n';
+        feedReplicationBacklog(aux,len+3);
+
+        for (j = 0; j < argc; j++) {
+            long objlen = stringObjectLen(argv[j]);
+
+            /* We need to feed the buffer with the object as a bulk reply
+             * not just as a plain string, so create the $..CRLF payload len
+             * and add the final CRLF */
+            aux[0] = '$';
+            len = ll2string(aux+1,sizeof(aux)-1,objlen);
+            aux[len+1] = '\r';
+            aux[len+2] = '\n';
+            feedReplicationBacklog(aux,len+3);
+            feedReplicationBacklogWithObject(argv[j]);
+            feedReplicationBacklog(aux+len+1,2);
+        }
+    }
+
+    /* Write the command to every slave. */
+    listRewind(slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+
+        if (!canFeedReplicaReplBuffer(slave)) continue;
+
+        /* Feed slaves that are waiting for the initial SYNC (so these commands
+         * are queued in the output buffer until the initial SYNC completes),
+         * or are already in sync with the master. */
+
+        /* Add the multi bulk length. */
+        addReplyArrayLen(slave,argc);
+
+        /* Finally any additional argument that was not stored inside the
+         * static buffer if any (from j to argc). */
+        for (j = 0; j < argc; j++)
+            addReplyBulk(slave,argv[j]);
+    }
+}
+
+/* This is a debugging function that gets called when we detect something
+ * wrong with the replication protocol: the goal is to peek into the
+ * replication backlog and show a few final bytes to make simpler to
+ * guess what kind of bug it could be. */
+void showLatestBacklog(void) {
+    if (server.repl_backlog == NULL) return;
+
+    long long dumplen = 256;
+    if (server.repl_backlog_histlen < dumplen)
+        dumplen = server.repl_backlog_histlen;
+
+    /* Identify the first byte to dump. */
+    long long idx =
+      (server.repl_backlog_idx + (server.repl_backlog_size - dumplen)) %
+       server.repl_backlog_size;
+
+    /* Scan the circular buffer to collect 'dumplen' bytes. */
+    sds dump = sdsempty();
+    while(dumplen) {
+        long long thislen =
+            ((server.repl_backlog_size - idx) < dumplen) ?
+            (server.repl_backlog_size - idx) : dumplen;
+
+        dump = sdscatrepr(dump,server.repl_backlog+idx,thislen);
+        dumplen -= thislen;
+        idx = 0;
+    }
+
+    /* Finally log such bytes: this is vital debugging info to
+     * understand what happened. */
+    serverLog(LL_WARNING,"Latest backlog is: '%s'", dump);
+    sdsfree(dump);
+}
+
+/* This function is used in order to proxy what we receive from our master
+ * to our sub-slaves. */
+#include <ctype.h>
+void replicationFeedSlavesFromMasterStream(list *slaves, char *buf, size_t buflen) {
+    listNode *ln;
+    listIter li;
+
+    /* Debugging: this is handy to see the stream sent from master
+     * to slaves. Disabled with if(0). */
+    if (0) {
+        printf("%zu:",buflen);
+        for (size_t j = 0; j < buflen; j++) {
+            printf("%c", isprint(buf[j]) ? buf[j] : '.');
+        }
+        printf("\n");
+    }
+
+    if (server.repl_backlog) feedReplicationBacklog(buf,buflen);
+    listRewind(slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+
+        if (!canFeedReplicaReplBuffer(slave)) continue;
+        addReplyProto(slave,buf,buflen);
+    }
+}
+
+void replicationFeedMonitors(client *c, list *monitors, int dictid, robj **argv, int argc) {
+    if (!(listLength(server.monitors) && !server.loading)) return;
+    listNode *ln;
+    listIter li;
+    int j;
+    sds cmdrepr = sdsnew("+");
+    robj *cmdobj;
+    struct timeval tv;
+
+    gettimeofday(&tv,NULL);
+    cmdrepr = sdscatprintf(cmdrepr,"%ld.%06ld ",(long)tv.tv_sec,(long)tv.tv_usec);
+    if (c->flags & CLIENT_LUA) {
+        cmdrepr = sdscatprintf(cmdrepr,"[%d lua] ",dictid);
+    } else if (c->flags & CLIENT_UNIX_SOCKET) {
+        cmdrepr = sdscatprintf(cmdrepr,"[%d unix:%s] ",dictid,server.unixsocket);
+    } else {
+        cmdrepr = sdscatprintf(cmdrepr,"[%d %s] ",dictid,getClientPeerId(c));
+    }
+
+    for (j = 0; j < argc; j++) {
+        if (argv[j]->encoding == OBJ_ENCODING_INT) {
+            cmdrepr = sdscatprintf(cmdrepr, "\"%ld\"", (long)argv[j]->ptr);
+        } else {
+            cmdrepr = sdscatrepr(cmdrepr,(char*)argv[j]->ptr,
+                        sdslen(argv[j]->ptr));
+        }
+        if (j != argc-1)
+            cmdrepr = sdscatlen(cmdrepr," ",1);
+    }
+    cmdrepr = sdscatlen(cmdrepr,"\r\n",2);
+    cmdobj = createObject(OBJ_STRING,cmdrepr);
+
+    listRewind(monitors,&li);
+    while((ln = listNext(&li))) {
+        client *monitor = ln->value;
+        addReply(monitor,cmdobj);
+    }
+    decrRefCount(cmdobj);
+}
+
+/* Feed the slave 'c' with the replication backlog starting from the
+ * specified 'offset' up to the end of the backlog. */
+long long addReplyReplicationBacklog(client *c, long long offset) {
+    long long j, skip, len;
+
+    serverLog(LL_DEBUG, "[PSYNC] Replica request offset: %lld", offset);
+
+    if (server.repl_backlog_histlen == 0) {
+        serverLog(LL_DEBUG, "[PSYNC] Backlog history len is zero");
+        return 0;
+    }
+
+    serverLog(LL_DEBUG, "[PSYNC] Backlog size: %lld",
+             server.repl_backlog_size);
+    serverLog(LL_DEBUG, "[PSYNC] First byte: %lld",
+             server.repl_backlog_off);
+    serverLog(LL_DEBUG, "[PSYNC] History len: %lld",
+             server.repl_backlog_histlen);
+    serverLog(LL_DEBUG, "[PSYNC] Current index: %lld",
+             server.repl_backlog_idx);
+
+    /* Compute the amount of bytes we need to discard. */
+    skip = offset - server.repl_backlog_off;
+    serverLog(LL_DEBUG, "[PSYNC] Skipping: %lld", skip);
+
+    /* Point j to the oldest byte, that is actually our
+     * server.repl_backlog_off byte. */
+    j = (server.repl_backlog_idx +
+        (server.repl_backlog_size-server.repl_backlog_histlen)) %
+        server.repl_backlog_size;
+    serverLog(LL_DEBUG, "[PSYNC] Index of first byte: %lld", j);
+
+    /* Discard the amount of data to seek to the specified 'offset'. */
+    j = (j + skip) % server.repl_backlog_size;
+
+    /* Feed slave with data. Since it is a circular buffer we have to
+     * split the reply in two parts if we are cross-boundary. */
+    len = server.repl_backlog_histlen - skip;
+    serverLog(LL_DEBUG, "[PSYNC] Reply total length: %lld", len);
+    while(len) {
+        long long thislen =
+            ((server.repl_backlog_size - j) < len) ?
+            (server.repl_backlog_size - j) : len;
+
+        serverLog(LL_DEBUG, "[PSYNC] addReply() length: %lld", thislen);
+        addReplySds(c,sdsnewlen(server.repl_backlog + j, thislen));
+        len -= thislen;
+        j = 0;
+    }
+    return server.repl_backlog_histlen - skip;
+}
+
+/* Return the offset to provide as reply to the PSYNC command received
+ * from the slave. The returned value is only valid immediately after
+ * the BGSAVE process started and before executing any other command
+ * from clients. */
+long long getPsyncInitialOffset(void) {
+    return server.master_repl_offset;
+}
+
+/* Send a FULLRESYNC reply in the specific case of a full resynchronization,
+ * as a side effect setup the slave for a full sync in different ways:
+ *
+ * 1) Remember, into the slave client structure, the replication offset
+ *    we sent here, so that if new slaves will later attach to the same
+ *    background RDB saving process (by duplicating this client output
+ *    buffer), we can get the right offset from this slave.
+ * 2) Set the replication state of the slave to WAIT_BGSAVE_END so that
+ *    we start accumulating differences from this point.
+ * 3) Force the replication stream to re-emit a SELECT statement so
+ *    the new slave incremental differences will start selecting the
+ *    right database number.
+ *
+ * Normally this function should be called immediately after a successful
+ * BGSAVE for replication was started, or when there is one already in
+ * progress that we attached our slave to. */
+int replicationSetupSlaveForFullResync(client *slave, long long offset) {
+    char buf[128];
+    int buflen;
+
+    slave->psync_initial_offset = offset;
+    slave->replstate = SLAVE_STATE_WAIT_BGSAVE_END;
+    /* We are going to accumulate the incremental changes for this
+     * slave as well. Set slaveseldb to -1 in order to force to re-emit
+     * a SELECT statement in the replication stream. */
+    server.slaveseldb = -1;
+
+    /* Don't send this reply to slaves that approached us with
+     * the old SYNC command. */
+    if (!(slave->flags & CLIENT_PRE_PSYNC)) {
+        buflen = snprintf(buf,sizeof(buf),"+FULLRESYNC %s %lld\r\n",
+                          server.replid,offset);
+        if (connWrite(slave->conn,buf,buflen) != buflen) {
+            freeClientAsync(slave);
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* This function handles the PSYNC command from the point of view of a
+ * master receiving a request for partial resynchronization.
+ *
+ * On success return C_OK, otherwise C_ERR is returned and we proceed
+ * with the usual full resync. */
+int masterTryPartialResynchronization(client *c) {
+    long long psync_offset, psync_len;
+    char *master_replid = c->argv[1]->ptr;
+    char buf[128];
+    int buflen;
+
+    /* Parse the replication offset asked by the slave. Go to full sync
+     * on parse error: this should never happen but we try to handle
+     * it in a robust way compared to aborting. */
+    if (getLongLongFromObjectOrReply(c,c->argv[2],&psync_offset,NULL) !=
+       C_OK) goto need_full_resync;
+
+    /* Is the replication ID of this master the same advertised by the wannabe
+     * slave via PSYNC? If the replication ID changed this master has a
+     * different replication history, and there is no way to continue.
+     *
+     * Note that there are two potentially valid replication IDs: the ID1
+     * and the ID2. The ID2 however is only valid up to a specific offset. */
+    if (strcasecmp(master_replid, server.replid) &&
+        (strcasecmp(master_replid, server.replid2) ||
+         psync_offset > server.second_replid_offset))
+    {
+        /* Replid "?" is used by slaves that want to force a full resync. */
+        if (master_replid[0] != '?') {
+            if (strcasecmp(master_replid, server.replid) &&
+                strcasecmp(master_replid, server.replid2))
+            {
+                serverLog(LL_NOTICE,"Partial resynchronization not accepted: "
+                    "Replication ID mismatch (Replica asked for '%s', my "
+                    "replication IDs are '%s' and '%s')",
+                    master_replid, server.replid, server.replid2);
+            } else {
+                serverLog(LL_NOTICE,"Partial resynchronization not accepted: "
+                    "Requested offset for second ID was %lld, but I can reply "
+                    "up to %lld", psync_offset, server.second_replid_offset);
+            }
+        } else {
+            serverLog(LL_NOTICE,"Full resync requested by replica %s",
+                replicationGetSlaveName(c));
+        }
+        goto need_full_resync;
+    }
+
+    /* We still have the data our slave is asking for? */
+    if (!server.repl_backlog ||
+        psync_offset < server.repl_backlog_off ||
+        psync_offset > (server.repl_backlog_off + server.repl_backlog_histlen))
+    {
+        serverLog(LL_NOTICE,
+            "Unable to partial resync with replica %s for lack of backlog (Replica request was: %lld).", replicationGetSlaveName(c), psync_offset);
+        if (psync_offset > server.master_repl_offset) {
+            serverLog(LL_WARNING,
+                "Warning: replica %s tried to PSYNC with an offset that is greater than the master replication offset.", replicationGetSlaveName(c));
+        }
+        goto need_full_resync;
+    }
+
+    /* If we reached this point, we are able to perform a partial resync:
+     * 1) Set client state to make it a slave.
+     * 2) Inform the client we can continue with +CONTINUE
+     * 3) Send the backlog data (from the offset to the end) to the slave. */
+    c->flags |= CLIENT_SLAVE;
+    c->replstate = SLAVE_STATE_ONLINE;
+    c->repl_ack_time = server.unixtime;
+    c->repl_put_online_on_ack = 0;
+    listAddNodeTail(server.slaves,c);
+    /* We can't use the connection buffers since they are used to accumulate
+     * new commands at this stage. But we are sure the socket send buffer is
+     * empty so this write will never fail actually. */
+    if (c->slave_capa & SLAVE_CAPA_PSYNC2) {
+        buflen = snprintf(buf,sizeof(buf),"+CONTINUE %s\r\n", server.replid);
+    } else {
+        buflen = snprintf(buf,sizeof(buf),"+CONTINUE\r\n");
+    }
+    if (connWrite(c->conn,buf,buflen) != buflen) {
+        freeClientAsync(c);
+        return C_OK;
+    }
+    psync_len = addReplyReplicationBacklog(c,psync_offset);
+    serverLog(LL_NOTICE,
+        "Partial resynchronization request from %s accepted. Sending %lld bytes of backlog starting from offset %lld.",
+            replicationGetSlaveName(c),
+            psync_len, psync_offset);
+    /* Note that we don't need to set the selected DB at server.slaveseldb
+     * to -1 to force the master to emit SELECT, since the slave already
+     * has this state from the previous connection with the master. */
+
+    refreshGoodSlavesCount();
+
+    /* Fire the replica change modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
+                          REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE,
+                          NULL);
+
+    return C_OK; /* The caller can return, no full resync needed. */
+
+need_full_resync:
+    /* We need a full resync for some reason... Note that we can't
+     * reply to PSYNC right now if a full SYNC is needed. The reply
+     * must include the master offset at the time the RDB file we transfer
+     * is generated, so we need to delay the reply to that moment. */
+    return C_ERR;
+}
+
+/* Start a BGSAVE for replication goals, which is, selecting the disk or
+ * socket target depending on the configuration, and making sure that
+ * the script cache is flushed before to start.
+ *
+ * The mincapa argument is the bitwise AND among all the slaves capabilities
+ * of the slaves waiting for this BGSAVE, so represents the slave capabilities
+ * all the slaves support. Can be tested via SLAVE_CAPA_* macros.
+ *
+ * Side effects, other than starting a BGSAVE:
+ *
+ * 1) Handle the slaves in WAIT_START state, by preparing them for a full
+ *    sync if the BGSAVE was successfully started, or sending them an error
+ *    and dropping them from the list of slaves.
+ *
+ * 2) Flush the Lua scripting script cache if the BGSAVE was actually
+ *    started.
+ *
+ * Returns C_OK on success or C_ERR otherwise. */
+int startBgsaveForReplication(int mincapa) {
+    int retval;
+    int socket_target = server.repl_diskless_sync && (mincapa & SLAVE_CAPA_EOF);
+    listIter li;
+    listNode *ln;
+
+    serverLog(LL_NOTICE,"Starting BGSAVE for SYNC with target: %s",
+        socket_target ? "replicas sockets" : "disk");
+
+    rdbSaveInfo rsi, *rsiptr;
+    rsiptr = rdbPopulateSaveInfo(&rsi);
+    /* Only do rdbSave* when rsiptr is not NULL,
+     * otherwise slave will miss repl-stream-db. */
+    if (rsiptr) {
+        if (socket_target)
+            retval = rdbSaveToSlavesSockets(rsiptr);
+        else
+            retval = rdbSaveBackground(server.rdb_filename,rsiptr);
+    } else {
+        serverLog(LL_WARNING,"BGSAVE for replication: replication information not available, can't generate the RDB file right now. Try later.");
+        retval = C_ERR;
+    }
+
+    /* If we succeeded to start a BGSAVE with disk target, let's remember
+     * this fact, so that we can later delete the file if needed. Note
+     * that we don't set the flag to 1 if the feature is disabled, otherwise
+     * it would never be cleared: the file is not deleted. This way if
+     * the user enables it later with CONFIG SET, we are fine. */
+    if (retval == C_OK && !socket_target && server.rdb_del_sync_files)
+        RDBGeneratedByReplication = 1;
+
+    /* If we failed to BGSAVE, remove the slaves waiting for a full
+     * resynchronization from the list of slaves, inform them with
+     * an error about what happened, close the connection ASAP. */
+    if (retval == C_ERR) {
+        serverLog(LL_WARNING,"BGSAVE for replication failed");
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
+                slave->replstate = REPL_STATE_NONE;
+                slave->flags &= ~CLIENT_SLAVE;
+                listDelNode(server.slaves,ln);
+                addReplyError(slave,
+                    "BGSAVE failed, replication can't continue");
+                slave->flags |= CLIENT_CLOSE_AFTER_REPLY;
+            }
+        }
+        return retval;
+    }
+
+    /* If the target is socket, rdbSaveToSlavesSockets() already setup
+     * the slaves for a full resync. Otherwise for disk target do it now.*/
+    if (!socket_target) {
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
+                    replicationSetupSlaveForFullResync(slave,
+                            getPsyncInitialOffset());
+            }
+        }
+    }
+
+    /* Flush the script cache, since we need that slave differences are
+     * accumulated without requiring slaves to match our cached scripts. */
+    if (retval == C_OK) replicationScriptCacheFlush();
+    return retval;
+}
+
+/* SYNC and PSYNC command implementation. */
+void syncCommand(client *c) {
+    /* ignore SYNC if already slave or in monitor mode */
+    if (c->flags & CLIENT_SLAVE) return;
+
+    /* Check if this is a failover request to a replica with the same replid and
+     * become a master if so. */
+    if (c->argc > 3 && !strcasecmp(c->argv[0]->ptr,"psync") && 
+        !strcasecmp(c->argv[3]->ptr,"failover"))
+    {
+        serverLog(LL_WARNING, "Failover request received for replid %s.",
+            (unsigned char *)c->argv[1]->ptr);
+        if (!server.masterhost) {
+            addReplyError(c, "PSYNC FAILOVER can't be sent to a master.");
+            return;
+        }
+
+        if (!strcasecmp(c->argv[1]->ptr,server.replid)) {
+            replicationUnsetMaster();
+            sds client = catClientInfoString(sdsempty(),c);
+            serverLog(LL_NOTICE,
+                "MASTER MODE enabled (failover request from '%s')",client);
+            sdsfree(client);
+        } else {
+            addReplyError(c, "PSYNC FAILOVER replid must match my replid.");
+            return;            
+        }
+    }
+
+    /* Don't let replicas sync with us while we're failing over */
+    if (server.failover_state != NO_FAILOVER) {
+        addReplyError(c,"-NOMASTERLINK Can't SYNC while failing over");
+        return;
+    }
+
+    /* Refuse SYNC requests if we are a slave but the link with our master
+     * is not ok... */
+    if (server.masterhost && server.repl_state != REPL_STATE_CONNECTED) {
+        addReplyError(c,"-NOMASTERLINK Can't SYNC while not connected with my master");
+        return;
+    }
+
+    /* SYNC can't be issued when the server has pending data to send to
+     * the client about already issued commands. We need a fresh reply
+     * buffer registering the differences between the BGSAVE and the current
+     * dataset, so that we can copy to other slaves if needed. */
+    if (clientHasPendingReplies(c)) {
+        addReplyError(c,"SYNC and PSYNC are invalid with pending output");
+        return;
+    }
+
+    serverLog(LL_NOTICE,"Replica %s asks for synchronization",
+        replicationGetSlaveName(c));
+
+    /* Try a partial resynchronization if this is a PSYNC command.
+     * If it fails, we continue with usual full resynchronization, however
+     * when this happens masterTryPartialResynchronization() already
+     * replied with:
+     *
+     * +FULLRESYNC <replid> <offset>
+     *
+     * So the slave knows the new replid and offset to try a PSYNC later
+     * if the connection with the master is lost. */
+    if (!strcasecmp(c->argv[0]->ptr,"psync")) {
+        if (masterTryPartialResynchronization(c) == C_OK) {
+            server.stat_sync_partial_ok++;
+            return; /* No full resync needed, return. */
+        } else {
+            char *master_replid = c->argv[1]->ptr;
+
+            /* Increment stats for failed PSYNCs, but only if the
+             * replid is not "?", as this is used by slaves to force a full
+             * resync on purpose when they are not albe to partially
+             * resync. */
+            if (master_replid[0] != '?') server.stat_sync_partial_err++;
+        }
+    } else {
+        /* If a slave uses SYNC, we are dealing with an old implementation
+         * of the replication protocol (like redis-cli --slave). Flag the client
+         * so that we don't expect to receive REPLCONF ACK feedbacks. */
+        c->flags |= CLIENT_PRE_PSYNC;
+    }
+
+    /* Full resynchronization. */
+    server.stat_sync_full++;
+
+    /* Setup the slave as one waiting for BGSAVE to start. The following code
+     * paths will change the state if we handle the slave differently. */
+    c->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
+    if (server.repl_disable_tcp_nodelay)
+        connDisableTcpNoDelay(c->conn); /* Non critical if it fails. */
+    c->repldbfd = -1;
+    c->flags |= CLIENT_SLAVE;
+    listAddNodeTail(server.slaves,c);
+
+    /* Create the replication backlog if needed. */
+    if (listLength(server.slaves) == 1 && server.repl_backlog == NULL) {
+        /* When we create the backlog from scratch, we always use a new
+         * replication ID and clear the ID2, since there is no valid
+         * past history. */
+        changeReplicationId();
+        clearReplicationId2();
+        createReplicationBacklog();
+        serverLog(LL_NOTICE,"Replication backlog created, my new "
+                            "replication IDs are '%s' and '%s'",
+                            server.replid, server.replid2);
+    }
+
+    /* CASE 1: BGSAVE is in progress, with disk target. */
+    if (server.child_type == CHILD_TYPE_RDB &&
+        server.rdb_child_type == RDB_CHILD_TYPE_DISK)
+    {
+        /* Ok a background save is in progress. Let's check if it is a good
+         * one for replication, i.e. if there is another slave that is
+         * registering differences since the server forked to save. */
+        client *slave;
+        listNode *ln;
+        listIter li;
+
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            slave = ln->value;
+            /* If the client needs a buffer of commands, we can't use
+             * a replica without replication buffer. */
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
+                (!(slave->flags & CLIENT_REPL_RDBONLY) ||
+                 (c->flags & CLIENT_REPL_RDBONLY)))
+                break;
+        }
+        /* To attach this slave, we check that it has at least all the
+         * capabilities of the slave that triggered the current BGSAVE. */
+        if (ln && ((c->slave_capa & slave->slave_capa) == slave->slave_capa)) {
+            /* Perfect, the server is already registering differences for
+             * another slave. Set the right state, and copy the buffer.
+             * We don't copy buffer if clients don't want. */
+            if (!(c->flags & CLIENT_REPL_RDBONLY)) copyClientOutputBuffer(c,slave);
+            replicationSetupSlaveForFullResync(c,slave->psync_initial_offset);
+            serverLog(LL_NOTICE,"Waiting for end of BGSAVE for SYNC");
+        } else {
+            /* No way, we need to wait for the next BGSAVE in order to
+             * register differences. */
+            serverLog(LL_NOTICE,"Can't attach the replica to the current BGSAVE. Waiting for next BGSAVE for SYNC");
+        }
+
+    /* CASE 2: BGSAVE is in progress, with socket target. */
+    } else if (server.child_type == CHILD_TYPE_RDB &&
+               server.rdb_child_type == RDB_CHILD_TYPE_SOCKET)
+    {
+        /* There is an RDB child process but it is writing directly to
+         * children sockets. We need to wait for the next BGSAVE
+         * in order to synchronize. */
+        serverLog(LL_NOTICE,"Current BGSAVE has socket target. Waiting for next BGSAVE for SYNC");
+
+    /* CASE 3: There is no BGSAVE is progress. */
+    } else {
+        if (server.repl_diskless_sync && (c->slave_capa & SLAVE_CAPA_EOF) &&
+            server.repl_diskless_sync_delay)
+        {
+            /* Diskless replication RDB child is created inside
+             * replicationCron() since we want to delay its start a
+             * few seconds to wait for more slaves to arrive. */
+            serverLog(LL_NOTICE,"Delay next BGSAVE for diskless SYNC");
+        } else {
+            /* We don't have a BGSAVE in progress, let's start one. Diskless
+             * or disk-based mode is determined by replica's capacity. */
+            if (!hasActiveChildProcess()) {
+                startBgsaveForReplication(c->slave_capa);
+            } else {
+                serverLog(LL_NOTICE,
+                    "No BGSAVE in progress, but another BG operation is active. "
+                    "BGSAVE for replication delayed");
+            }
+        }
+    }
+    return;
+}
+
+/* REPLCONF <option> <value> <option> <value> ...
+ * This command is used by a replica in order to configure the replication
+ * process before starting it with the SYNC command.
+ * This command is also used by a master in order to get the replication
+ * offset from a replica.
+ *
+ * Currently we support these options:
+ *
+ * - listening-port <port>
+ * - ip-address <ip>
+ * What is the listening ip and port of the Replica redis instance, so that
+ * the master can accurately lists replicas and their listening ports in the
+ * INFO output.
+ *
+ * - capa <eof|psync2>
+ * What is the capabilities of this instance.
+ * eof: supports EOF-style RDB transfer for diskless replication.
+ * psync2: supports PSYNC v2, so understands +CONTINUE <new repl ID>.
+ *
+ * - ack <offset>
+ * Replica informs the master the amount of replication stream that it
+ * processed so far.
+ *
+ * - getack
+ * Unlike other subcommands, this is used by master to get the replication
+ * offset from a replica.
+ *
+ * - rdb-only
+ * Only wants RDB snapshot without replication buffer. */
+void replconfCommand(client *c) {
+    int j;
+
+    if ((c->argc % 2) == 0) {
+        /* Number of arguments must be odd to make sure that every
+         * option has a corresponding value. */
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Process every option-value pair. */
+    for (j = 1; j < c->argc; j+=2) {
+        if (!strcasecmp(c->argv[j]->ptr,"listening-port")) {
+            long port;
+
+            if ((getLongFromObjectOrReply(c,c->argv[j+1],
+                    &port,NULL) != C_OK))
+                return;
+            c->slave_listening_port = port;
+        } else if (!strcasecmp(c->argv[j]->ptr,"ip-address")) {
+            sds addr = c->argv[j+1]->ptr;
+            if (sdslen(addr) < NET_HOST_STR_LEN) {
+                if (c->slave_addr) sdsfree(c->slave_addr);
+                c->slave_addr = sdsdup(addr);
+            } else {
+                addReplyErrorFormat(c,"REPLCONF ip-address provided by "
+                    "replica instance is too long: %zd bytes", sdslen(addr));
+                return;
+            }
+        } else if (!strcasecmp(c->argv[j]->ptr,"capa")) {
+            /* Ignore capabilities not understood by this master. */
+            if (!strcasecmp(c->argv[j+1]->ptr,"eof"))
+                c->slave_capa |= SLAVE_CAPA_EOF;
+            else if (!strcasecmp(c->argv[j+1]->ptr,"psync2"))
+                c->slave_capa |= SLAVE_CAPA_PSYNC2;
+        } else if (!strcasecmp(c->argv[j]->ptr,"ack")) {
+            /* REPLCONF ACK is used by slave to inform the master the amount
+             * of replication stream that it processed so far. It is an
+             * internal only command that normal clients should never use. */
+            long long offset;
+
+            if (!(c->flags & CLIENT_SLAVE)) return;
+            if ((getLongLongFromObject(c->argv[j+1], &offset) != C_OK))
+                return;
+            if (offset > c->repl_ack_off)
+                c->repl_ack_off = offset;
+            c->repl_ack_time = server.unixtime;
+            /* If this was a diskless replication, we need to really put
+             * the slave online when the first ACK is received (which
+             * confirms slave is online and ready to get more data). This
+             * allows for simpler and less CPU intensive EOF detection
+             * when streaming RDB files.
+             * There's a chance the ACK got to us before we detected that the
+             * bgsave is done (since that depends on cron ticks), so run a
+             * quick check first (instead of waiting for the next ACK. */
+            if (server.child_type == CHILD_TYPE_RDB && c->replstate == SLAVE_STATE_WAIT_BGSAVE_END)
+                checkChildrenDone();
+            if (c->repl_put_online_on_ack && c->replstate == SLAVE_STATE_ONLINE)
+                putSlaveOnline(c);
+            /* Note: this command does not reply anything! */
+            return;
+        } else if (!strcasecmp(c->argv[j]->ptr,"getack")) {
+            /* REPLCONF GETACK is used in order to request an ACK ASAP
+             * to the slave. */
+            if (server.masterhost && server.master) replicationSendAck();
+            return;
+        } else if (!strcasecmp(c->argv[j]->ptr,"rdb-only")) {
+           /* REPLCONF RDB-ONLY is used to identify the client only wants
+            * RDB snapshot without replication buffer. */
+            long rdb_only = 0;
+            if (getRangeLongFromObjectOrReply(c,c->argv[j+1],
+                    0,1,&rdb_only,NULL) != C_OK)
+                return;
+            if (rdb_only == 1) c->flags |= CLIENT_REPL_RDBONLY;
+            else c->flags &= ~CLIENT_REPL_RDBONLY;
+        } else {
+            addReplyErrorFormat(c,"Unrecognized REPLCONF option: %s",
+                (char*)c->argv[j]->ptr);
+            return;
+        }
+    }
+    addReply(c,shared.ok);
+}
+
+/* This function puts a replica in the online state, and should be called just
+ * after a replica received the RDB file for the initial synchronization, and
+ * we are finally ready to send the incremental stream of commands.
+ *
+ * It does a few things:
+ * 1) Close the replica's connection async if it doesn't need replication
+ *    commands buffer stream, since it actually isn't a valid replica.
+ * 2) Put the slave in ONLINE state. Note that the function may also be called
+ *    for a replicas that are already in ONLINE state, but having the flag
+ *    repl_put_online_on_ack set to true: we still have to install the write
+ *    handler in that case. This function will take care of that.
+ * 3) Make sure the writable event is re-installed, since calling the SYNC
+ *    command disables it, so that we can accumulate output buffer without
+ *    sending it to the replica.
+ * 4) Update the count of "good replicas". */
+void putSlaveOnline(client *slave) {
+    slave->replstate = SLAVE_STATE_ONLINE;
+    slave->repl_put_online_on_ack = 0;
+    slave->repl_ack_time = server.unixtime; /* Prevent false timeout. */
+
+    if (slave->flags & CLIENT_REPL_RDBONLY) {
+        serverLog(LL_NOTICE,
+            "Close the connection with replica %s as RDB transfer is complete",
+            replicationGetSlaveName(slave));
+        freeClientAsync(slave);
+        return;
+    }
+    if (connSetWriteHandler(slave->conn, sendReplyToClient) == C_ERR) {
+        serverLog(LL_WARNING,"Unable to register writable event for replica bulk transfer: %s", strerror(errno));
+        freeClient(slave);
+        return;
+    }
+    refreshGoodSlavesCount();
+    /* Fire the replica change modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
+                          REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE,
+                          NULL);
+    serverLog(LL_NOTICE,"Synchronization with replica %s succeeded",
+        replicationGetSlaveName(slave));
+}
+
+/* We call this function periodically to remove an RDB file that was
+ * generated because of replication, in an instance that is otherwise
+ * without any persistence. We don't want instances without persistence
+ * to take RDB files around, this violates certain policies in certain
+ * environments. */
+void removeRDBUsedToSyncReplicas(void) {
+    /* If the feature is disabled, return ASAP but also clear the
+     * RDBGeneratedByReplication flag in case it was set. Otherwise if the
+     * feature was enabled, but gets disabled later with CONFIG SET, the
+     * flag may remain set to one: then next time the feature is re-enabled
+     * via CONFIG SET we have have it set even if no RDB was generated
+     * because of replication recently. */
+    if (!server.rdb_del_sync_files) {
+        RDBGeneratedByReplication = 0;
+        return;
+    }
+
+    if (allPersistenceDisabled() && RDBGeneratedByReplication) {
+        client *slave;
+        listNode *ln;
+        listIter li;
+
+        int delrdb = 1;
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            slave = ln->value;
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START ||
+                slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END ||
+                slave->replstate == SLAVE_STATE_SEND_BULK)
+            {
+                delrdb = 0;
+                break; /* No need to check the other replicas. */
+            }
+        }
+        if (delrdb) {
+            struct stat sb;
+            if (lstat(server.rdb_filename,&sb) != -1) {
+                RDBGeneratedByReplication = 0;
+                serverLog(LL_NOTICE,
+                    "Removing the RDB file used to feed replicas "
+                    "in a persistence-less instance");
+                bg_unlink(server.rdb_filename);
+            }
+        }
+    }
+}
+
+void sendBulkToSlave(connection *conn) {
+    client *slave = connGetPrivateData(conn);
+    char buf[PROTO_IOBUF_LEN];
+    ssize_t nwritten, buflen;
+
+    /* Before sending the RDB file, we send the preamble as configured by the
+     * replication process. Currently the preamble is just the bulk count of
+     * the file in the form "$<length>\r\n". */
+    if (slave->replpreamble) {
+        nwritten = connWrite(conn,slave->replpreamble,sdslen(slave->replpreamble));
+        if (nwritten == -1) {
+            serverLog(LL_VERBOSE,
+                "Write error sending RDB preamble to replica: %s",
+                connGetLastError(conn));
+            freeClient(slave);
+            return;
+        }
+        atomicIncr(server.stat_net_output_bytes, nwritten);
+        sdsrange(slave->replpreamble,nwritten,-1);
+        if (sdslen(slave->replpreamble) == 0) {
+            sdsfree(slave->replpreamble);
+            slave->replpreamble = NULL;
+            /* fall through sending data. */
+        } else {
+            return;
+        }
+    }
+
+    /* If the preamble was already transferred, send the RDB bulk data. */
+    lseek(slave->repldbfd,slave->repldboff,SEEK_SET);
+    buflen = read(slave->repldbfd,buf,PROTO_IOBUF_LEN);
+    if (buflen <= 0) {
+        serverLog(LL_WARNING,"Read error sending DB to replica: %s",
+            (buflen == 0) ? "premature EOF" : strerror(errno));
+        freeClient(slave);
+        return;
+    }
+    if ((nwritten = connWrite(conn,buf,buflen)) == -1) {
+        if (connGetState(conn) != CONN_STATE_CONNECTED) {
+            serverLog(LL_WARNING,"Write error sending DB to replica: %s",
+                connGetLastError(conn));
+            freeClient(slave);
+        }
+        return;
+    }
+    slave->repldboff += nwritten;
+    atomicIncr(server.stat_net_output_bytes, nwritten);
+    if (slave->repldboff == slave->repldbsize) {
+        close(slave->repldbfd);
+        slave->repldbfd = -1;
+        connSetWriteHandler(slave->conn,NULL);
+        putSlaveOnline(slave);
+    }
+}
+
+/* Remove one write handler from the list of connections waiting to be writable
+ * during rdb pipe transfer. */
+void rdbPipeWriteHandlerConnRemoved(struct connection *conn) {
+    if (!connHasWriteHandler(conn))
+        return;
+    connSetWriteHandler(conn, NULL);
+    client *slave = connGetPrivateData(conn);
+    slave->repl_last_partial_write = 0;
+    server.rdb_pipe_numconns_writing--;
+    /* if there are no more writes for now for this conn, or write error: */
+    if (server.rdb_pipe_numconns_writing == 0) {
+        if (aeCreateFileEvent(server.el, server.rdb_pipe_read, AE_READABLE, rdbPipeReadHandler,NULL) == AE_ERR) {
+            serverPanic("Unrecoverable error creating server.rdb_pipe_read file event.");
+        }
+    }
+}
+
+/* Called in diskless master during transfer of data from the rdb pipe, when
+ * the replica becomes writable again. */
+void rdbPipeWriteHandler(struct connection *conn) {
+    serverAssert(server.rdb_pipe_bufflen>0);
+    client *slave = connGetPrivateData(conn);
+    int nwritten;
+    if ((nwritten = connWrite(conn, server.rdb_pipe_buff + slave->repldboff,
+                              server.rdb_pipe_bufflen - slave->repldboff)) == -1)
+    {
+        if (connGetState(conn) == CONN_STATE_CONNECTED)
+            return; /* equivalent to EAGAIN */
+        serverLog(LL_WARNING,"Write error sending DB to replica: %s",
+            connGetLastError(conn));
+        freeClient(slave);
+        return;
+    } else {
+        slave->repldboff += nwritten;
+        atomicIncr(server.stat_net_output_bytes, nwritten);
+        if (slave->repldboff < server.rdb_pipe_bufflen) {
+            slave->repl_last_partial_write = server.unixtime;
+            return; /* more data to write.. */
+        }
+    }
+    rdbPipeWriteHandlerConnRemoved(conn);
+}
+
+/* Called in diskless master, when there's data to read from the child's rdb pipe */
+void rdbPipeReadHandler(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask) {
+    UNUSED(mask);
+    UNUSED(clientData);
+    UNUSED(eventLoop);
+    int i;
+    if (!server.rdb_pipe_buff)
+        server.rdb_pipe_buff = zmalloc(PROTO_IOBUF_LEN);
+    serverAssert(server.rdb_pipe_numconns_writing==0);
+
+    while (1) {
+        server.rdb_pipe_bufflen = read(fd, server.rdb_pipe_buff, PROTO_IOBUF_LEN);
+        if (server.rdb_pipe_bufflen < 0) {
+            if (errno == EAGAIN || errno == EWOULDBLOCK)
+                return;
+            serverLog(LL_WARNING,"Diskless rdb transfer, read error sending DB to replicas: %s", strerror(errno));
+            for (i=0; i < server.rdb_pipe_numconns; i++) {
+                connection *conn = server.rdb_pipe_conns[i];
+                if (!conn)
+                    continue;
+                client *slave = connGetPrivateData(conn);
+                freeClient(slave);
+                server.rdb_pipe_conns[i] = NULL;
+            }
+            killRDBChild();
+            return;
+        }
+
+        if (server.rdb_pipe_bufflen == 0) {
+            /* EOF - write end was closed. */
+            int stillUp = 0;
+            aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
+            for (i=0; i < server.rdb_pipe_numconns; i++)
+            {
+                connection *conn = server.rdb_pipe_conns[i];
+                if (!conn)
+                    continue;
+                stillUp++;
+            }
+            serverLog(LL_WARNING,"Diskless rdb transfer, done reading from pipe, %d replicas still up.", stillUp);
+            /* Now that the replicas have finished reading, notify the child that it's safe to exit. 
+             * When the server detectes the child has exited, it can mark the replica as online, and
+             * start streaming the replication buffers. */
+            close(server.rdb_child_exit_pipe);
+            server.rdb_child_exit_pipe = -1;
+            return;
+        }
+
+        int stillAlive = 0;
+        for (i=0; i < server.rdb_pipe_numconns; i++)
+        {
+            int nwritten;
+            connection *conn = server.rdb_pipe_conns[i];
+            if (!conn)
+                continue;
+
+            client *slave = connGetPrivateData(conn);
+            if ((nwritten = connWrite(conn, server.rdb_pipe_buff, server.rdb_pipe_bufflen)) == -1) {
+                if (connGetState(conn) != CONN_STATE_CONNECTED) {
+                    serverLog(LL_WARNING,"Diskless rdb transfer, write error sending DB to replica: %s",
+                        connGetLastError(conn));
+                    freeClient(slave);
+                    server.rdb_pipe_conns[i] = NULL;
+                    continue;
+                }
+                /* An error and still in connected state, is equivalent to EAGAIN */
+                slave->repldboff = 0;
+            } else {
+                /* Note: when use diskless replication, 'repldboff' is the offset
+                 * of 'rdb_pipe_buff' sent rather than the offset of entire RDB. */
+                slave->repldboff = nwritten;
+                atomicIncr(server.stat_net_output_bytes, nwritten);
+            }
+            /* If we were unable to write all the data to one of the replicas,
+             * setup write handler (and disable pipe read handler, below) */
+            if (nwritten != server.rdb_pipe_bufflen) {
+                slave->repl_last_partial_write = server.unixtime;
+                server.rdb_pipe_numconns_writing++;
+                connSetWriteHandler(conn, rdbPipeWriteHandler);
+            }
+            stillAlive++;
+        }
+
+        if (stillAlive == 0) {
+            serverLog(LL_WARNING,"Diskless rdb transfer, last replica dropped, killing fork child.");
+            killRDBChild();
+        }
+        /*  Remove the pipe read handler if at least one write handler was set. */
+        if (server.rdb_pipe_numconns_writing || stillAlive == 0) {
+            aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
+            break;
+        }
+    }
+}
+
+/* This function is called at the end of every background saving,
+ * or when the replication RDB transfer strategy is modified from
+ * disk to socket or the other way around.
+ *
+ * The goal of this function is to handle slaves waiting for a successful
+ * background saving in order to perform non-blocking synchronization, and
+ * to schedule a new BGSAVE if there are slaves that attached while a
+ * BGSAVE was in progress, but it was not a good one for replication (no
+ * other slave was accumulating differences).
+ *
+ * The argument bgsaveerr is C_OK if the background saving succeeded
+ * otherwise C_ERR is passed to the function.
+ * The 'type' argument is the type of the child that terminated
+ * (if it had a disk or socket target). */
+void updateSlavesWaitingBgsave(int bgsaveerr, int type) {
+    listNode *ln;
+    listIter li;
+
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+
+        if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END) {
+            struct redis_stat buf;
+
+            if (bgsaveerr != C_OK) {
+                freeClient(slave);
+                serverLog(LL_WARNING,"SYNC failed. BGSAVE child returned an error");
+                continue;
+            }
+
+            /* If this was an RDB on disk save, we have to prepare to send
+             * the RDB from disk to the slave socket. Otherwise if this was
+             * already an RDB -> Slaves socket transfer, used in the case of
+             * diskless replication, our work is trivial, we can just put
+             * the slave online. */
+            if (type == RDB_CHILD_TYPE_SOCKET) {
+                serverLog(LL_NOTICE,
+                    "Streamed RDB transfer with replica %s succeeded (socket). Waiting for REPLCONF ACK from slave to enable streaming",
+                        replicationGetSlaveName(slave));
+                /* Note: we wait for a REPLCONF ACK message from the replica in
+                 * order to really put it online (install the write handler
+                 * so that the accumulated data can be transferred). However
+                 * we change the replication state ASAP, since our slave
+                 * is technically online now.
+                 *
+                 * So things work like that:
+                 *
+                 * 1. We end trasnferring the RDB file via socket.
+                 * 2. The replica is put ONLINE but the write handler
+                 *    is not installed.
+                 * 3. The replica however goes really online, and pings us
+                 *    back via REPLCONF ACK commands.
+                 * 4. Now we finally install the write handler, and send
+                 *    the buffers accumulated so far to the replica.
+                 *
+                 * But why we do that? Because the replica, when we stream
+                 * the RDB directly via the socket, must detect the RDB
+                 * EOF (end of file), that is a special random string at the
+                 * end of the RDB (for streamed RDBs we don't know the length
+                 * in advance). Detecting such final EOF string is much
+                 * simpler and less CPU intensive if no more data is sent
+                 * after such final EOF. So we don't want to glue the end of
+                 * the RDB trasfer with the start of the other replication
+                 * data. */
+                slave->replstate = SLAVE_STATE_ONLINE;
+                slave->repl_put_online_on_ack = 1;
+                slave->repl_ack_time = server.unixtime; /* Timeout otherwise. */
+            } else {
+                if ((slave->repldbfd = open(server.rdb_filename,O_RDONLY)) == -1 ||
+                    redis_fstat(slave->repldbfd,&buf) == -1) {
+                    freeClient(slave);
+                    serverLog(LL_WARNING,"SYNC failed. Can't open/stat DB after BGSAVE: %s", strerror(errno));
+                    continue;
+                }
+                slave->repldboff = 0;
+                slave->repldbsize = buf.st_size;
+                slave->replstate = SLAVE_STATE_SEND_BULK;
+                slave->replpreamble = sdscatprintf(sdsempty(),"$%lld\r\n",
+                    (unsigned long long) slave->repldbsize);
+
+                connSetWriteHandler(slave->conn,NULL);
+                if (connSetWriteHandler(slave->conn,sendBulkToSlave) == C_ERR) {
+                    freeClient(slave);
+                    continue;
+                }
+            }
+        }
+    }
+}
+
+/* Change the current instance replication ID with a new, random one.
+ * This will prevent successful PSYNCs between this master and other
+ * slaves, so the command should be called when something happens that
+ * alters the current story of the dataset. */
+void changeReplicationId(void) {
+    getRandomHexChars(server.replid,CONFIG_RUN_ID_SIZE);
+    server.replid[CONFIG_RUN_ID_SIZE] = '\0';
+}
+
+/* Clear (invalidate) the secondary replication ID. This happens, for
+ * example, after a full resynchronization, when we start a new replication
+ * history. */
+void clearReplicationId2(void) {
+    memset(server.replid2,'0',sizeof(server.replid));
+    server.replid2[CONFIG_RUN_ID_SIZE] = '\0';
+    server.second_replid_offset = -1;
+}
+
+/* Use the current replication ID / offset as secondary replication
+ * ID, and change the current one in order to start a new history.
+ * This should be used when an instance is switched from slave to master
+ * so that it can serve PSYNC requests performed using the master
+ * replication ID. */
+void shiftReplicationId(void) {
+    memcpy(server.replid2,server.replid,sizeof(server.replid));
+    /* We set the second replid offset to the master offset + 1, since
+     * the slave will ask for the first byte it has not yet received, so
+     * we need to add one to the offset: for example if, as a slave, we are
+     * sure we have the same history as the master for 50 bytes, after we
+     * are turned into a master, we can accept a PSYNC request with offset
+     * 51, since the slave asking has the same history up to the 50th
+     * byte, and is asking for the new bytes starting at offset 51. */
+    server.second_replid_offset = server.master_repl_offset+1;
+    changeReplicationId();
+    serverLog(LL_WARNING,"Setting secondary replication ID to %s, valid up to offset: %lld. New replication ID is %s", server.replid2, server.second_replid_offset, server.replid);
+}
+
+/* ----------------------------------- SLAVE -------------------------------- */
+
+/* Returns 1 if the given replication state is a handshake state,
+ * 0 otherwise. */
+int slaveIsInHandshakeState(void) {
+    return server.repl_state >= REPL_STATE_RECEIVE_PING_REPLY &&
+           server.repl_state <= REPL_STATE_RECEIVE_PSYNC_REPLY;
+}
+
+/* Avoid the master to detect the slave is timing out while loading the
+ * RDB file in initial synchronization. We send a single newline character
+ * that is valid protocol but is guaranteed to either be sent entirely or
+ * not, since the byte is indivisible.
+ *
+ * The function is called in two contexts: while we flush the current
+ * data with emptyDb(), and while we load the new data received as an
+ * RDB file from the master. */
+void replicationSendNewlineToMaster(void) {
+    static time_t newline_sent;
+    if (time(NULL) != newline_sent) {
+        newline_sent = time(NULL);
+        /* Pinging back in this stage is best-effort. */
+        if (server.repl_transfer_s) connWrite(server.repl_transfer_s, "\n", 1);
+    }
+}
+
+/* Callback used by emptyDb() while flushing away old data to load
+ * the new dataset received by the master. */
+void replicationEmptyDbCallback(void *privdata) {
+    UNUSED(privdata);
+    if (server.repl_state == REPL_STATE_TRANSFER)
+        replicationSendNewlineToMaster();
+}
+
+/* Once we have a link with the master and the synchronization was
+ * performed, this function materializes the master client we store
+ * at server.master, starting from the specified file descriptor. */
+void replicationCreateMasterClient(connection *conn, int dbid) {
+    server.master = createClient(conn);
+    if (conn)
+        connSetReadHandler(server.master->conn, readQueryFromClient);
+
+    /**
+     * Important note:
+     * The CLIENT_DENY_BLOCKING flag is not, and should not, be set here.
+     * For commands like BLPOP, it makes no sense to block the master
+     * connection, and such blocking attempt will probably cause deadlock and
+     * break the replication. We consider such a thing as a bug because
+     * commands as BLPOP should never be sent on the replication link.
+     * A possible use-case for blocking the replication link is if a module wants
+     * to pass the execution to a background thread and unblock after the
+     * execution is done. This is the reason why we allow blocking the replication
+     * connection. */
+    server.master->flags |= CLIENT_MASTER;
+
+    server.master->authenticated = 1;
+    server.master->reploff = server.master_initial_offset;
+    server.master->read_reploff = server.master->reploff;
+    server.master->user = NULL; /* This client can do everything. */
+    memcpy(server.master->replid, server.master_replid,
+        sizeof(server.master_replid));
+    /* If master offset is set to -1, this master is old and is not
+     * PSYNC capable, so we flag it accordingly. */
+    if (server.master->reploff == -1)
+        server.master->flags |= CLIENT_PRE_PSYNC;
+    if (dbid != -1) selectDb(server.master,dbid);
+}
+
+/* This function will try to re-enable the AOF file after the
+ * master-replica synchronization: if it fails after multiple attempts
+ * the replica cannot be considered reliable and exists with an
+ * error. */
+void restartAOFAfterSYNC() {
+    unsigned int tries, max_tries = 10;
+    for (tries = 0; tries < max_tries; ++tries) {
+        if (startAppendOnly() == C_OK) break;
+        serverLog(LL_WARNING,
+            "Failed enabling the AOF after successful master synchronization! "
+            "Trying it again in one second.");
+        sleep(1);
+    }
+    if (tries == max_tries) {
+        serverLog(LL_WARNING,
+            "FATAL: this replica instance finished the synchronization with "
+            "its master, but the AOF can't be turned on. Exiting now.");
+        exit(1);
+    }
+}
+
+static int useDisklessLoad() {
+    /* compute boolean decision to use diskless load */
+    int enabled = server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB ||
+           (server.repl_diskless_load == REPL_DISKLESS_LOAD_WHEN_DB_EMPTY && dbTotalServerKeyCount()==0);
+    /* Check all modules handle read errors, otherwise it's not safe to use diskless load. */
+    if (enabled && !moduleAllDatatypesHandleErrors()) {
+        serverLog(LL_WARNING,
+            "Skipping diskless-load because there are modules that don't handle read errors.");
+        enabled = 0;
+    }
+    return enabled;
+}
+
+/* Helper function for readSyncBulkPayload() to make backups of the current
+ * databases before socket-loading the new ones. The backups may be restored
+ * by disklessLoadRestoreBackup or freed by disklessLoadDiscardBackup later. */
+dbBackup *disklessLoadMakeBackup(void) {
+    return backupDb();
+}
+
+/* Helper function for readSyncBulkPayload(): when replica-side diskless
+ * database loading is used, Redis makes a backup of the existing databases
+ * before loading the new ones from the socket.
+ *
+ * If the socket loading went wrong, we want to restore the old backups
+ * into the server databases. */
+void disklessLoadRestoreBackup(dbBackup *buckup) {
+    restoreDbBackup(buckup);
+}
+
+/* Helper function for readSyncBulkPayload() to discard our old backups
+ * when the loading succeeded. */
+void disklessLoadDiscardBackup(dbBackup *buckup, int flag) {
+    discardDbBackup(buckup, flag, replicationEmptyDbCallback);
+}
+
+/* Asynchronously read the SYNC payload we receive from a master */
+#define REPL_MAX_WRITTEN_BEFORE_FSYNC (1024*1024*8) /* 8 MB */
+void readSyncBulkPayload(connection *conn) {
+    char buf[PROTO_IOBUF_LEN];
+    ssize_t nread, readlen, nwritten;
+    int use_diskless_load = useDisklessLoad();
+    dbBackup *diskless_load_backup = NULL;
+    int empty_db_flags = server.repl_slave_lazy_flush ? EMPTYDB_ASYNC :
+                                                        EMPTYDB_NO_FLAGS;
+    off_t left;
+
+    /* Static vars used to hold the EOF mark, and the last bytes received
+     * from the server: when they match, we reached the end of the transfer. */
+    static char eofmark[CONFIG_RUN_ID_SIZE];
+    static char lastbytes[CONFIG_RUN_ID_SIZE];
+    static int usemark = 0;
+
+    /* If repl_transfer_size == -1 we still have to read the bulk length
+     * from the master reply. */
+    if (server.repl_transfer_size == -1) {
+        if (connSyncReadLine(conn,buf,1024,server.repl_syncio_timeout*1000) == -1) {
+            serverLog(LL_WARNING,
+                "I/O error reading bulk count from MASTER: %s",
+                strerror(errno));
+            goto error;
+        }
+
+        if (buf[0] == '-') {
+            serverLog(LL_WARNING,
+                "MASTER aborted replication with an error: %s",
+                buf+1);
+            goto error;
+        } else if (buf[0] == '\0') {
+            /* At this stage just a newline works as a PING in order to take
+             * the connection live. So we refresh our last interaction
+             * timestamp. */
+            server.repl_transfer_lastio = server.unixtime;
+            return;
+        } else if (buf[0] != '$') {
+            serverLog(LL_WARNING,"Bad protocol from MASTER, the first byte is not '$' (we received '%s'), are you sure the host and port are right?", buf);
+            goto error;
+        }
+
+        /* There are two possible forms for the bulk payload. One is the
+         * usual $<count> bulk format. The other is used for diskless transfers
+         * when the master does not know beforehand the size of the file to
+         * transfer. In the latter case, the following format is used:
+         *
+         * $EOF:<40 bytes delimiter>
+         *
+         * At the end of the file the announced delimiter is transmitted. The
+         * delimiter is long and random enough that the probability of a
+         * collision with the actual file content can be ignored. */
+        if (strncmp(buf+1,"EOF:",4) == 0 && strlen(buf+5) >= CONFIG_RUN_ID_SIZE) {
+            usemark = 1;
+            memcpy(eofmark,buf+5,CONFIG_RUN_ID_SIZE);
+            memset(lastbytes,0,CONFIG_RUN_ID_SIZE);
+            /* Set any repl_transfer_size to avoid entering this code path
+             * at the next call. */
+            server.repl_transfer_size = 0;
+            serverLog(LL_NOTICE,
+                "MASTER <-> REPLICA sync: receiving streamed RDB from master with EOF %s",
+                use_diskless_load? "to parser":"to disk");
+        } else {
+            usemark = 0;
+            server.repl_transfer_size = strtol(buf+1,NULL,10);
+            serverLog(LL_NOTICE,
+                "MASTER <-> REPLICA sync: receiving %lld bytes from master %s",
+                (long long) server.repl_transfer_size,
+                use_diskless_load? "to parser":"to disk");
+        }
+        return;
+    }
+
+    if (!use_diskless_load) {
+        /* Read the data from the socket, store it to a file and search
+         * for the EOF. */
+        if (usemark) {
+            readlen = sizeof(buf);
+        } else {
+            left = server.repl_transfer_size - server.repl_transfer_read;
+            readlen = (left < (signed)sizeof(buf)) ? left : (signed)sizeof(buf);
+        }
+
+        nread = connRead(conn,buf,readlen);
+        if (nread <= 0) {
+            if (connGetState(conn) == CONN_STATE_CONNECTED) {
+                /* equivalent to EAGAIN */
+                return;
+            }
+            serverLog(LL_WARNING,"I/O error trying to sync with MASTER: %s",
+                (nread == -1) ? strerror(errno) : "connection lost");
+            cancelReplicationHandshake(1);
+            return;
+        }
+        atomicIncr(server.stat_net_input_bytes, nread);
+
+        /* When a mark is used, we want to detect EOF asap in order to avoid
+         * writing the EOF mark into the file... */
+        int eof_reached = 0;
+
+        if (usemark) {
+            /* Update the last bytes array, and check if it matches our
+             * delimiter. */
+            if (nread >= CONFIG_RUN_ID_SIZE) {
+                memcpy(lastbytes,buf+nread-CONFIG_RUN_ID_SIZE,
+                       CONFIG_RUN_ID_SIZE);
+            } else {
+                int rem = CONFIG_RUN_ID_SIZE-nread;
+                memmove(lastbytes,lastbytes+nread,rem);
+                memcpy(lastbytes+rem,buf,nread);
+            }
+            if (memcmp(lastbytes,eofmark,CONFIG_RUN_ID_SIZE) == 0)
+                eof_reached = 1;
+        }
+
+        /* Update the last I/O time for the replication transfer (used in
+         * order to detect timeouts during replication), and write what we
+         * got from the socket to the dump file on disk. */
+        server.repl_transfer_lastio = server.unixtime;
+        if ((nwritten = write(server.repl_transfer_fd,buf,nread)) != nread) {
+            serverLog(LL_WARNING,
+                "Write error or short write writing to the DB dump file "
+                "needed for MASTER <-> REPLICA synchronization: %s",
+                (nwritten == -1) ? strerror(errno) : "short write");
+            goto error;
+        }
+        server.repl_transfer_read += nread;
+
+        /* Delete the last 40 bytes from the file if we reached EOF. */
+        if (usemark && eof_reached) {
+            if (ftruncate(server.repl_transfer_fd,
+                server.repl_transfer_read - CONFIG_RUN_ID_SIZE) == -1)
+            {
+                serverLog(LL_WARNING,
+                    "Error truncating the RDB file received from the master "
+                    "for SYNC: %s", strerror(errno));
+                goto error;
+            }
+        }
+
+        /* Sync data on disk from time to time, otherwise at the end of the
+         * transfer we may suffer a big delay as the memory buffers are copied
+         * into the actual disk. */
+        if (server.repl_transfer_read >=
+            server.repl_transfer_last_fsync_off + REPL_MAX_WRITTEN_BEFORE_FSYNC)
+        {
+            off_t sync_size = server.repl_transfer_read -
+                              server.repl_transfer_last_fsync_off;
+            rdb_fsync_range(server.repl_transfer_fd,
+                server.repl_transfer_last_fsync_off, sync_size);
+            server.repl_transfer_last_fsync_off += sync_size;
+        }
+
+        /* Check if the transfer is now complete */
+        if (!usemark) {
+            if (server.repl_transfer_read == server.repl_transfer_size)
+                eof_reached = 1;
+        }
+
+        /* If the transfer is yet not complete, we need to read more, so
+         * return ASAP and wait for the handler to be called again. */
+        if (!eof_reached) return;
+    }
+
+    /* We reach this point in one of the following cases:
+     *
+     * 1. The replica is using diskless replication, that is, it reads data
+     *    directly from the socket to the Redis memory, without using
+     *    a temporary RDB file on disk. In that case we just block and
+     *    read everything from the socket.
+     *
+     * 2. Or when we are done reading from the socket to the RDB file, in
+     *    such case we want just to read the RDB file in memory. */
+    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Flushing old data");
+
+    /* We need to stop any AOF rewriting child before flusing and parsing
+     * the RDB, otherwise we'll create a copy-on-write disaster. */
+    if (server.aof_state != AOF_OFF) stopAppendOnly();
+
+    /* When diskless RDB loading is used by replicas, it may be configured
+     * in order to save the current DB instead of throwing it away,
+     * so that we can restore it in case of failed transfer. */
+    if (use_diskless_load &&
+        server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB)
+    {
+        /* Create a backup of server.db[] and initialize to empty
+         * dictionaries. */
+        diskless_load_backup = disklessLoadMakeBackup();
+    }
+    /* We call to emptyDb even in case of REPL_DISKLESS_LOAD_SWAPDB
+     * (Where disklessLoadMakeBackup left server.db empty) because we
+     * want to execute all the auxiliary logic of emptyDb (Namely,
+     * fire module events) */
+    emptyDb(-1,empty_db_flags,replicationEmptyDbCallback);
+
+    /* Before loading the DB into memory we need to delete the readable
+     * handler, otherwise it will get called recursively since
+     * rdbLoad() will call the event loop to process events from time to
+     * time for non blocking loading. */
+    connSetReadHandler(conn, NULL);
+    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Loading DB in memory");
+    rdbSaveInfo rsi = RDB_SAVE_INFO_INIT;
+    if (use_diskless_load) {
+        rio rdb;
+        rioInitWithConn(&rdb,conn,server.repl_transfer_size);
+
+        /* Put the socket in blocking mode to simplify RDB transfer.
+         * We'll restore it when the RDB is received. */
+        connBlock(conn);
+        connRecvTimeout(conn, server.repl_timeout*1000);
+        startLoading(server.repl_transfer_size, RDBFLAGS_REPLICATION);
+
+        if (rdbLoadRio(&rdb,RDBFLAGS_REPLICATION,&rsi) != C_OK) {
+            /* RDB loading failed. */
+            stopLoading(0);
+            serverLog(LL_WARNING,
+                "Failed trying to load the MASTER synchronization DB "
+                "from socket");
+            cancelReplicationHandshake(1);
+            rioFreeConn(&rdb, NULL);
+
+            /* Remove the half-loaded data in case we started with
+             * an empty replica. */
+            emptyDb(-1,empty_db_flags,replicationEmptyDbCallback);
+
+            if (server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB) {
+                /* Restore the backed up databases. */
+                disklessLoadRestoreBackup(diskless_load_backup);
+            }
+
+            /* Note that there's no point in restarting the AOF on SYNC
+             * failure, it'll be restarted when sync succeeds or the replica
+             * gets promoted. */
+            return;
+        }
+
+        /* RDB loading succeeded if we reach this point. */
+        if (server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB) {
+            /* Delete the backup databases we created before starting to load
+             * the new RDB. Now the RDB was loaded with success so the old
+             * data is useless. */
+            disklessLoadDiscardBackup(diskless_load_backup, empty_db_flags);
+        }
+
+        /* Verify the end mark is correct. */
+        if (usemark) {
+            if (!rioRead(&rdb,buf,CONFIG_RUN_ID_SIZE) ||
+                memcmp(buf,eofmark,CONFIG_RUN_ID_SIZE) != 0)
+            {
+                stopLoading(0);
+                serverLog(LL_WARNING,"Replication stream EOF marker is broken");
+                cancelReplicationHandshake(1);
+                rioFreeConn(&rdb, NULL);
+                return;
+            }
+        }
+
+        stopLoading(1);
+
+        /* Cleanup and restore the socket to the original state to continue
+         * with the normal replication. */
+        rioFreeConn(&rdb, NULL);
+        connNonBlock(conn);
+        connRecvTimeout(conn,0);
+    } else {
+        /* Ensure background save doesn't overwrite synced data */
+        if (server.child_type == CHILD_TYPE_RDB) {
+            serverLog(LL_NOTICE,
+                "Replica is about to load the RDB file received from the "
+                "master, but there is a pending RDB child running. "
+                "Killing process %ld and removing its temp file to avoid "
+                "any race",
+                (long) server.child_pid);
+            killRDBChild();
+        }
+
+        /* Make sure the new file (also used for persistence) is fully synced
+         * (not covered by earlier calls to rdb_fsync_range). */
+        if (fsync(server.repl_transfer_fd) == -1) {
+            serverLog(LL_WARNING,
+                "Failed trying to sync the temp DB to disk in "
+                "MASTER <-> REPLICA synchronization: %s",
+                strerror(errno));
+            cancelReplicationHandshake(1);
+            return;
+        }
+
+        /* Rename rdb like renaming rewrite aof asynchronously. */
+        int old_rdb_fd = open(server.rdb_filename,O_RDONLY|O_NONBLOCK);
+        if (rename(server.repl_transfer_tmpfile,server.rdb_filename) == -1) {
+            serverLog(LL_WARNING,
+                "Failed trying to rename the temp DB into %s in "
+                "MASTER <-> REPLICA synchronization: %s",
+                server.rdb_filename, strerror(errno));
+            cancelReplicationHandshake(1);
+            if (old_rdb_fd != -1) close(old_rdb_fd);
+            return;
+        }
+        /* Close old rdb asynchronously. */
+        if (old_rdb_fd != -1) bioCreateCloseJob(old_rdb_fd);
+
+        if (rdbLoad(server.rdb_filename,&rsi,RDBFLAGS_REPLICATION) != C_OK) {
+            serverLog(LL_WARNING,
+                "Failed trying to load the MASTER synchronization "
+                "DB from disk");
+            cancelReplicationHandshake(1);
+            if (server.rdb_del_sync_files && allPersistenceDisabled()) {
+                serverLog(LL_NOTICE,"Removing the RDB file obtained from "
+                                    "the master. This replica has persistence "
+                                    "disabled");
+                bg_unlink(server.rdb_filename);
+            }
+            /* Note that there's no point in restarting the AOF on sync failure,
+               it'll be restarted when sync succeeds or replica promoted. */
+            return;
+        }
+
+        /* Cleanup. */
+        if (server.rdb_del_sync_files && allPersistenceDisabled()) {
+            serverLog(LL_NOTICE,"Removing the RDB file obtained from "
+                                "the master. This replica has persistence "
+                                "disabled");
+            bg_unlink(server.rdb_filename);
+        }
+
+        zfree(server.repl_transfer_tmpfile);
+        close(server.repl_transfer_fd);
+        server.repl_transfer_fd = -1;
+        server.repl_transfer_tmpfile = NULL;
+    }
+
+    /* Final setup of the connected slave <- master link */
+    replicationCreateMasterClient(server.repl_transfer_s,rsi.repl_stream_db);
+    server.repl_state = REPL_STATE_CONNECTED;
+    server.repl_down_since = 0;
+
+    /* Fire the master link modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+                          REDISMODULE_SUBEVENT_MASTER_LINK_UP,
+                          NULL);
+
+    /* After a full resynchronization we use the replication ID and
+     * offset of the master. The secondary ID / offset are cleared since
+     * we are starting a new history. */
+    memcpy(server.replid,server.master->replid,sizeof(server.replid));
+    server.master_repl_offset = server.master->reploff;
+    clearReplicationId2();
+
+    /* Let's create the replication backlog if needed. Slaves need to
+     * accumulate the backlog regardless of the fact they have sub-slaves
+     * or not, in order to behave correctly if they are promoted to
+     * masters after a failover. */
+    if (server.repl_backlog == NULL) createReplicationBacklog();
+    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Finished with success");
+
+    if (server.supervised_mode == SUPERVISED_SYSTEMD) {
+        redisCommunicateSystemd("STATUS=MASTER <-> REPLICA sync: Finished with success. Ready to accept connections in read-write mode.\n");
+    }
+
+    /* Send the initial ACK immediately to put this replica in online state. */
+    if (usemark) replicationSendAck();
+
+    /* Restart the AOF subsystem now that we finished the sync. This
+     * will trigger an AOF rewrite, and when done will start appending
+     * to the new file. */
+    if (server.aof_enabled) restartAOFAfterSYNC();
+    return;
+
+error:
+    cancelReplicationHandshake(1);
+    return;
+}
+
+char *receiveSynchronousResponse(connection *conn) {
+    char buf[256];
+    /* Read the reply from the server. */
+    if (connSyncReadLine(conn,buf,sizeof(buf),server.repl_syncio_timeout*1000) == -1)
+    {
+        return sdscatprintf(sdsempty(),"-Reading from master: %s",
+                strerror(errno));
+    }
+    server.repl_transfer_lastio = server.unixtime;
+    return sdsnew(buf);
+}
+
+/* Send a pre-formatted multi-bulk command to the connection. */
+char* sendCommandRaw(connection *conn, sds cmd) {
+    if (connSyncWrite(conn,cmd,sdslen(cmd),server.repl_syncio_timeout*1000) == -1) {
+        return sdscatprintf(sdsempty(),"-Writing to master: %s",
+                connGetLastError(conn));
+    }
+    return NULL;
+}
+
+/* Compose a multi-bulk command and send it to the connection.
+ * Used to send AUTH and REPLCONF commands to the master before starting the
+ * replication.
+ *
+ * Takes a list of char* arguments, terminated by a NULL argument.
+ *
+ * The command returns an sds string representing the result of the
+ * operation. On error the first byte is a "-".
+ */
+char *sendCommand(connection *conn, ...) {
+    va_list ap;
+    sds cmd = sdsempty();
+    sds cmdargs = sdsempty();
+    size_t argslen = 0;
+    char *arg;
+
+    /* Create the command to send to the master, we use redis binary
+     * protocol to make sure correct arguments are sent. This function
+     * is not safe for all binary data. */
+    va_start(ap,conn);
+    while(1) {
+        arg = va_arg(ap, char*);
+        if (arg == NULL) break;
+        cmdargs = sdscatprintf(cmdargs,"$%zu\r\n%s\r\n",strlen(arg),arg);
+        argslen++;
+    }
+
+    cmd = sdscatprintf(cmd,"*%zu\r\n",argslen);
+    cmd = sdscatsds(cmd,cmdargs);
+    sdsfree(cmdargs);
+
+    va_end(ap);
+    char* err = sendCommandRaw(conn, cmd);
+    sdsfree(cmd);
+    if(err)
+        return err;
+    return NULL;
+}
+
+/* Compose a multi-bulk command and send it to the connection. 
+ * Used to send AUTH and REPLCONF commands to the master before starting the
+ * replication.
+ *
+ * argv_lens is optional, when NULL, strlen is used.
+ *
+ * The command returns an sds string representing the result of the
+ * operation. On error the first byte is a "-".
+ */
+char *sendCommandArgv(connection *conn, int argc, char **argv, size_t *argv_lens) {
+    sds cmd = sdsempty();
+    char *arg;
+    int i;
+
+    /* Create the command to send to the master. */
+    cmd = sdscatfmt(cmd,"*%i\r\n",argc);
+    for (i=0; i<argc; i++) {
+        int len;
+        arg = argv[i];
+        len = argv_lens ? argv_lens[i] : strlen(arg);
+        cmd = sdscatfmt(cmd,"$%i\r\n",len);
+        cmd = sdscatlen(cmd,arg,len);
+        cmd = sdscatlen(cmd,"\r\n",2);
+    }
+    char* err = sendCommandRaw(conn, cmd);
+    sdsfree(cmd);
+    if (err)
+        return err;
+    return NULL;
+}
+
+/* Try a partial resynchronization with the master if we are about to reconnect.
+ * If there is no cached master structure, at least try to issue a
+ * "PSYNC ? -1" command in order to trigger a full resync using the PSYNC
+ * command in order to obtain the master replid and the master replication
+ * global offset.
+ *
+ * This function is designed to be called from syncWithMaster(), so the
+ * following assumptions are made:
+ *
+ * 1) We pass the function an already connected socket "fd".
+ * 2) This function does not close the file descriptor "fd". However in case
+ *    of successful partial resynchronization, the function will reuse
+ *    'fd' as file descriptor of the server.master client structure.
+ *
+ * The function is split in two halves: if read_reply is 0, the function
+ * writes the PSYNC command on the socket, and a new function call is
+ * needed, with read_reply set to 1, in order to read the reply of the
+ * command. This is useful in order to support non blocking operations, so
+ * that we write, return into the event loop, and read when there are data.
+ *
+ * When read_reply is 0 the function returns PSYNC_WRITE_ERR if there
+ * was a write error, or PSYNC_WAIT_REPLY to signal we need another call
+ * with read_reply set to 1. However even when read_reply is set to 1
+ * the function may return PSYNC_WAIT_REPLY again to signal there were
+ * insufficient data to read to complete its work. We should re-enter
+ * into the event loop and wait in such a case.
+ *
+ * The function returns:
+ *
+ * PSYNC_CONTINUE: If the PSYNC command succeeded and we can continue.
+ * PSYNC_FULLRESYNC: If PSYNC is supported but a full resync is needed.
+ *                   In this case the master replid and global replication
+ *                   offset is saved.
+ * PSYNC_NOT_SUPPORTED: If the server does not understand PSYNC at all and
+ *                      the caller should fall back to SYNC.
+ * PSYNC_WRITE_ERROR: There was an error writing the command to the socket.
+ * PSYNC_WAIT_REPLY: Call again the function with read_reply set to 1.
+ * PSYNC_TRY_LATER: Master is currently in a transient error condition.
+ *
+ * Notable side effects:
+ *
+ * 1) As a side effect of the function call the function removes the readable
+ *    event handler from "fd", unless the return value is PSYNC_WAIT_REPLY.
+ * 2) server.master_initial_offset is set to the right value according
+ *    to the master reply. This will be used to populate the 'server.master'
+ *    structure replication offset.
+ */
+
+#define PSYNC_WRITE_ERROR 0
+#define PSYNC_WAIT_REPLY 1
+#define PSYNC_CONTINUE 2
+#define PSYNC_FULLRESYNC 3
+#define PSYNC_NOT_SUPPORTED 4
+#define PSYNC_TRY_LATER 5
+int slaveTryPartialResynchronization(connection *conn, int read_reply) {
+    char *psync_replid;
+    char psync_offset[32];
+    sds reply;
+
+    /* Writing half */
+    if (!read_reply) {
+        /* Initially set master_initial_offset to -1 to mark the current
+         * master replid and offset as not valid. Later if we'll be able to do
+         * a FULL resync using the PSYNC command we'll set the offset at the
+         * right value, so that this information will be propagated to the
+         * client structure representing the master into server.master. */
+        server.master_initial_offset = -1;
+
+        if (server.cached_master) {
+            psync_replid = server.cached_master->replid;
+            snprintf(psync_offset,sizeof(psync_offset),"%lld", server.cached_master->reploff+1);
+            serverLog(LL_NOTICE,"Trying a partial resynchronization (request %s:%s).", psync_replid, psync_offset);
+        } else {
+            serverLog(LL_NOTICE,"Partial resynchronization not possible (no cached master)");
+            psync_replid = "?";
+            memcpy(psync_offset,"-1",3);
+        }
+
+        /* Issue the PSYNC command, if this is a master with a failover in
+         * progress then send the failover argument to the replica to cause it
+         * to become a master */
+        if (server.failover_state == FAILOVER_IN_PROGRESS) {
+            reply = sendCommand(conn,"PSYNC",psync_replid,psync_offset,"FAILOVER",NULL);
+        } else {
+            reply = sendCommand(conn,"PSYNC",psync_replid,psync_offset,NULL);
+        }
+
+        if (reply != NULL) {
+            serverLog(LL_WARNING,"Unable to send PSYNC to master: %s",reply);
+            sdsfree(reply);
+            connSetReadHandler(conn, NULL);
+            return PSYNC_WRITE_ERROR;
+        }
+        return PSYNC_WAIT_REPLY;
+    }
+
+    /* Reading half */
+    reply = receiveSynchronousResponse(conn);
+    if (sdslen(reply) == 0) {
+        /* The master may send empty newlines after it receives PSYNC
+         * and before to reply, just to keep the connection alive. */
+        sdsfree(reply);
+        return PSYNC_WAIT_REPLY;
+    }
+
+    connSetReadHandler(conn, NULL);
+
+    if (!strncmp(reply,"+FULLRESYNC",11)) {
+        char *replid = NULL, *offset = NULL;
+
+        /* FULL RESYNC, parse the reply in order to extract the replid
+         * and the replication offset. */
+        replid = strchr(reply,' ');
+        if (replid) {
+            replid++;
+            offset = strchr(replid,' ');
+            if (offset) offset++;
+        }
+        if (!replid || !offset || (offset-replid-1) != CONFIG_RUN_ID_SIZE) {
+            serverLog(LL_WARNING,
+                "Master replied with wrong +FULLRESYNC syntax.");
+            /* This is an unexpected condition, actually the +FULLRESYNC
+             * reply means that the master supports PSYNC, but the reply
+             * format seems wrong. To stay safe we blank the master
+             * replid to make sure next PSYNCs will fail. */
+            memset(server.master_replid,0,CONFIG_RUN_ID_SIZE+1);
+        } else {
+            memcpy(server.master_replid, replid, offset-replid-1);
+            server.master_replid[CONFIG_RUN_ID_SIZE] = '\0';
+            server.master_initial_offset = strtoll(offset,NULL,10);
+            serverLog(LL_NOTICE,"Full resync from master: %s:%lld",
+                server.master_replid,
+                server.master_initial_offset);
+        }
+        /* We are going to full resync, discard the cached master structure. */
+        replicationDiscardCachedMaster();
+        sdsfree(reply);
+        return PSYNC_FULLRESYNC;
+    }
+
+    if (!strncmp(reply,"+CONTINUE",9)) {
+        /* Partial resync was accepted. */
+        serverLog(LL_NOTICE,
+            "Successful partial resynchronization with master.");
+
+        /* Check the new replication ID advertised by the master. If it
+         * changed, we need to set the new ID as primary ID, and set or
+         * secondary ID as the old master ID up to the current offset, so
+         * that our sub-slaves will be able to PSYNC with us after a
+         * disconnection. */
+        char *start = reply+10;
+        char *end = reply+9;
+        while(end[0] != '\r' && end[0] != '\n' && end[0] != '\0') end++;
+        if (end-start == CONFIG_RUN_ID_SIZE) {
+            char new[CONFIG_RUN_ID_SIZE+1];
+            memcpy(new,start,CONFIG_RUN_ID_SIZE);
+            new[CONFIG_RUN_ID_SIZE] = '\0';
+
+            if (strcmp(new,server.cached_master->replid)) {
+                /* Master ID changed. */
+                serverLog(LL_WARNING,"Master replication ID changed to %s",new);
+
+                /* Set the old ID as our ID2, up to the current offset+1. */
+                memcpy(server.replid2,server.cached_master->replid,
+                    sizeof(server.replid2));
+                server.second_replid_offset = server.master_repl_offset+1;
+
+                /* Update the cached master ID and our own primary ID to the
+                 * new one. */
+                memcpy(server.replid,new,sizeof(server.replid));
+                memcpy(server.cached_master->replid,new,sizeof(server.replid));
+
+                /* Disconnect all the sub-slaves: they need to be notified. */
+                disconnectSlaves();
+            }
+        }
+
+        /* Setup the replication to continue. */
+        sdsfree(reply);
+        replicationResurrectCachedMaster(conn);
+
+        /* If this instance was restarted and we read the metadata to
+         * PSYNC from the persistence file, our replication backlog could
+         * be still not initialized. Create it. */
+        if (server.repl_backlog == NULL) createReplicationBacklog();
+        return PSYNC_CONTINUE;
+    }
+
+    /* If we reach this point we received either an error (since the master does
+     * not understand PSYNC or because it is in a special state and cannot
+     * serve our request), or an unexpected reply from the master.
+     *
+     * Return PSYNC_NOT_SUPPORTED on errors we don't understand, otherwise
+     * return PSYNC_TRY_LATER if we believe this is a transient error. */
+
+    if (!strncmp(reply,"-NOMASTERLINK",13) ||
+        !strncmp(reply,"-LOADING",8))
+    {
+        serverLog(LL_NOTICE,
+            "Master is currently unable to PSYNC "
+            "but should be in the future: %s", reply);
+        sdsfree(reply);
+        return PSYNC_TRY_LATER;
+    }
+
+    if (strncmp(reply,"-ERR",4)) {
+        /* If it's not an error, log the unexpected event. */
+        serverLog(LL_WARNING,
+            "Unexpected reply to PSYNC from master: %s", reply);
+    } else {
+        serverLog(LL_NOTICE,
+            "Master does not support PSYNC or is in "
+            "error state (reply: %s)", reply);
+    }
+    sdsfree(reply);
+    replicationDiscardCachedMaster();
+    return PSYNC_NOT_SUPPORTED;
+}
+
+/* This handler fires when the non blocking connect was able to
+ * establish a connection with the master. */
+void syncWithMaster(connection *conn) {
+    char tmpfile[256], *err = NULL;
+    int dfd = -1, maxtries = 5;
+    int psync_result;
+
+    /* If this event fired after the user turned the instance into a master
+     * with SLAVEOF NO ONE we must just return ASAP. */
+    if (server.repl_state == REPL_STATE_NONE) {
+        connClose(conn);
+        return;
+    }
+
+    /* Check for errors in the socket: after a non blocking connect() we
+     * may find that the socket is in error state. */
+    if (connGetState(conn) != CONN_STATE_CONNECTED) {
+        serverLog(LL_WARNING,"Error condition on socket for SYNC: %s",
+                connGetLastError(conn));
+        goto error;
+    }
+
+    /* Send a PING to check the master is able to reply without errors. */
+    if (server.repl_state == REPL_STATE_CONNECTING) {
+        serverLog(LL_NOTICE,"Non blocking connect for SYNC fired the event.");
+        /* Delete the writable event so that the readable event remains
+         * registered and we can wait for the PONG reply. */
+        connSetReadHandler(conn, syncWithMaster);
+        connSetWriteHandler(conn, NULL);
+        server.repl_state = REPL_STATE_RECEIVE_PING_REPLY;
+        /* Send the PING, don't check for errors at all, we have the timeout
+         * that will take care about this. */
+        err = sendCommand(conn,"PING",NULL);
+        if (err) goto write_error;
+        return;
+    }
+
+    /* Receive the PONG command. */
+    if (server.repl_state == REPL_STATE_RECEIVE_PING_REPLY) {
+        err = receiveSynchronousResponse(conn);
+
+        /* We accept only two replies as valid, a positive +PONG reply
+         * (we just check for "+") or an authentication error.
+         * Note that older versions of Redis replied with "operation not
+         * permitted" instead of using a proper error code, so we test
+         * both. */
+        if (err[0] != '+' &&
+            strncmp(err,"-NOAUTH",7) != 0 &&
+            strncmp(err,"-NOPERM",7) != 0 &&
+            strncmp(err,"-ERR operation not permitted",28) != 0)
+        {
+            serverLog(LL_WARNING,"Error reply to PING from master: '%s'",err);
+            sdsfree(err);
+            goto error;
+        } else {
+            serverLog(LL_NOTICE,
+                "Master replied to PING, replication can continue...");
+        }
+        sdsfree(err);
+        err = NULL;
+        server.repl_state = REPL_STATE_SEND_HANDSHAKE;
+    }
+
+    if (server.repl_state == REPL_STATE_SEND_HANDSHAKE) {
+        /* AUTH with the master if required. */
+        if (server.masterauth) {
+            char *args[3] = {"AUTH",NULL,NULL};
+            size_t lens[3] = {4,0,0};
+            int argc = 1;
+            if (server.masteruser) {
+                args[argc] = server.masteruser;
+                lens[argc] = strlen(server.masteruser);
+                argc++;
+            }
+            args[argc] = server.masterauth;
+            lens[argc] = sdslen(server.masterauth);
+            argc++;
+            err = sendCommandArgv(conn, argc, args, lens);
+            if (err) goto write_error;
+        }
+
+        /* Set the slave port, so that Master's INFO command can list the
+         * slave listening port correctly. */
+        {
+            int port;
+            if (server.slave_announce_port)
+                port = server.slave_announce_port;
+            else if (server.tls_replication && server.tls_port)
+                port = server.tls_port;
+            else
+                port = server.port;
+            sds portstr = sdsfromlonglong(port);
+            err = sendCommand(conn,"REPLCONF",
+                    "listening-port",portstr, NULL);
+            sdsfree(portstr);
+            if (err) goto write_error;
+        }
+
+        /* Set the slave ip, so that Master's INFO command can list the
+         * slave IP address port correctly in case of port forwarding or NAT.
+         * Skip REPLCONF ip-address if there is no slave-announce-ip option set. */
+        if (server.slave_announce_ip) {
+            err = sendCommand(conn,"REPLCONF",
+                    "ip-address",server.slave_announce_ip, NULL);
+            if (err) goto write_error;
+        }
+
+        /* Inform the master of our (slave) capabilities.
+         *
+         * EOF: supports EOF-style RDB transfer for diskless replication.
+         * PSYNC2: supports PSYNC v2, so understands +CONTINUE <new repl ID>.
+         *
+         * The master will ignore capabilities it does not understand. */
+        err = sendCommand(conn,"REPLCONF",
+                "capa","eof","capa","psync2",NULL);
+        if (err) goto write_error;
+
+        server.repl_state = REPL_STATE_RECEIVE_AUTH_REPLY;
+        return;
+    }
+
+    if (server.repl_state == REPL_STATE_RECEIVE_AUTH_REPLY && !server.masterauth)
+        server.repl_state = REPL_STATE_RECEIVE_PORT_REPLY;
+
+    /* Receive AUTH reply. */
+    if (server.repl_state == REPL_STATE_RECEIVE_AUTH_REPLY) {
+        err = receiveSynchronousResponse(conn);
+        if (err[0] == '-') {
+            serverLog(LL_WARNING,"Unable to AUTH to MASTER: %s",err);
+            sdsfree(err);
+            goto error;
+        }
+        sdsfree(err);
+        err = NULL;
+        server.repl_state = REPL_STATE_RECEIVE_PORT_REPLY;
+        return;
+    }
+
+    /* Receive REPLCONF listening-port reply. */
+    if (server.repl_state == REPL_STATE_RECEIVE_PORT_REPLY) {
+        err = receiveSynchronousResponse(conn);
+        /* Ignore the error if any, not all the Redis versions support
+         * REPLCONF listening-port. */
+        if (err[0] == '-') {
+            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
+                                "REPLCONF listening-port: %s", err);
+        }
+        sdsfree(err);
+        server.repl_state = REPL_STATE_RECEIVE_IP_REPLY;
+        return;
+    }
+
+    if (server.repl_state == REPL_STATE_RECEIVE_IP_REPLY && !server.slave_announce_ip)
+        server.repl_state = REPL_STATE_RECEIVE_CAPA_REPLY;
+
+    /* Receive REPLCONF ip-address reply. */
+    if (server.repl_state == REPL_STATE_RECEIVE_IP_REPLY) {
+        err = receiveSynchronousResponse(conn);
+        /* Ignore the error if any, not all the Redis versions support
+         * REPLCONF listening-port. */
+        if (err[0] == '-') {
+            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
+                                "REPLCONF ip-address: %s", err);
+        }
+        sdsfree(err);
+        server.repl_state = REPL_STATE_RECEIVE_CAPA_REPLY;
+        return;
+    }
+
+    /* Receive CAPA reply. */
+    if (server.repl_state == REPL_STATE_RECEIVE_CAPA_REPLY) {
+        err = receiveSynchronousResponse(conn);
+        /* Ignore the error if any, not all the Redis versions support
+         * REPLCONF capa. */
+        if (err[0] == '-') {
+            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
+                                  "REPLCONF capa: %s", err);
+        }
+        sdsfree(err);
+        err = NULL;
+        server.repl_state = REPL_STATE_SEND_PSYNC;
+    }
+
+    /* Try a partial resynchonization. If we don't have a cached master
+     * slaveTryPartialResynchronization() will at least try to use PSYNC
+     * to start a full resynchronization so that we get the master replid
+     * and the global offset, to try a partial resync at the next
+     * reconnection attempt. */
+    if (server.repl_state == REPL_STATE_SEND_PSYNC) {
+        if (slaveTryPartialResynchronization(conn,0) == PSYNC_WRITE_ERROR) {
+            err = sdsnew("Write error sending the PSYNC command.");
+            abortFailover("Write error to failover target");
+            goto write_error;
+        }
+        server.repl_state = REPL_STATE_RECEIVE_PSYNC_REPLY;
+        return;
+    }
+
+    /* If reached this point, we should be in REPL_STATE_RECEIVE_PSYNC. */
+    if (server.repl_state != REPL_STATE_RECEIVE_PSYNC_REPLY) {
+        serverLog(LL_WARNING,"syncWithMaster(): state machine error, "
+                             "state should be RECEIVE_PSYNC but is %d",
+                             server.repl_state);
+        goto error;
+    }
+
+    psync_result = slaveTryPartialResynchronization(conn,1);
+    if (psync_result == PSYNC_WAIT_REPLY) return; /* Try again later... */
+
+    /* Check the status of the planned failover. We expect PSYNC_CONTINUE,
+     * but there is nothing technically wrong with a full resync which
+     * could happen in edge cases. */
+    if (server.failover_state == FAILOVER_IN_PROGRESS) {
+        if (psync_result == PSYNC_CONTINUE || psync_result == PSYNC_FULLRESYNC) {
+            clearFailoverState();
+        } else {
+            abortFailover("Failover target rejected psync request");
+            return;
+        }
+    }
+
+    /* If the master is in an transient error, we should try to PSYNC
+     * from scratch later, so go to the error path. This happens when
+     * the server is loading the dataset or is not connected with its
+     * master and so forth. */
+    if (psync_result == PSYNC_TRY_LATER) goto error;
+
+    /* Note: if PSYNC does not return WAIT_REPLY, it will take care of
+     * uninstalling the read handler from the file descriptor. */
+
+    if (psync_result == PSYNC_CONTINUE) {
+        serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Master accepted a Partial Resynchronization.");
+        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
+            redisCommunicateSystemd("STATUS=MASTER <-> REPLICA sync: Partial Resynchronization accepted. Ready to accept connections in read-write mode.\n");
+        }
+        return;
+    }
+
+    /* PSYNC failed or is not supported: we want our slaves to resync with us
+     * as well, if we have any sub-slaves. The master may transfer us an
+     * entirely different data set and we have no way to incrementally feed
+     * our slaves after that. */
+    disconnectSlaves(); /* Force our slaves to resync with us as well. */
+    freeReplicationBacklog(); /* Don't allow our chained slaves to PSYNC. */
+
+    /* Fall back to SYNC if needed. Otherwise psync_result == PSYNC_FULLRESYNC
+     * and the server.master_replid and master_initial_offset are
+     * already populated. */
+    if (psync_result == PSYNC_NOT_SUPPORTED) {
+        serverLog(LL_NOTICE,"Retrying with SYNC...");
+        if (connSyncWrite(conn,"SYNC\r\n",6,server.repl_syncio_timeout*1000) == -1) {
+            serverLog(LL_WARNING,"I/O error writing to MASTER: %s",
+                strerror(errno));
+            goto error;
+        }
+    }
+
+    /* Prepare a suitable temp file for bulk transfer */
+    if (!useDisklessLoad()) {
+        while(maxtries--) {
+            snprintf(tmpfile,256,
+                "temp-%d.%ld.rdb",(int)server.unixtime,(long int)getpid());
+            dfd = open(tmpfile,O_CREAT|O_WRONLY|O_EXCL,0644);
+            if (dfd != -1) break;
+            sleep(1);
+        }
+        if (dfd == -1) {
+            serverLog(LL_WARNING,"Opening the temp file needed for MASTER <-> REPLICA synchronization: %s",strerror(errno));
+            goto error;
+        }
+        server.repl_transfer_tmpfile = zstrdup(tmpfile);
+        server.repl_transfer_fd = dfd;
+    }
+
+    /* Setup the non blocking download of the bulk file. */
+    if (connSetReadHandler(conn, readSyncBulkPayload)
+            == C_ERR)
+    {
+        char conninfo[CONN_INFO_LEN];
+        serverLog(LL_WARNING,
+            "Can't create readable event for SYNC: %s (%s)",
+            strerror(errno), connGetInfo(conn, conninfo, sizeof(conninfo)));
+        goto error;
+    }
+
+    server.repl_state = REPL_STATE_TRANSFER;
+    server.repl_transfer_size = -1;
+    server.repl_transfer_read = 0;
+    server.repl_transfer_last_fsync_off = 0;
+    server.repl_transfer_lastio = server.unixtime;
+    return;
+
+error:
+    if (dfd != -1) close(dfd);
+    connClose(conn);
+    server.repl_transfer_s = NULL;
+    if (server.repl_transfer_fd != -1)
+        close(server.repl_transfer_fd);
+    if (server.repl_transfer_tmpfile)
+        zfree(server.repl_transfer_tmpfile);
+    server.repl_transfer_tmpfile = NULL;
+    server.repl_transfer_fd = -1;
+    server.repl_state = REPL_STATE_CONNECT;
+    return;
+
+write_error: /* Handle sendCommand() errors. */
+    serverLog(LL_WARNING,"Sending command to master in replication handshake: %s", err);
+    sdsfree(err);
+    goto error;
+}
+
+int connectWithMaster(void) {
+    server.repl_transfer_s = server.tls_replication ? connCreateTLS() : connCreateSocket();
+    if (connConnect(server.repl_transfer_s, server.masterhost, server.masterport,
+                NET_FIRST_BIND_ADDR, syncWithMaster) == C_ERR) {
+        serverLog(LL_WARNING,"Unable to connect to MASTER: %s",
+                connGetLastError(server.repl_transfer_s));
+        connClose(server.repl_transfer_s);
+        server.repl_transfer_s = NULL;
+        return C_ERR;
+    }
+
+
+    server.repl_transfer_lastio = server.unixtime;
+    server.repl_state = REPL_STATE_CONNECTING;
+    serverLog(LL_NOTICE,"MASTER <-> REPLICA sync started");
+    return C_OK;
+}
+
+/* This function can be called when a non blocking connection is currently
+ * in progress to undo it.
+ * Never call this function directly, use cancelReplicationHandshake() instead.
+ */
+void undoConnectWithMaster(void) {
+    connClose(server.repl_transfer_s);
+    server.repl_transfer_s = NULL;
+}
+
+/* Abort the async download of the bulk dataset while SYNC-ing with master.
+ * Never call this function directly, use cancelReplicationHandshake() instead.
+ */
+void replicationAbortSyncTransfer(void) {
+    serverAssert(server.repl_state == REPL_STATE_TRANSFER);
+    undoConnectWithMaster();
+    if (server.repl_transfer_fd!=-1) {
+        close(server.repl_transfer_fd);
+        bg_unlink(server.repl_transfer_tmpfile);
+        zfree(server.repl_transfer_tmpfile);
+        server.repl_transfer_tmpfile = NULL;
+        server.repl_transfer_fd = -1;
+    }
+}
+
+/* This function aborts a non blocking replication attempt if there is one
+ * in progress, by canceling the non-blocking connect attempt or
+ * the initial bulk transfer.
+ *
+ * If there was a replication handshake in progress 1 is returned and
+ * the replication state (server.repl_state) set to REPL_STATE_CONNECT.
+ *
+ * Otherwise zero is returned and no operation is performed at all. */
+int cancelReplicationHandshake(int reconnect) {
+    if (server.repl_state == REPL_STATE_TRANSFER) {
+        replicationAbortSyncTransfer();
+        server.repl_state = REPL_STATE_CONNECT;
+    } else if (server.repl_state == REPL_STATE_CONNECTING ||
+               slaveIsInHandshakeState())
+    {
+        undoConnectWithMaster();
+        server.repl_state = REPL_STATE_CONNECT;
+    } else {
+        return 0;
+    }
+
+    if (!reconnect)
+        return 1;
+
+    /* try to re-connect without waiting for replicationCron, this is needed
+     * for the "diskless loading short read" test. */
+    serverLog(LL_NOTICE,"Reconnecting to MASTER %s:%d after failure",
+        server.masterhost, server.masterport);
+    connectWithMaster();
+
+    return 1;
+}
+
+/* Set replication to the specified master address and port. */
+void replicationSetMaster(char *ip, int port) {
+    int was_master = server.masterhost == NULL;
+
+    sdsfree(server.masterhost);
+    server.masterhost = NULL;
+    if (server.master) {
+        freeClient(server.master);
+    }
+    disconnectAllBlockedClients(); /* Clients blocked in master, now slave. */
+
+    /* Setting masterhost only after the call to freeClient since it calls
+     * replicationHandleMasterDisconnection which can trigger a re-connect
+     * directly from within that call. */
+    server.masterhost = sdsnew(ip);
+    server.masterport = port;
+
+    /* Update oom_score_adj */
+    setOOMScoreAdj(-1);
+
+    /* Force our slaves to resync with us as well. They may hopefully be able
+     * to partially resync with us, but we can notify the replid change. */
+    disconnectSlaves();
+    cancelReplicationHandshake(0);
+    /* Before destroying our master state, create a cached master using
+     * our own parameters, to later PSYNC with the new master. */
+    if (was_master) {
+        replicationDiscardCachedMaster();
+        replicationCacheMasterUsingMyself();
+    }
+
+    /* Fire the role change modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
+                          REDISMODULE_EVENT_REPLROLECHANGED_NOW_REPLICA,
+                          NULL);
+
+    /* Fire the master link modules event. */
+    if (server.repl_state == REPL_STATE_CONNECTED)
+        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
+                              NULL);
+
+    server.repl_state = REPL_STATE_CONNECT;
+    serverLog(LL_NOTICE,"Connecting to MASTER %s:%d",
+        server.masterhost, server.masterport);
+    connectWithMaster();
+}
+
+/* Cancel replication, setting the instance as a master itself. */
+void replicationUnsetMaster(void) {
+    if (server.masterhost == NULL) return; /* Nothing to do. */
+
+    /* Fire the master link modules event. */
+    if (server.repl_state == REPL_STATE_CONNECTED)
+        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
+                              NULL);
+
+    /* Clear masterhost first, since the freeClient calls
+     * replicationHandleMasterDisconnection which can attempt to re-connect. */
+    sdsfree(server.masterhost);
+    server.masterhost = NULL;
+    if (server.master) freeClient(server.master);
+    replicationDiscardCachedMaster();
+    cancelReplicationHandshake(0);
+    /* When a slave is turned into a master, the current replication ID
+     * (that was inherited from the master at synchronization time) is
+     * used as secondary ID up to the current offset, and a new replication
+     * ID is created to continue with a new replication history.
+     *
+     * NOTE: this function MUST be called after we call
+     * freeClient(server.master), since there we adjust the replication
+     * offset trimming the final PINGs. See Github issue #7320. */
+    shiftReplicationId();
+    /* Disconnecting all the slaves is required: we need to inform slaves
+     * of the replication ID change (see shiftReplicationId() call). However
+     * the slaves will be able to partially resync with us, so it will be
+     * a very fast reconnection. */
+    disconnectSlaves();
+    server.repl_state = REPL_STATE_NONE;
+
+    /* We need to make sure the new master will start the replication stream
+     * with a SELECT statement. This is forced after a full resync, but
+     * with PSYNC version 2, there is no need for full resync after a
+     * master switch. */
+    server.slaveseldb = -1;
+
+    /* Update oom_score_adj */
+    setOOMScoreAdj(-1);
+
+    /* Once we turn from slave to master, we consider the starting time without
+     * slaves (that is used to count the replication backlog time to live) as
+     * starting from now. Otherwise the backlog will be freed after a
+     * failover if slaves do not connect immediately. */
+    server.repl_no_slaves_since = server.unixtime;
+    
+    /* Reset down time so it'll be ready for when we turn into replica again. */
+    server.repl_down_since = 0;
+
+    /* Fire the role change modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
+                          REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER,
+                          NULL);
+
+    /* Restart the AOF subsystem in case we shut it down during a sync when
+     * we were still a slave. */
+    if (server.aof_enabled && server.aof_state == AOF_OFF) restartAOFAfterSYNC();
+}
+
+/* This function is called when the slave lose the connection with the
+ * master into an unexpected way. */
+void replicationHandleMasterDisconnection(void) {
+    /* Fire the master link modules event. */
+    if (server.repl_state == REPL_STATE_CONNECTED)
+        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
+                              NULL);
+
+    server.master = NULL;
+    server.repl_state = REPL_STATE_CONNECT;
+    server.repl_down_since = server.unixtime;
+    /* We lost connection with our master, don't disconnect slaves yet,
+     * maybe we'll be able to PSYNC with our master later. We'll disconnect
+     * the slaves only if we'll have to do a full resync with our master. */
+
+    /* Try to re-connect immediately rather than wait for replicationCron
+     * waiting 1 second may risk backlog being recycled. */
+    if (server.masterhost) {
+        serverLog(LL_NOTICE,"Reconnecting to MASTER %s:%d",
+            server.masterhost, server.masterport);
+        connectWithMaster();
+    }
+}
+
+void replicaofCommand(client *c) {
+    /* SLAVEOF is not allowed in cluster mode as replication is automatically
+     * configured using the current address of the master node. */
+    if (server.cluster_enabled) {
+        addReplyError(c,"REPLICAOF not allowed in cluster mode.");
+        return;
+    }
+
+    if (server.failover_state != NO_FAILOVER) {
+        addReplyError(c,"REPLICAOF not allowed while failing over.");
+        return;
+    }
+
+    /* The special host/port combination "NO" "ONE" turns the instance
+     * into a master. Otherwise the new master address is set. */
+    if (!strcasecmp(c->argv[1]->ptr,"no") &&
+        !strcasecmp(c->argv[2]->ptr,"one")) {
+        if (server.masterhost) {
+            replicationUnsetMaster();
+            sds client = catClientInfoString(sdsempty(),c);
+            serverLog(LL_NOTICE,"MASTER MODE enabled (user request from '%s')",
+                client);
+            sdsfree(client);
+        }
+    } else {
+        long port;
+
+        if (c->flags & CLIENT_SLAVE)
+        {
+            /* If a client is already a replica they cannot run this command,
+             * because it involves flushing all replicas (including this
+             * client) */
+            addReplyError(c, "Command is not valid when client is a replica.");
+            return;
+        }
+
+        if ((getLongFromObjectOrReply(c, c->argv[2], &port, NULL) != C_OK))
+            return;
+
+        /* Check if we are already attached to the specified master */
+        if (server.masterhost && !strcasecmp(server.masterhost,c->argv[1]->ptr)
+            && server.masterport == port) {
+            serverLog(LL_NOTICE,"REPLICAOF would result into synchronization "
+                                "with the master we are already connected "
+                                "with. No operation performed.");
+            addReplySds(c,sdsnew("+OK Already connected to specified "
+                                 "master\r\n"));
+            return;
+        }
+        /* There was no previous master or the user specified a different one,
+         * we can continue. */
+        replicationSetMaster(c->argv[1]->ptr, port);
+        sds client = catClientInfoString(sdsempty(),c);
+        serverLog(LL_NOTICE,"REPLICAOF %s:%d enabled (user request from '%s')",
+            server.masterhost, server.masterport, client);
+        sdsfree(client);
+    }
+    addReply(c,shared.ok);
+}
+
+/* ROLE command: provide information about the role of the instance
+ * (master or slave) and additional information related to replication
+ * in an easy to process format. */
+void roleCommand(client *c) {
+    if (server.masterhost == NULL) {
+        listIter li;
+        listNode *ln;
+        void *mbcount;
+        int slaves = 0;
+
+        addReplyArrayLen(c,3);
+        addReplyBulkCBuffer(c,"master",6);
+        addReplyLongLong(c,server.master_repl_offset);
+        mbcount = addReplyDeferredLen(c);
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+            char ip[NET_IP_STR_LEN], *slaveaddr = slave->slave_addr;
+
+            if (!slaveaddr) {
+                if (connPeerToString(slave->conn,ip,sizeof(ip),NULL) == -1)
+                    continue;
+                slaveaddr = ip;
+            }
+            if (slave->replstate != SLAVE_STATE_ONLINE) continue;
+            addReplyArrayLen(c,3);
+            addReplyBulkCString(c,slaveaddr);
+            addReplyBulkLongLong(c,slave->slave_listening_port);
+            addReplyBulkLongLong(c,slave->repl_ack_off);
+            slaves++;
+        }
+        setDeferredArrayLen(c,mbcount,slaves);
+    } else {
+        char *slavestate = NULL;
+
+        addReplyArrayLen(c,5);
+        addReplyBulkCBuffer(c,"slave",5);
+        addReplyBulkCString(c,server.masterhost);
+        addReplyLongLong(c,server.masterport);
+        if (slaveIsInHandshakeState()) {
+            slavestate = "handshake";
+        } else {
+            switch(server.repl_state) {
+            case REPL_STATE_NONE: slavestate = "none"; break;
+            case REPL_STATE_CONNECT: slavestate = "connect"; break;
+            case REPL_STATE_CONNECTING: slavestate = "connecting"; break;
+            case REPL_STATE_TRANSFER: slavestate = "sync"; break;
+            case REPL_STATE_CONNECTED: slavestate = "connected"; break;
+            default: slavestate = "unknown"; break;
+            }
+        }
+        addReplyBulkCString(c,slavestate);
+        addReplyLongLong(c,server.master ? server.master->reploff : -1);
+    }
+}
+
+/* Send a REPLCONF ACK command to the master to inform it about the current
+ * processed offset. If we are not connected with a master, the command has
+ * no effects. */
+void replicationSendAck(void) {
+    client *c = server.master;
+
+    if (c != NULL) {
+        c->flags |= CLIENT_MASTER_FORCE_REPLY;
+        addReplyArrayLen(c,3);
+        addReplyBulkCString(c,"REPLCONF");
+        addReplyBulkCString(c,"ACK");
+        addReplyBulkLongLong(c,c->reploff);
+        c->flags &= ~CLIENT_MASTER_FORCE_REPLY;
+    }
+}
+
+/* ---------------------- MASTER CACHING FOR PSYNC -------------------------- */
+
+/* In order to implement partial synchronization we need to be able to cache
+ * our master's client structure after a transient disconnection.
+ * It is cached into server.cached_master and flushed away using the following
+ * functions. */
+
+/* This function is called by freeClient() in order to cache the master
+ * client structure instead of destroying it. freeClient() will return
+ * ASAP after this function returns, so every action needed to avoid problems
+ * with a client that is really "suspended" has to be done by this function.
+ *
+ * The other functions that will deal with the cached master are:
+ *
+ * replicationDiscardCachedMaster() that will make sure to kill the client
+ * as for some reason we don't want to use it in the future.
+ *
+ * replicationResurrectCachedMaster() that is used after a successful PSYNC
+ * handshake in order to reactivate the cached master.
+ */
+void replicationCacheMaster(client *c) {
+    serverAssert(server.master != NULL && server.cached_master == NULL);
+    serverLog(LL_NOTICE,"Caching the disconnected master state.");
+
+    /* Unlink the client from the server structures. */
+    unlinkClient(c);
+
+    /* Reset the master client so that's ready to accept new commands:
+     * we want to discard te non processed query buffers and non processed
+     * offsets, including pending transactions, already populated arguments,
+     * pending outputs to the master. */
+    sdsclear(server.master->querybuf);
+    sdsclear(server.master->pending_querybuf);
+    server.master->read_reploff = server.master->reploff;
+    if (c->flags & CLIENT_MULTI) discardTransaction(c);
+    listEmpty(c->reply);
+    c->sentlen = 0;
+    c->reply_bytes = 0;
+    c->bufpos = 0;
+    resetClient(c);
+
+    /* Save the master. Server.master will be set to null later by
+     * replicationHandleMasterDisconnection(). */
+    server.cached_master = server.master;
+
+    /* Invalidate the Peer ID cache. */
+    if (c->peerid) {
+        sdsfree(c->peerid);
+        c->peerid = NULL;
+    }
+    /* Invalidate the Sock Name cache. */
+    if (c->sockname) {
+        sdsfree(c->sockname);
+        c->sockname = NULL;
+    }
+
+    /* Caching the master happens instead of the actual freeClient() call,
+     * so make sure to adjust the replication state. This function will
+     * also set server.master to NULL. */
+    replicationHandleMasterDisconnection();
+}
+
+/* This function is called when a master is turend into a slave, in order to
+ * create from scratch a cached master for the new client, that will allow
+ * to PSYNC with the slave that was promoted as the new master after a
+ * failover.
+ *
+ * Assuming this instance was previously the master instance of the new master,
+ * the new master will accept its replication ID, and potentiall also the
+ * current offset if no data was lost during the failover. So we use our
+ * current replication ID and offset in order to synthesize a cached master. */
+void replicationCacheMasterUsingMyself(void) {
+    serverLog(LL_NOTICE,
+        "Before turning into a replica, using my own master parameters "
+        "to synthesize a cached master: I may be able to synchronize with "
+        "the new master with just a partial transfer.");
+
+    /* This will be used to populate the field server.master->reploff
+     * by replicationCreateMasterClient(). We'll later set the created
+     * master as server.cached_master, so the replica will use such
+     * offset for PSYNC. */
+    server.master_initial_offset = server.master_repl_offset;
+
+    /* The master client we create can be set to any DBID, because
+     * the new master will start its replication stream with SELECT. */
+    replicationCreateMasterClient(NULL,-1);
+
+    /* Use our own ID / offset. */
+    memcpy(server.master->replid, server.replid, sizeof(server.replid));
+
+    /* Set as cached master. */
+    unlinkClient(server.master);
+    server.cached_master = server.master;
+    server.master = NULL;
+}
+
+/* Free a cached master, called when there are no longer the conditions for
+ * a partial resync on reconnection. */
+void replicationDiscardCachedMaster(void) {
+    if (server.cached_master == NULL) return;
+
+    serverLog(LL_NOTICE,"Discarding previously cached master state.");
+    server.cached_master->flags &= ~CLIENT_MASTER;
+    freeClient(server.cached_master);
+    server.cached_master = NULL;
+}
+
+/* Turn the cached master into the current master, using the file descriptor
+ * passed as argument as the socket for the new master.
+ *
+ * This function is called when successfully setup a partial resynchronization
+ * so the stream of data that we'll receive will start from were this
+ * master left. */
+void replicationResurrectCachedMaster(connection *conn) {
+    server.master = server.cached_master;
+    server.cached_master = NULL;
+    server.master->conn = conn;
+    connSetPrivateData(server.master->conn, server.master);
+    server.master->flags &= ~(CLIENT_CLOSE_AFTER_REPLY|CLIENT_CLOSE_ASAP);
+    server.master->authenticated = 1;
+    server.master->lastinteraction = server.unixtime;
+    server.repl_state = REPL_STATE_CONNECTED;
+    server.repl_down_since = 0;
+
+    /* Fire the master link modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
+                          REDISMODULE_SUBEVENT_MASTER_LINK_UP,
+                          NULL);
+
+    /* Re-add to the list of clients. */
+    linkClient(server.master);
+    if (connSetReadHandler(server.master->conn, readQueryFromClient)) {
+        serverLog(LL_WARNING,"Error resurrecting the cached master, impossible to add the readable handler: %s", strerror(errno));
+        freeClientAsync(server.master); /* Close ASAP. */
+    }
+
+    /* We may also need to install the write handler as well if there is
+     * pending data in the write buffers. */
+    if (clientHasPendingReplies(server.master)) {
+        if (connSetWriteHandler(server.master->conn, sendReplyToClient)) {
+            serverLog(LL_WARNING,"Error resurrecting the cached master, impossible to add the writable handler: %s", strerror(errno));
+            freeClientAsync(server.master); /* Close ASAP. */
+        }
+    }
+}
+
+/* ------------------------- MIN-SLAVES-TO-WRITE  --------------------------- */
+
+/* This function counts the number of slaves with lag <= min-slaves-max-lag.
+ * If the option is active, the server will prevent writes if there are not
+ * enough connected slaves with the specified lag (or less). */
+void refreshGoodSlavesCount(void) {
+    listIter li;
+    listNode *ln;
+    int good = 0;
+
+    if (!server.repl_min_slaves_to_write ||
+        !server.repl_min_slaves_max_lag) return;
+
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+        time_t lag = server.unixtime - slave->repl_ack_time;
+
+        if (slave->replstate == SLAVE_STATE_ONLINE &&
+            lag <= server.repl_min_slaves_max_lag) good++;
+    }
+    server.repl_good_slaves_count = good;
+}
+
+/* ----------------------- REPLICATION SCRIPT CACHE --------------------------
+ * The goal of this code is to keep track of scripts already sent to every
+ * connected slave, in order to be able to replicate EVALSHA as it is without
+ * translating it to EVAL every time it is possible.
+ *
+ * We use a capped collection implemented by a hash table for fast lookup
+ * of scripts we can send as EVALSHA, plus a linked list that is used for
+ * eviction of the oldest entry when the max number of items is reached.
+ *
+ * We don't care about taking a different cache for every different slave
+ * since to fill the cache again is not very costly, the goal of this code
+ * is to avoid that the same big script is transmitted a big number of times
+ * per second wasting bandwidth and processor speed, but it is not a problem
+ * if we need to rebuild the cache from scratch from time to time, every used
+ * script will need to be transmitted a single time to reappear in the cache.
+ *
+ * This is how the system works:
+ *
+ * 1) Every time a new slave connects, we flush the whole script cache.
+ * 2) We only send as EVALSHA what was sent to the master as EVALSHA, without
+ *    trying to convert EVAL into EVALSHA specifically for slaves.
+ * 3) Every time we transmit a script as EVAL to the slaves, we also add the
+ *    corresponding SHA1 of the script into the cache as we are sure every
+ *    slave knows about the script starting from now.
+ * 4) On SCRIPT FLUSH command, we replicate the command to all the slaves
+ *    and at the same time flush the script cache.
+ * 5) When the last slave disconnects, flush the cache.
+ * 6) We handle SCRIPT LOAD as well since that's how scripts are loaded
+ *    in the master sometimes.
+ */
+
+/* Initialize the script cache, only called at startup. */
+void replicationScriptCacheInit(void) {
+    server.repl_scriptcache_size = 10000;
+    server.repl_scriptcache_dict = dictCreate(&replScriptCacheDictType,NULL);
+    server.repl_scriptcache_fifo = listCreate();
+}
+
+/* Empty the script cache. Should be called every time we are no longer sure
+ * that every slave knows about all the scripts in our set, or when the
+ * current AOF "context" is no longer aware of the script. In general we
+ * should flush the cache:
+ *
+ * 1) Every time a new slave reconnects to this master and performs a
+ *    full SYNC (PSYNC does not require flushing).
+ * 2) Every time an AOF rewrite is performed.
+ * 3) Every time we are left without slaves at all, and AOF is off, in order
+ *    to reclaim otherwise unused memory.
+ */
+void replicationScriptCacheFlush(void) {
+    dictEmpty(server.repl_scriptcache_dict,NULL);
+    listRelease(server.repl_scriptcache_fifo);
+    server.repl_scriptcache_fifo = listCreate();
+}
+
+/* Add an entry into the script cache, if we reach max number of entries the
+ * oldest is removed from the list. */
+void replicationScriptCacheAdd(sds sha1) {
+    int retval;
+    sds key = sdsdup(sha1);
+
+    /* Evict oldest. */
+    if (listLength(server.repl_scriptcache_fifo) == server.repl_scriptcache_size)
+    {
+        listNode *ln = listLast(server.repl_scriptcache_fifo);
+        sds oldest = listNodeValue(ln);
+
+        retval = dictDelete(server.repl_scriptcache_dict,oldest);
+        serverAssert(retval == DICT_OK);
+        listDelNode(server.repl_scriptcache_fifo,ln);
+    }
+
+    /* Add current. */
+    retval = dictAdd(server.repl_scriptcache_dict,key,NULL);
+    listAddNodeHead(server.repl_scriptcache_fifo,key);
+    serverAssert(retval == DICT_OK);
+}
+
+/* Returns non-zero if the specified entry exists inside the cache, that is,
+ * if all the slaves are aware of this script SHA1. */
+int replicationScriptCacheExists(sds sha1) {
+    return dictFind(server.repl_scriptcache_dict,sha1) != NULL;
+}
+
+/* ----------------------- SYNCHRONOUS REPLICATION --------------------------
+ * Redis synchronous replication design can be summarized in points:
+ *
+ * - Redis masters have a global replication offset, used by PSYNC.
+ * - Master increment the offset every time new commands are sent to slaves.
+ * - Slaves ping back masters with the offset processed so far.
+ *
+ * So synchronous replication adds a new WAIT command in the form:
+ *
+ *   WAIT <num_replicas> <milliseconds_timeout>
+ *
+ * That returns the number of replicas that processed the query when
+ * we finally have at least num_replicas, or when the timeout was
+ * reached.
+ *
+ * The command is implemented in this way:
+ *
+ * - Every time a client processes a command, we remember the replication
+ *   offset after sending that command to the slaves.
+ * - When WAIT is called, we ask slaves to send an acknowledgement ASAP.
+ *   The client is blocked at the same time (see blocked.c).
+ * - Once we receive enough ACKs for a given offset or when the timeout
+ *   is reached, the WAIT command is unblocked and the reply sent to the
+ *   client.
+ */
+
+/* This just set a flag so that we broadcast a REPLCONF GETACK command
+ * to all the slaves in the beforeSleep() function. Note that this way
+ * we "group" all the clients that want to wait for synchronous replication
+ * in a given event loop iteration, and send a single GETACK for them all. */
+void replicationRequestAckFromSlaves(void) {
+    server.get_ack_from_slaves = 1;
+}
+
+/* Return the number of slaves that already acknowledged the specified
+ * replication offset. */
+int replicationCountAcksByOffset(long long offset) {
+    listIter li;
+    listNode *ln;
+    int count = 0;
+
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+
+        if (slave->replstate != SLAVE_STATE_ONLINE) continue;
+        if (slave->repl_ack_off >= offset) count++;
+    }
+    return count;
+}
+
+/* WAIT for N replicas to acknowledge the processing of our latest
+ * write command (and all the previous commands). */
+void waitCommand(client *c) {
+    mstime_t timeout;
+    long numreplicas, ackreplicas;
+    long long offset = c->woff;
+
+    if (server.masterhost) {
+        addReplyError(c,"WAIT cannot be used with replica instances. Please also note that since Redis 4.0 if a replica is configured to be writable (which is not the default) writes to replicas are just local and are not propagated.");
+        return;
+    }
+
+    /* Argument parsing. */
+    if (getLongFromObjectOrReply(c,c->argv[1],&numreplicas,NULL) != C_OK)
+        return;
+    if (getTimeoutFromObjectOrReply(c,c->argv[2],&timeout,UNIT_MILLISECONDS)
+        != C_OK) return;
+
+    /* First try without blocking at all. */
+    ackreplicas = replicationCountAcksByOffset(c->woff);
+    if (ackreplicas >= numreplicas || c->flags & CLIENT_MULTI) {
+        addReplyLongLong(c,ackreplicas);
+        return;
+    }
+
+    /* Otherwise block the client and put it into our list of clients
+     * waiting for ack from slaves. */
+    c->bpop.timeout = timeout;
+    c->bpop.reploffset = offset;
+    c->bpop.numreplicas = numreplicas;
+    listAddNodeHead(server.clients_waiting_acks,c);
+    blockClient(c,BLOCKED_WAIT);
+
+    /* Make sure that the server will send an ACK request to all the slaves
+     * before returning to the event loop. */
+    replicationRequestAckFromSlaves();
+}
+
+/* This is called by unblockClient() to perform the blocking op type
+ * specific cleanup. We just remove the client from the list of clients
+ * waiting for replica acks. Never call it directly, call unblockClient()
+ * instead. */
+void unblockClientWaitingReplicas(client *c) {
+    listNode *ln = listSearchKey(server.clients_waiting_acks,c);
+    serverAssert(ln != NULL);
+    listDelNode(server.clients_waiting_acks,ln);
+}
+
+/* Check if there are clients blocked in WAIT that can be unblocked since
+ * we received enough ACKs from slaves. */
+void processClientsWaitingReplicas(void) {
+    long long last_offset = 0;
+    int last_numreplicas = 0;
+
+    listIter li;
+    listNode *ln;
+
+    listRewind(server.clients_waiting_acks,&li);
+    while((ln = listNext(&li))) {
+        client *c = ln->value;
+
+        /* Every time we find a client that is satisfied for a given
+         * offset and number of replicas, we remember it so the next client
+         * may be unblocked without calling replicationCountAcksByOffset()
+         * if the requested offset / replicas were equal or less. */
+        if (last_offset && last_offset >= c->bpop.reploffset &&
+                           last_numreplicas >= c->bpop.numreplicas)
+        {
+            unblockClient(c);
+            addReplyLongLong(c,last_numreplicas);
+        } else {
+            int numreplicas = replicationCountAcksByOffset(c->bpop.reploffset);
+
+            if (numreplicas >= c->bpop.numreplicas) {
+                last_offset = c->bpop.reploffset;
+                last_numreplicas = numreplicas;
+                unblockClient(c);
+                addReplyLongLong(c,numreplicas);
+            }
+        }
+    }
+}
+
+/* Return the slave replication offset for this instance, that is
+ * the offset for which we already processed the master replication stream. */
+long long replicationGetSlaveOffset(void) {
+    long long offset = 0;
+
+    if (server.masterhost != NULL) {
+        if (server.master) {
+            offset = server.master->reploff;
+        } else if (server.cached_master) {
+            offset = server.cached_master->reploff;
+        }
+    }
+    /* offset may be -1 when the master does not support it at all, however
+     * this function is designed to return an offset that can express the
+     * amount of data processed by the master, so we return a positive
+     * integer. */
+    if (offset < 0) offset = 0;
+    return offset;
+}
+
+/* --------------------------- REPLICATION CRON  ---------------------------- */
+
+/* Replication cron function, called 1 time per second. */
+void replicationCron(void) {
+    static long long replication_cron_loops = 0;
+
+    /* Check failover status first, to see if we need to start
+     * handling the failover. */
+    updateFailoverStatus();
+
+    /* Non blocking connection timeout? */
+    if (server.masterhost &&
+        (server.repl_state == REPL_STATE_CONNECTING ||
+         slaveIsInHandshakeState()) &&
+         (time(NULL)-server.repl_transfer_lastio) > server.repl_timeout)
+    {
+        serverLog(LL_WARNING,"Timeout connecting to the MASTER...");
+        cancelReplicationHandshake(1);
+    }
+
+    /* Bulk transfer I/O timeout? */
+    if (server.masterhost && server.repl_state == REPL_STATE_TRANSFER &&
+        (time(NULL)-server.repl_transfer_lastio) > server.repl_timeout)
+    {
+        serverLog(LL_WARNING,"Timeout receiving bulk data from MASTER... If the problem persists try to set the 'repl-timeout' parameter in redis.conf to a larger value.");
+        cancelReplicationHandshake(1);
+    }
+
+    /* Timed out master when we are an already connected slave? */
+    if (server.masterhost && server.repl_state == REPL_STATE_CONNECTED &&
+        (time(NULL)-server.master->lastinteraction) > server.repl_timeout)
+    {
+        serverLog(LL_WARNING,"MASTER timeout: no data nor PING received...");
+        freeClient(server.master);
+    }
+
+    /* Check if we should connect to a MASTER */
+    if (server.repl_state == REPL_STATE_CONNECT) {
+        serverLog(LL_NOTICE,"Connecting to MASTER %s:%d",
+            server.masterhost, server.masterport);
+        connectWithMaster();
+    }
+
+    /* Send ACK to master from time to time.
+     * Note that we do not send periodic acks to masters that don't
+     * support PSYNC and replication offsets. */
+    if (server.masterhost && server.master &&
+        !(server.master->flags & CLIENT_PRE_PSYNC))
+        replicationSendAck();
+
+    /* If we have attached slaves, PING them from time to time.
+     * So slaves can implement an explicit timeout to masters, and will
+     * be able to detect a link disconnection even if the TCP connection
+     * will not actually go down. */
+    listIter li;
+    listNode *ln;
+    robj *ping_argv[1];
+
+    /* First, send PING according to ping_slave_period. */
+    if ((replication_cron_loops % server.repl_ping_slave_period) == 0 &&
+        listLength(server.slaves))
+    {
+        /* Note that we don't send the PING if the clients are paused during
+         * a Redis Cluster manual failover: the PING we send will otherwise
+         * alter the replication offsets of master and slave, and will no longer
+         * match the one stored into 'mf_master_offset' state. */
+        int manual_failover_in_progress =
+            ((server.cluster_enabled &&
+              server.cluster->mf_end) ||
+            server.failover_end_time) &&
+            checkClientPauseTimeoutAndReturnIfPaused();
+
+        if (!manual_failover_in_progress) {
+            ping_argv[0] = shared.ping;
+            replicationFeedSlaves(server.slaves, server.slaveseldb,
+                ping_argv, 1);
+        }
+    }
+
+    /* Second, send a newline to all the slaves in pre-synchronization
+     * stage, that is, slaves waiting for the master to create the RDB file.
+     *
+     * Also send the a newline to all the chained slaves we have, if we lost
+     * connection from our master, to keep the slaves aware that their
+     * master is online. This is needed since sub-slaves only receive proxied
+     * data from top-level masters, so there is no explicit pinging in order
+     * to avoid altering the replication offsets. This special out of band
+     * pings (newlines) can be sent, they will have no effect in the offset.
+     *
+     * The newline will be ignored by the slave but will refresh the
+     * last interaction timer preventing a timeout. In this case we ignore the
+     * ping period and refresh the connection once per second since certain
+     * timeouts are set at a few seconds (example: PSYNC response). */
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        client *slave = ln->value;
+
+        int is_presync =
+            (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START ||
+            (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
+             server.rdb_child_type != RDB_CHILD_TYPE_SOCKET));
+
+        if (is_presync) {
+            connWrite(slave->conn, "\n", 1);
+        }
+    }
+
+    /* Disconnect timedout slaves. */
+    if (listLength(server.slaves)) {
+        listIter li;
+        listNode *ln;
+
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+
+            if (slave->replstate == SLAVE_STATE_ONLINE) {
+                if (slave->flags & CLIENT_PRE_PSYNC)
+                    continue;
+                if ((server.unixtime - slave->repl_ack_time) > server.repl_timeout) {
+                    serverLog(LL_WARNING, "Disconnecting timedout replica (streaming sync): %s",
+                          replicationGetSlaveName(slave));
+                    freeClient(slave);
+                    continue;
+                }
+            }
+            /* We consider disconnecting only diskless replicas because disk-based replicas aren't fed
+             * by the fork child so if a disk-based replica is stuck it doesn't prevent the fork child
+             * from terminating. */
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END && server.rdb_child_type == RDB_CHILD_TYPE_SOCKET) {
+                if (slave->repl_last_partial_write != 0 &&
+                    (server.unixtime - slave->repl_last_partial_write) > server.repl_timeout)
+                {
+                    serverLog(LL_WARNING, "Disconnecting timedout replica (full sync): %s",
+                          replicationGetSlaveName(slave));
+                    freeClient(slave);
+                    continue;
+                }
+            }
+        }
+    }
+
+    /* If this is a master without attached slaves and there is a replication
+     * backlog active, in order to reclaim memory we can free it after some
+     * (configured) time. Note that this cannot be done for slaves: slaves
+     * without sub-slaves attached should still accumulate data into the
+     * backlog, in order to reply to PSYNC queries if they are turned into
+     * masters after a failover. */
+    if (listLength(server.slaves) == 0 && server.repl_backlog_time_limit &&
+        server.repl_backlog && server.masterhost == NULL)
+    {
+        time_t idle = server.unixtime - server.repl_no_slaves_since;
+
+        if (idle > server.repl_backlog_time_limit) {
+            /* When we free the backlog, we always use a new
+             * replication ID and clear the ID2. This is needed
+             * because when there is no backlog, the master_repl_offset
+             * is not updated, but we would still retain our replication
+             * ID, leading to the following problem:
+             *
+             * 1. We are a master instance.
+             * 2. Our slave is promoted to master. It's repl-id-2 will
+             *    be the same as our repl-id.
+             * 3. We, yet as master, receive some updates, that will not
+             *    increment the master_repl_offset.
+             * 4. Later we are turned into a slave, connect to the new
+             *    master that will accept our PSYNC request by second
+             *    replication ID, but there will be data inconsistency
+             *    because we received writes. */
+            changeReplicationId();
+            clearReplicationId2();
+            freeReplicationBacklog();
+            serverLog(LL_NOTICE,
+                "Replication backlog freed after %d seconds "
+                "without connected replicas.",
+                (int) server.repl_backlog_time_limit);
+        }
+    }
+
+    /* If AOF is disabled and we no longer have attached slaves, we can
+     * free our Replication Script Cache as there is no need to propagate
+     * EVALSHA at all. */
+    if (listLength(server.slaves) == 0 &&
+        server.aof_state == AOF_OFF &&
+        listLength(server.repl_scriptcache_fifo) != 0)
+    {
+        replicationScriptCacheFlush();
+    }
+
+    replicationStartPendingFork();
+
+    /* Remove the RDB file used for replication if Redis is not running
+     * with any persistence. */
+    removeRDBUsedToSyncReplicas();
+
+    /* Refresh the number of slaves with lag <= min-slaves-max-lag. */
+    refreshGoodSlavesCount();
+    replication_cron_loops++; /* Incremented with frequency 1 HZ. */
+}
+
+void replicationStartPendingFork(void) {
+    /* Start a BGSAVE good for replication if we have slaves in
+     * WAIT_BGSAVE_START state.
+     *
+     * In case of diskless replication, we make sure to wait the specified
+     * number of seconds (according to configuration) so that other slaves
+     * have the time to arrive before we start streaming. */
+    if (!hasActiveChildProcess()) {
+        time_t idle, max_idle = 0;
+        int slaves_waiting = 0;
+        int mincapa = -1;
+        listNode *ln;
+        listIter li;
+
+        listRewind(server.slaves,&li);
+        while((ln = listNext(&li))) {
+            client *slave = ln->value;
+            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
+                idle = server.unixtime - slave->lastinteraction;
+                if (idle > max_idle) max_idle = idle;
+                slaves_waiting++;
+                mincapa = (mincapa == -1) ? slave->slave_capa :
+                                            (mincapa & slave->slave_capa);
+            }
+        }
+
+        if (slaves_waiting &&
+            (!server.repl_diskless_sync ||
+             max_idle >= server.repl_diskless_sync_delay))
+        {
+            /* Start the BGSAVE. The called function may start a
+             * BGSAVE with socket target or disk target depending on the
+             * configuration and slaves capabilities. */
+            startBgsaveForReplication(mincapa);
+        }
+    }
+}
+
+/* Find replica at IP:PORT from replica list */
+static client *findReplica(char *host, int port) {
+    listIter li;
+    listNode *ln;
+    client *replica;
+
+    listRewind(server.slaves,&li);
+    while((ln = listNext(&li))) {
+        replica = ln->value;
+        char ip[NET_IP_STR_LEN], *replicaip = replica->slave_addr;
+
+        if (!replicaip) {
+            if (connPeerToString(replica->conn, ip, sizeof(ip), NULL) == -1)
+                continue;
+            replicaip = ip;
+        }
+
+        if (!strcasecmp(host, replicaip) &&
+                (port == replica->slave_listening_port))
+            return replica;
+    }
+
+    return NULL;
+}
+
+const char *getFailoverStateString() {
+    switch(server.failover_state) {
+        case NO_FAILOVER: return "no-failover";
+        case FAILOVER_IN_PROGRESS: return "failover-in-progress";
+        case FAILOVER_WAIT_FOR_SYNC: return "waiting-for-sync";
+        default: return "unknown";
+    }
+}
+
+/* Resets the internal failover configuration, this needs
+ * to be called after a failover either succeeds or fails
+ * as it includes the client unpause. */
+void clearFailoverState() {
+    server.failover_end_time = 0;
+    server.force_failover = 0;
+    zfree(server.target_replica_host);
+    server.target_replica_host = NULL;
+    server.target_replica_port = 0;
+    server.failover_state = NO_FAILOVER;
+    unpauseClients();
+}
+
+/* Abort an ongoing failover if one is going on. */
+void abortFailover(const char *err) {
+    if (server.failover_state == NO_FAILOVER) return;
+
+    if (server.target_replica_host) {
+        serverLog(LL_NOTICE,"FAILOVER to %s:%d aborted: %s",
+            server.target_replica_host,server.target_replica_port,err);  
+    } else {
+        serverLog(LL_NOTICE,"FAILOVER to any replica aborted: %s",err);  
+    }
+    if (server.failover_state == FAILOVER_IN_PROGRESS) {
+        replicationUnsetMaster();
+    }
+    clearFailoverState();
+}
+
+/* 
+ * FAILOVER [TO <HOST> <PORT> [FORCE]] [ABORT] [TIMEOUT <timeout>]
+ * 
+ * This command will coordinate a failover between the master and one
+ * of its replicas. The happy path contains the following steps:
+ * 1) The master will initiate a client pause write, to stop replication
+ * traffic.
+ * 2) The master will periodically check if any of its replicas has
+ * consumed the entire replication stream through acks. 
+ * 3) Once any replica has caught up, the master will itself become a replica.
+ * 4) The master will send a PSYNC FAILOVER request to the target replica, which
+ * if accepted will cause the replica to become the new master and start a sync.
+ * 
+ * FAILOVER ABORT is the only way to abort a failover command, as replicaof
+ * will be disabled. This may be needed if the failover is unable to progress. 
+ * 
+ * The optional arguments [TO <HOST> <IP>] allows designating a specific replica
+ * to be failed over to.
+ * 
+ * FORCE flag indicates that even if the target replica is not caught up,
+ * failover to it anyway. This must be specified with a timeout and a target
+ * HOST and IP.
+ * 
+ * TIMEOUT <timeout> indicates how long should the primary wait for 
+ * a replica to sync up before aborting. If not specified, the failover
+ * will attempt forever and must be manually aborted.
+ */
+void failoverCommand(client *c) {
+    if (server.cluster_enabled) {
+        addReplyError(c,"FAILOVER not allowed in cluster mode. "
+                        "Use CLUSTER FAILOVER command instead.");
+        return;
+    }
+    
+    /* Handle special case for abort */
+    if ((c->argc == 2) && !strcasecmp(c->argv[1]->ptr,"abort")) {
+        if (server.failover_state == NO_FAILOVER) {
+            addReplyError(c, "No failover in progress.");
+            return;
+        }
+
+        abortFailover("Failover manually aborted");
+        addReply(c,shared.ok);
+        return;
+    }
+
+    long timeout_in_ms = 0;
+    int force_flag = 0;
+    long port = 0;
+    char *host = NULL;
+
+    /* Parse the command for syntax and arguments. */
+    for (int j = 1; j < c->argc; j++) {
+        if (!strcasecmp(c->argv[j]->ptr,"timeout") && (j + 1 < c->argc) &&
+            timeout_in_ms == 0)
+        {
+            if (getLongFromObjectOrReply(c,c->argv[j + 1],
+                        &timeout_in_ms,NULL) != C_OK) return;
+            if (timeout_in_ms <= 0) {
+                addReplyError(c,"FAILOVER timeout must be greater than 0");
+                return;
+            }
+            j++;
+        } else if (!strcasecmp(c->argv[j]->ptr,"to") && (j + 2 < c->argc) &&
+            !host) 
+        {
+            if (getLongFromObjectOrReply(c,c->argv[j + 2],&port,NULL) != C_OK)
+                return;
+            host = c->argv[j + 1]->ptr;
+            j += 2;
+        } else if (!strcasecmp(c->argv[j]->ptr,"force") && !force_flag) {
+            force_flag = 1;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    if (server.failover_state != NO_FAILOVER) {
+        addReplyError(c,"FAILOVER already in progress.");
+        return;
+    }
+
+    if (server.masterhost) {
+        addReplyError(c,"FAILOVER is not valid when server is a replica.");
+        return;
+    }
+
+    if (listLength(server.slaves) == 0) {
+        addReplyError(c,"FAILOVER requires connected replicas.");
+        return; 
+    }
+
+    if (force_flag && (!timeout_in_ms || !host)) {
+        addReplyError(c,"FAILOVER with force option requires both a timeout "
+            "and target HOST and IP.");
+        return;     
+    }
+
+    /* If a replica address was provided, validate that it is connected. */
+    if (host) {
+        client *replica = findReplica(host, port);
+
+        if (replica == NULL) {
+            addReplyError(c,"FAILOVER target HOST and PORT is not "
+                            "a replica.");
+            return;
+        }
+
+        /* Check if requested replica is online */
+        if (replica->replstate != SLAVE_STATE_ONLINE) {
+            addReplyError(c,"FAILOVER target replica is not online.");
+            return;
+        }
+
+        server.target_replica_host = zstrdup(host);
+        server.target_replica_port = port;
+        serverLog(LL_NOTICE,"FAILOVER requested to %s:%ld.",host,port);
+    } else {
+        serverLog(LL_NOTICE,"FAILOVER requested to any replica.");
+    }
+
+    mstime_t now = mstime();
+    if (timeout_in_ms) {
+        server.failover_end_time = now + timeout_in_ms;
+    }
+    
+    server.force_failover = force_flag;
+    server.failover_state = FAILOVER_WAIT_FOR_SYNC;
+    /* Cluster failover will unpause eventually */
+    pauseClients(LLONG_MAX,CLIENT_PAUSE_WRITE);
+    addReply(c,shared.ok);
+}
+
+/* Failover cron function, checks coordinated failover state. 
+ *
+ * Implementation note: The current implementation calls replicationSetMaster()
+ * to start the failover request, this has some unintended side effects if the
+ * failover doesn't work like blocked clients will be unblocked and replicas will
+ * be disconnected. This could be optimized further.
+ */
+void updateFailoverStatus(void) {
+    if (server.failover_state != FAILOVER_WAIT_FOR_SYNC) return;
+    mstime_t now = server.mstime;
+
+    /* Check if failover operation has timed out */
+    if (server.failover_end_time && server.failover_end_time <= now) {
+        if (server.force_failover) {
+            serverLog(LL_NOTICE,
+                "FAILOVER to %s:%d time out exceeded, failing over.",
+                server.target_replica_host, server.target_replica_port);
+            server.failover_state = FAILOVER_IN_PROGRESS;
+            /* If timeout has expired force a failover if requested. */
+            replicationSetMaster(server.target_replica_host,
+                server.target_replica_port);
+            return;
+        } else {
+            /* Force was not requested, so timeout. */
+            abortFailover("Replica never caught up before timeout");
+            return;
+        }
+    }
+
+    /* Check to see if the replica has caught up so failover can start */
+    client *replica = NULL;
+    if (server.target_replica_host) {
+        replica = findReplica(server.target_replica_host, 
+            server.target_replica_port);
+    } else {
+        listIter li;
+        listNode *ln;
+
+        listRewind(server.slaves,&li);
+        /* Find any replica that has matched our repl_offset */
+        while((ln = listNext(&li))) {
+            replica = ln->value;
+            if (replica->repl_ack_off == server.master_repl_offset) {
+                char ip[NET_IP_STR_LEN], *replicaaddr = replica->slave_addr;
+
+                if (!replicaaddr) {
+                    if (connPeerToString(replica->conn,ip,sizeof(ip),NULL) == -1)
+                        continue;
+                    replicaaddr = ip;
+                }
+
+                /* We are now failing over to this specific node */
+                server.target_replica_host = zstrdup(replicaaddr);
+                server.target_replica_port = replica->slave_listening_port;
+                break;
+            }
+        }
+    }
+
+    /* We've found a replica that is caught up */
+    if (replica && (replica->repl_ack_off == server.master_repl_offset)) {
+        server.failover_state = FAILOVER_IN_PROGRESS;
+        serverLog(LL_NOTICE,
+                "Failover target %s:%d is synced, failing over.",
+                server.target_replica_host, server.target_replica_port);
+        /* Designated replica is caught up, failover to it. */
+        replicationSetMaster(server.target_replica_host,
+            server.target_replica_port);
+    }
+}
diff --git a/redis-stable/src/rio.c b/redis-stable/src/rio.c
new file mode 100644
index 00000000..0d107708
--- /dev/null
+++ b/redis-stable/src/rio.c
@@ -0,0 +1,448 @@
+/* rio.c is a simple stream-oriented I/O abstraction that provides an interface
+ * to write code that can consume/produce data using different concrete input
+ * and output devices. For instance the same rdb.c code using the rio
+ * abstraction can be used to read and write the RDB format using in-memory
+ * buffers or files.
+ *
+ * A rio object provides the following methods:
+ *  read: read from stream.
+ *  write: write to stream.
+ *  tell: get the current offset.
+ *
+ * It is also possible to set a 'checksum' method that is used by rio.c in order
+ * to compute a checksum of the data written or read, or to query the rio object
+ * for the current checksum.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "fmacros.h"
+#include <string.h>
+#include <stdio.h>
+#include <unistd.h>
+#include "rio.h"
+#include "util.h"
+#include "crc64.h"
+#include "config.h"
+#include "server.h"
+
+/* ------------------------- Buffer I/O implementation ----------------------- */
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioBufferWrite(rio *r, const void *buf, size_t len) {
+    r->io.buffer.ptr = sdscatlen(r->io.buffer.ptr,(char*)buf,len);
+    r->io.buffer.pos += len;
+    return 1;
+}
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioBufferRead(rio *r, void *buf, size_t len) {
+    if (sdslen(r->io.buffer.ptr)-r->io.buffer.pos < len)
+        return 0; /* not enough buffer to return len bytes. */
+    memcpy(buf,r->io.buffer.ptr+r->io.buffer.pos,len);
+    r->io.buffer.pos += len;
+    return 1;
+}
+
+/* Returns read/write position in buffer. */
+static off_t rioBufferTell(rio *r) {
+    return r->io.buffer.pos;
+}
+
+/* Flushes any buffer to target device if applicable. Returns 1 on success
+ * and 0 on failures. */
+static int rioBufferFlush(rio *r) {
+    UNUSED(r);
+    return 1; /* Nothing to do, our write just appends to the buffer. */
+}
+
+static const rio rioBufferIO = {
+    rioBufferRead,
+    rioBufferWrite,
+    rioBufferTell,
+    rioBufferFlush,
+    NULL,           /* update_checksum */
+    0,              /* current checksum */
+    0,              /* flags */
+    0,              /* bytes read or written */
+    0,              /* read/write chunk size */
+    { { NULL, 0 } } /* union for io-specific vars */
+};
+
+void rioInitWithBuffer(rio *r, sds s) {
+    *r = rioBufferIO;
+    r->io.buffer.ptr = s;
+    r->io.buffer.pos = 0;
+}
+
+/* --------------------- Stdio file pointer implementation ------------------- */
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioFileWrite(rio *r, const void *buf, size_t len) {
+    size_t retval;
+
+    retval = fwrite(buf,len,1,r->io.file.fp);
+    r->io.file.buffered += len;
+
+    if (r->io.file.autosync &&
+        r->io.file.buffered >= r->io.file.autosync)
+    {
+        fflush(r->io.file.fp);
+        if (redis_fsync(fileno(r->io.file.fp)) == -1) return 0;
+        r->io.file.buffered = 0;
+    }
+    return retval;
+}
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioFileRead(rio *r, void *buf, size_t len) {
+    return fread(buf,len,1,r->io.file.fp);
+}
+
+/* Returns read/write position in file. */
+static off_t rioFileTell(rio *r) {
+    return ftello(r->io.file.fp);
+}
+
+/* Flushes any buffer to target device if applicable. Returns 1 on success
+ * and 0 on failures. */
+static int rioFileFlush(rio *r) {
+    return (fflush(r->io.file.fp) == 0) ? 1 : 0;
+}
+
+static const rio rioFileIO = {
+    rioFileRead,
+    rioFileWrite,
+    rioFileTell,
+    rioFileFlush,
+    NULL,           /* update_checksum */
+    0,              /* current checksum */
+    0,              /* flags */
+    0,              /* bytes read or written */
+    0,              /* read/write chunk size */
+    { { NULL, 0 } } /* union for io-specific vars */
+};
+
+void rioInitWithFile(rio *r, FILE *fp) {
+    *r = rioFileIO;
+    r->io.file.fp = fp;
+    r->io.file.buffered = 0;
+    r->io.file.autosync = 0;
+}
+
+/* ------------------- Connection implementation -------------------
+ * We use this RIO implementation when reading an RDB file directly from
+ * the connection to the memory via rdbLoadRio(), thus this implementation
+ * only implements reading from a connection that is, normally,
+ * just a socket. */
+
+static size_t rioConnWrite(rio *r, const void *buf, size_t len) {
+    UNUSED(r);
+    UNUSED(buf);
+    UNUSED(len);
+    return 0; /* Error, this target does not yet support writing. */
+}
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioConnRead(rio *r, void *buf, size_t len) {
+    size_t avail = sdslen(r->io.conn.buf)-r->io.conn.pos;
+
+    /* If the buffer is too small for the entire request: realloc. */
+    if (sdslen(r->io.conn.buf) + sdsavail(r->io.conn.buf) < len)
+        r->io.conn.buf = sdsMakeRoomFor(r->io.conn.buf, len - sdslen(r->io.conn.buf));
+
+    /* If the remaining unused buffer is not large enough: memmove so that we
+     * can read the rest. */
+    if (len > avail && sdsavail(r->io.conn.buf) < len - avail) {
+        sdsrange(r->io.conn.buf, r->io.conn.pos, -1);
+        r->io.conn.pos = 0;
+    }
+
+    /* If we don't already have all the data in the sds, read more */
+    while (len > sdslen(r->io.conn.buf) - r->io.conn.pos) {
+        size_t buffered = sdslen(r->io.conn.buf) - r->io.conn.pos;
+        size_t needs = len - buffered;
+        /* Read either what's missing, or PROTO_IOBUF_LEN, the bigger of
+         * the two. */
+        size_t toread = needs < PROTO_IOBUF_LEN ? PROTO_IOBUF_LEN: needs;
+        if (toread > sdsavail(r->io.conn.buf)) toread = sdsavail(r->io.conn.buf);
+        if (r->io.conn.read_limit != 0 &&
+            r->io.conn.read_so_far + buffered + toread > r->io.conn.read_limit)
+        {
+            /* Make sure the caller didn't request to read past the limit.
+             * If they didn't we'll buffer till the limit, if they did, we'll
+             * return an error. */
+            if (r->io.conn.read_limit >= r->io.conn.read_so_far + len)
+                toread = r->io.conn.read_limit - r->io.conn.read_so_far - buffered;
+            else {
+                errno = EOVERFLOW;
+                return 0;
+            }
+        }
+        int retval = connRead(r->io.conn.conn,
+                          (char*)r->io.conn.buf + sdslen(r->io.conn.buf),
+                          toread);
+        if (retval <= 0) {
+            if (errno == EWOULDBLOCK) errno = ETIMEDOUT;
+            return 0;
+        }
+        sdsIncrLen(r->io.conn.buf, retval);
+    }
+
+    memcpy(buf, (char*)r->io.conn.buf + r->io.conn.pos, len);
+    r->io.conn.read_so_far += len;
+    r->io.conn.pos += len;
+    return len;
+}
+
+/* Returns read/write position in file. */
+static off_t rioConnTell(rio *r) {
+    return r->io.conn.read_so_far;
+}
+
+/* Flushes any buffer to target device if applicable. Returns 1 on success
+ * and 0 on failures. */
+static int rioConnFlush(rio *r) {
+    /* Our flush is implemented by the write method, that recognizes a
+     * buffer set to NULL with a count of zero as a flush request. */
+    return rioConnWrite(r,NULL,0);
+}
+
+static const rio rioConnIO = {
+    rioConnRead,
+    rioConnWrite,
+    rioConnTell,
+    rioConnFlush,
+    NULL,           /* update_checksum */
+    0,              /* current checksum */
+    0,              /* flags */
+    0,              /* bytes read or written */
+    0,              /* read/write chunk size */
+    { { NULL, 0 } } /* union for io-specific vars */
+};
+
+/* Create an RIO that implements a buffered read from an fd
+ * read_limit argument stops buffering when the reaching the limit. */
+void rioInitWithConn(rio *r, connection *conn, size_t read_limit) {
+    *r = rioConnIO;
+    r->io.conn.conn = conn;
+    r->io.conn.pos = 0;
+    r->io.conn.read_limit = read_limit;
+    r->io.conn.read_so_far = 0;
+    r->io.conn.buf = sdsnewlen(NULL, PROTO_IOBUF_LEN);
+    sdsclear(r->io.conn.buf);
+}
+
+/* Release the RIO stream. Optionally returns the unread buffered data
+ * when the SDS pointer 'remaining' is passed. */
+void rioFreeConn(rio *r, sds *remaining) {
+    if (remaining && (size_t)r->io.conn.pos < sdslen(r->io.conn.buf)) {
+        if (r->io.conn.pos > 0) sdsrange(r->io.conn.buf, r->io.conn.pos, -1);
+        *remaining = r->io.conn.buf;
+    } else {
+        sdsfree(r->io.conn.buf);
+        if (remaining) *remaining = NULL;
+    }
+    r->io.conn.buf = NULL;
+}
+
+/* ------------------- File descriptor implementation ------------------
+ * This target is used to write the RDB file to pipe, when the master just
+ * streams the data to the replicas without creating an RDB on-disk image
+ * (diskless replication option).
+ * It only implements writes. */
+
+/* Returns 1 or 0 for success/failure.
+ *
+ * When buf is NULL and len is 0, the function performs a flush operation
+ * if there is some pending buffer, so this function is also used in order
+ * to implement rioFdFlush(). */
+static size_t rioFdWrite(rio *r, const void *buf, size_t len) {
+    ssize_t retval;
+    unsigned char *p = (unsigned char*) buf;
+    int doflush = (buf == NULL && len == 0);
+
+    /* For small writes, we rather keep the data in user-space buffer, and flush
+     * it only when it grows. however for larger writes, we prefer to flush
+     * any pre-existing buffer, and write the new one directly without reallocs
+     * and memory copying. */
+    if (len > PROTO_IOBUF_LEN) {
+        /* First, flush any pre-existing buffered data. */
+        if (sdslen(r->io.fd.buf)) {
+            if (rioFdWrite(r, NULL, 0) == 0)
+                return 0;
+        }
+        /* Write the new data, keeping 'p' and 'len' from the input. */
+    } else {
+        if (len) {
+            r->io.fd.buf = sdscatlen(r->io.fd.buf,buf,len);
+            if (sdslen(r->io.fd.buf) > PROTO_IOBUF_LEN)
+                doflush = 1;
+            if (!doflush)
+                return 1;
+        }
+        /* Flusing the buffered data. set 'p' and 'len' accordintly. */
+        p = (unsigned char*) r->io.fd.buf;
+        len = sdslen(r->io.fd.buf);
+    }
+
+    size_t nwritten = 0;
+    while(nwritten != len) {
+        retval = write(r->io.fd.fd,p+nwritten,len-nwritten);
+        if (retval <= 0) {
+            /* With blocking io, which is the sole user of this
+             * rio target, EWOULDBLOCK is returned only because of
+             * the SO_SNDTIMEO socket option, so we translate the error
+             * into one more recognizable by the user. */
+            if (retval == -1 && errno == EWOULDBLOCK) errno = ETIMEDOUT;
+            return 0; /* error. */
+        }
+        nwritten += retval;
+    }
+
+    r->io.fd.pos += len;
+    sdsclear(r->io.fd.buf);
+    return 1;
+}
+
+/* Returns 1 or 0 for success/failure. */
+static size_t rioFdRead(rio *r, void *buf, size_t len) {
+    UNUSED(r);
+    UNUSED(buf);
+    UNUSED(len);
+    return 0; /* Error, this target does not support reading. */
+}
+
+/* Returns read/write position in file. */
+static off_t rioFdTell(rio *r) {
+    return r->io.fd.pos;
+}
+
+/* Flushes any buffer to target device if applicable. Returns 1 on success
+ * and 0 on failures. */
+static int rioFdFlush(rio *r) {
+    /* Our flush is implemented by the write method, that recognizes a
+     * buffer set to NULL with a count of zero as a flush request. */
+    return rioFdWrite(r,NULL,0);
+}
+
+static const rio rioFdIO = {
+    rioFdRead,
+    rioFdWrite,
+    rioFdTell,
+    rioFdFlush,
+    NULL,           /* update_checksum */
+    0,              /* current checksum */
+    0,              /* flags */
+    0,              /* bytes read or written */
+    0,              /* read/write chunk size */
+    { { NULL, 0 } } /* union for io-specific vars */
+};
+
+void rioInitWithFd(rio *r, int fd) {
+    *r = rioFdIO;
+    r->io.fd.fd = fd;
+    r->io.fd.pos = 0;
+    r->io.fd.buf = sdsempty();
+}
+
+/* release the rio stream. */
+void rioFreeFd(rio *r) {
+    sdsfree(r->io.fd.buf);
+}
+
+/* ---------------------------- Generic functions ---------------------------- */
+
+/* This function can be installed both in memory and file streams when checksum
+ * computation is needed. */
+void rioGenericUpdateChecksum(rio *r, const void *buf, size_t len) {
+    r->cksum = crc64(r->cksum,buf,len);
+}
+
+/* Set the file-based rio object to auto-fsync every 'bytes' file written.
+ * By default this is set to zero that means no automatic file sync is
+ * performed.
+ *
+ * This feature is useful in a few contexts since when we rely on OS write
+ * buffers sometimes the OS buffers way too much, resulting in too many
+ * disk I/O concentrated in very little time. When we fsync in an explicit
+ * way instead the I/O pressure is more distributed across time. */
+void rioSetAutoSync(rio *r, off_t bytes) {
+    if(r->write != rioFileIO.write) return;
+    r->io.file.autosync = bytes;
+}
+
+/* --------------------------- Higher level interface --------------------------
+ *
+ * The following higher level functions use lower level rio.c functions to help
+ * generating the Redis protocol for the Append Only File. */
+
+/* Write multi bulk count in the format: "*<count>\r\n". */
+size_t rioWriteBulkCount(rio *r, char prefix, long count) {
+    char cbuf[128];
+    int clen;
+
+    cbuf[0] = prefix;
+    clen = 1+ll2string(cbuf+1,sizeof(cbuf)-1,count);
+    cbuf[clen++] = '\r';
+    cbuf[clen++] = '\n';
+    if (rioWrite(r,cbuf,clen) == 0) return 0;
+    return clen;
+}
+
+/* Write binary-safe string in the format: "$<count>\r\n<payload>\r\n". */
+size_t rioWriteBulkString(rio *r, const char *buf, size_t len) {
+    size_t nwritten;
+
+    if ((nwritten = rioWriteBulkCount(r,'$',len)) == 0) return 0;
+    if (len > 0 && rioWrite(r,buf,len) == 0) return 0;
+    if (rioWrite(r,"\r\n",2) == 0) return 0;
+    return nwritten+len+2;
+}
+
+/* Write a long long value in format: "$<count>\r\n<payload>\r\n". */
+size_t rioWriteBulkLongLong(rio *r, long long l) {
+    char lbuf[32];
+    unsigned int llen;
+
+    llen = ll2string(lbuf,sizeof(lbuf),l);
+    return rioWriteBulkString(r,lbuf,llen);
+}
+
+/* Write a double value in the format: "$<count>\r\n<payload>\r\n" */
+size_t rioWriteBulkDouble(rio *r, double d) {
+    char dbuf[128];
+    unsigned int dlen;
+
+    dlen = snprintf(dbuf,sizeof(dbuf),"%.17g",d);
+    return rioWriteBulkString(r,dbuf,dlen);
+}
diff --git a/redis-stable/src/rio.h b/redis-stable/src/rio.h
new file mode 100644
index 00000000..9576335e
--- /dev/null
+++ b/redis-stable/src/rio.h
@@ -0,0 +1,178 @@
+/*
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#ifndef __REDIS_RIO_H
+#define __REDIS_RIO_H
+
+#include <stdio.h>
+#include <stdint.h>
+#include "sds.h"
+#include "connection.h"
+
+#define RIO_FLAG_READ_ERROR (1<<0)
+#define RIO_FLAG_WRITE_ERROR (1<<1)
+
+struct _rio {
+    /* Backend functions.
+     * Since this functions do not tolerate short writes or reads the return
+     * value is simplified to: zero on error, non zero on complete success. */
+    size_t (*read)(struct _rio *, void *buf, size_t len);
+    size_t (*write)(struct _rio *, const void *buf, size_t len);
+    off_t (*tell)(struct _rio *);
+    int (*flush)(struct _rio *);
+    /* The update_cksum method if not NULL is used to compute the checksum of
+     * all the data that was read or written so far. The method should be
+     * designed so that can be called with the current checksum, and the buf
+     * and len fields pointing to the new block of data to add to the checksum
+     * computation. */
+    void (*update_cksum)(struct _rio *, const void *buf, size_t len);
+
+    /* The current checksum and flags (see RIO_FLAG_*) */
+    uint64_t cksum, flags;
+
+    /* number of bytes read or written */
+    size_t processed_bytes;
+
+    /* maximum single read or write chunk size */
+    size_t max_processing_chunk;
+
+    /* Backend-specific vars. */
+    union {
+        /* In-memory buffer target. */
+        struct {
+            sds ptr;
+            off_t pos;
+        } buffer;
+        /* Stdio file pointer target. */
+        struct {
+            FILE *fp;
+            off_t buffered; /* Bytes written since last fsync. */
+            off_t autosync; /* fsync after 'autosync' bytes written. */
+        } file;
+        /* Connection object (used to read from socket) */
+        struct {
+            connection *conn;   /* Connection */
+            off_t pos;    /* pos in buf that was returned */
+            sds buf;      /* buffered data */
+            size_t read_limit;  /* don't allow to buffer/read more than that */
+            size_t read_so_far; /* amount of data read from the rio (not buffered) */
+        } conn;
+        /* FD target (used to write to pipe). */
+        struct {
+            int fd;       /* File descriptor. */
+            off_t pos;
+            sds buf;
+        } fd;
+    } io;
+};
+
+typedef struct _rio rio;
+
+/* The following functions are our interface with the stream. They'll call the
+ * actual implementation of read / write / tell, and will update the checksum
+ * if needed. */
+
+static inline size_t rioWrite(rio *r, const void *buf, size_t len) {
+    if (r->flags & RIO_FLAG_WRITE_ERROR) return 0;
+    while (len) {
+        size_t bytes_to_write = (r->max_processing_chunk && r->max_processing_chunk < len) ? r->max_processing_chunk : len;
+        if (r->update_cksum) r->update_cksum(r,buf,bytes_to_write);
+        if (r->write(r,buf,bytes_to_write) == 0) {
+            r->flags |= RIO_FLAG_WRITE_ERROR;
+            return 0;
+        }
+        buf = (char*)buf + bytes_to_write;
+        len -= bytes_to_write;
+        r->processed_bytes += bytes_to_write;
+    }
+    return 1;
+}
+
+static inline size_t rioRead(rio *r, void *buf, size_t len) {
+    if (r->flags & RIO_FLAG_READ_ERROR) return 0;
+    while (len) {
+        size_t bytes_to_read = (r->max_processing_chunk && r->max_processing_chunk < len) ? r->max_processing_chunk : len;
+        if (r->read(r,buf,bytes_to_read) == 0) {
+            r->flags |= RIO_FLAG_READ_ERROR;
+            return 0;
+        }
+        if (r->update_cksum) r->update_cksum(r,buf,bytes_to_read);
+        buf = (char*)buf + bytes_to_read;
+        len -= bytes_to_read;
+        r->processed_bytes += bytes_to_read;
+    }
+    return 1;
+}
+
+static inline off_t rioTell(rio *r) {
+    return r->tell(r);
+}
+
+static inline int rioFlush(rio *r) {
+    return r->flush(r);
+}
+
+/* This function allows to know if there was a read error in any past
+ * operation, since the rio stream was created or since the last call
+ * to rioClearError(). */
+static inline int rioGetReadError(rio *r) {
+    return (r->flags & RIO_FLAG_READ_ERROR) != 0;
+}
+
+/* Like rioGetReadError() but for write errors. */
+static inline int rioGetWriteError(rio *r) {
+    return (r->flags & RIO_FLAG_WRITE_ERROR) != 0;
+}
+
+static inline void rioClearErrors(rio *r) {
+    r->flags &= ~(RIO_FLAG_READ_ERROR|RIO_FLAG_WRITE_ERROR);
+}
+
+void rioInitWithFile(rio *r, FILE *fp);
+void rioInitWithBuffer(rio *r, sds s);
+void rioInitWithConn(rio *r, connection *conn, size_t read_limit);
+void rioInitWithFd(rio *r, int fd);
+
+void rioFreeFd(rio *r);
+void rioFreeConn(rio *r, sds* out_remainingBufferedData);
+
+size_t rioWriteBulkCount(rio *r, char prefix, long count);
+size_t rioWriteBulkString(rio *r, const char *buf, size_t len);
+size_t rioWriteBulkLongLong(rio *r, long long l);
+size_t rioWriteBulkDouble(rio *r, double d);
+
+struct redisObject;
+int rioWriteBulkObject(rio *r, struct redisObject *obj);
+
+void rioGenericUpdateChecksum(rio *r, const void *buf, size_t len);
+void rioSetAutoSync(rio *r, off_t bytes);
+
+#endif
diff --git a/redis-stable/src/scripting.c b/redis-stable/src/scripting.c
new file mode 100644
index 00000000..360df500
--- /dev/null
+++ b/redis-stable/src/scripting.c
@@ -0,0 +1,2835 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "sha1.h"
+#include "rand.h"
+#include "cluster.h"
+#include "monotonic.h"
+
+#include <lua.h>
+#include <lauxlib.h>
+#include <lualib.h>
+#include <ctype.h>
+#include <math.h>
+
+char *redisProtocolToLuaType_Int(lua_State *lua, char *reply);
+char *redisProtocolToLuaType_Bulk(lua_State *lua, char *reply);
+char *redisProtocolToLuaType_Status(lua_State *lua, char *reply);
+char *redisProtocolToLuaType_Error(lua_State *lua, char *reply);
+char *redisProtocolToLuaType_Aggregate(lua_State *lua, char *reply, int atype);
+char *redisProtocolToLuaType_Null(lua_State *lua, char *reply);
+char *redisProtocolToLuaType_Bool(lua_State *lua, char *reply, int tf);
+char *redisProtocolToLuaType_Double(lua_State *lua, char *reply);
+int redis_math_random (lua_State *L);
+int redis_math_randomseed (lua_State *L);
+void ldbInit(void);
+void ldbDisable(client *c);
+void ldbEnable(client *c);
+void evalGenericCommandWithDebugging(client *c, int evalsha);
+void luaLdbLineHook(lua_State *lua, lua_Debug *ar);
+void ldbLog(sds entry);
+void ldbLogRedisReply(char *reply);
+sds ldbCatStackValue(sds s, lua_State *lua, int idx);
+
+/* Debugger shared state is stored inside this global structure. */
+#define LDB_BREAKPOINTS_MAX 64  /* Max number of breakpoints. */
+#define LDB_MAX_LEN_DEFAULT 256 /* Default len limit for replies / var dumps. */
+struct ldbState {
+    connection *conn; /* Connection of the debugging client. */
+    int active; /* Are we debugging EVAL right now? */
+    int forked; /* Is this a fork()ed debugging session? */
+    list *logs; /* List of messages to send to the client. */
+    list *traces; /* Messages about Redis commands executed since last stop.*/
+    list *children; /* All forked debugging sessions pids. */
+    int bp[LDB_BREAKPOINTS_MAX]; /* An array of breakpoints line numbers. */
+    int bpcount; /* Number of valid entries inside bp. */
+    int step;   /* Stop at next line regardless of breakpoints. */
+    int luabp;  /* Stop at next line because redis.breakpoint() was called. */
+    sds *src;   /* Lua script source code split by line. */
+    int lines;  /* Number of lines in 'src'. */
+    int currentline;    /* Current line number. */
+    sds cbuf;   /* Debugger client command buffer. */
+    size_t maxlen;  /* Max var dump / reply length. */
+    int maxlen_hint_sent; /* Did we already hint about "set maxlen"? */
+} ldb;
+
+/* ---------------------------------------------------------------------------
+ * Utility functions.
+ * ------------------------------------------------------------------------- */
+
+/* Perform the SHA1 of the input string. We use this both for hashing script
+ * bodies in order to obtain the Lua function name, and in the implementation
+ * of redis.sha1().
+ *
+ * 'digest' should point to a 41 bytes buffer: 40 for SHA1 converted into an
+ * hexadecimal number, plus 1 byte for null term. */
+void sha1hex(char *digest, char *script, size_t len) {
+    SHA1_CTX ctx;
+    unsigned char hash[20];
+    char *cset = "0123456789abcdef";
+    int j;
+
+    SHA1Init(&ctx);
+    SHA1Update(&ctx,(unsigned char*)script,len);
+    SHA1Final(hash,&ctx);
+
+    for (j = 0; j < 20; j++) {
+        digest[j*2] = cset[((hash[j]&0xF0)>>4)];
+        digest[j*2+1] = cset[(hash[j]&0xF)];
+    }
+    digest[40] = '\0';
+}
+
+/* ---------------------------------------------------------------------------
+ * Redis reply to Lua type conversion functions.
+ * ------------------------------------------------------------------------- */
+
+/* Take a Redis reply in the Redis protocol format and convert it into a
+ * Lua type. Thanks to this function, and the introduction of not connected
+ * clients, it is trivial to implement the redis() lua function.
+ *
+ * Basically we take the arguments, execute the Redis command in the context
+ * of a non connected client, then take the generated reply and convert it
+ * into a suitable Lua type. With this trick the scripting feature does not
+ * need the introduction of a full Redis internals API. The script
+ * is like a normal client that bypasses all the slow I/O paths.
+ *
+ * Note: in this function we do not do any sanity check as the reply is
+ * generated by Redis directly. This allows us to go faster.
+ *
+ * Errors are returned as a table with a single 'err' field set to the
+ * error string.
+ */
+
+char *redisProtocolToLuaType(lua_State *lua, char* reply) {
+
+    if (!lua_checkstack(lua, 5)) {
+        /*
+         * Increase the Lua stack if needed, to make sure there is enough room
+         * to push 5 elements to the stack. On failure, exit with panic.
+         * Notice that we need, in the worst case, 5 elements because redisProtocolToLuaType_Aggregate
+         * might push 5 elements to the Lua stack.*/
+        serverPanic("lua stack limit reach when parsing redis.call reply");
+    }
+
+    char *p = reply;
+
+    switch(*p) {
+    case ':': p = redisProtocolToLuaType_Int(lua,reply); break;
+    case '$': p = redisProtocolToLuaType_Bulk(lua,reply); break;
+    case '+': p = redisProtocolToLuaType_Status(lua,reply); break;
+    case '-': p = redisProtocolToLuaType_Error(lua,reply); break;
+    case '*': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
+    case '%': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
+    case '~': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
+    case '_': p = redisProtocolToLuaType_Null(lua,reply); break;
+    case '#': p = redisProtocolToLuaType_Bool(lua,reply,p[1]); break;
+    case ',': p = redisProtocolToLuaType_Double(lua,reply); break;
+    }
+    return p;
+}
+
+char *redisProtocolToLuaType_Int(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long value;
+
+    string2ll(reply+1,p-reply-1,&value);
+    lua_pushnumber(lua,(lua_Number)value);
+    return p+2;
+}
+
+char *redisProtocolToLuaType_Bulk(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long bulklen;
+
+    string2ll(reply+1,p-reply-1,&bulklen);
+    if (bulklen == -1) {
+        lua_pushboolean(lua,0);
+        return p+2;
+    } else {
+        lua_pushlstring(lua,p+2,bulklen);
+        return p+2+bulklen+2;
+    }
+}
+
+char *redisProtocolToLuaType_Status(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+
+    lua_newtable(lua);
+    lua_pushstring(lua,"ok");
+    lua_pushlstring(lua,reply+1,p-reply-1);
+    lua_settable(lua,-3);
+    return p+2;
+}
+
+char *redisProtocolToLuaType_Error(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+
+    lua_newtable(lua);
+    lua_pushstring(lua,"err");
+    lua_pushlstring(lua,reply+1,p-reply-1);
+    lua_settable(lua,-3);
+    return p+2;
+}
+
+char *redisProtocolToLuaType_Aggregate(lua_State *lua, char *reply, int atype) {
+    char *p = strchr(reply+1,'\r');
+    long long mbulklen;
+    int j = 0;
+
+    string2ll(reply+1,p-reply-1,&mbulklen);
+    if (server.lua_client->resp == 2 || atype == '*') {
+        p += 2;
+        if (mbulklen == -1) {
+            lua_pushboolean(lua,0);
+            return p;
+        }
+        lua_newtable(lua);
+        for (j = 0; j < mbulklen; j++) {
+            lua_pushnumber(lua,j+1);
+            p = redisProtocolToLuaType(lua,p);
+            lua_settable(lua,-3);
+        }
+    } else if (server.lua_client->resp == 3) {
+        /* Here we handle only Set and Map replies in RESP3 mode, since arrays
+         * follow the above RESP2 code path. Note that those are represented
+         * as a table with the "map" or "set" field populated with the actual
+         * table representing the set or the map type. */
+        p += 2;
+        lua_newtable(lua);
+        lua_pushstring(lua,atype == '%' ? "map" : "set");
+        lua_newtable(lua);
+        for (j = 0; j < mbulklen; j++) {
+            p = redisProtocolToLuaType(lua,p);
+            if (atype == '%') {
+                p = redisProtocolToLuaType(lua,p);
+            } else {
+                if (!lua_checkstack(lua, 1)) {
+                    /* Notice that here we need to check the stack again because the recursive
+                     * call to redisProtocolToLuaType might have use the room allocated in the stack */
+                    serverPanic("lua stack limit reach when parsing redis.call reply");
+                }
+                lua_pushboolean(lua,1);
+            }
+            lua_settable(lua,-3);
+        }
+        lua_settable(lua,-3);
+    }
+    return p;
+}
+
+char *redisProtocolToLuaType_Null(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    lua_pushnil(lua);
+    return p+2;
+}
+
+char *redisProtocolToLuaType_Bool(lua_State *lua, char *reply, int tf) {
+    char *p = strchr(reply+1,'\r');
+    lua_pushboolean(lua,tf == 't');
+    return p+2;
+}
+
+char *redisProtocolToLuaType_Double(lua_State *lua, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    char buf[MAX_LONG_DOUBLE_CHARS+1];
+    size_t len = p-reply-1;
+    double d;
+
+    if (len <= MAX_LONG_DOUBLE_CHARS) {
+        memcpy(buf,reply+1,len);
+        buf[len] = '\0';
+        d = strtod(buf,NULL); /* We expect a valid representation. */
+    } else {
+        d = 0;
+    }
+
+    lua_newtable(lua);
+    lua_pushstring(lua,"double");
+    lua_pushnumber(lua,d);
+    lua_settable(lua,-3);
+    return p+2;
+}
+
+/* This function is used in order to push an error on the Lua stack in the
+ * format used by redis.pcall to return errors, which is a lua table
+ * with a single "err" field set to the error string. Note that this
+ * table is never a valid reply by proper commands, since the returned
+ * tables are otherwise always indexed by integers, never by strings. */
+void luaPushError(lua_State *lua, char *error) {
+    lua_Debug dbg;
+
+    /* If debugging is active and in step mode, log errors resulting from
+     * Redis commands. */
+    if (ldb.active && ldb.step) {
+        ldbLog(sdscatprintf(sdsempty(),"<error> %s",error));
+    }
+
+    lua_newtable(lua);
+    lua_pushstring(lua,"err");
+
+    /* Attempt to figure out where this function was called, if possible */
+    if(lua_getstack(lua, 1, &dbg) && lua_getinfo(lua, "nSl", &dbg)) {
+        sds msg = sdscatprintf(sdsempty(), "%s: %d: %s",
+            dbg.source, dbg.currentline, error);
+        lua_pushstring(lua, msg);
+        sdsfree(msg);
+    } else {
+        lua_pushstring(lua, error);
+    }
+    lua_settable(lua,-3);
+}
+
+/* In case the error set into the Lua stack by luaPushError() was generated
+ * by the non-error-trapping version of redis.pcall(), which is redis.call(),
+ * this function will raise the Lua error so that the execution of the
+ * script will be halted. */
+int luaRaiseError(lua_State *lua) {
+    lua_pushstring(lua,"err");
+    lua_gettable(lua,-2);
+    return lua_error(lua);
+}
+
+/* Sort the array currently in the stack. We do this to make the output
+ * of commands like KEYS or SMEMBERS something deterministic when called
+ * from Lua (to play well with AOf/replication).
+ *
+ * The array is sorted using table.sort itself, and assuming all the
+ * list elements are strings. */
+void luaSortArray(lua_State *lua) {
+    /* Initial Stack: array */
+    lua_getglobal(lua,"table");
+    lua_pushstring(lua,"sort");
+    lua_gettable(lua,-2);       /* Stack: array, table, table.sort */
+    lua_pushvalue(lua,-3);      /* Stack: array, table, table.sort, array */
+    if (lua_pcall(lua,1,0,0)) {
+        /* Stack: array, table, error */
+
+        /* We are not interested in the error, we assume that the problem is
+         * that there are 'false' elements inside the array, so we try
+         * again with a slower function but able to handle this case, that
+         * is: table.sort(table, __redis__compare_helper) */
+        lua_pop(lua,1);             /* Stack: array, table */
+        lua_pushstring(lua,"sort"); /* Stack: array, table, sort */
+        lua_gettable(lua,-2);       /* Stack: array, table, table.sort */
+        lua_pushvalue(lua,-3);      /* Stack: array, table, table.sort, array */
+        lua_getglobal(lua,"__redis__compare_helper");
+        /* Stack: array, table, table.sort, array, __redis__compare_helper */
+        lua_call(lua,2,0);
+    }
+    /* Stack: array (sorted), table */
+    lua_pop(lua,1);             /* Stack: array (sorted) */
+}
+
+/* ---------------------------------------------------------------------------
+ * Lua reply to Redis reply conversion functions.
+ * ------------------------------------------------------------------------- */
+
+/* Reply to client 'c' converting the top element in the Lua stack to a
+ * Redis reply. As a side effect the element is consumed from the stack.  */
+void luaReplyToRedisReply(client *c, lua_State *lua) {
+
+    if (!lua_checkstack(lua, 4)) {
+        /* Increase the Lua stack if needed to make sure there is enough room
+         * to push 4 elements to the stack. On failure, return error.
+         * Notice that we need, in the worst case, 4 elements because returning a map might
+         * require push 4 elements to the Lua stack.*/
+        addReplyErrorFormat(c, "reached lua stack limit");
+        lua_pop(lua,1); /* pop the element from the stack */
+        return;
+    }
+
+    int t = lua_type(lua,-1);
+
+    switch(t) {
+    case LUA_TSTRING:
+        addReplyBulkCBuffer(c,(char*)lua_tostring(lua,-1),lua_strlen(lua,-1));
+        break;
+    case LUA_TBOOLEAN:
+        if (server.lua_client->resp == 2)
+            addReply(c,lua_toboolean(lua,-1) ? shared.cone :
+                                               shared.null[c->resp]);
+        else
+            addReplyBool(c,lua_toboolean(lua,-1));
+        break;
+    case LUA_TNUMBER:
+        addReplyLongLong(c,(long long)lua_tonumber(lua,-1));
+        break;
+    case LUA_TTABLE:
+        /* We need to check if it is an array, an error, or a status reply.
+         * Error are returned as a single element table with 'err' field.
+         * Status replies are returned as single element table with 'ok'
+         * field. */
+
+        /* Handle error reply. */
+        /* we took care of the stack size on function start */
+        lua_pushstring(lua,"err");
+        lua_gettable(lua,-2);
+        t = lua_type(lua,-1);
+        if (t == LUA_TSTRING) {
+            addReplyErrorFormat(c,"-%s",lua_tostring(lua,-1));
+            lua_pop(lua,2);
+            return;
+        }
+        lua_pop(lua,1); /* Discard field name pushed before. */
+
+        /* Handle status reply. */
+        lua_pushstring(lua,"ok");
+        lua_gettable(lua,-2);
+        t = lua_type(lua,-1);
+        if (t == LUA_TSTRING) {
+            sds ok = sdsnew(lua_tostring(lua,-1));
+            sdsmapchars(ok,"\r\n","  ",2);
+            addReplySds(c,sdscatprintf(sdsempty(),"+%s\r\n",ok));
+            sdsfree(ok);
+            lua_pop(lua,2);
+            return;
+        }
+        lua_pop(lua,1); /* Discard field name pushed before. */
+
+        /* Handle double reply. */
+        lua_pushstring(lua,"double");
+        lua_gettable(lua,-2);
+        t = lua_type(lua,-1);
+        if (t == LUA_TNUMBER) {
+            addReplyDouble(c,lua_tonumber(lua,-1));
+            lua_pop(lua,2);
+            return;
+        }
+        lua_pop(lua,1); /* Discard field name pushed before. */
+
+        /* Handle map reply. */
+        lua_pushstring(lua,"map");
+        lua_gettable(lua,-2);
+        t = lua_type(lua,-1);
+        if (t == LUA_TTABLE) {
+            int maplen = 0;
+            void *replylen = addReplyDeferredLen(c);
+            /* we took care of the stack size on function start */
+            lua_pushnil(lua); /* Use nil to start iteration. */
+            while (lua_next(lua,-2)) {
+                /* Stack now: table, key, value */
+                lua_pushvalue(lua,-2);        /* Dup key before consuming. */
+                luaReplyToRedisReply(c, lua); /* Return key. */
+                luaReplyToRedisReply(c, lua); /* Return value. */
+                /* Stack now: table, key. */
+                maplen++;
+            }
+            setDeferredMapLen(c,replylen,maplen);
+            lua_pop(lua,2);
+            return;
+        }
+        lua_pop(lua,1); /* Discard field name pushed before. */
+
+        /* Handle set reply. */
+        lua_pushstring(lua,"set");
+        lua_gettable(lua,-2);
+        t = lua_type(lua,-1);
+        if (t == LUA_TTABLE) {
+            int setlen = 0;
+            void *replylen = addReplyDeferredLen(c);
+            /* we took care of the stack size on function start */
+            lua_pushnil(lua); /* Use nil to start iteration. */
+            while (lua_next(lua,-2)) {
+                /* Stack now: table, key, true */
+                lua_pop(lua,1);               /* Discard the boolean value. */
+                lua_pushvalue(lua,-1);        /* Dup key before consuming. */
+                luaReplyToRedisReply(c, lua); /* Return key. */
+                /* Stack now: table, key. */
+                setlen++;
+            }
+            setDeferredSetLen(c,replylen,setlen);
+            lua_pop(lua,2);
+            return;
+        }
+        lua_pop(lua,1); /* Discard field name pushed before. */
+
+        /* Handle the array reply. */
+        void *replylen = addReplyDeferredLen(c);
+        int j = 1, mbulklen = 0;
+        while(1) {
+            /* we took care of the stack size on function start */
+            lua_pushnumber(lua,j++);
+            lua_gettable(lua,-2);
+            t = lua_type(lua,-1);
+            if (t == LUA_TNIL) {
+                lua_pop(lua,1);
+                break;
+            }
+            luaReplyToRedisReply(c, lua);
+            mbulklen++;
+        }
+        setDeferredArrayLen(c,replylen,mbulklen);
+        break;
+    default:
+        addReplyNull(c);
+    }
+    lua_pop(lua,1);
+}
+
+/* ---------------------------------------------------------------------------
+ * Lua redis.* functions implementations.
+ * ------------------------------------------------------------------------- */
+
+#define LUA_CMD_OBJCACHE_SIZE 32
+#define LUA_CMD_OBJCACHE_MAX_LEN 64
+int luaRedisGenericCommand(lua_State *lua, int raise_error) {
+    int j, argc = lua_gettop(lua);
+    struct redisCommand *cmd;
+    client *c = server.lua_client;
+    sds reply;
+
+    /* Cached across calls. */
+    static robj **argv = NULL;
+    static int argv_size = 0;
+    static robj *cached_objects[LUA_CMD_OBJCACHE_SIZE];
+    static size_t cached_objects_len[LUA_CMD_OBJCACHE_SIZE];
+    static int inuse = 0;   /* Recursive calls detection. */
+
+    /* By using Lua debug hooks it is possible to trigger a recursive call
+     * to luaRedisGenericCommand(), which normally should never happen.
+     * To make this function reentrant is futile and makes it slower, but
+     * we should at least detect such a misuse, and abort. */
+    if (inuse) {
+        char *recursion_warning =
+            "luaRedisGenericCommand() recursive call detected. "
+            "Are you doing funny stuff with Lua debug hooks?";
+        serverLog(LL_WARNING,"%s",recursion_warning);
+        luaPushError(lua,recursion_warning);
+        return 1;
+    }
+    inuse++;
+
+    /* Require at least one argument */
+    if (argc == 0) {
+        luaPushError(lua,
+            "Please specify at least one argument for redis.call()");
+        inuse--;
+        return raise_error ? luaRaiseError(lua) : 1;
+    }
+
+    /* Build the arguments vector */
+    if (argv_size < argc) {
+        argv = zrealloc(argv,sizeof(robj*)*argc);
+        argv_size = argc;
+    }
+
+    for (j = 0; j < argc; j++) {
+        char *obj_s;
+        size_t obj_len;
+        char dbuf[64];
+
+        if (lua_type(lua,j+1) == LUA_TNUMBER) {
+            /* We can't use lua_tolstring() for number -> string conversion
+             * since Lua uses a format specifier that loses precision. */
+            lua_Number num = lua_tonumber(lua,j+1);
+
+            obj_len = snprintf(dbuf,sizeof(dbuf),"%.17g",(double)num);
+            obj_s = dbuf;
+        } else {
+            obj_s = (char*)lua_tolstring(lua,j+1,&obj_len);
+            if (obj_s == NULL) break; /* Not a string. */
+        }
+
+        /* Try to use a cached object. */
+        if (j < LUA_CMD_OBJCACHE_SIZE && cached_objects[j] &&
+            cached_objects_len[j] >= obj_len)
+        {
+            sds s = cached_objects[j]->ptr;
+            argv[j] = cached_objects[j];
+            cached_objects[j] = NULL;
+            memcpy(s,obj_s,obj_len+1);
+            sdssetlen(s, obj_len);
+        } else {
+            argv[j] = createStringObject(obj_s, obj_len);
+        }
+    }
+
+    /* Check if one of the arguments passed by the Lua script
+     * is not a string or an integer (lua_isstring() return true for
+     * integers as well). */
+    if (j != argc) {
+        j--;
+        while (j >= 0) {
+            decrRefCount(argv[j]);
+            j--;
+        }
+        luaPushError(lua,
+            "Lua redis() command arguments must be strings or integers");
+        inuse--;
+        return raise_error ? luaRaiseError(lua) : 1;
+    }
+
+    /* Setup our fake client for command execution */
+    c->argv = argv;
+    c->argc = argc;
+    c->user = server.lua_caller->user;
+
+    /* Process module hooks */
+    moduleCallCommandFilters(c);
+    argv = c->argv;
+    argc = c->argc;
+
+    /* Log the command if debugging is active. */
+    if (ldb.active && ldb.step) {
+        sds cmdlog = sdsnew("<redis>");
+        for (j = 0; j < c->argc; j++) {
+            if (j == 10) {
+                cmdlog = sdscatprintf(cmdlog," ... (%d more)",
+                    c->argc-j-1);
+                break;
+            } else {
+                cmdlog = sdscatlen(cmdlog," ",1);
+                cmdlog = sdscatsds(cmdlog,c->argv[j]->ptr);
+            }
+        }
+        ldbLog(cmdlog);
+    }
+
+    /* Command lookup */
+    cmd = lookupCommand(argv[0]->ptr);
+    if (!cmd || ((cmd->arity > 0 && cmd->arity != argc) ||
+                   (argc < -cmd->arity)))
+    {
+        if (cmd)
+            luaPushError(lua,
+                "Wrong number of args calling Redis command From Lua script");
+        else
+            luaPushError(lua,"Unknown Redis command called from Lua script");
+        goto cleanup;
+    }
+    c->cmd = c->lastcmd = cmd;
+
+    /* There are commands that are not allowed inside scripts. */
+    if (cmd->flags & CMD_NOSCRIPT) {
+        luaPushError(lua, "This Redis command is not allowed from scripts");
+        goto cleanup;
+    }
+
+    /* Check the ACLs. */
+    int acl_errpos;
+    int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
+    if (acl_retval != ACL_OK) {
+        addACLLogEntry(c,acl_retval,acl_errpos,NULL);
+        switch (acl_retval) {
+        case ACL_DENIED_CMD:
+            luaPushError(lua, "The user executing the script can't run this "
+                              "command or subcommand");
+            break;
+        case ACL_DENIED_KEY:
+            luaPushError(lua, "The user executing the script can't access "
+                              "at least one of the keys mentioned in the "
+                              "command arguments");
+            break;
+        case ACL_DENIED_CHANNEL:
+            luaPushError(lua, "The user executing the script can't publish "
+                              "to the channel mentioned in the command");
+            break;
+        default:
+            luaPushError(lua, "The user executing the script is lacking the "
+                              "permissions for the command");
+            break;
+        }
+        goto cleanup;
+    }
+
+    /* Write commands are forbidden against read-only slaves, or if a
+     * command marked as non-deterministic was already called in the context
+     * of this script. */
+    if (cmd->flags & CMD_WRITE) {
+        int deny_write_type = writeCommandsDeniedByDiskError();
+        if (server.lua_random_dirty && !server.lua_replicate_commands) {
+            luaPushError(lua,
+                "Write commands not allowed after non deterministic commands. Call redis.replicate_commands() at the start of your script in order to switch to single commands replication mode.");
+            goto cleanup;
+        } else if (server.masterhost && server.repl_slave_ro &&
+                   !server.loading &&
+                   !(server.lua_caller->flags & CLIENT_MASTER))
+        {
+            luaPushError(lua, shared.roslaveerr->ptr);
+            goto cleanup;
+        } else if (deny_write_type != DISK_ERROR_TYPE_NONE) {
+            if (deny_write_type == DISK_ERROR_TYPE_RDB) {
+                luaPushError(lua, shared.bgsaveerr->ptr);
+            } else {
+                sds aof_write_err = sdscatfmt(sdsempty(),
+                    "-MISCONF Errors writing to the AOF file: %s\r\n",
+                    strerror(server.aof_last_write_errno));
+                luaPushError(lua, aof_write_err);
+                sdsfree(aof_write_err);
+            }
+            goto cleanup;
+        }
+    }
+
+    /* If we reached the memory limit configured via maxmemory, commands that
+     * could enlarge the memory usage are not allowed, but only if this is the
+     * first write in the context of this script, otherwise we can't stop
+     * in the middle. */
+    if (server.maxmemory &&             /* Maxmemory is actually enabled. */
+        !server.loading &&              /* Don't care about mem if loading. */
+        !server.masterhost &&           /* Slave must execute the script. */
+        server.lua_write_dirty == 0 &&  /* Script had no side effects so far. */
+        server.lua_oom &&               /* Detected OOM when script start. */
+        (cmd->flags & CMD_DENYOOM))
+    {
+        luaPushError(lua, shared.oomerr->ptr);
+        goto cleanup;
+    }
+
+    if (cmd->flags & CMD_RANDOM) server.lua_random_dirty = 1;
+    if (cmd->flags & CMD_WRITE) server.lua_write_dirty = 1;
+
+    /* If this is a Redis Cluster node, we need to make sure Lua is not
+     * trying to access non-local keys, with the exception of commands
+     * received from our master or when loading the AOF back in memory. */
+    if (server.cluster_enabled && !server.loading &&
+        !(server.lua_caller->flags & CLIENT_MASTER))
+    {
+        int error_code;
+        /* Duplicate relevant flags in the lua client. */
+        c->flags &= ~(CLIENT_READONLY|CLIENT_ASKING);
+        c->flags |= server.lua_caller->flags & (CLIENT_READONLY|CLIENT_ASKING);
+        if (getNodeByQuery(c,c->cmd,c->argv,c->argc,NULL,&error_code) !=
+                           server.cluster->myself)
+        {
+            if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) {
+                luaPushError(lua,
+                    "Lua script attempted to execute a write command while the "
+                    "cluster is down and readonly");
+            } else if (error_code == CLUSTER_REDIR_DOWN_STATE) {
+                luaPushError(lua,
+                    "Lua script attempted to execute a command while the "
+                    "cluster is down");
+            } else {
+                luaPushError(lua,
+                    "Lua script attempted to access a non local key in a "
+                    "cluster node");
+            }
+
+            goto cleanup;
+        }
+    }
+
+    /* If we are using single commands replication, we need to wrap what
+     * we propagate into a MULTI/EXEC block, so that it will be atomic like
+     * a Lua script in the context of AOF and slaves. */
+    if (server.lua_replicate_commands &&
+        !server.lua_multi_emitted &&
+        !(server.lua_caller->flags & CLIENT_MULTI) &&
+        server.lua_write_dirty &&
+        server.lua_repl != PROPAGATE_NONE)
+    {
+        execCommandPropagateMulti(server.lua_caller->db->id);
+        server.lua_multi_emitted = 1;
+        /* Now we are in the MULTI context, the lua_client should be
+         * flag as CLIENT_MULTI. */
+        c->flags |= CLIENT_MULTI;
+    }
+
+    /* Run the command */
+    int call_flags = CMD_CALL_SLOWLOG | CMD_CALL_STATS;
+    if (server.lua_replicate_commands) {
+        /* Set flags according to redis.set_repl() settings. */
+        if (server.lua_repl & PROPAGATE_AOF)
+            call_flags |= CMD_CALL_PROPAGATE_AOF;
+        if (server.lua_repl & PROPAGATE_REPL)
+            call_flags |= CMD_CALL_PROPAGATE_REPL;
+    }
+    call(c,call_flags);
+    serverAssert((c->flags & CLIENT_BLOCKED) == 0);
+
+    /* Convert the result of the Redis command into a suitable Lua type.
+     * The first thing we need is to create a single string from the client
+     * output buffers. */
+    if (listLength(c->reply) == 0 && c->bufpos < PROTO_REPLY_CHUNK_BYTES) {
+        /* This is a fast path for the common case of a reply inside the
+         * client static buffer. Don't create an SDS string but just use
+         * the client buffer directly. */
+        c->buf[c->bufpos] = '\0';
+        reply = c->buf;
+        c->bufpos = 0;
+    } else {
+        reply = sdsnewlen(c->buf,c->bufpos);
+        c->bufpos = 0;
+        while(listLength(c->reply)) {
+            clientReplyBlock *o = listNodeValue(listFirst(c->reply));
+
+            reply = sdscatlen(reply,o->buf,o->used);
+            listDelNode(c->reply,listFirst(c->reply));
+        }
+    }
+    if (raise_error && reply[0] != '-') raise_error = 0;
+    redisProtocolToLuaType(lua,reply);
+
+    /* If the debugger is active, log the reply from Redis. */
+    if (ldb.active && ldb.step)
+        ldbLogRedisReply(reply);
+
+    /* Sort the output array if needed, assuming it is a non-null multi bulk
+     * reply as expected. */
+    if ((cmd->flags & CMD_SORT_FOR_SCRIPT) &&
+        (server.lua_replicate_commands == 0) &&
+        (reply[0] == '*' && reply[1] != '-')) {
+            luaSortArray(lua);
+    }
+    if (reply != c->buf) sdsfree(reply);
+    c->reply_bytes = 0;
+
+cleanup:
+    /* Clean up. Command code may have changed argv/argc so we use the
+     * argv/argc of the client instead of the local variables. */
+    for (j = 0; j < c->argc; j++) {
+        robj *o = c->argv[j];
+
+        /* Try to cache the object in the cached_objects array.
+         * The object must be small, SDS-encoded, and with refcount = 1
+         * (we must be the only owner) for us to cache it. */
+        if (j < LUA_CMD_OBJCACHE_SIZE &&
+            o->refcount == 1 &&
+            (o->encoding == OBJ_ENCODING_RAW ||
+             o->encoding == OBJ_ENCODING_EMBSTR) &&
+            sdslen(o->ptr) <= LUA_CMD_OBJCACHE_MAX_LEN)
+        {
+            sds s = o->ptr;
+            if (cached_objects[j]) decrRefCount(cached_objects[j]);
+            cached_objects[j] = o;
+            cached_objects_len[j] = sdsalloc(s);
+        } else {
+            decrRefCount(o);
+        }
+    }
+
+    if (c->argv != argv) {
+        zfree(c->argv);
+        argv = NULL;
+        argv_size = 0;
+    }
+
+    c->user = NULL;
+
+    if (raise_error) {
+        /* If we are here we should have an error in the stack, in the
+         * form of a table with an "err" field. Extract the string to
+         * return the plain error. */
+        inuse--;
+        return luaRaiseError(lua);
+    }
+    inuse--;
+    return 1;
+}
+
+/* redis.call() */
+int luaRedisCallCommand(lua_State *lua) {
+    return luaRedisGenericCommand(lua,1);
+}
+
+/* redis.pcall() */
+int luaRedisPCallCommand(lua_State *lua) {
+    return luaRedisGenericCommand(lua,0);
+}
+
+/* This adds redis.sha1hex(string) to Lua scripts using the same hashing
+ * function used for sha1ing lua scripts. */
+int luaRedisSha1hexCommand(lua_State *lua) {
+    int argc = lua_gettop(lua);
+    char digest[41];
+    size_t len;
+    char *s;
+
+    if (argc != 1) {
+        lua_pushstring(lua, "wrong number of arguments");
+        return lua_error(lua);
+    }
+
+    s = (char*)lua_tolstring(lua,1,&len);
+    sha1hex(digest,s,len);
+    lua_pushstring(lua,digest);
+    return 1;
+}
+
+/* Returns a table with a single field 'field' set to the string value
+ * passed as argument. This helper function is handy when returning
+ * a Redis Protocol error or status reply from Lua:
+ *
+ * return redis.error_reply("ERR Some Error")
+ * return redis.status_reply("ERR Some Error")
+ */
+int luaRedisReturnSingleFieldTable(lua_State *lua, char *field) {
+    if (lua_gettop(lua) != 1 || lua_type(lua,-1) != LUA_TSTRING) {
+        luaPushError(lua, "wrong number or type of arguments");
+        return 1;
+    }
+
+    lua_newtable(lua);
+    lua_pushstring(lua, field);
+    lua_pushvalue(lua, -3);
+    lua_settable(lua, -3);
+    return 1;
+}
+
+/* redis.error_reply() */
+int luaRedisErrorReplyCommand(lua_State *lua) {
+    return luaRedisReturnSingleFieldTable(lua,"err");
+}
+
+/* redis.status_reply() */
+int luaRedisStatusReplyCommand(lua_State *lua) {
+    return luaRedisReturnSingleFieldTable(lua,"ok");
+}
+
+/* redis.replicate_commands()
+ *
+ * Turn on single commands replication if the script never called
+ * a write command so far, and returns true. Otherwise if the script
+ * already started to write, returns false and stick to whole scripts
+ * replication, which is our default. */
+int luaRedisReplicateCommandsCommand(lua_State *lua) {
+    if (server.lua_write_dirty) {
+        lua_pushboolean(lua,0);
+    } else {
+        server.lua_replicate_commands = 1;
+        /* When we switch to single commands replication, we can provide
+         * different math.random() sequences at every call, which is what
+         * the user normally expects. */
+        redisSrand48(rand());
+        lua_pushboolean(lua,1);
+    }
+    return 1;
+}
+
+/* redis.breakpoint()
+ *
+ * Allows to stop execution during a debugging session from within
+ * the Lua code implementation, like if a breakpoint was set in the code
+ * immediately after the function. */
+int luaRedisBreakpointCommand(lua_State *lua) {
+    if (ldb.active) {
+        ldb.luabp = 1;
+        lua_pushboolean(lua,1);
+    } else {
+        lua_pushboolean(lua,0);
+    }
+    return 1;
+}
+
+/* redis.debug()
+ *
+ * Log a string message into the output console.
+ * Can take multiple arguments that will be separated by commas.
+ * Nothing is returned to the caller. */
+int luaRedisDebugCommand(lua_State *lua) {
+    if (!ldb.active) return 0;
+    int argc = lua_gettop(lua);
+    sds log = sdscatprintf(sdsempty(),"<debug> line %d: ", ldb.currentline);
+    while(argc--) {
+        log = ldbCatStackValue(log,lua,-1 - argc);
+        if (argc != 0) log = sdscatlen(log,", ",2);
+    }
+    ldbLog(log);
+    return 0;
+}
+
+/* redis.set_repl()
+ *
+ * Set the propagation of write commands executed in the context of the
+ * script to on/off for AOF and slaves. */
+int luaRedisSetReplCommand(lua_State *lua) {
+    int argc = lua_gettop(lua);
+    int flags;
+
+    if (server.lua_replicate_commands == 0) {
+        lua_pushstring(lua, "You can set the replication behavior only after turning on single commands replication with redis.replicate_commands().");
+        return lua_error(lua);
+    } else if (argc != 1) {
+        lua_pushstring(lua, "redis.set_repl() requires two arguments.");
+        return lua_error(lua);
+    }
+
+    flags = lua_tonumber(lua,-1);
+    if ((flags & ~(PROPAGATE_AOF|PROPAGATE_REPL)) != 0) {
+        lua_pushstring(lua, "Invalid replication flags. Use REPL_AOF, REPL_REPLICA, REPL_ALL or REPL_NONE.");
+        return lua_error(lua);
+    }
+    server.lua_repl = flags;
+    return 0;
+}
+
+/* redis.log() */
+int luaLogCommand(lua_State *lua) {
+    int j, argc = lua_gettop(lua);
+    int level;
+    sds log;
+
+    if (argc < 2) {
+        lua_pushstring(lua, "redis.log() requires two arguments or more.");
+        return lua_error(lua);
+    } else if (!lua_isnumber(lua,-argc)) {
+        lua_pushstring(lua, "First argument must be a number (log level).");
+        return lua_error(lua);
+    }
+    level = lua_tonumber(lua,-argc);
+    if (level < LL_DEBUG || level > LL_WARNING) {
+        lua_pushstring(lua, "Invalid debug level.");
+        return lua_error(lua);
+    }
+    if (level < server.verbosity) return 0;
+
+    /* Glue together all the arguments */
+    log = sdsempty();
+    for (j = 1; j < argc; j++) {
+        size_t len;
+        char *s;
+
+        s = (char*)lua_tolstring(lua,(-argc)+j,&len);
+        if (s) {
+            if (j != 1) log = sdscatlen(log," ",1);
+            log = sdscatlen(log,s,len);
+        }
+    }
+    serverLogRaw(level,log);
+    sdsfree(log);
+    return 0;
+}
+
+/* redis.setresp() */
+int luaSetResp(lua_State *lua) {
+    int argc = lua_gettop(lua);
+
+    if (argc != 1) {
+        lua_pushstring(lua, "redis.setresp() requires one argument.");
+        return lua_error(lua);
+    }
+
+    int resp = lua_tonumber(lua,-argc);
+    if (resp != 2 && resp != 3) {
+        lua_pushstring(lua, "RESP version must be 2 or 3.");
+        return lua_error(lua);
+    }
+
+    server.lua_client->resp = resp;
+    return 0;
+}
+
+/* ---------------------------------------------------------------------------
+ * Lua engine initialization and reset.
+ * ------------------------------------------------------------------------- */
+
+void luaLoadLib(lua_State *lua, const char *libname, lua_CFunction luafunc) {
+  lua_pushcfunction(lua, luafunc);
+  lua_pushstring(lua, libname);
+  lua_call(lua, 1, 0);
+}
+
+LUALIB_API int (luaopen_cjson) (lua_State *L);
+LUALIB_API int (luaopen_struct) (lua_State *L);
+LUALIB_API int (luaopen_cmsgpack) (lua_State *L);
+LUALIB_API int (luaopen_bit) (lua_State *L);
+
+void luaLoadLibraries(lua_State *lua) {
+    luaLoadLib(lua, "", luaopen_base);
+    luaLoadLib(lua, LUA_TABLIBNAME, luaopen_table);
+    luaLoadLib(lua, LUA_STRLIBNAME, luaopen_string);
+    luaLoadLib(lua, LUA_MATHLIBNAME, luaopen_math);
+    luaLoadLib(lua, LUA_DBLIBNAME, luaopen_debug);
+    luaLoadLib(lua, "cjson", luaopen_cjson);
+    luaLoadLib(lua, "struct", luaopen_struct);
+    luaLoadLib(lua, "cmsgpack", luaopen_cmsgpack);
+    luaLoadLib(lua, "bit", luaopen_bit);
+
+#if 0 /* Stuff that we don't load currently, for sandboxing concerns. */
+    luaLoadLib(lua, LUA_LOADLIBNAME, luaopen_package);
+    luaLoadLib(lua, LUA_OSLIBNAME, luaopen_os);
+#endif
+}
+
+/* Remove a functions that we don't want to expose to the Redis scripting
+ * environment. */
+void luaRemoveUnsupportedFunctions(lua_State *lua) {
+    lua_pushnil(lua);
+    lua_setglobal(lua,"loadfile");
+    lua_pushnil(lua);
+    lua_setglobal(lua,"dofile");
+}
+
+/* This function installs metamethods in the global table _G that prevent
+ * the creation of globals accidentally.
+ *
+ * It should be the last to be called in the scripting engine initialization
+ * sequence, because it may interact with creation of globals. */
+void scriptingEnableGlobalsProtection(lua_State *lua) {
+    char *s[32];
+    sds code = sdsempty();
+    int j = 0;
+
+    /* strict.lua from: http://metalua.luaforge.net/src/lib/strict.lua.html.
+     * Modified to be adapted to Redis. */
+    s[j++]="local dbg=debug\n";
+    s[j++]="local mt = {}\n";
+    s[j++]="setmetatable(_G, mt)\n";
+    s[j++]="mt.__newindex = function (t, n, v)\n";
+    s[j++]="  if dbg.getinfo(2) then\n";
+    s[j++]="    local w = dbg.getinfo(2, \"S\").what\n";
+    s[j++]="    if w ~= \"main\" and w ~= \"C\" then\n";
+    s[j++]="      error(\"Script attempted to create global variable '\"..tostring(n)..\"'\", 2)\n";
+    s[j++]="    end\n";
+    s[j++]="  end\n";
+    s[j++]="  rawset(t, n, v)\n";
+    s[j++]="end\n";
+    s[j++]="mt.__index = function (t, n)\n";
+    s[j++]="  if dbg.getinfo(2) and dbg.getinfo(2, \"S\").what ~= \"C\" then\n";
+    s[j++]="    error(\"Script attempted to access nonexistent global variable '\"..tostring(n)..\"'\", 2)\n";
+    s[j++]="  end\n";
+    s[j++]="  return rawget(t, n)\n";
+    s[j++]="end\n";
+    s[j++]="debug = nil\n";
+    s[j++]=NULL;
+
+    for (j = 0; s[j] != NULL; j++) code = sdscatlen(code,s[j],strlen(s[j]));
+    luaL_loadbuffer(lua,code,sdslen(code),"@enable_strict_lua");
+    lua_pcall(lua,0,0,0);
+    sdsfree(code);
+}
+
+/* Initialize the scripting environment.
+ *
+ * This function is called the first time at server startup with
+ * the 'setup' argument set to 1.
+ *
+ * It can be called again multiple times during the lifetime of the Redis
+ * process, with 'setup' set to 0, and following a scriptingRelease() call,
+ * in order to reset the Lua scripting environment.
+ *
+ * However it is simpler to just call scriptingReset() that does just that. */
+void scriptingInit(int setup) {
+    lua_State *lua = lua_open();
+
+    if (setup) {
+        server.lua_client = NULL;
+        server.lua_caller = NULL;
+        server.lua_cur_script = NULL;
+        server.lua_timedout = 0;
+        ldbInit();
+    }
+
+    luaLoadLibraries(lua);
+    luaRemoveUnsupportedFunctions(lua);
+
+    /* Initialize a dictionary we use to map SHAs to scripts.
+     * This is useful for replication, as we need to replicate EVALSHA
+     * as EVAL, so we need to remember the associated script. */
+    server.lua_scripts = dictCreate(&shaScriptObjectDictType,NULL);
+    server.lua_scripts_mem = 0;
+
+    /* Register the redis commands table and fields */
+    lua_newtable(lua);
+
+    /* redis.call */
+    lua_pushstring(lua,"call");
+    lua_pushcfunction(lua,luaRedisCallCommand);
+    lua_settable(lua,-3);
+
+    /* redis.pcall */
+    lua_pushstring(lua,"pcall");
+    lua_pushcfunction(lua,luaRedisPCallCommand);
+    lua_settable(lua,-3);
+
+    /* redis.log and log levels. */
+    lua_pushstring(lua,"log");
+    lua_pushcfunction(lua,luaLogCommand);
+    lua_settable(lua,-3);
+
+    /* redis.setresp */
+    lua_pushstring(lua,"setresp");
+    lua_pushcfunction(lua,luaSetResp);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"LOG_DEBUG");
+    lua_pushnumber(lua,LL_DEBUG);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"LOG_VERBOSE");
+    lua_pushnumber(lua,LL_VERBOSE);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"LOG_NOTICE");
+    lua_pushnumber(lua,LL_NOTICE);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"LOG_WARNING");
+    lua_pushnumber(lua,LL_WARNING);
+    lua_settable(lua,-3);
+
+    /* redis.sha1hex */
+    lua_pushstring(lua, "sha1hex");
+    lua_pushcfunction(lua, luaRedisSha1hexCommand);
+    lua_settable(lua, -3);
+
+    /* redis.error_reply and redis.status_reply */
+    lua_pushstring(lua, "error_reply");
+    lua_pushcfunction(lua, luaRedisErrorReplyCommand);
+    lua_settable(lua, -3);
+    lua_pushstring(lua, "status_reply");
+    lua_pushcfunction(lua, luaRedisStatusReplyCommand);
+    lua_settable(lua, -3);
+
+    /* redis.replicate_commands */
+    lua_pushstring(lua, "replicate_commands");
+    lua_pushcfunction(lua, luaRedisReplicateCommandsCommand);
+    lua_settable(lua, -3);
+
+    /* redis.set_repl and associated flags. */
+    lua_pushstring(lua,"set_repl");
+    lua_pushcfunction(lua,luaRedisSetReplCommand);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"REPL_NONE");
+    lua_pushnumber(lua,PROPAGATE_NONE);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"REPL_AOF");
+    lua_pushnumber(lua,PROPAGATE_AOF);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"REPL_SLAVE");
+    lua_pushnumber(lua,PROPAGATE_REPL);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"REPL_REPLICA");
+    lua_pushnumber(lua,PROPAGATE_REPL);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"REPL_ALL");
+    lua_pushnumber(lua,PROPAGATE_AOF|PROPAGATE_REPL);
+    lua_settable(lua,-3);
+
+    /* redis.breakpoint */
+    lua_pushstring(lua,"breakpoint");
+    lua_pushcfunction(lua,luaRedisBreakpointCommand);
+    lua_settable(lua,-3);
+
+    /* redis.debug */
+    lua_pushstring(lua,"debug");
+    lua_pushcfunction(lua,luaRedisDebugCommand);
+    lua_settable(lua,-3);
+
+    /* Finally set the table as 'redis' global var. */
+    lua_setglobal(lua,"redis");
+
+    /* Replace math.random and math.randomseed with our implementations. */
+    lua_getglobal(lua,"math");
+
+    lua_pushstring(lua,"random");
+    lua_pushcfunction(lua,redis_math_random);
+    lua_settable(lua,-3);
+
+    lua_pushstring(lua,"randomseed");
+    lua_pushcfunction(lua,redis_math_randomseed);
+    lua_settable(lua,-3);
+
+    lua_setglobal(lua,"math");
+
+    /* Add a helper function that we use to sort the multi bulk output of non
+     * deterministic commands, when containing 'false' elements. */
+    {
+        char *compare_func =    "function __redis__compare_helper(a,b)\n"
+                                "  if a == false then a = '' end\n"
+                                "  if b == false then b = '' end\n"
+                                "  return a<b\n"
+                                "end\n";
+        luaL_loadbuffer(lua,compare_func,strlen(compare_func),"@cmp_func_def");
+        lua_pcall(lua,0,0,0);
+    }
+
+    /* Add a helper function we use for pcall error reporting.
+     * Note that when the error is in the C function we want to report the
+     * information about the caller, that's what makes sense from the point
+     * of view of the user debugging a script. */
+    {
+        char *errh_func =       "local dbg = debug\n"
+                                "function __redis__err__handler(err)\n"
+                                "  local i = dbg.getinfo(2,'nSl')\n"
+                                "  if i and i.what == 'C' then\n"
+                                "    i = dbg.getinfo(3,'nSl')\n"
+                                "  end\n"
+                                "  if i then\n"
+                                "    return i.source .. ':' .. i.currentline .. ': ' .. err\n"
+                                "  else\n"
+                                "    return err\n"
+                                "  end\n"
+                                "end\n";
+        luaL_loadbuffer(lua,errh_func,strlen(errh_func),"@err_handler_def");
+        lua_pcall(lua,0,0,0);
+    }
+
+    /* Create the (non connected) client that we use to execute Redis commands
+     * inside the Lua interpreter.
+     * Note: there is no need to create it again when this function is called
+     * by scriptingReset(). */
+    if (server.lua_client == NULL) {
+        server.lua_client = createClient(NULL);
+        server.lua_client->flags |= CLIENT_LUA;
+
+        /* We do not want to allow blocking commands inside Lua */
+        server.lua_client->flags |= CLIENT_DENY_BLOCKING;
+    }
+
+    /* Lua beginners often don't use "local", this is likely to introduce
+     * subtle bugs in their code. To prevent problems we protect accesses
+     * to global variables. */
+    scriptingEnableGlobalsProtection(lua);
+
+    server.lua = lua;
+}
+
+/* Release resources related to Lua scripting.
+ * This function is used in order to reset the scripting environment. */
+void scriptingRelease(int async) {
+    if (async)
+        freeLuaScriptsAsync(server.lua_scripts);
+    else
+        dictRelease(server.lua_scripts);
+    server.lua_scripts_mem = 0;
+    lua_close(server.lua);
+}
+
+void scriptingReset(int async) {
+    scriptingRelease(async);
+    scriptingInit(0);
+}
+
+/* Set an array of Redis String Objects as a Lua array (table) stored into a
+ * global variable. */
+void luaSetGlobalArray(lua_State *lua, char *var, robj **elev, int elec) {
+    int j;
+
+    lua_newtable(lua);
+    for (j = 0; j < elec; j++) {
+        lua_pushlstring(lua,(char*)elev[j]->ptr,sdslen(elev[j]->ptr));
+        lua_rawseti(lua,-2,j+1);
+    }
+    lua_setglobal(lua,var);
+}
+
+/* ---------------------------------------------------------------------------
+ * Redis provided math.random
+ * ------------------------------------------------------------------------- */
+
+/* We replace math.random() with our implementation that is not affected
+ * by specific libc random() implementations and will output the same sequence
+ * (for the same seed) in every arch. */
+
+/* The following implementation is the one shipped with Lua itself but with
+ * rand() replaced by redisLrand48(). */
+int redis_math_random (lua_State *L) {
+  /* the `%' avoids the (rare) case of r==1, and is needed also because on
+     some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
+  lua_Number r = (lua_Number)(redisLrand48()%REDIS_LRAND48_MAX) /
+                                (lua_Number)REDIS_LRAND48_MAX;
+  switch (lua_gettop(L)) {  /* check number of arguments */
+    case 0: {  /* no arguments */
+      lua_pushnumber(L, r);  /* Number between 0 and 1 */
+      break;
+    }
+    case 1: {  /* only upper limit */
+      int u = luaL_checkint(L, 1);
+      luaL_argcheck(L, 1<=u, 1, "interval is empty");
+      lua_pushnumber(L, floor(r*u)+1);  /* int between 1 and `u' */
+      break;
+    }
+    case 2: {  /* lower and upper limits */
+      int l = luaL_checkint(L, 1);
+      int u = luaL_checkint(L, 2);
+      luaL_argcheck(L, l<=u, 2, "interval is empty");
+      lua_pushnumber(L, floor(r*(u-l+1))+l);  /* int between `l' and `u' */
+      break;
+    }
+    default: return luaL_error(L, "wrong number of arguments");
+  }
+  return 1;
+}
+
+int redis_math_randomseed (lua_State *L) {
+  redisSrand48(luaL_checkint(L, 1));
+  return 0;
+}
+
+/* ---------------------------------------------------------------------------
+ * EVAL and SCRIPT commands implementation
+ * ------------------------------------------------------------------------- */
+
+/* Define a Lua function with the specified body.
+ * The function name will be generated in the following form:
+ *
+ *   f_<hex sha1 sum>
+ *
+ * The function increments the reference count of the 'body' object as a
+ * side effect of a successful call.
+ *
+ * On success a pointer to an SDS string representing the function SHA1 of the
+ * just added function is returned (and will be valid until the next call
+ * to scriptingReset() function), otherwise NULL is returned.
+ *
+ * The function handles the fact of being called with a script that already
+ * exists, and in such a case, it behaves like in the success case.
+ *
+ * If 'c' is not NULL, on error the client is informed with an appropriate
+ * error describing the nature of the problem and the Lua interpreter error. */
+sds luaCreateFunction(client *c, lua_State *lua, robj *body) {
+    char funcname[43];
+    dictEntry *de;
+
+    funcname[0] = 'f';
+    funcname[1] = '_';
+    sha1hex(funcname+2,body->ptr,sdslen(body->ptr));
+
+    sds sha = sdsnewlen(funcname+2,40);
+    if ((de = dictFind(server.lua_scripts,sha)) != NULL) {
+        sdsfree(sha);
+        return dictGetKey(de);
+    }
+
+    sds funcdef = sdsempty();
+    funcdef = sdscat(funcdef,"function ");
+    funcdef = sdscatlen(funcdef,funcname,42);
+    funcdef = sdscatlen(funcdef,"() ",3);
+    funcdef = sdscatlen(funcdef,body->ptr,sdslen(body->ptr));
+    funcdef = sdscatlen(funcdef,"\nend",4);
+
+    if (luaL_loadbuffer(lua,funcdef,sdslen(funcdef),"@user_script")) {
+        if (c != NULL) {
+            addReplyErrorFormat(c,
+                "Error compiling script (new function): %s\n",
+                lua_tostring(lua,-1));
+        }
+        lua_pop(lua,1);
+        sdsfree(sha);
+        sdsfree(funcdef);
+        return NULL;
+    }
+    sdsfree(funcdef);
+
+    if (lua_pcall(lua,0,0,0)) {
+        if (c != NULL) {
+            addReplyErrorFormat(c,"Error running script (new function): %s\n",
+                lua_tostring(lua,-1));
+        }
+        lua_pop(lua,1);
+        sdsfree(sha);
+        return NULL;
+    }
+
+    /* We also save a SHA1 -> Original script map in a dictionary
+     * so that we can replicate / write in the AOF all the
+     * EVALSHA commands as EVAL using the original script. */
+    int retval = dictAdd(server.lua_scripts,sha,body);
+    serverAssertWithInfo(c ? c : server.lua_client,NULL,retval == DICT_OK);
+    server.lua_scripts_mem += sdsZmallocSize(sha) + getStringObjectSdsUsedMemory(body);
+    incrRefCount(body);
+    return sha;
+}
+
+/* This is the Lua script "count" hook that we use to detect scripts timeout. */
+void luaMaskCountHook(lua_State *lua, lua_Debug *ar) {
+    long long elapsed = elapsedMs(server.lua_time_start);
+    UNUSED(ar);
+    UNUSED(lua);
+
+    /* Set the timeout condition if not already set and the maximum
+     * execution time was reached. */
+    if (elapsed >= server.lua_time_limit && server.lua_timedout == 0) {
+        serverLog(LL_WARNING,
+            "Lua slow script detected: still in execution after %lld milliseconds. "
+            "You can try killing the script using the SCRIPT KILL command. "
+            "Script SHA1 is: %s",
+            elapsed, server.lua_cur_script);
+        server.lua_timedout = 1;
+        blockingOperationStarts();
+        /* Once the script timeouts we reenter the event loop to permit others
+         * to call SCRIPT KILL or SHUTDOWN NOSAVE if needed. For this reason
+         * we need to mask the client executing the script from the event loop.
+         * If we don't do that the client may disconnect and could no longer be
+         * here when the EVAL command will return. */
+        protectClient(server.lua_caller);
+    }
+    if (server.lua_timedout) processEventsWhileBlocked();
+    if (server.lua_kill) {
+        serverLog(LL_WARNING,"Lua script killed by user with SCRIPT KILL.");
+
+        /*
+         * Set the hook to invoke all the time so the user
+         * will not be able to catch the error with pcall and invoke
+         * pcall again which will prevent the script from ever been killed
+         */
+        lua_sethook(lua, luaMaskCountHook, LUA_MASKLINE, 0);
+
+        lua_pushstring(lua,"Script killed by user with SCRIPT KILL...");
+        lua_error(lua);
+    }
+}
+
+void prepareLuaClient(void) {
+    /* Select the right DB in the context of the Lua client */
+    selectDb(server.lua_client,server.lua_caller->db->id);
+    server.lua_client->resp = 2; /* Default is RESP2, scripts can change it. */
+
+    /* If we are in MULTI context, flag Lua client as CLIENT_MULTI. */
+    if (server.lua_caller->flags & CLIENT_MULTI) {
+        server.lua_client->flags |= CLIENT_MULTI;
+    }
+}
+
+void resetLuaClient(void) {
+    /* After the script done, remove the MULTI state. */
+    server.lua_client->flags &= ~CLIENT_MULTI;
+}
+
+void evalGenericCommand(client *c, int evalsha) {
+    lua_State *lua = server.lua;
+    char funcname[43];
+    long long numkeys;
+    long long initial_server_dirty = server.dirty;
+    int delhook = 0, err;
+
+    /* When we replicate whole scripts, we want the same PRNG sequence at
+     * every call so that our PRNG is not affected by external state. */
+    redisSrand48(0);
+
+    /* We set this flag to zero to remember that so far no random command
+     * was called. This way we can allow the user to call commands like
+     * SRANDMEMBER or RANDOMKEY from Lua scripts as far as no write command
+     * is called (otherwise the replication and AOF would end with non
+     * deterministic sequences).
+     *
+     * Thanks to this flag we'll raise an error every time a write command
+     * is called after a random command was used. */
+    server.lua_random_dirty = 0;
+    server.lua_write_dirty = 0;
+    server.lua_replicate_commands = server.lua_always_replicate_commands;
+    server.lua_multi_emitted = 0;
+    server.lua_repl = PROPAGATE_AOF|PROPAGATE_REPL;
+
+    /* Get the number of arguments that are keys */
+    if (getLongLongFromObjectOrReply(c,c->argv[2],&numkeys,NULL) != C_OK)
+        return;
+    if (numkeys > (c->argc - 3)) {
+        addReplyError(c,"Number of keys can't be greater than number of args");
+        return;
+    } else if (numkeys < 0) {
+        addReplyError(c,"Number of keys can't be negative");
+        return;
+    }
+
+    /* We obtain the script SHA1, then check if this function is already
+     * defined into the Lua state */
+    funcname[0] = 'f';
+    funcname[1] = '_';
+    if (!evalsha) {
+        /* Hash the code if this is an EVAL call */
+        sha1hex(funcname+2,c->argv[1]->ptr,sdslen(c->argv[1]->ptr));
+    } else {
+        /* We already have the SHA if it is an EVALSHA */
+        int j;
+        char *sha = c->argv[1]->ptr;
+
+        /* Convert to lowercase. We don't use tolower since the function
+         * managed to always show up in the profiler output consuming
+         * a non trivial amount of time. */
+        for (j = 0; j < 40; j++)
+            funcname[j+2] = (sha[j] >= 'A' && sha[j] <= 'Z') ?
+                sha[j]+('a'-'A') : sha[j];
+        funcname[42] = '\0';
+    }
+
+    /* Push the pcall error handler function on the stack. */
+    lua_getglobal(lua, "__redis__err__handler");
+
+    /* Try to lookup the Lua function */
+    lua_getglobal(lua, funcname);
+    if (lua_isnil(lua,-1)) {
+        lua_pop(lua,1); /* remove the nil from the stack */
+        /* Function not defined... let's define it if we have the
+         * body of the function. If this is an EVALSHA call we can just
+         * return an error. */
+        if (evalsha) {
+            lua_pop(lua,1); /* remove the error handler from the stack. */
+            addReplyErrorObject(c, shared.noscripterr);
+            return;
+        }
+        if (luaCreateFunction(c,lua,c->argv[1]) == NULL) {
+            lua_pop(lua,1); /* remove the error handler from the stack. */
+            /* The error is sent to the client by luaCreateFunction()
+             * itself when it returns NULL. */
+            return;
+        }
+        /* Now the following is guaranteed to return non nil */
+        lua_getglobal(lua, funcname);
+        serverAssert(!lua_isnil(lua,-1));
+    }
+
+    /* Populate the argv and keys table accordingly to the arguments that
+     * EVAL received. */
+    luaSetGlobalArray(lua,"KEYS",c->argv+3,numkeys);
+    luaSetGlobalArray(lua,"ARGV",c->argv+3+numkeys,c->argc-3-numkeys);
+
+    /* Set a hook in order to be able to stop the script execution if it
+     * is running for too much time.
+     * We set the hook only if the time limit is enabled as the hook will
+     * make the Lua script execution slower.
+     *
+     * If we are debugging, we set instead a "line" hook so that the
+     * debugger is call-back at every line executed by the script. */
+    server.in_eval = 1;
+    server.lua_caller = c;
+    server.lua_cur_script = funcname + 2;
+    server.lua_time_start = getMonotonicUs();
+    server.lua_time_snapshot = mstime();
+    server.lua_kill = 0;
+    if (server.lua_time_limit > 0 && ldb.active == 0) {
+        lua_sethook(lua,luaMaskCountHook,LUA_MASKCOUNT,100000);
+        delhook = 1;
+    } else if (ldb.active) {
+        lua_sethook(server.lua,luaLdbLineHook,LUA_MASKLINE|LUA_MASKCOUNT,100000);
+        delhook = 1;
+    }
+
+    prepareLuaClient();
+
+    /* At this point whether this script was never seen before or if it was
+     * already defined, we can call it. We have zero arguments and expect
+     * a single return value. */
+    err = lua_pcall(lua,0,1,-2);
+
+    resetLuaClient();
+
+    /* Perform some cleanup that we need to do both on error and success. */
+    if (delhook) lua_sethook(lua,NULL,0,0); /* Disable hook */
+    if (server.lua_timedout) {
+        server.lua_timedout = 0;
+        blockingOperationEnds();
+        /* Restore the client that was protected when the script timeout
+         * was detected. */
+        unprotectClient(c);
+        if (server.masterhost && server.master)
+            queueClientForReprocessing(server.master);
+    }
+    server.in_eval = 0;
+    server.lua_caller = NULL;
+    server.lua_cur_script = NULL;
+
+    /* Call the Lua garbage collector from time to time to avoid a
+     * full cycle performed by Lua, which adds too latency.
+     *
+     * The call is performed every LUA_GC_CYCLE_PERIOD executed commands
+     * (and for LUA_GC_CYCLE_PERIOD collection steps) because calling it
+     * for every command uses too much CPU. */
+    #define LUA_GC_CYCLE_PERIOD 50
+    {
+        static long gc_count = 0;
+
+        gc_count++;
+        if (gc_count == LUA_GC_CYCLE_PERIOD) {
+            lua_gc(lua,LUA_GCSTEP,LUA_GC_CYCLE_PERIOD);
+            gc_count = 0;
+        }
+    }
+
+    if (err) {
+        addReplyErrorFormat(c,"Error running script (call to %s): %s\n",
+            funcname, lua_tostring(lua,-1));
+        lua_pop(lua,2); /* Consume the Lua reply and remove error handler. */
+    } else {
+        /* On success convert the Lua return value into Redis protocol, and
+         * send it to * the client. */
+        luaReplyToRedisReply(c,lua); /* Convert and consume the reply. */
+        lua_pop(lua,1); /* Remove the error handler. */
+    }
+
+    /* If we are using single commands replication, emit EXEC if there
+     * was at least a write. */
+    if (server.lua_replicate_commands) {
+        preventCommandPropagation(c);
+        if (server.lua_multi_emitted) {
+            execCommandPropagateExec(c->db->id);
+        }
+    }
+
+    /* EVALSHA should be propagated to Slave and AOF file as full EVAL, unless
+     * we are sure that the script was already in the context of all the
+     * attached slaves *and* the current AOF file if enabled.
+     *
+     * To do so we use a cache of SHA1s of scripts that we already propagated
+     * as full EVAL, that's called the Replication Script Cache.
+     *
+     * For replication, everytime a new slave attaches to the master, we need to
+     * flush our cache of scripts that can be replicated as EVALSHA, while
+     * for AOF we need to do so every time we rewrite the AOF file. */
+    if (evalsha && !server.lua_replicate_commands) {
+        if (!replicationScriptCacheExists(c->argv[1]->ptr)) {
+            /* This script is not in our script cache, replicate it as
+             * EVAL, then add it into the script cache, as from now on
+             * slaves and AOF know about it. */
+            robj *script = dictFetchValue(server.lua_scripts,c->argv[1]->ptr);
+
+            replicationScriptCacheAdd(c->argv[1]->ptr);
+            serverAssertWithInfo(c,NULL,script != NULL);
+
+            /* If the script did not produce any changes in the dataset we want
+             * just to replicate it as SCRIPT LOAD, otherwise we risk running
+             * an aborted script on slaves (that may then produce results there)
+             * or just running a CPU costly read-only script on the slaves. */
+            if (server.dirty == initial_server_dirty) {
+                rewriteClientCommandVector(c,3,
+                    shared.script,
+                    shared.load,
+                    script);
+            } else {
+                rewriteClientCommandArgument(c,0,shared.eval);
+                rewriteClientCommandArgument(c,1,script);
+            }
+            forceCommandPropagation(c,PROPAGATE_REPL|PROPAGATE_AOF);
+        }
+    }
+}
+
+void evalCommand(client *c) {
+    /* Explicitly feed monitor here so that lua commands appear after their
+     * script command. */
+    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
+    if (!(c->flags & CLIENT_LUA_DEBUG))
+        evalGenericCommand(c,0);
+    else
+        evalGenericCommandWithDebugging(c,0);
+}
+
+void evalShaCommand(client *c) {
+    /* Explicitly feed monitor here so that lua commands appear after their
+     * script command. */
+    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
+    if (sdslen(c->argv[1]->ptr) != 40) {
+        /* We know that a match is not possible if the provided SHA is
+         * not the right length. So we return an error ASAP, this way
+         * evalGenericCommand() can be implemented without string length
+         * sanity check */
+        addReplyErrorObject(c, shared.noscripterr);
+        return;
+    }
+    if (!(c->flags & CLIENT_LUA_DEBUG))
+        evalGenericCommand(c,1);
+    else {
+        addReplyError(c,"Please use EVAL instead of EVALSHA for debugging");
+        return;
+    }
+}
+
+void scriptCommand(client *c) {
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"DEBUG (YES|SYNC|NO)",
+"    Set the debug mode for subsequent scripts executed.",
+"EXISTS <sha1> [<sha1> ...]",
+"    Return information about the existence of the scripts in the script cache.",
+"FLUSH [ASYNC|SYNC]",
+"    Flush the Lua scripts cache. Very dangerous on replicas.",
+"    When called without the optional mode argument, the behavior is determined by the",
+"    lazyfree-lazy-user-flush configuration directive. Valid modes are:",
+"    * ASYNC: Asynchronously flush the scripts cache.",
+"    * SYNC: Synchronously flush the scripts cache.",
+"KILL",
+"    Kill the currently executing Lua script.",
+"LOAD <script>",
+"    Load a script into the scripts cache without executing it.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (c->argc >= 2 && !strcasecmp(c->argv[1]->ptr,"flush")) {
+        int async = 0;
+        if (c->argc == 3 && !strcasecmp(c->argv[2]->ptr,"sync")) {
+            async = 0;
+        } else if (c->argc == 3 && !strcasecmp(c->argv[2]->ptr,"async")) {
+            async = 1;
+        } else if (c->argc == 2) {
+            async = server.lazyfree_lazy_user_flush ? 1 : 0;
+        } else {
+            addReplyError(c,"SCRIPT FLUSH only support SYNC|ASYNC option");
+            return;
+        }
+        scriptingReset(async);
+        addReply(c,shared.ok);
+        replicationScriptCacheFlush();
+        server.dirty++; /* Propagating this command is a good idea. */
+    } else if (c->argc >= 2 && !strcasecmp(c->argv[1]->ptr,"exists")) {
+        int j;
+
+        addReplyArrayLen(c, c->argc-2);
+        for (j = 2; j < c->argc; j++) {
+            if (dictFind(server.lua_scripts,c->argv[j]->ptr))
+                addReply(c,shared.cone);
+            else
+                addReply(c,shared.czero);
+        }
+    } else if (c->argc == 3 && !strcasecmp(c->argv[1]->ptr,"load")) {
+        sds sha = luaCreateFunction(c,server.lua,c->argv[2]);
+        if (sha == NULL) return; /* The error was sent by luaCreateFunction(). */
+        addReplyBulkCBuffer(c,sha,40);
+        forceCommandPropagation(c,PROPAGATE_REPL|PROPAGATE_AOF);
+    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"kill")) {
+        if (server.lua_caller == NULL) {
+            addReplyError(c,"-NOTBUSY No scripts in execution right now.");
+        } else if (server.lua_caller->flags & CLIENT_MASTER) {
+            addReplyError(c,"-UNKILLABLE The busy script was sent by a master instance in the context of replication and cannot be killed.");
+        } else if (server.lua_write_dirty) {
+            addReplyError(c,"-UNKILLABLE Sorry the script already executed write commands against the dataset. You can either wait the script termination or kill the server in a hard way using the SHUTDOWN NOSAVE command.");
+        } else {
+            server.lua_kill = 1;
+            addReply(c,shared.ok);
+        }
+    } else if (c->argc == 3 && !strcasecmp(c->argv[1]->ptr,"debug")) {
+        if (clientHasPendingReplies(c)) {
+            addReplyError(c,"SCRIPT DEBUG must be called outside a pipeline");
+            return;
+        }
+        if (!strcasecmp(c->argv[2]->ptr,"no")) {
+            ldbDisable(c);
+            addReply(c,shared.ok);
+        } else if (!strcasecmp(c->argv[2]->ptr,"yes")) {
+            ldbEnable(c);
+            addReply(c,shared.ok);
+        } else if (!strcasecmp(c->argv[2]->ptr,"sync")) {
+            ldbEnable(c);
+            addReply(c,shared.ok);
+            c->flags |= CLIENT_LUA_DEBUG_SYNC;
+        } else {
+            addReplyError(c,"Use SCRIPT DEBUG YES/SYNC/NO");
+            return;
+        }
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* ---------------------------------------------------------------------------
+ * LDB: Redis Lua debugging facilities
+ * ------------------------------------------------------------------------- */
+
+/* Initialize Lua debugger data structures. */
+void ldbInit(void) {
+    ldb.conn = NULL;
+    ldb.active = 0;
+    ldb.logs = listCreate();
+    listSetFreeMethod(ldb.logs,(void (*)(void*))sdsfree);
+    ldb.children = listCreate();
+    ldb.src = NULL;
+    ldb.lines = 0;
+    ldb.cbuf = sdsempty();
+}
+
+/* Remove all the pending messages in the specified list. */
+void ldbFlushLog(list *log) {
+    listNode *ln;
+
+    while((ln = listFirst(log)) != NULL)
+        listDelNode(log,ln);
+}
+
+/* Enable debug mode of Lua scripts for this client. */
+void ldbEnable(client *c) {
+    c->flags |= CLIENT_LUA_DEBUG;
+    ldbFlushLog(ldb.logs);
+    ldb.conn = c->conn;
+    ldb.step = 1;
+    ldb.bpcount = 0;
+    ldb.luabp = 0;
+    sdsfree(ldb.cbuf);
+    ldb.cbuf = sdsempty();
+    ldb.maxlen = LDB_MAX_LEN_DEFAULT;
+    ldb.maxlen_hint_sent = 0;
+}
+
+/* Exit debugging mode from the POV of client. This function is not enough
+ * to properly shut down a client debugging session, see ldbEndSession()
+ * for more information. */
+void ldbDisable(client *c) {
+    c->flags &= ~(CLIENT_LUA_DEBUG|CLIENT_LUA_DEBUG_SYNC);
+}
+
+/* Append a log entry to the specified LDB log. */
+void ldbLog(sds entry) {
+    listAddNodeTail(ldb.logs,entry);
+}
+
+/* A version of ldbLog() which prevents producing logs greater than
+ * ldb.maxlen. The first time the limit is reached a hint is generated
+ * to inform the user that reply trimming can be disabled using the
+ * debugger "maxlen" command. */
+void ldbLogWithMaxLen(sds entry) {
+    int trimmed = 0;
+    if (ldb.maxlen && sdslen(entry) > ldb.maxlen) {
+        sdsrange(entry,0,ldb.maxlen-1);
+        entry = sdscatlen(entry," ...",4);
+        trimmed = 1;
+    }
+    ldbLog(entry);
+    if (trimmed && ldb.maxlen_hint_sent == 0) {
+        ldb.maxlen_hint_sent = 1;
+        ldbLog(sdsnew(
+        "<hint> The above reply was trimmed. Use 'maxlen 0' to disable trimming."));
+    }
+}
+
+/* Send ldb.logs to the debugging client as a multi-bulk reply
+ * consisting of simple strings. Log entries which include newlines have them
+ * replaced with spaces. The entries sent are also consumed. */
+void ldbSendLogs(void) {
+    sds proto = sdsempty();
+    proto = sdscatfmt(proto,"*%i\r\n", (int)listLength(ldb.logs));
+    while(listLength(ldb.logs)) {
+        listNode *ln = listFirst(ldb.logs);
+        proto = sdscatlen(proto,"+",1);
+        sdsmapchars(ln->value,"\r\n","  ",2);
+        proto = sdscatsds(proto,ln->value);
+        proto = sdscatlen(proto,"\r\n",2);
+        listDelNode(ldb.logs,ln);
+    }
+    if (connWrite(ldb.conn,proto,sdslen(proto)) == -1) {
+        /* Avoid warning. We don't check the return value of write()
+         * since the next read() will catch the I/O error and will
+         * close the debugging session. */
+    }
+    sdsfree(proto);
+}
+
+/* Start a debugging session before calling EVAL implementation.
+ * The technique we use is to capture the client socket file descriptor,
+ * in order to perform direct I/O with it from within Lua hooks. This
+ * way we don't have to re-enter Redis in order to handle I/O.
+ *
+ * The function returns 1 if the caller should proceed to call EVAL,
+ * and 0 if instead the caller should abort the operation (this happens
+ * for the parent in a forked session, since it's up to the children
+ * to continue, or when fork returned an error).
+ *
+ * The caller should call ldbEndSession() only if ldbStartSession()
+ * returned 1. */
+int ldbStartSession(client *c) {
+    ldb.forked = (c->flags & CLIENT_LUA_DEBUG_SYNC) == 0;
+    if (ldb.forked) {
+        pid_t cp = redisFork(CHILD_TYPE_LDB);
+        if (cp == -1) {
+            addReplyError(c,"Fork() failed: can't run EVAL in debugging mode.");
+            return 0;
+        } else if (cp == 0) {
+            /* Child. Let's ignore important signals handled by the parent. */
+            struct sigaction act;
+            sigemptyset(&act.sa_mask);
+            act.sa_flags = 0;
+            act.sa_handler = SIG_IGN;
+            sigaction(SIGTERM, &act, NULL);
+            sigaction(SIGINT, &act, NULL);
+
+            /* Log the creation of the child and close the listening
+             * socket to make sure if the parent crashes a reset is sent
+             * to the clients. */
+            serverLog(LL_WARNING,"Redis forked for debugging eval");
+        } else {
+            /* Parent */
+            listAddNodeTail(ldb.children,(void*)(unsigned long)cp);
+            freeClientAsync(c); /* Close the client in the parent side. */
+            return 0;
+        }
+    } else {
+        serverLog(LL_WARNING,
+            "Redis synchronous debugging eval session started");
+    }
+
+    /* Setup our debugging session. */
+    connBlock(ldb.conn);
+    connSendTimeout(ldb.conn,5000);
+    ldb.active = 1;
+
+    /* First argument of EVAL is the script itself. We split it into different
+     * lines since this is the way the debugger accesses the source code. */
+    sds srcstring = sdsdup(c->argv[1]->ptr);
+    size_t srclen = sdslen(srcstring);
+    while(srclen && (srcstring[srclen-1] == '\n' ||
+                     srcstring[srclen-1] == '\r'))
+    {
+        srcstring[--srclen] = '\0';
+    }
+    sdssetlen(srcstring,srclen);
+    ldb.src = sdssplitlen(srcstring,sdslen(srcstring),"\n",1,&ldb.lines);
+    sdsfree(srcstring);
+    return 1;
+}
+
+/* End a debugging session after the EVAL call with debugging enabled
+ * returned. */
+void ldbEndSession(client *c) {
+    /* Emit the remaining logs and an <endsession> mark. */
+    ldbLog(sdsnew("<endsession>"));
+    ldbSendLogs();
+
+    /* If it's a fork()ed session, we just exit. */
+    if (ldb.forked) {
+        writeToClient(c,0);
+        serverLog(LL_WARNING,"Lua debugging session child exiting");
+        exitFromChild(0);
+    } else {
+        serverLog(LL_WARNING,
+            "Redis synchronous debugging eval session ended");
+    }
+
+    /* Otherwise let's restore client's state. */
+    connNonBlock(ldb.conn);
+    connSendTimeout(ldb.conn,0);
+
+    /* Close the client connection after sending the final EVAL reply
+     * in order to signal the end of the debugging session. */
+    c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+
+    /* Cleanup. */
+    sdsfreesplitres(ldb.src,ldb.lines);
+    ldb.lines = 0;
+    ldb.active = 0;
+}
+
+/* If the specified pid is among the list of children spawned for
+ * forked debugging sessions, it is removed from the children list.
+ * If the pid was found non-zero is returned. */
+int ldbRemoveChild(pid_t pid) {
+    listNode *ln = listSearchKey(ldb.children,(void*)(unsigned long)pid);
+    if (ln) {
+        listDelNode(ldb.children,ln);
+        return 1;
+    }
+    return 0;
+}
+
+/* Return the number of children we still did not receive termination
+ * acknowledge via wait() in the parent process. */
+int ldbPendingChildren(void) {
+    return listLength(ldb.children);
+}
+
+/* Kill all the forked sessions. */
+void ldbKillForkedSessions(void) {
+    listIter li;
+    listNode *ln;
+
+    listRewind(ldb.children,&li);
+    while((ln = listNext(&li))) {
+        pid_t pid = (unsigned long) ln->value;
+        serverLog(LL_WARNING,"Killing debugging session %ld",(long)pid);
+        kill(pid,SIGKILL);
+    }
+    listRelease(ldb.children);
+    ldb.children = listCreate();
+}
+
+/* Wrapper for EVAL / EVALSHA that enables debugging, and makes sure
+ * that when EVAL returns, whatever happened, the session is ended. */
+void evalGenericCommandWithDebugging(client *c, int evalsha) {
+    if (ldbStartSession(c)) {
+        evalGenericCommand(c,evalsha);
+        ldbEndSession(c);
+    } else {
+        ldbDisable(c);
+    }
+}
+
+/* Return a pointer to ldb.src source code line, considering line to be
+ * one-based, and returning a special string for out of range lines. */
+char *ldbGetSourceLine(int line) {
+    int idx = line-1;
+    if (idx < 0 || idx >= ldb.lines) return "<out of range source code line>";
+    return ldb.src[idx];
+}
+
+/* Return true if there is a breakpoint in the specified line. */
+int ldbIsBreakpoint(int line) {
+    int j;
+
+    for (j = 0; j < ldb.bpcount; j++)
+        if (ldb.bp[j] == line) return 1;
+    return 0;
+}
+
+/* Add the specified breakpoint. Ignore it if we already reached the max.
+ * Returns 1 if the breakpoint was added (or was already set). 0 if there is
+ * no space for the breakpoint or if the line is invalid. */
+int ldbAddBreakpoint(int line) {
+    if (line <= 0 || line > ldb.lines) return 0;
+    if (!ldbIsBreakpoint(line) && ldb.bpcount != LDB_BREAKPOINTS_MAX) {
+        ldb.bp[ldb.bpcount++] = line;
+        return 1;
+    }
+    return 0;
+}
+
+/* Remove the specified breakpoint, returning 1 if the operation was
+ * performed or 0 if there was no such breakpoint. */
+int ldbDelBreakpoint(int line) {
+    int j;
+
+    for (j = 0; j < ldb.bpcount; j++) {
+        if (ldb.bp[j] == line) {
+            ldb.bpcount--;
+            memmove(ldb.bp+j,ldb.bp+j+1,ldb.bpcount-j);
+            return 1;
+        }
+    }
+    return 0;
+}
+
+/* Expect a valid multi-bulk command in the debugging client query buffer.
+ * On success the command is parsed and returned as an array of SDS strings,
+ * otherwise NULL is returned and there is to read more buffer. */
+sds *ldbReplParseCommand(int *argcp, char** err) {
+    static char* protocol_error = "protocol error";
+    sds *argv = NULL;
+    int argc = 0;
+    if (sdslen(ldb.cbuf) == 0) return NULL;
+
+    /* Working on a copy is simpler in this case. We can modify it freely
+     * for the sake of simpler parsing. */
+    sds copy = sdsdup(ldb.cbuf);
+    char *p = copy;
+
+    /* This Redis protocol parser is a joke... just the simplest thing that
+     * works in this context. It is also very forgiving regarding broken
+     * protocol. */
+
+    /* Seek and parse *<count>\r\n. */
+    p = strchr(p,'*'); if (!p) goto protoerr;
+    char *plen = p+1; /* Multi bulk len pointer. */
+    p = strstr(p,"\r\n"); if (!p) goto keep_reading;
+    *p = '\0'; p += 2;
+    *argcp = atoi(plen);
+    if (*argcp <= 0 || *argcp > 1024) goto protoerr;
+
+    /* Parse each argument. */
+    argv = zmalloc(sizeof(sds)*(*argcp));
+    argc = 0;
+    while(argc < *argcp) {
+        /* reached the end but there should be more data to read */
+        if (*p == '\0') goto keep_reading;
+
+        if (*p != '$') goto protoerr;
+        plen = p+1; /* Bulk string len pointer. */
+        p = strstr(p,"\r\n"); if (!p) goto keep_reading;
+        *p = '\0'; p += 2;
+        int slen = atoi(plen); /* Length of this arg. */
+        if (slen <= 0 || slen > 1024) goto protoerr;
+        if ((size_t)(p + slen + 2 - copy) > sdslen(copy) ) goto keep_reading;
+        argv[argc++] = sdsnewlen(p,slen);
+        p += slen; /* Skip the already parsed argument. */
+        if (p[0] != '\r' || p[1] != '\n') goto protoerr;
+        p += 2; /* Skip \r\n. */
+    }
+    sdsfree(copy);
+    return argv;
+
+protoerr:
+    *err = protocol_error;
+keep_reading:
+    sdsfreesplitres(argv,argc);
+    sdsfree(copy);
+    return NULL;
+}
+
+/* Log the specified line in the Lua debugger output. */
+void ldbLogSourceLine(int lnum) {
+    char *line = ldbGetSourceLine(lnum);
+    char *prefix;
+    int bp = ldbIsBreakpoint(lnum);
+    int current = ldb.currentline == lnum;
+
+    if (current && bp)
+        prefix = "->#";
+    else if (current)
+        prefix = "-> ";
+    else if (bp)
+        prefix = "  #";
+    else
+        prefix = "   ";
+    sds thisline = sdscatprintf(sdsempty(),"%s%-3d %s", prefix, lnum, line);
+    ldbLog(thisline);
+}
+
+/* Implement the "list" command of the Lua debugger. If around is 0
+ * the whole file is listed, otherwise only a small portion of the file
+ * around the specified line is shown. When a line number is specified
+ * the amount of context (lines before/after) is specified via the
+ * 'context' argument. */
+void ldbList(int around, int context) {
+    int j;
+
+    for (j = 1; j <= ldb.lines; j++) {
+        if (around != 0 && abs(around-j) > context) continue;
+        ldbLogSourceLine(j);
+    }
+}
+
+/* Append a human readable representation of the Lua value at position 'idx'
+ * on the stack of the 'lua' state, to the SDS string passed as argument.
+ * The new SDS string with the represented value attached is returned.
+ * Used in order to implement ldbLogStackValue().
+ *
+ * The element is not automatically removed from the stack, nor it is
+ * converted to a different type. */
+#define LDB_MAX_VALUES_DEPTH (LUA_MINSTACK/2)
+sds ldbCatStackValueRec(sds s, lua_State *lua, int idx, int level) {
+    int t = lua_type(lua,idx);
+
+    if (level++ == LDB_MAX_VALUES_DEPTH)
+        return sdscat(s,"<max recursion level reached! Nested table?>");
+
+    switch(t) {
+    case LUA_TSTRING:
+        {
+        size_t strl;
+        char *strp = (char*)lua_tolstring(lua,idx,&strl);
+        s = sdscatrepr(s,strp,strl);
+        }
+        break;
+    case LUA_TBOOLEAN:
+        s = sdscat(s,lua_toboolean(lua,idx) ? "true" : "false");
+        break;
+    case LUA_TNUMBER:
+        s = sdscatprintf(s,"%g",(double)lua_tonumber(lua,idx));
+        break;
+    case LUA_TNIL:
+        s = sdscatlen(s,"nil",3);
+        break;
+    case LUA_TTABLE:
+        {
+        int expected_index = 1; /* First index we expect in an array. */
+        int is_array = 1; /* Will be set to null if check fails. */
+        /* Note: we create two representations at the same time, one
+         * assuming the table is an array, one assuming it is not. At the
+         * end we know what is true and select the right one. */
+        sds repr1 = sdsempty();
+        sds repr2 = sdsempty();
+        lua_pushnil(lua); /* The first key to start the iteration is nil. */
+        while (lua_next(lua,idx-1)) {
+            /* Test if so far the table looks like an array. */
+            if (is_array &&
+                (lua_type(lua,-2) != LUA_TNUMBER ||
+                 lua_tonumber(lua,-2) != expected_index)) is_array = 0;
+            /* Stack now: table, key, value */
+            /* Array repr. */
+            repr1 = ldbCatStackValueRec(repr1,lua,-1,level);
+            repr1 = sdscatlen(repr1,"; ",2);
+            /* Full repr. */
+            repr2 = sdscatlen(repr2,"[",1);
+            repr2 = ldbCatStackValueRec(repr2,lua,-2,level);
+            repr2 = sdscatlen(repr2,"]=",2);
+            repr2 = ldbCatStackValueRec(repr2,lua,-1,level);
+            repr2 = sdscatlen(repr2,"; ",2);
+            lua_pop(lua,1); /* Stack: table, key. Ready for next iteration. */
+            expected_index++;
+        }
+        /* Strip the last " ;" from both the representations. */
+        if (sdslen(repr1)) sdsrange(repr1,0,-3);
+        if (sdslen(repr2)) sdsrange(repr2,0,-3);
+        /* Select the right one and discard the other. */
+        s = sdscatlen(s,"{",1);
+        s = sdscatsds(s,is_array ? repr1 : repr2);
+        s = sdscatlen(s,"}",1);
+        sdsfree(repr1);
+        sdsfree(repr2);
+        }
+        break;
+    case LUA_TFUNCTION:
+    case LUA_TUSERDATA:
+    case LUA_TTHREAD:
+    case LUA_TLIGHTUSERDATA:
+        {
+        const void *p = lua_topointer(lua,idx);
+        char *typename = "unknown";
+        if (t == LUA_TFUNCTION) typename = "function";
+        else if (t == LUA_TUSERDATA) typename = "userdata";
+        else if (t == LUA_TTHREAD) typename = "thread";
+        else if (t == LUA_TLIGHTUSERDATA) typename = "light-userdata";
+        s = sdscatprintf(s,"\"%s@%p\"",typename,p);
+        }
+        break;
+    default:
+        s = sdscat(s,"\"<unknown-lua-type>\"");
+        break;
+    }
+    return s;
+}
+
+/* Higher level wrapper for ldbCatStackValueRec() that just uses an initial
+ * recursion level of '0'. */
+sds ldbCatStackValue(sds s, lua_State *lua, int idx) {
+    return ldbCatStackValueRec(s,lua,idx,0);
+}
+
+/* Produce a debugger log entry representing the value of the Lua object
+ * currently on the top of the stack. The element is ot popped nor modified.
+ * Check ldbCatStackValue() for the actual implementation. */
+void ldbLogStackValue(lua_State *lua, char *prefix) {
+    sds s = sdsnew(prefix);
+    s = ldbCatStackValue(s,lua,-1);
+    ldbLogWithMaxLen(s);
+}
+
+char *ldbRedisProtocolToHuman_Int(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Bulk(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Status(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_MultiBulk(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Set(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Map(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Null(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Bool(sds *o, char *reply);
+char *ldbRedisProtocolToHuman_Double(sds *o, char *reply);
+
+/* Get Redis protocol from 'reply' and appends it in human readable form to
+ * the passed SDS string 'o'.
+ *
+ * Note that the SDS string is passed by reference (pointer of pointer to
+ * char*) so that we can return a modified pointer, as for SDS semantics. */
+char *ldbRedisProtocolToHuman(sds *o, char *reply) {
+    char *p = reply;
+    switch(*p) {
+    case ':': p = ldbRedisProtocolToHuman_Int(o,reply); break;
+    case '$': p = ldbRedisProtocolToHuman_Bulk(o,reply); break;
+    case '+': p = ldbRedisProtocolToHuman_Status(o,reply); break;
+    case '-': p = ldbRedisProtocolToHuman_Status(o,reply); break;
+    case '*': p = ldbRedisProtocolToHuman_MultiBulk(o,reply); break;
+    case '~': p = ldbRedisProtocolToHuman_Set(o,reply); break;
+    case '%': p = ldbRedisProtocolToHuman_Map(o,reply); break;
+    case '_': p = ldbRedisProtocolToHuman_Null(o,reply); break;
+    case '#': p = ldbRedisProtocolToHuman_Bool(o,reply); break;
+    case ',': p = ldbRedisProtocolToHuman_Double(o,reply); break;
+    }
+    return p;
+}
+
+/* The following functions are helpers for ldbRedisProtocolToHuman(), each
+ * take care of a given Redis return type. */
+
+char *ldbRedisProtocolToHuman_Int(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    *o = sdscatlen(*o,reply+1,p-reply-1);
+    return p+2;
+}
+
+char *ldbRedisProtocolToHuman_Bulk(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long bulklen;
+
+    string2ll(reply+1,p-reply-1,&bulklen);
+    if (bulklen == -1) {
+        *o = sdscatlen(*o,"NULL",4);
+        return p+2;
+    } else {
+        *o = sdscatrepr(*o,p+2,bulklen);
+        return p+2+bulklen+2;
+    }
+}
+
+char *ldbRedisProtocolToHuman_Status(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+
+    *o = sdscatrepr(*o,reply,p-reply);
+    return p+2;
+}
+
+char *ldbRedisProtocolToHuman_MultiBulk(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long mbulklen;
+    int j = 0;
+
+    string2ll(reply+1,p-reply-1,&mbulklen);
+    p += 2;
+    if (mbulklen == -1) {
+        *o = sdscatlen(*o,"NULL",4);
+        return p;
+    }
+    *o = sdscatlen(*o,"[",1);
+    for (j = 0; j < mbulklen; j++) {
+        p = ldbRedisProtocolToHuman(o,p);
+        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
+    }
+    *o = sdscatlen(*o,"]",1);
+    return p;
+}
+
+char *ldbRedisProtocolToHuman_Set(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long mbulklen;
+    int j = 0;
+
+    string2ll(reply+1,p-reply-1,&mbulklen);
+    p += 2;
+    *o = sdscatlen(*o,"~(",2);
+    for (j = 0; j < mbulklen; j++) {
+        p = ldbRedisProtocolToHuman(o,p);
+        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
+    }
+    *o = sdscatlen(*o,")",1);
+    return p;
+}
+
+char *ldbRedisProtocolToHuman_Map(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    long long mbulklen;
+    int j = 0;
+
+    string2ll(reply+1,p-reply-1,&mbulklen);
+    p += 2;
+    *o = sdscatlen(*o,"{",1);
+    for (j = 0; j < mbulklen; j++) {
+        p = ldbRedisProtocolToHuman(o,p);
+        *o = sdscatlen(*o," => ",4);
+        p = ldbRedisProtocolToHuman(o,p);
+        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
+    }
+    *o = sdscatlen(*o,"}",1);
+    return p;
+}
+
+char *ldbRedisProtocolToHuman_Null(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    *o = sdscatlen(*o,"(null)",6);
+    return p+2;
+}
+
+char *ldbRedisProtocolToHuman_Bool(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    if (reply[1] == 't')
+        *o = sdscatlen(*o,"#true",5);
+    else
+        *o = sdscatlen(*o,"#false",6);
+    return p+2;
+}
+
+char *ldbRedisProtocolToHuman_Double(sds *o, char *reply) {
+    char *p = strchr(reply+1,'\r');
+    *o = sdscatlen(*o,"(double) ",9);
+    *o = sdscatlen(*o,reply+1,p-reply-1);
+    return p+2;
+}
+
+/* Log a Redis reply as debugger output, in a human readable format.
+ * If the resulting string is longer than 'len' plus a few more chars
+ * used as prefix, it gets truncated. */
+void ldbLogRedisReply(char *reply) {
+    sds log = sdsnew("<reply> ");
+    ldbRedisProtocolToHuman(&log,reply);
+    ldbLogWithMaxLen(log);
+}
+
+/* Implements the "print <var>" command of the Lua debugger. It scans for Lua
+ * var "varname" starting from the current stack frame up to the top stack
+ * frame. The first matching variable is printed. */
+void ldbPrint(lua_State *lua, char *varname) {
+    lua_Debug ar;
+
+    int l = 0; /* Stack level. */
+    while (lua_getstack(lua,l,&ar) != 0) {
+        l++;
+        const char *name;
+        int i = 1; /* Variable index. */
+        while((name = lua_getlocal(lua,&ar,i)) != NULL) {
+            i++;
+            if (strcmp(varname,name) == 0) {
+                ldbLogStackValue(lua,"<value> ");
+                lua_pop(lua,1);
+                return;
+            } else {
+                lua_pop(lua,1); /* Discard the var name on the stack. */
+            }
+        }
+    }
+
+    /* Let's try with global vars in two selected cases */
+    if (!strcmp(varname,"ARGV") || !strcmp(varname,"KEYS")) {
+        lua_getglobal(lua, varname);
+        ldbLogStackValue(lua,"<value> ");
+        lua_pop(lua,1);
+    } else {
+        ldbLog(sdsnew("No such variable."));
+    }
+}
+
+/* Implements the "print" command (without arguments) of the Lua debugger.
+ * Prints all the variables in the current stack frame. */
+void ldbPrintAll(lua_State *lua) {
+    lua_Debug ar;
+    int vars = 0;
+
+    if (lua_getstack(lua,0,&ar) != 0) {
+        const char *name;
+        int i = 1; /* Variable index. */
+        while((name = lua_getlocal(lua,&ar,i)) != NULL) {
+            i++;
+            if (!strstr(name,"(*temporary)")) {
+                sds prefix = sdscatprintf(sdsempty(),"<value> %s = ",name);
+                ldbLogStackValue(lua,prefix);
+                sdsfree(prefix);
+                vars++;
+            }
+            lua_pop(lua,1);
+        }
+    }
+
+    if (vars == 0) {
+        ldbLog(sdsnew("No local variables in the current context."));
+    }
+}
+
+/* Implements the break command to list, add and remove breakpoints. */
+void ldbBreak(sds *argv, int argc) {
+    if (argc == 1) {
+        if (ldb.bpcount == 0) {
+            ldbLog(sdsnew("No breakpoints set. Use 'b <line>' to add one."));
+            return;
+        } else {
+            ldbLog(sdscatfmt(sdsempty(),"%i breakpoints set:",ldb.bpcount));
+            int j;
+            for (j = 0; j < ldb.bpcount; j++)
+                ldbLogSourceLine(ldb.bp[j]);
+        }
+    } else {
+        int j;
+        for (j = 1; j < argc; j++) {
+            char *arg = argv[j];
+            long line;
+            if (!string2l(arg,sdslen(arg),&line)) {
+                ldbLog(sdscatfmt(sdsempty(),"Invalid argument:'%s'",arg));
+            } else {
+                if (line == 0) {
+                    ldb.bpcount = 0;
+                    ldbLog(sdsnew("All breakpoints removed."));
+                } else if (line > 0) {
+                    if (ldb.bpcount == LDB_BREAKPOINTS_MAX) {
+                        ldbLog(sdsnew("Too many breakpoints set."));
+                    } else if (ldbAddBreakpoint(line)) {
+                        ldbList(line,1);
+                    } else {
+                        ldbLog(sdsnew("Wrong line number."));
+                    }
+                } else if (line < 0) {
+                    if (ldbDelBreakpoint(-line))
+                        ldbLog(sdsnew("Breakpoint removed."));
+                    else
+                        ldbLog(sdsnew("No breakpoint in the specified line."));
+                }
+            }
+        }
+    }
+}
+
+/* Implements the Lua debugger "eval" command. It just compiles the user
+ * passed fragment of code and executes it, showing the result left on
+ * the stack. */
+void ldbEval(lua_State *lua, sds *argv, int argc) {
+    /* Glue the script together if it is composed of multiple arguments. */
+    sds code = sdsjoinsds(argv+1,argc-1," ",1);
+    sds expr = sdscatsds(sdsnew("return "),code);
+
+    /* Try to compile it as an expression, prepending "return ". */
+    if (luaL_loadbuffer(lua,expr,sdslen(expr),"@ldb_eval")) {
+        lua_pop(lua,1);
+        /* Failed? Try as a statement. */
+        if (luaL_loadbuffer(lua,code,sdslen(code),"@ldb_eval")) {
+            ldbLog(sdscatfmt(sdsempty(),"<error> %s",lua_tostring(lua,-1)));
+            lua_pop(lua,1);
+            sdsfree(code);
+            sdsfree(expr);
+            return;
+        }
+    }
+
+    /* Call it. */
+    sdsfree(code);
+    sdsfree(expr);
+    if (lua_pcall(lua,0,1,0)) {
+        ldbLog(sdscatfmt(sdsempty(),"<error> %s",lua_tostring(lua,-1)));
+        lua_pop(lua,1);
+        return;
+    }
+    ldbLogStackValue(lua,"<retval> ");
+    lua_pop(lua,1);
+}
+
+/* Implement the debugger "redis" command. We use a trick in order to make
+ * the implementation very simple: we just call the Lua redis.call() command
+ * implementation, with ldb.step enabled, so as a side effect the Redis command
+ * and its reply are logged. */
+void ldbRedis(lua_State *lua, sds *argv, int argc) {
+    int j, saved_rc = server.lua_replicate_commands;
+
+    if (!lua_checkstack(lua, argc + 1)) {
+        /* Increase the Lua stack if needed to make sure there is enough room
+         * to push 'argc + 1' elements to the stack. On failure, return error.
+         * Notice that we need, in worst case, 'argc + 1' elements because we push all the arguments
+         * given by the user (without the first argument) and we also push the 'redis' global table and
+         * 'redis.call' function so:
+         * (1 (redis table)) + (1 (redis.call function)) + (argc - 1 (all arguments without the first)) = argc + 1*/
+        ldbLogRedisReply("max lua stack reached");
+        return;
+    }
+
+    lua_getglobal(lua,"redis");
+    lua_pushstring(lua,"call");
+    lua_gettable(lua,-2);       /* Stack: redis, redis.call */
+    for (j = 1; j < argc; j++)
+        lua_pushlstring(lua,argv[j],sdslen(argv[j]));
+    ldb.step = 1;               /* Force redis.call() to log. */
+    server.lua_replicate_commands = 1;
+    lua_pcall(lua,argc-1,1,0);  /* Stack: redis, result */
+    ldb.step = 0;               /* Disable logging. */
+    server.lua_replicate_commands = saved_rc;
+    lua_pop(lua,2);             /* Discard the result and clean the stack. */
+}
+
+/* Implements "trace" command of the Lua debugger. It just prints a backtrace
+ * querying Lua starting from the current callframe back to the outer one. */
+void ldbTrace(lua_State *lua) {
+    lua_Debug ar;
+    int level = 0;
+
+    while(lua_getstack(lua,level,&ar)) {
+        lua_getinfo(lua,"Snl",&ar);
+        if(strstr(ar.short_src,"user_script") != NULL) {
+            ldbLog(sdscatprintf(sdsempty(),"%s %s:",
+                (level == 0) ? "In" : "From",
+                ar.name ? ar.name : "top level"));
+            ldbLogSourceLine(ar.currentline);
+        }
+        level++;
+    }
+    if (level == 0) {
+        ldbLog(sdsnew("<error> Can't retrieve Lua stack."));
+    }
+}
+
+/* Implements the debugger "maxlen" command. It just queries or sets the
+ * ldb.maxlen variable. */
+void ldbMaxlen(sds *argv, int argc) {
+    if (argc == 2) {
+        int newval = atoi(argv[1]);
+        ldb.maxlen_hint_sent = 1; /* User knows about this command. */
+        if (newval != 0 && newval <= 60) newval = 60;
+        ldb.maxlen = newval;
+    }
+    if (ldb.maxlen) {
+        ldbLog(sdscatprintf(sdsempty(),"<value> replies are truncated at %d bytes.",(int)ldb.maxlen));
+    } else {
+        ldbLog(sdscatprintf(sdsempty(),"<value> replies are unlimited."));
+    }
+}
+
+/* Read debugging commands from client.
+ * Return C_OK if the debugging session is continuing, otherwise
+ * C_ERR if the client closed the connection or is timing out. */
+int ldbRepl(lua_State *lua) {
+    sds *argv;
+    int argc;
+    char* err = NULL;
+
+    /* We continue processing commands until a command that should return
+     * to the Lua interpreter is found. */
+    while(1) {
+        while((argv = ldbReplParseCommand(&argc, &err)) == NULL) {
+            char buf[1024];
+            if (err) {
+                lua_pushstring(lua, err);
+                lua_error(lua);
+            }
+            int nread = connRead(ldb.conn,buf,sizeof(buf));
+            if (nread <= 0) {
+                /* Make sure the script runs without user input since the
+                 * client is no longer connected. */
+                ldb.step = 0;
+                ldb.bpcount = 0;
+                return C_ERR;
+            }
+            ldb.cbuf = sdscatlen(ldb.cbuf,buf,nread);
+            /* after 1M we will exit with an error
+             * so that the client will not blow the memory
+             */
+            if (sdslen(ldb.cbuf) > 1<<20) {
+                sdsfree(ldb.cbuf);
+                ldb.cbuf = sdsempty();
+                lua_pushstring(lua, "max client buffer reached");
+                lua_error(lua);
+            }
+        }
+
+        /* Flush the old buffer. */
+        sdsfree(ldb.cbuf);
+        ldb.cbuf = sdsempty();
+
+        /* Execute the command. */
+        if (!strcasecmp(argv[0],"h") || !strcasecmp(argv[0],"help")) {
+ldbLog(sdsnew("Redis Lua debugger help:"));
+ldbLog(sdsnew("[h]elp               Show this help."));
+ldbLog(sdsnew("[s]tep               Run current line and stop again."));
+ldbLog(sdsnew("[n]ext               Alias for step."));
+ldbLog(sdsnew("[c]continue          Run till next breakpoint."));
+ldbLog(sdsnew("[l]list              List source code around current line."));
+ldbLog(sdsnew("[l]list [line]       List source code around [line]."));
+ldbLog(sdsnew("                     line = 0 means: current position."));
+ldbLog(sdsnew("[l]list [line] [ctx] In this form [ctx] specifies how many lines"));
+ldbLog(sdsnew("                     to show before/after [line]."));
+ldbLog(sdsnew("[w]hole              List all source code. Alias for 'list 1 1000000'."));
+ldbLog(sdsnew("[p]rint              Show all the local variables."));
+ldbLog(sdsnew("[p]rint <var>        Show the value of the specified variable."));
+ldbLog(sdsnew("                     Can also show global vars KEYS and ARGV."));
+ldbLog(sdsnew("[b]reak              Show all breakpoints."));
+ldbLog(sdsnew("[b]reak <line>       Add a breakpoint to the specified line."));
+ldbLog(sdsnew("[b]reak -<line>      Remove breakpoint from the specified line."));
+ldbLog(sdsnew("[b]reak 0            Remove all breakpoints."));
+ldbLog(sdsnew("[t]race              Show a backtrace."));
+ldbLog(sdsnew("[e]eval <code>       Execute some Lua code (in a different callframe)."));
+ldbLog(sdsnew("[r]edis <cmd>        Execute a Redis command."));
+ldbLog(sdsnew("[m]axlen [len]       Trim logged Redis replies and Lua var dumps to len."));
+ldbLog(sdsnew("                     Specifying zero as <len> means unlimited."));
+ldbLog(sdsnew("[a]bort              Stop the execution of the script. In sync"));
+ldbLog(sdsnew("                     mode dataset changes will be retained."));
+ldbLog(sdsnew(""));
+ldbLog(sdsnew("Debugger functions you can call from Lua scripts:"));
+ldbLog(sdsnew("redis.debug()        Produce logs in the debugger console."));
+ldbLog(sdsnew("redis.breakpoint()   Stop execution like if there was a breakpoint in the"));
+ldbLog(sdsnew("                     next line of code."));
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"s") || !strcasecmp(argv[0],"step") ||
+                   !strcasecmp(argv[0],"n") || !strcasecmp(argv[0],"next")) {
+            ldb.step = 1;
+            break;
+        } else if (!strcasecmp(argv[0],"c") || !strcasecmp(argv[0],"continue")){
+            break;
+        } else if (!strcasecmp(argv[0],"t") || !strcasecmp(argv[0],"trace")) {
+            ldbTrace(lua);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"m") || !strcasecmp(argv[0],"maxlen")) {
+            ldbMaxlen(argv,argc);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"b") || !strcasecmp(argv[0],"break")) {
+            ldbBreak(argv,argc);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"e") || !strcasecmp(argv[0],"eval")) {
+            ldbEval(lua,argv,argc);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"a") || !strcasecmp(argv[0],"abort")) {
+            lua_pushstring(lua, "script aborted for user request");
+            lua_error(lua);
+        } else if (argc > 1 &&
+                   (!strcasecmp(argv[0],"r") || !strcasecmp(argv[0],"redis"))) {
+            ldbRedis(lua,argv,argc);
+            ldbSendLogs();
+        } else if ((!strcasecmp(argv[0],"p") || !strcasecmp(argv[0],"print"))) {
+            if (argc == 2)
+                ldbPrint(lua,argv[1]);
+            else
+                ldbPrintAll(lua);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"l") || !strcasecmp(argv[0],"list")){
+            int around = ldb.currentline, ctx = 5;
+            if (argc > 1) {
+                int num = atoi(argv[1]);
+                if (num > 0) around = num;
+            }
+            if (argc > 2) ctx = atoi(argv[2]);
+            ldbList(around,ctx);
+            ldbSendLogs();
+        } else if (!strcasecmp(argv[0],"w") || !strcasecmp(argv[0],"whole")){
+            ldbList(1,1000000);
+            ldbSendLogs();
+        } else {
+            ldbLog(sdsnew("<error> Unknown Redis Lua debugger command or "
+                          "wrong number of arguments."));
+            ldbSendLogs();
+        }
+
+        /* Free the command vector. */
+        sdsfreesplitres(argv,argc);
+    }
+
+    /* Free the current command argv if we break inside the while loop. */
+    sdsfreesplitres(argv,argc);
+    return C_OK;
+}
+
+/* This is the core of our Lua debugger, called each time Lua is about
+ * to start executing a new line. */
+void luaLdbLineHook(lua_State *lua, lua_Debug *ar) {
+    lua_getstack(lua,0,ar);
+    lua_getinfo(lua,"Sl",ar);
+    ldb.currentline = ar->currentline;
+
+    int bp = ldbIsBreakpoint(ldb.currentline) || ldb.luabp;
+    int timeout = 0;
+
+    /* Events outside our script are not interesting. */
+    if(strstr(ar->short_src,"user_script") == NULL) return;
+
+    /* Check if a timeout occurred. */
+    if (ar->event == LUA_HOOKCOUNT && ldb.step == 0 && bp == 0) {
+        mstime_t elapsed = elapsedMs(server.lua_time_start);
+        mstime_t timelimit = server.lua_time_limit ?
+                             server.lua_time_limit : 5000;
+        if (elapsed >= timelimit) {
+            timeout = 1;
+            ldb.step = 1;
+        } else {
+            return; /* No timeout, ignore the COUNT event. */
+        }
+    }
+
+    if (ldb.step || bp) {
+        char *reason = "step over";
+        if (bp) reason = ldb.luabp ? "redis.breakpoint() called" :
+                                     "break point";
+        else if (timeout) reason = "timeout reached, infinite loop?";
+        ldb.step = 0;
+        ldb.luabp = 0;
+        ldbLog(sdscatprintf(sdsempty(),
+            "* Stopped at %d, stop reason = %s",
+            ldb.currentline, reason));
+        ldbLogSourceLine(ldb.currentline);
+        ldbSendLogs();
+        if (ldbRepl(lua) == C_ERR && timeout) {
+            /* If the client closed the connection and we have a timeout
+             * connection, let's kill the script otherwise the process
+             * will remain blocked indefinitely. */
+            lua_pushstring(lua, "timeout during Lua debugging with client closing connection");
+            lua_error(lua);
+        }
+        server.lua_time_start = getMonotonicUs();
+        server.lua_time_snapshot = mstime();
+    }
+}
diff --git a/redis-stable/src/sds.c b/redis-stable/src/sds.c
new file mode 100644
index 00000000..65fb3c71
--- /dev/null
+++ b/redis-stable/src/sds.c
@@ -0,0 +1,1462 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Oran Agra
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <assert.h>
+#include <limits.h>
+#include "sds.h"
+#include "sdsalloc.h"
+
+const char *SDS_NOINIT = "SDS_NOINIT";
+
+static inline int sdsHdrSize(char type) {
+    switch(type&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            return sizeof(struct sdshdr5);
+        case SDS_TYPE_8:
+            return sizeof(struct sdshdr8);
+        case SDS_TYPE_16:
+            return sizeof(struct sdshdr16);
+        case SDS_TYPE_32:
+            return sizeof(struct sdshdr32);
+        case SDS_TYPE_64:
+            return sizeof(struct sdshdr64);
+    }
+    return 0;
+}
+
+static inline char sdsReqType(size_t string_size) {
+    if (string_size < 1<<5)
+        return SDS_TYPE_5;
+    if (string_size < 1<<8)
+        return SDS_TYPE_8;
+    if (string_size < 1<<16)
+        return SDS_TYPE_16;
+#if (LONG_MAX == LLONG_MAX)
+    if (string_size < 1ll<<32)
+        return SDS_TYPE_32;
+    return SDS_TYPE_64;
+#else
+    return SDS_TYPE_32;
+#endif
+}
+
+static inline size_t sdsTypeMaxSize(char type) {
+    if (type == SDS_TYPE_5)
+        return (1<<5) - 1;
+    if (type == SDS_TYPE_8)
+        return (1<<8) - 1;
+    if (type == SDS_TYPE_16)
+        return (1<<16) - 1;
+#if (LONG_MAX == LLONG_MAX)
+    if (type == SDS_TYPE_32)
+        return (1ll<<32) - 1;
+#endif
+    return -1; /* this is equivalent to the max SDS_TYPE_64 or SDS_TYPE_32 */
+}
+
+/* Create a new sds string with the content specified by the 'init' pointer
+ * and 'initlen'.
+ * If NULL is used for 'init' the string is initialized with zero bytes.
+ * If SDS_NOINIT is used, the buffer is left uninitialized;
+ *
+ * The string is always null-termined (all the sds strings are, always) so
+ * even if you create an sds string with:
+ *
+ * mystring = sdsnewlen("abc",3);
+ *
+ * You can print the string with printf() as there is an implicit \0 at the
+ * end of the string. However the string is binary safe and can contain
+ * \0 characters in the middle, as the length is stored in the sds header. */
+sds _sdsnewlen(const void *init, size_t initlen, int trymalloc) {
+    void *sh;
+    sds s;
+    char type = sdsReqType(initlen);
+    /* Empty strings are usually created in order to append. Use type 8
+     * since type 5 is not good at this. */
+    if (type == SDS_TYPE_5 && initlen == 0) type = SDS_TYPE_8;
+    int hdrlen = sdsHdrSize(type);
+    unsigned char *fp; /* flags pointer. */
+    size_t usable;
+
+    assert(initlen + hdrlen + 1 > initlen); /* Catch size_t overflow */
+    sh = trymalloc?
+        s_trymalloc_usable(hdrlen+initlen+1, &usable) :
+        s_malloc_usable(hdrlen+initlen+1, &usable);
+    if (sh == NULL) return NULL;
+    if (init==SDS_NOINIT)
+        init = NULL;
+    else if (!init)
+        memset(sh, 0, hdrlen+initlen+1);
+    s = (char*)sh+hdrlen;
+    fp = ((unsigned char*)s)-1;
+    usable = usable-hdrlen-1;
+    if (usable > sdsTypeMaxSize(type))
+        usable = sdsTypeMaxSize(type);
+    switch(type) {
+        case SDS_TYPE_5: {
+            *fp = type | (initlen << SDS_TYPE_BITS);
+            break;
+        }
+        case SDS_TYPE_8: {
+            SDS_HDR_VAR(8,s);
+            sh->len = initlen;
+            sh->alloc = usable;
+            *fp = type;
+            break;
+        }
+        case SDS_TYPE_16: {
+            SDS_HDR_VAR(16,s);
+            sh->len = initlen;
+            sh->alloc = usable;
+            *fp = type;
+            break;
+        }
+        case SDS_TYPE_32: {
+            SDS_HDR_VAR(32,s);
+            sh->len = initlen;
+            sh->alloc = usable;
+            *fp = type;
+            break;
+        }
+        case SDS_TYPE_64: {
+            SDS_HDR_VAR(64,s);
+            sh->len = initlen;
+            sh->alloc = usable;
+            *fp = type;
+            break;
+        }
+    }
+    if (initlen && init)
+        memcpy(s, init, initlen);
+    s[initlen] = '\0';
+    return s;
+}
+
+sds sdsnewlen(const void *init, size_t initlen) {
+    return _sdsnewlen(init, initlen, 0);
+}
+
+sds sdstrynewlen(const void *init, size_t initlen) {
+    return _sdsnewlen(init, initlen, 1);
+}
+
+/* Create an empty (zero length) sds string. Even in this case the string
+ * always has an implicit null term. */
+sds sdsempty(void) {
+    return sdsnewlen("",0);
+}
+
+/* Create a new sds string starting from a null terminated C string. */
+sds sdsnew(const char *init) {
+    size_t initlen = (init == NULL) ? 0 : strlen(init);
+    return sdsnewlen(init, initlen);
+}
+
+/* Duplicate an sds string. */
+sds sdsdup(const sds s) {
+    return sdsnewlen(s, sdslen(s));
+}
+
+/* Free an sds string. No operation is performed if 's' is NULL. */
+void sdsfree(sds s) {
+    if (s == NULL) return;
+    s_free((char*)s-sdsHdrSize(s[-1]));
+}
+
+/* Set the sds string length to the length as obtained with strlen(), so
+ * considering as content only up to the first null term character.
+ *
+ * This function is useful when the sds string is hacked manually in some
+ * way, like in the following example:
+ *
+ * s = sdsnew("foobar");
+ * s[2] = '\0';
+ * sdsupdatelen(s);
+ * printf("%d\n", sdslen(s));
+ *
+ * The output will be "2", but if we comment out the call to sdsupdatelen()
+ * the output will be "6" as the string was modified but the logical length
+ * remains 6 bytes. */
+void sdsupdatelen(sds s) {
+    size_t reallen = strlen(s);
+    sdssetlen(s, reallen);
+}
+
+/* Modify an sds string in-place to make it empty (zero length).
+ * However all the existing buffer is not discarded but set as free space
+ * so that next append operations will not require allocations up to the
+ * number of bytes previously available. */
+void sdsclear(sds s) {
+    sdssetlen(s, 0);
+    s[0] = '\0';
+}
+
+/* Enlarge the free space at the end of the sds string so that the caller
+ * is sure that after calling this function can overwrite up to addlen
+ * bytes after the end of the string, plus one more byte for nul term.
+ *
+ * Note: this does not change the *length* of the sds string as returned
+ * by sdslen(), but only the free buffer space we have. */
+sds sdsMakeRoomFor(sds s, size_t addlen) {
+    void *sh, *newsh;
+    size_t avail = sdsavail(s);
+    size_t len, newlen, reqlen;
+    char type, oldtype = s[-1] & SDS_TYPE_MASK;
+    int hdrlen;
+    size_t usable;
+
+    /* Return ASAP if there is enough space left. */
+    if (avail >= addlen) return s;
+
+    len = sdslen(s);
+    sh = (char*)s-sdsHdrSize(oldtype);
+    reqlen = newlen = (len+addlen);
+    assert(newlen > len);   /* Catch size_t overflow */
+    if (newlen < SDS_MAX_PREALLOC)
+        newlen *= 2;
+    else
+        newlen += SDS_MAX_PREALLOC;
+
+    type = sdsReqType(newlen);
+
+    /* Don't use type 5: the user is appending to the string and type 5 is
+     * not able to remember empty space, so sdsMakeRoomFor() must be called
+     * at every appending operation. */
+    if (type == SDS_TYPE_5) type = SDS_TYPE_8;
+
+    hdrlen = sdsHdrSize(type);
+    assert(hdrlen + newlen + 1 > reqlen);  /* Catch size_t overflow */
+    if (oldtype==type) {
+        newsh = s_realloc_usable(sh, hdrlen+newlen+1, &usable);
+        if (newsh == NULL) return NULL;
+        s = (char*)newsh+hdrlen;
+    } else {
+        /* Since the header size changes, need to move the string forward,
+         * and can't use realloc */
+        newsh = s_malloc_usable(hdrlen+newlen+1, &usable);
+        if (newsh == NULL) return NULL;
+        memcpy((char*)newsh+hdrlen, s, len+1);
+        s_free(sh);
+        s = (char*)newsh+hdrlen;
+        s[-1] = type;
+        sdssetlen(s, len);
+    }
+    usable = usable-hdrlen-1;
+    if (usable > sdsTypeMaxSize(type))
+        usable = sdsTypeMaxSize(type);
+    sdssetalloc(s, usable);
+    return s;
+}
+
+/* Reallocate the sds string so that it has no free space at the end. The
+ * contained string remains not altered, but next concatenation operations
+ * will require a reallocation.
+ *
+ * After the call, the passed sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds sdsRemoveFreeSpace(sds s) {
+    void *sh, *newsh;
+    char type, oldtype = s[-1] & SDS_TYPE_MASK;
+    int hdrlen, oldhdrlen = sdsHdrSize(oldtype);
+    size_t len = sdslen(s);
+    size_t avail = sdsavail(s);
+    sh = (char*)s-oldhdrlen;
+
+    /* Return ASAP if there is no space left. */
+    if (avail == 0) return s;
+
+    /* Check what would be the minimum SDS header that is just good enough to
+     * fit this string. */
+    type = sdsReqType(len);
+    hdrlen = sdsHdrSize(type);
+
+    /* If the type is the same, or at least a large enough type is still
+     * required, we just realloc(), letting the allocator to do the copy
+     * only if really needed. Otherwise if the change is huge, we manually
+     * reallocate the string to use the different header type. */
+    if (oldtype==type || type > SDS_TYPE_8) {
+        newsh = s_realloc(sh, oldhdrlen+len+1);
+        if (newsh == NULL) return NULL;
+        s = (char*)newsh+oldhdrlen;
+    } else {
+        newsh = s_malloc(hdrlen+len+1);
+        if (newsh == NULL) return NULL;
+        memcpy((char*)newsh+hdrlen, s, len+1);
+        s_free(sh);
+        s = (char*)newsh+hdrlen;
+        s[-1] = type;
+        sdssetlen(s, len);
+    }
+    sdssetalloc(s, len);
+    return s;
+}
+
+/* Return the total size of the allocation of the specified sds string,
+ * including:
+ * 1) The sds header before the pointer.
+ * 2) The string.
+ * 3) The free buffer at the end if any.
+ * 4) The implicit null term.
+ */
+size_t sdsAllocSize(sds s) {
+    size_t alloc = sdsalloc(s);
+    return sdsHdrSize(s[-1])+alloc+1;
+}
+
+/* Return the pointer of the actual SDS allocation (normally SDS strings
+ * are referenced by the start of the string buffer). */
+void *sdsAllocPtr(sds s) {
+    return (void*) (s-sdsHdrSize(s[-1]));
+}
+
+/* Increment the sds length and decrements the left free space at the
+ * end of the string according to 'incr'. Also set the null term
+ * in the new end of the string.
+ *
+ * This function is used in order to fix the string length after the
+ * user calls sdsMakeRoomFor(), writes something after the end of
+ * the current string, and finally needs to set the new length.
+ *
+ * Note: it is possible to use a negative increment in order to
+ * right-trim the string.
+ *
+ * Usage example:
+ *
+ * Using sdsIncrLen() and sdsMakeRoomFor() it is possible to mount the
+ * following schema, to cat bytes coming from the kernel to the end of an
+ * sds string without copying into an intermediate buffer:
+ *
+ * oldlen = sdslen(s);
+ * s = sdsMakeRoomFor(s, BUFFER_SIZE);
+ * nread = read(fd, s+oldlen, BUFFER_SIZE);
+ * ... check for nread <= 0 and handle it ...
+ * sdsIncrLen(s, nread);
+ */
+void sdsIncrLen(sds s, ssize_t incr) {
+    unsigned char flags = s[-1];
+    size_t len;
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5: {
+            unsigned char *fp = ((unsigned char*)s)-1;
+            unsigned char oldlen = SDS_TYPE_5_LEN(flags);
+            assert((incr > 0 && oldlen+incr < 32) || (incr < 0 && oldlen >= (unsigned int)(-incr)));
+            *fp = SDS_TYPE_5 | ((oldlen+incr) << SDS_TYPE_BITS);
+            len = oldlen+incr;
+            break;
+        }
+        case SDS_TYPE_8: {
+            SDS_HDR_VAR(8,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case SDS_TYPE_16: {
+            SDS_HDR_VAR(16,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case SDS_TYPE_32: {
+            SDS_HDR_VAR(32,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= (unsigned int)incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        case SDS_TYPE_64: {
+            SDS_HDR_VAR(64,s);
+            assert((incr >= 0 && sh->alloc-sh->len >= (uint64_t)incr) || (incr < 0 && sh->len >= (uint64_t)(-incr)));
+            len = (sh->len += incr);
+            break;
+        }
+        default: len = 0; /* Just to avoid compilation warnings. */
+    }
+    s[len] = '\0';
+}
+
+/* Grow the sds to have the specified length. Bytes that were not part of
+ * the original length of the sds will be set to zero.
+ *
+ * if the specified length is smaller than the current length, no operation
+ * is performed. */
+sds sdsgrowzero(sds s, size_t len) {
+    size_t curlen = sdslen(s);
+
+    if (len <= curlen) return s;
+    s = sdsMakeRoomFor(s,len-curlen);
+    if (s == NULL) return NULL;
+
+    /* Make sure added region doesn't contain garbage */
+    memset(s+curlen,0,(len-curlen+1)); /* also set trailing \0 byte */
+    sdssetlen(s, len);
+    return s;
+}
+
+/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the
+ * end of the specified sds string 's'.
+ *
+ * After the call, the passed sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds sdscatlen(sds s, const void *t, size_t len) {
+    size_t curlen = sdslen(s);
+
+    s = sdsMakeRoomFor(s,len);
+    if (s == NULL) return NULL;
+    memcpy(s+curlen, t, len);
+    sdssetlen(s, curlen+len);
+    s[curlen+len] = '\0';
+    return s;
+}
+
+/* Append the specified null terminated C string to the sds string 's'.
+ *
+ * After the call, the passed sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds sdscat(sds s, const char *t) {
+    return sdscatlen(s, t, strlen(t));
+}
+
+/* Append the specified sds 't' to the existing sds 's'.
+ *
+ * After the call, the modified sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds sdscatsds(sds s, const sds t) {
+    return sdscatlen(s, t, sdslen(t));
+}
+
+/* Destructively modify the sds string 's' to hold the specified binary
+ * safe string pointed by 't' of length 'len' bytes. */
+sds sdscpylen(sds s, const char *t, size_t len) {
+    if (sdsalloc(s) < len) {
+        s = sdsMakeRoomFor(s,len-sdslen(s));
+        if (s == NULL) return NULL;
+    }
+    memcpy(s, t, len);
+    s[len] = '\0';
+    sdssetlen(s, len);
+    return s;
+}
+
+/* Like sdscpylen() but 't' must be a null-termined string so that the length
+ * of the string is obtained with strlen(). */
+sds sdscpy(sds s, const char *t) {
+    return sdscpylen(s, t, strlen(t));
+}
+
+/* Helper for sdscatlonglong() doing the actual number -> string
+ * conversion. 's' must point to a string with room for at least
+ * SDS_LLSTR_SIZE bytes.
+ *
+ * The function returns the length of the null-terminated string
+ * representation stored at 's'. */
+#define SDS_LLSTR_SIZE 21
+int sdsll2str(char *s, long long value) {
+    char *p, aux;
+    unsigned long long v;
+    size_t l;
+
+    /* Generate the string representation, this method produces
+     * a reversed string. */
+    v = (value < 0) ? -value : value;
+    p = s;
+    do {
+        *p++ = '0'+(v%10);
+        v /= 10;
+    } while(v);
+    if (value < 0) *p++ = '-';
+
+    /* Compute length and add null term. */
+    l = p-s;
+    *p = '\0';
+
+    /* Reverse the string. */
+    p--;
+    while(s < p) {
+        aux = *s;
+        *s = *p;
+        *p = aux;
+        s++;
+        p--;
+    }
+    return l;
+}
+
+/* Identical sdsll2str(), but for unsigned long long type. */
+int sdsull2str(char *s, unsigned long long v) {
+    char *p, aux;
+    size_t l;
+
+    /* Generate the string representation, this method produces
+     * a reversed string. */
+    p = s;
+    do {
+        *p++ = '0'+(v%10);
+        v /= 10;
+    } while(v);
+
+    /* Compute length and add null term. */
+    l = p-s;
+    *p = '\0';
+
+    /* Reverse the string. */
+    p--;
+    while(s < p) {
+        aux = *s;
+        *s = *p;
+        *p = aux;
+        s++;
+        p--;
+    }
+    return l;
+}
+
+/* Create an sds string from a long long value. It is much faster than:
+ *
+ * sdscatprintf(sdsempty(),"%lld\n", value);
+ */
+sds sdsfromlonglong(long long value) {
+    char buf[SDS_LLSTR_SIZE];
+    int len = sdsll2str(buf,value);
+
+    return sdsnewlen(buf,len);
+}
+
+/* Like sdscatprintf() but gets va_list instead of being variadic. */
+sds sdscatvprintf(sds s, const char *fmt, va_list ap) {
+    va_list cpy;
+    char staticbuf[1024], *buf = staticbuf, *t;
+    size_t buflen = strlen(fmt)*2;
+    int bufstrlen;
+
+    /* We try to start using a static buffer for speed.
+     * If not possible we revert to heap allocation. */
+    if (buflen > sizeof(staticbuf)) {
+        buf = s_malloc(buflen);
+        if (buf == NULL) return NULL;
+    } else {
+        buflen = sizeof(staticbuf);
+    }
+
+    /* Alloc enough space for buffer and \0 after failing to
+     * fit the string in the current buffer size. */
+    while(1) {
+        va_copy(cpy,ap);
+        bufstrlen = vsnprintf(buf, buflen, fmt, cpy);
+        va_end(cpy);
+        if (bufstrlen < 0) {
+            if (buf != staticbuf) s_free(buf);
+            return NULL;
+        }
+        if (((size_t)bufstrlen) >= buflen) {
+            if (buf != staticbuf) s_free(buf);
+            buflen = ((size_t)bufstrlen) + 1;
+            buf = s_malloc(buflen);
+            if (buf == NULL) return NULL;
+            continue;
+        }
+        break;
+    }
+
+    /* Finally concat the obtained string to the SDS string and return it. */
+    t = sdscatlen(s, buf, bufstrlen);
+    if (buf != staticbuf) s_free(buf);
+    return t;
+}
+
+/* Append to the sds string 's' a string obtained using printf-alike format
+ * specifier.
+ *
+ * After the call, the modified sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call.
+ *
+ * Example:
+ *
+ * s = sdsnew("Sum is: ");
+ * s = sdscatprintf(s,"%d+%d = %d",a,b,a+b).
+ *
+ * Often you need to create a string from scratch with the printf-alike
+ * format. When this is the need, just use sdsempty() as the target string:
+ *
+ * s = sdscatprintf(sdsempty(), "... your format ...", args);
+ */
+sds sdscatprintf(sds s, const char *fmt, ...) {
+    va_list ap;
+    char *t;
+    va_start(ap, fmt);
+    t = sdscatvprintf(s,fmt,ap);
+    va_end(ap);
+    return t;
+}
+
+/* This function is similar to sdscatprintf, but much faster as it does
+ * not rely on sprintf() family functions implemented by the libc that
+ * are often very slow. Moreover directly handling the sds string as
+ * new data is concatenated provides a performance improvement.
+ *
+ * However this function only handles an incompatible subset of printf-alike
+ * format specifiers:
+ *
+ * %s - C String
+ * %S - SDS string
+ * %i - signed int
+ * %I - 64 bit signed integer (long long, int64_t)
+ * %u - unsigned int
+ * %U - 64 bit unsigned integer (unsigned long long, uint64_t)
+ * %% - Verbatim "%" character.
+ */
+sds sdscatfmt(sds s, char const *fmt, ...) {
+    size_t initlen = sdslen(s);
+    const char *f = fmt;
+    long i;
+    va_list ap;
+
+    /* To avoid continuous reallocations, let's start with a buffer that
+     * can hold at least two times the format string itself. It's not the
+     * best heuristic but seems to work in practice. */
+    s = sdsMakeRoomFor(s, strlen(fmt)*2);
+    va_start(ap,fmt);
+    f = fmt;    /* Next format specifier byte to process. */
+    i = initlen; /* Position of the next byte to write to dest str. */
+    while(*f) {
+        char next, *str;
+        size_t l;
+        long long num;
+        unsigned long long unum;
+
+        /* Make sure there is always space for at least 1 char. */
+        if (sdsavail(s)==0) {
+            s = sdsMakeRoomFor(s,1);
+        }
+
+        switch(*f) {
+        case '%':
+            next = *(f+1);
+            f++;
+            switch(next) {
+            case 's':
+            case 'S':
+                str = va_arg(ap,char*);
+                l = (next == 's') ? strlen(str) : sdslen(str);
+                if (sdsavail(s) < l) {
+                    s = sdsMakeRoomFor(s,l);
+                }
+                memcpy(s+i,str,l);
+                sdsinclen(s,l);
+                i += l;
+                break;
+            case 'i':
+            case 'I':
+                if (next == 'i')
+                    num = va_arg(ap,int);
+                else
+                    num = va_arg(ap,long long);
+                {
+                    char buf[SDS_LLSTR_SIZE];
+                    l = sdsll2str(buf,num);
+                    if (sdsavail(s) < l) {
+                        s = sdsMakeRoomFor(s,l);
+                    }
+                    memcpy(s+i,buf,l);
+                    sdsinclen(s,l);
+                    i += l;
+                }
+                break;
+            case 'u':
+            case 'U':
+                if (next == 'u')
+                    unum = va_arg(ap,unsigned int);
+                else
+                    unum = va_arg(ap,unsigned long long);
+                {
+                    char buf[SDS_LLSTR_SIZE];
+                    l = sdsull2str(buf,unum);
+                    if (sdsavail(s) < l) {
+                        s = sdsMakeRoomFor(s,l);
+                    }
+                    memcpy(s+i,buf,l);
+                    sdsinclen(s,l);
+                    i += l;
+                }
+                break;
+            default: /* Handle %% and generally %<unknown>. */
+                s[i++] = next;
+                sdsinclen(s,1);
+                break;
+            }
+            break;
+        default:
+            s[i++] = *f;
+            sdsinclen(s,1);
+            break;
+        }
+        f++;
+    }
+    va_end(ap);
+
+    /* Add null-term */
+    s[i] = '\0';
+    return s;
+}
+
+/* Remove the part of the string from left and from right composed just of
+ * contiguous characters found in 'cset', that is a null terminted C string.
+ *
+ * After the call, the modified sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call.
+ *
+ * Example:
+ *
+ * s = sdsnew("AA...AA.a.aa.aHelloWorld     :::");
+ * s = sdstrim(s,"Aa. :");
+ * printf("%s\n", s);
+ *
+ * Output will be just "HelloWorld".
+ */
+sds sdstrim(sds s, const char *cset) {
+    char *start, *end, *sp, *ep;
+    size_t len;
+
+    sp = start = s;
+    ep = end = s+sdslen(s)-1;
+    while(sp <= end && strchr(cset, *sp)) sp++;
+    while(ep > sp && strchr(cset, *ep)) ep--;
+    len = (sp > ep) ? 0 : ((ep-sp)+1);
+    if (s != sp) memmove(s, sp, len);
+    s[len] = '\0';
+    sdssetlen(s,len);
+    return s;
+}
+
+/* Changes the input string to be a subset of the original.
+ * It does not release the free space in the string, so a call to
+ * sdsRemoveFreeSpace may be wise after. */
+void sdssubstr(sds s, size_t start, size_t len) {
+    /* Clamp out of range input */
+    size_t oldlen = sdslen(s);
+    if (start >= oldlen) start = len = 0;
+    if (len > oldlen-start) len = oldlen-start;
+
+    /* Move the data */
+    if (len) memmove(s, s+start, len);
+    s[len] = 0;
+    sdssetlen(s,len);
+}
+
+/* Turn the string into a smaller (or equal) string containing only the
+ * substring specified by the 'start' and 'end' indexes.
+ *
+ * start and end can be negative, where -1 means the last character of the
+ * string, -2 the penultimate character, and so forth.
+ *
+ * The interval is inclusive, so the start and end characters will be part
+ * of the resulting string.
+ *
+ * The string is modified in-place.
+ *
+ * NOTE: this function can be misleading and can have unexpected behaviour,
+ * specifically when you want the length of the new string to be 0.
+ * Having start==end will result in a string with one character.
+ * please consider using sdssubstr instead.
+ *
+ * Example:
+ *
+ * s = sdsnew("Hello World");
+ * sdsrange(s,1,-1); => "ello World"
+ */
+void sdsrange(sds s, ssize_t start, ssize_t end) {
+    size_t newlen, len = sdslen(s);
+    if (len == 0) return;
+    if (start < 0)
+        start = len + start;
+    if (end < 0)
+        end = len + end;
+    newlen = (start > end) ? 0 : (end-start)+1;
+    sdssubstr(s, start, newlen);
+}
+
+/* Apply tolower() to every character of the sds string 's'. */
+void sdstolower(sds s) {
+    size_t len = sdslen(s), j;
+
+    for (j = 0; j < len; j++) s[j] = tolower(s[j]);
+}
+
+/* Apply toupper() to every character of the sds string 's'. */
+void sdstoupper(sds s) {
+    size_t len = sdslen(s), j;
+
+    for (j = 0; j < len; j++) s[j] = toupper(s[j]);
+}
+
+/* Compare two sds strings s1 and s2 with memcmp().
+ *
+ * Return value:
+ *
+ *     positive if s1 > s2.
+ *     negative if s1 < s2.
+ *     0 if s1 and s2 are exactly the same binary string.
+ *
+ * If two strings share exactly the same prefix, but one of the two has
+ * additional characters, the longer string is considered to be greater than
+ * the smaller one. */
+int sdscmp(const sds s1, const sds s2) {
+    size_t l1, l2, minlen;
+    int cmp;
+
+    l1 = sdslen(s1);
+    l2 = sdslen(s2);
+    minlen = (l1 < l2) ? l1 : l2;
+    cmp = memcmp(s1,s2,minlen);
+    if (cmp == 0) return l1>l2? 1: (l1<l2? -1: 0);
+    return cmp;
+}
+
+/* Split 's' with separator in 'sep'. An array
+ * of sds strings is returned. *count will be set
+ * by reference to the number of tokens returned.
+ *
+ * On out of memory, zero length string, zero length
+ * separator, NULL is returned.
+ *
+ * Note that 'sep' is able to split a string using
+ * a multi-character separator. For example
+ * sdssplit("foo_-_bar","_-_"); will return two
+ * elements "foo" and "bar".
+ *
+ * This version of the function is binary-safe but
+ * requires length arguments. sdssplit() is just the
+ * same function but for zero-terminated strings.
+ */
+sds *sdssplitlen(const char *s, ssize_t len, const char *sep, int seplen, int *count) {
+    int elements = 0, slots = 5;
+    long start = 0, j;
+    sds *tokens;
+
+    if (seplen < 1 || len < 0) return NULL;
+
+    tokens = s_malloc(sizeof(sds)*slots);
+    if (tokens == NULL) return NULL;
+
+    if (len == 0) {
+        *count = 0;
+        return tokens;
+    }
+    for (j = 0; j < (len-(seplen-1)); j++) {
+        /* make sure there is room for the next element and the final one */
+        if (slots < elements+2) {
+            sds *newtokens;
+
+            slots *= 2;
+            newtokens = s_realloc(tokens,sizeof(sds)*slots);
+            if (newtokens == NULL) goto cleanup;
+            tokens = newtokens;
+        }
+        /* search the separator */
+        if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {
+            tokens[elements] = sdsnewlen(s+start,j-start);
+            if (tokens[elements] == NULL) goto cleanup;
+            elements++;
+            start = j+seplen;
+            j = j+seplen-1; /* skip the separator */
+        }
+    }
+    /* Add the final element. We are sure there is room in the tokens array. */
+    tokens[elements] = sdsnewlen(s+start,len-start);
+    if (tokens[elements] == NULL) goto cleanup;
+    elements++;
+    *count = elements;
+    return tokens;
+
+cleanup:
+    {
+        int i;
+        for (i = 0; i < elements; i++) sdsfree(tokens[i]);
+        s_free(tokens);
+        *count = 0;
+        return NULL;
+    }
+}
+
+/* Free the result returned by sdssplitlen(), or do nothing if 'tokens' is NULL. */
+void sdsfreesplitres(sds *tokens, int count) {
+    if (!tokens) return;
+    while(count--)
+        sdsfree(tokens[count]);
+    s_free(tokens);
+}
+
+/* Append to the sds string "s" an escaped string representation where
+ * all the non-printable characters (tested with isprint()) are turned into
+ * escapes in the form "\n\r\a...." or "\x<hex-number>".
+ *
+ * After the call, the modified sds string is no longer valid and all the
+ * references must be substituted with the new pointer returned by the call. */
+sds sdscatrepr(sds s, const char *p, size_t len) {
+    s = sdscatlen(s,"\"",1);
+    while(len--) {
+        switch(*p) {
+        case '\\':
+        case '"':
+            s = sdscatprintf(s,"\\%c",*p);
+            break;
+        case '\n': s = sdscatlen(s,"\\n",2); break;
+        case '\r': s = sdscatlen(s,"\\r",2); break;
+        case '\t': s = sdscatlen(s,"\\t",2); break;
+        case '\a': s = sdscatlen(s,"\\a",2); break;
+        case '\b': s = sdscatlen(s,"\\b",2); break;
+        default:
+            if (isprint(*p))
+                s = sdscatprintf(s,"%c",*p);
+            else
+                s = sdscatprintf(s,"\\x%02x",(unsigned char)*p);
+            break;
+        }
+        p++;
+    }
+    return sdscatlen(s,"\"",1);
+}
+
+/* Helper function for sdssplitargs() that returns non zero if 'c'
+ * is a valid hex digit. */
+int is_hex_digit(char c) {
+    return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
+           (c >= 'A' && c <= 'F');
+}
+
+/* Helper function for sdssplitargs() that converts a hex digit into an
+ * integer from 0 to 15 */
+int hex_digit_to_int(char c) {
+    switch(c) {
+    case '0': return 0;
+    case '1': return 1;
+    case '2': return 2;
+    case '3': return 3;
+    case '4': return 4;
+    case '5': return 5;
+    case '6': return 6;
+    case '7': return 7;
+    case '8': return 8;
+    case '9': return 9;
+    case 'a': case 'A': return 10;
+    case 'b': case 'B': return 11;
+    case 'c': case 'C': return 12;
+    case 'd': case 'D': return 13;
+    case 'e': case 'E': return 14;
+    case 'f': case 'F': return 15;
+    default: return 0;
+    }
+}
+
+/* Split a line into arguments, where every argument can be in the
+ * following programming-language REPL-alike form:
+ *
+ * foo bar "newline are supported\n" and "\xff\x00otherstuff"
+ *
+ * The number of arguments is stored into *argc, and an array
+ * of sds is returned.
+ *
+ * The caller should free the resulting array of sds strings with
+ * sdsfreesplitres().
+ *
+ * Note that sdscatrepr() is able to convert back a string into
+ * a quoted string in the same format sdssplitargs() is able to parse.
+ *
+ * The function returns the allocated tokens on success, even when the
+ * input string is empty, or NULL if the input contains unbalanced
+ * quotes or closed quotes followed by non space characters
+ * as in: "foo"bar or "foo'
+ */
+sds *sdssplitargs(const char *line, int *argc) {
+    const char *p = line;
+    char *current = NULL;
+    char **vector = NULL;
+
+    *argc = 0;
+    while(1) {
+        /* skip blanks */
+        while(*p && isspace(*p)) p++;
+        if (*p) {
+            /* get a token */
+            int inq=0;  /* set to 1 if we are in "quotes" */
+            int insq=0; /* set to 1 if we are in 'single quotes' */
+            int done=0;
+
+            if (current == NULL) current = sdsempty();
+            while(!done) {
+                if (inq) {
+                    if (*p == '\\' && *(p+1) == 'x' &&
+                                             is_hex_digit(*(p+2)) &&
+                                             is_hex_digit(*(p+3)))
+                    {
+                        unsigned char byte;
+
+                        byte = (hex_digit_to_int(*(p+2))*16)+
+                                hex_digit_to_int(*(p+3));
+                        current = sdscatlen(current,(char*)&byte,1);
+                        p += 3;
+                    } else if (*p == '\\' && *(p+1)) {
+                        char c;
+
+                        p++;
+                        switch(*p) {
+                        case 'n': c = '\n'; break;
+                        case 'r': c = '\r'; break;
+                        case 't': c = '\t'; break;
+                        case 'b': c = '\b'; break;
+                        case 'a': c = '\a'; break;
+                        default: c = *p; break;
+                        }
+                        current = sdscatlen(current,&c,1);
+                    } else if (*p == '"') {
+                        /* closing quote must be followed by a space or
+                         * nothing at all. */
+                        if (*(p+1) && !isspace(*(p+1))) goto err;
+                        done=1;
+                    } else if (!*p) {
+                        /* unterminated quotes */
+                        goto err;
+                    } else {
+                        current = sdscatlen(current,p,1);
+                    }
+                } else if (insq) {
+                    if (*p == '\\' && *(p+1) == '\'') {
+                        p++;
+                        current = sdscatlen(current,"'",1);
+                    } else if (*p == '\'') {
+                        /* closing quote must be followed by a space or
+                         * nothing at all. */
+                        if (*(p+1) && !isspace(*(p+1))) goto err;
+                        done=1;
+                    } else if (!*p) {
+                        /* unterminated quotes */
+                        goto err;
+                    } else {
+                        current = sdscatlen(current,p,1);
+                    }
+                } else {
+                    switch(*p) {
+                    case ' ':
+                    case '\n':
+                    case '\r':
+                    case '\t':
+                    case '\0':
+                        done=1;
+                        break;
+                    case '"':
+                        inq=1;
+                        break;
+                    case '\'':
+                        insq=1;
+                        break;
+                    default:
+                        current = sdscatlen(current,p,1);
+                        break;
+                    }
+                }
+                if (*p) p++;
+            }
+            /* add the token to the vector */
+            vector = s_realloc(vector,((*argc)+1)*sizeof(char*));
+            vector[*argc] = current;
+            (*argc)++;
+            current = NULL;
+        } else {
+            /* Even on empty input string return something not NULL. */
+            if (vector == NULL) vector = s_malloc(sizeof(void*));
+            return vector;
+        }
+    }
+
+err:
+    while((*argc)--)
+        sdsfree(vector[*argc]);
+    s_free(vector);
+    if (current) sdsfree(current);
+    *argc = 0;
+    return NULL;
+}
+
+/* Modify the string substituting all the occurrences of the set of
+ * characters specified in the 'from' string to the corresponding character
+ * in the 'to' array.
+ *
+ * For instance: sdsmapchars(mystring, "ho", "01", 2)
+ * will have the effect of turning the string "hello" into "0ell1".
+ *
+ * The function returns the sds string pointer, that is always the same
+ * as the input pointer since no resize is needed. */
+sds sdsmapchars(sds s, const char *from, const char *to, size_t setlen) {
+    size_t j, i, l = sdslen(s);
+
+    for (j = 0; j < l; j++) {
+        for (i = 0; i < setlen; i++) {
+            if (s[j] == from[i]) {
+                s[j] = to[i];
+                break;
+            }
+        }
+    }
+    return s;
+}
+
+/* Join an array of C strings using the specified separator (also a C string).
+ * Returns the result as an sds string. */
+sds sdsjoin(char **argv, int argc, char *sep) {
+    sds join = sdsempty();
+    int j;
+
+    for (j = 0; j < argc; j++) {
+        join = sdscat(join, argv[j]);
+        if (j != argc-1) join = sdscat(join,sep);
+    }
+    return join;
+}
+
+/* Like sdsjoin, but joins an array of SDS strings. */
+sds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen) {
+    sds join = sdsempty();
+    int j;
+
+    for (j = 0; j < argc; j++) {
+        join = sdscatsds(join, argv[j]);
+        if (j != argc-1) join = sdscatlen(join,sep,seplen);
+    }
+    return join;
+}
+
+/* Wrappers to the allocators used by SDS. Note that SDS will actually
+ * just use the macros defined into sdsalloc.h in order to avoid to pay
+ * the overhead of function calls. Here we define these wrappers only for
+ * the programs SDS is linked to, if they want to touch the SDS internals
+ * even if they use a different allocator. */
+void *sds_malloc(size_t size) { return s_malloc(size); }
+void *sds_realloc(void *ptr, size_t size) { return s_realloc(ptr,size); }
+void sds_free(void *ptr) { s_free(ptr); }
+
+/* Perform expansion of a template string and return the result as a newly
+ * allocated sds.
+ *
+ * Template variables are specified using curly brackets, e.g. {variable}.
+ * An opening bracket can be quoted by repeating it twice.
+ */
+sds sdstemplate(const char *template, sdstemplate_callback_t cb_func, void *cb_arg)
+{
+    sds res = sdsempty();
+    const char *p = template;
+
+    while (*p) {
+        /* Find next variable, copy everything until there */
+        const char *sv = strchr(p, '{');
+        if (!sv) {
+            /* Not found: copy till rest of template and stop */
+            res = sdscat(res, p);
+            break;
+        } else if (sv > p) {
+            /* Found: copy anything up to the begining of the variable */
+            res = sdscatlen(res, p, sv - p);
+        }
+
+        /* Skip into variable name, handle premature end or quoting */
+        sv++;
+        if (!*sv) goto error;       /* Premature end of template */
+        if (*sv == '{') {
+            /* Quoted '{' */
+            p = sv + 1;
+            res = sdscat(res, "{");
+            continue;
+        }
+
+        /* Find end of variable name, handle premature end of template */
+        const char *ev = strchr(sv, '}');
+        if (!ev) goto error;
+
+        /* Pass variable name to callback and obtain value. If callback failed,
+         * abort. */
+        sds varname = sdsnewlen(sv, ev - sv);
+        sds value = cb_func(varname, cb_arg);
+        sdsfree(varname);
+        if (!value) goto error;
+
+        /* Append value to result and continue */
+        res = sdscat(res, value);
+        sdsfree(value);
+        p = ev + 1;
+    }
+
+    return res;
+
+error:
+    sdsfree(res);
+    return NULL;
+}
+
+#ifdef REDIS_TEST
+#include <stdio.h>
+#include <limits.h>
+#include "testhelp.h"
+
+#define UNUSED(x) (void)(x)
+
+static sds sdsTestTemplateCallback(sds varname, void *arg) {
+    UNUSED(arg);
+    static const char *_var1 = "variable1";
+    static const char *_var2 = "variable2";
+
+    if (!strcmp(varname, _var1)) return sdsnew("value1");
+    else if (!strcmp(varname, _var2)) return sdsnew("value2");
+    else return NULL;
+}
+
+int sdsTest(int argc, char **argv, int accurate) {
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    {
+        sds x = sdsnew("foo"), y;
+
+        test_cond("Create a string and obtain the length",
+            sdslen(x) == 3 && memcmp(x,"foo\0",4) == 0);
+
+        sdsfree(x);
+        x = sdsnewlen("foo",2);
+        test_cond("Create a string with specified length",
+            sdslen(x) == 2 && memcmp(x,"fo\0",3) == 0);
+
+        x = sdscat(x,"bar");
+        test_cond("Strings concatenation",
+            sdslen(x) == 5 && memcmp(x,"fobar\0",6) == 0);
+
+        x = sdscpy(x,"a");
+        test_cond("sdscpy() against an originally longer string",
+            sdslen(x) == 1 && memcmp(x,"a\0",2) == 0);
+
+        x = sdscpy(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk");
+        test_cond("sdscpy() against an originally shorter string",
+            sdslen(x) == 33 &&
+            memcmp(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\0",33) == 0);
+
+        sdsfree(x);
+        x = sdscatprintf(sdsempty(),"%d",123);
+        test_cond("sdscatprintf() seems working in the base case",
+            sdslen(x) == 3 && memcmp(x,"123\0",4) == 0);
+
+        sdsfree(x);
+        x = sdscatprintf(sdsempty(),"a%cb",0);
+        test_cond("sdscatprintf() seems working with \\0 inside of result",
+            sdslen(x) == 3 && memcmp(x,"a\0""b\0",4) == 0);
+
+        {
+            sdsfree(x);
+            char etalon[1024*1024];
+            for (size_t i = 0; i < sizeof(etalon); i++) {
+                etalon[i] = '0';
+            }
+            x = sdscatprintf(sdsempty(),"%0*d",(int)sizeof(etalon),0);
+            test_cond("sdscatprintf() can print 1MB",
+                sdslen(x) == sizeof(etalon) && memcmp(x,etalon,sizeof(etalon)) == 0);
+        }
+
+        sdsfree(x);
+        x = sdsnew("--");
+        x = sdscatfmt(x, "Hello %s World %I,%I--", "Hi!", LLONG_MIN,LLONG_MAX);
+        test_cond("sdscatfmt() seems working in the base case",
+            sdslen(x) == 60 &&
+            memcmp(x,"--Hello Hi! World -9223372036854775808,"
+                     "9223372036854775807--",60) == 0);
+        printf("[%s]\n",x);
+
+        sdsfree(x);
+        x = sdsnew("--");
+        x = sdscatfmt(x, "%u,%U--", UINT_MAX, ULLONG_MAX);
+        test_cond("sdscatfmt() seems working with unsigned numbers",
+            sdslen(x) == 35 &&
+            memcmp(x,"--4294967295,18446744073709551615--",35) == 0);
+
+        sdsfree(x);
+        x = sdsnew(" x ");
+        sdstrim(x," x");
+        test_cond("sdstrim() works when all chars match",
+            sdslen(x) == 0);
+
+        sdsfree(x);
+        x = sdsnew(" x ");
+        sdstrim(x," ");
+        test_cond("sdstrim() works when a single char remains",
+            sdslen(x) == 1 && x[0] == 'x');
+
+        sdsfree(x);
+        x = sdsnew("xxciaoyyy");
+        sdstrim(x,"xy");
+        test_cond("sdstrim() correctly trims characters",
+            sdslen(x) == 4 && memcmp(x,"ciao\0",5) == 0);
+
+        y = sdsdup(x);
+        sdsrange(y,1,1);
+        test_cond("sdsrange(...,1,1)",
+            sdslen(y) == 1 && memcmp(y,"i\0",2) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,1,-1);
+        test_cond("sdsrange(...,1,-1)",
+            sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,-2,-1);
+        test_cond("sdsrange(...,-2,-1)",
+            sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,2,1);
+        test_cond("sdsrange(...,2,1)",
+            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,1,100);
+        test_cond("sdsrange(...,1,100)",
+            sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,100,100);
+        test_cond("sdsrange(...,100,100)",
+            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,4,6);
+        test_cond("sdsrange(...,4,6)",
+            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
+
+        sdsfree(y);
+        y = sdsdup(x);
+        sdsrange(y,3,6);
+        test_cond("sdsrange(...,3,6)",
+            sdslen(y) == 1 && memcmp(y,"o\0",2) == 0);
+
+        sdsfree(y);
+        sdsfree(x);
+        x = sdsnew("foo");
+        y = sdsnew("foa");
+        test_cond("sdscmp(foo,foa)", sdscmp(x,y) > 0);
+
+        sdsfree(y);
+        sdsfree(x);
+        x = sdsnew("bar");
+        y = sdsnew("bar");
+        test_cond("sdscmp(bar,bar)", sdscmp(x,y) == 0);
+
+        sdsfree(y);
+        sdsfree(x);
+        x = sdsnew("aar");
+        y = sdsnew("bar");
+        test_cond("sdscmp(bar,bar)", sdscmp(x,y) < 0);
+
+        sdsfree(y);
+        sdsfree(x);
+        x = sdsnewlen("\a\n\0foo\r",7);
+        y = sdscatrepr(sdsempty(),x,sdslen(x));
+        test_cond("sdscatrepr(...data...)",
+            memcmp(y,"\"\\a\\n\\x00foo\\r\"",15) == 0);
+
+        {
+            unsigned int oldfree;
+            char *p;
+            int i;
+            size_t step = 10, j;
+
+            sdsfree(x);
+            sdsfree(y);
+            x = sdsnew("0");
+            test_cond("sdsnew() free/len buffers", sdslen(x) == 1 && sdsavail(x) == 0);
+
+            /* Run the test a few times in order to hit the first two
+             * SDS header types. */
+            for (i = 0; i < 10; i++) {
+                size_t oldlen = sdslen(x);
+                x = sdsMakeRoomFor(x,step);
+                int type = x[-1]&SDS_TYPE_MASK;
+
+                test_cond("sdsMakeRoomFor() len", sdslen(x) == oldlen);
+                if (type != SDS_TYPE_5) {
+                    test_cond("sdsMakeRoomFor() free", sdsavail(x) >= step);
+                    oldfree = sdsavail(x);
+                    UNUSED(oldfree);
+                }
+                p = x+oldlen;
+                for (j = 0; j < step; j++) {
+                    p[j] = 'A'+j;
+                }
+                sdsIncrLen(x,step);
+            }
+            test_cond("sdsMakeRoomFor() content",
+                memcmp("0ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ",x,101) == 0);
+            test_cond("sdsMakeRoomFor() final length",sdslen(x)==101);
+
+            sdsfree(x);
+        }
+
+        /* Simple template */
+        x = sdstemplate("v1={variable1} v2={variable2}", sdsTestTemplateCallback, NULL);
+        test_cond("sdstemplate() normal flow",
+                  memcmp(x,"v1=value1 v2=value2",19) == 0);
+        sdsfree(x);
+
+        /* Template with callback error */
+        x = sdstemplate("v1={variable1} v3={doesnotexist}", sdsTestTemplateCallback, NULL);
+        test_cond("sdstemplate() with callback error", x == NULL);
+
+        /* Template with empty var name */
+        x = sdstemplate("v1={", sdsTestTemplateCallback, NULL);
+        test_cond("sdstemplate() with empty var name", x == NULL);
+
+        /* Template with truncated var name */
+        x = sdstemplate("v1={start", sdsTestTemplateCallback, NULL);
+        test_cond("sdstemplate() with truncated var name", x == NULL);
+
+        /* Template with quoting */
+        x = sdstemplate("v1={{{variable1}} {{} v2={variable2}", sdsTestTemplateCallback, NULL);
+        test_cond("sdstemplate() with quoting",
+                  memcmp(x,"v1={value1} {} v2=value2",24) == 0);
+        sdsfree(x);
+    }
+    test_report();
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/sds.h b/redis-stable/src/sds.h
new file mode 100644
index 00000000..6699858c
--- /dev/null
+++ b/redis-stable/src/sds.h
@@ -0,0 +1,284 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Oran Agra
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __SDS_H
+#define __SDS_H
+
+#define SDS_MAX_PREALLOC (1024*1024)
+extern const char *SDS_NOINIT;
+
+#include <sys/types.h>
+#include <stdarg.h>
+#include <stdint.h>
+
+typedef char *sds;
+
+/* Note: sdshdr5 is never used, we just access the flags byte directly.
+ * However is here to document the layout of type 5 SDS strings. */
+struct __attribute__ ((__packed__)) sdshdr5 {
+    unsigned char flags; /* 3 lsb of type, and 5 msb of string length */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) sdshdr8 {
+    uint8_t len; /* used */
+    uint8_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) sdshdr16 {
+    uint16_t len; /* used */
+    uint16_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) sdshdr32 {
+    uint32_t len; /* used */
+    uint32_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+struct __attribute__ ((__packed__)) sdshdr64 {
+    uint64_t len; /* used */
+    uint64_t alloc; /* excluding the header and null terminator */
+    unsigned char flags; /* 3 lsb of type, 5 unused bits */
+    char buf[];
+};
+
+#define SDS_TYPE_5  0
+#define SDS_TYPE_8  1
+#define SDS_TYPE_16 2
+#define SDS_TYPE_32 3
+#define SDS_TYPE_64 4
+#define SDS_TYPE_MASK 7
+#define SDS_TYPE_BITS 3
+#define SDS_HDR_VAR(T,s) struct sdshdr##T *sh = (void*)((s)-(sizeof(struct sdshdr##T)));
+#define SDS_HDR(T,s) ((struct sdshdr##T *)((s)-(sizeof(struct sdshdr##T))))
+#define SDS_TYPE_5_LEN(f) ((f)>>SDS_TYPE_BITS)
+
+static inline size_t sdslen(const sds s) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            return SDS_TYPE_5_LEN(flags);
+        case SDS_TYPE_8:
+            return SDS_HDR(8,s)->len;
+        case SDS_TYPE_16:
+            return SDS_HDR(16,s)->len;
+        case SDS_TYPE_32:
+            return SDS_HDR(32,s)->len;
+        case SDS_TYPE_64:
+            return SDS_HDR(64,s)->len;
+    }
+    return 0;
+}
+
+static inline size_t sdsavail(const sds s) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5: {
+            return 0;
+        }
+        case SDS_TYPE_8: {
+            SDS_HDR_VAR(8,s);
+            return sh->alloc - sh->len;
+        }
+        case SDS_TYPE_16: {
+            SDS_HDR_VAR(16,s);
+            return sh->alloc - sh->len;
+        }
+        case SDS_TYPE_32: {
+            SDS_HDR_VAR(32,s);
+            return sh->alloc - sh->len;
+        }
+        case SDS_TYPE_64: {
+            SDS_HDR_VAR(64,s);
+            return sh->alloc - sh->len;
+        }
+    }
+    return 0;
+}
+
+static inline void sdssetlen(sds s, size_t newlen) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            {
+                unsigned char *fp = ((unsigned char*)s)-1;
+                *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);
+            }
+            break;
+        case SDS_TYPE_8:
+            SDS_HDR(8,s)->len = newlen;
+            break;
+        case SDS_TYPE_16:
+            SDS_HDR(16,s)->len = newlen;
+            break;
+        case SDS_TYPE_32:
+            SDS_HDR(32,s)->len = newlen;
+            break;
+        case SDS_TYPE_64:
+            SDS_HDR(64,s)->len = newlen;
+            break;
+    }
+}
+
+static inline void sdsinclen(sds s, size_t inc) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            {
+                unsigned char *fp = ((unsigned char*)s)-1;
+                unsigned char newlen = SDS_TYPE_5_LEN(flags)+inc;
+                *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);
+            }
+            break;
+        case SDS_TYPE_8:
+            SDS_HDR(8,s)->len += inc;
+            break;
+        case SDS_TYPE_16:
+            SDS_HDR(16,s)->len += inc;
+            break;
+        case SDS_TYPE_32:
+            SDS_HDR(32,s)->len += inc;
+            break;
+        case SDS_TYPE_64:
+            SDS_HDR(64,s)->len += inc;
+            break;
+    }
+}
+
+/* sdsalloc() = sdsavail() + sdslen() */
+static inline size_t sdsalloc(const sds s) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            return SDS_TYPE_5_LEN(flags);
+        case SDS_TYPE_8:
+            return SDS_HDR(8,s)->alloc;
+        case SDS_TYPE_16:
+            return SDS_HDR(16,s)->alloc;
+        case SDS_TYPE_32:
+            return SDS_HDR(32,s)->alloc;
+        case SDS_TYPE_64:
+            return SDS_HDR(64,s)->alloc;
+    }
+    return 0;
+}
+
+static inline void sdssetalloc(sds s, size_t newlen) {
+    unsigned char flags = s[-1];
+    switch(flags&SDS_TYPE_MASK) {
+        case SDS_TYPE_5:
+            /* Nothing to do, this type has no total allocation info. */
+            break;
+        case SDS_TYPE_8:
+            SDS_HDR(8,s)->alloc = newlen;
+            break;
+        case SDS_TYPE_16:
+            SDS_HDR(16,s)->alloc = newlen;
+            break;
+        case SDS_TYPE_32:
+            SDS_HDR(32,s)->alloc = newlen;
+            break;
+        case SDS_TYPE_64:
+            SDS_HDR(64,s)->alloc = newlen;
+            break;
+    }
+}
+
+sds sdsnewlen(const void *init, size_t initlen);
+sds sdstrynewlen(const void *init, size_t initlen);
+sds sdsnew(const char *init);
+sds sdsempty(void);
+sds sdsdup(const sds s);
+void sdsfree(sds s);
+sds sdsgrowzero(sds s, size_t len);
+sds sdscatlen(sds s, const void *t, size_t len);
+sds sdscat(sds s, const char *t);
+sds sdscatsds(sds s, const sds t);
+sds sdscpylen(sds s, const char *t, size_t len);
+sds sdscpy(sds s, const char *t);
+
+sds sdscatvprintf(sds s, const char *fmt, va_list ap);
+#ifdef __GNUC__
+sds sdscatprintf(sds s, const char *fmt, ...)
+    __attribute__((format(printf, 2, 3)));
+#else
+sds sdscatprintf(sds s, const char *fmt, ...);
+#endif
+
+sds sdscatfmt(sds s, char const *fmt, ...);
+sds sdstrim(sds s, const char *cset);
+void sdssubstr(sds s, size_t start, size_t len);
+void sdsrange(sds s, ssize_t start, ssize_t end);
+void sdsupdatelen(sds s);
+void sdsclear(sds s);
+int sdscmp(const sds s1, const sds s2);
+sds *sdssplitlen(const char *s, ssize_t len, const char *sep, int seplen, int *count);
+void sdsfreesplitres(sds *tokens, int count);
+void sdstolower(sds s);
+void sdstoupper(sds s);
+sds sdsfromlonglong(long long value);
+sds sdscatrepr(sds s, const char *p, size_t len);
+sds *sdssplitargs(const char *line, int *argc);
+sds sdsmapchars(sds s, const char *from, const char *to, size_t setlen);
+sds sdsjoin(char **argv, int argc, char *sep);
+sds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen);
+
+/* Callback for sdstemplate. The function gets called by sdstemplate
+ * every time a variable needs to be expanded. The variable name is
+ * provided as variable, and the callback is expected to return a
+ * substitution value. Returning a NULL indicates an error.
+ */
+typedef sds (*sdstemplate_callback_t)(const sds variable, void *arg);
+sds sdstemplate(const char *template, sdstemplate_callback_t cb_func, void *cb_arg);
+
+/* Low level functions exposed to the user API */
+sds sdsMakeRoomFor(sds s, size_t addlen);
+void sdsIncrLen(sds s, ssize_t incr);
+sds sdsRemoveFreeSpace(sds s);
+size_t sdsAllocSize(sds s);
+void *sdsAllocPtr(sds s);
+
+/* Export the allocator used by SDS to the program using SDS.
+ * Sometimes the program SDS is linked to, may use a different set of
+ * allocators, but may want to allocate or free things that SDS will
+ * respectively free or allocate. */
+void *sds_malloc(size_t size);
+void *sds_realloc(void *ptr, size_t size);
+void sds_free(void *ptr);
+
+#ifdef REDIS_TEST
+int sdsTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif
diff --git a/redis-stable/src/sdsalloc.h b/redis-stable/src/sdsalloc.h
new file mode 100644
index 00000000..a1c5584f
--- /dev/null
+++ b/redis-stable/src/sdsalloc.h
@@ -0,0 +1,54 @@
+/* SDSLib 2.0 -- A C dynamic strings library
+ *
+ * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2015, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* SDS allocator selection.
+ *
+ * This file is used in order to change the SDS allocator at compile time.
+ * Just define the following defines to what you want to use. Also add
+ * the include of your alternate allocator if needed (not needed in order
+ * to use the default libc allocator). */
+
+#ifndef __SDS_ALLOC_H__
+#define __SDS_ALLOC_H__
+
+#include "zmalloc.h"
+#define s_malloc zmalloc
+#define s_realloc zrealloc
+#define s_trymalloc ztrymalloc
+#define s_tryrealloc ztryrealloc
+#define s_free zfree
+#define s_malloc_usable zmalloc_usable
+#define s_realloc_usable zrealloc_usable
+#define s_trymalloc_usable ztrymalloc_usable
+#define s_tryrealloc_usable ztryrealloc_usable
+#define s_free_usable zfree_usable
+
+#endif
diff --git a/redis-stable/src/sentinel.c b/redis-stable/src/sentinel.c
new file mode 100644
index 00000000..a9d123eb
--- /dev/null
+++ b/redis-stable/src/sentinel.c
@@ -0,0 +1,5112 @@
+/* Redis Sentinel implementation
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "hiredis.h"
+#ifdef USE_OPENSSL
+#include "openssl/ssl.h"
+#include "hiredis_ssl.h"
+#endif
+#include "async.h"
+
+#include <ctype.h>
+#include <arpa/inet.h>
+#include <sys/socket.h>
+#include <sys/wait.h>
+#include <fcntl.h>
+
+extern char **environ;
+
+#ifdef USE_OPENSSL
+extern SSL_CTX *redis_tls_ctx;
+extern SSL_CTX *redis_tls_client_ctx;
+#endif
+
+#define REDIS_SENTINEL_PORT 26379
+
+/* ======================== Sentinel global state =========================== */
+
+/* Address object, used to describe an ip:port pair. */
+typedef struct sentinelAddr {
+    char *hostname;         /* Hostname OR address, as specified */
+    char *ip;               /* Always a resolved address */
+    int port;
+} sentinelAddr;
+
+/* A Sentinel Redis Instance object is monitoring. */
+#define SRI_MASTER  (1<<0)
+#define SRI_SLAVE   (1<<1)
+#define SRI_SENTINEL (1<<2)
+#define SRI_S_DOWN (1<<3)   /* Subjectively down (no quorum). */
+#define SRI_O_DOWN (1<<4)   /* Objectively down (confirmed by others). */
+#define SRI_MASTER_DOWN (1<<5) /* A Sentinel with this flag set thinks that
+                                   its master is down. */
+#define SRI_FAILOVER_IN_PROGRESS (1<<6) /* Failover is in progress for
+                                           this master. */
+#define SRI_PROMOTED (1<<7)            /* Slave selected for promotion. */
+#define SRI_RECONF_SENT (1<<8)     /* SLAVEOF <newmaster> sent. */
+#define SRI_RECONF_INPROG (1<<9)   /* Slave synchronization in progress. */
+#define SRI_RECONF_DONE (1<<10)     /* Slave synchronized with new master. */
+#define SRI_FORCE_FAILOVER (1<<11)  /* Force failover with master up. */
+#define SRI_SCRIPT_KILL_SENT (1<<12) /* SCRIPT KILL already sent on -BUSY */
+
+/* Note: times are in milliseconds. */
+#define SENTINEL_INFO_PERIOD 10000
+#define SENTINEL_PING_PERIOD 1000
+#define SENTINEL_ASK_PERIOD 1000
+#define SENTINEL_PUBLISH_PERIOD 2000
+#define SENTINEL_DEFAULT_DOWN_AFTER 30000
+#define SENTINEL_HELLO_CHANNEL "__sentinel__:hello"
+#define SENTINEL_TILT_TRIGGER 2000
+#define SENTINEL_TILT_PERIOD (SENTINEL_PING_PERIOD*30)
+#define SENTINEL_DEFAULT_SLAVE_PRIORITY 100
+#define SENTINEL_SLAVE_RECONF_TIMEOUT 10000
+#define SENTINEL_DEFAULT_PARALLEL_SYNCS 1
+#define SENTINEL_MIN_LINK_RECONNECT_PERIOD 15000
+#define SENTINEL_DEFAULT_FAILOVER_TIMEOUT (60*3*1000)
+#define SENTINEL_MAX_PENDING_COMMANDS 100
+#define SENTINEL_ELECTION_TIMEOUT 10000
+#define SENTINEL_MAX_DESYNC 1000
+#define SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG 1
+#define SENTINEL_DEFAULT_RESOLVE_HOSTNAMES 0
+#define SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES 0
+
+/* Failover machine different states. */
+#define SENTINEL_FAILOVER_STATE_NONE 0  /* No failover in progress. */
+#define SENTINEL_FAILOVER_STATE_WAIT_START 1  /* Wait for failover_start_time*/
+#define SENTINEL_FAILOVER_STATE_SELECT_SLAVE 2 /* Select slave to promote */
+#define SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE 3 /* Slave -> Master */
+#define SENTINEL_FAILOVER_STATE_WAIT_PROMOTION 4 /* Wait slave to change role */
+#define SENTINEL_FAILOVER_STATE_RECONF_SLAVES 5 /* SLAVEOF newmaster */
+#define SENTINEL_FAILOVER_STATE_UPDATE_CONFIG 6 /* Monitor promoted slave. */
+
+#define SENTINEL_MASTER_LINK_STATUS_UP 0
+#define SENTINEL_MASTER_LINK_STATUS_DOWN 1
+
+/* Generic flags that can be used with different functions.
+ * They use higher bits to avoid colliding with the function specific
+ * flags. */
+#define SENTINEL_NO_FLAGS 0
+#define SENTINEL_GENERATE_EVENT (1<<16)
+#define SENTINEL_LEADER (1<<17)
+#define SENTINEL_OBSERVER (1<<18)
+
+/* Script execution flags and limits. */
+#define SENTINEL_SCRIPT_NONE 0
+#define SENTINEL_SCRIPT_RUNNING 1
+#define SENTINEL_SCRIPT_MAX_QUEUE 256
+#define SENTINEL_SCRIPT_MAX_RUNNING 16
+#define SENTINEL_SCRIPT_MAX_RUNTIME 60000 /* 60 seconds max exec time. */
+#define SENTINEL_SCRIPT_MAX_RETRY 10
+#define SENTINEL_SCRIPT_RETRY_DELAY 30000 /* 30 seconds between retries. */
+
+/* SENTINEL SIMULATE-FAILURE command flags. */
+#define SENTINEL_SIMFAILURE_NONE 0
+#define SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION (1<<0)
+#define SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION (1<<1)
+
+/* The link to a sentinelRedisInstance. When we have the same set of Sentinels
+ * monitoring many masters, we have different instances representing the
+ * same Sentinels, one per master, and we need to share the hiredis connections
+ * among them. Otherwise if 5 Sentinels are monitoring 100 masters we create
+ * 500 outgoing connections instead of 5.
+ *
+ * So this structure represents a reference counted link in terms of the two
+ * hiredis connections for commands and Pub/Sub, and the fields needed for
+ * failure detection, since the ping/pong time are now local to the link: if
+ * the link is available, the instance is available. This way we don't just
+ * have 5 connections instead of 500, we also send 5 pings instead of 500.
+ *
+ * Links are shared only for Sentinels: master and slave instances have
+ * a link with refcount = 1, always. */
+typedef struct instanceLink {
+    int refcount;          /* Number of sentinelRedisInstance owners. */
+    int disconnected;      /* Non-zero if we need to reconnect cc or pc. */
+    int pending_commands;  /* Number of commands sent waiting for a reply. */
+    redisAsyncContext *cc; /* Hiredis context for commands. */
+    redisAsyncContext *pc; /* Hiredis context for Pub / Sub. */
+    mstime_t cc_conn_time; /* cc connection time. */
+    mstime_t pc_conn_time; /* pc connection time. */
+    mstime_t pc_last_activity; /* Last time we received any message. */
+    mstime_t last_avail_time; /* Last time the instance replied to ping with
+                                 a reply we consider valid. */
+    mstime_t act_ping_time;   /* Time at which the last pending ping (no pong
+                                 received after it) was sent. This field is
+                                 set to 0 when a pong is received, and set again
+                                 to the current time if the value is 0 and a new
+                                 ping is sent. */
+    mstime_t last_ping_time;  /* Time at which we sent the last ping. This is
+                                 only used to avoid sending too many pings
+                                 during failure. Idle time is computed using
+                                 the act_ping_time field. */
+    mstime_t last_pong_time;  /* Last time the instance replied to ping,
+                                 whatever the reply was. That's used to check
+                                 if the link is idle and must be reconnected. */
+    mstime_t last_reconn_time;  /* Last reconnection attempt performed when
+                                   the link was down. */
+} instanceLink;
+
+typedef struct sentinelRedisInstance {
+    int flags;      /* See SRI_... defines */
+    char *name;     /* Master name from the point of view of this sentinel. */
+    char *runid;    /* Run ID of this instance, or unique ID if is a Sentinel.*/
+    uint64_t config_epoch;  /* Configuration epoch. */
+    sentinelAddr *addr; /* Master host. */
+    instanceLink *link; /* Link to the instance, may be shared for Sentinels. */
+    mstime_t last_pub_time;   /* Last time we sent hello via Pub/Sub. */
+    mstime_t last_hello_time; /* Only used if SRI_SENTINEL is set. Last time
+                                 we received a hello from this Sentinel
+                                 via Pub/Sub. */
+    mstime_t last_master_down_reply_time; /* Time of last reply to
+                                             SENTINEL is-master-down command. */
+    mstime_t s_down_since_time; /* Subjectively down since time. */
+    mstime_t o_down_since_time; /* Objectively down since time. */
+    mstime_t down_after_period; /* Consider it down after that period. */
+    mstime_t info_refresh;  /* Time at which we received INFO output from it. */
+    dict *renamed_commands;     /* Commands renamed in this instance:
+                                   Sentinel will use the alternative commands
+                                   mapped on this table to send things like
+                                   SLAVEOF, CONFING, INFO, ... */
+
+    /* Role and the first time we observed it.
+     * This is useful in order to delay replacing what the instance reports
+     * with our own configuration. We need to always wait some time in order
+     * to give a chance to the leader to report the new configuration before
+     * we do silly things. */
+    int role_reported;
+    mstime_t role_reported_time;
+    mstime_t slave_conf_change_time; /* Last time slave master addr changed. */
+
+    /* Master specific. */
+    dict *sentinels;    /* Other sentinels monitoring the same master. */
+    dict *slaves;       /* Slaves for this master instance. */
+    unsigned int quorum;/* Number of sentinels that need to agree on failure. */
+    int parallel_syncs; /* How many slaves to reconfigure at same time. */
+    char *auth_pass;    /* Password to use for AUTH against master & replica. */
+    char *auth_user;    /* Username for ACLs AUTH against master & replica. */
+
+    /* Slave specific. */
+    mstime_t master_link_down_time; /* Slave replication link down time. */
+    int slave_priority; /* Slave priority according to its INFO output. */
+    int replica_announced; /* Replica announcing according to its INFO output. */
+    mstime_t slave_reconf_sent_time; /* Time at which we sent SLAVE OF <new> */
+    struct sentinelRedisInstance *master; /* Master instance if it's slave. */
+    char *slave_master_host;    /* Master host as reported by INFO */
+    int slave_master_port;      /* Master port as reported by INFO */
+    int slave_master_link_status; /* Master link status as reported by INFO */
+    unsigned long long slave_repl_offset; /* Slave replication offset. */
+    /* Failover */
+    char *leader;       /* If this is a master instance, this is the runid of
+                           the Sentinel that should perform the failover. If
+                           this is a Sentinel, this is the runid of the Sentinel
+                           that this Sentinel voted as leader. */
+    uint64_t leader_epoch; /* Epoch of the 'leader' field. */
+    uint64_t failover_epoch; /* Epoch of the currently started failover. */
+    int failover_state; /* See SENTINEL_FAILOVER_STATE_* defines. */
+    mstime_t failover_state_change_time;
+    mstime_t failover_start_time;   /* Last failover attempt start time. */
+    mstime_t failover_timeout;      /* Max time to refresh failover state. */
+    mstime_t failover_delay_logged; /* For what failover_start_time value we
+                                       logged the failover delay. */
+    struct sentinelRedisInstance *promoted_slave; /* Promoted slave instance. */
+    /* Scripts executed to notify admin or reconfigure clients: when they
+     * are set to NULL no script is executed. */
+    char *notification_script;
+    char *client_reconfig_script;
+    sds info; /* cached INFO output */
+} sentinelRedisInstance;
+
+/* Main state. */
+struct sentinelState {
+    char myid[CONFIG_RUN_ID_SIZE+1]; /* This sentinel ID. */
+    uint64_t current_epoch;         /* Current epoch. */
+    dict *masters;      /* Dictionary of master sentinelRedisInstances.
+                           Key is the instance name, value is the
+                           sentinelRedisInstance structure pointer. */
+    int tilt;           /* Are we in TILT mode? */
+    int running_scripts;    /* Number of scripts in execution right now. */
+    mstime_t tilt_start_time;       /* When TITL started. */
+    mstime_t previous_time;         /* Last time we ran the time handler. */
+    list *scripts_queue;            /* Queue of user scripts to execute. */
+    char *announce_ip;  /* IP addr that is gossiped to other sentinels if
+                           not NULL. */
+    int announce_port;  /* Port that is gossiped to other sentinels if
+                           non zero. */
+    unsigned long simfailure_flags; /* Failures simulation. */
+    int deny_scripts_reconfig; /* Allow SENTINEL SET ... to change script
+                                  paths at runtime? */
+    char *sentinel_auth_pass;    /* Password to use for AUTH against other sentinel */
+    char *sentinel_auth_user;    /* Username for ACLs AUTH against other sentinel. */
+    int resolve_hostnames;       /* Support use of hostnames, assuming DNS is well configured. */
+    int announce_hostnames;      /* Announce hostnames instead of IPs when we have them. */
+} sentinel;
+
+/* A script execution job. */
+typedef struct sentinelScriptJob {
+    int flags;              /* Script job flags: SENTINEL_SCRIPT_* */
+    int retry_num;          /* Number of times we tried to execute it. */
+    char **argv;            /* Arguments to call the script. */
+    mstime_t start_time;    /* Script execution time if the script is running,
+                               otherwise 0 if we are allowed to retry the
+                               execution at any time. If the script is not
+                               running and it's not 0, it means: do not run
+                               before the specified time. */
+    pid_t pid;              /* Script execution pid. */
+} sentinelScriptJob;
+
+/* ======================= hiredis ae.c adapters =============================
+ * Note: this implementation is taken from hiredis/adapters/ae.h, however
+ * we have our modified copy for Sentinel in order to use our allocator
+ * and to have full control over how the adapter works. */
+
+typedef struct redisAeEvents {
+    redisAsyncContext *context;
+    aeEventLoop *loop;
+    int fd;
+    int reading, writing;
+} redisAeEvents;
+
+static void redisAeReadEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
+    ((void)el); ((void)fd); ((void)mask);
+
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAsyncHandleRead(e->context);
+}
+
+static void redisAeWriteEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
+    ((void)el); ((void)fd); ((void)mask);
+
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAsyncHandleWrite(e->context);
+}
+
+static void redisAeAddRead(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (!e->reading) {
+        e->reading = 1;
+        aeCreateFileEvent(loop,e->fd,AE_READABLE,redisAeReadEvent,e);
+    }
+}
+
+static void redisAeDelRead(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (e->reading) {
+        e->reading = 0;
+        aeDeleteFileEvent(loop,e->fd,AE_READABLE);
+    }
+}
+
+static void redisAeAddWrite(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (!e->writing) {
+        e->writing = 1;
+        aeCreateFileEvent(loop,e->fd,AE_WRITABLE,redisAeWriteEvent,e);
+    }
+}
+
+static void redisAeDelWrite(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    aeEventLoop *loop = e->loop;
+    if (e->writing) {
+        e->writing = 0;
+        aeDeleteFileEvent(loop,e->fd,AE_WRITABLE);
+    }
+}
+
+static void redisAeCleanup(void *privdata) {
+    redisAeEvents *e = (redisAeEvents*)privdata;
+    redisAeDelRead(privdata);
+    redisAeDelWrite(privdata);
+    zfree(e);
+}
+
+static int redisAeAttach(aeEventLoop *loop, redisAsyncContext *ac) {
+    redisContext *c = &(ac->c);
+    redisAeEvents *e;
+
+    /* Nothing should be attached when something is already attached */
+    if (ac->ev.data != NULL)
+        return C_ERR;
+
+    /* Create container for context and r/w events */
+    e = (redisAeEvents*)zmalloc(sizeof(*e));
+    e->context = ac;
+    e->loop = loop;
+    e->fd = c->fd;
+    e->reading = e->writing = 0;
+
+    /* Register functions to start/stop listening for events */
+    ac->ev.addRead = redisAeAddRead;
+    ac->ev.delRead = redisAeDelRead;
+    ac->ev.addWrite = redisAeAddWrite;
+    ac->ev.delWrite = redisAeDelWrite;
+    ac->ev.cleanup = redisAeCleanup;
+    ac->ev.data = e;
+
+    return C_OK;
+}
+
+/* ============================= Prototypes ================================= */
+
+void sentinelLinkEstablishedCallback(const redisAsyncContext *c, int status);
+void sentinelDisconnectCallback(const redisAsyncContext *c, int status);
+void sentinelReceiveHelloMessages(redisAsyncContext *c, void *reply, void *privdata);
+sentinelRedisInstance *sentinelGetMasterByName(char *name);
+char *sentinelGetSubjectiveLeader(sentinelRedisInstance *master);
+char *sentinelGetObjectiveLeader(sentinelRedisInstance *master);
+int yesnotoi(char *s);
+void instanceLinkConnectionError(const redisAsyncContext *c);
+const char *sentinelRedisInstanceTypeStr(sentinelRedisInstance *ri);
+void sentinelAbortFailover(sentinelRedisInstance *ri);
+void sentinelEvent(int level, char *type, sentinelRedisInstance *ri, const char *fmt, ...);
+sentinelRedisInstance *sentinelSelectSlave(sentinelRedisInstance *master);
+void sentinelScheduleScriptExecution(char *path, ...);
+void sentinelStartFailover(sentinelRedisInstance *master);
+void sentinelDiscardReplyCallback(redisAsyncContext *c, void *reply, void *privdata);
+int sentinelSendSlaveOf(sentinelRedisInstance *ri, const sentinelAddr *addr);
+char *sentinelVoteLeader(sentinelRedisInstance *master, uint64_t req_epoch, char *req_runid, uint64_t *leader_epoch);
+void sentinelFlushConfig(void);
+void sentinelGenerateInitialMonitorEvents(void);
+int sentinelSendPing(sentinelRedisInstance *ri);
+int sentinelForceHelloUpdateForMaster(sentinelRedisInstance *master);
+sentinelRedisInstance *getSentinelRedisInstanceByAddrAndRunID(dict *instances, char *ip, int port, char *runid);
+void sentinelSimFailureCrash(void);
+
+/* ========================= Dictionary types =============================== */
+
+uint64_t dictSdsHash(const void *key);
+uint64_t dictSdsCaseHash(const void *key);
+int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
+int dictSdsKeyCaseCompare(void *privdata, const void *key1, const void *key2);
+void releaseSentinelRedisInstance(sentinelRedisInstance *ri);
+
+void dictInstancesValDestructor (void *privdata, void *obj) {
+    UNUSED(privdata);
+    releaseSentinelRedisInstance(obj);
+}
+
+/* Instance name (sds) -> instance (sentinelRedisInstance pointer)
+ *
+ * also used for: sentinelRedisInstance->sentinels dictionary that maps
+ * sentinels ip:port to last seen time in Pub/Sub hello message. */
+dictType instancesDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* key destructor */
+    dictInstancesValDestructor,/* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* Instance runid (sds) -> votes (long casted to void*)
+ *
+ * This is useful into sentinelGetObjectiveLeader() function in order to
+ * count the votes and understand who is the leader. */
+dictType leaderVotesDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* key destructor */
+    NULL,                      /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* Instance renamed commands table. */
+dictType renamedCommandsDictType = {
+    dictSdsCaseHash,           /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCaseCompare,     /* key compare */
+    dictSdsDestructor,         /* key destructor */
+    dictSdsDestructor,         /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* =========================== Initialization =============================== */
+
+void sentinelCommand(client *c);
+void sentinelInfoCommand(client *c);
+void sentinelSetCommand(client *c);
+void sentinelPublishCommand(client *c);
+void sentinelRoleCommand(client *c);
+void sentinelConfigGetCommand(client *c);
+void sentinelConfigSetCommand(client *c);
+
+struct redisCommand sentinelcmds[] = {
+    {"ping",pingCommand,1,"fast @connection",0,NULL,0,0,0,0,0},
+    {"sentinel",sentinelCommand,-2,"admin",0,NULL,0,0,0,0,0},
+    {"subscribe",subscribeCommand,-2,"pub-sub",0,NULL,0,0,0,0,0},
+    {"unsubscribe",unsubscribeCommand,-1,"pub-sub",0,NULL,0,0,0,0,0},
+    {"psubscribe",psubscribeCommand,-2,"pub-sub",0,NULL,0,0,0,0,0},
+    {"punsubscribe",punsubscribeCommand,-1,"pub-sub",0,NULL,0,0,0,0,0},
+    {"publish",sentinelPublishCommand,3,"pub-sub fast",0,NULL,0,0,0,0,0},
+    {"info",sentinelInfoCommand,-1,"random @dangerous",0,NULL,0,0,0,0,0},
+    {"role",sentinelRoleCommand,1,"fast read-only @dangerous",0,NULL,0,0,0,0,0},
+    {"client",clientCommand,-2,"admin random @connection",0,NULL,0,0,0,0,0},
+    {"shutdown",shutdownCommand,-1,"admin",0,NULL,0,0,0,0,0},
+    {"auth",authCommand,-2,"no-auth fast @connection",0,NULL,0,0,0,0,0},
+    {"hello",helloCommand,-1,"no-auth fast @connection",0,NULL,0,0,0,0,0},
+    {"acl",aclCommand,-2,"admin",0,NULL,0,0,0,0,0,0},
+    {"command",commandCommand,-1, "random @connection", 0,NULL,0,0,0,0,0,0}
+};
+
+/* this array is used for sentinel config lookup, which need to be loaded
+ * before monitoring masters config to avoid dependency issues */
+const char *preMonitorCfgName[] = { 
+    "announce-ip",
+    "announce-port",
+    "deny-scripts-reconfig",
+    "sentinel-user",
+    "sentinel-pass",
+    "current-epoch",
+    "myid",
+    "resolve-hostnames",
+    "announce-hostnames"
+};
+
+/* This function overwrites a few normal Redis config default with Sentinel
+ * specific defaults. */
+void initSentinelConfig(void) {
+    server.port = REDIS_SENTINEL_PORT;
+    server.protected_mode = 0; /* Sentinel must be exposed. */
+}
+
+void freeSentinelLoadQueueEntry(void *item);
+
+/* Perform the Sentinel mode initialization. */
+void initSentinel(void) {
+    unsigned int j;
+
+    /* Remove usual Redis commands from the command table, then just add
+     * the SENTINEL command. */
+    dictEmpty(server.commands,NULL);
+    dictEmpty(server.orig_commands,NULL);
+    ACLClearCommandID();
+    for (j = 0; j < sizeof(sentinelcmds)/sizeof(sentinelcmds[0]); j++) {
+        int retval;
+        struct redisCommand *cmd = sentinelcmds+j;
+        cmd->id = ACLGetCommandID(cmd->name); /* Assign the ID used for ACL. */
+        retval = dictAdd(server.commands, sdsnew(cmd->name), cmd);
+        serverAssert(retval == DICT_OK);
+        retval = dictAdd(server.orig_commands, sdsnew(cmd->name), cmd);
+        serverAssert(retval == DICT_OK);
+
+        /* Translate the command string flags description into an actual
+         * set of flags. */
+        if (populateCommandTableParseFlags(cmd,cmd->sflags) == C_ERR)
+            serverPanic("Unsupported command flag");
+    }
+
+    /* Initialize various data structures. */
+    sentinel.current_epoch = 0;
+    sentinel.masters = dictCreate(&instancesDictType,NULL);
+    sentinel.tilt = 0;
+    sentinel.tilt_start_time = 0;
+    sentinel.previous_time = mstime();
+    sentinel.running_scripts = 0;
+    sentinel.scripts_queue = listCreate();
+    sentinel.announce_ip = NULL;
+    sentinel.announce_port = 0;
+    sentinel.simfailure_flags = SENTINEL_SIMFAILURE_NONE;
+    sentinel.deny_scripts_reconfig = SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG;
+    sentinel.sentinel_auth_pass = NULL;
+    sentinel.sentinel_auth_user = NULL;
+    sentinel.resolve_hostnames = SENTINEL_DEFAULT_RESOLVE_HOSTNAMES;
+    sentinel.announce_hostnames = SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES;
+    memset(sentinel.myid,0,sizeof(sentinel.myid));
+    server.sentinel_config = NULL;
+}
+
+/* This function is for checking whether sentinel config file has been set,
+ * also checking whether we have write permissions. */
+void sentinelCheckConfigFile(void) {
+    if (server.configfile == NULL) {
+        serverLog(LL_WARNING,
+            "Sentinel needs config file on disk to save state. Exiting...");
+        exit(1);
+    } else if (access(server.configfile,W_OK) == -1) {
+        serverLog(LL_WARNING,
+            "Sentinel config file %s is not writable: %s. Exiting...",
+            server.configfile,strerror(errno));
+        exit(1);
+    }
+}
+
+/* This function gets called when the server is in Sentinel mode, started,
+ * loaded the configuration, and is ready for normal operations. */
+void sentinelIsRunning(void) {
+    int j;
+
+    /* If this Sentinel has yet no ID set in the configuration file, we
+     * pick a random one and persist the config on disk. From now on this
+     * will be this Sentinel ID across restarts. */
+    for (j = 0; j < CONFIG_RUN_ID_SIZE; j++)
+        if (sentinel.myid[j] != 0) break;
+
+    if (j == CONFIG_RUN_ID_SIZE) {
+        /* Pick ID and persist the config. */
+        getRandomHexChars(sentinel.myid,CONFIG_RUN_ID_SIZE);
+        sentinelFlushConfig();
+    }
+
+    /* Log its ID to make debugging of issues simpler. */
+    serverLog(LL_WARNING,"Sentinel ID is %s", sentinel.myid);
+
+    /* We want to generate a +monitor event for every configured master
+     * at startup. */
+    sentinelGenerateInitialMonitorEvents();
+}
+
+/* ============================== sentinelAddr ============================== */
+
+/* Create a sentinelAddr object and return it on success.
+ * On error NULL is returned and errno is set to:
+ *  ENOENT: Can't resolve the hostname.
+ *  EINVAL: Invalid port number.
+ */
+sentinelAddr *createSentinelAddr(char *hostname, int port) {
+    char ip[NET_IP_STR_LEN];
+    sentinelAddr *sa;
+
+    if (port < 0 || port > 65535) {
+        errno = EINVAL;
+        return NULL;
+    }
+    if (anetResolve(NULL,hostname,ip,sizeof(ip),
+                    sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR) {
+        errno = ENOENT;
+        return NULL;
+    }
+    sa = zmalloc(sizeof(*sa));
+    sa->hostname = sdsnew(hostname);
+    sa->ip = sdsnew(ip);
+    sa->port = port;
+    return sa;
+}
+
+/* Return a duplicate of the source address. */
+sentinelAddr *dupSentinelAddr(sentinelAddr *src) {
+    sentinelAddr *sa;
+
+    sa = zmalloc(sizeof(*sa));
+    sa->hostname = sdsnew(src->hostname);
+    sa->ip = sdsnew(src->ip);
+    sa->port = src->port;
+    return sa;
+}
+
+/* Free a Sentinel address. Can't fail. */
+void releaseSentinelAddr(sentinelAddr *sa) {
+    sdsfree(sa->hostname);
+    sdsfree(sa->ip);
+    zfree(sa);
+}
+
+/* Return non-zero if two addresses are equal. */
+int sentinelAddrIsEqual(sentinelAddr *a, sentinelAddr *b) {
+    return a->port == b->port && !strcasecmp(a->ip,b->ip);
+}
+
+/* Return non-zero if a hostname matches an address. */
+int sentinelAddrEqualsHostname(sentinelAddr *a, char *hostname) {
+    char ip[NET_IP_STR_LEN];
+
+    /* We always resolve the hostname and compare it to the address */
+    if (anetResolve(NULL, hostname, ip, sizeof(ip),
+                    sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR)
+        return 0;
+    return !strcasecmp(a->ip, ip);
+}
+
+const char *announceSentinelAddr(const sentinelAddr *a) {
+    return sentinel.announce_hostnames ? a->hostname : a->ip;
+}
+
+/* Return an allocated sds with hostname/address:port. IPv6
+ * addresses are bracketed the same way anetFormatAddr() does.
+ */
+sds announceSentinelAddrAndPort(const sentinelAddr *a) {
+    const char *addr = announceSentinelAddr(a);
+    if (strchr(addr, ':') != NULL)
+        return sdscatprintf(sdsempty(), "[%s]:%d", addr, a->port);
+    else
+        return sdscatprintf(sdsempty(), "%s:%d", addr, a->port);
+}
+
+/* =========================== Events notification ========================== */
+
+/* Send an event to log, pub/sub, user notification script.
+ *
+ * 'level' is the log level for logging. Only LL_WARNING events will trigger
+ * the execution of the user notification script.
+ *
+ * 'type' is the message type, also used as a pub/sub channel name.
+ *
+ * 'ri', is the redis instance target of this event if applicable, and is
+ * used to obtain the path of the notification script to execute.
+ *
+ * The remaining arguments are printf-alike.
+ * If the format specifier starts with the two characters "%@" then ri is
+ * not NULL, and the message is prefixed with an instance identifier in the
+ * following format:
+ *
+ *  <instance type> <instance name> <ip> <port>
+ *
+ *  If the instance type is not master, than the additional string is
+ *  added to specify the originating master:
+ *
+ *  @ <master name> <master ip> <master port>
+ *
+ *  Any other specifier after "%@" is processed by printf itself.
+ */
+void sentinelEvent(int level, char *type, sentinelRedisInstance *ri,
+                   const char *fmt, ...) {
+    va_list ap;
+    char msg[LOG_MAX_LEN];
+    robj *channel, *payload;
+
+    /* Handle %@ */
+    if (fmt[0] == '%' && fmt[1] == '@') {
+        sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ?
+                                         NULL : ri->master;
+
+        if (master) {
+            snprintf(msg, sizeof(msg), "%s %s %s %d @ %s %s %d",
+                sentinelRedisInstanceTypeStr(ri),
+                ri->name, announceSentinelAddr(ri->addr), ri->addr->port,
+                master->name, announceSentinelAddr(master->addr), master->addr->port);
+        } else {
+            snprintf(msg, sizeof(msg), "%s %s %s %d",
+                sentinelRedisInstanceTypeStr(ri),
+                ri->name, announceSentinelAddr(ri->addr), ri->addr->port);
+        }
+        fmt += 2;
+    } else {
+        msg[0] = '\0';
+    }
+
+    /* Use vsprintf for the rest of the formatting if any. */
+    if (fmt[0] != '\0') {
+        va_start(ap, fmt);
+        vsnprintf(msg+strlen(msg), sizeof(msg)-strlen(msg), fmt, ap);
+        va_end(ap);
+    }
+
+    /* Log the message if the log level allows it to be logged. */
+    if (level >= server.verbosity)
+        serverLog(level,"%s %s",type,msg);
+
+    /* Publish the message via Pub/Sub if it's not a debugging one. */
+    if (level != LL_DEBUG) {
+        channel = createStringObject(type,strlen(type));
+        payload = createStringObject(msg,strlen(msg));
+        pubsubPublishMessage(channel,payload);
+        decrRefCount(channel);
+        decrRefCount(payload);
+    }
+
+    /* Call the notification script if applicable. */
+    if (level == LL_WARNING && ri != NULL) {
+        sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ?
+                                         ri : ri->master;
+        if (master && master->notification_script) {
+            sentinelScheduleScriptExecution(master->notification_script,
+                type,msg,NULL);
+        }
+    }
+}
+
+/* This function is called only at startup and is used to generate a
+ * +monitor event for every configured master. The same events are also
+ * generated when a master to monitor is added at runtime via the
+ * SENTINEL MONITOR command. */
+void sentinelGenerateInitialMonitorEvents(void) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        sentinelEvent(LL_WARNING,"+monitor",ri,"%@ quorum %d",ri->quorum);
+    }
+    dictReleaseIterator(di);
+}
+
+/* ============================ script execution ============================ */
+
+/* Release a script job structure and all the associated data. */
+void sentinelReleaseScriptJob(sentinelScriptJob *sj) {
+    int j = 0;
+
+    while(sj->argv[j]) sdsfree(sj->argv[j++]);
+    zfree(sj->argv);
+    zfree(sj);
+}
+
+#define SENTINEL_SCRIPT_MAX_ARGS 16
+void sentinelScheduleScriptExecution(char *path, ...) {
+    va_list ap;
+    char *argv[SENTINEL_SCRIPT_MAX_ARGS+1];
+    int argc = 1;
+    sentinelScriptJob *sj;
+
+    va_start(ap, path);
+    while(argc < SENTINEL_SCRIPT_MAX_ARGS) {
+        argv[argc] = va_arg(ap,char*);
+        if (!argv[argc]) break;
+        argv[argc] = sdsnew(argv[argc]); /* Copy the string. */
+        argc++;
+    }
+    va_end(ap);
+    argv[0] = sdsnew(path);
+
+    sj = zmalloc(sizeof(*sj));
+    sj->flags = SENTINEL_SCRIPT_NONE;
+    sj->retry_num = 0;
+    sj->argv = zmalloc(sizeof(char*)*(argc+1));
+    sj->start_time = 0;
+    sj->pid = 0;
+    memcpy(sj->argv,argv,sizeof(char*)*(argc+1));
+
+    listAddNodeTail(sentinel.scripts_queue,sj);
+
+    /* Remove the oldest non running script if we already hit the limit. */
+    if (listLength(sentinel.scripts_queue) > SENTINEL_SCRIPT_MAX_QUEUE) {
+        listNode *ln;
+        listIter li;
+
+        listRewind(sentinel.scripts_queue,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            sj = ln->value;
+
+            if (sj->flags & SENTINEL_SCRIPT_RUNNING) continue;
+            /* The first node is the oldest as we add on tail. */
+            listDelNode(sentinel.scripts_queue,ln);
+            sentinelReleaseScriptJob(sj);
+            break;
+        }
+        serverAssert(listLength(sentinel.scripts_queue) <=
+                    SENTINEL_SCRIPT_MAX_QUEUE);
+    }
+}
+
+/* Lookup a script in the scripts queue via pid, and returns the list node
+ * (so that we can easily remove it from the queue if needed). */
+listNode *sentinelGetScriptListNodeByPid(pid_t pid) {
+    listNode *ln;
+    listIter li;
+
+    listRewind(sentinel.scripts_queue,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        sentinelScriptJob *sj = ln->value;
+
+        if ((sj->flags & SENTINEL_SCRIPT_RUNNING) && sj->pid == pid)
+            return ln;
+    }
+    return NULL;
+}
+
+/* Run pending scripts if we are not already at max number of running
+ * scripts. */
+void sentinelRunPendingScripts(void) {
+    listNode *ln;
+    listIter li;
+    mstime_t now = mstime();
+
+    /* Find jobs that are not running and run them, from the top to the
+     * tail of the queue, so we run older jobs first. */
+    listRewind(sentinel.scripts_queue,&li);
+    while (sentinel.running_scripts < SENTINEL_SCRIPT_MAX_RUNNING &&
+           (ln = listNext(&li)) != NULL)
+    {
+        sentinelScriptJob *sj = ln->value;
+        pid_t pid;
+
+        /* Skip if already running. */
+        if (sj->flags & SENTINEL_SCRIPT_RUNNING) continue;
+
+        /* Skip if it's a retry, but not enough time has elapsed. */
+        if (sj->start_time && sj->start_time > now) continue;
+
+        sj->flags |= SENTINEL_SCRIPT_RUNNING;
+        sj->start_time = mstime();
+        sj->retry_num++;
+        pid = fork();
+
+        if (pid == -1) {
+            /* Parent (fork error).
+             * We report fork errors as signal 99, in order to unify the
+             * reporting with other kind of errors. */
+            sentinelEvent(LL_WARNING,"-script-error",NULL,
+                          "%s %d %d", sj->argv[0], 99, 0);
+            sj->flags &= ~SENTINEL_SCRIPT_RUNNING;
+            sj->pid = 0;
+        } else if (pid == 0) {
+            /* Child */
+            tlsCleanup();
+            execve(sj->argv[0],sj->argv,environ);
+            /* If we are here an error occurred. */
+            _exit(2); /* Don't retry execution. */
+        } else {
+            sentinel.running_scripts++;
+            sj->pid = pid;
+            sentinelEvent(LL_DEBUG,"+script-child",NULL,"%ld",(long)pid);
+        }
+    }
+}
+
+/* How much to delay the execution of a script that we need to retry after
+ * an error?
+ *
+ * We double the retry delay for every further retry we do. So for instance
+ * if RETRY_DELAY is set to 30 seconds and the max number of retries is 10
+ * starting from the second attempt to execute the script the delays are:
+ * 30 sec, 60 sec, 2 min, 4 min, 8 min, 16 min, 32 min, 64 min, 128 min. */
+mstime_t sentinelScriptRetryDelay(int retry_num) {
+    mstime_t delay = SENTINEL_SCRIPT_RETRY_DELAY;
+
+    while (retry_num-- > 1) delay *= 2;
+    return delay;
+}
+
+/* Check for scripts that terminated, and remove them from the queue if the
+ * script terminated successfully. If instead the script was terminated by
+ * a signal, or returned exit code "1", it is scheduled to run again if
+ * the max number of retries did not already elapsed. */
+void sentinelCollectTerminatedScripts(void) {
+    int statloc;
+    pid_t pid;
+
+    while ((pid = waitpid(-1, &statloc, WNOHANG)) > 0) {
+        int exitcode = WEXITSTATUS(statloc);
+        int bysignal = 0;
+        listNode *ln;
+        sentinelScriptJob *sj;
+
+        if (WIFSIGNALED(statloc)) bysignal = WTERMSIG(statloc);
+        sentinelEvent(LL_DEBUG,"-script-child",NULL,"%ld %d %d",
+            (long)pid, exitcode, bysignal);
+
+        ln = sentinelGetScriptListNodeByPid(pid);
+        if (ln == NULL) {
+            serverLog(LL_WARNING,"waitpid() returned a pid (%ld) we can't find in our scripts execution queue!", (long)pid);
+            continue;
+        }
+        sj = ln->value;
+
+        /* If the script was terminated by a signal or returns an
+         * exit code of "1" (that means: please retry), we reschedule it
+         * if the max number of retries is not already reached. */
+        if ((bysignal || exitcode == 1) &&
+            sj->retry_num != SENTINEL_SCRIPT_MAX_RETRY)
+        {
+            sj->flags &= ~SENTINEL_SCRIPT_RUNNING;
+            sj->pid = 0;
+            sj->start_time = mstime() +
+                             sentinelScriptRetryDelay(sj->retry_num);
+        } else {
+            /* Otherwise let's remove the script, but log the event if the
+             * execution did not terminated in the best of the ways. */
+            if (bysignal || exitcode != 0) {
+                sentinelEvent(LL_WARNING,"-script-error",NULL,
+                              "%s %d %d", sj->argv[0], bysignal, exitcode);
+            }
+            listDelNode(sentinel.scripts_queue,ln);
+            sentinelReleaseScriptJob(sj);
+        }
+        sentinel.running_scripts--;
+    }
+}
+
+/* Kill scripts in timeout, they'll be collected by the
+ * sentinelCollectTerminatedScripts() function. */
+void sentinelKillTimedoutScripts(void) {
+    listNode *ln;
+    listIter li;
+    mstime_t now = mstime();
+
+    listRewind(sentinel.scripts_queue,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        sentinelScriptJob *sj = ln->value;
+
+        if (sj->flags & SENTINEL_SCRIPT_RUNNING &&
+            (now - sj->start_time) > SENTINEL_SCRIPT_MAX_RUNTIME)
+        {
+            sentinelEvent(LL_WARNING,"-script-timeout",NULL,"%s %ld",
+                sj->argv[0], (long)sj->pid);
+            kill(sj->pid,SIGKILL);
+        }
+    }
+}
+
+/* Implements SENTINEL PENDING-SCRIPTS command. */
+void sentinelPendingScriptsCommand(client *c) {
+    listNode *ln;
+    listIter li;
+
+    addReplyArrayLen(c,listLength(sentinel.scripts_queue));
+    listRewind(sentinel.scripts_queue,&li);
+    while ((ln = listNext(&li)) != NULL) {
+        sentinelScriptJob *sj = ln->value;
+        int j = 0;
+
+        addReplyMapLen(c,5);
+
+        addReplyBulkCString(c,"argv");
+        while (sj->argv[j]) j++;
+        addReplyArrayLen(c,j);
+        j = 0;
+        while (sj->argv[j]) addReplyBulkCString(c,sj->argv[j++]);
+
+        addReplyBulkCString(c,"flags");
+        addReplyBulkCString(c,
+            (sj->flags & SENTINEL_SCRIPT_RUNNING) ? "running" : "scheduled");
+
+        addReplyBulkCString(c,"pid");
+        addReplyBulkLongLong(c,sj->pid);
+
+        if (sj->flags & SENTINEL_SCRIPT_RUNNING) {
+            addReplyBulkCString(c,"run-time");
+            addReplyBulkLongLong(c,mstime() - sj->start_time);
+        } else {
+            mstime_t delay = sj->start_time ? (sj->start_time-mstime()) : 0;
+            if (delay < 0) delay = 0;
+            addReplyBulkCString(c,"run-delay");
+            addReplyBulkLongLong(c,delay);
+        }
+
+        addReplyBulkCString(c,"retry-num");
+        addReplyBulkLongLong(c,sj->retry_num);
+    }
+}
+
+/* This function calls, if any, the client reconfiguration script with the
+ * following parameters:
+ *
+ * <master-name> <role> <state> <from-ip> <from-port> <to-ip> <to-port>
+ *
+ * It is called every time a failover is performed.
+ *
+ * <state> is currently always "failover".
+ * <role> is either "leader" or "observer".
+ *
+ * from/to fields are respectively master -> promoted slave addresses for
+ * "start" and "end". */
+void sentinelCallClientReconfScript(sentinelRedisInstance *master, int role, char *state, sentinelAddr *from, sentinelAddr *to) {
+    char fromport[32], toport[32];
+
+    if (master->client_reconfig_script == NULL) return;
+    ll2string(fromport,sizeof(fromport),from->port);
+    ll2string(toport,sizeof(toport),to->port);
+    sentinelScheduleScriptExecution(master->client_reconfig_script,
+        master->name,
+        (role == SENTINEL_LEADER) ? "leader" : "observer",
+        state, announceSentinelAddr(from), fromport,
+        announceSentinelAddr(to), toport, NULL);
+}
+
+/* =============================== instanceLink ============================= */
+
+/* Create a not yet connected link object. */
+instanceLink *createInstanceLink(void) {
+    instanceLink *link = zmalloc(sizeof(*link));
+
+    link->refcount = 1;
+    link->disconnected = 1;
+    link->pending_commands = 0;
+    link->cc = NULL;
+    link->pc = NULL;
+    link->cc_conn_time = 0;
+    link->pc_conn_time = 0;
+    link->last_reconn_time = 0;
+    link->pc_last_activity = 0;
+    /* We set the act_ping_time to "now" even if we actually don't have yet
+     * a connection with the node, nor we sent a ping.
+     * This is useful to detect a timeout in case we'll not be able to connect
+     * with the node at all. */
+    link->act_ping_time = mstime();
+    link->last_ping_time = 0;
+    link->last_avail_time = mstime();
+    link->last_pong_time = mstime();
+    return link;
+}
+
+/* Disconnect a hiredis connection in the context of an instance link. */
+void instanceLinkCloseConnection(instanceLink *link, redisAsyncContext *c) {
+    if (c == NULL) return;
+
+    if (link->cc == c) {
+        link->cc = NULL;
+        link->pending_commands = 0;
+    }
+    if (link->pc == c) link->pc = NULL;
+    c->data = NULL;
+    link->disconnected = 1;
+    redisAsyncFree(c);
+}
+
+/* Decrement the refcount of a link object, if it drops to zero, actually
+ * free it and return NULL. Otherwise don't do anything and return the pointer
+ * to the object.
+ *
+ * If we are not going to free the link and ri is not NULL, we rebind all the
+ * pending requests in link->cc (hiredis connection for commands) to a
+ * callback that will just ignore them. This is useful to avoid processing
+ * replies for an instance that no longer exists. */
+instanceLink *releaseInstanceLink(instanceLink *link, sentinelRedisInstance *ri)
+{
+    serverAssert(link->refcount > 0);
+    link->refcount--;
+    if (link->refcount != 0) {
+        if (ri && ri->link->cc) {
+            /* This instance may have pending callbacks in the hiredis async
+             * context, having as 'privdata' the instance that we are going to
+             * free. Let's rewrite the callback list, directly exploiting
+             * hiredis internal data structures, in order to bind them with
+             * a callback that will ignore the reply at all. */
+            redisCallback *cb;
+            redisCallbackList *callbacks = &link->cc->replies;
+
+            cb = callbacks->head;
+            while(cb) {
+                if (cb->privdata == ri) {
+                    cb->fn = sentinelDiscardReplyCallback;
+                    cb->privdata = NULL; /* Not strictly needed. */
+                }
+                cb = cb->next;
+            }
+        }
+        return link; /* Other active users. */
+    }
+
+    instanceLinkCloseConnection(link,link->cc);
+    instanceLinkCloseConnection(link,link->pc);
+    zfree(link);
+    return NULL;
+}
+
+/* This function will attempt to share the instance link we already have
+ * for the same Sentinel in the context of a different master, with the
+ * instance we are passing as argument.
+ *
+ * This way multiple Sentinel objects that refer all to the same physical
+ * Sentinel instance but in the context of different masters will use
+ * a single connection, will send a single PING per second for failure
+ * detection and so forth.
+ *
+ * Return C_OK if a matching Sentinel was found in the context of a
+ * different master and sharing was performed. Otherwise C_ERR
+ * is returned. */
+int sentinelTryConnectionSharing(sentinelRedisInstance *ri) {
+    serverAssert(ri->flags & SRI_SENTINEL);
+    dictIterator *di;
+    dictEntry *de;
+
+    if (ri->runid == NULL) return C_ERR; /* No way to identify it. */
+    if (ri->link->refcount > 1) return C_ERR; /* Already shared. */
+
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *master = dictGetVal(de), *match;
+        /* We want to share with the same physical Sentinel referenced
+         * in other masters, so skip our master. */
+        if (master == ri->master) continue;
+        match = getSentinelRedisInstanceByAddrAndRunID(master->sentinels,
+                                                       NULL,0,ri->runid);
+        if (match == NULL) continue; /* No match. */
+        if (match == ri) continue; /* Should never happen but... safer. */
+
+        /* We identified a matching Sentinel, great! Let's free our link
+         * and use the one of the matching Sentinel. */
+        releaseInstanceLink(ri->link,NULL);
+        ri->link = match->link;
+        match->link->refcount++;
+        dictReleaseIterator(di);
+        return C_OK;
+    }
+    dictReleaseIterator(di);
+    return C_ERR;
+}
+
+/* Drop all connections to other sentinels. Returns the number of connections
+ * dropped.*/
+int sentinelDropConnections(void) {
+    dictIterator *di;
+    dictEntry *de;
+    int dropped = 0;
+
+    di = dictGetIterator(sentinel.masters);
+    while ((de = dictNext(di)) != NULL) {
+        dictIterator *sdi;
+        dictEntry *sde;
+
+        sentinelRedisInstance *ri = dictGetVal(de);
+        sdi = dictGetIterator(ri->sentinels);
+        while ((sde = dictNext(sdi)) != NULL) {
+            sentinelRedisInstance *si = dictGetVal(sde);
+            if (!si->link->disconnected) {
+                instanceLinkCloseConnection(si->link, si->link->pc);
+                instanceLinkCloseConnection(si->link, si->link->cc);
+                dropped++;
+            }
+        }
+        dictReleaseIterator(sdi);
+    }
+    dictReleaseIterator(di);
+
+    return dropped;
+}
+
+/* When we detect a Sentinel to switch address (reporting a different IP/port
+ * pair in Hello messages), let's update all the matching Sentinels in the
+ * context of other masters as well and disconnect the links, so that everybody
+ * will be updated.
+ *
+ * Return the number of updated Sentinel addresses. */
+int sentinelUpdateSentinelAddressInAllMasters(sentinelRedisInstance *ri) {
+    serverAssert(ri->flags & SRI_SENTINEL);
+    dictIterator *di;
+    dictEntry *de;
+    int reconfigured = 0;
+
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *master = dictGetVal(de), *match;
+        match = getSentinelRedisInstanceByAddrAndRunID(master->sentinels,
+                                                       NULL,0,ri->runid);
+        /* If there is no match, this master does not know about this
+         * Sentinel, try with the next one. */
+        if (match == NULL) continue;
+
+        /* Disconnect the old links if connected. */
+        if (match->link->cc != NULL)
+            instanceLinkCloseConnection(match->link,match->link->cc);
+        if (match->link->pc != NULL)
+            instanceLinkCloseConnection(match->link,match->link->pc);
+
+        if (match == ri) continue; /* Address already updated for it. */
+
+        /* Update the address of the matching Sentinel by copying the address
+         * of the Sentinel object that received the address update. */
+        releaseSentinelAddr(match->addr);
+        match->addr = dupSentinelAddr(ri->addr);
+        reconfigured++;
+    }
+    dictReleaseIterator(di);
+    if (reconfigured)
+        sentinelEvent(LL_NOTICE,"+sentinel-address-update", ri,
+                    "%@ %d additional matching instances", reconfigured);
+    return reconfigured;
+}
+
+/* This function is called when a hiredis connection reported an error.
+ * We set it to NULL and mark the link as disconnected so that it will be
+ * reconnected again.
+ *
+ * Note: we don't free the hiredis context as hiredis will do it for us
+ * for async connections. */
+void instanceLinkConnectionError(const redisAsyncContext *c) {
+    instanceLink *link = c->data;
+    int pubsub;
+
+    if (!link) return;
+
+    pubsub = (link->pc == c);
+    if (pubsub)
+        link->pc = NULL;
+    else
+        link->cc = NULL;
+    link->disconnected = 1;
+}
+
+/* Hiredis connection established / disconnected callbacks. We need them
+ * just to cleanup our link state. */
+void sentinelLinkEstablishedCallback(const redisAsyncContext *c, int status) {
+    if (status != C_OK) instanceLinkConnectionError(c);
+}
+
+void sentinelDisconnectCallback(const redisAsyncContext *c, int status) {
+    UNUSED(status);
+    instanceLinkConnectionError(c);
+}
+
+/* ========================== sentinelRedisInstance ========================= */
+
+/* Create a redis instance, the following fields must be populated by the
+ * caller if needed:
+ * runid: set to NULL but will be populated once INFO output is received.
+ * info_refresh: is set to 0 to mean that we never received INFO so far.
+ *
+ * If SRI_MASTER is set into initial flags the instance is added to
+ * sentinel.masters table.
+ *
+ * if SRI_SLAVE or SRI_SENTINEL is set then 'master' must be not NULL and the
+ * instance is added into master->slaves or master->sentinels table.
+ *
+ * If the instance is a slave or sentinel, the name parameter is ignored and
+ * is created automatically as hostname:port.
+ *
+ * The function fails if hostname can't be resolved or port is out of range.
+ * When this happens NULL is returned and errno is set accordingly to the
+ * createSentinelAddr() function.
+ *
+ * The function may also fail and return NULL with errno set to EBUSY if
+ * a master with the same name, a slave with the same address, or a sentinel
+ * with the same ID already exists. */
+
+sentinelRedisInstance *createSentinelRedisInstance(char *name, int flags, char *hostname, int port, int quorum, sentinelRedisInstance *master) {
+    sentinelRedisInstance *ri;
+    sentinelAddr *addr;
+    dict *table = NULL;
+    sds sdsname;
+
+    serverAssert(flags & (SRI_MASTER|SRI_SLAVE|SRI_SENTINEL));
+    serverAssert((flags & SRI_MASTER) || master != NULL);
+
+    /* Check address validity. */
+    addr = createSentinelAddr(hostname,port);
+    if (addr == NULL) return NULL;
+
+    /* For slaves use ip/host:port as name. */
+    if (flags & SRI_SLAVE)
+        sdsname = announceSentinelAddrAndPort(addr);
+    else
+        sdsname = sdsnew(name);
+
+    /* Make sure the entry is not duplicated. This may happen when the same
+     * name for a master is used multiple times inside the configuration or
+     * if we try to add multiple times a slave or sentinel with same ip/port
+     * to a master. */
+    if (flags & SRI_MASTER) table = sentinel.masters;
+    else if (flags & SRI_SLAVE) table = master->slaves;
+    else if (flags & SRI_SENTINEL) table = master->sentinels;
+    if (dictFind(table,sdsname)) {
+        releaseSentinelAddr(addr);
+        sdsfree(sdsname);
+        errno = EBUSY;
+        return NULL;
+    }
+
+    /* Create the instance object. */
+    ri = zmalloc(sizeof(*ri));
+    /* Note that all the instances are started in the disconnected state,
+     * the event loop will take care of connecting them. */
+    ri->flags = flags;
+    ri->name = sdsname;
+    ri->runid = NULL;
+    ri->config_epoch = 0;
+    ri->addr = addr;
+    ri->link = createInstanceLink();
+    ri->last_pub_time = mstime();
+    ri->last_hello_time = mstime();
+    ri->last_master_down_reply_time = mstime();
+    ri->s_down_since_time = 0;
+    ri->o_down_since_time = 0;
+    ri->down_after_period = master ? master->down_after_period :
+                            SENTINEL_DEFAULT_DOWN_AFTER;
+    ri->master_link_down_time = 0;
+    ri->auth_pass = NULL;
+    ri->auth_user = NULL;
+    ri->slave_priority = SENTINEL_DEFAULT_SLAVE_PRIORITY;
+    ri->replica_announced = 1;
+    ri->slave_reconf_sent_time = 0;
+    ri->slave_master_host = NULL;
+    ri->slave_master_port = 0;
+    ri->slave_master_link_status = SENTINEL_MASTER_LINK_STATUS_DOWN;
+    ri->slave_repl_offset = 0;
+    ri->sentinels = dictCreate(&instancesDictType,NULL);
+    ri->quorum = quorum;
+    ri->parallel_syncs = SENTINEL_DEFAULT_PARALLEL_SYNCS;
+    ri->master = master;
+    ri->slaves = dictCreate(&instancesDictType,NULL);
+    ri->info_refresh = 0;
+    ri->renamed_commands = dictCreate(&renamedCommandsDictType,NULL);
+
+    /* Failover state. */
+    ri->leader = NULL;
+    ri->leader_epoch = 0;
+    ri->failover_epoch = 0;
+    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
+    ri->failover_state_change_time = 0;
+    ri->failover_start_time = 0;
+    ri->failover_timeout = SENTINEL_DEFAULT_FAILOVER_TIMEOUT;
+    ri->failover_delay_logged = 0;
+    ri->promoted_slave = NULL;
+    ri->notification_script = NULL;
+    ri->client_reconfig_script = NULL;
+    ri->info = NULL;
+
+    /* Role */
+    ri->role_reported = ri->flags & (SRI_MASTER|SRI_SLAVE);
+    ri->role_reported_time = mstime();
+    ri->slave_conf_change_time = mstime();
+
+    /* Add into the right table. */
+    dictAdd(table, ri->name, ri);
+    return ri;
+}
+
+/* Release this instance and all its slaves, sentinels, hiredis connections.
+ * This function does not take care of unlinking the instance from the main
+ * masters table (if it is a master) or from its master sentinels/slaves table
+ * if it is a slave or sentinel. */
+void releaseSentinelRedisInstance(sentinelRedisInstance *ri) {
+    /* Release all its slaves or sentinels if any. */
+    dictRelease(ri->sentinels);
+    dictRelease(ri->slaves);
+
+    /* Disconnect the instance. */
+    releaseInstanceLink(ri->link,ri);
+
+    /* Free other resources. */
+    sdsfree(ri->name);
+    sdsfree(ri->runid);
+    sdsfree(ri->notification_script);
+    sdsfree(ri->client_reconfig_script);
+    sdsfree(ri->slave_master_host);
+    sdsfree(ri->leader);
+    sdsfree(ri->auth_pass);
+    sdsfree(ri->auth_user);
+    sdsfree(ri->info);
+    releaseSentinelAddr(ri->addr);
+    dictRelease(ri->renamed_commands);
+
+    /* Clear state into the master if needed. */
+    if ((ri->flags & SRI_SLAVE) && (ri->flags & SRI_PROMOTED) && ri->master)
+        ri->master->promoted_slave = NULL;
+
+    zfree(ri);
+}
+
+/* Lookup a slave in a master Redis instance, by ip and port. */
+sentinelRedisInstance *sentinelRedisInstanceLookupSlave(
+                sentinelRedisInstance *ri, char *slave_addr, int port)
+{
+    sds key;
+    sentinelRedisInstance *slave;
+    sentinelAddr *addr;
+
+    serverAssert(ri->flags & SRI_MASTER);
+
+    /* We need to handle a slave_addr that is potentially a hostname.
+     * If that is the case, depending on configuration we either resolve
+     * it and use the IP addres or fail.
+     */
+    addr = createSentinelAddr(slave_addr, port);
+    if (!addr) return NULL;
+    key = announceSentinelAddrAndPort(addr);
+    releaseSentinelAddr(addr);
+
+    slave = dictFetchValue(ri->slaves,key);
+    sdsfree(key);
+    return slave;
+}
+
+/* Return the name of the type of the instance as a string. */
+const char *sentinelRedisInstanceTypeStr(sentinelRedisInstance *ri) {
+    if (ri->flags & SRI_MASTER) return "master";
+    else if (ri->flags & SRI_SLAVE) return "slave";
+    else if (ri->flags & SRI_SENTINEL) return "sentinel";
+    else return "unknown";
+}
+
+/* This function remove the Sentinel with the specified ID from the
+ * specified master.
+ *
+ * If "runid" is NULL the function returns ASAP.
+ *
+ * This function is useful because on Sentinels address switch, we want to
+ * remove our old entry and add a new one for the same ID but with the new
+ * address.
+ *
+ * The function returns 1 if the matching Sentinel was removed, otherwise
+ * 0 if there was no Sentinel with this ID. */
+int removeMatchingSentinelFromMaster(sentinelRedisInstance *master, char *runid) {
+    dictIterator *di;
+    dictEntry *de;
+    int removed = 0;
+
+    if (runid == NULL) return 0;
+
+    di = dictGetSafeIterator(master->sentinels);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        if (ri->runid && strcmp(ri->runid,runid) == 0) {
+            dictDelete(master->sentinels,ri->name);
+            removed++;
+        }
+    }
+    dictReleaseIterator(di);
+    return removed;
+}
+
+/* Search an instance with the same runid, ip and port into a dictionary
+ * of instances. Return NULL if not found, otherwise return the instance
+ * pointer.
+ *
+ * runid or addr can be NULL. In such a case the search is performed only
+ * by the non-NULL field. */
+sentinelRedisInstance *getSentinelRedisInstanceByAddrAndRunID(dict *instances, char *addr, int port, char *runid) {
+    dictIterator *di;
+    dictEntry *de;
+    sentinelRedisInstance *instance = NULL;
+    sentinelAddr *ri_addr = NULL;
+
+    serverAssert(addr || runid);   /* User must pass at least one search param. */
+    if (addr != NULL) {
+        /* Resolve addr, we use the IP as a key even if a hostname is used */
+        ri_addr = createSentinelAddr(addr, port);
+        if (!ri_addr) return NULL;
+    }
+    di = dictGetIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        if (runid && !ri->runid) continue;
+        if ((runid == NULL || strcmp(ri->runid, runid) == 0) &&
+            (addr == NULL || (strcmp(ri->addr->ip, ri_addr->ip) == 0 &&
+                            ri->addr->port == port)))
+        {
+            instance = ri;
+            break;
+        }
+    }
+    dictReleaseIterator(di);
+    if (ri_addr != NULL)
+        releaseSentinelAddr(ri_addr);
+
+    return instance;
+}
+
+/* Master lookup by name */
+sentinelRedisInstance *sentinelGetMasterByName(char *name) {
+    sentinelRedisInstance *ri;
+    sds sdsname = sdsnew(name);
+
+    ri = dictFetchValue(sentinel.masters,sdsname);
+    sdsfree(sdsname);
+    return ri;
+}
+
+/* Add the specified flags to all the instances in the specified dictionary. */
+void sentinelAddFlagsToDictOfRedisInstances(dict *instances, int flags) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        ri->flags |= flags;
+    }
+    dictReleaseIterator(di);
+}
+
+/* Remove the specified flags to all the instances in the specified
+ * dictionary. */
+void sentinelDelFlagsToDictOfRedisInstances(dict *instances, int flags) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        ri->flags &= ~flags;
+    }
+    dictReleaseIterator(di);
+}
+
+/* Reset the state of a monitored master:
+ * 1) Remove all slaves.
+ * 2) Remove all sentinels.
+ * 3) Remove most of the flags resulting from runtime operations.
+ * 4) Reset timers to their default value. For example after a reset it will be
+ *    possible to failover again the same master ASAP, without waiting the
+ *    failover timeout delay.
+ * 5) In the process of doing this undo the failover if in progress.
+ * 6) Disconnect the connections with the master (will reconnect automatically).
+ */
+
+#define SENTINEL_RESET_NO_SENTINELS (1<<0)
+void sentinelResetMaster(sentinelRedisInstance *ri, int flags) {
+    serverAssert(ri->flags & SRI_MASTER);
+    dictRelease(ri->slaves);
+    ri->slaves = dictCreate(&instancesDictType,NULL);
+    if (!(flags & SENTINEL_RESET_NO_SENTINELS)) {
+        dictRelease(ri->sentinels);
+        ri->sentinels = dictCreate(&instancesDictType,NULL);
+    }
+    instanceLinkCloseConnection(ri->link,ri->link->cc);
+    instanceLinkCloseConnection(ri->link,ri->link->pc);
+    ri->flags &= SRI_MASTER;
+    if (ri->leader) {
+        sdsfree(ri->leader);
+        ri->leader = NULL;
+    }
+    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
+    ri->failover_state_change_time = 0;
+    ri->failover_start_time = 0; /* We can failover again ASAP. */
+    ri->promoted_slave = NULL;
+    sdsfree(ri->runid);
+    sdsfree(ri->slave_master_host);
+    ri->runid = NULL;
+    ri->slave_master_host = NULL;
+    ri->link->act_ping_time = mstime();
+    ri->link->last_ping_time = 0;
+    ri->link->last_avail_time = mstime();
+    ri->link->last_pong_time = mstime();
+    ri->role_reported_time = mstime();
+    ri->role_reported = SRI_MASTER;
+    if (flags & SENTINEL_GENERATE_EVENT)
+        sentinelEvent(LL_WARNING,"+reset-master",ri,"%@");
+}
+
+/* Call sentinelResetMaster() on every master with a name matching the specified
+ * pattern. */
+int sentinelResetMastersByPattern(char *pattern, int flags) {
+    dictIterator *di;
+    dictEntry *de;
+    int reset = 0;
+
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        if (ri->name) {
+            if (stringmatch(pattern,ri->name,0)) {
+                sentinelResetMaster(ri,flags);
+                reset++;
+            }
+        }
+    }
+    dictReleaseIterator(di);
+    return reset;
+}
+
+/* Reset the specified master with sentinelResetMaster(), and also change
+ * the ip:port address, but take the name of the instance unmodified.
+ *
+ * This is used to handle the +switch-master event.
+ *
+ * The function returns C_ERR if the address can't be resolved for some
+ * reason. Otherwise C_OK is returned.  */
+int sentinelResetMasterAndChangeAddress(sentinelRedisInstance *master, char *hostname, int port) {
+    sentinelAddr *oldaddr, *newaddr;
+    sentinelAddr **slaves = NULL;
+    int numslaves = 0, j;
+    dictIterator *di;
+    dictEntry *de;
+
+    newaddr = createSentinelAddr(hostname,port);
+    if (newaddr == NULL) return C_ERR;
+
+    /* There can be only 0 or 1 slave that has the newaddr.
+     * and It can add old master 1 more slave. 
+     * so It allocates dictSize(master->slaves) + 1          */
+    slaves = zmalloc(sizeof(sentinelAddr*)*(dictSize(master->slaves) + 1));
+    
+    /* Don't include the one having the address we are switching to. */
+    di = dictGetIterator(master->slaves);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *slave = dictGetVal(de);
+
+        if (sentinelAddrIsEqual(slave->addr,newaddr)) continue;
+        slaves[numslaves++] = dupSentinelAddr(slave->addr);
+    }
+    dictReleaseIterator(di);
+
+    /* If we are switching to a different address, include the old address
+     * as a slave as well, so that we'll be able to sense / reconfigure
+     * the old master. */
+    if (!sentinelAddrIsEqual(newaddr,master->addr)) {
+        slaves[numslaves++] = dupSentinelAddr(master->addr);
+    }
+
+    /* Reset and switch address. */
+    sentinelResetMaster(master,SENTINEL_RESET_NO_SENTINELS);
+    oldaddr = master->addr;
+    master->addr = newaddr;
+    master->o_down_since_time = 0;
+    master->s_down_since_time = 0;
+
+    /* Add slaves back. */
+    for (j = 0; j < numslaves; j++) {
+        sentinelRedisInstance *slave;
+
+        slave = createSentinelRedisInstance(NULL,SRI_SLAVE,slaves[j]->hostname,
+                    slaves[j]->port, master->quorum, master);
+        releaseSentinelAddr(slaves[j]);
+        if (slave) sentinelEvent(LL_NOTICE,"+slave",slave,"%@");
+    }
+    zfree(slaves);
+
+    /* Release the old address at the end so we are safe even if the function
+     * gets the master->addr->ip and master->addr->port as arguments. */
+    releaseSentinelAddr(oldaddr);
+    sentinelFlushConfig();
+    return C_OK;
+}
+
+/* Return non-zero if there was no SDOWN or ODOWN error associated to this
+ * instance in the latest 'ms' milliseconds. */
+int sentinelRedisInstanceNoDownFor(sentinelRedisInstance *ri, mstime_t ms) {
+    mstime_t most_recent;
+
+    most_recent = ri->s_down_since_time;
+    if (ri->o_down_since_time > most_recent)
+        most_recent = ri->o_down_since_time;
+    return most_recent == 0 || (mstime() - most_recent) > ms;
+}
+
+/* Return the current master address, that is, its address or the address
+ * of the promoted slave if already operational. */
+sentinelAddr *sentinelGetCurrentMasterAddress(sentinelRedisInstance *master) {
+    /* If we are failing over the master, and the state is already
+     * SENTINEL_FAILOVER_STATE_RECONF_SLAVES or greater, it means that we
+     * already have the new configuration epoch in the master, and the
+     * slave acknowledged the configuration switch. Advertise the new
+     * address. */
+    if ((master->flags & SRI_FAILOVER_IN_PROGRESS) &&
+        master->promoted_slave &&
+        master->failover_state >= SENTINEL_FAILOVER_STATE_RECONF_SLAVES)
+    {
+        return master->promoted_slave->addr;
+    } else {
+        return master->addr;
+    }
+}
+
+/* This function sets the down_after_period field value in 'master' to all
+ * the slaves and sentinel instances connected to this master. */
+void sentinelPropagateDownAfterPeriod(sentinelRedisInstance *master) {
+    dictIterator *di;
+    dictEntry *de;
+    int j;
+    dict *d[] = {master->slaves, master->sentinels, NULL};
+
+    for (j = 0; d[j]; j++) {
+        di = dictGetIterator(d[j]);
+        while((de = dictNext(di)) != NULL) {
+            sentinelRedisInstance *ri = dictGetVal(de);
+            ri->down_after_period = master->down_after_period;
+        }
+        dictReleaseIterator(di);
+    }
+}
+
+/* This function is used in order to send commands to Redis instances: the
+ * commands we send from Sentinel may be renamed, a common case is a master
+ * with CONFIG and SLAVEOF commands renamed for security concerns. In that
+ * case we check the ri->renamed_command table (or if the instance is a slave,
+ * we check the one of the master), and map the command that we should send
+ * to the set of renamed commands. However, if the command was not renamed,
+ * we just return "command" itself. */
+char *sentinelInstanceMapCommand(sentinelRedisInstance *ri, char *command) {
+    sds sc = sdsnew(command);
+    if (ri->master) ri = ri->master;
+    char *retval = dictFetchValue(ri->renamed_commands, sc);
+    sdsfree(sc);
+    return retval ? retval : command;
+}
+
+/* ============================ Config handling ============================= */
+
+/* Generalise handling create instance error. Use SRI_MASTER, SRI_SLAVE or
+ * SRI_SENTINEL as a role value. */
+const char *sentinelCheckCreateInstanceErrors(int role) {
+    switch(errno) {
+    case EBUSY:
+        switch (role) {
+        case SRI_MASTER:
+            return "Duplicate master name.";
+        case SRI_SLAVE:
+            return "Duplicate hostname and port for replica.";
+        case SRI_SENTINEL:
+            return "Duplicate runid for sentinel.";
+        default:
+            serverAssert(0);
+            break;
+        }
+        break;
+    case ENOENT:
+        return "Can't resolve instance hostname.";
+    case EINVAL:
+        return "Invalid port number.";
+    default:
+        return "Unknown Error for creating instances.";
+    }
+}
+
+/* init function for server.sentinel_config */
+void initializeSentinelConfig() {
+    server.sentinel_config = zmalloc(sizeof(struct sentinelConfig));
+    server.sentinel_config->monitor_cfg = listCreate();
+    server.sentinel_config->pre_monitor_cfg = listCreate();
+    server.sentinel_config->post_monitor_cfg = listCreate();
+    listSetFreeMethod(server.sentinel_config->monitor_cfg,freeSentinelLoadQueueEntry);
+    listSetFreeMethod(server.sentinel_config->pre_monitor_cfg,freeSentinelLoadQueueEntry);
+    listSetFreeMethod(server.sentinel_config->post_monitor_cfg,freeSentinelLoadQueueEntry);
+}
+
+/* destroy function for server.sentinel_config */
+void freeSentinelConfig() {
+    /* release these three config queues since we will not use it anymore */
+    listRelease(server.sentinel_config->pre_monitor_cfg);
+    listRelease(server.sentinel_config->monitor_cfg);
+    listRelease(server.sentinel_config->post_monitor_cfg);
+    zfree(server.sentinel_config);
+    server.sentinel_config = NULL;
+}
+
+/* Search config name in pre monitor config name array, return 1 if found,
+ * 0 if not found. */
+int searchPreMonitorCfgName(const char *name) {
+    for (unsigned int i = 0; i < sizeof(preMonitorCfgName)/sizeof(preMonitorCfgName[0]); i++) {
+        if (!strcasecmp(preMonitorCfgName[i],name)) return 1;
+    }
+    return 0;
+}
+
+/* free method for sentinelLoadQueueEntry when release the list */
+void freeSentinelLoadQueueEntry(void *item) {
+    struct sentinelLoadQueueEntry *entry = item;
+    sdsfreesplitres(entry->argv,entry->argc);
+    sdsfree(entry->line);
+    zfree(entry);
+}
+
+/* This function is used for queuing sentinel configuration, the main
+ * purpose of this function is to delay parsing the sentinel config option
+ * in order to avoid the order dependent issue from the config. */
+void queueSentinelConfig(sds *argv, int argc, int linenum, sds line) {
+    int i;
+    struct sentinelLoadQueueEntry *entry;
+
+    /* initialize sentinel_config for the first call */
+    if (server.sentinel_config == NULL) initializeSentinelConfig();
+
+    entry = zmalloc(sizeof(struct sentinelLoadQueueEntry));
+    entry->argv = zmalloc(sizeof(char*)*argc);
+    entry->argc = argc;
+    entry->linenum = linenum;
+    entry->line = sdsdup(line);
+    for (i = 0; i < argc; i++) {
+        entry->argv[i] = sdsdup(argv[i]);
+    }
+    /*  Separate config lines with pre monitor config, monitor config and
+     *  post monitor config, in order to parsing config dependencies
+     *  correctly. */
+    if (!strcasecmp(argv[0],"monitor")) {
+        listAddNodeTail(server.sentinel_config->monitor_cfg,entry);
+    } else if (searchPreMonitorCfgName(argv[0])) {
+        listAddNodeTail(server.sentinel_config->pre_monitor_cfg,entry);
+    } else{
+        listAddNodeTail(server.sentinel_config->post_monitor_cfg,entry);
+    }
+}
+
+/* This function is used for loading the sentinel configuration from
+ * pre_monitor_cfg, monitor_cfg and post_monitor_cfg list */
+void loadSentinelConfigFromQueue(void) {
+    const char *err = NULL;
+    listIter li;
+    listNode *ln;
+    int linenum = 0;
+    sds line = NULL;
+
+    /* if there is no sentinel_config entry, we can return immediately */
+    if (server.sentinel_config == NULL) return;
+
+    /* loading from pre monitor config queue first to avoid dependency issues */
+    listRewind(server.sentinel_config->pre_monitor_cfg,&li);
+    while((ln = listNext(&li))) {
+        struct sentinelLoadQueueEntry *entry = ln->value;
+        err = sentinelHandleConfiguration(entry->argv,entry->argc);
+        if (err) {
+            linenum = entry->linenum;
+            line = entry->line;
+            goto loaderr;
+        }
+    }
+
+    /* loading from monitor config queue */
+    listRewind(server.sentinel_config->monitor_cfg,&li);
+    while((ln = listNext(&li))) {
+        struct sentinelLoadQueueEntry *entry = ln->value;
+        err = sentinelHandleConfiguration(entry->argv,entry->argc);
+        if (err) {
+            linenum = entry->linenum;
+            line = entry->line;
+            goto loaderr;
+        }
+    }
+
+    /* loading from the post monitor config queue */
+    listRewind(server.sentinel_config->post_monitor_cfg,&li);
+    while((ln = listNext(&li))) {
+        struct sentinelLoadQueueEntry *entry = ln->value;
+        err = sentinelHandleConfiguration(entry->argv,entry->argc);
+        if (err) {
+            linenum = entry->linenum;
+            line = entry->line;
+            goto loaderr;
+        }
+    }
+
+    /* free sentinel_config when config loading is finished */
+    freeSentinelConfig();
+    return;
+
+loaderr:
+    fprintf(stderr, "\n*** FATAL CONFIG FILE ERROR (Redis %s) ***\n",
+        REDIS_VERSION);
+    fprintf(stderr, "Reading the configuration file, at line %d\n", linenum);
+    fprintf(stderr, ">>> '%s'\n", line);
+    fprintf(stderr, "%s\n", err);
+    exit(1);
+}
+
+const char *sentinelHandleConfiguration(char **argv, int argc) {
+
+    sentinelRedisInstance *ri;
+
+    if (!strcasecmp(argv[0],"monitor") && argc == 5) {
+        /* monitor <name> <host> <port> <quorum> */
+        int quorum = atoi(argv[4]);
+
+        if (quorum <= 0) return "Quorum must be 1 or greater.";
+        if (createSentinelRedisInstance(argv[1],SRI_MASTER,argv[2],
+                                        atoi(argv[3]),quorum,NULL) == NULL)
+        {
+            return sentinelCheckCreateInstanceErrors(SRI_MASTER);
+        }
+    } else if (!strcasecmp(argv[0],"down-after-milliseconds") && argc == 3) {
+        /* down-after-milliseconds <name> <milliseconds> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->down_after_period = atoi(argv[2]);
+        if (ri->down_after_period <= 0)
+            return "negative or zero time parameter.";
+        sentinelPropagateDownAfterPeriod(ri);
+    } else if (!strcasecmp(argv[0],"failover-timeout") && argc == 3) {
+        /* failover-timeout <name> <milliseconds> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->failover_timeout = atoi(argv[2]);
+        if (ri->failover_timeout <= 0)
+            return "negative or zero time parameter.";
+    } else if (!strcasecmp(argv[0],"parallel-syncs") && argc == 3) {
+        /* parallel-syncs <name> <milliseconds> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->parallel_syncs = atoi(argv[2]);
+    } else if (!strcasecmp(argv[0],"notification-script") && argc == 3) {
+        /* notification-script <name> <path> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        if (access(argv[2],X_OK) == -1)
+            return "Notification script seems non existing or non executable.";
+        ri->notification_script = sdsnew(argv[2]);
+    } else if (!strcasecmp(argv[0],"client-reconfig-script") && argc == 3) {
+        /* client-reconfig-script <name> <path> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        if (access(argv[2],X_OK) == -1)
+            return "Client reconfiguration script seems non existing or "
+                   "non executable.";
+        ri->client_reconfig_script = sdsnew(argv[2]);
+    } else if (!strcasecmp(argv[0],"auth-pass") && argc == 3) {
+        /* auth-pass <name> <password> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->auth_pass = sdsnew(argv[2]);
+    } else if (!strcasecmp(argv[0],"auth-user") && argc == 3) {
+        /* auth-user <name> <username> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->auth_user = sdsnew(argv[2]);
+    } else if (!strcasecmp(argv[0],"current-epoch") && argc == 2) {
+        /* current-epoch <epoch> */
+        unsigned long long current_epoch = strtoull(argv[1],NULL,10);
+        if (current_epoch > sentinel.current_epoch)
+            sentinel.current_epoch = current_epoch;
+    } else if (!strcasecmp(argv[0],"myid") && argc == 2) {
+        if (strlen(argv[1]) != CONFIG_RUN_ID_SIZE)
+            return "Malformed Sentinel id in myid option.";
+        memcpy(sentinel.myid,argv[1],CONFIG_RUN_ID_SIZE);
+    } else if (!strcasecmp(argv[0],"config-epoch") && argc == 3) {
+        /* config-epoch <name> <epoch> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->config_epoch = strtoull(argv[2],NULL,10);
+        /* The following update of current_epoch is not really useful as
+         * now the current epoch is persisted on the config file, but
+         * we leave this check here for redundancy. */
+        if (ri->config_epoch > sentinel.current_epoch)
+            sentinel.current_epoch = ri->config_epoch;
+    } else if (!strcasecmp(argv[0],"leader-epoch") && argc == 3) {
+        /* leader-epoch <name> <epoch> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        ri->leader_epoch = strtoull(argv[2],NULL,10);
+    } else if ((!strcasecmp(argv[0],"known-slave") ||
+                !strcasecmp(argv[0],"known-replica")) && argc == 4)
+    {
+        sentinelRedisInstance *slave;
+
+        /* known-replica <name> <ip> <port> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        if ((slave = createSentinelRedisInstance(NULL,SRI_SLAVE,argv[2],
+                    atoi(argv[3]), ri->quorum, ri)) == NULL)
+        {
+            return sentinelCheckCreateInstanceErrors(SRI_SLAVE);
+        }
+    } else if (!strcasecmp(argv[0],"known-sentinel") &&
+               (argc == 4 || argc == 5)) {
+        sentinelRedisInstance *si;
+
+        if (argc == 5) { /* Ignore the old form without runid. */
+            /* known-sentinel <name> <ip> <port> [runid] */
+            ri = sentinelGetMasterByName(argv[1]);
+            if (!ri) return "No such master with specified name.";
+            if ((si = createSentinelRedisInstance(argv[4],SRI_SENTINEL,argv[2],
+                        atoi(argv[3]), ri->quorum, ri)) == NULL)
+            {
+                return sentinelCheckCreateInstanceErrors(SRI_SENTINEL);
+            }
+            si->runid = sdsnew(argv[4]);
+            sentinelTryConnectionSharing(si);
+        }
+    } else if (!strcasecmp(argv[0],"rename-command") && argc == 4) {
+        /* rename-command <name> <command> <renamed-command> */
+        ri = sentinelGetMasterByName(argv[1]);
+        if (!ri) return "No such master with specified name.";
+        sds oldcmd = sdsnew(argv[2]);
+        sds newcmd = sdsnew(argv[3]);
+        if (dictAdd(ri->renamed_commands,oldcmd,newcmd) != DICT_OK) {
+            sdsfree(oldcmd);
+            sdsfree(newcmd);
+            return "Same command renamed multiple times with rename-command.";
+        }
+    } else if (!strcasecmp(argv[0],"announce-ip") && argc == 2) {
+        /* announce-ip <ip-address> */
+        if (strlen(argv[1]))
+            sentinel.announce_ip = sdsnew(argv[1]);
+    } else if (!strcasecmp(argv[0],"announce-port") && argc == 2) {
+        /* announce-port <port> */
+        sentinel.announce_port = atoi(argv[1]);
+    } else if (!strcasecmp(argv[0],"deny-scripts-reconfig") && argc == 2) {
+        /* deny-scripts-reconfig <yes|no> */
+        if ((sentinel.deny_scripts_reconfig = yesnotoi(argv[1])) == -1) {
+            return "Please specify yes or no for the "
+                   "deny-scripts-reconfig options.";
+        }
+    } else if (!strcasecmp(argv[0],"sentinel-user") && argc == 2) {
+        /* sentinel-user <user-name> */
+        if (strlen(argv[1]))
+            sentinel.sentinel_auth_user = sdsnew(argv[1]);
+    } else if (!strcasecmp(argv[0],"sentinel-pass") && argc == 2) {
+        /* sentinel-pass <password> */
+        if (strlen(argv[1]))
+            sentinel.sentinel_auth_pass = sdsnew(argv[1]);
+    } else if (!strcasecmp(argv[0],"resolve-hostnames") && argc == 2) {
+        /* resolve-hostnames <yes|no> */
+        if ((sentinel.resolve_hostnames = yesnotoi(argv[1])) == -1) {
+            return "Please specify yes or no for the resolve-hostnames option.";
+        }
+    } else if (!strcasecmp(argv[0],"announce-hostnames") && argc == 2) {
+        /* announce-hostnames <yes|no> */
+        if ((sentinel.announce_hostnames = yesnotoi(argv[1])) == -1) {
+            return "Please specify yes or no for the announce-hostnames option.";
+        }
+    } else {
+        return "Unrecognized sentinel configuration statement.";
+    }
+    return NULL;
+}
+
+/* Implements CONFIG REWRITE for "sentinel" option.
+ * This is used not just to rewrite the configuration given by the user
+ * (the configured masters) but also in order to retain the state of
+ * Sentinel across restarts: config epoch of masters, associated slaves
+ * and sentinel instances, and so forth. */
+void rewriteConfigSentinelOption(struct rewriteConfigState *state) {
+    dictIterator *di, *di2;
+    dictEntry *de;
+    sds line;
+
+    /* sentinel unique ID. */
+    line = sdscatprintf(sdsempty(), "sentinel myid %s", sentinel.myid);
+    rewriteConfigRewriteLine(state,"sentinel myid",line,1);
+
+    /* sentinel deny-scripts-reconfig. */
+    line = sdscatprintf(sdsempty(), "sentinel deny-scripts-reconfig %s",
+        sentinel.deny_scripts_reconfig ? "yes" : "no");
+    rewriteConfigRewriteLine(state,"sentinel deny-scripts-reconfig",line,
+        sentinel.deny_scripts_reconfig != SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG);
+
+    /* sentinel resolve-hostnames.
+     * This must be included early in the file so it is already in effect
+     * when reading the file.
+     */
+    line = sdscatprintf(sdsempty(), "sentinel resolve-hostnames %s",
+                        sentinel.resolve_hostnames ? "yes" : "no");
+    rewriteConfigRewriteLine(state,"sentinel resolve-hostnames",line,
+                             sentinel.resolve_hostnames != SENTINEL_DEFAULT_RESOLVE_HOSTNAMES);
+
+    /* sentinel announce-hostnames. */
+    line = sdscatprintf(sdsempty(), "sentinel announce-hostnames %s",
+                        sentinel.announce_hostnames ? "yes" : "no");
+    rewriteConfigRewriteLine(state,"sentinel announce-hostnames",line,
+                             sentinel.announce_hostnames != SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES);
+
+    /* For every master emit a "sentinel monitor" config entry. */
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *master, *ri;
+        sentinelAddr *master_addr;
+
+        /* sentinel monitor */
+        master = dictGetVal(de);
+        master_addr = sentinelGetCurrentMasterAddress(master);
+        line = sdscatprintf(sdsempty(),"sentinel monitor %s %s %d %d",
+            master->name, announceSentinelAddr(master_addr), master_addr->port,
+            master->quorum);
+        rewriteConfigRewriteLine(state,"sentinel monitor",line,1);
+        /* rewriteConfigMarkAsProcessed is handled after the loop */
+
+        /* sentinel down-after-milliseconds */
+        if (master->down_after_period != SENTINEL_DEFAULT_DOWN_AFTER) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel down-after-milliseconds %s %ld",
+                master->name, (long) master->down_after_period);
+            rewriteConfigRewriteLine(state,"sentinel down-after-milliseconds",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        /* sentinel failover-timeout */
+        if (master->failover_timeout != SENTINEL_DEFAULT_FAILOVER_TIMEOUT) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel failover-timeout %s %ld",
+                master->name, (long) master->failover_timeout);
+            rewriteConfigRewriteLine(state,"sentinel failover-timeout",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+
+        }
+
+        /* sentinel parallel-syncs */
+        if (master->parallel_syncs != SENTINEL_DEFAULT_PARALLEL_SYNCS) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel parallel-syncs %s %d",
+                master->name, master->parallel_syncs);
+            rewriteConfigRewriteLine(state,"sentinel parallel-syncs",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        /* sentinel notification-script */
+        if (master->notification_script) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel notification-script %s %s",
+                master->name, master->notification_script);
+            rewriteConfigRewriteLine(state,"sentinel notification-script",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        /* sentinel client-reconfig-script */
+        if (master->client_reconfig_script) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel client-reconfig-script %s %s",
+                master->name, master->client_reconfig_script);
+            rewriteConfigRewriteLine(state,"sentinel client-reconfig-script",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        /* sentinel auth-pass & auth-user */
+        if (master->auth_pass) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel auth-pass %s %s",
+                master->name, master->auth_pass);
+            rewriteConfigRewriteLine(state,"sentinel auth-pass",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        if (master->auth_user) {
+            line = sdscatprintf(sdsempty(),
+                "sentinel auth-user %s %s",
+                master->name, master->auth_user);
+            rewriteConfigRewriteLine(state,"sentinel auth-user",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+
+        /* sentinel config-epoch */
+        line = sdscatprintf(sdsempty(),
+            "sentinel config-epoch %s %llu",
+            master->name, (unsigned long long) master->config_epoch);
+        rewriteConfigRewriteLine(state,"sentinel config-epoch",line,1);
+        /* rewriteConfigMarkAsProcessed is handled after the loop */
+
+
+        /* sentinel leader-epoch */
+        line = sdscatprintf(sdsempty(),
+            "sentinel leader-epoch %s %llu",
+            master->name, (unsigned long long) master->leader_epoch);
+        rewriteConfigRewriteLine(state,"sentinel leader-epoch",line,1);
+        /* rewriteConfigMarkAsProcessed is handled after the loop */
+
+        /* sentinel known-slave */
+        di2 = dictGetIterator(master->slaves);
+        while((de = dictNext(di2)) != NULL) {
+            sentinelAddr *slave_addr;
+
+            ri = dictGetVal(de);
+            slave_addr = ri->addr;
+
+            /* If master_addr (obtained using sentinelGetCurrentMasterAddress()
+             * so it may be the address of the promoted slave) is equal to this
+             * slave's address, a failover is in progress and the slave was
+             * already successfully promoted. So as the address of this slave
+             * we use the old master address instead. */
+            if (sentinelAddrIsEqual(slave_addr,master_addr))
+                slave_addr = master->addr;
+            line = sdscatprintf(sdsempty(),
+                "sentinel known-replica %s %s %d",
+                master->name, announceSentinelAddr(slave_addr), slave_addr->port);
+            rewriteConfigRewriteLine(state,"sentinel known-replica",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+        dictReleaseIterator(di2);
+
+        /* sentinel known-sentinel */
+        di2 = dictGetIterator(master->sentinels);
+        while((de = dictNext(di2)) != NULL) {
+            ri = dictGetVal(de);
+            if (ri->runid == NULL) continue;
+            line = sdscatprintf(sdsempty(),
+                "sentinel known-sentinel %s %s %d %s",
+                master->name, announceSentinelAddr(ri->addr), ri->addr->port, ri->runid);
+            rewriteConfigRewriteLine(state,"sentinel known-sentinel",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+        dictReleaseIterator(di2);
+
+        /* sentinel rename-command */
+        di2 = dictGetIterator(master->renamed_commands);
+        while((de = dictNext(di2)) != NULL) {
+            sds oldname = dictGetKey(de);
+            sds newname = dictGetVal(de);
+            line = sdscatprintf(sdsempty(),
+                "sentinel rename-command %s %s %s",
+                master->name, oldname, newname);
+            rewriteConfigRewriteLine(state,"sentinel rename-command",line,1);
+            /* rewriteConfigMarkAsProcessed is handled after the loop */
+        }
+        dictReleaseIterator(di2);
+    }
+
+    /* sentinel current-epoch is a global state valid for all the masters. */
+    line = sdscatprintf(sdsempty(),
+        "sentinel current-epoch %llu", (unsigned long long) sentinel.current_epoch);
+    rewriteConfigRewriteLine(state,"sentinel current-epoch",line,1);
+
+    /* sentinel announce-ip. */
+    if (sentinel.announce_ip) {
+        line = sdsnew("sentinel announce-ip ");
+        line = sdscatrepr(line, sentinel.announce_ip, sdslen(sentinel.announce_ip));
+        rewriteConfigRewriteLine(state,"sentinel announce-ip",line,1);
+    } else {
+        rewriteConfigMarkAsProcessed(state,"sentinel announce-ip");
+    }
+
+    /* sentinel announce-port. */
+    if (sentinel.announce_port) {
+        line = sdscatprintf(sdsempty(),"sentinel announce-port %d",
+                            sentinel.announce_port);
+        rewriteConfigRewriteLine(state,"sentinel announce-port",line,1);
+    } else {
+        rewriteConfigMarkAsProcessed(state,"sentinel announce-port");
+    }
+
+    /* sentinel sentinel-user. */
+    if (sentinel.sentinel_auth_user) {
+        line = sdscatprintf(sdsempty(), "sentinel sentinel-user %s", sentinel.sentinel_auth_user);
+        rewriteConfigRewriteLine(state,"sentinel sentinel-user",line,1);
+    } else {
+        rewriteConfigMarkAsProcessed(state,"sentinel sentinel-user");
+    }
+
+    /* sentinel sentinel-pass. */
+    if (sentinel.sentinel_auth_pass) {
+        line = sdscatprintf(sdsempty(), "sentinel sentinel-pass %s", sentinel.sentinel_auth_pass);
+        rewriteConfigRewriteLine(state,"sentinel sentinel-pass",line,1);
+    } else {
+        rewriteConfigMarkAsProcessed(state,"sentinel sentinel-pass");  
+    }
+
+    dictReleaseIterator(di);
+
+    /* NOTE: the purpose here is in case due to the state change, the config rewrite 
+     does not handle the configs, however, previously the config was set in the config file, 
+     rewriteConfigMarkAsProcessed should be put here to mark it as processed in order to 
+     delete the old config entry.
+    */
+    rewriteConfigMarkAsProcessed(state,"sentinel monitor");
+    rewriteConfigMarkAsProcessed(state,"sentinel down-after-milliseconds");
+    rewriteConfigMarkAsProcessed(state,"sentinel failover-timeout");
+    rewriteConfigMarkAsProcessed(state,"sentinel parallel-syncs");
+    rewriteConfigMarkAsProcessed(state,"sentinel notification-script");
+    rewriteConfigMarkAsProcessed(state,"sentinel client-reconfig-script");
+    rewriteConfigMarkAsProcessed(state,"sentinel auth-pass");
+    rewriteConfigMarkAsProcessed(state,"sentinel auth-user");
+    rewriteConfigMarkAsProcessed(state,"sentinel config-epoch");
+    rewriteConfigMarkAsProcessed(state,"sentinel leader-epoch");
+    rewriteConfigMarkAsProcessed(state,"sentinel known-replica");
+    rewriteConfigMarkAsProcessed(state,"sentinel known-sentinel");
+    rewriteConfigMarkAsProcessed(state,"sentinel rename-command");
+}
+
+/* This function uses the config rewriting Redis engine in order to persist
+ * the state of the Sentinel in the current configuration file.
+ *
+ * Before returning the function calls fsync() against the generated
+ * configuration file to make sure changes are committed to disk.
+ *
+ * On failure the function logs a warning on the Redis log. */
+void sentinelFlushConfig(void) {
+    int fd = -1;
+    int saved_hz = server.hz;
+    int rewrite_status;
+
+    server.hz = CONFIG_DEFAULT_HZ;
+    rewrite_status = rewriteConfig(server.configfile, 0);
+    server.hz = saved_hz;
+
+    if (rewrite_status == -1) goto werr;
+    if ((fd = open(server.configfile,O_RDONLY)) == -1) goto werr;
+    if (fsync(fd) == -1) goto werr;
+    if (close(fd) == EOF) goto werr;
+    return;
+
+werr:
+    serverLog(LL_WARNING,"WARNING: Sentinel was not able to save the new configuration on disk!!!: %s", strerror(errno));
+    if (fd != -1) close(fd);
+}
+
+/* ====================== hiredis connection handling ======================= */
+
+/* Send the AUTH command with the specified master password if needed.
+ * Note that for slaves the password set for the master is used.
+ *
+ * In case this Sentinel requires a password as well, via the "requirepass"
+ * configuration directive, we assume we should use the local password in
+ * order to authenticate when connecting with the other Sentinels as well.
+ * So basically all the Sentinels share the same password and use it to
+ * authenticate reciprocally.
+ *
+ * We don't check at all if the command was successfully transmitted
+ * to the instance as if it fails Sentinel will detect the instance down,
+ * will disconnect and reconnect the link and so forth. */
+void sentinelSendAuthIfNeeded(sentinelRedisInstance *ri, redisAsyncContext *c) {
+    char *auth_pass = NULL;
+    char *auth_user = NULL;
+
+    if (ri->flags & SRI_MASTER) {
+        auth_pass = ri->auth_pass;
+        auth_user = ri->auth_user;
+    } else if (ri->flags & SRI_SLAVE) {
+        auth_pass = ri->master->auth_pass;
+        auth_user = ri->master->auth_user;
+    } else if (ri->flags & SRI_SENTINEL) {
+        /* If sentinel_auth_user is NULL, AUTH will use default user
+           with sentinel_auth_pass to authenticate */
+        if (sentinel.sentinel_auth_pass) {
+            auth_pass = sentinel.sentinel_auth_pass;
+            auth_user = sentinel.sentinel_auth_user;
+        } else {
+            /* Compatibility with old configs. requirepass is used
+             * for both incoming and outgoing authentication. */
+            auth_pass = server.requirepass;
+            auth_user = NULL;
+        }
+    }
+
+    if (auth_pass && auth_user == NULL) {
+        if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri, "%s %s",
+            sentinelInstanceMapCommand(ri,"AUTH"),
+            auth_pass) == C_OK) ri->link->pending_commands++;
+    } else if (auth_pass && auth_user) {
+        /* If we also have an username, use the ACL-style AUTH command
+         * with two arguments, username and password. */
+        if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri, "%s %s %s",
+            sentinelInstanceMapCommand(ri,"AUTH"),
+            auth_user, auth_pass) == C_OK) ri->link->pending_commands++;
+    }
+}
+
+/* Use CLIENT SETNAME to name the connection in the Redis instance as
+ * sentinel-<first_8_chars_of_runid>-<connection_type>
+ * The connection type is "cmd" or "pubsub" as specified by 'type'.
+ *
+ * This makes it possible to list all the sentinel instances connected
+ * to a Redis server with CLIENT LIST, grepping for a specific name format. */
+void sentinelSetClientName(sentinelRedisInstance *ri, redisAsyncContext *c, char *type) {
+    char name[64];
+
+    snprintf(name,sizeof(name),"sentinel-%.8s-%s",sentinel.myid,type);
+    if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri,
+        "%s SETNAME %s",
+        sentinelInstanceMapCommand(ri,"CLIENT"),
+        name) == C_OK)
+    {
+        ri->link->pending_commands++;
+    }
+}
+
+static int instanceLinkNegotiateTLS(redisAsyncContext *context) {
+#ifndef USE_OPENSSL
+    (void) context;
+#else
+    if (!redis_tls_ctx) return C_ERR;
+    SSL *ssl = SSL_new(redis_tls_client_ctx ? redis_tls_client_ctx : redis_tls_ctx);
+    if (!ssl) return C_ERR;
+
+    if (redisInitiateSSL(&context->c, ssl) == REDIS_ERR) return C_ERR;
+#endif
+    return C_OK;
+}
+
+/* Create the async connections for the instance link if the link
+ * is disconnected. Note that link->disconnected is true even if just
+ * one of the two links (commands and pub/sub) is missing. */
+void sentinelReconnectInstance(sentinelRedisInstance *ri) {
+    if (ri->link->disconnected == 0) return;
+    if (ri->addr->port == 0) return; /* port == 0 means invalid address. */
+    instanceLink *link = ri->link;
+    mstime_t now = mstime();
+
+    if (now - ri->link->last_reconn_time < SENTINEL_PING_PERIOD) return;
+    ri->link->last_reconn_time = now;
+
+    /* Commands connection. */
+    if (link->cc == NULL) {
+        link->cc = redisAsyncConnectBind(ri->addr->ip,ri->addr->port,NET_FIRST_BIND_ADDR);
+        if (link->cc && !link->cc->err) anetCloexec(link->cc->c.fd);
+        if (!link->cc) {
+            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #Failed to establish connection");
+        } else if (!link->cc->err && server.tls_replication &&
+                (instanceLinkNegotiateTLS(link->cc) == C_ERR)) {
+            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #Failed to initialize TLS");
+            instanceLinkCloseConnection(link,link->cc);
+        } else if (link->cc->err) {
+            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #%s",
+                link->cc->errstr);
+            instanceLinkCloseConnection(link,link->cc);
+        } else {
+            link->pending_commands = 0;
+            link->cc_conn_time = mstime();
+            link->cc->data = link;
+            redisAeAttach(server.el,link->cc);
+            redisAsyncSetConnectCallback(link->cc,
+                    sentinelLinkEstablishedCallback);
+            redisAsyncSetDisconnectCallback(link->cc,
+                    sentinelDisconnectCallback);
+            sentinelSendAuthIfNeeded(ri,link->cc);
+            sentinelSetClientName(ri,link->cc,"cmd");
+
+            /* Send a PING ASAP when reconnecting. */
+            sentinelSendPing(ri);
+        }
+    }
+    /* Pub / Sub */
+    if ((ri->flags & (SRI_MASTER|SRI_SLAVE)) && link->pc == NULL) {
+        link->pc = redisAsyncConnectBind(ri->addr->ip,ri->addr->port,NET_FIRST_BIND_ADDR);
+        if (link->pc && !link->pc->err) anetCloexec(link->pc->c.fd);
+        if (!link->pc) {
+            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #Failed to establish connection");
+        } else if (!link->pc->err && server.tls_replication &&
+                (instanceLinkNegotiateTLS(link->pc) == C_ERR)) {
+            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #Failed to initialize TLS");
+        } else if (link->pc->err) {
+            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #%s",
+                link->pc->errstr);
+            instanceLinkCloseConnection(link,link->pc);
+        } else {
+            int retval;
+            link->pc_conn_time = mstime();
+            link->pc->data = link;
+            redisAeAttach(server.el,link->pc);
+            redisAsyncSetConnectCallback(link->pc,
+                    sentinelLinkEstablishedCallback);
+            redisAsyncSetDisconnectCallback(link->pc,
+                    sentinelDisconnectCallback);
+            sentinelSendAuthIfNeeded(ri,link->pc);
+            sentinelSetClientName(ri,link->pc,"pubsub");
+            /* Now we subscribe to the Sentinels "Hello" channel. */
+            retval = redisAsyncCommand(link->pc,
+                sentinelReceiveHelloMessages, ri, "%s %s",
+                sentinelInstanceMapCommand(ri,"SUBSCRIBE"),
+                SENTINEL_HELLO_CHANNEL);
+            if (retval != C_OK) {
+                /* If we can't subscribe, the Pub/Sub connection is useless
+                 * and we can simply disconnect it and try again. */
+                instanceLinkCloseConnection(link,link->pc);
+                return;
+            }
+        }
+    }
+    /* Clear the disconnected status only if we have both the connections
+     * (or just the commands connection if this is a sentinel instance). */
+    if (link->cc && (ri->flags & SRI_SENTINEL || link->pc))
+        link->disconnected = 0;
+}
+
+/* ======================== Redis instances pinging  ======================== */
+
+/* Return true if master looks "sane", that is:
+ * 1) It is actually a master in the current configuration.
+ * 2) It reports itself as a master.
+ * 3) It is not SDOWN or ODOWN.
+ * 4) We obtained last INFO no more than two times the INFO period time ago. */
+int sentinelMasterLooksSane(sentinelRedisInstance *master) {
+    return
+        master->flags & SRI_MASTER &&
+        master->role_reported == SRI_MASTER &&
+        (master->flags & (SRI_S_DOWN|SRI_O_DOWN)) == 0 &&
+        (mstime() - master->info_refresh) < SENTINEL_INFO_PERIOD*2;
+}
+
+/* Process the INFO output from masters. */
+void sentinelRefreshInstanceInfo(sentinelRedisInstance *ri, const char *info) {
+    sds *lines;
+    int numlines, j;
+    int role = 0;
+
+    /* cache full INFO output for instance */
+    sdsfree(ri->info);
+    ri->info = sdsnew(info);
+
+    /* The following fields must be reset to a given value in the case they
+     * are not found at all in the INFO output. */
+    ri->master_link_down_time = 0;
+
+    /* Process line by line. */
+    lines = sdssplitlen(info,strlen(info),"\r\n",2,&numlines);
+    for (j = 0; j < numlines; j++) {
+        sentinelRedisInstance *slave;
+        sds l = lines[j];
+
+        /* run_id:<40 hex chars>*/
+        if (sdslen(l) >= 47 && !memcmp(l,"run_id:",7)) {
+            if (ri->runid == NULL) {
+                ri->runid = sdsnewlen(l+7,40);
+            } else {
+                if (strncmp(ri->runid,l+7,40) != 0) {
+                    sentinelEvent(LL_NOTICE,"+reboot",ri,"%@");
+                    sdsfree(ri->runid);
+                    ri->runid = sdsnewlen(l+7,40);
+                }
+            }
+        }
+
+        /* old versions: slave0:<ip>,<port>,<state>
+         * new versions: slave0:ip=127.0.0.1,port=9999,... */
+        if ((ri->flags & SRI_MASTER) &&
+            sdslen(l) >= 7 &&
+            !memcmp(l,"slave",5) && isdigit(l[5]))
+        {
+            char *ip, *port, *end;
+
+            if (strstr(l,"ip=") == NULL) {
+                /* Old format. */
+                ip = strchr(l,':'); if (!ip) continue;
+                ip++; /* Now ip points to start of ip address. */
+                port = strchr(ip,','); if (!port) continue;
+                *port = '\0'; /* nul term for easy access. */
+                port++; /* Now port points to start of port number. */
+                end = strchr(port,','); if (!end) continue;
+                *end = '\0'; /* nul term for easy access. */
+            } else {
+                /* New format. */
+                ip = strstr(l,"ip="); if (!ip) continue;
+                ip += 3; /* Now ip points to start of ip address. */
+                port = strstr(l,"port="); if (!port) continue;
+                port += 5; /* Now port points to start of port number. */
+                /* Nul term both fields for easy access. */
+                end = strchr(ip,','); if (end) *end = '\0';
+                end = strchr(port,','); if (end) *end = '\0';
+            }
+
+            /* Check if we already have this slave into our table,
+             * otherwise add it. */
+            if (sentinelRedisInstanceLookupSlave(ri,ip,atoi(port)) == NULL) {
+                if ((slave = createSentinelRedisInstance(NULL,SRI_SLAVE,ip,
+                            atoi(port), ri->quorum, ri)) != NULL)
+                {
+                    sentinelEvent(LL_NOTICE,"+slave",slave,"%@");
+                    sentinelFlushConfig();
+                }
+            }
+        }
+
+        /* master_link_down_since_seconds:<seconds> */
+        if (sdslen(l) >= 32 &&
+            !memcmp(l,"master_link_down_since_seconds",30))
+        {
+            ri->master_link_down_time = strtoll(l+31,NULL,10)*1000;
+        }
+
+        /* role:<role> */
+        if (sdslen(l) >= 11 && !memcmp(l,"role:master",11)) role = SRI_MASTER;
+        else if (sdslen(l) >= 10 && !memcmp(l,"role:slave",10)) role = SRI_SLAVE;
+
+        if (role == SRI_SLAVE) {
+            /* master_host:<host> */
+            if (sdslen(l) >= 12 && !memcmp(l,"master_host:",12)) {
+                if (ri->slave_master_host == NULL ||
+                    strcasecmp(l+12,ri->slave_master_host))
+                {
+                    sdsfree(ri->slave_master_host);
+                    ri->slave_master_host = sdsnew(l+12);
+                    ri->slave_conf_change_time = mstime();
+                }
+            }
+
+            /* master_port:<port> */
+            if (sdslen(l) >= 12 && !memcmp(l,"master_port:",12)) {
+                int slave_master_port = atoi(l+12);
+
+                if (ri->slave_master_port != slave_master_port) {
+                    ri->slave_master_port = slave_master_port;
+                    ri->slave_conf_change_time = mstime();
+                }
+            }
+
+            /* master_link_status:<status> */
+            if (sdslen(l) >= 19 && !memcmp(l,"master_link_status:",19)) {
+                ri->slave_master_link_status =
+                    (strcasecmp(l+19,"up") == 0) ?
+                    SENTINEL_MASTER_LINK_STATUS_UP :
+                    SENTINEL_MASTER_LINK_STATUS_DOWN;
+            }
+
+            /* slave_priority:<priority> */
+            if (sdslen(l) >= 15 && !memcmp(l,"slave_priority:",15))
+                ri->slave_priority = atoi(l+15);
+
+            /* slave_repl_offset:<offset> */
+            if (sdslen(l) >= 18 && !memcmp(l,"slave_repl_offset:",18))
+                ri->slave_repl_offset = strtoull(l+18,NULL,10);
+
+            /* replica_announced:<announcement> */
+            if (sdslen(l) >= 18 && !memcmp(l,"replica_announced:",18))
+                ri->replica_announced = atoi(l+18);
+        }
+    }
+    ri->info_refresh = mstime();
+    sdsfreesplitres(lines,numlines);
+
+    /* ---------------------------- Acting half -----------------------------
+     * Some things will not happen if sentinel.tilt is true, but some will
+     * still be processed. */
+
+    /* Remember when the role changed. */
+    if (role != ri->role_reported) {
+        ri->role_reported_time = mstime();
+        ri->role_reported = role;
+        if (role == SRI_SLAVE) ri->slave_conf_change_time = mstime();
+        /* Log the event with +role-change if the new role is coherent or
+         * with -role-change if there is a mismatch with the current config. */
+        sentinelEvent(LL_VERBOSE,
+            ((ri->flags & (SRI_MASTER|SRI_SLAVE)) == role) ?
+            "+role-change" : "-role-change",
+            ri, "%@ new reported role is %s",
+            role == SRI_MASTER ? "master" : "slave");
+    }
+
+    /* None of the following conditions are processed when in tilt mode, so
+     * return asap. */
+    if (sentinel.tilt) return;
+
+    /* Handle master -> slave role switch. */
+    if ((ri->flags & SRI_MASTER) && role == SRI_SLAVE) {
+        /* Nothing to do, but masters claiming to be slaves are
+         * considered to be unreachable by Sentinel, so eventually
+         * a failover will be triggered. */
+    }
+
+    /* Handle slave -> master role switch. */
+    if ((ri->flags & SRI_SLAVE) && role == SRI_MASTER) {
+        /* If this is a promoted slave we can change state to the
+         * failover state machine. */
+        if ((ri->flags & SRI_PROMOTED) &&
+            (ri->master->flags & SRI_FAILOVER_IN_PROGRESS) &&
+            (ri->master->failover_state ==
+                SENTINEL_FAILOVER_STATE_WAIT_PROMOTION))
+        {
+            /* Now that we are sure the slave was reconfigured as a master
+             * set the master configuration epoch to the epoch we won the
+             * election to perform this failover. This will force the other
+             * Sentinels to update their config (assuming there is not
+             * a newer one already available). */
+            ri->master->config_epoch = ri->master->failover_epoch;
+            ri->master->failover_state = SENTINEL_FAILOVER_STATE_RECONF_SLAVES;
+            ri->master->failover_state_change_time = mstime();
+            sentinelFlushConfig();
+            sentinelEvent(LL_WARNING,"+promoted-slave",ri,"%@");
+            if (sentinel.simfailure_flags &
+                SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION)
+                sentinelSimFailureCrash();
+            sentinelEvent(LL_WARNING,"+failover-state-reconf-slaves",
+                ri->master,"%@");
+            sentinelCallClientReconfScript(ri->master,SENTINEL_LEADER,
+                "start",ri->master->addr,ri->addr);
+            sentinelForceHelloUpdateForMaster(ri->master);
+        } else {
+            /* A slave turned into a master. We want to force our view and
+             * reconfigure as slave. Wait some time after the change before
+             * going forward, to receive new configs if any. */
+            mstime_t wait_time = SENTINEL_PUBLISH_PERIOD*4;
+
+            if (!(ri->flags & SRI_PROMOTED) &&
+                 sentinelMasterLooksSane(ri->master) &&
+                 sentinelRedisInstanceNoDownFor(ri,wait_time) &&
+                 mstime() - ri->role_reported_time > wait_time)
+            {
+                int retval = sentinelSendSlaveOf(ri,ri->master->addr);
+                if (retval == C_OK)
+                    sentinelEvent(LL_NOTICE,"+convert-to-slave",ri,"%@");
+            }
+        }
+    }
+
+    /* Handle slaves replicating to a different master address. */
+    if ((ri->flags & SRI_SLAVE) &&
+        role == SRI_SLAVE &&
+        (ri->slave_master_port != ri->master->addr->port ||
+         !sentinelAddrEqualsHostname(ri->master->addr, ri->slave_master_host)))
+    {
+        mstime_t wait_time = ri->master->failover_timeout;
+
+        /* Make sure the master is sane before reconfiguring this instance
+         * into a slave. */
+        if (sentinelMasterLooksSane(ri->master) &&
+            sentinelRedisInstanceNoDownFor(ri,wait_time) &&
+            mstime() - ri->slave_conf_change_time > wait_time)
+        {
+            int retval = sentinelSendSlaveOf(ri,ri->master->addr);
+            if (retval == C_OK)
+                sentinelEvent(LL_NOTICE,"+fix-slave-config",ri,"%@");
+        }
+    }
+
+    /* Detect if the slave that is in the process of being reconfigured
+     * changed state. */
+    if ((ri->flags & SRI_SLAVE) && role == SRI_SLAVE &&
+        (ri->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG)))
+    {
+        /* SRI_RECONF_SENT -> SRI_RECONF_INPROG. */
+        if ((ri->flags & SRI_RECONF_SENT) &&
+            ri->slave_master_host &&
+            sentinelAddrEqualsHostname(ri->master->promoted_slave->addr,
+                ri->slave_master_host) &&
+            ri->slave_master_port == ri->master->promoted_slave->addr->port)
+        {
+            ri->flags &= ~SRI_RECONF_SENT;
+            ri->flags |= SRI_RECONF_INPROG;
+            sentinelEvent(LL_NOTICE,"+slave-reconf-inprog",ri,"%@");
+        }
+
+        /* SRI_RECONF_INPROG -> SRI_RECONF_DONE */
+        if ((ri->flags & SRI_RECONF_INPROG) &&
+            ri->slave_master_link_status == SENTINEL_MASTER_LINK_STATUS_UP)
+        {
+            ri->flags &= ~SRI_RECONF_INPROG;
+            ri->flags |= SRI_RECONF_DONE;
+            sentinelEvent(LL_NOTICE,"+slave-reconf-done",ri,"%@");
+        }
+    }
+}
+
+void sentinelInfoReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
+    sentinelRedisInstance *ri = privdata;
+    instanceLink *link = c->data;
+    redisReply *r;
+
+    if (!reply || !link) return;
+    link->pending_commands--;
+    r = reply;
+
+    if (r->type == REDIS_REPLY_STRING)
+        sentinelRefreshInstanceInfo(ri,r->str);
+}
+
+/* Just discard the reply. We use this when we are not monitoring the return
+ * value of the command but its effects directly. */
+void sentinelDiscardReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
+    instanceLink *link = c->data;
+    UNUSED(reply);
+    UNUSED(privdata);
+
+    if (link) link->pending_commands--;
+}
+
+void sentinelPingReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
+    sentinelRedisInstance *ri = privdata;
+    instanceLink *link = c->data;
+    redisReply *r;
+
+    if (!reply || !link) return;
+    link->pending_commands--;
+    r = reply;
+
+    if (r->type == REDIS_REPLY_STATUS ||
+        r->type == REDIS_REPLY_ERROR) {
+        /* Update the "instance available" field only if this is an
+         * acceptable reply. */
+        if (strncmp(r->str,"PONG",4) == 0 ||
+            strncmp(r->str,"LOADING",7) == 0 ||
+            strncmp(r->str,"MASTERDOWN",10) == 0)
+        {
+            link->last_avail_time = mstime();
+            link->act_ping_time = 0; /* Flag the pong as received. */
+        } else {
+            /* Send a SCRIPT KILL command if the instance appears to be
+             * down because of a busy script. */
+            if (strncmp(r->str,"BUSY",4) == 0 &&
+                (ri->flags & SRI_S_DOWN) &&
+                !(ri->flags & SRI_SCRIPT_KILL_SENT))
+            {
+                if (redisAsyncCommand(ri->link->cc,
+                        sentinelDiscardReplyCallback, ri,
+                        "%s KILL",
+                        sentinelInstanceMapCommand(ri,"SCRIPT")) == C_OK)
+                {
+                    ri->link->pending_commands++;
+                }
+                ri->flags |= SRI_SCRIPT_KILL_SENT;
+            }
+        }
+    }
+    link->last_pong_time = mstime();
+}
+
+/* This is called when we get the reply about the PUBLISH command we send
+ * to the master to advertise this sentinel. */
+void sentinelPublishReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
+    sentinelRedisInstance *ri = privdata;
+    instanceLink *link = c->data;
+    redisReply *r;
+
+    if (!reply || !link) return;
+    link->pending_commands--;
+    r = reply;
+
+    /* Only update pub_time if we actually published our message. Otherwise
+     * we'll retry again in 100 milliseconds. */
+    if (r->type != REDIS_REPLY_ERROR)
+        ri->last_pub_time = mstime();
+}
+
+/* Process a hello message received via Pub/Sub in master or slave instance,
+ * or sent directly to this sentinel via the (fake) PUBLISH command of Sentinel.
+ *
+ * If the master name specified in the message is not known, the message is
+ * discarded. */
+void sentinelProcessHelloMessage(char *hello, int hello_len) {
+    /* Format is composed of 8 tokens:
+     * 0=ip,1=port,2=runid,3=current_epoch,4=master_name,
+     * 5=master_ip,6=master_port,7=master_config_epoch. */
+    int numtokens, port, removed, master_port;
+    uint64_t current_epoch, master_config_epoch;
+    char **token = sdssplitlen(hello, hello_len, ",", 1, &numtokens);
+    sentinelRedisInstance *si, *master;
+
+    if (numtokens == 8) {
+        /* Obtain a reference to the master this hello message is about */
+        master = sentinelGetMasterByName(token[4]);
+        if (!master) goto cleanup; /* Unknown master, skip the message. */
+
+        /* First, try to see if we already have this sentinel. */
+        port = atoi(token[1]);
+        master_port = atoi(token[6]);
+        si = getSentinelRedisInstanceByAddrAndRunID(
+                        master->sentinels,token[0],port,token[2]);
+        current_epoch = strtoull(token[3],NULL,10);
+        master_config_epoch = strtoull(token[7],NULL,10);
+
+        if (!si) {
+            /* If not, remove all the sentinels that have the same runid
+             * because there was an address change, and add the same Sentinel
+             * with the new address back. */
+            removed = removeMatchingSentinelFromMaster(master,token[2]);
+            if (removed) {
+                sentinelEvent(LL_NOTICE,"+sentinel-address-switch",master,
+                    "%@ ip %s port %d for %s", token[0],port,token[2]);
+            } else {
+                /* Check if there is another Sentinel with the same address this
+                 * new one is reporting. What we do if this happens is to set its
+                 * port to 0, to signal the address is invalid. We'll update it
+                 * later if we get an HELLO message. */
+                sentinelRedisInstance *other =
+                    getSentinelRedisInstanceByAddrAndRunID(
+                        master->sentinels, token[0],port,NULL);
+                if (other) {
+                    sentinelEvent(LL_NOTICE,"+sentinel-invalid-addr",other,"%@");
+                    other->addr->port = 0; /* It means: invalid address. */
+                    sentinelUpdateSentinelAddressInAllMasters(other);
+                }
+            }
+
+            /* Add the new sentinel. */
+            si = createSentinelRedisInstance(token[2],SRI_SENTINEL,
+                            token[0],port,master->quorum,master);
+
+            if (si) {
+                if (!removed) sentinelEvent(LL_NOTICE,"+sentinel",si,"%@");
+                /* The runid is NULL after a new instance creation and
+                 * for Sentinels we don't have a later chance to fill it,
+                 * so do it now. */
+                si->runid = sdsnew(token[2]);
+                sentinelTryConnectionSharing(si);
+                if (removed) sentinelUpdateSentinelAddressInAllMasters(si);
+                sentinelFlushConfig();
+            }
+        }
+
+        /* Update local current_epoch if received current_epoch is greater.*/
+        if (current_epoch > sentinel.current_epoch) {
+            sentinel.current_epoch = current_epoch;
+            sentinelFlushConfig();
+            sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
+                (unsigned long long) sentinel.current_epoch);
+        }
+
+        /* Update master info if received configuration is newer. */
+        if (si && master->config_epoch < master_config_epoch) {
+            master->config_epoch = master_config_epoch;
+            if (master_port != master->addr->port ||
+                !sentinelAddrEqualsHostname(master->addr, token[5]))
+            {
+                sentinelAddr *old_addr;
+
+                sentinelEvent(LL_WARNING,"+config-update-from",si,"%@");
+                sentinelEvent(LL_WARNING,"+switch-master",
+                    master,"%s %s %d %s %d",
+                    master->name,
+                    announceSentinelAddr(master->addr), master->addr->port,
+                    token[5], master_port);
+
+                old_addr = dupSentinelAddr(master->addr);
+                sentinelResetMasterAndChangeAddress(master, token[5], master_port);
+                sentinelCallClientReconfScript(master,
+                    SENTINEL_OBSERVER,"start",
+                    old_addr,master->addr);
+                releaseSentinelAddr(old_addr);
+            }
+        }
+
+        /* Update the state of the Sentinel. */
+        if (si) si->last_hello_time = mstime();
+    }
+
+cleanup:
+    sdsfreesplitres(token,numtokens);
+}
+
+
+/* This is our Pub/Sub callback for the Hello channel. It's useful in order
+ * to discover other sentinels attached at the same master. */
+void sentinelReceiveHelloMessages(redisAsyncContext *c, void *reply, void *privdata) {
+    sentinelRedisInstance *ri = privdata;
+    redisReply *r;
+    UNUSED(c);
+
+    if (!reply || !ri) return;
+    r = reply;
+
+    /* Update the last activity in the pubsub channel. Note that since we
+     * receive our messages as well this timestamp can be used to detect
+     * if the link is probably disconnected even if it seems otherwise. */
+    ri->link->pc_last_activity = mstime();
+
+    /* Sanity check in the reply we expect, so that the code that follows
+     * can avoid to check for details. */
+    if (r->type != REDIS_REPLY_ARRAY ||
+        r->elements != 3 ||
+        r->element[0]->type != REDIS_REPLY_STRING ||
+        r->element[1]->type != REDIS_REPLY_STRING ||
+        r->element[2]->type != REDIS_REPLY_STRING ||
+        strcmp(r->element[0]->str,"message") != 0) return;
+
+    /* We are not interested in meeting ourselves */
+    if (strstr(r->element[2]->str,sentinel.myid) != NULL) return;
+
+    sentinelProcessHelloMessage(r->element[2]->str, r->element[2]->len);
+}
+
+/* Send a "Hello" message via Pub/Sub to the specified 'ri' Redis
+ * instance in order to broadcast the current configuration for this
+ * master, and to advertise the existence of this Sentinel at the same time.
+ *
+ * The message has the following format:
+ *
+ * sentinel_ip,sentinel_port,sentinel_runid,current_epoch,
+ * master_name,master_ip,master_port,master_config_epoch.
+ *
+ * Returns C_OK if the PUBLISH was queued correctly, otherwise
+ * C_ERR is returned. */
+int sentinelSendHello(sentinelRedisInstance *ri) {
+    char ip[NET_IP_STR_LEN];
+    char payload[NET_IP_STR_LEN+1024];
+    int retval;
+    char *announce_ip;
+    int announce_port;
+    sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ? ri : ri->master;
+    sentinelAddr *master_addr = sentinelGetCurrentMasterAddress(master);
+
+    if (ri->link->disconnected) return C_ERR;
+
+    /* Use the specified announce address if specified, otherwise try to
+     * obtain our own IP address. */
+    if (sentinel.announce_ip) {
+        announce_ip = sentinel.announce_ip;
+    } else {
+        if (anetFdToString(ri->link->cc->c.fd,ip,sizeof(ip),NULL,FD_TO_SOCK_NAME) == -1)
+            return C_ERR;
+        announce_ip = ip;
+    }
+    if (sentinel.announce_port) announce_port = sentinel.announce_port;
+    else if (server.tls_replication && server.tls_port) announce_port = server.tls_port;
+    else announce_port = server.port;
+
+    /* Format and send the Hello message. */
+    snprintf(payload,sizeof(payload),
+        "%s,%d,%s,%llu," /* Info about this sentinel. */
+        "%s,%s,%d,%llu", /* Info about current master. */
+        announce_ip, announce_port, sentinel.myid,
+        (unsigned long long) sentinel.current_epoch,
+        /* --- */
+        master->name,announceSentinelAddr(master_addr),master_addr->port,
+        (unsigned long long) master->config_epoch);
+    retval = redisAsyncCommand(ri->link->cc,
+        sentinelPublishReplyCallback, ri, "%s %s %s",
+        sentinelInstanceMapCommand(ri,"PUBLISH"),
+        SENTINEL_HELLO_CHANNEL,payload);
+    if (retval != C_OK) return C_ERR;
+    ri->link->pending_commands++;
+    return C_OK;
+}
+
+/* Reset last_pub_time in all the instances in the specified dictionary
+ * in order to force the delivery of a Hello update ASAP. */
+void sentinelForceHelloUpdateDictOfRedisInstances(dict *instances) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetSafeIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        if (ri->last_pub_time >= (SENTINEL_PUBLISH_PERIOD+1))
+            ri->last_pub_time -= (SENTINEL_PUBLISH_PERIOD+1);
+    }
+    dictReleaseIterator(di);
+}
+
+/* This function forces the delivery of a "Hello" message (see
+ * sentinelSendHello() top comment for further information) to all the Redis
+ * and Sentinel instances related to the specified 'master'.
+ *
+ * It is technically not needed since we send an update to every instance
+ * with a period of SENTINEL_PUBLISH_PERIOD milliseconds, however when a
+ * Sentinel upgrades a configuration it is a good idea to deliver an update
+ * to the other Sentinels ASAP. */
+int sentinelForceHelloUpdateForMaster(sentinelRedisInstance *master) {
+    if (!(master->flags & SRI_MASTER)) return C_ERR;
+    if (master->last_pub_time >= (SENTINEL_PUBLISH_PERIOD+1))
+        master->last_pub_time -= (SENTINEL_PUBLISH_PERIOD+1);
+    sentinelForceHelloUpdateDictOfRedisInstances(master->sentinels);
+    sentinelForceHelloUpdateDictOfRedisInstances(master->slaves);
+    return C_OK;
+}
+
+/* Send a PING to the specified instance and refresh the act_ping_time
+ * if it is zero (that is, if we received a pong for the previous ping).
+ *
+ * On error zero is returned, and we can't consider the PING command
+ * queued in the connection. */
+int sentinelSendPing(sentinelRedisInstance *ri) {
+    int retval = redisAsyncCommand(ri->link->cc,
+        sentinelPingReplyCallback, ri, "%s",
+        sentinelInstanceMapCommand(ri,"PING"));
+    if (retval == C_OK) {
+        ri->link->pending_commands++;
+        ri->link->last_ping_time = mstime();
+        /* We update the active ping time only if we received the pong for
+         * the previous ping, otherwise we are technically waiting since the
+         * first ping that did not receive a reply. */
+        if (ri->link->act_ping_time == 0)
+            ri->link->act_ping_time = ri->link->last_ping_time;
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Send periodic PING, INFO, and PUBLISH to the Hello channel to
+ * the specified master or slave instance. */
+void sentinelSendPeriodicCommands(sentinelRedisInstance *ri) {
+    mstime_t now = mstime();
+    mstime_t info_period, ping_period;
+    int retval;
+
+    /* Return ASAP if we have already a PING or INFO already pending, or
+     * in the case the instance is not properly connected. */
+    if (ri->link->disconnected) return;
+
+    /* For INFO, PING, PUBLISH that are not critical commands to send we
+     * also have a limit of SENTINEL_MAX_PENDING_COMMANDS. We don't
+     * want to use a lot of memory just because a link is not working
+     * properly (note that anyway there is a redundant protection about this,
+     * that is, the link will be disconnected and reconnected if a long
+     * timeout condition is detected. */
+    if (ri->link->pending_commands >=
+        SENTINEL_MAX_PENDING_COMMANDS * ri->link->refcount) return;
+
+    /* If this is a slave of a master in O_DOWN condition we start sending
+     * it INFO every second, instead of the usual SENTINEL_INFO_PERIOD
+     * period. In this state we want to closely monitor slaves in case they
+     * are turned into masters by another Sentinel, or by the sysadmin.
+     *
+     * Similarly we monitor the INFO output more often if the slave reports
+     * to be disconnected from the master, so that we can have a fresh
+     * disconnection time figure. */
+    if ((ri->flags & SRI_SLAVE) &&
+        ((ri->master->flags & (SRI_O_DOWN|SRI_FAILOVER_IN_PROGRESS)) ||
+         (ri->master_link_down_time != 0)))
+    {
+        info_period = 1000;
+    } else {
+        info_period = SENTINEL_INFO_PERIOD;
+    }
+
+    /* We ping instances every time the last received pong is older than
+     * the configured 'down-after-milliseconds' time, but every second
+     * anyway if 'down-after-milliseconds' is greater than 1 second. */
+    ping_period = ri->down_after_period;
+    if (ping_period > SENTINEL_PING_PERIOD) ping_period = SENTINEL_PING_PERIOD;
+
+    /* Send INFO to masters and slaves, not sentinels. */
+    if ((ri->flags & SRI_SENTINEL) == 0 &&
+        (ri->info_refresh == 0 ||
+        (now - ri->info_refresh) > info_period))
+    {
+        retval = redisAsyncCommand(ri->link->cc,
+            sentinelInfoReplyCallback, ri, "%s",
+            sentinelInstanceMapCommand(ri,"INFO"));
+        if (retval == C_OK) ri->link->pending_commands++;
+    }
+
+    /* Send PING to all the three kinds of instances. */
+    if ((now - ri->link->last_pong_time) > ping_period &&
+               (now - ri->link->last_ping_time) > ping_period/2) {
+        sentinelSendPing(ri);
+    }
+
+    /* PUBLISH hello messages to all the three kinds of instances. */
+    if ((now - ri->last_pub_time) > SENTINEL_PUBLISH_PERIOD) {
+        sentinelSendHello(ri);
+    }
+}
+
+/* =========================== SENTINEL command ============================= */
+
+/* SENTINEL CONFIG SET <option> */
+void sentinelConfigSetCommand(client *c) {
+    robj *o = c->argv[3];
+    robj *val = c->argv[4];
+    long long numval;
+    int drop_conns = 0;
+
+    if (!strcasecmp(o->ptr, "resolve-hostnames")) {
+        if ((numval = yesnotoi(val->ptr)) == -1) goto badfmt;
+        sentinel.resolve_hostnames = numval;
+    } else if (!strcasecmp(o->ptr, "announce-hostnames")) {
+        if ((numval = yesnotoi(val->ptr)) == -1) goto badfmt;
+        sentinel.announce_hostnames = numval;
+    } else if (!strcasecmp(o->ptr, "announce-ip")) {
+        if (sentinel.announce_ip) sdsfree(sentinel.announce_ip);
+        sentinel.announce_ip = sdsnew(val->ptr);
+    } else if (!strcasecmp(o->ptr, "announce-port")) {
+        if (getLongLongFromObject(val, &numval) == C_ERR ||
+            numval < 0 || numval > 65535)
+            goto badfmt;
+        sentinel.announce_port = numval;
+    } else if (!strcasecmp(o->ptr, "sentinel-user")) {
+        sdsfree(sentinel.sentinel_auth_user);
+        sentinel.sentinel_auth_user = sdslen(val->ptr) == 0 ?
+            NULL : sdsdup(val->ptr);
+        drop_conns = 1;
+    } else if (!strcasecmp(o->ptr, "sentinel-pass")) {
+        sdsfree(sentinel.sentinel_auth_pass);
+        sentinel.sentinel_auth_pass = sdslen(val->ptr) == 0 ?
+            NULL : sdsdup(val->ptr);
+        drop_conns = 1;
+    } else {
+        addReplyErrorFormat(c, "Invalid argument '%s' to SENTINEL CONFIG SET",
+                            (char *) o->ptr);
+        return;
+    }
+
+    sentinelFlushConfig();
+    addReply(c, shared.ok);
+
+    /* Drop Sentinel connections to initiate a reconnect if needed. */
+    if (drop_conns)
+        sentinelDropConnections();
+
+    return;
+
+badfmt:
+    addReplyErrorFormat(c, "Invalid value '%s' to SENTINEL CONFIG SET '%s'",
+                        (char *) val->ptr, (char *) o->ptr);
+}
+
+/* SENTINEL CONFIG GET <option> */
+void sentinelConfigGetCommand(client *c) {
+    robj *o = c->argv[3];
+    const char *pattern = o->ptr;
+    void *replylen = addReplyDeferredLen(c);
+    int matches = 0;
+
+    if (stringmatch(pattern,"resolve-hostnames",1)) {
+        addReplyBulkCString(c,"resolve-hostnames");
+        addReplyBulkCString(c,sentinel.resolve_hostnames ? "yes" : "no");
+        matches++;
+    }
+
+    if (stringmatch(pattern, "announce-hostnames", 1)) {
+        addReplyBulkCString(c,"announce-hostnames");
+        addReplyBulkCString(c,sentinel.announce_hostnames ? "yes" : "no");
+        matches++;
+    }
+
+    if (stringmatch(pattern, "announce-ip", 1)) {
+        addReplyBulkCString(c,"announce-ip");
+        addReplyBulkCString(c,sentinel.announce_ip ? sentinel.announce_ip : "");
+        matches++;
+    }
+
+    if (stringmatch(pattern, "announce-port", 1)) {
+        addReplyBulkCString(c, "announce-port");
+        addReplyBulkLongLong(c, sentinel.announce_port);
+        matches++;
+    }
+
+    if (stringmatch(pattern, "sentinel-user", 1)) {
+        addReplyBulkCString(c, "sentinel-user");
+        addReplyBulkCString(c, sentinel.sentinel_auth_user ? sentinel.sentinel_auth_user : "");
+        matches++;
+    }
+
+    if (stringmatch(pattern, "sentinel-pass", 1)) {
+        addReplyBulkCString(c, "sentinel-pass");
+        addReplyBulkCString(c, sentinel.sentinel_auth_pass ? sentinel.sentinel_auth_pass : "");
+        matches++;
+    }
+
+    setDeferredMapLen(c, replylen, matches);
+}
+
+const char *sentinelFailoverStateStr(int state) {
+    switch(state) {
+    case SENTINEL_FAILOVER_STATE_NONE: return "none";
+    case SENTINEL_FAILOVER_STATE_WAIT_START: return "wait_start";
+    case SENTINEL_FAILOVER_STATE_SELECT_SLAVE: return "select_slave";
+    case SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE: return "send_slaveof_noone";
+    case SENTINEL_FAILOVER_STATE_WAIT_PROMOTION: return "wait_promotion";
+    case SENTINEL_FAILOVER_STATE_RECONF_SLAVES: return "reconf_slaves";
+    case SENTINEL_FAILOVER_STATE_UPDATE_CONFIG: return "update_config";
+    default: return "unknown";
+    }
+}
+
+/* Redis instance to Redis protocol representation. */
+void addReplySentinelRedisInstance(client *c, sentinelRedisInstance *ri) {
+    char *flags = sdsempty();
+    void *mbl;
+    int fields = 0;
+
+    mbl = addReplyDeferredLen(c);
+
+    addReplyBulkCString(c,"name");
+    addReplyBulkCString(c,ri->name);
+    fields++;
+
+    addReplyBulkCString(c,"ip");
+    addReplyBulkCString(c,announceSentinelAddr(ri->addr));
+    fields++;
+
+    addReplyBulkCString(c,"port");
+    addReplyBulkLongLong(c,ri->addr->port);
+    fields++;
+
+    addReplyBulkCString(c,"runid");
+    addReplyBulkCString(c,ri->runid ? ri->runid : "");
+    fields++;
+
+    addReplyBulkCString(c,"flags");
+    if (ri->flags & SRI_S_DOWN) flags = sdscat(flags,"s_down,");
+    if (ri->flags & SRI_O_DOWN) flags = sdscat(flags,"o_down,");
+    if (ri->flags & SRI_MASTER) flags = sdscat(flags,"master,");
+    if (ri->flags & SRI_SLAVE) flags = sdscat(flags,"slave,");
+    if (ri->flags & SRI_SENTINEL) flags = sdscat(flags,"sentinel,");
+    if (ri->link->disconnected) flags = sdscat(flags,"disconnected,");
+    if (ri->flags & SRI_MASTER_DOWN) flags = sdscat(flags,"master_down,");
+    if (ri->flags & SRI_FAILOVER_IN_PROGRESS)
+        flags = sdscat(flags,"failover_in_progress,");
+    if (ri->flags & SRI_PROMOTED) flags = sdscat(flags,"promoted,");
+    if (ri->flags & SRI_RECONF_SENT) flags = sdscat(flags,"reconf_sent,");
+    if (ri->flags & SRI_RECONF_INPROG) flags = sdscat(flags,"reconf_inprog,");
+    if (ri->flags & SRI_RECONF_DONE) flags = sdscat(flags,"reconf_done,");
+    if (ri->flags & SRI_FORCE_FAILOVER) flags = sdscat(flags,"force_failover,");
+    if (ri->flags & SRI_SCRIPT_KILL_SENT) flags = sdscat(flags,"script_kill_sent,");
+
+    if (sdslen(flags) != 0) sdsrange(flags,0,-2); /* remove last "," */
+    addReplyBulkCString(c,flags);
+    sdsfree(flags);
+    fields++;
+
+    addReplyBulkCString(c,"link-pending-commands");
+    addReplyBulkLongLong(c,ri->link->pending_commands);
+    fields++;
+
+    addReplyBulkCString(c,"link-refcount");
+    addReplyBulkLongLong(c,ri->link->refcount);
+    fields++;
+
+    if (ri->flags & SRI_FAILOVER_IN_PROGRESS) {
+        addReplyBulkCString(c,"failover-state");
+        addReplyBulkCString(c,(char*)sentinelFailoverStateStr(ri->failover_state));
+        fields++;
+    }
+
+    addReplyBulkCString(c,"last-ping-sent");
+    addReplyBulkLongLong(c,
+        ri->link->act_ping_time ? (mstime() - ri->link->act_ping_time) : 0);
+    fields++;
+
+    addReplyBulkCString(c,"last-ok-ping-reply");
+    addReplyBulkLongLong(c,mstime() - ri->link->last_avail_time);
+    fields++;
+
+    addReplyBulkCString(c,"last-ping-reply");
+    addReplyBulkLongLong(c,mstime() - ri->link->last_pong_time);
+    fields++;
+
+    if (ri->flags & SRI_S_DOWN) {
+        addReplyBulkCString(c,"s-down-time");
+        addReplyBulkLongLong(c,mstime()-ri->s_down_since_time);
+        fields++;
+    }
+
+    if (ri->flags & SRI_O_DOWN) {
+        addReplyBulkCString(c,"o-down-time");
+        addReplyBulkLongLong(c,mstime()-ri->o_down_since_time);
+        fields++;
+    }
+
+    addReplyBulkCString(c,"down-after-milliseconds");
+    addReplyBulkLongLong(c,ri->down_after_period);
+    fields++;
+
+    /* Masters and Slaves */
+    if (ri->flags & (SRI_MASTER|SRI_SLAVE)) {
+        addReplyBulkCString(c,"info-refresh");
+        addReplyBulkLongLong(c,
+            ri->info_refresh ? (mstime() - ri->info_refresh) : 0);
+        fields++;
+
+        addReplyBulkCString(c,"role-reported");
+        addReplyBulkCString(c, (ri->role_reported == SRI_MASTER) ? "master" :
+                                                                   "slave");
+        fields++;
+
+        addReplyBulkCString(c,"role-reported-time");
+        addReplyBulkLongLong(c,mstime() - ri->role_reported_time);
+        fields++;
+    }
+
+    /* Only masters */
+    if (ri->flags & SRI_MASTER) {
+        addReplyBulkCString(c,"config-epoch");
+        addReplyBulkLongLong(c,ri->config_epoch);
+        fields++;
+
+        addReplyBulkCString(c,"num-slaves");
+        addReplyBulkLongLong(c,dictSize(ri->slaves));
+        fields++;
+
+        addReplyBulkCString(c,"num-other-sentinels");
+        addReplyBulkLongLong(c,dictSize(ri->sentinels));
+        fields++;
+
+        addReplyBulkCString(c,"quorum");
+        addReplyBulkLongLong(c,ri->quorum);
+        fields++;
+
+        addReplyBulkCString(c,"failover-timeout");
+        addReplyBulkLongLong(c,ri->failover_timeout);
+        fields++;
+
+        addReplyBulkCString(c,"parallel-syncs");
+        addReplyBulkLongLong(c,ri->parallel_syncs);
+        fields++;
+
+        if (ri->notification_script) {
+            addReplyBulkCString(c,"notification-script");
+            addReplyBulkCString(c,ri->notification_script);
+            fields++;
+        }
+
+        if (ri->client_reconfig_script) {
+            addReplyBulkCString(c,"client-reconfig-script");
+            addReplyBulkCString(c,ri->client_reconfig_script);
+            fields++;
+        }
+    }
+
+    /* Only slaves */
+    if (ri->flags & SRI_SLAVE) {
+        addReplyBulkCString(c,"master-link-down-time");
+        addReplyBulkLongLong(c,ri->master_link_down_time);
+        fields++;
+
+        addReplyBulkCString(c,"master-link-status");
+        addReplyBulkCString(c,
+            (ri->slave_master_link_status == SENTINEL_MASTER_LINK_STATUS_UP) ?
+            "ok" : "err");
+        fields++;
+
+        addReplyBulkCString(c,"master-host");
+        addReplyBulkCString(c,
+            ri->slave_master_host ? ri->slave_master_host : "?");
+        fields++;
+
+        addReplyBulkCString(c,"master-port");
+        addReplyBulkLongLong(c,ri->slave_master_port);
+        fields++;
+
+        addReplyBulkCString(c,"slave-priority");
+        addReplyBulkLongLong(c,ri->slave_priority);
+        fields++;
+
+        addReplyBulkCString(c,"slave-repl-offset");
+        addReplyBulkLongLong(c,ri->slave_repl_offset);
+        fields++;
+
+        addReplyBulkCString(c,"replica-announced");
+        addReplyBulkLongLong(c,ri->replica_announced);
+        fields++;
+    }
+
+    /* Only sentinels */
+    if (ri->flags & SRI_SENTINEL) {
+        addReplyBulkCString(c,"last-hello-message");
+        addReplyBulkLongLong(c,mstime() - ri->last_hello_time);
+        fields++;
+
+        addReplyBulkCString(c,"voted-leader");
+        addReplyBulkCString(c,ri->leader ? ri->leader : "?");
+        fields++;
+
+        addReplyBulkCString(c,"voted-leader-epoch");
+        addReplyBulkLongLong(c,ri->leader_epoch);
+        fields++;
+    }
+
+    setDeferredMapLen(c,mbl,fields);
+}
+
+/* Output a number of instances contained inside a dictionary as
+ * Redis protocol. */
+void addReplyDictOfRedisInstances(client *c, dict *instances) {
+    dictIterator *di;
+    dictEntry *de;
+    long slaves = 0;
+    void *replylen = addReplyDeferredLen(c);
+
+    di = dictGetIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        /* don't announce unannounced replicas */
+        if (ri->flags & SRI_SLAVE && !ri->replica_announced) continue;
+        addReplySentinelRedisInstance(c,ri);
+        slaves++;
+    }
+    dictReleaseIterator(di);
+    setDeferredArrayLen(c, replylen, slaves);
+}
+
+/* Lookup the named master into sentinel.masters.
+ * If the master is not found reply to the client with an error and returns
+ * NULL. */
+sentinelRedisInstance *sentinelGetMasterByNameOrReplyError(client *c,
+                        robj *name)
+{
+    sentinelRedisInstance *ri;
+
+    ri = dictFetchValue(sentinel.masters,name->ptr);
+    if (!ri) {
+        addReplyError(c,"No such master with that name");
+        return NULL;
+    }
+    return ri;
+}
+
+#define SENTINEL_ISQR_OK 0
+#define SENTINEL_ISQR_NOQUORUM (1<<0)
+#define SENTINEL_ISQR_NOAUTH (1<<1)
+int sentinelIsQuorumReachable(sentinelRedisInstance *master, int *usableptr) {
+    dictIterator *di;
+    dictEntry *de;
+    int usable = 1; /* Number of usable Sentinels. Init to 1 to count myself. */
+    int result = SENTINEL_ISQR_OK;
+    int voters = dictSize(master->sentinels)+1; /* Known Sentinels + myself. */
+
+    di = dictGetIterator(master->sentinels);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        if (ri->flags & (SRI_S_DOWN|SRI_O_DOWN)) continue;
+        usable++;
+    }
+    dictReleaseIterator(di);
+
+    if (usable < (int)master->quorum) result |= SENTINEL_ISQR_NOQUORUM;
+    if (usable < voters/2+1) result |= SENTINEL_ISQR_NOAUTH;
+    if (usableptr) *usableptr = usable;
+    return result;
+}
+
+void sentinelCommand(client *c) {
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"CKQUORUM <master-name>",
+"    Check if the current Sentinel configuration is able to reach the quorum",
+"    needed to failover a master and the majority needed to authorize the",
+"    failover.",
+"CONFIG SET <param> <value>",
+"    Set a global Sentinel configuration parameter.",
+"CONFIG GET <param>",
+"    Get global Sentinel configuration parameter.",
+"GET-MASTER-ADDR-BY-NAME <master-name>",
+"    Return the ip and port number of the master with that name.",
+"FAILOVER <master-name>",
+"    Manually failover a master node without asking for agreement from other",
+"    Sentinels",
+"FLUSHCONFIG",
+"    Force Sentinel to rewrite its configuration on disk, including the current",
+"    Sentinel state.",
+"INFO-CACHE <master-name>",
+"    Return last cached INFO output from masters and all its replicas.",
+"IS-MASTER-DOWN-BY-ADDR <ip> <port> <current-epoch> <runid>",
+"    Check if the master specified by ip:port is down from current Sentinel's",
+"    point of view.",
+"MASTER <master-name>",
+"    Show the state and info of the specified master.",
+"MASTERS",
+"    Show a list of monitored masters and their state.",
+"MONITOR <name> <ip> <port> <quorum>",
+"    Start monitoring a new master with the specified name, ip, port and quorum.",
+"MYID",
+"    Return the ID of the Sentinel instance.",
+"PENDING-SCRIPTS",
+"    Get pending scripts information.",
+"REMOVE <master-name>",
+"    Remove master from Sentinel's monitor list.",
+"REPLICAS <master-name>",
+"    Show a list of replicas for this master and their state.",
+"RESET <pattern>",
+"    Reset masters for specific master name matching this pattern.",
+"SENTINELS <master-name>",
+"    Show a list of Sentinel instances for this master and their state.",
+"SET <master-name> <option> <value>",
+"    Set configuration paramters for certain masters.",
+"SIMULATE-FAILURE (CRASH-AFTER-ELECTION|CRASH-AFTER-PROMOTION|HELP)",
+"    Simulate a Sentinel crash.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(c->argv[1]->ptr,"masters")) {
+        /* SENTINEL MASTERS */
+        if (c->argc != 2) goto numargserr;
+        addReplyDictOfRedisInstances(c,sentinel.masters);
+    } else if (!strcasecmp(c->argv[1]->ptr,"master")) {
+        /* SENTINEL MASTER <name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
+            == NULL) return;
+        addReplySentinelRedisInstance(c,ri);
+    } else if (!strcasecmp(c->argv[1]->ptr,"slaves") ||
+               !strcasecmp(c->argv[1]->ptr,"replicas"))
+    {
+        /* SENTINEL REPLICAS <master-name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
+            return;
+        addReplyDictOfRedisInstances(c,ri->slaves);
+    } else if (!strcasecmp(c->argv[1]->ptr,"sentinels")) {
+        /* SENTINEL SENTINELS <master-name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
+            return;
+        addReplyDictOfRedisInstances(c,ri->sentinels);
+    } else if (!strcasecmp(c->argv[1]->ptr,"myid") && c->argc == 2) {
+        /* SENTINEL MYID */
+        addReplyBulkCBuffer(c,sentinel.myid,CONFIG_RUN_ID_SIZE);
+    } else if (!strcasecmp(c->argv[1]->ptr,"is-master-down-by-addr")) {
+        /* SENTINEL IS-MASTER-DOWN-BY-ADDR <ip> <port> <current-epoch> <runid>
+         *
+         * Arguments:
+         *
+         * ip and port are the ip and port of the master we want to be
+         * checked by Sentinel. Note that the command will not check by
+         * name but just by master, in theory different Sentinels may monitor
+         * different masters with the same name.
+         *
+         * current-epoch is needed in order to understand if we are allowed
+         * to vote for a failover leader or not. Each Sentinel can vote just
+         * one time per epoch.
+         *
+         * runid is "*" if we are not seeking for a vote from the Sentinel
+         * in order to elect the failover leader. Otherwise it is set to the
+         * runid we want the Sentinel to vote if it did not already voted.
+         */
+        sentinelRedisInstance *ri;
+        long long req_epoch;
+        uint64_t leader_epoch = 0;
+        char *leader = NULL;
+        long port;
+        int isdown = 0;
+
+        if (c->argc != 6) goto numargserr;
+        if (getLongFromObjectOrReply(c,c->argv[3],&port,NULL) != C_OK ||
+            getLongLongFromObjectOrReply(c,c->argv[4],&req_epoch,NULL)
+                                                              != C_OK)
+            return;
+        ri = getSentinelRedisInstanceByAddrAndRunID(sentinel.masters,
+            c->argv[2]->ptr,port,NULL);
+
+        /* It exists? Is actually a master? Is subjectively down? It's down.
+         * Note: if we are in tilt mode we always reply with "0". */
+        if (!sentinel.tilt && ri && (ri->flags & SRI_S_DOWN) &&
+                                    (ri->flags & SRI_MASTER))
+            isdown = 1;
+
+        /* Vote for the master (or fetch the previous vote) if the request
+         * includes a runid, otherwise the sender is not seeking for a vote. */
+        if (ri && ri->flags & SRI_MASTER && strcasecmp(c->argv[5]->ptr,"*")) {
+            leader = sentinelVoteLeader(ri,(uint64_t)req_epoch,
+                                            c->argv[5]->ptr,
+                                            &leader_epoch);
+        }
+
+        /* Reply with a three-elements multi-bulk reply:
+         * down state, leader, vote epoch. */
+        addReplyArrayLen(c,3);
+        addReply(c, isdown ? shared.cone : shared.czero);
+        addReplyBulkCString(c, leader ? leader : "*");
+        addReplyLongLong(c, (long long)leader_epoch);
+        if (leader) sdsfree(leader);
+    } else if (!strcasecmp(c->argv[1]->ptr,"reset")) {
+        /* SENTINEL RESET <pattern> */
+        if (c->argc != 3) goto numargserr;
+        addReplyLongLong(c,sentinelResetMastersByPattern(c->argv[2]->ptr,SENTINEL_GENERATE_EVENT));
+    } else if (!strcasecmp(c->argv[1]->ptr,"get-master-addr-by-name")) {
+        /* SENTINEL GET-MASTER-ADDR-BY-NAME <master-name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        ri = sentinelGetMasterByName(c->argv[2]->ptr);
+        if (ri == NULL) {
+            addReplyNullArray(c);
+        } else {
+            sentinelAddr *addr = sentinelGetCurrentMasterAddress(ri);
+
+            addReplyArrayLen(c,2);
+            addReplyBulkCString(c,announceSentinelAddr(addr));
+            addReplyBulkLongLong(c,addr->port);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"failover")) {
+        /* SENTINEL FAILOVER <master-name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
+            return;
+        if (ri->flags & SRI_FAILOVER_IN_PROGRESS) {
+            addReplySds(c,sdsnew("-INPROG Failover already in progress\r\n"));
+            return;
+        }
+        if (sentinelSelectSlave(ri) == NULL) {
+            addReplySds(c,sdsnew("-NOGOODSLAVE No suitable replica to promote\r\n"));
+            return;
+        }
+        serverLog(LL_WARNING,"Executing user requested FAILOVER of '%s'",
+            ri->name);
+        sentinelStartFailover(ri);
+        ri->flags |= SRI_FORCE_FAILOVER;
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"pending-scripts")) {
+        /* SENTINEL PENDING-SCRIPTS */
+
+        if (c->argc != 2) goto numargserr;
+        sentinelPendingScriptsCommand(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"monitor")) {
+        /* SENTINEL MONITOR <name> <ip> <port> <quorum> */
+        sentinelRedisInstance *ri;
+        long quorum, port;
+        char ip[NET_IP_STR_LEN];
+
+        if (c->argc != 6) goto numargserr;
+        if (getLongFromObjectOrReply(c,c->argv[5],&quorum,"Invalid quorum")
+            != C_OK) return;
+        if (getLongFromObjectOrReply(c,c->argv[4],&port,"Invalid port")
+            != C_OK) return;
+
+        if (quorum <= 0) {
+            addReplyError(c, "Quorum must be 1 or greater.");
+            return;
+        }
+
+        /* If resolve-hostnames is used, actual DNS resolution may take place.
+         * Otherwise just validate address.
+         */
+        if (anetResolve(NULL,c->argv[3]->ptr,ip,sizeof(ip),
+                        sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR) {
+            addReplyError(c, "Invalid IP address or hostname specified");
+            return;
+        }
+
+        /* Parameters are valid. Try to create the master instance. */
+        ri = createSentinelRedisInstance(c->argv[2]->ptr,SRI_MASTER,
+                c->argv[3]->ptr,port,quorum,NULL);
+        if (ri == NULL) {
+            addReplyError(c,sentinelCheckCreateInstanceErrors(SRI_MASTER));
+        } else {
+            sentinelFlushConfig();
+            sentinelEvent(LL_WARNING,"+monitor",ri,"%@ quorum %d",ri->quorum);
+            addReply(c,shared.ok);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"flushconfig")) {
+        if (c->argc != 2) goto numargserr;
+        sentinelFlushConfig();
+        addReply(c,shared.ok);
+        return;
+    } else if (!strcasecmp(c->argv[1]->ptr,"remove")) {
+        /* SENTINEL REMOVE <name> */
+        sentinelRedisInstance *ri;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
+            == NULL) return;
+        sentinelEvent(LL_WARNING,"-monitor",ri,"%@");
+        dictDelete(sentinel.masters,c->argv[2]->ptr);
+        sentinelFlushConfig();
+        addReply(c,shared.ok);
+    } else if (!strcasecmp(c->argv[1]->ptr,"ckquorum")) {
+        /* SENTINEL CKQUORUM <name> */
+        sentinelRedisInstance *ri;
+        int usable;
+
+        if (c->argc != 3) goto numargserr;
+        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
+            == NULL) return;
+        int result = sentinelIsQuorumReachable(ri,&usable);
+        if (result == SENTINEL_ISQR_OK) {
+            addReplySds(c, sdscatfmt(sdsempty(),
+                "+OK %i usable Sentinels. Quorum and failover authorization "
+                "can be reached\r\n",usable));
+        } else {
+            sds e = sdscatfmt(sdsempty(),
+                "-NOQUORUM %i usable Sentinels. ",usable);
+            if (result & SENTINEL_ISQR_NOQUORUM)
+                e = sdscat(e,"Not enough available Sentinels to reach the"
+                             " specified quorum for this master");
+            if (result & SENTINEL_ISQR_NOAUTH) {
+                if (result & SENTINEL_ISQR_NOQUORUM) e = sdscat(e,". ");
+                e = sdscat(e, "Not enough available Sentinels to reach the"
+                              " majority and authorize a failover");
+            }
+            e = sdscat(e,"\r\n");
+            addReplySds(c,e);
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr,"set")) {
+        if (c->argc < 3) goto numargserr;
+        sentinelSetCommand(c);
+    } else if (!strcasecmp(c->argv[1]->ptr,"config")) {
+        if (c->argc < 3) goto numargserr;
+        if (!strcasecmp(c->argv[2]->ptr,"set") && c->argc == 5)
+            sentinelConfigSetCommand(c);
+        else if (!strcasecmp(c->argv[2]->ptr,"get") && c->argc == 4)
+            sentinelConfigGetCommand(c);
+        else
+            addReplyError(c, "Only SENTINEL CONFIG GET <option> / SET <option> <value> are supported.");
+    } else if (!strcasecmp(c->argv[1]->ptr,"info-cache")) {
+        /* SENTINEL INFO-CACHE <name> */
+        if (c->argc < 2) goto numargserr;
+        mstime_t now = mstime();
+
+        /* Create an ad-hoc dictionary type so that we can iterate
+         * a dictionary composed of just the master groups the user
+         * requested. */
+        dictType copy_keeper = instancesDictType;
+        copy_keeper.valDestructor = NULL;
+        dict *masters_local = sentinel.masters;
+        if (c->argc > 2) {
+            masters_local = dictCreate(&copy_keeper, NULL);
+
+            for (int i = 2; i < c->argc; i++) {
+                sentinelRedisInstance *ri;
+                ri = sentinelGetMasterByName(c->argv[i]->ptr);
+                if (!ri) continue; /* ignore non-existing names */
+                dictAdd(masters_local, ri->name, ri);
+            }
+        }
+
+        /* Reply format:
+         *   1.) master name
+         *   2.) 1.) info from master
+         *       2.) info from replica
+         *       ...
+         *   3.) other master name
+         *   ...
+         */
+        addReplyArrayLen(c,dictSize(masters_local) * 2);
+
+        dictIterator  *di;
+        dictEntry *de;
+        di = dictGetIterator(masters_local);
+        while ((de = dictNext(di)) != NULL) {
+            sentinelRedisInstance *ri = dictGetVal(de);
+            addReplyBulkCBuffer(c,ri->name,strlen(ri->name));
+            addReplyArrayLen(c,dictSize(ri->slaves) + 1); /* +1 for self */
+            addReplyArrayLen(c,2);
+            addReplyLongLong(c,
+                ri->info_refresh ? (now - ri->info_refresh) : 0);
+            if (ri->info)
+                addReplyBulkCBuffer(c,ri->info,sdslen(ri->info));
+            else
+                addReplyNull(c);
+
+            dictIterator *sdi;
+            dictEntry *sde;
+            sdi = dictGetIterator(ri->slaves);
+            while ((sde = dictNext(sdi)) != NULL) {
+                sentinelRedisInstance *sri = dictGetVal(sde);
+                addReplyArrayLen(c,2);
+                addReplyLongLong(c,
+                    ri->info_refresh ? (now - sri->info_refresh) : 0);
+                if (sri->info)
+                    addReplyBulkCBuffer(c,sri->info,sdslen(sri->info));
+                else
+                    addReplyNull(c);
+            }
+            dictReleaseIterator(sdi);
+        }
+        dictReleaseIterator(di);
+        if (masters_local != sentinel.masters) dictRelease(masters_local);
+    } else if (!strcasecmp(c->argv[1]->ptr,"simulate-failure")) {
+        /* SENTINEL SIMULATE-FAILURE <flag> <flag> ... <flag> */
+        int j;
+
+        sentinel.simfailure_flags = SENTINEL_SIMFAILURE_NONE;
+        for (j = 2; j < c->argc; j++) {
+            if (!strcasecmp(c->argv[j]->ptr,"crash-after-election")) {
+                sentinel.simfailure_flags |=
+                    SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION;
+                serverLog(LL_WARNING,"Failure simulation: this Sentinel "
+                    "will crash after being successfully elected as failover "
+                    "leader");
+            } else if (!strcasecmp(c->argv[j]->ptr,"crash-after-promotion")) {
+                sentinel.simfailure_flags |=
+                    SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION;
+                serverLog(LL_WARNING,"Failure simulation: this Sentinel "
+                    "will crash after promoting the selected replica to master");
+            } else if (!strcasecmp(c->argv[j]->ptr,"help")) {
+                addReplyArrayLen(c,2);
+                addReplyBulkCString(c,"crash-after-election");
+                addReplyBulkCString(c,"crash-after-promotion");
+            } else {
+                addReplyError(c,"Unknown failure simulation specified");
+                return;
+            }
+        }
+        addReply(c,shared.ok);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+    return;
+
+numargserr:
+    addReplyErrorFormat(c,"Wrong number of arguments for 'sentinel %s'",
+                          (char*)c->argv[1]->ptr);
+}
+
+#define info_section_from_redis(section_name) do { \
+    if (defsections || allsections || !strcasecmp(section,section_name)) { \
+        sds redissection; \
+        if (sections++) info = sdscat(info,"\r\n"); \
+        redissection = genRedisInfoString(section_name); \
+        info = sdscatlen(info,redissection,sdslen(redissection)); \
+        sdsfree(redissection); \
+    } \
+} while(0)
+
+/* SENTINEL INFO [section] */
+void sentinelInfoCommand(client *c) {
+    if (c->argc > 2) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    int defsections = 0, allsections = 0;
+    char *section = c->argc == 2 ? c->argv[1]->ptr : NULL;
+    if (section) {
+        allsections = !strcasecmp(section,"all");
+        defsections = !strcasecmp(section,"default");
+    } else {
+        defsections = 1;
+    }
+
+    int sections = 0;
+    sds info = sdsempty();
+
+    info_section_from_redis("server");
+    info_section_from_redis("clients");
+    info_section_from_redis("cpu");
+    info_section_from_redis("stats");
+
+    if (defsections || allsections || !strcasecmp(section,"sentinel")) {
+        dictIterator *di;
+        dictEntry *de;
+        int master_id = 0;
+
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+            "# Sentinel\r\n"
+            "sentinel_masters:%lu\r\n"
+            "sentinel_tilt:%d\r\n"
+            "sentinel_running_scripts:%d\r\n"
+            "sentinel_scripts_queue_length:%ld\r\n"
+            "sentinel_simulate_failure_flags:%lu\r\n",
+            dictSize(sentinel.masters),
+            sentinel.tilt,
+            sentinel.running_scripts,
+            listLength(sentinel.scripts_queue),
+            sentinel.simfailure_flags);
+
+        di = dictGetIterator(sentinel.masters);
+        while((de = dictNext(di)) != NULL) {
+            sentinelRedisInstance *ri = dictGetVal(de);
+            char *status = "ok";
+
+            if (ri->flags & SRI_O_DOWN) status = "odown";
+            else if (ri->flags & SRI_S_DOWN) status = "sdown";
+            info = sdscatprintf(info,
+                "master%d:name=%s,status=%s,address=%s:%d,"
+                "slaves=%lu,sentinels=%lu\r\n",
+                master_id++, ri->name, status,
+                announceSentinelAddr(ri->addr), ri->addr->port,
+                dictSize(ri->slaves),
+                dictSize(ri->sentinels)+1);
+        }
+        dictReleaseIterator(di);
+    }
+
+    addReplyBulkSds(c, info);
+}
+
+/* Implements Sentinel version of the ROLE command. The output is
+ * "sentinel" and the list of currently monitored master names. */
+void sentinelRoleCommand(client *c) {
+    dictIterator *di;
+    dictEntry *de;
+
+    addReplyArrayLen(c,2);
+    addReplyBulkCBuffer(c,"sentinel",8);
+    addReplyArrayLen(c,dictSize(sentinel.masters));
+
+    di = dictGetIterator(sentinel.masters);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        addReplyBulkCString(c,ri->name);
+    }
+    dictReleaseIterator(di);
+}
+
+/* SENTINEL SET <mastername> [<option> <value> ...] */
+void sentinelSetCommand(client *c) {
+    sentinelRedisInstance *ri;
+    int j, changes = 0;
+    int badarg = 0; /* Bad argument position for error reporting. */
+    char *option;
+
+    if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
+        == NULL) return;
+
+    /* Process option - value pairs. */
+    for (j = 3; j < c->argc; j++) {
+        int moreargs = (c->argc-1) - j;
+        option = c->argv[j]->ptr;
+        long long ll;
+        int old_j = j; /* Used to know what to log as an event. */
+
+        if (!strcasecmp(option,"down-after-milliseconds") && moreargs > 0) {
+            /* down-after-millisecodns <milliseconds> */
+            robj *o = c->argv[++j];
+            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
+                badarg = j;
+                goto badfmt;
+            }
+            ri->down_after_period = ll;
+            sentinelPropagateDownAfterPeriod(ri);
+            changes++;
+        } else if (!strcasecmp(option,"failover-timeout") && moreargs > 0) {
+            /* failover-timeout <milliseconds> */
+            robj *o = c->argv[++j];
+            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
+                badarg = j;
+                goto badfmt;
+            }
+            ri->failover_timeout = ll;
+            changes++;
+        } else if (!strcasecmp(option,"parallel-syncs") && moreargs > 0) {
+            /* parallel-syncs <milliseconds> */
+            robj *o = c->argv[++j];
+            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
+                badarg = j;
+                goto badfmt;
+            }
+            ri->parallel_syncs = ll;
+            changes++;
+        } else if (!strcasecmp(option,"notification-script") && moreargs > 0) {
+            /* notification-script <path> */
+            char *value = c->argv[++j]->ptr;
+            if (sentinel.deny_scripts_reconfig) {
+                addReplyError(c,
+                    "Reconfiguration of scripts path is denied for "
+                    "security reasons. Check the deny-scripts-reconfig "
+                    "configuration directive in your Sentinel configuration");
+                goto seterr;
+            }
+
+            if (strlen(value) && access(value,X_OK) == -1) {
+                addReplyError(c,
+                    "Notification script seems non existing or non executable");
+                goto seterr;
+            }
+            sdsfree(ri->notification_script);
+            ri->notification_script = strlen(value) ? sdsnew(value) : NULL;
+            changes++;
+        } else if (!strcasecmp(option,"client-reconfig-script") && moreargs > 0) {
+            /* client-reconfig-script <path> */
+            char *value = c->argv[++j]->ptr;
+            if (sentinel.deny_scripts_reconfig) {
+                addReplyError(c,
+                    "Reconfiguration of scripts path is denied for "
+                    "security reasons. Check the deny-scripts-reconfig "
+                    "configuration directive in your Sentinel configuration");
+                goto seterr;
+            }
+
+            if (strlen(value) && access(value,X_OK) == -1) {
+                addReplyError(c,
+                    "Client reconfiguration script seems non existing or "
+                    "non executable");
+                goto seterr;
+            }
+            sdsfree(ri->client_reconfig_script);
+            ri->client_reconfig_script = strlen(value) ? sdsnew(value) : NULL;
+            changes++;
+        } else if (!strcasecmp(option,"auth-pass") && moreargs > 0) {
+            /* auth-pass <password> */
+            char *value = c->argv[++j]->ptr;
+            sdsfree(ri->auth_pass);
+            ri->auth_pass = strlen(value) ? sdsnew(value) : NULL;
+            changes++;
+        } else if (!strcasecmp(option,"auth-user") && moreargs > 0) {
+            /* auth-user <username> */
+            char *value = c->argv[++j]->ptr;
+            sdsfree(ri->auth_user);
+            ri->auth_user = strlen(value) ? sdsnew(value) : NULL;
+            changes++;
+        } else if (!strcasecmp(option,"quorum") && moreargs > 0) {
+            /* quorum <count> */
+            robj *o = c->argv[++j];
+            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
+                badarg = j;
+                goto badfmt;
+            }
+            ri->quorum = ll;
+            changes++;
+        } else if (!strcasecmp(option,"rename-command") && moreargs > 1) {
+            /* rename-command <oldname> <newname> */
+            sds oldname = c->argv[++j]->ptr;
+            sds newname = c->argv[++j]->ptr;
+
+            if ((sdslen(oldname) == 0) || (sdslen(newname) == 0)) {
+                badarg = sdslen(newname) ? j-1 : j;
+                goto badfmt;
+            }
+
+            /* Remove any older renaming for this command. */
+            dictDelete(ri->renamed_commands,oldname);
+
+            /* If the target name is the same as the source name there
+             * is no need to add an entry mapping to itself. */
+            if (!dictSdsKeyCaseCompare(NULL,oldname,newname)) {
+                oldname = sdsdup(oldname);
+                newname = sdsdup(newname);
+                dictAdd(ri->renamed_commands,oldname,newname);
+            }
+            changes++;
+        } else {
+            addReplyErrorFormat(c,"Unknown option or number of arguments for "
+                                  "SENTINEL SET '%s'", option);
+            goto seterr;
+        }
+
+        /* Log the event. */
+        int numargs = j-old_j+1;
+        switch(numargs) {
+        case 2:
+            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s %s",(char*)c->argv[old_j]->ptr,
+                                                          (char*)c->argv[old_j+1]->ptr);
+            break;
+        case 3:
+            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s %s %s",(char*)c->argv[old_j]->ptr,
+                                                             (char*)c->argv[old_j+1]->ptr,
+                                                             (char*)c->argv[old_j+2]->ptr);
+            break;
+        default:
+            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s",(char*)c->argv[old_j]->ptr);
+            break;
+        }
+    }
+
+    if (changes) sentinelFlushConfig();
+    addReply(c,shared.ok);
+    return;
+
+badfmt: /* Bad format errors */
+    addReplyErrorFormat(c,"Invalid argument '%s' for SENTINEL SET '%s'",
+        (char*)c->argv[badarg]->ptr,option);
+seterr:
+    if (changes) sentinelFlushConfig();
+    return;
+}
+
+/* Our fake PUBLISH command: it is actually useful only to receive hello messages
+ * from the other sentinel instances, and publishing to a channel other than
+ * SENTINEL_HELLO_CHANNEL is forbidden.
+ *
+ * Because we have a Sentinel PUBLISH, the code to send hello messages is the same
+ * for all the three kind of instances: masters, slaves, sentinels. */
+void sentinelPublishCommand(client *c) {
+    if (strcmp(c->argv[1]->ptr,SENTINEL_HELLO_CHANNEL)) {
+        addReplyError(c, "Only HELLO messages are accepted by Sentinel instances.");
+        return;
+    }
+    sentinelProcessHelloMessage(c->argv[2]->ptr,sdslen(c->argv[2]->ptr));
+    addReplyLongLong(c,1);
+}
+
+/* ===================== SENTINEL availability checks ======================= */
+
+/* Is this instance down from our point of view? */
+void sentinelCheckSubjectivelyDown(sentinelRedisInstance *ri) {
+    mstime_t elapsed = 0;
+
+    if (ri->link->act_ping_time)
+        elapsed = mstime() - ri->link->act_ping_time;
+    else if (ri->link->disconnected)
+        elapsed = mstime() - ri->link->last_avail_time;
+
+    /* Check if we are in need for a reconnection of one of the
+     * links, because we are detecting low activity.
+     *
+     * 1) Check if the command link seems connected, was connected not less
+     *    than SENTINEL_MIN_LINK_RECONNECT_PERIOD, but still we have a
+     *    pending ping for more than half the timeout. */
+    if (ri->link->cc &&
+        (mstime() - ri->link->cc_conn_time) >
+        SENTINEL_MIN_LINK_RECONNECT_PERIOD &&
+        ri->link->act_ping_time != 0 && /* There is a pending ping... */
+        /* The pending ping is delayed, and we did not receive
+         * error replies as well. */
+        (mstime() - ri->link->act_ping_time) > (ri->down_after_period/2) &&
+        (mstime() - ri->link->last_pong_time) > (ri->down_after_period/2))
+    {
+        instanceLinkCloseConnection(ri->link,ri->link->cc);
+    }
+
+    /* 2) Check if the pubsub link seems connected, was connected not less
+     *    than SENTINEL_MIN_LINK_RECONNECT_PERIOD, but still we have no
+     *    activity in the Pub/Sub channel for more than
+     *    SENTINEL_PUBLISH_PERIOD * 3.
+     */
+    if (ri->link->pc &&
+        (mstime() - ri->link->pc_conn_time) >
+         SENTINEL_MIN_LINK_RECONNECT_PERIOD &&
+        (mstime() - ri->link->pc_last_activity) > (SENTINEL_PUBLISH_PERIOD*3))
+    {
+        instanceLinkCloseConnection(ri->link,ri->link->pc);
+    }
+
+    /* Update the SDOWN flag. We believe the instance is SDOWN if:
+     *
+     * 1) It is not replying.
+     * 2) We believe it is a master, it reports to be a slave for enough time
+     *    to meet the down_after_period, plus enough time to get two times
+     *    INFO report from the instance. */
+    if (elapsed > ri->down_after_period ||
+        (ri->flags & SRI_MASTER &&
+         ri->role_reported == SRI_SLAVE &&
+         mstime() - ri->role_reported_time >
+          (ri->down_after_period+SENTINEL_INFO_PERIOD*2)))
+    {
+        /* Is subjectively down */
+        if ((ri->flags & SRI_S_DOWN) == 0) {
+            sentinelEvent(LL_WARNING,"+sdown",ri,"%@");
+            ri->s_down_since_time = mstime();
+            ri->flags |= SRI_S_DOWN;
+        }
+    } else {
+        /* Is subjectively up */
+        if (ri->flags & SRI_S_DOWN) {
+            sentinelEvent(LL_WARNING,"-sdown",ri,"%@");
+            ri->flags &= ~(SRI_S_DOWN|SRI_SCRIPT_KILL_SENT);
+        }
+    }
+}
+
+/* Is this instance down according to the configured quorum?
+ *
+ * Note that ODOWN is a weak quorum, it only means that enough Sentinels
+ * reported in a given time range that the instance was not reachable.
+ * However messages can be delayed so there are no strong guarantees about
+ * N instances agreeing at the same time about the down state. */
+void sentinelCheckObjectivelyDown(sentinelRedisInstance *master) {
+    dictIterator *di;
+    dictEntry *de;
+    unsigned int quorum = 0, odown = 0;
+
+    if (master->flags & SRI_S_DOWN) {
+        /* Is down for enough sentinels? */
+        quorum = 1; /* the current sentinel. */
+        /* Count all the other sentinels. */
+        di = dictGetIterator(master->sentinels);
+        while((de = dictNext(di)) != NULL) {
+            sentinelRedisInstance *ri = dictGetVal(de);
+
+            if (ri->flags & SRI_MASTER_DOWN) quorum++;
+        }
+        dictReleaseIterator(di);
+        if (quorum >= master->quorum) odown = 1;
+    }
+
+    /* Set the flag accordingly to the outcome. */
+    if (odown) {
+        if ((master->flags & SRI_O_DOWN) == 0) {
+            sentinelEvent(LL_WARNING,"+odown",master,"%@ #quorum %d/%d",
+                quorum, master->quorum);
+            master->flags |= SRI_O_DOWN;
+            master->o_down_since_time = mstime();
+        }
+    } else {
+        if (master->flags & SRI_O_DOWN) {
+            sentinelEvent(LL_WARNING,"-odown",master,"%@");
+            master->flags &= ~SRI_O_DOWN;
+        }
+    }
+}
+
+/* Receive the SENTINEL is-master-down-by-addr reply, see the
+ * sentinelAskMasterStateToOtherSentinels() function for more information. */
+void sentinelReceiveIsMasterDownReply(redisAsyncContext *c, void *reply, void *privdata) {
+    sentinelRedisInstance *ri = privdata;
+    instanceLink *link = c->data;
+    redisReply *r;
+
+    if (!reply || !link) return;
+    link->pending_commands--;
+    r = reply;
+
+    /* Ignore every error or unexpected reply.
+     * Note that if the command returns an error for any reason we'll
+     * end clearing the SRI_MASTER_DOWN flag for timeout anyway. */
+    if (r->type == REDIS_REPLY_ARRAY && r->elements == 3 &&
+        r->element[0]->type == REDIS_REPLY_INTEGER &&
+        r->element[1]->type == REDIS_REPLY_STRING &&
+        r->element[2]->type == REDIS_REPLY_INTEGER)
+    {
+        ri->last_master_down_reply_time = mstime();
+        if (r->element[0]->integer == 1) {
+            ri->flags |= SRI_MASTER_DOWN;
+        } else {
+            ri->flags &= ~SRI_MASTER_DOWN;
+        }
+        if (strcmp(r->element[1]->str,"*")) {
+            /* If the runid in the reply is not "*" the Sentinel actually
+             * replied with a vote. */
+            sdsfree(ri->leader);
+            if ((long long)ri->leader_epoch != r->element[2]->integer)
+                serverLog(LL_WARNING,
+                    "%s voted for %s %llu", ri->name,
+                    r->element[1]->str,
+                    (unsigned long long) r->element[2]->integer);
+            ri->leader = sdsnew(r->element[1]->str);
+            ri->leader_epoch = r->element[2]->integer;
+        }
+    }
+}
+
+/* If we think the master is down, we start sending
+ * SENTINEL IS-MASTER-DOWN-BY-ADDR requests to other sentinels
+ * in order to get the replies that allow to reach the quorum
+ * needed to mark the master in ODOWN state and trigger a failover. */
+#define SENTINEL_ASK_FORCED (1<<0)
+void sentinelAskMasterStateToOtherSentinels(sentinelRedisInstance *master, int flags) {
+    dictIterator *di;
+    dictEntry *de;
+
+    di = dictGetIterator(master->sentinels);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        mstime_t elapsed = mstime() - ri->last_master_down_reply_time;
+        char port[32];
+        int retval;
+
+        /* If the master state from other sentinel is too old, we clear it. */
+        if (elapsed > SENTINEL_ASK_PERIOD*5) {
+            ri->flags &= ~SRI_MASTER_DOWN;
+            sdsfree(ri->leader);
+            ri->leader = NULL;
+        }
+
+        /* Only ask if master is down to other sentinels if:
+         *
+         * 1) We believe it is down, or there is a failover in progress.
+         * 2) Sentinel is connected.
+         * 3) We did not receive the info within SENTINEL_ASK_PERIOD ms. */
+        if ((master->flags & SRI_S_DOWN) == 0) continue;
+        if (ri->link->disconnected) continue;
+        if (!(flags & SENTINEL_ASK_FORCED) &&
+            mstime() - ri->last_master_down_reply_time < SENTINEL_ASK_PERIOD)
+            continue;
+
+        /* Ask */
+        ll2string(port,sizeof(port),master->addr->port);
+        retval = redisAsyncCommand(ri->link->cc,
+                    sentinelReceiveIsMasterDownReply, ri,
+                    "%s is-master-down-by-addr %s %s %llu %s",
+                    sentinelInstanceMapCommand(ri,"SENTINEL"),
+                    announceSentinelAddr(master->addr), port,
+                    sentinel.current_epoch,
+                    (master->failover_state > SENTINEL_FAILOVER_STATE_NONE) ?
+                    sentinel.myid : "*");
+        if (retval == C_OK) ri->link->pending_commands++;
+    }
+    dictReleaseIterator(di);
+}
+
+/* =============================== FAILOVER ================================= */
+
+/* Crash because of user request via SENTINEL simulate-failure command. */
+void sentinelSimFailureCrash(void) {
+    serverLog(LL_WARNING,
+        "Sentinel CRASH because of SENTINEL simulate-failure");
+    exit(99);
+}
+
+/* Vote for the sentinel with 'req_runid' or return the old vote if already
+ * voted for the specified 'req_epoch' or one greater.
+ *
+ * If a vote is not available returns NULL, otherwise return the Sentinel
+ * runid and populate the leader_epoch with the epoch of the vote. */
+char *sentinelVoteLeader(sentinelRedisInstance *master, uint64_t req_epoch, char *req_runid, uint64_t *leader_epoch) {
+    if (req_epoch > sentinel.current_epoch) {
+        sentinel.current_epoch = req_epoch;
+        sentinelFlushConfig();
+        sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
+            (unsigned long long) sentinel.current_epoch);
+    }
+
+    if (master->leader_epoch < req_epoch && sentinel.current_epoch <= req_epoch)
+    {
+        sdsfree(master->leader);
+        master->leader = sdsnew(req_runid);
+        master->leader_epoch = sentinel.current_epoch;
+        sentinelFlushConfig();
+        sentinelEvent(LL_WARNING,"+vote-for-leader",master,"%s %llu",
+            master->leader, (unsigned long long) master->leader_epoch);
+        /* If we did not voted for ourselves, set the master failover start
+         * time to now, in order to force a delay before we can start a
+         * failover for the same master. */
+        if (strcasecmp(master->leader,sentinel.myid))
+            master->failover_start_time = mstime()+rand()%SENTINEL_MAX_DESYNC;
+    }
+
+    *leader_epoch = master->leader_epoch;
+    return master->leader ? sdsnew(master->leader) : NULL;
+}
+
+struct sentinelLeader {
+    char *runid;
+    unsigned long votes;
+};
+
+/* Helper function for sentinelGetLeader, increment the counter
+ * relative to the specified runid. */
+int sentinelLeaderIncr(dict *counters, char *runid) {
+    dictEntry *existing, *de;
+    uint64_t oldval;
+
+    de = dictAddRaw(counters,runid,&existing);
+    if (existing) {
+        oldval = dictGetUnsignedIntegerVal(existing);
+        dictSetUnsignedIntegerVal(existing,oldval+1);
+        return oldval+1;
+    } else {
+        serverAssert(de != NULL);
+        dictSetUnsignedIntegerVal(de,1);
+        return 1;
+    }
+}
+
+/* Scan all the Sentinels attached to this master to check if there
+ * is a leader for the specified epoch.
+ *
+ * To be a leader for a given epoch, we should have the majority of
+ * the Sentinels we know (ever seen since the last SENTINEL RESET) that
+ * reported the same instance as leader for the same epoch. */
+char *sentinelGetLeader(sentinelRedisInstance *master, uint64_t epoch) {
+    dict *counters;
+    dictIterator *di;
+    dictEntry *de;
+    unsigned int voters = 0, voters_quorum;
+    char *myvote;
+    char *winner = NULL;
+    uint64_t leader_epoch;
+    uint64_t max_votes = 0;
+
+    serverAssert(master->flags & (SRI_O_DOWN|SRI_FAILOVER_IN_PROGRESS));
+    counters = dictCreate(&leaderVotesDictType,NULL);
+
+    voters = dictSize(master->sentinels)+1; /* All the other sentinels and me.*/
+
+    /* Count other sentinels votes */
+    di = dictGetIterator(master->sentinels);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+        if (ri->leader != NULL && ri->leader_epoch == sentinel.current_epoch)
+            sentinelLeaderIncr(counters,ri->leader);
+    }
+    dictReleaseIterator(di);
+
+    /* Check what's the winner. For the winner to win, it needs two conditions:
+     * 1) Absolute majority between voters (50% + 1).
+     * 2) And anyway at least master->quorum votes. */
+    di = dictGetIterator(counters);
+    while((de = dictNext(di)) != NULL) {
+        uint64_t votes = dictGetUnsignedIntegerVal(de);
+
+        if (votes > max_votes) {
+            max_votes = votes;
+            winner = dictGetKey(de);
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Count this Sentinel vote:
+     * if this Sentinel did not voted yet, either vote for the most
+     * common voted sentinel, or for itself if no vote exists at all. */
+    if (winner)
+        myvote = sentinelVoteLeader(master,epoch,winner,&leader_epoch);
+    else
+        myvote = sentinelVoteLeader(master,epoch,sentinel.myid,&leader_epoch);
+
+    if (myvote && leader_epoch == epoch) {
+        uint64_t votes = sentinelLeaderIncr(counters,myvote);
+
+        if (votes > max_votes) {
+            max_votes = votes;
+            winner = myvote;
+        }
+    }
+
+    voters_quorum = voters/2+1;
+    if (winner && (max_votes < voters_quorum || max_votes < master->quorum))
+        winner = NULL;
+
+    winner = winner ? sdsnew(winner) : NULL;
+    sdsfree(myvote);
+    dictRelease(counters);
+    return winner;
+}
+
+/* Send SLAVEOF to the specified instance, always followed by a
+ * CONFIG REWRITE command in order to store the new configuration on disk
+ * when possible (that is, if the Redis instance is recent enough to support
+ * config rewriting, and if the server was started with a configuration file).
+ *
+ * If Host is NULL the function sends "SLAVEOF NO ONE".
+ *
+ * The command returns C_OK if the SLAVEOF command was accepted for
+ * (later) delivery otherwise C_ERR. The command replies are just
+ * discarded. */
+int sentinelSendSlaveOf(sentinelRedisInstance *ri, const sentinelAddr *addr) {
+    char portstr[32];
+    const char *host;
+    int retval;
+
+    /* If host is NULL we send SLAVEOF NO ONE that will turn the instance
+    * into a master. */
+    if (!addr) {
+        host = "NO";
+        memcpy(portstr,"ONE",4);
+    } else {
+        host = announceSentinelAddr(addr);
+        ll2string(portstr,sizeof(portstr),addr->port);
+    }
+
+    /* In order to send SLAVEOF in a safe way, we send a transaction performing
+     * the following tasks:
+     * 1) Reconfigure the instance according to the specified host/port params.
+     * 2) Rewrite the configuration.
+     * 3) Disconnect all clients (but this one sending the command) in order
+     *    to trigger the ask-master-on-reconnection protocol for connected
+     *    clients.
+     *
+     * Note that we don't check the replies returned by commands, since we
+     * will observe instead the effects in the next INFO output. */
+    retval = redisAsyncCommand(ri->link->cc,
+        sentinelDiscardReplyCallback, ri, "%s",
+        sentinelInstanceMapCommand(ri,"MULTI"));
+    if (retval == C_ERR) return retval;
+    ri->link->pending_commands++;
+
+    retval = redisAsyncCommand(ri->link->cc,
+        sentinelDiscardReplyCallback, ri, "%s %s %s",
+        sentinelInstanceMapCommand(ri,"SLAVEOF"),
+        host, portstr);
+    if (retval == C_ERR) return retval;
+    ri->link->pending_commands++;
+
+    retval = redisAsyncCommand(ri->link->cc,
+        sentinelDiscardReplyCallback, ri, "%s REWRITE",
+        sentinelInstanceMapCommand(ri,"CONFIG"));
+    if (retval == C_ERR) return retval;
+    ri->link->pending_commands++;
+
+    /* CLIENT KILL TYPE <type> is only supported starting from Redis 2.8.12,
+     * however sending it to an instance not understanding this command is not
+     * an issue because CLIENT is variadic command, so Redis will not
+     * recognized as a syntax error, and the transaction will not fail (but
+     * only the unsupported command will fail). */
+    for (int type = 0; type < 2; type++) {
+        retval = redisAsyncCommand(ri->link->cc,
+            sentinelDiscardReplyCallback, ri, "%s KILL TYPE %s",
+            sentinelInstanceMapCommand(ri,"CLIENT"),
+            type == 0 ? "normal" : "pubsub");
+        if (retval == C_ERR) return retval;
+        ri->link->pending_commands++;
+    }
+
+    retval = redisAsyncCommand(ri->link->cc,
+        sentinelDiscardReplyCallback, ri, "%s",
+        sentinelInstanceMapCommand(ri,"EXEC"));
+    if (retval == C_ERR) return retval;
+    ri->link->pending_commands++;
+
+    return C_OK;
+}
+
+/* Setup the master state to start a failover. */
+void sentinelStartFailover(sentinelRedisInstance *master) {
+    serverAssert(master->flags & SRI_MASTER);
+
+    master->failover_state = SENTINEL_FAILOVER_STATE_WAIT_START;
+    master->flags |= SRI_FAILOVER_IN_PROGRESS;
+    master->failover_epoch = ++sentinel.current_epoch;
+    sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
+        (unsigned long long) sentinel.current_epoch);
+    sentinelEvent(LL_WARNING,"+try-failover",master,"%@");
+    master->failover_start_time = mstime()+rand()%SENTINEL_MAX_DESYNC;
+    master->failover_state_change_time = mstime();
+}
+
+/* This function checks if there are the conditions to start the failover,
+ * that is:
+ *
+ * 1) Master must be in ODOWN condition.
+ * 2) No failover already in progress.
+ * 3) No failover already attempted recently.
+ *
+ * We still don't know if we'll win the election so it is possible that we
+ * start the failover but that we'll not be able to act.
+ *
+ * Return non-zero if a failover was started. */
+int sentinelStartFailoverIfNeeded(sentinelRedisInstance *master) {
+    /* We can't failover if the master is not in O_DOWN state. */
+    if (!(master->flags & SRI_O_DOWN)) return 0;
+
+    /* Failover already in progress? */
+    if (master->flags & SRI_FAILOVER_IN_PROGRESS) return 0;
+
+    /* Last failover attempt started too little time ago? */
+    if (mstime() - master->failover_start_time <
+        master->failover_timeout*2)
+    {
+        if (master->failover_delay_logged != master->failover_start_time) {
+            time_t clock = (master->failover_start_time +
+                            master->failover_timeout*2) / 1000;
+            char ctimebuf[26];
+
+            ctime_r(&clock,ctimebuf);
+            ctimebuf[24] = '\0'; /* Remove newline. */
+            master->failover_delay_logged = master->failover_start_time;
+            serverLog(LL_WARNING,
+                "Next failover delay: I will not start a failover before %s",
+                ctimebuf);
+        }
+        return 0;
+    }
+
+    sentinelStartFailover(master);
+    return 1;
+}
+
+/* Select a suitable slave to promote. The current algorithm only uses
+ * the following parameters:
+ *
+ * 1) None of the following conditions: S_DOWN, O_DOWN, DISCONNECTED.
+ * 2) Last time the slave replied to ping no more than 5 times the PING period.
+ * 3) info_refresh not older than 3 times the INFO refresh period.
+ * 4) master_link_down_time no more than:
+ *     (now - master->s_down_since_time) + (master->down_after_period * 10).
+ *    Basically since the master is down from our POV, the slave reports
+ *    to be disconnected no more than 10 times the configured down-after-period.
+ *    This is pretty much black magic but the idea is, the master was not
+ *    available so the slave may be lagging, but not over a certain time.
+ *    Anyway we'll select the best slave according to replication offset.
+ * 5) Slave priority can't be zero, otherwise the slave is discarded.
+ *
+ * Among all the slaves matching the above conditions we select the slave
+ * with, in order of sorting key:
+ *
+ * - lower slave_priority.
+ * - bigger processed replication offset.
+ * - lexicographically smaller runid.
+ *
+ * Basically if runid is the same, the slave that processed more commands
+ * from the master is selected.
+ *
+ * The function returns the pointer to the selected slave, otherwise
+ * NULL if no suitable slave was found.
+ */
+
+/* Helper for sentinelSelectSlave(). This is used by qsort() in order to
+ * sort suitable slaves in a "better first" order, to take the first of
+ * the list. */
+int compareSlavesForPromotion(const void *a, const void *b) {
+    sentinelRedisInstance **sa = (sentinelRedisInstance **)a,
+                          **sb = (sentinelRedisInstance **)b;
+    char *sa_runid, *sb_runid;
+
+    if ((*sa)->slave_priority != (*sb)->slave_priority)
+        return (*sa)->slave_priority - (*sb)->slave_priority;
+
+    /* If priority is the same, select the slave with greater replication
+     * offset (processed more data from the master). */
+    if ((*sa)->slave_repl_offset > (*sb)->slave_repl_offset) {
+        return -1; /* a < b */
+    } else if ((*sa)->slave_repl_offset < (*sb)->slave_repl_offset) {
+        return 1; /* a > b */
+    }
+
+    /* If the replication offset is the same select the slave with that has
+     * the lexicographically smaller runid. Note that we try to handle runid
+     * == NULL as there are old Redis versions that don't publish runid in
+     * INFO. A NULL runid is considered bigger than any other runid. */
+    sa_runid = (*sa)->runid;
+    sb_runid = (*sb)->runid;
+    if (sa_runid == NULL && sb_runid == NULL) return 0;
+    else if (sa_runid == NULL) return 1;  /* a > b */
+    else if (sb_runid == NULL) return -1; /* a < b */
+    return strcasecmp(sa_runid, sb_runid);
+}
+
+sentinelRedisInstance *sentinelSelectSlave(sentinelRedisInstance *master) {
+    sentinelRedisInstance **instance =
+        zmalloc(sizeof(instance[0])*dictSize(master->slaves));
+    sentinelRedisInstance *selected = NULL;
+    int instances = 0;
+    dictIterator *di;
+    dictEntry *de;
+    mstime_t max_master_down_time = 0;
+
+    if (master->flags & SRI_S_DOWN)
+        max_master_down_time += mstime() - master->s_down_since_time;
+    max_master_down_time += master->down_after_period * 10;
+
+    di = dictGetIterator(master->slaves);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *slave = dictGetVal(de);
+        mstime_t info_validity_time;
+
+        if (slave->flags & (SRI_S_DOWN|SRI_O_DOWN)) continue;
+        if (slave->link->disconnected) continue;
+        if (mstime() - slave->link->last_avail_time > SENTINEL_PING_PERIOD*5) continue;
+        if (slave->slave_priority == 0) continue;
+
+        /* If the master is in SDOWN state we get INFO for slaves every second.
+         * Otherwise we get it with the usual period so we need to account for
+         * a larger delay. */
+        if (master->flags & SRI_S_DOWN)
+            info_validity_time = SENTINEL_PING_PERIOD*5;
+        else
+            info_validity_time = SENTINEL_INFO_PERIOD*3;
+        if (mstime() - slave->info_refresh > info_validity_time) continue;
+        if (slave->master_link_down_time > max_master_down_time) continue;
+        instance[instances++] = slave;
+    }
+    dictReleaseIterator(di);
+    if (instances) {
+        qsort(instance,instances,sizeof(sentinelRedisInstance*),
+            compareSlavesForPromotion);
+        selected = instance[0];
+    }
+    zfree(instance);
+    return selected;
+}
+
+/* ---------------- Failover state machine implementation ------------------- */
+void sentinelFailoverWaitStart(sentinelRedisInstance *ri) {
+    char *leader;
+    int isleader;
+
+    /* Check if we are the leader for the failover epoch. */
+    leader = sentinelGetLeader(ri, ri->failover_epoch);
+    isleader = leader && strcasecmp(leader,sentinel.myid) == 0;
+    sdsfree(leader);
+
+    /* If I'm not the leader, and it is not a forced failover via
+     * SENTINEL FAILOVER, then I can't continue with the failover. */
+    if (!isleader && !(ri->flags & SRI_FORCE_FAILOVER)) {
+        int election_timeout = SENTINEL_ELECTION_TIMEOUT;
+
+        /* The election timeout is the MIN between SENTINEL_ELECTION_TIMEOUT
+         * and the configured failover timeout. */
+        if (election_timeout > ri->failover_timeout)
+            election_timeout = ri->failover_timeout;
+        /* Abort the failover if I'm not the leader after some time. */
+        if (mstime() - ri->failover_start_time > election_timeout) {
+            sentinelEvent(LL_WARNING,"-failover-abort-not-elected",ri,"%@");
+            sentinelAbortFailover(ri);
+        }
+        return;
+    }
+    sentinelEvent(LL_WARNING,"+elected-leader",ri,"%@");
+    if (sentinel.simfailure_flags & SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION)
+        sentinelSimFailureCrash();
+    ri->failover_state = SENTINEL_FAILOVER_STATE_SELECT_SLAVE;
+    ri->failover_state_change_time = mstime();
+    sentinelEvent(LL_WARNING,"+failover-state-select-slave",ri,"%@");
+}
+
+void sentinelFailoverSelectSlave(sentinelRedisInstance *ri) {
+    sentinelRedisInstance *slave = sentinelSelectSlave(ri);
+
+    /* We don't handle the timeout in this state as the function aborts
+     * the failover or go forward in the next state. */
+    if (slave == NULL) {
+        sentinelEvent(LL_WARNING,"-failover-abort-no-good-slave",ri,"%@");
+        sentinelAbortFailover(ri);
+    } else {
+        sentinelEvent(LL_WARNING,"+selected-slave",slave,"%@");
+        slave->flags |= SRI_PROMOTED;
+        ri->promoted_slave = slave;
+        ri->failover_state = SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE;
+        ri->failover_state_change_time = mstime();
+        sentinelEvent(LL_NOTICE,"+failover-state-send-slaveof-noone",
+            slave, "%@");
+    }
+}
+
+void sentinelFailoverSendSlaveOfNoOne(sentinelRedisInstance *ri) {
+    int retval;
+
+    /* We can't send the command to the promoted slave if it is now
+     * disconnected. Retry again and again with this state until the timeout
+     * is reached, then abort the failover. */
+    if (ri->promoted_slave->link->disconnected) {
+        if (mstime() - ri->failover_state_change_time > ri->failover_timeout) {
+            sentinelEvent(LL_WARNING,"-failover-abort-slave-timeout",ri,"%@");
+            sentinelAbortFailover(ri);
+        }
+        return;
+    }
+
+    /* Send SLAVEOF NO ONE command to turn the slave into a master.
+     * We actually register a generic callback for this command as we don't
+     * really care about the reply. We check if it worked indirectly observing
+     * if INFO returns a different role (master instead of slave). */
+    retval = sentinelSendSlaveOf(ri->promoted_slave,NULL);
+    if (retval != C_OK) return;
+    sentinelEvent(LL_NOTICE, "+failover-state-wait-promotion",
+        ri->promoted_slave,"%@");
+    ri->failover_state = SENTINEL_FAILOVER_STATE_WAIT_PROMOTION;
+    ri->failover_state_change_time = mstime();
+}
+
+/* We actually wait for promotion indirectly checking with INFO when the
+ * slave turns into a master. */
+void sentinelFailoverWaitPromotion(sentinelRedisInstance *ri) {
+    /* Just handle the timeout. Switching to the next state is handled
+     * by the function parsing the INFO command of the promoted slave. */
+    if (mstime() - ri->failover_state_change_time > ri->failover_timeout) {
+        sentinelEvent(LL_WARNING,"-failover-abort-slave-timeout",ri,"%@");
+        sentinelAbortFailover(ri);
+    }
+}
+
+void sentinelFailoverDetectEnd(sentinelRedisInstance *master) {
+    int not_reconfigured = 0, timeout = 0;
+    dictIterator *di;
+    dictEntry *de;
+    mstime_t elapsed = mstime() - master->failover_state_change_time;
+
+    /* We can't consider failover finished if the promoted slave is
+     * not reachable. */
+    if (master->promoted_slave == NULL ||
+        master->promoted_slave->flags & SRI_S_DOWN) return;
+
+    /* The failover terminates once all the reachable slaves are properly
+     * configured. */
+    di = dictGetIterator(master->slaves);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *slave = dictGetVal(de);
+
+        if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE)) continue;
+        if (slave->flags & SRI_S_DOWN) continue;
+        not_reconfigured++;
+    }
+    dictReleaseIterator(di);
+
+    /* Force end of failover on timeout. */
+    if (elapsed > master->failover_timeout) {
+        not_reconfigured = 0;
+        timeout = 1;
+        sentinelEvent(LL_WARNING,"+failover-end-for-timeout",master,"%@");
+    }
+
+    if (not_reconfigured == 0) {
+        sentinelEvent(LL_WARNING,"+failover-end",master,"%@");
+        master->failover_state = SENTINEL_FAILOVER_STATE_UPDATE_CONFIG;
+        master->failover_state_change_time = mstime();
+    }
+
+    /* If I'm the leader it is a good idea to send a best effort SLAVEOF
+     * command to all the slaves still not reconfigured to replicate with
+     * the new master. */
+    if (timeout) {
+        dictIterator *di;
+        dictEntry *de;
+
+        di = dictGetIterator(master->slaves);
+        while((de = dictNext(di)) != NULL) {
+            sentinelRedisInstance *slave = dictGetVal(de);
+            int retval;
+
+            if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE|SRI_RECONF_SENT)) continue;
+            if (slave->link->disconnected) continue;
+
+            retval = sentinelSendSlaveOf(slave,master->promoted_slave->addr);
+            if (retval == C_OK) {
+                sentinelEvent(LL_NOTICE,"+slave-reconf-sent-be",slave,"%@");
+                slave->flags |= SRI_RECONF_SENT;
+            }
+        }
+        dictReleaseIterator(di);
+    }
+}
+
+/* Send SLAVE OF <new master address> to all the remaining slaves that
+ * still don't appear to have the configuration updated. */
+void sentinelFailoverReconfNextSlave(sentinelRedisInstance *master) {
+    dictIterator *di;
+    dictEntry *de;
+    int in_progress = 0;
+
+    di = dictGetIterator(master->slaves);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *slave = dictGetVal(de);
+
+        if (slave->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG))
+            in_progress++;
+    }
+    dictReleaseIterator(di);
+
+    di = dictGetIterator(master->slaves);
+    while(in_progress < master->parallel_syncs &&
+          (de = dictNext(di)) != NULL)
+    {
+        sentinelRedisInstance *slave = dictGetVal(de);
+        int retval;
+
+        /* Skip the promoted slave, and already configured slaves. */
+        if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE)) continue;
+
+        /* If too much time elapsed without the slave moving forward to
+         * the next state, consider it reconfigured even if it is not.
+         * Sentinels will detect the slave as misconfigured and fix its
+         * configuration later. */
+        if ((slave->flags & SRI_RECONF_SENT) &&
+            (mstime() - slave->slave_reconf_sent_time) >
+            SENTINEL_SLAVE_RECONF_TIMEOUT)
+        {
+            sentinelEvent(LL_NOTICE,"-slave-reconf-sent-timeout",slave,"%@");
+            slave->flags &= ~SRI_RECONF_SENT;
+            slave->flags |= SRI_RECONF_DONE;
+        }
+
+        /* Nothing to do for instances that are disconnected or already
+         * in RECONF_SENT state. */
+        if (slave->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG)) continue;
+        if (slave->link->disconnected) continue;
+
+        /* Send SLAVEOF <new master>. */
+        retval = sentinelSendSlaveOf(slave,master->promoted_slave->addr);
+        if (retval == C_OK) {
+            slave->flags |= SRI_RECONF_SENT;
+            slave->slave_reconf_sent_time = mstime();
+            sentinelEvent(LL_NOTICE,"+slave-reconf-sent",slave,"%@");
+            in_progress++;
+        }
+    }
+    dictReleaseIterator(di);
+
+    /* Check if all the slaves are reconfigured and handle timeout. */
+    sentinelFailoverDetectEnd(master);
+}
+
+/* This function is called when the slave is in
+ * SENTINEL_FAILOVER_STATE_UPDATE_CONFIG state. In this state we need
+ * to remove it from the master table and add the promoted slave instead. */
+void sentinelFailoverSwitchToPromotedSlave(sentinelRedisInstance *master) {
+    sentinelRedisInstance *ref = master->promoted_slave ?
+                                 master->promoted_slave : master;
+
+    sentinelEvent(LL_WARNING,"+switch-master",master,"%s %s %d %s %d",
+        master->name, announceSentinelAddr(master->addr), master->addr->port,
+        announceSentinelAddr(ref->addr), ref->addr->port);
+
+    sentinelResetMasterAndChangeAddress(master,ref->addr->hostname,ref->addr->port);
+}
+
+void sentinelFailoverStateMachine(sentinelRedisInstance *ri) {
+    serverAssert(ri->flags & SRI_MASTER);
+
+    if (!(ri->flags & SRI_FAILOVER_IN_PROGRESS)) return;
+
+    switch(ri->failover_state) {
+        case SENTINEL_FAILOVER_STATE_WAIT_START:
+            sentinelFailoverWaitStart(ri);
+            break;
+        case SENTINEL_FAILOVER_STATE_SELECT_SLAVE:
+            sentinelFailoverSelectSlave(ri);
+            break;
+        case SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE:
+            sentinelFailoverSendSlaveOfNoOne(ri);
+            break;
+        case SENTINEL_FAILOVER_STATE_WAIT_PROMOTION:
+            sentinelFailoverWaitPromotion(ri);
+            break;
+        case SENTINEL_FAILOVER_STATE_RECONF_SLAVES:
+            sentinelFailoverReconfNextSlave(ri);
+            break;
+    }
+}
+
+/* Abort a failover in progress:
+ *
+ * This function can only be called before the promoted slave acknowledged
+ * the slave -> master switch. Otherwise the failover can't be aborted and
+ * will reach its end (possibly by timeout). */
+void sentinelAbortFailover(sentinelRedisInstance *ri) {
+    serverAssert(ri->flags & SRI_FAILOVER_IN_PROGRESS);
+    serverAssert(ri->failover_state <= SENTINEL_FAILOVER_STATE_WAIT_PROMOTION);
+
+    ri->flags &= ~(SRI_FAILOVER_IN_PROGRESS|SRI_FORCE_FAILOVER);
+    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
+    ri->failover_state_change_time = mstime();
+    if (ri->promoted_slave) {
+        ri->promoted_slave->flags &= ~SRI_PROMOTED;
+        ri->promoted_slave = NULL;
+    }
+}
+
+/* ======================== SENTINEL timer handler ==========================
+ * This is the "main" our Sentinel, being sentinel completely non blocking
+ * in design. The function is called every second.
+ * -------------------------------------------------------------------------- */
+
+/* Perform scheduled operations for the specified Redis instance. */
+void sentinelHandleRedisInstance(sentinelRedisInstance *ri) {
+    /* ========== MONITORING HALF ============ */
+    /* Every kind of instance */
+    sentinelReconnectInstance(ri);
+    sentinelSendPeriodicCommands(ri);
+
+    /* ============== ACTING HALF ============= */
+    /* We don't proceed with the acting half if we are in TILT mode.
+     * TILT happens when we find something odd with the time, like a
+     * sudden change in the clock. */
+    if (sentinel.tilt) {
+        if (mstime()-sentinel.tilt_start_time < SENTINEL_TILT_PERIOD) return;
+        sentinel.tilt = 0;
+        sentinelEvent(LL_WARNING,"-tilt",NULL,"#tilt mode exited");
+    }
+
+    /* Every kind of instance */
+    sentinelCheckSubjectivelyDown(ri);
+
+    /* Masters and slaves */
+    if (ri->flags & (SRI_MASTER|SRI_SLAVE)) {
+        /* Nothing so far. */
+    }
+
+    /* Only masters */
+    if (ri->flags & SRI_MASTER) {
+        sentinelCheckObjectivelyDown(ri);
+        if (sentinelStartFailoverIfNeeded(ri))
+            sentinelAskMasterStateToOtherSentinels(ri,SENTINEL_ASK_FORCED);
+        sentinelFailoverStateMachine(ri);
+        sentinelAskMasterStateToOtherSentinels(ri,SENTINEL_NO_FLAGS);
+    }
+}
+
+/* Perform scheduled operations for all the instances in the dictionary.
+ * Recursively call the function against dictionaries of slaves. */
+void sentinelHandleDictOfRedisInstances(dict *instances) {
+    dictIterator *di;
+    dictEntry *de;
+    sentinelRedisInstance *switch_to_promoted = NULL;
+
+    /* There are a number of things we need to perform against every master. */
+    di = dictGetIterator(instances);
+    while((de = dictNext(di)) != NULL) {
+        sentinelRedisInstance *ri = dictGetVal(de);
+
+        sentinelHandleRedisInstance(ri);
+        if (ri->flags & SRI_MASTER) {
+            sentinelHandleDictOfRedisInstances(ri->slaves);
+            sentinelHandleDictOfRedisInstances(ri->sentinels);
+            if (ri->failover_state == SENTINEL_FAILOVER_STATE_UPDATE_CONFIG) {
+                switch_to_promoted = ri;
+            }
+        }
+    }
+    if (switch_to_promoted)
+        sentinelFailoverSwitchToPromotedSlave(switch_to_promoted);
+    dictReleaseIterator(di);
+}
+
+/* This function checks if we need to enter the TITL mode.
+ *
+ * The TILT mode is entered if we detect that between two invocations of the
+ * timer interrupt, a negative amount of time, or too much time has passed.
+ * Note that we expect that more or less just 100 milliseconds will pass
+ * if everything is fine. However we'll see a negative number or a
+ * difference bigger than SENTINEL_TILT_TRIGGER milliseconds if one of the
+ * following conditions happen:
+ *
+ * 1) The Sentinel process for some time is blocked, for every kind of
+ * random reason: the load is huge, the computer was frozen for some time
+ * in I/O or alike, the process was stopped by a signal. Everything.
+ * 2) The system clock was altered significantly.
+ *
+ * Under both this conditions we'll see everything as timed out and failing
+ * without good reasons. Instead we enter the TILT mode and wait
+ * for SENTINEL_TILT_PERIOD to elapse before starting to act again.
+ *
+ * During TILT time we still collect information, we just do not act. */
+void sentinelCheckTiltCondition(void) {
+    mstime_t now = mstime();
+    mstime_t delta = now - sentinel.previous_time;
+
+    if (delta < 0 || delta > SENTINEL_TILT_TRIGGER) {
+        sentinel.tilt = 1;
+        sentinel.tilt_start_time = mstime();
+        sentinelEvent(LL_WARNING,"+tilt",NULL,"#tilt mode entered");
+    }
+    sentinel.previous_time = mstime();
+}
+
+void sentinelTimer(void) {
+    sentinelCheckTiltCondition();
+    sentinelHandleDictOfRedisInstances(sentinel.masters);
+    sentinelRunPendingScripts();
+    sentinelCollectTerminatedScripts();
+    sentinelKillTimedoutScripts();
+
+    /* We continuously change the frequency of the Redis "timer interrupt"
+     * in order to desynchronize every Sentinel from every other.
+     * This non-determinism avoids that Sentinels started at the same time
+     * exactly continue to stay synchronized asking to be voted at the
+     * same time again and again (resulting in nobody likely winning the
+     * election because of split brain voting). */
+    server.hz = CONFIG_DEFAULT_HZ + rand() % CONFIG_DEFAULT_HZ;
+}
diff --git a/redis-stable/src/server.c b/redis-stable/src/server.c
new file mode 100644
index 00000000..58c0a3d6
--- /dev/null
+++ b/redis-stable/src/server.c
@@ -0,0 +1,6406 @@
+/*
+ * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "monotonic.h"
+#include "cluster.h"
+#include "slowlog.h"
+#include "bio.h"
+#include "latency.h"
+#include "atomicvar.h"
+#include "mt19937-64.h"
+
+#include <time.h>
+#include <signal.h>
+#include <sys/wait.h>
+#include <errno.h>
+#include <assert.h>
+#include <ctype.h>
+#include <stdarg.h>
+#include <arpa/inet.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <sys/time.h>
+#include <sys/resource.h>
+#include <sys/uio.h>
+#include <sys/un.h>
+#include <limits.h>
+#include <float.h>
+#include <math.h>
+#include <sys/resource.h>
+#include <sys/utsname.h>
+#include <locale.h>
+#include <sys/socket.h>
+#include <sys/resource.h>
+
+#ifdef __linux__
+#include <sys/mman.h>
+#endif
+
+/* Our shared "common" objects */
+
+struct sharedObjectsStruct shared;
+
+/* Global vars that are actually used as constants. The following double
+ * values are used for double on-disk serialization, and are initialized
+ * at runtime to avoid strange compiler optimizations. */
+
+double R_Zero, R_PosInf, R_NegInf, R_Nan;
+
+/*================================= Globals ================================= */
+
+/* Global vars */
+struct redisServer server; /* Server global state */
+
+/* Our command table.
+ *
+ * Every entry is composed of the following fields:
+ *
+ * name:        A string representing the command name.
+ *
+ * function:    Pointer to the C function implementing the command.
+ *
+ * arity:       Number of arguments, it is possible to use -N to say >= N
+ *
+ * sflags:      Command flags as string. See below for a table of flags.
+ *
+ * flags:       Flags as bitmask. Computed by Redis using the 'sflags' field.
+ *
+ * get_keys_proc: An optional function to get key arguments from a command.
+ *                This is only used when the following three fields are not
+ *                enough to specify what arguments are keys.
+ *
+ * first_key_index: First argument that is a key
+ *
+ * last_key_index: Last argument that is a key
+ *
+ * key_step:    Step to get all the keys from first to last argument.
+ *              For instance in MSET the step is two since arguments
+ *              are key,val,key,val,...
+ *
+ * microseconds: Microseconds of total execution time for this command.
+ *
+ * calls:       Total number of calls of this command.
+ *
+ * id:          Command bit identifier for ACLs or other goals.
+ *
+ * The flags, microseconds and calls fields are computed by Redis and should
+ * always be set to zero.
+ *
+ * Command flags are expressed using space separated strings, that are turned
+ * into actual flags by the populateCommandTable() function.
+ *
+ * This is the meaning of the flags:
+ *
+ * write:       Write command (may modify the key space).
+ *
+ * read-only:   Commands just reading from keys without changing the content.
+ *              Note that commands that don't read from the keyspace such as
+ *              TIME, SELECT, INFO, administrative commands, and connection
+ *              or transaction related commands (multi, exec, discard, ...)
+ *              are not flagged as read-only commands, since they affect the
+ *              server or the connection in other ways.
+ *
+ * use-memory:  May increase memory usage once called. Don't allow if out
+ *              of memory.
+ *
+ * admin:       Administrative command, like SAVE or SHUTDOWN.
+ *
+ * pub-sub:     Pub/Sub related command.
+ *
+ * no-script:   Command not allowed in scripts.
+ *
+ * random:      Random command. Command is not deterministic, that is, the same
+ *              command with the same arguments, with the same key space, may
+ *              have different results. For instance SPOP and RANDOMKEY are
+ *              two random commands.
+ *
+ * to-sort:     Sort command output array if called from script, so that the
+ *              output is deterministic. When this flag is used (not always
+ *              possible), then the "random" flag is not needed.
+ *
+ * ok-loading:  Allow the command while loading the database.
+ *
+ * ok-stale:    Allow the command while a slave has stale data but is not
+ *              allowed to serve this data. Normally no command is accepted
+ *              in this condition but just a few.
+ *
+ * no-monitor:  Do not automatically propagate the command on MONITOR.
+ *
+ * no-slowlog:  Do not automatically propagate the command to the slowlog.
+ *
+ * cluster-asking: Perform an implicit ASKING for this command, so the
+ *              command will be accepted in cluster mode if the slot is marked
+ *              as 'importing'.
+ *
+ * fast:        Fast command: O(1) or O(log(N)) command that should never
+ *              delay its execution as long as the kernel scheduler is giving
+ *              us time. Note that commands that may trigger a DEL as a side
+ *              effect (like SET) are not fast commands.
+ * 
+ * may-replicate: Command may produce replication traffic, but should be 
+ *                allowed under circumstances where write commands are disallowed. 
+ *                Examples include PUBLISH, which replicates pubsub messages,and 
+ *                EVAL, which may execute write commands, which are replicated, 
+ *                or may just execute read commands. A command can not be marked 
+ *                both "write" and "may-replicate"
+ *
+ * The following additional flags are only used in order to put commands
+ * in a specific ACL category. Commands can have multiple ACL categories.
+ *
+ * @keyspace, @read, @write, @set, @sortedset, @list, @hash, @string, @bitmap,
+ * @hyperloglog, @stream, @admin, @fast, @slow, @pubsub, @blocking, @dangerous,
+ * @connection, @transaction, @scripting, @geo.
+ *
+ * Note that:
+ *
+ * 1) The read-only flag implies the @read ACL category.
+ * 2) The write flag implies the @write ACL category.
+ * 3) The fast flag implies the @fast ACL category.
+ * 4) The admin flag implies the @admin and @dangerous ACL category.
+ * 5) The pub-sub flag implies the @pubsub ACL category.
+ * 6) The lack of fast flag implies the @slow ACL category.
+ * 7) The non obvious "keyspace" category includes the commands
+ *    that interact with keys without having anything to do with
+ *    specific data structures, such as: DEL, RENAME, MOVE, SELECT,
+ *    TYPE, EXPIRE*, PEXPIRE*, TTL, PTTL, ...
+ */
+
+struct redisCommand redisCommandTable[] = {
+    {"module",moduleCommand,-2,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"get",getCommand,2,
+     "read-only fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"getex",getexCommand,-2,
+     "write fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"getdel",getdelCommand,2,
+     "write fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    /* Note that we can't flag set as fast, since it may perform an
+     * implicit DEL of a large key. */
+    {"set",setCommand,-3,
+     "write use-memory @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"setnx",setnxCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"setex",setexCommand,4,
+     "write use-memory @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"psetex",psetexCommand,4,
+     "write use-memory @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"append",appendCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"strlen",strlenCommand,2,
+     "read-only fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"del",delCommand,-2,
+     "write @keyspace",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"unlink",unlinkCommand,-2,
+     "write fast @keyspace",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"exists",existsCommand,-2,
+     "read-only fast @keyspace",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"setbit",setbitCommand,4,
+     "write use-memory @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"getbit",getbitCommand,3,
+     "read-only fast @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"bitfield",bitfieldCommand,-2,
+     "write use-memory @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"bitfield_ro",bitfieldroCommand,-2,
+     "read-only fast @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"setrange",setrangeCommand,4,
+     "write use-memory @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"getrange",getrangeCommand,4,
+     "read-only @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"substr",getrangeCommand,4,
+     "read-only @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"incr",incrCommand,2,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"decr",decrCommand,2,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"mget",mgetCommand,-2,
+     "read-only fast @string",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"rpush",rpushCommand,-3,
+     "write use-memory fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lpush",lpushCommand,-3,
+     "write use-memory fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"rpushx",rpushxCommand,-3,
+     "write use-memory fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lpushx",lpushxCommand,-3,
+     "write use-memory fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"linsert",linsertCommand,5,
+     "write use-memory @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"rpop",rpopCommand,-2,
+     "write fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lpop",lpopCommand,-2,
+     "write fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"brpop",brpopCommand,-3,
+     "write no-script @list @blocking",
+     0,NULL,1,-2,1,0,0,0},
+
+    {"brpoplpush",brpoplpushCommand,4,
+     "write use-memory no-script @list @blocking",
+     0,NULL,1,2,1,0,0,0},
+
+    {"blmove",blmoveCommand,6,
+     "write use-memory no-script @list @blocking",
+     0,NULL,1,2,1,0,0,0},
+
+    {"blpop",blpopCommand,-3,
+     "write no-script @list @blocking",
+     0,NULL,1,-2,1,0,0,0},
+
+    {"llen",llenCommand,2,
+     "read-only fast @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lindex",lindexCommand,3,
+     "read-only @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lset",lsetCommand,4,
+     "write use-memory @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lrange",lrangeCommand,4,
+     "read-only @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"ltrim",ltrimCommand,4,
+     "write @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lpos",lposCommand,-3,
+     "read-only @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"lrem",lremCommand,4,
+     "write @list",
+     0,NULL,1,1,1,0,0,0},
+
+    {"rpoplpush",rpoplpushCommand,3,
+     "write use-memory @list",
+     0,NULL,1,2,1,0,0,0},
+
+    {"lmove",lmoveCommand,5,
+     "write use-memory @list",
+     0,NULL,1,2,1,0,0,0},
+
+    {"sadd",saddCommand,-3,
+     "write use-memory fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"srem",sremCommand,-3,
+     "write fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"smove",smoveCommand,4,
+     "write fast @set",
+     0,NULL,1,2,1,0,0,0},
+
+    {"sismember",sismemberCommand,3,
+     "read-only fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"smismember",smismemberCommand,-3,
+     "read-only fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"scard",scardCommand,2,
+     "read-only fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"spop",spopCommand,-2,
+     "write random fast @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"srandmember",srandmemberCommand,-2,
+     "read-only random @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"sinter",sinterCommand,-2,
+     "read-only to-sort @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"sinterstore",sinterstoreCommand,-3,
+     "write use-memory @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"sunion",sunionCommand,-2,
+     "read-only to-sort @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"sunionstore",sunionstoreCommand,-3,
+     "write use-memory @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"sdiff",sdiffCommand,-2,
+     "read-only to-sort @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"sdiffstore",sdiffstoreCommand,-3,
+     "write use-memory @set",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"smembers",sinterCommand,2,
+     "read-only to-sort @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"sscan",sscanCommand,-3,
+     "read-only random @set",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zadd",zaddCommand,-4,
+     "write use-memory fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zincrby",zincrbyCommand,4,
+     "write use-memory fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrem",zremCommand,-3,
+     "write fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zremrangebyscore",zremrangebyscoreCommand,4,
+     "write @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zremrangebyrank",zremrangebyrankCommand,4,
+     "write @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zremrangebylex",zremrangebylexCommand,4,
+     "write @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zunionstore",zunionstoreCommand,-4,
+     "write use-memory @sortedset",
+     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
+
+    {"zinterstore",zinterstoreCommand,-4,
+     "write use-memory @sortedset",
+     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
+
+    {"zdiffstore",zdiffstoreCommand,-4,
+     "write use-memory @sortedset",
+     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
+
+    {"zunion",zunionCommand,-3,
+     "read-only @sortedset",
+     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
+
+    {"zinter",zinterCommand,-3,
+     "read-only @sortedset",
+     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
+
+    {"zdiff",zdiffCommand,-3,
+     "read-only @sortedset",
+     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
+
+    {"zrange",zrangeCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrangestore",zrangestoreCommand,-5,
+     "write use-memory @sortedset",
+     0,NULL,1,2,1,0,0,0},
+
+    {"zrangebyscore",zrangebyscoreCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrevrangebyscore",zrevrangebyscoreCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrangebylex",zrangebylexCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrevrangebylex",zrevrangebylexCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zcount",zcountCommand,4,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zlexcount",zlexcountCommand,4,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrevrange",zrevrangeCommand,-4,
+     "read-only @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zcard",zcardCommand,2,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zscore",zscoreCommand,3,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zmscore",zmscoreCommand,-3,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrank",zrankCommand,3,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zrevrank",zrevrankCommand,3,
+     "read-only fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zscan",zscanCommand,-3,
+     "read-only random @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zpopmin",zpopminCommand,-2,
+     "write fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"zpopmax",zpopmaxCommand,-2,
+     "write fast @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"bzpopmin",bzpopminCommand,-3,
+     "write no-script fast @sortedset @blocking",
+     0,NULL,1,-2,1,0,0,0},
+
+    {"bzpopmax",bzpopmaxCommand,-3,
+     "write no-script fast @sortedset @blocking",
+     0,NULL,1,-2,1,0,0,0},
+
+    {"zrandmember",zrandmemberCommand,-2,
+     "read-only random @sortedset",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hset",hsetCommand,-4,
+     "write use-memory fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hsetnx",hsetnxCommand,4,
+     "write use-memory fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hget",hgetCommand,3,
+     "read-only fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hmset",hsetCommand,-4,
+     "write use-memory fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hmget",hmgetCommand,-3,
+     "read-only fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hincrby",hincrbyCommand,4,
+     "write use-memory fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hincrbyfloat",hincrbyfloatCommand,4,
+     "write use-memory fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hdel",hdelCommand,-3,
+     "write fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hlen",hlenCommand,2,
+     "read-only fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hstrlen",hstrlenCommand,3,
+     "read-only fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hkeys",hkeysCommand,2,
+     "read-only to-sort @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hvals",hvalsCommand,2,
+     "read-only to-sort @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hgetall",hgetallCommand,2,
+     "read-only random @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hexists",hexistsCommand,3,
+     "read-only fast @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hrandfield",hrandfieldCommand,-2,
+     "read-only random @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"hscan",hscanCommand,-3,
+     "read-only random @hash",
+     0,NULL,1,1,1,0,0,0},
+
+    {"incrby",incrbyCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"decrby",decrbyCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"incrbyfloat",incrbyfloatCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"getset",getsetCommand,3,
+     "write use-memory fast @string",
+     0,NULL,1,1,1,0,0,0},
+
+    {"mset",msetCommand,-3,
+     "write use-memory @string",
+     0,NULL,1,-1,2,0,0,0},
+
+    {"msetnx",msetnxCommand,-3,
+     "write use-memory @string",
+     0,NULL,1,-1,2,0,0,0},
+
+    {"randomkey",randomkeyCommand,1,
+     "read-only random @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"select",selectCommand,2,
+     "ok-loading fast ok-stale @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"swapdb",swapdbCommand,3,
+     "write fast @keyspace @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"move",moveCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"copy",copyCommand,-3,
+     "write use-memory @keyspace",
+     0,NULL,1,2,1,0,0,0},
+
+    /* Like for SET, we can't mark rename as a fast command because
+     * overwriting the target key may result in an implicit slow DEL. */
+    {"rename",renameCommand,3,
+     "write @keyspace",
+     0,NULL,1,2,1,0,0,0},
+
+    {"renamenx",renamenxCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,2,1,0,0,0},
+
+    {"expire",expireCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"expireat",expireatCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"pexpire",pexpireCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"pexpireat",pexpireatCommand,3,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"keys",keysCommand,2,
+     "read-only to-sort @keyspace @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"scan",scanCommand,-2,
+     "read-only random @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"dbsize",dbsizeCommand,1,
+     "read-only fast @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"auth",authCommand,-2,
+     "no-auth no-script ok-loading ok-stale fast @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    /* We don't allow PING during loading since in Redis PING is used as
+     * failure detection, and a loading server is considered to be
+     * not available. */
+    {"ping",pingCommand,-1,
+     "ok-stale fast @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    {"echo",echoCommand,2,
+     "fast @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    {"save",saveCommand,1,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"bgsave",bgsaveCommand,-1,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"bgrewriteaof",bgrewriteaofCommand,1,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"shutdown",shutdownCommand,-1,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"lastsave",lastsaveCommand,1,
+     "random fast ok-loading ok-stale @admin @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"type",typeCommand,2,
+     "read-only fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"multi",multiCommand,1,
+     "no-script fast ok-loading ok-stale @transaction",
+     0,NULL,0,0,0,0,0,0},
+
+    {"exec",execCommand,1,
+     "no-script no-slowlog ok-loading ok-stale @transaction",
+     0,NULL,0,0,0,0,0,0},
+
+    {"discard",discardCommand,1,
+     "no-script fast ok-loading ok-stale @transaction",
+     0,NULL,0,0,0,0,0,0},
+
+    {"sync",syncCommand,1,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"psync",syncCommand,-3,
+     "admin no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"replconf",replconfCommand,-1,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"flushdb",flushdbCommand,-1,
+     "write @keyspace @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"flushall",flushallCommand,-1,
+     "write @keyspace @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"sort",sortCommand,-2,
+     "write use-memory @list @set @sortedset @dangerous",
+     0,sortGetKeys,1,1,1,0,0,0},
+
+    {"info",infoCommand,-1,
+     "ok-loading ok-stale random @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"monitor",monitorCommand,1,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"ttl",ttlCommand,2,
+     "read-only fast random @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"touch",touchCommand,-2,
+     "read-only fast @keyspace",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"pttl",pttlCommand,2,
+     "read-only fast random @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"persist",persistCommand,2,
+     "write fast @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"slaveof",replicaofCommand,3,
+     "admin no-script ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"replicaof",replicaofCommand,3,
+     "admin no-script ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"role",roleCommand,1,
+     "ok-loading ok-stale no-script fast @dangerous",
+     0,NULL,0,0,0,0,0,0},
+
+    {"debug",debugCommand,-2,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"config",configCommand,-2,
+     "admin ok-loading ok-stale no-script",
+     0,NULL,0,0,0,0,0,0},
+
+    {"subscribe",subscribeCommand,-2,
+     "pub-sub no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"unsubscribe",unsubscribeCommand,-1,
+     "pub-sub no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"psubscribe",psubscribeCommand,-2,
+     "pub-sub no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"punsubscribe",punsubscribeCommand,-1,
+     "pub-sub no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"publish",publishCommand,3,
+     "pub-sub ok-loading ok-stale fast may-replicate",
+     0,NULL,0,0,0,0,0,0},
+
+    {"pubsub",pubsubCommand,-2,
+     "pub-sub ok-loading ok-stale random",
+     0,NULL,0,0,0,0,0,0},
+
+    {"watch",watchCommand,-2,
+     "no-script fast ok-loading ok-stale @transaction",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"unwatch",unwatchCommand,1,
+     "no-script fast ok-loading ok-stale @transaction",
+     0,NULL,0,0,0,0,0,0},
+
+    {"cluster",clusterCommand,-2,
+     "admin ok-stale random",
+     0,NULL,0,0,0,0,0,0},
+
+    {"restore",restoreCommand,-4,
+     "write use-memory @keyspace @dangerous",
+     0,NULL,1,1,1,0,0,0},
+
+    {"restore-asking",restoreCommand,-4,
+    "write use-memory cluster-asking @keyspace @dangerous",
+    0,NULL,1,1,1,0,0,0},
+
+    {"migrate",migrateCommand,-6,
+     "write random @keyspace @dangerous",
+     0,migrateGetKeys,3,3,1,0,0,0},
+
+    {"asking",askingCommand,1,
+     "fast @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"readonly",readonlyCommand,1,
+     "fast @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"readwrite",readwriteCommand,1,
+     "fast @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"dump",dumpCommand,2,
+     "read-only random @keyspace",
+     0,NULL,1,1,1,0,0,0},
+
+    {"object",objectCommand,-2,
+     "read-only random @keyspace",
+     0,NULL,2,2,1,0,0,0},
+
+    {"memory",memoryCommand,-2,
+     "random read-only",
+     0,memoryGetKeys,0,0,0,0,0,0},
+
+    {"client",clientCommand,-2,
+     "admin no-script random ok-loading ok-stale @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    {"hello",helloCommand,-1,
+     "no-auth no-script fast ok-loading ok-stale @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    /* EVAL can modify the dataset, however it is not flagged as a write
+     * command since we do the check while running commands from Lua.
+     * 
+     * EVAL and EVALSHA also feed monitors before the commands are executed,
+     * as opposed to after.
+      */
+    {"eval",evalCommand,-3,
+     "no-script no-monitor may-replicate @scripting",
+     0,evalGetKeys,0,0,0,0,0,0},
+
+    {"evalsha",evalShaCommand,-3,
+     "no-script no-monitor may-replicate @scripting",
+     0,evalGetKeys,0,0,0,0,0,0},
+
+    {"slowlog",slowlogCommand,-2,
+     "admin random ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"script",scriptCommand,-2,
+     "no-script may-replicate @scripting",
+     0,NULL,0,0,0,0,0,0},
+
+    {"time",timeCommand,1,
+     "random fast ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"bitop",bitopCommand,-4,
+     "write use-memory @bitmap",
+     0,NULL,2,-1,1,0,0,0},
+
+    {"bitcount",bitcountCommand,-2,
+     "read-only @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"bitpos",bitposCommand,-3,
+     "read-only @bitmap",
+     0,NULL,1,1,1,0,0,0},
+
+    {"wait",waitCommand,3,
+     "no-script @keyspace",
+     0,NULL,0,0,0,0,0,0},
+
+    {"command",commandCommand,-1,
+     "ok-loading ok-stale random @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    {"geoadd",geoaddCommand,-5,
+     "write use-memory @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    /* GEORADIUS has store options that may write. */
+    {"georadius",georadiusCommand,-6,
+     "write use-memory @geo",
+     0,georadiusGetKeys,1,1,1,0,0,0},
+
+    {"georadius_ro",georadiusroCommand,-6,
+     "read-only @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    {"georadiusbymember",georadiusbymemberCommand,-5,
+     "write use-memory @geo",
+     0,georadiusGetKeys,1,1,1,0,0,0},
+
+    {"georadiusbymember_ro",georadiusbymemberroCommand,-5,
+     "read-only @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    {"geohash",geohashCommand,-2,
+     "read-only @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    {"geopos",geoposCommand,-2,
+     "read-only @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    {"geodist",geodistCommand,-4,
+     "read-only @geo",
+     0,NULL,1,1,1,0,0,0},
+
+    {"geosearch",geosearchCommand,-7,
+     "read-only @geo",
+      0,NULL,1,1,1,0,0,0},
+
+    {"geosearchstore",geosearchstoreCommand,-8,
+     "write use-memory @geo",
+      0,NULL,1,2,1,0,0,0},
+
+    {"pfselftest",pfselftestCommand,1,
+     "admin @hyperloglog",
+      0,NULL,0,0,0,0,0,0},
+
+    {"pfadd",pfaddCommand,-2,
+     "write use-memory fast @hyperloglog",
+     0,NULL,1,1,1,0,0,0},
+
+    /* Technically speaking PFCOUNT may change the key since it changes the
+     * final bytes in the HyperLogLog representation. However in this case
+     * we claim that the representation, even if accessible, is an internal
+     * affair, and the command is semantically read only. */
+    {"pfcount",pfcountCommand,-2,
+     "read-only may-replicate @hyperloglog",
+     0,NULL,1,-1,1,0,0,0},
+
+    {"pfmerge",pfmergeCommand,-2,
+     "write use-memory @hyperloglog",
+     0,NULL,1,-1,1,0,0,0},
+
+    /* Unlike PFCOUNT that is considered as a read-only command (although
+     * it changes a bit), PFDEBUG may change the entire key when converting
+     * from sparse to dense representation */
+    {"pfdebug",pfdebugCommand,-3,
+     "admin write use-memory @hyperloglog",
+     0,NULL,2,2,1,0,0,0},
+
+    {"xadd",xaddCommand,-5,
+     "write use-memory fast random @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xrange",xrangeCommand,-4,
+     "read-only @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xrevrange",xrevrangeCommand,-4,
+     "read-only @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xlen",xlenCommand,2,
+     "read-only fast @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xread",xreadCommand,-4,
+     "read-only @stream @blocking",
+     0,xreadGetKeys,0,0,0,0,0,0},
+
+    {"xreadgroup",xreadCommand,-7,
+     "write @stream @blocking",
+     0,xreadGetKeys,0,0,0,0,0,0},
+
+    {"xgroup",xgroupCommand,-2,
+     "write use-memory @stream",
+     0,NULL,2,2,1,0,0,0},
+
+    {"xsetid",xsetidCommand,3,
+     "write use-memory fast @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xack",xackCommand,-4,
+     "write fast random @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xpending",xpendingCommand,-3,
+     "read-only random @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xclaim",xclaimCommand,-6,
+     "write random fast @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xautoclaim",xautoclaimCommand,-6,
+     "write random fast @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xinfo",xinfoCommand,-2,
+     "read-only random @stream",
+     0,NULL,2,2,1,0,0,0},
+
+    {"xdel",xdelCommand,-3,
+     "write fast @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"xtrim",xtrimCommand,-4,
+     "write random @stream",
+     0,NULL,1,1,1,0,0,0},
+
+    {"post",securityWarningCommand,-1,
+     "ok-loading ok-stale read-only",
+     0,NULL,0,0,0,0,0,0},
+
+    {"host:",securityWarningCommand,-1,
+     "ok-loading ok-stale read-only",
+     0,NULL,0,0,0,0,0,0},
+
+    {"latency",latencyCommand,-2,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"lolwut",lolwutCommand,-1,
+     "read-only fast",
+     0,NULL,0,0,0,0,0,0},
+
+    {"acl",aclCommand,-2,
+     "admin no-script ok-loading ok-stale",
+     0,NULL,0,0,0,0,0,0},
+
+    {"stralgo",stralgoCommand,-2,
+     "read-only @string",
+     0,lcsGetKeys,0,0,0,0,0,0},
+
+    {"reset",resetCommand,1,
+     "no-script ok-stale ok-loading fast @connection",
+     0,NULL,0,0,0,0,0,0},
+
+    {"failover",failoverCommand,-1,
+     "admin no-script ok-stale",
+     0,NULL,0,0,0,0,0,0}
+};
+
+/*============================ Utility functions ============================ */
+
+/* We use a private localtime implementation which is fork-safe. The logging
+ * function of Redis may be called from other threads. */
+void nolocks_localtime(struct tm *tmp, time_t t, time_t tz, int dst);
+
+/* Low level logging. To use only for very big messages, otherwise
+ * serverLog() is to prefer. */
+void serverLogRaw(int level, const char *msg) {
+    const int syslogLevelMap[] = { LOG_DEBUG, LOG_INFO, LOG_NOTICE, LOG_WARNING };
+    const char *c = ".-*#";
+    FILE *fp;
+    char buf[64];
+    int rawmode = (level & LL_RAW);
+    int log_to_stdout = server.logfile[0] == '\0';
+
+    level &= 0xff; /* clear flags */
+    if (level < server.verbosity) return;
+
+    fp = log_to_stdout ? stdout : fopen(server.logfile,"a");
+    if (!fp) return;
+
+    if (rawmode) {
+        fprintf(fp,"%s",msg);
+    } else {
+        int off;
+        struct timeval tv;
+        int role_char;
+        pid_t pid = getpid();
+
+        gettimeofday(&tv,NULL);
+        struct tm tm;
+        nolocks_localtime(&tm,tv.tv_sec,server.timezone,server.daylight_active);
+        off = strftime(buf,sizeof(buf),"%d %b %Y %H:%M:%S.",&tm);
+        snprintf(buf+off,sizeof(buf)-off,"%03d",(int)tv.tv_usec/1000);
+        if (server.sentinel_mode) {
+            role_char = 'X'; /* Sentinel. */
+        } else if (pid != server.pid) {
+            role_char = 'C'; /* RDB / AOF writing child. */
+        } else {
+            role_char = (server.masterhost ? 'S':'M'); /* Slave or Master. */
+        }
+        fprintf(fp,"%d:%c %s %c %s\n",
+            (int)getpid(),role_char, buf,c[level],msg);
+    }
+    fflush(fp);
+
+    if (!log_to_stdout) fclose(fp);
+    if (server.syslog_enabled) syslog(syslogLevelMap[level], "%s", msg);
+}
+
+/* Like serverLogRaw() but with printf-alike support. This is the function that
+ * is used across the code. The raw version is only used in order to dump
+ * the INFO output on crash. */
+void _serverLog(int level, const char *fmt, ...) {
+    va_list ap;
+    char msg[LOG_MAX_LEN];
+
+    va_start(ap, fmt);
+    vsnprintf(msg, sizeof(msg), fmt, ap);
+    va_end(ap);
+
+    serverLogRaw(level,msg);
+}
+
+/* Log a fixed message without printf-alike capabilities, in a way that is
+ * safe to call from a signal handler.
+ *
+ * We actually use this only for signals that are not fatal from the point
+ * of view of Redis. Signals that are going to kill the server anyway and
+ * where we need printf-alike features are served by serverLog(). */
+void serverLogFromHandler(int level, const char *msg) {
+    int fd;
+    int log_to_stdout = server.logfile[0] == '\0';
+    char buf[64];
+
+    if ((level&0xff) < server.verbosity || (log_to_stdout && server.daemonize))
+        return;
+    fd = log_to_stdout ? STDOUT_FILENO :
+                         open(server.logfile, O_APPEND|O_CREAT|O_WRONLY, 0644);
+    if (fd == -1) return;
+    ll2string(buf,sizeof(buf),getpid());
+    if (write(fd,buf,strlen(buf)) == -1) goto err;
+    if (write(fd,":signal-handler (",17) == -1) goto err;
+    ll2string(buf,sizeof(buf),time(NULL));
+    if (write(fd,buf,strlen(buf)) == -1) goto err;
+    if (write(fd,") ",2) == -1) goto err;
+    if (write(fd,msg,strlen(msg)) == -1) goto err;
+    if (write(fd,"\n",1) == -1) goto err;
+err:
+    if (!log_to_stdout) close(fd);
+}
+
+/* Return the UNIX time in microseconds */
+long long ustime(void) {
+    struct timeval tv;
+    long long ust;
+
+    gettimeofday(&tv, NULL);
+    ust = ((long long)tv.tv_sec)*1000000;
+    ust += tv.tv_usec;
+    return ust;
+}
+
+/* Return the UNIX time in milliseconds */
+mstime_t mstime(void) {
+    return ustime()/1000;
+}
+
+/* After an RDB dump or AOF rewrite we exit from children using _exit() instead of
+ * exit(), because the latter may interact with the same file objects used by
+ * the parent process. However if we are testing the coverage normal exit() is
+ * used in order to obtain the right coverage information. */
+void exitFromChild(int retcode) {
+#ifdef COVERAGE_TEST
+    exit(retcode);
+#else
+    _exit(retcode);
+#endif
+}
+
+/*====================== Hash table type implementation  ==================== */
+
+/* This is a hash table type that uses the SDS dynamic strings library as
+ * keys and redis objects as values (objects can hold SDS strings,
+ * lists, sets). */
+
+void dictVanillaFree(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+    zfree(val);
+}
+
+void dictListDestructor(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+    listRelease((list*)val);
+}
+
+int dictSdsKeyCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    int l1,l2;
+    DICT_NOTUSED(privdata);
+
+    l1 = sdslen((sds)key1);
+    l2 = sdslen((sds)key2);
+    if (l1 != l2) return 0;
+    return memcmp(key1, key2, l1) == 0;
+}
+
+/* A case insensitive version used for the command lookup table and other
+ * places where case insensitive non binary-safe comparison is needed. */
+int dictSdsKeyCaseCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    DICT_NOTUSED(privdata);
+
+    return strcasecmp(key1, key2) == 0;
+}
+
+void dictObjectDestructor(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+
+    if (val == NULL) return; /* Lazy freeing will set value to NULL. */
+    decrRefCount(val);
+}
+
+void dictSdsDestructor(void *privdata, void *val)
+{
+    DICT_NOTUSED(privdata);
+
+    sdsfree(val);
+}
+
+int dictObjKeyCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    const robj *o1 = key1, *o2 = key2;
+    return dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);
+}
+
+uint64_t dictObjHash(const void *key) {
+    const robj *o = key;
+    return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
+}
+
+uint64_t dictSdsHash(const void *key) {
+    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
+}
+
+uint64_t dictSdsCaseHash(const void *key) {
+    return dictGenCaseHashFunction((unsigned char*)key, sdslen((char*)key));
+}
+
+int dictEncObjKeyCompare(void *privdata, const void *key1,
+        const void *key2)
+{
+    robj *o1 = (robj*) key1, *o2 = (robj*) key2;
+    int cmp;
+
+    if (o1->encoding == OBJ_ENCODING_INT &&
+        o2->encoding == OBJ_ENCODING_INT)
+            return o1->ptr == o2->ptr;
+
+    /* Due to OBJ_STATIC_REFCOUNT, we avoid calling getDecodedObject() without
+     * good reasons, because it would incrRefCount() the object, which
+     * is invalid. So we check to make sure dictFind() works with static
+     * objects as well. */
+    if (o1->refcount != OBJ_STATIC_REFCOUNT) o1 = getDecodedObject(o1);
+    if (o2->refcount != OBJ_STATIC_REFCOUNT) o2 = getDecodedObject(o2);
+    cmp = dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);
+    if (o1->refcount != OBJ_STATIC_REFCOUNT) decrRefCount(o1);
+    if (o2->refcount != OBJ_STATIC_REFCOUNT) decrRefCount(o2);
+    return cmp;
+}
+
+uint64_t dictEncObjHash(const void *key) {
+    robj *o = (robj*) key;
+
+    if (sdsEncodedObject(o)) {
+        return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
+    } else if (o->encoding == OBJ_ENCODING_INT) {
+        char buf[32];
+        int len;
+
+        len = ll2string(buf,32,(long)o->ptr);
+        return dictGenHashFunction((unsigned char*)buf, len);
+    } else {
+        serverPanic("Unknown string encoding");
+    }
+}
+
+/* Return 1 if currently we allow dict to expand. Dict may allocate huge
+ * memory to contain hash buckets when dict expands, that may lead redis
+ * rejects user's requests or evicts some keys, we can stop dict to expand
+ * provisionally if used memory will be over maxmemory after dict expands,
+ * but to guarantee the performance of redis, we still allow dict to expand
+ * if dict load factor exceeds HASHTABLE_MAX_LOAD_FACTOR. */
+int dictExpandAllowed(size_t moreMem, double usedRatio) {
+    if (usedRatio <= HASHTABLE_MAX_LOAD_FACTOR) {
+        return !overMaxmemoryAfterAlloc(moreMem);
+    } else {
+        return 1;
+    }
+}
+
+/* Generic hash table type where keys are Redis Objects, Values
+ * dummy pointers. */
+dictType objectKeyPointerValueDictType = {
+    dictEncObjHash,            /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictEncObjKeyCompare,      /* key compare */
+    dictObjectDestructor,      /* key destructor */
+    NULL,                      /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* Like objectKeyPointerValueDictType(), but values can be destroyed, if
+ * not NULL, calling zfree(). */
+dictType objectKeyHeapPointerValueDictType = {
+    dictEncObjHash,            /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictEncObjKeyCompare,      /* key compare */
+    dictObjectDestructor,      /* key destructor */
+    dictVanillaFree,           /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* Set dictionary type. Keys are SDS strings, values are not used. */
+dictType setDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    dictSdsDestructor,         /* key destructor */
+    NULL                       /* val destructor */
+};
+
+/* Sorted sets hash (note: a skiplist is used in addition to the hash table) */
+dictType zsetDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* Note: SDS string shared & freed by skiplist */
+    NULL,                      /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* Db->dict, keys are sds strings, vals are Redis objects. */
+dictType dbDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    dictObjectDestructor,       /* val destructor */
+    dictExpandAllowed           /* allow to expand */
+};
+
+/* server.lua_scripts sha (as sds string) -> scripts (as robj) cache. */
+dictType shaScriptObjectDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    dictObjectDestructor,       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Db->expires */
+dictType dbExpiresDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    NULL,                       /* key destructor */
+    NULL,                       /* val destructor */
+    dictExpandAllowed           /* allow to expand */
+};
+
+/* Command table. sds string -> command struct pointer. */
+dictType commandTableDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Hash type hash table (note that small hashes are represented with ziplists) */
+dictType hashDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    dictSdsDestructor,          /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Dict type without destructor */
+dictType sdsReplyDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    NULL,                       /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Keylist hash table type has unencoded redis objects as keys and
+ * lists as values. It's used for blocking operations (BLPOP) and to
+ * map swapped keys to a list of clients waiting for this keys to be loaded. */
+dictType keylistDictType = {
+    dictObjHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictObjKeyCompare,          /* key compare */
+    dictObjectDestructor,       /* key destructor */
+    dictListDestructor,         /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Cluster nodes hash table, mapping nodes addresses 1.2.3.4:6379 to
+ * clusterNode structures. */
+dictType clusterNodesDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Cluster re-addition blacklist. This maps node IDs to the time
+ * we can re-add this node. The goal is to avoid readding a removed
+ * node for some time. */
+dictType clusterNodesBlackListDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Modules system dictionary type. Keys are module name,
+ * values are pointer to RedisModule struct. */
+dictType modulesDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Migrate cache dict type. */
+dictType migrateCacheDictType = {
+    dictSdsHash,                /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCompare,          /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+/* Replication cached script dict (server.repl_scriptcache_dict).
+ * Keys are sds SHA1 strings, while values are not used at all in the current
+ * implementation. */
+dictType replScriptCacheDictType = {
+    dictSdsCaseHash,            /* hash function */
+    NULL,                       /* key dup */
+    NULL,                       /* val dup */
+    dictSdsKeyCaseCompare,      /* key compare */
+    dictSdsDestructor,          /* key destructor */
+    NULL,                       /* val destructor */
+    NULL                        /* allow to expand */
+};
+
+int htNeedsResize(dict *dict) {
+    long long size, used;
+
+    size = dictSlots(dict);
+    used = dictSize(dict);
+    return (size > DICT_HT_INITIAL_SIZE &&
+            (used*100/size < HASHTABLE_MIN_FILL));
+}
+
+/* If the percentage of used slots in the HT reaches HASHTABLE_MIN_FILL
+ * we resize the hash table to save memory */
+void tryResizeHashTables(int dbid) {
+    if (htNeedsResize(server.db[dbid].dict))
+        dictResize(server.db[dbid].dict);
+    if (htNeedsResize(server.db[dbid].expires))
+        dictResize(server.db[dbid].expires);
+}
+
+/* Our hash table implementation performs rehashing incrementally while
+ * we write/read from the hash table. Still if the server is idle, the hash
+ * table will use two tables for a long time. So we try to use 1 millisecond
+ * of CPU time at every call of this function to perform some rehashing.
+ *
+ * The function returns 1 if some rehashing was performed, otherwise 0
+ * is returned. */
+int incrementallyRehash(int dbid) {
+    /* Keys dictionary */
+    if (dictIsRehashing(server.db[dbid].dict)) {
+        dictRehashMilliseconds(server.db[dbid].dict,1);
+        return 1; /* already used our millisecond for this loop... */
+    }
+    /* Expires */
+    if (dictIsRehashing(server.db[dbid].expires)) {
+        dictRehashMilliseconds(server.db[dbid].expires,1);
+        return 1; /* already used our millisecond for this loop... */
+    }
+    return 0;
+}
+
+/* This function is called once a background process of some kind terminates,
+ * as we want to avoid resizing the hash tables when there is a child in order
+ * to play well with copy-on-write (otherwise when a resize happens lots of
+ * memory pages are copied). The goal of this function is to update the ability
+ * for dict.c to resize the hash tables accordingly to the fact we have an
+ * active fork child running. */
+void updateDictResizePolicy(void) {
+    if (!hasActiveChildProcess())
+        dictEnableResize();
+    else
+        dictDisableResize();
+}
+
+const char *strChildType(int type) {
+    switch(type) {
+        case CHILD_TYPE_RDB: return "RDB";
+        case CHILD_TYPE_AOF: return "AOF";
+        case CHILD_TYPE_LDB: return "LDB";
+        case CHILD_TYPE_MODULE: return "MODULE";
+        default: return "Unknown";
+    }
+}
+
+/* Return true if there are active children processes doing RDB saving,
+ * AOF rewriting, or some side process spawned by a loaded module. */
+int hasActiveChildProcess() {
+    return server.child_pid != -1;
+}
+
+void resetChildState() {
+    server.child_type = CHILD_TYPE_NONE;
+    server.child_pid = -1;
+    server.stat_current_cow_bytes = 0;
+    server.stat_current_cow_updated = 0;
+    server.stat_current_save_keys_processed = 0;
+    server.stat_module_progress = 0;
+    server.stat_current_save_keys_total = 0;
+    updateDictResizePolicy();
+    closeChildInfoPipe();
+    moduleFireServerEvent(REDISMODULE_EVENT_FORK_CHILD,
+                          REDISMODULE_SUBEVENT_FORK_CHILD_DIED,
+                          NULL);
+}
+
+/* Return if child type is mutual exclusive with other fork children */
+int isMutuallyExclusiveChildType(int type) {
+    return type == CHILD_TYPE_RDB || type == CHILD_TYPE_AOF || type == CHILD_TYPE_MODULE;
+}
+
+/* Return true if this instance has persistence completely turned off:
+ * both RDB and AOF are disabled. */
+int allPersistenceDisabled(void) {
+    return server.saveparamslen == 0 && server.aof_state == AOF_OFF;
+}
+
+/* ======================= Cron: called every 100 ms ======================== */
+
+/* Add a sample to the operations per second array of samples. */
+void trackInstantaneousMetric(int metric, long long current_reading) {
+    long long now = mstime();
+    long long t = now - server.inst_metric[metric].last_sample_time;
+    long long ops = current_reading -
+                    server.inst_metric[metric].last_sample_count;
+    long long ops_sec;
+
+    ops_sec = t > 0 ? (ops*1000/t) : 0;
+
+    server.inst_metric[metric].samples[server.inst_metric[metric].idx] =
+        ops_sec;
+    server.inst_metric[metric].idx++;
+    server.inst_metric[metric].idx %= STATS_METRIC_SAMPLES;
+    server.inst_metric[metric].last_sample_time = now;
+    server.inst_metric[metric].last_sample_count = current_reading;
+}
+
+/* Return the mean of all the samples. */
+long long getInstantaneousMetric(int metric) {
+    int j;
+    long long sum = 0;
+
+    for (j = 0; j < STATS_METRIC_SAMPLES; j++)
+        sum += server.inst_metric[metric].samples[j];
+    return sum / STATS_METRIC_SAMPLES;
+}
+
+/* The client query buffer is an sds.c string that can end with a lot of
+ * free space not used, this function reclaims space if needed.
+ *
+ * The function always returns 0 as it never terminates the client. */
+int clientsCronResizeQueryBuffer(client *c) {
+    size_t querybuf_size = sdsAllocSize(c->querybuf);
+    time_t idletime = server.unixtime - c->lastinteraction;
+
+    /* There are two conditions to resize the query buffer:
+     * 1) Query buffer is > BIG_ARG and too big for latest peak.
+     * 2) Query buffer is > BIG_ARG and client is idle. */
+    if (querybuf_size > PROTO_MBULK_BIG_ARG &&
+         ((querybuf_size/(c->querybuf_peak+1)) > 2 ||
+          idletime > 2))
+    {
+        /* Only resize the query buffer if it is actually wasting
+         * at least a few kbytes. */
+        if (sdsavail(c->querybuf) > 1024*4) {
+            c->querybuf = sdsRemoveFreeSpace(c->querybuf);
+        }
+    }
+    /* Reset the peak again to capture the peak memory usage in the next
+     * cycle. */
+    c->querybuf_peak = 0;
+
+    /* Clients representing masters also use a "pending query buffer" that
+     * is the yet not applied part of the stream we are reading. Such buffer
+     * also needs resizing from time to time, otherwise after a very large
+     * transfer (a huge value or a big MIGRATE operation) it will keep using
+     * a lot of memory. */
+    if (c->flags & CLIENT_MASTER) {
+        /* There are two conditions to resize the pending query buffer:
+         * 1) Pending Query buffer is > LIMIT_PENDING_QUERYBUF.
+         * 2) Used length is smaller than pending_querybuf_size/2 */
+        size_t pending_querybuf_size = sdsAllocSize(c->pending_querybuf);
+        if(pending_querybuf_size > LIMIT_PENDING_QUERYBUF &&
+           sdslen(c->pending_querybuf) < (pending_querybuf_size/2))
+        {
+            c->pending_querybuf = sdsRemoveFreeSpace(c->pending_querybuf);
+        }
+    }
+    return 0;
+}
+
+/* This function is used in order to track clients using the biggest amount
+ * of memory in the latest few seconds. This way we can provide such information
+ * in the INFO output (clients section), without having to do an O(N) scan for
+ * all the clients.
+ *
+ * This is how it works. We have an array of CLIENTS_PEAK_MEM_USAGE_SLOTS slots
+ * where we track, for each, the biggest client output and input buffers we
+ * saw in that slot. Every slot correspond to one of the latest seconds, since
+ * the array is indexed by doing UNIXTIME % CLIENTS_PEAK_MEM_USAGE_SLOTS.
+ *
+ * When we want to know what was recently the peak memory usage, we just scan
+ * such few slots searching for the maximum value. */
+#define CLIENTS_PEAK_MEM_USAGE_SLOTS 8
+size_t ClientsPeakMemInput[CLIENTS_PEAK_MEM_USAGE_SLOTS] = {0};
+size_t ClientsPeakMemOutput[CLIENTS_PEAK_MEM_USAGE_SLOTS] = {0};
+
+int clientsCronTrackExpansiveClients(client *c, int time_idx) {
+    size_t in_usage = sdsZmallocSize(c->querybuf) + c->argv_len_sum +
+	              (c->argv ? zmalloc_size(c->argv) : 0);
+    size_t out_usage = getClientOutputBufferMemoryUsage(c);
+
+    /* Track the biggest values observed so far in this slot. */
+    if (in_usage > ClientsPeakMemInput[time_idx]) ClientsPeakMemInput[time_idx] = in_usage;
+    if (out_usage > ClientsPeakMemOutput[time_idx]) ClientsPeakMemOutput[time_idx] = out_usage;
+
+    return 0; /* This function never terminates the client. */
+}
+
+/* Iterating all the clients in getMemoryOverheadData() is too slow and
+ * in turn would make the INFO command too slow. So we perform this
+ * computation incrementally and track the (not instantaneous but updated
+ * to the second) total memory used by clients using clinetsCron() in
+ * a more incremental way (depending on server.hz). */
+int clientsCronTrackClientsMemUsage(client *c) {
+    size_t mem = 0;
+    int type = getClientType(c);
+    mem += getClientOutputBufferMemoryUsage(c);
+    mem += sdsZmallocSize(c->querybuf);
+    mem += zmalloc_size(c);
+    mem += c->argv_len_sum;
+    if (c->argv) mem += zmalloc_size(c->argv);
+    /* Now that we have the memory used by the client, remove the old
+     * value from the old category, and add it back. */
+    server.stat_clients_type_memory[c->client_cron_last_memory_type] -=
+        c->client_cron_last_memory_usage;
+    server.stat_clients_type_memory[type] += mem;
+    /* Remember what we added and where, to remove it next time. */
+    c->client_cron_last_memory_usage = mem;
+    c->client_cron_last_memory_type = type;
+    return 0;
+}
+
+/* Return the max samples in the memory usage of clients tracked by
+ * the function clientsCronTrackExpansiveClients(). */
+void getExpansiveClientsInfo(size_t *in_usage, size_t *out_usage) {
+    size_t i = 0, o = 0;
+    for (int j = 0; j < CLIENTS_PEAK_MEM_USAGE_SLOTS; j++) {
+        if (ClientsPeakMemInput[j] > i) i = ClientsPeakMemInput[j];
+        if (ClientsPeakMemOutput[j] > o) o = ClientsPeakMemOutput[j];
+    }
+    *in_usage = i;
+    *out_usage = o;
+}
+
+/* This function is called by serverCron() and is used in order to perform
+ * operations on clients that are important to perform constantly. For instance
+ * we use this function in order to disconnect clients after a timeout, including
+ * clients blocked in some blocking command with a non-zero timeout.
+ *
+ * The function makes some effort to process all the clients every second, even
+ * if this cannot be strictly guaranteed, since serverCron() may be called with
+ * an actual frequency lower than server.hz in case of latency events like slow
+ * commands.
+ *
+ * It is very important for this function, and the functions it calls, to be
+ * very fast: sometimes Redis has tens of hundreds of connected clients, and the
+ * default server.hz value is 10, so sometimes here we need to process thousands
+ * of clients per second, turning this function into a source of latency.
+ */
+#define CLIENTS_CRON_MIN_ITERATIONS 5
+void clientsCron(void) {
+    /* Try to process at least numclients/server.hz of clients
+     * per call. Since normally (if there are no big latency events) this
+     * function is called server.hz times per second, in the average case we
+     * process all the clients in 1 second. */
+    int numclients = listLength(server.clients);
+    int iterations = numclients/server.hz;
+    mstime_t now = mstime();
+
+    /* Process at least a few clients while we are at it, even if we need
+     * to process less than CLIENTS_CRON_MIN_ITERATIONS to meet our contract
+     * of processing each client once per second. */
+    if (iterations < CLIENTS_CRON_MIN_ITERATIONS)
+        iterations = (numclients < CLIENTS_CRON_MIN_ITERATIONS) ?
+                     numclients : CLIENTS_CRON_MIN_ITERATIONS;
+
+
+    int curr_peak_mem_usage_slot = server.unixtime % CLIENTS_PEAK_MEM_USAGE_SLOTS;
+    /* Always zero the next sample, so that when we switch to that second, we'll
+     * only register samples that are greater in that second without considering
+     * the history of such slot.
+     *
+     * Note: our index may jump to any random position if serverCron() is not
+     * called for some reason with the normal frequency, for instance because
+     * some slow command is called taking multiple seconds to execute. In that
+     * case our array may end containing data which is potentially older
+     * than CLIENTS_PEAK_MEM_USAGE_SLOTS seconds: however this is not a problem
+     * since here we want just to track if "recently" there were very expansive
+     * clients from the POV of memory usage. */
+    int zeroidx = (curr_peak_mem_usage_slot+1) % CLIENTS_PEAK_MEM_USAGE_SLOTS;
+    ClientsPeakMemInput[zeroidx] = 0;
+    ClientsPeakMemOutput[zeroidx] = 0;
+
+
+    while(listLength(server.clients) && iterations--) {
+        client *c;
+        listNode *head;
+
+        /* Rotate the list, take the current head, process.
+         * This way if the client must be removed from the list it's the
+         * first element and we don't incur into O(N) computation. */
+        listRotateTailToHead(server.clients);
+        head = listFirst(server.clients);
+        c = listNodeValue(head);
+        /* The following functions do different service checks on the client.
+         * The protocol is that they return non-zero if the client was
+         * terminated. */
+        if (clientsCronHandleTimeout(c,now)) continue;
+        if (clientsCronResizeQueryBuffer(c)) continue;
+        if (clientsCronTrackExpansiveClients(c, curr_peak_mem_usage_slot)) continue;
+        if (clientsCronTrackClientsMemUsage(c)) continue;
+        if (closeClientOnOutputBufferLimitReached(c, 0)) continue;
+    }
+}
+
+/* This function handles 'background' operations we are required to do
+ * incrementally in Redis databases, such as active key expiring, resizing,
+ * rehashing. */
+void databasesCron(void) {
+    /* Expire keys by random sampling. Not required for slaves
+     * as master will synthesize DELs for us. */
+    if (server.active_expire_enabled) {
+        if (iAmMaster()) {
+            activeExpireCycle(ACTIVE_EXPIRE_CYCLE_SLOW);
+        } else {
+            expireSlaveKeys();
+        }
+    }
+
+    /* Defrag keys gradually. */
+    activeDefragCycle();
+
+    /* Perform hash tables rehashing if needed, but only if there are no
+     * other processes saving the DB on disk. Otherwise rehashing is bad
+     * as will cause a lot of copy-on-write of memory pages. */
+    if (!hasActiveChildProcess()) {
+        /* We use global counters so if we stop the computation at a given
+         * DB we'll be able to start from the successive in the next
+         * cron loop iteration. */
+        static unsigned int resize_db = 0;
+        static unsigned int rehash_db = 0;
+        int dbs_per_call = CRON_DBS_PER_CALL;
+        int j;
+
+        /* Don't test more DBs than we have. */
+        if (dbs_per_call > server.dbnum) dbs_per_call = server.dbnum;
+
+        /* Resize */
+        for (j = 0; j < dbs_per_call; j++) {
+            tryResizeHashTables(resize_db % server.dbnum);
+            resize_db++;
+        }
+
+        /* Rehash */
+        if (server.activerehashing) {
+            for (j = 0; j < dbs_per_call; j++) {
+                int work_done = incrementallyRehash(rehash_db);
+                if (work_done) {
+                    /* If the function did some work, stop here, we'll do
+                     * more at the next cron loop. */
+                    break;
+                } else {
+                    /* If this db didn't need rehash, we'll try the next one. */
+                    rehash_db++;
+                    rehash_db %= server.dbnum;
+                }
+            }
+        }
+    }
+}
+
+/* We take a cached value of the unix time in the global state because with
+ * virtual memory and aging there is to store the current time in objects at
+ * every object access, and accuracy is not needed. To access a global var is
+ * a lot faster than calling time(NULL).
+ *
+ * This function should be fast because it is called at every command execution
+ * in call(), so it is possible to decide if to update the daylight saving
+ * info or not using the 'update_daylight_info' argument. Normally we update
+ * such info only when calling this function from serverCron() but not when
+ * calling it from call(). */
+void updateCachedTime(int update_daylight_info) {
+    server.ustime = ustime();
+    server.mstime = server.ustime / 1000;
+    time_t unixtime = server.mstime / 1000;
+    atomicSet(server.unixtime, unixtime);
+
+    /* To get information about daylight saving time, we need to call
+     * localtime_r and cache the result. However calling localtime_r in this
+     * context is safe since we will never fork() while here, in the main
+     * thread. The logging function will call a thread safe version of
+     * localtime that has no locks. */
+    if (update_daylight_info) {
+        struct tm tm;
+        time_t ut = server.unixtime;
+        localtime_r(&ut,&tm);
+        server.daylight_active = tm.tm_isdst;
+    }
+}
+
+void checkChildrenDone(void) {
+    int statloc = 0;
+    pid_t pid;
+
+    if ((pid = waitpid(-1, &statloc, WNOHANG)) != 0) {
+        int exitcode = WIFEXITED(statloc) ? WEXITSTATUS(statloc) : -1;
+        int bysignal = 0;
+
+        if (WIFSIGNALED(statloc)) bysignal = WTERMSIG(statloc);
+
+        /* sigKillChildHandler catches the signal and calls exit(), but we
+         * must make sure not to flag lastbgsave_status, etc incorrectly.
+         * We could directly terminate the child process via SIGUSR1
+         * without handling it */
+        if (exitcode == SERVER_CHILD_NOERROR_RETVAL) {
+            bysignal = SIGUSR1;
+            exitcode = 1;
+        }
+
+        if (pid == -1) {
+            serverLog(LL_WARNING,"waitpid() returned an error: %s. "
+                "child_type: %s, child_pid = %d",
+                strerror(errno),
+                strChildType(server.child_type),
+                (int) server.child_pid);
+        } else if (pid == server.child_pid) {
+            if (server.child_type == CHILD_TYPE_RDB) {
+                backgroundSaveDoneHandler(exitcode, bysignal);
+            } else if (server.child_type == CHILD_TYPE_AOF) {
+                backgroundRewriteDoneHandler(exitcode, bysignal);
+            } else if (server.child_type == CHILD_TYPE_MODULE) {
+                ModuleForkDoneHandler(exitcode, bysignal);
+            } else {
+                serverPanic("Unknown child type %d for child pid %d", server.child_type, server.child_pid);
+                exit(1);
+            }
+            if (!bysignal && exitcode == 0) receiveChildInfo();
+            resetChildState();
+        } else {
+            if (!ldbRemoveChild(pid)) {
+                serverLog(LL_WARNING,
+                          "Warning, detected child with unmatched pid: %ld",
+                          (long) pid);
+            }
+        }
+
+        /* start any pending forks immediately. */
+        replicationStartPendingFork();
+    }
+}
+
+/* Called from serverCron and loadingCron to update cached memory metrics. */
+void cronUpdateMemoryStats() {
+    /* Record the max memory used since the server was started. */
+    if (zmalloc_used_memory() > server.stat_peak_memory)
+        server.stat_peak_memory = zmalloc_used_memory();
+
+    run_with_period(100) {
+        /* Sample the RSS and other metrics here since this is a relatively slow call.
+         * We must sample the zmalloc_used at the same time we take the rss, otherwise
+         * the frag ratio calculate may be off (ratio of two samples at different times) */
+        server.cron_malloc_stats.process_rss = zmalloc_get_rss();
+        server.cron_malloc_stats.zmalloc_used = zmalloc_used_memory();
+        /* Sampling the allocator info can be slow too.
+         * The fragmentation ratio it'll show is potentially more accurate
+         * it excludes other RSS pages such as: shared libraries, LUA and other non-zmalloc
+         * allocations, and allocator reserved pages that can be pursed (all not actual frag) */
+        zmalloc_get_allocator_info(&server.cron_malloc_stats.allocator_allocated,
+                                   &server.cron_malloc_stats.allocator_active,
+                                   &server.cron_malloc_stats.allocator_resident);
+        /* in case the allocator isn't providing these stats, fake them so that
+         * fragmentation info still shows some (inaccurate metrics) */
+        if (!server.cron_malloc_stats.allocator_resident) {
+            /* LUA memory isn't part of zmalloc_used, but it is part of the process RSS,
+             * so we must deduct it in order to be able to calculate correct
+             * "allocator fragmentation" ratio */
+            size_t lua_memory = lua_gc(server.lua,LUA_GCCOUNT,0)*1024LL;
+            server.cron_malloc_stats.allocator_resident = server.cron_malloc_stats.process_rss - lua_memory;
+        }
+        if (!server.cron_malloc_stats.allocator_active)
+            server.cron_malloc_stats.allocator_active = server.cron_malloc_stats.allocator_resident;
+        if (!server.cron_malloc_stats.allocator_allocated)
+            server.cron_malloc_stats.allocator_allocated = server.cron_malloc_stats.zmalloc_used;
+    }
+}
+
+/* This is our timer interrupt, called server.hz times per second.
+ * Here is where we do a number of things that need to be done asynchronously.
+ * For instance:
+ *
+ * - Active expired keys collection (it is also performed in a lazy way on
+ *   lookup).
+ * - Software watchdog.
+ * - Update some statistic.
+ * - Incremental rehashing of the DBs hash tables.
+ * - Triggering BGSAVE / AOF rewrite, and handling of terminated children.
+ * - Clients timeout of different kinds.
+ * - Replication reconnection.
+ * - Many more...
+ *
+ * Everything directly called here will be called server.hz times per second,
+ * so in order to throttle execution of things we want to do less frequently
+ * a macro is used: run_with_period(milliseconds) { .... }
+ */
+
+int serverCron(struct aeEventLoop *eventLoop, long long id, void *clientData) {
+    int j;
+    UNUSED(eventLoop);
+    UNUSED(id);
+    UNUSED(clientData);
+
+    /* Software watchdog: deliver the SIGALRM that will reach the signal
+     * handler if we don't return here fast enough. */
+    if (server.watchdog_period) watchdogScheduleSignal(server.watchdog_period);
+
+    /* Update the time cache. */
+    updateCachedTime(1);
+
+    server.hz = server.config_hz;
+    /* Adapt the server.hz value to the number of configured clients. If we have
+     * many clients, we want to call serverCron() with an higher frequency. */
+    if (server.dynamic_hz) {
+        while (listLength(server.clients) / server.hz >
+               MAX_CLIENTS_PER_CLOCK_TICK)
+        {
+            server.hz *= 2;
+            if (server.hz > CONFIG_MAX_HZ) {
+                server.hz = CONFIG_MAX_HZ;
+                break;
+            }
+        }
+    }
+
+    run_with_period(100) {
+        long long stat_net_input_bytes, stat_net_output_bytes;
+        atomicGet(server.stat_net_input_bytes, stat_net_input_bytes);
+        atomicGet(server.stat_net_output_bytes, stat_net_output_bytes);
+
+        trackInstantaneousMetric(STATS_METRIC_COMMAND,server.stat_numcommands);
+        trackInstantaneousMetric(STATS_METRIC_NET_INPUT,
+                stat_net_input_bytes);
+        trackInstantaneousMetric(STATS_METRIC_NET_OUTPUT,
+                stat_net_output_bytes);
+    }
+
+    /* We have just LRU_BITS bits per object for LRU information.
+     * So we use an (eventually wrapping) LRU clock.
+     *
+     * Note that even if the counter wraps it's not a big problem,
+     * everything will still work but some object will appear younger
+     * to Redis. However for this to happen a given object should never be
+     * touched for all the time needed to the counter to wrap, which is
+     * not likely.
+     *
+     * Note that you can change the resolution altering the
+     * LRU_CLOCK_RESOLUTION define. */
+    unsigned int lruclock = getLRUClock();
+    atomicSet(server.lruclock,lruclock);
+
+    cronUpdateMemoryStats();
+
+    /* We received a SIGTERM, shutting down here in a safe way, as it is
+     * not ok doing so inside the signal handler. */
+    if (server.shutdown_asap) {
+        if (prepareForShutdown(SHUTDOWN_NOFLAGS) == C_OK) exit(0);
+        serverLog(LL_WARNING,"SIGTERM received but errors trying to shut down the server, check the logs for more information");
+        server.shutdown_asap = 0;
+    }
+
+    /* Show some info about non-empty databases */
+    if (server.verbosity <= LL_VERBOSE) {
+        run_with_period(5000) {
+            for (j = 0; j < server.dbnum; j++) {
+                long long size, used, vkeys;
+
+                size = dictSlots(server.db[j].dict);
+                used = dictSize(server.db[j].dict);
+                vkeys = dictSize(server.db[j].expires);
+                if (used || vkeys) {
+                    serverLog(LL_VERBOSE,"DB %d: %lld keys (%lld volatile) in %lld slots HT.",j,used,vkeys,size);
+                }
+            }
+        }
+    }
+
+    /* Show information about connected clients */
+    if (!server.sentinel_mode) {
+        run_with_period(5000) {
+            serverLog(LL_DEBUG,
+                "%lu clients connected (%lu replicas), %zu bytes in use",
+                listLength(server.clients)-listLength(server.slaves),
+                listLength(server.slaves),
+                zmalloc_used_memory());
+        }
+    }
+
+    /* We need to do a few operations on clients asynchronously. */
+    clientsCron();
+
+    /* Handle background operations on Redis databases. */
+    databasesCron();
+
+    /* Start a scheduled AOF rewrite if this was requested by the user while
+     * a BGSAVE was in progress. */
+    if (!hasActiveChildProcess() &&
+        server.aof_rewrite_scheduled)
+    {
+        rewriteAppendOnlyFileBackground();
+    }
+
+    /* Check if a background saving or AOF rewrite in progress terminated. */
+    if (hasActiveChildProcess() || ldbPendingChildren())
+    {
+        run_with_period(1000) receiveChildInfo();
+        checkChildrenDone();
+    } else {
+        /* If there is not a background saving/rewrite in progress check if
+         * we have to save/rewrite now. */
+        for (j = 0; j < server.saveparamslen; j++) {
+            struct saveparam *sp = server.saveparams+j;
+
+            /* Save if we reached the given amount of changes,
+             * the given amount of seconds, and if the latest bgsave was
+             * successful or if, in case of an error, at least
+             * CONFIG_BGSAVE_RETRY_DELAY seconds already elapsed. */
+            if (server.dirty >= sp->changes &&
+                server.unixtime-server.lastsave > sp->seconds &&
+                (server.unixtime-server.lastbgsave_try >
+                 CONFIG_BGSAVE_RETRY_DELAY ||
+                 server.lastbgsave_status == C_OK))
+            {
+                serverLog(LL_NOTICE,"%d changes in %d seconds. Saving...",
+                    sp->changes, (int)sp->seconds);
+                rdbSaveInfo rsi, *rsiptr;
+                rsiptr = rdbPopulateSaveInfo(&rsi);
+                rdbSaveBackground(server.rdb_filename,rsiptr);
+                break;
+            }
+        }
+
+        /* Trigger an AOF rewrite if needed. */
+        if (server.aof_state == AOF_ON &&
+            !hasActiveChildProcess() &&
+            server.aof_rewrite_perc &&
+            server.aof_current_size > server.aof_rewrite_min_size)
+        {
+            long long base = server.aof_rewrite_base_size ?
+                server.aof_rewrite_base_size : 1;
+            long long growth = (server.aof_current_size*100/base) - 100;
+            if (growth >= server.aof_rewrite_perc) {
+                serverLog(LL_NOTICE,"Starting automatic rewriting of AOF on %lld%% growth",growth);
+                rewriteAppendOnlyFileBackground();
+            }
+        }
+    }
+    /* Just for the sake of defensive programming, to avoid forgeting to
+     * call this function when need. */
+    updateDictResizePolicy();
+
+
+    /* AOF postponed flush: Try at every cron cycle if the slow fsync
+     * completed. */
+    if (server.aof_state == AOF_ON && server.aof_flush_postponed_start)
+        flushAppendOnlyFile(0);
+
+    /* AOF write errors: in this case we have a buffer to flush as well and
+     * clear the AOF error in case of success to make the DB writable again,
+     * however to try every second is enough in case of 'hz' is set to
+     * a higher frequency. */
+    run_with_period(1000) {
+        if (server.aof_state == AOF_ON && server.aof_last_write_status == C_ERR)
+            flushAppendOnlyFile(0);
+    }
+
+    /* Clear the paused clients state if needed. */
+    checkClientPauseTimeoutAndReturnIfPaused();
+
+    /* Replication cron function -- used to reconnect to master,
+     * detect transfer failures, start background RDB transfers and so forth. 
+     * 
+     * If Redis is trying to failover then run the replication cron faster so
+     * progress on the handshake happens more quickly. */
+    if (server.failover_state != NO_FAILOVER) {
+        run_with_period(100) replicationCron();
+    } else {
+        run_with_period(1000) replicationCron();
+    }
+
+    /* Run the Redis Cluster cron. */
+    run_with_period(100) {
+        if (server.cluster_enabled) clusterCron();
+    }
+
+    /* Run the Sentinel timer if we are in sentinel mode. */
+    if (server.sentinel_mode) sentinelTimer();
+
+    /* Cleanup expired MIGRATE cached sockets. */
+    run_with_period(1000) {
+        migrateCloseTimedoutSockets();
+    }
+
+    /* Stop the I/O threads if we don't have enough pending work. */
+    stopThreadedIOIfNeeded();
+
+    /* Resize tracking keys table if needed. This is also done at every
+     * command execution, but we want to be sure that if the last command
+     * executed changes the value via CONFIG SET, the server will perform
+     * the operation even if completely idle. */
+    if (server.tracking_clients) trackingLimitUsedSlots();
+
+    /* Start a scheduled BGSAVE if the corresponding flag is set. This is
+     * useful when we are forced to postpone a BGSAVE because an AOF
+     * rewrite is in progress.
+     *
+     * Note: this code must be after the replicationCron() call above so
+     * make sure when refactoring this file to keep this order. This is useful
+     * because we want to give priority to RDB savings for replication. */
+    if (!hasActiveChildProcess() &&
+        server.rdb_bgsave_scheduled &&
+        (server.unixtime-server.lastbgsave_try > CONFIG_BGSAVE_RETRY_DELAY ||
+         server.lastbgsave_status == C_OK))
+    {
+        rdbSaveInfo rsi, *rsiptr;
+        rsiptr = rdbPopulateSaveInfo(&rsi);
+        if (rdbSaveBackground(server.rdb_filename,rsiptr) == C_OK)
+            server.rdb_bgsave_scheduled = 0;
+    }
+
+    /* Fire the cron loop modules event. */
+    RedisModuleCronLoopV1 ei = {REDISMODULE_CRON_LOOP_VERSION,server.hz};
+    moduleFireServerEvent(REDISMODULE_EVENT_CRON_LOOP,
+                          0,
+                          &ei);
+
+    server.cronloops++;
+    return 1000/server.hz;
+}
+
+
+void blockingOperationStarts() {
+    if(!server.blocking_op_nesting++){
+        updateCachedTime(0);
+        server.blocked_last_cron = server.mstime;
+    }
+}
+
+void blockingOperationEnds() {
+    if(!(--server.blocking_op_nesting)){
+        server.blocked_last_cron = 0;
+    }
+}
+
+/* This function fill in the role of serverCron during RDB or AOF loading, and
+ * also during blocked scripts.
+ * It attempts to do its duties at a similar rate as the configured server.hz,
+ * and updates cronloops variable so that similarly to serverCron, the
+ * run_with_period can be used. */
+void whileBlockedCron() {
+    /* Here we may want to perform some cron jobs (normally done server.hz times
+     * per second). */
+
+    /* Since this function depends on a call to blockingOperationStarts, let's
+     * make sure it was done. */
+    serverAssert(server.blocked_last_cron);
+
+    /* In case we where called too soon, leave right away. This way one time
+     * jobs after the loop below don't need an if. and we don't bother to start
+     * latency monitor if this function is called too often. */
+    if (server.blocked_last_cron >= server.mstime)
+        return;
+
+    mstime_t latency;
+    latencyStartMonitor(latency);
+
+    /* In some cases we may be called with big intervals, so we may need to do
+     * extra work here. This is because some of the functions in serverCron rely
+     * on the fact that it is performed every 10 ms or so. For instance, if
+     * activeDefragCycle needs to utilize 25% cpu, it will utilize 2.5ms, so we
+     * need to call it multiple times. */
+    long hz_ms = 1000/server.hz;
+    while (server.blocked_last_cron < server.mstime) {
+
+        /* Defrag keys gradually. */
+        activeDefragCycle();
+
+        server.blocked_last_cron += hz_ms;
+
+        /* Increment cronloop so that run_with_period works. */
+        server.cronloops++;
+    }
+
+    /* Other cron jobs do not need to be done in a loop. No need to check
+     * server.blocked_last_cron since we have an early exit at the top. */
+
+    /* Update memory stats during loading (excluding blocked scripts) */
+    if (server.loading) cronUpdateMemoryStats();
+
+    latencyEndMonitor(latency);
+    latencyAddSampleIfNeeded("while-blocked-cron",latency);
+}
+
+extern int ProcessingEventsWhileBlocked;
+
+/* This function gets called every time Redis is entering the
+ * main loop of the event driven library, that is, before to sleep
+ * for ready file descriptors.
+ *
+ * Note: This function is (currently) called from two functions:
+ * 1. aeMain - The main server loop
+ * 2. processEventsWhileBlocked - Process clients during RDB/AOF load
+ *
+ * If it was called from processEventsWhileBlocked we don't want
+ * to perform all actions (For example, we don't want to expire
+ * keys), but we do need to perform some actions.
+ *
+ * The most important is freeClientsInAsyncFreeQueue but we also
+ * call some other low-risk functions. */
+void beforeSleep(struct aeEventLoop *eventLoop) {
+    UNUSED(eventLoop);
+
+    size_t zmalloc_used = zmalloc_used_memory();
+    if (zmalloc_used > server.stat_peak_memory)
+        server.stat_peak_memory = zmalloc_used;
+
+    /* Just call a subset of vital functions in case we are re-entering
+     * the event loop from processEventsWhileBlocked(). Note that in this
+     * case we keep track of the number of events we are processing, since
+     * processEventsWhileBlocked() wants to stop ASAP if there are no longer
+     * events to handle. */
+    if (ProcessingEventsWhileBlocked) {
+        uint64_t processed = 0;
+        processed += handleClientsWithPendingReadsUsingThreads();
+        processed += tlsProcessPendingData();
+        processed += handleClientsWithPendingWrites();
+        processed += freeClientsInAsyncFreeQueue();
+        server.events_processed_while_blocked += processed;
+        return;
+    }
+
+    /* Handle precise timeouts of blocked clients. */
+    handleBlockedClientsTimeout();
+
+    /* We should handle pending reads clients ASAP after event loop. */
+    handleClientsWithPendingReadsUsingThreads();
+
+    /* Handle TLS pending data. (must be done before flushAppendOnlyFile) */
+    tlsProcessPendingData();
+
+    /* If tls still has pending unread data don't sleep at all. */
+    aeSetDontWait(server.el, tlsHasPendingData());
+
+    /* Call the Redis Cluster before sleep function. Note that this function
+     * may change the state of Redis Cluster (from ok to fail or vice versa),
+     * so it's a good idea to call it before serving the unblocked clients
+     * later in this function. */
+    if (server.cluster_enabled) clusterBeforeSleep();
+
+    /* Run a fast expire cycle (the called function will return
+     * ASAP if a fast cycle is not needed). */
+    if (server.active_expire_enabled && server.masterhost == NULL)
+        activeExpireCycle(ACTIVE_EXPIRE_CYCLE_FAST);
+
+    /* Unblock all the clients blocked for synchronous replication
+     * in WAIT. */
+    if (listLength(server.clients_waiting_acks))
+        processClientsWaitingReplicas();
+
+    /* Check if there are clients unblocked by modules that implement
+     * blocking commands. */
+    if (moduleCount()) moduleHandleBlockedClients();
+
+    /* Try to process pending commands for clients that were just unblocked. */
+    if (listLength(server.unblocked_clients))
+        processUnblockedClients();
+
+    /* Send all the slaves an ACK request if at least one client blocked
+     * during the previous event loop iteration. Note that we do this after
+     * processUnblockedClients(), so if there are multiple pipelined WAITs
+     * and the just unblocked WAIT gets blocked again, we don't have to wait
+     * a server cron cycle in absence of other event loop events. See #6623.
+     * 
+     * We also don't send the ACKs while clients are paused, since it can
+     * increment the replication backlog, they'll be sent after the pause
+     * if we are still the master. */
+    if (server.get_ack_from_slaves && !checkClientPauseTimeoutAndReturnIfPaused()) {
+        robj *argv[3];
+
+        argv[0] = shared.replconf;
+        argv[1] = shared.getack;
+        argv[2] = shared.special_asterick; /* Not used argument. */
+        replicationFeedSlaves(server.slaves, server.slaveseldb, argv, 3);
+        server.get_ack_from_slaves = 0;
+    }
+
+    /* We may have recieved updates from clients about their current offset. NOTE:
+     * this can't be done where the ACK is recieved since failover will disconnect 
+     * our clients. */
+    updateFailoverStatus();
+
+    /* Send the invalidation messages to clients participating to the
+     * client side caching protocol in broadcasting (BCAST) mode. */
+    trackingBroadcastInvalidationMessages();
+
+    /* Write the AOF buffer on disk */
+    if (server.aof_state == AOF_ON)
+        flushAppendOnlyFile(0);
+
+    /* Handle writes with pending output buffers. */
+    handleClientsWithPendingWritesUsingThreads();
+
+    /* Close clients that need to be closed asynchronous */
+    freeClientsInAsyncFreeQueue();
+
+    /* Try to process blocked clients every once in while. Example: A module
+     * calls RM_SignalKeyAsReady from within a timer callback (So we don't
+     * visit processCommand() at all). */
+    handleClientsBlockedOnKeys();
+
+    /* Before we are going to sleep, let the threads access the dataset by
+     * releasing the GIL. Redis main thread will not touch anything at this
+     * time. */
+    if (moduleCount()) moduleReleaseGIL();
+
+    /* Do NOT add anything below moduleReleaseGIL !!! */
+}
+
+/* This function is called immediately after the event loop multiplexing
+ * API returned, and the control is going to soon return to Redis by invoking
+ * the different events callbacks. */
+void afterSleep(struct aeEventLoop *eventLoop) {
+    UNUSED(eventLoop);
+
+    /* Do NOT add anything above moduleAcquireGIL !!! */
+
+    /* Aquire the modules GIL so that their threads won't touch anything. */
+    if (!ProcessingEventsWhileBlocked) {
+        if (moduleCount()) moduleAcquireGIL();
+    }
+}
+
+/* =========================== Server initialization ======================== */
+
+void createSharedObjects(void) {
+    int j;
+
+    /* Shared command responses */
+    shared.crlf = createObject(OBJ_STRING,sdsnew("\r\n"));
+    shared.ok = createObject(OBJ_STRING,sdsnew("+OK\r\n"));
+    shared.emptybulk = createObject(OBJ_STRING,sdsnew("$0\r\n\r\n"));
+    shared.czero = createObject(OBJ_STRING,sdsnew(":0\r\n"));
+    shared.cone = createObject(OBJ_STRING,sdsnew(":1\r\n"));
+    shared.emptyarray = createObject(OBJ_STRING,sdsnew("*0\r\n"));
+    shared.pong = createObject(OBJ_STRING,sdsnew("+PONG\r\n"));
+    shared.queued = createObject(OBJ_STRING,sdsnew("+QUEUED\r\n"));
+    shared.emptyscan = createObject(OBJ_STRING,sdsnew("*2\r\n$1\r\n0\r\n*0\r\n"));
+    shared.space = createObject(OBJ_STRING,sdsnew(" "));
+    shared.colon = createObject(OBJ_STRING,sdsnew(":"));
+    shared.plus = createObject(OBJ_STRING,sdsnew("+"));
+
+    /* Shared command error responses */
+    shared.wrongtypeerr = createObject(OBJ_STRING,sdsnew(
+        "-WRONGTYPE Operation against a key holding the wrong kind of value\r\n"));
+    shared.err = createObject(OBJ_STRING,sdsnew("-ERR\r\n"));
+    shared.nokeyerr = createObject(OBJ_STRING,sdsnew(
+        "-ERR no such key\r\n"));
+    shared.syntaxerr = createObject(OBJ_STRING,sdsnew(
+        "-ERR syntax error\r\n"));
+    shared.sameobjecterr = createObject(OBJ_STRING,sdsnew(
+        "-ERR source and destination objects are the same\r\n"));
+    shared.outofrangeerr = createObject(OBJ_STRING,sdsnew(
+        "-ERR index out of range\r\n"));
+    shared.noscripterr = createObject(OBJ_STRING,sdsnew(
+        "-NOSCRIPT No matching script. Please use EVAL.\r\n"));
+    shared.loadingerr = createObject(OBJ_STRING,sdsnew(
+        "-LOADING Redis is loading the dataset in memory\r\n"));
+    shared.slowscripterr = createObject(OBJ_STRING,sdsnew(
+        "-BUSY Redis is busy running a script. You can only call SCRIPT KILL or SHUTDOWN NOSAVE.\r\n"));
+    shared.masterdownerr = createObject(OBJ_STRING,sdsnew(
+        "-MASTERDOWN Link with MASTER is down and replica-serve-stale-data is set to 'no'.\r\n"));
+    shared.bgsaveerr = createObject(OBJ_STRING,sdsnew(
+        "-MISCONF Redis is configured to save RDB snapshots, but it is currently not able to persist on disk. Commands that may modify the data set are disabled, because this instance is configured to report errors during writes if RDB snapshotting fails (stop-writes-on-bgsave-error option). Please check the Redis logs for details about the RDB error.\r\n"));
+    shared.roslaveerr = createObject(OBJ_STRING,sdsnew(
+        "-READONLY You can't write against a read only replica.\r\n"));
+    shared.noautherr = createObject(OBJ_STRING,sdsnew(
+        "-NOAUTH Authentication required.\r\n"));
+    shared.oomerr = createObject(OBJ_STRING,sdsnew(
+        "-OOM command not allowed when used memory > 'maxmemory'.\r\n"));
+    shared.execaborterr = createObject(OBJ_STRING,sdsnew(
+        "-EXECABORT Transaction discarded because of previous errors.\r\n"));
+    shared.noreplicaserr = createObject(OBJ_STRING,sdsnew(
+        "-NOREPLICAS Not enough good replicas to write.\r\n"));
+    shared.busykeyerr = createObject(OBJ_STRING,sdsnew(
+        "-BUSYKEY Target key name already exists.\r\n"));
+
+    /* The shared NULL depends on the protocol version. */
+    shared.null[0] = NULL;
+    shared.null[1] = NULL;
+    shared.null[2] = createObject(OBJ_STRING,sdsnew("$-1\r\n"));
+    shared.null[3] = createObject(OBJ_STRING,sdsnew("_\r\n"));
+
+    shared.nullarray[0] = NULL;
+    shared.nullarray[1] = NULL;
+    shared.nullarray[2] = createObject(OBJ_STRING,sdsnew("*-1\r\n"));
+    shared.nullarray[3] = createObject(OBJ_STRING,sdsnew("_\r\n"));
+
+    shared.emptymap[0] = NULL;
+    shared.emptymap[1] = NULL;
+    shared.emptymap[2] = createObject(OBJ_STRING,sdsnew("*0\r\n"));
+    shared.emptymap[3] = createObject(OBJ_STRING,sdsnew("%0\r\n"));
+
+    shared.emptyset[0] = NULL;
+    shared.emptyset[1] = NULL;
+    shared.emptyset[2] = createObject(OBJ_STRING,sdsnew("*0\r\n"));
+    shared.emptyset[3] = createObject(OBJ_STRING,sdsnew("~0\r\n"));
+
+    for (j = 0; j < PROTO_SHARED_SELECT_CMDS; j++) {
+        char dictid_str[64];
+        int dictid_len;
+
+        dictid_len = ll2string(dictid_str,sizeof(dictid_str),j);
+        shared.select[j] = createObject(OBJ_STRING,
+            sdscatprintf(sdsempty(),
+                "*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
+                dictid_len, dictid_str));
+    }
+    shared.messagebulk = createStringObject("$7\r\nmessage\r\n",13);
+    shared.pmessagebulk = createStringObject("$8\r\npmessage\r\n",14);
+    shared.subscribebulk = createStringObject("$9\r\nsubscribe\r\n",15);
+    shared.unsubscribebulk = createStringObject("$11\r\nunsubscribe\r\n",18);
+    shared.psubscribebulk = createStringObject("$10\r\npsubscribe\r\n",17);
+    shared.punsubscribebulk = createStringObject("$12\r\npunsubscribe\r\n",19);
+
+    /* Shared command names */
+    shared.del = createStringObject("DEL",3);
+    shared.unlink = createStringObject("UNLINK",6);
+    shared.rpop = createStringObject("RPOP",4);
+    shared.lpop = createStringObject("LPOP",4);
+    shared.lpush = createStringObject("LPUSH",5);
+    shared.rpoplpush = createStringObject("RPOPLPUSH",9);
+    shared.lmove = createStringObject("LMOVE",5);
+    shared.blmove = createStringObject("BLMOVE",6);
+    shared.zpopmin = createStringObject("ZPOPMIN",7);
+    shared.zpopmax = createStringObject("ZPOPMAX",7);
+    shared.multi = createStringObject("MULTI",5);
+    shared.exec = createStringObject("EXEC",4);
+    shared.hset = createStringObject("HSET",4);
+    shared.srem = createStringObject("SREM",4);
+    shared.xgroup = createStringObject("XGROUP",6);
+    shared.xclaim = createStringObject("XCLAIM",6);
+    shared.script = createStringObject("SCRIPT",6);
+    shared.replconf = createStringObject("REPLCONF",8);
+    shared.pexpireat = createStringObject("PEXPIREAT",9);
+    shared.pexpire = createStringObject("PEXPIRE",7);
+    shared.persist = createStringObject("PERSIST",7);
+    shared.set = createStringObject("SET",3);
+    shared.eval = createStringObject("EVAL",4);
+
+    /* Shared command argument */
+    shared.left = createStringObject("left",4);
+    shared.right = createStringObject("right",5);
+    shared.pxat = createStringObject("PXAT", 4);
+    shared.px = createStringObject("PX",2);
+    shared.time = createStringObject("TIME",4);
+    shared.retrycount = createStringObject("RETRYCOUNT",10);
+    shared.force = createStringObject("FORCE",5);
+    shared.justid = createStringObject("JUSTID",6);
+    shared.lastid = createStringObject("LASTID",6);
+    shared.default_username = createStringObject("default",7);
+    shared.ping = createStringObject("ping",4);
+    shared.setid = createStringObject("SETID",5);
+    shared.keepttl = createStringObject("KEEPTTL",7);
+    shared.load = createStringObject("LOAD",4);
+    shared.createconsumer = createStringObject("CREATECONSUMER",14);
+    shared.getack = createStringObject("GETACK",6);
+    shared.special_asterick = createStringObject("*",1);
+    shared.special_equals = createStringObject("=",1);
+    shared.redacted = makeObjectShared(createStringObject("(redacted)",10));
+
+    for (j = 0; j < OBJ_SHARED_INTEGERS; j++) {
+        shared.integers[j] =
+            makeObjectShared(createObject(OBJ_STRING,(void*)(long)j));
+        shared.integers[j]->encoding = OBJ_ENCODING_INT;
+    }
+    for (j = 0; j < OBJ_SHARED_BULKHDR_LEN; j++) {
+        shared.mbulkhdr[j] = createObject(OBJ_STRING,
+            sdscatprintf(sdsempty(),"*%d\r\n",j));
+        shared.bulkhdr[j] = createObject(OBJ_STRING,
+            sdscatprintf(sdsempty(),"$%d\r\n",j));
+    }
+    /* The following two shared objects, minstring and maxstrings, are not
+     * actually used for their value but as a special object meaning
+     * respectively the minimum possible string and the maximum possible
+     * string in string comparisons for the ZRANGEBYLEX command. */
+    shared.minstring = sdsnew("minstring");
+    shared.maxstring = sdsnew("maxstring");
+}
+
+void initServerConfig(void) {
+    int j;
+
+    updateCachedTime(1);
+    getRandomHexChars(server.runid,CONFIG_RUN_ID_SIZE);
+    server.runid[CONFIG_RUN_ID_SIZE] = '\0';
+    changeReplicationId();
+    clearReplicationId2();
+    server.hz = CONFIG_DEFAULT_HZ; /* Initialize it ASAP, even if it may get
+                                      updated later after loading the config.
+                                      This value may be used before the server
+                                      is initialized. */
+    server.timezone = getTimeZone(); /* Initialized by tzset(). */
+    server.configfile = NULL;
+    server.executable = NULL;
+    server.arch_bits = (sizeof(long) == 8) ? 64 : 32;
+    server.bindaddr_count = 0;
+    server.unixsocketperm = CONFIG_DEFAULT_UNIX_SOCKET_PERM;
+    server.ipfd.count = 0;
+    server.tlsfd.count = 0;
+    server.sofd = -1;
+    server.active_expire_enabled = 1;
+    server.skip_checksum_validation = 0;
+    server.saveparams = NULL;
+    server.loading = 0;
+    server.loading_rdb_used_mem = 0;
+    server.logfile = zstrdup(CONFIG_DEFAULT_LOGFILE);
+    server.aof_state = AOF_OFF;
+    server.aof_rewrite_base_size = 0;
+    server.aof_rewrite_scheduled = 0;
+    server.aof_flush_sleep = 0;
+    server.aof_last_fsync = time(NULL);
+    atomicSet(server.aof_bio_fsync_status,C_OK);
+    server.aof_rewrite_time_last = -1;
+    server.aof_rewrite_time_start = -1;
+    server.aof_lastbgrewrite_status = C_OK;
+    server.aof_delayed_fsync = 0;
+    server.aof_fd = -1;
+    server.aof_selected_db = -1; /* Make sure the first time will not match */
+    server.aof_flush_postponed_start = 0;
+    server.pidfile = NULL;
+    server.active_defrag_running = 0;
+    server.notify_keyspace_events = 0;
+    server.blocked_clients = 0;
+    memset(server.blocked_clients_by_type,0,
+           sizeof(server.blocked_clients_by_type));
+    server.shutdown_asap = 0;
+    server.cluster_configfile = zstrdup(CONFIG_DEFAULT_CLUSTER_CONFIG_FILE);
+    server.cluster_module_flags = CLUSTER_MODULE_FLAG_NONE;
+    server.migrate_cached_sockets = dictCreate(&migrateCacheDictType,NULL);
+    server.next_client_id = 1; /* Client IDs, start from 1 .*/
+    server.loading_process_events_interval_bytes = (1024*1024*2);
+
+    unsigned int lruclock = getLRUClock();
+    atomicSet(server.lruclock,lruclock);
+    resetServerSaveParams();
+
+    appendServerSaveParams(60*60,1);  /* save after 1 hour and 1 change */
+    appendServerSaveParams(300,100);  /* save after 5 minutes and 100 changes */
+    appendServerSaveParams(60,10000); /* save after 1 minute and 10000 changes */
+
+    /* Replication related */
+    server.masterauth = NULL;
+    server.masterhost = NULL;
+    server.masterport = 6379;
+    server.master = NULL;
+    server.cached_master = NULL;
+    server.master_initial_offset = -1;
+    server.repl_state = REPL_STATE_NONE;
+    server.repl_transfer_tmpfile = NULL;
+    server.repl_transfer_fd = -1;
+    server.repl_transfer_s = NULL;
+    server.repl_syncio_timeout = CONFIG_REPL_SYNCIO_TIMEOUT;
+    server.repl_down_since = 0; /* Never connected, repl is down since EVER. */
+    server.master_repl_offset = 0;
+
+    /* Replication partial resync backlog */
+    server.repl_backlog = NULL;
+    server.repl_backlog_histlen = 0;
+    server.repl_backlog_idx = 0;
+    server.repl_backlog_off = 0;
+    server.repl_no_slaves_since = time(NULL);
+
+    /* Failover related */
+    server.failover_end_time = 0;
+    server.force_failover = 0;
+    server.target_replica_host = NULL;
+    server.target_replica_port = 0;
+    server.failover_state = NO_FAILOVER;
+
+    /* Client output buffer limits */
+    for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++)
+        server.client_obuf_limits[j] = clientBufferLimitsDefaults[j];
+
+    /* Linux OOM Score config */
+    for (j = 0; j < CONFIG_OOM_COUNT; j++)
+        server.oom_score_adj_values[j] = configOOMScoreAdjValuesDefaults[j];
+
+    /* Double constants initialization */
+    R_Zero = 0.0;
+    R_PosInf = 1.0/R_Zero;
+    R_NegInf = -1.0/R_Zero;
+    R_Nan = R_Zero/R_Zero;
+
+    /* Command table -- we initialize it here as it is part of the
+     * initial configuration, since command names may be changed via
+     * redis.conf using the rename-command directive. */
+    server.commands = dictCreate(&commandTableDictType,NULL);
+    server.orig_commands = dictCreate(&commandTableDictType,NULL);
+    populateCommandTable();
+    server.delCommand = lookupCommandByCString("del");
+    server.multiCommand = lookupCommandByCString("multi");
+    server.lpushCommand = lookupCommandByCString("lpush");
+    server.lpopCommand = lookupCommandByCString("lpop");
+    server.rpopCommand = lookupCommandByCString("rpop");
+    server.zpopminCommand = lookupCommandByCString("zpopmin");
+    server.zpopmaxCommand = lookupCommandByCString("zpopmax");
+    server.sremCommand = lookupCommandByCString("srem");
+    server.execCommand = lookupCommandByCString("exec");
+    server.expireCommand = lookupCommandByCString("expire");
+    server.pexpireCommand = lookupCommandByCString("pexpire");
+    server.xclaimCommand = lookupCommandByCString("xclaim");
+    server.xgroupCommand = lookupCommandByCString("xgroup");
+    server.rpoplpushCommand = lookupCommandByCString("rpoplpush");
+    server.lmoveCommand = lookupCommandByCString("lmove");
+
+    /* Debugging */
+    server.watchdog_period = 0;
+
+    /* By default we want scripts to be always replicated by effects
+     * (single commands executed by the script), and not by sending the
+     * script to the slave / AOF. This is the new way starting from
+     * Redis 5. However it is possible to revert it via redis.conf. */
+    server.lua_always_replicate_commands = 1;
+
+    /* Client Pause related */
+    server.client_pause_type = CLIENT_PAUSE_OFF;
+    server.client_pause_end_time = 0;   
+
+    initConfigValues();
+}
+
+extern char **environ;
+
+/* Restart the server, executing the same executable that started this
+ * instance, with the same arguments and configuration file.
+ *
+ * The function is designed to directly call execve() so that the new
+ * server instance will retain the PID of the previous one.
+ *
+ * The list of flags, that may be bitwise ORed together, alter the
+ * behavior of this function:
+ *
+ * RESTART_SERVER_NONE              No flags.
+ * RESTART_SERVER_GRACEFULLY        Do a proper shutdown before restarting.
+ * RESTART_SERVER_CONFIG_REWRITE    Rewrite the config file before restarting.
+ *
+ * On success the function does not return, because the process turns into
+ * a different process. On error C_ERR is returned. */
+int restartServer(int flags, mstime_t delay) {
+    int j;
+
+    /* Check if we still have accesses to the executable that started this
+     * server instance. */
+    if (access(server.executable,X_OK) == -1) {
+        serverLog(LL_WARNING,"Can't restart: this process has no "
+                             "permissions to execute %s", server.executable);
+        return C_ERR;
+    }
+
+    /* Config rewriting. */
+    if (flags & RESTART_SERVER_CONFIG_REWRITE &&
+        server.configfile &&
+        rewriteConfig(server.configfile, 0) == -1)
+    {
+        serverLog(LL_WARNING,"Can't restart: configuration rewrite process "
+                             "failed");
+        return C_ERR;
+    }
+
+    /* Perform a proper shutdown. */
+    if (flags & RESTART_SERVER_GRACEFULLY &&
+        prepareForShutdown(SHUTDOWN_NOFLAGS) != C_OK)
+    {
+        serverLog(LL_WARNING,"Can't restart: error preparing for shutdown");
+        return C_ERR;
+    }
+
+    /* Close all file descriptors, with the exception of stdin, stdout, strerr
+     * which are useful if we restart a Redis server which is not daemonized. */
+    for (j = 3; j < (int)server.maxclients + 1024; j++) {
+        /* Test the descriptor validity before closing it, otherwise
+         * Valgrind issues a warning on close(). */
+        if (fcntl(j,F_GETFD) != -1) close(j);
+    }
+
+    /* Execute the server with the original command line. */
+    if (delay) usleep(delay*1000);
+    zfree(server.exec_argv[0]);
+    server.exec_argv[0] = zstrdup(server.executable);
+    execve(server.executable,server.exec_argv,environ);
+
+    /* If an error occurred here, there is nothing we can do, but exit. */
+    _exit(1);
+
+    return C_ERR; /* Never reached. */
+}
+
+static void readOOMScoreAdj(void) {
+#ifdef HAVE_PROC_OOM_SCORE_ADJ
+    char buf[64];
+    int fd = open("/proc/self/oom_score_adj", O_RDONLY);
+
+    if (fd < 0) return;
+    if (read(fd, buf, sizeof(buf)) > 0)
+        server.oom_score_adj_base = atoi(buf);
+    close(fd);
+#endif
+}
+
+/* This function will configure the current process's oom_score_adj according
+ * to user specified configuration. This is currently implemented on Linux
+ * only.
+ *
+ * A process_class value of -1 implies OOM_CONFIG_MASTER or OOM_CONFIG_REPLICA,
+ * depending on current role.
+ */
+int setOOMScoreAdj(int process_class) {
+
+    if (server.oom_score_adj == OOM_SCORE_ADJ_NO) return C_OK;
+    if (process_class == -1)
+        process_class = (server.masterhost ? CONFIG_OOM_REPLICA : CONFIG_OOM_MASTER);
+
+    serverAssert(process_class >= 0 && process_class < CONFIG_OOM_COUNT);
+
+#ifdef HAVE_PROC_OOM_SCORE_ADJ
+    int fd;
+    int val;
+    char buf[64];
+
+    val = server.oom_score_adj_values[process_class];
+    if (server.oom_score_adj == OOM_SCORE_RELATIVE)
+        val += server.oom_score_adj_base;
+    if (val > 1000) val = 1000;
+    if (val < -1000) val = -1000;
+
+    snprintf(buf, sizeof(buf) - 1, "%d\n", val);
+
+    fd = open("/proc/self/oom_score_adj", O_WRONLY);
+    if (fd < 0 || write(fd, buf, strlen(buf)) < 0) {
+        serverLog(LOG_WARNING, "Unable to write oom_score_adj: %s", strerror(errno));
+        if (fd != -1) close(fd);
+        return C_ERR;
+    }
+
+    close(fd);
+    return C_OK;
+#else
+    /* Unsupported */
+    return C_ERR;
+#endif
+}
+
+/* This function will try to raise the max number of open files accordingly to
+ * the configured max number of clients. It also reserves a number of file
+ * descriptors (CONFIG_MIN_RESERVED_FDS) for extra operations of
+ * persistence, listening sockets, log files and so forth.
+ *
+ * If it will not be possible to set the limit accordingly to the configured
+ * max number of clients, the function will do the reverse setting
+ * server.maxclients to the value that we can actually handle. */
+void adjustOpenFilesLimit(void) {
+    rlim_t maxfiles = server.maxclients+CONFIG_MIN_RESERVED_FDS;
+    struct rlimit limit;
+
+    if (getrlimit(RLIMIT_NOFILE,&limit) == -1) {
+        serverLog(LL_WARNING,"Unable to obtain the current NOFILE limit (%s), assuming 1024 and setting the max clients configuration accordingly.",
+            strerror(errno));
+        server.maxclients = 1024-CONFIG_MIN_RESERVED_FDS;
+    } else {
+        rlim_t oldlimit = limit.rlim_cur;
+
+        /* Set the max number of files if the current limit is not enough
+         * for our needs. */
+        if (oldlimit < maxfiles) {
+            rlim_t bestlimit;
+            int setrlimit_error = 0;
+
+            /* Try to set the file limit to match 'maxfiles' or at least
+             * to the higher value supported less than maxfiles. */
+            bestlimit = maxfiles;
+            while(bestlimit > oldlimit) {
+                rlim_t decr_step = 16;
+
+                limit.rlim_cur = bestlimit;
+                limit.rlim_max = bestlimit;
+                if (setrlimit(RLIMIT_NOFILE,&limit) != -1) break;
+                setrlimit_error = errno;
+
+                /* We failed to set file limit to 'bestlimit'. Try with a
+                 * smaller limit decrementing by a few FDs per iteration. */
+                if (bestlimit < decr_step) break;
+                bestlimit -= decr_step;
+            }
+
+            /* Assume that the limit we get initially is still valid if
+             * our last try was even lower. */
+            if (bestlimit < oldlimit) bestlimit = oldlimit;
+
+            if (bestlimit < maxfiles) {
+                unsigned int old_maxclients = server.maxclients;
+                server.maxclients = bestlimit-CONFIG_MIN_RESERVED_FDS;
+                /* maxclients is unsigned so may overflow: in order
+                 * to check if maxclients is now logically less than 1
+                 * we test indirectly via bestlimit. */
+                if (bestlimit <= CONFIG_MIN_RESERVED_FDS) {
+                    serverLog(LL_WARNING,"Your current 'ulimit -n' "
+                        "of %llu is not enough for the server to start. "
+                        "Please increase your open file limit to at least "
+                        "%llu. Exiting.",
+                        (unsigned long long) oldlimit,
+                        (unsigned long long) maxfiles);
+                    exit(1);
+                }
+                serverLog(LL_WARNING,"You requested maxclients of %d "
+                    "requiring at least %llu max file descriptors.",
+                    old_maxclients,
+                    (unsigned long long) maxfiles);
+                serverLog(LL_WARNING,"Server can't set maximum open files "
+                    "to %llu because of OS error: %s.",
+                    (unsigned long long) maxfiles, strerror(setrlimit_error));
+                serverLog(LL_WARNING,"Current maximum open files is %llu. "
+                    "maxclients has been reduced to %d to compensate for "
+                    "low ulimit. "
+                    "If you need higher maxclients increase 'ulimit -n'.",
+                    (unsigned long long) bestlimit, server.maxclients);
+            } else {
+                serverLog(LL_NOTICE,"Increased maximum number of open files "
+                    "to %llu (it was originally set to %llu).",
+                    (unsigned long long) maxfiles,
+                    (unsigned long long) oldlimit);
+            }
+        }
+    }
+}
+
+/* Check that server.tcp_backlog can be actually enforced in Linux according
+ * to the value of /proc/sys/net/core/somaxconn, or warn about it. */
+void checkTcpBacklogSettings(void) {
+#ifdef HAVE_PROC_SOMAXCONN
+    FILE *fp = fopen("/proc/sys/net/core/somaxconn","r");
+    char buf[1024];
+    if (!fp) return;
+    if (fgets(buf,sizeof(buf),fp) != NULL) {
+        int somaxconn = atoi(buf);
+        if (somaxconn > 0 && somaxconn < server.tcp_backlog) {
+            serverLog(LL_WARNING,"WARNING: The TCP backlog setting of %d cannot be enforced because /proc/sys/net/core/somaxconn is set to the lower value of %d.", server.tcp_backlog, somaxconn);
+        }
+    }
+    fclose(fp);
+#endif
+}
+
+void closeSocketListeners(socketFds *sfd) {
+    int j;
+
+    for (j = 0; j < sfd->count; j++) {
+        if (sfd->fd[j] == -1) continue;
+
+        aeDeleteFileEvent(server.el, sfd->fd[j], AE_READABLE);
+        close(sfd->fd[j]);
+    }
+
+    sfd->count = 0;
+}
+
+/* Create an event handler for accepting new connections in TCP or TLS domain sockets.
+ * This works atomically for all socket fds */
+int createSocketAcceptHandler(socketFds *sfd, aeFileProc *accept_handler) {
+    int j;
+
+    for (j = 0; j < sfd->count; j++) {
+        if (aeCreateFileEvent(server.el, sfd->fd[j], AE_READABLE, accept_handler,NULL) == AE_ERR) {
+            /* Rollback */
+            for (j = j-1; j >= 0; j--) aeDeleteFileEvent(server.el, sfd->fd[j], AE_READABLE);
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* Initialize a set of file descriptors to listen to the specified 'port'
+ * binding the addresses specified in the Redis server configuration.
+ *
+ * The listening file descriptors are stored in the integer array 'fds'
+ * and their number is set in '*count'.
+ *
+ * The addresses to bind are specified in the global server.bindaddr array
+ * and their number is server.bindaddr_count. If the server configuration
+ * contains no specific addresses to bind, this function will try to
+ * bind * (all addresses) for both the IPv4 and IPv6 protocols.
+ *
+ * On success the function returns C_OK.
+ *
+ * On error the function returns C_ERR. For the function to be on
+ * error, at least one of the server.bindaddr addresses was
+ * impossible to bind, or no bind addresses were specified in the server
+ * configuration but the function is not able to bind * for at least
+ * one of the IPv4 or IPv6 protocols. */
+int listenToPort(int port, socketFds *sfd) {
+    int j;
+    char **bindaddr = server.bindaddr;
+    int bindaddr_count = server.bindaddr_count;
+    char *default_bindaddr[2] = {"*", "-::*"};
+
+    /* Force binding of 0.0.0.0 if no bind address is specified. */
+    if (server.bindaddr_count == 0) {
+        bindaddr_count = 2;
+        bindaddr = default_bindaddr;
+    }
+
+    for (j = 0; j < bindaddr_count; j++) {
+        char* addr = bindaddr[j];
+        int optional = *addr == '-';
+        if (optional) addr++;
+        if (strchr(addr,':')) {
+            /* Bind IPv6 address. */
+            sfd->fd[sfd->count] = anetTcp6Server(server.neterr,port,addr,server.tcp_backlog);
+        } else {
+            /* Bind IPv4 address. */
+            sfd->fd[sfd->count] = anetTcpServer(server.neterr,port,addr,server.tcp_backlog);
+        }
+        if (sfd->fd[sfd->count] == ANET_ERR) {
+            int net_errno = errno;
+            serverLog(LL_WARNING,
+                "Warning: Could not create server TCP listening socket %s:%d: %s",
+                addr, port, server.neterr);
+            if (net_errno == EADDRNOTAVAIL && optional)
+                continue;
+            if (net_errno == ENOPROTOOPT     || net_errno == EPROTONOSUPPORT ||
+                net_errno == ESOCKTNOSUPPORT || net_errno == EPFNOSUPPORT ||
+                net_errno == EAFNOSUPPORT)
+                continue;
+
+            /* Rollback successful listens before exiting */
+            closeSocketListeners(sfd);
+            return C_ERR;
+        }
+        anetNonBlock(NULL,sfd->fd[sfd->count]);
+        anetCloexec(sfd->fd[sfd->count]);
+        sfd->count++;
+    }
+    return C_OK;
+}
+
+/* Resets the stats that we expose via INFO or other means that we want
+ * to reset via CONFIG RESETSTAT. The function is also used in order to
+ * initialize these fields in initServer() at server startup. */
+void resetServerStats(void) {
+    int j;
+
+    server.stat_numcommands = 0;
+    server.stat_numconnections = 0;
+    server.stat_expiredkeys = 0;
+    server.stat_expired_stale_perc = 0;
+    server.stat_expired_time_cap_reached_count = 0;
+    server.stat_expire_cycle_time_used = 0;
+    server.stat_evictedkeys = 0;
+    server.stat_keyspace_misses = 0;
+    server.stat_keyspace_hits = 0;
+    server.stat_active_defrag_hits = 0;
+    server.stat_active_defrag_misses = 0;
+    server.stat_active_defrag_key_hits = 0;
+    server.stat_active_defrag_key_misses = 0;
+    server.stat_active_defrag_scanned = 0;
+    server.stat_fork_time = 0;
+    server.stat_fork_rate = 0;
+    server.stat_total_forks = 0;
+    server.stat_rejected_conn = 0;
+    server.stat_sync_full = 0;
+    server.stat_sync_partial_ok = 0;
+    server.stat_sync_partial_err = 0;
+    server.stat_io_reads_processed = 0;
+    atomicSet(server.stat_total_reads_processed, 0);
+    server.stat_io_writes_processed = 0;
+    atomicSet(server.stat_total_writes_processed, 0);
+    for (j = 0; j < STATS_METRIC_COUNT; j++) {
+        server.inst_metric[j].idx = 0;
+        server.inst_metric[j].last_sample_time = mstime();
+        server.inst_metric[j].last_sample_count = 0;
+        memset(server.inst_metric[j].samples,0,
+            sizeof(server.inst_metric[j].samples));
+    }
+    atomicSet(server.stat_net_input_bytes, 0);
+    atomicSet(server.stat_net_output_bytes, 0);
+    server.stat_unexpected_error_replies = 0;
+    server.stat_total_error_replies = 0;
+    server.stat_dump_payload_sanitizations = 0;
+    server.aof_delayed_fsync = 0;
+}
+
+/* Make the thread killable at any time, so that kill threads functions
+ * can work reliably (default cancelability type is PTHREAD_CANCEL_DEFERRED).
+ * Needed for pthread_cancel used by the fast memory test used by the crash report. */
+void makeThreadKillable(void) {
+    pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
+    pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);
+}
+
+void initServer(void) {
+    int j;
+
+    signal(SIGHUP, SIG_IGN);
+    signal(SIGPIPE, SIG_IGN);
+    setupSignalHandlers();
+    makeThreadKillable();
+
+    if (server.syslog_enabled) {
+        openlog(server.syslog_ident, LOG_PID | LOG_NDELAY | LOG_NOWAIT,
+            server.syslog_facility);
+    }
+
+    /* Initialization after setting defaults from the config system. */
+    server.aof_state = server.aof_enabled ? AOF_ON : AOF_OFF;
+    server.hz = server.config_hz;
+    server.pid = getpid();
+    server.in_fork_child = CHILD_TYPE_NONE;
+    server.main_thread_id = pthread_self();
+    server.current_client = NULL;
+    server.errors = raxNew();
+    server.fixed_time_expire = 0;
+    server.clients = listCreate();
+    server.clients_index = raxNew();
+    server.clients_to_close = listCreate();
+    server.slaves = listCreate();
+    server.monitors = listCreate();
+    server.clients_pending_write = listCreate();
+    server.clients_pending_read = listCreate();
+    server.clients_timeout_table = raxNew();
+    server.replication_allowed = 1;
+    server.slaveseldb = -1; /* Force to emit the first SELECT command. */
+    server.unblocked_clients = listCreate();
+    server.ready_keys = listCreate();
+    server.clients_waiting_acks = listCreate();
+    server.get_ack_from_slaves = 0;
+    server.client_pause_type = 0;
+    server.paused_clients = listCreate();
+    server.events_processed_while_blocked = 0;
+    server.system_memory_size = zmalloc_get_memory_size();
+    server.blocked_last_cron = 0;
+    server.blocking_op_nesting = 0;
+
+    if ((server.tls_port || server.tls_replication || server.tls_cluster)
+                && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
+        serverLog(LL_WARNING, "Failed to configure TLS. Check logs for more info.");
+        exit(1);
+    }
+
+    createSharedObjects();
+    adjustOpenFilesLimit();
+    const char *clk_msg = monotonicInit();
+    serverLog(LL_NOTICE, "monotonic clock: %s", clk_msg);
+    server.el = aeCreateEventLoop(server.maxclients+CONFIG_FDSET_INCR);
+    if (server.el == NULL) {
+        serverLog(LL_WARNING,
+            "Failed creating the event loop. Error message: '%s'",
+            strerror(errno));
+        exit(1);
+    }
+    server.db = zmalloc(sizeof(redisDb)*server.dbnum);
+
+    /* Open the TCP listening socket for the user commands. */
+    if (server.port != 0 &&
+        listenToPort(server.port,&server.ipfd) == C_ERR) {
+        serverLog(LL_WARNING, "Failed listening on port %u (TCP), aborting.", server.port);
+        exit(1);
+    }
+    if (server.tls_port != 0 &&
+        listenToPort(server.tls_port,&server.tlsfd) == C_ERR) {
+        serverLog(LL_WARNING, "Failed listening on port %u (TLS), aborting.", server.tls_port);
+        exit(1);
+    }
+
+    /* Open the listening Unix domain socket. */
+    if (server.unixsocket != NULL) {
+        unlink(server.unixsocket); /* don't care if this fails */
+        server.sofd = anetUnixServer(server.neterr,server.unixsocket,
+            server.unixsocketperm, server.tcp_backlog);
+        if (server.sofd == ANET_ERR) {
+            serverLog(LL_WARNING, "Opening Unix socket: %s", server.neterr);
+            exit(1);
+        }
+        anetNonBlock(NULL,server.sofd);
+        anetCloexec(server.sofd);
+    }
+
+    /* Abort if there are no listening sockets at all. */
+    if (server.ipfd.count == 0 && server.tlsfd.count == 0 && server.sofd < 0) {
+        serverLog(LL_WARNING, "Configured to not listen anywhere, exiting.");
+        exit(1);
+    }
+
+    /* Create the Redis databases, and initialize other internal state. */
+    for (j = 0; j < server.dbnum; j++) {
+        server.db[j].dict = dictCreate(&dbDictType,NULL);
+        server.db[j].expires = dictCreate(&dbExpiresDictType,NULL);
+        server.db[j].expires_cursor = 0;
+        server.db[j].blocking_keys = dictCreate(&keylistDictType,NULL);
+        server.db[j].ready_keys = dictCreate(&objectKeyPointerValueDictType,NULL);
+        server.db[j].watched_keys = dictCreate(&keylistDictType,NULL);
+        server.db[j].id = j;
+        server.db[j].avg_ttl = 0;
+        server.db[j].defrag_later = listCreate();
+        listSetFreeMethod(server.db[j].defrag_later,(void (*)(void*))sdsfree);
+    }
+    evictionPoolAlloc(); /* Initialize the LRU keys pool. */
+    server.pubsub_channels = dictCreate(&keylistDictType,NULL);
+    server.pubsub_patterns = dictCreate(&keylistDictType,NULL);
+    server.cronloops = 0;
+    server.in_eval = 0;
+    server.in_exec = 0;
+    server.propagate_in_transaction = 0;
+    server.client_pause_in_transaction = 0;
+    server.child_pid = -1;
+    server.child_type = CHILD_TYPE_NONE;
+    server.rdb_child_type = RDB_CHILD_TYPE_NONE;
+    server.rdb_pipe_conns = NULL;
+    server.rdb_pipe_numconns = 0;
+    server.rdb_pipe_numconns_writing = 0;
+    server.rdb_pipe_buff = NULL;
+    server.rdb_pipe_bufflen = 0;
+    server.rdb_bgsave_scheduled = 0;
+    server.child_info_pipe[0] = -1;
+    server.child_info_pipe[1] = -1;
+    server.child_info_nread = 0;
+    aofRewriteBufferReset();
+    server.aof_buf = sdsempty();
+    server.lastsave = time(NULL); /* At startup we consider the DB saved. */
+    server.lastbgsave_try = 0;    /* At startup we never tried to BGSAVE. */
+    server.rdb_save_time_last = -1;
+    server.rdb_save_time_start = -1;
+    server.dirty = 0;
+    resetServerStats();
+    /* A few stats we don't want to reset: server startup time, and peak mem. */
+    server.stat_starttime = time(NULL);
+    server.stat_peak_memory = 0;
+    server.stat_current_cow_bytes = 0;
+    server.stat_current_cow_updated = 0;
+    server.stat_current_save_keys_processed = 0;
+    server.stat_current_save_keys_total = 0;
+    server.stat_rdb_cow_bytes = 0;
+    server.stat_aof_cow_bytes = 0;
+    server.stat_module_cow_bytes = 0;
+    server.stat_module_progress = 0;
+    for (int j = 0; j < CLIENT_TYPE_COUNT; j++)
+        server.stat_clients_type_memory[j] = 0;
+    server.cron_malloc_stats.zmalloc_used = 0;
+    server.cron_malloc_stats.process_rss = 0;
+    server.cron_malloc_stats.allocator_allocated = 0;
+    server.cron_malloc_stats.allocator_active = 0;
+    server.cron_malloc_stats.allocator_resident = 0;
+    server.lastbgsave_status = C_OK;
+    server.aof_last_write_status = C_OK;
+    server.aof_last_write_errno = 0;
+    server.repl_good_slaves_count = 0;
+
+    /* Create the timer callback, this is our way to process many background
+     * operations incrementally, like clients timeout, eviction of unaccessed
+     * expired keys and so forth. */
+    if (aeCreateTimeEvent(server.el, 1, serverCron, NULL, NULL) == AE_ERR) {
+        serverPanic("Can't create event loop timers.");
+        exit(1);
+    }
+
+    /* Create an event handler for accepting new connections in TCP and Unix
+     * domain sockets. */
+    if (createSocketAcceptHandler(&server.ipfd, acceptTcpHandler) != C_OK) {
+        serverPanic("Unrecoverable error creating TCP socket accept handler.");
+    }
+    if (createSocketAcceptHandler(&server.tlsfd, acceptTLSHandler) != C_OK) {
+        serverPanic("Unrecoverable error creating TLS socket accept handler.");
+    }
+    if (server.sofd > 0 && aeCreateFileEvent(server.el,server.sofd,AE_READABLE,
+        acceptUnixHandler,NULL) == AE_ERR) serverPanic("Unrecoverable error creating server.sofd file event.");
+
+
+    /* Register a readable event for the pipe used to awake the event loop
+     * when a blocked client in a module needs attention. */
+    if (aeCreateFileEvent(server.el, server.module_blocked_pipe[0], AE_READABLE,
+        moduleBlockedClientPipeReadable,NULL) == AE_ERR) {
+            serverPanic(
+                "Error registering the readable event for the module "
+                "blocked clients subsystem.");
+    }
+
+    /* Register before and after sleep handlers (note this needs to be done
+     * before loading persistence since it is used by processEventsWhileBlocked. */
+    aeSetBeforeSleepProc(server.el,beforeSleep);
+    aeSetAfterSleepProc(server.el,afterSleep);
+
+    /* Open the AOF file if needed. */
+    if (server.aof_state == AOF_ON) {
+        server.aof_fd = open(server.aof_filename,
+                               O_WRONLY|O_APPEND|O_CREAT,0644);
+        if (server.aof_fd == -1) {
+            serverLog(LL_WARNING, "Can't open the append-only file: %s",
+                strerror(errno));
+            exit(1);
+        }
+    }
+
+    /* 32 bit instances are limited to 4GB of address space, so if there is
+     * no explicit limit in the user provided configuration we set a limit
+     * at 3 GB using maxmemory with 'noeviction' policy'. This avoids
+     * useless crashes of the Redis instance for out of memory. */
+    if (server.arch_bits == 32 && server.maxmemory == 0) {
+        serverLog(LL_WARNING,"Warning: 32 bit instance detected but no memory limit set. Setting 3 GB maxmemory limit with 'noeviction' policy now.");
+        server.maxmemory = 3072LL*(1024*1024); /* 3 GB */
+        server.maxmemory_policy = MAXMEMORY_NO_EVICTION;
+    }
+
+    if (server.cluster_enabled) clusterInit();
+    replicationScriptCacheInit();
+    scriptingInit(1);
+    slowlogInit();
+    latencyMonitorInit();
+    
+    /* Initialize ACL default password if it exists */
+    ACLUpdateDefaultUserPassword(server.requirepass);
+}
+
+/* Some steps in server initialization need to be done last (after modules
+ * are loaded).
+ * Specifically, creation of threads due to a race bug in ld.so, in which
+ * Thread Local Storage initialization collides with dlopen call.
+ * see: https://sourceware.org/bugzilla/show_bug.cgi?id=19329 */
+void InitServerLast() {
+    bioInit();
+    initThreadedIO();
+    set_jemalloc_bg_thread(server.jemalloc_bg_thread);
+    server.initial_memory_usage = zmalloc_used_memory();
+}
+
+/* Parse the flags string description 'strflags' and set them to the
+ * command 'c'. If the flags are all valid C_OK is returned, otherwise
+ * C_ERR is returned (yet the recognized flags are set in the command). */
+int populateCommandTableParseFlags(struct redisCommand *c, char *strflags) {
+    int argc;
+    sds *argv;
+
+    /* Split the line into arguments for processing. */
+    argv = sdssplitargs(strflags,&argc);
+    if (argv == NULL) return C_ERR;
+
+    for (int j = 0; j < argc; j++) {
+        char *flag = argv[j];
+        if (!strcasecmp(flag,"write")) {
+            c->flags |= CMD_WRITE|CMD_CATEGORY_WRITE;
+        } else if (!strcasecmp(flag,"read-only")) {
+            c->flags |= CMD_READONLY|CMD_CATEGORY_READ;
+        } else if (!strcasecmp(flag,"use-memory")) {
+            c->flags |= CMD_DENYOOM;
+        } else if (!strcasecmp(flag,"admin")) {
+            c->flags |= CMD_ADMIN|CMD_CATEGORY_ADMIN|CMD_CATEGORY_DANGEROUS;
+        } else if (!strcasecmp(flag,"pub-sub")) {
+            c->flags |= CMD_PUBSUB|CMD_CATEGORY_PUBSUB;
+        } else if (!strcasecmp(flag,"no-script")) {
+            c->flags |= CMD_NOSCRIPT;
+        } else if (!strcasecmp(flag,"random")) {
+            c->flags |= CMD_RANDOM;
+        } else if (!strcasecmp(flag,"to-sort")) {
+            c->flags |= CMD_SORT_FOR_SCRIPT;
+        } else if (!strcasecmp(flag,"ok-loading")) {
+            c->flags |= CMD_LOADING;
+        } else if (!strcasecmp(flag,"ok-stale")) {
+            c->flags |= CMD_STALE;
+        } else if (!strcasecmp(flag,"no-monitor")) {
+            c->flags |= CMD_SKIP_MONITOR;
+        } else if (!strcasecmp(flag,"no-slowlog")) {
+            c->flags |= CMD_SKIP_SLOWLOG;
+        } else if (!strcasecmp(flag,"cluster-asking")) {
+            c->flags |= CMD_ASKING;
+        } else if (!strcasecmp(flag,"fast")) {
+            c->flags |= CMD_FAST | CMD_CATEGORY_FAST;
+        } else if (!strcasecmp(flag,"no-auth")) {
+            c->flags |= CMD_NO_AUTH;
+        } else if (!strcasecmp(flag,"may-replicate")) {
+            c->flags |= CMD_MAY_REPLICATE;
+        } else {
+            /* Parse ACL categories here if the flag name starts with @. */
+            uint64_t catflag;
+            if (flag[0] == '@' &&
+                (catflag = ACLGetCommandCategoryFlagByName(flag+1)) != 0)
+            {
+                c->flags |= catflag;
+            } else {
+                sdsfreesplitres(argv,argc);
+                return C_ERR;
+            }
+        }
+    }
+    /* If it's not @fast is @slow in this binary world. */
+    if (!(c->flags & CMD_CATEGORY_FAST)) c->flags |= CMD_CATEGORY_SLOW;
+
+    sdsfreesplitres(argv,argc);
+    return C_OK;
+}
+
+/* Populates the Redis Command Table starting from the hard coded list
+ * we have on top of server.c file. */
+void populateCommandTable(void) {
+    int j;
+    int numcommands = sizeof(redisCommandTable)/sizeof(struct redisCommand);
+
+    for (j = 0; j < numcommands; j++) {
+        struct redisCommand *c = redisCommandTable+j;
+        int retval1, retval2;
+
+        /* Translate the command string flags description into an actual
+         * set of flags. */
+        if (populateCommandTableParseFlags(c,c->sflags) == C_ERR)
+            serverPanic("Unsupported command flag");
+
+        c->id = ACLGetCommandID(c->name); /* Assign the ID used for ACL. */
+        retval1 = dictAdd(server.commands, sdsnew(c->name), c);
+        /* Populate an additional dictionary that will be unaffected
+         * by rename-command statements in redis.conf. */
+        retval2 = dictAdd(server.orig_commands, sdsnew(c->name), c);
+        serverAssert(retval1 == DICT_OK && retval2 == DICT_OK);
+    }
+}
+
+void resetCommandTableStats(void) {
+    struct redisCommand *c;
+    dictEntry *de;
+    dictIterator *di;
+
+    di = dictGetSafeIterator(server.commands);
+    while((de = dictNext(di)) != NULL) {
+        c = (struct redisCommand *) dictGetVal(de);
+        c->microseconds = 0;
+        c->calls = 0;
+        c->rejected_calls = 0;
+        c->failed_calls = 0;
+    }
+    dictReleaseIterator(di);
+
+}
+
+void resetErrorTableStats(void) {
+    raxFreeWithCallback(server.errors, zfree);
+    server.errors = raxNew();
+}
+
+/* ========================== Redis OP Array API ============================ */
+
+void redisOpArrayInit(redisOpArray *oa) {
+    oa->ops = NULL;
+    oa->numops = 0;
+}
+
+int redisOpArrayAppend(redisOpArray *oa, struct redisCommand *cmd, int dbid,
+                       robj **argv, int argc, int target)
+{
+    redisOp *op;
+
+    oa->ops = zrealloc(oa->ops,sizeof(redisOp)*(oa->numops+1));
+    op = oa->ops+oa->numops;
+    op->cmd = cmd;
+    op->dbid = dbid;
+    op->argv = argv;
+    op->argc = argc;
+    op->target = target;
+    oa->numops++;
+    return oa->numops;
+}
+
+void redisOpArrayFree(redisOpArray *oa) {
+    while(oa->numops) {
+        int j;
+        redisOp *op;
+
+        oa->numops--;
+        op = oa->ops+oa->numops;
+        for (j = 0; j < op->argc; j++)
+            decrRefCount(op->argv[j]);
+        zfree(op->argv);
+    }
+    zfree(oa->ops);
+    oa->ops = NULL;
+}
+
+/* ====================== Commands lookup and execution ===================== */
+
+struct redisCommand *lookupCommand(sds name) {
+    return dictFetchValue(server.commands, name);
+}
+
+struct redisCommand *lookupCommandByCString(const char *s) {
+    struct redisCommand *cmd;
+    sds name = sdsnew(s);
+
+    cmd = dictFetchValue(server.commands, name);
+    sdsfree(name);
+    return cmd;
+}
+
+/* Lookup the command in the current table, if not found also check in
+ * the original table containing the original command names unaffected by
+ * redis.conf rename-command statement.
+ *
+ * This is used by functions rewriting the argument vector such as
+ * rewriteClientCommandVector() in order to set client->cmd pointer
+ * correctly even if the command was renamed. */
+struct redisCommand *lookupCommandOrOriginal(sds name) {
+    struct redisCommand *cmd = dictFetchValue(server.commands, name);
+
+    if (!cmd) cmd = dictFetchValue(server.orig_commands,name);
+    return cmd;
+}
+
+/* Propagate the specified command (in the context of the specified database id)
+ * to AOF and Slaves.
+ *
+ * flags are an xor between:
+ * + PROPAGATE_NONE (no propagation of command at all)
+ * + PROPAGATE_AOF (propagate into the AOF file if is enabled)
+ * + PROPAGATE_REPL (propagate into the replication link)
+ *
+ * This should not be used inside commands implementation since it will not
+ * wrap the resulting commands in MULTI/EXEC. Use instead alsoPropagate(),
+ * preventCommandPropagation(), forceCommandPropagation().
+ *
+ * However for functions that need to (also) propagate out of the context of a
+ * command execution, for example when serving a blocked client, you
+ * want to use propagate().
+ */
+void propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,
+               int flags)
+{
+    if (!server.replication_allowed)
+        return;
+
+    /* Propagate a MULTI request once we encounter the first command which
+     * is a write command.
+     * This way we'll deliver the MULTI/..../EXEC block as a whole and
+     * both the AOF and the replication link will have the same consistency
+     * and atomicity guarantees. */
+    if (server.in_exec && !server.propagate_in_transaction)
+        execCommandPropagateMulti(dbid);
+
+    /* This needs to be unreachable since the dataset should be fixed during 
+     * client pause, otherwise data may be lossed during a failover. */
+    serverAssert(!(areClientsPaused() && !server.client_pause_in_transaction));
+
+    if (server.aof_state != AOF_OFF && flags & PROPAGATE_AOF)
+        feedAppendOnlyFile(cmd,dbid,argv,argc);
+    if (flags & PROPAGATE_REPL)
+        replicationFeedSlaves(server.slaves,dbid,argv,argc);
+}
+
+/* Used inside commands to schedule the propagation of additional commands
+ * after the current command is propagated to AOF / Replication.
+ *
+ * 'cmd' must be a pointer to the Redis command to replicate, dbid is the
+ * database ID the command should be propagated into.
+ * Arguments of the command to propagate are passed as an array of redis
+ * objects pointers of len 'argc', using the 'argv' vector.
+ *
+ * The function does not take a reference to the passed 'argv' vector,
+ * so it is up to the caller to release the passed argv (but it is usually
+ * stack allocated).  The function automatically increments ref count of
+ * passed objects, so the caller does not need to. */
+void alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,
+                   int target)
+{
+    robj **argvcopy;
+    int j;
+
+    if (server.loading) return; /* No propagation during loading. */
+
+    argvcopy = zmalloc(sizeof(robj*)*argc);
+    for (j = 0; j < argc; j++) {
+        argvcopy[j] = argv[j];
+        incrRefCount(argv[j]);
+    }
+    redisOpArrayAppend(&server.also_propagate,cmd,dbid,argvcopy,argc,target);
+}
+
+/* It is possible to call the function forceCommandPropagation() inside a
+ * Redis command implementation in order to to force the propagation of a
+ * specific command execution into AOF / Replication. */
+void forceCommandPropagation(client *c, int flags) {
+    serverAssert(c->cmd->flags & (CMD_WRITE | CMD_MAY_REPLICATE));
+    if (flags & PROPAGATE_REPL) c->flags |= CLIENT_FORCE_REPL;
+    if (flags & PROPAGATE_AOF) c->flags |= CLIENT_FORCE_AOF;
+}
+
+/* Avoid that the executed command is propagated at all. This way we
+ * are free to just propagate what we want using the alsoPropagate()
+ * API. */
+void preventCommandPropagation(client *c) {
+    c->flags |= CLIENT_PREVENT_PROP;
+}
+
+/* AOF specific version of preventCommandPropagation(). */
+void preventCommandAOF(client *c) {
+    c->flags |= CLIENT_PREVENT_AOF_PROP;
+}
+
+/* Replication specific version of preventCommandPropagation(). */
+void preventCommandReplication(client *c) {
+    c->flags |= CLIENT_PREVENT_REPL_PROP;
+}
+
+/* Log the last command a client executed into the slowlog. */
+void slowlogPushCurrentCommand(client *c, struct redisCommand *cmd, ustime_t duration) {
+    /* Some commands may contain sensitive data that should not be available in the slowlog. */
+    if (cmd->flags & CMD_SKIP_SLOWLOG)
+        return;
+
+    /* If command argument vector was rewritten, use the original
+     * arguments. */
+    robj **argv = c->original_argv ? c->original_argv : c->argv;
+    int argc = c->original_argv ? c->original_argc : c->argc;
+    slowlogPushEntryIfNeeded(c,argv,argc,duration);
+}
+
+/* Call() is the core of Redis execution of a command.
+ *
+ * The following flags can be passed:
+ * CMD_CALL_NONE        No flags.
+ * CMD_CALL_SLOWLOG     Check command speed and log in the slow log if needed.
+ * CMD_CALL_STATS       Populate command stats.
+ * CMD_CALL_PROPAGATE_AOF   Append command to AOF if it modified the dataset
+ *                          or if the client flags are forcing propagation.
+ * CMD_CALL_PROPAGATE_REPL  Send command to slaves if it modified the dataset
+ *                          or if the client flags are forcing propagation.
+ * CMD_CALL_PROPAGATE   Alias for PROPAGATE_AOF|PROPAGATE_REPL.
+ * CMD_CALL_FULL        Alias for SLOWLOG|STATS|PROPAGATE.
+ *
+ * The exact propagation behavior depends on the client flags.
+ * Specifically:
+ *
+ * 1. If the client flags CLIENT_FORCE_AOF or CLIENT_FORCE_REPL are set
+ *    and assuming the corresponding CMD_CALL_PROPAGATE_AOF/REPL is set
+ *    in the call flags, then the command is propagated even if the
+ *    dataset was not affected by the command.
+ * 2. If the client flags CLIENT_PREVENT_REPL_PROP or CLIENT_PREVENT_AOF_PROP
+ *    are set, the propagation into AOF or to slaves is not performed even
+ *    if the command modified the dataset.
+ *
+ * Note that regardless of the client flags, if CMD_CALL_PROPAGATE_AOF
+ * or CMD_CALL_PROPAGATE_REPL are not set, then respectively AOF or
+ * slaves propagation will never occur.
+ *
+ * Client flags are modified by the implementation of a given command
+ * using the following API:
+ *
+ * forceCommandPropagation(client *c, int flags);
+ * preventCommandPropagation(client *c);
+ * preventCommandAOF(client *c);
+ * preventCommandReplication(client *c);
+ *
+ */
+void call(client *c, int flags) {
+    long long dirty;
+    monotime call_timer;
+    int client_old_flags = c->flags;
+    struct redisCommand *real_cmd = c->cmd;
+    static long long prev_err_count;
+
+    /* Initialization: clear the flags that must be set by the command on
+     * demand, and initialize the array for additional commands propagation. */
+    c->flags &= ~(CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
+    redisOpArray prev_also_propagate = server.also_propagate;
+    redisOpArrayInit(&server.also_propagate);
+
+    /* Call the command. */
+    dirty = server.dirty;
+    prev_err_count = server.stat_total_error_replies;
+
+    /* Update cache time, in case we have nested calls we want to
+     * update only on the first call*/
+    if (server.fixed_time_expire++ == 0) {
+        updateCachedTime(0);
+    }
+
+    elapsedStart(&call_timer);
+    c->cmd->proc(c);
+    const long duration = elapsedUs(call_timer);
+    c->duration = duration;
+    dirty = server.dirty-dirty;
+    if (dirty < 0) dirty = 0;
+
+    /* Update failed command calls if required.
+     * We leverage a static variable (prev_err_count) to retain
+     * the counter across nested function calls and avoid logging
+     * the same error twice. */
+    if ((server.stat_total_error_replies - prev_err_count) > 0) {
+        real_cmd->failed_calls++;
+    }
+
+    /* After executing command, we will close the client after writing entire
+     * reply if it is set 'CLIENT_CLOSE_AFTER_COMMAND' flag. */
+    if (c->flags & CLIENT_CLOSE_AFTER_COMMAND) {
+        c->flags &= ~CLIENT_CLOSE_AFTER_COMMAND;
+        c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+    }
+
+    /* When EVAL is called loading the AOF we don't want commands called
+     * from Lua to go into the slowlog or to populate statistics. */
+    if (server.loading && c->flags & CLIENT_LUA)
+        flags &= ~(CMD_CALL_SLOWLOG | CMD_CALL_STATS);
+
+    /* If the caller is Lua, we want to force the EVAL caller to propagate
+     * the script if the command flag or client flag are forcing the
+     * propagation. */
+    if (c->flags & CLIENT_LUA && server.lua_caller) {
+        if (c->flags & CLIENT_FORCE_REPL)
+            server.lua_caller->flags |= CLIENT_FORCE_REPL;
+        if (c->flags & CLIENT_FORCE_AOF)
+            server.lua_caller->flags |= CLIENT_FORCE_AOF;
+    }
+
+    /* Note: the code below uses the real command that was executed
+     * c->cmd and c->lastcmd may be different, in case of MULTI-EXEC or
+     * re-written commands such as EXPIRE, GEOADD, etc. */
+
+    /* Record the latency this command induced on the main thread.
+     * unless instructed by the caller not to log. (happens when processing
+     * a MULTI-EXEC from inside an AOF). */
+    if (flags & CMD_CALL_SLOWLOG) {
+        char *latency_event = (real_cmd->flags & CMD_FAST) ?
+                               "fast-command" : "command";
+        latencyAddSampleIfNeeded(latency_event,duration/1000);
+    }
+
+    /* Log the command into the Slow log if needed.
+     * If the client is blocked we will handle slowlog when it is unblocked. */
+    if ((flags & CMD_CALL_SLOWLOG) && !(c->flags & CLIENT_BLOCKED))
+        slowlogPushCurrentCommand(c, real_cmd, duration);
+
+    /* Send the command to clients in MONITOR mode if applicable.
+     * Administrative commands are considered too dangerous to be shown. */
+    if (!(c->cmd->flags & (CMD_SKIP_MONITOR|CMD_ADMIN))) {
+        robj **argv = c->original_argv ? c->original_argv : c->argv;
+        int argc = c->original_argv ? c->original_argc : c->argc;
+        replicationFeedMonitors(c,server.monitors,c->db->id,argv,argc);
+    }
+
+    /* Clear the original argv.
+     * If the client is blocked we will handle slowlog when it is unblocked. */
+    if (!(c->flags & CLIENT_BLOCKED))
+        freeClientOriginalArgv(c);
+
+    /* populate the per-command statistics that we show in INFO commandstats. */
+    if (flags & CMD_CALL_STATS) {
+        real_cmd->microseconds += duration;
+        real_cmd->calls++;
+    }
+
+    /* Propagate the command into the AOF and replication link */
+    if (flags & CMD_CALL_PROPAGATE &&
+        (c->flags & CLIENT_PREVENT_PROP) != CLIENT_PREVENT_PROP)
+    {
+        int propagate_flags = PROPAGATE_NONE;
+
+        /* Check if the command operated changes in the data set. If so
+         * set for replication / AOF propagation. */
+        if (dirty) propagate_flags |= (PROPAGATE_AOF|PROPAGATE_REPL);
+
+        /* If the client forced AOF / replication of the command, set
+         * the flags regardless of the command effects on the data set. */
+        if (c->flags & CLIENT_FORCE_REPL) propagate_flags |= PROPAGATE_REPL;
+        if (c->flags & CLIENT_FORCE_AOF) propagate_flags |= PROPAGATE_AOF;
+
+        /* However prevent AOF / replication propagation if the command
+         * implementation called preventCommandPropagation() or similar,
+         * or if we don't have the call() flags to do so. */
+        if (c->flags & CLIENT_PREVENT_REPL_PROP ||
+            !(flags & CMD_CALL_PROPAGATE_REPL))
+                propagate_flags &= ~PROPAGATE_REPL;
+        if (c->flags & CLIENT_PREVENT_AOF_PROP ||
+            !(flags & CMD_CALL_PROPAGATE_AOF))
+                propagate_flags &= ~PROPAGATE_AOF;
+
+        /* Call propagate() only if at least one of AOF / replication
+         * propagation is needed. Note that modules commands handle replication
+         * in an explicit way, so we never replicate them automatically. */
+        if (propagate_flags != PROPAGATE_NONE && !(c->cmd->flags & CMD_MODULE))
+            propagate(c->cmd,c->db->id,c->argv,c->argc,propagate_flags);
+    }
+
+    /* Restore the old replication flags, since call() can be executed
+     * recursively. */
+    c->flags &= ~(CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
+    c->flags |= client_old_flags &
+        (CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
+
+    /* Handle the alsoPropagate() API to handle commands that want to propagate
+     * multiple separated commands. Note that alsoPropagate() is not affected
+     * by CLIENT_PREVENT_PROP flag. */
+    if (server.also_propagate.numops) {
+        int j;
+        redisOp *rop;
+
+        if (flags & CMD_CALL_PROPAGATE) {
+            int multi_emitted = 0;
+            /* Wrap the commands in server.also_propagate array,
+             * but don't wrap it if we are already in MULTI context,
+             * in case the nested MULTI/EXEC.
+             *
+             * And if the array contains only one command, no need to
+             * wrap it, since the single command is atomic. */
+            if (server.also_propagate.numops > 1 &&
+                !(c->cmd->flags & CMD_MODULE) &&
+                !(c->flags & CLIENT_MULTI) &&
+                !(flags & CMD_CALL_NOWRAP))
+            {
+                execCommandPropagateMulti(c->db->id);
+                multi_emitted = 1;
+            }
+
+            for (j = 0; j < server.also_propagate.numops; j++) {
+                rop = &server.also_propagate.ops[j];
+                int target = rop->target;
+                /* Whatever the command wish is, we honor the call() flags. */
+                if (!(flags&CMD_CALL_PROPAGATE_AOF)) target &= ~PROPAGATE_AOF;
+                if (!(flags&CMD_CALL_PROPAGATE_REPL)) target &= ~PROPAGATE_REPL;
+                if (target)
+                    propagate(rop->cmd,rop->dbid,rop->argv,rop->argc,target);
+            }
+
+            if (multi_emitted) {
+                execCommandPropagateExec(c->db->id);
+            }
+        }
+        redisOpArrayFree(&server.also_propagate);
+    }
+    server.also_propagate = prev_also_propagate;
+
+    /* Client pause takes effect after a transaction has finished. This needs
+     * to be located after everything is propagated. */
+    if (!server.in_exec && server.client_pause_in_transaction) {
+        server.client_pause_in_transaction = 0;
+    }
+
+    /* If the client has keys tracking enabled for client side caching,
+     * make sure to remember the keys it fetched via this command. */
+    if (c->cmd->flags & CMD_READONLY) {
+        client *caller = (c->flags & CLIENT_LUA && server.lua_caller) ?
+                            server.lua_caller : c;
+        if (caller->flags & CLIENT_TRACKING &&
+            !(caller->flags & CLIENT_TRACKING_BCAST))
+        {
+            trackingRememberKeys(caller);
+        }
+    }
+
+    server.fixed_time_expire--;
+    server.stat_numcommands++;
+    prev_err_count = server.stat_total_error_replies;
+
+    /* Record peak memory after each command and before the eviction that runs
+     * before the next command. */
+    size_t zmalloc_used = zmalloc_used_memory();
+    if (zmalloc_used > server.stat_peak_memory)
+        server.stat_peak_memory = zmalloc_used;
+}
+
+/* Used when a command that is ready for execution needs to be rejected, due to
+ * varios pre-execution checks. it returns the appropriate error to the client.
+ * If there's a transaction is flags it as dirty, and if the command is EXEC,
+ * it aborts the transaction.
+ * Note: 'reply' is expected to end with \r\n */
+void rejectCommand(client *c, robj *reply) {
+    flagTransaction(c);
+    if (c->cmd) c->cmd->rejected_calls++;
+    if (c->cmd && c->cmd->proc == execCommand) {
+        execCommandAbort(c, reply->ptr);
+    } else {
+        /* using addReplyError* rather than addReply so that the error can be logged. */
+        addReplyErrorObject(c, reply);
+    }
+}
+
+void rejectCommandFormat(client *c, const char *fmt, ...) {
+    if (c->cmd) c->cmd->rejected_calls++;
+    flagTransaction(c);
+    va_list ap;
+    va_start(ap,fmt);
+    sds s = sdscatvprintf(sdsempty(),fmt,ap);
+    va_end(ap);
+    /* Make sure there are no newlines in the string, otherwise invalid protocol
+     * is emitted (The args come from the user, they may contain any character). */
+    sdsmapchars(s, "\r\n", "  ",  2);
+    if (c->cmd && c->cmd->proc == execCommand) {
+        execCommandAbort(c, s);
+        sdsfree(s);
+    } else {
+        /* The following frees 's'. */
+        addReplyErrorSds(c, s);
+    }
+}
+
+/* Returns 1 for commands that may have key names in their arguments, but have
+ * no pre-determined key positions. */
+static int cmdHasMovableKeys(struct redisCommand *cmd) {
+    return (cmd->getkeys_proc && !(cmd->flags & CMD_MODULE)) ||
+            cmd->flags & CMD_MODULE_GETKEYS;
+}
+
+/* If this function gets called we already read a whole
+ * command, arguments are in the client argv/argc fields.
+ * processCommand() execute the command or prepare the
+ * server for a bulk read from the client.
+ *
+ * If C_OK is returned the client is still alive and valid and
+ * other operations can be performed by the caller. Otherwise
+ * if C_ERR is returned the client was destroyed (i.e. after QUIT). */
+int processCommand(client *c) {
+    if (!server.lua_timedout) {
+        /* Both EXEC and EVAL call call() directly so there should be
+         * no way in_exec or in_eval or propagate_in_transaction is 1.
+         * That is unless lua_timedout, in which case client may run
+         * some commands. */
+        serverAssert(!server.propagate_in_transaction);
+        serverAssert(!server.in_exec);
+        serverAssert(!server.in_eval);
+    }
+
+    moduleCallCommandFilters(c);
+
+    /* The QUIT command is handled separately. Normal command procs will
+     * go through checking for replication and QUIT will cause trouble
+     * when FORCE_REPLICATION is enabled and would be implemented in
+     * a regular command proc. */
+    if (!strcasecmp(c->argv[0]->ptr,"quit")) {
+        addReply(c,shared.ok);
+        c->flags |= CLIENT_CLOSE_AFTER_REPLY;
+        return C_ERR;
+    }
+
+    /* Now lookup the command and check ASAP about trivial error conditions
+     * such as wrong arity, bad command name and so forth. */
+    c->cmd = c->lastcmd = lookupCommand(c->argv[0]->ptr);
+    if (!c->cmd) {
+        sds args = sdsempty();
+        int i;
+        for (i=1; i < c->argc && sdslen(args) < 128; i++)
+            args = sdscatprintf(args, "`%.*s`, ", 128-(int)sdslen(args), (char*)c->argv[i]->ptr);
+        rejectCommandFormat(c,"unknown command `%s`, with args beginning with: %s",
+            (char*)c->argv[0]->ptr, args);
+        sdsfree(args);
+        return C_OK;
+    } else if ((c->cmd->arity > 0 && c->cmd->arity != c->argc) ||
+               (c->argc < -c->cmd->arity)) {
+        rejectCommandFormat(c,"wrong number of arguments for '%s' command",
+            c->cmd->name);
+        return C_OK;
+    }
+
+    int is_read_command = (c->cmd->flags & CMD_READONLY) ||
+                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_READONLY));
+    int is_write_command = (c->cmd->flags & CMD_WRITE) ||
+                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_WRITE));
+    int is_denyoom_command = (c->cmd->flags & CMD_DENYOOM) ||
+                             (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_DENYOOM));
+    int is_denystale_command = !(c->cmd->flags & CMD_STALE) ||
+                               (c->cmd->proc == execCommand && (c->mstate.cmd_inv_flags & CMD_STALE));
+    int is_denyloading_command = !(c->cmd->flags & CMD_LOADING) ||
+                                 (c->cmd->proc == execCommand && (c->mstate.cmd_inv_flags & CMD_LOADING));
+    int is_may_replicate_command = (c->cmd->flags & (CMD_WRITE | CMD_MAY_REPLICATE)) ||
+                                   (c->cmd->proc == execCommand && (c->mstate.cmd_flags & (CMD_WRITE | CMD_MAY_REPLICATE)));
+
+    if (authRequired(c)) {
+        /* AUTH and HELLO and no auth commands are valid even in
+         * non-authenticated state. */
+        if (!(c->cmd->flags & CMD_NO_AUTH)) {
+            rejectCommand(c,shared.noautherr);
+            return C_OK;
+        }
+    }
+
+    /* Check if the user can run this command according to the current
+     * ACLs. */
+    int acl_errpos;
+    int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
+    if (acl_retval != ACL_OK) {
+        addACLLogEntry(c,acl_retval,acl_errpos,NULL);
+        switch (acl_retval) {
+        case ACL_DENIED_CMD:
+            rejectCommandFormat(c,
+                "-NOPERM this user has no permissions to run "
+                "the '%s' command or its subcommand", c->cmd->name);
+            break;
+        case ACL_DENIED_KEY:
+            rejectCommandFormat(c,
+                "-NOPERM this user has no permissions to access "
+                "one of the keys used as arguments");
+            break;
+        case ACL_DENIED_CHANNEL:
+            rejectCommandFormat(c,
+                "-NOPERM this user has no permissions to access "
+                "one of the channels used as arguments");
+            break;
+        default:
+            rejectCommandFormat(c, "no permission");
+            break;
+        }
+        return C_OK;
+    }
+
+    /* If cluster is enabled perform the cluster redirection here.
+     * However we don't perform the redirection if:
+     * 1) The sender of this command is our master.
+     * 2) The command has no key arguments. */
+    if (server.cluster_enabled &&
+        !(c->flags & CLIENT_MASTER) &&
+        !(c->flags & CLIENT_LUA &&
+          server.lua_caller->flags & CLIENT_MASTER) &&
+        !(!cmdHasMovableKeys(c->cmd) && c->cmd->firstkey == 0 &&
+          c->cmd->proc != execCommand))
+    {
+        int hashslot;
+        int error_code;
+        clusterNode *n = getNodeByQuery(c,c->cmd,c->argv,c->argc,
+                                        &hashslot,&error_code);
+        if (n == NULL || n != server.cluster->myself) {
+            if (c->cmd->proc == execCommand) {
+                discardTransaction(c);
+            } else {
+                flagTransaction(c);
+            }
+            clusterRedirectClient(c,n,hashslot,error_code);
+            c->cmd->rejected_calls++;
+            return C_OK;
+        }
+    }
+
+    /* Handle the maxmemory directive.
+     *
+     * Note that we do not want to reclaim memory if we are here re-entering
+     * the event loop since there is a busy Lua script running in timeout
+     * condition, to avoid mixing the propagation of scripts with the
+     * propagation of DELs due to eviction. */
+    if (server.maxmemory && !server.lua_timedout) {
+        int out_of_memory = (performEvictions() == EVICT_FAIL);
+        /* performEvictions may flush slave output buffers. This may result
+         * in a slave, that may be the active client, to be freed. */
+        if (server.current_client == NULL) return C_ERR;
+
+        int reject_cmd_on_oom = is_denyoom_command;
+        /* If client is in MULTI/EXEC context, queuing may consume an unlimited
+         * amount of memory, so we want to stop that.
+         * However, we never want to reject DISCARD, or even EXEC (unless it
+         * contains denied commands, in which case is_denyoom_command is already
+         * set. */
+        if (c->flags & CLIENT_MULTI &&
+            c->cmd->proc != execCommand &&
+            c->cmd->proc != discardCommand &&
+            c->cmd->proc != resetCommand) {
+            reject_cmd_on_oom = 1;
+        }
+
+        if (out_of_memory && reject_cmd_on_oom) {
+            rejectCommand(c, shared.oomerr);
+            return C_OK;
+        }
+
+        /* Save out_of_memory result at script start, otherwise if we check OOM
+         * until first write within script, memory used by lua stack and
+         * arguments might interfere. */
+        if (c->cmd->proc == evalCommand || c->cmd->proc == evalShaCommand) {
+            server.lua_oom = out_of_memory;
+        }
+    }
+
+    /* Make sure to use a reasonable amount of memory for client side
+     * caching metadata. */
+    if (server.tracking_clients) trackingLimitUsedSlots();
+
+    /* Don't accept write commands if there are problems persisting on disk
+     * and if this is a master instance. */
+    int deny_write_type = writeCommandsDeniedByDiskError();
+    if (deny_write_type != DISK_ERROR_TYPE_NONE &&
+        server.masterhost == NULL &&
+        (is_write_command ||c->cmd->proc == pingCommand))
+    {
+        if (deny_write_type == DISK_ERROR_TYPE_RDB)
+            rejectCommand(c, shared.bgsaveerr);
+        else
+            rejectCommandFormat(c,
+                "-MISCONF Errors writing to the AOF file: %s",
+                strerror(server.aof_last_write_errno));
+        return C_OK;
+    }
+
+    /* Don't accept write commands if there are not enough good slaves and
+     * user configured the min-slaves-to-write option. */
+    if (server.masterhost == NULL &&
+        server.repl_min_slaves_to_write &&
+        server.repl_min_slaves_max_lag &&
+        is_write_command &&
+        server.repl_good_slaves_count < server.repl_min_slaves_to_write)
+    {
+        rejectCommand(c, shared.noreplicaserr);
+        return C_OK;
+    }
+
+    /* Don't accept write commands if this is a read only slave. But
+     * accept write commands if this is our master. */
+    if (server.masterhost && server.repl_slave_ro &&
+        !(c->flags & CLIENT_MASTER) &&
+        is_write_command)
+    {
+        rejectCommand(c, shared.roslaveerr);
+        return C_OK;
+    }
+
+    /* Only allow a subset of commands in the context of Pub/Sub if the
+     * connection is in RESP2 mode. With RESP3 there are no limits. */
+    if ((c->flags & CLIENT_PUBSUB && c->resp == 2) &&
+        c->cmd->proc != pingCommand &&
+        c->cmd->proc != subscribeCommand &&
+        c->cmd->proc != unsubscribeCommand &&
+        c->cmd->proc != psubscribeCommand &&
+        c->cmd->proc != punsubscribeCommand &&
+        c->cmd->proc != resetCommand) {
+        rejectCommandFormat(c,
+            "Can't execute '%s': only (P)SUBSCRIBE / "
+            "(P)UNSUBSCRIBE / PING / QUIT / RESET are allowed in this context",
+            c->cmd->name);
+        return C_OK;
+    }
+
+    /* Only allow commands with flag "t", such as INFO, SLAVEOF and so on,
+     * when slave-serve-stale-data is no and we are a slave with a broken
+     * link with master. */
+    if (server.masterhost && server.repl_state != REPL_STATE_CONNECTED &&
+        server.repl_serve_stale_data == 0 &&
+        is_denystale_command)
+    {
+        rejectCommand(c, shared.masterdownerr);
+        return C_OK;
+    }
+
+    /* Loading DB? Return an error if the command has not the
+     * CMD_LOADING flag. */
+    if (server.loading && is_denyloading_command) {
+        rejectCommand(c, shared.loadingerr);
+        return C_OK;
+    }
+
+    /* Lua script too slow? Only allow a limited number of commands.
+     * Note that we need to allow the transactions commands, otherwise clients
+     * sending a transaction with pipelining without error checking, may have
+     * the MULTI plus a few initial commands refused, then the timeout
+     * condition resolves, and the bottom-half of the transaction gets
+     * executed, see Github PR #7022. */
+    if (server.lua_timedout &&
+          c->cmd->proc != authCommand &&
+          c->cmd->proc != helloCommand &&
+          c->cmd->proc != replconfCommand &&
+          c->cmd->proc != multiCommand &&
+          c->cmd->proc != discardCommand &&
+          c->cmd->proc != watchCommand &&
+          c->cmd->proc != unwatchCommand &&
+          c->cmd->proc != resetCommand &&
+        !(c->cmd->proc == shutdownCommand &&
+          c->argc == 2 &&
+          tolower(((char*)c->argv[1]->ptr)[0]) == 'n') &&
+        !(c->cmd->proc == scriptCommand &&
+          c->argc == 2 &&
+          tolower(((char*)c->argv[1]->ptr)[0]) == 'k'))
+    {
+        rejectCommand(c, shared.slowscripterr);
+        return C_OK;
+    }
+
+    /* Prevent a replica from sending commands that access the keyspace.
+     * The main objective here is to prevent abuse of client pause check
+     * from which replicas are exempt. */
+    if ((c->flags & CLIENT_SLAVE) && (is_may_replicate_command || is_write_command || is_read_command)) {
+        rejectCommandFormat(c, "Replica can't interract with the keyspace");
+        return C_OK;
+    }
+
+    /* If the server is paused, block the client until
+     * the pause has ended. Replicas are never paused. */
+    if (!(c->flags & CLIENT_SLAVE) && 
+        ((server.client_pause_type == CLIENT_PAUSE_ALL) ||
+        (server.client_pause_type == CLIENT_PAUSE_WRITE && is_may_replicate_command)))
+    {
+        c->bpop.timeout = 0;
+        blockClient(c,BLOCKED_PAUSE);
+        return C_OK;       
+    }
+
+    /* Exec the command */
+    if (c->flags & CLIENT_MULTI &&
+        c->cmd->proc != execCommand && c->cmd->proc != discardCommand &&
+        c->cmd->proc != multiCommand && c->cmd->proc != watchCommand &&
+        c->cmd->proc != resetCommand)
+    {
+        queueMultiCommand(c);
+        addReply(c,shared.queued);
+    } else {
+        call(c,CMD_CALL_FULL);
+        c->woff = server.master_repl_offset;
+        if (listLength(server.ready_keys))
+            handleClientsBlockedOnKeys();
+    }
+
+    return C_OK;
+}
+
+/* ====================== Error lookup and execution ===================== */
+
+void incrementErrorCount(const char *fullerr, size_t namelen) {
+    struct redisError *error = raxFind(server.errors,(unsigned char*)fullerr,namelen);
+    if (error == raxNotFound) {
+        error = zmalloc(sizeof(*error));
+        error->count = 0;
+        raxInsert(server.errors,(unsigned char*)fullerr,namelen,error,NULL);
+    }
+    error->count++;
+}
+
+/*================================== Shutdown =============================== */
+
+/* Close listening sockets. Also unlink the unix domain socket if
+ * unlink_unix_socket is non-zero. */
+void closeListeningSockets(int unlink_unix_socket) {
+    int j;
+
+    for (j = 0; j < server.ipfd.count; j++) close(server.ipfd.fd[j]);
+    for (j = 0; j < server.tlsfd.count; j++) close(server.tlsfd.fd[j]);
+    if (server.sofd != -1) close(server.sofd);
+    if (server.cluster_enabled)
+        for (j = 0; j < server.cfd.count; j++) close(server.cfd.fd[j]);
+    if (unlink_unix_socket && server.unixsocket) {
+        serverLog(LL_NOTICE,"Removing the unix socket file.");
+        unlink(server.unixsocket); /* don't care if this fails */
+    }
+}
+
+int prepareForShutdown(int flags) {
+    /* When SHUTDOWN is called while the server is loading a dataset in
+     * memory we need to make sure no attempt is performed to save
+     * the dataset on shutdown (otherwise it could overwrite the current DB
+     * with half-read data).
+     *
+     * Also when in Sentinel mode clear the SAVE flag and force NOSAVE. */
+    if (server.loading || server.sentinel_mode)
+        flags = (flags & ~SHUTDOWN_SAVE) | SHUTDOWN_NOSAVE;
+
+    int save = flags & SHUTDOWN_SAVE;
+    int nosave = flags & SHUTDOWN_NOSAVE;
+
+    serverLog(LL_WARNING,"User requested shutdown...");
+    if (server.supervised_mode == SUPERVISED_SYSTEMD)
+        redisCommunicateSystemd("STOPPING=1\n");
+
+    /* Kill all the Lua debugger forked sessions. */
+    ldbKillForkedSessions();
+
+    /* Kill the saving child if there is a background saving in progress.
+       We want to avoid race conditions, for instance our saving child may
+       overwrite the synchronous saving did by SHUTDOWN. */
+    if (server.child_type == CHILD_TYPE_RDB) {
+        serverLog(LL_WARNING,"There is a child saving an .rdb. Killing it!");
+        killRDBChild();
+        /* Note that, in killRDBChild normally has backgroundSaveDoneHandler
+         * doing it's cleanup, but in this case this code will not be reached,
+         * so we need to call rdbRemoveTempFile which will close fd(in order
+         * to unlink file actully) in background thread.
+         * The temp rdb file fd may won't be closed when redis exits quickly,
+         * but OS will close this fd when process exits. */
+        rdbRemoveTempFile(server.child_pid, 0);
+    }
+
+    /* Kill module child if there is one. */
+    if (server.child_type == CHILD_TYPE_MODULE) {
+        serverLog(LL_WARNING,"There is a module fork child. Killing it!");
+        TerminateModuleForkChild(server.child_pid,0);
+    }
+
+    if (server.aof_state != AOF_OFF) {
+        /* Kill the AOF saving child as the AOF we already have may be longer
+         * but contains the full dataset anyway. */
+        if (server.child_type == CHILD_TYPE_AOF) {
+            /* If we have AOF enabled but haven't written the AOF yet, don't
+             * shutdown or else the dataset will be lost. */
+            if (server.aof_state == AOF_WAIT_REWRITE) {
+                serverLog(LL_WARNING, "Writing initial AOF, can't exit.");
+                return C_ERR;
+            }
+            serverLog(LL_WARNING,
+                "There is a child rewriting the AOF. Killing it!");
+            killAppendOnlyChild();
+        }
+        /* Append only file: flush buffers and fsync() the AOF at exit */
+        serverLog(LL_NOTICE,"Calling fsync() on the AOF file.");
+        flushAppendOnlyFile(1);
+        if (redis_fsync(server.aof_fd) == -1) {
+            serverLog(LL_WARNING,"Fail to fsync the AOF file: %s.",
+                                 strerror(errno));
+        }
+    }
+
+    /* Create a new RDB file before exiting. */
+    if ((server.saveparamslen > 0 && !nosave) || save) {
+        serverLog(LL_NOTICE,"Saving the final RDB snapshot before exiting.");
+        if (server.supervised_mode == SUPERVISED_SYSTEMD)
+            redisCommunicateSystemd("STATUS=Saving the final RDB snapshot\n");
+        /* Snapshotting. Perform a SYNC SAVE and exit */
+        rdbSaveInfo rsi, *rsiptr;
+        rsiptr = rdbPopulateSaveInfo(&rsi);
+        if (rdbSave(server.rdb_filename,rsiptr) != C_OK) {
+            /* Ooops.. error saving! The best we can do is to continue
+             * operating. Note that if there was a background saving process,
+             * in the next cron() Redis will be notified that the background
+             * saving aborted, handling special stuff like slaves pending for
+             * synchronization... */
+            serverLog(LL_WARNING,"Error trying to save the DB, can't exit.");
+            if (server.supervised_mode == SUPERVISED_SYSTEMD)
+                redisCommunicateSystemd("STATUS=Error trying to save the DB, can't exit.\n");
+            return C_ERR;
+        }
+    }
+
+    /* Fire the shutdown modules event. */
+    moduleFireServerEvent(REDISMODULE_EVENT_SHUTDOWN,0,NULL);
+
+    /* Remove the pid file if possible and needed. */
+    if (server.daemonize || server.pidfile) {
+        serverLog(LL_NOTICE,"Removing the pid file.");
+        unlink(server.pidfile);
+    }
+
+    /* Best effort flush of slave output buffers, so that we hopefully
+     * send them pending writes. */
+    flushSlavesOutputBuffers();
+
+    /* Close the listening sockets. Apparently this allows faster restarts. */
+    closeListeningSockets(1);
+    serverLog(LL_WARNING,"%s is now ready to exit, bye bye...",
+        server.sentinel_mode ? "Sentinel" : "Redis");
+    return C_OK;
+}
+
+/*================================== Commands =============================== */
+
+/* Sometimes Redis cannot accept write commands because there is a persistence
+ * error with the RDB or AOF file, and Redis is configured in order to stop
+ * accepting writes in such situation. This function returns if such a
+ * condition is active, and the type of the condition.
+ *
+ * Function return values:
+ *
+ * DISK_ERROR_TYPE_NONE:    No problems, we can accept writes.
+ * DISK_ERROR_TYPE_AOF:     Don't accept writes: AOF errors.
+ * DISK_ERROR_TYPE_RDB:     Don't accept writes: RDB errors.
+ */
+int writeCommandsDeniedByDiskError(void) {
+    if (server.stop_writes_on_bgsave_err &&
+        server.saveparamslen > 0 &&
+        server.lastbgsave_status == C_ERR)
+    {
+        return DISK_ERROR_TYPE_RDB;
+    } else if (server.aof_state != AOF_OFF) {
+        if (server.aof_last_write_status == C_ERR) {
+            return DISK_ERROR_TYPE_AOF;
+        }
+        /* AOF fsync error. */
+        int aof_bio_fsync_status;
+        atomicGet(server.aof_bio_fsync_status,aof_bio_fsync_status);
+        if (aof_bio_fsync_status == C_ERR) {
+            atomicGet(server.aof_bio_fsync_errno,server.aof_last_write_errno);
+            return DISK_ERROR_TYPE_AOF;
+        }
+    }
+
+    return DISK_ERROR_TYPE_NONE;
+}
+
+/* The PING command. It works in a different way if the client is in
+ * in Pub/Sub mode. */
+void pingCommand(client *c) {
+    /* The command takes zero or one arguments. */
+    if (c->argc > 2) {
+        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",
+            c->cmd->name);
+        return;
+    }
+
+    if (c->flags & CLIENT_PUBSUB && c->resp == 2) {
+        addReply(c,shared.mbulkhdr[2]);
+        addReplyBulkCBuffer(c,"pong",4);
+        if (c->argc == 1)
+            addReplyBulkCBuffer(c,"",0);
+        else
+            addReplyBulk(c,c->argv[1]);
+    } else {
+        if (c->argc == 1)
+            addReply(c,shared.pong);
+        else
+            addReplyBulk(c,c->argv[1]);
+    }
+}
+
+void echoCommand(client *c) {
+    addReplyBulk(c,c->argv[1]);
+}
+
+void timeCommand(client *c) {
+    struct timeval tv;
+
+    /* gettimeofday() can only fail if &tv is a bad address so we
+     * don't check for errors. */
+    gettimeofday(&tv,NULL);
+    addReplyArrayLen(c,2);
+    addReplyBulkLongLong(c,tv.tv_sec);
+    addReplyBulkLongLong(c,tv.tv_usec);
+}
+
+/* Helper function for addReplyCommand() to output flags. */
+int addReplyCommandFlag(client *c, struct redisCommand *cmd, int f, char *reply) {
+    if (cmd->flags & f) {
+        addReplyStatus(c, reply);
+        return 1;
+    }
+    return 0;
+}
+
+/* Output the representation of a Redis command. Used by the COMMAND command. */
+void addReplyCommand(client *c, struct redisCommand *cmd) {
+    if (!cmd) {
+        addReplyNull(c);
+    } else {
+        /* We are adding: command name, arg count, flags, first, last, offset, categories */
+        addReplyArrayLen(c, 7);
+        addReplyBulkCString(c, cmd->name);
+        addReplyLongLong(c, cmd->arity);
+
+        int flagcount = 0;
+        void *flaglen = addReplyDeferredLen(c);
+        flagcount += addReplyCommandFlag(c,cmd,CMD_WRITE, "write");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_READONLY, "readonly");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_DENYOOM, "denyoom");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_ADMIN, "admin");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_PUBSUB, "pubsub");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_NOSCRIPT, "noscript");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_RANDOM, "random");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_SORT_FOR_SCRIPT,"sort_for_script");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_LOADING, "loading");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_STALE, "stale");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_SKIP_MONITOR, "skip_monitor");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_SKIP_SLOWLOG, "skip_slowlog");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_ASKING, "asking");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_FAST, "fast");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_NO_AUTH, "no_auth");
+        flagcount += addReplyCommandFlag(c,cmd,CMD_MAY_REPLICATE, "may_replicate");
+        if (cmdHasMovableKeys(cmd)) {
+            addReplyStatus(c, "movablekeys");
+            flagcount += 1;
+        }
+        setDeferredSetLen(c, flaglen, flagcount);
+
+        addReplyLongLong(c, cmd->firstkey);
+        addReplyLongLong(c, cmd->lastkey);
+        addReplyLongLong(c, cmd->keystep);
+
+        addReplyCommandCategories(c,cmd);
+    }
+}
+
+/* COMMAND <subcommand> <args> */
+void commandCommand(client *c) {
+    dictIterator *di;
+    dictEntry *de;
+
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"(no subcommand)",
+"    Return details about all Redis commands.",
+"COUNT",
+"    Return the total number of commands in this Redis server.",
+"GETKEYS <full-command>",
+"    Return the keys from a full Redis command.",
+"INFO [<command-name> ...]",
+"    Return details about multiple Redis commands.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (c->argc == 1) {
+        addReplyArrayLen(c, dictSize(server.commands));
+        di = dictGetIterator(server.commands);
+        while ((de = dictNext(di)) != NULL) {
+            addReplyCommand(c, dictGetVal(de));
+        }
+        dictReleaseIterator(di);
+    } else if (!strcasecmp(c->argv[1]->ptr, "info")) {
+        int i;
+        addReplyArrayLen(c, c->argc-2);
+        for (i = 2; i < c->argc; i++) {
+            addReplyCommand(c, dictFetchValue(server.commands, c->argv[i]->ptr));
+        }
+    } else if (!strcasecmp(c->argv[1]->ptr, "count") && c->argc == 2) {
+        addReplyLongLong(c, dictSize(server.commands));
+    } else if (!strcasecmp(c->argv[1]->ptr,"getkeys") && c->argc >= 3) {
+        struct redisCommand *cmd = lookupCommand(c->argv[2]->ptr);
+        getKeysResult result = GETKEYS_RESULT_INIT;
+        int j;
+
+        if (!cmd) {
+            addReplyError(c,"Invalid command specified");
+            return;
+        } else if (cmd->getkeys_proc == NULL && cmd->firstkey == 0) {
+            addReplyError(c,"The command has no key arguments");
+            return;
+        } else if ((cmd->arity > 0 && cmd->arity != c->argc-2) ||
+                   ((c->argc-2) < -cmd->arity))
+        {
+            addReplyError(c,"Invalid number of arguments specified for command");
+            return;
+        }
+
+        if (!getKeysFromCommand(cmd,c->argv+2,c->argc-2,&result)) {
+            addReplyError(c,"Invalid arguments specified for command");
+        } else {
+            addReplyArrayLen(c,result.numkeys);
+            for (j = 0; j < result.numkeys; j++) addReplyBulk(c,c->argv[result.keys[j]+2]);
+        }
+        getKeysFreeResult(&result);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* Convert an amount of bytes into a human readable string in the form
+ * of 100B, 2G, 100M, 4K, and so forth. */
+void bytesToHuman(char *s, unsigned long long n) {
+    double d;
+
+    if (n < 1024) {
+        /* Bytes */
+        sprintf(s,"%lluB",n);
+    } else if (n < (1024*1024)) {
+        d = (double)n/(1024);
+        sprintf(s,"%.2fK",d);
+    } else if (n < (1024LL*1024*1024)) {
+        d = (double)n/(1024*1024);
+        sprintf(s,"%.2fM",d);
+    } else if (n < (1024LL*1024*1024*1024)) {
+        d = (double)n/(1024LL*1024*1024);
+        sprintf(s,"%.2fG",d);
+    } else if (n < (1024LL*1024*1024*1024*1024)) {
+        d = (double)n/(1024LL*1024*1024*1024);
+        sprintf(s,"%.2fT",d);
+    } else if (n < (1024LL*1024*1024*1024*1024*1024)) {
+        d = (double)n/(1024LL*1024*1024*1024*1024);
+        sprintf(s,"%.2fP",d);
+    } else {
+        /* Let's hope we never need this */
+        sprintf(s,"%lluB",n);
+    }
+}
+
+/* Characters we sanitize on INFO output to maintain expected format. */
+static char unsafe_info_chars[] = "#:\n\r";
+static char unsafe_info_chars_substs[] = "____";   /* Must be same length as above */
+
+/* Returns a sanitized version of s that contains no unsafe info string chars.
+ * If no unsafe characters are found, simply returns s. Caller needs to
+ * free tmp if it is non-null on return.
+ */
+const char *getSafeInfoString(const char *s, size_t len, char **tmp) {
+    *tmp = NULL;
+    if (mempbrk(s, len, unsafe_info_chars,sizeof(unsafe_info_chars)-1)
+        == NULL) return s;
+    char *new = *tmp = zmalloc(len + 1);
+    memcpy(new, s, len);
+    new[len] = '\0';
+    return memmapchars(new, len, unsafe_info_chars, unsafe_info_chars_substs,
+                       sizeof(unsafe_info_chars)-1);
+}
+
+/* Create the string returned by the INFO command. This is decoupled
+ * by the INFO command itself as we need to report the same information
+ * on memory corruption problems. */
+sds genRedisInfoString(const char *section) {
+    sds info = sdsempty();
+    time_t uptime = server.unixtime-server.stat_starttime;
+    int j;
+    int allsections = 0, defsections = 0, everything = 0, modules = 0;
+    int sections = 0;
+
+    if (section == NULL) section = "default";
+    allsections = strcasecmp(section,"all") == 0;
+    defsections = strcasecmp(section,"default") == 0;
+    everything = strcasecmp(section,"everything") == 0;
+    modules = strcasecmp(section,"modules") == 0;
+    if (everything) allsections = 1;
+
+    /* Server */
+    if (allsections || defsections || !strcasecmp(section,"server")) {
+        static int call_uname = 1;
+        static struct utsname name;
+        char *mode;
+        char *supervised;
+
+        if (server.cluster_enabled) mode = "cluster";
+        else if (server.sentinel_mode) mode = "sentinel";
+        else mode = "standalone";
+
+        if (server.supervised) {
+            if (server.supervised_mode == SUPERVISED_UPSTART) supervised = "upstart";
+            else if (server.supervised_mode == SUPERVISED_SYSTEMD) supervised = "systemd";
+            else supervised = "unknown";
+        } else {
+            supervised = "no";
+        }
+
+        if (sections++) info = sdscat(info,"\r\n");
+
+        if (call_uname) {
+            /* Uname can be slow and is always the same output. Cache it. */
+            uname(&name);
+            call_uname = 0;
+        }
+
+        unsigned int lruclock;
+        atomicGet(server.lruclock,lruclock);
+        info = sdscatfmt(info,
+            "# Server\r\n"
+            "redis_version:%s\r\n"
+            "redis_git_sha1:%s\r\n"
+            "redis_git_dirty:%i\r\n"
+            "redis_build_id:%s\r\n"
+            "redis_mode:%s\r\n"
+            "os:%s %s %s\r\n"
+            "arch_bits:%i\r\n"
+            "multiplexing_api:%s\r\n"
+            "atomicvar_api:%s\r\n"
+            "gcc_version:%i.%i.%i\r\n"
+            "process_id:%I\r\n"
+            "process_supervised:%s\r\n"
+            "run_id:%s\r\n"
+            "tcp_port:%i\r\n"
+            "server_time_usec:%I\r\n"
+            "uptime_in_seconds:%I\r\n"
+            "uptime_in_days:%I\r\n"
+            "hz:%i\r\n"
+            "configured_hz:%i\r\n"
+            "lru_clock:%u\r\n"
+            "executable:%s\r\n"
+            "config_file:%s\r\n"
+            "io_threads_active:%i\r\n",
+            REDIS_VERSION,
+            redisGitSHA1(),
+            strtol(redisGitDirty(),NULL,10) > 0,
+            redisBuildIdString(),
+            mode,
+            name.sysname, name.release, name.machine,
+            server.arch_bits,
+            aeGetApiName(),
+            REDIS_ATOMIC_API,
+#ifdef __GNUC__
+            __GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__,
+#else
+            0,0,0,
+#endif
+            (int64_t) getpid(),
+            supervised,
+            server.runid,
+            server.port ? server.port : server.tls_port,
+            (int64_t)server.ustime,
+            (int64_t)uptime,
+            (int64_t)(uptime/(3600*24)),
+            server.hz,
+            server.config_hz,
+            lruclock,
+            server.executable ? server.executable : "",
+            server.configfile ? server.configfile : "",
+            server.io_threads_active);
+    }
+
+    /* Clients */
+    if (allsections || defsections || !strcasecmp(section,"clients")) {
+        size_t maxin, maxout;
+        getExpansiveClientsInfo(&maxin,&maxout);
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+            "# Clients\r\n"
+            "connected_clients:%lu\r\n"
+            "cluster_connections:%lu\r\n"
+            "maxclients:%u\r\n"
+            "client_recent_max_input_buffer:%zu\r\n"
+            "client_recent_max_output_buffer:%zu\r\n"
+            "blocked_clients:%d\r\n"
+            "tracking_clients:%d\r\n"
+            "clients_in_timeout_table:%llu\r\n",
+            listLength(server.clients)-listLength(server.slaves),
+            getClusterConnectionsCount(),
+            server.maxclients,
+            maxin, maxout,
+            server.blocked_clients,
+            server.tracking_clients,
+            (unsigned long long) raxSize(server.clients_timeout_table));
+    }
+
+    /* Memory */
+    if (allsections || defsections || !strcasecmp(section,"memory")) {
+        char hmem[64];
+        char peak_hmem[64];
+        char total_system_hmem[64];
+        char used_memory_lua_hmem[64];
+        char used_memory_scripts_hmem[64];
+        char used_memory_rss_hmem[64];
+        char maxmemory_hmem[64];
+        size_t zmalloc_used = zmalloc_used_memory();
+        size_t total_system_mem = server.system_memory_size;
+        const char *evict_policy = evictPolicyToString();
+        long long memory_lua = server.lua ? (long long)lua_gc(server.lua,LUA_GCCOUNT,0)*1024 : 0;
+        struct redisMemOverhead *mh = getMemoryOverheadData();
+
+        /* Peak memory is updated from time to time by serverCron() so it
+         * may happen that the instantaneous value is slightly bigger than
+         * the peak value. This may confuse users, so we update the peak
+         * if found smaller than the current memory usage. */
+        if (zmalloc_used > server.stat_peak_memory)
+            server.stat_peak_memory = zmalloc_used;
+
+        bytesToHuman(hmem,zmalloc_used);
+        bytesToHuman(peak_hmem,server.stat_peak_memory);
+        bytesToHuman(total_system_hmem,total_system_mem);
+        bytesToHuman(used_memory_lua_hmem,memory_lua);
+        bytesToHuman(used_memory_scripts_hmem,mh->lua_caches);
+        bytesToHuman(used_memory_rss_hmem,server.cron_malloc_stats.process_rss);
+        bytesToHuman(maxmemory_hmem,server.maxmemory);
+
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+            "# Memory\r\n"
+            "used_memory:%zu\r\n"
+            "used_memory_human:%s\r\n"
+            "used_memory_rss:%zu\r\n"
+            "used_memory_rss_human:%s\r\n"
+            "used_memory_peak:%zu\r\n"
+            "used_memory_peak_human:%s\r\n"
+            "used_memory_peak_perc:%.2f%%\r\n"
+            "used_memory_overhead:%zu\r\n"
+            "used_memory_startup:%zu\r\n"
+            "used_memory_dataset:%zu\r\n"
+            "used_memory_dataset_perc:%.2f%%\r\n"
+            "allocator_allocated:%zu\r\n"
+            "allocator_active:%zu\r\n"
+            "allocator_resident:%zu\r\n"
+            "total_system_memory:%lu\r\n"
+            "total_system_memory_human:%s\r\n"
+            "used_memory_lua:%lld\r\n"
+            "used_memory_lua_human:%s\r\n"
+            "used_memory_scripts:%lld\r\n"
+            "used_memory_scripts_human:%s\r\n"
+            "number_of_cached_scripts:%lu\r\n"
+            "maxmemory:%lld\r\n"
+            "maxmemory_human:%s\r\n"
+            "maxmemory_policy:%s\r\n"
+            "allocator_frag_ratio:%.2f\r\n"
+            "allocator_frag_bytes:%zu\r\n"
+            "allocator_rss_ratio:%.2f\r\n"
+            "allocator_rss_bytes:%zd\r\n"
+            "rss_overhead_ratio:%.2f\r\n"
+            "rss_overhead_bytes:%zd\r\n"
+            "mem_fragmentation_ratio:%.2f\r\n"
+            "mem_fragmentation_bytes:%zd\r\n"
+            "mem_not_counted_for_evict:%zu\r\n"
+            "mem_replication_backlog:%zu\r\n"
+            "mem_clients_slaves:%zu\r\n"
+            "mem_clients_normal:%zu\r\n"
+            "mem_aof_buffer:%zu\r\n"
+            "mem_allocator:%s\r\n"
+            "active_defrag_running:%d\r\n"
+            "lazyfree_pending_objects:%zu\r\n"
+            "lazyfreed_objects:%zu\r\n",
+            zmalloc_used,
+            hmem,
+            server.cron_malloc_stats.process_rss,
+            used_memory_rss_hmem,
+            server.stat_peak_memory,
+            peak_hmem,
+            mh->peak_perc,
+            mh->overhead_total,
+            mh->startup_allocated,
+            mh->dataset,
+            mh->dataset_perc,
+            server.cron_malloc_stats.allocator_allocated,
+            server.cron_malloc_stats.allocator_active,
+            server.cron_malloc_stats.allocator_resident,
+            (unsigned long)total_system_mem,
+            total_system_hmem,
+            memory_lua,
+            used_memory_lua_hmem,
+            (long long) mh->lua_caches,
+            used_memory_scripts_hmem,
+            dictSize(server.lua_scripts),
+            server.maxmemory,
+            maxmemory_hmem,
+            evict_policy,
+            mh->allocator_frag,
+            mh->allocator_frag_bytes,
+            mh->allocator_rss,
+            mh->allocator_rss_bytes,
+            mh->rss_extra,
+            mh->rss_extra_bytes,
+            mh->total_frag,       /* This is the total RSS overhead, including
+                                     fragmentation, but not just it. This field
+                                     (and the next one) is named like that just
+                                     for backward compatibility. */
+            mh->total_frag_bytes,
+            freeMemoryGetNotCountedMemory(),
+            mh->repl_backlog,
+            mh->clients_slaves,
+            mh->clients_normal,
+            mh->aof_buffer,
+            ZMALLOC_LIB,
+            server.active_defrag_running,
+            lazyfreeGetPendingObjectsCount(),
+            lazyfreeGetFreedObjectsCount()
+        );
+        freeMemoryOverheadData(mh);
+    }
+
+    /* Persistence */
+    if (allsections || defsections || !strcasecmp(section,"persistence")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        double fork_perc = 0;
+        if (server.stat_module_progress) {
+            fork_perc = server.stat_module_progress * 100;
+        } else if (server.stat_current_save_keys_total) {
+            fork_perc = ((double)server.stat_current_save_keys_processed / server.stat_current_save_keys_total) * 100;
+        }
+        int aof_bio_fsync_status;
+        atomicGet(server.aof_bio_fsync_status,aof_bio_fsync_status);
+
+        info = sdscatprintf(info,
+            "# Persistence\r\n"
+            "loading:%d\r\n"
+            "current_cow_size:%zu\r\n"
+            "current_cow_size_age:%lu\r\n"
+            "current_fork_perc:%.2f\r\n"
+            "current_save_keys_processed:%zu\r\n"
+            "current_save_keys_total:%zu\r\n"
+            "rdb_changes_since_last_save:%lld\r\n"
+            "rdb_bgsave_in_progress:%d\r\n"
+            "rdb_last_save_time:%jd\r\n"
+            "rdb_last_bgsave_status:%s\r\n"
+            "rdb_last_bgsave_time_sec:%jd\r\n"
+            "rdb_current_bgsave_time_sec:%jd\r\n"
+            "rdb_last_cow_size:%zu\r\n"
+            "aof_enabled:%d\r\n"
+            "aof_rewrite_in_progress:%d\r\n"
+            "aof_rewrite_scheduled:%d\r\n"
+            "aof_last_rewrite_time_sec:%jd\r\n"
+            "aof_current_rewrite_time_sec:%jd\r\n"
+            "aof_last_bgrewrite_status:%s\r\n"
+            "aof_last_write_status:%s\r\n"
+            "aof_last_cow_size:%zu\r\n"
+            "module_fork_in_progress:%d\r\n"
+            "module_fork_last_cow_size:%zu\r\n",
+            (int)server.loading,
+            server.stat_current_cow_bytes,
+            server.stat_current_cow_updated ? (unsigned long) elapsedMs(server.stat_current_cow_updated) / 1000 : 0,
+            fork_perc,
+            server.stat_current_save_keys_processed,
+            server.stat_current_save_keys_total,
+            server.dirty,
+            server.child_type == CHILD_TYPE_RDB,
+            (intmax_t)server.lastsave,
+            (server.lastbgsave_status == C_OK) ? "ok" : "err",
+            (intmax_t)server.rdb_save_time_last,
+            (intmax_t)((server.child_type != CHILD_TYPE_RDB) ?
+                -1 : time(NULL)-server.rdb_save_time_start),
+            server.stat_rdb_cow_bytes,
+            server.aof_state != AOF_OFF,
+            server.child_type == CHILD_TYPE_AOF,
+            server.aof_rewrite_scheduled,
+            (intmax_t)server.aof_rewrite_time_last,
+            (intmax_t)((server.child_type != CHILD_TYPE_AOF) ?
+                -1 : time(NULL)-server.aof_rewrite_time_start),
+            (server.aof_lastbgrewrite_status == C_OK) ? "ok" : "err",
+            (server.aof_last_write_status == C_OK &&
+                aof_bio_fsync_status == C_OK) ? "ok" : "err",
+            server.stat_aof_cow_bytes,
+            server.child_type == CHILD_TYPE_MODULE,
+            server.stat_module_cow_bytes);
+
+        if (server.aof_enabled) {
+            info = sdscatprintf(info,
+                "aof_current_size:%lld\r\n"
+                "aof_base_size:%lld\r\n"
+                "aof_pending_rewrite:%d\r\n"
+                "aof_buffer_length:%zu\r\n"
+                "aof_rewrite_buffer_length:%lu\r\n"
+                "aof_pending_bio_fsync:%llu\r\n"
+                "aof_delayed_fsync:%lu\r\n",
+                (long long) server.aof_current_size,
+                (long long) server.aof_rewrite_base_size,
+                server.aof_rewrite_scheduled,
+                sdslen(server.aof_buf),
+                aofRewriteBufferSize(),
+                bioPendingJobsOfType(BIO_AOF_FSYNC),
+                server.aof_delayed_fsync);
+        }
+
+        if (server.loading) {
+            double perc = 0;
+            time_t eta, elapsed;
+            off_t remaining_bytes = 1;
+
+            if (server.loading_total_bytes) {
+                perc = ((double)server.loading_loaded_bytes / server.loading_total_bytes) * 100;
+                remaining_bytes = server.loading_total_bytes - server.loading_loaded_bytes;
+            } else if(server.loading_rdb_used_mem) {
+                perc = ((double)server.loading_loaded_bytes / server.loading_rdb_used_mem) * 100;
+                remaining_bytes = server.loading_rdb_used_mem - server.loading_loaded_bytes;
+                /* used mem is only a (bad) estimation of the rdb file size, avoid going over 100% */
+                if (perc > 99.99) perc = 99.99;
+                if (remaining_bytes < 1) remaining_bytes = 1;
+            }
+
+            elapsed = time(NULL)-server.loading_start_time;
+            if (elapsed == 0) {
+                eta = 1; /* A fake 1 second figure if we don't have
+                            enough info */
+            } else {
+                eta = (elapsed*remaining_bytes)/(server.loading_loaded_bytes+1);
+            }
+
+            info = sdscatprintf(info,
+                "loading_start_time:%jd\r\n"
+                "loading_total_bytes:%llu\r\n"
+                "loading_rdb_used_mem:%llu\r\n"
+                "loading_loaded_bytes:%llu\r\n"
+                "loading_loaded_perc:%.2f\r\n"
+                "loading_eta_seconds:%jd\r\n",
+                (intmax_t) server.loading_start_time,
+                (unsigned long long) server.loading_total_bytes,
+                (unsigned long long) server.loading_rdb_used_mem,
+                (unsigned long long) server.loading_loaded_bytes,
+                perc,
+                (intmax_t)eta
+            );
+        }
+    }
+
+    /* Stats */
+    if (allsections || defsections || !strcasecmp(section,"stats")) {
+        long long stat_total_reads_processed, stat_total_writes_processed;
+        long long stat_net_input_bytes, stat_net_output_bytes;
+        atomicGet(server.stat_total_reads_processed, stat_total_reads_processed);
+        atomicGet(server.stat_total_writes_processed, stat_total_writes_processed);
+        atomicGet(server.stat_net_input_bytes, stat_net_input_bytes);
+        atomicGet(server.stat_net_output_bytes, stat_net_output_bytes);
+
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+            "# Stats\r\n"
+            "total_connections_received:%lld\r\n"
+            "total_commands_processed:%lld\r\n"
+            "instantaneous_ops_per_sec:%lld\r\n"
+            "total_net_input_bytes:%lld\r\n"
+            "total_net_output_bytes:%lld\r\n"
+            "instantaneous_input_kbps:%.2f\r\n"
+            "instantaneous_output_kbps:%.2f\r\n"
+            "rejected_connections:%lld\r\n"
+            "sync_full:%lld\r\n"
+            "sync_partial_ok:%lld\r\n"
+            "sync_partial_err:%lld\r\n"
+            "expired_keys:%lld\r\n"
+            "expired_stale_perc:%.2f\r\n"
+            "expired_time_cap_reached_count:%lld\r\n"
+            "expire_cycle_cpu_milliseconds:%lld\r\n"
+            "evicted_keys:%lld\r\n"
+            "keyspace_hits:%lld\r\n"
+            "keyspace_misses:%lld\r\n"
+            "pubsub_channels:%ld\r\n"
+            "pubsub_patterns:%lu\r\n"
+            "latest_fork_usec:%lld\r\n"
+            "total_forks:%lld\r\n"
+            "migrate_cached_sockets:%ld\r\n"
+            "slave_expires_tracked_keys:%zu\r\n"
+            "active_defrag_hits:%lld\r\n"
+            "active_defrag_misses:%lld\r\n"
+            "active_defrag_key_hits:%lld\r\n"
+            "active_defrag_key_misses:%lld\r\n"
+            "tracking_total_keys:%lld\r\n"
+            "tracking_total_items:%lld\r\n"
+            "tracking_total_prefixes:%lld\r\n"
+            "unexpected_error_replies:%lld\r\n"
+            "total_error_replies:%lld\r\n"
+            "dump_payload_sanitizations:%lld\r\n"
+            "total_reads_processed:%lld\r\n"
+            "total_writes_processed:%lld\r\n"
+            "io_threaded_reads_processed:%lld\r\n"
+            "io_threaded_writes_processed:%lld\r\n",
+            server.stat_numconnections,
+            server.stat_numcommands,
+            getInstantaneousMetric(STATS_METRIC_COMMAND),
+            stat_net_input_bytes,
+            stat_net_output_bytes,
+            (float)getInstantaneousMetric(STATS_METRIC_NET_INPUT)/1024,
+            (float)getInstantaneousMetric(STATS_METRIC_NET_OUTPUT)/1024,
+            server.stat_rejected_conn,
+            server.stat_sync_full,
+            server.stat_sync_partial_ok,
+            server.stat_sync_partial_err,
+            server.stat_expiredkeys,
+            server.stat_expired_stale_perc*100,
+            server.stat_expired_time_cap_reached_count,
+            server.stat_expire_cycle_time_used/1000,
+            server.stat_evictedkeys,
+            server.stat_keyspace_hits,
+            server.stat_keyspace_misses,
+            dictSize(server.pubsub_channels),
+            dictSize(server.pubsub_patterns),
+            server.stat_fork_time,
+            server.stat_total_forks,
+            dictSize(server.migrate_cached_sockets),
+            getSlaveKeyWithExpireCount(),
+            server.stat_active_defrag_hits,
+            server.stat_active_defrag_misses,
+            server.stat_active_defrag_key_hits,
+            server.stat_active_defrag_key_misses,
+            (unsigned long long) trackingGetTotalKeys(),
+            (unsigned long long) trackingGetTotalItems(),
+            (unsigned long long) trackingGetTotalPrefixes(),
+            server.stat_unexpected_error_replies,
+            server.stat_total_error_replies,
+            server.stat_dump_payload_sanitizations,
+            stat_total_reads_processed,
+            stat_total_writes_processed,
+            server.stat_io_reads_processed,
+            server.stat_io_writes_processed);
+    }
+
+    /* Replication */
+    if (allsections || defsections || !strcasecmp(section,"replication")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+            "# Replication\r\n"
+            "role:%s\r\n",
+            server.masterhost == NULL ? "master" : "slave");
+        if (server.masterhost) {
+            long long slave_repl_offset = 1;
+            long long slave_read_repl_offset = 1;
+
+            if (server.master) {
+                slave_repl_offset = server.master->reploff;
+                slave_read_repl_offset = server.master->read_reploff;
+            } else if (server.cached_master) {
+                slave_repl_offset = server.cached_master->reploff;
+                slave_read_repl_offset = server.cached_master->read_reploff;
+            }
+
+            info = sdscatprintf(info,
+                "master_host:%s\r\n"
+                "master_port:%d\r\n"
+                "master_link_status:%s\r\n"
+                "master_last_io_seconds_ago:%d\r\n"
+                "master_sync_in_progress:%d\r\n"
+                "slave_read_repl_offset:%lld\r\n"
+                "slave_repl_offset:%lld\r\n"
+                ,server.masterhost,
+                server.masterport,
+                (server.repl_state == REPL_STATE_CONNECTED) ?
+                    "up" : "down",
+                server.master ?
+                ((int)(server.unixtime-server.master->lastinteraction)) : -1,
+                server.repl_state == REPL_STATE_TRANSFER,
+                slave_read_repl_offset,
+                slave_repl_offset
+            );
+
+            if (server.repl_state == REPL_STATE_TRANSFER) {
+                double perc = 0;
+                if (server.repl_transfer_size) {
+                    perc = ((double)server.repl_transfer_read / server.repl_transfer_size) * 100;
+                }
+                info = sdscatprintf(info,
+                    "master_sync_total_bytes:%lld\r\n"
+                    "master_sync_read_bytes:%lld\r\n"
+                    "master_sync_left_bytes:%lld\r\n"
+                    "master_sync_perc:%.2f\r\n"
+                    "master_sync_last_io_seconds_ago:%d\r\n",
+                    (long long) server.repl_transfer_size,
+                    (long long) server.repl_transfer_read,
+                    (long long) (server.repl_transfer_size - server.repl_transfer_read),
+                    perc,
+                    (int)(server.unixtime-server.repl_transfer_lastio)
+                );
+            }
+
+            if (server.repl_state != REPL_STATE_CONNECTED) {
+                info = sdscatprintf(info,
+                    "master_link_down_since_seconds:%jd\r\n",
+                    server.repl_down_since ?
+                    (intmax_t)(server.unixtime-server.repl_down_since) : -1);
+            }
+            info = sdscatprintf(info,
+                "slave_priority:%d\r\n"
+                "slave_read_only:%d\r\n"
+                "replica_announced:%d\r\n",
+                server.slave_priority,
+                server.repl_slave_ro,
+                server.replica_announced);
+        }
+
+        info = sdscatprintf(info,
+            "connected_slaves:%lu\r\n",
+            listLength(server.slaves));
+
+        /* If min-slaves-to-write is active, write the number of slaves
+         * currently considered 'good'. */
+        if (server.repl_min_slaves_to_write &&
+            server.repl_min_slaves_max_lag) {
+            info = sdscatprintf(info,
+                "min_slaves_good_slaves:%d\r\n",
+                server.repl_good_slaves_count);
+        }
+
+        if (listLength(server.slaves)) {
+            int slaveid = 0;
+            listNode *ln;
+            listIter li;
+
+            listRewind(server.slaves,&li);
+            while((ln = listNext(&li))) {
+                client *slave = listNodeValue(ln);
+                char *state = NULL;
+                char ip[NET_IP_STR_LEN], *slaveip = slave->slave_addr;
+                int port;
+                long lag = 0;
+
+                if (!slaveip) {
+                    if (connPeerToString(slave->conn,ip,sizeof(ip),&port) == -1)
+                        continue;
+                    slaveip = ip;
+                }
+                switch(slave->replstate) {
+                case SLAVE_STATE_WAIT_BGSAVE_START:
+                case SLAVE_STATE_WAIT_BGSAVE_END:
+                    state = "wait_bgsave";
+                    break;
+                case SLAVE_STATE_SEND_BULK:
+                    state = "send_bulk";
+                    break;
+                case SLAVE_STATE_ONLINE:
+                    state = "online";
+                    break;
+                }
+                if (state == NULL) continue;
+                if (slave->replstate == SLAVE_STATE_ONLINE)
+                    lag = time(NULL) - slave->repl_ack_time;
+
+                info = sdscatprintf(info,
+                    "slave%d:ip=%s,port=%d,state=%s,"
+                    "offset=%lld,lag=%ld\r\n",
+                    slaveid,slaveip,slave->slave_listening_port,state,
+                    slave->repl_ack_off, lag);
+                slaveid++;
+            }
+        }
+        info = sdscatprintf(info,
+            "master_failover_state:%s\r\n"
+            "master_replid:%s\r\n"
+            "master_replid2:%s\r\n"
+            "master_repl_offset:%lld\r\n"
+            "second_repl_offset:%lld\r\n"
+            "repl_backlog_active:%d\r\n"
+            "repl_backlog_size:%lld\r\n"
+            "repl_backlog_first_byte_offset:%lld\r\n"
+            "repl_backlog_histlen:%lld\r\n",
+            getFailoverStateString(),
+            server.replid,
+            server.replid2,
+            server.master_repl_offset,
+            server.second_replid_offset,
+            server.repl_backlog != NULL,
+            server.repl_backlog_size,
+            server.repl_backlog_off,
+            server.repl_backlog_histlen);
+    }
+
+    /* CPU */
+    if (allsections || defsections || !strcasecmp(section,"cpu")) {
+        if (sections++) info = sdscat(info,"\r\n");
+
+        struct rusage self_ru, c_ru;
+        getrusage(RUSAGE_SELF, &self_ru);
+        getrusage(RUSAGE_CHILDREN, &c_ru);
+        info = sdscatprintf(info,
+        "# CPU\r\n"
+        "used_cpu_sys:%ld.%06ld\r\n"
+        "used_cpu_user:%ld.%06ld\r\n"
+        "used_cpu_sys_children:%ld.%06ld\r\n"
+        "used_cpu_user_children:%ld.%06ld\r\n",
+        (long)self_ru.ru_stime.tv_sec, (long)self_ru.ru_stime.tv_usec,
+        (long)self_ru.ru_utime.tv_sec, (long)self_ru.ru_utime.tv_usec,
+        (long)c_ru.ru_stime.tv_sec, (long)c_ru.ru_stime.tv_usec,
+        (long)c_ru.ru_utime.tv_sec, (long)c_ru.ru_utime.tv_usec);
+#ifdef RUSAGE_THREAD
+        struct rusage m_ru;
+        getrusage(RUSAGE_THREAD, &m_ru);
+        info = sdscatprintf(info,
+            "used_cpu_sys_main_thread:%ld.%06ld\r\n"
+            "used_cpu_user_main_thread:%ld.%06ld\r\n",
+            (long)m_ru.ru_stime.tv_sec, (long)m_ru.ru_stime.tv_usec,
+            (long)m_ru.ru_utime.tv_sec, (long)m_ru.ru_utime.tv_usec);
+#endif  /* RUSAGE_THREAD */
+    }
+
+    /* Modules */
+    if (allsections || defsections || !strcasecmp(section,"modules")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,"# Modules\r\n");
+        info = genModulesInfoString(info);
+    }
+
+    /* Command statistics */
+    if (allsections || !strcasecmp(section,"commandstats")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info, "# Commandstats\r\n");
+
+        struct redisCommand *c;
+        dictEntry *de;
+        dictIterator *di;
+        di = dictGetSafeIterator(server.commands);
+        while((de = dictNext(di)) != NULL) {
+            char *tmpsafe;
+            c = (struct redisCommand *) dictGetVal(de);
+            if (!c->calls && !c->failed_calls && !c->rejected_calls)
+                continue;
+            info = sdscatprintf(info,
+                "cmdstat_%s:calls=%lld,usec=%lld,usec_per_call=%.2f"
+                ",rejected_calls=%lld,failed_calls=%lld\r\n",
+                getSafeInfoString(c->name, strlen(c->name), &tmpsafe), c->calls, c->microseconds,
+                (c->calls == 0) ? 0 : ((float)c->microseconds/c->calls),
+                c->rejected_calls, c->failed_calls);
+            if (tmpsafe != NULL) zfree(tmpsafe);
+        }
+        dictReleaseIterator(di);
+    }
+    /* Error statistics */
+    if (allsections || defsections || !strcasecmp(section,"errorstats")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscat(info, "# Errorstats\r\n");
+        raxIterator ri;
+        raxStart(&ri,server.errors);
+        raxSeek(&ri,"^",NULL,0);
+        struct redisError *e;
+        while(raxNext(&ri)) {
+            char *tmpsafe;
+            e = (struct redisError *) ri.data;
+            info = sdscatprintf(info,
+                "errorstat_%.*s:count=%lld\r\n",
+                (int)ri.key_len, getSafeInfoString((char *) ri.key, ri.key_len, &tmpsafe), e->count);
+            if (tmpsafe != NULL) zfree(tmpsafe);
+        }
+        raxStop(&ri);
+    }
+
+    /* Cluster */
+    if (allsections || defsections || !strcasecmp(section,"cluster")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info,
+        "# Cluster\r\n"
+        "cluster_enabled:%d\r\n",
+        server.cluster_enabled);
+    }
+
+    /* Key space */
+    if (allsections || defsections || !strcasecmp(section,"keyspace")) {
+        if (sections++) info = sdscat(info,"\r\n");
+        info = sdscatprintf(info, "# Keyspace\r\n");
+        for (j = 0; j < server.dbnum; j++) {
+            long long keys, vkeys;
+
+            keys = dictSize(server.db[j].dict);
+            vkeys = dictSize(server.db[j].expires);
+            if (keys || vkeys) {
+                info = sdscatprintf(info,
+                    "db%d:keys=%lld,expires=%lld,avg_ttl=%lld\r\n",
+                    j, keys, vkeys, server.db[j].avg_ttl);
+            }
+        }
+    }
+
+    /* Get info from modules.
+     * if user asked for "everything" or "modules", or a specific section
+     * that's not found yet. */
+    if (everything || modules ||
+        (!allsections && !defsections && sections==0)) {
+        info = modulesCollectInfo(info,
+                                  everything || modules ? NULL: section,
+                                  0, /* not a crash report */
+                                  sections);
+    }
+    return info;
+}
+
+void infoCommand(client *c) {
+    char *section = c->argc == 2 ? c->argv[1]->ptr : "default";
+
+    if (c->argc > 2) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+    sds info = genRedisInfoString(section);
+    addReplyVerbatim(c,info,sdslen(info),"txt");
+    sdsfree(info);
+}
+
+void monitorCommand(client *c) {
+    if (c->flags & CLIENT_DENY_BLOCKING) {
+        /**
+         * A client that has CLIENT_DENY_BLOCKING flag on
+         * expects a reply per command and so can't execute MONITOR. */
+        addReplyError(c, "MONITOR isn't allowed for DENY BLOCKING client");
+        return;
+    }
+
+    /* ignore MONITOR if already slave or in monitor mode */
+    if (c->flags & CLIENT_SLAVE) return;
+
+    c->flags |= (CLIENT_SLAVE|CLIENT_MONITOR);
+    listAddNodeTail(server.monitors,c);
+    addReply(c,shared.ok);
+}
+
+/* =================================== Main! ================================ */
+
+int checkIgnoreWarning(const char *warning) {
+    int argc, j;
+    sds *argv = sdssplitargs(server.ignore_warnings, &argc);
+    if (argv == NULL)
+        return 0;
+
+    for (j = 0; j < argc; j++) {
+        char *flag = argv[j];
+        if (!strcasecmp(flag, warning))
+            break;
+    }
+    sdsfreesplitres(argv,argc);
+    return j < argc;
+}
+
+#ifdef __linux__
+int linuxOvercommitMemoryValue(void) {
+    FILE *fp = fopen("/proc/sys/vm/overcommit_memory","r");
+    char buf[64];
+
+    if (!fp) return -1;
+    if (fgets(buf,64,fp) == NULL) {
+        fclose(fp);
+        return -1;
+    }
+    fclose(fp);
+
+    return atoi(buf);
+}
+
+void linuxMemoryWarnings(void) {
+    if (linuxOvercommitMemoryValue() == 0) {
+        serverLog(LL_WARNING,"WARNING overcommit_memory is set to 0! Background save may fail under low memory condition. To fix this issue add 'vm.overcommit_memory = 1' to /etc/sysctl.conf and then reboot or run the command 'sysctl vm.overcommit_memory=1' for this to take effect.");
+    }
+    if (THPIsEnabled() && THPDisable()) {
+        serverLog(LL_WARNING,"WARNING you have Transparent Huge Pages (THP) support enabled in your kernel. This will create latency and memory usage issues with Redis. To fix this issue run the command 'echo madvise > /sys/kernel/mm/transparent_hugepage/enabled' as root, and add it to your /etc/rc.local in order to retain the setting after a reboot. Redis must be restarted after THP is disabled (set to 'madvise' or 'never').");
+    }
+}
+
+#ifdef __arm64__
+
+/* Get size in kilobytes of the Shared_Dirty pages of the calling process for the
+ * memory map corresponding to the provided address, or -1 on error. */
+static int smapsGetSharedDirty(unsigned long addr) {
+    int ret, in_mapping = 0, val = -1;
+    unsigned long from, to;
+    char buf[64];
+    FILE *f;
+
+    f = fopen("/proc/self/smaps", "r");
+    if (!f) return -1;
+
+    while (1) {
+        if (!fgets(buf, sizeof(buf), f))
+            break;
+
+        ret = sscanf(buf, "%lx-%lx", &from, &to);
+        if (ret == 2)
+            in_mapping = from <= addr && addr < to;
+
+        if (in_mapping && !memcmp(buf, "Shared_Dirty:", 13)) {
+            sscanf(buf, "%*s %d", &val);
+            /* If parsing fails, we remain with val == -1 */
+            break;
+        }
+    }
+
+    fclose(f);
+    return val;
+}
+
+/* Older arm64 Linux kernels have a bug that could lead to data corruption
+ * during background save in certain scenarios. This function checks if the
+ * kernel is affected.
+ * The bug was fixed in commit ff1712f953e27f0b0718762ec17d0adb15c9fd0b
+ * titled: "arm64: pgtable: Ensure dirty bit is preserved across pte_wrprotect()"
+ * Return -1 on unexpected test failure, 1 if the kernel seems to be affected,
+ * and 0 otherwise. */
+int linuxMadvFreeForkBugCheck(void) {
+    int ret, pipefd[2] = { -1, -1 };
+    pid_t pid;
+    char *p = NULL, *q;
+    int bug_found = 0;
+    long page_size = sysconf(_SC_PAGESIZE);
+    long map_size = 3 * page_size;
+
+    /* Create a memory map that's in our full control (not one used by the allocator). */
+    p = mmap(NULL, map_size, PROT_READ, MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
+    if (p == MAP_FAILED) {
+        serverLog(LL_WARNING, "Failed to mmap(): %s", strerror(errno));
+        return -1;
+    }
+
+    q = p + page_size;
+
+    /* Split the memory map in 3 pages by setting their protection as RO|RW|RO to prevent
+     * Linux from merging this memory map with adjacent VMAs. */
+    ret = mprotect(q, page_size, PROT_READ | PROT_WRITE);
+    if (ret < 0) {
+        serverLog(LL_WARNING, "Failed to mprotect(): %s", strerror(errno));
+        bug_found = -1;
+        goto exit;
+    }
+
+    /* Write to the page once to make it resident */
+    *(volatile char*)q = 0;
+
+    /* Tell the kernel that this page is free to be reclaimed. */
+#ifndef MADV_FREE
+#define MADV_FREE 8
+#endif
+    ret = madvise(q, page_size, MADV_FREE);
+    if (ret < 0) {
+        /* MADV_FREE is not available on older kernels that are presumably
+         * not affected. */
+        if (errno == EINVAL) goto exit;
+
+        serverLog(LL_WARNING, "Failed to madvise(): %s", strerror(errno));
+        bug_found = -1;
+        goto exit;
+    }
+
+    /* Write to the page after being marked for freeing, this is supposed to take
+     * ownership of that page again. */
+    *(volatile char*)q = 0;
+
+    /* Create a pipe for the child to return the info to the parent. */
+    ret = pipe(pipefd);
+    if (ret < 0) {
+        serverLog(LL_WARNING, "Failed to create pipe: %s", strerror(errno));
+        bug_found = -1;
+        goto exit;
+    }
+
+    /* Fork the process. */
+    pid = fork();
+    if (pid < 0) {
+        serverLog(LL_WARNING, "Failed to fork: %s", strerror(errno));
+        bug_found = -1;
+        goto exit;
+    } else if (!pid) {
+        /* Child: check if the page is marked as dirty, page_size in kb.
+         * A value of 0 means the kernel is affected by the bug. */
+        ret = smapsGetSharedDirty((unsigned long) q);
+        if (!ret)
+            bug_found = 1;
+        else if (ret == -1)     /* Failed to read */
+            bug_found = -1;
+
+        if (write(pipefd[1], &bug_found, sizeof(bug_found)) < 0)
+            serverLog(LL_WARNING, "Failed to write to parent: %s", strerror(errno));
+        exit(0);
+    } else {
+        /* Read the result from the child. */
+        ret = read(pipefd[0], &bug_found, sizeof(bug_found));
+        if (ret < 0) {
+            serverLog(LL_WARNING, "Failed to read from child: %s", strerror(errno));
+            bug_found = -1;
+        }
+
+        /* Reap the child pid. */
+        waitpid(pid, NULL, 0);
+    }
+
+exit:
+    /* Cleanup */
+    if (pipefd[0] != -1) close(pipefd[0]);
+    if (pipefd[1] != -1) close(pipefd[1]);
+    if (p != NULL) munmap(p, map_size);
+
+    return bug_found;
+}
+#endif /* __arm64__ */
+#endif /* __linux__ */
+
+void createPidFile(void) {
+    /* If pidfile requested, but no pidfile defined, use
+     * default pidfile path */
+    if (!server.pidfile) server.pidfile = zstrdup(CONFIG_DEFAULT_PID_FILE);
+
+    /* Try to write the pid file in a best-effort way. */
+    FILE *fp = fopen(server.pidfile,"w");
+    if (fp) {
+        fprintf(fp,"%d\n",(int)getpid());
+        fclose(fp);
+    }
+}
+
+void daemonize(void) {
+    int fd;
+
+    if (fork() != 0) exit(0); /* parent exits */
+    setsid(); /* create a new session */
+
+    /* Every output goes to /dev/null. If Redis is daemonized but
+     * the 'logfile' is set to 'stdout' in the configuration file
+     * it will not log at all. */
+    if ((fd = open("/dev/null", O_RDWR, 0)) != -1) {
+        dup2(fd, STDIN_FILENO);
+        dup2(fd, STDOUT_FILENO);
+        dup2(fd, STDERR_FILENO);
+        if (fd > STDERR_FILENO) close(fd);
+    }
+}
+
+void version(void) {
+    printf("Redis server v=%s sha=%s:%d malloc=%s bits=%d build=%llx\n",
+        REDIS_VERSION,
+        redisGitSHA1(),
+        atoi(redisGitDirty()) > 0,
+        ZMALLOC_LIB,
+        sizeof(long) == 4 ? 32 : 64,
+        (unsigned long long) redisBuildId());
+    exit(0);
+}
+
+void usage(void) {
+    fprintf(stderr,"Usage: ./redis-server [/path/to/redis.conf] [options] [-]\n");
+    fprintf(stderr,"       ./redis-server - (read config from stdin)\n");
+    fprintf(stderr,"       ./redis-server -v or --version\n");
+    fprintf(stderr,"       ./redis-server -h or --help\n");
+    fprintf(stderr,"       ./redis-server --test-memory <megabytes>\n\n");
+    fprintf(stderr,"Examples:\n");
+    fprintf(stderr,"       ./redis-server (run the server with default conf)\n");
+    fprintf(stderr,"       ./redis-server /etc/redis/6379.conf\n");
+    fprintf(stderr,"       ./redis-server --port 7777\n");
+    fprintf(stderr,"       ./redis-server --port 7777 --replicaof 127.0.0.1 8888\n");
+    fprintf(stderr,"       ./redis-server /etc/myredis.conf --loglevel verbose -\n");
+    fprintf(stderr,"       ./redis-server /etc/myredis.conf --loglevel verbose\n\n");
+    fprintf(stderr,"Sentinel mode:\n");
+    fprintf(stderr,"       ./redis-server /etc/sentinel.conf --sentinel\n");
+    exit(1);
+}
+
+void redisAsciiArt(void) {
+#include "asciilogo.h"
+    char *buf = zmalloc(1024*16);
+    char *mode;
+
+    if (server.cluster_enabled) mode = "cluster";
+    else if (server.sentinel_mode) mode = "sentinel";
+    else mode = "standalone";
+
+    /* Show the ASCII logo if: log file is stdout AND stdout is a
+     * tty AND syslog logging is disabled. Also show logo if the user
+     * forced us to do so via redis.conf. */
+    int show_logo = ((!server.syslog_enabled &&
+                      server.logfile[0] == '\0' &&
+                      isatty(fileno(stdout))) ||
+                     server.always_show_logo);
+
+    if (!show_logo) {
+        serverLog(LL_NOTICE,
+            "Running mode=%s, port=%d.",
+            mode, server.port ? server.port : server.tls_port
+        );
+    } else {
+        snprintf(buf,1024*16,ascii_logo,
+            REDIS_VERSION,
+            redisGitSHA1(),
+            strtol(redisGitDirty(),NULL,10) > 0,
+            (sizeof(long) == 8) ? "64" : "32",
+            mode, server.port ? server.port : server.tls_port,
+            (long) getpid()
+        );
+        serverLogRaw(LL_NOTICE|LL_RAW,buf);
+    }
+    zfree(buf);
+}
+
+int changeBindAddr(sds *addrlist, int addrlist_len) {
+    int i;
+    int result = C_OK;
+
+    char *prev_bindaddr[CONFIG_BINDADDR_MAX];
+    int prev_bindaddr_count;
+
+    /* Close old TCP and TLS servers */
+    closeSocketListeners(&server.ipfd);
+    closeSocketListeners(&server.tlsfd);
+
+    /* Keep previous settings */
+    prev_bindaddr_count = server.bindaddr_count;
+    memcpy(prev_bindaddr, server.bindaddr, sizeof(server.bindaddr));
+
+    /* Copy new settings */
+    memset(server.bindaddr, 0, sizeof(server.bindaddr));
+    for (i = 0; i < addrlist_len; i++) {
+        server.bindaddr[i] = zstrdup(addrlist[i]);
+    }
+    server.bindaddr_count = addrlist_len;
+
+    /* Bind to the new port */
+    if ((server.port != 0 && listenToPort(server.port, &server.ipfd) != C_OK) ||
+        (server.tls_port != 0 && listenToPort(server.tls_port, &server.tlsfd) != C_OK)) {
+        serverLog(LL_WARNING, "Failed to bind, trying to restore old listening sockets.");
+
+        /* Restore old bind addresses */
+        for (i = 0; i < addrlist_len; i++) {
+            zfree(server.bindaddr[i]);
+        }
+        memcpy(server.bindaddr, prev_bindaddr, sizeof(server.bindaddr));
+        server.bindaddr_count = prev_bindaddr_count;
+
+        /* Re-Listen TCP and TLS */
+        server.ipfd.count = 0;
+        if (server.port != 0 && listenToPort(server.port, &server.ipfd) != C_OK) {
+            serverPanic("Failed to restore old listening sockets.");
+        }
+
+        server.tlsfd.count = 0;
+        if (server.tls_port != 0 && listenToPort(server.tls_port, &server.tlsfd) != C_OK) {
+            serverPanic("Failed to restore old listening sockets.");
+        }
+
+        result = C_ERR;
+    } else {
+        /* Free old bind addresses */
+        for (i = 0; i < prev_bindaddr_count; i++) {
+            zfree(prev_bindaddr[i]);
+        }
+    }
+
+    /* Create TCP and TLS event handlers */
+    if (createSocketAcceptHandler(&server.ipfd, acceptTcpHandler) != C_OK) {
+        serverPanic("Unrecoverable error creating TCP socket accept handler.");
+    }
+    if (createSocketAcceptHandler(&server.tlsfd, acceptTLSHandler) != C_OK) {
+        serverPanic("Unrecoverable error creating TLS socket accept handler.");
+    }
+
+    if (server.set_proc_title) redisSetProcTitle(NULL);
+
+    return result;
+}
+
+int changeListenPort(int port, socketFds *sfd, aeFileProc *accept_handler) {
+    socketFds new_sfd = {{0}};
+
+    /* Just close the server if port disabled */
+    if (port == 0) {
+        closeSocketListeners(sfd);
+        if (server.set_proc_title) redisSetProcTitle(NULL);
+        return C_OK;
+    }
+
+    /* Bind to the new port */
+    if (listenToPort(port, &new_sfd) != C_OK) {
+        return C_ERR;
+    }
+
+    /* Create event handlers */
+    if (createSocketAcceptHandler(&new_sfd, accept_handler) != C_OK) {
+        closeSocketListeners(&new_sfd);
+        return C_ERR;
+    }
+
+    /* Close old servers */
+    closeSocketListeners(sfd);
+
+    /* Copy new descriptors */
+    sfd->count = new_sfd.count;
+    memcpy(sfd->fd, new_sfd.fd, sizeof(new_sfd.fd));
+
+    if (server.set_proc_title) redisSetProcTitle(NULL);
+
+    return C_OK;
+}
+
+static void sigShutdownHandler(int sig) {
+    char *msg;
+
+    switch (sig) {
+    case SIGINT:
+        msg = "Received SIGINT scheduling shutdown...";
+        break;
+    case SIGTERM:
+        msg = "Received SIGTERM scheduling shutdown...";
+        break;
+    default:
+        msg = "Received shutdown signal, scheduling shutdown...";
+    };
+
+    /* SIGINT is often delivered via Ctrl+C in an interactive session.
+     * If we receive the signal the second time, we interpret this as
+     * the user really wanting to quit ASAP without waiting to persist
+     * on disk. */
+    if (server.shutdown_asap && sig == SIGINT) {
+        serverLogFromHandler(LL_WARNING, "You insist... exiting now.");
+        rdbRemoveTempFile(getpid(), 1);
+        exit(1); /* Exit with an error since this was not a clean shutdown. */
+    } else if (server.loading) {
+        serverLogFromHandler(LL_WARNING, "Received shutdown signal during loading, exiting now.");
+        exit(0);
+    }
+
+    serverLogFromHandler(LL_WARNING, msg);
+    server.shutdown_asap = 1;
+}
+
+void setupSignalHandlers(void) {
+    struct sigaction act;
+
+    /* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction is used.
+     * Otherwise, sa_handler is used. */
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = 0;
+    act.sa_handler = sigShutdownHandler;
+    sigaction(SIGTERM, &act, NULL);
+    sigaction(SIGINT, &act, NULL);
+
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = SA_NODEFER | SA_RESETHAND | SA_SIGINFO;
+    act.sa_sigaction = sigsegvHandler;
+    if(server.crashlog_enabled) {
+        sigaction(SIGSEGV, &act, NULL);
+        sigaction(SIGBUS, &act, NULL);
+        sigaction(SIGFPE, &act, NULL);
+        sigaction(SIGILL, &act, NULL);
+        sigaction(SIGABRT, &act, NULL);
+    }
+    return;
+}
+
+void removeSignalHandlers(void) {
+    struct sigaction act;
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = SA_NODEFER | SA_RESETHAND;
+    act.sa_handler = SIG_DFL;
+    sigaction(SIGSEGV, &act, NULL);
+    sigaction(SIGBUS, &act, NULL);
+    sigaction(SIGFPE, &act, NULL);
+    sigaction(SIGILL, &act, NULL);
+    sigaction(SIGABRT, &act, NULL);
+}
+
+/* This is the signal handler for children process. It is currently useful
+ * in order to track the SIGUSR1, that we send to a child in order to terminate
+ * it in a clean way, without the parent detecting an error and stop
+ * accepting writes because of a write error condition. */
+static void sigKillChildHandler(int sig) {
+    UNUSED(sig);
+    int level = server.in_fork_child == CHILD_TYPE_MODULE? LL_VERBOSE: LL_WARNING;
+    serverLogFromHandler(level, "Received SIGUSR1 in child, exiting now.");
+    exitFromChild(SERVER_CHILD_NOERROR_RETVAL);
+}
+
+void setupChildSignalHandlers(void) {
+    struct sigaction act;
+
+    /* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction is used.
+     * Otherwise, sa_handler is used. */
+    sigemptyset(&act.sa_mask);
+    act.sa_flags = 0;
+    act.sa_handler = sigKillChildHandler;
+    sigaction(SIGUSR1, &act, NULL);
+    return;
+}
+
+/* After fork, the child process will inherit the resources
+ * of the parent process, e.g. fd(socket or flock) etc.
+ * should close the resources not used by the child process, so that if the
+ * parent restarts it can bind/lock despite the child possibly still running. */
+void closeChildUnusedResourceAfterFork() {
+    closeListeningSockets(0);
+    if (server.cluster_enabled && server.cluster_config_file_lock_fd != -1)
+        close(server.cluster_config_file_lock_fd);  /* don't care if this fails */
+
+    /* Clear server.pidfile, this is the parent pidfile which should not
+     * be touched (or deleted) by the child (on exit / crash) */
+    zfree(server.pidfile);
+    server.pidfile = NULL;
+}
+
+/* purpose is one of CHILD_TYPE_ types */
+int redisFork(int purpose) {
+    if (isMutuallyExclusiveChildType(purpose)) {
+        if (hasActiveChildProcess())
+            return -1;
+
+        openChildInfoPipe();
+    }
+
+    int childpid;
+    long long start = ustime();
+    if ((childpid = fork()) == 0) {
+        /* Child */
+        server.in_fork_child = purpose;
+        setOOMScoreAdj(CONFIG_OOM_BGCHILD);
+        setupChildSignalHandlers();
+        closeChildUnusedResourceAfterFork();
+    } else {
+        /* Parent */
+        server.stat_total_forks++;
+        server.stat_fork_time = ustime()-start;
+        server.stat_fork_rate = (double) zmalloc_used_memory() * 1000000 / server.stat_fork_time / (1024*1024*1024); /* GB per second. */
+        latencyAddSampleIfNeeded("fork",server.stat_fork_time/1000);
+        if (childpid == -1) {
+            if (isMutuallyExclusiveChildType(purpose)) closeChildInfoPipe();
+            return -1;
+        }
+
+        /* The child_pid and child_type are only for mutual exclusive children.
+         * other child types should handle and store their pid's in dedicated variables.
+         *
+         * Today, we allows CHILD_TYPE_LDB to run in parallel with the other fork types:
+         * - it isn't used for production, so it will not make the server be less efficient
+         * - used for debugging, and we don't want to block it from running while other
+         *   forks are running (like RDB and AOF) */
+        if (isMutuallyExclusiveChildType(purpose)) {
+            server.child_pid = childpid;
+            server.child_type = purpose;
+            server.stat_current_cow_bytes = 0;
+            server.stat_current_cow_updated = 0;
+            server.stat_current_save_keys_processed = 0;
+            server.stat_module_progress = 0;
+            server.stat_current_save_keys_total = dbTotalServerKeyCount();
+        }
+
+        updateDictResizePolicy();
+        moduleFireServerEvent(REDISMODULE_EVENT_FORK_CHILD,
+                              REDISMODULE_SUBEVENT_FORK_CHILD_BORN,
+                              NULL);
+    }
+    return childpid;
+}
+
+void sendChildCowInfo(childInfoType info_type, char *pname) {
+    sendChildInfoGeneric(info_type, 0, -1, pname);
+}
+
+void sendChildInfo(childInfoType info_type, size_t keys, char *pname) {
+    sendChildInfoGeneric(info_type, keys, -1, pname);
+}
+
+void memtest(size_t megabytes, int passes);
+
+/* Returns 1 if there is --sentinel among the arguments or if
+ * argv[0] contains "redis-sentinel". */
+int checkForSentinelMode(int argc, char **argv) {
+    int j;
+
+    if (strstr(argv[0],"redis-sentinel") != NULL) return 1;
+    for (j = 1; j < argc; j++)
+        if (!strcmp(argv[j],"--sentinel")) return 1;
+    return 0;
+}
+
+/* Function called at startup to load RDB or AOF file in memory. */
+void loadDataFromDisk(void) {
+    long long start = ustime();
+    if (server.aof_state == AOF_ON) {
+        if (loadAppendOnlyFile(server.aof_filename) == C_OK)
+            serverLog(LL_NOTICE,"DB loaded from append only file: %.3f seconds",(float)(ustime()-start)/1000000);
+    } else {
+        rdbSaveInfo rsi = RDB_SAVE_INFO_INIT;
+        errno = 0; /* Prevent a stale value from affecting error checking */
+        if (rdbLoad(server.rdb_filename,&rsi,RDBFLAGS_NONE) == C_OK) {
+            serverLog(LL_NOTICE,"DB loaded from disk: %.3f seconds",
+                (float)(ustime()-start)/1000000);
+
+            /* Restore the replication ID / offset from the RDB file. */
+            if ((server.masterhost ||
+                (server.cluster_enabled &&
+                nodeIsSlave(server.cluster->myself))) &&
+                rsi.repl_id_is_set &&
+                rsi.repl_offset != -1 &&
+                /* Note that older implementations may save a repl_stream_db
+                 * of -1 inside the RDB file in a wrong way, see more
+                 * information in function rdbPopulateSaveInfo. */
+                rsi.repl_stream_db != -1)
+            {
+                memcpy(server.replid,rsi.repl_id,sizeof(server.replid));
+                server.master_repl_offset = rsi.repl_offset;
+                /* If we are a slave, create a cached master from this
+                 * information, in order to allow partial resynchronizations
+                 * with masters. */
+                replicationCacheMasterUsingMyself();
+                selectDb(server.cached_master,rsi.repl_stream_db);
+            }
+        } else if (errno != ENOENT) {
+            serverLog(LL_WARNING,"Fatal error loading the DB: %s. Exiting.",strerror(errno));
+            exit(1);
+        }
+    }
+}
+
+void redisOutOfMemoryHandler(size_t allocation_size) {
+    serverLog(LL_WARNING,"Out Of Memory allocating %zu bytes!",
+        allocation_size);
+    serverPanic("Redis aborting for OUT OF MEMORY. Allocating %zu bytes!",
+        allocation_size);
+}
+
+/* Callback for sdstemplate on proc-title-template. See redis.conf for
+ * supported variables.
+ */
+static sds redisProcTitleGetVariable(const sds varname, void *arg)
+{
+    if (!strcmp(varname, "title")) {
+        return sdsnew(arg);
+    } else if (!strcmp(varname, "listen-addr")) {
+        if (server.port || server.tls_port)
+            return sdscatprintf(sdsempty(), "%s:%u",
+                                server.bindaddr_count ? server.bindaddr[0] : "*",
+                                server.port ? server.port : server.tls_port);
+        else
+            return sdscatprintf(sdsempty(), "unixsocket:%s", server.unixsocket);
+    } else if (!strcmp(varname, "server-mode")) {
+        if (server.cluster_enabled) return sdsnew("[cluster]");
+        else if (server.sentinel_mode) return sdsnew("[sentinel]");
+        else return sdsempty();
+    } else if (!strcmp(varname, "config-file")) {
+        return sdsnew(server.configfile ? server.configfile : "-");
+    } else if (!strcmp(varname, "port")) {
+        return sdscatprintf(sdsempty(), "%u", server.port);
+    } else if (!strcmp(varname, "tls-port")) {
+        return sdscatprintf(sdsempty(), "%u", server.tls_port);
+    } else if (!strcmp(varname, "unixsocket")) {
+        return sdsnew(server.unixsocket);
+    } else
+        return NULL;    /* Unknown variable name */
+}
+
+/* Expand the specified proc-title-template string and return a newly
+ * allocated sds, or NULL. */
+static sds expandProcTitleTemplate(const char *template, const char *title) {
+    sds res = sdstemplate(template, redisProcTitleGetVariable, (void *) title);
+    if (!res)
+        return NULL;
+    return sdstrim(res, " ");
+}
+/* Validate the specified template, returns 1 if valid or 0 otherwise. */
+int validateProcTitleTemplate(const char *template) {
+    int ok = 1;
+    sds res = expandProcTitleTemplate(template, "");
+    if (!res)
+        return 0;
+    if (sdslen(res) == 0) ok = 0;
+    sdsfree(res);
+    return ok;
+}
+
+int redisSetProcTitle(char *title) {
+#ifdef USE_SETPROCTITLE
+    if (!title) title = server.exec_argv[0];
+    sds proc_title = expandProcTitleTemplate(server.proc_title_template, title);
+    if (!proc_title) return C_ERR;  /* Not likely, proc_title_template is validated */
+
+    setproctitle("%s", proc_title);
+    sdsfree(proc_title);
+#else
+    UNUSED(title);
+#endif
+
+    return C_OK;
+}
+
+void redisSetCpuAffinity(const char *cpulist) {
+#ifdef USE_SETCPUAFFINITY
+    setcpuaffinity(cpulist);
+#else
+    UNUSED(cpulist);
+#endif
+}
+
+/* Send a notify message to systemd. Returns sd_notify return code which is
+ * a positive number on success. */
+int redisCommunicateSystemd(const char *sd_notify_msg) {
+#ifdef HAVE_LIBSYSTEMD
+    int ret = sd_notify(0, sd_notify_msg);
+
+    if (ret == 0)
+        serverLog(LL_WARNING, "systemd supervision error: NOTIFY_SOCKET not found!");
+    else if (ret < 0)
+        serverLog(LL_WARNING, "systemd supervision error: sd_notify: %d", ret);
+    return ret;
+#else
+    UNUSED(sd_notify_msg);
+    return 0;
+#endif
+}
+
+/* Attempt to set up upstart supervision. Returns 1 if successful. */
+static int redisSupervisedUpstart(void) {
+    const char *upstart_job = getenv("UPSTART_JOB");
+
+    if (!upstart_job) {
+        serverLog(LL_WARNING,
+                "upstart supervision requested, but UPSTART_JOB not found!");
+        return 0;
+    }
+
+    serverLog(LL_NOTICE, "supervised by upstart, will stop to signal readiness.");
+    raise(SIGSTOP);
+    unsetenv("UPSTART_JOB");
+    return 1;
+}
+
+/* Attempt to set up systemd supervision. Returns 1 if successful. */
+static int redisSupervisedSystemd(void) {
+#ifndef HAVE_LIBSYSTEMD
+    serverLog(LL_WARNING,
+            "systemd supervision requested or auto-detected, but Redis is compiled without libsystemd support!");
+    return 0;
+#else
+    if (redisCommunicateSystemd("STATUS=Redis is loading...\n") <= 0)
+        return 0;
+    serverLog(LL_NOTICE,
+        "Supervised by systemd. Please make sure you set appropriate values for TimeoutStartSec and TimeoutStopSec in your service unit.");
+    return 1;
+#endif
+}
+
+int redisIsSupervised(int mode) {
+    int ret = 0;
+
+    if (mode == SUPERVISED_AUTODETECT) {
+        if (getenv("UPSTART_JOB")) {
+            serverLog(LL_VERBOSE, "Upstart supervision detected.");
+            mode = SUPERVISED_UPSTART;
+        } else if (getenv("NOTIFY_SOCKET")) {
+            serverLog(LL_VERBOSE, "Systemd supervision detected.");
+            mode = SUPERVISED_SYSTEMD;
+        }
+    }
+
+    switch (mode) {
+        case SUPERVISED_UPSTART:
+            ret = redisSupervisedUpstart();
+            break;
+        case SUPERVISED_SYSTEMD:
+            ret = redisSupervisedSystemd();
+            break;
+        default:
+            break;
+    }
+
+    if (ret)
+        server.supervised_mode = mode;
+
+    return ret;
+}
+
+int iAmMaster(void) {
+    return ((!server.cluster_enabled && server.masterhost == NULL) ||
+            (server.cluster_enabled && nodeIsMaster(server.cluster->myself)));
+}
+
+#ifdef REDIS_TEST
+typedef int redisTestProc(int argc, char **argv, int accurate);
+struct redisTest {
+    char *name;
+    redisTestProc *proc;
+    int failed;
+} redisTests[] = {
+    {"ziplist", ziplistTest},
+    {"quicklist", quicklistTest},
+    {"intset", intsetTest},
+    {"zipmap", zipmapTest},
+    {"sha1test", sha1Test},
+    {"util", utilTest},
+    {"endianconv", endianconvTest},
+    {"crc64", crc64Test},
+    {"zmalloc", zmalloc_test},
+    {"sds", sdsTest},
+    {"dict", dictTest}
+};
+redisTestProc *getTestProcByName(const char *name) {
+    int numtests = sizeof(redisTests)/sizeof(struct redisTest);
+    for (int j = 0; j < numtests; j++) {
+        if (!strcasecmp(name,redisTests[j].name)) {
+            return redisTests[j].proc;
+        }
+    }
+    return NULL;
+}
+#endif
+
+int main(int argc, char **argv) {
+    struct timeval tv;
+    int j;
+    char config_from_stdin = 0;
+
+#ifdef REDIS_TEST
+    if (argc >= 3 && !strcasecmp(argv[1], "test")) {
+        int accurate = 0;
+        for (j = 3; j < argc; j++) {
+            if (!strcasecmp(argv[j], "--accurate")) {
+                accurate = 1;
+            }
+        }
+
+        if (!strcasecmp(argv[2], "all")) {
+            int numtests = sizeof(redisTests)/sizeof(struct redisTest);
+            for (j = 0; j < numtests; j++) {
+                redisTests[j].failed = (redisTests[j].proc(argc,argv,accurate) != 0);
+            }
+
+            /* Report tests result */
+            int failed_num = 0;
+            for (j = 0; j < numtests; j++) {
+                if (redisTests[j].failed) {
+                    failed_num++;
+                    printf("[failed] Test - %s\n", redisTests[j].name);
+                } else {
+                    printf("[ok] Test - %s\n", redisTests[j].name);
+                }
+            }
+
+            printf("%d tests, %d passed, %d failed\n", numtests,
+                   numtests-failed_num, failed_num);
+
+            return failed_num == 0 ? 0 : 1;
+        } else {
+            redisTestProc *proc = getTestProcByName(argv[2]);
+            if (!proc) return -1; /* test not found */
+            return proc(argc,argv,accurate);
+        }
+
+        return 0;
+    }
+#endif
+
+    /* We need to initialize our libraries, and the server configuration. */
+#ifdef INIT_SETPROCTITLE_REPLACEMENT
+    spt_init(argc, argv);
+#endif
+    setlocale(LC_COLLATE,"");
+    tzset(); /* Populates 'timezone' global. */
+    zmalloc_set_oom_handler(redisOutOfMemoryHandler);
+    srand(time(NULL)^getpid());
+    srandom(time(NULL)^getpid());
+    gettimeofday(&tv,NULL);
+    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
+    crc64_init();
+
+    /* Store umask value. Because umask(2) only offers a set-and-get API we have
+     * to reset it and restore it back. We do this early to avoid a potential
+     * race condition with threads that could be creating files or directories.
+     */
+    umask(server.umask = umask(0777));
+
+    uint8_t hashseed[16];
+    getRandomBytes(hashseed,sizeof(hashseed));
+    dictSetHashFunctionSeed(hashseed);
+    server.sentinel_mode = checkForSentinelMode(argc,argv);
+    initServerConfig();
+    ACLInit(); /* The ACL subsystem must be initialized ASAP because the
+                  basic networking code and client creation depends on it. */
+    moduleInitModulesSystem();
+    tlsInit();
+
+    /* Store the executable path and arguments in a safe place in order
+     * to be able to restart the server later. */
+    server.executable = getAbsolutePath(argv[0]);
+    server.exec_argv = zmalloc(sizeof(char*)*(argc+1));
+    server.exec_argv[argc] = NULL;
+    for (j = 0; j < argc; j++) server.exec_argv[j] = zstrdup(argv[j]);
+
+    /* We need to init sentinel right now as parsing the configuration file
+     * in sentinel mode will have the effect of populating the sentinel
+     * data structures with master nodes to monitor. */
+    if (server.sentinel_mode) {
+        initSentinelConfig();
+        initSentinel();
+    }
+
+    /* Check if we need to start in redis-check-rdb/aof mode. We just execute
+     * the program main. However the program is part of the Redis executable
+     * so that we can easily execute an RDB check on loading errors. */
+    if (strstr(argv[0],"redis-check-rdb") != NULL)
+        redis_check_rdb_main(argc,argv,NULL);
+    else if (strstr(argv[0],"redis-check-aof") != NULL)
+        redis_check_aof_main(argc,argv);
+
+    if (argc >= 2) {
+        j = 1; /* First option to parse in argv[] */
+        sds options = sdsempty();
+
+        /* Handle special options --help and --version */
+        if (strcmp(argv[1], "-v") == 0 ||
+            strcmp(argv[1], "--version") == 0) version();
+        if (strcmp(argv[1], "--help") == 0 ||
+            strcmp(argv[1], "-h") == 0) usage();
+        if (strcmp(argv[1], "--test-memory") == 0) {
+            if (argc == 3) {
+                memtest(atoi(argv[2]),50);
+                exit(0);
+            } else {
+                fprintf(stderr,"Please specify the amount of memory to test in megabytes.\n");
+                fprintf(stderr,"Example: ./redis-server --test-memory 4096\n\n");
+                exit(1);
+            }
+        }
+        /* Parse command line options
+         * Precedence wise, File, stdin, explicit options -- last config is the one that matters.
+         *
+         * First argument is the config file name? */
+        if (argv[1][0] != '-') {
+            /* Replace the config file in server.exec_argv with its absolute path. */
+            server.configfile = getAbsolutePath(argv[1]);
+            zfree(server.exec_argv[1]);
+            server.exec_argv[1] = zstrdup(server.configfile);
+            j = 2; // Skip this arg when parsing options
+        }
+        while(j < argc) {
+            /* Either first or last argument - Should we read config from stdin? */
+            if (argv[j][0] == '-' && argv[j][1] == '\0' && (j == 1 || j == argc-1)) {
+                config_from_stdin = 1;
+            }
+            /* All the other options are parsed and conceptually appended to the
+             * configuration file. For instance --port 6380 will generate the
+             * string "port 6380\n" to be parsed after the actual config file
+             * and stdin input are parsed (if they exist). */
+            else if (argv[j][0] == '-' && argv[j][1] == '-') {
+                /* Option name */
+                if (sdslen(options)) options = sdscat(options,"\n");
+                options = sdscat(options,argv[j]+2);
+                options = sdscat(options," ");
+            } else {
+                /* Option argument */
+                options = sdscatrepr(options,argv[j],strlen(argv[j]));
+                options = sdscat(options," ");
+            }
+            j++;
+        }
+
+        loadServerConfig(server.configfile, config_from_stdin, options);
+        if (server.sentinel_mode) loadSentinelConfigFromQueue();
+        sdsfree(options);
+    }
+    if (server.sentinel_mode) sentinelCheckConfigFile();
+    server.supervised = redisIsSupervised(server.supervised_mode);
+    int background = server.daemonize && !server.supervised;
+    if (background) daemonize();
+
+    serverLog(LL_WARNING, "oO0OoO0OoO0Oo Redis is starting oO0OoO0OoO0Oo");
+    serverLog(LL_WARNING,
+        "Redis version=%s, bits=%d, commit=%s, modified=%d, pid=%d, just started",
+            REDIS_VERSION,
+            (sizeof(long) == 8) ? 64 : 32,
+            redisGitSHA1(),
+            strtol(redisGitDirty(),NULL,10) > 0,
+            (int)getpid());
+
+    if (argc == 1) {
+        serverLog(LL_WARNING, "Warning: no config file specified, using the default config. In order to specify a config file use %s /path/to/redis.conf", argv[0]);
+    } else {
+        serverLog(LL_WARNING, "Configuration loaded");
+    }
+
+    readOOMScoreAdj();
+    initServer();
+    if (background || server.pidfile) createPidFile();
+    if (server.set_proc_title) redisSetProcTitle(NULL);
+    redisAsciiArt();
+    checkTcpBacklogSettings();
+
+    if (!server.sentinel_mode) {
+        /* Things not needed when running in Sentinel mode. */
+        serverLog(LL_WARNING,"Server initialized");
+    #ifdef __linux__
+        linuxMemoryWarnings();
+    #if defined (__arm64__)
+        int ret;
+        if ((ret = linuxMadvFreeForkBugCheck())) {
+            if (ret == 1)
+                serverLog(LL_WARNING,"WARNING Your kernel has a bug that could lead to data corruption during background save. "
+                                     "Please upgrade to the latest stable kernel.");
+            else
+                serverLog(LL_WARNING, "Failed to test the kernel for a bug that could lead to data corruption during background save. "
+                                      "Your system could be affected, please report this error.");
+            if (!checkIgnoreWarning("ARM64-COW-BUG")) {
+                serverLog(LL_WARNING,"Redis will now exit to prevent data corruption. "
+                                     "Note that it is possible to suppress this warning by setting the following config: ignore-warnings ARM64-COW-BUG");
+                exit(1);
+            }
+        }
+    #endif /* __arm64__ */
+    #endif /* __linux__ */
+        moduleInitModulesSystemLast();
+        moduleLoadFromQueue();
+        ACLLoadUsersAtStartup();
+        InitServerLast();
+        loadDataFromDisk();
+        if (server.cluster_enabled) {
+            if (verifyClusterConfigWithData() == C_ERR) {
+                serverLog(LL_WARNING,
+                    "You can't have keys in a DB different than DB 0 when in "
+                    "Cluster mode. Exiting.");
+                exit(1);
+            }
+        }
+        if (server.ipfd.count > 0 || server.tlsfd.count > 0)
+            serverLog(LL_NOTICE,"Ready to accept connections");
+        if (server.sofd > 0)
+            serverLog(LL_NOTICE,"The server is now ready to accept connections at %s", server.unixsocket);
+        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
+            if (!server.masterhost) {
+                redisCommunicateSystemd("STATUS=Ready to accept connections\n");
+            } else {
+                redisCommunicateSystemd("STATUS=Ready to accept connections in read-only mode. Waiting for MASTER <-> REPLICA sync\n");
+            }
+            redisCommunicateSystemd("READY=1\n");
+        }
+    } else {
+        ACLLoadUsersAtStartup();
+        InitServerLast();
+        sentinelIsRunning();
+        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
+            redisCommunicateSystemd("STATUS=Ready to accept connections\n");
+            redisCommunicateSystemd("READY=1\n");
+        }
+    }
+
+    /* Warning the user about suspicious maxmemory setting. */
+    if (server.maxmemory > 0 && server.maxmemory < 1024*1024) {
+        serverLog(LL_WARNING,"WARNING: You specified a maxmemory value that is less than 1MB (current value is %llu bytes). Are you sure this is what you really want?", server.maxmemory);
+    }
+
+    redisSetCpuAffinity(server.server_cpulist);
+    setOOMScoreAdj(-1);
+
+    aeMain(server.el);
+    aeDeleteEventLoop(server.el);
+    return 0;
+}
+
+/* The End */
diff --git a/redis-stable/src/server.h b/redis-stable/src/server.h
new file mode 100644
index 00000000..4edb7d3a
--- /dev/null
+++ b/redis-stable/src/server.h
@@ -0,0 +1,2759 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __REDIS_H
+#define __REDIS_H
+
+#include "fmacros.h"
+#include "config.h"
+#include "solarisfixes.h"
+#include "rio.h"
+#include "atomicvar.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <limits.h>
+#include <unistd.h>
+#include <errno.h>
+#include <inttypes.h>
+#include <pthread.h>
+#include <syslog.h>
+#include <netinet/in.h>
+#include <sys/socket.h>
+#include <lua.h>
+#include <signal.h>
+
+#ifdef HAVE_LIBSYSTEMD
+#include <systemd/sd-daemon.h>
+#endif
+
+typedef long long mstime_t; /* millisecond time type. */
+typedef long long ustime_t; /* microsecond time type. */
+
+#include "ae.h"      /* Event driven programming library */
+#include "sds.h"     /* Dynamic safe strings */
+#include "dict.h"    /* Hash tables */
+#include "adlist.h"  /* Linked lists */
+#include "zmalloc.h" /* total memory usage aware version of malloc/free */
+#include "anet.h"    /* Networking the easy way */
+#include "ziplist.h" /* Compact list data structure */
+#include "intset.h"  /* Compact integer set structure */
+#include "version.h" /* Version macro */
+#include "util.h"    /* Misc functions useful in many places */
+#include "latency.h" /* Latency monitor API */
+#include "sparkline.h" /* ASCII graphs API */
+#include "quicklist.h"  /* Lists are encoded as linked lists of
+                           N-elements flat arrays */
+#include "rax.h"     /* Radix tree */
+#include "connection.h" /* Connection abstraction */
+
+#define REDISMODULE_CORE 1
+#include "redismodule.h"    /* Redis modules API defines. */
+
+/* Following includes allow test functions to be called from Redis main() */
+#include "zipmap.h"
+#include "sha1.h"
+#include "endianconv.h"
+#include "crc64.h"
+
+/* Error codes */
+#define C_OK                    0
+#define C_ERR                   -1
+
+/* Static server configuration */
+#define CONFIG_DEFAULT_HZ        10             /* Time interrupt calls/sec. */
+#define CONFIG_MIN_HZ            1
+#define CONFIG_MAX_HZ            500
+#define MAX_CLIENTS_PER_CLOCK_TICK 200          /* HZ is adapted based on that. */
+#define CONFIG_MAX_LINE    1024
+#define CRON_DBS_PER_CALL 16
+#define NET_MAX_WRITES_PER_EVENT (1024*64)
+#define PROTO_SHARED_SELECT_CMDS 10
+#define OBJ_SHARED_INTEGERS 10000
+#define OBJ_SHARED_BULKHDR_LEN 32
+#define LOG_MAX_LEN    1024 /* Default maximum length of syslog messages.*/
+#define AOF_REWRITE_ITEMS_PER_CMD 64
+#define AOF_READ_DIFF_INTERVAL_BYTES (1024*10)
+#define CONFIG_AUTHPASS_MAX_LEN 512
+#define CONFIG_RUN_ID_SIZE 40
+#define RDB_EOF_MARK_SIZE 40
+#define CONFIG_REPL_BACKLOG_MIN_SIZE (1024*16)          /* 16k */
+#define CONFIG_BGSAVE_RETRY_DELAY 5 /* Wait a few secs before trying again. */
+#define CONFIG_DEFAULT_PID_FILE "/var/run/redis.pid"
+#define CONFIG_DEFAULT_CLUSTER_CONFIG_FILE "nodes.conf"
+#define CONFIG_DEFAULT_UNIX_SOCKET_PERM 0
+#define CONFIG_DEFAULT_LOGFILE ""
+#define NET_HOST_STR_LEN 256 /* Longest valid hostname */
+#define NET_IP_STR_LEN 46 /* INET6_ADDRSTRLEN is 46, but we need to be sure */
+#define NET_ADDR_STR_LEN (NET_IP_STR_LEN+32) /* Must be enough for ip:port */
+#define NET_HOST_PORT_STR_LEN (NET_HOST_STR_LEN+32) /* Must be enough for hostname:port */
+#define CONFIG_BINDADDR_MAX 16
+#define CONFIG_MIN_RESERVED_FDS 32
+#define CONFIG_DEFAULT_PROC_TITLE_TEMPLATE "{title} {listen-addr} {server-mode}"
+
+#define ACTIVE_EXPIRE_CYCLE_SLOW 0
+#define ACTIVE_EXPIRE_CYCLE_FAST 1
+
+/* Children process will exit with this status code to signal that the
+ * process terminated without an error: this is useful in order to kill
+ * a saving child (RDB or AOF one), without triggering in the parent the
+ * write protection that is normally turned on on write errors.
+ * Usually children that are terminated with SIGUSR1 will exit with this
+ * special code. */
+#define SERVER_CHILD_NOERROR_RETVAL    255
+
+/* Reading copy-on-write info is sometimes expensive and may slow down child
+ * processes that report it continuously. We measure the cost of obtaining it
+ * and hold back additional reading based on this factor. */
+#define CHILD_COW_DUTY_CYCLE           100
+
+/* Instantaneous metrics tracking. */
+#define STATS_METRIC_SAMPLES 16     /* Number of samples per metric. */
+#define STATS_METRIC_COMMAND 0      /* Number of commands executed. */
+#define STATS_METRIC_NET_INPUT 1    /* Bytes read to network .*/
+#define STATS_METRIC_NET_OUTPUT 2   /* Bytes written to network. */
+#define STATS_METRIC_COUNT 3
+
+/* Protocol and I/O related defines */
+#define PROTO_IOBUF_LEN         (1024*16)  /* Generic I/O buffer size */
+#define PROTO_REPLY_CHUNK_BYTES (16*1024) /* 16k output buffer */
+#define PROTO_INLINE_MAX_SIZE   (1024*64) /* Max size of inline reads */
+#define PROTO_MBULK_BIG_ARG     (1024*32)
+#define LONG_STR_SIZE      21          /* Bytes needed for long -> str + '\0' */
+#define REDIS_AUTOSYNC_BYTES (1024*1024*32) /* fdatasync every 32MB */
+
+#define LIMIT_PENDING_QUERYBUF (4*1024*1024) /* 4mb */
+
+/* When configuring the server eventloop, we setup it so that the total number
+ * of file descriptors we can handle are server.maxclients + RESERVED_FDS +
+ * a few more to stay safe. Since RESERVED_FDS defaults to 32, we add 96
+ * in order to make sure of not over provisioning more than 128 fds. */
+#define CONFIG_FDSET_INCR (CONFIG_MIN_RESERVED_FDS+96)
+
+/* OOM Score Adjustment classes. */
+#define CONFIG_OOM_MASTER 0
+#define CONFIG_OOM_REPLICA 1
+#define CONFIG_OOM_BGCHILD 2
+#define CONFIG_OOM_COUNT 3
+
+extern int configOOMScoreAdjValuesDefaults[CONFIG_OOM_COUNT];
+
+/* Hash table parameters */
+#define HASHTABLE_MIN_FILL        10      /* Minimal hash table fill 10% */
+#define HASHTABLE_MAX_LOAD_FACTOR 1.618   /* Maximum hash table load factor. */
+
+/* Command flags. Please check the command table defined in the server.c file
+ * for more information about the meaning of every flag. */
+#define CMD_WRITE (1ULL<<0)            /* "write" flag */
+#define CMD_READONLY (1ULL<<1)         /* "read-only" flag */
+#define CMD_DENYOOM (1ULL<<2)          /* "use-memory" flag */
+#define CMD_MODULE (1ULL<<3)           /* Command exported by module. */
+#define CMD_ADMIN (1ULL<<4)            /* "admin" flag */
+#define CMD_PUBSUB (1ULL<<5)           /* "pub-sub" flag */
+#define CMD_NOSCRIPT (1ULL<<6)         /* "no-script" flag */
+#define CMD_RANDOM (1ULL<<7)           /* "random" flag */
+#define CMD_SORT_FOR_SCRIPT (1ULL<<8)  /* "to-sort" flag */
+#define CMD_LOADING (1ULL<<9)          /* "ok-loading" flag */
+#define CMD_STALE (1ULL<<10)           /* "ok-stale" flag */
+#define CMD_SKIP_MONITOR (1ULL<<11)    /* "no-monitor" flag */
+#define CMD_SKIP_SLOWLOG (1ULL<<12)    /* "no-slowlog" flag */
+#define CMD_ASKING (1ULL<<13)          /* "cluster-asking" flag */
+#define CMD_FAST (1ULL<<14)            /* "fast" flag */
+#define CMD_NO_AUTH (1ULL<<15)         /* "no-auth" flag */
+#define CMD_MAY_REPLICATE (1ULL<<16)   /* "may-replicate" flag */
+
+/* Command flags used by the module system. */
+#define CMD_MODULE_GETKEYS (1ULL<<17)  /* Use the modules getkeys interface. */
+#define CMD_MODULE_NO_CLUSTER (1ULL<<18) /* Deny on Redis Cluster. */
+
+/* Command flags that describe ACLs categories. */
+#define CMD_CATEGORY_KEYSPACE (1ULL<<19)
+#define CMD_CATEGORY_READ (1ULL<<20)
+#define CMD_CATEGORY_WRITE (1ULL<<21)
+#define CMD_CATEGORY_SET (1ULL<<22)
+#define CMD_CATEGORY_SORTEDSET (1ULL<<23)
+#define CMD_CATEGORY_LIST (1ULL<<24)
+#define CMD_CATEGORY_HASH (1ULL<<25)
+#define CMD_CATEGORY_STRING (1ULL<<26)
+#define CMD_CATEGORY_BITMAP (1ULL<<27)
+#define CMD_CATEGORY_HYPERLOGLOG (1ULL<<28)
+#define CMD_CATEGORY_GEO (1ULL<<29)
+#define CMD_CATEGORY_STREAM (1ULL<<30)
+#define CMD_CATEGORY_PUBSUB (1ULL<<31)
+#define CMD_CATEGORY_ADMIN (1ULL<<32)
+#define CMD_CATEGORY_FAST (1ULL<<33)
+#define CMD_CATEGORY_SLOW (1ULL<<34)
+#define CMD_CATEGORY_BLOCKING (1ULL<<35)
+#define CMD_CATEGORY_DANGEROUS (1ULL<<36)
+#define CMD_CATEGORY_CONNECTION (1ULL<<37)
+#define CMD_CATEGORY_TRANSACTION (1ULL<<38)
+#define CMD_CATEGORY_SCRIPTING (1ULL<<39)
+
+/* AOF states */
+#define AOF_OFF 0             /* AOF is off */
+#define AOF_ON 1              /* AOF is on */
+#define AOF_WAIT_REWRITE 2    /* AOF waits rewrite to start appending */
+
+/* Client flags */
+#define CLIENT_SLAVE (1<<0)   /* This client is a replica */
+#define CLIENT_MASTER (1<<1)  /* This client is a master */
+#define CLIENT_MONITOR (1<<2) /* This client is a slave monitor, see MONITOR */
+#define CLIENT_MULTI (1<<3)   /* This client is in a MULTI context */
+#define CLIENT_BLOCKED (1<<4) /* The client is waiting in a blocking operation */
+#define CLIENT_DIRTY_CAS (1<<5) /* Watched keys modified. EXEC will fail. */
+#define CLIENT_CLOSE_AFTER_REPLY (1<<6) /* Close after writing entire reply. */
+#define CLIENT_UNBLOCKED (1<<7) /* This client was unblocked and is stored in
+                                  server.unblocked_clients */
+#define CLIENT_LUA (1<<8) /* This is a non connected client used by Lua */
+#define CLIENT_ASKING (1<<9)     /* Client issued the ASKING command */
+#define CLIENT_CLOSE_ASAP (1<<10)/* Close this client ASAP */
+#define CLIENT_UNIX_SOCKET (1<<11) /* Client connected via Unix domain socket */
+#define CLIENT_DIRTY_EXEC (1<<12)  /* EXEC will fail for errors while queueing */
+#define CLIENT_MASTER_FORCE_REPLY (1<<13)  /* Queue replies even if is master */
+#define CLIENT_FORCE_AOF (1<<14)   /* Force AOF propagation of current cmd. */
+#define CLIENT_FORCE_REPL (1<<15)  /* Force replication of current cmd. */
+#define CLIENT_PRE_PSYNC (1<<16)   /* Instance don't understand PSYNC. */
+#define CLIENT_READONLY (1<<17)    /* Cluster client is in read-only state. */
+#define CLIENT_PUBSUB (1<<18)      /* Client is in Pub/Sub mode. */
+#define CLIENT_PREVENT_AOF_PROP (1<<19)  /* Don't propagate to AOF. */
+#define CLIENT_PREVENT_REPL_PROP (1<<20)  /* Don't propagate to slaves. */
+#define CLIENT_PREVENT_PROP (CLIENT_PREVENT_AOF_PROP|CLIENT_PREVENT_REPL_PROP)
+#define CLIENT_PENDING_WRITE (1<<21) /* Client has output to send but a write
+                                        handler is yet not installed. */
+#define CLIENT_REPLY_OFF (1<<22)   /* Don't send replies to client. */
+#define CLIENT_REPLY_SKIP_NEXT (1<<23)  /* Set CLIENT_REPLY_SKIP for next cmd */
+#define CLIENT_REPLY_SKIP (1<<24)  /* Don't send just this reply. */
+#define CLIENT_LUA_DEBUG (1<<25)  /* Run EVAL in debug mode. */
+#define CLIENT_LUA_DEBUG_SYNC (1<<26)  /* EVAL debugging without fork() */
+#define CLIENT_MODULE (1<<27) /* Non connected client used by some module. */
+#define CLIENT_PROTECTED (1<<28) /* Client should not be freed for now. */
+#define CLIENT_PENDING_READ (1<<29) /* The client has pending reads and was put
+                                       in the list of clients we can read
+                                       from. */
+#define CLIENT_PENDING_COMMAND (1<<30) /* Indicates the client has a fully
+                                        * parsed command ready for execution. */
+#define CLIENT_TRACKING (1ULL<<31) /* Client enabled keys tracking in order to
+                                   perform client side caching. */
+#define CLIENT_TRACKING_BROKEN_REDIR (1ULL<<32) /* Target client is invalid. */
+#define CLIENT_TRACKING_BCAST (1ULL<<33) /* Tracking in BCAST mode. */
+#define CLIENT_TRACKING_OPTIN (1ULL<<34)  /* Tracking in opt-in mode. */
+#define CLIENT_TRACKING_OPTOUT (1ULL<<35) /* Tracking in opt-out mode. */
+#define CLIENT_TRACKING_CACHING (1ULL<<36) /* CACHING yes/no was given,
+                                              depending on optin/optout mode. */
+#define CLIENT_TRACKING_NOLOOP (1ULL<<37) /* Don't send invalidation messages
+                                             about writes performed by myself.*/
+#define CLIENT_IN_TO_TABLE (1ULL<<38) /* This client is in the timeout table. */
+#define CLIENT_PROTOCOL_ERROR (1ULL<<39) /* Protocol error chatting with it. */
+#define CLIENT_CLOSE_AFTER_COMMAND (1ULL<<40) /* Close after executing commands
+                                               * and writing entire reply. */
+#define CLIENT_DENY_BLOCKING (1ULL<<41) /* Indicate that the client should not be blocked.
+                                           currently, turned on inside MULTI, Lua, RM_Call,
+                                           and AOF client */
+#define CLIENT_REPL_RDBONLY (1ULL<<42) /* This client is a replica that only wants
+                                          RDB without replication buffer. */
+
+/* Client block type (btype field in client structure)
+ * if CLIENT_BLOCKED flag is set. */
+#define BLOCKED_NONE 0    /* Not blocked, no CLIENT_BLOCKED flag set. */
+#define BLOCKED_LIST 1    /* BLPOP & co. */
+#define BLOCKED_WAIT 2    /* WAIT for synchronous replication. */
+#define BLOCKED_MODULE 3  /* Blocked by a loadable module. */
+#define BLOCKED_STREAM 4  /* XREAD. */
+#define BLOCKED_ZSET 5    /* BZPOP et al. */
+#define BLOCKED_PAUSE 6   /* Blocked by CLIENT PAUSE */
+#define BLOCKED_NUM 7     /* Number of blocked states. */
+
+/* Client request types */
+#define PROTO_REQ_INLINE 1
+#define PROTO_REQ_MULTIBULK 2
+
+/* Client classes for client limits, currently used only for
+ * the max-client-output-buffer limit implementation. */
+#define CLIENT_TYPE_NORMAL 0 /* Normal req-reply clients + MONITORs */
+#define CLIENT_TYPE_SLAVE 1  /* Slaves. */
+#define CLIENT_TYPE_PUBSUB 2 /* Clients subscribed to PubSub channels. */
+#define CLIENT_TYPE_MASTER 3 /* Master. */
+#define CLIENT_TYPE_COUNT 4  /* Total number of client types. */
+#define CLIENT_TYPE_OBUF_COUNT 3 /* Number of clients to expose to output
+                                    buffer configuration. Just the first
+                                    three: normal, slave, pubsub. */
+
+/* Slave replication state. Used in server.repl_state for slaves to remember
+ * what to do next. */
+typedef enum {
+    REPL_STATE_NONE = 0,            /* No active replication */
+    REPL_STATE_CONNECT,             /* Must connect to master */
+    REPL_STATE_CONNECTING,          /* Connecting to master */
+    /* --- Handshake states, must be ordered --- */
+    REPL_STATE_RECEIVE_PING_REPLY,  /* Wait for PING reply */
+    REPL_STATE_SEND_HANDSHAKE,      /* Send handshake sequance to master */
+    REPL_STATE_RECEIVE_AUTH_REPLY,  /* Wait for AUTH reply */
+    REPL_STATE_RECEIVE_PORT_REPLY,  /* Wait for REPLCONF reply */
+    REPL_STATE_RECEIVE_IP_REPLY,    /* Wait for REPLCONF reply */
+    REPL_STATE_RECEIVE_CAPA_REPLY,  /* Wait for REPLCONF reply */
+    REPL_STATE_SEND_PSYNC,          /* Send PSYNC */
+    REPL_STATE_RECEIVE_PSYNC_REPLY, /* Wait for PSYNC reply */
+    /* --- End of handshake states --- */
+    REPL_STATE_TRANSFER,        /* Receiving .rdb from master */
+    REPL_STATE_CONNECTED,       /* Connected to master */
+} repl_state;
+
+/* The state of an in progress coordinated failover */
+typedef enum {
+    NO_FAILOVER = 0,        /* No failover in progress */
+    FAILOVER_WAIT_FOR_SYNC, /* Waiting for target replica to catch up */
+    FAILOVER_IN_PROGRESS    /* Waiting for target replica to accept
+                             * PSYNC FAILOVER request. */
+} failover_state;
+
+/* State of slaves from the POV of the master. Used in client->replstate.
+ * In SEND_BULK and ONLINE state the slave receives new updates
+ * in its output queue. In the WAIT_BGSAVE states instead the server is waiting
+ * to start the next background saving in order to send updates to it. */
+#define SLAVE_STATE_WAIT_BGSAVE_START 6 /* We need to produce a new RDB file. */
+#define SLAVE_STATE_WAIT_BGSAVE_END 7 /* Waiting RDB file creation to finish. */
+#define SLAVE_STATE_SEND_BULK 8 /* Sending RDB file to slave. */
+#define SLAVE_STATE_ONLINE 9 /* RDB file transmitted, sending just updates. */
+
+/* Slave capabilities. */
+#define SLAVE_CAPA_NONE 0
+#define SLAVE_CAPA_EOF (1<<0)    /* Can parse the RDB EOF streaming format. */
+#define SLAVE_CAPA_PSYNC2 (1<<1) /* Supports PSYNC2 protocol. */
+
+/* Synchronous read timeout - slave side */
+#define CONFIG_REPL_SYNCIO_TIMEOUT 5
+
+/* List related stuff */
+#define LIST_HEAD 0
+#define LIST_TAIL 1
+#define ZSET_MIN 0
+#define ZSET_MAX 1
+
+/* Sort operations */
+#define SORT_OP_GET 0
+
+/* Log levels */
+#define LL_DEBUG 0
+#define LL_VERBOSE 1
+#define LL_NOTICE 2
+#define LL_WARNING 3
+#define LL_RAW (1<<10) /* Modifier to log without timestamp */
+
+/* Supervision options */
+#define SUPERVISED_NONE 0
+#define SUPERVISED_AUTODETECT 1
+#define SUPERVISED_SYSTEMD 2
+#define SUPERVISED_UPSTART 3
+
+/* Anti-warning macro... */
+#define UNUSED(V) ((void) V)
+
+#define ZSKIPLIST_MAXLEVEL 32 /* Should be enough for 2^64 elements */
+#define ZSKIPLIST_P 0.25      /* Skiplist P = 1/4 */
+
+/* Append only defines */
+#define AOF_FSYNC_NO 0
+#define AOF_FSYNC_ALWAYS 1
+#define AOF_FSYNC_EVERYSEC 2
+
+/* Replication diskless load defines */
+#define REPL_DISKLESS_LOAD_DISABLED 0
+#define REPL_DISKLESS_LOAD_WHEN_DB_EMPTY 1
+#define REPL_DISKLESS_LOAD_SWAPDB 2
+
+/* TLS Client Authentication */
+#define TLS_CLIENT_AUTH_NO 0
+#define TLS_CLIENT_AUTH_YES 1
+#define TLS_CLIENT_AUTH_OPTIONAL 2
+
+/* Sanitize dump payload */
+#define SANITIZE_DUMP_NO 0
+#define SANITIZE_DUMP_YES 1
+#define SANITIZE_DUMP_CLIENTS 2
+
+/* Sets operations codes */
+#define SET_OP_UNION 0
+#define SET_OP_DIFF 1
+#define SET_OP_INTER 2
+
+/* oom-score-adj defines */
+#define OOM_SCORE_ADJ_NO 0
+#define OOM_SCORE_RELATIVE 1
+#define OOM_SCORE_ADJ_ABSOLUTE 2
+
+/* Redis maxmemory strategies. Instead of using just incremental number
+ * for this defines, we use a set of flags so that testing for certain
+ * properties common to multiple policies is faster. */
+#define MAXMEMORY_FLAG_LRU (1<<0)
+#define MAXMEMORY_FLAG_LFU (1<<1)
+#define MAXMEMORY_FLAG_ALLKEYS (1<<2)
+#define MAXMEMORY_FLAG_NO_SHARED_INTEGERS \
+    (MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_LFU)
+
+#define MAXMEMORY_VOLATILE_LRU ((0<<8)|MAXMEMORY_FLAG_LRU)
+#define MAXMEMORY_VOLATILE_LFU ((1<<8)|MAXMEMORY_FLAG_LFU)
+#define MAXMEMORY_VOLATILE_TTL (2<<8)
+#define MAXMEMORY_VOLATILE_RANDOM (3<<8)
+#define MAXMEMORY_ALLKEYS_LRU ((4<<8)|MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_ALLKEYS)
+#define MAXMEMORY_ALLKEYS_LFU ((5<<8)|MAXMEMORY_FLAG_LFU|MAXMEMORY_FLAG_ALLKEYS)
+#define MAXMEMORY_ALLKEYS_RANDOM ((6<<8)|MAXMEMORY_FLAG_ALLKEYS)
+#define MAXMEMORY_NO_EVICTION (7<<8)
+
+/* Units */
+#define UNIT_SECONDS 0
+#define UNIT_MILLISECONDS 1
+
+/* SHUTDOWN flags */
+#define SHUTDOWN_NOFLAGS 0      /* No flags. */
+#define SHUTDOWN_SAVE 1         /* Force SAVE on SHUTDOWN even if no save
+                                   points are configured. */
+#define SHUTDOWN_NOSAVE 2       /* Don't SAVE on SHUTDOWN. */
+
+/* Command call flags, see call() function */
+#define CMD_CALL_NONE 0
+#define CMD_CALL_SLOWLOG (1<<0)
+#define CMD_CALL_STATS (1<<1)
+#define CMD_CALL_PROPAGATE_AOF (1<<2)
+#define CMD_CALL_PROPAGATE_REPL (1<<3)
+#define CMD_CALL_PROPAGATE (CMD_CALL_PROPAGATE_AOF|CMD_CALL_PROPAGATE_REPL)
+#define CMD_CALL_FULL (CMD_CALL_SLOWLOG | CMD_CALL_STATS | CMD_CALL_PROPAGATE)
+#define CMD_CALL_NOWRAP (1<<4)  /* Don't wrap also propagate array into
+                                   MULTI/EXEC: the caller will handle it.  */
+
+/* Command propagation flags, see propagate() function */
+#define PROPAGATE_NONE 0
+#define PROPAGATE_AOF 1
+#define PROPAGATE_REPL 2
+
+/* Client pause types, larger types are more restrictive
+ * pause types than smaller pause types. */
+typedef enum {
+    CLIENT_PAUSE_OFF = 0, /* Pause no commands */
+    CLIENT_PAUSE_WRITE,   /* Pause write commands */
+    CLIENT_PAUSE_ALL      /* Pause all commands */
+} pause_type;
+
+/* RDB active child save type. */
+#define RDB_CHILD_TYPE_NONE 0
+#define RDB_CHILD_TYPE_DISK 1     /* RDB is written to disk. */
+#define RDB_CHILD_TYPE_SOCKET 2   /* RDB is written to slave socket. */
+
+/* Keyspace changes notification classes. Every class is associated with a
+ * character for configuration purposes. */
+#define NOTIFY_KEYSPACE (1<<0)    /* K */
+#define NOTIFY_KEYEVENT (1<<1)    /* E */
+#define NOTIFY_GENERIC (1<<2)     /* g */
+#define NOTIFY_STRING (1<<3)      /* $ */
+#define NOTIFY_LIST (1<<4)        /* l */
+#define NOTIFY_SET (1<<5)         /* s */
+#define NOTIFY_HASH (1<<6)        /* h */
+#define NOTIFY_ZSET (1<<7)        /* z */
+#define NOTIFY_EXPIRED (1<<8)     /* x */
+#define NOTIFY_EVICTED (1<<9)     /* e */
+#define NOTIFY_STREAM (1<<10)     /* t */
+#define NOTIFY_KEY_MISS (1<<11)   /* m (Note: This one is excluded from NOTIFY_ALL on purpose) */
+#define NOTIFY_LOADED (1<<12)     /* module only key space notification, indicate a key loaded from rdb */
+#define NOTIFY_MODULE (1<<13)     /* d, module key space notification */
+#define NOTIFY_ALL (NOTIFY_GENERIC | NOTIFY_STRING | NOTIFY_LIST | NOTIFY_SET | NOTIFY_HASH | NOTIFY_ZSET | NOTIFY_EXPIRED | NOTIFY_EVICTED | NOTIFY_STREAM | NOTIFY_MODULE) /* A flag */
+
+/* Get the first bind addr or NULL */
+#define NET_FIRST_BIND_ADDR (server.bindaddr_count ? server.bindaddr[0] : NULL)
+
+/* Using the following macro you can run code inside serverCron() with the
+ * specified period, specified in milliseconds.
+ * The actual resolution depends on server.hz. */
+#define run_with_period(_ms_) if ((_ms_ <= 1000/server.hz) || !(server.cronloops%((_ms_)/(1000/server.hz))))
+
+/* We can print the stacktrace, so our assert is defined this way: */
+#define serverAssertWithInfo(_c,_o,_e) ((_e)?(void)0 : (_serverAssertWithInfo(_c,_o,#_e,__FILE__,__LINE__),redis_unreachable()))
+#define serverAssert(_e) ((_e)?(void)0 : (_serverAssert(#_e,__FILE__,__LINE__),redis_unreachable()))
+#define serverPanic(...) _serverPanic(__FILE__,__LINE__,__VA_ARGS__),redis_unreachable()
+
+/*-----------------------------------------------------------------------------
+ * Data types
+ *----------------------------------------------------------------------------*/
+
+/* A redis object, that is a type able to hold a string / list / set */
+
+/* The actual Redis Object */
+#define OBJ_STRING 0    /* String object. */
+#define OBJ_LIST 1      /* List object. */
+#define OBJ_SET 2       /* Set object. */
+#define OBJ_ZSET 3      /* Sorted set object. */
+#define OBJ_HASH 4      /* Hash object. */
+
+/* The "module" object type is a special one that signals that the object
+ * is one directly managed by a Redis module. In this case the value points
+ * to a moduleValue struct, which contains the object value (which is only
+ * handled by the module itself) and the RedisModuleType struct which lists
+ * function pointers in order to serialize, deserialize, AOF-rewrite and
+ * free the object.
+ *
+ * Inside the RDB file, module types are encoded as OBJ_MODULE followed
+ * by a 64 bit module type ID, which has a 54 bits module-specific signature
+ * in order to dispatch the loading to the right module, plus a 10 bits
+ * encoding version. */
+#define OBJ_MODULE 5    /* Module object. */
+#define OBJ_STREAM 6    /* Stream object. */
+
+/* Extract encver / signature from a module type ID. */
+#define REDISMODULE_TYPE_ENCVER_BITS 10
+#define REDISMODULE_TYPE_ENCVER_MASK ((1<<REDISMODULE_TYPE_ENCVER_BITS)-1)
+#define REDISMODULE_TYPE_ENCVER(id) (id & REDISMODULE_TYPE_ENCVER_MASK)
+#define REDISMODULE_TYPE_SIGN(id) ((id & ~((uint64_t)REDISMODULE_TYPE_ENCVER_MASK)) >>REDISMODULE_TYPE_ENCVER_BITS)
+
+/* Bit flags for moduleTypeAuxSaveFunc */
+#define REDISMODULE_AUX_BEFORE_RDB (1<<0)
+#define REDISMODULE_AUX_AFTER_RDB (1<<1)
+
+struct RedisModule;
+struct RedisModuleIO;
+struct RedisModuleDigest;
+struct RedisModuleCtx;
+struct redisObject;
+struct RedisModuleDefragCtx;
+
+/* Each module type implementation should export a set of methods in order
+ * to serialize and deserialize the value in the RDB file, rewrite the AOF
+ * log, create the digest for "DEBUG DIGEST", and free the value when a key
+ * is deleted. */
+typedef void *(*moduleTypeLoadFunc)(struct RedisModuleIO *io, int encver);
+typedef void (*moduleTypeSaveFunc)(struct RedisModuleIO *io, void *value);
+typedef int (*moduleTypeAuxLoadFunc)(struct RedisModuleIO *rdb, int encver, int when);
+typedef void (*moduleTypeAuxSaveFunc)(struct RedisModuleIO *rdb, int when);
+typedef void (*moduleTypeRewriteFunc)(struct RedisModuleIO *io, struct redisObject *key, void *value);
+typedef void (*moduleTypeDigestFunc)(struct RedisModuleDigest *digest, void *value);
+typedef size_t (*moduleTypeMemUsageFunc)(const void *value);
+typedef void (*moduleTypeFreeFunc)(void *value);
+typedef size_t (*moduleTypeFreeEffortFunc)(struct redisObject *key, const void *value);
+typedef void (*moduleTypeUnlinkFunc)(struct redisObject *key, void *value);
+typedef void *(*moduleTypeCopyFunc)(struct redisObject *fromkey, struct redisObject *tokey, const void *value);
+typedef int (*moduleTypeDefragFunc)(struct RedisModuleDefragCtx *ctx, struct redisObject *key, void **value);
+
+/* This callback type is called by moduleNotifyUserChanged() every time
+ * a user authenticated via the module API is associated with a different
+ * user or gets disconnected. This needs to be exposed since you can't cast
+ * a function pointer to (void *). */
+typedef void (*RedisModuleUserChangedFunc) (uint64_t client_id, void *privdata);
+
+
+/* The module type, which is referenced in each value of a given type, defines
+ * the methods and links to the module exporting the type. */
+typedef struct RedisModuleType {
+    uint64_t id; /* Higher 54 bits of type ID + 10 lower bits of encoding ver. */
+    struct RedisModule *module;
+    moduleTypeLoadFunc rdb_load;
+    moduleTypeSaveFunc rdb_save;
+    moduleTypeRewriteFunc aof_rewrite;
+    moduleTypeMemUsageFunc mem_usage;
+    moduleTypeDigestFunc digest;
+    moduleTypeFreeFunc free;
+    moduleTypeFreeEffortFunc free_effort;
+    moduleTypeUnlinkFunc unlink;
+    moduleTypeCopyFunc copy;
+    moduleTypeDefragFunc defrag;
+    moduleTypeAuxLoadFunc aux_load;
+    moduleTypeAuxSaveFunc aux_save;
+    int aux_save_triggers;
+    char name[10]; /* 9 bytes name + null term. Charset: A-Z a-z 0-9 _- */
+} moduleType;
+
+/* In Redis objects 'robj' structures of type OBJ_MODULE, the value pointer
+ * is set to the following structure, referencing the moduleType structure
+ * in order to work with the value, and at the same time providing a raw
+ * pointer to the value, as created by the module commands operating with
+ * the module type.
+ *
+ * So for example in order to free such a value, it is possible to use
+ * the following code:
+ *
+ *  if (robj->type == OBJ_MODULE) {
+ *      moduleValue *mt = robj->ptr;
+ *      mt->type->free(mt->value);
+ *      zfree(mt); // We need to release this in-the-middle struct as well.
+ *  }
+ */
+typedef struct moduleValue {
+    moduleType *type;
+    void *value;
+} moduleValue;
+
+/* This is a wrapper for the 'rio' streams used inside rdb.c in Redis, so that
+ * the user does not have to take the total count of the written bytes nor
+ * to care about error conditions. */
+typedef struct RedisModuleIO {
+    size_t bytes;       /* Bytes read / written so far. */
+    rio *rio;           /* Rio stream. */
+    moduleType *type;   /* Module type doing the operation. */
+    int error;          /* True if error condition happened. */
+    int ver;            /* Module serialization version: 1 (old),
+                         * 2 (current version with opcodes annotation). */
+    struct RedisModuleCtx *ctx; /* Optional context, see RM_GetContextFromIO()*/
+    struct redisObject *key;    /* Optional name of key processed */
+} RedisModuleIO;
+
+/* Macro to initialize an IO context. Note that the 'ver' field is populated
+ * inside rdb.c according to the version of the value to load. */
+#define moduleInitIOContext(iovar,mtype,rioptr,keyptr) do { \
+    iovar.rio = rioptr; \
+    iovar.type = mtype; \
+    iovar.bytes = 0; \
+    iovar.error = 0; \
+    iovar.ver = 0; \
+    iovar.key = keyptr; \
+    iovar.ctx = NULL; \
+} while(0)
+
+/* This is a structure used to export DEBUG DIGEST capabilities to Redis
+ * modules. We want to capture both the ordered and unordered elements of
+ * a data structure, so that a digest can be created in a way that correctly
+ * reflects the values. See the DEBUG DIGEST command implementation for more
+ * background. */
+typedef struct RedisModuleDigest {
+    unsigned char o[20];    /* Ordered elements. */
+    unsigned char x[20];    /* Xored elements. */
+} RedisModuleDigest;
+
+/* Just start with a digest composed of all zero bytes. */
+#define moduleInitDigestContext(mdvar) do { \
+    memset(mdvar.o,0,sizeof(mdvar.o)); \
+    memset(mdvar.x,0,sizeof(mdvar.x)); \
+} while(0)
+
+/* Objects encoding. Some kind of objects like Strings and Hashes can be
+ * internally represented in multiple ways. The 'encoding' field of the object
+ * is set to one of this fields for this object. */
+#define OBJ_ENCODING_RAW 0     /* Raw representation */
+#define OBJ_ENCODING_INT 1     /* Encoded as integer */
+#define OBJ_ENCODING_HT 2      /* Encoded as hash table */
+#define OBJ_ENCODING_ZIPMAP 3  /* Encoded as zipmap */
+#define OBJ_ENCODING_LINKEDLIST 4 /* No longer used: old list encoding. */
+#define OBJ_ENCODING_ZIPLIST 5 /* Encoded as ziplist */
+#define OBJ_ENCODING_INTSET 6  /* Encoded as intset */
+#define OBJ_ENCODING_SKIPLIST 7  /* Encoded as skiplist */
+#define OBJ_ENCODING_EMBSTR 8  /* Embedded sds string encoding */
+#define OBJ_ENCODING_QUICKLIST 9 /* Encoded as linked list of ziplists */
+#define OBJ_ENCODING_STREAM 10 /* Encoded as a radix tree of listpacks */
+
+#define LRU_BITS 24
+#define LRU_CLOCK_MAX ((1<<LRU_BITS)-1) /* Max value of obj->lru */
+#define LRU_CLOCK_RESOLUTION 1000 /* LRU clock resolution in ms */
+
+#define OBJ_SHARED_REFCOUNT INT_MAX     /* Global object never destroyed. */
+#define OBJ_STATIC_REFCOUNT (INT_MAX-1) /* Object allocated in the stack. */
+#define OBJ_FIRST_SPECIAL_REFCOUNT OBJ_STATIC_REFCOUNT
+typedef struct redisObject {
+    unsigned type:4;
+    unsigned encoding:4;
+    unsigned lru:LRU_BITS; /* LRU time (relative to global lru_clock) or
+                            * LFU data (least significant 8 bits frequency
+                            * and most significant 16 bits access time). */
+    int refcount;
+    void *ptr;
+} robj;
+
+/* The a string name for an object's type as listed above
+ * Native types are checked against the OBJ_STRING, OBJ_LIST, OBJ_* defines,
+ * and Module types have their registered name returned. */
+char *getObjectTypeName(robj*);
+
+/* Macro used to initialize a Redis object allocated on the stack.
+ * Note that this macro is taken near the structure definition to make sure
+ * we'll update it when the structure is changed, to avoid bugs like
+ * bug #85 introduced exactly in this way. */
+#define initStaticStringObject(_var,_ptr) do { \
+    _var.refcount = OBJ_STATIC_REFCOUNT; \
+    _var.type = OBJ_STRING; \
+    _var.encoding = OBJ_ENCODING_RAW; \
+    _var.ptr = _ptr; \
+} while(0)
+
+struct evictionPoolEntry; /* Defined in evict.c */
+
+/* This structure is used in order to represent the output buffer of a client,
+ * which is actually a linked list of blocks like that, that is: client->reply. */
+typedef struct clientReplyBlock {
+    size_t size, used;
+    char buf[];
+} clientReplyBlock;
+
+/* Redis database representation. There are multiple databases identified
+ * by integers from 0 (the default database) up to the max configured
+ * database. The database number is the 'id' field in the structure. */
+typedef struct redisDb {
+    dict *dict;                 /* The keyspace for this DB */
+    dict *expires;              /* Timeout of keys with a timeout set */
+    dict *blocking_keys;        /* Keys with clients waiting for data (BLPOP)*/
+    dict *ready_keys;           /* Blocked keys that received a PUSH */
+    dict *watched_keys;         /* WATCHED keys for MULTI/EXEC CAS */
+    int id;                     /* Database ID */
+    long long avg_ttl;          /* Average TTL, just for stats */
+    unsigned long expires_cursor; /* Cursor of the active expire cycle. */
+    list *defrag_later;         /* List of key names to attempt to defrag one by one, gradually. */
+} redisDb;
+
+/* Declare database backup that include redis main DBs and slots to keys map.
+ * Definition is in db.c. We can't define it here since we define CLUSTER_SLOTS
+ * in cluster.h. */
+typedef struct dbBackup dbBackup;
+
+/* Client MULTI/EXEC state */
+typedef struct multiCmd {
+    robj **argv;
+    int argc;
+    struct redisCommand *cmd;
+} multiCmd;
+
+typedef struct multiState {
+    multiCmd *commands;     /* Array of MULTI commands */
+    int count;              /* Total number of MULTI commands */
+    int cmd_flags;          /* The accumulated command flags OR-ed together.
+                               So if at least a command has a given flag, it
+                               will be set in this field. */
+    int cmd_inv_flags;      /* Same as cmd_flags, OR-ing the ~flags. so that it
+                               is possible to know if all the commands have a
+                               certain flag. */
+} multiState;
+
+/* This structure holds the blocking operation state for a client.
+ * The fields used depend on client->btype. */
+typedef struct blockingState {
+    /* Generic fields. */
+    mstime_t timeout;       /* Blocking operation timeout. If UNIX current time
+                             * is > timeout then the operation timed out. */
+
+    /* BLOCKED_LIST, BLOCKED_ZSET and BLOCKED_STREAM */
+    dict *keys;             /* The keys we are waiting to terminate a blocking
+                             * operation such as BLPOP or XREAD. Or NULL. */
+    robj *target;           /* The key that should receive the element,
+                             * for BLMOVE. */
+    struct listPos {
+        int wherefrom;      /* Where to pop from */
+        int whereto;        /* Where to push to */
+    } listpos;              /* The positions in the src/dst lists
+                             * where we want to pop/push an element
+                             * for BLPOP, BRPOP and BLMOVE. */
+
+    /* BLOCK_STREAM */
+    size_t xread_count;     /* XREAD COUNT option. */
+    robj *xread_group;      /* XREADGROUP group name. */
+    robj *xread_consumer;   /* XREADGROUP consumer name. */
+    int xread_group_noack;
+
+    /* BLOCKED_WAIT */
+    int numreplicas;        /* Number of replicas we are waiting for ACK. */
+    long long reploffset;   /* Replication offset to reach. */
+
+    /* BLOCKED_MODULE */
+    void *module_blocked_handle; /* RedisModuleBlockedClient structure.
+                                    which is opaque for the Redis core, only
+                                    handled in module.c. */
+} blockingState;
+
+/* The following structure represents a node in the server.ready_keys list,
+ * where we accumulate all the keys that had clients blocked with a blocking
+ * operation such as B[LR]POP, but received new data in the context of the
+ * last executed command.
+ *
+ * After the execution of every command or script, we run this list to check
+ * if as a result we should serve data to clients blocked, unblocking them.
+ * Note that server.ready_keys will not have duplicates as there dictionary
+ * also called ready_keys in every structure representing a Redis database,
+ * where we make sure to remember if a given key was already added in the
+ * server.ready_keys list. */
+typedef struct readyList {
+    redisDb *db;
+    robj *key;
+} readyList;
+
+/* This structure represents a Redis user. This is useful for ACLs, the
+ * user is associated to the connection after the connection is authenticated.
+ * If there is no associated user, the connection uses the default user. */
+#define USER_COMMAND_BITS_COUNT 1024    /* The total number of command bits
+                                           in the user structure. The last valid
+                                           command ID we can set in the user
+                                           is USER_COMMAND_BITS_COUNT-1. */
+#define USER_FLAG_ENABLED (1<<0)        /* The user is active. */
+#define USER_FLAG_DISABLED (1<<1)       /* The user is disabled. */
+#define USER_FLAG_ALLKEYS (1<<2)        /* The user can mention any key. */
+#define USER_FLAG_ALLCOMMANDS (1<<3)    /* The user can run all commands. */
+#define USER_FLAG_NOPASS      (1<<4)    /* The user requires no password, any
+                                           provided password will work. For the
+                                           default user, this also means that
+                                           no AUTH is needed, and every
+                                           connection is immediately
+                                           authenticated. */
+#define USER_FLAG_ALLCHANNELS (1<<5)    /* The user can mention any Pub/Sub
+                                           channel. */
+#define USER_FLAG_SANITIZE_PAYLOAD (1<<6)       /* The user require a deep RESTORE
+                                                 * payload sanitization. */
+#define USER_FLAG_SANITIZE_PAYLOAD_SKIP (1<<7)  /* The user should skip the
+                                                 * deep sanitization of RESTORE
+                                                 * payload. */
+
+typedef struct {
+    sds name;       /* The username as an SDS string. */
+    uint64_t flags; /* See USER_FLAG_* */
+
+    /* The bit in allowed_commands is set if this user has the right to
+     * execute this command. In commands having subcommands, if this bit is
+     * set, then all the subcommands are also available.
+     *
+     * If the bit for a given command is NOT set and the command has
+     * subcommands, Redis will also check allowed_subcommands in order to
+     * understand if the command can be executed. */
+    uint64_t allowed_commands[USER_COMMAND_BITS_COUNT/64];
+
+    /* This array points, for each command ID (corresponding to the command
+     * bit set in allowed_commands), to an array of SDS strings, terminated by
+     * a NULL pointer, with all the sub commands that can be executed for
+     * this command. When no subcommands matching is used, the field is just
+     * set to NULL to avoid allocating USER_COMMAND_BITS_COUNT pointers. */
+    sds **allowed_subcommands;
+    list *passwords; /* A list of SDS valid passwords for this user. */
+    list *patterns;  /* A list of allowed key patterns. If this field is NULL
+                        the user cannot mention any key in a command, unless
+                        the flag ALLKEYS is set in the user. */
+    list *channels;  /* A list of allowed Pub/Sub channel patterns. If this
+                        field is NULL the user cannot mention any channel in a
+                        `PUBLISH` or [P][UNSUBSCRIBE] command, unless the flag
+                        ALLCHANNELS is set in the user. */
+} user;
+
+/* With multiplexing we need to take per-client state.
+ * Clients are taken in a linked list. */
+
+#define CLIENT_ID_AOF (UINT64_MAX) /* Reserved ID for the AOF client. If you
+                                      need more reserved IDs use UINT64_MAX-1,
+                                      -2, ... and so forth. */
+
+typedef struct client {
+    uint64_t id;            /* Client incremental unique ID. */
+    connection *conn;
+    int resp;               /* RESP protocol version. Can be 2 or 3. */
+    redisDb *db;            /* Pointer to currently SELECTed DB. */
+    robj *name;             /* As set by CLIENT SETNAME. */
+    sds querybuf;           /* Buffer we use to accumulate client queries. */
+    size_t qb_pos;          /* The position we have read in querybuf. */
+    sds pending_querybuf;   /* If this client is flagged as master, this buffer
+                               represents the yet not applied portion of the
+                               replication stream that we are receiving from
+                               the master. */
+    size_t querybuf_peak;   /* Recent (100ms or more) peak of querybuf size. */
+    int argc;               /* Num of arguments of current command. */
+    robj **argv;            /* Arguments of current command. */
+    int original_argc;      /* Num of arguments of original command if arguments were rewritten. */
+    robj **original_argv;   /* Arguments of original command if arguments were rewritten. */
+    size_t argv_len_sum;    /* Sum of lengths of objects in argv list. */
+    struct redisCommand *cmd, *lastcmd;  /* Last command executed. */
+    user *user;             /* User associated with this connection. If the
+                               user is set to NULL the connection can do
+                               anything (admin). */
+    int reqtype;            /* Request protocol type: PROTO_REQ_* */
+    int multibulklen;       /* Number of multi bulk arguments left to read. */
+    long bulklen;           /* Length of bulk argument in multi bulk request. */
+    list *reply;            /* List of reply objects to send to the client. */
+    unsigned long long reply_bytes; /* Tot bytes of objects in reply list. */
+    size_t sentlen;         /* Amount of bytes already sent in the current
+                               buffer or object being sent. */
+    time_t ctime;           /* Client creation time. */
+    long duration;          /* Current command duration. Used for measuring latency of blocking/non-blocking cmds */
+    time_t lastinteraction; /* Time of the last interaction, used for timeout */
+    time_t obuf_soft_limit_reached_time;
+    uint64_t flags;         /* Client flags: CLIENT_* macros. */
+    int authenticated;      /* Needed when the default user requires auth. */
+    int replstate;          /* Replication state if this is a slave. */
+    int repl_put_online_on_ack; /* Install slave write handler on first ACK. */
+    int repldbfd;           /* Replication DB file descriptor. */
+    off_t repldboff;        /* Replication DB file offset. */
+    off_t repldbsize;       /* Replication DB file size. */
+    sds replpreamble;       /* Replication DB preamble. */
+    long long read_reploff; /* Read replication offset if this is a master. */
+    long long reploff;      /* Applied replication offset if this is a master. */
+    long long repl_ack_off; /* Replication ack offset, if this is a slave. */
+    long long repl_ack_time;/* Replication ack time, if this is a slave. */
+    long long repl_last_partial_write; /* The last time the server did a partial write from the RDB child pipe to this replica  */
+    long long psync_initial_offset; /* FULLRESYNC reply offset other slaves
+                                       copying this slave output buffer
+                                       should use. */
+    char replid[CONFIG_RUN_ID_SIZE+1]; /* Master replication ID (if master). */
+    int slave_listening_port; /* As configured with: REPLCONF listening-port */
+    char *slave_addr;       /* Optionally given by REPLCONF ip-address */
+    int slave_capa;         /* Slave capabilities: SLAVE_CAPA_* bitwise OR. */
+    multiState mstate;      /* MULTI/EXEC state */
+    int btype;              /* Type of blocking op if CLIENT_BLOCKED. */
+    blockingState bpop;     /* blocking state */
+    long long woff;         /* Last write global replication offset. */
+    list *watched_keys;     /* Keys WATCHED for MULTI/EXEC CAS */
+    dict *pubsub_channels;  /* channels a client is interested in (SUBSCRIBE) */
+    list *pubsub_patterns;  /* patterns a client is interested in (SUBSCRIBE) */
+    sds peerid;             /* Cached peer ID. */
+    sds sockname;           /* Cached connection target address. */
+    listNode *client_list_node; /* list node in client list */
+    listNode *paused_list_node; /* list node within the pause list */
+    RedisModuleUserChangedFunc auth_callback; /* Module callback to execute
+                                               * when the authenticated user
+                                               * changes. */
+    void *auth_callback_privdata; /* Private data that is passed when the auth
+                                   * changed callback is executed. Opaque for
+                                   * Redis Core. */
+    void *auth_module;      /* The module that owns the callback, which is used
+                             * to disconnect the client if the module is
+                             * unloaded for cleanup. Opaque for Redis Core.*/
+
+    /* If this client is in tracking mode and this field is non zero,
+     * invalidation messages for keys fetched by this client will be send to
+     * the specified client ID. */
+    uint64_t client_tracking_redirection;
+    rax *client_tracking_prefixes; /* A dictionary of prefixes we are already
+                                      subscribed to in BCAST mode, in the
+                                      context of client side caching. */
+    /* In clientsCronTrackClientsMemUsage() we track the memory usage of
+     * each client and add it to the sum of all the clients of a given type,
+     * however we need to remember what was the old contribution of each
+     * client, and in which categoty the client was, in order to remove it
+     * before adding it the new value. */
+    uint64_t client_cron_last_memory_usage;
+    int      client_cron_last_memory_type;
+    /* Response buffer */
+    int bufpos;
+    char buf[PROTO_REPLY_CHUNK_BYTES];
+} client;
+
+struct saveparam {
+    time_t seconds;
+    int changes;
+};
+
+struct moduleLoadQueueEntry {
+    sds path;
+    int argc;
+    robj **argv;
+};
+
+struct sentinelLoadQueueEntry {
+    int argc;
+    sds *argv;
+    int linenum;
+    sds line;
+};
+
+struct sentinelConfig {
+    list *pre_monitor_cfg;
+    list *monitor_cfg;
+    list *post_monitor_cfg;
+};
+
+struct sharedObjectsStruct {
+    robj *crlf, *ok, *err, *emptybulk, *czero, *cone, *pong, *space,
+    *colon, *queued, *null[4], *nullarray[4], *emptymap[4], *emptyset[4],
+    *emptyarray, *wrongtypeerr, *nokeyerr, *syntaxerr, *sameobjecterr,
+    *outofrangeerr, *noscripterr, *loadingerr, *slowscripterr, *bgsaveerr,
+    *masterdownerr, *roslaveerr, *execaborterr, *noautherr, *noreplicaserr,
+    *busykeyerr, *oomerr, *plus, *messagebulk, *pmessagebulk, *subscribebulk,
+    *unsubscribebulk, *psubscribebulk, *punsubscribebulk, *del, *unlink,
+    *rpop, *lpop, *lpush, *rpoplpush, *lmove, *blmove, *zpopmin, *zpopmax,
+    *emptyscan, *multi, *exec, *left, *right, *hset, *srem, *xgroup, *xclaim,  
+    *script, *replconf, *eval, *persist, *set, *pexpireat, *pexpire, 
+    *time, *pxat, *px, *retrycount, *force, *justid, 
+    *lastid, *ping, *setid, *keepttl, *load, *createconsumer,
+    *getack, *special_asterick, *special_equals, *default_username, *redacted,
+    *select[PROTO_SHARED_SELECT_CMDS],
+    *integers[OBJ_SHARED_INTEGERS],
+    *mbulkhdr[OBJ_SHARED_BULKHDR_LEN], /* "*<value>\r\n" */
+    *bulkhdr[OBJ_SHARED_BULKHDR_LEN];  /* "$<value>\r\n" */
+    sds minstring, maxstring;
+};
+
+/* ZSETs use a specialized version of Skiplists */
+typedef struct zskiplistNode {
+    sds ele;
+    double score;
+    struct zskiplistNode *backward;
+    struct zskiplistLevel {
+        struct zskiplistNode *forward;
+        unsigned long span;
+    } level[];
+} zskiplistNode;
+
+typedef struct zskiplist {
+    struct zskiplistNode *header, *tail;
+    unsigned long length;
+    int level;
+} zskiplist;
+
+typedef struct zset {
+    dict *dict;
+    zskiplist *zsl;
+} zset;
+
+typedef struct clientBufferLimitsConfig {
+    unsigned long long hard_limit_bytes;
+    unsigned long long soft_limit_bytes;
+    time_t soft_limit_seconds;
+} clientBufferLimitsConfig;
+
+extern clientBufferLimitsConfig clientBufferLimitsDefaults[CLIENT_TYPE_OBUF_COUNT];
+
+/* The redisOp structure defines a Redis Operation, that is an instance of
+ * a command with an argument vector, database ID, propagation target
+ * (PROPAGATE_*), and command pointer.
+ *
+ * Currently only used to additionally propagate more commands to AOF/Replication
+ * after the propagation of the executed command. */
+typedef struct redisOp {
+    robj **argv;
+    int argc, dbid, target;
+    struct redisCommand *cmd;
+} redisOp;
+
+/* Defines an array of Redis operations. There is an API to add to this
+ * structure in an easy way.
+ *
+ * redisOpArrayInit();
+ * redisOpArrayAppend();
+ * redisOpArrayFree();
+ */
+typedef struct redisOpArray {
+    redisOp *ops;
+    int numops;
+} redisOpArray;
+
+/* This structure is returned by the getMemoryOverheadData() function in
+ * order to return memory overhead information. */
+struct redisMemOverhead {
+    size_t peak_allocated;
+    size_t total_allocated;
+    size_t startup_allocated;
+    size_t repl_backlog;
+    size_t clients_slaves;
+    size_t clients_normal;
+    size_t aof_buffer;
+    size_t lua_caches;
+    size_t overhead_total;
+    size_t dataset;
+    size_t total_keys;
+    size_t bytes_per_key;
+    float dataset_perc;
+    float peak_perc;
+    float total_frag;
+    ssize_t total_frag_bytes;
+    float allocator_frag;
+    ssize_t allocator_frag_bytes;
+    float allocator_rss;
+    ssize_t allocator_rss_bytes;
+    float rss_extra;
+    size_t rss_extra_bytes;
+    size_t num_dbs;
+    struct {
+        size_t dbid;
+        size_t overhead_ht_main;
+        size_t overhead_ht_expires;
+    } *db;
+};
+
+/* This structure can be optionally passed to RDB save/load functions in
+ * order to implement additional functionalities, by storing and loading
+ * metadata to the RDB file.
+ *
+ * Currently the only use is to select a DB at load time, useful in
+ * replication in order to make sure that chained slaves (slaves of slaves)
+ * select the correct DB and are able to accept the stream coming from the
+ * top-level master. */
+typedef struct rdbSaveInfo {
+    /* Used saving and loading. */
+    int repl_stream_db;  /* DB to select in server.master client. */
+
+    /* Used only loading. */
+    int repl_id_is_set;  /* True if repl_id field is set. */
+    char repl_id[CONFIG_RUN_ID_SIZE+1];     /* Replication ID. */
+    long long repl_offset;                  /* Replication offset. */
+} rdbSaveInfo;
+
+#define RDB_SAVE_INFO_INIT {-1,0,"0000000000000000000000000000000000000000",-1}
+
+struct malloc_stats {
+    size_t zmalloc_used;
+    size_t process_rss;
+    size_t allocator_allocated;
+    size_t allocator_active;
+    size_t allocator_resident;
+};
+
+typedef struct socketFds {
+    int fd[CONFIG_BINDADDR_MAX];
+    int count;
+} socketFds;
+
+/*-----------------------------------------------------------------------------
+ * TLS Context Configuration
+ *----------------------------------------------------------------------------*/
+
+typedef struct redisTLSContextConfig {
+    char *cert_file;                /* Server side and optionally client side cert file name */
+    char *key_file;                 /* Private key filename for cert_file */
+    char *key_file_pass;            /* Optional password for key_file */
+    char *client_cert_file;         /* Certificate to use as a client; if none, use cert_file */
+    char *client_key_file;          /* Private key filename for client_cert_file */
+    char *client_key_file_pass;     /* Optional password for client_key_file */
+    char *dh_params_file;
+    char *ca_cert_file;
+    char *ca_cert_dir;
+    char *protocols;
+    char *ciphers;
+    char *ciphersuites;
+    int prefer_server_ciphers;
+    int session_caching;
+    int session_cache_size;
+    int session_cache_timeout;
+} redisTLSContextConfig;
+
+/*-----------------------------------------------------------------------------
+ * Global server state
+ *----------------------------------------------------------------------------*/
+
+struct clusterState;
+
+/* AIX defines hz to __hz, we don't use this define and in order to allow
+ * Redis build on AIX we need to undef it. */
+#ifdef _AIX
+#undef hz
+#endif
+
+#define CHILD_TYPE_NONE 0
+#define CHILD_TYPE_RDB 1
+#define CHILD_TYPE_AOF 2
+#define CHILD_TYPE_LDB 3
+#define CHILD_TYPE_MODULE 4
+
+typedef enum childInfoType {
+    CHILD_INFO_TYPE_CURRENT_INFO,
+    CHILD_INFO_TYPE_AOF_COW_SIZE,
+    CHILD_INFO_TYPE_RDB_COW_SIZE,
+    CHILD_INFO_TYPE_MODULE_COW_SIZE
+} childInfoType;
+
+struct redisServer {
+    /* General */
+    pid_t pid;                  /* Main process pid. */
+    pthread_t main_thread_id;         /* Main thread id */
+    char *configfile;           /* Absolute config file path, or NULL */
+    char *executable;           /* Absolute executable file path. */
+    char **exec_argv;           /* Executable argv vector (copy). */
+    int dynamic_hz;             /* Change hz value depending on # of clients. */
+    int config_hz;              /* Configured HZ value. May be different than
+                                   the actual 'hz' field value if dynamic-hz
+                                   is enabled. */
+    mode_t umask;               /* The umask value of the process on startup */
+    int hz;                     /* serverCron() calls frequency in hertz */
+    int in_fork_child;          /* indication that this is a fork child */
+    redisDb *db;
+    dict *commands;             /* Command table */
+    dict *orig_commands;        /* Command table before command renaming. */
+    aeEventLoop *el;
+    rax *errors;                /* Errors table */
+    redisAtomic unsigned int lruclock; /* Clock for LRU eviction */
+    volatile sig_atomic_t shutdown_asap; /* SHUTDOWN needed ASAP */
+    int activerehashing;        /* Incremental rehash in serverCron() */
+    int active_defrag_running;  /* Active defragmentation running (holds current scan aggressiveness) */
+    char *pidfile;              /* PID file path */
+    int arch_bits;              /* 32 or 64 depending on sizeof(long) */
+    int cronloops;              /* Number of times the cron function run */
+    char runid[CONFIG_RUN_ID_SIZE+1];  /* ID always different at every exec. */
+    int sentinel_mode;          /* True if this instance is a Sentinel. */
+    size_t initial_memory_usage; /* Bytes used after initialization. */
+    int always_show_logo;       /* Show logo even for non-stdout logging. */
+    int in_eval;                /* Are we inside EVAL? */
+    int in_exec;                /* Are we inside EXEC? */
+    int propagate_in_transaction;  /* Make sure we don't propagate nested MULTI/EXEC */
+    char *ignore_warnings;      /* Config: warnings that should be ignored. */
+    int client_pause_in_transaction; /* Was a client pause executed during this Exec? */
+    /* Modules */
+    dict *moduleapi;            /* Exported core APIs dictionary for modules. */
+    dict *sharedapi;            /* Like moduleapi but containing the APIs that
+                                   modules share with each other. */
+    list *loadmodule_queue;     /* List of modules to load at startup. */
+    int module_blocked_pipe[2]; /* Pipe used to awake the event loop if a
+                                   client blocked on a module command needs
+                                   to be processed. */
+    pid_t child_pid;            /* PID of current child */
+    int child_type;             /* Type of current child */
+    client *module_client;      /* "Fake" client to call Redis from modules */
+    /* Networking */
+    int port;                   /* TCP listening port */
+    int tls_port;               /* TLS listening port */
+    int tcp_backlog;            /* TCP listen() backlog */
+    char *bindaddr[CONFIG_BINDADDR_MAX]; /* Addresses we should bind to */
+    int bindaddr_count;         /* Number of addresses in server.bindaddr[] */
+    char *unixsocket;           /* UNIX socket path */
+    mode_t unixsocketperm;      /* UNIX socket permission */
+    socketFds ipfd;             /* TCP socket file descriptors */
+    socketFds tlsfd;            /* TLS socket file descriptors */
+    int sofd;                   /* Unix socket file descriptor */
+    socketFds cfd;              /* Cluster bus listening socket */
+    list *clients;              /* List of active clients */
+    list *clients_to_close;     /* Clients to close asynchronously */
+    list *clients_pending_write; /* There is to write or install handler. */
+    list *clients_pending_read;  /* Client has pending read socket buffers. */
+    list *slaves, *monitors;    /* List of slaves and MONITORs */
+    client *current_client;     /* Current client executing the command. */
+    rax *clients_timeout_table; /* Radix tree for blocked clients timeouts. */
+    long fixed_time_expire;     /* If > 0, expire keys against server.mstime. */
+    rax *clients_index;         /* Active clients dictionary by client ID. */
+    pause_type client_pause_type;      /* True if clients are currently paused */
+    list *paused_clients;       /* List of pause clients */
+    mstime_t client_pause_end_time;    /* Time when we undo clients_paused */
+    char neterr[ANET_ERR_LEN];   /* Error buffer for anet.c */
+    dict *migrate_cached_sockets;/* MIGRATE cached sockets */
+    redisAtomic uint64_t next_client_id; /* Next client unique ID. Incremental. */
+    int protected_mode;         /* Don't accept external connections. */
+    int gopher_enabled;         /* If true the server will reply to gopher
+                                   queries. Will still serve RESP2 queries. */
+    int io_threads_num;         /* Number of IO threads to use. */
+    int io_threads_do_reads;    /* Read and parse from IO threads? */
+    int io_threads_active;      /* Is IO threads currently active? */
+    long long events_processed_while_blocked; /* processEventsWhileBlocked() */
+
+    /* RDB / AOF loading information */
+    volatile sig_atomic_t loading; /* We are loading data from disk if true */
+    off_t loading_total_bytes;
+    off_t loading_rdb_used_mem;
+    off_t loading_loaded_bytes;
+    time_t loading_start_time;
+    off_t loading_process_events_interval_bytes;
+    /* Fast pointers to often looked up command */
+    struct redisCommand *delCommand, *multiCommand, *lpushCommand,
+                        *lpopCommand, *rpopCommand, *zpopminCommand,
+                        *zpopmaxCommand, *sremCommand, *execCommand,
+                        *expireCommand, *pexpireCommand, *xclaimCommand,
+                        *xgroupCommand, *rpoplpushCommand, *lmoveCommand;
+    /* Fields used only for stats */
+    time_t stat_starttime;          /* Server start time */
+    long long stat_numcommands;     /* Number of processed commands */
+    long long stat_numconnections;  /* Number of connections received */
+    long long stat_expiredkeys;     /* Number of expired keys */
+    double stat_expired_stale_perc; /* Percentage of keys probably expired */
+    long long stat_expired_time_cap_reached_count; /* Early expire cylce stops.*/
+    long long stat_expire_cycle_time_used; /* Cumulative microseconds used. */
+    long long stat_evictedkeys;     /* Number of evicted keys (maxmemory) */
+    long long stat_keyspace_hits;   /* Number of successful lookups of keys */
+    long long stat_keyspace_misses; /* Number of failed lookups of keys */
+    long long stat_active_defrag_hits;      /* number of allocations moved */
+    long long stat_active_defrag_misses;    /* number of allocations scanned but not moved */
+    long long stat_active_defrag_key_hits;  /* number of keys with moved allocations */
+    long long stat_active_defrag_key_misses;/* number of keys scanned and not moved */
+    long long stat_active_defrag_scanned;   /* number of dictEntries scanned */
+    size_t stat_peak_memory;        /* Max used memory record */
+    long long stat_fork_time;       /* Time needed to perform latest fork() */
+    double stat_fork_rate;          /* Fork rate in GB/sec. */
+    long long stat_total_forks;     /* Total count of fork. */
+    long long stat_rejected_conn;   /* Clients rejected because of maxclients */
+    long long stat_sync_full;       /* Number of full resyncs with slaves. */
+    long long stat_sync_partial_ok; /* Number of accepted PSYNC requests. */
+    long long stat_sync_partial_err;/* Number of unaccepted PSYNC requests. */
+    list *slowlog;                  /* SLOWLOG list of commands */
+    long long slowlog_entry_id;     /* SLOWLOG current entry ID */
+    long long slowlog_log_slower_than; /* SLOWLOG time limit (to get logged) */
+    unsigned long slowlog_max_len;     /* SLOWLOG max number of items logged */
+    struct malloc_stats cron_malloc_stats; /* sampled in serverCron(). */
+    redisAtomic long long stat_net_input_bytes; /* Bytes read from network. */
+    redisAtomic long long stat_net_output_bytes; /* Bytes written to network. */
+    size_t stat_current_cow_bytes;  /* Copy on write bytes while child is active. */
+    monotime stat_current_cow_updated;  /* Last update time of stat_current_cow_bytes */
+    size_t stat_current_save_keys_processed;  /* Processed keys while child is active. */
+    size_t stat_current_save_keys_total;  /* Number of keys when child started. */
+    size_t stat_rdb_cow_bytes;      /* Copy on write bytes during RDB saving. */
+    size_t stat_aof_cow_bytes;      /* Copy on write bytes during AOF rewrite. */
+    size_t stat_module_cow_bytes;   /* Copy on write bytes during module fork. */
+    double stat_module_progress;   /* Module save progress. */
+    uint64_t stat_clients_type_memory[CLIENT_TYPE_COUNT];/* Mem usage by type */
+    long long stat_unexpected_error_replies; /* Number of unexpected (aof-loading, replica to master, etc.) error replies */
+    long long stat_total_error_replies; /* Total number of issued error replies ( command + rejected errors ) */
+    long long stat_dump_payload_sanitizations; /* Number deep dump payloads integrity validations. */
+    long long stat_io_reads_processed; /* Number of read events processed by IO / Main threads */
+    long long stat_io_writes_processed; /* Number of write events processed by IO / Main threads */
+    redisAtomic long long stat_total_reads_processed; /* Total number of read events processed */
+    redisAtomic long long stat_total_writes_processed; /* Total number of write events processed */
+    /* The following two are used to track instantaneous metrics, like
+     * number of operations per second, network traffic. */
+    struct {
+        long long last_sample_time; /* Timestamp of last sample in ms */
+        long long last_sample_count;/* Count in last sample */
+        long long samples[STATS_METRIC_SAMPLES];
+        int idx;
+    } inst_metric[STATS_METRIC_COUNT];
+    /* Configuration */
+    int verbosity;                  /* Loglevel in redis.conf */
+    int maxidletime;                /* Client timeout in seconds */
+    int tcpkeepalive;               /* Set SO_KEEPALIVE if non-zero. */
+    int active_expire_enabled;      /* Can be disabled for testing purposes. */
+    int active_expire_effort;       /* From 1 (default) to 10, active effort. */
+    int active_defrag_enabled;
+    int sanitize_dump_payload;      /* Enables deep sanitization for ziplist and listpack in RDB and RESTORE. */
+    int skip_checksum_validation;   /* Disables checksum validateion for RDB and RESTORE payload. */
+    int jemalloc_bg_thread;         /* Enable jemalloc background thread */
+    size_t active_defrag_ignore_bytes; /* minimum amount of fragmentation waste to start active defrag */
+    int active_defrag_threshold_lower; /* minimum percentage of fragmentation to start active defrag */
+    int active_defrag_threshold_upper; /* maximum percentage of fragmentation at which we use maximum effort */
+    int active_defrag_cycle_min;       /* minimal effort for defrag in CPU percentage */
+    int active_defrag_cycle_max;       /* maximal effort for defrag in CPU percentage */
+    unsigned long active_defrag_max_scan_fields; /* maximum number of fields of set/hash/zset/list to process from within the main dict scan */
+    size_t client_max_querybuf_len; /* Limit for client query buffer length */
+    int dbnum;                      /* Total number of configured DBs */
+    int supervised;                 /* 1 if supervised, 0 otherwise. */
+    int supervised_mode;            /* See SUPERVISED_* */
+    int daemonize;                  /* True if running as a daemon */
+    int set_proc_title;             /* True if change proc title */
+    char *proc_title_template;      /* Process title template format */
+    clientBufferLimitsConfig client_obuf_limits[CLIENT_TYPE_OBUF_COUNT];
+    /* AOF persistence */
+    int aof_enabled;                /* AOF configuration */
+    int aof_state;                  /* AOF_(ON|OFF|WAIT_REWRITE) */
+    int aof_fsync;                  /* Kind of fsync() policy */
+    char *aof_filename;             /* Name of the AOF file */
+    int aof_no_fsync_on_rewrite;    /* Don't fsync if a rewrite is in prog. */
+    int aof_rewrite_perc;           /* Rewrite AOF if % growth is > M and... */
+    off_t aof_rewrite_min_size;     /* the AOF file is at least N bytes. */
+    off_t aof_rewrite_base_size;    /* AOF size on latest startup or rewrite. */
+    off_t aof_current_size;         /* AOF current size. */
+    off_t aof_fsync_offset;         /* AOF offset which is already synced to disk. */
+    int aof_flush_sleep;            /* Micros to sleep before flush. (used by tests) */
+    int aof_rewrite_scheduled;      /* Rewrite once BGSAVE terminates. */
+    list *aof_rewrite_buf_blocks;   /* Hold changes during an AOF rewrite. */
+    sds aof_buf;      /* AOF buffer, written before entering the event loop */
+    int aof_fd;       /* File descriptor of currently selected AOF file */
+    int aof_selected_db; /* Currently selected DB in AOF */
+    time_t aof_flush_postponed_start; /* UNIX time of postponed AOF flush */
+    time_t aof_last_fsync;            /* UNIX time of last fsync() */
+    time_t aof_rewrite_time_last;   /* Time used by last AOF rewrite run. */
+    time_t aof_rewrite_time_start;  /* Current AOF rewrite start time. */
+    int aof_lastbgrewrite_status;   /* C_OK or C_ERR */
+    unsigned long aof_delayed_fsync;  /* delayed AOF fsync() counter */
+    int aof_rewrite_incremental_fsync;/* fsync incrementally while aof rewriting? */
+    int rdb_save_incremental_fsync;   /* fsync incrementally while rdb saving? */
+    int aof_last_write_status;      /* C_OK or C_ERR */
+    int aof_last_write_errno;       /* Valid if aof write/fsync status is ERR */
+    int aof_load_truncated;         /* Don't stop on unexpected AOF EOF. */
+    int aof_use_rdb_preamble;       /* Use RDB preamble on AOF rewrites. */
+    redisAtomic int aof_bio_fsync_status; /* Status of AOF fsync in bio job. */
+    redisAtomic int aof_bio_fsync_errno;  /* Errno of AOF fsync in bio job. */
+    /* AOF pipes used to communicate between parent and child during rewrite. */
+    int aof_pipe_write_data_to_child;
+    int aof_pipe_read_data_from_parent;
+    int aof_pipe_write_ack_to_parent;
+    int aof_pipe_read_ack_from_child;
+    int aof_pipe_write_ack_to_child;
+    int aof_pipe_read_ack_from_parent;
+    int aof_stop_sending_diff;     /* If true stop sending accumulated diffs
+                                      to child process. */
+    sds aof_child_diff;             /* AOF diff accumulator child side. */
+    /* RDB persistence */
+    long long dirty;                /* Changes to DB from the last save */
+    long long dirty_before_bgsave;  /* Used to restore dirty on failed BGSAVE */
+    struct saveparam *saveparams;   /* Save points array for RDB */
+    int saveparamslen;              /* Number of saving points */
+    char *rdb_filename;             /* Name of RDB file */
+    int rdb_compression;            /* Use compression in RDB? */
+    int rdb_checksum;               /* Use RDB checksum? */
+    int rdb_del_sync_files;         /* Remove RDB files used only for SYNC if
+                                       the instance does not use persistence. */
+    time_t lastsave;                /* Unix time of last successful save */
+    time_t lastbgsave_try;          /* Unix time of last attempted bgsave */
+    time_t rdb_save_time_last;      /* Time used by last RDB save run. */
+    time_t rdb_save_time_start;     /* Current RDB save start time. */
+    int rdb_bgsave_scheduled;       /* BGSAVE when possible if true. */
+    int rdb_child_type;             /* Type of save by active child. */
+    int lastbgsave_status;          /* C_OK or C_ERR */
+    int stop_writes_on_bgsave_err;  /* Don't allow writes if can't BGSAVE */
+    int rdb_pipe_read;              /* RDB pipe used to transfer the rdb data */
+                                    /* to the parent process in diskless repl. */
+    int rdb_child_exit_pipe;        /* Used by the diskless parent allow child exit. */
+    connection **rdb_pipe_conns;    /* Connections which are currently the */
+    int rdb_pipe_numconns;          /* target of diskless rdb fork child. */
+    int rdb_pipe_numconns_writing;  /* Number of rdb conns with pending writes. */
+    char *rdb_pipe_buff;            /* In diskless replication, this buffer holds data */
+    int rdb_pipe_bufflen;           /* that was read from the the rdb pipe. */
+    int rdb_key_save_delay;         /* Delay in microseconds between keys while
+                                     * writing the RDB. (for testings). negative
+                                     * value means fractions of microsecons (on average). */
+    int key_load_delay;             /* Delay in microseconds between keys while
+                                     * loading aof or rdb. (for testings). negative
+                                     * value means fractions of microsecons (on average). */
+    /* Pipe and data structures for child -> parent info sharing. */
+    int child_info_pipe[2];         /* Pipe used to write the child_info_data. */
+    int child_info_nread;           /* Num of bytes of the last read from pipe */
+    /* Propagation of commands in AOF / replication */
+    redisOpArray also_propagate;    /* Additional command to propagate. */
+    int replication_allowed;        /* Are we allowed to replicate? */
+    /* Logging */
+    char *logfile;                  /* Path of log file */
+    int syslog_enabled;             /* Is syslog enabled? */
+    char *syslog_ident;             /* Syslog ident */
+    int syslog_facility;            /* Syslog facility */
+    int crashlog_enabled;           /* Enable signal handler for crashlog.
+                                     * disable for clean core dumps. */
+    int memcheck_enabled;           /* Enable memory check on crash. */
+    int use_exit_on_panic;          /* Use exit() on panic and assert rather than
+                                     * abort(). useful for Valgrind. */
+    /* Replication (master) */
+    char replid[CONFIG_RUN_ID_SIZE+1];  /* My current replication ID. */
+    char replid2[CONFIG_RUN_ID_SIZE+1]; /* replid inherited from master*/
+    long long master_repl_offset;   /* My current replication offset */
+    long long second_replid_offset; /* Accept offsets up to this for replid2. */
+    int slaveseldb;                 /* Last SELECTed DB in replication output */
+    int repl_ping_slave_period;     /* Master pings the slave every N seconds */
+    char *repl_backlog;             /* Replication backlog for partial syncs */
+    long long repl_backlog_size;    /* Backlog circular buffer size */
+    long long repl_backlog_histlen; /* Backlog actual data length */
+    long long repl_backlog_idx;     /* Backlog circular buffer current offset,
+                                       that is the next byte will'll write to.*/
+    long long repl_backlog_off;     /* Replication "master offset" of first
+                                       byte in the replication backlog buffer.*/
+    time_t repl_backlog_time_limit; /* Time without slaves after the backlog
+                                       gets released. */
+    time_t repl_no_slaves_since;    /* We have no slaves since that time.
+                                       Only valid if server.slaves len is 0. */
+    int repl_min_slaves_to_write;   /* Min number of slaves to write. */
+    int repl_min_slaves_max_lag;    /* Max lag of <count> slaves to write. */
+    int repl_good_slaves_count;     /* Number of slaves with lag <= max_lag. */
+    int repl_diskless_sync;         /* Master send RDB to slaves sockets directly. */
+    int repl_diskless_load;         /* Slave parse RDB directly from the socket.
+                                     * see REPL_DISKLESS_LOAD_* enum */
+    int repl_diskless_sync_delay;   /* Delay to start a diskless repl BGSAVE. */
+    /* Replication (slave) */
+    char *masteruser;               /* AUTH with this user and masterauth with master */
+    sds masterauth;                 /* AUTH with this password with master */
+    char *masterhost;               /* Hostname of master */
+    int masterport;                 /* Port of master */
+    int repl_timeout;               /* Timeout after N seconds of master idle */
+    client *master;     /* Client that is master for this slave */
+    client *cached_master; /* Cached master to be reused for PSYNC. */
+    int repl_syncio_timeout; /* Timeout for synchronous I/O calls */
+    int repl_state;          /* Replication status if the instance is a slave */
+    off_t repl_transfer_size; /* Size of RDB to read from master during sync. */
+    off_t repl_transfer_read; /* Amount of RDB read from master during sync. */
+    off_t repl_transfer_last_fsync_off; /* Offset when we fsync-ed last time. */
+    connection *repl_transfer_s;     /* Slave -> Master SYNC connection */
+    int repl_transfer_fd;    /* Slave -> Master SYNC temp file descriptor */
+    char *repl_transfer_tmpfile; /* Slave-> master SYNC temp file name */
+    time_t repl_transfer_lastio; /* Unix time of the latest read, for timeout */
+    int repl_serve_stale_data; /* Serve stale data when link is down? */
+    int repl_slave_ro;          /* Slave is read only? */
+    int repl_slave_ignore_maxmemory;    /* If true slaves do not evict. */
+    time_t repl_down_since; /* Unix time at which link with master went down */
+    int repl_disable_tcp_nodelay;   /* Disable TCP_NODELAY after SYNC? */
+    int slave_priority;             /* Reported in INFO and used by Sentinel. */
+    int replica_announced;          /* If true, replica is announced by Sentinel */
+    int slave_announce_port;        /* Give the master this listening port. */
+    char *slave_announce_ip;        /* Give the master this ip address. */
+    /* The following two fields is where we store master PSYNC replid/offset
+     * while the PSYNC is in progress. At the end we'll copy the fields into
+     * the server->master client structure. */
+    char master_replid[CONFIG_RUN_ID_SIZE+1];  /* Master PSYNC runid. */
+    long long master_initial_offset;           /* Master PSYNC offset. */
+    int repl_slave_lazy_flush;          /* Lazy FLUSHALL before loading DB? */
+    /* Replication script cache. */
+    dict *repl_scriptcache_dict;        /* SHA1 all slaves are aware of. */
+    list *repl_scriptcache_fifo;        /* First in, first out LRU eviction. */
+    unsigned int repl_scriptcache_size; /* Max number of elements. */
+    /* Synchronous replication. */
+    list *clients_waiting_acks;         /* Clients waiting in WAIT command. */
+    int get_ack_from_slaves;            /* If true we send REPLCONF GETACK. */
+    /* Limits */
+    unsigned int maxclients;            /* Max number of simultaneous clients */
+    unsigned long long maxmemory;   /* Max number of memory bytes to use */
+    int maxmemory_policy;           /* Policy for key eviction */
+    int maxmemory_samples;          /* Precision of random sampling */
+    int maxmemory_eviction_tenacity;/* Aggressiveness of eviction processing */
+    int lfu_log_factor;             /* LFU logarithmic counter factor. */
+    int lfu_decay_time;             /* LFU counter decay factor. */
+    long long proto_max_bulk_len;   /* Protocol bulk length maximum size. */
+    int oom_score_adj_base;         /* Base oom_score_adj value, as observed on startup */
+    int oom_score_adj_values[CONFIG_OOM_COUNT];   /* Linux oom_score_adj configuration */
+    int oom_score_adj;                            /* If true, oom_score_adj is managed */
+    int disable_thp;                              /* If true, disable THP by syscall */
+    /* Blocked clients */
+    unsigned int blocked_clients;   /* # of clients executing a blocking cmd.*/
+    unsigned int blocked_clients_by_type[BLOCKED_NUM];
+    list *unblocked_clients; /* list of clients to unblock before next loop */
+    list *ready_keys;        /* List of readyList structures for BLPOP & co */
+    /* Client side caching. */
+    unsigned int tracking_clients;  /* # of clients with tracking enabled.*/
+    size_t tracking_table_max_keys; /* Max number of keys in tracking table. */
+    /* Sort parameters - qsort_r() is only available under BSD so we
+     * have to take this state global, in order to pass it to sortCompare() */
+    int sort_desc;
+    int sort_alpha;
+    int sort_bypattern;
+    int sort_store;
+    /* Zip structure config, see redis.conf for more information  */
+    size_t hash_max_ziplist_entries;
+    size_t hash_max_ziplist_value;
+    size_t set_max_intset_entries;
+    size_t zset_max_ziplist_entries;
+    size_t zset_max_ziplist_value;
+    size_t hll_sparse_max_bytes;
+    size_t stream_node_max_bytes;
+    long long stream_node_max_entries;
+    /* List parameters */
+    int list_max_ziplist_size;
+    int list_compress_depth;
+    /* time cache */
+    redisAtomic time_t unixtime; /* Unix time sampled every cron cycle. */
+    time_t timezone;            /* Cached timezone. As set by tzset(). */
+    int daylight_active;        /* Currently in daylight saving time. */
+    mstime_t mstime;            /* 'unixtime' in milliseconds. */
+    ustime_t ustime;            /* 'unixtime' in microseconds. */
+    size_t blocking_op_nesting; /* Nesting level of blocking operation, used to reset blocked_last_cron. */
+    long long blocked_last_cron; /* Indicate the mstime of the last time we did cron jobs from a blocking operation */
+    /* Pubsub */
+    dict *pubsub_channels;  /* Map channels to list of subscribed clients */
+    dict *pubsub_patterns;  /* A dict of pubsub_patterns */
+    int notify_keyspace_events; /* Events to propagate via Pub/Sub. This is an
+                                   xor of NOTIFY_... flags. */
+    /* Cluster */
+    int cluster_enabled;      /* Is cluster enabled? */
+    mstime_t cluster_node_timeout; /* Cluster node timeout. */
+    char *cluster_configfile; /* Cluster auto-generated config file name. */
+    struct clusterState *cluster;  /* State of the cluster */
+    int cluster_migration_barrier; /* Cluster replicas migration barrier. */
+    int cluster_allow_replica_migration; /* Automatic replica migrations to orphaned masters and from empty masters */
+    int cluster_slave_validity_factor; /* Slave max data age for failover. */
+    int cluster_require_full_coverage; /* If true, put the cluster down if
+                                          there is at least an uncovered slot.*/
+    int cluster_slave_no_failover;  /* Prevent slave from starting a failover
+                                       if the master is in failure state. */
+    char *cluster_announce_ip;  /* IP address to announce on cluster bus. */
+    int cluster_announce_port;     /* base port to announce on cluster bus. */
+    int cluster_announce_tls_port; /* TLS port to announce on cluster bus. */
+    int cluster_announce_bus_port; /* bus port to announce on cluster bus. */
+    int cluster_module_flags;      /* Set of flags that Redis modules are able
+                                      to set in order to suppress certain
+                                      native Redis Cluster features. Check the
+                                      REDISMODULE_CLUSTER_FLAG_*. */
+    int cluster_allow_reads_when_down; /* Are reads allowed when the cluster
+                                        is down? */
+    int cluster_config_file_lock_fd;   /* cluster config fd, will be flock */
+    /* Scripting */
+    lua_State *lua; /* The Lua interpreter. We use just one for all clients */
+    client *lua_client;   /* The "fake client" to query Redis from Lua */
+    client *lua_caller;   /* The client running EVAL right now, or NULL */
+    char* lua_cur_script; /* SHA1 of the script currently running, or NULL */
+    dict *lua_scripts;         /* A dictionary of SHA1 -> Lua scripts */
+    unsigned long long lua_scripts_mem;  /* Cached scripts' memory + oh */
+    mstime_t lua_time_limit;  /* Script timeout in milliseconds */
+    monotime lua_time_start;  /* monotonic timer to detect timed-out script */
+    mstime_t lua_time_snapshot; /* Snapshot of mstime when script is started */
+    int lua_write_dirty;  /* True if a write command was called during the
+                             execution of the current script. */
+    int lua_random_dirty; /* True if a random command was called during the
+                             execution of the current script. */
+    int lua_replicate_commands; /* True if we are doing single commands repl. */
+    int lua_multi_emitted;/* True if we already propagated MULTI. */
+    int lua_repl;         /* Script replication flags for redis.set_repl(). */
+    int lua_timedout;     /* True if we reached the time limit for script
+                             execution. */
+    int lua_kill;         /* Kill the script if true. */
+    int lua_always_replicate_commands; /* Default replication type. */
+    int lua_oom;          /* OOM detected when script start? */
+    /* Lazy free */
+    int lazyfree_lazy_eviction;
+    int lazyfree_lazy_expire;
+    int lazyfree_lazy_server_del;
+    int lazyfree_lazy_user_del;
+    int lazyfree_lazy_user_flush;
+    /* Latency monitor */
+    long long latency_monitor_threshold;
+    dict *latency_events;
+    /* ACLs */
+    char *acl_filename;           /* ACL Users file. NULL if not configured. */
+    unsigned long acllog_max_len; /* Maximum length of the ACL LOG list. */
+    sds requirepass;              /* Remember the cleartext password set with
+                                     the old "requirepass" directive for
+                                     backward compatibility with Redis <= 5. */
+    int acl_pubsub_default;      /* Default ACL pub/sub channels flag */
+    /* Assert & bug reporting */
+    int watchdog_period;  /* Software watchdog period in ms. 0 = off */
+    /* System hardware info */
+    size_t system_memory_size;  /* Total memory in system as reported by OS */
+    /* TLS Configuration */
+    int tls_cluster;
+    int tls_replication;
+    int tls_auth_clients;
+    redisTLSContextConfig tls_ctx_config;
+    /* cpu affinity */
+    char *server_cpulist; /* cpu affinity list of redis server main/io thread. */
+    char *bio_cpulist; /* cpu affinity list of bio thread. */
+    char *aof_rewrite_cpulist; /* cpu affinity list of aof rewrite process. */
+    char *bgsave_cpulist; /* cpu affinity list of bgsave process. */
+    /* Sentinel config */
+    struct sentinelConfig *sentinel_config; /* sentinel config to load at startup time. */
+    /* Coordinate failover info */
+    mstime_t failover_end_time; /* Deadline for failover command. */
+    int force_failover; /* If true then failover will be foreced at the
+                         * deadline, otherwise failover is aborted. */
+    char *target_replica_host; /* Failover target host. If null during a
+                                * failover then any replica can be used. */
+    int target_replica_port; /* Failover target port */
+    int failover_state; /* Failover state */
+};
+
+#define MAX_KEYS_BUFFER 256
+
+/* A result structure for the various getkeys function calls. It lists the
+ * keys as indices to the provided argv.
+ */
+typedef struct {
+    int keysbuf[MAX_KEYS_BUFFER];       /* Pre-allocated buffer, to save heap allocations */
+    int *keys;                          /* Key indices array, points to keysbuf or heap */
+    int numkeys;                        /* Number of key indices return */
+    int size;                           /* Available array size */
+} getKeysResult;
+#define GETKEYS_RESULT_INIT { {0}, NULL, 0, MAX_KEYS_BUFFER }
+
+typedef void redisCommandProc(client *c);
+typedef int redisGetKeysProc(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+struct redisCommand {
+    char *name;
+    redisCommandProc *proc;
+    int arity;
+    char *sflags;   /* Flags as string representation, one char per flag. */
+    uint64_t flags; /* The actual flags, obtained from the 'sflags' field. */
+    /* Use a function to determine keys arguments in a command line.
+     * Used for Redis Cluster redirect. */
+    redisGetKeysProc *getkeys_proc;
+    /* What keys should be loaded in background when calling this command? */
+    int firstkey; /* The first argument that's a key (0 = no keys) */
+    int lastkey;  /* The last argument that's a key */
+    int keystep;  /* The step between first and last key */
+    long long microseconds, calls, rejected_calls, failed_calls;
+    int id;     /* Command ID. This is a progressive ID starting from 0 that
+                   is assigned at runtime, and is used in order to check
+                   ACLs. A connection is able to execute a given command if
+                   the user associated to the connection has this command
+                   bit set in the bitmap of allowed commands. */
+};
+
+struct redisError {
+    long long count;
+};
+
+struct redisFunctionSym {
+    char *name;
+    unsigned long pointer;
+};
+
+typedef struct _redisSortObject {
+    robj *obj;
+    union {
+        double score;
+        robj *cmpobj;
+    } u;
+} redisSortObject;
+
+typedef struct _redisSortOperation {
+    int type;
+    robj *pattern;
+} redisSortOperation;
+
+/* Structure to hold list iteration abstraction. */
+typedef struct {
+    robj *subject;
+    unsigned char encoding;
+    unsigned char direction; /* Iteration direction */
+    quicklistIter *iter;
+} listTypeIterator;
+
+/* Structure for an entry while iterating over a list. */
+typedef struct {
+    listTypeIterator *li;
+    quicklistEntry entry; /* Entry in quicklist */
+} listTypeEntry;
+
+/* Structure to hold set iteration abstraction. */
+typedef struct {
+    robj *subject;
+    int encoding;
+    int ii; /* intset iterator */
+    dictIterator *di;
+} setTypeIterator;
+
+/* Structure to hold hash iteration abstraction. Note that iteration over
+ * hashes involves both fields and values. Because it is possible that
+ * not both are required, store pointers in the iterator to avoid
+ * unnecessary memory allocation for fields/values. */
+typedef struct {
+    robj *subject;
+    int encoding;
+
+    unsigned char *fptr, *vptr;
+
+    dictIterator *di;
+    dictEntry *de;
+} hashTypeIterator;
+
+#include "stream.h"  /* Stream data type header file. */
+
+#define OBJ_HASH_KEY 1
+#define OBJ_HASH_VALUE 2
+
+/*-----------------------------------------------------------------------------
+ * Extern declarations
+ *----------------------------------------------------------------------------*/
+
+extern struct redisServer server;
+extern struct sharedObjectsStruct shared;
+extern dictType objectKeyPointerValueDictType;
+extern dictType objectKeyHeapPointerValueDictType;
+extern dictType setDictType;
+extern dictType zsetDictType;
+extern dictType clusterNodesDictType;
+extern dictType clusterNodesBlackListDictType;
+extern dictType dbDictType;
+extern dictType shaScriptObjectDictType;
+extern double R_Zero, R_PosInf, R_NegInf, R_Nan;
+extern dictType hashDictType;
+extern dictType replScriptCacheDictType;
+extern dictType dbExpiresDictType;
+extern dictType modulesDictType;
+extern dictType sdsReplyDictType;
+
+/*-----------------------------------------------------------------------------
+ * Functions prototypes
+ *----------------------------------------------------------------------------*/
+
+/* Modules */
+void moduleInitModulesSystem(void);
+void moduleInitModulesSystemLast(void);
+int moduleLoad(const char *path, void **argv, int argc);
+void moduleLoadFromQueue(void);
+int moduleGetCommandKeysViaAPI(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+moduleType *moduleTypeLookupModuleByID(uint64_t id);
+void moduleTypeNameByID(char *name, uint64_t moduleid);
+const char *moduleTypeModuleName(moduleType *mt);
+void moduleFreeContext(struct RedisModuleCtx *ctx);
+void unblockClientFromModule(client *c);
+void moduleHandleBlockedClients(void);
+void moduleBlockedClientTimedOut(client *c);
+void moduleBlockedClientPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask);
+size_t moduleCount(void);
+void moduleAcquireGIL(void);
+int moduleTryAcquireGIL(void);
+void moduleReleaseGIL(void);
+void moduleNotifyKeyspaceEvent(int type, const char *event, robj *key, int dbid);
+void moduleCallCommandFilters(client *c);
+void ModuleForkDoneHandler(int exitcode, int bysignal);
+int TerminateModuleForkChild(int child_pid, int wait);
+ssize_t rdbSaveModulesAux(rio *rdb, int when);
+int moduleAllDatatypesHandleErrors();
+sds modulesCollectInfo(sds info, const char *section, int for_crash_report, int sections);
+void moduleFireServerEvent(uint64_t eid, int subid, void *data);
+void processModuleLoadingProgressEvent(int is_aof);
+int moduleTryServeClientBlockedOnKey(client *c, robj *key);
+void moduleUnblockClient(client *c);
+int moduleBlockedClientMayTimeout(client *c);
+int moduleClientIsBlockedOnKeys(client *c);
+void moduleNotifyUserChanged(client *c);
+void moduleNotifyKeyUnlink(robj *key, robj *val);
+robj *moduleTypeDupOrReply(client *c, robj *fromkey, robj *tokey, robj *value);
+int moduleDefragValue(robj *key, robj *obj, long *defragged);
+int moduleLateDefrag(robj *key, robj *value, unsigned long *cursor, long long endtime, long long *defragged);
+long moduleDefragGlobals(void);
+
+/* Utils */
+long long ustime(void);
+long long mstime(void);
+void getRandomHexChars(char *p, size_t len);
+void getRandomBytes(unsigned char *p, size_t len);
+uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l);
+void exitFromChild(int retcode);
+long long redisPopcount(void *s, long count);
+int redisSetProcTitle(char *title);
+int validateProcTitleTemplate(const char *template);
+int redisCommunicateSystemd(const char *sd_notify_msg);
+void redisSetCpuAffinity(const char *cpulist);
+
+/* networking.c -- Networking and Client related operations */
+client *createClient(connection *conn);
+void closeTimedoutClients(void);
+void freeClient(client *c);
+void freeClientAsync(client *c);
+void resetClient(client *c);
+void freeClientOriginalArgv(client *c);
+void sendReplyToClient(connection *conn);
+void *addReplyDeferredLen(client *c);
+void setDeferredArrayLen(client *c, void *node, long length);
+void setDeferredMapLen(client *c, void *node, long length);
+void setDeferredSetLen(client *c, void *node, long length);
+void setDeferredAttributeLen(client *c, void *node, long length);
+void setDeferredPushLen(client *c, void *node, long length);
+void processInputBuffer(client *c);
+void processGopherRequest(client *c);
+void acceptHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+void acceptTLSHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+void acceptUnixHandler(aeEventLoop *el, int fd, void *privdata, int mask);
+void readQueryFromClient(connection *conn);
+void addReplyNull(client *c);
+void addReplyNullArray(client *c);
+void addReplyBool(client *c, int b);
+void addReplyVerbatim(client *c, const char *s, size_t len, const char *ext);
+void addReplyProto(client *c, const char *s, size_t len);
+void AddReplyFromClient(client *c, client *src);
+void addReplyBulk(client *c, robj *obj);
+void addReplyBulkCString(client *c, const char *s);
+void addReplyBulkCBuffer(client *c, const void *p, size_t len);
+void addReplyBulkLongLong(client *c, long long ll);
+void addReply(client *c, robj *obj);
+void addReplySds(client *c, sds s);
+void addReplyBulkSds(client *c, sds s);
+void setDeferredReplyBulkSds(client *c, void *node, sds s);
+void addReplyErrorObject(client *c, robj *err);
+void addReplyErrorSds(client *c, sds err);
+void addReplyError(client *c, const char *err);
+void addReplyStatus(client *c, const char *status);
+void addReplyDouble(client *c, double d);
+void addReplyBigNum(client *c, const char* num, size_t len);
+void addReplyHumanLongDouble(client *c, long double d);
+void addReplyLongLong(client *c, long long ll);
+void addReplyArrayLen(client *c, long length);
+void addReplyMapLen(client *c, long length);
+void addReplySetLen(client *c, long length);
+void addReplyAttributeLen(client *c, long length);
+void addReplyPushLen(client *c, long length);
+void addReplyHelp(client *c, const char **help);
+void addReplySubcommandSyntaxError(client *c);
+void addReplyLoadedModules(client *c);
+void copyClientOutputBuffer(client *dst, client *src);
+size_t sdsZmallocSize(sds s);
+size_t getStringObjectSdsUsedMemory(robj *o);
+void freeClientReplyValue(void *o);
+void *dupClientReplyValue(void *o);
+void getClientsMaxBuffers(unsigned long *longest_output_list,
+                          unsigned long *biggest_input_buffer);
+char *getClientPeerId(client *client);
+char *getClientSockName(client *client);
+sds catClientInfoString(sds s, client *client);
+sds getAllClientsInfoString(int type);
+void rewriteClientCommandVector(client *c, int argc, ...);
+void rewriteClientCommandArgument(client *c, int i, robj *newval);
+void replaceClientCommandVector(client *c, int argc, robj **argv);
+void redactClientCommandArgument(client *c, int argc);
+unsigned long getClientOutputBufferMemoryUsage(client *c);
+int freeClientsInAsyncFreeQueue(void);
+int closeClientOnOutputBufferLimitReached(client *c, int async);
+int getClientType(client *c);
+int getClientTypeByName(char *name);
+char *getClientTypeName(int class);
+void flushSlavesOutputBuffers(void);
+void disconnectSlaves(void);
+int listenToPort(int port, socketFds *fds);
+void pauseClients(mstime_t duration, pause_type type);
+void unpauseClients(void);
+int areClientsPaused(void);
+int checkClientPauseTimeoutAndReturnIfPaused(void);
+void processEventsWhileBlocked(void);
+void loadingCron(void);
+void whileBlockedCron();
+void blockingOperationStarts();
+void blockingOperationEnds();
+int handleClientsWithPendingWrites(void);
+int handleClientsWithPendingWritesUsingThreads(void);
+int handleClientsWithPendingReadsUsingThreads(void);
+int stopThreadedIOIfNeeded(void);
+int clientHasPendingReplies(client *c);
+void unlinkClient(client *c);
+int writeToClient(client *c, int handler_installed);
+void linkClient(client *c);
+void protectClient(client *c);
+void unprotectClient(client *c);
+void initThreadedIO(void);
+client *lookupClientByID(uint64_t id);
+int authRequired(client *c);
+
+#ifdef __GNUC__
+void addReplyErrorFormat(client *c, const char *fmt, ...)
+    __attribute__((format(printf, 2, 3)));
+void addReplyStatusFormat(client *c, const char *fmt, ...)
+    __attribute__((format(printf, 2, 3)));
+#else
+void addReplyErrorFormat(client *c, const char *fmt, ...);
+void addReplyStatusFormat(client *c, const char *fmt, ...);
+#endif
+
+/* Client side caching (tracking mode) */
+void enableTracking(client *c, uint64_t redirect_to, uint64_t options, robj **prefix, size_t numprefix);
+void disableTracking(client *c);
+void trackingRememberKeys(client *c);
+void trackingInvalidateKey(client *c, robj *keyobj);
+void trackingInvalidateKeysOnFlush(int async);
+void freeTrackingRadixTree(rax *rt);
+void freeTrackingRadixTreeAsync(rax *rt);
+void trackingLimitUsedSlots(void);
+uint64_t trackingGetTotalItems(void);
+uint64_t trackingGetTotalKeys(void);
+uint64_t trackingGetTotalPrefixes(void);
+void trackingBroadcastInvalidationMessages(void);
+int checkPrefixCollisionsOrReply(client *c, robj **prefix, size_t numprefix);
+
+/* List data type */
+void listTypeTryConversion(robj *subject, robj *value);
+void listTypePush(robj *subject, robj *value, int where);
+robj *listTypePop(robj *subject, int where);
+unsigned long listTypeLength(const robj *subject);
+listTypeIterator *listTypeInitIterator(robj *subject, long index, unsigned char direction);
+void listTypeReleaseIterator(listTypeIterator *li);
+int listTypeNext(listTypeIterator *li, listTypeEntry *entry);
+robj *listTypeGet(listTypeEntry *entry);
+void listTypeInsert(listTypeEntry *entry, robj *value, int where);
+int listTypeEqual(listTypeEntry *entry, robj *o);
+void listTypeDelete(listTypeIterator *iter, listTypeEntry *entry);
+void listTypeConvert(robj *subject, int enc);
+robj *listTypeDup(robj *o);
+void unblockClientWaitingData(client *c);
+void popGenericCommand(client *c, int where);
+void listElementsRemoved(client *c, robj *key, int where, robj *o, long count);
+
+/* MULTI/EXEC/WATCH... */
+void unwatchAllKeys(client *c);
+void initClientMultiState(client *c);
+void freeClientMultiState(client *c);
+void queueMultiCommand(client *c);
+void touchWatchedKey(redisDb *db, robj *key);
+int isWatchedKeyExpired(client *c);
+void touchAllWatchedKeysInDb(redisDb *emptied, redisDb *replaced_with);
+void discardTransaction(client *c);
+void flagTransaction(client *c);
+void execCommandAbort(client *c, sds error);
+void execCommandPropagateMulti(int dbid);
+void execCommandPropagateExec(int dbid);
+void beforePropagateMulti();
+void afterPropagateExec();
+
+/* Redis object implementation */
+void decrRefCount(robj *o);
+void decrRefCountVoid(void *o);
+void incrRefCount(robj *o);
+robj *makeObjectShared(robj *o);
+robj *resetRefCount(robj *obj);
+void freeStringObject(robj *o);
+void freeListObject(robj *o);
+void freeSetObject(robj *o);
+void freeZsetObject(robj *o);
+void freeHashObject(robj *o);
+robj *createObject(int type, void *ptr);
+robj *createStringObject(const char *ptr, size_t len);
+robj *createRawStringObject(const char *ptr, size_t len);
+robj *createEmbeddedStringObject(const char *ptr, size_t len);
+robj *tryCreateRawStringObject(const char *ptr, size_t len);
+robj *tryCreateStringObject(const char *ptr, size_t len);
+robj *dupStringObject(const robj *o);
+int isSdsRepresentableAsLongLong(sds s, long long *llval);
+int isObjectRepresentableAsLongLong(robj *o, long long *llongval);
+robj *tryObjectEncoding(robj *o);
+robj *getDecodedObject(robj *o);
+size_t stringObjectLen(robj *o);
+robj *createStringObjectFromLongLong(long long value);
+robj *createStringObjectFromLongLongForValue(long long value);
+robj *createStringObjectFromLongDouble(long double value, int humanfriendly);
+robj *createQuicklistObject(void);
+robj *createZiplistObject(void);
+robj *createSetObject(void);
+robj *createIntsetObject(void);
+robj *createHashObject(void);
+robj *createZsetObject(void);
+robj *createZsetZiplistObject(void);
+robj *createStreamObject(void);
+robj *createModuleObject(moduleType *mt, void *value);
+int getLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg);
+int getPositiveLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg);
+int getRangeLongFromObjectOrReply(client *c, robj *o, long min, long max, long *target, const char *msg);
+int checkType(client *c, robj *o, int type);
+int getLongLongFromObjectOrReply(client *c, robj *o, long long *target, const char *msg);
+int getDoubleFromObjectOrReply(client *c, robj *o, double *target, const char *msg);
+int getDoubleFromObject(const robj *o, double *target);
+int getLongLongFromObject(robj *o, long long *target);
+int getLongDoubleFromObject(robj *o, long double *target);
+int getLongDoubleFromObjectOrReply(client *c, robj *o, long double *target, const char *msg);
+int getIntFromObjectOrReply(client *c, robj *o, int *target, const char *msg);
+char *strEncoding(int encoding);
+int compareStringObjects(robj *a, robj *b);
+int collateStringObjects(robj *a, robj *b);
+int equalStringObjects(robj *a, robj *b);
+unsigned long long estimateObjectIdleTime(robj *o);
+void trimStringObjectIfNeeded(robj *o);
+#define sdsEncodedObject(objptr) (objptr->encoding == OBJ_ENCODING_RAW || objptr->encoding == OBJ_ENCODING_EMBSTR)
+
+/* Synchronous I/O with timeout */
+ssize_t syncWrite(int fd, char *ptr, ssize_t size, long long timeout);
+ssize_t syncRead(int fd, char *ptr, ssize_t size, long long timeout);
+ssize_t syncReadLine(int fd, char *ptr, ssize_t size, long long timeout);
+
+/* Replication */
+void replicationFeedSlaves(list *slaves, int dictid, robj **argv, int argc);
+void replicationFeedSlavesFromMasterStream(list *slaves, char *buf, size_t buflen);
+void replicationFeedMonitors(client *c, list *monitors, int dictid, robj **argv, int argc);
+void updateSlavesWaitingBgsave(int bgsaveerr, int type);
+void replicationCron(void);
+void replicationStartPendingFork(void);
+void replicationHandleMasterDisconnection(void);
+void replicationCacheMaster(client *c);
+void resizeReplicationBacklog(long long newsize);
+void replicationSetMaster(char *ip, int port);
+void replicationUnsetMaster(void);
+void refreshGoodSlavesCount(void);
+void replicationScriptCacheInit(void);
+void replicationScriptCacheFlush(void);
+void replicationScriptCacheAdd(sds sha1);
+int replicationScriptCacheExists(sds sha1);
+void processClientsWaitingReplicas(void);
+void unblockClientWaitingReplicas(client *c);
+int replicationCountAcksByOffset(long long offset);
+void replicationSendNewlineToMaster(void);
+long long replicationGetSlaveOffset(void);
+char *replicationGetSlaveName(client *c);
+long long getPsyncInitialOffset(void);
+int replicationSetupSlaveForFullResync(client *slave, long long offset);
+void changeReplicationId(void);
+void clearReplicationId2(void);
+void chopReplicationBacklog(void);
+void replicationCacheMasterUsingMyself(void);
+void feedReplicationBacklog(void *ptr, size_t len);
+void showLatestBacklog(void);
+void rdbPipeReadHandler(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask);
+void rdbPipeWriteHandlerConnRemoved(struct connection *conn);
+void clearFailoverState(void);
+void updateFailoverStatus(void);
+void abortFailover(const char *err);
+const char *getFailoverStateString();
+
+/* Generic persistence functions */
+void startLoadingFile(FILE* fp, char* filename, int rdbflags);
+void startLoading(size_t size, int rdbflags);
+void loadingProgress(off_t pos);
+void stopLoading(int success);
+void startSaving(int rdbflags);
+void stopSaving(int success);
+int allPersistenceDisabled(void);
+
+#define DISK_ERROR_TYPE_AOF 1       /* Don't accept writes: AOF errors. */
+#define DISK_ERROR_TYPE_RDB 2       /* Don't accept writes: RDB errors. */
+#define DISK_ERROR_TYPE_NONE 0      /* No problems, we can accept writes. */
+int writeCommandsDeniedByDiskError(void);
+
+/* RDB persistence */
+#include "rdb.h"
+void killRDBChild(void);
+int bg_unlink(const char *filename);
+
+/* AOF persistence */
+void flushAppendOnlyFile(int force);
+void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc);
+void aofRemoveTempFile(pid_t childpid);
+int rewriteAppendOnlyFileBackground(void);
+int loadAppendOnlyFile(char *filename);
+void stopAppendOnly(void);
+int startAppendOnly(void);
+void backgroundRewriteDoneHandler(int exitcode, int bysignal);
+void aofRewriteBufferReset(void);
+unsigned long aofRewriteBufferSize(void);
+ssize_t aofReadDiffFromParent(void);
+void killAppendOnlyChild(void);
+void restartAOFAfterSYNC();
+
+/* Child info */
+void openChildInfoPipe(void);
+void closeChildInfoPipe(void);
+void sendChildInfoGeneric(childInfoType info_type, size_t keys, double progress, char *pname);
+void sendChildCowInfo(childInfoType info_type, char *pname);
+void sendChildInfo(childInfoType info_type, size_t keys, char *pname);
+void receiveChildInfo(void);
+
+/* Fork helpers */
+int redisFork(int type);
+int hasActiveChildProcess();
+void resetChildState();
+int isMutuallyExclusiveChildType(int type);
+
+/* acl.c -- Authentication related prototypes. */
+extern rax *Users;
+extern user *DefaultUser;
+void ACLInit(void);
+/* Return values for ACLCheckAllPerm(). */
+#define ACL_OK 0
+#define ACL_DENIED_CMD 1
+#define ACL_DENIED_KEY 2
+#define ACL_DENIED_AUTH 3 /* Only used for ACL LOG entries. */
+#define ACL_DENIED_CHANNEL 4 /* Only used for pub/sub commands */
+int ACLCheckUserCredentials(robj *username, robj *password);
+int ACLAuthenticateUser(client *c, robj *username, robj *password);
+unsigned long ACLGetCommandID(const char *cmdname);
+void ACLClearCommandID(void);
+user *ACLGetUserByName(const char *name, size_t namelen);
+int ACLCheckAllPerm(client *c, int *idxptr);
+int ACLSetUser(user *u, const char *op, ssize_t oplen);
+sds ACLDefaultUserFirstPassword(void);
+uint64_t ACLGetCommandCategoryFlagByName(const char *name);
+int ACLAppendUserForLoading(sds *argv, int argc, int *argc_err);
+const char *ACLSetUserStringError(void);
+int ACLLoadConfiguredUsers(void);
+sds ACLDescribeUser(user *u);
+void ACLLoadUsersAtStartup(void);
+void addReplyCommandCategories(client *c, struct redisCommand *cmd);
+user *ACLCreateUnlinkedUser();
+void ACLFreeUserAndKillClients(user *u);
+void addACLLogEntry(client *c, int reason, int keypos, sds username);
+void ACLUpdateDefaultUserPassword(sds password);
+
+/* Sorted sets data type */
+
+/* Input flags. */
+#define ZADD_IN_NONE 0
+#define ZADD_IN_INCR (1<<0)    /* Increment the score instead of setting it. */
+#define ZADD_IN_NX (1<<1)      /* Don't touch elements not already existing. */
+#define ZADD_IN_XX (1<<2)      /* Only touch elements already existing. */
+#define ZADD_IN_GT (1<<3)      /* Only update existing when new scores are higher. */
+#define ZADD_IN_LT (1<<4)      /* Only update existing when new scores are lower. */
+
+/* Output flags. */
+#define ZADD_OUT_NOP (1<<0)     /* Operation not performed because of conditionals.*/
+#define ZADD_OUT_NAN (1<<1)     /* Only touch elements already existing. */
+#define ZADD_OUT_ADDED (1<<2)   /* The element was new and was added. */
+#define ZADD_OUT_UPDATED (1<<3) /* The element already existed, score updated. */
+
+/* Struct to hold an inclusive/exclusive range spec by score comparison. */
+typedef struct {
+    double min, max;
+    int minex, maxex; /* are min or max exclusive? */
+} zrangespec;
+
+/* Struct to hold an inclusive/exclusive range spec by lexicographic comparison. */
+typedef struct {
+    sds min, max;     /* May be set to shared.(minstring|maxstring) */
+    int minex, maxex; /* are min or max exclusive? */
+} zlexrangespec;
+
+zskiplist *zslCreate(void);
+void zslFree(zskiplist *zsl);
+zskiplistNode *zslInsert(zskiplist *zsl, double score, sds ele);
+unsigned char *zzlInsert(unsigned char *zl, sds ele, double score);
+int zslDelete(zskiplist *zsl, double score, sds ele, zskiplistNode **node);
+zskiplistNode *zslFirstInRange(zskiplist *zsl, zrangespec *range);
+zskiplistNode *zslLastInRange(zskiplist *zsl, zrangespec *range);
+double zzlGetScore(unsigned char *sptr);
+void zzlNext(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
+void zzlPrev(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
+unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range);
+unsigned char *zzlLastInRange(unsigned char *zl, zrangespec *range);
+unsigned long zsetLength(const robj *zobj);
+void zsetConvert(robj *zobj, int encoding);
+void zsetConvertToZiplistIfNeeded(robj *zobj, size_t maxelelen, size_t totelelen);
+int zsetScore(robj *zobj, sds member, double *score);
+unsigned long zslGetRank(zskiplist *zsl, double score, sds o);
+int zsetAdd(robj *zobj, double score, sds ele, int in_flags, int *out_flags, double *newscore);
+long zsetRank(robj *zobj, sds ele, int reverse);
+int zsetDel(robj *zobj, sds ele);
+robj *zsetDup(robj *o);
+int zsetZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep);
+void genericZpopCommand(client *c, robj **keyv, int keyc, int where, int emitkey, robj *countarg);
+sds ziplistGetObject(unsigned char *sptr);
+int zslValueGteMin(double value, zrangespec *spec);
+int zslValueLteMax(double value, zrangespec *spec);
+void zslFreeLexRange(zlexrangespec *spec);
+int zslParseLexRange(robj *min, robj *max, zlexrangespec *spec);
+unsigned char *zzlFirstInLexRange(unsigned char *zl, zlexrangespec *range);
+unsigned char *zzlLastInLexRange(unsigned char *zl, zlexrangespec *range);
+zskiplistNode *zslFirstInLexRange(zskiplist *zsl, zlexrangespec *range);
+zskiplistNode *zslLastInLexRange(zskiplist *zsl, zlexrangespec *range);
+int zzlLexValueGteMin(unsigned char *p, zlexrangespec *spec);
+int zzlLexValueLteMax(unsigned char *p, zlexrangespec *spec);
+int zslLexValueGteMin(sds value, zlexrangespec *spec);
+int zslLexValueLteMax(sds value, zlexrangespec *spec);
+
+/* Core functions */
+int getMaxmemoryState(size_t *total, size_t *logical, size_t *tofree, float *level);
+size_t freeMemoryGetNotCountedMemory();
+int overMaxmemoryAfterAlloc(size_t moremem);
+int processCommand(client *c);
+int processPendingCommandsAndResetClient(client *c);
+void setupSignalHandlers(void);
+void removeSignalHandlers(void);
+int createSocketAcceptHandler(socketFds *sfd, aeFileProc *accept_handler);
+int changeListenPort(int port, socketFds *sfd, aeFileProc *accept_handler);
+int changeBindAddr(sds *addrlist, int addrlist_len);
+struct redisCommand *lookupCommand(sds name);
+struct redisCommand *lookupCommandByCString(const char *s);
+struct redisCommand *lookupCommandOrOriginal(sds name);
+void call(client *c, int flags);
+void propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int flags);
+void alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int target);
+void redisOpArrayInit(redisOpArray *oa);
+void redisOpArrayFree(redisOpArray *oa);
+void forceCommandPropagation(client *c, int flags);
+void preventCommandPropagation(client *c);
+void preventCommandAOF(client *c);
+void preventCommandReplication(client *c);
+void slowlogPushCurrentCommand(client *c, struct redisCommand *cmd, ustime_t duration);
+int prepareForShutdown(int flags);
+#ifdef __GNUC__
+void _serverLog(int level, const char *fmt, ...)
+    __attribute__((format(printf, 2, 3)));
+#else
+void _serverLog(int level, const char *fmt, ...);
+#endif
+void serverLogRaw(int level, const char *msg);
+void serverLogFromHandler(int level, const char *msg);
+void usage(void);
+void updateDictResizePolicy(void);
+int htNeedsResize(dict *dict);
+void populateCommandTable(void);
+void resetCommandTableStats(void);
+void resetErrorTableStats(void);
+void adjustOpenFilesLimit(void);
+void incrementErrorCount(const char *fullerr, size_t namelen);
+void closeListeningSockets(int unlink_unix_socket);
+void updateCachedTime(int update_daylight_info);
+void resetServerStats(void);
+void activeDefragCycle(void);
+unsigned int getLRUClock(void);
+unsigned int LRU_CLOCK(void);
+const char *evictPolicyToString(void);
+struct redisMemOverhead *getMemoryOverheadData(void);
+void freeMemoryOverheadData(struct redisMemOverhead *mh);
+void checkChildrenDone(void);
+int setOOMScoreAdj(int process_class);
+void rejectCommandFormat(client *c, const char *fmt, ...);
+void *activeDefragAlloc(void *ptr);
+robj *activeDefragStringOb(robj* ob, long *defragged);
+
+#define RESTART_SERVER_NONE 0
+#define RESTART_SERVER_GRACEFULLY (1<<0)     /* Do proper shutdown. */
+#define RESTART_SERVER_CONFIG_REWRITE (1<<1) /* CONFIG REWRITE before restart.*/
+int restartServer(int flags, mstime_t delay);
+
+/* Set data type */
+robj *setTypeCreate(sds value);
+int setTypeAdd(robj *subject, sds value);
+int setTypeRemove(robj *subject, sds value);
+int setTypeIsMember(robj *subject, sds value);
+setTypeIterator *setTypeInitIterator(robj *subject);
+void setTypeReleaseIterator(setTypeIterator *si);
+int setTypeNext(setTypeIterator *si, sds *sdsele, int64_t *llele);
+sds setTypeNextObject(setTypeIterator *si);
+int setTypeRandomElement(robj *setobj, sds *sdsele, int64_t *llele);
+unsigned long setTypeRandomElements(robj *set, unsigned long count, robj *aux_set);
+unsigned long setTypeSize(const robj *subject);
+void setTypeConvert(robj *subject, int enc);
+robj *setTypeDup(robj *o);
+
+/* Hash data type */
+#define HASH_SET_TAKE_FIELD (1<<0)
+#define HASH_SET_TAKE_VALUE (1<<1)
+#define HASH_SET_COPY 0
+
+void hashTypeConvert(robj *o, int enc);
+void hashTypeTryConversion(robj *subject, robj **argv, int start, int end);
+int hashTypeExists(robj *o, sds key);
+int hashTypeDelete(robj *o, sds key);
+unsigned long hashTypeLength(const robj *o);
+hashTypeIterator *hashTypeInitIterator(robj *subject);
+void hashTypeReleaseIterator(hashTypeIterator *hi);
+int hashTypeNext(hashTypeIterator *hi);
+void hashTypeCurrentFromZiplist(hashTypeIterator *hi, int what,
+                                unsigned char **vstr,
+                                unsigned int *vlen,
+                                long long *vll);
+sds hashTypeCurrentFromHashTable(hashTypeIterator *hi, int what);
+void hashTypeCurrentObject(hashTypeIterator *hi, int what, unsigned char **vstr, unsigned int *vlen, long long *vll);
+sds hashTypeCurrentObjectNewSds(hashTypeIterator *hi, int what);
+robj *hashTypeLookupWriteOrCreate(client *c, robj *key);
+robj *hashTypeGetValueObject(robj *o, sds field);
+int hashTypeSet(robj *o, sds field, sds value, int flags);
+robj *hashTypeDup(robj *o);
+int hashZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep);
+
+/* Pub / Sub */
+int pubsubUnsubscribeAllChannels(client *c, int notify);
+int pubsubUnsubscribeAllPatterns(client *c, int notify);
+int pubsubPublishMessage(robj *channel, robj *message);
+void addReplyPubsubMessage(client *c, robj *channel, robj *msg);
+
+/* Keyspace events notification */
+void notifyKeyspaceEvent(int type, char *event, robj *key, int dbid);
+int keyspaceEventsStringToFlags(char *classes);
+sds keyspaceEventsFlagsToString(int flags);
+
+/* Configuration */
+void loadServerConfig(char *filename, char config_from_stdin, char *options);
+void appendServerSaveParams(time_t seconds, int changes);
+void resetServerSaveParams(void);
+struct rewriteConfigState; /* Forward declaration to export API. */
+void rewriteConfigRewriteLine(struct rewriteConfigState *state, const char *option, sds line, int force);
+void rewriteConfigMarkAsProcessed(struct rewriteConfigState *state, const char *option);
+int rewriteConfig(char *path, int force_all);
+void initConfigValues();
+
+/* db.c -- Keyspace access API */
+int removeExpire(redisDb *db, robj *key);
+void deleteExpiredKeyAndPropagate(redisDb *db, robj *keyobj);
+void propagateExpire(redisDb *db, robj *key, int lazy);
+int keyIsExpired(redisDb *db, robj *key);
+int expireIfNeeded(redisDb *db, robj *key);
+long long getExpire(redisDb *db, robj *key);
+void setExpire(client *c, redisDb *db, robj *key, long long when);
+int checkAlreadyExpired(long long when);
+robj *lookupKey(redisDb *db, robj *key, int flags);
+robj *lookupKeyRead(redisDb *db, robj *key);
+robj *lookupKeyWrite(redisDb *db, robj *key);
+robj *lookupKeyReadOrReply(client *c, robj *key, robj *reply);
+robj *lookupKeyWriteOrReply(client *c, robj *key, robj *reply);
+robj *lookupKeyReadWithFlags(redisDb *db, robj *key, int flags);
+robj *lookupKeyWriteWithFlags(redisDb *db, robj *key, int flags);
+robj *objectCommandLookup(client *c, robj *key);
+robj *objectCommandLookupOrReply(client *c, robj *key, robj *reply);
+void SentReplyOnKeyMiss(client *c, robj *reply);
+int objectSetLRUOrLFU(robj *val, long long lfu_freq, long long lru_idle,
+                       long long lru_clock, int lru_multiplier);
+#define LOOKUP_NONE 0
+#define LOOKUP_NOTOUCH (1<<0)
+#define LOOKUP_NONOTIFY (1<<1)
+void dbAdd(redisDb *db, robj *key, robj *val);
+int dbAddRDBLoad(redisDb *db, sds key, robj *val);
+void dbOverwrite(redisDb *db, robj *key, robj *val);
+void genericSetKey(client *c, redisDb *db, robj *key, robj *val, int keepttl, int signal);
+void setKey(client *c, redisDb *db, robj *key, robj *val);
+robj *dbRandomKey(redisDb *db);
+int dbSyncDelete(redisDb *db, robj *key);
+int dbDelete(redisDb *db, robj *key);
+robj *dbUnshareStringValue(redisDb *db, robj *key, robj *o);
+
+#define EMPTYDB_NO_FLAGS 0      /* No flags. */
+#define EMPTYDB_ASYNC (1<<0)    /* Reclaim memory in another thread. */
+long long emptyDb(int dbnum, int flags, void(callback)(void*));
+long long emptyDbStructure(redisDb *dbarray, int dbnum, int async, void(callback)(void*));
+void flushAllDataAndResetRDB(int flags);
+long long dbTotalServerKeyCount();
+dbBackup *backupDb(void);
+void restoreDbBackup(dbBackup *buckup);
+void discardDbBackup(dbBackup *buckup, int flags, void(callback)(void*));
+
+
+int selectDb(client *c, int id);
+void signalModifiedKey(client *c, redisDb *db, robj *key);
+void signalFlushedDb(int dbid, int async);
+unsigned int getKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count);
+unsigned int countKeysInSlot(unsigned int hashslot);
+unsigned int delKeysInSlot(unsigned int hashslot);
+int verifyClusterConfigWithData(void);
+void scanGenericCommand(client *c, robj *o, unsigned long cursor);
+int parseScanCursorOrReply(client *c, robj *o, unsigned long *cursor);
+void slotToKeyAdd(sds key);
+void slotToKeyDel(sds key);
+int dbAsyncDelete(redisDb *db, robj *key);
+void emptyDbAsync(redisDb *db);
+void slotToKeyFlush(int async);
+size_t lazyfreeGetPendingObjectsCount(void);
+size_t lazyfreeGetFreedObjectsCount(void);
+void freeObjAsync(robj *key, robj *obj);
+void freeSlotsToKeysMapAsync(rax *rt);
+void freeSlotsToKeysMap(rax *rt, int async);
+
+
+/* API to get key arguments from commands */
+int *getKeysPrepareResult(getKeysResult *result, int numkeys);
+int getKeysFromCommand(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+void getKeysFreeResult(getKeysResult *result);
+int zunionInterDiffGetKeys(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result);
+int zunionInterDiffStoreGetKeys(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result);
+int evalGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int sortGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int migrateGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int georadiusGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int xreadGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int memoryGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+int lcsGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
+
+/* Cluster */
+void clusterInit(void);
+unsigned short crc16(const char *buf, int len);
+unsigned int keyHashSlot(char *key, int keylen);
+void clusterCron(void);
+void clusterPropagatePublish(robj *channel, robj *message);
+void migrateCloseTimedoutSockets(void);
+void clusterBeforeSleep(void);
+int clusterSendModuleMessageToTarget(const char *target, uint64_t module_id, uint8_t type, unsigned char *payload, uint32_t len);
+
+/* Sentinel */
+void initSentinelConfig(void);
+void initSentinel(void);
+void sentinelTimer(void);
+const char *sentinelHandleConfiguration(char **argv, int argc);
+void queueSentinelConfig(sds *argv, int argc, int linenum, sds line);
+void loadSentinelConfigFromQueue(void);
+void sentinelIsRunning(void);
+void sentinelCheckConfigFile(void);
+
+/* redis-check-rdb & aof */
+int redis_check_rdb(char *rdbfilename, FILE *fp);
+int redis_check_rdb_main(int argc, char **argv, FILE *fp);
+int redis_check_aof_main(int argc, char **argv);
+
+/* Scripting */
+void scriptingInit(int setup);
+int ldbRemoveChild(pid_t pid);
+void ldbKillForkedSessions(void);
+int ldbPendingChildren(void);
+sds luaCreateFunction(client *c, lua_State *lua, robj *body);
+void freeLuaScriptsAsync(dict *lua_scripts);
+
+/* Blocked clients */
+void processUnblockedClients(void);
+void blockClient(client *c, int btype);
+void unblockClient(client *c);
+void queueClientForReprocessing(client *c);
+void replyToBlockedClientTimedOut(client *c);
+int getTimeoutFromObjectOrReply(client *c, robj *object, mstime_t *timeout, int unit);
+void disconnectAllBlockedClients(void);
+void handleClientsBlockedOnKeys(void);
+void signalKeyAsReady(redisDb *db, robj *key, int type);
+void blockForKeys(client *c, int btype, robj **keys, int numkeys, mstime_t timeout, robj *target, struct listPos *listpos, streamID *ids);
+void updateStatsOnUnblock(client *c, long blocked_us, long reply_us);
+
+/* timeout.c -- Blocked clients timeout and connections timeout. */
+void addClientToTimeoutTable(client *c);
+void removeClientFromTimeoutTable(client *c);
+void handleBlockedClientsTimeout(void);
+int clientsCronHandleTimeout(client *c, mstime_t now_ms);
+
+/* expire.c -- Handling of expired keys */
+void activeExpireCycle(int type);
+void expireSlaveKeys(void);
+void rememberSlaveKeyWithExpire(redisDb *db, robj *key);
+void flushSlaveKeysWithExpireList(void);
+size_t getSlaveKeyWithExpireCount(void);
+
+/* evict.c -- maxmemory handling and LRU eviction. */
+void evictionPoolAlloc(void);
+#define LFU_INIT_VAL 5
+unsigned long LFUGetTimeInMinutes(void);
+uint8_t LFULogIncr(uint8_t value);
+unsigned long LFUDecrAndReturn(robj *o);
+#define EVICT_OK 0
+#define EVICT_RUNNING 1
+#define EVICT_FAIL 2
+int performEvictions(void);
+
+
+/* Keys hashing / comparison functions for dict.c hash tables. */
+uint64_t dictSdsHash(const void *key);
+int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
+void dictSdsDestructor(void *privdata, void *val);
+
+/* Git SHA1 */
+char *redisGitSHA1(void);
+char *redisGitDirty(void);
+uint64_t redisBuildId(void);
+char *redisBuildIdString(void);
+
+/* Commands prototypes */
+void authCommand(client *c);
+void pingCommand(client *c);
+void echoCommand(client *c);
+void commandCommand(client *c);
+void setCommand(client *c);
+void setnxCommand(client *c);
+void setexCommand(client *c);
+void psetexCommand(client *c);
+void getCommand(client *c);
+void getexCommand(client *c);
+void getdelCommand(client *c);
+void delCommand(client *c);
+void unlinkCommand(client *c);
+void existsCommand(client *c);
+void setbitCommand(client *c);
+void getbitCommand(client *c);
+void bitfieldCommand(client *c);
+void bitfieldroCommand(client *c);
+void setrangeCommand(client *c);
+void getrangeCommand(client *c);
+void incrCommand(client *c);
+void decrCommand(client *c);
+void incrbyCommand(client *c);
+void decrbyCommand(client *c);
+void incrbyfloatCommand(client *c);
+void selectCommand(client *c);
+void swapdbCommand(client *c);
+void randomkeyCommand(client *c);
+void keysCommand(client *c);
+void scanCommand(client *c);
+void dbsizeCommand(client *c);
+void lastsaveCommand(client *c);
+void saveCommand(client *c);
+void bgsaveCommand(client *c);
+void bgrewriteaofCommand(client *c);
+void shutdownCommand(client *c);
+void moveCommand(client *c);
+void copyCommand(client *c);
+void renameCommand(client *c);
+void renamenxCommand(client *c);
+void lpushCommand(client *c);
+void rpushCommand(client *c);
+void lpushxCommand(client *c);
+void rpushxCommand(client *c);
+void linsertCommand(client *c);
+void lpopCommand(client *c);
+void rpopCommand(client *c);
+void llenCommand(client *c);
+void lindexCommand(client *c);
+void lrangeCommand(client *c);
+void ltrimCommand(client *c);
+void typeCommand(client *c);
+void lsetCommand(client *c);
+void saddCommand(client *c);
+void sremCommand(client *c);
+void smoveCommand(client *c);
+void sismemberCommand(client *c);
+void smismemberCommand(client *c);
+void scardCommand(client *c);
+void spopCommand(client *c);
+void srandmemberCommand(client *c);
+void sinterCommand(client *c);
+void sinterstoreCommand(client *c);
+void sunionCommand(client *c);
+void sunionstoreCommand(client *c);
+void sdiffCommand(client *c);
+void sdiffstoreCommand(client *c);
+void sscanCommand(client *c);
+void syncCommand(client *c);
+void flushdbCommand(client *c);
+void flushallCommand(client *c);
+void sortCommand(client *c);
+void lremCommand(client *c);
+void lposCommand(client *c);
+void rpoplpushCommand(client *c);
+void lmoveCommand(client *c);
+void infoCommand(client *c);
+void mgetCommand(client *c);
+void monitorCommand(client *c);
+void expireCommand(client *c);
+void expireatCommand(client *c);
+void pexpireCommand(client *c);
+void pexpireatCommand(client *c);
+void getsetCommand(client *c);
+void ttlCommand(client *c);
+void touchCommand(client *c);
+void pttlCommand(client *c);
+void persistCommand(client *c);
+void replicaofCommand(client *c);
+void roleCommand(client *c);
+void debugCommand(client *c);
+void msetCommand(client *c);
+void msetnxCommand(client *c);
+void zaddCommand(client *c);
+void zincrbyCommand(client *c);
+void zrangeCommand(client *c);
+void zrangebyscoreCommand(client *c);
+void zrevrangebyscoreCommand(client *c);
+void zrangebylexCommand(client *c);
+void zrevrangebylexCommand(client *c);
+void zcountCommand(client *c);
+void zlexcountCommand(client *c);
+void zrevrangeCommand(client *c);
+void zcardCommand(client *c);
+void zremCommand(client *c);
+void zscoreCommand(client *c);
+void zmscoreCommand(client *c);
+void zremrangebyscoreCommand(client *c);
+void zremrangebylexCommand(client *c);
+void zpopminCommand(client *c);
+void zpopmaxCommand(client *c);
+void bzpopminCommand(client *c);
+void bzpopmaxCommand(client *c);
+void zrandmemberCommand(client *c);
+void multiCommand(client *c);
+void execCommand(client *c);
+void discardCommand(client *c);
+void blpopCommand(client *c);
+void brpopCommand(client *c);
+void brpoplpushCommand(client *c);
+void blmoveCommand(client *c);
+void appendCommand(client *c);
+void strlenCommand(client *c);
+void zrankCommand(client *c);
+void zrevrankCommand(client *c);
+void hsetCommand(client *c);
+void hsetnxCommand(client *c);
+void hgetCommand(client *c);
+void hmsetCommand(client *c);
+void hmgetCommand(client *c);
+void hdelCommand(client *c);
+void hlenCommand(client *c);
+void hstrlenCommand(client *c);
+void zremrangebyrankCommand(client *c);
+void zunionstoreCommand(client *c);
+void zinterstoreCommand(client *c);
+void zdiffstoreCommand(client *c);
+void zunionCommand(client *c);
+void zinterCommand(client *c);
+void zrangestoreCommand(client *c);
+void zdiffCommand(client *c);
+void zscanCommand(client *c);
+void hkeysCommand(client *c);
+void hvalsCommand(client *c);
+void hgetallCommand(client *c);
+void hexistsCommand(client *c);
+void hscanCommand(client *c);
+void hrandfieldCommand(client *c);
+void configCommand(client *c);
+void hincrbyCommand(client *c);
+void hincrbyfloatCommand(client *c);
+void subscribeCommand(client *c);
+void unsubscribeCommand(client *c);
+void psubscribeCommand(client *c);
+void punsubscribeCommand(client *c);
+void publishCommand(client *c);
+void pubsubCommand(client *c);
+void watchCommand(client *c);
+void unwatchCommand(client *c);
+void clusterCommand(client *c);
+void restoreCommand(client *c);
+void migrateCommand(client *c);
+void askingCommand(client *c);
+void readonlyCommand(client *c);
+void readwriteCommand(client *c);
+void dumpCommand(client *c);
+void objectCommand(client *c);
+void memoryCommand(client *c);
+void clientCommand(client *c);
+void helloCommand(client *c);
+void evalCommand(client *c);
+void evalShaCommand(client *c);
+void scriptCommand(client *c);
+void timeCommand(client *c);
+void bitopCommand(client *c);
+void bitcountCommand(client *c);
+void bitposCommand(client *c);
+void replconfCommand(client *c);
+void waitCommand(client *c);
+void geoencodeCommand(client *c);
+void geodecodeCommand(client *c);
+void georadiusbymemberCommand(client *c);
+void georadiusbymemberroCommand(client *c);
+void georadiusCommand(client *c);
+void georadiusroCommand(client *c);
+void geoaddCommand(client *c);
+void geohashCommand(client *c);
+void geoposCommand(client *c);
+void geodistCommand(client *c);
+void geosearchCommand(client *c);
+void geosearchstoreCommand(client *c);
+void pfselftestCommand(client *c);
+void pfaddCommand(client *c);
+void pfcountCommand(client *c);
+void pfmergeCommand(client *c);
+void pfdebugCommand(client *c);
+void latencyCommand(client *c);
+void moduleCommand(client *c);
+void securityWarningCommand(client *c);
+void xaddCommand(client *c);
+void xrangeCommand(client *c);
+void xrevrangeCommand(client *c);
+void xlenCommand(client *c);
+void xreadCommand(client *c);
+void xgroupCommand(client *c);
+void xsetidCommand(client *c);
+void xackCommand(client *c);
+void xpendingCommand(client *c);
+void xclaimCommand(client *c);
+void xautoclaimCommand(client *c);
+void xinfoCommand(client *c);
+void xdelCommand(client *c);
+void xtrimCommand(client *c);
+void lolwutCommand(client *c);
+void aclCommand(client *c);
+void stralgoCommand(client *c);
+void resetCommand(client *c);
+void failoverCommand(client *c);
+
+#if defined(__GNUC__)
+void *calloc(size_t count, size_t size) __attribute__ ((deprecated));
+void free(void *ptr) __attribute__ ((deprecated));
+void *malloc(size_t size) __attribute__ ((deprecated));
+void *realloc(void *ptr, size_t size) __attribute__ ((deprecated));
+#endif
+
+/* Debugging stuff */
+void _serverAssertWithInfo(const client *c, const robj *o, const char *estr, const char *file, int line);
+void _serverAssert(const char *estr, const char *file, int line);
+#ifdef __GNUC__
+void _serverPanic(const char *file, int line, const char *msg, ...)
+    __attribute__ ((format (printf, 3, 4)));
+#else
+void _serverPanic(const char *file, int line, const char *msg, ...);
+#endif
+void serverLogObjectDebugInfo(const robj *o);
+void sigsegvHandler(int sig, siginfo_t *info, void *secret);
+const char *getSafeInfoString(const char *s, size_t len, char **tmp);
+sds genRedisInfoString(const char *section);
+sds genModulesInfoString(sds info);
+void enableWatchdog(int period);
+void disableWatchdog(void);
+void watchdogScheduleSignal(int period);
+void serverLogHexDump(int level, char *descr, void *value, size_t len);
+int memtest_preserving_test(unsigned long *m, size_t bytes, int passes);
+void mixDigest(unsigned char *digest, void *ptr, size_t len);
+void xorDigest(unsigned char *digest, void *ptr, size_t len);
+int populateCommandTableParseFlags(struct redisCommand *c, char *strflags);
+void debugDelay(int usec);
+void killIOThreads(void);
+void killThreads(void);
+void makeThreadKillable(void);
+
+/* Use macro for checking log level to avoid evaluating arguments in cases log
+ * should be ignored due to low level. */
+#define serverLog(level, ...) do {\
+        if (((level)&0xff) < server.verbosity) break;\
+        _serverLog(level, __VA_ARGS__);\
+    } while(0)
+
+/* TLS stuff */
+void tlsInit(void);
+void tlsCleanup(void);
+int tlsConfigure(redisTLSContextConfig *ctx_config);
+
+#define redisDebug(fmt, ...) \
+    printf("DEBUG %s:%d > " fmt "\n", __FILE__, __LINE__, __VA_ARGS__)
+#define redisDebugMark() \
+    printf("-- MARK %s:%d --\n", __FILE__, __LINE__)
+
+int iAmMaster(void);
+
+#endif
diff --git a/redis-stable/src/setcpuaffinity.c b/redis-stable/src/setcpuaffinity.c
new file mode 100644
index 00000000..77b16210
--- /dev/null
+++ b/redis-stable/src/setcpuaffinity.c
@@ -0,0 +1,155 @@
+/* ==========================================================================
+ * setcpuaffinity.c - Linux/BSD setcpuaffinity.
+ * --------------------------------------------------------------------------
+ * Copyright (C) 2020  zhenwei pi
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to permit
+ * persons to whom the Software is furnished to do so, subject to the
+ * following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included
+ * in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+ * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+ * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+ * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ * USE OR OTHER DEALINGS IN THE SOFTWARE.
+ * ==========================================================================
+ */
+#ifndef _GNU_SOURCE
+#define _GNU_SOURCE
+#endif
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#ifdef __linux__
+#include <sched.h>
+#endif
+#ifdef __FreeBSD__
+#include <sys/param.h>
+#include <sys/cpuset.h>
+#endif
+#ifdef __DragonFly__
+#include <pthread.h>
+#include <pthread_np.h>
+#endif
+#ifdef __NetBSD__
+#include <pthread.h>
+#include <sched.h>
+#endif
+#include "config.h"
+
+#ifdef USE_SETCPUAFFINITY
+static const char *next_token(const char *q,  int sep) {
+    if (q)
+        q = strchr(q, sep);
+    if (q)
+        q++;
+
+    return q;
+}
+
+static int next_num(const char *str, char **end, int *result) {
+    if (!str || *str == '\0' || !isdigit(*str))
+        return -1;
+
+    *result = strtoul(str, end, 10);
+    if (str == *end)
+        return -1;
+
+    return 0;
+}
+
+/* set current thread cpu affinity to cpu list, this function works like
+ * taskset command (actually cpulist parsing logic reference to util-linux).
+ * example of this function: "0,2,3", "0,2-3", "0-20:2". */
+void setcpuaffinity(const char *cpulist) {
+    const char *p, *q;
+    char *end = NULL;
+#ifdef __linux__
+    cpu_set_t cpuset;
+#endif
+#if defined (__FreeBSD__) || defined(__DragonFly__)
+    cpuset_t cpuset;
+#endif
+#ifdef __NetBSD__
+    cpuset_t *cpuset;
+#endif
+
+    if (!cpulist)
+        return;
+
+#ifndef __NetBSD__
+    CPU_ZERO(&cpuset);
+#else
+    cpuset = cpuset_create();
+#endif
+
+    q = cpulist;
+    while (p = q, q = next_token(q, ','), p) {
+        int a, b, s;
+        const char *c1, *c2;
+
+        if (next_num(p, &end, &a) != 0)
+            return;
+
+        b = a;
+        s = 1;
+        p = end;
+
+        c1 = next_token(p, '-');
+        c2 = next_token(p, ',');
+
+        if (c1 != NULL && (c2 == NULL || c1 < c2)) {
+            if (next_num(c1, &end, &b) != 0)
+                return;
+
+            c1 = end && *end ? next_token(end, ':') : NULL;
+            if (c1 != NULL && (c2 == NULL || c1 < c2)) {
+                if (next_num(c1, &end, &s) != 0)
+                    return;
+
+                if (s == 0)
+                    return;
+            }
+        }
+
+        if ((a > b))
+            return;
+
+        while (a <= b) {
+#ifndef __NetBSD__
+            CPU_SET(a, &cpuset);
+#else
+            cpuset_set(a, cpuset);
+#endif
+            a += s;
+        }
+    }
+
+    if (end && *end)
+        return;
+
+#ifdef __linux__
+    sched_setaffinity(0, sizeof(cpuset), &cpuset);
+#endif
+#ifdef __FreeBSD__
+    cpuset_setaffinity(CPU_LEVEL_WHICH, CPU_WHICH_TID, -1, sizeof(cpuset), &cpuset);
+#endif
+#ifdef __DragonFly__
+    pthread_setaffinity_np(pthread_self(), sizeof(cpuset), &cpuset);
+#endif
+#ifdef __NetBSD__
+    pthread_setaffinity_np(pthread_self(), cpuset_size(cpuset), cpuset);
+    cpuset_destroy(cpuset);
+#endif
+}
+
+#endif /* USE_SETCPUAFFINITY */
diff --git a/redis-stable/src/setproctitle.c b/redis-stable/src/setproctitle.c
new file mode 100644
index 00000000..01940234
--- /dev/null
+++ b/redis-stable/src/setproctitle.c
@@ -0,0 +1,331 @@
+/* ==========================================================================
+ * setproctitle.c - Linux/Darwin setproctitle.
+ * --------------------------------------------------------------------------
+ * Copyright (C) 2010  William Ahern
+ * Copyright (C) 2013  Salvatore Sanfilippo
+ * Copyright (C) 2013  Stam He
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to permit
+ * persons to whom the Software is furnished to do so, subject to the
+ * following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included
+ * in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
+ * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+ * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+ * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ * USE OR OTHER DEALINGS IN THE SOFTWARE.
+ * ==========================================================================
+ */
+#ifndef _GNU_SOURCE
+#define _GNU_SOURCE
+#endif
+
+#include <stddef.h>	/* NULL size_t */
+#include <stdarg.h>	/* va_list va_start va_end */
+#include <stdlib.h>	/* malloc(3) setenv(3) clearenv(3) setproctitle(3) getprogname(3) */
+#include <stdio.h>	/* vsnprintf(3) snprintf(3) */
+
+#include <string.h>	/* strlen(3) strchr(3) strdup(3) memset(3) memcpy(3) */
+
+#include <errno.h>	/* errno program_invocation_name program_invocation_short_name */
+
+#if !defined(HAVE_SETPROCTITLE)
+#if (defined __NetBSD__ || defined __FreeBSD__ || defined __OpenBSD__ || defined __DragonFly__)
+#define HAVE_SETPROCTITLE 1
+#else
+#define HAVE_SETPROCTITLE 0
+#endif
+#endif
+
+
+#if !HAVE_SETPROCTITLE
+#if (defined __linux || defined __APPLE__)
+
+#ifdef __GLIBC__
+#define HAVE_CLEARENV
+#endif
+
+extern char **environ;
+
+static struct {
+	/* original value */
+	const char *arg0;
+
+	/* title space available */
+	char *base, *end;
+
+	 /* pointer to original nul character within base */
+	char *nul;
+
+	_Bool reset;
+	int error;
+} SPT;
+
+
+#ifndef SPT_MIN
+#define SPT_MIN(a, b) (((a) < (b))? (a) : (b))
+#endif
+
+static inline size_t spt_min(size_t a, size_t b) {
+	return SPT_MIN(a, b);
+} /* spt_min() */
+
+
+/*
+ * For discussion on the portability of the various methods, see
+ * http://lists.freebsd.org/pipermail/freebsd-stable/2008-June/043136.html
+ */
+int spt_clearenv(void) {
+#ifdef HAVE_CLEARENV
+	return clearenv();
+#else
+	extern char **environ;
+	static char **tmp;
+
+	if (!(tmp = malloc(sizeof *tmp)))
+		return errno;
+
+	tmp[0]  = NULL;
+	environ = tmp;
+
+	return 0;
+#endif
+} /* spt_clearenv() */
+
+
+static int spt_copyenv(int envc, char *oldenv[]) {
+	extern char **environ;
+	char **envcopy = NULL;
+	char *eq;
+	int i, error;
+	int envsize;
+
+	if (environ != oldenv)
+		return 0;
+
+	/* Copy environ into envcopy before clearing it. Shallow copy is
+	 * enough as clearenv() only clears the environ array.
+	 */
+	envsize = (envc + 1) * sizeof(char *);
+	envcopy = malloc(envsize);
+	if (!envcopy)
+		return ENOMEM;
+	memcpy(envcopy, oldenv, envsize);
+
+	/* Note that the state after clearenv() failure is undefined, but we'll
+	 * just assume an error means it was left unchanged.
+	 */
+	if ((error = spt_clearenv())) {
+		environ = oldenv;
+		free(envcopy);
+		return error;
+	}
+
+	/* Set environ from envcopy */
+	for (i = 0; envcopy[i]; i++) {
+		if (!(eq = strchr(envcopy[i], '=')))
+			continue;
+
+		*eq = '\0';
+		error = (0 != setenv(envcopy[i], eq + 1, 1))? errno : 0;
+		*eq = '=';
+
+		/* On error, do our best to restore state */
+		if (error) {
+#ifdef HAVE_CLEARENV
+			/* We don't assume it is safe to free environ, so we
+			 * may leak it. As clearenv() was shallow using envcopy
+			 * here is safe.
+			 */
+			environ = envcopy;
+#else
+			free(envcopy);
+			free(environ);  /* Safe to free, we have just alloc'd it */
+			environ = oldenv;
+#endif
+			return error;
+		}
+	}
+
+	free(envcopy);
+	return 0;
+} /* spt_copyenv() */
+
+
+static int spt_copyargs(int argc, char *argv[]) {
+	char *tmp;
+	int i;
+
+	for (i = 1; i < argc || (i >= argc && argv[i]); i++) {
+		if (!argv[i])
+			continue;
+
+		if (!(tmp = strdup(argv[i])))
+			return errno;
+
+		argv[i] = tmp;
+	}
+
+	return 0;
+} /* spt_copyargs() */
+
+/* Initialize and populate SPT to allow a future setproctitle()
+ * call.
+ *
+ * As setproctitle() basically needs to overwrite argv[0], we're
+ * trying to determine what is the largest contiguous block
+ * starting at argv[0] we can use for this purpose.
+ *
+ * As this range will overwrite some or all of the argv and environ
+ * strings, a deep copy of these two arrays is performed.
+ */
+void spt_init(int argc, char *argv[]) {
+        char **envp = environ;
+	char *base, *end, *nul, *tmp;
+	int i, error, envc;
+
+	if (!(base = argv[0]))
+		return;
+
+	/* We start with end pointing at the end of argv[0] */
+	nul = &base[strlen(base)];
+	end = nul + 1;
+
+	/* Attempt to extend end as far as we can, while making sure
+	 * that the range between base and end is only allocated to
+	 * argv, or anything that immediately follows argv (presumably
+	 * envp).
+	 */
+	for (i = 0; i < argc || (i >= argc && argv[i]); i++) {
+		if (!argv[i] || argv[i] < end)
+			continue;
+
+		if (end >= argv[i] && end <= argv[i] + strlen(argv[i]))
+			end = argv[i] + strlen(argv[i]) + 1;
+	}
+
+	/* In case the envp array was not an immediate extension to argv,
+	 * scan it explicitly.
+	 */
+	for (i = 0; envp[i]; i++) {
+		if (envp[i] < end)
+			continue;
+
+		if (end >= envp[i] && end <= envp[i] + strlen(envp[i]))
+			end = envp[i] + strlen(envp[i]) + 1;
+	}
+	envc = i;
+
+	/* We're going to deep copy argv[], but argv[0] will still point to
+	 * the old memory for the purpose of updating the title so we need
+	 * to keep the original value elsewhere.
+	 */
+	if (!(SPT.arg0 = strdup(argv[0])))
+		goto syerr;
+
+#if __linux__
+	if (!(tmp = strdup(program_invocation_name)))
+		goto syerr;
+
+	program_invocation_name = tmp;
+
+	if (!(tmp = strdup(program_invocation_short_name)))
+		goto syerr;
+
+	program_invocation_short_name = tmp;
+#elif __APPLE__
+	if (!(tmp = strdup(getprogname())))
+		goto syerr;
+
+	setprogname(tmp);
+#endif
+
+    /* Now make a full deep copy of the environment and argv[] */
+	if ((error = spt_copyenv(envc, envp)))
+		goto error;
+
+	if ((error = spt_copyargs(argc, argv)))
+		goto error;
+
+	SPT.nul  = nul;
+	SPT.base = base;
+	SPT.end  = end;
+
+	return;
+syerr:
+	error = errno;
+error:
+	SPT.error = error;
+} /* spt_init() */
+
+
+#ifndef SPT_MAXTITLE
+#define SPT_MAXTITLE 255
+#endif
+
+void setproctitle(const char *fmt, ...) {
+	char buf[SPT_MAXTITLE + 1]; /* use buffer in case argv[0] is passed */
+	va_list ap;
+	char *nul;
+	int len, error;
+
+	if (!SPT.base)
+		return;
+
+	if (fmt) {
+		va_start(ap, fmt);
+		len = vsnprintf(buf, sizeof buf, fmt, ap);
+		va_end(ap);
+	} else {
+		len = snprintf(buf, sizeof buf, "%s", SPT.arg0);
+	}
+
+	if (len <= 0)
+		{ error = errno; goto error; }
+
+	if (!SPT.reset) {
+		memset(SPT.base, 0, SPT.end - SPT.base);
+		SPT.reset = 1;
+	} else {
+		memset(SPT.base, 0, spt_min(sizeof buf, SPT.end - SPT.base));
+	}
+
+	len = spt_min(len, spt_min(sizeof buf, SPT.end - SPT.base) - 1);
+	memcpy(SPT.base, buf, len);
+	nul = &SPT.base[len];
+
+	if (nul < SPT.nul) {
+		*SPT.nul = '.';
+	} else if (nul == SPT.nul && &nul[1] < SPT.end) {
+		*SPT.nul = ' ';
+		*++nul = '\0';
+	}
+
+	return;
+error:
+	SPT.error = error;
+} /* setproctitle() */
+
+
+#endif /* __linux || __APPLE__ */
+#endif /* !HAVE_SETPROCTITLE */
+
+#ifdef SETPROCTITLE_TEST_MAIN
+int main(int argc, char *argv[]) {
+	spt_init(argc, argv);
+
+	printf("SPT.arg0: [%p] '%s'\n", SPT.arg0, SPT.arg0);
+	printf("SPT.base: [%p] '%s'\n", SPT.base, SPT.base);
+	printf("SPT.end: [%p] (%d bytes after base)'\n", SPT.end, (int) (SPT.end - SPT.base));
+	return 0;
+}
+#endif
diff --git a/redis-stable/src/sha1.c b/redis-stable/src/sha1.c
new file mode 100644
index 00000000..f2423c05
--- /dev/null
+++ b/redis-stable/src/sha1.c
@@ -0,0 +1,228 @@
+
+/* from valgrind tests */
+
+/* ================ sha1.c ================ */
+/*
+SHA-1 in C
+By Steve Reid <steve@edmweb.com>
+100% Public Domain
+
+Test Vectors (from FIPS PUB 180-1)
+"abc"
+  A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
+"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
+  84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
+A million repetitions of "a"
+  34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
+*/
+
+/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
+/* #define SHA1HANDSOFF * Copies data before messing with it. */
+
+#define SHA1HANDSOFF
+
+#include <stdio.h>
+#include <string.h>
+#include <stdint.h>
+#include "solarisfixes.h"
+#include "sha1.h"
+#include "config.h"
+
+#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
+
+/* blk0() and blk() perform the initial expand. */
+/* I got the idea of expanding during the round function from SSLeay */
+#if BYTE_ORDER == LITTLE_ENDIAN
+#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
+    |(rol(block->l[i],8)&0x00FF00FF))
+#elif BYTE_ORDER == BIG_ENDIAN
+#define blk0(i) block->l[i]
+#else
+#error "Endianness not defined!"
+#endif
+#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
+    ^block->l[(i+2)&15]^block->l[i&15],1))
+
+/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
+#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
+#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
+#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
+#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
+#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
+
+
+/* Hash a single 512-bit block. This is the core of the algorithm. */
+
+void SHA1Transform(uint32_t state[5], const unsigned char buffer[64])
+{
+    uint32_t a, b, c, d, e;
+    typedef union {
+        unsigned char c[64];
+        uint32_t l[16];
+    } CHAR64LONG16;
+#ifdef SHA1HANDSOFF
+    CHAR64LONG16 block[1];  /* use array to appear as a pointer */
+    memcpy(block, buffer, 64);
+#else
+    /* The following had better never be used because it causes the
+     * pointer-to-const buffer to be cast into a pointer to non-const.
+     * And the result is written through.  I threw a "const" in, hoping
+     * this will cause a diagnostic.
+     */
+    CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
+#endif
+    /* Copy context->state[] to working vars */
+    a = state[0];
+    b = state[1];
+    c = state[2];
+    d = state[3];
+    e = state[4];
+    /* 4 rounds of 20 operations each. Loop unrolled. */
+    R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
+    R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
+    R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
+    R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
+    R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
+    R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
+    R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
+    R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
+    R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
+    R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
+    R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
+    R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
+    R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
+    R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
+    R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
+    R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
+    R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
+    R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
+    R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
+    R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
+    /* Add the working vars back into context.state[] */
+    state[0] += a;
+    state[1] += b;
+    state[2] += c;
+    state[3] += d;
+    state[4] += e;
+    /* Wipe variables */
+    a = b = c = d = e = 0;
+#ifdef SHA1HANDSOFF
+    memset(block, '\0', sizeof(block));
+#endif
+}
+
+
+/* SHA1Init - Initialize new context */
+
+void SHA1Init(SHA1_CTX* context)
+{
+    /* SHA1 initialization constants */
+    context->state[0] = 0x67452301;
+    context->state[1] = 0xEFCDAB89;
+    context->state[2] = 0x98BADCFE;
+    context->state[3] = 0x10325476;
+    context->state[4] = 0xC3D2E1F0;
+    context->count[0] = context->count[1] = 0;
+}
+
+
+/* Run your data through this. */
+
+void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len)
+{
+    uint32_t i, j;
+
+    j = context->count[0];
+    if ((context->count[0] += len << 3) < j)
+        context->count[1]++;
+    context->count[1] += (len>>29);
+    j = (j >> 3) & 63;
+    if ((j + len) > 63) {
+        memcpy(&context->buffer[j], data, (i = 64-j));
+        SHA1Transform(context->state, context->buffer);
+        for ( ; i + 63 < len; i += 64) {
+            SHA1Transform(context->state, &data[i]);
+        }
+        j = 0;
+    }
+    else i = 0;
+    memcpy(&context->buffer[j], &data[i], len - i);
+}
+
+
+/* Add padding and return the message digest. */
+
+void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
+{
+    unsigned i;
+    unsigned char finalcount[8];
+    unsigned char c;
+
+#if 0	/* untested "improvement" by DHR */
+    /* Convert context->count to a sequence of bytes
+     * in finalcount.  Second element first, but
+     * big-endian order within element.
+     * But we do it all backwards.
+     */
+    unsigned char *fcp = &finalcount[8];
+
+    for (i = 0; i < 2; i++)
+       {
+        uint32_t t = context->count[i];
+        int j;
+
+        for (j = 0; j < 4; t >>= 8, j++)
+	          *--fcp = (unsigned char) t;
+    }
+#else
+    for (i = 0; i < 8; i++) {
+        finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
+         >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
+    }
+#endif
+    c = 0200;
+    SHA1Update(context, &c, 1);
+    while ((context->count[0] & 504) != 448) {
+	c = 0000;
+        SHA1Update(context, &c, 1);
+    }
+    SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
+    for (i = 0; i < 20; i++) {
+        digest[i] = (unsigned char)
+         ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
+    }
+    /* Wipe variables */
+    memset(context, '\0', sizeof(*context));
+    memset(&finalcount, '\0', sizeof(finalcount));
+}
+/* ================ end of sha1.c ================ */
+
+#ifdef REDIS_TEST
+#define BUFSIZE 4096
+
+#define UNUSED(x) (void)(x)
+int sha1Test(int argc, char **argv, int accurate)
+{
+    SHA1_CTX ctx;
+    unsigned char hash[20], buf[BUFSIZE];
+    int i;
+
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    for(i=0;i<BUFSIZE;i++)
+        buf[i] = i;
+
+    SHA1Init(&ctx);
+    for(i=0;i<1000;i++)
+        SHA1Update(&ctx, buf, BUFSIZE);
+    SHA1Final(hash, &ctx);
+
+    printf("SHA1=");
+    for(i=0;i<20;i++)
+        printf("%02x", hash[i]);
+    printf("\n");
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/sha1.h b/redis-stable/src/sha1.h
new file mode 100644
index 00000000..9056f864
--- /dev/null
+++ b/redis-stable/src/sha1.h
@@ -0,0 +1,24 @@
+#ifndef SHA1_H
+#define SHA1_H
+/* ================ sha1.h ================ */
+/*
+SHA-1 in C
+By Steve Reid <steve@edmweb.com>
+100% Public Domain
+*/
+
+typedef struct {
+    uint32_t state[5];
+    uint32_t count[2];
+    unsigned char buffer[64];
+} SHA1_CTX;
+
+void SHA1Transform(uint32_t state[5], const unsigned char buffer[64]);
+void SHA1Init(SHA1_CTX* context);
+void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len);
+void SHA1Final(unsigned char digest[20], SHA1_CTX* context);
+
+#ifdef REDIS_TEST
+int sha1Test(int argc, char **argv, int accurate);
+#endif
+#endif
diff --git a/redis-stable/src/sha256.c b/redis-stable/src/sha256.c
new file mode 100644
index 00000000..d644d2d4
--- /dev/null
+++ b/redis-stable/src/sha256.c
@@ -0,0 +1,158 @@
+/*********************************************************************
+* Filename:   sha256.c
+* Author:     Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details:    Implementation of the SHA-256 hashing algorithm.
+              SHA-256 is one of the three algorithms in the SHA2
+              specification. The others, SHA-384 and SHA-512, are not
+              offered in this implementation.
+              Algorithm specification can be found here:
+               * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
+              This implementation uses little endian byte order.
+*********************************************************************/
+
+/*************************** HEADER FILES ***************************/
+#include <stdlib.h>
+#include <string.h>
+#include "sha256.h"
+
+/****************************** MACROS ******************************/
+#define ROTLEFT(a,b) (((a) << (b)) | ((a) >> (32-(b))))
+#define ROTRIGHT(a,b) (((a) >> (b)) | ((a) << (32-(b))))
+
+#define CH(x,y,z) (((x) & (y)) ^ (~(x) & (z)))
+#define MAJ(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
+#define EP0(x) (ROTRIGHT(x,2) ^ ROTRIGHT(x,13) ^ ROTRIGHT(x,22))
+#define EP1(x) (ROTRIGHT(x,6) ^ ROTRIGHT(x,11) ^ ROTRIGHT(x,25))
+#define SIG0(x) (ROTRIGHT(x,7) ^ ROTRIGHT(x,18) ^ ((x) >> 3))
+#define SIG1(x) (ROTRIGHT(x,17) ^ ROTRIGHT(x,19) ^ ((x) >> 10))
+
+/**************************** VARIABLES *****************************/
+static const WORD k[64] = {
+	0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5,0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5,
+	0xd807aa98,0x12835b01,0x243185be,0x550c7dc3,0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174,
+	0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc,0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da,
+	0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7,0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967,
+	0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13,0x650a7354,0x766a0abb,0x81c2c92e,0x92722c85,
+	0xa2bfe8a1,0xa81a664b,0xc24b8b70,0xc76c51a3,0xd192e819,0xd6990624,0xf40e3585,0x106aa070,
+	0x19a4c116,0x1e376c08,0x2748774c,0x34b0bcb5,0x391c0cb3,0x4ed8aa4a,0x5b9cca4f,0x682e6ff3,
+	0x748f82ee,0x78a5636f,0x84c87814,0x8cc70208,0x90befffa,0xa4506ceb,0xbef9a3f7,0xc67178f2
+};
+
+/*********************** FUNCTION DEFINITIONS ***********************/
+void sha256_transform(SHA256_CTX *ctx, const BYTE data[])
+{
+	WORD a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
+
+	for (i = 0, j = 0; i < 16; ++i, j += 4)
+		m[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | (data[j + 3]);
+	for ( ; i < 64; ++i)
+		m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(m[i - 15]) + m[i - 16];
+
+	a = ctx->state[0];
+	b = ctx->state[1];
+	c = ctx->state[2];
+	d = ctx->state[3];
+	e = ctx->state[4];
+	f = ctx->state[5];
+	g = ctx->state[6];
+	h = ctx->state[7];
+
+	for (i = 0; i < 64; ++i) {
+		t1 = h + EP1(e) + CH(e,f,g) + k[i] + m[i];
+		t2 = EP0(a) + MAJ(a,b,c);
+		h = g;
+		g = f;
+		f = e;
+		e = d + t1;
+		d = c;
+		c = b;
+		b = a;
+		a = t1 + t2;
+	}
+
+	ctx->state[0] += a;
+	ctx->state[1] += b;
+	ctx->state[2] += c;
+	ctx->state[3] += d;
+	ctx->state[4] += e;
+	ctx->state[5] += f;
+	ctx->state[6] += g;
+	ctx->state[7] += h;
+}
+
+void sha256_init(SHA256_CTX *ctx)
+{
+	ctx->datalen = 0;
+	ctx->bitlen = 0;
+	ctx->state[0] = 0x6a09e667;
+	ctx->state[1] = 0xbb67ae85;
+	ctx->state[2] = 0x3c6ef372;
+	ctx->state[3] = 0xa54ff53a;
+	ctx->state[4] = 0x510e527f;
+	ctx->state[5] = 0x9b05688c;
+	ctx->state[6] = 0x1f83d9ab;
+	ctx->state[7] = 0x5be0cd19;
+}
+
+void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len)
+{
+	WORD i;
+
+	for (i = 0; i < len; ++i) {
+		ctx->data[ctx->datalen] = data[i];
+		ctx->datalen++;
+		if (ctx->datalen == 64) {
+			sha256_transform(ctx, ctx->data);
+			ctx->bitlen += 512;
+			ctx->datalen = 0;
+		}
+	}
+}
+
+void sha256_final(SHA256_CTX *ctx, BYTE hash[])
+{
+	WORD i;
+
+	i = ctx->datalen;
+
+	// Pad whatever data is left in the buffer.
+	if (ctx->datalen < 56) {
+		ctx->data[i++] = 0x80;
+		while (i < 56)
+			ctx->data[i++] = 0x00;
+	}
+	else {
+		ctx->data[i++] = 0x80;
+		while (i < 64)
+			ctx->data[i++] = 0x00;
+		sha256_transform(ctx, ctx->data);
+		memset(ctx->data, 0, 56);
+	}
+
+	// Append to the padding the total message's length in bits and transform.
+	ctx->bitlen += ctx->datalen * 8;
+	ctx->data[63] = ctx->bitlen;
+	ctx->data[62] = ctx->bitlen >> 8;
+	ctx->data[61] = ctx->bitlen >> 16;
+	ctx->data[60] = ctx->bitlen >> 24;
+	ctx->data[59] = ctx->bitlen >> 32;
+	ctx->data[58] = ctx->bitlen >> 40;
+	ctx->data[57] = ctx->bitlen >> 48;
+	ctx->data[56] = ctx->bitlen >> 56;
+	sha256_transform(ctx, ctx->data);
+
+	// Since this implementation uses little endian byte ordering and SHA uses big endian,
+	// reverse all the bytes when copying the final state to the output hash.
+	for (i = 0; i < 4; ++i) {
+		hash[i]      = (ctx->state[0] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 4]  = (ctx->state[1] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 8]  = (ctx->state[2] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 20] = (ctx->state[5] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 24] = (ctx->state[6] >> (24 - i * 8)) & 0x000000ff;
+		hash[i + 28] = (ctx->state[7] >> (24 - i * 8)) & 0x000000ff;
+	}
+}
diff --git a/redis-stable/src/sha256.h b/redis-stable/src/sha256.h
new file mode 100644
index 00000000..dc53ead2
--- /dev/null
+++ b/redis-stable/src/sha256.h
@@ -0,0 +1,35 @@
+/*********************************************************************
+* Filename:   sha256.h
+* Author:     Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details:    Defines the API for the corresponding SHA1 implementation.
+*********************************************************************/
+
+#ifndef SHA256_H
+#define SHA256_H
+
+/*************************** HEADER FILES ***************************/
+#include <stddef.h>
+#include <stdint.h>
+
+/****************************** MACROS ******************************/
+#define SHA256_BLOCK_SIZE 32            // SHA256 outputs a 32 byte digest
+
+/**************************** DATA TYPES ****************************/
+typedef uint8_t BYTE;   // 8-bit byte
+typedef uint32_t WORD;  // 32-bit word
+
+typedef struct {
+	BYTE data[64];
+	WORD datalen;
+	unsigned long long bitlen;
+	WORD state[8];
+} SHA256_CTX;
+
+/*********************** FUNCTION DECLARATIONS **********************/
+void sha256_init(SHA256_CTX *ctx);
+void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len);
+void sha256_final(SHA256_CTX *ctx, BYTE hash[]);
+
+#endif   // SHA256_H
diff --git a/redis-stable/src/siphash.c b/redis-stable/src/siphash.c
new file mode 100644
index 00000000..30c15c04
--- /dev/null
+++ b/redis-stable/src/siphash.c
@@ -0,0 +1,361 @@
+/*
+   SipHash reference C implementation
+
+   Copyright (c) 2012-2016 Jean-Philippe Aumasson
+   <jeanphilippe.aumasson@gmail.com>
+   Copyright (c) 2012-2014 Daniel J. Bernstein <djb@cr.yp.to>
+   Copyright (c) 2017 Salvatore Sanfilippo <antirez@gmail.com>
+
+   To the extent possible under law, the author(s) have dedicated all copyright
+   and related and neighboring rights to this software to the public domain
+   worldwide. This software is distributed without any warranty.
+
+   You should have received a copy of the CC0 Public Domain Dedication along
+   with this software. If not, see
+   <http://creativecommons.org/publicdomain/zero/1.0/>.
+
+   ----------------------------------------------------------------------------
+
+   This version was modified by Salvatore Sanfilippo <antirez@gmail.com>
+   in the following ways:
+
+   1. We use SipHash 1-2. This is not believed to be as strong as the
+      suggested 2-4 variant, but AFAIK there are not trivial attacks
+      against this reduced-rounds version, and it runs at the same speed
+      as Murmurhash2 that we used previously, while the 2-4 variant slowed
+      down Redis by a 4% figure more or less.
+   2. Hard-code rounds in the hope the compiler can optimize it more
+      in this raw from. Anyway we always want the standard 2-4 variant.
+   3. Modify the prototype and implementation so that the function directly
+      returns an uint64_t value, the hash itself, instead of receiving an
+      output buffer. This also means that the output size is set to 8 bytes
+      and the 16 bytes output code handling was removed.
+   4. Provide a case insensitive variant to be used when hashing strings that
+      must be considered identical by the hash table regardless of the case.
+      If we don't have directly a case insensitive hash function, we need to
+      perform a text transformation in some temporary buffer, which is costly.
+   5. Remove debugging code.
+   6. Modified the original test.c file to be a stand-alone function testing
+      the function in the new form (returning an uint64_t) using just the
+      relevant test vector.
+ */
+#include <assert.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <string.h>
+#include <ctype.h>
+
+/* Fast tolower() alike function that does not care about locale
+ * but just returns a-z instead of A-Z. */
+int siptlw(int c) {
+    if (c >= 'A' && c <= 'Z') {
+        return c+('a'-'A');
+    } else {
+        return c;
+    }
+}
+
+/* Test of the CPU is Little Endian and supports not aligned accesses.
+ * Two interesting conditions to speedup the function that happen to be
+ * in most of x86 servers. */
+#if defined(__X86_64__) || defined(__x86_64__) || defined (__i386__) \
+	|| defined (__aarch64__) || defined (__arm64__)
+#define UNALIGNED_LE_CPU
+#endif
+
+#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))
+
+#define U32TO8_LE(p, v)                                                        \
+    (p)[0] = (uint8_t)((v));                                                   \
+    (p)[1] = (uint8_t)((v) >> 8);                                              \
+    (p)[2] = (uint8_t)((v) >> 16);                                             \
+    (p)[3] = (uint8_t)((v) >> 24);
+
+#define U64TO8_LE(p, v)                                                        \
+    U32TO8_LE((p), (uint32_t)((v)));                                           \
+    U32TO8_LE((p) + 4, (uint32_t)((v) >> 32));
+
+#ifdef UNALIGNED_LE_CPU
+#define U8TO64_LE(p) (*((uint64_t*)(p)))
+#else
+#define U8TO64_LE(p)                                                           \
+    (((uint64_t)((p)[0])) | ((uint64_t)((p)[1]) << 8) |                        \
+     ((uint64_t)((p)[2]) << 16) | ((uint64_t)((p)[3]) << 24) |                 \
+     ((uint64_t)((p)[4]) << 32) | ((uint64_t)((p)[5]) << 40) |                 \
+     ((uint64_t)((p)[6]) << 48) | ((uint64_t)((p)[7]) << 56))
+#endif
+
+#define U8TO64_LE_NOCASE(p)                                                    \
+    (((uint64_t)(siptlw((p)[0]))) |                                           \
+     ((uint64_t)(siptlw((p)[1])) << 8) |                                      \
+     ((uint64_t)(siptlw((p)[2])) << 16) |                                     \
+     ((uint64_t)(siptlw((p)[3])) << 24) |                                     \
+     ((uint64_t)(siptlw((p)[4])) << 32) |                                              \
+     ((uint64_t)(siptlw((p)[5])) << 40) |                                              \
+     ((uint64_t)(siptlw((p)[6])) << 48) |                                              \
+     ((uint64_t)(siptlw((p)[7])) << 56))
+
+#define SIPROUND                                                               \
+    do {                                                                       \
+        v0 += v1;                                                              \
+        v1 = ROTL(v1, 13);                                                     \
+        v1 ^= v0;                                                              \
+        v0 = ROTL(v0, 32);                                                     \
+        v2 += v3;                                                              \
+        v3 = ROTL(v3, 16);                                                     \
+        v3 ^= v2;                                                              \
+        v0 += v3;                                                              \
+        v3 = ROTL(v3, 21);                                                     \
+        v3 ^= v0;                                                              \
+        v2 += v1;                                                              \
+        v1 = ROTL(v1, 17);                                                     \
+        v1 ^= v2;                                                              \
+        v2 = ROTL(v2, 32);                                                     \
+    } while (0)
+
+uint64_t siphash(const uint8_t *in, const size_t inlen, const uint8_t *k) {
+#ifndef UNALIGNED_LE_CPU
+    uint64_t hash;
+    uint8_t *out = (uint8_t*) &hash;
+#endif
+    uint64_t v0 = 0x736f6d6570736575ULL;
+    uint64_t v1 = 0x646f72616e646f6dULL;
+    uint64_t v2 = 0x6c7967656e657261ULL;
+    uint64_t v3 = 0x7465646279746573ULL;
+    uint64_t k0 = U8TO64_LE(k);
+    uint64_t k1 = U8TO64_LE(k + 8);
+    uint64_t m;
+    const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t));
+    const int left = inlen & 7;
+    uint64_t b = ((uint64_t)inlen) << 56;
+    v3 ^= k1;
+    v2 ^= k0;
+    v1 ^= k1;
+    v0 ^= k0;
+
+    for (; in != end; in += 8) {
+        m = U8TO64_LE(in);
+        v3 ^= m;
+
+        SIPROUND;
+
+        v0 ^= m;
+    }
+
+    switch (left) {
+    case 7: b |= ((uint64_t)in[6]) << 48; /* fall-thru */
+    case 6: b |= ((uint64_t)in[5]) << 40; /* fall-thru */
+    case 5: b |= ((uint64_t)in[4]) << 32; /* fall-thru */
+    case 4: b |= ((uint64_t)in[3]) << 24; /* fall-thru */
+    case 3: b |= ((uint64_t)in[2]) << 16; /* fall-thru */
+    case 2: b |= ((uint64_t)in[1]) << 8; /* fall-thru */
+    case 1: b |= ((uint64_t)in[0]); break;
+    case 0: break;
+    }
+
+    v3 ^= b;
+
+    SIPROUND;
+
+    v0 ^= b;
+    v2 ^= 0xff;
+
+    SIPROUND;
+    SIPROUND;
+
+    b = v0 ^ v1 ^ v2 ^ v3;
+#ifndef UNALIGNED_LE_CPU
+    U64TO8_LE(out, b);
+    return hash;
+#else
+    return b;
+#endif
+}
+
+uint64_t siphash_nocase(const uint8_t *in, const size_t inlen, const uint8_t *k)
+{
+#ifndef UNALIGNED_LE_CPU
+    uint64_t hash;
+    uint8_t *out = (uint8_t*) &hash;
+#endif
+    uint64_t v0 = 0x736f6d6570736575ULL;
+    uint64_t v1 = 0x646f72616e646f6dULL;
+    uint64_t v2 = 0x6c7967656e657261ULL;
+    uint64_t v3 = 0x7465646279746573ULL;
+    uint64_t k0 = U8TO64_LE(k);
+    uint64_t k1 = U8TO64_LE(k + 8);
+    uint64_t m;
+    const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t));
+    const int left = inlen & 7;
+    uint64_t b = ((uint64_t)inlen) << 56;
+    v3 ^= k1;
+    v2 ^= k0;
+    v1 ^= k1;
+    v0 ^= k0;
+
+    for (; in != end; in += 8) {
+        m = U8TO64_LE_NOCASE(in);
+        v3 ^= m;
+
+        SIPROUND;
+
+        v0 ^= m;
+    }
+
+    switch (left) {
+    case 7: b |= ((uint64_t)siptlw(in[6])) << 48; /* fall-thru */
+    case 6: b |= ((uint64_t)siptlw(in[5])) << 40; /* fall-thru */
+    case 5: b |= ((uint64_t)siptlw(in[4])) << 32; /* fall-thru */
+    case 4: b |= ((uint64_t)siptlw(in[3])) << 24; /* fall-thru */
+    case 3: b |= ((uint64_t)siptlw(in[2])) << 16; /* fall-thru */
+    case 2: b |= ((uint64_t)siptlw(in[1])) << 8; /* fall-thru */
+    case 1: b |= ((uint64_t)siptlw(in[0])); break;
+    case 0: break;
+    }
+
+    v3 ^= b;
+
+    SIPROUND;
+
+    v0 ^= b;
+    v2 ^= 0xff;
+
+    SIPROUND;
+    SIPROUND;
+
+    b = v0 ^ v1 ^ v2 ^ v3;
+#ifndef UNALIGNED_LE_CPU
+    U64TO8_LE(out, b);
+    return hash;
+#else
+    return b;
+#endif
+}
+
+
+/* --------------------------------- TEST ------------------------------------ */
+
+#ifdef SIPHASH_TEST
+
+const uint8_t vectors_sip64[64][8] = {
+    { 0x31, 0x0e, 0x0e, 0xdd, 0x47, 0xdb, 0x6f, 0x72, },
+    { 0xfd, 0x67, 0xdc, 0x93, 0xc5, 0x39, 0xf8, 0x74, },
+    { 0x5a, 0x4f, 0xa9, 0xd9, 0x09, 0x80, 0x6c, 0x0d, },
+    { 0x2d, 0x7e, 0xfb, 0xd7, 0x96, 0x66, 0x67, 0x85, },
+    { 0xb7, 0x87, 0x71, 0x27, 0xe0, 0x94, 0x27, 0xcf, },
+    { 0x8d, 0xa6, 0x99, 0xcd, 0x64, 0x55, 0x76, 0x18, },
+    { 0xce, 0xe3, 0xfe, 0x58, 0x6e, 0x46, 0xc9, 0xcb, },
+    { 0x37, 0xd1, 0x01, 0x8b, 0xf5, 0x00, 0x02, 0xab, },
+    { 0x62, 0x24, 0x93, 0x9a, 0x79, 0xf5, 0xf5, 0x93, },
+    { 0xb0, 0xe4, 0xa9, 0x0b, 0xdf, 0x82, 0x00, 0x9e, },
+    { 0xf3, 0xb9, 0xdd, 0x94, 0xc5, 0xbb, 0x5d, 0x7a, },
+    { 0xa7, 0xad, 0x6b, 0x22, 0x46, 0x2f, 0xb3, 0xf4, },
+    { 0xfb, 0xe5, 0x0e, 0x86, 0xbc, 0x8f, 0x1e, 0x75, },
+    { 0x90, 0x3d, 0x84, 0xc0, 0x27, 0x56, 0xea, 0x14, },
+    { 0xee, 0xf2, 0x7a, 0x8e, 0x90, 0xca, 0x23, 0xf7, },
+    { 0xe5, 0x45, 0xbe, 0x49, 0x61, 0xca, 0x29, 0xa1, },
+    { 0xdb, 0x9b, 0xc2, 0x57, 0x7f, 0xcc, 0x2a, 0x3f, },
+    { 0x94, 0x47, 0xbe, 0x2c, 0xf5, 0xe9, 0x9a, 0x69, },
+    { 0x9c, 0xd3, 0x8d, 0x96, 0xf0, 0xb3, 0xc1, 0x4b, },
+    { 0xbd, 0x61, 0x79, 0xa7, 0x1d, 0xc9, 0x6d, 0xbb, },
+    { 0x98, 0xee, 0xa2, 0x1a, 0xf2, 0x5c, 0xd6, 0xbe, },
+    { 0xc7, 0x67, 0x3b, 0x2e, 0xb0, 0xcb, 0xf2, 0xd0, },
+    { 0x88, 0x3e, 0xa3, 0xe3, 0x95, 0x67, 0x53, 0x93, },
+    { 0xc8, 0xce, 0x5c, 0xcd, 0x8c, 0x03, 0x0c, 0xa8, },
+    { 0x94, 0xaf, 0x49, 0xf6, 0xc6, 0x50, 0xad, 0xb8, },
+    { 0xea, 0xb8, 0x85, 0x8a, 0xde, 0x92, 0xe1, 0xbc, },
+    { 0xf3, 0x15, 0xbb, 0x5b, 0xb8, 0x35, 0xd8, 0x17, },
+    { 0xad, 0xcf, 0x6b, 0x07, 0x63, 0x61, 0x2e, 0x2f, },
+    { 0xa5, 0xc9, 0x1d, 0xa7, 0xac, 0xaa, 0x4d, 0xde, },
+    { 0x71, 0x65, 0x95, 0x87, 0x66, 0x50, 0xa2, 0xa6, },
+    { 0x28, 0xef, 0x49, 0x5c, 0x53, 0xa3, 0x87, 0xad, },
+    { 0x42, 0xc3, 0x41, 0xd8, 0xfa, 0x92, 0xd8, 0x32, },
+    { 0xce, 0x7c, 0xf2, 0x72, 0x2f, 0x51, 0x27, 0x71, },
+    { 0xe3, 0x78, 0x59, 0xf9, 0x46, 0x23, 0xf3, 0xa7, },
+    { 0x38, 0x12, 0x05, 0xbb, 0x1a, 0xb0, 0xe0, 0x12, },
+    { 0xae, 0x97, 0xa1, 0x0f, 0xd4, 0x34, 0xe0, 0x15, },
+    { 0xb4, 0xa3, 0x15, 0x08, 0xbe, 0xff, 0x4d, 0x31, },
+    { 0x81, 0x39, 0x62, 0x29, 0xf0, 0x90, 0x79, 0x02, },
+    { 0x4d, 0x0c, 0xf4, 0x9e, 0xe5, 0xd4, 0xdc, 0xca, },
+    { 0x5c, 0x73, 0x33, 0x6a, 0x76, 0xd8, 0xbf, 0x9a, },
+    { 0xd0, 0xa7, 0x04, 0x53, 0x6b, 0xa9, 0x3e, 0x0e, },
+    { 0x92, 0x59, 0x58, 0xfc, 0xd6, 0x42, 0x0c, 0xad, },
+    { 0xa9, 0x15, 0xc2, 0x9b, 0xc8, 0x06, 0x73, 0x18, },
+    { 0x95, 0x2b, 0x79, 0xf3, 0xbc, 0x0a, 0xa6, 0xd4, },
+    { 0xf2, 0x1d, 0xf2, 0xe4, 0x1d, 0x45, 0x35, 0xf9, },
+    { 0x87, 0x57, 0x75, 0x19, 0x04, 0x8f, 0x53, 0xa9, },
+    { 0x10, 0xa5, 0x6c, 0xf5, 0xdf, 0xcd, 0x9a, 0xdb, },
+    { 0xeb, 0x75, 0x09, 0x5c, 0xcd, 0x98, 0x6c, 0xd0, },
+    { 0x51, 0xa9, 0xcb, 0x9e, 0xcb, 0xa3, 0x12, 0xe6, },
+    { 0x96, 0xaf, 0xad, 0xfc, 0x2c, 0xe6, 0x66, 0xc7, },
+    { 0x72, 0xfe, 0x52, 0x97, 0x5a, 0x43, 0x64, 0xee, },
+    { 0x5a, 0x16, 0x45, 0xb2, 0x76, 0xd5, 0x92, 0xa1, },
+    { 0xb2, 0x74, 0xcb, 0x8e, 0xbf, 0x87, 0x87, 0x0a, },
+    { 0x6f, 0x9b, 0xb4, 0x20, 0x3d, 0xe7, 0xb3, 0x81, },
+    { 0xea, 0xec, 0xb2, 0xa3, 0x0b, 0x22, 0xa8, 0x7f, },
+    { 0x99, 0x24, 0xa4, 0x3c, 0xc1, 0x31, 0x57, 0x24, },
+    { 0xbd, 0x83, 0x8d, 0x3a, 0xaf, 0xbf, 0x8d, 0xb7, },
+    { 0x0b, 0x1a, 0x2a, 0x32, 0x65, 0xd5, 0x1a, 0xea, },
+    { 0x13, 0x50, 0x79, 0xa3, 0x23, 0x1c, 0xe6, 0x60, },
+    { 0x93, 0x2b, 0x28, 0x46, 0xe4, 0xd7, 0x06, 0x66, },
+    { 0xe1, 0x91, 0x5f, 0x5c, 0xb1, 0xec, 0xa4, 0x6c, },
+    { 0xf3, 0x25, 0x96, 0x5c, 0xa1, 0x6d, 0x62, 0x9f, },
+    { 0x57, 0x5f, 0xf2, 0x8e, 0x60, 0x38, 0x1b, 0xe5, },
+    { 0x72, 0x45, 0x06, 0xeb, 0x4c, 0x32, 0x8a, 0x95, },
+};
+
+
+/* Test siphash using a test vector. Returns 0 if the function passed
+ * all the tests, otherwise 1 is returned.
+ *
+ * IMPORTANT: The test vector is for SipHash 2-4. Before running
+ * the test revert back the siphash() function to 2-4 rounds since
+ * now it uses 1-2 rounds. */
+int siphash_test(void) {
+    uint8_t in[64], k[16];
+    int i;
+    int fails = 0;
+
+    for (i = 0; i < 16; ++i)
+        k[i] = i;
+
+    for (i = 0; i < 64; ++i) {
+        in[i] = i;
+        uint64_t hash = siphash(in, i, k);
+        const uint8_t *v = NULL;
+        v = (uint8_t *)vectors_sip64;
+        if (memcmp(&hash, v + (i * 8), 8)) {
+            /* printf("fail for %d bytes\n", i); */
+            fails++;
+        }
+    }
+
+    /* Run a few basic tests with the case insensitive version. */
+    uint64_t h1, h2;
+    h1 = siphash((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
+    h2 = siphash_nocase((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
+    if (h1 != h2) fails++;
+
+    h1 = siphash((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
+    h2 = siphash_nocase((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
+    if (h1 != h2) fails++;
+
+    h1 = siphash((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
+    h2 = siphash_nocase((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
+    if (h1 == h2) fails++;
+
+    if (!fails) return 0;
+    return 1;
+}
+
+int main(void) {
+    if (siphash_test() == 0) {
+        printf("SipHash test: OK\n");
+        return 0;
+    } else {
+        printf("SipHash test: FAILED\n");
+        return 1;
+    }
+}
+
+#endif
diff --git a/redis-stable/src/slowlog.c b/redis-stable/src/slowlog.c
new file mode 100644
index 00000000..b8c13f1c
--- /dev/null
+++ b/redis-stable/src/slowlog.c
@@ -0,0 +1,196 @@
+/* Slowlog implements a system that is able to remember the latest N
+ * queries that took more than M microseconds to execute.
+ *
+ * The execution time to reach to be logged in the slow log is set
+ * using the 'slowlog-log-slower-than' config directive, that is also
+ * readable and writable using the CONFIG SET/GET command.
+ *
+ * The slow queries log is actually not "logged" in the Redis log file
+ * but is accessible thanks to the SLOWLOG command.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "server.h"
+#include "slowlog.h"
+
+/* Create a new slowlog entry.
+ * Incrementing the ref count of all the objects retained is up to
+ * this function. */
+slowlogEntry *slowlogCreateEntry(client *c, robj **argv, int argc, long long duration) {
+    slowlogEntry *se = zmalloc(sizeof(*se));
+    int j, slargc = argc;
+
+    if (slargc > SLOWLOG_ENTRY_MAX_ARGC) slargc = SLOWLOG_ENTRY_MAX_ARGC;
+    se->argc = slargc;
+    se->argv = zmalloc(sizeof(robj*)*slargc);
+    for (j = 0; j < slargc; j++) {
+        /* Logging too many arguments is a useless memory waste, so we stop
+         * at SLOWLOG_ENTRY_MAX_ARGC, but use the last argument to specify
+         * how many remaining arguments there were in the original command. */
+        if (slargc != argc && j == slargc-1) {
+            se->argv[j] = createObject(OBJ_STRING,
+                sdscatprintf(sdsempty(),"... (%d more arguments)",
+                argc-slargc+1));
+        } else {
+            /* Trim too long strings as well... */
+            if (argv[j]->type == OBJ_STRING &&
+                sdsEncodedObject(argv[j]) &&
+                sdslen(argv[j]->ptr) > SLOWLOG_ENTRY_MAX_STRING)
+            {
+                sds s = sdsnewlen(argv[j]->ptr, SLOWLOG_ENTRY_MAX_STRING);
+
+                s = sdscatprintf(s,"... (%lu more bytes)",
+                    (unsigned long)
+                    sdslen(argv[j]->ptr) - SLOWLOG_ENTRY_MAX_STRING);
+                se->argv[j] = createObject(OBJ_STRING,s);
+            } else if (argv[j]->refcount == OBJ_SHARED_REFCOUNT) {
+                se->argv[j] = argv[j];
+            } else {
+                /* Here we need to duplicate the string objects composing the
+                 * argument vector of the command, because those may otherwise
+                 * end shared with string objects stored into keys. Having
+                 * shared objects between any part of Redis, and the data
+                 * structure holding the data, is a problem: FLUSHALL ASYNC
+                 * may release the shared string object and create a race. */
+                se->argv[j] = dupStringObject(argv[j]);
+            }
+        }
+    }
+    se->time = time(NULL);
+    se->duration = duration;
+    se->id = server.slowlog_entry_id++;
+    se->peerid = sdsnew(getClientPeerId(c));
+    se->cname = c->name ? sdsnew(c->name->ptr) : sdsempty();
+    return se;
+}
+
+/* Free a slow log entry. The argument is void so that the prototype of this
+ * function matches the one of the 'free' method of adlist.c.
+ *
+ * This function will take care to release all the retained object. */
+void slowlogFreeEntry(void *septr) {
+    slowlogEntry *se = septr;
+    int j;
+
+    for (j = 0; j < se->argc; j++)
+        decrRefCount(se->argv[j]);
+    zfree(se->argv);
+    sdsfree(se->peerid);
+    sdsfree(se->cname);
+    zfree(se);
+}
+
+/* Initialize the slow log. This function should be called a single time
+ * at server startup. */
+void slowlogInit(void) {
+    server.slowlog = listCreate();
+    server.slowlog_entry_id = 0;
+    listSetFreeMethod(server.slowlog,slowlogFreeEntry);
+}
+
+/* Push a new entry into the slow log.
+ * This function will make sure to trim the slow log accordingly to the
+ * configured max length. */
+void slowlogPushEntryIfNeeded(client *c, robj **argv, int argc, long long duration) {
+    if (server.slowlog_log_slower_than < 0) return; /* Slowlog disabled */
+    if (duration >= server.slowlog_log_slower_than)
+        listAddNodeHead(server.slowlog,
+                        slowlogCreateEntry(c,argv,argc,duration));
+
+    /* Remove old entries if needed. */
+    while (listLength(server.slowlog) > server.slowlog_max_len)
+        listDelNode(server.slowlog,listLast(server.slowlog));
+}
+
+/* Remove all the entries from the current slow log. */
+void slowlogReset(void) {
+    while (listLength(server.slowlog) > 0)
+        listDelNode(server.slowlog,listLast(server.slowlog));
+}
+
+/* The SLOWLOG command. Implements all the subcommands needed to handle the
+ * Redis slow log. */
+void slowlogCommand(client *c) {
+    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
+        const char *help[] = {
+"GET [<count>]",
+"    Return top <count> entries from the slowlog (default: 10). Entries are",
+"    made of:",
+"    id, timestamp, time in microseconds, arguments array, client IP and port,",
+"    client name",
+"LEN",
+"    Return the length of the slowlog.",
+"RESET",
+"    Reset the slowlog.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"reset")) {
+        slowlogReset();
+        addReply(c,shared.ok);
+    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"len")) {
+        addReplyLongLong(c,listLength(server.slowlog));
+    } else if ((c->argc == 2 || c->argc == 3) &&
+               !strcasecmp(c->argv[1]->ptr,"get"))
+    {
+        long count = 10, sent = 0;
+        listIter li;
+        void *totentries;
+        listNode *ln;
+        slowlogEntry *se;
+
+        if (c->argc == 3 &&
+            getLongFromObjectOrReply(c,c->argv[2],&count,NULL) != C_OK)
+            return;
+
+        listRewind(server.slowlog,&li);
+        totentries = addReplyDeferredLen(c);
+        while(count-- && (ln = listNext(&li))) {
+            int j;
+
+            se = ln->value;
+            addReplyArrayLen(c,6);
+            addReplyLongLong(c,se->id);
+            addReplyLongLong(c,se->time);
+            addReplyLongLong(c,se->duration);
+            addReplyArrayLen(c,se->argc);
+            for (j = 0; j < se->argc; j++)
+                addReplyBulk(c,se->argv[j]);
+            addReplyBulkCBuffer(c,se->peerid,sdslen(se->peerid));
+            addReplyBulkCBuffer(c,se->cname,sdslen(se->cname));
+            sent++;
+        }
+        setDeferredArrayLen(c,totentries,sent);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
diff --git a/redis-stable/src/slowlog.h b/redis-stable/src/slowlog.h
new file mode 100644
index 00000000..50e54389
--- /dev/null
+++ b/redis-stable/src/slowlog.h
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __SLOWLOG_H__
+#define __SLOWLOG_H__
+
+#define SLOWLOG_ENTRY_MAX_ARGC 32
+#define SLOWLOG_ENTRY_MAX_STRING 128
+
+/* This structure defines an entry inside the slow log list */
+typedef struct slowlogEntry {
+    robj **argv;
+    int argc;
+    long long id;       /* Unique entry identifier. */
+    long long duration; /* Time spent by the query, in microseconds. */
+    time_t time;        /* Unix time at which the query was executed. */
+    sds cname;          /* Client name. */
+    sds peerid;         /* Client network address. */
+} slowlogEntry;
+
+/* Exported API */
+void slowlogInit(void);
+void slowlogPushEntryIfNeeded(client *c, robj **argv, int argc, long long duration);
+
+/* Exported commands */
+void slowlogCommand(client *c);
+
+#endif /* __SLOWLOG_H__ */
diff --git a/redis-stable/src/solarisfixes.h b/redis-stable/src/solarisfixes.h
new file mode 100644
index 00000000..3e53ba67
--- /dev/null
+++ b/redis-stable/src/solarisfixes.h
@@ -0,0 +1,54 @@
+/* Solaris specific fixes.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#if defined(__sun)
+
+#if defined(__GNUC__)
+#include <math.h>
+#undef isnan
+#define isnan(x) \
+     __extension__({ __typeof (x) __x_a = (x); \
+     __builtin_expect(__x_a != __x_a, 0); })
+
+#undef isfinite
+#define isfinite(x) \
+     __extension__ ({ __typeof (x) __x_f = (x); \
+     __builtin_expect(!isnan(__x_f - __x_f), 1); })
+
+#undef isinf
+#define isinf(x) \
+     __extension__ ({ __typeof (x) __x_i = (x); \
+     __builtin_expect(!isnan(__x_i) && !isfinite(__x_i), 0); })
+
+#define u_int uint
+#define u_int32_t uint32_t
+#endif /* __GNUC__ */
+
+#endif /* __sun */
diff --git a/redis-stable/src/sort.c b/redis-stable/src/sort.c
new file mode 100644
index 00000000..3b67cc63
--- /dev/null
+++ b/redis-stable/src/sort.c
@@ -0,0 +1,597 @@
+/* SORT command and helper functions.
+ *
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "server.h"
+#include "pqsort.h" /* Partial qsort for SORT+LIMIT */
+#include <math.h> /* isnan() */
+
+zskiplistNode* zslGetElementByRank(zskiplist *zsl, unsigned long rank);
+
+redisSortOperation *createSortOperation(int type, robj *pattern) {
+    redisSortOperation *so = zmalloc(sizeof(*so));
+    so->type = type;
+    so->pattern = pattern;
+    return so;
+}
+
+/* Return the value associated to the key with a name obtained using
+ * the following rules:
+ *
+ * 1) The first occurrence of '*' in 'pattern' is substituted with 'subst'.
+ *
+ * 2) If 'pattern' matches the "->" string, everything on the left of
+ *    the arrow is treated as the name of a hash field, and the part on the
+ *    left as the key name containing a hash. The value of the specified
+ *    field is returned.
+ *
+ * 3) If 'pattern' equals "#", the function simply returns 'subst' itself so
+ *    that the SORT command can be used like: SORT key GET # to retrieve
+ *    the Set/List elements directly.
+ *
+ * The returned object will always have its refcount increased by 1
+ * when it is non-NULL. */
+robj *lookupKeyByPattern(redisDb *db, robj *pattern, robj *subst, int writeflag) {
+    char *p, *f, *k;
+    sds spat, ssub;
+    robj *keyobj, *fieldobj = NULL, *o;
+    int prefixlen, sublen, postfixlen, fieldlen;
+
+    /* If the pattern is "#" return the substitution object itself in order
+     * to implement the "SORT ... GET #" feature. */
+    spat = pattern->ptr;
+    if (spat[0] == '#' && spat[1] == '\0') {
+        incrRefCount(subst);
+        return subst;
+    }
+
+    /* The substitution object may be specially encoded. If so we create
+     * a decoded object on the fly. Otherwise getDecodedObject will just
+     * increment the ref count, that we'll decrement later. */
+    subst = getDecodedObject(subst);
+    ssub = subst->ptr;
+
+    /* If we can't find '*' in the pattern we return NULL as to GET a
+     * fixed key does not make sense. */
+    p = strchr(spat,'*');
+    if (!p) {
+        decrRefCount(subst);
+        return NULL;
+    }
+
+    /* Find out if we're dealing with a hash dereference. */
+    if ((f = strstr(p+1, "->")) != NULL && *(f+2) != '\0') {
+        fieldlen = sdslen(spat)-(f-spat)-2;
+        fieldobj = createStringObject(f+2,fieldlen);
+    } else {
+        fieldlen = 0;
+    }
+
+    /* Perform the '*' substitution. */
+    prefixlen = p-spat;
+    sublen = sdslen(ssub);
+    postfixlen = sdslen(spat)-(prefixlen+1)-(fieldlen ? fieldlen+2 : 0);
+    keyobj = createStringObject(NULL,prefixlen+sublen+postfixlen);
+    k = keyobj->ptr;
+    memcpy(k,spat,prefixlen);
+    memcpy(k+prefixlen,ssub,sublen);
+    memcpy(k+prefixlen+sublen,p+1,postfixlen);
+    decrRefCount(subst); /* Incremented by decodeObject() */
+
+    /* Lookup substituted key */
+    if (!writeflag)
+        o = lookupKeyRead(db,keyobj);
+    else
+        o = lookupKeyWrite(db,keyobj);
+    if (o == NULL) goto noobj;
+
+    if (fieldobj) {
+        if (o->type != OBJ_HASH) goto noobj;
+
+        /* Retrieve value from hash by the field name. The returned object
+         * is a new object with refcount already incremented. */
+        o = hashTypeGetValueObject(o, fieldobj->ptr);
+    } else {
+        if (o->type != OBJ_STRING) goto noobj;
+
+        /* Every object that this function returns needs to have its refcount
+         * increased. sortCommand decreases it again. */
+        incrRefCount(o);
+    }
+    decrRefCount(keyobj);
+    if (fieldobj) decrRefCount(fieldobj);
+    return o;
+
+noobj:
+    decrRefCount(keyobj);
+    if (fieldlen) decrRefCount(fieldobj);
+    return NULL;
+}
+
+/* sortCompare() is used by qsort in sortCommand(). Given that qsort_r with
+ * the additional parameter is not standard but a BSD-specific we have to
+ * pass sorting parameters via the global 'server' structure */
+int sortCompare(const void *s1, const void *s2) {
+    const redisSortObject *so1 = s1, *so2 = s2;
+    int cmp;
+
+    if (!server.sort_alpha) {
+        /* Numeric sorting. Here it's trivial as we precomputed scores */
+        if (so1->u.score > so2->u.score) {
+            cmp = 1;
+        } else if (so1->u.score < so2->u.score) {
+            cmp = -1;
+        } else {
+            /* Objects have the same score, but we don't want the comparison
+             * to be undefined, so we compare objects lexicographically.
+             * This way the result of SORT is deterministic. */
+            cmp = compareStringObjects(so1->obj,so2->obj);
+        }
+    } else {
+        /* Alphanumeric sorting */
+        if (server.sort_bypattern) {
+            if (!so1->u.cmpobj || !so2->u.cmpobj) {
+                /* At least one compare object is NULL */
+                if (so1->u.cmpobj == so2->u.cmpobj)
+                    cmp = 0;
+                else if (so1->u.cmpobj == NULL)
+                    cmp = -1;
+                else
+                    cmp = 1;
+            } else {
+                /* We have both the objects, compare them. */
+                if (server.sort_store) {
+                    cmp = compareStringObjects(so1->u.cmpobj,so2->u.cmpobj);
+                } else {
+                    /* Here we can use strcoll() directly as we are sure that
+                     * the objects are decoded string objects. */
+                    cmp = strcoll(so1->u.cmpobj->ptr,so2->u.cmpobj->ptr);
+                }
+            }
+        } else {
+            /* Compare elements directly. */
+            if (server.sort_store) {
+                cmp = compareStringObjects(so1->obj,so2->obj);
+            } else {
+                cmp = collateStringObjects(so1->obj,so2->obj);
+            }
+        }
+    }
+    return server.sort_desc ? -cmp : cmp;
+}
+
+/* The SORT command is the most complex command in Redis. Warning: this code
+ * is optimized for speed and a bit less for readability */
+void sortCommand(client *c) {
+    list *operations;
+    unsigned int outputlen = 0;
+    int desc = 0, alpha = 0;
+    long limit_start = 0, limit_count = -1, start, end;
+    int j, dontsort = 0, vectorlen;
+    int getop = 0; /* GET operation counter */
+    int int_conversion_error = 0;
+    int syntax_error = 0;
+    robj *sortval, *sortby = NULL, *storekey = NULL;
+    redisSortObject *vector; /* Resulting vector to sort */
+
+    /* Create a list of operations to perform for every sorted element.
+     * Operations can be GET */
+    operations = listCreate();
+    listSetFreeMethod(operations,zfree);
+    j = 2; /* options start at argv[2] */
+
+    /* The SORT command has an SQL-alike syntax, parse it */
+    while(j < c->argc) {
+        int leftargs = c->argc-j-1;
+        if (!strcasecmp(c->argv[j]->ptr,"asc")) {
+            desc = 0;
+        } else if (!strcasecmp(c->argv[j]->ptr,"desc")) {
+            desc = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"alpha")) {
+            alpha = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"limit") && leftargs >= 2) {
+            if ((getLongFromObjectOrReply(c, c->argv[j+1], &limit_start, NULL)
+                 != C_OK) ||
+                (getLongFromObjectOrReply(c, c->argv[j+2], &limit_count, NULL)
+                 != C_OK))
+            {
+                syntax_error++;
+                break;
+            }
+            j+=2;
+        } else if (!strcasecmp(c->argv[j]->ptr,"store") && leftargs >= 1) {
+            storekey = c->argv[j+1];
+            j++;
+        } else if (!strcasecmp(c->argv[j]->ptr,"by") && leftargs >= 1) {
+            sortby = c->argv[j+1];
+            /* If the BY pattern does not contain '*', i.e. it is constant,
+             * we don't need to sort nor to lookup the weight keys. */
+            if (strchr(c->argv[j+1]->ptr,'*') == NULL) {
+                dontsort = 1;
+            } else {
+                /* If BY is specified with a real patter, we can't accept
+                 * it in cluster mode. */
+                if (server.cluster_enabled) {
+                    addReplyError(c,"BY option of SORT denied in Cluster mode.");
+                    syntax_error++;
+                    break;
+                }
+            }
+            j++;
+        } else if (!strcasecmp(c->argv[j]->ptr,"get") && leftargs >= 1) {
+            if (server.cluster_enabled) {
+                addReplyError(c,"GET option of SORT denied in Cluster mode.");
+                syntax_error++;
+                break;
+            }
+            listAddNodeTail(operations,createSortOperation(
+                SORT_OP_GET,c->argv[j+1]));
+            getop++;
+            j++;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            syntax_error++;
+            break;
+        }
+        j++;
+    }
+
+    /* Handle syntax errors set during options parsing. */
+    if (syntax_error) {
+        listRelease(operations);
+        return;
+    }
+
+    /* Lookup the key to sort. It must be of the right types */
+    if (!storekey)
+        sortval = lookupKeyRead(c->db,c->argv[1]);
+    else
+        sortval = lookupKeyWrite(c->db,c->argv[1]);
+    if (sortval && sortval->type != OBJ_SET &&
+                   sortval->type != OBJ_LIST &&
+                   sortval->type != OBJ_ZSET)
+    {
+        listRelease(operations);
+        addReplyErrorObject(c,shared.wrongtypeerr);
+        return;
+    }
+
+    /* Now we need to protect sortval incrementing its count, in the future
+     * SORT may have options able to overwrite/delete keys during the sorting
+     * and the sorted key itself may get destroyed */
+    if (sortval)
+        incrRefCount(sortval);
+    else
+        sortval = createQuicklistObject();
+
+
+    /* When sorting a set with no sort specified, we must sort the output
+     * so the result is consistent across scripting and replication.
+     *
+     * The other types (list, sorted set) will retain their native order
+     * even if no sort order is requested, so they remain stable across
+     * scripting and replication. */
+    if (dontsort &&
+        sortval->type == OBJ_SET &&
+        (storekey || c->flags & CLIENT_LUA))
+    {
+        /* Force ALPHA sorting */
+        dontsort = 0;
+        alpha = 1;
+        sortby = NULL;
+    }
+
+    /* Destructively convert encoded sorted sets for SORT. */
+    if (sortval->type == OBJ_ZSET)
+        zsetConvert(sortval, OBJ_ENCODING_SKIPLIST);
+
+    /* Objtain the length of the object to sort. */
+    switch(sortval->type) {
+    case OBJ_LIST: vectorlen = listTypeLength(sortval); break;
+    case OBJ_SET: vectorlen =  setTypeSize(sortval); break;
+    case OBJ_ZSET: vectorlen = dictSize(((zset*)sortval->ptr)->dict); break;
+    default: vectorlen = 0; serverPanic("Bad SORT type"); /* Avoid GCC warning */
+    }
+
+    /* Perform LIMIT start,count sanity checking. */
+    start = (limit_start < 0) ? 0 : limit_start;
+    end = (limit_count < 0) ? vectorlen-1 : start+limit_count-1;
+    if (start >= vectorlen) {
+        start = vectorlen-1;
+        end = vectorlen-2;
+    }
+    if (end >= vectorlen) end = vectorlen-1;
+
+    /* Whenever possible, we load elements into the output array in a more
+     * direct way. This is possible if:
+     *
+     * 1) The object to sort is a sorted set or a list (internally sorted).
+     * 2) There is nothing to sort as dontsort is true (BY <constant string>).
+     *
+     * In this special case, if we have a LIMIT option that actually reduces
+     * the number of elements to fetch, we also optimize to just load the
+     * range we are interested in and allocating a vector that is big enough
+     * for the selected range length. */
+    if ((sortval->type == OBJ_ZSET || sortval->type == OBJ_LIST) &&
+        dontsort &&
+        (start != 0 || end != vectorlen-1))
+    {
+        vectorlen = end-start+1;
+    }
+
+    /* Load the sorting vector with all the objects to sort */
+    vector = zmalloc(sizeof(redisSortObject)*vectorlen);
+    j = 0;
+
+    if (sortval->type == OBJ_LIST && dontsort) {
+        /* Special handling for a list, if 'dontsort' is true.
+         * This makes sure we return elements in the list original
+         * ordering, accordingly to DESC / ASC options.
+         *
+         * Note that in this case we also handle LIMIT here in a direct
+         * way, just getting the required range, as an optimization. */
+        if (end >= start) {
+            listTypeIterator *li;
+            listTypeEntry entry;
+            li = listTypeInitIterator(sortval,
+                    desc ? (long)(listTypeLength(sortval) - start - 1) : start,
+                    desc ? LIST_HEAD : LIST_TAIL);
+
+            while(j < vectorlen && listTypeNext(li,&entry)) {
+                vector[j].obj = listTypeGet(&entry);
+                vector[j].u.score = 0;
+                vector[j].u.cmpobj = NULL;
+                j++;
+            }
+            listTypeReleaseIterator(li);
+            /* Fix start/end: output code is not aware of this optimization. */
+            end -= start;
+            start = 0;
+        }
+    } else if (sortval->type == OBJ_LIST) {
+        listTypeIterator *li = listTypeInitIterator(sortval,0,LIST_TAIL);
+        listTypeEntry entry;
+        while(listTypeNext(li,&entry)) {
+            vector[j].obj = listTypeGet(&entry);
+            vector[j].u.score = 0;
+            vector[j].u.cmpobj = NULL;
+            j++;
+        }
+        listTypeReleaseIterator(li);
+    } else if (sortval->type == OBJ_SET) {
+        setTypeIterator *si = setTypeInitIterator(sortval);
+        sds sdsele;
+        while((sdsele = setTypeNextObject(si)) != NULL) {
+            vector[j].obj = createObject(OBJ_STRING,sdsele);
+            vector[j].u.score = 0;
+            vector[j].u.cmpobj = NULL;
+            j++;
+        }
+        setTypeReleaseIterator(si);
+    } else if (sortval->type == OBJ_ZSET && dontsort) {
+        /* Special handling for a sorted set, if 'dontsort' is true.
+         * This makes sure we return elements in the sorted set original
+         * ordering, accordingly to DESC / ASC options.
+         *
+         * Note that in this case we also handle LIMIT here in a direct
+         * way, just getting the required range, as an optimization. */
+
+        zset *zs = sortval->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+        sds sdsele;
+        int rangelen = vectorlen;
+
+        /* Check if starting point is trivial, before doing log(N) lookup. */
+        if (desc) {
+            long zsetlen = dictSize(((zset*)sortval->ptr)->dict);
+
+            ln = zsl->tail;
+            if (start > 0)
+                ln = zslGetElementByRank(zsl,zsetlen-start);
+        } else {
+            ln = zsl->header->level[0].forward;
+            if (start > 0)
+                ln = zslGetElementByRank(zsl,start+1);
+        }
+
+        while(rangelen--) {
+            serverAssertWithInfo(c,sortval,ln != NULL);
+            sdsele = ln->ele;
+            vector[j].obj = createStringObject(sdsele,sdslen(sdsele));
+            vector[j].u.score = 0;
+            vector[j].u.cmpobj = NULL;
+            j++;
+            ln = desc ? ln->backward : ln->level[0].forward;
+        }
+        /* Fix start/end: output code is not aware of this optimization. */
+        end -= start;
+        start = 0;
+    } else if (sortval->type == OBJ_ZSET) {
+        dict *set = ((zset*)sortval->ptr)->dict;
+        dictIterator *di;
+        dictEntry *setele;
+        sds sdsele;
+        di = dictGetIterator(set);
+        while((setele = dictNext(di)) != NULL) {
+            sdsele =  dictGetKey(setele);
+            vector[j].obj = createStringObject(sdsele,sdslen(sdsele));
+            vector[j].u.score = 0;
+            vector[j].u.cmpobj = NULL;
+            j++;
+        }
+        dictReleaseIterator(di);
+    } else {
+        serverPanic("Unknown type");
+    }
+    serverAssertWithInfo(c,sortval,j == vectorlen);
+
+    /* Now it's time to load the right scores in the sorting vector */
+    if (!dontsort) {
+        for (j = 0; j < vectorlen; j++) {
+            robj *byval;
+            if (sortby) {
+                /* lookup value to sort by */
+                byval = lookupKeyByPattern(c->db,sortby,vector[j].obj,storekey!=NULL);
+                if (!byval) continue;
+            } else {
+                /* use object itself to sort by */
+                byval = vector[j].obj;
+            }
+
+            if (alpha) {
+                if (sortby) vector[j].u.cmpobj = getDecodedObject(byval);
+            } else {
+                if (sdsEncodedObject(byval)) {
+                    char *eptr;
+
+                    vector[j].u.score = strtod(byval->ptr,&eptr);
+                    if (eptr[0] != '\0' || errno == ERANGE ||
+                        isnan(vector[j].u.score))
+                    {
+                        int_conversion_error = 1;
+                    }
+                } else if (byval->encoding == OBJ_ENCODING_INT) {
+                    /* Don't need to decode the object if it's
+                     * integer-encoded (the only encoding supported) so
+                     * far. We can just cast it */
+                    vector[j].u.score = (long)byval->ptr;
+                } else {
+                    serverAssertWithInfo(c,sortval,1 != 1);
+                }
+            }
+
+            /* when the object was retrieved using lookupKeyByPattern,
+             * its refcount needs to be decreased. */
+            if (sortby) {
+                decrRefCount(byval);
+            }
+        }
+
+        server.sort_desc = desc;
+        server.sort_alpha = alpha;
+        server.sort_bypattern = sortby ? 1 : 0;
+        server.sort_store = storekey ? 1 : 0;
+        if (sortby && (start != 0 || end != vectorlen-1))
+            pqsort(vector,vectorlen,sizeof(redisSortObject),sortCompare, start,end);
+        else
+            qsort(vector,vectorlen,sizeof(redisSortObject),sortCompare);
+    }
+
+    /* Send command output to the output buffer, performing the specified
+     * GET/DEL/INCR/DECR operations if any. */
+    outputlen = getop ? getop*(end-start+1) : end-start+1;
+    if (int_conversion_error) {
+        addReplyError(c,"One or more scores can't be converted into double");
+    } else if (storekey == NULL) {
+        /* STORE option not specified, sent the sorting result to client */
+        addReplyArrayLen(c,outputlen);
+        for (j = start; j <= end; j++) {
+            listNode *ln;
+            listIter li;
+
+            if (!getop) addReplyBulk(c,vector[j].obj);
+            listRewind(operations,&li);
+            while((ln = listNext(&li))) {
+                redisSortOperation *sop = ln->value;
+                robj *val = lookupKeyByPattern(c->db,sop->pattern,
+                    vector[j].obj,storekey!=NULL);
+
+                if (sop->type == SORT_OP_GET) {
+                    if (!val) {
+                        addReplyNull(c);
+                    } else {
+                        addReplyBulk(c,val);
+                        decrRefCount(val);
+                    }
+                } else {
+                    /* Always fails */
+                    serverAssertWithInfo(c,sortval,sop->type == SORT_OP_GET);
+                }
+            }
+        }
+    } else {
+        robj *sobj = createQuicklistObject();
+
+        /* STORE option specified, set the sorting result as a List object */
+        for (j = start; j <= end; j++) {
+            listNode *ln;
+            listIter li;
+
+            if (!getop) {
+                listTypePush(sobj,vector[j].obj,LIST_TAIL);
+            } else {
+                listRewind(operations,&li);
+                while((ln = listNext(&li))) {
+                    redisSortOperation *sop = ln->value;
+                    robj *val = lookupKeyByPattern(c->db,sop->pattern,
+                        vector[j].obj,storekey!=NULL);
+
+                    if (sop->type == SORT_OP_GET) {
+                        if (!val) val = createStringObject("",0);
+
+                        /* listTypePush does an incrRefCount, so we should take care
+                         * care of the incremented refcount caused by either
+                         * lookupKeyByPattern or createStringObject("",0) */
+                        listTypePush(sobj,val,LIST_TAIL);
+                        decrRefCount(val);
+                    } else {
+                        /* Always fails */
+                        serverAssertWithInfo(c,sortval,sop->type == SORT_OP_GET);
+                    }
+                }
+            }
+        }
+        if (outputlen) {
+            setKey(c,c->db,storekey,sobj);
+            notifyKeyspaceEvent(NOTIFY_LIST,"sortstore",storekey,
+                                c->db->id);
+            server.dirty += outputlen;
+        } else if (dbDelete(c->db,storekey)) {
+            signalModifiedKey(c,c->db,storekey);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",storekey,c->db->id);
+            server.dirty++;
+        }
+        decrRefCount(sobj);
+        addReplyLongLong(c,outputlen);
+    }
+
+    /* Cleanup */
+    for (j = 0; j < vectorlen; j++)
+        decrRefCount(vector[j].obj);
+
+    decrRefCount(sortval);
+    listRelease(operations);
+    for (j = 0; j < vectorlen; j++) {
+        if (alpha && vector[j].u.cmpobj)
+            decrRefCount(vector[j].u.cmpobj);
+    }
+    zfree(vector);
+}
diff --git a/redis-stable/src/sparkline.c b/redis-stable/src/sparkline.c
new file mode 100644
index 00000000..67482c77
--- /dev/null
+++ b/redis-stable/src/sparkline.c
@@ -0,0 +1,176 @@
+/* sparkline.c -- ASCII Sparklines
+ * This code is modified from http://github.com/antirez/aspark and adapted
+ * in order to return SDS strings instead of outputting directly to
+ * the terminal.
+ *
+ * ---------------------------------------------------------------------------
+ *
+ * Copyright(C) 2011-2014 Salvatore Sanfilippo <antirez@gmail.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+#include <math.h>
+
+/* This is the charset used to display the graphs, but multiple rows are used
+ * to increase the resolution. */
+static char charset[] = "_-`";
+static char charset_fill[] = "_o#";
+static int charset_len = sizeof(charset)-1;
+static int label_margin_top = 1;
+
+/* ----------------------------------------------------------------------------
+ * Sequences are arrays of samples we use to represent data to turn
+ * into sparklines. This is the API in order to generate a sparkline:
+ *
+ * struct sequence *seq = createSparklineSequence();
+ * sparklineSequenceAddSample(seq, 10, NULL);
+ * sparklineSequenceAddSample(seq, 20, NULL);
+ * sparklineSequenceAddSample(seq, 30, "last sample label");
+ * sds output = sparklineRender(sdsempty(), seq, 80, 4, SPARKLINE_FILL);
+ * freeSparklineSequence(seq);
+ * ------------------------------------------------------------------------- */
+
+/* Create a new sequence. */
+struct sequence *createSparklineSequence(void) {
+    struct sequence *seq = zmalloc(sizeof(*seq));
+    seq->length = 0;
+    seq->samples = NULL;
+    return seq;
+}
+
+/* Add a new sample into a sequence. */
+void sparklineSequenceAddSample(struct sequence *seq, double value, char *label) {
+    label = (label == NULL || label[0] == '\0') ? NULL : zstrdup(label);
+    if (seq->length == 0) {
+        seq->min = seq->max = value;
+    } else {
+        if (value < seq->min) seq->min = value;
+        else if (value > seq->max) seq->max = value;
+    }
+    seq->samples = zrealloc(seq->samples,sizeof(struct sample)*(seq->length+1));
+    seq->samples[seq->length].value = value;
+    seq->samples[seq->length].label = label;
+    seq->length++;
+    if (label) seq->labels++;
+}
+
+/* Free a sequence. */
+void freeSparklineSequence(struct sequence *seq) {
+    int j;
+
+    for (j = 0; j < seq->length; j++)
+        zfree(seq->samples[j].label);
+    zfree(seq->samples);
+    zfree(seq);
+}
+
+/* ----------------------------------------------------------------------------
+ * ASCII rendering of sequence
+ * ------------------------------------------------------------------------- */
+
+/* Render part of a sequence, so that render_sequence() call call this function
+ * with different parts in order to create the full output without overflowing
+ * the current terminal columns. */
+sds sparklineRenderRange(sds output, struct sequence *seq, int rows, int offset, int len, int flags) {
+    int j;
+    double relmax = seq->max - seq->min;
+    int steps = charset_len*rows;
+    int row = 0;
+    char *chars = zmalloc(len);
+    int loop = 1;
+    int opt_fill = flags & SPARKLINE_FILL;
+    int opt_log = flags & SPARKLINE_LOG_SCALE;
+
+    if (opt_log) {
+        relmax = log(relmax+1);
+    } else if (relmax == 0) {
+        relmax = 1;
+    }
+
+    while(loop) {
+        loop = 0;
+        memset(chars,' ',len);
+        for (j = 0; j < len; j++) {
+            struct sample *s = &seq->samples[j+offset];
+            double relval = s->value - seq->min;
+            int step;
+
+            if (opt_log) relval = log(relval+1);
+            step = (int) (relval*steps)/relmax;
+            if (step < 0) step = 0;
+            if (step >= steps) step = steps-1;
+
+            if (row < rows) {
+                /* Print the character needed to create the sparkline */
+                int charidx = step-((rows-row-1)*charset_len);
+                loop = 1;
+                if (charidx >= 0 && charidx < charset_len) {
+                    chars[j] = opt_fill ? charset_fill[charidx] :
+                                          charset[charidx];
+                } else if(opt_fill && charidx >= charset_len) {
+                    chars[j] = '|';
+                }
+            } else {
+                /* Labels spacing */
+                if (seq->labels && row-rows < label_margin_top) {
+                    loop = 1;
+                    break;
+                }
+                /* Print the label if needed. */
+                if (s->label) {
+                    int label_len = strlen(s->label);
+                    int label_char = row - rows - label_margin_top;
+
+                    if (label_len > label_char) {
+                        loop = 1;
+                        chars[j] = s->label[label_char];
+                    }
+                }
+            }
+        }
+        if (loop) {
+            row++;
+            output = sdscatlen(output,chars,len);
+            output = sdscatlen(output,"\n",1);
+        }
+    }
+    zfree(chars);
+    return output;
+}
+
+/* Turn a sequence into its ASCII representation */
+sds sparklineRender(sds output, struct sequence *seq, int columns, int rows, int flags) {
+    int j;
+
+    for (j = 0; j < seq->length; j += columns) {
+        int sublen = (seq->length-j) < columns ? (seq->length-j) : columns;
+
+        if (j != 0) output = sdscatlen(output,"\n",1);
+        output = sparklineRenderRange(output, seq, rows, j, sublen, flags);
+    }
+    return output;
+}
+
diff --git a/redis-stable/src/sparkline.h b/redis-stable/src/sparkline.h
new file mode 100644
index 00000000..6025d2b9
--- /dev/null
+++ b/redis-stable/src/sparkline.h
@@ -0,0 +1,56 @@
+/* sparkline.h -- ASCII Sparklines header file
+ *
+ * ---------------------------------------------------------------------------
+ *
+ * Copyright(C) 2011-2014 Salvatore Sanfilippo <antirez@gmail.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __SPARKLINE_H
+#define __SPARKLINE_H
+
+/* A sequence is represented of many "samples" */
+struct sample {
+    double value;
+    char *label;
+};
+
+struct sequence {
+    int length;
+    int labels;
+    struct sample *samples;
+    double min, max;
+};
+
+#define SPARKLINE_NO_FLAGS 0
+#define SPARKLINE_FILL 1      /* Fill the area under the curve. */
+#define SPARKLINE_LOG_SCALE 2 /* Use logarithmic scale. */
+
+struct sequence *createSparklineSequence(void);
+void sparklineSequenceAddSample(struct sequence *seq, double value, char *label);
+void freeSparklineSequence(struct sequence *seq);
+sds sparklineRenderRange(sds output, struct sequence *seq, int rows, int offset, int len, int flags);
+sds sparklineRender(sds output, struct sequence *seq, int columns, int rows, int flags);
+
+#endif /* __SPARKLINE_H */
diff --git a/redis-stable/src/stream.h b/redis-stable/src/stream.h
new file mode 100644
index 00000000..1f213236
--- /dev/null
+++ b/redis-stable/src/stream.h
@@ -0,0 +1,132 @@
+#ifndef STREAM_H
+#define STREAM_H
+
+#include "rax.h"
+#include "listpack.h"
+
+/* Stream item ID: a 128 bit number composed of a milliseconds time and
+ * a sequence counter. IDs generated in the same millisecond (or in a past
+ * millisecond if the clock jumped backward) will use the millisecond time
+ * of the latest generated ID and an incremented sequence. */
+typedef struct streamID {
+    uint64_t ms;        /* Unix time in milliseconds. */
+    uint64_t seq;       /* Sequence number. */
+} streamID;
+
+typedef struct stream {
+    rax *rax;               /* The radix tree holding the stream. */
+    uint64_t length;        /* Number of elements inside this stream. */
+    streamID last_id;       /* Zero if there are yet no items. */
+    rax *cgroups;           /* Consumer groups dictionary: name -> streamCG */
+} stream;
+
+/* We define an iterator to iterate stream items in an abstract way, without
+ * caring about the radix tree + listpack representation. Technically speaking
+ * the iterator is only used inside streamReplyWithRange(), so could just
+ * be implemented inside the function, but practically there is the AOF
+ * rewriting code that also needs to iterate the stream to emit the XADD
+ * commands. */
+typedef struct streamIterator {
+    stream *stream;         /* The stream we are iterating. */
+    streamID master_id;     /* ID of the master entry at listpack head. */
+    uint64_t master_fields_count;       /* Master entries # of fields. */
+    unsigned char *master_fields_start; /* Master entries start in listpack. */
+    unsigned char *master_fields_ptr;   /* Master field to emit next. */
+    int entry_flags;                    /* Flags of entry we are emitting. */
+    int rev;                /* True if iterating end to start (reverse). */
+    uint64_t start_key[2];  /* Start key as 128 bit big endian. */
+    uint64_t end_key[2];    /* End key as 128 bit big endian. */
+    raxIterator ri;         /* Rax iterator. */
+    unsigned char *lp;      /* Current listpack. */
+    unsigned char *lp_ele;  /* Current listpack cursor. */
+    unsigned char *lp_flags; /* Current entry flags pointer. */
+    /* Buffers used to hold the string of lpGet() when the element is
+     * integer encoded, so that there is no string representation of the
+     * element inside the listpack itself. */
+    unsigned char field_buf[LP_INTBUF_SIZE];
+    unsigned char value_buf[LP_INTBUF_SIZE];
+} streamIterator;
+
+/* Consumer group. */
+typedef struct streamCG {
+    streamID last_id;       /* Last delivered (not acknowledged) ID for this
+                               group. Consumers that will just ask for more
+                               messages will served with IDs > than this. */
+    rax *pel;               /* Pending entries list. This is a radix tree that
+                               has every message delivered to consumers (without
+                               the NOACK option) that was yet not acknowledged
+                               as processed. The key of the radix tree is the
+                               ID as a 64 bit big endian number, while the
+                               associated value is a streamNACK structure.*/
+    rax *consumers;         /* A radix tree representing the consumers by name
+                               and their associated representation in the form
+                               of streamConsumer structures. */
+} streamCG;
+
+/* A specific consumer in a consumer group.  */
+typedef struct streamConsumer {
+    mstime_t seen_time;         /* Last time this consumer was active. */
+    sds name;                   /* Consumer name. This is how the consumer
+                                   will be identified in the consumer group
+                                   protocol. Case sensitive. */
+    rax *pel;                   /* Consumer specific pending entries list: all
+                                   the pending messages delivered to this
+                                   consumer not yet acknowledged. Keys are
+                                   big endian message IDs, while values are
+                                   the same streamNACK structure referenced
+                                   in the "pel" of the consumer group structure
+                                   itself, so the value is shared. */
+} streamConsumer;
+
+/* Pending (yet not acknowledged) message in a consumer group. */
+typedef struct streamNACK {
+    mstime_t delivery_time;     /* Last time this message was delivered. */
+    uint64_t delivery_count;    /* Number of times this message was delivered.*/
+    streamConsumer *consumer;   /* The consumer this message was delivered to
+                                   in the last delivery. */
+} streamNACK;
+
+/* Stream propagation informations, passed to functions in order to propagate
+ * XCLAIM commands to AOF and slaves. */
+typedef struct streamPropInfo {
+    robj *keyname;
+    robj *groupname;
+} streamPropInfo;
+
+/* Prototypes of exported APIs. */
+struct client;
+
+/* Flags for streamLookupConsumer */
+#define SLC_NONE      0
+#define SLC_NOCREAT   (1<<0) /* Do not create the consumer if it doesn't exist */
+#define SLC_NOREFRESH (1<<1) /* Do not update consumer's seen-time */
+
+stream *streamNew(void);
+void freeStream(stream *s);
+unsigned long streamLength(const robj *subject);
+size_t streamReplyWithRange(client *c, stream *s, streamID *start, streamID *end, size_t count, int rev, streamCG *group, streamConsumer *consumer, int flags, streamPropInfo *spi);
+void streamIteratorStart(streamIterator *si, stream *s, streamID *start, streamID *end, int rev);
+int streamIteratorGetID(streamIterator *si, streamID *id, int64_t *numfields);
+void streamIteratorGetField(streamIterator *si, unsigned char **fieldptr, unsigned char **valueptr, int64_t *fieldlen, int64_t *valuelen);
+void streamIteratorRemoveEntry(streamIterator *si, streamID *current);
+void streamIteratorStop(streamIterator *si);
+streamCG *streamLookupCG(stream *s, sds groupname);
+streamConsumer *streamLookupConsumer(streamCG *cg, sds name, int flags, int *created);
+streamCG *streamCreateCG(stream *s, char *name, size_t namelen, streamID *id);
+streamNACK *streamCreateNACK(streamConsumer *consumer);
+void streamDecodeID(void *buf, streamID *id);
+int streamCompareID(streamID *a, streamID *b);
+void streamFreeNACK(streamNACK *na);
+int streamIncrID(streamID *id);
+int streamDecrID(streamID *id);
+void streamPropagateConsumerCreation(client *c, robj *key, robj *groupname, sds consumername);
+robj *streamDup(robj *o);
+int streamValidateListpackIntegrity(unsigned char *lp, size_t size, int deep);
+int streamParseID(const robj *o, streamID *id);
+robj *createObjectFromStreamID(streamID *id);
+int streamAppendItem(stream *s, robj **argv, int64_t numfields, streamID *added_id, streamID *use_id);
+int streamDeleteItem(stream *s, streamID *id);
+int64_t streamTrimByLength(stream *s, long long maxlen, int approx);
+int64_t streamTrimByID(stream *s, streamID minid, int approx);
+
+#endif
diff --git a/redis-stable/src/syncio.c b/redis-stable/src/syncio.c
new file mode 100644
index 00000000..b2843d5f
--- /dev/null
+++ b/redis-stable/src/syncio.c
@@ -0,0 +1,145 @@
+/* Synchronous socket and file I/O operations useful across the core.
+ *
+ * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* ----------------- Blocking sockets I/O with timeouts --------------------- */
+
+/* Redis performs most of the I/O in a nonblocking way, with the exception
+ * of the SYNC command where the slave does it in a blocking way, and
+ * the MIGRATE command that must be blocking in order to be atomic from the
+ * point of view of the two instances (one migrating the key and one receiving
+ * the key). This is why need the following blocking I/O functions.
+ *
+ * All the functions take the timeout in milliseconds. */
+
+#define SYNCIO__RESOLUTION 10 /* Resolution in milliseconds */
+
+/* Write the specified payload to 'fd'. If writing the whole payload will be
+ * done within 'timeout' milliseconds the operation succeeds and 'size' is
+ * returned. Otherwise the operation fails, -1 is returned, and an unspecified
+ * partial write could be performed against the file descriptor. */
+ssize_t syncWrite(int fd, char *ptr, ssize_t size, long long timeout) {
+    ssize_t nwritten, ret = size;
+    long long start = mstime();
+    long long remaining = timeout;
+
+    while(1) {
+        long long wait = (remaining > SYNCIO__RESOLUTION) ?
+                          remaining : SYNCIO__RESOLUTION;
+        long long elapsed;
+
+        /* Optimistically try to write before checking if the file descriptor
+         * is actually writable. At worst we get EAGAIN. */
+        nwritten = write(fd,ptr,size);
+        if (nwritten == -1) {
+            if (errno != EAGAIN) return -1;
+        } else {
+            ptr += nwritten;
+            size -= nwritten;
+        }
+        if (size == 0) return ret;
+
+        /* Wait */
+        aeWait(fd,AE_WRITABLE,wait);
+        elapsed = mstime() - start;
+        if (elapsed >= timeout) {
+            errno = ETIMEDOUT;
+            return -1;
+        }
+        remaining = timeout - elapsed;
+    }
+}
+
+/* Read the specified amount of bytes from 'fd'. If all the bytes are read
+ * within 'timeout' milliseconds the operation succeed and 'size' is returned.
+ * Otherwise the operation fails, -1 is returned, and an unspecified amount of
+ * data could be read from the file descriptor. */
+ssize_t syncRead(int fd, char *ptr, ssize_t size, long long timeout) {
+    ssize_t nread, totread = 0;
+    long long start = mstime();
+    long long remaining = timeout;
+
+    if (size == 0) return 0;
+    while(1) {
+        long long wait = (remaining > SYNCIO__RESOLUTION) ?
+                          remaining : SYNCIO__RESOLUTION;
+        long long elapsed;
+
+        /* Optimistically try to read before checking if the file descriptor
+         * is actually readable. At worst we get EAGAIN. */
+        nread = read(fd,ptr,size);
+        if (nread == 0) return -1; /* short read. */
+        if (nread == -1) {
+            if (errno != EAGAIN) return -1;
+        } else {
+            ptr += nread;
+            size -= nread;
+            totread += nread;
+        }
+        if (size == 0) return totread;
+
+        /* Wait */
+        aeWait(fd,AE_READABLE,wait);
+        elapsed = mstime() - start;
+        if (elapsed >= timeout) {
+            errno = ETIMEDOUT;
+            return -1;
+        }
+        remaining = timeout - elapsed;
+    }
+}
+
+/* Read a line making sure that every char will not require more than 'timeout'
+ * milliseconds to be read.
+ *
+ * On success the number of bytes read is returned, otherwise -1.
+ * On success the string is always correctly terminated with a 0 byte. */
+ssize_t syncReadLine(int fd, char *ptr, ssize_t size, long long timeout) {
+    ssize_t nread = 0;
+
+    size--;
+    while(size) {
+        char c;
+
+        if (syncRead(fd,&c,1,timeout) == -1) return -1;
+        if (c == '\n') {
+            *ptr = '\0';
+            if (nread && *(ptr-1) == '\r') *(ptr-1) = '\0';
+            return nread;
+        } else {
+            *ptr++ = c;
+            *ptr = '\0';
+            nread++;
+        }
+        size--;
+    }
+    return nread;
+}
diff --git a/redis-stable/src/t_hash.c b/redis-stable/src/t_hash.c
new file mode 100644
index 00000000..2720fdbc
--- /dev/null
+++ b/redis-stable/src/t_hash.c
@@ -0,0 +1,1209 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <math.h>
+
+/*-----------------------------------------------------------------------------
+ * Hash type API
+ *----------------------------------------------------------------------------*/
+
+/* Check the length of a number of objects to see if we need to convert a
+ * ziplist to a real hash. Note that we only check string encoded objects
+ * as their string length can be queried in constant time. */
+void hashTypeTryConversion(robj *o, robj **argv, int start, int end) {
+    int i;
+    size_t sum = 0;
+
+    if (o->encoding != OBJ_ENCODING_ZIPLIST) return;
+
+    for (i = start; i <= end; i++) {
+        if (!sdsEncodedObject(argv[i]))
+            continue;
+        size_t len = sdslen(argv[i]->ptr);
+        if (len > server.hash_max_ziplist_value) {
+            hashTypeConvert(o, OBJ_ENCODING_HT);
+            return;
+        }
+        sum += len;
+    }
+    if (!ziplistSafeToAdd(o->ptr, sum))
+        hashTypeConvert(o, OBJ_ENCODING_HT);
+}
+
+/* Get the value from a ziplist encoded hash, identified by field.
+ * Returns -1 when the field cannot be found. */
+int hashTypeGetFromZiplist(robj *o, sds field,
+                           unsigned char **vstr,
+                           unsigned int *vlen,
+                           long long *vll)
+{
+    unsigned char *zl, *fptr = NULL, *vptr = NULL;
+    int ret;
+
+    serverAssert(o->encoding == OBJ_ENCODING_ZIPLIST);
+
+    zl = o->ptr;
+    fptr = ziplistIndex(zl, ZIPLIST_HEAD);
+    if (fptr != NULL) {
+        fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
+        if (fptr != NULL) {
+            /* Grab pointer to the value (fptr points to the field) */
+            vptr = ziplistNext(zl, fptr);
+            serverAssert(vptr != NULL);
+        }
+    }
+
+    if (vptr != NULL) {
+        ret = ziplistGet(vptr, vstr, vlen, vll);
+        serverAssert(ret);
+        return 0;
+    }
+
+    return -1;
+}
+
+/* Get the value from a hash table encoded hash, identified by field.
+ * Returns NULL when the field cannot be found, otherwise the SDS value
+ * is returned. */
+sds hashTypeGetFromHashTable(robj *o, sds field) {
+    dictEntry *de;
+
+    serverAssert(o->encoding == OBJ_ENCODING_HT);
+
+    de = dictFind(o->ptr, field);
+    if (de == NULL) return NULL;
+    return dictGetVal(de);
+}
+
+/* Higher level function of hashTypeGet*() that returns the hash value
+ * associated with the specified field. If the field is found C_OK
+ * is returned, otherwise C_ERR. The returned object is returned by
+ * reference in either *vstr and *vlen if it's returned in string form,
+ * or stored in *vll if it's returned as a number.
+ *
+ * If *vll is populated *vstr is set to NULL, so the caller
+ * can always check the function return by checking the return value
+ * for C_OK and checking if vll (or vstr) is NULL. */
+int hashTypeGetValue(robj *o, sds field, unsigned char **vstr, unsigned int *vlen, long long *vll) {
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        *vstr = NULL;
+        if (hashTypeGetFromZiplist(o, field, vstr, vlen, vll) == 0)
+            return C_OK;
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        sds value;
+        if ((value = hashTypeGetFromHashTable(o, field)) != NULL) {
+            *vstr = (unsigned char*) value;
+            *vlen = sdslen(value);
+            return C_OK;
+        }
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return C_ERR;
+}
+
+/* Like hashTypeGetValue() but returns a Redis object, which is useful for
+ * interaction with the hash type outside t_hash.c.
+ * The function returns NULL if the field is not found in the hash. Otherwise
+ * a newly allocated string object with the value is returned. */
+robj *hashTypeGetValueObject(robj *o, sds field) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vll;
+
+    if (hashTypeGetValue(o,field,&vstr,&vlen,&vll) == C_ERR) return NULL;
+    if (vstr) return createStringObject((char*)vstr,vlen);
+    else return createStringObjectFromLongLong(vll);
+}
+
+/* Higher level function using hashTypeGet*() to return the length of the
+ * object associated with the requested field, or 0 if the field does not
+ * exist. */
+size_t hashTypeGetValueLength(robj *o, sds field) {
+    size_t len = 0;
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *vstr = NULL;
+        unsigned int vlen = UINT_MAX;
+        long long vll = LLONG_MAX;
+
+        if (hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll) == 0)
+            len = vstr ? vlen : sdigits10(vll);
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        sds aux;
+
+        if ((aux = hashTypeGetFromHashTable(o, field)) != NULL)
+            len = sdslen(aux);
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return len;
+}
+
+/* Test if the specified field exists in the given hash. Returns 1 if the field
+ * exists, and 0 when it doesn't. */
+int hashTypeExists(robj *o, sds field) {
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *vstr = NULL;
+        unsigned int vlen = UINT_MAX;
+        long long vll = LLONG_MAX;
+
+        if (hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll) == 0) return 1;
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        if (hashTypeGetFromHashTable(o, field) != NULL) return 1;
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return 0;
+}
+
+/* Add a new field, overwrite the old with the new value if it already exists.
+ * Return 0 on insert and 1 on update.
+ *
+ * By default, the key and value SDS strings are copied if needed, so the
+ * caller retains ownership of the strings passed. However this behavior
+ * can be effected by passing appropriate flags (possibly bitwise OR-ed):
+ *
+ * HASH_SET_TAKE_FIELD -- The SDS field ownership passes to the function.
+ * HASH_SET_TAKE_VALUE -- The SDS value ownership passes to the function.
+ *
+ * When the flags are used the caller does not need to release the passed
+ * SDS string(s). It's up to the function to use the string to create a new
+ * entry or to free the SDS string before returning to the caller.
+ *
+ * HASH_SET_COPY corresponds to no flags passed, and means the default
+ * semantics of copying the values if needed.
+ *
+ */
+#define HASH_SET_TAKE_FIELD (1<<0)
+#define HASH_SET_TAKE_VALUE (1<<1)
+#define HASH_SET_COPY 0
+int hashTypeSet(robj *o, sds field, sds value, int flags) {
+    int update = 0;
+
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl, *fptr, *vptr;
+
+        zl = o->ptr;
+        fptr = ziplistIndex(zl, ZIPLIST_HEAD);
+        if (fptr != NULL) {
+            fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
+            if (fptr != NULL) {
+                /* Grab pointer to the value (fptr points to the field) */
+                vptr = ziplistNext(zl, fptr);
+                serverAssert(vptr != NULL);
+                update = 1;
+
+                /* Replace value */
+                zl = ziplistReplace(zl, vptr, (unsigned char*)value,
+                        sdslen(value));
+            }
+        }
+
+        if (!update) {
+            /* Push new field/value pair onto the tail of the ziplist */
+            zl = ziplistPush(zl, (unsigned char*)field, sdslen(field),
+                    ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)value, sdslen(value),
+                    ZIPLIST_TAIL);
+        }
+        o->ptr = zl;
+
+        /* Check if the ziplist needs to be converted to a hash table */
+        if (hashTypeLength(o) > server.hash_max_ziplist_entries)
+            hashTypeConvert(o, OBJ_ENCODING_HT);
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        dictEntry *de = dictFind(o->ptr,field);
+        if (de) {
+            sdsfree(dictGetVal(de));
+            if (flags & HASH_SET_TAKE_VALUE) {
+                dictGetVal(de) = value;
+                value = NULL;
+            } else {
+                dictGetVal(de) = sdsdup(value);
+            }
+            update = 1;
+        } else {
+            sds f,v;
+            if (flags & HASH_SET_TAKE_FIELD) {
+                f = field;
+                field = NULL;
+            } else {
+                f = sdsdup(field);
+            }
+            if (flags & HASH_SET_TAKE_VALUE) {
+                v = value;
+                value = NULL;
+            } else {
+                v = sdsdup(value);
+            }
+            dictAdd(o->ptr,f,v);
+        }
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+
+    /* Free SDS strings we did not referenced elsewhere if the flags
+     * want this function to be responsible. */
+    if (flags & HASH_SET_TAKE_FIELD && field) sdsfree(field);
+    if (flags & HASH_SET_TAKE_VALUE && value) sdsfree(value);
+    return update;
+}
+
+/* Delete an element from a hash.
+ * Return 1 on deleted and 0 on not found. */
+int hashTypeDelete(robj *o, sds field) {
+    int deleted = 0;
+
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl, *fptr;
+
+        zl = o->ptr;
+        fptr = ziplistIndex(zl, ZIPLIST_HEAD);
+        if (fptr != NULL) {
+            fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
+            if (fptr != NULL) {
+                zl = ziplistDelete(zl,&fptr); /* Delete the key. */
+                zl = ziplistDelete(zl,&fptr); /* Delete the value. */
+                o->ptr = zl;
+                deleted = 1;
+            }
+        }
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        if (dictDelete((dict*)o->ptr, field) == C_OK) {
+            deleted = 1;
+
+            /* Always check if the dictionary needs a resize after a delete. */
+            if (htNeedsResize(o->ptr)) dictResize(o->ptr);
+        }
+
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return deleted;
+}
+
+/* Return the number of elements in a hash. */
+unsigned long hashTypeLength(const robj *o) {
+    unsigned long length = ULONG_MAX;
+
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        length = ziplistLen(o->ptr) / 2;
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        length = dictSize((const dict*)o->ptr);
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return length;
+}
+
+hashTypeIterator *hashTypeInitIterator(robj *subject) {
+    hashTypeIterator *hi = zmalloc(sizeof(hashTypeIterator));
+    hi->subject = subject;
+    hi->encoding = subject->encoding;
+
+    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
+        hi->fptr = NULL;
+        hi->vptr = NULL;
+    } else if (hi->encoding == OBJ_ENCODING_HT) {
+        hi->di = dictGetIterator(subject->ptr);
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return hi;
+}
+
+void hashTypeReleaseIterator(hashTypeIterator *hi) {
+    if (hi->encoding == OBJ_ENCODING_HT)
+        dictReleaseIterator(hi->di);
+    zfree(hi);
+}
+
+/* Move to the next entry in the hash. Return C_OK when the next entry
+ * could be found and C_ERR when the iterator reaches the end. */
+int hashTypeNext(hashTypeIterator *hi) {
+    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl;
+        unsigned char *fptr, *vptr;
+
+        zl = hi->subject->ptr;
+        fptr = hi->fptr;
+        vptr = hi->vptr;
+
+        if (fptr == NULL) {
+            /* Initialize cursor */
+            serverAssert(vptr == NULL);
+            fptr = ziplistIndex(zl, 0);
+        } else {
+            /* Advance cursor */
+            serverAssert(vptr != NULL);
+            fptr = ziplistNext(zl, vptr);
+        }
+        if (fptr == NULL) return C_ERR;
+
+        /* Grab pointer to the value (fptr points to the field) */
+        vptr = ziplistNext(zl, fptr);
+        serverAssert(vptr != NULL);
+
+        /* fptr, vptr now point to the first or next pair */
+        hi->fptr = fptr;
+        hi->vptr = vptr;
+    } else if (hi->encoding == OBJ_ENCODING_HT) {
+        if ((hi->de = dictNext(hi->di)) == NULL) return C_ERR;
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return C_OK;
+}
+
+/* Get the field or value at iterator cursor, for an iterator on a hash value
+ * encoded as a ziplist. Prototype is similar to `hashTypeGetFromZiplist`. */
+void hashTypeCurrentFromZiplist(hashTypeIterator *hi, int what,
+                                unsigned char **vstr,
+                                unsigned int *vlen,
+                                long long *vll)
+{
+    int ret;
+
+    serverAssert(hi->encoding == OBJ_ENCODING_ZIPLIST);
+
+    if (what & OBJ_HASH_KEY) {
+        ret = ziplistGet(hi->fptr, vstr, vlen, vll);
+        serverAssert(ret);
+    } else {
+        ret = ziplistGet(hi->vptr, vstr, vlen, vll);
+        serverAssert(ret);
+    }
+}
+
+/* Get the field or value at iterator cursor, for an iterator on a hash value
+ * encoded as a hash table. Prototype is similar to
+ * `hashTypeGetFromHashTable`. */
+sds hashTypeCurrentFromHashTable(hashTypeIterator *hi, int what) {
+    serverAssert(hi->encoding == OBJ_ENCODING_HT);
+
+    if (what & OBJ_HASH_KEY) {
+        return dictGetKey(hi->de);
+    } else {
+        return dictGetVal(hi->de);
+    }
+}
+
+/* Higher level function of hashTypeCurrent*() that returns the hash value
+ * at current iterator position.
+ *
+ * The returned element is returned by reference in either *vstr and *vlen if
+ * it's returned in string form, or stored in *vll if it's returned as
+ * a number.
+ *
+ * If *vll is populated *vstr is set to NULL, so the caller
+ * can always check the function return by checking the return value
+ * type checking if vstr == NULL. */
+void hashTypeCurrentObject(hashTypeIterator *hi, int what, unsigned char **vstr, unsigned int *vlen, long long *vll) {
+    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
+        *vstr = NULL;
+        hashTypeCurrentFromZiplist(hi, what, vstr, vlen, vll);
+    } else if (hi->encoding == OBJ_ENCODING_HT) {
+        sds ele = hashTypeCurrentFromHashTable(hi, what);
+        *vstr = (unsigned char*) ele;
+        *vlen = sdslen(ele);
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+/* Return the key or value at the current iterator position as a new
+ * SDS string. */
+sds hashTypeCurrentObjectNewSds(hashTypeIterator *hi, int what) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vll;
+
+    hashTypeCurrentObject(hi,what,&vstr,&vlen,&vll);
+    if (vstr) return sdsnewlen(vstr,vlen);
+    return sdsfromlonglong(vll);
+}
+
+robj *hashTypeLookupWriteOrCreate(client *c, robj *key) {
+    robj *o = lookupKeyWrite(c->db,key);
+    if (checkType(c,o,OBJ_HASH)) return NULL;
+
+    if (o == NULL) {
+        o = createHashObject();
+        dbAdd(c->db,key,o);
+    }
+    return o;
+}
+
+void hashTypeConvertZiplist(robj *o, int enc) {
+    serverAssert(o->encoding == OBJ_ENCODING_ZIPLIST);
+
+    if (enc == OBJ_ENCODING_ZIPLIST) {
+        /* Nothing to do... */
+
+    } else if (enc == OBJ_ENCODING_HT) {
+        hashTypeIterator *hi;
+        dict *dict;
+        int ret;
+
+        hi = hashTypeInitIterator(o);
+        dict = dictCreate(&hashDictType, NULL);
+
+        while (hashTypeNext(hi) != C_ERR) {
+            sds key, value;
+
+            key = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
+            value = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
+            ret = dictAdd(dict, key, value);
+            if (ret != DICT_OK) {
+                serverLogHexDump(LL_WARNING,"ziplist with dup elements dump",
+                    o->ptr,ziplistBlobLen(o->ptr));
+                serverPanic("Ziplist corruption detected");
+            }
+        }
+        hashTypeReleaseIterator(hi);
+        zfree(o->ptr);
+        o->encoding = OBJ_ENCODING_HT;
+        o->ptr = dict;
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+void hashTypeConvert(robj *o, int enc) {
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        hashTypeConvertZiplist(o, enc);
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        serverPanic("Not implemented");
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+/* This is a helper function for the COPY command.
+ * Duplicate a hash object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * The resulting object always has refcount set to 1 */
+robj *hashTypeDup(robj *o) {
+    robj *hobj;
+    hashTypeIterator *hi;
+
+    serverAssert(o->type == OBJ_HASH);
+
+    if(o->encoding == OBJ_ENCODING_ZIPLIST){
+        unsigned char *zl = o->ptr;
+        size_t sz = ziplistBlobLen(zl);
+        unsigned char *new_zl = zmalloc(sz);
+        memcpy(new_zl, zl, sz);
+        hobj = createObject(OBJ_HASH, new_zl);
+        hobj->encoding = OBJ_ENCODING_ZIPLIST;
+    } else if(o->encoding == OBJ_ENCODING_HT){
+        dict *d = dictCreate(&hashDictType, NULL);
+        dictExpand(d, dictSize((const dict*)o->ptr));
+
+        hi = hashTypeInitIterator(o);
+        while (hashTypeNext(hi) != C_ERR) {
+            sds field, value;
+            sds newfield, newvalue;
+            /* Extract a field-value pair from an original hash object.*/
+            field = hashTypeCurrentFromHashTable(hi, OBJ_HASH_KEY);
+            value = hashTypeCurrentFromHashTable(hi, OBJ_HASH_VALUE);
+            newfield = sdsdup(field);
+            newvalue = sdsdup(value);
+
+            /* Add a field-value pair to a new hash object. */
+            dictAdd(d,newfield,newvalue);
+        }
+        hashTypeReleaseIterator(hi);
+
+        hobj = createObject(OBJ_HASH, d);
+        hobj->encoding = OBJ_ENCODING_HT;
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+    return hobj;
+}
+
+/* callback for to check the ziplist doesn't have duplicate recoreds */
+static int _hashZiplistEntryValidation(unsigned char *p, void *userdata) {
+    struct {
+        long count;
+        dict *fields;
+    } *data = userdata;
+
+    /* Odd records are field names, add to dict and check that's not a dup */
+    if (((data->count) & 1) == 0) {
+        unsigned char *str;
+        unsigned int slen;
+        long long vll;
+        if (!ziplistGet(p, &str, &slen, &vll))
+            return 0;
+        sds field = str? sdsnewlen(str, slen): sdsfromlonglong(vll);;
+        if (dictAdd(data->fields, field, NULL) != DICT_OK) {
+            /* Duplicate, return an error */
+            sdsfree(field);
+            return 0;
+        }
+    }
+
+    (data->count)++;
+    return 1;
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we scan all the entries one by one. */
+int hashZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep) {
+    if (!deep)
+        return ziplistValidateIntegrity(zl, size, 0, NULL, NULL);
+
+    /* Keep track of the field names to locate duplicate ones */
+    struct {
+        long count;
+        dict *fields;
+    } data = {0, dictCreate(&hashDictType, NULL)};
+
+    int ret = ziplistValidateIntegrity(zl, size, 1, _hashZiplistEntryValidation, &data);
+
+    /* make sure we have an even number of records. */
+    if (data.count & 1)
+        ret = 0;
+
+    dictRelease(data.fields);
+    return ret;
+}
+
+/* Create a new sds string from the ziplist entry. */
+sds hashSdsFromZiplistEntry(ziplistEntry *e) {
+    return e->sval ? sdsnewlen(e->sval, e->slen) : sdsfromlonglong(e->lval);
+}
+
+/* Reply with bulk string from the ziplist entry. */
+void hashReplyFromZiplistEntry(client *c, ziplistEntry *e) {
+    if (e->sval)
+        addReplyBulkCBuffer(c, e->sval, e->slen);
+    else
+        addReplyBulkLongLong(c, e->lval);
+}
+
+/* Return random element from a non empty hash.
+ * 'key' and 'val' will be set to hold the element.
+ * The memory in them is not to be freed or modified by the caller.
+ * 'val' can be NULL in which case it's not extracted. */
+void hashTypeRandomElement(robj *hashobj, unsigned long hashsize, ziplistEntry *key, ziplistEntry *val) {
+    if (hashobj->encoding == OBJ_ENCODING_HT) {
+        dictEntry *de = dictGetFairRandomKey(hashobj->ptr);
+        sds s = dictGetKey(de);
+        key->sval = (unsigned char*)s;
+        key->slen = sdslen(s);
+        if (val) {
+            sds s = dictGetVal(de);
+            val->sval = (unsigned char*)s;
+            val->slen = sdslen(s);
+        }
+    } else if (hashobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        ziplistRandomPair(hashobj->ptr, hashsize, key, val);
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Hash type commands
+ *----------------------------------------------------------------------------*/
+
+void hsetnxCommand(client *c) {
+    robj *o;
+    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
+    hashTypeTryConversion(o,c->argv,2,3);
+
+    if (hashTypeExists(o, c->argv[2]->ptr)) {
+        addReply(c, shared.czero);
+    } else {
+        hashTypeSet(o,c->argv[2]->ptr,c->argv[3]->ptr,HASH_SET_COPY);
+        addReply(c, shared.cone);
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_HASH,"hset",c->argv[1],c->db->id);
+        server.dirty++;
+    }
+}
+
+void hsetCommand(client *c) {
+    int i, created = 0;
+    robj *o;
+
+    if ((c->argc % 2) == 1) {
+        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",c->cmd->name);
+        return;
+    }
+
+    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
+    hashTypeTryConversion(o,c->argv,2,c->argc-1);
+
+    for (i = 2; i < c->argc; i += 2)
+        created += !hashTypeSet(o,c->argv[i]->ptr,c->argv[i+1]->ptr,HASH_SET_COPY);
+
+    /* HMSET (deprecated) and HSET return value is different. */
+    char *cmdname = c->argv[0]->ptr;
+    if (cmdname[1] == 's' || cmdname[1] == 'S') {
+        /* HSET */
+        addReplyLongLong(c, created);
+    } else {
+        /* HMSET */
+        addReply(c, shared.ok);
+    }
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_HASH,"hset",c->argv[1],c->db->id);
+    server.dirty += (c->argc - 2)/2;
+}
+
+void hincrbyCommand(client *c) {
+    long long value, incr, oldvalue;
+    robj *o;
+    sds new;
+    unsigned char *vstr;
+    unsigned int vlen;
+
+    if (getLongLongFromObjectOrReply(c,c->argv[3],&incr,NULL) != C_OK) return;
+    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
+    if (hashTypeGetValue(o,c->argv[2]->ptr,&vstr,&vlen,&value) == C_OK) {
+        if (vstr) {
+            if (string2ll((char*)vstr,vlen,&value) == 0) {
+                addReplyError(c,"hash value is not an integer");
+                return;
+            }
+        } /* Else hashTypeGetValue() already stored it into &value */
+    } else {
+        value = 0;
+    }
+
+    oldvalue = value;
+    if ((incr < 0 && oldvalue < 0 && incr < (LLONG_MIN-oldvalue)) ||
+        (incr > 0 && oldvalue > 0 && incr > (LLONG_MAX-oldvalue))) {
+        addReplyError(c,"increment or decrement would overflow");
+        return;
+    }
+    value += incr;
+    new = sdsfromlonglong(value);
+    hashTypeSet(o,c->argv[2]->ptr,new,HASH_SET_TAKE_VALUE);
+    addReplyLongLong(c,value);
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_HASH,"hincrby",c->argv[1],c->db->id);
+    server.dirty++;
+}
+
+void hincrbyfloatCommand(client *c) {
+    long double value, incr;
+    long long ll;
+    robj *o;
+    sds new;
+    unsigned char *vstr;
+    unsigned int vlen;
+
+    if (getLongDoubleFromObjectOrReply(c,c->argv[3],&incr,NULL) != C_OK) return;
+    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
+    if (hashTypeGetValue(o,c->argv[2]->ptr,&vstr,&vlen,&ll) == C_OK) {
+        if (vstr) {
+            if (string2ld((char*)vstr,vlen,&value) == 0) {
+                addReplyError(c,"hash value is not a float");
+                return;
+            }
+        } else {
+            value = (long double)ll;
+        }
+    } else {
+        value = 0;
+    }
+
+    value += incr;
+    if (isnan(value) || isinf(value)) {
+        addReplyError(c,"increment would produce NaN or Infinity");
+        return;
+    }
+
+    char buf[MAX_LONG_DOUBLE_CHARS];
+    int len = ld2string(buf,sizeof(buf),value,LD_STR_HUMAN);
+    new = sdsnewlen(buf,len);
+    hashTypeSet(o,c->argv[2]->ptr,new,HASH_SET_TAKE_VALUE);
+    addReplyBulkCBuffer(c,buf,len);
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_HASH,"hincrbyfloat",c->argv[1],c->db->id);
+    server.dirty++;
+
+    /* Always replicate HINCRBYFLOAT as an HSET command with the final value
+     * in order to make sure that differences in float precision or formatting
+     * will not create differences in replicas or after an AOF restart. */
+    robj *newobj;
+    newobj = createRawStringObject(buf,len);
+    rewriteClientCommandArgument(c,0,shared.hset);
+    rewriteClientCommandArgument(c,3,newobj);
+    decrRefCount(newobj);
+}
+
+static void addHashFieldToReply(client *c, robj *o, sds field) {
+    int ret;
+
+    if (o == NULL) {
+        addReplyNull(c);
+        return;
+    }
+
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *vstr = NULL;
+        unsigned int vlen = UINT_MAX;
+        long long vll = LLONG_MAX;
+
+        ret = hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll);
+        if (ret < 0) {
+            addReplyNull(c);
+        } else {
+            if (vstr) {
+                addReplyBulkCBuffer(c, vstr, vlen);
+            } else {
+                addReplyBulkLongLong(c, vll);
+            }
+        }
+
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        sds value = hashTypeGetFromHashTable(o, field);
+        if (value == NULL)
+            addReplyNull(c);
+        else
+            addReplyBulkCBuffer(c, value, sdslen(value));
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+void hgetCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+
+    addHashFieldToReply(c, o, c->argv[2]->ptr);
+}
+
+void hmgetCommand(client *c) {
+    robj *o;
+    int i;
+
+    /* Don't abort when the key cannot be found. Non-existing keys are empty
+     * hashes, where HMGET should respond with a series of null bulks. */
+    o = lookupKeyRead(c->db, c->argv[1]);
+    if (checkType(c,o,OBJ_HASH)) return;
+
+    addReplyArrayLen(c, c->argc-2);
+    for (i = 2; i < c->argc; i++) {
+        addHashFieldToReply(c, o, c->argv[i]->ptr);
+    }
+}
+
+void hdelCommand(client *c) {
+    robj *o;
+    int j, deleted = 0, keyremoved = 0;
+
+    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+
+    for (j = 2; j < c->argc; j++) {
+        if (hashTypeDelete(o,c->argv[j]->ptr)) {
+            deleted++;
+            if (hashTypeLength(o) == 0) {
+                dbDelete(c->db,c->argv[1]);
+                keyremoved = 1;
+                break;
+            }
+        }
+    }
+    if (deleted) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_HASH,"hdel",c->argv[1],c->db->id);
+        if (keyremoved)
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],
+                                c->db->id);
+        server.dirty += deleted;
+    }
+    addReplyLongLong(c,deleted);
+}
+
+void hlenCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+
+    addReplyLongLong(c,hashTypeLength(o));
+}
+
+void hstrlenCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+    addReplyLongLong(c,hashTypeGetValueLength(o,c->argv[2]->ptr));
+}
+
+static void addHashIteratorCursorToReply(client *c, hashTypeIterator *hi, int what) {
+    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *vstr = NULL;
+        unsigned int vlen = UINT_MAX;
+        long long vll = LLONG_MAX;
+
+        hashTypeCurrentFromZiplist(hi, what, &vstr, &vlen, &vll);
+        if (vstr)
+            addReplyBulkCBuffer(c, vstr, vlen);
+        else
+            addReplyBulkLongLong(c, vll);
+    } else if (hi->encoding == OBJ_ENCODING_HT) {
+        sds value = hashTypeCurrentFromHashTable(hi, what);
+        addReplyBulkCBuffer(c, value, sdslen(value));
+    } else {
+        serverPanic("Unknown hash encoding");
+    }
+}
+
+void genericHgetallCommand(client *c, int flags) {
+    robj *o;
+    hashTypeIterator *hi;
+    int length, count = 0;
+
+    robj *emptyResp = (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) ?
+        shared.emptymap[c->resp] : shared.emptyarray;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],emptyResp))
+        == NULL || checkType(c,o,OBJ_HASH)) return;
+
+    /* We return a map if the user requested keys and values, like in the
+     * HGETALL case. Otherwise to use a flat array makes more sense. */
+    length = hashTypeLength(o);
+    if (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) {
+        addReplyMapLen(c, length);
+    } else {
+        addReplyArrayLen(c, length);
+    }
+
+    hi = hashTypeInitIterator(o);
+    while (hashTypeNext(hi) != C_ERR) {
+        if (flags & OBJ_HASH_KEY) {
+            addHashIteratorCursorToReply(c, hi, OBJ_HASH_KEY);
+            count++;
+        }
+        if (flags & OBJ_HASH_VALUE) {
+            addHashIteratorCursorToReply(c, hi, OBJ_HASH_VALUE);
+            count++;
+        }
+    }
+
+    hashTypeReleaseIterator(hi);
+
+    /* Make sure we returned the right number of elements. */
+    if (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) count /= 2;
+    serverAssert(count == length);
+}
+
+void hkeysCommand(client *c) {
+    genericHgetallCommand(c,OBJ_HASH_KEY);
+}
+
+void hvalsCommand(client *c) {
+    genericHgetallCommand(c,OBJ_HASH_VALUE);
+}
+
+void hgetallCommand(client *c) {
+    genericHgetallCommand(c,OBJ_HASH_KEY|OBJ_HASH_VALUE);
+}
+
+void hexistsCommand(client *c) {
+    robj *o;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+
+    addReply(c, hashTypeExists(o,c->argv[2]->ptr) ? shared.cone : shared.czero);
+}
+
+void hscanCommand(client *c) {
+    robj *o;
+    unsigned long cursor;
+
+    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
+        checkType(c,o,OBJ_HASH)) return;
+    scanGenericCommand(c,o,cursor);
+}
+
+static void harndfieldReplyWithZiplist(client *c, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
+    for (unsigned long i = 0; i < count; i++) {
+        if (vals && c->resp > 2)
+            addReplyArrayLen(c,2);
+        if (keys[i].sval)
+            addReplyBulkCBuffer(c, keys[i].sval, keys[i].slen);
+        else
+            addReplyBulkLongLong(c, keys[i].lval);
+        if (vals) {
+            if (vals[i].sval)
+                addReplyBulkCBuffer(c, vals[i].sval, vals[i].slen);
+            else
+                addReplyBulkLongLong(c, vals[i].lval);
+        }
+    }
+}
+
+/* How many times bigger should be the hash compared to the requested size
+ * for us to not use the "remove elements" strategy? Read later in the
+ * implementation for more info. */
+#define HRANDFIELD_SUB_STRATEGY_MUL 3
+
+/* If client is trying to ask for a very large number of random elements,
+ * queuing may consume an unlimited amount of memory, so we want to limit
+ * the number of randoms per time. */
+#define HRANDFIELD_RANDOM_SAMPLE_LIMIT 1000
+
+void hrandfieldWithCountCommand(client *c, long l, int withvalues) {
+    unsigned long count, size;
+    int uniq = 1;
+    robj *hash;
+
+    if ((hash = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray))
+        == NULL || checkType(c,hash,OBJ_HASH)) return;
+    size = hashTypeLength(hash);
+
+    if(l >= 0) {
+        count = (unsigned long) l;
+    } else {
+        count = -l;
+        uniq = 0;
+    }
+
+    /* If count is zero, serve it ASAP to avoid special cases later. */
+    if (count == 0) {
+        addReply(c,shared.emptyarray);
+        return;
+    }
+
+    /* CASE 1: The count was negative, so the extraction method is just:
+     * "return N random elements" sampling the whole set every time.
+     * This case is trivial and can be served without auxiliary data
+     * structures. This case is the only one that also needs to return the
+     * elements in random order. */
+    if (!uniq || count == 1) {
+        if (withvalues && c->resp == 2)
+            addReplyArrayLen(c, count*2);
+        else
+            addReplyArrayLen(c, count);
+        if (hash->encoding == OBJ_ENCODING_HT) {
+            sds key, value;
+            while (count--) {
+                dictEntry *de = dictGetFairRandomKey(hash->ptr);
+                key = dictGetKey(de);
+                value = dictGetVal(de);
+                if (withvalues && c->resp > 2)
+                    addReplyArrayLen(c,2);
+                addReplyBulkCBuffer(c, key, sdslen(key));
+                if (withvalues)
+                    addReplyBulkCBuffer(c, value, sdslen(value));
+            }
+        } else if (hash->encoding == OBJ_ENCODING_ZIPLIST) {
+            ziplistEntry *keys, *vals = NULL;
+            unsigned long limit, sample_count;
+            limit = count > HRANDFIELD_RANDOM_SAMPLE_LIMIT ? HRANDFIELD_RANDOM_SAMPLE_LIMIT : count;
+            keys = zmalloc(sizeof(ziplistEntry)*limit);
+            if (withvalues)
+                vals = zmalloc(sizeof(ziplistEntry)*limit);
+            while (count) {
+                sample_count = count > limit ? limit : count;
+                count -= sample_count;
+                ziplistRandomPairs(hash->ptr, sample_count, keys, vals);
+                harndfieldReplyWithZiplist(c, sample_count, keys, vals);
+            }
+            zfree(keys);
+            zfree(vals);
+        }
+        return;
+    }
+
+    /* Initiate reply count, RESP3 responds with nested array, RESP2 with flat one. */
+    long reply_size = count < size ? count : size;
+    if (withvalues && c->resp == 2)
+        addReplyArrayLen(c, reply_size*2);
+    else
+        addReplyArrayLen(c, reply_size);
+
+    /* CASE 2:
+    * The number of requested elements is greater than the number of
+    * elements inside the hash: simply return the whole hash. */
+    if(count >= size) {
+        hashTypeIterator *hi = hashTypeInitIterator(hash);
+        while (hashTypeNext(hi) != C_ERR) {
+            if (withvalues && c->resp > 2)
+                addReplyArrayLen(c,2);
+            addHashIteratorCursorToReply(c, hi, OBJ_HASH_KEY);
+            if (withvalues)
+                addHashIteratorCursorToReply(c, hi, OBJ_HASH_VALUE);
+        }
+        hashTypeReleaseIterator(hi);
+        return;
+    }
+
+    /* CASE 3:
+     * The number of elements inside the hash is not greater than
+     * HRANDFIELD_SUB_STRATEGY_MUL times the number of requested elements.
+     * In this case we create a hash from scratch with all the elements, and
+     * subtract random elements to reach the requested number of elements.
+     *
+     * This is done because if the number of requested elements is just
+     * a bit less than the number of elements in the hash, the natural approach
+     * used into CASE 4 is highly inefficient. */
+    if (count*HRANDFIELD_SUB_STRATEGY_MUL > size) {
+        dict *d = dictCreate(&sdsReplyDictType, NULL);
+        dictExpand(d, size);
+        hashTypeIterator *hi = hashTypeInitIterator(hash);
+
+        /* Add all the elements into the temporary dictionary. */
+        while ((hashTypeNext(hi)) != C_ERR) {
+            int ret = DICT_ERR;
+            sds key, value = NULL;
+
+            key = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
+            if (withvalues)
+                value = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
+            ret = dictAdd(d, key, value);
+
+            serverAssert(ret == DICT_OK);
+        }
+        serverAssert(dictSize(d) == size);
+        hashTypeReleaseIterator(hi);
+
+        /* Remove random elements to reach the right count. */
+        while (size > count) {
+            dictEntry *de;
+            de = dictGetRandomKey(d);
+            dictUnlink(d,dictGetKey(de));
+            sdsfree(dictGetKey(de));
+            sdsfree(dictGetVal(de));
+            dictFreeUnlinkedEntry(d,de);
+            size--;
+        }
+
+        /* Reply with what's in the dict and release memory */
+        dictIterator *di;
+        dictEntry *de;
+        di = dictGetIterator(d);
+        while ((de = dictNext(di)) != NULL) {
+            sds key = dictGetKey(de);
+            sds value = dictGetVal(de);
+            if (withvalues && c->resp > 2)
+                addReplyArrayLen(c,2);
+            addReplyBulkSds(c, key);
+            if (withvalues)
+                addReplyBulkSds(c, value);
+        }
+
+        dictReleaseIterator(di);
+        dictRelease(d);
+    }
+
+    /* CASE 4: We have a big hash compared to the requested number of elements.
+     * In this case we can simply get random elements from the hash and add
+     * to the temporary hash, trying to eventually get enough unique elements
+     * to reach the specified count. */
+    else {
+        if (hash->encoding == OBJ_ENCODING_ZIPLIST) {
+            /* it is inefficient to repeatedly pick one random element from a
+             * ziplist. so we use this instead: */
+            ziplistEntry *keys, *vals = NULL;
+            keys = zmalloc(sizeof(ziplistEntry)*count);
+            if (withvalues)
+                vals = zmalloc(sizeof(ziplistEntry)*count);
+            serverAssert(ziplistRandomPairsUnique(hash->ptr, count, keys, vals) == count);
+            harndfieldReplyWithZiplist(c, count, keys, vals);
+            zfree(keys);
+            zfree(vals);
+            return;
+        }
+
+        /* Hashtable encoding (generic implementation) */
+        unsigned long added = 0;
+        ziplistEntry key, value;
+        dict *d = dictCreate(&hashDictType, NULL);
+        dictExpand(d, count);
+        while(added < count) {
+            hashTypeRandomElement(hash, size, &key, withvalues? &value : NULL);
+
+            /* Try to add the object to the dictionary. If it already exists
+            * free it, otherwise increment the number of objects we have
+            * in the result dictionary. */
+            sds skey = hashSdsFromZiplistEntry(&key);
+            if (dictAdd(d,skey,NULL) != DICT_OK) {
+                sdsfree(skey);
+                continue;
+            }
+            added++;
+
+            /* We can reply right away, so that we don't need to store the value in the dict. */
+            if (withvalues && c->resp > 2)
+                addReplyArrayLen(c,2);
+            hashReplyFromZiplistEntry(c, &key);
+            if (withvalues)
+                hashReplyFromZiplistEntry(c, &value);
+        }
+
+        /* Release memory */
+        dictRelease(d);
+    }
+}
+
+/* HRANDFIELD key [<count> [WITHVALUES]] */
+void hrandfieldCommand(client *c) {
+    long l;
+    int withvalues = 0;
+    robj *hash;
+    ziplistEntry ele;
+
+    if (c->argc >= 3) {
+        if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
+        if (c->argc > 4 || (c->argc == 4 && strcasecmp(c->argv[3]->ptr,"withvalues"))) {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        } else if (c->argc == 4)
+            withvalues = 1;
+        hrandfieldWithCountCommand(c, l, withvalues);
+        return;
+    }
+
+    /* Handle variant without <count> argument. Reply with simple bulk string */
+    if ((hash = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))== NULL ||
+        checkType(c,hash,OBJ_HASH)) {
+        return;
+    }
+
+    hashTypeRandomElement(hash,hashTypeLength(hash),&ele,NULL);
+    hashReplyFromZiplistEntry(c, &ele);
+}
diff --git a/redis-stable/src/t_list.c b/redis-stable/src/t_list.c
new file mode 100644
index 00000000..66c9e3c9
--- /dev/null
+++ b/redis-stable/src/t_list.c
@@ -0,0 +1,1032 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+#define LIST_MAX_ITEM_SIZE ((1ull<<32)-1024)
+
+/*-----------------------------------------------------------------------------
+ * List API
+ *----------------------------------------------------------------------------*/
+
+/* The function pushes an element to the specified list object 'subject',
+ * at head or tail position as specified by 'where'.
+ *
+ * There is no need for the caller to increment the refcount of 'value' as
+ * the function takes care of it if needed. */
+void listTypePush(robj *subject, robj *value, int where) {
+    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
+        int pos = (where == LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL;
+        if (value->encoding == OBJ_ENCODING_INT) {
+            char buf[32];
+            ll2string(buf, 32, (long)value->ptr);
+            quicklistPush(subject->ptr, buf, strlen(buf), pos);
+        } else {
+            quicklistPush(subject->ptr, value->ptr, sdslen(value->ptr), pos);
+        }
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+void *listPopSaver(unsigned char *data, unsigned int sz) {
+    return createStringObject((char*)data,sz);
+}
+
+robj *listTypePop(robj *subject, int where) {
+    long long vlong;
+    robj *value = NULL;
+
+    int ql_where = where == LIST_HEAD ? QUICKLIST_HEAD : QUICKLIST_TAIL;
+    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
+        if (quicklistPopCustom(subject->ptr, ql_where, (unsigned char **)&value,
+                               NULL, &vlong, listPopSaver)) {
+            if (!value)
+                value = createStringObjectFromLongLong(vlong);
+        }
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+    return value;
+}
+
+unsigned long listTypeLength(const robj *subject) {
+    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
+        return quicklistCount(subject->ptr);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* Initialize an iterator at the specified index. */
+listTypeIterator *listTypeInitIterator(robj *subject, long index,
+                                       unsigned char direction) {
+    listTypeIterator *li = zmalloc(sizeof(listTypeIterator));
+    li->subject = subject;
+    li->encoding = subject->encoding;
+    li->direction = direction;
+    li->iter = NULL;
+    /* LIST_HEAD means start at TAIL and move *towards* head.
+     * LIST_TAIL means start at HEAD and move *towards tail. */
+    int iter_direction =
+        direction == LIST_HEAD ? AL_START_TAIL : AL_START_HEAD;
+    if (li->encoding == OBJ_ENCODING_QUICKLIST) {
+        li->iter = quicklistGetIteratorAtIdx(li->subject->ptr,
+                                             iter_direction, index);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+    return li;
+}
+
+/* Clean up the iterator. */
+void listTypeReleaseIterator(listTypeIterator *li) {
+    zfree(li->iter);
+    zfree(li);
+}
+
+/* Stores pointer to current the entry in the provided entry structure
+ * and advances the position of the iterator. Returns 1 when the current
+ * entry is in fact an entry, 0 otherwise. */
+int listTypeNext(listTypeIterator *li, listTypeEntry *entry) {
+    /* Protect from converting when iterating */
+    serverAssert(li->subject->encoding == li->encoding);
+
+    entry->li = li;
+    if (li->encoding == OBJ_ENCODING_QUICKLIST) {
+        return quicklistNext(li->iter, &entry->entry);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+    return 0;
+}
+
+/* Return entry or NULL at the current position of the iterator. */
+robj *listTypeGet(listTypeEntry *entry) {
+    robj *value = NULL;
+    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
+        if (entry->entry.value) {
+            value = createStringObject((char *)entry->entry.value,
+                                       entry->entry.sz);
+        } else {
+            value = createStringObjectFromLongLong(entry->entry.longval);
+        }
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+    return value;
+}
+
+void listTypeInsert(listTypeEntry *entry, robj *value, int where) {
+    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
+        value = getDecodedObject(value);
+        sds str = value->ptr;
+        size_t len = sdslen(str);
+        if (where == LIST_TAIL) {
+            quicklistInsertAfter((quicklist *)entry->entry.quicklist,
+                                 &entry->entry, str, len);
+        } else if (where == LIST_HEAD) {
+            quicklistInsertBefore((quicklist *)entry->entry.quicklist,
+                                  &entry->entry, str, len);
+        }
+        decrRefCount(value);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* Compare the given object with the entry at the current position. */
+int listTypeEqual(listTypeEntry *entry, robj *o) {
+    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
+        serverAssertWithInfo(NULL,o,sdsEncodedObject(o));
+        return quicklistCompare(entry->entry.zi,o->ptr,sdslen(o->ptr));
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* Delete the element pointed to. */
+void listTypeDelete(listTypeIterator *iter, listTypeEntry *entry) {
+    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklistDelEntry(iter->iter, &entry->entry);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* Create a quicklist from a single ziplist */
+void listTypeConvert(robj *subject, int enc) {
+    serverAssertWithInfo(NULL,subject,subject->type==OBJ_LIST);
+    serverAssertWithInfo(NULL,subject,subject->encoding==OBJ_ENCODING_ZIPLIST);
+
+    if (enc == OBJ_ENCODING_QUICKLIST) {
+        size_t zlen = server.list_max_ziplist_size;
+        int depth = server.list_compress_depth;
+        subject->ptr = quicklistCreateFromZiplist(zlen, depth, subject->ptr);
+        subject->encoding = OBJ_ENCODING_QUICKLIST;
+    } else {
+        serverPanic("Unsupported list conversion");
+    }
+}
+
+/* This is a helper function for the COPY command.
+ * Duplicate a list object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * The resulting object always has refcount set to 1 */
+robj *listTypeDup(robj *o) {
+    robj *lobj;
+
+    serverAssert(o->type == OBJ_LIST);
+
+    switch (o->encoding) {
+        case OBJ_ENCODING_QUICKLIST:
+            lobj = createObject(OBJ_LIST, quicklistDup(o->ptr));
+            lobj->encoding = OBJ_ENCODING_QUICKLIST;
+            break;
+        default:
+            serverPanic("Unknown list encoding");
+            break;
+    }
+    return lobj;
+}
+
+/*-----------------------------------------------------------------------------
+ * List Commands
+ *----------------------------------------------------------------------------*/
+
+/* Implements LPUSH/RPUSH/LPUSHX/RPUSHX. 
+ * 'xx': push if key exists. */
+void pushGenericCommand(client *c, int where, int xx) {
+    int j;
+
+    for (j = 2; j < c->argc; j++) {
+        if (sdslen(c->argv[j]->ptr) > LIST_MAX_ITEM_SIZE) {
+            addReplyError(c, "Element too large");
+            return;
+        }
+    }
+
+    robj *lobj = lookupKeyWrite(c->db, c->argv[1]);
+    if (checkType(c,lobj,OBJ_LIST)) return;
+    if (!lobj) {
+        if (xx) {
+            addReply(c, shared.czero);
+            return;
+        }
+
+        lobj = createQuicklistObject();
+        quicklistSetOptions(lobj->ptr, server.list_max_ziplist_size,
+                            server.list_compress_depth);
+        dbAdd(c->db,c->argv[1],lobj);
+    }
+
+    for (j = 2; j < c->argc; j++) {
+        listTypePush(lobj,c->argv[j],where);
+        server.dirty++;
+    }
+
+    addReplyLongLong(c, listTypeLength(lobj));
+
+    char *event = (where == LIST_HEAD) ? "lpush" : "rpush";
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_LIST,event,c->argv[1],c->db->id);
+}
+
+/* LPUSH <key> <element> [<element> ...] */
+void lpushCommand(client *c) {
+    pushGenericCommand(c,LIST_HEAD,0);
+}
+
+/* RPUSH <key> <element> [<element> ...] */
+void rpushCommand(client *c) {
+    pushGenericCommand(c,LIST_TAIL,0);
+}
+
+/* LPUSHX <key> <element> [<element> ...] */
+void lpushxCommand(client *c) {
+    pushGenericCommand(c,LIST_HEAD,1);
+}
+
+/* RPUSH <key> <element> [<element> ...] */
+void rpushxCommand(client *c) {
+    pushGenericCommand(c,LIST_TAIL,1);
+}
+
+/* LINSERT <key> (BEFORE|AFTER) <pivot> <element> */
+void linsertCommand(client *c) {
+    int where;
+    robj *subject;
+    listTypeIterator *iter;
+    listTypeEntry entry;
+    int inserted = 0;
+
+    if (strcasecmp(c->argv[2]->ptr,"after") == 0) {
+        where = LIST_TAIL;
+    } else if (strcasecmp(c->argv[2]->ptr,"before") == 0) {
+        where = LIST_HEAD;
+    } else {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    if (sdslen(c->argv[4]->ptr) > LIST_MAX_ITEM_SIZE) {
+        addReplyError(c, "Element too large");
+        return;
+    }
+
+    if ((subject = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,subject,OBJ_LIST)) return;
+
+    /* Seek pivot from head to tail */
+    iter = listTypeInitIterator(subject,0,LIST_TAIL);
+    while (listTypeNext(iter,&entry)) {
+        if (listTypeEqual(&entry,c->argv[3])) {
+            listTypeInsert(&entry,c->argv[4],where);
+            inserted = 1;
+            break;
+        }
+    }
+    listTypeReleaseIterator(iter);
+
+    if (inserted) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_LIST,"linsert",
+                            c->argv[1],c->db->id);
+        server.dirty++;
+    } else {
+        /* Notify client of a failed insert */
+        addReplyLongLong(c,-1);
+        return;
+    }
+
+    addReplyLongLong(c,listTypeLength(subject));
+}
+
+/* LLEN <key> */
+void llenCommand(client *c) {
+    robj *o = lookupKeyReadOrReply(c,c->argv[1],shared.czero);
+    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
+    addReplyLongLong(c,listTypeLength(o));
+}
+
+/* LINDEX <key> <index> */
+void lindexCommand(client *c) {
+    robj *o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]);
+    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
+    long index;
+
+    if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK))
+        return;
+
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklistEntry entry;
+        if (quicklistIndex(o->ptr, index, &entry)) {
+            if (entry.value) {
+                addReplyBulkCBuffer(c, entry.value, entry.sz);
+            } else {
+                addReplyBulkLongLong(c, entry.longval);
+            }
+        } else {
+            addReplyNull(c);
+        }
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* LSET <key> <index> <element> */
+void lsetCommand(client *c) {
+    robj *o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr);
+    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
+    long index;
+    robj *value = c->argv[3];
+
+    if (sdslen(value->ptr) > LIST_MAX_ITEM_SIZE) {
+        addReplyError(c, "Element too large");
+        return;
+    }
+
+    if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK))
+        return;
+
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklist *ql = o->ptr;
+        int replaced = quicklistReplaceAtIndex(ql, index,
+                                               value->ptr, sdslen(value->ptr));
+        if (!replaced) {
+            addReplyErrorObject(c,shared.outofrangeerr);
+        } else {
+            addReply(c,shared.ok);
+            signalModifiedKey(c,c->db,c->argv[1]);
+            notifyKeyspaceEvent(NOTIFY_LIST,"lset",c->argv[1],c->db->id);
+            server.dirty++;
+        }
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* A helper for replying with a list's range between the inclusive start and end
+ * indexes as multi-bulk, with support for negative indexes. Note that start
+ * must be less than end or an empty array is returned. When the reverse
+ * argument is set to a non-zero value, the reply is reversed so that elements
+ * are returned from end to start. */
+void addListRangeReply(client *c, robj *o, long start, long end, int reverse) {
+    long rangelen, llen = listTypeLength(o);
+
+    /* Convert negative indexes. */
+    if (start < 0) start = llen+start;
+    if (end < 0) end = llen+end;
+    if (start < 0) start = 0;
+
+    /* Invariant: start >= 0, so this test will be true when end < 0.
+     * The range is empty when start > end or start >= length. */
+    if (start > end || start >= llen) {
+        addReply(c,shared.emptyarray);
+        return;
+    }
+    if (end >= llen) end = llen-1;
+    rangelen = (end-start)+1;
+
+    /* Return the result in form of a multi-bulk reply */
+    addReplyArrayLen(c,rangelen);
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        int from = reverse ? end : start;
+        int direction = reverse ? LIST_HEAD : LIST_TAIL;
+        listTypeIterator *iter = listTypeInitIterator(o,from,direction);
+
+        while(rangelen--) {
+            listTypeEntry entry;
+            listTypeNext(iter, &entry);
+            quicklistEntry *qe = &entry.entry;
+            if (qe->value) {
+                addReplyBulkCBuffer(c,qe->value,qe->sz);
+            } else {
+                addReplyBulkLongLong(c,qe->longval);
+            }
+        }
+        listTypeReleaseIterator(iter);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+}
+
+/* A housekeeping helper for list elements popping tasks. */
+void listElementsRemoved(client *c, robj *key, int where, robj *o, long count) {
+    char *event = (where == LIST_HEAD) ? "lpop" : "rpop";
+
+    notifyKeyspaceEvent(NOTIFY_LIST, event, key, c->db->id);
+    if (listTypeLength(o) == 0) {
+        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", key, c->db->id);
+        dbDelete(c->db, key);
+    }
+    signalModifiedKey(c, c->db, key);
+    server.dirty += count;
+}
+
+/* Implements the generic list pop operation for LPOP/RPOP.
+ * The where argument specifies which end of the list is operated on. An
+ * optional count may be provided as the third argument of the client's
+ * command. */
+void popGenericCommand(client *c, int where) {
+    long count = 0;
+    robj *value;
+
+    if (c->argc > 3) {
+        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",
+                            c->cmd->name);
+        return;
+    } else if (c->argc == 3) {
+        /* Parse the optional count argument. */
+        if (getPositiveLongFromObjectOrReply(c,c->argv[2],&count,NULL) != C_OK) 
+            return;
+        if (count == 0) {
+            /* Fast exit path. */
+            addReplyNullArray(c);
+            return;
+        }
+    }
+
+    robj *o = lookupKeyWriteOrReply(c, c->argv[1], shared.null[c->resp]);
+    if (o == NULL || checkType(c, o, OBJ_LIST))
+        return;
+
+    if (!count) {
+        /* Pop a single element. This is POP's original behavior that replies
+         * with a bulk string. */
+        value = listTypePop(o,where);
+        serverAssert(value != NULL);
+        addReplyBulk(c,value);
+        decrRefCount(value);
+        listElementsRemoved(c,c->argv[1],where,o,1);
+    } else {
+        /* Pop a range of elements. An addition to the original POP command,
+         *  which replies with a multi-bulk. */
+        long llen = listTypeLength(o);
+        long rangelen = (count > llen) ? llen : count;
+        long rangestart = (where == LIST_HEAD) ? 0 : -rangelen;
+        long rangeend = (where == LIST_HEAD) ? rangelen - 1 : -1;
+        int reverse = (where == LIST_HEAD) ? 0 : 1;
+
+        addListRangeReply(c,o,rangestart,rangeend,reverse);
+        quicklistDelRange(o->ptr,rangestart,rangelen);
+        listElementsRemoved(c,c->argv[1],where,o,rangelen);
+    }
+}
+
+/* LPOP <key> [count] */
+void lpopCommand(client *c) {
+    popGenericCommand(c,LIST_HEAD);
+}
+
+/* RPOP <key> [count] */
+void rpopCommand(client *c) {
+    popGenericCommand(c,LIST_TAIL);
+}
+
+/* LRANGE <key> <start> <stop> */
+void lrangeCommand(client *c) {
+    robj *o;
+    long start, end;
+
+    if ((getLongFromObjectOrReply(c, c->argv[2], &start, NULL) != C_OK) ||
+        (getLongFromObjectOrReply(c, c->argv[3], &end, NULL) != C_OK)) return;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray)) == NULL
+         || checkType(c,o,OBJ_LIST)) return;
+
+    addListRangeReply(c,o,start,end,0);
+}
+
+/* LTRIM <key> <start> <stop> */
+void ltrimCommand(client *c) {
+    robj *o;
+    long start, end, llen, ltrim, rtrim;
+
+    if ((getLongFromObjectOrReply(c, c->argv[2], &start, NULL) != C_OK) ||
+        (getLongFromObjectOrReply(c, c->argv[3], &end, NULL) != C_OK)) return;
+
+    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.ok)) == NULL ||
+        checkType(c,o,OBJ_LIST)) return;
+    llen = listTypeLength(o);
+
+    /* convert negative indexes */
+    if (start < 0) start = llen+start;
+    if (end < 0) end = llen+end;
+    if (start < 0) start = 0;
+
+    /* Invariant: start >= 0, so this test will be true when end < 0.
+     * The range is empty when start > end or start >= length. */
+    if (start > end || start >= llen) {
+        /* Out of range start or start > end result in empty list */
+        ltrim = llen;
+        rtrim = 0;
+    } else {
+        if (end >= llen) end = llen-1;
+        ltrim = start;
+        rtrim = llen-end-1;
+    }
+
+    /* Remove list elements to perform the trim */
+    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
+        quicklistDelRange(o->ptr,0,ltrim);
+        quicklistDelRange(o->ptr,-rtrim,rtrim);
+    } else {
+        serverPanic("Unknown list encoding");
+    }
+
+    notifyKeyspaceEvent(NOTIFY_LIST,"ltrim",c->argv[1],c->db->id);
+    if (listTypeLength(o) == 0) {
+        dbDelete(c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
+    }
+    signalModifiedKey(c,c->db,c->argv[1]);
+    server.dirty += (ltrim + rtrim);
+    addReply(c,shared.ok);
+}
+
+/* LPOS key element [RANK rank] [COUNT num-matches] [MAXLEN len]
+ *
+ * The "rank" is the position of the match, so if it is 1, the first match
+ * is returned, if it is 2 the second match is returned and so forth.
+ * It is 1 by default. If negative has the same meaning but the search is
+ * performed starting from the end of the list.
+ *
+ * If COUNT is given, instead of returning the single element, a list of
+ * all the matching elements up to "num-matches" are returned. COUNT can
+ * be combiled with RANK in order to returning only the element starting
+ * from the Nth. If COUNT is zero, all the matching elements are returned.
+ *
+ * MAXLEN tells the command to scan a max of len elements. If zero (the
+ * default), all the elements in the list are scanned if needed.
+ *
+ * The returned elements indexes are always referring to what LINDEX
+ * would return. So first element from head is 0, and so forth. */
+void lposCommand(client *c) {
+    robj *o, *ele;
+    ele = c->argv[2];
+    int direction = LIST_TAIL;
+    long rank = 1, count = -1, maxlen = 0; /* Count -1: option not given. */
+
+    if (sdslen(ele->ptr) > LIST_MAX_ITEM_SIZE) {
+        addReplyError(c, "Element too large");
+        return;
+    }
+
+    /* Parse the optional arguments. */
+    for (int j = 3; j < c->argc; j++) {
+        char *opt = c->argv[j]->ptr;
+        int moreargs = (c->argc-1)-j;
+
+        if (!strcasecmp(opt,"RANK") && moreargs) {
+            j++;
+            if (getLongFromObjectOrReply(c, c->argv[j], &rank, NULL) != C_OK)
+                return;
+            if (rank == 0) {
+                addReplyError(c,"RANK can't be zero: use 1 to start from "
+                                "the first match, 2 from the second, ...");
+                return;
+            }
+        } else if (!strcasecmp(opt,"COUNT") && moreargs) {
+            j++;
+            if (getPositiveLongFromObjectOrReply(c, c->argv[j], &count,
+              "COUNT can't be negative") != C_OK)
+                return;
+        } else if (!strcasecmp(opt,"MAXLEN") && moreargs) {
+            j++;
+            if (getPositiveLongFromObjectOrReply(c, c->argv[j], &maxlen, 
+              "MAXLEN can't be negative") != C_OK)
+                return;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    /* A negative rank means start from the tail. */
+    if (rank < 0) {
+        rank = -rank;
+        direction = LIST_HEAD;
+    }
+
+    /* We return NULL or an empty array if there is no such key (or
+     * if we find no matches, depending on the presence of the COUNT option. */
+    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
+        if (count != -1)
+            addReply(c,shared.emptyarray);
+        else
+            addReply(c,shared.null[c->resp]);
+        return;
+    }
+    if (checkType(c,o,OBJ_LIST)) return;
+
+    /* If we got the COUNT option, prepare to emit an array. */
+    void *arraylenptr = NULL;
+    if (count != -1) arraylenptr = addReplyDeferredLen(c);
+
+    /* Seek the element. */
+    listTypeIterator *li;
+    li = listTypeInitIterator(o,direction == LIST_HEAD ? -1 : 0,direction);
+    listTypeEntry entry;
+    long llen = listTypeLength(o);
+    long index = 0, matches = 0, matchindex = -1, arraylen = 0;
+    while (listTypeNext(li,&entry) && (maxlen == 0 || index < maxlen)) {
+        if (listTypeEqual(&entry,ele)) {
+            matches++;
+            matchindex = (direction == LIST_TAIL) ? index : llen - index - 1;
+            if (matches >= rank) {
+                if (arraylenptr) {
+                    arraylen++;
+                    addReplyLongLong(c,matchindex);
+                    if (count && matches-rank+1 >= count) break;
+                } else {
+                    break;
+                }
+            }
+        }
+        index++;
+        matchindex = -1; /* Remember if we exit the loop without a match. */
+    }
+    listTypeReleaseIterator(li);
+
+    /* Reply to the client. Note that arraylenptr is not NULL only if
+     * the COUNT option was selected. */
+    if (arraylenptr != NULL) {
+        setDeferredArrayLen(c,arraylenptr,arraylen);
+    } else {
+        if (matchindex != -1)
+            addReplyLongLong(c,matchindex);
+        else
+            addReply(c,shared.null[c->resp]);
+    }
+}
+
+/* LREM <key> <count> <element> */
+void lremCommand(client *c) {
+    robj *subject, *obj;
+    obj = c->argv[3];
+    long toremove;
+    long removed = 0;
+
+    if (sdslen(obj->ptr) > LIST_MAX_ITEM_SIZE) {
+        addReplyError(c, "Element too large");
+        return;
+    }
+
+    if ((getLongFromObjectOrReply(c, c->argv[2], &toremove, NULL) != C_OK))
+        return;
+
+    subject = lookupKeyWriteOrReply(c,c->argv[1],shared.czero);
+    if (subject == NULL || checkType(c,subject,OBJ_LIST)) return;
+
+    listTypeIterator *li;
+    if (toremove < 0) {
+        toremove = -toremove;
+        li = listTypeInitIterator(subject,-1,LIST_HEAD);
+    } else {
+        li = listTypeInitIterator(subject,0,LIST_TAIL);
+    }
+
+    listTypeEntry entry;
+    while (listTypeNext(li,&entry)) {
+        if (listTypeEqual(&entry,obj)) {
+            listTypeDelete(li, &entry);
+            server.dirty++;
+            removed++;
+            if (toremove && removed == toremove) break;
+        }
+    }
+    listTypeReleaseIterator(li);
+
+    if (removed) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_LIST,"lrem",c->argv[1],c->db->id);
+    }
+
+    if (listTypeLength(subject) == 0) {
+        dbDelete(c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
+    }
+
+    addReplyLongLong(c,removed);
+}
+
+void lmoveHandlePush(client *c, robj *dstkey, robj *dstobj, robj *value,
+                     int where) {
+    /* Create the list if the key does not exist */
+    if (!dstobj) {
+        dstobj = createQuicklistObject();
+        quicklistSetOptions(dstobj->ptr, server.list_max_ziplist_size,
+                            server.list_compress_depth);
+        dbAdd(c->db,dstkey,dstobj);
+    }
+    signalModifiedKey(c,c->db,dstkey);
+    listTypePush(dstobj,value,where);
+    notifyKeyspaceEvent(NOTIFY_LIST,
+                        where == LIST_HEAD ? "lpush" : "rpush",
+                        dstkey,
+                        c->db->id);
+    /* Always send the pushed value to the client. */
+    addReplyBulk(c,value);
+}
+
+int getListPositionFromObjectOrReply(client *c, robj *arg, int *position) {
+    if (strcasecmp(arg->ptr,"right") == 0) {
+        *position = LIST_TAIL;
+    } else if (strcasecmp(arg->ptr,"left") == 0) {
+        *position = LIST_HEAD;
+    } else {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+robj *getStringObjectFromListPosition(int position) {
+    if (position == LIST_HEAD) {
+        return shared.left;
+    } else {
+        // LIST_TAIL
+        return shared.right;
+    }
+}
+
+void lmoveGenericCommand(client *c, int wherefrom, int whereto) {
+    robj *sobj, *value;
+    if ((sobj = lookupKeyWriteOrReply(c,c->argv[1],shared.null[c->resp]))
+        == NULL || checkType(c,sobj,OBJ_LIST)) return;
+
+    if (listTypeLength(sobj) == 0) {
+        /* This may only happen after loading very old RDB files. Recent
+         * versions of Redis delete keys of empty lists. */
+        addReplyNull(c);
+    } else {
+        robj *dobj = lookupKeyWrite(c->db,c->argv[2]);
+        robj *touchedkey = c->argv[1];
+
+        if (checkType(c,dobj,OBJ_LIST)) return;
+        value = listTypePop(sobj,wherefrom);
+        serverAssert(value); /* assertion for valgrind (avoid NPD) */
+        lmoveHandlePush(c,c->argv[2],dobj,value,whereto);
+
+        /* listTypePop returns an object with its refcount incremented */
+        decrRefCount(value);
+
+        /* Delete the source list when it is empty */
+        notifyKeyspaceEvent(NOTIFY_LIST,
+                            wherefrom == LIST_HEAD ? "lpop" : "rpop",
+                            touchedkey,
+                            c->db->id);
+        if (listTypeLength(sobj) == 0) {
+            dbDelete(c->db,touchedkey);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",
+                                touchedkey,c->db->id);
+        }
+        signalModifiedKey(c,c->db,touchedkey);
+        server.dirty++;
+        if (c->cmd->proc == blmoveCommand) {
+            rewriteClientCommandVector(c,5,shared.lmove,
+                                       c->argv[1],c->argv[2],c->argv[3],c->argv[4]);
+        } else if (c->cmd->proc == brpoplpushCommand) {
+            rewriteClientCommandVector(c,3,shared.rpoplpush,
+                                       c->argv[1],c->argv[2]);
+        }
+    }
+}
+
+/* LMOVE <source> <destination> (LEFT|RIGHT) (LEFT|RIGHT) */
+void lmoveCommand(client *c) {
+    int wherefrom, whereto;
+    if (getListPositionFromObjectOrReply(c,c->argv[3],&wherefrom)
+        != C_OK) return;
+    if (getListPositionFromObjectOrReply(c,c->argv[4],&whereto)
+        != C_OK) return;
+    lmoveGenericCommand(c, wherefrom, whereto);
+}
+
+/* This is the semantic of this command:
+ *  RPOPLPUSH srclist dstlist:
+ *    IF LLEN(srclist) > 0
+ *      element = RPOP srclist
+ *      LPUSH dstlist element
+ *      RETURN element
+ *    ELSE
+ *      RETURN nil
+ *    END
+ *  END
+ *
+ * The idea is to be able to get an element from a list in a reliable way
+ * since the element is not just returned but pushed against another list
+ * as well. This command was originally proposed by Ezra Zygmuntowicz.
+ */
+void rpoplpushCommand(client *c) {
+    lmoveGenericCommand(c, LIST_TAIL, LIST_HEAD);
+}
+
+/*-----------------------------------------------------------------------------
+ * Blocking POP operations
+ *----------------------------------------------------------------------------*/
+
+/* This is a helper function for handleClientsBlockedOnKeys(). Its work
+ * is to serve a specific client (receiver) that is blocked on 'key'
+ * in the context of the specified 'db', doing the following:
+ *
+ * 1) Provide the client with the 'value' element.
+ * 2) If the dstkey is not NULL (we are serving a BLMOVE) also push the
+ *    'value' element on the destination list (the "push" side of the command).
+ * 3) Propagate the resulting BRPOP, BLPOP and additional xPUSH if any into
+ *    the AOF and replication channel.
+ *
+ * The argument 'wherefrom' is LIST_TAIL or LIST_HEAD, and indicates if the
+ * 'value' element was popped from the head (BLPOP) or tail (BRPOP) so that
+ * we can propagate the command properly.
+ *
+ * The argument 'whereto' is LIST_TAIL or LIST_HEAD, and indicates if the
+ * 'value' element is to be pushed to the head or tail so that we can
+ * propagate the command properly.
+ *
+ * The function returns C_OK if we are able to serve the client, otherwise
+ * C_ERR is returned to signal the caller that the list POP operation
+ * should be undone as the client was not served: This only happens for
+ * BLMOVE that fails to push the value to the destination key as it is
+ * of the wrong type. */
+int serveClientBlockedOnList(client *receiver, robj *key, robj *dstkey, redisDb *db, robj *value, int wherefrom, int whereto)
+{
+    robj *argv[5];
+
+    if (dstkey == NULL) {
+        /* Propagate the [LR]POP operation. */
+        argv[0] = (wherefrom == LIST_HEAD) ? shared.lpop :
+                                             shared.rpop;
+        argv[1] = key;
+        propagate((wherefrom == LIST_HEAD) ?
+            server.lpopCommand : server.rpopCommand,
+            db->id,argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
+
+        /* BRPOP/BLPOP */
+        addReplyArrayLen(receiver,2);
+        addReplyBulk(receiver,key);
+        addReplyBulk(receiver,value);
+
+        /* Notify event. */
+        char *event = (wherefrom == LIST_HEAD) ? "lpop" : "rpop";
+        notifyKeyspaceEvent(NOTIFY_LIST,event,key,receiver->db->id);
+    } else {
+        /* BLMOVE */
+        robj *dstobj =
+            lookupKeyWrite(receiver->db,dstkey);
+        if (!(dstobj &&
+             checkType(receiver,dstobj,OBJ_LIST)))
+        {
+            lmoveHandlePush(receiver,dstkey,dstobj,value,whereto);
+            /* Propagate the LMOVE/RPOPLPUSH operation. */
+            int isbrpoplpush = (receiver->lastcmd->proc == brpoplpushCommand);
+            argv[0] = isbrpoplpush ? shared.rpoplpush : shared.lmove;
+            argv[1] = key;
+            argv[2] = dstkey;
+            argv[3] = getStringObjectFromListPosition(wherefrom);
+            argv[4] = getStringObjectFromListPosition(whereto);
+            propagate(isbrpoplpush ? server.rpoplpushCommand : server.lmoveCommand,
+                db->id,argv,(isbrpoplpush ? 3 : 5),
+                PROPAGATE_AOF|
+                PROPAGATE_REPL);
+
+            /* Notify event ("lpush" or "rpush" was notified by lmoveHandlePush). */
+            notifyKeyspaceEvent(NOTIFY_LIST,wherefrom == LIST_TAIL ? "rpop" : "lpop",
+                                key,receiver->db->id);
+        } else {
+            /* BLMOVE failed because of wrong
+             * destination type. */
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* Blocking RPOP/LPOP */
+void blockingPopGenericCommand(client *c, int where) {
+    robj *o;
+    mstime_t timeout;
+    int j;
+
+    if (getTimeoutFromObjectOrReply(c,c->argv[c->argc-1],&timeout,UNIT_SECONDS)
+        != C_OK) return;
+
+    for (j = 1; j < c->argc-1; j++) {
+        o = lookupKeyWrite(c->db,c->argv[j]);
+        if (o != NULL) {
+            if (checkType(c,o,OBJ_LIST)) {
+                return;
+            } else {
+                if (listTypeLength(o) != 0) {
+                    /* Non empty list, this is like a normal [LR]POP. */
+                    robj *value = listTypePop(o,where);
+                    serverAssert(value != NULL);
+
+                    addReplyArrayLen(c,2);
+                    addReplyBulk(c,c->argv[j]);
+                    addReplyBulk(c,value);
+                    decrRefCount(value);
+                    listElementsRemoved(c,c->argv[j],where,o,1);
+
+                    /* Replicate it as an [LR]POP instead of B[LR]POP. */
+                    rewriteClientCommandVector(c,2,
+                        (where == LIST_HEAD) ? shared.lpop : shared.rpop,
+                        c->argv[j]);
+                    return;
+                }
+            }
+        }
+    }
+
+    /* If we are not allowed to block the client, the only thing
+     * we can do is treating it as a timeout (even with timeout 0). */
+    if (c->flags & CLIENT_DENY_BLOCKING) {
+        addReplyNullArray(c);
+        return;
+    }
+
+    /* If the keys do not exist we must block */
+    struct listPos pos = {where};
+    blockForKeys(c,BLOCKED_LIST,c->argv + 1,c->argc - 2,timeout,NULL,&pos,NULL);
+}
+
+/* BLPOP <key> [<key> ...] <timeout> */
+void blpopCommand(client *c) {
+    blockingPopGenericCommand(c,LIST_HEAD);
+}
+
+/* BLPOP <key> [<key> ...] <timeout> */
+void brpopCommand(client *c) {
+    blockingPopGenericCommand(c,LIST_TAIL);
+}
+
+void blmoveGenericCommand(client *c, int wherefrom, int whereto, mstime_t timeout) {
+    robj *key = lookupKeyWrite(c->db, c->argv[1]);
+    if (checkType(c,key,OBJ_LIST)) return;
+
+    if (key == NULL) {
+        if (c->flags & CLIENT_DENY_BLOCKING) {
+            /* Blocking against an empty list when blocking is not allowed
+             * returns immediately. */
+            addReplyNull(c);
+        } else {
+            /* The list is empty and the client blocks. */
+            struct listPos pos = {wherefrom, whereto};
+            blockForKeys(c,BLOCKED_LIST,c->argv + 1,1,timeout,c->argv[2],&pos,NULL);
+        }
+    } else {
+        /* The list exists and has elements, so
+         * the regular lmoveCommand is executed. */
+        serverAssertWithInfo(c,key,listTypeLength(key) > 0);
+        lmoveGenericCommand(c,wherefrom,whereto);
+    }
+}
+
+/* BLMOVE <source> <destination> (LEFT|RIGHT) (LEFT|RIGHT) <timeout> */
+void blmoveCommand(client *c) {
+    mstime_t timeout;
+    int wherefrom, whereto;
+    if (getListPositionFromObjectOrReply(c,c->argv[3],&wherefrom)
+        != C_OK) return;
+    if (getListPositionFromObjectOrReply(c,c->argv[4],&whereto)
+        != C_OK) return;
+    if (getTimeoutFromObjectOrReply(c,c->argv[5],&timeout,UNIT_SECONDS)
+        != C_OK) return;
+    blmoveGenericCommand(c,wherefrom,whereto,timeout);
+}
+
+/* BRPOPLPUSH <source> <destination> <timeout> */
+void brpoplpushCommand(client *c) {
+    mstime_t timeout;
+    if (getTimeoutFromObjectOrReply(c,c->argv[3],&timeout,UNIT_SECONDS)
+        != C_OK) return;
+    blmoveGenericCommand(c, LIST_TAIL, LIST_HEAD, timeout);
+}
diff --git a/redis-stable/src/t_set.c b/redis-stable/src/t_set.c
new file mode 100644
index 00000000..a4fc5311
--- /dev/null
+++ b/redis-stable/src/t_set.c
@@ -0,0 +1,1196 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/*-----------------------------------------------------------------------------
+ * Set Commands
+ *----------------------------------------------------------------------------*/
+
+void sunionDiffGenericCommand(client *c, robj **setkeys, int setnum,
+                              robj *dstkey, int op);
+
+/* Factory method to return a set that *can* hold "value". When the object has
+ * an integer-encodable value, an intset will be returned. Otherwise a regular
+ * hash table. */
+robj *setTypeCreate(sds value) {
+    if (isSdsRepresentableAsLongLong(value,NULL) == C_OK)
+        return createIntsetObject();
+    return createSetObject();
+}
+
+/* Add the specified value into a set.
+ *
+ * If the value was already member of the set, nothing is done and 0 is
+ * returned, otherwise the new element is added and 1 is returned. */
+int setTypeAdd(robj *subject, sds value) {
+    long long llval;
+    if (subject->encoding == OBJ_ENCODING_HT) {
+        dict *ht = subject->ptr;
+        dictEntry *de = dictAddRaw(ht,value,NULL);
+        if (de) {
+            dictSetKey(ht,de,sdsdup(value));
+            dictSetVal(ht,de,NULL);
+            return 1;
+        }
+    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
+        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
+            uint8_t success = 0;
+            subject->ptr = intsetAdd(subject->ptr,llval,&success);
+            if (success) {
+                /* Convert to regular set when the intset contains
+                 * too many entries. */
+                size_t max_entries = server.set_max_intset_entries;
+                /* limit to 1G entries due to intset internals. */
+                if (max_entries >= 1<<30) max_entries = 1<<30;
+                if (intsetLen(subject->ptr) > max_entries)
+                    setTypeConvert(subject,OBJ_ENCODING_HT);
+                return 1;
+            }
+        } else {
+            /* Failed to get integer from object, convert to regular set. */
+            setTypeConvert(subject,OBJ_ENCODING_HT);
+
+            /* The set *was* an intset and this value is not integer
+             * encodable, so dictAdd should always work. */
+            serverAssert(dictAdd(subject->ptr,sdsdup(value),NULL) == DICT_OK);
+            return 1;
+        }
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return 0;
+}
+
+int setTypeRemove(robj *setobj, sds value) {
+    long long llval;
+    if (setobj->encoding == OBJ_ENCODING_HT) {
+        if (dictDelete(setobj->ptr,value) == DICT_OK) {
+            if (htNeedsResize(setobj->ptr)) dictResize(setobj->ptr);
+            return 1;
+        }
+    } else if (setobj->encoding == OBJ_ENCODING_INTSET) {
+        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
+            int success;
+            setobj->ptr = intsetRemove(setobj->ptr,llval,&success);
+            if (success) return 1;
+        }
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return 0;
+}
+
+int setTypeIsMember(robj *subject, sds value) {
+    long long llval;
+    if (subject->encoding == OBJ_ENCODING_HT) {
+        return dictFind((dict*)subject->ptr,value) != NULL;
+    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
+        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
+            return intsetFind((intset*)subject->ptr,llval);
+        }
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return 0;
+}
+
+setTypeIterator *setTypeInitIterator(robj *subject) {
+    setTypeIterator *si = zmalloc(sizeof(setTypeIterator));
+    si->subject = subject;
+    si->encoding = subject->encoding;
+    if (si->encoding == OBJ_ENCODING_HT) {
+        si->di = dictGetIterator(subject->ptr);
+    } else if (si->encoding == OBJ_ENCODING_INTSET) {
+        si->ii = 0;
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return si;
+}
+
+void setTypeReleaseIterator(setTypeIterator *si) {
+    if (si->encoding == OBJ_ENCODING_HT)
+        dictReleaseIterator(si->di);
+    zfree(si);
+}
+
+/* Move to the next entry in the set. Returns the object at the current
+ * position.
+ *
+ * Since set elements can be internally be stored as SDS strings or
+ * simple arrays of integers, setTypeNext returns the encoding of the
+ * set object you are iterating, and will populate the appropriate pointer
+ * (sdsele) or (llele) accordingly.
+ *
+ * Note that both the sdsele and llele pointers should be passed and cannot
+ * be NULL since the function will try to defensively populate the non
+ * used field with values which are easy to trap if misused.
+ *
+ * When there are no longer elements -1 is returned. */
+int setTypeNext(setTypeIterator *si, sds *sdsele, int64_t *llele) {
+    if (si->encoding == OBJ_ENCODING_HT) {
+        dictEntry *de = dictNext(si->di);
+        if (de == NULL) return -1;
+        *sdsele = dictGetKey(de);
+        *llele = -123456789; /* Not needed. Defensive. */
+    } else if (si->encoding == OBJ_ENCODING_INTSET) {
+        if (!intsetGet(si->subject->ptr,si->ii++,llele))
+            return -1;
+        *sdsele = NULL; /* Not needed. Defensive. */
+    } else {
+        serverPanic("Wrong set encoding in setTypeNext");
+    }
+    return si->encoding;
+}
+
+/* The not copy on write friendly version but easy to use version
+ * of setTypeNext() is setTypeNextObject(), returning new SDS
+ * strings. So if you don't retain a pointer to this object you should call
+ * sdsfree() against it.
+ *
+ * This function is the way to go for write operations where COW is not
+ * an issue. */
+sds setTypeNextObject(setTypeIterator *si) {
+    int64_t intele;
+    sds sdsele;
+    int encoding;
+
+    encoding = setTypeNext(si,&sdsele,&intele);
+    switch(encoding) {
+        case -1:    return NULL;
+        case OBJ_ENCODING_INTSET:
+            return sdsfromlonglong(intele);
+        case OBJ_ENCODING_HT:
+            return sdsdup(sdsele);
+        default:
+            serverPanic("Unsupported encoding");
+    }
+    return NULL; /* just to suppress warnings */
+}
+
+/* Return random element from a non empty set.
+ * The returned element can be an int64_t value if the set is encoded
+ * as an "intset" blob of integers, or an SDS string if the set
+ * is a regular set.
+ *
+ * The caller provides both pointers to be populated with the right
+ * object. The return value of the function is the object->encoding
+ * field of the object and is used by the caller to check if the
+ * int64_t pointer or the redis object pointer was populated.
+ *
+ * Note that both the sdsele and llele pointers should be passed and cannot
+ * be NULL since the function will try to defensively populate the non
+ * used field with values which are easy to trap if misused. */
+int setTypeRandomElement(robj *setobj, sds *sdsele, int64_t *llele) {
+    if (setobj->encoding == OBJ_ENCODING_HT) {
+        dictEntry *de = dictGetFairRandomKey(setobj->ptr);
+        *sdsele = dictGetKey(de);
+        *llele = -123456789; /* Not needed. Defensive. */
+    } else if (setobj->encoding == OBJ_ENCODING_INTSET) {
+        *llele = intsetRandom(setobj->ptr);
+        *sdsele = NULL; /* Not needed. Defensive. */
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return setobj->encoding;
+}
+
+unsigned long setTypeSize(const robj *subject) {
+    if (subject->encoding == OBJ_ENCODING_HT) {
+        return dictSize((const dict*)subject->ptr);
+    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
+        return intsetLen((const intset*)subject->ptr);
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+}
+
+/* Convert the set to specified encoding. The resulting dict (when converting
+ * to a hash table) is presized to hold the number of elements in the original
+ * set. */
+void setTypeConvert(robj *setobj, int enc) {
+    setTypeIterator *si;
+    serverAssertWithInfo(NULL,setobj,setobj->type == OBJ_SET &&
+                             setobj->encoding == OBJ_ENCODING_INTSET);
+
+    if (enc == OBJ_ENCODING_HT) {
+        int64_t intele;
+        dict *d = dictCreate(&setDictType,NULL);
+        sds element;
+
+        /* Presize the dict to avoid rehashing */
+        dictExpand(d,intsetLen(setobj->ptr));
+
+        /* To add the elements we extract integers and create redis objects */
+        si = setTypeInitIterator(setobj);
+        while (setTypeNext(si,&element,&intele) != -1) {
+            element = sdsfromlonglong(intele);
+            serverAssert(dictAdd(d,element,NULL) == DICT_OK);
+        }
+        setTypeReleaseIterator(si);
+
+        setobj->encoding = OBJ_ENCODING_HT;
+        zfree(setobj->ptr);
+        setobj->ptr = d;
+    } else {
+        serverPanic("Unsupported set conversion");
+    }
+}
+
+/* This is a helper function for the COPY command.
+ * Duplicate a set object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * The resulting object always has refcount set to 1 */
+robj *setTypeDup(robj *o) {
+    robj *set;
+    setTypeIterator *si;
+    sds elesds;
+    int64_t intobj;
+
+    serverAssert(o->type == OBJ_SET);
+
+    /* Create a new set object that have the same encoding as the original object's encoding */
+    if (o->encoding == OBJ_ENCODING_INTSET) {
+        intset *is = o->ptr;
+        size_t size = intsetBlobLen(is);
+        intset *newis = zmalloc(size);
+        memcpy(newis,is,size);
+        set = createObject(OBJ_SET, newis);
+        set->encoding = OBJ_ENCODING_INTSET;
+    } else if (o->encoding == OBJ_ENCODING_HT) {
+        set = createSetObject();
+        dict *d = o->ptr;
+        dictExpand(set->ptr, dictSize(d));
+        si = setTypeInitIterator(o);
+        while (setTypeNext(si, &elesds, &intobj) != -1) {
+            setTypeAdd(set, elesds);
+        }
+        setTypeReleaseIterator(si);
+    } else {
+        serverPanic("Unknown set encoding");
+    }
+    return set;
+}
+
+void saddCommand(client *c) {
+    robj *set;
+    int j, added = 0;
+
+    set = lookupKeyWrite(c->db,c->argv[1]);
+    if (checkType(c,set,OBJ_SET)) return;
+    
+    if (set == NULL) {
+        set = setTypeCreate(c->argv[2]->ptr);
+        dbAdd(c->db,c->argv[1],set);
+    }
+
+    for (j = 2; j < c->argc; j++) {
+        if (setTypeAdd(set,c->argv[j]->ptr)) added++;
+    }
+    if (added) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_SET,"sadd",c->argv[1],c->db->id);
+    }
+    server.dirty += added;
+    addReplyLongLong(c,added);
+}
+
+void sremCommand(client *c) {
+    robj *set;
+    int j, deleted = 0, keyremoved = 0;
+
+    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,set,OBJ_SET)) return;
+
+    for (j = 2; j < c->argc; j++) {
+        if (setTypeRemove(set,c->argv[j]->ptr)) {
+            deleted++;
+            if (setTypeSize(set) == 0) {
+                dbDelete(c->db,c->argv[1]);
+                keyremoved = 1;
+                break;
+            }
+        }
+    }
+    if (deleted) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_SET,"srem",c->argv[1],c->db->id);
+        if (keyremoved)
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],
+                                c->db->id);
+        server.dirty += deleted;
+    }
+    addReplyLongLong(c,deleted);
+}
+
+void smoveCommand(client *c) {
+    robj *srcset, *dstset, *ele;
+    srcset = lookupKeyWrite(c->db,c->argv[1]);
+    dstset = lookupKeyWrite(c->db,c->argv[2]);
+    ele = c->argv[3];
+
+    /* If the source key does not exist return 0 */
+    if (srcset == NULL) {
+        addReply(c,shared.czero);
+        return;
+    }
+
+    /* If the source key has the wrong type, or the destination key
+     * is set and has the wrong type, return with an error. */
+    if (checkType(c,srcset,OBJ_SET) ||
+        checkType(c,dstset,OBJ_SET)) return;
+
+    /* If srcset and dstset are equal, SMOVE is a no-op */
+    if (srcset == dstset) {
+        addReply(c,setTypeIsMember(srcset,ele->ptr) ?
+            shared.cone : shared.czero);
+        return;
+    }
+
+    /* If the element cannot be removed from the src set, return 0. */
+    if (!setTypeRemove(srcset,ele->ptr)) {
+        addReply(c,shared.czero);
+        return;
+    }
+    notifyKeyspaceEvent(NOTIFY_SET,"srem",c->argv[1],c->db->id);
+
+    /* Remove the src set from the database when empty */
+    if (setTypeSize(srcset) == 0) {
+        dbDelete(c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
+    }
+
+    /* Create the destination set when it doesn't exist */
+    if (!dstset) {
+        dstset = setTypeCreate(ele->ptr);
+        dbAdd(c->db,c->argv[2],dstset);
+    }
+
+    signalModifiedKey(c,c->db,c->argv[1]);
+    server.dirty++;
+
+    /* An extra key has changed when ele was successfully added to dstset */
+    if (setTypeAdd(dstset,ele->ptr)) {
+        server.dirty++;
+        signalModifiedKey(c,c->db,c->argv[2]);
+        notifyKeyspaceEvent(NOTIFY_SET,"sadd",c->argv[2],c->db->id);
+    }
+    addReply(c,shared.cone);
+}
+
+void sismemberCommand(client *c) {
+    robj *set;
+
+    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,set,OBJ_SET)) return;
+
+    if (setTypeIsMember(set,c->argv[2]->ptr))
+        addReply(c,shared.cone);
+    else
+        addReply(c,shared.czero);
+}
+
+void smismemberCommand(client *c) {
+    robj *set;
+    int j;
+
+    /* Don't abort when the key cannot be found. Non-existing keys are empty
+     * sets, where SMISMEMBER should respond with a series of zeros. */
+    set = lookupKeyRead(c->db,c->argv[1]);
+    if (set && checkType(c,set,OBJ_SET)) return;
+
+    addReplyArrayLen(c,c->argc - 2);
+
+    for (j = 2; j < c->argc; j++) {
+        if (set && setTypeIsMember(set,c->argv[j]->ptr))
+            addReply(c,shared.cone);
+        else
+            addReply(c,shared.czero);
+    }
+}
+
+void scardCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_SET)) return;
+
+    addReplyLongLong(c,setTypeSize(o));
+}
+
+/* Handle the "SPOP key <count>" variant. The normal version of the
+ * command is handled by the spopCommand() function itself. */
+
+/* How many times bigger should be the set compared to the remaining size
+ * for us to use the "create new set" strategy? Read later in the
+ * implementation for more info. */
+#define SPOP_MOVE_STRATEGY_MUL 5
+
+void spopWithCountCommand(client *c) {
+    long l;
+    unsigned long count, size;
+    robj *set;
+
+    /* Get the count argument */
+    if (getPositiveLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
+    count = (unsigned long) l;
+
+    /* Make sure a key with the name inputted exists, and that it's type is
+     * indeed a set. Otherwise, return nil */
+    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.emptyset[c->resp]))
+        == NULL || checkType(c,set,OBJ_SET)) return;
+
+    /* If count is zero, serve an empty set ASAP to avoid special
+     * cases later. */
+    if (count == 0) {
+        addReply(c,shared.emptyset[c->resp]);
+        return;
+    }
+
+    size = setTypeSize(set);
+
+    /* Generate an SPOP keyspace notification */
+    notifyKeyspaceEvent(NOTIFY_SET,"spop",c->argv[1],c->db->id);
+    server.dirty += (count >= size) ? size : count;
+
+    /* CASE 1:
+     * The number of requested elements is greater than or equal to
+     * the number of elements inside the set: simply return the whole set. */
+    if (count >= size) {
+        /* We just return the entire set */
+        sunionDiffGenericCommand(c,c->argv+1,1,NULL,SET_OP_UNION);
+
+        /* Delete the set as it is now empty */
+        dbDelete(c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
+
+        /* Propagate this command as a DEL operation */
+        rewriteClientCommandVector(c,2,shared.del,c->argv[1]);
+        signalModifiedKey(c,c->db,c->argv[1]);
+        return;
+    }
+
+    /* Case 2 and 3 require to replicate SPOP as a set of SREM commands.
+     * Prepare our replication argument vector. Also send the array length
+     * which is common to both the code paths. */
+    robj *propargv[3];
+    propargv[0] = shared.srem;
+    propargv[1] = c->argv[1];
+    addReplySetLen(c,count);
+
+    /* Common iteration vars. */
+    sds sdsele;
+    robj *objele;
+    int encoding;
+    int64_t llele;
+    unsigned long remaining = size-count; /* Elements left after SPOP. */
+
+    /* If we are here, the number of requested elements is less than the
+     * number of elements inside the set. Also we are sure that count < size.
+     * Use two different strategies.
+     *
+     * CASE 2: The number of elements to return is small compared to the
+     * set size. We can just extract random elements and return them to
+     * the set. */
+    if (remaining*SPOP_MOVE_STRATEGY_MUL > count) {
+        while(count--) {
+            /* Emit and remove. */
+            encoding = setTypeRandomElement(set,&sdsele,&llele);
+            if (encoding == OBJ_ENCODING_INTSET) {
+                addReplyBulkLongLong(c,llele);
+                objele = createStringObjectFromLongLong(llele);
+                set->ptr = intsetRemove(set->ptr,llele,NULL);
+            } else {
+                addReplyBulkCBuffer(c,sdsele,sdslen(sdsele));
+                objele = createStringObject(sdsele,sdslen(sdsele));
+                setTypeRemove(set,sdsele);
+            }
+
+            /* Replicate/AOF this command as an SREM operation */
+            propargv[2] = objele;
+            alsoPropagate(server.sremCommand,c->db->id,propargv,3,
+                PROPAGATE_AOF|PROPAGATE_REPL);
+            decrRefCount(objele);
+        }
+    } else {
+    /* CASE 3: The number of elements to return is very big, approaching
+     * the size of the set itself. After some time extracting random elements
+     * from such a set becomes computationally expensive, so we use
+     * a different strategy, we extract random elements that we don't
+     * want to return (the elements that will remain part of the set),
+     * creating a new set as we do this (that will be stored as the original
+     * set). Then we return the elements left in the original set and
+     * release it. */
+        robj *newset = NULL;
+
+        /* Create a new set with just the remaining elements. */
+        while(remaining--) {
+            encoding = setTypeRandomElement(set,&sdsele,&llele);
+            if (encoding == OBJ_ENCODING_INTSET) {
+                sdsele = sdsfromlonglong(llele);
+            } else {
+                sdsele = sdsdup(sdsele);
+            }
+            if (!newset) newset = setTypeCreate(sdsele);
+            setTypeAdd(newset,sdsele);
+            setTypeRemove(set,sdsele);
+            sdsfree(sdsele);
+        }
+
+        /* Transfer the old set to the client. */
+        setTypeIterator *si;
+        si = setTypeInitIterator(set);
+        while((encoding = setTypeNext(si,&sdsele,&llele)) != -1) {
+            if (encoding == OBJ_ENCODING_INTSET) {
+                addReplyBulkLongLong(c,llele);
+                objele = createStringObjectFromLongLong(llele);
+            } else {
+                addReplyBulkCBuffer(c,sdsele,sdslen(sdsele));
+                objele = createStringObject(sdsele,sdslen(sdsele));
+            }
+
+            /* Replicate/AOF this command as an SREM operation */
+            propargv[2] = objele;
+            alsoPropagate(server.sremCommand,c->db->id,propargv,3,
+                PROPAGATE_AOF|PROPAGATE_REPL);
+            decrRefCount(objele);
+        }
+        setTypeReleaseIterator(si);
+
+        /* Assign the new set as the key value. */
+        dbOverwrite(c->db,c->argv[1],newset);
+    }
+
+    /* Don't propagate the command itself even if we incremented the
+     * dirty counter. We don't want to propagate an SPOP command since
+     * we propagated the command as a set of SREMs operations using
+     * the alsoPropagate() API. */
+    preventCommandPropagation(c);
+    signalModifiedKey(c,c->db,c->argv[1]);
+}
+
+void spopCommand(client *c) {
+    robj *set, *ele;
+    sds sdsele;
+    int64_t llele;
+    int encoding;
+
+    if (c->argc == 3) {
+        spopWithCountCommand(c);
+        return;
+    } else if (c->argc > 3) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Make sure a key with the name inputted exists, and that it's type is
+     * indeed a set */
+    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.null[c->resp]))
+         == NULL || checkType(c,set,OBJ_SET)) return;
+
+    /* Get a random element from the set */
+    encoding = setTypeRandomElement(set,&sdsele,&llele);
+
+    /* Remove the element from the set */
+    if (encoding == OBJ_ENCODING_INTSET) {
+        ele = createStringObjectFromLongLong(llele);
+        set->ptr = intsetRemove(set->ptr,llele,NULL);
+    } else {
+        ele = createStringObject(sdsele,sdslen(sdsele));
+        setTypeRemove(set,ele->ptr);
+    }
+
+    notifyKeyspaceEvent(NOTIFY_SET,"spop",c->argv[1],c->db->id);
+
+    /* Replicate/AOF this command as an SREM operation */
+    rewriteClientCommandVector(c,3,shared.srem,c->argv[1],ele);
+
+    /* Add the element to the reply */
+    addReplyBulk(c,ele);
+    decrRefCount(ele);
+
+    /* Delete the set if it's empty */
+    if (setTypeSize(set) == 0) {
+        dbDelete(c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
+    }
+
+    /* Set has been modified */
+    signalModifiedKey(c,c->db,c->argv[1]);
+    server.dirty++;
+}
+
+/* handle the "SRANDMEMBER key <count>" variant. The normal version of the
+ * command is handled by the srandmemberCommand() function itself. */
+
+/* How many times bigger should be the set compared to the requested size
+ * for us to don't use the "remove elements" strategy? Read later in the
+ * implementation for more info. */
+#define SRANDMEMBER_SUB_STRATEGY_MUL 3
+
+void srandmemberWithCountCommand(client *c) {
+    long l;
+    unsigned long count, size;
+    int uniq = 1;
+    robj *set;
+    sds ele;
+    int64_t llele;
+    int encoding;
+
+    dict *d;
+
+    if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
+    if (l >= 0) {
+        count = (unsigned long) l;
+    } else {
+        /* A negative count means: return the same elements multiple times
+         * (i.e. don't remove the extracted element after every extraction). */
+        count = -l;
+        uniq = 0;
+    }
+
+    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray))
+        == NULL || checkType(c,set,OBJ_SET)) return;
+    size = setTypeSize(set);
+
+    /* If count is zero, serve it ASAP to avoid special cases later. */
+    if (count == 0) {
+        addReply(c,shared.emptyarray);
+        return;
+    }
+
+    /* CASE 1: The count was negative, so the extraction method is just:
+     * "return N random elements" sampling the whole set every time.
+     * This case is trivial and can be served without auxiliary data
+     * structures. This case is the only one that also needs to return the
+     * elements in random order. */
+    if (!uniq || count == 1) {
+        addReplyArrayLen(c,count);
+        while(count--) {
+            encoding = setTypeRandomElement(set,&ele,&llele);
+            if (encoding == OBJ_ENCODING_INTSET) {
+                addReplyBulkLongLong(c,llele);
+            } else {
+                addReplyBulkCBuffer(c,ele,sdslen(ele));
+            }
+        }
+        return;
+    }
+
+    /* CASE 2:
+     * The number of requested elements is greater than the number of
+     * elements inside the set: simply return the whole set. */
+    if (count >= size) {
+        setTypeIterator *si;
+        addReplyArrayLen(c,size);
+        si = setTypeInitIterator(set);
+        while ((encoding = setTypeNext(si,&ele,&llele)) != -1) {
+            if (encoding == OBJ_ENCODING_INTSET) {
+                addReplyBulkLongLong(c,llele);
+            } else {
+                addReplyBulkCBuffer(c,ele,sdslen(ele));
+            }
+            size--;
+        }
+        setTypeReleaseIterator(si);
+        serverAssert(size==0);
+        return;
+    }
+
+    /* For CASE 3 and CASE 4 we need an auxiliary dictionary. */
+    d = dictCreate(&sdsReplyDictType,NULL);
+
+    /* CASE 3:
+     * The number of elements inside the set is not greater than
+     * SRANDMEMBER_SUB_STRATEGY_MUL times the number of requested elements.
+     * In this case we create a set from scratch with all the elements, and
+     * subtract random elements to reach the requested number of elements.
+     *
+     * This is done because if the number of requested elements is just
+     * a bit less than the number of elements in the set, the natural approach
+     * used into CASE 4 is highly inefficient. */
+    if (count*SRANDMEMBER_SUB_STRATEGY_MUL > size) {
+        setTypeIterator *si;
+
+        /* Add all the elements into the temporary dictionary. */
+        si = setTypeInitIterator(set);
+        dictExpand(d, size);
+        while ((encoding = setTypeNext(si,&ele,&llele)) != -1) {
+            int retval = DICT_ERR;
+
+            if (encoding == OBJ_ENCODING_INTSET) {
+                retval = dictAdd(d,sdsfromlonglong(llele),NULL);
+            } else {
+                retval = dictAdd(d,sdsdup(ele),NULL);
+            }
+            serverAssert(retval == DICT_OK);
+        }
+        setTypeReleaseIterator(si);
+        serverAssert(dictSize(d) == size);
+
+        /* Remove random elements to reach the right count. */
+        while (size > count) {
+            dictEntry *de;
+            de = dictGetRandomKey(d);
+            dictUnlink(d,dictGetKey(de));
+            sdsfree(dictGetKey(de));
+            dictFreeUnlinkedEntry(d,de);
+            size--;
+        }
+    }
+
+    /* CASE 4: We have a big set compared to the requested number of elements.
+     * In this case we can simply get random elements from the set and add
+     * to the temporary set, trying to eventually get enough unique elements
+     * to reach the specified count. */
+    else {
+        unsigned long added = 0;
+        sds sdsele;
+
+        dictExpand(d, count);
+        while (added < count) {
+            encoding = setTypeRandomElement(set,&ele,&llele);
+            if (encoding == OBJ_ENCODING_INTSET) {
+                sdsele = sdsfromlonglong(llele);
+            } else {
+                sdsele = sdsdup(ele);
+            }
+            /* Try to add the object to the dictionary. If it already exists
+             * free it, otherwise increment the number of objects we have
+             * in the result dictionary. */
+            if (dictAdd(d,sdsele,NULL) == DICT_OK)
+                added++;
+            else
+                sdsfree(sdsele);
+        }
+    }
+
+    /* CASE 3 & 4: send the result to the user. */
+    {
+        dictIterator *di;
+        dictEntry *de;
+
+        addReplyArrayLen(c,count);
+        di = dictGetIterator(d);
+        while((de = dictNext(di)) != NULL)
+            addReplyBulkSds(c,dictGetKey(de));
+        dictReleaseIterator(di);
+        dictRelease(d);
+    }
+}
+
+/* SRANDMEMBER [<count>] */
+void srandmemberCommand(client *c) {
+    robj *set;
+    sds ele;
+    int64_t llele;
+    int encoding;
+
+    if (c->argc == 3) {
+        srandmemberWithCountCommand(c);
+        return;
+    } else if (c->argc > 3) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Handle variant without <count> argument. Reply with simple bulk string */
+    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))
+        == NULL || checkType(c,set,OBJ_SET)) return;
+
+    encoding = setTypeRandomElement(set,&ele,&llele);
+    if (encoding == OBJ_ENCODING_INTSET) {
+        addReplyBulkLongLong(c,llele);
+    } else {
+        addReplyBulkCBuffer(c,ele,sdslen(ele));
+    }
+}
+
+int qsortCompareSetsByCardinality(const void *s1, const void *s2) {
+    if (setTypeSize(*(robj**)s1) > setTypeSize(*(robj**)s2)) return 1;
+    if (setTypeSize(*(robj**)s1) < setTypeSize(*(robj**)s2)) return -1;
+    return 0;
+}
+
+/* This is used by SDIFF and in this case we can receive NULL that should
+ * be handled as empty sets. */
+int qsortCompareSetsByRevCardinality(const void *s1, const void *s2) {
+    robj *o1 = *(robj**)s1, *o2 = *(robj**)s2;
+    unsigned long first = o1 ? setTypeSize(o1) : 0;
+    unsigned long second = o2 ? setTypeSize(o2) : 0;
+
+    if (first < second) return 1;
+    if (first > second) return -1;
+    return 0;
+}
+
+void sinterGenericCommand(client *c, robj **setkeys,
+                          unsigned long setnum, robj *dstkey) {
+    robj **sets = zmalloc(sizeof(robj*)*setnum);
+    setTypeIterator *si;
+    robj *dstset = NULL;
+    sds elesds;
+    int64_t intobj;
+    void *replylen = NULL;
+    unsigned long j, cardinality = 0;
+    int encoding, empty = 0;
+
+    for (j = 0; j < setnum; j++) {
+        robj *setobj = dstkey ?
+            lookupKeyWrite(c->db,setkeys[j]) :
+            lookupKeyRead(c->db,setkeys[j]);
+        if (!setobj) {
+            /* A NULL is considered an empty set */
+            empty += 1;
+            sets[j] = NULL;
+            continue;
+        }
+        if (checkType(c,setobj,OBJ_SET)) {
+            zfree(sets);
+            return;
+        }
+        sets[j] = setobj;
+    }
+
+    /* Set intersection with an empty set always results in an empty set.
+     * Return ASAP if there is an empty set. */
+    if (empty > 0) {
+        zfree(sets);
+        if (dstkey) {
+            if (dbDelete(c->db,dstkey)) {
+                signalModifiedKey(c,c->db,dstkey);
+                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
+                server.dirty++;
+            }
+            addReply(c,shared.czero);
+        } else {
+            addReply(c,shared.emptyset[c->resp]);
+        }
+        return;
+    }
+
+    /* Sort sets from the smallest to largest, this will improve our
+     * algorithm's performance */
+    qsort(sets,setnum,sizeof(robj*),qsortCompareSetsByCardinality);
+
+    /* The first thing we should output is the total number of elements...
+     * since this is a multi-bulk write, but at this stage we don't know
+     * the intersection set size, so we use a trick, append an empty object
+     * to the output list and save the pointer to later modify it with the
+     * right length */
+    if (!dstkey) {
+        replylen = addReplyDeferredLen(c);
+    } else {
+        /* If we have a target key where to store the resulting set
+         * create this key with an empty set inside */
+        dstset = createIntsetObject();
+    }
+
+    /* Iterate all the elements of the first (smallest) set, and test
+     * the element against all the other sets, if at least one set does
+     * not include the element it is discarded */
+    si = setTypeInitIterator(sets[0]);
+    while((encoding = setTypeNext(si,&elesds,&intobj)) != -1) {
+        for (j = 1; j < setnum; j++) {
+            if (sets[j] == sets[0]) continue;
+            if (encoding == OBJ_ENCODING_INTSET) {
+                /* intset with intset is simple... and fast */
+                if (sets[j]->encoding == OBJ_ENCODING_INTSET &&
+                    !intsetFind((intset*)sets[j]->ptr,intobj))
+                {
+                    break;
+                /* in order to compare an integer with an object we
+                 * have to use the generic function, creating an object
+                 * for this */
+                } else if (sets[j]->encoding == OBJ_ENCODING_HT) {
+                    elesds = sdsfromlonglong(intobj);
+                    if (!setTypeIsMember(sets[j],elesds)) {
+                        sdsfree(elesds);
+                        break;
+                    }
+                    sdsfree(elesds);
+                }
+            } else if (encoding == OBJ_ENCODING_HT) {
+                if (!setTypeIsMember(sets[j],elesds)) {
+                    break;
+                }
+            }
+        }
+
+        /* Only take action when all sets contain the member */
+        if (j == setnum) {
+            if (!dstkey) {
+                if (encoding == OBJ_ENCODING_HT)
+                    addReplyBulkCBuffer(c,elesds,sdslen(elesds));
+                else
+                    addReplyBulkLongLong(c,intobj);
+                cardinality++;
+            } else {
+                if (encoding == OBJ_ENCODING_INTSET) {
+                    elesds = sdsfromlonglong(intobj);
+                    setTypeAdd(dstset,elesds);
+                    sdsfree(elesds);
+                } else {
+                    setTypeAdd(dstset,elesds);
+                }
+            }
+        }
+    }
+    setTypeReleaseIterator(si);
+
+    if (dstkey) {
+        /* Store the resulting set into the target, if the intersection
+         * is not an empty set. */
+        if (setTypeSize(dstset) > 0) {
+            setKey(c,c->db,dstkey,dstset);
+            addReplyLongLong(c,setTypeSize(dstset));
+            notifyKeyspaceEvent(NOTIFY_SET,"sinterstore",
+                dstkey,c->db->id);
+            server.dirty++;
+        } else {
+            addReply(c,shared.czero);
+            if (dbDelete(c->db,dstkey)) {
+                server.dirty++;
+                signalModifiedKey(c,c->db,dstkey);
+                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
+            }
+        }
+        decrRefCount(dstset);
+    } else {
+        setDeferredSetLen(c,replylen,cardinality);
+    }
+    zfree(sets);
+}
+
+/* SINTER key [key ...] */
+void sinterCommand(client *c) {
+    sinterGenericCommand(c,c->argv+1,c->argc-1,NULL);
+}
+
+/* SINTERSTORE destination key [key ...] */
+void sinterstoreCommand(client *c) {
+    sinterGenericCommand(c,c->argv+2,c->argc-2,c->argv[1]);
+}
+
+#define SET_OP_UNION 0
+#define SET_OP_DIFF 1
+#define SET_OP_INTER 2
+
+void sunionDiffGenericCommand(client *c, robj **setkeys, int setnum,
+                              robj *dstkey, int op) {
+    robj **sets = zmalloc(sizeof(robj*)*setnum);
+    setTypeIterator *si;
+    robj *dstset = NULL;
+    sds ele;
+    int j, cardinality = 0;
+    int diff_algo = 1;
+
+    for (j = 0; j < setnum; j++) {
+        robj *setobj = dstkey ?
+            lookupKeyWrite(c->db,setkeys[j]) :
+            lookupKeyRead(c->db,setkeys[j]);
+        if (!setobj) {
+            sets[j] = NULL;
+            continue;
+        }
+        if (checkType(c,setobj,OBJ_SET)) {
+            zfree(sets);
+            return;
+        }
+        sets[j] = setobj;
+    }
+
+    /* Select what DIFF algorithm to use.
+     *
+     * Algorithm 1 is O(N*M) where N is the size of the element first set
+     * and M the total number of sets.
+     *
+     * Algorithm 2 is O(N) where N is the total number of elements in all
+     * the sets.
+     *
+     * We compute what is the best bet with the current input here. */
+    if (op == SET_OP_DIFF && sets[0]) {
+        long long algo_one_work = 0, algo_two_work = 0;
+
+        for (j = 0; j < setnum; j++) {
+            if (sets[j] == NULL) continue;
+
+            algo_one_work += setTypeSize(sets[0]);
+            algo_two_work += setTypeSize(sets[j]);
+        }
+
+        /* Algorithm 1 has better constant times and performs less operations
+         * if there are elements in common. Give it some advantage. */
+        algo_one_work /= 2;
+        diff_algo = (algo_one_work <= algo_two_work) ? 1 : 2;
+
+        if (diff_algo == 1 && setnum > 1) {
+            /* With algorithm 1 it is better to order the sets to subtract
+             * by decreasing size, so that we are more likely to find
+             * duplicated elements ASAP. */
+            qsort(sets+1,setnum-1,sizeof(robj*),
+                qsortCompareSetsByRevCardinality);
+        }
+    }
+
+    /* We need a temp set object to store our union. If the dstkey
+     * is not NULL (that is, we are inside an SUNIONSTORE operation) then
+     * this set object will be the resulting object to set into the target key*/
+    dstset = createIntsetObject();
+
+    if (op == SET_OP_UNION) {
+        /* Union is trivial, just add every element of every set to the
+         * temporary set. */
+        for (j = 0; j < setnum; j++) {
+            if (!sets[j]) continue; /* non existing keys are like empty sets */
+
+            si = setTypeInitIterator(sets[j]);
+            while((ele = setTypeNextObject(si)) != NULL) {
+                if (setTypeAdd(dstset,ele)) cardinality++;
+                sdsfree(ele);
+            }
+            setTypeReleaseIterator(si);
+        }
+    } else if (op == SET_OP_DIFF && sets[0] && diff_algo == 1) {
+        /* DIFF Algorithm 1:
+         *
+         * We perform the diff by iterating all the elements of the first set,
+         * and only adding it to the target set if the element does not exist
+         * into all the other sets.
+         *
+         * This way we perform at max N*M operations, where N is the size of
+         * the first set, and M the number of sets. */
+        si = setTypeInitIterator(sets[0]);
+        while((ele = setTypeNextObject(si)) != NULL) {
+            for (j = 1; j < setnum; j++) {
+                if (!sets[j]) continue; /* no key is an empty set. */
+                if (sets[j] == sets[0]) break; /* same set! */
+                if (setTypeIsMember(sets[j],ele)) break;
+            }
+            if (j == setnum) {
+                /* There is no other set with this element. Add it. */
+                setTypeAdd(dstset,ele);
+                cardinality++;
+            }
+            sdsfree(ele);
+        }
+        setTypeReleaseIterator(si);
+    } else if (op == SET_OP_DIFF && sets[0] && diff_algo == 2) {
+        /* DIFF Algorithm 2:
+         *
+         * Add all the elements of the first set to the auxiliary set.
+         * Then remove all the elements of all the next sets from it.
+         *
+         * This is O(N) where N is the sum of all the elements in every
+         * set. */
+        for (j = 0; j < setnum; j++) {
+            if (!sets[j]) continue; /* non existing keys are like empty sets */
+
+            si = setTypeInitIterator(sets[j]);
+            while((ele = setTypeNextObject(si)) != NULL) {
+                if (j == 0) {
+                    if (setTypeAdd(dstset,ele)) cardinality++;
+                } else {
+                    if (setTypeRemove(dstset,ele)) cardinality--;
+                }
+                sdsfree(ele);
+            }
+            setTypeReleaseIterator(si);
+
+            /* Exit if result set is empty as any additional removal
+             * of elements will have no effect. */
+            if (cardinality == 0) break;
+        }
+    }
+
+    /* Output the content of the resulting set, if not in STORE mode */
+    if (!dstkey) {
+        addReplySetLen(c,cardinality);
+        si = setTypeInitIterator(dstset);
+        while((ele = setTypeNextObject(si)) != NULL) {
+            addReplyBulkCBuffer(c,ele,sdslen(ele));
+            sdsfree(ele);
+        }
+        setTypeReleaseIterator(si);
+        server.lazyfree_lazy_server_del ? freeObjAsync(NULL, dstset) :
+                                          decrRefCount(dstset);
+    } else {
+        /* If we have a target key where to store the resulting set
+         * create this key with the result set inside */
+        if (setTypeSize(dstset) > 0) {
+            setKey(c,c->db,dstkey,dstset);
+            addReplyLongLong(c,setTypeSize(dstset));
+            notifyKeyspaceEvent(NOTIFY_SET,
+                op == SET_OP_UNION ? "sunionstore" : "sdiffstore",
+                dstkey,c->db->id);
+            server.dirty++;
+        } else {
+            addReply(c,shared.czero);
+            if (dbDelete(c->db,dstkey)) {
+                server.dirty++;
+                signalModifiedKey(c,c->db,dstkey);
+                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
+            }
+        }
+        decrRefCount(dstset);
+    }
+    zfree(sets);
+}
+
+/* SUNION key [key ...] */
+void sunionCommand(client *c) {
+    sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,SET_OP_UNION);
+}
+
+/* SUNIONSTORE destination key [key ...] */
+void sunionstoreCommand(client *c) {
+    sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],SET_OP_UNION);
+}
+
+/* SDIFF key [key ...] */
+void sdiffCommand(client *c) {
+    sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,SET_OP_DIFF);
+}
+
+/* SDIFFSTORE destination key [key ...] */
+void sdiffstoreCommand(client *c) {
+    sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],SET_OP_DIFF);
+}
+
+void sscanCommand(client *c) {
+    robj *set;
+    unsigned long cursor;
+
+    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
+    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
+        checkType(c,set,OBJ_SET)) return;
+    scanGenericCommand(c,set,cursor);
+}
diff --git a/redis-stable/src/t_stream.c b/redis-stable/src/t_stream.c
new file mode 100644
index 00000000..51ac2a31
--- /dev/null
+++ b/redis-stable/src/t_stream.c
@@ -0,0 +1,3668 @@
+/*
+ * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "endianconv.h"
+#include "stream.h"
+
+/* Every stream item inside the listpack, has a flags field that is used to
+ * mark the entry as deleted, or having the same field as the "master"
+ * entry at the start of the listpack> */
+#define STREAM_ITEM_FLAG_NONE 0             /* No special flags. */
+#define STREAM_ITEM_FLAG_DELETED (1<<0)     /* Entry is deleted. Skip it. */
+#define STREAM_ITEM_FLAG_SAMEFIELDS (1<<1)  /* Same fields as master entry. */
+
+/* For stream commands that require multiple IDs
+ * when the number of IDs is less than 'STREAMID_STATIC_VECTOR_LEN',
+ * avoid malloc allocation.*/
+#define STREAMID_STATIC_VECTOR_LEN 8
+
+/* Max pre-allocation for listpack. This is done to avoid abuse of a user
+ * setting stream_node_max_bytes to a huge number. */
+#define STREAM_LISTPACK_MAX_PRE_ALLOCATE 4096
+
+/* Don't let listpacks grow too big, even if the user config allows it.
+ * doing so can lead to an overflow (trying to store more than 32bit length
+ * into the listpack header), or actually an assertion since lpInsert
+ * will return NULL. */
+#define STREAM_LISTPACK_MAX_SIZE (1<<30)
+
+void streamFreeCG(streamCG *cg);
+void streamFreeNACK(streamNACK *na);
+size_t streamReplyWithRangeFromConsumerPEL(client *c, stream *s, streamID *start, streamID *end, size_t count, streamConsumer *consumer);
+int streamParseStrictIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq);
+int streamParseIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq);
+
+/* -----------------------------------------------------------------------
+ * Low level stream encoding: a radix tree of listpacks.
+ * ----------------------------------------------------------------------- */
+
+/* Create a new stream data structure. */
+stream *streamNew(void) {
+    stream *s = zmalloc(sizeof(*s));
+    s->rax = raxNew();
+    s->length = 0;
+    s->last_id.ms = 0;
+    s->last_id.seq = 0;
+    s->cgroups = NULL; /* Created on demand to save memory when not used. */
+    return s;
+}
+
+/* Free a stream, including the listpacks stored inside the radix tree. */
+void freeStream(stream *s) {
+    raxFreeWithCallback(s->rax,(void(*)(void*))lpFree);
+    if (s->cgroups)
+        raxFreeWithCallback(s->cgroups,(void(*)(void*))streamFreeCG);
+    zfree(s);
+}
+
+/* Return the length of a stream. */
+unsigned long streamLength(const robj *subject) {
+    stream *s = subject->ptr;
+    return s->length;
+}
+
+/* Set 'id' to be its successor stream ID.
+ * If 'id' is the maximal possible id, it is wrapped around to 0-0 and a
+ * C_ERR is returned. */
+int streamIncrID(streamID *id) {
+    int ret = C_OK;
+    if (id->seq == UINT64_MAX) {
+        if (id->ms == UINT64_MAX) {
+            /* Special case where 'id' is the last possible streamID... */
+            id->ms = id->seq = 0;
+            ret = C_ERR;
+        } else {
+            id->ms++;
+            id->seq = 0;
+        }
+    } else {
+        id->seq++;
+    }
+    return ret;
+}
+
+/* Set 'id' to be its predecessor stream ID.
+ * If 'id' is the minimal possible id, it remains 0-0 and a C_ERR is
+ * returned. */
+int streamDecrID(streamID *id) {
+    int ret = C_OK;
+    if (id->seq == 0) {
+        if (id->ms == 0) {
+            /* Special case where 'id' is the first possible streamID... */
+            id->ms = id->seq = UINT64_MAX;
+            ret = C_ERR;
+        } else {
+            id->ms--;
+            id->seq = UINT64_MAX;
+        }
+    } else {
+        id->seq--;
+    }
+    return ret;
+}
+
+/* Generate the next stream item ID given the previous one. If the current
+ * milliseconds Unix time is greater than the previous one, just use this
+ * as time part and start with sequence part of zero. Otherwise we use the
+ * previous time (and never go backward) and increment the sequence. */
+void streamNextID(streamID *last_id, streamID *new_id) {
+    uint64_t ms = mstime();
+    if (ms > last_id->ms) {
+        new_id->ms = ms;
+        new_id->seq = 0;
+    } else {
+        *new_id = *last_id;
+        streamIncrID(new_id);
+    }
+}
+
+/* This is a helper function for the COPY command.
+ * Duplicate a Stream object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * The resulting object always has refcount set to 1 */
+robj *streamDup(robj *o) {
+    robj *sobj;
+
+    serverAssert(o->type == OBJ_STREAM);
+
+    switch (o->encoding) {
+        case OBJ_ENCODING_STREAM:
+            sobj = createStreamObject();
+            break;
+        default:
+            serverPanic("Wrong encoding.");
+            break;
+    }
+
+    stream *s;
+    stream *new_s;
+    s = o->ptr;
+    new_s = sobj->ptr;
+
+    raxIterator ri;
+    uint64_t rax_key[2];
+    raxStart(&ri, s->rax);
+    raxSeek(&ri, "^", NULL, 0);
+    size_t lp_bytes = 0;      /* Total bytes in the listpack. */
+    unsigned char *lp = NULL; /* listpack pointer. */
+    /* Get a reference to the listpack node. */
+    while (raxNext(&ri)) {
+        lp = ri.data;
+        lp_bytes = lpBytes(lp);
+        unsigned char *new_lp = zmalloc(lp_bytes);
+        memcpy(new_lp, lp, lp_bytes);
+        memcpy(rax_key, ri.key, sizeof(rax_key));
+        raxInsert(new_s->rax, (unsigned char *)&rax_key, sizeof(rax_key),
+                  new_lp, NULL);
+    }
+    new_s->length = s->length;
+    new_s->last_id = s->last_id;
+    raxStop(&ri);
+
+    if (s->cgroups == NULL) return sobj;
+
+    /* Consumer Groups */
+    raxIterator ri_cgroups;
+    raxStart(&ri_cgroups, s->cgroups);
+    raxSeek(&ri_cgroups, "^", NULL, 0);
+    while (raxNext(&ri_cgroups)) {
+        streamCG *cg = ri_cgroups.data;
+        streamCG *new_cg = streamCreateCG(new_s, (char *)ri_cgroups.key,
+                                          ri_cgroups.key_len, &cg->last_id);
+
+        serverAssert(new_cg != NULL);
+
+        /* Consumer Group PEL */
+        raxIterator ri_cg_pel;
+        raxStart(&ri_cg_pel,cg->pel);
+        raxSeek(&ri_cg_pel,"^",NULL,0);
+        while(raxNext(&ri_cg_pel)){
+            streamNACK *nack = ri_cg_pel.data;
+            streamNACK *new_nack = streamCreateNACK(NULL);
+            new_nack->delivery_time = nack->delivery_time;
+            new_nack->delivery_count = nack->delivery_count;
+            raxInsert(new_cg->pel, ri_cg_pel.key, sizeof(streamID), new_nack, NULL);
+        }
+        raxStop(&ri_cg_pel);
+
+        /* Consumers */
+        raxIterator ri_consumers;
+        raxStart(&ri_consumers, cg->consumers);
+        raxSeek(&ri_consumers, "^", NULL, 0);
+        while (raxNext(&ri_consumers)) {
+            streamConsumer *consumer = ri_consumers.data;
+            streamConsumer *new_consumer;
+            new_consumer = zmalloc(sizeof(*new_consumer));
+            new_consumer->name = sdsdup(consumer->name);
+            new_consumer->pel = raxNew();
+            raxInsert(new_cg->consumers,(unsigned char *)new_consumer->name,
+                        sdslen(new_consumer->name), new_consumer, NULL);
+            new_consumer->seen_time = consumer->seen_time;
+
+            /* Consumer PEL */
+            raxIterator ri_cpel;
+            raxStart(&ri_cpel, consumer->pel);
+            raxSeek(&ri_cpel, "^", NULL, 0);
+            while (raxNext(&ri_cpel)) {
+                streamNACK *new_nack = raxFind(new_cg->pel,ri_cpel.key,sizeof(streamID));
+
+                serverAssert(new_nack != raxNotFound);
+
+                new_nack->consumer = new_consumer;
+                raxInsert(new_consumer->pel,ri_cpel.key,sizeof(streamID),new_nack,NULL);
+            }
+            raxStop(&ri_cpel);
+        }
+        raxStop(&ri_consumers);
+    }
+    raxStop(&ri_cgroups);
+    return sobj;
+}
+
+/* This is just a wrapper for lpAppend() to directly use a 64 bit integer
+ * instead of a string. */
+unsigned char *lpAppendInteger(unsigned char *lp, int64_t value) {
+    char buf[LONG_STR_SIZE];
+    int slen = ll2string(buf,sizeof(buf),value);
+    return lpAppend(lp,(unsigned char*)buf,slen);
+}
+
+/* This is just a wrapper for lpReplace() to directly use a 64 bit integer
+ * instead of a string to replace the current element. The function returns
+ * the new listpack as return value, and also updates the current cursor
+ * by updating '*pos'. */
+unsigned char *lpReplaceInteger(unsigned char *lp, unsigned char **pos, int64_t value) {
+    char buf[LONG_STR_SIZE];
+    int slen = ll2string(buf,sizeof(buf),value);
+    return lpInsert(lp, (unsigned char*)buf, slen, *pos, LP_REPLACE, pos);
+}
+
+/* This is a wrapper function for lpGet() to directly get an integer value
+ * from the listpack (that may store numbers as a string), converting
+ * the string if needed.
+ * The 'valid" argument is an optional output parameter to get an indication
+ * if the record was valid, when this parameter is NULL, the function will
+ * fail with an assertion. */
+static inline int64_t lpGetIntegerIfValid(unsigned char *ele, int *valid) {
+    int64_t v;
+    unsigned char *e = lpGet(ele,&v,NULL);
+    if (e == NULL) {
+        if (valid)
+            *valid = 1;
+        return v;
+    }
+    /* The following code path should never be used for how listpacks work:
+     * they should always be able to store an int64_t value in integer
+     * encoded form. However the implementation may change. */
+    long long ll;
+    int ret = string2ll((char*)e,v,&ll);
+    if (valid)
+        *valid = ret;
+    else
+        serverAssert(ret != 0);
+    v = ll;
+    return v;
+}
+
+#define lpGetInteger(ele) lpGetIntegerIfValid(ele, NULL)
+
+/* Get an edge streamID of a given listpack.
+ * 'master_id' is an input param, used to build the 'edge_id' output param */
+int lpGetEdgeStreamID(unsigned char *lp, int first, streamID *master_id, streamID *edge_id)
+{
+   if (lp == NULL)
+       return 0;
+
+   unsigned char *lp_ele;
+
+   /* We need to seek either the first or the last entry depending
+    * on the direction of the iteration. */
+   if (first) {
+       /* Get the master fields count. */
+       lp_ele = lpFirst(lp);        /* Seek items count */
+       lp_ele = lpNext(lp, lp_ele); /* Seek deleted count. */
+       lp_ele = lpNext(lp, lp_ele); /* Seek num fields. */
+       int64_t master_fields_count = lpGetInteger(lp_ele);
+       lp_ele = lpNext(lp, lp_ele); /* Seek first field. */
+
+       /* If we are iterating in normal order, skip the master fields
+        * to seek the first actual entry. */
+       for (int64_t i = 0; i < master_fields_count; i++)
+           lp_ele = lpNext(lp, lp_ele);
+
+       /* If we are going forward, skip the previous entry's
+        * lp-count field (or in case of the master entry, the zero
+        * term field) */
+       lp_ele = lpNext(lp, lp_ele);
+       if (lp_ele == NULL)
+           return 0;
+   } else {
+       /* If we are iterating in reverse direction, just seek the
+        * last part of the last entry in the listpack (that is, the
+        * fields count). */
+       lp_ele = lpLast(lp);
+
+       /* If we are going backward, read the number of elements this
+        * entry is composed of, and jump backward N times to seek
+        * its start. */
+       int64_t lp_count = lpGetInteger(lp_ele);
+       if (lp_count == 0) /* We reached the master entry. */
+           return 0;
+
+       while (lp_count--)
+           lp_ele = lpPrev(lp, lp_ele);
+   }
+
+   lp_ele = lpNext(lp, lp_ele); /* Seek ID (lp_ele currently points to 'flags'). */
+
+   /* Get the ID: it is encoded as difference between the master
+    * ID and this entry ID. */
+   streamID id = *master_id;
+   id.ms += lpGetInteger(lp_ele);
+   lp_ele = lpNext(lp, lp_ele);
+   id.seq += lpGetInteger(lp_ele);
+   *edge_id = id;
+   return 1;
+}
+
+/* Debugging function to log the full content of a listpack. Useful
+ * for development and debugging. */
+void streamLogListpackContent(unsigned char *lp) {
+    unsigned char *p = lpFirst(lp);
+    while(p) {
+        unsigned char buf[LP_INTBUF_SIZE];
+        int64_t v;
+        unsigned char *ele = lpGet(p,&v,buf);
+        serverLog(LL_WARNING,"- [%d] '%.*s'", (int)v, (int)v, ele);
+        p = lpNext(lp,p);
+    }
+}
+
+/* Convert the specified stream entry ID as a 128 bit big endian number, so
+ * that the IDs can be sorted lexicographically. */
+void streamEncodeID(void *buf, streamID *id) {
+    uint64_t e[2];
+    e[0] = htonu64(id->ms);
+    e[1] = htonu64(id->seq);
+    memcpy(buf,e,sizeof(e));
+}
+
+/* This is the reverse of streamEncodeID(): the decoded ID will be stored
+ * in the 'id' structure passed by reference. The buffer 'buf' must point
+ * to a 128 bit big-endian encoded ID. */
+void streamDecodeID(void *buf, streamID *id) {
+    uint64_t e[2];
+    memcpy(e,buf,sizeof(e));
+    id->ms = ntohu64(e[0]);
+    id->seq = ntohu64(e[1]);
+}
+
+/* Compare two stream IDs. Return -1 if a < b, 0 if a == b, 1 if a > b. */
+int streamCompareID(streamID *a, streamID *b) {
+    if (a->ms > b->ms) return 1;
+    else if (a->ms < b->ms) return -1;
+    /* The ms part is the same. Check the sequence part. */
+    else if (a->seq > b->seq) return 1;
+    else if (a->seq < b->seq) return -1;
+    /* Everything is the same: IDs are equal. */
+    return 0;
+}
+
+void streamGetEdgeID(stream *s, int first, streamID *edge_id)
+{
+    raxIterator ri;
+    raxStart(&ri, s->rax);
+    int empty;
+    if (first) {
+        raxSeek(&ri, "^", NULL, 0);
+        empty = !raxNext(&ri);
+    } else {
+        raxSeek(&ri, "$", NULL, 0);
+        empty = !raxPrev(&ri);
+    }
+
+    if (empty) {
+        /* Stream is empty, mark edge ID as lowest/highest possible. */
+        edge_id->ms = first ? UINT64_MAX : 0;
+        edge_id->seq = first ? UINT64_MAX : 0;
+        raxStop(&ri);
+        return;
+    }
+
+    unsigned char *lp = ri.data;
+
+    /* Read the master ID from the radix tree key. */
+    streamID master_id;
+    streamDecodeID(ri.key, &master_id);
+
+    /* Construct edge ID. */
+    lpGetEdgeStreamID(lp, first, &master_id, edge_id);
+
+    raxStop(&ri);
+}
+
+/* Adds a new item into the stream 's' having the specified number of
+ * field-value pairs as specified in 'numfields' and stored into 'argv'.
+ * Returns the new entry ID populating the 'added_id' structure.
+ *
+ * If 'use_id' is not NULL, the ID is not auto-generated by the function,
+ * but instead the passed ID is used to add the new entry. In this case
+ * adding the entry may fail as specified later in this comment.
+ *
+ * The function returns C_OK if the item was added, this is always true
+ * if the ID was generated by the function. However the function may return
+ * C_ERR in several cases:
+ * 1. If an ID was given via 'use_id', but adding it failed since the
+ *    current top ID is greater or equal. errno will be set to EDOM.
+ * 2. If a size of a single element or the sum of the elements is too big to
+ *    be stored into the stream. errno will be set to ERANGE. */
+int streamAppendItem(stream *s, robj **argv, int64_t numfields, streamID *added_id, streamID *use_id) {
+
+    /* Generate the new entry ID. */
+    streamID id;
+    if (use_id)
+        id = *use_id;
+    else
+        streamNextID(&s->last_id,&id);
+
+    /* Check that the new ID is greater than the last entry ID
+     * or return an error. Automatically generated IDs might
+     * overflow (and wrap-around) when incrementing the sequence
+       part. */
+    if (streamCompareID(&id,&s->last_id) <= 0) {
+        errno = EDOM;
+        return C_ERR;
+    }
+
+    /* Avoid overflow when trying to add an element to the stream (listpack
+     * can only host up to 32bit length sttrings, and also a total listpack size
+     * can't be bigger than 32bit length. */
+    size_t totelelen = 0;
+    for (int64_t i = 0; i < numfields*2; i++) {
+        sds ele = argv[i]->ptr;
+        totelelen += sdslen(ele);
+    }
+    if (totelelen > STREAM_LISTPACK_MAX_SIZE) {
+        errno = ERANGE;
+        return C_ERR;
+    }
+
+    /* Add the new entry. */
+    raxIterator ri;
+    raxStart(&ri,s->rax);
+    raxSeek(&ri,"$",NULL,0);
+
+    size_t lp_bytes = 0;        /* Total bytes in the tail listpack. */
+    unsigned char *lp = NULL;   /* Tail listpack pointer. */
+
+    /* Get a reference to the tail node listpack. */
+    if (raxNext(&ri)) {
+        lp = ri.data;
+        lp_bytes = lpBytes(lp);
+    }
+    raxStop(&ri);
+
+    /* We have to add the key into the radix tree in lexicographic order,
+     * to do so we consider the ID as a single 128 bit number written in
+     * big endian, so that the most significant bytes are the first ones. */
+    uint64_t rax_key[2];    /* Key in the radix tree containing the listpack.*/
+    streamID master_id;     /* ID of the master entry in the listpack. */
+
+    /* Create a new listpack and radix tree node if needed. Note that when
+     * a new listpack is created, we populate it with a "master entry". This
+     * is just a set of fields that is taken as references in order to compress
+     * the stream entries that we'll add inside the listpack.
+     *
+     * Note that while we use the first added entry fields to create
+     * the master entry, the first added entry is NOT represented in the master
+     * entry, which is a stand alone object. But of course, the first entry
+     * will compress well because it's used as reference.
+     *
+     * The master entry is composed like in the following example:
+     *
+     * +-------+---------+------------+---------+--/--+---------+---------+-+
+     * | count | deleted | num-fields | field_1 | field_2 | ... | field_N |0|
+     * +-------+---------+------------+---------+--/--+---------+---------+-+
+     *
+     * count and deleted just represent respectively the total number of
+     * entries inside the listpack that are valid, and marked as deleted
+     * (deleted flag in the entry flags set). So the total number of items
+     * actually inside the listpack (both deleted and not) is count+deleted.
+     *
+     * The real entries will be encoded with an ID that is just the
+     * millisecond and sequence difference compared to the key stored at
+     * the radix tree node containing the listpack (delta encoding), and
+     * if the fields of the entry are the same as the master entry fields, the
+     * entry flags will specify this fact and the entry fields and number
+     * of fields will be omitted (see later in the code of this function).
+     *
+     * The "0" entry at the end is the same as the 'lp-count' entry in the
+     * regular stream entries (see below), and marks the fact that there are
+     * no more entries, when we scan the stream from right to left. */
+
+    /* First of all, check if we can append to the current macro node or
+     * if we need to switch to the next one. 'lp' will be set to NULL if
+     * the current node is full. */
+    if (lp != NULL) {
+        size_t node_max_bytes = server.stream_node_max_bytes;
+        if (node_max_bytes == 0 || node_max_bytes > STREAM_LISTPACK_MAX_SIZE)
+            node_max_bytes = STREAM_LISTPACK_MAX_SIZE;
+        if (lp_bytes + totelelen >= node_max_bytes) {
+            lp = NULL;
+        } else if (server.stream_node_max_entries) {
+            unsigned char *lp_ele = lpFirst(lp);
+            /* Count both live entries and deleted ones. */
+            int64_t count = lpGetInteger(lp_ele) + lpGetInteger(lpNext(lp,lp_ele));
+            if (count >= server.stream_node_max_entries) {
+                /* Shrink extra pre-allocated memory */
+                lp = lpShrinkToFit(lp);
+                if (ri.data != lp)
+                    raxInsert(s->rax,ri.key,ri.key_len,lp,NULL);
+                lp = NULL;
+            }
+        }
+    }
+
+    int flags = STREAM_ITEM_FLAG_NONE;
+    if (lp == NULL) {
+        master_id = id;
+        streamEncodeID(rax_key,&id);
+        /* Create the listpack having the master entry ID and fields.
+         * Pre-allocate some bytes when creating listpack to avoid realloc on
+         * every XADD. Since listpack.c uses malloc_size, it'll grow in steps,
+         * and won't realloc on every XADD.
+         * When listpack reaches max number of entries, we'll shrink the
+         * allocation to fit the data. */
+        size_t prealloc = STREAM_LISTPACK_MAX_PRE_ALLOCATE;
+        if (server.stream_node_max_bytes > 0 && server.stream_node_max_bytes < prealloc) {
+            prealloc = server.stream_node_max_bytes;
+        }
+        lp = lpNew(prealloc);
+        lp = lpAppendInteger(lp,1); /* One item, the one we are adding. */
+        lp = lpAppendInteger(lp,0); /* Zero deleted so far. */
+        lp = lpAppendInteger(lp,numfields);
+        for (int64_t i = 0; i < numfields; i++) {
+            sds field = argv[i*2]->ptr;
+            lp = lpAppend(lp,(unsigned char*)field,sdslen(field));
+        }
+        lp = lpAppendInteger(lp,0); /* Master entry zero terminator. */
+        raxInsert(s->rax,(unsigned char*)&rax_key,sizeof(rax_key),lp,NULL);
+        /* The first entry we insert, has obviously the same fields of the
+         * master entry. */
+        flags |= STREAM_ITEM_FLAG_SAMEFIELDS;
+    } else {
+        serverAssert(ri.key_len == sizeof(rax_key));
+        memcpy(rax_key,ri.key,sizeof(rax_key));
+
+        /* Read the master ID from the radix tree key. */
+        streamDecodeID(rax_key,&master_id);
+        unsigned char *lp_ele = lpFirst(lp);
+
+        /* Update count and skip the deleted fields. */
+        int64_t count = lpGetInteger(lp_ele);
+        lp = lpReplaceInteger(lp,&lp_ele,count+1);
+        lp_ele = lpNext(lp,lp_ele); /* seek deleted. */
+        lp_ele = lpNext(lp,lp_ele); /* seek master entry num fields. */
+
+        /* Check if the entry we are adding, have the same fields
+         * as the master entry. */
+        int64_t master_fields_count = lpGetInteger(lp_ele);
+        lp_ele = lpNext(lp,lp_ele);
+        if (numfields == master_fields_count) {
+            int64_t i;
+            for (i = 0; i < master_fields_count; i++) {
+                sds field = argv[i*2]->ptr;
+                int64_t e_len;
+                unsigned char buf[LP_INTBUF_SIZE];
+                unsigned char *e = lpGet(lp_ele,&e_len,buf);
+                /* Stop if there is a mismatch. */
+                if (sdslen(field) != (size_t)e_len ||
+                    memcmp(e,field,e_len) != 0) break;
+                lp_ele = lpNext(lp,lp_ele);
+            }
+            /* All fields are the same! We can compress the field names
+             * setting a single bit in the flags. */
+            if (i == master_fields_count) flags |= STREAM_ITEM_FLAG_SAMEFIELDS;
+        }
+    }
+
+    /* Populate the listpack with the new entry. We use the following
+     * encoding:
+     *
+     * +-----+--------+----------+-------+-------+-/-+-------+-------+--------+
+     * |flags|entry-id|num-fields|field-1|value-1|...|field-N|value-N|lp-count|
+     * +-----+--------+----------+-------+-------+-/-+-------+-------+--------+
+     *
+     * However if the SAMEFIELD flag is set, we have just to populate
+     * the entry with the values, so it becomes:
+     *
+     * +-----+--------+-------+-/-+-------+--------+
+     * |flags|entry-id|value-1|...|value-N|lp-count|
+     * +-----+--------+-------+-/-+-------+--------+
+     *
+     * The entry-id field is actually two separated fields: the ms
+     * and seq difference compared to the master entry.
+     *
+     * The lp-count field is a number that states the number of listpack pieces
+     * that compose the entry, so that it's possible to travel the entry
+     * in reverse order: we can just start from the end of the listpack, read
+     * the entry, and jump back N times to seek the "flags" field to read
+     * the stream full entry. */
+    lp = lpAppendInteger(lp,flags);
+    lp = lpAppendInteger(lp,id.ms - master_id.ms);
+    lp = lpAppendInteger(lp,id.seq - master_id.seq);
+    if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS))
+        lp = lpAppendInteger(lp,numfields);
+    for (int64_t i = 0; i < numfields; i++) {
+        sds field = argv[i*2]->ptr, value = argv[i*2+1]->ptr;
+        if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS))
+            lp = lpAppend(lp,(unsigned char*)field,sdslen(field));
+        lp = lpAppend(lp,(unsigned char*)value,sdslen(value));
+    }
+    /* Compute and store the lp-count field. */
+    int64_t lp_count = numfields;
+    lp_count += 3; /* Add the 3 fixed fields flags + ms-diff + seq-diff. */
+    if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) {
+        /* If the item is not compressed, it also has the fields other than
+         * the values, and an additional num-fileds field. */
+        lp_count += numfields+1;
+    }
+    lp = lpAppendInteger(lp,lp_count);
+
+    /* Insert back into the tree in order to update the listpack pointer. */
+    if (ri.data != lp)
+        raxInsert(s->rax,(unsigned char*)&rax_key,sizeof(rax_key),lp,NULL);
+    s->length++;
+    s->last_id = id;
+    if (added_id) *added_id = id;
+    return C_OK;
+}
+
+typedef struct {
+    /* XADD options */
+    streamID id; /* User-provided ID, for XADD only. */
+    int id_given; /* Was an ID different than "*" specified? for XADD only. */
+    int no_mkstream; /* if set to 1 do not create new stream */
+
+    /* XADD + XTRIM common options */
+    int trim_strategy; /* TRIM_STRATEGY_* */
+    int trim_strategy_arg_idx; /* Index of the count in MAXLEN/MINID, for rewriting. */
+    int approx_trim; /* If 1 only delete whole radix tree nodes, so
+                      * the trim argument is not applied verbatim. */
+    long long limit; /* Maximum amount of entries to trim. If 0, no limitation
+                      * on the amount of trimming work is enforced. */
+    /* TRIM_STRATEGY_MAXLEN options */
+    long long maxlen; /* After trimming, leave stream at this length . */
+    /* TRIM_STRATEGY_MINID options */
+    streamID minid; /* Trim by ID (No stream entries with ID < 'minid' will remain) */
+} streamAddTrimArgs;
+
+#define TRIM_STRATEGY_NONE 0
+#define TRIM_STRATEGY_MAXLEN 1
+#define TRIM_STRATEGY_MINID 2
+
+/* Trim the stream 's' according to args->trim_strategy, and return the
+ * number of elements removed from the stream. The 'approx' option, if non-zero,
+ * specifies that the trimming must be performed in a approximated way in
+ * order to maximize performances. This means that the stream may contain
+ * entries with IDs < 'id' in case of MINID (or more elements than 'maxlen'
+ * in case of MAXLEN), and elements are only removed if we can remove
+ * a *whole* node of the radix tree. The elements are removed from the head
+ * of the stream (older elements).
+ *
+ * The function may return zero if:
+ *
+ * 1) The minimal entry ID of the stream is already < 'id' (MINID); or
+ * 2) The stream is already shorter or equal to the specified max length (MAXLEN); or
+ * 3) The 'approx' option is true and the head node did not have enough elements
+ *    to be deleted.
+ *
+ * args->limit is the maximum number of entries to delete. The purpose is to
+ * prevent this function from taking to long.
+ * If 'limit' is 0 then we do not limit the number of deleted entries.
+ * Much like the 'approx', if 'limit' is smaller than the number of entries
+ * that should be trimmed, there is a chance we will still have entries with
+ * IDs < 'id' (or number of elements >= maxlen in case of MAXLEN).
+ */
+int64_t streamTrim(stream *s, streamAddTrimArgs *args) {
+    size_t maxlen = args->maxlen;
+    streamID *id = &args->minid;
+    int approx = args->approx_trim;
+    int64_t limit = args->limit;
+    int trim_strategy = args->trim_strategy;
+
+    if (trim_strategy == TRIM_STRATEGY_NONE)
+        return 0;
+
+    raxIterator ri;
+    raxStart(&ri,s->rax);
+    raxSeek(&ri,"^",NULL,0);
+
+    int64_t deleted = 0;
+    while (raxNext(&ri)) {
+        if (trim_strategy == TRIM_STRATEGY_MAXLEN && s->length <= maxlen)
+            break;
+
+        unsigned char *lp = ri.data, *p = lpFirst(lp);
+        int64_t entries = lpGetInteger(p);
+
+        /* Check if we exceeded the amount of work we could do */
+        if (limit && (deleted + entries) > limit)
+            break;
+
+        /* Check if we can remove the whole node. */
+        int remove_node;
+        streamID master_id = {0}; /* For MINID */
+        if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
+            remove_node = s->length - entries >= maxlen;
+        } else {
+            /* Read the master ID from the radix tree key. */
+            streamDecodeID(ri.key, &master_id);
+
+            /* Read last ID. */
+            streamID last_id;
+            lpGetEdgeStreamID(lp, 0, &master_id, &last_id);
+
+            /* We can remove the entire node id its last ID < 'id' */
+            remove_node = streamCompareID(&last_id, id) < 0;
+        }
+
+        if (remove_node) {
+            lpFree(lp);
+            raxRemove(s->rax,ri.key,ri.key_len,NULL);
+            raxSeek(&ri,">=",ri.key,ri.key_len);
+            s->length -= entries;
+            deleted += entries;
+            continue;
+        }
+
+        /* If we cannot remove a whole element, and approx is true,
+         * stop here. */
+        if (approx) break;
+
+        /* Now we have to trim entries from within 'lp' */
+        int64_t deleted_from_lp = 0;
+
+        p = lpNext(lp, p); /* Skip deleted field. */
+        p = lpNext(lp, p); /* Skip num-of-fields in the master entry. */
+
+        /* Skip all the master fields. */
+        int64_t master_fields_count = lpGetInteger(p);
+        p = lpNext(lp,p); /* Skip the first field. */
+        for (int64_t j = 0; j < master_fields_count; j++)
+            p = lpNext(lp,p); /* Skip all master fields. */
+        p = lpNext(lp,p); /* Skip the zero master entry terminator. */
+
+        /* 'p' is now pointing to the first entry inside the listpack.
+         * We have to run entry after entry, marking entries as deleted
+         * if they are already not deleted. */
+        while (p) {
+            /* We keep a copy of p (which point to flags part) in order to
+             * update it after (and if) we actually remove the entry */
+            unsigned char *pcopy = p;
+
+            int flags = lpGetInteger(p);
+            p = lpNext(lp, p); /* Skip flags. */
+            int to_skip;
+
+            int ms_delta = lpGetInteger(p);
+            p = lpNext(lp, p); /* Skip ID ms delta */
+            int seq_delta = lpGetInteger(p);
+            p = lpNext(lp, p); /* Skip ID seq delta */
+
+            streamID currid = {0}; /* For MINID */
+            if (trim_strategy == TRIM_STRATEGY_MINID) {
+                currid.ms = master_id.ms + ms_delta;
+                currid.seq = master_id.seq + seq_delta;
+            }
+
+            int stop;
+            if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
+                stop = s->length <= maxlen;
+            } else {
+                /* Following IDs will definitely be greater because the rax
+                 * tree is sorted, no point of continuing. */
+                stop = streamCompareID(&currid, id) >= 0;
+            }
+            if (stop)
+                break;
+
+            if (flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
+                to_skip = master_fields_count;
+            } else {
+                to_skip = lpGetInteger(p); /* Get num-fields. */
+                p = lpNext(lp,p); /* Skip num-fields. */
+                to_skip *= 2; /* Fields and values. */
+            }
+
+            while(to_skip--) p = lpNext(lp,p); /* Skip the whole entry. */
+            p = lpNext(lp,p); /* Skip the final lp-count field. */
+
+            /* Mark the entry as deleted. */
+            if (!(flags & STREAM_ITEM_FLAG_DELETED)) {
+                intptr_t delta = p - lp;
+                flags |= STREAM_ITEM_FLAG_DELETED;
+                lp = lpReplaceInteger(lp, &pcopy, flags);
+                deleted_from_lp++;
+                s->length--;
+                p = lp + delta;
+            }
+        }
+        deleted += deleted_from_lp;
+
+        /* Now we the entries/deleted counters. */
+        p = lpFirst(lp);
+        lp = lpReplaceInteger(lp,&p,entries-deleted_from_lp);
+        p = lpNext(lp,p); /* Skip deleted field. */
+        int64_t marked_deleted = lpGetInteger(p);
+        lp = lpReplaceInteger(lp,&p,marked_deleted+deleted_from_lp);
+        p = lpNext(lp,p); /* Skip num-of-fields in the master entry. */
+
+        /* Here we should perform garbage collection in case at this point
+         * there are too many entries deleted inside the listpack. */
+        entries -= deleted_from_lp;
+        marked_deleted += deleted_from_lp;
+        if (entries + marked_deleted > 10 && marked_deleted > entries/2) {
+            /* TODO: perform a garbage collection. */
+        }
+
+        /* Update the listpack with the new pointer. */
+        raxInsert(s->rax,ri.key,ri.key_len,lp,NULL);
+
+        break; /* If we are here, there was enough to delete in the current
+                  node, so no need to go to the next node. */
+    }
+
+    raxStop(&ri);
+    return deleted;
+}
+
+/* Trims a stream by length. Returns the number of deleted items. */
+int64_t streamTrimByLength(stream *s, long long maxlen, int approx) {
+    streamAddTrimArgs args = {
+        .trim_strategy = TRIM_STRATEGY_MAXLEN,
+        .approx_trim = approx,
+        .limit = approx ? 100 * server.stream_node_max_entries : 0,
+        .maxlen = maxlen
+    };
+    return streamTrim(s, &args);
+}
+
+/* Trims a stream by minimum ID. Returns the number of deleted items. */
+int64_t streamTrimByID(stream *s, streamID minid, int approx) {
+    streamAddTrimArgs args = {
+        .trim_strategy = TRIM_STRATEGY_MINID,
+        .approx_trim = approx,
+        .limit = approx ? 100 * server.stream_node_max_entries : 0,
+        .minid = minid
+    };
+    return streamTrim(s, &args);
+}
+
+/* Parse the arguments of XADD/XTRIM.
+ *
+ * See streamAddTrimArgs for more details about the arguments handled.
+ *
+ * This function returns the position of the ID argument (relevant only to XADD).
+ * On error -1 is returned and a reply is sent. */
+static int streamParseAddOrTrimArgsOrReply(client *c, streamAddTrimArgs *args, int xadd) {
+    /* Initialize arguments to defaults */
+    memset(args, 0, sizeof(*args));
+
+    /* Parse options. */
+    int i = 2; /* This is the first argument position where we could
+                  find an option, or the ID. */
+    int limit_given = 0;
+    for (; i < c->argc; i++) {
+        int moreargs = (c->argc-1) - i; /* Number of additional arguments. */
+        char *opt = c->argv[i]->ptr;
+        if (xadd && opt[0] == '*' && opt[1] == '\0') {
+            /* This is just a fast path for the common case of auto-ID
+             * creation. */
+            break;
+        } else if (!strcasecmp(opt,"maxlen") && moreargs) {
+            if (args->trim_strategy != TRIM_STRATEGY_NONE) {
+                addReplyError(c,"syntax error, MAXLEN and MINID options at the same time are not compatible");
+                return -1;
+            }
+            args->approx_trim = 0;
+            char *next = c->argv[i+1]->ptr;
+            /* Check for the form MAXLEN ~ <count>. */
+            if (moreargs >= 2 && next[0] == '~' && next[1] == '\0') {
+                args->approx_trim = 1;
+                i++;
+            } else if (moreargs >= 2 && next[0] == '=' && next[1] == '\0') {
+                i++;
+            }
+            if (getLongLongFromObjectOrReply(c,c->argv[i+1],&args->maxlen,NULL)
+                != C_OK) return -1;
+
+            if (args->maxlen < 0) {
+                addReplyError(c,"The MAXLEN argument must be >= 0.");
+                return -1;
+            }
+            i++;
+            args->trim_strategy = TRIM_STRATEGY_MAXLEN;
+            args->trim_strategy_arg_idx = i;
+        } else if (!strcasecmp(opt,"minid") && moreargs) {
+            if (args->trim_strategy != TRIM_STRATEGY_NONE) {
+                addReplyError(c,"syntax error, MAXLEN and MINID options at the same time are not compatible");
+                return -1;
+            }
+            args->approx_trim = 0;
+            char *next = c->argv[i+1]->ptr;
+            /* Check for the form MINID ~ <id>|<age>. */
+            if (moreargs >= 2 && next[0] == '~' && next[1] == '\0') {
+                args->approx_trim = 1;
+                i++;
+            } else if (moreargs >= 2 && next[0] == '=' && next[1] == '\0') {
+                i++;
+            }
+
+            if (streamParseStrictIDOrReply(c,c->argv[i+1],&args->minid,0) != C_OK)
+                return -1;
+            
+            i++;
+            args->trim_strategy = TRIM_STRATEGY_MINID;
+            args->trim_strategy_arg_idx = i;
+        } else if (!strcasecmp(opt,"limit") && moreargs) {
+            /* Note about LIMIT: If it was not provided by the caller we set
+             * it to 100*server.stream_node_max_entries, and that's to prevent the
+             * trimming from taking too long, on the expense of not deleting entries
+             * that should be trimmed.
+             * If user wanted exact trimming (i.e. no '~') we never limit the number
+             * of trimmed entries */
+            if (getLongLongFromObjectOrReply(c,c->argv[i+1],&args->limit,NULL) != C_OK)
+                return -1;
+
+            if (args->limit < 0) {
+                addReplyError(c,"The LIMIT argument must be >= 0.");
+                return -1;
+            }
+            limit_given = 1;
+            i++;
+        } else if (xadd && !strcasecmp(opt,"nomkstream")) {
+            args->no_mkstream = 1;
+        } else if (xadd) {
+            /* If we are here is a syntax error or a valid ID. */
+            if (streamParseStrictIDOrReply(c,c->argv[i],&args->id,0) != C_OK)
+                return -1;
+            args->id_given = 1;
+            break;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return -1;
+        }
+    }
+
+    if (args->limit && args->trim_strategy == TRIM_STRATEGY_NONE) {
+        addReplyError(c,"syntax error, LIMIT cannot be used without specifying a trimming strategy");
+        return -1;
+    }
+
+    if (!xadd && args->trim_strategy == TRIM_STRATEGY_NONE) {
+        addReplyError(c,"syntax error, XTRIM must be called with a trimming strategy");
+        return -1;
+    }
+
+    if (c == server.master || c->id == CLIENT_ID_AOF) {
+        /* If command cam from master or from AOF we must not enforce maxnodes
+         * (The maxlen/minid argument was re-written to make sure there's no
+         * inconsistency). */
+        args->limit = 0;
+    } else {
+        /* We need to set the limit (only if we got '~') */
+        if (limit_given) {
+            if (!args->approx_trim) {
+                /* LIMIT was provided without ~ */
+                addReplyError(c,"syntax error, LIMIT cannot be used without the special ~ option");
+                return -1;
+            }
+        } else {
+            /* User didn't provide LIMIT, we must set it. */
+
+            if (args->approx_trim) {
+                /* In order to prevent from trimming to do too much work and cause
+                 * latency spikes we limit the amount of work it can do */
+                args->limit = 100 * server.stream_node_max_entries; /* Maximum 100 rax nodes. */
+            } else {
+                /* No LIMIT for exact trimming */
+                args->limit = 0;
+            }
+        }
+    }
+
+    return i;
+}
+
+/* Initialize the stream iterator, so that we can call iterating functions
+ * to get the next items. This requires a corresponding streamIteratorStop()
+ * at the end. The 'rev' parameter controls the direction. If it's zero the
+ * iteration is from the start to the end element (inclusive), otherwise
+ * if rev is non-zero, the iteration is reversed.
+ *
+ * Once the iterator is initialized, we iterate like this:
+ *
+ *  streamIterator myiterator;
+ *  streamIteratorStart(&myiterator,...);
+ *  int64_t numfields;
+ *  while(streamIteratorGetID(&myiterator,&ID,&numfields)) {
+ *      while(numfields--) {
+ *          unsigned char *key, *value;
+ *          size_t key_len, value_len;
+ *          streamIteratorGetField(&myiterator,&key,&value,&key_len,&value_len);
+ *
+ *          ... do what you want with key and value ...
+ *      }
+ *  }
+ *  streamIteratorStop(&myiterator); */
+void streamIteratorStart(streamIterator *si, stream *s, streamID *start, streamID *end, int rev) {
+    /* Initialize the iterator and translates the iteration start/stop
+     * elements into a 128 big big-endian number. */
+    if (start) {
+        streamEncodeID(si->start_key,start);
+    } else {
+        si->start_key[0] = 0;
+        si->start_key[1] = 0;
+    }
+
+    if (end) {
+        streamEncodeID(si->end_key,end);
+    } else {
+        si->end_key[0] = UINT64_MAX;
+        si->end_key[1] = UINT64_MAX;
+    }
+
+    /* Seek the correct node in the radix tree. */
+    raxStart(&si->ri,s->rax);
+    if (!rev) {
+        if (start && (start->ms || start->seq)) {
+            raxSeek(&si->ri,"<=",(unsigned char*)si->start_key,
+                    sizeof(si->start_key));
+            if (raxEOF(&si->ri)) raxSeek(&si->ri,"^",NULL,0);
+        } else {
+            raxSeek(&si->ri,"^",NULL,0);
+        }
+    } else {
+        if (end && (end->ms || end->seq)) {
+            raxSeek(&si->ri,"<=",(unsigned char*)si->end_key,
+                    sizeof(si->end_key));
+            if (raxEOF(&si->ri)) raxSeek(&si->ri,"$",NULL,0);
+        } else {
+            raxSeek(&si->ri,"$",NULL,0);
+        }
+    }
+    si->stream = s;
+    si->lp = NULL; /* There is no current listpack right now. */
+    si->lp_ele = NULL; /* Current listpack cursor. */
+    si->rev = rev;  /* Direction, if non-zero reversed, from end to start. */
+}
+
+/* Return 1 and store the current item ID at 'id' if there are still
+ * elements within the iteration range, otherwise return 0 in order to
+ * signal the iteration terminated. */
+int streamIteratorGetID(streamIterator *si, streamID *id, int64_t *numfields) {
+    while(1) { /* Will stop when element > stop_key or end of radix tree. */
+        /* If the current listpack is set to NULL, this is the start of the
+         * iteration or the previous listpack was completely iterated.
+         * Go to the next node. */
+        if (si->lp == NULL || si->lp_ele == NULL) {
+            if (!si->rev && !raxNext(&si->ri)) return 0;
+            else if (si->rev && !raxPrev(&si->ri)) return 0;
+            serverAssert(si->ri.key_len == sizeof(streamID));
+            /* Get the master ID. */
+            streamDecodeID(si->ri.key,&si->master_id);
+            /* Get the master fields count. */
+            si->lp = si->ri.data;
+            si->lp_ele = lpFirst(si->lp);           /* Seek items count */
+            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek deleted count. */
+            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek num fields. */
+            si->master_fields_count = lpGetInteger(si->lp_ele);
+            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek first field. */
+            si->master_fields_start = si->lp_ele;
+            /* We are now pointing to the first field of the master entry.
+             * We need to seek either the first or the last entry depending
+             * on the direction of the iteration. */
+            if (!si->rev) {
+                /* If we are iterating in normal order, skip the master fields
+                 * to seek the first actual entry. */
+                for (uint64_t i = 0; i < si->master_fields_count; i++)
+                    si->lp_ele = lpNext(si->lp,si->lp_ele);
+            } else {
+                /* If we are iterating in reverse direction, just seek the
+                 * last part of the last entry in the listpack (that is, the
+                 * fields count). */
+                si->lp_ele = lpLast(si->lp);
+            }
+        } else if (si->rev) {
+            /* If we are iterating in the reverse order, and this is not
+             * the first entry emitted for this listpack, then we already
+             * emitted the current entry, and have to go back to the previous
+             * one. */
+            int lp_count = lpGetInteger(si->lp_ele);
+            while(lp_count--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
+            /* Seek lp-count of prev entry. */
+            si->lp_ele = lpPrev(si->lp,si->lp_ele);
+        }
+
+        /* For every radix tree node, iterate the corresponding listpack,
+         * returning elements when they are within range. */
+        while(1) {
+            if (!si->rev) {
+                /* If we are going forward, skip the previous entry
+                 * lp-count field (or in case of the master entry, the zero
+                 * term field) */
+                si->lp_ele = lpNext(si->lp,si->lp_ele);
+                if (si->lp_ele == NULL) break;
+            } else {
+                /* If we are going backward, read the number of elements this
+                 * entry is composed of, and jump backward N times to seek
+                 * its start. */
+                int64_t lp_count = lpGetInteger(si->lp_ele);
+                if (lp_count == 0) { /* We reached the master entry. */
+                    si->lp = NULL;
+                    si->lp_ele = NULL;
+                    break;
+                }
+                while(lp_count--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
+            }
+
+            /* Get the flags entry. */
+            si->lp_flags = si->lp_ele;
+            int flags = lpGetInteger(si->lp_ele);
+            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek ID. */
+
+            /* Get the ID: it is encoded as difference between the master
+             * ID and this entry ID. */
+            *id = si->master_id;
+            id->ms += lpGetInteger(si->lp_ele);
+            si->lp_ele = lpNext(si->lp,si->lp_ele);
+            id->seq += lpGetInteger(si->lp_ele);
+            si->lp_ele = lpNext(si->lp,si->lp_ele);
+            unsigned char buf[sizeof(streamID)];
+            streamEncodeID(buf,id);
+
+            /* The number of entries is here or not depending on the
+             * flags. */
+            if (flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
+                *numfields = si->master_fields_count;
+            } else {
+                *numfields = lpGetInteger(si->lp_ele);
+                si->lp_ele = lpNext(si->lp,si->lp_ele);
+            }
+            serverAssert(*numfields>=0);
+
+            /* If current >= start, and the entry is not marked as
+             * deleted, emit it. */
+            if (!si->rev) {
+                if (memcmp(buf,si->start_key,sizeof(streamID)) >= 0 &&
+                    !(flags & STREAM_ITEM_FLAG_DELETED))
+                {
+                    if (memcmp(buf,si->end_key,sizeof(streamID)) > 0)
+                        return 0; /* We are already out of range. */
+                    si->entry_flags = flags;
+                    if (flags & STREAM_ITEM_FLAG_SAMEFIELDS)
+                        si->master_fields_ptr = si->master_fields_start;
+                    return 1; /* Valid item returned. */
+                }
+            } else {
+                if (memcmp(buf,si->end_key,sizeof(streamID)) <= 0 &&
+                    !(flags & STREAM_ITEM_FLAG_DELETED))
+                {
+                    if (memcmp(buf,si->start_key,sizeof(streamID)) < 0)
+                        return 0; /* We are already out of range. */
+                    si->entry_flags = flags;
+                    if (flags & STREAM_ITEM_FLAG_SAMEFIELDS)
+                        si->master_fields_ptr = si->master_fields_start;
+                    return 1; /* Valid item returned. */
+                }
+            }
+
+            /* If we do not emit, we have to discard if we are going
+             * forward, or seek the previous entry if we are going
+             * backward. */
+            if (!si->rev) {
+                int64_t to_discard = (flags & STREAM_ITEM_FLAG_SAMEFIELDS) ?
+                                      *numfields : *numfields*2;
+                for (int64_t i = 0; i < to_discard; i++)
+                    si->lp_ele = lpNext(si->lp,si->lp_ele);
+            } else {
+                int64_t prev_times = 4; /* flag + id ms + id seq + one more to
+                                           go back to the previous entry "count"
+                                           field. */
+                /* If the entry was not flagged SAMEFIELD we also read the
+                 * number of fields, so go back one more. */
+                if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) prev_times++;
+                while(prev_times--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
+            }
+        }
+
+        /* End of listpack reached. Try the next/prev radix tree node. */
+    }
+}
+
+/* Get the field and value of the current item we are iterating. This should
+ * be called immediately after streamIteratorGetID(), and for each field
+ * according to the number of fields returned by streamIteratorGetID().
+ * The function populates the field and value pointers and the corresponding
+ * lengths by reference, that are valid until the next iterator call, assuming
+ * no one touches the stream meanwhile. */
+void streamIteratorGetField(streamIterator *si, unsigned char **fieldptr, unsigned char **valueptr, int64_t *fieldlen, int64_t *valuelen) {
+    if (si->entry_flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
+        *fieldptr = lpGet(si->master_fields_ptr,fieldlen,si->field_buf);
+        si->master_fields_ptr = lpNext(si->lp,si->master_fields_ptr);
+    } else {
+        *fieldptr = lpGet(si->lp_ele,fieldlen,si->field_buf);
+        si->lp_ele = lpNext(si->lp,si->lp_ele);
+    }
+    *valueptr = lpGet(si->lp_ele,valuelen,si->value_buf);
+    si->lp_ele = lpNext(si->lp,si->lp_ele);
+}
+
+/* Remove the current entry from the stream: can be called after the
+ * GetID() API or after any GetField() call, however we need to iterate
+ * a valid entry while calling this function. Moreover the function
+ * requires the entry ID we are currently iterating, that was previously
+ * returned by GetID().
+ *
+ * Note that after calling this function, next calls to GetField() can't
+ * be performed: the entry is now deleted. Instead the iterator will
+ * automatically re-seek to the next entry, so the caller should continue
+ * with GetID(). */
+void streamIteratorRemoveEntry(streamIterator *si, streamID *current) {
+    unsigned char *lp = si->lp;
+    int64_t aux;
+
+    /* We do not really delete the entry here. Instead we mark it as
+     * deleted flagging it, and also incrementing the count of the
+     * deleted entries in the listpack header.
+     *
+     * We start flagging: */
+    int flags = lpGetInteger(si->lp_flags);
+    flags |= STREAM_ITEM_FLAG_DELETED;
+    lp = lpReplaceInteger(lp,&si->lp_flags,flags);
+
+    /* Change the valid/deleted entries count in the master entry. */
+    unsigned char *p = lpFirst(lp);
+    aux = lpGetInteger(p);
+
+    if (aux == 1) {
+        /* If this is the last element in the listpack, we can remove the whole
+         * node. */
+        lpFree(lp);
+        raxRemove(si->stream->rax,si->ri.key,si->ri.key_len,NULL);
+    } else {
+        /* In the base case we alter the counters of valid/deleted entries. */
+        lp = lpReplaceInteger(lp,&p,aux-1);
+        p = lpNext(lp,p); /* Seek deleted field. */
+        aux = lpGetInteger(p);
+        lp = lpReplaceInteger(lp,&p,aux+1);
+
+        /* Update the listpack with the new pointer. */
+        if (si->lp != lp)
+            raxInsert(si->stream->rax,si->ri.key,si->ri.key_len,lp,NULL);
+    }
+
+    /* Update the number of entries counter. */
+    si->stream->length--;
+
+    /* Re-seek the iterator to fix the now messed up state. */
+    streamID start, end;
+    if (si->rev) {
+        streamDecodeID(si->start_key,&start);
+        end = *current;
+    } else {
+        start = *current;
+        streamDecodeID(si->end_key,&end);
+    }
+    streamIteratorStop(si);
+    streamIteratorStart(si,si->stream,&start,&end,si->rev);
+
+    /* TODO: perform a garbage collection here if the ration between
+     * deleted and valid goes over a certain limit. */
+}
+
+/* Stop the stream iterator. The only cleanup we need is to free the rax
+ * iterator, since the stream iterator itself is supposed to be stack
+ * allocated. */
+void streamIteratorStop(streamIterator *si) {
+    raxStop(&si->ri);
+}
+
+/* Delete the specified item ID from the stream, returning 1 if the item
+ * was deleted 0 otherwise (if it does not exist). */
+int streamDeleteItem(stream *s, streamID *id) {
+    int deleted = 0;
+    streamIterator si;
+    streamIteratorStart(&si,s,id,id,0);
+    streamID myid;
+    int64_t numfields;
+    if (streamIteratorGetID(&si,&myid,&numfields)) {
+        streamIteratorRemoveEntry(&si,&myid);
+        deleted = 1;
+    }
+    streamIteratorStop(&si);
+    return deleted;
+}
+
+/* Get the last valid (non-tombstone) streamID of 's'. */
+void streamLastValidID(stream *s, streamID *maxid)
+{
+    streamIterator si;
+    streamIteratorStart(&si,s,NULL,NULL,1);
+    int64_t numfields;
+    if (!streamIteratorGetID(&si,maxid,&numfields) && s->length)
+        serverPanic("Corrupt stream, length is %llu, but no max id", (unsigned long long)s->length);
+    streamIteratorStop(&si);
+}
+
+/* Emit a reply in the client output buffer by formatting a Stream ID
+ * in the standard <ms>-<seq> format, using the simple string protocol
+ * of REPL. */
+void addReplyStreamID(client *c, streamID *id) {
+    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
+    addReplyBulkSds(c,replyid);
+}
+
+void setDeferredReplyStreamID(client *c, void *dr, streamID *id) {
+    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
+    setDeferredReplyBulkSds(c, dr, replyid);
+}
+
+/* Similar to the above function, but just creates an object, usually useful
+ * for replication purposes to create arguments. */
+robj *createObjectFromStreamID(streamID *id) {
+    return createObject(OBJ_STRING, sdscatfmt(sdsempty(),"%U-%U",
+                        id->ms,id->seq));
+}
+
+/* As a result of an explicit XCLAIM or XREADGROUP command, new entries
+ * are created in the pending list of the stream and consumers. We need
+ * to propagate this changes in the form of XCLAIM commands. */
+void streamPropagateXCLAIM(client *c, robj *key, streamCG *group, robj *groupname, robj *id, streamNACK *nack) {
+    /* We need to generate an XCLAIM that will work in a idempotent fashion:
+     *
+     * XCLAIM <key> <group> <consumer> 0 <id> TIME <milliseconds-unix-time>
+     *        RETRYCOUNT <count> FORCE JUSTID LASTID <id>.
+     *
+     * Note that JUSTID is useful in order to avoid that XCLAIM will do
+     * useless work in the slave side, trying to fetch the stream item. */
+    robj *argv[14];
+    argv[0] = shared.xclaim;
+    argv[1] = key;
+    argv[2] = groupname;
+    argv[3] = createStringObject(nack->consumer->name,sdslen(nack->consumer->name));
+    argv[4] = shared.integers[0];
+    argv[5] = id;
+    argv[6] = shared.time;
+    argv[7] = createStringObjectFromLongLong(nack->delivery_time);
+    argv[8] = shared.retrycount;
+    argv[9] = createStringObjectFromLongLong(nack->delivery_count);
+    argv[10] = shared.force;
+    argv[11] = shared.justid;
+    argv[12] = shared.lastid;
+    argv[13] = createObjectFromStreamID(&group->last_id);
+
+    /* We use progagate() because this code path is not always called from
+     * the command execution context. Moreover this will just alter the
+     * consumer group state, and we don't need MULTI/EXEC wrapping because
+     * there is no message state cross-message atomicity required. */
+    propagate(server.xclaimCommand,c->db->id,argv,14,PROPAGATE_AOF|PROPAGATE_REPL);
+    decrRefCount(argv[3]);
+    decrRefCount(argv[7]);
+    decrRefCount(argv[9]);
+    decrRefCount(argv[13]);
+}
+
+/* We need this when we want to propoagate the new last-id of a consumer group
+ * that was consumed by XREADGROUP with the NOACK option: in that case we can't
+ * propagate the last ID just using the XCLAIM LASTID option, so we emit
+ *
+ *  XGROUP SETID <key> <groupname> <id>
+ */
+void streamPropagateGroupID(client *c, robj *key, streamCG *group, robj *groupname) {
+    robj *argv[5];
+    argv[0] = shared.xgroup;
+    argv[1] = shared.setid;
+    argv[2] = key;
+    argv[3] = groupname;
+    argv[4] = createObjectFromStreamID(&group->last_id);
+
+    /* We use progagate() because this code path is not always called from
+     * the command execution context. Moreover this will just alter the
+     * consumer group state, and we don't need MULTI/EXEC wrapping because
+     * there is no message state cross-message atomicity required. */
+    propagate(server.xgroupCommand,c->db->id,argv,5,PROPAGATE_AOF|PROPAGATE_REPL);
+    decrRefCount(argv[4]);
+}
+
+/* We need this when we want to propagate creation of consumer that was created
+ * by XREADGROUP with the NOACK option. In that case, the only way to create
+ * the consumer at the replica is by using XGROUP CREATECONSUMER (see issue #7140)
+ *
+ *  XGROUP CREATECONSUMER <key> <groupname> <consumername>
+ */
+void streamPropagateConsumerCreation(client *c, robj *key, robj *groupname, sds consumername) {
+    robj *argv[5];
+    argv[0] = shared.xgroup;
+    argv[1] = shared.createconsumer;
+    argv[2] = key;
+    argv[3] = groupname;
+    argv[4] = createObject(OBJ_STRING,sdsdup(consumername));
+
+    /* We use progagate() because this code path is not always called from
+     * the command execution context. Moreover this will just alter the
+     * consumer group state, and we don't need MULTI/EXEC wrapping because
+     * there is no message state cross-message atomicity required. */
+    propagate(server.xgroupCommand,c->db->id,argv,5,PROPAGATE_AOF|PROPAGATE_REPL);
+    decrRefCount(argv[4]);
+}
+
+/* Send the stream items in the specified range to the client 'c'. The range
+ * the client will receive is between start and end inclusive, if 'count' is
+ * non zero, no more than 'count' elements are sent.
+ *
+ * The 'end' pointer can be NULL to mean that we want all the elements from
+ * 'start' till the end of the stream. If 'rev' is non zero, elements are
+ * produced in reversed order from end to start.
+ *
+ * The function returns the number of entries emitted.
+ *
+ * If group and consumer are not NULL, the function performs additional work:
+ * 1. It updates the last delivered ID in the group in case we are
+ *    sending IDs greater than the current last ID.
+ * 2. If the requested IDs are already assigned to some other consumer, the
+ *    function will not return it to the client.
+ * 3. An entry in the pending list will be created for every entry delivered
+ *    for the first time to this consumer.
+ *
+ * The behavior may be modified passing non-zero flags:
+ *
+ * STREAM_RWR_NOACK: Do not create PEL entries, that is, the point "3" above
+ *                   is not performed.
+ * STREAM_RWR_RAWENTRIES: Do not emit array boundaries, but just the entries,
+ *                        and return the number of entries emitted as usually.
+ *                        This is used when the function is just used in order
+ *                        to emit data and there is some higher level logic.
+ *
+ * The final argument 'spi' (stream propagation info pointer) is a structure
+ * filled with information needed to propagate the command execution to AOF
+ * and slaves, in the case a consumer group was passed: we need to generate
+ * XCLAIM commands to create the pending list into AOF/slaves in that case.
+ *
+ * If 'spi' is set to NULL no propagation will happen even if the group was
+ * given, but currently such a feature is never used by the code base that
+ * will always pass 'spi' and propagate when a group is passed.
+ *
+ * Note that this function is recursive in certain cases. When it's called
+ * with a non NULL group and consumer argument, it may call
+ * streamReplyWithRangeFromConsumerPEL() in order to get entries from the
+ * consumer pending entries list. However such a function will then call
+ * streamReplyWithRange() in order to emit single entries (found in the
+ * PEL by ID) to the client. This is the use case for the STREAM_RWR_RAWENTRIES
+ * flag.
+ */
+#define STREAM_RWR_NOACK (1<<0)         /* Do not create entries in the PEL. */
+#define STREAM_RWR_RAWENTRIES (1<<1)    /* Do not emit protocol for array
+                                           boundaries, just the entries. */
+#define STREAM_RWR_HISTORY (1<<2)       /* Only serve consumer local PEL. */
+size_t streamReplyWithRange(client *c, stream *s, streamID *start, streamID *end, size_t count, int rev, streamCG *group, streamConsumer *consumer, int flags, streamPropInfo *spi) {
+    void *arraylen_ptr = NULL;
+    size_t arraylen = 0;
+    streamIterator si;
+    int64_t numfields;
+    streamID id;
+    int propagate_last_id = 0;
+    int noack = flags & STREAM_RWR_NOACK;
+
+    /* If the client is asking for some history, we serve it using a
+     * different function, so that we return entries *solely* from its
+     * own PEL. This ensures each consumer will always and only see
+     * the history of messages delivered to it and not yet confirmed
+     * as delivered. */
+    if (group && (flags & STREAM_RWR_HISTORY)) {
+        return streamReplyWithRangeFromConsumerPEL(c,s,start,end,count,
+                                                   consumer);
+    }
+
+    if (!(flags & STREAM_RWR_RAWENTRIES))
+        arraylen_ptr = addReplyDeferredLen(c);
+    streamIteratorStart(&si,s,start,end,rev);
+    while(streamIteratorGetID(&si,&id,&numfields)) {
+        /* Update the group last_id if needed. */
+        if (group && streamCompareID(&id,&group->last_id) > 0) {
+            group->last_id = id;
+            /* Group last ID should be propagated only if NOACK was
+             * specified, otherwise the last id will be included
+             * in the propagation of XCLAIM itself. */
+            if (noack) propagate_last_id = 1;
+        }
+
+        /* Emit a two elements array for each item. The first is
+         * the ID, the second is an array of field-value pairs. */
+        addReplyArrayLen(c,2);
+        addReplyStreamID(c,&id);
+
+        addReplyArrayLen(c,numfields*2);
+
+        /* Emit the field-value pairs. */
+        while(numfields--) {
+            unsigned char *key, *value;
+            int64_t key_len, value_len;
+            streamIteratorGetField(&si,&key,&value,&key_len,&value_len);
+            addReplyBulkCBuffer(c,key,key_len);
+            addReplyBulkCBuffer(c,value,value_len);
+        }
+
+        /* If a group is passed, we need to create an entry in the
+         * PEL (pending entries list) of this group *and* this consumer.
+         *
+         * Note that we cannot be sure about the fact the message is not
+         * already owned by another consumer, because the admin is able
+         * to change the consumer group last delivered ID using the
+         * XGROUP SETID command. So if we find that there is already
+         * a NACK for the entry, we need to associate it to the new
+         * consumer. */
+        if (group && !noack) {
+            unsigned char buf[sizeof(streamID)];
+            streamEncodeID(buf,&id);
+
+            /* Try to add a new NACK. Most of the time this will work and
+             * will not require extra lookups. We'll fix the problem later
+             * if we find that there is already a entry for this ID. */
+            streamNACK *nack = streamCreateNACK(consumer);
+            int group_inserted =
+                raxTryInsert(group->pel,buf,sizeof(buf),nack,NULL);
+            int consumer_inserted =
+                raxTryInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
+
+            /* Now we can check if the entry was already busy, and
+             * in that case reassign the entry to the new consumer,
+             * or update it if the consumer is the same as before. */
+            if (group_inserted == 0) {
+                streamFreeNACK(nack);
+                nack = raxFind(group->pel,buf,sizeof(buf));
+                serverAssert(nack != raxNotFound);
+                raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
+                /* Update the consumer and NACK metadata. */
+                nack->consumer = consumer;
+                nack->delivery_time = mstime();
+                nack->delivery_count = 1;
+                /* Add the entry in the new consumer local PEL. */
+                raxInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
+            } else if (group_inserted == 1 && consumer_inserted == 0) {
+                serverPanic("NACK half-created. Should not be possible.");
+            }
+
+            /* Propagate as XCLAIM. */
+            if (spi) {
+                robj *idarg = createObjectFromStreamID(&id);
+                streamPropagateXCLAIM(c,spi->keyname,group,spi->groupname,idarg,nack);
+                decrRefCount(idarg);
+            }
+        }
+
+        arraylen++;
+        if (count && count == arraylen) break;
+    }
+
+    if (spi && propagate_last_id)
+        streamPropagateGroupID(c,spi->keyname,group,spi->groupname);
+
+    streamIteratorStop(&si);
+    if (arraylen_ptr) setDeferredArrayLen(c,arraylen_ptr,arraylen);
+    return arraylen;
+}
+
+/* This is an helper function for streamReplyWithRange() when called with
+ * group and consumer arguments, but with a range that is referring to already
+ * delivered messages. In this case we just emit messages that are already
+ * in the history of the consumer, fetching the IDs from its PEL.
+ *
+ * Note that this function does not have a 'rev' argument because it's not
+ * possible to iterate in reverse using a group. Basically this function
+ * is only called as a result of the XREADGROUP command.
+ *
+ * This function is more expensive because it needs to inspect the PEL and then
+ * seek into the radix tree of the messages in order to emit the full message
+ * to the client. However clients only reach this code path when they are
+ * fetching the history of already retrieved messages, which is rare. */
+size_t streamReplyWithRangeFromConsumerPEL(client *c, stream *s, streamID *start, streamID *end, size_t count, streamConsumer *consumer) {
+    raxIterator ri;
+    unsigned char startkey[sizeof(streamID)];
+    unsigned char endkey[sizeof(streamID)];
+    streamEncodeID(startkey,start);
+    if (end) streamEncodeID(endkey,end);
+
+    size_t arraylen = 0;
+    void *arraylen_ptr = addReplyDeferredLen(c);
+    raxStart(&ri,consumer->pel);
+    raxSeek(&ri,">=",startkey,sizeof(startkey));
+    while(raxNext(&ri) && (!count || arraylen < count)) {
+        if (end && memcmp(ri.key,end,ri.key_len) > 0) break;
+        streamID thisid;
+        streamDecodeID(ri.key,&thisid);
+        if (streamReplyWithRange(c,s,&thisid,&thisid,1,0,NULL,NULL,
+                                 STREAM_RWR_RAWENTRIES,NULL) == 0)
+        {
+            /* Note that we may have a not acknowledged entry in the PEL
+             * about a message that's no longer here because was removed
+             * by the user by other means. In that case we signal it emitting
+             * the ID but then a NULL entry for the fields. */
+            addReplyArrayLen(c,2);
+            addReplyStreamID(c,&thisid);
+            addReplyNullArray(c);
+        } else {
+            streamNACK *nack = ri.data;
+            nack->delivery_time = mstime();
+            nack->delivery_count++;
+        }
+        arraylen++;
+    }
+    raxStop(&ri);
+    setDeferredArrayLen(c,arraylen_ptr,arraylen);
+    return arraylen;
+}
+
+/* -----------------------------------------------------------------------
+ * Stream commands implementation
+ * ----------------------------------------------------------------------- */
+
+/* Look the stream at 'key' and return the corresponding stream object.
+ * The function creates a key setting it to an empty stream if needed. */
+robj *streamTypeLookupWriteOrCreate(client *c, robj *key, int no_create) {
+    robj *o = lookupKeyWrite(c->db,key);
+    if (checkType(c,o,OBJ_STREAM)) return NULL;
+    if (o == NULL) {
+        if (no_create) {
+            addReplyNull(c);
+            return NULL;
+        }
+        o = createStreamObject();
+        dbAdd(c->db,key,o);
+    }
+    return o;
+}
+
+/* Parse a stream ID in the format given by clients to Redis, that is
+ * <ms>-<seq>, and converts it into a streamID structure. If
+ * the specified ID is invalid C_ERR is returned and an error is reported
+ * to the client, otherwise C_OK is returned. The ID may be in incomplete
+ * form, just stating the milliseconds time part of the stream. In such a case
+ * the missing part is set according to the value of 'missing_seq' parameter.
+ *
+ * The IDs "-" and "+" specify respectively the minimum and maximum IDs
+ * that can be represented. If 'strict' is set to 1, "-" and "+" will be
+ * treated as an invalid ID.
+ *
+ * If 'c' is set to NULL, no reply is sent to the client. */
+int streamGenericParseIDOrReply(client *c, const robj *o, streamID *id, uint64_t missing_seq, int strict) {
+    char buf[128];
+    if (sdslen(o->ptr) > sizeof(buf)-1) goto invalid;
+    memcpy(buf,o->ptr,sdslen(o->ptr)+1);
+
+    if (strict && (buf[0] == '-' || buf[0] == '+') && buf[1] == '\0')
+        goto invalid;
+
+    /* Handle the "-" and "+" special cases. */
+    if (buf[0] == '-' && buf[1] == '\0') {
+        id->ms = 0;
+        id->seq = 0;
+        return C_OK;
+    } else if (buf[0] == '+' && buf[1] == '\0') {
+        id->ms = UINT64_MAX;
+        id->seq = UINT64_MAX;
+        return C_OK;
+    }
+
+    /* Parse <ms>-<seq> form. */
+    char *dot = strchr(buf,'-');
+    if (dot) *dot = '\0';
+    unsigned long long ms, seq;
+    if (string2ull(buf,&ms) == 0) goto invalid;
+    if (dot && string2ull(dot+1,&seq) == 0) goto invalid;
+    if (!dot) seq = missing_seq;
+    id->ms = ms;
+    id->seq = seq;
+    return C_OK;
+
+invalid:
+    if (c) addReplyError(c,"Invalid stream ID specified as stream "
+                           "command argument");
+    return C_ERR;
+}
+
+/* Wrapper for streamGenericParseIDOrReply() used by module API. */
+int streamParseID(const robj *o, streamID *id) {
+    return streamGenericParseIDOrReply(NULL, o, id, 0, 0);
+}
+
+/* Wrapper for streamGenericParseIDOrReply() with 'strict' argument set to
+ * 0, to be used when - and + are acceptable IDs. */
+int streamParseIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq) {
+    return streamGenericParseIDOrReply(c,o,id,missing_seq,0);
+}
+
+/* Wrapper for streamGenericParseIDOrReply() with 'strict' argument set to
+ * 1, to be used when we want to return an error if the special IDs + or -
+ * are provided. */
+int streamParseStrictIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq) {
+    return streamGenericParseIDOrReply(c,o,id,missing_seq,1);
+}
+
+/* Helper for parsing a stream ID that is a range query interval. When the
+ * exclude argument is NULL, streamParseIDOrReply() is called and the interval
+ * is treated as close (inclusive). Otherwise, the exclude argument is set if 
+ * the interval is open (the "(" prefix) and streamParseStrictIDOrReply() is
+ * called in that case.
+ */
+int streamParseIntervalIDOrReply(client *c, robj *o, streamID *id, int *exclude, uint64_t missing_seq) {
+    char *p = o->ptr;
+    size_t len = sdslen(p);
+    int invalid = 0;
+    
+    if (exclude != NULL) *exclude = (len > 1 && p[0] == '(');
+    if (exclude != NULL && *exclude) {
+        robj *t = createStringObject(p+1,len-1);
+        invalid = (streamParseStrictIDOrReply(c,t,id,missing_seq) == C_ERR);
+        decrRefCount(t);
+    } else 
+        invalid = (streamParseIDOrReply(c,o,id,missing_seq) == C_ERR);
+    if (invalid)
+        return C_ERR;
+    return C_OK;
+}
+
+void streamRewriteApproxSpecifier(client *c, int idx) {
+    rewriteClientCommandArgument(c,idx,shared.special_equals);
+}
+
+/* We propagate MAXLEN/MINID ~ <count> as MAXLEN/MINID = <resulting-len-of-stream>
+ * otherwise trimming is no longer deterministic on replicas / AOF. */
+void streamRewriteTrimArgument(client *c, stream *s, int trim_strategy, int idx) {
+    robj *arg;
+    if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
+        arg = createStringObjectFromLongLong(s->length);
+    } else {
+        streamID first_id;
+        streamGetEdgeID(s, 1, &first_id);
+        arg = createObjectFromStreamID(&first_id);
+    }
+
+    rewriteClientCommandArgument(c,idx,arg);
+    decrRefCount(arg);
+}
+
+/* XADD key [(MAXLEN [~|=] <count> | MINID [~|=] <id>) [LIMIT <entries>]] [NOMKSTREAM] <ID or *> [field value] [field value] ... */
+void xaddCommand(client *c) {
+    /* Parse options. */
+    streamAddTrimArgs parsed_args;
+    int idpos = streamParseAddOrTrimArgsOrReply(c, &parsed_args, 1);
+    if (idpos < 0)
+        return; /* streamParseAddOrTrimArgsOrReply already replied. */
+    int field_pos = idpos+1; /* The ID is always one argument before the first field */
+
+    /* Check arity. */
+    if ((c->argc - field_pos) < 2 || ((c->argc-field_pos) % 2) == 1) {
+        addReplyError(c,"wrong number of arguments for XADD");
+        return;
+    }
+
+    /* Return ASAP if minimal ID (0-0) was given so we avoid possibly creating
+     * a new stream and have streamAppendItem fail, leaving an empty key in the
+     * database. */
+    if (parsed_args.id_given &&
+        parsed_args.id.ms == 0 && parsed_args.id.seq == 0)
+    {
+        addReplyError(c,"The ID specified in XADD must be greater than 0-0");
+        return;
+    }
+
+    /* Lookup the stream at key. */
+    robj *o;
+    stream *s;
+    if ((o = streamTypeLookupWriteOrCreate(c,c->argv[1],parsed_args.no_mkstream)) == NULL) return;
+    s = o->ptr;
+
+    /* Return ASAP if the stream has reached the last possible ID */
+    if (s->last_id.ms == UINT64_MAX && s->last_id.seq == UINT64_MAX) {
+        addReplyError(c,"The stream has exhausted the last possible ID, "
+                        "unable to add more items");
+        return;
+    }
+
+    /* Append using the low level function and return the ID. */
+    streamID id;
+    if (streamAppendItem(s,c->argv+field_pos,(c->argc-field_pos)/2,
+        &id, parsed_args.id_given ? &parsed_args.id : NULL) == C_ERR)
+    {
+        if (errno == EDOM)
+            addReplyError(c,"The ID specified in XADD is equal or smaller than "
+                            "the target stream top item");
+        else
+            addReplyError(c,"Elements are too large to be stored");
+        return;
+    }
+    addReplyStreamID(c,&id);
+
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_STREAM,"xadd",c->argv[1],c->db->id);
+    server.dirty++;
+
+    /* Trim if needed. */
+    if (parsed_args.trim_strategy != TRIM_STRATEGY_NONE) {
+        if (streamTrim(s, &parsed_args)) {
+            notifyKeyspaceEvent(NOTIFY_STREAM,"xtrim",c->argv[1],c->db->id);
+        }
+        if (parsed_args.approx_trim) {
+            /* In case our trimming was limited (by LIMIT or by ~) we must
+             * re-write the relevant trim argument to make sure there will be
+             * no inconsistencies in AOF loading or in the replica.
+             * It's enough to check only args->approx because there is no
+             * way LIMIT is given without the ~ option. */
+            streamRewriteApproxSpecifier(c,parsed_args.trim_strategy_arg_idx-1);
+            streamRewriteTrimArgument(c,s,parsed_args.trim_strategy,parsed_args.trim_strategy_arg_idx);
+        }
+    }
+
+    /* Let's rewrite the ID argument with the one actually generated for
+     * AOF/replication propagation. */
+    robj *idarg = createObjectFromStreamID(&id);
+    rewriteClientCommandArgument(c,idpos,idarg);
+    decrRefCount(idarg);
+
+    /* We need to signal to blocked clients that there is new data on this
+     * stream. */
+    signalKeyAsReady(c->db, c->argv[1], OBJ_STREAM);
+}
+
+/* XRANGE/XREVRANGE actual implementation.
+ * The 'start' and 'end' IDs are parsed as follows:
+ *   Incomplete 'start' has its sequence set to 0, and 'end' to UINT64_MAX.
+ *   "-" and "+"" mean the minimal and maximal ID values, respectively.
+ *   The "(" prefix means an open (exclusive) range, so XRANGE stream (1-0 (2-0
+ *   will match anything from 1-1 and 1-UINT64_MAX.
+ */
+void xrangeGenericCommand(client *c, int rev) {
+    robj *o;
+    stream *s;
+    streamID startid, endid;
+    long long count = -1;
+    robj *startarg = rev ? c->argv[3] : c->argv[2];
+    robj *endarg = rev ? c->argv[2] : c->argv[3];
+    int startex = 0, endex = 0;
+    
+    /* Parse start and end IDs. */
+    if (streamParseIntervalIDOrReply(c,startarg,&startid,&startex,0) != C_OK)
+        return;
+    if (startex && streamIncrID(&startid) != C_OK) {
+        addReplyError(c,"invalid start ID for the interval");
+        return;
+    }
+    if (streamParseIntervalIDOrReply(c,endarg,&endid,&endex,UINT64_MAX) != C_OK)
+        return;
+    if (endex && streamDecrID(&endid) != C_OK) {
+        addReplyError(c,"invalid end ID for the interval");
+        return;
+    }
+
+    /* Parse the COUNT option if any. */
+    if (c->argc > 4) {
+        for (int j = 4; j < c->argc; j++) {
+            int additional = c->argc-j-1;
+            if (strcasecmp(c->argv[j]->ptr,"COUNT") == 0 && additional >= 1) {
+                if (getLongLongFromObjectOrReply(c,c->argv[j+1],&count,NULL)
+                    != C_OK) return;
+                if (count < 0) count = 0;
+                j++; /* Consume additional arg. */
+            } else {
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+    }
+
+    /* Return the specified range to the user. */
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray)) == NULL ||
+         checkType(c,o,OBJ_STREAM)) return;
+
+    s = o->ptr;
+
+    if (count == 0) {
+        addReplyNullArray(c);
+    } else {
+        if (count == -1) count = 0;
+        streamReplyWithRange(c,s,&startid,&endid,count,rev,NULL,NULL,0,NULL);
+    }
+}
+
+/* XRANGE key start end [COUNT <n>] */
+void xrangeCommand(client *c) {
+    xrangeGenericCommand(c,0);
+}
+
+/* XREVRANGE key end start [COUNT <n>] */
+void xrevrangeCommand(client *c) {
+    xrangeGenericCommand(c,1);
+}
+
+/* XLEN */
+void xlenCommand(client *c) {
+    robj *o;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL
+        || checkType(c,o,OBJ_STREAM)) return;
+    stream *s = o->ptr;
+    addReplyLongLong(c,s->length);
+}
+
+/* XREAD [BLOCK <milliseconds>] [COUNT <count>] STREAMS key_1 key_2 ... key_N
+ *       ID_1 ID_2 ... ID_N
+ *
+ * This function also implements the XREAD-GROUP command, which is like XREAD
+ * but accepting the [GROUP group-name consumer-name] additional option.
+ * This is useful because while XREAD is a read command and can be called
+ * on slaves, XREAD-GROUP is not. */
+#define XREAD_BLOCKED_DEFAULT_COUNT 1000
+void xreadCommand(client *c) {
+    long long timeout = -1; /* -1 means, no BLOCK argument given. */
+    long long count = 0;
+    int streams_count = 0;
+    int streams_arg = 0;
+    int noack = 0;          /* True if NOACK option was specified. */
+    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
+    streamID *ids = static_ids;
+    streamCG **groups = NULL;
+    int xreadgroup = sdslen(c->argv[0]->ptr) == 10; /* XREAD or XREADGROUP? */
+    robj *groupname = NULL;
+    robj *consumername = NULL;
+
+    /* Parse arguments. */
+    for (int i = 1; i < c->argc; i++) {
+        int moreargs = c->argc-i-1;
+        char *o = c->argv[i]->ptr;
+        if (!strcasecmp(o,"BLOCK") && moreargs) {
+            if (c->flags & CLIENT_LUA) {
+                /*
+                 * Although the CLIENT_DENY_BLOCKING flag should protect from blocking the client
+                 * on Lua/MULTI/RM_Call we want special treatment for Lua to keep backword compatibility.
+                 * There is no sense to use BLOCK option within Lua. */
+                addReplyErrorFormat(c, "%s command is not allowed with BLOCK option from scripts", (char *)c->argv[0]->ptr);
+                return;
+            }
+            i++;
+            if (getTimeoutFromObjectOrReply(c,c->argv[i],&timeout,
+                UNIT_MILLISECONDS) != C_OK) return;
+        } else if (!strcasecmp(o,"COUNT") && moreargs) {
+            i++;
+            if (getLongLongFromObjectOrReply(c,c->argv[i],&count,NULL) != C_OK)
+                return;
+            if (count < 0) count = 0;
+        } else if (!strcasecmp(o,"STREAMS") && moreargs) {
+            streams_arg = i+1;
+            streams_count = (c->argc-streams_arg);
+            if ((streams_count % 2) != 0) {
+                addReplyError(c,"Unbalanced XREAD list of streams: "
+                                "for each stream key an ID or '$' must be "
+                                "specified.");
+                return;
+            }
+            streams_count /= 2; /* We have two arguments for each stream. */
+            break;
+        } else if (!strcasecmp(o,"GROUP") && moreargs >= 2) {
+            if (!xreadgroup) {
+                addReplyError(c,"The GROUP option is only supported by "
+                                "XREADGROUP. You called XREAD instead.");
+                return;
+            }
+            groupname = c->argv[i+1];
+            consumername = c->argv[i+2];
+            i += 2;
+        } else if (!strcasecmp(o,"NOACK")) {
+            if (!xreadgroup) {
+                addReplyError(c,"The NOACK option is only supported by "
+                                "XREADGROUP. You called XREAD instead.");
+                return;
+            }
+            noack = 1;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    /* STREAMS option is mandatory. */
+    if (streams_arg == 0) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* If the user specified XREADGROUP then it must also
+     * provide the GROUP option. */
+    if (xreadgroup && groupname == NULL) {
+        addReplyError(c,"Missing GROUP option for XREADGROUP");
+        return;
+    }
+
+    /* Parse the IDs and resolve the group name. */
+    if (streams_count > STREAMID_STATIC_VECTOR_LEN)
+        ids = zmalloc(sizeof(streamID)*streams_count);
+    if (groupname) groups = zmalloc(sizeof(streamCG*)*streams_count);
+
+    for (int i = streams_arg + streams_count; i < c->argc; i++) {
+        /* Specifying "$" as last-known-id means that the client wants to be
+         * served with just the messages that will arrive into the stream
+         * starting from now. */
+        int id_idx = i - streams_arg - streams_count;
+        robj *key = c->argv[i-streams_count];
+        robj *o = lookupKeyRead(c->db,key);
+        if (checkType(c,o,OBJ_STREAM)) goto cleanup;
+        streamCG *group = NULL;
+
+        /* If a group was specified, than we need to be sure that the
+         * key and group actually exist. */
+        if (groupname) {
+            if (o == NULL ||
+                (group = streamLookupCG(o->ptr,groupname->ptr)) == NULL)
+            {
+                addReplyErrorFormat(c, "-NOGROUP No such key '%s' or consumer "
+                                       "group '%s' in XREADGROUP with GROUP "
+                                       "option",
+                                    (char*)key->ptr,(char*)groupname->ptr);
+                goto cleanup;
+            }
+            groups[id_idx] = group;
+        }
+
+        if (strcmp(c->argv[i]->ptr,"$") == 0) {
+            if (xreadgroup) {
+                addReplyError(c,"The $ ID is meaningless in the context of "
+                                "XREADGROUP: you want to read the history of "
+                                "this consumer by specifying a proper ID, or "
+                                "use the > ID to get new messages. The $ ID would "
+                                "just return an empty result set.");
+                goto cleanup;
+            }
+            if (o) {
+                stream *s = o->ptr;
+                ids[id_idx] = s->last_id;
+            } else {
+                ids[id_idx].ms = 0;
+                ids[id_idx].seq = 0;
+            }
+            continue;
+        } else if (strcmp(c->argv[i]->ptr,">") == 0) {
+            if (!xreadgroup) {
+                addReplyError(c,"The > ID can be specified only when calling "
+                                "XREADGROUP using the GROUP <group> "
+                                "<consumer> option.");
+                goto cleanup;
+            }
+            /* We use just the maximum ID to signal this is a ">" ID, anyway
+             * the code handling the blocking clients will have to update the
+             * ID later in order to match the changing consumer group last ID. */
+            ids[id_idx].ms = UINT64_MAX;
+            ids[id_idx].seq = UINT64_MAX;
+            continue;
+        }
+        if (streamParseStrictIDOrReply(c,c->argv[i],ids+id_idx,0) != C_OK)
+            goto cleanup;
+    }
+
+    /* Try to serve the client synchronously. */
+    size_t arraylen = 0;
+    void *arraylen_ptr = NULL;
+    for (int i = 0; i < streams_count; i++) {
+        robj *o = lookupKeyRead(c->db,c->argv[streams_arg+i]);
+        if (o == NULL) continue;
+        stream *s = o->ptr;
+        streamID *gt = ids+i; /* ID must be greater than this. */
+        int serve_synchronously = 0;
+        int serve_history = 0; /* True for XREADGROUP with ID != ">". */
+
+        /* Check if there are the conditions to serve the client
+         * synchronously. */
+        if (groups) {
+            /* If the consumer is blocked on a group, we always serve it
+             * synchronously (serving its local history) if the ID specified
+             * was not the special ">" ID. */
+            if (gt->ms != UINT64_MAX ||
+                gt->seq != UINT64_MAX)
+            {
+                serve_synchronously = 1;
+                serve_history = 1;
+            } else if (s->length) {
+                /* We also want to serve a consumer in a consumer group
+                 * synchronously in case the group top item delivered is smaller
+                 * than what the stream has inside. */
+                streamID maxid, *last = &groups[i]->last_id;
+                streamLastValidID(s, &maxid);
+                if (streamCompareID(&maxid, last) > 0) {
+                    serve_synchronously = 1;
+                    *gt = *last;
+                }
+            }
+        } else if (s->length) {
+            /* For consumers without a group, we serve synchronously if we can
+             * actually provide at least one item from the stream. */
+            streamID maxid;
+            streamLastValidID(s, &maxid);
+            if (streamCompareID(&maxid, gt) > 0) {
+                serve_synchronously = 1;
+            }
+        }
+
+        if (serve_synchronously) {
+            arraylen++;
+            if (arraylen == 1) arraylen_ptr = addReplyDeferredLen(c);
+            /* streamReplyWithRange() handles the 'start' ID as inclusive,
+             * so start from the next ID, since we want only messages with
+             * IDs greater than start. */
+            streamID start = *gt;
+            streamIncrID(&start);
+
+            /* Emit the two elements sub-array consisting of the name
+             * of the stream and the data we extracted from it. */
+            if (c->resp == 2) addReplyArrayLen(c,2);
+            addReplyBulk(c,c->argv[streams_arg+i]);
+            int created = 0;
+            streamConsumer *consumer = NULL;
+            if (groups) consumer = streamLookupConsumer(groups[i],
+                                                        consumername->ptr,
+                                                        SLC_NONE,
+                                                        &created);
+            streamPropInfo spi = {c->argv[i+streams_arg],groupname};
+            if (created && noack)
+                streamPropagateConsumerCreation(c,spi.keyname,
+                                                spi.groupname,
+                                                consumer->name);
+            int flags = 0;
+            if (noack) flags |= STREAM_RWR_NOACK;
+            if (serve_history) flags |= STREAM_RWR_HISTORY;
+            streamReplyWithRange(c,s,&start,NULL,count,0,
+                                 groups ? groups[i] : NULL,
+                                 consumer, flags, &spi);
+            if (groups) server.dirty++;
+        }
+    }
+
+     /* We replied synchronously! Set the top array len and return to caller. */
+    if (arraylen) {
+        if (c->resp == 2)
+            setDeferredArrayLen(c,arraylen_ptr,arraylen);
+        else
+            setDeferredMapLen(c,arraylen_ptr,arraylen);
+        goto cleanup;
+    }
+
+    /* Block if needed. */
+    if (timeout != -1) {
+        /* If we are not allowed to block the client, the only thing
+         * we can do is treating it as a timeout (even with timeout 0). */
+        if (c->flags & CLIENT_DENY_BLOCKING) {
+            addReplyNullArray(c);
+            goto cleanup;
+        }
+        blockForKeys(c, BLOCKED_STREAM, c->argv+streams_arg, streams_count,
+                     timeout, NULL, NULL, ids);
+        /* If no COUNT is given and we block, set a relatively small count:
+         * in case the ID provided is too low, we do not want the server to
+         * block just to serve this client a huge stream of messages. */
+        c->bpop.xread_count = count ? count : XREAD_BLOCKED_DEFAULT_COUNT;
+
+        /* If this is a XREADGROUP + GROUP we need to remember for which
+         * group and consumer name we are blocking, so later when one of the
+         * keys receive more data, we can call streamReplyWithRange() passing
+         * the right arguments. */
+        if (groupname) {
+            incrRefCount(groupname);
+            incrRefCount(consumername);
+            c->bpop.xread_group = groupname;
+            c->bpop.xread_consumer = consumername;
+            c->bpop.xread_group_noack = noack;
+        } else {
+            c->bpop.xread_group = NULL;
+            c->bpop.xread_consumer = NULL;
+        }
+        goto cleanup;
+    }
+
+    /* No BLOCK option, nor any stream we can serve. Reply as with a
+     * timeout happened. */
+    addReplyNullArray(c);
+    /* Continue to cleanup... */
+
+cleanup: /* Cleanup. */
+
+    /* The command is propagated (in the READGROUP form) as a side effect
+     * of calling lower level APIs. So stop any implicit propagation. */
+    preventCommandPropagation(c);
+    if (ids != static_ids) zfree(ids);
+    zfree(groups);
+}
+
+/* -----------------------------------------------------------------------
+ * Low level implementation of consumer groups
+ * ----------------------------------------------------------------------- */
+
+/* Create a NACK entry setting the delivery count to 1 and the delivery
+ * time to the current time. The NACK consumer will be set to the one
+ * specified as argument of the function. */
+streamNACK *streamCreateNACK(streamConsumer *consumer) {
+    streamNACK *nack = zmalloc(sizeof(*nack));
+    nack->delivery_time = mstime();
+    nack->delivery_count = 1;
+    nack->consumer = consumer;
+    return nack;
+}
+
+/* Free a NACK entry. */
+void streamFreeNACK(streamNACK *na) {
+    zfree(na);
+}
+
+/* Free a consumer and associated data structures. Note that this function
+ * will not reassign the pending messages associated with this consumer
+ * nor will delete them from the stream, so when this function is called
+ * to delete a consumer, and not when the whole stream is destroyed, the caller
+ * should do some work before. */
+void streamFreeConsumer(streamConsumer *sc) {
+    raxFree(sc->pel); /* No value free callback: the PEL entries are shared
+                         between the consumer and the main stream PEL. */
+    sdsfree(sc->name);
+    zfree(sc);
+}
+
+/* Create a new consumer group in the context of the stream 's', having the
+ * specified name and last server ID. If a consumer group with the same name
+ * already existed NULL is returned, otherwise the pointer to the consumer
+ * group is returned. */
+streamCG *streamCreateCG(stream *s, char *name, size_t namelen, streamID *id) {
+    if (s->cgroups == NULL) s->cgroups = raxNew();
+    if (raxFind(s->cgroups,(unsigned char*)name,namelen) != raxNotFound)
+        return NULL;
+
+    streamCG *cg = zmalloc(sizeof(*cg));
+    cg->pel = raxNew();
+    cg->consumers = raxNew();
+    cg->last_id = *id;
+    raxInsert(s->cgroups,(unsigned char*)name,namelen,cg,NULL);
+    return cg;
+}
+
+/* Free a consumer group and all its associated data. */
+void streamFreeCG(streamCG *cg) {
+    raxFreeWithCallback(cg->pel,(void(*)(void*))streamFreeNACK);
+    raxFreeWithCallback(cg->consumers,(void(*)(void*))streamFreeConsumer);
+    zfree(cg);
+}
+
+/* Lookup the consumer group in the specified stream and returns its
+ * pointer, otherwise if there is no such group, NULL is returned. */
+streamCG *streamLookupCG(stream *s, sds groupname) {
+    if (s->cgroups == NULL) return NULL;
+    streamCG *cg = raxFind(s->cgroups,(unsigned char*)groupname,
+                           sdslen(groupname));
+    return (cg == raxNotFound) ? NULL : cg;
+}
+
+/* Lookup the consumer with the specified name in the group 'cg': if the
+ * consumer does not exist it is created unless SLC_NOCREAT flag was specified.
+ * Its last seen time is updated unless SLC_NOREFRESH flag was specified. */
+streamConsumer *streamLookupConsumer(streamCG *cg, sds name, int flags, int *created) {
+    if (created) *created = 0;
+    int create = !(flags & SLC_NOCREAT);
+    int refresh = !(flags & SLC_NOREFRESH);
+    streamConsumer *consumer = raxFind(cg->consumers,(unsigned char*)name,
+                               sdslen(name));
+    if (consumer == raxNotFound) {
+        if (!create) return NULL;
+        consumer = zmalloc(sizeof(*consumer));
+        consumer->name = sdsdup(name);
+        consumer->pel = raxNew();
+        raxInsert(cg->consumers,(unsigned char*)name,sdslen(name),
+                  consumer,NULL);
+        consumer->seen_time = mstime();
+        if (created) *created = 1;
+    } else if (refresh)
+        consumer->seen_time = mstime();
+    return consumer;
+}
+
+/* Delete the consumer specified in the consumer group 'cg'. The consumer
+ * may have pending messages: they are removed from the PEL, and the number
+ * of pending messages "lost" is returned. */
+uint64_t streamDelConsumer(streamCG *cg, sds name) {
+    streamConsumer *consumer =
+        streamLookupConsumer(cg,name,SLC_NOCREAT|SLC_NOREFRESH,NULL);
+    if (consumer == NULL) return 0;
+
+    uint64_t retval = raxSize(consumer->pel);
+
+    /* Iterate all the consumer pending messages, deleting every corresponding
+     * entry from the global entry. */
+    raxIterator ri;
+    raxStart(&ri,consumer->pel);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        streamNACK *nack = ri.data;
+        raxRemove(cg->pel,ri.key,ri.key_len,NULL);
+        streamFreeNACK(nack);
+    }
+    raxStop(&ri);
+
+    /* Deallocate the consumer. */
+    raxRemove(cg->consumers,(unsigned char*)name,sdslen(name),NULL);
+    streamFreeConsumer(consumer);
+    return retval;
+}
+
+/* -----------------------------------------------------------------------
+ * Consumer groups commands
+ * ----------------------------------------------------------------------- */
+
+/* XGROUP CREATE <key> <groupname> <id or $> [MKSTREAM]
+ * XGROUP SETID <key> <groupname> <id or $>
+ * XGROUP DESTROY <key> <groupname>
+ * XGROUP CREATECONSUMER <key> <groupname> <consumer>
+ * XGROUP DELCONSUMER <key> <groupname> <consumername> */
+void xgroupCommand(client *c) {
+    stream *s = NULL;
+    sds grpname = NULL;
+    streamCG *cg = NULL;
+    char *opt = c->argv[1]->ptr; /* Subcommand name. */
+    int mkstream = 0;
+    robj *o;
+
+    /* CREATE has an MKSTREAM option that creates the stream if it
+     * does not exist. */
+    if (c->argc == 6 && !strcasecmp(opt,"CREATE")) {
+        if (strcasecmp(c->argv[5]->ptr,"MKSTREAM")) {
+            addReplySubcommandSyntaxError(c);
+            return;
+        }
+        mkstream = 1;
+        grpname = c->argv[3]->ptr;
+    }
+
+    /* Everything but the "HELP" option requires a key and group name. */
+    if (c->argc >= 4) {
+        o = lookupKeyWrite(c->db,c->argv[2]);
+        if (o) {
+            if (checkType(c,o,OBJ_STREAM)) return;
+            s = o->ptr;
+        }
+        grpname = c->argv[3]->ptr;
+    }
+
+    /* Check for missing key/group. */
+    if (c->argc >= 4 && !mkstream) {
+        /* At this point key must exist, or there is an error. */
+        if (s == NULL) {
+            addReplyError(c,
+                "The XGROUP subcommand requires the key to exist. "
+                "Note that for CREATE you may want to use the MKSTREAM "
+                "option to create an empty stream automatically.");
+            return;
+        }
+
+        /* Certain subcommands require the group to exist. */
+        if ((cg = streamLookupCG(s,grpname)) == NULL &&
+            (!strcasecmp(opt,"SETID") ||
+             !strcasecmp(opt,"CREATECONSUMER") ||
+             !strcasecmp(opt,"DELCONSUMER")))
+        {
+            addReplyErrorFormat(c, "-NOGROUP No such consumer group '%s' "
+                                   "for key name '%s'",
+                                   (char*)grpname, (char*)c->argv[2]->ptr);
+            return;
+        }
+    }
+
+    /* Dispatch the different subcommands. */
+    if (c->argc == 2 && !strcasecmp(opt,"HELP")) {
+        const char *help[] = {
+"CREATE <key> <groupname> <id|$> [option]",
+"    Create a new consumer group. Options are:",
+"    * MKSTREAM",
+"      Create the empty stream if it does not exist.",
+"CREATECONSUMER <key> <groupname> <consumer>",
+"    Create a new consumer in the specified group.",
+"DELCONSUMER <key> <groupname> <consumer>",
+"    Remove the specified consumer.",
+"DESTROY <key> <groupname>"
+"    Remove the specified group.",
+"SETID <key> <groupname> <id|$>",
+"    Set the current group ID.",
+NULL
+        };
+        addReplyHelp(c, help);
+    } else if (!strcasecmp(opt,"CREATE") && (c->argc == 5 || c->argc == 6)) {
+        streamID id;
+        if (!strcmp(c->argv[4]->ptr,"$")) {
+            if (s) {
+                id = s->last_id;
+            } else {
+                id.ms = 0;
+                id.seq = 0;
+            }
+        } else if (streamParseStrictIDOrReply(c,c->argv[4],&id,0) != C_OK) {
+            return;
+        }
+
+        /* Handle the MKSTREAM option now that the command can no longer fail. */
+        if (s == NULL) {
+            serverAssert(mkstream);
+            o = createStreamObject();
+            dbAdd(c->db,c->argv[2],o);
+            s = o->ptr;
+            signalModifiedKey(c,c->db,c->argv[2]);
+        }
+
+        streamCG *cg = streamCreateCG(s,grpname,sdslen(grpname),&id);
+        if (cg) {
+            addReply(c,shared.ok);
+            server.dirty++;
+            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-create",
+                                c->argv[2],c->db->id);
+        } else {
+            addReplyError(c,"-BUSYGROUP Consumer Group name already exists");
+        }
+    } else if (!strcasecmp(opt,"SETID") && c->argc == 5) {
+        streamID id;
+        if (!strcmp(c->argv[4]->ptr,"$")) {
+            id = s->last_id;
+        } else if (streamParseIDOrReply(c,c->argv[4],&id,0) != C_OK) {
+            return;
+        }
+        cg->last_id = id;
+        addReply(c,shared.ok);
+        server.dirty++;
+        notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-setid",c->argv[2],c->db->id);
+    } else if (!strcasecmp(opt,"DESTROY") && c->argc == 4) {
+        if (cg) {
+            raxRemove(s->cgroups,(unsigned char*)grpname,sdslen(grpname),NULL);
+            streamFreeCG(cg);
+            addReply(c,shared.cone);
+            server.dirty++;
+            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-destroy",
+                                c->argv[2],c->db->id);
+            /* We want to unblock any XREADGROUP consumers with -NOGROUP. */
+            signalKeyAsReady(c->db,c->argv[2],OBJ_STREAM);
+        } else {
+            addReply(c,shared.czero);
+        }
+    } else if (!strcasecmp(opt,"CREATECONSUMER") && c->argc == 5) {
+        int created = 0;
+        streamLookupConsumer(cg,c->argv[4]->ptr,SLC_NOREFRESH,&created);
+        if (created) {
+            server.dirty++;
+            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-createconsumer",
+                                c->argv[2],c->db->id);
+        }
+        addReplyLongLong(c,created);
+    } else if (!strcasecmp(opt,"DELCONSUMER") && c->argc == 5) {
+        /* Delete the consumer and returns the number of pending messages
+         * that were yet associated with such a consumer. */
+        long long pending = streamDelConsumer(cg,c->argv[4]->ptr);
+        addReplyLongLong(c,pending);
+        server.dirty++;
+        notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-delconsumer",
+                            c->argv[2],c->db->id);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* XSETID <stream> <id>
+ *
+ * Set the internal "last ID" of a stream. */
+void xsetidCommand(client *c) {
+    robj *o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr);
+    if (o == NULL || checkType(c,o,OBJ_STREAM)) return;
+
+    stream *s = o->ptr;
+    streamID id;
+    if (streamParseStrictIDOrReply(c,c->argv[2],&id,0) != C_OK) return;
+
+    /* If the stream has at least one item, we want to check that the user
+     * is setting a last ID that is equal or greater than the current top
+     * item, otherwise the fundamental ID monotonicity assumption is violated. */
+    if (s->length > 0) {
+        streamID maxid;
+        streamLastValidID(s,&maxid);
+
+        if (streamCompareID(&id,&maxid) < 0) {
+            addReplyError(c,"The ID specified in XSETID is smaller than the "
+                            "target stream top item");
+            return;
+        }
+    }
+    s->last_id = id;
+    addReply(c,shared.ok);
+    server.dirty++;
+    notifyKeyspaceEvent(NOTIFY_STREAM,"xsetid",c->argv[1],c->db->id);
+}
+
+/* XACK <key> <group> <id> <id> ... <id>
+ *
+ * Acknowledge a message as processed. In practical terms we just check the
+ * pendine entries list (PEL) of the group, and delete the PEL entry both from
+ * the group and the consumer (pending messages are referenced in both places).
+ *
+ * Return value of the command is the number of messages successfully
+ * acknowledged, that is, the IDs we were actually able to resolve in the PEL.
+ */
+void xackCommand(client *c) {
+    streamCG *group = NULL;
+    robj *o = lookupKeyRead(c->db,c->argv[1]);
+    if (o) {
+        if (checkType(c,o,OBJ_STREAM)) return; /* Type error. */
+        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
+    }
+
+    /* No key or group? Nothing to ack. */
+    if (o == NULL || group == NULL) {
+        addReply(c,shared.czero);
+        return;
+    }
+
+    /* Start parsing the IDs, so that we abort ASAP if there is a syntax
+     * error: the return value of this command cannot be an error in case
+     * the client successfully acknowledged some messages, so it should be
+     * executed in a "all or nothing" fashion. */
+    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
+    streamID *ids = static_ids;
+    int id_count = c->argc-3;
+    if (id_count > STREAMID_STATIC_VECTOR_LEN)
+        ids = zmalloc(sizeof(streamID)*id_count);
+    for (int j = 3; j < c->argc; j++) {
+        if (streamParseStrictIDOrReply(c,c->argv[j],&ids[j-3],0) != C_OK) goto cleanup;
+    }
+
+    int acknowledged = 0;
+    for (int j = 3; j < c->argc; j++) {
+        unsigned char buf[sizeof(streamID)];
+        streamEncodeID(buf,&ids[j-3]);
+
+        /* Lookup the ID in the group PEL: it will have a reference to the
+         * NACK structure that will have a reference to the consumer, so that
+         * we are able to remove the entry from both PELs. */
+        streamNACK *nack = raxFind(group->pel,buf,sizeof(buf));
+        if (nack != raxNotFound) {
+            raxRemove(group->pel,buf,sizeof(buf),NULL);
+            raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
+            streamFreeNACK(nack);
+            acknowledged++;
+            server.dirty++;
+        }
+    }
+    addReplyLongLong(c,acknowledged);
+cleanup:
+    if (ids != static_ids) zfree(ids);
+}
+
+/* XPENDING <key> <group> [[IDLE <idle>] <start> <stop> <count> [<consumer>]]
+ *
+ * If start and stop are omitted, the command just outputs information about
+ * the amount of pending messages for the key/group pair, together with
+ * the minimum and maximum ID of pending messages.
+ *
+ * If start and stop are provided instead, the pending messages are returned
+ * with information about the current owner, number of deliveries and last
+ * delivery time and so forth. */
+void xpendingCommand(client *c) {
+    int justinfo = c->argc == 3; /* Without the range just outputs general
+                                    informations about the PEL. */
+    robj *key = c->argv[1];
+    robj *groupname = c->argv[2];
+    robj *consumername = NULL;
+    streamID startid, endid;
+    long long count = 0;
+    long long minidle = 0;
+    int startex = 0, endex = 0;
+
+    /* Start and stop, and the consumer, can be omitted. Also the IDLE modifier. */
+    if (c->argc != 3 && (c->argc < 6 || c->argc > 9)) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* Parse start/end/count arguments ASAP if needed, in order to report
+     * syntax errors before any other error. */
+    if (c->argc >= 6) {
+        int startidx = 3; /* Without IDLE */
+
+        if (!strcasecmp(c->argv[3]->ptr, "IDLE")) {
+            if (getLongLongFromObjectOrReply(c, c->argv[4], &minidle, NULL) == C_ERR)
+                return;
+            if (c->argc < 8) {
+                /* If IDLE was provided we must have at least 'start end count' */
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+            /* Search for rest of arguments after 'IDLE <idle>' */
+            startidx += 2;
+        }
+
+        /* count argument. */
+        if (getLongLongFromObjectOrReply(c,c->argv[startidx+2],&count,NULL) == C_ERR)
+            return;
+        if (count < 0) count = 0;
+
+        /* start and end arguments. */
+        if (streamParseIntervalIDOrReply(c,c->argv[startidx],&startid,&startex,0) != C_OK)
+            return;
+        if (startex && streamIncrID(&startid) != C_OK) {
+            addReplyError(c,"invalid start ID for the interval");
+            return;
+        }
+        if (streamParseIntervalIDOrReply(c,c->argv[startidx+1],&endid,&endex,UINT64_MAX) != C_OK)
+            return;
+        if (endex && streamDecrID(&endid) != C_OK) {
+            addReplyError(c,"invalid end ID for the interval");
+            return;
+        }
+
+        if (startidx+3 < c->argc) {
+            /* 'consumer' was provided */
+            consumername = c->argv[startidx+3];
+        }
+    }
+
+    /* Lookup the key and the group inside the stream. */
+    robj *o = lookupKeyRead(c->db,c->argv[1]);
+    streamCG *group;
+
+    if (checkType(c,o,OBJ_STREAM)) return;
+    if (o == NULL ||
+        (group = streamLookupCG(o->ptr,groupname->ptr)) == NULL)
+    {
+        addReplyErrorFormat(c, "-NOGROUP No such key '%s' or consumer "
+                               "group '%s'",
+                               (char*)key->ptr,(char*)groupname->ptr);
+        return;
+    }
+
+    /* XPENDING <key> <group> variant. */
+    if (justinfo) {
+        addReplyArrayLen(c,4);
+        /* Total number of messages in the PEL. */
+        addReplyLongLong(c,raxSize(group->pel));
+        /* First and last IDs. */
+        if (raxSize(group->pel) == 0) {
+            addReplyNull(c); /* Start. */
+            addReplyNull(c); /* End. */
+            addReplyNullArray(c); /* Clients. */
+        } else {
+            /* Start. */
+            raxIterator ri;
+            raxStart(&ri,group->pel);
+            raxSeek(&ri,"^",NULL,0);
+            raxNext(&ri);
+            streamDecodeID(ri.key,&startid);
+            addReplyStreamID(c,&startid);
+
+            /* End. */
+            raxSeek(&ri,"$",NULL,0);
+            raxNext(&ri);
+            streamDecodeID(ri.key,&endid);
+            addReplyStreamID(c,&endid);
+            raxStop(&ri);
+
+            /* Consumers with pending messages. */
+            raxStart(&ri,group->consumers);
+            raxSeek(&ri,"^",NULL,0);
+            void *arraylen_ptr = addReplyDeferredLen(c);
+            size_t arraylen = 0;
+            while(raxNext(&ri)) {
+                streamConsumer *consumer = ri.data;
+                if (raxSize(consumer->pel) == 0) continue;
+                addReplyArrayLen(c,2);
+                addReplyBulkCBuffer(c,ri.key,ri.key_len);
+                addReplyBulkLongLong(c,raxSize(consumer->pel));
+                arraylen++;
+            }
+            setDeferredArrayLen(c,arraylen_ptr,arraylen);
+            raxStop(&ri);
+        }
+    } else { /* <start>, <stop> and <count> provided, return actual pending entries (not just info) */
+        streamConsumer *consumer = NULL;
+        if (consumername) {
+            consumer = streamLookupConsumer(group,
+                                            consumername->ptr,
+                                            SLC_NOCREAT|SLC_NOREFRESH,
+                                            NULL);
+
+            /* If a consumer name was mentioned but it does not exist, we can
+             * just return an empty array. */
+            if (consumer == NULL) {
+                addReplyArrayLen(c,0);
+                return;
+            }
+        }
+
+        rax *pel = consumer ? consumer->pel : group->pel;
+        unsigned char startkey[sizeof(streamID)];
+        unsigned char endkey[sizeof(streamID)];
+        raxIterator ri;
+        mstime_t now = mstime();
+
+        streamEncodeID(startkey,&startid);
+        streamEncodeID(endkey,&endid);
+        raxStart(&ri,pel);
+        raxSeek(&ri,">=",startkey,sizeof(startkey));
+        void *arraylen_ptr = addReplyDeferredLen(c);
+        size_t arraylen = 0;
+
+        while(count && raxNext(&ri) && memcmp(ri.key,endkey,ri.key_len) <= 0) {
+            streamNACK *nack = ri.data;
+
+            if (minidle) {
+                mstime_t this_idle = now - nack->delivery_time;
+                if (this_idle < minidle) continue;
+            }
+
+            arraylen++;
+            count--;
+            addReplyArrayLen(c,4);
+
+            /* Entry ID. */
+            streamID id;
+            streamDecodeID(ri.key,&id);
+            addReplyStreamID(c,&id);
+
+            /* Consumer name. */
+            addReplyBulkCBuffer(c,nack->consumer->name,
+                                sdslen(nack->consumer->name));
+
+            /* Milliseconds elapsed since last delivery. */
+            mstime_t elapsed = now - nack->delivery_time;
+            if (elapsed < 0) elapsed = 0;
+            addReplyLongLong(c,elapsed);
+
+            /* Number of deliveries. */
+            addReplyLongLong(c,nack->delivery_count);
+        }
+        raxStop(&ri);
+        setDeferredArrayLen(c,arraylen_ptr,arraylen);
+    }
+}
+
+/* XCLAIM <key> <group> <consumer> <min-idle-time> <ID-1> <ID-2>
+ *        [IDLE <milliseconds>] [TIME <mstime>] [RETRYCOUNT <count>]
+ *        [FORCE] [JUSTID]
+ *
+ * Gets ownership of one or multiple messages in the Pending Entries List
+ * of a given stream consumer group.
+ *
+ * If the message ID (among the specified ones) exists, and its idle
+ * time greater or equal to <min-idle-time>, then the message new owner
+ * becomes the specified <consumer>. If the minimum idle time specified
+ * is zero, messages are claimed regardless of their idle time.
+ *
+ * All the messages that cannot be found inside the pending entries list
+ * are ignored, but in case the FORCE option is used. In that case we
+ * create the NACK (representing a not yet acknowledged message) entry in
+ * the consumer group PEL.
+ *
+ * This command creates the consumer as side effect if it does not yet
+ * exists. Moreover the command reset the idle time of the message to 0,
+ * even if by using the IDLE or TIME options, the user can control the
+ * new idle time.
+ *
+ * The options at the end can be used in order to specify more attributes
+ * to set in the representation of the pending message:
+ *
+ * 1. IDLE <ms>:
+ *      Set the idle time (last time it was delivered) of the message.
+ *      If IDLE is not specified, an IDLE of 0 is assumed, that is,
+ *      the time count is reset because the message has now a new
+ *      owner trying to process it.
+ *
+ * 2. TIME <ms-unix-time>:
+ *      This is the same as IDLE but instead of a relative amount of
+ *      milliseconds, it sets the idle time to a specific unix time
+ *      (in milliseconds). This is useful in order to rewrite the AOF
+ *      file generating XCLAIM commands.
+ *
+ * 3. RETRYCOUNT <count>:
+ *      Set the retry counter to the specified value. This counter is
+ *      incremented every time a message is delivered again. Normally
+ *      XCLAIM does not alter this counter, which is just served to clients
+ *      when the XPENDING command is called: this way clients can detect
+ *      anomalies, like messages that are never processed for some reason
+ *      after a big number of delivery attempts.
+ *
+ * 4. FORCE:
+ *      Creates the pending message entry in the PEL even if certain
+ *      specified IDs are not already in the PEL assigned to a different
+ *      client. However the message must be exist in the stream, otherwise
+ *      the IDs of non existing messages are ignored.
+ *
+ * 5. JUSTID:
+ *      Return just an array of IDs of messages successfully claimed,
+ *      without returning the actual message.
+ *
+ * 6. LASTID <id>:
+ *      Update the consumer group last ID with the specified ID if the
+ *      current last ID is smaller than the provided one.
+ *      This is used for replication / AOF, so that when we read from a
+ *      consumer group, the XCLAIM that gets propagated to give ownership
+ *      to the consumer, is also used in order to update the group current
+ *      ID.
+ *
+ * The command returns an array of messages that the user
+ * successfully claimed, so that the caller is able to understand
+ * what messages it is now in charge of. */
+void xclaimCommand(client *c) {
+    streamCG *group = NULL;
+    robj *o = lookupKeyRead(c->db,c->argv[1]);
+    long long minidle; /* Minimum idle time argument. */
+    long long retrycount = -1;   /* -1 means RETRYCOUNT option not given. */
+    mstime_t deliverytime = -1;  /* -1 means IDLE/TIME options not given. */
+    int force = 0;
+    int justid = 0;
+
+    if (o) {
+        if (checkType(c,o,OBJ_STREAM)) return; /* Type error. */
+        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
+    }
+
+    /* No key or group? Send an error given that the group creation
+     * is mandatory. */
+    if (o == NULL || group == NULL) {
+        addReplyErrorFormat(c,"-NOGROUP No such key '%s' or "
+                              "consumer group '%s'", (char*)c->argv[1]->ptr,
+                              (char*)c->argv[2]->ptr);
+        return;
+    }
+
+    if (getLongLongFromObjectOrReply(c,c->argv[4],&minidle,
+        "Invalid min-idle-time argument for XCLAIM")
+        != C_OK) return;
+    if (minidle < 0) minidle = 0;
+
+    /* Start parsing the IDs, so that we abort ASAP if there is a syntax
+     * error: the return value of this command cannot be an error in case
+     * the client successfully claimed some message, so it should be
+     * executed in a "all or nothing" fashion. */
+    int j;
+    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
+    streamID *ids = static_ids;
+    int id_count = c->argc-5;
+    if (id_count > STREAMID_STATIC_VECTOR_LEN)
+        ids = zmalloc(sizeof(streamID)*id_count);
+    for (j = 5; j < c->argc; j++) {
+        if (streamParseStrictIDOrReply(NULL,c->argv[j],&ids[j-5],0) != C_OK) break;
+    }
+    int last_id_arg = j-1; /* Next time we iterate the IDs we now the range. */
+
+    /* If we stopped because some IDs cannot be parsed, perhaps they
+     * are trailing options. */
+    mstime_t now = mstime();
+    streamID last_id = {0,0};
+    int propagate_last_id = 0;
+    for (; j < c->argc; j++) {
+        int moreargs = (c->argc-1) - j; /* Number of additional arguments. */
+        char *opt = c->argv[j]->ptr;
+        if (!strcasecmp(opt,"FORCE")) {
+            force = 1;
+        } else if (!strcasecmp(opt,"JUSTID")) {
+            justid = 1;
+        } else if (!strcasecmp(opt,"IDLE") && moreargs) {
+            j++;
+            if (getLongLongFromObjectOrReply(c,c->argv[j],&deliverytime,
+                "Invalid IDLE option argument for XCLAIM")
+                != C_OK) goto cleanup;
+            deliverytime = now - deliverytime;
+        } else if (!strcasecmp(opt,"TIME") && moreargs) {
+            j++;
+            if (getLongLongFromObjectOrReply(c,c->argv[j],&deliverytime,
+                "Invalid TIME option argument for XCLAIM")
+                != C_OK) goto cleanup;
+        } else if (!strcasecmp(opt,"RETRYCOUNT") && moreargs) {
+            j++;
+            if (getLongLongFromObjectOrReply(c,c->argv[j],&retrycount,
+                "Invalid RETRYCOUNT option argument for XCLAIM")
+                != C_OK) goto cleanup;
+        } else if (!strcasecmp(opt,"LASTID") && moreargs) {
+            j++;
+            if (streamParseStrictIDOrReply(c,c->argv[j],&last_id,0) != C_OK) goto cleanup;
+        } else {
+            addReplyErrorFormat(c,"Unrecognized XCLAIM option '%s'",opt);
+            goto cleanup;
+        }
+    }
+
+    if (streamCompareID(&last_id,&group->last_id) > 0) {
+        group->last_id = last_id;
+        propagate_last_id = 1;
+    }
+
+    if (deliverytime != -1) {
+        /* If a delivery time was passed, either with IDLE or TIME, we
+         * do some sanity check on it, and set the deliverytime to now
+         * (which is a sane choice usually) if the value is bogus.
+         * To raise an error here is not wise because clients may compute
+         * the idle time doing some math starting from their local time,
+         * and this is not a good excuse to fail in case, for instance,
+         * the computer time is a bit in the future from our POV. */
+        if (deliverytime < 0 || deliverytime > now) deliverytime = now;
+    } else {
+        /* If no IDLE/TIME option was passed, we want the last delivery
+         * time to be now, so that the idle time of the message will be
+         * zero. */
+        deliverytime = now;
+    }
+
+    /* Do the actual claiming. */
+    streamConsumer *consumer = NULL;
+    void *arraylenptr = addReplyDeferredLen(c);
+    size_t arraylen = 0;
+    for (int j = 5; j <= last_id_arg; j++) {
+        streamID id = ids[j-5];
+        unsigned char buf[sizeof(streamID)];
+        streamEncodeID(buf,&id);
+
+        /* Lookup the ID in the group PEL. */
+        streamNACK *nack = raxFind(group->pel,buf,sizeof(buf));
+
+        /* If FORCE is passed, let's check if at least the entry
+         * exists in the Stream. In such case, we'll crate a new
+         * entry in the PEL from scratch, so that XCLAIM can also
+         * be used to create entries in the PEL. Useful for AOF
+         * and replication of consumer groups. */
+        if (force && nack == raxNotFound) {
+            streamIterator myiterator;
+            streamIteratorStart(&myiterator,o->ptr,&id,&id,0);
+            int64_t numfields;
+            int found = 0;
+            streamID item_id;
+            if (streamIteratorGetID(&myiterator,&item_id,&numfields)) found = 1;
+            streamIteratorStop(&myiterator);
+
+            /* Item must exist for us to create a NACK for it. */
+            if (!found) continue;
+
+            /* Create the NACK. */
+            nack = streamCreateNACK(NULL);
+            raxInsert(group->pel,buf,sizeof(buf),nack,NULL);
+        }
+
+        if (nack != raxNotFound) {
+            /* We need to check if the minimum idle time requested
+             * by the caller is satisfied by this entry.
+             *
+             * Note that the nack could be created by FORCE, in this
+             * case there was no pre-existing entry and minidle should
+             * be ignored, but in that case nack->consumer is NULL. */
+            if (nack->consumer && minidle) {
+                mstime_t this_idle = now - nack->delivery_time;
+                if (this_idle < minidle) continue;
+            }
+            if (consumer == NULL)
+                consumer = streamLookupConsumer(group,c->argv[3]->ptr,SLC_NONE,NULL);
+            if (nack->consumer != consumer) {
+                /* Remove the entry from the old consumer.
+                 * Note that nack->consumer is NULL if we created the
+                 * NACK above because of the FORCE option. */
+                if (nack->consumer)
+                    raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
+            }
+            nack->delivery_time = deliverytime;
+            /* Set the delivery attempts counter if given, otherwise
+             * autoincrement unless JUSTID option provided */
+            if (retrycount >= 0) {
+                nack->delivery_count = retrycount;
+            } else if (!justid) {
+                nack->delivery_count++;
+            }
+            if (nack->consumer != consumer) {
+                /* Add the entry in the new consumer local PEL. */
+                raxInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
+                nack->consumer = consumer;
+            }
+            /* Send the reply for this entry. */
+            if (justid) {
+                addReplyStreamID(c,&id);
+            } else {
+                size_t emitted = streamReplyWithRange(c,o->ptr,&id,&id,1,0,
+                                    NULL,NULL,STREAM_RWR_RAWENTRIES,NULL);
+                if (!emitted) addReplyNull(c);
+            }
+            arraylen++;
+
+            /* Propagate this change. */
+            streamPropagateXCLAIM(c,c->argv[1],group,c->argv[2],c->argv[j],nack);
+            propagate_last_id = 0; /* Will be propagated by XCLAIM itself. */
+            server.dirty++;
+        }
+    }
+    if (propagate_last_id) {
+        streamPropagateGroupID(c,c->argv[1],group,c->argv[2]);
+        server.dirty++;
+    }
+    setDeferredArrayLen(c,arraylenptr,arraylen);
+    preventCommandPropagation(c);
+cleanup:
+    if (ids != static_ids) zfree(ids);
+}
+
+/* XAUTOCLAIM <key> <group> <consumer> <min-idle-time> <start> [COUNT <count>] [JUSTID]
+ *
+ * Gets ownership of one or multiple messages in the Pending Entries List
+ * of a given stream consumer group.
+ *
+ * For each PEL entry, if its idle time greater or equal to <min-idle-time>,
+ * then the message new owner becomes the specified <consumer>.
+ * If the minimum idle time specified is zero, messages are claimed
+ * regardless of their idle time.
+ *
+ * This command creates the consumer as side effect if it does not yet
+ * exists. Moreover the command reset the idle time of the message to 0.
+ *
+ * The command returns an array of messages that the user
+ * successfully claimed, so that the caller is able to understand
+ * what messages it is now in charge of. */
+void xautoclaimCommand(client *c) {
+    streamCG *group = NULL;
+    robj *o = lookupKeyRead(c->db,c->argv[1]);
+    long long minidle; /* Minimum idle time argument, in milliseconds. */
+    long count = 100; /* Maximum entries to claim. */
+    streamID startid;
+    int startex;
+    int justid = 0;
+
+    /* Parse idle/start/end/count arguments ASAP if needed, in order to report
+     * syntax errors before any other error. */
+    if (getLongLongFromObjectOrReply(c,c->argv[4],&minidle,"Invalid min-idle-time argument for XAUTOCLAIM") != C_OK)
+        return;
+    if (minidle < 0) minidle = 0;
+
+    if (streamParseIntervalIDOrReply(c,c->argv[5],&startid,&startex,0) != C_OK)
+        return;
+    if (startex && streamIncrID(&startid) != C_OK) {
+        addReplyError(c,"invalid start ID for the interval");
+        return;
+    }
+
+    int j = 6; /* options start at argv[6] */
+    while(j < c->argc) {
+        int moreargs = (c->argc-1) - j; /* Number of additional arguments. */
+        char *opt = c->argv[j]->ptr;
+        if (!strcasecmp(opt,"COUNT") && moreargs) {
+            if (getRangeLongFromObjectOrReply(c,c->argv[j+1],1,LONG_MAX,&count,"COUNT must be > 0") != C_OK)
+                return;
+            j++;
+        } else if (!strcasecmp(opt,"JUSTID")) {
+            justid = 1;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+        j++;
+    }
+
+    if (o) {
+        if (checkType(c,o,OBJ_STREAM))
+            return; /* Type error. */
+        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
+    }
+
+    /* No key or group? Send an error given that the group creation
+     * is mandatory. */
+    if (o == NULL || group == NULL) {
+        addReplyErrorFormat(c,"-NOGROUP No such key '%s' or consumer group '%s'",
+                            (char*)c->argv[1]->ptr,
+                            (char*)c->argv[2]->ptr);
+        return;
+    }
+
+    /* Do the actual claiming. */
+    streamConsumer *consumer = NULL;
+    long long attempts = count*10;
+
+    addReplyArrayLen(c, 2);
+    void *endidptr = addReplyDeferredLen(c);
+    void *arraylenptr = addReplyDeferredLen(c);
+
+    unsigned char startkey[sizeof(streamID)];
+    streamEncodeID(startkey,&startid);
+    raxIterator ri;
+    raxStart(&ri,group->pel);
+    raxSeek(&ri,">=",startkey,sizeof(startkey));
+    size_t arraylen = 0;
+    mstime_t now = mstime();
+    while (attempts-- && count && raxNext(&ri)) {
+        streamNACK *nack = ri.data;
+
+        if (minidle) {
+            mstime_t this_idle = now - nack->delivery_time;
+            if (this_idle < minidle)
+                continue;
+        }
+
+        streamID id;
+        streamDecodeID(ri.key, &id);
+
+        if (consumer == NULL)
+            consumer = streamLookupConsumer(group,c->argv[3]->ptr,SLC_NONE,NULL);
+        if (nack->consumer != consumer) {
+            /* Remove the entry from the old consumer.
+             * Note that nack->consumer is NULL if we created the
+             * NACK above because of the FORCE option. */
+            if (nack->consumer)
+                raxRemove(nack->consumer->pel,ri.key,ri.key_len,NULL);
+        }
+
+        /* Update the consumer and idle time. */
+        nack->delivery_time = now;
+        /* Increment the delivery attempts counter unless JUSTID option provided */
+        if (!justid)
+            nack->delivery_count++;
+
+        if (nack->consumer != consumer) {
+            /* Add the entry in the new consumer local PEL. */
+            raxInsert(consumer->pel,ri.key,ri.key_len,nack,NULL);
+            nack->consumer = consumer;
+        }
+
+        /* Send the reply for this entry. */
+        if (justid) {
+            addReplyStreamID(c,&id);
+        } else {
+            size_t emitted =
+                streamReplyWithRange(c,o->ptr,&id,&id,1,0,NULL,NULL,
+                                     STREAM_RWR_RAWENTRIES,NULL);
+            if (!emitted)
+                addReplyNull(c);
+        }
+        arraylen++;
+        count--;
+
+        /* Propagate this change. */
+        robj *idstr = createObjectFromStreamID(&id);
+        streamPropagateXCLAIM(c,c->argv[1],group,c->argv[2],idstr,nack);
+        decrRefCount(idstr);
+        server.dirty++;
+    }
+
+    /* We need to return the next entry as a cursor for the next XAUTOCLAIM call */
+    raxNext(&ri);
+
+    streamID endid;
+    if (raxEOF(&ri)) {
+        endid.ms = endid.seq = 0;
+    } else {
+        streamDecodeID(ri.key, &endid);
+    }
+    raxStop(&ri);
+
+    setDeferredArrayLen(c,arraylenptr,arraylen);
+    setDeferredReplyStreamID(c,endidptr,&endid);
+
+    preventCommandPropagation(c);
+}
+
+/* XDEL <key> [<ID1> <ID2> ... <IDN>]
+ *
+ * Removes the specified entries from the stream. Returns the number
+ * of items actually deleted, that may be different from the number
+ * of IDs passed in case certain IDs do not exist. */
+void xdelCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL
+        || checkType(c,o,OBJ_STREAM)) return;
+    stream *s = o->ptr;
+
+    /* We need to sanity check the IDs passed to start. Even if not
+     * a big issue, it is not great that the command is only partially
+     * executed because at some point an invalid ID is parsed. */
+    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
+    streamID *ids = static_ids;
+    int id_count = c->argc-2;
+    if (id_count > STREAMID_STATIC_VECTOR_LEN)
+        ids = zmalloc(sizeof(streamID)*id_count);
+    for (int j = 2; j < c->argc; j++) {
+        if (streamParseStrictIDOrReply(c,c->argv[j],&ids[j-2],0) != C_OK) goto cleanup;
+    }
+
+    /* Actually apply the command. */
+    int deleted = 0;
+    for (int j = 2; j < c->argc; j++) {
+        deleted += streamDeleteItem(s,&ids[j-2]);
+    }
+
+    /* Propagate the write if needed. */
+    if (deleted) {
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_STREAM,"xdel",c->argv[1],c->db->id);
+        server.dirty += deleted;
+    }
+    addReplyLongLong(c,deleted);
+cleanup:
+    if (ids != static_ids) zfree(ids);
+}
+
+/* General form: XTRIM <key> [... options ...]
+ *
+ * List of options:
+ *
+ * Trim strategies:
+ *
+ * MAXLEN [~|=] <count>     -- Trim so that the stream will be capped at
+ *                             the specified length. Use ~ before the
+ *                             count in order to demand approximated trimming
+ *                             (like XADD MAXLEN option).
+ * MINID [~|=] <id>         -- Trim so that the stream will not contain entries
+ *                             with IDs smaller than 'id'. Use ~ before the
+ *                             count in order to demand approximated trimming
+ *                             (like XADD MINID option).
+ *
+ * Other options:
+ *
+ * LIMIT <entries>          -- The maximum number of entries to trim.
+ *                             0 means unlimited. Unless specified, it is set
+ *                             to a default of 100*server.stream_node_max_entries,
+ *                             and that's in order to keep the trimming time sane.
+ *                             Has meaning only if `~` was provided.
+ */
+void xtrimCommand(client *c) {
+    robj *o;
+
+    /* Argument parsing. */
+    streamAddTrimArgs parsed_args;
+    if (streamParseAddOrTrimArgsOrReply(c, &parsed_args, 0) < 0)
+        return; /* streamParseAddOrTrimArgsOrReply already replied. */
+
+    /* If the key does not exist, we are ok returning zero, that is, the
+     * number of elements removed from the stream. */
+    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL
+        || checkType(c,o,OBJ_STREAM)) return;
+    stream *s = o->ptr;
+
+    /* Perform the trimming. */
+    int64_t deleted = streamTrim(s, &parsed_args);
+    if (deleted) {
+        notifyKeyspaceEvent(NOTIFY_STREAM,"xtrim",c->argv[1],c->db->id);
+        if (parsed_args.approx_trim) {
+            /* In case our trimming was limited (by LIMIT or by ~) we must
+             * re-write the relevant trim argument to make sure there will be
+             * no inconsistencies in AOF loading or in the replica.
+             * It's enough to check only args->approx because there is no
+             * way LIMIT is given without the ~ option. */
+            streamRewriteApproxSpecifier(c,parsed_args.trim_strategy_arg_idx-1);
+            streamRewriteTrimArgument(c,s,parsed_args.trim_strategy,parsed_args.trim_strategy_arg_idx);
+        }
+
+        /* Propagate the write. */
+        signalModifiedKey(c, c->db,c->argv[1]);
+        server.dirty += deleted;
+    }
+    addReplyLongLong(c,deleted);
+}
+
+/* Helper function for xinfoCommand.
+ * Handles the variants of XINFO STREAM */
+void xinfoReplyWithStreamInfo(client *c, stream *s) {
+    int full = 1;
+    long long count = 10; /* Default COUNT is 10 so we don't block the server */
+    robj **optv = c->argv + 3; /* Options start after XINFO STREAM <key> */
+    int optc = c->argc - 3;
+
+    /* Parse options. */
+    if (optc == 0) {
+        full = 0;
+    } else {
+        /* Valid options are [FULL] or [FULL COUNT <count>] */
+        if (optc != 1 && optc != 3) {
+            addReplySubcommandSyntaxError(c);
+            return;
+        }
+
+        /* First option must be "FULL" */
+        if (strcasecmp(optv[0]->ptr,"full")) {
+            addReplySubcommandSyntaxError(c);
+            return;
+        }
+
+        if (optc == 3) {
+            /* First option must be "FULL" */
+            if (strcasecmp(optv[1]->ptr,"count")) {
+                addReplySubcommandSyntaxError(c);
+                return;
+            }
+            if (getLongLongFromObjectOrReply(c,optv[2],&count,NULL) == C_ERR)
+                return;
+            if (count < 0) count = 10;
+        }
+    }
+
+    addReplyMapLen(c,full ? 6 : 7);
+    addReplyBulkCString(c,"length");
+    addReplyLongLong(c,s->length);
+    addReplyBulkCString(c,"radix-tree-keys");
+    addReplyLongLong(c,raxSize(s->rax));
+    addReplyBulkCString(c,"radix-tree-nodes");
+    addReplyLongLong(c,s->rax->numnodes);
+    addReplyBulkCString(c,"last-generated-id");
+    addReplyStreamID(c,&s->last_id);
+
+    if (!full) {
+        /* XINFO STREAM <key> */
+
+        addReplyBulkCString(c,"groups");
+        addReplyLongLong(c,s->cgroups ? raxSize(s->cgroups) : 0);
+
+        /* To emit the first/last entry we use streamReplyWithRange(). */
+        int emitted;
+        streamID start, end;
+        start.ms = start.seq = 0;
+        end.ms = end.seq = UINT64_MAX;
+        addReplyBulkCString(c,"first-entry");
+        emitted = streamReplyWithRange(c,s,&start,&end,1,0,NULL,NULL,
+                                       STREAM_RWR_RAWENTRIES,NULL);
+        if (!emitted) addReplyNull(c);
+        addReplyBulkCString(c,"last-entry");
+        emitted = streamReplyWithRange(c,s,&start,&end,1,1,NULL,NULL,
+                                       STREAM_RWR_RAWENTRIES,NULL);
+        if (!emitted) addReplyNull(c);
+    } else {
+        /* XINFO STREAM <key> FULL [COUNT <count>] */
+
+        /* Stream entries */
+        addReplyBulkCString(c,"entries");
+        streamReplyWithRange(c,s,NULL,NULL,count,0,NULL,NULL,0,NULL);
+
+        /* Consumer groups */
+        addReplyBulkCString(c,"groups");
+        if (s->cgroups == NULL) {
+            addReplyArrayLen(c,0);
+        } else {
+            addReplyArrayLen(c,raxSize(s->cgroups));
+            raxIterator ri_cgroups;
+            raxStart(&ri_cgroups,s->cgroups);
+            raxSeek(&ri_cgroups,"^",NULL,0);
+            while(raxNext(&ri_cgroups)) {
+                streamCG *cg = ri_cgroups.data;
+                addReplyMapLen(c,5);
+
+                /* Name */
+                addReplyBulkCString(c,"name");
+                addReplyBulkCBuffer(c,ri_cgroups.key,ri_cgroups.key_len);
+
+                /* Last delivered ID */
+                addReplyBulkCString(c,"last-delivered-id");
+                addReplyStreamID(c,&cg->last_id);
+
+                /* Group PEL count */
+                addReplyBulkCString(c,"pel-count");
+                addReplyLongLong(c,raxSize(cg->pel));
+
+                /* Group PEL */
+                addReplyBulkCString(c,"pending");
+                long long arraylen_cg_pel = 0;
+                void *arrayptr_cg_pel = addReplyDeferredLen(c);
+                raxIterator ri_cg_pel;
+                raxStart(&ri_cg_pel,cg->pel);
+                raxSeek(&ri_cg_pel,"^",NULL,0);
+                while(raxNext(&ri_cg_pel) && (!count || arraylen_cg_pel < count)) {
+                    streamNACK *nack = ri_cg_pel.data;
+                    addReplyArrayLen(c,4);
+
+                    /* Entry ID. */
+                    streamID id;
+                    streamDecodeID(ri_cg_pel.key,&id);
+                    addReplyStreamID(c,&id);
+
+                    /* Consumer name. */
+                    serverAssert(nack->consumer); /* assertion for valgrind (avoid NPD) */
+                    addReplyBulkCBuffer(c,nack->consumer->name,
+                                        sdslen(nack->consumer->name));
+
+                    /* Last delivery. */
+                    addReplyLongLong(c,nack->delivery_time);
+
+                    /* Number of deliveries. */
+                    addReplyLongLong(c,nack->delivery_count);
+
+                    arraylen_cg_pel++;
+                }
+                setDeferredArrayLen(c,arrayptr_cg_pel,arraylen_cg_pel);
+                raxStop(&ri_cg_pel);
+
+                /* Consumers */
+                addReplyBulkCString(c,"consumers");
+                addReplyArrayLen(c,raxSize(cg->consumers));
+                raxIterator ri_consumers;
+                raxStart(&ri_consumers,cg->consumers);
+                raxSeek(&ri_consumers,"^",NULL,0);
+                while(raxNext(&ri_consumers)) {
+                    streamConsumer *consumer = ri_consumers.data;
+                    addReplyMapLen(c,4);
+
+                    /* Consumer name */
+                    addReplyBulkCString(c,"name");
+                    addReplyBulkCBuffer(c,consumer->name,sdslen(consumer->name));
+
+                    /* Seen-time */
+                    addReplyBulkCString(c,"seen-time");
+                    addReplyLongLong(c,consumer->seen_time);
+
+                    /* Consumer PEL count */
+                    addReplyBulkCString(c,"pel-count");
+                    addReplyLongLong(c,raxSize(consumer->pel));
+
+                    /* Consumer PEL */
+                    addReplyBulkCString(c,"pending");
+                    long long arraylen_cpel = 0;
+                    void *arrayptr_cpel = addReplyDeferredLen(c);
+                    raxIterator ri_cpel;
+                    raxStart(&ri_cpel,consumer->pel);
+                    raxSeek(&ri_cpel,"^",NULL,0);
+                    while(raxNext(&ri_cpel) && (!count || arraylen_cpel < count)) {
+                        streamNACK *nack = ri_cpel.data;
+                        addReplyArrayLen(c,3);
+
+                        /* Entry ID. */
+                        streamID id;
+                        streamDecodeID(ri_cpel.key,&id);
+                        addReplyStreamID(c,&id);
+
+                        /* Last delivery. */
+                        addReplyLongLong(c,nack->delivery_time);
+
+                        /* Number of deliveries. */
+                        addReplyLongLong(c,nack->delivery_count);
+
+                        arraylen_cpel++;
+                    }
+                    setDeferredArrayLen(c,arrayptr_cpel,arraylen_cpel);
+                    raxStop(&ri_cpel);
+                }
+                raxStop(&ri_consumers);
+            }
+            raxStop(&ri_cgroups);
+        }
+    }
+}
+
+/* XINFO CONSUMERS <key> <group>
+ * XINFO GROUPS <key>
+ * XINFO STREAM <key> [FULL [COUNT <count>]]
+ * XINFO HELP. */
+void xinfoCommand(client *c) {
+    stream *s = NULL;
+    char *opt;
+    robj *key;
+
+    /* HELP is special. Handle it ASAP. */
+    if (!strcasecmp(c->argv[1]->ptr,"HELP")) {
+        const char *help[] = {
+"CONSUMERS <key> <groupname>",
+"    Show consumers of <groupname>.",
+"GROUPS <key>",
+"    Show the stream consumer groups.",
+"STREAM <key> [FULL [COUNT <count>]",
+"    Show information about the stream.",
+NULL
+        };
+        addReplyHelp(c, help);
+        return;
+    } else if (c->argc < 3) {
+        addReplySubcommandSyntaxError(c);
+        return;
+    }
+
+    /* With the exception of HELP handled before any other sub commands, all
+     * the ones are in the form of "<subcommand> <key>". */
+    opt = c->argv[1]->ptr;
+    key = c->argv[2];
+
+    /* Lookup the key now, this is common for all the subcommands but HELP. */
+    robj *o = lookupKeyReadOrReply(c,key,shared.nokeyerr);
+    if (o == NULL || checkType(c,o,OBJ_STREAM)) return;
+    s = o->ptr;
+
+    /* Dispatch the different subcommands. */
+    if (!strcasecmp(opt,"CONSUMERS") && c->argc == 4) {
+        /* XINFO CONSUMERS <key> <group>. */
+        streamCG *cg = streamLookupCG(s,c->argv[3]->ptr);
+        if (cg == NULL) {
+            addReplyErrorFormat(c, "-NOGROUP No such consumer group '%s' "
+                                   "for key name '%s'",
+                                   (char*)c->argv[3]->ptr, (char*)key->ptr);
+            return;
+        }
+
+        addReplyArrayLen(c,raxSize(cg->consumers));
+        raxIterator ri;
+        raxStart(&ri,cg->consumers);
+        raxSeek(&ri,"^",NULL,0);
+        mstime_t now = mstime();
+        while(raxNext(&ri)) {
+            streamConsumer *consumer = ri.data;
+            mstime_t idle = now - consumer->seen_time;
+            if (idle < 0) idle = 0;
+
+            addReplyMapLen(c,3);
+            addReplyBulkCString(c,"name");
+            addReplyBulkCBuffer(c,consumer->name,sdslen(consumer->name));
+            addReplyBulkCString(c,"pending");
+            addReplyLongLong(c,raxSize(consumer->pel));
+            addReplyBulkCString(c,"idle");
+            addReplyLongLong(c,idle);
+        }
+        raxStop(&ri);
+    } else if (!strcasecmp(opt,"GROUPS") && c->argc == 3) {
+        /* XINFO GROUPS <key>. */
+        if (s->cgroups == NULL) {
+            addReplyArrayLen(c,0);
+            return;
+        }
+
+        addReplyArrayLen(c,raxSize(s->cgroups));
+        raxIterator ri;
+        raxStart(&ri,s->cgroups);
+        raxSeek(&ri,"^",NULL,0);
+        while(raxNext(&ri)) {
+            streamCG *cg = ri.data;
+            addReplyMapLen(c,4);
+            addReplyBulkCString(c,"name");
+            addReplyBulkCBuffer(c,ri.key,ri.key_len);
+            addReplyBulkCString(c,"consumers");
+            addReplyLongLong(c,raxSize(cg->consumers));
+            addReplyBulkCString(c,"pending");
+            addReplyLongLong(c,raxSize(cg->pel));
+            addReplyBulkCString(c,"last-delivered-id");
+            addReplyStreamID(c,&cg->last_id);
+        }
+        raxStop(&ri);
+    } else if (!strcasecmp(opt,"STREAM")) {
+        /* XINFO STREAM <key> [FULL [COUNT <count>]]. */
+        xinfoReplyWithStreamInfo(c,s);
+    } else {
+        addReplySubcommandSyntaxError(c);
+    }
+}
+
+/* Validate the integrity stream listpack entries structure. Both in term of a
+ * valid listpack, but also that the structure of the entires matches a valid
+ * stream. return 1 if valid 0 if not valid. */
+int streamValidateListpackIntegrity(unsigned char *lp, size_t size, int deep) {
+    int valid_record;
+    unsigned char *p, *next;
+
+    /* Since we don't want to run validation of all records twice, we'll
+     * run the listpack validation of just the header and do the rest here. */
+    if (!lpValidateIntegrity(lp, size, 0))
+        return 0;
+
+    /* In non-deep mode we just validated the listpack header (encoded size) */
+    if (!deep) return 1;
+
+    next = p = lpValidateFirst(lp);
+    if (!lpValidateNext(lp, &next, size)) return 0;
+    if (!p) return 0;
+
+    /* entry count */
+    int64_t entry_count = lpGetIntegerIfValid(p, &valid_record);
+    if (!valid_record) return 0;
+    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+    /* deleted */
+    int64_t deleted_count = lpGetIntegerIfValid(p, &valid_record);
+    if (!valid_record) return 0;
+    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+    /* num-of-fields */
+    int64_t master_fields = lpGetIntegerIfValid(p, &valid_record);
+    if (!valid_record) return 0;
+    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+    /* the field names */
+    for (int64_t j = 0; j < master_fields; j++) {
+        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+    }
+
+    /* the zero master entry terminator. */
+    int64_t zero = lpGetIntegerIfValid(p, &valid_record);
+    if (!valid_record || zero != 0) return 0;
+    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+    entry_count += deleted_count;
+    while (entry_count--) {
+        if (!p) return 0;
+        int64_t fields = master_fields, extra_fields = 3;
+        int64_t flags = lpGetIntegerIfValid(p, &valid_record);
+        if (!valid_record) return 0;
+        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+        /* entry id */
+        lpGetIntegerIfValid(p, &valid_record);
+        if (!valid_record) return 0;
+        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+        lpGetIntegerIfValid(p, &valid_record);
+        if (!valid_record) return 0;
+        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+        if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) {
+            /* num-of-fields */
+            fields = lpGetIntegerIfValid(p, &valid_record);
+            if (!valid_record) return 0;
+            p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+
+            /* the field names */
+            for (int64_t j = 0; j < fields; j++) {
+                p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+            }
+
+            extra_fields += fields + 1;
+        }
+
+        /* the values */
+        for (int64_t j = 0; j < fields; j++) {
+            p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+        }
+
+        /* lp-count */
+        int64_t lp_count = lpGetIntegerIfValid(p, &valid_record);
+        if (!valid_record) return 0;
+        if (lp_count != fields + extra_fields) return 0;
+        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
+    }
+
+    if (next)
+        return 0;
+
+    return 1;
+}
diff --git a/redis-stable/src/t_string.c b/redis-stable/src/t_string.c
new file mode 100644
index 00000000..587d3aeb
--- /dev/null
+++ b/redis-stable/src/t_string.c
@@ -0,0 +1,956 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include <math.h> /* isnan(), isinf() */
+
+/* Forward declarations */
+int getGenericCommand(client *c);
+
+/*-----------------------------------------------------------------------------
+ * String Commands
+ *----------------------------------------------------------------------------*/
+
+static int checkStringLength(client *c, long long size) {
+    if (!(c->flags & CLIENT_MASTER) && size > server.proto_max_bulk_len) {
+        addReplyError(c,"string exceeds maximum allowed size (proto-max-bulk-len)");
+        return C_ERR;
+    }
+    return C_OK;
+}
+
+/* The setGenericCommand() function implements the SET operation with different
+ * options and variants. This function is called in order to implement the
+ * following commands: SET, SETEX, PSETEX, SETNX, GETSET.
+ *
+ * 'flags' changes the behavior of the command (NX, XX or GET, see below).
+ *
+ * 'expire' represents an expire to set in form of a Redis object as passed
+ * by the user. It is interpreted according to the specified 'unit'.
+ *
+ * 'ok_reply' and 'abort_reply' is what the function will reply to the client
+ * if the operation is performed, or when it is not because of NX or
+ * XX flags.
+ *
+ * If ok_reply is NULL "+OK" is used.
+ * If abort_reply is NULL, "$-1" is used. */
+
+#define OBJ_NO_FLAGS 0
+#define OBJ_SET_NX (1<<0)          /* Set if key not exists. */
+#define OBJ_SET_XX (1<<1)          /* Set if key exists. */
+#define OBJ_EX (1<<2)              /* Set if time in seconds is given */
+#define OBJ_PX (1<<3)              /* Set if time in ms in given */
+#define OBJ_KEEPTTL (1<<4)         /* Set and keep the ttl */
+#define OBJ_SET_GET (1<<5)         /* Set if want to get key before set */
+#define OBJ_EXAT (1<<6)            /* Set if timestamp in second is given */
+#define OBJ_PXAT (1<<7)            /* Set if timestamp in ms is given */
+#define OBJ_PERSIST (1<<8)         /* Set if we need to remove the ttl */
+
+void setGenericCommand(client *c, int flags, robj *key, robj *val, robj *expire, int unit, robj *ok_reply, robj *abort_reply) {
+    long long milliseconds = 0, when = 0; /* initialized to avoid any harmness warning */
+
+    if (expire) {
+        if (getLongLongFromObjectOrReply(c, expire, &milliseconds, NULL) != C_OK)
+            return;
+        if (milliseconds <= 0 || (unit == UNIT_SECONDS && milliseconds > LLONG_MAX / 1000)) {
+            /* Negative value provided or multiplication is gonna overflow. */
+            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
+            return;
+        }
+        if (unit == UNIT_SECONDS) milliseconds *= 1000;
+        when = milliseconds;
+        if ((flags & OBJ_PX) || (flags & OBJ_EX))
+            when += mstime();
+        if (when <= 0) {
+            /* Overflow detected. */
+            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
+            return;
+        }
+    }
+
+    if ((flags & OBJ_SET_NX && lookupKeyWrite(c->db,key) != NULL) ||
+        (flags & OBJ_SET_XX && lookupKeyWrite(c->db,key) == NULL))
+    {
+        addReply(c, abort_reply ? abort_reply : shared.null[c->resp]);
+        return;
+    }
+
+    if (flags & OBJ_SET_GET) {
+        if (getGenericCommand(c) == C_ERR) return;
+    }
+
+    genericSetKey(c,c->db,key, val,flags & OBJ_KEEPTTL,1);
+    server.dirty++;
+    notifyKeyspaceEvent(NOTIFY_STRING,"set",key,c->db->id);
+    if (expire) {
+        setExpire(c,c->db,key,when);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",key,c->db->id);
+
+        /* Propagate as SET Key Value PXAT millisecond-timestamp if there is EXAT/PXAT or
+         * propagate as SET Key Value PX millisecond if there is EX/PX flag.
+         *
+         * Additionally when we propagate the SET with PX (relative millisecond) we translate
+         * it again to SET with PXAT for the AOF.
+         *
+         * Additional care is required while modifying the argument order. AOF relies on the
+         * exp argument being at index 3. (see feedAppendOnlyFile)
+         * */
+        robj *exp = (flags & OBJ_PXAT) || (flags & OBJ_EXAT) ? shared.pxat : shared.px;
+        robj *millisecondObj = createStringObjectFromLongLong(milliseconds);
+        rewriteClientCommandVector(c,5,shared.set,key,val,exp,millisecondObj);
+        decrRefCount(millisecondObj);
+    }
+    if (!(flags & OBJ_SET_GET)) {
+        addReply(c, ok_reply ? ok_reply : shared.ok);
+    }
+
+    /* Propagate without the GET argument (Isn't needed if we had expire since in that case we completely re-written the command argv) */
+    if ((flags & OBJ_SET_GET) && !expire) {
+        int argc = 0;
+        int j;
+        robj **argv = zmalloc((c->argc-1)*sizeof(robj*));
+        for (j=0; j < c->argc; j++) {
+            char *a = c->argv[j]->ptr;
+            /* Skip GET which may be repeated multiple times. */
+            if (j >= 3 &&
+                (a[0] == 'g' || a[0] == 'G') &&
+                (a[1] == 'e' || a[1] == 'E') &&
+                (a[2] == 't' || a[2] == 'T') && a[3] == '\0')
+                continue;
+            argv[argc++] = c->argv[j];
+            incrRefCount(c->argv[j]);
+        }
+        replaceClientCommandVector(c, argc, argv);
+    }
+}
+
+#define COMMAND_GET 0
+#define COMMAND_SET 1
+/*
+ * The parseExtendedStringArgumentsOrReply() function performs the common validation for extended
+ * string arguments used in SET and GET command.
+ *
+ * Get specific commands - PERSIST/DEL
+ * Set specific commands - XX/NX/GET
+ * Common commands - EX/EXAT/PX/PXAT/KEEPTTL
+ *
+ * Function takes pointers to client, flags, unit, pointer to pointer of expire obj if needed
+ * to be determined and command_type which can be COMMAND_GET or COMMAND_SET.
+ *
+ * If there are any syntax violations C_ERR is returned else C_OK is returned.
+ *
+ * Input flags are updated upon parsing the arguments. Unit and expire are updated if there are any
+ * EX/EXAT/PX/PXAT arguments. Unit is updated to millisecond if PX/PXAT is set.
+ */
+int parseExtendedStringArgumentsOrReply(client *c, int *flags, int *unit, robj **expire, int command_type) {
+
+    int j = command_type == COMMAND_GET ? 2 : 3;
+    for (; j < c->argc; j++) {
+        char *opt = c->argv[j]->ptr;
+        robj *next = (j == c->argc-1) ? NULL : c->argv[j+1];
+
+        if ((opt[0] == 'n' || opt[0] == 'N') &&
+            (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
+            !(*flags & OBJ_SET_XX) && !(*flags & OBJ_SET_GET) && (command_type == COMMAND_SET))
+        {
+            *flags |= OBJ_SET_NX;
+        } else if ((opt[0] == 'x' || opt[0] == 'X') &&
+                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
+                   !(*flags & OBJ_SET_NX) && (command_type == COMMAND_SET))
+        {
+            *flags |= OBJ_SET_XX;
+        } else if ((opt[0] == 'g' || opt[0] == 'G') &&
+                   (opt[1] == 'e' || opt[1] == 'E') &&
+                   (opt[2] == 't' || opt[2] == 'T') && opt[3] == '\0' &&
+                   !(*flags & OBJ_SET_NX) && (command_type == COMMAND_SET))
+        {
+            *flags |= OBJ_SET_GET;
+        } else if (!strcasecmp(opt, "KEEPTTL") && !(*flags & OBJ_PERSIST) &&
+            !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
+            !(*flags & OBJ_PX) && !(*flags & OBJ_PXAT) && (command_type == COMMAND_SET))
+        {
+            *flags |= OBJ_KEEPTTL;
+        } else if (!strcasecmp(opt,"PERSIST") && (command_type == COMMAND_GET) &&
+               !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
+               !(*flags & OBJ_PX) && !(*flags & OBJ_PXAT) &&
+               !(*flags & OBJ_KEEPTTL))
+        {
+            *flags |= OBJ_PERSIST;
+        } else if ((opt[0] == 'e' || opt[0] == 'E') &&
+                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
+                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
+                   !(*flags & OBJ_EXAT) && !(*flags & OBJ_PX) &&
+                   !(*flags & OBJ_PXAT) && next)
+        {
+            *flags |= OBJ_EX;
+            *expire = next;
+            j++;
+        } else if ((opt[0] == 'p' || opt[0] == 'P') &&
+                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
+                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
+                   !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
+                   !(*flags & OBJ_PXAT) && next)
+        {
+            *flags |= OBJ_PX;
+            *unit = UNIT_MILLISECONDS;
+            *expire = next;
+            j++;
+        } else if ((opt[0] == 'e' || opt[0] == 'E') &&
+                   (opt[1] == 'x' || opt[1] == 'X') &&
+                   (opt[2] == 'a' || opt[2] == 'A') &&
+                   (opt[3] == 't' || opt[3] == 'T') && opt[4] == '\0' &&
+                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
+                   !(*flags & OBJ_EX) && !(*flags & OBJ_PX) &&
+                   !(*flags & OBJ_PXAT) && next)
+        {
+            *flags |= OBJ_EXAT;
+            *expire = next;
+            j++;
+        } else if ((opt[0] == 'p' || opt[0] == 'P') &&
+                   (opt[1] == 'x' || opt[1] == 'X') &&
+                   (opt[2] == 'a' || opt[2] == 'A') &&
+                   (opt[3] == 't' || opt[3] == 'T') && opt[4] == '\0' &&
+                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
+                   !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
+                   !(*flags & OBJ_PX) && next)
+        {
+            *flags |= OBJ_PXAT;
+            *unit = UNIT_MILLISECONDS;
+            *expire = next;
+            j++;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return C_ERR;
+        }
+    }
+    return C_OK;
+}
+
+/* SET key value [NX] [XX] [KEEPTTL] [GET] [EX <seconds>] [PX <milliseconds>]
+ *     [EXAT <seconds-timestamp>][PXAT <milliseconds-timestamp>] */
+void setCommand(client *c) {
+    robj *expire = NULL;
+    int unit = UNIT_SECONDS;
+    int flags = OBJ_NO_FLAGS;
+
+    if (parseExtendedStringArgumentsOrReply(c,&flags,&unit,&expire,COMMAND_SET) != C_OK) {
+        return;
+    }
+
+    c->argv[2] = tryObjectEncoding(c->argv[2]);
+    setGenericCommand(c,flags,c->argv[1],c->argv[2],expire,unit,NULL,NULL);
+}
+
+void setnxCommand(client *c) {
+    c->argv[2] = tryObjectEncoding(c->argv[2]);
+    setGenericCommand(c,OBJ_SET_NX,c->argv[1],c->argv[2],NULL,0,shared.cone,shared.czero);
+}
+
+void setexCommand(client *c) {
+    c->argv[3] = tryObjectEncoding(c->argv[3]);
+    setGenericCommand(c,OBJ_EX,c->argv[1],c->argv[3],c->argv[2],UNIT_SECONDS,NULL,NULL);
+}
+
+void psetexCommand(client *c) {
+    c->argv[3] = tryObjectEncoding(c->argv[3]);
+    setGenericCommand(c,OBJ_PX,c->argv[1],c->argv[3],c->argv[2],UNIT_MILLISECONDS,NULL,NULL);
+}
+
+int getGenericCommand(client *c) {
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL)
+        return C_OK;
+
+    if (checkType(c,o,OBJ_STRING)) {
+        return C_ERR;
+    }
+
+    addReplyBulk(c,o);
+    return C_OK;
+}
+
+void getCommand(client *c) {
+    getGenericCommand(c);
+}
+
+/*
+ * GETEX <key> [PERSIST][EX seconds][PX milliseconds][EXAT seconds-timestamp][PXAT milliseconds-timestamp]
+ *
+ * The getexCommand() function implements extended options and variants of the GET command. Unlike GET
+ * command this command is not read-only.
+ *
+ * The default behavior when no options are specified is same as GET and does not alter any TTL.
+ *
+ * Only one of the below options can be used at a given time.
+ *
+ * 1. PERSIST removes any TTL associated with the key.
+ * 2. EX Set expiry TTL in seconds.
+ * 3. PX Set expiry TTL in milliseconds.
+ * 4. EXAT Same like EX instead of specifying the number of seconds representing the TTL
+ *      (time to live), it takes an absolute Unix timestamp
+ * 5. PXAT Same like PX instead of specifying the number of milliseconds representing the TTL
+ *      (time to live), it takes an absolute Unix timestamp
+ *
+ * Command would either return the bulk string, error or nil.
+ */
+void getexCommand(client *c) {
+    robj *expire = NULL;
+    int unit = UNIT_SECONDS;
+    int flags = OBJ_NO_FLAGS;
+
+    if (parseExtendedStringArgumentsOrReply(c,&flags,&unit,&expire,COMMAND_GET) != C_OK) {
+        return;
+    }
+
+    robj *o;
+
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL)
+        return;
+
+    if (checkType(c,o,OBJ_STRING)) {
+        return;
+    }
+
+    long long milliseconds = 0, when = 0;
+
+    /* Validate the expiration time value first */
+    if (expire) {
+        if (getLongLongFromObjectOrReply(c, expire, &milliseconds, NULL) != C_OK)
+            return;
+        if (milliseconds <= 0 || (unit == UNIT_SECONDS && milliseconds > LLONG_MAX / 1000)) {
+            /* Negative value provided or multiplication is gonna overflow. */
+            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
+            return;
+        }
+        if (unit == UNIT_SECONDS) milliseconds *= 1000;
+        when = milliseconds;
+        if ((flags & OBJ_PX) || (flags & OBJ_EX))
+            when += mstime();
+        if (when <= 0) {
+            /* Overflow detected. */
+            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
+            return;
+        }
+    }
+
+    /* We need to do this before we expire the key or delete it */
+    addReplyBulk(c,o);
+
+    /* This command is never propagated as is. It is either propagated as PEXPIRE[AT],DEL,UNLINK or PERSIST.
+     * This why it doesn't need special handling in feedAppendOnlyFile to convert relative expire time to absolute one. */
+    if (((flags & OBJ_PXAT) || (flags & OBJ_EXAT)) && checkAlreadyExpired(milliseconds)) {
+        /* When PXAT/EXAT absolute timestamp is specified, there can be a chance that timestamp
+         * has already elapsed so delete the key in that case. */
+        int deleted = server.lazyfree_lazy_expire ? dbAsyncDelete(c->db, c->argv[1]) :
+                      dbSyncDelete(c->db, c->argv[1]);
+        serverAssert(deleted);
+        robj *aux = server.lazyfree_lazy_expire ? shared.unlink : shared.del;
+        rewriteClientCommandVector(c,2,aux,c->argv[1]);
+        signalModifiedKey(c, c->db, c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", c->argv[1], c->db->id);
+        server.dirty++;
+    } else if (expire) {
+        setExpire(c,c->db,c->argv[1],when);
+        /* Propagate */
+        robj *exp = (flags & OBJ_PXAT) || (flags & OBJ_EXAT) ? shared.pexpireat : shared.pexpire;
+        robj* millisecondObj = createStringObjectFromLongLong(milliseconds);
+        rewriteClientCommandVector(c,3,exp,c->argv[1],millisecondObj);
+        decrRefCount(millisecondObj);
+        signalModifiedKey(c, c->db, c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",c->argv[1],c->db->id);
+        server.dirty++;
+    } else if (flags & OBJ_PERSIST) {
+        if (removeExpire(c->db, c->argv[1])) {
+            signalModifiedKey(c, c->db, c->argv[1]);
+            rewriteClientCommandVector(c, 2, shared.persist, c->argv[1]);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"persist",c->argv[1],c->db->id);
+            server.dirty++;
+        }
+    }
+}
+
+void getdelCommand(client *c) {
+    if (getGenericCommand(c) == C_ERR) return;
+    int deleted = server.lazyfree_lazy_user_del ? dbAsyncDelete(c->db, c->argv[1]) :
+                  dbSyncDelete(c->db, c->argv[1]);
+    if (deleted) {
+        /* Propagate as DEL/UNLINK command */
+        robj *aux = server.lazyfree_lazy_user_del ? shared.unlink : shared.del;
+        rewriteClientCommandVector(c,2,aux,c->argv[1]);
+        signalModifiedKey(c, c->db, c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", c->argv[1], c->db->id);
+        server.dirty++;
+    }
+}
+
+void getsetCommand(client *c) {
+    if (getGenericCommand(c) == C_ERR) return;
+    c->argv[2] = tryObjectEncoding(c->argv[2]);
+    setKey(c,c->db,c->argv[1],c->argv[2]);
+    notifyKeyspaceEvent(NOTIFY_STRING,"set",c->argv[1],c->db->id);
+    server.dirty++;
+
+    /* Propagate as SET command */
+    rewriteClientCommandArgument(c,0,shared.set);
+}
+
+void setrangeCommand(client *c) {
+    robj *o;
+    long offset;
+    sds value = c->argv[3]->ptr;
+
+    if (getLongFromObjectOrReply(c,c->argv[2],&offset,NULL) != C_OK)
+        return;
+
+    if (offset < 0) {
+        addReplyError(c,"offset is out of range");
+        return;
+    }
+
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (o == NULL) {
+        /* Return 0 when setting nothing on a non-existing string */
+        if (sdslen(value) == 0) {
+            addReply(c,shared.czero);
+            return;
+        }
+
+        /* Return when the resulting string exceeds allowed size */
+        if (checkStringLength(c,offset+sdslen(value)) != C_OK)
+            return;
+
+        o = createObject(OBJ_STRING,sdsnewlen(NULL, offset+sdslen(value)));
+        dbAdd(c->db,c->argv[1],o);
+    } else {
+        size_t olen;
+
+        /* Key exists, check type */
+        if (checkType(c,o,OBJ_STRING))
+            return;
+
+        /* Return existing string length when setting nothing */
+        olen = stringObjectLen(o);
+        if (sdslen(value) == 0) {
+            addReplyLongLong(c,olen);
+            return;
+        }
+
+        /* Return when the resulting string exceeds allowed size */
+        if (checkStringLength(c,offset+sdslen(value)) != C_OK)
+            return;
+
+        /* Create a copy when the object is shared or encoded. */
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+    }
+
+    if (sdslen(value) > 0) {
+        o->ptr = sdsgrowzero(o->ptr,offset+sdslen(value));
+        memcpy((char*)o->ptr+offset,value,sdslen(value));
+        signalModifiedKey(c,c->db,c->argv[1]);
+        notifyKeyspaceEvent(NOTIFY_STRING,
+            "setrange",c->argv[1],c->db->id);
+        server.dirty++;
+    }
+    addReplyLongLong(c,sdslen(o->ptr));
+}
+
+void getrangeCommand(client *c) {
+    robj *o;
+    long long start, end;
+    char *str, llbuf[32];
+    size_t strlen;
+
+    if (getLongLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK)
+        return;
+    if (getLongLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK)
+        return;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptybulk)) == NULL ||
+        checkType(c,o,OBJ_STRING)) return;
+
+    if (o->encoding == OBJ_ENCODING_INT) {
+        str = llbuf;
+        strlen = ll2string(llbuf,sizeof(llbuf),(long)o->ptr);
+    } else {
+        str = o->ptr;
+        strlen = sdslen(str);
+    }
+
+    /* Convert negative indexes */
+    if (start < 0 && end < 0 && start > end) {
+        addReply(c,shared.emptybulk);
+        return;
+    }
+    if (start < 0) start = strlen+start;
+    if (end < 0) end = strlen+end;
+    if (start < 0) start = 0;
+    if (end < 0) end = 0;
+    if ((unsigned long long)end >= strlen) end = strlen-1;
+
+    /* Precondition: end >= 0 && end < strlen, so the only condition where
+     * nothing can be returned is: start > end. */
+    if (start > end || strlen == 0) {
+        addReply(c,shared.emptybulk);
+    } else {
+        addReplyBulkCBuffer(c,(char*)str+start,end-start+1);
+    }
+}
+
+void mgetCommand(client *c) {
+    int j;
+
+    addReplyArrayLen(c,c->argc-1);
+    for (j = 1; j < c->argc; j++) {
+        robj *o = lookupKeyRead(c->db,c->argv[j]);
+        if (o == NULL) {
+            addReplyNull(c);
+        } else {
+            if (o->type != OBJ_STRING) {
+                addReplyNull(c);
+            } else {
+                addReplyBulk(c,o);
+            }
+        }
+    }
+}
+
+void msetGenericCommand(client *c, int nx) {
+    int j;
+
+    if ((c->argc % 2) == 0) {
+        addReplyError(c,"wrong number of arguments for MSET");
+        return;
+    }
+
+    /* Handle the NX flag. The MSETNX semantic is to return zero and don't
+     * set anything if at least one key already exists. */
+    if (nx) {
+        for (j = 1; j < c->argc; j += 2) {
+            if (lookupKeyWrite(c->db,c->argv[j]) != NULL) {
+                addReply(c, shared.czero);
+                return;
+            }
+        }
+    }
+
+    for (j = 1; j < c->argc; j += 2) {
+        c->argv[j+1] = tryObjectEncoding(c->argv[j+1]);
+        setKey(c,c->db,c->argv[j],c->argv[j+1]);
+        notifyKeyspaceEvent(NOTIFY_STRING,"set",c->argv[j],c->db->id);
+    }
+    server.dirty += (c->argc-1)/2;
+    addReply(c, nx ? shared.cone : shared.ok);
+}
+
+void msetCommand(client *c) {
+    msetGenericCommand(c,0);
+}
+
+void msetnxCommand(client *c) {
+    msetGenericCommand(c,1);
+}
+
+void incrDecrCommand(client *c, long long incr) {
+    long long value, oldvalue;
+    robj *o, *new;
+
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (checkType(c,o,OBJ_STRING)) return;
+    if (getLongLongFromObjectOrReply(c,o,&value,NULL) != C_OK) return;
+
+    oldvalue = value;
+    if ((incr < 0 && oldvalue < 0 && incr < (LLONG_MIN-oldvalue)) ||
+        (incr > 0 && oldvalue > 0 && incr > (LLONG_MAX-oldvalue))) {
+        addReplyError(c,"increment or decrement would overflow");
+        return;
+    }
+    value += incr;
+
+    if (o && o->refcount == 1 && o->encoding == OBJ_ENCODING_INT &&
+        (value < 0 || value >= OBJ_SHARED_INTEGERS) &&
+        value >= LONG_MIN && value <= LONG_MAX)
+    {
+        new = o;
+        o->ptr = (void*)((long)value);
+    } else {
+        new = createStringObjectFromLongLongForValue(value);
+        if (o) {
+            dbOverwrite(c->db,c->argv[1],new);
+        } else {
+            dbAdd(c->db,c->argv[1],new);
+        }
+    }
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_STRING,"incrby",c->argv[1],c->db->id);
+    server.dirty++;
+    addReply(c,shared.colon);
+    addReply(c,new);
+    addReply(c,shared.crlf);
+}
+
+void incrCommand(client *c) {
+    incrDecrCommand(c,1);
+}
+
+void decrCommand(client *c) {
+    incrDecrCommand(c,-1);
+}
+
+void incrbyCommand(client *c) {
+    long long incr;
+
+    if (getLongLongFromObjectOrReply(c, c->argv[2], &incr, NULL) != C_OK) return;
+    incrDecrCommand(c,incr);
+}
+
+void decrbyCommand(client *c) {
+    long long incr;
+
+    if (getLongLongFromObjectOrReply(c, c->argv[2], &incr, NULL) != C_OK) return;
+    incrDecrCommand(c,-incr);
+}
+
+void incrbyfloatCommand(client *c) {
+    long double incr, value;
+    robj *o, *new;
+
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (checkType(c,o,OBJ_STRING)) return;
+    if (getLongDoubleFromObjectOrReply(c,o,&value,NULL) != C_OK ||
+        getLongDoubleFromObjectOrReply(c,c->argv[2],&incr,NULL) != C_OK)
+        return;
+
+    value += incr;
+    if (isnan(value) || isinf(value)) {
+        addReplyError(c,"increment would produce NaN or Infinity");
+        return;
+    }
+    new = createStringObjectFromLongDouble(value,1);
+    if (o)
+        dbOverwrite(c->db,c->argv[1],new);
+    else
+        dbAdd(c->db,c->argv[1],new);
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_STRING,"incrbyfloat",c->argv[1],c->db->id);
+    server.dirty++;
+    addReplyBulk(c,new);
+
+    /* Always replicate INCRBYFLOAT as a SET command with the final value
+     * in order to make sure that differences in float precision or formatting
+     * will not create differences in replicas or after an AOF restart. */
+    rewriteClientCommandArgument(c,0,shared.set);
+    rewriteClientCommandArgument(c,2,new);
+    rewriteClientCommandArgument(c,3,shared.keepttl);
+}
+
+void appendCommand(client *c) {
+    size_t totlen;
+    robj *o, *append;
+
+    o = lookupKeyWrite(c->db,c->argv[1]);
+    if (o == NULL) {
+        /* Create the key */
+        c->argv[2] = tryObjectEncoding(c->argv[2]);
+        dbAdd(c->db,c->argv[1],c->argv[2]);
+        incrRefCount(c->argv[2]);
+        totlen = stringObjectLen(c->argv[2]);
+    } else {
+        /* Key exists, check type */
+        if (checkType(c,o,OBJ_STRING))
+            return;
+
+        /* "append" is an argument, so always an sds */
+        append = c->argv[2];
+        totlen = stringObjectLen(o)+sdslen(append->ptr);
+        if (checkStringLength(c,totlen) != C_OK)
+            return;
+
+        /* Append the value */
+        o = dbUnshareStringValue(c->db,c->argv[1],o);
+        o->ptr = sdscatlen(o->ptr,append->ptr,sdslen(append->ptr));
+        totlen = sdslen(o->ptr);
+    }
+    signalModifiedKey(c,c->db,c->argv[1]);
+    notifyKeyspaceEvent(NOTIFY_STRING,"append",c->argv[1],c->db->id);
+    server.dirty++;
+    addReplyLongLong(c,totlen);
+}
+
+void strlenCommand(client *c) {
+    robj *o;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
+        checkType(c,o,OBJ_STRING)) return;
+    addReplyLongLong(c,stringObjectLen(o));
+}
+
+
+/* STRALGO -- Implement complex algorithms on strings.
+ *
+ * STRALGO <algorithm> ... arguments ... */
+void stralgoLCS(client *c);     /* This implements the LCS algorithm. */
+void stralgoCommand(client *c) {
+    /* Select the algorithm. */
+    if (!strcasecmp(c->argv[1]->ptr,"lcs")) {
+        stralgoLCS(c);
+    } else {
+        addReplyErrorObject(c,shared.syntaxerr);
+    }
+}
+
+/* STRALGO <algo> [IDX] [LEN] [MINMATCHLEN <len>] [WITHMATCHLEN]
+ *     STRINGS <string> <string> | KEYS <keya> <keyb>
+ */
+void stralgoLCS(client *c) {
+    uint32_t i, j;
+    long long minmatchlen = 0;
+    sds a = NULL, b = NULL;
+    int getlen = 0, getidx = 0, withmatchlen = 0;
+    robj *obja = NULL, *objb = NULL;
+
+    for (j = 2; j < (uint32_t)c->argc; j++) {
+        char *opt = c->argv[j]->ptr;
+        int moreargs = (c->argc-1) - j;
+
+        if (!strcasecmp(opt,"IDX")) {
+            getidx = 1;
+        } else if (!strcasecmp(opt,"LEN")) {
+            getlen = 1;
+        } else if (!strcasecmp(opt,"WITHMATCHLEN")) {
+            withmatchlen = 1;
+        } else if (!strcasecmp(opt,"MINMATCHLEN") && moreargs) {
+            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&minmatchlen,NULL)
+                != C_OK) goto cleanup;
+            if (minmatchlen < 0) minmatchlen = 0;
+            j++;
+        } else if (!strcasecmp(opt,"STRINGS") && moreargs > 1) {
+            if (a != NULL) {
+                addReplyError(c,"Either use STRINGS or KEYS");
+                goto cleanup;
+            }
+            a = c->argv[j+1]->ptr;
+            b = c->argv[j+2]->ptr;
+            j += 2;
+        } else if (!strcasecmp(opt,"KEYS") && moreargs > 1) {
+            if (a != NULL) {
+                addReplyError(c,"Either use STRINGS or KEYS");
+                goto cleanup;
+            }
+            obja = lookupKeyRead(c->db,c->argv[j+1]);
+            objb = lookupKeyRead(c->db,c->argv[j+2]);
+            if ((obja && obja->type != OBJ_STRING) ||
+                (objb && objb->type != OBJ_STRING))
+            {
+                addReplyError(c,
+                    "The specified keys must contain string values");
+                /* Don't cleanup the objects, we need to do that
+                 * only after calling getDecodedObject(). */
+                obja = NULL;
+                objb = NULL;
+                goto cleanup;
+            }
+            obja = obja ? getDecodedObject(obja) : createStringObject("",0);
+            objb = objb ? getDecodedObject(objb) : createStringObject("",0);
+            a = obja->ptr;
+            b = objb->ptr;
+            j += 2;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            goto cleanup;
+        }
+    }
+
+    /* Complain if the user passed ambiguous parameters. */
+    if (a == NULL) {
+        addReplyError(c,"Please specify two strings: "
+                        "STRINGS or KEYS options are mandatory");
+        goto cleanup;
+    } else if (getlen && getidx) {
+        addReplyError(c,
+            "If you want both the length and indexes, please "
+            "just use IDX.");
+        goto cleanup;
+    }
+
+    /* Detect string truncation or later overflows. */
+    if (sdslen(a) >= UINT32_MAX-1 || sdslen(b) >= UINT32_MAX-1) {
+        addReplyError(c, "String too long for LCS");
+        goto cleanup;
+    }
+
+    /* Compute the LCS using the vanilla dynamic programming technique of
+     * building a table of LCS(x,y) substrings. */
+    uint32_t alen = sdslen(a);
+    uint32_t blen = sdslen(b);
+
+    /* Setup an uint32_t array to store at LCS[i,j] the length of the
+     * LCS A0..i-1, B0..j-1. Note that we have a linear array here, so
+     * we index it as LCS[j+(blen+1)*j] */
+    #define LCS(A,B) lcs[(B)+((A)*(blen+1))]
+
+    /* Try to allocate the LCS table, and abort on overflow or insufficient memory. */
+    unsigned long long lcssize = (unsigned long long)(alen+1)*(blen+1); /* Can't overflow due to the size limits above. */
+    unsigned long long lcsalloc = lcssize * sizeof(uint32_t);
+    uint32_t *lcs = NULL;
+    if (lcsalloc < SIZE_MAX && lcsalloc / lcssize == sizeof(uint32_t))
+        lcs = ztrymalloc(lcsalloc);
+    if (!lcs) {
+        addReplyError(c, "Insufficient memory");
+        goto cleanup;
+    }
+
+    /* Start building the LCS table. */
+    for (uint32_t i = 0; i <= alen; i++) {
+        for (uint32_t j = 0; j <= blen; j++) {
+            if (i == 0 || j == 0) {
+                /* If one substring has length of zero, the
+                 * LCS length is zero. */
+                LCS(i,j) = 0;
+            } else if (a[i-1] == b[j-1]) {
+                /* The len LCS (and the LCS itself) of two
+                 * sequences with the same final character, is the
+                 * LCS of the two sequences without the last char
+                 * plus that last char. */
+                LCS(i,j) = LCS(i-1,j-1)+1;
+            } else {
+                /* If the last character is different, take the longest
+                 * between the LCS of the first string and the second
+                 * minus the last char, and the reverse. */
+                uint32_t lcs1 = LCS(i-1,j);
+                uint32_t lcs2 = LCS(i,j-1);
+                LCS(i,j) = lcs1 > lcs2 ? lcs1 : lcs2;
+            }
+        }
+    }
+
+    /* Store the actual LCS string in "result" if needed. We create
+     * it backward, but the length is already known, we store it into idx. */
+    uint32_t idx = LCS(alen,blen);
+    sds result = NULL;        /* Resulting LCS string. */
+    void *arraylenptr = NULL; /* Deffered length of the array for IDX. */
+    uint32_t arange_start = alen, /* alen signals that values are not set. */
+             arange_end = 0,
+             brange_start = 0,
+             brange_end = 0;
+
+    /* Do we need to compute the actual LCS string? Allocate it in that case. */
+    int computelcs = getidx || !getlen;
+    if (computelcs) result = sdsnewlen(SDS_NOINIT,idx);
+
+    /* Start with a deferred array if we have to emit the ranges. */
+    uint32_t arraylen = 0;  /* Number of ranges emitted in the array. */
+    if (getidx) {
+        addReplyMapLen(c,2);
+        addReplyBulkCString(c,"matches");
+        arraylenptr = addReplyDeferredLen(c);
+    }
+
+    i = alen, j = blen;
+    while (computelcs && i > 0 && j > 0) {
+        int emit_range = 0;
+        if (a[i-1] == b[j-1]) {
+            /* If there is a match, store the character and reduce
+             * the indexes to look for a new match. */
+            result[idx-1] = a[i-1];
+
+            /* Track the current range. */
+            if (arange_start == alen) {
+                arange_start = i-1;
+                arange_end = i-1;
+                brange_start = j-1;
+                brange_end = j-1;
+            } else {
+                /* Let's see if we can extend the range backward since
+                 * it is contiguous. */
+                if (arange_start == i && brange_start == j) {
+                    arange_start--;
+                    brange_start--;
+                } else {
+                    emit_range = 1;
+                }
+            }
+            /* Emit the range if we matched with the first byte of
+             * one of the two strings. We'll exit the loop ASAP. */
+            if (arange_start == 0 || brange_start == 0) emit_range = 1;
+            idx--; i--; j--;
+        } else {
+            /* Otherwise reduce i and j depending on the largest
+             * LCS between, to understand what direction we need to go. */
+            uint32_t lcs1 = LCS(i-1,j);
+            uint32_t lcs2 = LCS(i,j-1);
+            if (lcs1 > lcs2)
+                i--;
+            else
+                j--;
+            if (arange_start != alen) emit_range = 1;
+        }
+
+        /* Emit the current range if needed. */
+        uint32_t match_len = arange_end - arange_start + 1;
+        if (emit_range) {
+            if (minmatchlen == 0 || match_len >= minmatchlen) {
+                if (arraylenptr) {
+                    addReplyArrayLen(c,2+withmatchlen);
+                    addReplyArrayLen(c,2);
+                    addReplyLongLong(c,arange_start);
+                    addReplyLongLong(c,arange_end);
+                    addReplyArrayLen(c,2);
+                    addReplyLongLong(c,brange_start);
+                    addReplyLongLong(c,brange_end);
+                    if (withmatchlen) addReplyLongLong(c,match_len);
+                    arraylen++;
+                }
+            }
+            arange_start = alen; /* Restart at the next match. */
+        }
+    }
+
+    /* Signal modified key, increment dirty, ... */
+
+    /* Reply depending on the given options. */
+    if (arraylenptr) {
+        addReplyBulkCString(c,"len");
+        addReplyLongLong(c,LCS(alen,blen));
+        setDeferredArrayLen(c,arraylenptr,arraylen);
+    } else if (getlen) {
+        addReplyLongLong(c,LCS(alen,blen));
+    } else {
+        addReplyBulkSds(c,result);
+        result = NULL;
+    }
+
+    /* Cleanup. */
+    sdsfree(result);
+    zfree(lcs);
+
+cleanup:
+    if (obja) decrRefCount(obja);
+    if (objb) decrRefCount(objb);
+    return;
+}
+
diff --git a/redis-stable/src/t_zset.c b/redis-stable/src/t_zset.c
new file mode 100644
index 00000000..2abc1b49
--- /dev/null
+++ b/redis-stable/src/t_zset.c
@@ -0,0 +1,4233 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*-----------------------------------------------------------------------------
+ * Sorted set API
+ *----------------------------------------------------------------------------*/
+
+/* ZSETs are ordered sets using two data structures to hold the same elements
+ * in order to get O(log(N)) INSERT and REMOVE operations into a sorted
+ * data structure.
+ *
+ * The elements are added to a hash table mapping Redis objects to scores.
+ * At the same time the elements are added to a skip list mapping scores
+ * to Redis objects (so objects are sorted by scores in this "view").
+ *
+ * Note that the SDS string representing the element is the same in both
+ * the hash table and skiplist in order to save memory. What we do in order
+ * to manage the shared SDS string more easily is to free the SDS string
+ * only in zslFreeNode(). The dictionary has no value free method set.
+ * So we should always remove an element from the dictionary, and later from
+ * the skiplist.
+ *
+ * This skiplist implementation is almost a C translation of the original
+ * algorithm described by William Pugh in "Skip Lists: A Probabilistic
+ * Alternative to Balanced Trees", modified in three ways:
+ * a) this implementation allows for repeated scores.
+ * b) the comparison is not just by key (our 'score') but by satellite data.
+ * c) there is a back pointer, so it's a doubly linked list with the back
+ * pointers being only at "level 1". This allows to traverse the list
+ * from tail to head, useful for ZREVRANGE. */
+
+#include "server.h"
+#include <math.h>
+
+/*-----------------------------------------------------------------------------
+ * Skiplist implementation of the low level API
+ *----------------------------------------------------------------------------*/
+
+int zslLexValueGteMin(sds value, zlexrangespec *spec);
+int zslLexValueLteMax(sds value, zlexrangespec *spec);
+
+/* Create a skiplist node with the specified number of levels.
+ * The SDS string 'ele' is referenced by the node after the call. */
+zskiplistNode *zslCreateNode(int level, double score, sds ele) {
+    zskiplistNode *zn =
+        zmalloc(sizeof(*zn)+level*sizeof(struct zskiplistLevel));
+    zn->score = score;
+    zn->ele = ele;
+    return zn;
+}
+
+/* Create a new skiplist. */
+zskiplist *zslCreate(void) {
+    int j;
+    zskiplist *zsl;
+
+    zsl = zmalloc(sizeof(*zsl));
+    zsl->level = 1;
+    zsl->length = 0;
+    zsl->header = zslCreateNode(ZSKIPLIST_MAXLEVEL,0,NULL);
+    for (j = 0; j < ZSKIPLIST_MAXLEVEL; j++) {
+        zsl->header->level[j].forward = NULL;
+        zsl->header->level[j].span = 0;
+    }
+    zsl->header->backward = NULL;
+    zsl->tail = NULL;
+    return zsl;
+}
+
+/* Free the specified skiplist node. The referenced SDS string representation
+ * of the element is freed too, unless node->ele is set to NULL before calling
+ * this function. */
+void zslFreeNode(zskiplistNode *node) {
+    sdsfree(node->ele);
+    zfree(node);
+}
+
+/* Free a whole skiplist. */
+void zslFree(zskiplist *zsl) {
+    zskiplistNode *node = zsl->header->level[0].forward, *next;
+
+    zfree(zsl->header);
+    while(node) {
+        next = node->level[0].forward;
+        zslFreeNode(node);
+        node = next;
+    }
+    zfree(zsl);
+}
+
+/* Returns a random level for the new skiplist node we are going to create.
+ * The return value of this function is between 1 and ZSKIPLIST_MAXLEVEL
+ * (both inclusive), with a powerlaw-alike distribution where higher
+ * levels are less likely to be returned. */
+int zslRandomLevel(void) {
+    int level = 1;
+    while ((random()&0xFFFF) < (ZSKIPLIST_P * 0xFFFF))
+        level += 1;
+    return (level<ZSKIPLIST_MAXLEVEL) ? level : ZSKIPLIST_MAXLEVEL;
+}
+
+/* Insert a new node in the skiplist. Assumes the element does not already
+ * exist (up to the caller to enforce that). The skiplist takes ownership
+ * of the passed SDS string 'ele'. */
+zskiplistNode *zslInsert(zskiplist *zsl, double score, sds ele) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    unsigned int rank[ZSKIPLIST_MAXLEVEL];
+    int i, level;
+
+    serverAssert(!isnan(score));
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        /* store rank that is crossed to reach the insert position */
+        rank[i] = i == (zsl->level-1) ? 0 : rank[i+1];
+        while (x->level[i].forward &&
+                (x->level[i].forward->score < score ||
+                    (x->level[i].forward->score == score &&
+                    sdscmp(x->level[i].forward->ele,ele) < 0)))
+        {
+            rank[i] += x->level[i].span;
+            x = x->level[i].forward;
+        }
+        update[i] = x;
+    }
+    /* we assume the element is not already inside, since we allow duplicated
+     * scores, reinserting the same element should never happen since the
+     * caller of zslInsert() should test in the hash table if the element is
+     * already inside or not. */
+    level = zslRandomLevel();
+    if (level > zsl->level) {
+        for (i = zsl->level; i < level; i++) {
+            rank[i] = 0;
+            update[i] = zsl->header;
+            update[i]->level[i].span = zsl->length;
+        }
+        zsl->level = level;
+    }
+    x = zslCreateNode(level,score,ele);
+    for (i = 0; i < level; i++) {
+        x->level[i].forward = update[i]->level[i].forward;
+        update[i]->level[i].forward = x;
+
+        /* update span covered by update[i] as x is inserted here */
+        x->level[i].span = update[i]->level[i].span - (rank[0] - rank[i]);
+        update[i]->level[i].span = (rank[0] - rank[i]) + 1;
+    }
+
+    /* increment span for untouched levels */
+    for (i = level; i < zsl->level; i++) {
+        update[i]->level[i].span++;
+    }
+
+    x->backward = (update[0] == zsl->header) ? NULL : update[0];
+    if (x->level[0].forward)
+        x->level[0].forward->backward = x;
+    else
+        zsl->tail = x;
+    zsl->length++;
+    return x;
+}
+
+/* Internal function used by zslDelete, zslDeleteRangeByScore and
+ * zslDeleteRangeByRank. */
+void zslDeleteNode(zskiplist *zsl, zskiplistNode *x, zskiplistNode **update) {
+    int i;
+    for (i = 0; i < zsl->level; i++) {
+        if (update[i]->level[i].forward == x) {
+            update[i]->level[i].span += x->level[i].span - 1;
+            update[i]->level[i].forward = x->level[i].forward;
+        } else {
+            update[i]->level[i].span -= 1;
+        }
+    }
+    if (x->level[0].forward) {
+        x->level[0].forward->backward = x->backward;
+    } else {
+        zsl->tail = x->backward;
+    }
+    while(zsl->level > 1 && zsl->header->level[zsl->level-1].forward == NULL)
+        zsl->level--;
+    zsl->length--;
+}
+
+/* Delete an element with matching score/element from the skiplist.
+ * The function returns 1 if the node was found and deleted, otherwise
+ * 0 is returned.
+ *
+ * If 'node' is NULL the deleted node is freed by zslFreeNode(), otherwise
+ * it is not freed (but just unlinked) and *node is set to the node pointer,
+ * so that it is possible for the caller to reuse the node (including the
+ * referenced SDS string at node->ele). */
+int zslDelete(zskiplist *zsl, double score, sds ele, zskiplistNode **node) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    int i;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+                (x->level[i].forward->score < score ||
+                    (x->level[i].forward->score == score &&
+                     sdscmp(x->level[i].forward->ele,ele) < 0)))
+        {
+            x = x->level[i].forward;
+        }
+        update[i] = x;
+    }
+    /* We may have multiple elements with the same score, what we need
+     * is to find the element with both the right score and object. */
+    x = x->level[0].forward;
+    if (x && score == x->score && sdscmp(x->ele,ele) == 0) {
+        zslDeleteNode(zsl, x, update);
+        if (!node)
+            zslFreeNode(x);
+        else
+            *node = x;
+        return 1;
+    }
+    return 0; /* not found */
+}
+
+/* Update the score of an element inside the sorted set skiplist.
+ * Note that the element must exist and must match 'score'.
+ * This function does not update the score in the hash table side, the
+ * caller should take care of it.
+ *
+ * Note that this function attempts to just update the node, in case after
+ * the score update, the node would be exactly at the same position.
+ * Otherwise the skiplist is modified by removing and re-adding a new
+ * element, which is more costly.
+ *
+ * The function returns the updated element skiplist node pointer. */
+zskiplistNode *zslUpdateScore(zskiplist *zsl, double curscore, sds ele, double newscore) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    int i;
+
+    /* We need to seek to element to update to start: this is useful anyway,
+     * we'll have to update or remove it. */
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+                (x->level[i].forward->score < curscore ||
+                    (x->level[i].forward->score == curscore &&
+                     sdscmp(x->level[i].forward->ele,ele) < 0)))
+        {
+            x = x->level[i].forward;
+        }
+        update[i] = x;
+    }
+
+    /* Jump to our element: note that this function assumes that the
+     * element with the matching score exists. */
+    x = x->level[0].forward;
+    serverAssert(x && curscore == x->score && sdscmp(x->ele,ele) == 0);
+
+    /* If the node, after the score update, would be still exactly
+     * at the same position, we can just update the score without
+     * actually removing and re-inserting the element in the skiplist. */
+    if ((x->backward == NULL || x->backward->score < newscore) &&
+        (x->level[0].forward == NULL || x->level[0].forward->score > newscore))
+    {
+        x->score = newscore;
+        return x;
+    }
+
+    /* No way to reuse the old node: we need to remove and insert a new
+     * one at a different place. */
+    zslDeleteNode(zsl, x, update);
+    zskiplistNode *newnode = zslInsert(zsl,newscore,x->ele);
+    /* We reused the old node x->ele SDS string, free the node now
+     * since zslInsert created a new one. */
+    x->ele = NULL;
+    zslFreeNode(x);
+    return newnode;
+}
+
+int zslValueGteMin(double value, zrangespec *spec) {
+    return spec->minex ? (value > spec->min) : (value >= spec->min);
+}
+
+int zslValueLteMax(double value, zrangespec *spec) {
+    return spec->maxex ? (value < spec->max) : (value <= spec->max);
+}
+
+/* Returns if there is a part of the zset is in range. */
+int zslIsInRange(zskiplist *zsl, zrangespec *range) {
+    zskiplistNode *x;
+
+    /* Test for ranges that will always be empty. */
+    if (range->min > range->max ||
+            (range->min == range->max && (range->minex || range->maxex)))
+        return 0;
+    x = zsl->tail;
+    if (x == NULL || !zslValueGteMin(x->score,range))
+        return 0;
+    x = zsl->header->level[0].forward;
+    if (x == NULL || !zslValueLteMax(x->score,range))
+        return 0;
+    return 1;
+}
+
+/* Find the first node that is contained in the specified range.
+ * Returns NULL when no element is contained in the range. */
+zskiplistNode *zslFirstInRange(zskiplist *zsl, zrangespec *range) {
+    zskiplistNode *x;
+    int i;
+
+    /* If everything is out of range, return early. */
+    if (!zslIsInRange(zsl,range)) return NULL;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        /* Go forward while *OUT* of range. */
+        while (x->level[i].forward &&
+            !zslValueGteMin(x->level[i].forward->score,range))
+                x = x->level[i].forward;
+    }
+
+    /* This is an inner range, so the next node cannot be NULL. */
+    x = x->level[0].forward;
+    serverAssert(x != NULL);
+
+    /* Check if score <= max. */
+    if (!zslValueLteMax(x->score,range)) return NULL;
+    return x;
+}
+
+/* Find the last node that is contained in the specified range.
+ * Returns NULL when no element is contained in the range. */
+zskiplistNode *zslLastInRange(zskiplist *zsl, zrangespec *range) {
+    zskiplistNode *x;
+    int i;
+
+    /* If everything is out of range, return early. */
+    if (!zslIsInRange(zsl,range)) return NULL;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        /* Go forward while *IN* range. */
+        while (x->level[i].forward &&
+            zslValueLteMax(x->level[i].forward->score,range))
+                x = x->level[i].forward;
+    }
+
+    /* This is an inner range, so this node cannot be NULL. */
+    serverAssert(x != NULL);
+
+    /* Check if score >= min. */
+    if (!zslValueGteMin(x->score,range)) return NULL;
+    return x;
+}
+
+/* Delete all the elements with score between min and max from the skiplist.
+ * Both min and max can be inclusive or exclusive (see range->minex and
+ * range->maxex). When inclusive a score >= min && score <= max is deleted.
+ * Note that this function takes the reference to the hash table view of the
+ * sorted set, in order to remove the elements from the hash table too. */
+unsigned long zslDeleteRangeByScore(zskiplist *zsl, zrangespec *range, dict *dict) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    unsigned long removed = 0;
+    int i;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+            !zslValueGteMin(x->level[i].forward->score, range))
+                x = x->level[i].forward;
+        update[i] = x;
+    }
+
+    /* Current node is the last with score < or <= min. */
+    x = x->level[0].forward;
+
+    /* Delete nodes while in range. */
+    while (x && zslValueLteMax(x->score, range)) {
+        zskiplistNode *next = x->level[0].forward;
+        zslDeleteNode(zsl,x,update);
+        dictDelete(dict,x->ele);
+        zslFreeNode(x); /* Here is where x->ele is actually released. */
+        removed++;
+        x = next;
+    }
+    return removed;
+}
+
+unsigned long zslDeleteRangeByLex(zskiplist *zsl, zlexrangespec *range, dict *dict) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    unsigned long removed = 0;
+    int i;
+
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+            !zslLexValueGteMin(x->level[i].forward->ele,range))
+                x = x->level[i].forward;
+        update[i] = x;
+    }
+
+    /* Current node is the last with score < or <= min. */
+    x = x->level[0].forward;
+
+    /* Delete nodes while in range. */
+    while (x && zslLexValueLteMax(x->ele,range)) {
+        zskiplistNode *next = x->level[0].forward;
+        zslDeleteNode(zsl,x,update);
+        dictDelete(dict,x->ele);
+        zslFreeNode(x); /* Here is where x->ele is actually released. */
+        removed++;
+        x = next;
+    }
+    return removed;
+}
+
+/* Delete all the elements with rank between start and end from the skiplist.
+ * Start and end are inclusive. Note that start and end need to be 1-based */
+unsigned long zslDeleteRangeByRank(zskiplist *zsl, unsigned int start, unsigned int end, dict *dict) {
+    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
+    unsigned long traversed = 0, removed = 0;
+    int i;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward && (traversed + x->level[i].span) < start) {
+            traversed += x->level[i].span;
+            x = x->level[i].forward;
+        }
+        update[i] = x;
+    }
+
+    traversed++;
+    x = x->level[0].forward;
+    while (x && traversed <= end) {
+        zskiplistNode *next = x->level[0].forward;
+        zslDeleteNode(zsl,x,update);
+        dictDelete(dict,x->ele);
+        zslFreeNode(x);
+        removed++;
+        traversed++;
+        x = next;
+    }
+    return removed;
+}
+
+/* Find the rank for an element by both score and key.
+ * Returns 0 when the element cannot be found, rank otherwise.
+ * Note that the rank is 1-based due to the span of zsl->header to the
+ * first element. */
+unsigned long zslGetRank(zskiplist *zsl, double score, sds ele) {
+    zskiplistNode *x;
+    unsigned long rank = 0;
+    int i;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward &&
+            (x->level[i].forward->score < score ||
+                (x->level[i].forward->score == score &&
+                sdscmp(x->level[i].forward->ele,ele) <= 0))) {
+            rank += x->level[i].span;
+            x = x->level[i].forward;
+        }
+
+        /* x might be equal to zsl->header, so test if obj is non-NULL */
+        if (x->ele && sdscmp(x->ele,ele) == 0) {
+            return rank;
+        }
+    }
+    return 0;
+}
+
+/* Finds an element by its rank. The rank argument needs to be 1-based. */
+zskiplistNode* zslGetElementByRank(zskiplist *zsl, unsigned long rank) {
+    zskiplistNode *x;
+    unsigned long traversed = 0;
+    int i;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        while (x->level[i].forward && (traversed + x->level[i].span) <= rank)
+        {
+            traversed += x->level[i].span;
+            x = x->level[i].forward;
+        }
+        if (traversed == rank) {
+            return x;
+        }
+    }
+    return NULL;
+}
+
+/* Populate the rangespec according to the objects min and max. */
+static int zslParseRange(robj *min, robj *max, zrangespec *spec) {
+    char *eptr;
+    spec->minex = spec->maxex = 0;
+
+    /* Parse the min-max interval. If one of the values is prefixed
+     * by the "(" character, it's considered "open". For instance
+     * ZRANGEBYSCORE zset (1.5 (2.5 will match min < x < max
+     * ZRANGEBYSCORE zset 1.5 2.5 will instead match min <= x <= max */
+    if (min->encoding == OBJ_ENCODING_INT) {
+        spec->min = (long)min->ptr;
+    } else {
+        if (((char*)min->ptr)[0] == '(') {
+            spec->min = strtod((char*)min->ptr+1,&eptr);
+            if (eptr[0] != '\0' || isnan(spec->min)) return C_ERR;
+            spec->minex = 1;
+        } else {
+            spec->min = strtod((char*)min->ptr,&eptr);
+            if (eptr[0] != '\0' || isnan(spec->min)) return C_ERR;
+        }
+    }
+    if (max->encoding == OBJ_ENCODING_INT) {
+        spec->max = (long)max->ptr;
+    } else {
+        if (((char*)max->ptr)[0] == '(') {
+            spec->max = strtod((char*)max->ptr+1,&eptr);
+            if (eptr[0] != '\0' || isnan(spec->max)) return C_ERR;
+            spec->maxex = 1;
+        } else {
+            spec->max = strtod((char*)max->ptr,&eptr);
+            if (eptr[0] != '\0' || isnan(spec->max)) return C_ERR;
+        }
+    }
+
+    return C_OK;
+}
+
+/* ------------------------ Lexicographic ranges ---------------------------- */
+
+/* Parse max or min argument of ZRANGEBYLEX.
+  * (foo means foo (open interval)
+  * [foo means foo (closed interval)
+  * - means the min string possible
+  * + means the max string possible
+  *
+  * If the string is valid the *dest pointer is set to the redis object
+  * that will be used for the comparison, and ex will be set to 0 or 1
+  * respectively if the item is exclusive or inclusive. C_OK will be
+  * returned.
+  *
+  * If the string is not a valid range C_ERR is returned, and the value
+  * of *dest and *ex is undefined. */
+int zslParseLexRangeItem(robj *item, sds *dest, int *ex) {
+    char *c = item->ptr;
+
+    switch(c[0]) {
+    case '+':
+        if (c[1] != '\0') return C_ERR;
+        *ex = 1;
+        *dest = shared.maxstring;
+        return C_OK;
+    case '-':
+        if (c[1] != '\0') return C_ERR;
+        *ex = 1;
+        *dest = shared.minstring;
+        return C_OK;
+    case '(':
+        *ex = 1;
+        *dest = sdsnewlen(c+1,sdslen(c)-1);
+        return C_OK;
+    case '[':
+        *ex = 0;
+        *dest = sdsnewlen(c+1,sdslen(c)-1);
+        return C_OK;
+    default:
+        return C_ERR;
+    }
+}
+
+/* Free a lex range structure, must be called only after zelParseLexRange()
+ * populated the structure with success (C_OK returned). */
+void zslFreeLexRange(zlexrangespec *spec) {
+    if (spec->min != shared.minstring &&
+        spec->min != shared.maxstring) sdsfree(spec->min);
+    if (spec->max != shared.minstring &&
+        spec->max != shared.maxstring) sdsfree(spec->max);
+}
+
+/* Populate the lex rangespec according to the objects min and max.
+ *
+ * Return C_OK on success. On error C_ERR is returned.
+ * When OK is returned the structure must be freed with zslFreeLexRange(),
+ * otherwise no release is needed. */
+int zslParseLexRange(robj *min, robj *max, zlexrangespec *spec) {
+    /* The range can't be valid if objects are integer encoded.
+     * Every item must start with ( or [. */
+    if (min->encoding == OBJ_ENCODING_INT ||
+        max->encoding == OBJ_ENCODING_INT) return C_ERR;
+
+    spec->min = spec->max = NULL;
+    if (zslParseLexRangeItem(min, &spec->min, &spec->minex) == C_ERR ||
+        zslParseLexRangeItem(max, &spec->max, &spec->maxex) == C_ERR) {
+        zslFreeLexRange(spec);
+        return C_ERR;
+    } else {
+        return C_OK;
+    }
+}
+
+/* This is just a wrapper to sdscmp() that is able to
+ * handle shared.minstring and shared.maxstring as the equivalent of
+ * -inf and +inf for strings */
+int sdscmplex(sds a, sds b) {
+    if (a == b) return 0;
+    if (a == shared.minstring || b == shared.maxstring) return -1;
+    if (a == shared.maxstring || b == shared.minstring) return 1;
+    return sdscmp(a,b);
+}
+
+int zslLexValueGteMin(sds value, zlexrangespec *spec) {
+    return spec->minex ?
+        (sdscmplex(value,spec->min) > 0) :
+        (sdscmplex(value,spec->min) >= 0);
+}
+
+int zslLexValueLteMax(sds value, zlexrangespec *spec) {
+    return spec->maxex ?
+        (sdscmplex(value,spec->max) < 0) :
+        (sdscmplex(value,spec->max) <= 0);
+}
+
+/* Returns if there is a part of the zset is in the lex range. */
+int zslIsInLexRange(zskiplist *zsl, zlexrangespec *range) {
+    zskiplistNode *x;
+
+    /* Test for ranges that will always be empty. */
+    int cmp = sdscmplex(range->min,range->max);
+    if (cmp > 0 || (cmp == 0 && (range->minex || range->maxex)))
+        return 0;
+    x = zsl->tail;
+    if (x == NULL || !zslLexValueGteMin(x->ele,range))
+        return 0;
+    x = zsl->header->level[0].forward;
+    if (x == NULL || !zslLexValueLteMax(x->ele,range))
+        return 0;
+    return 1;
+}
+
+/* Find the first node that is contained in the specified lex range.
+ * Returns NULL when no element is contained in the range. */
+zskiplistNode *zslFirstInLexRange(zskiplist *zsl, zlexrangespec *range) {
+    zskiplistNode *x;
+    int i;
+
+    /* If everything is out of range, return early. */
+    if (!zslIsInLexRange(zsl,range)) return NULL;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        /* Go forward while *OUT* of range. */
+        while (x->level[i].forward &&
+            !zslLexValueGteMin(x->level[i].forward->ele,range))
+                x = x->level[i].forward;
+    }
+
+    /* This is an inner range, so the next node cannot be NULL. */
+    x = x->level[0].forward;
+    serverAssert(x != NULL);
+
+    /* Check if score <= max. */
+    if (!zslLexValueLteMax(x->ele,range)) return NULL;
+    return x;
+}
+
+/* Find the last node that is contained in the specified range.
+ * Returns NULL when no element is contained in the range. */
+zskiplistNode *zslLastInLexRange(zskiplist *zsl, zlexrangespec *range) {
+    zskiplistNode *x;
+    int i;
+
+    /* If everything is out of range, return early. */
+    if (!zslIsInLexRange(zsl,range)) return NULL;
+
+    x = zsl->header;
+    for (i = zsl->level-1; i >= 0; i--) {
+        /* Go forward while *IN* range. */
+        while (x->level[i].forward &&
+            zslLexValueLteMax(x->level[i].forward->ele,range))
+                x = x->level[i].forward;
+    }
+
+    /* This is an inner range, so this node cannot be NULL. */
+    serverAssert(x != NULL);
+
+    /* Check if score >= min. */
+    if (!zslLexValueGteMin(x->ele,range)) return NULL;
+    return x;
+}
+
+/*-----------------------------------------------------------------------------
+ * Ziplist-backed sorted set API
+ *----------------------------------------------------------------------------*/
+
+double zzlStrtod(unsigned char *vstr, unsigned int vlen) {
+    char buf[128];
+    if (vlen > sizeof(buf))
+        vlen = sizeof(buf);
+    memcpy(buf,vstr,vlen);
+    buf[vlen] = '\0';
+    return strtod(buf,NULL);
+ }
+
+double zzlGetScore(unsigned char *sptr) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vlong;
+    double score;
+
+    serverAssert(sptr != NULL);
+    serverAssert(ziplistGet(sptr,&vstr,&vlen,&vlong));
+
+    if (vstr) {
+        score = zzlStrtod(vstr,vlen);
+    } else {
+        score = vlong;
+    }
+
+    return score;
+}
+
+/* Return a ziplist element as an SDS string. */
+sds ziplistGetObject(unsigned char *sptr) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vlong;
+
+    serverAssert(sptr != NULL);
+    serverAssert(ziplistGet(sptr,&vstr,&vlen,&vlong));
+
+    if (vstr) {
+        return sdsnewlen((char*)vstr,vlen);
+    } else {
+        return sdsfromlonglong(vlong);
+    }
+}
+
+/* Compare element in sorted set with given element. */
+int zzlCompareElements(unsigned char *eptr, unsigned char *cstr, unsigned int clen) {
+    unsigned char *vstr;
+    unsigned int vlen;
+    long long vlong;
+    unsigned char vbuf[32];
+    int minlen, cmp;
+
+    serverAssert(ziplistGet(eptr,&vstr,&vlen,&vlong));
+    if (vstr == NULL) {
+        /* Store string representation of long long in buf. */
+        vlen = ll2string((char*)vbuf,sizeof(vbuf),vlong);
+        vstr = vbuf;
+    }
+
+    minlen = (vlen < clen) ? vlen : clen;
+    cmp = memcmp(vstr,cstr,minlen);
+    if (cmp == 0) return vlen-clen;
+    return cmp;
+}
+
+unsigned int zzlLength(unsigned char *zl) {
+    return ziplistLen(zl)/2;
+}
+
+/* Move to next entry based on the values in eptr and sptr. Both are set to
+ * NULL when there is no next entry. */
+void zzlNext(unsigned char *zl, unsigned char **eptr, unsigned char **sptr) {
+    unsigned char *_eptr, *_sptr;
+    serverAssert(*eptr != NULL && *sptr != NULL);
+
+    _eptr = ziplistNext(zl,*sptr);
+    if (_eptr != NULL) {
+        _sptr = ziplistNext(zl,_eptr);
+        serverAssert(_sptr != NULL);
+    } else {
+        /* No next entry. */
+        _sptr = NULL;
+    }
+
+    *eptr = _eptr;
+    *sptr = _sptr;
+}
+
+/* Move to the previous entry based on the values in eptr and sptr. Both are
+ * set to NULL when there is no next entry. */
+void zzlPrev(unsigned char *zl, unsigned char **eptr, unsigned char **sptr) {
+    unsigned char *_eptr, *_sptr;
+    serverAssert(*eptr != NULL && *sptr != NULL);
+
+    _sptr = ziplistPrev(zl,*eptr);
+    if (_sptr != NULL) {
+        _eptr = ziplistPrev(zl,_sptr);
+        serverAssert(_eptr != NULL);
+    } else {
+        /* No previous entry. */
+        _eptr = NULL;
+    }
+
+    *eptr = _eptr;
+    *sptr = _sptr;
+}
+
+/* Returns if there is a part of the zset is in range. Should only be used
+ * internally by zzlFirstInRange and zzlLastInRange. */
+int zzlIsInRange(unsigned char *zl, zrangespec *range) {
+    unsigned char *p;
+    double score;
+
+    /* Test for ranges that will always be empty. */
+    if (range->min > range->max ||
+            (range->min == range->max && (range->minex || range->maxex)))
+        return 0;
+
+    p = ziplistIndex(zl,-1); /* Last score. */
+    if (p == NULL) return 0; /* Empty sorted set */
+    score = zzlGetScore(p);
+    if (!zslValueGteMin(score,range))
+        return 0;
+
+    p = ziplistIndex(zl,1); /* First score. */
+    serverAssert(p != NULL);
+    score = zzlGetScore(p);
+    if (!zslValueLteMax(score,range))
+        return 0;
+
+    return 1;
+}
+
+/* Find pointer to the first element contained in the specified range.
+ * Returns NULL when no element is contained in the range. */
+unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range) {
+    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
+    double score;
+
+    /* If everything is out of range, return early. */
+    if (!zzlIsInRange(zl,range)) return NULL;
+
+    while (eptr != NULL) {
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+
+        score = zzlGetScore(sptr);
+        if (zslValueGteMin(score,range)) {
+            /* Check if score <= max. */
+            if (zslValueLteMax(score,range))
+                return eptr;
+            return NULL;
+        }
+
+        /* Move to next element. */
+        eptr = ziplistNext(zl,sptr);
+    }
+
+    return NULL;
+}
+
+/* Find pointer to the last element contained in the specified range.
+ * Returns NULL when no element is contained in the range. */
+unsigned char *zzlLastInRange(unsigned char *zl, zrangespec *range) {
+    unsigned char *eptr = ziplistIndex(zl,-2), *sptr;
+    double score;
+
+    /* If everything is out of range, return early. */
+    if (!zzlIsInRange(zl,range)) return NULL;
+
+    while (eptr != NULL) {
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+
+        score = zzlGetScore(sptr);
+        if (zslValueLteMax(score,range)) {
+            /* Check if score >= min. */
+            if (zslValueGteMin(score,range))
+                return eptr;
+            return NULL;
+        }
+
+        /* Move to previous element by moving to the score of previous element.
+         * When this returns NULL, we know there also is no element. */
+        sptr = ziplistPrev(zl,eptr);
+        if (sptr != NULL)
+            serverAssert((eptr = ziplistPrev(zl,sptr)) != NULL);
+        else
+            eptr = NULL;
+    }
+
+    return NULL;
+}
+
+int zzlLexValueGteMin(unsigned char *p, zlexrangespec *spec) {
+    sds value = ziplistGetObject(p);
+    int res = zslLexValueGteMin(value,spec);
+    sdsfree(value);
+    return res;
+}
+
+int zzlLexValueLteMax(unsigned char *p, zlexrangespec *spec) {
+    sds value = ziplistGetObject(p);
+    int res = zslLexValueLteMax(value,spec);
+    sdsfree(value);
+    return res;
+}
+
+/* Returns if there is a part of the zset is in range. Should only be used
+ * internally by zzlFirstInRange and zzlLastInRange. */
+int zzlIsInLexRange(unsigned char *zl, zlexrangespec *range) {
+    unsigned char *p;
+
+    /* Test for ranges that will always be empty. */
+    int cmp = sdscmplex(range->min,range->max);
+    if (cmp > 0 || (cmp == 0 && (range->minex || range->maxex)))
+        return 0;
+
+    p = ziplistIndex(zl,-2); /* Last element. */
+    if (p == NULL) return 0;
+    if (!zzlLexValueGteMin(p,range))
+        return 0;
+
+    p = ziplistIndex(zl,0); /* First element. */
+    serverAssert(p != NULL);
+    if (!zzlLexValueLteMax(p,range))
+        return 0;
+
+    return 1;
+}
+
+/* Find pointer to the first element contained in the specified lex range.
+ * Returns NULL when no element is contained in the range. */
+unsigned char *zzlFirstInLexRange(unsigned char *zl, zlexrangespec *range) {
+    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
+
+    /* If everything is out of range, return early. */
+    if (!zzlIsInLexRange(zl,range)) return NULL;
+
+    while (eptr != NULL) {
+        if (zzlLexValueGteMin(eptr,range)) {
+            /* Check if score <= max. */
+            if (zzlLexValueLteMax(eptr,range))
+                return eptr;
+            return NULL;
+        }
+
+        /* Move to next element. */
+        sptr = ziplistNext(zl,eptr); /* This element score. Skip it. */
+        serverAssert(sptr != NULL);
+        eptr = ziplistNext(zl,sptr); /* Next element. */
+    }
+
+    return NULL;
+}
+
+/* Find pointer to the last element contained in the specified lex range.
+ * Returns NULL when no element is contained in the range. */
+unsigned char *zzlLastInLexRange(unsigned char *zl, zlexrangespec *range) {
+    unsigned char *eptr = ziplistIndex(zl,-2), *sptr;
+
+    /* If everything is out of range, return early. */
+    if (!zzlIsInLexRange(zl,range)) return NULL;
+
+    while (eptr != NULL) {
+        if (zzlLexValueLteMax(eptr,range)) {
+            /* Check if score >= min. */
+            if (zzlLexValueGteMin(eptr,range))
+                return eptr;
+            return NULL;
+        }
+
+        /* Move to previous element by moving to the score of previous element.
+         * When this returns NULL, we know there also is no element. */
+        sptr = ziplistPrev(zl,eptr);
+        if (sptr != NULL)
+            serverAssert((eptr = ziplistPrev(zl,sptr)) != NULL);
+        else
+            eptr = NULL;
+    }
+
+    return NULL;
+}
+
+unsigned char *zzlFind(unsigned char *zl, sds ele, double *score) {
+    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
+
+    while (eptr != NULL) {
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+
+        if (ziplistCompare(eptr,(unsigned char*)ele,sdslen(ele))) {
+            /* Matching element, pull out score. */
+            if (score != NULL) *score = zzlGetScore(sptr);
+            return eptr;
+        }
+
+        /* Move to next element. */
+        eptr = ziplistNext(zl,sptr);
+    }
+    return NULL;
+}
+
+/* Delete (element,score) pair from ziplist. Use local copy of eptr because we
+ * don't want to modify the one given as argument. */
+unsigned char *zzlDelete(unsigned char *zl, unsigned char *eptr) {
+    unsigned char *p = eptr;
+
+    /* TODO: add function to ziplist API to delete N elements from offset. */
+    zl = ziplistDelete(zl,&p);
+    zl = ziplistDelete(zl,&p);
+    return zl;
+}
+
+unsigned char *zzlInsertAt(unsigned char *zl, unsigned char *eptr, sds ele, double score) {
+    unsigned char *sptr;
+    char scorebuf[128];
+    int scorelen;
+    size_t offset;
+
+    scorelen = d2string(scorebuf,sizeof(scorebuf),score);
+    if (eptr == NULL) {
+        zl = ziplistPush(zl,(unsigned char*)ele,sdslen(ele),ZIPLIST_TAIL);
+        zl = ziplistPush(zl,(unsigned char*)scorebuf,scorelen,ZIPLIST_TAIL);
+    } else {
+        /* Keep offset relative to zl, as it might be re-allocated. */
+        offset = eptr-zl;
+        zl = ziplistInsert(zl,eptr,(unsigned char*)ele,sdslen(ele));
+        eptr = zl+offset;
+
+        /* Insert score after the element. */
+        serverAssert((sptr = ziplistNext(zl,eptr)) != NULL);
+        zl = ziplistInsert(zl,sptr,(unsigned char*)scorebuf,scorelen);
+    }
+    return zl;
+}
+
+/* Insert (element,score) pair in ziplist. This function assumes the element is
+ * not yet present in the list. */
+unsigned char *zzlInsert(unsigned char *zl, sds ele, double score) {
+    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
+    double s;
+
+    while (eptr != NULL) {
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+        s = zzlGetScore(sptr);
+
+        if (s > score) {
+            /* First element with score larger than score for element to be
+             * inserted. This means we should take its spot in the list to
+             * maintain ordering. */
+            zl = zzlInsertAt(zl,eptr,ele,score);
+            break;
+        } else if (s == score) {
+            /* Ensure lexicographical ordering for elements. */
+            if (zzlCompareElements(eptr,(unsigned char*)ele,sdslen(ele)) > 0) {
+                zl = zzlInsertAt(zl,eptr,ele,score);
+                break;
+            }
+        }
+
+        /* Move to next element. */
+        eptr = ziplistNext(zl,sptr);
+    }
+
+    /* Push on tail of list when it was not yet inserted. */
+    if (eptr == NULL)
+        zl = zzlInsertAt(zl,NULL,ele,score);
+    return zl;
+}
+
+unsigned char *zzlDeleteRangeByScore(unsigned char *zl, zrangespec *range, unsigned long *deleted) {
+    unsigned char *eptr, *sptr;
+    double score;
+    unsigned long num = 0;
+
+    if (deleted != NULL) *deleted = 0;
+
+    eptr = zzlFirstInRange(zl,range);
+    if (eptr == NULL) return zl;
+
+    /* When the tail of the ziplist is deleted, eptr will point to the sentinel
+     * byte and ziplistNext will return NULL. */
+    while ((sptr = ziplistNext(zl,eptr)) != NULL) {
+        score = zzlGetScore(sptr);
+        if (zslValueLteMax(score,range)) {
+            /* Delete both the element and the score. */
+            zl = ziplistDelete(zl,&eptr);
+            zl = ziplistDelete(zl,&eptr);
+            num++;
+        } else {
+            /* No longer in range. */
+            break;
+        }
+    }
+
+    if (deleted != NULL) *deleted = num;
+    return zl;
+}
+
+unsigned char *zzlDeleteRangeByLex(unsigned char *zl, zlexrangespec *range, unsigned long *deleted) {
+    unsigned char *eptr, *sptr;
+    unsigned long num = 0;
+
+    if (deleted != NULL) *deleted = 0;
+
+    eptr = zzlFirstInLexRange(zl,range);
+    if (eptr == NULL) return zl;
+
+    /* When the tail of the ziplist is deleted, eptr will point to the sentinel
+     * byte and ziplistNext will return NULL. */
+    while ((sptr = ziplistNext(zl,eptr)) != NULL) {
+        if (zzlLexValueLteMax(eptr,range)) {
+            /* Delete both the element and the score. */
+            zl = ziplistDelete(zl,&eptr);
+            zl = ziplistDelete(zl,&eptr);
+            num++;
+        } else {
+            /* No longer in range. */
+            break;
+        }
+    }
+
+    if (deleted != NULL) *deleted = num;
+    return zl;
+}
+
+/* Delete all the elements with rank between start and end from the skiplist.
+ * Start and end are inclusive. Note that start and end need to be 1-based */
+unsigned char *zzlDeleteRangeByRank(unsigned char *zl, unsigned int start, unsigned int end, unsigned long *deleted) {
+    unsigned int num = (end-start)+1;
+    if (deleted) *deleted = num;
+    zl = ziplistDeleteRange(zl,2*(start-1),2*num);
+    return zl;
+}
+
+/*-----------------------------------------------------------------------------
+ * Common sorted set API
+ *----------------------------------------------------------------------------*/
+
+unsigned long zsetLength(const robj *zobj) {
+    unsigned long length = 0;
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        length = zzlLength(zobj->ptr);
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        length = ((const zset*)zobj->ptr)->zsl->length;
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+    return length;
+}
+
+void zsetConvert(robj *zobj, int encoding) {
+    zset *zs;
+    zskiplistNode *node, *next;
+    sds ele;
+    double score;
+
+    if (zobj->encoding == encoding) return;
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vlong;
+
+        if (encoding != OBJ_ENCODING_SKIPLIST)
+            serverPanic("Unknown target encoding");
+
+        zs = zmalloc(sizeof(*zs));
+        zs->dict = dictCreate(&zsetDictType,NULL);
+        zs->zsl = zslCreate();
+
+        eptr = ziplistIndex(zl,0);
+        serverAssertWithInfo(NULL,zobj,eptr != NULL);
+        sptr = ziplistNext(zl,eptr);
+        serverAssertWithInfo(NULL,zobj,sptr != NULL);
+
+        while (eptr != NULL) {
+            score = zzlGetScore(sptr);
+            serverAssertWithInfo(NULL,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
+            if (vstr == NULL)
+                ele = sdsfromlonglong(vlong);
+            else
+                ele = sdsnewlen((char*)vstr,vlen);
+
+            node = zslInsert(zs->zsl,score,ele);
+            serverAssert(dictAdd(zs->dict,ele,&node->score) == DICT_OK);
+            zzlNext(zl,&eptr,&sptr);
+        }
+
+        zfree(zobj->ptr);
+        zobj->ptr = zs;
+        zobj->encoding = OBJ_ENCODING_SKIPLIST;
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        unsigned char *zl = ziplistNew();
+
+        if (encoding != OBJ_ENCODING_ZIPLIST)
+            serverPanic("Unknown target encoding");
+
+        /* Approach similar to zslFree(), since we want to free the skiplist at
+         * the same time as creating the ziplist. */
+        zs = zobj->ptr;
+        dictRelease(zs->dict);
+        node = zs->zsl->header->level[0].forward;
+        zfree(zs->zsl->header);
+        zfree(zs->zsl);
+
+        while (node) {
+            zl = zzlInsertAt(zl,NULL,node->ele,node->score);
+            next = node->level[0].forward;
+            zslFreeNode(node);
+            node = next;
+        }
+
+        zfree(zs);
+        zobj->ptr = zl;
+        zobj->encoding = OBJ_ENCODING_ZIPLIST;
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+}
+
+/* Convert the sorted set object into a ziplist if it is not already a ziplist
+ * and if the number of elements and the maximum element size and total elements size
+ * are within the expected ranges. */
+void zsetConvertToZiplistIfNeeded(robj *zobj, size_t maxelelen, size_t totelelen) {
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) return;
+    zset *zset = zobj->ptr;
+
+    if (zset->zsl->length <= server.zset_max_ziplist_entries &&
+        maxelelen <= server.zset_max_ziplist_value &&
+        ziplistSafeToAdd(NULL, totelelen))
+    {
+        zsetConvert(zobj,OBJ_ENCODING_ZIPLIST);
+    }
+}
+
+/* Return (by reference) the score of the specified member of the sorted set
+ * storing it into *score. If the element does not exist C_ERR is returned
+ * otherwise C_OK is returned and *score is correctly populated.
+ * If 'zobj' or 'member' is NULL, C_ERR is returned. */
+int zsetScore(robj *zobj, sds member, double *score) {
+    if (!zobj || !member) return C_ERR;
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        if (zzlFind(zobj->ptr, member, score) == NULL) return C_ERR;
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        dictEntry *de = dictFind(zs->dict, member);
+        if (de == NULL) return C_ERR;
+        *score = *(double*)dictGetVal(de);
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+    return C_OK;
+}
+
+/* Add a new element or update the score of an existing element in a sorted
+ * set, regardless of its encoding.
+ *
+ * The set of flags change the command behavior. 
+ *
+ * The input flags are the following:
+ *
+ * ZADD_INCR: Increment the current element score by 'score' instead of updating
+ *            the current element score. If the element does not exist, we
+ *            assume 0 as previous score.
+ * ZADD_NX:   Perform the operation only if the element does not exist.
+ * ZADD_XX:   Perform the operation only if the element already exist.
+ * ZADD_GT:   Perform the operation on existing elements only if the new score is 
+ *            greater than the current score.
+ * ZADD_LT:   Perform the operation on existing elements only if the new score is 
+ *            less than the current score.
+ *
+ * When ZADD_INCR is used, the new score of the element is stored in
+ * '*newscore' if 'newscore' is not NULL.
+ *
+ * The returned flags are the following:
+ *
+ * ZADD_NAN:     The resulting score is not a number.
+ * ZADD_ADDED:   The element was added (not present before the call).
+ * ZADD_UPDATED: The element score was updated.
+ * ZADD_NOP:     No operation was performed because of NX or XX.
+ *
+ * Return value:
+ *
+ * The function returns 1 on success, and sets the appropriate flags
+ * ADDED or UPDATED to signal what happened during the operation (note that
+ * none could be set if we re-added an element using the same score it used
+ * to have, or in the case a zero increment is used).
+ *
+ * The function returns 0 on error, currently only when the increment
+ * produces a NAN condition, or when the 'score' value is NAN since the
+ * start.
+ *
+ * The command as a side effect of adding a new element may convert the sorted
+ * set internal encoding from ziplist to hashtable+skiplist.
+ *
+ * Memory management of 'ele':
+ *
+ * The function does not take ownership of the 'ele' SDS string, but copies
+ * it if needed. */
+int zsetAdd(robj *zobj, double score, sds ele, int in_flags, int *out_flags, double *newscore) {
+    /* Turn options into simple to check vars. */
+    int incr = (in_flags & ZADD_IN_INCR) != 0;
+    int nx = (in_flags & ZADD_IN_NX) != 0;
+    int xx = (in_flags & ZADD_IN_XX) != 0;
+    int gt = (in_flags & ZADD_IN_GT) != 0;
+    int lt = (in_flags & ZADD_IN_LT) != 0;
+    *out_flags = 0; /* We'll return our response flags. */
+    double curscore;
+
+    /* NaN as input is an error regardless of all the other parameters. */
+    if (isnan(score)) {
+        *out_flags = ZADD_OUT_NAN;
+        return 0;
+    }
+
+    /* Update the sorted set according to its encoding. */
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *eptr;
+
+        if ((eptr = zzlFind(zobj->ptr,ele,&curscore)) != NULL) {
+            /* NX? Return, same element already exists. */
+            if (nx) {
+                *out_flags |= ZADD_OUT_NOP;
+                return 1;
+            }
+
+            /* Prepare the score for the increment if needed. */
+            if (incr) {
+                score += curscore;
+                if (isnan(score)) {
+                    *out_flags |= ZADD_OUT_NAN;
+                    return 0;
+                }
+            }
+
+            /* GT/LT? Only update if score is greater/less than current. */
+            if ((lt && score >= curscore) || (gt && score <= curscore)) {
+                *out_flags |= ZADD_OUT_NOP;
+                return 1;
+            }
+
+            if (newscore) *newscore = score;
+
+            /* Remove and re-insert when score changed. */
+            if (score != curscore) {
+                zobj->ptr = zzlDelete(zobj->ptr,eptr);
+                zobj->ptr = zzlInsert(zobj->ptr,ele,score);
+                *out_flags |= ZADD_OUT_UPDATED;
+            }
+            return 1;
+        } else if (!xx) {
+            /* check if the element is too large or the list
+             * becomes too long *before* executing zzlInsert. */
+            if (zzlLength(zobj->ptr)+1 > server.zset_max_ziplist_entries ||
+                sdslen(ele) > server.zset_max_ziplist_value ||
+                !ziplistSafeToAdd(zobj->ptr, sdslen(ele)))
+            {
+                zsetConvert(zobj,OBJ_ENCODING_SKIPLIST);
+            } else {
+                zobj->ptr = zzlInsert(zobj->ptr,ele,score);
+                if (newscore) *newscore = score;
+                *out_flags |= ZADD_OUT_ADDED;
+                return 1;
+            }
+        } else {
+            *out_flags |= ZADD_OUT_NOP;
+            return 1;
+        }
+    }
+
+    /* Note that the above block handling ziplist would have either returned or
+     * converted the key to skiplist. */
+    if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplistNode *znode;
+        dictEntry *de;
+
+        de = dictFind(zs->dict,ele);
+        if (de != NULL) {
+            /* NX? Return, same element already exists. */
+            if (nx) {
+                *out_flags |= ZADD_OUT_NOP;
+                return 1;
+            }
+
+            curscore = *(double*)dictGetVal(de);
+
+            /* Prepare the score for the increment if needed. */
+            if (incr) {
+                score += curscore;
+                if (isnan(score)) {
+                    *out_flags |= ZADD_OUT_NAN;
+                    return 0;
+                }
+            }
+
+            /* GT/LT? Only update if score is greater/less than current. */
+            if ((lt && score >= curscore) || (gt && score <= curscore)) {
+                *out_flags |= ZADD_OUT_NOP;
+                return 1;
+            }
+
+            if (newscore) *newscore = score;
+
+            /* Remove and re-insert when score changes. */
+            if (score != curscore) {
+                znode = zslUpdateScore(zs->zsl,curscore,ele,score);
+                /* Note that we did not removed the original element from
+                 * the hash table representing the sorted set, so we just
+                 * update the score. */
+                dictGetVal(de) = &znode->score; /* Update score ptr. */
+                *out_flags |= ZADD_OUT_UPDATED;
+            }
+            return 1;
+        } else if (!xx) {
+            ele = sdsdup(ele);
+            znode = zslInsert(zs->zsl,score,ele);
+            serverAssert(dictAdd(zs->dict,ele,&znode->score) == DICT_OK);
+            *out_flags |= ZADD_OUT_ADDED;
+            if (newscore) *newscore = score;
+            return 1;
+        } else {
+            *out_flags |= ZADD_OUT_NOP;
+            return 1;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+    return 0; /* Never reached. */
+}
+
+/* Deletes the element 'ele' from the sorted set encoded as a skiplist+dict,
+ * returning 1 if the element existed and was deleted, 0 otherwise (the
+ * element was not there). It does not resize the dict after deleting the
+ * element. */
+static int zsetRemoveFromSkiplist(zset *zs, sds ele) {
+    dictEntry *de;
+    double score;
+
+    de = dictUnlink(zs->dict,ele);
+    if (de != NULL) {
+        /* Get the score in order to delete from the skiplist later. */
+        score = *(double*)dictGetVal(de);
+
+        /* Delete from the hash table and later from the skiplist.
+         * Note that the order is important: deleting from the skiplist
+         * actually releases the SDS string representing the element,
+         * which is shared between the skiplist and the hash table, so
+         * we need to delete from the skiplist as the final step. */
+        dictFreeUnlinkedEntry(zs->dict,de);
+
+        /* Delete from skiplist. */
+        int retval = zslDelete(zs->zsl,score,ele,NULL);
+        serverAssert(retval);
+
+        return 1;
+    }
+
+    return 0;
+}
+
+/* Delete the element 'ele' from the sorted set, returning 1 if the element
+ * existed and was deleted, 0 otherwise (the element was not there). */
+int zsetDel(robj *zobj, sds ele) {
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *eptr;
+
+        if ((eptr = zzlFind(zobj->ptr,ele,NULL)) != NULL) {
+            zobj->ptr = zzlDelete(zobj->ptr,eptr);
+            return 1;
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        if (zsetRemoveFromSkiplist(zs, ele)) {
+            if (htNeedsResize(zs->dict)) dictResize(zs->dict);
+            return 1;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+    return 0; /* No such element found. */
+}
+
+/* Given a sorted set object returns the 0-based rank of the object or
+ * -1 if the object does not exist.
+ *
+ * For rank we mean the position of the element in the sorted collection
+ * of elements. So the first element has rank 0, the second rank 1, and so
+ * forth up to length-1 elements.
+ *
+ * If 'reverse' is false, the rank is returned considering as first element
+ * the one with the lowest score. Otherwise if 'reverse' is non-zero
+ * the rank is computed considering as element with rank 0 the one with
+ * the highest score. */
+long zsetRank(robj *zobj, sds ele, int reverse) {
+    unsigned long llen;
+    unsigned long rank;
+
+    llen = zsetLength(zobj);
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+
+        eptr = ziplistIndex(zl,0);
+        serverAssert(eptr != NULL);
+        sptr = ziplistNext(zl,eptr);
+        serverAssert(sptr != NULL);
+
+        rank = 1;
+        while(eptr != NULL) {
+            if (ziplistCompare(eptr,(unsigned char*)ele,sdslen(ele)))
+                break;
+            rank++;
+            zzlNext(zl,&eptr,&sptr);
+        }
+
+        if (eptr != NULL) {
+            if (reverse)
+                return llen-rank;
+            else
+                return rank-1;
+        } else {
+            return -1;
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        dictEntry *de;
+        double score;
+
+        de = dictFind(zs->dict,ele);
+        if (de != NULL) {
+            score = *(double*)dictGetVal(de);
+            rank = zslGetRank(zsl,score,ele);
+            /* Existing elements always have a rank. */
+            serverAssert(rank != 0);
+            if (reverse)
+                return llen-rank;
+            else
+                return rank-1;
+        } else {
+            return -1;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+}
+
+/* This is a helper function for the COPY command.
+ * Duplicate a sorted set object, with the guarantee that the returned object
+ * has the same encoding as the original one.
+ *
+ * The resulting object always has refcount set to 1 */
+robj *zsetDup(robj *o) {
+    robj *zobj;
+    zset *zs;
+    zset *new_zs;
+
+    serverAssert(o->type == OBJ_ZSET);
+
+    /* Create a new sorted set object that have the same encoding as the original object's encoding */
+    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = o->ptr;
+        size_t sz = ziplistBlobLen(zl);
+        unsigned char *new_zl = zmalloc(sz);
+        memcpy(new_zl, zl, sz);
+        zobj = createObject(OBJ_ZSET, new_zl);
+        zobj->encoding = OBJ_ENCODING_ZIPLIST;
+    } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
+        zobj = createZsetObject();
+        zs = o->ptr;
+        new_zs = zobj->ptr;
+        dictExpand(new_zs->dict,dictSize(zs->dict));
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+        sds ele;
+        long llen = zsetLength(o);
+
+        /* We copy the skiplist elements from the greatest to the
+         * smallest (that's trivial since the elements are already ordered in
+         * the skiplist): this improves the load process, since the next loaded
+         * element will always be the smaller, so adding to the skiplist
+         * will always immediately stop at the head, making the insertion
+         * O(1) instead of O(log(N)). */
+        ln = zsl->tail;
+        while (llen--) {
+            ele = ln->ele;
+            sds new_ele = sdsdup(ele);
+            zskiplistNode *znode = zslInsert(new_zs->zsl,ln->score,new_ele);
+            dictAdd(new_zs->dict,new_ele,&znode->score);
+            ln = ln->backward;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+    return zobj;
+}
+
+/* callback for to check the ziplist doesn't have duplicate recoreds */
+static int _zsetZiplistValidateIntegrity(unsigned char *p, void *userdata) {
+    struct {
+        long count;
+        dict *fields;
+    } *data = userdata;
+
+    /* Even records are field names, add to dict and check that's not a dup */
+    if (((data->count) & 1) == 0) {
+        unsigned char *str;
+        unsigned int slen;
+        long long vll;
+        if (!ziplistGet(p, &str, &slen, &vll))
+            return 0;
+        sds field = str? sdsnewlen(str, slen): sdsfromlonglong(vll);;
+        if (dictAdd(data->fields, field, NULL) != DICT_OK) {
+            /* Duplicate, return an error */
+            sdsfree(field);
+            return 0;
+        }
+    }
+
+    (data->count)++;
+    return 1;
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we scan all the entries one by one. */
+int zsetZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep) {
+    if (!deep)
+        return ziplistValidateIntegrity(zl, size, 0, NULL, NULL);
+
+    /* Keep track of the field names to locate duplicate ones */
+    struct {
+        long count;
+        dict *fields;
+    } data = {0, dictCreate(&hashDictType, NULL)};
+
+    int ret = ziplistValidateIntegrity(zl, size, 1, _zsetZiplistValidateIntegrity, &data);
+
+    /* make sure we have an even number of records. */
+    if (data.count & 1)
+        ret = 0;
+
+    dictRelease(data.fields);
+    return ret;
+}
+
+/* Create a new sds string from the ziplist entry. */
+sds zsetSdsFromZiplistEntry(ziplistEntry *e) {
+    return e->sval ? sdsnewlen(e->sval, e->slen) : sdsfromlonglong(e->lval);
+}
+
+/* Reply with bulk string from the ziplist entry. */
+void zsetReplyFromZiplistEntry(client *c, ziplistEntry *e) {
+    if (e->sval)
+        addReplyBulkCBuffer(c, e->sval, e->slen);
+    else
+        addReplyBulkLongLong(c, e->lval);
+}
+
+
+/* Return random element from a non empty zset.
+ * 'key' and 'val' will be set to hold the element.
+ * The memory in `key` is not to be freed or modified by the caller.
+ * 'score' can be NULL in which case it's not extracted. */
+void zsetTypeRandomElement(robj *zsetobj, unsigned long zsetsize, ziplistEntry *key, double *score) {
+    if (zsetobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zsetobj->ptr;
+        dictEntry *de = dictGetFairRandomKey(zs->dict);
+        sds s = dictGetKey(de);
+        key->sval = (unsigned char*)s;
+        key->slen = sdslen(s);
+        if (score)
+            *score = *(double*)dictGetVal(de);
+    } else if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        ziplistEntry val;
+        ziplistRandomPair(zsetobj->ptr, zsetsize, key, &val);
+        if (score) {
+            if (val.sval) {
+                *score = zzlStrtod(val.sval,val.slen);
+            } else {
+                *score = (double)val.lval;
+            }
+        }
+    } else {
+        serverPanic("Unknown zset encoding");
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Sorted set commands
+ *----------------------------------------------------------------------------*/
+
+/* This generic command implements both ZADD and ZINCRBY. */
+void zaddGenericCommand(client *c, int flags) {
+    static char *nanerr = "resulting score is not a number (NaN)";
+    robj *key = c->argv[1];
+    robj *zobj;
+    sds ele;
+    double score = 0, *scores = NULL;
+    int j, elements, ch = 0;
+    int scoreidx = 0;
+    /* The following vars are used in order to track what the command actually
+     * did during the execution, to reply to the client and to trigger the
+     * notification of keyspace change. */
+    int added = 0;      /* Number of new elements added. */
+    int updated = 0;    /* Number of elements with updated score. */
+    int processed = 0;  /* Number of elements processed, may remain zero with
+                           options like XX. */
+
+    /* Parse options. At the end 'scoreidx' is set to the argument position
+     * of the score of the first score-element pair. */
+    scoreidx = 2;
+    while(scoreidx < c->argc) {
+        char *opt = c->argv[scoreidx]->ptr;
+        if (!strcasecmp(opt,"nx")) flags |= ZADD_IN_NX;
+        else if (!strcasecmp(opt,"xx")) flags |= ZADD_IN_XX;
+        else if (!strcasecmp(opt,"ch")) ch = 1; /* Return num of elements added or updated. */
+        else if (!strcasecmp(opt,"incr")) flags |= ZADD_IN_INCR;
+        else if (!strcasecmp(opt,"gt")) flags |= ZADD_IN_GT;
+        else if (!strcasecmp(opt,"lt")) flags |= ZADD_IN_LT;
+        else break;
+        scoreidx++;
+    }
+
+    /* Turn options into simple to check vars. */
+    int incr = (flags & ZADD_IN_INCR) != 0;
+    int nx = (flags & ZADD_IN_NX) != 0;
+    int xx = (flags & ZADD_IN_XX) != 0;
+    int gt = (flags & ZADD_IN_GT) != 0;
+    int lt = (flags & ZADD_IN_LT) != 0;
+
+    /* After the options, we expect to have an even number of args, since
+     * we expect any number of score-element pairs. */
+    elements = c->argc-scoreidx;
+    if (elements % 2 || !elements) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+    elements /= 2; /* Now this holds the number of score-element pairs. */
+
+    /* Check for incompatible options. */
+    if (nx && xx) {
+        addReplyError(c,
+            "XX and NX options at the same time are not compatible");
+        return;
+    }
+    
+    if ((gt && nx) || (lt && nx) || (gt && lt)) {
+        addReplyError(c,
+            "GT, LT, and/or NX options at the same time are not compatible");
+        return;
+    }
+    /* Note that XX is compatible with either GT or LT */
+
+    if (incr && elements > 1) {
+        addReplyError(c,
+            "INCR option supports a single increment-element pair");
+        return;
+    }
+
+    /* Start parsing all the scores, we need to emit any syntax error
+     * before executing additions to the sorted set, as the command should
+     * either execute fully or nothing at all. */
+    scores = zmalloc(sizeof(double)*elements);
+    for (j = 0; j < elements; j++) {
+        if (getDoubleFromObjectOrReply(c,c->argv[scoreidx+j*2],&scores[j],NULL)
+            != C_OK) goto cleanup;
+    }
+
+    /* Lookup the key and create the sorted set if does not exist. */
+    zobj = lookupKeyWrite(c->db,key);
+    if (checkType(c,zobj,OBJ_ZSET)) goto cleanup;
+    if (zobj == NULL) {
+        if (xx) goto reply_to_client; /* No key + XX option: nothing to do. */
+        if (server.zset_max_ziplist_entries == 0 ||
+            server.zset_max_ziplist_value < sdslen(c->argv[scoreidx+1]->ptr))
+        {
+            zobj = createZsetObject();
+        } else {
+            zobj = createZsetZiplistObject();
+        }
+        dbAdd(c->db,key,zobj);
+    }
+
+    for (j = 0; j < elements; j++) {
+        double newscore;
+        score = scores[j];
+        int retflags = 0;
+
+        ele = c->argv[scoreidx+1+j*2]->ptr;
+        int retval = zsetAdd(zobj, score, ele, flags, &retflags, &newscore);
+        if (retval == 0) {
+            addReplyError(c,nanerr);
+            goto cleanup;
+        }
+        if (retflags & ZADD_OUT_ADDED) added++;
+        if (retflags & ZADD_OUT_UPDATED) updated++;
+        if (!(retflags & ZADD_OUT_NOP)) processed++;
+        score = newscore;
+    }
+    server.dirty += (added+updated);
+
+reply_to_client:
+    if (incr) { /* ZINCRBY or INCR option. */
+        if (processed)
+            addReplyDouble(c,score);
+        else
+            addReplyNull(c);
+    } else { /* ZADD. */
+        addReplyLongLong(c,ch ? added+updated : added);
+    }
+
+cleanup:
+    zfree(scores);
+    if (added || updated) {
+        signalModifiedKey(c,c->db,key);
+        notifyKeyspaceEvent(NOTIFY_ZSET,
+            incr ? "zincr" : "zadd", key, c->db->id);
+    }
+}
+
+void zaddCommand(client *c) {
+    zaddGenericCommand(c,ZADD_IN_NONE);
+}
+
+void zincrbyCommand(client *c) {
+    zaddGenericCommand(c,ZADD_IN_INCR);
+}
+
+void zremCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    int deleted = 0, keyremoved = 0, j;
+
+    if ((zobj = lookupKeyWriteOrReply(c,key,shared.czero)) == NULL ||
+        checkType(c,zobj,OBJ_ZSET)) return;
+
+    for (j = 2; j < c->argc; j++) {
+        if (zsetDel(zobj,c->argv[j]->ptr)) deleted++;
+        if (zsetLength(zobj) == 0) {
+            dbDelete(c->db,key);
+            keyremoved = 1;
+            break;
+        }
+    }
+
+    if (deleted) {
+        notifyKeyspaceEvent(NOTIFY_ZSET,"zrem",key,c->db->id);
+        if (keyremoved)
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
+        signalModifiedKey(c,c->db,key);
+        server.dirty += deleted;
+    }
+    addReplyLongLong(c,deleted);
+}
+
+typedef enum {
+    ZRANGE_AUTO = 0,
+    ZRANGE_RANK,
+    ZRANGE_SCORE,
+    ZRANGE_LEX,
+} zrange_type;
+
+/* Implements ZREMRANGEBYRANK, ZREMRANGEBYSCORE, ZREMRANGEBYLEX commands. */
+void zremrangeGenericCommand(client *c, zrange_type rangetype) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    int keyremoved = 0;
+    unsigned long deleted = 0;
+    zrangespec range;
+    zlexrangespec lexrange;
+    long start, end, llen;
+    char *notify_type = NULL;
+
+    /* Step 1: Parse the range. */
+    if (rangetype == ZRANGE_RANK) {
+        notify_type = "zremrangebyrank";
+        if ((getLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK) ||
+            (getLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK))
+            return;
+    } else if (rangetype == ZRANGE_SCORE) {
+        notify_type = "zremrangebyscore";
+        if (zslParseRange(c->argv[2],c->argv[3],&range) != C_OK) {
+            addReplyError(c,"min or max is not a float");
+            return;
+        }
+    } else if (rangetype == ZRANGE_LEX) {
+        notify_type = "zremrangebylex";
+        if (zslParseLexRange(c->argv[2],c->argv[3],&lexrange) != C_OK) {
+            addReplyError(c,"min or max not valid string range item");
+            return;
+        }
+    } else {
+        serverPanic("unknown rangetype %d", (int)rangetype);
+    }
+
+    /* Step 2: Lookup & range sanity checks if needed. */
+    if ((zobj = lookupKeyWriteOrReply(c,key,shared.czero)) == NULL ||
+        checkType(c,zobj,OBJ_ZSET)) goto cleanup;
+
+    if (rangetype == ZRANGE_RANK) {
+        /* Sanitize indexes. */
+        llen = zsetLength(zobj);
+        if (start < 0) start = llen+start;
+        if (end < 0) end = llen+end;
+        if (start < 0) start = 0;
+
+        /* Invariant: start >= 0, so this test will be true when end < 0.
+         * The range is empty when start > end or start >= length. */
+        if (start > end || start >= llen) {
+            addReply(c,shared.czero);
+            goto cleanup;
+        }
+        if (end >= llen) end = llen-1;
+    }
+
+    /* Step 3: Perform the range deletion operation. */
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        switch(rangetype) {
+        case ZRANGE_AUTO:
+        case ZRANGE_RANK:
+            zobj->ptr = zzlDeleteRangeByRank(zobj->ptr,start+1,end+1,&deleted);
+            break;
+        case ZRANGE_SCORE:
+            zobj->ptr = zzlDeleteRangeByScore(zobj->ptr,&range,&deleted);
+            break;
+        case ZRANGE_LEX:
+            zobj->ptr = zzlDeleteRangeByLex(zobj->ptr,&lexrange,&deleted);
+            break;
+        }
+        if (zzlLength(zobj->ptr) == 0) {
+            dbDelete(c->db,key);
+            keyremoved = 1;
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        switch(rangetype) {
+        case ZRANGE_AUTO:
+        case ZRANGE_RANK:
+            deleted = zslDeleteRangeByRank(zs->zsl,start+1,end+1,zs->dict);
+            break;
+        case ZRANGE_SCORE:
+            deleted = zslDeleteRangeByScore(zs->zsl,&range,zs->dict);
+            break;
+        case ZRANGE_LEX:
+            deleted = zslDeleteRangeByLex(zs->zsl,&lexrange,zs->dict);
+            break;
+        }
+        if (htNeedsResize(zs->dict)) dictResize(zs->dict);
+        if (dictSize(zs->dict) == 0) {
+            dbDelete(c->db,key);
+            keyremoved = 1;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    /* Step 4: Notifications and reply. */
+    if (deleted) {
+        signalModifiedKey(c,c->db,key);
+        notifyKeyspaceEvent(NOTIFY_ZSET,notify_type,key,c->db->id);
+        if (keyremoved)
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
+    }
+    server.dirty += deleted;
+    addReplyLongLong(c,deleted);
+
+cleanup:
+    if (rangetype == ZRANGE_LEX) zslFreeLexRange(&lexrange);
+}
+
+void zremrangebyrankCommand(client *c) {
+    zremrangeGenericCommand(c,ZRANGE_RANK);
+}
+
+void zremrangebyscoreCommand(client *c) {
+    zremrangeGenericCommand(c,ZRANGE_SCORE);
+}
+
+void zremrangebylexCommand(client *c) {
+    zremrangeGenericCommand(c,ZRANGE_LEX);
+}
+
+typedef struct {
+    robj *subject;
+    int type; /* Set, sorted set */
+    int encoding;
+    double weight;
+
+    union {
+        /* Set iterators. */
+        union _iterset {
+            struct {
+                intset *is;
+                int ii;
+            } is;
+            struct {
+                dict *dict;
+                dictIterator *di;
+                dictEntry *de;
+            } ht;
+        } set;
+
+        /* Sorted set iterators. */
+        union _iterzset {
+            struct {
+                unsigned char *zl;
+                unsigned char *eptr, *sptr;
+            } zl;
+            struct {
+                zset *zs;
+                zskiplistNode *node;
+            } sl;
+        } zset;
+    } iter;
+} zsetopsrc;
+
+
+/* Use dirty flags for pointers that need to be cleaned up in the next
+ * iteration over the zsetopval. The dirty flag for the long long value is
+ * special, since long long values don't need cleanup. Instead, it means that
+ * we already checked that "ell" holds a long long, or tried to convert another
+ * representation into a long long value. When this was successful,
+ * OPVAL_VALID_LL is set as well. */
+#define OPVAL_DIRTY_SDS 1
+#define OPVAL_DIRTY_LL 2
+#define OPVAL_VALID_LL 4
+
+/* Store value retrieved from the iterator. */
+typedef struct {
+    int flags;
+    unsigned char _buf[32]; /* Private buffer. */
+    sds ele;
+    unsigned char *estr;
+    unsigned int elen;
+    long long ell;
+    double score;
+} zsetopval;
+
+typedef union _iterset iterset;
+typedef union _iterzset iterzset;
+
+void zuiInitIterator(zsetopsrc *op) {
+    if (op->subject == NULL)
+        return;
+
+    if (op->type == OBJ_SET) {
+        iterset *it = &op->iter.set;
+        if (op->encoding == OBJ_ENCODING_INTSET) {
+            it->is.is = op->subject->ptr;
+            it->is.ii = 0;
+        } else if (op->encoding == OBJ_ENCODING_HT) {
+            it->ht.dict = op->subject->ptr;
+            it->ht.di = dictGetIterator(op->subject->ptr);
+            it->ht.de = dictNext(it->ht.di);
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (op->type == OBJ_ZSET) {
+        /* Sorted sets are traversed in reverse order to optimize for
+         * the insertion of the elements in a new list as in
+         * ZDIFF/ZINTER/ZUNION */
+        iterzset *it = &op->iter.zset;
+        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
+            it->zl.zl = op->subject->ptr;
+            it->zl.eptr = ziplistIndex(it->zl.zl,-2);
+            if (it->zl.eptr != NULL) {
+                it->zl.sptr = ziplistNext(it->zl.zl,it->zl.eptr);
+                serverAssert(it->zl.sptr != NULL);
+            }
+        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
+            it->sl.zs = op->subject->ptr;
+            it->sl.node = it->sl.zs->zsl->tail;
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else {
+        serverPanic("Unsupported type");
+    }
+}
+
+void zuiClearIterator(zsetopsrc *op) {
+    if (op->subject == NULL)
+        return;
+
+    if (op->type == OBJ_SET) {
+        iterset *it = &op->iter.set;
+        if (op->encoding == OBJ_ENCODING_INTSET) {
+            UNUSED(it); /* skip */
+        } else if (op->encoding == OBJ_ENCODING_HT) {
+            dictReleaseIterator(it->ht.di);
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (op->type == OBJ_ZSET) {
+        iterzset *it = &op->iter.zset;
+        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
+            UNUSED(it); /* skip */
+        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
+            UNUSED(it); /* skip */
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else {
+        serverPanic("Unsupported type");
+    }
+}
+
+unsigned long zuiLength(zsetopsrc *op) {
+    if (op->subject == NULL)
+        return 0;
+
+    if (op->type == OBJ_SET) {
+        if (op->encoding == OBJ_ENCODING_INTSET) {
+            return intsetLen(op->subject->ptr);
+        } else if (op->encoding == OBJ_ENCODING_HT) {
+            dict *ht = op->subject->ptr;
+            return dictSize(ht);
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (op->type == OBJ_ZSET) {
+        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
+            return zzlLength(op->subject->ptr);
+        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = op->subject->ptr;
+            return zs->zsl->length;
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else {
+        serverPanic("Unsupported type");
+    }
+}
+
+/* Check if the current value is valid. If so, store it in the passed structure
+ * and move to the next element. If not valid, this means we have reached the
+ * end of the structure and can abort. */
+int zuiNext(zsetopsrc *op, zsetopval *val) {
+    if (op->subject == NULL)
+        return 0;
+
+    if (val->flags & OPVAL_DIRTY_SDS)
+        sdsfree(val->ele);
+
+    memset(val,0,sizeof(zsetopval));
+
+    if (op->type == OBJ_SET) {
+        iterset *it = &op->iter.set;
+        if (op->encoding == OBJ_ENCODING_INTSET) {
+            int64_t ell;
+
+            if (!intsetGet(it->is.is,it->is.ii,&ell))
+                return 0;
+            val->ell = ell;
+            val->score = 1.0;
+
+            /* Move to next element. */
+            it->is.ii++;
+        } else if (op->encoding == OBJ_ENCODING_HT) {
+            if (it->ht.de == NULL)
+                return 0;
+            val->ele = dictGetKey(it->ht.de);
+            val->score = 1.0;
+
+            /* Move to next element. */
+            it->ht.de = dictNext(it->ht.di);
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (op->type == OBJ_ZSET) {
+        iterzset *it = &op->iter.zset;
+        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
+            /* No need to check both, but better be explicit. */
+            if (it->zl.eptr == NULL || it->zl.sptr == NULL)
+                return 0;
+            serverAssert(ziplistGet(it->zl.eptr,&val->estr,&val->elen,&val->ell));
+            val->score = zzlGetScore(it->zl.sptr);
+
+            /* Move to next element (going backwards, see zuiInitIterator). */
+            zzlPrev(it->zl.zl,&it->zl.eptr,&it->zl.sptr);
+        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
+            if (it->sl.node == NULL)
+                return 0;
+            val->ele = it->sl.node->ele;
+            val->score = it->sl.node->score;
+
+            /* Move to next element. (going backwards, see zuiInitIterator) */
+            it->sl.node = it->sl.node->backward;
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else {
+        serverPanic("Unsupported type");
+    }
+    return 1;
+}
+
+int zuiLongLongFromValue(zsetopval *val) {
+    if (!(val->flags & OPVAL_DIRTY_LL)) {
+        val->flags |= OPVAL_DIRTY_LL;
+
+        if (val->ele != NULL) {
+            if (string2ll(val->ele,sdslen(val->ele),&val->ell))
+                val->flags |= OPVAL_VALID_LL;
+        } else if (val->estr != NULL) {
+            if (string2ll((char*)val->estr,val->elen,&val->ell))
+                val->flags |= OPVAL_VALID_LL;
+        } else {
+            /* The long long was already set, flag as valid. */
+            val->flags |= OPVAL_VALID_LL;
+        }
+    }
+    return val->flags & OPVAL_VALID_LL;
+}
+
+sds zuiSdsFromValue(zsetopval *val) {
+    if (val->ele == NULL) {
+        if (val->estr != NULL) {
+            val->ele = sdsnewlen((char*)val->estr,val->elen);
+        } else {
+            val->ele = sdsfromlonglong(val->ell);
+        }
+        val->flags |= OPVAL_DIRTY_SDS;
+    }
+    return val->ele;
+}
+
+/* This is different from zuiSdsFromValue since returns a new SDS string
+ * which is up to the caller to free. */
+sds zuiNewSdsFromValue(zsetopval *val) {
+    if (val->flags & OPVAL_DIRTY_SDS) {
+        /* We have already one to return! */
+        sds ele = val->ele;
+        val->flags &= ~OPVAL_DIRTY_SDS;
+        val->ele = NULL;
+        return ele;
+    } else if (val->ele) {
+        return sdsdup(val->ele);
+    } else if (val->estr) {
+        return sdsnewlen((char*)val->estr,val->elen);
+    } else {
+        return sdsfromlonglong(val->ell);
+    }
+}
+
+int zuiBufferFromValue(zsetopval *val) {
+    if (val->estr == NULL) {
+        if (val->ele != NULL) {
+            val->elen = sdslen(val->ele);
+            val->estr = (unsigned char*)val->ele;
+        } else {
+            val->elen = ll2string((char*)val->_buf,sizeof(val->_buf),val->ell);
+            val->estr = val->_buf;
+        }
+    }
+    return 1;
+}
+
+/* Find value pointed to by val in the source pointer to by op. When found,
+ * return 1 and store its score in target. Return 0 otherwise. */
+int zuiFind(zsetopsrc *op, zsetopval *val, double *score) {
+    if (op->subject == NULL)
+        return 0;
+
+    if (op->type == OBJ_SET) {
+        if (op->encoding == OBJ_ENCODING_INTSET) {
+            if (zuiLongLongFromValue(val) &&
+                intsetFind(op->subject->ptr,val->ell))
+            {
+                *score = 1.0;
+                return 1;
+            } else {
+                return 0;
+            }
+        } else if (op->encoding == OBJ_ENCODING_HT) {
+            dict *ht = op->subject->ptr;
+            zuiSdsFromValue(val);
+            if (dictFind(ht,val->ele) != NULL) {
+                *score = 1.0;
+                return 1;
+            } else {
+                return 0;
+            }
+        } else {
+            serverPanic("Unknown set encoding");
+        }
+    } else if (op->type == OBJ_ZSET) {
+        zuiSdsFromValue(val);
+
+        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
+            if (zzlFind(op->subject->ptr,val->ele,score) != NULL) {
+                /* Score is already set by zzlFind. */
+                return 1;
+            } else {
+                return 0;
+            }
+        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = op->subject->ptr;
+            dictEntry *de;
+            if ((de = dictFind(zs->dict,val->ele)) != NULL) {
+                *score = *(double*)dictGetVal(de);
+                return 1;
+            } else {
+                return 0;
+            }
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+    } else {
+        serverPanic("Unsupported type");
+    }
+}
+
+int zuiCompareByCardinality(const void *s1, const void *s2) {
+    unsigned long first = zuiLength((zsetopsrc*)s1);
+    unsigned long second = zuiLength((zsetopsrc*)s2);
+    if (first > second) return 1;
+    if (first < second) return -1;
+    return 0;
+}
+
+static int zuiCompareByRevCardinality(const void *s1, const void *s2) {
+    return zuiCompareByCardinality(s1, s2) * -1;
+}
+
+#define REDIS_AGGR_SUM 1
+#define REDIS_AGGR_MIN 2
+#define REDIS_AGGR_MAX 3
+#define zunionInterDictValue(_e) (dictGetVal(_e) == NULL ? 1.0 : *(double*)dictGetVal(_e))
+
+inline static void zunionInterAggregate(double *target, double val, int aggregate) {
+    if (aggregate == REDIS_AGGR_SUM) {
+        *target = *target + val;
+        /* The result of adding two doubles is NaN when one variable
+         * is +inf and the other is -inf. When these numbers are added,
+         * we maintain the convention of the result being 0.0. */
+        if (isnan(*target)) *target = 0.0;
+    } else if (aggregate == REDIS_AGGR_MIN) {
+        *target = val < *target ? val : *target;
+    } else if (aggregate == REDIS_AGGR_MAX) {
+        *target = val > *target ? val : *target;
+    } else {
+        /* safety net */
+        serverPanic("Unknown ZUNION/INTER aggregate type");
+    }
+}
+
+static size_t zsetDictGetMaxElementLength(dict *d, size_t *totallen) {
+    dictIterator *di;
+    dictEntry *de;
+    size_t maxelelen = 0;
+
+    di = dictGetIterator(d);
+
+    while((de = dictNext(di)) != NULL) {
+        sds ele = dictGetKey(de);
+        if (sdslen(ele) > maxelelen) maxelelen = sdslen(ele);
+        if (totallen)
+            (*totallen) += sdslen(ele);
+    }
+
+    dictReleaseIterator(di);
+
+    return maxelelen;
+}
+
+static void zdiffAlgorithm1(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
+    /* DIFF Algorithm 1:
+     *
+     * We perform the diff by iterating all the elements of the first set,
+     * and only adding it to the target set if the element does not exist
+     * into all the other sets.
+     *
+     * This way we perform at max N*M operations, where N is the size of
+     * the first set, and M the number of sets.
+     *
+     * There is also a O(K*log(K)) cost for adding the resulting elements
+     * to the target set, where K is the final size of the target set.
+     *
+     * The final complexity of this algorithm is O(N*M + K*log(K)). */
+    int j;
+    zsetopval zval;
+    zskiplistNode *znode;
+    sds tmp;
+
+    /* With algorithm 1 it is better to order the sets to subtract
+     * by decreasing size, so that we are more likely to find
+     * duplicated elements ASAP. */
+    qsort(src+1,setnum-1,sizeof(zsetopsrc),zuiCompareByRevCardinality);
+
+    memset(&zval, 0, sizeof(zval));
+    zuiInitIterator(&src[0]);
+    while (zuiNext(&src[0],&zval)) {
+        double value;
+        int exists = 0;
+
+        for (j = 1; j < setnum; j++) {
+            /* It is not safe to access the zset we are
+             * iterating, so explicitly check for equal object.
+             * This check isn't really needed anymore since we already
+             * check for a duplicate set in the zsetChooseDiffAlgorithm
+             * function, but we're leaving it for future-proofing. */
+            if (src[j].subject == src[0].subject ||
+                zuiFind(&src[j],&zval,&value)) {
+                exists = 1;
+                break;
+            }
+        }
+
+        if (!exists) {
+            tmp = zuiNewSdsFromValue(&zval);
+            znode = zslInsert(dstzset->zsl,zval.score,tmp);
+            dictAdd(dstzset->dict,tmp,&znode->score);
+            if (sdslen(tmp) > *maxelelen) *maxelelen = sdslen(tmp);
+            (*totelelen) += sdslen(tmp);
+        }
+    }
+    zuiClearIterator(&src[0]);
+}
+
+
+static void zdiffAlgorithm2(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
+    /* DIFF Algorithm 2:
+     *
+     * Add all the elements of the first set to the auxiliary set.
+     * Then remove all the elements of all the next sets from it.
+     *
+
+     * This is O(L + (N-K)log(N)) where L is the sum of all the elements in every
+     * set, N is the size of the first set, and K is the size of the result set.
+     *
+     * Note that from the (L-N) dict searches, (N-K) got to the zsetRemoveFromSkiplist
+     * which costs log(N)
+     *
+     * There is also a O(K) cost at the end for finding the largest element
+     * size, but this doesn't change the algorithm complexity since K < L, and
+     * O(2L) is the same as O(L). */
+    int j;
+    int cardinality = 0;
+    zsetopval zval;
+    zskiplistNode *znode;
+    sds tmp;
+
+    for (j = 0; j < setnum; j++) {
+        if (zuiLength(&src[j]) == 0) continue;
+
+        memset(&zval, 0, sizeof(zval));
+        zuiInitIterator(&src[j]);
+        while (zuiNext(&src[j],&zval)) {
+            if (j == 0) {
+                tmp = zuiNewSdsFromValue(&zval);
+                znode = zslInsert(dstzset->zsl,zval.score,tmp);
+                dictAdd(dstzset->dict,tmp,&znode->score);
+                cardinality++;
+            } else {
+                tmp = zuiSdsFromValue(&zval);
+                if (zsetRemoveFromSkiplist(dstzset, tmp)) {
+                    cardinality--;
+                }
+            }
+
+            /* Exit if result set is empty as any additional removal
+                * of elements will have no effect. */
+            if (cardinality == 0) break;
+        }
+        zuiClearIterator(&src[j]);
+
+        if (cardinality == 0) break;
+    }
+
+    /* Redize dict if needed after removing multiple elements */
+    if (htNeedsResize(dstzset->dict)) dictResize(dstzset->dict);
+
+    /* Using this algorithm, we can't calculate the max element as we go,
+     * we have to iterate through all elements to find the max one after. */
+    *maxelelen = zsetDictGetMaxElementLength(dstzset->dict, totelelen);
+}
+
+static int zsetChooseDiffAlgorithm(zsetopsrc *src, long setnum) {
+    int j;
+
+    /* Select what DIFF algorithm to use.
+     *
+     * Algorithm 1 is O(N*M + K*log(K)) where N is the size of the
+     * first set, M the total number of sets, and K is the size of the
+     * result set.
+     *
+     * Algorithm 2 is O(L + (N-K)log(N)) where L is the total number of elements
+     * in all the sets, N is the size of the first set, and K is the size of the
+     * result set.
+     *
+     * We compute what is the best bet with the current input here. */
+    long long algo_one_work = 0;
+    long long algo_two_work = 0;
+
+    for (j = 0; j < setnum; j++) {
+        /* If any other set is equal to the first set, there is nothing to be
+         * done, since we would remove all elements anyway. */
+        if (j > 0 && src[0].subject == src[j].subject) {
+            return 0;
+        }
+
+        algo_one_work += zuiLength(&src[0]);
+        algo_two_work += zuiLength(&src[j]);
+    }
+
+    /* Algorithm 1 has better constant times and performs less operations
+     * if there are elements in common. Give it some advantage. */
+    algo_one_work /= 2;
+    return (algo_one_work <= algo_two_work) ? 1 : 2;
+}
+
+static void zdiff(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
+    /* Skip everything if the smallest input is empty. */
+    if (zuiLength(&src[0]) > 0) {
+        int diff_algo = zsetChooseDiffAlgorithm(src, setnum);
+        if (diff_algo == 1) {
+            zdiffAlgorithm1(src, setnum, dstzset, maxelelen, totelelen);
+        } else if (diff_algo == 2) {
+            zdiffAlgorithm2(src, setnum, dstzset, maxelelen, totelelen);
+        } else if (diff_algo != 0) {
+            serverPanic("Unknown algorithm");
+        }
+    }
+}
+
+uint64_t dictSdsHash(const void *key);
+int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
+
+dictType setAccumulatorDictType = {
+    dictSdsHash,               /* hash function */
+    NULL,                      /* key dup */
+    NULL,                      /* val dup */
+    dictSdsKeyCompare,         /* key compare */
+    NULL,                      /* key destructor */
+    NULL,                      /* val destructor */
+    NULL                       /* allow to expand */
+};
+
+/* The zunionInterDiffGenericCommand() function is called in order to implement the
+ * following commands: ZUNION, ZINTER, ZDIFF, ZUNIONSTORE, ZINTERSTORE, ZDIFFSTORE.
+ *
+ * 'numkeysIndex' parameter position of key number. for ZUNION/ZINTER/ZDIFF command,
+ * this value is 1, for ZUNIONSTORE/ZINTERSTORE/ZDIFFSTORE command, this value is 2.
+ *
+ * 'op' SET_OP_INTER, SET_OP_UNION or SET_OP_DIFF.
+ */
+void zunionInterDiffGenericCommand(client *c, robj *dstkey, int numkeysIndex, int op) {
+    int i, j;
+    long setnum;
+    int aggregate = REDIS_AGGR_SUM;
+    zsetopsrc *src;
+    zsetopval zval;
+    sds tmp;
+    size_t maxelelen = 0, totelelen = 0;
+    robj *dstobj;
+    zset *dstzset;
+    zskiplistNode *znode;
+    int withscores = 0;
+
+    /* expect setnum input keys to be given */
+    if ((getLongFromObjectOrReply(c, c->argv[numkeysIndex], &setnum, NULL) != C_OK))
+        return;
+
+    if (setnum < 1) {
+        addReplyErrorFormat(c,
+            "at least 1 input key is needed for %s", c->cmd->name);
+        return;
+    }
+
+    /* test if the expected number of keys would overflow */
+    if (setnum > (c->argc-(numkeysIndex+1))) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+
+    /* read keys to be used for input */
+    src = zcalloc(sizeof(zsetopsrc) * setnum);
+    for (i = 0, j = numkeysIndex+1; i < setnum; i++, j++) {
+        robj *obj = dstkey ?
+            lookupKeyWrite(c->db,c->argv[j]) :
+            lookupKeyRead(c->db,c->argv[j]);
+        if (obj != NULL) {
+            if (obj->type != OBJ_ZSET && obj->type != OBJ_SET) {
+                zfree(src);
+                addReplyErrorObject(c,shared.wrongtypeerr);
+                return;
+            }
+
+            src[i].subject = obj;
+            src[i].type = obj->type;
+            src[i].encoding = obj->encoding;
+        } else {
+            src[i].subject = NULL;
+        }
+
+        /* Default all weights to 1. */
+        src[i].weight = 1.0;
+    }
+
+    /* parse optional extra arguments */
+    if (j < c->argc) {
+        int remaining = c->argc - j;
+
+        while (remaining) {
+            if (op != SET_OP_DIFF &&
+                remaining >= (setnum + 1) &&
+                !strcasecmp(c->argv[j]->ptr,"weights"))
+            {
+                j++; remaining--;
+                for (i = 0; i < setnum; i++, j++, remaining--) {
+                    if (getDoubleFromObjectOrReply(c,c->argv[j],&src[i].weight,
+                            "weight value is not a float") != C_OK)
+                    {
+                        zfree(src);
+                        return;
+                    }
+                }
+            } else if (op != SET_OP_DIFF &&
+                       remaining >= 2 &&
+                       !strcasecmp(c->argv[j]->ptr,"aggregate"))
+            {
+                j++; remaining--;
+                if (!strcasecmp(c->argv[j]->ptr,"sum")) {
+                    aggregate = REDIS_AGGR_SUM;
+                } else if (!strcasecmp(c->argv[j]->ptr,"min")) {
+                    aggregate = REDIS_AGGR_MIN;
+                } else if (!strcasecmp(c->argv[j]->ptr,"max")) {
+                    aggregate = REDIS_AGGR_MAX;
+                } else {
+                    zfree(src);
+                    addReplyErrorObject(c,shared.syntaxerr);
+                    return;
+                }
+                j++; remaining--;
+            } else if (remaining >= 1 &&
+                       !dstkey &&
+                       !strcasecmp(c->argv[j]->ptr,"withscores"))
+            {
+                j++; remaining--;
+                withscores = 1;
+            } else {
+                zfree(src);
+                addReplyErrorObject(c,shared.syntaxerr);
+                return;
+            }
+        }
+    }
+
+    if (op != SET_OP_DIFF) {
+        /* sort sets from the smallest to largest, this will improve our
+        * algorithm's performance */
+        qsort(src,setnum,sizeof(zsetopsrc),zuiCompareByCardinality);
+    }
+
+    dstobj = createZsetObject();
+    dstzset = dstobj->ptr;
+    memset(&zval, 0, sizeof(zval));
+
+    if (op == SET_OP_INTER) {
+        /* Skip everything if the smallest input is empty. */
+        if (zuiLength(&src[0]) > 0) {
+            /* Precondition: as src[0] is non-empty and the inputs are ordered
+             * by size, all src[i > 0] are non-empty too. */
+            zuiInitIterator(&src[0]);
+            while (zuiNext(&src[0],&zval)) {
+                double score, value;
+
+                score = src[0].weight * zval.score;
+                if (isnan(score)) score = 0;
+
+                for (j = 1; j < setnum; j++) {
+                    /* It is not safe to access the zset we are
+                     * iterating, so explicitly check for equal object. */
+                    if (src[j].subject == src[0].subject) {
+                        value = zval.score*src[j].weight;
+                        zunionInterAggregate(&score,value,aggregate);
+                    } else if (zuiFind(&src[j],&zval,&value)) {
+                        value *= src[j].weight;
+                        zunionInterAggregate(&score,value,aggregate);
+                    } else {
+                        break;
+                    }
+                }
+
+                /* Only continue when present in every input. */
+                if (j == setnum) {
+                    tmp = zuiNewSdsFromValue(&zval);
+                    znode = zslInsert(dstzset->zsl,score,tmp);
+                    dictAdd(dstzset->dict,tmp,&znode->score);
+                    totelelen += sdslen(tmp);
+                    if (sdslen(tmp) > maxelelen) maxelelen = sdslen(tmp);
+                }
+            }
+            zuiClearIterator(&src[0]);
+        }
+    } else if (op == SET_OP_UNION) {
+        dict *accumulator = dictCreate(&setAccumulatorDictType,NULL);
+        dictIterator *di;
+        dictEntry *de, *existing;
+        double score;
+
+        if (setnum) {
+            /* Our union is at least as large as the largest set.
+             * Resize the dictionary ASAP to avoid useless rehashing. */
+            dictExpand(accumulator,zuiLength(&src[setnum-1]));
+        }
+
+        /* Step 1: Create a dictionary of elements -> aggregated-scores
+         * by iterating one sorted set after the other. */
+        for (i = 0; i < setnum; i++) {
+            if (zuiLength(&src[i]) == 0) continue;
+
+            zuiInitIterator(&src[i]);
+            while (zuiNext(&src[i],&zval)) {
+                /* Initialize value */
+                score = src[i].weight * zval.score;
+                if (isnan(score)) score = 0;
+
+                /* Search for this element in the accumulating dictionary. */
+                de = dictAddRaw(accumulator,zuiSdsFromValue(&zval),&existing);
+                /* If we don't have it, we need to create a new entry. */
+                if (!existing) {
+                    tmp = zuiNewSdsFromValue(&zval);
+                    /* Remember the longest single element encountered,
+                     * to understand if it's possible to convert to ziplist
+                     * at the end. */
+                     totelelen += sdslen(tmp);
+                     if (sdslen(tmp) > maxelelen) maxelelen = sdslen(tmp);
+                    /* Update the element with its initial score. */
+                    dictSetKey(accumulator, de, tmp);
+                    dictSetDoubleVal(de,score);
+                } else {
+                    /* Update the score with the score of the new instance
+                     * of the element found in the current sorted set.
+                     *
+                     * Here we access directly the dictEntry double
+                     * value inside the union as it is a big speedup
+                     * compared to using the getDouble/setDouble API. */
+                    zunionInterAggregate(&existing->v.d,score,aggregate);
+                }
+            }
+            zuiClearIterator(&src[i]);
+        }
+
+        /* Step 2: convert the dictionary into the final sorted set. */
+        di = dictGetIterator(accumulator);
+
+        /* We now are aware of the final size of the resulting sorted set,
+         * let's resize the dictionary embedded inside the sorted set to the
+         * right size, in order to save rehashing time. */
+        dictExpand(dstzset->dict,dictSize(accumulator));
+
+        while((de = dictNext(di)) != NULL) {
+            sds ele = dictGetKey(de);
+            score = dictGetDoubleVal(de);
+            znode = zslInsert(dstzset->zsl,score,ele);
+            dictAdd(dstzset->dict,ele,&znode->score);
+        }
+        dictReleaseIterator(di);
+        dictRelease(accumulator);
+    } else if (op == SET_OP_DIFF) {
+        zdiff(src, setnum, dstzset, &maxelelen, &totelelen);
+    } else {
+        serverPanic("Unknown operator");
+    }
+
+    if (dstkey) {
+        if (dstzset->zsl->length) {
+            zsetConvertToZiplistIfNeeded(dstobj, maxelelen, totelelen);
+            setKey(c, c->db, dstkey, dstobj);
+            addReplyLongLong(c, zsetLength(dstobj));
+            notifyKeyspaceEvent(NOTIFY_ZSET,
+                                (op == SET_OP_UNION) ? "zunionstore" :
+                                    (op == SET_OP_INTER ? "zinterstore" : "zdiffstore"),
+                                dstkey, c->db->id);
+            server.dirty++;
+        } else {
+            addReply(c, shared.czero);
+            if (dbDelete(c->db, dstkey)) {
+                signalModifiedKey(c, c->db, dstkey);
+                notifyKeyspaceEvent(NOTIFY_GENERIC, "del", dstkey, c->db->id);
+                server.dirty++;
+            }
+        }
+    } else {
+        unsigned long length = dstzset->zsl->length;
+        zskiplist *zsl = dstzset->zsl;
+        zskiplistNode *zn = zsl->header->level[0].forward;
+        /* In case of WITHSCORES, respond with a single array in RESP2, and
+         * nested arrays in RESP3. We can't use a map response type since the
+         * client library needs to know to respect the order. */
+        if (withscores && c->resp == 2)
+            addReplyArrayLen(c, length*2);
+        else
+            addReplyArrayLen(c, length);
+
+        while (zn != NULL) {
+            if (withscores && c->resp > 2) addReplyArrayLen(c,2);
+            addReplyBulkCBuffer(c,zn->ele,sdslen(zn->ele));
+            if (withscores) addReplyDouble(c,zn->score);
+            zn = zn->level[0].forward;
+        }
+    }
+    decrRefCount(dstobj);
+    zfree(src);
+}
+
+void zunionstoreCommand(client *c) {
+    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_UNION);
+}
+
+void zinterstoreCommand(client *c) {
+    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_INTER);
+}
+
+void zdiffstoreCommand(client *c) {
+    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_DIFF);
+}
+
+void zunionCommand(client *c) {
+    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_UNION);
+}
+
+void zinterCommand(client *c) {
+    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_INTER);
+}
+
+void zdiffCommand(client *c) {
+    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_DIFF);
+}
+
+typedef enum {
+    ZRANGE_DIRECTION_AUTO = 0,
+    ZRANGE_DIRECTION_FORWARD,
+    ZRANGE_DIRECTION_REVERSE
+} zrange_direction;
+
+typedef enum {
+    ZRANGE_CONSUMER_TYPE_CLIENT = 0,
+    ZRANGE_CONSUMER_TYPE_INTERNAL
+} zrange_consumer_type;
+
+typedef struct zrange_result_handler zrange_result_handler;
+
+typedef void (*zrangeResultBeginFunction)(zrange_result_handler *c);
+typedef void (*zrangeResultFinalizeFunction)(
+    zrange_result_handler *c, size_t result_count);
+typedef void (*zrangeResultEmitCBufferFunction)(
+    zrange_result_handler *c, const void *p, size_t len, double score);
+typedef void (*zrangeResultEmitLongLongFunction)(
+    zrange_result_handler *c, long long ll, double score);
+
+void zrangeGenericCommand (zrange_result_handler *handler, int argc_start, int store,
+                           zrange_type rangetype, zrange_direction direction);
+
+/* Interface struct for ZRANGE/ZRANGESTORE generic implementation.
+ * There is one implementation of this interface that sends a RESP reply to clients.
+ * and one implementation that stores the range result into a zset object. */
+struct zrange_result_handler {
+    zrange_consumer_type                 type;
+    client                              *client;
+    robj                                *dstkey;
+    robj                                *dstobj;
+    void                                *userdata;
+    int                                  withscores;
+    int                                  should_emit_array_length;
+    zrangeResultBeginFunction            beginResultEmission;
+    zrangeResultFinalizeFunction         finalizeResultEmission;
+    zrangeResultEmitCBufferFunction      emitResultFromCBuffer;
+    zrangeResultEmitLongLongFunction     emitResultFromLongLong;
+};
+
+/* Result handler methods for responding the ZRANGE to clients. */
+static void zrangeResultBeginClient(zrange_result_handler *handler) {
+    handler->userdata = addReplyDeferredLen(handler->client);
+}
+
+static void zrangeResultEmitCBufferToClient(zrange_result_handler *handler,
+    const void *value, size_t value_length_in_bytes, double score)
+{
+    if (handler->should_emit_array_length) {
+        addReplyArrayLen(handler->client, 2);
+    }
+
+    addReplyBulkCBuffer(handler->client, value, value_length_in_bytes);
+
+    if (handler->withscores) {
+        addReplyDouble(handler->client, score);
+    }
+}
+
+static void zrangeResultEmitLongLongToClient(zrange_result_handler *handler,
+    long long value, double score)
+{
+    if (handler->should_emit_array_length) {
+        addReplyArrayLen(handler->client, 2);
+    }
+
+    addReplyBulkLongLong(handler->client, value);
+
+    if (handler->withscores) {
+        addReplyDouble(handler->client, score);
+    }
+}
+
+static void zrangeResultFinalizeClient(zrange_result_handler *handler,
+    size_t result_count)
+{
+    /* In case of WITHSCORES, respond with a single array in RESP2, and
+     * nested arrays in RESP3. We can't use a map response type since the
+     * client library needs to know to respect the order. */
+    if (handler->withscores && (handler->client->resp == 2)) {
+        result_count *= 2;
+    }
+
+    setDeferredArrayLen(handler->client, handler->userdata, result_count);
+}
+
+/* Result handler methods for storing the ZRANGESTORE to a zset. */
+static void zrangeResultBeginStore(zrange_result_handler *handler)
+{
+    handler->dstobj = createZsetZiplistObject();
+}
+
+static void zrangeResultEmitCBufferForStore(zrange_result_handler *handler,
+    const void *value, size_t value_length_in_bytes, double score)
+{
+    double newscore;
+    int retflags = 0;
+    sds ele = sdsnewlen(value, value_length_in_bytes);
+    int retval = zsetAdd(handler->dstobj, score, ele, ZADD_IN_NONE, &retflags, &newscore);
+    sdsfree(ele);
+    serverAssert(retval);
+}
+
+static void zrangeResultEmitLongLongForStore(zrange_result_handler *handler,
+    long long value, double score)
+{
+    double newscore;
+    int retflags = 0;
+    sds ele = sdsfromlonglong(value);
+    int retval = zsetAdd(handler->dstobj, score, ele, ZADD_IN_NONE, &retflags, &newscore);
+    sdsfree(ele);
+    serverAssert(retval);
+}
+
+static void zrangeResultFinalizeStore(zrange_result_handler *handler, size_t result_count)
+{
+    if (result_count) {
+        setKey(handler->client, handler->client->db, handler->dstkey, handler->dstobj);
+        addReplyLongLong(handler->client, result_count);
+        notifyKeyspaceEvent(NOTIFY_ZSET, "zrangestore", handler->dstkey, handler->client->db->id);
+        server.dirty++;
+    } else {
+        addReply(handler->client, shared.czero);
+        if (dbDelete(handler->client->db, handler->dstkey)) {
+            signalModifiedKey(handler->client, handler->client->db, handler->dstkey);
+            notifyKeyspaceEvent(NOTIFY_GENERIC, "del", handler->dstkey, handler->client->db->id);
+            server.dirty++;
+        }
+    }
+    decrRefCount(handler->dstobj);
+}
+
+/* Initialize the consumer interface type with the requested type. */
+static void zrangeResultHandlerInit(zrange_result_handler *handler,
+    client *client, zrange_consumer_type type)
+{
+    memset(handler, 0, sizeof(*handler));
+
+    handler->client = client;
+
+    switch (type) {
+    case ZRANGE_CONSUMER_TYPE_CLIENT:
+        handler->beginResultEmission = zrangeResultBeginClient;
+        handler->finalizeResultEmission = zrangeResultFinalizeClient;
+        handler->emitResultFromCBuffer = zrangeResultEmitCBufferToClient;
+        handler->emitResultFromLongLong = zrangeResultEmitLongLongToClient;
+        break;
+
+    case ZRANGE_CONSUMER_TYPE_INTERNAL:
+        handler->beginResultEmission = zrangeResultBeginStore;
+        handler->finalizeResultEmission = zrangeResultFinalizeStore;
+        handler->emitResultFromCBuffer = zrangeResultEmitCBufferForStore;
+        handler->emitResultFromLongLong = zrangeResultEmitLongLongForStore;
+        break;
+    }
+}
+
+static void zrangeResultHandlerScoreEmissionEnable(zrange_result_handler *handler) {
+    handler->withscores = 1;
+    handler->should_emit_array_length = (handler->client->resp > 2);
+}
+
+static void zrangeResultHandlerDestinationKeySet (zrange_result_handler *handler,
+    robj *dstkey)
+{
+    handler->dstkey = dstkey;
+}
+
+/* This command implements ZRANGE, ZREVRANGE. */
+void genericZrangebyrankCommand(zrange_result_handler *handler,
+    robj *zobj, long start, long end, int withscores, int reverse) {
+
+    client *c = handler->client;
+    long llen;
+    long rangelen;
+    size_t result_cardinality;
+
+    /* Sanitize indexes. */
+    llen = zsetLength(zobj);
+    if (start < 0) start = llen+start;
+    if (end < 0) end = llen+end;
+    if (start < 0) start = 0;
+
+    handler->beginResultEmission(handler);
+
+    /* Invariant: start >= 0, so this test will be true when end < 0.
+     * The range is empty when start > end or start >= length. */
+    if (start > end || start >= llen) {
+        handler->finalizeResultEmission(handler, 0);
+        return;
+    }
+    if (end >= llen) end = llen-1;
+    rangelen = (end-start)+1;
+    result_cardinality = rangelen;
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vlong;
+        double score = 0.0;
+
+        if (reverse)
+            eptr = ziplistIndex(zl,-2-(2*start));
+        else
+            eptr = ziplistIndex(zl,2*start);
+
+        serverAssertWithInfo(c,zobj,eptr != NULL);
+        sptr = ziplistNext(zl,eptr);
+
+        while (rangelen--) {
+            serverAssertWithInfo(c,zobj,eptr != NULL && sptr != NULL);
+            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
+
+            if (withscores) /* don't bother to extract the score if it's gonna be ignored. */
+                score = zzlGetScore(sptr);
+
+            if (vstr == NULL) {
+                handler->emitResultFromLongLong(handler, vlong, score);
+            } else {
+                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
+            }
+
+            if (reverse)
+                zzlPrev(zl,&eptr,&sptr);
+            else
+                zzlNext(zl,&eptr,&sptr);
+        }
+
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+
+        /* Check if starting point is trivial, before doing log(N) lookup. */
+        if (reverse) {
+            ln = zsl->tail;
+            if (start > 0)
+                ln = zslGetElementByRank(zsl,llen-start);
+        } else {
+            ln = zsl->header->level[0].forward;
+            if (start > 0)
+                ln = zslGetElementByRank(zsl,start+1);
+        }
+
+        while(rangelen--) {
+            serverAssertWithInfo(c,zobj,ln != NULL);
+            sds ele = ln->ele;
+            handler->emitResultFromCBuffer(handler, ele, sdslen(ele), ln->score);
+            ln = reverse ? ln->backward : ln->level[0].forward;
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    handler->finalizeResultEmission(handler, result_cardinality);
+}
+
+/* ZRANGESTORE <dst> <src> <min> <max> [BYSCORE | BYLEX] [REV] [LIMIT offset count] */
+void zrangestoreCommand (client *c) {
+    robj *dstkey = c->argv[1];
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_INTERNAL);
+    zrangeResultHandlerDestinationKeySet(&handler, dstkey);
+    zrangeGenericCommand(&handler, 2, 1, ZRANGE_AUTO, ZRANGE_DIRECTION_AUTO);
+}
+
+/* ZRANGE <key> <min> <max> [BYSCORE | BYLEX] [REV] [WITHSCORES] [LIMIT offset count] */
+void zrangeCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_AUTO, ZRANGE_DIRECTION_AUTO);
+}
+
+/* ZREVRANGE <key> <min> <max> [WITHSCORES] */
+void zrevrangeCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_RANK, ZRANGE_DIRECTION_REVERSE);
+}
+
+/* This command implements ZRANGEBYSCORE, ZREVRANGEBYSCORE. */
+void genericZrangebyscoreCommand(zrange_result_handler *handler,
+    zrangespec *range, robj *zobj, long offset, long limit, 
+    int reverse) {
+
+    client *c = handler->client;
+    unsigned long rangelen = 0;
+
+    handler->beginResultEmission(handler);
+
+    /* For invalid offset, return directly. */
+    if (offset > 0 && offset >= (long)zsetLength(zobj)) {
+        handler->finalizeResultEmission(handler, 0);
+        return;
+    }
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vlong;
+
+        /* If reversed, get the last node in range as starting point. */
+        if (reverse) {
+            eptr = zzlLastInRange(zl,range);
+        } else {
+            eptr = zzlFirstInRange(zl,range);
+        }
+
+        /* Get score pointer for the first element. */
+        if (eptr)
+            sptr = ziplistNext(zl,eptr);
+
+        /* If there is an offset, just traverse the number of elements without
+         * checking the score because that is done in the next loop. */
+        while (eptr && offset--) {
+            if (reverse) {
+                zzlPrev(zl,&eptr,&sptr);
+            } else {
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+
+        while (eptr && limit--) {
+            double score = zzlGetScore(sptr);
+
+            /* Abort when the node is no longer in range. */
+            if (reverse) {
+                if (!zslValueGteMin(score,range)) break;
+            } else {
+                if (!zslValueLteMax(score,range)) break;
+            }
+
+            /* We know the element exists, so ziplistGet should always
+             * succeed */
+            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
+
+            rangelen++;
+            if (vstr == NULL) {
+                handler->emitResultFromLongLong(handler, vlong, score);
+            } else {
+                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
+            }
+
+            /* Move to next node */
+            if (reverse) {
+                zzlPrev(zl,&eptr,&sptr);
+            } else {
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+
+        /* If reversed, get the last node in range as starting point. */
+        if (reverse) {
+            ln = zslLastInRange(zsl,range);
+        } else {
+            ln = zslFirstInRange(zsl,range);
+        }
+
+        /* If there is an offset, just traverse the number of elements without
+         * checking the score because that is done in the next loop. */
+        while (ln && offset--) {
+            if (reverse) {
+                ln = ln->backward;
+            } else {
+                ln = ln->level[0].forward;
+            }
+        }
+
+        while (ln && limit--) {
+            /* Abort when the node is no longer in range. */
+            if (reverse) {
+                if (!zslValueGteMin(ln->score,range)) break;
+            } else {
+                if (!zslValueLteMax(ln->score,range)) break;
+            }
+
+            rangelen++;
+            handler->emitResultFromCBuffer(handler, ln->ele, sdslen(ln->ele), ln->score);
+
+            /* Move to next node */
+            if (reverse) {
+                ln = ln->backward;
+            } else {
+                ln = ln->level[0].forward;
+            }
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    handler->finalizeResultEmission(handler, rangelen);
+}
+
+/* ZRANGEBYSCORE <key> <min> <max> [WITHSCORES] [LIMIT offset count] */
+void zrangebyscoreCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_SCORE, ZRANGE_DIRECTION_FORWARD);
+}
+
+/* ZREVRANGEBYSCORE <key> <min> <max> [WITHSCORES] [LIMIT offset count] */
+void zrevrangebyscoreCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_SCORE, ZRANGE_DIRECTION_REVERSE);
+}
+
+void zcountCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    zrangespec range;
+    unsigned long count = 0;
+
+    /* Parse the range arguments */
+    if (zslParseRange(c->argv[2],c->argv[3],&range) != C_OK) {
+        addReplyError(c,"min or max is not a float");
+        return;
+    }
+
+    /* Lookup the sorted set */
+    if ((zobj = lookupKeyReadOrReply(c, key, shared.czero)) == NULL ||
+        checkType(c, zobj, OBJ_ZSET)) return;
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        double score;
+
+        /* Use the first element in range as the starting point */
+        eptr = zzlFirstInRange(zl,&range);
+
+        /* No "first" element */
+        if (eptr == NULL) {
+            addReply(c, shared.czero);
+            return;
+        }
+
+        /* First element is in range */
+        sptr = ziplistNext(zl,eptr);
+        score = zzlGetScore(sptr);
+        serverAssertWithInfo(c,zobj,zslValueLteMax(score,&range));
+
+        /* Iterate over elements in range */
+        while (eptr) {
+            score = zzlGetScore(sptr);
+
+            /* Abort when the node is no longer in range. */
+            if (!zslValueLteMax(score,&range)) {
+                break;
+            } else {
+                count++;
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *zn;
+        unsigned long rank;
+
+        /* Find first element in range */
+        zn = zslFirstInRange(zsl, &range);
+
+        /* Use rank of first element, if any, to determine preliminary count */
+        if (zn != NULL) {
+            rank = zslGetRank(zsl, zn->score, zn->ele);
+            count = (zsl->length - (rank - 1));
+
+            /* Find last element in range */
+            zn = zslLastInRange(zsl, &range);
+
+            /* Use rank of last element, if any, to determine the actual count */
+            if (zn != NULL) {
+                rank = zslGetRank(zsl, zn->score, zn->ele);
+                count -= (zsl->length - rank);
+            }
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    addReplyLongLong(c, count);
+}
+
+void zlexcountCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    zlexrangespec range;
+    unsigned long count = 0;
+
+    /* Parse the range arguments */
+    if (zslParseLexRange(c->argv[2],c->argv[3],&range) != C_OK) {
+        addReplyError(c,"min or max not valid string range item");
+        return;
+    }
+
+    /* Lookup the sorted set */
+    if ((zobj = lookupKeyReadOrReply(c, key, shared.czero)) == NULL ||
+        checkType(c, zobj, OBJ_ZSET))
+    {
+        zslFreeLexRange(&range);
+        return;
+    }
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+
+        /* Use the first element in range as the starting point */
+        eptr = zzlFirstInLexRange(zl,&range);
+
+        /* No "first" element */
+        if (eptr == NULL) {
+            zslFreeLexRange(&range);
+            addReply(c, shared.czero);
+            return;
+        }
+
+        /* First element is in range */
+        sptr = ziplistNext(zl,eptr);
+        serverAssertWithInfo(c,zobj,zzlLexValueLteMax(eptr,&range));
+
+        /* Iterate over elements in range */
+        while (eptr) {
+            /* Abort when the node is no longer in range. */
+            if (!zzlLexValueLteMax(eptr,&range)) {
+                break;
+            } else {
+                count++;
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *zn;
+        unsigned long rank;
+
+        /* Find first element in range */
+        zn = zslFirstInLexRange(zsl, &range);
+
+        /* Use rank of first element, if any, to determine preliminary count */
+        if (zn != NULL) {
+            rank = zslGetRank(zsl, zn->score, zn->ele);
+            count = (zsl->length - (rank - 1));
+
+            /* Find last element in range */
+            zn = zslLastInLexRange(zsl, &range);
+
+            /* Use rank of last element, if any, to determine the actual count */
+            if (zn != NULL) {
+                rank = zslGetRank(zsl, zn->score, zn->ele);
+                count -= (zsl->length - rank);
+            }
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    zslFreeLexRange(&range);
+    addReplyLongLong(c, count);
+}
+
+/* This command implements ZRANGEBYLEX, ZREVRANGEBYLEX. */
+void genericZrangebylexCommand(zrange_result_handler *handler,
+    zlexrangespec *range, robj *zobj, int withscores, long offset, long limit,
+    int reverse)
+{
+    client *c = handler->client;
+    unsigned long rangelen = 0;
+
+    handler->beginResultEmission(handler);
+
+    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+        unsigned char *zl = zobj->ptr;
+        unsigned char *eptr, *sptr;
+        unsigned char *vstr;
+        unsigned int vlen;
+        long long vlong;
+
+        /* If reversed, get the last node in range as starting point. */
+        if (reverse) {
+            eptr = zzlLastInLexRange(zl,range);
+        } else {
+            eptr = zzlFirstInLexRange(zl,range);
+        }
+
+        /* Get score pointer for the first element. */
+        if (eptr)
+            sptr = ziplistNext(zl,eptr);
+
+        /* If there is an offset, just traverse the number of elements without
+         * checking the score because that is done in the next loop. */
+        while (eptr && offset--) {
+            if (reverse) {
+                zzlPrev(zl,&eptr,&sptr);
+            } else {
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+
+        while (eptr && limit--) {
+            double score = 0;
+            if (withscores) /* don't bother to extract the score if it's gonna be ignored. */
+                score = zzlGetScore(sptr);
+
+            /* Abort when the node is no longer in range. */
+            if (reverse) {
+                if (!zzlLexValueGteMin(eptr,range)) break;
+            } else {
+                if (!zzlLexValueLteMax(eptr,range)) break;
+            }
+
+            /* We know the element exists, so ziplistGet should always
+             * succeed. */
+            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
+
+            rangelen++;
+            if (vstr == NULL) {
+                handler->emitResultFromLongLong(handler, vlong, score);
+            } else {
+                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
+            }
+
+            /* Move to next node */
+            if (reverse) {
+                zzlPrev(zl,&eptr,&sptr);
+            } else {
+                zzlNext(zl,&eptr,&sptr);
+            }
+        }
+    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+        zset *zs = zobj->ptr;
+        zskiplist *zsl = zs->zsl;
+        zskiplistNode *ln;
+
+        /* If reversed, get the last node in range as starting point. */
+        if (reverse) {
+            ln = zslLastInLexRange(zsl,range);
+        } else {
+            ln = zslFirstInLexRange(zsl,range);
+        }
+
+        /* If there is an offset, just traverse the number of elements without
+         * checking the score because that is done in the next loop. */
+        while (ln && offset--) {
+            if (reverse) {
+                ln = ln->backward;
+            } else {
+                ln = ln->level[0].forward;
+            }
+        }
+
+        while (ln && limit--) {
+            /* Abort when the node is no longer in range. */
+            if (reverse) {
+                if (!zslLexValueGteMin(ln->ele,range)) break;
+            } else {
+                if (!zslLexValueLteMax(ln->ele,range)) break;
+            }
+
+            rangelen++;
+            handler->emitResultFromCBuffer(handler, ln->ele, sdslen(ln->ele), ln->score);
+
+            /* Move to next node */
+            if (reverse) {
+                ln = ln->backward;
+            } else {
+                ln = ln->level[0].forward;
+            }
+        }
+    } else {
+        serverPanic("Unknown sorted set encoding");
+    }
+
+    handler->finalizeResultEmission(handler, rangelen);
+}
+
+/* ZRANGEBYLEX <key> <min> <max> [LIMIT offset count] */
+void zrangebylexCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_LEX, ZRANGE_DIRECTION_FORWARD);
+}
+
+/* ZREVRANGEBYLEX <key> <min> <max> [LIMIT offset count] */
+void zrevrangebylexCommand(client *c) {
+    zrange_result_handler handler;
+    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
+    zrangeGenericCommand(&handler, 1, 0, ZRANGE_LEX, ZRANGE_DIRECTION_REVERSE);
+}
+
+/**
+ * This function handles ZRANGE and ZRANGESTORE, and also the deprecated
+ * Z[REV]RANGE[BYPOS|BYLEX] commands.
+ *
+ * The simple ZRANGE and ZRANGESTORE can take _AUTO in rangetype and direction,
+ * other command pass explicit value.
+ *
+ * The argc_start points to the src key argument, so following syntax is like:
+ * <src> <min> <max> [BYSCORE | BYLEX] [REV] [WITHSCORES] [LIMIT offset count]
+ */
+void zrangeGenericCommand(zrange_result_handler *handler, int argc_start, int store,
+                          zrange_type rangetype, zrange_direction direction)
+{
+    client *c = handler->client;
+    robj *key = c->argv[argc_start];
+    robj *zobj;
+    zrangespec range;
+    zlexrangespec lexrange;
+    int minidx = argc_start + 1;
+    int maxidx = argc_start + 2;
+
+    /* Options common to all */
+    long opt_start = 0;
+    long opt_end = 0;
+    int opt_withscores = 0;
+    long opt_offset = 0;
+    long opt_limit = -1;
+
+    /* Step 1: Skip the <src> <min> <max> args and parse remaining optional arguments. */
+    for (int j=argc_start + 3; j < c->argc; j++) {
+        int leftargs = c->argc-j-1;
+        if (!store && !strcasecmp(c->argv[j]->ptr,"withscores")) {
+            opt_withscores = 1;
+        } else if (!strcasecmp(c->argv[j]->ptr,"limit") && leftargs >= 2) {
+            if ((getLongFromObjectOrReply(c, c->argv[j+1], &opt_offset, NULL) != C_OK) ||
+                (getLongFromObjectOrReply(c, c->argv[j+2], &opt_limit, NULL) != C_OK))
+            {
+                return;
+            }
+            j += 2;
+        } else if (direction == ZRANGE_DIRECTION_AUTO &&
+                   !strcasecmp(c->argv[j]->ptr,"rev"))
+        {
+            direction = ZRANGE_DIRECTION_REVERSE;
+        } else if (rangetype == ZRANGE_AUTO &&
+                   !strcasecmp(c->argv[j]->ptr,"bylex"))
+        {
+            rangetype = ZRANGE_LEX;
+        } else if (rangetype == ZRANGE_AUTO &&
+                   !strcasecmp(c->argv[j]->ptr,"byscore"))
+        {
+            rangetype = ZRANGE_SCORE;
+        } else {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        }
+    }
+
+    /* Use defaults if not overriden by arguments. */
+    if (direction == ZRANGE_DIRECTION_AUTO)
+        direction = ZRANGE_DIRECTION_FORWARD;
+    if (rangetype == ZRANGE_AUTO)
+        rangetype = ZRANGE_RANK;
+
+    /* Check for conflicting arguments. */
+    if (opt_limit != -1 && rangetype == ZRANGE_RANK) {
+        addReplyError(c,"syntax error, LIMIT is only supported in combination with either BYSCORE or BYLEX");
+        return;
+    }
+    if (opt_withscores && rangetype == ZRANGE_LEX) {
+        addReplyError(c,"syntax error, WITHSCORES not supported in combination with BYLEX");
+        return;
+    }
+
+    if (direction == ZRANGE_DIRECTION_REVERSE &&
+        ((ZRANGE_SCORE == rangetype) || (ZRANGE_LEX == rangetype)))
+    {
+        /* Range is given as [max,min] */
+        int tmp = maxidx;
+        maxidx = minidx;
+        minidx = tmp;
+    }
+
+    /* Step 2: Parse the range. */
+    switch (rangetype) {
+    case ZRANGE_AUTO:
+    case ZRANGE_RANK:
+        /* Z[REV]RANGE, ZRANGESTORE [REV]RANGE */
+        if ((getLongFromObjectOrReply(c, c->argv[minidx], &opt_start,NULL) != C_OK) ||
+            (getLongFromObjectOrReply(c, c->argv[maxidx], &opt_end,NULL) != C_OK))
+        {
+            return;
+        }
+        break;
+
+    case ZRANGE_SCORE:
+        /* Z[REV]RANGEBYSCORE, ZRANGESTORE [REV]RANGEBYSCORE */
+        if (zslParseRange(c->argv[minidx], c->argv[maxidx], &range) != C_OK) {
+            addReplyError(c, "min or max is not a float");
+            return;
+        }
+        break;
+
+    case ZRANGE_LEX:
+        /* Z[REV]RANGEBYLEX, ZRANGESTORE [REV]RANGEBYLEX */
+        if (zslParseLexRange(c->argv[minidx], c->argv[maxidx], &lexrange) != C_OK) {
+            addReplyError(c, "min or max not valid string range item");
+            return;
+        }
+        break;
+    }
+
+    if (opt_withscores || store) {
+        zrangeResultHandlerScoreEmissionEnable(handler);
+    }
+
+    /* Step 3: Lookup the key and get the range. */
+    zobj = handler->dstkey ?
+        lookupKeyWrite(c->db,key) :
+        lookupKeyRead(c->db,key);
+    if (zobj == NULL) {
+        if (store) {
+            handler->beginResultEmission(handler);
+            handler->finalizeResultEmission(handler, 0);
+        } else {
+            addReply(c, shared.emptyarray);
+        }
+        goto cleanup;
+    }
+
+    if (checkType(c,zobj,OBJ_ZSET)) goto cleanup;
+
+    /* Step 4: Pass this to the command-specific handler. */
+    switch (rangetype) {
+    case ZRANGE_AUTO:
+    case ZRANGE_RANK:
+        genericZrangebyrankCommand(handler, zobj, opt_start, opt_end,
+            opt_withscores || store, direction == ZRANGE_DIRECTION_REVERSE);
+        break;
+
+    case ZRANGE_SCORE:
+        genericZrangebyscoreCommand(handler, &range, zobj, opt_offset,
+            opt_limit, direction == ZRANGE_DIRECTION_REVERSE);
+        break;
+
+    case ZRANGE_LEX:
+        genericZrangebylexCommand(handler, &lexrange, zobj, opt_withscores || store,
+            opt_offset, opt_limit, direction == ZRANGE_DIRECTION_REVERSE);
+        break;
+    }
+
+    /* Instead of returning here, we'll just fall-through the clean-up. */
+
+cleanup:
+
+    if (rangetype == ZRANGE_LEX) {
+        zslFreeLexRange(&lexrange);
+    }
+}
+
+void zcardCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+
+    if ((zobj = lookupKeyReadOrReply(c,key,shared.czero)) == NULL ||
+        checkType(c,zobj,OBJ_ZSET)) return;
+
+    addReplyLongLong(c,zsetLength(zobj));
+}
+
+void zscoreCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    double score;
+
+    if ((zobj = lookupKeyReadOrReply(c,key,shared.null[c->resp])) == NULL ||
+        checkType(c,zobj,OBJ_ZSET)) return;
+
+    if (zsetScore(zobj,c->argv[2]->ptr,&score) == C_ERR) {
+        addReplyNull(c);
+    } else {
+        addReplyDouble(c,score);
+    }
+}
+
+void zmscoreCommand(client *c) {
+    robj *key = c->argv[1];
+    robj *zobj;
+    double score;
+    zobj = lookupKeyRead(c->db,key);
+    if (checkType(c,zobj,OBJ_ZSET)) return;
+
+    addReplyArrayLen(c,c->argc - 2);
+    for (int j = 2; j < c->argc; j++) {
+        /* Treat a missing set the same way as an empty set */
+        if (zobj == NULL || zsetScore(zobj,c->argv[j]->ptr,&score) == C_ERR) {
+            addReplyNull(c);
+        } else {
+            addReplyDouble(c,score);
+        }
+    }
+}
+
+void zrankGenericCommand(client *c, int reverse) {
+    robj *key = c->argv[1];
+    robj *ele = c->argv[2];
+    robj *zobj;
+    long rank;
+
+    if ((zobj = lookupKeyReadOrReply(c,key,shared.null[c->resp])) == NULL ||
+        checkType(c,zobj,OBJ_ZSET)) return;
+
+    serverAssertWithInfo(c,ele,sdsEncodedObject(ele));
+    rank = zsetRank(zobj,ele->ptr,reverse);
+    if (rank >= 0) {
+        addReplyLongLong(c,rank);
+    } else {
+        addReplyNull(c);
+    }
+}
+
+void zrankCommand(client *c) {
+    zrankGenericCommand(c, 0);
+}
+
+void zrevrankCommand(client *c) {
+    zrankGenericCommand(c, 1);
+}
+
+void zscanCommand(client *c) {
+    robj *o;
+    unsigned long cursor;
+
+    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
+    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
+        checkType(c,o,OBJ_ZSET)) return;
+    scanGenericCommand(c,o,cursor);
+}
+
+/* This command implements the generic zpop operation, used by:
+ * ZPOPMIN, ZPOPMAX, BZPOPMIN and BZPOPMAX. This function is also used
+ * inside blocked.c in the unblocking stage of BZPOPMIN and BZPOPMAX.
+ *
+ * If 'emitkey' is true also the key name is emitted, useful for the blocking
+ * behavior of BZPOP[MIN|MAX], since we can block into multiple keys.
+ *
+ * The synchronous version instead does not need to emit the key, but may
+ * use the 'count' argument to return multiple items if available. */
+void genericZpopCommand(client *c, robj **keyv, int keyc, int where, int emitkey, robj *countarg) {
+    int idx;
+    robj *key = NULL;
+    robj *zobj = NULL;
+    sds ele;
+    double score;
+    long count = 1;
+
+    /* If a count argument as passed, parse it or return an error. */
+    if (countarg) {
+        if (getLongFromObjectOrReply(c,countarg,&count,NULL) != C_OK)
+            return;
+        if (count <= 0) {
+            addReply(c,shared.emptyarray);
+            return;
+        }
+    }
+
+    /* Check type and break on the first error, otherwise identify candidate. */
+    idx = 0;
+    while (idx < keyc) {
+        key = keyv[idx++];
+        zobj = lookupKeyWrite(c->db,key);
+        if (!zobj) continue;
+        if (checkType(c,zobj,OBJ_ZSET)) return;
+        break;
+    }
+
+    /* No candidate for zpopping, return empty. */
+    if (!zobj) {
+        addReply(c,shared.emptyarray);
+        return;
+    }
+
+    void *arraylen_ptr = addReplyDeferredLen(c);
+    long result_count = 0;
+
+    /* We emit the key only for the blocking variant. */
+    if (emitkey) addReplyBulk(c,key);
+
+    /* Respond with a single (flat) array in RESP2 or if countarg is not
+     * provided (returning a single element). In RESP3, when countarg is
+     * provided, use nested array.  */
+    int use_nested_array = c->resp > 2 && countarg != NULL;
+
+    /* Remove the element. */
+    do {
+        if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
+            unsigned char *zl = zobj->ptr;
+            unsigned char *eptr, *sptr;
+            unsigned char *vstr;
+            unsigned int vlen;
+            long long vlong;
+
+            /* Get the first or last element in the sorted set. */
+            eptr = ziplistIndex(zl,where == ZSET_MAX ? -2 : 0);
+            serverAssertWithInfo(c,zobj,eptr != NULL);
+            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
+            if (vstr == NULL)
+                ele = sdsfromlonglong(vlong);
+            else
+                ele = sdsnewlen(vstr,vlen);
+
+            /* Get the score. */
+            sptr = ziplistNext(zl,eptr);
+            serverAssertWithInfo(c,zobj,sptr != NULL);
+            score = zzlGetScore(sptr);
+        } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = zobj->ptr;
+            zskiplist *zsl = zs->zsl;
+            zskiplistNode *zln;
+
+            /* Get the first or last element in the sorted set. */
+            zln = (where == ZSET_MAX ? zsl->tail :
+                                       zsl->header->level[0].forward);
+
+            /* There must be an element in the sorted set. */
+            serverAssertWithInfo(c,zobj,zln != NULL);
+            ele = sdsdup(zln->ele);
+            score = zln->score;
+        } else {
+            serverPanic("Unknown sorted set encoding");
+        }
+
+        serverAssertWithInfo(c,zobj,zsetDel(zobj,ele));
+        server.dirty++;
+
+        if (result_count == 0) { /* Do this only for the first iteration. */
+            char *events[2] = {"zpopmin","zpopmax"};
+            notifyKeyspaceEvent(NOTIFY_ZSET,events[where],key,c->db->id);
+            signalModifiedKey(c,c->db,key);
+        }
+
+        if (use_nested_array) {
+            addReplyArrayLen(c,2);
+        }
+        addReplyBulkCBuffer(c,ele,sdslen(ele));
+        addReplyDouble(c,score);
+        sdsfree(ele);
+        ++result_count;
+
+        /* Remove the key, if indeed needed. */
+        if (zsetLength(zobj) == 0) {
+            dbDelete(c->db,key);
+            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
+            break;
+        }
+    } while(--count);
+
+    if (!use_nested_array) {
+        result_count *= 2;
+    }
+    setDeferredArrayLen(c,arraylen_ptr,result_count + (emitkey != 0));
+}
+
+/* ZPOPMIN key [<count>] */
+void zpopminCommand(client *c) {
+    if (c->argc > 3) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+    genericZpopCommand(c,&c->argv[1],1,ZSET_MIN,0,
+        c->argc == 3 ? c->argv[2] : NULL);
+}
+
+/* ZMAXPOP key [<count>] */
+void zpopmaxCommand(client *c) {
+    if (c->argc > 3) {
+        addReplyErrorObject(c,shared.syntaxerr);
+        return;
+    }
+    genericZpopCommand(c,&c->argv[1],1,ZSET_MAX,0,
+        c->argc == 3 ? c->argv[2] : NULL);
+}
+
+/* BZPOPMIN / BZPOPMAX actual implementation. */
+void blockingGenericZpopCommand(client *c, int where) {
+    robj *o;
+    mstime_t timeout;
+    int j;
+
+    if (getTimeoutFromObjectOrReply(c,c->argv[c->argc-1],&timeout,UNIT_SECONDS)
+        != C_OK) return;
+
+    for (j = 1; j < c->argc-1; j++) {
+        o = lookupKeyWrite(c->db,c->argv[j]);
+        if (checkType(c,o,OBJ_ZSET)) return;
+        if (o != NULL) {
+            if (zsetLength(o) != 0) {
+                /* Non empty zset, this is like a normal ZPOP[MIN|MAX]. */
+                genericZpopCommand(c,&c->argv[j],1,where,1,NULL);
+                /* Replicate it as an ZPOP[MIN|MAX] instead of BZPOP[MIN|MAX]. */
+                rewriteClientCommandVector(c,2,
+                    where == ZSET_MAX ? shared.zpopmax : shared.zpopmin,
+                    c->argv[j]);
+                return;
+            }
+        }
+    }
+
+    /* If we are not allowed to block the client and the zset is empty the only thing
+     * we can do is treating it as a timeout (even with timeout 0). */
+    if (c->flags & CLIENT_DENY_BLOCKING) {
+        addReplyNullArray(c);
+        return;
+    }
+
+    /* If the keys do not exist we must block */
+    blockForKeys(c,BLOCKED_ZSET,c->argv + 1,c->argc - 2,timeout,NULL,NULL,NULL);
+}
+
+// BZPOPMIN key [key ...] timeout
+void bzpopminCommand(client *c) {
+    blockingGenericZpopCommand(c,ZSET_MIN);
+}
+
+// BZPOPMAX key [key ...] timeout
+void bzpopmaxCommand(client *c) {
+    blockingGenericZpopCommand(c,ZSET_MAX);
+}
+
+static void zarndmemberReplyWithZiplist(client *c, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
+    for (unsigned long i = 0; i < count; i++) {
+        if (vals && c->resp > 2)
+            addReplyArrayLen(c,2);
+        if (keys[i].sval)
+            addReplyBulkCBuffer(c, keys[i].sval, keys[i].slen);
+        else
+            addReplyBulkLongLong(c, keys[i].lval);
+        if (vals) {
+            if (vals[i].sval) {
+                addReplyDouble(c, zzlStrtod(vals[i].sval,vals[i].slen));
+            } else
+                addReplyDouble(c, vals[i].lval);
+        }
+    }
+}
+
+/* How many times bigger should be the zset compared to the requested size
+ * for us to not use the "remove elements" strategy? Read later in the
+ * implementation for more info. */
+#define ZRANDMEMBER_SUB_STRATEGY_MUL 3
+
+/* If client is trying to ask for a very large number of random elements,
+ * queuing may consume an unlimited amount of memory, so we want to limit
+ * the number of randoms per time. */
+#define ZRANDMEMBER_RANDOM_SAMPLE_LIMIT 1000
+
+void zrandmemberWithCountCommand(client *c, long l, int withscores) {
+    unsigned long count, size;
+    int uniq = 1;
+    robj *zsetobj;
+
+    if ((zsetobj = lookupKeyReadOrReply(c, c->argv[1], shared.emptyarray))
+        == NULL || checkType(c, zsetobj, OBJ_ZSET)) return;
+    size = zsetLength(zsetobj);
+
+    if(l >= 0) {
+        count = (unsigned long) l;
+    } else {
+        count = -l;
+        uniq = 0;
+    }
+
+    /* If count is zero, serve it ASAP to avoid special cases later. */
+    if (count == 0) {
+        addReply(c,shared.emptyarray);
+        return;
+    }
+
+    /* CASE 1: The count was negative, so the extraction method is just:
+     * "return N random elements" sampling the whole set every time.
+     * This case is trivial and can be served without auxiliary data
+     * structures. This case is the only one that also needs to return the
+     * elements in random order. */
+    if (!uniq || count == 1) {
+        if (withscores && c->resp == 2)
+            addReplyArrayLen(c, count*2);
+        else
+            addReplyArrayLen(c, count);
+        if (zsetobj->encoding == OBJ_ENCODING_SKIPLIST) {
+            zset *zs = zsetobj->ptr;
+            while (count--) {
+                dictEntry *de = dictGetFairRandomKey(zs->dict);
+                sds key = dictGetKey(de);
+                if (withscores && c->resp > 2)
+                    addReplyArrayLen(c,2);
+                addReplyBulkCBuffer(c, key, sdslen(key));
+                if (withscores)
+                    addReplyDouble(c, *(double*)dictGetVal(de));
+            }
+        } else if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
+            ziplistEntry *keys, *vals = NULL;
+            unsigned long limit, sample_count;
+            limit = count > ZRANDMEMBER_RANDOM_SAMPLE_LIMIT ? ZRANDMEMBER_RANDOM_SAMPLE_LIMIT : count;
+            keys = zmalloc(sizeof(ziplistEntry)*limit);
+            if (withscores)
+                vals = zmalloc(sizeof(ziplistEntry)*limit);
+            while (count) {
+                sample_count = count > limit ? limit : count;
+                count -= sample_count;
+                ziplistRandomPairs(zsetobj->ptr, sample_count, keys, vals);
+                zarndmemberReplyWithZiplist(c, sample_count, keys, vals);
+            }
+            zfree(keys);
+            zfree(vals);
+        }
+        return;
+    }
+
+    zsetopsrc src;
+    zsetopval zval;
+    src.subject = zsetobj;
+    src.type = zsetobj->type;
+    src.encoding = zsetobj->encoding;
+    zuiInitIterator(&src);
+    memset(&zval, 0, sizeof(zval));
+
+    /* Initiate reply count, RESP3 responds with nested array, RESP2 with flat one. */
+    long reply_size = count < size ? count : size;
+    if (withscores && c->resp == 2)
+        addReplyArrayLen(c, reply_size*2);
+    else
+        addReplyArrayLen(c, reply_size);
+
+    /* CASE 2:
+    * The number of requested elements is greater than the number of
+    * elements inside the zset: simply return the whole zset. */
+    if (count >= size) {
+        while (zuiNext(&src, &zval)) {
+            if (withscores && c->resp > 2)
+                addReplyArrayLen(c,2);
+            addReplyBulkSds(c, zuiNewSdsFromValue(&zval));
+            if (withscores)
+                addReplyDouble(c, zval.score);
+        }
+        return;
+    }
+
+    /* CASE 3:
+     * The number of elements inside the zset is not greater than
+     * ZRANDMEMBER_SUB_STRATEGY_MUL times the number of requested elements.
+     * In this case we create a dict from scratch with all the elements, and
+     * subtract random elements to reach the requested number of elements.
+     *
+     * This is done because if the number of requested elements is just
+     * a bit less than the number of elements in the set, the natural approach
+     * used into CASE 4 is highly inefficient. */
+    if (count*ZRANDMEMBER_SUB_STRATEGY_MUL > size) {
+        dict *d = dictCreate(&sdsReplyDictType, NULL);
+        dictExpand(d, size);
+        /* Add all the elements into the temporary dictionary. */
+        while (zuiNext(&src, &zval)) {
+            sds key = zuiNewSdsFromValue(&zval);
+            dictEntry *de = dictAddRaw(d, key, NULL);
+            serverAssert(de);
+            if (withscores)
+                dictSetDoubleVal(de, zval.score);
+        }
+        serverAssert(dictSize(d) == size);
+
+        /* Remove random elements to reach the right count. */
+        while (size > count) {
+            dictEntry *de;
+            de = dictGetRandomKey(d);
+            dictUnlink(d,dictGetKey(de));
+            sdsfree(dictGetKey(de));
+            dictFreeUnlinkedEntry(d,de);
+            size--;
+        }
+
+        /* Reply with what's in the dict and release memory */
+        dictIterator *di;
+        dictEntry *de;
+        di = dictGetIterator(d);
+        while ((de = dictNext(di)) != NULL) {
+            if (withscores && c->resp > 2)
+                addReplyArrayLen(c,2);
+            addReplyBulkSds(c, dictGetKey(de));
+            if (withscores)
+                addReplyDouble(c, dictGetDoubleVal(de));
+        }
+
+        dictReleaseIterator(di);
+        dictRelease(d);
+    }
+
+    /* CASE 4: We have a big zset compared to the requested number of elements.
+     * In this case we can simply get random elements from the zset and add
+     * to the temporary set, trying to eventually get enough unique elements
+     * to reach the specified count. */
+    else {
+        if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
+            /* it is inefficient to repeatedly pick one random element from a
+             * ziplist. so we use this instead: */
+            ziplistEntry *keys, *vals = NULL;
+            keys = zmalloc(sizeof(ziplistEntry)*count);
+            if (withscores)
+                vals = zmalloc(sizeof(ziplistEntry)*count);
+            serverAssert(ziplistRandomPairsUnique(zsetobj->ptr, count, keys, vals) == count);
+            zarndmemberReplyWithZiplist(c, count, keys, vals);
+            zfree(keys);
+            zfree(vals);
+            return;
+        }
+
+        /* Hashtable encoding (generic implementation) */
+        unsigned long added = 0;
+        dict *d = dictCreate(&hashDictType, NULL);
+        dictExpand(d, count);
+
+        while (added < count) {
+            ziplistEntry key;
+            double score;
+            zsetTypeRandomElement(zsetobj, size, &key, withscores ? &score: NULL);
+
+            /* Try to add the object to the dictionary. If it already exists
+            * free it, otherwise increment the number of objects we have
+            * in the result dictionary. */
+            sds skey = zsetSdsFromZiplistEntry(&key);
+            if (dictAdd(d,skey,NULL) != DICT_OK) {
+                sdsfree(skey);
+                continue;
+            }
+            added++;
+
+            if (withscores && c->resp > 2)
+                addReplyArrayLen(c,2);
+            zsetReplyFromZiplistEntry(c, &key);
+            if (withscores)
+                addReplyDouble(c, score);
+        }
+
+        /* Release memory */
+        dictRelease(d);
+    }
+}
+
+/* ZRANDMEMBER key [<count> [WITHSCORES]] */
+void zrandmemberCommand(client *c) {
+    long l;
+    int withscores = 0;
+    robj *zset;
+    ziplistEntry ele;
+
+    if (c->argc >= 3) {
+        if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
+        if (c->argc > 4 || (c->argc == 4 && strcasecmp(c->argv[3]->ptr,"withscores"))) {
+            addReplyErrorObject(c,shared.syntaxerr);
+            return;
+        } else if (c->argc == 4)
+            withscores = 1;
+        zrandmemberWithCountCommand(c, l, withscores);
+        return;
+    }
+
+    /* Handle variant without <count> argument. Reply with simple bulk string */
+    if ((zset = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))== NULL ||
+        checkType(c,zset,OBJ_ZSET)) {
+        return;
+    }
+
+    zsetTypeRandomElement(zset, zsetLength(zset), &ele,NULL);
+    zsetReplyFromZiplistEntry(c,&ele);
+}
diff --git a/redis-stable/src/testhelp.h b/redis-stable/src/testhelp.h
new file mode 100644
index 00000000..c6c1b55b
--- /dev/null
+++ b/redis-stable/src/testhelp.h
@@ -0,0 +1,57 @@
+/* This is a really minimal testing framework for C.
+ *
+ * Example:
+ *
+ * test_cond("Check if 1 == 1", 1==1)
+ * test_cond("Check if 5 > 10", 5 > 10)
+ * test_report()
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2010-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __TESTHELP_H
+#define __TESTHELP_H
+
+int __failed_tests = 0;
+int __test_num = 0;
+#define test_cond(descr,_c) do { \
+    __test_num++; printf("%d - %s: ", __test_num, descr); \
+    if(_c) printf("PASSED\n"); else {printf("FAILED\n"); __failed_tests++;} \
+} while(0)
+#define test_report() do { \
+    printf("%d tests, %d passed, %d failed\n", __test_num, \
+                    __test_num-__failed_tests, __failed_tests); \
+    if (__failed_tests) { \
+        printf("=== WARNING === We have failed tests here...\n"); \
+        exit(1); \
+    } \
+} while(0)
+
+#endif
diff --git a/redis-stable/src/timeout.c b/redis-stable/src/timeout.c
new file mode 100644
index 00000000..d4c4690e
--- /dev/null
+++ b/redis-stable/src/timeout.c
@@ -0,0 +1,190 @@
+/* Copyright (c) 2009-2020, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+#include "cluster.h"
+
+/* ========================== Clients timeouts ============================= */
+
+/* Check if this blocked client timedout (does nothing if the client is
+ * not blocked right now). If so send a reply, unblock it, and return 1.
+ * Otherwise 0 is returned and no operation is performed. */
+int checkBlockedClientTimeout(client *c, mstime_t now) {
+    if (c->flags & CLIENT_BLOCKED &&
+        c->bpop.timeout != 0
+        && c->bpop.timeout < now)
+    {
+        /* Handle blocking operation specific timeout. */
+        replyToBlockedClientTimedOut(c);
+        unblockClient(c);
+        return 1;
+    } else {
+        return 0;
+    }
+}
+
+/* Check for timeouts. Returns non-zero if the client was terminated.
+ * The function gets the current time in milliseconds as argument since
+ * it gets called multiple times in a loop, so calling gettimeofday() for
+ * each iteration would be costly without any actual gain. */
+int clientsCronHandleTimeout(client *c, mstime_t now_ms) {
+    time_t now = now_ms/1000;
+
+    if (server.maxidletime &&
+        /* This handles the idle clients connection timeout if set. */
+        !(c->flags & CLIENT_SLAVE) &&   /* No timeout for slaves and monitors */
+        !(c->flags & CLIENT_MASTER) &&  /* No timeout for masters */
+        !(c->flags & CLIENT_BLOCKED) && /* No timeout for BLPOP */
+        !(c->flags & CLIENT_PUBSUB) &&  /* No timeout for Pub/Sub clients */
+        (now - c->lastinteraction > server.maxidletime))
+    {
+        serverLog(LL_VERBOSE,"Closing idle client");
+        freeClient(c);
+        return 1;
+    } else if (c->flags & CLIENT_BLOCKED) {
+        /* Cluster: handle unblock & redirect of clients blocked
+         * into keys no longer served by this server. */
+        if (server.cluster_enabled) {
+            if (clusterRedirectBlockedClientIfNeeded(c))
+                unblockClient(c);
+        }
+    }
+    return 0;
+}
+
+/* For blocked clients timeouts we populate a radix tree of 128 bit keys
+ * composed as such:
+ *
+ *  [8 byte big endian expire time]+[8 byte client ID]
+ *
+ * We don't do any cleanup in the Radix tree: when we run the clients that
+ * reached the timeout already, if they are no longer existing or no longer
+ * blocked with such timeout, we just go forward.
+ *
+ * Every time a client blocks with a timeout, we add the client in
+ * the tree. In beforeSleep() we call handleBlockedClientsTimeout() to run
+ * the tree and unblock the clients. */
+
+#define CLIENT_ST_KEYLEN 16    /* 8 bytes mstime + 8 bytes client ID. */
+
+/* Given client ID and timeout, write the resulting radix tree key in buf. */
+void encodeTimeoutKey(unsigned char *buf, uint64_t timeout, client *c) {
+    timeout = htonu64(timeout);
+    memcpy(buf,&timeout,sizeof(timeout));
+    memcpy(buf+8,&c,sizeof(c));
+    if (sizeof(c) == 4) memset(buf+12,0,4); /* Zero padding for 32bit target. */
+}
+
+/* Given a key encoded with encodeTimeoutKey(), resolve the fields and write
+ * the timeout into *toptr and the client pointer into *cptr. */
+void decodeTimeoutKey(unsigned char *buf, uint64_t *toptr, client **cptr) {
+    memcpy(toptr,buf,sizeof(*toptr));
+    *toptr = ntohu64(*toptr);
+    memcpy(cptr,buf+8,sizeof(*cptr));
+}
+
+/* Add the specified client id / timeout as a key in the radix tree we use
+ * to handle blocked clients timeouts. The client is not added to the list
+ * if its timeout is zero (block forever). */
+void addClientToTimeoutTable(client *c) {
+    if (c->bpop.timeout == 0) return;
+    uint64_t timeout = c->bpop.timeout;
+    unsigned char buf[CLIENT_ST_KEYLEN];
+    encodeTimeoutKey(buf,timeout,c);
+    if (raxTryInsert(server.clients_timeout_table,buf,sizeof(buf),NULL,NULL))
+        c->flags |= CLIENT_IN_TO_TABLE;
+}
+
+/* Remove the client from the table when it is unblocked for reasons
+ * different than timing out. */
+void removeClientFromTimeoutTable(client *c) {
+    if (!(c->flags & CLIENT_IN_TO_TABLE)) return;
+    c->flags &= ~CLIENT_IN_TO_TABLE;
+    uint64_t timeout = c->bpop.timeout;
+    unsigned char buf[CLIENT_ST_KEYLEN];
+    encodeTimeoutKey(buf,timeout,c);
+    raxRemove(server.clients_timeout_table,buf,sizeof(buf),NULL);
+}
+
+/* This function is called in beforeSleep() in order to unblock clients
+ * that are waiting in blocking operations with a timeout set. */
+void handleBlockedClientsTimeout(void) {
+    if (raxSize(server.clients_timeout_table) == 0) return;
+    uint64_t now = mstime();
+    raxIterator ri;
+    raxStart(&ri,server.clients_timeout_table);
+    raxSeek(&ri,"^",NULL,0);
+
+    while(raxNext(&ri)) {
+        uint64_t timeout;
+        client *c;
+        decodeTimeoutKey(ri.key,&timeout,&c);
+        if (timeout >= now) break; /* All the timeouts are in the future. */
+        c->flags &= ~CLIENT_IN_TO_TABLE;
+        checkBlockedClientTimeout(c,now);
+        raxRemove(server.clients_timeout_table,ri.key,ri.key_len,NULL);
+        raxSeek(&ri,"^",NULL,0);
+    }
+    raxStop(&ri);
+}
+
+/* Get a timeout value from an object and store it into 'timeout'.
+ * The final timeout is always stored as milliseconds as a time where the
+ * timeout will expire, however the parsing is performed according to
+ * the 'unit' that can be seconds or milliseconds.
+ *
+ * Note that if the timeout is zero (usually from the point of view of
+ * commands API this means no timeout) the value stored into 'timeout'
+ * is zero. */
+int getTimeoutFromObjectOrReply(client *c, robj *object, mstime_t *timeout, int unit) {
+    long long tval;
+    long double ftval;
+
+    if (unit == UNIT_SECONDS) {
+        if (getLongDoubleFromObjectOrReply(c,object,&ftval,
+            "timeout is not a float or out of range") != C_OK)
+            return C_ERR;
+        tval = (long long) (ftval * 1000.0);
+    } else {
+        if (getLongLongFromObjectOrReply(c,object,&tval,
+            "timeout is not an integer or out of range") != C_OK)
+            return C_ERR;
+    }
+
+    if (tval < 0) {
+        addReplyError(c,"timeout is negative");
+        return C_ERR;
+    }
+
+    if (tval > 0) {
+        tval += mstime();
+    }
+    *timeout = tval;
+
+    return C_OK;
+}
diff --git a/redis-stable/src/tls.c b/redis-stable/src/tls.c
new file mode 100644
index 00000000..c36cc98f
--- /dev/null
+++ b/redis-stable/src/tls.c
@@ -0,0 +1,1021 @@
+/*
+ * Copyright (c) 2019, Redis Labs
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+
+#include "server.h"
+#include "connhelpers.h"
+#include "adlist.h"
+
+#ifdef USE_OPENSSL
+
+#include <openssl/conf.h>
+#include <openssl/ssl.h>
+#include <openssl/err.h>
+#include <openssl/rand.h>
+#include <openssl/pem.h>
+
+#define REDIS_TLS_PROTO_TLSv1       (1<<0)
+#define REDIS_TLS_PROTO_TLSv1_1     (1<<1)
+#define REDIS_TLS_PROTO_TLSv1_2     (1<<2)
+#define REDIS_TLS_PROTO_TLSv1_3     (1<<3)
+
+/* Use safe defaults */
+#ifdef TLS1_3_VERSION
+#define REDIS_TLS_PROTO_DEFAULT     (REDIS_TLS_PROTO_TLSv1_2|REDIS_TLS_PROTO_TLSv1_3)
+#else
+#define REDIS_TLS_PROTO_DEFAULT     (REDIS_TLS_PROTO_TLSv1_2)
+#endif
+
+extern ConnectionType CT_Socket;
+
+SSL_CTX *redis_tls_ctx = NULL;
+SSL_CTX *redis_tls_client_ctx = NULL;
+
+static int parseProtocolsConfig(const char *str) {
+    int i, count = 0;
+    int protocols = 0;
+
+    if (!str) return REDIS_TLS_PROTO_DEFAULT;
+    sds *tokens = sdssplitlen(str, strlen(str), " ", 1, &count);
+
+    if (!tokens) { 
+        serverLog(LL_WARNING, "Invalid tls-protocols configuration string");
+        return -1;
+    }
+    for (i = 0; i < count; i++) {
+        if (!strcasecmp(tokens[i], "tlsv1")) protocols |= REDIS_TLS_PROTO_TLSv1;
+        else if (!strcasecmp(tokens[i], "tlsv1.1")) protocols |= REDIS_TLS_PROTO_TLSv1_1;
+        else if (!strcasecmp(tokens[i], "tlsv1.2")) protocols |= REDIS_TLS_PROTO_TLSv1_2;
+        else if (!strcasecmp(tokens[i], "tlsv1.3")) {
+#ifdef TLS1_3_VERSION
+            protocols |= REDIS_TLS_PROTO_TLSv1_3;
+#else
+            serverLog(LL_WARNING, "TLSv1.3 is specified in tls-protocols but not supported by OpenSSL.");
+            protocols = -1;
+            break;
+#endif
+        } else {
+            serverLog(LL_WARNING, "Invalid tls-protocols specified. "
+                    "Use a combination of 'TLSv1', 'TLSv1.1', 'TLSv1.2' and 'TLSv1.3'.");
+            protocols = -1;
+            break;
+        }
+    }
+    sdsfreesplitres(tokens, count);
+
+    return protocols;
+}
+
+/* list of connections with pending data already read from the socket, but not
+ * served to the reader yet. */
+static list *pending_list = NULL;
+
+/**
+ * OpenSSL global initialization and locking handling callbacks.
+ * Note that this is only required for OpenSSL < 1.1.0.
+ */
+
+#if OPENSSL_VERSION_NUMBER < 0x10100000L
+#define USE_CRYPTO_LOCKS
+#endif
+
+#ifdef USE_CRYPTO_LOCKS
+
+static pthread_mutex_t *openssl_locks;
+
+static void sslLockingCallback(int mode, int lock_id, const char *f, int line) {
+    pthread_mutex_t *mt = openssl_locks + lock_id;
+
+    if (mode & CRYPTO_LOCK) {
+        pthread_mutex_lock(mt);
+    } else {
+        pthread_mutex_unlock(mt);
+    }
+
+    (void)f;
+    (void)line;
+}
+
+static void initCryptoLocks(void) {
+    unsigned i, nlocks;
+    if (CRYPTO_get_locking_callback() != NULL) {
+        /* Someone already set the callback before us. Don't destroy it! */
+        return;
+    }
+    nlocks = CRYPTO_num_locks();
+    openssl_locks = zmalloc(sizeof(*openssl_locks) * nlocks);
+    for (i = 0; i < nlocks; i++) {
+        pthread_mutex_init(openssl_locks + i, NULL);
+    }
+    CRYPTO_set_locking_callback(sslLockingCallback);
+}
+#endif /* USE_CRYPTO_LOCKS */
+
+void tlsInit(void) {
+    /* Enable configuring OpenSSL using the standard openssl.cnf
+     * OPENSSL_config()/OPENSSL_init_crypto() should be the first 
+     * call to the OpenSSL* library.
+     *  - OPENSSL_config() should be used for OpenSSL versions < 1.1.0
+     *  - OPENSSL_init_crypto() should be used for OpenSSL versions >= 1.1.0
+     */
+    #if OPENSSL_VERSION_NUMBER < 0x10100000L
+    OPENSSL_config(NULL);
+    #elif OPENSSL_VERSION_NUMBER < 0x10101000L
+    OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG, NULL);
+    #else
+    OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG|OPENSSL_INIT_ATFORK, NULL);
+    #endif
+    ERR_load_crypto_strings();
+    SSL_load_error_strings();
+    SSL_library_init();
+
+#ifdef USE_CRYPTO_LOCKS
+    initCryptoLocks();
+#endif
+
+    if (!RAND_poll()) {
+        serverLog(LL_WARNING, "OpenSSL: Failed to seed random number generator.");
+    }
+
+    pending_list = listCreate();
+}
+
+void tlsCleanup(void) {
+    if (redis_tls_ctx) {
+        SSL_CTX_free(redis_tls_ctx);
+        redis_tls_ctx = NULL;
+    }
+    if (redis_tls_client_ctx) {
+        SSL_CTX_free(redis_tls_client_ctx);
+        redis_tls_client_ctx = NULL;
+    }
+
+    #if OPENSSL_VERSION_NUMBER >= 0x10100000L && !defined(LIBRESSL_VERSION_NUMBER)
+    // unavailable on LibreSSL
+    OPENSSL_cleanup();
+    #endif
+}
+
+/* Callback for passing a keyfile password stored as an sds to OpenSSL */
+static int tlsPasswordCallback(char *buf, int size, int rwflag, void *u) {
+    UNUSED(rwflag);
+
+    const char *pass = u;
+    size_t pass_len;
+
+    if (!pass) return -1;
+    pass_len = strlen(pass);
+    if (pass_len > (size_t) size) return -1;
+    memcpy(buf, pass, pass_len);
+
+    return (int) pass_len;
+}
+
+/* Create a *base* SSL_CTX using the SSL configuration provided. The base context
+ * includes everything that's common for both client-side and server-side connections.
+ */
+static SSL_CTX *createSSLContext(redisTLSContextConfig *ctx_config, int protocols, int client) {
+    const char *cert_file = client ? ctx_config->client_cert_file : ctx_config->cert_file;
+    const char *key_file = client ? ctx_config->client_key_file : ctx_config->key_file;
+    const char *key_file_pass = client ? ctx_config->client_key_file_pass : ctx_config->key_file_pass;
+    char errbuf[256];
+    SSL_CTX *ctx = NULL;
+
+    ctx = SSL_CTX_new(SSLv23_method());
+
+    SSL_CTX_set_options(ctx, SSL_OP_NO_SSLv2|SSL_OP_NO_SSLv3);
+
+#ifdef SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS
+    SSL_CTX_set_options(ctx, SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS);
+#endif
+
+    if (!(protocols & REDIS_TLS_PROTO_TLSv1))
+        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1);
+    if (!(protocols & REDIS_TLS_PROTO_TLSv1_1))
+        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_1);
+#ifdef SSL_OP_NO_TLSv1_2
+    if (!(protocols & REDIS_TLS_PROTO_TLSv1_2))
+        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_2);
+#endif
+#ifdef SSL_OP_NO_TLSv1_3
+    if (!(protocols & REDIS_TLS_PROTO_TLSv1_3))
+        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_3);
+#endif
+
+#ifdef SSL_OP_NO_COMPRESSION
+    SSL_CTX_set_options(ctx, SSL_OP_NO_COMPRESSION);
+#endif
+
+    SSL_CTX_set_mode(ctx, SSL_MODE_ENABLE_PARTIAL_WRITE|SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
+    SSL_CTX_set_verify(ctx, SSL_VERIFY_PEER|SSL_VERIFY_FAIL_IF_NO_PEER_CERT, NULL);
+
+    SSL_CTX_set_default_passwd_cb(ctx, tlsPasswordCallback);
+    SSL_CTX_set_default_passwd_cb_userdata(ctx, (void *) key_file_pass);
+
+    if (SSL_CTX_use_certificate_chain_file(ctx, cert_file) <= 0) {
+        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
+        serverLog(LL_WARNING, "Failed to load certificate: %s: %s", cert_file, errbuf);
+        goto error;
+    }
+
+    if (SSL_CTX_use_PrivateKey_file(ctx, key_file, SSL_FILETYPE_PEM) <= 0) {
+        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
+        serverLog(LL_WARNING, "Failed to load private key: %s: %s", key_file, errbuf);
+        goto error;
+    }
+
+    if ((ctx_config->ca_cert_file || ctx_config->ca_cert_dir) &&
+        SSL_CTX_load_verify_locations(ctx, ctx_config->ca_cert_file, ctx_config->ca_cert_dir) <= 0) {
+        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
+        serverLog(LL_WARNING, "Failed to configure CA certificate(s) file/directory: %s", errbuf);
+        goto error;
+    }
+
+    if (ctx_config->ciphers && !SSL_CTX_set_cipher_list(ctx, ctx_config->ciphers)) {
+        serverLog(LL_WARNING, "Failed to configure ciphers: %s", ctx_config->ciphers);
+        goto error;
+    }
+
+#ifdef TLS1_3_VERSION
+    if (ctx_config->ciphersuites && !SSL_CTX_set_ciphersuites(ctx, ctx_config->ciphersuites)) {
+        serverLog(LL_WARNING, "Failed to configure ciphersuites: %s", ctx_config->ciphersuites);
+        goto error;
+    }
+#endif
+
+    return ctx;
+
+error:
+    if (ctx) SSL_CTX_free(ctx);
+    return NULL;
+}
+
+/* Attempt to configure/reconfigure TLS. This operation is atomic and will
+ * leave the SSL_CTX unchanged if fails.
+ */
+int tlsConfigure(redisTLSContextConfig *ctx_config) {
+    char errbuf[256];
+    SSL_CTX *ctx = NULL;
+    SSL_CTX *client_ctx = NULL;
+
+    if (!ctx_config->cert_file) {
+        serverLog(LL_WARNING, "No tls-cert-file configured!");
+        goto error;
+    }
+
+    if (!ctx_config->key_file) {
+        serverLog(LL_WARNING, "No tls-key-file configured!");
+        goto error;
+    }
+
+    if (((server.tls_auth_clients != TLS_CLIENT_AUTH_NO) || server.tls_cluster || server.tls_replication) &&
+            !ctx_config->ca_cert_file && !ctx_config->ca_cert_dir) {
+        serverLog(LL_WARNING, "Either tls-ca-cert-file or tls-ca-cert-dir must be specified when tls-cluster, tls-replication or tls-auth-clients are enabled!");
+        goto error;
+    }
+
+    int protocols = parseProtocolsConfig(ctx_config->protocols);
+    if (protocols == -1) goto error;
+
+    /* Create server side/generla context */
+    ctx = createSSLContext(ctx_config, protocols, 0);
+    if (!ctx) goto error;
+
+    if (ctx_config->session_caching) {
+        SSL_CTX_set_session_cache_mode(ctx, SSL_SESS_CACHE_SERVER);
+        SSL_CTX_sess_set_cache_size(ctx, ctx_config->session_cache_size);
+        SSL_CTX_set_timeout(ctx, ctx_config->session_cache_timeout);
+        SSL_CTX_set_session_id_context(ctx, (void *) "redis", 5);
+    } else {
+        SSL_CTX_set_session_cache_mode(ctx, SSL_SESS_CACHE_OFF);
+    }
+
+#ifdef SSL_OP_NO_CLIENT_RENEGOTIATION
+    SSL_CTX_set_options(ctx, SSL_OP_NO_CLIENT_RENEGOTIATION);
+#endif
+
+    if (ctx_config->prefer_server_ciphers)
+        SSL_CTX_set_options(ctx, SSL_OP_CIPHER_SERVER_PREFERENCE);
+
+#if defined(SSL_CTX_set_ecdh_auto)
+    SSL_CTX_set_ecdh_auto(ctx, 1);
+#endif
+    SSL_CTX_set_options(ctx, SSL_OP_SINGLE_DH_USE);
+
+    if (ctx_config->dh_params_file) {
+        FILE *dhfile = fopen(ctx_config->dh_params_file, "r");
+        DH *dh = NULL;
+        if (!dhfile) {
+            serverLog(LL_WARNING, "Failed to load %s: %s", ctx_config->dh_params_file, strerror(errno));
+            goto error;
+        }
+
+        dh = PEM_read_DHparams(dhfile, NULL, NULL, NULL);
+        fclose(dhfile);
+        if (!dh) {
+            serverLog(LL_WARNING, "%s: failed to read DH params.", ctx_config->dh_params_file);
+            goto error;
+        }
+
+        if (SSL_CTX_set_tmp_dh(ctx, dh) <= 0) {
+            ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
+            serverLog(LL_WARNING, "Failed to load DH params file: %s: %s", ctx_config->dh_params_file, errbuf);
+            DH_free(dh);
+            goto error;
+        }
+
+        DH_free(dh);
+    }
+
+    /* If a client-side certificate is configured, create an explicit client context */
+    if (ctx_config->client_cert_file && ctx_config->client_key_file) {
+        client_ctx = createSSLContext(ctx_config, protocols, 1);
+        if (!client_ctx) goto error;
+    }
+
+    SSL_CTX_free(redis_tls_ctx);
+    SSL_CTX_free(redis_tls_client_ctx);
+    redis_tls_ctx = ctx;
+    redis_tls_client_ctx = client_ctx;
+
+    return C_OK;
+
+error:
+    if (ctx) SSL_CTX_free(ctx);
+    if (client_ctx) SSL_CTX_free(client_ctx);
+    return C_ERR;
+}
+
+#ifdef TLS_DEBUGGING
+#define TLSCONN_DEBUG(fmt, ...) \
+    serverLog(LL_DEBUG, "TLSCONN: " fmt, __VA_ARGS__)
+#else
+#define TLSCONN_DEBUG(fmt, ...)
+#endif
+
+ConnectionType CT_TLS;
+
+/* Normal socket connections have a simple events/handler correlation.
+ *
+ * With TLS connections we need to handle cases where during a logical read
+ * or write operation, the SSL library asks to block for the opposite
+ * socket operation.
+ *
+ * When this happens, we need to do two things:
+ * 1. Make sure we register for the event.
+ * 2. Make sure we know which handler needs to execute when the
+ *    event fires.  That is, if we notify the caller of a write operation
+ *    that it blocks, and SSL asks for a read, we need to trigger the
+ *    write handler again on the next read event.
+ *
+ */
+
+typedef enum {
+    WANT_READ = 1,
+    WANT_WRITE
+} WantIOType;
+
+#define TLS_CONN_FLAG_READ_WANT_WRITE   (1<<0)
+#define TLS_CONN_FLAG_WRITE_WANT_READ   (1<<1)
+#define TLS_CONN_FLAG_FD_SET            (1<<2)
+
+typedef struct tls_connection {
+    connection c;
+    int flags;
+    SSL *ssl;
+    char *ssl_error;
+    listNode *pending_list_node;
+} tls_connection;
+
+static connection *createTLSConnection(int client_side) {
+    SSL_CTX *ctx = redis_tls_ctx;
+    if (client_side && redis_tls_client_ctx)
+        ctx = redis_tls_client_ctx;
+    tls_connection *conn = zcalloc(sizeof(tls_connection));
+    conn->c.type = &CT_TLS;
+    conn->c.fd = -1;
+    conn->ssl = SSL_new(ctx);
+    return (connection *) conn;
+}
+
+connection *connCreateTLS(void) {
+    return createTLSConnection(1);
+}
+
+/* Fetch the latest OpenSSL error and store it in the connection */
+static void updateTLSError(tls_connection *conn) {
+    conn->c.last_errno = 0;
+    if (conn->ssl_error) zfree(conn->ssl_error);
+    conn->ssl_error = zmalloc(512);
+    ERR_error_string_n(ERR_get_error(), conn->ssl_error, 512);
+}
+
+/* Create a new TLS connection that is already associated with
+ * an accepted underlying file descriptor.
+ *
+ * The socket is not ready for I/O until connAccept() was called and
+ * invoked the connection-level accept handler.
+ *
+ * Callers should use connGetState() and verify the created connection
+ * is not in an error state.
+ */
+connection *connCreateAcceptedTLS(int fd, int require_auth) {
+    tls_connection *conn = (tls_connection *) createTLSConnection(0);
+    conn->c.fd = fd;
+    conn->c.state = CONN_STATE_ACCEPTING;
+
+    if (!conn->ssl) {
+        updateTLSError(conn);
+        conn->c.state = CONN_STATE_ERROR;
+        return (connection *) conn;
+    }
+
+    switch (require_auth) {
+        case TLS_CLIENT_AUTH_NO:
+            SSL_set_verify(conn->ssl, SSL_VERIFY_NONE, NULL);
+            break;
+        case TLS_CLIENT_AUTH_OPTIONAL:
+            SSL_set_verify(conn->ssl, SSL_VERIFY_PEER, NULL);
+            break;
+        default: /* TLS_CLIENT_AUTH_YES, also fall-secure */
+            SSL_set_verify(conn->ssl, SSL_VERIFY_PEER|SSL_VERIFY_FAIL_IF_NO_PEER_CERT, NULL);
+            break;
+    }
+
+    SSL_set_fd(conn->ssl, conn->c.fd);
+    SSL_set_accept_state(conn->ssl);
+
+    return (connection *) conn;
+}
+
+static void tlsEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask);
+
+/* Process the return code received from OpenSSL>
+ * Update the want parameter with expected I/O.
+ * Update the connection's error state if a real error has occured.
+ * Returns an SSL error code, or 0 if no further handling is required.
+ */
+static int handleSSLReturnCode(tls_connection *conn, int ret_value, WantIOType *want) {
+    if (ret_value <= 0) {
+        int ssl_err = SSL_get_error(conn->ssl, ret_value);
+        switch (ssl_err) {
+            case SSL_ERROR_WANT_WRITE:
+                *want = WANT_WRITE;
+                return 0;
+            case SSL_ERROR_WANT_READ:
+                *want = WANT_READ;
+                return 0;
+            case SSL_ERROR_SYSCALL:
+                conn->c.last_errno = errno;
+                if (conn->ssl_error) zfree(conn->ssl_error);
+                conn->ssl_error = errno ? zstrdup(strerror(errno)) : NULL;
+                break;
+            default:
+                /* Error! */
+                updateTLSError(conn);
+                break;
+        }
+
+        return ssl_err;
+    }
+
+    return 0;
+}
+
+void registerSSLEvent(tls_connection *conn, WantIOType want) {
+    int mask = aeGetFileEvents(server.el, conn->c.fd);
+
+    switch (want) {
+        case WANT_READ:
+            if (mask & AE_WRITABLE) aeDeleteFileEvent(server.el, conn->c.fd, AE_WRITABLE);
+            if (!(mask & AE_READABLE)) aeCreateFileEvent(server.el, conn->c.fd, AE_READABLE,
+                        tlsEventHandler, conn);
+            break;
+        case WANT_WRITE:
+            if (mask & AE_READABLE) aeDeleteFileEvent(server.el, conn->c.fd, AE_READABLE);
+            if (!(mask & AE_WRITABLE)) aeCreateFileEvent(server.el, conn->c.fd, AE_WRITABLE,
+                        tlsEventHandler, conn);
+            break;
+        default:
+            serverAssert(0);
+            break;
+    }
+}
+
+void updateSSLEvent(tls_connection *conn) {
+    int mask = aeGetFileEvents(server.el, conn->c.fd);
+    int need_read = conn->c.read_handler || (conn->flags & TLS_CONN_FLAG_WRITE_WANT_READ);
+    int need_write = conn->c.write_handler || (conn->flags & TLS_CONN_FLAG_READ_WANT_WRITE);
+
+    if (need_read && !(mask & AE_READABLE))
+        aeCreateFileEvent(server.el, conn->c.fd, AE_READABLE, tlsEventHandler, conn);
+    if (!need_read && (mask & AE_READABLE))
+        aeDeleteFileEvent(server.el, conn->c.fd, AE_READABLE);
+
+    if (need_write && !(mask & AE_WRITABLE))
+        aeCreateFileEvent(server.el, conn->c.fd, AE_WRITABLE, tlsEventHandler, conn);
+    if (!need_write && (mask & AE_WRITABLE))
+        aeDeleteFileEvent(server.el, conn->c.fd, AE_WRITABLE);
+}
+
+static void tlsHandleEvent(tls_connection *conn, int mask) {
+    int ret, conn_error;
+
+    TLSCONN_DEBUG("tlsEventHandler(): fd=%d, state=%d, mask=%d, r=%d, w=%d, flags=%d",
+            fd, conn->c.state, mask, conn->c.read_handler != NULL, conn->c.write_handler != NULL,
+            conn->flags);
+
+    ERR_clear_error();
+
+    switch (conn->c.state) {
+        case CONN_STATE_CONNECTING:
+            conn_error = connGetSocketError((connection *) conn);
+            if (conn_error) {
+                conn->c.last_errno = conn_error;
+                conn->c.state = CONN_STATE_ERROR;
+            } else {
+                if (!(conn->flags & TLS_CONN_FLAG_FD_SET)) {
+                    SSL_set_fd(conn->ssl, conn->c.fd);
+                    conn->flags |= TLS_CONN_FLAG_FD_SET;
+                }
+                ret = SSL_connect(conn->ssl);
+                if (ret <= 0) {
+                    WantIOType want = 0;
+                    if (!handleSSLReturnCode(conn, ret, &want)) {
+                        registerSSLEvent(conn, want);
+
+                        /* Avoid hitting UpdateSSLEvent, which knows nothing
+                         * of what SSL_connect() wants and instead looks at our
+                         * R/W handlers.
+                         */
+                        return;
+                    }
+
+                    /* If not handled, it's an error */
+                    conn->c.state = CONN_STATE_ERROR;
+                } else {
+                    conn->c.state = CONN_STATE_CONNECTED;
+                }
+            }
+
+            if (!callHandler((connection *) conn, conn->c.conn_handler)) return;
+            conn->c.conn_handler = NULL;
+            break;
+        case CONN_STATE_ACCEPTING:
+            ret = SSL_accept(conn->ssl);
+            if (ret <= 0) {
+                WantIOType want = 0;
+                if (!handleSSLReturnCode(conn, ret, &want)) {
+                    /* Avoid hitting UpdateSSLEvent, which knows nothing
+                     * of what SSL_connect() wants and instead looks at our
+                     * R/W handlers.
+                     */
+                    registerSSLEvent(conn, want);
+                    return;
+                }
+
+                /* If not handled, it's an error */
+                conn->c.state = CONN_STATE_ERROR;
+            } else {
+                conn->c.state = CONN_STATE_CONNECTED;
+            }
+
+            if (!callHandler((connection *) conn, conn->c.conn_handler)) return;
+            conn->c.conn_handler = NULL;
+            break;
+        case CONN_STATE_CONNECTED:
+        {
+            int call_read = ((mask & AE_READABLE) && conn->c.read_handler) ||
+                ((mask & AE_WRITABLE) && (conn->flags & TLS_CONN_FLAG_READ_WANT_WRITE));
+            int call_write = ((mask & AE_WRITABLE) && conn->c.write_handler) ||
+                ((mask & AE_READABLE) && (conn->flags & TLS_CONN_FLAG_WRITE_WANT_READ));
+
+            /* Normally we execute the readable event first, and the writable
+             * event laster. This is useful as sometimes we may be able
+             * to serve the reply of a query immediately after processing the
+             * query.
+             *
+             * However if WRITE_BARRIER is set in the mask, our application is
+             * asking us to do the reverse: never fire the writable event
+             * after the readable. In such a case, we invert the calls.
+             * This is useful when, for instance, we want to do things
+             * in the beforeSleep() hook, like fsynching a file to disk,
+             * before replying to a client. */
+            int invert = conn->c.flags & CONN_FLAG_WRITE_BARRIER;
+
+            if (!invert && call_read) {
+                conn->flags &= ~TLS_CONN_FLAG_READ_WANT_WRITE;
+                if (!callHandler((connection *) conn, conn->c.read_handler)) return;
+            }
+
+            /* Fire the writable event. */
+            if (call_write) {
+                conn->flags &= ~TLS_CONN_FLAG_WRITE_WANT_READ;
+                if (!callHandler((connection *) conn, conn->c.write_handler)) return;
+            }
+
+            /* If we have to invert the call, fire the readable event now
+             * after the writable one. */
+            if (invert && call_read) {
+                conn->flags &= ~TLS_CONN_FLAG_READ_WANT_WRITE;
+                if (!callHandler((connection *) conn, conn->c.read_handler)) return;
+            }
+
+            /* If SSL has pending that, already read from the socket, we're at
+             * risk of not calling the read handler again, make sure to add it
+             * to a list of pending connection that should be handled anyway. */
+            if ((mask & AE_READABLE)) {
+                if (SSL_pending(conn->ssl) > 0) {
+                    if (!conn->pending_list_node) {
+                        listAddNodeTail(pending_list, conn);
+                        conn->pending_list_node = listLast(pending_list);
+                    }
+                } else if (conn->pending_list_node) {
+                    listDelNode(pending_list, conn->pending_list_node);
+                    conn->pending_list_node = NULL;
+                }
+            }
+
+            break;
+        }
+        default:
+            break;
+    }
+
+    updateSSLEvent(conn);
+}
+
+static void tlsEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask) {
+    UNUSED(el);
+    UNUSED(fd);
+    tls_connection *conn = clientData;
+    tlsHandleEvent(conn, mask);
+}
+
+static void connTLSClose(connection *conn_) {
+    tls_connection *conn = (tls_connection *) conn_;
+
+    if (conn->ssl) {
+        SSL_free(conn->ssl);
+        conn->ssl = NULL;
+    }
+
+    if (conn->ssl_error) {
+        zfree(conn->ssl_error);
+        conn->ssl_error = NULL;
+    }
+
+    if (conn->pending_list_node) {
+        listDelNode(pending_list, conn->pending_list_node);
+        conn->pending_list_node = NULL;
+    }
+
+    CT_Socket.close(conn_);
+}
+
+static int connTLSAccept(connection *_conn, ConnectionCallbackFunc accept_handler) {
+    tls_connection *conn = (tls_connection *) _conn;
+    int ret;
+
+    if (conn->c.state != CONN_STATE_ACCEPTING) return C_ERR;
+    ERR_clear_error();
+
+    /* Try to accept */
+    conn->c.conn_handler = accept_handler;
+    ret = SSL_accept(conn->ssl);
+
+    if (ret <= 0) {
+        WantIOType want = 0;
+        if (!handleSSLReturnCode(conn, ret, &want)) {
+            registerSSLEvent(conn, want);   /* We'll fire back */
+            return C_OK;
+        } else {
+            conn->c.state = CONN_STATE_ERROR;
+            return C_ERR;
+        }
+    }
+
+    conn->c.state = CONN_STATE_CONNECTED;
+    if (!callHandler((connection *) conn, conn->c.conn_handler)) return C_OK;
+    conn->c.conn_handler = NULL;
+
+    return C_OK;
+}
+
+static int connTLSConnect(connection *conn_, const char *addr, int port, const char *src_addr, ConnectionCallbackFunc connect_handler) {
+    tls_connection *conn = (tls_connection *) conn_;
+
+    if (conn->c.state != CONN_STATE_NONE) return C_ERR;
+    ERR_clear_error();
+
+    /* Initiate Socket connection first */
+    if (CT_Socket.connect(conn_, addr, port, src_addr, connect_handler) == C_ERR) return C_ERR;
+
+    /* Return now, once the socket is connected we'll initiate
+     * TLS connection from the event handler.
+     */
+    return C_OK;
+}
+
+static int connTLSWrite(connection *conn_, const void *data, size_t data_len) {
+    tls_connection *conn = (tls_connection *) conn_;
+    int ret, ssl_err;
+
+    if (conn->c.state != CONN_STATE_CONNECTED) return -1;
+    ERR_clear_error();
+    ret = SSL_write(conn->ssl, data, data_len);
+
+    if (ret <= 0) {
+        WantIOType want = 0;
+        if (!(ssl_err = handleSSLReturnCode(conn, ret, &want))) {
+            if (want == WANT_READ) conn->flags |= TLS_CONN_FLAG_WRITE_WANT_READ;
+            updateSSLEvent(conn);
+            errno = EAGAIN;
+            return -1;
+        } else {
+            if (ssl_err == SSL_ERROR_ZERO_RETURN ||
+                    ((ssl_err == SSL_ERROR_SYSCALL && !errno))) {
+                conn->c.state = CONN_STATE_CLOSED;
+                return 0;
+            } else {
+                conn->c.state = CONN_STATE_ERROR;
+                return -1;
+            }
+        }
+    }
+
+    return ret;
+}
+
+static int connTLSRead(connection *conn_, void *buf, size_t buf_len) {
+    tls_connection *conn = (tls_connection *) conn_;
+    int ret;
+    int ssl_err;
+
+    if (conn->c.state != CONN_STATE_CONNECTED) return -1;
+    ERR_clear_error();
+    ret = SSL_read(conn->ssl, buf, buf_len);
+    if (ret <= 0) {
+        WantIOType want = 0;
+        if (!(ssl_err = handleSSLReturnCode(conn, ret, &want))) {
+            if (want == WANT_WRITE) conn->flags |= TLS_CONN_FLAG_READ_WANT_WRITE;
+            updateSSLEvent(conn);
+
+            errno = EAGAIN;
+            return -1;
+        } else {
+            if (ssl_err == SSL_ERROR_ZERO_RETURN ||
+                    ((ssl_err == SSL_ERROR_SYSCALL) && !errno)) {
+                conn->c.state = CONN_STATE_CLOSED;
+                return 0;
+            } else {
+                conn->c.state = CONN_STATE_ERROR;
+                return -1;
+            }
+        }
+    }
+
+    return ret;
+}
+
+static const char *connTLSGetLastError(connection *conn_) {
+    tls_connection *conn = (tls_connection *) conn_;
+
+    if (conn->ssl_error) return conn->ssl_error;
+    return NULL;
+}
+
+int connTLSSetWriteHandler(connection *conn, ConnectionCallbackFunc func, int barrier) {
+    conn->write_handler = func;
+    if (barrier)
+        conn->flags |= CONN_FLAG_WRITE_BARRIER;
+    else
+        conn->flags &= ~CONN_FLAG_WRITE_BARRIER;
+    updateSSLEvent((tls_connection *) conn);
+    return C_OK;
+}
+
+int connTLSSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
+    conn->read_handler = func;
+    updateSSLEvent((tls_connection *) conn);
+    return C_OK;
+}
+
+static void setBlockingTimeout(tls_connection *conn, long long timeout) {
+    anetBlock(NULL, conn->c.fd);
+    anetSendTimeout(NULL, conn->c.fd, timeout);
+    anetRecvTimeout(NULL, conn->c.fd, timeout);
+}
+
+static void unsetBlockingTimeout(tls_connection *conn) {
+    anetNonBlock(NULL, conn->c.fd);
+    anetSendTimeout(NULL, conn->c.fd, 0);
+    anetRecvTimeout(NULL, conn->c.fd, 0);
+}
+
+static int connTLSBlockingConnect(connection *conn_, const char *addr, int port, long long timeout) {
+    tls_connection *conn = (tls_connection *) conn_;
+    int ret;
+
+    if (conn->c.state != CONN_STATE_NONE) return C_ERR;
+
+    /* Initiate socket blocking connect first */
+    if (CT_Socket.blocking_connect(conn_, addr, port, timeout) == C_ERR) return C_ERR;
+
+    /* Initiate TLS connection now.  We set up a send/recv timeout on the socket,
+     * which means the specified timeout will not be enforced accurately. */
+    SSL_set_fd(conn->ssl, conn->c.fd);
+    setBlockingTimeout(conn, timeout);
+
+    if ((ret = SSL_connect(conn->ssl)) <= 0) {
+        conn->c.state = CONN_STATE_ERROR;
+        return C_ERR;
+    }
+    unsetBlockingTimeout(conn);
+
+    conn->c.state = CONN_STATE_CONNECTED;
+    return C_OK;
+}
+
+static ssize_t connTLSSyncWrite(connection *conn_, char *ptr, ssize_t size, long long timeout) {
+    tls_connection *conn = (tls_connection *) conn_;
+
+    setBlockingTimeout(conn, timeout);
+    SSL_clear_mode(conn->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE);
+    int ret = SSL_write(conn->ssl, ptr, size);
+    SSL_set_mode(conn->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE);
+    unsetBlockingTimeout(conn);
+
+    return ret;
+}
+
+static ssize_t connTLSSyncRead(connection *conn_, char *ptr, ssize_t size, long long timeout) {
+    tls_connection *conn = (tls_connection *) conn_;
+
+    setBlockingTimeout(conn, timeout);
+    int ret = SSL_read(conn->ssl, ptr, size);
+    unsetBlockingTimeout(conn);
+
+    return ret;
+}
+
+static ssize_t connTLSSyncReadLine(connection *conn_, char *ptr, ssize_t size, long long timeout) {
+    tls_connection *conn = (tls_connection *) conn_;
+    ssize_t nread = 0;
+
+    setBlockingTimeout(conn, timeout);
+
+    size--;
+    while(size) {
+        char c;
+
+        if (SSL_read(conn->ssl,&c,1) <= 0) {
+            nread = -1;
+            goto exit;
+        }
+        if (c == '\n') {
+            *ptr = '\0';
+            if (nread && *(ptr-1) == '\r') *(ptr-1) = '\0';
+            goto exit;
+        } else {
+            *ptr++ = c;
+            *ptr = '\0';
+            nread++;
+        }
+        size--;
+    }
+exit:
+    unsetBlockingTimeout(conn);
+    return nread;
+}
+
+static int connTLSGetType(connection *conn_) {
+    (void) conn_;
+
+    return CONN_TYPE_TLS;
+}
+
+ConnectionType CT_TLS = {
+    .ae_handler = tlsEventHandler,
+    .accept = connTLSAccept,
+    .connect = connTLSConnect,
+    .blocking_connect = connTLSBlockingConnect,
+    .read = connTLSRead,
+    .write = connTLSWrite,
+    .close = connTLSClose,
+    .set_write_handler = connTLSSetWriteHandler,
+    .set_read_handler = connTLSSetReadHandler,
+    .get_last_error = connTLSGetLastError,
+    .sync_write = connTLSSyncWrite,
+    .sync_read = connTLSSyncRead,
+    .sync_readline = connTLSSyncReadLine,
+    .get_type = connTLSGetType
+};
+
+int tlsHasPendingData() {
+    if (!pending_list)
+        return 0;
+    return listLength(pending_list) > 0;
+}
+
+int tlsProcessPendingData() {
+    listIter li;
+    listNode *ln;
+
+    int processed = listLength(pending_list);
+    listRewind(pending_list,&li);
+    while((ln = listNext(&li))) {
+        tls_connection *conn = listNodeValue(ln);
+        tlsHandleEvent(conn, AE_READABLE);
+    }
+    return processed;
+}
+
+/* Fetch the peer certificate used for authentication on the specified
+ * connection and return it as a PEM-encoded sds.
+ */
+sds connTLSGetPeerCert(connection *conn_) {
+    tls_connection *conn = (tls_connection *) conn_;
+    if (conn_->type->get_type(conn_) != CONN_TYPE_TLS || !conn->ssl) return NULL;
+
+    X509 *cert = SSL_get_peer_certificate(conn->ssl);
+    if (!cert) return NULL;
+
+    BIO *bio = BIO_new(BIO_s_mem());
+    if (bio == NULL || !PEM_write_bio_X509(bio, cert)) {
+        if (bio != NULL) BIO_free(bio);
+        return NULL;
+    }
+
+    const char *bio_ptr;
+    long long bio_len = BIO_get_mem_data(bio, &bio_ptr);
+    sds cert_pem = sdsnewlen(bio_ptr, bio_len);
+    BIO_free(bio);
+
+    return cert_pem;
+}
+
+#else   /* USE_OPENSSL */
+
+void tlsInit(void) {
+}
+
+void tlsCleanup(void) {
+}
+
+int tlsConfigure(redisTLSContextConfig *ctx_config) {
+    UNUSED(ctx_config);
+    return C_OK;
+}
+
+connection *connCreateTLS(void) { 
+    return NULL;
+}
+
+connection *connCreateAcceptedTLS(int fd, int require_auth) {
+    UNUSED(fd);
+    UNUSED(require_auth);
+
+    return NULL;
+}
+
+int tlsHasPendingData() {
+    return 0;
+}
+
+int tlsProcessPendingData() {
+    return 0;
+}
+
+sds connTLSGetPeerCert(connection *conn_) {
+    (void) conn_;
+    return NULL;
+}
+
+#endif
diff --git a/redis-stable/src/tracking.c b/redis-stable/src/tracking.c
new file mode 100644
index 00000000..a57f062c
--- /dev/null
+++ b/redis-stable/src/tracking.c
@@ -0,0 +1,604 @@
+/* tracking.c - Client side caching: keys tracking and invalidation
+ *
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "server.h"
+
+/* The tracking table is constituted by a radix tree of keys, each pointing
+ * to a radix tree of client IDs, used to track the clients that may have
+ * certain keys in their local, client side, cache.
+ *
+ * When a client enables tracking with "CLIENT TRACKING on", each key served to
+ * the client is remembered in the table mapping the keys to the client IDs.
+ * Later, when a key is modified, all the clients that may have local copy
+ * of such key will receive an invalidation message.
+ *
+ * Clients will normally take frequently requested objects in memory, removing
+ * them when invalidation messages are received. */
+rax *TrackingTable = NULL;
+rax *PrefixTable = NULL;
+uint64_t TrackingTableTotalItems = 0; /* Total number of IDs stored across
+                                         the whole tracking table. This gives
+                                         an hint about the total memory we
+                                         are using server side for CSC. */
+robj *TrackingChannelName;
+
+/* This is the structure that we have as value of the PrefixTable, and
+ * represents the list of keys modified, and the list of clients that need
+ * to be notified, for a given prefix. */
+typedef struct bcastState {
+    rax *keys;      /* Keys modified in the current event loop cycle. */
+    rax *clients;   /* Clients subscribed to the notification events for this
+                       prefix. */
+} bcastState;
+
+/* Remove the tracking state from the client 'c'. Note that there is not much
+ * to do for us here, if not to decrement the counter of the clients in
+ * tracking mode, because we just store the ID of the client in the tracking
+ * table, so we'll remove the ID reference in a lazy way. Otherwise when a
+ * client with many entries in the table is removed, it would cost a lot of
+ * time to do the cleanup. */
+void disableTracking(client *c) {
+    /* If this client is in broadcasting mode, we need to unsubscribe it
+     * from all the prefixes it is registered to. */
+    if (c->flags & CLIENT_TRACKING_BCAST) {
+        raxIterator ri;
+        raxStart(&ri,c->client_tracking_prefixes);
+        raxSeek(&ri,"^",NULL,0);
+        while(raxNext(&ri)) {
+            bcastState *bs = raxFind(PrefixTable,ri.key,ri.key_len);
+            serverAssert(bs != raxNotFound);
+            raxRemove(bs->clients,(unsigned char*)&c,sizeof(c),NULL);
+            /* Was it the last client? Remove the prefix from the
+             * table. */
+            if (raxSize(bs->clients) == 0) {
+                raxFree(bs->clients);
+                raxFree(bs->keys);
+                zfree(bs);
+                raxRemove(PrefixTable,ri.key,ri.key_len,NULL);
+            }
+        }
+        raxStop(&ri);
+        raxFree(c->client_tracking_prefixes);
+        c->client_tracking_prefixes = NULL;
+    }
+
+    /* Clear flags and adjust the count. */
+    if (c->flags & CLIENT_TRACKING) {
+        server.tracking_clients--;
+        c->flags &= ~(CLIENT_TRACKING|CLIENT_TRACKING_BROKEN_REDIR|
+                      CLIENT_TRACKING_BCAST|CLIENT_TRACKING_OPTIN|
+                      CLIENT_TRACKING_OPTOUT|CLIENT_TRACKING_CACHING|
+                      CLIENT_TRACKING_NOLOOP);
+    }
+}
+
+static int stringCheckPrefix(unsigned char *s1, size_t s1_len, unsigned char *s2, size_t s2_len) {
+    size_t min_length = s1_len < s2_len ? s1_len : s2_len;
+    return memcmp(s1,s2,min_length) == 0;   
+}
+
+/* Check if any of the provided prefixes collide with one another or
+ * with an existing prefix for the client. A collision is defined as two 
+ * prefixes that will emit an invalidation for the same key. If no prefix 
+ * collision is found, 1 is return, otherwise 0 is returned and the client 
+ * has an error emitted describing the error. */
+int checkPrefixCollisionsOrReply(client *c, robj **prefixes, size_t numprefix) {
+    for (size_t i = 0; i < numprefix; i++) {
+        /* Check input list has no overlap with existing prefixes. */
+        if (c->client_tracking_prefixes) {
+            raxIterator ri;
+            raxStart(&ri,c->client_tracking_prefixes);
+            raxSeek(&ri,"^",NULL,0);
+            while(raxNext(&ri)) {
+                if (stringCheckPrefix(ri.key,ri.key_len,
+                    prefixes[i]->ptr,sdslen(prefixes[i]->ptr))) 
+                {
+                    sds collision = sdsnewlen(ri.key,ri.key_len);
+                    addReplyErrorFormat(c,
+                        "Prefix '%s' overlaps with an existing prefix '%s'. "
+                        "Prefixes for a single client must not overlap.",
+                        (unsigned char *)prefixes[i]->ptr,
+                        (unsigned char *)collision);
+                    sdsfree(collision);
+                    raxStop(&ri);
+                    return 0;
+                }
+            }
+            raxStop(&ri);
+        }
+        /* Check input has no overlap with itself. */
+        for (size_t j = i + 1; j < numprefix; j++) {
+            if (stringCheckPrefix(prefixes[i]->ptr,sdslen(prefixes[i]->ptr),
+                prefixes[j]->ptr,sdslen(prefixes[j]->ptr)))
+            {
+                addReplyErrorFormat(c,
+                    "Prefix '%s' overlaps with another provided prefix '%s'. "
+                    "Prefixes for a single client must not overlap.",
+                    (unsigned char *)prefixes[i]->ptr,
+                    (unsigned char *)prefixes[j]->ptr);
+                return i;
+            }
+        }
+    }
+    return 1;
+}
+
+/* Set the client 'c' to track the prefix 'prefix'. If the client 'c' is
+ * already registered for the specified prefix, no operation is performed. */
+void enableBcastTrackingForPrefix(client *c, char *prefix, size_t plen) {
+    bcastState *bs = raxFind(PrefixTable,(unsigned char*)prefix,plen);
+    /* If this is the first client subscribing to such prefix, create
+     * the prefix in the table. */
+    if (bs == raxNotFound) {
+        bs = zmalloc(sizeof(*bs));
+        bs->keys = raxNew();
+        bs->clients = raxNew();
+        raxInsert(PrefixTable,(unsigned char*)prefix,plen,bs,NULL);
+    }
+    if (raxTryInsert(bs->clients,(unsigned char*)&c,sizeof(c),NULL,NULL)) {
+        if (c->client_tracking_prefixes == NULL)
+            c->client_tracking_prefixes = raxNew();
+        raxInsert(c->client_tracking_prefixes,
+                  (unsigned char*)prefix,plen,NULL,NULL);
+    }
+}
+
+/* Enable the tracking state for the client 'c', and as a side effect allocates
+ * the tracking table if needed. If the 'redirect_to' argument is non zero, the
+ * invalidation messages for this client will be sent to the client ID
+ * specified by the 'redirect_to' argument. Note that if such client will
+ * eventually get freed, we'll send a message to the original client to
+ * inform it of the condition. Multiple clients can redirect the invalidation
+ * messages to the same client ID. */
+void enableTracking(client *c, uint64_t redirect_to, uint64_t options, robj **prefix, size_t numprefix) {
+    if (!(c->flags & CLIENT_TRACKING)) server.tracking_clients++;
+    c->flags |= CLIENT_TRACKING;
+    c->flags &= ~(CLIENT_TRACKING_BROKEN_REDIR|CLIENT_TRACKING_BCAST|
+                  CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT|
+                  CLIENT_TRACKING_NOLOOP);
+    c->client_tracking_redirection = redirect_to;
+
+    /* This may be the first client we ever enable. Create the tracking
+     * table if it does not exist. */
+    if (TrackingTable == NULL) {
+        TrackingTable = raxNew();
+        PrefixTable = raxNew();
+        TrackingChannelName = createStringObject("__redis__:invalidate",20);
+    }
+
+    /* For broadcasting, set the list of prefixes in the client. */
+    if (options & CLIENT_TRACKING_BCAST) {
+        c->flags |= CLIENT_TRACKING_BCAST;
+        if (numprefix == 0) enableBcastTrackingForPrefix(c,"",0);
+        for (size_t j = 0; j < numprefix; j++) {
+            sds sdsprefix = prefix[j]->ptr;
+            enableBcastTrackingForPrefix(c,sdsprefix,sdslen(sdsprefix));
+        }
+    }
+
+    /* Set the remaining flags that don't need any special handling. */
+    c->flags |= options & (CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT|
+                           CLIENT_TRACKING_NOLOOP);
+}
+
+/* This function is called after the execution of a readonly command in the
+ * case the client 'c' has keys tracking enabled and the tracking is not
+ * in BCAST mode. It will populate the tracking invalidation table according
+ * to the keys the user fetched, so that Redis will know what are the clients
+ * that should receive an invalidation message with certain groups of keys
+ * are modified. */
+void trackingRememberKeys(client *c) {
+    /* Return if we are in optin/out mode and the right CACHING command
+     * was/wasn't given in order to modify the default behavior. */
+    uint64_t optin = c->flags & CLIENT_TRACKING_OPTIN;
+    uint64_t optout = c->flags & CLIENT_TRACKING_OPTOUT;
+    uint64_t caching_given = c->flags & CLIENT_TRACKING_CACHING;
+    if ((optin && !caching_given) || (optout && caching_given)) return;
+
+    getKeysResult result = GETKEYS_RESULT_INIT;
+    int numkeys = getKeysFromCommand(c->cmd,c->argv,c->argc,&result);
+    if (!numkeys) {
+        getKeysFreeResult(&result);
+        return;
+    }
+
+    int *keys = result.keys;
+
+    for(int j = 0; j < numkeys; j++) {
+        int idx = keys[j];
+        sds sdskey = c->argv[idx]->ptr;
+        rax *ids = raxFind(TrackingTable,(unsigned char*)sdskey,sdslen(sdskey));
+        if (ids == raxNotFound) {
+            ids = raxNew();
+            int inserted = raxTryInsert(TrackingTable,(unsigned char*)sdskey,
+                                        sdslen(sdskey),ids, NULL);
+            serverAssert(inserted == 1);
+        }
+        if (raxTryInsert(ids,(unsigned char*)&c->id,sizeof(c->id),NULL,NULL))
+            TrackingTableTotalItems++;
+    }
+    getKeysFreeResult(&result);
+}
+
+/* Given a key name, this function sends an invalidation message in the
+ * proper channel (depending on RESP version: PubSub or Push message) and
+ * to the proper client (in case fo redirection), in the context of the
+ * client 'c' with tracking enabled.
+ *
+ * In case the 'proto' argument is non zero, the function will assume that
+ * 'keyname' points to a buffer of 'keylen' bytes already expressed in the
+ * form of Redis RESP protocol. This is used for:
+ * - In BCAST mode, to send an array of invalidated keys to all
+ *   applicable clients
+ * - Following a flush command, to send a single RESP NULL to indicate
+ *   that all keys are now invalid. */
+void sendTrackingMessage(client *c, char *keyname, size_t keylen, int proto) {
+    int using_redirection = 0;
+    if (c->client_tracking_redirection) {
+        client *redir = lookupClientByID(c->client_tracking_redirection);
+        if (!redir) {
+            c->flags |= CLIENT_TRACKING_BROKEN_REDIR;
+            /* We need to signal to the original connection that we
+             * are unable to send invalidation messages to the redirected
+             * connection, because the client no longer exist. */
+            if (c->resp > 2) {
+                addReplyPushLen(c,2);
+                addReplyBulkCBuffer(c,"tracking-redir-broken",21);
+                addReplyLongLong(c,c->client_tracking_redirection);
+            }
+            return;
+        }
+        c = redir;
+        using_redirection = 1;
+    }
+
+    /* Only send such info for clients in RESP version 3 or more. However
+     * if redirection is active, and the connection we redirect to is
+     * in Pub/Sub mode, we can support the feature with RESP 2 as well,
+     * by sending Pub/Sub messages in the __redis__:invalidate channel. */
+    if (c->resp > 2) {
+        addReplyPushLen(c,2);
+        addReplyBulkCBuffer(c,"invalidate",10);
+    } else if (using_redirection && c->flags & CLIENT_PUBSUB) {
+        /* We use a static object to speedup things, however we assume
+         * that addReplyPubsubMessage() will not take a reference. */
+        addReplyPubsubMessage(c,TrackingChannelName,NULL);
+    } else {
+        /* If are here, the client is not using RESP3, nor is
+         * redirecting to another client. We can't send anything to
+         * it since RESP2 does not support push messages in the same
+         * connection. */
+        return;
+    }
+
+    /* Send the "value" part, which is the array of keys. */
+    if (proto) {
+        addReplyProto(c,keyname,keylen);
+    } else {
+        addReplyArrayLen(c,1);
+        addReplyBulkCBuffer(c,keyname,keylen);
+    }
+}
+
+/* This function is called when a key is modified in Redis and in the case
+ * we have at least one client with the BCAST mode enabled.
+ * Its goal is to set the key in the right broadcast state if the key
+ * matches one or more prefixes in the prefix table. Later when we
+ * return to the event loop, we'll send invalidation messages to the
+ * clients subscribed to each prefix. */
+void trackingRememberKeyToBroadcast(client *c, char *keyname, size_t keylen) {
+    raxIterator ri;
+    raxStart(&ri,PrefixTable);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        if (ri.key_len > keylen) continue;
+        if (ri.key_len != 0 && memcmp(ri.key,keyname,ri.key_len) != 0)
+            continue;
+        bcastState *bs = ri.data;
+        /* We insert the client pointer as associated value in the radix
+         * tree. This way we know who was the client that did the last
+         * change to the key, and can avoid sending the notification in the
+         * case the client is in NOLOOP mode. */
+        raxInsert(bs->keys,(unsigned char*)keyname,keylen,c,NULL);
+    }
+    raxStop(&ri);
+}
+
+/* This function is called from signalModifiedKey() or other places in Redis
+ * when a key changes value. In the context of keys tracking, our task here is
+ * to send a notification to every client that may have keys about such caching
+ * slot.
+ *
+ * Note that 'c' may be NULL in case the operation was performed outside the
+ * context of a client modifying the database (for instance when we delete a
+ * key because of expire).
+ *
+ * The last argument 'bcast' tells the function if it should also schedule
+ * the key for broadcasting to clients in BCAST mode. This is the case when
+ * the function is called from the Redis core once a key is modified, however
+ * we also call the function in order to evict keys in the key table in case
+ * of memory pressure: in that case the key didn't really change, so we want
+ * just to notify the clients that are in the table for this key, that would
+ * otherwise miss the fact we are no longer tracking the key for them. */
+void trackingInvalidateKeyRaw(client *c, char *key, size_t keylen, int bcast) {
+    if (TrackingTable == NULL) return;
+
+    if (bcast && raxSize(PrefixTable) > 0)
+        trackingRememberKeyToBroadcast(c,key,keylen);
+
+    rax *ids = raxFind(TrackingTable,(unsigned char*)key,keylen);
+    if (ids == raxNotFound) return;
+
+    raxIterator ri;
+    raxStart(&ri,ids);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        uint64_t id;
+        memcpy(&id,ri.key,sizeof(id));
+        client *target = lookupClientByID(id);
+        /* Note that if the client is in BCAST mode, we don't want to
+         * send invalidation messages that were pending in the case
+         * previously the client was not in BCAST mode. This can happen if
+         * TRACKING is enabled normally, and then the client switches to
+         * BCAST mode. */
+        if (target == NULL ||
+            !(target->flags & CLIENT_TRACKING)||
+            target->flags & CLIENT_TRACKING_BCAST)
+        {
+            continue;
+        }
+
+        /* If the client enabled the NOLOOP mode, don't send notifications
+         * about keys changed by the client itself. */
+        if (target->flags & CLIENT_TRACKING_NOLOOP &&
+            target == c)
+        {
+            continue;
+        }
+
+        sendTrackingMessage(target,key,keylen,0);
+    }
+    raxStop(&ri);
+
+    /* Free the tracking table: we'll create the radix tree and populate it
+     * again if more keys will be modified in this caching slot. */
+    TrackingTableTotalItems -= raxSize(ids);
+    raxFree(ids);
+    raxRemove(TrackingTable,(unsigned char*)key,keylen,NULL);
+}
+
+/* Wrapper (the one actually called across the core) to pass the key
+ * as object. */
+void trackingInvalidateKey(client *c, robj *keyobj) {
+    trackingInvalidateKeyRaw(c,keyobj->ptr,sdslen(keyobj->ptr),1);
+}
+
+/* This function is called when one or all the Redis databases are
+ * flushed. Caching keys are not specific for each DB but are global: 
+ * currently what we do is send a special notification to clients with 
+ * tracking enabled, sending a RESP NULL, which means, "all the keys", 
+ * in order to avoid flooding clients with many invalidation messages 
+ * for all the keys they may hold.
+ */
+void freeTrackingRadixTreeCallback(void *rt) {
+    raxFree(rt);
+}
+
+void freeTrackingRadixTree(rax *rt) {
+    raxFreeWithCallback(rt,freeTrackingRadixTreeCallback);
+}
+
+/* A RESP NULL is sent to indicate that all keys are invalid */
+void trackingInvalidateKeysOnFlush(int async) {
+    if (server.tracking_clients) {
+        listNode *ln;
+        listIter li;
+        listRewind(server.clients,&li);
+        while ((ln = listNext(&li)) != NULL) {
+            client *c = listNodeValue(ln);
+            if (c->flags & CLIENT_TRACKING) {
+                sendTrackingMessage(c,shared.null[c->resp]->ptr,sdslen(shared.null[c->resp]->ptr),1);
+            }
+        }
+    }
+
+    /* In case of FLUSHALL, reclaim all the memory used by tracking. */
+    if (TrackingTable) {
+        if (async) {
+            freeTrackingRadixTreeAsync(TrackingTable);
+        } else {
+            freeTrackingRadixTree(TrackingTable);
+        }
+        TrackingTable = raxNew();
+        TrackingTableTotalItems = 0;
+    }
+}
+
+/* Tracking forces Redis to remember information about which client may have
+ * certain keys. In workloads where there are a lot of reads, but keys are
+ * hardly modified, the amount of information we have to remember server side
+ * could be a lot, with the number of keys being totally not bound.
+ *
+ * So Redis allows the user to configure a maximum number of keys for the
+ * invalidation table. This function makes sure that we don't go over the
+ * specified fill rate: if we are over, we can just evict informations about
+ * a random key, and send invalidation messages to clients like if the key was
+ * modified. */
+void trackingLimitUsedSlots(void) {
+    static unsigned int timeout_counter = 0;
+    if (TrackingTable == NULL) return;
+    if (server.tracking_table_max_keys == 0) return; /* No limits set. */
+    size_t max_keys = server.tracking_table_max_keys;
+    if (raxSize(TrackingTable) <= max_keys) {
+        timeout_counter = 0;
+        return; /* Limit not reached. */
+    }
+
+    /* We have to invalidate a few keys to reach the limit again. The effort
+     * we do here is proportional to the number of times we entered this
+     * function and found that we are still over the limit. */
+    int effort = 100 * (timeout_counter+1);
+
+    /* We just remove one key after another by using a random walk. */
+    raxIterator ri;
+    raxStart(&ri,TrackingTable);
+    while(effort > 0) {
+        effort--;
+        raxSeek(&ri,"^",NULL,0);
+        raxRandomWalk(&ri,0);
+        if (raxEOF(&ri)) break;
+        trackingInvalidateKeyRaw(NULL,(char*)ri.key,ri.key_len,0);
+        if (raxSize(TrackingTable) <= max_keys) {
+            timeout_counter = 0;
+            raxStop(&ri);
+            return; /* Return ASAP: we are again under the limit. */
+        }
+    }
+
+    /* If we reach this point, we were not able to go under the configured
+     * limit using the maximum effort we had for this run. */
+    raxStop(&ri);
+    timeout_counter++;
+}
+
+/* Generate Redis protocol for an array containing all the key names
+ * in the 'keys' radix tree. If the client is not NULL, the list will not
+ * include keys that were modified the last time by this client, in order
+ * to implement the NOLOOP option.
+ *
+ * If the resultin array would be empty, NULL is returned instead. */
+sds trackingBuildBroadcastReply(client *c, rax *keys) {
+    raxIterator ri;
+    uint64_t count;
+
+    if (c == NULL) {
+        count = raxSize(keys);
+    } else {
+        count = 0;
+        raxStart(&ri,keys);
+        raxSeek(&ri,"^",NULL,0);
+        while(raxNext(&ri)) {
+            if (ri.data != c) count++;
+        }
+        raxStop(&ri);
+
+        if (count == 0) return NULL;
+    }
+
+    /* Create the array reply with the list of keys once, then send
+    * it to all the clients subscribed to this prefix. */
+    char buf[32];
+    size_t len = ll2string(buf,sizeof(buf),count);
+    sds proto = sdsempty();
+    proto = sdsMakeRoomFor(proto,count*15);
+    proto = sdscatlen(proto,"*",1);
+    proto = sdscatlen(proto,buf,len);
+    proto = sdscatlen(proto,"\r\n",2);
+    raxStart(&ri,keys);
+    raxSeek(&ri,"^",NULL,0);
+    while(raxNext(&ri)) {
+        if (c && ri.data == c) continue;
+        len = ll2string(buf,sizeof(buf),ri.key_len);
+        proto = sdscatlen(proto,"$",1);
+        proto = sdscatlen(proto,buf,len);
+        proto = sdscatlen(proto,"\r\n",2);
+        proto = sdscatlen(proto,ri.key,ri.key_len);
+        proto = sdscatlen(proto,"\r\n",2);
+    }
+    raxStop(&ri);
+    return proto;
+}
+
+/* This function will run the prefixes of clients in BCAST mode and
+ * keys that were modified about each prefix, and will send the
+ * notifications to each client in each prefix. */
+void trackingBroadcastInvalidationMessages(void) {
+    raxIterator ri, ri2;
+
+    /* Return ASAP if there is nothing to do here. */
+    if (TrackingTable == NULL || !server.tracking_clients) return;
+
+    raxStart(&ri,PrefixTable);
+    raxSeek(&ri,"^",NULL,0);
+
+    /* For each prefix... */
+    while(raxNext(&ri)) {
+        bcastState *bs = ri.data;
+
+        if (raxSize(bs->keys)) {
+            /* Generate the common protocol for all the clients that are
+             * not using the NOLOOP option. */
+            sds proto = trackingBuildBroadcastReply(NULL,bs->keys);
+
+            /* Send this array of keys to every client in the list. */
+            raxStart(&ri2,bs->clients);
+            raxSeek(&ri2,"^",NULL,0);
+            while(raxNext(&ri2)) {
+                client *c;
+                memcpy(&c,ri2.key,sizeof(c));
+                if (c->flags & CLIENT_TRACKING_NOLOOP) {
+                    /* This client may have certain keys excluded. */
+                    sds adhoc = trackingBuildBroadcastReply(c,bs->keys);
+                    if (adhoc) {
+                        sendTrackingMessage(c,adhoc,sdslen(adhoc),1);
+                        sdsfree(adhoc);
+                    }
+                } else {
+                    sendTrackingMessage(c,proto,sdslen(proto),1);
+                }
+            }
+            raxStop(&ri2);
+
+            /* Clean up: we can remove everything from this state, because we
+             * want to only track the new keys that will be accumulated starting
+             * from now. */
+            sdsfree(proto);
+        }
+        raxFree(bs->keys);
+        bs->keys = raxNew();
+    }
+    raxStop(&ri);
+}
+
+/* This is just used in order to access the amount of used slots in the
+ * tracking table. */
+uint64_t trackingGetTotalItems(void) {
+    return TrackingTableTotalItems;
+}
+
+uint64_t trackingGetTotalKeys(void) {
+    if (TrackingTable == NULL) return 0;
+    return raxSize(TrackingTable);
+}
+
+uint64_t trackingGetTotalPrefixes(void) {
+    if (PrefixTable == NULL) return 0;
+    return raxSize(PrefixTable);
+}
diff --git a/redis-stable/src/util.c b/redis-stable/src/util.c
new file mode 100644
index 00000000..df7a489a
--- /dev/null
+++ b/redis-stable/src/util.c
@@ -0,0 +1,959 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "fmacros.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <ctype.h>
+#include <limits.h>
+#include <math.h>
+#include <unistd.h>
+#include <sys/time.h>
+#include <float.h>
+#include <stdint.h>
+#include <errno.h>
+#include <time.h>
+
+#include "util.h"
+#include "sha256.h"
+
+/* Glob-style pattern matching. */
+int stringmatchlen(const char *pattern, int patternLen,
+        const char *string, int stringLen, int nocase)
+{
+    while(patternLen && stringLen) {
+        switch(pattern[0]) {
+        case '*':
+            while (patternLen && pattern[1] == '*') {
+                pattern++;
+                patternLen--;
+            }
+            if (patternLen == 1)
+                return 1; /* match */
+            while(stringLen) {
+                if (stringmatchlen(pattern+1, patternLen-1,
+                            string, stringLen, nocase))
+                    return 1; /* match */
+                string++;
+                stringLen--;
+            }
+            return 0; /* no match */
+            break;
+        case '?':
+            string++;
+            stringLen--;
+            break;
+        case '[':
+        {
+            int not, match;
+
+            pattern++;
+            patternLen--;
+            not = pattern[0] == '^';
+            if (not) {
+                pattern++;
+                patternLen--;
+            }
+            match = 0;
+            while(1) {
+                if (pattern[0] == '\\' && patternLen >= 2) {
+                    pattern++;
+                    patternLen--;
+                    if (pattern[0] == string[0])
+                        match = 1;
+                } else if (pattern[0] == ']') {
+                    break;
+                } else if (patternLen == 0) {
+                    pattern--;
+                    patternLen++;
+                    break;
+                } else if (patternLen >= 3 && pattern[1] == '-') {
+                    int start = pattern[0];
+                    int end = pattern[2];
+                    int c = string[0];
+                    if (start > end) {
+                        int t = start;
+                        start = end;
+                        end = t;
+                    }
+                    if (nocase) {
+                        start = tolower(start);
+                        end = tolower(end);
+                        c = tolower(c);
+                    }
+                    pattern += 2;
+                    patternLen -= 2;
+                    if (c >= start && c <= end)
+                        match = 1;
+                } else {
+                    if (!nocase) {
+                        if (pattern[0] == string[0])
+                            match = 1;
+                    } else {
+                        if (tolower((int)pattern[0]) == tolower((int)string[0]))
+                            match = 1;
+                    }
+                }
+                pattern++;
+                patternLen--;
+            }
+            if (not)
+                match = !match;
+            if (!match)
+                return 0; /* no match */
+            string++;
+            stringLen--;
+            break;
+        }
+        case '\\':
+            if (patternLen >= 2) {
+                pattern++;
+                patternLen--;
+            }
+            /* fall through */
+        default:
+            if (!nocase) {
+                if (pattern[0] != string[0])
+                    return 0; /* no match */
+            } else {
+                if (tolower((int)pattern[0]) != tolower((int)string[0]))
+                    return 0; /* no match */
+            }
+            string++;
+            stringLen--;
+            break;
+        }
+        pattern++;
+        patternLen--;
+        if (stringLen == 0) {
+            while(*pattern == '*') {
+                pattern++;
+                patternLen--;
+            }
+            break;
+        }
+    }
+    if (patternLen == 0 && stringLen == 0)
+        return 1;
+    return 0;
+}
+
+int stringmatch(const char *pattern, const char *string, int nocase) {
+    return stringmatchlen(pattern,strlen(pattern),string,strlen(string),nocase);
+}
+
+/* Fuzz stringmatchlen() trying to crash it with bad input. */
+int stringmatchlen_fuzz_test(void) {
+    char str[32];
+    char pat[32];
+    int cycles = 10000000;
+    int total_matches = 0;
+    while(cycles--) {
+        int strlen = rand() % sizeof(str);
+        int patlen = rand() % sizeof(pat);
+        for (int j = 0; j < strlen; j++) str[j] = rand() % 128;
+        for (int j = 0; j < patlen; j++) pat[j] = rand() % 128;
+        total_matches += stringmatchlen(pat, patlen, str, strlen, 0);
+    }
+    return total_matches;
+}
+
+/* Convert a string representing an amount of memory into the number of
+ * bytes, so for instance memtoll("1Gb") will return 1073741824 that is
+ * (1024*1024*1024).
+ *
+ * On parsing error, if *err is not NULL, it's set to 1, otherwise it's
+ * set to 0. On error the function return value is 0, regardless of the
+ * fact 'err' is NULL or not. */
+long long memtoll(const char *p, int *err) {
+    const char *u;
+    char buf[128];
+    long mul; /* unit multiplier */
+    long long val;
+    unsigned int digits;
+
+    if (err) *err = 0;
+
+    /* Search the first non digit character. */
+    u = p;
+    if (*u == '-') u++;
+    while(*u && isdigit(*u)) u++;
+    if (*u == '\0' || !strcasecmp(u,"b")) {
+        mul = 1;
+    } else if (!strcasecmp(u,"k")) {
+        mul = 1000;
+    } else if (!strcasecmp(u,"kb")) {
+        mul = 1024;
+    } else if (!strcasecmp(u,"m")) {
+        mul = 1000*1000;
+    } else if (!strcasecmp(u,"mb")) {
+        mul = 1024*1024;
+    } else if (!strcasecmp(u,"g")) {
+        mul = 1000L*1000*1000;
+    } else if (!strcasecmp(u,"gb")) {
+        mul = 1024L*1024*1024;
+    } else {
+        if (err) *err = 1;
+        return 0;
+    }
+
+    /* Copy the digits into a buffer, we'll use strtoll() to convert
+     * the digit (without the unit) into a number. */
+    digits = u-p;
+    if (digits >= sizeof(buf)) {
+        if (err) *err = 1;
+        return 0;
+    }
+    memcpy(buf,p,digits);
+    buf[digits] = '\0';
+
+    char *endptr;
+    errno = 0;
+    val = strtoll(buf,&endptr,10);
+    if ((val == 0 && errno == EINVAL) || *endptr != '\0') {
+        if (err) *err = 1;
+        return 0;
+    }
+    return val*mul;
+}
+
+/* Search a memory buffer for any set of bytes, like strpbrk().
+ * Returns pointer to first found char or NULL.
+ */
+const char *mempbrk(const char *s, size_t len, const char *chars, size_t charslen) {
+    for (size_t j = 0; j < len; j++) {
+        for (size_t n = 0; n < charslen; n++)
+            if (s[j] == chars[n]) return &s[j];
+    }
+
+    return NULL;
+}
+
+/* Modify the buffer replacing all occurrences of chars from the 'from'
+ * set with the corresponding char in the 'to' set. Always returns s.
+ */
+char *memmapchars(char *s, size_t len, const char *from, const char *to, size_t setlen) {
+    for (size_t j = 0; j < len; j++) {
+        for (size_t i = 0; i < setlen; i++) {
+            if (s[j] == from[i]) {
+                s[j] = to[i];
+                break;
+            }
+        }
+    }
+    return s;
+}
+
+/* Return the number of digits of 'v' when converted to string in radix 10.
+ * See ll2string() for more information. */
+uint32_t digits10(uint64_t v) {
+    if (v < 10) return 1;
+    if (v < 100) return 2;
+    if (v < 1000) return 3;
+    if (v < 1000000000000UL) {
+        if (v < 100000000UL) {
+            if (v < 1000000) {
+                if (v < 10000) return 4;
+                return 5 + (v >= 100000);
+            }
+            return 7 + (v >= 10000000UL);
+        }
+        if (v < 10000000000UL) {
+            return 9 + (v >= 1000000000UL);
+        }
+        return 11 + (v >= 100000000000UL);
+    }
+    return 12 + digits10(v / 1000000000000UL);
+}
+
+/* Like digits10() but for signed values. */
+uint32_t sdigits10(int64_t v) {
+    if (v < 0) {
+        /* Abs value of LLONG_MIN requires special handling. */
+        uint64_t uv = (v != LLONG_MIN) ?
+                      (uint64_t)-v : ((uint64_t) LLONG_MAX)+1;
+        return digits10(uv)+1; /* +1 for the minus. */
+    } else {
+        return digits10(v);
+    }
+}
+
+/* Convert a long long into a string. Returns the number of
+ * characters needed to represent the number.
+ * If the buffer is not big enough to store the string, 0 is returned.
+ *
+ * Based on the following article (that apparently does not provide a
+ * novel approach but only publicizes an already used technique):
+ *
+ * https://www.facebook.com/notes/facebook-engineering/three-optimization-tips-for-c/10151361643253920
+ *
+ * Modified in order to handle signed integers since the original code was
+ * designed for unsigned integers. */
+int ll2string(char *dst, size_t dstlen, long long svalue) {
+    static const char digits[201] =
+        "0001020304050607080910111213141516171819"
+        "2021222324252627282930313233343536373839"
+        "4041424344454647484950515253545556575859"
+        "6061626364656667686970717273747576777879"
+        "8081828384858687888990919293949596979899";
+    int negative;
+    unsigned long long value;
+
+    /* The main loop works with 64bit unsigned integers for simplicity, so
+     * we convert the number here and remember if it is negative. */
+    if (svalue < 0) {
+        if (svalue != LLONG_MIN) {
+            value = -svalue;
+        } else {
+            value = ((unsigned long long) LLONG_MAX)+1;
+        }
+        negative = 1;
+    } else {
+        value = svalue;
+        negative = 0;
+    }
+
+    /* Check length. */
+    uint32_t const length = digits10(value)+negative;
+    if (length >= dstlen) return 0;
+
+    /* Null term. */
+    uint32_t next = length;
+    dst[next] = '\0';
+    next--;
+    while (value >= 100) {
+        int const i = (value % 100) * 2;
+        value /= 100;
+        dst[next] = digits[i + 1];
+        dst[next - 1] = digits[i];
+        next -= 2;
+    }
+
+    /* Handle last 1-2 digits. */
+    if (value < 10) {
+        dst[next] = '0' + (uint32_t) value;
+    } else {
+        int i = (uint32_t) value * 2;
+        dst[next] = digits[i + 1];
+        dst[next - 1] = digits[i];
+    }
+
+    /* Add sign. */
+    if (negative) dst[0] = '-';
+    return length;
+}
+
+/* Convert a string into a long long. Returns 1 if the string could be parsed
+ * into a (non-overflowing) long long, 0 otherwise. The value will be set to
+ * the parsed value when appropriate.
+ *
+ * Note that this function demands that the string strictly represents
+ * a long long: no spaces or other characters before or after the string
+ * representing the number are accepted, nor zeroes at the start if not
+ * for the string "0" representing the zero number.
+ *
+ * Because of its strictness, it is safe to use this function to check if
+ * you can convert a string into a long long, and obtain back the string
+ * from the number without any loss in the string representation. */
+int string2ll(const char *s, size_t slen, long long *value) {
+    const char *p = s;
+    size_t plen = 0;
+    int negative = 0;
+    unsigned long long v;
+
+    /* A zero length string is not a valid number. */
+    if (plen == slen)
+        return 0;
+
+    /* Special case: first and only digit is 0. */
+    if (slen == 1 && p[0] == '0') {
+        if (value != NULL) *value = 0;
+        return 1;
+    }
+
+    /* Handle negative numbers: just set a flag and continue like if it
+     * was a positive number. Later convert into negative. */
+    if (p[0] == '-') {
+        negative = 1;
+        p++; plen++;
+
+        /* Abort on only a negative sign. */
+        if (plen == slen)
+            return 0;
+    }
+
+    /* First digit should be 1-9, otherwise the string should just be 0. */
+    if (p[0] >= '1' && p[0] <= '9') {
+        v = p[0]-'0';
+        p++; plen++;
+    } else {
+        return 0;
+    }
+
+    /* Parse all the other digits, checking for overflow at every step. */
+    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
+        if (v > (ULLONG_MAX / 10)) /* Overflow. */
+            return 0;
+        v *= 10;
+
+        if (v > (ULLONG_MAX - (p[0]-'0'))) /* Overflow. */
+            return 0;
+        v += p[0]-'0';
+
+        p++; plen++;
+    }
+
+    /* Return if not all bytes were used. */
+    if (plen < slen)
+        return 0;
+
+    /* Convert to negative if needed, and do the final overflow check when
+     * converting from unsigned long long to long long. */
+    if (negative) {
+        if (v > ((unsigned long long)(-(LLONG_MIN+1))+1)) /* Overflow. */
+            return 0;
+        if (value != NULL) *value = -v;
+    } else {
+        if (v > LLONG_MAX) /* Overflow. */
+            return 0;
+        if (value != NULL) *value = v;
+    }
+    return 1;
+}
+
+/* Helper function to convert a string to an unsigned long long value.
+ * The function attempts to use the faster string2ll() function inside
+ * Redis: if it fails, strtoull() is used instead. The function returns
+ * 1 if the conversion happened successfully or 0 if the number is
+ * invalid or out of range. */
+int string2ull(const char *s, unsigned long long *value) {
+    long long ll;
+    if (string2ll(s,strlen(s),&ll)) {
+        if (ll < 0) return 0; /* Negative values are out of range. */
+        *value = ll;
+        return 1;
+    }
+    errno = 0;
+    char *endptr = NULL;
+    *value = strtoull(s,&endptr,10);
+    if (errno == EINVAL || errno == ERANGE || !(*s != '\0' && *endptr == '\0'))
+        return 0; /* strtoull() failed. */
+    return 1; /* Conversion done! */
+}
+
+/* Convert a string into a long. Returns 1 if the string could be parsed into a
+ * (non-overflowing) long, 0 otherwise. The value will be set to the parsed
+ * value when appropriate. */
+int string2l(const char *s, size_t slen, long *lval) {
+    long long llval;
+
+    if (!string2ll(s,slen,&llval))
+        return 0;
+
+    if (llval < LONG_MIN || llval > LONG_MAX)
+        return 0;
+
+    *lval = (long)llval;
+    return 1;
+}
+
+/* Convert a string into a double. Returns 1 if the string could be parsed
+ * into a (non-overflowing) double, 0 otherwise. The value will be set to
+ * the parsed value when appropriate.
+ *
+ * Note that this function demands that the string strictly represents
+ * a double: no spaces or other characters before or after the string
+ * representing the number are accepted. */
+int string2ld(const char *s, size_t slen, long double *dp) {
+    char buf[MAX_LONG_DOUBLE_CHARS];
+    long double value;
+    char *eptr;
+
+    if (slen == 0 || slen >= sizeof(buf)) return 0;
+    memcpy(buf,s,slen);
+    buf[slen] = '\0';
+
+    errno = 0;
+    value = strtold(buf, &eptr);
+    if (isspace(buf[0]) || eptr[0] != '\0' ||
+        (size_t)(eptr-buf) != slen ||
+        (errno == ERANGE &&
+            (value == HUGE_VAL || value == -HUGE_VAL || value == 0)) ||
+        errno == EINVAL ||
+        isnan(value))
+        return 0;
+
+    if (dp) *dp = value;
+    return 1;
+}
+
+/* Convert a string into a double. Returns 1 if the string could be parsed
+ * into a (non-overflowing) double, 0 otherwise. The value will be set to
+ * the parsed value when appropriate.
+ *
+ * Note that this function demands that the string strictly represents
+ * a double: no spaces or other characters before or after the string
+ * representing the number are accepted. */
+int string2d(const char *s, size_t slen, double *dp) {
+    errno = 0;
+    char *eptr;
+    *dp = strtod(s, &eptr);
+    if (slen == 0 ||
+        isspace(((const char*)s)[0]) ||
+        (size_t)(eptr-(char*)s) != slen ||
+        (errno == ERANGE &&
+            (*dp == HUGE_VAL || *dp == -HUGE_VAL || *dp == 0)) ||
+        isnan(*dp))
+        return 0;
+    return 1;
+}
+
+/* Convert a double to a string representation. Returns the number of bytes
+ * required. The representation should always be parsable by strtod(3).
+ * This function does not support human-friendly formatting like ld2string
+ * does. It is intended mainly to be used inside t_zset.c when writing scores
+ * into a ziplist representing a sorted set. */
+int d2string(char *buf, size_t len, double value) {
+    if (isnan(value)) {
+        len = snprintf(buf,len,"nan");
+    } else if (isinf(value)) {
+        if (value < 0)
+            len = snprintf(buf,len,"-inf");
+        else
+            len = snprintf(buf,len,"inf");
+    } else if (value == 0) {
+        /* See: http://en.wikipedia.org/wiki/Signed_zero, "Comparisons". */
+        if (1.0/value < 0)
+            len = snprintf(buf,len,"-0");
+        else
+            len = snprintf(buf,len,"0");
+    } else {
+#if (DBL_MANT_DIG >= 52) && (LLONG_MAX == 0x7fffffffffffffffLL)
+        /* Check if the float is in a safe range to be casted into a
+         * long long. We are assuming that long long is 64 bit here.
+         * Also we are assuming that there are no implementations around where
+         * double has precision < 52 bit.
+         *
+         * Under this assumptions we test if a double is inside an interval
+         * where casting to long long is safe. Then using two castings we
+         * make sure the decimal part is zero. If all this is true we use
+         * integer printing function that is much faster. */
+        double min = -4503599627370495; /* (2^52)-1 */
+        double max = 4503599627370496; /* -(2^52) */
+        if (value > min && value < max && value == ((double)((long long)value)))
+            len = ll2string(buf,len,(long long)value);
+        else
+#endif
+            len = snprintf(buf,len,"%.17g",value);
+    }
+
+    return len;
+}
+
+/* Create a string object from a long double.
+ * If mode is humanfriendly it does not use exponential format and trims trailing
+ * zeroes at the end (may result in loss of precision).
+ * If mode is default exp format is used and the output of snprintf()
+ * is not modified (may result in loss of precision).
+ * If mode is hex hexadecimal format is used (no loss of precision)
+ *
+ * The function returns the length of the string or zero if there was not
+ * enough buffer room to store it. */
+int ld2string(char *buf, size_t len, long double value, ld2string_mode mode) {
+    size_t l = 0;
+
+    if (isinf(value)) {
+        /* Libc in odd systems (Hi Solaris!) will format infinite in a
+         * different way, so better to handle it in an explicit way. */
+        if (len < 5) return 0; /* No room. 5 is "-inf\0" */
+        if (value > 0) {
+            memcpy(buf,"inf",3);
+            l = 3;
+        } else {
+            memcpy(buf,"-inf",4);
+            l = 4;
+        }
+    } else {
+        switch (mode) {
+        case LD_STR_AUTO:
+            l = snprintf(buf,len,"%.17Lg",value);
+            if (l+1 > len) return 0; /* No room. */
+            break;
+        case LD_STR_HEX:
+            l = snprintf(buf,len,"%La",value);
+            if (l+1 > len) return 0; /* No room. */
+            break;
+        case LD_STR_HUMAN:
+            /* We use 17 digits precision since with 128 bit floats that precision
+             * after rounding is able to represent most small decimal numbers in a
+             * way that is "non surprising" for the user (that is, most small
+             * decimal numbers will be represented in a way that when converted
+             * back into a string are exactly the same as what the user typed.) */
+            l = snprintf(buf,len,"%.17Lf",value);
+            if (l+1 > len) return 0; /* No room. */
+            /* Now remove trailing zeroes after the '.' */
+            if (strchr(buf,'.') != NULL) {
+                char *p = buf+l-1;
+                while(*p == '0') {
+                    p--;
+                    l--;
+                }
+                if (*p == '.') l--;
+            }
+            if (l == 2 && buf[0] == '-' && buf[1] == '0') {
+                buf[0] = '0';
+                l = 1;
+            }
+            break;
+        default: return 0; /* Invalid mode. */
+        }
+    }
+    buf[l] = '\0';
+    return l;
+}
+
+/* Get random bytes, attempts to get an initial seed from /dev/urandom and
+ * the uses a one way hash function in counter mode to generate a random
+ * stream. However if /dev/urandom is not available, a weaker seed is used.
+ *
+ * This function is not thread safe, since the state is global. */
+void getRandomBytes(unsigned char *p, size_t len) {
+    /* Global state. */
+    static int seed_initialized = 0;
+    static unsigned char seed[64]; /* 512 bit internal block size. */
+    static uint64_t counter = 0; /* The counter we hash with the seed. */
+
+    if (!seed_initialized) {
+        /* Initialize a seed and use SHA1 in counter mode, where we hash
+         * the same seed with a progressive counter. For the goals of this
+         * function we just need non-colliding strings, there are no
+         * cryptographic security needs. */
+        FILE *fp = fopen("/dev/urandom","r");
+        if (fp == NULL || fread(seed,sizeof(seed),1,fp) != 1) {
+            /* Revert to a weaker seed, and in this case reseed again
+             * at every call.*/
+            for (unsigned int j = 0; j < sizeof(seed); j++) {
+                struct timeval tv;
+                gettimeofday(&tv,NULL);
+                pid_t pid = getpid();
+                seed[j] = tv.tv_sec ^ tv.tv_usec ^ pid ^ (long)fp;
+            }
+        } else {
+            seed_initialized = 1;
+        }
+        if (fp) fclose(fp);
+    }
+
+    while(len) {
+        /* This implements SHA256-HMAC. */
+        unsigned char digest[SHA256_BLOCK_SIZE];
+        unsigned char kxor[64];
+        unsigned int copylen =
+            len > SHA256_BLOCK_SIZE ? SHA256_BLOCK_SIZE : len;
+
+        /* IKEY: key xored with 0x36. */
+        memcpy(kxor,seed,sizeof(kxor));
+        for (unsigned int i = 0; i < sizeof(kxor); i++) kxor[i] ^= 0x36;
+
+        /* Obtain HASH(IKEY||MESSAGE). */
+        SHA256_CTX ctx;
+        sha256_init(&ctx);
+        sha256_update(&ctx,kxor,sizeof(kxor));
+        sha256_update(&ctx,(unsigned char*)&counter,sizeof(counter));
+        sha256_final(&ctx,digest);
+
+        /* OKEY: key xored with 0x5c. */
+        memcpy(kxor,seed,sizeof(kxor));
+        for (unsigned int i = 0; i < sizeof(kxor); i++) kxor[i] ^= 0x5C;
+
+        /* Obtain HASH(OKEY || HASH(IKEY||MESSAGE)). */
+        sha256_init(&ctx);
+        sha256_update(&ctx,kxor,sizeof(kxor));
+        sha256_update(&ctx,digest,SHA256_BLOCK_SIZE);
+        sha256_final(&ctx,digest);
+
+        /* Increment the counter for the next iteration. */
+        counter++;
+
+        memcpy(p,digest,copylen);
+        len -= copylen;
+        p += copylen;
+    }
+}
+
+/* Generate the Redis "Run ID", a SHA1-sized random number that identifies a
+ * given execution of Redis, so that if you are talking with an instance
+ * having run_id == A, and you reconnect and it has run_id == B, you can be
+ * sure that it is either a different instance or it was restarted. */
+void getRandomHexChars(char *p, size_t len) {
+    char *charset = "0123456789abcdef";
+    size_t j;
+
+    getRandomBytes((unsigned char*)p,len);
+    for (j = 0; j < len; j++) p[j] = charset[p[j] & 0x0F];
+}
+
+/* Given the filename, return the absolute path as an SDS string, or NULL
+ * if it fails for some reason. Note that "filename" may be an absolute path
+ * already, this will be detected and handled correctly.
+ *
+ * The function does not try to normalize everything, but only the obvious
+ * case of one or more "../" appearing at the start of "filename"
+ * relative path. */
+sds getAbsolutePath(char *filename) {
+    char cwd[1024];
+    sds abspath;
+    sds relpath = sdsnew(filename);
+
+    relpath = sdstrim(relpath," \r\n\t");
+    if (relpath[0] == '/') return relpath; /* Path is already absolute. */
+
+    /* If path is relative, join cwd and relative path. */
+    if (getcwd(cwd,sizeof(cwd)) == NULL) {
+        sdsfree(relpath);
+        return NULL;
+    }
+    abspath = sdsnew(cwd);
+    if (sdslen(abspath) && abspath[sdslen(abspath)-1] != '/')
+        abspath = sdscat(abspath,"/");
+
+    /* At this point we have the current path always ending with "/", and
+     * the trimmed relative path. Try to normalize the obvious case of
+     * trailing ../ elements at the start of the path.
+     *
+     * For every "../" we find in the filename, we remove it and also remove
+     * the last element of the cwd, unless the current cwd is "/". */
+    while (sdslen(relpath) >= 3 &&
+           relpath[0] == '.' && relpath[1] == '.' && relpath[2] == '/')
+    {
+        sdsrange(relpath,3,-1);
+        if (sdslen(abspath) > 1) {
+            char *p = abspath + sdslen(abspath)-2;
+            int trimlen = 1;
+
+            while(*p != '/') {
+                p--;
+                trimlen++;
+            }
+            sdsrange(abspath,0,-(trimlen+1));
+        }
+    }
+
+    /* Finally glue the two parts together. */
+    abspath = sdscatsds(abspath,relpath);
+    sdsfree(relpath);
+    return abspath;
+}
+
+/*
+ * Gets the proper timezone in a more portable fashion
+ * i.e timezone variables are linux specific.
+ */
+long getTimeZone(void) {
+#if defined(__linux__) || defined(__sun)
+    return timezone;
+#else
+    struct timeval tv;
+    struct timezone tz;
+
+    gettimeofday(&tv, &tz);
+
+    return tz.tz_minuteswest * 60L;
+#endif
+}
+
+/* Return true if the specified path is just a file basename without any
+ * relative or absolute path. This function just checks that no / or \
+ * character exists inside the specified path, that's enough in the
+ * environments where Redis runs. */
+int pathIsBaseName(char *path) {
+    return strchr(path,'/') == NULL && strchr(path,'\\') == NULL;
+}
+
+#ifdef REDIS_TEST
+#include <assert.h>
+
+static void test_string2ll(void) {
+    char buf[32];
+    long long v;
+
+    /* May not start with +. */
+    strcpy(buf,"+1");
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+
+    /* Leading space. */
+    strcpy(buf," 1");
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+
+    /* Trailing space. */
+    strcpy(buf,"1 ");
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+
+    /* May not start with 0. */
+    strcpy(buf,"01");
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+
+    strcpy(buf,"-1");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == -1);
+
+    strcpy(buf,"0");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == 0);
+
+    strcpy(buf,"1");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == 1);
+
+    strcpy(buf,"99");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == 99);
+
+    strcpy(buf,"-99");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == -99);
+
+    strcpy(buf,"-9223372036854775808");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == LLONG_MIN);
+
+    strcpy(buf,"-9223372036854775809"); /* overflow */
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+
+    strcpy(buf,"9223372036854775807");
+    assert(string2ll(buf,strlen(buf),&v) == 1);
+    assert(v == LLONG_MAX);
+
+    strcpy(buf,"9223372036854775808"); /* overflow */
+    assert(string2ll(buf,strlen(buf),&v) == 0);
+}
+
+static void test_string2l(void) {
+    char buf[32];
+    long v;
+
+    /* May not start with +. */
+    strcpy(buf,"+1");
+    assert(string2l(buf,strlen(buf),&v) == 0);
+
+    /* May not start with 0. */
+    strcpy(buf,"01");
+    assert(string2l(buf,strlen(buf),&v) == 0);
+
+    strcpy(buf,"-1");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == -1);
+
+    strcpy(buf,"0");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == 0);
+
+    strcpy(buf,"1");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == 1);
+
+    strcpy(buf,"99");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == 99);
+
+    strcpy(buf,"-99");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == -99);
+
+#if LONG_MAX != LLONG_MAX
+    strcpy(buf,"-2147483648");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == LONG_MIN);
+
+    strcpy(buf,"-2147483649"); /* overflow */
+    assert(string2l(buf,strlen(buf),&v) == 0);
+
+    strcpy(buf,"2147483647");
+    assert(string2l(buf,strlen(buf),&v) == 1);
+    assert(v == LONG_MAX);
+
+    strcpy(buf,"2147483648"); /* overflow */
+    assert(string2l(buf,strlen(buf),&v) == 0);
+#endif
+}
+
+static void test_ll2string(void) {
+    char buf[32];
+    long long v;
+    int sz;
+
+    v = 0;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 1);
+    assert(!strcmp(buf, "0"));
+
+    v = -1;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 2);
+    assert(!strcmp(buf, "-1"));
+
+    v = 99;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 2);
+    assert(!strcmp(buf, "99"));
+
+    v = -99;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 3);
+    assert(!strcmp(buf, "-99"));
+
+    v = -2147483648;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 11);
+    assert(!strcmp(buf, "-2147483648"));
+
+    v = LLONG_MIN;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 20);
+    assert(!strcmp(buf, "-9223372036854775808"));
+
+    v = LLONG_MAX;
+    sz = ll2string(buf, sizeof buf, v);
+    assert(sz == 19);
+    assert(!strcmp(buf, "9223372036854775807"));
+}
+
+#define UNUSED(x) (void)(x)
+int utilTest(int argc, char **argv, int accurate) {
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    test_string2ll();
+    test_string2l();
+    test_ll2string();
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/util.h b/redis-stable/src/util.h
new file mode 100644
index 00000000..3bf8907c
--- /dev/null
+++ b/redis-stable/src/util.h
@@ -0,0 +1,72 @@
+/*
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __REDIS_UTIL_H
+#define __REDIS_UTIL_H
+
+#include <stdint.h>
+#include "sds.h"
+
+/* The maximum number of characters needed to represent a long double
+ * as a string (long double has a huge range).
+ * This should be the size of the buffer given to ld2string */
+#define MAX_LONG_DOUBLE_CHARS 5*1024
+
+/* long double to string convertion options */
+typedef enum {
+    LD_STR_AUTO,     /* %.17Lg */
+    LD_STR_HUMAN,    /* %.17Lf + Trimming of trailing zeros */
+    LD_STR_HEX       /* %La */
+} ld2string_mode;
+
+int stringmatchlen(const char *p, int plen, const char *s, int slen, int nocase);
+int stringmatch(const char *p, const char *s, int nocase);
+int stringmatchlen_fuzz_test(void);
+long long memtoll(const char *p, int *err);
+const char *mempbrk(const char *s, size_t len, const char *chars, size_t charslen);
+char *memmapchars(char *s, size_t len, const char *from, const char *to, size_t setlen);
+uint32_t digits10(uint64_t v);
+uint32_t sdigits10(int64_t v);
+int ll2string(char *s, size_t len, long long value);
+int string2ll(const char *s, size_t slen, long long *value);
+int string2ull(const char *s, unsigned long long *value);
+int string2l(const char *s, size_t slen, long *value);
+int string2ld(const char *s, size_t slen, long double *dp);
+int string2d(const char *s, size_t slen, double *dp);
+int d2string(char *buf, size_t len, double value);
+int ld2string(char *buf, size_t len, long double value, ld2string_mode mode);
+sds getAbsolutePath(char *filename);
+long getTimeZone(void);
+int pathIsBaseName(char *path);
+
+#ifdef REDIS_TEST
+int utilTest(int argc, char **argv, int accurate);
+#endif
+
+#endif
diff --git a/redis-stable/src/valgrind.sup b/redis-stable/src/valgrind.sup
new file mode 100644
index 00000000..5d6367e3
--- /dev/null
+++ b/redis-stable/src/valgrind.sup
@@ -0,0 +1,26 @@
+{
+   <lzf_uninitialized_hash_table>
+   Memcheck:Cond
+   fun:lzf_compress
+}
+
+{
+   <lzf_uninitialized_hash_table>
+   Memcheck:Value4
+   fun:lzf_compress
+}
+
+{
+   <lzf_uninitialized_hash_table>
+   Memcheck:Value8
+   fun:lzf_compress
+}
+
+{
+   <negative size allocatoin, see integration/corrupt-dump>
+   Memcheck:FishyValue
+   malloc(size)
+   fun:malloc
+   fun:ztrymalloc_usable
+   fun:ztrymalloc
+}
diff --git a/redis-stable/src/version.h b/redis-stable/src/version.h
new file mode 100644
index 00000000..e07d557e
--- /dev/null
+++ b/redis-stable/src/version.h
@@ -0,0 +1,2 @@
+#define REDIS_VERSION "6.2.6"
+#define REDIS_VERSION_NUM 0x00060206
diff --git a/redis-stable/src/ziplist.c b/redis-stable/src/ziplist.c
new file mode 100644
index 00000000..b3b27ce3
--- /dev/null
+++ b/redis-stable/src/ziplist.c
@@ -0,0 +1,2582 @@
+/* The ziplist is a specially encoded dually linked list that is designed
+ * to be very memory efficient. It stores both strings and integer values,
+ * where integers are encoded as actual integers instead of a series of
+ * characters. It allows push and pop operations on either side of the list
+ * in O(1) time. However, because every operation requires a reallocation of
+ * the memory used by the ziplist, the actual complexity is related to the
+ * amount of memory used by the ziplist.
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * ZIPLIST OVERALL LAYOUT
+ * ======================
+ *
+ * The general layout of the ziplist is as follows:
+ *
+ * <zlbytes> <zltail> <zllen> <entry> <entry> ... <entry> <zlend>
+ *
+ * NOTE: all fields are stored in little endian, if not specified otherwise.
+ *
+ * <uint32_t zlbytes> is an unsigned integer to hold the number of bytes that
+ * the ziplist occupies, including the four bytes of the zlbytes field itself.
+ * This value needs to be stored to be able to resize the entire structure
+ * without the need to traverse it first.
+ *
+ * <uint32_t zltail> is the offset to the last entry in the list. This allows
+ * a pop operation on the far side of the list without the need for full
+ * traversal.
+ *
+ * <uint16_t zllen> is the number of entries. When there are more than
+ * 2^16-2 entries, this value is set to 2^16-1 and we need to traverse the
+ * entire list to know how many items it holds.
+ *
+ * <uint8_t zlend> is a special entry representing the end of the ziplist.
+ * Is encoded as a single byte equal to 255. No other normal entry starts
+ * with a byte set to the value of 255.
+ *
+ * ZIPLIST ENTRIES
+ * ===============
+ *
+ * Every entry in the ziplist is prefixed by metadata that contains two pieces
+ * of information. First, the length of the previous entry is stored to be
+ * able to traverse the list from back to front. Second, the entry encoding is
+ * provided. It represents the entry type, integer or string, and in the case
+ * of strings it also represents the length of the string payload.
+ * So a complete entry is stored like this:
+ *
+ * <prevlen> <encoding> <entry-data>
+ *
+ * Sometimes the encoding represents the entry itself, like for small integers
+ * as we'll see later. In such a case the <entry-data> part is missing, and we
+ * could have just:
+ *
+ * <prevlen> <encoding>
+ *
+ * The length of the previous entry, <prevlen>, is encoded in the following way:
+ * If this length is smaller than 254 bytes, it will only consume a single
+ * byte representing the length as an unsinged 8 bit integer. When the length
+ * is greater than or equal to 254, it will consume 5 bytes. The first byte is
+ * set to 254 (FE) to indicate a larger value is following. The remaining 4
+ * bytes take the length of the previous entry as value.
+ *
+ * So practically an entry is encoded in the following way:
+ *
+ * <prevlen from 0 to 253> <encoding> <entry>
+ *
+ * Or alternatively if the previous entry length is greater than 253 bytes
+ * the following encoding is used:
+ *
+ * 0xFE <4 bytes unsigned little endian prevlen> <encoding> <entry>
+ *
+ * The encoding field of the entry depends on the content of the
+ * entry. When the entry is a string, the first 2 bits of the encoding first
+ * byte will hold the type of encoding used to store the length of the string,
+ * followed by the actual length of the string. When the entry is an integer
+ * the first 2 bits are both set to 1. The following 2 bits are used to specify
+ * what kind of integer will be stored after this header. An overview of the
+ * different types and encodings is as follows. The first byte is always enough
+ * to determine the kind of entry.
+ *
+ * |00pppppp| - 1 byte
+ *      String value with length less than or equal to 63 bytes (6 bits).
+ *      "pppppp" represents the unsigned 6 bit length.
+ * |01pppppp|qqqqqqqq| - 2 bytes
+ *      String value with length less than or equal to 16383 bytes (14 bits).
+ *      IMPORTANT: The 14 bit number is stored in big endian.
+ * |10000000|qqqqqqqq|rrrrrrrr|ssssssss|tttttttt| - 5 bytes
+ *      String value with length greater than or equal to 16384 bytes.
+ *      Only the 4 bytes following the first byte represents the length
+ *      up to 2^32-1. The 6 lower bits of the first byte are not used and
+ *      are set to zero.
+ *      IMPORTANT: The 32 bit number is stored in big endian.
+ * |11000000| - 3 bytes
+ *      Integer encoded as int16_t (2 bytes).
+ * |11010000| - 5 bytes
+ *      Integer encoded as int32_t (4 bytes).
+ * |11100000| - 9 bytes
+ *      Integer encoded as int64_t (8 bytes).
+ * |11110000| - 4 bytes
+ *      Integer encoded as 24 bit signed (3 bytes).
+ * |11111110| - 2 bytes
+ *      Integer encoded as 8 bit signed (1 byte).
+ * |1111xxxx| - (with xxxx between 0001 and 1101) immediate 4 bit integer.
+ *      Unsigned integer from 0 to 12. The encoded value is actually from
+ *      1 to 13 because 0000 and 1111 can not be used, so 1 should be
+ *      subtracted from the encoded 4 bit value to obtain the right value.
+ * |11111111| - End of ziplist special entry.
+ *
+ * Like for the ziplist header, all the integers are represented in little
+ * endian byte order, even when this code is compiled in big endian systems.
+ *
+ * EXAMPLES OF ACTUAL ZIPLISTS
+ * ===========================
+ *
+ * The following is a ziplist containing the two elements representing
+ * the strings "2" and "5". It is composed of 15 bytes, that we visually
+ * split into sections:
+ *
+ *  [0f 00 00 00] [0c 00 00 00] [02 00] [00 f3] [02 f6] [ff]
+ *        |             |          |       |       |     |
+ *     zlbytes        zltail    entries   "2"     "5"   end
+ *
+ * The first 4 bytes represent the number 15, that is the number of bytes
+ * the whole ziplist is composed of. The second 4 bytes are the offset
+ * at which the last ziplist entry is found, that is 12, in fact the
+ * last entry, that is "5", is at offset 12 inside the ziplist.
+ * The next 16 bit integer represents the number of elements inside the
+ * ziplist, its value is 2 since there are just two elements inside.
+ * Finally "00 f3" is the first entry representing the number 2. It is
+ * composed of the previous entry length, which is zero because this is
+ * our first entry, and the byte F3 which corresponds to the encoding
+ * |1111xxxx| with xxxx between 0001 and 1101. We need to remove the "F"
+ * higher order bits 1111, and subtract 1 from the "3", so the entry value
+ * is "2". The next entry has a prevlen of 02, since the first entry is
+ * composed of exactly two bytes. The entry itself, F6, is encoded exactly
+ * like the first entry, and 6-1 = 5, so the value of the entry is 5.
+ * Finally the special entry FF signals the end of the ziplist.
+ *
+ * Adding another element to the above string with the value "Hello World"
+ * allows us to show how the ziplist encodes small strings. We'll just show
+ * the hex dump of the entry itself. Imagine the bytes as following the
+ * entry that stores "5" in the ziplist above:
+ *
+ * [02] [0b] [48 65 6c 6c 6f 20 57 6f 72 6c 64]
+ *
+ * The first byte, 02, is the length of the previous entry. The next
+ * byte represents the encoding in the pattern |00pppppp| that means
+ * that the entry is a string of length <pppppp>, so 0B means that
+ * an 11 bytes string follows. From the third byte (48) to the last (64)
+ * there are just the ASCII characters for "Hello World".
+ *
+ * ----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2017, Salvatore Sanfilippo <antirez at gmail dot com>
+ * Copyright (c) 2020, Redis Labs, Inc
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <stdint.h>
+#include <limits.h>
+#include "zmalloc.h"
+#include "util.h"
+#include "ziplist.h"
+#include "config.h"
+#include "endianconv.h"
+#include "redisassert.h"
+
+#define ZIP_END 255         /* Special "end of ziplist" entry. */
+#define ZIP_BIG_PREVLEN 254 /* ZIP_BIG_PREVLEN - 1 is the max number of bytes of
+                               the previous entry, for the "prevlen" field prefixing
+                               each entry, to be represented with just a single byte.
+                               Otherwise it is represented as FE AA BB CC DD, where
+                               AA BB CC DD are a 4 bytes unsigned integer
+                               representing the previous entry len. */
+
+/* Different encoding/length possibilities */
+#define ZIP_STR_MASK 0xc0
+#define ZIP_INT_MASK 0x30
+#define ZIP_STR_06B (0 << 6)
+#define ZIP_STR_14B (1 << 6)
+#define ZIP_STR_32B (2 << 6)
+#define ZIP_INT_16B (0xc0 | 0<<4)
+#define ZIP_INT_32B (0xc0 | 1<<4)
+#define ZIP_INT_64B (0xc0 | 2<<4)
+#define ZIP_INT_24B (0xc0 | 3<<4)
+#define ZIP_INT_8B 0xfe
+
+/* 4 bit integer immediate encoding |1111xxxx| with xxxx between
+ * 0001 and 1101. */
+#define ZIP_INT_IMM_MASK 0x0f   /* Mask to extract the 4 bits value. To add
+                                   one is needed to reconstruct the value. */
+#define ZIP_INT_IMM_MIN 0xf1    /* 11110001 */
+#define ZIP_INT_IMM_MAX 0xfd    /* 11111101 */
+
+#define INT24_MAX 0x7fffff
+#define INT24_MIN (-INT24_MAX - 1)
+
+/* Macro to determine if the entry is a string. String entries never start
+ * with "11" as most significant bits of the first byte. */
+#define ZIP_IS_STR(enc) (((enc) & ZIP_STR_MASK) < ZIP_STR_MASK)
+
+/* Utility macros.*/
+
+/* Return total bytes a ziplist is composed of. */
+#define ZIPLIST_BYTES(zl)       (*((uint32_t*)(zl)))
+
+/* Return the offset of the last item inside the ziplist. */
+#define ZIPLIST_TAIL_OFFSET(zl) (*((uint32_t*)((zl)+sizeof(uint32_t))))
+
+/* Return the length of a ziplist, or UINT16_MAX if the length cannot be
+ * determined without scanning the whole ziplist. */
+#define ZIPLIST_LENGTH(zl)      (*((uint16_t*)((zl)+sizeof(uint32_t)*2)))
+
+/* The size of a ziplist header: two 32 bit integers for the total
+ * bytes count and last item offset. One 16 bit integer for the number
+ * of items field. */
+#define ZIPLIST_HEADER_SIZE     (sizeof(uint32_t)*2+sizeof(uint16_t))
+
+/* Size of the "end of ziplist" entry. Just one byte. */
+#define ZIPLIST_END_SIZE        (sizeof(uint8_t))
+
+/* Return the pointer to the first entry of a ziplist. */
+#define ZIPLIST_ENTRY_HEAD(zl)  ((zl)+ZIPLIST_HEADER_SIZE)
+
+/* Return the pointer to the last entry of a ziplist, using the
+ * last entry offset inside the ziplist header. */
+#define ZIPLIST_ENTRY_TAIL(zl)  ((zl)+intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)))
+
+/* Return the pointer to the last byte of a ziplist, which is, the
+ * end of ziplist FF entry. */
+#define ZIPLIST_ENTRY_END(zl)   ((zl)+intrev32ifbe(ZIPLIST_BYTES(zl))-1)
+
+/* Increment the number of items field in the ziplist header. Note that this
+ * macro should never overflow the unsigned 16 bit integer, since entries are
+ * always pushed one at a time. When UINT16_MAX is reached we want the count
+ * to stay there to signal that a full scan is needed to get the number of
+ * items inside the ziplist. */
+#define ZIPLIST_INCR_LENGTH(zl,incr) { \
+    if (intrev16ifbe(ZIPLIST_LENGTH(zl)) < UINT16_MAX) \
+        ZIPLIST_LENGTH(zl) = intrev16ifbe(intrev16ifbe(ZIPLIST_LENGTH(zl))+incr); \
+}
+
+/* Don't let ziplists grow over 1GB in any case, don't wanna risk overflow in
+ * zlbytes*/
+#define ZIPLIST_MAX_SAFETY_SIZE (1<<30)
+int ziplistSafeToAdd(unsigned char* zl, size_t add) {
+    size_t len = zl? ziplistBlobLen(zl): 0;
+    if (len + add > ZIPLIST_MAX_SAFETY_SIZE)
+        return 0;
+    return 1;
+}
+
+
+/* We use this function to receive information about a ziplist entry.
+ * Note that this is not how the data is actually encoded, is just what we
+ * get filled by a function in order to operate more easily. */
+typedef struct zlentry {
+    unsigned int prevrawlensize; /* Bytes used to encode the previous entry len*/
+    unsigned int prevrawlen;     /* Previous entry len. */
+    unsigned int lensize;        /* Bytes used to encode this entry type/len.
+                                    For example strings have a 1, 2 or 5 bytes
+                                    header. Integers always use a single byte.*/
+    unsigned int len;            /* Bytes used to represent the actual entry.
+                                    For strings this is just the string length
+                                    while for integers it is 1, 2, 3, 4, 8 or
+                                    0 (for 4 bit immediate) depending on the
+                                    number range. */
+    unsigned int headersize;     /* prevrawlensize + lensize. */
+    unsigned char encoding;      /* Set to ZIP_STR_* or ZIP_INT_* depending on
+                                    the entry encoding. However for 4 bits
+                                    immediate integers this can assume a range
+                                    of values and must be range-checked. */
+    unsigned char *p;            /* Pointer to the very start of the entry, that
+                                    is, this points to prev-entry-len field. */
+} zlentry;
+
+#define ZIPLIST_ENTRY_ZERO(zle) { \
+    (zle)->prevrawlensize = (zle)->prevrawlen = 0; \
+    (zle)->lensize = (zle)->len = (zle)->headersize = 0; \
+    (zle)->encoding = 0; \
+    (zle)->p = NULL; \
+}
+
+/* Extract the encoding from the byte pointed by 'ptr' and set it into
+ * 'encoding' field of the zlentry structure. */
+#define ZIP_ENTRY_ENCODING(ptr, encoding) do {  \
+    (encoding) = ((ptr)[0]); \
+    if ((encoding) < ZIP_STR_MASK) (encoding) &= ZIP_STR_MASK; \
+} while(0)
+
+#define ZIP_ENCODING_SIZE_INVALID 0xff
+/* Return the number of bytes required to encode the entry type + length.
+ * On error, return ZIP_ENCODING_SIZE_INVALID */
+static inline unsigned int zipEncodingLenSize(unsigned char encoding) {
+    if (encoding == ZIP_INT_16B || encoding == ZIP_INT_32B ||
+        encoding == ZIP_INT_24B || encoding == ZIP_INT_64B ||
+        encoding == ZIP_INT_8B)
+        return 1;
+    if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)
+        return 1;
+    if (encoding == ZIP_STR_06B)
+        return 1;
+    if (encoding == ZIP_STR_14B)
+        return 2;
+    if (encoding == ZIP_STR_32B)
+        return 5;
+    return ZIP_ENCODING_SIZE_INVALID;
+}
+
+#define ZIP_ASSERT_ENCODING(encoding) do {                                     \
+    assert(zipEncodingLenSize(encoding) != ZIP_ENCODING_SIZE_INVALID);         \
+} while (0)
+
+/* Return bytes needed to store integer encoded by 'encoding' */
+static inline unsigned int zipIntSize(unsigned char encoding) {
+    switch(encoding) {
+    case ZIP_INT_8B:  return 1;
+    case ZIP_INT_16B: return 2;
+    case ZIP_INT_24B: return 3;
+    case ZIP_INT_32B: return 4;
+    case ZIP_INT_64B: return 8;
+    }
+    if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)
+        return 0; /* 4 bit immediate */
+    /* bad encoding, covered by a previous call to ZIP_ASSERT_ENCODING */
+    redis_unreachable();
+    return 0;
+}
+
+/* Write the encoding header of the entry in 'p'. If p is NULL it just returns
+ * the amount of bytes required to encode such a length. Arguments:
+ *
+ * 'encoding' is the encoding we are using for the entry. It could be
+ * ZIP_INT_* or ZIP_STR_* or between ZIP_INT_IMM_MIN and ZIP_INT_IMM_MAX
+ * for single-byte small immediate integers.
+ *
+ * 'rawlen' is only used for ZIP_STR_* encodings and is the length of the
+ * string that this entry represents.
+ *
+ * The function returns the number of bytes used by the encoding/length
+ * header stored in 'p'. */
+unsigned int zipStoreEntryEncoding(unsigned char *p, unsigned char encoding, unsigned int rawlen) {
+    unsigned char len = 1, buf[5];
+
+    if (ZIP_IS_STR(encoding)) {
+        /* Although encoding is given it may not be set for strings,
+         * so we determine it here using the raw length. */
+        if (rawlen <= 0x3f) {
+            if (!p) return len;
+            buf[0] = ZIP_STR_06B | rawlen;
+        } else if (rawlen <= 0x3fff) {
+            len += 1;
+            if (!p) return len;
+            buf[0] = ZIP_STR_14B | ((rawlen >> 8) & 0x3f);
+            buf[1] = rawlen & 0xff;
+        } else {
+            len += 4;
+            if (!p) return len;
+            buf[0] = ZIP_STR_32B;
+            buf[1] = (rawlen >> 24) & 0xff;
+            buf[2] = (rawlen >> 16) & 0xff;
+            buf[3] = (rawlen >> 8) & 0xff;
+            buf[4] = rawlen & 0xff;
+        }
+    } else {
+        /* Implies integer encoding, so length is always 1. */
+        if (!p) return len;
+        buf[0] = encoding;
+    }
+
+    /* Store this length at p. */
+    memcpy(p,buf,len);
+    return len;
+}
+
+/* Decode the entry encoding type and data length (string length for strings,
+ * number of bytes used for the integer for integer entries) encoded in 'ptr'.
+ * The 'encoding' variable is input, extracted by the caller, the 'lensize'
+ * variable will hold the number of bytes required to encode the entry
+ * length, and the 'len' variable will hold the entry length.
+ * On invalid encoding error, lensize is set to 0. */
+#define ZIP_DECODE_LENGTH(ptr, encoding, lensize, len) do {                    \
+    if ((encoding) < ZIP_STR_MASK) {                                           \
+        if ((encoding) == ZIP_STR_06B) {                                       \
+            (lensize) = 1;                                                     \
+            (len) = (ptr)[0] & 0x3f;                                           \
+        } else if ((encoding) == ZIP_STR_14B) {                                \
+            (lensize) = 2;                                                     \
+            (len) = (((ptr)[0] & 0x3f) << 8) | (ptr)[1];                       \
+        } else if ((encoding) == ZIP_STR_32B) {                                \
+            (lensize) = 5;                                                     \
+            (len) = ((ptr)[1] << 24) |                                         \
+                    ((ptr)[2] << 16) |                                         \
+                    ((ptr)[3] <<  8) |                                         \
+                    ((ptr)[4]);                                                \
+        } else {                                                               \
+            (lensize) = 0; /* bad encoding, should be covered by a previous */ \
+            (len) = 0;     /* ZIP_ASSERT_ENCODING / zipEncodingLenSize, or  */ \
+                           /* match the lensize after this macro with 0.    */ \
+        }                                                                      \
+    } else {                                                                   \
+        (lensize) = 1;                                                         \
+        if ((encoding) == ZIP_INT_8B)  (len) = 1;                              \
+        else if ((encoding) == ZIP_INT_16B) (len) = 2;                         \
+        else if ((encoding) == ZIP_INT_24B) (len) = 3;                         \
+        else if ((encoding) == ZIP_INT_32B) (len) = 4;                         \
+        else if ((encoding) == ZIP_INT_64B) (len) = 8;                         \
+        else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)   \
+            (len) = 0; /* 4 bit immediate */                                   \
+        else                                                                   \
+            (lensize) = (len) = 0; /* bad encoding */                          \
+    }                                                                          \
+} while(0)
+
+/* Encode the length of the previous entry and write it to "p". This only
+ * uses the larger encoding (required in __ziplistCascadeUpdate). */
+int zipStorePrevEntryLengthLarge(unsigned char *p, unsigned int len) {
+    uint32_t u32;
+    if (p != NULL) {
+        p[0] = ZIP_BIG_PREVLEN;
+        u32 = len;
+        memcpy(p+1,&u32,sizeof(u32));
+        memrev32ifbe(p+1);
+    }
+    return 1 + sizeof(uint32_t);
+}
+
+/* Encode the length of the previous entry and write it to "p". Return the
+ * number of bytes needed to encode this length if "p" is NULL. */
+unsigned int zipStorePrevEntryLength(unsigned char *p, unsigned int len) {
+    if (p == NULL) {
+        return (len < ZIP_BIG_PREVLEN) ? 1 : sizeof(uint32_t) + 1;
+    } else {
+        if (len < ZIP_BIG_PREVLEN) {
+            p[0] = len;
+            return 1;
+        } else {
+            return zipStorePrevEntryLengthLarge(p,len);
+        }
+    }
+}
+
+/* Return the number of bytes used to encode the length of the previous
+ * entry. The length is returned by setting the var 'prevlensize'. */
+#define ZIP_DECODE_PREVLENSIZE(ptr, prevlensize) do {                          \
+    if ((ptr)[0] < ZIP_BIG_PREVLEN) {                                          \
+        (prevlensize) = 1;                                                     \
+    } else {                                                                   \
+        (prevlensize) = 5;                                                     \
+    }                                                                          \
+} while(0)
+
+/* Return the length of the previous element, and the number of bytes that
+ * are used in order to encode the previous element length.
+ * 'ptr' must point to the prevlen prefix of an entry (that encodes the
+ * length of the previous entry in order to navigate the elements backward).
+ * The length of the previous entry is stored in 'prevlen', the number of
+ * bytes needed to encode the previous entry length are stored in
+ * 'prevlensize'. */
+#define ZIP_DECODE_PREVLEN(ptr, prevlensize, prevlen) do {                     \
+    ZIP_DECODE_PREVLENSIZE(ptr, prevlensize);                                  \
+    if ((prevlensize) == 1) {                                                  \
+        (prevlen) = (ptr)[0];                                                  \
+    } else { /* prevlensize == 5 */                                            \
+        (prevlen) = ((ptr)[4] << 24) |                                         \
+                    ((ptr)[3] << 16) |                                         \
+                    ((ptr)[2] <<  8) |                                         \
+                    ((ptr)[1]);                                                \
+    }                                                                          \
+} while(0)
+
+/* Given a pointer 'p' to the prevlen info that prefixes an entry, this
+ * function returns the difference in number of bytes needed to encode
+ * the prevlen if the previous entry changes of size.
+ *
+ * So if A is the number of bytes used right now to encode the 'prevlen'
+ * field.
+ *
+ * And B is the number of bytes that are needed in order to encode the
+ * 'prevlen' if the previous element will be updated to one of size 'len'.
+ *
+ * Then the function returns B - A
+ *
+ * So the function returns a positive number if more space is needed,
+ * a negative number if less space is needed, or zero if the same space
+ * is needed. */
+int zipPrevLenByteDiff(unsigned char *p, unsigned int len) {
+    unsigned int prevlensize;
+    ZIP_DECODE_PREVLENSIZE(p, prevlensize);
+    return zipStorePrevEntryLength(NULL, len) - prevlensize;
+}
+
+/* Check if string pointed to by 'entry' can be encoded as an integer.
+ * Stores the integer value in 'v' and its encoding in 'encoding'. */
+int zipTryEncoding(unsigned char *entry, unsigned int entrylen, long long *v, unsigned char *encoding) {
+    long long value;
+
+    if (entrylen >= 32 || entrylen == 0) return 0;
+    if (string2ll((char*)entry,entrylen,&value)) {
+        /* Great, the string can be encoded. Check what's the smallest
+         * of our encoding types that can hold this value. */
+        if (value >= 0 && value <= 12) {
+            *encoding = ZIP_INT_IMM_MIN+value;
+        } else if (value >= INT8_MIN && value <= INT8_MAX) {
+            *encoding = ZIP_INT_8B;
+        } else if (value >= INT16_MIN && value <= INT16_MAX) {
+            *encoding = ZIP_INT_16B;
+        } else if (value >= INT24_MIN && value <= INT24_MAX) {
+            *encoding = ZIP_INT_24B;
+        } else if (value >= INT32_MIN && value <= INT32_MAX) {
+            *encoding = ZIP_INT_32B;
+        } else {
+            *encoding = ZIP_INT_64B;
+        }
+        *v = value;
+        return 1;
+    }
+    return 0;
+}
+
+/* Store integer 'value' at 'p', encoded as 'encoding' */
+void zipSaveInteger(unsigned char *p, int64_t value, unsigned char encoding) {
+    int16_t i16;
+    int32_t i32;
+    int64_t i64;
+    if (encoding == ZIP_INT_8B) {
+        ((int8_t*)p)[0] = (int8_t)value;
+    } else if (encoding == ZIP_INT_16B) {
+        i16 = value;
+        memcpy(p,&i16,sizeof(i16));
+        memrev16ifbe(p);
+    } else if (encoding == ZIP_INT_24B) {
+        i32 = value<<8;
+        memrev32ifbe(&i32);
+        memcpy(p,((uint8_t*)&i32)+1,sizeof(i32)-sizeof(uint8_t));
+    } else if (encoding == ZIP_INT_32B) {
+        i32 = value;
+        memcpy(p,&i32,sizeof(i32));
+        memrev32ifbe(p);
+    } else if (encoding == ZIP_INT_64B) {
+        i64 = value;
+        memcpy(p,&i64,sizeof(i64));
+        memrev64ifbe(p);
+    } else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX) {
+        /* Nothing to do, the value is stored in the encoding itself. */
+    } else {
+        assert(NULL);
+    }
+}
+
+/* Read integer encoded as 'encoding' from 'p' */
+int64_t zipLoadInteger(unsigned char *p, unsigned char encoding) {
+    int16_t i16;
+    int32_t i32;
+    int64_t i64, ret = 0;
+    if (encoding == ZIP_INT_8B) {
+        ret = ((int8_t*)p)[0];
+    } else if (encoding == ZIP_INT_16B) {
+        memcpy(&i16,p,sizeof(i16));
+        memrev16ifbe(&i16);
+        ret = i16;
+    } else if (encoding == ZIP_INT_32B) {
+        memcpy(&i32,p,sizeof(i32));
+        memrev32ifbe(&i32);
+        ret = i32;
+    } else if (encoding == ZIP_INT_24B) {
+        i32 = 0;
+        memcpy(((uint8_t*)&i32)+1,p,sizeof(i32)-sizeof(uint8_t));
+        memrev32ifbe(&i32);
+        ret = i32>>8;
+    } else if (encoding == ZIP_INT_64B) {
+        memcpy(&i64,p,sizeof(i64));
+        memrev64ifbe(&i64);
+        ret = i64;
+    } else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX) {
+        ret = (encoding & ZIP_INT_IMM_MASK)-1;
+    } else {
+        assert(NULL);
+    }
+    return ret;
+}
+
+/* Fills a struct with all information about an entry.
+ * This function is the "unsafe" alternative to the one blow.
+ * Generally, all function that return a pointer to an element in the ziplist
+ * will assert that this element is valid, so it can be freely used.
+ * Generally functions such ziplistGet assume the input pointer is already
+ * validated (since it's the return value of another function). */
+static inline void zipEntry(unsigned char *p, zlentry *e) {
+    ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
+    ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
+    ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
+    assert(e->lensize != 0); /* check that encoding was valid. */
+    e->headersize = e->prevrawlensize + e->lensize;
+    e->p = p;
+}
+
+/* Fills a struct with all information about an entry.
+ * This function is safe to use on untrusted pointers, it'll make sure not to
+ * try to access memory outside the ziplist payload.
+ * Returns 1 if the entry is valid, and 0 otherwise. */
+static inline int zipEntrySafe(unsigned char* zl, size_t zlbytes, unsigned char *p, zlentry *e, int validate_prevlen) {
+    unsigned char *zlfirst = zl + ZIPLIST_HEADER_SIZE;
+    unsigned char *zllast = zl + zlbytes - ZIPLIST_END_SIZE;
+#define OUT_OF_RANGE(p) (unlikely((p) < zlfirst || (p) > zllast))
+
+    /* If threre's no possibility for the header to reach outside the ziplist,
+     * take the fast path. (max lensize and prevrawlensize are both 5 bytes) */
+    if (p >= zlfirst && p + 10 < zllast) {
+        ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
+        ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
+        ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
+        e->headersize = e->prevrawlensize + e->lensize;
+        e->p = p;
+        /* We didn't call ZIP_ASSERT_ENCODING, so we check lensize was set to 0. */
+        if (unlikely(e->lensize == 0))
+            return 0;
+        /* Make sure the entry doesn't rech outside the edge of the ziplist */
+        if (OUT_OF_RANGE(p + e->headersize + e->len))
+            return 0;
+        /* Make sure prevlen doesn't rech outside the edge of the ziplist */
+        if (validate_prevlen && OUT_OF_RANGE(p - e->prevrawlen))
+            return 0;
+        return 1;
+    }
+
+    /* Make sure the pointer doesn't rech outside the edge of the ziplist */
+    if (OUT_OF_RANGE(p))
+        return 0;
+
+    /* Make sure the encoded prevlen header doesn't reach outside the allocation */
+    ZIP_DECODE_PREVLENSIZE(p, e->prevrawlensize);
+    if (OUT_OF_RANGE(p + e->prevrawlensize))
+        return 0;
+
+    /* Make sure encoded entry header is valid. */
+    ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
+    e->lensize = zipEncodingLenSize(e->encoding);
+    if (unlikely(e->lensize == ZIP_ENCODING_SIZE_INVALID))
+        return 0;
+
+    /* Make sure the encoded entry header doesn't reach outside the allocation */
+    if (OUT_OF_RANGE(p + e->prevrawlensize + e->lensize))
+        return 0;
+
+    /* Decode the prevlen and entry len headers. */
+    ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
+    ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
+    e->headersize = e->prevrawlensize + e->lensize;
+
+    /* Make sure the entry doesn't rech outside the edge of the ziplist */
+    if (OUT_OF_RANGE(p + e->headersize + e->len))
+        return 0;
+
+    /* Make sure prevlen doesn't rech outside the edge of the ziplist */
+    if (validate_prevlen && OUT_OF_RANGE(p - e->prevrawlen))
+        return 0;
+
+    e->p = p;
+    return 1;
+#undef OUT_OF_RANGE
+}
+
+/* Return the total number of bytes used by the entry pointed to by 'p'. */
+static inline unsigned int zipRawEntryLengthSafe(unsigned char* zl, size_t zlbytes, unsigned char *p) {
+    zlentry e;
+    assert(zipEntrySafe(zl, zlbytes, p, &e, 0));
+    return e.headersize + e.len;
+}
+
+/* Return the total number of bytes used by the entry pointed to by 'p'. */
+static inline unsigned int zipRawEntryLength(unsigned char *p) {
+    zlentry e;
+    zipEntry(p, &e);
+    return e.headersize + e.len;
+}
+
+/* Validate that the entry doesn't reach outside the ziplist allocation. */
+static inline void zipAssertValidEntry(unsigned char* zl, size_t zlbytes, unsigned char *p) {
+    zlentry e;
+    assert(zipEntrySafe(zl, zlbytes, p, &e, 1));
+}
+
+/* Create a new empty ziplist. */
+unsigned char *ziplistNew(void) {
+    unsigned int bytes = ZIPLIST_HEADER_SIZE+ZIPLIST_END_SIZE;
+    unsigned char *zl = zmalloc(bytes);
+    ZIPLIST_BYTES(zl) = intrev32ifbe(bytes);
+    ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(ZIPLIST_HEADER_SIZE);
+    ZIPLIST_LENGTH(zl) = 0;
+    zl[bytes-1] = ZIP_END;
+    return zl;
+}
+
+/* Resize the ziplist. */
+unsigned char *ziplistResize(unsigned char *zl, size_t len) {
+    assert(len < UINT32_MAX);
+    zl = zrealloc(zl,len);
+    ZIPLIST_BYTES(zl) = intrev32ifbe(len);
+    zl[len-1] = ZIP_END;
+    return zl;
+}
+
+/* When an entry is inserted, we need to set the prevlen field of the next
+ * entry to equal the length of the inserted entry. It can occur that this
+ * length cannot be encoded in 1 byte and the next entry needs to be grow
+ * a bit larger to hold the 5-byte encoded prevlen. This can be done for free,
+ * because this only happens when an entry is already being inserted (which
+ * causes a realloc and memmove). However, encoding the prevlen may require
+ * that this entry is grown as well. This effect may cascade throughout
+ * the ziplist when there are consecutive entries with a size close to
+ * ZIP_BIG_PREVLEN, so we need to check that the prevlen can be encoded in
+ * every consecutive entry.
+ *
+ * Note that this effect can also happen in reverse, where the bytes required
+ * to encode the prevlen field can shrink. This effect is deliberately ignored,
+ * because it can cause a "flapping" effect where a chain prevlen fields is
+ * first grown and then shrunk again after consecutive inserts. Rather, the
+ * field is allowed to stay larger than necessary, because a large prevlen
+ * field implies the ziplist is holding large entries anyway.
+ *
+ * The pointer "p" points to the first entry that does NOT need to be
+ * updated, i.e. consecutive fields MAY need an update. */
+unsigned char *__ziplistCascadeUpdate(unsigned char *zl, unsigned char *p) {
+    zlentry cur;
+    size_t prevlen, prevlensize, prevoffset; /* Informat of the last changed entry. */
+    size_t firstentrylen; /* Used to handle insert at head. */
+    size_t rawlen, curlen = intrev32ifbe(ZIPLIST_BYTES(zl));
+    size_t extra = 0, cnt = 0, offset;
+    size_t delta = 4; /* Extra bytes needed to update a entry's prevlen (5-1). */
+    unsigned char *tail = zl + intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl));
+
+    /* Empty ziplist */
+    if (p[0] == ZIP_END) return zl;
+
+    zipEntry(p, &cur); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
+    firstentrylen = prevlen = cur.headersize + cur.len;
+    prevlensize = zipStorePrevEntryLength(NULL, prevlen);
+    prevoffset = p - zl;
+    p += prevlen;
+
+    /* Iterate ziplist to find out how many extra bytes do we need to update it. */
+    while (p[0] != ZIP_END) {
+        assert(zipEntrySafe(zl, curlen, p, &cur, 0));
+
+        /* Abort when "prevlen" has not changed. */
+        if (cur.prevrawlen == prevlen) break;
+
+        /* Abort when entry's "prevlensize" is big enough. */
+        if (cur.prevrawlensize >= prevlensize) {
+            if (cur.prevrawlensize == prevlensize) {
+                zipStorePrevEntryLength(p, prevlen);
+            } else {
+                /* This would result in shrinking, which we want to avoid.
+                 * So, set "prevlen" in the available bytes. */
+                zipStorePrevEntryLengthLarge(p, prevlen);
+            }
+            break;
+        }
+
+        /* cur.prevrawlen means cur is the former head entry. */
+        assert(cur.prevrawlen == 0 || cur.prevrawlen + delta == prevlen);
+
+        /* Update prev entry's info and advance the cursor. */
+        rawlen = cur.headersize + cur.len;
+        prevlen = rawlen + delta; 
+        prevlensize = zipStorePrevEntryLength(NULL, prevlen);
+        prevoffset = p - zl;
+        p += rawlen;
+        extra += delta;
+        cnt++;
+    }
+
+    /* Extra bytes is zero all update has been done(or no need to update). */
+    if (extra == 0) return zl;
+
+    /* Update tail offset after loop. */
+    if (tail == zl + prevoffset) {
+        /* When the the last entry we need to update is also the tail, update tail offset
+         * unless this is the only entry that was updated (so the tail offset didn't change). */
+        if (extra - delta != 0) {
+            ZIPLIST_TAIL_OFFSET(zl) =
+                intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+extra-delta);
+        }
+    } else {
+        /* Update the tail offset in cases where the last entry we updated is not the tail. */
+        ZIPLIST_TAIL_OFFSET(zl) =
+            intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+extra);
+    }
+
+    /* Now "p" points at the first unchanged byte in original ziplist,
+     * move data after that to new ziplist. */
+    offset = p - zl;
+    zl = ziplistResize(zl, curlen + extra);
+    p = zl + offset;
+    memmove(p + extra, p, curlen - offset - 1);
+    p += extra;
+
+    /* Iterate all entries that need to be updated tail to head. */
+    while (cnt) {
+        zipEntry(zl + prevoffset, &cur); /* no need for "safe" variant since we already iterated on all these entries above. */
+        rawlen = cur.headersize + cur.len;
+        /* Move entry to tail and reset prevlen. */
+        memmove(p - (rawlen - cur.prevrawlensize), 
+                zl + prevoffset + cur.prevrawlensize, 
+                rawlen - cur.prevrawlensize);
+        p -= (rawlen + delta);
+        if (cur.prevrawlen == 0) {
+            /* "cur" is the previous head entry, update its prevlen with firstentrylen. */
+            zipStorePrevEntryLength(p, firstentrylen);
+        } else {
+            /* An entry's prevlen can only increment 4 bytes. */
+            zipStorePrevEntryLength(p, cur.prevrawlen+delta);
+        }
+        /* Foward to previous entry. */
+        prevoffset -= cur.prevrawlen;
+        cnt--;
+    }
+    return zl;
+}
+
+/* Delete "num" entries, starting at "p". Returns pointer to the ziplist. */
+unsigned char *__ziplistDelete(unsigned char *zl, unsigned char *p, unsigned int num) {
+    unsigned int i, totlen, deleted = 0;
+    size_t offset;
+    int nextdiff = 0;
+    zlentry first, tail;
+    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+
+    zipEntry(p, &first); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
+    for (i = 0; p[0] != ZIP_END && i < num; i++) {
+        p += zipRawEntryLengthSafe(zl, zlbytes, p);
+        deleted++;
+    }
+
+    assert(p >= first.p);
+    totlen = p-first.p; /* Bytes taken by the element(s) to delete. */
+    if (totlen > 0) {
+        uint32_t set_tail;
+        if (p[0] != ZIP_END) {
+            /* Storing `prevrawlen` in this entry may increase or decrease the
+             * number of bytes required compare to the current `prevrawlen`.
+             * There always is room to store this, because it was previously
+             * stored by an entry that is now being deleted. */
+            nextdiff = zipPrevLenByteDiff(p,first.prevrawlen);
+
+            /* Note that there is always space when p jumps backward: if
+             * the new previous entry is large, one of the deleted elements
+             * had a 5 bytes prevlen header, so there is for sure at least
+             * 5 bytes free and we need just 4. */
+            p -= nextdiff;
+            assert(p >= first.p && p<zl+zlbytes-1);
+            zipStorePrevEntryLength(p,first.prevrawlen);
+
+            /* Update offset for tail */
+            set_tail = intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))-totlen;
+
+            /* When the tail contains more than one entry, we need to take
+             * "nextdiff" in account as well. Otherwise, a change in the
+             * size of prevlen doesn't have an effect on the *tail* offset. */
+            assert(zipEntrySafe(zl, zlbytes, p, &tail, 1));
+            if (p[tail.headersize+tail.len] != ZIP_END) {
+                set_tail = set_tail + nextdiff;
+            }
+
+            /* Move tail to the front of the ziplist */
+            /* since we asserted that p >= first.p. we know totlen >= 0,
+             * so we know that p > first.p and this is guaranteed not to reach
+             * beyond the allocation, even if the entries lens are corrupted. */
+            size_t bytes_to_move = zlbytes-(p-zl)-1;
+            memmove(first.p,p,bytes_to_move);
+        } else {
+            /* The entire tail was deleted. No need to move memory. */
+            set_tail = (first.p-zl)-first.prevrawlen;
+        }
+
+        /* Resize the ziplist */
+        offset = first.p-zl;
+        zlbytes -= totlen - nextdiff;
+        zl = ziplistResize(zl, zlbytes);
+        p = zl+offset;
+
+        /* Update record count */
+        ZIPLIST_INCR_LENGTH(zl,-deleted);
+
+        /* Set the tail offset computed above */
+        assert(set_tail <= zlbytes - ZIPLIST_END_SIZE);
+        ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(set_tail);
+
+        /* When nextdiff != 0, the raw length of the next entry has changed, so
+         * we need to cascade the update throughout the ziplist */
+        if (nextdiff != 0)
+            zl = __ziplistCascadeUpdate(zl,p);
+    }
+    return zl;
+}
+
+/* Insert item at "p". */
+unsigned char *__ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
+    size_t curlen = intrev32ifbe(ZIPLIST_BYTES(zl)), reqlen, newlen;
+    unsigned int prevlensize, prevlen = 0;
+    size_t offset;
+    int nextdiff = 0;
+    unsigned char encoding = 0;
+    long long value = 123456789; /* initialized to avoid warning. Using a value
+                                    that is easy to see if for some reason
+                                    we use it uninitialized. */
+    zlentry tail;
+
+    /* Find out prevlen for the entry that is inserted. */
+    if (p[0] != ZIP_END) {
+        ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
+    } else {
+        unsigned char *ptail = ZIPLIST_ENTRY_TAIL(zl);
+        if (ptail[0] != ZIP_END) {
+            prevlen = zipRawEntryLengthSafe(zl, curlen, ptail);
+        }
+    }
+
+    /* See if the entry can be encoded */
+    if (zipTryEncoding(s,slen,&value,&encoding)) {
+        /* 'encoding' is set to the appropriate integer encoding */
+        reqlen = zipIntSize(encoding);
+    } else {
+        /* 'encoding' is untouched, however zipStoreEntryEncoding will use the
+         * string length to figure out how to encode it. */
+        reqlen = slen;
+    }
+    /* We need space for both the length of the previous entry and
+     * the length of the payload. */
+    reqlen += zipStorePrevEntryLength(NULL,prevlen);
+    reqlen += zipStoreEntryEncoding(NULL,encoding,slen);
+
+    /* When the insert position is not equal to the tail, we need to
+     * make sure that the next entry can hold this entry's length in
+     * its prevlen field. */
+    int forcelarge = 0;
+    nextdiff = (p[0] != ZIP_END) ? zipPrevLenByteDiff(p,reqlen) : 0;
+    if (nextdiff == -4 && reqlen < 4) {
+        nextdiff = 0;
+        forcelarge = 1;
+    }
+
+    /* Store offset because a realloc may change the address of zl. */
+    offset = p-zl;
+    newlen = curlen+reqlen+nextdiff;
+    zl = ziplistResize(zl,newlen);
+    p = zl+offset;
+
+    /* Apply memory move when necessary and update tail offset. */
+    if (p[0] != ZIP_END) {
+        /* Subtract one because of the ZIP_END bytes */
+        memmove(p+reqlen,p-nextdiff,curlen-offset-1+nextdiff);
+
+        /* Encode this entry's raw length in the next entry. */
+        if (forcelarge)
+            zipStorePrevEntryLengthLarge(p+reqlen,reqlen);
+        else
+            zipStorePrevEntryLength(p+reqlen,reqlen);
+
+        /* Update offset for tail */
+        ZIPLIST_TAIL_OFFSET(zl) =
+            intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+reqlen);
+
+        /* When the tail contains more than one entry, we need to take
+         * "nextdiff" in account as well. Otherwise, a change in the
+         * size of prevlen doesn't have an effect on the *tail* offset. */
+        assert(zipEntrySafe(zl, newlen, p+reqlen, &tail, 1));
+        if (p[reqlen+tail.headersize+tail.len] != ZIP_END) {
+            ZIPLIST_TAIL_OFFSET(zl) =
+                intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+nextdiff);
+        }
+    } else {
+        /* This element will be the new tail. */
+        ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(p-zl);
+    }
+
+    /* When nextdiff != 0, the raw length of the next entry has changed, so
+     * we need to cascade the update throughout the ziplist */
+    if (nextdiff != 0) {
+        offset = p-zl;
+        zl = __ziplistCascadeUpdate(zl,p+reqlen);
+        p = zl+offset;
+    }
+
+    /* Write the entry */
+    p += zipStorePrevEntryLength(p,prevlen);
+    p += zipStoreEntryEncoding(p,encoding,slen);
+    if (ZIP_IS_STR(encoding)) {
+        memcpy(p,s,slen);
+    } else {
+        zipSaveInteger(p,value,encoding);
+    }
+    ZIPLIST_INCR_LENGTH(zl,1);
+    return zl;
+}
+
+/* Merge ziplists 'first' and 'second' by appending 'second' to 'first'.
+ *
+ * NOTE: The larger ziplist is reallocated to contain the new merged ziplist.
+ * Either 'first' or 'second' can be used for the result.  The parameter not
+ * used will be free'd and set to NULL.
+ *
+ * After calling this function, the input parameters are no longer valid since
+ * they are changed and free'd in-place.
+ *
+ * The result ziplist is the contents of 'first' followed by 'second'.
+ *
+ * On failure: returns NULL if the merge is impossible.
+ * On success: returns the merged ziplist (which is expanded version of either
+ * 'first' or 'second', also frees the other unused input ziplist, and sets the
+ * input ziplist argument equal to newly reallocated ziplist return value. */
+unsigned char *ziplistMerge(unsigned char **first, unsigned char **second) {
+    /* If any params are null, we can't merge, so NULL. */
+    if (first == NULL || *first == NULL || second == NULL || *second == NULL)
+        return NULL;
+
+    /* Can't merge same list into itself. */
+    if (*first == *second)
+        return NULL;
+
+    size_t first_bytes = intrev32ifbe(ZIPLIST_BYTES(*first));
+    size_t first_len = intrev16ifbe(ZIPLIST_LENGTH(*first));
+
+    size_t second_bytes = intrev32ifbe(ZIPLIST_BYTES(*second));
+    size_t second_len = intrev16ifbe(ZIPLIST_LENGTH(*second));
+
+    int append;
+    unsigned char *source, *target;
+    size_t target_bytes, source_bytes;
+    /* Pick the largest ziplist so we can resize easily in-place.
+     * We must also track if we are now appending or prepending to
+     * the target ziplist. */
+    if (first_len >= second_len) {
+        /* retain first, append second to first. */
+        target = *first;
+        target_bytes = first_bytes;
+        source = *second;
+        source_bytes = second_bytes;
+        append = 1;
+    } else {
+        /* else, retain second, prepend first to second. */
+        target = *second;
+        target_bytes = second_bytes;
+        source = *first;
+        source_bytes = first_bytes;
+        append = 0;
+    }
+
+    /* Calculate final bytes (subtract one pair of metadata) */
+    size_t zlbytes = first_bytes + second_bytes -
+                     ZIPLIST_HEADER_SIZE - ZIPLIST_END_SIZE;
+    size_t zllength = first_len + second_len;
+
+    /* Combined zl length should be limited within UINT16_MAX */
+    zllength = zllength < UINT16_MAX ? zllength : UINT16_MAX;
+
+    /* larger values can't be stored into ZIPLIST_BYTES */
+    assert(zlbytes < UINT32_MAX);
+
+    /* Save offset positions before we start ripping memory apart. */
+    size_t first_offset = intrev32ifbe(ZIPLIST_TAIL_OFFSET(*first));
+    size_t second_offset = intrev32ifbe(ZIPLIST_TAIL_OFFSET(*second));
+
+    /* Extend target to new zlbytes then append or prepend source. */
+    target = zrealloc(target, zlbytes);
+    if (append) {
+        /* append == appending to target */
+        /* Copy source after target (copying over original [END]):
+         *   [TARGET - END, SOURCE - HEADER] */
+        memcpy(target + target_bytes - ZIPLIST_END_SIZE,
+               source + ZIPLIST_HEADER_SIZE,
+               source_bytes - ZIPLIST_HEADER_SIZE);
+    } else {
+        /* !append == prepending to target */
+        /* Move target *contents* exactly size of (source - [END]),
+         * then copy source into vacated space (source - [END]):
+         *   [SOURCE - END, TARGET - HEADER] */
+        memmove(target + source_bytes - ZIPLIST_END_SIZE,
+                target + ZIPLIST_HEADER_SIZE,
+                target_bytes - ZIPLIST_HEADER_SIZE);
+        memcpy(target, source, source_bytes - ZIPLIST_END_SIZE);
+    }
+
+    /* Update header metadata. */
+    ZIPLIST_BYTES(target) = intrev32ifbe(zlbytes);
+    ZIPLIST_LENGTH(target) = intrev16ifbe(zllength);
+    /* New tail offset is:
+     *   + N bytes of first ziplist
+     *   - 1 byte for [END] of first ziplist
+     *   + M bytes for the offset of the original tail of the second ziplist
+     *   - J bytes for HEADER because second_offset keeps no header. */
+    ZIPLIST_TAIL_OFFSET(target) = intrev32ifbe(
+                                   (first_bytes - ZIPLIST_END_SIZE) +
+                                   (second_offset - ZIPLIST_HEADER_SIZE));
+
+    /* __ziplistCascadeUpdate just fixes the prev length values until it finds a
+     * correct prev length value (then it assumes the rest of the list is okay).
+     * We tell CascadeUpdate to start at the first ziplist's tail element to fix
+     * the merge seam. */
+    target = __ziplistCascadeUpdate(target, target+first_offset);
+
+    /* Now free and NULL out what we didn't realloc */
+    if (append) {
+        zfree(*second);
+        *second = NULL;
+        *first = target;
+    } else {
+        zfree(*first);
+        *first = NULL;
+        *second = target;
+    }
+    return target;
+}
+
+unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where) {
+    unsigned char *p;
+    p = (where == ZIPLIST_HEAD) ? ZIPLIST_ENTRY_HEAD(zl) : ZIPLIST_ENTRY_END(zl);
+    return __ziplistInsert(zl,p,s,slen);
+}
+
+/* Returns an offset to use for iterating with ziplistNext. When the given
+ * index is negative, the list is traversed back to front. When the list
+ * doesn't contain an element at the provided index, NULL is returned. */
+unsigned char *ziplistIndex(unsigned char *zl, int index) {
+    unsigned char *p;
+    unsigned int prevlensize, prevlen = 0;
+    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+    if (index < 0) {
+        index = (-index)-1;
+        p = ZIPLIST_ENTRY_TAIL(zl);
+        if (p[0] != ZIP_END) {
+            /* No need for "safe" check: when going backwards, we know the header
+             * we're parsing is in the range, we just need to assert (below) that
+             * the size we take doesn't cause p to go outside the allocation. */
+            ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
+            while (prevlen > 0 && index--) {
+                p -= prevlen;
+                assert(p >= zl + ZIPLIST_HEADER_SIZE && p < zl + zlbytes - ZIPLIST_END_SIZE);
+                ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
+            }
+        }
+    } else {
+        p = ZIPLIST_ENTRY_HEAD(zl);
+        while (index--) {
+            /* Use the "safe" length: When we go forward, we need to be careful
+             * not to decode an entry header if it's past the ziplist allocation. */
+            p += zipRawEntryLengthSafe(zl, zlbytes, p);
+            if (p[0] == ZIP_END)
+                break;
+        }
+    }
+    if (p[0] == ZIP_END || index > 0)
+        return NULL;
+    zipAssertValidEntry(zl, zlbytes, p);
+    return p;
+}
+
+/* Return pointer to next entry in ziplist.
+ *
+ * zl is the pointer to the ziplist
+ * p is the pointer to the current element
+ *
+ * The element after 'p' is returned, otherwise NULL if we are at the end. */
+unsigned char *ziplistNext(unsigned char *zl, unsigned char *p) {
+    ((void) zl);
+    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+
+    /* "p" could be equal to ZIP_END, caused by ziplistDelete,
+     * and we should return NULL. Otherwise, we should return NULL
+     * when the *next* element is ZIP_END (there is no next entry). */
+    if (p[0] == ZIP_END) {
+        return NULL;
+    }
+
+    p += zipRawEntryLength(p);
+    if (p[0] == ZIP_END) {
+        return NULL;
+    }
+
+    zipAssertValidEntry(zl, zlbytes, p);
+    return p;
+}
+
+/* Return pointer to previous entry in ziplist. */
+unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p) {
+    unsigned int prevlensize, prevlen = 0;
+
+    /* Iterating backwards from ZIP_END should return the tail. When "p" is
+     * equal to the first element of the list, we're already at the head,
+     * and should return NULL. */
+    if (p[0] == ZIP_END) {
+        p = ZIPLIST_ENTRY_TAIL(zl);
+        return (p[0] == ZIP_END) ? NULL : p;
+    } else if (p == ZIPLIST_ENTRY_HEAD(zl)) {
+        return NULL;
+    } else {
+        ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
+        assert(prevlen > 0);
+        p-=prevlen;
+        size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+        zipAssertValidEntry(zl, zlbytes, p);
+        return p;
+    }
+}
+
+/* Get entry pointed to by 'p' and store in either '*sstr' or 'sval' depending
+ * on the encoding of the entry. '*sstr' is always set to NULL to be able
+ * to find out whether the string pointer or the integer value was set.
+ * Return 0 if 'p' points to the end of the ziplist, 1 otherwise. */
+unsigned int ziplistGet(unsigned char *p, unsigned char **sstr, unsigned int *slen, long long *sval) {
+    zlentry entry;
+    if (p == NULL || p[0] == ZIP_END) return 0;
+    if (sstr) *sstr = NULL;
+
+    zipEntry(p, &entry); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
+    if (ZIP_IS_STR(entry.encoding)) {
+        if (sstr) {
+            *slen = entry.len;
+            *sstr = p+entry.headersize;
+        }
+    } else {
+        if (sval) {
+            *sval = zipLoadInteger(p+entry.headersize,entry.encoding);
+        }
+    }
+    return 1;
+}
+
+/* Insert an entry at "p". */
+unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
+    return __ziplistInsert(zl,p,s,slen);
+}
+
+/* Delete a single entry from the ziplist, pointed to by *p.
+ * Also update *p in place, to be able to iterate over the
+ * ziplist, while deleting entries. */
+unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p) {
+    size_t offset = *p-zl;
+    zl = __ziplistDelete(zl,*p,1);
+
+    /* Store pointer to current element in p, because ziplistDelete will
+     * do a realloc which might result in a different "zl"-pointer.
+     * When the delete direction is back to front, we might delete the last
+     * entry and end up with "p" pointing to ZIP_END, so check this. */
+    *p = zl+offset;
+    return zl;
+}
+
+/* Delete a range of entries from the ziplist. */
+unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num) {
+    unsigned char *p = ziplistIndex(zl,index);
+    return (p == NULL) ? zl : __ziplistDelete(zl,p,num);
+}
+
+/* Replaces the entry at p. This is equivalent to a delete and an insert,
+ * but avoids some overhead when replacing a value of the same size. */
+unsigned char *ziplistReplace(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
+
+    /* get metadata of the current entry */
+    zlentry entry;
+    zipEntry(p, &entry);
+
+    /* compute length of entry to store, excluding prevlen */
+    unsigned int reqlen;
+    unsigned char encoding = 0;
+    long long value = 123456789; /* initialized to avoid warning. */
+    if (zipTryEncoding(s,slen,&value,&encoding)) {
+        reqlen = zipIntSize(encoding); /* encoding is set */
+    } else {
+        reqlen = slen; /* encoding == 0 */
+    }
+    reqlen += zipStoreEntryEncoding(NULL,encoding,slen);
+
+    if (reqlen == entry.lensize + entry.len) {
+        /* Simply overwrite the element. */
+        p += entry.prevrawlensize;
+        p += zipStoreEntryEncoding(p,encoding,slen);
+        if (ZIP_IS_STR(encoding)) {
+            memcpy(p,s,slen);
+        } else {
+            zipSaveInteger(p,value,encoding);
+        }
+    } else {
+        /* Fallback. */
+        zl = ziplistDelete(zl,&p);
+        zl = ziplistInsert(zl,p,s,slen);
+    }
+    return zl;
+}
+
+/* Compare entry pointer to by 'p' with 'sstr' of length 'slen'. */
+/* Return 1 if equal. */
+unsigned int ziplistCompare(unsigned char *p, unsigned char *sstr, unsigned int slen) {
+    zlentry entry;
+    unsigned char sencoding;
+    long long zval, sval;
+    if (p[0] == ZIP_END) return 0;
+
+    zipEntry(p, &entry); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
+    if (ZIP_IS_STR(entry.encoding)) {
+        /* Raw compare */
+        if (entry.len == slen) {
+            return memcmp(p+entry.headersize,sstr,slen) == 0;
+        } else {
+            return 0;
+        }
+    } else {
+        /* Try to compare encoded values. Don't compare encoding because
+         * different implementations may encoded integers differently. */
+        if (zipTryEncoding(sstr,slen,&sval,&sencoding)) {
+          zval = zipLoadInteger(p+entry.headersize,entry.encoding);
+          return zval == sval;
+        }
+    }
+    return 0;
+}
+
+/* Find pointer to the entry equal to the specified entry. Skip 'skip' entries
+ * between every comparison. Returns NULL when the field could not be found. */
+unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip) {
+    int skipcnt = 0;
+    unsigned char vencoding = 0;
+    long long vll = 0;
+    size_t zlbytes = ziplistBlobLen(zl);
+
+    while (p[0] != ZIP_END) {
+        struct zlentry e;
+        unsigned char *q;
+
+        assert(zipEntrySafe(zl, zlbytes, p, &e, 1));
+        q = p + e.prevrawlensize + e.lensize;
+
+        if (skipcnt == 0) {
+            /* Compare current entry with specified entry */
+            if (ZIP_IS_STR(e.encoding)) {
+                if (e.len == vlen && memcmp(q, vstr, vlen) == 0) {
+                    return p;
+                }
+            } else {
+                /* Find out if the searched field can be encoded. Note that
+                 * we do it only the first time, once done vencoding is set
+                 * to non-zero and vll is set to the integer value. */
+                if (vencoding == 0) {
+                    if (!zipTryEncoding(vstr, vlen, &vll, &vencoding)) {
+                        /* If the entry can't be encoded we set it to
+                         * UCHAR_MAX so that we don't retry again the next
+                         * time. */
+                        vencoding = UCHAR_MAX;
+                    }
+                    /* Must be non-zero by now */
+                    assert(vencoding);
+                }
+
+                /* Compare current entry with specified entry, do it only
+                 * if vencoding != UCHAR_MAX because if there is no encoding
+                 * possible for the field it can't be a valid integer. */
+                if (vencoding != UCHAR_MAX) {
+                    long long ll = zipLoadInteger(q, e.encoding);
+                    if (ll == vll) {
+                        return p;
+                    }
+                }
+            }
+
+            /* Reset skip count */
+            skipcnt = skip;
+        } else {
+            /* Skip entry */
+            skipcnt--;
+        }
+
+        /* Move to next entry */
+        p = q + e.len;
+    }
+
+    return NULL;
+}
+
+/* Return length of ziplist. */
+unsigned int ziplistLen(unsigned char *zl) {
+    unsigned int len = 0;
+    if (intrev16ifbe(ZIPLIST_LENGTH(zl)) < UINT16_MAX) {
+        len = intrev16ifbe(ZIPLIST_LENGTH(zl));
+    } else {
+        unsigned char *p = zl+ZIPLIST_HEADER_SIZE;
+        size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+        while (*p != ZIP_END) {
+            p += zipRawEntryLengthSafe(zl, zlbytes, p);
+            len++;
+        }
+
+        /* Re-store length if small enough */
+        if (len < UINT16_MAX) ZIPLIST_LENGTH(zl) = intrev16ifbe(len);
+    }
+    return len;
+}
+
+/* Return ziplist blob size in bytes. */
+size_t ziplistBlobLen(unsigned char *zl) {
+    return intrev32ifbe(ZIPLIST_BYTES(zl));
+}
+
+void ziplistRepr(unsigned char *zl) {
+    unsigned char *p;
+    int index = 0;
+    zlentry entry;
+    size_t zlbytes = ziplistBlobLen(zl);
+
+    printf(
+        "{total bytes %u} "
+        "{num entries %u}\n"
+        "{tail offset %u}\n",
+        intrev32ifbe(ZIPLIST_BYTES(zl)),
+        intrev16ifbe(ZIPLIST_LENGTH(zl)),
+        intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)));
+    p = ZIPLIST_ENTRY_HEAD(zl);
+    while(*p != ZIP_END) {
+        assert(zipEntrySafe(zl, zlbytes, p, &entry, 1));
+        printf(
+            "{\n"
+                "\taddr 0x%08lx,\n"
+                "\tindex %2d,\n"
+                "\toffset %5lu,\n"
+                "\thdr+entry len: %5u,\n"
+                "\thdr len%2u,\n"
+                "\tprevrawlen: %5u,\n"
+                "\tprevrawlensize: %2u,\n"
+                "\tpayload %5u\n",
+            (long unsigned)p,
+            index,
+            (unsigned long) (p-zl),
+            entry.headersize+entry.len,
+            entry.headersize,
+            entry.prevrawlen,
+            entry.prevrawlensize,
+            entry.len);
+        printf("\tbytes: ");
+        for (unsigned int i = 0; i < entry.headersize+entry.len; i++) {
+            printf("%02x|",p[i]);
+        }
+        printf("\n");
+        p += entry.headersize;
+        if (ZIP_IS_STR(entry.encoding)) {
+            printf("\t[str]");
+            if (entry.len > 40) {
+                if (fwrite(p,40,1,stdout) == 0) perror("fwrite");
+                printf("...");
+            } else {
+                if (entry.len &&
+                    fwrite(p,entry.len,1,stdout) == 0) perror("fwrite");
+            }
+        } else {
+            printf("\t[int]%lld", (long long) zipLoadInteger(p,entry.encoding));
+        }
+        printf("\n}\n");
+        p += entry.len;
+        index++;
+    }
+    printf("{end}\n\n");
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we scan all the entries one by one. */
+int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
+    ziplistValidateEntryCB entry_cb, void *cb_userdata) {
+    /* check that we can actually read the header. (and ZIP_END) */
+    if (size < ZIPLIST_HEADER_SIZE + ZIPLIST_END_SIZE)
+        return 0;
+
+    /* check that the encoded size in the header must match the allocated size. */
+    size_t bytes = intrev32ifbe(ZIPLIST_BYTES(zl));
+    if (bytes != size)
+        return 0;
+
+    /* the last byte must be the terminator. */
+    if (zl[size - ZIPLIST_END_SIZE] != ZIP_END)
+        return 0;
+
+    /* make sure the tail offset isn't reaching outside the allocation. */
+    if (intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)) > size - ZIPLIST_END_SIZE)
+        return 0;
+
+    if (!deep)
+        return 1;
+
+    unsigned int count = 0;
+    unsigned char *p = ZIPLIST_ENTRY_HEAD(zl);
+    unsigned char *prev = NULL;
+    size_t prev_raw_size = 0;
+    while(*p != ZIP_END) {
+        struct zlentry e;
+        /* Decode the entry headers and fail if invalid or reaches outside the allocation */
+        if (!zipEntrySafe(zl, size, p, &e, 1))
+            return 0;
+
+        /* Make sure the record stating the prev entry size is correct. */
+        if (e.prevrawlen != prev_raw_size)
+            return 0;
+
+        /* Optionally let the caller validate the entry too. */
+        if (entry_cb && !entry_cb(p, cb_userdata))
+            return 0;
+
+        /* Move to the next entry */
+        prev_raw_size = e.headersize + e.len;
+        prev = p;
+        p += e.headersize + e.len;
+        count++;
+    }
+
+    /* Make sure 'p' really does point to the end of the ziplist. */
+    if (p != zl + bytes - ZIPLIST_END_SIZE)
+        return 0;
+
+    /* Make sure the <zltail> entry really do point to the start of the last entry. */
+    if (prev != NULL && prev != ZIPLIST_ENTRY_TAIL(zl))
+        return 0;
+
+    /* Check that the count in the header is correct */
+    unsigned int header_count = intrev16ifbe(ZIPLIST_LENGTH(zl));
+    if (header_count != UINT16_MAX && count != header_count)
+        return 0;
+
+    return 1;
+}
+
+/* Randomly select a pair of key and value.
+ * total_count is a pre-computed length/2 of the ziplist (to avoid calls to ziplistLen)
+ * 'key' and 'val' are used to store the result key value pair.
+ * 'val' can be NULL if the value is not needed. */
+void ziplistRandomPair(unsigned char *zl, unsigned long total_count, ziplistEntry *key, ziplistEntry *val) {
+    int ret;
+    unsigned char *p;
+
+    /* Avoid div by zero on corrupt ziplist */
+    assert(total_count);
+
+    /* Generate even numbers, because ziplist saved K-V pair */
+    int r = (rand() % total_count) * 2;
+    p = ziplistIndex(zl, r);
+    ret = ziplistGet(p, &key->sval, &key->slen, &key->lval);
+    assert(ret != 0);
+
+    if (!val)
+        return;
+    p = ziplistNext(zl, p);
+    ret = ziplistGet(p, &val->sval, &val->slen, &val->lval);
+    assert(ret != 0);
+}
+
+/* int compare for qsort */
+int uintCompare(const void *a, const void *b) {
+    return (*(unsigned int *) a - *(unsigned int *) b);
+}
+
+/* Helper method to store a string into from val or lval into dest */
+static inline void ziplistSaveValue(unsigned char *val, unsigned int len, long long lval, ziplistEntry *dest) {
+    dest->sval = val;
+    dest->slen = len;
+    dest->lval = lval;
+}
+
+/* Randomly select count of key value pairs and store into 'keys' and
+ * 'vals' args. The order of the picked entries is random, and the selections
+ * are non-unique (repetitions are possible).
+ * The 'vals' arg can be NULL in which case we skip these. */
+void ziplistRandomPairs(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
+    unsigned char *p, *key, *value;
+    unsigned int klen = 0, vlen = 0;
+    long long klval = 0, vlval = 0;
+
+    /* Notice: the index member must be first due to the use in uintCompare */
+    typedef struct {
+        unsigned int index;
+        unsigned int order;
+    } rand_pick;
+    rand_pick *picks = zmalloc(sizeof(rand_pick)*count);
+    unsigned int total_size = ziplistLen(zl)/2;
+
+    /* Avoid div by zero on corrupt ziplist */
+    assert(total_size);
+
+    /* create a pool of random indexes (some may be duplicate). */
+    for (unsigned int i = 0; i < count; i++) {
+        picks[i].index = (rand() % total_size) * 2; /* Generate even indexes */
+        /* keep track of the order we picked them */
+        picks[i].order = i;
+    }
+
+    /* sort by indexes. */
+    qsort(picks, count, sizeof(rand_pick), uintCompare);
+
+    /* fetch the elements form the ziplist into a output array respecting the original order. */
+    unsigned int zipindex = 0, pickindex = 0;
+    p = ziplistIndex(zl, 0);
+    while (ziplistGet(p, &key, &klen, &klval) && pickindex < count) {
+        p = ziplistNext(zl, p);
+        assert(ziplistGet(p, &value, &vlen, &vlval));
+        while (pickindex < count && zipindex == picks[pickindex].index) {
+            int storeorder = picks[pickindex].order;
+            ziplistSaveValue(key, klen, klval, &keys[storeorder]);
+            if (vals)
+                ziplistSaveValue(value, vlen, vlval, &vals[storeorder]);
+             pickindex++;
+        }
+        zipindex += 2;
+        p = ziplistNext(zl, p);
+    }
+
+    zfree(picks);
+}
+
+/* Randomly select count of key value pairs and store into 'keys' and
+ * 'vals' args. The selections are unique (no repetitions), and the order of
+ * the picked entries is NOT-random.
+ * The 'vals' arg can be NULL in which case we skip these.
+ * The return value is the number of items picked which can be lower than the
+ * requested count if the ziplist doesn't hold enough pairs. */
+unsigned int ziplistRandomPairsUnique(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
+    unsigned char *p, *key;
+    unsigned int klen = 0;
+    long long klval = 0;
+    unsigned int total_size = ziplistLen(zl)/2;
+    unsigned int index = 0;
+    if (count > total_size)
+        count = total_size;
+
+    /* To only iterate once, every time we try to pick a member, the probability
+     * we pick it is the quotient of the count left we want to pick and the
+     * count still we haven't visited in the dict, this way, we could make every
+     * member be equally picked.*/
+    p = ziplistIndex(zl, 0);
+    unsigned int picked = 0, remaining = count;
+    while (picked < count && p) {
+        double randomDouble = ((double)rand()) / RAND_MAX;
+        double threshold = ((double)remaining) / (total_size - index);
+        if (randomDouble <= threshold) {
+            assert(ziplistGet(p, &key, &klen, &klval));
+            ziplistSaveValue(key, klen, klval, &keys[picked]);
+            p = ziplistNext(zl, p);
+            assert(p);
+            if (vals) {
+                assert(ziplistGet(p, &key, &klen, &klval));
+                ziplistSaveValue(key, klen, klval, &vals[picked]);
+            }
+            remaining--;
+            picked++;
+        } else {
+            p = ziplistNext(zl, p);
+            assert(p);
+        }
+        p = ziplistNext(zl, p);
+        index++;
+    }
+    return picked;
+}
+
+#ifdef REDIS_TEST
+#include <sys/time.h>
+#include "adlist.h"
+#include "sds.h"
+
+#define debug(f, ...) { if (DEBUG) printf(f, __VA_ARGS__); }
+
+static unsigned char *createList() {
+    unsigned char *zl = ziplistNew();
+    zl = ziplistPush(zl, (unsigned char*)"foo", 3, ZIPLIST_TAIL);
+    zl = ziplistPush(zl, (unsigned char*)"quux", 4, ZIPLIST_TAIL);
+    zl = ziplistPush(zl, (unsigned char*)"hello", 5, ZIPLIST_HEAD);
+    zl = ziplistPush(zl, (unsigned char*)"1024", 4, ZIPLIST_TAIL);
+    return zl;
+}
+
+static unsigned char *createIntList() {
+    unsigned char *zl = ziplistNew();
+    char buf[32];
+
+    sprintf(buf, "100");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
+    sprintf(buf, "128000");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
+    sprintf(buf, "-100");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_HEAD);
+    sprintf(buf, "4294967296");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_HEAD);
+    sprintf(buf, "non integer");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
+    sprintf(buf, "much much longer non integer");
+    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
+    return zl;
+}
+
+static long long usec(void) {
+    struct timeval tv;
+    gettimeofday(&tv,NULL);
+    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
+}
+
+static void stress(int pos, int num, int maxsize, int dnum) {
+    int i,j,k;
+    unsigned char *zl;
+    char posstr[2][5] = { "HEAD", "TAIL" };
+    long long start;
+    for (i = 0; i < maxsize; i+=dnum) {
+        zl = ziplistNew();
+        for (j = 0; j < i; j++) {
+            zl = ziplistPush(zl,(unsigned char*)"quux",4,ZIPLIST_TAIL);
+        }
+
+        /* Do num times a push+pop from pos */
+        start = usec();
+        for (k = 0; k < num; k++) {
+            zl = ziplistPush(zl,(unsigned char*)"quux",4,pos);
+            zl = ziplistDeleteRange(zl,0,1);
+        }
+        printf("List size: %8d, bytes: %8d, %dx push+pop (%s): %6lld usec\n",
+            i,intrev32ifbe(ZIPLIST_BYTES(zl)),num,posstr[pos],usec()-start);
+        zfree(zl);
+    }
+}
+
+static unsigned char *pop(unsigned char *zl, int where) {
+    unsigned char *p, *vstr;
+    unsigned int vlen;
+    long long vlong;
+
+    p = ziplistIndex(zl,where == ZIPLIST_HEAD ? 0 : -1);
+    if (ziplistGet(p,&vstr,&vlen,&vlong)) {
+        if (where == ZIPLIST_HEAD)
+            printf("Pop head: ");
+        else
+            printf("Pop tail: ");
+
+        if (vstr) {
+            if (vlen && fwrite(vstr,vlen,1,stdout) == 0) perror("fwrite");
+        }
+        else {
+            printf("%lld", vlong);
+        }
+
+        printf("\n");
+        return ziplistDelete(zl,&p);
+    } else {
+        printf("ERROR: Could not pop\n");
+        exit(1);
+    }
+}
+
+static int randstring(char *target, unsigned int min, unsigned int max) {
+    int p = 0;
+    int len = min+rand()%(max-min+1);
+    int minval, maxval;
+    switch(rand() % 3) {
+    case 0:
+        minval = 0;
+        maxval = 255;
+    break;
+    case 1:
+        minval = 48;
+        maxval = 122;
+    break;
+    case 2:
+        minval = 48;
+        maxval = 52;
+    break;
+    default:
+        assert(NULL);
+    }
+
+    while(p < len)
+        target[p++] = minval+rand()%(maxval-minval+1);
+    return len;
+}
+
+static void verify(unsigned char *zl, zlentry *e) {
+    int len = ziplistLen(zl);
+    zlentry _e;
+
+    ZIPLIST_ENTRY_ZERO(&_e);
+
+    for (int i = 0; i < len; i++) {
+        memset(&e[i], 0, sizeof(zlentry));
+        zipEntry(ziplistIndex(zl, i), &e[i]);
+
+        memset(&_e, 0, sizeof(zlentry));
+        zipEntry(ziplistIndex(zl, -len+i), &_e);
+
+        assert(memcmp(&e[i], &_e, sizeof(zlentry)) == 0);
+    }
+}
+
+static unsigned char *insertHelper(unsigned char *zl, char ch, size_t len, unsigned char *pos) {
+    assert(len <= ZIP_BIG_PREVLEN);
+    unsigned char data[ZIP_BIG_PREVLEN] = {0};
+    memset(data, ch, len);
+    return ziplistInsert(zl, pos, data, len);
+}
+
+static int compareHelper(unsigned char *zl, char ch, size_t len, int index) {
+    assert(len <= ZIP_BIG_PREVLEN);
+    unsigned char data[ZIP_BIG_PREVLEN] = {0};
+    memset(data, ch, len);
+    unsigned char *p = ziplistIndex(zl, index);
+    assert(p != NULL);
+    return ziplistCompare(p, data, len);
+}
+
+static size_t strEntryBytesSmall(size_t slen) {
+    return slen + zipStorePrevEntryLength(NULL, 0) + zipStoreEntryEncoding(NULL, 0, slen);
+}
+
+static size_t strEntryBytesLarge(size_t slen) {
+    return slen + zipStorePrevEntryLength(NULL, ZIP_BIG_PREVLEN) + zipStoreEntryEncoding(NULL, 0, slen);
+}
+
+/* ./redis-server test ziplist <randomseed> --accurate */
+int ziplistTest(int argc, char **argv, int accurate) {
+    unsigned char *zl, *p;
+    unsigned char *entry;
+    unsigned int elen;
+    long long value;
+    int iteration;
+
+    /* If an argument is given, use it as the random seed. */
+    if (argc >= 4)
+        srand(atoi(argv[3]));
+
+    zl = createIntList();
+    ziplistRepr(zl);
+
+    zfree(zl);
+
+    zl = createList();
+    ziplistRepr(zl);
+
+    zl = pop(zl,ZIPLIST_TAIL);
+    ziplistRepr(zl);
+
+    zl = pop(zl,ZIPLIST_HEAD);
+    ziplistRepr(zl);
+
+    zl = pop(zl,ZIPLIST_TAIL);
+    ziplistRepr(zl);
+
+    zl = pop(zl,ZIPLIST_TAIL);
+    ziplistRepr(zl);
+
+    zfree(zl);
+
+    printf("Get element at index 3:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 3);
+        if (!ziplistGet(p, &entry, &elen, &value)) {
+            printf("ERROR: Could not access index 3\n");
+            return 1;
+        }
+        if (entry) {
+            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            printf("\n");
+        } else {
+            printf("%lld\n", value);
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Get element at index 4 (out of range):\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 4);
+        if (p == NULL) {
+            printf("No entry\n");
+        } else {
+            printf("ERROR: Out of range index should return NULL, returned offset: %ld\n", (long)(p-zl));
+            return 1;
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Get element at index -1 (last element):\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, -1);
+        if (!ziplistGet(p, &entry, &elen, &value)) {
+            printf("ERROR: Could not access index -1\n");
+            return 1;
+        }
+        if (entry) {
+            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            printf("\n");
+        } else {
+            printf("%lld\n", value);
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Get element at index -4 (first element):\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, -4);
+        if (!ziplistGet(p, &entry, &elen, &value)) {
+            printf("ERROR: Could not access index -4\n");
+            return 1;
+        }
+        if (entry) {
+            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            printf("\n");
+        } else {
+            printf("%lld\n", value);
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Get element at index -5 (reverse out of range):\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, -5);
+        if (p == NULL) {
+            printf("No entry\n");
+        } else {
+            printf("ERROR: Out of range index should return NULL, returned offset: %ld\n", (long)(p-zl));
+            return 1;
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate list from 0 to end:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 0);
+        while (ziplistGet(p, &entry, &elen, &value)) {
+            printf("Entry: ");
+            if (entry) {
+                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            } else {
+                printf("%lld", value);
+            }
+            p = ziplistNext(zl,p);
+            printf("\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate list from 1 to end:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 1);
+        while (ziplistGet(p, &entry, &elen, &value)) {
+            printf("Entry: ");
+            if (entry) {
+                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            } else {
+                printf("%lld", value);
+            }
+            p = ziplistNext(zl,p);
+            printf("\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate list from 2 to end:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 2);
+        while (ziplistGet(p, &entry, &elen, &value)) {
+            printf("Entry: ");
+            if (entry) {
+                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            } else {
+                printf("%lld", value);
+            }
+            p = ziplistNext(zl,p);
+            printf("\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate starting out of range:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, 4);
+        if (!ziplistGet(p, &entry, &elen, &value)) {
+            printf("No entry\n");
+        } else {
+            printf("ERROR\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate from back to front:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, -1);
+        while (ziplistGet(p, &entry, &elen, &value)) {
+            printf("Entry: ");
+            if (entry) {
+                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            } else {
+                printf("%lld", value);
+            }
+            p = ziplistPrev(zl,p);
+            printf("\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Iterate from back to front, deleting all items:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl, -1);
+        while (ziplistGet(p, &entry, &elen, &value)) {
+            printf("Entry: ");
+            if (entry) {
+                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
+            } else {
+                printf("%lld", value);
+            }
+            zl = ziplistDelete(zl,&p);
+            p = ziplistPrev(zl,p);
+            printf("\n");
+        }
+        printf("\n");
+        zfree(zl);
+    }
+
+    printf("Delete inclusive range 0,0:\n");
+    {
+        zl = createList();
+        zl = ziplistDeleteRange(zl, 0, 1);
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Delete inclusive range 0,1:\n");
+    {
+        zl = createList();
+        zl = ziplistDeleteRange(zl, 0, 2);
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Delete inclusive range 1,2:\n");
+    {
+        zl = createList();
+        zl = ziplistDeleteRange(zl, 1, 2);
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Delete with start index out of range:\n");
+    {
+        zl = createList();
+        zl = ziplistDeleteRange(zl, 5, 1);
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Delete with num overflow:\n");
+    {
+        zl = createList();
+        zl = ziplistDeleteRange(zl, 1, 5);
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Delete foo while iterating:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl,0);
+        while (ziplistGet(p,&entry,&elen,&value)) {
+            if (entry && strncmp("foo",(char*)entry,elen) == 0) {
+                printf("Delete foo\n");
+                zl = ziplistDelete(zl,&p);
+            } else {
+                printf("Entry: ");
+                if (entry) {
+                    if (elen && fwrite(entry,elen,1,stdout) == 0)
+                        perror("fwrite");
+                } else {
+                    printf("%lld",value);
+                }
+                p = ziplistNext(zl,p);
+                printf("\n");
+            }
+        }
+        printf("\n");
+        ziplistRepr(zl);
+        zfree(zl);
+    }
+
+    printf("Replace with same size:\n");
+    {
+        zl = createList(); /* "hello", "foo", "quux", "1024" */
+        unsigned char *orig_zl = zl;
+        p = ziplistIndex(zl, 0);
+        zl = ziplistReplace(zl, p, (unsigned char*)"zoink", 5);
+        p = ziplistIndex(zl, 3);
+        zl = ziplistReplace(zl, p, (unsigned char*)"yy", 2);
+        p = ziplistIndex(zl, 1);
+        zl = ziplistReplace(zl, p, (unsigned char*)"65536", 5);
+        p = ziplistIndex(zl, 0);
+        assert(!memcmp((char*)p,
+                       "\x00\x05zoink"
+                       "\x07\xf0\x00\x00\x01" /* 65536 as int24 */
+                       "\x05\x04quux" "\x06\x02yy" "\xff",
+                       23));
+        assert(zl == orig_zl); /* no reallocations have happened */
+        zfree(zl);
+        printf("SUCCESS\n\n");
+    }
+
+    printf("Replace with different size:\n");
+    {
+        zl = createList(); /* "hello", "foo", "quux", "1024" */
+        p = ziplistIndex(zl, 1);
+        zl = ziplistReplace(zl, p, (unsigned char*)"squirrel", 8);
+        p = ziplistIndex(zl, 0);
+        assert(!strncmp((char*)p,
+                        "\x00\x05hello" "\x07\x08squirrel" "\x0a\x04quux"
+                        "\x06\xc0\x00\x04" "\xff",
+                        28));
+        zfree(zl);
+        printf("SUCCESS\n\n");
+    }
+
+    printf("Regression test for >255 byte strings:\n");
+    {
+        char v1[257] = {0}, v2[257] = {0};
+        memset(v1,'x',256);
+        memset(v2,'y',256);
+        zl = ziplistNew();
+        zl = ziplistPush(zl,(unsigned char*)v1,strlen(v1),ZIPLIST_TAIL);
+        zl = ziplistPush(zl,(unsigned char*)v2,strlen(v2),ZIPLIST_TAIL);
+
+        /* Pop values again and compare their value. */
+        p = ziplistIndex(zl,0);
+        assert(ziplistGet(p,&entry,&elen,&value));
+        assert(strncmp(v1,(char*)entry,elen) == 0);
+        p = ziplistIndex(zl,1);
+        assert(ziplistGet(p,&entry,&elen,&value));
+        assert(strncmp(v2,(char*)entry,elen) == 0);
+        printf("SUCCESS\n\n");
+        zfree(zl);
+    }
+
+    printf("Regression test deleting next to last entries:\n");
+    {
+        char v[3][257] = {{0}};
+        zlentry e[3] = {{.prevrawlensize = 0, .prevrawlen = 0, .lensize = 0,
+                         .len = 0, .headersize = 0, .encoding = 0, .p = NULL}};
+        size_t i;
+
+        for (i = 0; i < (sizeof(v)/sizeof(v[0])); i++) {
+            memset(v[i], 'a' + i, sizeof(v[0]));
+        }
+
+        v[0][256] = '\0';
+        v[1][  1] = '\0';
+        v[2][256] = '\0';
+
+        zl = ziplistNew();
+        for (i = 0; i < (sizeof(v)/sizeof(v[0])); i++) {
+            zl = ziplistPush(zl, (unsigned char *) v[i], strlen(v[i]), ZIPLIST_TAIL);
+        }
+
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1);
+        assert(e[1].prevrawlensize == 5);
+        assert(e[2].prevrawlensize == 1);
+
+        /* Deleting entry 1 will increase `prevrawlensize` for entry 2 */
+        unsigned char *p = e[1].p;
+        zl = ziplistDelete(zl, &p);
+
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1);
+        assert(e[1].prevrawlensize == 5);
+
+        printf("SUCCESS\n\n");
+        zfree(zl);
+    }
+
+    printf("Create long list and check indices:\n");
+    {
+        unsigned long long start = usec();
+        zl = ziplistNew();
+        char buf[32];
+        int i,len;
+        for (i = 0; i < 1000; i++) {
+            len = sprintf(buf,"%d",i);
+            zl = ziplistPush(zl,(unsigned char*)buf,len,ZIPLIST_TAIL);
+        }
+        for (i = 0; i < 1000; i++) {
+            p = ziplistIndex(zl,i);
+            assert(ziplistGet(p,NULL,NULL,&value));
+            assert(i == value);
+
+            p = ziplistIndex(zl,-i-1);
+            assert(ziplistGet(p,NULL,NULL,&value));
+            assert(999-i == value);
+        }
+        printf("SUCCESS. usec=%lld\n\n", usec()-start);
+        zfree(zl);
+    }
+
+    printf("Compare strings with ziplist entries:\n");
+    {
+        zl = createList();
+        p = ziplistIndex(zl,0);
+        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
+            printf("ERROR: not \"hello\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
+            printf("ERROR: \"hella\"\n");
+            return 1;
+        }
+
+        p = ziplistIndex(zl,3);
+        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
+            printf("ERROR: not \"1024\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
+            printf("ERROR: \"1025\"\n");
+            return 1;
+        }
+        printf("SUCCESS\n\n");
+        zfree(zl);
+    }
+
+    printf("Merge test:\n");
+    {
+        /* create list gives us: [hello, foo, quux, 1024] */
+        zl = createList();
+        unsigned char *zl2 = createList();
+
+        unsigned char *zl3 = ziplistNew();
+        unsigned char *zl4 = ziplistNew();
+
+        if (ziplistMerge(&zl4, &zl4)) {
+            printf("ERROR: Allowed merging of one ziplist into itself.\n");
+            return 1;
+        }
+
+        /* Merge two empty ziplists, get empty result back. */
+        zl4 = ziplistMerge(&zl3, &zl4);
+        ziplistRepr(zl4);
+        if (ziplistLen(zl4)) {
+            printf("ERROR: Merging two empty ziplists created entries.\n");
+            return 1;
+        }
+        zfree(zl4);
+
+        zl2 = ziplistMerge(&zl, &zl2);
+        /* merge gives us: [hello, foo, quux, 1024, hello, foo, quux, 1024] */
+        ziplistRepr(zl2);
+
+        if (ziplistLen(zl2) != 8) {
+            printf("ERROR: Merged length not 8, but: %u\n", ziplistLen(zl2));
+            return 1;
+        }
+
+        p = ziplistIndex(zl2,0);
+        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
+            printf("ERROR: not \"hello\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
+            printf("ERROR: \"hella\"\n");
+            return 1;
+        }
+
+        p = ziplistIndex(zl2,3);
+        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
+            printf("ERROR: not \"1024\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
+            printf("ERROR: \"1025\"\n");
+            return 1;
+        }
+
+        p = ziplistIndex(zl2,4);
+        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
+            printf("ERROR: not \"hello\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
+            printf("ERROR: \"hella\"\n");
+            return 1;
+        }
+
+        p = ziplistIndex(zl2,7);
+        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
+            printf("ERROR: not \"1024\"\n");
+            return 1;
+        }
+        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
+            printf("ERROR: \"1025\"\n");
+            return 1;
+        }
+        printf("SUCCESS\n\n");
+        zfree(zl);
+    }
+
+    printf("Stress with random payloads of different encoding:\n");
+    {
+        unsigned long long start = usec();
+        int i,j,len,where;
+        unsigned char *p;
+        char buf[1024];
+        int buflen;
+        list *ref;
+        listNode *refnode;
+
+        /* Hold temp vars from ziplist */
+        unsigned char *sstr;
+        unsigned int slen;
+        long long sval;
+
+        iteration = accurate ? 20000 : 20;
+        for (i = 0; i < iteration; i++) {
+            zl = ziplistNew();
+            ref = listCreate();
+            listSetFreeMethod(ref,(void (*)(void*))sdsfree);
+            len = rand() % 256;
+
+            /* Create lists */
+            for (j = 0; j < len; j++) {
+                where = (rand() & 1) ? ZIPLIST_HEAD : ZIPLIST_TAIL;
+                if (rand() % 2) {
+                    buflen = randstring(buf,1,sizeof(buf)-1);
+                } else {
+                    switch(rand() % 3) {
+                    case 0:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()) >> 20);
+                        break;
+                    case 1:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()));
+                        break;
+                    case 2:
+                        buflen = sprintf(buf,"%lld",(0LL + rand()) << 20);
+                        break;
+                    default:
+                        assert(NULL);
+                    }
+                }
+
+                /* Add to ziplist */
+                zl = ziplistPush(zl, (unsigned char*)buf, buflen, where);
+
+                /* Add to reference list */
+                if (where == ZIPLIST_HEAD) {
+                    listAddNodeHead(ref,sdsnewlen(buf, buflen));
+                } else if (where == ZIPLIST_TAIL) {
+                    listAddNodeTail(ref,sdsnewlen(buf, buflen));
+                } else {
+                    assert(NULL);
+                }
+            }
+
+            assert(listLength(ref) == ziplistLen(zl));
+            for (j = 0; j < len; j++) {
+                /* Naive way to get elements, but similar to the stresser
+                 * executed from the Tcl test suite. */
+                p = ziplistIndex(zl,j);
+                refnode = listIndex(ref,j);
+
+                assert(ziplistGet(p,&sstr,&slen,&sval));
+                if (sstr == NULL) {
+                    buflen = sprintf(buf,"%lld",sval);
+                } else {
+                    buflen = slen;
+                    memcpy(buf,sstr,buflen);
+                    buf[buflen] = '\0';
+                }
+                assert(memcmp(buf,listNodeValue(refnode),buflen) == 0);
+            }
+            zfree(zl);
+            listRelease(ref);
+        }
+        printf("Done. usec=%lld\n\n", usec()-start);
+    }
+
+    printf("Stress with variable ziplist size:\n");
+    {
+        unsigned long long start = usec();
+        int maxsize = accurate ? 16384 : 16;
+        stress(ZIPLIST_HEAD,100000,maxsize,256);
+        stress(ZIPLIST_TAIL,100000,maxsize,256);
+        printf("Done. usec=%lld\n\n", usec()-start);
+    }
+
+    /* Benchmarks */
+    {
+        zl = ziplistNew();
+        iteration = accurate ? 100000 : 100;
+        for (int i=0; i<iteration; i++) {
+            char buf[4096] = "asdf";
+            zl = ziplistPush(zl, (unsigned char*)buf, 4, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)buf, 40, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)buf, 400, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)buf, 4000, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"1", 1, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"10", 2, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"100", 3, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"1000", 4, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"10000", 5, ZIPLIST_TAIL);
+            zl = ziplistPush(zl, (unsigned char*)"100000", 6, ZIPLIST_TAIL);
+        }
+
+        printf("Benchmark ziplistFind:\n");
+        {
+            unsigned long long start = usec();
+            for (int i = 0; i < 2000; i++) {
+                unsigned char *fptr = ziplistIndex(zl, ZIPLIST_HEAD);
+                fptr = ziplistFind(zl, fptr, (unsigned char*)"nothing", 7, 1);
+            }
+            printf("%lld\n", usec()-start);
+        }
+
+        printf("Benchmark ziplistIndex:\n");
+        {
+            unsigned long long start = usec();
+            for (int i = 0; i < 2000; i++) {
+                ziplistIndex(zl, 99999);
+            }
+            printf("%lld\n", usec()-start);
+        }
+
+        printf("Benchmark ziplistValidateIntegrity:\n");
+        {
+            unsigned long long start = usec();
+            for (int i = 0; i < 2000; i++) {
+                ziplistValidateIntegrity(zl, ziplistBlobLen(zl), 1, NULL, NULL);
+            }
+            printf("%lld\n", usec()-start);
+        }
+
+        zfree(zl);
+    }
+
+    printf("Stress __ziplistCascadeUpdate:\n");
+    {
+        char data[ZIP_BIG_PREVLEN];
+        zl = ziplistNew();
+        iteration = accurate ? 100000 : 100;
+        for (int i = 0; i < iteration; i++) {
+            zl = ziplistPush(zl, (unsigned char*)data, ZIP_BIG_PREVLEN-4, ZIPLIST_TAIL);
+        }
+        unsigned long long start = usec();
+        zl = ziplistPush(zl, (unsigned char*)data, ZIP_BIG_PREVLEN-3, ZIPLIST_HEAD);
+        printf("Done. usec=%lld\n\n", usec()-start);
+        zfree(zl);
+    }
+
+    printf("Edge cases of __ziplistCascadeUpdate:\n");
+    {
+        /* Inserting a entry with data length greater than ZIP_BIG_PREVLEN-4 
+         * will leads to cascade update. */
+        size_t s1 = ZIP_BIG_PREVLEN-4, s2 = ZIP_BIG_PREVLEN-3;
+        zl = ziplistNew();
+
+        zlentry e[4] = {{.prevrawlensize = 0, .prevrawlen = 0, .lensize = 0,
+                         .len = 0, .headersize = 0, .encoding = 0, .p = NULL}};
+
+        zl = insertHelper(zl, 'a', s1, ZIPLIST_ENTRY_HEAD(zl));
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
+        assert(compareHelper(zl, 'a', s1, 0));
+        ziplistRepr(zl);
+
+        /* No expand. */
+        zl = insertHelper(zl, 'b', s1, ZIPLIST_ENTRY_HEAD(zl));
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
+        assert(compareHelper(zl, 'b', s1, 0));
+
+        assert(e[1].prevrawlensize == 1 && e[1].prevrawlen == strEntryBytesSmall(s1));
+        assert(compareHelper(zl, 'a', s1, 1));
+
+        ziplistRepr(zl);
+
+        /* Expand(tail included). */
+        zl = insertHelper(zl, 'c', s2, ZIPLIST_ENTRY_HEAD(zl));
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
+        assert(compareHelper(zl, 'c', s2, 0));
+
+        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
+        assert(compareHelper(zl, 'b', s1, 1));
+
+        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s1));
+        assert(compareHelper(zl, 'a', s1, 2));
+
+        ziplistRepr(zl);
+
+        /* Expand(only previous head entry). */
+        zl = insertHelper(zl, 'd', s2, ZIPLIST_ENTRY_HEAD(zl));
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
+        assert(compareHelper(zl, 'd', s2, 0));
+
+        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
+        assert(compareHelper(zl, 'c', s2, 1));
+
+        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s2));
+        assert(compareHelper(zl, 'b', s1, 2));
+
+        assert(e[3].prevrawlensize == 5 && e[3].prevrawlen == strEntryBytesLarge(s1));
+        assert(compareHelper(zl, 'a', s1, 3));
+
+        ziplistRepr(zl);
+
+        /* Delete from mid. */
+        unsigned char *p = ziplistIndex(zl, 2);
+        zl = ziplistDelete(zl, &p);
+        verify(zl, e);
+
+        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
+        assert(compareHelper(zl, 'd', s2, 0));
+
+        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
+        assert(compareHelper(zl, 'c', s2, 1));
+
+        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s2));
+        assert(compareHelper(zl, 'a', s1, 2));
+
+        ziplistRepr(zl);
+
+        zfree(zl);
+    }
+
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/ziplist.h b/redis-stable/src/ziplist.h
new file mode 100644
index 00000000..569e1259
--- /dev/null
+++ b/redis-stable/src/ziplist.h
@@ -0,0 +1,74 @@
+/*
+ * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
+ * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _ZIPLIST_H
+#define _ZIPLIST_H
+
+#define ZIPLIST_HEAD 0
+#define ZIPLIST_TAIL 1
+
+/* Each entry in the ziplist is either a string or an integer. */
+typedef struct {
+    /* When string is used, it is provided with the length (slen). */
+    unsigned char *sval;
+    unsigned int slen;
+    /* When integer is used, 'sval' is NULL, and lval holds the value. */
+    long long lval;
+} ziplistEntry;
+
+unsigned char *ziplistNew(void);
+unsigned char *ziplistMerge(unsigned char **first, unsigned char **second);
+unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where);
+unsigned char *ziplistIndex(unsigned char *zl, int index);
+unsigned char *ziplistNext(unsigned char *zl, unsigned char *p);
+unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p);
+unsigned int ziplistGet(unsigned char *p, unsigned char **sval, unsigned int *slen, long long *lval);
+unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
+unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p);
+unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
+unsigned char *ziplistReplace(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
+unsigned int ziplistCompare(unsigned char *p, unsigned char *s, unsigned int slen);
+unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip);
+unsigned int ziplistLen(unsigned char *zl);
+size_t ziplistBlobLen(unsigned char *zl);
+void ziplistRepr(unsigned char *zl);
+typedef int (*ziplistValidateEntryCB)(unsigned char* p, void* userdata);
+int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
+                             ziplistValidateEntryCB entry_cb, void *cb_userdata);
+void ziplistRandomPair(unsigned char *zl, unsigned long total_count, ziplistEntry *key, ziplistEntry *val);
+void ziplistRandomPairs(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals);
+unsigned int ziplistRandomPairsUnique(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals);
+int ziplistSafeToAdd(unsigned char* zl, size_t add);
+
+#ifdef REDIS_TEST
+int ziplistTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif /* _ZIPLIST_H */
diff --git a/redis-stable/src/zipmap.c b/redis-stable/src/zipmap.c
new file mode 100644
index 00000000..21a60884
--- /dev/null
+++ b/redis-stable/src/zipmap.c
@@ -0,0 +1,542 @@
+/* String -> String Map data structure optimized for size.
+ * This file implements a data structure mapping strings to other strings
+ * implementing an O(n) lookup data structure designed to be very memory
+ * efficient.
+ *
+ * The Redis Hash type uses this data structure for hashes composed of a small
+ * number of elements, to switch to a hash table once a given number of
+ * elements is reached.
+ *
+ * Given that many times Redis Hashes are used to represent objects composed
+ * of few fields, this is a very big win in terms of used memory.
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* Memory layout of a zipmap, for the map "foo" => "bar", "hello" => "world":
+ *
+ * <zmlen><len>"foo"<len><free>"bar"<len>"hello"<len><free>"world"
+ *
+ * <zmlen> is 1 byte length that holds the current size of the zipmap.
+ * When the zipmap length is greater than or equal to 254, this value
+ * is not used and the zipmap needs to be traversed to find out the length.
+ *
+ * <len> is the length of the following string (key or value).
+ * <len> lengths are encoded in a single value or in a 5 bytes value.
+ * If the first byte value (as an unsigned 8 bit value) is between 0 and
+ * 253, it's a single-byte length. If it is 254 then a four bytes unsigned
+ * integer follows (in the host byte ordering). A value of 255 is used to
+ * signal the end of the hash.
+ *
+ * <free> is the number of free unused bytes after the string, resulting
+ * from modification of values associated to a key. For instance if "foo"
+ * is set to "bar", and later "foo" will be set to "hi", it will have a
+ * free byte to use if the value will enlarge again later, or even in
+ * order to add a key/value pair if it fits.
+ *
+ * <free> is always an unsigned 8 bit number, because if after an
+ * update operation there are more than a few free bytes, the zipmap will be
+ * reallocated to make sure it is as small as possible.
+ *
+ * The most compact representation of the above two elements hash is actually:
+ *
+ * "\x02\x03foo\x03\x00bar\x05hello\x05\x00world\xff"
+ *
+ * Note that because keys and values are prefixed length "objects",
+ * the lookup will take O(N) where N is the number of elements
+ * in the zipmap and *not* the number of bytes needed to represent the zipmap.
+ * This lowers the constant times considerably.
+ */
+
+#include <stdio.h>
+#include <string.h>
+#include "zmalloc.h"
+#include "endianconv.h"
+
+#define ZIPMAP_BIGLEN 254
+#define ZIPMAP_END 255
+
+/* The following defines the max value for the <free> field described in the
+ * comments above, that is, the max number of trailing bytes in a value. */
+#define ZIPMAP_VALUE_MAX_FREE 4
+
+/* The following macro returns the number of bytes needed to encode the length
+ * for the integer value _l, that is, 1 byte for lengths < ZIPMAP_BIGLEN and
+ * 5 bytes for all the other lengths. */
+#define ZIPMAP_LEN_BYTES(_l) (((_l) < ZIPMAP_BIGLEN) ? 1 : sizeof(unsigned int)+1)
+
+/* Create a new empty zipmap. */
+unsigned char *zipmapNew(void) {
+    unsigned char *zm = zmalloc(2);
+
+    zm[0] = 0; /* Length */
+    zm[1] = ZIPMAP_END;
+    return zm;
+}
+
+/* Decode the encoded length pointed by 'p' */
+static unsigned int zipmapDecodeLength(unsigned char *p) {
+    unsigned int len = *p;
+
+    if (len < ZIPMAP_BIGLEN) return len;
+    memcpy(&len,p+1,sizeof(unsigned int));
+    memrev32ifbe(&len);
+    return len;
+}
+
+static unsigned int zipmapGetEncodedLengthSize(unsigned char *p) {
+    return (*p < ZIPMAP_BIGLEN) ? 1: 5;
+}
+
+/* Encode the length 'l' writing it in 'p'. If p is NULL it just returns
+ * the amount of bytes required to encode such a length. */
+static unsigned int zipmapEncodeLength(unsigned char *p, unsigned int len) {
+    if (p == NULL) {
+        return ZIPMAP_LEN_BYTES(len);
+    } else {
+        if (len < ZIPMAP_BIGLEN) {
+            p[0] = len;
+            return 1;
+        } else {
+            p[0] = ZIPMAP_BIGLEN;
+            memcpy(p+1,&len,sizeof(len));
+            memrev32ifbe(p+1);
+            return 1+sizeof(len);
+        }
+    }
+}
+
+/* Search for a matching key, returning a pointer to the entry inside the
+ * zipmap. Returns NULL if the key is not found.
+ *
+ * If NULL is returned, and totlen is not NULL, it is set to the entire
+ * size of the zipmap, so that the calling function will be able to
+ * reallocate the original zipmap to make room for more entries. */
+static unsigned char *zipmapLookupRaw(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned int *totlen) {
+    unsigned char *p = zm+1, *k = NULL;
+    unsigned int l,llen;
+
+    while(*p != ZIPMAP_END) {
+        unsigned char free;
+
+        /* Match or skip the key */
+        l = zipmapDecodeLength(p);
+        llen = zipmapEncodeLength(NULL,l);
+        if (key != NULL && k == NULL && l == klen && !memcmp(p+llen,key,l)) {
+            /* Only return when the user doesn't care
+             * for the total length of the zipmap. */
+            if (totlen != NULL) {
+                k = p;
+            } else {
+                return p;
+            }
+        }
+        p += llen+l;
+        /* Skip the value as well */
+        l = zipmapDecodeLength(p);
+        p += zipmapEncodeLength(NULL,l);
+        free = p[0];
+        p += l+1+free; /* +1 to skip the free byte */
+    }
+    if (totlen != NULL) *totlen = (unsigned int)(p-zm)+1;
+    return k;
+}
+
+static unsigned long zipmapRequiredLength(unsigned int klen, unsigned int vlen) {
+    unsigned int l;
+
+    l = klen+vlen+3;
+    if (klen >= ZIPMAP_BIGLEN) l += 4;
+    if (vlen >= ZIPMAP_BIGLEN) l += 4;
+    return l;
+}
+
+/* Return the total amount used by a key (encoded length + payload) */
+static unsigned int zipmapRawKeyLength(unsigned char *p) {
+    unsigned int l = zipmapDecodeLength(p);
+    return zipmapEncodeLength(NULL,l) + l;
+}
+
+/* Return the total amount used by a value
+ * (encoded length + single byte free count + payload) */
+static unsigned int zipmapRawValueLength(unsigned char *p) {
+    unsigned int l = zipmapDecodeLength(p);
+    unsigned int used;
+
+    used = zipmapEncodeLength(NULL,l);
+    used += p[used] + 1 + l;
+    return used;
+}
+
+/* If 'p' points to a key, this function returns the total amount of
+ * bytes used to store this entry (entry = key + associated value + trailing
+ * free space if any). */
+static unsigned int zipmapRawEntryLength(unsigned char *p) {
+    unsigned int l = zipmapRawKeyLength(p);
+    return l + zipmapRawValueLength(p+l);
+}
+
+static inline unsigned char *zipmapResize(unsigned char *zm, unsigned int len) {
+    zm = zrealloc(zm, len);
+    zm[len-1] = ZIPMAP_END;
+    return zm;
+}
+
+/* Set key to value, creating the key if it does not already exist.
+ * If 'update' is not NULL, *update is set to 1 if the key was
+ * already preset, otherwise to 0. */
+unsigned char *zipmapSet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char *val, unsigned int vlen, int *update) {
+    unsigned int zmlen, offset;
+    unsigned int freelen, reqlen = zipmapRequiredLength(klen,vlen);
+    unsigned int empty, vempty;
+    unsigned char *p;
+
+    freelen = reqlen;
+    if (update) *update = 0;
+    p = zipmapLookupRaw(zm,key,klen,&zmlen);
+    if (p == NULL) {
+        /* Key not found: enlarge */
+        zm = zipmapResize(zm, zmlen+reqlen);
+        p = zm+zmlen-1;
+        zmlen = zmlen+reqlen;
+
+        /* Increase zipmap length (this is an insert) */
+        if (zm[0] < ZIPMAP_BIGLEN) zm[0]++;
+    } else {
+        /* Key found. Is there enough space for the new value? */
+        /* Compute the total length: */
+        if (update) *update = 1;
+        freelen = zipmapRawEntryLength(p);
+        if (freelen < reqlen) {
+            /* Store the offset of this key within the current zipmap, so
+             * it can be resized. Then, move the tail backwards so this
+             * pair fits at the current position. */
+            offset = p-zm;
+            zm = zipmapResize(zm, zmlen-freelen+reqlen);
+            p = zm+offset;
+
+            /* The +1 in the number of bytes to be moved is caused by the
+             * end-of-zipmap byte. Note: the *original* zmlen is used. */
+            memmove(p+reqlen, p+freelen, zmlen-(offset+freelen+1));
+            zmlen = zmlen-freelen+reqlen;
+            freelen = reqlen;
+        }
+    }
+
+    /* We now have a suitable block where the key/value entry can
+     * be written. If there is too much free space, move the tail
+     * of the zipmap a few bytes to the front and shrink the zipmap,
+     * as we want zipmaps to be very space efficient. */
+    empty = freelen-reqlen;
+    if (empty >= ZIPMAP_VALUE_MAX_FREE) {
+        /* First, move the tail <empty> bytes to the front, then resize
+         * the zipmap to be <empty> bytes smaller. */
+        offset = p-zm;
+        memmove(p+reqlen, p+freelen, zmlen-(offset+freelen+1));
+        zmlen -= empty;
+        zm = zipmapResize(zm, zmlen);
+        p = zm+offset;
+        vempty = 0;
+    } else {
+        vempty = empty;
+    }
+
+    /* Just write the key + value and we are done. */
+    /* Key: */
+    p += zipmapEncodeLength(p,klen);
+    memcpy(p,key,klen);
+    p += klen;
+    /* Value: */
+    p += zipmapEncodeLength(p,vlen);
+    *p++ = vempty;
+    memcpy(p,val,vlen);
+    return zm;
+}
+
+/* Remove the specified key. If 'deleted' is not NULL the pointed integer is
+ * set to 0 if the key was not found, to 1 if it was found and deleted. */
+unsigned char *zipmapDel(unsigned char *zm, unsigned char *key, unsigned int klen, int *deleted) {
+    unsigned int zmlen, freelen;
+    unsigned char *p = zipmapLookupRaw(zm,key,klen,&zmlen);
+    if (p) {
+        freelen = zipmapRawEntryLength(p);
+        memmove(p, p+freelen, zmlen-((p-zm)+freelen+1));
+        zm = zipmapResize(zm, zmlen-freelen);
+
+        /* Decrease zipmap length */
+        if (zm[0] < ZIPMAP_BIGLEN) zm[0]--;
+
+        if (deleted) *deleted = 1;
+    } else {
+        if (deleted) *deleted = 0;
+    }
+    return zm;
+}
+
+/* Call before iterating through elements via zipmapNext() */
+unsigned char *zipmapRewind(unsigned char *zm) {
+    return zm+1;
+}
+
+/* This function is used to iterate through all the zipmap elements.
+ * In the first call the first argument is the pointer to the zipmap + 1.
+ * In the next calls what zipmapNext returns is used as first argument.
+ * Example:
+ *
+ * unsigned char *i = zipmapRewind(my_zipmap);
+ * while((i = zipmapNext(i,&key,&klen,&value,&vlen)) != NULL) {
+ *     printf("%d bytes key at $p\n", klen, key);
+ *     printf("%d bytes value at $p\n", vlen, value);
+ * }
+ */
+unsigned char *zipmapNext(unsigned char *zm, unsigned char **key, unsigned int *klen, unsigned char **value, unsigned int *vlen) {
+    if (zm[0] == ZIPMAP_END) return NULL;
+    if (key) {
+        *key = zm;
+        *klen = zipmapDecodeLength(zm);
+        *key += ZIPMAP_LEN_BYTES(*klen);
+    }
+    zm += zipmapRawKeyLength(zm);
+    if (value) {
+        *value = zm+1;
+        *vlen = zipmapDecodeLength(zm);
+        *value += ZIPMAP_LEN_BYTES(*vlen);
+    }
+    zm += zipmapRawValueLength(zm);
+    return zm;
+}
+
+/* Search a key and retrieve the pointer and len of the associated value.
+ * If the key is found the function returns 1, otherwise 0. */
+int zipmapGet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char **value, unsigned int *vlen) {
+    unsigned char *p;
+
+    if ((p = zipmapLookupRaw(zm,key,klen,NULL)) == NULL) return 0;
+    p += zipmapRawKeyLength(p);
+    *vlen = zipmapDecodeLength(p);
+    *value = p + ZIPMAP_LEN_BYTES(*vlen) + 1;
+    return 1;
+}
+
+/* Return 1 if the key exists, otherwise 0 is returned. */
+int zipmapExists(unsigned char *zm, unsigned char *key, unsigned int klen) {
+    return zipmapLookupRaw(zm,key,klen,NULL) != NULL;
+}
+
+/* Return the number of entries inside a zipmap */
+unsigned int zipmapLen(unsigned char *zm) {
+    unsigned int len = 0;
+    if (zm[0] < ZIPMAP_BIGLEN) {
+        len = zm[0];
+    } else {
+        unsigned char *p = zipmapRewind(zm);
+        while((p = zipmapNext(p,NULL,NULL,NULL,NULL)) != NULL) len++;
+
+        /* Re-store length if small enough */
+        if (len < ZIPMAP_BIGLEN) zm[0] = len;
+    }
+    return len;
+}
+
+/* Return the raw size in bytes of a zipmap, so that we can serialize
+ * the zipmap on disk (or everywhere is needed) just writing the returned
+ * amount of bytes of the C array starting at the zipmap pointer. */
+size_t zipmapBlobLen(unsigned char *zm) {
+    unsigned int totlen;
+    zipmapLookupRaw(zm,NULL,0,&totlen);
+    return totlen;
+}
+
+/* Validate the integrity of the data structure.
+ * when `deep` is 0, only the integrity of the header is validated.
+ * when `deep` is 1, we scan all the entries one by one. */
+int zipmapValidateIntegrity(unsigned char *zm, size_t size, int deep) {
+#define OUT_OF_RANGE(p) ( \
+        (p) < zm + 2 || \
+        (p) > zm + size - 1)
+    unsigned int l, s, e;
+
+    /* check that we can actually read the header (or ZIPMAP_END). */
+    if (size < 2)
+        return 0;
+
+    /* the last byte must be the terminator. */
+    if (zm[size-1] != ZIPMAP_END)
+        return 0;
+
+    if (!deep)
+        return 1;
+
+    unsigned int count = 0;
+    unsigned char *p = zm + 1; /* skip the count */
+    while(*p != ZIPMAP_END) {
+        /* read the field name length encoding type */
+        s = zipmapGetEncodedLengthSize(p);
+        /* make sure the entry length doesn't rech outside the edge of the zipmap */
+        if (OUT_OF_RANGE(p+s))
+            return 0;
+
+        /* read the field name length */
+        l = zipmapDecodeLength(p);
+        p += s; /* skip the encoded field size */
+        p += l; /* skip the field */
+
+        /* make sure the entry doesn't rech outside the edge of the zipmap */
+        if (OUT_OF_RANGE(p))
+            return 0;
+
+        /* read the value length encoding type */
+        s = zipmapGetEncodedLengthSize(p);
+        /* make sure the entry length doesn't rech outside the edge of the zipmap */
+        if (OUT_OF_RANGE(p+s))
+            return 0;
+
+        /* read the value length */
+        l = zipmapDecodeLength(p);
+        p += s; /* skip the encoded value size*/
+        e = *p++; /* skip the encoded free space (always encoded in one byte) */
+        p += l+e; /* skip the value and free space */
+        count++;
+
+        /* make sure the entry doesn't rech outside the edge of the zipmap */
+        if (OUT_OF_RANGE(p))
+            return 0;
+    }
+
+    /* check that the zipmap is not empty. */
+    if (count == 0) return 0;
+
+    /* check that the count in the header is correct */
+    if (zm[0] != ZIPMAP_BIGLEN && zm[0] != count)
+        return 0;
+
+    return 1;
+#undef OUT_OF_RANGE
+}
+
+#ifdef REDIS_TEST
+static void zipmapRepr(unsigned char *p) {
+    unsigned int l;
+
+    printf("{status %u}",*p++);
+    while(1) {
+        if (p[0] == ZIPMAP_END) {
+            printf("{end}");
+            break;
+        } else {
+            unsigned char e;
+
+            l = zipmapDecodeLength(p);
+            printf("{key %u}",l);
+            p += zipmapEncodeLength(NULL,l);
+            if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");
+            p += l;
+
+            l = zipmapDecodeLength(p);
+            printf("{value %u}",l);
+            p += zipmapEncodeLength(NULL,l);
+            e = *p++;
+            if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");
+            p += l+e;
+            if (e) {
+                printf("[");
+                while(e--) printf(".");
+                printf("]");
+            }
+        }
+    }
+    printf("\n");
+}
+
+#define UNUSED(x) (void)(x)
+int zipmapTest(int argc, char *argv[], int accurate) {
+    unsigned char *zm;
+
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+
+    zm = zipmapNew();
+
+    zm = zipmapSet(zm,(unsigned char*) "name",4, (unsigned char*) "foo",3,NULL);
+    zm = zipmapSet(zm,(unsigned char*) "surname",7, (unsigned char*) "foo",3,NULL);
+    zm = zipmapSet(zm,(unsigned char*) "age",3, (unsigned char*) "foo",3,NULL);
+    zipmapRepr(zm);
+
+    zm = zipmapSet(zm,(unsigned char*) "hello",5, (unsigned char*) "world!",6,NULL);
+    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "bar",3,NULL);
+    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "!",1,NULL);
+    zipmapRepr(zm);
+    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "12345",5,NULL);
+    zipmapRepr(zm);
+    zm = zipmapSet(zm,(unsigned char*) "new",3, (unsigned char*) "xx",2,NULL);
+    zm = zipmapSet(zm,(unsigned char*) "noval",5, (unsigned char*) "",0,NULL);
+    zipmapRepr(zm);
+    zm = zipmapDel(zm,(unsigned char*) "new",3,NULL);
+    zipmapRepr(zm);
+
+    printf("\nLook up large key:\n");
+    {
+        unsigned char buf[512];
+        unsigned char *value;
+        unsigned int vlen, i;
+        for (i = 0; i < 512; i++) buf[i] = 'a';
+
+        zm = zipmapSet(zm,buf,512,(unsigned char*) "long",4,NULL);
+        if (zipmapGet(zm,buf,512,&value,&vlen)) {
+            printf("  <long key> is associated to the %d bytes value: %.*s\n",
+                vlen, vlen, value);
+        }
+    }
+
+    printf("\nPerform a direct lookup:\n");
+    {
+        unsigned char *value;
+        unsigned int vlen;
+
+        if (zipmapGet(zm,(unsigned char*) "foo",3,&value,&vlen)) {
+            printf("  foo is associated to the %d bytes value: %.*s\n",
+                vlen, vlen, value);
+        }
+    }
+    printf("\nIterate through elements:\n");
+    {
+        unsigned char *i = zipmapRewind(zm);
+        unsigned char *key, *value;
+        unsigned int klen, vlen;
+
+        while((i = zipmapNext(i,&key,&klen,&value,&vlen)) != NULL) {
+            printf("  %d:%.*s => %d:%.*s\n", klen, klen, key, vlen, vlen, value);
+        }
+    }
+    zfree(zm);
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/zipmap.h b/redis-stable/src/zipmap.h
new file mode 100644
index 00000000..1b34a32a
--- /dev/null
+++ b/redis-stable/src/zipmap.h
@@ -0,0 +1,54 @@
+/* String -> String Map data structure optimized for size.
+ *
+ * See zipmap.c for more info.
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _ZIPMAP_H
+#define _ZIPMAP_H
+
+unsigned char *zipmapNew(void);
+unsigned char *zipmapSet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char *val, unsigned int vlen, int *update);
+unsigned char *zipmapDel(unsigned char *zm, unsigned char *key, unsigned int klen, int *deleted);
+unsigned char *zipmapRewind(unsigned char *zm);
+unsigned char *zipmapNext(unsigned char *zm, unsigned char **key, unsigned int *klen, unsigned char **value, unsigned int *vlen);
+int zipmapGet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char **value, unsigned int *vlen);
+int zipmapExists(unsigned char *zm, unsigned char *key, unsigned int klen);
+unsigned int zipmapLen(unsigned char *zm);
+size_t zipmapBlobLen(unsigned char *zm);
+void zipmapRepr(unsigned char *p);
+int zipmapValidateIntegrity(unsigned char *zm, size_t size, int deep);
+
+#ifdef REDIS_TEST
+int zipmapTest(int argc, char *argv[], int accurate);
+#endif
+
+#endif
diff --git a/redis-stable/src/zmalloc.c b/redis-stable/src/zmalloc.c
new file mode 100644
index 00000000..3645efcf
--- /dev/null
+++ b/redis-stable/src/zmalloc.c
@@ -0,0 +1,699 @@
+/* zmalloc - total amount of allocated memory aware version of malloc()
+ *
+ * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <unistd.h>
+#include <assert.h>
+
+/* This function provide us access to the original libc free(). This is useful
+ * for instance to free results obtained by backtrace_symbols(). We need
+ * to define this function before including zmalloc.h that may shadow the
+ * free implementation if we use jemalloc or another non standard allocator. */
+void zlibc_free(void *ptr) {
+    free(ptr);
+}
+
+#include <string.h>
+#include <pthread.h>
+#include "config.h"
+#include "zmalloc.h"
+#include "atomicvar.h"
+
+#ifdef HAVE_MALLOC_SIZE
+#define PREFIX_SIZE (0)
+#define ASSERT_NO_SIZE_OVERFLOW(sz)
+#else
+#if defined(__sun) || defined(__sparc) || defined(__sparc__)
+#define PREFIX_SIZE (sizeof(long long))
+#else
+#define PREFIX_SIZE (sizeof(size_t))
+#endif
+#define ASSERT_NO_SIZE_OVERFLOW(sz) assert((sz) + PREFIX_SIZE > (sz))
+#endif
+
+/* When using the libc allocator, use a minimum allocation size to match the
+ * jemalloc behavior that doesn't return NULL in this case.
+ */
+#define MALLOC_MIN_SIZE(x) ((x) > 0 ? (x) : sizeof(long))
+
+/* Explicitly override malloc/free etc when using tcmalloc. */
+#if defined(USE_TCMALLOC)
+#define malloc(size) tc_malloc(size)
+#define calloc(count,size) tc_calloc(count,size)
+#define realloc(ptr,size) tc_realloc(ptr,size)
+#define free(ptr) tc_free(ptr)
+#elif defined(USE_JEMALLOC)
+#define malloc(size) je_malloc(size)
+#define calloc(count,size) je_calloc(count,size)
+#define realloc(ptr,size) je_realloc(ptr,size)
+#define free(ptr) je_free(ptr)
+#define mallocx(size,flags) je_mallocx(size,flags)
+#define dallocx(ptr,flags) je_dallocx(ptr,flags)
+#endif
+
+#define update_zmalloc_stat_alloc(__n) atomicIncr(used_memory,(__n))
+#define update_zmalloc_stat_free(__n) atomicDecr(used_memory,(__n))
+
+static redisAtomic size_t used_memory = 0;
+
+static void zmalloc_default_oom(size_t size) {
+    fprintf(stderr, "zmalloc: Out of memory trying to allocate %zu bytes\n",
+        size);
+    fflush(stderr);
+    abort();
+}
+
+static void (*zmalloc_oom_handler)(size_t) = zmalloc_default_oom;
+
+/* Try allocating memory, and return NULL if failed.
+ * '*usable' is set to the usable size if non NULL. */
+void *ztrymalloc_usable(size_t size, size_t *usable) {
+    ASSERT_NO_SIZE_OVERFLOW(size);
+    void *ptr = malloc(MALLOC_MIN_SIZE(size)+PREFIX_SIZE);
+
+    if (!ptr) return NULL;
+#ifdef HAVE_MALLOC_SIZE
+    size = zmalloc_size(ptr);
+    update_zmalloc_stat_alloc(size);
+    if (usable) *usable = size;
+    return ptr;
+#else
+    *((size_t*)ptr) = size;
+    update_zmalloc_stat_alloc(size+PREFIX_SIZE);
+    if (usable) *usable = size;
+    return (char*)ptr+PREFIX_SIZE;
+#endif
+}
+
+/* Allocate memory or panic */
+void *zmalloc(size_t size) {
+    void *ptr = ztrymalloc_usable(size, NULL);
+    if (!ptr) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Try allocating memory, and return NULL if failed. */
+void *ztrymalloc(size_t size) {
+    void *ptr = ztrymalloc_usable(size, NULL);
+    return ptr;
+}
+
+/* Allocate memory or panic.
+ * '*usable' is set to the usable size if non NULL. */
+void *zmalloc_usable(size_t size, size_t *usable) {
+    void *ptr = ztrymalloc_usable(size, usable);
+    if (!ptr) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Allocation and free functions that bypass the thread cache
+ * and go straight to the allocator arena bins.
+ * Currently implemented only for jemalloc. Used for online defragmentation. */
+#ifdef HAVE_DEFRAG
+void *zmalloc_no_tcache(size_t size) {
+    ASSERT_NO_SIZE_OVERFLOW(size);
+    void *ptr = mallocx(size+PREFIX_SIZE, MALLOCX_TCACHE_NONE);
+    if (!ptr) zmalloc_oom_handler(size);
+    update_zmalloc_stat_alloc(zmalloc_size(ptr));
+    return ptr;
+}
+
+void zfree_no_tcache(void *ptr) {
+    if (ptr == NULL) return;
+    update_zmalloc_stat_free(zmalloc_size(ptr));
+    dallocx(ptr, MALLOCX_TCACHE_NONE);
+}
+#endif
+
+/* Try allocating memory and zero it, and return NULL if failed.
+ * '*usable' is set to the usable size if non NULL. */
+void *ztrycalloc_usable(size_t size, size_t *usable) {
+    ASSERT_NO_SIZE_OVERFLOW(size);
+    void *ptr = calloc(1, MALLOC_MIN_SIZE(size)+PREFIX_SIZE);
+    if (ptr == NULL) return NULL;
+
+#ifdef HAVE_MALLOC_SIZE
+    size = zmalloc_size(ptr);
+    update_zmalloc_stat_alloc(size);
+    if (usable) *usable = size;
+    return ptr;
+#else
+    *((size_t*)ptr) = size;
+    update_zmalloc_stat_alloc(size+PREFIX_SIZE);
+    if (usable) *usable = size;
+    return (char*)ptr+PREFIX_SIZE;
+#endif
+}
+
+/* Allocate memory and zero it or panic */
+void *zcalloc(size_t size) {
+    void *ptr = ztrycalloc_usable(size, NULL);
+    if (!ptr) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Try allocating memory, and return NULL if failed. */
+void *ztrycalloc(size_t size) {
+    void *ptr = ztrycalloc_usable(size, NULL);
+    return ptr;
+}
+
+/* Allocate memory or panic.
+ * '*usable' is set to the usable size if non NULL. */
+void *zcalloc_usable(size_t size, size_t *usable) {
+    void *ptr = ztrycalloc_usable(size, usable);
+    if (!ptr) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Try reallocating memory, and return NULL if failed.
+ * '*usable' is set to the usable size if non NULL. */
+void *ztryrealloc_usable(void *ptr, size_t size, size_t *usable) {
+    ASSERT_NO_SIZE_OVERFLOW(size);
+#ifndef HAVE_MALLOC_SIZE
+    void *realptr;
+#endif
+    size_t oldsize;
+    void *newptr;
+
+    /* not allocating anything, just redirect to free. */
+    if (size == 0 && ptr != NULL) {
+        zfree(ptr);
+        if (usable) *usable = 0;
+        return NULL;
+    }
+    /* Not freeing anything, just redirect to malloc. */
+    if (ptr == NULL)
+        return ztrymalloc_usable(size, usable);
+
+#ifdef HAVE_MALLOC_SIZE
+    oldsize = zmalloc_size(ptr);
+    newptr = realloc(ptr,size);
+    if (newptr == NULL) {
+        if (usable) *usable = 0;
+        return NULL;
+    }
+
+    update_zmalloc_stat_free(oldsize);
+    size = zmalloc_size(newptr);
+    update_zmalloc_stat_alloc(size);
+    if (usable) *usable = size;
+    return newptr;
+#else
+    realptr = (char*)ptr-PREFIX_SIZE;
+    oldsize = *((size_t*)realptr);
+    newptr = realloc(realptr,size+PREFIX_SIZE);
+    if (newptr == NULL) {
+        if (usable) *usable = 0;
+        return NULL;
+    }
+
+    *((size_t*)newptr) = size;
+    update_zmalloc_stat_free(oldsize);
+    update_zmalloc_stat_alloc(size);
+    if (usable) *usable = size;
+    return (char*)newptr+PREFIX_SIZE;
+#endif
+}
+
+/* Reallocate memory and zero it or panic */
+void *zrealloc(void *ptr, size_t size) {
+    ptr = ztryrealloc_usable(ptr, size, NULL);
+    if (!ptr && size != 0) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Try Reallocating memory, and return NULL if failed. */
+void *ztryrealloc(void *ptr, size_t size) {
+    ptr = ztryrealloc_usable(ptr, size, NULL);
+    return ptr;
+}
+
+/* Reallocate memory or panic.
+ * '*usable' is set to the usable size if non NULL. */
+void *zrealloc_usable(void *ptr, size_t size, size_t *usable) {
+    ptr = ztryrealloc_usable(ptr, size, usable);
+    if (!ptr && size != 0) zmalloc_oom_handler(size);
+    return ptr;
+}
+
+/* Provide zmalloc_size() for systems where this function is not provided by
+ * malloc itself, given that in that case we store a header with this
+ * information as the first bytes of every allocation. */
+#ifndef HAVE_MALLOC_SIZE
+size_t zmalloc_size(void *ptr) {
+    void *realptr = (char*)ptr-PREFIX_SIZE;
+    size_t size = *((size_t*)realptr);
+    return size+PREFIX_SIZE;
+}
+size_t zmalloc_usable_size(void *ptr) {
+    return zmalloc_size(ptr)-PREFIX_SIZE;
+}
+#endif
+
+void zfree(void *ptr) {
+#ifndef HAVE_MALLOC_SIZE
+    void *realptr;
+    size_t oldsize;
+#endif
+
+    if (ptr == NULL) return;
+#ifdef HAVE_MALLOC_SIZE
+    update_zmalloc_stat_free(zmalloc_size(ptr));
+    free(ptr);
+#else
+    realptr = (char*)ptr-PREFIX_SIZE;
+    oldsize = *((size_t*)realptr);
+    update_zmalloc_stat_free(oldsize+PREFIX_SIZE);
+    free(realptr);
+#endif
+}
+
+/* Similar to zfree, '*usable' is set to the usable size being freed. */
+void zfree_usable(void *ptr, size_t *usable) {
+#ifndef HAVE_MALLOC_SIZE
+    void *realptr;
+    size_t oldsize;
+#endif
+
+    if (ptr == NULL) return;
+#ifdef HAVE_MALLOC_SIZE
+    update_zmalloc_stat_free(*usable = zmalloc_size(ptr));
+    free(ptr);
+#else
+    realptr = (char*)ptr-PREFIX_SIZE;
+    *usable = oldsize = *((size_t*)realptr);
+    update_zmalloc_stat_free(oldsize+PREFIX_SIZE);
+    free(realptr);
+#endif
+}
+
+char *zstrdup(const char *s) {
+    size_t l = strlen(s)+1;
+    char *p = zmalloc(l);
+
+    memcpy(p,s,l);
+    return p;
+}
+
+size_t zmalloc_used_memory(void) {
+    size_t um;
+    atomicGet(used_memory,um);
+    return um;
+}
+
+void zmalloc_set_oom_handler(void (*oom_handler)(size_t)) {
+    zmalloc_oom_handler = oom_handler;
+}
+
+/* Get the RSS information in an OS-specific way.
+ *
+ * WARNING: the function zmalloc_get_rss() is not designed to be fast
+ * and may not be called in the busy loops where Redis tries to release
+ * memory expiring or swapping out objects.
+ *
+ * For this kind of "fast RSS reporting" usages use instead the
+ * function RedisEstimateRSS() that is a much faster (and less precise)
+ * version of the function. */
+
+#if defined(HAVE_PROC_STAT)
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+
+size_t zmalloc_get_rss(void) {
+    int page = sysconf(_SC_PAGESIZE);
+    size_t rss;
+    char buf[4096];
+    char filename[256];
+    int fd, count;
+    char *p, *x;
+
+    snprintf(filename,256,"/proc/%ld/stat",(long) getpid());
+    if ((fd = open(filename,O_RDONLY)) == -1) return 0;
+    if (read(fd,buf,4096) <= 0) {
+        close(fd);
+        return 0;
+    }
+    close(fd);
+
+    p = buf;
+    count = 23; /* RSS is the 24th field in /proc/<pid>/stat */
+    while(p && count--) {
+        p = strchr(p,' ');
+        if (p) p++;
+    }
+    if (!p) return 0;
+    x = strchr(p,' ');
+    if (!x) return 0;
+    *x = '\0';
+
+    rss = strtoll(p,NULL,10);
+    rss *= page;
+    return rss;
+}
+#elif defined(HAVE_TASKINFO)
+#include <sys/types.h>
+#include <sys/sysctl.h>
+#include <mach/task.h>
+#include <mach/mach_init.h>
+
+size_t zmalloc_get_rss(void) {
+    task_t task = MACH_PORT_NULL;
+    struct task_basic_info t_info;
+    mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
+
+    if (task_for_pid(current_task(), getpid(), &task) != KERN_SUCCESS)
+        return 0;
+    task_info(task, TASK_BASIC_INFO, (task_info_t)&t_info, &t_info_count);
+
+    return t_info.resident_size;
+}
+#elif defined(__FreeBSD__) || defined(__DragonFly__)
+#include <sys/types.h>
+#include <sys/sysctl.h>
+#include <sys/user.h>
+
+size_t zmalloc_get_rss(void) {
+    struct kinfo_proc info;
+    size_t infolen = sizeof(info);
+    int mib[4];
+    mib[0] = CTL_KERN;
+    mib[1] = KERN_PROC;
+    mib[2] = KERN_PROC_PID;
+    mib[3] = getpid();
+
+    if (sysctl(mib, 4, &info, &infolen, NULL, 0) == 0)
+#if defined(__FreeBSD__)
+        return (size_t)info.ki_rssize * getpagesize();
+#else
+        return (size_t)info.kp_vm_rssize * getpagesize();
+#endif
+
+    return 0L;
+}
+#elif defined(__NetBSD__)
+#include <sys/types.h>
+#include <sys/sysctl.h>
+
+size_t zmalloc_get_rss(void) {
+    struct kinfo_proc2 info;
+    size_t infolen = sizeof(info);
+    int mib[6];
+    mib[0] = CTL_KERN;
+    mib[1] = KERN_PROC;
+    mib[2] = KERN_PROC_PID;
+    mib[3] = getpid();
+    mib[4] = sizeof(info);
+    mib[5] = 1;
+    if (sysctl(mib, 4, &info, &infolen, NULL, 0) == 0)
+        return (size_t)info.p_vm_rssize * getpagesize();
+
+    return 0L;
+}
+#elif defined(HAVE_PSINFO)
+#include <unistd.h>
+#include <sys/procfs.h>
+#include <fcntl.h>
+
+size_t zmalloc_get_rss(void) {
+    struct prpsinfo info;
+    char filename[256];
+    int fd;
+
+    snprintf(filename,256,"/proc/%ld/psinfo",(long) getpid());
+
+    if ((fd = open(filename,O_RDONLY)) == -1) return 0;
+    if (ioctl(fd, PIOCPSINFO, &info) == -1) {
+        close(fd);
+	return 0;
+    }
+
+    close(fd);
+    return info.pr_rssize;
+}
+#else
+size_t zmalloc_get_rss(void) {
+    /* If we can't get the RSS in an OS-specific way for this system just
+     * return the memory usage we estimated in zmalloc()..
+     *
+     * Fragmentation will appear to be always 1 (no fragmentation)
+     * of course... */
+    return zmalloc_used_memory();
+}
+#endif
+
+#if defined(USE_JEMALLOC)
+
+int zmalloc_get_allocator_info(size_t *allocated,
+                               size_t *active,
+                               size_t *resident) {
+    uint64_t epoch = 1;
+    size_t sz;
+    *allocated = *resident = *active = 0;
+    /* Update the statistics cached by mallctl. */
+    sz = sizeof(epoch);
+    je_mallctl("epoch", &epoch, &sz, &epoch, sz);
+    sz = sizeof(size_t);
+    /* Unlike RSS, this does not include RSS from shared libraries and other non
+     * heap mappings. */
+    je_mallctl("stats.resident", resident, &sz, NULL, 0);
+    /* Unlike resident, this doesn't not include the pages jemalloc reserves
+     * for re-use (purge will clean that). */
+    je_mallctl("stats.active", active, &sz, NULL, 0);
+    /* Unlike zmalloc_used_memory, this matches the stats.resident by taking
+     * into account all allocations done by this process (not only zmalloc). */
+    je_mallctl("stats.allocated", allocated, &sz, NULL, 0);
+    return 1;
+}
+
+void set_jemalloc_bg_thread(int enable) {
+    /* let jemalloc do purging asynchronously, required when there's no traffic 
+     * after flushdb */
+    char val = !!enable;
+    je_mallctl("background_thread", NULL, 0, &val, 1);
+}
+
+int jemalloc_purge() {
+    /* return all unused (reserved) pages to the OS */
+    char tmp[32];
+    unsigned narenas = 0;
+    size_t sz = sizeof(unsigned);
+    if (!je_mallctl("arenas.narenas", &narenas, &sz, NULL, 0)) {
+        sprintf(tmp, "arena.%d.purge", narenas);
+        if (!je_mallctl(tmp, NULL, 0, NULL, 0))
+            return 0;
+    }
+    return -1;
+}
+
+#else
+
+int zmalloc_get_allocator_info(size_t *allocated,
+                               size_t *active,
+                               size_t *resident) {
+    *allocated = *resident = *active = 0;
+    return 1;
+}
+
+void set_jemalloc_bg_thread(int enable) {
+    ((void)(enable));
+}
+
+int jemalloc_purge() {
+    return 0;
+}
+
+#endif
+
+#if defined(__APPLE__)
+/* For proc_pidinfo() used later in zmalloc_get_smap_bytes_by_field().
+ * Note that this file cannot be included in zmalloc.h because it includes
+ * a Darwin queue.h file where there is a "LIST_HEAD" macro (!) defined
+ * conficting with Redis user code. */
+#include <libproc.h>
+#endif
+
+/* Get the sum of the specified field (converted form kb to bytes) in
+ * /proc/self/smaps. The field must be specified with trailing ":" as it
+ * apperas in the smaps output.
+ *
+ * If a pid is specified, the information is extracted for such a pid,
+ * otherwise if pid is -1 the information is reported is about the
+ * current process.
+ *
+ * Example: zmalloc_get_smap_bytes_by_field("Rss:",-1);
+ */
+#if defined(HAVE_PROC_SMAPS)
+size_t zmalloc_get_smap_bytes_by_field(char *field, long pid) {
+    char line[1024];
+    size_t bytes = 0;
+    int flen = strlen(field);
+    FILE *fp;
+
+    if (pid == -1) {
+        fp = fopen("/proc/self/smaps","r");
+    } else {
+        char filename[128];
+        snprintf(filename,sizeof(filename),"/proc/%ld/smaps",pid);
+        fp = fopen(filename,"r");
+    }
+
+    if (!fp) return 0;
+    while(fgets(line,sizeof(line),fp) != NULL) {
+        if (strncmp(line,field,flen) == 0) {
+            char *p = strchr(line,'k');
+            if (p) {
+                *p = '\0';
+                bytes += strtol(line+flen,NULL,10) * 1024;
+            }
+        }
+    }
+    fclose(fp);
+    return bytes;
+}
+#else
+/* Get sum of the specified field from libproc api call.
+ * As there are per page value basis we need to convert
+ * them accordingly.
+ *
+ * Note that AnonHugePages is a no-op as THP feature
+ * is not supported in this platform
+ */
+size_t zmalloc_get_smap_bytes_by_field(char *field, long pid) {
+#if defined(__APPLE__)
+    struct proc_regioninfo pri;
+    if (pid == -1) pid = getpid();
+    if (proc_pidinfo(pid, PROC_PIDREGIONINFO, 0, &pri,
+                     PROC_PIDREGIONINFO_SIZE) == PROC_PIDREGIONINFO_SIZE)
+    {
+        int pagesize = getpagesize();
+        if (!strcmp(field, "Private_Dirty:")) {
+            return (size_t)pri.pri_pages_dirtied * pagesize;
+        } else if (!strcmp(field, "Rss:")) {
+            return (size_t)pri.pri_pages_resident * pagesize;
+        } else if (!strcmp(field, "AnonHugePages:")) {
+            return 0;
+        }
+    }
+    return 0;
+#endif
+    ((void) field);
+    ((void) pid);
+    return 0;
+}
+#endif
+
+/* Return the total number bytes in pages marked as Private Dirty.
+ *
+ * Note: depending on the platform and memory footprint of the process, this
+ * call can be slow, exceeding 1000ms!
+ */
+size_t zmalloc_get_private_dirty(long pid) {
+    return zmalloc_get_smap_bytes_by_field("Private_Dirty:",pid);
+}
+
+/* Returns the size of physical memory (RAM) in bytes.
+ * It looks ugly, but this is the cleanest way to achieve cross platform results.
+ * Cleaned up from:
+ *
+ * http://nadeausoftware.com/articles/2012/09/c_c_tip_how_get_physical_memory_size_system
+ *
+ * Note that this function:
+ * 1) Was released under the following CC attribution license:
+ *    http://creativecommons.org/licenses/by/3.0/deed.en_US.
+ * 2) Was originally implemented by David Robert Nadeau.
+ * 3) Was modified for Redis by Matt Stancliff.
+ * 4) This note exists in order to comply with the original license.
+ */
+size_t zmalloc_get_memory_size(void) {
+#if defined(__unix__) || defined(__unix) || defined(unix) || \
+    (defined(__APPLE__) && defined(__MACH__))
+#if defined(CTL_HW) && (defined(HW_MEMSIZE) || defined(HW_PHYSMEM64))
+    int mib[2];
+    mib[0] = CTL_HW;
+#if defined(HW_MEMSIZE)
+    mib[1] = HW_MEMSIZE;            /* OSX. --------------------- */
+#elif defined(HW_PHYSMEM64)
+    mib[1] = HW_PHYSMEM64;          /* NetBSD, OpenBSD. --------- */
+#endif
+    int64_t size = 0;               /* 64-bit */
+    size_t len = sizeof(size);
+    if (sysctl( mib, 2, &size, &len, NULL, 0) == 0)
+        return (size_t)size;
+    return 0L;          /* Failed? */
+
+#elif defined(_SC_PHYS_PAGES) && defined(_SC_PAGESIZE)
+    /* FreeBSD, Linux, OpenBSD, and Solaris. -------------------- */
+    return (size_t)sysconf(_SC_PHYS_PAGES) * (size_t)sysconf(_SC_PAGESIZE);
+
+#elif defined(CTL_HW) && (defined(HW_PHYSMEM) || defined(HW_REALMEM))
+    /* DragonFly BSD, FreeBSD, NetBSD, OpenBSD, and OSX. -------- */
+    int mib[2];
+    mib[0] = CTL_HW;
+#if defined(HW_REALMEM)
+    mib[1] = HW_REALMEM;        /* FreeBSD. ----------------- */
+#elif defined(HW_PHYSMEM)
+    mib[1] = HW_PHYSMEM;        /* Others. ------------------ */
+#endif
+    unsigned int size = 0;      /* 32-bit */
+    size_t len = sizeof(size);
+    if (sysctl(mib, 2, &size, &len, NULL, 0) == 0)
+        return (size_t)size;
+    return 0L;          /* Failed? */
+#else
+    return 0L;          /* Unknown method to get the data. */
+#endif
+#else
+    return 0L;          /* Unknown OS. */
+#endif
+}
+
+#ifdef REDIS_TEST
+#define UNUSED(x) ((void)(x))
+int zmalloc_test(int argc, char **argv, int accurate) {
+    void *ptr;
+
+    UNUSED(argc);
+    UNUSED(argv);
+    UNUSED(accurate);
+    printf("Malloc prefix size: %d\n", (int) PREFIX_SIZE);
+    printf("Initial used memory: %zu\n", zmalloc_used_memory());
+    ptr = zmalloc(123);
+    printf("Allocated 123 bytes; used: %zu\n", zmalloc_used_memory());
+    ptr = zrealloc(ptr, 456);
+    printf("Reallocated to 456 bytes; used: %zu\n", zmalloc_used_memory());
+    zfree(ptr);
+    printf("Freed pointer; used: %zu\n", zmalloc_used_memory());
+    return 0;
+}
+#endif
diff --git a/redis-stable/src/zmalloc.h b/redis-stable/src/zmalloc.h
new file mode 100644
index 00000000..bb4cbddb
--- /dev/null
+++ b/redis-stable/src/zmalloc.h
@@ -0,0 +1,141 @@
+/* zmalloc - total amount of allocated memory aware version of malloc()
+ *
+ * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef __ZMALLOC_H
+#define __ZMALLOC_H
+
+/* Double expansion needed for stringification of macro values. */
+#define __xstr(s) __str(s)
+#define __str(s) #s
+
+#if defined(USE_TCMALLOC)
+#define ZMALLOC_LIB ("tcmalloc-" __xstr(TC_VERSION_MAJOR) "." __xstr(TC_VERSION_MINOR))
+#include <google/tcmalloc.h>
+#if (TC_VERSION_MAJOR == 1 && TC_VERSION_MINOR >= 6) || (TC_VERSION_MAJOR > 1)
+#define HAVE_MALLOC_SIZE 1
+#define zmalloc_size(p) tc_malloc_size(p)
+#else
+#error "Newer version of tcmalloc required"
+#endif
+
+#elif defined(USE_JEMALLOC)
+#define ZMALLOC_LIB ("jemalloc-" __xstr(JEMALLOC_VERSION_MAJOR) "." __xstr(JEMALLOC_VERSION_MINOR) "." __xstr(JEMALLOC_VERSION_BUGFIX))
+#include <jemalloc/jemalloc.h>
+#if (JEMALLOC_VERSION_MAJOR == 2 && JEMALLOC_VERSION_MINOR >= 1) || (JEMALLOC_VERSION_MAJOR > 2)
+#define HAVE_MALLOC_SIZE 1
+#define zmalloc_size(p) je_malloc_usable_size(p)
+#else
+#error "Newer version of jemalloc required"
+#endif
+
+#elif defined(__APPLE__)
+#include <malloc/malloc.h>
+#define HAVE_MALLOC_SIZE 1
+#define zmalloc_size(p) malloc_size(p)
+#endif
+
+/* On native libc implementations, we should still do our best to provide a
+ * HAVE_MALLOC_SIZE capability. This can be set explicitly as well:
+ *
+ * NO_MALLOC_USABLE_SIZE disables it on all platforms, even if they are
+ *      known to support it.
+ * USE_MALLOC_USABLE_SIZE forces use of malloc_usable_size() regardless
+ *      of platform.
+ */
+#ifndef ZMALLOC_LIB
+#define ZMALLOC_LIB "libc"
+
+#if !defined(NO_MALLOC_USABLE_SIZE) && \
+    (defined(__GLIBC__) || defined(__FreeBSD__) || \
+     defined(USE_MALLOC_USABLE_SIZE))
+
+/* Includes for malloc_usable_size() */
+#ifdef __FreeBSD__
+#include <malloc_np.h>
+#else
+#include <malloc.h>
+#endif
+
+#define HAVE_MALLOC_SIZE 1
+#define zmalloc_size(p) malloc_usable_size(p)
+
+#endif
+#endif
+
+/* We can enable the Redis defrag capabilities only if we are using Jemalloc
+ * and the version used is our special version modified for Redis having
+ * the ability to return per-allocation fragmentation hints. */
+#if defined(USE_JEMALLOC) && defined(JEMALLOC_FRAG_HINT)
+#define HAVE_DEFRAG
+#endif
+
+void *zmalloc(size_t size);
+void *zcalloc(size_t size);
+void *zrealloc(void *ptr, size_t size);
+void *ztrymalloc(size_t size);
+void *ztrycalloc(size_t size);
+void *ztryrealloc(void *ptr, size_t size);
+void zfree(void *ptr);
+void *zmalloc_usable(size_t size, size_t *usable);
+void *zcalloc_usable(size_t size, size_t *usable);
+void *zrealloc_usable(void *ptr, size_t size, size_t *usable);
+void *ztrymalloc_usable(size_t size, size_t *usable);
+void *ztrycalloc_usable(size_t size, size_t *usable);
+void *ztryrealloc_usable(void *ptr, size_t size, size_t *usable);
+void zfree_usable(void *ptr, size_t *usable);
+char *zstrdup(const char *s);
+size_t zmalloc_used_memory(void);
+void zmalloc_set_oom_handler(void (*oom_handler)(size_t));
+size_t zmalloc_get_rss(void);
+int zmalloc_get_allocator_info(size_t *allocated, size_t *active, size_t *resident);
+void set_jemalloc_bg_thread(int enable);
+int jemalloc_purge();
+size_t zmalloc_get_private_dirty(long pid);
+size_t zmalloc_get_smap_bytes_by_field(char *field, long pid);
+size_t zmalloc_get_memory_size(void);
+void zlibc_free(void *ptr);
+
+#ifdef HAVE_DEFRAG
+void zfree_no_tcache(void *ptr);
+void *zmalloc_no_tcache(size_t size);
+#endif
+
+#ifndef HAVE_MALLOC_SIZE
+size_t zmalloc_size(void *ptr);
+size_t zmalloc_usable_size(void *ptr);
+#else
+#define zmalloc_usable_size(p) zmalloc_size(p)
+#endif
+
+#ifdef REDIS_TEST
+int zmalloc_test(int argc, char **argv, int accurate);
+#endif
+
+#endif /* __ZMALLOC_H */
diff --git a/redis-stable/tests/assets/corrupt_empty_keys.rdb b/redis-stable/tests/assets/corrupt_empty_keys.rdb
new file mode 100644
index 0000000000000000000000000000000000000000..8f260d49333fbe04e749d0d4ea2f9a7349994cc1
GIT binary patch
literal 261
zcmWG?b@2=~Ffg$E#aWb^l3A=<mRiJZWNNAh#lN^9!bzDW#RnXIu_l*f=B6H!*A-0s
z#Zg+EnxdPVntN!$FCK<pJc;>fx&=k4iMdHRsRtPTG5qFWU}4EfEY4tHVlGZCVc_AZ
z0#fl+nFTqS#U<R_3=9lhK+M4KpO*)u44Vuq3rG(G7Y|4aHU)fqV41?w%;anki-AuD
bRUke!x1gjFrj-%d+W+2-JHH3bzRv;x7j#nz

literal 0
HcmV?d00001

diff --git a/redis-stable/tests/assets/corrupt_ziplist.rdb b/redis-stable/tests/assets/corrupt_ziplist.rdb
new file mode 100644
index 0000000000000000000000000000000000000000..b40ada8d634d094ba2f20d728f20b19596e3e7ef
GIT binary patch
literal 1415
zcmaJ>yH3ME5WE!T6@e)D2D(_g=jTyTKtT%yJ;@ao7$n<4$tUnlG*No~f$uO9#!1cy
z*|V&CI%%|?ot<6X?e*2o9T6q<VPR)kIeE3k*cjuxQy=Z%hpZ}Bm$f&ovfQrU)W>~&
zFfZ+FlG}X!`94<P>MK_2^wBOaS~?d==q)zU!&yf={A4d*K4oP!@_nV$d3(I}+y1iu
z&()~2>C61Nvc;cTI$n)>btn+(lX1ELPr^eUtzCYvzbM9d*I!=`yS@i_ig{uQPjG&y
zy{3)DaZjgVn9o|!Pgo}tVIIahnXzxo0py_+*QFHeClYX>E=5=;8Qd3{ZcloCh5}D2
z%q77(nK4c&o(mJkN%B);{rtPnVE+R>+<$}TNQr=_xGrg--&n|J!OsZiGYkI2!oEp<
bM#3J39Y65RY~Brk>u~62;CyS^7jGLs8LoRE

literal 0
HcmV?d00001

diff --git a/redis-stable/tests/assets/default.conf b/redis-stable/tests/assets/default.conf
new file mode 100644
index 00000000..d7b8a75c
--- /dev/null
+++ b/redis-stable/tests/assets/default.conf
@@ -0,0 +1,27 @@
+# Redis configuration for testing.
+
+always-show-logo yes
+notify-keyspace-events KEA
+daemonize no
+pidfile /var/run/redis.pid
+port 6379
+timeout 0
+bind 127.0.0.1
+loglevel verbose
+logfile ''
+databases 16
+latency-monitor-threshold 1
+
+save 900 1
+save 300 10
+save 60 10000
+
+rdbcompression yes
+dbfilename dump.rdb
+dir ./
+
+slave-serve-stale-data yes
+appendonly no
+appendfsync everysec
+no-appendfsync-on-rewrite no
+activerehashing yes
diff --git a/redis-stable/tests/assets/encodings.rdb b/redis-stable/tests/assets/encodings.rdb
new file mode 100644
index 0000000000000000000000000000000000000000..9fd9b705d16220065ee117a1c1c094f40fb122f2
GIT binary patch
literal 667
zcmbVKu}UOC5UuKJ7oAzb-~v%NHW5S&dS+bpFfmX#Qw_|N?w&>$M|aur5EcU?;j)7>
zGV&XY4SF>ZBR^rkz`zf1tzKQwOdP0r-Cfn)uU@~+^|g&HrPRU;knEK1xGIbhsS?(T
zOp!5$Ql%uLiRxVU_K~%gGG1r2V@aAV)EAeQf1$=iXe|<j22;{nQ=$}F%p{Ms<cW%_
ze93O7(Q3JTH<=IsAUO~O5Ram`Xq3aeQk<FL7zOYM(hCl*LQQB0Ej?bHBUE~DbLEiB
z`cNs4+l`~W__r&HW^KFKE^?^a=3%St%Ccb!cQ>~B7q#x40{=g8Nhbr35aH0(af04|
z31?FkfXdOIL*v>$`m`ZiW?H~$fQQSK0B})18Q{+2^#ErNo(A|lG8gy_c?x0;Mx(`{
zoa#1QiP|F?FVK2I8DyCB=mk$S8nlC&4|~3w8;|#Ox&QtGwHmXU=HND1)gUq}8+2xM
zS?Yc@4yO2OwUpuPICQ~2@KI=m_~m`huJS+FRQ_l1RQDc;oztC1%JaPY56L<A!Cyg&
F{wu@0q2B-i

literal 0
HcmV?d00001

diff --git a/redis-stable/tests/assets/hash-zipmap.rdb b/redis-stable/tests/assets/hash-zipmap.rdb
new file mode 100644
index 0000000000000000000000000000000000000000..27a42ed4bb494cee9d67b7f0feccce7e4136d50a
GIT binary patch
literal 35
pcmWG?b@2=~FfcIw$H2*wkyxA|z{Heh$iz@)$dqOTq>TRm2LPS*34j0q

literal 0
HcmV?d00001

diff --git a/redis-stable/tests/assets/minimal.conf b/redis-stable/tests/assets/minimal.conf
new file mode 100644
index 00000000..ae14ae87
--- /dev/null
+++ b/redis-stable/tests/assets/minimal.conf
@@ -0,0 +1,5 @@
+# Minimal configuration for testing.
+always-show-logo yes
+daemonize no
+pidfile /var/run/redis.pid
+loglevel verbose
diff --git a/redis-stable/tests/assets/nodefaultuser.acl b/redis-stable/tests/assets/nodefaultuser.acl
new file mode 100644
index 00000000..2557c7fe
--- /dev/null
+++ b/redis-stable/tests/assets/nodefaultuser.acl
@@ -0,0 +1,2 @@
+user alice on nopass ~* +@all
+user bob on nopass ~* &* +@all
\ No newline at end of file
diff --git a/redis-stable/tests/assets/user.acl b/redis-stable/tests/assets/user.acl
new file mode 100644
index 00000000..67303512
--- /dev/null
+++ b/redis-stable/tests/assets/user.acl
@@ -0,0 +1,3 @@
+user alice on allcommands allkeys >alice
+user bob on -@all +@set +acl ~set* >bob
+user default on nopass ~* +@all
diff --git a/redis-stable/tests/cluster/cluster.tcl b/redis-stable/tests/cluster/cluster.tcl
new file mode 100644
index 00000000..e9578928
--- /dev/null
+++ b/redis-stable/tests/cluster/cluster.tcl
@@ -0,0 +1,177 @@
+# Cluster-specific test functions.
+#
+# Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
+# This software is released under the BSD License. See the COPYING file for
+# more information.
+
+# Track cluster configuration as created by create_cluster below
+set ::cluster_master_nodes 0
+set ::cluster_replica_nodes 0
+
+# Returns a parsed CLUSTER NODES output as a list of dictionaries.
+proc get_cluster_nodes id {
+    set lines [split [R $id cluster nodes] "\r\n"]
+    set nodes {}
+    foreach l $lines {
+        set l [string trim $l]
+        if {$l eq {}} continue
+        set args [split $l]
+        set node [dict create \
+            id [lindex $args 0] \
+            addr [lindex $args 1] \
+            flags [split [lindex $args 2] ,] \
+            slaveof [lindex $args 3] \
+            ping_sent [lindex $args 4] \
+            pong_recv [lindex $args 5] \
+            config_epoch [lindex $args 6] \
+            linkstate [lindex $args 7] \
+            slots [lrange $args 8 end] \
+        ]
+        lappend nodes $node
+    }
+    return $nodes
+}
+
+# Test node for flag.
+proc has_flag {node flag} {
+    expr {[lsearch -exact [dict get $node flags] $flag] != -1}
+}
+
+# Returns the parsed myself node entry as a dictionary.
+proc get_myself id {
+    set nodes [get_cluster_nodes $id]
+    foreach n $nodes {
+        if {[has_flag $n myself]} {return $n}
+    }
+    return {}
+}
+
+# Get a specific node by ID by parsing the CLUSTER NODES output
+# of the instance Number 'instance_id'
+proc get_node_by_id {instance_id node_id} {
+    set nodes [get_cluster_nodes $instance_id]
+    foreach n $nodes {
+        if {[dict get $n id] eq $node_id} {return $n}
+    }
+    return {}
+}
+
+# Return the value of the specified CLUSTER INFO field.
+proc CI {n field} {
+    get_info_field [R $n cluster info] $field
+}
+
+# Return the value of the specified INFO field.
+proc s {n field} {
+    get_info_field [R $n info] $field
+}
+
+# Assuming nodes are reest, this function performs slots allocation.
+# Only the first 'n' nodes are used.
+proc cluster_allocate_slots {n} {
+    set slot 16383
+    while {$slot >= 0} {
+        # Allocate successive slots to random nodes.
+        set node [randomInt $n]
+        lappend slots_$node $slot
+        incr slot -1
+    }
+    for {set j 0} {$j < $n} {incr j} {
+        R $j cluster addslots {*}[set slots_${j}]
+    }
+}
+
+# Check that cluster nodes agree about "state", or raise an error.
+proc assert_cluster_state {state} {
+    foreach_redis_id id {
+        if {[instance_is_killed redis $id]} continue
+        wait_for_condition 1000 50 {
+            [CI $id cluster_state] eq $state
+        } else {
+            fail "Cluster node $id cluster_state:[CI $id cluster_state]"
+        }
+    }
+}
+
+# Search the first node starting from ID $first that is not
+# already configured as a slave.
+proc cluster_find_available_slave {first} {
+    foreach_redis_id id {
+        if {$id < $first} continue
+        if {[instance_is_killed redis $id]} continue
+        set me [get_myself $id]
+        if {[dict get $me slaveof] eq {-}} {return $id}
+    }
+    fail "No available slaves"
+}
+
+# Add 'slaves' slaves to a cluster composed of 'masters' masters.
+# It assumes that masters are allocated sequentially from instance ID 0
+# to N-1.
+proc cluster_allocate_slaves {masters slaves} {
+    for {set j 0} {$j < $slaves} {incr j} {
+        set master_id [expr {$j % $masters}]
+        set slave_id [cluster_find_available_slave $masters]
+        set master_myself [get_myself $master_id]
+        R $slave_id cluster replicate [dict get $master_myself id]
+    }
+}
+
+# Create a cluster composed of the specified number of masters and slaves.
+proc create_cluster {masters slaves} {
+    cluster_allocate_slots $masters
+    if {$slaves} {
+        cluster_allocate_slaves $masters $slaves
+    }
+    assert_cluster_state ok
+
+    set ::cluster_master_nodes $masters
+    set ::cluster_replica_nodes $slaves
+}
+
+# Set the cluster node-timeout to all the reachalbe nodes.
+proc set_cluster_node_timeout {to} {
+    foreach_redis_id id {
+        catch {R $id CONFIG SET cluster-node-timeout $to}
+    }
+}
+
+# Check if the cluster is writable and readable. Use node "id"
+# as a starting point to talk with the cluster.
+proc cluster_write_test {id} {
+    set prefix [randstring 20 20 alpha]
+    set port [get_instance_attrib redis $id port]
+    set cluster [redis_cluster 127.0.0.1:$port]
+    for {set j 0} {$j < 100} {incr j} {
+        $cluster set key.$j $prefix.$j
+    }
+    for {set j 0} {$j < 100} {incr j} {
+        assert {[$cluster get key.$j] eq "$prefix.$j"}
+    }
+    $cluster close
+}
+
+# Check if cluster configuration is consistent.
+proc cluster_config_consistent {} {
+    for {set j 0} {$j < $::cluster_master_nodes + $::cluster_replica_nodes} {incr j} {
+        if {$j == 0} {
+            set base_cfg [R $j cluster slots]
+        } else {
+            set cfg [R $j cluster slots]
+            if {$cfg != $base_cfg} {
+                return 0
+            }
+        }
+    }
+
+    return 1
+}
+
+# Wait for cluster configuration to propagate and be consistent across nodes.
+proc wait_for_cluster_propagation {} {
+    wait_for_condition 50 100 {
+        [cluster_config_consistent] eq 1
+    } else {
+        fail "cluster config did not reach a consistent state"
+    }
+}
diff --git a/redis-stable/tests/cluster/run.tcl b/redis-stable/tests/cluster/run.tcl
new file mode 100644
index 00000000..d9a7d7ee
--- /dev/null
+++ b/redis-stable/tests/cluster/run.tcl
@@ -0,0 +1,29 @@
+# Cluster test suite. Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
+# This software is released under the BSD License. See the COPYING file for
+# more information.
+
+cd tests/cluster
+source cluster.tcl
+source ../instances.tcl
+source ../../support/cluster.tcl ; # Redis Cluster client.
+
+set ::instances_count 20 ; # How many instances we use at max.
+set ::tlsdir "../../tls"
+
+proc main {} {
+    parse_options
+    spawn_instance redis $::redis_base_port $::instances_count {
+        "cluster-enabled yes"
+        "appendonly yes"
+    }
+    run_tests
+    cleanup
+    end_tests
+}
+
+if {[catch main e]} {
+    puts $::errorInfo
+    if {$::pause_on_error} pause_on_error
+    cleanup
+    exit 1
+}
diff --git a/redis-stable/tests/cluster/tests/00-base.tcl b/redis-stable/tests/cluster/tests/00-base.tcl
new file mode 100644
index 00000000..280befb9
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/00-base.tcl
@@ -0,0 +1,59 @@
+# Check the basic monitoring and failover capabilities.
+
+source "../tests/includes/init-tests.tcl"
+
+if {$::simulate_error} {
+    test "This test will fail" {
+        fail "Simulated error"
+    }
+}
+
+test "Different nodes have different IDs" {
+    set ids {}
+    set numnodes 0
+    foreach_redis_id id {
+        incr numnodes
+        # Every node should just know itself.
+        set nodeid [dict get [get_myself $id] id]
+        assert {$nodeid ne {}}
+        lappend ids $nodeid
+    }
+    set numids [llength [lsort -unique $ids]]
+    assert {$numids == $numnodes}
+}
+
+test "It is possible to perform slot allocation" {
+    cluster_allocate_slots 5
+}
+
+test "After the join, every node gets a different config epoch" {
+    set trynum 60
+    while {[incr trynum -1] != 0} {
+        # We check that this condition is true for *all* the nodes.
+        set ok 1 ; # Will be set to 0 every time a node is not ok.
+        foreach_redis_id id {
+            set epochs {}
+            foreach n [get_cluster_nodes $id] {
+                lappend epochs [dict get $n config_epoch]
+            }
+            if {[lsort $epochs] != [lsort -unique $epochs]} {
+                set ok 0 ; # At least one collision!
+            }
+        }
+        if {$ok} break
+        after 1000
+        puts -nonewline .
+        flush stdout
+    }
+    if {$trynum == 0} {
+        fail "Config epoch conflict resolution is not working."
+    }
+}
+
+test "Nodes should report cluster_state is ok now" {
+    assert_cluster_state ok
+}
+
+test "It is possible to write and read from the cluster" {
+    cluster_write_test 0
+}
diff --git a/redis-stable/tests/cluster/tests/01-faildet.tcl b/redis-stable/tests/cluster/tests/01-faildet.tcl
new file mode 100644
index 00000000..8fe87c91
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/01-faildet.tcl
@@ -0,0 +1,38 @@
+# Check the basic monitoring and failover capabilities.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+test "Killing two slave nodes" {
+    kill_instance redis 5
+    kill_instance redis 6
+}
+
+test "Cluster should be still up" {
+    assert_cluster_state ok
+}
+
+test "Killing one master node" {
+    kill_instance redis 0
+}
+
+# Note: the only slave of instance 0 is already down so no
+# failover is possible, that would change the state back to ok.
+test "Cluster should be down now" {
+    assert_cluster_state fail
+}
+
+test "Restarting master node" {
+    restart_instance redis 0
+}
+
+test "Cluster should be up again" {
+    assert_cluster_state ok
+}
diff --git a/redis-stable/tests/cluster/tests/02-failover.tcl b/redis-stable/tests/cluster/tests/02-failover.tcl
new file mode 100644
index 00000000..6b2fd09a
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/02-failover.tcl
@@ -0,0 +1,65 @@
+# Check the basic monitoring and failover capabilities.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+set current_epoch [CI 1 cluster_current_epoch]
+
+test "Killing one master node" {
+    kill_instance redis 0
+}
+
+test "Wait for failover" {
+    wait_for_condition 1000 50 {
+        [CI 1 cluster_current_epoch] > $current_epoch
+    } else {
+        fail "No failover detected"
+    }
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 1
+}
+
+test "Instance #5 is now a master" {
+    assert {[RI 5 role] eq {master}}
+}
+
+test "Restarting the previously killed master node" {
+    restart_instance redis 0
+}
+
+test "Instance #0 gets converted into a slave" {
+    wait_for_condition 1000 50 {
+        [RI 0 role] eq {slave}
+    } else {
+        fail "Old master was not converted into slave"
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/03-failover-loop.tcl b/redis-stable/tests/cluster/tests/03-failover-loop.tcl
new file mode 100644
index 00000000..8e1bcd6f
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/03-failover-loop.tcl
@@ -0,0 +1,115 @@
+# Failover stress test.
+# In this test a different node is killed in a loop for N
+# iterations. The test checks that certain properties
+# are preseved across iterations.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+set iterations 20
+set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+
+while {[incr iterations -1]} {
+    set tokill [randomInt 10]
+    set other [expr {($tokill+1)%10}] ; # Some other instance.
+    set key [randstring 20 20 alpha]
+    set val [randstring 20 20 alpha]
+    set role [RI $tokill role]
+    if {$role eq {master}} {
+        set slave {}
+        set myid [dict get [get_myself $tokill] id]
+        foreach_redis_id id {
+            if {$id == $tokill} continue
+            if {[dict get [get_myself $id] slaveof] eq $myid} {
+                set slave $id
+            }
+        }
+        if {$slave eq {}} {
+            fail "Unable to retrieve slave's ID for master #$tokill"
+        }
+    }
+
+    puts "--- Iteration $iterations ---"
+
+    if {$role eq {master}} {
+        test "Wait for slave of #$tokill to sync" {
+            wait_for_condition 1000 50 {
+                [string match {*state=online*} [RI $tokill slave0]]
+            } else {
+                fail "Slave of node #$tokill is not ok"
+            }
+        }
+        set slave_config_epoch [CI $slave cluster_my_epoch]
+    }
+
+    test "Cluster is writable before failover" {
+        for {set i 0} {$i < 100} {incr i} {
+            catch {$cluster set $key:$i $val:$i} err
+            assert {$err eq {OK}}
+        }
+        # Wait for the write to propagate to the slave if we
+        # are going to kill a master.
+        if {$role eq {master}} {
+            R $tokill wait 1 20000
+        }
+    }
+
+    test "Killing node #$tokill" {
+        kill_instance redis $tokill
+    }
+
+    if {$role eq {master}} {
+        test "Wait failover by #$slave with old epoch $slave_config_epoch" {
+            wait_for_condition 1000 50 {
+                [CI $slave cluster_my_epoch] > $slave_config_epoch
+            } else {
+                fail "No failover detected, epoch is still [CI $slave cluster_my_epoch]"
+            }
+        }
+    }
+
+    test "Cluster should eventually be up again" {
+        assert_cluster_state ok
+    }
+
+    test "Cluster is writable again" {
+        for {set i 0} {$i < 100} {incr i} {
+            catch {$cluster set $key:$i:2 $val:$i:2} err
+            assert {$err eq {OK}}
+        }
+    }
+
+    test "Restarting node #$tokill" {
+        restart_instance redis $tokill
+    }
+
+    test "Instance #$tokill is now a slave" {
+        wait_for_condition 1000 50 {
+            [RI $tokill role] eq {slave}
+        } else {
+            fail "Restarted instance is not a slave"
+        }
+    }
+
+    test "We can read back the value we set before" {
+        for {set i 0} {$i < 100} {incr i} {
+            catch {$cluster get $key:$i} err
+            assert {$err eq "$val:$i"}
+            catch {$cluster get $key:$i:2} err
+            assert {$err eq "$val:$i:2"}
+        }
+    }
+}
+
+test "Post condition: current_epoch >= my_epoch everywhere" {
+    foreach_redis_id id {
+        assert {[CI $id cluster_current_epoch] >= [CI $id cluster_my_epoch]}
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/04-resharding.tcl b/redis-stable/tests/cluster/tests/04-resharding.tcl
new file mode 100644
index 00000000..4d31d314
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/04-resharding.tcl
@@ -0,0 +1,194 @@
+# Failover stress test.
+# In this test a different node is killed in a loop for N
+# iterations. The test checks that certain properties
+# are preserved across iterations.
+
+source "../tests/includes/init-tests.tcl"
+source "../../../tests/support/cli.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Enable AOF in all the instances" {
+    foreach_redis_id id {
+        R $id config set appendonly yes
+        # We use "appendfsync no" because it's fast but also guarantees that
+        # write(2) is performed before replying to client.
+        R $id config set appendfsync no
+    }
+
+    foreach_redis_id id {
+        wait_for_condition 1000 500 {
+            [RI $id aof_rewrite_in_progress] == 0 &&
+            [RI $id aof_enabled] == 1
+        } else {
+            fail "Failed to enable AOF on instance #$id"
+        }
+    }
+}
+
+# Return non-zero if the specified PID is about a process still in execution,
+# otherwise 0 is returned.
+proc process_is_running {pid} {
+    # PS should return with an error if PID is non existing,
+    # and catch will return non-zero. We want to return non-zero if
+    # the PID exists, so we invert the return value with expr not operator.
+    expr {![catch {exec ps -p $pid}]}
+}
+
+# Our resharding test performs the following actions:
+#
+# - N commands are sent to the cluster in the course of the test.
+# - Every command selects a random key from key:0 to key:MAX-1.
+# - The operation RPUSH key <randomvalue> is performed.
+# - Tcl remembers into an array all the values pushed to each list.
+# - After N/2 commands, the resharding process is started in background.
+# - The test continues while the resharding is in progress.
+# - At the end of the test, we wait for the resharding process to stop.
+# - Finally the keys are checked to see if they contain the value they should.
+
+set numkeys 50000
+set numops 200000
+set start_node_port [get_instance_attrib redis 0 port]
+set cluster [redis_cluster 127.0.0.1:$start_node_port]
+if {$::tls} {
+    # setup a non-TLS cluster client to the TLS cluster
+    set plaintext_port [get_instance_attrib redis 0 plaintext-port]
+    set cluster_plaintext [redis_cluster 127.0.0.1:$plaintext_port 0]
+    puts "Testing TLS cluster on start node 127.0.0.1:$start_node_port, plaintext port $plaintext_port"
+} else {
+    set cluster_plaintext $cluster
+    puts "Testing using non-TLS cluster"
+}
+catch {unset content}
+array set content {}
+set tribpid {}
+
+test "Cluster consistency during live resharding" {
+    set ele 0
+    for {set j 0} {$j < $numops} {incr j} {
+        # Trigger the resharding once we execute half the ops.
+        if {$tribpid ne {} &&
+            ($j % 10000) == 0 &&
+            ![process_is_running $tribpid]} {
+            set tribpid {}
+        }
+
+        if {$j >= $numops/2 && $tribpid eq {}} {
+            puts -nonewline "...Starting resharding..."
+            flush stdout
+            set target [dict get [get_myself [randomInt 5]] id]
+            set tribpid [lindex [exec \
+                ../../../src/redis-cli --cluster reshard \
+                127.0.0.1:[get_instance_attrib redis 0 port] \
+                --cluster-from all \
+                --cluster-to $target \
+                --cluster-slots 100 \
+                --cluster-yes \
+                {*}[rediscli_tls_config "../../../tests"] \
+                | [info nameofexecutable] \
+                ../tests/helpers/onlydots.tcl \
+                &] 0]
+        }
+
+        # Write random data to random list.
+        set listid [randomInt $numkeys]
+        set key "key:$listid"
+        incr ele
+        # We write both with Lua scripts and with plain commands.
+        # This way we are able to stress Lua -> Redis command invocation
+        # as well, that has tests to prevent Lua to write into wrong
+        # hash slots.
+        # We also use both TLS and plaintext connections.
+        if {$listid % 3 == 0} {
+            $cluster rpush $key $ele
+        } elseif {$listid % 3 == 1} {
+            $cluster_plaintext rpush $key $ele
+        } else {
+            $cluster eval {redis.call("rpush",KEYS[1],ARGV[1])} 1 $key $ele
+        }
+        lappend content($key) $ele
+
+        if {($j % 1000) == 0} {
+            puts -nonewline W; flush stdout
+        }
+    }
+
+    # Wait for the resharding process to end
+    wait_for_condition 1000 500 {
+        [process_is_running $tribpid] == 0
+    } else {
+        fail "Resharding is not terminating after some time."
+    }
+
+}
+
+test "Verify $numkeys keys for consistency with logical content" {
+    # Check that the Redis Cluster content matches our logical content.
+    foreach {key value} [array get content] {
+        if {[$cluster lrange $key 0 -1] ne $value} {
+            fail "Key $key expected to hold '$value' but actual content is [$cluster lrange $key 0 -1]"
+        }
+    }
+}
+
+test "Crash and restart all the instances" {
+    foreach_redis_id id {
+        kill_instance redis $id
+        restart_instance redis $id
+    }
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Verify $numkeys keys after the crash & restart" {
+    # Check that the Redis Cluster content matches our logical content.
+    foreach {key value} [array get content] {
+        if {[$cluster lrange $key 0 -1] ne $value} {
+            fail "Key $key expected to hold '$value' but actual content is [$cluster lrange $key 0 -1]"
+        }
+    }
+}
+
+test "Disable AOF in all the instances" {
+    foreach_redis_id id {
+        R $id config set appendonly no
+    }
+}
+
+test "Verify slaves consistency" {
+    set verified_masters 0
+    foreach_redis_id id {
+        set role [R $id role]
+        lassign $role myrole myoffset slaves
+        if {$myrole eq {slave}} continue
+        set masterport [get_instance_attrib redis $id port]
+        set masterdigest [R $id debug digest]
+        foreach_redis_id sid {
+            set srole [R $sid role]
+            if {[lindex $srole 0] eq {master}} continue
+            if {[lindex $srole 2] != $masterport} continue
+            wait_for_condition 1000 500 {
+                [R $sid debug digest] eq $masterdigest
+            } else {
+                fail "Master and slave data digest are different"
+            }
+            incr verified_masters
+        }
+    }
+    assert {$verified_masters >= 5}
+}
+
+test "Dump sanitization was skipped for migrations" {
+    set verified_masters 0
+    foreach_redis_id id {
+        assert {[RI $id dump_payload_sanitizations] == 0}
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/05-slave-selection.tcl b/redis-stable/tests/cluster/tests/05-slave-selection.tcl
new file mode 100644
index 00000000..6769d307
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/05-slave-selection.tcl
@@ -0,0 +1,171 @@
+# Slave selection test
+# Check the algorithm trying to pick the slave with the most complete history.
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 5 master and 10 slaves, so that we have 2
+# slaves for each master.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 10
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "The first master has actually two slaves" {
+    assert {[llength [lindex [R 0 role] 2]] == 2}
+}
+
+test {Slaves of #0 are instance #5 and #10 as expected} {
+    set port0 [get_instance_attrib redis 0 port]
+    assert {[lindex [R 5 role] 2] == $port0}
+    assert {[lindex [R 10 role] 2] == $port0}
+}
+
+test "Instance #5 and #10 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up} &&
+        [RI 10 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 or #10 master link status is not up"
+    }
+}
+
+set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+
+test "Slaves are both able to receive and acknowledge writes" {
+    for {set j 0} {$j < 100} {incr j} {
+        $cluster set $j $j
+    }
+    assert {[R 0 wait 2 60000] == 2}
+}
+
+test "Write data while slave #10 is paused and can't receive it" {
+    # Stop the slave with a multi/exec transaction so that the master will
+    # be killed as soon as it can accept writes again.
+    R 10 multi
+    R 10 debug sleep 10
+    R 10 client kill 127.0.0.1:$port0
+    R 10 deferred 1
+    R 10 exec
+
+    # Write some data the slave can't receive.
+    for {set j 0} {$j < 100} {incr j} {
+        $cluster set $j $j
+    }
+
+    # Prevent the master from accepting new slaves.
+    # Use a large pause value since we'll kill it anyway.
+    R 0 CLIENT PAUSE 60000
+
+    # Wait for the slave to return available again
+    R 10 deferred 0
+    assert {[R 10 read] eq {OK OK}}
+
+    # Kill the master so that a reconnection will not be possible.
+    kill_instance redis 0
+}
+
+test "Wait for instance #5 (and not #10) to turn into a master" {
+    wait_for_condition 1000 50 {
+        [RI 5 role] eq {master}
+    } else {
+        fail "No failover detected"
+    }
+}
+
+test "Wait for the node #10 to return alive before ending the test" {
+    R 10 ping
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Node #10 should eventually replicate node #5" {
+    set port5 [get_instance_attrib redis 5 port]
+    wait_for_condition 1000 50 {
+        ([lindex [R 10 role] 2] == $port5) &&
+        ([lindex [R 10 role] 3] eq {connected})
+    } else {
+        fail "#10 didn't became slave of #5"
+    }
+}
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 3 master and 15 slaves, so that we have 5
+# slaves for eatch master.
+test "Create a 3 nodes cluster" {
+    create_cluster 3 15
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "The first master has actually 5 slaves" {
+    assert {[llength [lindex [R 0 role] 2]] == 5}
+}
+
+test {Slaves of #0 are instance #3, #6, #9, #12 and #15 as expected} {
+    set port0 [get_instance_attrib redis 0 port]
+    assert {[lindex [R 3 role] 2] == $port0}
+    assert {[lindex [R 6 role] 2] == $port0}
+    assert {[lindex [R 9 role] 2] == $port0}
+    assert {[lindex [R 12 role] 2] == $port0}
+    assert {[lindex [R 15 role] 2] == $port0}
+}
+
+test {Instance #3, #6, #9, #12 and #15 synced with the master} {
+    wait_for_condition 1000 50 {
+        [RI 3 master_link_status] eq {up} &&
+        [RI 6 master_link_status] eq {up} &&
+        [RI 9 master_link_status] eq {up} &&
+        [RI 12 master_link_status] eq {up} &&
+        [RI 15 master_link_status] eq {up}
+    } else {
+        fail "Instance #3 or #6 or #9 or #12 or #15 master link status is not up"
+    }
+}
+
+proc master_detected {instances} {
+    foreach instance [dict keys $instances] {
+        if {[RI $instance role] eq {master}} {
+            return true
+        }
+    }
+
+    return false
+}
+
+test "New Master down consecutively" {
+    set instances [dict create 0 1 3 1 6 1 9 1 12 1 15 1]
+
+    set loops [expr {[dict size $instances]-1}]
+    for {set i 0} {$i < $loops} {incr i} {
+        set master_id -1
+        foreach instance [dict keys $instances] {
+            if {[RI $instance role] eq {master}} {
+                set master_id $instance
+                break;
+            }
+        }
+
+        if {$master_id eq -1} {
+            fail "no master detected, #loop $i"
+        }
+
+        set instances [dict remove $instances $master_id]
+
+        kill_instance redis $master_id
+        wait_for_condition 1000 50 {
+            [master_detected $instances]
+        } else {
+            fail "No failover detected when master $master_id fails"
+        }
+
+        assert_cluster_state ok
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl b/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
new file mode 100644
index 00000000..f2e67050
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
@@ -0,0 +1,73 @@
+# Slave stop condition test
+# Check that if there is a disconnection time limit, the slave will not try
+# to failover its master.
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 5 master and 5 slaves.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "The first master has actually one slave" {
+    assert {[llength [lindex [R 0 role] 2]] == 1}
+}
+
+test {Slaves of #0 is instance #5 as expected} {
+    set port0 [get_instance_attrib redis 0 port]
+    assert {[lindex [R 5 role] 2] == $port0}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+test "Lower the slave validity factor of #5 to the value of 2" {
+    assert {[R 5 config set cluster-slave-validity-factor 2] eq {OK}}
+}
+
+test "Break master-slave link and prevent further reconnections" {
+    # Stop the slave with a multi/exec transaction so that the master will
+    # be killed as soon as it can accept writes again.
+    R 5 multi
+    R 5 client kill 127.0.0.1:$port0
+    # here we should sleep 6 or more seconds (node_timeout * slave_validity)
+    # but the actual validity time is actually incremented by the
+    # repl-ping-slave-period value which is 10 seconds by default. So we
+    # need to wait more than 16 seconds.
+    R 5 debug sleep 20
+    R 5 deferred 1
+    R 5 exec
+
+    # Prevent the master from accepting new slaves.
+    # Use a large pause value since we'll kill it anyway.
+    R 0 CLIENT PAUSE 60000
+
+    # Wait for the slave to return available again
+    R 5 deferred 0
+    assert {[R 5 read] eq {OK OK}}
+
+    # Kill the master so that a reconnection will not be possible.
+    kill_instance redis 0
+}
+
+test "Slave #5 is reachable and alive" {
+    assert {[R 5 ping] eq {PONG}}
+}
+
+test "Slave #5 should not be able to failover" {
+    after 10000
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Cluster should be down" {
+    assert_cluster_state fail
+}
diff --git a/redis-stable/tests/cluster/tests/07-replica-migration.tcl b/redis-stable/tests/cluster/tests/07-replica-migration.tcl
new file mode 100644
index 00000000..68231cd2
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/07-replica-migration.tcl
@@ -0,0 +1,103 @@
+# Replica migration test.
+# Check that orphaned masters are joined by replicas of masters having
+# multiple replicas attached, according to the migration barrier settings.
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 5 master and 10 slaves, so that we have 2
+# slaves for each master.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 10
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Each master should have two replicas attached" {
+    foreach_redis_id id {
+        if {$id < 5} {
+            wait_for_condition 1000 50 {
+                [llength [lindex [R 0 role] 2]] == 2
+            } else {
+                fail "Master #$id does not have 2 slaves as expected"
+            }
+        }
+    }
+}
+
+test "Killing all the slaves of master #0 and #1" {
+    kill_instance redis 5
+    kill_instance redis 10
+    kill_instance redis 6
+    kill_instance redis 11
+    after 4000
+}
+
+foreach_redis_id id {
+    if {$id < 5} {
+        test "Master #$id should have at least one replica" {
+            wait_for_condition 1000 50 {
+                [llength [lindex [R $id role] 2]] >= 1
+            } else {
+                fail "Master #$id has no replicas"
+            }
+        }
+    }
+}
+
+# Now test the migration to a master which used to be a slave, after
+# a failver.
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 5 master and 10 slaves, so that we have 2
+# slaves for each master.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 10
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Kill slave #7 of master #2. Only slave left is #12 now" {
+    kill_instance redis 7
+}
+
+set current_epoch [CI 1 cluster_current_epoch]
+
+test "Killing master node #2, #12 should failover" {
+    kill_instance redis 2
+}
+
+test "Wait for failover" {
+    wait_for_condition 1000 50 {
+        [CI 1 cluster_current_epoch] > $current_epoch
+    } else {
+        fail "No failover detected"
+    }
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 1
+}
+
+test "Instance 12 is now a master without slaves" {
+    assert {[RI 12 role] eq {master}}
+}
+
+# The remaining instance is now without slaves. Some other slave
+# should migrate to it.
+
+test "Master #12 should get at least one migrated replica" {
+    wait_for_condition 1000 50 {
+        [llength [lindex [R 12 role] 2]] >= 1
+    } else {
+        fail "Master #12 has no replicas"
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/08-update-msg.tcl b/redis-stable/tests/cluster/tests/08-update-msg.tcl
new file mode 100644
index 00000000..6f9661db
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/08-update-msg.tcl
@@ -0,0 +1,90 @@
+# Test UPDATE messages sent by other nodes when the currently authorirative
+# master is unavaialble. The test is performed in the following steps:
+#
+# 1) Master goes down.
+# 2) Slave failover and becomes new master.
+# 3) New master is partitoned away.
+# 4) Old master returns.
+# 5) At this point we expect the old master to turn into a slave ASAP because
+#    of the UPDATE messages it will receive from the other nodes when its
+#    configuration will be found to be outdated.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+set current_epoch [CI 1 cluster_current_epoch]
+
+test "Killing one master node" {
+    kill_instance redis 0
+}
+
+test "Wait for failover" {
+    wait_for_condition 1000 50 {
+        [CI 1 cluster_current_epoch] > $current_epoch
+    } else {
+        fail "No failover detected"
+    }
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 1
+}
+
+test "Instance #5 is now a master" {
+    assert {[RI 5 role] eq {master}}
+}
+
+test "Killing the new master #5" {
+    kill_instance redis 5
+}
+
+test "Cluster should be down now" {
+    assert_cluster_state fail
+}
+
+test "Restarting the old master node" {
+    restart_instance redis 0
+}
+
+test "Instance #0 gets converted into a slave" {
+    wait_for_condition 1000 50 {
+        [RI 0 role] eq {slave}
+    } else {
+        fail "Old master was not converted into slave"
+    }
+}
+
+test "Restarting the new master node" {
+    restart_instance redis 5
+}
+
+test "Cluster is up again" {
+    assert_cluster_state ok
+}
diff --git a/redis-stable/tests/cluster/tests/09-pubsub.tcl b/redis-stable/tests/cluster/tests/09-pubsub.tcl
new file mode 100644
index 00000000..e62b91c4
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/09-pubsub.tcl
@@ -0,0 +1,40 @@
+# Test PUBLISH propagation across the cluster.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+proc test_cluster_publish {instance instances} {
+    # Subscribe all the instances but the one we use to send.
+    for {set j 0} {$j < $instances} {incr j} {
+        if {$j != $instance} {
+            R $j deferred 1
+            R $j subscribe testchannel
+            R $j read; # Read the subscribe reply
+        }
+    }
+
+    set data [randomValue]
+    R $instance PUBLISH testchannel $data
+
+    # Read the message back from all the nodes.
+    for {set j 0} {$j < $instances} {incr j} {
+        if {$j != $instance} {
+            set msg [R $j read]
+            assert {$data eq [lindex $msg 2]}
+            R $j unsubscribe testchannel
+            R $j read; # Read the unsubscribe reply
+            R $j deferred 0
+        }
+    }
+}
+
+test "Test publishing to master" {
+    test_cluster_publish 0 10
+}
+
+test "Test publishing to slave" {
+    test_cluster_publish 5 10
+}
diff --git a/redis-stable/tests/cluster/tests/10-manual-failover.tcl b/redis-stable/tests/cluster/tests/10-manual-failover.tcl
new file mode 100644
index 00000000..5441b79f
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/10-manual-failover.tcl
@@ -0,0 +1,192 @@
+# Check the manual failover
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+set current_epoch [CI 1 cluster_current_epoch]
+
+set numkeys 50000
+set numops 10000
+set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+catch {unset content}
+array set content {}
+
+test "Send CLUSTER FAILOVER to #5, during load" {
+    for {set j 0} {$j < $numops} {incr j} {
+        # Write random data to random list.
+        set listid [randomInt $numkeys]
+        set key "key:$listid"
+        set ele [randomValue]
+        # We write both with Lua scripts and with plain commands.
+        # This way we are able to stress Lua -> Redis command invocation
+        # as well, that has tests to prevent Lua to write into wrong
+        # hash slots.
+        if {$listid % 2} {
+            $cluster rpush $key $ele
+        } else {
+           $cluster eval {redis.call("rpush",KEYS[1],ARGV[1])} 1 $key $ele
+        }
+        lappend content($key) $ele
+
+        if {($j % 1000) == 0} {
+            puts -nonewline W; flush stdout
+        }
+
+        if {$j == $numops/2} {R 5 cluster failover}
+    }
+}
+
+test "Wait for failover" {
+    wait_for_condition 1000 50 {
+        [CI 1 cluster_current_epoch] > $current_epoch
+    } else {
+        fail "No failover detected"
+    }
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 1
+}
+
+test "Instance #5 is now a master" {
+    assert {[RI 5 role] eq {master}}
+}
+
+test "Verify $numkeys keys for consistency with logical content" {
+    # Check that the Redis Cluster content matches our logical content.
+    foreach {key value} [array get content] {
+        assert {[$cluster lrange $key 0 -1] eq $value}
+    }
+}
+
+test "Instance #0 gets converted into a slave" {
+    wait_for_condition 1000 50 {
+        [RI 0 role] eq {slave}
+    } else {
+        fail "Old master was not converted into slave"
+    }
+}
+
+## Check that manual failover does not happen if we can't talk with the master.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+test "Make instance #0 unreachable without killing it" {
+    R 0 deferred 1
+    R 0 DEBUG SLEEP 10
+}
+
+test "Send CLUSTER FAILOVER to instance #5" {
+    R 5 cluster failover
+}
+
+test "Instance #5 is still a slave after some time (no failover)" {
+    after 5000
+    assert {[RI 5 role] eq {master}}
+}
+
+test "Wait for instance #0 to return back alive" {
+    R 0 deferred 0
+    assert {[R 0 read] eq {OK}}
+}
+
+## Check with "force" failover happens anyway.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+test "Make instance #0 unreachable without killing it" {
+    R 0 deferred 1
+    R 0 DEBUG SLEEP 10
+}
+
+test "Send CLUSTER FAILOVER to instance #5" {
+    R 5 cluster failover force
+}
+
+test "Instance #5 is a master after some time" {
+    wait_for_condition 1000 50 {
+        [RI 5 role] eq {master}
+    } else {
+        fail "Instance #5 is not a master after some time regardless of FORCE"
+    }
+}
+
+test "Wait for instance #0 to return back alive" {
+    R 0 deferred 0
+    assert {[R 0 read] eq {OK}}
+}
diff --git a/redis-stable/tests/cluster/tests/11-manual-takeover.tcl b/redis-stable/tests/cluster/tests/11-manual-takeover.tcl
new file mode 100644
index 00000000..f567c696
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/11-manual-takeover.tcl
@@ -0,0 +1,59 @@
+# Manual takeover test
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Killing majority of master nodes" {
+    kill_instance redis 0
+    kill_instance redis 1
+    kill_instance redis 2
+}
+
+test "Cluster should eventually be down" {
+    assert_cluster_state fail
+}
+
+test "Use takeover to bring slaves back" {
+    R 5 cluster failover takeover
+    R 6 cluster failover takeover
+    R 7 cluster failover takeover
+}
+
+test "Cluster should eventually be up again" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 4
+}
+
+test "Instance #5, #6, #7 are now masters" {
+    assert {[RI 5 role] eq {master}}
+    assert {[RI 6 role] eq {master}}
+    assert {[RI 7 role] eq {master}}
+}
+
+test "Restarting the previously killed master nodes" {
+    restart_instance redis 0
+    restart_instance redis 1
+    restart_instance redis 2
+}
+
+test "Instance #0, #1, #2 gets converted into a slaves" {
+    wait_for_condition 1000 50 {
+        [RI 0 role] eq {slave} && [RI 1 role] eq {slave} && [RI 2 role] eq {slave}
+    } else {
+        fail "Old masters not converted into slaves"
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl b/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
new file mode 100644
index 00000000..ea80d81d
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
@@ -0,0 +1,74 @@
+# Replica migration test #2.
+#
+# Check that the status of master that can be targeted by replica migration
+# is acquired again, after being getting slots again, in a cluster where the
+# other masters have slaves.
+
+source "../tests/includes/init-tests.tcl"
+source "../../../tests/support/cli.tcl"
+
+# Create a cluster with 5 master and 15 slaves, to make sure there are no
+# empty masters and make rebalancing simpler to handle during the test.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 15
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Each master should have at least two replicas attached" {
+    foreach_redis_id id {
+        if {$id < 5} {
+            wait_for_condition 1000 50 {
+                [llength [lindex [R 0 role] 2]] >= 2
+            } else {
+                fail "Master #$id does not have 2 slaves as expected"
+            }
+        }
+    }
+}
+
+test "Set allow-replica-migration yes" {
+    foreach_redis_id id {
+        R $id CONFIG SET cluster-allow-replica-migration yes
+    }
+}
+
+set master0_id [dict get [get_myself 0] id]
+test "Resharding all the master #0 slots away from it" {
+    set output [exec \
+        ../../../src/redis-cli --cluster rebalance \
+        127.0.0.1:[get_instance_attrib redis 0 port] \
+        {*}[rediscli_tls_config "../../../tests"] \
+        --cluster-weight ${master0_id}=0 >@ stdout ]
+
+}
+
+test "Master #0 should lose its replicas" {
+    wait_for_condition 1000 50 {
+        [llength [lindex [R 0 role] 2]] == 0
+    } else {
+        fail "Master #0 still has replicas"
+    }
+}
+
+test "Resharding back some slot to master #0" {
+    # Wait for the cluster config to propagate before attempting a
+    # new resharding.
+    after 10000
+    set output [exec \
+        ../../../src/redis-cli --cluster rebalance \
+        127.0.0.1:[get_instance_attrib redis 0 port] \
+        {*}[rediscli_tls_config "../../../tests"] \
+        --cluster-weight ${master0_id}=.01 \
+        --cluster-use-empty-masters  >@ stdout]
+}
+
+test "Master #0 should re-acquire one or more replicas" {
+    wait_for_condition 1000 50 {
+        [llength [lindex [R 0 role] 2]] >= 1
+    } else {
+        fail "Master #0 has no has replicas"
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl b/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
new file mode 100644
index 00000000..46a9f79e
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
@@ -0,0 +1,71 @@
+# Replica migration test #2.
+#
+# Check that if 'cluster-allow-replica-migration' is set to 'no', slaves do not
+# migrate when master becomes empty.
+
+source "../tests/includes/init-tests.tcl"
+
+# Create a cluster with 5 master and 15 slaves, to make sure there are no
+# empty masters and make rebalancing simpler to handle during the test.
+test "Create a 5 nodes cluster" {
+    create_cluster 5 15
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Each master should have at least two replicas attached" {
+    foreach_redis_id id {
+        if {$id < 5} {
+            wait_for_condition 1000 50 {
+                [llength [lindex [R 0 role] 2]] >= 2
+            } else {
+                fail "Master #$id does not have 2 slaves as expected"
+            }
+        }
+    }
+}
+
+test "Set allow-replica-migration no" {
+    foreach_redis_id id {
+        R $id CONFIG SET cluster-allow-replica-migration no
+    }
+}
+
+set master0_id [dict get [get_myself 0] id]
+test "Resharding all the master #0 slots away from it" {
+    set output [exec \
+        ../../../src/redis-cli --cluster rebalance \
+        127.0.0.1:[get_instance_attrib redis 0 port] \
+        {*}[rediscli_tls_config "../../../tests"] \
+        --cluster-weight ${master0_id}=0 >@ stdout ]
+}
+
+test "Wait cluster to be stable" {
+    wait_for_condition 1000 50 {
+        [catch {exec ../../../src/redis-cli --cluster \
+            check 127.0.0.1:[get_instance_attrib redis 0 port] \
+            {*}[rediscli_tls_config "../../../tests"] \
+            }] == 0
+    } else {
+        fail "Cluster doesn't stabilize"
+    }
+}
+
+test "Master #0 stil should have its replicas" {
+    assert { [llength [lindex [R 0 role] 2]] >= 2 }
+}
+
+test "Each master should have at least two replicas attached" {
+    foreach_redis_id id {
+        if {$id < 5} {
+            wait_for_condition 1000 50 {
+                [llength [lindex [R 0 role] 2]] >= 2
+            } else {
+                fail "Master #$id does not have 2 slaves as expected"
+            }
+        }
+    }
+}
+
diff --git a/redis-stable/tests/cluster/tests/13-no-failover-option.tcl b/redis-stable/tests/cluster/tests/13-no-failover-option.tcl
new file mode 100644
index 00000000..befa598d
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/13-no-failover-option.tcl
@@ -0,0 +1,61 @@
+# Check that the no-failover option works
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+
+    # Configure it to never failover the master
+    R 5 CONFIG SET cluster-slave-no-failover yes
+}
+
+test "Instance #5 synced with the master" {
+    wait_for_condition 1000 50 {
+        [RI 5 master_link_status] eq {up}
+    } else {
+        fail "Instance #5 master link status is not up"
+    }
+}
+
+test "The nofailover flag is propagated" {
+    set slave5_id [dict get [get_myself 5] id]
+
+    foreach_redis_id id {
+        wait_for_condition 1000 50 {
+            [has_flag [get_node_by_id $id $slave5_id] nofailover]
+        } else {
+            fail "Instance $id can't see the nofailover flag of slave"
+        }
+    }
+}
+
+set current_epoch [CI 1 cluster_current_epoch]
+
+test "Killing one master node" {
+    kill_instance redis 0
+}
+
+test "Cluster should be still down after some time" {
+    after 10000
+    assert_cluster_state fail
+}
+
+test "Instance #5 is still a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "Restarting the previously killed master node" {
+    restart_instance redis 0
+}
diff --git a/redis-stable/tests/cluster/tests/14-consistency-check.tcl b/redis-stable/tests/cluster/tests/14-consistency-check.tcl
new file mode 100644
index 00000000..ddc0570e
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/14-consistency-check.tcl
@@ -0,0 +1,117 @@
+source "../tests/includes/init-tests.tcl"
+source "../../../tests/support/cli.tcl"
+
+test "Create a 5 nodes cluster" {
+    create_cluster 5 5
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+proc find_non_empty_master {} {
+    set master_id_no {}
+    foreach_redis_id id {
+        if {[RI $id role] eq {master} && [R $id dbsize] > 0} {
+            set master_id_no $id
+        }
+    }
+    return $master_id_no
+}
+
+proc get_one_of_my_replica {id} {
+    set replica_port [lindex [lindex [lindex [R $id role] 2] 0] 1]
+    set replica_id_num [get_instance_id_by_port redis $replica_port]
+    return $replica_id_num
+}
+
+proc cluster_write_keys_with_expire {id ttl} {
+    set prefix [randstring 20 20 alpha]
+    set port [get_instance_attrib redis $id port]
+    set cluster [redis_cluster 127.0.0.1:$port]
+    for {set j 100} {$j < 200} {incr j} {
+        $cluster setex key_expire.$j $ttl $prefix.$j
+    }
+    $cluster close
+}
+
+# make sure that replica who restarts from persistence will load keys
+# that have already expired, critical for correct execution of commands
+# that arrive from the master
+proc test_slave_load_expired_keys {aof} {
+    test "Slave expired keys is loaded when restarted: appendonly=$aof" {
+        set master_id [find_non_empty_master]
+        set replica_id [get_one_of_my_replica $master_id]
+
+        set master_dbsize_0 [R $master_id dbsize]
+        set replica_dbsize_0 [R $replica_id dbsize]
+        assert_equal $master_dbsize_0 $replica_dbsize_0
+
+        # config the replica persistency and rewrite the config file to survive restart
+        # note that this needs to be done before populating the volatile keys since
+        # that triggers and AOFRW, and we rather the AOF file to have SETEX commands
+        # rather than an RDB with volatile keys
+        R $replica_id config set appendonly $aof
+        R $replica_id config rewrite
+
+        # fill with 100 keys with 3 second TTL
+        set data_ttl 3
+        cluster_write_keys_with_expire $master_id $data_ttl
+
+        # wait for replica to be in sync with master
+        wait_for_condition 500 10 {
+            [R $replica_id dbsize] eq [R $master_id dbsize]
+        } else {
+            fail "replica didn't sync"
+        }
+        
+        set replica_dbsize_1 [R $replica_id dbsize]
+        assert {$replica_dbsize_1 > $replica_dbsize_0}
+
+        # make replica create persistence file
+        if {$aof == "yes"} {
+            # we need to wait for the initial AOFRW to be done, otherwise
+            # kill_instance (which now uses SIGTERM will fail ("Writing initial AOF, can't exit")
+            wait_for_condition 100 10 {
+                [RI $replica_id aof_rewrite_in_progress] eq 0
+            } else {
+                fail "keys didn't expire"
+            }
+        } else {
+            R $replica_id save
+        }
+
+        # kill the replica (would stay down until re-started)
+        kill_instance redis $replica_id
+
+        # Make sure the master doesn't do active expire (sending DELs to the replica)
+        R $master_id DEBUG SET-ACTIVE-EXPIRE 0
+
+        # wait for all the keys to get logically expired
+        after [expr $data_ttl*1000]
+
+        # start the replica again (loading an RDB or AOF file)
+        restart_instance redis $replica_id
+
+        # make sure the keys are still there
+        set replica_dbsize_3 [R $replica_id dbsize]
+        assert {$replica_dbsize_3 > $replica_dbsize_0}
+        
+        # restore settings
+        R $master_id DEBUG SET-ACTIVE-EXPIRE 1
+
+        # wait for the master to expire all keys and replica to get the DELs
+        wait_for_condition 500 10 {
+            [R $replica_id dbsize] eq $master_dbsize_0
+        } else {
+            fail "keys didn't expire"
+        }
+    }
+}
+
+test_slave_load_expired_keys no
+test_slave_load_expired_keys yes
diff --git a/redis-stable/tests/cluster/tests/15-cluster-slots.tcl b/redis-stable/tests/cluster/tests/15-cluster-slots.tcl
new file mode 100644
index 00000000..f154b727
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/15-cluster-slots.tcl
@@ -0,0 +1,63 @@
+source "../tests/includes/init-tests.tcl"
+
+proc cluster_allocate_mixedSlots {n} {
+    set slot 16383
+    while {$slot >= 0} {
+        set node [expr {$slot % $n}]
+        lappend slots_$node $slot
+        incr slot -1
+    }
+    for {set j 0} {$j < $n} {incr j} {
+        R $j cluster addslots {*}[set slots_${j}]
+    }
+}
+
+proc create_cluster_with_mixedSlot {masters slaves} {
+    cluster_allocate_mixedSlots $masters
+    if {$slaves} {
+        cluster_allocate_slaves $masters $slaves
+    }
+    assert_cluster_state ok
+}
+
+test "Create a 5 nodes cluster" {
+    create_cluster_with_mixedSlot 5 15
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Instance #5 is a slave" {
+    assert {[RI 5 role] eq {slave}}
+}
+
+test "client do not break when cluster slot" {
+    R 0 config set client-output-buffer-limit "normal 33554432 16777216 60"
+    if { [catch {R 0 cluster slots}] } {
+        fail "output overflow when cluster slots"
+    }
+}
+
+test "client can handle keys with hash tag" {
+    set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+    $cluster set foo{tag} bar
+    $cluster close
+}
+
+if {$::tls} {
+    test {CLUSTER SLOTS from non-TLS client in TLS cluster} {
+        set slots_tls [R 0 cluster slots]
+        set host [get_instance_attrib redis 0 host]
+        set plaintext_port [get_instance_attrib redis 0 plaintext-port]
+        set client_plain [redis $host $plaintext_port 0 0]
+        set slots_plain [$client_plain cluster slots]
+        $client_plain close
+        # Compare the ports in the first row
+        assert_no_match [lindex $slots_tls 0 3 1] [lindex $slots_plain 0 3 1]
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl b/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
new file mode 100644
index 00000000..baed15fb
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
@@ -0,0 +1,71 @@
+# Check basic transactions on a replica.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a primary with a replica" {
+    create_cluster 1 1
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+set primary [Rn 0]
+set replica [Rn 1]
+
+test "Cant read from replica without READONLY" {
+    $primary SET a 1
+    wait_for_ofs_sync $primary $replica
+    catch {$replica GET a} err
+    assert {[string range $err 0 4] eq {MOVED}}
+}
+
+test "Can read from replica after READONLY" {
+    $replica READONLY
+    assert {[$replica GET a] eq {1}}
+}
+
+test "Can preform HSET primary and HGET from replica" {
+    $primary HSET h a 1
+    $primary HSET h b 2
+    $primary HSET h c 3
+    wait_for_ofs_sync $primary $replica
+    assert {[$replica HGET h a] eq {1}}
+    assert {[$replica HGET h b] eq {2}}
+    assert {[$replica HGET h c] eq {3}}
+}
+
+test "Can MULTI-EXEC transaction of HGET operations from replica" {
+    $replica MULTI
+    assert {[$replica HGET h a] eq {QUEUED}}
+    assert {[$replica HGET h b] eq {QUEUED}}
+    assert {[$replica HGET h c] eq {QUEUED}}
+    assert {[$replica EXEC] eq {1 2 3}}
+}
+
+test "MULTI-EXEC with write operations is MOVED" {
+    $replica MULTI
+    catch {$replica HSET h b 4} err
+    assert {[string range $err 0 4] eq {MOVED}}
+    catch {$replica exec} err
+    assert {[string range $err 0 8] eq {EXECABORT}}
+}
+
+test "read-only blocking operations from replica" {
+    set rd [redis_deferring_client redis 1]
+    $rd readonly
+    $rd read
+    $rd XREAD BLOCK 0 STREAMS k 0
+
+    wait_for_condition 1000 50 {
+        [RI 1 blocked_clients] eq {1}
+    } else {
+        fail "client wasn't blocked"
+    }
+
+    $primary XADD k * foo bar
+    set res [$rd read]
+    set res [lindex [lindex [lindex [lindex $res 0] 1] 0] 1]
+    assert {$res eq {foo bar}}
+    $rd close
+}
diff --git a/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl b/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
new file mode 100644
index 00000000..516e5170
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
@@ -0,0 +1,86 @@
+# Check replica can restore database buckup correctly if fail to diskless load.
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a primary with a replica" {
+    create_cluster 1 1
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+test "Cluster is writable" {
+    cluster_write_test 0
+}
+
+test "Right to restore backups when fail to diskless load " {
+    set master [Rn 0]
+    set replica [Rn 1]
+    set master_id 0
+    set replica_id 1
+
+    $replica READONLY
+    $replica config set repl-diskless-load swapdb
+    $replica config set appendonly no
+    $replica config set save ""
+    $replica config rewrite
+    $master config set repl-backlog-size 1024
+    $master config set repl-diskless-sync yes
+    $master config set repl-diskless-sync-delay 0
+    $master config set rdb-key-save-delay 10000
+    $master config set rdbcompression no
+    $master config set appendonly no
+    $master config set save ""
+
+    # Write a key that belongs to slot 0
+    set slot0_key "06S"
+    $master set $slot0_key 1
+    wait_for_ofs_sync $master $replica
+    assert_equal {1} [$replica get $slot0_key]
+    assert_equal $slot0_key [$replica CLUSTER GETKEYSINSLOT 0 1]
+
+    # Save an RDB and kill the replica
+    $replica save
+    kill_instance redis $replica_id
+
+    # Delete the key from master
+    $master del $slot0_key
+
+    # Replica must full sync with master when start because replication
+    # backlog size is very small, and dumping rdb will cost several seconds.
+    set num 10000
+    set value [string repeat A 1024]
+    set rd [redis_deferring_client redis $master_id]
+    for {set j 0} {$j < $num} {incr j} {
+        $rd set $j $value
+    }
+    for {set j 0} {$j < $num} {incr j} {
+        $rd read
+    }
+
+    # Start the replica again
+    restart_instance redis $replica_id
+    $replica READONLY
+
+    # Start full sync, wait till after db is flushed (backed up)
+    wait_for_condition 500 10 {
+        [s $replica_id loading] eq 1
+    } else {
+        fail "Fail to full sync"
+    }
+
+    # Kill master, abort full sync
+    kill_instance redis $master_id
+
+    # Start full sync, wait till the replica detects the disconnection
+    wait_for_condition 500 10 {
+        [s $replica_id loading] eq 0
+    } else {
+        fail "Fail to full sync"
+    }
+
+    # Replica keys and keys to slots map still both are right
+    assert_equal {1} [$replica get $slot0_key]
+    assert_equal $slot0_key [$replica CLUSTER GETKEYSINSLOT 0 1]
+}
diff --git a/redis-stable/tests/cluster/tests/18-info.tcl b/redis-stable/tests/cluster/tests/18-info.tcl
new file mode 100644
index 00000000..978d9d1d
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/18-info.tcl
@@ -0,0 +1,45 @@
+# Check cluster info stats
+
+source "../tests/includes/init-tests.tcl"
+
+test "Create a primary with a replica" {
+    create_cluster 2 0
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+set primary1 [Rn 0]
+set primary2 [Rn 1]
+
+proc cmdstat {instace cmd} {
+    return [cmdrstat $cmd $instace]
+}
+
+proc errorstat {instace cmd} {
+    return [errorrstat $cmd $instace]
+}
+
+test "errorstats: rejected call due to MOVED Redirection" {
+    $primary1 config resetstat
+    $primary2 config resetstat
+    assert_match {} [errorstat $primary1 MOVED]
+    assert_match {} [errorstat $primary2 MOVED]
+    # we know that one will have a MOVED reply and one will succeed
+    catch {$primary1 set key b} replyP1
+    catch {$primary2 set key b} replyP2
+    # sort servers so we know which one failed
+    if {$replyP1 eq {OK}} {
+        assert_match {MOVED*} $replyP2
+        set pok $primary1
+        set perr $primary2
+    } else {
+        assert_match {MOVED*} $replyP1
+        set pok $primary2
+        set perr $primary1
+    }
+    assert_match {} [errorstat $pok MOVED]
+    assert_match {*count=1*} [errorstat $perr MOVED]
+    assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat $perr set]
+}
diff --git a/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl b/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
new file mode 100644
index 00000000..80f68d5d
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
@@ -0,0 +1,71 @@
+# Optimize CLUSTER NODES command by generating all nodes slot topology firstly
+
+source "../tests/includes/init-tests.tcl"
+
+proc cluster_allocate_with_continuous_slots {n} {
+    set slot 16383
+    set avg [expr ($slot+1) / $n]
+    while {$slot >= 0} {
+        set node [expr $slot/$avg >= $n ? $n-1 : $slot/$avg]
+        lappend slots_$node $slot
+        incr slot -1
+    }
+    for {set j 0} {$j < $n} {incr j} {
+        R $j cluster addslots {*}[set slots_${j}]
+    }
+}
+
+proc cluster_create_with_continuous_slots {masters slaves} {
+    cluster_allocate_with_continuous_slots $masters
+    if {$slaves} {
+        cluster_allocate_slaves $masters $slaves
+    }
+    assert_cluster_state ok
+}
+
+test "Create a 2 nodes cluster" {
+    cluster_create_with_continuous_slots 2 2
+}
+
+test "Cluster should start ok" {
+    assert_cluster_state ok
+}
+
+set master1 [Rn 0]
+set master2 [Rn 1]
+
+test "Continuous slots distribution" {
+    assert_match "* 0-8191*" [$master1 CLUSTER NODES]
+    assert_match "* 8192-16383*" [$master2 CLUSTER NODES]
+    assert_match "*0 8191*" [$master1 CLUSTER SLOTS]
+    assert_match "*8192 16383*" [$master2 CLUSTER SLOTS]
+
+    $master1 CLUSTER DELSLOTS 4096
+    assert_match "* 0-4095 4097-8191*" [$master1 CLUSTER NODES]
+    assert_match "*0 4095*4097 8191*" [$master1 CLUSTER SLOTS]
+
+
+    $master2 CLUSTER DELSLOTS 12288
+    assert_match "* 8192-12287 12289-16383*" [$master2 CLUSTER NODES]
+    assert_match "*8192 12287*12289 16383*" [$master2 CLUSTER SLOTS]
+}
+
+test "Discontinuous slots distribution" {
+    # Remove middle slots
+    $master1 CLUSTER DELSLOTS 4092 4094
+    assert_match "* 0-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES]
+    assert_match "*0 4091*4093 4093*4095 4095*4097 8191*" [$master1 CLUSTER SLOTS]
+    $master2 CLUSTER DELSLOTS 12284 12286
+    assert_match "* 8192-12283 12285 12287 12289-16383*" [$master2 CLUSTER NODES]
+    assert_match "*8192 12283*12285 12285*12287 12287*12289 16383*" [$master2 CLUSTER SLOTS]
+
+    # Remove head slots
+    $master1 CLUSTER DELSLOTS 0 2
+    assert_match "* 1 3-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES]
+    assert_match "*1 1*3 4091*4093 4093*4095 4095*4097 8191*" [$master1 CLUSTER SLOTS]
+
+    # Remove tail slots
+    $master2 CLUSTER DELSLOTS 16380 16382 16383
+    assert_match "* 8192-12283 12285 12287 12289-16379 16381*" [$master2 CLUSTER NODES]
+    assert_match "*8192 12283*12285 12285*12287 12287*12289 16379*16381 16381*" [$master2 CLUSTER SLOTS]
+}
diff --git a/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl b/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
new file mode 100644
index 00000000..229b3a86
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
@@ -0,0 +1,98 @@
+# Tests for fixing migrating slot at all stages:
+# 1. when migration is half inited on "migrating" node
+# 2. when migration is half inited on "importing" node
+# 3. migration inited, but not finished
+# 4. migration is half finished on "migrating" node
+# 5. migration is half finished on "importing" node
+
+# TODO: Test is currently disabled until it is stabilized (fixing the test
+# itself or real issues in Redis).
+
+if {false} {
+source "../tests/includes/init-tests.tcl"
+source "../tests/includes/utils.tcl"
+
+test "Create a 2 nodes cluster" {
+    create_cluster 2 0
+    config_set_all_nodes cluster-allow-replica-migration no
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+catch {unset nodefrom}
+catch {unset nodeto}
+
+proc reset_cluster {} {
+    uplevel 1 {
+        $cluster refresh_nodes_map
+        array set nodefrom [$cluster masternode_for_slot 609]
+        array set nodeto [$cluster masternode_notfor_slot 609]
+    }
+}
+
+reset_cluster
+
+$cluster set aga xyz
+
+test "Half init migration in 'migrating' is fixable" {
+    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
+    fix_cluster $nodefrom(addr)
+    assert_equal "xyz" [$cluster get aga]
+}
+
+test "Half init migration in 'importing' is fixable" {
+    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
+    fix_cluster $nodefrom(addr)
+    assert_equal "xyz" [$cluster get aga]
+}
+
+test "Init migration and move key" {
+    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
+    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
+    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
+    wait_for_cluster_propagation
+    assert_equal "xyz" [$cluster get aga]
+    fix_cluster $nodefrom(addr)
+    assert_equal "xyz" [$cluster get aga]
+}
+
+reset_cluster
+
+test "Move key again" {
+    wait_for_cluster_propagation
+    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
+    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
+    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
+    wait_for_cluster_propagation
+    assert_equal "xyz" [$cluster get aga]
+}
+
+test "Half-finish migration" {
+    # half finish migration on 'migrating' node
+    assert_equal {OK} [$nodefrom(link) cluster setslot 609 node $nodeto(id)]
+    fix_cluster $nodefrom(addr)
+    assert_equal "xyz" [$cluster get aga]
+}
+
+reset_cluster
+
+test "Move key back" {
+    # 'aga' key is in 609 slot
+    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
+    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
+    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
+    assert_equal "xyz" [$cluster get aga]
+}
+
+test "Half-finish importing" {
+    # Now we half finish 'importing' node
+    assert_equal {OK} [$nodeto(link) cluster setslot 609 node $nodeto(id)]
+    fix_cluster $nodefrom(addr)
+    assert_equal "xyz" [$cluster get aga]
+}
+
+config_set_all_nodes cluster-allow-replica-migration yes
+}
diff --git a/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl b/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
new file mode 100644
index 00000000..ccfff74e
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
@@ -0,0 +1,64 @@
+# Tests for many simlutaneous migrations.
+
+# TODO: Test is currently disabled until it is stabilized (fixing the test
+# itself or real issues in Redis).
+
+if {false} {
+
+source "../tests/includes/init-tests.tcl"
+source "../tests/includes/utils.tcl"
+
+# TODO: This test currently runs without replicas, as failovers (which may
+# happen on lower-end CI platforms) are still not handled properly by the
+# cluster during slot migration (related to #6339).
+
+test "Create a 10 nodes cluster" {
+    create_cluster 10 0
+    config_set_all_nodes cluster-allow-replica-migration no
+}
+
+test "Cluster is up" {
+    assert_cluster_state ok
+}
+
+set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
+catch {unset nodefrom}
+catch {unset nodeto}
+
+$cluster refresh_nodes_map
+
+test "Set many keys" {
+    for {set i 0} {$i < 40000} {incr i} {
+        $cluster set key:$i val:$i
+    }
+}
+
+test "Keys are accessible" {
+    for {set i 0} {$i < 40000} {incr i} {
+        assert { [$cluster get key:$i] eq "val:$i" }
+    }
+}
+
+test "Init migration of many slots" {
+    for {set slot 0} {$slot < 1000} {incr slot} {
+        array set nodefrom [$cluster masternode_for_slot $slot]
+        array set nodeto [$cluster masternode_notfor_slot $slot]
+
+        $nodefrom(link) cluster setslot $slot migrating $nodeto(id)
+        $nodeto(link) cluster setslot $slot importing $nodefrom(id)
+    }
+}
+
+test "Fix cluster" {
+    wait_for_cluster_propagation
+    fix_cluster $nodefrom(addr)
+}
+
+test "Keys are accessible" {
+    for {set i 0} {$i < 40000} {incr i} {
+        assert { [$cluster get key:$i] eq "val:$i" }
+    }
+}
+
+config_set_all_nodes cluster-allow-replica-migration yes
+}
diff --git a/redis-stable/tests/cluster/tests/helpers/onlydots.tcl b/redis-stable/tests/cluster/tests/helpers/onlydots.tcl
new file mode 100644
index 00000000..4a6d1aee
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/helpers/onlydots.tcl
@@ -0,0 +1,16 @@
+# Read the standard input and only shows dots in the output, filtering out
+# all the other characters. Designed to avoid bufferization so that when
+# we get the output of redis-trib and want to show just the dots, we'll see
+# the dots as soon as redis-trib will output them.
+
+fconfigure stdin -buffering none
+
+while 1 {
+    set c [read stdin 1]
+    if {$c eq {}} {
+        exit 0; # EOF
+    } elseif {$c eq {.}} {
+        puts -nonewline .
+        flush stdout
+    }
+}
diff --git a/redis-stable/tests/cluster/tests/includes/init-tests.tcl b/redis-stable/tests/cluster/tests/includes/init-tests.tcl
new file mode 100644
index 00000000..466ab8f2
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/includes/init-tests.tcl
@@ -0,0 +1,70 @@
+# Initialization tests -- most units will start including this.
+
+test "(init) Restart killed instances" {
+    foreach type {redis} {
+        foreach_${type}_id id {
+            if {[get_instance_attrib $type $id pid] == -1} {
+                puts -nonewline "$type/$id "
+                flush stdout
+                restart_instance $type $id
+            }
+        }
+    }
+}
+
+test "Cluster nodes are reachable" {
+    foreach_redis_id id {
+        # Every node should be reachable.
+        wait_for_condition 1000 50 {
+            ([catch {R $id ping} ping_reply] == 0) &&
+            ($ping_reply eq {PONG})
+        } else {
+            catch {R $id ping} err
+            fail "Node #$id keeps replying '$err' to PING."
+        }
+    }
+}
+
+test "Cluster nodes hard reset" {
+    foreach_redis_id id {
+        if {$::valgrind} {
+            set node_timeout 10000
+        } else {
+            set node_timeout 3000
+        }
+        catch {R $id flushall} ; # May fail for readonly slaves.
+        R $id MULTI
+        R $id cluster reset hard
+        R $id cluster set-config-epoch [expr {$id+1}]
+        R $id EXEC
+        R $id config set cluster-node-timeout $node_timeout
+        R $id config set cluster-slave-validity-factor 10
+        R $id config rewrite
+    }
+}
+
+test "Cluster Join and auto-discovery test" {
+    # Join node 0 with 1, 1 with 2, ... and so forth.
+    # If auto-discovery works all nodes will know every other node
+    # eventually.
+    set ids {}
+    foreach_redis_id id {lappend ids $id}
+    for {set j 0} {$j < [expr [llength $ids]-1]} {incr j} {
+        set a [lindex $ids $j]
+        set b [lindex $ids [expr $j+1]]
+        set b_port [get_instance_attrib redis $b port]
+        R $a cluster meet 127.0.0.1 $b_port
+    }
+
+    foreach_redis_id id {
+        wait_for_condition 1000 50 {
+            [llength [get_cluster_nodes $id]] == [llength $ids]
+        } else {
+            fail "Cluster failed to join into a full mesh."
+        }
+    }
+}
+
+test "Before slots allocation, all nodes report cluster failure" {
+    assert_cluster_state fail
+}
diff --git a/redis-stable/tests/cluster/tests/includes/utils.tcl b/redis-stable/tests/cluster/tests/includes/utils.tcl
new file mode 100644
index 00000000..48c40a05
--- /dev/null
+++ b/redis-stable/tests/cluster/tests/includes/utils.tcl
@@ -0,0 +1,25 @@
+source "../../../tests/support/cli.tcl"
+
+proc config_set_all_nodes {keyword value} {
+    foreach_redis_id id {
+        R $id config set $keyword $value
+    }
+}
+
+proc fix_cluster {addr} {
+    set code [catch {
+        exec ../../../src/redis-cli {*}[rediscli_tls_config "../../../tests"] --cluster fix $addr << yes
+    } result]
+    if {$code != 0} {
+        puts "redis-cli --cluster fix returns non-zero exit code, output below:\n$result"
+    }
+    # Note: redis-cli --cluster fix may return a non-zero exit code if nodes don't agree,
+    # but we can ignore that and rely on the check below.
+    assert_cluster_state ok
+    wait_for_condition 100 100 {
+        [catch {exec ../../../src/redis-cli {*}[rediscli_tls_config "../../../tests"] --cluster check $addr} result] == 0
+    } else {
+        puts "redis-cli --cluster check returns non-zero exit code, output below:\n$result"
+        fail "Cluster could not settle with configuration"
+    }
+}
diff --git a/redis-stable/tests/cluster/tmp/.gitignore b/redis-stable/tests/cluster/tmp/.gitignore
new file mode 100644
index 00000000..f581f73e
--- /dev/null
+++ b/redis-stable/tests/cluster/tmp/.gitignore
@@ -0,0 +1,2 @@
+redis_*
+sentinel_*
diff --git a/redis-stable/tests/helpers/bg_block_op.tcl b/redis-stable/tests/helpers/bg_block_op.tcl
new file mode 100644
index 00000000..dc4e1a99
--- /dev/null
+++ b/redis-stable/tests/helpers/bg_block_op.tcl
@@ -0,0 +1,55 @@
+source tests/support/redis.tcl
+source tests/support/util.tcl
+
+set ::tlsdir "tests/tls"
+
+# This function sometimes writes sometimes blocking-reads from lists/sorted
+# sets. There are multiple processes like this executing at the same time
+# so that we have some chance to trap some corner condition if there is
+# a regression. For this to happen it is important that we narrow the key
+# space to just a few elements, and balance the operations so that it is
+# unlikely that lists and zsets just get more data without ever causing
+# blocking.
+proc bg_block_op {host port db ops tls} {
+    set r [redis $host $port 0 $tls]
+    $r client setname LOAD_HANDLER
+    $r select $db
+
+    for {set j 0} {$j < $ops} {incr j} {
+
+        # List side
+        set k list_[randomInt 10]
+        set k2 list_[randomInt 10]
+        set v [randomValue]
+
+        randpath {
+            randpath {
+                $r rpush $k $v
+            } {
+                $r lpush $k $v
+            }
+        } {
+            $r blpop $k 2
+        } {
+            $r blpop $k $k2 2
+        }
+
+        # Zset side
+        set k zset_[randomInt 10]
+        set k2 zset_[randomInt 10]
+        set v1 [randomValue]
+        set v2 [randomValue]
+
+        randpath {
+            $r zadd $k [randomInt 10000] $v
+        } {
+            $r zadd $k [randomInt 10000] $v [randomInt 10000] $v2
+        } {
+            $r bzpopmin $k 2
+        } {
+            $r bzpopmax $k 2
+        }
+    }
+}
+
+bg_block_op [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3] [lindex $argv 4]
diff --git a/redis-stable/tests/helpers/bg_complex_data.tcl b/redis-stable/tests/helpers/bg_complex_data.tcl
new file mode 100644
index 00000000..9c0044e7
--- /dev/null
+++ b/redis-stable/tests/helpers/bg_complex_data.tcl
@@ -0,0 +1,13 @@
+source tests/support/redis.tcl
+source tests/support/util.tcl
+
+set ::tlsdir "tests/tls"
+
+proc bg_complex_data {host port db ops tls} {
+    set r [redis $host $port 0 $tls]
+    $r client setname LOAD_HANDLER
+    $r select $db
+    createComplexDataset $r $ops
+}
+
+bg_complex_data [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3] [lindex $argv 4]
diff --git a/redis-stable/tests/helpers/fake_redis_node.tcl b/redis-stable/tests/helpers/fake_redis_node.tcl
new file mode 100644
index 00000000..a12d87fe
--- /dev/null
+++ b/redis-stable/tests/helpers/fake_redis_node.tcl
@@ -0,0 +1,58 @@
+# A fake Redis node for replaying predefined/expected traffic with a client.
+#
+# Usage: tclsh fake_redis_node.tcl PORT COMMAND REPLY [ COMMAND REPLY [ ... ] ]
+#
+# Commands are given as space-separated strings, e.g. "GET foo", and replies as
+# RESP-encoded replies minus the trailing \r\n, e.g. "+OK".
+
+set port [lindex $argv 0];
+set expected_traffic [lrange $argv 1 end];
+
+# Reads and parses a command from a socket and returns it as a space-separated
+# string, e.g. "set foo bar".
+proc read_command {sock} {
+    set char [read $sock 1]
+    switch $char {
+        * {
+            set numargs [gets $sock]
+            set result {}
+            for {set i 0} {$i<$numargs} {incr i} {
+                read $sock 1;       # dollar sign
+                set len [gets $sock]
+                set str [read $sock $len]
+                gets $sock;         # trailing \r\n
+                lappend result $str
+            }
+            return $result
+        }
+        {} {
+            # EOF
+            return {}
+        }
+        default {
+            # Non-RESP command
+            set rest [gets $sock]
+            return "$char$rest"
+        }
+    }
+}
+
+proc accept {sock host port} {
+    global expected_traffic
+    foreach {expect_cmd reply} $expected_traffic {
+        if {[eof $sock]} {break}
+        set cmd [read_command $sock]
+        if {[string equal -nocase $cmd $expect_cmd]} {
+            puts $sock $reply
+            flush $sock
+        } else {
+            puts $sock "-ERR unexpected command $cmd"
+            break
+        }
+    }
+    close $sock
+}
+
+socket -server accept $port
+after 5000 set done timeout
+vwait done
diff --git a/redis-stable/tests/helpers/gen_write_load.tcl b/redis-stable/tests/helpers/gen_write_load.tcl
new file mode 100644
index 00000000..568f5cde
--- /dev/null
+++ b/redis-stable/tests/helpers/gen_write_load.tcl
@@ -0,0 +1,18 @@
+source tests/support/redis.tcl
+
+set ::tlsdir "tests/tls"
+
+proc gen_write_load {host port seconds tls} {
+    set start_time [clock seconds]
+    set r [redis $host $port 1 $tls]
+    $r client setname LOAD_HANDLER
+    $r select 9
+    while 1 {
+        $r set [expr rand()] [expr rand()]
+        if {[clock seconds]-$start_time > $seconds} {
+            exit 0
+        }
+    }
+}
+
+gen_write_load [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3]
diff --git a/redis-stable/tests/instances.tcl b/redis-stable/tests/instances.tcl
new file mode 100644
index 00000000..1395efa0
--- /dev/null
+++ b/redis-stable/tests/instances.tcl
@@ -0,0 +1,673 @@
+# Multi-instance test framework.
+# This is used in order to test Sentinel and Redis Cluster, and provides
+# basic capabilities for spawning and handling N parallel Redis / Sentinel
+# instances.
+#
+# Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
+# This software is released under the BSD License. See the COPYING file for
+# more information.
+
+package require Tcl 8.5
+
+set tcl_precision 17
+source ../support/redis.tcl
+source ../support/util.tcl
+source ../support/server.tcl
+source ../support/test.tcl
+
+set ::verbose 0
+set ::valgrind 0
+set ::tls 0
+set ::pause_on_error 0
+set ::dont_clean 0
+set ::simulate_error 0
+set ::failed 0
+set ::sentinel_instances {}
+set ::redis_instances {}
+set ::global_config {}
+set ::sentinel_base_port 20000
+set ::redis_base_port 30000
+set ::redis_port_count 1024
+set ::host "127.0.0.1"
+set ::leaked_fds_file [file normalize "tmp/leaked_fds.txt"]
+set ::pids {} ; # We kill everything at exit
+set ::dirs {} ; # We remove all the temp dirs at exit
+set ::run_matching {} ; # If non empty, only tests matching pattern are run.
+
+if {[catch {cd tmp}]} {
+    puts "tmp directory not found."
+    puts "Please run this test from the Redis source root."
+    exit 1
+}
+
+# Execute the specified instance of the server specified by 'type', using
+# the provided configuration file. Returns the PID of the process.
+proc exec_instance {type dirname cfgfile} {
+    if {$type eq "redis"} {
+        set prgname redis-server
+    } elseif {$type eq "sentinel"} {
+        set prgname redis-sentinel
+    } else {
+        error "Unknown instance type."
+    }
+
+    set errfile [file join $dirname err.txt]
+    if {$::valgrind} {
+        set pid [exec valgrind --track-origins=yes --suppressions=../../../src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full ../../../src/${prgname} $cfgfile 2>> $errfile &]
+    } else {
+        set pid [exec ../../../src/${prgname} $cfgfile 2>> $errfile &]
+    }
+    return $pid
+}
+
+# Spawn a redis or sentinel instance, depending on 'type'.
+proc spawn_instance {type base_port count {conf {}} {base_conf_file ""}} {
+    for {set j 0} {$j < $count} {incr j} {
+        set port [find_available_port $base_port $::redis_port_count]
+        # plaintext port (only used for TLS cluster)
+        set pport 0
+        # Create a directory for this instance.
+        set dirname "${type}_${j}"
+        lappend ::dirs $dirname
+        catch {exec rm -rf $dirname}
+        file mkdir $dirname
+
+        # Write the instance config file.
+        set cfgfile [file join $dirname $type.conf]
+        if {$base_conf_file ne ""} {
+            file copy -- $base_conf_file $cfgfile
+            set cfg [open $cfgfile a+]
+        } else {
+            set cfg [open $cfgfile w]
+        }
+
+        if {$::tls} {
+            puts $cfg "tls-port $port"
+            puts $cfg "tls-replication yes"
+            puts $cfg "tls-cluster yes"
+            # plaintext port, only used by plaintext clients in a TLS cluster
+            set pport [find_available_port $base_port $::redis_port_count]
+            puts $cfg "port $pport"
+            puts $cfg [format "tls-cert-file %s/../../tls/server.crt" [pwd]]
+            puts $cfg [format "tls-key-file %s/../../tls/server.key" [pwd]]
+            puts $cfg [format "tls-client-cert-file %s/../../tls/client.crt" [pwd]]
+            puts $cfg [format "tls-client-key-file %s/../../tls/client.key" [pwd]]
+            puts $cfg [format "tls-dh-params-file %s/../../tls/redis.dh" [pwd]]
+            puts $cfg [format "tls-ca-cert-file %s/../../tls/ca.crt" [pwd]]
+            puts $cfg "loglevel debug"
+        } else {
+            puts $cfg "port $port"
+        }
+        puts $cfg "dir ./$dirname"
+        puts $cfg "logfile log.txt"
+        # Add additional config files
+        foreach directive $conf {
+            puts $cfg $directive
+        }
+        dict for {name val} $::global_config {
+            puts $cfg "$name $val"
+        }
+        close $cfg
+
+        # Finally exec it and remember the pid for later cleanup.
+        set retry 100
+        while {$retry} {
+            set pid [exec_instance $type $dirname $cfgfile]
+
+            # Check availability
+            if {[server_is_up 127.0.0.1 $port 100] == 0} {
+                puts "Starting $type #$j at port $port failed, try another"
+                incr retry -1
+                set port [find_available_port $base_port $::redis_port_count]
+                set cfg [open $cfgfile a+]
+                if {$::tls} {
+                    puts $cfg "tls-port $port"
+                    set pport [find_available_port $base_port $::redis_port_count]
+                    puts $cfg "port $pport"
+                } else {
+                    puts $cfg "port $port"
+                }
+                close $cfg
+            } else {
+                puts "Starting $type #$j at port $port"
+                lappend ::pids $pid
+                break
+            }
+        }
+
+        # Check availability finally
+        if {[server_is_up $::host $port 100] == 0} {
+            set logfile [file join $dirname log.txt]
+            puts [exec tail $logfile]
+            abort_sentinel_test "Problems starting $type #$j: ping timeout, maybe server start failed, check $logfile"
+        }
+
+        # Push the instance into the right list
+        set link [redis $::host $port 0 $::tls]
+        $link reconnect 1
+        lappend ::${type}_instances [list \
+            pid $pid \
+            host $::host \
+            port $port \
+            plaintext-port $pport \
+            link $link \
+        ]
+    }
+}
+
+proc log_crashes {} {
+    set start_pattern {*REDIS BUG REPORT START*}
+    set logs [glob */log.txt]
+    foreach log $logs {
+        set fd [open $log]
+        set found 0
+        while {[gets $fd line] >= 0} {
+            if {[string match $start_pattern $line]} {
+                puts "\n*** Crash report found in $log ***"
+                set found 1
+            }
+            if {$found} {
+                puts $line
+                incr ::failed
+            }
+        }
+    }
+
+    set logs [glob */err.txt]
+    foreach log $logs {
+        set res [find_valgrind_errors $log true]
+        if {$res != ""} {
+            puts $res
+            incr ::failed
+        }
+    }
+}
+
+proc is_alive pid {
+    if {[catch {exec ps -p $pid} err]} {
+        return 0
+    } else {
+        return 1
+    }
+}
+
+proc stop_instance pid {
+    catch {exec kill $pid}
+    # Node might have been stopped in the test
+    catch {exec kill -SIGCONT $pid}
+    if {$::valgrind} {
+        set max_wait 60000
+    } else {
+        set max_wait 10000
+    }
+    while {[is_alive $pid]} {
+        incr wait 10
+
+        if {$wait >= $max_wait} {
+            puts "Forcing process $pid to exit..."
+            catch {exec kill -KILL $pid}
+        } elseif {$wait % 1000 == 0} {
+            puts "Waiting for process $pid to exit..."
+        }
+        after 10
+    }
+}
+
+proc cleanup {} {
+    puts "Cleaning up..."
+    foreach pid $::pids {
+        puts "killing stale instance $pid"
+        stop_instance $pid
+    }
+    log_crashes
+    if {$::dont_clean} {
+        return
+    }
+    foreach dir $::dirs {
+        catch {exec rm -rf $dir}
+    }
+}
+
+proc abort_sentinel_test msg {
+    incr ::failed
+    puts "WARNING: Aborting the test."
+    puts ">>>>>>>> $msg"
+    if {$::pause_on_error} pause_on_error
+    cleanup
+    exit 1
+}
+
+proc parse_options {} {
+    for {set j 0} {$j < [llength $::argv]} {incr j} {
+        set opt [lindex $::argv $j]
+        set val [lindex $::argv [expr $j+1]]
+        if {$opt eq "--single"} {
+            incr j
+            set ::run_matching "*${val}*"
+        } elseif {$opt eq "--pause-on-error"} {
+            set ::pause_on_error 1
+        } elseif {$opt eq {--dont-clean}} {
+            set ::dont_clean 1
+        } elseif {$opt eq "--fail"} {
+            set ::simulate_error 1
+        } elseif {$opt eq {--valgrind}} {
+            set ::valgrind 1
+        } elseif {$opt eq {--host}} {
+            incr j
+            set ::host ${val}
+        } elseif {$opt eq {--tls}} {
+            package require tls 1.6
+            ::tls::init \
+                -cafile "$::tlsdir/ca.crt" \
+                -certfile "$::tlsdir/client.crt" \
+                -keyfile "$::tlsdir/client.key"
+            set ::tls 1
+        } elseif {$opt eq {--config}} {
+            set val2 [lindex $::argv [expr $j+2]]
+            dict set ::global_config $val $val2
+            incr j 2
+        } elseif {$opt eq "--help"} {
+            puts "--single <pattern>      Only runs tests specified by pattern."
+            puts "--dont-clean            Keep log files on exit."
+            puts "--pause-on-error        Pause for manual inspection on error."
+            puts "--fail                  Simulate a test failure."
+            puts "--valgrind              Run with valgrind."
+            puts "--tls                   Run tests in TLS mode."
+            puts "--host <host>           Use hostname instead of 127.0.0.1."
+            puts "--config <k> <v>        Extra config argument(s)."
+            puts "--help                  Shows this help."
+            exit 0
+        } else {
+            puts "Unknown option $opt"
+            exit 1
+        }
+    }
+}
+
+# If --pause-on-error option was passed at startup this function is called
+# on error in order to give the developer a chance to understand more about
+# the error condition while the instances are still running.
+proc pause_on_error {} {
+    puts ""
+    puts [colorstr yellow "*** Please inspect the error now ***"]
+    puts "\nType \"continue\" to resume the test, \"help\" for help screen.\n"
+    while 1 {
+        puts -nonewline "> "
+        flush stdout
+        set line [gets stdin]
+        set argv [split $line " "]
+        set cmd [lindex $argv 0]
+        if {$cmd eq {continue}} {
+            break
+        } elseif {$cmd eq {show-redis-logs}} {
+            set count 10
+            if {[lindex $argv 1] ne {}} {set count [lindex $argv 1]}
+            foreach_redis_id id {
+                puts "=== REDIS $id ===="
+                puts [exec tail -$count redis_$id/log.txt]
+                puts "---------------------\n"
+            }
+        } elseif {$cmd eq {show-sentinel-logs}} {
+            set count 10
+            if {[lindex $argv 1] ne {}} {set count [lindex $argv 1]}
+            foreach_sentinel_id id {
+                puts "=== SENTINEL $id ===="
+                puts [exec tail -$count sentinel_$id/log.txt]
+                puts "---------------------\n"
+            }
+        } elseif {$cmd eq {ls}} {
+            foreach_redis_id id {
+                puts -nonewline "Redis $id"
+                set errcode [catch {
+                    set str {}
+                    append str "@[RI $id tcp_port]: "
+                    append str "[RI $id role] "
+                    if {[RI $id role] eq {slave}} {
+                        append str "[RI $id master_host]:[RI $id master_port]"
+                    }
+                    set str
+                } retval]
+                if {$errcode} {
+                    puts " -- $retval"
+                } else {
+                    puts $retval
+                }
+            }
+            foreach_sentinel_id id {
+                puts -nonewline "Sentinel $id"
+                set errcode [catch {
+                    set str {}
+                    append str "@[SI $id tcp_port]: "
+                    append str "[join [S $id sentinel get-master-addr-by-name mymaster]]"
+                    set str
+                } retval]
+                if {$errcode} {
+                    puts " -- $retval"
+                } else {
+                    puts $retval
+                }
+            }
+        } elseif {$cmd eq {help}} {
+            puts "ls                     List Sentinel and Redis instances."
+            puts "show-sentinel-logs \[N\] Show latest N lines of logs."
+            puts "show-redis-logs \[N\]    Show latest N lines of logs."
+            puts "S <id> cmd ... arg     Call command in Sentinel <id>."
+            puts "R <id> cmd ... arg     Call command in Redis <id>."
+            puts "SI <id> <field>        Show Sentinel <id> INFO <field>."
+            puts "RI <id> <field>        Show Redis <id> INFO <field>."
+            puts "continue               Resume test."
+        } else {
+            set errcode [catch {eval $line} retval]
+            if {$retval ne {}} {puts "$retval"}
+        }
+    }
+}
+
+# We redefine 'test' as for Sentinel we don't use the server-client
+# architecture for the test, everything is sequential.
+proc test {descr code} {
+    set ts [clock format [clock seconds] -format %H:%M:%S]
+    puts -nonewline "$ts> $descr: "
+    flush stdout
+
+    if {[catch {set retval [uplevel 1 $code]} error]} {
+        incr ::failed
+        if {[string match "assertion:*" $error]} {
+            set msg [string range $error 10 end]
+            puts [colorstr red $msg]
+            if {$::pause_on_error} pause_on_error
+            puts "(Jumping to next unit after error)"
+            return -code continue
+        } else {
+            # Re-raise, let handler up the stack take care of this.
+            error $error $::errorInfo
+        }
+    } else {
+        puts [colorstr green OK]
+    }
+}
+
+# Check memory leaks when running on OSX using the "leaks" utility.
+proc check_leaks instance_types {
+    if {[string match {*Darwin*} [exec uname -a]]} {
+        puts -nonewline "Testing for memory leaks..."; flush stdout
+        foreach type $instance_types {
+            foreach_instance_id [set ::${type}_instances] id {
+                if {[instance_is_killed $type $id]} continue
+                set pid [get_instance_attrib $type $id pid]
+                set output {0 leaks}
+                catch {exec leaks $pid} output
+                if {[string match {*process does not exist*} $output] ||
+                    [string match {*cannot examine*} $output]} {
+                    # In a few tests we kill the server process.
+                    set output "0 leaks"
+                } else {
+                    puts -nonewline "$type/$pid "
+                    flush stdout
+                }
+                if {![string match {*0 leaks*} $output]} {
+                    puts [colorstr red "=== MEMORY LEAK DETECTED ==="]
+                    puts "Instance type $type, ID $id:"
+                    puts $output
+                    puts "==="
+                    incr ::failed
+                }
+            }
+        }
+        puts ""
+    }
+}
+
+# Execute all the units inside the 'tests' directory.
+proc run_tests {} {
+    set tests [lsort [glob ../tests/*]]
+    foreach test $tests {
+        # Remove leaked_fds file before starting
+        if {$::leaked_fds_file != "" && [file exists $::leaked_fds_file]} {
+            file delete $::leaked_fds_file
+        }
+
+        if {$::run_matching ne {} && [string match $::run_matching $test] == 0} {
+            continue
+        }
+        if {[file isdirectory $test]} continue
+        puts [colorstr yellow "Testing unit: [lindex [file split $test] end]"]
+        source $test
+        check_leaks {redis sentinel}
+
+        # Check if a leaked fds file was created and abort the test.
+        if {$::leaked_fds_file != "" && [file exists $::leaked_fds_file]} {
+            puts [colorstr red "ERROR: Sentinel has leaked fds to scripts:"]
+            puts [exec cat $::leaked_fds_file]
+            puts "----"
+            incr ::failed
+        }
+    }
+}
+
+# Print a message and exists with 0 / 1 according to zero or more failures.
+proc end_tests {} {
+    if {$::failed == 0 } {
+        puts "GOOD! No errors."
+        exit 0
+    } else {
+        puts "WARNING $::failed test(s) failed."
+        exit 1
+    }
+}
+
+# The "S" command is used to interact with the N-th Sentinel.
+# The general form is:
+#
+# S <sentinel-id> command arg arg arg ...
+#
+# Example to ping the Sentinel 0 (first instance): S 0 PING
+proc S {n args} {
+    set s [lindex $::sentinel_instances $n]
+    [dict get $s link] {*}$args
+}
+
+# Returns a Redis instance by index.
+# Example:
+#     [Rn 0] info
+proc Rn {n} {
+    return [dict get [lindex $::redis_instances $n] link]
+}
+
+# Like R but to chat with Redis instances.
+proc R {n args} {
+    [Rn $n] {*}$args
+}
+
+proc get_info_field {info field} {
+    set fl [string length $field]
+    append field :
+    foreach line [split $info "\n"] {
+        set line [string trim $line "\r\n "]
+        if {[string range $line 0 $fl] eq $field} {
+            return [string range $line [expr {$fl+1}] end]
+        }
+    }
+    return {}
+}
+
+proc SI {n field} {
+    get_info_field [S $n info] $field
+}
+
+proc RI {n field} {
+    get_info_field [R $n info] $field
+}
+
+proc RPort {n} {
+    if {$::tls} {
+        return [lindex [R $n config get tls-port] 1]
+    } else {
+        return [lindex [R $n config get port] 1]
+    }
+}
+
+# Iterate over IDs of sentinel or redis instances.
+proc foreach_instance_id {instances idvar code} {
+    upvar 1 $idvar id
+    for {set id 0} {$id < [llength $instances]} {incr id} {
+        set errcode [catch {uplevel 1 $code} result]
+        if {$errcode == 1} {
+            error $result $::errorInfo $::errorCode
+        } elseif {$errcode == 4} {
+            continue
+        } elseif {$errcode == 3} {
+            break
+        } elseif {$errcode != 0} {
+            return -code $errcode $result
+        }
+    }
+}
+
+proc foreach_sentinel_id {idvar code} {
+    set errcode [catch {uplevel 1 [list foreach_instance_id $::sentinel_instances $idvar $code]} result]
+    return -code $errcode $result
+}
+
+proc foreach_redis_id {idvar code} {
+    set errcode [catch {uplevel 1 [list foreach_instance_id $::redis_instances $idvar $code]} result]
+    return -code $errcode $result
+}
+
+# Get the specific attribute of the specified instance type, id.
+proc get_instance_attrib {type id attrib} {
+    dict get [lindex [set ::${type}_instances] $id] $attrib
+}
+
+# Set the specific attribute of the specified instance type, id.
+proc set_instance_attrib {type id attrib newval} {
+    set d [lindex [set ::${type}_instances] $id]
+    dict set d $attrib $newval
+    lset ::${type}_instances $id $d
+}
+
+# Create a master-slave cluster of the given number of total instances.
+# The first instance "0" is the master, all others are configured as
+# slaves.
+proc create_redis_master_slave_cluster n {
+    foreach_redis_id id {
+        if {$id == 0} {
+            # Our master.
+            R $id slaveof no one
+            R $id flushall
+        } elseif {$id < $n} {
+            R $id slaveof [get_instance_attrib redis 0 host] \
+                          [get_instance_attrib redis 0 port]
+        } else {
+            # Instances not part of the cluster.
+            R $id slaveof no one
+        }
+    }
+    # Wait for all the slaves to sync.
+    wait_for_condition 1000 50 {
+        [RI 0 connected_slaves] == ($n-1)
+    } else {
+        fail "Unable to create a master-slaves cluster."
+    }
+}
+
+proc get_instance_id_by_port {type port} {
+    foreach_${type}_id id {
+        if {[get_instance_attrib $type $id port] == $port} {
+            return $id
+        }
+    }
+    fail "Instance $type port $port not found."
+}
+
+# Kill an instance of the specified type/id with SIGKILL.
+# This function will mark the instance PID as -1 to remember that this instance
+# is no longer running and will remove its PID from the list of pids that
+# we kill at cleanup.
+#
+# The instance can be restarted with restart-instance.
+proc kill_instance {type id} {
+    set pid [get_instance_attrib $type $id pid]
+    set port [get_instance_attrib $type $id port]
+
+    if {$pid == -1} {
+        error "You tried to kill $type $id twice."
+    }
+
+    stop_instance $pid
+    set_instance_attrib $type $id pid -1
+    set_instance_attrib $type $id link you_tried_to_talk_with_killed_instance
+
+    # Remove the PID from the list of pids to kill at exit.
+    set ::pids [lsearch -all -inline -not -exact $::pids $pid]
+
+    # Wait for the port it was using to be available again, so that's not
+    # an issue to start a new server ASAP with the same port.
+    set retry 100
+    while {[incr retry -1]} {
+        set port_is_free [catch {set s [socket 127.0.0.1 $port]}]
+        if {$port_is_free} break
+        catch {close $s}
+        after 100
+    }
+    if {$retry == 0} {
+        error "Port $port does not return available after killing instance."
+    }
+}
+
+# Return true of the instance of the specified type/id is killed.
+proc instance_is_killed {type id} {
+    set pid [get_instance_attrib $type $id pid]
+    expr {$pid == -1}
+}
+
+# Restart an instance previously killed by kill_instance
+proc restart_instance {type id} {
+    set dirname "${type}_${id}"
+    set cfgfile [file join $dirname $type.conf]
+    set port [get_instance_attrib $type $id port]
+
+    # Execute the instance with its old setup and append the new pid
+    # file for cleanup.
+    set pid [exec_instance $type $dirname $cfgfile]
+    set_instance_attrib $type $id pid $pid
+    lappend ::pids $pid
+
+    # Check that the instance is running
+    if {[server_is_up 127.0.0.1 $port 100] == 0} {
+        set logfile [file join $dirname log.txt]
+        puts [exec tail $logfile]
+        abort_sentinel_test "Problems starting $type #$id: ping timeout, maybe server start failed, check $logfile"
+    }
+
+    # Connect with it with a fresh link
+    set link [redis 127.0.0.1 $port 0 $::tls]
+    $link reconnect 1
+    set_instance_attrib $type $id link $link
+
+    # Make sure the instance is not loading the dataset when this
+    # function returns.
+    while 1 {
+        catch {[$link ping]} retval
+        if {[string match {*LOADING*} $retval]} {
+            after 100
+            continue
+        } else {
+            break
+        }
+    }
+}
+
+proc redis_deferring_client {type id} {
+    set port [get_instance_attrib $type $id port]
+    set host [get_instance_attrib $type $id host]
+    set client [redis $host $port 1 $::tls]
+    return $client
+}
+
+proc redis_client {type id} {
+    set port [get_instance_attrib $type $id port]
+    set host [get_instance_attrib $type $id host]
+    set client [redis $host $port 0 $::tls]
+    return $client
+}
diff --git a/redis-stable/tests/integration/aof-race.tcl b/redis-stable/tests/integration/aof-race.tcl
new file mode 100644
index 00000000..2991e796
--- /dev/null
+++ b/redis-stable/tests/integration/aof-race.tcl
@@ -0,0 +1,36 @@
+set defaults { appendonly {yes} appendfilename {appendonly.aof} aof-use-rdb-preamble {no} }
+set server_path [tmpdir server.aof]
+set aof_path "$server_path/appendonly.aof"
+
+proc start_server_aof {overrides code} {
+    upvar defaults defaults srv srv server_path server_path
+    set config [concat $defaults $overrides]
+    start_server [list overrides $config] $code
+}
+
+tags {"aof"} {
+    # Specific test for a regression where internal buffers were not properly
+    # cleaned after a child responsible for an AOF rewrite exited. This buffer
+    # was subsequently appended to the new AOF, resulting in duplicate commands.
+    start_server_aof [list dir $server_path] {
+        set client [redis [srv host] [srv port] 0 $::tls]
+        set bench [open "|src/redis-benchmark -q -s [srv unixsocket] -c 20 -n 20000 incr foo" "r+"]
+
+        after 100
+
+        # Benchmark should be running by now: start background rewrite
+        $client bgrewriteaof
+
+        # Read until benchmark pipe reaches EOF
+        while {[string length [read $bench]] > 0} {}
+
+        # Check contents of foo
+        assert_equal 20000 [$client get foo]
+    }
+
+    # Restart server to replay AOF
+    start_server_aof [list dir $server_path] {
+        set client [redis [srv host] [srv port] 0 $::tls]
+        assert_equal 20000 [$client get foo]
+    }
+}
diff --git a/redis-stable/tests/integration/aof.tcl b/redis-stable/tests/integration/aof.tcl
new file mode 100644
index 00000000..abe2dc10
--- /dev/null
+++ b/redis-stable/tests/integration/aof.tcl
@@ -0,0 +1,298 @@
+set defaults { appendonly {yes} appendfilename {appendonly.aof} }
+set server_path [tmpdir server.aof]
+set aof_path "$server_path/appendonly.aof"
+
+proc append_to_aof {str} {
+    upvar fp fp
+    puts -nonewline $fp $str
+}
+
+proc create_aof {code} {
+    upvar fp fp aof_path aof_path
+    set fp [open $aof_path w+]
+    uplevel 1 $code
+    close $fp
+}
+
+proc start_server_aof {overrides code} {
+    upvar defaults defaults srv srv server_path server_path
+    set config [concat $defaults $overrides]
+    set srv [start_server [list overrides $config]]
+    uplevel 1 $code
+    kill_server $srv
+}
+
+tags {"aof"} {
+    ## Server can start when aof-load-truncated is set to yes and AOF
+    ## is truncated, with an incomplete MULTI block.
+    create_aof {
+        append_to_aof [formatCommand set foo hello]
+        append_to_aof [formatCommand multi]
+        append_to_aof [formatCommand set bar world]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated yes] {
+        test "Unfinished MULTI: Server should start if load-truncated is yes" {
+            assert_equal 1 [is_alive $srv]
+        }
+    }
+
+    ## Should also start with truncated AOF without incomplete MULTI block.
+    create_aof {
+        append_to_aof [formatCommand incr foo]
+        append_to_aof [formatCommand incr foo]
+        append_to_aof [formatCommand incr foo]
+        append_to_aof [formatCommand incr foo]
+        append_to_aof [formatCommand incr foo]
+        append_to_aof [string range [formatCommand incr foo] 0 end-1]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated yes] {
+        test "Short read: Server should start if load-truncated is yes" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "Truncated AOF loaded: we expect foo to be equal to 5" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert {[$client get foo] eq "5"}
+        }
+
+        test "Append a new command after loading an incomplete AOF" {
+            $client incr foo
+        }
+    }
+
+    # Now the AOF file is expected to be correct
+    start_server_aof [list dir $server_path aof-load-truncated yes] {
+        test "Short read + command: Server should start" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "Truncated AOF loaded: we expect foo to be equal to 6 now" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert {[$client get foo] eq "6"}
+        }
+    }
+
+    ## Test that the server exits when the AOF contains a format error
+    create_aof {
+        append_to_aof [formatCommand set foo hello]
+        append_to_aof "!!!"
+        append_to_aof [formatCommand set foo hello]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated yes] {
+        test "Bad format: Server should have logged an error" {
+            set pattern "*Bad file format reading the append only file*"
+            set retry 10
+            while {$retry} {
+                set result [exec tail -1 < [dict get $srv stdout]]
+                if {[string match $pattern $result]} {
+                    break
+                }
+                incr retry -1
+                after 1000
+            }
+            if {$retry == 0} {
+                error "assertion:expected error not found on config file"
+            }
+        }
+    }
+
+    ## Test the server doesn't start when the AOF contains an unfinished MULTI
+    create_aof {
+        append_to_aof [formatCommand set foo hello]
+        append_to_aof [formatCommand multi]
+        append_to_aof [formatCommand set bar world]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated no] {
+        test "Unfinished MULTI: Server should have logged an error" {
+            set pattern "*Unexpected end of file reading the append only file*"
+            set retry 10
+            while {$retry} {
+                set result [exec tail -1 < [dict get $srv stdout]]
+                if {[string match $pattern $result]} {
+                    break
+                }
+                incr retry -1
+                after 1000
+            }
+            if {$retry == 0} {
+                error "assertion:expected error not found on config file"
+            }
+        }
+    }
+
+    ## Test that the server exits when the AOF contains a short read
+    create_aof {
+        append_to_aof [formatCommand set foo hello]
+        append_to_aof [string range [formatCommand set bar world] 0 end-1]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated no] {
+        test "Short read: Server should have logged an error" {
+            set pattern "*Unexpected end of file reading the append only file*"
+            set retry 10
+            while {$retry} {
+                set result [exec tail -1 < [dict get $srv stdout]]
+                if {[string match $pattern $result]} {
+                    break
+                }
+                incr retry -1
+                after 1000
+            }
+            if {$retry == 0} {
+                error "assertion:expected error not found on config file"
+            }
+        }
+    }
+
+    ## Test that redis-check-aof indeed sees this AOF is not valid
+    test "Short read: Utility should confirm the AOF is not valid" {
+        catch {
+            exec src/redis-check-aof $aof_path
+        } result
+        assert_match "*not valid*" $result
+    }
+
+    test "Short read: Utility should show the abnormal line num in AOF" {
+        create_aof {
+            append_to_aof [formatCommand set foo hello]
+            append_to_aof "!!!"
+        }
+
+        catch {
+            exec src/redis-check-aof $aof_path
+        } result
+        assert_match "*ok_up_to_line=8*" $result
+    }
+
+    test "Short read: Utility should be able to fix the AOF" {
+        set result [exec src/redis-check-aof --fix $aof_path << "y\n"]
+        assert_match "*Successfully truncated AOF*" $result
+    }
+
+    ## Test that the server can be started using the truncated AOF
+    start_server_aof [list dir $server_path aof-load-truncated no] {
+        test "Fixed AOF: Server should have been started" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "Fixed AOF: Keyspace should contain values that were parseable" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert_equal "hello" [$client get foo]
+            assert_equal "" [$client get bar]
+        }
+    }
+
+    ## Test that SPOP (that modifies the client's argc/argv) is correctly free'd
+    create_aof {
+        append_to_aof [formatCommand sadd set foo]
+        append_to_aof [formatCommand sadd set bar]
+        append_to_aof [formatCommand spop set]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated no] {
+        test "AOF+SPOP: Server should have been started" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "AOF+SPOP: Set should have 1 member" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert_equal 1 [$client scard set]
+        }
+    }
+
+    ## Uses the alsoPropagate() API.
+    create_aof {
+        append_to_aof [formatCommand sadd set foo]
+        append_to_aof [formatCommand sadd set bar]
+        append_to_aof [formatCommand sadd set gah]
+        append_to_aof [formatCommand spop set 2]
+    }
+
+    start_server_aof [list dir $server_path] {
+        test "AOF+SPOP: Server should have been started" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "AOF+SPOP: Set should have 1 member" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert_equal 1 [$client scard set]
+        }
+    }
+
+    ## Test that EXPIREAT is loaded correctly
+    create_aof {
+        append_to_aof [formatCommand rpush list foo]
+        append_to_aof [formatCommand expireat list 1000]
+        append_to_aof [formatCommand rpush list bar]
+    }
+
+    start_server_aof [list dir $server_path aof-load-truncated no] {
+        test "AOF+EXPIRE: Server should have been started" {
+            assert_equal 1 [is_alive $srv]
+        }
+
+        test "AOF+EXPIRE: List should be empty" {
+            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
+            wait_done_loading $client
+            assert_equal 0 [$client llen list]
+        }
+    }
+
+    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof}}} {
+        test {Redis should not try to convert DEL into EXPIREAT for EXPIRE -1} {
+            r set x 10
+            r expire x -1
+        }
+    }
+
+    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof} appendfsync always}} {
+        test {AOF fsync always barrier issue} {
+            set rd [redis_deferring_client]
+            # Set a sleep when aof is flushed, so that we have a chance to look
+            # at the aof size and detect if the response of an incr command
+            # arrives before the data was written (and hopefully fsynced)
+            # We create a big reply, which will hopefully not have room in the
+            # socket buffers, and will install a write handler, then we sleep
+            # a big and issue the incr command, hoping that the last portion of
+            # the output buffer write, and the processing of the incr will happen
+            # in the same event loop cycle.
+            # Since the socket buffers and timing are unpredictable, we fuzz this
+            # test with slightly different sizes and sleeps a few times.
+            for {set i 0} {$i < 10} {incr i} {
+                r debug aof-flush-sleep 0
+                r del x
+                r setrange x [expr {int(rand()*5000000)+10000000}] x
+                r debug aof-flush-sleep 500000
+                set aof [file join [lindex [r config get dir] 1] appendonly.aof]
+                set size1 [file size $aof]
+                $rd get x
+                after [expr {int(rand()*30)}]
+                $rd incr new_value
+                $rd read
+                $rd read
+                set size2 [file size $aof]
+                assert {$size1 != $size2}
+            }
+        }
+    }
+
+    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof}}} {
+        test {GETEX should not append to AOF} {
+            set aof [file join [lindex [r config get dir] 1] appendonly.aof]
+            r set foo bar
+            set before [file size $aof]
+            r getex foo
+            set after [file size $aof]
+            assert_equal $before $after
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/block-repl.tcl b/redis-stable/tests/integration/block-repl.tcl
new file mode 100644
index 00000000..7c2ba840
--- /dev/null
+++ b/redis-stable/tests/integration/block-repl.tcl
@@ -0,0 +1,51 @@
+# Test replication of blocking lists and zset operations.
+# Unlike stream operations such operations are "pop" style, so they consume
+# the list or sorted set, and must be replicated correctly.
+
+proc start_bg_block_op {host port db ops tls} {
+    set tclsh [info nameofexecutable]
+    exec $tclsh tests/helpers/bg_block_op.tcl $host $port $db $ops $tls &
+}
+
+proc stop_bg_block_op {handle} {
+    catch {exec /bin/kill -9 $handle}
+}
+
+start_server {tags {"repl"}} {
+    start_server {} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        set load_handle0 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
+        set load_handle1 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
+        set load_handle2 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
+
+        test {First server should have role slave after SLAVEOF} {
+            $slave slaveof $master_host $master_port
+            after 1000
+            s 0 role
+        } {slave}
+
+        test {Test replication with blocking lists and sorted sets operations} {
+            after 25000
+            stop_bg_block_op $load_handle0
+            stop_bg_block_op $load_handle1
+            stop_bg_block_op $load_handle2
+            wait_for_condition 100 100 {
+                [$master debug digest] == [$slave debug digest]
+            } else {
+                set csv1 [csvdump r]
+                set csv2 [csvdump {r -1}]
+                set fd [open /tmp/repldump1.txt w]
+                puts -nonewline $fd $csv1
+                close $fd
+                set fd [open /tmp/repldump2.txt w]
+                puts -nonewline $fd $csv2
+                close $fd
+                fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl b/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
new file mode 100644
index 00000000..cf3577f2
--- /dev/null
+++ b/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
@@ -0,0 +1,35 @@
+# Copy RDB with zipmap encoded hash to server path
+set server_path [tmpdir "server.convert-zipmap-hash-on-load"]
+
+exec cp -f tests/assets/hash-zipmap.rdb $server_path
+start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb"]] {
+  test "RDB load zipmap hash: converts to ziplist" {
+    r select 0
+
+    assert_match "*ziplist*" [r debug object hash]
+    assert_equal 2 [r hlen hash]
+    assert_match {v1 v2} [r hmget hash f1 f2]
+  }
+}
+
+exec cp -f tests/assets/hash-zipmap.rdb $server_path
+start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb" "hash-max-ziplist-entries" 1]] {
+  test "RDB load zipmap hash: converts to hash table when hash-max-ziplist-entries is exceeded" {
+    r select 0
+
+    assert_match "*hashtable*" [r debug object hash]
+    assert_equal 2 [r hlen hash]
+    assert_match {v1 v2} [r hmget hash f1 f2]
+  }
+}
+
+exec cp -f tests/assets/hash-zipmap.rdb $server_path
+start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb" "hash-max-ziplist-value" 1]] {
+  test "RDB load zipmap hash: converts to hash table when hash-max-ziplist-value is exceeded" {
+    r select 0
+
+    assert_match "*hashtable*" [r debug object hash]
+    assert_equal 2 [r hlen hash]
+    assert_match {v1 v2} [r hmget hash f1 f2]
+  }
+}
diff --git a/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl b/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
new file mode 100644
index 00000000..86cd8121
--- /dev/null
+++ b/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
@@ -0,0 +1,208 @@
+# tests of corrupt ziplist payload with valid CRC
+
+tags {"dump" "corruption"} {
+
+proc generate_collections {suffix elements} {
+    set rd [redis_deferring_client]
+    for {set j 0} {$j < $elements} {incr j} {
+        # add both string values and integers
+        if {$j % 2 == 0} {set val $j} else {set val "_$j"}
+        $rd hset hash$suffix $j $val
+        $rd lpush list$suffix $val
+        $rd zadd zset$suffix $j $val
+        $rd sadd set$suffix $val
+        $rd xadd stream$suffix * item 1 value $val
+    }
+    for {set j 0} {$j < $elements * 5} {incr j} {
+        $rd read ; # Discard replies
+    }
+    $rd close
+}
+
+# generate keys with various types and encodings
+proc generate_types {} {
+    r config set list-max-ziplist-size 5
+    r config set hash-max-ziplist-entries 5
+    r config set zset-max-ziplist-entries 5
+    r config set stream-node-max-entries 5
+
+    # create small (ziplist / listpack encoded) objects with 3 items
+    generate_collections "" 3
+
+    # add some metadata to the stream
+    r xgroup create stream mygroup 0
+    set records [r xreadgroup GROUP mygroup Alice COUNT 2 STREAMS stream >]
+    r xdel stream [lindex [lindex [lindex [lindex $records 0] 1] 1] 0]
+    r xack stream mygroup [lindex [lindex [lindex [lindex $records 0] 1] 0] 0]
+
+    # create other non-collection types
+    r incr int
+    r set string str
+
+    # create bigger objects with 10 items (more than a single ziplist / listpack)
+    generate_collections big 10
+
+    # make sure our big stream also has a listpack record that has different
+    # field names than the master recored
+    r xadd streambig * item 1 value 1
+    r xadd streambig * item 1 unique value
+}
+
+proc corrupt_payload {payload} {
+    set len [string length $payload]
+    set count 1 ;# usually corrupt only one byte
+    if {rand() > 0.9} { set count 2 }
+    while { $count > 0 } {
+        set idx [expr {int(rand() * $len)}]
+        set ch [binary format c [expr {int(rand()*255)}]]
+        set payload [string replace $payload $idx $idx $ch]
+        incr count -1
+    }
+    return $payload
+}
+
+# fuzzy tester for corrupt RESTORE payloads
+# valgrind will make sure there were no leaks in the rdb loader error handling code
+foreach sanitize_dump {no yes} {
+    if {$::accurate} {
+        set min_duration [expr {60 * 10}] ;# run at least 10 minutes
+        set min_cycles 1000 ;# run at least 1k cycles (max 16 minutes)
+    } else {
+        set min_duration 10 ; # run at least 10 seconds
+        set min_cycles 10 ; # run at least 10 cycles
+    }
+
+    # Don't execute this on FreeBSD due to a yet-undiscovered memory issue
+    # which causes tclsh to bloat.
+    if {[exec uname] == "FreeBSD"} {
+        set min_cycles 1
+        set min_duration 1
+    }
+
+    test "Fuzzer corrupt restore payloads - sanitize_dump: $sanitize_dump" {
+        if {$min_duration * 2 > $::timeout} {
+            fail "insufficient timeout"
+        }
+        # start a server, fill with data and save an RDB file once (avoid re-save)
+        start_server [list overrides [list "save" "" use-exit-on-panic yes crash-memcheck-enabled no loglevel verbose] ] {
+            set stdout [srv 0 stdout]
+            r config set sanitize-dump-payload $sanitize_dump
+            r debug set-skip-checksum-validation 1
+            set start_time [clock seconds]
+            generate_types
+            set dbsize [r dbsize]
+            r save
+            set cycle 0
+            set stat_terminated_in_restore 0
+            set stat_terminated_in_traffic 0
+            set stat_terminated_by_signal 0
+            set stat_successful_restore 0
+            set stat_rejected_restore 0
+            set stat_traffic_commands_sent 0
+            # repeatedly DUMP a random key, corrupt it and try RESTORE into a new key
+            while true {
+                set k [r randomkey]
+                set dump [r dump $k]
+                set dump [corrupt_payload $dump]
+                set printable_dump [string2printable $dump]
+                set restore_failed false
+                set report_and_restart false
+                set sent {}
+                # RESTORE can fail, but hopefully not terminate
+                if { [catch { r restore "_$k" 0 $dump REPLACE } err] } {
+                    set restore_failed true
+                    # skip if return failed with an error response.
+                    if {[string match "ERR*" $err]} {
+                        incr stat_rejected_restore
+                    } else {
+                        set report_and_restart true
+                        incr stat_terminated_in_restore
+                        write_log_line 0 "corrupt payload: $printable_dump"
+                        if {$sanitize_dump == yes} {
+                            puts "Server crashed in RESTORE with payload: $printable_dump"
+                        }
+                    }
+                } else {
+                    r ping ;# an attempt to check if the server didn't terminate (this will throw an error that will terminate the tests)
+                }
+
+                set print_commands false
+                if {!$restore_failed} {
+                    # if RESTORE didn't fail or terminate, run some random traffic on the new key
+                    incr stat_successful_restore
+                    if { [ catch {
+                        set sent [generate_fuzzy_traffic_on_key "_$k" 1] ;# traffic for 1 second
+                        incr stat_traffic_commands_sent [llength $sent]
+                        r del "_$k" ;# in case the server terminated, here's where we'll detect it.
+                        if {$dbsize != [r dbsize]} {
+                            puts "unexpected keys"
+                            puts "keys: [r keys *]"
+                            puts $sent
+                            exit 1
+                        }
+                    } err ] } {
+                        # if the server terminated update stats and restart it
+                        set report_and_restart true
+                        incr stat_terminated_in_traffic
+                        set by_signal [count_log_message 0 "crashed by signal"]
+                        incr stat_terminated_by_signal $by_signal
+
+                        if {$by_signal != 0 || $sanitize_dump == yes} {
+                            puts "Server crashed (by signal: $by_signal), with payload: $printable_dump"
+                            set print_commands true
+                        }
+                    }
+                }
+
+                # check valgrind report for invalid reads after each RESTORE
+                # payload so that we have a report that is easier to reproduce
+                set valgrind_errors [find_valgrind_errors [srv 0 stderr] false]
+                if {$valgrind_errors != ""} {
+                    puts "valgrind found an issue for payload: $printable_dump"
+                    set report_and_restart true
+                    set print_commands true
+                }
+
+                if {$report_and_restart} {
+                    if {$print_commands} {
+                        puts "violating commands:"
+                        foreach cmd $sent {
+                            foreach arg $cmd {
+                                puts -nonewline "[string2printable $arg] "
+                            }
+                            puts ""
+                        }
+                    }
+
+                    # restart the server and re-apply debug configuration
+                    write_log_line 0 "corrupt payload: $printable_dump"
+                    restart_server 0 true true
+                    r config set sanitize-dump-payload $sanitize_dump
+                    r debug set-skip-checksum-validation 1
+                }
+
+                incr cycle
+                if { ([clock seconds]-$start_time) >= $min_duration && $cycle >= $min_cycles} {
+                    break
+                }
+            }
+            if {$::verbose} {
+                puts "Done $cycle cycles in [expr {[clock seconds]-$start_time}] seconds."
+                puts "RESTORE: successful: $stat_successful_restore, rejected: $stat_rejected_restore"
+                puts "Total commands sent in traffic: $stat_traffic_commands_sent, crashes during traffic: $stat_terminated_in_traffic ($stat_terminated_by_signal by signal)."
+            }
+        }
+        # if we run sanitization we never expect the server to crash at runtime
+        if {$sanitize_dump == yes} {
+            assert_equal $stat_terminated_in_restore 0
+            assert_equal $stat_terminated_in_traffic 0
+        }
+        # make sure all terminations where due to assertion and not a SIGSEGV
+        assert_equal $stat_terminated_by_signal 0
+    }
+}
+
+
+
+} ;# tags
+
diff --git a/redis-stable/tests/integration/corrupt-dump.tcl b/redis-stable/tests/integration/corrupt-dump.tcl
new file mode 100644
index 00000000..fbdd3c37
--- /dev/null
+++ b/redis-stable/tests/integration/corrupt-dump.tcl
@@ -0,0 +1,702 @@
+# tests of corrupt ziplist payload with valid CRC
+# * setting crash-memcheck-enabled to no to avoid issues with valgrind
+# * setting use-exit-on-panic to yes so that valgrind can search for leaks
+# * settng debug set-skip-checksum-validation to 1 on some tests for which we
+#   didn't bother to fake a valid checksum
+# * some tests set sanitize-dump-payload to no and some to yet, depending on
+#   what we want to test
+
+tags {"dump" "corruption"} {
+
+set corrupt_payload_7445 "\x0E\x01\x1D\x1D\x00\x00\x00\x16\x00\x00\x00\x03\x00\x00\x04\x43\x43\x43\x43\x06\x04\x42\x42\x42\x42\x06\x3F\x41\x41\x41\x41\xFF\x09\x00\x88\xA5\xCA\xA8\xC5\x41\xF4\x35"
+
+test {corrupt payload: #7445 - with sanitize} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        catch {
+            r restore key 0 $corrupt_payload_7445
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: #7445 - without sanitize - 1} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 $corrupt_payload_7445
+        catch {r lindex key 2}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: #7445 - without sanitize - 2} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 $corrupt_payload_7445
+        catch {r lset key 2 "BEEF"}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: hash with valid zip list header, invalid entry len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0D\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x14\x63\x00\x04\x02\x64\x00\xFF\x09\x00\xD9\x10\x54\x92\x15\xF5\x5F\x52"
+        r config set hash-max-ziplist-entries 1
+        catch {r hset key b b}
+        verify_log_message 0 "*zipEntrySafe*" 0
+    }
+}
+
+test {corrupt payload: invalid zlbytes header} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        catch {
+            r restore key 0 "\x0D\x1B\x25\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x02\x63\x00\x04\x02\x64\x00\xFF\x09\x00\xB7\xF7\x6E\x9F\x43\x43\x14\xC6"
+        } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: valid zipped hash header, dup records} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0D\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x02\x61\x00\x04\x02\x64\x00\xFF\x09\x00\xA1\x98\x36\x78\xCC\x8E\x93\x2E"
+        r config set hash-max-ziplist-entries 1
+        # cause an assertion when converting to hash table
+        catch {r hset key b b}
+        verify_log_message 0 "*ziplist with dup elements dump*" 0
+    }
+}
+
+test {corrupt payload: quicklist big ziplist prev len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x0E\x02\x62\x00\xFF\x09\x00\x49\x97\x30\xB2\x0D\xA1\xED\xAA"
+        catch {r lindex key -2}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: quicklist small ziplist prev len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        catch {
+            r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x02\x02\x62\x00\xFF\x09\x00\xC7\x71\x03\x97\x07\x75\xB0\x63"
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: quicklist ziplist wrong count} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x03\x00\x00\x02\x61\x00\x04\x02\x62\x00\xFF\x09\x00\x4D\xE2\x0A\x2F\x08\x25\xDF\x91"
+        # we'll be able to push, but iterating on the list will assert
+        r lpush key header
+        r rpush key footer
+        catch { [r lrange key -1 -1] }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: #3080 - quicklist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        catch {
+            r RESTORE key 0 "\x0E\x01\x80\x00\x00\x00\x10\x41\x41\x41\x41\x41\x41\x41\x41\x02\x00\x00\x80\x41\x41\x41\x41\x07\x00\x03\xC7\x1D\xEF\x54\x68\xCC\xF3"
+            r DUMP key ;# DUMP was used in the original issue, but now even with shallow sanitization restore safely fails, so this is dead code
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: quicklist with empty ziplist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {r restore key 0 "\x0E\x01\x0B\x0B\x00\x00\x00\x0A\x00\x00\x00\x00\x00\xFF\x09\x00\xC2\x69\x37\x83\x3C\x7F\xFE\x6F" replace} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: #3080 - ziplist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        # shallow sanitization is enough for restore to safely reject the payload with wrong size
+        r config set sanitize-dump-payload no
+        catch {
+            r RESTORE key 0 "\x0A\x80\x00\x00\x00\x10\x41\x41\x41\x41\x41\x41\x41\x41\x02\x00\x00\x80\x41\x41\x41\x41\x07\x00\x39\x5B\x49\xE0\xC1\xC6\xDD\x76"
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: load corrupted rdb with no CRC - #3505} {
+    set server_path [tmpdir "server.rdb-corruption-test"]
+    exec cp tests/assets/corrupt_ziplist.rdb $server_path
+    set srv [start_server [list overrides [list "dir" $server_path "dbfilename" "corrupt_ziplist.rdb" loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no sanitize-dump-payload no]]]
+
+    # wait for termination
+    wait_for_condition 100 50 {
+        ! [is_alive $srv]
+    } else {
+        fail "rdb loading didn't fail"
+    }
+
+    set stdout [dict get $srv stdout]
+    assert_equal [count_message_lines $stdout "Terminating server after rdb file reading failure."]  1
+    assert_lessthan 1 [count_message_lines $stdout "integrity check failed"]
+    kill_server $srv ;# let valgrind look for issues
+}
+
+foreach sanitize_dump {no yes} {
+    test {corrupt payload: load corrupted rdb with empty keys} {
+        set server_path [tmpdir "server.rdb-corruption-empty-keys-test"]
+        exec cp tests/assets/corrupt_empty_keys.rdb $server_path
+        start_server [list overrides [list "dir" $server_path "dbfilename" "corrupt_empty_keys.rdb" "sanitize-dump-payload" $sanitize_dump]] {
+            r select 0
+            assert_equal [r dbsize] 0
+
+            verify_log_message 0 "*skipping empty key: set*" 0
+            verify_log_message 0 "*skipping empty key: list_quicklist*" 0
+            verify_log_message 0 "*skipping empty key: list_quicklist_empty_ziplist*" 0
+            verify_log_message 0 "*skipping empty key: list_ziplist*" 0
+            verify_log_message 0 "*skipping empty key: hash*" 0
+            verify_log_message 0 "*skipping empty key: hash_ziplist*" 0
+            verify_log_message 0 "*skipping empty key: zset*" 0
+            verify_log_message 0 "*skipping empty key: zset_ziplist*" 0
+            verify_log_message 0 "*empty keys skipped: 8*" 0
+        }
+    }
+}
+
+test {corrupt payload: listpack invalid size header} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        catch {
+            r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x5F\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x45\x91\x0A\x87\x2F\xA5\xF9\x2E"
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*Stream listpack integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: listpack too long entry len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x89\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x40\x63\xC9\x37\x03\xA2\xE5\x68"
+        catch {
+            r xinfo stream key full
+        } err
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: listpack very long entry len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x9C\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x63\x6F\x42\x8E\x7C\xB5\xA2\x9D"
+        catch {
+            r xinfo stream key full
+        } err
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: listpack too long entry prev len} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        catch {
+            r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x15\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x06\xFB\x44\x24\x0A\x8E\x75\xEA"
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*Stream listpack integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: hash ziplist with duplicate records} {
+    # when we do perform full sanitization, we expect duplicate records to fail the restore
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _hash 0 "\x0D\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x13\x00\xF5\x02\xF5\x02\xF2\x02\x53\x5F\x31\x04\xF3\x02\xF3\x02\xF7\x02\xF7\x02\xF8\x02\x02\x5F\x37\x04\xF1\x02\xF1\x02\xF6\x02\x02\x5F\x35\x04\xF4\x02\x02\x5F\x33\x04\xFA\x02\x02\x5F\x39\x04\xF9\x02\xF9\xFF\x09\x00\xB5\x48\xDE\x62\x31\xD0\xE5\x63" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: hash ziplist uneven record count} {
+    # when we do perform full sanitization, we expect duplicate records to fail the restore
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _hash 0 "\r\x1b\x1b\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02a\x00\x04\x02b\x00\x04\x02a\x00\x04\x02d\x00\xff\t\x00\xa1\x98\x36x\xcc\x8e\x93\x2e" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: hash dupliacte records} {
+    # when we do perform full sanitization, we expect duplicate records to fail the restore
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _hash 0 "\x04\x02\x01a\x01b\x01a\x01d\t\x00\xc6\x9c\xab\xbc\bk\x0c\x06" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: hash empty zipmap} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _hash 0 "\x09\x02\x00\xFF\x09\x00\xC0\xF1\xB8\x67\x4C\x16\xAC\xE3" } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*Zipmap integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: fuzzer findings - NPD in streamIteratorGetID} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {
+            r RESTORE key 0 "\x0F\x01\x10\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x48\x01\xFF\x03\x81\x00\x00\x01\x73\xBD\x68\x48\x71\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x01\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x72\x48\x68\xBD\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x72\x48\x68\xBD\x73\x01\x00\x00\x01\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x80\xCD\xB0\xD5\x1A\xCE\xFF\x10"
+            r XREVRANGE key 725 233
+        }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - listpack NPD on invalid stream} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {
+            r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x1F\x01\x00\x01\x01\x01\x6D\x5F\x31\x03\x05\x01\x02\x01\x29\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDC\xB6\x6C\x1A\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x01\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x4B\x6C\xB6\xDC\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x3D\x6C\xB6\xDC\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xC7\x7D\x1C\xD7\x04\xFF\xE6\x9D"
+            r XREAD STREAMS _stream 519389898758
+        }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - NPD in quicklistIndex} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {
+            r RESTORE key 0 "\x0E\x01\x13\x13\x00\x00\x00\x10\x00\x00\x00\x03\x12\x00\xF3\x02\x02\x5F\x31\x04\xF1\xFF\x09\x00\xC9\x4B\x31\xFE\x61\xC0\x96\xFE"
+            r LSET key 290 290
+        }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - invalid read in ziplistFind} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {
+            r RESTORE key 0 "\x0D\x19\x19\x00\x00\x00\x16\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\xF2\x02\x02\x5F\x31\x04\x99\x02\xF3\xFF\x09\x00\xC5\xB8\x10\xC0\x8A\xF9\x16\xDF"
+            r HEXISTS key -688319650333
+        }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+
+test {corrupt payload: fuzzer findings - invalid ziplist encoding} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {
+            r RESTORE _listbig 0 "\x0E\x02\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\x02\x5F\x39\x04\xF9\x02\x86\x5F\x37\x04\xF7\x02\x02\x5F\x35\xFF\x19\x19\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\xF5\x02\x02\x5F\x33\x04\xF3\x02\x02\x5F\x31\x04\xF1\xFF\x09\x00\x0C\xFC\x99\x2C\x23\x45\x15\x60"
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: fuzzer findings - hash crash} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        r RESTORE _hash 0 "\x0D\x19\x19\x00\x00\x00\x16\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\xF2\x02\x02\x5F\x31\x04\xF3\x02\xF3\xFF\x09\x00\x38\xB8\x10\xC0\x8A\xF9\x16\xDF"
+        r HSET _hash 394891450 1635910264
+        r HMGET _hash 887312884855
+    }
+}
+
+test {corrupt payload: fuzzer findings - uneven entry count in hash} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _hashbig 0 "\x0D\x3D\x3D\x00\x00\x00\x38\x00\x00\x00\x14\x00\x00\xF2\x02\x02\x5F\x31\x04\x1C\x02\xF7\x02\xF1\x02\xF1\x02\xF5\x02\xF5\x02\xF4\x02\x02\x5F\x33\x04\xF6\x02\x02\x5F\x35\x04\xF8\x02\x02\x5F\x37\x04\xF9\x02\xF9\x02\xF3\x02\xF3\x02\xFA\x02\x02\x5F\x39\xFF\x09\x00\x73\xB7\x68\xC8\x97\x24\x8E\x88"
+        catch { r HSCAN _hashbig -250 }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - invalid read in lzf_decompress} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _setbig 0 "\x02\x03\x02\x5F\x31\xC0\x02\xC3\x00\x09\x00\xE6\xDC\x76\x44\xFF\xEB\x3D\xFE" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: fuzzer findings - leak in rdbloading due to dup entry in set} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _setbig 0 "\x02\x0A\x02\x5F\x39\xC0\x06\x02\x5F\x31\xC0\x00\xC0\x04\x02\x5F\x35\xC0\x02\xC0\x08\x02\x5F\x31\x02\x5F\x33\x09\x00\x7A\x5A\xFB\x90\x3A\xE9\x3C\xBE" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: fuzzer findings - empty intset} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {r RESTORE _setbig 0 "\x02\xC0\xC0\x06\x02\x5F\x39\xC0\x02\x02\x5F\x33\xC0\x00\x02\x5F\x31\xC0\x04\xC0\x08\x02\x5F\x37\x02\x5F\x35\x09\x00\xC5\xD4\x6D\xBA\xAD\x14\xB7\xE7"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind ziplist - crash report prints freed memory} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _zsetbig 0 "\x0C\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x00\x00\xF1\x02\xF1\x02\x02\x5F\x31\x04\xF2\x02\xF3\x02\xF3\x02\x02\x5F\x33\x04\xF4\x02\xEE\x02\xF5\x02\x02\x5F\x35\x04\xF6\x02\xF7\x02\xF7\x02\x02\x5F\x37\x04\xF8\x02\xF9\x02\xF9\x02\x02\x5F\x39\x04\xFA\xFF\x09\x00\xAE\xF9\x77\x2A\x47\x24\x33\xF6"
+        catch { r ZREMRANGEBYSCORE _zsetbig -1050966020 724 }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind ziplist prevlen reaches outside the ziplist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _listbig 0 "\x0E\x02\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\x02\x5F\x39\x04\xF9\x02\x02\x5F\x37\x04\xF7\x02\x02\x5F\x35\xFF\x19\x19\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\xF5\x02\x02\x5F\x33\x04\xF3\x95\x02\x5F\x31\x04\xF1\xFF\x09\x00\x0C\xFC\x99\x2C\x23\x45\x15\x60"
+        catch { r RPOP _listbig }
+        catch { r RPOP _listbig }
+        catch { r RPUSH _listbig 949682325 }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind - bad rdbLoadDoubleValue} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _list 0 "\x03\x01\x11\x11\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xD0\x07\x1A\xE9\x02\xFF\x09\x00\x1A\x06\x07\x32\x41\x28\x3A\x46" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind ziplist prev too big} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _list 0 "\x0E\x01\x13\x13\x00\x00\x00\x10\x00\x00\x00\x03\x00\x00\xF3\x02\x02\x5F\x31\xC1\xF1\xFF\x09\x00\xC9\x4B\x31\xFE\x61\xC0\x96\xFE"
+        catch { r RPUSHX _list -45 }
+        catch { r LREM _list -748 -840}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - lzf decompression fails, avoid valgrind invalid read} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {r RESTORE _stream 0 "\x0F\x02\x10\x00\x00\x01\x73\xDD\xAA\x2A\xB9\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4B\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x07\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x40\x00\x00\x02\x60\x19\x40\x27\x40\x19\x00\x33\x60\x19\x40\x29\x02\x01\x01\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x73\xDD\xAA\x2A\xBC\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4D\x40\x5E\x18\x5E\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x17\x0B\x03\x01\x01\x06\x01\x40\x0B\x00\x01\x60\x0D\x02\x82\x5F\x37\x60\x19\x80\x00\x00\x08\x60\x19\x80\x27\x02\x82\x5F\x39\x20\x19\x00\xFF\x0A\x81\x00\x00\x01\x73\xDD\xAA\x2A\xBE\x00\x00\x09\x00\x21\x85\x77\x43\x71\x7B\x17\x88"} err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream bad lp_count} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x56\x01\x02\x01\x22\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x2C\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDE\xDF\x7D\xC7\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\xF9\x7D\xDF\xDE\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xEB\x7D\xDF\xDE\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xB2\xA8\xA7\x5F\x1B\x61\x72\xD5"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream bad lp_count - unsanitized} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x56\x01\x02\x01\x22\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x2C\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDE\xDF\x7D\xC7\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\xF9\x7D\xDF\xDE\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xEB\x7D\xDF\xDE\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xB2\xA8\xA7\x5F\x1B\x61\x72\xD5"
+        catch { r XREVRANGE _stream 638932639 738}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream integrity check issue} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _stream 0 "\x0F\x02\x10\x00\x00\x01\x75\x2D\xA2\x90\x67\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x4A\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x75\x2D\xA2\x90\x67\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x56\x40\x60\x18\x60\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x80\x0B\x00\x02\x20\x0B\x02\x82\x5F\x37\x60\x19\x03\x01\x01\xDF\xFB\x20\x05\x00\x08\x60\x1A\x20\x0C\x00\xFC\x20\x05\x02\x82\x5F\x39\x20\x1B\x00\xFF\x0A\x81\x00\x00\x01\x75\x2D\xA2\x90\x68\x01\x00\x09\x00\x1D\x6F\xC0\x69\x8A\xDE\xF7\x92" } err
+        assert_match "*Bad data format*" $err
+    }
+}
+
+test {corrupt payload: fuzzer findings - infinite loop} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x82\x5F\x31\x03\xFD\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x75\x3A\xA6\xD0\x93\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x01\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x94\xD0\xA6\x3A\x75\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x94\xD0\xA6\x3A\x75\x01\x00\x00\x01\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xC4\x09\xAD\x69\x7E\xEE\xA6\x2F"
+        catch { r XREVRANGE _stream 288270516 971031845 }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - hash convert asserts on RESTORE with shallow sanitization} {
+    # if we don't perform full sanitization, and the next command can assert on converting
+    # a ziplist to hash records, then we're ok with that happning in RESTORE too
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE _hash 0 "\x0D\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x13\x00\xF5\x02\xF5\x02\xF2\x02\x53\x5F\x31\x04\xF3\x02\xF3\x02\xF7\x02\xF7\x02\xF8\x02\x02\x5F\x37\x04\xF1\x02\xF1\x02\xF6\x02\x02\x5F\x35\x04\xF4\x02\x02\x5F\x33\x04\xFA\x02\x02\x5F\x39\x04\xF9\x02\xF9\xFF\x09\x00\xB5\x48\xDE\x62\x31\xD0\xE5\x63" }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: OOM in rdbGenericLoadStringObject} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        catch { r RESTORE x 0 "\x0A\x81\x7F\xFF\xFF\xFF\xFF\xFF\xFF\xFF\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x04\x02\x62\x00\xFF\x09\x00\x57\x04\xE5\xCD\xD4\x37\x6C\x57" } err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - OOM in dictExpand} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch { r RESTORE x 0 "\x02\x81\x02\x5F\x31\xC0\x00\xC0\x02\x09\x00\xCD\x84\x2C\xB7\xE8\xA4\x49\x57" } err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - invalid tail offset after removal} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _zset 0 "\x0C\x19\x19\x00\x00\x00\x02\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\x02\x5F\x31\x04\xF2\x02\xF3\x02\xF3\xFF\x09\x00\x4D\x72\x7B\x97\xCD\x9A\x70\xC1"
+        catch {r ZPOPMIN _zset}
+        catch {r ZPOPMAX _zset}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - negative reply length} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x14\x5F\x31\x03\x05\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x75\xCF\xA1\x16\xA7\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x75\xCF\xA1\x16\xA7\x01\x01\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x01\xA7\x16\xA1\xCF\x75\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xA7\x16\xA1\xCF\x75\x01\x00\x00\x01\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x01\x09\x00\x1B\x42\x52\xB8\xDD\x5C\xE5\x4E"
+        catch {r XADD _stream * -956 -2601503852}
+        catch {r XINFO STREAM _stream FULL}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind negative malloc} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r RESTORE _key 0 "\x0E\x01\x81\xD6\xD6\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\x40\xC8\x6F\x2F\x36\xE2\xDF\xE3\x2E\x26\x64\x8B\x87\xD1\x7A\xBD\xFF\xEF\xEF\x63\x65\xF6\xF8\x8C\x4E\xEC\x96\x89\x56\x88\xF8\x3D\x96\x5A\x32\xBD\xD1\x36\xD8\x02\xE6\x66\x37\xCB\x34\x34\xC4\x52\xA7\x2A\xD5\x6F\x2F\x7E\xEE\xA2\x94\xD9\xEB\xA9\x09\x38\x3B\xE1\xA9\x60\xB6\x4E\x09\x44\x1F\x70\x24\xAA\x47\xA8\x6E\x30\xE1\x13\x49\x4E\xA1\x92\xC4\x6C\xF0\x35\x83\xD9\x4F\xD9\x9C\x0A\x0D\x7A\xE7\xB1\x61\xF5\xC1\x2D\xDC\xC3\x0E\x87\xA6\x80\x15\x18\xBA\x7F\x72\xDD\x14\x75\x46\x44\x0B\xCA\x9C\x8F\x1C\x3C\xD7\xDA\x06\x62\x18\x7E\x15\x17\x24\xAB\x45\x21\x27\xC2\xBC\xBB\x86\x6E\xD8\xBD\x8E\x50\xE0\xE0\x88\xA4\x9B\x9D\x15\x2A\x98\xFF\x5E\x78\x6C\x81\xFC\xA8\xC9\xC8\xE6\x61\xC8\xD1\x4A\x7F\x81\xD6\xA6\x1A\xAD\x4C\xC1\xA2\x1C\x90\x68\x15\x2A\x8A\x36\xC0\x58\xC3\xCC\xA6\x54\x19\x12\x0F\xEB\x46\xFF\x6E\xE3\xA7\x92\xF8\xFF\x09\x00\xD0\x71\xF7\x9F\xF7\x6A\xD6\x2E"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - valgrind invalid read} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r RESTORE _key 0 "\x05\x0A\x02\x5F\x39\x00\x00\x00\x00\x00\x00\x22\x40\xC0\x08\x00\x00\x00\x00\x00\x00\x20\x40\x02\x5F\x37\x00\x00\x00\x00\x00\x00\x1C\x40\xC0\x06\x00\x00\x00\x00\x00\x00\x18\x40\x02\x5F\x33\x00\x00\x00\x00\x00\x00\x14\x40\xC0\x04\x00\x00\x00\x00\x00\x00\x10\x40\x02\x5F\x33\x00\x00\x00\x00\x00\x00\x08\x40\xC0\x02\x00\x00\x00\x00\x00\x00\x00\x40\x02\x5F\x31\x00\x00\x00\x00\x00\x00\xF0\x3F\xC0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x3C\x66\xD7\x14\xA9\xDA\x3C\x69"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - empty hash ziplist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r RESTORE _int 0 "\x04\xC0\x01\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream with no records} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x78\x4D\x55\x68\x09\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x3E\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x50\x01\x00\x01\x01\x01\x02\x01\x05\x23\xFF\x02\x81\x00\x00\x01\x78\x4D\x55\x68\x59\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x01\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x00\x00\x00\x00\x00\x00\x00\x9F\x68\x55\x4D\x78\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x85\x68\x55\x4D\x78\x01\x00\x00\x01\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xF1\xC0\x72\x70\x39\x40\x1E\xA9" replace
+        catch {r XREAD STREAMS _stream $}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "Guru Meditation"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - quicklist ziplist tail followed by extra data which start with 0xff} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {
+            r restore key 0 "\x0E\x01\x11\x11\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xF6\xFF\xB0\x6C\x9C\xFF\x09\x00\x9C\x37\x47\x49\x4D\xDE\x94\xF5" replace
+        } err
+        assert_match "*Bad data format*" $err
+        verify_log_message 0 "*integrity check failed*" 0
+    }
+}
+
+test {corrupt payload: fuzzer findings - dict init to huge size} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        catch {r restore key 0 "\x02\x81\xC0\x00\x02\x5F\x31\xC0\x02\x09\x00\xB2\x1B\xE5\x17\x2E\x15\xF4\x6C" replace} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - huge string} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore key 0 "\x00\x81\x01\x09\x00\xF6\x2B\xB6\x7A\x85\x87\x72\x4D"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream PEL without consumer} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x3B\x40\x42\x19\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x20\x10\x00\x00\x20\x01\x00\x01\x20\x03\x02\x05\x01\x03\x20\x05\x40\x00\x04\x82\x5F\x31\x03\x05\x60\x19\x80\x32\x02\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x08\xF0\xB2\x34\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x08\xF0\xB2\x34\x01\x01\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x01\x35\xB2\xF0\x08\x7B\x01\x00\x00\x01\x01\x13\x41\x6C\x69\x63\x65\x35\xB2\xF0\x08\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x01\x09\x00\x28\x2F\xE0\xC5\x04\xBB\xA7\x31"} err
+        assert_match "*Bad data format*" $err
+        #catch {r XINFO STREAM _stream FULL }
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream listpack valgrind issue} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x09\x5E\x94\xFF\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x25\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x32\x01\x00\x01\x01\x01\x02\x01\xF0\x01\xFF\x02\x81\x00\x00\x01\x7B\x09\x5E\x95\x31\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x01\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x00\x00\x00\x00\x00\x00\x00\x5C\x95\x5E\x09\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x4B\x95\x5E\x09\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x19\x29\x94\xDF\x76\xF8\x1A\xC6"
+        catch {r XINFO STREAM _stream FULL }
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream with bad lpFirst} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x0E\x52\xD2\xEC\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\xF7\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x01\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x01\x01\x01\x01\x01\x01\x02\x01\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x0E\x52\xD2\xED\x01\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x01\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x00\x00\x00\x00\x00\x00\x00\xED\xD2\x52\x0E\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xED\xD2\x52\x0E\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xAC\x05\xC9\x97\x5D\x45\x80\xB3"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream listpack lpPrev valgrind issue} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload no
+        r debug set-skip-checksum-validation 1
+        r restore _stream 0  "\x0F\x01\x10\x00\x00\x01\x7B\x0E\xAE\x66\x36\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x1D\x01\x03\x01\x24\x01\x00\x01\x01\x69\x82\x5F\x31\x03\x05\x01\x02\x01\x33\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x0E\xAE\x66\x69\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x01\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x00\x00\x00\x00\x00\x00\x00\x94\x66\xAE\x0E\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x83\x66\xAE\x0E\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xD5\xD7\xA5\x5C\x63\x1C\x09\x40"
+        catch {r XREVRANGE _stream 1618622681 606195012389}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream with non-integer entry id} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore _streambig 0 "\x0F\x03\x10\x00\x00\x01\x7B\x13\x34\xC3\xB2\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x80\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x13\x34\xC3\xB2\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x56\x40\x61\x18\x61\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x40\x0B\x03\x01\x01\xDF\xFB\x20\x05\x02\x82\x5F\x37\x60\x1A\x20\x0E\x00\xFC\x20\x05\x00\x08\xC0\x1B\x00\xFD\x20\x0C\x02\x82\x5F\x39\x20\x1B\x00\xFF\x10\x00\x00\x01\x7B\x13\x34\xC3\xB3\x00\x00\x00\x00\x00\x00\x00\x03\xC3\x3D\x40\x4A\x18\x4A\x00\x00\x00\x15\x00\x02\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x40\x00\x00\x05\x60\x07\x02\xDF\xFD\x02\xC0\x23\x09\x01\x01\x86\x75\x6E\x69\x71\x75\x65\x07\xA0\x2D\x02\x08\x01\xFF\x0C\x81\x00\x00\x01\x7B\x13\x34\xC3\xB4\x00\x00\x09\x00\x9D\xBD\xD5\xB9\x33\xC4\xC5\xFF"} err
+        #catch {r XINFO STREAM _streambig FULL }
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - empty quicklist} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {
+            r restore key 0 "\x0E\xC0\x2B\x15\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xE0\x62\x58\xEA\xDF\x22\x00\x00\x00\xFF\x09\x00\xDF\x35\xD2\x67\xDC\x0E\x89\xAB" replace
+        } err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - empty zset} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore key 0 "\x05\xC0\x01\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - hash with len of 0} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r config set sanitize-dump-payload yes
+        r debug set-skip-checksum-validation 1
+        catch {r restore key 0 "\x04\xC0\x21\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+test {corrupt payload: fuzzer findings - stream double free listpack when insert dup node to rax returns 0} {
+    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
+        r debug set-skip-checksum-validation 1
+        r config set sanitize-dump-payload yes
+        catch { r restore _stream 0 "\x0F\x03\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x51\x40\x5E\x18\x5E\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x80\x0B\x00\x02\x20\x0B\x02\x82\x5F\x37\xA0\x19\x00\x03\x20\x0D\x00\x08\xA0\x19\x00\x04\x20\x0B\x02\x82\x5F\x39\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x3B\x40\x49\x18\x49\x00\x00\x00\x15\x00\x02\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x40\x00\x00\x05\x20\x07\x40\x09\xC0\x22\x09\x01\x01\x86\x75\x6E\x69\x71\x75\x65\x07\xA0\x2C\x02\x08\x01\xFF\x0C\x81\x00\x00\x01\x7B\x60\x5A\x23\x7A\x01\x00\x09\x00\x9C\x8F\x1E\xBF\x2E\x05\x59\x09" replace } err
+        assert_match "*Bad data format*" $err
+        r ping
+    }
+}
+
+} ;# tags
+
diff --git a/redis-stable/tests/integration/failover.tcl b/redis-stable/tests/integration/failover.tcl
new file mode 100644
index 00000000..10642eb3
--- /dev/null
+++ b/redis-stable/tests/integration/failover.tcl
@@ -0,0 +1,294 @@
+start_server {tags {"failover"}} {
+start_server {} {
+start_server {} {
+    set node_0 [srv 0 client]
+    set node_0_host [srv 0 host]
+    set node_0_port [srv 0 port]
+    set node_0_pid [srv 0 pid]
+
+    set node_1 [srv -1 client]
+    set node_1_host [srv -1 host]
+    set node_1_port [srv -1 port]
+    set node_1_pid [srv -1 pid]
+
+    set node_2 [srv -2 client]
+    set node_2_host [srv -2 host]
+    set node_2_port [srv -2 port]
+    set node_2_pid [srv -2 pid]
+
+    proc assert_digests_match {n1 n2 n3} {
+        assert_equal [$n1 debug digest] [$n2 debug digest]
+        assert_equal [$n2 debug digest] [$n3 debug digest]
+    }
+
+    test {failover command fails without connected replica} {
+        catch { $node_0 failover to $node_1_host $node_1_port } err
+        if {! [string match "ERR*" $err]} {
+            fail "failover command succeeded when replica not connected"
+        }
+    }
+
+    test {setup replication for following tests} {
+        $node_1 replicaof $node_0_host $node_0_port
+        $node_2 replicaof $node_0_host $node_0_port
+        wait_for_sync $node_1
+        wait_for_sync $node_2
+    }
+
+    test {failover command fails with invalid host} {
+        catch { $node_0 failover to invalidhost $node_1_port } err
+        assert_match "ERR*" $err
+    }
+
+    test {failover command fails with invalid port} {
+        catch { $node_0 failover to $node_1_host invalidport } err
+        assert_match "ERR*" $err
+    }
+
+    test {failover command fails with just force and timeout} {
+        catch { $node_0 FAILOVER FORCE TIMEOUT 100} err
+        assert_match "ERR*" $err
+    }
+
+    test {failover command fails when sent to a replica} {
+        catch { $node_1 failover to $node_1_host $node_1_port } err
+        assert_match "ERR*" $err
+    }
+
+    test {failover command fails with force without timeout} {
+        catch { $node_0 failover to $node_1_host $node_1_port FORCE } err
+        assert_match "ERR*" $err
+    }
+
+    test {failover command to specific replica works} {
+        set initial_psyncs [s -1 sync_partial_ok]
+        set initial_syncs [s -1 sync_full]
+
+        # Generate a delta between primary and replica
+        set load_handler [start_write_load $node_0_host $node_0_port 5]
+        exec kill -SIGSTOP [srv -1 pid]
+        wait_for_condition 50 100 {
+            [s 0 total_commands_processed] > 100
+        } else {
+            fail "Node 0 did not accept writes"
+        }
+        exec kill -SIGCONT [srv -1 pid]
+
+        # Execute the failover
+        $node_0 failover to $node_1_host $node_1_port
+
+        # Wait for failover to end
+        wait_for_condition 50 100 {
+            [s 0 master_failover_state] == "no-failover"
+        } else {
+            fail "Failover from node 0 to node 1 did not finish"
+        }
+
+        # stop the write load and make sure no more commands processed
+        stop_write_load $load_handler
+        wait_load_handlers_disconnected
+
+        $node_2 replicaof $node_1_host $node_1_port
+        wait_for_sync $node_0
+        wait_for_sync $node_2
+
+        assert_match *slave* [$node_0 role]
+        assert_match *master* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        # We should accept psyncs from both nodes
+        assert_equal [expr [s -1 sync_partial_ok] - $initial_psyncs] 2
+        assert_equal [expr [s -1 sync_full] - $initial_psyncs] 0
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+
+    test {failover command to any replica works} {
+        set initial_psyncs [s -2 sync_partial_ok]
+        set initial_syncs [s -2 sync_full]
+
+        wait_for_ofs_sync $node_1 $node_2
+        # We stop node 0 to and make sure node 2 is selected
+        exec kill -SIGSTOP $node_0_pid
+        $node_1 set CASE 1
+        $node_1 FAILOVER
+
+        # Wait for failover to end
+        wait_for_condition 50 100 {
+            [s -1 master_failover_state] == "no-failover"
+        } else {
+            fail "Failover from node 1 to node 2 did not finish"
+        }
+        exec kill -SIGCONT $node_0_pid
+        $node_0 replicaof $node_2_host $node_2_port
+
+        wait_for_sync $node_0
+        wait_for_sync $node_1
+
+        assert_match *slave* [$node_0 role]
+        assert_match *slave* [$node_1 role]
+        assert_match *master* [$node_2 role]
+
+        # We should accept Psyncs from both nodes
+        assert_equal [expr [s -2 sync_partial_ok] - $initial_psyncs] 2
+        assert_equal [expr [s -1 sync_full] - $initial_psyncs] 0
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+
+    test {failover to a replica with force works} {
+        set initial_psyncs [s 0 sync_partial_ok]
+        set initial_syncs [s 0 sync_full]
+
+        exec kill -SIGSTOP $node_0_pid
+        # node 0 will never acknowledge this write
+        $node_2 set case 2
+        $node_2 failover to $node_0_host $node_0_port TIMEOUT 100 FORCE
+
+        # Wait for node 0 to give up on sync attempt and start failover
+        wait_for_condition 50 100 {
+            [s -2 master_failover_state] == "failover-in-progress"
+        } else {
+            fail "Failover from node 2 to node 0 did not timeout"
+        }
+
+        # Quick check that everyone is a replica, we never want a 
+        # state where there are two masters.
+        assert_match *slave* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        exec kill -SIGCONT $node_0_pid
+
+        # Wait for failover to end
+        wait_for_condition 50 100 {
+            [s -2 master_failover_state] == "no-failover"
+        } else {
+            fail "Failover from node 2 to node 0 did not finish"
+        }
+        $node_1 replicaof $node_0_host $node_0_port
+
+        wait_for_sync $node_1
+        wait_for_sync $node_2
+
+        assert_match *master* [$node_0 role]
+        assert_match *slave* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        assert_equal [count_log_message -2 "time out exceeded, failing over."] 1
+
+        # We should accept both psyncs, although this is the condition we might not
+        # since we didn't catch up.
+        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 2
+        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+
+    test {failover with timeout aborts if replica never catches up} {
+        set initial_psyncs [s 0 sync_partial_ok]
+        set initial_syncs [s 0 sync_full]
+
+        # Stop replica so it never catches up
+        exec kill -SIGSTOP [srv -1 pid]
+        $node_0 SET CASE 1
+        
+        $node_0 failover to [srv -1 host] [srv -1 port] TIMEOUT 500
+        # Wait for failover to end
+        wait_for_condition 50 20 {
+            [s 0 master_failover_state] == "no-failover"
+        } else {
+            fail "Failover from node_0 to replica did not finish"
+        }
+
+        exec kill -SIGCONT [srv -1 pid]
+
+        # We need to make sure the nodes actually sync back up
+        wait_for_ofs_sync $node_0 $node_1
+        wait_for_ofs_sync $node_0 $node_2
+
+        assert_match *master* [$node_0 role]
+        assert_match *slave* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        # Since we never caught up, there should be no syncs
+        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 0
+        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+
+    test {failovers can be aborted} {
+        set initial_psyncs [s 0 sync_partial_ok]
+        set initial_syncs [s 0 sync_full]
+    
+        # Stop replica so it never catches up
+        exec kill -SIGSTOP [srv -1 pid]
+        $node_0 SET CASE 2
+        
+        $node_0 failover to [srv -1 host] [srv -1 port] TIMEOUT 60000
+        assert_match [s 0 master_failover_state] "waiting-for-sync"
+
+        # Sanity check that read commands are still accepted
+        $node_0 GET CASE
+
+        $node_0 failover abort
+        assert_match [s 0 master_failover_state] "no-failover"
+
+        exec kill -SIGCONT [srv -1 pid]
+
+        # Just make sure everything is still synced
+        wait_for_ofs_sync $node_0 $node_1
+        wait_for_ofs_sync $node_0 $node_2
+
+        assert_match *master* [$node_0 role]
+        assert_match *slave* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        # Since we never caught up, there should be no syncs
+        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 0
+        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+
+    test {failover aborts if target rejects sync request} {
+        set initial_psyncs [s 0 sync_partial_ok]
+        set initial_syncs [s 0 sync_full]
+
+        # We block psync, so the failover will fail
+        $node_1 acl setuser default -psync
+
+        # We pause the target long enough to send a write command
+        # during the pause. This write will not be interrupted.
+        exec kill -SIGSTOP [srv -1 pid]
+        set rd [redis_deferring_client]
+        $rd SET FOO BAR
+        $node_0 failover to $node_1_host $node_1_port
+        exec kill -SIGCONT [srv -1 pid]
+
+        # Wait for failover to end
+        wait_for_condition 50 100 {
+            [s 0 master_failover_state] == "no-failover"
+        } else {
+            fail "Failover from node_0 to replica did not finish"
+        }
+
+        assert_equal [$rd read] "OK"
+        $rd close
+
+        # restore access to psync
+        $node_1 acl setuser default +psync
+
+        # We need to make sure the nodes actually sync back up
+        wait_for_sync $node_1
+        wait_for_sync $node_2
+
+        assert_match *master* [$node_0 role]
+        assert_match *slave* [$node_1 role]
+        assert_match *slave* [$node_2 role]
+
+        # We will cycle all of our replicas here and force a psync.
+        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 2
+        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
+
+        assert_equal [count_log_message 0 "Failover target rejected psync request"] 1
+        assert_digests_match $node_0 $node_1 $node_2
+    }
+}
+}
+}
diff --git a/redis-stable/tests/integration/logging.tcl b/redis-stable/tests/integration/logging.tcl
new file mode 100644
index 00000000..fec14ff2
--- /dev/null
+++ b/redis-stable/tests/integration/logging.tcl
@@ -0,0 +1,51 @@
+set system_name [string tolower [exec uname -s]]
+set system_supported 0
+
+# We only support darwin or Linux with glibc
+if {$system_name eq {darwin}} {
+    set system_supported 1
+} elseif {$system_name eq {linux}} {
+    # Avoid the test on libmusl, which does not support backtrace
+    set ldd [exec ldd src/redis-server]
+    if {![string match {*libc.musl*} $ldd]} {
+        set system_supported 1
+    }
+}
+
+if {$system_supported} {
+    set server_path [tmpdir server.log]
+    start_server [list overrides [list dir $server_path]] {
+        test "Server is able to generate a stack trace on selected systems" {
+            r config set watchdog-period 200
+            r debug sleep 1
+            set pattern "*debugCommand*"
+            set retry 10
+            while {$retry} {
+                set result [exec tail -100 < [srv 0 stdout]]
+                if {[string match $pattern $result]} {
+                    break
+                }
+                incr retry -1
+                after 1000
+            }
+            if {$retry == 0} {
+                error "assertion:expected stack trace not found into log file"
+            }
+        }
+    }
+
+    # Valgrind will complain that the process terminated by a signal, skip it.
+    if {!$::valgrind} {
+        set server_path [tmpdir server1.log]
+        start_server [list overrides [list dir $server_path]] {
+            test "Crash report generated on SIGABRT" {
+                set pid [s process_id]
+                exec kill -SIGABRT $pid
+                set pattern "*STACK TRACE*"
+                set result [exec tail -1000 < [srv 0 stdout]]
+                assert {[string match $pattern $result]}
+            }
+        }
+    }
+
+}
diff --git a/redis-stable/tests/integration/psync2-pingoff.tcl b/redis-stable/tests/integration/psync2-pingoff.tcl
new file mode 100644
index 00000000..7744010a
--- /dev/null
+++ b/redis-stable/tests/integration/psync2-pingoff.tcl
@@ -0,0 +1,244 @@
+# These tests were added together with the meaningful offset implementation
+# in redis 6.0.0, which was later abandoned in 6.0.4, they used to test that
+# servers are able to PSYNC with replicas even if the replication stream has
+# PINGs at the end which present in one sever and missing on another.
+# We keep these tests just because they reproduce edge cases in the replication
+# logic in hope they'll be able to spot some problem in the future.
+
+start_server {tags {"psync2"}} {
+start_server {} {
+    # Config
+    set debug_msg 0                 ; # Enable additional debug messages
+
+    for {set j 0} {$j < 2} {incr j} {
+        set R($j) [srv [expr 0-$j] client]
+        set R_host($j) [srv [expr 0-$j] host]
+        set R_port($j) [srv [expr 0-$j] port]
+        $R($j) CONFIG SET repl-ping-replica-period 1
+        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
+    }
+
+    # Setup replication
+    test "PSYNC2 pingoff: setup" {
+        $R(1) replicaof $R_host(0) $R_port(0)
+        $R(0) set foo bar
+        wait_for_condition 50 1000 {
+            [status $R(1) master_link_status] == "up" &&
+            [$R(0) dbsize] == 1 && [$R(1) dbsize] == 1
+        } else {
+            fail "Replicas not replicating from master"
+        }
+    }
+
+    test "PSYNC2 pingoff: write and wait replication" {
+        $R(0) INCR counter
+        $R(0) INCR counter
+        $R(0) INCR counter
+        wait_for_condition 50 1000 {
+            [$R(0) GET counter] eq [$R(1) GET counter]
+        } else {
+            fail "Master and replica don't agree about counter"
+        }
+    }
+
+    # In this test we'll make sure the replica will get stuck, but with
+    # an active connection: this way the master will continue to send PINGs
+    # every second (we modified the PING period earlier)
+    test "PSYNC2 pingoff: pause replica and promote it" {
+        $R(1) MULTI
+        $R(1) DEBUG SLEEP 5
+        $R(1) SLAVEOF NO ONE
+        $R(1) EXEC
+        $R(1) ping ; # Wait for it to return back available
+    }
+
+    test "Make the old master a replica of the new one and check conditions" {
+        assert_equal [status $R(1) sync_full] 0
+        $R(0) REPLICAOF $R_host(1) $R_port(1)
+        wait_for_condition 50 1000 {
+            [status $R(1) sync_full] == 1
+        } else {
+            fail "The new master was not able to sync"
+        }
+
+        # make sure replication is still alive and kicking
+        $R(1) incr x
+        wait_for_condition 50 1000 {
+            [status $R(0) loading] == 0 &&
+            [$R(0) get x] == 1
+        } else {
+            fail "replica didn't get incr"
+        }
+        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
+    }
+}}
+
+
+start_server {tags {"psync2"}} {
+start_server {} {
+start_server {} {
+start_server {} {
+start_server {} {
+    test {test various edge cases of repl topology changes with missing pings at the end} {
+        set master [srv -4 client]
+        set master_host [srv -4 host]
+        set master_port [srv -4 port]
+        set replica1 [srv -3 client]
+        set replica2 [srv -2 client]
+        set replica3 [srv -1 client]
+        set replica4 [srv -0 client]
+
+        $replica1 replicaof $master_host $master_port
+        $replica2 replicaof $master_host $master_port
+        $replica3 replicaof $master_host $master_port
+        $replica4 replicaof $master_host $master_port
+        wait_for_condition 50 1000 {
+            [status $master connected_slaves] == 4
+        } else {
+            fail "replicas didn't connect"
+        }
+
+        $master incr x
+        wait_for_condition 50 1000 {
+            [$replica1 get x] == 1 && [$replica2 get x] == 1 &&
+            [$replica3 get x] == 1 && [$replica4 get x] == 1
+        } else {
+            fail "replicas didn't get incr"
+        }
+
+        # disconnect replica1 and replica2
+        # and wait for the master to send a ping to replica3 and replica4
+        $replica1 replicaof no one
+        $replica2 replicaof 127.0.0.1 1 ;# we can't promote it to master since that will cycle the replication id
+        $master config set repl-ping-replica-period 1
+        set replofs [status $master master_repl_offset]
+        wait_for_condition 50 100 {
+            [status $replica3 master_repl_offset] > $replofs &&
+            [status $replica4 master_repl_offset] > $replofs
+        } else {
+            fail "replica didn't sync in time"
+        }
+
+        # make everyone sync from the replica1 that didn't get the last ping from the old master
+        # replica4 will keep syncing from the old master which now syncs from replica1
+        # and replica2 will re-connect to the old master (which went back in time)
+        set new_master_host [srv -3 host]
+        set new_master_port [srv -3 port]
+        $replica3 replicaof $new_master_host $new_master_port
+        $master replicaof $new_master_host $new_master_port
+        $replica2 replicaof $master_host $master_port
+        wait_for_condition 50 1000 {
+            [status $replica2 master_link_status] == "up" &&
+            [status $replica3 master_link_status] == "up" &&
+            [status $replica4 master_link_status] == "up" &&
+            [status $master master_link_status] == "up"
+        } else {
+            fail "replicas didn't connect"
+        }
+
+        # make sure replication is still alive and kicking
+        $replica1 incr x
+        wait_for_condition 50 1000 {
+            [$replica2 get x] == 2 &&
+            [$replica3 get x] == 2 &&
+            [$replica4 get x] == 2 &&
+            [$master get x] == 2
+        } else {
+            fail "replicas didn't get incr"
+        }
+
+        # make sure we have the right amount of full syncs
+        assert_equal [status $master sync_full] 6
+        assert_equal [status $replica1 sync_full] 2
+        assert_equal [status $replica2 sync_full] 0
+        assert_equal [status $replica3 sync_full] 0
+        assert_equal [status $replica4 sync_full] 0
+
+        # force psync
+        $master client kill type master
+        $replica2 client kill type master
+        $replica3 client kill type master
+        $replica4 client kill type master
+
+        # make sure replication is still alive and kicking
+        $replica1 incr x
+        wait_for_condition 50 1000 {
+            [$replica2 get x] == 3 &&
+            [$replica3 get x] == 3 &&
+            [$replica4 get x] == 3 &&
+            [$master get x] == 3
+        } else {
+            fail "replicas didn't get incr"
+        }
+
+        # make sure we have the right amount of full syncs
+        assert_equal [status $master sync_full] 6
+        assert_equal [status $replica1 sync_full] 2
+        assert_equal [status $replica2 sync_full] 0
+        assert_equal [status $replica3 sync_full] 0
+        assert_equal [status $replica4 sync_full] 0
+}
+}}}}}
+
+start_server {tags {"psync2"}} {
+start_server {} {
+start_server {} {
+
+    for {set j 0} {$j < 3} {incr j} {
+        set R($j) [srv [expr 0-$j] client]
+        set R_host($j) [srv [expr 0-$j] host]
+        set R_port($j) [srv [expr 0-$j] port]
+        $R($j) CONFIG SET repl-ping-replica-period 1
+    }
+
+    test "Chained replicas disconnect when replica re-connect with the same master" {
+        # Add a second replica as a chained replica of the current replica
+        $R(1) replicaof $R_host(0) $R_port(0)
+        $R(2) replicaof $R_host(1) $R_port(1)
+        wait_for_condition 50 1000 {
+            [status $R(2) master_link_status] == "up"
+        } else {
+            fail "Chained replica not replicating from its master"
+        }
+
+        # Do a write on the master, and wait for the master to
+        # send some PINGs to its replica
+        $R(0) INCR counter2
+        set replofs [status $R(0) master_repl_offset]
+        wait_for_condition 50 100 {
+            [status $R(1) master_repl_offset] > $replofs &&
+            [status $R(2) master_repl_offset] > $replofs
+        } else {
+            fail "replica didn't sync in time"
+        }
+        set sync_partial_master [status $R(0) sync_partial_ok]
+        set sync_partial_replica [status $R(1) sync_partial_ok]
+        $R(0) CONFIG SET repl-ping-replica-period 100
+
+        # Disconnect the master's direct replica
+        $R(0) client kill type replica
+        wait_for_condition 50 1000 {
+            [status $R(1) master_link_status] == "up" && 
+            [status $R(2) master_link_status] == "up" &&
+            [status $R(0) sync_partial_ok] == $sync_partial_master + 1 &&
+            [status $R(1) sync_partial_ok] == $sync_partial_replica
+        } else {
+            fail "Disconnected replica failed to PSYNC with master"
+        }
+
+        # Verify that the replica and its replica's meaningful and real
+        # offsets match with the master
+        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
+        assert_equal [status $R(0) master_repl_offset] [status $R(2) master_repl_offset]
+
+        # make sure replication is still alive and kicking
+        $R(0) incr counter2
+        wait_for_condition 50 1000 {
+            [$R(1) get counter2] == 2 && [$R(2) get counter2] == 2
+        } else {
+            fail "replicas didn't get incr"
+        }
+        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
+        assert_equal [status $R(0) master_repl_offset] [status $R(2) master_repl_offset]
+    }
+}}}
diff --git a/redis-stable/tests/integration/psync2-reg.tcl b/redis-stable/tests/integration/psync2-reg.tcl
new file mode 100644
index 00000000..71a1c0eb
--- /dev/null
+++ b/redis-stable/tests/integration/psync2-reg.tcl
@@ -0,0 +1,82 @@
+# Issue 3899 regression test.
+# We create a chain of three instances: master -> slave -> slave2
+# and continuously break the link while traffic is generated by
+# redis-benchmark. At the end we check that the data is the same
+# everywhere.
+
+start_server {tags {"psync2"}} {
+start_server {} {
+start_server {} {
+    # Config
+    set debug_msg 0                 ; # Enable additional debug messages
+
+    set no_exit 0                   ; # Do not exit at end of the test
+
+    set duration 20                 ; # Total test seconds
+
+    for {set j 0} {$j < 3} {incr j} {
+        set R($j) [srv [expr 0-$j] client]
+        set R_host($j) [srv [expr 0-$j] host]
+        set R_port($j) [srv [expr 0-$j] port]
+        set R_unixsocket($j) [srv [expr 0-$j] unixsocket]
+        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
+    }
+
+    # Setup the replication and backlog parameters
+    test "PSYNC2 #3899 regression: setup" {
+        $R(1) slaveof $R_host(0) $R_port(0)
+        $R(2) slaveof $R_host(0) $R_port(0)
+        $R(0) set foo bar
+        wait_for_condition 50 1000 {
+            [status $R(1) master_link_status] == "up" &&
+            [status $R(2) master_link_status] == "up" &&
+            [$R(1) dbsize] == 1 &&
+            [$R(2) dbsize] == 1
+        } else {
+            fail "Replicas not replicating from master"
+        }
+        $R(0) config set repl-backlog-size 10mb
+        $R(1) config set repl-backlog-size 10mb
+    }
+
+    set cycle_start_time [clock milliseconds]
+    set bench_pid [exec src/redis-benchmark -s $R_unixsocket(0) -n 10000000 -r 1000 incr __rand_int__ > /dev/null &]
+    while 1 {
+        set elapsed [expr {[clock milliseconds]-$cycle_start_time}]
+        if {$elapsed > $duration*1000} break
+        if {rand() < .05} {
+            test "PSYNC2 #3899 regression: kill first replica" {
+                $R(1) client kill type master
+            }
+        }
+        if {rand() < .05} {
+            test "PSYNC2 #3899 regression: kill chained replica" {
+                $R(2) client kill type master
+            }
+        }
+        after 100
+    }
+    exec kill -9 $bench_pid
+
+    if {$debug_msg} {
+        for {set j 0} {$j < 100} {incr j} {
+            if {
+                [$R(0) debug digest] == [$R(1) debug digest] &&
+                [$R(1) debug digest] == [$R(2) debug digest]
+            } break
+            puts [$R(0) debug digest]
+            puts [$R(1) debug digest]
+            puts [$R(2) debug digest]
+            after 1000
+        }
+    }
+
+    test "PSYNC2 #3899 regression: verify consistency" {
+        wait_for_condition 50 1000 {
+            ([$R(0) debug digest] eq [$R(1) debug digest]) &&
+            ([$R(1) debug digest] eq [$R(2) debug digest])
+        } else {
+            fail "The three instances have different data sets"
+        }
+    }
+}}}
diff --git a/redis-stable/tests/integration/psync2.tcl b/redis-stable/tests/integration/psync2.tcl
new file mode 100644
index 00000000..8f8db5a9
--- /dev/null
+++ b/redis-stable/tests/integration/psync2.tcl
@@ -0,0 +1,373 @@
+
+proc show_cluster_status {} {
+    uplevel 1 {
+        # The following is the regexp we use to match the log line
+        # time info. Logs are in the following form:
+        #
+        # 11296:M 25 May 2020 17:37:14.652 # Server initialized
+        set log_regexp {^[0-9]+:[A-Z] [0-9]+ [A-z]+ [0-9]+ ([0-9:.]+) .*}
+        set repl_regexp {(master|repl|sync|backlog|meaningful|offset)}
+
+        puts "Master ID is $master_id"
+        for {set j 0} {$j < 5} {incr j} {
+            puts "$j: sync_full: [status $R($j) sync_full]"
+            puts "$j: id1      : [status $R($j) master_replid]:[status $R($j) master_repl_offset]"
+            puts "$j: id2      : [status $R($j) master_replid2]:[status $R($j) second_repl_offset]"
+            puts "$j: backlog  : firstbyte=[status $R($j) repl_backlog_first_byte_offset] len=[status $R($j) repl_backlog_histlen]"
+            puts "$j: x var is : [$R($j) GET x]"
+            puts "---"
+        }
+
+        # Show the replication logs of every instance, interleaving
+        # them by the log date.
+        #
+        # First: load the lines as lists for each instance.
+        array set log {}
+        for {set j 0} {$j < 5} {incr j} {
+            set fd [open $R_log($j)]
+            while {[gets $fd l] >= 0} {
+                if {[regexp $log_regexp $l] &&
+                    [regexp -nocase $repl_regexp $l]} {
+                    lappend log($j) $l
+                }
+            }
+            close $fd
+        }
+
+        # To interleave the lines, at every step consume the element of
+        # the list with the lowest time and remove it. Do it until
+        # all the lists are empty.
+        #
+        # regexp {^[0-9]+:[A-Z] [0-9]+ [A-z]+ [0-9]+ ([0-9:.]+) .*} $l - logdate
+        while 1 {
+            # Find the log with smallest time.
+            set empty 0
+            set best 0
+            set bestdate {}
+            for {set j 0} {$j < 5} {incr j} {
+                if {[llength $log($j)] == 0} {
+                    incr empty
+                    continue
+                }
+                regexp $log_regexp [lindex $log($j) 0] - date
+                if {$bestdate eq {}} {
+                    set best $j
+                    set bestdate $date
+                } else {
+                    if {[string compare $bestdate $date] > 0} {
+                        set best $j
+                        set bestdate $date
+                    }
+                }
+            }
+            if {$empty == 5} break ; # Our exit condition: no more logs
+
+            # Emit the one with the smallest time (that is the first
+            # event in the time line).
+            puts "\[$best port $R_port($best)\] [lindex $log($best) 0]"
+            set log($best) [lrange $log($best) 1 end]
+        }
+    }
+}
+
+start_server {tags {"psync2"}} {
+start_server {} {
+start_server {} {
+start_server {} {
+start_server {} {
+    set master_id 0                 ; # Current master
+    set start_time [clock seconds]  ; # Test start time
+    set counter_value 0             ; # Current value of the Redis counter "x"
+
+    # Config
+    set debug_msg 0                 ; # Enable additional debug messages
+
+    set no_exit 0                   ; # Do not exit at end of the test
+
+    set duration 40                 ; # Total test seconds
+
+    set genload 1                   ; # Load master with writes at every cycle
+
+    set genload_time 5000           ; # Writes duration time in ms
+
+    set disconnect 1                ; # Break replication link between random
+                                      # master and slave instances while the
+                                      # master is loaded with writes.
+
+    set disconnect_period 1000      ; # Disconnect repl link every N ms.
+
+    for {set j 0} {$j < 5} {incr j} {
+        set R($j) [srv [expr 0-$j] client]
+        set R_host($j) [srv [expr 0-$j] host]
+        set R_port($j) [srv [expr 0-$j] port]
+        set R_log($j) [srv [expr 0-$j] stdout]
+        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
+    }
+
+    set cycle 1
+    while {([clock seconds]-$start_time) < $duration} {
+        test "PSYNC2: --- CYCLE $cycle ---" {}
+        incr cycle
+
+        # Create a random replication layout.
+        # Start with switching master (this simulates a failover).
+
+        # 1) Select the new master.
+        set master_id [randomInt 5]
+        set used [list $master_id]
+        test "PSYNC2: \[NEW LAYOUT\] Set #$master_id as master" {
+            $R($master_id) slaveof no one
+            $R($master_id) config set repl-ping-replica-period 1 ;# increse the chance that random ping will cause issues
+            if {$counter_value == 0} {
+                $R($master_id) set x $counter_value
+            }
+        }
+
+        # 2) Attach all the slaves to a random instance
+        while {[llength $used] != 5} {
+            while 1 {
+                set slave_id [randomInt 5]
+                if {[lsearch -exact $used $slave_id] == -1} break
+            }
+            set rand [randomInt [llength $used]]
+            set mid [lindex $used $rand]
+            set master_host $R_host($mid)
+            set master_port $R_port($mid)
+
+            test "PSYNC2: Set #$slave_id to replicate from #$mid" {
+                $R($slave_id) slaveof $master_host $master_port
+            }
+            lappend used $slave_id
+        }
+
+        # Wait for replicas to sync. so next loop won't get -LOADING error
+        wait_for_condition 50 1000 {
+            [status $R([expr {($master_id+1)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+2)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+3)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+4)%5}]) master_link_status] == "up"
+        } else {
+            show_cluster_status
+            fail "Replica not reconnecting"
+        }
+
+        # 3) Increment the counter and wait for all the instances
+        # to converge.
+        test "PSYNC2: cluster is consistent after failover" {
+            $R($master_id) incr x; incr counter_value
+            for {set j 0} {$j < 5} {incr j} {
+                wait_for_condition 50 1000 {
+                    [$R($j) get x] == $counter_value
+                } else {
+                    show_cluster_status
+                    fail "Instance #$j x variable is inconsistent"
+                }
+            }
+        }
+
+        # 4) Generate load while breaking the connection of random
+        # slave-master pairs.
+        test "PSYNC2: generate load while killing replication links" {
+            set t [clock milliseconds]
+            set next_break [expr {$t+$disconnect_period}]
+            while {[clock milliseconds]-$t < $genload_time} {
+                if {$genload} {
+                    $R($master_id) incr x; incr counter_value
+                }
+                if {[clock milliseconds] == $next_break} {
+                    set next_break \
+                        [expr {[clock milliseconds]+$disconnect_period}]
+                    set slave_id [randomInt 5]
+                    if {$disconnect} {
+                        $R($slave_id) client kill type master
+                        if {$debug_msg} {
+                            puts "+++ Breaking link for replica #$slave_id"
+                        }
+                    }
+                }
+            }
+        }
+
+        # 5) Increment the counter and wait for all the instances
+        set x [$R($master_id) get x]
+        test "PSYNC2: cluster is consistent after load (x = $x)" {
+            for {set j 0} {$j < 5} {incr j} {
+                wait_for_condition 50 1000 {
+                    [$R($j) get x] == $counter_value
+                } else {
+                    show_cluster_status
+                    fail "Instance #$j x variable is inconsistent"
+                }
+            }
+        }
+
+        # wait for all the slaves to be in sync.
+        set masteroff [status $R($master_id) master_repl_offset]
+        wait_for_condition 500 100 {
+            [status $R(0) master_repl_offset] >= $masteroff &&
+            [status $R(1) master_repl_offset] >= $masteroff &&
+            [status $R(2) master_repl_offset] >= $masteroff &&
+            [status $R(3) master_repl_offset] >= $masteroff &&
+            [status $R(4) master_repl_offset] >= $masteroff
+        } else {
+            show_cluster_status
+            fail "Replicas offsets didn't catch up with the master after too long time."
+        }
+
+        if {$debug_msg} {
+            show_cluster_status
+        }
+
+        test "PSYNC2: total sum of full synchronizations is exactly 4" {
+            set sum 0
+            for {set j 0} {$j < 5} {incr j} {
+                incr sum [status $R($j) sync_full]
+            }
+            if {$sum != 4} {
+                show_cluster_status
+                assert {$sum == 4}
+            }
+        }
+
+        # In absence of pings, are the instances really able to have
+        # the exact same offset?
+        $R($master_id) config set repl-ping-replica-period 3600
+        wait_for_condition 500 100 {
+            [status $R($master_id) master_repl_offset] == [status $R(0) master_repl_offset] &&
+            [status $R($master_id) master_repl_offset] == [status $R(1) master_repl_offset] &&
+            [status $R($master_id) master_repl_offset] == [status $R(2) master_repl_offset] &&
+            [status $R($master_id) master_repl_offset] == [status $R(3) master_repl_offset] &&
+            [status $R($master_id) master_repl_offset] == [status $R(4) master_repl_offset]
+        } else {
+            show_cluster_status
+            fail "Replicas and master offsets were unable to match *exactly*."
+        }
+
+        # Limit anyway the maximum number of cycles. This is useful when the
+        # test is skipped via --only option of the test suite. In that case
+        # we don't want to see many seconds of this test being just skipped.
+        if {$cycle > 50} break
+    }
+
+    test "PSYNC2: Bring the master back again for next test" {
+        $R($master_id) slaveof no one
+        set master_host $R_host($master_id)
+        set master_port $R_port($master_id)
+        for {set j 0} {$j < 5} {incr j} {
+            if {$j == $master_id} continue
+            $R($j) slaveof $master_host $master_port
+        }
+
+        # Wait for replicas to sync. it is not enough to just wait for connected_slaves==4
+        # since we might do the check before the master realized that they're disconnected
+        wait_for_condition 50 1000 {
+            [status $R($master_id) connected_slaves] == 4 &&
+            [status $R([expr {($master_id+1)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+2)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+3)%5}]) master_link_status] == "up" &&
+            [status $R([expr {($master_id+4)%5}]) master_link_status] == "up"
+        } else {
+            show_cluster_status
+            fail "Replica not reconnecting"
+        }
+    }
+
+    test "PSYNC2: Partial resync after restart using RDB aux fields" {
+        # Pick a random slave
+        set slave_id [expr {($master_id+1)%5}]
+        set sync_count [status $R($master_id) sync_full]
+        set sync_partial [status $R($master_id) sync_partial_ok]
+        set sync_partial_err [status $R($master_id) sync_partial_err]
+        catch {
+            $R($slave_id) config rewrite
+            restart_server [expr {0-$slave_id}] true false
+            set R($slave_id) [srv [expr {0-$slave_id}] client]
+        }
+        # note: just waiting for connected_slaves==4 has a race condition since
+        # we might do the check before the master realized that the slave disconnected
+        wait_for_condition 50 1000 {
+            [status $R($master_id) sync_partial_ok] == $sync_partial + 1
+        } else {
+            puts "prev sync_full: $sync_count"
+            puts "prev sync_partial_ok: $sync_partial"
+            puts "prev sync_partial_err: $sync_partial_err"
+            puts [$R($master_id) info stats]
+            show_cluster_status
+            fail "Replica didn't partial sync"
+        }
+        set new_sync_count [status $R($master_id) sync_full]
+        assert {$sync_count == $new_sync_count}
+    }
+
+    test "PSYNC2: Replica RDB restart with EVALSHA in backlog issue #4483" {
+        # Pick a random slave
+        set slave_id [expr {($master_id+1)%5}]
+        set sync_count [status $R($master_id) sync_full]
+
+        # Make sure to replicate the first EVAL while the salve is online
+        # so that it's part of the scripts the master believes it's safe
+        # to propagate as EVALSHA.
+        $R($master_id) EVAL {return redis.call("incr","__mycounter")} 0
+        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
+
+        # Wait for the two to sync
+        wait_for_condition 50 1000 {
+            [$R($master_id) debug digest] == [$R($slave_id) debug digest]
+        } else {
+            show_cluster_status
+            fail "Replica not reconnecting"
+        }
+
+        # Prevent the slave from receiving master updates, and at
+        # the same time send a new script several times to the
+        # master, so that we'll end with EVALSHA into the backlog.
+        $R($slave_id) slaveof 127.0.0.1 0
+
+        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
+        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
+        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
+
+        catch {
+            $R($slave_id) config rewrite
+            restart_server [expr {0-$slave_id}] true false
+            set R($slave_id) [srv [expr {0-$slave_id}] client]
+        }
+
+        # Reconfigure the slave correctly again, when it's back online.
+        set retry 50
+        while {$retry} {
+            if {[catch {
+                $R($slave_id) slaveof $master_host $master_port
+            }]} {
+                after 1000
+            } else {
+                break
+            }
+            incr retry -1
+        }
+
+        # The master should be back at 4 slaves eventually
+        wait_for_condition 50 1000 {
+            [status $R($master_id) connected_slaves] == 4
+        } else {
+            show_cluster_status
+            fail "Replica not reconnecting"
+        }
+        set new_sync_count [status $R($master_id) sync_full]
+        assert {$sync_count == $new_sync_count}
+
+        # However if the slave started with the full state of the
+        # scripting engine, we should now have the same digest.
+        wait_for_condition 50 1000 {
+            [$R($master_id) debug digest] == [$R($slave_id) debug digest]
+        } else {
+            show_cluster_status
+            fail "Debug digest mismatch between master and replica in post-restart handshake"
+        }
+    }
+
+    if {$no_exit} {
+        while 1 { puts -nonewline .; flush stdout; after 1000}
+    }
+
+}}}}}
diff --git a/redis-stable/tests/integration/rdb.tcl b/redis-stable/tests/integration/rdb.tcl
new file mode 100644
index 00000000..e652e557
--- /dev/null
+++ b/redis-stable/tests/integration/rdb.tcl
@@ -0,0 +1,314 @@
+tags {"rdb"} {
+
+set server_path [tmpdir "server.rdb-encoding-test"]
+
+# Copy RDB with different encodings in server path
+exec cp tests/assets/encodings.rdb $server_path
+
+start_server [list overrides [list "dir" $server_path "dbfilename" "encodings.rdb"]] {
+  test "RDB encoding loading test" {
+    r select 0
+    csvdump r
+  } {"0","compressible","string","aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+"0","hash","hash","a","1","aa","10","aaa","100","b","2","bb","20","bbb","200","c","3","cc","30","ccc","300","ddd","400","eee","5000000000",
+"0","hash_zipped","hash","a","1","b","2","c","3",
+"0","list","list","1","2","3","a","b","c","100000","6000000000","1","2","3","a","b","c","100000","6000000000","1","2","3","a","b","c","100000","6000000000",
+"0","list_zipped","list","1","2","3","a","b","c","100000","6000000000",
+"0","number","string","10"
+"0","set","set","1","100000","2","3","6000000000","a","b","c",
+"0","set_zipped_1","set","1","2","3","4",
+"0","set_zipped_2","set","100000","200000","300000","400000",
+"0","set_zipped_3","set","1000000000","2000000000","3000000000","4000000000","5000000000","6000000000",
+"0","string","string","Hello World"
+"0","zset","zset","a","1","b","2","c","3","aa","10","bb","20","cc","30","aaa","100","bbb","200","ccc","300","aaaa","1000","cccc","123456789","bbbb","5000000000",
+"0","zset_zipped","zset","a","1","b","2","c","3",
+}
+}
+
+set server_path [tmpdir "server.rdb-startup-test"]
+
+start_server [list overrides [list "dir" $server_path] keep_persistence true] {
+    test {Server started empty with non-existing RDB file} {
+        r debug digest
+    } {0000000000000000000000000000000000000000}
+    # Save an RDB file, needed for the next test.
+    r save
+}
+
+start_server [list overrides [list "dir" $server_path] keep_persistence true] {
+    test {Server started empty with empty RDB file} {
+        r debug digest
+    } {0000000000000000000000000000000000000000}
+}
+
+start_server [list overrides [list "dir" $server_path] keep_persistence true] {
+    test {Test RDB stream encoding} {
+        for {set j 0} {$j < 1000} {incr j} {
+            if {rand() < 0.9} {
+                r xadd stream * foo abc
+            } else {
+                r xadd stream * bar $j
+            }
+        }
+        r xgroup create stream mygroup 0
+        set records [r xreadgroup GROUP mygroup Alice COUNT 2 STREAMS stream >]
+        r xdel stream [lindex [lindex [lindex [lindex $records 0] 1] 1] 0]
+        r xack stream mygroup [lindex [lindex [lindex [lindex $records 0] 1] 0] 0]
+        set digest [r debug digest]
+        r config set sanitize-dump-payload no
+        r debug reload
+        set newdigest [r debug digest]
+        assert {$digest eq $newdigest}
+    }
+    test {Test RDB stream encoding - sanitize dump} {
+        r config set sanitize-dump-payload yes
+        r debug reload
+        set newdigest [r debug digest]
+        assert {$digest eq $newdigest}
+    }
+    # delete the stream, maybe valgrind will find something
+    r del stream
+}
+
+# Helper function to start a server and kill it, just to check the error
+# logged.
+set defaults {}
+proc start_server_and_kill_it {overrides code} {
+    upvar defaults defaults srv srv server_path server_path
+    set config [concat $defaults $overrides]
+    set srv [start_server [list overrides $config keep_persistence true]]
+    uplevel 1 $code
+    kill_server $srv
+}
+
+# Make the RDB file unreadable
+file attributes [file join $server_path dump.rdb] -permissions 0222
+
+# Detect root account (it is able to read the file even with 002 perm)
+set isroot 0
+catch {
+    open [file join $server_path dump.rdb]
+    set isroot 1
+}
+
+# Now make sure the server aborted with an error
+if {!$isroot} {
+    start_server_and_kill_it [list "dir" $server_path] {
+        test {Server should not start if RDB file can't be open} {
+            wait_for_condition 50 100 {
+                [string match {*Fatal error loading*} \
+                    [exec tail -1 < [dict get $srv stdout]]]
+            } else {
+                fail "Server started even if RDB was unreadable!"
+            }
+        }
+    }
+}
+
+# Fix permissions of the RDB file.
+file attributes [file join $server_path dump.rdb] -permissions 0666
+
+# Corrupt its CRC64 checksum.
+set filesize [file size [file join $server_path dump.rdb]]
+set fd [open [file join $server_path dump.rdb] r+]
+fconfigure $fd -translation binary
+seek $fd -8 end
+puts -nonewline $fd "foobar00"; # Corrupt the checksum
+close $fd
+
+# Now make sure the server aborted with an error
+start_server_and_kill_it [list "dir" $server_path] {
+    test {Server should not start if RDB is corrupted} {
+        wait_for_condition 50 100 {
+            [string match {*CRC error*} \
+                [exec tail -10 < [dict get $srv stdout]]]
+        } else {
+            fail "Server started even if RDB was corrupted!"
+        }
+    }
+}
+
+start_server {} {
+    test {Test FLUSHALL aborts bgsave} {
+        # 1000 keys with 1ms sleep per key shuld take 1 second
+        r config set rdb-key-save-delay 1000
+        r debug populate 1000
+        r bgsave
+        assert_equal [s rdb_bgsave_in_progress] 1
+        r flushall
+        # wait half a second max
+        wait_for_condition 5 100 {
+            [s rdb_bgsave_in_progress] == 0
+        } else {
+            fail "bgsave not aborted"
+        }
+        # veirfy that bgsave failed, by checking that the change counter is still high
+        assert_lessthan 999 [s rdb_changes_since_last_save]
+        # make sure the server is still writable
+        r set x xx
+    }
+
+    test {bgsave resets the change counter} {
+        r config set rdb-key-save-delay 0
+        r bgsave
+        wait_for_condition 50 100 {
+            [s rdb_bgsave_in_progress] == 0
+        } else {
+            fail "bgsave not done"
+        }
+        assert_equal [s rdb_changes_since_last_save] 0
+    }
+}
+
+test {client freed during loading} {
+    start_server [list overrides [list key-load-delay 10 rdbcompression no]] {
+        # create a big rdb that will take long to load. it is important
+        # for keys to be big since the server processes events only once in 2mb.
+        # 100mb of rdb, 100k keys will load in more than 1 second
+        r debug populate 100000 key 1000
+
+        restart_server 0 false false
+
+        # make sure it's still loading
+        assert_equal [s loading] 1
+
+        # connect and disconnect 10 clients
+        set clients {}
+        for {set j 0} {$j < 10} {incr j} {
+            lappend clients [redis_deferring_client]
+        }
+        foreach rd $clients {
+            $rd debug log bla
+        }
+        foreach rd $clients {
+            $rd read
+        }
+        foreach rd $clients {
+            $rd close
+        }
+
+        # make sure the server freed the clients
+        wait_for_condition 100 100 {
+            [s connected_clients] < 3
+        } else {
+            fail "clients didn't disconnect"
+        }
+
+        # make sure it's still loading
+        assert_equal [s loading] 1
+
+        # no need to keep waiting for loading to complete
+        exec kill [srv 0 pid]
+    }
+}
+
+# Our COW metrics (Private_Dirty) work only on Linux
+set system_name [string tolower [exec uname -s]]
+if {$system_name eq {linux}} {
+
+start_server {overrides {save ""}} {
+    test {Test child sending info} {
+        # make sure that rdb_last_cow_size and current_cow_size are zero (the test using new server),
+        # so that the comparisons during the test will be valid
+        assert {[s current_cow_size] == 0}
+        assert {[s current_save_keys_processed] == 0}
+        assert {[s current_save_keys_total] == 0}
+
+        assert {[s rdb_last_cow_size] == 0}
+
+        # using a 200us delay, the bgsave is empirically taking about 10 seconds.
+        # we need it to take more than some 5 seconds, since redis only report COW once a second.
+        r config set rdb-key-save-delay 200
+        r config set loglevel debug
+
+        # populate the db with 10k keys of 4k each
+        set rd [redis_deferring_client 0]
+        set size 4096
+        set cmd_count 10000
+        for {set k 0} {$k < $cmd_count} {incr k} {
+            $rd set key$k [string repeat A $size]
+        }
+
+        for {set k 0} {$k < $cmd_count} {incr k} {
+            catch { $rd read }
+        }
+
+        $rd close
+
+        # start background rdb save
+        r bgsave
+
+        set current_save_keys_total [s current_save_keys_total]
+        if {$::verbose} {
+            puts "Keys before bgsave start: current_save_keys_total"
+        }
+
+        # on each iteration, we will write some key to the server to trigger copy-on-write, and
+        # wait to see that it reflected in INFO.
+        set iteration 1
+        while 1 {
+            # take samples before writing new data to the server
+            set cow_size [s current_cow_size]
+            if {$::verbose} {
+                puts "COW info before copy-on-write: $cow_size"
+            }
+
+            set keys_processed [s current_save_keys_processed]
+            if {$::verbose} {
+                puts "current_save_keys_processed info : $keys_processed"
+            }
+
+            # trigger copy-on-write
+            r setrange key$iteration 0 [string repeat B $size]
+
+            # wait to see that current_cow_size value updated (as long as the child is in progress)
+            wait_for_condition 80 100 {
+                [s rdb_bgsave_in_progress] == 0 ||
+                [s current_cow_size] >= $cow_size + $size && 
+                [s current_save_keys_processed] > $keys_processed &&
+                [s current_fork_perc] > 0
+            } else {
+                if {$::verbose} {
+                    puts "COW info on fail: [s current_cow_size]"
+                    puts [exec tail -n 100 < [srv 0 stdout]]
+                }
+                fail "COW info wasn't reported"
+            }
+
+            # assert that $keys_processed is not greater than total keys.
+            assert_morethan_equal $current_save_keys_total $keys_processed
+
+            # for no accurate, stop after 2 iterations
+            if {!$::accurate && $iteration == 2} {
+                break
+            }
+
+            # stop iterating if the bgsave completed
+            if { [s rdb_bgsave_in_progress] == 0 } {
+                break
+            }
+
+            incr iteration 1
+        }
+
+        # make sure we saw report of current_cow_size
+        if {$iteration < 2 && $::verbose} {
+            puts [exec tail -n 100 < [srv 0 stdout]]
+        }
+        assert_morethan_equal $iteration 2
+
+        # if bgsave completed, check that rdb_last_cow_size (fork exit report)
+        # is at least 90% of last rdb_active_cow_size.
+        if { [s rdb_bgsave_in_progress] == 0 } {
+            set final_cow [s rdb_last_cow_size]
+            set cow_size [expr $cow_size * 0.9]
+            if {$final_cow < $cow_size && $::verbose} {
+                puts [exec tail -n 100 < [srv 0 stdout]]
+            }
+            assert_morethan_equal $final_cow $cow_size
+        }
+    }
+}
+} ;# system_name
+
+} ;# tags
diff --git a/redis-stable/tests/integration/redis-benchmark.tcl b/redis-stable/tests/integration/redis-benchmark.tcl
new file mode 100644
index 00000000..3684d7c3
--- /dev/null
+++ b/redis-stable/tests/integration/redis-benchmark.tcl
@@ -0,0 +1,168 @@
+source tests/support/benchmark.tcl
+
+
+proc cmdstat {cmd} {
+    return [cmdrstat $cmd r]
+}
+
+start_server {tags {"benchmark network"}} {
+    start_server {} {
+        set master_host [srv 0 host]
+        set master_port [srv 0 port]
+
+        test {benchmark: set,get} {
+            r config resetstat
+            r flushall
+            set cmd [redisbenchmark $master_host $master_port "-c 5 -n 10 -e -t set,get"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            assert_match  {*calls=10,*} [cmdstat set]
+            assert_match  {*calls=10,*} [cmdstat get]
+            # assert one of the non benchmarked commands is not present
+            assert_match  {} [cmdstat lrange]
+        }
+
+        test {benchmark: full test suite} {
+            r config resetstat
+            set cmd [redisbenchmark $master_host $master_port "-c 10 -n 100 -e"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            # ping total calls are 2*issued commands per test due to PING_INLINE and PING_MBULK
+            assert_match  {*calls=200,*} [cmdstat ping]
+            assert_match  {*calls=100,*} [cmdstat set]
+            assert_match  {*calls=100,*} [cmdstat get]
+            assert_match  {*calls=100,*} [cmdstat incr]
+            # lpush total calls are 2*issued commands per test due to the lrange tests
+            assert_match  {*calls=200,*} [cmdstat lpush]
+            assert_match  {*calls=100,*} [cmdstat rpush]
+            assert_match  {*calls=100,*} [cmdstat lpop]
+            assert_match  {*calls=100,*} [cmdstat rpop]
+            assert_match  {*calls=100,*} [cmdstat sadd]
+            assert_match  {*calls=100,*} [cmdstat hset]
+            assert_match  {*calls=100,*} [cmdstat spop]
+            assert_match  {*calls=100,*} [cmdstat zadd]
+            assert_match  {*calls=100,*} [cmdstat zpopmin]
+            assert_match  {*calls=400,*} [cmdstat lrange]
+            assert_match  {*calls=100,*} [cmdstat mset]
+            # assert one of the non benchmarked commands is not present
+            assert_match {} [cmdstat rpoplpush]
+        }
+
+        test {benchmark: multi-thread set,get} {
+            r config resetstat
+            r flushall
+            set cmd [redisbenchmark $master_host $master_port "--threads 10 -c 5 -n 10 -e -t set,get"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            assert_match  {*calls=10,*} [cmdstat set]
+            assert_match  {*calls=10,*} [cmdstat get]
+            # assert one of the non benchmarked commands is not present
+            assert_match  {} [cmdstat lrange]
+
+            # ensure only one key was populated
+            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
+        }
+
+        test {benchmark: pipelined full set,get} {
+            r config resetstat
+            r flushall
+            set cmd [redisbenchmark $master_host $master_port "-P 5 -c 10 -n 10010 -e -t set,get"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            assert_match  {*calls=10010,*} [cmdstat set]
+            assert_match  {*calls=10010,*} [cmdstat get]
+            # assert one of the non benchmarked commands is not present
+            assert_match  {} [cmdstat lrange]
+
+            # ensure only one key was populated
+            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
+        }
+
+        test {benchmark: arbitrary command} {
+            r config resetstat
+            r flushall
+            set cmd [redisbenchmark $master_host $master_port "-c 5 -n 150 -e INCRBYFLOAT mykey 10.0"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            assert_match  {*calls=150,*} [cmdstat incrbyfloat]
+            # assert one of the non benchmarked commands is not present
+            assert_match  {} [cmdstat get]
+
+            # ensure only one key was populated
+            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
+        }
+
+        test {benchmark: keyspace length} {
+            r flushall
+            r config resetstat
+            set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000"]
+            if {[catch { exec {*}$cmd } error]} {
+                set first_line [lindex [split $error "\n"] 0]
+                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                fail "redis-benchmark non zero code. first line: $first_line"
+            }
+            assert_match  {*calls=1000,*} [cmdstat set]
+            # assert one of the non benchmarked commands is not present
+            assert_match  {} [cmdstat get]
+
+            # ensure the keyspace has the desired size
+            assert_match  {50} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
+        }
+
+        # tls specific tests
+        if {$::tls} {
+            test {benchmark: specific tls-ciphers} {
+                r flushall
+                r config resetstat
+                set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000 --tls-ciphers \"DEFAULT:-AES128-SHA256\""]
+                if {[catch { exec {*}$cmd } error]} {
+                    set first_line [lindex [split $error "\n"] 0]
+                    puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                    fail "redis-benchmark non zero code. first line: $first_line"
+                }
+                assert_match  {*calls=1000,*} [cmdstat set]
+                # assert one of the non benchmarked commands is not present
+                assert_match  {} [cmdstat get]
+            }
+
+            test {benchmark: specific tls-ciphersuites} {
+                r flushall
+                r config resetstat
+                set ciphersuites_supported 1
+                set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000 --tls-ciphersuites \"TLS_AES_128_GCM_SHA256\""]
+                if {[catch { exec {*}$cmd } error]} {
+                    set first_line [lindex [split $error "\n"] 0]
+                    if {[string match "*Invalid option*" $first_line]} {
+                        set ciphersuites_supported 0
+                        if {$::verbose} {
+                            puts "Skipping test, TLSv1.3 not supported."
+                        }
+                    } else {
+                        puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
+                        fail "redis-benchmark non zero code. first line: $first_line"
+                    }
+                }
+                if {$ciphersuites_supported} {
+                    assert_match  {*calls=1000,*} [cmdstat set]
+                    # assert one of the non benchmarked commands is not present
+                    assert_match  {} [cmdstat get]
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/redis-cli.tcl b/redis-stable/tests/integration/redis-cli.tcl
new file mode 100644
index 00000000..3117cb6a
--- /dev/null
+++ b/redis-stable/tests/integration/redis-cli.tcl
@@ -0,0 +1,374 @@
+source tests/support/cli.tcl
+
+start_server {tags {"cli"}} {
+    proc open_cli {{opts "-n 9"} {infile ""}} {
+        set ::env(TERM) dumb
+        set cmdline [rediscli [srv host] [srv port] $opts]
+        if {$infile ne ""} {
+            set cmdline "$cmdline < $infile"
+            set mode "r"
+        } else {
+            set mode "r+"
+        }
+        set fd [open "|$cmdline" $mode]
+        fconfigure $fd -buffering none
+        fconfigure $fd -blocking false
+        fconfigure $fd -translation binary
+        set _ $fd
+    }
+
+    proc close_cli {fd} {
+        close $fd
+    }
+
+    proc read_cli {fd} {
+        set buf [read $fd]
+        while {[string length $buf] == 0} {
+            # wait some time and try again
+            after 10
+            set buf [read $fd]
+        }
+        set _ $buf
+    }
+
+    proc write_cli {fd buf} {
+        puts $fd $buf
+        flush $fd
+    }
+
+    # Helpers to run tests in interactive mode
+
+    proc format_output {output} {
+        set _ [string trimright [regsub -all "\r" $output ""] "\n"]
+    }
+
+    proc run_command {fd cmd} {
+        write_cli $fd $cmd
+        set _ [format_output [read_cli $fd]]
+    }
+
+    proc test_interactive_cli {name code} {
+        set ::env(FAKETTY) 1
+        set fd [open_cli]
+        test "Interactive CLI: $name" $code
+        close_cli $fd
+        unset ::env(FAKETTY)
+    }
+
+    # Helpers to run tests where stdout is not a tty
+    proc write_tmpfile {contents} {
+        set tmp [tmpfile "cli"]
+        set tmpfd [open $tmp "w"]
+        puts -nonewline $tmpfd $contents
+        close $tmpfd
+        set _ $tmp
+    }
+
+    proc _run_cli {host port db opts args} {
+        set cmd [rediscli $host $port [list -n $db {*}$args]]
+        foreach {key value} $opts {
+            if {$key eq "pipe"} {
+                set cmd "sh -c \"$value | $cmd\""
+            }
+            if {$key eq "path"} {
+                set cmd "$cmd < $value"
+            }
+        }
+
+        set fd [open "|$cmd" "r"]
+        fconfigure $fd -buffering none
+        fconfigure $fd -translation binary
+        set resp [read $fd 1048576]
+        close $fd
+        set _ [format_output $resp]
+    }
+
+    proc run_cli {args} {
+        _run_cli [srv host] [srv port] 9 {} {*}$args
+    }
+
+    proc run_cli_with_input_pipe {cmd args} {
+        _run_cli [srv host] [srv port] 9 [list pipe $cmd] -x {*}$args
+    }
+
+    proc run_cli_with_input_file {path args} {
+        _run_cli [srv host] [srv port] 9 [list path $path] -x {*}$args
+    }
+
+    proc run_cli_host_port_db {host port db args} {
+        _run_cli $host $port $db {} {*}$args
+    }
+
+    proc test_nontty_cli {name code} {
+        test "Non-interactive non-TTY CLI: $name" $code
+    }
+
+    # Helpers to run tests where stdout is a tty (fake it)
+    proc test_tty_cli {name code} {
+        set ::env(FAKETTY) 1
+        test "Non-interactive TTY CLI: $name" $code
+        unset ::env(FAKETTY)
+    }
+
+    test_interactive_cli "INFO response should be printed raw" {
+        set lines [split [run_command $fd info] "\n"]
+        foreach line $lines {
+            assert [regexp {^$|^#|^[^#:]+:} $line]
+        }
+    }
+
+    test_interactive_cli "Status reply" {
+        assert_equal "OK" [run_command $fd "set key foo"]
+    }
+
+    test_interactive_cli "Integer reply" {
+        assert_equal "(integer) 1" [run_command $fd "incr counter"]
+    }
+
+    test_interactive_cli "Bulk reply" {
+        r set key foo
+        assert_equal "\"foo\"" [run_command $fd "get key"]
+    }
+
+    test_interactive_cli "Multi-bulk reply" {
+        r rpush list foo
+        r rpush list bar
+        assert_equal "1) \"foo\"\n2) \"bar\"" [run_command $fd "lrange list 0 -1"]
+    }
+
+    test_interactive_cli "Parsing quotes" {
+        assert_equal "OK" [run_command $fd "set key \"bar\""]
+        assert_equal "bar" [r get key]
+        assert_equal "OK" [run_command $fd "set key \" bar \""]
+        assert_equal " bar " [r get key]
+        assert_equal "OK" [run_command $fd "set key \"\\\"bar\\\"\""]
+        assert_equal "\"bar\"" [r get key]
+        assert_equal "OK" [run_command $fd "set key \"\tbar\t\""]
+        assert_equal "\tbar\t" [r get key]
+
+        # invalid quotation
+        assert_equal "Invalid argument(s)" [run_command $fd "get \"\"key"]
+        assert_equal "Invalid argument(s)" [run_command $fd "get \"key\"x"]
+
+        # quotes after the argument are weird, but should be allowed
+        assert_equal "OK" [run_command $fd "set key\"\" bar"]
+        assert_equal "bar" [r get key]
+    }
+
+    test_tty_cli "Status reply" {
+        assert_equal "OK" [run_cli set key bar]
+        assert_equal "bar" [r get key]
+    }
+
+    test_tty_cli "Integer reply" {
+        r del counter
+        assert_equal "(integer) 1" [run_cli incr counter]
+    }
+
+    test_tty_cli "Bulk reply" {
+        r set key "tab\tnewline\n"
+        assert_equal "\"tab\\tnewline\\n\"" [run_cli get key]
+    }
+
+    test_tty_cli "Multi-bulk reply" {
+        r del list
+        r rpush list foo
+        r rpush list bar
+        assert_equal "1) \"foo\"\n2) \"bar\"" [run_cli lrange list 0 -1]
+    }
+
+    test_tty_cli "Read last argument from pipe" {
+        assert_equal "OK" [run_cli_with_input_pipe "echo foo" set key]
+        assert_equal "foo\n" [r get key]
+    }
+
+    test_tty_cli "Read last argument from file" {
+        set tmpfile [write_tmpfile "from file"]
+        assert_equal "OK" [run_cli_with_input_file $tmpfile set key]
+        assert_equal "from file" [r get key]
+        file delete $tmpfile
+    }
+
+    test_nontty_cli "Status reply" {
+        assert_equal "OK" [run_cli set key bar]
+        assert_equal "bar" [r get key]
+    }
+
+    test_nontty_cli "Integer reply" {
+        r del counter
+        assert_equal "1" [run_cli incr counter]
+    }
+
+    test_nontty_cli "Bulk reply" {
+        r set key "tab\tnewline\n"
+        assert_equal "tab\tnewline" [run_cli get key]
+    }
+
+    test_nontty_cli "Multi-bulk reply" {
+        r del list
+        r rpush list foo
+        r rpush list bar
+        assert_equal "foo\nbar" [run_cli lrange list 0 -1]
+    }
+
+if {!$::tls} { ;# fake_redis_node doesn't support TLS
+    test_nontty_cli "ASK redirect test" {
+        # Set up two fake Redis nodes.
+        set tclsh [info nameofexecutable]
+        set script "tests/helpers/fake_redis_node.tcl"
+        set port1 [find_available_port $::baseport $::portcount]
+        set port2 [find_available_port $::baseport $::portcount]
+        set p1 [exec $tclsh $script $port1 \
+                "SET foo bar" "-ASK 12182 127.0.0.1:$port2" &]
+        set p2 [exec $tclsh $script $port2 \
+                "ASKING" "+OK" \
+                "SET foo bar" "+OK" &]
+        # Make sure both fake nodes have started listening
+        wait_for_condition 50 50 {
+            [catch {close [socket "127.0.0.1" $port1]}] == 0 && \
+            [catch {close [socket "127.0.0.1" $port2]}] == 0
+        } else {
+            fail "Failed to start fake Redis nodes"
+        }
+        # Run the cli
+        assert_equal "OK" [run_cli_host_port_db "127.0.0.1" $port1 0 -c SET foo bar]
+    }
+}
+
+    test_nontty_cli "Quoted input arguments" {
+        r set "\x00\x00" "value"
+        assert_equal "value" [run_cli --quoted-input get {"\x00\x00"}]
+    }
+
+    test_nontty_cli "No accidental unquoting of input arguments" {
+        run_cli --quoted-input set {"\x41\x41"} quoted-val
+        run_cli set {"\x41\x41"} unquoted-val
+        assert_equal "quoted-val" [r get AA]
+        assert_equal "unquoted-val" [r get {"\x41\x41"}]
+    }
+
+    test_nontty_cli "Invalid quoted input arguments" {
+        catch {run_cli --quoted-input set {"Unterminated}} err
+        assert_match {*exited abnormally*} $err
+
+        # A single arg that unquotes to two arguments is also not expected
+        catch {run_cli --quoted-input set {"arg1" "arg2"}} err
+        assert_match {*exited abnormally*} $err
+    }
+
+    test_nontty_cli "Read last argument from pipe" {
+        assert_equal "OK" [run_cli_with_input_pipe "echo foo" set key]
+        assert_equal "foo\n" [r get key]
+    }
+
+    test_nontty_cli "Read last argument from file" {
+        set tmpfile [write_tmpfile "from file"]
+        assert_equal "OK" [run_cli_with_input_file $tmpfile set key]
+        assert_equal "from file" [r get key]
+        file delete $tmpfile
+    }
+
+    proc test_redis_cli_rdb_dump {} {
+        r flushdb
+
+        set dir [lindex [r config get dir] 1]
+
+        assert_equal "OK" [r debug populate 100000 key 1000]
+        catch {run_cli --rdb "$dir/cli.rdb"} output
+        assert_match {*Transfer finished with success*} $output
+
+        file delete "$dir/dump.rdb"
+        file rename "$dir/cli.rdb" "$dir/dump.rdb"
+
+        assert_equal "OK" [r set should-not-exist 1]
+        assert_equal "OK" [r debug reload nosave]
+        assert_equal {} [r get should-not-exist]
+    }
+
+    test "Dumping an RDB" {
+        # Disk-based master
+        assert_match "OK" [r config set repl-diskless-sync no]
+        test_redis_cli_rdb_dump
+
+        # Disk-less master
+        assert_match "OK" [r config set repl-diskless-sync yes]
+        assert_match "OK" [r config set repl-diskless-sync-delay 0]
+        test_redis_cli_rdb_dump
+    }
+
+    test "Scan mode" {
+        r flushdb
+        populate 1000 key: 1
+
+        # basic use
+        assert_equal 1000 [llength [split [run_cli --scan]]]
+
+        # pattern
+        assert_equal {key:2} [run_cli --scan --pattern "*:2"]
+
+        # pattern matching with a quoted string
+        assert_equal {key:2} [run_cli --scan --quoted-pattern {"*:\x32"}]
+    }
+
+    proc test_redis_cli_repl {} {
+        set fd [open_cli "--replica"]
+        wait_for_condition 500 100 {
+            [string match {*slave0:*state=online*} [r info]]
+        } else {
+            fail "redis-cli --replica did not connect"
+        }
+
+        for {set i 0} {$i < 100} {incr i} {
+           r set test-key test-value-$i
+        }
+
+        wait_for_condition 500 100 {
+            [string match {*test-value-99*} [read_cli $fd]]
+        } else {
+            fail "redis-cli --replica didn't read commands"
+        }
+
+        fconfigure $fd -blocking true
+        r client kill type slave
+        catch { close_cli $fd } err
+        assert_match {*Server closed the connection*} $err
+    }
+
+    test "Connecting as a replica" {
+        # Disk-based master
+        assert_match "OK" [r config set repl-diskless-sync no]
+        test_redis_cli_repl
+
+        # Disk-less master
+        assert_match "OK" [r config set repl-diskless-sync yes]
+        assert_match "OK" [r config set repl-diskless-sync-delay 0]
+        test_redis_cli_repl
+    } {}
+
+    test "Piping raw protocol" {
+        set cmds [tmpfile "cli_cmds"]
+        set cmds_fd [open $cmds "w"]
+
+        puts $cmds_fd [formatCommand select 9]
+        puts $cmds_fd [formatCommand del test-counter]
+
+        for {set i 0} {$i < 1000} {incr i} {
+            puts $cmds_fd [formatCommand incr test-counter]
+            puts $cmds_fd [formatCommand set large-key [string repeat "x" 20000]]
+        }
+
+        for {set i 0} {$i < 100} {incr i} {
+            puts $cmds_fd [formatCommand set very-large-key [string repeat "x" 512000]]
+        }
+        close $cmds_fd
+
+        set cli_fd [open_cli "--pipe" $cmds]
+        fconfigure $cli_fd -blocking true
+        set output [read_cli $cli_fd]
+
+        assert_equal {1000} [r get test-counter]
+        assert_match {*All data transferred*errors: 0*replies: 2102*} $output
+
+        file delete $cmds
+    }
+}
diff --git a/redis-stable/tests/integration/replication-2.tcl b/redis-stable/tests/integration/replication-2.tcl
new file mode 100644
index 00000000..9524f356
--- /dev/null
+++ b/redis-stable/tests/integration/replication-2.tcl
@@ -0,0 +1,92 @@
+start_server {tags {"repl"}} {
+    start_server {} {
+        test {First server should have role slave after SLAVEOF} {
+            r -1 slaveof [srv 0 host] [srv 0 port]
+            wait_for_condition 50 100 {
+                [s -1 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        test {If min-slaves-to-write is honored, write is accepted} {
+            r config set min-slaves-to-write 1
+            r config set min-slaves-max-lag 10
+            r set foo 12345
+            wait_for_condition 50 100 {
+                [r -1 get foo] eq {12345}
+            } else {
+                fail "Write did not reached replica"
+            }
+        }
+
+        test {No write if min-slaves-to-write is < attached slaves} {
+            r config set min-slaves-to-write 2
+            r config set min-slaves-max-lag 10
+            catch {r set foo 12345} err
+            set err
+        } {NOREPLICAS*}
+
+        test {If min-slaves-to-write is honored, write is accepted (again)} {
+            r config set min-slaves-to-write 1
+            r config set min-slaves-max-lag 10
+            r set foo 12345
+            wait_for_condition 50 100 {
+                [r -1 get foo] eq {12345}
+            } else {
+                fail "Write did not reached replica"
+            }
+        }
+
+        test {No write if min-slaves-max-lag is > of the slave lag} {
+            r config set min-slaves-to-write 1
+            r config set min-slaves-max-lag 2
+            exec kill -SIGSTOP [srv -1 pid]
+            assert {[r set foo 12345] eq {OK}}
+            wait_for_condition 100 100 {
+                [catch {r set foo 12345}] != 0
+            } else {
+                fail "Master didn't become readonly"
+            }
+            catch {r set foo 12345} err
+            assert_match {NOREPLICAS*} $err
+        }
+        exec kill -SIGCONT [srv -1 pid]
+
+        test {min-slaves-to-write is ignored by slaves} {
+            r config set min-slaves-to-write 1
+            r config set min-slaves-max-lag 10
+            r -1 config set min-slaves-to-write 1
+            r -1 config set min-slaves-max-lag 10
+            r set foo aaabbb
+            wait_for_condition 50 100 {
+                [r -1 get foo] eq {aaabbb}
+            } else {
+                fail "Write did not reached replica"
+            }
+        }
+
+        # Fix parameters for the next test to work
+        r config set min-slaves-to-write 0
+        r -1 config set min-slaves-to-write 0
+        r flushall
+
+        test {MASTER and SLAVE dataset should be identical after complex ops} {
+            createComplexDataset r 10000
+            after 500
+            if {[r debug digest] ne [r -1 debug digest]} {
+                set csv1 [csvdump r]
+                set csv2 [csvdump {r -1}]
+                set fd [open /tmp/repldump1.txt w]
+                puts -nonewline $fd $csv1
+                close $fd
+                set fd [open /tmp/repldump2.txt w]
+                puts -nonewline $fd $csv2
+                close $fd
+                puts "Master - Replica inconsistency"
+                puts "Run diff -u against /tmp/repldump*.txt for more info"
+            }
+            assert_equal [r debug digest] [r -1 debug digest]
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/replication-3.tcl b/redis-stable/tests/integration/replication-3.tcl
new file mode 100644
index 00000000..43eb5353
--- /dev/null
+++ b/redis-stable/tests/integration/replication-3.tcl
@@ -0,0 +1,134 @@
+start_server {tags {"repl"}} {
+    start_server {} {
+        test {First server should have role slave after SLAVEOF} {
+            r -1 slaveof [srv 0 host] [srv 0 port]
+            wait_for_condition 50 100 {
+                [s -1 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        if {$::accurate} {set numops 50000} else {set numops 5000}
+
+        test {MASTER and SLAVE consistency with expire} {
+            createComplexDataset r $numops useexpire
+            after 4000 ;# Make sure everything expired before taking the digest
+            r keys *   ;# Force DEL syntesizing to slave
+            after 1000 ;# Wait another second. Now everything should be fine.
+            if {[r debug digest] ne [r -1 debug digest]} {
+                set csv1 [csvdump r]
+                set csv2 [csvdump {r -1}]
+                set fd [open /tmp/repldump1.txt w]
+                puts -nonewline $fd $csv1
+                close $fd
+                set fd [open /tmp/repldump2.txt w]
+                puts -nonewline $fd $csv2
+                close $fd
+                puts "Master - Replica inconsistency"
+                puts "Run diff -u against /tmp/repldump*.txt for more info"
+            }
+            assert_equal [r debug digest] [r -1 debug digest]
+        }
+
+        test {Slave is able to evict keys created in writable slaves} {
+            r -1 select 5
+            assert {[r -1 dbsize] == 0}
+            r -1 config set slave-read-only no
+            r -1 set key1 1 ex 5
+            r -1 set key2 2 ex 5
+            r -1 set key3 3 ex 5
+            assert {[r -1 dbsize] == 3}
+            after 6000
+            r -1 dbsize
+        } {0}
+    }
+}
+
+start_server {tags {"repl"}} {
+    start_server {} {
+        test {First server should have role slave after SLAVEOF} {
+            r -1 slaveof [srv 0 host] [srv 0 port]
+            wait_for_condition 50 100 {
+                [s -1 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        set numops 20000 ;# Enough to trigger the Script Cache LRU eviction.
+
+        # While we are at it, enable AOF to test it will be consistent as well
+        # after the test.
+        r config set appendonly yes
+
+        test {MASTER and SLAVE consistency with EVALSHA replication} {
+            array set oldsha {}
+            for {set j 0} {$j < $numops} {incr j} {
+                set key "key:$j"
+                # Make sure to create scripts that have different SHA1s
+                set script "return redis.call('incr','$key')"
+                set sha1 [r eval "return redis.sha1hex(\"$script\")" 0]
+                set oldsha($j) $sha1
+                r eval $script 0
+                set res [r evalsha $sha1 0]
+                assert {$res == 2}
+                # Additionally call one of the old scripts as well, at random.
+                set res [r evalsha $oldsha([randomInt $j]) 0]
+                assert {$res > 2}
+
+                # Trigger an AOF rewrite while we are half-way, this also
+                # forces the flush of the script cache, and we will cover
+                # more code as a result.
+                if {$j == $numops / 2} {
+                    catch {r bgrewriteaof}
+                }
+            }
+
+            wait_for_condition 50 100 {
+                [r dbsize] == $numops &&
+                [r -1 dbsize] == $numops &&
+                [r debug digest] eq [r -1 debug digest]
+            } else {
+                set csv1 [csvdump r]
+                set csv2 [csvdump {r -1}]
+                set fd [open /tmp/repldump1.txt w]
+                puts -nonewline $fd $csv1
+                close $fd
+                set fd [open /tmp/repldump2.txt w]
+                puts -nonewline $fd $csv2
+                close $fd
+                puts "Master - Replica inconsistency"
+                puts "Run diff -u against /tmp/repldump*.txt for more info"
+            }
+
+            set old_digest [r debug digest]
+            r config set appendonly no
+            r debug loadaof
+            set new_digest [r debug digest]
+            assert {$old_digest eq $new_digest}
+        }
+
+        test {SLAVE can reload "lua" AUX RDB fields of duplicated scripts} {
+            # Force a Slave full resynchronization
+            r debug change-repl-id
+            r -1 client kill type master
+
+            # Check that after a full resync the slave can still load
+            # correctly the RDB file: such file will contain "lua" AUX
+            # sections with scripts already in the memory of the master.
+
+            wait_for_condition 500 100 {
+                [s -1 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+
+            wait_for_condition 50 100 {
+                [r debug digest] eq [r -1 debug digest]
+            } else {
+                fail "DEBUG DIGEST mismatch after full SYNC with many scripts"
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/replication-4.tcl b/redis-stable/tests/integration/replication-4.tcl
new file mode 100644
index 00000000..e4ac83e1
--- /dev/null
+++ b/redis-stable/tests/integration/replication-4.tcl
@@ -0,0 +1,143 @@
+start_server {tags {"repl network"}} {
+    start_server {} {
+
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000]
+        set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000]
+        set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000]
+
+        test {First server should have role slave after SLAVEOF} {
+            $slave slaveof $master_host $master_port
+            after 1000
+            s 0 role
+        } {slave}
+
+        test {Test replication with parallel clients writing in different DBs} {
+            after 5000
+            stop_bg_complex_data $load_handle0
+            stop_bg_complex_data $load_handle1
+            stop_bg_complex_data $load_handle2
+            wait_for_condition 100 100 {
+                [$master debug digest] == [$slave debug digest]
+            } else {
+                set csv1 [csvdump r]
+                set csv2 [csvdump {r -1}]
+                set fd [open /tmp/repldump1.txt w]
+                puts -nonewline $fd $csv1
+                close $fd
+                set fd [open /tmp/repldump2.txt w]
+                puts -nonewline $fd $csv2
+                close $fd
+                fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
+            }
+            assert {[$master dbsize] > 0}
+        }
+    }
+}
+
+start_server {tags {"repl"}} {
+    start_server {} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        test {First server should have role slave after SLAVEOF} {
+            $slave slaveof $master_host $master_port
+            wait_for_condition 50 100 {
+                [s 0 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        test {With min-slaves-to-write (1,3): master should be writable} {
+            $master config set min-slaves-max-lag 3
+            $master config set min-slaves-to-write 1
+            $master set foo bar
+        } {OK}
+
+        test {With min-slaves-to-write (2,3): master should not be writable} {
+            $master config set min-slaves-max-lag 3
+            $master config set min-slaves-to-write 2
+            catch {$master set foo bar} e
+            set e
+        } {NOREPLICAS*}
+
+        test {With min-slaves-to-write: master not writable with lagged slave} {
+            $master config set min-slaves-max-lag 2
+            $master config set min-slaves-to-write 1
+            assert {[$master set foo bar] eq {OK}}
+            exec kill -SIGSTOP [srv 0 pid]
+            wait_for_condition 100 100 {
+                [catch {$master set foo bar}] != 0
+            } else {
+                fail "Master didn't become readonly"
+            }
+            catch {$master set foo bar} err
+            assert_match {NOREPLICAS*} $err
+            exec kill -SIGCONT [srv 0 pid]
+        }
+    }
+}
+
+start_server {tags {"repl"}} {
+    start_server {} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        test {First server should have role slave after SLAVEOF} {
+            $slave slaveof $master_host $master_port
+            wait_for_condition 50 100 {
+                [s 0 role] eq {slave}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        test {Replication: commands with many arguments (issue #1221)} {
+            # We now issue large MSET commands, that may trigger a specific
+            # class of bugs, see issue #1221.
+            for {set j 0} {$j < 100} {incr j} {
+                set cmd [list mset]
+                for {set x 0} {$x < 1000} {incr x} {
+                    lappend cmd [randomKey] [randomValue]
+                }
+                $master {*}$cmd
+            }
+
+            set retry 10
+            while {$retry && ([$master debug digest] ne [$slave debug digest])}\
+            {
+                after 1000
+                incr retry -1
+            }
+            assert {[$master dbsize] > 0}
+        }
+
+        test {Replication of SPOP command -- alsoPropagate() API} {
+            $master del myset
+            set size [expr 1+[randomInt 100]]
+            set content {}
+            for {set j 0} {$j < $size} {incr j} {
+                lappend content [randomValue]
+            }
+            $master sadd myset {*}$content
+
+            set count [randomInt 100]
+            set result [$master spop myset $count]
+
+            wait_for_condition 50 100 {
+                [$master debug digest] eq [$slave debug digest]
+            } else {
+                fail "SPOP replication inconsistency"
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/integration/replication-psync.tcl b/redis-stable/tests/integration/replication-psync.tcl
new file mode 100644
index 00000000..08e21d31
--- /dev/null
+++ b/redis-stable/tests/integration/replication-psync.tcl
@@ -0,0 +1,141 @@
+# Creates a master-slave pair and breaks the link continuously to force
+# partial resyncs attempts, all this while flooding the master with
+# write queries.
+#
+# You can specify backlog size, ttl, delay before reconnection, test duration
+# in seconds, and an additional condition to verify at the end.
+#
+# If reconnect is > 0, the test actually try to break the connection and
+# reconnect with the master, otherwise just the initial synchronization is
+# checked for consistency.
+proc test_psync {descr duration backlog_size backlog_ttl delay cond mdl sdl reconnect} {
+    start_server {tags {"repl"}} {
+        start_server {} {
+
+            set master [srv -1 client]
+            set master_host [srv -1 host]
+            set master_port [srv -1 port]
+            set slave [srv 0 client]
+
+            $master config set repl-backlog-size $backlog_size
+            $master config set repl-backlog-ttl $backlog_ttl
+            $master config set repl-diskless-sync $mdl
+            $master config set repl-diskless-sync-delay 1
+            $slave config set repl-diskless-load $sdl
+
+            set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000]
+            set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000]
+            set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000]
+
+            test {Slave should be able to synchronize with the master} {
+                $slave slaveof $master_host $master_port
+                wait_for_condition 50 100 {
+                    [lindex [r role] 0] eq {slave} &&
+                    [lindex [r role] 3] eq {connected}
+                } else {
+                    fail "Replication not started."
+                }
+            }
+
+            # Check that the background clients are actually writing.
+            test {Detect write load to master} {
+                wait_for_condition 50 1000 {
+                    [$master dbsize] > 100
+                } else {
+                    fail "Can't detect write load from background clients."
+                }
+            }
+
+            test "Test replication partial resync: $descr (diskless: $mdl, $sdl, reconnect: $reconnect)" {
+                # Now while the clients are writing data, break the maste-slave
+                # link multiple times.
+                if ($reconnect) {
+                    for {set j 0} {$j < $duration*10} {incr j} {
+                        after 100
+                        # catch {puts "MASTER [$master dbsize] keys, REPLICA [$slave dbsize] keys"}
+
+                        if {($j % 20) == 0} {
+                            catch {
+                                if {$delay} {
+                                    $slave multi
+                                    $slave client kill $master_host:$master_port
+                                    $slave debug sleep $delay
+                                    $slave exec
+                                } else {
+                                    $slave client kill $master_host:$master_port
+                                }
+                            }
+                        }
+                    }
+                }
+                stop_bg_complex_data $load_handle0
+                stop_bg_complex_data $load_handle1
+                stop_bg_complex_data $load_handle2
+
+                # Wait for the slave to reach the "online"
+                # state from the POV of the master.
+                set retry 5000
+                while {$retry} {
+                    set info [$master info]
+                    if {[string match {*slave0:*state=online*} $info]} {
+                        break
+                    } else {
+                        incr retry -1
+                        after 100
+                    }
+                }
+                if {$retry == 0} {
+                    error "assertion:Slave not correctly synchronized"
+                }
+
+                # Wait that slave acknowledge it is online so
+                # we are sure that DBSIZE and DEBUG DIGEST will not
+                # fail because of timing issues. (-LOADING error)
+                wait_for_condition 5000 100 {
+                    [lindex [$slave role] 3] eq {connected}
+                } else {
+                    fail "Slave still not connected after some time"
+                }  
+
+                wait_for_condition 100 100 {
+                    [$master debug digest] == [$slave debug digest]
+                } else {
+                    set csv1 [csvdump r]
+                    set csv2 [csvdump {r -1}]
+                    set fd [open /tmp/repldump1.txt w]
+                    puts -nonewline $fd $csv1
+                    close $fd
+                    set fd [open /tmp/repldump2.txt w]
+                    puts -nonewline $fd $csv2
+                    close $fd
+                    fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
+                }
+                assert {[$master dbsize] > 0}
+                eval $cond
+            }
+        }
+    }
+}
+
+foreach mdl {no yes} {
+    foreach sdl {disabled swapdb} {
+        test_psync {no reconnection, just sync} 6 1000000 3600 0 {
+        } $mdl $sdl 0
+
+        test_psync {ok psync} 6 100000000 3600 0 {
+        assert {[s -1 sync_partial_ok] > 0}
+        } $mdl $sdl 1
+
+        test_psync {no backlog} 6 100 3600 0.5 {
+        assert {[s -1 sync_partial_err] > 0}
+        } $mdl $sdl 1
+
+        test_psync {ok after delay} 3 100000000 3600 3 {
+        assert {[s -1 sync_partial_ok] > 0}
+        } $mdl $sdl 1
+
+        test_psync {backlog expired} 3 100000000 1 3 {
+        assert {[s -1 sync_partial_err] > 0}
+        } $mdl $sdl 1
+    }
+}
diff --git a/redis-stable/tests/integration/replication.tcl b/redis-stable/tests/integration/replication.tcl
new file mode 100644
index 00000000..916dd324
--- /dev/null
+++ b/redis-stable/tests/integration/replication.tcl
@@ -0,0 +1,928 @@
+proc log_file_matches {log pattern} {
+    set fp [open $log r]
+    set content [read $fp]
+    close $fp
+    string match $pattern $content
+}
+
+start_server {tags {"repl network"}} {
+    set slave [srv 0 client]
+    set slave_host [srv 0 host]
+    set slave_port [srv 0 port]
+    set slave_log [srv 0 stdout]
+    start_server {} {
+        set master [srv 0 client]
+        set master_host [srv 0 host]
+        set master_port [srv 0 port]
+
+        # Configure the master in order to hang waiting for the BGSAVE
+        # operation, so that the slave remains in the handshake state.
+        $master config set repl-diskless-sync yes
+        $master config set repl-diskless-sync-delay 1000
+
+        # Use a short replication timeout on the slave, so that if there
+        # are no bugs the timeout is triggered in a reasonable amount
+        # of time.
+        $slave config set repl-timeout 5
+
+        # Start the replication process...
+        $slave slaveof $master_host $master_port
+
+        test {Slave enters handshake} {
+            wait_for_condition 50 1000 {
+                [string match *handshake* [$slave role]]
+            } else {
+                fail "Replica does not enter handshake state"
+            }
+        }
+
+        # But make the master unable to send
+        # the periodic newlines to refresh the connection. The slave
+        # should detect the timeout.
+        $master debug sleep 10
+
+        test {Slave is able to detect timeout during handshake} {
+            wait_for_condition 50 1000 {
+                [log_file_matches $slave_log "*Timeout connecting to the MASTER*"]
+            } else {
+                fail "Replica is not able to detect timeout"
+            }
+        }
+    }
+}
+
+start_server {tags {"repl"}} {
+    set A [srv 0 client]
+    set A_host [srv 0 host]
+    set A_port [srv 0 port]
+    start_server {} {
+        set B [srv 0 client]
+        set B_host [srv 0 host]
+        set B_port [srv 0 port]
+
+        test {Set instance A as slave of B} {
+            $A slaveof $B_host $B_port
+            wait_for_condition 50 100 {
+                [lindex [$A role] 0] eq {slave} &&
+                [string match {*master_link_status:up*} [$A info replication]]
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+        }
+
+        test {INCRBYFLOAT replication, should not remove expire} {
+            r set test 1 EX 100
+            r incrbyfloat test 0.1
+            after 1000
+            assert_equal [$A debug digest] [$B debug digest]
+        }
+
+        test {GETSET replication} {
+            $A config resetstat
+            $A config set loglevel debug
+            $B config set loglevel debug
+            r set test foo
+            assert_equal [r getset test bar] foo
+            wait_for_condition 500 10 {
+                [$A get test] eq "bar"
+            } else {
+                fail "getset wasn't propagated"
+            }
+            assert_equal [r set test vaz get] bar
+            wait_for_condition 500 10 {
+                [$A get test] eq "vaz"
+            } else {
+                fail "set get wasn't propagated"
+            }
+            assert_match {*calls=3,*} [cmdrstat set $A]
+            assert_match {} [cmdrstat getset $A]
+        }
+
+        test {BRPOPLPUSH replication, when blocking against empty list} {
+            $A config resetstat
+            set rd [redis_deferring_client]
+            $rd brpoplpush a b 5
+            r lpush a foo
+            wait_for_condition 50 100 {
+                [$A debug digest] eq [$B debug digest]
+            } else {
+                fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
+            }
+            assert_match {*calls=1,*} [cmdrstat rpoplpush $A]
+            assert_match {} [cmdrstat lmove $A]
+        }
+
+        test {BRPOPLPUSH replication, list exists} {
+            $A config resetstat
+            set rd [redis_deferring_client]
+            r lpush c 1
+            r lpush c 2
+            r lpush c 3
+            $rd brpoplpush c d 5
+            after 1000
+            assert_equal [$A debug digest] [$B debug digest]
+            assert_match {*calls=1,*} [cmdrstat rpoplpush $A]
+            assert_match {} [cmdrstat lmove $A]
+        }
+
+        foreach wherefrom {left right} {
+            foreach whereto {left right} {
+                test "BLMOVE ($wherefrom, $whereto) replication, when blocking against empty list" {
+                    $A config resetstat
+                    set rd [redis_deferring_client]
+                    $rd blmove a b $wherefrom $whereto 5
+                    r lpush a foo
+                    wait_for_condition 50 100 {
+                        [$A debug digest] eq [$B debug digest]
+                    } else {
+                        fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
+                    }
+                    assert_match {*calls=1,*} [cmdrstat lmove $A]
+                    assert_match {} [cmdrstat rpoplpush $A]
+                }
+
+                test "BLMOVE ($wherefrom, $whereto) replication, list exists" {
+                    $A config resetstat
+                    set rd [redis_deferring_client]
+                    r lpush c 1
+                    r lpush c 2
+                    r lpush c 3
+                    $rd blmove c d $wherefrom $whereto 5
+                    after 1000
+                    assert_equal [$A debug digest] [$B debug digest]
+                    assert_match {*calls=1,*} [cmdrstat lmove $A]
+                    assert_match {} [cmdrstat rpoplpush $A]
+                }
+            }
+        }
+
+        test {BLPOP followed by role change, issue #2473} {
+            set rd [redis_deferring_client]
+            $rd blpop foo 0 ; # Block while B is a master
+
+            # Turn B into master of A
+            $A slaveof no one
+            $B slaveof $A_host $A_port
+            wait_for_condition 50 100 {
+                [lindex [$B role] 0] eq {slave} &&
+                [string match {*master_link_status:up*} [$B info replication]]
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+
+            # Push elements into the "foo" list of the new replica.
+            # If the client is still attached to the instance, we'll get
+            # a desync between the two instances.
+            $A rpush foo a b c
+            after 100
+
+            wait_for_condition 50 100 {
+                [$A debug digest] eq [$B debug digest] &&
+                [$A lrange foo 0 -1] eq {a b c} &&
+                [$B lrange foo 0 -1] eq {a b c}
+            } else {
+                fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
+            }
+        }
+    }
+}
+
+start_server {tags {"repl"}} {
+    r set mykey foo
+
+    start_server {} {
+        test {Second server should have role master at first} {
+            s role
+        } {master}
+
+        test {SLAVEOF should start with link status "down"} {
+            r multi
+            r slaveof [srv -1 host] [srv -1 port]
+            r info replication
+            r exec
+        } {*master_link_status:down*}
+
+        test {The role should immediately be changed to "replica"} {
+            s role
+        } {slave}
+
+        wait_for_sync r
+        test {Sync should have transferred keys from master} {
+            r get mykey
+        } {foo}
+
+        test {The link status should be up} {
+            s master_link_status
+        } {up}
+
+        test {SET on the master should immediately propagate} {
+            r -1 set mykey bar
+
+            wait_for_condition 500 100 {
+                [r  0 get mykey] eq {bar}
+            } else {
+                fail "SET on master did not propagated on replica"
+            }
+        }
+
+        test {FLUSHALL should replicate} {
+            r -1 flushall
+            if {$::valgrind} {after 2000}
+            list [r -1 dbsize] [r 0 dbsize]
+        } {0 0}
+
+        test {ROLE in master reports master with a slave} {
+            set res [r -1 role]
+            lassign $res role offset slaves
+            assert {$role eq {master}}
+            assert {$offset > 0}
+            assert {[llength $slaves] == 1}
+            lassign [lindex $slaves 0] master_host master_port slave_offset
+            assert {$slave_offset <= $offset}
+        }
+
+        test {ROLE in slave reports slave in connected state} {
+            set res [r role]
+            lassign $res role master_host master_port slave_state slave_offset
+            assert {$role eq {slave}}
+            assert {$slave_state eq {connected}}
+        }
+    }
+}
+
+foreach mdl {no yes} {
+    foreach sdl {disabled swapdb} {
+        start_server {tags {"repl"}} {
+            set master [srv 0 client]
+            $master config set repl-diskless-sync $mdl
+            $master config set repl-diskless-sync-delay 1
+            set master_host [srv 0 host]
+            set master_port [srv 0 port]
+            set slaves {}
+            start_server {} {
+                lappend slaves [srv 0 client]
+                start_server {} {
+                    lappend slaves [srv 0 client]
+                    start_server {} {
+                        lappend slaves [srv 0 client]
+                        test "Connect multiple replicas at the same time (issue #141), master diskless=$mdl, replica diskless=$sdl" {
+                            # start load handles only inside the test, so that the test can be skipped
+                            set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000000]
+                            set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000000]
+                            set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000000]
+                            set load_handle3 [start_write_load $master_host $master_port 8]
+                            set load_handle4 [start_write_load $master_host $master_port 4]
+                            after 5000 ;# wait for some data to accumulate so that we have RDB part for the fork
+
+                            # Send SLAVEOF commands to slaves
+                            [lindex $slaves 0] config set repl-diskless-load $sdl
+                            [lindex $slaves 1] config set repl-diskless-load $sdl
+                            [lindex $slaves 2] config set repl-diskless-load $sdl
+                            [lindex $slaves 0] slaveof $master_host $master_port
+                            [lindex $slaves 1] slaveof $master_host $master_port
+                            [lindex $slaves 2] slaveof $master_host $master_port
+
+                            # Wait for all the three slaves to reach the "online"
+                            # state from the POV of the master.
+                            set retry 500
+                            while {$retry} {
+                                set info [r -3 info]
+                                if {[string match {*slave0:*state=online*slave1:*state=online*slave2:*state=online*} $info]} {
+                                    break
+                                } else {
+                                    incr retry -1
+                                    after 100
+                                }
+                            }
+                            if {$retry == 0} {
+                                error "assertion:Slaves not correctly synchronized"
+                            }
+
+                            # Wait that slaves acknowledge they are online so
+                            # we are sure that DBSIZE and DEBUG DIGEST will not
+                            # fail because of timing issues.
+                            wait_for_condition 500 100 {
+                                [lindex [[lindex $slaves 0] role] 3] eq {connected} &&
+                                [lindex [[lindex $slaves 1] role] 3] eq {connected} &&
+                                [lindex [[lindex $slaves 2] role] 3] eq {connected}
+                            } else {
+                                fail "Slaves still not connected after some time"
+                            }
+
+                            # Stop the write load
+                            stop_bg_complex_data $load_handle0
+                            stop_bg_complex_data $load_handle1
+                            stop_bg_complex_data $load_handle2
+                            stop_write_load $load_handle3
+                            stop_write_load $load_handle4
+
+                            # Make sure no more commands processed
+                            wait_load_handlers_disconnected
+
+                            wait_for_ofs_sync $master [lindex $slaves 0]
+                            wait_for_ofs_sync $master [lindex $slaves 1]
+                            wait_for_ofs_sync $master [lindex $slaves 2]
+
+                            # Check digests
+                            set digest [$master debug digest]
+                            set digest0 [[lindex $slaves 0] debug digest]
+                            set digest1 [[lindex $slaves 1] debug digest]
+                            set digest2 [[lindex $slaves 2] debug digest]
+                            assert {$digest ne 0000000000000000000000000000000000000000}
+                            assert {$digest eq $digest0}
+                            assert {$digest eq $digest1}
+                            assert {$digest eq $digest2}
+                        }
+                   }
+                }
+            }
+        }
+    }
+}
+
+start_server {tags {"repl"}} {
+    set master [srv 0 client]
+    set master_host [srv 0 host]
+    set master_port [srv 0 port]
+    start_server {} {
+        test "Master stream is correctly processed while the replica has a script in -BUSY state" {
+            set load_handle0 [start_write_load $master_host $master_port 3]
+            set slave [srv 0 client]
+            $slave config set lua-time-limit 500
+            $slave slaveof $master_host $master_port
+
+            # Wait for the slave to be online
+            wait_for_condition 500 100 {
+                [lindex [$slave role] 3] eq {connected}
+            } else {
+                fail "Replica still not connected after some time"
+            }
+
+            # Wait some time to make sure the master is sending data
+            # to the slave.
+            after 5000
+
+            # Stop the ability of the slave to process data by sendig
+            # a script that will put it in BUSY state.
+            $slave eval {for i=1,3000000000 do end} 0
+
+            # Wait some time again so that more master stream will
+            # be processed.
+            after 2000
+
+            # Stop the write load
+            stop_write_load $load_handle0
+
+            # number of keys
+            wait_for_condition 500 100 {
+                [$master debug digest] eq [$slave debug digest]
+            } else {
+                fail "Different datasets between replica and master"
+            }
+        }
+    }
+}
+
+test {slave fails full sync and diskless load swapdb recovers it} {
+    start_server {tags {"repl"}} {
+        set slave [srv 0 client]
+        set slave_host [srv 0 host]
+        set slave_port [srv 0 port]
+        set slave_log [srv 0 stdout]
+        start_server {} {
+            set master [srv 0 client]
+            set master_host [srv 0 host]
+            set master_port [srv 0 port]
+
+            # Put different data sets on the master and slave
+            # we need to put large keys on the master since the slave replies to info only once in 2mb
+            $slave debug populate 2000 slave 10
+            $master debug populate 200 master 100000
+            $master config set rdbcompression no
+
+            # Set master and slave to use diskless replication
+            $master config set repl-diskless-sync yes
+            $master config set repl-diskless-sync-delay 0
+            $slave config set repl-diskless-load swapdb
+
+            # Set master with a slow rdb generation, so that we can easily disconnect it mid sync
+            # 10ms per key, with 200 keys is 2 seconds
+            $master config set rdb-key-save-delay 10000
+
+            # Start the replication process...
+            $slave slaveof $master_host $master_port
+
+            # wait for the slave to start reading the rdb
+            wait_for_condition 50 100 {
+                [s -1 loading] eq 1
+            } else {
+                fail "Replica didn't get into loading mode"
+            }
+
+            # make sure that next sync will not start immediately so that we can catch the slave in betweeen syncs
+            $master config set repl-diskless-sync-delay 5
+            # for faster server shutdown, make rdb saving fast again (the fork is already uses the slow one)
+            $master config set rdb-key-save-delay 0
+
+            # waiting slave to do flushdb (key count drop)
+            wait_for_condition 50 100 {
+                2000 != [scan [regexp -inline {keys\=([\d]*)} [$slave info keyspace]] keys=%d]
+            } else {
+                fail "Replica didn't flush"
+            }
+
+            # make sure we're still loading
+            assert_equal [s -1 loading] 1
+
+            # kill the slave connection on the master
+            set killed [$master client kill type slave]
+
+            # wait for loading to stop (fail)
+            wait_for_condition 50 100 {
+                [s -1 loading] eq 0
+            } else {
+                fail "Replica didn't disconnect"
+            }
+
+            # make sure the original keys were restored
+            assert_equal [$slave dbsize] 2000
+        }
+    }
+}
+
+test {diskless loading short read} {
+    start_server {tags {"repl"}} {
+        set replica [srv 0 client]
+        set replica_host [srv 0 host]
+        set replica_port [srv 0 port]
+        start_server {} {
+            set master [srv 0 client]
+            set master_host [srv 0 host]
+            set master_port [srv 0 port]
+
+            # Set master and replica to use diskless replication
+            $master config set repl-diskless-sync yes
+            $master config set rdbcompression no
+            $replica config set repl-diskless-load swapdb
+            $master config set hz 500
+            $replica config set hz 500
+            $master config set dynamic-hz no
+            $replica config set dynamic-hz no
+            # Try to fill the master with all types of data types / encodings
+            set start [clock clicks -milliseconds]
+            for {set k 0} {$k < 3} {incr k} {
+                for {set i 0} {$i < 10} {incr i} {
+                    r set "$k int_$i" [expr {int(rand()*10000)}]
+                    r expire "$k int_$i" [expr {int(rand()*10000)}]
+                    r set "$k string_$i" [string repeat A [expr {int(rand()*1000000)}]]
+                    r hset "$k hash_small" [string repeat A [expr {int(rand()*10)}]]  0[string repeat A [expr {int(rand()*10)}]]
+                    r hset "$k hash_large" [string repeat A [expr {int(rand()*10000)}]] [string repeat A [expr {int(rand()*1000000)}]]
+                    r sadd "$k set_small" [string repeat A [expr {int(rand()*10)}]]
+                    r sadd "$k set_large" [string repeat A [expr {int(rand()*1000000)}]]
+                    r zadd "$k zset_small" [expr {rand()}] [string repeat A [expr {int(rand()*10)}]]
+                    r zadd "$k zset_large" [expr {rand()}] [string repeat A [expr {int(rand()*1000000)}]]
+                    r lpush "$k list_small" [string repeat A [expr {int(rand()*10)}]]
+                    r lpush "$k list_large" [string repeat A [expr {int(rand()*1000000)}]]
+                    for {set j 0} {$j < 10} {incr j} {
+                        r xadd "$k stream" * foo "asdf" bar "1234"
+                    }
+                    r xgroup create "$k stream" "mygroup_$i" 0
+                    r xreadgroup GROUP "mygroup_$i" Alice COUNT 1 STREAMS "$k stream" >
+                }
+            }
+
+            if {$::verbose} {
+                set end [clock clicks -milliseconds]
+                set duration [expr $end - $start]
+                puts "filling took $duration ms (TODO: use pipeline)"
+                set start [clock clicks -milliseconds]
+            }
+
+            # Start the replication process...
+            set loglines [count_log_lines -1]
+            $master config set repl-diskless-sync-delay 0
+            $replica replicaof $master_host $master_port
+
+            # kill the replication at various points
+            set attempts 100
+            if {$::accurate} { set attempts 500 }
+            for {set i 0} {$i < $attempts} {incr i} {
+                # wait for the replica to start reading the rdb
+                # using the log file since the replica only responds to INFO once in 2mb
+                set res [wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 2000 1]
+                set loglines [lindex $res 1]
+
+                # add some additional random sleep so that we kill the master on a different place each time
+                after [expr {int(rand()*50)}]
+
+                # kill the replica connection on the master
+                set killed [$master client kill type replica]
+
+                set res [wait_for_log_messages -1 {"*Internal error in RDB*" "*Finished with success*" "*Successful partial resynchronization*"} $loglines 1000 1]
+                if {$::verbose} { puts $res }
+                set log_text [lindex $res 0]
+                set loglines [lindex $res 1]
+                if {![string match "*Internal error in RDB*" $log_text]} {
+                    # force the replica to try another full sync
+                    $master multi
+                    $master client kill type replica
+                    $master set asdf asdf
+                    # the side effect of resizing the backlog is that it is flushed (16k is the min size)
+                    $master config set repl-backlog-size [expr {16384 + $i}]
+                    $master exec
+                }
+                # wait for loading to stop (fail)
+                wait_for_condition 1000 1 {
+                    [s -1 loading] eq 0
+                } else {
+                    fail "Replica didn't disconnect"
+                }
+            }
+            if {$::verbose} {
+                set end [clock clicks -milliseconds]
+                set duration [expr $end - $start]
+                puts "test took $duration ms"
+            }
+            # enable fast shutdown
+            $master config set rdb-key-save-delay 0
+        }
+    }
+}
+
+# get current stime and utime metrics for a thread (since it's creation)
+proc get_cpu_metrics { statfile } {
+    if { [ catch {
+        set fid   [ open $statfile r ]
+        set data  [ read $fid 1024 ]
+        ::close $fid
+        set data  [ split $data ]
+
+        ;## number of jiffies it has been scheduled...
+        set utime [ lindex $data 13 ]
+        set stime [ lindex $data 14 ]
+    } err ] } {
+        error "assertion:can't parse /proc: $err"
+    }
+    set mstime [clock milliseconds]
+    return [ list $mstime $utime $stime ]
+}
+
+# compute %utime and %stime of a thread between two measurements
+proc compute_cpu_usage {start end} {
+    set clock_ticks [exec getconf CLK_TCK]
+    # convert ms time to jiffies and calc delta
+    set dtime [ expr { ([lindex $end 0] - [lindex $start 0]) * double($clock_ticks) / 1000 } ]
+    set utime [ expr { [lindex $end 1] - [lindex $start 1] } ]
+    set stime [ expr { [lindex $end 2] - [lindex $start 2] } ]
+    set pucpu  [ expr { ($utime / $dtime) * 100 } ]
+    set pscpu  [ expr { ($stime / $dtime) * 100 } ]
+    return [ list $pucpu $pscpu ]
+}
+
+
+# test diskless rdb pipe with multiple replicas, which may drop half way
+start_server {tags {"repl"}} {
+    set master [srv 0 client]
+    $master config set repl-diskless-sync yes
+    $master config set repl-diskless-sync-delay 1
+    set master_host [srv 0 host]
+    set master_port [srv 0 port]
+    set master_pid [srv 0 pid]
+    # put enough data in the db that the rdb file will be bigger than the socket buffers
+    # and since we'll have key-load-delay of 100, 20000 keys will take at least 2 seconds
+    # we also need the replica to process requests during transfer (which it does only once in 2mb)
+    $master debug populate 20000 test 10000
+    $master config set rdbcompression no
+    # If running on Linux, we also measure utime/stime to detect possible I/O handling issues
+    set os [catch {exec uname}]
+    set measure_time [expr {$os == "Linux"} ? 1 : 0]
+    foreach all_drop {no slow fast all timeout} {
+        test "diskless $all_drop replicas drop during rdb pipe" {
+            set replicas {}
+            set replicas_alive {}
+            # start one replica that will read the rdb fast, and one that will be slow
+            start_server {} {
+                lappend replicas [srv 0 client]
+                lappend replicas_alive [srv 0 client]
+                start_server {} {
+                    lappend replicas [srv 0 client]
+                    lappend replicas_alive [srv 0 client]
+
+                    # start replication
+                    # it's enough for just one replica to be slow, and have it's write handler enabled
+                    # so that the whole rdb generation process is bound to that
+                    set loglines [count_log_lines -1]
+                    [lindex $replicas 0] config set repl-diskless-load swapdb
+                    [lindex $replicas 0] config set key-load-delay 100 ;# 20k keys and 100 microseconds sleep means at least 2 seconds
+                    [lindex $replicas 0] replicaof $master_host $master_port
+                    [lindex $replicas 1] replicaof $master_host $master_port
+
+                    # wait for the replicas to start reading the rdb
+                    # using the log file since the replica only responds to INFO once in 2mb
+                    wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 800 10
+
+                    if {$measure_time} {
+                        set master_statfile "/proc/$master_pid/stat"
+                        set master_start_metrics [get_cpu_metrics $master_statfile]
+                        set start_time [clock seconds]
+                    }
+
+                    # wait a while so that the pipe socket writer will be
+                    # blocked on write (since replica 0 is slow to read from the socket)
+                    after 500
+
+                    # add some command to be present in the command stream after the rdb.
+                    $master incr $all_drop
+
+                    # disconnect replicas depending on the current test
+                    set loglines [count_log_lines -2]
+                    if {$all_drop == "all" || $all_drop == "fast"} {
+                        exec kill [srv 0 pid]
+                        set replicas_alive [lreplace $replicas_alive 1 1]
+                    }
+                    if {$all_drop == "all" || $all_drop == "slow"} {
+                        exec kill [srv -1 pid]
+                        set replicas_alive [lreplace $replicas_alive 0 0]
+                    }
+                    if {$all_drop == "timeout"} {
+                        $master config set repl-timeout 2
+                        # we want the slow replica to hang on a key for very long so it'll reach repl-timeout
+                        exec kill -SIGSTOP [srv -1 pid]
+                        after 2000
+                    }
+
+                    # wait for rdb child to exit
+                    wait_for_condition 500 100 {
+                        [s -2 rdb_bgsave_in_progress] == 0
+                    } else {
+                        fail "rdb child didn't terminate"
+                    }
+
+                    # make sure we got what we were aiming for, by looking for the message in the log file
+                    if {$all_drop == "all"} {
+                        wait_for_log_messages -2 {"*Diskless rdb transfer, last replica dropped, killing fork child*"} $loglines 1 1
+                    }
+                    if {$all_drop == "no"} {
+                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 2 replicas still up*"} $loglines 1 1
+                    }
+                    if {$all_drop == "slow" || $all_drop == "fast"} {
+                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 1 replicas still up*"} $loglines 1 1
+                    }
+                    if {$all_drop == "timeout"} {
+                        wait_for_log_messages -2 {"*Disconnecting timedout replica (full sync)*"} $loglines 1 1
+                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 1 replicas still up*"} $loglines 1 1
+                        # master disconnected the slow replica, remove from array
+                        set replicas_alive [lreplace $replicas_alive 0 0]
+                        # release it
+                        exec kill -SIGCONT [srv -1 pid]
+                    }
+
+                    # make sure we don't have a busy loop going thought epoll_wait
+                    if {$measure_time} {
+                        set master_end_metrics [get_cpu_metrics $master_statfile]
+                        set time_elapsed [expr {[clock seconds]-$start_time}]
+                        set master_cpu [compute_cpu_usage $master_start_metrics $master_end_metrics]
+                        set master_utime [lindex $master_cpu 0]
+                        set master_stime [lindex $master_cpu 1]
+                        if {$::verbose} {
+                            puts "elapsed: $time_elapsed"
+                            puts "master utime: $master_utime"
+                            puts "master stime: $master_stime"
+                        }
+                        if {!$::no_latency && ($all_drop == "all" || $all_drop == "slow" || $all_drop == "timeout")} {
+                            assert {$master_utime < 70}
+                            assert {$master_stime < 70}
+                        }
+                        if {!$::no_latency && ($all_drop == "none" || $all_drop == "fast")} {
+                            assert {$master_utime < 15}
+                            assert {$master_stime < 15}
+                        }
+                    }
+
+                    # verify the data integrity
+                    foreach replica $replicas_alive {
+                        # Wait that replicas acknowledge they are online so
+                        # we are sure that DBSIZE and DEBUG DIGEST will not
+                        # fail because of timing issues.
+                        wait_for_condition 150 100 {
+                            [lindex [$replica role] 3] eq {connected}
+                        } else {
+                            fail "replicas still not connected after some time"
+                        }
+
+                        # Make sure that replicas and master have same
+                        # number of keys
+                        wait_for_condition 50 100 {
+                            [$master dbsize] == [$replica dbsize]
+                        } else {
+                            fail "Different number of keys between master and replicas after too long time."
+                        }
+
+                        # Check digests
+                        set digest [$master debug digest]
+                        set digest0 [$replica debug digest]
+                        assert {$digest ne 0000000000000000000000000000000000000000}
+                        assert {$digest eq $digest0}
+                    }
+                }
+            }
+        }
+    }
+}
+
+test "diskless replication child being killed is collected" {
+    # when diskless master is waiting for the replica to become writable
+    # it removes the read event from the rdb pipe so if the child gets killed
+    # the replica will hung. and the master may not collect the pid with waitpid
+    start_server {tags {"repl"}} {
+        set master [srv 0 client]
+        set master_host [srv 0 host]
+        set master_port [srv 0 port]
+        set master_pid [srv 0 pid]
+        $master config set repl-diskless-sync yes
+        $master config set repl-diskless-sync-delay 0
+        # put enough data in the db that the rdb file will be bigger than the socket buffers
+        $master debug populate 20000 test 10000
+        $master config set rdbcompression no
+        start_server {} {
+            set replica [srv 0 client]
+            set loglines [count_log_lines 0]
+            $replica config set repl-diskless-load swapdb
+            $replica config set key-load-delay 1000000
+            $replica replicaof $master_host $master_port
+
+            # wait for the replicas to start reading the rdb
+            wait_for_log_messages 0 {"*Loading DB in memory*"} $loglines 800 10
+
+            # wait to be sure the eplica is hung and the master is blocked on write
+            after 500
+
+            # simulate the OOM killer or anyone else kills the child
+            set fork_child_pid [get_child_pid -1]
+            exec kill -9 $fork_child_pid
+
+            # wait for the parent to notice the child have exited
+            wait_for_condition 50 100 {
+                [s -1 rdb_bgsave_in_progress] == 0
+            } else {
+                fail "rdb child didn't terminate"
+            }
+        }
+    }
+}
+
+test "diskless replication read pipe cleanup" {
+    # In diskless replication, we create a read pipe for the RDB, between the child and the parent.
+    # When we close this pipe (fd), the read handler also needs to be removed from the event loop (if it still registered).
+    # Otherwise, next time we will use the same fd, the registration will be fail (panic), because
+    # we will use EPOLL_CTL_MOD (the fd still register in the event loop), on fd that already removed from epoll_ctl
+    start_server {tags {"repl"}} {
+        set master [srv 0 client]
+        set master_host [srv 0 host]
+        set master_port [srv 0 port]
+        set master_pid [srv 0 pid]
+        $master config set repl-diskless-sync yes
+        $master config set repl-diskless-sync-delay 0
+
+        # put enough data in the db, and slowdown the save, to keep the parent busy at the read process
+        $master config set rdb-key-save-delay 100000
+        $master debug populate 20000 test 10000
+        $master config set rdbcompression no
+        start_server {} {
+            set replica [srv 0 client]
+            set loglines [count_log_lines 0]
+            $replica config set repl-diskless-load swapdb
+            $replica replicaof $master_host $master_port
+
+            # wait for the replicas to start reading the rdb
+            wait_for_log_messages 0 {"*Loading DB in memory*"} $loglines 800 10
+
+            set loglines [count_log_lines 0]
+            # send FLUSHALL so the RDB child will be killed
+            $master flushall
+
+            # wait for another RDB child process to be started
+            wait_for_log_messages -1 {"*Background RDB transfer started by pid*"} $loglines 800 10
+
+            # make sure master is alive
+            $master ping
+        }
+    }
+}
+
+test {replicaof right after disconnection} {
+    # this is a rare race condition that was reproduced sporadically by the psync2 unit.
+    # see details in #7205
+    start_server {tags {"repl"}} {
+        set replica1 [srv 0 client]
+        set replica1_host [srv 0 host]
+        set replica1_port [srv 0 port]
+        set replica1_log [srv 0 stdout]
+        start_server {} {
+            set replica2 [srv 0 client]
+            set replica2_host [srv 0 host]
+            set replica2_port [srv 0 port]
+            set replica2_log [srv 0 stdout]
+            start_server {} {
+                set master [srv 0 client]
+                set master_host [srv 0 host]
+                set master_port [srv 0 port]
+                $replica1 replicaof $master_host $master_port
+                $replica2 replicaof $master_host $master_port
+
+                wait_for_condition 50 100 {
+                    [string match {*master_link_status:up*} [$replica1 info replication]] &&
+                    [string match {*master_link_status:up*} [$replica2 info replication]]
+                } else {
+                    fail "Can't turn the instance into a replica"
+                }
+
+                set rd [redis_deferring_client -1]
+                $rd debug sleep 1
+                after 100
+
+                # when replica2 will wake up from the sleep it will find both disconnection
+                # from it's master and also a replicaof command at the same event loop
+                $master client kill type replica
+                $replica2 replicaof $replica1_host $replica1_port
+                $rd read
+
+                wait_for_condition 50 100 {
+                    [string match {*master_link_status:up*} [$replica2 info replication]]
+                } else {
+                    fail "role change failed."
+                }
+
+                # make sure psync succeeded, and there were no unexpected full syncs.
+                assert_equal [status $master sync_full] 2
+                assert_equal [status $replica1 sync_full] 0
+                assert_equal [status $replica2 sync_full] 0
+            }
+        }
+    }
+}
+
+test {Kill rdb child process if its dumping RDB is not useful} {
+    start_server {tags {"repl"}} {
+        set slave1 [srv 0 client]
+        start_server {} {
+            set slave2 [srv 0 client]
+            start_server {} {
+                set master [srv 0 client]
+                set master_host [srv 0 host]
+                set master_port [srv 0 port]
+                for {set i 0} {$i < 10} {incr i} {
+                    $master set $i $i
+                }
+                # Generating RDB will cost 10s(10 * 1s)
+                $master config set rdb-key-save-delay 1000000
+                $master config set repl-diskless-sync no
+                $master config set save ""
+
+                $slave1 slaveof $master_host $master_port
+                $slave2 slaveof $master_host $master_port
+
+                # Wait for starting child
+                wait_for_condition 50 100 {
+                    ([s 0 rdb_bgsave_in_progress] == 1) &&
+                    ([string match "*wait_bgsave*" [s 0 slave0]]) &&
+                    ([string match "*wait_bgsave*" [s 0 slave1]])
+                } else {
+                    fail "rdb child didn't start"
+                }
+
+                # Slave1 disconnect with master
+                $slave1 slaveof no one
+                # Shouldn't kill child since another slave wait for rdb
+                after 100
+                assert {[s 0 rdb_bgsave_in_progress] == 1}
+
+                # Slave2 disconnect with master
+                $slave2 slaveof no one
+                # Should kill child
+                wait_for_condition 100 10 {
+                    [s 0 rdb_bgsave_in_progress] eq 0
+                } else {
+                    fail "can't kill rdb child"
+                }
+
+                # If have save parameters, won't kill child
+                $master config set save "900 1"
+                $slave1 slaveof $master_host $master_port
+                $slave2 slaveof $master_host $master_port
+                wait_for_condition 50 100 {
+                    ([s 0 rdb_bgsave_in_progress] == 1) &&
+                    ([string match "*wait_bgsave*" [s 0 slave0]]) &&
+                    ([string match "*wait_bgsave*" [s 0 slave1]])
+                } else {
+                    fail "rdb child didn't start"
+                }
+                $slave1 slaveof no one
+                $slave2 slaveof no one
+                after 200
+                assert {[s 0 rdb_bgsave_in_progress] == 1}
+                catch {$master shutdown nosave}
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/modules/Makefile b/redis-stable/tests/modules/Makefile
new file mode 100644
index 00000000..ae611de8
--- /dev/null
+++ b/redis-stable/tests/modules/Makefile
@@ -0,0 +1,60 @@
+
+# find the OS
+uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
+
+ifeq ($(uname_S),Darwin)
+	SHOBJ_CFLAGS ?= -W -Wall -dynamic -fno-common -g -ggdb -std=c99 -O2
+	SHOBJ_LDFLAGS ?= -bundle -undefined dynamic_lookup
+else	# Linux, others
+	SHOBJ_CFLAGS ?= -W -Wall -fno-common -g -ggdb -std=c99 -O2
+	SHOBJ_LDFLAGS ?= -shared
+endif
+
+# Needed to satisfy __stack_chk_fail_local on Linux with -m32, due to gcc
+# -fstack-protector by default. Breaks on FreeBSD so we exclude it.
+ifneq ($(uname_S),FreeBSD)
+    LIBS = -lc
+endif
+
+TEST_MODULES = \
+    commandfilter.so \
+    basics.so \
+    testrdb.so \
+    fork.so \
+    infotest.so \
+    propagate.so \
+    misc.so \
+    hooks.so \
+    blockonkeys.so \
+    blockonbackground.so \
+    scan.so \
+    datatype.so \
+    auth.so \
+    keyspace_events.so \
+    blockedclient.so \
+    getkeys.so \
+    test_lazyfree.so \
+    timer.so \
+    defragtest.so \
+    hash.so \
+    zset.so \
+    stream.so
+
+
+.PHONY: all
+
+all: $(TEST_MODULES)
+
+32bit:
+	$(MAKE) CFLAGS="-m32" LDFLAGS="-melf_i386"
+
+%.xo: %.c ../../src/redismodule.h
+	$(CC) -I../../src $(CFLAGS) $(SHOBJ_CFLAGS) -fPIC -c $< -o $@
+
+%.so: %.xo
+	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LDFLAGS) $(LIBS)
+
+.PHONY: clean
+
+clean:
+	rm -f $(TEST_MODULES) $(TEST_MODULES:.so=.xo)
diff --git a/redis-stable/tests/modules/auth.c b/redis-stable/tests/modules/auth.c
new file mode 100644
index 00000000..b13c1038
--- /dev/null
+++ b/redis-stable/tests/modules/auth.c
@@ -0,0 +1,90 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+// A simple global user
+static RedisModuleUser *global = NULL;
+static long long client_change_delta = 0;
+
+void UserChangedCallback(uint64_t client_id, void *privdata) {
+    REDISMODULE_NOT_USED(privdata);
+    REDISMODULE_NOT_USED(client_id);
+    client_change_delta++;
+}
+
+int Auth_CreateModuleUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (global) {
+        RedisModule_FreeModuleUser(global);
+    }
+
+    global = RedisModule_CreateModuleUser("global");
+    RedisModule_SetModuleUserACL(global, "allcommands");
+    RedisModule_SetModuleUserACL(global, "allkeys");
+    RedisModule_SetModuleUserACL(global, "on");
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+int Auth_AuthModuleUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    uint64_t client_id;
+    RedisModule_AuthenticateClientWithUser(ctx, global, UserChangedCallback, NULL, &client_id);
+
+    return RedisModule_ReplyWithLongLong(ctx, (uint64_t) client_id);
+}
+
+int Auth_AuthRealUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+
+    size_t length;
+    uint64_t client_id;
+
+    RedisModuleString *user_string = argv[1];
+    const char *name = RedisModule_StringPtrLen(user_string, &length);
+
+    if (RedisModule_AuthenticateClientWithACLUser(ctx, name, length, 
+            UserChangedCallback, NULL, &client_id) == REDISMODULE_ERR) {
+        return RedisModule_ReplyWithError(ctx, "Invalid user");   
+    }
+
+    return RedisModule_ReplyWithLongLong(ctx, (uint64_t) client_id);
+}
+
+int Auth_ChangeCount(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    long long result = client_change_delta;
+    client_change_delta = 0;
+    return RedisModule_ReplyWithLongLong(ctx, result);
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"testacl",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"auth.authrealuser",
+        Auth_AuthRealUser,"no-auth",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"auth.createmoduleuser",
+        Auth_CreateModuleUser,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"auth.authmoduleuser",
+        Auth_AuthModuleUser,"no-auth",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"auth.changecount",
+        Auth_ChangeCount,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/basics.c b/redis-stable/tests/modules/basics.c
new file mode 100644
index 00000000..59ceb2d1
--- /dev/null
+++ b/redis-stable/tests/modules/basics.c
@@ -0,0 +1,539 @@
+/* Module designed to test the Redis modules subsystem.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+#include <string.h>
+
+/* --------------------------------- Helpers -------------------------------- */
+
+/* Return true if the reply and the C null term string matches. */
+int TestMatchReply(RedisModuleCallReply *reply, char *str) {
+    RedisModuleString *mystr;
+    mystr = RedisModule_CreateStringFromCallReply(reply);
+    if (!mystr) return 0;
+    const char *ptr = RedisModule_StringPtrLen(mystr,NULL);
+    return strcmp(ptr,str) == 0;
+}
+
+/* ------------------------------- Test units ------------------------------- */
+
+/* TEST.CALL -- Test Call() API. */
+int TestCall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_AutoMemory(ctx);
+    RedisModuleCallReply *reply;
+
+    RedisModule_Call(ctx,"DEL","c","mylist");
+    RedisModuleString *mystr = RedisModule_CreateString(ctx,"foo",3);
+    RedisModule_Call(ctx,"RPUSH","csl","mylist",mystr,(long long)1234);
+    reply = RedisModule_Call(ctx,"LRANGE","ccc","mylist","0","-1");
+    long long items = RedisModule_CallReplyLength(reply);
+    if (items != 2) goto fail;
+
+    RedisModuleCallReply *item0, *item1;
+
+    item0 = RedisModule_CallReplyArrayElement(reply,0);
+    item1 = RedisModule_CallReplyArrayElement(reply,1);
+    if (!TestMatchReply(item0,"foo")) goto fail;
+    if (!TestMatchReply(item1,"1234")) goto fail;
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+
+fail:
+    RedisModule_ReplyWithSimpleString(ctx,"ERR");
+    return REDISMODULE_OK;
+}
+
+/* TEST.STRING.APPEND -- Test appending to an existing string object. */
+int TestStringAppend(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleString *s = RedisModule_CreateString(ctx,"foo",3);
+    RedisModule_StringAppendBuffer(ctx,s,"bar",3);
+    RedisModule_ReplyWithString(ctx,s);
+    RedisModule_FreeString(ctx,s);
+    return REDISMODULE_OK;
+}
+
+/* TEST.STRING.APPEND.AM -- Test append with retain when auto memory is on. */
+int TestStringAppendAM(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_AutoMemory(ctx);
+    RedisModuleString *s = RedisModule_CreateString(ctx,"foo",3);
+    RedisModule_RetainString(ctx,s);
+    RedisModule_StringAppendBuffer(ctx,s,"bar",3);
+    RedisModule_ReplyWithString(ctx,s);
+    RedisModule_FreeString(ctx,s);
+    return REDISMODULE_OK;
+}
+
+/* TEST.STRING.PRINTF -- Test string formatting. */
+int TestStringPrintf(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx);
+    if (argc < 3) {
+        return RedisModule_WrongArity(ctx);
+    }
+    RedisModuleString *s = RedisModule_CreateStringPrintf(ctx,
+        "Got %d args. argv[1]: %s, argv[2]: %s",
+        argc,
+        RedisModule_StringPtrLen(argv[1], NULL),
+        RedisModule_StringPtrLen(argv[2], NULL)
+    );
+
+    RedisModule_ReplyWithString(ctx,s);
+
+    return REDISMODULE_OK;
+}
+
+int failTest(RedisModuleCtx *ctx, const char *msg) {
+    RedisModule_ReplyWithError(ctx, msg);
+    return REDISMODULE_ERR;
+}
+
+int TestUnlink(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx);
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleKey *k = RedisModule_OpenKey(ctx, RedisModule_CreateStringPrintf(ctx, "unlinked"), REDISMODULE_WRITE | REDISMODULE_READ);
+    if (!k) return failTest(ctx, "Could not create key");
+
+    if (REDISMODULE_ERR == RedisModule_StringSet(k, RedisModule_CreateStringPrintf(ctx, "Foobar"))) {
+        return failTest(ctx, "Could not set string value");
+    }
+
+    RedisModuleCallReply *rep = RedisModule_Call(ctx, "EXISTS", "c", "unlinked");
+    if (!rep || RedisModule_CallReplyInteger(rep) != 1) {
+        return failTest(ctx, "Key does not exist before unlink");
+    }
+
+    if (REDISMODULE_ERR == RedisModule_UnlinkKey(k)) {
+        return failTest(ctx, "Could not unlink key");
+    }
+
+    rep = RedisModule_Call(ctx, "EXISTS", "c", "unlinked");
+    if (!rep || RedisModule_CallReplyInteger(rep) != 0) {
+        return failTest(ctx, "Could not verify key to be unlinked");
+    }
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* TEST.STRING.TRUNCATE -- Test truncating an existing string object. */
+int TestStringTruncate(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx);
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_Call(ctx, "SET", "cc", "foo", "abcde");
+    RedisModuleKey *k = RedisModule_OpenKey(ctx, RedisModule_CreateStringPrintf(ctx, "foo"), REDISMODULE_READ | REDISMODULE_WRITE);
+    if (!k) return failTest(ctx, "Could not create key");
+
+    size_t len = 0;
+    char* s;
+
+    /* expand from 5 to 8 and check null pad */
+    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 8)) {
+        return failTest(ctx, "Could not truncate string value (8)");
+    }
+    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
+    if (!s) {
+        return failTest(ctx, "Failed to read truncated string (8)");
+    } else if (len != 8) {
+        return failTest(ctx, "Failed to expand string value (8)");
+    } else if (0 != strncmp(s, "abcde\0\0\0", 8)) {
+        return failTest(ctx, "Failed to null pad string value (8)");
+    }
+
+    /* shrink from 8 to 4 */
+    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 4)) {
+        return failTest(ctx, "Could not truncate string value (4)");
+    }
+    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
+    if (!s) {
+        return failTest(ctx, "Failed to read truncated string (4)");
+    } else if (len != 4) {
+        return failTest(ctx, "Failed to shrink string value (4)");
+    } else if (0 != strncmp(s, "abcd", 4)) {
+        return failTest(ctx, "Failed to truncate string value (4)");
+    }
+
+    /* shrink to 0 */
+    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 0)) {
+        return failTest(ctx, "Could not truncate string value (0)");
+    }
+    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
+    if (!s) {
+        return failTest(ctx, "Failed to read truncated string (0)");
+    } else if (len != 0) {
+        return failTest(ctx, "Failed to shrink string value to (0)");
+    }
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+int NotifyCallback(RedisModuleCtx *ctx, int type, const char *event,
+                   RedisModuleString *key) {
+  RedisModule_AutoMemory(ctx);
+  /* Increment a counter on the notifications: for each key notified we
+   * increment a counter */
+  RedisModule_Log(ctx, "notice", "Got event type %d, event %s, key %s", type,
+                  event, RedisModule_StringPtrLen(key, NULL));
+
+  RedisModule_Call(ctx, "HINCRBY", "csc", "notifications", key, "1");
+  return REDISMODULE_OK;
+}
+
+/* TEST.NOTIFICATIONS -- Test Keyspace Notifications. */
+int TestNotifications(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx);
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+#define FAIL(msg, ...)                                                                       \
+    {                                                                                        \
+        RedisModule_Log(ctx, "warning", "Failed NOTIFY Test. Reason: " #msg, ##__VA_ARGS__); \
+        goto err;                                                                            \
+    }
+    RedisModule_Call(ctx, "FLUSHDB", "");
+
+    RedisModule_Call(ctx, "SET", "cc", "foo", "bar");
+    RedisModule_Call(ctx, "SET", "cc", "foo", "baz");
+    RedisModule_Call(ctx, "SADD", "cc", "bar", "x");
+    RedisModule_Call(ctx, "SADD", "cc", "bar", "y");
+
+    RedisModule_Call(ctx, "HSET", "ccc", "baz", "x", "y");
+    /* LPUSH should be ignored and not increment any counters */
+    RedisModule_Call(ctx, "LPUSH", "cc", "l", "y");
+    RedisModule_Call(ctx, "LPUSH", "cc", "l", "y");
+
+    /* Miss some keys intentionally so we will get a "keymiss" notification. */
+    RedisModule_Call(ctx, "GET", "c", "nosuchkey");
+    RedisModule_Call(ctx, "SMEMBERS", "c", "nosuchkey");
+
+    size_t sz;
+    const char *rep;
+    RedisModuleCallReply *r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "foo");
+    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
+        FAIL("Wrong or no reply for foo");
+    } else {
+        rep = RedisModule_CallReplyStringPtr(r, &sz);
+        if (sz != 1 || *rep != '2') {
+            FAIL("Got reply '%s'. expected '2'", RedisModule_CallReplyStringPtr(r, NULL));
+        }
+    }
+
+    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "bar");
+    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
+        FAIL("Wrong or no reply for bar");
+    } else {
+        rep = RedisModule_CallReplyStringPtr(r, &sz);
+        if (sz != 1 || *rep != '2') {
+            FAIL("Got reply '%s'. expected '2'", rep);
+        }
+    }
+
+    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "baz");
+    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
+        FAIL("Wrong or no reply for baz");
+    } else {
+        rep = RedisModule_CallReplyStringPtr(r, &sz);
+        if (sz != 1 || *rep != '1') {
+            FAIL("Got reply '%.*s'. expected '1'", (int)sz, rep);
+        }
+    }
+    /* For l we expect nothing since we didn't subscribe to list events */
+    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "l");
+    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_NULL) {
+        FAIL("Wrong reply for l");
+    }
+
+    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "nosuchkey");
+    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
+        FAIL("Wrong or no reply for nosuchkey");
+    } else {
+        rep = RedisModule_CallReplyStringPtr(r, &sz);
+        if (sz != 1 || *rep != '2') {
+            FAIL("Got reply '%.*s'. expected '2'", (int)sz, rep);
+        }
+    }
+
+    RedisModule_Call(ctx, "FLUSHDB", "");
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+err:
+    RedisModule_Call(ctx, "FLUSHDB", "");
+
+    return RedisModule_ReplyWithSimpleString(ctx, "ERR");
+}
+
+/* TEST.CTXFLAGS -- Test GetContextFlags. */
+int TestCtxFlags(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argc);
+    REDISMODULE_NOT_USED(argv);
+
+    RedisModule_AutoMemory(ctx);
+
+    int ok = 1;
+    const char *errString = NULL;
+#undef FAIL
+#define FAIL(msg)        \
+    {                    \
+        ok = 0;          \
+        errString = msg; \
+        goto end;        \
+    }
+
+    int flags = RedisModule_GetContextFlags(ctx);
+    if (flags == 0) {
+        FAIL("Got no flags");
+    }
+
+    if (flags & REDISMODULE_CTX_FLAGS_LUA) FAIL("Lua flag was set");
+    if (flags & REDISMODULE_CTX_FLAGS_MULTI) FAIL("Multi flag was set");
+
+    if (flags & REDISMODULE_CTX_FLAGS_AOF) FAIL("AOF Flag was set")
+    /* Enable AOF to test AOF flags */
+    RedisModule_Call(ctx, "config", "ccc", "set", "appendonly", "yes");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (!(flags & REDISMODULE_CTX_FLAGS_AOF)) FAIL("AOF Flag not set after config set");
+
+    /* Disable RDB saving and test the flag. */
+    RedisModule_Call(ctx, "config", "ccc", "set", "save", "");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (flags & REDISMODULE_CTX_FLAGS_RDB) FAIL("RDB Flag was set");
+    /* Enable RDB to test RDB flags */
+    RedisModule_Call(ctx, "config", "ccc", "set", "save", "900 1");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (!(flags & REDISMODULE_CTX_FLAGS_RDB)) FAIL("RDB Flag was not set after config set");
+
+    if (!(flags & REDISMODULE_CTX_FLAGS_MASTER)) FAIL("Master flag was not set");
+    if (flags & REDISMODULE_CTX_FLAGS_SLAVE) FAIL("Slave flag was set");
+    if (flags & REDISMODULE_CTX_FLAGS_READONLY) FAIL("Read-only flag was set");
+    if (flags & REDISMODULE_CTX_FLAGS_CLUSTER) FAIL("Cluster flag was set");
+
+    /* Disable maxmemory and test the flag. (it is implicitly set in 32bit builds. */
+    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "0");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (flags & REDISMODULE_CTX_FLAGS_MAXMEMORY) FAIL("Maxmemory flag was set");
+
+    /* Enable maxmemory and test the flag. */
+    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "100000000");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (!(flags & REDISMODULE_CTX_FLAGS_MAXMEMORY))
+        FAIL("Maxmemory flag was not set after config set");
+
+    if (flags & REDISMODULE_CTX_FLAGS_EVICT) FAIL("Eviction flag was set");
+    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory-policy", "allkeys-lru");
+    flags = RedisModule_GetContextFlags(ctx);
+    if (!(flags & REDISMODULE_CTX_FLAGS_EVICT)) FAIL("Eviction flag was not set after config set");
+
+end:
+    /* Revert config changes */
+    RedisModule_Call(ctx, "config", "ccc", "set", "appendonly", "no");
+    RedisModule_Call(ctx, "config", "ccc", "set", "save", "");
+    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "0");
+    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory-policy", "noeviction");
+
+    if (!ok) {
+        RedisModule_Log(ctx, "warning", "Failed CTXFLAGS Test. Reason: %s", errString);
+        return RedisModule_ReplyWithSimpleString(ctx, "ERR");
+    }
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* ----------------------------- Test framework ----------------------------- */
+
+/* Return 1 if the reply matches the specified string, otherwise log errors
+ * in the server log and return 0. */
+int TestAssertStringReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply, char *str, size_t len) {
+    RedisModuleString *mystr, *expected;
+
+    if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_ERROR) {
+        RedisModule_Log(ctx,"warning","Test error reply: %s",
+            RedisModule_CallReplyStringPtr(reply, NULL));
+        return 0;
+    } else if (RedisModule_CallReplyType(reply) != REDISMODULE_REPLY_STRING) {
+        RedisModule_Log(ctx,"warning","Unexpected reply type %d",
+            RedisModule_CallReplyType(reply));
+        return 0;
+    }
+    mystr = RedisModule_CreateStringFromCallReply(reply);
+    expected = RedisModule_CreateString(ctx,str,len);
+    if (RedisModule_StringCompare(mystr,expected) != 0) {
+        const char *mystr_ptr = RedisModule_StringPtrLen(mystr,NULL);
+        const char *expected_ptr = RedisModule_StringPtrLen(expected,NULL);
+        RedisModule_Log(ctx,"warning",
+            "Unexpected string reply '%s' (instead of '%s')",
+            mystr_ptr, expected_ptr);
+        return 0;
+    }
+    return 1;
+}
+
+/* Return 1 if the reply matches the specified integer, otherwise log errors
+ * in the server log and return 0. */
+int TestAssertIntegerReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply, long long expected) {
+    if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_ERROR) {
+        RedisModule_Log(ctx,"warning","Test error reply: %s",
+            RedisModule_CallReplyStringPtr(reply, NULL));
+        return 0;
+    } else if (RedisModule_CallReplyType(reply) != REDISMODULE_REPLY_INTEGER) {
+        RedisModule_Log(ctx,"warning","Unexpected reply type %d",
+            RedisModule_CallReplyType(reply));
+        return 0;
+    }
+    long long val = RedisModule_CallReplyInteger(reply);
+    if (val != expected) {
+        RedisModule_Log(ctx,"warning",
+            "Unexpected integer reply '%lld' (instead of '%lld')",
+            val, expected);
+        return 0;
+    }
+    return 1;
+}
+
+#define T(name,...) \
+    do { \
+        RedisModule_Log(ctx,"warning","Testing %s", name); \
+        reply = RedisModule_Call(ctx,name,__VA_ARGS__); \
+    } while (0)
+
+/* TEST.BASICS -- Run all the tests.
+ * Note: it is useful to run these tests from the module rather than TCL
+ * since it's easier to check the reply types like that (make a distinction
+ * between 0 and "0", etc. */
+int TestBasics(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModule_AutoMemory(ctx);
+    RedisModuleCallReply *reply;
+
+    /* Make sure the DB is empty before to proceed. */
+    T("dbsize","");
+    if (!TestAssertIntegerReply(ctx,reply,0)) goto fail;
+
+    T("ping","");
+    if (!TestAssertStringReply(ctx,reply,"PONG",4)) goto fail;
+
+    T("test.call","");
+    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
+
+    T("test.ctxflags","");
+    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
+
+    T("test.string.append","");
+    if (!TestAssertStringReply(ctx,reply,"foobar",6)) goto fail;
+
+    T("test.string.truncate","");
+    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
+
+    T("test.unlink","");
+    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
+
+    T("test.string.append.am","");
+    if (!TestAssertStringReply(ctx,reply,"foobar",6)) goto fail;
+
+    T("test.string.printf", "cc", "foo", "bar");
+    if (!TestAssertStringReply(ctx,reply,"Got 3 args. argv[1]: foo, argv[2]: bar",38)) goto fail;
+
+    T("test.notify", "");
+    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
+
+    RedisModule_ReplyWithSimpleString(ctx,"ALL TESTS PASSED");
+    return REDISMODULE_OK;
+
+fail:
+    RedisModule_ReplyWithSimpleString(ctx,
+        "SOME TEST DID NOT PASS! Check server logs");
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"test",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.call",
+        TestCall,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.string.append",
+        TestStringAppend,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.string.append.am",
+        TestStringAppendAM,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.string.truncate",
+        TestStringTruncate,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.string.printf",
+        TestStringPrintf,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.ctxflags",
+        TestCtxFlags,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.unlink",
+        TestUnlink,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.basics",
+        TestBasics,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModule_SubscribeToKeyspaceEvents(ctx,
+                                            REDISMODULE_NOTIFY_HASH |
+                                            REDISMODULE_NOTIFY_SET |
+                                            REDISMODULE_NOTIFY_STRING |
+                                            REDISMODULE_NOTIFY_KEY_MISS,
+                                        NotifyCallback);
+    if (RedisModule_CreateCommand(ctx,"test.notify",
+        TestNotifications,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/blockedclient.c b/redis-stable/tests/modules/blockedclient.c
new file mode 100644
index 00000000..c3b0d5eb
--- /dev/null
+++ b/redis-stable/tests/modules/blockedclient.c
@@ -0,0 +1,209 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+#include <assert.h>
+#include <stdio.h>
+#include <pthread.h>
+
+#define UNUSED(V) ((void) V)
+
+void *sub_worker(void *arg) {
+    // Get Redis module context
+    RedisModuleCtx *ctx = (RedisModuleCtx *)arg;
+
+    // Try acquiring GIL
+    int res = RedisModule_ThreadSafeContextTryLock(ctx);
+
+    // GIL is already taken by the calling thread expecting to fail.
+    assert(res != REDISMODULE_OK);
+
+    return NULL;
+}
+
+void *worker(void *arg) {
+    // Retrieve blocked client
+    RedisModuleBlockedClient *bc = (RedisModuleBlockedClient *)arg;
+
+    // Get Redis module context
+    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bc);
+
+    // Acquire GIL
+    RedisModule_ThreadSafeContextLock(ctx);
+
+    // Create another thread which will try to acquire the GIL
+    pthread_t tid;
+    int res = pthread_create(&tid, NULL, sub_worker, ctx);
+    assert(res == 0);
+
+    // Wait for thread
+    pthread_join(tid, NULL);
+
+    // Release GIL
+    RedisModule_ThreadSafeContextUnlock(ctx);
+
+    // Reply to client
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+
+    // Unblock client
+    RedisModule_UnblockClient(bc, NULL);
+
+    // Free the Redis module context
+    RedisModule_FreeThreadSafeContext(ctx);
+
+    return NULL;
+}
+
+int acquire_gil(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    UNUSED(argv);
+    UNUSED(argc);
+
+    int flags = RedisModule_GetContextFlags(ctx);
+    int allFlags = RedisModule_GetContextFlagsAll();
+    if ((allFlags & REDISMODULE_CTX_FLAGS_MULTI) &&
+        (flags & REDISMODULE_CTX_FLAGS_MULTI)) {
+        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not supported inside multi");
+        return REDISMODULE_OK;
+    }
+
+    if ((allFlags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING) &&
+        (flags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING)) {
+        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not allowed");
+        return REDISMODULE_OK;
+    }
+
+    /* This command handler tries to acquire the GIL twice
+     * once in the worker thread using "RedisModule_ThreadSafeContextLock"
+     * second in the sub-worker thread
+     * using "RedisModule_ThreadSafeContextTryLock"
+     * as the GIL is already locked. */
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx, NULL, NULL, NULL, 0);
+
+    pthread_t tid;
+    int res = pthread_create(&tid, NULL, worker, bc);
+    assert(res == 0);
+
+    return REDISMODULE_OK;
+}
+
+typedef struct {
+    RedisModuleString **argv;
+    int argc;
+    RedisModuleBlockedClient *bc;
+} bg_call_data;
+
+void *bg_call_worker(void *arg) {
+    bg_call_data *bg = arg;
+
+    // Get Redis module context
+    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bg->bc);
+
+    // Acquire GIL
+    RedisModule_ThreadSafeContextLock(ctx);
+
+    // Call the command
+    const char* cmd = RedisModule_StringPtrLen(bg->argv[1], NULL);
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, cmd, "v", bg->argv + 2, bg->argc - 2);
+
+    // Release GIL
+    RedisModule_ThreadSafeContextUnlock(ctx);
+
+    // Reply to client
+    if (!rep) {
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    } else {
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+
+    // Unblock client
+    RedisModule_UnblockClient(bg->bc, NULL);
+
+    /* Free the arguments */
+    for (int i=0; i<bg->argc; i++)
+        RedisModule_FreeString(ctx, bg->argv[i]);
+    RedisModule_Free(bg->argv);
+    RedisModule_Free(bg);
+
+    // Free the Redis module context
+    RedisModule_FreeThreadSafeContext(ctx);
+
+    return NULL;
+}
+
+int do_bg_rm_call(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    UNUSED(argv);
+    UNUSED(argc);
+
+    /* Make sure we're not trying to block a client when we shouldn't */
+    int flags = RedisModule_GetContextFlags(ctx);
+    int allFlags = RedisModule_GetContextFlagsAll();
+    if ((allFlags & REDISMODULE_CTX_FLAGS_MULTI) &&
+        (flags & REDISMODULE_CTX_FLAGS_MULTI)) {
+        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not supported inside multi");
+        return REDISMODULE_OK;
+    }
+    if ((allFlags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING) &&
+        (flags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING)) {
+        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not allowed");
+        return REDISMODULE_OK;
+    }
+
+    /* Make a copy of the arguments and pass them to the thread. */
+    bg_call_data *bg = RedisModule_Alloc(sizeof(bg_call_data));
+    bg->argv = RedisModule_Alloc(sizeof(RedisModuleString*)*argc);
+    bg->argc = argc;
+    for (int i=0; i<argc; i++)
+        bg->argv[i] = RedisModule_HoldString(ctx, argv[i]);
+
+    /* Block the client */
+    bg->bc = RedisModule_BlockClient(ctx, NULL, NULL, NULL, 0);
+
+    /* Start a thread to handle the request */
+    pthread_t tid;
+    int res = pthread_create(&tid, NULL, bg_call_worker, bg);
+    assert(res == 0);
+
+    return REDISMODULE_OK;
+}
+
+int do_rm_call(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
+    UNUSED(argv);
+    UNUSED(argc);
+
+    if(argc < 2){
+        return RedisModule_WrongArity(ctx);
+    }
+
+    const char* cmd = RedisModule_StringPtrLen(argv[1], NULL);
+
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, cmd, "v", argv + 2, argc - 2);
+    if(!rep){
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    }else{
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+
+    return REDISMODULE_OK;
+}
+
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx, "blockedclient", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "acquire_gil", acquire_gil, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "do_rm_call", do_rm_call, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "do_bg_rm_call", do_bg_rm_call, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/blockonbackground.c b/redis-stable/tests/modules/blockonbackground.c
new file mode 100644
index 00000000..68875630
--- /dev/null
+++ b/redis-stable/tests/modules/blockonbackground.c
@@ -0,0 +1,291 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#define _XOPEN_SOURCE 700
+#include "redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <pthread.h>
+#include <time.h>
+
+#define UNUSED(x) (void)(x)
+
+/* Reply callback for blocking command BLOCK.DEBUG */
+int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    int *myint = RedisModule_GetBlockedClientPrivateData(ctx);
+    return RedisModule_ReplyWithLongLong(ctx,*myint);
+}
+
+/* Timeout callback for blocking command BLOCK.DEBUG */
+int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    RedisModuleBlockedClient *bc = RedisModule_GetBlockedClientHandle(ctx);
+    RedisModule_BlockedClientMeasureTimeEnd(bc);
+    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
+}
+
+/* Private data freeing callback for BLOCK.DEBUG command. */
+void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
+    UNUSED(ctx);
+    RedisModule_Free(privdata);
+}
+
+/* The thread entry point that actually executes the blocking part
+ * of the command BLOCK.DEBUG. */
+void *BlockDebug_ThreadMain(void *arg) {
+    void **targ = arg;
+    RedisModuleBlockedClient *bc = targ[0];
+    long long delay = (unsigned long)targ[1];
+    long long enable_time_track = (unsigned long)targ[2];
+    if (enable_time_track)
+        RedisModule_BlockedClientMeasureTimeStart(bc);
+    RedisModule_Free(targ);
+
+    struct timespec ts;
+    ts.tv_sec = delay / 1000;
+    ts.tv_nsec = (delay % 1000) * 1000000;
+    nanosleep(&ts, NULL);
+    int *r = RedisModule_Alloc(sizeof(int));
+    *r = rand();
+    if (enable_time_track)
+        RedisModule_BlockedClientMeasureTimeEnd(bc);
+    RedisModule_UnblockClient(bc,r);
+    return NULL;
+}
+
+/* The thread entry point that actually executes the blocking part
+ * of the command BLOCK.DOUBLE_DEBUG. */
+void *DoubleBlock_ThreadMain(void *arg) {
+    void **targ = arg;
+    RedisModuleBlockedClient *bc = targ[0];
+    long long delay = (unsigned long)targ[1];
+    RedisModule_BlockedClientMeasureTimeStart(bc);
+    RedisModule_Free(targ);
+    struct timespec ts;
+    ts.tv_sec = delay / 1000;
+    ts.tv_nsec = (delay % 1000) * 1000000;
+    nanosleep(&ts, NULL);
+    int *r = RedisModule_Alloc(sizeof(int));
+    *r = rand();
+    RedisModule_BlockedClientMeasureTimeEnd(bc);
+    /* call again RedisModule_BlockedClientMeasureTimeStart() and
+     * RedisModule_BlockedClientMeasureTimeEnd and ensure that the
+     * total execution time is 2x the delay. */
+    RedisModule_BlockedClientMeasureTimeStart(bc);
+    nanosleep(&ts, NULL);
+    RedisModule_BlockedClientMeasureTimeEnd(bc);
+
+    RedisModule_UnblockClient(bc,r);
+    return NULL;
+}
+
+void HelloBlock_Disconnected(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc) {
+    RedisModule_Log(ctx,"warning","Blocked client %p disconnected!",
+        (void*)bc);
+}
+
+/* BLOCK.DEBUG <delay_ms> <timeout_ms> -- Block for <count> milliseconds, then reply with
+ * a random number. Timeout is the command timeout, so that you can test
+ * what happens when the delay is greater than the timeout. */
+int HelloBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    long long delay;
+    long long timeout;
+
+    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    pthread_t tid;
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
+
+    /* Here we set a disconnection handler, however since this module will
+     * block in sleep() in a thread, there is not much we can do in the
+     * callback, so this is just to show you the API. */
+    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
+
+    /* Now that we setup a blocking client, we need to pass the control
+     * to the thread. However we need to pass arguments to the thread:
+     * the delay and a reference to the blocked client handle. */
+    void **targ = RedisModule_Alloc(sizeof(void*)*3);
+    targ[0] = bc;
+    targ[1] = (void*)(unsigned long) delay;
+    // pass 1 as flag to enable time tracking
+    targ[2] = (void*)(unsigned long) 1;
+
+    if (pthread_create(&tid,NULL,BlockDebug_ThreadMain,targ) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    }
+    return REDISMODULE_OK;
+}
+
+/* BLOCK.DEBUG_NOTRACKING <delay_ms> <timeout_ms> -- Block for <count> milliseconds, then reply with
+ * a random number. Timeout is the command timeout, so that you can test
+ * what happens when the delay is greater than the timeout.
+ * this command does not track background time so the background time should no appear in stats*/
+int HelloBlockNoTracking_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    long long delay;
+    long long timeout;
+
+    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    pthread_t tid;
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
+
+    /* Here we set a disconnection handler, however since this module will
+     * block in sleep() in a thread, there is not much we can do in the
+     * callback, so this is just to show you the API. */
+    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
+
+    /* Now that we setup a blocking client, we need to pass the control
+     * to the thread. However we need to pass arguments to the thread:
+     * the delay and a reference to the blocked client handle. */
+    void **targ = RedisModule_Alloc(sizeof(void*)*3);
+    targ[0] = bc;
+    targ[1] = (void*)(unsigned long) delay;
+    // pass 0 as flag to enable time tracking
+    targ[2] = (void*)(unsigned long) 0;
+
+    if (pthread_create(&tid,NULL,BlockDebug_ThreadMain,targ) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    }
+    return REDISMODULE_OK;
+}
+
+/* BLOCK.DOUBLE_DEBUG <delay_ms> -- Block for 2 x <count> milliseconds,
+ * then reply with a random number.
+ * This command is used to test multiple calls to RedisModule_BlockedClientMeasureTimeStart()
+ * and RedisModule_BlockedClientMeasureTimeEnd() within the same execution. */
+int HelloDoubleBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    long long delay;
+
+    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
+    }
+
+    pthread_t tid;
+    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,0);
+
+    /* Now that we setup a blocking client, we need to pass the control
+     * to the thread. However we need to pass arguments to the thread:
+     * the delay and a reference to the blocked client handle. */
+    void **targ = RedisModule_Alloc(sizeof(void*)*2);
+    targ[0] = bc;
+    targ[1] = (void*)(unsigned long) delay;
+
+    if (pthread_create(&tid,NULL,DoubleBlock_ThreadMain,targ) != 0) {
+        RedisModule_AbortBlock(bc);
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    }
+    return REDISMODULE_OK;
+}
+
+RedisModuleBlockedClient *blocked_client = NULL;
+
+/* BLOCK.BLOCK [TIMEOUT] -- Blocks the current client until released
+ * or TIMEOUT seconds. If TIMEOUT is zero, no timeout function is
+ * registered.
+ */
+int Block_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (RedisModule_IsBlockedReplyRequest(ctx)) {
+        RedisModuleString *r = RedisModule_GetBlockedClientPrivateData(ctx);
+        return RedisModule_ReplyWithString(ctx, r);
+    } else if (RedisModule_IsBlockedTimeoutRequest(ctx)) {
+        RedisModule_UnblockClient(blocked_client, NULL); /* Must be called to avoid leaks. */
+        blocked_client = NULL;
+        return RedisModule_ReplyWithSimpleString(ctx, "Timed out");
+    }
+
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    long long timeout;
+
+    if (RedisModule_StringToLongLong(argv[1], &timeout) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx, "ERR invalid timeout");
+    }
+    if (blocked_client) {
+        return RedisModule_ReplyWithError(ctx, "ERR another client already blocked");
+    }
+
+    /* Block client. We use this function as both a reply and optional timeout
+     * callback and differentiate the different code flows above.
+     */
+    blocked_client = RedisModule_BlockClient(ctx, Block_RedisCommand,
+            timeout > 0 ? Block_RedisCommand : NULL, NULL, timeout);
+    return REDISMODULE_OK;
+}
+
+/* BLOCK.IS_BLOCKED -- Returns 1 if we have a blocked client, or 0 otherwise.
+ */
+int IsBlocked_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    RedisModule_ReplyWithLongLong(ctx, blocked_client ? 1 : 0);
+    return REDISMODULE_OK;
+}
+
+/* BLOCK.RELEASE [reply] -- Releases the blocked client and produce the specified reply.
+ */
+int Release_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    if (!blocked_client) {
+        return RedisModule_ReplyWithError(ctx, "ERR No blocked client");
+    }
+
+    RedisModuleString *replystr = argv[1];
+    RedisModule_RetainString(ctx, replystr);
+    int err = RedisModule_UnblockClient(blocked_client, replystr);
+    blocked_client = NULL;
+
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+
+    if (RedisModule_Init(ctx,"block",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"block.debug",
+        HelloBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"block.double_debug",
+        HelloDoubleBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"block.debug_no_track",
+        HelloBlockNoTracking_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "block.block",
+        Block_RedisCommand, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"block.is_blocked",
+        IsBlocked_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"block.release",
+        Release_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/blockonkeys.c b/redis-stable/tests/modules/blockonkeys.c
new file mode 100644
index 00000000..b7ab977e
--- /dev/null
+++ b/redis-stable/tests/modules/blockonkeys.c
@@ -0,0 +1,505 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+#include <string.h>
+#include <strings.h>
+#include <assert.h>
+#include <unistd.h>
+
+#define LIST_SIZE 1024
+
+typedef struct {
+    long long list[LIST_SIZE];
+    long long length;
+} fsl_t; /* Fixed-size list */
+
+static RedisModuleType *fsltype = NULL;
+
+fsl_t *fsl_type_create() {
+    fsl_t *o;
+    o = RedisModule_Alloc(sizeof(*o));
+    o->length = 0;
+    return o;
+}
+
+void fsl_type_free(fsl_t *o) {
+    RedisModule_Free(o);
+}
+
+/* ========================== "fsltype" type methods ======================= */
+
+void *fsl_rdb_load(RedisModuleIO *rdb, int encver) {
+    if (encver != 0) {
+        return NULL;
+    }
+    fsl_t *fsl = fsl_type_create();
+    fsl->length = RedisModule_LoadUnsigned(rdb);
+    for (long long i = 0; i < fsl->length; i++)
+        fsl->list[i] = RedisModule_LoadSigned(rdb);
+    return fsl;
+}
+
+void fsl_rdb_save(RedisModuleIO *rdb, void *value) {
+    fsl_t *fsl = value;
+    RedisModule_SaveUnsigned(rdb,fsl->length);
+    for (long long i = 0; i < fsl->length; i++)
+        RedisModule_SaveSigned(rdb, fsl->list[i]);
+}
+
+void fsl_aofrw(RedisModuleIO *aof, RedisModuleString *key, void *value) {
+    fsl_t *fsl = value;
+    for (long long i = 0; i < fsl->length; i++)
+        RedisModule_EmitAOF(aof, "FSL.PUSH","sl", key, fsl->list[i]);
+}
+
+void fsl_free(void *value) {
+    fsl_type_free(value);
+}
+
+/* ========================== helper methods ======================= */
+
+int get_fsl(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode, int create, fsl_t **fsl, int reply_on_failure) {
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, keyname, mode);
+
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY && RedisModule_ModuleTypeGetType(key) != fsltype) {
+        RedisModule_CloseKey(key);
+        if (reply_on_failure)
+            RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
+        RedisModuleCallReply *reply = RedisModule_Call(ctx, "INCR", "c", "fsl_wrong_type");
+        RedisModule_FreeCallReply(reply);
+        return 0;
+    }
+
+    /* Create an empty value object if the key is currently empty. */
+    if (type == REDISMODULE_KEYTYPE_EMPTY) {
+        if (!create) {
+            /* Key is empty but we cannot create */
+            RedisModule_CloseKey(key);
+            *fsl = NULL;
+            return 1;
+        }
+        *fsl = fsl_type_create();
+        RedisModule_ModuleTypeSetValue(key, fsltype, *fsl);
+    } else {
+        *fsl = RedisModule_ModuleTypeGetValue(key);
+    }
+
+    RedisModule_CloseKey(key);
+    return 1;
+}
+
+/* ========================== commands ======================= */
+
+/* FSL.PUSH <key> <int> - Push an integer to the fixed-size list (to the right).
+ * It must be greater than the element in the head of the list. */
+int fsl_push(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3)
+        return RedisModule_WrongArity(ctx);
+
+    long long ele;
+    if (RedisModule_StringToLongLong(argv[2],&ele) != REDISMODULE_OK)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid integer");
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, argv[1], REDISMODULE_WRITE, 1, &fsl, 1))
+        return REDISMODULE_OK;
+
+    if (fsl->length == LIST_SIZE)
+        return RedisModule_ReplyWithError(ctx,"ERR list is full");
+
+    if (fsl->length != 0 && fsl->list[fsl->length-1] >= ele)
+        return RedisModule_ReplyWithError(ctx,"ERR new element has to be greater than the head element");
+
+    fsl->list[fsl->length++] = ele;
+    RedisModule_SignalKeyAsReady(ctx, argv[1]);
+
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+int bpop_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, keyname, REDISMODULE_READ, 0, &fsl, 0) || !fsl)
+        return REDISMODULE_ERR;
+
+    RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
+    return REDISMODULE_OK;
+}
+
+int bpop_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
+}
+
+/* FSL.BPOP <key> <timeout> - Block clients until list has two or more elements.
+ * When that happens, unblock client and pop the last two elements (from the right). */
+int fsl_bpop(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3)
+        return RedisModule_WrongArity(ctx);
+
+    long long timeout;
+    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK || timeout < 0)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
+        return REDISMODULE_OK;
+
+    if (!fsl) {
+        RedisModule_BlockClientOnKeys(ctx, bpop_reply_callback, bpop_timeout_callback,
+                                      NULL, timeout, &argv[1], 1, NULL);
+    } else {
+        RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
+    }
+
+    return REDISMODULE_OK;
+}
+
+int bpopgt_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
+    long long *pgt = RedisModule_GetBlockedClientPrivateData(ctx);
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, keyname, REDISMODULE_READ, 0, &fsl, 0) || !fsl)
+        return REDISMODULE_ERR;
+
+    if (fsl->list[fsl->length-1] <= *pgt)
+        return REDISMODULE_ERR;
+
+    RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
+    return REDISMODULE_OK;
+}
+
+int bpopgt_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
+}
+
+void bpopgt_free_privdata(RedisModuleCtx *ctx, void *privdata) {
+    REDISMODULE_NOT_USED(ctx);
+    RedisModule_Free(privdata);
+}
+
+/* FSL.BPOPGT <key> <gt> <timeout> - Block clients until list has an element greater than <gt>.
+ * When that happens, unblock client and pop the last element (from the right). */
+int fsl_bpopgt(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4)
+        return RedisModule_WrongArity(ctx);
+
+    long long gt;
+    if (RedisModule_StringToLongLong(argv[2],&gt) != REDISMODULE_OK)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid integer");
+
+    long long timeout;
+    if (RedisModule_StringToLongLong(argv[3],&timeout) != REDISMODULE_OK || timeout < 0)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
+        return REDISMODULE_OK;
+
+    if (!fsl || fsl->list[fsl->length-1] <= gt) {
+        /* We use malloc so the tests in blockedonkeys.tcl can check for memory leaks */
+        long long *pgt = RedisModule_Alloc(sizeof(long long));
+        *pgt = gt;
+        RedisModule_BlockClientOnKeys(ctx, bpopgt_reply_callback, bpopgt_timeout_callback,
+                                      bpopgt_free_privdata, timeout, &argv[1], 1, pgt);
+    } else {
+        RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
+    }
+
+    return REDISMODULE_OK;
+}
+
+int bpoppush_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleString *src_keyname = RedisModule_GetBlockedClientReadyKey(ctx);
+    RedisModuleString *dst_keyname = RedisModule_GetBlockedClientPrivateData(ctx);
+
+    fsl_t *src;
+    if (!get_fsl(ctx, src_keyname, REDISMODULE_READ, 0, &src, 0) || !src)
+        return REDISMODULE_ERR;
+
+    fsl_t *dst;
+    if (!get_fsl(ctx, dst_keyname, REDISMODULE_WRITE, 1, &dst, 0) || !dst)
+        return REDISMODULE_ERR;
+
+    long long ele = src->list[--src->length];
+    dst->list[dst->length++] = ele;
+    RedisModule_SignalKeyAsReady(ctx, dst_keyname);
+    return RedisModule_ReplyWithLongLong(ctx, ele);
+}
+
+int bpoppush_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
+}
+
+void bpoppush_free_privdata(RedisModuleCtx *ctx, void *privdata) {
+    RedisModule_FreeString(ctx, privdata);
+}
+
+/* FSL.BPOPPUSH <src> <dst> <timeout> - Block clients until <src> has an element.
+ * When that happens, unblock client, pop the last element from <src> and push it to <dst>
+ * (from the right). */
+int fsl_bpoppush(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4)
+        return RedisModule_WrongArity(ctx);
+
+    long long timeout;
+    if (RedisModule_StringToLongLong(argv[3],&timeout) != REDISMODULE_OK || timeout < 0)
+        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
+
+    fsl_t *src;
+    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &src, 1))
+        return REDISMODULE_OK;
+
+    if (!src) {
+        /* Retain string for reply callback */
+        RedisModule_RetainString(ctx, argv[2]);
+        /* Key is empty, we must block */
+        RedisModule_BlockClientOnKeys(ctx, bpoppush_reply_callback, bpoppush_timeout_callback,
+                                      bpoppush_free_privdata, timeout, &argv[1], 1, argv[2]);
+    } else {
+        fsl_t *dst;
+        if (!get_fsl(ctx, argv[2], REDISMODULE_WRITE, 1, &dst, 1))
+            return REDISMODULE_OK;
+        long long ele = src->list[--src->length];
+        dst->list[dst->length++] = ele;
+        RedisModule_SignalKeyAsReady(ctx, argv[2]);
+        RedisModule_ReplyWithLongLong(ctx, ele);
+    }
+
+    return REDISMODULE_OK;
+}
+
+/* FSL.GETALL <key> - Reply with an array containing all elements. */
+int fsl_getall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    fsl_t *fsl;
+    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
+        return REDISMODULE_OK;
+
+    if (!fsl)
+        return RedisModule_ReplyWithArray(ctx, 0);
+
+    RedisModule_ReplyWithArray(ctx, fsl->length);
+    for (int i = 0; i < fsl->length; i++)
+        RedisModule_ReplyWithLongLong(ctx, fsl->list[i]);
+    return REDISMODULE_OK;
+}
+
+/* Callback for blockonkeys_popall */
+int blockonkeys_popall_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST) {
+        RedisModuleString *elem;
+        long len = 0;
+        RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
+        while ((elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD)) != NULL) {
+            len++;
+            RedisModule_ReplyWithString(ctx, elem);
+            RedisModule_FreeString(ctx, elem);
+        }
+        RedisModule_ReplySetArrayLength(ctx, len);
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR Not a list");
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int blockonkeys_popall_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithError(ctx, "ERR Timeout");
+}
+
+/* BLOCKONKEYS.POPALL key
+ *
+ * Blocks on an empty key for up to 3 seconds. When unblocked by a list
+ * operation like LPUSH, all the elements are popped and returned. Fails with an
+ * error on timeout. */
+int blockonkeys_popall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
+    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_EMPTY) {
+        RedisModule_BlockClientOnKeys(ctx, blockonkeys_popall_reply_callback,
+                                      blockonkeys_popall_timeout_callback,
+                                      NULL, 3000, &argv[1], 1, NULL);
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR Key not empty");
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/* BLOCKONKEYS.LPUSH key val [val ..]
+ * BLOCKONKEYS.LPUSH_UNBLOCK key val [val ..]
+ *
+ * A module equivalent of LPUSH. If the name LPUSH_UNBLOCK is used,
+ * RM_SignalKeyAsReady() is also called. */
+int blockonkeys_lpush(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc < 3)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_LIST) {
+        RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
+    } else {
+        for (int i = 2; i < argc; i++) {
+            if (RedisModule_ListPush(key, REDISMODULE_LIST_HEAD,
+                                     argv[i]) != REDISMODULE_OK) {
+                RedisModule_CloseKey(key);
+                return RedisModule_ReplyWithError(ctx, "ERR Push failed");
+            }
+        }
+    }
+    RedisModule_CloseKey(key);
+
+    /* signal key as ready if the command is lpush_unblock */
+    size_t len;
+    const char *str = RedisModule_StringPtrLen(argv[0], &len);
+    if (!strncasecmp(str, "blockonkeys.lpush_unblock", len)) {
+        RedisModule_SignalKeyAsReady(ctx, argv[1]);
+    }
+    return RedisModule_ReplyWithSimpleString(ctx, "OK");
+}
+
+/* Callback for the BLOCKONKEYS.BLPOPN command */
+int blockonkeys_blpopn_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argc);
+    long long n;
+    RedisModule_StringToLongLong(argv[2], &n);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    int result;
+    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST &&
+        RedisModule_ValueLength(key) >= (size_t)n) {
+        RedisModule_ReplyWithArray(ctx, n);
+        for (long i = 0; i < n; i++) {
+            RedisModuleString *elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD);
+            RedisModule_ReplyWithString(ctx, elem);
+            RedisModule_FreeString(ctx, elem);
+        }
+        result = REDISMODULE_OK;
+    } else if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST ||
+               RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_EMPTY) {
+        /* continue blocking */
+        result = REDISMODULE_ERR;
+    } else {
+        result = RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+    RedisModule_CloseKey(key);
+    return result;
+}
+
+int blockonkeys_blpopn_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    return RedisModule_ReplyWithError(ctx, "ERR Timeout");
+}
+
+/* BLOCKONKEYS.BLPOPN key N
+ *
+ * Blocks until key has N elements and then pops them or fails after 3 seconds.
+ */
+int blockonkeys_blpopn(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc < 3) return RedisModule_WrongArity(ctx);
+
+    long long n;
+    if (RedisModule_StringToLongLong(argv[2], &n) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx, "ERR Invalid N");
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    int keytype = RedisModule_KeyType(key);
+    if (keytype != REDISMODULE_KEYTYPE_EMPTY &&
+        keytype != REDISMODULE_KEYTYPE_LIST) {
+        RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
+    } else if (keytype == REDISMODULE_KEYTYPE_LIST &&
+               RedisModule_ValueLength(key) >= (size_t)n) {
+        RedisModule_ReplyWithArray(ctx, n);
+        for (long i = 0; i < n; i++) {
+            RedisModuleString *elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD);
+            RedisModule_ReplyWithString(ctx, elem);
+            RedisModule_FreeString(ctx, elem);
+        }
+    } else {
+        RedisModule_BlockClientOnKeys(ctx, blockonkeys_blpopn_reply_callback,
+                                      blockonkeys_blpopn_timeout_callback,
+                                      NULL, 3000, &argv[1], 1, NULL);
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx, "blockonkeys", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModuleTypeMethods tm = {
+        .version = REDISMODULE_TYPE_METHOD_VERSION,
+        .rdb_load = fsl_rdb_load,
+        .rdb_save = fsl_rdb_save,
+        .aof_rewrite = fsl_aofrw,
+        .mem_usage = NULL,
+        .free = fsl_free,
+        .digest = NULL
+    };
+
+    fsltype = RedisModule_CreateDataType(ctx, "fsltype_t", 0, &tm);
+    if (fsltype == NULL)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fsl.push",fsl_push,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fsl.bpop",fsl_bpop,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fsl.bpopgt",fsl_bpopgt,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fsl.bpoppush",fsl_bpoppush,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fsl.getall",fsl_getall,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "blockonkeys.popall", blockonkeys_popall,
+                                  "", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "blockonkeys.lpush", blockonkeys_lpush,
+                                  "", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "blockonkeys.lpush_unblock", blockonkeys_lpush,
+                                  "", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "blockonkeys.blpopn", blockonkeys_blpopn,
+                                  "", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/commandfilter.c b/redis-stable/tests/modules/commandfilter.c
new file mode 100644
index 00000000..571ed170
--- /dev/null
+++ b/redis-stable/tests/modules/commandfilter.c
@@ -0,0 +1,154 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+#include <string.h>
+
+static RedisModuleString *log_key_name;
+
+static const char log_command_name[] = "commandfilter.log";
+static const char ping_command_name[] = "commandfilter.ping";
+static const char unregister_command_name[] = "commandfilter.unregister";
+static int in_log_command = 0;
+
+static RedisModuleCommandFilter *filter = NULL;
+
+int CommandFilter_UnregisterCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    (void) argc;
+    (void) argv;
+
+    RedisModule_ReplyWithLongLong(ctx,
+            RedisModule_UnregisterCommandFilter(ctx, filter));
+
+    return REDISMODULE_OK;
+}
+
+int CommandFilter_PingCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    (void) argc;
+    (void) argv;
+
+    RedisModuleCallReply *reply = RedisModule_Call(ctx, "ping", "c", "@log");
+    if (reply) {
+        RedisModule_ReplyWithCallReply(ctx, reply);
+        RedisModule_FreeCallReply(reply);
+    } else {
+        RedisModule_ReplyWithSimpleString(ctx, "Unknown command or invalid arguments");
+    }
+
+    return REDISMODULE_OK;
+}
+
+int CommandFilter_LogCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    RedisModuleString *s = RedisModule_CreateString(ctx, "", 0);
+
+    int i;
+    for (i = 1; i < argc; i++) {
+        size_t arglen;
+        const char *arg = RedisModule_StringPtrLen(argv[i], &arglen);
+
+        if (i > 1) RedisModule_StringAppendBuffer(ctx, s, " ", 1);
+        RedisModule_StringAppendBuffer(ctx, s, arg, arglen);
+    }
+
+    RedisModuleKey *log = RedisModule_OpenKey(ctx, log_key_name, REDISMODULE_WRITE|REDISMODULE_READ);
+    RedisModule_ListPush(log, REDISMODULE_LIST_HEAD, s);
+    RedisModule_CloseKey(log);
+    RedisModule_FreeString(ctx, s);
+
+    in_log_command = 1;
+
+    size_t cmdlen;
+    const char *cmdname = RedisModule_StringPtrLen(argv[1], &cmdlen);
+    RedisModuleCallReply *reply = RedisModule_Call(ctx, cmdname, "v", &argv[2], argc - 2);
+    if (reply) {
+        RedisModule_ReplyWithCallReply(ctx, reply);
+        RedisModule_FreeCallReply(reply);
+    } else {
+        RedisModule_ReplyWithSimpleString(ctx, "Unknown command or invalid arguments");
+    }
+
+    in_log_command = 0;
+
+    return REDISMODULE_OK;
+}
+
+void CommandFilter_CommandFilter(RedisModuleCommandFilterCtx *filter)
+{
+    if (in_log_command) return;  /* don't process our own RM_Call() from CommandFilter_LogCommand() */
+
+    /* Fun manipulations:
+     * - Remove @delme
+     * - Replace @replaceme
+     * - Append @insertbefore or @insertafter
+     * - Prefix with Log command if @log encounterd
+     */
+    int log = 0;
+    int pos = 0;
+    while (pos < RedisModule_CommandFilterArgsCount(filter)) {
+        const RedisModuleString *arg = RedisModule_CommandFilterArgGet(filter, pos);
+        size_t arg_len;
+        const char *arg_str = RedisModule_StringPtrLen(arg, &arg_len);
+
+        if (arg_len == 6 && !memcmp(arg_str, "@delme", 6)) {
+            RedisModule_CommandFilterArgDelete(filter, pos);
+            continue;
+        } 
+        if (arg_len == 10 && !memcmp(arg_str, "@replaceme", 10)) {
+            RedisModule_CommandFilterArgReplace(filter, pos,
+                    RedisModule_CreateString(NULL, "--replaced--", 12));
+        } else if (arg_len == 13 && !memcmp(arg_str, "@insertbefore", 13)) {
+            RedisModule_CommandFilterArgInsert(filter, pos,
+                    RedisModule_CreateString(NULL, "--inserted-before--", 19));
+            pos++;
+        } else if (arg_len == 12 && !memcmp(arg_str, "@insertafter", 12)) {
+            RedisModule_CommandFilterArgInsert(filter, pos + 1,
+                    RedisModule_CreateString(NULL, "--inserted-after--", 18));
+            pos++;
+        } else if (arg_len == 4 && !memcmp(arg_str, "@log", 4)) {
+            log = 1;
+        }
+        pos++;
+    }
+
+    if (log) RedisModule_CommandFilterArgInsert(filter, 0,
+            RedisModule_CreateString(NULL, log_command_name, sizeof(log_command_name)-1));
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (RedisModule_Init(ctx,"commandfilter",1,REDISMODULE_APIVER_1)
+            == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (argc != 2) {
+        RedisModule_Log(ctx, "warning", "Log key name not specified");
+        return REDISMODULE_ERR;
+    }
+
+    long long noself = 0;
+    log_key_name = RedisModule_CreateStringFromString(ctx, argv[0]);
+    RedisModule_StringToLongLong(argv[1], &noself);
+
+    if (RedisModule_CreateCommand(ctx,log_command_name,
+                CommandFilter_LogCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,ping_command_name,
+                CommandFilter_PingCommand,"deny-oom",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,unregister_command_name,
+                CommandFilter_UnregisterCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if ((filter = RedisModule_RegisterCommandFilter(ctx, CommandFilter_CommandFilter, 
+                    noself ? REDISMODULE_CMDFILTER_NOSELF : 0))
+            == NULL) return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnUnload(RedisModuleCtx *ctx) {
+    RedisModule_FreeString(ctx, log_key_name);
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/datatype.c b/redis-stable/tests/modules/datatype.c
new file mode 100644
index 00000000..0c6f9555
--- /dev/null
+++ b/redis-stable/tests/modules/datatype.c
@@ -0,0 +1,217 @@
+/* This module current tests a small subset but should be extended in the future
+ * for general ModuleDataType coverage.
+ */
+
+#include "redismodule.h"
+
+static RedisModuleType *datatype = NULL;
+
+typedef struct {
+    long long intval;
+    RedisModuleString *strval;
+} DataType;
+
+static void *datatype_load(RedisModuleIO *io, int encver) {
+    (void) encver;
+
+    int intval = RedisModule_LoadSigned(io);
+    if (RedisModule_IsIOError(io)) return NULL;
+
+    RedisModuleString *strval = RedisModule_LoadString(io);
+    if (RedisModule_IsIOError(io)) return NULL;
+
+    DataType *dt = (DataType *) RedisModule_Alloc(sizeof(DataType));
+    dt->intval = intval;
+    dt->strval = strval;
+    return dt;
+}
+
+static void datatype_save(RedisModuleIO *io, void *value) {
+    DataType *dt = (DataType *) value;
+    RedisModule_SaveSigned(io, dt->intval);
+    RedisModule_SaveString(io, dt->strval);
+}
+
+static void datatype_free(void *value) {
+    if (value) {
+        DataType *dt = (DataType *) value;
+
+        if (dt->strval) RedisModule_FreeString(NULL, dt->strval);
+        RedisModule_Free(dt);
+    }
+}
+
+static void *datatype_copy(RedisModuleString *fromkey, RedisModuleString *tokey, const void *value) {
+    const DataType *old = value;
+
+    /* Answers to ultimate questions cannot be copied! */
+    if (old->intval == 42)
+        return NULL;
+
+    DataType *new = (DataType *) RedisModule_Alloc(sizeof(DataType));
+
+    new->intval = old->intval;
+    new->strval = RedisModule_CreateStringFromString(NULL, old->strval);
+
+    /* Breaking the rules here! We return a copy that also includes traces
+     * of fromkey/tokey to confirm we get what we expect.
+     */
+    size_t len;
+    const char *str = RedisModule_StringPtrLen(fromkey, &len);
+    RedisModule_StringAppendBuffer(NULL, new->strval, "/", 1);
+    RedisModule_StringAppendBuffer(NULL, new->strval, str, len);
+    RedisModule_StringAppendBuffer(NULL, new->strval, "/", 1);
+    str = RedisModule_StringPtrLen(tokey, &len);
+    RedisModule_StringAppendBuffer(NULL, new->strval, str, len);
+
+    return new;
+}
+
+static int datatype_set(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    long long intval;
+
+    if (RedisModule_StringToLongLong(argv[2], &intval) != REDISMODULE_OK) {
+        RedisModule_ReplyWithError(ctx, "Invalid integr value");
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    DataType *dt = RedisModule_Calloc(sizeof(DataType), 1);
+    dt->intval = intval;
+    dt->strval = argv[3];
+    RedisModule_RetainString(ctx, dt->strval);
+
+    RedisModule_ModuleTypeSetValue(key, datatype, dt);
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+
+    return REDISMODULE_OK;
+}
+
+static int datatype_restore(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    DataType *dt = RedisModule_LoadDataTypeFromString(argv[2], datatype);
+    if (!dt) {
+        RedisModule_ReplyWithError(ctx, "Invalid data");
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    RedisModule_ModuleTypeSetValue(key, datatype, dt);
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+
+    return REDISMODULE_OK;
+}
+
+static int datatype_get(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
+    DataType *dt = RedisModule_ModuleTypeGetValue(key);
+    RedisModule_CloseKey(key);
+
+    if (!dt) {
+        RedisModule_ReplyWithNullArray(ctx);
+    } else {
+        RedisModule_ReplyWithArray(ctx, 2);
+        RedisModule_ReplyWithLongLong(ctx, dt->intval);
+        RedisModule_ReplyWithString(ctx, dt->strval);
+    }
+    return REDISMODULE_OK;
+}
+
+static int datatype_dump(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
+    DataType *dt = RedisModule_ModuleTypeGetValue(key);
+    RedisModule_CloseKey(key);
+
+    RedisModuleString *reply = RedisModule_SaveDataTypeToString(ctx, dt, datatype);
+    if (!reply) {
+        RedisModule_ReplyWithError(ctx, "Failed to save");
+        return REDISMODULE_OK;
+    }
+
+    RedisModule_ReplyWithString(ctx, reply);
+    RedisModule_FreeString(ctx, reply);
+    return REDISMODULE_OK;
+}
+
+static int datatype_swap(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *a = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    RedisModuleKey *b = RedisModule_OpenKey(ctx, argv[2], REDISMODULE_WRITE);
+    void *val = RedisModule_ModuleTypeGetValue(a);
+
+    int error = (RedisModule_ModuleTypeReplaceValue(b, datatype, val, &val) == REDISMODULE_ERR ||
+                 RedisModule_ModuleTypeReplaceValue(a, datatype, val, NULL) == REDISMODULE_ERR);
+    if (!error)
+        RedisModule_ReplyWithSimpleString(ctx, "OK");
+    else
+        RedisModule_ReplyWithError(ctx, "ERR failed");
+
+    RedisModule_CloseKey(a);
+    RedisModule_CloseKey(b);
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"datatype",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModule_SetModuleOptions(ctx, REDISMODULE_OPTIONS_HANDLE_IO_ERRORS);
+
+    RedisModuleTypeMethods datatype_methods = {
+        .version = REDISMODULE_TYPE_METHOD_VERSION,
+        .rdb_load = datatype_load,
+        .rdb_save = datatype_save,
+        .free = datatype_free,
+        .copy = datatype_copy
+    };
+
+    datatype = RedisModule_CreateDataType(ctx, "test___dt", 1, &datatype_methods);
+    if (datatype == NULL)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"datatype.set", datatype_set,"deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"datatype.get", datatype_get,"",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"datatype.restore", datatype_restore,"deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"datatype.dump", datatype_dump,"",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"datatype.swap", datatype_swap,"",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/defragtest.c b/redis-stable/tests/modules/defragtest.c
new file mode 100644
index 00000000..b63680c6
--- /dev/null
+++ b/redis-stable/tests/modules/defragtest.c
@@ -0,0 +1,234 @@
+/* A module that implements defrag callback mechanisms.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+static RedisModuleType *FragType;
+
+struct FragObject {
+    unsigned long len;
+    void **values;
+    int maxstep;
+};
+
+/* Make sure we get the expected cursor */
+unsigned long int last_set_cursor = 0;
+
+unsigned long int datatype_attempts = 0;
+unsigned long int datatype_defragged = 0;
+unsigned long int datatype_resumes = 0;
+unsigned long int datatype_wrong_cursor = 0;
+unsigned long int global_attempts = 0;
+unsigned long int global_defragged = 0;
+
+int global_strings_len = 0;
+RedisModuleString **global_strings = NULL;
+
+static void createGlobalStrings(RedisModuleCtx *ctx, int count)
+{
+    global_strings_len = count;
+    global_strings = RedisModule_Alloc(sizeof(RedisModuleString *) * count);
+
+    for (int i = 0; i < count; i++) {
+        global_strings[i] = RedisModule_CreateStringFromLongLong(ctx, i);
+    }
+}
+
+static int defragGlobalStrings(RedisModuleDefragCtx *ctx)
+{
+    for (int i = 0; i < global_strings_len; i++) {
+        RedisModuleString *new = RedisModule_DefragRedisModuleString(ctx, global_strings[i]);
+        global_attempts++;
+        if (new != NULL) {
+            global_strings[i] = new;
+            global_defragged++;
+        }
+    }
+
+    return 0;
+}
+
+static void FragInfo(RedisModuleInfoCtx *ctx, int for_crash_report) {
+    REDISMODULE_NOT_USED(for_crash_report);
+
+    RedisModule_InfoAddSection(ctx, "stats");
+    RedisModule_InfoAddFieldLongLong(ctx, "datatype_attempts", datatype_attempts);
+    RedisModule_InfoAddFieldLongLong(ctx, "datatype_defragged", datatype_defragged);
+    RedisModule_InfoAddFieldLongLong(ctx, "datatype_resumes", datatype_resumes);
+    RedisModule_InfoAddFieldLongLong(ctx, "datatype_wrong_cursor", datatype_wrong_cursor);
+    RedisModule_InfoAddFieldLongLong(ctx, "global_attempts", global_attempts);
+    RedisModule_InfoAddFieldLongLong(ctx, "global_defragged", global_defragged);
+}
+
+struct FragObject *createFragObject(unsigned long len, unsigned long size, int maxstep) {
+    struct FragObject *o = RedisModule_Alloc(sizeof(*o));
+    o->len = len;
+    o->values = RedisModule_Alloc(sizeof(RedisModuleString*) * len);
+    o->maxstep = maxstep;
+
+    for (unsigned long i = 0; i < len; i++) {
+        o->values[i] = RedisModule_Calloc(1, size);
+    }
+
+    return o;
+}
+
+/* FRAG.RESETSTATS */
+static int fragResetStatsCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    datatype_attempts = 0;
+    datatype_defragged = 0;
+    datatype_resumes = 0;
+    datatype_wrong_cursor = 0;
+    global_attempts = 0;
+    global_defragged = 0;
+
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+    return REDISMODULE_OK;
+}
+
+/* FRAG.CREATE key len size maxstep */
+static int fragCreateCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 5)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+                                              REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY)
+    {
+        return RedisModule_ReplyWithError(ctx, "ERR key exists");
+    }
+
+    long long len;
+    if ((RedisModule_StringToLongLong(argv[2], &len) != REDISMODULE_OK)) {
+        return RedisModule_ReplyWithError(ctx, "ERR invalid len");
+    }
+
+    long long size;
+    if ((RedisModule_StringToLongLong(argv[3], &size) != REDISMODULE_OK)) {
+        return RedisModule_ReplyWithError(ctx, "ERR invalid size");
+    }
+
+    long long maxstep;
+    if ((RedisModule_StringToLongLong(argv[4], &maxstep) != REDISMODULE_OK)) {
+        return RedisModule_ReplyWithError(ctx, "ERR invalid maxstep");
+    }
+
+    struct FragObject *o = createFragObject(len, size, maxstep);
+    RedisModule_ModuleTypeSetValue(key, FragType, o);
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+    RedisModule_CloseKey(key);
+
+    return REDISMODULE_OK;
+}
+
+void FragFree(void *value) {
+    struct FragObject *o = value;
+
+    for (unsigned long i = 0; i < o->len; i++)
+        RedisModule_Free(o->values[i]);
+    RedisModule_Free(o->values);
+    RedisModule_Free(o);
+}
+
+size_t FragFreeEffort(RedisModuleString *key, const void *value) {
+    REDISMODULE_NOT_USED(key);
+
+    const struct FragObject *o = value;
+    return o->len;
+}
+
+int FragDefrag(RedisModuleDefragCtx *ctx, RedisModuleString *key, void **value) {
+    REDISMODULE_NOT_USED(key);
+    unsigned long i = 0;
+    int steps = 0;
+
+    /* Attempt to get cursor, validate it's what we're exepcting */
+    if (RedisModule_DefragCursorGet(ctx, &i) == REDISMODULE_OK) {
+        if (i > 0) datatype_resumes++;
+
+        /* Validate we're expecting this cursor */
+        if (i != last_set_cursor) datatype_wrong_cursor++;
+    } else {
+        if (last_set_cursor != 0) datatype_wrong_cursor++;
+    }
+
+    /* Attempt to defrag the object itself */
+    datatype_attempts++;
+    struct FragObject *o = RedisModule_DefragAlloc(ctx, *value);
+    if (o == NULL) {
+        /* Not defragged */
+        o = *value;
+    } else {
+        /* Defragged */
+        *value = o;
+        datatype_defragged++;
+    }
+
+    /* Deep defrag now */
+    for (; i < o->len; i++) {
+        datatype_attempts++;
+        void *new = RedisModule_DefragAlloc(ctx, o->values[i]);
+        if (new) {
+            o->values[i] = new;
+            datatype_defragged++;
+        }
+
+        if ((o->maxstep && ++steps > o->maxstep) ||
+            ((i % 64 == 0) && RedisModule_DefragShouldStop(ctx)))
+        {
+            RedisModule_DefragCursorSet(ctx, i);
+            last_set_cursor = i;
+            return 1;
+        }
+    }
+
+    last_set_cursor = 0;
+    return 0;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx, "defragtest", 1, REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_GetTypeMethodVersion() < REDISMODULE_TYPE_METHOD_VERSION) {
+        return REDISMODULE_ERR;
+    }
+
+    long long glen;
+    if (argc != 1 || RedisModule_StringToLongLong(argv[0], &glen) == REDISMODULE_ERR) {
+        return REDISMODULE_ERR;
+    }
+
+    createGlobalStrings(ctx, glen);
+
+    RedisModuleTypeMethods tm = {
+            .version = REDISMODULE_TYPE_METHOD_VERSION,
+            .free = FragFree,
+            .free_effort = FragFreeEffort,
+            .defrag = FragDefrag
+    };
+
+    FragType = RedisModule_CreateDataType(ctx, "frag_type", 0, &tm);
+    if (FragType == NULL) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "frag.create",
+                                  fragCreateCommand, "write deny-oom", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "frag.resetstats",
+                                  fragResetStatsCommand, "write deny-oom", 1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModule_RegisterInfoFunc(ctx, FragInfo);
+    RedisModule_RegisterDefragFunc(ctx, defragGlobalStrings);
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/fork.c b/redis-stable/tests/modules/fork.c
new file mode 100644
index 00000000..50889eef
--- /dev/null
+++ b/redis-stable/tests/modules/fork.c
@@ -0,0 +1,94 @@
+#define REDISMODULE_EXPERIMENTAL_API
+
+/* define macros for having usleep */
+#define _BSD_SOURCE
+#define _DEFAULT_SOURCE
+
+#include "redismodule.h"
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+
+#define UNUSED(V) ((void) V)
+
+int child_pid = -1;
+int exitted_with_code = -1;
+
+void done_handler(int exitcode, int bysignal, void *user_data) {
+    child_pid = -1;
+    exitted_with_code = exitcode;
+    assert(user_data==(void*)0xdeadbeef);
+    UNUSED(bysignal);
+}
+
+int fork_create(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    long long code_to_exit_with;
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    if(!RMAPI_FUNC_SUPPORTED(RedisModule_Fork)){
+        RedisModule_ReplyWithError(ctx, "Fork api is not supported in the current redis version");
+        return REDISMODULE_OK;
+    }
+
+    RedisModule_StringToLongLong(argv[1], &code_to_exit_with);
+    exitted_with_code = -1;
+    child_pid = RedisModule_Fork(done_handler, (void*)0xdeadbeef);
+    if (child_pid < 0) {
+        RedisModule_ReplyWithError(ctx, "Fork failed");
+        return REDISMODULE_OK;
+    } else if (child_pid > 0) {
+        /* parent */
+        RedisModule_ReplyWithLongLong(ctx, child_pid);
+        return REDISMODULE_OK;
+    }
+
+    /* child */
+    RedisModule_Log(ctx, "notice", "fork child started");
+    usleep(500000);
+    RedisModule_Log(ctx, "notice", "fork child exiting");
+    RedisModule_ExitFromChild(code_to_exit_with);
+    /* unreachable */
+    return 0;
+}
+
+int fork_exitcode(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    UNUSED(argv);
+    UNUSED(argc);
+    RedisModule_ReplyWithLongLong(ctx, exitted_with_code);
+    return REDISMODULE_OK;
+}
+
+int fork_kill(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    UNUSED(argv);
+    UNUSED(argc);
+    if (RedisModule_KillForkChild(child_pid) != REDISMODULE_OK)
+        RedisModule_ReplyWithError(ctx, "KillForkChild failed");
+    else
+        RedisModule_ReplyWithLongLong(ctx, 1);
+    child_pid = -1;
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    if (RedisModule_Init(ctx,"fork",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fork.create", fork_create,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fork.exitcode", fork_exitcode,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"fork.kill", fork_kill,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/getkeys.c b/redis-stable/tests/modules/getkeys.c
new file mode 100644
index 00000000..70605417
--- /dev/null
+++ b/redis-stable/tests/modules/getkeys.c
@@ -0,0 +1,122 @@
+#define REDISMODULE_EXPERIMENTAL_API
+
+#include "redismodule.h"
+#include <strings.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+
+#define UNUSED(V) ((void) V)
+
+/* A sample movable keys command that returns a list of all
+ * arguments that follow a KEY argument, i.e.
+ */
+int getkeys_command(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    int i;
+    int count = 0;
+
+    /* Handle getkeys-api introspection */
+    if (RedisModule_IsKeysPositionRequest(ctx)) {
+        for (i = 0; i < argc; i++) {
+            size_t len;
+            const char *str = RedisModule_StringPtrLen(argv[i], &len);
+
+            if (len == 3 && !strncasecmp(str, "key", 3) && i + 1 < argc)
+                RedisModule_KeyAtPos(ctx, i + 1);
+        }
+
+        return REDISMODULE_OK;
+    }
+
+    /* Handle real command invocation */
+    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
+    for (i = 0; i < argc; i++) {
+        size_t len;
+        const char *str = RedisModule_StringPtrLen(argv[i], &len);
+
+        if (len == 3 && !strncasecmp(str, "key", 3) && i + 1 < argc) {
+            RedisModule_ReplyWithString(ctx, argv[i+1]);
+            count++;
+        }
+    }
+    RedisModule_ReplySetArrayLength(ctx, count);
+
+    return REDISMODULE_OK;
+}
+
+int getkeys_fixed(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    int i;
+
+    RedisModule_ReplyWithArray(ctx, argc - 1);
+    for (i = 1; i < argc; i++) {
+        RedisModule_ReplyWithString(ctx, argv[i]);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Introspect a command using RM_GetCommandKeys() and returns the list
+ * of keys. Essentially this is COMMAND GETKEYS implemented in a module.
+ */
+int getkeys_introspect(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    UNUSED(argv);
+    UNUSED(argc);
+
+    if (argc < 3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    int num_keys;
+    int *keyidx = RedisModule_GetCommandKeys(ctx, &argv[1], argc - 1, &num_keys);
+
+    if (!keyidx) {
+        if (!errno)
+            RedisModule_ReplyWithEmptyArray(ctx);
+        else {
+            char err[100];
+            switch (errno) {
+                case ENOENT:
+                    RedisModule_ReplyWithError(ctx, "ERR ENOENT");
+                    break;
+                case EINVAL:
+                    RedisModule_ReplyWithError(ctx, "ERR EINVAL");
+                    break;
+                default:
+                    snprintf(err, sizeof(err) - 1, "ERR errno=%d", errno);
+                    RedisModule_ReplyWithError(ctx, err);
+                    break;
+            }
+        }
+    } else {
+        int i;
+
+        RedisModule_ReplyWithArray(ctx, num_keys);
+        for (i = 0; i < num_keys; i++)
+            RedisModule_ReplyWithString(ctx, argv[1 + keyidx[i]]);
+
+        RedisModule_Free(keyidx);
+    }
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    if (RedisModule_Init(ctx,"getkeys",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"getkeys.command", getkeys_command,"getkeys-api",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"getkeys.fixed", getkeys_fixed,"",2,4,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"getkeys.introspect", getkeys_introspect,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/hash.c b/redis-stable/tests/modules/hash.c
new file mode 100644
index 00000000..05ab0380
--- /dev/null
+++ b/redis-stable/tests/modules/hash.c
@@ -0,0 +1,90 @@
+#include "redismodule.h"
+#include <strings.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* If a string is ":deleted:", the special value for deleted hash fields is
+ * returned; otherwise the input string is returned. */
+static RedisModuleString *value_or_delete(RedisModuleString *s) {
+    if (!strcasecmp(RedisModule_StringPtrLen(s, NULL), ":delete:"))
+        return REDISMODULE_HASH_DELETE;
+    else
+        return s;
+}
+
+/* HASH.SET key flags field1 value1 [field2 value2 ..]
+ *
+ * Sets 1-4 fields. Returns the same as RedisModule_HashSet().
+ * Flags is a string of "nxa" where n = NX, x = XX, a = COUNT_ALL.
+ * To delete a field, use the value ":delete:".
+ */
+int hash_set(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc < 5 || argc % 2 == 0 || argc > 11)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModule_AutoMemory(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+
+    size_t flags_len;
+    const char *flags_str = RedisModule_StringPtrLen(argv[2], &flags_len);
+    int flags = REDISMODULE_HASH_NONE;
+    for (size_t i = 0; i < flags_len; i++) {
+        switch (flags_str[i]) {
+        case 'n': flags |= REDISMODULE_HASH_NX; break;
+        case 'x': flags |= REDISMODULE_HASH_XX; break;
+        case 'a': flags |= REDISMODULE_HASH_COUNT_ALL; break;
+        }
+    }
+
+    /* Test some varargs. (In real-world, use a loop and set one at a time.) */
+    int result;
+    errno = 0;
+    if (argc == 5) {
+        result = RedisModule_HashSet(key, flags,
+                                     argv[3], value_or_delete(argv[4]),
+                                     NULL);
+    } else if (argc == 7) {
+        result = RedisModule_HashSet(key, flags,
+                                     argv[3], value_or_delete(argv[4]),
+                                     argv[5], value_or_delete(argv[6]),
+                                     NULL);
+    } else if (argc == 9) {
+        result = RedisModule_HashSet(key, flags,
+                                     argv[3], value_or_delete(argv[4]),
+                                     argv[5], value_or_delete(argv[6]),
+                                     argv[7], value_or_delete(argv[8]),
+                                     NULL);
+    } else if (argc == 11) {
+        result = RedisModule_HashSet(key, flags,
+                                     argv[3], value_or_delete(argv[4]),
+                                     argv[5], value_or_delete(argv[6]),
+                                     argv[7], value_or_delete(argv[8]),
+                                     argv[9], value_or_delete(argv[10]),
+                                     NULL);
+    } else {
+        return RedisModule_ReplyWithError(ctx, "ERR too many fields");
+    }
+
+    /* Check errno */
+    if (result == 0) {
+        if (errno == ENOTSUP)
+            return RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
+        else
+            RedisModule_Assert(errno == ENOENT);
+    }
+
+    return RedisModule_ReplyWithLongLong(ctx, result);
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx, "hash", 1, REDISMODULE_APIVER_1) ==
+        REDISMODULE_OK &&
+        RedisModule_CreateCommand(ctx, "hash.set", hash_set, "",
+                                  1, 1, 1) == REDISMODULE_OK) {
+        return REDISMODULE_OK;
+    } else {
+        return REDISMODULE_ERR;
+    }
+}
diff --git a/redis-stable/tests/modules/hooks.c b/redis-stable/tests/modules/hooks.c
new file mode 100644
index 00000000..6fb3d232
--- /dev/null
+++ b/redis-stable/tests/modules/hooks.c
@@ -0,0 +1,334 @@
+/* This module is used to test the server events hooks API.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include "redismodule.h"
+#include <stdio.h>
+#include <string.h>
+
+/* We need to store events to be able to test and see what we got, and we can't
+ * store them in the key-space since that would mess up rdb loading (duplicates)
+ * and be lost of flushdb. */
+RedisModuleDict *event_log = NULL;
+
+typedef struct EventElement {
+    long count;
+    RedisModuleString *last_val_string;
+    long last_val_int;
+} EventElement;
+
+void LogStringEvent(RedisModuleCtx *ctx, const char* keyname, const char* data) {
+    EventElement *event = RedisModule_DictGetC(event_log, (void*)keyname, strlen(keyname), NULL);
+    if (!event) {
+        event = RedisModule_Alloc(sizeof(EventElement));
+        memset(event, 0, sizeof(EventElement));
+        RedisModule_DictSetC(event_log, (void*)keyname, strlen(keyname), event);
+    }
+    if (event->last_val_string) RedisModule_FreeString(ctx, event->last_val_string);
+    event->last_val_string = RedisModule_CreateString(ctx, data, strlen(data));
+    event->count++;
+}
+
+void LogNumericEvent(RedisModuleCtx *ctx, const char* keyname, long data) {
+    REDISMODULE_NOT_USED(ctx);
+    EventElement *event = RedisModule_DictGetC(event_log, (void*)keyname, strlen(keyname), NULL);
+    if (!event) {
+        event = RedisModule_Alloc(sizeof(EventElement));
+        memset(event, 0, sizeof(EventElement));
+        RedisModule_DictSetC(event_log, (void*)keyname, strlen(keyname), event);
+    }
+    event->last_val_int = data;
+    event->count++;
+}
+
+void FreeEvent(RedisModuleCtx *ctx, EventElement *event) {
+    if (event->last_val_string)
+        RedisModule_FreeString(ctx, event->last_val_string);
+    RedisModule_Free(event);
+}
+
+int cmdEventCount(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    EventElement *event = RedisModule_DictGet(event_log, argv[1], NULL);
+    RedisModule_ReplyWithLongLong(ctx, event? event->count: 0);
+    return REDISMODULE_OK;
+}
+
+int cmdEventLast(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    EventElement *event = RedisModule_DictGet(event_log, argv[1], NULL);
+    if (event && event->last_val_string)
+        RedisModule_ReplyWithString(ctx, event->last_val_string);
+    else if (event)
+        RedisModule_ReplyWithLongLong(ctx, event->last_val_int);
+    else
+        RedisModule_ReplyWithNull(ctx);
+    return REDISMODULE_OK;
+}
+
+void clearEvents(RedisModuleCtx *ctx)
+{
+    RedisModuleString *key;
+    EventElement *event;
+    RedisModuleDictIter *iter = RedisModule_DictIteratorStart(event_log, "^", NULL);
+    while((key = RedisModule_DictNext(ctx, iter, (void**)&event)) != NULL) {
+        event->count = 0;
+        event->last_val_int = 0;
+        if (event->last_val_string) RedisModule_FreeString(ctx, event->last_val_string);
+        event->last_val_string = NULL;
+        RedisModule_DictDel(event_log, key, NULL);
+        RedisModule_Free(event);
+    }
+    RedisModule_DictIteratorStop(iter);
+}
+
+int cmdEventsClear(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argc);
+    REDISMODULE_NOT_USED(argv);
+    clearEvents(ctx);
+    return REDISMODULE_OK;
+}
+
+/* Client state change callback. */
+void clientChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleClientInfo *ci = data;
+    char *keyname = (sub == REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED) ?
+        "client-connected" : "client-disconnected";
+    LogNumericEvent(ctx, keyname, ci->id);
+}
+
+void flushdbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleFlushInfo *fi = data;
+    char *keyname = (sub == REDISMODULE_SUBEVENT_FLUSHDB_START) ?
+        "flush-start" : "flush-end";
+    LogNumericEvent(ctx, keyname, fi->dbnum);
+}
+
+void roleChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+
+    RedisModuleReplicationInfo *ri = data;
+    char *keyname = (sub == REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER) ?
+        "role-master" : "role-replica";
+    LogStringEvent(ctx, keyname, ri->masterhost);
+}
+
+void replicationChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+
+    char *keyname = (sub == REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE) ?
+        "replica-online" : "replica-offline";
+    LogNumericEvent(ctx, keyname, 0);
+}
+
+void rasterLinkChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+
+    char *keyname = (sub == REDISMODULE_SUBEVENT_MASTER_LINK_UP) ?
+        "masterlink-up" : "masterlink-down";
+    LogNumericEvent(ctx, keyname, 0);
+}
+
+void persistenceCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+
+    char *keyname = NULL;
+    switch (sub) {
+        case REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START: keyname = "persistence-rdb-start"; break;
+        case REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START: keyname = "persistence-aof-start"; break;
+        case REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START: keyname = "persistence-syncrdb-start"; break;
+        case REDISMODULE_SUBEVENT_PERSISTENCE_ENDED: keyname = "persistence-end"; break;
+        case REDISMODULE_SUBEVENT_PERSISTENCE_FAILED: keyname = "persistence-failed"; break;
+    }
+    /* modifying the keyspace from the fork child is not an option, using log instead */
+    RedisModule_Log(ctx, "warning", "module-event-%s", keyname);
+    if (sub == REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START)
+        LogNumericEvent(ctx, keyname, 0);
+}
+
+void loadingCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+
+    char *keyname = NULL;
+    switch (sub) {
+        case REDISMODULE_SUBEVENT_LOADING_RDB_START: keyname = "loading-rdb-start"; break;
+        case REDISMODULE_SUBEVENT_LOADING_AOF_START: keyname = "loading-aof-start"; break;
+        case REDISMODULE_SUBEVENT_LOADING_REPL_START: keyname = "loading-repl-start"; break;
+        case REDISMODULE_SUBEVENT_LOADING_ENDED: keyname = "loading-end"; break;
+        case REDISMODULE_SUBEVENT_LOADING_FAILED: keyname = "loading-failed"; break;
+    }
+    LogNumericEvent(ctx, keyname, 0);
+}
+
+void loadingProgressCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleLoadingProgress *ei = data;
+    char *keyname = (sub == REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB) ?
+        "loading-progress-rdb" : "loading-progress-aof";
+    LogNumericEvent(ctx, keyname, ei->progress);
+}
+
+void shutdownCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+    REDISMODULE_NOT_USED(sub);
+
+    RedisModule_Log(ctx, "warning", "module-event-%s", "shutdown");
+}
+
+void cronLoopCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(sub);
+
+    RedisModuleCronLoop *ei = data;
+    LogNumericEvent(ctx, "cron-loop", ei->hz);
+}
+
+void moduleChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+
+    RedisModuleModuleChange *ei = data;
+    char *keyname = (sub == REDISMODULE_SUBEVENT_MODULE_LOADED) ?
+        "module-loaded" : "module-unloaded";
+    LogStringEvent(ctx, keyname, ei->module_name);
+}
+
+void swapDbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(sub);
+
+    RedisModuleSwapDbInfo *ei = data;
+    LogNumericEvent(ctx, "swapdb-first", ei->dbnum_first);
+    LogNumericEvent(ctx, "swapdb-second", ei->dbnum_second);
+}
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+#define VerifySubEventSupported(e, s) \
+    if (!RedisModule_IsSubEventSupported(e, s)) { \
+        return REDISMODULE_ERR; \
+    }
+
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"testhook",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    /* Example on how to check if a server sub event is supported */
+    if (!RedisModule_IsSubEventSupported(RedisModuleEvent_ReplicationRoleChanged, REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER)) {
+        return REDISMODULE_ERR;
+    }
+
+    /* replication related hooks */
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ReplicationRoleChanged, roleChangeCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ReplicaChange, replicationChangeCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_MasterLinkChange, rasterLinkChangeCallback);
+
+    /* persistence related hooks */
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_Persistence, persistenceCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_Loading, loadingCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_LoadingProgress, loadingProgressCallback);
+
+    /* other hooks */
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ClientChange, clientChangeCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_FlushDB, flushdbCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_Shutdown, shutdownCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_CronLoop, cronLoopCallback);
+
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ModuleChange, moduleChangeCallback);
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_SwapDB, swapDbCallback);
+
+    event_log = RedisModule_CreateDict(ctx);
+
+    if (RedisModule_CreateCommand(ctx,"hooks.event_count", cmdEventCount,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"hooks.event_last", cmdEventLast,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"hooks.clear", cmdEventsClear,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnUnload(RedisModuleCtx *ctx) {
+    clearEvents(ctx);
+    RedisModule_FreeDict(ctx, event_log);
+    event_log = NULL;
+    return REDISMODULE_OK;
+}
+
diff --git a/redis-stable/tests/modules/infotest.c b/redis-stable/tests/modules/infotest.c
new file mode 100644
index 00000000..87a89dcb
--- /dev/null
+++ b/redis-stable/tests/modules/infotest.c
@@ -0,0 +1,119 @@
+#include "redismodule.h"
+
+#include <string.h>
+
+void InfoFunc(RedisModuleInfoCtx *ctx, int for_crash_report) {
+    RedisModule_InfoAddSection(ctx, "");
+    RedisModule_InfoAddFieldLongLong(ctx, "global", -2);
+    RedisModule_InfoAddFieldULongLong(ctx, "uglobal", (unsigned long long)-2);
+
+    RedisModule_InfoAddSection(ctx, "Spanish");
+    RedisModule_InfoAddFieldCString(ctx, "uno", "one");
+    RedisModule_InfoAddFieldLongLong(ctx, "dos", 2);
+
+    RedisModule_InfoAddSection(ctx, "Italian");
+    RedisModule_InfoAddFieldLongLong(ctx, "due", 2);
+    RedisModule_InfoAddFieldDouble(ctx, "tre", 3.3);
+
+    RedisModule_InfoAddSection(ctx, "keyspace");
+    RedisModule_InfoBeginDictField(ctx, "db0");
+    RedisModule_InfoAddFieldLongLong(ctx, "keys", 3);
+    RedisModule_InfoAddFieldLongLong(ctx, "expires", 1);
+    RedisModule_InfoEndDictField(ctx);
+
+    RedisModule_InfoAddSection(ctx, "unsafe");
+    RedisModule_InfoBeginDictField(ctx, "unsafe:field");
+    RedisModule_InfoAddFieldLongLong(ctx, "value", 1);
+    RedisModule_InfoEndDictField(ctx);
+
+    if (for_crash_report) {
+        RedisModule_InfoAddSection(ctx, "Klingon");
+        RedisModule_InfoAddFieldCString(ctx, "one", "wa’");
+        RedisModule_InfoAddFieldCString(ctx, "two", "cha’");
+        RedisModule_InfoAddFieldCString(ctx, "three", "wej");
+    }
+
+}
+
+int info_get(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, char field_type)
+{
+    if (argc != 3 && argc != 4) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    int err = REDISMODULE_OK;
+    const char *section, *field;
+    section = RedisModule_StringPtrLen(argv[1], NULL);
+    field = RedisModule_StringPtrLen(argv[2], NULL);
+    RedisModuleServerInfoData *info = RedisModule_GetServerInfo(ctx, section);
+    if (field_type=='i') {
+        long long ll = RedisModule_ServerInfoGetFieldSigned(info, field, &err);
+        if (err==REDISMODULE_OK)
+            RedisModule_ReplyWithLongLong(ctx, ll);
+    } else if (field_type=='u') {
+        unsigned long long ll = (unsigned long long)RedisModule_ServerInfoGetFieldUnsigned(info, field, &err);
+        if (err==REDISMODULE_OK)
+            RedisModule_ReplyWithLongLong(ctx, ll);
+    } else if (field_type=='d') {
+        double d = RedisModule_ServerInfoGetFieldDouble(info, field, &err);
+        if (err==REDISMODULE_OK)
+            RedisModule_ReplyWithDouble(ctx, d);
+    } else if (field_type=='c') {
+        const char *str = RedisModule_ServerInfoGetFieldC(info, field);
+        if (str)
+            RedisModule_ReplyWithCString(ctx, str);
+    } else {
+        RedisModuleString *str = RedisModule_ServerInfoGetField(ctx, info, field);
+        if (str) {
+            RedisModule_ReplyWithString(ctx, str);
+            RedisModule_FreeString(ctx, str);
+        } else
+            err=REDISMODULE_ERR;
+    }
+    if (err!=REDISMODULE_OK)
+        RedisModule_ReplyWithError(ctx, "not found");
+    RedisModule_FreeServerInfo(ctx, info);
+    return REDISMODULE_OK;
+}
+
+int info_gets(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    return info_get(ctx, argv, argc, 's');
+}
+
+int info_getc(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    return info_get(ctx, argv, argc, 'c');
+}
+
+int info_geti(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    return info_get(ctx, argv, argc, 'i');
+}
+
+int info_getu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    return info_get(ctx, argv, argc, 'u');
+}
+
+int info_getd(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    return info_get(ctx, argv, argc, 'd');
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx,"infotest",1,REDISMODULE_APIVER_1)
+            == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_RegisterInfoFunc(ctx, InfoFunc) == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"info.gets", info_gets,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"info.getc", info_getc,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"info.geti", info_geti,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"info.getu", info_getu,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"info.getd", info_getd,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/keyspace_events.c b/redis-stable/tests/modules/keyspace_events.c
new file mode 100644
index 00000000..9305774c
--- /dev/null
+++ b/redis-stable/tests/modules/keyspace_events.c
@@ -0,0 +1,293 @@
+/* This module is used to test the server keyspace events API.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2020, Meir Shpilraien <meir at redislabs dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+
+#include "redismodule.h"
+#include <stdio.h>
+#include <string.h>
+
+/** strores all the keys on which we got 'loaded' keyspace notification **/
+RedisModuleDict *loaded_event_log = NULL;
+/** stores all the keys on which we got 'module' keyspace notification **/
+RedisModuleDict *module_event_log = NULL;
+
+static int KeySpace_NotificationLoaded(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key){
+    REDISMODULE_NOT_USED(ctx);
+    REDISMODULE_NOT_USED(type);
+
+    if(strcmp(event, "loaded") == 0){
+        const char* keyName = RedisModule_StringPtrLen(key, NULL);
+        int nokey;
+        RedisModule_DictGetC(loaded_event_log, (void*)keyName, strlen(keyName), &nokey);
+        if(nokey){
+            RedisModule_DictSetC(loaded_event_log, (void*)keyName, strlen(keyName), RedisModule_HoldString(ctx, key));
+        }
+    }
+
+    return REDISMODULE_OK;
+}
+
+static int KeySpace_NotificationGeneric(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
+    REDISMODULE_NOT_USED(type);
+
+    if (strcmp(event, "del") == 0) {
+        RedisModuleString *copykey = RedisModule_CreateStringPrintf(ctx, "%s_copy", RedisModule_StringPtrLen(key, NULL));
+        RedisModuleCallReply* rep = RedisModule_Call(ctx, "DEL", "s!", copykey);
+        RedisModule_FreeString(ctx, copykey);
+        RedisModule_FreeCallReply(rep);
+
+        int ctx_flags = RedisModule_GetContextFlags(ctx);
+        if (ctx_flags & REDISMODULE_CTX_FLAGS_LUA) {
+            RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "c", "lua");
+            RedisModule_FreeCallReply(rep);
+        }
+        if (ctx_flags & REDISMODULE_CTX_FLAGS_MULTI) {
+            RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "c", "multi");
+            RedisModule_FreeCallReply(rep);
+        }
+    }
+
+    return REDISMODULE_OK;
+}
+
+static int KeySpace_NotificationModule(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
+    REDISMODULE_NOT_USED(ctx);
+    REDISMODULE_NOT_USED(type);
+    REDISMODULE_NOT_USED(event);
+
+    const char* keyName = RedisModule_StringPtrLen(key, NULL);
+    int nokey;
+    RedisModule_DictGetC(module_event_log, (void*)keyName, strlen(keyName), &nokey);
+    if(nokey){
+        RedisModule_DictSetC(module_event_log, (void*)keyName, strlen(keyName), RedisModule_HoldString(ctx, key));
+    }
+    return REDISMODULE_OK;
+}
+
+static int cmdNotify(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
+    if(argc != 2){
+        return RedisModule_WrongArity(ctx);
+    }
+
+    RedisModule_NotifyKeyspaceEvent(ctx, REDISMODULE_NOTIFY_MODULE, "notify", argv[1]);
+    RedisModule_ReplyWithNull(ctx);
+    return REDISMODULE_OK;
+}
+
+static int cmdIsModuleKeyNotified(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
+    if(argc != 2){
+        return RedisModule_WrongArity(ctx);
+    }
+
+    const char* key  = RedisModule_StringPtrLen(argv[1], NULL);
+
+    int nokey;
+    RedisModuleString* keyStr = RedisModule_DictGetC(module_event_log, (void*)key, strlen(key), &nokey);
+
+    RedisModule_ReplyWithArray(ctx, 2);
+    RedisModule_ReplyWithLongLong(ctx, !nokey);
+    if(nokey){
+        RedisModule_ReplyWithNull(ctx);
+    }else{
+        RedisModule_ReplyWithString(ctx, keyStr);
+    }
+    return REDISMODULE_OK;
+}
+
+static int cmdIsKeyLoaded(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
+    if(argc != 2){
+        return RedisModule_WrongArity(ctx);
+    }
+
+    const char* key  = RedisModule_StringPtrLen(argv[1], NULL);
+
+    int nokey;
+    RedisModuleString* keyStr = RedisModule_DictGetC(loaded_event_log, (void*)key, strlen(key), &nokey);
+
+    RedisModule_ReplyWithArray(ctx, 2);
+    RedisModule_ReplyWithLongLong(ctx, !nokey);
+    if(nokey){
+        RedisModule_ReplyWithNull(ctx);
+    }else{
+        RedisModule_ReplyWithString(ctx, keyStr);
+    }
+    return REDISMODULE_OK;
+}
+
+static int cmdDelKeyCopy(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, "DEL", "s!", argv[1]);
+    if (!rep) {
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    } else {
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Call INCR and propagate using RM_Call with `!`. */
+static int cmdIncrCase1(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s!", argv[1]);
+    if (!rep) {
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    } else {
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+    return REDISMODULE_OK;
+}
+
+/* Call INCR and propagate using RM_Replicate. */
+static int cmdIncrCase2(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s", argv[1]);
+    if (!rep) {
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    } else {
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+    RedisModule_Replicate(ctx, "INCR", "s", argv[1]);
+    return REDISMODULE_OK;
+}
+
+/* Call INCR and propagate using RM_ReplicateVerbatim. */
+static int cmdIncrCase3(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 2)
+        return RedisModule_WrongArity(ctx);
+
+    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s", argv[1]);
+    if (!rep) {
+        RedisModule_ReplyWithError(ctx, "NULL reply returned");
+    } else {
+        RedisModule_ReplyWithCallReply(ctx, rep);
+        RedisModule_FreeCallReply(rep);
+    }
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+
+/* This function must be present on each Redis module. It is used in order to
+ * register the commands into the Redis server. */
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"testkeyspace",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+
+    loaded_event_log = RedisModule_CreateDict(ctx);
+    module_event_log = RedisModule_CreateDict(ctx);
+
+    int keySpaceAll = RedisModule_GetKeyspaceNotificationFlagsAll();
+
+    if (!(keySpaceAll & REDISMODULE_NOTIFY_LOADED)) {
+        // REDISMODULE_NOTIFY_LOADED event are not supported we can not start
+        return REDISMODULE_ERR;
+    }
+
+    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_LOADED, KeySpace_NotificationLoaded) != REDISMODULE_OK){
+        return REDISMODULE_ERR;
+    }
+
+    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_GENERIC, KeySpace_NotificationGeneric) != REDISMODULE_OK){
+        return REDISMODULE_ERR;
+    }
+
+    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_MODULE, KeySpace_NotificationModule) != REDISMODULE_OK){
+        return REDISMODULE_ERR;
+    }
+
+    if (RedisModule_CreateCommand(ctx,"keyspace.notify", cmdNotify,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+
+    if (RedisModule_CreateCommand(ctx,"keyspace.is_module_key_notified", cmdIsModuleKeyNotified,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+
+    if (RedisModule_CreateCommand(ctx,"keyspace.is_key_loaded", cmdIsKeyLoaded,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+
+    if (RedisModule_CreateCommand(ctx,"keyspace.del_key_copy", cmdDelKeyCopy,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+    
+    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case1", cmdIncrCase1,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+    
+    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case2", cmdIncrCase2,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+    
+    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case3", cmdIncrCase3,"",0,0,0) == REDISMODULE_ERR){
+        return REDISMODULE_ERR;
+    }
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnUnload(RedisModuleCtx *ctx) {
+    RedisModuleDictIter *iter = RedisModule_DictIteratorStartC(loaded_event_log, "^", NULL, 0);
+    char* key;
+    size_t keyLen;
+    RedisModuleString* val;
+    while((key = RedisModule_DictNextC(iter, &keyLen, (void**)&val))){
+        RedisModule_FreeString(ctx, val);
+    }
+    RedisModule_FreeDict(ctx, loaded_event_log);
+    RedisModule_DictIteratorStop(iter);
+    loaded_event_log = NULL;
+
+    iter = RedisModule_DictIteratorStartC(module_event_log, "^", NULL, 0);
+    while((key = RedisModule_DictNextC(iter, &keyLen, (void**)&val))){
+        RedisModule_FreeString(ctx, val);
+    }
+    RedisModule_FreeDict(ctx, module_event_log);
+    RedisModule_DictIteratorStop(iter);
+    module_event_log = NULL;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/misc.c b/redis-stable/tests/modules/misc.c
new file mode 100644
index 00000000..1c7c47a9
--- /dev/null
+++ b/redis-stable/tests/modules/misc.c
@@ -0,0 +1,327 @@
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+
+#define UNUSED(x) (void)(x)
+
+int test_call_generic(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc<2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    const char* cmdname = RedisModule_StringPtrLen(argv[1], NULL);
+    RedisModuleCallReply *reply = RedisModule_Call(ctx, cmdname, "v", argv+2, argc-2);
+    if (reply) {
+        RedisModule_ReplyWithCallReply(ctx, reply);
+        RedisModule_FreeCallReply(reply);
+    } else {
+        RedisModule_ReplyWithError(ctx, strerror(errno));
+    }
+    return REDISMODULE_OK;
+}
+
+int test_call_info(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    RedisModuleCallReply *reply;
+    if (argc>1)
+        reply = RedisModule_Call(ctx, "info", "s", argv[1]);
+    else
+        reply = RedisModule_Call(ctx, "info", "");
+    if (reply) {
+        RedisModule_ReplyWithCallReply(ctx, reply);
+        RedisModule_FreeCallReply(reply);
+    } else {
+        RedisModule_ReplyWithError(ctx, strerror(errno));
+    }
+    return REDISMODULE_OK;
+}
+
+int test_ld_conv(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    UNUSED(argv);
+    UNUSED(argc);
+    long double ld = 0.00000000000000001L;
+    const char *ldstr = "0.00000000000000001";
+    RedisModuleString *s1 = RedisModule_CreateStringFromLongDouble(ctx, ld, 1);
+    RedisModuleString *s2 =
+        RedisModule_CreateString(ctx, ldstr, strlen(ldstr));
+    if (RedisModule_StringCompare(s1, s2) != 0) {
+        char err[4096];
+        snprintf(err, 4096,
+            "Failed to convert long double to string ('%s' != '%s')",
+            RedisModule_StringPtrLen(s1, NULL),
+            RedisModule_StringPtrLen(s2, NULL));
+        RedisModule_ReplyWithError(ctx, err);
+        goto final;
+    }
+    long double ld2 = 0;
+    if (RedisModule_StringToLongDouble(s2, &ld2) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithError(ctx,
+            "Failed to convert string to long double");
+        goto final;
+    }
+    if (ld2 != ld) {
+        char err[4096];
+        snprintf(err, 4096,
+            "Failed to convert string to long double (%.40Lf != %.40Lf)",
+            ld2,
+            ld);
+        RedisModule_ReplyWithError(ctx, err);
+        goto final;
+    }
+
+    /* Make sure we can't convert a string that has \0 in it */
+    char buf[4] = "123";
+    buf[1] = '\0';
+    RedisModuleString *s3 = RedisModule_CreateString(ctx, buf, 3);
+    long double ld3;
+    if (RedisModule_StringToLongDouble(s3, &ld3) == REDISMODULE_OK) {
+        RedisModule_ReplyWithError(ctx, "Invalid string successfully converted to long double");
+        RedisModule_FreeString(ctx, s3);
+        goto final;
+    }
+    RedisModule_FreeString(ctx, s3);
+
+    RedisModule_ReplyWithLongDouble(ctx, ld2);
+final:
+    RedisModule_FreeString(ctx, s1);
+    RedisModule_FreeString(ctx, s2);
+    return REDISMODULE_OK;
+}
+
+int test_flushall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModule_ResetDataset(1, 0);
+    RedisModule_ReplyWithCString(ctx, "Ok");
+    return REDISMODULE_OK;
+}
+
+int test_dbsize(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    long long ll = RedisModule_DbSize(ctx);
+    RedisModule_ReplyWithLongLong(ctx, ll);
+    return REDISMODULE_OK;
+}
+
+int test_randomkey(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleString *str = RedisModule_RandomKey(ctx);
+    RedisModule_ReplyWithString(ctx, str);
+    RedisModule_FreeString(ctx, str);
+    return REDISMODULE_OK;
+}
+
+RedisModuleKey *open_key_or_reply(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode) {
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, keyname, mode);
+    if (!key) {
+        RedisModule_ReplyWithError(ctx, "key not found");
+        return NULL;
+    }
+    return key;
+}
+
+int test_getlru(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc<2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
+    mstime_t lru;
+    RedisModule_GetLRU(key, &lru);
+    RedisModule_ReplyWithLongLong(ctx, lru);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int test_setlru(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc<3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
+    mstime_t lru;
+    if (RedisModule_StringToLongLong(argv[2], &lru) != REDISMODULE_OK) {
+        RedisModule_ReplyWithError(ctx, "invalid idle time");
+        return REDISMODULE_OK;
+    }
+    int was_set = RedisModule_SetLRU(key, lru)==REDISMODULE_OK;
+    RedisModule_ReplyWithLongLong(ctx, was_set);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int test_getlfu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc<2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
+    mstime_t lfu;
+    RedisModule_GetLFU(key, &lfu);
+    RedisModule_ReplyWithLongLong(ctx, lfu);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int test_setlfu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc<3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
+    mstime_t lfu;
+    if (RedisModule_StringToLongLong(argv[2], &lfu) != REDISMODULE_OK) {
+        RedisModule_ReplyWithError(ctx, "invalid freq");
+        return REDISMODULE_OK;
+    }
+    int was_set = RedisModule_SetLFU(key, lfu)==REDISMODULE_OK;
+    RedisModule_ReplyWithLongLong(ctx, was_set);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int test_redisversion(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
+    (void) argv;
+    (void) argc;
+
+    int version = RedisModule_GetServerVersion();
+    int patch = version & 0x000000ff;
+    int minor = (version & 0x0000ff00) >> 8;
+    int major = (version & 0x00ff0000) >> 16;
+
+    RedisModuleString* vStr = RedisModule_CreateStringPrintf(ctx, "%d.%d.%d", major, minor, patch);
+    RedisModule_ReplyWithString(ctx, vStr);
+    RedisModule_FreeString(ctx, vStr);
+  
+    return REDISMODULE_OK;
+}
+
+int test_getclientcert(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    (void) argv;
+    (void) argc;
+
+    RedisModuleString *cert = RedisModule_GetClientCertificate(ctx,
+            RedisModule_GetClientId(ctx));
+    if (!cert) {
+        RedisModule_ReplyWithNull(ctx);
+    } else {
+        RedisModule_ReplyWithString(ctx, cert);
+        RedisModule_FreeString(ctx, cert);
+    }
+
+    return REDISMODULE_OK;
+}
+
+int test_clientinfo(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    (void) argv;
+    (void) argc;
+
+    RedisModuleClientInfo ci = { .version = REDISMODULE_CLIENTINFO_VERSION };
+
+    if (RedisModule_GetClientInfoById(&ci, RedisModule_GetClientId(ctx)) == REDISMODULE_ERR) {
+            RedisModule_ReplyWithError(ctx, "failed to get client info");
+            return REDISMODULE_OK;
+    }
+
+    RedisModule_ReplyWithArray(ctx, 10);
+    char flags[512];
+    snprintf(flags, sizeof(flags) - 1, "%s:%s:%s:%s:%s:%s",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_SSL ? "ssl" : "",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_PUBSUB ? "pubsub" : "",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_BLOCKED ? "blocked" : "",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_TRACKING ? "tracking" : "",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET ? "unixsocket" : "",
+        ci.flags & REDISMODULE_CLIENTINFO_FLAG_MULTI ? "multi" : "");
+
+    RedisModule_ReplyWithCString(ctx, "flags");
+    RedisModule_ReplyWithCString(ctx, flags);
+    RedisModule_ReplyWithCString(ctx, "id");
+    RedisModule_ReplyWithLongLong(ctx, ci.id);
+    RedisModule_ReplyWithCString(ctx, "addr");
+    RedisModule_ReplyWithCString(ctx, ci.addr);
+    RedisModule_ReplyWithCString(ctx, "port");
+    RedisModule_ReplyWithLongLong(ctx, ci.port);
+    RedisModule_ReplyWithCString(ctx, "db");
+    RedisModule_ReplyWithLongLong(ctx, ci.db);
+
+    return REDISMODULE_OK;
+}
+
+int test_log_tsctx(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    RedisModuleCtx *tsctx = RedisModule_GetDetachedThreadSafeContext(ctx);
+
+    if (argc != 3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    char level[50];
+    size_t level_len;
+    const char *level_str = RedisModule_StringPtrLen(argv[1], &level_len);
+    snprintf(level, sizeof(level) - 1, "%.*s", (int) level_len, level_str);
+
+    size_t msg_len;
+    const char *msg_str = RedisModule_StringPtrLen(argv[2], &msg_len);
+
+    RedisModule_Log(tsctx, level, "%.*s", (int) msg_len, msg_str);
+    RedisModule_FreeThreadSafeContext(tsctx);
+
+    RedisModule_ReplyWithSimpleString(ctx, "OK");
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx,"misc",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.call_generic", test_call_generic,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.call_info", test_call_info,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.ld_conversion", test_ld_conv, "",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.flushall", test_flushall,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.dbsize", test_dbsize,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.randomkey", test_randomkey,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.setlru", test_setlru,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.getlru", test_getlru,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.setlfu", test_setlfu,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.getlfu", test_getlfu,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.clientinfo", test_clientinfo,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.redisversion", test_redisversion,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.getclientcert", test_getclientcert,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.log_tsctx", test_log_tsctx,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/propagate.c b/redis-stable/tests/modules/propagate.c
new file mode 100644
index 00000000..ac04d4f9
--- /dev/null
+++ b/redis-stable/tests/modules/propagate.c
@@ -0,0 +1,256 @@
+/* This module is used to test the propagation (replication + AOF) of
+ * commands, via the RedisModule_Replicate() interface, in asynchronous
+ * contexts, such as callbacks not implementing commands, and thread safe
+ * contexts.
+ *
+ * We create a timer callback and a threads using a thread safe context.
+ * Using both we try to propagate counters increments, and later we check
+ * if the replica contains the changes as expected.
+ *
+ * -----------------------------------------------------------------------------
+ *
+ * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+#include <pthread.h>
+
+/* Timer callback. */
+void timerHandler(RedisModuleCtx *ctx, void *data) {
+    REDISMODULE_NOT_USED(ctx);
+    REDISMODULE_NOT_USED(data);
+
+    static int times = 0;
+
+    RedisModule_Replicate(ctx,"INCR","c","timer");
+    times++;
+
+    if (times < 3)
+        RedisModule_CreateTimer(ctx,100,timerHandler,NULL);
+    else
+        times = 0;
+}
+
+int propagateTestTimerCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleTimerID timer_id =
+        RedisModule_CreateTimer(ctx,100,timerHandler,NULL);
+    REDISMODULE_NOT_USED(timer_id);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+/* Timer callback. */
+void timerNestedHandler(RedisModuleCtx *ctx, void *data) {
+    int repl = (long long)data;
+
+    /* The goal is the trigger a module command that calls RM_Replicate
+     * in order to test MULTI/EXEC structre */
+    RedisModule_Replicate(ctx,"INCRBY","cc","timer-nested-start","1");
+    RedisModuleCallReply *reply = RedisModule_Call(ctx,"propagate-test.nested", repl? "!" : "");
+    RedisModule_FreeCallReply(reply);
+    RedisModule_Replicate(ctx,"INCRBY","cc","timer-nested-end","1");
+}
+
+int propagateTestTimerNestedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleTimerID timer_id =
+        RedisModule_CreateTimer(ctx,100,timerNestedHandler,(void*)0);
+    REDISMODULE_NOT_USED(timer_id);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+int propagateTestTimerNestedReplCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    RedisModuleTimerID timer_id =
+        RedisModule_CreateTimer(ctx,100,timerNestedHandler,(void*)1);
+    REDISMODULE_NOT_USED(timer_id);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+/* The thread entry point. */
+void *threadMain(void *arg) {
+    REDISMODULE_NOT_USED(arg);
+    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(NULL);
+    RedisModule_SelectDb(ctx,9); /* Tests ran in database number 9. */
+    for (int i = 0; i < 3; i++) {
+        RedisModule_ThreadSafeContextLock(ctx);
+        RedisModule_Replicate(ctx,"INCR","c","a-from-thread");
+        RedisModule_Replicate(ctx,"INCR","c","b-from-thread");
+        RedisModule_ThreadSafeContextUnlock(ctx);
+    }
+    RedisModule_FreeThreadSafeContext(ctx);
+    return NULL;
+}
+
+int propagateTestThreadCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    pthread_t tid;
+    if (pthread_create(&tid,NULL,threadMain,NULL) != 0)
+        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
+    REDISMODULE_NOT_USED(tid);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+int propagateTestSimpleCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    /* Replicate two commands to test MULTI/EXEC wrapping. */
+    RedisModule_Replicate(ctx,"INCR","c","counter-1");
+    RedisModule_Replicate(ctx,"INCR","c","counter-2");
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+int propagateTestMixedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleCallReply *reply;
+
+    /* This test mixes multiple propagation systems. */
+    reply = RedisModule_Call(ctx, "INCR", "c!", "using-call");
+    RedisModule_FreeCallReply(reply);
+
+    RedisModule_Replicate(ctx,"INCR","c","counter-1");
+    RedisModule_Replicate(ctx,"INCR","c","counter-2");
+
+    reply = RedisModule_Call(ctx, "INCR", "c!", "after-call");
+    RedisModule_FreeCallReply(reply);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+int propagateTestNestedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleCallReply *reply;
+
+    /* This test mixes multiple propagation systems. */
+    reply = RedisModule_Call(ctx, "INCR", "c!", "using-call");
+    RedisModule_FreeCallReply(reply);
+
+    reply = RedisModule_Call(ctx,"propagate-test.simple", "!");
+    RedisModule_FreeCallReply(reply);
+
+    RedisModule_Replicate(ctx,"INCR","c","counter-3");
+    RedisModule_Replicate(ctx,"INCR","c","counter-4");
+
+    reply = RedisModule_Call(ctx, "INCR", "c!", "after-call");
+    RedisModule_FreeCallReply(reply);
+
+    RedisModule_ReplyWithSimpleString(ctx,"OK");
+    return REDISMODULE_OK;
+}
+
+int propagateTestIncr(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argc);
+    RedisModuleCallReply *reply;
+
+    /* This test propagates the module command, not the INCR it executes. */
+    reply = RedisModule_Call(ctx, "INCR", "s", argv[1]);
+    RedisModule_ReplyWithCallReply(ctx,reply);
+    RedisModule_FreeCallReply(reply);
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"propagate-test",1,REDISMODULE_APIVER_1)
+            == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.timer",
+                propagateTestTimerCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.timer-nested",
+                propagateTestTimerNestedCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.timer-nested-repl",
+                propagateTestTimerNestedReplCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.thread",
+                propagateTestThreadCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.simple",
+                propagateTestSimpleCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.mixed",
+                propagateTestMixedCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.nested",
+                propagateTestNestedCommand,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"propagate-test.incr",
+                propagateTestIncr,
+                "",1,1,1) == REDISMODULE_ERR)
+            return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/scan.c b/redis-stable/tests/modules/scan.c
new file mode 100644
index 00000000..1576bae9
--- /dev/null
+++ b/redis-stable/tests/modules/scan.c
@@ -0,0 +1,121 @@
+#include "redismodule.h"
+
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+
+typedef struct {
+    size_t nkeys;
+} scan_strings_pd;
+
+void scan_strings_callback(RedisModuleCtx *ctx, RedisModuleString* keyname, RedisModuleKey* key, void *privdata) {
+    scan_strings_pd* pd = privdata;
+    int was_opened = 0;
+    if (!key) {
+        key = RedisModule_OpenKey(ctx, keyname, REDISMODULE_READ);
+        was_opened = 1;
+    }
+
+    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_STRING) {
+        size_t len;
+        char * data = RedisModule_StringDMA(key, &len, REDISMODULE_READ);
+        RedisModule_ReplyWithArray(ctx, 2);
+        RedisModule_ReplyWithString(ctx, keyname);
+        RedisModule_ReplyWithStringBuffer(ctx, data, len);
+        pd->nkeys++;
+    }
+    if (was_opened)
+        RedisModule_CloseKey(key);
+}
+
+int scan_strings(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    scan_strings_pd pd = {
+        .nkeys = 0,
+    };
+
+    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
+
+    RedisModuleScanCursor* cursor = RedisModule_ScanCursorCreate();
+    while(RedisModule_Scan(ctx, cursor, scan_strings_callback, &pd));
+    RedisModule_ScanCursorDestroy(cursor);
+
+    RedisModule_ReplySetArrayLength(ctx, pd.nkeys);
+    return REDISMODULE_OK;
+}
+
+typedef struct {
+    RedisModuleCtx *ctx;
+    size_t nreplies;
+} scan_key_pd;
+
+void scan_key_callback(RedisModuleKey *key, RedisModuleString* field, RedisModuleString* value, void *privdata) {
+    REDISMODULE_NOT_USED(key);
+    scan_key_pd* pd = privdata;
+    RedisModule_ReplyWithArray(pd->ctx, 2);
+    size_t fieldCStrLen;
+
+    // The implementation of RedisModuleString is robj with lots of encodings.
+    // We want to make sure the robj that passes to this callback in
+    // String encoded, this is why we use RedisModule_StringPtrLen and
+    // RedisModule_ReplyWithStringBuffer instead of directly use
+    // RedisModule_ReplyWithString.
+    const char* fieldCStr = RedisModule_StringPtrLen(field, &fieldCStrLen);
+    RedisModule_ReplyWithStringBuffer(pd->ctx, fieldCStr, fieldCStrLen);
+    if(value){
+        size_t valueCStrLen;
+        const char* valueCStr = RedisModule_StringPtrLen(value, &valueCStrLen);
+        RedisModule_ReplyWithStringBuffer(pd->ctx, valueCStr, valueCStrLen);
+    } else {
+        RedisModule_ReplyWithNull(pd->ctx);
+    }
+
+    pd->nreplies++;
+}
+
+int scan_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    scan_key_pd pd = {
+        .ctx = ctx,
+        .nreplies = 0,
+    };
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
+    if (!key) {
+        RedisModule_ReplyWithError(ctx, "not found");
+        return REDISMODULE_OK;
+    }
+
+    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
+
+    RedisModuleScanCursor* cursor = RedisModule_ScanCursorCreate();
+    while(RedisModule_ScanKey(key, cursor, scan_key_callback, &pd));
+    RedisModule_ScanCursorDestroy(cursor);
+
+    RedisModule_ReplySetArrayLength(ctx, pd.nreplies);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx, "scan", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "scan.scan_strings", scan_strings, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "scan.scan_key", scan_key, "", 0, 0, 0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
+
+
diff --git a/redis-stable/tests/modules/stream.c b/redis-stable/tests/modules/stream.c
new file mode 100644
index 00000000..abfbb1fa
--- /dev/null
+++ b/redis-stable/tests/modules/stream.c
@@ -0,0 +1,258 @@
+#include "redismodule.h"
+
+#include <string.h>
+#include <strings.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+
+/* Command which adds a stream entry with automatic ID, like XADD *.
+ *
+ * Syntax: STREAM.ADD key field1 value1 [ field2 value2 ... ]
+ *
+ * The response is the ID of the added stream entry or an error message.
+ */
+int stream_add(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc < 2 || argc % 2 != 0) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    RedisModuleStreamID id;
+    if (RedisModule_StreamAdd(key, REDISMODULE_STREAM_ADD_AUTOID, &id,
+                              &argv[2], (argc-2)/2) == REDISMODULE_OK) {
+        RedisModuleString *id_str = RedisModule_CreateStringFromStreamID(ctx, &id);
+        RedisModule_ReplyWithString(ctx, id_str);
+        RedisModule_FreeString(ctx, id_str);
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR StreamAdd failed");
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/* Command which adds a stream entry N times.
+ *
+ * Syntax: STREAM.ADD key N field1 value1 [ field2 value2 ... ]
+ *
+ * Returns the number of successfully added entries.
+ */
+int stream_addn(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc < 3 || argc % 2 == 0) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    long long n, i;
+    if (RedisModule_StringToLongLong(argv[2], &n) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithError(ctx, "N must be a number");
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    for (i = 0; i < n; i++) {
+        if (RedisModule_StreamAdd(key, REDISMODULE_STREAM_ADD_AUTOID, NULL,
+                                  &argv[3], (argc-3)/2) == REDISMODULE_ERR)
+            break;
+    }
+    RedisModule_ReplyWithLongLong(ctx, i);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/* STREAM.DELETE key stream-id */
+int stream_delete(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    RedisModuleStreamID id;
+    if (RedisModule_StringToStreamID(argv[2], &id) != REDISMODULE_OK) {
+        return RedisModule_ReplyWithError(ctx, "Invalid stream ID");
+    }
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    if (RedisModule_StreamDelete(key, &id) == REDISMODULE_OK) {
+        RedisModule_ReplyWithSimpleString(ctx, "OK");
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR StreamDelete failed");
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/* STREAM.RANGE key start-id end-id
+ *
+ * Returns an array of stream items. Each item is an array on the form
+ * [stream-id, [field1, value1, field2, value2, ...]].
+ *
+ * A funny side-effect used for testing RM_StreamIteratorDelete() is that if any
+ * entry has a field named "selfdestruct", the stream entry is deleted. It is
+ * however included in the results of this command.
+ */
+int stream_range(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 4) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleStreamID startid, endid;
+    if (RedisModule_StringToStreamID(argv[2], &startid) != REDISMODULE_OK ||
+        RedisModule_StringToStreamID(argv[3], &endid) != REDISMODULE_OK) {
+        RedisModule_ReplyWithError(ctx, "Invalid stream ID");
+        return REDISMODULE_OK;
+    }
+
+    /* If startid > endid, we swap and set the reverse flag. */
+    int flags = 0;
+    if (startid.ms > endid.ms ||
+        (startid.ms == endid.ms && startid.seq > endid.seq)) {
+        RedisModuleStreamID tmp = startid;
+        startid = endid;
+        endid = tmp;
+        flags |= REDISMODULE_STREAM_ITERATOR_REVERSE;
+    }
+
+    /* Open key and start iterator. */
+    int openflags = REDISMODULE_READ | REDISMODULE_WRITE;
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], openflags);
+    if (RedisModule_StreamIteratorStart(key, flags,
+                                        &startid, &endid) != REDISMODULE_OK) {
+        /* Key is not a stream, etc. */
+        RedisModule_ReplyWithError(ctx, "ERR StreamIteratorStart failed");
+        RedisModule_CloseKey(key);
+        return REDISMODULE_OK;
+    }
+
+    /* Check error handling: Delete current entry when no current entry. */
+    assert(RedisModule_StreamIteratorDelete(key) ==
+           REDISMODULE_ERR);
+    assert(errno == ENOENT);
+
+    /* Check error handling: Fetch fields when no current entry. */
+    assert(RedisModule_StreamIteratorNextField(key, NULL, NULL) ==
+           REDISMODULE_ERR);
+    assert(errno == ENOENT);
+
+    /* Return array. */
+    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
+    RedisModule_AutoMemory(ctx);
+    RedisModuleStreamID id;
+    long numfields;
+    long len = 0;
+    while (RedisModule_StreamIteratorNextID(key, &id,
+                                            &numfields) == REDISMODULE_OK) {
+        RedisModule_ReplyWithArray(ctx, 2);
+        RedisModuleString *id_str = RedisModule_CreateStringFromStreamID(ctx, &id);
+        RedisModule_ReplyWithString(ctx, id_str);
+        RedisModule_ReplyWithArray(ctx, numfields * 2);
+        int delete = 0;
+        RedisModuleString *field, *value;
+        for (long i = 0; i < numfields; i++) {
+            assert(RedisModule_StreamIteratorNextField(key, &field, &value) ==
+                   REDISMODULE_OK);
+            RedisModule_ReplyWithString(ctx, field);
+            RedisModule_ReplyWithString(ctx, value);
+            /* check if this is a "selfdestruct" field */
+            size_t field_len;
+            const char *field_str = RedisModule_StringPtrLen(field, &field_len);
+            if (!strncmp(field_str, "selfdestruct", field_len)) delete = 1;
+        }
+        if (delete) {
+            assert(RedisModule_StreamIteratorDelete(key) == REDISMODULE_OK);
+        }
+        /* check error handling: no more fields to fetch */
+        assert(RedisModule_StreamIteratorNextField(key, &field, &value) ==
+               REDISMODULE_ERR);
+        assert(errno == ENOENT);
+        len++;
+    }
+    RedisModule_ReplySetArrayLength(ctx, len);
+    RedisModule_StreamIteratorStop(key);
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+/*
+ * STREAM.TRIM key (MAXLEN (=|~) length | MINID (=|~) id)
+ */
+int stream_trim(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 5) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    /* Parse args */
+    int trim_by_id = 0; /* 0 = maxlen, 1 = minid */
+    long long maxlen;
+    RedisModuleStreamID minid;
+    size_t arg_len;
+    const char *arg = RedisModule_StringPtrLen(argv[2], &arg_len);
+    if (!strcasecmp(arg, "minid")) {
+        trim_by_id = 1;
+        if (RedisModule_StringToStreamID(argv[4], &minid) != REDISMODULE_OK) {
+            RedisModule_ReplyWithError(ctx, "ERR Invalid stream ID");
+            return REDISMODULE_OK;
+        }
+    } else if (!strcasecmp(arg, "maxlen")) {
+        if (RedisModule_StringToLongLong(argv[4], &maxlen) == REDISMODULE_ERR) {
+            RedisModule_ReplyWithError(ctx, "ERR Maxlen must be a number");
+            return REDISMODULE_OK;
+        }
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR Invalid arguments");
+        return REDISMODULE_OK;
+    }
+
+    /* Approx or exact */
+    int flags;
+    arg = RedisModule_StringPtrLen(argv[3], &arg_len);
+    if (arg_len == 1 && arg[0] == '~') {
+        flags = REDISMODULE_STREAM_TRIM_APPROX;
+    } else if (arg_len == 1 && arg[0] == '=') {
+        flags = 0;
+    } else {
+        RedisModule_ReplyWithError(ctx, "ERR Invalid approx-or-exact mark");
+        return REDISMODULE_OK;
+    }
+
+    /* Trim */
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    long long trimmed;
+    if (trim_by_id) {
+        trimmed = RedisModule_StreamTrimByID(key, flags, &minid);
+    } else {
+        trimmed = RedisModule_StreamTrimByLength(key, flags, maxlen);
+    }
+
+    /* Return result */
+    if (trimmed < 0) {
+        RedisModule_ReplyWithError(ctx, "ERR Trimming failed");
+    } else {
+        RedisModule_ReplyWithLongLong(ctx, trimmed);
+    }
+    RedisModule_CloseKey(key);
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx, "stream", 1, REDISMODULE_APIVER_1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx, "stream.add", stream_add, "",
+                                  1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx, "stream.addn", stream_addn, "",
+                                  1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx, "stream.delete", stream_delete, "",
+                                  1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx, "stream.range", stream_range, "",
+                                  1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx, "stream.trim", stream_trim, "",
+                                  1, 1, 1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/test_lazyfree.c b/redis-stable/tests/modules/test_lazyfree.c
new file mode 100644
index 00000000..144dab9b
--- /dev/null
+++ b/redis-stable/tests/modules/test_lazyfree.c
@@ -0,0 +1,196 @@
+/* This module emulates a linked list for lazyfree testing of modules, which
+ is a simplified version of 'hellotype.c'
+ */
+#include "redismodule.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+#include <stdint.h>
+
+static RedisModuleType *LazyFreeLinkType;
+
+struct LazyFreeLinkNode {
+    int64_t value;
+    struct LazyFreeLinkNode *next;
+};
+
+struct LazyFreeLinkObject {
+    struct LazyFreeLinkNode *head;
+    size_t len; /* Number of elements added. */
+};
+
+struct LazyFreeLinkObject *createLazyFreeLinkObject(void) {
+    struct LazyFreeLinkObject *o;
+    o = RedisModule_Alloc(sizeof(*o));
+    o->head = NULL;
+    o->len = 0;
+    return o;
+}
+
+void LazyFreeLinkInsert(struct LazyFreeLinkObject *o, int64_t ele) {
+    struct LazyFreeLinkNode *next = o->head, *newnode, *prev = NULL;
+
+    while(next && next->value < ele) {
+        prev = next;
+        next = next->next;
+    }
+    newnode = RedisModule_Alloc(sizeof(*newnode));
+    newnode->value = ele;
+    newnode->next = next;
+    if (prev) {
+        prev->next = newnode;
+    } else {
+        o->head = newnode;
+    }
+    o->len++;
+}
+
+void LazyFreeLinkReleaseObject(struct LazyFreeLinkObject *o) {
+    struct LazyFreeLinkNode *cur, *next;
+    cur = o->head;
+    while(cur) {
+        next = cur->next;
+        RedisModule_Free(cur);
+        cur = next;
+    }
+    RedisModule_Free(o);
+}
+
+/* LAZYFREELINK.INSERT key value */
+int LazyFreeLinkInsert_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != LazyFreeLinkType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    long long value;
+    if ((RedisModule_StringToLongLong(argv[2],&value) != REDISMODULE_OK)) {
+        return RedisModule_ReplyWithError(ctx,"ERR invalid value: must be a signed 64 bit integer");
+    }
+
+    struct LazyFreeLinkObject *hto;
+    if (type == REDISMODULE_KEYTYPE_EMPTY) {
+        hto = createLazyFreeLinkObject();
+        RedisModule_ModuleTypeSetValue(key,LazyFreeLinkType,hto);
+    } else {
+        hto = RedisModule_ModuleTypeGetValue(key);
+    }
+
+    LazyFreeLinkInsert(hto,value);
+    RedisModule_SignalKeyAsReady(ctx,argv[1]);
+
+    RedisModule_ReplyWithLongLong(ctx,hto->len);
+    RedisModule_ReplicateVerbatim(ctx);
+    return REDISMODULE_OK;
+}
+
+/* LAZYFREELINK.LEN key */
+int LazyFreeLinkLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
+
+    if (argc != 2) return RedisModule_WrongArity(ctx);
+    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
+        REDISMODULE_READ|REDISMODULE_WRITE);
+    int type = RedisModule_KeyType(key);
+    if (type != REDISMODULE_KEYTYPE_EMPTY &&
+        RedisModule_ModuleTypeGetType(key) != LazyFreeLinkType)
+    {
+        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
+    }
+
+    struct LazyFreeLinkObject *hto = RedisModule_ModuleTypeGetValue(key);
+    RedisModule_ReplyWithLongLong(ctx,hto ? hto->len : 0);
+    return REDISMODULE_OK;
+}
+
+void *LazyFreeLinkRdbLoad(RedisModuleIO *rdb, int encver) {
+    if (encver != 0) {
+        return NULL;
+    }
+    uint64_t elements = RedisModule_LoadUnsigned(rdb);
+    struct LazyFreeLinkObject *hto = createLazyFreeLinkObject();
+    while(elements--) {
+        int64_t ele = RedisModule_LoadSigned(rdb);
+        LazyFreeLinkInsert(hto,ele);
+    }
+    return hto;
+}
+
+void LazyFreeLinkRdbSave(RedisModuleIO *rdb, void *value) {
+    struct LazyFreeLinkObject *hto = value;
+    struct LazyFreeLinkNode *node = hto->head;
+    RedisModule_SaveUnsigned(rdb,hto->len);
+    while(node) {
+        RedisModule_SaveSigned(rdb,node->value);
+        node = node->next;
+    }
+}
+
+void LazyFreeLinkAofRewrite(RedisModuleIO *aof, RedisModuleString *key, void *value) {
+    struct LazyFreeLinkObject *hto = value;
+    struct LazyFreeLinkNode *node = hto->head;
+    while(node) {
+        RedisModule_EmitAOF(aof,"LAZYFREELINK.INSERT","sl",key,node->value);
+        node = node->next;
+    }
+}
+
+void LazyFreeLinkFree(void *value) {
+    LazyFreeLinkReleaseObject(value);
+}
+
+size_t LazyFreeLinkFreeEffort(RedisModuleString *key, const void *value) {
+    REDISMODULE_NOT_USED(key);
+    const struct LazyFreeLinkObject *hto = value;
+    return hto->len;
+}
+
+void LazyFreeLinkUnlink(RedisModuleString *key, const void *value) {
+    REDISMODULE_NOT_USED(key);
+    REDISMODULE_NOT_USED(value);
+    /* Here you can know which key and value is about to be freed. */
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"lazyfreetest",1,REDISMODULE_APIVER_1)
+        == REDISMODULE_ERR) return REDISMODULE_ERR;
+
+    /* We only allow our module to be loaded when the redis core version is greater than the version of my module */
+    if (RedisModule_GetTypeMethodVersion() < REDISMODULE_TYPE_METHOD_VERSION) {
+        return REDISMODULE_ERR;
+    }
+
+    RedisModuleTypeMethods tm = {
+        .version = REDISMODULE_TYPE_METHOD_VERSION,
+        .rdb_load = LazyFreeLinkRdbLoad,
+        .rdb_save = LazyFreeLinkRdbSave,
+        .aof_rewrite = LazyFreeLinkAofRewrite,
+        .free = LazyFreeLinkFree,
+        .free_effort = LazyFreeLinkFreeEffort,
+        .unlink = LazyFreeLinkUnlink,
+    };
+
+    LazyFreeLinkType = RedisModule_CreateDataType(ctx,"test_lazy",0,&tm);
+    if (LazyFreeLinkType == NULL) return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"lazyfreelink.insert",
+        LazyFreeLinkInsert_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"lazyfreelink.len",
+        LazyFreeLinkLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/testrdb.c b/redis-stable/tests/modules/testrdb.c
new file mode 100644
index 00000000..5d9382a3
--- /dev/null
+++ b/redis-stable/tests/modules/testrdb.c
@@ -0,0 +1,301 @@
+#include "redismodule.h"
+
+#include <string.h>
+#include <assert.h>
+
+/* Module configuration, save aux or not? */
+long long conf_aux_count = 0;
+
+/* Registered type */
+RedisModuleType *testrdb_type = NULL;
+
+/* Global values to store and persist to aux */
+RedisModuleString *before_str = NULL;
+RedisModuleString *after_str = NULL;
+
+void replBackupCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
+{
+    REDISMODULE_NOT_USED(e);
+    REDISMODULE_NOT_USED(data);
+    static RedisModuleString *before_str_backup = NULL;
+    static RedisModuleString *after_str_backup = NULL;
+
+    switch (sub) {
+    case REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE:
+        assert(before_str_backup == NULL);
+        assert(after_str_backup == NULL);
+        before_str_backup = before_str;
+        after_str_backup = after_str;
+        before_str = NULL;
+        after_str = NULL;
+        break;
+    case REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE:
+        if (before_str)
+            RedisModule_FreeString(ctx, before_str);
+        if (after_str)
+            RedisModule_FreeString(ctx, after_str);
+        before_str = before_str_backup;
+        after_str = after_str_backup;
+        before_str_backup = NULL;
+        after_str_backup = NULL;
+        break;
+    case REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD:
+        if (before_str_backup)
+            RedisModule_FreeString(ctx, before_str_backup);
+        if (after_str_backup)
+            RedisModule_FreeString(ctx, after_str_backup);
+        before_str_backup = NULL;
+        after_str_backup = NULL;
+        break;
+    default:
+        assert(0);
+    }
+}
+
+void *testrdb_type_load(RedisModuleIO *rdb, int encver) {
+    int count = RedisModule_LoadSigned(rdb);
+    RedisModuleString *str = RedisModule_LoadString(rdb);
+    float f = RedisModule_LoadFloat(rdb);
+    long double ld = RedisModule_LoadLongDouble(rdb);
+    if (RedisModule_IsIOError(rdb)) {
+        RedisModuleCtx *ctx = RedisModule_GetContextFromIO(rdb);
+        if (str)
+            RedisModule_FreeString(ctx, str);
+        return NULL;
+    }
+    /* Using the values only after checking for io errors. */
+    assert(count==1);
+    assert(encver==1);
+    assert(f==1.5f);
+    assert(ld==0.333333333333333333L);
+    return str;
+}
+
+void testrdb_type_save(RedisModuleIO *rdb, void *value) {
+    RedisModuleString *str = (RedisModuleString*)value;
+    RedisModule_SaveSigned(rdb, 1);
+    RedisModule_SaveString(rdb, str);
+    RedisModule_SaveFloat(rdb, 1.5);
+    RedisModule_SaveLongDouble(rdb, 0.333333333333333333L);
+}
+
+void testrdb_aux_save(RedisModuleIO *rdb, int when) {
+    if (conf_aux_count==1) assert(when == REDISMODULE_AUX_AFTER_RDB);
+    if (conf_aux_count==0) assert(0);
+    if (when == REDISMODULE_AUX_BEFORE_RDB) {
+        if (before_str) {
+            RedisModule_SaveSigned(rdb, 1);
+            RedisModule_SaveString(rdb, before_str);
+        } else {
+            RedisModule_SaveSigned(rdb, 0);
+        }
+    } else {
+        if (after_str) {
+            RedisModule_SaveSigned(rdb, 1);
+            RedisModule_SaveString(rdb, after_str);
+        } else {
+            RedisModule_SaveSigned(rdb, 0);
+        }
+    }
+}
+
+int testrdb_aux_load(RedisModuleIO *rdb, int encver, int when) {
+    assert(encver == 1);
+    if (conf_aux_count==1) assert(when == REDISMODULE_AUX_AFTER_RDB);
+    if (conf_aux_count==0) assert(0);
+    RedisModuleCtx *ctx = RedisModule_GetContextFromIO(rdb);
+    if (when == REDISMODULE_AUX_BEFORE_RDB) {
+        if (before_str)
+            RedisModule_FreeString(ctx, before_str);
+        before_str = NULL;
+        int count = RedisModule_LoadSigned(rdb);
+        if (RedisModule_IsIOError(rdb))
+            return REDISMODULE_ERR;
+        if (count)
+            before_str = RedisModule_LoadString(rdb);
+    } else {
+        if (after_str)
+            RedisModule_FreeString(ctx, after_str);
+        after_str = NULL;
+        int count = RedisModule_LoadSigned(rdb);
+        if (RedisModule_IsIOError(rdb))
+            return REDISMODULE_ERR;
+        if (count)
+            after_str = RedisModule_LoadString(rdb);
+    }
+    if (RedisModule_IsIOError(rdb))
+        return REDISMODULE_ERR;
+    return REDISMODULE_OK;
+}
+
+void testrdb_type_free(void *value) {
+    if (value)
+        RedisModule_FreeString(NULL, (RedisModuleString*)value);
+}
+
+int testrdb_set_before(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    if (before_str)
+        RedisModule_FreeString(ctx, before_str);
+    before_str = argv[1];
+    RedisModule_RetainString(ctx, argv[1]);
+    RedisModule_ReplyWithLongLong(ctx, 1);
+    return REDISMODULE_OK;
+}
+
+int testrdb_get_before(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    if (argc != 1){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    if (before_str)
+        RedisModule_ReplyWithString(ctx, before_str);
+    else
+        RedisModule_ReplyWithStringBuffer(ctx, "", 0);
+    return REDISMODULE_OK;
+}
+
+int testrdb_set_after(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    if (after_str)
+        RedisModule_FreeString(ctx, after_str);
+    after_str = argv[1];
+    RedisModule_RetainString(ctx, argv[1]);
+    RedisModule_ReplyWithLongLong(ctx, 1);
+    return REDISMODULE_OK;
+}
+
+int testrdb_get_after(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    REDISMODULE_NOT_USED(argv);
+    if (argc != 1){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+    if (after_str)
+        RedisModule_ReplyWithString(ctx, after_str);
+    else
+        RedisModule_ReplyWithStringBuffer(ctx, "", 0);
+    return REDISMODULE_OK;
+}
+
+int testrdb_set_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 3){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    RedisModuleString *str = RedisModule_ModuleTypeGetValue(key);
+    if (str)
+        RedisModule_FreeString(ctx, str);
+    RedisModule_ModuleTypeSetValue(key, testrdb_type, argv[2]);
+    RedisModule_RetainString(ctx, argv[2]);
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithLongLong(ctx, 1);
+    return REDISMODULE_OK;
+}
+
+int testrdb_get_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2){
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
+    RedisModuleString *str = RedisModule_ModuleTypeGetValue(key);
+    RedisModule_CloseKey(key);
+    RedisModule_ReplyWithString(ctx, str);
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+
+    if (RedisModule_Init(ctx,"testrdb",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModule_SetModuleOptions(ctx, REDISMODULE_OPTIONS_HANDLE_IO_ERRORS);
+
+    if (argc > 0)
+        RedisModule_StringToLongLong(argv[0], &conf_aux_count);
+
+    if (conf_aux_count==0) {
+        RedisModuleTypeMethods datatype_methods = {
+            .version = 1,
+            .rdb_load = testrdb_type_load,
+            .rdb_save = testrdb_type_save,
+            .aof_rewrite = NULL,
+            .digest = NULL,
+            .free = testrdb_type_free,
+        };
+
+        testrdb_type = RedisModule_CreateDataType(ctx, "test__rdb", 1, &datatype_methods);
+        if (testrdb_type == NULL)
+            return REDISMODULE_ERR;
+    } else {
+        RedisModuleTypeMethods datatype_methods = {
+            .version = REDISMODULE_TYPE_METHOD_VERSION,
+            .rdb_load = testrdb_type_load,
+            .rdb_save = testrdb_type_save,
+            .aof_rewrite = NULL,
+            .digest = NULL,
+            .free = testrdb_type_free,
+            .aux_load = testrdb_aux_load,
+            .aux_save = testrdb_aux_save,
+            .aux_save_triggers = (conf_aux_count == 1 ?
+                                  REDISMODULE_AUX_AFTER_RDB :
+                                  REDISMODULE_AUX_BEFORE_RDB | REDISMODULE_AUX_AFTER_RDB)
+        };
+
+        testrdb_type = RedisModule_CreateDataType(ctx, "test__rdb", 1, &datatype_methods);
+        if (testrdb_type == NULL)
+            return REDISMODULE_ERR;
+    }
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.set.before", testrdb_set_before,"deny-oom",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.get.before", testrdb_get_before,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.set.after", testrdb_set_after,"deny-oom",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.get.after", testrdb_get_after,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.set.key", testrdb_set_key,"deny-oom",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"testrdb.get.key", testrdb_get_key,"",1,1,1) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    RedisModule_SubscribeToServerEvent(ctx,
+        RedisModuleEvent_ReplBackup, replBackupCallback);
+
+    return REDISMODULE_OK;
+}
+
+int RedisModule_OnUnload(RedisModuleCtx *ctx) {
+    if (before_str)
+        RedisModule_FreeString(ctx, before_str);
+    if (after_str)
+        RedisModule_FreeString(ctx, after_str);
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/timer.c b/redis-stable/tests/modules/timer.c
new file mode 100644
index 00000000..d2a8d8e7
--- /dev/null
+++ b/redis-stable/tests/modules/timer.c
@@ -0,0 +1,103 @@
+
+#define REDISMODULE_EXPERIMENTAL_API
+#include "redismodule.h"
+
+static void timer_callback(RedisModuleCtx *ctx, void *data)
+{
+    RedisModuleString *keyname = data;
+    RedisModuleCallReply *reply;
+
+    reply = RedisModule_Call(ctx, "INCR", "s", keyname);
+    if (reply != NULL)
+        RedisModule_FreeCallReply(reply);
+    RedisModule_FreeString(ctx, keyname);
+}
+
+int test_createtimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 3) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    long long period;
+    if (RedisModule_StringToLongLong(argv[1], &period) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithError(ctx, "Invalid time specified.");
+        return REDISMODULE_OK;
+    }
+
+    RedisModuleString *keyname = argv[2];
+    RedisModule_RetainString(ctx, keyname);
+
+    RedisModuleTimerID id = RedisModule_CreateTimer(ctx, period, timer_callback, keyname);
+    RedisModule_ReplyWithLongLong(ctx, id);
+
+    return REDISMODULE_OK;
+}
+
+int test_gettimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    long long id;
+    if (RedisModule_StringToLongLong(argv[1], &id) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithError(ctx, "Invalid id specified.");
+        return REDISMODULE_OK;
+    }
+
+    uint64_t remaining;
+    RedisModuleString *keyname;
+    if (RedisModule_GetTimerInfo(ctx, id, &remaining, (void **)&keyname) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithNull(ctx);
+    } else {
+        RedisModule_ReplyWithArray(ctx, 2);
+        RedisModule_ReplyWithString(ctx, keyname);
+        RedisModule_ReplyWithLongLong(ctx, remaining);
+    }
+
+    return REDISMODULE_OK;
+}
+
+int test_stoptimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
+{
+    if (argc != 2) {
+        RedisModule_WrongArity(ctx);
+        return REDISMODULE_OK;
+    }
+
+    long long id;
+    if (RedisModule_StringToLongLong(argv[1], &id) == REDISMODULE_ERR) {
+        RedisModule_ReplyWithError(ctx, "Invalid id specified.");
+        return REDISMODULE_OK;
+    }
+
+    int ret = 0;
+    RedisModuleString *keyname;
+    if (RedisModule_StopTimer(ctx, id, (void **) &keyname) == REDISMODULE_OK) {
+        RedisModule_FreeString(ctx, keyname);
+        ret = 1;
+    }
+
+    RedisModule_ReplyWithLongLong(ctx, ret);
+    return REDISMODULE_OK;
+}
+
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx,"timer",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    if (RedisModule_CreateCommand(ctx,"test.createtimer", test_createtimer,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.gettimer", test_gettimer,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+    if (RedisModule_CreateCommand(ctx,"test.stoptimer", test_stoptimer,"",0,0,0) == REDISMODULE_ERR)
+        return REDISMODULE_ERR;
+
+    return REDISMODULE_OK;
+}
diff --git a/redis-stable/tests/modules/zset.c b/redis-stable/tests/modules/zset.c
new file mode 100644
index 00000000..4806f654
--- /dev/null
+++ b/redis-stable/tests/modules/zset.c
@@ -0,0 +1,30 @@
+#include "redismodule.h"
+
+/* ZSET.REM key element
+ *
+ * Removes an occurrence of an element from a sorted set. Replies with the
+ * number of removed elements (0 or 1).
+ */
+int zset_rem(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    if (argc != 3) return RedisModule_WrongArity(ctx);
+    RedisModule_AutoMemory(ctx);
+    int keymode = REDISMODULE_READ | REDISMODULE_WRITE;
+    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], keymode);
+    int deleted;
+    if (RedisModule_ZsetRem(key, argv[2], &deleted) == REDISMODULE_OK)
+        return RedisModule_ReplyWithLongLong(ctx, deleted);
+    else
+        return RedisModule_ReplyWithError(ctx, "ERR ZsetRem failed");
+}
+
+int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
+    REDISMODULE_NOT_USED(argv);
+    REDISMODULE_NOT_USED(argc);
+    if (RedisModule_Init(ctx, "zset", 1, REDISMODULE_APIVER_1) ==
+        REDISMODULE_OK &&
+        RedisModule_CreateCommand(ctx, "zset.rem", zset_rem, "",
+                                  1, 1, 1) == REDISMODULE_OK)
+        return REDISMODULE_OK;
+    else
+        return REDISMODULE_ERR;
+}
diff --git a/redis-stable/tests/sentinel/run.tcl b/redis-stable/tests/sentinel/run.tcl
new file mode 100644
index 00000000..64c99c10
--- /dev/null
+++ b/redis-stable/tests/sentinel/run.tcl
@@ -0,0 +1,27 @@
+# Sentinel test suite. Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
+# This software is released under the BSD License. See the COPYING file for
+# more information.
+
+cd tests/sentinel
+source ../instances.tcl
+
+set ::instances_count 5 ; # How many instances we use at max.
+set ::tlsdir "../../tls"
+
+proc main {} {
+    parse_options
+    if {$::leaked_fds_file != ""} {
+        set ::env(LEAKED_FDS_FILE) $::leaked_fds_file
+    }
+    spawn_instance sentinel $::sentinel_base_port $::instances_count [list "sentinel deny-scripts-reconfig no"] "../tests/includes/sentinel.conf"
+    spawn_instance redis $::redis_base_port $::instances_count
+    run_tests
+    cleanup
+    end_tests
+}
+
+if {[catch main e]} {
+    puts $::errorInfo
+    cleanup
+    exit 1
+}
diff --git a/redis-stable/tests/sentinel/tests/00-base.tcl b/redis-stable/tests/sentinel/tests/00-base.tcl
new file mode 100644
index 00000000..a1bbb278
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/00-base.tcl
@@ -0,0 +1,126 @@
+# Check the basic monitoring and failover capabilities.
+source "../tests/includes/start-init-tests.tcl"
+source "../tests/includes/init-tests.tcl"
+
+if {$::simulate_error} {
+    test "This test will fail" {
+        fail "Simulated error"
+    }
+}
+
+test "Basic failover works if the master is down" {
+    set old_port [RPort $master_id]
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+    kill_instance redis $master_id
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+        } else {
+            fail "At least one Sentinel did not receive failover info"
+        }
+    }
+    restart_instance redis $master_id
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
+}
+
+test "New master [join $addr {:}] role matches" {
+    assert {[RI $master_id role] eq {master}}
+}
+
+test "All the other slaves now point to the new master" {
+    foreach_redis_id id {
+        if {$id != $master_id && $id != 0} {
+            wait_for_condition 1000 50 {
+                [RI $id master_port] == [lindex $addr 1]
+            } else {
+                fail "Redis ID $id not configured to replicate with new master"
+            }
+        }
+    }
+}
+
+test "The old master eventually gets reconfigured as a slave" {
+    wait_for_condition 1000 50 {
+        [RI 0 master_port] == [lindex $addr 1]
+    } else {
+        fail "Old master not reconfigured as slave of new master"
+    }
+}
+
+test "ODOWN is not possible without N (quorum) Sentinels reports" {
+    foreach_sentinel_id id {
+        S $id SENTINEL SET mymaster quorum [expr $sentinels+1]
+    }
+    set old_port [RPort $master_id]
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+    kill_instance redis $master_id
+
+    # Make sure failover did not happened.
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+    restart_instance redis $master_id
+}
+
+test "Failover is not possible without majority agreement" {
+    foreach_sentinel_id id {
+        S $id SENTINEL SET mymaster quorum $quorum
+    }
+
+    # Crash majority of sentinels
+    for {set id 0} {$id < $quorum} {incr id} {
+        kill_instance sentinel $id
+    }
+
+    # Kill the current master
+    kill_instance redis $master_id
+
+    # Make sure failover did not happened.
+    set addr [S $quorum SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+    restart_instance redis $master_id
+
+    # Cleanup: restart Sentinels to monitor the master.
+    for {set id 0} {$id < $quorum} {incr id} {
+        restart_instance sentinel $id
+    }
+}
+
+test "Failover works if we configure for absolute agreement" {
+    foreach_sentinel_id id {
+        S $id SENTINEL SET mymaster quorum $sentinels
+    }
+
+    # Wait for Sentinels to monitor the master again
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [dict get [S $id SENTINEL MASTER mymaster] info-refresh] < 100000
+        } else {
+            fail "At least one Sentinel is not monitoring the master"
+        }
+    }
+
+    kill_instance redis $master_id
+
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+        } else {
+            fail "At least one Sentinel did not receive failover info"
+        }
+    }
+    restart_instance redis $master_id
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
+
+    # Set the min ODOWN agreement back to strict majority.
+    foreach_sentinel_id id {
+        S $id SENTINEL SET mymaster quorum $quorum
+    }
+}
+
+test "New master [join $addr {:}] role matches" {
+    assert {[RI $master_id role] eq {master}}
+}
diff --git a/redis-stable/tests/sentinel/tests/01-conf-update.tcl b/redis-stable/tests/sentinel/tests/01-conf-update.tcl
new file mode 100644
index 00000000..5dca5560
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/01-conf-update.tcl
@@ -0,0 +1,39 @@
+# Test Sentinel configuration consistency after partitions heal.
+
+source "../tests/includes/init-tests.tcl"
+
+test "We can failover with Sentinel 1 crashed" {
+    set old_port [RPort $master_id]
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+
+    # Crash Sentinel 1
+    kill_instance sentinel 1
+
+    kill_instance redis $master_id
+    foreach_sentinel_id id {
+        if {$id != 1} {
+            wait_for_condition 1000 50 {
+                [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+            } else {
+                fail "Sentinel $id did not receive failover info"
+            }
+        }
+    }
+    restart_instance redis $master_id
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
+}
+
+test "After Sentinel 1 is restarted, its config gets updated" {
+    restart_instance sentinel 1
+    wait_for_condition 1000 50 {
+        [lindex [S 1 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+    } else {
+        fail "Restarted Sentinel did not receive failover info"
+    }
+}
+
+test "New master [join $addr {:}] role matches" {
+    assert {[RI $master_id role] eq {master}}
+}
diff --git a/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl b/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
new file mode 100644
index 00000000..9edf775e
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
@@ -0,0 +1,84 @@
+# Check that slaves are reconfigured at a latter time if they are partitioned.
+#
+# Here we should test:
+# 1) That slaves point to the new master after failover.
+# 2) That partitioned slaves point to new master when they are partitioned
+#    away during failover and return at a latter time.
+
+source "../tests/includes/init-tests.tcl"
+
+proc 02_test_slaves_replication {} {
+    uplevel 1 {
+        test "Check that slaves replicate from current master" {
+            set master_port [RPort $master_id]
+            foreach_redis_id id {
+                if {$id == $master_id} continue
+                if {[instance_is_killed redis $id]} continue
+                wait_for_condition 1000 50 {
+                    ([RI $id master_port] == $master_port) &&
+                    ([RI $id master_link_status] eq {up})
+                } else {
+                    fail "Redis slave $id is replicating from wrong master"
+                }
+            }
+        }
+    }
+}
+
+proc 02_crash_and_failover {} {
+    uplevel 1 {
+        test "Crash the master and force a failover" {
+            set old_port [RPort $master_id]
+            set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+            assert {[lindex $addr 1] == $old_port}
+            kill_instance redis $master_id
+            foreach_sentinel_id id {
+                wait_for_condition 1000 50 {
+                    [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+                } else {
+                    fail "At least one Sentinel did not receive failover info"
+                }
+            }
+            restart_instance redis $master_id
+            set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+            set master_id [get_instance_id_by_port redis [lindex $addr 1]]
+        }
+    }
+}
+
+02_test_slaves_replication
+02_crash_and_failover
+02_test_slaves_replication
+
+test "Kill a slave instance" {
+    foreach_redis_id id {
+        if {$id == $master_id} continue
+        set killed_slave_id $id
+        kill_instance redis $id
+        break
+    }
+}
+
+02_crash_and_failover
+02_test_slaves_replication
+
+test "Wait for failover to end" {
+    set inprogress 1
+    while {$inprogress} {
+        set inprogress 0
+        foreach_sentinel_id id {
+            if {[dict exists [S $id SENTINEL MASTER mymaster] failover-state]} {
+                incr inprogress
+            }
+        }
+        if {$inprogress} {after 100}
+    }
+}
+
+test "Restart killed slave and test replication of slaves again..." {
+    restart_instance redis $killed_slave_id
+}
+
+# Now we check if the slave rejoining the partition is reconfigured even
+# if the failover finished.
+02_test_slaves_replication
diff --git a/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl b/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
new file mode 100644
index 00000000..426596c3
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
@@ -0,0 +1 @@
+# Test runtime reconfiguration command SENTINEL SET.
diff --git a/redis-stable/tests/sentinel/tests/04-slave-selection.tcl b/redis-stable/tests/sentinel/tests/04-slave-selection.tcl
new file mode 100644
index 00000000..3d2ca648
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/04-slave-selection.tcl
@@ -0,0 +1,5 @@
+# Test slave selection algorithm.
+#
+# This unit should test:
+# 1) That when there are no suitable slaves no failover is performed.
+# 2) That among the available slaves, the one with better offset is picked.
diff --git a/redis-stable/tests/sentinel/tests/05-manual.tcl b/redis-stable/tests/sentinel/tests/05-manual.tcl
new file mode 100644
index 00000000..c97a0e53
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/05-manual.tcl
@@ -0,0 +1,45 @@
+# Test manual failover
+
+source "../tests/includes/init-tests.tcl"
+
+test "Manual failover works" {
+    set old_port [RPort $master_id]
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    assert {[lindex $addr 1] == $old_port}
+    catch {S 0 SENTINEL FAILOVER mymaster} reply
+    assert {$reply eq "OK"}
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
+        } else {
+            fail "At least one Sentinel did not receive failover info"
+        }
+    }
+    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
+    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
+}
+
+test "New master [join $addr {:}] role matches" {
+    assert {[RI $master_id role] eq {master}}
+}
+
+test "All the other slaves now point to the new master" {
+    foreach_redis_id id {
+        if {$id != $master_id && $id != 0} {
+            wait_for_condition 1000 50 {
+                [RI $id master_port] == [lindex $addr 1]
+            } else {
+                fail "Redis ID $id not configured to replicate with new master"
+            }
+        }
+    }
+}
+
+test "The old master eventually gets reconfigured as a slave" {
+    wait_for_condition 1000 50 {
+        [RI 0 master_port] == [lindex $addr 1]
+    } else {
+        fail "Old master not reconfigured as slave of new master"
+    }
+}
+
diff --git a/redis-stable/tests/sentinel/tests/06-ckquorum.tcl b/redis-stable/tests/sentinel/tests/06-ckquorum.tcl
new file mode 100644
index 00000000..4ea4e55d
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/06-ckquorum.tcl
@@ -0,0 +1,35 @@
+# Test for the SENTINEL CKQUORUM command
+
+source "../tests/includes/init-tests.tcl"
+set num_sentinels [llength $::sentinel_instances]
+
+test "CKQUORUM reports OK and the right amount of Sentinels" {
+    foreach_sentinel_id id {
+        assert_match "*OK $num_sentinels usable*" [S $id SENTINEL CKQUORUM mymaster]
+    }
+}
+
+test "CKQUORUM detects quorum cannot be reached" {
+    set orig_quorum [expr {$num_sentinels/2+1}]
+    S 0 SENTINEL SET mymaster quorum [expr {$num_sentinels+1}]
+    catch {[S 0 SENTINEL CKQUORUM mymaster]} err
+    assert_match "*NOQUORUM*" $err
+    S 0 SENTINEL SET mymaster quorum $orig_quorum
+}
+
+test "CKQUORUM detects failover authorization cannot be reached" {
+    set orig_quorum [expr {$num_sentinels/2+1}]
+    S 0 SENTINEL SET mymaster quorum 1
+    for {set i 0} {$i < $orig_quorum} {incr i} {
+        kill_instance sentinel [expr {$i + 1}]
+    }
+
+    after 5000
+    catch {[S 0 SENTINEL CKQUORUM mymaster]} err
+    assert_match "*NOQUORUM*" $err
+    S 0 SENTINEL SET mymaster quorum $orig_quorum
+    for {set i 0} {$i < $orig_quorum} {incr i} {
+        restart_instance sentinel [expr {$i + 1}]
+    }
+}
+
diff --git a/redis-stable/tests/sentinel/tests/07-down-conditions.tcl b/redis-stable/tests/sentinel/tests/07-down-conditions.tcl
new file mode 100644
index 00000000..0a696fa6
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/07-down-conditions.tcl
@@ -0,0 +1,80 @@
+# Test conditions where an instance is considered to be down
+
+source "../tests/includes/init-tests.tcl"
+source "../../../tests/support/cli.tcl"
+
+set ::alive_sentinel [expr {$::instances_count/2+2}]
+proc ensure_master_up {} {
+    wait_for_condition 1000 50 {
+        [dict get [S $::alive_sentinel sentinel master mymaster] flags] eq "master"
+    } else {
+        fail "Master flags are not just 'master'"
+    }
+}
+
+proc ensure_master_down {} {
+    wait_for_condition 1000 50 {
+        [string match *down* \
+            [dict get [S $::alive_sentinel sentinel master mymaster] flags]]
+    } else {
+        fail "Master is not flagged SDOWN"
+    }
+}
+
+test "Crash the majority of Sentinels to prevent failovers for this unit" {
+    for {set id 0} {$id < $quorum} {incr id} {
+        kill_instance sentinel $id
+    }
+}
+
+test "SDOWN is triggered by non-responding but not crashed instance" {
+    lassign [S $::alive_sentinel SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] host port
+    ensure_master_up
+    exec ../../../src/redis-cli -h $host -p $port {*}[rediscli_tls_config "../../../tests"] debug sleep 10 > /dev/null &
+    ensure_master_down
+    ensure_master_up
+}
+
+test "SDOWN is triggered by crashed instance" {
+    lassign [S $::alive_sentinel SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] host port
+    ensure_master_up
+    kill_instance redis 0
+    ensure_master_down
+    restart_instance redis 0
+    ensure_master_up
+}
+
+test "SDOWN is triggered by masters advertising as slaves" {
+    ensure_master_up
+    R 0 slaveof 127.0.0.1 34567
+    ensure_master_down
+    R 0 slaveof no one
+    ensure_master_up
+}
+
+test "SDOWN is triggered by misconfigured instance repling with errors" {
+    ensure_master_up
+    set orig_dir [lindex [R 0 config get dir] 1]
+    set orig_save [lindex [R 0 config get save] 1]
+    # Set dir to / and filename to "tmp" to make sure it will fail.
+    R 0 config set dir /
+    R 0 config set dbfilename tmp
+    R 0 config set save "1000000 1000000"
+    R 0 bgsave
+    ensure_master_down
+    R 0 config set save $orig_save
+    R 0 config set dir $orig_dir
+    R 0 config set dbfilename dump.rdb
+    R 0 bgsave
+    ensure_master_up
+}
+
+# We use this test setup to also test command renaming, as a side
+# effect of the master going down if we send PONG instead of PING
+test "SDOWN is triggered if we rename PING to PONG" {
+    ensure_master_up
+    S $::alive_sentinel SENTINEL SET mymaster rename-command PING PONG
+    ensure_master_down
+    S $::alive_sentinel SENTINEL SET mymaster rename-command PING PING
+    ensure_master_up
+}
diff --git a/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl b/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
new file mode 100644
index 00000000..be6e42cb
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
@@ -0,0 +1,67 @@
+proc set_redis_announce_ip {addr} {
+    foreach_redis_id id {
+        R $id config set replica-announce-ip $addr
+    }
+}
+
+proc set_sentinel_config {keyword value} {
+    foreach_sentinel_id id {
+        S $id sentinel config set $keyword $value
+    }
+}
+
+proc set_all_instances_hostname {hostname} {
+    foreach_sentinel_id id {
+        set_instance_attrib sentinel $id host $hostname
+    }
+    foreach_redis_id id {
+        set_instance_attrib redis $id host $hostname
+    }
+}
+
+test "(pre-init) Configure instances and sentinel for hostname use" {
+    set ::host "localhost"
+    restart_killed_instances
+    set_all_instances_hostname $::host
+    set_redis_announce_ip $::host
+    set_sentinel_config resolve-hostnames yes
+    set_sentinel_config announce-hostnames yes
+}
+
+source "../tests/includes/init-tests.tcl"
+
+proc verify_hostname_announced {hostname} {
+    foreach_sentinel_id id {
+        # Master is reported with its hostname
+        if {![string equal [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 0] $hostname]} {
+            return 0
+        }
+
+        # Replicas are reported with their hostnames
+        foreach replica [S $id SENTINEL REPLICAS mymaster] {
+            if {![string equal [dict get $replica ip] $hostname]} {
+                return 0
+            }
+        }
+    }
+    return 1
+}
+
+test "Sentinel announces hostnames" {
+    # Check initial state
+    verify_hostname_announced $::host
+
+    # Disable announce-hostnames and confirm IPs are used
+    set_sentinel_config announce-hostnames no
+    assert {[verify_hostname_announced "127.0.0.1"] || [verify_hostname_announced "::1"]}
+}
+
+# We need to revert any special configuration because all tests currently
+# share the same instances.
+test "(post-cleanup) Configure instances and sentinel for IPs" {
+    set ::host "127.0.0.1"
+    set_all_instances_hostname $::host
+    set_redis_announce_ip $::host
+    set_sentinel_config resolve-hostnames no
+    set_sentinel_config announce-hostnames no
+}
\ No newline at end of file
diff --git a/redis-stable/tests/sentinel/tests/09-acl-support.tcl b/redis-stable/tests/sentinel/tests/09-acl-support.tcl
new file mode 100644
index 00000000..1366fc4d
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/09-acl-support.tcl
@@ -0,0 +1,50 @@
+
+source "../tests/includes/init-tests.tcl"
+
+set ::user "testuser"
+set ::password "secret"
+
+proc setup_acl {} {
+    foreach_sentinel_id id {
+        assert_equal {OK} [S $id ACL SETUSER $::user >$::password +@all on]
+        assert_equal {OK} [S $id ACL SETUSER default off]
+
+        S $id CLIENT KILL USER default SKIPME no
+        assert_equal {OK} [S $id AUTH $::user $::password]
+    }
+}
+
+proc teardown_acl {} {
+    foreach_sentinel_id id {
+        assert_equal {OK} [S $id ACL SETUSER default on]
+        assert_equal {1} [S $id ACL DELUSER $::user]
+
+        S $id SENTINEL CONFIG SET sentinel-user ""
+        S $id SENTINEL CONFIG SET sentinel-pass ""
+    }
+}
+
+test "(post-init) Set up ACL configuration" {
+    setup_acl
+    assert_equal $::user [S 1 ACL WHOAMI]
+}
+
+test "SENTINEL CONFIG SET handles on-the-fly credentials reconfiguration" {
+    # Make sure we're starting with a broken state...
+    after 5000
+    catch {S 1 SENTINEL CKQUORUM mymaster} err
+    assert_match {*NOQUORUM*} $err
+
+    foreach_sentinel_id id {
+        assert_equal {OK} [S $id SENTINEL CONFIG SET sentinel-user $::user]
+        assert_equal {OK} [S $id SENTINEL CONFIG SET sentinel-pass $::password]
+    }
+
+    after 5000
+    assert_match {*OK*} [S 1 SENTINEL CKQUORUM mymaster]
+}
+
+test "(post-cleanup) Tear down ACL configuration" {
+    teardown_acl
+}
+
diff --git a/redis-stable/tests/sentinel/tests/10-replica-priority.tcl b/redis-stable/tests/sentinel/tests/10-replica-priority.tcl
new file mode 100644
index 00000000..00248a73
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/10-replica-priority.tcl
@@ -0,0 +1,73 @@
+source "../tests/includes/init-tests.tcl"
+
+test "Check acceptable replica-priority values" {
+    foreach_redis_id id {
+        if {$id == $master_id} continue
+
+        # ensure replica-announced accepts yes and no
+        catch {R $id CONFIG SET replica-announced no} e
+        if {$e ne "OK"} {
+            fail "Unable to set replica-announced to no"
+        }
+        catch {R $id CONFIG SET replica-announced yes} e
+        if {$e ne "OK"} {
+            fail "Unable to set replica-announced to yes"
+        }
+
+        # ensure a random value throw error
+        catch {R $id CONFIG SET replica-announced 321} e
+        if {$e eq "OK"} {
+            fail "Able to set replica-announced with something else than yes or no (321) whereas it should not be possible"
+        }
+        catch {R $id CONFIG SET replica-announced a3b2c1} e
+        if {$e eq "OK"} {
+            fail "Able to set replica-announced with something else than yes or no (a3b2c1) whereas it should not be possible"
+        }
+
+        # test only the first redis replica, no need to double test
+        break
+    }
+}
+
+proc 10_test_number_of_replicas {n_replicas_expected} {
+    test "Check sentinel replies with $n_replicas_expected replicas" {
+        # ensure sentinels replies with the right number of replicas
+        foreach_sentinel_id id {
+            # retries 40 x 500ms = 20s as SENTINEL_INFO_PERIOD = 10s
+            set len [llength [S $id SENTINEL REPLICAS mymaster]]
+            wait_for_condition 40 500 {
+                [llength [S $id SENTINEL REPLICAS mymaster]] == $n_replicas_expected
+            } else {
+                fail "Sentinel replies with a wrong number of replicas with replica-announced=yes (expected $n_replicas_expected but got $len) on sentinel $id"
+            }
+        }
+    }
+}
+
+proc 10_set_replica_announced {master_id announced n_replicas} {
+    test "Set replica-announced=$announced on $n_replicas replicas" {
+        set i 0
+        foreach_redis_id id {
+            if {$id == $master_id} continue
+            #puts "set replica-announce=$announced on redis #$id"
+            R $id CONFIG SET replica-announced "$announced"
+            incr i
+            if { $n_replicas!="all" && $i >= $n_replicas } { break }
+        }
+    }
+}
+
+# ensure all replicas are announced
+10_set_replica_announced $master_id "yes" "all"
+# ensure all replicas are announced by sentinels
+10_test_number_of_replicas 4
+
+# ensure the first 2 replicas are not announced
+10_set_replica_announced $master_id "no" 2
+# ensure sentinels are not announcing the first 2 replicas that have been set unannounced
+10_test_number_of_replicas 2
+
+# ensure all replicas are announced
+10_set_replica_announced $master_id "yes" "all"
+# ensure all replicas are not announced by sentinels
+10_test_number_of_replicas 4
diff --git a/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl b/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
new file mode 100755
index 00000000..482b3e0d
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
@@ -0,0 +1,79 @@
+#!/usr/bin/env tclsh
+#
+# This script detects file descriptors that have leaked from a parent process.
+#
+# Our goal is to detect file descriptors that were opened by the parent and
+# not cleaned up prior to exec(), but not file descriptors that were inherited
+# from the grandparent which the parent knows nothing about. To do that, we
+# look up every potential leak and try to match it against open files by the
+# grandparent process.
+
+# Get PID of parent process
+proc get_parent_pid {_pid} {
+    set fd [open "/proc/$_pid/status" "r"]
+    set content [read $fd]
+    close $fd
+
+    if {[regexp {\nPPid:\s+(\d+)} $content _ ppid]} {
+        return $ppid
+    }
+
+    error "failed to get parent pid"
+}
+
+# Read symlink to get info about the specified fd of the specified process.
+# The result can be the file name or an arbitrary string that identifies it.
+# When not able to read, an empty string is returned.
+proc get_fdlink {_pid fd} {
+    if { [catch {set fdlink [file readlink "/proc/$_pid/fd/$fd"]} err] } {
+        return ""
+    }
+    return $fdlink
+}
+
+# Linux only
+set os [exec uname]
+if {$os != "Linux"} {
+    puts "Only Linux is supported."
+    exit 0
+}
+
+if {![info exists env(LEAKED_FDS_FILE)]} {
+    puts "Missing LEAKED_FDS_FILE environment variable."
+    exit 0
+}
+
+set outfile $::env(LEAKED_FDS_FILE)
+set parent_pid [get_parent_pid [pid]]
+set grandparent_pid [get_parent_pid $parent_pid]
+set leaked_fds {}
+
+# Look for fds that were directly inherited from our parent but not from
+# our grandparent (tcl)
+foreach fd [glob -tails -directory "/proc/self/fd" *] {
+    # Ignore stdin/stdout/stderr
+    if {$fd == 0 || $fd == 1 || $fd == 2} {
+        continue
+    }
+
+    set fdlink [get_fdlink "self" $fd]
+    if {$fdlink == ""} {
+        continue
+    }
+
+    # We ignore fds that existed in the grandparent, or fds that don't exist
+    # in our parent (Sentinel process).
+    if {[get_fdlink $grandparent_pid $fd] == $fdlink ||
+	[get_fdlink $parent_pid $fd] != $fdlink} {
+        continue
+    }
+
+    lappend leaked_fds [list $fd $fdlink]
+}
+
+# Produce report only if we found leaks
+if {[llength $leaked_fds] > 0} {
+    set fd [open $outfile "w"]
+    puts $fd [join $leaked_fds "\n"]
+    close $fd
+}
diff --git a/redis-stable/tests/sentinel/tests/includes/init-tests.tcl b/redis-stable/tests/sentinel/tests/includes/init-tests.tcl
new file mode 100644
index 00000000..b5baa256
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/includes/init-tests.tcl
@@ -0,0 +1,80 @@
+# Initialization tests -- most units will start including this.
+
+proc restart_killed_instances {} {
+    foreach type {redis sentinel} {
+        foreach_${type}_id id {
+            if {[get_instance_attrib $type $id pid] == -1} {
+                puts -nonewline "$type/$id "
+                flush stdout
+                restart_instance $type $id
+            }
+        }
+    }
+}
+
+test "(init) Restart killed instances" {
+    restart_killed_instances
+}
+
+test "(init) Remove old master entry from sentinels" {
+    foreach_sentinel_id id {
+        catch {S $id SENTINEL REMOVE mymaster}
+    }
+}
+
+set redis_slaves [expr $::instances_count - 1]
+test "(init) Create a master-slaves cluster of [expr $redis_slaves+1] instances" {
+    create_redis_master_slave_cluster [expr {$redis_slaves+1}]
+}
+set master_id 0
+
+test "(init) Sentinels can start monitoring a master" {
+    set sentinels [llength $::sentinel_instances]
+    set quorum [expr {$sentinels/2+1}]
+    foreach_sentinel_id id {
+        S $id SENTINEL MONITOR mymaster \
+              [get_instance_attrib redis $master_id host] \
+              [get_instance_attrib redis $master_id port] $quorum
+    }
+    foreach_sentinel_id id {
+        assert {[S $id sentinel master mymaster] ne {}}
+        S $id SENTINEL SET mymaster down-after-milliseconds 2000
+        S $id SENTINEL SET mymaster failover-timeout 20000
+        S $id SENTINEL SET mymaster parallel-syncs 10
+        if {$::leaked_fds_file != "" && [exec uname] == "Linux"} {
+            S $id SENTINEL SET mymaster notification-script ../../tests/helpers/check_leaked_fds.tcl
+            S $id SENTINEL SET mymaster client-reconfig-script ../../tests/helpers/check_leaked_fds.tcl
+        }
+    }
+}
+
+test "(init) Sentinels can talk with the master" {
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [catch {S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster}] == 0
+        } else {
+            fail "Sentinel $id can't talk with the master."
+        }
+    }
+}
+
+test "(init) Sentinels are able to auto-discover other sentinels" {
+    set sentinels [llength $::sentinel_instances]
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [dict get [S $id SENTINEL MASTER mymaster] num-other-sentinels] == ($sentinels-1)
+        } else {
+            fail "At least some sentinel can't detect some other sentinel"
+        }
+    }
+}
+
+test "(init) Sentinels are able to auto-discover slaves" {
+    foreach_sentinel_id id {
+        wait_for_condition 1000 50 {
+            [dict get [S $id SENTINEL MASTER mymaster] num-slaves] == $redis_slaves
+        } else {
+            fail "At least some sentinel can't detect some slave"
+        }
+    }
+}
diff --git a/redis-stable/tests/sentinel/tests/includes/sentinel.conf b/redis-stable/tests/sentinel/tests/includes/sentinel.conf
new file mode 100644
index 00000000..94f2804a
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/includes/sentinel.conf
@@ -0,0 +1,11 @@
+# assume master is down after being unresponsive for 20s
+sentinel down-after-milliseconds setmaster 20000
+# reconfigure one slave at a time
+sentinel parallel-syncs setmaster 2
+# wait for 4m before assuming failover went wrong
+sentinel failover-timeout setmaster 240000
+# monitoring set
+sentinel monitor setmaster 10.0.0.1 30000 2
+
+
+
diff --git a/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl b/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
new file mode 100644
index 00000000..b0523506
--- /dev/null
+++ b/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
@@ -0,0 +1,18 @@
+test "(start-init) Flush config and compare rewrite config file lines" {
+    foreach_sentinel_id id {
+        assert_match "OK" [S $id SENTINEL FLUSHCONFIG]
+        set file1 ../tests/includes/sentinel.conf
+        set file2 [file join "sentinel_${id}" "sentinel.conf"] 
+        set fh1 [open $file1 r]
+        set fh2 [open $file2 r]
+        while {[gets $fh1 line1]} {
+            if {[gets $fh2 line2]} {
+                assert [string equal $line1 $line2]
+            } else {
+                fail "sentinel config file rewrite sequence changed"
+            }
+        }
+        close $fh1
+        close $fh2  
+    }
+}
\ No newline at end of file
diff --git a/redis-stable/tests/sentinel/tmp/.gitignore b/redis-stable/tests/sentinel/tmp/.gitignore
new file mode 100644
index 00000000..f581f73e
--- /dev/null
+++ b/redis-stable/tests/sentinel/tmp/.gitignore
@@ -0,0 +1,2 @@
+redis_*
+sentinel_*
diff --git a/redis-stable/tests/support/benchmark.tcl b/redis-stable/tests/support/benchmark.tcl
new file mode 100644
index 00000000..3d08b76f
--- /dev/null
+++ b/redis-stable/tests/support/benchmark.tcl
@@ -0,0 +1,19 @@
+proc redisbenchmark_tls_config {testsdir} {
+    set tlsdir [file join $testsdir tls]
+    set cert [file join $tlsdir client.crt]
+    set key [file join $tlsdir client.key]
+    set cacert [file join $tlsdir ca.crt]
+
+    if {$::tls} {
+        return [list --tls --cert $cert --key $key --cacert $cacert]
+    } else {
+        return {}
+    }
+}
+
+proc redisbenchmark {host port {opts {}}} {
+    set cmd [list src/redis-benchmark -h $host -p $port]
+    lappend cmd {*}[redisbenchmark_tls_config "tests"]
+    lappend cmd {*}$opts
+    return $cmd
+}
diff --git a/redis-stable/tests/support/cli.tcl b/redis-stable/tests/support/cli.tcl
new file mode 100644
index 00000000..19e306e2
--- /dev/null
+++ b/redis-stable/tests/support/cli.tcl
@@ -0,0 +1,19 @@
+proc rediscli_tls_config {testsdir} {
+    set tlsdir [file join $testsdir tls]
+    set cert [file join $tlsdir client.crt]
+    set key [file join $tlsdir client.key]
+    set cacert [file join $tlsdir ca.crt]
+
+    if {$::tls} {
+        return [list --tls --cert $cert --key $key --cacert $cacert]
+    } else {
+        return {}
+    }
+}
+
+proc rediscli {host port {opts {}}} {
+    set cmd [list src/redis-cli -h $host -p $port]
+    lappend cmd {*}[rediscli_tls_config "tests"]
+    lappend cmd {*}$opts
+    return $cmd
+}
diff --git a/redis-stable/tests/support/cluster.tcl b/redis-stable/tests/support/cluster.tcl
new file mode 100644
index 00000000..df4b7f3d
--- /dev/null
+++ b/redis-stable/tests/support/cluster.tcl
@@ -0,0 +1,363 @@
+# Tcl redis cluster client as a wrapper of redis.rb.
+# Copyright (C) 2014 Salvatore Sanfilippo
+# Released under the BSD license like Redis itself
+#
+# Example usage:
+#
+# set c [redis_cluster {127.0.0.1:6379 127.0.0.1:6380}]
+# $c set foo
+# $c get foo
+# $c close
+
+package require Tcl 8.5
+package provide redis_cluster 0.1
+
+namespace eval redis_cluster {}
+set ::redis_cluster::id 0
+array set ::redis_cluster::startup_nodes {}
+array set ::redis_cluster::nodes {}
+array set ::redis_cluster::slots {}
+array set ::redis_cluster::tls {}
+
+# List of "plain" commands, which are commands where the sole key is always
+# the first argument.
+set ::redis_cluster::plain_commands {
+    get set setnx setex psetex append strlen exists setbit getbit
+    setrange getrange substr incr decr rpush lpush rpushx lpushx
+    linsert rpop lpop brpop llen lindex lset lrange ltrim lrem
+    sadd srem sismember smismember scard spop srandmember smembers sscan zadd
+    zincrby zrem zremrangebyscore zremrangebyrank zremrangebylex zrange
+    zrangebyscore zrevrangebyscore zrangebylex zrevrangebylex zcount
+    zlexcount zrevrange zcard zscore zmscore zrank zrevrank zscan hset hsetnx
+    hget hmset hmget hincrby hincrbyfloat hdel hlen hkeys hvals
+    hgetall hexists hscan incrby decrby incrbyfloat getset move
+    expire expireat pexpire pexpireat type ttl pttl persist restore
+    dump bitcount bitpos pfadd pfcount
+}
+
+# Create a cluster client. The nodes are given as a list of host:port. The TLS
+# parameter (1 or 0) is optional and defaults to the global $::tls.
+proc redis_cluster {nodes {tls -1}} {
+    set id [incr ::redis_cluster::id]
+    set ::redis_cluster::startup_nodes($id) $nodes
+    set ::redis_cluster::nodes($id) {}
+    set ::redis_cluster::slots($id) {}
+    set ::redis_cluster::tls($id) [expr $tls == -1 ? $::tls : $tls]
+    set handle [interp alias {} ::redis_cluster::instance$id {} ::redis_cluster::__dispatch__ $id]
+    $handle refresh_nodes_map
+    return $handle
+}
+
+# Totally reset the slots / nodes state for the client, calls
+# CLUSTER NODES in the first startup node available, populates the
+# list of nodes ::redis_cluster::nodes($id) with an hash mapping node
+# ip:port to a representation of the node (another hash), and finally
+# maps ::redis_cluster::slots($id) with an hash mapping slot numbers
+# to node IDs.
+#
+# This function is called when a new Redis Cluster client is initialized
+# and every time we get a -MOVED redirection error.
+proc ::redis_cluster::__method__refresh_nodes_map {id} {
+    # Contact the first responding startup node.
+    set idx 0; # Index of the node that will respond.
+    set errmsg {}
+    foreach start_node $::redis_cluster::startup_nodes($id) {
+        set ip_port [lindex [split $start_node @] 0]
+        lassign [split $ip_port :] start_host start_port
+        set tls $::redis_cluster::tls($id)
+        if {[catch {
+            set r {}
+            set r [redis $start_host $start_port 0 $tls]
+            set nodes_descr [$r cluster nodes]
+            $r close
+        } e]} {
+            if {$r ne {}} {catch {$r close}}
+            incr idx
+            if {[string length $errmsg] < 200} {
+                append errmsg " $ip_port: $e"
+            }
+            continue ; # Try next.
+        } else {
+            break; # Good node found.
+        }
+    }
+
+    if {$idx == [llength $::redis_cluster::startup_nodes($id)]} {
+        error "No good startup node found. $errmsg"
+    }
+
+    # Put the node that responded as first in the list if it is not
+    # already the first.
+    if {$idx != 0} {
+        set l $::redis_cluster::startup_nodes($id)
+        set left [lrange $l 0 [expr {$idx-1}]]
+        set right [lrange $l [expr {$idx+1}] end]
+        set l [concat [lindex $l $idx] $left $right]
+        set ::redis_cluster::startup_nodes($id) $l
+    }
+
+    # Parse CLUSTER NODES output to populate the nodes description.
+    set nodes {} ; # addr -> node description hash.
+    foreach line [split $nodes_descr "\n"] {
+        set line [string trim $line]
+        if {$line eq {}} continue
+        set args [split $line " "]
+        lassign $args nodeid addr flags slaveof pingsent pongrecv configepoch linkstate
+        set slots [lrange $args 8 end]
+        set addr [lindex [split $addr @] 0]
+        if {$addr eq {:0}} {
+            set addr $start_host:$start_port
+        }
+        lassign [split $addr :] host port
+
+        # Connect to the node
+        set link {}
+        set tls $::redis_cluster::tls($id)
+        catch {set link [redis $host $port 0 $tls]}
+
+        # Build this node description as an hash.
+        set node [dict create \
+            id $nodeid \
+            addr $addr \
+            host $host \
+            port $port \
+            flags $flags \
+            slaveof $slaveof \
+            slots $slots \
+            link $link \
+        ]
+        dict set nodes $addr $node
+        lappend ::redis_cluster::startup_nodes($id) $addr
+    }
+
+    # Close all the existing links in the old nodes map, and set the new
+    # map as current.
+    foreach n $::redis_cluster::nodes($id) {
+        catch {
+            [dict get $n link] close
+        }
+    }
+    set ::redis_cluster::nodes($id) $nodes
+
+    # Populates the slots -> nodes map.
+    dict for {addr node} $nodes {
+        foreach slotrange [dict get $node slots] {
+            lassign [split $slotrange -] start end
+            if {$end == {}} {set end $start}
+            for {set j $start} {$j <= $end} {incr j} {
+                dict set ::redis_cluster::slots($id) $j $addr
+            }
+        }
+    }
+
+    # Only retain unique entries in the startup nodes list
+    set ::redis_cluster::startup_nodes($id) [lsort -unique $::redis_cluster::startup_nodes($id)]
+}
+
+# Free a redis_cluster handle.
+proc ::redis_cluster::__method__close {id} {
+    catch {
+        set nodes $::redis_cluster::nodes($id)
+        dict for {addr node} $nodes {
+            catch {
+                [dict get $node link] close
+            }
+        }
+    }
+    catch {unset ::redis_cluster::startup_nodes($id)}
+    catch {unset ::redis_cluster::nodes($id)}
+    catch {unset ::redis_cluster::slots($id)}
+    catch {unset ::redis_cluster::tls($id)}
+    catch {interp alias {} ::redis_cluster::instance$id {}}
+}
+
+proc ::redis_cluster::__method__masternode_for_slot {id slot} {
+    # Get the node mapped to this slot.
+    set node_addr [dict get $::redis_cluster::slots($id) $slot]
+    if {$node_addr eq {}} {
+        error "No mapped node for slot $slot."
+    }
+    return [dict get $::redis_cluster::nodes($id) $node_addr]
+}
+
+proc ::redis_cluster::__method__masternode_notfor_slot {id slot} {
+    # Get a node that is not mapped to this slot.
+    set node_addr [dict get $::redis_cluster::slots($id) $slot]
+    set addrs [dict keys $::redis_cluster::nodes($id)]
+    foreach addr [lshuffle $addrs] {
+        set node [dict get $::redis_cluster::nodes($id) $addr]
+        if {$node_addr ne $addr && [dict get $node slaveof] eq "-"} {
+            return $node
+        }
+    }
+    error "Slot $slot is everywhere"
+}
+
+proc ::redis_cluster::__dispatch__ {id method args} {
+    if {[info command ::redis_cluster::__method__$method] eq {}} {
+        # Get the keys from the command.
+        set keys [::redis_cluster::get_keys_from_command $method $args]
+        if {$keys eq {}} {
+            error "Redis command '$method' is not supported by redis_cluster."
+        }
+
+        # Resolve the keys in the corresponding hash slot they hash to.
+        set slot [::redis_cluster::get_slot_from_keys $keys]
+        if {$slot eq {}} {
+            error "Invalid command: multiple keys not hashing to the same slot."
+        }
+
+        # Get the node mapped to this slot.
+        set node_addr [dict get $::redis_cluster::slots($id) $slot]
+        if {$node_addr eq {}} {
+            error "No mapped node for slot $slot."
+        }
+
+        # Execute the command in the node we think is the slot owner.
+        set retry 100
+        set asking 0
+        while {[incr retry -1]} {
+            if {$retry < 5} {after 100}
+            set node [dict get $::redis_cluster::nodes($id) $node_addr]
+            set link [dict get $node link]
+            if {$asking} {
+                $link ASKING
+                set asking 0
+            }
+            if {[catch {$link $method {*}$args} e]} {
+                if {$link eq {} || \
+                    [string range $e 0 4] eq {MOVED} || \
+                    [string range $e 0 2] eq {I/O} \
+                } {
+                    # MOVED redirection.
+                    ::redis_cluster::__method__refresh_nodes_map $id
+                    set node_addr [dict get $::redis_cluster::slots($id) $slot]
+                    continue
+                } elseif {[string range $e 0 2] eq {ASK}} {
+                    # ASK redirection.
+                    set node_addr [lindex $e 2]
+                    set asking 1
+                    continue
+                } else {
+                    # Non redirecting error.
+                    error $e $::errorInfo $::errorCode
+                }
+            } else {
+                # OK query went fine
+                return $e
+            }
+        }
+        error "Too many redirections or failures contacting Redis Cluster."
+    } else {
+        uplevel 1 [list ::redis_cluster::__method__$method $id] $args
+    }
+}
+
+proc ::redis_cluster::get_keys_from_command {cmd argv} {
+    set cmd [string tolower $cmd]
+    # Most Redis commands get just one key as first argument.
+    if {[lsearch -exact $::redis_cluster::plain_commands $cmd] != -1} {
+        return [list [lindex $argv 0]]
+    }
+
+    # Special handling for other commands
+    switch -exact $cmd {
+        mget {return $argv}
+        eval {return [lrange $argv 2 1+[lindex $argv 1]]}
+        evalsha {return [lrange $argv 2 1+[lindex $argv 1]]}
+    }
+
+    # All the remaining commands are not handled.
+    return {}
+}
+
+# Returns the CRC16 of the specified string.
+# The CRC parameters are described in the Redis Cluster specification.
+set ::redis_cluster::XMODEMCRC16Lookup {
+    0x0000 0x1021 0x2042 0x3063 0x4084 0x50a5 0x60c6 0x70e7
+    0x8108 0x9129 0xa14a 0xb16b 0xc18c 0xd1ad 0xe1ce 0xf1ef
+    0x1231 0x0210 0x3273 0x2252 0x52b5 0x4294 0x72f7 0x62d6
+    0x9339 0x8318 0xb37b 0xa35a 0xd3bd 0xc39c 0xf3ff 0xe3de
+    0x2462 0x3443 0x0420 0x1401 0x64e6 0x74c7 0x44a4 0x5485
+    0xa56a 0xb54b 0x8528 0x9509 0xe5ee 0xf5cf 0xc5ac 0xd58d
+    0x3653 0x2672 0x1611 0x0630 0x76d7 0x66f6 0x5695 0x46b4
+    0xb75b 0xa77a 0x9719 0x8738 0xf7df 0xe7fe 0xd79d 0xc7bc
+    0x48c4 0x58e5 0x6886 0x78a7 0x0840 0x1861 0x2802 0x3823
+    0xc9cc 0xd9ed 0xe98e 0xf9af 0x8948 0x9969 0xa90a 0xb92b
+    0x5af5 0x4ad4 0x7ab7 0x6a96 0x1a71 0x0a50 0x3a33 0x2a12
+    0xdbfd 0xcbdc 0xfbbf 0xeb9e 0x9b79 0x8b58 0xbb3b 0xab1a
+    0x6ca6 0x7c87 0x4ce4 0x5cc5 0x2c22 0x3c03 0x0c60 0x1c41
+    0xedae 0xfd8f 0xcdec 0xddcd 0xad2a 0xbd0b 0x8d68 0x9d49
+    0x7e97 0x6eb6 0x5ed5 0x4ef4 0x3e13 0x2e32 0x1e51 0x0e70
+    0xff9f 0xefbe 0xdfdd 0xcffc 0xbf1b 0xaf3a 0x9f59 0x8f78
+    0x9188 0x81a9 0xb1ca 0xa1eb 0xd10c 0xc12d 0xf14e 0xe16f
+    0x1080 0x00a1 0x30c2 0x20e3 0x5004 0x4025 0x7046 0x6067
+    0x83b9 0x9398 0xa3fb 0xb3da 0xc33d 0xd31c 0xe37f 0xf35e
+    0x02b1 0x1290 0x22f3 0x32d2 0x4235 0x5214 0x6277 0x7256
+    0xb5ea 0xa5cb 0x95a8 0x8589 0xf56e 0xe54f 0xd52c 0xc50d
+    0x34e2 0x24c3 0x14a0 0x0481 0x7466 0x6447 0x5424 0x4405
+    0xa7db 0xb7fa 0x8799 0x97b8 0xe75f 0xf77e 0xc71d 0xd73c
+    0x26d3 0x36f2 0x0691 0x16b0 0x6657 0x7676 0x4615 0x5634
+    0xd94c 0xc96d 0xf90e 0xe92f 0x99c8 0x89e9 0xb98a 0xa9ab
+    0x5844 0x4865 0x7806 0x6827 0x18c0 0x08e1 0x3882 0x28a3
+    0xcb7d 0xdb5c 0xeb3f 0xfb1e 0x8bf9 0x9bd8 0xabbb 0xbb9a
+    0x4a75 0x5a54 0x6a37 0x7a16 0x0af1 0x1ad0 0x2ab3 0x3a92
+    0xfd2e 0xed0f 0xdd6c 0xcd4d 0xbdaa 0xad8b 0x9de8 0x8dc9
+    0x7c26 0x6c07 0x5c64 0x4c45 0x3ca2 0x2c83 0x1ce0 0x0cc1
+    0xef1f 0xff3e 0xcf5d 0xdf7c 0xaf9b 0xbfba 0x8fd9 0x9ff8
+    0x6e17 0x7e36 0x4e55 0x5e74 0x2e93 0x3eb2 0x0ed1 0x1ef0
+}
+
+proc ::redis_cluster::crc16 {s} {
+    set s [encoding convertto ascii $s]
+    set crc 0
+    foreach char [split $s {}] {
+        scan $char %c byte
+        set crc [expr {(($crc<<8)&0xffff) ^ [lindex $::redis_cluster::XMODEMCRC16Lookup [expr {(($crc>>8)^$byte) & 0xff}]]}]
+    }
+    return $crc
+}
+
+# Hash a single key returning the slot it belongs to, Implemented hash
+# tags as described in the Redis Cluster specification.
+proc ::redis_cluster::hash {key} {
+    set keylen [string length $key]
+    set s {}
+    set e {}
+    for {set s 0} {$s < $keylen} {incr s} {
+        if {[string index $key $s] eq "\{"} break
+    }
+
+    if {[expr {$s == $keylen}]} {
+        set res [expr {[crc16 $key] & 16383}]
+        return $res
+    }
+
+    for {set e [expr {$s+1}]} {$e < $keylen} {incr e} {
+        if {[string index $key $e] == "\}"} break
+    }
+
+    if {$e == $keylen || $e == [expr {$s+1}]} {
+        set res [expr {[crc16 $key] & 16383}]
+        return $res
+    }
+
+    set key_sub [string range $key [expr {$s+1}] [expr {$e-1}]]
+    return [expr {[crc16 $key_sub] & 16383}]
+}
+
+# Return the slot the specified keys hash to.
+# If the keys hash to multiple slots, an empty string is returned to
+# signal that the command can't be run in Redis Cluster.
+proc ::redis_cluster::get_slot_from_keys {keys} {
+    set slot {}
+    foreach k $keys {
+        set s [::redis_cluster::hash $k]
+        if {$slot eq {}} {
+            set slot $s
+        } elseif {$slot != $s} {
+            return {} ; # Error
+        }
+    }
+    return $slot
+}
diff --git a/redis-stable/tests/support/redis.tcl b/redis-stable/tests/support/redis.tcl
new file mode 100644
index 00000000..978163e9
--- /dev/null
+++ b/redis-stable/tests/support/redis.tcl
@@ -0,0 +1,368 @@
+# Tcl client library - used by the Redis test
+# Copyright (C) 2009-2014 Salvatore Sanfilippo
+# Released under the BSD license like Redis itself
+#
+# Example usage:
+#
+# set r [redis 127.0.0.1 6379]
+# $r lpush mylist foo
+# $r lpush mylist bar
+# $r lrange mylist 0 -1
+# $r close
+#
+# Non blocking usage example:
+#
+# proc handlePong {r type reply} {
+#     puts "PONG $type '$reply'"
+#     if {$reply ne "PONG"} {
+#         $r ping [list handlePong]
+#     }
+# }
+#
+# set r [redis]
+# $r blocking 0
+# $r get fo [list handlePong]
+#
+# vwait forever
+
+package require Tcl 8.5
+package provide redis 0.1
+
+namespace eval redis {}
+set ::redis::id 0
+array set ::redis::fd {}
+array set ::redis::addr {}
+array set ::redis::blocking {}
+array set ::redis::deferred {}
+array set ::redis::readraw {}
+array set ::redis::reconnect {}
+array set ::redis::tls {}
+array set ::redis::callback {}
+array set ::redis::state {} ;# State in non-blocking reply reading
+array set ::redis::statestack {} ;# Stack of states, for nested mbulks
+
+proc redis {{server 127.0.0.1} {port 6379} {defer 0} {tls 0} {tlsoptions {}} {readraw 0}} {
+    if {$tls} {
+        package require tls
+        ::tls::init \
+            -cafile "$::tlsdir/ca.crt" \
+            -certfile "$::tlsdir/client.crt" \
+            -keyfile "$::tlsdir/client.key" \
+            {*}$tlsoptions
+        set fd [::tls::socket $server $port]
+    } else {
+        set fd [socket $server $port]
+    }
+    fconfigure $fd -translation binary
+    set id [incr ::redis::id]
+    set ::redis::fd($id) $fd
+    set ::redis::addr($id) [list $server $port]
+    set ::redis::blocking($id) 1
+    set ::redis::deferred($id) $defer
+    set ::redis::readraw($id) $readraw
+    set ::redis::reconnect($id) 0
+    set ::redis::tls($id) $tls
+    ::redis::redis_reset_state $id
+    interp alias {} ::redis::redisHandle$id {} ::redis::__dispatch__ $id
+}
+
+# This is a wrapper to the actual dispatching procedure that handles
+# reconnection if needed.
+proc ::redis::__dispatch__ {id method args} {
+    set errorcode [catch {::redis::__dispatch__raw__ $id $method $args} retval]
+    if {$errorcode && $::redis::reconnect($id) && $::redis::fd($id) eq {}} {
+        # Try again if the connection was lost.
+        # FIXME: we don't re-select the previously selected DB, nor we check
+        # if we are inside a transaction that needs to be re-issued from
+        # scratch.
+        set errorcode [catch {::redis::__dispatch__raw__ $id $method $args} retval]
+    }
+    return -code $errorcode $retval
+}
+
+proc ::redis::__dispatch__raw__ {id method argv} {
+    set fd $::redis::fd($id)
+
+    # Reconnect the link if needed.
+    if {$fd eq {}} {
+        lassign $::redis::addr($id) host port
+        if {$::redis::tls($id)} {
+            set ::redis::fd($id) [::tls::socket $host $port]
+        } else {
+            set ::redis::fd($id) [socket $host $port]
+        }
+        fconfigure $::redis::fd($id) -translation binary
+        set fd $::redis::fd($id)
+    }
+
+    set blocking $::redis::blocking($id)
+    set deferred $::redis::deferred($id)
+    if {$blocking == 0} {
+        if {[llength $argv] == 0} {
+            error "Please provide a callback in non-blocking mode"
+        }
+        set callback [lindex $argv end]
+        set argv [lrange $argv 0 end-1]
+    }
+    if {[info command ::redis::__method__$method] eq {}} {
+        set cmd "*[expr {[llength $argv]+1}]\r\n"
+        append cmd "$[string length $method]\r\n$method\r\n"
+        foreach a $argv {
+            append cmd "$[string length $a]\r\n$a\r\n"
+        }
+        ::redis::redis_write $fd $cmd
+        if {[catch {flush $fd}]} {
+            catch {close $fd}
+            set ::redis::fd($id) {}
+            return -code error "I/O error reading reply"
+        }
+
+        if {!$deferred} {
+            if {$blocking} {
+                ::redis::redis_read_reply $id $fd
+            } else {
+                # Every well formed reply read will pop an element from this
+                # list and use it as a callback. So pipelining is supported
+                # in non blocking mode.
+                lappend ::redis::callback($id) $callback
+                fileevent $fd readable [list ::redis::redis_readable $fd $id]
+            }
+        }
+    } else {
+        uplevel 1 [list ::redis::__method__$method $id $fd] $argv
+    }
+}
+
+proc ::redis::__method__blocking {id fd val} {
+    set ::redis::blocking($id) $val
+    fconfigure $fd -blocking $val
+}
+
+proc ::redis::__method__reconnect {id fd val} {
+    set ::redis::reconnect($id) $val
+}
+
+proc ::redis::__method__read {id fd} {
+    ::redis::redis_read_reply $id $fd
+}
+
+proc ::redis::__method__write {id fd buf} {
+    ::redis::redis_write $fd $buf
+}
+
+proc ::redis::__method__flush {id fd} {
+    flush $fd
+}
+
+proc ::redis::__method__close {id fd} {
+    catch {close $fd}
+    catch {unset ::redis::fd($id)}
+    catch {unset ::redis::addr($id)}
+    catch {unset ::redis::blocking($id)}
+    catch {unset ::redis::deferred($id)}
+    catch {unset ::redis::readraw($id)}
+    catch {unset ::redis::reconnect($id)}
+    catch {unset ::redis::tls($id)}
+    catch {unset ::redis::state($id)}
+    catch {unset ::redis::statestack($id)}
+    catch {unset ::redis::callback($id)}
+    catch {interp alias {} ::redis::redisHandle$id {}}
+}
+
+proc ::redis::__method__channel {id fd} {
+    return $fd
+}
+
+proc ::redis::__method__deferred {id fd val} {
+    set ::redis::deferred($id) $val
+}
+
+proc ::redis::__method__readraw {id fd val} {
+    set ::redis::readraw($id) $val
+}
+
+proc ::redis::redis_write {fd buf} {
+    puts -nonewline $fd $buf
+}
+
+proc ::redis::redis_writenl {fd buf} {
+    redis_write $fd $buf
+    redis_write $fd "\r\n"
+    flush $fd
+}
+
+proc ::redis::redis_readnl {fd len} {
+    set buf [read $fd $len]
+    read $fd 2 ; # discard CR LF
+    return $buf
+}
+
+proc ::redis::redis_bulk_read {fd} {
+    set count [redis_read_line $fd]
+    if {$count == -1} return {}
+    set buf [redis_readnl $fd $count]
+    return $buf
+}
+
+proc ::redis::redis_multi_bulk_read {id fd} {
+    set count [redis_read_line $fd]
+    if {$count == -1} return {}
+    set l {}
+    set err {}
+    for {set i 0} {$i < $count} {incr i} {
+        if {[catch {
+            lappend l [redis_read_reply $id $fd]
+        } e] && $err eq {}} {
+            set err $e
+        }
+    }
+    if {$err ne {}} {return -code error $err}
+    return $l
+}
+
+proc ::redis::redis_read_map {id fd} {
+    set count [redis_read_line $fd]
+    if {$count == -1} return {}
+    set d {}
+    set err {}
+    for {set i 0} {$i < $count} {incr i} {
+        if {[catch {
+            set k [redis_read_reply $id $fd] ; # key
+            set v [redis_read_reply $id $fd] ; # value
+            dict set d $k $v
+        } e] && $err eq {}} {
+            set err $e
+        }
+    }
+    if {$err ne {}} {return -code error $err}
+    return $d
+}
+
+proc ::redis::redis_read_line fd {
+    string trim [gets $fd]
+}
+
+proc ::redis::redis_read_null fd {
+    gets $fd
+    return {}
+}
+
+proc ::redis::redis_read_bool fd {
+    set v [redis_read_line $fd]
+    if {$v == "t"} {return 1}
+    if {$v == "f"} {return 0}
+    return -code error "Bad protocol, '$v' as bool type"
+}
+
+proc ::redis::redis_read_reply {id fd} {
+    if {$::redis::readraw($id)} {
+        return [redis_read_line $fd]
+    }
+
+    while {1} {
+        set type [read $fd 1]
+        switch -exact -- $type {
+            _ {return [redis_read_null $fd]}
+            : -
+            ( -
+            + {return [redis_read_line $fd]}
+            , {return [expr {double([redis_read_line $fd])}]}
+            # {return [redis_read_bool $fd]}
+            - {return -code error [redis_read_line $fd]}
+            $ {return [redis_bulk_read $fd]}
+            > -
+            ~ -
+            * {return [redis_multi_bulk_read $id $fd]}
+            % {return [redis_read_map $id $fd]}
+            | {
+                # ignore attributes for now (nowhere to store them)
+                redis_read_map $id $fd
+                continue
+            }
+            default {
+                if {$type eq {}} {
+                    catch {close $fd}
+                    set ::redis::fd($id) {}
+                    return -code error "I/O error reading reply"
+                }
+                return -code error "Bad protocol, '$type' as reply type byte"
+            }
+        }
+    }
+}
+
+proc ::redis::redis_reset_state id {
+    set ::redis::state($id) [dict create buf {} mbulk -1 bulk -1 reply {}]
+    set ::redis::statestack($id) {}
+}
+
+proc ::redis::redis_call_callback {id type reply} {
+    set cb [lindex $::redis::callback($id) 0]
+    set ::redis::callback($id) [lrange $::redis::callback($id) 1 end]
+    uplevel #0 $cb [list ::redis::redisHandle$id $type $reply]
+    ::redis::redis_reset_state $id
+}
+
+# Read a reply in non-blocking mode.
+proc ::redis::redis_readable {fd id} {
+    if {[eof $fd]} {
+        redis_call_callback $id eof {}
+        ::redis::__method__close $id $fd
+        return
+    }
+    if {[dict get $::redis::state($id) bulk] == -1} {
+        set line [gets $fd]
+        if {$line eq {}} return ;# No complete line available, return
+        switch -exact -- [string index $line 0] {
+            : -
+            + {redis_call_callback $id reply [string range $line 1 end-1]}
+            - {redis_call_callback $id err [string range $line 1 end-1]}
+            $ {
+                dict set ::redis::state($id) bulk \
+                    [expr [string range $line 1 end-1]+2]
+                if {[dict get $::redis::state($id) bulk] == 1} {
+                    # We got a $-1, hack the state to play well with this.
+                    dict set ::redis::state($id) bulk 2
+                    dict set ::redis::state($id) buf "\r\n"
+                    ::redis::redis_readable $fd $id
+                }
+            }
+            * {
+                dict set ::redis::state($id) mbulk [string range $line 1 end-1]
+                # Handle *-1
+                if {[dict get $::redis::state($id) mbulk] == -1} {
+                    redis_call_callback $id reply {}
+                }
+            }
+            default {
+                redis_call_callback $id err \
+                    "Bad protocol, $type as reply type byte"
+            }
+        }
+    } else {
+        set totlen [dict get $::redis::state($id) bulk]
+        set buflen [string length [dict get $::redis::state($id) buf]]
+        set toread [expr {$totlen-$buflen}]
+        set data [read $fd $toread]
+        set nread [string length $data]
+        dict append ::redis::state($id) buf $data
+        # Check if we read a complete bulk reply
+        if {[string length [dict get $::redis::state($id) buf]] ==
+            [dict get $::redis::state($id) bulk]} {
+            if {[dict get $::redis::state($id) mbulk] == -1} {
+                redis_call_callback $id reply \
+                    [string range [dict get $::redis::state($id) buf] 0 end-2]
+            } else {
+                dict with ::redis::state($id) {
+                    lappend reply [string range $buf 0 end-2]
+                    incr mbulk -1
+                    set bulk -1
+                }
+                if {[dict get $::redis::state($id) mbulk] == 0} {
+                    redis_call_callback $id reply \
+                        [dict get $::redis::state($id) reply]
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/support/server.tcl b/redis-stable/tests/support/server.tcl
new file mode 100644
index 00000000..e8fa3e6f
--- /dev/null
+++ b/redis-stable/tests/support/server.tcl
@@ -0,0 +1,623 @@
+set ::global_overrides {}
+set ::tags {}
+set ::valgrind_errors {}
+
+proc start_server_error {config_file error} {
+    set err {}
+    append err "Can't start the Redis server\n"
+    append err "CONFIGURATION:"
+    append err [exec cat $config_file]
+    append err "\nERROR:"
+    append err [string trim $error]
+    send_data_packet $::test_server_fd err $err
+}
+
+proc check_valgrind_errors stderr {
+    set res [find_valgrind_errors $stderr true]
+    if {$res != ""} {
+        send_data_packet $::test_server_fd err "Valgrind error: $res\n"
+    }
+}
+
+proc clean_persistence config {
+    # we may wanna keep the logs for later, but let's clean the persistence
+    # files right away, since they can accumulate and take up a lot of space
+    set config [dict get $config "config"]
+    set rdb [format "%s/%s" [dict get $config "dir"] "dump.rdb"]
+    set aof [format "%s/%s" [dict get $config "dir"] "appendonly.aof"]
+    catch {exec rm -rf $rdb}
+    catch {exec rm -rf $aof}
+}
+
+proc kill_server config {
+    # nothing to kill when running against external server
+    if {$::external} return
+
+    # nevermind if its already dead
+    if {![is_alive $config]} {
+        # Check valgrind errors if needed
+        if {$::valgrind} {
+            check_valgrind_errors [dict get $config stderr]
+        }
+        return
+    }
+    set pid [dict get $config pid]
+
+    # check for leaks
+    if {![dict exists $config "skipleaks"]} {
+        catch {
+            if {[string match {*Darwin*} [exec uname -a]]} {
+                tags {"leaks"} {
+                    test "Check for memory leaks (pid $pid)" {
+                        set output {0 leaks}
+                        catch {exec leaks $pid} output option
+                        # In a few tests we kill the server process, so leaks will not find it.
+                        # It'll exits with exit code >1 on error, so we ignore these.
+                        if {[dict exists $option -errorcode]} {
+                            set details [dict get $option -errorcode]
+                            if {[lindex $details 0] eq "CHILDSTATUS"} {
+                                  set status [lindex $details 2]
+                                  if {$status > 1} {
+                                      set output "0 leaks"
+                                  }
+                            }
+                        }
+                        set output
+                    } {*0 leaks*}
+                }
+            }
+        }
+    }
+
+    # kill server and wait for the process to be totally exited
+    send_data_packet $::test_server_fd server-killing $pid
+    catch {exec kill $pid}
+    # Node might have been stopped in the test
+    catch {exec kill -SIGCONT $pid}
+    if {$::valgrind} {
+        set max_wait 60000
+    } else {
+        set max_wait 10000
+    }
+    while {[is_alive $config]} {
+        incr wait 10
+
+        if {$wait >= $max_wait} {
+            puts "Forcing process $pid to exit..."
+            catch {exec kill -KILL $pid}
+        } elseif {$wait % 1000 == 0} {
+            puts "Waiting for process $pid to exit..."
+        }
+        after 10
+    }
+
+    # Check valgrind errors if needed
+    if {$::valgrind} {
+        check_valgrind_errors [dict get $config stderr]
+    }
+
+    # Remove this pid from the set of active pids in the test server.
+    send_data_packet $::test_server_fd server-killed $pid
+}
+
+proc is_alive config {
+    set pid [dict get $config pid]
+    if {[catch {exec kill -0 $pid} err]} {
+        return 0
+    } else {
+        return 1
+    }
+}
+
+proc ping_server {host port} {
+    set retval 0
+    if {[catch {
+        if {$::tls} {
+            set fd [::tls::socket $host $port] 
+        } else {
+            set fd [socket $host $port]
+        }
+        fconfigure $fd -translation binary
+        puts $fd "PING\r\n"
+        flush $fd
+        set reply [gets $fd]
+        if {[string range $reply 0 0] eq {+} ||
+            [string range $reply 0 0] eq {-}} {
+            set retval 1
+        }
+        close $fd
+    } e]} {
+        if {$::verbose} {
+            puts -nonewline "."
+        }
+    } else {
+        if {$::verbose} {
+            puts -nonewline "ok"
+        }
+    }
+    return $retval
+}
+
+# Return 1 if the server at the specified addr is reachable by PING, otherwise
+# returns 0. Performs a try every 50 milliseconds for the specified number
+# of retries.
+proc server_is_up {host port retrynum} {
+    after 10 ;# Use a small delay to make likely a first-try success.
+    set retval 0
+    while {[incr retrynum -1]} {
+        if {[catch {ping_server $host $port} ping]} {
+            set ping 0
+        }
+        if {$ping} {return 1}
+        after 50
+    }
+    return 0
+}
+
+# Check if current ::tags match requested tags. If ::allowtags are used,
+# there must be some intersection. If ::denytags are used, no intersection
+# is allowed. Returns 1 if tags are acceptable or 0 otherwise, in which
+# case err_return names a return variable for the message to be logged.
+proc tags_acceptable {err_return} {
+    upvar $err_return err
+
+    # If tags are whitelisted, make sure there's match
+    if {[llength $::allowtags] > 0} {
+        set matched 0
+        foreach tag $::allowtags {
+            if {[lsearch $::tags $tag] >= 0} {
+                incr matched
+            }
+        }
+        if {$matched < 1} {
+            set err "Tag: none of the tags allowed"
+            return 0
+        }
+    }
+
+    foreach tag $::denytags {
+        if {[lsearch $::tags $tag] >= 0} {
+            set err "Tag: $tag denied"
+            return 0
+        }
+    }
+
+    return 1
+}
+
+# doesn't really belong here, but highly coupled to code in start_server
+proc tags {tags code} {
+    # If we 'tags' contain multiple tags, quoted and seperated by spaces,
+    # we want to get rid of the quotes in order to have a proper list
+    set tags [string map { \" "" } $tags]
+    set ::tags [concat $::tags $tags]
+    if {![tags_acceptable err]} {
+        incr ::num_aborted
+        send_data_packet $::test_server_fd ignore $err
+        set ::tags [lrange $::tags 0 end-[llength $tags]]
+        return
+    }
+    uplevel 1 $code
+    set ::tags [lrange $::tags 0 end-[llength $tags]]
+}
+
+# Write the configuration in the dictionary 'config' in the specified
+# file name.
+proc create_server_config_file {filename config} {
+    set fp [open $filename w+]
+    foreach directive [dict keys $config] {
+        puts -nonewline $fp "$directive "
+        puts $fp [dict get $config $directive]
+    }
+    close $fp
+}
+
+proc spawn_server {config_file stdout stderr} {
+    if {$::valgrind} {
+        set pid [exec valgrind --track-origins=yes --trace-children=yes --suppressions=[pwd]/src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full src/redis-server $config_file >> $stdout 2>> $stderr &]
+    } elseif ($::stack_logging) {
+        set pid [exec /usr/bin/env MallocStackLogging=1 MallocLogFile=/tmp/malloc_log.txt src/redis-server $config_file >> $stdout 2>> $stderr &]
+    } else {
+        set pid [exec src/redis-server $config_file >> $stdout 2>> $stderr &]
+    }
+
+    if {$::wait_server} {
+        set msg "server started PID: $pid. press any key to continue..."
+        puts $msg
+        read stdin 1
+    }
+
+    # Tell the test server about this new instance.
+    send_data_packet $::test_server_fd server-spawned $pid
+    return $pid
+}
+
+# Wait for actual startup, return 1 if port is busy, 0 otherwise
+proc wait_server_started {config_file stdout pid} {
+    set checkperiod 100; # Milliseconds
+    set maxiter [expr {120*1000/$checkperiod}] ; # Wait up to 2 minutes.
+    set port_busy 0
+    while 1 {
+        if {[regexp -- " PID: $pid" [exec cat $stdout]]} {
+            break
+        }
+        after $checkperiod
+        incr maxiter -1
+        if {$maxiter == 0} {
+            start_server_error $config_file "No PID detected in log $stdout"
+            puts "--- LOG CONTENT ---"
+            puts [exec cat $stdout]
+            puts "-------------------"
+            break
+        }
+
+        # Check if the port is actually busy and the server failed
+        # for this reason.
+        if {[regexp {Failed listening on port} [exec cat $stdout]]} {
+            set port_busy 1
+            break
+        }
+    }
+    return $port_busy
+}
+
+proc dump_server_log {srv} {
+    set pid [dict get $srv "pid"]
+    puts "\n===== Start of server log (pid $pid) =====\n"
+    puts [exec cat [dict get $srv "stdout"]]
+    puts "===== End of server log (pid $pid) =====\n"
+}
+
+proc start_server {options {code undefined}} {
+    # setup defaults
+    set baseconfig "default.conf"
+    set overrides {}
+    set omit {}
+    set tags {}
+    set keep_persistence false
+
+    # parse options
+    foreach {option value} $options {
+        switch $option {
+            "config" {
+                set baseconfig $value
+            }
+            "overrides" {
+                set overrides $value
+            }
+            "omit" {
+                set omit $value
+            }
+            "tags" {
+                # If we 'tags' contain multiple tags, quoted and seperated by spaces,
+                # we want to get rid of the quotes in order to have a proper list
+                set tags [string map { \" "" } $value]
+                set ::tags [concat $::tags $tags]
+            }
+            "keep_persistence" {
+                set keep_persistence $value
+            }
+            default {
+                error "Unknown option $option"
+            }
+        }
+    }
+
+    # We skip unwanted tags
+    if {![tags_acceptable err]} {
+        incr ::num_aborted
+        send_data_packet $::test_server_fd ignore $err
+        set ::tags [lrange $::tags 0 end-[llength $tags]]
+        return
+    }
+
+    # If we are running against an external server, we just push the
+    # host/port pair in the stack the first time
+    if {$::external} {
+        if {[llength $::servers] == 0} {
+            set srv {}
+            dict set srv "host" $::host
+            dict set srv "port" $::port
+            set client [redis $::host $::port 0 $::tls]
+            dict set srv "client" $client
+            $client select 9
+
+            set config {}
+            dict set config "port" $::port
+            dict set srv "config" $config
+
+            # append the server to the stack
+            lappend ::servers $srv
+        }
+        r flushall
+        if {[catch {set retval [uplevel 1 $code]} error]} {
+            if {$::durable} {
+                set msg [string range $error 10 end]
+                lappend details $msg
+                lappend details $::errorInfo
+                lappend ::tests_failed $details
+
+                incr ::num_failed
+                send_data_packet $::test_server_fd err [join $details "\n"]
+            } else {
+                # Re-raise, let handler up the stack take care of this.
+                error $error $::errorInfo
+            }
+        }
+        set ::tags [lrange $::tags 0 end-[llength $tags]]
+        return
+    }
+
+    set data [split [exec cat "tests/assets/$baseconfig"] "\n"]
+    set config {}
+    if {$::tls} {
+        dict set config "tls-cert-file" [format "%s/tests/tls/server.crt" [pwd]]
+        dict set config "tls-key-file" [format "%s/tests/tls/server.key" [pwd]]
+        dict set config "tls-client-cert-file" [format "%s/tests/tls/client.crt" [pwd]]
+        dict set config "tls-client-key-file" [format "%s/tests/tls/client.key" [pwd]]
+        dict set config "tls-dh-params-file" [format "%s/tests/tls/redis.dh" [pwd]]
+        dict set config "tls-ca-cert-file" [format "%s/tests/tls/ca.crt" [pwd]]
+        dict set config "loglevel" "debug"
+    }
+    foreach line $data {
+        if {[string length $line] > 0 && [string index $line 0] ne "#"} {
+            set elements [split $line " "]
+            set directive [lrange $elements 0 0]
+            set arguments [lrange $elements 1 end]
+            dict set config $directive $arguments
+        }
+    }
+
+    # use a different directory every time a server is started
+    dict set config dir [tmpdir server]
+
+    # start every server on a different port
+    set port [find_available_port $::baseport $::portcount]
+    if {$::tls} {
+        dict set config "port" 0
+        dict set config "tls-port" $port
+        dict set config "tls-cluster" "yes"
+        dict set config "tls-replication" "yes"
+    } else {
+        dict set config port $port
+    }
+
+    set unixsocket [file normalize [format "%s/%s" [dict get $config "dir"] "socket"]]
+    dict set config "unixsocket" $unixsocket
+
+    # apply overrides from global space and arguments
+    foreach {directive arguments} [concat $::global_overrides $overrides] {
+        dict set config $directive $arguments
+    }
+
+    # remove directives that are marked to be omitted
+    foreach directive $omit {
+        dict unset config $directive
+    }
+
+    # write new configuration to temporary file
+    set config_file [tmpfile redis.conf]
+    create_server_config_file $config_file $config
+
+    set stdout [format "%s/%s" [dict get $config "dir"] "stdout"]
+    set stderr [format "%s/%s" [dict get $config "dir"] "stderr"]
+
+    # if we're inside a test, write the test name to the server log file
+    if {[info exists ::cur_test]} {
+        set fd [open $stdout "a+"]
+        puts $fd "### Starting server for test $::cur_test"
+        close $fd
+    }
+
+    # We need a loop here to retry with different ports.
+    set server_started 0
+    while {$server_started == 0} {
+        if {$::verbose} {
+            puts -nonewline "=== ($tags) Starting server ${::host}:${port} "
+        }
+
+        send_data_packet $::test_server_fd "server-spawning" "port $port"
+
+        set pid [spawn_server $config_file $stdout $stderr]
+
+        # check that the server actually started
+        set port_busy [wait_server_started $config_file $stdout $pid]
+
+        # Sometimes we have to try a different port, even if we checked
+        # for availability. Other test clients may grab the port before we
+        # are able to do it for example.
+        if {$port_busy} {
+            puts "Port $port was already busy, trying another port..."
+            set port [find_available_port $::baseport $::portcount]
+            if {$::tls} {
+                dict set config "tls-port" $port
+            } else {
+                dict set config port $port
+            }
+            create_server_config_file $config_file $config
+
+            # Truncate log so wait_server_started will not be looking at
+            # output of the failed server.
+            close [open $stdout "w"]
+
+            continue; # Try again
+        }
+
+        if {$::valgrind} {set retrynum 1000} else {set retrynum 100}
+        if {$code ne "undefined"} {
+            set serverisup [server_is_up $::host $port $retrynum]
+        } else {
+            set serverisup 1
+        }
+
+        if {$::verbose} {
+            puts ""
+        }
+
+        if {!$serverisup} {
+            set err {}
+            append err [exec cat $stdout] "\n" [exec cat $stderr]
+            start_server_error $config_file $err
+            return
+        }
+        set server_started 1
+    }
+
+    # setup properties to be able to initialize a client object
+    set port_param [expr $::tls ? {"tls-port"} : {"port"}]
+    set host $::host
+    if {[dict exists $config bind]} { set host [dict get $config bind] }
+    if {[dict exists $config $port_param]} { set port [dict get $config $port_param] }
+
+    # setup config dict
+    dict set srv "config_file" $config_file
+    dict set srv "config" $config
+    dict set srv "pid" $pid
+    dict set srv "host" $host
+    dict set srv "port" $port
+    dict set srv "stdout" $stdout
+    dict set srv "stderr" $stderr
+    dict set srv "unixsocket" $unixsocket
+
+    # if a block of code is supplied, we wait for the server to become
+    # available, create a client object and kill the server afterwards
+    if {$code ne "undefined"} {
+        set line [exec head -n1 $stdout]
+        if {[string match {*already in use*} $line]} {
+            error_and_quit $config_file $line
+        }
+
+        while 1 {
+            # check that the server actually started and is ready for connections
+            if {[count_message_lines $stdout "Ready to accept"] > 0} {
+                break
+            }
+            after 10
+        }
+
+        # append the server to the stack
+        lappend ::servers $srv
+
+        # connect client (after server dict is put on the stack)
+        reconnect
+
+        # remember previous num_failed to catch new errors
+        set prev_num_failed $::num_failed
+
+        # execute provided block
+        set num_tests $::num_tests
+        if {[catch { uplevel 1 $code } error]} {
+            set backtrace $::errorInfo
+            set assertion [string match "assertion:*" $error]
+
+            # fetch srv back from the server list, in case it was restarted by restart_server (new PID)
+            set srv [lindex $::servers end]
+
+            # pop the server object
+            set ::servers [lrange $::servers 0 end-1]
+
+            # Kill the server without checking for leaks
+            dict set srv "skipleaks" 1
+            kill_server $srv
+
+            if {$::dump_logs && $assertion} {
+                # if we caught an assertion ($::num_failed isn't incremented yet)
+                # this happens when the test spawns a server and not the other way around
+                dump_server_log $srv
+            } else {
+                # Print crash report from log
+                set crashlog [crashlog_from_file [dict get $srv "stdout"]]
+                if {[string length $crashlog] > 0} {
+                    puts [format "\nLogged crash report (pid %d):" [dict get $srv "pid"]]
+                    puts "$crashlog"
+                    puts ""
+                }
+            }
+
+            if {!$assertion && $::durable} {
+                # durable is meant to prevent the whole tcl test from exiting on
+                # an exception. an assertion will be caught by the test proc.
+                set msg [string range $error 10 end]
+                lappend details $msg
+                lappend details $backtrace
+                lappend ::tests_failed $details
+
+                incr ::num_failed
+                send_data_packet $::test_server_fd err [join $details "\n"]
+            } else {
+                # Re-raise, let handler up the stack take care of this.
+                error $error $backtrace
+            }
+        } else {
+            if {$::dump_logs && $prev_num_failed != $::num_failed} {
+                dump_server_log $srv
+            }
+        }
+
+        # fetch srv back from the server list, in case it was restarted by restart_server (new PID)
+        set srv [lindex $::servers end]
+
+        # Don't do the leak check when no tests were run
+        if {$num_tests == $::num_tests} {
+            dict set srv "skipleaks" 1
+        }
+
+        # pop the server object
+        set ::servers [lrange $::servers 0 end-1]
+
+        set ::tags [lrange $::tags 0 end-[llength $tags]]
+        kill_server $srv
+        if {!$keep_persistence} {
+            clean_persistence $srv
+        }
+        set _ ""
+    } else {
+        set ::tags [lrange $::tags 0 end-[llength $tags]]
+        set _ $srv
+    }
+}
+
+proc restart_server {level wait_ready rotate_logs} {
+    set srv [lindex $::servers end+$level]
+    kill_server $srv
+
+    set pid [dict get $srv "pid"]
+    set stdout [dict get $srv "stdout"]
+    set stderr [dict get $srv "stderr"]
+    if {$rotate_logs} {
+        set ts [clock format [clock seconds] -format %y%m%d%H%M%S]
+        file rename $stdout $stdout.$ts.$pid
+        file rename $stderr $stderr.$ts.$pid
+    }
+    set prev_ready_count [count_message_lines $stdout "Ready to accept"]
+
+    # if we're inside a test, write the test name to the server log file
+    if {[info exists ::cur_test]} {
+        set fd [open $stdout "a+"]
+        puts $fd "### Restarting server for test $::cur_test"
+        close $fd
+    }
+
+    set config_file [dict get $srv "config_file"]
+
+    set pid [spawn_server $config_file $stdout $stderr]
+
+    # check that the server actually started
+    wait_server_started $config_file $stdout $pid
+
+    # update the pid in the servers list
+    dict set srv "pid" $pid
+    # re-set $srv in the servers list
+    lset ::servers end+$level $srv
+
+    if {$wait_ready} {
+        while 1 {
+            # check that the server actually started and is ready for connections
+            if {[count_message_lines $stdout "Ready to accept"] > $prev_ready_count} {
+                break
+            }
+            after 10
+        }
+    }
+    reconnect $level
+}
diff --git a/redis-stable/tests/support/test.tcl b/redis-stable/tests/support/test.tcl
new file mode 100644
index 00000000..29d0cbf4
--- /dev/null
+++ b/redis-stable/tests/support/test.tcl
@@ -0,0 +1,210 @@
+set ::num_tests 0
+set ::num_passed 0
+set ::num_failed 0
+set ::num_skipped 0
+set ::num_aborted 0
+set ::tests_failed {}
+set ::cur_test ""
+
+proc fail {msg} {
+    error "assertion:$msg"
+}
+
+proc assert {condition} {
+    if {![uplevel 1 [list expr $condition]]} {
+        set context "(context: [info frame -1])"
+        error "assertion:Expected [uplevel 1 [list subst -nocommands $condition]] $context"
+    }
+}
+
+proc assert_no_match {pattern value} {
+    if {[string match $pattern $value]} {
+        set context "(context: [info frame -1])"
+        error "assertion:Expected '$value' to not match '$pattern' $context"
+    }
+}
+
+proc assert_match {pattern value} {
+    if {![string match $pattern $value]} {
+        set context "(context: [info frame -1])"
+        error "assertion:Expected '$value' to match '$pattern' $context"
+    }
+}
+
+proc assert_failed {expected_err detail} {
+     if {$detail ne ""} {
+        set detail "(detail: $detail)"
+     } else {
+        set detail "(context: [info frame -2])"
+     }
+     error "assertion:$expected_err $detail"
+}
+
+proc assert_equal {value expected {detail ""}} {
+    if {$expected ne $value} {
+        assert_failed "Expected '$value' to be equal to '$expected'" $detail
+    }
+}
+
+proc assert_lessthan {value expected {detail ""}} {
+    if {!($value < $expected)} {
+        assert_failed "Expected '$value' to be less than '$expected'" $detail
+    }
+}
+
+proc assert_lessthan_equal {value expected {detail ""}} {
+    if {!($value <= $expected)} {
+        assert_failed "Expected '$value' to be less than or equal to '$expected'" $detail
+    }
+}
+
+proc assert_morethan {value expected {detail ""}} {
+    if {!($value > $expected)} {
+        assert_failed "Expected '$value' to be more than '$expected'" $detail
+    }
+}
+
+proc assert_morethan_equal {value expected {detail ""}} {
+    if {!($value >= $expected)} {
+        assert_failed "Expected '$value' to be more than or equal to '$expected'" $detail
+    }
+}
+
+proc assert_range {value min max {detail ""}} {
+    if {!($value <= $max && $value >= $min)} {
+        assert_failed "Expected '$value' to be between to '$min' and '$max'" $detail
+    }
+}
+
+proc assert_error {pattern code} {
+    if {[catch {uplevel 1 $code} error]} {
+        assert_match $pattern $error
+    } else {
+        error "assertion:Expected an error but nothing was caught"
+    }
+}
+
+proc assert_encoding {enc key} {
+    set dbg [r debug object $key]
+    assert_match "* encoding:$enc *" $dbg
+}
+
+proc assert_type {type key} {
+    assert_equal $type [r type $key]
+}
+
+# Wait for the specified condition to be true, with the specified number of
+# max retries and delay between retries. Otherwise the 'elsescript' is
+# executed.
+proc wait_for_condition {maxtries delay e _else_ elsescript} {
+    while {[incr maxtries -1] >= 0} {
+        set errcode [catch {uplevel 1 [list expr $e]} result]
+        if {$errcode == 0} {
+            if {$result} break
+        } else {
+            return -code $errcode $result
+        }
+        after $delay
+    }
+    if {$maxtries == -1} {
+        set errcode [catch [uplevel 1 $elsescript] result]
+        return -code $errcode $result
+    }
+}
+
+proc test {name code {okpattern undefined} {options undefined}} {
+    # abort if test name in skiptests
+    if {[lsearch $::skiptests $name] >= 0} {
+        incr ::num_skipped
+        send_data_packet $::test_server_fd skip $name
+        return
+    }
+
+    # abort if only_tests was set but test name is not included
+    if {[llength $::only_tests] > 0 && [lsearch $::only_tests $name] < 0} {
+        incr ::num_skipped
+        send_data_packet $::test_server_fd skip $name
+        return
+    }
+
+    # check if tagged with at least 1 tag to allow when there *is* a list
+    # of tags to allow, because default policy is to run everything
+    if {[llength $::allowtags] > 0} {
+        set matched 0
+        foreach tag $::allowtags {
+            if {[lsearch $::tags $tag] >= 0} {
+                incr matched
+            }
+        }
+        if {$matched < 1} {
+            incr ::num_aborted
+            send_data_packet $::test_server_fd ignore $name
+            return
+        }
+    }
+
+    incr ::num_tests
+    set details {}
+    lappend details "$name in $::curfile"
+
+    # set a cur_test global to be logged into new servers that are spown
+    # and log the test name in all existing servers
+    set prev_test $::cur_test
+    set ::cur_test "$name in $::curfile"
+    if {!$::external} {
+        foreach srv $::servers {
+            set stdout [dict get $srv stdout]
+            set fd [open $stdout "a+"]
+            puts $fd "### Starting test $::cur_test"
+            close $fd
+        }
+    }
+
+    send_data_packet $::test_server_fd testing $name
+
+    if {[catch {set retval [uplevel 1 $code]} error]} {
+        set assertion [string match "assertion:*" $error]
+        if {$assertion || $::durable} {
+            # durable prevents the whole tcl test from exiting on an exception.
+            # an assertion is handled gracefully anyway.
+            set msg [string range $error 10 end]
+            lappend details $msg
+            if {!$assertion} {
+                lappend details $::errorInfo
+            }
+            lappend ::tests_failed $details
+
+            incr ::num_failed
+            send_data_packet $::test_server_fd err [join $details "\n"]
+
+            if {$::stop_on_failure} {
+                puts "Test error (last server port:[srv port], log:[srv stdout]), press enter to teardown the test."
+                flush stdout
+                gets stdin
+            }
+        } else {
+            # Re-raise, let handler up the stack take care of this.
+            error $error $::errorInfo
+        }
+    } else {
+        if {$okpattern eq "undefined" || $okpattern eq $retval || [string match $okpattern $retval]} {
+            incr ::num_passed
+            send_data_packet $::test_server_fd ok $name
+        } else {
+            set msg "Expected '$okpattern' to equal or match '$retval'"
+            lappend details $msg
+            lappend ::tests_failed $details
+
+            incr ::num_failed
+            send_data_packet $::test_server_fd err [join $details "\n"]
+        }
+    }
+
+    if {$::traceleaks} {
+        set output [exec leaks redis-server]
+        if {![string match {*0 leaks*} $output]} {
+            send_data_packet $::test_server_fd err "Detected a memory leak in test '$name': $output"
+        }
+    }
+    set ::cur_test $prev_test
+}
diff --git a/redis-stable/tests/support/tmpfile.tcl b/redis-stable/tests/support/tmpfile.tcl
new file mode 100644
index 00000000..809f5873
--- /dev/null
+++ b/redis-stable/tests/support/tmpfile.tcl
@@ -0,0 +1,15 @@
+set ::tmpcounter 0
+set ::tmproot "./tests/tmp"
+file mkdir $::tmproot
+
+# returns a dirname unique to this process to write to
+proc tmpdir {basename} {
+    set dir [file join $::tmproot $basename.[pid].[incr ::tmpcounter]]
+    file mkdir $dir
+    set _ $dir
+}
+
+# return a filename unique to this process to write to
+proc tmpfile {basename} {
+    file join $::tmproot $basename.[pid].[incr ::tmpcounter]
+}
diff --git a/redis-stable/tests/support/util.tcl b/redis-stable/tests/support/util.tcl
new file mode 100644
index 00000000..1d098b54
--- /dev/null
+++ b/redis-stable/tests/support/util.tcl
@@ -0,0 +1,773 @@
+proc randstring {min max {type binary}} {
+    set len [expr {$min+int(rand()*($max-$min+1))}]
+    set output {}
+    if {$type eq {binary}} {
+        set minval 0
+        set maxval 255
+    } elseif {$type eq {alpha}} {
+        set minval 48
+        set maxval 122
+    } elseif {$type eq {compr}} {
+        set minval 48
+        set maxval 52
+    }
+    while {$len} {
+        set rr [expr {$minval+int(rand()*($maxval-$minval+1))}]
+        if {$type eq {alpha} && $rr eq 92} {
+            set rr 90; # avoid putting '\' char in the string, it can mess up TCL processing
+        }
+        append output [format "%c" $rr]
+        incr len -1
+    }
+    return $output
+}
+
+# Useful for some test
+proc zlistAlikeSort {a b} {
+    if {[lindex $a 0] > [lindex $b 0]} {return 1}
+    if {[lindex $a 0] < [lindex $b 0]} {return -1}
+    string compare [lindex $a 1] [lindex $b 1]
+}
+
+# Return all log lines starting with the first line that contains a warning.
+# Generally, this will be an assertion error with a stack trace.
+proc crashlog_from_file {filename} {
+    set lines [split [exec cat $filename] "\n"]
+    set matched 0
+    set logall 0
+    set result {}
+    foreach line $lines {
+        if {[string match {*REDIS BUG REPORT START*} $line]} {
+            set logall 1
+        }
+        if {[regexp {^\[\d+\]\s+\d+\s+\w+\s+\d{2}:\d{2}:\d{2} \#} $line]} {
+            set matched 1
+        }
+        if {$logall || $matched} {
+            lappend result $line
+        }
+    }
+    join $result "\n"
+}
+
+proc getInfoProperty {infostr property} {
+    if {[regexp "\r\n$property:(.*?)\r\n" $infostr _ value]} {
+        set _ $value
+    }
+}
+
+# Return value for INFO property
+proc status {r property} {
+    set _ [getInfoProperty [{*}$r info] $property]
+}
+
+proc waitForBgsave r {
+    while 1 {
+        if {[status r rdb_bgsave_in_progress] eq 1} {
+            if {$::verbose} {
+                puts -nonewline "\nWaiting for background save to finish... "
+                flush stdout
+            }
+            after 1000
+        } else {
+            break
+        }
+    }
+}
+
+proc waitForBgrewriteaof r {
+    while 1 {
+        if {[status r aof_rewrite_in_progress] eq 1} {
+            if {$::verbose} {
+                puts -nonewline "\nWaiting for background AOF rewrite to finish... "
+                flush stdout
+            }
+            after 1000
+        } else {
+            break
+        }
+    }
+}
+
+proc wait_for_sync r {
+    wait_for_condition 50 100 {
+        [status $r master_link_status] eq "up"
+    } else {
+        fail "replica didn't sync in time"
+    }
+}
+
+proc wait_for_ofs_sync {r1 r2} {
+    wait_for_condition 50 100 {
+        [status $r1 master_repl_offset] eq [status $r2 master_repl_offset]
+    } else {
+        fail "replica didn't sync in time"
+    }
+}
+
+proc wait_done_loading r {
+    wait_for_condition 50 100 {
+        [catch {$r ping} e] == 0
+    } else {
+        fail "Loading DB is taking too much time."
+    }
+}
+
+# count current log lines in server's stdout
+proc count_log_lines {srv_idx} {
+    set _ [string trim [exec wc -l < [srv $srv_idx stdout]]]
+}
+
+# returns the number of times a line with that pattern appears in a file
+proc count_message_lines {file pattern} {
+    set res 0
+    # exec fails when grep exists with status other than 0 (when the patter wasn't found)
+    catch {
+        set res [string trim [exec grep $pattern $file 2> /dev/null | wc -l]]
+    }
+    return $res
+}
+
+# returns the number of times a line with that pattern appears in the log
+proc count_log_message {srv_idx pattern} {
+    set stdout [srv $srv_idx stdout]
+    return [count_message_lines $stdout $pattern]
+}
+
+# verify pattern exists in server's sdtout after a certain line number
+proc verify_log_message {srv_idx pattern from_line} {
+    incr from_line
+    set result [exec tail -n +$from_line < [srv $srv_idx stdout]]
+    if {![string match $pattern $result]} {
+        error "assertion:expected message not found in log file: $pattern"
+    }
+}
+
+# wait for pattern to be found in server's stdout after certain line number
+# return value is a list containing the line that matched the pattern and the line number
+proc wait_for_log_messages {srv_idx patterns from_line maxtries delay} {
+    set retry $maxtries
+    set next_line [expr $from_line + 1] ;# searching form the line after
+    set stdout [srv $srv_idx stdout]
+    while {$retry} {
+        # re-read the last line (unless it's before to our first), last time we read it, it might have been incomplete
+        set next_line [expr $next_line - 1 > $from_line + 1 ? $next_line - 1 : $from_line + 1]
+        set result [exec tail -n +$next_line < $stdout]
+        set result [split $result "\n"]
+        foreach line $result {
+            foreach pattern $patterns {
+                if {[string match $pattern $line]} {
+                    return [list $line $next_line]
+                }
+            }
+            incr next_line
+        }
+        incr retry -1
+        after $delay
+    }
+    if {$retry == 0} {
+        if {$::verbose} {
+            puts "content of $stdout from line: $from_line:"
+            puts [exec tail -n +$from_line < $stdout]
+        }
+        fail "log message of '$patterns' not found in $stdout after line: $from_line till line: [expr $next_line -1]"
+    }
+}
+
+# write line to server log file
+proc write_log_line {srv_idx msg} {
+    set logfile [srv $srv_idx stdout]
+    set fd [open $logfile "a+"]
+    puts $fd "### $msg"
+    close $fd
+}
+
+# Random integer between 0 and max (excluded).
+proc randomInt {max} {
+    expr {int(rand()*$max)}
+}
+
+# Random signed integer between -max and max (both extremes excluded).
+proc randomSignedInt {max} {
+    set i [randomInt $max]
+    if {rand() > 0.5} {
+        set i -$i
+    }
+    return $i
+}
+
+proc randpath args {
+    set path [expr {int(rand()*[llength $args])}]
+    uplevel 1 [lindex $args $path]
+}
+
+proc randomValue {} {
+    randpath {
+        # Small enough to likely collide
+        randomSignedInt 1000
+    } {
+        # 32 bit compressible signed/unsigned
+        randpath {randomSignedInt 2000000000} {randomSignedInt 4000000000}
+    } {
+        # 64 bit
+        randpath {randomSignedInt 1000000000000}
+    } {
+        # Random string
+        randpath {randstring 0 256 alpha} \
+                {randstring 0 256 compr} \
+                {randstring 0 256 binary}
+    }
+}
+
+proc randomKey {} {
+    randpath {
+        # Small enough to likely collide
+        randomInt 1000
+    } {
+        # 32 bit compressible signed/unsigned
+        randpath {randomInt 2000000000} {randomInt 4000000000}
+    } {
+        # 64 bit
+        randpath {randomInt 1000000000000}
+    } {
+        # Random string
+        randpath {randstring 1 256 alpha} \
+                {randstring 1 256 compr}
+    }
+}
+
+proc findKeyWithType {r type} {
+    for {set j 0} {$j < 20} {incr j} {
+        set k [{*}$r randomkey]
+        if {$k eq {}} {
+            return {}
+        }
+        if {[{*}$r type $k] eq $type} {
+            return $k
+        }
+    }
+    return {}
+}
+
+proc createComplexDataset {r ops {opt {}}} {
+    for {set j 0} {$j < $ops} {incr j} {
+        set k [randomKey]
+        set k2 [randomKey]
+        set f [randomValue]
+        set v [randomValue]
+
+        if {[lsearch -exact $opt useexpire] != -1} {
+            if {rand() < 0.1} {
+                {*}$r expire [randomKey] [randomInt 2]
+            }
+        }
+
+        randpath {
+            set d [expr {rand()}]
+        } {
+            set d [expr {rand()}]
+        } {
+            set d [expr {rand()}]
+        } {
+            set d [expr {rand()}]
+        } {
+            set d [expr {rand()}]
+        } {
+            randpath {set d +inf} {set d -inf}
+        }
+        set t [{*}$r type $k]
+
+        if {$t eq {none}} {
+            randpath {
+                {*}$r set $k $v
+            } {
+                {*}$r lpush $k $v
+            } {
+                {*}$r sadd $k $v
+            } {
+                {*}$r zadd $k $d $v
+            } {
+                {*}$r hset $k $f $v
+            } {
+                {*}$r del $k
+            }
+            set t [{*}$r type $k]
+        }
+
+        switch $t {
+            {string} {
+                # Nothing to do
+            }
+            {list} {
+                randpath {{*}$r lpush $k $v} \
+                        {{*}$r rpush $k $v} \
+                        {{*}$r lrem $k 0 $v} \
+                        {{*}$r rpop $k} \
+                        {{*}$r lpop $k}
+            }
+            {set} {
+                randpath {{*}$r sadd $k $v} \
+                        {{*}$r srem $k $v} \
+                        {
+                            set otherset [findKeyWithType {*}$r set]
+                            if {$otherset ne {}} {
+                                randpath {
+                                    {*}$r sunionstore $k2 $k $otherset
+                                } {
+                                    {*}$r sinterstore $k2 $k $otherset
+                                } {
+                                    {*}$r sdiffstore $k2 $k $otherset
+                                }
+                            }
+                        }
+            }
+            {zset} {
+                randpath {{*}$r zadd $k $d $v} \
+                        {{*}$r zrem $k $v} \
+                        {
+                            set otherzset [findKeyWithType {*}$r zset]
+                            if {$otherzset ne {}} {
+                                randpath {
+                                    {*}$r zunionstore $k2 2 $k $otherzset
+                                } {
+                                    {*}$r zinterstore $k2 2 $k $otherzset
+                                }
+                            }
+                        }
+            }
+            {hash} {
+                randpath {{*}$r hset $k $f $v} \
+                        {{*}$r hdel $k $f}
+            }
+        }
+    }
+}
+
+proc formatCommand {args} {
+    set cmd "*[llength $args]\r\n"
+    foreach a $args {
+        append cmd "$[string length $a]\r\n$a\r\n"
+    }
+    set _ $cmd
+}
+
+proc csvdump r {
+    set o {}
+    for {set db 0} {$db < 16} {incr db} {
+        {*}$r select $db
+        foreach k [lsort [{*}$r keys *]] {
+            set type [{*}$r type $k]
+            append o [csvstring $db] , [csvstring $k] , [csvstring $type] ,
+            switch $type {
+                string {
+                    append o [csvstring [{*}$r get $k]] "\n"
+                }
+                list {
+                    foreach e [{*}$r lrange $k 0 -1] {
+                        append o [csvstring $e] ,
+                    }
+                    append o "\n"
+                }
+                set {
+                    foreach e [lsort [{*}$r smembers $k]] {
+                        append o [csvstring $e] ,
+                    }
+                    append o "\n"
+                }
+                zset {
+                    foreach e [{*}$r zrange $k 0 -1 withscores] {
+                        append o [csvstring $e] ,
+                    }
+                    append o "\n"
+                }
+                hash {
+                    set fields [{*}$r hgetall $k]
+                    set newfields {}
+                    foreach {k v} $fields {
+                        lappend newfields [list $k $v]
+                    }
+                    set fields [lsort -index 0 $newfields]
+                    foreach kv $fields {
+                        append o [csvstring [lindex $kv 0]] ,
+                        append o [csvstring [lindex $kv 1]] ,
+                    }
+                    append o "\n"
+                }
+            }
+        }
+    }
+    {*}$r select 9
+    return $o
+}
+
+proc csvstring s {
+    return "\"$s\""
+}
+
+proc roundFloat f {
+    format "%.10g" $f
+}
+
+set ::last_port_attempted 0
+proc find_available_port {start count} {
+    set port [expr $::last_port_attempted + 1]
+    for {set attempts 0} {$attempts < $count} {incr attempts} {
+        if {$port < $start || $port >= $start+$count} {
+            set port $start
+        }
+        if {[catch {set fd1 [socket 127.0.0.1 $port]}] &&
+            [catch {set fd2 [socket 127.0.0.1 [expr $port+10000]]}]} {
+            set ::last_port_attempted $port
+            return $port
+        } else {
+            catch {
+                close $fd1
+                close $fd2
+            }
+        }
+        incr port
+    }
+    error "Can't find a non busy port in the $start-[expr {$start+$count-1}] range."
+}
+
+# Test if TERM looks like to support colors
+proc color_term {} {
+    expr {[info exists ::env(TERM)] && [string match *xterm* $::env(TERM)]}
+}
+
+proc colorstr {color str} {
+    if {[color_term]} {
+        set b 0
+        if {[string range $color 0 4] eq {bold-}} {
+            set b 1
+            set color [string range $color 5 end]
+        }
+        switch $color {
+            red {set colorcode {31}}
+            green {set colorcode {32}}
+            yellow {set colorcode {33}}
+            blue {set colorcode {34}}
+            magenta {set colorcode {35}}
+            cyan {set colorcode {36}}
+            white {set colorcode {37}}
+            default {set colorcode {37}}
+        }
+        if {$colorcode ne {}} {
+            return "\033\[$b;${colorcode};49m$str\033\[0m"
+        }
+    } else {
+        return $str
+    }
+}
+
+proc find_valgrind_errors {stderr on_termination} {
+    set fd [open $stderr]
+    set buf [read $fd]
+    close $fd
+
+    # Look for stack trace (" at 0x") and other errors (Invalid, Mismatched, etc).
+    # Look for "Warnings", but not the "set address range perms". These don't indicate any real concern.
+    # corrupt-dump unit, not sure why but it seems they don't indicate any real concern.
+    if {[regexp -- { at 0x} $buf] ||
+        [regexp -- {^(?=.*Warning)(?:(?!set address range perms).)*$} $buf] ||
+        [regexp -- {Invalid} $buf] ||
+        [regexp -- {Mismatched} $buf] ||
+        [regexp -- {uninitialized} $buf] ||
+        [regexp -- {has a fishy} $buf] ||
+        [regexp -- {overlap} $buf]} {
+        return $buf
+    }
+
+    # If the process didn't terminate yet, we can't look for the summary report
+    if {!$on_termination} {
+        return ""
+    }
+
+    # Look for the absense of a leak free summary (happens when redis isn't terminated properly).
+    if {(![regexp -- {definitely lost: 0 bytes} $buf] &&
+         ![regexp -- {no leaks are possible} $buf])} {
+        return $buf
+    }
+
+    return ""
+}
+
+# Execute a background process writing random data for the specified number
+# of seconds to the specified Redis instance.
+proc start_write_load {host port seconds} {
+    set tclsh [info nameofexecutable]
+    exec $tclsh tests/helpers/gen_write_load.tcl $host $port $seconds $::tls &
+}
+
+# Stop a process generating write load executed with start_write_load.
+proc stop_write_load {handle} {
+    catch {exec /bin/kill -9 $handle}
+}
+
+proc wait_load_handlers_disconnected {{level 0}} {
+    wait_for_condition 50 100 {
+        ![string match {*name=LOAD_HANDLER*} [r $level client list]]
+    } else {
+        fail "load_handler(s) still connected after too long time."
+    }
+}
+
+proc K { x y } { set x } 
+
+# Shuffle a list with Fisher-Yates algorithm.
+proc lshuffle {list} {
+    set n [llength $list]
+    while {$n>1} {
+        set j [expr {int(rand()*$n)}]
+        incr n -1
+        if {$n==$j} continue
+        set v [lindex $list $j]
+        lset list $j [lindex $list $n]
+        lset list $n $v
+    }
+    return $list
+}
+
+# Execute a background process writing complex data for the specified number
+# of ops to the specified Redis instance.
+proc start_bg_complex_data {host port db ops} {
+    set tclsh [info nameofexecutable]
+    exec $tclsh tests/helpers/bg_complex_data.tcl $host $port $db $ops $::tls &
+}
+
+# Stop a process generating write load executed with start_bg_complex_data.
+proc stop_bg_complex_data {handle} {
+    catch {exec /bin/kill -9 $handle}
+}
+
+proc populate {num prefix size} {
+    set rd [redis_deferring_client]
+    for {set j 0} {$j < $num} {incr j} {
+        $rd set $prefix$j [string repeat A $size]
+    }
+    for {set j 0} {$j < $num} {incr j} {
+        $rd read
+    }
+    $rd close
+}
+
+proc get_child_pid {idx} {
+    set pid [srv $idx pid]
+    if {[file exists "/usr/bin/pgrep"]} {
+        set fd [open "|pgrep -P $pid" "r"]
+        set child_pid [string trim [lindex [split [read $fd] \n] 0]]
+    } else {
+        set fd [open "|ps --ppid $pid -o pid" "r"]
+        set child_pid [string trim [lindex [split [read $fd] \n] 1]]
+    }
+    close $fd
+
+    return $child_pid
+}
+
+proc cmdrstat {cmd r} {
+    if {[regexp "\r\ncmdstat_$cmd:(.*?)\r\n" [$r info commandstats] _ value]} {
+        set _ $value
+    }
+}
+
+proc errorrstat {cmd r} {
+    if {[regexp "\r\nerrorstat_$cmd:(.*?)\r\n" [$r info errorstats] _ value]} {
+        set _ $value
+    }
+}
+
+proc generate_fuzzy_traffic_on_key {key duration} {
+    # Commands per type, blocking commands removed
+    # TODO: extract these from help.h or elsewhere, and improve to include other types
+    set string_commands {APPEND BITCOUNT BITFIELD BITOP BITPOS DECR DECRBY GET GETBIT GETRANGE GETSET INCR INCRBY INCRBYFLOAT MGET MSET MSETNX PSETEX SET SETBIT SETEX SETNX SETRANGE STRALGO STRLEN}
+    set hash_commands {HDEL HEXISTS HGET HGETALL HINCRBY HINCRBYFLOAT HKEYS HLEN HMGET HMSET HSCAN HSET HSETNX HSTRLEN HVALS HRANDFIELD}
+    set zset_commands {ZADD ZCARD ZCOUNT ZINCRBY ZINTERSTORE ZLEXCOUNT ZPOPMAX ZPOPMIN ZRANGE ZRANGEBYLEX ZRANGEBYSCORE ZRANK ZREM ZREMRANGEBYLEX ZREMRANGEBYRANK ZREMRANGEBYSCORE ZREVRANGE ZREVRANGEBYLEX ZREVRANGEBYSCORE ZREVRANK ZSCAN ZSCORE ZUNIONSTORE ZRANDMEMBER}
+    set list_commands {LINDEX LINSERT LLEN LPOP LPOS LPUSH LPUSHX LRANGE LREM LSET LTRIM RPOP RPOPLPUSH RPUSH RPUSHX}
+    set set_commands {SADD SCARD SDIFF SDIFFSTORE SINTER SINTERSTORE SISMEMBER SMEMBERS SMOVE SPOP SRANDMEMBER SREM SSCAN SUNION SUNIONSTORE}
+    set stream_commands {XACK XADD XCLAIM XDEL XGROUP XINFO XLEN XPENDING XRANGE XREAD XREADGROUP XREVRANGE XTRIM}
+    set commands [dict create string $string_commands hash $hash_commands zset $zset_commands list $list_commands set $set_commands stream $stream_commands]
+
+    set type [r type $key]
+    set cmds [dict get $commands $type]
+    set start_time [clock seconds]
+    set sent {}
+    set succeeded 0
+    while {([clock seconds]-$start_time) < $duration} {
+        # find a random command for our key type
+        set cmd_idx [expr {int(rand()*[llength $cmds])}]
+        set cmd [lindex $cmds $cmd_idx]
+        # get the command details from redis
+        if { [ catch {
+            set cmd_info [lindex [r command info $cmd] 0]
+        } err ] } {
+            # if we failed, it means redis crashed after the previous command
+            return $sent
+        }
+        # try to build a valid command argument
+        set arity [lindex $cmd_info 1]
+        set arity [expr $arity < 0 ? - $arity: $arity]
+        set firstkey [lindex $cmd_info 3]
+        set lastkey [lindex $cmd_info 4]
+        set i 1
+        if {$cmd == "XINFO"} {
+            lappend cmd "STREAM"
+            lappend cmd $key
+            lappend cmd "FULL"
+            incr i 3
+        }
+        if {$cmd == "XREAD"} {
+            lappend cmd "STREAMS"
+            lappend cmd $key
+            randpath {
+                lappend cmd \$
+            } {
+                lappend cmd [randomValue]
+            }
+            incr i 3
+        }
+        if {$cmd == "XADD"} {
+            lappend cmd $key
+            randpath {
+                lappend cmd "*"
+            } {
+                lappend cmd [randomValue]
+            }
+            lappend cmd [randomValue]
+            lappend cmd [randomValue]
+            incr i 4
+        }
+        for {} {$i < $arity} {incr i} {
+            if {$i == $firstkey || $i == $lastkey} {
+                lappend cmd $key
+            } else {
+                lappend cmd [randomValue]
+            }
+        }
+        # execute the command, we expect commands to fail on syntax errors
+        lappend sent $cmd
+        if { ! [ catch {
+            r {*}$cmd
+        } err ] } {
+            incr succeeded
+        }
+    }
+
+    # print stats so that we know if we managed to generate commands that actually made senes
+    #if {$::verbose} {
+    #    set count [llength $sent]
+    #    puts "Fuzzy traffic sent: $count, succeeded: $succeeded"
+    #}
+
+    # return the list of commands we sent
+    return $sent
+}
+
+# write line to server log file
+proc write_log_line {srv_idx msg} {
+    set logfile [srv $srv_idx stdout]
+    set fd [open $logfile "a+"]
+    puts $fd "### $msg"
+    close $fd
+}
+
+proc string2printable s {
+    set res {}
+    set has_special_chars false
+    foreach i [split $s {}] {
+        scan $i %c int
+        # non printable characters, including space and excluding: " \ $ { }
+        if {$int < 32 || $int > 122 || $int == 34 || $int == 36 || $int == 92} {
+            set has_special_chars true
+        }
+        # TCL8.5 has issues mixing \x notation and normal chars in the same
+        # source code string, so we'll convert the entire string.
+        append res \\x[format %02X $int]
+    }
+    if {!$has_special_chars} {
+        return $s
+    }
+    set res "\"$res\""
+    return $res
+}
+
+# Calculation value of Chi-Square Distribution. By this value
+# we can verify the random distribution sample confidence.
+# Based on the following wiki:
+# https://en.wikipedia.org/wiki/Chi-square_distribution
+#
+# param res    Random sample list
+# return       Value of Chi-Square Distribution
+#
+# x2_value: return of chi_square_value function
+# df: Degrees of freedom, Number of independent values minus 1
+#
+# By using x2_value and df to back check the cardinality table,
+# we can know the confidence of the random sample.
+proc chi_square_value {res} {
+    unset -nocomplain mydict
+    foreach key $res {
+        dict incr mydict $key 1
+    }
+
+    set x2_value 0
+    set p [expr [llength $res] / [dict size $mydict]]
+    foreach key [dict keys $mydict] {
+        set value [dict get $mydict $key]
+
+        # Aggregate the chi-square value of each element
+        set v [expr {pow($value - $p, 2) / $p}]
+        set x2_value [expr {$x2_value + $v}]
+    }
+
+    return $x2_value
+}
+
+#subscribe to Pub/Sub channels
+proc consume_subscribe_messages {client type channels} {
+    set numsub -1
+    set counts {}
+
+    for {set i [llength $channels]} {$i > 0} {incr i -1} {
+        set msg [$client read]
+        assert_equal $type [lindex $msg 0]
+
+        # when receiving subscribe messages the channels names
+        # are ordered. when receiving unsubscribe messages
+        # they are unordered
+        set idx [lsearch -exact $channels [lindex $msg 1]]
+        if {[string match "*unsubscribe" $type]} {
+            assert {$idx >= 0}
+        } else {
+            assert {$idx == 0}
+        }
+        set channels [lreplace $channels $idx $idx]
+
+        # aggregate the subscription count to return to the caller
+        lappend counts [lindex $msg 2]
+    }
+
+    # we should have received messages for channels
+    assert {[llength $channels] == 0}
+    return $counts
+}
+
+proc subscribe {client channels} {
+    $client subscribe {*}$channels
+    consume_subscribe_messages $client subscribe $channels
+}
+
+proc unsubscribe {client {channels {}}} {
+    $client unsubscribe {*}$channels
+    consume_subscribe_messages $client unsubscribe $channels
+}
+
+proc psubscribe {client channels} {
+    $client psubscribe {*}$channels
+    consume_subscribe_messages $client psubscribe $channels
+}
+
+proc punsubscribe {client {channels {}}} {
+    $client punsubscribe {*}$channels
+    consume_subscribe_messages $client punsubscribe $channels
+}
\ No newline at end of file
diff --git a/redis-stable/tests/test_helper.tcl b/redis-stable/tests/test_helper.tcl
new file mode 100644
index 00000000..3c7d46d5
--- /dev/null
+++ b/redis-stable/tests/test_helper.tcl
@@ -0,0 +1,822 @@
+# Redis test suite. Copyright (C) 2009 Salvatore Sanfilippo antirez@gmail.com
+# This software is released under the BSD License. See the COPYING file for
+# more information.
+
+package require Tcl 8.5
+
+set tcl_precision 17
+source tests/support/redis.tcl
+source tests/support/server.tcl
+source tests/support/tmpfile.tcl
+source tests/support/test.tcl
+source tests/support/util.tcl
+
+set ::all_tests {
+    unit/printver
+    unit/dump
+    unit/auth
+    unit/protocol
+    unit/keyspace
+    unit/scan
+    unit/info
+    unit/type/string
+    unit/type/incr
+    unit/type/list
+    unit/type/list-2
+    unit/type/list-3
+    unit/type/set
+    unit/type/zset
+    unit/type/hash
+    unit/type/stream
+    unit/type/stream-cgroups
+    unit/sort
+    unit/expire
+    unit/other
+    unit/multi
+    unit/quit
+    unit/aofrw
+    unit/acl
+    unit/latency-monitor
+    integration/block-repl
+    integration/replication
+    integration/replication-2
+    integration/replication-3
+    integration/replication-4
+    integration/replication-psync
+    integration/aof
+    integration/rdb
+    integration/corrupt-dump
+    integration/corrupt-dump-fuzzer
+    integration/convert-zipmap-hash-on-load
+    integration/logging
+    integration/psync2
+    integration/psync2-reg
+    integration/psync2-pingoff
+    integration/failover
+    integration/redis-cli
+    integration/redis-benchmark
+    unit/pubsub
+    unit/slowlog
+    unit/scripting
+    unit/maxmemory
+    unit/introspection
+    unit/introspection-2
+    unit/limits
+    unit/obuf-limits
+    unit/bitops
+    unit/bitfield
+    unit/geo
+    unit/memefficiency
+    unit/hyperloglog
+    unit/lazyfree
+    unit/wait
+    unit/pendingquerybuf
+    unit/tls
+    unit/tracking
+    unit/oom-score-adj
+    unit/shutdown
+    unit/networking
+}
+# Index to the next test to run in the ::all_tests list.
+set ::next_test 0
+
+set ::host 127.0.0.1
+set ::port 6379; # port for external server
+set ::baseport 21111; # initial port for spawned redis servers
+set ::portcount 8000; # we don't wanna use more than 10000 to avoid collision with cluster bus ports
+set ::traceleaks 0
+set ::valgrind 0
+set ::durable 0
+set ::tls 0
+set ::stack_logging 0
+set ::verbose 0
+set ::quiet 0
+set ::denytags {}
+set ::skiptests {}
+set ::skipunits {}
+set ::no_latency 0
+set ::allowtags {}
+set ::only_tests {}
+set ::single_tests {}
+set ::run_solo_tests {}
+set ::skip_till ""
+set ::external 0; # If "1" this means, we are running against external instance
+set ::file ""; # If set, runs only the tests in this comma separated list
+set ::curfile ""; # Hold the filename of the current suite
+set ::accurate 0; # If true runs fuzz tests with more iterations
+set ::force_failure 0
+set ::timeout 1200; # 20 minutes without progresses will quit the test.
+set ::last_progress [clock seconds]
+set ::active_servers {} ; # Pids of active Redis instances.
+set ::dont_clean 0
+set ::wait_server 0
+set ::stop_on_failure 0
+set ::dump_logs 0
+set ::loop 0
+set ::tlsdir "tests/tls"
+
+# Set to 1 when we are running in client mode. The Redis test uses a
+# server-client model to run tests simultaneously. The server instance
+# runs the specified number of client instances that will actually run tests.
+# The server is responsible of showing the result to the user, and exit with
+# the appropriate exit code depending on the test outcome.
+set ::client 0
+set ::numclients 16
+
+# This function is called by one of the test clients when it receives
+# a "run" command from the server, with a filename as data.
+# It will run the specified test source file and signal it to the
+# test server when finished.
+proc execute_test_file name {
+    set path "tests/$name.tcl"
+    set ::curfile $path
+    source $path
+    send_data_packet $::test_server_fd done "$name"
+}
+
+# This function is called by one of the test clients when it receives
+# a "run_code" command from the server, with a verbatim test source code
+# as argument, and an associated name.
+# It will run the specified code and signal it to the test server when
+# finished.
+proc execute_test_code {name filename code} {
+    set ::curfile $filename
+    eval $code
+    send_data_packet $::test_server_fd done "$name"
+}
+
+# Setup a list to hold a stack of server configs. When calls to start_server
+# are nested, use "srv 0 pid" to get the pid of the inner server. To access
+# outer servers, use "srv -1 pid" etcetera.
+set ::servers {}
+proc srv {args} {
+    set level 0
+    if {[string is integer [lindex $args 0]]} {
+        set level [lindex $args 0]
+        set property [lindex $args 1]
+    } else {
+        set property [lindex $args 0]
+    }
+    set srv [lindex $::servers end+$level]
+    dict get $srv $property
+}
+
+# Provide easy access to the client for the inner server. It's possible to
+# prepend the argument list with a negative level to access clients for
+# servers running in outer blocks.
+proc r {args} {
+    set level 0
+    if {[string is integer [lindex $args 0]]} {
+        set level [lindex $args 0]
+        set args [lrange $args 1 end]
+    }
+    [srv $level "client"] {*}$args
+}
+
+proc reconnect {args} {
+    set level [lindex $args 0]
+    if {[string length $level] == 0 || ![string is integer $level]} {
+        set level 0
+    }
+
+    set srv [lindex $::servers end+$level]
+    set host [dict get $srv "host"]
+    set port [dict get $srv "port"]
+    set config [dict get $srv "config"]
+    set client [redis $host $port 0 $::tls]
+    if {[dict exists $srv "client"]} {
+        set old [dict get $srv "client"]
+        $old close
+    }
+    dict set srv "client" $client
+
+    # select the right db when we don't have to authenticate
+    if {![dict exists $config "requirepass"]} {
+        $client select 9
+    }
+
+    # re-set $srv in the servers list
+    lset ::servers end+$level $srv
+}
+
+proc redis_deferring_client {args} {
+    set level 0
+    if {[llength $args] > 0 && [string is integer [lindex $args 0]]} {
+        set level [lindex $args 0]
+        set args [lrange $args 1 end]
+    }
+
+    # create client that defers reading reply
+    set client [redis [srv $level "host"] [srv $level "port"] 1 $::tls]
+
+    # select the right db and read the response (OK)
+    $client select 9
+    $client read
+    return $client
+}
+
+proc redis_client {args} {
+    set level 0
+    if {[llength $args] > 0 && [string is integer [lindex $args 0]]} {
+        set level [lindex $args 0]
+        set args [lrange $args 1 end]
+    }
+
+    # create client that defers reading reply
+    set client [redis [srv $level "host"] [srv $level "port"] 0 $::tls]
+
+    # select the right db and read the response (OK)
+    $client select 9
+    return $client
+}
+
+# Provide easy access to INFO properties. Same semantic as "proc r".
+proc s {args} {
+    set level 0
+    if {[string is integer [lindex $args 0]]} {
+        set level [lindex $args 0]
+        set args [lrange $args 1 end]
+    }
+    status [srv $level "client"] [lindex $args 0]
+}
+
+# Test wrapped into run_solo are sent back from the client to the
+# test server, so that the test server will send them again to
+# clients once the clients are idle.
+proc run_solo {name code} {
+    if {$::numclients == 1 || $::loop || $::external} {
+        # run_solo is not supported in these scenarios, just run the code.
+        eval $code
+        return
+    }
+    send_data_packet $::test_server_fd run_solo [list $name $::curfile $code]
+}
+
+proc cleanup {} {
+    if {!$::quiet} {puts -nonewline "Cleanup: may take some time... "}
+    flush stdout
+    catch {exec rm -rf {*}[glob tests/tmp/redis.conf.*]}
+    catch {exec rm -rf {*}[glob tests/tmp/server.*]}
+    if {!$::quiet} {puts "OK"}
+}
+
+proc test_server_main {} {
+    cleanup
+    set tclsh [info nameofexecutable]
+    # Open a listening socket, trying different ports in order to find a
+    # non busy one.
+    set clientport [find_available_port [expr {$::baseport - 32}] 32]
+    if {!$::quiet} {
+        puts "Starting test server at port $clientport"
+    }
+    socket -server accept_test_clients  -myaddr 127.0.0.1 $clientport
+
+    # Start the client instances
+    set ::clients_pids {}
+    if {$::external} {
+        set p [exec $tclsh [info script] {*}$::argv \
+            --client $clientport &]
+        lappend ::clients_pids $p
+    } else {
+        set start_port $::baseport
+        set port_count [expr {$::portcount / $::numclients}]
+        for {set j 0} {$j < $::numclients} {incr j} {
+            set p [exec $tclsh [info script] {*}$::argv \
+                --client $clientport --baseport $start_port --portcount $port_count &]
+            lappend ::clients_pids $p
+            incr start_port $port_count
+        }
+    }
+
+    # Setup global state for the test server
+    set ::idle_clients {}
+    set ::active_clients {}
+    array set ::active_clients_task {}
+    array set ::clients_start_time {}
+    set ::clients_time_history {}
+    set ::failed_tests {}
+
+    # Enter the event loop to handle clients I/O
+    after 100 test_server_cron
+    vwait forever
+}
+
+# This function gets called 10 times per second.
+proc test_server_cron {} {
+    set elapsed [expr {[clock seconds]-$::last_progress}]
+
+    if {$elapsed > $::timeout} {
+        set err "\[[colorstr red TIMEOUT]\]: clients state report follows."
+        puts $err
+        lappend ::failed_tests $err
+        show_clients_state
+        kill_clients
+        force_kill_all_servers
+        the_end
+    }
+
+    after 100 test_server_cron
+}
+
+proc accept_test_clients {fd addr port} {
+    fconfigure $fd -encoding binary
+    fileevent $fd readable [list read_from_test_client $fd]
+}
+
+# This is the readable handler of our test server. Clients send us messages
+# in the form of a status code such and additional data. Supported
+# status types are:
+#
+# ready: the client is ready to execute the command. Only sent at client
+#        startup. The server will queue the client FD in the list of idle
+#        clients.
+# testing: just used to signal that a given test started.
+# ok: a test was executed with success.
+# err: a test was executed with an error.
+# skip: a test was skipped by skipfile or individual test options.
+# ignore: a test was skipped by a group tag.
+# exception: there was a runtime exception while executing the test.
+# done: all the specified test file was processed, this test client is
+#       ready to accept a new task.
+proc read_from_test_client fd {
+    set bytes [gets $fd]
+    set payload [read $fd $bytes]
+    foreach {status data} $payload break
+    set ::last_progress [clock seconds]
+
+    if {$status eq {ready}} {
+        if {!$::quiet} {
+            puts "\[$status\]: $data"
+        }
+        signal_idle_client $fd
+    } elseif {$status eq {done}} {
+        set elapsed [expr {[clock seconds]-$::clients_start_time($fd)}]
+        set all_tests_count [llength $::all_tests]
+        set running_tests_count [expr {[llength $::active_clients]-1}]
+        set completed_tests_count [expr {$::next_test-$running_tests_count}]
+        puts "\[$completed_tests_count/$all_tests_count [colorstr yellow $status]\]: $data ($elapsed seconds)"
+        lappend ::clients_time_history $elapsed $data
+        signal_idle_client $fd
+        set ::active_clients_task($fd) "(DONE) $data"
+    } elseif {$status eq {ok}} {
+        if {!$::quiet} {
+            puts "\[[colorstr green $status]\]: $data"
+        }
+        set ::active_clients_task($fd) "(OK) $data"
+    } elseif {$status eq {skip}} {
+        if {!$::quiet} {
+            puts "\[[colorstr yellow $status]\]: $data"
+        }
+    } elseif {$status eq {ignore}} {
+        if {!$::quiet} {
+            puts "\[[colorstr cyan $status]\]: $data"
+        }
+    } elseif {$status eq {err}} {
+        set err "\[[colorstr red $status]\]: $data"
+        puts $err
+        lappend ::failed_tests $err
+        set ::active_clients_task($fd) "(ERR) $data"
+        if {$::stop_on_failure} {
+            puts -nonewline "(Test stopped, press enter to resume the tests)"
+            flush stdout
+            gets stdin
+        }
+    } elseif {$status eq {exception}} {
+        puts "\[[colorstr red $status]\]: $data"
+        kill_clients
+        force_kill_all_servers
+        exit 1
+    } elseif {$status eq {testing}} {
+        set ::active_clients_task($fd) "(IN PROGRESS) $data"
+    } elseif {$status eq {server-spawning}} {
+        set ::active_clients_task($fd) "(SPAWNING SERVER) $data"
+    } elseif {$status eq {server-spawned}} {
+        lappend ::active_servers $data
+        set ::active_clients_task($fd) "(SPAWNED SERVER) pid:$data"
+    } elseif {$status eq {server-killing}} {
+        set ::active_clients_task($fd) "(KILLING SERVER) pid:$data"
+    } elseif {$status eq {server-killed}} {
+        set ::active_servers [lsearch -all -inline -not -exact $::active_servers $data]
+        set ::active_clients_task($fd) "(KILLED SERVER) pid:$data"
+    } elseif {$status eq {run_solo}} {
+        lappend ::run_solo_tests $data
+    } else {
+        if {!$::quiet} {
+            puts "\[$status\]: $data"
+        }
+    }
+}
+
+proc show_clients_state {} {
+    # The following loop is only useful for debugging tests that may
+    # enter an infinite loop.
+    foreach x $::active_clients {
+        if {[info exist ::active_clients_task($x)]} {
+            puts "$x => $::active_clients_task($x)"
+        } else {
+            puts "$x => ???"
+        }
+    }
+}
+
+proc kill_clients {} {
+    foreach p $::clients_pids {
+        catch {exec kill $p}
+    }
+}
+
+proc force_kill_all_servers {} {
+    foreach p $::active_servers {
+        puts "Killing still running Redis server $p"
+        catch {exec kill -9 $p}
+    }
+}
+
+proc lpop {listVar {count 1}} {
+    upvar 1 $listVar l
+    set ele [lindex $l 0]
+    set l [lrange $l 1 end]
+    set ele
+}
+
+proc lremove {listVar value} {
+    upvar 1 $listVar var
+    set idx [lsearch -exact $var $value]
+    set var [lreplace $var $idx $idx]
+}
+
+# A new client is idle. Remove it from the list of active clients and
+# if there are still test units to run, launch them.
+proc signal_idle_client fd {
+    # Remove this fd from the list of active clients.
+    set ::active_clients \
+        [lsearch -all -inline -not -exact $::active_clients $fd]
+
+    # New unit to process?
+    if {$::next_test != [llength $::all_tests]} {
+        if {!$::quiet} {
+            puts [colorstr bold-white "Testing [lindex $::all_tests $::next_test]"]
+            set ::active_clients_task($fd) "ASSIGNED: $fd ([lindex $::all_tests $::next_test])"
+        }
+        set ::clients_start_time($fd) [clock seconds]
+        send_data_packet $fd run [lindex $::all_tests $::next_test]
+        lappend ::active_clients $fd
+        incr ::next_test
+        if {$::loop && $::next_test == [llength $::all_tests]} {
+            set ::next_test 0
+        }
+    } elseif {[llength $::run_solo_tests] != 0 && [llength $::active_clients] == 0} {
+        if {!$::quiet} {
+            puts [colorstr bold-white "Testing solo test"]
+            set ::active_clients_task($fd) "ASSIGNED: $fd solo test"
+        }
+        set ::clients_start_time($fd) [clock seconds]
+        send_data_packet $fd run_code [lpop ::run_solo_tests]
+        lappend ::active_clients $fd
+    } else {
+        lappend ::idle_clients $fd
+        set ::active_clients_task($fd) "SLEEPING, no more units to assign"
+        if {[llength $::active_clients] == 0} {
+            the_end
+        }
+    }
+}
+
+# The the_end function gets called when all the test units were already
+# executed, so the test finished.
+proc the_end {} {
+    # TODO: print the status, exit with the right exit code.
+    puts "\n                   The End\n"
+    puts "Execution time of different units:"
+    foreach {time name} $::clients_time_history {
+        puts "  $time seconds - $name"
+    }
+    if {[llength $::failed_tests]} {
+        puts "\n[colorstr bold-red {!!! WARNING}] The following tests failed:\n"
+        foreach failed $::failed_tests {
+            puts "*** $failed"
+        }
+        if {!$::dont_clean} cleanup
+        exit 1
+    } else {
+        puts "\n[colorstr bold-white {\o/}] [colorstr bold-green {All tests passed without errors!}]\n"
+        if {!$::dont_clean} cleanup
+        exit 0
+    }
+}
+
+# The client is not even driven (the test server is instead) as we just need
+# to read the command, execute, reply... all this in a loop.
+proc test_client_main server_port {
+    set ::test_server_fd [socket localhost $server_port]
+    fconfigure $::test_server_fd -encoding binary
+    send_data_packet $::test_server_fd ready [pid]
+    while 1 {
+        set bytes [gets $::test_server_fd]
+        set payload [read $::test_server_fd $bytes]
+        foreach {cmd data} $payload break
+        if {$cmd eq {run}} {
+            execute_test_file $data
+        } elseif {$cmd eq {run_code}} {
+            foreach {name filename code} $data break
+            execute_test_code $name $filename $code
+        } else {
+            error "Unknown test client command: $cmd"
+        }
+    }
+}
+
+proc send_data_packet {fd status data} {
+    set payload [list $status $data]
+    puts $fd [string length $payload]
+    puts -nonewline $fd $payload
+    flush $fd
+}
+
+proc print_help_screen {} {
+    puts [join {
+        "--valgrind         Run the test over valgrind."
+        "--durable          suppress test crashes and keep running"
+        "--stack-logging    Enable OSX leaks/malloc stack logging."
+        "--accurate         Run slow randomized tests for more iterations."
+        "--quiet            Don't show individual tests."
+        "--single <unit>    Just execute the specified unit (see next option). This option can be repeated."
+        "--verbose          Increases verbosity."
+        "--list-tests       List all the available test units."
+        "--only <test>      Just execute the specified test by test name. This option can be repeated."
+        "--skip-till <unit> Skip all units until (and including) the specified one."
+        "--skipunit <unit>  Skip one unit."
+        "--clients <num>    Number of test clients (default 16)."
+        "--timeout <sec>    Test timeout in seconds (default 10 min)."
+        "--force-failure    Force the execution of a test that always fails."
+        "--config <k> <v>   Extra config file argument."
+        "--skipfile <file>  Name of a file containing test names that should be skipped (one per line)."
+        "--skiptest <name>  Name of a file containing test names that should be skipped (one per line)."
+        "--dont-clean       Don't delete redis log files after the run."
+        "--no-latency       Skip latency measurements and validation by some tests."
+        "--stop             Blocks once the first test fails."
+        "--loop             Execute the specified set of tests forever."
+        "--wait-server      Wait after server is started (so that you can attach a debugger)."
+        "--dump-logs        Dump server log on test failure."
+        "--tls              Run tests in TLS mode."
+        "--host <addr>      Run tests against an external host."
+        "--port <port>      TCP port to use against external host."
+        "--baseport <port>  Initial port number for spawned redis servers."
+        "--portcount <num>  Port range for spawned redis servers."
+        "--help             Print this help screen."
+    } "\n"]
+}
+
+# parse arguments
+for {set j 0} {$j < [llength $argv]} {incr j} {
+    set opt [lindex $argv $j]
+    set arg [lindex $argv [expr $j+1]]
+    if {$opt eq {--tags}} {
+        foreach tag $arg {
+            if {[string index $tag 0] eq "-"} {
+                lappend ::denytags [string range $tag 1 end]
+            } else {
+                lappend ::allowtags $tag
+            }
+        }
+        incr j
+    } elseif {$opt eq {--config}} {
+        set arg2 [lindex $argv [expr $j+2]]
+        lappend ::global_overrides $arg
+        lappend ::global_overrides $arg2
+        incr j 2
+    } elseif {$opt eq {--skipfile}} {
+        incr j
+        set fp [open $arg r]
+        set file_data [read $fp]
+        close $fp
+        set ::skiptests [split $file_data "\n"]
+    } elseif {$opt eq {--skiptest}} {
+        lappend ::skiptests $arg
+        incr j
+    } elseif {$opt eq {--valgrind}} {
+        set ::valgrind 1
+    } elseif {$opt eq {--stack-logging}} {
+        if {[string match {*Darwin*} [exec uname -a]]} {
+            set ::stack_logging 1
+        }
+    } elseif {$opt eq {--quiet}} {
+        set ::quiet 1
+    } elseif {$opt eq {--tls}} {
+        package require tls 1.6
+        set ::tls 1
+        ::tls::init \
+            -cafile "$::tlsdir/ca.crt" \
+            -certfile "$::tlsdir/client.crt" \
+            -keyfile "$::tlsdir/client.key"
+    } elseif {$opt eq {--host}} {
+        set ::external 1
+        set ::host $arg
+        incr j
+    } elseif {$opt eq {--port}} {
+        set ::port $arg
+        incr j
+    } elseif {$opt eq {--baseport}} {
+        set ::baseport $arg
+        incr j
+    } elseif {$opt eq {--portcount}} {
+        set ::portcount $arg
+        incr j
+    } elseif {$opt eq {--accurate}} {
+        set ::accurate 1
+    } elseif {$opt eq {--force-failure}} {
+        set ::force_failure 1
+    } elseif {$opt eq {--single}} {
+        lappend ::single_tests $arg
+        incr j
+    } elseif {$opt eq {--only}} {
+        lappend ::only_tests $arg
+        incr j
+    } elseif {$opt eq {--skipunit}} {
+        lappend ::skipunits $arg
+        incr j
+    } elseif {$opt eq {--skip-till}} {
+        set ::skip_till $arg
+        incr j
+    } elseif {$opt eq {--list-tests}} {
+        foreach t $::all_tests {
+            puts $t
+        }
+        exit 0
+    } elseif {$opt eq {--verbose}} {
+        set ::verbose 1
+    } elseif {$opt eq {--client}} {
+        set ::client 1
+        set ::test_server_port $arg
+        incr j
+    } elseif {$opt eq {--clients}} {
+        set ::numclients $arg
+        incr j
+    } elseif {$opt eq {--durable}} {
+        set ::durable 1
+    } elseif {$opt eq {--dont-clean}} {
+        set ::dont_clean 1
+    } elseif {$opt eq {--no-latency}} {
+        set ::no_latency 1
+    } elseif {$opt eq {--wait-server}} {
+        set ::wait_server 1
+    } elseif {$opt eq {--dump-logs}} {
+        set ::dump_logs 1
+    } elseif {$opt eq {--stop}} {
+        set ::stop_on_failure 1
+    } elseif {$opt eq {--loop}} {
+        set ::loop 1
+    } elseif {$opt eq {--timeout}} {
+        set ::timeout $arg
+        incr j
+    } elseif {$opt eq {--help}} {
+        print_help_screen
+        exit 0
+    } else {
+        puts "Wrong argument: $opt"
+        exit 1
+    }
+}
+
+set filtered_tests {}
+
+# Set the filtered tests to be the short list (single_tests) if exists.
+# Otherwise, we start filtering all_tests
+if {[llength $::single_tests] > 0} {
+    set filtered_tests $::single_tests
+} else {
+    set filtered_tests $::all_tests
+}
+
+# If --skip-till option was given, we populate the list of single tests
+# to run with everything *after* the specified unit.
+if {$::skip_till != ""} {
+    set skipping 1
+    foreach t $::all_tests {
+        if {$skipping == 1} {
+            lremove filtered_tests $t
+        }
+        if {$t == $::skip_till} {
+            set skipping 0
+        }
+    }
+    if {$skipping} {
+        puts "test $::skip_till not found"
+        exit 0
+    }
+}
+
+# If --skipunits option was given, we populate the list of single tests
+# to run with everything *not* in the skipunits list.
+if {[llength $::skipunits] > 0} {
+    foreach t $::all_tests {
+        if {[lsearch $::skipunits $t] != -1} {
+            lremove filtered_tests $t
+        }
+    }
+}
+
+# Override the list of tests with the specific tests we want to run
+# in case there was some filter, that is --single, -skipunit or --skip-till options.
+if {[llength $filtered_tests] < [llength $::all_tests]} {
+    set ::all_tests $filtered_tests
+}
+
+proc attach_to_replication_stream {} {
+    r config set repl-ping-replica-period 3600
+    if {$::tls} {
+        set s [::tls::socket [srv 0 "host"] [srv 0 "port"]]
+    } else {
+        set s [socket [srv 0 "host"] [srv 0 "port"]]
+    }
+    fconfigure $s -translation binary
+    puts -nonewline $s "SYNC\r\n"
+    flush $s
+
+    # Get the count
+    while 1 {
+        set count [gets $s]
+        set prefix [string range $count 0 0]
+        if {$prefix ne {}} break; # Newlines are allowed as PINGs.
+    }
+    if {$prefix ne {$}} {
+        error "attach_to_replication_stream error. Received '$count' as count."
+    }
+    set count [string range $count 1 end]
+
+    # Consume the bulk payload
+    while {$count} {
+        set buf [read $s $count]
+        set count [expr {$count-[string length $buf]}]
+    }
+    return $s
+}
+
+proc read_from_replication_stream {s} {
+    fconfigure $s -blocking 0
+    set attempt 0
+    while {[gets $s count] == -1} {
+        if {[incr attempt] == 10} return ""
+        after 100
+    }
+    fconfigure $s -blocking 1
+    set count [string range $count 1 end]
+
+    # Return a list of arguments for the command.
+    set res {}
+    for {set j 0} {$j < $count} {incr j} {
+        read $s 1
+        set arg [::redis::redis_bulk_read $s]
+        if {$j == 0} {set arg [string tolower $arg]}
+        lappend res $arg
+    }
+    return $res
+}
+
+proc assert_replication_stream {s patterns} {
+    for {set j 0} {$j < [llength $patterns]} {incr j} {
+        assert_match [lindex $patterns $j] [read_from_replication_stream $s]
+    }
+}
+
+proc close_replication_stream {s} {
+    close $s
+    r config set repl-ping-replica-period 10
+}
+
+# With the parallel test running multiple Redis instances at the same time
+# we need a fast enough computer, otherwise a lot of tests may generate
+# false positives.
+# If the computer is too slow we revert the sequential test without any
+# parallelism, that is, clients == 1.
+proc is_a_slow_computer {} {
+    set start [clock milliseconds]
+    for {set j 0} {$j < 1000000} {incr j} {}
+    set elapsed [expr [clock milliseconds]-$start]
+    expr {$elapsed > 200}
+}
+
+if {$::client} {
+    if {[catch { test_client_main $::test_server_port } err]} {
+        set estr "Executing test client: $err.\n$::errorInfo"
+        if {[catch {send_data_packet $::test_server_fd exception $estr}]} {
+            puts $estr
+        }
+        exit 1
+    }
+} else {
+    if {[is_a_slow_computer]} {
+        puts "** SLOW COMPUTER ** Using a single client to avoid false positives."
+        set ::numclients 1
+    }
+
+    if {[catch { test_server_main } err]} {
+        if {[string length $err] > 0} {
+            # only display error when not generated by the test suite
+            if {$err ne "exception"} {
+                puts $::errorInfo
+            }
+            exit 1
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/acl.tcl b/redis-stable/tests/unit/acl.tcl
new file mode 100644
index 00000000..3424c044
--- /dev/null
+++ b/redis-stable/tests/unit/acl.tcl
@@ -0,0 +1,631 @@
+start_server {tags {"acl"}} {
+    test {Connections start with the default user} {
+        r ACL WHOAMI
+    } {default}
+
+    test {It is possible to create new users} {
+        r ACL setuser newuser
+    }
+
+    test {New users start disabled} {
+        r ACL setuser newuser >passwd1
+        catch {r AUTH newuser passwd1} err
+        set err
+    } {*WRONGPASS*}
+
+    test {Enabling the user allows the login} {
+        r ACL setuser newuser on +acl
+        r AUTH newuser passwd1
+        r ACL WHOAMI
+    } {newuser}
+
+    test {Only the set of correct passwords work} {
+        r ACL setuser newuser >passwd2
+        catch {r AUTH newuser passwd1} e
+        assert {$e eq "OK"}
+        catch {r AUTH newuser passwd2} e
+        assert {$e eq "OK"}
+        catch {r AUTH newuser passwd3} e
+        set e
+    } {*WRONGPASS*}
+
+    test {It is possible to remove passwords from the set of valid ones} {
+        r ACL setuser newuser <passwd1
+        catch {r AUTH newuser passwd1} e
+        set e
+    } {*WRONGPASS*}
+
+    test {Test password hashes can be added} {
+        r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6
+        catch {r AUTH newuser passwd4} e
+        assert {$e eq "OK"}
+    }
+
+    test {Test password hashes validate input} {
+        # Validate Length
+        catch {r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e} e
+        # Validate character outside set
+        catch {r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4eq} e
+        set e
+    } {*Error in ACL SETUSER modifier*}
+
+    test {ACL GETUSER returns the password hash instead of the actual password} {
+        set passstr [dict get [r ACL getuser newuser] passwords]
+        assert_match {*34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6*} $passstr
+        assert_no_match {*passwd4*} $passstr
+    }
+
+    test {Test hashed passwords removal} {
+        r ACL setuser newuser !34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6
+        set passstr [dict get [r ACL getuser newuser] passwords]
+        assert_no_match {*34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6*} $passstr
+    }
+
+    test {By default users are not able to access any command} {
+        catch {r SET foo bar} e
+        set e
+    } {*NOPERM*}
+
+    test {By default users are not able to access any key} {
+        r ACL setuser newuser +set
+        catch {r SET foo bar} e
+        set e
+    } {*NOPERM*key*}
+
+    test {It's possible to allow the access of a subset of keys} {
+        r ACL setuser newuser allcommands ~foo:* ~bar:*
+        r SET foo:1 a
+        r SET bar:2 b
+        catch {r SET zap:3 c} e
+        r ACL setuser newuser allkeys; # Undo keys ACL
+        set e
+    } {*NOPERM*key*}
+
+    test {By default users are able to publish to any channel} {
+        r ACL setuser psuser on >pspass +acl +client +@pubsub
+        r AUTH psuser pspass
+        r PUBLISH foo bar
+    } {0}
+
+    test {By default users are able to subscribe to any channel} {
+        set rd [redis_deferring_client]
+        $rd AUTH psuser pspass
+        $rd read
+        $rd SUBSCRIBE foo
+        assert_match {subscribe foo 1} [$rd read]
+        $rd close
+    } {0}
+
+    test {By default users are able to subscribe to any pattern} {
+        set rd [redis_deferring_client]
+        $rd AUTH psuser pspass
+        $rd read
+        $rd PSUBSCRIBE bar*
+        assert_match {psubscribe bar\* 1} [$rd read]
+        $rd close
+    } {0}
+
+    test {It's possible to allow publishing to a subset of channels} {
+        r ACL setuser psuser resetchannels &foo:1 &bar:*
+        assert_equal {0} [r PUBLISH foo:1 somemessage]
+        assert_equal {0} [r PUBLISH bar:2 anothermessage]
+        catch {r PUBLISH zap:3 nosuchmessage} e
+        set e
+    } {*NOPERM*channel*}
+
+    test {Validate subset of channels is prefixed with resetchannels flag} {
+        r ACL setuser hpuser on nopass resetchannels &foo +@all
+
+        # Verify resetchannels flag is prefixed before the channel name(s)
+        set users [r ACL LIST]
+        set curruser "hpuser"
+        foreach user [lshuffle $users] {
+            if {[string first $curruser $user] != -1} {
+                assert_equal {user hpuser on nopass resetchannels &foo +@all} $user
+            }
+        }
+
+        # authenticate as hpuser
+        r AUTH hpuser pass
+
+        assert_equal {0} [r PUBLISH foo bar]
+        catch {r PUBLISH bar game} e
+
+        # Falling back to psuser for the below tests
+        r AUTH psuser pspass
+        r ACL deluser hpuser
+        set e
+    } {*NOPERM*channel*}
+
+    test {In transaction queue publish/subscribe/psubscribe to unauthorized channel will fail} {
+        r ACL setuser psuser +multi +discard
+        r MULTI
+        catch {r PUBLISH notexits helloworld} e
+        r DISCARD
+        assert_match {*NOPERM*} $e
+        r MULTI
+        catch {r SUBSCRIBE notexits foo:1} e
+        r DISCARD
+        assert_match {*NOPERM*} $e
+        r MULTI
+        catch {r PSUBSCRIBE notexits:* bar:*} e
+        r DISCARD
+        assert_match {*NOPERM*} $e
+    }
+
+    test {It's possible to allow subscribing to a subset of channels} {
+        set rd [redis_deferring_client]
+        $rd AUTH psuser pspass
+        $rd read
+        $rd SUBSCRIBE foo:1
+        assert_match {subscribe foo:1 1} [$rd read]
+        $rd SUBSCRIBE bar:2
+        assert_match {subscribe bar:2 2} [$rd read]
+        $rd SUBSCRIBE zap:3
+        catch {$rd read} e
+        set e
+    } {*NOPERM*channel*}
+
+    test {It's possible to allow subscribing to a subset of channel patterns} {
+        set rd [redis_deferring_client]
+        $rd AUTH psuser pspass
+        $rd read
+        $rd PSUBSCRIBE foo:1
+        assert_match {psubscribe foo:1 1} [$rd read]
+        $rd PSUBSCRIBE bar:*
+        assert_match {psubscribe bar:\* 2} [$rd read]
+        $rd PSUBSCRIBE bar:baz
+        catch {$rd read} e
+        set e
+    } {*NOPERM*channel*}
+    
+    test {Subscribers are killed when revoked of channel permission} {
+        set rd [redis_deferring_client]
+        r ACL setuser psuser resetchannels &foo:1
+        $rd AUTH psuser pspass
+        $rd read
+        $rd CLIENT SETNAME deathrow
+        $rd read
+        $rd SUBSCRIBE foo:1
+        $rd read
+        r ACL setuser psuser resetchannels
+        assert_no_match {*deathrow*} [r CLIENT LIST]
+        $rd close
+    } {0}
+
+    test {Subscribers are killed when revoked of pattern permission} {
+        set rd [redis_deferring_client]
+        r ACL setuser psuser resetchannels &bar:*
+        $rd AUTH psuser pspass
+        $rd read
+        $rd CLIENT SETNAME deathrow
+        $rd read
+        $rd PSUBSCRIBE bar:*
+        $rd read
+        r ACL setuser psuser resetchannels
+        assert_no_match {*deathrow*} [r CLIENT LIST]
+        $rd close
+    } {0}
+
+    test {Subscribers are pardoned if literal permissions are retained and/or gaining allchannels} {
+        set rd [redis_deferring_client]
+        r ACL setuser psuser resetchannels &foo:1 &bar:*
+        $rd AUTH psuser pspass
+        $rd read
+        $rd CLIENT SETNAME pardoned
+        $rd read
+        $rd SUBSCRIBE foo:1
+        $rd read
+        $rd PSUBSCRIBE bar:*
+        $rd read
+        r ACL setuser psuser resetchannels &foo:1 &bar:* &baz:qaz &zoo:*
+        assert_match {*pardoned*} [r CLIENT LIST]
+        r ACL setuser psuser allchannels
+        assert_match {*pardoned*} [r CLIENT LIST]
+        $rd close
+    } {0}
+
+    test {Users can be configured to authenticate with any password} {
+        r ACL setuser newuser nopass
+        r AUTH newuser zipzapblabla
+    } {OK}
+
+    test {ACLs can exclude single commands} {
+        r ACL setuser newuser -ping
+        r INCR mycounter ; # Should not raise an error
+        catch {r PING} e
+        set e
+    } {*NOPERM*}
+
+    test {ACLs can include or exclude whole classes of commands} {
+        r ACL setuser newuser -@all +@set +acl
+        r SADD myset a b c; # Should not raise an error
+        r ACL setuser newuser +@all -@string
+        r SADD myset a b c; # Again should not raise an error
+        # String commands instead should raise an error
+        catch {r SET foo bar} e
+        r ACL setuser newuser allcommands; # Undo commands ACL
+        set e
+    } {*NOPERM*}
+
+    test {ACLs can include single subcommands} {
+        r ACL setuser newuser +@all -client
+        r ACL setuser newuser +client|id +client|setname
+        r CLIENT ID; # Should not fail
+        r CLIENT SETNAME foo ; # Should not fail
+        catch {r CLIENT KILL type master} e
+        set e
+    } {*NOPERM*}
+
+    test {ACLs set can include subcommands, if already full command exists} {
+        r ACL setuser bob +memory|doctor
+        set cmdstr [dict get [r ACL getuser bob] commands]
+        assert_equal {-@all +memory|doctor} $cmdstr
+
+        # Validate the commands have got engulfed to +memory.
+        r ACL setuser bob +memory
+        set cmdstr [dict get [r ACL getuser bob] commands]
+        assert_equal {-@all +memory} $cmdstr
+
+        # Appending to the existing access string of bob.
+        r ACL setuser bob +@all +client|id
+        # Validate the new commands has got engulfed to +@all.
+        set cmdstr [dict get [r ACL getuser bob] commands]
+        assert_equal {+@all} $cmdstr
+        r CLIENT ID; # Should not fail
+        r MEMORY DOCTOR; # Should not fail
+    }
+
+    # Note that the order of the generated ACL rules is not stable in Redis
+    # so we need to match the different parts and not as a whole string.
+    test {ACL GETUSER is able to translate back command permissions} {
+        # Subtractive
+        r ACL setuser newuser reset +@all ~* -@string +incr -debug +debug|digest
+        set cmdstr [dict get [r ACL getuser newuser] commands]
+        assert_match {*+@all*} $cmdstr
+        assert_match {*-@string*} $cmdstr
+        assert_match {*+incr*} $cmdstr
+        assert_match {*-debug +debug|digest**} $cmdstr
+
+        # Additive
+        r ACL setuser newuser reset +@string -incr +acl +debug|digest +debug|segfault
+        set cmdstr [dict get [r ACL getuser newuser] commands]
+        assert_match {*-@all*} $cmdstr
+        assert_match {*+@string*} $cmdstr
+        assert_match {*-incr*} $cmdstr
+        assert_match {*+debug|digest*} $cmdstr
+        assert_match {*+debug|segfault*} $cmdstr
+        assert_match {*+acl*} $cmdstr
+    }
+
+    # A regression test make sure that as long as there is a simple
+    # category defining the commands, that it will be used as is.
+    test {ACL GETUSER provides reasonable results} {
+        set categories [r ACL CAT]
+
+        # Test that adding each single category will
+        # result in just that category with both +@all and -@all
+        foreach category $categories {
+            # Test for future commands where allowed
+            r ACL setuser additive reset +@all "-@$category"
+            set cmdstr [dict get [r ACL getuser additive] commands]
+            assert_equal "+@all -@$category" $cmdstr
+
+            # Test for future commands where disallowed
+            r ACL setuser restrictive reset -@all "+@$category"
+            set cmdstr [dict get [r ACL getuser restrictive] commands]
+            assert_equal "-@all +@$category" $cmdstr
+        }
+    }
+
+    test {ACL #5998 regression: memory leaks adding / removing subcommands} {
+        r AUTH default ""
+        r ACL setuser newuser reset -debug +debug|a +debug|b +debug|c
+        r ACL setuser newuser -debug
+        # The test framework will detect a leak if any.
+    }
+
+    test {ACL LOG shows failed command executions at toplevel} {
+        r ACL LOG RESET
+        r ACL setuser antirez >foo on +set ~object:1234
+        r ACL setuser antirez +eval +multi +exec
+        r ACL setuser antirez resetchannels +publish
+        r AUTH antirez foo
+        catch {r GET foo}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry username] eq {antirez}}
+        assert {[dict get $entry context] eq {toplevel}}
+        assert {[dict get $entry reason] eq {command}}
+        assert {[dict get $entry object] eq {get}}
+    }
+
+    test {ACL LOG is able to test similar events} {
+        r AUTH antirez foo
+        catch {r GET foo}
+        catch {r GET foo}
+        catch {r GET foo}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry count] == 4}
+    }
+
+    test {ACL LOG is able to log keys access violations and key name} {
+        r AUTH antirez foo
+        catch {r SET somekeynotallowed 1234}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry reason] eq {key}}
+        assert {[dict get $entry object] eq {somekeynotallowed}}
+    }
+
+    test {ACL LOG is able to log channel access violations and channel name} {
+        r AUTH antirez foo
+        catch {r PUBLISH somechannelnotallowed nullmsg}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry reason] eq {channel}}
+        assert {[dict get $entry object] eq {somechannelnotallowed}}
+    }
+
+    test {ACL LOG RESET is able to flush the entries in the log} {
+        r ACL LOG RESET
+        assert {[llength [r ACL LOG]] == 0}
+    }
+
+    test {ACL LOG can distinguish the transaction context (1)} {
+        r AUTH antirez foo
+        r MULTI
+        catch {r INCR foo}
+        catch {r EXEC}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry context] eq {multi}}
+        assert {[dict get $entry object] eq {incr}}
+    }
+
+    test {ACL LOG can distinguish the transaction context (2)} {
+        set rd1 [redis_deferring_client]
+        r ACL SETUSER antirez +incr
+
+        r AUTH antirez foo
+        r MULTI
+        r INCR object:1234
+        $rd1 ACL SETUSER antirez -incr
+        $rd1 read
+        catch {r EXEC}
+        $rd1 close
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry context] eq {multi}}
+        assert {[dict get $entry object] eq {incr}}
+        r ACL SETUSER antirez -incr
+    }
+
+    test {ACL can log errors in the context of Lua scripting} {
+        r AUTH antirez foo
+        catch {r EVAL {redis.call('incr','foo')} 0}
+        r AUTH default ""
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry context] eq {lua}}
+        assert {[dict get $entry object] eq {incr}}
+    }
+
+    test {ACL LOG can accept a numerical argument to show less entries} {
+        r AUTH antirez foo
+        catch {r INCR foo}
+        catch {r INCR foo}
+        catch {r INCR foo}
+        catch {r INCR foo}
+        r AUTH default ""
+        assert {[llength [r ACL LOG]] > 1}
+        assert {[llength [r ACL LOG 2]] == 2}
+    }
+
+    test {ACL LOG can log failed auth attempts} {
+        catch {r AUTH antirez wrong-password}
+        set entry [lindex [r ACL LOG] 0]
+        assert {[dict get $entry context] eq {toplevel}}
+        assert {[dict get $entry reason] eq {auth}}
+        assert {[dict get $entry object] eq {AUTH}}
+        assert {[dict get $entry username] eq {antirez}}
+    }
+
+    test {ACL LOG entries are limited to a maximum amount} {
+        r ACL LOG RESET
+        r CONFIG SET acllog-max-len 5
+        r AUTH antirez foo
+        for {set j 0} {$j < 10} {incr j} {
+            catch {r SET obj:$j 123}
+        }
+        r AUTH default ""
+        assert {[llength [r ACL LOG]] == 5}
+    }
+
+    test {When default user is off, new connections are not authenticated} {
+        r ACL setuser default off
+        catch {set rd1 [redis_deferring_client]} e
+        r ACL setuser default on
+        set e
+    } {*NOAUTH*}
+
+    test {When default user has no command permission, hello command still works for other users} {
+        r ACL setuser secure-user >supass on +@all
+        r ACL setuser default -@all
+        r HELLO 2 AUTH secure-user supass
+        r ACL setuser default nopass +@all
+        r AUTH default ""
+    }
+
+    test {ACL HELP should not have unexpected options} {
+        catch {r ACL help xxx} e
+        assert_match "*Unknown subcommand or wrong number of arguments*" $e
+    }
+
+    test {Delete a user that the client doesn't use} {
+        r ACL setuser not_used on >passwd
+        assert {[r ACL deluser not_used] == 1}
+        # The client is not closed
+        assert {[r ping] eq {PONG}}
+    }
+
+    test {Delete a user that the client is using} {
+        r ACL setuser using on +acl >passwd
+        r AUTH using passwd
+        # The client will receive reply normally
+        assert {[r ACL deluser using] == 1}
+        # The client is closed
+        catch {[r ping]} e
+        assert_match "*I/O error*" $e
+    }
+}
+
+set server_path [tmpdir "server.acl"]
+exec cp -f tests/assets/user.acl $server_path
+start_server [list overrides [list "dir" $server_path "aclfile" "user.acl"]] {
+    # user alice on allcommands allkeys >alice
+    # user bob on -@all +@set +acl ~set* >bob
+    # user default on nopass ~* +@all
+
+    test {default: load from include file, can access any channels} {
+        r SUBSCRIBE foo
+        r PSUBSCRIBE bar*
+        r UNSUBSCRIBE
+        r PUNSUBSCRIBE
+        r PUBLISH hello world
+    }
+
+    test {default: with config acl-pubsub-default allchannels after reset, can access any channels} {
+        r ACL setuser default reset on nopass ~* +@all
+        r SUBSCRIBE foo
+        r PSUBSCRIBE bar*
+        r UNSUBSCRIBE
+        r PUNSUBSCRIBE
+        r PUBLISH hello world
+    }
+
+    test {default: with config acl-pubsub-default resetchannels after reset, can not access any channels} {
+        r CONFIG SET acl-pubsub-default resetchannels
+        r ACL setuser default reset on nopass ~* +@all
+        catch {r SUBSCRIBE foo} e
+        assert_match {*NOPERM*} $e
+        catch {r PSUBSCRIBE bar*} e
+        assert_match {*NOPERM*} $e
+        catch {r PUBLISH hello world} e
+        assert_match {*NOPERM*} $e
+        r CONFIG SET acl-pubsub-default resetchannels
+    }
+
+    test {Alice: can execute all command} {
+        r AUTH alice alice
+        assert_equal "alice" [r acl whoami]
+        r SET key value
+    }
+
+    test {Bob: just execute @set and acl command} {
+        r AUTH bob bob
+        assert_equal "bob" [r acl whoami]
+        assert_equal "3" [r sadd set 1 2 3]
+        catch {r SET key value} e
+        set e
+    } {*NOPERM*}
+
+    test {ACL load and save} {
+        r ACL setuser eve +get allkeys >eve on
+        r ACL save
+
+        # ACL load will free user and kill clients
+        r ACL load
+        catch {r ACL LIST} e
+        assert_match {*I/O error*} $e
+
+        reconnect
+        r AUTH alice alice
+        r SET key value
+        r AUTH eve eve
+        r GET key
+        catch {r SET key value} e
+        set e
+    } {*NOPERM*}
+
+    test {ACL load and save with restricted channels} {
+        r AUTH alice alice
+        r ACL setuser harry on nopass resetchannels &test +@all ~*
+        r ACL save
+
+        # ACL load will free user and kill clients
+        r ACL load
+        catch {r ACL LIST} e
+        assert_match {*I/O error*} $e
+
+        reconnect
+        r AUTH harry anything
+        r publish test bar
+        catch {r publish test1 bar} e
+        r ACL deluser harry
+        set e
+    } {*NOPERM*}
+}
+
+set server_path [tmpdir "resetchannels.acl"]
+exec cp -f tests/assets/nodefaultuser.acl $server_path
+exec cp -f tests/assets/default.conf $server_path
+start_server [list overrides [list "dir" $server_path "acl-pubsub-default" "resetchannels" "aclfile" "nodefaultuser.acl"]] {
+
+    test {Default user has access to all channels irrespective of flag} {
+        set channelinfo [dict get [r ACL getuser default] channels]
+        assert_equal "*" $channelinfo
+        set channelinfo [dict get [r ACL getuser alice] channels]
+        assert_equal "" $channelinfo
+    }
+
+    test {Update acl-pubsub-default, existing users shouldn't get affected} {
+        set channelinfo [dict get [r ACL getuser default] channels]
+        assert_equal "*" $channelinfo
+        r CONFIG set acl-pubsub-default allchannels
+        r ACL setuser mydefault
+        set channelinfo [dict get [r ACL getuser mydefault] channels]
+        assert_equal "*" $channelinfo
+        r CONFIG set acl-pubsub-default resetchannels
+        set channelinfo [dict get [r ACL getuser mydefault] channels]
+        assert_equal "*" $channelinfo
+    }
+
+    test {Single channel is valid} {
+        r ACL setuser onechannel &test
+        set channelinfo [dict get [r ACL getuser onechannel] channels]
+        assert_equal test $channelinfo
+        r ACL deluser onechannel
+    }
+
+    test {Single channel is not valid with allchannels} {
+        r CONFIG set acl-pubsub-default allchannels
+        catch {r ACL setuser onechannel &test} err
+        r CONFIG set acl-pubsub-default resetchannels
+        set err
+    } {*start with an empty list of channels*}
+}
+
+set server_path [tmpdir "resetchannels.acl"]
+exec cp -f tests/assets/nodefaultuser.acl $server_path
+exec cp -f tests/assets/default.conf $server_path
+start_server [list overrides [list "dir" $server_path "acl-pubsub-default" "resetchannels" "aclfile" "nodefaultuser.acl"]] {
+
+    test {Only default user has access to all channels irrespective of flag} {
+        set channelinfo [dict get [r ACL getuser default] channels]
+        assert_equal "*" $channelinfo
+        set channelinfo [dict get [r ACL getuser alice] channels]
+        assert_equal "" $channelinfo
+    }
+}
+
+
+start_server {overrides {user "default on nopass ~* +@all"}} {
+    test {default: load from config file, can access any channels} {
+        r SUBSCRIBE foo
+        r PSUBSCRIBE bar*
+        r UNSUBSCRIBE
+        r PUNSUBSCRIBE
+        r PUBLISH hello world
+    }
+}
diff --git a/redis-stable/tests/unit/aofrw.tcl b/redis-stable/tests/unit/aofrw.tcl
new file mode 100644
index 00000000..5bdf8725
--- /dev/null
+++ b/redis-stable/tests/unit/aofrw.tcl
@@ -0,0 +1,206 @@
+start_server {tags {"aofrw"}} {
+    # Enable the AOF
+    r config set appendonly yes
+    r config set auto-aof-rewrite-percentage 0 ; # Disable auto-rewrite.
+    waitForBgrewriteaof r
+
+    foreach rdbpre {yes no} {
+        r config set aof-use-rdb-preamble $rdbpre
+        test "AOF rewrite during write load: RDB preamble=$rdbpre" {
+            # Start a write load for 10 seconds
+            set master [srv 0 client]
+            set master_host [srv 0 host]
+            set master_port [srv 0 port]
+            set load_handle0 [start_write_load $master_host $master_port 10]
+            set load_handle1 [start_write_load $master_host $master_port 10]
+            set load_handle2 [start_write_load $master_host $master_port 10]
+            set load_handle3 [start_write_load $master_host $master_port 10]
+            set load_handle4 [start_write_load $master_host $master_port 10]
+
+            # Make sure the instance is really receiving data
+            wait_for_condition 50 100 {
+                [r dbsize] > 0
+            } else {
+                fail "No write load detected."
+            }
+
+            # After 3 seconds, start a rewrite, while the write load is still
+            # active.
+            after 3000
+            r bgrewriteaof
+            waitForBgrewriteaof r
+
+            # Let it run a bit more so that we'll append some data to the new
+            # AOF.
+            after 1000
+
+            # Stop the processes generating the load if they are still active
+            stop_write_load $load_handle0
+            stop_write_load $load_handle1
+            stop_write_load $load_handle2
+            stop_write_load $load_handle3
+            stop_write_load $load_handle4
+
+            # Make sure no more commands processed, before taking debug digest
+            wait_load_handlers_disconnected
+
+            # Get the data set digest
+            set d1 [r debug digest]
+
+            # Load the AOF
+            r debug loadaof
+            set d2 [r debug digest]
+
+            # Make sure they are the same
+            assert {$d1 eq $d2}
+        }
+    }
+}
+
+start_server {tags {"aofrw"} overrides {aof-use-rdb-preamble no}} {
+    test {Turning off AOF kills the background writing child if any} {
+        r config set appendonly yes
+        waitForBgrewriteaof r
+        r multi
+        r bgrewriteaof
+        r config set appendonly no
+        r exec
+        wait_for_condition 50 100 {
+            [string match {*Killing*AOF*child*} [exec tail -5 < [srv 0 stdout]]]
+        } else {
+            fail "Can't find 'Killing AOF child' into recent logs"
+        }
+    }
+
+    foreach d {string int} {
+        foreach e {quicklist} {
+            test "AOF rewrite of list with $e encoding, $d data" {
+                r flushall
+                set len 1000
+                for {set j 0} {$j < $len} {incr j} {
+                    if {$d eq {string}} {
+                        set data [randstring 0 16 alpha]
+                    } else {
+                        set data [randomInt 4000000000]
+                    }
+                    r lpush key $data
+                }
+                assert_equal [r object encoding key] $e
+                set d1 [r debug digest]
+                r bgrewriteaof
+                waitForBgrewriteaof r
+                r debug loadaof
+                set d2 [r debug digest]
+                if {$d1 ne $d2} {
+                    error "assertion:$d1 is not equal to $d2"
+                }
+            }
+        }
+    }
+
+    foreach d {string int} {
+        foreach e {intset hashtable} {
+            test "AOF rewrite of set with $e encoding, $d data" {
+                r flushall
+                if {$e eq {intset}} {set len 10} else {set len 1000}
+                for {set j 0} {$j < $len} {incr j} {
+                    if {$d eq {string}} {
+                        set data [randstring 0 16 alpha]
+                    } else {
+                        set data [randomInt 4000000000]
+                    }
+                    r sadd key $data
+                }
+                if {$d ne {string}} {
+                    assert_equal [r object encoding key] $e
+                }
+                set d1 [r debug digest]
+                r bgrewriteaof
+                waitForBgrewriteaof r
+                r debug loadaof
+                set d2 [r debug digest]
+                if {$d1 ne $d2} {
+                    error "assertion:$d1 is not equal to $d2"
+                }
+            }
+        }
+    }
+
+    foreach d {string int} {
+        foreach e {ziplist hashtable} {
+            test "AOF rewrite of hash with $e encoding, $d data" {
+                r flushall
+                if {$e eq {ziplist}} {set len 10} else {set len 1000}
+                for {set j 0} {$j < $len} {incr j} {
+                    if {$d eq {string}} {
+                        set data [randstring 0 16 alpha]
+                    } else {
+                        set data [randomInt 4000000000]
+                    }
+                    r hset key $data $data
+                }
+                assert_equal [r object encoding key] $e
+                set d1 [r debug digest]
+                r bgrewriteaof
+                waitForBgrewriteaof r
+                r debug loadaof
+                set d2 [r debug digest]
+                if {$d1 ne $d2} {
+                    error "assertion:$d1 is not equal to $d2"
+                }
+            }
+        }
+    }
+
+    foreach d {string int} {
+        foreach e {ziplist skiplist} {
+            test "AOF rewrite of zset with $e encoding, $d data" {
+                r flushall
+                if {$e eq {ziplist}} {set len 10} else {set len 1000}
+                for {set j 0} {$j < $len} {incr j} {
+                    if {$d eq {string}} {
+                        set data [randstring 0 16 alpha]
+                    } else {
+                        set data [randomInt 4000000000]
+                    }
+                    r zadd key [expr rand()] $data
+                }
+                assert_equal [r object encoding key] $e
+                set d1 [r debug digest]
+                r bgrewriteaof
+                waitForBgrewriteaof r
+                r debug loadaof
+                set d2 [r debug digest]
+                if {$d1 ne $d2} {
+                    error "assertion:$d1 is not equal to $d2"
+                }
+            }
+        }
+    }
+
+    test {BGREWRITEAOF is delayed if BGSAVE is in progress} {
+        r multi
+        r bgsave
+        r bgrewriteaof
+        r info persistence
+        set res [r exec]
+        assert_match {*scheduled*} [lindex $res 1]
+        assert_match {*aof_rewrite_scheduled:1*} [lindex $res 2]
+        while {[string match {*aof_rewrite_scheduled:1*} [r info persistence]]} {
+            after 100
+        }
+    }
+
+    test {BGREWRITEAOF is refused if already in progress} {
+        catch {
+            r multi
+            r bgrewriteaof
+            r bgrewriteaof
+            r exec
+        } e
+        assert_match {*ERR*already*} $e
+        while {[string match {*aof_rewrite_scheduled:1*} [r info persistence]]} {
+            after 100
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/auth.tcl b/redis-stable/tests/unit/auth.tcl
new file mode 100644
index 00000000..5997707c
--- /dev/null
+++ b/redis-stable/tests/unit/auth.tcl
@@ -0,0 +1,84 @@
+start_server {tags {"auth"}} {
+    test {AUTH fails if there is no password configured server side} {
+        catch {r auth foo} err
+        set _ $err
+    } {ERR*any password*}
+}
+
+start_server {tags {"auth"} overrides {requirepass foobar}} {
+    test {AUTH fails when a wrong password is given} {
+        catch {r auth wrong!} err
+        set _ $err
+    } {WRONGPASS*}
+
+    test {Arbitrary command gives an error when AUTH is required} {
+        catch {r set foo bar} err
+        set _ $err
+    } {NOAUTH*}
+
+    test {AUTH succeeds when the right password is given} {
+        r auth foobar
+    } {OK}
+
+    test {Once AUTH succeeded we can actually send commands to the server} {
+        r set foo 100
+        r incr foo
+    } {101}
+
+    test {For unauthenticated clients multibulk and bulk length are limited} {
+        set rr [redis [srv "host"] [srv "port"] 0 $::tls]
+        $rr write "*100\r\n"
+        $rr flush
+        catch {[$rr read]} e
+        assert_match {*unauthenticated multibulk length*} $e
+        $rr close
+
+        set rr [redis [srv "host"] [srv "port"] 0 $::tls]
+        $rr write "*1\r\n\$100000000\r\n"
+        $rr flush
+        catch {[$rr read]} e
+        assert_match {*unauthenticated bulk length*} $e
+        $rr close
+    }
+}
+
+start_server {tags {"auth_binary_password"}} {
+    test {AUTH fails when binary password is wrong} {
+        r config set requirepass "abc\x00def"
+        catch {r auth abc} err
+        set _ $err
+    } {WRONGPASS*}
+
+    test {AUTH succeeds when binary password is correct} {
+        r config set requirepass "abc\x00def"
+        r auth "abc\x00def"
+    } {OK}
+
+    start_server {tags {"masterauth"}} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        test {MASTERAUTH test with binary password} {
+            $master config set requirepass "abc\x00def"
+
+            # Configure the replica with masterauth
+            set loglines [count_log_lines 0]
+            $slave slaveof $master_host $master_port
+            $slave config set masterauth "abc"
+
+            # Verify replica is not able to sync with master
+            wait_for_log_messages 0 {"*Unable to AUTH to MASTER*"} $loglines 1000 10
+            assert_equal {down} [s 0 master_link_status]
+            
+            # Test replica with the correct masterauth
+            $slave config set masterauth "abc\x00def"
+            wait_for_condition 50 100 {
+                [s 0 master_link_status] eq {up}
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/bitfield.tcl b/redis-stable/tests/unit/bitfield.tcl
new file mode 100644
index 00000000..1f2f6395
--- /dev/null
+++ b/redis-stable/tests/unit/bitfield.tcl
@@ -0,0 +1,232 @@
+start_server {tags {"bitops"}} {
+    test {BITFIELD signed SET and GET basics} {
+        r del bits
+        set results {}
+        lappend results [r bitfield bits set i8 0 -100]
+        lappend results [r bitfield bits set i8 0 101]
+        lappend results [r bitfield bits get i8 0]
+        set results
+    } {0 -100 101}
+
+    test {BITFIELD unsigned SET and GET basics} {
+        r del bits
+        set results {}
+        lappend results [r bitfield bits set u8 0 255]
+        lappend results [r bitfield bits set u8 0 100]
+        lappend results [r bitfield bits get u8 0]
+        set results
+    } {0 255 100}
+
+    test {BITFIELD #<idx> form} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 65
+        r bitfield bits set u8 #1 66
+        r bitfield bits set u8 #2 67
+        r get bits
+    } {ABC}
+
+    test {BITFIELD basic INCRBY form} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 10
+        lappend results [r bitfield bits incrby u8 #0 100]
+        lappend results [r bitfield bits incrby u8 #0 100]
+        set results
+    } {110 210}
+
+    test {BITFIELD chaining of multiple commands} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 10
+        lappend results [r bitfield bits incrby u8 #0 100 incrby u8 #0 100]
+        set results
+    } {{110 210}}
+
+    test {BITFIELD unsigned overflow wrap} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 100
+        lappend results [r bitfield bits overflow wrap incrby u8 #0 257]
+        lappend results [r bitfield bits get u8 #0]
+        lappend results [r bitfield bits overflow wrap incrby u8 #0 255]
+        lappend results [r bitfield bits get u8 #0]
+    } {101 101 100 100}
+
+    test {BITFIELD unsigned overflow sat} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 100
+        lappend results [r bitfield bits overflow sat incrby u8 #0 257]
+        lappend results [r bitfield bits get u8 #0]
+        lappend results [r bitfield bits overflow sat incrby u8 #0 -255]
+        lappend results [r bitfield bits get u8 #0]
+    } {255 255 0 0}
+
+    test {BITFIELD signed overflow wrap} {
+        r del bits
+        set results {}
+        r bitfield bits set i8 #0 100
+        lappend results [r bitfield bits overflow wrap incrby i8 #0 257]
+        lappend results [r bitfield bits get i8 #0]
+        lappend results [r bitfield bits overflow wrap incrby i8 #0 255]
+        lappend results [r bitfield bits get i8 #0]
+    } {101 101 100 100}
+
+    test {BITFIELD signed overflow sat} {
+        r del bits
+        set results {}
+        r bitfield bits set u8 #0 100
+        lappend results [r bitfield bits overflow sat incrby i8 #0 257]
+        lappend results [r bitfield bits get i8 #0]
+        lappend results [r bitfield bits overflow sat incrby i8 #0 -255]
+        lappend results [r bitfield bits get i8 #0]
+    } {127 127 -128 -128}
+
+    test {BITFIELD overflow detection fuzzing} {
+        for {set j 0} {$j < 1000} {incr j} {
+            set bits [expr {[randomInt 64]+1}]
+            set sign [randomInt 2]
+            set range [expr {2**$bits}]
+            if {$bits == 64} {set sign 1} ; # u64 is not supported by BITFIELD.
+            if {$sign} {
+                set min [expr {-($range/2)}]
+                set type "i$bits"
+            } else {
+                set min 0
+                set type "u$bits"
+            }
+            set max [expr {$min+$range-1}]
+
+            # Compare Tcl vs Redis
+            set range2 [expr {$range*2}]
+            set value [expr {($min*2)+[randomInt $range2]}]
+            set increment [expr {($min*2)+[randomInt $range2]}]
+            if {$value > 9223372036854775807} {
+                set value 9223372036854775807
+            }
+            if {$value < -9223372036854775808} {
+                set value -9223372036854775808
+            }
+            if {$increment > 9223372036854775807} {
+                set increment 9223372036854775807
+            }
+            if {$increment < -9223372036854775808} {
+                set increment -9223372036854775808
+            }
+
+            set overflow 0
+            if {$value > $max || $value < $min} {set overflow 1}
+            if {($value + $increment) > $max} {set overflow 1}
+            if {($value + $increment) < $min} {set overflow 1}
+
+            r del bits
+            set res1 [r bitfield bits overflow fail set $type 0 $value]
+            set res2 [r bitfield bits overflow fail incrby $type 0 $increment]
+
+            if {$overflow && [lindex $res1 0] ne {} &&
+                             [lindex $res2 0] ne {}} {
+                fail "OW not detected where needed: $type $value+$increment"
+            }
+            if {!$overflow && ([lindex $res1 0] eq {} ||
+                               [lindex $res2 0] eq {})} {
+                fail "OW detected where NOT needed: $type $value+$increment"
+            }
+        }
+    }
+
+    test {BITFIELD overflow wrap fuzzing} {
+        for {set j 0} {$j < 1000} {incr j} {
+            set bits [expr {[randomInt 64]+1}]
+            set sign [randomInt 2]
+            set range [expr {2**$bits}]
+            if {$bits == 64} {set sign 1} ; # u64 is not supported by BITFIELD.
+            if {$sign} {
+                set min [expr {-($range/2)}]
+                set type "i$bits"
+            } else {
+                set min 0
+                set type "u$bits"
+            }
+            set max [expr {$min+$range-1}]
+
+            # Compare Tcl vs Redis
+            set range2 [expr {$range*2}]
+            set value [expr {($min*2)+[randomInt $range2]}]
+            set increment [expr {($min*2)+[randomInt $range2]}]
+            if {$value > 9223372036854775807} {
+                set value 9223372036854775807
+            }
+            if {$value < -9223372036854775808} {
+                set value -9223372036854775808
+            }
+            if {$increment > 9223372036854775807} {
+                set increment 9223372036854775807
+            }
+            if {$increment < -9223372036854775808} {
+                set increment -9223372036854775808
+            }
+
+            r del bits
+            r bitfield bits overflow wrap set $type 0 $value
+            r bitfield bits overflow wrap incrby $type 0 $increment
+            set res [lindex [r bitfield bits get $type 0] 0]
+
+            set expected 0
+            if {$sign} {incr expected [expr {$max+1}]}
+            incr expected $value
+            incr expected $increment
+            set expected [expr {$expected % $range}]
+            if {$sign} {incr expected $min}
+
+            if {$res != $expected} {
+                fail "WRAP error: $type $value+$increment = $res, should be $expected"
+            }
+        }
+    }
+
+    test {BITFIELD regression for #3221} {
+        r set bits 1
+        r bitfield bits get u1 0
+    } {0}
+
+    test {BITFIELD regression for #3564} {
+        for {set j 0} {$j < 10} {incr j} {
+            r del mystring
+            set res [r BITFIELD mystring SET i8 0 10 SET i8 64 10 INCRBY i8 10 99900]
+            assert {$res eq {0 0 60}}
+        }
+        r del mystring
+    }
+}
+
+start_server {tags {"repl"}} {
+    start_server {} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        test {BITFIELD: setup slave} {
+            $slave slaveof $master_host $master_port
+            wait_for_condition 50 100 {
+                [s 0 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+        }
+
+        test {BITFIELD: write on master, read on slave} {
+            $master del bits
+            assert_equal 0 [$master bitfield bits set u8 0 255]
+            assert_equal 255 [$master bitfield bits set u8 0 100]
+            wait_for_ofs_sync $master $slave
+            assert_equal 100 [$slave bitfield_ro bits get u8 0]
+        }
+
+        test {BITFIELD_RO fails when write option is used} {
+            catch {$slave bitfield_ro bits set u8 0 100 get u8 0} err
+            assert_match {*ERR BITFIELD_RO only supports the GET subcommand*} $err
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/bitops.tcl b/redis-stable/tests/unit/bitops.tcl
new file mode 100644
index 00000000..53483297
--- /dev/null
+++ b/redis-stable/tests/unit/bitops.tcl
@@ -0,0 +1,379 @@
+# Compare Redis commands against Tcl implementations of the same commands.
+proc count_bits s {
+    binary scan $s b* bits
+    string length [regsub -all {0} $bits {}]
+}
+
+proc simulate_bit_op {op args} {
+    set maxlen 0
+    set j 0
+    set count [llength $args]
+    foreach a $args {
+        binary scan $a b* bits
+        set b($j) $bits
+        if {[string length $bits] > $maxlen} {
+            set maxlen [string length $bits]
+        }
+        incr j
+    }
+    for {set j 0} {$j < $count} {incr j} {
+        if {[string length $b($j)] < $maxlen} {
+            append b($j) [string repeat 0 [expr $maxlen-[string length $b($j)]]]
+        }
+    }
+    set out {}
+    for {set x 0} {$x < $maxlen} {incr x} {
+        set bit [string range $b(0) $x $x]
+        if {$op eq {not}} {set bit [expr {!$bit}]}
+        for {set j 1} {$j < $count} {incr j} {
+            set bit2 [string range $b($j) $x $x]
+            switch $op {
+                and {set bit [expr {$bit & $bit2}]}
+                or  {set bit [expr {$bit | $bit2}]}
+                xor {set bit [expr {$bit ^ $bit2}]}
+            }
+        }
+        append out $bit
+    }
+    binary format b* $out
+}
+
+start_server {tags {"bitops"}} {
+    test {BITCOUNT returns 0 against non existing key} {
+        r bitcount no-key
+    } 0
+
+    test {BITCOUNT returns 0 with out of range indexes} {
+        r set str "xxxx"
+        r bitcount str 4 10
+    } 0
+
+    test {BITCOUNT returns 0 with negative indexes where start > end} {
+        r set str "xxxx"
+        r bitcount str -6 -7
+    } 0
+
+    catch {unset num}
+    foreach vec [list "" "\xaa" "\x00\x00\xff" "foobar" "123"] {
+        incr num
+        test "BITCOUNT against test vector #$num" {
+            r set str $vec
+            assert {[r bitcount str] == [count_bits $vec]}
+        }
+    }
+
+    test {BITCOUNT fuzzing without start/end} {
+        for {set j 0} {$j < 100} {incr j} {
+            set str [randstring 0 3000]
+            r set str $str
+            assert {[r bitcount str] == [count_bits $str]}
+        }
+    }
+
+    test {BITCOUNT fuzzing with start/end} {
+        for {set j 0} {$j < 100} {incr j} {
+            set str [randstring 0 3000]
+            r set str $str
+            set l [string length $str]
+            set start [randomInt $l]
+            set end [randomInt $l]
+            if {$start > $end} {
+                lassign [list $end $start] start end
+            }
+            assert {[r bitcount str $start $end] == [count_bits [string range $str $start $end]]}
+        }
+    }
+
+    test {BITCOUNT with start, end} {
+        r set s "foobar"
+        assert_equal [r bitcount s 0 -1] [count_bits "foobar"]
+        assert_equal [r bitcount s 1 -2] [count_bits "ooba"]
+        assert_equal [r bitcount s -2 1] [count_bits ""]
+        assert_equal [r bitcount s 0 1000] [count_bits "foobar"]
+    }
+
+    test {BITCOUNT syntax error #1} {
+        catch {r bitcount s 0} e
+        set e
+    } {ERR*syntax*}
+
+    test {BITCOUNT regression test for github issue #582} {
+        r del foo
+        r setbit foo 0 1
+        if {[catch {r bitcount foo 0 4294967296} e]} {
+            assert_match {*ERR*out of range*} $e
+            set _ 1
+        } else {
+            set e
+        }
+    } {1}
+
+    test {BITCOUNT misaligned prefix} {
+        r del str
+        r set str ab
+        r bitcount str 1 -1
+    } {3}
+
+    test {BITCOUNT misaligned prefix + full words + remainder} {
+        r del str
+        r set str __PPxxxxxxxxxxxxxxxxRR__
+        r bitcount str 2 -3
+    } {74}
+
+    test {BITOP NOT (empty string)} {
+        r set s ""
+        r bitop not dest s
+        r get dest
+    } {}
+
+    test {BITOP NOT (known string)} {
+        r set s "\xaa\x00\xff\x55"
+        r bitop not dest s
+        r get dest
+    } "\x55\xff\x00\xaa"
+
+    test {BITOP where dest and target are the same key} {
+        r set s "\xaa\x00\xff\x55"
+        r bitop not s s
+        r get s
+    } "\x55\xff\x00\xaa"
+
+    test {BITOP AND|OR|XOR don't change the string with single input key} {
+        r set a "\x01\x02\xff"
+        r bitop and res1 a
+        r bitop or  res2 a
+        r bitop xor res3 a
+        list [r get res1] [r get res2] [r get res3]
+    } [list "\x01\x02\xff" "\x01\x02\xff" "\x01\x02\xff"]
+
+    test {BITOP missing key is considered a stream of zero} {
+        r set a "\x01\x02\xff"
+        r bitop and res1 no-suck-key a
+        r bitop or  res2 no-suck-key a no-such-key
+        r bitop xor res3 no-such-key a
+        list [r get res1] [r get res2] [r get res3]
+    } [list "\x00\x00\x00" "\x01\x02\xff" "\x01\x02\xff"]
+
+    test {BITOP shorter keys are zero-padded to the key with max length} {
+        r set a "\x01\x02\xff\xff"
+        r set b "\x01\x02\xff"
+        r bitop and res1 a b
+        r bitop or  res2 a b
+        r bitop xor res3 a b
+        list [r get res1] [r get res2] [r get res3]
+    } [list "\x01\x02\xff\x00" "\x01\x02\xff\xff" "\x00\x00\x00\xff"]
+
+    foreach op {and or xor} {
+        test "BITOP $op fuzzing" {
+            for {set i 0} {$i < 10} {incr i} {
+                r flushall
+                set vec {}
+                set veckeys {}
+                set numvec [expr {[randomInt 10]+1}]
+                for {set j 0} {$j < $numvec} {incr j} {
+                    set str [randstring 0 1000]
+                    lappend vec $str
+                    lappend veckeys vector_$j
+                    r set vector_$j $str
+                }
+                r bitop $op target {*}$veckeys
+                assert_equal [r get target] [simulate_bit_op $op {*}$vec]
+            }
+        }
+    }
+
+    test {BITOP NOT fuzzing} {
+        for {set i 0} {$i < 10} {incr i} {
+            r flushall
+            set str [randstring 0 1000]
+            r set str $str
+            r bitop not target str
+            assert_equal [r get target] [simulate_bit_op not $str]
+        }
+    }
+
+    test {BITOP with integer encoded source objects} {
+        r set a 1
+        r set b 2
+        r bitop xor dest a b a
+        r get dest
+    } {2}
+
+    test {BITOP with non string source key} {
+        r del c
+        r set a 1
+        r set b 2
+        r lpush c foo
+        catch {r bitop xor dest a b c d} e
+        set e
+    } {WRONGTYPE*}
+
+    test {BITOP with empty string after non empty string (issue #529)} {
+        r flushdb
+        r set a "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
+        r bitop or x a b
+    } {32}
+
+    test {BITPOS bit=0 with empty key returns 0} {
+        r del str
+        r bitpos str 0
+    } {0}
+
+    test {BITPOS bit=1 with empty key returns -1} {
+        r del str
+        r bitpos str 1
+    } {-1}
+
+    test {BITPOS bit=0 with string less than 1 word works} {
+        r set str "\xff\xf0\x00"
+        r bitpos str 0
+    } {12}
+
+    test {BITPOS bit=1 with string less than 1 word works} {
+        r set str "\x00\x0f\x00"
+        r bitpos str 1
+    } {12}
+
+    test {BITPOS bit=0 starting at unaligned address} {
+        r set str "\xff\xf0\x00"
+        r bitpos str 0 1
+    } {12}
+
+    test {BITPOS bit=1 starting at unaligned address} {
+        r set str "\x00\x0f\xff"
+        r bitpos str 1 1
+    } {12}
+
+    test {BITPOS bit=0 unaligned+full word+reminder} {
+        r del str
+        r set str "\xff\xff\xff" ; # Prefix
+        # Followed by two (or four in 32 bit systems) full words
+        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
+        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
+        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
+        # First zero bit.
+        r append str "\x0f"
+        assert {[r bitpos str 0] == 216}
+        assert {[r bitpos str 0 1] == 216}
+        assert {[r bitpos str 0 2] == 216}
+        assert {[r bitpos str 0 3] == 216}
+        assert {[r bitpos str 0 4] == 216}
+        assert {[r bitpos str 0 5] == 216}
+        assert {[r bitpos str 0 6] == 216}
+        assert {[r bitpos str 0 7] == 216}
+        assert {[r bitpos str 0 8] == 216}
+    }
+
+    test {BITPOS bit=1 unaligned+full word+reminder} {
+        r del str
+        r set str "\x00\x00\x00" ; # Prefix
+        # Followed by two (or four in 32 bit systems) full words
+        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
+        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
+        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
+        # First zero bit.
+        r append str "\xf0"
+        assert {[r bitpos str 1] == 216}
+        assert {[r bitpos str 1 1] == 216}
+        assert {[r bitpos str 1 2] == 216}
+        assert {[r bitpos str 1 3] == 216}
+        assert {[r bitpos str 1 4] == 216}
+        assert {[r bitpos str 1 5] == 216}
+        assert {[r bitpos str 1 6] == 216}
+        assert {[r bitpos str 1 7] == 216}
+        assert {[r bitpos str 1 8] == 216}
+    }
+
+    test {BITPOS bit=1 returns -1 if string is all 0 bits} {
+        r set str ""
+        for {set j 0} {$j < 20} {incr j} {
+            assert {[r bitpos str 1] == -1}
+            r append str "\x00"
+        }
+    }
+
+    test {BITPOS bit=0 works with intervals} {
+        r set str "\x00\xff\x00"
+        assert {[r bitpos str 0 0 -1] == 0}
+        assert {[r bitpos str 0 1 -1] == 16}
+        assert {[r bitpos str 0 2 -1] == 16}
+        assert {[r bitpos str 0 2 200] == 16}
+        assert {[r bitpos str 0 1 1] == -1}
+    }
+
+    test {BITPOS bit=1 works with intervals} {
+        r set str "\x00\xff\x00"
+        assert {[r bitpos str 1 0 -1] == 8}
+        assert {[r bitpos str 1 1 -1] == 8}
+        assert {[r bitpos str 1 2 -1] == -1}
+        assert {[r bitpos str 1 2 200] == -1}
+        assert {[r bitpos str 1 1 1] == 8}
+    }
+
+    test {BITPOS bit=0 changes behavior if end is given} {
+        r set str "\xff\xff\xff"
+        assert {[r bitpos str 0] == 24}
+        assert {[r bitpos str 0 0] == 24}
+        assert {[r bitpos str 0 0 -1] == -1}
+    }
+
+    test {BITPOS bit=1 fuzzy testing using SETBIT} {
+        r del str
+        set max 524288; # 64k
+        set first_one_pos -1
+        for {set j 0} {$j < 1000} {incr j} {
+            assert {[r bitpos str 1] == $first_one_pos}
+            set pos [randomInt $max]
+            r setbit str $pos 1
+            if {$first_one_pos == -1 || $first_one_pos > $pos} {
+                # Update the position of the first 1 bit in the array
+                # if the bit we set is on the left of the previous one.
+                set first_one_pos $pos
+            }
+        }
+    }
+
+    test {BITPOS bit=0 fuzzy testing using SETBIT} {
+        set max 524288; # 64k
+        set first_zero_pos $max
+        r set str [string repeat "\xff" [expr $max/8]]
+        for {set j 0} {$j < 1000} {incr j} {
+            assert {[r bitpos str 0] == $first_zero_pos}
+            set pos [randomInt $max]
+            r setbit str $pos 0
+            if {$first_zero_pos > $pos} {
+                # Update the position of the first 0 bit in the array
+                # if the bit we clear is on the left of the previous one.
+                set first_zero_pos $pos
+            }
+        }
+    }
+}
+
+start_server {tags {"bitops large-memory"}} {
+    test "BIT pos larger than UINT_MAX" {
+        set bytes [expr (1 << 29) + 1]
+        set bitpos [expr (1 << 32)]
+        set oldval [lindex [r config get proto-max-bulk-len] 1]
+        r config set proto-max-bulk-len $bytes
+        r setbit mykey $bitpos 1
+        assert_equal $bytes [r strlen mykey]
+        assert_equal 1 [r getbit mykey $bitpos]
+        assert_equal [list 128 128 -1] [r bitfield mykey get u8 $bitpos set u8 $bitpos 255 get i8 $bitpos]
+        assert_equal $bitpos [r bitpos mykey 1]
+        assert_equal $bitpos [r bitpos mykey 1 [expr $bytes - 1]]
+        if {$::accurate} {
+            # set all bits to 1
+            set mega [expr (1 << 23)]
+            set part [string repeat "\xFF" $mega]
+            for {set i 0} {$i < 64} {incr i} {
+                r setrange mykey [expr $i * $mega] $part
+            }
+            r setrange mykey [expr $bytes - 1] "\xFF"
+            assert_equal [expr $bitpos + 8] [r bitcount mykey]
+            assert_equal -1 [r bitpos mykey 0 0 [expr $bytes - 1]]
+        }
+        r config set proto-max-bulk-len $oldval
+        r del mykey
+    } {1}
+}
diff --git a/redis-stable/tests/unit/dump.tcl b/redis-stable/tests/unit/dump.tcl
new file mode 100644
index 00000000..d43820ae
--- /dev/null
+++ b/redis-stable/tests/unit/dump.tcl
@@ -0,0 +1,379 @@
+start_server {tags {"dump"}} {
+    test {DUMP / RESTORE are able to serialize / unserialize a simple key} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        list [r exists foo] [r restore foo 0 $encoded] [r ttl foo] [r get foo]
+    } {0 OK -1 bar}
+
+    test {RESTORE can set an arbitrary expire to the materialized key} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        r restore foo 5000 $encoded
+        set ttl [r pttl foo]
+        assert_range $ttl 3000 5000
+        r get foo
+    } {bar}
+
+    test {RESTORE can set an expire that overflows a 32 bit integer} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        r restore foo 2569591501 $encoded
+        set ttl [r pttl foo]
+        assert_range $ttl (2569591501-3000) 2569591501
+        r get foo
+    } {bar}
+    
+    test {RESTORE can set an absolute expire} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        set now [clock milliseconds]
+        r restore foo [expr $now+3000] $encoded absttl
+        set ttl [r pttl foo]
+        assert_range $ttl 2000 3100
+        r get foo
+    } {bar}
+
+    test {RESTORE with ABSTTL in the past} {
+        r set foo bar
+        set encoded [r dump foo]
+        set now [clock milliseconds]
+        r debug set-active-expire 0
+        r restore foo [expr $now-3000] $encoded absttl REPLACE
+        catch {r debug object foo} e
+        r debug set-active-expire 1
+        set e
+    } {ERR no such key}
+
+    test {RESTORE can set LRU} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        r config set maxmemory-policy allkeys-lru
+        r restore foo 0 $encoded idletime 1000
+        set idle [r object idletime foo]
+        assert {$idle >= 1000 && $idle <= 1010}
+        r get foo
+    } {bar}
+    
+    test {RESTORE can set LFU} {
+        r set foo bar
+        set encoded [r dump foo]
+        r del foo
+        r config set maxmemory-policy allkeys-lfu
+        r restore foo 0 $encoded freq 100
+        set freq [r object freq foo]
+        assert {$freq == 100}
+        r get foo
+    } {bar}
+
+    test {RESTORE returns an error of the key already exists} {
+        r set foo bar
+        set e {}
+        catch {r restore foo 0 "..."} e
+        set e
+    } {*BUSYKEY*}
+
+    test {RESTORE can overwrite an existing key with REPLACE} {
+        r set foo bar1
+        set encoded1 [r dump foo]
+        r set foo bar2
+        set encoded2 [r dump foo]
+        r del foo
+        r restore foo 0 $encoded1
+        r restore foo 0 $encoded2 replace
+        r get foo
+    } {bar2}
+
+    test {RESTORE can detect a syntax error for unrecongized options} {
+        catch {r restore foo 0 "..." invalid-option} e
+        set e
+    } {*syntax*}
+
+    test {DUMP of non existing key returns nil} {
+        r dump nonexisting_key
+    } {}
+
+    test {MIGRATE is caching connections} {
+        # Note, we run this as first test so that the connection cache
+        # is empty.
+        set first [srv 0 client]
+        r set key "Some Value"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert_match {*migrate_cached_sockets:0*} [r -1 info]
+            r -1 migrate $second_host $second_port key 9 1000
+            assert_match {*migrate_cached_sockets:1*} [r -1 info]
+        }
+    }
+
+    test {MIGRATE cached connections are released after some time} {
+        after 15000
+        assert_match {*migrate_cached_sockets:0*} [r info]
+    }
+
+    test {MIGRATE is able to migrate a key between two instances} {
+        set first [srv 0 client]
+        r set key "Some Value"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key] == 1}
+            assert {[$second exists key] == 0}
+            set ret [r -1 migrate $second_host $second_port key 9 5000]
+            assert {$ret eq {OK}}
+            assert {[$first exists key] == 0}
+            assert {[$second exists key] == 1}
+            assert {[$second get key] eq {Some Value}}
+            assert {[$second ttl key] == -1}
+        }
+    }
+
+    test {MIGRATE is able to copy a key between two instances} {
+        set first [srv 0 client]
+        r del list
+        r lpush list a b c d
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists list] == 1}
+            assert {[$second exists list] == 0}
+            set ret [r -1 migrate $second_host $second_port list 9 5000 copy]
+            assert {$ret eq {OK}}
+            assert {[$first exists list] == 1}
+            assert {[$second exists list] == 1}
+            assert {[$first lrange list 0 -1] eq [$second lrange list 0 -1]}
+        }
+    }
+
+    test {MIGRATE will not overwrite existing keys, unless REPLACE is used} {
+        set first [srv 0 client]
+        r del list
+        r lpush list a b c d
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists list] == 1}
+            assert {[$second exists list] == 0}
+            $second set list somevalue
+            catch {r -1 migrate $second_host $second_port list 9 5000 copy} e
+            assert_match {ERR*} $e
+            set ret [r -1 migrate $second_host $second_port list 9 5000 copy replace]
+            assert {$ret eq {OK}}
+            assert {[$first exists list] == 1}
+            assert {[$second exists list] == 1}
+            assert {[$first lrange list 0 -1] eq [$second lrange list 0 -1]}
+        }
+    }
+
+    test {MIGRATE propagates TTL correctly} {
+        set first [srv 0 client]
+        r set key "Some Value"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key] == 1}
+            assert {[$second exists key] == 0}
+            $first expire key 10
+            set ret [r -1 migrate $second_host $second_port key 9 5000]
+            assert {$ret eq {OK}}
+            assert {[$first exists key] == 0}
+            assert {[$second exists key] == 1}
+            assert {[$second get key] eq {Some Value}}
+            assert {[$second ttl key] >= 7 && [$second ttl key] <= 10}
+        }
+    }
+
+    test {MIGRATE can correctly transfer large values} {
+        set first [srv 0 client]
+        r del key
+        for {set j 0} {$j < 40000} {incr j} {
+            r rpush key 1 2 3 4 5 6 7 8 9 10
+            r rpush key "item 1" "item 2" "item 3" "item 4" "item 5" \
+                        "item 6" "item 7" "item 8" "item 9" "item 10"
+        }
+        assert {[string length [r dump key]] > (1024*64)}
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key] == 1}
+            assert {[$second exists key] == 0}
+            set ret [r -1 migrate $second_host $second_port key 9 10000]
+            assert {$ret eq {OK}}
+            assert {[$first exists key] == 0}
+            assert {[$second exists key] == 1}
+            assert {[$second ttl key] == -1}
+            assert {[$second llen key] == 40000*20}
+        }
+    }
+
+    test {MIGRATE can correctly transfer hashes} {
+        set first [srv 0 client]
+        r del key
+        r hmset key field1 "item 1" field2 "item 2" field3 "item 3" \
+                    field4 "item 4" field5 "item 5" field6 "item 6"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key] == 1}
+            assert {[$second exists key] == 0}
+            set ret [r -1 migrate $second_host $second_port key 9 10000]
+            assert {$ret eq {OK}}
+            assert {[$first exists key] == 0}
+            assert {[$second exists key] == 1}
+            assert {[$second ttl key] == -1}
+        }
+    }
+
+    test {MIGRATE timeout actually works} {
+        set first [srv 0 client]
+        r set key "Some Value"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key] == 1}
+            assert {[$second exists key] == 0}
+
+            set rd [redis_deferring_client]
+            $rd debug sleep 1.0 ; # Make second server unable to reply.
+            set e {}
+            catch {r -1 migrate $second_host $second_port key 9 500} e
+            assert_match {IOERR*} $e
+        }
+    }
+
+    test {MIGRATE can migrate multiple keys at once} {
+        set first [srv 0 client]
+        r set key1 "v1"
+        r set key2 "v2"
+        r set key3 "v3"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            assert {[$first exists key1] == 1}
+            assert {[$second exists key1] == 0}
+            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys key1 key2 key3]
+            assert {$ret eq {OK}}
+            assert {[$first exists key1] == 0}
+            assert {[$first exists key2] == 0}
+            assert {[$first exists key3] == 0}
+            assert {[$second get key1] eq {v1}}
+            assert {[$second get key2] eq {v2}}
+            assert {[$second get key3] eq {v3}}
+        }
+    }
+
+    test {MIGRATE with multiple keys must have empty key arg} {
+        catch {r MIGRATE 127.0.0.1 6379 NotEmpty 9 5000 keys a b c} e
+        set e
+    } {*empty string*}
+
+    test {MIGRATE with multiple keys migrate just existing ones} {
+        set first [srv 0 client]
+        r set key1 "v1"
+        r set key2 "v2"
+        r set key3 "v3"
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 nokey-2 nokey-2]
+            assert {$ret eq {NOKEY}}
+
+            assert {[$first exists key1] == 1}
+            assert {[$second exists key1] == 0}
+            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 key1 nokey-2 key2 nokey-3 key3]
+            assert {$ret eq {OK}}
+            assert {[$first exists key1] == 0}
+            assert {[$first exists key2] == 0}
+            assert {[$first exists key3] == 0}
+            assert {[$second get key1] eq {v1}}
+            assert {[$second get key2] eq {v2}}
+            assert {[$second get key3] eq {v3}}
+        }
+    }
+
+    test {MIGRATE with multiple keys: stress command rewriting} {
+        set first [srv 0 client]
+        r flushdb
+        r mset a 1 b 2 c 3 d 4 c 5 e 6 f 7 g 8 h 9 i 10 l 11 m 12 n 13 o 14 p 15 q 16
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q]
+
+            assert {[$first dbsize] == 0}
+            assert {[$second dbsize] == 15}
+        }
+    }
+
+    test {MIGRATE with multiple keys: delete just ack keys} {
+        set first [srv 0 client]
+        r flushdb
+        r mset a 1 b 2 c 3 d 4 c 5 e 6 f 7 g 8 h 9 i 10 l 11 m 12 n 13 o 14 p 15 q 16
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+
+            $second mset c _ d _; # Two busy keys and no REPLACE used
+
+            catch {r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q} e
+
+            assert {[$first dbsize] == 2}
+            assert {[$second dbsize] == 15}
+            assert {[$first exists c] == 1}
+            assert {[$first exists d] == 1}
+        }
+    }
+
+    test {MIGRATE AUTH: correct and wrong password cases} {
+        set first [srv 0 client]
+        r del list
+        r lpush list a b c d
+        start_server {tags {"repl"}} {
+            set second [srv 0 client]
+            set second_host [srv 0 host]
+            set second_port [srv 0 port]
+            $second config set requirepass foobar
+            $second auth foobar
+
+            assert {[$first exists list] == 1}
+            assert {[$second exists list] == 0}
+            set ret [r -1 migrate $second_host $second_port list 9 5000 AUTH foobar]
+            assert {$ret eq {OK}}
+            assert {[$second exists list] == 1}
+            assert {[$second lrange list 0 -1] eq {d c b a}}
+
+            r -1 lpush list a b c d
+            $second config set requirepass foobar2
+            catch {r -1 migrate $second_host $second_port list 9 5000 AUTH foobar} err
+            assert_match {*WRONGPASS*} $err
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/expire.tcl b/redis-stable/tests/unit/expire.tcl
new file mode 100644
index 00000000..459503ad
--- /dev/null
+++ b/redis-stable/tests/unit/expire.tcl
@@ -0,0 +1,414 @@
+start_server {tags {"expire"}} {
+    test {EXPIRE - set timeouts multiple times} {
+        r set x foobar
+        set v1 [r expire x 5]
+        set v2 [r ttl x]
+        set v3 [r expire x 10]
+        set v4 [r ttl x]
+        r expire x 2
+        list $v1 $v2 $v3 $v4
+    } {1 [45] 1 10}
+
+    test {EXPIRE - It should be still possible to read 'x'} {
+        r get x
+    } {foobar}
+
+    tags {"slow"} {
+        test {EXPIRE - After 2.1 seconds the key should no longer be here} {
+            after 2100
+            list [r get x] [r exists x]
+        } {{} 0}
+    }
+
+    test {EXPIRE - write on expire should work} {
+        r del x
+        r lpush x foo
+        r expire x 1000
+        r lpush x bar
+        r lrange x 0 -1
+    } {bar foo}
+
+    test {EXPIREAT - Check for EXPIRE alike behavior} {
+        r del x
+        r set x foo
+        r expireat x [expr [clock seconds]+15]
+        r ttl x
+    } {1[345]}
+
+    test {SETEX - Set + Expire combo operation. Check for TTL} {
+        r setex x 12 test
+        r ttl x
+    } {1[012]}
+
+    test {SETEX - Check value} {
+        r get x
+    } {test}
+
+    test {SETEX - Overwrite old key} {
+        r setex y 1 foo
+        r get y
+    } {foo}
+
+    tags {"slow"} {
+        test {SETEX - Wait for the key to expire} {
+            after 1100
+            r get y
+        } {}
+    }
+
+    test {SETEX - Wrong time parameter} {
+        catch {r setex z -10 foo} e
+        set _ $e
+    } {*invalid expire*}
+
+    test {PERSIST can undo an EXPIRE} {
+        r set x foo
+        r expire x 50
+        list [r ttl x] [r persist x] [r ttl x] [r get x]
+    } {50 1 -1 foo}
+
+    test {PERSIST returns 0 against non existing or non volatile keys} {
+        r set x foo
+        list [r persist foo] [r persist nokeyatall]
+    } {0 0}
+
+    test {EXPIRE precision is now the millisecond} {
+        # This test is very likely to do a false positive if the
+        # server is under pressure, so if it does not work give it a few more
+        # chances.
+        for {set j 0} {$j < 10} {incr j} {
+            r del x
+            r setex x 1 somevalue
+            after 900
+            set a [r get x]
+            after 1100
+            set b [r get x]
+            if {$a eq {somevalue} && $b eq {}} break
+        }
+        if {$::verbose} {
+            puts "millisecond expire test attempts: $j"
+        }
+        list $a $b
+    } {somevalue {}}
+
+    test {PEXPIRE/PSETEX/PEXPIREAT can set sub-second expires} {
+        # This test is very likely to do a false positive if the
+        # server is under pressure, so if it does not work give it a few more
+        # chances.
+        for {set j 0} {$j < 30} {incr j} {
+            r del x y z
+            r psetex x 100 somevalue
+            after 80
+            set a [r get x]
+            after 120
+            set b [r get x]
+
+            r set x somevalue
+            r pexpire x 100
+            after 80
+            set c [r get x]
+            after 120
+            set d [r get x]
+
+            r set x somevalue
+            set now [r time]
+            r pexpireat x [expr ([lindex $now 0]*1000)+([lindex $now 1]/1000)+200]
+            after 20
+            set e [r get x]
+            after 220
+            set f [r get x]
+
+            if {$a eq {somevalue} && $b eq {} &&
+                $c eq {somevalue} && $d eq {} &&
+                $e eq {somevalue} && $f eq {}} break
+        }
+        if {$::verbose} {
+            puts "sub-second expire test attempts: $j"
+        }
+        list $a $b $c $d $e $f
+    } {somevalue {} somevalue {} somevalue {}}
+
+    test {TTL returns time to live in seconds} {
+        r del x
+        r setex x 10 somevalue
+        set ttl [r ttl x]
+        assert {$ttl > 8 && $ttl <= 10}
+    }
+
+    test {PTTL returns time to live in milliseconds} {
+        r del x
+        r setex x 1 somevalue
+        set ttl [r pttl x]
+        assert {$ttl > 900 && $ttl <= 1000}
+    }
+
+    test {TTL / PTTL return -1 if key has no expire} {
+        r del x
+        r set x hello
+        list [r ttl x] [r pttl x]
+    } {-1 -1}
+
+    test {TTL / PTTL return -2 if key does not exit} {
+        r del x
+        list [r ttl x] [r pttl x]
+    } {-2 -2}
+
+    test {Redis should actively expire keys incrementally} {
+        r flushdb
+        r psetex key1 500 a
+        r psetex key2 500 a
+        r psetex key3 500 a
+        set size1 [r dbsize]
+        # Redis expires random keys ten times every second so we are
+        # fairly sure that all the three keys should be evicted after
+        # one second.
+        after 1000
+        set size2 [r dbsize]
+        list $size1 $size2
+    } {3 0}
+
+    test {Redis should lazy expire keys} {
+        r flushdb
+        r debug set-active-expire 0
+        r psetex key1 500 a
+        r psetex key2 500 a
+        r psetex key3 500 a
+        set size1 [r dbsize]
+        # Redis expires random keys ten times every second so we are
+        # fairly sure that all the three keys should be evicted after
+        # one second.
+        after 1000
+        set size2 [r dbsize]
+        r mget key1 key2 key3
+        set size3 [r dbsize]
+        r debug set-active-expire 1
+        list $size1 $size2 $size3
+    } {3 3 0}
+
+    test {EXPIRE should not resurrect keys (issue #1026)} {
+        r debug set-active-expire 0
+        r set foo bar
+        r pexpire foo 500
+        after 1000
+        r expire foo 10
+        r debug set-active-expire 1
+        r exists foo
+    } {0}
+
+    test {5 keys in, 5 keys out} {
+        r flushdb
+        r set a c
+        r expire a 5
+        r set t c
+        r set e c
+        r set s c
+        r set foo b
+        lsort [r keys *]
+    } {a e foo s t}
+
+    test {EXPIRE with empty string as TTL should report an error} {
+        r set foo bar
+        catch {r expire foo ""} e
+        set e
+    } {*not an integer*}
+
+    test {SET with EX with big integer should report an error} {
+        catch {r set foo bar EX 10000000000000000} e
+        set e
+    } {ERR invalid expire time in set}
+
+    test {SET with EX with smallest integer should report an error} {
+        catch {r SET foo bar EX -9999999999999999} e
+        set e
+    } {ERR invalid expire time in set}
+
+    test {GETEX with big integer should report an error} {
+        r set foo bar
+        catch {r GETEX foo EX 10000000000000000} e
+        set e
+    } {ERR invalid expire time in getex}
+
+    test {GETEX with smallest integer should report an error} {
+        r set foo bar
+        catch {r GETEX foo EX -9999999999999999} e
+        set e
+    } {ERR invalid expire time in getex}
+
+    test {EXPIRE with big integer overflows when converted to milliseconds} {
+        r set foo bar
+        catch {r EXPIRE foo 10000000000000000} e
+        set e
+    } {ERR invalid expire time in expire}
+
+    test {PEXPIRE with big integer overflow when basetime is added} {
+        r set foo bar
+        catch {r PEXPIRE foo 9223372036854770000} e
+        set e
+    } {ERR invalid expire time in pexpire}
+
+    test {EXPIRE with big negative integer} {
+        r set foo bar
+        catch {r EXPIRE foo -9999999999999999} e
+        assert_match {ERR invalid expire time in expire} $e
+        r ttl foo
+    } {-1}
+
+    test {PEXPIREAT with big integer works} {
+        r set foo bar
+        r PEXPIREAT foo 9223372036854770000
+    } {1}
+
+    test {PEXPIREAT with big negative integer works} {
+        r set foo bar
+        r PEXPIREAT foo -9223372036854770000
+        r ttl foo
+    } {-2}
+
+    test {EXPIRE and SET/GETEX EX/PX/EXAT/PXAT option, TTL should not be reset after loadaof} {
+        # This test makes sure that expire times are propagated as absolute
+        # times to the AOF file and not as relative time, so that when the AOF
+        # is reloaded the TTLs are not being shifted forward to the future.
+        # We want the time to logically pass when the server is restarted!
+
+        r config set appendonly yes
+        r set foo1 bar EX 100
+        r set foo2 bar PX 100000
+        r set foo3 bar
+        r set foo4 bar
+        r expire foo3 100
+        r pexpire foo4 100000
+        r setex foo5 100 bar
+        r psetex foo6 100000 bar
+        r set foo7 bar EXAT [expr [clock seconds] + 100]
+        r set foo8 bar PXAT [expr [clock milliseconds] + 100000]
+        r set foo9 bar
+        r getex foo9 EX 100
+        r set foo10 bar
+        r getex foo10 PX 100000
+        r set foo11 bar
+        r getex foo11 EXAT [expr [clock seconds] + 100]
+        r set foo12 bar
+        r getex foo12 PXAT [expr [clock milliseconds] + 100000]
+
+        after 2000
+        r debug loadaof
+        assert_range [r ttl foo1] 90 98
+        assert_range [r ttl foo2] 90 98
+        assert_range [r ttl foo3] 90 98
+        assert_range [r ttl foo4] 90 98
+        assert_range [r ttl foo5] 90 98
+        assert_range [r ttl foo6] 90 98
+        assert_range [r ttl foo7] 90 98
+        assert_range [r ttl foo8] 90 98
+        assert_range [r ttl foo9] 90 98
+        assert_range [r ttl foo10] 90 98
+        assert_range [r ttl foo11] 90 98
+        assert_range [r ttl foo12] 90 98
+    }
+
+    test {EXPIRE relative and absolute propagation to replicas} {
+        # Make sure that relative and absolute expire commands are propagated
+        # "as is" to replicas.
+        # We want replicas to honor the same high level contract of expires that
+        # the master has, that is, we want the time to be counted logically
+        # starting from the moment the write was received. This usually provides
+        # the most coherent behavior from the point of view of the external
+        # users, with TTLs that are similar from the POV of the external observer.
+        #
+        # This test is here to stop some innocent / eager optimization or cleanup
+        # from doing the wrong thing without proper discussion, see:
+        # https://github.com/redis/redis/pull/5171#issuecomment-409553266
+
+        set repl [attach_to_replication_stream]
+        r set foo1 bar ex 200
+        r set foo1 bar px 100000
+        r set foo1 bar exat [expr [clock seconds]+100]
+        r set foo1 bar pxat [expr [clock milliseconds]+10000]
+        r setex foo1 100 bar
+        r psetex foo1 100000 bar
+        r set foo2 bar
+        r expire foo2 100
+        r pexpire foo2 100000
+        r set foo3 bar
+        r expireat foo3 [expr [clock seconds]+100]
+        r pexpireat foo3 [expr [clock seconds]*1000+100000]
+        r expireat foo3 [expr [clock seconds]-100]
+        r set foo4 bar
+        r getex foo4 ex 200
+        r getex foo4 px 200000
+        r getex foo4 exat [expr [clock seconds]+100]
+        r getex foo4 pxat [expr [clock milliseconds]+10000]
+        assert_replication_stream $repl {
+            {select *}
+            {set foo1 bar PX 200000}
+            {set foo1 bar PX 100000}
+            {set foo1 bar PXAT *}
+            {set foo1 bar PXAT *}
+            {set foo1 bar PX 100000}
+            {set foo1 bar PX 100000}
+            {set foo2 bar}
+            {expire foo2 100}
+            {pexpire foo2 100000}
+            {set foo3 bar}
+            {expireat foo3 *}
+            {pexpireat foo3 *}
+            {del foo3}
+            {set foo4 bar}
+            {pexpire foo4 200000}
+            {pexpire foo4 200000}
+            {pexpireat foo4 *}
+            {pexpireat foo4 *}
+        }
+    }
+
+    test {SET command will remove expire} {
+        r set foo bar EX 100
+        r set foo bar
+        r ttl foo
+    } {-1}
+
+    test {SET - use KEEPTTL option, TTL should not be removed} {
+        r set foo bar EX 100
+        r set foo bar KEEPTTL
+        set ttl [r ttl foo]
+        assert {$ttl <= 100 && $ttl > 90}
+    }
+
+    test {SET - use KEEPTTL option, TTL should not be removed after loadaof} {
+        r config set appendonly yes
+        r set foo bar EX 100
+        r set foo bar2 KEEPTTL
+        after 2000
+        r debug loadaof
+        set ttl [r ttl foo]
+        assert {$ttl <= 98 && $ttl > 90}
+    }
+
+    test {GETEX use of PERSIST option should remove TTL} {
+       r set foo bar EX 100
+       r getex foo PERSIST
+       r ttl foo
+    } {-1}
+
+    test {GETEX use of PERSIST option should remove TTL after loadaof} {
+       r set foo bar EX 100
+       r getex foo PERSIST
+       after 2000
+       r debug loadaof
+       r ttl foo
+    } {-1}
+
+    test {GETEX propagate as to replica as PERSIST, DEL, or nothing} {
+       set repl [attach_to_replication_stream]
+       r set foo bar EX 100
+       r getex foo PERSIST
+       r getex foo
+       r getex foo exat [expr [clock seconds]-100]
+       assert_replication_stream $repl {
+           {select *}
+           {set foo bar PX 100000}
+           {persist foo}
+           {del foo}
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/geo.tcl b/redis-stable/tests/unit/geo.tcl
new file mode 100644
index 00000000..3aa8f4d5
--- /dev/null
+++ b/redis-stable/tests/unit/geo.tcl
@@ -0,0 +1,693 @@
+# Helper functions to simulate search-in-radius in the Tcl side in order to
+# verify the Redis implementation with a fuzzy test.
+proc geo_degrad deg {expr {$deg*(atan(1)*8/360)}}
+proc geo_raddeg rad {expr {$rad/(atan(1)*8/360)}}
+
+proc geo_distance {lon1d lat1d lon2d lat2d} {
+    set lon1r [geo_degrad $lon1d]
+    set lat1r [geo_degrad $lat1d]
+    set lon2r [geo_degrad $lon2d]
+    set lat2r [geo_degrad $lat2d]
+    set v [expr {sin(($lon2r - $lon1r) / 2)}]
+    set u [expr {sin(($lat2r - $lat1r) / 2)}]
+    expr {2.0 * 6372797.560856 * \
+            asin(sqrt($u * $u + cos($lat1r) * cos($lat2r) * $v * $v))}
+}
+
+proc geo_random_point {lonvar latvar} {
+    upvar 1 $lonvar lon
+    upvar 1 $latvar lat
+    # Note that the actual latitude limit should be -85 to +85, we restrict
+    # the test to -70 to +70 since in this range the algorithm is more precise
+    # while outside this range occasionally some element may be missing.
+    set lon [expr {-180 + rand()*360}]
+    set lat [expr {-70 + rand()*140}]
+}
+
+# Return elements non common to both the lists.
+# This code is from http://wiki.tcl.tk/15489
+proc compare_lists {List1 List2} {
+   set DiffList {}
+   foreach Item $List1 {
+      if {[lsearch -exact $List2 $Item] == -1} {
+         lappend DiffList $Item
+      }
+   }
+   foreach Item $List2 {
+      if {[lsearch -exact $List1 $Item] == -1} {
+         if {[lsearch -exact $DiffList $Item] == -1} {
+            lappend DiffList $Item
+         }
+      }
+   }
+   return $DiffList
+}
+
+# return true If a point in circle.
+# search_lon and search_lat define the center of the circle,
+# and lon, lat define the point being searched.
+proc pointInCircle {radius_km lon lat search_lon search_lat} {
+    set radius_m [expr {$radius_km*1000}]
+    set distance [geo_distance $lon $lat $search_lon $search_lat]
+    if {$distance < $radius_m} {
+        return true
+    }
+    return false
+}
+
+# return true If a point in rectangle.
+# search_lon and search_lat define the center of the rectangle,
+# and lon, lat define the point being searched.
+# error: can adjust the width and height of the rectangle according to the error
+proc pointInRectangle {width_km height_km lon lat search_lon search_lat error} {
+    set width_m [expr {$width_km*1000*$error/2}]
+    set height_m [expr {$height_km*1000*$error/2}]
+    set lon_distance [geo_distance $lon $lat $search_lon $lat]
+    set lat_distance [geo_distance $lon $lat $lon $search_lat]
+
+    if {$lon_distance > $width_m || $lat_distance > $height_m} {
+        return false
+    }
+    return true
+}
+
+proc verify_geo_edge_response_bylonlat {expected_response expected_store_response} {
+    catch {r georadius src{t} 1 1 1 km} response
+    assert_match $expected_response $response
+
+    catch {r georadius src{t} 1 1 1 km store dest{t}} response
+    assert_match $expected_store_response $response
+
+    catch {r geosearch src{t} fromlonlat 0 0 byradius 1 km} response
+    assert_match $expected_response $response
+
+    catch {r geosearchstore dest{t} src{t} fromlonlat 0 0 byradius 1 km} response
+    assert_match $expected_store_response $response
+}
+
+proc verify_geo_edge_response_bymember {expected_response expected_store_response} {
+    catch {r georadiusbymember src{t} member 1 km} response
+    assert_match $expected_response $response
+
+    catch {r georadiusbymember src{t} member 1 km store dest{t}} response
+    assert_match $expected_store_response $response
+
+    catch {r geosearch src{t} frommember member bybox 1 1 km} response
+    assert_match $expected_response $response
+
+    catch {r geosearchstore dest{t} src{t} frommember member bybox 1 1 m} response
+    assert_match $expected_store_response $response
+}
+
+# The following list represents sets of random seed, search position
+# and radius that caused bugs in the past. It is used by the randomized
+# test later as a starting point. When the regression vectors are scanned
+# the code reverts to using random data.
+#
+# The format is: seed km lon lat
+set regression_vectors {
+    {1482225976969 7083 81.634948934258375 30.561509253718668}
+    {1482340074151 5416 -70.863281847379767 -46.347003465679947}
+    {1499014685896 6064 -89.818768962202014 -40.463868561416803}
+    {1412 156 149.29737817929004 15.95807862745508}
+    {441574 143 59.235461856813856 66.269555127373678}
+    {160645 187 -101.88575239939883 49.061997951502917}
+    {750269 154 -90.187939661642517 66.615930412251487}
+    {342880 145 163.03472387745728 64.012747720821181}
+    {729955 143 137.86663517256579 63.986745399416776}
+    {939895 151 59.149620271823181 65.204186651485145}
+    {1412 156 149.29737817929004 15.95807862745508}
+    {564862 149 84.062063109158544 -65.685403922426232}
+    {1546032440391 16751 -1.8175081637769495 20.665668878082954}
+}
+set rv_idx 0
+
+start_server {tags {"geo"}} {
+    test {GEO with wrong type src key} {
+        r set src{t} wrong_type
+
+        verify_geo_edge_response_bylonlat "WRONGTYPE*" "WRONGTYPE*"
+        verify_geo_edge_response_bymember "WRONGTYPE*" "WRONGTYPE*"
+    }
+
+    test {GEO with non existing src key} {
+        r del src{t}
+
+        verify_geo_edge_response_bylonlat {} 0
+        verify_geo_edge_response_bymember {} 0
+    }
+
+    test {GEO BYLONLAT with empty search} {
+        r del src{t}
+        r geoadd src{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
+
+        verify_geo_edge_response_bylonlat {} 0
+    }
+
+    test {GEO BYMEMBER with non existing member} {
+        r del src{t}
+        r geoadd src{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
+
+        verify_geo_edge_response_bymember "ERR*" "ERR*"
+    }
+
+    test {GEOADD create} {
+        r geoadd nyc -73.9454966 40.747533 "lic market"
+    } {1}
+
+    test {GEOADD update} {
+        r geoadd nyc -73.9454966 40.747533 "lic market"
+    } {0}
+
+    test {GEOADD update with CH option} {
+        assert_equal 1 [r geoadd nyc CH 40.747533 -73.9454966 "lic market"]
+        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
+        assert {abs($x1) - 40.747 < 0.001}
+        assert {abs($y1) - 73.945 < 0.001}
+    } {}
+
+    test {GEOADD update with NX option} {
+        assert_equal 0 [r geoadd nyc NX -73.9454966 40.747533 "lic market"]
+        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
+        assert {abs($x1) - 40.747 < 0.001}
+        assert {abs($y1) - 73.945 < 0.001}
+    } {}
+
+    test {GEOADD update with XX option} {
+        assert_equal 0 [r geoadd nyc XX -83.9454966 40.747533 "lic market"]
+        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
+        assert {abs($x1) - 83.945 < 0.001}
+        assert {abs($y1) - 40.747 < 0.001}
+    } {}
+
+    test {GEOADD update with CH NX option} {
+        r geoadd nyc CH NX -73.9454966 40.747533 "lic market"
+    } {0}
+
+    test {GEOADD update with CH XX option} {
+        r geoadd nyc CH XX -73.9454966 40.747533 "lic market"
+    } {1}
+
+    test {GEOADD update with XX NX option will return syntax error} {
+        catch {
+            r geoadd nyc xx nx -73.9454966 40.747533 "lic market"
+        } err
+        set err
+    } {ERR*syntax*}
+
+    test {GEOADD update with invalid option} {
+        catch {
+            r geoadd nyc ch xx foo -73.9454966 40.747533 "lic market"
+        } err
+        set err
+    } {ERR*syntax*}
+
+    test {GEOADD invalid coordinates} {
+        catch {
+            r geoadd nyc -73.9454966 40.747533 "lic market" \
+                foo bar "luck market"
+        } err
+        set err
+    } {*valid*}
+
+    test {GEOADD multi add} {
+        r geoadd nyc -73.9733487 40.7648057 "central park n/q/r" -73.9903085 40.7362513 "union square" -74.0131604 40.7126674 "wtc one" -73.7858139 40.6428986 "jfk" -73.9375699 40.7498929 "q4" -73.9564142 40.7480973 4545
+    } {6}
+
+    test {Check geoset values} {
+        r zrange nyc 0 -1 withscores
+    } {{wtc one} 1791873972053020 {union square} 1791875485187452 {central park n/q/r} 1791875761332224 4545 1791875796750882 {lic market} 1791875804419201 q4 1791875830079666 jfk 1791895905559723}
+
+    test {GEORADIUS simple (sorted)} {
+        r georadius nyc -73.9798091 40.7598464 3 km asc
+    } {{central park n/q/r} 4545 {union square}}
+
+    test {GEOSEARCH simple (sorted)} {
+        r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km asc
+    } {{central park n/q/r} 4545 {union square} {lic market}}
+
+    test {GEOSEARCH FROMLONLAT and FROMMEMBER cannot exist at the same time} {
+        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 frommember xxx bybox 6 6 km asc} e
+        set e
+    } {ERR*syntax*}
+
+    test {GEOSEARCH FROMLONLAT and FROMMEMBER one must exist} {
+        catch {r geosearch nyc bybox 3 3 km asc desc withhash withdist withcoord} e
+        set e
+    } {ERR*exactly one of FROMMEMBER or FROMLONLAT*}
+
+    test {GEOSEARCH BYRADIUS and BYBOX cannot exist at the same time} {
+        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 byradius 3 km bybox 3 3 km asc} e
+        set e
+    } {ERR*syntax*}
+
+    test {GEOSEARCH BYRADIUS and BYBOX one must exist} {
+        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 asc desc withhash withdist withcoord} e
+        set e
+    } {ERR*exactly one of BYRADIUS and BYBOX*}
+
+    test {GEOSEARCH with STOREDIST option} {
+        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km asc storedist} e
+        set e
+    } {ERR*syntax*}
+
+    test {GEORADIUS withdist (sorted)} {
+        r georadius nyc -73.9798091 40.7598464 3 km withdist asc
+    } {{{central park n/q/r} 0.7750} {4545 2.3651} {{union square} 2.7697}}
+
+    test {GEOSEARCH withdist (sorted)} {
+        r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km withdist asc
+    } {{{central park n/q/r} 0.7750} {4545 2.3651} {{union square} 2.7697} {{lic market} 3.1991}}
+
+    test {GEORADIUS with COUNT} {
+        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3
+    } {{central park n/q/r} 4545 {union square}}
+
+    test {GEORADIUS with ANY not sorted by default} {
+        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3 ANY
+    } {{wtc one} {union square} {central park n/q/r}}
+
+    test {GEORADIUS with ANY sorted by ASC} {
+        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3 ANY ASC
+    } {{central park n/q/r} {union square} {wtc one}}
+
+    test {GEORADIUS with ANY but no COUNT} {
+        catch {r georadius nyc -73.9798091 40.7598464 10 km ANY ASC} e
+        set e
+    } {ERR*ANY*requires*COUNT*}
+
+    test {GEORADIUS with COUNT but missing integer argument} {
+        catch {r georadius nyc -73.9798091 40.7598464 10 km COUNT} e
+        set e
+    } {ERR*syntax*}
+
+    test {GEORADIUS with COUNT DESC} {
+        r georadius nyc -73.9798091 40.7598464 10 km COUNT 2 DESC
+    } {{wtc one} q4}
+
+    test {GEORADIUS HUGE, issue #2767} {
+        r geoadd users -47.271613776683807 -54.534504198047678 user_000000
+        llength [r GEORADIUS users 0 0 50000 km WITHCOORD]
+    } {1}
+
+    test {GEORADIUSBYMEMBER simple (sorted)} {
+        r georadiusbymember nyc "wtc one" 7 km
+    } {{wtc one} {union square} {central park n/q/r} 4545 {lic market}}
+
+    test {GEOSEARCH FROMMEMBER simple (sorted)} {
+        r geosearch nyc frommember "wtc one" bybox 14 14 km
+    } {{wtc one} {union square} {central park n/q/r} 4545 {lic market} q4}
+
+    test {GEOSEARCH vs GEORADIUS} {
+        r del Sicily
+        r geoadd Sicily 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
+        r geoadd Sicily 12.758489 38.788135 "edge1"   17.241510 38.788135 "eage2"
+        set ret1 [r georadius Sicily 15 37 200 km asc]
+        assert_equal $ret1 {Catania Palermo}
+        set ret2 [r geosearch Sicily fromlonlat 15 37 bybox 400 400 km asc]
+        assert_equal $ret2 {Catania Palermo eage2 edge1}
+    }
+
+    test {GEOSEARCH non square, long and narrow} {
+        r del Sicily
+        r geoadd Sicily 12.75 36.995 "test1"
+        r geoadd Sicily 12.75 36.50 "test2"
+        r geoadd Sicily 13.00 36.50 "test3"
+        # box height=2km width=400km
+        set ret1 [r geosearch Sicily fromlonlat 15 37 bybox 400 2 km]
+        assert_equal $ret1 {test1}
+
+        # Add a western Hemisphere point
+        r geoadd Sicily -1 37.00 "test3"
+        set ret2 [r geosearch Sicily fromlonlat 15 37 bybox 3000 2 km asc]
+        assert_equal $ret2 {test1 test3}
+    }
+
+    test {GEOSEARCH corner point test} {
+        r del Sicily
+        r geoadd Sicily 12.758489 38.788135 edge1 17.241510 38.788135 edge2 17.250000 35.202000 edge3 12.750000 35.202000 edge4 12.748489955781654 37 edge5 15 38.798135872540925 edge6 17.251510044218346 37 edge7 15 35.201864127459075 edge8 12.692799634687903 38.798135872540925 corner1 12.692799634687903 38.798135872540925 corner2 17.200560937451133 35.201864127459075 corner3 12.799439062548865 35.201864127459075 corner4
+        set ret [lsort [r geosearch Sicily fromlonlat 15 37 bybox 400 400 km asc]]
+        assert_equal $ret {edge1 edge2 edge5 edge7}
+    }
+
+    test {GEORADIUSBYMEMBER withdist (sorted)} {
+        r georadiusbymember nyc "wtc one" 7 km withdist
+    } {{{wtc one} 0.0000} {{union square} 3.2544} {{central park n/q/r} 6.7000} {4545 6.1975} {{lic market} 6.8969}}
+
+    test {GEOHASH is able to return geohash strings} {
+        # Example from Wikipedia.
+        r del points
+        r geoadd points -5.6 42.6 test
+        lindex [r geohash points test] 0
+    } {ezs42e44yx0}
+
+    test {GEOPOS simple} {
+        r del points
+        r geoadd points 10 20 a 30 40 b
+        lassign [lindex [r geopos points a b] 0] x1 y1
+        lassign [lindex [r geopos points a b] 1] x2 y2
+        assert {abs($x1 - 10) < 0.001}
+        assert {abs($y1 - 20) < 0.001}
+        assert {abs($x2 - 30) < 0.001}
+        assert {abs($y2 - 40) < 0.001}
+    }
+
+    test {GEOPOS missing element} {
+        r del points
+        r geoadd points 10 20 a 30 40 b
+        lindex [r geopos points a x b] 1
+    } {}
+
+    test {GEODIST simple & unit} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        set m [r geodist points Palermo Catania]
+        assert {$m > 166274 && $m < 166275}
+        set km [r geodist points Palermo Catania km]
+        assert {$km > 166.2 && $km < 166.3}
+    }
+
+    test {GEODIST missing elements} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        set m [r geodist points Palermo Agrigento]
+        assert {$m eq {}}
+        set m [r geodist points Ragusa Agrigento]
+        assert {$m eq {}}
+        set m [r geodist empty_key Palermo Catania]
+        assert {$m eq {}}
+    }
+
+    test {GEORADIUS STORE option: syntax error} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        catch {r georadius points 13.361389 38.115556 50 km store} e
+        set e
+    } {*ERR*syntax*}
+
+    test {GEOSEARCHSTORE STORE option: syntax error} {
+        catch {r geosearchstore abc points fromlonlat 13.361389 38.115556 byradius 50 km store abc} e
+        set e
+    } {*ERR*syntax*}
+
+    test {GEORANGE STORE option: incompatible options} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        catch {r georadius points 13.361389 38.115556 50 km store points2 withdist} e
+        assert_match {*ERR*} $e
+        catch {r georadius points 13.361389 38.115556 50 km store points2 withhash} e
+        assert_match {*ERR*} $e
+        catch {r georadius points 13.361389 38.115556 50 km store points2 withcoords} e
+        assert_match {*ERR*} $e
+    }
+
+    test {GEORANGE STORE option: plain usage} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        r georadius points 13.361389 38.115556 500 km store points2
+        assert_equal [r zrange points 0 -1] [r zrange points2 0 -1]
+    }
+
+    test {GEORADIUSBYMEMBER STORE/STOREDIST option: plain usage} {
+        r del points{t}
+        r geoadd points{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
+
+        r georadiusbymember points{t} Palermo 500 km store points2{t}
+        assert_equal {Palermo Catania} [r zrange points2{t} 0 -1]
+
+        r georadiusbymember points{t} Catania 500 km storedist points2{t}
+        assert_equal {Catania Palermo} [r zrange points2{t} 0 -1]
+
+        set res [r zrange points2{t} 0 -1 withscores]
+        assert {[lindex $res 1] < 1}
+        assert {[lindex $res 3] > 166}
+    }
+
+    test {GEOSEARCHSTORE STORE option: plain usage} {
+        r geosearchstore points2 points fromlonlat 13.361389 38.115556 byradius 500 km
+        assert_equal [r zrange points 0 -1] [r zrange points2 0 -1]
+    }
+
+    test {GEORANGE STOREDIST option: plain usage} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        r georadius points 13.361389 38.115556 500 km storedist points2
+        set res [r zrange points2 0 -1 withscores]
+        assert {[lindex $res 1] < 1}
+        assert {[lindex $res 3] > 166}
+        assert {[lindex $res 3] < 167}
+    }
+
+    test {GEOSEARCHSTORE STOREDIST option: plain usage} {
+        r geosearchstore points2 points fromlonlat 13.361389 38.115556 byradius 500 km storedist
+        set res [r zrange points2 0 -1 withscores]
+        assert {[lindex $res 1] < 1}
+        assert {[lindex $res 3] > 166}
+        assert {[lindex $res 3] < 167}
+    }
+
+    test {GEORANGE STOREDIST option: COUNT ASC and DESC} {
+        r del points
+        r geoadd points 13.361389 38.115556 "Palermo" \
+                        15.087269 37.502669 "Catania"
+        r georadius points 13.361389 38.115556 500 km storedist points2 asc count 1
+        assert {[r zcard points2] == 1}
+        set res [r zrange points2 0 -1 withscores]
+        assert {[lindex $res 0] eq "Palermo"}
+
+        r georadius points 13.361389 38.115556 500 km storedist points2 desc count 1
+        assert {[r zcard points2] == 1}
+        set res [r zrange points2 0 -1 withscores]
+        assert {[lindex $res 0] eq "Catania"}
+    }
+
+    test {GEOSEARCH the box spans -180° or 180°} {
+        r del points
+        r geoadd points 179.5 36 point1
+        r geoadd points -179.5 36 point2
+        assert_equal {point1 point2} [r geosearch points fromlonlat 179 37 bybox 400 400 km asc]
+        assert_equal {point2 point1} [r geosearch points fromlonlat -179 37 bybox 400 400 km asc]
+    }
+
+    foreach {type} {byradius bybox} {
+    test "GEOSEARCH fuzzy test - $type" {
+        if {$::accurate} { set attempt 300 } else { set attempt 30 }
+        while {[incr attempt -1]} {
+            set rv [lindex $regression_vectors $rv_idx]
+            incr rv_idx
+
+            set radius_km 0; set width_km 0; set height_km 0
+            unset -nocomplain debuginfo
+            set srand_seed [clock milliseconds]
+            if {$rv ne {}} {set srand_seed [lindex $rv 0]}
+            lappend debuginfo "srand_seed is $srand_seed"
+            expr {srand($srand_seed)} ; # If you need a reproducible run
+            r del mypoints
+
+            if {[randomInt 10] == 0} {
+                # From time to time use very big radiuses
+                if {$type == "byradius"} {
+                    set radius_km [expr {[randomInt 5000]+10}]
+                } elseif {$type == "bybox"} {
+                    set width_km [expr {[randomInt 5000]+10}]
+                    set height_km [expr {[randomInt 5000]+10}]
+                }
+            } else {
+                # Normally use a few - ~200km radiuses to stress
+                # test the code the most in edge cases.
+                if {$type == "byradius"} {
+                    set radius_km [expr {[randomInt 200]+10}]
+                } elseif {$type == "bybox"} {
+                    set width_km [expr {[randomInt 200]+10}]
+                    set height_km [expr {[randomInt 200]+10}]
+                }
+            }
+            if {$rv ne {}} {
+                set radius_km [lindex $rv 1]
+                set width_km [lindex $rv 1]
+                set height_km [lindex $rv 1]
+            }
+            geo_random_point search_lon search_lat
+            if {$rv ne {}} {
+                set search_lon [lindex $rv 2]
+                set search_lat [lindex $rv 3]
+            }
+            lappend debuginfo "Search area: $search_lon,$search_lat $radius_km $width_km $height_km km"
+            set tcl_result {}
+            set argv {}
+            for {set j 0} {$j < 20000} {incr j} {
+                geo_random_point lon lat
+                lappend argv $lon $lat "place:$j"
+                if {$type == "byradius"} {
+                    if {[pointInCircle $radius_km $lon $lat $search_lon $search_lat]} {
+                        lappend tcl_result "place:$j"
+                    }
+                } elseif {$type == "bybox"} {
+                    if {[pointInRectangle $width_km $height_km $lon $lat $search_lon $search_lat 1]} {
+                        lappend tcl_result "place:$j"
+                    }
+                }
+                lappend debuginfo "place:$j $lon $lat"
+            }
+            r geoadd mypoints {*}$argv
+            if {$type == "byradius"} {
+                set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat byradius $radius_km km]]
+            } elseif {$type == "bybox"} {
+                set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_km $height_km km]]
+            }
+            set res2 [lsort $tcl_result]
+            set test_result OK
+
+            if {$res != $res2} {
+                set rounding_errors 0
+                set diff [compare_lists $res $res2]
+                foreach place $diff {
+                    lassign [lindex [r geopos mypoints $place] 0] lon lat
+                    set mydist [geo_distance $lon $lat $search_lon $search_lat]
+                    set mydist [expr $mydist/1000]
+                    if {$type == "byradius"} {
+                        if {($mydist / $radius_km) > 0.999} {
+                            incr rounding_errors
+                            continue
+                        }
+                        if {$mydist < [expr {$radius_km*1000}]} {
+                            # This is a false positive for redis since given the
+                            # same points the higher precision calculation provided
+                            # by TCL shows the point within range
+                            incr rounding_errors
+                            continue
+                        }
+                    } elseif {$type == "bybox"} {
+                        # we add 0.1% error for floating point calculation error
+                        if {[pointInRectangle $width_km $height_km $lon $lat $search_lon $search_lat 1.001]} {
+                            incr rounding_errors
+                            continue
+                        }
+                    }
+                }
+
+                # Make sure this is a real error and not a rounidng issue.
+                if {[llength $diff] == $rounding_errors} {
+                    set res $res2; # Error silenced
+                }
+            }
+
+            if {$res != $res2} {
+                set diff [compare_lists $res $res2]
+                puts "*** Possible problem in GEO radius query ***"
+                puts "Redis: $res"
+                puts "Tcl  : $res2"
+                puts "Diff : $diff"
+                puts [join $debuginfo "\n"]
+                foreach place $diff {
+                    if {[lsearch -exact $res2 $place] != -1} {
+                        set where "(only in Tcl)"
+                    } else {
+                        set where "(only in Redis)"
+                    }
+                    lassign [lindex [r geopos mypoints $place] 0] lon lat
+                    set mydist [geo_distance $lon $lat $search_lon $search_lat]
+                    set mydist [expr $mydist/1000]
+                    puts "$place -> [r geopos mypoints $place] $mydist $where"
+                }
+                set test_result FAIL
+            }
+            unset -nocomplain debuginfo
+            if {$test_result ne {OK}} break
+        }
+        set test_result
+    } {OK}
+    }
+
+    test {GEOSEARCH box edges fuzzy test} {
+        if {$::accurate} { set attempt 300 } else { set attempt 30 }
+        while {[incr attempt -1]} {
+            unset -nocomplain debuginfo
+            set srand_seed [clock milliseconds]
+            lappend debuginfo "srand_seed is $srand_seed"
+            expr {srand($srand_seed)} ; # If you need a reproducible run
+            r del mypoints
+
+            geo_random_point search_lon search_lat
+            set width_m [expr {[randomInt 10000]+10}]
+            set height_m [expr {[randomInt 10000]+10}]
+            set lat_delta [geo_raddeg [expr {$height_m/2/6372797.560856}]]
+            set long_delta_top [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad [expr {$search_lat+$lat_delta}]])}]]
+            set long_delta_middle [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad $search_lat])}]]
+            set long_delta_bottom [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad [expr {$search_lat-$lat_delta}]])}]]
+
+            # Total of 8 points are generated, which are located at each vertex and the center of each side
+            set points(north) [list $search_lon [expr {$search_lat+$lat_delta}]]
+            set points(south) [list $search_lon [expr {$search_lat-$lat_delta}]]
+            set points(east) [list [expr {$search_lon+$long_delta_middle}] $search_lat]
+            set points(west) [list [expr {$search_lon-$long_delta_middle}] $search_lat]
+            set points(north_east) [list [expr {$search_lon+$long_delta_top}] [expr {$search_lat+$lat_delta}]]
+            set points(north_west) [list [expr {$search_lon-$long_delta_top}] [expr {$search_lat+$lat_delta}]]
+            set points(south_east) [list [expr {$search_lon+$long_delta_bottom}] [expr {$search_lat-$lat_delta}]]
+            set points(south_west) [list [expr {$search_lon-$long_delta_bottom}] [expr {$search_lat-$lat_delta}]]
+
+            lappend debuginfo "Search area: geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_m $height_m m"
+            set tcl_result {}
+            foreach name [array names points] {
+                set x [lindex $points($name) 0]
+                set y [lindex $points($name) 1]
+                # If longitude crosses -180° or 180°, we need to convert it.
+                # latitude doesn't have this problem, because it's scope is -70~70, see geo_random_point
+                if {$x > 180} {
+                    set x [expr {$x-360}]
+                } elseif {$x < -180} {
+                    set x [expr {$x+360}]
+                }
+                r geoadd mypoints $x $y place:$name
+                lappend tcl_result "place:$name"
+                lappend debuginfo "geoadd mypoints $x $y place:$name"
+            }
+
+            set res2 [lsort $tcl_result]
+
+            # make the box larger by two meter in each direction to put the coordinate slightly inside the box.
+            set height_new [expr {$height_m+4}]
+            set width_new [expr {$width_m+4}]
+            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
+            if {$res != $res2} {
+                set diff [compare_lists $res $res2]
+                lappend debuginfo "res: $res, res2: $res2, diff: $diff"
+                fail "place should be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
+            }
+
+            # The width decreases and the height increases. Only north and south are found
+            set width_new [expr {$width_m-4}]
+            set height_new [expr {$height_m+4}]
+            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
+            if {$res != {place:north place:south}} {
+                lappend debuginfo "res: $res"
+                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
+            }
+
+            # The width increases and the height decreases. Only ease and west are found
+            set width_new [expr {$width_m+4}]
+            set height_new [expr {$height_m-4}]
+            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
+            if {$res != {place:east place:west}} {
+                lappend debuginfo "res: $res"
+                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
+            }
+
+            # make the box smaller by two meter in each direction to put the coordinate slightly outside the box.
+            set height_new [expr {$height_m-4}]
+            set width_new [expr {$width_m-4}]
+            set res [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]
+            if {$res != ""} {
+                lappend debuginfo "res: $res"
+                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
+            }
+            unset -nocomplain debuginfo
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/hyperloglog.tcl b/redis-stable/tests/unit/hyperloglog.tcl
new file mode 100644
index 00000000..db26a2e7
--- /dev/null
+++ b/redis-stable/tests/unit/hyperloglog.tcl
@@ -0,0 +1,213 @@
+start_server {tags {"hll"}} {
+    test {HyperLogLog self test passes} {
+        catch {r pfselftest} e
+        set e
+    } {OK}
+
+    test {PFADD without arguments creates an HLL value} {
+        r pfadd hll
+        r exists hll
+    } {1}
+
+    test {Approximated cardinality after creation is zero} {
+        r pfcount hll
+    } {0}
+
+    test {PFADD returns 1 when at least 1 reg was modified} {
+        r pfadd hll a b c
+    } {1}
+
+    test {PFADD returns 0 when no reg was modified} {
+        r pfadd hll a b c
+    } {0}
+
+    test {PFADD works with empty string (regression)} {
+        r pfadd hll ""
+    }
+
+    # Note that the self test stresses much better the
+    # cardinality estimation error. We are testing just the
+    # command implementation itself here.
+    test {PFCOUNT returns approximated cardinality of set} {
+        r del hll
+        set res {}
+        r pfadd hll 1 2 3 4 5
+        lappend res [r pfcount hll]
+        # Call it again to test cached value invalidation.
+        r pfadd hll 6 7 8 8 9 10
+        lappend res [r pfcount hll]
+        set res
+    } {5 10}
+
+    test {HyperLogLogs are promote from sparse to dense} {
+        r del hll
+        r config set hll-sparse-max-bytes 3000
+        set n 0
+        while {$n < 100000} {
+            set elements {}
+            for {set j 0} {$j < 100} {incr j} {lappend elements [expr rand()]}
+            incr n 100
+            r pfadd hll {*}$elements
+            set card [r pfcount hll]
+            set err [expr {abs($card-$n)}]
+            assert {$err < (double($card)/100)*5}
+            if {$n < 1000} {
+                assert {[r pfdebug encoding hll] eq {sparse}}
+            } elseif {$n > 10000} {
+                assert {[r pfdebug encoding hll] eq {dense}}
+            }
+        }
+    }
+
+    test {HyperLogLog sparse encoding stress test} {
+        for {set x 0} {$x < 1000} {incr x} {
+            r del hll1 hll2
+            set numele [randomInt 100]
+            set elements {}
+            for {set j 0} {$j < $numele} {incr j} {
+                lappend elements [expr rand()]
+            }
+            # Force dense representation of hll2
+            r pfadd hll2
+            r pfdebug todense hll2
+            r pfadd hll1 {*}$elements
+            r pfadd hll2 {*}$elements
+            assert {[r pfdebug encoding hll1] eq {sparse}}
+            assert {[r pfdebug encoding hll2] eq {dense}}
+            # Cardinality estimated should match exactly.
+            assert {[r pfcount hll1] eq [r pfcount hll2]}
+        }
+    }
+
+    test {Corrupted sparse HyperLogLogs are detected: Additional at tail} {
+        r del hll
+        r pfadd hll a b c
+        r append hll "hello"
+        set e {}
+        catch {r pfcount hll} e
+        set e
+    } {*INVALIDOBJ*}
+
+    test {Corrupted sparse HyperLogLogs are detected: Broken magic} {
+        r del hll
+        r pfadd hll a b c
+        r setrange hll 0 "0123"
+        set e {}
+        catch {r pfcount hll} e
+        set e
+    } {*WRONGTYPE*}
+
+    test {Corrupted sparse HyperLogLogs are detected: Invalid encoding} {
+        r del hll
+        r pfadd hll a b c
+        r setrange hll 4 "x"
+        set e {}
+        catch {r pfcount hll} e
+        set e
+    } {*WRONGTYPE*}
+
+    test {Corrupted dense HyperLogLogs are detected: Wrong length} {
+        r del hll
+        r pfadd hll a b c
+        r setrange hll 4 "\x00"
+        set e {}
+        catch {r pfcount hll} e
+        set e
+    } {*WRONGTYPE*}
+
+    test {Fuzzing dense/sparse encoding: Redis should always detect errors} {
+        for {set j 0} {$j < 1000} {incr j} {
+            r del hll
+            set items {}
+            set numitems [randomInt 3000]
+            for {set i 0} {$i < $numitems} {incr i} {
+                lappend items [expr {rand()}]
+            }
+            r pfadd hll {*}$items
+
+            # Corrupt it in some random way.
+            for {set i 0} {$i < 5} {incr i} {
+                set len [r strlen hll]
+                set pos [randomInt $len]
+                set byte [randstring 1 1 binary]
+                r setrange hll $pos $byte
+                # Don't modify more bytes 50% of times
+                if {rand() < 0.5} break
+            }
+
+            # Use the hyperloglog to check if it crashes
+            # Redis in some way.
+            catch {
+                r pfcount hll
+            }
+        }
+    }
+
+    test {PFADD, PFCOUNT, PFMERGE type checking works} {
+        r set foo bar
+        catch {r pfadd foo 1} e
+        assert_match {*WRONGTYPE*} $e
+        catch {r pfcount foo} e
+        assert_match {*WRONGTYPE*} $e
+        catch {r pfmerge bar foo} e
+        assert_match {*WRONGTYPE*} $e
+        catch {r pfmerge foo bar} e
+        assert_match {*WRONGTYPE*} $e
+    }
+
+    test {PFMERGE results on the cardinality of union of sets} {
+        r del hll hll1 hll2 hll3
+        r pfadd hll1 a b c
+        r pfadd hll2 b c d
+        r pfadd hll3 c d e
+        r pfmerge hll hll1 hll2 hll3
+        r pfcount hll
+    } {5}
+
+    test {PFCOUNT multiple-keys merge returns cardinality of union #1} {
+        r del hll1 hll2 hll3
+        for {set x 1} {$x < 10000} {incr x} {
+            r pfadd hll1 "foo-$x"
+            r pfadd hll2 "bar-$x"
+            r pfadd hll3 "zap-$x"
+
+            set card [r pfcount hll1 hll2 hll3]
+            set realcard [expr {$x*3}]
+            set err [expr {abs($card-$realcard)}]
+            assert {$err < (double($card)/100)*5}
+        }
+    }
+
+    test {PFCOUNT multiple-keys merge returns cardinality of union #2} {
+        r del hll1 hll2 hll3
+        set elements {}
+        for {set x 1} {$x < 10000} {incr x} {
+            for {set j 1} {$j <= 3} {incr j} {
+                set rint [randomInt 20000]
+                r pfadd hll$j $rint
+                lappend elements $rint
+            }
+        }
+        set realcard [llength [lsort -unique $elements]]
+        set card [r pfcount hll1 hll2 hll3]
+        set err [expr {abs($card-$realcard)}]
+        assert {$err < (double($card)/100)*5}
+    }
+
+    test {PFDEBUG GETREG returns the HyperLogLog raw registers} {
+        r del hll
+        r pfadd hll 1 2 3
+        llength [r pfdebug getreg hll]
+    } {16384}
+
+    test {PFADD / PFCOUNT cache invalidation works} {
+        r del hll
+        r pfadd hll a b c
+        r pfcount hll
+        assert {[r getrange hll 15 15] eq "\x00"}
+        r pfadd hll a b c
+        assert {[r getrange hll 15 15] eq "\x00"}
+        r pfadd hll 1 2 3
+        assert {[r getrange hll 15 15] eq "\x80"}
+    }
+}
diff --git a/redis-stable/tests/unit/info.tcl b/redis-stable/tests/unit/info.tcl
new file mode 100644
index 00000000..61be4a0d
--- /dev/null
+++ b/redis-stable/tests/unit/info.tcl
@@ -0,0 +1,175 @@
+proc cmdstat {cmd} {
+    return [cmdrstat $cmd r]
+}
+
+proc errorstat {cmd} {
+    return [errorrstat $cmd r]
+}
+
+start_server {tags {"info"}} {
+    start_server {} {
+
+        test {errorstats: failed call authentication error} {
+            r config resetstat
+            assert_match {} [errorstat ERR]
+            assert_equal [s total_error_replies] 0
+            catch {r auth k} e
+            assert_match {ERR AUTH*} $e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat auth]
+            assert_equal [s total_error_replies] 1
+            r config resetstat
+            assert_match {} [errorstat ERR]
+        }
+
+        test {errorstats: failed call within MULTI/EXEC} {
+            r config resetstat
+            assert_match {} [errorstat ERR]
+            assert_equal [s total_error_replies] 0
+            r multi
+            r set a b
+            r auth a
+            catch {r exec} e
+            assert_match {ERR AUTH*} $e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat set]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat auth]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat exec]
+            assert_equal [s total_error_replies] 1
+
+            # MULTI/EXEC command errors should still be pinpointed to him
+            catch {r exec} e
+            assert_match {ERR EXEC without MULTI} $e
+            assert_match {*calls=2,*,rejected_calls=0,failed_calls=1} [cmdstat exec]
+            assert_match {*count=2*} [errorstat ERR]
+            assert_equal [s total_error_replies] 2
+        }
+
+        test {errorstats: failed call within LUA} {
+            r config resetstat
+            assert_match {} [errorstat ERR]
+            assert_equal [s total_error_replies] 0
+            catch {r eval {redis.pcall('XGROUP', 'CREATECONSUMER', 's1', 'mygroup', 'consumer') return } 0} e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat xgroup]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat eval]
+
+            # EVAL command errors should still be pinpointed to him
+            catch {r eval a} e
+            assert_match {ERR wrong*} $e
+            assert_match {*calls=1,*,rejected_calls=1,failed_calls=0} [cmdstat eval]
+            assert_match {*count=2*} [errorstat ERR]
+            assert_equal [s total_error_replies] 2
+        }
+
+        test {errorstats: failed call NOSCRIPT error} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat NOSCRIPT]
+            catch {r evalsha NotValidShaSUM 0} e
+            assert_match {NOSCRIPT*} $e
+            assert_match {*count=1*} [errorstat NOSCRIPT]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat evalsha]
+            assert_equal [s total_error_replies] 1
+            r config resetstat
+            assert_match {} [errorstat NOSCRIPT]
+        }
+
+        test {errorstats: failed call NOGROUP error} {
+            r config resetstat
+            assert_match {} [errorstat NOGROUP]
+            r del mystream
+            r XADD mystream * f v
+            catch {r XGROUP CREATECONSUMER mystream mygroup consumer} e
+            assert_match {NOGROUP*} $e
+            assert_match {*count=1*} [errorstat NOGROUP]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat xgroup]
+            r config resetstat
+            assert_match {} [errorstat NOGROUP]
+        }
+
+        test {errorstats: rejected call unknown command} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat ERR]
+            catch {r asdf} e
+            assert_match {ERR unknown*} $e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_equal [s total_error_replies] 1
+            r config resetstat
+            assert_match {} [errorstat ERR]
+        }
+
+        test {errorstats: rejected call within MULTI/EXEC} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat ERR]
+            r multi
+            catch {r set} e
+            assert_match {ERR wrong number of arguments*} $e
+            catch {r exec} e
+            assert_match {EXECABORT*} $e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_match {*count=1*} [errorstat EXECABORT]
+            assert_equal [s total_error_replies] 2
+            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat multi]
+            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat exec]
+            assert_equal [s total_error_replies] 2
+            r config resetstat
+            assert_match {} [errorstat ERR]
+        }
+
+        test {errorstats: rejected call due to wrong arity} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat ERR]
+            catch {r set k} e
+            assert_match {ERR wrong number of arguments*} $e
+            assert_match {*count=1*} [errorstat ERR]
+            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
+            # ensure that after a rejected command, valid ones are counted properly
+            r set k1 v1
+            r set k2 v2
+            assert_match {calls=2,*,rejected_calls=1,failed_calls=0} [cmdstat set]
+            assert_equal [s total_error_replies] 1
+        }
+
+        test {errorstats: rejected call by OOM error} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat OOM]
+            r config set maxmemory 1
+            catch {r set a b} e
+            assert_match {OOM*} $e
+            assert_match {*count=1*} [errorstat OOM]
+            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
+            assert_equal [s total_error_replies] 1
+            r config resetstat
+            assert_match {} [errorstat OOM]
+        }
+
+        test {errorstats: rejected call by authorization error} {
+            r config resetstat
+            assert_equal [s total_error_replies] 0
+            assert_match {} [errorstat NOPERM]
+            r ACL SETUSER alice on >p1pp0 ~cached:* +get +info +config
+            r auth alice p1pp0
+            catch {r set a b} e
+            assert_match {NOPERM*} $e
+            assert_match {*count=1*} [errorstat NOPERM]
+            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
+            assert_equal [s total_error_replies] 1
+            r config resetstat
+            assert_match {} [errorstat NOPERM]
+        }
+    }
+
+    start_server {} {
+        test {Unsafe command names are sanitized in INFO output} {
+            catch {r host:} e
+            set info [r info commandstats]
+            assert_match {*cmdstat_host_:calls=1*} $info
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/introspection-2.tcl b/redis-stable/tests/unit/introspection-2.tcl
new file mode 100644
index 00000000..a34a15d6
--- /dev/null
+++ b/redis-stable/tests/unit/introspection-2.tcl
@@ -0,0 +1,79 @@
+proc cmdstat {cmd} {
+    return [cmdrstat $cmd r]
+}
+
+start_server {tags {"introspection"}} {
+    test {TTL, TYPE and EXISTS do not alter the last access time of a key} {
+        r set foo bar
+        after 3000
+        r ttl foo
+        r type foo
+        r exists foo
+        assert {[r object idletime foo] >= 2}
+    }
+
+    test {TOUCH alters the last access time of a key} {
+        r set foo bar
+        after 3000
+        r touch foo
+        assert {[r object idletime foo] < 2}
+    }
+
+    test {TOUCH returns the number of existing keys specified} {
+        r flushdb
+        r set key1 1
+        r set key2 2
+        r touch key0 key1 key2 key3
+    } 2
+
+    test {command stats for GEOADD} {
+        r config resetstat
+        r GEOADD foo 0 0 bar
+        assert_match {*calls=1,*} [cmdstat geoadd]
+        assert_match {} [cmdstat zadd]
+    }
+
+    test {command stats for EXPIRE} {
+        r config resetstat
+        r SET foo bar
+        r EXPIRE foo 0
+        assert_match {*calls=1,*} [cmdstat expire]
+        assert_match {} [cmdstat del]
+    }
+
+    test {command stats for BRPOP} {
+        r config resetstat
+        r LPUSH list foo
+        r BRPOP list 0
+        assert_match {*calls=1,*} [cmdstat brpop]
+        assert_match {} [cmdstat rpop]
+    }
+
+    test {command stats for MULTI} {
+        r config resetstat
+        r MULTI
+        r set foo bar
+        r GEOADD foo2 0 0 bar
+        r EXPIRE foo2 0
+        r EXEC
+        assert_match {*calls=1,*} [cmdstat multi]
+        assert_match {*calls=1,*} [cmdstat exec]
+        assert_match {*calls=1,*} [cmdstat set]
+        assert_match {*calls=1,*} [cmdstat expire]
+        assert_match {*calls=1,*} [cmdstat geoadd]
+    }
+
+    test {command stats for scripts} {
+        r config resetstat
+        r set mykey myval
+        r eval {
+            redis.call('set', KEYS[1], 0)
+            redis.call('expire', KEYS[1], 0)
+            redis.call('geoadd', KEYS[1], 0, 0, "bar")
+        } 1 mykey
+        assert_match {*calls=1,*} [cmdstat eval]
+        assert_match {*calls=2,*} [cmdstat set]
+        assert_match {*calls=1,*} [cmdstat expire]
+        assert_match {*calls=1,*} [cmdstat geoadd]
+    }
+}
diff --git a/redis-stable/tests/unit/introspection.tcl b/redis-stable/tests/unit/introspection.tcl
new file mode 100644
index 00000000..0c78edf2
--- /dev/null
+++ b/redis-stable/tests/unit/introspection.tcl
@@ -0,0 +1,251 @@
+start_server {tags {"introspection"}} {
+    test {CLIENT LIST} {
+        r client list
+    } {*addr=*:* fd=* age=* idle=* flags=N db=9 sub=0 psub=0 multi=-1 qbuf=26 qbuf-free=* argv-mem=* obl=0 oll=0 omem=0 tot-mem=* events=r cmd=client*}
+
+    test {CLIENT LIST with IDs} {
+        set myid [r client id]
+        set cl [split [r client list id $myid] "\r\n"]
+        assert_match "id=$myid*" [lindex $cl 0]
+    }
+
+    test {CLIENT INFO} {
+        r client info
+    } {*addr=*:* fd=* age=* idle=* flags=N db=9 sub=0 psub=0 multi=-1 qbuf=26 qbuf-free=* argv-mem=* obl=0 oll=0 omem=0 tot-mem=* events=r cmd=client*}
+
+    test {MONITOR can log executed commands} {
+        set rd [redis_deferring_client]
+        $rd monitor
+        assert_match {*OK*} [$rd read]
+        r set foo bar
+        r get foo
+        list [$rd read] [$rd read]
+    } {*"set" "foo"*"get" "foo"*}
+
+    test {MONITOR can log commands issued by the scripting engine} {
+        set rd [redis_deferring_client]
+        $rd monitor
+        $rd read ;# Discard the OK
+        r eval {redis.call('set',KEYS[1],ARGV[1])} 1 foo bar
+        assert_match {*eval*} [$rd read]
+        assert_match {*lua*"set"*"foo"*"bar"*} [$rd read]
+    }
+
+    test {MONITOR supports redacting command arguments} {
+        set rd [redis_deferring_client]
+        $rd monitor
+        $rd read ; # Discard the OK
+
+        r migrate [srv 0 host] [srv 0 port] key 9 5000
+        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH user
+        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH2 user password
+        catch {r auth not-real} _
+        catch {r auth not-real not-a-password} _
+        catch {r hello 2 AUTH not-real not-a-password} _
+
+        assert_match {*"key"*"9"*"5000"*} [$rd read]
+        assert_match {*"key"*"9"*"5000"*"(redacted)"*} [$rd read]
+        assert_match {*"key"*"9"*"5000"*"(redacted)"*"(redacted)"*} [$rd read]
+        assert_match {*"auth"*"(redacted)"*} [$rd read]
+        assert_match {*"auth"*"(redacted)"*"(redacted)"*} [$rd read]
+        assert_match {*"hello"*"2"*"AUTH"*"(redacted)"*"(redacted)"*} [$rd read]
+        $rd close
+    }
+
+    test {MONITOR correctly handles multi-exec cases} {
+        set rd [redis_deferring_client]
+        $rd monitor
+        $rd read ; # Discard the OK
+
+        # Make sure multi-exec statements are ordered
+        # correctly
+        r multi
+        r set foo bar
+        r exec
+        assert_match {*"multi"*} [$rd read]
+        assert_match {*"set"*"foo"*"bar"*} [$rd read]
+        assert_match {*"exec"*} [$rd read]
+
+        # Make sure we close multi statements on errors
+        r multi
+        catch {r syntax error} _
+        catch {r exec} _
+
+        assert_match {*"multi"*} [$rd read]
+        assert_match {*"exec"*} [$rd read]
+
+        $rd close
+    }
+
+    test {CLIENT GETNAME should return NIL if name is not assigned} {
+        r client getname
+    } {}
+
+    test {CLIENT LIST shows empty fields for unassigned names} {
+        r client list
+    } {*name= *}
+
+    test {CLIENT SETNAME does not accept spaces} {
+        catch {r client setname "foo bar"} e
+        set e
+    } {ERR*}
+
+    test {CLIENT SETNAME can assign a name to this connection} {
+        assert_equal [r client setname myname] {OK}
+        r client list
+    } {*name=myname*}
+
+    test {CLIENT SETNAME can change the name of an existing connection} {
+        assert_equal [r client setname someothername] {OK}
+        r client list
+    } {*name=someothername*}
+
+    test {After CLIENT SETNAME, connection can still be closed} {
+        set rd [redis_deferring_client]
+        $rd client setname foobar
+        assert_equal [$rd read] "OK"
+        assert_match {*foobar*} [r client list]
+        $rd close
+        # Now the client should no longer be listed
+        wait_for_condition 50 100 {
+            [string match {*foobar*} [r client list]] == 0
+        } else {
+            fail "Client still listed in CLIENT LIST after SETNAME."
+        }
+    }
+
+    test {CONFIG save params special case handled properly} {
+        # No "save" keyword - defaults should apply
+        start_server {config "minimal.conf"} {
+            assert_match [r config get save] {save {3600 1 300 100 60 10000}}
+        }
+
+        # First "save" keyword overrides defaults
+        start_server {config "minimal.conf" overrides {save {100 100}}} {
+            # Defaults
+            assert_match [r config get save] {save {100 100}}
+        }
+    }
+
+    test {CONFIG sanity} {
+        # Do CONFIG GET, CONFIG SET and then CONFIG GET again
+        # Skip immutable configs, one with no get, and other complicated configs
+        set skip_configs {
+            rdbchecksum
+            daemonize
+            io-threads-do-reads
+            tcp-backlog
+            always-show-logo
+            syslog-enabled
+            cluster-enabled
+            aclfile
+            unixsocket
+            pidfile
+            syslog-ident
+            appendfilename
+            supervised
+            syslog-facility
+            databases
+            io-threads
+            logfile
+            unixsocketperm
+            slaveof
+            requirepass
+            server_cpulist
+            bio_cpulist
+            aof_rewrite_cpulist
+            bgsave_cpulist
+            set-proc-title
+        }
+
+        if {!$::tls} {
+            append skip_configs {
+                tls-prefer-server-ciphers
+                tls-session-cache-timeout
+                tls-session-cache-size
+                tls-session-caching
+                tls-cert-file
+                tls-key-file
+                tls-client-cert-file
+                tls-client-key-file
+                tls-dh-params-file
+                tls-ca-cert-file
+                tls-ca-cert-dir
+                tls-protocols
+                tls-ciphers
+                tls-ciphersuites
+                tls-port
+            }
+        }
+
+        set configs {}
+        foreach {k v} [r config get *] {
+            if {[lsearch $skip_configs $k] != -1} {
+                continue
+            }
+            dict set configs $k $v
+            # try to set the config to the same value it already has
+            r config set $k $v
+        }
+
+        set newconfigs {}
+        foreach {k v} [r config get *] {
+            if {[lsearch $skip_configs $k] != -1} {
+                continue
+            }
+            dict set newconfigs $k $v
+        }
+
+        dict for {k v} $configs {
+            set vv [dict get $newconfigs $k]
+            if {$v != $vv} {
+                fail "config $k mismatch, expecting $v but got $vv"
+            }
+
+        }
+    }
+
+    # Do a force-all config rewrite and make sure we're able to parse
+    # it.
+    test {CONFIG REWRITE sanity} {
+        # Capture state of config before
+        set configs {}
+        foreach {k v} [r config get *] {
+            dict set configs $k $v
+        }
+
+        # Rewrite entire configuration, restart and confirm the
+        # server is able to parse it and start.
+        assert_equal [r debug config-rewrite-force-all] "OK"
+        restart_server 0 true false
+        assert_equal [r ping] "PONG"
+
+        # Verify no changes were introduced
+        dict for {k v} $configs {
+            assert_equal $v [lindex [r config get $k] 1]
+        }
+    }
+
+    test {CONFIG REWRITE handles save properly} {
+        r config set save "3600 1 300 100 60 10000"
+        r config rewrite
+        restart_server 0 true false
+        assert_equal [r config get save] {save {3600 1 300 100 60 10000}}
+
+        r config set save ""
+        r config rewrite
+        restart_server 0 true false
+        assert_equal [r config get save] {save {}}
+
+        start_server {config "minimal.conf"} {
+            assert_equal [r config get save] {save {3600 1 300 100 60 10000}}
+            r config set save ""
+            r config rewrite
+            restart_server 0 true false
+            assert_equal [r config get save] {save {}}
+        }
+    }
+
+    # Config file at this point is at a wierd state, and includes all
+    # known keywords. Might be a good idea to avoid adding tests here.
+}
diff --git a/redis-stable/tests/unit/keyspace.tcl b/redis-stable/tests/unit/keyspace.tcl
new file mode 100644
index 00000000..c6974181
--- /dev/null
+++ b/redis-stable/tests/unit/keyspace.tcl
@@ -0,0 +1,482 @@
+start_server {tags {"keyspace"}} {
+    test {DEL against a single item} {
+        r set x foo
+        assert {[r get x] eq "foo"}
+        r del x
+        r get x
+    } {}
+
+    test {Vararg DEL} {
+        r set foo1 a
+        r set foo2 b
+        r set foo3 c
+        list [r del foo1 foo2 foo3 foo4] [r mget foo1 foo2 foo3]
+    } {3 {{} {} {}}}
+
+    test {KEYS with pattern} {
+        foreach key {key_x key_y key_z foo_a foo_b foo_c} {
+            r set $key hello
+        }
+        lsort [r keys foo*]
+    } {foo_a foo_b foo_c}
+
+    test {KEYS to get all keys} {
+        lsort [r keys *]
+    } {foo_a foo_b foo_c key_x key_y key_z}
+
+    test {DBSIZE} {
+        r dbsize
+    } {6}
+
+    test {DEL all keys} {
+        foreach key [r keys *] {r del $key}
+        r dbsize
+    } {0}
+
+    test "DEL against expired key" {
+        r debug set-active-expire 0
+        r setex keyExpire 1 valExpire
+        after 1100
+        assert_equal 0 [r del keyExpire]
+        r debug set-active-expire 1
+    }
+
+    test {EXISTS} {
+        set res {}
+        r set newkey test
+        append res [r exists newkey]
+        r del newkey
+        append res [r exists newkey]
+    } {10}
+
+    test {Zero length value in key. SET/GET/EXISTS} {
+        r set emptykey {}
+        set res [r get emptykey]
+        append res [r exists emptykey]
+        r del emptykey
+        append res [r exists emptykey]
+    } {10}
+
+    test {Commands pipelining} {
+        set fd [r channel]
+        puts -nonewline $fd "SET k1 xyzk\r\nGET k1\r\nPING\r\n"
+        flush $fd
+        set res {}
+        append res [string match OK* [r read]]
+        append res [r read]
+        append res [string match PONG* [r read]]
+        format $res
+    } {1xyzk1}
+
+    test {Non existing command} {
+        catch {r foobaredcommand} err
+        string match ERR* $err
+    } {1}
+
+    test {RENAME basic usage} {
+        r set mykey hello
+        r rename mykey mykey1
+        r rename mykey1 mykey2
+        r get mykey2
+    } {hello}
+
+    test {RENAME source key should no longer exist} {
+        r exists mykey
+    } {0}
+
+    test {RENAME against already existing key} {
+        r set mykey a
+        r set mykey2 b
+        r rename mykey2 mykey
+        set res [r get mykey]
+        append res [r exists mykey2]
+    } {b0}
+
+    test {RENAMENX basic usage} {
+        r del mykey
+        r del mykey2
+        r set mykey foobar
+        r renamenx mykey mykey2
+        set res [r get mykey2]
+        append res [r exists mykey]
+    } {foobar0}
+
+    test {RENAMENX against already existing key} {
+        r set mykey foo
+        r set mykey2 bar
+        r renamenx mykey mykey2
+    } {0}
+
+    test {RENAMENX against already existing key (2)} {
+        set res [r get mykey]
+        append res [r get mykey2]
+    } {foobar}
+
+    test {RENAME against non existing source key} {
+        catch {r rename nokey foobar} err
+        format $err
+    } {ERR*}
+
+    test {RENAME where source and dest key are the same (existing)} {
+        r set mykey foo
+        r rename mykey mykey
+    } {OK}
+
+    test {RENAMENX where source and dest key are the same (existing)} {
+        r set mykey foo
+        r renamenx mykey mykey
+    } {0}
+
+    test {RENAME where source and dest key are the same (non existing)} {
+        r del mykey
+        catch {r rename mykey mykey} err
+        format $err
+    } {ERR*}
+
+    test {RENAME with volatile key, should move the TTL as well} {
+        r del mykey mykey2
+        r set mykey foo
+        r expire mykey 100
+        assert {[r ttl mykey] > 95 && [r ttl mykey] <= 100}
+        r rename mykey mykey2
+        assert {[r ttl mykey2] > 95 && [r ttl mykey2] <= 100}
+    }
+
+    test {RENAME with volatile key, should not inherit TTL of target key} {
+        r del mykey mykey2
+        r set mykey foo
+        r set mykey2 bar
+        r expire mykey2 100
+        assert {[r ttl mykey] == -1 && [r ttl mykey2] > 0}
+        r rename mykey mykey2
+        r ttl mykey2
+    } {-1}
+
+    test {DEL all keys again (DB 0)} {
+        foreach key [r keys *] {
+            r del $key
+        }
+        r dbsize
+    } {0}
+
+    test {DEL all keys again (DB 1)} {
+        r select 10
+        foreach key [r keys *] {
+            r del $key
+        }
+        set res [r dbsize]
+        r select 9
+        format $res
+    } {0}
+
+    test {COPY basic usage for string} {
+        r set mykey foobar
+        set res {}
+        r copy mykey mynewkey
+        lappend res [r get mynewkey]
+        lappend res [r dbsize]
+        r copy mykey mynewkey DB 10
+        r select 10
+        lappend res [r get mynewkey]
+        lappend res [r dbsize]
+        r select 9
+        format $res
+    } [list foobar 2 foobar 1]
+
+    test {COPY for string does not replace an existing key without REPLACE option} {
+        r set mykey2 hello
+        catch {r copy mykey2 mynewkey DB 10} e
+        set e
+    } {0}
+
+    test {COPY for string can replace an existing key with REPLACE option} {
+        r copy mykey2 mynewkey DB 10 REPLACE
+        r select 10
+        r get mynewkey
+    } {hello}
+
+    test {COPY for string ensures that copied data is independent of copying data} {
+        r flushdb
+        r select 9
+        r set mykey foobar
+        set res {}
+        r copy mykey mynewkey DB 10
+        r select 10
+        lappend res [r get mynewkey]
+        r set mynewkey hoge
+        lappend res [r get mynewkey]
+        r select 9
+        lappend res [r get mykey]
+        r select 10
+        r flushdb
+        r select 9
+        format $res
+    } [list foobar hoge foobar]
+
+    test {COPY for string does not copy data to no-integer DB} {
+        r set mykey foobar
+        catch {r copy mykey mynewkey DB notanumber} e
+        set e
+    } {ERR value is not an integer or out of range}
+
+    test {COPY can copy key expire metadata as well} {
+        r set mykey foobar ex 100
+        r copy mykey mynewkey REPLACE
+        assert {[r ttl mynewkey] > 0 && [r ttl mynewkey] <= 100}
+        assert {[r get mynewkey] eq "foobar"}
+    }
+
+    test {COPY does not create an expire if it does not exist} {
+        r set mykey foobar
+        assert {[r ttl mykey] == -1}
+        r copy mykey mynewkey REPLACE
+        assert {[r ttl mynewkey] == -1}
+        assert {[r get mynewkey] eq "foobar"}
+    }
+
+    test {COPY basic usage for list} {
+        r del mylist mynewlist
+        r lpush mylist a b c d
+        r copy mylist mynewlist
+        set digest [r debug digest-value mylist]
+        assert_equal $digest [r debug digest-value mynewlist]
+        assert_equal 1 [r object refcount mylist]
+        assert_equal 1 [r object refcount mynewlist]
+        r del mylist
+        assert_equal $digest [r debug digest-value mynewlist]
+    }
+
+    test {COPY basic usage for intset set} {
+        r del set1 newset1 
+        r sadd set1 1 2 3
+        assert_encoding intset set1
+        r copy set1 newset1
+        set digest [r debug digest-value set1]
+        assert_equal $digest [r debug digest-value newset1]
+        assert_equal 1 [r object refcount set1]
+        assert_equal 1 [r object refcount newset1]
+        r del set1
+        assert_equal $digest [r debug digest-value newset1]
+    }
+
+    test {COPY basic usage for hashtable set} {
+        r del set2 newset2
+        r sadd set2 1 2 3 a
+        assert_encoding hashtable set2
+        r copy set2 newset2
+        set digest [r debug digest-value set2]
+        assert_equal $digest [r debug digest-value newset2]
+        assert_equal 1 [r object refcount set2]
+        assert_equal 1 [r object refcount newset2]
+        r del set2
+        assert_equal $digest [r debug digest-value newset2]
+    }
+
+    test {COPY basic usage for ziplist sorted set} {
+        r del zset1 newzset1
+        r zadd zset1 123 foobar
+        assert_encoding ziplist zset1
+        r copy zset1 newzset1
+        set digest [r debug digest-value zset1]
+        assert_equal $digest [r debug digest-value newzset1]
+        assert_equal 1 [r object refcount zset1]
+        assert_equal 1 [r object refcount newzset1]
+        r del zset1
+        assert_equal $digest [r debug digest-value newzset1]
+    }
+
+     test {COPY basic usage for skiplist sorted set} {
+        r del zset2 newzset2
+        set original_max [lindex [r config get zset-max-ziplist-entries] 1]
+        r config set zset-max-ziplist-entries 0
+        for {set j 0} {$j < 130} {incr j} {
+            r zadd zset2 [randomInt 50] ele-[randomInt 10]
+        }
+        assert_encoding skiplist zset2
+        r copy zset2 newzset2
+        set digest [r debug digest-value zset2]
+        assert_equal $digest [r debug digest-value newzset2]
+        assert_equal 1 [r object refcount zset2]
+        assert_equal 1 [r object refcount newzset2]
+        r del zset2
+        assert_equal $digest [r debug digest-value newzset2]
+        r config set zset-max-ziplist-entries $original_max
+    }
+
+    test {COPY basic usage for ziplist hash} {
+        r del hash1 newhash1
+        r hset hash1 tmp 17179869184
+        assert_encoding ziplist hash1
+        r copy hash1 newhash1
+        set digest [r debug digest-value hash1]
+        assert_equal $digest [r debug digest-value newhash1]
+        assert_equal 1 [r object refcount hash1]
+        assert_equal 1 [r object refcount newhash1]
+        r del hash1
+        assert_equal $digest [r debug digest-value newhash1]
+    }
+
+    test {COPY basic usage for hashtable hash} {
+        r del hash2 newhash2
+        set original_max [lindex [r config get hash-max-ziplist-entries] 1]
+        r config set hash-max-ziplist-entries 0
+        for {set i 0} {$i < 64} {incr i} {
+            r hset hash2 [randomValue] [randomValue]
+        }
+        assert_encoding hashtable hash2
+        r copy hash2 newhash2
+        set digest [r debug digest-value hash2]
+        assert_equal $digest [r debug digest-value newhash2]
+        assert_equal 1 [r object refcount hash2]
+        assert_equal 1 [r object refcount newhash2]
+        r del hash2
+        assert_equal $digest [r debug digest-value newhash2]
+        r config set hash-max-ziplist-entries $original_max
+    }
+
+    test {COPY basic usage for stream} {
+        r del mystream mynewstream
+        for {set i 0} {$i < 1000} {incr i} {
+            r XADD mystream * item 2 value b
+        }
+        r copy mystream mynewstream
+        set digest [r debug digest-value mystream]
+        assert_equal $digest [r debug digest-value mynewstream]
+        assert_equal 1 [r object refcount mystream]
+        assert_equal 1 [r object refcount mynewstream]
+        r del mystream
+        assert_equal $digest [r debug digest-value mynewstream]
+    }
+
+    test {COPY basic usage for stream-cgroups} {
+        r del x
+        r XADD x 100 a 1
+        set id [r XADD x 101 b 1]
+        r XADD x 102 c 1
+        r XADD x 103 e 1
+        r XADD x 104 f 1
+        r XADD x 105 g 1
+        r XGROUP CREATE x g1 0
+        r XGROUP CREATE x g2 0
+        r XREADGROUP GROUP g1 Alice COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g1 Bob COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g1 Bob NOACK COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g2 Charlie COUNT 4 STREAMS x >
+        r XGROUP SETID x g1 $id
+        r XREADGROUP GROUP g1 Dave COUNT 3 STREAMS x >
+        r XDEL x 103
+
+        r copy x newx
+        set info [r xinfo stream x full]
+        assert_equal $info [r xinfo stream newx full]
+        assert_equal 1 [r object refcount x]
+        assert_equal 1 [r object refcount newx]
+        r del x
+        assert_equal $info [r xinfo stream newx full]
+        r flushdb
+    }
+
+    test {MOVE basic usage} {
+        r set mykey foobar
+        r move mykey 10
+        set res {}
+        lappend res [r exists mykey]
+        lappend res [r dbsize]
+        r select 10
+        lappend res [r get mykey]
+        lappend res [r dbsize]
+        r select 9
+        format $res
+    } [list 0 0 foobar 1]
+
+    test {MOVE against key existing in the target DB} {
+        r set mykey hello
+        r move mykey 10
+    } {0}
+
+    test {MOVE against non-integer DB (#1428)} {
+        r set mykey hello
+        catch {r move mykey notanumber} e
+        set e
+    } {ERR value is not an integer or out of range}
+
+    test {MOVE can move key expire metadata as well} {
+        r select 10
+        r flushdb
+        r select 9
+        r set mykey foo ex 100
+        r move mykey 10
+        assert {[r ttl mykey] == -2}
+        r select 10
+        assert {[r ttl mykey] > 0 && [r ttl mykey] <= 100}
+        assert {[r get mykey] eq "foo"}
+        r select 9
+    }
+
+    test {MOVE does not create an expire if it does not exist} {
+        r select 10
+        r flushdb
+        r select 9
+        r set mykey foo
+        r move mykey 10
+        assert {[r ttl mykey] == -2}
+        r select 10
+        assert {[r ttl mykey] == -1}
+        assert {[r get mykey] eq "foo"}
+        r select 9
+    }
+
+    test {SET/GET keys in different DBs} {
+        r set a hello
+        r set b world
+        r select 10
+        r set a foo
+        r set b bared
+        r select 9
+        set res {}
+        lappend res [r get a]
+        lappend res [r get b]
+        r select 10
+        lappend res [r get a]
+        lappend res [r get b]
+        r select 9
+        format $res
+    } {hello world foo bared}
+
+    test {RANDOMKEY} {
+        r flushdb
+        r set foo x
+        r set bar y
+        set foo_seen 0
+        set bar_seen 0
+        for {set i 0} {$i < 100} {incr i} {
+            set rkey [r randomkey]
+            if {$rkey eq {foo}} {
+                set foo_seen 1
+            }
+            if {$rkey eq {bar}} {
+                set bar_seen 1
+            }
+        }
+        list $foo_seen $bar_seen
+    } {1 1}
+
+    test {RANDOMKEY against empty DB} {
+        r flushdb
+        r randomkey
+    } {}
+
+    test {RANDOMKEY regression 1} {
+        r flushdb
+        r set x 10
+        r del x
+        r randomkey
+    } {}
+
+    test {KEYS * two times with long key, Github issue #1208} {
+        r flushdb
+        r set dlskeriewrioeuwqoirueioqwrueoqwrueqw test
+        r keys *
+        r keys *
+    } {dlskeriewrioeuwqoirueioqwrueoqwrueqw}
+}
diff --git a/redis-stable/tests/unit/latency-monitor.tcl b/redis-stable/tests/unit/latency-monitor.tcl
new file mode 100644
index 00000000..9ef0c615
--- /dev/null
+++ b/redis-stable/tests/unit/latency-monitor.tcl
@@ -0,0 +1,79 @@
+start_server {tags {"latency-monitor"}} {
+    # Set a threshold high enough to avoid spurious latency events.
+    r config set latency-monitor-threshold 200
+    r latency reset
+
+    test {Test latency events logging} {
+        r debug sleep 0.3
+        after 1100
+        r debug sleep 0.4
+        after 1100
+        r debug sleep 0.5
+        assert {[r latency history command] >= 3}
+    }
+
+    test {LATENCY HISTORY output is ok} {
+        set min 250
+        set max 450
+        foreach event [r latency history command] {
+            lassign $event time latency
+            if {!$::no_latency} {
+                assert {$latency >= $min && $latency <= $max}
+            }
+            incr min 100
+            incr max 100
+            set last_time $time ; # Used in the next test
+        }
+    }
+
+    test {LATENCY LATEST output is ok} {
+        foreach event [r latency latest] {
+            lassign $event eventname time latency max
+            assert {$eventname eq "command"}
+            if {!$::no_latency} {
+                assert {$max >= 450 & $max <= 650}
+                assert {$time == $last_time}
+            }
+            break
+        }
+    }
+
+    test {LATENCY HISTORY / RESET with wrong event name is fine} {
+        assert {[llength [r latency history blabla]] == 0}
+        assert {[r latency reset blabla] == 0}
+    }
+
+    test {LATENCY DOCTOR produces some output} {
+        assert {[string length [r latency doctor]] > 0}
+    }
+
+    test {LATENCY RESET is able to reset events} {
+        assert {[r latency reset] > 0}
+        assert {[r latency latest] eq {}}
+    }
+
+    test {LATENCY of expire events are correctly collected} {
+        r config set latency-monitor-threshold 20
+        r flushdb
+        if {$::valgrind} {set count 100000} else {set count 1000000}
+        r eval {
+            local i = 0
+            while (i < tonumber(ARGV[1])) do
+                redis.call('sadd',KEYS[1],i)
+                i = i+1
+             end
+        } 1 mybigkey $count
+        r pexpire mybigkey 50
+        wait_for_condition 5 100 {
+            [r dbsize] == 0
+        } else {
+            fail "key wasn't expired"
+        }
+        assert_match {*expire-cycle*} [r latency latest]
+    }
+
+    test {LATENCY HELP should not have unexpected options} {
+        catch {r LATENCY help xxx} e
+        assert_match "*Unknown subcommand or wrong number of arguments*" $e
+    }
+}
diff --git a/redis-stable/tests/unit/lazyfree.tcl b/redis-stable/tests/unit/lazyfree.tcl
new file mode 100644
index 00000000..4e994494
--- /dev/null
+++ b/redis-stable/tests/unit/lazyfree.tcl
@@ -0,0 +1,39 @@
+start_server {tags {"lazyfree"}} {
+    test "UNLINK can reclaim memory in background" {
+        set orig_mem [s used_memory]
+        set args {}
+        for {set i 0} {$i < 100000} {incr i} {
+            lappend args $i
+        }
+        r sadd myset {*}$args
+        assert {[r scard myset] == 100000}
+        set peak_mem [s used_memory]
+        assert {[r unlink myset] == 1}
+        assert {$peak_mem > $orig_mem+1000000}
+        wait_for_condition 50 100 {
+            [s used_memory] < $peak_mem &&
+            [s used_memory] < $orig_mem*2
+        } else {
+            fail "Memory is not reclaimed by UNLINK"
+        }
+    }
+
+    test "FLUSHDB ASYNC can reclaim memory in background" {
+        set orig_mem [s used_memory]
+        set args {}
+        for {set i 0} {$i < 100000} {incr i} {
+            lappend args $i
+        }
+        r sadd myset {*}$args
+        assert {[r scard myset] == 100000}
+        set peak_mem [s used_memory]
+        r flushdb async
+        assert {$peak_mem > $orig_mem+1000000}
+        wait_for_condition 50 100 {
+            [s used_memory] < $peak_mem &&
+            [s used_memory] < $orig_mem*2
+        } else {
+            fail "Memory is not reclaimed by FLUSHDB ASYNC"
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/limits.tcl b/redis-stable/tests/unit/limits.tcl
new file mode 100644
index 00000000..51122e8f
--- /dev/null
+++ b/redis-stable/tests/unit/limits.tcl
@@ -0,0 +1,21 @@
+start_server {tags {"limits network"} overrides {maxclients 10}} {
+    if {$::tls} {
+        set expected_code "*I/O error*"
+    } else {
+        set expected_code "*ERR max*reached*"
+    }
+    test {Check if maxclients works refusing connections} {
+        set c 0
+        catch {
+            while {$c < 50} {
+                incr c
+                set rd [redis_deferring_client]
+                $rd ping
+                $rd read
+                after 100
+            }
+        } e
+        assert {$c > 8 && $c <= 10}
+        set e
+    } $expected_code
+}
diff --git a/redis-stable/tests/unit/maxmemory.tcl b/redis-stable/tests/unit/maxmemory.tcl
new file mode 100644
index 00000000..99321acf
--- /dev/null
+++ b/redis-stable/tests/unit/maxmemory.tcl
@@ -0,0 +1,326 @@
+start_server {tags {"maxmemory"}} {
+    test "Without maxmemory small integers are shared" {
+        r config set maxmemory 0
+        r set a 1
+        assert {[r object refcount a] > 1}
+    }
+
+    test "With maxmemory and non-LRU policy integers are still shared" {
+        r config set maxmemory 1073741824
+        r config set maxmemory-policy allkeys-random
+        r set a 1
+        assert {[r object refcount a] > 1}
+    }
+
+    test "With maxmemory and LRU policy integers are not shared" {
+        r config set maxmemory 1073741824
+        r config set maxmemory-policy allkeys-lru
+        r set a 1
+        r config set maxmemory-policy volatile-lru
+        r set b 1
+        assert {[r object refcount a] == 1}
+        assert {[r object refcount b] == 1}
+        r config set maxmemory 0
+    }
+
+    foreach policy {
+        allkeys-random allkeys-lru allkeys-lfu volatile-lru volatile-lfu volatile-random volatile-ttl
+    } {
+        test "maxmemory - is the memory limit honoured? (policy $policy)" {
+            # make sure to start with a blank instance
+            r flushall
+            # Get the current memory limit and calculate a new limit.
+            # We just add 100k to the current memory size so that it is
+            # fast for us to reach that limit.
+            set used [s used_memory]
+            set limit [expr {$used+100*1024}]
+            r config set maxmemory $limit
+            r config set maxmemory-policy $policy
+            # Now add keys until the limit is almost reached.
+            set numkeys 0
+            while 1 {
+                r setex [randomKey] 10000 x
+                incr numkeys
+                if {[s used_memory]+4096 > $limit} {
+                    assert {$numkeys > 10}
+                    break
+                }
+            }
+            # If we add the same number of keys already added again, we
+            # should still be under the limit.
+            for {set j 0} {$j < $numkeys} {incr j} {
+                r setex [randomKey] 10000 x
+            }
+            assert {[s used_memory] < ($limit+4096)}
+        }
+    }
+
+    foreach policy {
+        allkeys-random allkeys-lru volatile-lru volatile-random volatile-ttl
+    } {
+        test "maxmemory - only allkeys-* should remove non-volatile keys ($policy)" {
+            # make sure to start with a blank instance
+            r flushall
+            # Get the current memory limit and calculate a new limit.
+            # We just add 100k to the current memory size so that it is
+            # fast for us to reach that limit.
+            set used [s used_memory]
+            set limit [expr {$used+100*1024}]
+            r config set maxmemory $limit
+            r config set maxmemory-policy $policy
+            # Now add keys until the limit is almost reached.
+            set numkeys 0
+            while 1 {
+                r set [randomKey] x
+                incr numkeys
+                if {[s used_memory]+4096 > $limit} {
+                    assert {$numkeys > 10}
+                    break
+                }
+            }
+            # If we add the same number of keys already added again and
+            # the policy is allkeys-* we should still be under the limit.
+            # Otherwise we should see an error reported by Redis.
+            set err 0
+            for {set j 0} {$j < $numkeys} {incr j} {
+                if {[catch {r set [randomKey] x} e]} {
+                    if {[string match {*used memory*} $e]} {
+                        set err 1
+                    }
+                }
+            }
+            if {[string match allkeys-* $policy]} {
+                assert {[s used_memory] < ($limit+4096)}
+            } else {
+                assert {$err == 1}
+            }
+        }
+    }
+
+    foreach policy {
+        volatile-lru volatile-lfu volatile-random volatile-ttl
+    } {
+        test "maxmemory - policy $policy should only remove volatile keys." {
+            # make sure to start with a blank instance
+            r flushall
+            # Get the current memory limit and calculate a new limit.
+            # We just add 100k to the current memory size so that it is
+            # fast for us to reach that limit.
+            set used [s used_memory]
+            set limit [expr {$used+100*1024}]
+            r config set maxmemory $limit
+            r config set maxmemory-policy $policy
+            # Now add keys until the limit is almost reached.
+            set numkeys 0
+            while 1 {
+                # Odd keys are volatile
+                # Even keys are non volatile
+                if {$numkeys % 2} {
+                    r setex "key:$numkeys" 10000 x
+                } else {
+                    r set "key:$numkeys" x
+                }
+                if {[s used_memory]+4096 > $limit} {
+                    assert {$numkeys > 10}
+                    break
+                }
+                incr numkeys
+            }
+            # Now we add the same number of volatile keys already added.
+            # We expect Redis to evict only volatile keys in order to make
+            # space.
+            set err 0
+            for {set j 0} {$j < $numkeys} {incr j} {
+                catch {r setex "foo:$j" 10000 x}
+            }
+            # We should still be under the limit.
+            assert {[s used_memory] < ($limit+4096)}
+            # However all our non volatile keys should be here.
+            for {set j 0} {$j < $numkeys} {incr j 2} {
+                assert {[r exists "key:$j"]}
+            }
+        }
+    }
+}
+
+proc test_slave_buffers {test_name cmd_count payload_len limit_memory pipeline} {
+    start_server {tags {"maxmemory"}} {
+        start_server {} {
+        set slave_pid [s process_id]
+        test "$test_name" {
+            set slave [srv 0 client]
+            set slave_host [srv 0 host]
+            set slave_port [srv 0 port]
+            set master [srv -1 client]
+            set master_host [srv -1 host]
+            set master_port [srv -1 port]
+
+            # add 100 keys of 100k (10MB total)
+            for {set j 0} {$j < 100} {incr j} {
+                $master setrange "key:$j" 100000 asdf
+            }
+
+            # make sure master doesn't disconnect slave because of timeout
+            $master config set repl-timeout 1200 ;# 20 minutes (for valgrind and slow machines)
+            $master config set maxmemory-policy allkeys-random
+            $master config set client-output-buffer-limit "replica 100000000 100000000 300"
+            $master config set repl-backlog-size [expr {10*1024}]
+
+            $slave slaveof $master_host $master_port
+            wait_for_condition 50 100 {
+                [s 0 master_link_status] eq {up}
+            } else {
+                fail "Replication not started."
+            }
+
+            # measure used memory after the slave connected and set maxmemory
+            set orig_used [s -1 used_memory]
+            set orig_client_buf [s -1 mem_clients_normal]
+            set orig_mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
+            set orig_used_no_repl [expr {$orig_used - $orig_mem_not_counted_for_evict}]
+            set limit [expr {$orig_used - $orig_mem_not_counted_for_evict + 32*1024}]
+
+            if {$limit_memory==1} {
+                $master config set maxmemory $limit
+            }
+
+            # put the slave to sleep
+            set rd_slave [redis_deferring_client]
+            exec kill -SIGSTOP $slave_pid
+
+            # send some 10mb worth of commands that don't increase the memory usage
+            if {$pipeline == 1} {
+                set rd_master [redis_deferring_client -1]
+                for {set k 0} {$k < $cmd_count} {incr k} {
+                    $rd_master setrange key:0 0 [string repeat A $payload_len]
+                }
+                for {set k 0} {$k < $cmd_count} {incr k} {
+                    #$rd_master read
+                }
+            } else {
+                for {set k 0} {$k < $cmd_count} {incr k} {
+                    $master setrange key:0 0 [string repeat A $payload_len]
+                }
+            }
+
+            set new_used [s -1 used_memory]
+            set slave_buf [s -1 mem_clients_slaves]
+            set client_buf [s -1 mem_clients_normal]
+            set mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
+            set used_no_repl [expr {$new_used - $mem_not_counted_for_evict}]
+            set delta [expr {($used_no_repl - $client_buf) - ($orig_used_no_repl - $orig_client_buf)}]
+
+            assert {[$master dbsize] == 100}
+            assert {$slave_buf > 2*1024*1024} ;# some of the data may have been pushed to the OS buffers
+            set delta_max [expr {$cmd_count / 2}] ;# 1 byte unaccounted for, with 1M commands will consume some 1MB
+            assert {$delta < $delta_max && $delta > -$delta_max}
+
+            $master client kill type slave
+            set killed_used [s -1 used_memory]
+            set killed_slave_buf [s -1 mem_clients_slaves]
+            set killed_mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
+            set killed_used_no_repl [expr {$killed_used - $killed_mem_not_counted_for_evict}]
+            set delta_no_repl [expr {$killed_used_no_repl - $used_no_repl}]
+            assert {$killed_slave_buf == 0}
+            assert {$delta_no_repl > -$delta_max && $delta_no_repl < $delta_max}
+
+        }
+        # unfreeze slave process (after the 'test' succeeded or failed, but before we attempt to terminate the server
+        exec kill -SIGCONT $slave_pid
+        }
+    }
+}
+
+# test that slave buffer are counted correctly
+# we wanna use many small commands, and we don't wanna wait long
+# so we need to use a pipeline (redis_deferring_client)
+# that may cause query buffer to fill and induce eviction, so we disable it
+test_slave_buffers {slave buffer are counted correctly} 1000000 10 0 1
+
+# test that slave buffer don't induce eviction
+# test again with fewer (and bigger) commands without pipeline, but with eviction
+test_slave_buffers "replica buffer don't induce eviction" 100000 100 1 0
+
+start_server {tags {"maxmemory"}} {
+    test {Don't rehash if used memory exceeds maxmemory after rehash} {
+        r config set maxmemory 0
+        r config set maxmemory-policy allkeys-random
+
+        # Next rehash size is 8192, that will eat 64k memory
+        populate 4096 "" 1
+
+        set used [s used_memory]
+        set limit [expr {$used + 10*1024}]
+        r config set maxmemory $limit
+        r set k1 v1
+        # Next writing command will trigger evicting some keys if last
+        # command trigger DB dict rehash
+        r set k2 v2
+        # There must be 4098 keys because redis doesn't evict keys.
+        r dbsize
+    } {4098}
+}
+
+start_server {tags {"maxmemory"}} {
+    test {client tracking don't cause eviction feedback loop} {
+        r config set maxmemory 0
+        r config set maxmemory-policy allkeys-lru
+        r config set maxmemory-eviction-tenacity 100
+
+        # 10 clients listening on tracking messages
+        set clients {}
+        for {set j 0} {$j < 10} {incr j} {
+            lappend clients [redis_deferring_client]
+        }
+        foreach rd $clients {
+            $rd HELLO 3
+            $rd read ; # Consume the HELLO reply
+            $rd CLIENT TRACKING on
+            $rd read ; # Consume the CLIENT reply
+        }
+
+        # populate 300 keys, with long key name and short value
+        for {set j 0} {$j < 300} {incr j} {
+            set key $j[string repeat x 1000]
+            r set $key x
+
+            # for each key, enable caching for this key
+            foreach rd $clients {
+                $rd get $key
+                $rd read
+            }
+        }
+
+        # we need to wait one second for the client querybuf excess memory to be
+        # trimmed by cron, otherwise the INFO used_memory and CONFIG maxmemory
+        # below (on slow machines) won't be "atomic" and won't trigger eviction.
+        after 1100
+
+        # set the memory limit which will cause a few keys to be evicted
+        # we need to make sure to evict keynames of a total size of more than
+        # 16kb since the (PROTO_REPLY_CHUNK_BYTES), only after that the
+        # invalidation messages have a chance to trigger further eviction.
+        set used [s used_memory]
+        set limit [expr {$used - 40000}]
+        r config set maxmemory $limit
+
+        # make sure some eviction happened
+        set evicted [s evicted_keys]
+        if {$::verbose} { puts "evicted: $evicted" }
+
+        # make sure we didn't drain the database
+        assert_range [r dbsize] 200 300
+
+        assert_range $evicted 10 50
+        foreach rd $clients {
+            $rd read ;# make sure we have some invalidation message waiting
+            $rd close
+        }
+
+        # eviction continues (known problem described in #8069)
+        # for now this test only make sures the eviction loop itself doesn't
+        # have feedback loop
+        set evicted [s evicted_keys]
+        if {$::verbose} { puts "evicted: $evicted" }
+    }
+}
diff --git a/redis-stable/tests/unit/memefficiency.tcl b/redis-stable/tests/unit/memefficiency.tcl
new file mode 100644
index 00000000..88fcd6f5
--- /dev/null
+++ b/redis-stable/tests/unit/memefficiency.tcl
@@ -0,0 +1,496 @@
+proc test_memory_efficiency {range} {
+    r flushall
+    set rd [redis_deferring_client]
+    set base_mem [s used_memory]
+    set written 0
+    for {set j 0} {$j < 10000} {incr j} {
+        set key key:$j
+        set val [string repeat A [expr {int(rand()*$range)}]]
+        $rd set $key $val
+        incr written [string length $key]
+        incr written [string length $val]
+        incr written 2 ;# A separator is the minimum to store key-value data.
+    }
+    for {set j 0} {$j < 10000} {incr j} {
+        $rd read ; # Discard replies
+    }
+
+    set current_mem [s used_memory]
+    set used [expr {$current_mem-$base_mem}]
+    set efficiency [expr {double($written)/$used}]
+    return $efficiency
+}
+
+start_server {tags {"memefficiency"}} {
+    foreach {size_range expected_min_efficiency} {
+        32    0.15
+        64    0.25
+        128   0.35
+        1024  0.75
+        16384 0.82
+    } {
+        test "Memory efficiency with values in range $size_range" {
+            set efficiency [test_memory_efficiency $size_range]
+            assert {$efficiency >= $expected_min_efficiency}
+        }
+    }
+}
+
+run_solo {defrag} {
+start_server {tags {"defrag"} overrides {appendonly yes auto-aof-rewrite-percentage 0 save ""}} {
+    if {[string match {*jemalloc*} [s mem_allocator]] && [r debug mallctl arenas.page] <= 8192} {
+        test "Active defrag" {
+            r config set hz 100
+            r config set activedefrag no
+            r config set active-defrag-threshold-lower 5
+            r config set active-defrag-cycle-min 65
+            r config set active-defrag-cycle-max 75
+            r config set active-defrag-ignore-bytes 2mb
+            r config set maxmemory 100mb
+            r config set maxmemory-policy allkeys-lru
+
+            populate 700000 asdf1 150
+            populate 170000 asdf2 300
+            after 120 ;# serverCron only updates the info once in 100ms
+            set frag [s allocator_frag_ratio]
+            if {$::verbose} {
+                puts "frag $frag"
+            }
+            assert {$frag >= 1.4}
+
+            r config set latency-monitor-threshold 5
+            r latency reset
+            r config set maxmemory 110mb ;# prevent further eviction (not to fail the digest test)
+            set digest [r debug digest]
+            catch {r config set activedefrag yes} e
+            if {[r config get activedefrag] eq "activedefrag yes"} {
+                # Wait for the active defrag to start working (decision once a
+                # second).
+                wait_for_condition 50 100 {
+                    [s active_defrag_running] ne 0
+                } else {
+                    fail "defrag not started."
+                }
+
+                # Wait for the active defrag to stop working.
+                wait_for_condition 150 100 {
+                    [s active_defrag_running] eq 0
+                } else {
+                    after 120 ;# serverCron only updates the info once in 100ms
+                    puts [r info memory]
+                    puts [r memory malloc-stats]
+                    fail "defrag didn't stop."
+                }
+
+                # Test the the fragmentation is lower.
+                after 120 ;# serverCron only updates the info once in 100ms
+                set frag [s allocator_frag_ratio]
+                set max_latency 0
+                foreach event [r latency latest] {
+                    lassign $event eventname time latency max
+                    if {$eventname == "active-defrag-cycle"} {
+                        set max_latency $max
+                    }
+                }
+                if {$::verbose} {
+                    puts "frag $frag"
+                    set misses [s active_defrag_misses]
+                    set hits [s active_defrag_hits]
+                    puts "hits: $hits"
+                    puts "misses: $misses"
+                    puts "max latency $max_latency"
+                    puts [r latency latest]
+                    puts [r latency history active-defrag-cycle]
+                }
+                assert {$frag < 1.1}
+                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
+                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
+                if {!$::no_latency} {
+                    assert {$max_latency <= 30}
+                }
+            }
+            # verify the data isn't corrupted or changed
+            set newdigest [r debug digest]
+            assert {$digest eq $newdigest}
+            r save ;# saving an rdb iterates over all the data / pointers
+
+            # if defrag is supported, test AOF loading too
+            if {[r config get activedefrag] eq "activedefrag yes"} {
+                # reset stats and load the AOF file
+                r config resetstat
+                r config set key-load-delay -50 ;# sleep on average 1/50 usec
+                r debug loadaof
+                r config set activedefrag no
+                # measure hits and misses right after aof loading
+                set misses [s active_defrag_misses]
+                set hits [s active_defrag_hits]
+
+                after 120 ;# serverCron only updates the info once in 100ms
+                set frag [s allocator_frag_ratio]
+                set max_latency 0
+                foreach event [r latency latest] {
+                    lassign $event eventname time latency max
+                    if {$eventname == "loading-cron"} {
+                        set max_latency $max
+                    }
+                }
+                if {$::verbose} {
+                    puts "AOF loading:"
+                    puts "frag $frag"
+                    puts "hits: $hits"
+                    puts "misses: $misses"
+                    puts "max latency $max_latency"
+                    puts [r latency latest]
+                    puts [r latency history loading-cron]
+                }
+                # make sure we had defrag hits during AOF loading
+                assert {$hits > 100000}
+                # make sure the defragger did enough work to keep the fragmentation low during loading.
+                # we cannot check that it went all the way down, since we don't wait for full defrag cycle to complete.
+                assert {$frag < 1.4}
+                # since the AOF contains simple (fast) SET commands (and the cron during loading runs every 1000 commands),
+                # it'll still not block the loading for long periods of time.
+                if {!$::no_latency} {
+                    assert {$max_latency <= 30}
+                }
+            }
+        }
+        r config set appendonly no
+        r config set key-load-delay 0
+
+        test "Active defrag big keys" {
+            r flushdb
+            r config resetstat
+            r config set hz 100
+            r config set activedefrag no
+            r config set active-defrag-max-scan-fields 1000
+            r config set active-defrag-threshold-lower 5
+            r config set active-defrag-cycle-min 65
+            r config set active-defrag-cycle-max 75
+            r config set active-defrag-ignore-bytes 2mb
+            r config set maxmemory 0
+            r config set list-max-ziplist-size 5 ;# list of 10k items will have 2000 quicklist nodes
+            r config set stream-node-max-entries 5
+            r hmset hash h1 v1 h2 v2 h3 v3
+            r lpush list a b c d
+            r zadd zset 0 a 1 b 2 c 3 d
+            r sadd set a b c d
+            r xadd stream * item 1 value a
+            r xadd stream * item 2 value b
+            r xgroup create stream mygroup 0
+            r xreadgroup GROUP mygroup Alice COUNT 1 STREAMS stream >
+
+            # create big keys with 10k items
+            set rd [redis_deferring_client]
+            for {set j 0} {$j < 10000} {incr j} {
+                $rd hset bighash $j [concat "asdfasdfasdf" $j]
+                $rd lpush biglist [concat "asdfasdfasdf" $j]
+                $rd zadd bigzset $j [concat "asdfasdfasdf" $j]
+                $rd sadd bigset [concat "asdfasdfasdf" $j]
+                $rd xadd bigstream * item 1 value a
+            }
+            for {set j 0} {$j < 50000} {incr j} {
+                $rd read ; # Discard replies
+            }
+
+            set expected_frag 1.7
+            if {$::accurate} {
+                # scale the hash to 1m fields in order to have a measurable the latency
+                for {set j 10000} {$j < 1000000} {incr j} {
+                    $rd hset bighash $j [concat "asdfasdfasdf" $j]
+                }
+                for {set j 10000} {$j < 1000000} {incr j} {
+                    $rd read ; # Discard replies
+                }
+                # creating that big hash, increased used_memory, so the relative frag goes down
+                set expected_frag 1.3
+            }
+
+            # add a mass of string keys
+            for {set j 0} {$j < 500000} {incr j} {
+                $rd setrange $j 150 a
+            }
+            for {set j 0} {$j < 500000} {incr j} {
+                $rd read ; # Discard replies
+            }
+            assert_equal [r dbsize] 500010
+
+            # create some fragmentation
+            for {set j 0} {$j < 500000} {incr j 2} {
+                $rd del $j
+            }
+            for {set j 0} {$j < 500000} {incr j 2} {
+                $rd read ; # Discard replies
+            }
+            assert_equal [r dbsize] 250010
+
+            # start defrag
+            after 120 ;# serverCron only updates the info once in 100ms
+            set frag [s allocator_frag_ratio]
+            if {$::verbose} {
+                puts "frag $frag"
+            }
+            assert {$frag >= $expected_frag}
+            r config set latency-monitor-threshold 5
+            r latency reset
+
+            set digest [r debug digest]
+            catch {r config set activedefrag yes} e
+            if {[r config get activedefrag] eq "activedefrag yes"} {
+                # wait for the active defrag to start working (decision once a second)
+                wait_for_condition 50 100 {
+                    [s active_defrag_running] ne 0
+                } else {
+                    fail "defrag not started."
+                }
+
+                # wait for the active defrag to stop working
+                wait_for_condition 500 100 {
+                    [s active_defrag_running] eq 0
+                } else {
+                    after 120 ;# serverCron only updates the info once in 100ms
+                    puts [r info memory]
+                    puts [r memory malloc-stats]
+                    fail "defrag didn't stop."
+                }
+
+                # test the the fragmentation is lower
+                after 120 ;# serverCron only updates the info once in 100ms
+                set frag [s allocator_frag_ratio]
+                set max_latency 0
+                foreach event [r latency latest] {
+                    lassign $event eventname time latency max
+                    if {$eventname == "active-defrag-cycle"} {
+                        set max_latency $max
+                    }
+                }
+                if {$::verbose} {
+                    puts "frag $frag"
+                    set misses [s active_defrag_misses]
+                    set hits [s active_defrag_hits]
+                    puts "hits: $hits"
+                    puts "misses: $misses"
+                    puts "max latency $max_latency"
+                    puts [r latency latest]
+                    puts [r latency history active-defrag-cycle]
+                }
+                assert {$frag < 1.1}
+                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
+                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
+                if {!$::no_latency} {
+                    assert {$max_latency <= 30}
+                }
+            }
+            # verify the data isn't corrupted or changed
+            set newdigest [r debug digest]
+            assert {$digest eq $newdigest}
+            r save ;# saving an rdb iterates over all the data / pointers
+        } {OK}
+
+        test "Active defrag big list" {
+            r flushdb
+            r config resetstat
+            r config set hz 100
+            r config set activedefrag no
+            r config set active-defrag-max-scan-fields 1000
+            r config set active-defrag-threshold-lower 5
+            r config set active-defrag-cycle-min 65
+            r config set active-defrag-cycle-max 75
+            r config set active-defrag-ignore-bytes 2mb
+            r config set maxmemory 0
+            r config set list-max-ziplist-size 5 ;# list of 500k items will have 100k quicklist nodes
+
+            # create big keys with 10k items
+            set rd [redis_deferring_client]
+
+            set expected_frag 1.7
+            # add a mass of list nodes to two lists (allocations are interlaced)
+            set val [string repeat A 100] ;# 5 items of 100 bytes puts us in the 640 bytes bin, which has 32 regs, so high potential for fragmentation
+            set elements 500000
+            for {set j 0} {$j < $elements} {incr j} {
+                $rd lpush biglist1 $val
+                $rd lpush biglist2 $val
+            }
+            for {set j 0} {$j < $elements} {incr j} {
+                $rd read ; # Discard replies
+                $rd read ; # Discard replies
+            }
+
+            # create some fragmentation
+            r del biglist2
+
+            # start defrag
+            after 120 ;# serverCron only updates the info once in 100ms
+            set frag [s allocator_frag_ratio]
+            if {$::verbose} {
+                puts "frag $frag"
+            }
+
+            assert {$frag >= $expected_frag}
+            r config set latency-monitor-threshold 5
+            r latency reset
+
+            set digest [r debug digest]
+            catch {r config set activedefrag yes} e
+            if {[r config get activedefrag] eq "activedefrag yes"} {
+                # wait for the active defrag to start working (decision once a second)
+                wait_for_condition 50 100 {
+                    [s active_defrag_running] ne 0
+                } else {
+                    fail "defrag not started."
+                }
+
+                # wait for the active defrag to stop working
+                wait_for_condition 500 100 {
+                    [s active_defrag_running] eq 0
+                } else {
+                    after 120 ;# serverCron only updates the info once in 100ms
+                    puts [r info memory]
+                    puts [r info stats]
+                    puts [r memory malloc-stats]
+                    fail "defrag didn't stop."
+                }
+
+                # test the the fragmentation is lower
+                after 120 ;# serverCron only updates the info once in 100ms
+                set misses [s active_defrag_misses]
+                set hits [s active_defrag_hits]
+                set frag [s allocator_frag_ratio]
+                set max_latency 0
+                foreach event [r latency latest] {
+                    lassign $event eventname time latency max
+                    if {$eventname == "active-defrag-cycle"} {
+                        set max_latency $max
+                    }
+                }
+                if {$::verbose} {
+                    puts "frag $frag"
+                    puts "misses: $misses"
+                    puts "hits: $hits"
+                    puts "max latency $max_latency"
+                    puts [r latency latest]
+                    puts [r latency history active-defrag-cycle]
+                }
+                assert {$frag < 1.1}
+                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
+                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
+                if {!$::no_latency} {
+                    assert {$max_latency <= 30}
+                }
+
+                # in extreme cases of stagnation, we see over 20m misses before the tests aborts with "defrag didn't stop",
+                # in normal cases we only see 100k misses out of 500k elements
+                assert {$misses < $elements}
+            }
+            # verify the data isn't corrupted or changed
+            set newdigest [r debug digest]
+            assert {$digest eq $newdigest}
+            r save ;# saving an rdb iterates over all the data / pointers
+            r del biglist1 ;# coverage for quicklistBookmarksClear
+        } {1}
+
+        test "Active defrag edge case" {
+            # there was an edge case in defrag where all the slabs of a certain bin are exact the same
+            # % utilization, with the exception of the current slab from which new allocations are made
+            # if the current slab is lower in utilization the defragger would have ended up in stagnation,
+            # keept running and not move any allocation.
+            # this test is more consistent on a fresh server with no history
+            start_server {tags {"defrag"} overrides {save ""}} {
+                r flushdb
+                r config resetstat
+                r config set hz 100
+                r config set activedefrag no
+                r config set active-defrag-max-scan-fields 1000
+                r config set active-defrag-threshold-lower 5
+                r config set active-defrag-cycle-min 65
+                r config set active-defrag-cycle-max 75
+                r config set active-defrag-ignore-bytes 1mb
+                r config set maxmemory 0
+                set expected_frag 1.3
+
+                r debug mallctl-str thread.tcache.flush VOID
+                # fill the first slab containin 32 regs of 640 bytes.
+                for {set j 0} {$j < 32} {incr j} {
+                    r setrange "_$j" 600 x
+                    r debug mallctl-str thread.tcache.flush VOID
+                }
+
+                # add a mass of keys with 600 bytes values, fill the bin of 640 bytes which has 32 regs per slab.
+                set rd [redis_deferring_client]
+                set keys 640000
+                for {set j 0} {$j < $keys} {incr j} {
+                    $rd setrange $j 600 x
+                }
+                for {set j 0} {$j < $keys} {incr j} {
+                    $rd read ; # Discard replies
+                }
+
+                # create some fragmentation of 50%
+                set sent 0
+                for {set j 0} {$j < $keys} {incr j 1} {
+                    $rd del $j
+                    incr sent
+                    incr j 1
+                }
+                for {set j 0} {$j < $sent} {incr j} {
+                    $rd read ; # Discard replies
+                }
+
+                # create higher fragmentation in the first slab
+                for {set j 10} {$j < 32} {incr j} {
+                    r del "_$j"
+                }
+
+                # start defrag
+                after 120 ;# serverCron only updates the info once in 100ms
+                set frag [s allocator_frag_ratio]
+                if {$::verbose} {
+                    puts "frag $frag"
+                }
+
+                assert {$frag >= $expected_frag}
+
+                set digest [r debug digest]
+                catch {r config set activedefrag yes} e
+                if {[r config get activedefrag] eq "activedefrag yes"} {
+                    # wait for the active defrag to start working (decision once a second)
+                    wait_for_condition 50 100 {
+                        [s active_defrag_running] ne 0
+                    } else {
+                        fail "defrag not started."
+                    }
+
+                    # wait for the active defrag to stop working
+                    wait_for_condition 500 100 {
+                        [s active_defrag_running] eq 0
+                    } else {
+                        after 120 ;# serverCron only updates the info once in 100ms
+                        puts [r info memory]
+                        puts [r info stats]
+                        puts [r memory malloc-stats]
+                        fail "defrag didn't stop."
+                    }
+
+                    # test the the fragmentation is lower
+                    after 120 ;# serverCron only updates the info once in 100ms
+                    set misses [s active_defrag_misses]
+                    set hits [s active_defrag_hits]
+                    set frag [s allocator_frag_ratio]
+                    if {$::verbose} {
+                        puts "frag $frag"
+                        puts "hits: $hits"
+                        puts "misses: $misses"
+                    }
+                    assert {$frag < 1.1}
+                    assert {$misses < 10000000} ;# when defrag doesn't stop, we have some 30m misses, when it does, we have 2m misses
+                }
+
+                # verify the data isn't corrupted or changed
+                set newdigest [r debug digest]
+                assert {$digest eq $newdigest}
+                r save ;# saving an rdb iterates over all the data / pointers
+            }
+        }
+    }
+}
+} ;# run_solo
diff --git a/redis-stable/tests/unit/moduleapi/auth.tcl b/redis-stable/tests/unit/moduleapi/auth.tcl
new file mode 100644
index 00000000..04a90a49
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/auth.tcl
@@ -0,0 +1,71 @@
+set testmodule [file normalize tests/modules/auth.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Modules can create a user that can be authenticated} {
+        # Make sure we start authenticated with default user
+        r auth default ""
+        assert_equal [r acl whoami] "default"
+        r auth.createmoduleuser
+
+        set id [r auth.authmoduleuser]
+        assert_equal [r client id] $id
+
+        # Verify returned id is the same as our current id and
+        # we are authenticated with the specified user
+        assert_equal [r acl whoami] "global"
+    }
+
+    test {De-authenticating clients is tracked and kills clients} {
+        assert_equal [r auth.changecount] 0
+        r auth.createmoduleuser
+
+        # Catch the I/O exception that was thrown when Redis
+        # disconnected with us. 
+        catch { [r ping] } e
+        assert_match {*I/O*} $e
+
+        # Check that a user change was registered
+        assert_equal [r auth.changecount] 1
+    }
+
+    test {Modules cant authenticate with ACLs users that dont exist} {
+        catch { [r auth.authrealuser auth-module-test-fake] } e
+        assert_match {*Invalid user*} $e
+    }
+
+    test {Modules can authenticate with ACL users} {
+        assert_equal [r acl whoami] "default"
+
+        # Create user to auth into
+        r acl setuser auth-module-test on allkeys allcommands
+
+        set id [r auth.authrealuser auth-module-test]
+
+        # Verify returned id is the same as our current id and
+        # we are authenticated with the specified user
+        assert_equal [r client id] $id
+        assert_equal [r acl whoami] "auth-module-test"
+    }
+
+    test {Client callback is called on user switch} {
+        assert_equal [r auth.changecount] 0
+
+        # Auth again and validate change count
+        r auth.authrealuser auth-module-test
+        assert_equal [r auth.changecount] 1
+
+        # Re-auth with the default user
+        r auth default ""
+        assert_equal [r auth.changecount] 1
+        assert_equal [r acl whoami] "default"
+
+        # Re-auth with the default user again, to
+        # verify the callback isn't fired again
+        r auth default ""
+        assert_equal [r auth.changecount] 0
+        assert_equal [r acl whoami] "default"
+    }
+
+}
\ No newline at end of file
diff --git a/redis-stable/tests/unit/moduleapi/basics.tcl b/redis-stable/tests/unit/moduleapi/basics.tcl
new file mode 100644
index 00000000..96683f4c
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/basics.tcl
@@ -0,0 +1,12 @@
+set testmodule [file normalize tests/modules/basics.so]
+
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {test module api basics} {
+        r test.basics
+    } {ALL TESTS PASSED}
+
+    r module unload test
+}
diff --git a/redis-stable/tests/unit/moduleapi/blockedclient.tcl b/redis-stable/tests/unit/moduleapi/blockedclient.tcl
new file mode 100644
index 00000000..0598a84d
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/blockedclient.tcl
@@ -0,0 +1,93 @@
+# source tests/support/util.tcl
+
+set testmodule [file normalize tests/modules/blockedclient.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Locked GIL acquisition} {
+        assert_match "OK" [r acquire_gil]
+    }
+
+    test {Locked GIL acquisition during multi} {
+    	r multi
+    	r acquire_gil
+    	assert_equal {{Blocked client is not supported inside multi}} [r exec]
+    }
+
+    test {Locked GIL acquisition from RM_Call} {
+    	assert_equal {Blocked client is not allowed} [r do_rm_call acquire_gil]
+    }
+
+    test {Blocking command are not block the client on RM_Call} {
+    	r lpush l test
+    	assert_equal [r do_rm_call blpop l 0] {l test}
+    	
+    	r lpush l test
+    	assert_equal [r do_rm_call brpop l 0] {l test}
+    	
+    	r lpush l1 test
+    	assert_equal [r do_rm_call brpoplpush l1 l2 0] {test}
+    	assert_equal [r do_rm_call brpop l2 0] {l2 test}
+
+    	r lpush l1 test
+    	assert_equal [r do_rm_call blmove l1 l2 LEFT LEFT 0] {test}
+    	assert_equal [r do_rm_call brpop l2 0] {l2 test}
+
+    	r ZADD zset1 0 a 1 b 2 c
+    	assert_equal [r do_rm_call bzpopmin zset1 0] {zset1 a 0}
+    	assert_equal [r do_rm_call bzpopmax zset1 0] {zset1 c 2}
+
+    	r xgroup create s g $ MKSTREAM
+    	r xadd s * foo bar
+    	assert {[r do_rm_call xread BLOCK 0 STREAMS s 0-0] ne {}}
+    	assert {[r do_rm_call xreadgroup group g c BLOCK 0 STREAMS s >] ne {}}
+
+    	assert {[r do_rm_call blpop empty_list 0] eq {}}
+        assert {[r do_rm_call brpop empty_list 0] eq {}}
+        assert {[r do_rm_call brpoplpush empty_list1 empty_list2 0] eq {}}
+        assert {[r do_rm_call blmove empty_list1 empty_list2 LEFT LEFT 0] eq {}}
+        
+        assert {[r do_rm_call bzpopmin empty_zset 0] eq {}}
+        assert {[r do_rm_call bzpopmax empty_zset 0] eq {}}
+       
+        r xgroup create empty_stream g $ MKSTREAM
+        assert {[r do_rm_call xread BLOCK 0 STREAMS empty_stream $] eq {}}
+        assert {[r do_rm_call xreadgroup group g c BLOCK 0 STREAMS empty_stream >] eq {}}
+
+    }
+
+    test {Monitor disallow inside RM_Call} {
+        set e {}
+        catch {
+            r do_rm_call monitor
+        } e
+        set e
+    } {*ERR*DENY BLOCKING*}
+
+    test {subscribe disallow inside RM_Call} {
+        set e {}
+        catch {
+            r do_rm_call subscribe x
+        } e
+        set e
+    } {*ERR*DENY BLOCKING*}
+
+    test {RM_Call from blocked client} {
+        r hset hash foo bar
+        r do_bg_rm_call hgetall hash
+    } {foo bar}
+
+    test {blocked client reaches client output buffer limit} {
+        r hset hash big [string repeat x 50000]
+        r hset hash bada [string repeat x 50000]
+        r hset hash boom [string repeat x 50000]
+        r config set client-output-buffer-limit {normal 100000 0 0}
+        r client setname myclient
+        catch {r do_bg_rm_call hgetall hash} e
+        assert_match "*I/O error*" $e
+        reconnect
+        set clients [r client list]
+        assert_no_match "*name=myclient*" $clients
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/blockonbackground.tcl b/redis-stable/tests/unit/moduleapi/blockonbackground.tcl
new file mode 100644
index 00000000..79ca5214
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/blockonbackground.tcl
@@ -0,0 +1,117 @@
+set testmodule [file normalize tests/modules/blockonbackground.so]
+
+source tests/support/util.tcl
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test { blocked clients time tracking - check blocked command that uses RedisModule_BlockedClientMeasureTimeStart() is tracking background time} {
+        r slowlog reset
+        r config set slowlog-log-slower-than 200000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r block.debug 0 10000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r config resetstat
+        r block.debug 200 10000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 1
+        }
+
+        set cmdstatline [cmdrstat block.debug r]
+
+        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
+        assert {$usec >= 100000}
+        assert {$usec_per_call >= 100000}
+    }
+
+    test { blocked clients time tracking - check blocked command that uses RedisModule_BlockedClientMeasureTimeStart() is tracking background time even in timeout } {
+        r slowlog reset
+        r config set slowlog-log-slower-than 200000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r block.debug 0 20000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r config resetstat
+        r block.debug 20000 500
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 1
+        }
+
+        set cmdstatline [cmdrstat block.debug r]
+
+        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
+        assert {$usec >= 250000}
+        assert {$usec_per_call >= 250000}
+    }
+
+    test { blocked clients time tracking - check blocked command with multiple calls RedisModule_BlockedClientMeasureTimeStart()  is tracking the total background time } {
+        r slowlog reset
+        r config set slowlog-log-slower-than 200000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r block.double_debug 0
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r config resetstat
+        r block.double_debug 100
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 1
+        }
+        set cmdstatline [cmdrstat block.double_debug r]
+
+        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
+        assert {$usec >= 60000}
+        assert {$usec_per_call >= 60000}
+    }
+
+    test { blocked clients time tracking - check blocked command without calling RedisModule_BlockedClientMeasureTimeStart() is not reporting background time } {
+        r slowlog reset
+        r config set slowlog-log-slower-than 200000
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+        r block.debug_no_track 200 1000
+        # ensure slowlog is still empty
+        if {!$::no_latency} {
+            assert_equal [r slowlog len] 0
+        }
+    }
+
+    test "client unblock works only for modules with timeout support" {
+        set rd [redis_deferring_client]
+        $rd client id
+        set id [$rd read]
+
+        # Block with a timeout function - may unblock
+        $rd block.block 20000
+        wait_for_condition 50 100 {
+            [r block.is_blocked] == 1
+        } else {
+            fail "Module did not block"
+        }
+
+        assert_equal 1 [r client unblock $id]
+        assert_match {*Timed out*} [$rd read]
+
+        # Block without a timeout function - cannot unblock
+        $rd block.block 0
+        wait_for_condition 50 100 {
+            [r block.is_blocked] == 1
+        } else {
+            fail "Module did not block"
+        }
+
+        assert_equal 0 [r client unblock $id]
+        assert_equal "OK" [r block.release foobar]
+        assert_equal "foobar" [$rd read]
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/blockonkeys.tcl b/redis-stable/tests/unit/moduleapi/blockonkeys.tcl
new file mode 100644
index 00000000..75191b3c
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/blockonkeys.tcl
@@ -0,0 +1,239 @@
+set testmodule [file normalize tests/modules/blockonkeys.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test "Module client blocked on keys: Circular BPOPPUSH" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+
+        r del src dst
+
+        $rd1 fsl.bpoppush src dst 0
+        $rd2 fsl.bpoppush dst src 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {2}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        r fsl.push src 42
+
+        assert_equal {42} [r fsl.getall src]
+        assert_equal {} [r fsl.getall dst]
+    }
+
+    test "Module client blocked on keys: Self-referential BPOPPUSH" {
+        set rd1 [redis_deferring_client]
+
+        r del src
+
+        $rd1 fsl.bpoppush src src 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r fsl.push src 42
+
+        assert_equal {42} [r fsl.getall src]
+    }
+
+    test {Module client blocked on keys (no metadata): No block} {
+        r del k
+        r fsl.push k 33
+        r fsl.push k 34
+        r fsl.bpop k 0
+    } {34}
+
+    test {Module client blocked on keys (no metadata): Timeout} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd fsl.bpop k 1
+        assert_equal {Request timedout} [$rd read]
+    }
+
+    test {Module client blocked on keys (no metadata): Blocked} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd fsl.bpop k 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r fsl.push k 34
+        assert_equal {34} [$rd read]
+    }
+
+    test {Module client blocked on keys (with metadata): No block} {
+        r del k
+        r fsl.push k 34
+        r fsl.bpopgt k 30 0
+    } {34}
+
+    test {Module client blocked on keys (with metadata): Timeout} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd client id
+        set cid [$rd read]
+        r fsl.push k 33
+        $rd fsl.bpopgt k 35 1
+        assert_equal {Request timedout} [$rd read]
+        r client kill id $cid ;# try to smoke-out client-related memory leak
+    }
+
+    test {Module client blocked on keys (with metadata): Blocked, case 1} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd client id
+        set cid [$rd read]
+        r fsl.push k 33
+        $rd fsl.bpopgt k 33 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r fsl.push k 34
+        assert_equal {34} [$rd read]
+        r client kill id $cid ;# try to smoke-out client-related memory leak
+    }
+
+    test {Module client blocked on keys (with metadata): Blocked, case 2} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd fsl.bpopgt k 35 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r fsl.push k 33
+        r fsl.push k 34
+        r fsl.push k 35
+        r fsl.push k 36
+        assert_equal {36} [$rd read]
+    }
+
+    test {Module client blocked on keys (with metadata): Blocked, CLIENT KILL} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd client id
+        set cid [$rd read]
+        $rd fsl.bpopgt k 35 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client kill id $cid ;# try to smoke-out client-related memory leak
+    }
+
+    test {Module client blocked on keys (with metadata): Blocked, CLIENT UNBLOCK TIMEOUT} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd client id
+        set cid [$rd read]
+        $rd fsl.bpopgt k 35 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client unblock $cid timeout ;# try to smoke-out client-related memory leak
+        assert_equal {Request timedout} [$rd read]
+    }
+
+    test {Module client blocked on keys (with metadata): Blocked, CLIENT UNBLOCK ERROR} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd client id
+        set cid [$rd read]
+        $rd fsl.bpopgt k 35 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client unblock $cid error ;# try to smoke-out client-related memory leak
+        assert_error "*unblocked*" {$rd read}
+    }
+
+    test {Module client re-blocked on keys after woke up on wrong type} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd fsl.bpop k 0
+        ;# wait until clients are actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r lpush k 12
+        r lpush k 13
+        r lpush k 14
+        r del k
+        r fsl.push k 34
+        assert_equal {34} [$rd read]
+        assert_equal {1} [r get fsl_wrong_type] ;# first lpush caused one wrong-type wake-up
+    }
+
+    test {Module client blocked on keys woken up by LPUSH} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd blockonkeys.popall k
+        # wait until client is actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Client is not blocked"
+        }
+        r lpush k 42 squirrel banana
+        assert_equal {banana squirrel 42} [$rd read]
+        $rd close
+    }
+
+    test {Module client unblocks BLPOP} {
+        r del k
+        set rd [redis_deferring_client]
+        $rd blpop k 3
+        # wait until client is actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Client is not blocked"
+        }
+        r blockonkeys.lpush k 42
+        assert_equal {k 42} [$rd read]
+        $rd close
+    }
+
+    test {Module unblocks module blocked on non-empty list} {
+        r del k
+        r lpush k aa
+        # Module client blocks to pop 5 elements from list
+        set rd [redis_deferring_client]
+        $rd blockonkeys.blpopn k 5
+        # Wait until client is actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Client is not blocked"
+        }
+        # Check that RM_SignalKeyAsReady() can wake up BLPOPN
+        r blockonkeys.lpush_unblock k bb cc ;# Not enough elements for BLPOPN
+        r lpush k dd ee ff                  ;# Doesn't unblock module
+        r blockonkeys.lpush_unblock k gg    ;# Unblocks module
+        assert_equal {gg ff ee dd cc} [$rd read]
+        $rd close
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/commandfilter.tcl b/redis-stable/tests/unit/moduleapi/commandfilter.tcl
new file mode 100644
index 00000000..6078f64f
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/commandfilter.tcl
@@ -0,0 +1,84 @@
+set testmodule [file normalize tests/modules/commandfilter.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule log-key 0
+
+    test {Command Filter handles redirected commands} {
+        r set mykey @log
+        r lrange log-key 0 -1
+    } "{set mykey @log}"
+
+    test {Command Filter can call RedisModule_CommandFilterArgDelete} {
+        r rpush mylist elem1 @delme elem2
+        r lrange mylist 0 -1
+    } {elem1 elem2}
+
+    test {Command Filter can call RedisModule_CommandFilterArgInsert} {
+        r del mylist
+        r rpush mylist elem1 @insertbefore elem2 @insertafter elem3
+        r lrange mylist 0 -1
+    } {elem1 --inserted-before-- @insertbefore elem2 @insertafter --inserted-after-- elem3}
+
+    test {Command Filter can call RedisModule_CommandFilterArgReplace} {
+        r del mylist
+        r rpush mylist elem1 @replaceme elem2
+        r lrange mylist 0 -1
+    } {elem1 --replaced-- elem2}
+
+    test {Command Filter applies on RM_Call() commands} {
+        r del log-key
+        r commandfilter.ping
+        r lrange log-key 0 -1
+    } "{ping @log}"
+
+    test {Command Filter applies on Lua redis.call()} {
+        r del log-key
+        r eval "redis.call('ping', '@log')" 0
+        r lrange log-key 0 -1
+    } "{ping @log}"
+
+    test {Command Filter applies on Lua redis.call() that calls a module} {
+        r del log-key
+        r eval "redis.call('commandfilter.ping')" 0
+        r lrange log-key 0 -1
+    } "{ping @log}"
+
+    test {Command Filter is unregistered implicitly on module unload} {
+        r del log-key
+        r module unload commandfilter
+        r set mykey @log
+        r lrange log-key 0 -1
+    } {}
+
+    r module load $testmodule log-key 0
+
+    test {Command Filter unregister works as expected} {
+        # Validate reloading succeeded
+        r del log-key
+        r set mykey @log
+        assert_equal "{set mykey @log}" [r lrange log-key 0 -1]
+
+        # Unregister
+        r commandfilter.unregister
+        r del log-key
+
+        r set mykey @log
+        r lrange log-key 0 -1
+    } {}
+
+    r module unload commandfilter
+    r module load $testmodule log-key 1
+
+    test {Command Filter REDISMODULE_CMDFILTER_NOSELF works as expected} {
+        r set mykey @log
+        assert_equal "{set mykey @log}" [r lrange log-key 0 -1]
+
+        r del log-key
+        r commandfilter.ping
+        assert_equal {} [r lrange log-key 0 -1]
+
+        r eval "redis.call('commandfilter.ping')" 0
+        assert_equal {} [r lrange log-key 0 -1]
+    }
+
+} 
diff --git a/redis-stable/tests/unit/moduleapi/datatype.tcl b/redis-stable/tests/unit/moduleapi/datatype.tcl
new file mode 100644
index 00000000..cd6ebb32
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/datatype.tcl
@@ -0,0 +1,58 @@
+set testmodule [file normalize tests/modules/datatype.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {DataType: Test module is sane, GET/SET work.} {
+        r datatype.set dtkey 100 stringval
+        assert {[r datatype.get dtkey] eq {100 stringval}}
+    }
+
+    test {DataType: RM_SaveDataTypeToString(), RM_LoadDataTypeFromString() work} {
+        r datatype.set dtkey -1111 MyString
+        set encoded [r datatype.dump dtkey]
+
+        r datatype.restore dtkeycopy $encoded
+        assert {[r datatype.get dtkeycopy] eq {-1111 MyString}}
+    }
+
+    test {DataType: Handle truncated RM_LoadDataTypeFromString()} {
+        r datatype.set dtkey -1111 MyString
+        set encoded [r datatype.dump dtkey]
+        set truncated [string range $encoded 0 end-1]
+
+        catch {r datatype.restore dtkeycopy $truncated} e
+        set e
+    } {*Invalid*}
+
+    test {DataType: ModuleTypeReplaceValue() happy path works} {
+        r datatype.set key-a 1 AAA
+        r datatype.set key-b 2 BBB
+
+        assert {[r datatype.swap key-a key-b] eq {OK}}
+        assert {[r datatype.get key-a] eq {2 BBB}}
+        assert {[r datatype.get key-b] eq {1 AAA}}
+    }
+
+    test {DataType: ModuleTypeReplaceValue() fails on non-module keys} {
+        r datatype.set key-a 1 AAA
+        r set key-b RedisString
+
+        catch {r datatype.swap key-a key-b} e
+        set e
+    } {*ERR*}
+
+    test {DataType: Copy command works for modules} {
+        # Test failed copies
+        r datatype.set answer-to-universe 42 AAA
+        catch {r copy answer-to-universe answer2} e
+        assert_match {*module key failed to copy*} $e
+
+        # Our module's data type copy function copies the int value as-is
+        # but appends /<from-key>/<to-key> to the string value so we can
+        # track passed arguments.
+        r datatype.set sourcekey 1234 AAA
+        r copy sourcekey targetkey
+        r datatype.get targetkey
+    } {1234 AAA/sourcekey/targetkey}
+}
diff --git a/redis-stable/tests/unit/moduleapi/defrag.tcl b/redis-stable/tests/unit/moduleapi/defrag.tcl
new file mode 100644
index 00000000..b2e23967
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/defrag.tcl
@@ -0,0 +1,46 @@
+set testmodule [file normalize tests/modules/defragtest.so]
+
+start_server {tags {"modules"} overrides {{save ""}}} {
+    r module load $testmodule 10000
+    r config set hz 100
+    r config set active-defrag-ignore-bytes 1
+    r config set active-defrag-threshold-lower 0
+    r config set active-defrag-cycle-min 99
+
+    # try to enable active defrag, it will fail if redis was compiled without it
+    catch {r config set activedefrag yes} e
+    if {[r config get activedefrag] eq "activedefrag yes"} {
+
+        test {Module defrag: simple key defrag works} {
+            r frag.create key1 1 1000 0
+
+            after 2000
+            set info [r info defragtest_stats]
+            assert {[getInfoProperty $info defragtest_datatype_attempts] > 0}
+            assert_equal 0 [getInfoProperty $info defragtest_datatype_resumes]
+        }
+
+        test {Module defrag: late defrag with cursor works} {
+            r flushdb
+            r frag.resetstats
+
+            # key can only be defragged in no less than 10 iterations
+            # due to maxstep
+            r frag.create key2 10000 100 1000
+
+            after 2000
+            set info [r info defragtest_stats]
+            assert {[getInfoProperty $info defragtest_datatype_resumes] > 10}
+            assert_equal 0 [getInfoProperty $info defragtest_datatype_wrong_cursor]
+        }
+
+        test {Module defrag: global defrag works} {
+            r flushdb
+            r frag.resetstats
+
+            after 2000
+            set info [r info defragtest_stats]
+            assert {[getInfoProperty $info defragtest_global_attempts] > 0}
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/fork.tcl b/redis-stable/tests/unit/moduleapi/fork.tcl
new file mode 100644
index 00000000..8535a338
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/fork.tcl
@@ -0,0 +1,31 @@
+set testmodule [file normalize tests/modules/fork.so]
+
+proc count_log_message {pattern} {
+    set result [exec grep -c $pattern < [srv 0 stdout]]
+}
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Module fork} {
+        # the argument to fork.create is the exitcode on termination
+        r fork.create 3
+        wait_for_condition 20 100 {
+            [r fork.exitcode] != -1
+        } else {
+            fail "fork didn't terminate"
+        }
+        r fork.exitcode
+    } {3}
+
+    test {Module fork kill} {
+        r fork.create 3
+        after 250
+        r fork.kill
+
+        assert {[count_log_message "fork child started"] eq "2"}
+        assert {[count_log_message "Received SIGUSR1 in child"] eq "1"}
+        assert {[count_log_message "fork child exiting"] eq "1"}
+    }
+
+}
diff --git a/redis-stable/tests/unit/moduleapi/getkeys.tcl b/redis-stable/tests/unit/moduleapi/getkeys.tcl
new file mode 100644
index 00000000..a24a65ba
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/getkeys.tcl
@@ -0,0 +1,44 @@
+set testmodule [file normalize tests/modules/getkeys.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {COMMAND INFO correctly reports a movable keys module command} {
+        set info [lindex [r command info getkeys.command] 0]
+
+        assert_equal {movablekeys} [lindex $info 2]
+        assert_equal {0} [lindex $info 3]
+        assert_equal {0} [lindex $info 4]
+        assert_equal {0} [lindex $info 5]
+    }
+
+    test {COMMAND GETKEYS correctly reports a movable keys module command} {
+        r command getkeys getkeys.command arg1 arg2 key key1 arg3 key key2 key key3
+    } {key1 key2 key3}
+
+    test {RM_GetCommandKeys on non-existing command} {
+        catch {r getkeys.introspect non-command key1 key2} e
+        set _ $e
+    } {*ENOENT*}
+
+    test {RM_GetCommandKeys on built-in fixed keys command} {
+        r getkeys.introspect set key1 value1
+    } {key1}
+
+    test {RM_GetCommandKeys on EVAL} {
+        r getkeys.introspect eval "" 4 key1 key2 key3 key4 arg1 arg2
+    } {key1 key2 key3 key4}
+
+    test {RM_GetCommandKeys on a movable keys module command} {
+        r getkeys.introspect getkeys.command arg1 arg2 key key1 arg3 key key2 key key3
+    } {key1 key2 key3}
+
+    test {RM_GetCommandKeys on a non-movable module command} {
+        r getkeys.introspect getkeys.fixed arg1 key1 key2 key3 arg2
+    } {key1 key2 key3}
+
+    test {RM_GetCommandKeys with bad arity} {
+        catch {r getkeys.introspect set key} e
+        set _ $e
+    } {*EINVAL*}
+}
diff --git a/redis-stable/tests/unit/moduleapi/hash.tcl b/redis-stable/tests/unit/moduleapi/hash.tcl
new file mode 100644
index 00000000..89bb6c63
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/hash.tcl
@@ -0,0 +1,23 @@
+set testmodule [file normalize tests/modules/hash.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Module hash set} {
+        r set k mystring
+        assert_error "WRONGTYPE*" {r hash.set k "" hello world}
+        r del k
+        # "" = count updates and deletes of existing fields only
+        assert_equal 0 [r hash.set k "" squirrel yes]
+        # "a" = COUNT_ALL = count inserted, modified and deleted fields
+        assert_equal 2 [r hash.set k "a" banana no sushi whynot]
+        # "n" = NX = only add fields not already existing in the hash
+        # "x" = XX = only replace the value for existing fields
+        assert_equal 0 [r hash.set k "n" squirrel hoho what nothing]
+        assert_equal 1 [r hash.set k "na" squirrel hoho something nice]
+        assert_equal 0 [r hash.set k "xa" new stuff not inserted]
+        assert_equal 1 [r hash.set k "x" squirrel ofcourse]
+        assert_equal 1 [r hash.set k "" sushi :delete: none :delete:]
+        r hgetall k
+    } {squirrel ofcourse banana no what nothing something nice}
+}
diff --git a/redis-stable/tests/unit/moduleapi/hooks.tcl b/redis-stable/tests/unit/moduleapi/hooks.tcl
new file mode 100644
index 00000000..c4af59bd
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/hooks.tcl
@@ -0,0 +1,163 @@
+set testmodule [file normalize tests/modules/hooks.so]
+
+tags "modules" {
+    start_server [list overrides [list loadmodule "$testmodule" appendonly yes]] {
+
+        test {Test clients connection / disconnection hooks} {
+            for {set j 0} {$j < 2} {incr j} {
+                set rd1 [redis_deferring_client]
+                $rd1 close
+            }
+            assert {[r hooks.event_count client-connected] > 1}
+            assert {[r hooks.event_count client-disconnected] > 1}
+        }
+
+        test {Test module cron hook} {
+            after 100
+            assert {[r hooks.event_count cron-loop] > 0}
+            set hz [r hooks.event_last cron-loop]
+            assert_equal $hz 10
+        }
+
+        test {Test module loaded / unloaded hooks} {
+            set othermodule [file normalize tests/modules/infotest.so]
+            r module load $othermodule
+            r module unload infotest
+            assert_equal [r hooks.event_last module-loaded] "infotest"
+            assert_equal [r hooks.event_last module-unloaded] "infotest"
+        }
+
+        test {Test module aofrw hook} {
+            r debug populate 1000 foo 10000 ;# 10mb worth of data
+            r config set rdbcompression no ;# rdb progress is only checked once in 2mb
+            r BGREWRITEAOF
+            waitForBgrewriteaof r
+            assert_equal [string match {*module-event-persistence-aof-start*} [exec tail -20 < [srv 0 stdout]]] 1
+            assert_equal [string match {*module-event-persistence-end*} [exec tail -20 < [srv 0 stdout]]] 1
+        }
+
+        test {Test module aof load and rdb/aof progress hooks} {
+            # create some aof tail (progress is checked only once in 1000 commands)
+            for {set j 0} {$j < 4000} {incr j} {
+                r set "bar$j" x
+            }
+            # set some configs that will cause many loading progress events during aof loading
+            r config set key-load-delay 500
+            r config set dynamic-hz no
+            r config set hz 500
+            r DEBUG LOADAOF
+            assert_equal [r hooks.event_last loading-aof-start] 0
+            assert_equal [r hooks.event_last loading-end] 0
+            assert {[r hooks.event_count loading-rdb-start] == 0}
+            assert_lessthan 2 [r hooks.event_count loading-progress-rdb] ;# comes from the preamble section
+            assert_lessthan 2 [r hooks.event_count loading-progress-aof]
+            if {$::verbose} {
+                puts "rdb progress events [r hooks.event_count loading-progress-rdb]"
+                puts "aof progress events [r hooks.event_count loading-progress-aof]"
+            }
+        }
+        # undo configs before next test
+        r config set dynamic-hz yes
+        r config set key-load-delay 0
+
+        test {Test module rdb save hook} {
+            # debug reload does: save, flush, load:
+            assert {[r hooks.event_count persistence-syncrdb-start] == 0}
+            assert {[r hooks.event_count loading-rdb-start] == 0}
+            r debug reload
+            assert {[r hooks.event_count persistence-syncrdb-start] == 1}
+            assert {[r hooks.event_count loading-rdb-start] == 1}
+        }
+
+        test {Test flushdb hooks} {
+            r flushdb
+            assert_equal [r hooks.event_last flush-start] 9
+            assert_equal [r hooks.event_last flush-end] 9
+            r flushall
+            assert_equal [r hooks.event_last flush-start] -1
+            assert_equal [r hooks.event_last flush-end] -1
+        }
+
+        # replication related tests
+        set master [srv 0 client]
+        set master_host [srv 0 host]
+        set master_port [srv 0 port]
+        start_server {} {
+            r module load $testmodule
+            set replica [srv 0 client]
+            set replica_host [srv 0 host]
+            set replica_port [srv 0 port]
+            $replica replicaof $master_host $master_port
+
+            wait_for_condition 50 100 {
+                [string match {*master_link_status:up*} [r info replication]]
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+
+            test {Test master link up hook} {
+                assert_equal [r hooks.event_count masterlink-up] 1
+                assert_equal [r hooks.event_count masterlink-down] 0
+            }
+
+            test {Test role-replica hook} {
+                assert_equal [r hooks.event_count role-replica] 1
+                assert_equal [r hooks.event_count role-master] 0
+                assert_equal [r hooks.event_last role-replica] [s 0 master_host]
+            }
+
+            test {Test replica-online hook} {
+                assert_equal [r -1 hooks.event_count replica-online] 1
+                assert_equal [r -1 hooks.event_count replica-offline] 0
+            }
+
+            test {Test master link down hook} {
+                r client kill type master
+                assert_equal [r hooks.event_count masterlink-down] 1
+
+                wait_for_condition 50 100 {
+                    [string match {*master_link_status:up*} [r info replication]]
+                } else {
+                    fail "Replica didn't reconnect"
+                }
+
+                assert_equal [r hooks.event_count masterlink-down] 1
+                assert_equal [r hooks.event_count masterlink-up] 2
+            }
+
+            wait_for_condition 50 10 {
+                [string match {*master_link_status:up*} [r info replication]]
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+
+            $replica replicaof no one
+
+            test {Test role-master hook} {
+                assert_equal [r hooks.event_count role-replica] 1
+                assert_equal [r hooks.event_count role-master] 1
+                assert_equal [r hooks.event_last role-master] {}
+            }
+
+            test {Test replica-offline hook} {
+                assert_equal [r -1 hooks.event_count replica-online] 2
+                assert_equal [r -1 hooks.event_count replica-offline] 2
+            }
+            # get the replica stdout, to be used by the next test
+            set replica_stdout [srv 0 stdout]
+        }
+
+        test {Test swapdb hooks} {
+            r swapdb 0 10
+            assert_equal [r hooks.event_last swapdb-first] 0
+            assert_equal [r hooks.event_last swapdb-second] 10
+
+        }
+
+        # look into the log file of the server that just exited
+        test {Test shutdown hook} {
+            assert_equal [string match {*module-event-shutdown*} [exec tail -5 < $replica_stdout]] 1
+        }
+
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/infotest.tcl b/redis-stable/tests/unit/moduleapi/infotest.tcl
new file mode 100644
index 00000000..1ad2ee6f
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/infotest.tcl
@@ -0,0 +1,94 @@
+set testmodule [file normalize tests/modules/infotest.so]
+
+# Return value for INFO property
+proc field {info property} {
+    if {[regexp "\r\n$property:(.*?)\r\n" $info _ value]} {
+        set _ $value
+    }
+}
+
+start_server {tags {"modules"}} {
+    r module load $testmodule log-key 0
+
+    test {module reading info} {
+        # check string, integer and float fields
+        assert_equal [r info.gets replication role] "master"
+        assert_equal [r info.getc replication role] "master"
+        assert_equal [r info.geti stats expired_keys] 0
+        assert_equal [r info.getd stats expired_stale_perc] 0
+
+        # check signed and unsigned
+        assert_equal [r info.geti infotest infotest_global] -2
+        assert_equal [r info.getu infotest infotest_uglobal] -2
+
+        # the above are always 0, try module info that is non-zero
+        assert_equal [r info.geti infotest_italian infotest_due] 2
+        set tre [r info.getd infotest_italian infotest_tre]
+        assert {$tre > 3.2 && $tre < 3.4 }
+
+        # search using the wrong section
+        catch { [r info.gets badname redis_version] } e
+        assert_match {*not found*} $e
+
+        # check that section filter works
+        assert { [string match "*usec_per_call*" [r info.gets all cmdstat_info.gets] ] }
+        catch { [r info.gets default cmdstat_info.gets] ] } e
+        assert_match {*not found*} $e
+    }
+
+    test {module info all} {
+        set info [r info all]
+        # info all does not contain modules
+        assert { ![string match "*Spanish*" $info] }
+        assert { ![string match "*infotest_*" $info] }
+        assert { [string match "*used_memory*" $info] }
+    }
+
+    test {module info everything} {
+        set info [r info everything]
+        # info everything contains all default sections, but not ones for crash report
+        assert { [string match "*infotest_global*" $info] }
+        assert { [string match "*Spanish*" $info] }
+        assert { [string match "*Italian*" $info] }
+        assert { [string match "*used_memory*" $info] }
+        assert { ![string match "*Klingon*" $info] }
+        field $info infotest_dos
+    } {2}
+
+    test {module info modules} {
+        set info [r info modules]
+        # info all does not contain modules
+        assert { [string match "*Spanish*" $info] }
+        assert { [string match "*infotest_global*" $info] }
+        assert { ![string match "*used_memory*" $info] }
+    }
+
+    test {module info one module} {
+        set info [r info INFOTEST]
+        # info all does not contain modules
+        assert { [string match "*Spanish*" $info] }
+        assert { ![string match "*used_memory*" $info] }
+        field $info infotest_global
+    } {-2}
+
+    test {module info one section} {
+        set info [r info INFOTEST_SPANISH]
+        assert { ![string match "*used_memory*" $info] }
+        assert { ![string match "*Italian*" $info] }
+        assert { ![string match "*infotest_global*" $info] }
+        field $info infotest_uno
+    } {one}
+
+    test {module info dict} {
+        set info [r info infotest_keyspace]
+        set keyspace [field $info infotest_db0]
+        set keys [scan [regexp -inline {keys\=([\d]*)} $keyspace] keys=%d]
+    } {3}
+
+    test {module info unsafe fields} {
+        set info [r info infotest_unsafe]
+        assert_match {*infotest_unsafe_field:value=1*} $info
+    }
+
+    # TODO: test crash report.
+} 
diff --git a/redis-stable/tests/unit/moduleapi/keyspace_events.tcl b/redis-stable/tests/unit/moduleapi/keyspace_events.tcl
new file mode 100644
index 00000000..60800bbf
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/keyspace_events.tcl
@@ -0,0 +1,86 @@
+set testmodule [file normalize tests/modules/keyspace_events.so]
+
+tags "modules" {
+    start_server [list overrides [list loadmodule "$testmodule"]] {
+
+        test {Test loaded key space event} {
+            r set x 1
+            r hset y f v
+            r lpush z 1 2 3
+            r sadd p 1 2 3
+            r zadd t 1 f1 2 f2
+            r xadd s * f v
+            r debug reload
+            assert_equal {1 x} [r keyspace.is_key_loaded x]
+            assert_equal {1 y} [r keyspace.is_key_loaded y]
+            assert_equal {1 z} [r keyspace.is_key_loaded z]
+            assert_equal {1 p} [r keyspace.is_key_loaded p]
+            assert_equal {1 t} [r keyspace.is_key_loaded t]
+            assert_equal {1 s} [r keyspace.is_key_loaded s]
+        }
+
+        test {Nested multi due to RM_Call} {
+            r del multi
+            r del lua
+
+            r set x 1
+            r set x_copy 1
+            r keyspace.del_key_copy x
+            r keyspace.incr_case1 x
+            r keyspace.incr_case2 x
+            r keyspace.incr_case3 x
+            assert_equal {} [r get multi]
+            assert_equal {} [r get lua]
+            r get x
+        } {3}
+        
+        test {Nested multi due to RM_Call, with client MULTI} {
+            r del multi
+            r del lua
+
+            r set x 1
+            r set x_copy 1
+            r multi
+            r keyspace.del_key_copy x
+            r keyspace.incr_case1 x
+            r keyspace.incr_case2 x
+            r keyspace.incr_case3 x
+            r exec
+            assert_equal {1} [r get multi]
+            assert_equal {} [r get lua]
+            r get x
+        } {3}
+        
+        test {Nested multi due to RM_Call, with EVAL} {
+            r del multi
+            r del lua
+
+            r set x 1
+            r set x_copy 1
+            r eval {
+                redis.pcall('keyspace.del_key_copy', KEYS[1])
+                redis.pcall('keyspace.incr_case1', KEYS[1])
+                redis.pcall('keyspace.incr_case2', KEYS[1])
+                redis.pcall('keyspace.incr_case3', KEYS[1])
+            } 1 x
+            assert_equal {} [r get multi]
+            assert_equal {1} [r get lua]
+            r get x
+        } {3}
+
+        test {Test module key space event} {
+            r keyspace.notify x
+            assert_equal {1 x} [r keyspace.is_module_key_notified x]
+        }
+
+        test "Keyspace notifications: module events test" {
+            r config set notify-keyspace-events Kd
+            r del x
+            set rd1 [redis_deferring_client]
+            assert_equal {1} [psubscribe $rd1 *]
+            r keyspace.notify x
+            assert_equal {pmessage * __keyspace@9__:x notify} [$rd1 read]
+            $rd1 close
+        }
+	}
+}
diff --git a/redis-stable/tests/unit/moduleapi/misc.tcl b/redis-stable/tests/unit/moduleapi/misc.tcl
new file mode 100644
index 00000000..a6a7a78f
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/misc.tcl
@@ -0,0 +1,118 @@
+set testmodule [file normalize tests/modules/misc.so]
+
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {test RM_Call} {
+        set info [r test.call_info commandstats]
+        # cmdstat is not in a default section, so we also test an argument was passed
+        assert { [string match "*cmdstat_module*" $info] }
+    }
+
+    test {test RM_Call args array} {
+        set info [r test.call_generic info commandstats]
+        # cmdstat is not in a default section, so we also test an argument was passed
+        assert { [string match "*cmdstat_module*" $info] }
+    }
+
+    test {test RM_Call recursive} {
+        set info [r test.call_generic test.call_generic info commandstats]
+        assert { [string match "*cmdstat_module*" $info] }
+    }
+
+    test {test redis version} {
+        set version [s redis_version]
+        assert_equal $version [r test.redisversion]
+    }
+
+    test {test long double conversions} {
+        set ld [r test.ld_conversion]
+        assert {[string match $ld "0.00000000000000001"]}
+    }
+
+    test {test module db commands} {
+        r set x foo
+        set key [r test.randomkey]
+        assert_equal $key "x"
+        assert_equal [r test.dbsize] 1
+        r test.flushall
+        assert_equal [r test.dbsize] 0
+    }
+
+    test {test modle lru api} {
+        r config set maxmemory-policy allkeys-lru
+        r set x foo
+        set lru [r test.getlru x]
+        assert { $lru <= 1000 }
+        set was_set [r test.setlru x 100000]
+        assert { $was_set == 1 }
+        set idle [r object idletime x]
+        assert { $idle >= 100 }
+        set lru [r test.getlru x]
+        assert { $lru >= 100000 }
+        r config set maxmemory-policy allkeys-lfu
+        set lru [r test.getlru x]
+        assert { $lru == -1 }
+        set was_set [r test.setlru x 100000]
+        assert { $was_set == 0 }
+    }
+    r config set maxmemory-policy allkeys-lru
+
+    test {test modle lfu api} {
+        r config set maxmemory-policy allkeys-lfu
+        r set x foo
+        set lfu [r test.getlfu x]
+        assert { $lfu >= 1 }
+        set was_set [r test.setlfu x 100]
+        assert { $was_set == 1 }
+        set freq [r object freq x]
+        assert { $freq <= 100 }
+        set lfu [r test.getlfu x]
+        assert { $lfu <= 100 }
+        r config set maxmemory-policy allkeys-lru
+        set lfu [r test.getlfu x]
+        assert { $lfu == -1 }
+        set was_set [r test.setlfu x 100]
+        assert { $was_set == 0 }
+    }
+
+    test {test module clientinfo api} {
+        # Test basic sanity and SSL flag
+        set info [r test.clientinfo]
+        set ssl_flag [expr $::tls ? {"ssl:"} : {":"}]
+
+        assert { [dict get $info db] == 9 }
+        assert { [dict get $info flags] == "${ssl_flag}::::" }
+
+        # Test MULTI flag
+        r multi
+        r test.clientinfo
+        set info [lindex [r exec] 0]
+        assert { [dict get $info flags] == "${ssl_flag}::::multi" }
+
+        # Test TRACKING flag
+        r client tracking on
+        set info [r test.clientinfo]
+        assert { [dict get $info flags] == "${ssl_flag}::tracking::" }
+    }
+
+    test {test module getclientcert api} {
+        set cert [r test.getclientcert]
+
+        if {$::tls} {
+            assert {$cert != ""}
+        } else {
+            assert {$cert == ""}
+        }
+    }
+
+    test {test detached thread safe cnotext} {
+        r test.log_tsctx "info" "Test message"
+        verify_log_message 0 "*<misc> Test message*" 0
+    }
+
+    test {test RM_Call CLIENT INFO} {
+        assert_match "*fd=-1*" [r test.call_generic client info]
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/propagate.tcl b/redis-stable/tests/unit/moduleapi/propagate.tcl
new file mode 100644
index 00000000..a8c71007
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/propagate.tcl
@@ -0,0 +1,268 @@
+set testmodule [file normalize tests/modules/propagate.so]
+
+tags "modules" {
+    test {Modules can propagate in async and threaded contexts} {
+        start_server [list overrides [list loadmodule "$testmodule"]] {
+            set replica [srv 0 client]
+            set replica_host [srv 0 host]
+            set replica_port [srv 0 port]
+            start_server [list overrides [list loadmodule "$testmodule"]] {
+                set master [srv 0 client]
+                set master_host [srv 0 host]
+                set master_port [srv 0 port]
+
+                # Start the replication process...
+                $replica replicaof $master_host $master_port
+                wait_for_sync $replica
+                after 1000
+
+                test {module propagates from timer} {
+                    set repl [attach_to_replication_stream]
+
+                    $master propagate-test.timer
+
+                    wait_for_condition 5000 10 {
+                        [$replica get timer] eq "3"
+                    } else {
+                        fail "The two counters don't match the expected value."
+                    }
+
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr timer}
+                        {exec}
+                        {multi}
+                        {incr timer}
+                        {exec}
+                        {multi}
+                        {incr timer}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates nested ctx case1} {
+                    set repl [attach_to_replication_stream]
+
+                    $master del timer-nested-start
+                    $master del timer-nested-end
+                    $master propagate-test.timer-nested
+
+                    wait_for_condition 5000 10 {
+                        [$replica get timer-nested-end] eq "1"
+                    } else {
+                        fail "The two counters don't match the expected value."
+                    }
+
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incrby timer-nested-start 1}
+                        {incrby timer-nested-end 1}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates nested ctx case2} {
+                    set repl [attach_to_replication_stream]
+
+                    $master del timer-nested-start
+                    $master del timer-nested-end
+                    $master propagate-test.timer-nested-repl
+
+                    wait_for_condition 5000 10 {
+                        [$replica get timer-nested-end] eq "1"
+                    } else {
+                        fail "The two counters don't match the expected value."
+                    }
+
+                    # Note the 'after-call' and 'timer-nested-start' propagation below is out of order (known limitation)
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr using-call}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {incr after-call}
+                        {incr counter-3}
+                        {incr counter-4}
+                        {incrby timer-nested-start 1}
+                        {incrby timer-nested-end 1}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates from thread} {
+                    set repl [attach_to_replication_stream]
+
+                    $master propagate-test.thread
+
+                    wait_for_condition 5000 10 {
+                        [$replica get a-from-thread] eq "3"
+                    } else {
+                        fail "The two counters don't match the expected value."
+                    }
+
+                    assert_replication_stream $repl {
+                        {select *}
+                        {incr a-from-thread}
+                        {incr b-from-thread}
+                        {incr a-from-thread}
+                        {incr b-from-thread}
+                        {incr a-from-thread}
+                        {incr b-from-thread}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates from from command} {
+                    set repl [attach_to_replication_stream]
+
+                    $master propagate-test.simple
+                    $master propagate-test.mixed
+
+                    # Note the 'after-call' propagation below is out of order (known limitation)
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                        {multi}
+                        {incr using-call}
+                        {incr after-call}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates from from command after good EVAL} {
+                    set repl [attach_to_replication_stream]
+
+                    assert_equal [ $master eval { return "hello" } 0 ] {hello}
+                    $master propagate-test.simple
+                    $master propagate-test.mixed
+
+                    # Note the 'after-call' propagation below is out of order (known limitation)
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                        {multi}
+                        {incr using-call}
+                        {incr after-call}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates from from command after bad EVAL} {
+                    set repl [attach_to_replication_stream]
+
+                    catch { $master eval { return "hello" } -12 } e
+                    assert_equal $e {ERR Number of keys can't be negative}
+                    $master propagate-test.simple
+                    $master propagate-test.mixed
+
+                    # Note the 'after-call' propagation below is out of order (known limitation)
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                        {multi}
+                        {incr using-call}
+                        {incr after-call}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module propagates from from multi-exec} {
+                    set repl [attach_to_replication_stream]
+
+                    $master multi
+                    $master propagate-test.simple
+                    $master propagate-test.mixed
+                    $master exec
+                    wait_for_ofs_sync $master $replica
+
+                    # Note the 'after-call' propagation below is out of order (known limitation)
+                    assert_replication_stream $repl {
+                        {select *}
+                        {multi}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {incr using-call}
+                        {incr after-call}
+                        {incr counter-1}
+                        {incr counter-2}
+                        {exec}
+                    }
+                    close_replication_stream $repl
+                }
+
+                test {module RM_Call of expired key propagation} {
+                    $master debug set-active-expire 0
+
+                    $master set k1 900 px 100
+                    wait_for_ofs_sync $master $replica
+                    after 110
+
+                    set repl [attach_to_replication_stream]
+                    $master propagate-test.incr k1
+                    wait_for_ofs_sync $master $replica
+
+                    assert_replication_stream $repl {
+                        {select *}
+                        {del k1}
+                        {propagate-test.incr k1}
+                    }
+                    close_replication_stream $repl
+
+                    assert_equal [$master get k1] 1
+                    assert_equal [$master ttl k1] -1
+                    assert_equal [$replica get k1] 1
+                    assert_equal [$replica ttl k1] -1
+                }
+
+                assert_equal [s -1 unexpected_error_replies] 0
+            }
+        }
+    }
+}
+
+tags "modules aof" {
+    test {Modules RM_Replicate replicates MULTI/EXEC correctly} {
+        start_server [list overrides [list loadmodule "$testmodule"]] {
+            # Enable the AOF
+            r config set appendonly yes
+            r config set auto-aof-rewrite-percentage 0 ; # Disable auto-rewrite.
+            waitForBgrewriteaof r
+
+            r propagate-test.simple
+            r propagate-test.mixed
+            r multi
+            r propagate-test.simple
+            r propagate-test.mixed
+            r exec
+
+            # Load the AOF
+            r debug loadaof
+
+            assert_equal [s 0 unexpected_error_replies] 0
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/scan.tcl b/redis-stable/tests/unit/moduleapi/scan.tcl
new file mode 100644
index 00000000..43a0c4d8
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/scan.tcl
@@ -0,0 +1,52 @@
+set testmodule [file normalize tests/modules/scan.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Module scan keyspace} {
+        # the module create a scan command with filtering which also return values
+        r set x 1
+        r set y 2
+        r set z 3
+        r hset h f v
+        lsort [r scan.scan_strings]
+    } {{x 1} {y 2} {z 3}}
+
+    test {Module scan hash ziplist} {
+        r hmset hh f1 v1 f2 v2
+        lsort [r scan.scan_key hh]
+    } {{f1 v1} {f2 v2}}
+    
+    test {Module scan hash dict with int value} {
+        r hmset hh1 f1 1 
+        lsort [r scan.scan_key hh1]
+    } {{f1 1}}
+
+    test {Module scan hash dict} {
+        r config set hash-max-ziplist-entries 2
+        r hmset hh f3 v3
+        lsort [r scan.scan_key hh]
+    } {{f1 v1} {f2 v2} {f3 v3}}
+
+    test {Module scan zset ziplist} {
+        r zadd zz 1 f1 2 f2
+        lsort [r scan.scan_key zz]
+    } {{f1 1} {f2 2}}
+
+    test {Module scan zset dict} {
+        r config set zset-max-ziplist-entries 2
+        r zadd zz 3 f3
+        lsort [r scan.scan_key zz]
+    } {{f1 1} {f2 2} {f3 3}}
+
+    test {Module scan set intset} {
+        r sadd ss 1 2
+        lsort [r scan.scan_key ss]
+    } {{1 {}} {2 {}}}
+
+    test {Module scan set dict} {
+        r config set set-max-intset-entries 2
+        r sadd ss 3
+        lsort [r scan.scan_key ss]
+    } {{1 {}} {2 {}} {3 {}}}
+}
diff --git a/redis-stable/tests/unit/moduleapi/stream.tcl b/redis-stable/tests/unit/moduleapi/stream.tcl
new file mode 100644
index 00000000..15e97c18
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/stream.tcl
@@ -0,0 +1,155 @@
+set testmodule [file normalize tests/modules/stream.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Module stream add and delete} {
+        r del mystream
+        # add to empty key
+        set streamid1 [r stream.add mystream item 1 value a]
+        # add to existing stream
+        set streamid2 [r stream.add mystream item 2 value b]
+        # check result
+        assert { [string match "*-*" $streamid1] }
+        set items [r XRANGE mystream - +]
+        assert_equal $items \
+            "{$streamid1 {item 1 value a}} {$streamid2 {item 2 value b}}"
+        # delete one of them and try deleting non-existing ID
+        assert_equal OK [r stream.delete mystream $streamid1]
+        assert_error "ERR StreamDelete*" {r stream.delete mystream 123-456}
+        assert_error "Invalid stream ID*" {r stream.delete mystream foo}
+        assert_equal "{$streamid2 {item 2 value b}}" [r XRANGE mystream - +]
+        # check error condition: wrong type
+        r del mystream
+        r set mystream mystring
+        assert_error "ERR StreamAdd*" {r stream.add mystream item 1 value a}
+        assert_error "ERR StreamDelete*" {r stream.delete mystream 123-456}
+    }
+
+    test {Module stream add unblocks blocking xread} {
+        r del mystream
+
+        # Blocking XREAD on an empty key
+        set rd1 [redis_deferring_client]
+        $rd1 XREAD BLOCK 3000 STREAMS mystream $
+        # wait until client is actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Client is not blocked"
+        }
+        set id [r stream.add mystream field 1 value a]
+        assert_equal "{mystream {{$id {field 1 value a}}}}" [$rd1 read]
+
+        # Blocking XREAD on an existing stream
+        set rd2 [redis_deferring_client]
+        $rd2 XREAD BLOCK 3000 STREAMS mystream $
+        # wait until client is actually blocked
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Client is not blocked"
+        }
+        set id [r stream.add mystream field 2 value b]
+        assert_equal "{mystream {{$id {field 2 value b}}}}" [$rd2 read]
+    }
+
+    test {Module stream add benchmark (1M stream add)} {
+        set n 1000000
+        r del mystream
+        set result [r stream.addn mystream $n field value]
+        assert_equal $result $n
+    }
+
+    test {Module stream iterator} {
+        r del mystream
+        set streamid1 [r xadd mystream * item 1 value a]
+        set streamid2 [r xadd mystream * item 2 value b]
+        # range result
+        set result1 [r stream.range mystream "-" "+"]
+        set expect1 [r xrange mystream "-" "+"]
+        assert_equal $result1 $expect1
+        # reverse range
+        set result_rev [r stream.range mystream "+" "-"]
+        set expect_rev [r xrevrange mystream "+" "-"]
+        assert_equal $result_rev $expect_rev
+
+        # only one item: range with startid = endid
+        set result2 [r stream.range mystream "-" $streamid1]
+        assert_equal $result2 "{$streamid1 {item 1 value a}}"
+        assert_equal $result2 [list [list $streamid1 {item 1 value a}]]
+        # only one item: range with startid = endid
+        set result3 [r stream.range mystream $streamid2 $streamid2]
+        assert_equal $result3 "{$streamid2 {item 2 value b}}"
+        assert_equal $result3 [list [list $streamid2 {item 2 value b}]]
+    }
+
+    test {Module stream iterator delete} {
+        r del mystream
+        set id1 [r xadd mystream * normal item]
+        set id2 [r xadd mystream * selfdestruct yes]
+        set id3 [r xadd mystream * another item]
+        # stream.range deletes the "selfdestruct" item after returning it
+        assert_equal \
+            "{$id1 {normal item}} {$id2 {selfdestruct yes}} {$id3 {another item}}" \
+            [r stream.range mystream - +]
+        # now, the "selfdestruct" item is gone
+        assert_equal \
+            "{$id1 {normal item}} {$id3 {another item}}" \
+            [r stream.range mystream - +]
+    }
+
+    test {Module stream trim by length} {
+        r del mystream
+        # exact maxlen
+        r xadd mystream * item 1 value a
+        r xadd mystream * item 2 value b
+        r xadd mystream * item 3 value c
+        assert_equal 3 [r xlen mystream]
+        assert_equal 0 [r stream.trim mystream maxlen = 5]
+        assert_equal 3 [r xlen mystream]
+        assert_equal 2 [r stream.trim mystream maxlen = 1]
+        assert_equal 1 [r xlen mystream]
+        assert_equal 1 [r stream.trim mystream maxlen = 0]
+        # check that there is no limit for exact maxlen
+        r stream.addn mystream 20000 item x value y
+        assert_equal 20000 [r stream.trim mystream maxlen = 0]
+        # approx maxlen (100 items per node implies default limit 10K items)
+        r stream.addn mystream 20000 item x value y
+        assert_equal 20000 [r xlen mystream]
+        assert_equal 10000 [r stream.trim mystream maxlen ~ 2]
+        assert_equal 9900  [r stream.trim mystream maxlen ~ 2]
+        assert_equal 0     [r stream.trim mystream maxlen ~ 2]
+        assert_equal 100   [r xlen mystream]
+        assert_equal 100   [r stream.trim mystream maxlen ~ 0]
+        assert_equal 0     [r xlen mystream]
+    }
+
+    test {Module stream trim by ID} {
+        r del mystream
+        # exact minid
+        r xadd mystream * item 1 value a
+        r xadd mystream * item 2 value b
+        set minid [r xadd mystream * item 3 value c]
+        assert_equal 3 [r xlen mystream]
+        assert_equal 0 [r stream.trim mystream minid = -]
+        assert_equal 3 [r xlen mystream]
+        assert_equal 2 [r stream.trim mystream minid = $minid]
+        assert_equal 1 [r xlen mystream]
+        assert_equal 1 [r stream.trim mystream minid = +]
+        # check that there is no limit for exact minid
+        r stream.addn mystream 20000 item x value y
+        assert_equal 20000 [r stream.trim mystream minid = +]
+        # approx minid (100 items per node implies default limit 10K items)
+        r stream.addn mystream 19980 item x value y
+        set minid [r xadd mystream * item x value y]
+        r stream.addn mystream 19 item x value y
+        assert_equal 20000 [r xlen mystream]
+        assert_equal 10000 [r stream.trim mystream minid ~ $minid]
+        assert_equal 9900  [r stream.trim mystream minid ~ $minid]
+        assert_equal 0     [r stream.trim mystream minid ~ $minid]
+        assert_equal 100   [r xlen mystream]
+        assert_equal 100   [r stream.trim mystream minid ~ +]
+        assert_equal 0     [r xlen mystream]
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl b/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
new file mode 100644
index 00000000..9f482769
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
@@ -0,0 +1,32 @@
+set testmodule [file normalize tests/modules/test_lazyfree.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test "modules allocated memory can be reclaimed in the background" {
+        set orig_mem [s used_memory]
+        set rd [redis_deferring_client]
+
+        # LAZYFREE_THRESHOLD is 64
+        for {set i 0} {$i < 10000} {incr i} {
+            $rd lazyfreelink.insert lazykey $i
+        }
+
+        for {set j 0} {$j < 10000} {incr j} {
+            $rd read 
+        }
+
+        assert {[r lazyfreelink.len lazykey] == 10000}
+
+        set peak_mem [s used_memory]
+        assert {[r unlink lazykey] == 1}
+        assert {$peak_mem > $orig_mem+10000}
+        wait_for_condition 50 100 {
+            [s used_memory] < $peak_mem &&
+            [s used_memory] < $orig_mem*2 &&
+            [string match {*lazyfreed_objects:1*} [r info Memory]]
+        } else {
+            fail "Module memory is not reclaimed by UNLINK"
+        }
+    }
+}
\ No newline at end of file
diff --git a/redis-stable/tests/unit/moduleapi/testrdb.tcl b/redis-stable/tests/unit/moduleapi/testrdb.tcl
new file mode 100644
index 00000000..5ba10228
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/testrdb.tcl
@@ -0,0 +1,132 @@
+set testmodule [file normalize tests/modules/testrdb.so]
+
+tags "modules" {
+    test {modules are able to persist types} {
+        start_server [list overrides [list loadmodule "$testmodule"]] {
+            r testrdb.set.key key1 value1
+            assert_equal "value1" [r testrdb.get.key key1]
+            r debug reload
+            assert_equal "value1" [r testrdb.get.key key1]
+        }
+    }
+
+    test {modules global are lost without aux} {
+        set server_path [tmpdir "server.module-testrdb"]
+        start_server [list overrides [list loadmodule "$testmodule" "dir" $server_path] keep_persistence true] {
+            r testrdb.set.before global1
+            assert_equal "global1" [r testrdb.get.before]
+        }
+        start_server [list overrides [list loadmodule "$testmodule" "dir" $server_path]] {
+            assert_equal "" [r testrdb.get.before]
+        }
+    }
+
+    test {modules are able to persist globals before and after} {
+        set server_path [tmpdir "server.module-testrdb"]
+        start_server [list overrides [list loadmodule "$testmodule 2" "dir" $server_path] keep_persistence true] {
+            r testrdb.set.before global1
+            r testrdb.set.after global2
+            assert_equal "global1" [r testrdb.get.before]
+            assert_equal "global2" [r testrdb.get.after]
+        }
+        start_server [list overrides [list loadmodule "$testmodule 2" "dir" $server_path]] {
+            assert_equal "global1" [r testrdb.get.before]
+            assert_equal "global2" [r testrdb.get.after]
+        }
+
+    }
+
+    test {modules are able to persist globals just after} {
+        set server_path [tmpdir "server.module-testrdb"]
+        start_server [list overrides [list loadmodule "$testmodule 1" "dir" $server_path] keep_persistence true] {
+            r testrdb.set.after global2
+            assert_equal "global2" [r testrdb.get.after]
+        }
+        start_server [list overrides [list loadmodule "$testmodule 1" "dir" $server_path]] {
+            assert_equal "global2" [r testrdb.get.after]
+        }
+    }
+
+    tags {repl} {
+        test {diskless loading short read with module} {
+            start_server [list overrides [list loadmodule "$testmodule"]] {
+                set replica [srv 0 client]
+                set replica_host [srv 0 host]
+                set replica_port [srv 0 port]
+                start_server [list overrides [list loadmodule "$testmodule"]] {
+                    set master [srv 0 client]
+                    set master_host [srv 0 host]
+                    set master_port [srv 0 port]
+
+                    # Set master and replica to use diskless replication
+                    $master config set repl-diskless-sync yes
+                    $master config set rdbcompression no
+                    $replica config set repl-diskless-load swapdb
+                    $master config set hz 500
+                    $replica config set hz 500
+                    $master config set dynamic-hz no
+                    $replica config set dynamic-hz no
+                    set start [clock clicks -milliseconds]
+                    for {set k 0} {$k < 30} {incr k} {
+                        r testrdb.set.key key$k [string repeat A [expr {int(rand()*1000000)}]]
+                    }
+
+                    if {$::verbose} {
+                        set end [clock clicks -milliseconds]
+                        set duration [expr $end - $start]
+                        puts "filling took $duration ms (TODO: use pipeline)"
+                        set start [clock clicks -milliseconds]
+                    }
+
+                    # Start the replication process...
+                    set loglines [count_log_lines -1]
+                    $master config set repl-diskless-sync-delay 0
+                    $replica replicaof $master_host $master_port
+
+                    # kill the replication at various points
+                    set attempts 100
+                    if {$::accurate} { set attempts 500 }
+                    for {set i 0} {$i < $attempts} {incr i} {
+                        # wait for the replica to start reading the rdb
+                        # using the log file since the replica only responds to INFO once in 2mb
+                        set res [wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 2000 1]
+                        set loglines [lindex $res 1]
+
+                        # add some additional random sleep so that we kill the master on a different place each time
+                        after [expr {int(rand()*50)}]
+
+                        # kill the replica connection on the master
+                        set killed [$master client kill type replica]
+
+                        set res [wait_for_log_messages -1 {"*Internal error in RDB*" "*Finished with success*" "*Successful partial resynchronization*"} $loglines 1000 1]
+                        if {$::verbose} { puts $res }
+                        set log_text [lindex $res 0]
+                        set loglines [lindex $res 1]
+                        if {![string match "*Internal error in RDB*" $log_text]} {
+                            # force the replica to try another full sync
+                            $master multi
+                            $master client kill type replica
+                            $master set asdf asdf
+                            # the side effect of resizing the backlog is that it is flushed (16k is the min size)
+                            $master config set repl-backlog-size [expr {16384 + $i}]
+                            $master exec
+                        }
+                        # wait for loading to stop (fail)
+                        wait_for_condition 1000 1 {
+                            [s -1 loading] eq 0
+                        } else {
+                            fail "Replica didn't disconnect"
+                        }
+                    }
+                    if {$::verbose} {
+                        set end [clock clicks -milliseconds]
+                        set duration [expr $end - $start]
+                        puts "test took $duration ms"
+                    }
+                    # enable fast shutdown
+                    $master config set rdb-key-save-delay 0
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/moduleapi/timer.tcl b/redis-stable/tests/unit/moduleapi/timer.tcl
new file mode 100644
index 00000000..10a90227
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/timer.tcl
@@ -0,0 +1,57 @@
+set testmodule [file normalize tests/modules/timer.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {RM_CreateTimer: a sequence of timers work} {
+        # We can't guarantee same-ms but we try using MULTI/EXEC
+        r multi
+        for {set i 0} {$i < 20} {incr i} {
+            r test.createtimer 10 timer-incr-key
+        }
+        r exec
+
+        after 500
+        assert_equal 20 [r get timer-incr-key]
+    }
+
+    test {RM_GetTimer: basic sanity} {
+        # Getting non-existing timer
+        assert_equal {} [r test.gettimer 0]
+
+        # Getting a real timer
+        set id [r test.createtimer 10000 timer-incr-key]
+        set info [r test.gettimer $id]
+
+        assert_equal "timer-incr-key" [lindex $info 0]
+        set remaining [lindex $info 1]
+        assert {$remaining < 10000 && $remaining > 1}
+    }
+
+    test {RM_StopTimer: basic sanity} {
+        r set "timer-incr-key" 0
+        set id [r test.createtimer 1000 timer-incr-key]
+
+        assert_equal 1 [r test.stoptimer $id]
+
+        # Wait to be sure timer doesn't execute
+        after 2000
+        assert_equal 0 [r get timer-incr-key]
+
+        # Stop non-existing timer
+        assert_equal 0 [r test.stoptimer $id]
+    }
+
+    test {Timer appears non-existing after it fires} {
+        r set "timer-incr-key" 0
+        set id [r test.createtimer 10 timer-incr-key]
+
+        # verify timer fired
+        after 500
+        assert_equal 1 [r get timer-incr-key]
+
+        # verify id does not exist
+        assert_equal {} [r test.gettimer $id]
+    }
+}
+
diff --git a/redis-stable/tests/unit/moduleapi/zset.tcl b/redis-stable/tests/unit/moduleapi/zset.tcl
new file mode 100644
index 00000000..998d2076
--- /dev/null
+++ b/redis-stable/tests/unit/moduleapi/zset.tcl
@@ -0,0 +1,16 @@
+set testmodule [file normalize tests/modules/zset.so]
+
+start_server {tags {"modules"}} {
+    r module load $testmodule
+
+    test {Module zset rem} {
+        r del k
+        r zadd k 100 hello 200 world
+        assert_equal 1 [r zset.rem k hello]
+        assert_equal 0 [r zset.rem k hello]
+        assert_equal 1 [r exists k]
+        # Check that removing the last element deletes the key
+        assert_equal 1 [r zset.rem k world]
+        assert_equal 0 [r exists k]
+    }
+}
diff --git a/redis-stable/tests/unit/multi.tcl b/redis-stable/tests/unit/multi.tcl
new file mode 100644
index 00000000..d33f9451
--- /dev/null
+++ b/redis-stable/tests/unit/multi.tcl
@@ -0,0 +1,646 @@
+start_server {tags {"multi"}} {
+    test {MUTLI / EXEC basics} {
+        r del mylist
+        r rpush mylist a
+        r rpush mylist b
+        r rpush mylist c
+        r multi
+        set v1 [r lrange mylist 0 -1]
+        set v2 [r ping]
+        set v3 [r exec]
+        list $v1 $v2 $v3
+    } {QUEUED QUEUED {{a b c} PONG}}
+
+    test {DISCARD} {
+        r del mylist
+        r rpush mylist a
+        r rpush mylist b
+        r rpush mylist c
+        r multi
+        set v1 [r del mylist]
+        set v2 [r discard]
+        set v3 [r lrange mylist 0 -1]
+        list $v1 $v2 $v3
+    } {QUEUED OK {a b c}}
+
+    test {Nested MULTI are not allowed} {
+        set err {}
+        r multi
+        catch {[r multi]} err
+        r exec
+        set _ $err
+    } {*ERR MULTI*}
+
+    test {MULTI where commands alter argc/argv} {
+        r sadd myset a
+        r multi
+        r spop myset
+        list [r exec] [r exists myset]
+    } {a 0}
+
+    test {WATCH inside MULTI is not allowed} {
+        set err {}
+        r multi
+        catch {[r watch x]} err
+        r exec
+        set _ $err
+    } {*ERR WATCH*}
+
+    test {EXEC fails if there are errors while queueing commands #1} {
+        r del foo1 foo2
+        r multi
+        r set foo1 bar1
+        catch {r non-existing-command}
+        r set foo2 bar2
+        catch {r exec} e
+        assert_match {EXECABORT*} $e
+        list [r exists foo1] [r exists foo2]
+    } {0 0}
+
+    test {EXEC fails if there are errors while queueing commands #2} {
+        set rd [redis_deferring_client]
+        r del foo1 foo2
+        r multi
+        r set foo1 bar1
+        $rd config set maxmemory 1
+        assert  {[$rd read] eq {OK}}
+        catch {r lpush mylist myvalue}
+        $rd config set maxmemory 0
+        assert  {[$rd read] eq {OK}}
+        r set foo2 bar2
+        catch {r exec} e
+        assert_match {EXECABORT*} $e
+        $rd close
+        list [r exists foo1] [r exists foo2]
+    } {0 0}
+
+    test {If EXEC aborts, the client MULTI state is cleared} {
+        r del foo1 foo2
+        r multi
+        r set foo1 bar1
+        catch {r non-existing-command}
+        r set foo2 bar2
+        catch {r exec} e
+        assert_match {EXECABORT*} $e
+        r ping
+    } {PONG}
+
+    test {EXEC works on WATCHed key not modified} {
+        r watch x y z
+        r watch k
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {EXEC fail on WATCHed key modified (1 key of 1 watched)} {
+        r set x 30
+        r watch x
+        r set x 40
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {EXEC fail on WATCHed key modified (1 key of 5 watched)} {
+        r set x 30
+        r watch a b x k z
+        r set x 40
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {EXEC fail on WATCHed key modified by SORT with STORE even if the result is empty} {
+        r flushdb
+        r lpush foo bar
+        r watch foo
+        r sort emptylist store foo
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {EXEC fail on lazy expired WATCHed key} {
+        r flushall
+        r debug set-active-expire 0
+
+        r del key
+        r set key 1 px 2
+        r watch key
+
+        after 100
+
+        r multi
+        r incr key
+        assert_equal [r exec] {}
+        r debug set-active-expire 1
+    } {OK} {needs:debug}
+
+    test {After successful EXEC key is no longer watched} {
+        r set x 30
+        r watch x
+        r multi
+        r ping
+        r exec
+        r set x 40
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {After failed EXEC key is no longer watched} {
+        r set x 30
+        r watch x
+        r set x 40
+        r multi
+        r ping
+        r exec
+        r set x 40
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {It is possible to UNWATCH} {
+        r set x 30
+        r watch x
+        r set x 40
+        r unwatch
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {UNWATCH when there is nothing watched works as expected} {
+        r unwatch
+    } {OK}
+
+    test {FLUSHALL is able to touch the watched keys} {
+        r set x 30
+        r watch x
+        r flushall
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {FLUSHALL does not touch non affected keys} {
+        r del x
+        r watch x
+        r flushall
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {FLUSHDB is able to touch the watched keys} {
+        r set x 30
+        r watch x
+        r flushdb
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {FLUSHDB does not touch non affected keys} {
+        r del x
+        r watch x
+        r flushdb
+        r multi
+        r ping
+        r exec
+    } {PONG}
+
+    test {SWAPDB is able to touch the watched keys that exist} {
+        r flushall
+        r select 0
+        r set x 30
+        r watch x ;# make sure x (set to 30) doesn't change (SWAPDB will "delete" it)
+        r swapdb 0 1
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {SWAPDB is able to touch the watched keys that do not exist} {
+        r flushall
+        r select 1
+        r set x 30
+        r select 0
+        r watch x ;# make sure the key x (currently missing) doesn't change (SWAPDB will create it)
+        r swapdb 0 1
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {WATCH is able to remember the DB a key belongs to} {
+        r select 5
+        r set x 30
+        r watch x
+        r select 1
+        r set x 10
+        r select 5
+        r multi
+        r ping
+        set res [r exec]
+        # Restore original DB
+        r select 9
+        set res
+    } {PONG}
+
+    test {WATCH will consider touched keys target of EXPIRE} {
+        r del x
+        r set x foo
+        r watch x
+        r expire x 10
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {WATCH will consider touched expired keys} {
+        r del x
+        r set x foo
+        r expire x 1
+        r watch x
+        after 1100
+        r multi
+        r ping
+        r exec
+    } {}
+
+    test {DISCARD should clear the WATCH dirty flag on the client} {
+        r watch x
+        r set x 10
+        r multi
+        r discard
+        r multi
+        r incr x
+        r exec
+    } {11}
+
+    test {DISCARD should UNWATCH all the keys} {
+        r watch x
+        r set x 10
+        r multi
+        r discard
+        r set x 10
+        r multi
+        r incr x
+        r exec
+    } {11}
+
+    test {MULTI / EXEC is propagated correctly (single write command)} {
+        set repl [attach_to_replication_stream]
+        r multi
+        r set foo bar
+        r exec
+        assert_replication_stream $repl {
+            {select *}
+            {multi}
+            {set foo bar}
+            {exec}
+        }
+        close_replication_stream $repl
+    }
+
+    test {MULTI / EXEC is propagated correctly (empty transaction)} {
+        set repl [attach_to_replication_stream]
+        r multi
+        r exec
+        r set foo bar
+        assert_replication_stream $repl {
+            {select *}
+            {set foo bar}
+        }
+        close_replication_stream $repl
+    }
+
+    test {MULTI / EXEC is propagated correctly (read-only commands)} {
+        r set foo value1
+        set repl [attach_to_replication_stream]
+        r multi
+        r get foo
+        r exec
+        r set foo value2
+        assert_replication_stream $repl {
+            {select *}
+            {set foo value2}
+        }
+        close_replication_stream $repl
+    }
+
+    test {MULTI / EXEC is propagated correctly (write command, no effect)} {
+        r del bar foo bar
+        set repl [attach_to_replication_stream]
+        r multi
+        r del foo
+        r exec
+
+        # add another command so that when we see it we know multi-exec wasn't
+        # propagated
+        r incr foo
+
+        assert_replication_stream $repl {
+            {select *}
+            {incr foo}
+        }
+        close_replication_stream $repl
+    }
+
+    test {DISCARD should not fail during OOM} {
+        set rd [redis_deferring_client]
+        $rd config set maxmemory 1
+        assert  {[$rd read] eq {OK}}
+        r multi
+        catch {r set x 1} e
+        assert_match {OOM*} $e
+        r discard
+        $rd config set maxmemory 0
+        assert  {[$rd read] eq {OK}}
+        $rd close
+        r ping
+    } {PONG}
+
+    test {MULTI and script timeout} {
+        # check that if MULTI arrives during timeout, it is either refused, or
+        # allowed to pass, and we don't end up executing half of the transaction
+        set rd1 [redis_deferring_client]
+        set r2 [redis_client]
+        r config set lua-time-limit 10
+        r set xx 1
+        $rd1 eval {while true do end} 0
+        after 200
+        catch { $r2 multi; } e
+        catch { $r2 incr xx; } e
+        r script kill
+        after 200 ; # Give some time to Lua to call the hook again...
+        catch { $r2 incr xx; } e
+        catch { $r2 exec; } e
+        assert_match {EXECABORT*previous errors*} $e
+        set xx [r get xx]
+        # make sure that either the whole transcation passed or none of it (we actually expect none)
+        assert { $xx == 1 || $xx == 3}
+        # check that the connection is no longer in multi state
+        set pong [$r2 ping asdf]
+        assert_equal $pong "asdf"
+        $rd1 close; $r2 close
+    }
+
+    test {EXEC and script timeout} {
+        # check that if EXEC arrives during timeout, we don't end up executing
+        # half of the transaction, and also that we exit the multi state
+        set rd1 [redis_deferring_client]
+        set r2 [redis_client]
+        r config set lua-time-limit 10
+        r set xx 1
+        catch { $r2 multi; } e
+        catch { $r2 incr xx; } e
+        $rd1 eval {while true do end} 0
+        after 200
+        catch { $r2 incr xx; } e
+        catch { $r2 exec; } e
+        assert_match {EXECABORT*BUSY*} $e
+        r script kill
+        after 200 ; # Give some time to Lua to call the hook again...
+        set xx [r get xx]
+        # make sure that either the whole transcation passed or none of it (we actually expect none)
+        assert { $xx == 1 || $xx == 3}
+        # check that the connection is no longer in multi state
+        set pong [$r2 ping asdf]
+        assert_equal $pong "asdf"
+        $rd1 close; $r2 close
+    }
+
+    test {MULTI-EXEC body and script timeout} {
+        # check that we don't run an imcomplete transaction due to some commands
+        # arriving during busy script
+        set rd1 [redis_deferring_client]
+        set r2 [redis_client]
+        r config set lua-time-limit 10
+        r set xx 1
+        catch { $r2 multi; } e
+        catch { $r2 incr xx; } e
+        $rd1 eval {while true do end} 0
+        after 200
+        catch { $r2 incr xx; } e
+        r script kill
+        after 200 ; # Give some time to Lua to call the hook again...
+        catch { $r2 exec; } e
+        assert_match {EXECABORT*previous errors*} $e
+        set xx [r get xx]
+        # make sure that either the whole transcation passed or none of it (we actually expect none)
+        assert { $xx == 1 || $xx == 3}
+        # check that the connection is no longer in multi state
+        set pong [$r2 ping asdf]
+        assert_equal $pong "asdf"
+        $rd1 close; $r2 close
+    }
+
+    test {just EXEC and script timeout} {
+        # check that if EXEC arrives during timeout, we don't end up executing
+        # actual commands during busy script, and also that we exit the multi state
+        set rd1 [redis_deferring_client]
+        set r2 [redis_client]
+        r config set lua-time-limit 10
+        r set xx 1
+        catch { $r2 multi; } e
+        catch { $r2 incr xx; } e
+        $rd1 eval {while true do end} 0
+        after 200
+        catch { $r2 exec; } e
+        assert_match {EXECABORT*BUSY*} $e
+        r script kill
+        after 200 ; # Give some time to Lua to call the hook again...
+        set xx [r get xx]
+        # make we didn't execute the transaction
+        assert { $xx == 1}
+        # check that the connection is no longer in multi state
+        set pong [$r2 ping asdf]
+        assert_equal $pong "asdf"
+        $rd1 close; $r2 close
+    }
+
+    test {exec with write commands and state change} {
+        # check that exec that contains write commands fails if server state changed since they were queued
+        set r1 [redis_client]
+        r set xx 1
+        r multi
+        r incr xx
+        $r1 config set min-replicas-to-write 2
+        catch {r exec} e
+        assert_match {*EXECABORT*NOREPLICAS*} $e
+        set xx [r get xx]
+        # make sure that the INCR wasn't executed
+        assert { $xx == 1}
+        $r1 config set min-replicas-to-write 0
+        $r1 close;
+    }
+
+    test {exec with read commands and stale replica state change} {
+        # check that exec that contains read commands fails if server state changed since they were queued
+        r config set replica-serve-stale-data no
+        set r1 [redis_client]
+        r set xx 1
+
+        # check that GET is disallowed on stale replica, even if the replica becomes stale only after queuing.
+        r multi
+        r get xx
+        $r1 replicaof localhsot 0
+        catch {r exec} e
+        assert_match {*EXECABORT*MASTERDOWN*} $e
+
+        # check that PING is allowed
+        r multi
+        r ping
+        $r1 replicaof localhsot 0
+        set pong [r exec]
+        assert {$pong == "PONG"}
+
+        # check that when replica is not stale, GET is allowed
+        # while we're at it, let's check that multi is allowed on stale replica too
+        r multi
+        $r1 replicaof no one
+        r get xx
+        set xx [r exec]
+        # make sure that the INCR was executed
+        assert { $xx == 1 }
+        $r1 close;
+    }
+
+    test {EXEC with only read commands should not be rejected when OOM} {
+        set r2 [redis_client]
+
+        r set x value
+        r multi
+        r get x
+        r ping
+
+        # enforcing OOM
+        $r2 config set maxmemory 1
+
+        # finish the multi transaction with exec
+        assert { [r exec] == {value PONG} }
+
+        # releasing OOM
+        $r2 config set maxmemory 0
+        $r2 close
+    }
+
+    test {EXEC with at least one use-memory command should fail} {
+        set r2 [redis_client]
+
+        r multi
+        r set x 1
+        r get x
+
+        # enforcing OOM
+        $r2 config set maxmemory 1
+
+        # finish the multi transaction with exec
+        catch {r exec} e
+        assert_match {EXECABORT*OOM*} $e
+
+        # releasing OOM
+        $r2 config set maxmemory 0
+        $r2 close
+    }
+
+    test {Blocking commands ignores the timeout} {
+        r xgroup create s g $ MKSTREAM
+
+        set m [r multi]
+        r blpop empty_list 0
+        r brpop empty_list 0
+        r brpoplpush empty_list1 empty_list2 0
+        r blmove empty_list1 empty_list2 LEFT LEFT 0
+        r bzpopmin empty_zset 0
+        r bzpopmax empty_zset 0
+        r xread BLOCK 0 STREAMS s $
+        r xreadgroup group g c BLOCK 0 STREAMS s >
+        set res [r exec]
+
+        list $m $res
+    } {OK {{} {} {} {} {} {} {} {}}}
+
+    test {MULTI propagation of PUBLISH} {
+        set repl [attach_to_replication_stream]
+
+        # make sure that PUBLISH inside MULTI is propagated in a transaction
+        r multi
+        r publish bla bla
+        r exec
+
+        assert_replication_stream $repl {
+            {select *}
+            {multi}
+            {publish bla bla}
+            {exec}
+        }
+        close_replication_stream $repl
+    }
+
+    test {MULTI propagation of SCRIPT LOAD} {
+        set repl [attach_to_replication_stream]
+
+        # make sure that SCRIPT LOAD inside MULTI is propagated in a transaction
+        r multi
+        r script load {redis.call('set', KEYS[1], 'foo')}
+        set res [r exec]
+        set sha [lindex $res 0]
+
+        assert_replication_stream $repl {
+            {select *}
+            {multi}
+            {script load *}
+            {exec}
+        }
+        close_replication_stream $repl
+    }
+
+    test {MULTI propagation of SCRIPT LOAD} {
+        set repl [attach_to_replication_stream]
+
+        # make sure that EVAL inside MULTI is propagated in a transaction
+        r config set lua-replicate-commands no
+        r multi
+        r eval {redis.call('set', KEYS[1], 'bar')} 1 bar
+        r exec
+
+        assert_replication_stream $repl {
+            {select *}
+            {multi}
+            {eval *}
+            {exec}
+        }
+        close_replication_stream $repl
+    }
+
+    tags {"stream"} {
+        test {MULTI propagation of XREADGROUP} {
+            # stream is a special case because it calls propagate() directly for XREADGROUP
+            set repl [attach_to_replication_stream]
+
+            r XADD mystream * foo bar
+            r XGROUP CREATE mystream mygroup 0
+
+            # make sure the XCALIM (propagated by XREADGROUP) is indeed inside MULTI/EXEC
+            r multi
+            r XREADGROUP GROUP mygroup consumer1 STREAMS mystream ">"
+            r exec
+
+            assert_replication_stream $repl {
+                {select *}
+                {xadd *}
+                {xgroup CREATE *}
+                {multi}
+                {xclaim *}
+                {exec}
+            }
+            close_replication_stream $repl
+        }
+    }
+
+}
diff --git a/redis-stable/tests/unit/networking.tcl b/redis-stable/tests/unit/networking.tcl
new file mode 100644
index 00000000..38b49d45
--- /dev/null
+++ b/redis-stable/tests/unit/networking.tcl
@@ -0,0 +1,36 @@
+test {CONFIG SET port number} {
+    start_server {} {
+        if {$::tls} { set port_cfg tls-port} else { set port_cfg port }
+
+        # available port
+        set avail_port [find_available_port $::baseport $::portcount]
+        set rd [redis [srv 0 host] [srv 0 port] 0 $::tls]
+        $rd CONFIG SET $port_cfg $avail_port
+        $rd close
+        set rd [redis [srv 0 host] $avail_port 0 $::tls]
+        $rd PING
+
+        # already inuse port
+        catch {$rd CONFIG SET $port_cfg $::test_server_port} e
+        assert_match {*Unable to listen on this port*} $e
+        $rd close
+
+        # make sure server still listening on the previous port
+        set rd [redis [srv 0 host] $avail_port 0 $::tls]
+        $rd PING
+        $rd close
+    }
+}
+
+test {CONFIG SET bind address} {
+    start_server {} {
+        # non-valid address
+        catch {r CONFIG SET bind "999.999.999.999"} e
+        assert_match {*Failed to bind to specified addresses*} $e
+
+        # make sure server still bound to the previous address
+        set rd [redis [srv 0 host] [srv 0 port] 0 $::tls]
+        $rd PING
+        $rd close
+    }
+}
diff --git a/redis-stable/tests/unit/obuf-limits.tcl b/redis-stable/tests/unit/obuf-limits.tcl
new file mode 100644
index 00000000..3f26c53f
--- /dev/null
+++ b/redis-stable/tests/unit/obuf-limits.tcl
@@ -0,0 +1,186 @@
+start_server {tags {"obuf-limits"}} {
+    test {Client output buffer hard limit is enforced} {
+        r config set client-output-buffer-limit {pubsub 100000 0 0}
+        set rd1 [redis_deferring_client]
+
+        $rd1 subscribe foo
+        set reply [$rd1 read]
+        assert {$reply eq "subscribe foo 1"}
+
+        set omem 0
+        while 1 {
+            r publish foo bar
+            set clients [split [r client list] "\r\n"]
+            set c [split [lindex $clients 1] " "]
+            if {![regexp {omem=([0-9]+)} $c - omem]} break
+            if {$omem > 200000} break
+        }
+        assert {$omem >= 70000 && $omem < 200000}
+        $rd1 close
+    }
+    
+    foreach {soft_limit_time wait_for_timeout} {3 yes
+                                                4 no } {
+        if $wait_for_timeout {
+            set test_name "Client output buffer soft limit is enforced if time is overreached"
+        } else {
+            set test_name "Client output buffer soft limit is not enforced too early and is enforced when no traffic"
+        }
+
+        test $test_name {
+            r config set client-output-buffer-limit "pubsub 0 100000 $soft_limit_time"
+            set soft_limit_time [expr $soft_limit_time*1000]
+            set rd1 [redis_deferring_client]
+
+            $rd1 client setname test_client
+            set reply [$rd1 read]
+            assert {$reply eq "OK"}
+
+            $rd1 subscribe foo
+            set reply [$rd1 read]
+            assert {$reply eq "subscribe foo 1"}
+
+            set omem 0
+            set start_time 0
+            set time_elapsed 0
+            set last_under_limit_time [clock milliseconds]
+            while 1 {
+                r publish foo [string repeat "x" 1000]
+                set clients [split [r client list] "\r\n"]
+                set c [lsearch -inline $clients *name=test_client*]
+                if {$start_time != 0} {
+                    set time_elapsed [expr {[clock milliseconds]-$start_time}]
+                    # Make sure test isn't taking too long
+                    assert {$time_elapsed <= [expr $soft_limit_time+3000]}
+                }
+                if {$wait_for_timeout && $c == ""} {
+                    # Make sure we're disconnected when we reach the soft limit
+                    assert {$omem >= 100000 && $time_elapsed >= $soft_limit_time}
+                    break
+                } else {
+                    assert {[regexp {omem=([0-9]+)} $c - omem]}
+                }
+                if {$omem > 100000} {
+                    if {$start_time == 0} {set start_time $last_under_limit_time}
+                    if {!$wait_for_timeout && $time_elapsed >= [expr $soft_limit_time-1000]} break
+                    # Slow down loop when omem has reached the limit.
+                    after 10
+                } else {
+                    # if the OS socket buffers swallowed what we previously filled, reset the start timer.
+                    set start_time 0
+                    set last_under_limit_time [clock milliseconds]
+                }
+            }
+
+            if {!$wait_for_timeout} {
+                # After we completely stopped the traffic, wait for soft limit to time out
+                set timeout [expr {$soft_limit_time+1500 - ([clock milliseconds]-$start_time)}]
+                wait_for_condition [expr $timeout/10] 10 {
+                    [lsearch [split [r client list] "\r\n"] *name=test_client*] == -1
+                } else {
+                    fail "Soft limit timed out but client still connected"
+                }
+            }
+
+            $rd1 close
+        }
+    }
+
+    test {No response for single command if client output buffer hard limit is enforced} {
+        r config set client-output-buffer-limit {normal 100000 0 0}
+        # Total size of all items must be more than 100k
+        set item [string repeat "x" 1000]
+        for {set i 0} {$i < 150} {incr i} {
+            r lpush mylist $item
+        }
+        set orig_mem [s used_memory]
+        # Set client name and get all items
+        set rd [redis_deferring_client]
+        $rd client setname mybiglist
+        assert {[$rd read] eq "OK"}
+        $rd lrange mylist 0 -1
+        $rd flush
+        after 100
+
+        # Before we read reply, redis will close this client.
+        set clients [r client list]
+        assert_no_match "*name=mybiglist*" $clients
+        set cur_mem [s used_memory]
+        # 10k just is a deviation threshold
+        assert {$cur_mem < 10000 + $orig_mem}
+
+        # Read nothing
+        set fd [$rd channel]
+        assert_equal {} [read $fd]
+    }
+
+    # Note: This test assumes that what's written with one write, will be read by redis in one read.
+    # this assumption is wrong, but seem to work empirically (for now)
+    test {No response for multi commands in pipeline if client output buffer limit is enforced} {
+        r config set client-output-buffer-limit {normal 100000 0 0}
+        set value [string repeat "x" 10000]
+        r set bigkey $value
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+        $rd2 client setname multicommands
+        assert_equal "OK" [$rd2 read]
+
+        # Let redis sleep 1s firstly
+        $rd1 debug sleep 1
+        $rd1 flush
+        after 100
+
+        # Create a pipeline of commands that will be processed in one socket read.
+        # It is important to use one write, in TLS mode independant writes seem
+        # to wait for response from the server.
+        # Total size should be less than OS socket buffer, redis can
+        # execute all commands in this pipeline when it wakes up.
+        set buf ""
+        for {set i 0} {$i < 15} {incr i} {
+            append buf "set $i $i\r\n"
+            append buf "get $i\r\n"
+            append buf "del $i\r\n"
+            # One bigkey is 10k, total response size must be more than 100k
+            append buf "get bigkey\r\n"
+        }
+        $rd2 write $buf
+        $rd2 flush
+        after 100
+
+        # Reds must wake up if it can send reply
+        assert_equal "PONG" [r ping]
+        set clients [r client list]
+        assert_no_match "*name=multicommands*" $clients
+        set fd [$rd2 channel]
+        assert_equal {} [read $fd]
+    }
+
+    test {Execute transactions completely even if client output buffer limit is enforced} {
+        r config set client-output-buffer-limit {normal 100000 0 0}
+        # Total size of all items must be more than 100k
+        set item [string repeat "x" 1000]
+        for {set i 0} {$i < 150} {incr i} {
+            r lpush mylist2 $item
+        }
+
+        # Output buffer limit is enforced during executing transaction
+        r client setname transactionclient
+        r set k1 v1
+        r multi
+        r set k2 v2
+        r get k2
+        r lrange mylist2 0 -1
+        r set k3 v3
+        r del k1
+        catch {[r exec]} e
+        assert_match "*I/O error*" $e
+        reconnect
+        set clients [r client list]
+        assert_no_match "*name=transactionclient*" $clients
+
+        # Transactions should be executed completely
+        assert_equal {} [r get k1]
+        assert_equal "v2" [r get k2]
+        assert_equal "v3" [r get k3]
+    }
+}
diff --git a/redis-stable/tests/unit/oom-score-adj.tcl b/redis-stable/tests/unit/oom-score-adj.tcl
new file mode 100644
index 00000000..892b1a7a
--- /dev/null
+++ b/redis-stable/tests/unit/oom-score-adj.tcl
@@ -0,0 +1,77 @@
+set system_name [string tolower [exec uname -s]]
+set user_id [exec id -u]
+
+if {$system_name eq {linux}} {
+    start_server {tags {"oom-score-adj"}} {
+        proc get_oom_score_adj {{pid ""}} {
+            if {$pid == ""} {
+                set pid [srv 0 pid]
+            }
+            set fd [open "/proc/$pid/oom_score_adj" "r"]
+            set val [gets $fd]
+            close $fd
+
+            return $val
+        }
+
+        test {CONFIG SET oom-score-adj works as expected} {
+            set base [get_oom_score_adj]
+
+            # Enable oom-score-adj, check defaults
+            r config set oom-score-adj-values "10 20 30"
+            r config set oom-score-adj yes
+
+            assert {[get_oom_score_adj] == [expr $base + 10]}
+
+            # Modify current class
+            r config set oom-score-adj-values "15 20 30"
+            assert {[get_oom_score_adj] == [expr $base + 15]}
+
+            # Check replica class
+            r replicaof localhost 1
+            assert {[get_oom_score_adj] == [expr $base + 20]}
+            r replicaof no one
+            assert {[get_oom_score_adj] == [expr $base + 15]}
+
+            # Check child process
+            r set key-a value-a
+            r config set rdb-key-save-delay 1000000
+            r bgsave
+
+            set child_pid [get_child_pid 0]
+            # Wait until background child process to setOOMScoreAdj success.
+            wait_for_condition 100 10 {
+                [get_oom_score_adj $child_pid] == [expr $base + 30]
+            } else {
+                fail "Set oom-score-adj of background child process is not ok"
+            }
+        }
+
+        # Failed oom-score-adj tests can only run unprivileged
+        if {$user_id != 0} {
+            test {CONFIG SET oom-score-adj handles configuration failures} {
+                # Bad config
+                r config set oom-score-adj no
+                r config set oom-score-adj-values "-1000 -1000 -1000"
+
+                # Make sure it fails
+                catch {r config set oom-score-adj yes} e
+                assert_match {*Failed to set*} $e
+
+                # Make sure it remains off
+                assert {[r config get oom-score-adj] == "oom-score-adj no"}
+
+                # Fix config
+                r config set oom-score-adj-values "0 100 100"
+                r config set oom-score-adj yes
+
+                # Make sure it fails
+                catch {r config set oom-score-adj-values "-1000 -1000 -1000"} e
+                assert_match {*Failed*} $e
+
+                # Make sure previous values remain
+                assert {[r config get oom-score-adj-values] == {oom-score-adj-values {0 100 100}}}
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/other.tcl b/redis-stable/tests/unit/other.tcl
new file mode 100644
index 00000000..293ee7e9
--- /dev/null
+++ b/redis-stable/tests/unit/other.tcl
@@ -0,0 +1,370 @@
+start_server {overrides {save ""} tags {"other"}} {
+    if {$::force_failure} {
+        # This is used just for test suite development purposes.
+        test {Failing test} {
+            format err
+        } {ok}
+    }
+
+    test {SAVE - make sure there are all the types as values} {
+        # Wait for a background saving in progress to terminate
+        waitForBgsave r
+        r lpush mysavelist hello
+        r lpush mysavelist world
+        r set myemptykey {}
+        r set mynormalkey {blablablba}
+        r zadd mytestzset 10 a
+        r zadd mytestzset 20 b
+        r zadd mytestzset 30 c
+        r save
+    } {OK}
+
+    tags {slow} {
+        if {$::accurate} {set iterations 10000} else {set iterations 1000}
+        foreach fuzztype {binary alpha compr} {
+            test "FUZZ stresser with data model $fuzztype" {
+                set err 0
+                for {set i 0} {$i < $iterations} {incr i} {
+                    set fuzz [randstring 0 512 $fuzztype]
+                    r set foo $fuzz
+                    set got [r get foo]
+                    if {$got ne $fuzz} {
+                        set err [list $fuzz $got]
+                        break
+                    }
+                }
+                set _ $err
+            } {0}
+        }
+    }
+
+    test {BGSAVE} {
+        waitForBgsave r
+        r flushdb
+        r save
+        r set x 10
+        r bgsave
+        waitForBgsave r
+        r debug reload
+        r get x
+    } {10}
+
+    test {SELECT an out of range DB} {
+        catch {r select 1000000} err
+        set _ $err
+    } {*index is out of range*}
+
+    tags {consistency} {
+        if {true} {
+            if {$::accurate} {set numops 10000} else {set numops 1000}
+            test {Check consistency of different data types after a reload} {
+                r flushdb
+                createComplexDataset r $numops
+                set dump [csvdump r]
+                set sha1 [r debug digest]
+                r debug reload
+                set sha1_after [r debug digest]
+                if {$sha1 eq $sha1_after} {
+                    set _ 1
+                } else {
+                    set newdump [csvdump r]
+                    puts "Consistency test failed!"
+                    puts "You can inspect the two dumps in /tmp/repldump*.txt"
+
+                    set fd [open /tmp/repldump1.txt w]
+                    puts $fd $dump
+                    close $fd
+                    set fd [open /tmp/repldump2.txt w]
+                    puts $fd $newdump
+                    close $fd
+
+                    set _ 0
+                }
+            } {1}
+
+            test {Same dataset digest if saving/reloading as AOF?} {
+                r config set aof-use-rdb-preamble no
+                r bgrewriteaof
+                waitForBgrewriteaof r
+                r debug loadaof
+                set sha1_after [r debug digest]
+                if {$sha1 eq $sha1_after} {
+                    set _ 1
+                } else {
+                    set newdump [csvdump r]
+                    puts "Consistency test failed!"
+                    puts "You can inspect the two dumps in /tmp/aofdump*.txt"
+
+                    set fd [open /tmp/aofdump1.txt w]
+                    puts $fd $dump
+                    close $fd
+                    set fd [open /tmp/aofdump2.txt w]
+                    puts $fd $newdump
+                    close $fd
+
+                    set _ 0
+                }
+            } {1}
+        }
+    }
+
+    test {EXPIRES after a reload (snapshot + append only file rewrite)} {
+        r flushdb
+        r set x 10
+        r expire x 1000
+        r save
+        r debug reload
+        set ttl [r ttl x]
+        set e1 [expr {$ttl > 900 && $ttl <= 1000}]
+        r bgrewriteaof
+        waitForBgrewriteaof r
+        r debug loadaof
+        set ttl [r ttl x]
+        set e2 [expr {$ttl > 900 && $ttl <= 1000}]
+        list $e1 $e2
+    } {1 1}
+
+    test {EXPIRES after AOF reload (without rewrite)} {
+        r flushdb
+        r config set appendonly yes
+        r config set aof-use-rdb-preamble no
+        r set x somevalue
+        r expire x 1000
+        r setex y 2000 somevalue
+        r set z somevalue
+        r expireat z [expr {[clock seconds]+3000}]
+
+        # Milliseconds variants
+        r set px somevalue
+        r pexpire px 1000000
+        r psetex py 2000000 somevalue
+        r set pz somevalue
+        r pexpireat pz [expr {([clock seconds]+3000)*1000}]
+
+        # Reload and check
+        waitForBgrewriteaof r
+        # We need to wait two seconds to avoid false positives here, otherwise
+        # the DEBUG LOADAOF command may read a partial file.
+        # Another solution would be to set the fsync policy to no, since this
+        # prevents write() to be delayed by the completion of fsync().
+        after 2000
+        r debug loadaof
+        set ttl [r ttl x]
+        assert {$ttl > 900 && $ttl <= 1000}
+        set ttl [r ttl y]
+        assert {$ttl > 1900 && $ttl <= 2000}
+        set ttl [r ttl z]
+        assert {$ttl > 2900 && $ttl <= 3000}
+        set ttl [r ttl px]
+        assert {$ttl > 900 && $ttl <= 1000}
+        set ttl [r ttl py]
+        assert {$ttl > 1900 && $ttl <= 2000}
+        set ttl [r ttl pz]
+        assert {$ttl > 2900 && $ttl <= 3000}
+        r config set appendonly no
+    }
+
+    tags {protocol} {
+        test {PIPELINING stresser (also a regression for the old epoll bug)} {
+            if {$::tls} {
+                set fd2 [::tls::socket [srv host] [srv port]]
+            } else {
+                set fd2 [socket [srv host] [srv port]]
+            }
+            fconfigure $fd2 -encoding binary -translation binary
+            puts -nonewline $fd2 "SELECT 9\r\n"
+            flush $fd2
+            gets $fd2
+
+            for {set i 0} {$i < 100000} {incr i} {
+                set q {}
+                set val "0000${i}0000"
+                append q "SET key:$i $val\r\n"
+                puts -nonewline $fd2 $q
+                set q {}
+                append q "GET key:$i\r\n"
+                puts -nonewline $fd2 $q
+            }
+            flush $fd2
+
+            for {set i 0} {$i < 100000} {incr i} {
+                gets $fd2 line
+                gets $fd2 count
+                set count [string range $count 1 end]
+                set val [read $fd2 $count]
+                read $fd2 2
+            }
+            close $fd2
+            set _ 1
+        } {1}
+    }
+
+    test {APPEND basics} {
+        r del foo
+        list [r append foo bar] [r get foo] \
+             [r append foo 100] [r get foo]
+    } {3 bar 6 bar100}
+
+    test {APPEND basics, integer encoded values} {
+        set res {}
+        r del foo
+        r append foo 1
+        r append foo 2
+        lappend res [r get foo]
+        r set foo 1
+        r append foo 2
+        lappend res [r get foo]
+    } {12 12}
+
+    test {APPEND fuzzing} {
+        set err {}
+        foreach type {binary alpha compr} {
+            set buf {}
+            r del x
+            for {set i 0} {$i < 1000} {incr i} {
+                set bin [randstring 0 10 $type]
+                append buf $bin
+                r append x $bin
+            }
+            if {$buf != [r get x]} {
+                set err "Expected '$buf' found '[r get x]'"
+                break
+            }
+        }
+        set _ $err
+    } {}
+
+    # Leave the user with a clean DB before to exit
+    test {FLUSHDB} {
+        set aux {}
+        r select 9
+        r flushdb
+        lappend aux [r dbsize]
+        r select 10
+        r flushdb
+        lappend aux [r dbsize]
+    } {0 0}
+
+    test {Perform a final SAVE to leave a clean DB on disk} {
+        waitForBgsave r
+        r save
+    } {OK}
+
+    test {RESET clears client state} {
+        r client setname test-client
+        r client tracking on
+
+        assert_equal [r reset] "RESET"
+        set client [r client list]
+        assert_match {*name= *} $client
+        assert_match {*flags=N *} $client
+    }
+
+    test {RESET clears MONITOR state} {
+        set rd [redis_deferring_client]
+        $rd monitor
+        assert_equal [$rd read] "OK"
+
+        $rd reset
+        assert_equal [$rd read] "RESET"
+
+        assert_no_match {*flags=O*} [r client list]
+    }
+
+    test {RESET clears and discards MULTI state} {
+        r multi
+        r set key-a a
+
+        r reset
+        catch {r exec} err
+        assert_match {*EXEC without MULTI*} $err
+    }
+
+    test {RESET clears Pub/Sub state} {
+        r subscribe channel-1
+        r reset
+
+        # confirm we're not subscribed by executing another command
+        r set key val
+    }
+
+    test {RESET clears authenticated state} {
+        r acl setuser user1 on >secret +@all
+        r auth user1 secret
+        assert_equal [r acl whoami] user1
+
+        r reset
+
+        assert_equal [r acl whoami] default
+    }
+}
+
+start_server {tags {"other"}} {
+    test {Don't rehash if redis has child proecess} {
+        r config set save ""
+        r config set rdb-key-save-delay 1000000
+
+        populate 4096 "" 1
+        r bgsave
+        wait_for_condition 10 100 {
+            [s rdb_bgsave_in_progress] eq 1
+        } else {
+            fail "bgsave did not start in time"
+        }
+
+        r mset k1 v1 k2 v2
+        # Hash table should not rehash
+        assert_no_match "*table size: 8192*" [r debug HTSTATS 9]
+        exec kill -9 [get_child_pid 0]
+        after 200
+
+        # Hash table should rehash since there is no child process,
+        # size is power of two and over 4098, so it is 8192
+        r set k3 v3
+        assert_match "*table size: 8192*" [r debug HTSTATS 9]
+    }
+}
+
+proc read_proc_title {pid} {
+    set fd [open "/proc/$pid/cmdline" "r"]
+    set cmdline [read $fd 1024]
+    close $fd
+
+    return $cmdline
+}
+
+start_server {tags {"other"}} {
+    test {Process title set as expected} {
+        # Test only on Linux where it's easy to get cmdline without relying on tools.
+        # Skip valgrind as it messes up the arguments.
+        set os [exec uname]
+        if {$os == "Linux" && !$::valgrind} {
+            # Set a custom template
+            r config set "proc-title-template" "TEST {title} {listen-addr} {port} {tls-port} {unixsocket} {config-file}"
+            set cmdline [read_proc_title [srv 0 pid]]
+
+            assert_equal "TEST" [lindex $cmdline 0]
+            assert_match "*/redis-server" [lindex $cmdline 1]
+            
+            if {$::tls} {
+                set expect_port 0
+                set expect_tls_port [srv 0 port]
+            } else {
+                set expect_port [srv 0 port]
+                set expect_tls_port 0
+            }
+            set port [srv 0 port]
+
+            assert_equal "$::host:$port" [lindex $cmdline 2]
+            assert_equal $expect_port [lindex $cmdline 3]
+            assert_equal $expect_tls_port [lindex $cmdline 4]
+            assert_match "*/tests/tmp/server.*/socket" [lindex $cmdline 5]
+            assert_match "*/tests/tmp/redis.conf.*" [lindex $cmdline 6]
+
+            # Try setting a bad template
+            catch {r config set "proc-title-template" "{invalid-var}"} err
+            assert_match {*template format is invalid*} $err
+        }
+    }
+}
+
diff --git a/redis-stable/tests/unit/pause.tcl b/redis-stable/tests/unit/pause.tcl
new file mode 100644
index 00000000..21b9680d
--- /dev/null
+++ b/redis-stable/tests/unit/pause.tcl
@@ -0,0 +1,251 @@
+start_server {tags {"pause network"}} {
+    test "Test read commands are not blocked by client pause" {
+        r client PAUSE 100000000 WRITE
+        set rd [redis_deferring_client]
+        $rd GET FOO
+        $rd PING
+        $rd INFO
+        assert_equal [s 0 blocked_clients] 0
+        r client unpause
+        $rd close
+    }
+
+    test "Test write commands are paused by RO" {
+        r client PAUSE 100000000 WRITE
+
+        set rd [redis_deferring_client]
+        $rd SET FOO BAR
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        r client unpause
+        assert_match "OK" [$rd read]
+        $rd close
+    }
+
+    test "Test special commands are paused by RO" {
+        r PFADD pause-hll test
+        r client PAUSE 100000000 WRITE
+
+        # Test that pfcount, which can replicate, is also blocked
+        set rd [redis_deferring_client]
+        $rd PFCOUNT pause-hll
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        # Test that publish, which adds the message to the replication
+        # stream is blocked.
+        set rd2 [redis_deferring_client]
+        $rd2 publish foo bar
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {2}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        # Test that SCRIPT LOAD, which is replicated. 
+        set rd3 [redis_deferring_client]
+        $rd3 script load "return 1"
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {3}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        r client unpause 
+        assert_match "1" [$rd read]
+        assert_match "0" [$rd2 read]
+        assert_match "*" [$rd3 read]
+        $rd close
+        $rd2 close
+        $rd3 close
+    }
+
+    test "Test read/admin mutli-execs are not blocked by pause RO" {
+        r SET FOO BAR
+        r client PAUSE 100000000 WRITE
+        set rd [redis_deferring_client]
+        $rd MULTI
+        assert_equal [$rd read] "OK"
+        $rd PING
+        assert_equal [$rd read] "QUEUED"
+        $rd GET FOO
+        assert_equal [$rd read] "QUEUED"
+        $rd EXEC
+        assert_equal [s 0 blocked_clients] 0
+        r client unpause 
+        assert_match "PONG BAR" [$rd read]
+        $rd close
+    }
+
+    test "Test write mutli-execs are blocked by pause RO" {
+        set rd [redis_deferring_client]
+        $rd MULTI
+        assert_equal [$rd read] "OK"
+        $rd SET FOO BAR
+        r client PAUSE 100000000 WRITE
+        assert_equal [$rd read] "QUEUED"
+        $rd EXEC
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client unpause 
+        assert_match "OK" [$rd read]
+        $rd close
+    }
+
+    test "Test scripts are blocked by pause RO" {
+        r client PAUSE 100000000 WRITE
+        set rd [redis_deferring_client]
+        $rd EVAL "return 1" 0
+        
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client unpause 
+        assert_match "1" [$rd read]
+        $rd close
+    }
+
+    test "Test multiple clients can be queued up and unblocked" {
+        r client PAUSE 100000000 WRITE
+        set clients [list [redis_deferring_client] [redis_deferring_client] [redis_deferring_client]]
+        foreach client $clients {
+            $client SET FOO BAR
+        }
+        
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {3}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r client unpause
+        foreach client $clients {
+            assert_match "OK" [$client read]
+            $client close
+        }
+    }
+
+    test "Test clients with syntax errors will get responses immediately" {
+        r client PAUSE 100000000 WRITE
+        catch {r set FOO} err
+        assert_match "ERR wrong number of arguments for *" $err
+        r client unpause
+    }
+
+    test "Test both active and passive expiries are skipped during client pause" {
+        set expired_keys [s 0 expired_keys]
+        r multi
+        r set foo bar PX 10
+        r set bar foo PX 10
+        r client PAUSE 100000000 WRITE
+        r exec
+
+        wait_for_condition 10 100 {
+            [r get foo] == {} && [r get bar] == {}
+        } else {
+            fail "Keys were never logically expired"
+        }
+
+        # No keys should actually have been expired
+        assert_match $expired_keys [s 0 expired_keys]
+
+        r client unpause
+
+        # Force the keys to expire
+        r get foo
+        r get bar
+
+        # Now that clients have been unpaused, expires should go through
+        assert_match [expr $expired_keys + 2] [s 0 expired_keys]   
+    }
+
+    test "Test that client pause starts at the end of a transaction" {
+        r MULTI
+        r SET FOO1 BAR
+        r client PAUSE 100000000 WRITE
+        r SET FOO2 BAR
+        r exec
+
+        set rd [redis_deferring_client]
+        $rd SET FOO3 BAR
+        
+        wait_for_condition 50 100 {
+            [s 0 blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+
+        assert_match "BAR" [r GET FOO1]
+        assert_match "BAR" [r GET FOO2]
+        assert_match "" [r GET FOO3]
+
+        r client unpause 
+        assert_match "OK" [$rd read]
+        $rd close
+    }
+
+    start_server {tags {needs:repl external:skip}} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+
+        # Avoid PINGs
+        $master config set repl-ping-replica-period 3600
+        r replicaof $master_host $master_port
+
+        wait_for_condition 50 100 {
+            [s master_link_status] eq {up}
+        } else {
+            fail "Replication not started."
+        }
+
+        test "Test when replica paused, offset would not grow" {
+            $master set foo bar
+            set old_master_offset [status $master master_repl_offset]
+
+            wait_for_condition 50 100 {
+                [s slave_repl_offset] == [status $master master_repl_offset]
+            } else {
+                fail "Replication offset not matched."
+            }
+
+            r client pause 100000 write
+            $master set foo2 bar2
+
+            # Make sure replica received data from master
+            wait_for_condition 50 100 {
+                [s slave_read_repl_offset] == [status $master master_repl_offset]
+            } else {
+                fail "Replication not work."
+            }
+
+            # Replica would not apply the write command
+            assert {[s slave_repl_offset] == $old_master_offset}
+            r get foo2
+        } {}
+
+        test "Test replica offset would grow after unpause" {
+            r client unpause
+            wait_for_condition 50 100 {
+                [s slave_repl_offset] == [status $master master_repl_offset]
+            } else {
+                fail "Replication not continue."
+            }
+            r get foo2
+        } {bar2}
+    }
+
+    # Make sure we unpause at the end
+    r client unpause
+}
diff --git a/redis-stable/tests/unit/pendingquerybuf.tcl b/redis-stable/tests/unit/pendingquerybuf.tcl
new file mode 100644
index 00000000..ebf17fdf
--- /dev/null
+++ b/redis-stable/tests/unit/pendingquerybuf.tcl
@@ -0,0 +1,36 @@
+proc info_memory {r property} {
+    if {[regexp "\r\n$property:(.*?)\r\n" [{*}$r info memory] _ value]} {
+        set _ $value
+    }
+}
+
+proc prepare_value {size} {
+    set _v "c" 
+    for {set i 1} {$i < $size} {incr i} {
+        append _v 0   
+    }
+    return $_v
+}
+
+start_server {tags {"wait"}} {
+start_server {} {
+    set slave [srv 0 client]
+    set slave_host [srv 0 host]
+    set slave_port [srv 0 port]
+    set master [srv -1 client]
+    set master_host [srv -1 host]
+    set master_port [srv -1 port]
+
+    test "pending querybuf: check size of pending_querybuf after set a big value" {
+        $slave slaveof $master_host $master_port
+        set _v [prepare_value [expr 32*1024*1024]]
+        $master set key $_v 
+        wait_for_ofs_sync $master $slave
+
+        wait_for_condition 50 100 {
+            [info_memory $slave used_memory] <= [info_memory $master used_memory] + 10*1024*1024
+        } else {
+            fail "the used_memory of replica is much larger than master."
+        }
+    }  
+}}
diff --git a/redis-stable/tests/unit/printver.tcl b/redis-stable/tests/unit/printver.tcl
new file mode 100644
index 00000000..c80f4514
--- /dev/null
+++ b/redis-stable/tests/unit/printver.tcl
@@ -0,0 +1,6 @@
+start_server {} {
+    set i [r info]
+    regexp {redis_version:(.*?)\r\n} $i - version
+    regexp {redis_git_sha1:(.*?)\r\n} $i - sha1
+    puts "Testing Redis version $version ($sha1)"
+}
diff --git a/redis-stable/tests/unit/protocol.tcl b/redis-stable/tests/unit/protocol.tcl
new file mode 100644
index 00000000..a3d8f7e8
--- /dev/null
+++ b/redis-stable/tests/unit/protocol.tcl
@@ -0,0 +1,209 @@
+start_server {tags {"protocol network"}} {
+    test "Handle an empty query" {
+        reconnect
+        r write "\r\n"
+        r flush
+        assert_equal "PONG" [r ping]
+    }
+
+    test "Negative multibulk length" {
+        reconnect
+        r write "*-10\r\n"
+        r flush
+        assert_equal PONG [r ping]
+    }
+
+    test "Out of range multibulk length" {
+        reconnect
+        r write "*20000000\r\n"
+        r flush
+        assert_error "*invalid multibulk length*" {r read}
+    }
+
+    test "Wrong multibulk payload header" {
+        reconnect
+        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\nfooz\r\n"
+        r flush
+        assert_error "*expected '$', got 'f'*" {r read}
+    }
+
+    test "Negative multibulk payload length" {
+        reconnect
+        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$-10\r\n"
+        r flush
+        assert_error "*invalid bulk length*" {r read}
+    }
+
+    test "Out of range multibulk payload length" {
+        reconnect
+        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$2000000000\r\n"
+        r flush
+        assert_error "*invalid bulk length*" {r read}
+    }
+
+    test "Non-number multibulk payload length" {
+        reconnect
+        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$blabla\r\n"
+        r flush
+        assert_error "*invalid bulk length*" {r read}
+    }
+
+    test "Multi bulk request not followed by bulk arguments" {
+        reconnect
+        r write "*1\r\nfoo\r\n"
+        r flush
+        assert_error "*expected '$', got 'f'*" {r read}
+    }
+
+    test "Generic wrong number of args" {
+        reconnect
+        assert_error "*wrong*arguments*ping*" {r ping x y z}
+    }
+
+    test "Unbalanced number of quotes" {
+        reconnect
+        r write "set \"\"\"test-key\"\"\" test-value\r\n"
+        r write "ping\r\n"
+        r flush
+        assert_error "*unbalanced*" {r read}
+    }
+
+    set c 0
+    foreach seq [list "\x00" "*\x00" "$\x00"] {
+        incr c
+        test "Protocol desync regression test #$c" {
+            if {$::tls} {
+                set s [::tls::socket [srv 0 host] [srv 0 port]]
+            } else {
+                set s [socket [srv 0 host] [srv 0 port]]
+            }
+            puts -nonewline $s $seq
+            set payload [string repeat A 1024]"\n"
+            set test_start [clock seconds]
+            set test_time_limit 30
+            while 1 {
+                if {[catch {
+                    puts -nonewline $s payload
+                    flush $s
+                    incr payload_size [string length $payload]
+                }]} {
+                    set retval [gets $s]
+                    close $s
+                    break
+                } else {
+                    set elapsed [expr {[clock seconds]-$test_start}]
+                    if {$elapsed > $test_time_limit} {
+                        close $s
+                        error "assertion:Redis did not closed connection after protocol desync"
+                    }
+                }
+            }
+            set retval
+        } {*Protocol error*}
+    }
+    unset c
+
+    # recover the broken connection
+    reconnect
+    r ping
+
+    # raw RESP response tests
+    r readraw 1
+
+    test "raw protocol response" {
+        r srandmember nonexisting_key
+    } {*-1}
+
+    r deferred 1
+
+    test "raw protocol response - deferred" {
+        r srandmember nonexisting_key
+        r read
+    } {*-1}
+
+    test "raw protocol response - multiline" {
+        r sadd ss a
+        assert_equal [r read] {:1}
+        r srandmember ss 100
+        assert_equal [r read] {*1}
+        assert_equal [r read] {$1}
+        assert_equal [r read] {a}
+    }
+
+    # restore connection settings
+    r readraw 0
+    r deferred 0
+
+    # check the connection still works
+    assert_equal [r ping] {PONG}
+
+    test {RESP3 attributes} {
+        r hello 3
+        set res [r debug protocol attrib]
+        # currently the parser in redis.tcl ignores the attributes
+
+        # restore state
+        r hello 2
+        set _ $res
+    } {Some real reply following the attribute}
+
+    test {RESP3 attributes readraw} {
+        r hello 3
+        r readraw 1
+        r deferred 1
+
+        r debug protocol attrib
+        assert_equal [r read] {|1}
+        assert_equal [r read] {$14}
+        assert_equal [r read] {key-popularity}
+        assert_equal [r read] {*2}
+        assert_equal [r read] {$7}
+        assert_equal [r read] {key:123}
+        assert_equal [r read] {:90}
+        assert_equal [r read] {$39}
+        assert_equal [r read] {Some real reply following the attribute}
+
+        # restore state
+        r readraw 0
+        r deferred 0
+        r hello 2
+        set _ {}
+    } {}
+
+    test {RESP3 attributes on RESP2} {
+        r hello 2
+        set res [r debug protocol attrib]
+        set _ $res
+    } {Some real reply following the attribute}
+
+    test "test big number parsing" {
+        r hello 3
+        r debug protocol bignum
+    } {1234567999999999999999999999999999999}
+
+    test "test bool parsing" {
+        r hello 3
+        assert_equal [r debug protocol true] 1
+        assert_equal [r debug protocol false] 0
+        r hello 2
+        assert_equal [r debug protocol true] 1
+        assert_equal [r debug protocol false] 0
+        set _ {}
+    } {}
+}
+
+start_server {tags {"regression"}} {
+    test "Regression for a crash with blocking ops and pipelining" {
+        set rd [redis_deferring_client]
+        set fd [r channel]
+        set proto "*3\r\n\$5\r\nBLPOP\r\n\$6\r\nnolist\r\n\$1\r\n0\r\n"
+        puts -nonewline $fd $proto$proto
+        flush $fd
+        set res {}
+
+        $rd rpush nolist a
+        $rd read
+        $rd rpush nolist a
+        $rd read
+    }
+}
diff --git a/redis-stable/tests/unit/pubsub.tcl b/redis-stable/tests/unit/pubsub.tcl
new file mode 100644
index 00000000..03c5dfcc
--- /dev/null
+++ b/redis-stable/tests/unit/pubsub.tcl
@@ -0,0 +1,360 @@
+start_server {tags {"pubsub network"}} {
+    test "Pub/Sub PING" {
+        set rd1 [redis_deferring_client]
+        subscribe $rd1 somechannel
+        # While subscribed to non-zero channels PING works in Pub/Sub mode.
+        $rd1 ping
+        $rd1 ping "foo"
+        set reply1 [$rd1 read]
+        set reply2 [$rd1 read]
+        unsubscribe $rd1 somechannel
+        # Now we are unsubscribed, PING should just return PONG.
+        $rd1 ping
+        set reply3 [$rd1 read]
+        $rd1 close
+        list $reply1 $reply2 $reply3
+    } {{pong {}} {pong foo} PONG}
+
+    test "PUBLISH/SUBSCRIBE basics" {
+        set rd1 [redis_deferring_client]
+
+        # subscribe to two channels
+        assert_equal {1 2} [subscribe $rd1 {chan1 chan2}]
+        assert_equal 1 [r publish chan1 hello]
+        assert_equal 1 [r publish chan2 world]
+        assert_equal {message chan1 hello} [$rd1 read]
+        assert_equal {message chan2 world} [$rd1 read]
+
+        # unsubscribe from one of the channels
+        unsubscribe $rd1 {chan1}
+        assert_equal 0 [r publish chan1 hello]
+        assert_equal 1 [r publish chan2 world]
+        assert_equal {message chan2 world} [$rd1 read]
+
+        # unsubscribe from the remaining channel
+        unsubscribe $rd1 {chan2}
+        assert_equal 0 [r publish chan1 hello]
+        assert_equal 0 [r publish chan2 world]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "PUBLISH/SUBSCRIBE with two clients" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+
+        assert_equal {1} [subscribe $rd1 {chan1}]
+        assert_equal {1} [subscribe $rd2 {chan1}]
+        assert_equal 2 [r publish chan1 hello]
+        assert_equal {message chan1 hello} [$rd1 read]
+        assert_equal {message chan1 hello} [$rd2 read]
+
+        # clean up clients
+        $rd1 close
+        $rd2 close
+    }
+
+    test "PUBLISH/SUBSCRIBE after UNSUBSCRIBE without arguments" {
+        set rd1 [redis_deferring_client]
+        assert_equal {1 2 3} [subscribe $rd1 {chan1 chan2 chan3}]
+        unsubscribe $rd1
+        assert_equal 0 [r publish chan1 hello]
+        assert_equal 0 [r publish chan2 hello]
+        assert_equal 0 [r publish chan3 hello]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "SUBSCRIBE to one channel more than once" {
+        set rd1 [redis_deferring_client]
+        assert_equal {1 1 1} [subscribe $rd1 {chan1 chan1 chan1}]
+        assert_equal 1 [r publish chan1 hello]
+        assert_equal {message chan1 hello} [$rd1 read]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "UNSUBSCRIBE from non-subscribed channels" {
+        set rd1 [redis_deferring_client]
+        assert_equal {0 0 0} [unsubscribe $rd1 {foo bar quux}]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "PUBLISH/PSUBSCRIBE basics" {
+        set rd1 [redis_deferring_client]
+
+        # subscribe to two patterns
+        assert_equal {1 2} [psubscribe $rd1 {foo.* bar.*}]
+        assert_equal 1 [r publish foo.1 hello]
+        assert_equal 1 [r publish bar.1 hello]
+        assert_equal 0 [r publish foo1 hello]
+        assert_equal 0 [r publish barfoo.1 hello]
+        assert_equal 0 [r publish qux.1 hello]
+        assert_equal {pmessage foo.* foo.1 hello} [$rd1 read]
+        assert_equal {pmessage bar.* bar.1 hello} [$rd1 read]
+
+        # unsubscribe from one of the patterns
+        assert_equal {1} [punsubscribe $rd1 {foo.*}]
+        assert_equal 0 [r publish foo.1 hello]
+        assert_equal 1 [r publish bar.1 hello]
+        assert_equal {pmessage bar.* bar.1 hello} [$rd1 read]
+
+        # unsubscribe from the remaining pattern
+        assert_equal {0} [punsubscribe $rd1 {bar.*}]
+        assert_equal 0 [r publish foo.1 hello]
+        assert_equal 0 [r publish bar.1 hello]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "PUBLISH/PSUBSCRIBE with two clients" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+
+        assert_equal {1} [psubscribe $rd1 {chan.*}]
+        assert_equal {1} [psubscribe $rd2 {chan.*}]
+        assert_equal 2 [r publish chan.foo hello]
+        assert_equal {pmessage chan.* chan.foo hello} [$rd1 read]
+        assert_equal {pmessage chan.* chan.foo hello} [$rd2 read]
+
+        # clean up clients
+        $rd1 close
+        $rd2 close
+    }
+
+    test "PUBLISH/PSUBSCRIBE after PUNSUBSCRIBE without arguments" {
+        set rd1 [redis_deferring_client]
+        assert_equal {1 2 3} [psubscribe $rd1 {chan1.* chan2.* chan3.*}]
+        punsubscribe $rd1
+        assert_equal 0 [r publish chan1.hi hello]
+        assert_equal 0 [r publish chan2.hi hello]
+        assert_equal 0 [r publish chan3.hi hello]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "PUNSUBSCRIBE from non-subscribed channels" {
+        set rd1 [redis_deferring_client]
+        assert_equal {0 0 0} [punsubscribe $rd1 {foo.* bar.* quux.*}]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "NUMSUB returns numbers, not strings (#1561)" {
+        r pubsub numsub abc def
+    } {abc 0 def 0}
+
+    test "NUMPATs returns the number of unique patterns" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+
+        # Three unique patterns and one that overlaps
+        psubscribe $rd1 "foo*"
+        psubscribe $rd2 "foo*"
+        psubscribe $rd1 "bar*"
+        psubscribe $rd2 "baz*"
+
+        set patterns [r pubsub numpat]
+
+        # clean up clients
+        punsubscribe $rd1
+        punsubscribe $rd2
+        assert_equal 3 $patterns
+    }
+
+    test "Mix SUBSCRIBE and PSUBSCRIBE" {
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [subscribe $rd1 {foo.bar}]
+        assert_equal {2} [psubscribe $rd1 {foo.*}]
+
+        assert_equal 2 [r publish foo.bar hello]
+        assert_equal {message foo.bar hello} [$rd1 read]
+        assert_equal {pmessage foo.* foo.bar hello} [$rd1 read]
+
+        # clean up clients
+        $rd1 close
+    }
+
+    test "PUNSUBSCRIBE and UNSUBSCRIBE should always reply" {
+        # Make sure we are not subscribed to any channel at all.
+        r punsubscribe
+        r unsubscribe
+        # Now check if the commands still reply correctly.
+        set reply1 [r punsubscribe]
+        set reply2 [r unsubscribe]
+        concat $reply1 $reply2
+    } {punsubscribe {} 0 unsubscribe {} 0}
+
+    ### Keyspace events notification tests
+
+    test "Keyspace notifications: we receive keyspace notifications" {
+        r config set notify-keyspace-events KA
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        assert_equal {pmessage * __keyspace@9__:foo set} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: we receive keyevent notifications" {
+        r config set notify-keyspace-events EA
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        assert_equal {pmessage * __keyevent@9__:set foo} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: we can receive both kind of events" {
+        r config set notify-keyspace-events KEA
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        assert_equal {pmessage * __keyspace@9__:foo set} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:set foo} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: we are able to mask events" {
+        r config set notify-keyspace-events KEl
+        r del mylist
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        r lpush mylist a
+        # No notification for set, because only list commands are enabled.
+        assert_equal {pmessage * __keyspace@9__:mylist lpush} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:lpush mylist} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: general events test" {
+        r config set notify-keyspace-events KEg
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        r expire foo 1
+        r del foo
+        assert_equal {pmessage * __keyspace@9__:foo expire} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:expire foo} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:foo del} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:del foo} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: list events test" {
+        r config set notify-keyspace-events KEl
+        r del mylist
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r lpush mylist a
+        r rpush mylist a
+        r rpop mylist
+        assert_equal {pmessage * __keyspace@9__:mylist lpush} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:lpush mylist} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:mylist rpush} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:rpush mylist} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:mylist rpop} [$rd1 read]
+        assert_equal {pmessage * __keyevent@9__:rpop mylist} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: set events test" {
+        r config set notify-keyspace-events Ks
+        r del myset
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r sadd myset a b c d
+        r srem myset x
+        r sadd myset x y z
+        r srem myset x
+        assert_equal {pmessage * __keyspace@9__:myset sadd} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:myset sadd} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:myset srem} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: zset events test" {
+        r config set notify-keyspace-events Kz
+        r del myzset
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r zadd myzset 1 a 2 b
+        r zrem myzset x
+        r zadd myzset 3 x 4 y 5 z
+        r zrem myzset x
+        assert_equal {pmessage * __keyspace@9__:myzset zadd} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:myzset zadd} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:myzset zrem} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: hash events test" {
+        r config set notify-keyspace-events Kh
+        r del myhash
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r hmset myhash yes 1 no 0
+        r hincrby myhash yes 10
+        assert_equal {pmessage * __keyspace@9__:myhash hset} [$rd1 read]
+        assert_equal {pmessage * __keyspace@9__:myhash hincrby} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: expired events (triggered expire)" {
+        r config set notify-keyspace-events Ex
+        r del foo
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r psetex foo 100 1
+        wait_for_condition 50 100 {
+            [r exists foo] == 0
+        } else {
+            fail "Key does not expire?!"
+        }
+        assert_equal {pmessage * __keyevent@9__:expired foo} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: expired events (background expire)" {
+        r config set notify-keyspace-events Ex
+        r del foo
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r psetex foo 100 1
+        assert_equal {pmessage * __keyevent@9__:expired foo} [$rd1 read]
+        $rd1 close
+    }
+
+    test "Keyspace notifications: evicted events" {
+        r config set notify-keyspace-events Ee
+        r config set maxmemory-policy allkeys-lru
+        r flushdb
+        set rd1 [redis_deferring_client]
+        assert_equal {1} [psubscribe $rd1 *]
+        r set foo bar
+        r config set maxmemory 1
+        assert_equal {pmessage * __keyevent@9__:evicted foo} [$rd1 read]
+        r config set maxmemory 0
+        $rd1 close
+    }
+
+    test "Keyspace notifications: test CONFIG GET/SET of event flags" {
+        r config set notify-keyspace-events gKE
+        assert_equal {gKE} [lindex [r config get notify-keyspace-events] 1]
+        r config set notify-keyspace-events {$lshzxeKE}
+        assert_equal {$lshzxeKE} [lindex [r config get notify-keyspace-events] 1]
+        r config set notify-keyspace-events KA
+        assert_equal {AK} [lindex [r config get notify-keyspace-events] 1]
+        r config set notify-keyspace-events EA
+        assert_equal {AE} [lindex [r config get notify-keyspace-events] 1]
+    }
+}
diff --git a/redis-stable/tests/unit/quit.tcl b/redis-stable/tests/unit/quit.tcl
new file mode 100644
index 00000000..4cf440ab
--- /dev/null
+++ b/redis-stable/tests/unit/quit.tcl
@@ -0,0 +1,40 @@
+start_server {tags {"quit"}} {
+    proc format_command {args} {
+        set cmd "*[llength $args]\r\n"
+        foreach a $args {
+            append cmd "$[string length $a]\r\n$a\r\n"
+        }
+        set _ $cmd
+    }
+
+    test "QUIT returns OK" {
+        reconnect
+        assert_equal OK [r quit]
+        assert_error * {r ping}
+    }
+
+    test "Pipelined commands after QUIT must not be executed" {
+        reconnect
+        r write [format_command quit]
+        r write [format_command set foo bar]
+        r flush
+        assert_equal OK [r read]
+        assert_error * {r read}
+
+        reconnect
+        assert_equal {} [r get foo]
+    }
+
+    test "Pipelined commands after QUIT that exceed read buffer size" {
+        reconnect
+        r write [format_command quit]
+        r write [format_command set foo [string repeat "x" 1024]]
+        r flush
+        assert_equal OK [r read]
+        assert_error * {r read}
+
+        reconnect
+        assert_equal {} [r get foo]
+
+    }
+}
diff --git a/redis-stable/tests/unit/scan.tcl b/redis-stable/tests/unit/scan.tcl
new file mode 100644
index 00000000..3981a223
--- /dev/null
+++ b/redis-stable/tests/unit/scan.tcl
@@ -0,0 +1,330 @@
+start_server {tags {"scan network"}} {
+    test "SCAN basic" {
+        r flushdb
+        r debug populate 1000
+
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        set keys [lsort -unique $keys]
+        assert_equal 1000 [llength $keys]
+    }
+
+    test "SCAN COUNT" {
+        r flushdb
+        r debug populate 1000
+
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur count 5]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        set keys [lsort -unique $keys]
+        assert_equal 1000 [llength $keys]
+    }
+
+    test "SCAN MATCH" {
+        r flushdb
+        r debug populate 1000
+
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur match "key:1??"]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        set keys [lsort -unique $keys]
+        assert_equal 100 [llength $keys]
+    }
+
+    test "SCAN TYPE" {
+        r flushdb
+        # populate only creates strings
+        r debug populate 1000
+
+        # Check non-strings are excluded
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur type "list"]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        assert_equal 0 [llength $keys]
+
+        # Check strings are included
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur type "string"]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        assert_equal 1000 [llength $keys]
+
+        # Check all three args work together
+        set cur 0
+        set keys {}
+        while 1 {
+            set res [r scan $cur type "string" match "key:*" count 10]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+        }
+
+        assert_equal 1000 [llength $keys]
+    }
+
+    foreach enc {intset hashtable} {
+        test "SSCAN with encoding $enc" {
+            # Create the Set
+            r del set
+            if {$enc eq {intset}} {
+                set prefix ""
+            } else {
+                set prefix "ele:"
+            }
+            set elements {}
+            for {set j 0} {$j < 100} {incr j} {
+                lappend elements ${prefix}${j}
+            }
+            r sadd set {*}$elements
+
+            # Verify that the encoding matches.
+            assert {[r object encoding set] eq $enc}
+
+            # Test SSCAN
+            set cur 0
+            set keys {}
+            while 1 {
+                set res [r sscan set $cur]
+                set cur [lindex $res 0]
+                set k [lindex $res 1]
+                lappend keys {*}$k
+                if {$cur == 0} break
+            }
+
+            set keys [lsort -unique $keys]
+            assert_equal 100 [llength $keys]
+        }
+    }
+
+    foreach enc {ziplist hashtable} {
+        test "HSCAN with encoding $enc" {
+            # Create the Hash
+            r del hash
+            if {$enc eq {ziplist}} {
+                set count 30
+            } else {
+                set count 1000
+            }
+            set elements {}
+            for {set j 0} {$j < $count} {incr j} {
+                lappend elements key:$j $j
+            }
+            r hmset hash {*}$elements
+
+            # Verify that the encoding matches.
+            assert {[r object encoding hash] eq $enc}
+
+            # Test HSCAN
+            set cur 0
+            set keys {}
+            while 1 {
+                set res [r hscan hash $cur]
+                set cur [lindex $res 0]
+                set k [lindex $res 1]
+                lappend keys {*}$k
+                if {$cur == 0} break
+            }
+
+            set keys2 {}
+            foreach {k v} $keys {
+                assert {$k eq "key:$v"}
+                lappend keys2 $k
+            }
+
+            set keys2 [lsort -unique $keys2]
+            assert_equal $count [llength $keys2]
+        }
+    }
+
+    foreach enc {ziplist skiplist} {
+        test "ZSCAN with encoding $enc" {
+            # Create the Sorted Set
+            r del zset
+            if {$enc eq {ziplist}} {
+                set count 30
+            } else {
+                set count 1000
+            }
+            set elements {}
+            for {set j 0} {$j < $count} {incr j} {
+                lappend elements $j key:$j
+            }
+            r zadd zset {*}$elements
+
+            # Verify that the encoding matches.
+            assert {[r object encoding zset] eq $enc}
+
+            # Test ZSCAN
+            set cur 0
+            set keys {}
+            while 1 {
+                set res [r zscan zset $cur]
+                set cur [lindex $res 0]
+                set k [lindex $res 1]
+                lappend keys {*}$k
+                if {$cur == 0} break
+            }
+
+            set keys2 {}
+            foreach {k v} $keys {
+                assert {$k eq "key:$v"}
+                lappend keys2 $k
+            }
+
+            set keys2 [lsort -unique $keys2]
+            assert_equal $count [llength $keys2]
+        }
+    }
+
+    test "SCAN guarantees check under write load" {
+        r flushdb
+        r debug populate 100
+
+        # We start scanning here, so keys from 0 to 99 should all be
+        # reported at the end of the iteration.
+        set keys {}
+        while 1 {
+            set res [r scan $cur]
+            set cur [lindex $res 0]
+            set k [lindex $res 1]
+            lappend keys {*}$k
+            if {$cur == 0} break
+            # Write 10 random keys at every SCAN iteration.
+            for {set j 0} {$j < 10} {incr j} {
+                r set addedkey:[randomInt 1000] foo
+            }
+        }
+
+        set keys2 {}
+        foreach k $keys {
+            if {[string length $k] > 6} continue
+            lappend keys2 $k
+        }
+
+        set keys2 [lsort -unique $keys2]
+        assert_equal 100 [llength $keys2]
+    }
+
+    test "SSCAN with integer encoded object (issue #1345)" {
+        set objects {1 a}
+        r del set
+        r sadd set {*}$objects
+        set res [r sscan set 0 MATCH *a* COUNT 100]
+        assert_equal [lsort -unique [lindex $res 1]] {a}
+        set res [r sscan set 0 MATCH *1* COUNT 100]
+        assert_equal [lsort -unique [lindex $res 1]] {1}
+    }
+
+    test "SSCAN with PATTERN" {
+        r del mykey
+        r sadd mykey foo fab fiz foobar 1 2 3 4
+        set res [r sscan mykey 0 MATCH foo* COUNT 10000]
+        lsort -unique [lindex $res 1]
+    } {foo foobar}
+
+    test "HSCAN with PATTERN" {
+        r del mykey
+        r hmset mykey foo 1 fab 2 fiz 3 foobar 10 1 a 2 b 3 c 4 d
+        set res [r hscan mykey 0 MATCH foo* COUNT 10000]
+        lsort -unique [lindex $res 1]
+    } {1 10 foo foobar}
+
+    test "ZSCAN with PATTERN" {
+        r del mykey
+        r zadd mykey 1 foo 2 fab 3 fiz 10 foobar
+        set res [r zscan mykey 0 MATCH foo* COUNT 10000]
+        lsort -unique [lindex $res 1]
+    }
+
+    test "ZSCAN scores: regression test for issue #2175" {
+        r del mykey
+        for {set j 0} {$j < 500} {incr j} {
+            r zadd mykey 9.8813129168249309e-323 $j
+        }
+        set res [lindex [r zscan mykey 0] 1]
+        set first_score [lindex $res 1]
+        assert {$first_score != 0}
+    }
+
+    test "SCAN regression test for issue #4906" {
+        for {set k 0} {$k < 100} {incr k} {
+            r del set
+            r sadd set x; # Make sure it's not intset encoded
+            set toremove {}
+            unset -nocomplain found
+            array set found {}
+
+            # Populate the set
+            set numele [expr {101+[randomInt 1000]}]
+            for {set j 0} {$j < $numele} {incr j} {
+                r sadd set $j
+                if {$j >= 100} {
+                    lappend toremove $j
+                }
+            }
+
+            # Start scanning
+            set cursor 0
+            set iteration 0
+            set del_iteration [randomInt 10]
+            while {!($cursor == 0 && $iteration != 0)} {
+                lassign [r sscan set $cursor] cursor items
+
+                # Mark found items. We expect to find from 0 to 99 at the end
+                # since those elements will never be removed during the scanning.
+                foreach i $items {
+                    set found($i) 1
+                }
+                incr iteration
+                # At some point remove most of the items to trigger the
+                # rehashing to a smaller hash table.
+                if {$iteration == $del_iteration} {
+                    r srem set {*}$toremove
+                }
+            }
+
+            # Verify that SSCAN reported everything from 0 to 99
+            for {set j 0} {$j < 100} {incr j} {
+                if {![info exists found($j)]} {
+                    fail "SSCAN element missing $j"
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/scripting.tcl b/redis-stable/tests/unit/scripting.tcl
new file mode 100644
index 00000000..cd6646dc
--- /dev/null
+++ b/redis-stable/tests/unit/scripting.tcl
@@ -0,0 +1,940 @@
+start_server {tags {"scripting"}} {
+    test {EVAL - Does Lua interpreter replies to our requests?} {
+        r eval {return 'hello'} 0
+    } {hello}
+
+    test {EVAL - Lua integer -> Redis protocol type conversion} {
+        r eval {return 100.5} 0
+    } {100}
+
+    test {EVAL - Lua string -> Redis protocol type conversion} {
+        r eval {return 'hello world'} 0
+    } {hello world}
+
+    test {EVAL - Lua true boolean -> Redis protocol type conversion} {
+        r eval {return true} 0
+    } {1}
+
+    test {EVAL - Lua false boolean -> Redis protocol type conversion} {
+        r eval {return false} 0
+    } {}
+
+    test {EVAL - Lua status code reply -> Redis protocol type conversion} {
+        r eval {return {ok='fine'}} 0
+    } {fine}
+
+    test {EVAL - Lua error reply -> Redis protocol type conversion} {
+        catch {
+            r eval {return {err='this is an error'}} 0
+        } e
+        set _ $e
+    } {this is an error}
+
+    test {EVAL - Lua table -> Redis protocol type conversion} {
+        r eval {return {1,2,3,'ciao',{1,2}}} 0
+    } {1 2 3 ciao {1 2}}
+
+    test {EVAL - Are the KEYS and ARGV arrays populated correctly?} {
+        r eval {return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}} 2 a b c d
+    } {a b c d}
+
+    test {EVAL - is Lua able to call Redis API?} {
+        r set mykey myval
+        r eval {return redis.call('get',KEYS[1])} 1 mykey
+    } {myval}
+
+    test {EVALSHA - Can we call a SHA1 if already defined?} {
+        r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey
+    } {myval}
+
+    test {EVALSHA - Can we call a SHA1 in uppercase?} {
+        r evalsha FD758D1589D044DD850A6F05D52F2EEFD27F033F 1 mykey
+    } {myval}
+
+    test {EVALSHA - Do we get an error on invalid SHA1?} {
+        catch {r evalsha NotValidShaSUM 0} e
+        set _ $e
+    } {NOSCRIPT*}
+
+    test {EVALSHA - Do we get an error on non defined SHA1?} {
+        catch {r evalsha ffd632c7d33e571e9f24556ebed26c3479a87130 0} e
+        set _ $e
+    } {NOSCRIPT*}
+
+    test {EVAL - Redis integer -> Lua type conversion} {
+        r set x 0
+        r eval {
+            local foo = redis.pcall('incr',KEYS[1])
+            return {type(foo),foo}
+        } 1 x
+    } {number 1}
+
+    test {EVAL - Redis bulk -> Lua type conversion} {
+        r set mykey myval
+        r eval {
+            local foo = redis.pcall('get',KEYS[1])
+            return {type(foo),foo}
+        } 1 mykey
+    } {string myval}
+
+    test {EVAL - Redis multi bulk -> Lua type conversion} {
+        r del mylist
+        r rpush mylist a
+        r rpush mylist b
+        r rpush mylist c
+        r eval {
+            local foo = redis.pcall('lrange',KEYS[1],0,-1)
+            return {type(foo),foo[1],foo[2],foo[3],# foo}
+        } 1 mylist
+    } {table a b c 3}
+
+    test {EVAL - Redis status reply -> Lua type conversion} {
+        r eval {
+            local foo = redis.pcall('set',KEYS[1],'myval')
+            return {type(foo),foo['ok']}
+        } 1 mykey
+    } {table OK}
+
+    test {EVAL - Redis error reply -> Lua type conversion} {
+        r set mykey myval
+        r eval {
+            local foo = redis.pcall('incr',KEYS[1])
+            return {type(foo),foo['err']}
+        } 1 mykey
+    } {table {ERR value is not an integer or out of range}}
+
+    test {EVAL - Redis nil bulk reply -> Lua type conversion} {
+        r del mykey
+        r eval {
+            local foo = redis.pcall('get',KEYS[1])
+            return {type(foo),foo == false}
+        } 1 mykey
+    } {boolean 1}
+
+    test {EVAL - Is the Lua client using the currently selected DB?} {
+        r set mykey "this is DB 9"
+        r select 10
+        r set mykey "this is DB 10"
+        r eval {return redis.pcall('get',KEYS[1])} 1 mykey
+    } {this is DB 10}
+
+    test {EVAL - SELECT inside Lua should not affect the caller} {
+        # here we DB 10 is selected
+        r set mykey "original value"
+        r eval {return redis.pcall('select','9')} 0
+        set res [r get mykey]
+        r select 9
+        set res
+    } {original value}
+
+    if 0 {
+        test {EVAL - Script can't run more than configured time limit} {
+            r config set lua-time-limit 1
+            catch {
+                r eval {
+                    local i = 0
+                    while true do i=i+1 end
+                } 0
+            } e
+            set _ $e
+        } {*execution time*}
+    }
+
+    test {EVAL - Scripts can't run blpop command} {
+        set e {}
+        catch {r eval {return redis.pcall('blpop','x',0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run brpop command} {
+        set e {}
+        catch {r eval {return redis.pcall('brpop','empty_list',0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run brpoplpush command} {
+        set e {}
+        catch {r eval {return redis.pcall('brpoplpush','empty_list1', 'empty_list2',0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run blmove command} {
+        set e {}
+        catch {r eval {return redis.pcall('blmove','empty_list1', 'empty_list2', 'LEFT', 'LEFT', 0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run bzpopmin command} {
+        set e {}
+        catch {r eval {return redis.pcall('bzpopmin','empty_zset', 0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run bzpopmax command} {
+        set e {}
+        catch {r eval {return redis.pcall('bzpopmax','empty_zset', 0)} 0} e
+        set e
+    } {*not allowed*}
+
+    test {EVAL - Scripts can't run XREAD and XREADGROUP with BLOCK option} {
+        r del s
+        r xgroup create s g $ MKSTREAM
+        set res [r eval {return redis.pcall('xread','STREAMS','s','$')} 1 s]
+        assert {$res eq {}}
+        assert_error "*xread command is not allowed with BLOCK option from scripts" {r eval {return redis.pcall('xread','BLOCK',0,'STREAMS','s','$')} 1 s}
+        set res [r eval {return redis.pcall('xreadgroup','group','g','c','STREAMS','s','>')} 1 s]
+        assert {$res eq {}}
+        assert_error "*xreadgroup command is not allowed with BLOCK option from scripts" {r eval {return redis.pcall('xreadgroup','group','g','c','BLOCK',0,'STREAMS','s','>')} 1 s}
+    }
+
+    test {EVAL - Scripts can't run certain commands} {
+        set e {}
+        r debug lua-always-replicate-commands 0
+        catch {
+            r eval "redis.pcall('randomkey'); return redis.pcall('set','x','ciao')" 0
+        } e
+        r debug lua-always-replicate-commands 1
+        set e
+    } {*not allowed after*}
+
+    test {EVAL - No arguments to redis.call/pcall is considered an error} {
+        set e {}
+        catch {r eval {return redis.call()} 0} e
+        set e
+    } {*one argument*}
+
+    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
+        set e {}
+        catch {
+            r eval "redis.call('nosuchcommand')" 0
+        } e
+        set e
+    } {*Unknown Redis*}
+
+    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
+        set e {}
+        catch {
+            r eval "redis.call('get','a','b','c')" 0
+        } e
+        set e
+    } {*number of args*}
+
+    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
+        set e {}
+        r set foo bar
+        catch {
+            r eval {redis.call('lpush',KEYS[1],'val')} 1 foo
+        } e
+        set e
+    } {*against a key*}
+
+    test {EVAL - JSON numeric decoding} {
+        # We must return the table as a string because otherwise
+        # Redis converts floats to ints and we get 0 and 1023 instead
+        # of 0.0003 and 1023.2 as the parsed output.
+        r eval {return
+                 table.concat(
+                   cjson.decode(
+                    "[0.0, -5e3, -1, 0.3e-3, 1023.2, 0e10]"), " ")
+        } 0
+    } {0 -5000 -1 0.0003 1023.2 0}
+
+    test {EVAL - JSON string decoding} {
+        r eval {local decoded = cjson.decode('{"keya": "a", "keyb": "b"}')
+                return {decoded.keya, decoded.keyb}
+        } 0
+    } {a b}
+
+    test {EVAL - cmsgpack can pack double?} {
+        r eval {local encoded = cmsgpack.pack(0.1)
+                local h = ""
+                for i = 1, #encoded do
+                    h = h .. string.format("%02x",string.byte(encoded,i))
+                end
+                return h
+        } 0
+    } {cb3fb999999999999a}
+
+    test {EVAL - cmsgpack can pack negative int64?} {
+        r eval {local encoded = cmsgpack.pack(-1099511627776)
+                local h = ""
+                for i = 1, #encoded do
+                    h = h .. string.format("%02x",string.byte(encoded,i))
+                end
+                return h
+        } 0
+    } {d3ffffff0000000000}
+
+    test {EVAL - cmsgpack can pack and unpack circular references?} {
+        r eval {local a = {x=nil,y=5}
+                local b = {x=a}
+                a['x'] = b
+                local encoded = cmsgpack.pack(a)
+                local h = ""
+                -- cmsgpack encodes to a depth of 16, but can't encode
+                -- references, so the encoded object has a deep copy recusive
+                -- depth of 16.
+                for i = 1, #encoded do
+                    h = h .. string.format("%02x",string.byte(encoded,i))
+                end
+                -- when unpacked, re.x.x != re because the unpack creates
+                -- individual tables down to a depth of 16.
+                -- (that's why the encoded output is so large)
+                local re = cmsgpack.unpack(encoded)
+                assert(re)
+                assert(re.x)
+                assert(re.x.x.y == re.y)
+                assert(re.x.x.x.x.y == re.y)
+                assert(re.x.x.x.x.x.x.y == re.y)
+                assert(re.x.x.x.x.x.x.x.x.x.x.y == re.y)
+                -- maximum working depth:
+                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.y == re.y)
+                -- now the last x would be b above and has no y
+                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x)
+                -- so, the final x.x is at the depth limit and was assigned nil
+                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x == nil)
+                return {h, re.x.x.x.x.x.x.x.x.y == re.y, re.y == 5}
+        } 0
+    } {82a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a178c0 1 1}
+
+    test {EVAL - Numerical sanity check from bitop} {
+        r eval {assert(0x7fffffff == 2147483647, "broken hex literals");
+                assert(0xffffffff == -1 or 0xffffffff == 2^32-1,
+                    "broken hex literals");
+                assert(tostring(-1) == "-1", "broken tostring()");
+                assert(tostring(0xffffffff) == "-1" or
+                    tostring(0xffffffff) == "4294967295",
+                    "broken tostring()")
+        } 0
+    } {}
+
+    test {EVAL - Verify minimal bitop functionality} {
+        r eval {assert(bit.tobit(1) == 1);
+                assert(bit.band(1) == 1);
+                assert(bit.bxor(1,2) == 3);
+                assert(bit.bor(1,2,4,8,16,32,64,128) == 255)
+        } 0
+    } {}
+
+    test {EVAL - Able to parse trailing comments} {
+        r eval {return 'hello' --trailing comment} 0
+    } {hello}
+
+    test {SCRIPTING FLUSH - is able to clear the scripts cache?} {
+        r set mykey myval
+        set v [r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey]
+        assert_equal $v myval
+        set e ""
+        r script flush
+        catch {r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey} e
+        set e
+    } {NOSCRIPT*}
+
+    test {SCRIPTING FLUSH ASYNC} {
+        for {set j 0} {$j < 100} {incr j} {
+            r script load "return $j"
+        }
+        assert { [string match "*number_of_cached_scripts:100*" [r info Memory]] }
+        r script flush async
+        assert { [string match "*number_of_cached_scripts:0*" [r info Memory]] }
+    }
+
+    test {SCRIPT EXISTS - can detect already defined scripts?} {
+        r eval "return 1+1" 0
+        r script exists a27e7e8a43702b7046d4f6a7ccf5b60cef6b9bd9 a27e7e8a43702b7046d4f6a7ccf5b60cef6b9bda
+    } {1 0}
+
+    test {SCRIPT LOAD - is able to register scripts in the scripting cache} {
+        list \
+            [r script load "return 'loaded'"] \
+            [r evalsha b534286061d4b9e4026607613b95c06c06015ae8 0]
+    } {b534286061d4b9e4026607613b95c06c06015ae8 loaded}
+
+    test "In the context of Lua the output of random commands gets ordered" {
+        r debug lua-always-replicate-commands 0
+        r del myset
+        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
+        set res [r eval {return redis.call('smembers',KEYS[1])} 1 myset]
+        r debug lua-always-replicate-commands 1
+        set res
+    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
+
+    test "SORT is normally not alpha re-ordered for the scripting engine" {
+        r del myset
+        r sadd myset 1 2 3 4 10
+        r eval {return redis.call('sort',KEYS[1],'desc')} 1 myset
+    } {10 4 3 2 1}
+
+    test "SORT BY <constant> output gets ordered for scripting" {
+        r del myset
+        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
+        r eval {return redis.call('sort',KEYS[1],'by','_')} 1 myset
+    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
+
+    test "SORT BY <constant> with GET gets ordered for scripting" {
+        r del myset
+        r sadd myset a b c
+        r eval {return redis.call('sort',KEYS[1],'by','_','get','#','get','_:*')} 1 myset
+    } {a {} b {} c {}}
+
+    test "redis.sha1hex() implementation" {
+        list [r eval {return redis.sha1hex('')} 0] \
+             [r eval {return redis.sha1hex('Pizza & Mandolino')} 0]
+    } {da39a3ee5e6b4b0d3255bfef95601890afd80709 74822d82031af7493c20eefa13bd07ec4fada82f}
+
+    test {Globals protection reading an undeclared global variable} {
+        catch {r eval {return a} 0} e
+        set e
+    } {*ERR*attempted to access * global*}
+
+    test {Globals protection setting an undeclared global*} {
+        catch {r eval {a=10} 0} e
+        set e
+    } {*ERR*attempted to create global*}
+
+    test {Test an example script DECR_IF_GT} {
+        set decr_if_gt {
+            local current
+
+            current = redis.call('get',KEYS[1])
+            if not current then return nil end
+            if current > ARGV[1] then
+                return redis.call('decr',KEYS[1])
+            else
+                return redis.call('get',KEYS[1])
+            end
+        }
+        r set foo 5
+        set res {}
+        lappend res [r eval $decr_if_gt 1 foo 2]
+        lappend res [r eval $decr_if_gt 1 foo 2]
+        lappend res [r eval $decr_if_gt 1 foo 2]
+        lappend res [r eval $decr_if_gt 1 foo 2]
+        lappend res [r eval $decr_if_gt 1 foo 2]
+        set res
+    } {4 3 2 2 2}
+
+    test {Scripting engine resets PRNG at every script execution} {
+        set rand1 [r eval {return tostring(math.random())} 0]
+        set rand2 [r eval {return tostring(math.random())} 0]
+        assert_equal $rand1 $rand2
+    }
+
+    test {Scripting engine PRNG can be seeded correctly} {
+        set rand1 [r eval {
+            math.randomseed(ARGV[1]); return tostring(math.random())
+        } 0 10]
+        set rand2 [r eval {
+            math.randomseed(ARGV[1]); return tostring(math.random())
+        } 0 10]
+        set rand3 [r eval {
+            math.randomseed(ARGV[1]); return tostring(math.random())
+        } 0 20]
+        assert_equal $rand1 $rand2
+        assert {$rand2 ne $rand3}
+    }
+
+    test {EVAL does not leak in the Lua stack} {
+        r set x 0
+        # Use a non blocking client to speedup the loop.
+        set rd [redis_deferring_client]
+        for {set j 0} {$j < 10000} {incr j} {
+            $rd eval {return redis.call("incr",KEYS[1])} 1 x
+        }
+        for {set j 0} {$j < 10000} {incr j} {
+            $rd read
+        }
+        assert {[s used_memory_lua] < 1024*100}
+        $rd close
+        r get x
+    } {10000}
+
+    test {EVAL processes writes from AOF in read-only slaves} {
+        r flushall
+        r config set appendonly yes
+        r config set aof-use-rdb-preamble no
+        r eval {redis.call("set",KEYS[1],"100")} 1 foo
+        r eval {redis.call("incr",KEYS[1])} 1 foo
+        r eval {redis.call("incr",KEYS[1])} 1 foo
+        wait_for_condition 50 100 {
+            [s aof_rewrite_in_progress] == 0
+        } else {
+            fail "AOF rewrite can't complete after CONFIG SET appendonly yes."
+        }
+        r config set slave-read-only yes
+        r slaveof 127.0.0.1 0
+        r debug loadaof
+        set res [r get foo]
+        r slaveof no one
+        set res
+    } {102}
+    r config set aof-use-rdb-preamble yes
+
+    test {EVAL timeout from AOF} {
+        # generate a long running script that is propagated to the AOF as script
+        # make sure that the script times out during loading
+        r config set appendonly no
+        r config set aof-use-rdb-preamble no
+        r config set lua-replicate-commands no
+        r flushall
+        r config set appendonly yes
+        wait_for_condition 50 100 {
+            [s aof_rewrite_in_progress] == 0
+        } else {
+            fail "AOF rewrite can't complete after CONFIG SET appendonly yes."
+        }
+        r config set lua-time-limit 1
+        set rd [redis_deferring_client]
+        set start [clock clicks -milliseconds]
+        $rd eval {redis.call('set',KEYS[1],'y'); for i=1,1500000 do redis.call('ping') end return 'ok'} 1 x
+        $rd flush
+        after 100
+        catch {r ping} err
+        assert_match {BUSY*} $err
+        $rd read
+        set elapsed [expr [clock clicks -milliseconds]-$start]
+        if {$::verbose} { puts "script took $elapsed milliseconds" }
+        set start [clock clicks -milliseconds]
+        $rd debug loadaof
+        $rd flush
+        after 100
+        catch {r ping} err
+        assert_match {LOADING*} $err
+        $rd read
+        set elapsed [expr [clock clicks -milliseconds]-$start]
+        if {$::verbose} { puts "loading took $elapsed milliseconds" }
+        $rd close
+        r get x
+    } {y}
+
+    test {We can call scripts rewriting client->argv from Lua} {
+        r del myset
+        r sadd myset a b c
+        r mset a 1 b 2 c 3 d 4
+        assert {[r spop myset] ne {}}
+        assert {[r spop myset 1] ne {}}
+        assert {[r spop myset] ne {}}
+        assert {[r mget a b c d] eq {1 2 3 4}}
+        assert {[r spop myset] eq {}}
+    }
+
+    test {Call Redis command with many args from Lua (issue #1764)} {
+        r eval {
+            local i
+            local x={}
+            redis.call('del','mylist')
+            for i=1,100 do
+                table.insert(x,i)
+            end
+            redis.call('rpush','mylist',unpack(x))
+            return redis.call('lrange','mylist',0,-1)
+        } 0
+    } {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100}
+
+    test {Number conversion precision test (issue #1118)} {
+        r eval {
+              local value = 9007199254740991
+              redis.call("set","foo",value)
+              return redis.call("get","foo")
+        } 0
+    } {9007199254740991}
+
+    test {String containing number precision test (regression of issue #1118)} {
+        r eval {
+            redis.call("set", "key", "12039611435714932082")
+            return redis.call("get", "key")
+        } 0
+    } {12039611435714932082}
+
+    test {Verify negative arg count is error instead of crash (issue #1842)} {
+        catch { r eval { return "hello" } -12 } e
+        set e
+    } {ERR Number of keys can't be negative}
+
+    test {Correct handling of reused argv (issue #1939)} {
+        r eval {
+              for i = 0, 10 do
+                  redis.call('SET', 'a', '1')
+                  redis.call('MGET', 'a', 'b', 'c')
+                  redis.call('EXPIRE', 'a', 0)
+                  redis.call('GET', 'a')
+                  redis.call('MGET', 'a', 'b', 'c')
+              end
+        } 0
+    }
+
+    test {Functions in the Redis namespace are able to report errors} {
+        catch {
+            r eval {
+                  redis.sha1hex()
+            } 0
+        } e
+        set e
+    } {*wrong number*}
+
+    test {Script with RESP3 map} {
+        set expected_dict [dict create field value]
+        set expected_list [list field value]
+
+        # Sanity test for RESP3 without scripts
+        r HELLO 3
+        r hset hash field value
+        set res [r hgetall hash]
+        assert_equal $res $expected_dict
+
+        # Test RESP3 client with script in both RESP2 and RESP3 modes
+        set res [r eval {redis.setresp(3); return redis.call('hgetall', KEYS[1])} 1 hash]
+        assert_equal $res $expected_dict
+        set res [r eval {redis.setresp(2); return redis.call('hgetall', KEYS[1])} 1 hash]
+        assert_equal $res $expected_list
+
+        # Test RESP2 client with script in both RESP2 and RESP3 modes
+        r HELLO 2
+        set res [r eval {redis.setresp(3); return redis.call('hgetall', KEYS[1])} 1 hash]
+        assert_equal $res $expected_list
+        set res [r eval {redis.setresp(2); return redis.call('hgetall', KEYS[1])} 1 hash]
+        assert_equal $res $expected_list
+    }
+}
+
+# Start a new server since the last test in this stanza will kill the
+# instance at all.
+start_server {tags {"scripting"}} {
+    test {Timedout read-only scripts can be killed by SCRIPT KILL} {
+        set rd [redis_deferring_client]
+        r config set lua-time-limit 10
+        $rd eval {while true do end} 0
+        after 200
+        catch {r ping} e
+        assert_match {BUSY*} $e
+        r script kill
+        after 200 ; # Give some time to Lua to call the hook again...
+        assert_equal [r ping] "PONG"
+    }
+
+    test {Timedout read-only scripts can be killed by SCRIPT KILL even when use pcall} {
+        set rd [redis_deferring_client]
+        r config set lua-time-limit 10
+        $rd eval {local f = function() while 1 do redis.call('ping') end end while 1 do pcall(f) end} 0
+        
+        wait_for_condition 50 100 {
+            [catch {r ping} e] == 1
+        } else {
+            fail "Can't wait for script to start running"
+        }
+        catch {r ping} e
+        assert_match {BUSY*} $e
+
+        r script kill
+
+        wait_for_condition 50 100 {
+            [catch {r ping} e] == 0
+        } else {
+            fail "Can't wait for script to be killed"
+        }
+        assert_equal [r ping] "PONG"
+
+        catch {$rd read} res
+        $rd close
+
+        assert_match {*killed by user*} $res        
+    }
+
+    test {Timedout script does not cause a false dead client} {
+        set rd [redis_deferring_client]
+        r config set lua-time-limit 10
+
+        # senging (in a pipeline):
+        # 1. eval "while 1 do redis.call('ping') end" 0
+        # 2. ping
+        set buf "*3\r\n\$4\r\neval\r\n\$33\r\nwhile 1 do redis.call('ping') end\r\n\$1\r\n0\r\n"
+        append buf "*1\r\n\$4\r\nping\r\n"
+        $rd write $buf
+        $rd flush
+
+        wait_for_condition 50 100 {
+            [catch {r ping} e] == 1
+        } else {
+            fail "Can't wait for script to start running"
+        }
+        catch {r ping} e
+        assert_match {BUSY*} $e
+
+        r script kill
+        wait_for_condition 50 100 {
+            [catch {r ping} e] == 0
+        } else {
+            fail "Can't wait for script to be killed"
+        }
+        assert_equal [r ping] "PONG"
+
+        catch {$rd read} res
+        assert_match {*killed by user*} $res
+
+        set res [$rd read]
+        assert_match {*PONG*} $res        
+
+        $rd close
+    }
+
+    test {Timedout script link is still usable after Lua returns} {
+        r config set lua-time-limit 10
+        r eval {for i=1,100000 do redis.call('ping') end return 'ok'} 0
+        r ping
+    } {PONG}
+
+    test {Timedout scripts that modified data can't be killed by SCRIPT KILL} {
+        set rd [redis_deferring_client]
+        r config set lua-time-limit 10
+        $rd eval {redis.call('set',KEYS[1],'y'); while true do end} 1 x
+        after 200
+        catch {r ping} e
+        assert_match {BUSY*} $e
+        catch {r script kill} e
+        assert_match {UNKILLABLE*} $e
+        catch {r ping} e
+        assert_match {BUSY*} $e
+    }
+
+    # Note: keep this test at the end of this server stanza because it
+    # kills the server.
+    test {SHUTDOWN NOSAVE can kill a timedout script anyway} {
+        # The server should be still unresponding to normal commands.
+        catch {r ping} e
+        assert_match {BUSY*} $e
+        catch {r shutdown nosave}
+        # Make sure the server was killed
+        catch {set rd [redis_deferring_client]} e
+        assert_match {*connection refused*} $e
+    }
+}
+
+foreach cmdrepl {0 1} {
+    start_server {tags {"scripting repl"}} {
+        start_server {} {
+            if {$cmdrepl == 1} {
+                set rt "(commands replication)"
+            } else {
+                set rt "(scripts replication)"
+                r debug lua-always-replicate-commands 1
+            }
+
+            test "Before the replica connects we issue two EVAL commands $rt" {
+                # One with an error, but still executing a command.
+                # SHA is: 67164fc43fa971f76fd1aaeeaf60c1c178d25876
+                catch {
+                    r eval {redis.call('incr',KEYS[1]); redis.call('nonexisting')} 1 x
+                }
+                # One command is correct:
+                # SHA is: 6f5ade10a69975e903c6d07b10ea44c6382381a5
+                r eval {return redis.call('incr',KEYS[1])} 1 x
+            } {2}
+
+            test "Connect a replica to the master instance $rt" {
+                r -1 slaveof [srv 0 host] [srv 0 port]
+                wait_for_condition 50 100 {
+                    [s -1 role] eq {slave} &&
+                    [string match {*master_link_status:up*} [r -1 info replication]]
+                } else {
+                    fail "Can't turn the instance into a replica"
+                }
+            }
+
+            test "Now use EVALSHA against the master, with both SHAs $rt" {
+                # The server should replicate successful and unsuccessful
+                # commands as EVAL instead of EVALSHA.
+                catch {
+                    r evalsha 67164fc43fa971f76fd1aaeeaf60c1c178d25876 1 x
+                }
+                r evalsha 6f5ade10a69975e903c6d07b10ea44c6382381a5 1 x
+            } {4}
+
+            test "If EVALSHA was replicated as EVAL, 'x' should be '4' $rt" {
+                wait_for_condition 50 100 {
+                    [r -1 get x] eq {4}
+                } else {
+                    fail "Expected 4 in x, but value is '[r -1 get x]'"
+                }
+            }
+
+            test "Replication of script multiple pushes to list with BLPOP $rt" {
+                set rd [redis_deferring_client]
+                $rd brpop a 0
+                r eval {
+                    redis.call("lpush",KEYS[1],"1");
+                    redis.call("lpush",KEYS[1],"2");
+                } 1 a
+                set res [$rd read]
+                $rd close
+                wait_for_condition 50 100 {
+                    [r -1 lrange a 0 -1] eq [r lrange a 0 -1]
+                } else {
+                    fail "Expected list 'a' in replica and master to be the same, but they are respectively '[r -1 lrange a 0 -1]' and '[r lrange a 0 -1]'"
+                }
+                set res
+            } {a 1}
+
+            test "EVALSHA replication when first call is readonly $rt" {
+                r del x
+                r eval {if tonumber(ARGV[1]) > 0 then redis.call('incr', KEYS[1]) end} 1 x 0
+                r evalsha 6e0e2745aa546d0b50b801a20983b70710aef3ce 1 x 0
+                r evalsha 6e0e2745aa546d0b50b801a20983b70710aef3ce 1 x 1
+                wait_for_condition 50 100 {
+                    [r -1 get x] eq {1}
+                } else {
+                    fail "Expected 1 in x, but value is '[r -1 get x]'"
+                }
+            }
+
+            test "Lua scripts using SELECT are replicated correctly $rt" {
+                r eval {
+                    redis.call("set","foo1","bar1")
+                    redis.call("select","10")
+                    redis.call("incr","x")
+                    redis.call("select","11")
+                    redis.call("incr","z")
+                } 0
+                r eval {
+                    redis.call("set","foo1","bar1")
+                    redis.call("select","10")
+                    redis.call("incr","x")
+                    redis.call("select","11")
+                    redis.call("incr","z")
+                } 0
+                wait_for_condition 50 100 {
+                    [r -1 debug digest] eq [r debug digest]
+                } else {
+                    fail "Master-Replica desync after Lua script using SELECT."
+                }
+            }
+        }
+    }
+}
+
+start_server {tags {"scripting repl"}} {
+    start_server {overrides {appendonly yes aof-use-rdb-preamble no}} {
+        test "Connect a replica to the master instance" {
+            r -1 slaveof [srv 0 host] [srv 0 port]
+            wait_for_condition 50 100 {
+                [s -1 role] eq {slave} &&
+                [string match {*master_link_status:up*} [r -1 info replication]]
+            } else {
+                fail "Can't turn the instance into a replica"
+            }
+        }
+
+        test "Redis.replicate_commands() must be issued before any write" {
+            r eval {
+                redis.call('set','foo','bar');
+                return redis.replicate_commands();
+            } 0
+        } {}
+
+        test "Redis.replicate_commands() must be issued before any write (2)" {
+            r eval {
+                return redis.replicate_commands();
+            } 0
+        } {1}
+
+        test "Redis.set_repl() must be issued after replicate_commands()" {
+            r debug lua-always-replicate-commands 0
+            catch {
+                r eval {
+                    redis.set_repl(redis.REPL_ALL);
+                } 0
+            } e
+            r debug lua-always-replicate-commands 1
+            set e
+        } {*only after turning on*}
+
+        test "Redis.set_repl() don't accept invalid values" {
+            catch {
+                r eval {
+                    redis.replicate_commands();
+                    redis.set_repl(12345);
+                } 0
+            } e
+            set e
+        } {*Invalid*flags*}
+
+        test "Test selective replication of certain Redis commands from Lua" {
+            r del a b c d
+            r eval {
+                redis.replicate_commands();
+                redis.call('set','a','1');
+                redis.set_repl(redis.REPL_NONE);
+                redis.call('set','b','2');
+                redis.set_repl(redis.REPL_AOF);
+                redis.call('set','c','3');
+                redis.set_repl(redis.REPL_ALL);
+                redis.call('set','d','4');
+            } 0
+
+            wait_for_condition 50 100 {
+                [r -1 mget a b c d] eq {1 {} {} 4}
+            } else {
+                fail "Only a and c should be replicated to replica"
+            }
+
+            # Master should have everything right now
+            assert {[r mget a b c d] eq {1 2 3 4}}
+
+            # After an AOF reload only a, c and d should exist
+            r debug loadaof
+
+            assert {[r mget a b c d] eq {1 {} 3 4}}
+        }
+
+        test "PRNG is seeded randomly for command replication" {
+            set a [
+                r eval {
+                    redis.replicate_commands();
+                    return math.random()*100000;
+                } 0
+            ]
+            set b [
+                r eval {
+                    redis.replicate_commands();
+                    return math.random()*100000;
+                } 0
+            ]
+            assert {$a ne $b}
+        }
+
+        test "Using side effects is not a problem with command replication" {
+            r eval {
+                redis.replicate_commands();
+                redis.call('set','time',redis.call('time')[1])
+            } 0
+
+            assert {[r get time] ne {}}
+
+            wait_for_condition 50 100 {
+                [r get time] eq [r -1 get time]
+            } else {
+                fail "Time key does not match between master and replica"
+            }
+        }
+    }
+}
+
+start_server {tags {"scripting"}} {
+    r script debug sync
+    r eval {return 'hello'} 0
+    r eval {return 'hello'} 0
+}
+
+start_server {tags {"scripting needs:debug external:skip"}} {
+    test {Test scripting debug protocol parsing} {
+        r script debug sync
+        r eval {return 'hello'} 0
+        catch {r 'hello\0world'} e
+        assert_match {*Unknown Redis Lua debugger command*} $e
+        catch {r 'hello\0'} e
+        assert_match {*Unknown Redis Lua debugger command*} $e
+        catch {r '\0hello'} e
+        assert_match {*Unknown Redis Lua debugger command*} $e
+        catch {r '\0hello\0'} e
+        assert_match {*Unknown Redis Lua debugger command*} $e
+    }
+}
diff --git a/redis-stable/tests/unit/shutdown.tcl b/redis-stable/tests/unit/shutdown.tcl
new file mode 100644
index 00000000..f48eadc5
--- /dev/null
+++ b/redis-stable/tests/unit/shutdown.tcl
@@ -0,0 +1,57 @@
+start_server {tags {"shutdown"}} {
+    test {Temp rdb will be deleted if we use bg_unlink when shutdown} {
+        for {set i 0} {$i < 20} {incr i} {
+            r set $i $i
+        }
+        # It will cost 2s(20 * 100ms) to dump rdb
+        r config set rdb-key-save-delay 100000
+
+        # Child is dumping rdb
+        r bgsave
+        after 100
+        set dir [lindex [r config get dir] 1]
+        set child_pid [get_child_pid 0]
+        set temp_rdb [file join [lindex [r config get dir] 1] temp-${child_pid}.rdb]
+        # Temp rdb must be existed
+        assert {[file exists $temp_rdb]}
+
+        catch {r shutdown nosave}
+        # Make sure the server was killed
+        catch {set rd [redis_deferring_client]} e
+        assert_match {*connection refused*} $e
+
+        # Temp rdb file must be deleted
+        assert {![file exists $temp_rdb]}
+    }
+}
+
+start_server {tags {"shutdown"}} {
+    test {Temp rdb will be deleted in signal handle} {
+        for {set i 0} {$i < 20} {incr i} {
+            r set $i $i
+        }
+        # It will cost 2s (20 * 100ms) to dump rdb
+        r config set rdb-key-save-delay 100000
+        
+        set pid [s process_id]
+        set temp_rdb [file join [lindex [r config get dir] 1] temp-${pid}.rdb]
+
+        # trigger a shutdown which will save an rdb
+        exec kill -SIGINT $pid
+        # Wait for creation of temp rdb
+        wait_for_condition 50 10 {
+            [file exists $temp_rdb]
+        } else {
+            fail "Can't trigger rdb save on shutdown"
+        }
+
+        # Insist on immediate shutdown, temp rdb file must be deleted
+        exec kill -SIGINT $pid
+        # wait for the rdb file to be deleted
+        wait_for_condition 50 10 {
+            ![file exists $temp_rdb]
+        } else {
+            fail "Can't trigger rdb save on shutdown"
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/slowlog.tcl b/redis-stable/tests/unit/slowlog.tcl
new file mode 100644
index 00000000..9f6e248e
--- /dev/null
+++ b/redis-stable/tests/unit/slowlog.tcl
@@ -0,0 +1,177 @@
+start_server {tags {"slowlog"} overrides {slowlog-log-slower-than 1000000}} {
+    test {SLOWLOG - check that it starts with an empty log} {
+        r slowlog len
+    } {0}
+
+    test {SLOWLOG - only logs commands taking more time than specified} {
+        r config set slowlog-log-slower-than 100000
+        r ping
+        assert_equal [r slowlog len] 0
+        r debug sleep 0.2
+        assert_equal [r slowlog len] 1
+    }
+
+    test {SLOWLOG - max entries is correctly handled} {
+        r config set slowlog-log-slower-than 0
+        r config set slowlog-max-len 10
+        for {set i 0} {$i < 100} {incr i} {
+            r ping
+        }
+        r slowlog len
+    } {10}
+
+    test {SLOWLOG - GET optional argument to limit output len works} {
+        llength [r slowlog get 5]
+    } {5}
+
+    test {SLOWLOG - RESET subcommand works} {
+        r config set slowlog-log-slower-than 100000
+        r slowlog reset
+        r slowlog len
+    } {0}
+
+    test {SLOWLOG - logged entry sanity check} {
+        r client setname foobar
+        r debug sleep 0.2
+        set e [lindex [r slowlog get] 0]
+        assert_equal [llength $e] 6
+        assert_equal [lindex $e 0] 105
+        assert_equal [expr {[lindex $e 2] > 100000}] 1
+        assert_equal [lindex $e 3] {debug sleep 0.2}
+        assert_equal {foobar} [lindex $e 5]
+    }
+
+    test {SLOWLOG - Certain commands are omitted that contain sensitive information} {
+        r config set slowlog-log-slower-than 0
+        r slowlog reset
+        r config set masterauth ""
+        r acl setuser slowlog-test-user +get +set
+        r config set slowlog-log-slower-than 0
+        r config set slowlog-log-slower-than 10000
+        set slowlog_resp [r slowlog get]
+
+        # Make sure normal configs work, but the two sensitive
+        # commands are omitted or redacted
+        assert_equal 4 [llength $slowlog_resp]
+        assert_equal {slowlog reset} [lindex [lindex [r slowlog get] 3] 3]
+        assert_equal {config set masterauth (redacted)} [lindex [lindex [r slowlog get] 2] 3]
+        assert_equal {acl setuser (redacted) (redacted) (redacted)} [lindex [lindex [r slowlog get] 1] 3]
+        assert_equal {config set slowlog-log-slower-than 0} [lindex [lindex [r slowlog get] 0] 3]
+    }
+
+    test {SLOWLOG - Some commands can redact sensitive fields} {
+        r config set slowlog-log-slower-than 0
+        r slowlog reset
+        r migrate [srv 0 host] [srv 0 port] key 9 5000
+        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH user
+        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH2 user password
+
+        r config set slowlog-log-slower-than 10000
+        # Make sure all 3 commands were logged, but the sensitive fields are omitted
+        assert_equal 4 [llength [r slowlog get]]
+        assert_match {* key 9 5000} [lindex [lindex [r slowlog get] 2] 3]
+        assert_match {* key 9 5000 AUTH (redacted)} [lindex [lindex [r slowlog get] 1] 3]
+        assert_match {* key 9 5000 AUTH2 (redacted) (redacted)} [lindex [lindex [r slowlog get] 0] 3]
+    }
+
+    test {SLOWLOG - Rewritten commands are logged as their original command} {
+        r config set slowlog-log-slower-than 0
+
+        # Test rewriting client arguments
+        r sadd set a b c d e
+        r slowlog reset
+
+        # SPOP is rewritten as DEL when all keys are removed
+        r spop set 10
+        assert_equal {spop set 10} [lindex [lindex [r slowlog get] 0] 3]
+
+        # Test replacing client arguments
+        r slowlog reset
+
+        # GEOADD is replicated as ZADD
+        r geoadd cool-cities -122.33207 47.60621 Seattle
+        assert_equal {geoadd cool-cities -122.33207 47.60621 Seattle} [lindex [lindex [r slowlog get] 0] 3]
+
+        # Test replacing a single command argument
+        r set A 5
+        r slowlog reset
+        
+        # GETSET is replicated as SET
+        r getset a 5
+        assert_equal {getset a 5} [lindex [lindex [r slowlog get] 0] 3]
+
+        # INCRBYFLOAT calls rewrite multiple times, so it's a special case
+        r set A 0
+        r slowlog reset
+        
+        # INCRBYFLOAT is replicated as SET
+        r INCRBYFLOAT A 1.0
+        assert_equal {INCRBYFLOAT A 1.0} [lindex [lindex [r slowlog get] 0] 3]
+
+        # blocked BLPOP is replicated as LPOP
+        set rd [redis_deferring_client]
+        $rd blpop l 0
+        wait_for_condition 50 100 {
+            [s blocked_clients] eq {1}
+        } else {
+            fail "Clients are not blocked"
+        }
+        r multi
+        r lpush l foo
+        r slowlog reset
+        r exec
+        $rd read
+        $rd close
+        assert_equal {blpop l 0} [lindex [lindex [r slowlog get] 0] 3]
+    }
+
+    test {SLOWLOG - commands with too many arguments are trimmed} {
+        r config set slowlog-log-slower-than 0
+        r slowlog reset
+        r sadd set 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
+        set e [lindex [r slowlog get] 0]
+        lindex $e 3
+    } {sadd set 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 {... (2 more arguments)}}
+
+    test {SLOWLOG - too long arguments are trimmed} {
+        r config set slowlog-log-slower-than 0
+        r slowlog reset
+        set arg [string repeat A 129]
+        r sadd set foo $arg
+        set e [lindex [r slowlog get] 0]
+        lindex $e 3
+    } {sadd set foo {AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... (1 more bytes)}}
+
+    test {SLOWLOG - EXEC is not logged, just executed commands} {
+        r config set slowlog-log-slower-than 100000
+        r slowlog reset
+        assert_equal [r slowlog len] 0
+        r multi
+        r debug sleep 0.2
+        r exec
+        assert_equal [r slowlog len] 1
+        set e [lindex [r slowlog get] 0]
+        assert_equal [lindex $e 3] {debug sleep 0.2}
+    }
+
+    test {SLOWLOG - can clean older entries} {
+        r client setname lastentry_client
+        r config set slowlog-max-len 1
+        r debug sleep 0.2
+        assert {[llength [r slowlog get]] == 1}
+        set e [lindex [r slowlog get] 0]
+        assert_equal {lastentry_client} [lindex $e 5]
+    }
+
+    test {SLOWLOG - can be disabled} {
+        r config set slowlog-max-len 1
+        r config set slowlog-log-slower-than 1
+        r slowlog reset
+        r debug sleep 0.2
+        assert_equal [r slowlog len] 1
+        r config set slowlog-log-slower-than -1
+        r slowlog reset
+        r debug sleep 0.2
+        assert_equal [r slowlog len] 0
+    }
+}
diff --git a/redis-stable/tests/unit/sort.tcl b/redis-stable/tests/unit/sort.tcl
new file mode 100644
index 00000000..083c4540
--- /dev/null
+++ b/redis-stable/tests/unit/sort.tcl
@@ -0,0 +1,318 @@
+start_server {
+    tags {"sort"}
+    overrides {
+        "list-max-ziplist-size" 32
+        "set-max-intset-entries" 32
+    }
+} {
+    proc create_random_dataset {num cmd} {
+        set tosort {}
+        set result {}
+        array set seenrand {}
+        r del tosort
+        for {set i 0} {$i < $num} {incr i} {
+            # Make sure all the weights are different because
+            # Redis does not use a stable sort but Tcl does.
+            while 1 {
+                randpath {
+                    set rint [expr int(rand()*1000000)]
+                } {
+                    set rint [expr rand()]
+                }
+                if {![info exists seenrand($rint)]} break
+            }
+            set seenrand($rint) x
+            r $cmd tosort $i
+            r set weight_$i $rint
+            r hset wobj_$i weight $rint
+            lappend tosort [list $i $rint]
+        }
+        set sorted [lsort -index 1 -real $tosort]
+        for {set i 0} {$i < $num} {incr i} {
+            lappend result [lindex $sorted $i 0]
+        }
+        set _ $result
+    }
+
+    foreach {num cmd enc title} {
+        16 lpush quicklist "Old Ziplist"
+        1000 lpush quicklist "Old Linked list"
+        10000 lpush quicklist "Old Big Linked list"
+        16 sadd intset "Intset"
+        1000 sadd hashtable "Hash table"
+        10000 sadd hashtable "Big Hash table"
+    } {
+        set result [create_random_dataset $num $cmd]
+        assert_encoding $enc tosort
+
+        test "$title: SORT BY key" {
+            assert_equal $result [r sort tosort BY weight_*]
+        }
+
+        test "$title: SORT BY key with limit" {
+            assert_equal [lrange $result 5 9] [r sort tosort BY weight_* LIMIT 5 5]
+        }
+
+        test "$title: SORT BY hash field" {
+            assert_equal $result [r sort tosort BY wobj_*->weight]
+        }
+    }
+
+    set result [create_random_dataset 16 lpush]
+    test "SORT GET #" {
+        assert_equal [lsort -integer $result] [r sort tosort GET #]
+    }
+
+    test "SORT GET <const>" {
+        r del foo
+        set res [r sort tosort GET foo]
+        assert_equal 16 [llength $res]
+        foreach item $res { assert_equal {} $item }
+    }
+
+    test "SORT GET (key and hash) with sanity check" {
+        set l1 [r sort tosort GET # GET weight_*]
+        set l2 [r sort tosort GET # GET wobj_*->weight]
+        foreach {id1 w1} $l1 {id2 w2} $l2 {
+            assert_equal $id1 $id2
+            assert_equal $w1 [r get weight_$id1]
+            assert_equal $w2 [r get weight_$id1]
+        }
+    }
+
+    test "SORT BY key STORE" {
+        r sort tosort BY weight_* store sort-res
+        assert_equal $result [r lrange sort-res 0 -1]
+        assert_equal 16 [r llen sort-res]
+        assert_encoding quicklist sort-res
+    }
+
+    test "SORT BY hash field STORE" {
+        r sort tosort BY wobj_*->weight store sort-res
+        assert_equal $result [r lrange sort-res 0 -1]
+        assert_equal 16 [r llen sort-res]
+        assert_encoding quicklist sort-res
+    }
+
+    test "SORT extracts STORE correctly" {
+        r command getkeys sort abc store def
+    } {abc def}
+
+    test "SORT extracts multiple STORE correctly" {
+        r command getkeys sort abc store invalid store stillbad store def
+    } {abc def}
+
+    test "SORT DESC" {
+        assert_equal [lsort -decreasing -integer $result] [r sort tosort DESC]
+    }
+
+    test "SORT ALPHA against integer encoded strings" {
+        r del mylist
+        r lpush mylist 2
+        r lpush mylist 1
+        r lpush mylist 3
+        r lpush mylist 10
+        r sort mylist alpha
+    } {1 10 2 3}
+
+    test "SORT sorted set" {
+        r del zset
+        r zadd zset 1 a
+        r zadd zset 5 b
+        r zadd zset 2 c
+        r zadd zset 10 d
+        r zadd zset 3 e
+        r sort zset alpha desc
+    } {e d c b a}
+
+    test "SORT sorted set BY nosort should retain ordering" {
+        r del zset
+        r zadd zset 1 a
+        r zadd zset 5 b
+        r zadd zset 2 c
+        r zadd zset 10 d
+        r zadd zset 3 e
+        r multi
+        r sort zset by nosort asc
+        r sort zset by nosort desc
+        r exec
+    } {{a c e b d} {d b e c a}}
+
+    test "SORT sorted set BY nosort + LIMIT" {
+        r del zset
+        r zadd zset 1 a
+        r zadd zset 5 b
+        r zadd zset 2 c
+        r zadd zset 10 d
+        r zadd zset 3 e
+        assert_equal [r sort zset by nosort asc limit 0 1] {a}
+        assert_equal [r sort zset by nosort desc limit 0 1] {d}
+        assert_equal [r sort zset by nosort asc limit 0 2] {a c}
+        assert_equal [r sort zset by nosort desc limit 0 2] {d b}
+        assert_equal [r sort zset by nosort limit 5 10] {}
+        assert_equal [r sort zset by nosort limit -10 100] {a c e b d}
+    }
+
+    test "SORT sorted set BY nosort works as expected from scripts" {
+        r del zset
+        r zadd zset 1 a
+        r zadd zset 5 b
+        r zadd zset 2 c
+        r zadd zset 10 d
+        r zadd zset 3 e
+        r eval {
+            return {redis.call('sort',KEYS[1],'by','nosort','asc'),
+                    redis.call('sort',KEYS[1],'by','nosort','desc')}
+        } 1 zset
+    } {{a c e b d} {d b e c a}}
+
+    test "SORT sorted set: +inf and -inf handling" {
+        r del zset
+        r zadd zset -100 a
+        r zadd zset 200 b
+        r zadd zset -300 c
+        r zadd zset 1000000 d
+        r zadd zset +inf max
+        r zadd zset -inf min
+        r zrange zset 0 -1
+    } {min c a b d max}
+
+    test "SORT regression for issue #19, sorting floats" {
+        r flushdb
+        set floats {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15}
+        foreach x $floats {
+            r lpush mylist $x
+        }
+        assert_equal [lsort -real $floats] [r sort mylist]
+    }
+
+    test "SORT with STORE returns zero if result is empty (github issue 224)" {
+        r flushdb
+        r sort foo store bar
+    } {0}
+
+    test "SORT with STORE does not create empty lists (github issue 224)" {
+        r flushdb
+        r lpush foo bar
+        r sort foo alpha limit 10 10 store zap
+        r exists zap
+    } {0}
+
+    test "SORT with STORE removes key if result is empty (github issue 227)" {
+        r flushdb
+        r lpush foo bar
+        r sort emptylist store foo
+        r exists foo
+    } {0}
+
+    test "SORT with BY <constant> and STORE should still order output" {
+        r del myset mylist
+        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
+        r sort myset alpha by _ store mylist
+        r lrange mylist 0 -1
+    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
+
+    test "SORT will complain with numerical sorting and bad doubles (1)" {
+        r del myset
+        r sadd myset 1 2 3 4 not-a-double
+        set e {}
+        catch {r sort myset} e
+        set e
+    } {*ERR*double*}
+
+    test "SORT will complain with numerical sorting and bad doubles (2)" {
+        r del myset
+        r sadd myset 1 2 3 4
+        r mset score:1 10 score:2 20 score:3 30 score:4 not-a-double
+        set e {}
+        catch {r sort myset by score:*} e
+        set e
+    } {*ERR*double*}
+
+    test "SORT BY sub-sorts lexicographically if score is the same" {
+        r del myset
+        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
+        foreach ele {a aa aaa azz b c d e f g h i l m n o p q r s t u v z} {
+            set score:$ele 100
+        }
+        r sort myset by score:*
+    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
+
+    test "SORT GET with pattern ending with just -> does not get hash field" {
+        r del mylist
+        r lpush mylist a
+        r set x:a-> 100
+        r sort mylist by num get x:*->
+    } {100}
+
+    test "SORT by nosort retains native order for lists" {
+        r del testa
+        r lpush testa 2 1 4 3 5
+        r sort testa by nosort
+    } {5 3 4 1 2}
+
+    test "SORT by nosort plus store retains native order for lists" {
+        r del testa
+        r lpush testa 2 1 4 3 5
+        r sort testa by nosort store testb
+        r lrange testb 0 -1
+    } {5 3 4 1 2}
+
+    test "SORT by nosort with limit returns based on original list order" {
+        r sort testa by nosort limit 0 3 store testb
+        r lrange testb 0 -1
+    } {5 3 4}
+
+    tags {"slow"} {
+        set num 100
+        set res [create_random_dataset $num lpush]
+
+        test "SORT speed, $num element list BY key, 100 times" {
+            set start [clock clicks -milliseconds]
+            for {set i 0} {$i < 100} {incr i} {
+                set sorted [r sort tosort BY weight_* LIMIT 0 10]
+            }
+            set elapsed [expr [clock clicks -milliseconds]-$start]
+            if {$::verbose} {
+                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
+                flush stdout
+            }
+        }
+
+        test "SORT speed, $num element list BY hash field, 100 times" {
+            set start [clock clicks -milliseconds]
+            for {set i 0} {$i < 100} {incr i} {
+                set sorted [r sort tosort BY wobj_*->weight LIMIT 0 10]
+            }
+            set elapsed [expr [clock clicks -milliseconds]-$start]
+            if {$::verbose} {
+                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
+                flush stdout
+            }
+        }
+
+        test "SORT speed, $num element list directly, 100 times" {
+            set start [clock clicks -milliseconds]
+            for {set i 0} {$i < 100} {incr i} {
+                set sorted [r sort tosort LIMIT 0 10]
+            }
+            set elapsed [expr [clock clicks -milliseconds]-$start]
+            if {$::verbose} {
+                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
+                flush stdout
+            }
+        }
+
+        test "SORT speed, $num element list BY <const>, 100 times" {
+            set start [clock clicks -milliseconds]
+            for {set i 0} {$i < 100} {incr i} {
+                set sorted [r sort tosort BY nokey LIMIT 0 10]
+            }
+            set elapsed [expr [clock clicks -milliseconds]-$start]
+            if {$::verbose} {
+                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
+                flush stdout
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/tls.tcl b/redis-stable/tests/unit/tls.tcl
new file mode 100644
index 00000000..29fe39fb
--- /dev/null
+++ b/redis-stable/tests/unit/tls.tcl
@@ -0,0 +1,158 @@
+start_server {tags {"tls"}} {
+    if {$::tls} {
+        package require tls
+
+        test {TLS: Not accepting non-TLS connections on a TLS port} {
+            set s [redis [srv 0 host] [srv 0 port]]
+            catch {$s PING} e
+            set e
+        } {*I/O error*}
+
+        test {TLS: Verify tls-auth-clients behaves as expected} {
+            set s [redis [srv 0 host] [srv 0 port]]
+            ::tls::import [$s channel]
+            catch {$s PING} e
+            assert_match {*error*} $e
+
+            r CONFIG SET tls-auth-clients no
+
+            set s [redis [srv 0 host] [srv 0 port]]
+            ::tls::import [$s channel]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            r CONFIG SET tls-auth-clients optional
+
+            set s [redis [srv 0 host] [srv 0 port]]
+            ::tls::import [$s channel]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            r CONFIG SET tls-auth-clients yes
+
+            set s [redis [srv 0 host] [srv 0 port]]
+            ::tls::import [$s channel]
+            catch {$s PING} e
+            assert_match {*error*} $e
+        }
+
+        test {TLS: Verify tls-protocols behaves as expected} {
+            r CONFIG SET tls-protocols TLSv1.2
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-tls1.2 0}]
+            catch {$s PING} e
+            assert_match {*I/O error*} $e
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-tls1.2 1}]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            r CONFIG SET tls-protocols ""
+        }
+
+        test {TLS: Verify tls-ciphers behaves as expected} {
+            r CONFIG SET tls-protocols TLSv1.2
+            r CONFIG SET tls-ciphers "DEFAULT:-AES128-SHA256"
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES128-SHA256"}]
+            catch {$s PING} e
+            assert_match {*I/O error*} $e
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES256-SHA256"}]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            r CONFIG SET tls-ciphers "DEFAULT"
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES128-SHA256"}]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            r CONFIG SET tls-protocols ""
+            r CONFIG SET tls-ciphers "DEFAULT"
+        }
+
+        test {TLS: Verify tls-prefer-server-ciphers behaves as expected} {
+            r CONFIG SET tls-protocols TLSv1.2
+            r CONFIG SET tls-ciphers "AES128-SHA256:AES256-SHA256"
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "AES256-SHA256:AES128-SHA256"}]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            assert_equal "AES256-SHA256" [dict get [::tls::status [$s channel]] cipher]
+
+            r CONFIG SET tls-prefer-server-ciphers yes
+
+            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "AES256-SHA256:AES128-SHA256"}]
+            catch {$s PING} e
+            assert_match {PONG} $e
+
+            assert_equal "AES128-SHA256" [dict get [::tls::status [$s channel]] cipher]
+
+            r CONFIG SET tls-protocols ""
+            r CONFIG SET tls-ciphers "DEFAULT"
+        }
+
+        test {TLS: Verify tls-cert-file is also used as a client cert if none specified} {
+            set master [srv 0 client]
+            set master_host [srv 0 host]
+            set master_port [srv 0 port]
+
+            # Use a non-restricted client/server cert for the replica
+            set redis_crt [format "%s/tests/tls/redis.crt" [pwd]]
+            set redis_key [format "%s/tests/tls/redis.key" [pwd]]
+
+            start_server [list overrides [list tls-cert-file $redis_crt tls-key-file $redis_key] \
+                               omit [list tls-client-cert-file tls-client-key-file]] {
+                set replica [srv 0 client]
+                $replica replicaof $master_host $master_port
+                wait_for_condition 30 100 {
+                    [string match {*master_link_status:up*} [$replica info replication]]
+                } else {
+                    fail "Can't authenticate to master using just tls-cert-file!"
+                }
+            }
+        }
+
+        test {TLS: switch between tcp and tls ports} {
+            set srv_port [srv 0 port]
+
+            # TLS
+            set rd [redis [srv 0 host] $srv_port 0 1]
+            $rd PING
+
+            # TCP
+            $rd CONFIG SET tls-port 0
+            $rd CONFIG SET port $srv_port
+            $rd close
+
+            set rd [redis [srv 0 host] $srv_port 0 0]
+            $rd PING
+
+            # TLS
+            $rd CONFIG SET port 0
+            $rd CONFIG SET tls-port $srv_port
+            $rd close
+
+            set rd [redis [srv 0 host] $srv_port 0 1]
+            $rd PING
+            $rd close
+        }
+
+        test {TLS: Working with an encrypted keyfile} {
+            # Create an encrypted version
+            set keyfile [lindex [r config get tls-key-file] 1]
+            set keyfile_encrypted "$keyfile.encrypted"
+            exec -ignorestderr openssl rsa -in $keyfile -out $keyfile_encrypted -aes256 -passout pass:1234 2>/dev/null
+
+            # Using it without a password fails
+            catch {r config set tls-key-file $keyfile_encrypted} e
+            assert_match {*Unable to update TLS*} $e
+
+            # Now use a password
+            r config set tls-key-file-pass 1234
+            r config set tls-key-file $keyfile_encrypted
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/tracking.tcl b/redis-stable/tests/unit/tracking.tcl
new file mode 100644
index 00000000..217a057d
--- /dev/null
+++ b/redis-stable/tests/unit/tracking.tcl
@@ -0,0 +1,591 @@
+start_server {tags {"tracking network"}} {
+    # Create a deferred client we'll use to redirect invalidation
+    # messages to.
+    set rd_redirection [redis_deferring_client]
+    $rd_redirection client id
+    set redir_id [$rd_redirection read]
+    $rd_redirection subscribe __redis__:invalidate
+    $rd_redirection read ; # Consume the SUBSCRIBE reply.
+
+    # Create another client that's not used as a redirection client
+    # We should always keep this client's buffer clean
+    set rd [redis_deferring_client]
+
+    # Client to be used for SET and GET commands
+    # We don't read this client's buffer
+    set rd_sg [redis_client] 
+
+    proc clean_all {} {
+        uplevel {
+            # We should make r TRACKING off first. If r is in RESP3,
+            # r FLUSH ALL will send us tracking-redir-broken or other
+            # info which will not be consumed.
+            r CLIENT TRACKING off
+            $rd QUIT
+            $rd_redirection QUIT
+            set rd [redis_deferring_client]
+            set rd_redirection [redis_deferring_client]
+            $rd_redirection client id
+            set redir_id [$rd_redirection read]
+            $rd_redirection subscribe __redis__:invalidate
+            $rd_redirection read ; # Consume the SUBSCRIBE reply.
+            r FLUSHALL
+            r HELLO 2
+            r config set tracking-table-max-keys 1000000
+        }
+    }
+
+    test {Clients are able to enable tracking and redirect it} {
+        r CLIENT TRACKING on REDIRECT $redir_id
+    } {*OK}
+
+    test {The other connection is able to get invalidations} {
+        r SET a 1
+        r SET b 1
+        r GET a
+        r INCR b ; # This key should not be notified, since it wasn't fetched.
+        r INCR a
+        set keys [lindex [$rd_redirection read] 2]
+        assert {[llength $keys] == 1}
+        assert {[lindex $keys 0] eq {a}}
+    }
+
+    test {The client is now able to disable tracking} {
+        # Make sure to add a few more keys in the tracking list
+        # so that we can check for leaks, as a side effect.
+        r MGET a b c d e f g
+        r CLIENT TRACKING off
+    } {*OK}
+
+    test {Clients can enable the BCAST mode with the empty prefix} {
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id
+    } {*OK*}
+
+    test {The connection gets invalidation messages about all the keys} {
+        r MSET a 1 b 2 c 3
+        set keys [lsort [lindex [$rd_redirection read] 2]]
+        assert {$keys eq {a b c}}
+    }
+
+    test {Clients can enable the BCAST mode with prefixes} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id PREFIX a: PREFIX b:
+        r MULTI
+        r INCR a:1
+        r INCR a:2
+        r INCR b:1
+        r INCR b:2
+        # we should not get this key
+        r INCR c:1
+        r EXEC
+        # Because of the internals, we know we are going to receive
+        # two separated notifications for the two different prefixes.
+        set keys1 [lsort [lindex [$rd_redirection read] 2]]
+        set keys2 [lsort [lindex [$rd_redirection read] 2]]
+        set keys [lsort [list {*}$keys1 {*}$keys2]]
+        assert {$keys eq {a:1 a:2 b:1 b:2}}
+    }
+
+    test {Adding prefixes to BCAST mode works} {
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id PREFIX c:
+        r INCR c:1234
+        set keys [lsort [lindex [$rd_redirection read] 2]]
+        assert {$keys eq {c:1234}}
+    }
+
+    test {Tracking NOLOOP mode in standard mode works} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on REDIRECT $redir_id NOLOOP
+        r MGET otherkey1 loopkey otherkey2
+        $rd_sg SET otherkey1 1; # We should get this
+        r SET loopkey 1 ; # We should not get this
+        $rd_sg SET otherkey2 1; # We should get this
+        # Because of the internals, we know we are going to receive
+        # two separated notifications for the two different keys.
+        set keys1 [lsort [lindex [$rd_redirection read] 2]]
+        set keys2 [lsort [lindex [$rd_redirection read] 2]]
+        set keys [lsort [list {*}$keys1 {*}$keys2]]
+        assert {$keys eq {otherkey1 otherkey2}}
+    }
+
+    test {Tracking NOLOOP mode in BCAST mode works} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
+        $rd_sg SET otherkey1 1; # We should get this
+        r SET loopkey 1 ; # We should not get this
+        $rd_sg SET otherkey2 1; # We should get this
+        # Because $rd_sg send command synchronously, we know we are
+        # going to receive two separated notifications.
+        set keys1 [lsort [lindex [$rd_redirection read] 2]]
+        set keys2 [lsort [lindex [$rd_redirection read] 2]]
+        set keys [lsort [list {*}$keys1 {*}$keys2]]
+        assert {$keys eq {otherkey1 otherkey2}}
+    }
+
+    test {Tracking gets notification of expired keys} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
+        r SET mykey myval px 1
+        r SET mykeyotherkey myval ; # We should not get it
+        after 1000
+        set keys [lsort [lindex [$rd_redirection read] 2]]
+        assert {$keys eq {mykey}}
+    }
+
+    test {Tracking gets notification of lazy expired keys} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
+        # Use multi-exec to expose a race where the key gets an two invalidations
+        # in the same event loop, once by the client so filtered by NOLOOP, and
+        # the second one by the lazy expire
+        r MULTI
+        r SET mykey{t} myval px 1
+        r SET mykeyotherkey{t} myval ; # We should not get it
+        r DEBUG SLEEP 0.1
+        r GET mykey{t}
+        r EXEC
+        set keys [lsort [lindex [$rd_redirection read] 2]]
+        assert {$keys eq {mykey{t}}}
+    } {} {needs:debug}
+
+    test {HELLO 3 reply is correct} {
+        set reply [r HELLO 3]
+        assert_equal [dict get $reply proto] 3
+    }
+
+    test {HELLO without protover} {
+        set reply [r HELLO 3]
+        assert_equal [dict get $reply proto] 3
+
+        set reply [r HELLO]
+        assert_equal [dict get $reply proto] 3
+
+        set reply [r HELLO 2]
+        assert_equal [dict get $reply proto] 2
+
+        set reply [r HELLO]
+        assert_equal [dict get $reply proto] 2
+
+        # restore RESP3 for next test
+        r HELLO 3
+    }
+
+    test {RESP3 based basic invalidation} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg SET key1 2
+        r read
+    } {invalidate key1}
+
+    test {RESP3 tracking redirection} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg SET key1 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key1}}
+    }
+
+    test {Invalidations of previous keys can be redirected after switching to RESP3} {
+        r HELLO 2
+        $rd_sg SET key1 1
+        r GET key1
+        r HELLO 3
+        $rd_sg SET key1 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key1}}
+    }
+
+    test {Invalidations of new keys can be redirected after switching to RESP3} {
+        r HELLO 3
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg SET key1 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key1}}
+    }
+
+    test {RESP3 Client gets tracking-redir-broken push message after cached key changed when rediretion client is terminated} {
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_redirection QUIT
+        assert_equal OK [$rd_redirection read]
+        $rd_sg SET key1 2
+        set MAX_TRIES 100
+        set res -1
+        for {set i 0} {$i <= $MAX_TRIES && $res < 0} {incr i} {
+            set res [lsearch -exact [r PING] "tracking-redir-broken"]
+        }
+        assert {$res >= 0}
+        # Consume PING reply
+        assert_equal PONG [r read]
+
+        # Reinstantiating after QUIT
+        set rd_redirection [redis_deferring_client]
+        $rd_redirection CLIENT ID
+        set redir_id [$rd_redirection read]
+        $rd_redirection SUBSCRIBE __redis__:invalidate
+        $rd_redirection read ; # Consume the SUBSCRIBE reply
+    }
+
+    test {Different clients can redirect to the same connection} {
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd CLIENT TRACKING on REDIRECT $redir_id 
+        assert_equal OK [$rd read] ; # Consume the TRACKING reply
+        $rd_sg MSET key1 1 key2 1
+        r GET key1
+        $rd GET key2 
+        assert_equal 1 [$rd read] ; # Consume the GET reply
+        $rd_sg INCR key1
+        $rd_sg INCR key2
+        set res1 [lindex [$rd_redirection read] 2]
+        set res2 [lindex [$rd_redirection read] 2]
+        assert {$res1 eq {key1}}
+        assert {$res2 eq {key2}}
+    }
+
+    test {Different clients using different protocols can track the same key} {
+        $rd HELLO 3 
+        set reply [$rd read] ; # Consume the HELLO reply
+        assert_equal 3 [dict get $reply proto]
+        $rd CLIENT TRACKING on 
+        assert_equal OK [$rd read] ; # Consume the TRACKING reply
+        $rd_sg set key1 1
+        r GET key1
+        $rd GET key1 
+        assert_equal 1 [$rd read] ; # Consume the GET reply
+        $rd_sg INCR key1
+        set res1 [lindex [$rd_redirection read] 2]
+        $rd PING ; # Non redirecting client has to talk to the server in order to get invalidation message
+        set res2 [lindex [split [$rd read] " "] 1] 
+        assert_equal PONG [$rd read] ; # Consume the PING reply, which comes together with the invalidation message
+        assert {$res1 eq {key1}}
+        assert {$res2 eq {key1}}
+    }
+
+    test {No invalidation message when using OPTIN option} {
+        r CLIENT TRACKING on OPTIN REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1 ; # This key should not be notified, since OPTIN is on and CLIENT CACHING yes wasn't called
+        $rd_sg SET key1 2
+        # Preparing some message to consume on $rd_redirection so we don't get blocked
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key2 1
+        r GET key2 ; # This key should be notified
+        $rd_sg SET key2 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key2}}
+    }
+
+    test {Invalidation message sent when using OPTIN option with CLIENT CACHING yes} {
+        r CLIENT TRACKING on OPTIN REDIRECT $redir_id
+        $rd_sg SET key1 3
+        r CLIENT CACHING yes
+        r GET key1
+        $rd_sg SET key1 4
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key1}}
+    }
+
+    test {Invalidation message sent when using OPTOUT option} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on OPTOUT REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1 
+        $rd_sg SET key1 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key1}}
+    }
+
+    test {No invalidation message when using OPTOUT option with CLIENT CACHING no} {
+        $rd_sg SET key1 1
+        r CLIENT CACHING no
+        r GET key1 ; # This key should not be notified, since OPTOUT is on and CLIENT CACHING no was called
+        $rd_sg SET key1 2
+        # Preparing some message to consume on $rd_redirection so we don't get blocked
+        $rd_sg SET key2 1
+        r GET key2 ; # This key should be notified
+        $rd_sg SET key2 2
+        set res [lindex [$rd_redirection read] 2]
+        assert {$res eq {key2}}
+    }
+
+    test {Able to redirect to a RESP3 client} {
+        $rd_redirection UNSUBSCRIBE __redis__:invalidate ; # Need to unsub first before we can do HELLO 3
+        set res [$rd_redirection read] ; # Consume the UNSUBSCRIBE reply
+        assert_equal {__redis__:invalidate} [lindex $res 1]
+        $rd_redirection HELLO 3
+        set res [$rd_redirection read] ; # Consume the HELLO reply
+        assert_equal [dict get $reply proto] 3
+        $rd_redirection SUBSCRIBE __redis__:invalidate
+        set res [$rd_redirection read] ; # Consume the SUBSCRIBE reply
+        assert_equal {__redis__:invalidate} [lindex $res 1]
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg INCR key1
+        set res [lindex [$rd_redirection read] 1]
+        assert {$res eq {key1}}
+        $rd_redirection HELLO 2
+        set res [$rd_redirection read] ; # Consume the HELLO reply
+        assert_equal [dict get $res proto] 2
+    }
+
+    test {After switching from normal tracking to BCAST mode, no invalidation message is produced for pre-BCAST keys} {
+        r CLIENT TRACKING off
+        r HELLO 3
+        r CLIENT TRACKING on
+        $rd_sg SET key1 1
+        r GET key1
+        r CLIENT TRACKING off 
+        r CLIENT TRACKING on BCAST
+        $rd_sg INCR key1
+        set inv_msg [r PING]
+        set ping_reply [r read]
+        assert {$inv_msg eq {invalidate key1}}
+        assert {$ping_reply eq {PONG}}
+    }
+
+    test {BCAST with prefix collisions throw errors} {
+        set r [redis_client] 
+        catch {$r CLIENT TRACKING ON BCAST PREFIX FOOBAR PREFIX FOO} output
+        assert_match {ERR Prefix 'FOOBAR'*'FOO'*} $output
+
+        catch {$r CLIENT TRACKING ON BCAST PREFIX FOO PREFIX FOOBAR} output
+        assert_match {ERR Prefix 'FOO'*'FOOBAR'*} $output
+
+        $r CLIENT TRACKING ON BCAST PREFIX FOO PREFIX BAR
+        catch {$r CLIENT TRACKING ON BCAST PREFIX FO} output
+        assert_match {ERR Prefix 'FO'*'FOO'*} $output
+
+        catch {$r CLIENT TRACKING ON BCAST PREFIX BARB} output
+        assert_match {ERR Prefix 'BARB'*'BAR'*} $output
+
+        $r CLIENT TRACKING OFF
+    }
+
+    test {Tracking gets notification on tracking table key eviction} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on REDIRECT $redir_id NOLOOP
+        r MSET key1 1 key2 2
+        # Let the server track the two keys for us
+        r MGET key1 key2
+        # Force the eviction of all the keys but one:
+        r config set tracking-table-max-keys 1
+        # Note that we may have other keys in the table for this client,
+        # since we disabled/enabled tracking multiple time with the same
+        # ID, and tracking does not do ID cleanups for performance reasons.
+        # So we check that eventually we'll receive one or the other key,
+        # otherwise the test will die for timeout.
+        while 1 {
+            set keys [lindex [$rd_redirection read] 2]
+            if {$keys eq {key1} || $keys eq {key2}} break
+        }
+        # We should receive an expire notification for one of
+        # the two keys (only one must remain)
+        assert {$keys eq {key1} || $keys eq {key2}}
+    }
+
+    test {Invalidation message received for flushall} {
+        clean_all
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg FLUSHALL
+        set msg [$rd_redirection read]
+        assert {[lindex msg 2] eq {} }
+    }
+
+    test {Invalidation message received for flushdb} {
+        clean_all
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_sg FLUSHDB
+        set msg [$rd_redirection read]
+        assert {[lindex msg 2] eq {} }
+    }
+
+    test {Test ASYNC flushall} {
+        clean_all
+        r CLIENT TRACKING on REDIRECT $redir_id
+        r GET key1
+        r GET key2
+        assert_equal [s 0 tracking_total_keys] 2
+        $rd_sg FLUSHALL ASYNC
+        assert_equal [s 0 tracking_total_keys] 0
+        assert_equal [lindex [$rd_redirection read] 2] {}
+    }
+
+    # Keys are defined to be evicted 100 at a time by default.
+    # If after eviction the number of keys still surpasses the limit
+    # defined in tracking-table-max-keys, we increases eviction 
+    # effort to 200, and then 300, etc. 
+    # This test tests this effort incrementation. 
+    test {Server is able to evacuate enough keys when num of keys surpasses limit by more than defined initial effort} {
+        clean_all
+        set NUM_OF_KEYS_TO_TEST 250
+        set TRACKING_TABLE_MAX_KEYS 1
+        r CLIENT TRACKING on REDIRECT $redir_id
+        for {set i 0} {$i < $NUM_OF_KEYS_TO_TEST} {incr i} {
+            $rd_sg SET key$i $i
+            r GET key$i
+        }
+        r config set tracking-table-max-keys $TRACKING_TABLE_MAX_KEYS
+        # If not enough keys are evicted, we won't get enough invalidation
+        # messages, and "$rd_redirection read" will block.
+        # If too many keys are evicted, we will get too many invalidation
+        # messages, and the assert will fail.
+        for {set i 0} {$i < $NUM_OF_KEYS_TO_TEST - $TRACKING_TABLE_MAX_KEYS} {incr i} {
+            $rd_redirection read
+        }
+        $rd_redirection PING
+        assert {[$rd_redirection read] eq {pong {}}}
+    }
+
+    test {Tracking info is correct} {
+        clean_all
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        $rd_sg SET key2 2
+        r GET key1 
+        r GET key2
+        $rd CLIENT TRACKING on BCAST PREFIX prefix:
+        assert [string match *OK* [$rd read]]
+        $rd_sg SET prefix:key1 1 
+        $rd_sg SET prefix:key2 2
+        set info [r info]
+        regexp "\r\ntracking_total_items:(.*?)\r\n" $info _ total_items
+        regexp "\r\ntracking_total_keys:(.*?)\r\n" $info _ total_keys
+        regexp "\r\ntracking_total_prefixes:(.*?)\r\n" $info _ total_prefixes
+        regexp "\r\ntracking_clients:(.*?)\r\n" $info _ tracking_clients
+        assert {$total_items == 2}
+        assert {$total_keys == 2}
+        assert {$total_prefixes == 1}
+        assert {$tracking_clients == 2}
+    }
+
+    test {CLIENT GETREDIR provides correct client id} {
+        set res [r CLIENT GETREDIR]
+        assert_equal $redir_id $res
+        r CLIENT TRACKING off
+        set res [r CLIENT GETREDIR]
+        assert_equal -1 $res
+        r CLIENT TRACKING on
+        set res [r CLIENT GETREDIR]
+        assert_equal 0 $res
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking off} {
+        r CLIENT TRACKING off
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {off} $flags
+        set redirect [dict get $res redirect]
+        assert_equal {-1} $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking on} {
+        r CLIENT TRACKING on
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on} $flags
+        set redirect [dict get $res redirect]
+        assert_equal {0} $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking on with options} {
+        r CLIENT TRACKING on REDIRECT $redir_id noloop
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on noloop} $flags
+        set redirect [dict get $res redirect]
+        assert_equal $redir_id $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking optin} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on optin
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on optin} $flags
+        set redirect [dict get $res redirect]
+        assert_equal {0} $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+
+        r CLIENT CACHING yes
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on optin caching-yes} $flags
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking optout} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on optout
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on optout} $flags
+        set redirect [dict get $res redirect]
+        assert_equal {0} $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+
+        r CLIENT CACHING no
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on optout caching-no} $flags
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking bcast mode} {
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST PREFIX foo PREFIX bar
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on bcast} $flags
+        set redirect [dict get $res redirect]
+        assert_equal {0} $redirect
+        set prefixes [lsort [dict get $res prefixes]]
+        assert_equal {bar foo} $prefixes
+
+        r CLIENT TRACKING off
+        r CLIENT TRACKING on BCAST
+        set res [r client trackinginfo]
+        set prefixes [dict get $res prefixes]
+        assert_equal {{}} $prefixes
+    }
+
+    test {CLIENT TRACKINGINFO provides reasonable results when tracking redir broken} {
+        clean_all
+        r HELLO 3
+        r CLIENT TRACKING on REDIRECT $redir_id
+        $rd_sg SET key1 1
+        r GET key1
+        $rd_redirection QUIT
+        assert_equal OK [$rd_redirection read]
+        $rd_sg SET key1 2
+        set res [lsearch -exact [r read] "tracking-redir-broken"]
+        assert {$res >= 0}
+        set res [r client trackinginfo]
+        set flags [dict get $res flags]
+        assert_equal {on broken_redirect} $flags
+        set redirect [dict get $res redirect]
+        assert_equal $redir_id $redirect
+        set prefixes [dict get $res prefixes]
+        assert_equal {} $prefixes
+    }
+
+    $rd_redirection close
+    $rd close
+}
diff --git a/redis-stable/tests/unit/type/hash.tcl b/redis-stable/tests/unit/type/hash.tcl
new file mode 100644
index 00000000..f2a50372
--- /dev/null
+++ b/redis-stable/tests/unit/type/hash.tcl
@@ -0,0 +1,797 @@
+start_server {tags {"hash"}} {
+    test {HSET/HLEN - Small hash creation} {
+        array set smallhash {}
+        for {set i 0} {$i < 8} {incr i} {
+            set key __avoid_collisions__[randstring 0 8 alpha]
+            set val __avoid_collisions__[randstring 0 8 alpha]
+            if {[info exists smallhash($key)]} {
+                incr i -1
+                continue
+            }
+            r hset smallhash $key $val
+            set smallhash($key) $val
+        }
+        list [r hlen smallhash]
+    } {8}
+
+    test {Is the small hash encoded with a ziplist?} {
+        assert_encoding ziplist smallhash
+    }
+
+    proc create_hash {key entries} {
+        r del $key
+        foreach entry $entries {
+            r hset $key [lindex $entry 0] [lindex $entry 1]
+        }
+    }
+
+    proc get_keys {l} {
+        set res {}
+        foreach entry $l {
+            set key [lindex $entry 0]
+            lappend res $key
+        }
+        return $res
+    }
+
+    foreach {type contents} "ziplist {{a 1} {b 2} {c 3}} hashtable {{a 1} {b 2} {[randstring 70 90 alpha] 3}}" {
+        set original_max_value [lindex [r config get hash-max-ziplist-value] 1]
+        r config set hash-max-ziplist-value 10
+        create_hash myhash $contents
+        assert_encoding $type myhash
+
+        test "HRANDFIELD - $type" {
+            unset -nocomplain myhash
+            array set myhash {}
+            for {set i 0} {$i < 100} {incr i} {
+                set key [r hrandfield myhash]
+                set myhash($key) 1
+            }
+            assert_equal [lsort [get_keys $contents]] [lsort [array names myhash]]
+        }
+        r config set hash-max-ziplist-value $original_max_value
+    }
+
+    test "HRANDFIELD with RESP3" {
+        r hello 3
+        set res [r hrandfield myhash 3 withvalues]
+        assert_equal [llength $res] 3
+        assert_equal [llength [lindex $res 1]] 2
+
+        set res [r hrandfield myhash 3]
+        assert_equal [llength $res] 3
+        assert_equal [llength [lindex $res 1]] 1
+    }
+    r hello 2
+
+    test "HRANDFIELD count of 0 is handled correctly" {
+        r hrandfield myhash 0
+    } {}
+
+    test "HRANDFIELD with <count> against non existing key" {
+        r hrandfield nonexisting_key 100
+    } {}
+
+    # Make sure we can distinguish between an empty array and a null response
+    r readraw 1
+
+    test "HRANDFIELD count of 0 is handled correctly - emptyarray" {
+        r hrandfield myhash 0
+    } {*0}
+
+    test "HRANDFIELD with <count> against non existing key - emptyarray" {
+        r hrandfield nonexisting_key 100
+    } {*0}
+
+    r readraw 0
+
+    foreach {type contents} "
+        hashtable {{a 1} {b 2} {c 3} {d 4} {e 5} {6 f} {7 g} {8 h} {9 i} {[randstring 70 90 alpha] 10}}
+        ziplist {{a 1} {b 2} {c 3} {d 4} {e 5} {6 f} {7 g} {8 h} {9 i} {10 j}} " {
+        test "HRANDFIELD with <count> - $type" {
+            set original_max_value [lindex [r config get hash-max-ziplist-value] 1]
+            r config set hash-max-ziplist-value 10
+            create_hash myhash $contents
+            assert_encoding $type myhash
+
+            # create a dict for easy lookup
+            unset -nocomplain mydict
+            foreach {k v} [r hgetall myhash] {
+                dict append mydict $k $v
+            }
+
+            # We'll stress different parts of the code, see the implementation
+            # of HRANDFIELD for more information, but basically there are
+            # four different code paths.
+
+            # PATH 1: Use negative count.
+
+            # 1) Check that it returns repeated elements with and without values.
+            set res [r hrandfield myhash -20]
+            assert_equal [llength $res] 20
+            set res [r hrandfield myhash -1001]
+            assert_equal [llength $res] 1001
+            # again with WITHVALUES
+            set res [r hrandfield myhash -20 withvalues]
+            assert_equal [llength $res] 40
+            set res [r hrandfield myhash -1001 withvalues]
+            assert_equal [llength $res] 2002
+
+            # Test random uniform distribution
+            # df = 9, 40 means 0.00001 probability
+            set res [r hrandfield myhash -1000]
+            assert_lessthan [chi_square_value $res] 40
+
+            # 2) Check that all the elements actually belong to the original hash.
+            foreach {key val} $res {
+                assert {[dict exists $mydict $key]}
+            }
+
+            # 3) Check that eventually all the elements are returned.
+            #    Use both WITHVALUES and without
+            unset -nocomplain auxset
+            set iterations 1000
+            while {$iterations != 0} {
+                incr iterations -1
+                if {[expr {$iterations % 2}] == 0} {
+                    set res [r hrandfield myhash -3 withvalues]
+                    foreach {key val} $res {
+                        dict append auxset $key $val
+                    }
+                } else {
+                    set res [r hrandfield myhash -3]
+                    foreach key $res {
+                        dict append auxset $key $val
+                    }
+                }
+                if {[lsort [dict keys $mydict]] eq
+                    [lsort [dict keys $auxset]]} {
+                    break;
+                }
+            }
+            assert {$iterations != 0}
+
+            # PATH 2: positive count (unique behavior) with requested size
+            # equal or greater than set size.
+            foreach size {10 20} {
+                set res [r hrandfield myhash $size]
+                assert_equal [llength $res] 10
+                assert_equal [lsort $res] [lsort [dict keys $mydict]]
+
+                # again with WITHVALUES
+                set res [r hrandfield myhash $size withvalues]
+                assert_equal [llength $res] 20
+                assert_equal [lsort $res] [lsort $mydict]
+            }
+
+            # PATH 3: Ask almost as elements as there are in the set.
+            # In this case the implementation will duplicate the original
+            # set and will remove random elements up to the requested size.
+            #
+            # PATH 4: Ask a number of elements definitely smaller than
+            # the set size.
+            #
+            # We can test both the code paths just changing the size but
+            # using the same code.
+            foreach size {8 2} {
+                set res [r hrandfield myhash $size]
+                assert_equal [llength $res] $size
+                # again with WITHVALUES
+                set res [r hrandfield myhash $size withvalues]
+                assert_equal [llength $res] [expr {$size * 2}]
+
+                # 1) Check that all the elements actually belong to the
+                # original set.
+                foreach ele [dict keys $res] {
+                    assert {[dict exists $mydict $ele]}
+                }
+
+                # 2) Check that eventually all the elements are returned.
+                #    Use both WITHVALUES and without
+                unset -nocomplain auxset
+                unset -nocomplain allkey
+                set iterations [expr {1000 / $size}]
+                set all_ele_return false
+                while {$iterations != 0} {
+                    incr iterations -1
+                    if {[expr {$iterations % 2}] == 0} {
+                        set res [r hrandfield myhash $size withvalues]
+                        foreach {key value} $res {
+                            dict append auxset $key $value
+                            lappend allkey $key
+                        }
+                    } else {
+                        set res [r hrandfield myhash $size]
+                        foreach key $res {
+                            dict append auxset $key
+                            lappend allkey $key
+                        }
+                    }
+                    if {[lsort [dict keys $mydict]] eq
+                        [lsort [dict keys $auxset]]} {
+                        set all_ele_return true
+                    }
+                }
+                assert_equal $all_ele_return true
+                # df = 9, 40 means 0.00001 probability
+                assert_lessthan [chi_square_value $allkey] 40
+            }
+        }
+        r config set hash-max-ziplist-value $original_max_value
+    }
+
+
+    test {HSET/HLEN - Big hash creation} {
+        array set bighash {}
+        for {set i 0} {$i < 1024} {incr i} {
+            set key __avoid_collisions__[randstring 0 8 alpha]
+            set val __avoid_collisions__[randstring 0 8 alpha]
+            if {[info exists bighash($key)]} {
+                incr i -1
+                continue
+            }
+            r hset bighash $key $val
+            set bighash($key) $val
+        }
+        list [r hlen bighash]
+    } {1024}
+
+    test {Is the big hash encoded with an hash table?} {
+        assert_encoding hashtable bighash
+    }
+
+    test {HGET against the small hash} {
+        set err {}
+        foreach k [array names smallhash *] {
+            if {$smallhash($k) ne [r hget smallhash $k]} {
+                set err "$smallhash($k) != [r hget smallhash $k]"
+                break
+            }
+        }
+        set _ $err
+    } {}
+
+    test {HGET against the big hash} {
+        set err {}
+        foreach k [array names bighash *] {
+            if {$bighash($k) ne [r hget bighash $k]} {
+                set err "$bighash($k) != [r hget bighash $k]"
+                break
+            }
+        }
+        set _ $err
+    } {}
+
+    test {HGET against non existing key} {
+        set rv {}
+        lappend rv [r hget smallhash __123123123__]
+        lappend rv [r hget bighash __123123123__]
+        set _ $rv
+    } {{} {}}
+
+    test {HSET in update and insert mode} {
+        set rv {}
+        set k [lindex [array names smallhash *] 0]
+        lappend rv [r hset smallhash $k newval1]
+        set smallhash($k) newval1
+        lappend rv [r hget smallhash $k]
+        lappend rv [r hset smallhash __foobar123__ newval]
+        set k [lindex [array names bighash *] 0]
+        lappend rv [r hset bighash $k newval2]
+        set bighash($k) newval2
+        lappend rv [r hget bighash $k]
+        lappend rv [r hset bighash __foobar123__ newval]
+        lappend rv [r hdel smallhash __foobar123__]
+        lappend rv [r hdel bighash __foobar123__]
+        set _ $rv
+    } {0 newval1 1 0 newval2 1 1 1}
+
+    test {HSETNX target key missing - small hash} {
+        r hsetnx smallhash __123123123__ foo
+        r hget smallhash __123123123__
+    } {foo}
+
+    test {HSETNX target key exists - small hash} {
+        r hsetnx smallhash __123123123__ bar
+        set result [r hget smallhash __123123123__]
+        r hdel smallhash __123123123__
+        set _ $result
+    } {foo}
+
+    test {HSETNX target key missing - big hash} {
+        r hsetnx bighash __123123123__ foo
+        r hget bighash __123123123__
+    } {foo}
+
+    test {HSETNX target key exists - big hash} {
+        r hsetnx bighash __123123123__ bar
+        set result [r hget bighash __123123123__]
+        r hdel bighash __123123123__
+        set _ $result
+    } {foo}
+
+    test {HMSET wrong number of args} {
+        catch {r hmset smallhash key1 val1 key2} err
+        format $err
+    } {*wrong number*}
+
+    test {HMSET - small hash} {
+        set args {}
+        foreach {k v} [array get smallhash] {
+            set newval [randstring 0 8 alpha]
+            set smallhash($k) $newval
+            lappend args $k $newval
+        }
+        r hmset smallhash {*}$args
+    } {OK}
+
+    test {HMSET - big hash} {
+        set args {}
+        foreach {k v} [array get bighash] {
+            set newval [randstring 0 8 alpha]
+            set bighash($k) $newval
+            lappend args $k $newval
+        }
+        r hmset bighash {*}$args
+    } {OK}
+
+    test {HMGET against non existing key and fields} {
+        set rv {}
+        lappend rv [r hmget doesntexist __123123123__ __456456456__]
+        lappend rv [r hmget smallhash __123123123__ __456456456__]
+        lappend rv [r hmget bighash __123123123__ __456456456__]
+        set _ $rv
+    } {{{} {}} {{} {}} {{} {}}}
+
+    test {HMGET against wrong type} {
+        r set wrongtype somevalue
+        assert_error "*wrong*" {r hmget wrongtype field1 field2}
+    }
+
+    test {HMGET - small hash} {
+        set keys {}
+        set vals {}
+        foreach {k v} [array get smallhash] {
+            lappend keys $k
+            lappend vals $v
+        }
+        set err {}
+        set result [r hmget smallhash {*}$keys]
+        if {$vals ne $result} {
+            set err "$vals != $result"
+            break
+        }
+        set _ $err
+    } {}
+
+    test {HMGET - big hash} {
+        set keys {}
+        set vals {}
+        foreach {k v} [array get bighash] {
+            lappend keys $k
+            lappend vals $v
+        }
+        set err {}
+        set result [r hmget bighash {*}$keys]
+        if {$vals ne $result} {
+            set err "$vals != $result"
+            break
+        }
+        set _ $err
+    } {}
+
+    test {HKEYS - small hash} {
+        lsort [r hkeys smallhash]
+    } [lsort [array names smallhash *]]
+
+    test {HKEYS - big hash} {
+        lsort [r hkeys bighash]
+    } [lsort [array names bighash *]]
+
+    test {HVALS - small hash} {
+        set vals {}
+        foreach {k v} [array get smallhash] {
+            lappend vals $v
+        }
+        set _ [lsort $vals]
+    } [lsort [r hvals smallhash]]
+
+    test {HVALS - big hash} {
+        set vals {}
+        foreach {k v} [array get bighash] {
+            lappend vals $v
+        }
+        set _ [lsort $vals]
+    } [lsort [r hvals bighash]]
+
+    test {HGETALL - small hash} {
+        lsort [r hgetall smallhash]
+    } [lsort [array get smallhash]]
+
+    test {HGETALL - big hash} {
+        lsort [r hgetall bighash]
+    } [lsort [array get bighash]]
+
+    test {HDEL and return value} {
+        set rv {}
+        lappend rv [r hdel smallhash nokey]
+        lappend rv [r hdel bighash nokey]
+        set k [lindex [array names smallhash *] 0]
+        lappend rv [r hdel smallhash $k]
+        lappend rv [r hdel smallhash $k]
+        lappend rv [r hget smallhash $k]
+        unset smallhash($k)
+        set k [lindex [array names bighash *] 0]
+        lappend rv [r hdel bighash $k]
+        lappend rv [r hdel bighash $k]
+        lappend rv [r hget bighash $k]
+        unset bighash($k)
+        set _ $rv
+    } {0 0 1 0 {} 1 0 {}}
+
+    test {HDEL - more than a single value} {
+        set rv {}
+        r del myhash
+        r hmset myhash a 1 b 2 c 3
+        assert_equal 0 [r hdel myhash x y]
+        assert_equal 2 [r hdel myhash a c f]
+        r hgetall myhash
+    } {b 2}
+
+    test {HDEL - hash becomes empty before deleting all specified fields} {
+        r del myhash
+        r hmset myhash a 1 b 2 c 3
+        assert_equal 3 [r hdel myhash a b c d e]
+        assert_equal 0 [r exists myhash]
+    }
+
+    test {HEXISTS} {
+        set rv {}
+        set k [lindex [array names smallhash *] 0]
+        lappend rv [r hexists smallhash $k]
+        lappend rv [r hexists smallhash nokey]
+        set k [lindex [array names bighash *] 0]
+        lappend rv [r hexists bighash $k]
+        lappend rv [r hexists bighash nokey]
+    } {1 0 1 0}
+
+    test {Is a ziplist encoded Hash promoted on big payload?} {
+        r hset smallhash foo [string repeat a 1024]
+        r debug object smallhash
+    } {*hashtable*}
+
+    test {HINCRBY against non existing database key} {
+        r del htest
+        list [r hincrby htest foo 2]
+    } {2}
+
+    test {HINCRBY against non existing hash key} {
+        set rv {}
+        r hdel smallhash tmp
+        r hdel bighash tmp
+        lappend rv [r hincrby smallhash tmp 2]
+        lappend rv [r hget smallhash tmp]
+        lappend rv [r hincrby bighash tmp 2]
+        lappend rv [r hget bighash tmp]
+    } {2 2 2 2}
+
+    test {HINCRBY against hash key created by hincrby itself} {
+        set rv {}
+        lappend rv [r hincrby smallhash tmp 3]
+        lappend rv [r hget smallhash tmp]
+        lappend rv [r hincrby bighash tmp 3]
+        lappend rv [r hget bighash tmp]
+    } {5 5 5 5}
+
+    test {HINCRBY against hash key originally set with HSET} {
+        r hset smallhash tmp 100
+        r hset bighash tmp 100
+        list [r hincrby smallhash tmp 2] [r hincrby bighash tmp 2]
+    } {102 102}
+
+    test {HINCRBY over 32bit value} {
+        r hset smallhash tmp 17179869184
+        r hset bighash tmp 17179869184
+        list [r hincrby smallhash tmp 1] [r hincrby bighash tmp 1]
+    } {17179869185 17179869185}
+
+    test {HINCRBY over 32bit value with over 32bit increment} {
+        r hset smallhash tmp 17179869184
+        r hset bighash tmp 17179869184
+        list [r hincrby smallhash tmp 17179869184] [r hincrby bighash tmp 17179869184]
+    } {34359738368 34359738368}
+
+    test {HINCRBY fails against hash value with spaces (left)} {
+        r hset smallhash str " 11"
+        r hset bighash str " 11"
+        catch {r hincrby smallhash str 1} smallerr
+        catch {r hincrby bighash str 1} bigerr
+        set rv {}
+        lappend rv [string match "ERR*not an integer*" $smallerr]
+        lappend rv [string match "ERR*not an integer*" $bigerr]
+    } {1 1}
+
+    test {HINCRBY fails against hash value with spaces (right)} {
+        r hset smallhash str "11 "
+        r hset bighash str "11 "
+        catch {r hincrby smallhash str 1} smallerr
+        catch {r hincrby bighash str 1} bigerr
+        set rv {}
+        lappend rv [string match "ERR*not an integer*" $smallerr]
+        lappend rv [string match "ERR*not an integer*" $bigerr]
+    } {1 1}
+
+    test {HINCRBY can detect overflows} {
+        set e {}
+        r hset hash n -9223372036854775484
+        assert {[r hincrby hash n -1] == -9223372036854775485}
+        catch {r hincrby hash n -10000} e
+        set e
+    } {*overflow*}
+
+    test {HINCRBYFLOAT against non existing database key} {
+        r del htest
+        list [r hincrbyfloat htest foo 2.5]
+    } {2.5}
+
+    test {HINCRBYFLOAT against non existing hash key} {
+        set rv {}
+        r hdel smallhash tmp
+        r hdel bighash tmp
+        lappend rv [roundFloat [r hincrbyfloat smallhash tmp 2.5]]
+        lappend rv [roundFloat [r hget smallhash tmp]]
+        lappend rv [roundFloat [r hincrbyfloat bighash tmp 2.5]]
+        lappend rv [roundFloat [r hget bighash tmp]]
+    } {2.5 2.5 2.5 2.5}
+
+    test {HINCRBYFLOAT against hash key created by hincrby itself} {
+        set rv {}
+        lappend rv [roundFloat [r hincrbyfloat smallhash tmp 3.5]]
+        lappend rv [roundFloat [r hget smallhash tmp]]
+        lappend rv [roundFloat [r hincrbyfloat bighash tmp 3.5]]
+        lappend rv [roundFloat [r hget bighash tmp]]
+    } {6 6 6 6}
+
+    test {HINCRBYFLOAT against hash key originally set with HSET} {
+        r hset smallhash tmp 100
+        r hset bighash tmp 100
+        list [roundFloat [r hincrbyfloat smallhash tmp 2.5]] \
+             [roundFloat [r hincrbyfloat bighash tmp 2.5]]
+    } {102.5 102.5}
+
+    test {HINCRBYFLOAT over 32bit value} {
+        r hset smallhash tmp 17179869184
+        r hset bighash tmp 17179869184
+        list [r hincrbyfloat smallhash tmp 1] \
+             [r hincrbyfloat bighash tmp 1]
+    } {17179869185 17179869185}
+
+    test {HINCRBYFLOAT over 32bit value with over 32bit increment} {
+        r hset smallhash tmp 17179869184
+        r hset bighash tmp 17179869184
+        list [r hincrbyfloat smallhash tmp 17179869184] \
+             [r hincrbyfloat bighash tmp 17179869184]
+    } {34359738368 34359738368}
+
+    test {HINCRBYFLOAT fails against hash value with spaces (left)} {
+        r hset smallhash str " 11"
+        r hset bighash str " 11"
+        catch {r hincrbyfloat smallhash str 1} smallerr
+        catch {r hincrbyfloat bighash str 1} bigerr
+        set rv {}
+        lappend rv [string match "ERR*not*float*" $smallerr]
+        lappend rv [string match "ERR*not*float*" $bigerr]
+    } {1 1}
+
+    test {HINCRBYFLOAT fails against hash value with spaces (right)} {
+        r hset smallhash str "11 "
+        r hset bighash str "11 "
+        catch {r hincrbyfloat smallhash str 1} smallerr
+        catch {r hincrbyfloat bighash str 1} bigerr
+        set rv {}
+        lappend rv [string match "ERR*not*float*" $smallerr]
+        lappend rv [string match "ERR*not*float*" $bigerr]
+    } {1 1}
+
+    test {HINCRBYFLOAT fails against hash value that contains a null-terminator in the middle} {
+        r hset h f "1\x002"
+        catch {r hincrbyfloat h f 1} err
+        set rv {}
+        lappend rv [string match "ERR*not*float*" $err]
+    } {1}
+
+    test {HSTRLEN against the small hash} {
+        set err {}
+        foreach k [array names smallhash *] {
+            if {[string length $smallhash($k)] ne [r hstrlen smallhash $k]} {
+                set err "[string length $smallhash($k)] != [r hstrlen smallhash $k]"
+                break
+            }
+        }
+        set _ $err
+    } {}
+
+    test {HSTRLEN against the big hash} {
+        set err {}
+        foreach k [array names bighash *] {
+            if {[string length $bighash($k)] ne [r hstrlen bighash $k]} {
+                set err "[string length $bighash($k)] != [r hstrlen bighash $k]"
+                puts "HSTRLEN and logical length mismatch:"
+                puts "key: $k"
+                puts "Logical content: $bighash($k)"
+                puts "Server  content: [r hget bighash $k]"
+            }
+        }
+        set _ $err
+    } {}
+
+    test {HSTRLEN against non existing field} {
+        set rv {}
+        lappend rv [r hstrlen smallhash __123123123__]
+        lappend rv [r hstrlen bighash __123123123__]
+        set _ $rv
+    } {0 0}
+
+    test {HSTRLEN corner cases} {
+        set vals {
+            -9223372036854775808 9223372036854775807 9223372036854775808
+            {} 0 -1 x
+        }
+        foreach v $vals {
+            r hmset smallhash field $v
+            r hmset bighash field $v
+            set len1 [string length $v]
+            set len2 [r hstrlen smallhash field]
+            set len3 [r hstrlen bighash field]
+            assert {$len1 == $len2}
+            assert {$len2 == $len3}
+        }
+    }
+
+    test {Hash ziplist regression test for large keys} {
+        r hset hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk a
+        r hset hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk b
+        r hget hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
+    } {b}
+
+    foreach size {10 512} {
+        test "Hash fuzzing #1 - $size fields" {
+            for {set times 0} {$times < 10} {incr times} {
+                catch {unset hash}
+                array set hash {}
+                r del hash
+
+                # Create
+                for {set j 0} {$j < $size} {incr j} {
+                    set field [randomValue]
+                    set value [randomValue]
+                    r hset hash $field $value
+                    set hash($field) $value
+                }
+
+                # Verify
+                foreach {k v} [array get hash] {
+                    assert_equal $v [r hget hash $k]
+                }
+                assert_equal [array size hash] [r hlen hash]
+            }
+        }
+
+        test "Hash fuzzing #2 - $size fields" {
+            for {set times 0} {$times < 10} {incr times} {
+                catch {unset hash}
+                array set hash {}
+                r del hash
+
+                # Create
+                for {set j 0} {$j < $size} {incr j} {
+                    randpath {
+                        set field [randomValue]
+                        set value [randomValue]
+                        r hset hash $field $value
+                        set hash($field) $value
+                    } {
+                        set field [randomSignedInt 512]
+                        set value [randomSignedInt 512]
+                        r hset hash $field $value
+                        set hash($field) $value
+                    } {
+                        randpath {
+                            set field [randomValue]
+                        } {
+                            set field [randomSignedInt 512]
+                        }
+                        r hdel hash $field
+                        unset -nocomplain hash($field)
+                    }
+                }
+
+                # Verify
+                foreach {k v} [array get hash] {
+                    assert_equal $v [r hget hash $k]
+                }
+                assert_equal [array size hash] [r hlen hash]
+            }
+        }
+    }
+
+    test {Stress test the hash ziplist -> hashtable encoding conversion} {
+        r config set hash-max-ziplist-entries 32
+        for {set j 0} {$j < 100} {incr j} {
+            r del myhash
+            for {set i 0} {$i < 64} {incr i} {
+                r hset myhash [randomValue] [randomValue]
+            }
+            assert {[r object encoding myhash] eq {hashtable}}
+        }
+    }
+
+    # The following test can only be executed if we don't use Valgrind, and if
+    # we are using x86_64 architecture, because:
+    #
+    # 1) Valgrind has floating point limitations, no support for 80 bits math.
+    # 2) Other archs may have the same limits.
+    #
+    # 1.23 cannot be represented correctly with 64 bit doubles, so we skip
+    # the test, since we are only testing pretty printing here and is not
+    # a bug if the program outputs things like 1.299999...
+    if {!$::valgrind && [string match *x86_64* [exec uname -a]]} {
+        test {Test HINCRBYFLOAT for correct float representation (issue #2846)} {
+            r del myhash
+            assert {[r hincrbyfloat myhash float 1.23] eq {1.23}}
+            assert {[r hincrbyfloat myhash float 0.77] eq {2}}
+            assert {[r hincrbyfloat myhash float -0.1] eq {1.9}}
+        }
+    }
+
+    test {Hash ziplist of various encodings} {
+        r del k
+        r config set hash-max-ziplist-entries 1000000000
+        r config set hash-max-ziplist-value 1000000000
+        r hset k ZIP_INT_8B 127
+        r hset k ZIP_INT_16B 32767
+        r hset k ZIP_INT_32B 2147483647
+        r hset k ZIP_INT_64B 9223372036854775808
+        r hset k ZIP_INT_IMM_MIN 0
+        r hset k ZIP_INT_IMM_MAX 12
+        r hset k ZIP_STR_06B [string repeat x 31]
+        r hset k ZIP_STR_14B [string repeat x 8191]
+        r hset k ZIP_STR_32B [string repeat x 65535]
+        set k [r hgetall k]
+        set dump [r dump k]
+
+        # will be converted to dict at RESTORE
+        r config set hash-max-ziplist-entries 2
+        r config set sanitize-dump-payload no
+        r restore kk 0 $dump
+        set kk [r hgetall kk]
+
+        # make sure the values are right
+        assert_equal [lsort $k] [lsort $kk]
+        assert_equal [dict get $k ZIP_STR_06B] [string repeat x 31]
+        set k [dict remove $k ZIP_STR_06B]
+        assert_equal [dict get $k ZIP_STR_14B] [string repeat x 8191]
+        set k [dict remove $k ZIP_STR_14B]
+        assert_equal [dict get $k ZIP_STR_32B] [string repeat x 65535]
+        set k [dict remove $k ZIP_STR_32B]
+        set _ $k
+    } {ZIP_INT_8B 127 ZIP_INT_16B 32767 ZIP_INT_32B 2147483647 ZIP_INT_64B 9223372036854775808 ZIP_INT_IMM_MIN 0 ZIP_INT_IMM_MAX 12}
+
+    test {Hash ziplist of various encodings - sanitize dump} {
+        r config set sanitize-dump-payload yes
+        r restore kk 0 $dump replace
+        set k [r hgetall k]
+        set kk [r hgetall kk]
+
+        # make sure the values are right
+        assert_equal [lsort $k] [lsort $kk]
+        assert_equal [dict get $k ZIP_STR_06B] [string repeat x 31]
+        set k [dict remove $k ZIP_STR_06B]
+        assert_equal [dict get $k ZIP_STR_14B] [string repeat x 8191]
+        set k [dict remove $k ZIP_STR_14B]
+        assert_equal [dict get $k ZIP_STR_32B] [string repeat x 65535]
+        set k [dict remove $k ZIP_STR_32B]
+        set _ $k
+    } {ZIP_INT_8B 127 ZIP_INT_16B 32767 ZIP_INT_32B 2147483647 ZIP_INT_64B 9223372036854775808 ZIP_INT_IMM_MIN 0 ZIP_INT_IMM_MAX 12}
+
+}
diff --git a/redis-stable/tests/unit/type/incr.tcl b/redis-stable/tests/unit/type/incr.tcl
new file mode 100644
index 00000000..dbf45e45
--- /dev/null
+++ b/redis-stable/tests/unit/type/incr.tcl
@@ -0,0 +1,164 @@
+start_server {tags {"incr"}} {
+    test {INCR against non existing key} {
+        set res {}
+        append res [r incr novar]
+        append res [r get novar]
+    } {11}
+
+    test {INCR against key created by incr itself} {
+        r incr novar
+    } {2}
+
+    test {INCR against key originally set with SET} {
+        r set novar 100
+        r incr novar
+    } {101}
+
+    test {INCR over 32bit value} {
+        r set novar 17179869184
+        r incr novar
+    } {17179869185}
+
+    test {INCRBY over 32bit value with over 32bit increment} {
+        r set novar 17179869184
+        r incrby novar 17179869184
+    } {34359738368}
+
+    test {INCR fails against key with spaces (left)} {
+        r set novar "    11"
+        catch {r incr novar} err
+        format $err
+    } {ERR*}
+
+    test {INCR fails against key with spaces (right)} {
+        r set novar "11    "
+        catch {r incr novar} err
+        format $err
+    } {ERR*}
+
+    test {INCR fails against key with spaces (both)} {
+        r set novar "    11    "
+        catch {r incr novar} err
+        format $err
+    } {ERR*}
+
+    test {INCR fails against a key holding a list} {
+        r rpush mylist 1
+        catch {r incr mylist} err
+        r rpop mylist
+        format $err
+    } {WRONGTYPE*}
+
+    test {DECRBY over 32bit value with over 32bit increment, negative res} {
+        r set novar 17179869184
+        r decrby novar 17179869185
+    } {-1}
+
+    test {INCR uses shared objects in the 0-9999 range} {
+        r set foo -1
+        r incr foo
+        assert {[r object refcount foo] > 1}
+        r set foo 9998
+        r incr foo
+        assert {[r object refcount foo] > 1}
+        r incr foo
+        assert {[r object refcount foo] == 1}
+    }
+
+    test {INCR can modify objects in-place} {
+        r set foo 20000
+        r incr foo
+        assert {[r object refcount foo] == 1}
+        set old [lindex [split [r debug object foo]] 1]
+        r incr foo
+        set new [lindex [split [r debug object foo]] 1]
+        assert {[string range $old 0 2] eq "at:"}
+        assert {[string range $new 0 2] eq "at:"}
+        assert {$old eq $new}
+    }
+
+    test {INCRBYFLOAT against non existing key} {
+        r del novar
+        list    [roundFloat [r incrbyfloat novar 1]] \
+                [roundFloat [r get novar]] \
+                [roundFloat [r incrbyfloat novar 0.25]] \
+                [roundFloat [r get novar]]
+    } {1 1 1.25 1.25}
+
+    test {INCRBYFLOAT against key originally set with SET} {
+        r set novar 1.5
+        roundFloat [r incrbyfloat novar 1.5]
+    } {3}
+
+    test {INCRBYFLOAT over 32bit value} {
+        r set novar 17179869184
+        r incrbyfloat novar 1.5
+    } {17179869185.5}
+
+    test {INCRBYFLOAT over 32bit value with over 32bit increment} {
+        r set novar 17179869184
+        r incrbyfloat novar 17179869184
+    } {34359738368}
+
+    test {INCRBYFLOAT fails against key with spaces (left)} {
+        set err {}
+        r set novar "    11"
+        catch {r incrbyfloat novar 1.0} err
+        format $err
+    } {ERR*valid*}
+
+    test {INCRBYFLOAT fails against key with spaces (right)} {
+        set err {}
+        r set novar "11    "
+        catch {r incrbyfloat novar 1.0} err
+        format $err
+    } {ERR*valid*}
+
+    test {INCRBYFLOAT fails against key with spaces (both)} {
+        set err {}
+        r set novar " 11 "
+        catch {r incrbyfloat novar 1.0} err
+        format $err
+    } {ERR*valid*}
+
+    test {INCRBYFLOAT fails against a key holding a list} {
+        r del mylist
+        set err {}
+        r rpush mylist 1
+        catch {r incrbyfloat mylist 1.0} err
+        r del mylist
+        format $err
+    } {WRONGTYPE*}
+
+    # On some platforms strtold("+inf") with valgrind returns a non-inf result
+    if {!$::valgrind} {
+        test {INCRBYFLOAT does not allow NaN or Infinity} {
+            r set foo 0
+            set err {}
+            catch {r incrbyfloat foo +inf} err
+            set err
+            # p.s. no way I can force NaN to test it from the API because
+            # there is no way to increment / decrement by infinity nor to
+            # perform divisions.
+        } {ERR*would produce*}
+    }
+
+    test {INCRBYFLOAT decrement} {
+        r set foo 1
+        roundFloat [r incrbyfloat foo -1.1]
+    } {-0.1}
+
+    test {string to double with null terminator} {
+        r set foo 1
+        r setrange foo 2 2
+        catch {r incrbyfloat foo 1} err
+        format $err
+    } {ERR*valid*}
+
+    test {No negative zero} {
+        r del foo
+        r incrbyfloat foo [expr double(1)/41]
+        r incrbyfloat foo [expr double(-1)/41]
+        r get foo
+    } {0}
+}
diff --git a/redis-stable/tests/unit/type/list-2.tcl b/redis-stable/tests/unit/type/list-2.tcl
new file mode 100644
index 00000000..5874a902
--- /dev/null
+++ b/redis-stable/tests/unit/type/list-2.tcl
@@ -0,0 +1,47 @@
+start_server {
+    tags {"list"}
+    overrides {
+        "list-max-ziplist-size" 4
+    }
+} {
+    source "tests/unit/type/list-common.tcl"
+
+    foreach {type large} [array get largevalue] {
+        tags {"slow"} {
+            test "LTRIM stress testing - $type" {
+                set mylist {}
+                set startlen 32
+                r del mylist
+
+                # Start with the large value to ensure the
+                # right encoding is used.
+                r rpush mylist $large
+                lappend mylist $large
+
+                for {set i 0} {$i < $startlen} {incr i} {
+                    set str [randomInt 9223372036854775807]
+                    r rpush mylist $str
+                    lappend mylist $str
+                }
+
+                for {set i 0} {$i < 1000} {incr i} {
+                    set min [expr {int(rand()*$startlen)}]
+                    set max [expr {$min+int(rand()*$startlen)}]
+                    set before_len [llength $mylist]
+                    set before_len_r [r llen mylist]
+                    assert_equal $before_len $before_len_r
+                    set mylist [lrange $mylist $min $max]
+                    r ltrim mylist $min $max
+                    assert_equal $mylist [r lrange mylist 0 -1] "failed trim"
+
+                    for {set j [r llen mylist]} {$j < $startlen} {incr j} {
+                        set str [randomInt 9223372036854775807]
+                        r rpush mylist $str
+                        lappend mylist $str
+                        assert_equal $mylist [r lrange mylist 0 -1] "failed append match"
+                    }
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/type/list-3.tcl b/redis-stable/tests/unit/type/list-3.tcl
new file mode 100644
index 00000000..b5bd48cb
--- /dev/null
+++ b/redis-stable/tests/unit/type/list-3.tcl
@@ -0,0 +1,122 @@
+start_server {
+    tags {list ziplist}
+    overrides {
+        "list-max-ziplist-size" 16
+    }
+} {
+    test {Explicit regression for a list bug} {
+        set mylist {49376042582 {BkG2o\pIC]4YYJa9cJ4GWZalG[4tin;1D2whSkCOW`mX;SFXGyS8sedcff3fQI^tgPCC@^Nu1J6o]meM@Lko]t_jRyo<xSJ1oObDYd`ppZuW6P@fS278YaOx=s6lvdFlMbP0[SbkI^Kr\HBXtuFaA^mDx:yzS4a[skiiPWhT<nNfAf=aQVfclcuwDrfe;iVuKdNvB9kbfq>tK?tH[\EvWqS]b`o2OCtjg:?nUTwdjpcUm]y:pg5q24q7LlCOwQE^}}
+        r del l
+        r rpush l [lindex $mylist 0]
+        r rpush l [lindex $mylist 1]
+        assert_equal [r lindex l 0] [lindex $mylist 0]
+        assert_equal [r lindex l 1] [lindex $mylist 1]
+    }
+
+    test {Regression for quicklist #3343 bug} {
+        r del mylist
+        r lpush mylist 401
+        r lpush mylist 392
+        r rpush mylist [string repeat x 5105]"799"
+        r lset mylist -1 [string repeat x 1014]"702"
+        r lpop mylist
+        r lset mylist -1 [string repeat x 4149]"852"
+        r linsert mylist before 401 [string repeat x 9927]"12"
+        r lrange mylist 0 -1
+        r ping ; # It's enough if the server is still alive
+    } {PONG}
+
+    test {Stress tester for #3343-alike bugs} {
+        r del key
+        for {set j 0} {$j < 10000} {incr j} {
+            set op [randomInt 6]
+            set small_signed_count [expr 5-[randomInt 10]]
+            if {[randomInt 2] == 0} {
+                set ele [randomInt 1000]
+            } else {
+                set ele [string repeat x [randomInt 10000]][randomInt 1000]
+            }
+            switch $op {
+                0 {r lpush key $ele}
+                1 {r rpush key $ele}
+                2 {r lpop key}
+                3 {r rpop key}
+                4 {
+                    catch {r lset key $small_signed_count $ele}
+                }
+                5 {
+                    set otherele [randomInt 1000]
+                    if {[randomInt 2] == 0} {
+                        set where before
+                    } else {
+                        set where after
+                    }
+                    r linsert key $where $otherele $ele
+                }
+            }
+        }
+    }
+
+    tags {slow} {
+        test {ziplist implementation: value encoding and backlink} {
+            if {$::accurate} {set iterations 100} else {set iterations 10}
+            for {set j 0} {$j < $iterations} {incr j} {
+                r del l
+                set l {}
+                for {set i 0} {$i < 200} {incr i} {
+                    randpath {
+                        set data [string repeat x [randomInt 100000]]
+                    } {
+                        set data [randomInt 65536]
+                    } {
+                        set data [randomInt 4294967296]
+                    } {
+                        set data [randomInt 18446744073709551616]
+                    } {
+                        set data -[randomInt 65536]
+                        if {$data eq {-0}} {set data 0}
+                    } {
+                        set data -[randomInt 4294967296]
+                        if {$data eq {-0}} {set data 0}
+                    } {
+                        set data -[randomInt 18446744073709551616]
+                        if {$data eq {-0}} {set data 0}
+                    }
+                    lappend l $data
+                    r rpush l $data
+                }
+                assert_equal [llength $l] [r llen l]
+                # Traverse backward
+                for {set i 199} {$i >= 0} {incr i -1} {
+                    if {[lindex $l $i] ne [r lindex l $i]} {
+                        assert_equal [lindex $l $i] [r lindex l $i]
+                    }
+                }
+            }
+        }
+
+        test {ziplist implementation: encoding stress testing} {
+            for {set j 0} {$j < 200} {incr j} {
+                r del l
+                set l {}
+                set len [randomInt 400]
+                for {set i 0} {$i < $len} {incr i} {
+                    set rv [randomValue]
+                    randpath {
+                        lappend l $rv
+                        r rpush l $rv
+                    } {
+                        set l [concat [list $rv] $l]
+                        r lpush l $rv
+                    }
+                }
+                assert_equal [llength $l] [r llen l]
+                for {set i 0} {$i < $len} {incr i} {
+                    if {[lindex $l $i] ne [r lindex l $i]} {
+                        assert_equal [lindex $l $i] [r lindex l $i]
+                    }
+                }
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/type/list-common.tcl b/redis-stable/tests/unit/type/list-common.tcl
new file mode 100644
index 00000000..ab45f0b3
--- /dev/null
+++ b/redis-stable/tests/unit/type/list-common.tcl
@@ -0,0 +1,5 @@
+# We need a value larger than list-max-ziplist-value to make sure
+# the list has the right encoding when it is swapped in again.
+array set largevalue {}
+set largevalue(ziplist) "hello"
+set largevalue(linkedlist) [string repeat "hello" 4]
diff --git a/redis-stable/tests/unit/type/list.tcl b/redis-stable/tests/unit/type/list.tcl
new file mode 100644
index 00000000..9be5dd93
--- /dev/null
+++ b/redis-stable/tests/unit/type/list.tcl
@@ -0,0 +1,1157 @@
+proc wait_for_blocked_client {} {
+    wait_for_condition 50 100 {
+        [s blocked_clients] ne 0
+    } else {
+        fail "no blocked clients"
+    }
+}
+
+start_server {
+    tags {"list"}
+    overrides {
+        "list-max-ziplist-size" 5
+    }
+} {
+    source "tests/unit/type/list-common.tcl"
+
+    test {LPOS basic usage} {
+        r DEL mylist
+        r RPUSH mylist a b c 1 2 3 c c
+        assert {[r LPOS mylist a] == 0}
+        assert {[r LPOS mylist c] == 2}
+    }
+
+    test {LPOS RANK (positive and negative rank) option} {
+        assert {[r LPOS mylist c RANK 1] == 2}
+        assert {[r LPOS mylist c RANK 2] == 6}
+        assert {[r LPOS mylist c RANK 4] eq ""}
+        assert {[r LPOS mylist c RANK -1] == 7}
+        assert {[r LPOS mylist c RANK -2] == 6}
+    }
+
+    test {LPOS COUNT option} {
+        assert {[r LPOS mylist c COUNT 0] == {2 6 7}}
+        assert {[r LPOS mylist c COUNT 1] == {2}}
+        assert {[r LPOS mylist c COUNT 2] == {2 6}}
+        assert {[r LPOS mylist c COUNT 100] == {2 6 7}}
+    }
+
+    test {LPOS COUNT + RANK option} {
+        assert {[r LPOS mylist c COUNT 0 RANK 2] == {6 7}}
+        assert {[r LPOS mylist c COUNT 2 RANK -1] == {7 6}}
+    }
+
+    test {LPOS non existing key} {
+        assert {[r LPOS mylistxxx c COUNT 0 RANK 2] eq {}}
+    }
+
+    test {LPOS no match} {
+        assert {[r LPOS mylist x COUNT 2 RANK -1] eq {}}
+        assert {[r LPOS mylist x RANK -1] eq {}}
+    }
+
+    test {LPOS MAXLEN} {
+        assert {[r LPOS mylist a COUNT 0 MAXLEN 1] == {0}}
+        assert {[r LPOS mylist c COUNT 0 MAXLEN 1] == {}}
+        assert {[r LPOS mylist c COUNT 0 MAXLEN 3] == {2}}
+        assert {[r LPOS mylist c COUNT 0 MAXLEN 3 RANK -1] == {7 6}}
+        assert {[r LPOS mylist c COUNT 0 MAXLEN 7 RANK 2] == {6}}
+    }
+
+    test {LPOS when RANK is greater than matches} {
+        r DEL mylist
+        r LPUSH mylist a
+        assert {[r LPOS mylist b COUNT 10 RANK 5] eq {}}
+    }
+
+    test {LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - ziplist} {
+        # first lpush then rpush
+        assert_equal 1 [r lpush myziplist1 aa]
+        assert_equal 2 [r rpush myziplist1 bb]
+        assert_equal 3 [r rpush myziplist1 cc]
+        assert_equal 3 [r llen myziplist1]
+        assert_equal aa [r lindex myziplist1 0]
+        assert_equal bb [r lindex myziplist1 1]
+        assert_equal cc [r lindex myziplist1 2]
+        assert_equal {} [r lindex myziplist2 3]
+        assert_equal cc [r rpop myziplist1]
+        assert_equal aa [r lpop myziplist1]
+        assert_encoding quicklist myziplist1
+
+        # first rpush then lpush
+        assert_equal 1 [r rpush myziplist2 a]
+        assert_equal 2 [r lpush myziplist2 b]
+        assert_equal 3 [r lpush myziplist2 c]
+        assert_equal 3 [r llen myziplist2]
+        assert_equal c [r lindex myziplist2 0]
+        assert_equal b [r lindex myziplist2 1]
+        assert_equal a [r lindex myziplist2 2]
+        assert_equal {} [r lindex myziplist2 3]
+        assert_equal a [r rpop myziplist2]
+        assert_equal c [r lpop myziplist2]
+        assert_encoding quicklist myziplist2
+    }
+
+    test {LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - regular list} {
+        # first lpush then rpush
+        assert_equal 1 [r lpush mylist1 $largevalue(linkedlist)]
+        assert_encoding quicklist mylist1
+        assert_equal 2 [r rpush mylist1 b]
+        assert_equal 3 [r rpush mylist1 c]
+        assert_equal 3 [r llen mylist1]
+        assert_equal $largevalue(linkedlist) [r lindex mylist1 0]
+        assert_equal b [r lindex mylist1 1]
+        assert_equal c [r lindex mylist1 2]
+        assert_equal {} [r lindex mylist1 3]
+        assert_equal c [r rpop mylist1]
+        assert_equal $largevalue(linkedlist) [r lpop mylist1]
+
+        # first rpush then lpush
+        assert_equal 1 [r rpush mylist2 $largevalue(linkedlist)]
+        assert_encoding quicklist mylist2
+        assert_equal 2 [r lpush mylist2 b]
+        assert_equal 3 [r lpush mylist2 c]
+        assert_equal 3 [r llen mylist2]
+        assert_equal c [r lindex mylist2 0]
+        assert_equal b [r lindex mylist2 1]
+        assert_equal $largevalue(linkedlist) [r lindex mylist2 2]
+        assert_equal {} [r lindex mylist2 3]
+        assert_equal $largevalue(linkedlist) [r rpop mylist2]
+        assert_equal c [r lpop mylist2]
+    }
+
+    test {R/LPOP against empty list} {
+        r lpop non-existing-list
+    } {}
+    
+    test {R/LPOP with the optional count argument} {
+        assert_equal 7 [r lpush listcount aa bb cc dd ee ff gg]
+        assert_equal {} [r lpop listcount 0]
+        assert_equal {gg} [r lpop listcount 1]
+        assert_equal {ff ee} [r lpop listcount 2]
+        assert_equal {aa bb} [r rpop listcount 2]
+        assert_equal {cc} [r rpop listcount 1]
+        assert_equal {dd} [r rpop listcount 123]
+        assert_error "*ERR*range*" {r lpop forbarqaz -123}
+    }
+
+    test {Variadic RPUSH/LPUSH} {
+        r del mylist
+        assert_equal 4 [r lpush mylist a b c d]
+        assert_equal 8 [r rpush mylist 0 1 2 3]
+        assert_equal {d c b a 0 1 2 3} [r lrange mylist 0 -1]
+    }
+
+    test {DEL a list} {
+        assert_equal 1 [r del mylist2]
+        assert_equal 0 [r exists mylist2]
+        assert_equal 0 [r llen mylist2]
+    }
+
+    proc create_list {key entries} {
+        r del $key
+        foreach entry $entries { r rpush $key $entry }
+        assert_encoding quicklist $key
+    }
+
+    foreach {type large} [array get largevalue] {
+        test "BLPOP, BRPOP: single existing list - $type" {
+            set rd [redis_deferring_client]
+            create_list blist "a b $large c d"
+
+            $rd blpop blist 1
+            assert_equal {blist a} [$rd read]
+            $rd brpop blist 1
+            assert_equal {blist d} [$rd read]
+
+            $rd blpop blist 1
+            assert_equal {blist b} [$rd read]
+            $rd brpop blist 1
+            assert_equal {blist c} [$rd read]
+        }
+
+        test "BLPOP, BRPOP: multiple existing lists - $type" {
+            set rd [redis_deferring_client]
+            create_list blist1 "a $large c"
+            create_list blist2 "d $large f"
+
+            $rd blpop blist1 blist2 1
+            assert_equal {blist1 a} [$rd read]
+            $rd brpop blist1 blist2 1
+            assert_equal {blist1 c} [$rd read]
+            assert_equal 1 [r llen blist1]
+            assert_equal 3 [r llen blist2]
+
+            $rd blpop blist2 blist1 1
+            assert_equal {blist2 d} [$rd read]
+            $rd brpop blist2 blist1 1
+            assert_equal {blist2 f} [$rd read]
+            assert_equal 1 [r llen blist1]
+            assert_equal 1 [r llen blist2]
+        }
+
+        test "BLPOP, BRPOP: second list has an entry - $type" {
+            set rd [redis_deferring_client]
+            r del blist1
+            create_list blist2 "d $large f"
+
+            $rd blpop blist1 blist2 1
+            assert_equal {blist2 d} [$rd read]
+            $rd brpop blist1 blist2 1
+            assert_equal {blist2 f} [$rd read]
+            assert_equal 0 [r llen blist1]
+            assert_equal 1 [r llen blist2]
+        }
+
+        test "BRPOPLPUSH - $type" {
+            r del target
+            r rpush target bar
+
+            set rd [redis_deferring_client]
+            create_list blist "a b $large c d"
+
+            $rd brpoplpush blist target 1
+            assert_equal d [$rd read]
+
+            assert_equal d [r lpop target]
+            assert_equal "a b $large c" [r lrange blist 0 -1]
+        }
+
+        foreach wherefrom {left right} {
+            foreach whereto {left right} {
+                test "BLMOVE $wherefrom $whereto - $type" {
+                    r del target
+                    r rpush target bar
+
+                    set rd [redis_deferring_client]
+                    create_list blist "a b $large c d"
+
+                    $rd blmove blist target $wherefrom $whereto 1
+                    set poppedelement [$rd read]
+
+                    if {$wherefrom eq "right"} {
+                        assert_equal d $poppedelement
+                        assert_equal "a b $large c" [r lrange blist 0 -1]
+                    } else {
+                        assert_equal a $poppedelement
+                        assert_equal "b $large c d" [r lrange blist 0 -1]
+                    }
+
+                    if {$whereto eq "right"} {
+                        assert_equal $poppedelement [r rpop target]
+                    } else {
+                        assert_equal $poppedelement [r lpop target]
+                    }
+                }
+            }
+        }
+    }
+
+    test "BLPOP, LPUSH + DEL should not awake blocked client" {
+        set rd [redis_deferring_client]
+        r del list
+
+        $rd blpop list 0
+        r multi
+        r lpush list a
+        r del list
+        r exec
+        r del list
+        r lpush list b
+        $rd read
+    } {list b}
+
+    test "BLPOP, LPUSH + DEL + SET should not awake blocked client" {
+        set rd [redis_deferring_client]
+        r del list
+
+        $rd blpop list 0
+        after 100 ;# Make sure rd is blocked before MULTI
+
+        r multi
+        r lpush list a
+        r del list
+        r set list foo
+        r exec
+        r del list
+        r lpush list b
+        $rd read
+    } {list b}
+
+    test "BLPOP with same key multiple times should work (issue #801)" {
+        set rd [redis_deferring_client]
+        r del list1 list2
+
+        # Data arriving after the BLPOP.
+        $rd blpop list1 list2 list2 list1 0
+        r lpush list1 a
+        assert_equal [$rd read] {list1 a}
+        $rd blpop list1 list2 list2 list1 0
+        r lpush list2 b
+        assert_equal [$rd read] {list2 b}
+
+        # Data already there.
+        r lpush list1 a
+        r lpush list2 b
+        $rd blpop list1 list2 list2 list1 0
+        assert_equal [$rd read] {list1 a}
+        $rd blpop list1 list2 list2 list1 0
+        assert_equal [$rd read] {list2 b}
+    }
+
+    test "MULTI/EXEC is isolated from the point of view of BLPOP" {
+        set rd [redis_deferring_client]
+        r del list
+        $rd blpop list 0
+        r multi
+        r lpush list a
+        r lpush list b
+        r lpush list c
+        r exec
+        $rd read
+    } {list c}
+
+    test "BLPOP with variadic LPUSH" {
+        set rd [redis_deferring_client]
+        r del blist target
+        if {$::valgrind} {after 100}
+        $rd blpop blist 0
+        if {$::valgrind} {after 100}
+        assert_equal 2 [r lpush blist foo bar]
+        if {$::valgrind} {after 100}
+        assert_equal {blist bar} [$rd read]
+        assert_equal foo [lindex [r lrange blist 0 -1] 0]
+    }
+
+    test "BRPOPLPUSH with zero timeout should block indefinitely" {
+        set rd [redis_deferring_client]
+        r del blist target
+        r rpush target bar
+        $rd brpoplpush blist target 0
+        wait_for_condition 100 10 {
+            [s blocked_clients] == 1
+        } else {
+            fail "Timeout waiting for blocked clients"
+        }
+        r rpush blist foo
+        assert_equal foo [$rd read]
+        assert_equal {foo bar} [r lrange target 0 -1]
+    }
+
+    foreach wherefrom {left right} {
+        foreach whereto {left right} {
+            test "BLMOVE $wherefrom $whereto with zero timeout should block indefinitely" {
+                set rd [redis_deferring_client]
+                r del blist target
+                r rpush target bar
+                $rd blmove blist target $wherefrom $whereto 0
+                wait_for_condition 100 10 {
+                    [s blocked_clients] == 1
+                } else {
+                    fail "Timeout waiting for blocked clients"
+                }
+                r rpush blist foo
+                assert_equal foo [$rd read]
+                if {$whereto eq "right"} {
+                    assert_equal {bar foo} [r lrange target 0 -1]
+                } else {
+                    assert_equal {foo bar} [r lrange target 0 -1]
+                }
+            }
+        }
+    }
+
+    foreach wherefrom {left right} {
+        foreach whereto {left right} {
+            test "BLMOVE ($wherefrom, $whereto) with a client BLPOPing the target list" {
+                set rd [redis_deferring_client]
+                set rd2 [redis_deferring_client]
+                r del blist target
+                $rd2 blpop target 0
+                $rd blmove blist target $wherefrom $whereto 0
+                wait_for_condition 100 10 {
+                    [s blocked_clients] == 2
+                } else {
+                    fail "Timeout waiting for blocked clients"
+                }
+                r rpush blist foo
+                assert_equal foo [$rd read]
+                assert_equal {target foo} [$rd2 read]
+                assert_equal 0 [r exists target]
+            }
+        }
+    }
+
+    test "BRPOPLPUSH with wrong source type" {
+        set rd [redis_deferring_client]
+        r del blist target
+        r set blist nolist
+        $rd brpoplpush blist target 1
+        assert_error "WRONGTYPE*" {$rd read}
+    }
+
+    test "BRPOPLPUSH with wrong destination type" {
+        set rd [redis_deferring_client]
+        r del blist target
+        r set target nolist
+        r lpush blist foo
+        $rd brpoplpush blist target 1
+        assert_error "WRONGTYPE*" {$rd read}
+
+        set rd [redis_deferring_client]
+        r del blist target
+        r set target nolist
+        $rd brpoplpush blist target 0
+        wait_for_condition 100 10 {
+            [s blocked_clients] == 1
+        } else {
+            fail "Timeout waiting for blocked clients"
+        }
+        r rpush blist foo
+        assert_error "WRONGTYPE*" {$rd read}
+        assert_equal {foo} [r lrange blist 0 -1]
+    }
+
+    test "BRPOPLPUSH maintains order of elements after failure" {
+        set rd [redis_deferring_client]
+        r del blist target
+        r set target nolist
+        $rd brpoplpush blist target 0
+        r rpush blist a b c
+        assert_error "WRONGTYPE*" {$rd read}
+        r lrange blist 0 -1
+    } {a b c}
+
+    test "BRPOPLPUSH with multiple blocked clients" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+        r del blist target1 target2
+        r set target1 nolist
+        $rd1 brpoplpush blist target1 0
+        $rd2 brpoplpush blist target2 0
+        r lpush blist foo
+
+        assert_error "WRONGTYPE*" {$rd1 read}
+        assert_equal {foo} [$rd2 read]
+        assert_equal {foo} [r lrange target2 0 -1]
+    }
+
+    test "Linked LMOVEs" {
+      set rd1 [redis_deferring_client]
+      set rd2 [redis_deferring_client]
+
+      r del list1 list2 list3
+
+      $rd1 blmove list1 list2 right left 0
+      $rd2 blmove list2 list3 left right 0
+
+      r rpush list1 foo
+
+      assert_equal {} [r lrange list1 0 -1]
+      assert_equal {} [r lrange list2 0 -1]
+      assert_equal {foo} [r lrange list3 0 -1]
+    }
+
+    test "Circular BRPOPLPUSH" {
+      set rd1 [redis_deferring_client]
+      set rd2 [redis_deferring_client]
+
+      r del list1 list2
+
+      $rd1 brpoplpush list1 list2 0
+      $rd2 brpoplpush list2 list1 0
+
+      r rpush list1 foo
+
+      assert_equal {foo} [r lrange list1 0 -1]
+      assert_equal {} [r lrange list2 0 -1]
+    }
+
+    test "Self-referential BRPOPLPUSH" {
+      set rd [redis_deferring_client]
+
+      r del blist
+
+      $rd brpoplpush blist blist 0
+
+      r rpush blist foo
+
+      assert_equal {foo} [r lrange blist 0 -1]
+    }
+
+    test "BRPOPLPUSH inside a transaction" {
+        r del xlist target
+        r lpush xlist foo
+        r lpush xlist bar
+
+        r multi
+        r brpoplpush xlist target 0
+        r brpoplpush xlist target 0
+        r brpoplpush xlist target 0
+        r lrange xlist 0 -1
+        r lrange target 0 -1
+        r exec
+    } {foo bar {} {} {bar foo}}
+
+    test "PUSH resulting from BRPOPLPUSH affect WATCH" {
+        set blocked_client [redis_deferring_client]
+        set watching_client [redis_deferring_client]
+        r del srclist dstlist somekey
+        r set somekey somevalue
+        $blocked_client brpoplpush srclist dstlist 0
+        $watching_client watch dstlist
+        $watching_client read
+        $watching_client multi
+        $watching_client read
+        $watching_client get somekey
+        $watching_client read
+        r lpush srclist element
+        $watching_client exec
+        $watching_client read
+    } {}
+
+    test "BRPOPLPUSH does not affect WATCH while still blocked" {
+        set blocked_client [redis_deferring_client]
+        set watching_client [redis_deferring_client]
+        r del srclist dstlist somekey
+        r set somekey somevalue
+        $blocked_client brpoplpush srclist dstlist 0
+        $watching_client watch dstlist
+        $watching_client read
+        $watching_client multi
+        $watching_client read
+        $watching_client get somekey
+        $watching_client read
+        $watching_client exec
+        # Blocked BLPOPLPUSH may create problems, unblock it.
+        r lpush srclist element
+        $watching_client read
+    } {somevalue}
+
+    test {BRPOPLPUSH timeout} {
+      set rd [redis_deferring_client]
+
+      $rd brpoplpush foo_list bar_list 1
+      wait_for_condition 100 10 {
+          [s blocked_clients] == 1
+      } else {
+          fail "Timeout waiting for blocked client"
+      }
+      wait_for_condition 500 10 {
+          [s blocked_clients] == 0
+      } else {
+          fail "Timeout waiting for client to unblock"
+      }
+      $rd read
+    } {}
+
+    test "BLPOP when new key is moved into place" {
+        set rd [redis_deferring_client]
+
+        $rd blpop foo 5
+        r lpush bob abc def hij
+        r rename bob foo
+        $rd read
+    } {foo hij}
+
+    test "BLPOP when result key is created by SORT..STORE" {
+        set rd [redis_deferring_client]
+
+        # zero out list from previous test without explicit delete
+        r lpop foo
+        r lpop foo
+        r lpop foo
+
+        $rd blpop foo 5
+        r lpush notfoo hello hola aguacate konichiwa zanzibar
+        r sort notfoo ALPHA store foo
+        $rd read
+    } {foo aguacate}
+
+    foreach {pop} {BLPOP BRPOP} {
+        test "$pop: with single empty list argument" {
+            set rd [redis_deferring_client]
+            r del blist1
+            $rd $pop blist1 1
+            r rpush blist1 foo
+            assert_equal {blist1 foo} [$rd read]
+            assert_equal 0 [r exists blist1]
+        }
+
+        test "$pop: with negative timeout" {
+            set rd [redis_deferring_client]
+            $rd $pop blist1 -1
+            assert_error "ERR*is negative*" {$rd read}
+        }
+
+        test "$pop: with non-integer timeout" {
+            set rd [redis_deferring_client]
+            r del blist1
+            $rd $pop blist1 0.1
+            r rpush blist1 foo
+            assert_equal {blist1 foo} [$rd read]
+            assert_equal 0 [r exists blist1]
+        }
+
+        test "$pop: with zero timeout should block indefinitely" {
+            # To test this, use a timeout of 0 and wait a second.
+            # The blocking pop should still be waiting for a push.
+            set rd [redis_deferring_client]
+            $rd $pop blist1 0
+            after 1000
+            r rpush blist1 foo
+            assert_equal {blist1 foo} [$rd read]
+        }
+
+        test "$pop: second argument is not a list" {
+            set rd [redis_deferring_client]
+            r del blist1 blist2
+            r set blist2 nolist
+            $rd $pop blist1 blist2 1
+            assert_error "WRONGTYPE*" {$rd read}
+        }
+
+        test "$pop: timeout" {
+            set rd [redis_deferring_client]
+            r del blist1 blist2
+            $rd $pop blist1 blist2 1
+            assert_equal {} [$rd read]
+        }
+
+        test "$pop: arguments are empty" {
+            set rd [redis_deferring_client]
+            r del blist1 blist2
+
+            $rd $pop blist1 blist2 1
+            r rpush blist1 foo
+            assert_equal {blist1 foo} [$rd read]
+            assert_equal 0 [r exists blist1]
+            assert_equal 0 [r exists blist2]
+
+            $rd $pop blist1 blist2 1
+            r rpush blist2 foo
+            assert_equal {blist2 foo} [$rd read]
+            assert_equal 0 [r exists blist1]
+            assert_equal 0 [r exists blist2]
+        }
+    }
+
+    test {BLPOP inside a transaction} {
+        r del xlist
+        r lpush xlist foo
+        r lpush xlist bar
+        r multi
+        r blpop xlist 0
+        r blpop xlist 0
+        r blpop xlist 0
+        r exec
+    } {{xlist bar} {xlist foo} {}}
+
+    test {LPUSHX, RPUSHX - generic} {
+        r del xlist
+        assert_equal 0 [r lpushx xlist a]
+        assert_equal 0 [r llen xlist]
+        assert_equal 0 [r rpushx xlist a]
+        assert_equal 0 [r llen xlist]
+    }
+
+    foreach {type large} [array get largevalue] {
+        test "LPUSHX, RPUSHX - $type" {
+            create_list xlist "$large c"
+            assert_equal 3 [r rpushx xlist d]
+            assert_equal 4 [r lpushx xlist a]
+            assert_equal 6 [r rpushx xlist 42 x]
+            assert_equal 9 [r lpushx xlist y3 y2 y1]
+            assert_equal "y1 y2 y3 a $large c d 42 x" [r lrange xlist 0 -1]
+        }
+
+        test "LINSERT - $type" {
+            create_list xlist "a $large c d"
+            assert_equal 5 [r linsert xlist before c zz] "before c"
+            assert_equal "a $large zz c d" [r lrange xlist 0 10] "lrangeA"
+            assert_equal 6 [r linsert xlist after c yy] "after c"
+            assert_equal "a $large zz c yy d" [r lrange xlist 0 10] "lrangeB"
+            assert_equal 7 [r linsert xlist after d dd] "after d"
+            assert_equal -1 [r linsert xlist after bad ddd] "after bad"
+            assert_equal "a $large zz c yy d dd" [r lrange xlist 0 10] "lrangeC"
+            assert_equal 8 [r linsert xlist before a aa] "before a"
+            assert_equal -1 [r linsert xlist before bad aaa] "before bad"
+            assert_equal "aa a $large zz c yy d dd" [r lrange xlist 0 10] "lrangeD"
+
+            # check inserting integer encoded value
+            assert_equal 9 [r linsert xlist before aa 42] "before aa"
+            assert_equal 42 [r lrange xlist 0 0] "lrangeE"
+        }
+    }
+
+    test {LINSERT raise error on bad syntax} {
+        catch {[r linsert xlist aft3r aa 42]} e
+        set e
+    } {*ERR*syntax*error*}
+
+    foreach {type num} {quicklist 250 quicklist 500} {
+        proc check_numbered_list_consistency {key} {
+            set len [r llen $key]
+            for {set i 0} {$i < $len} {incr i} {
+                assert_equal $i [r lindex $key $i]
+                assert_equal [expr $len-1-$i] [r lindex $key [expr (-$i)-1]]
+            }
+        }
+
+        proc check_random_access_consistency {key} {
+            set len [r llen $key]
+            for {set i 0} {$i < $len} {incr i} {
+                set rint [expr int(rand()*$len)]
+                assert_equal $rint [r lindex $key $rint]
+                assert_equal [expr $len-1-$rint] [r lindex $key [expr (-$rint)-1]]
+            }
+        }
+
+        test "LINDEX consistency test - $type" {
+            r del mylist
+            for {set i 0} {$i < $num} {incr i} {
+                r rpush mylist $i
+            }
+            assert_encoding $type mylist
+            check_numbered_list_consistency mylist
+        }
+
+        test "LINDEX random access - $type" {
+            assert_encoding $type mylist
+            check_random_access_consistency mylist
+        }
+
+        test "Check if list is still ok after a DEBUG RELOAD - $type" {
+            r debug reload
+            assert_encoding $type mylist
+            check_numbered_list_consistency mylist
+            check_random_access_consistency mylist
+        }
+    }
+
+    test {LLEN against non-list value error} {
+        r del mylist
+        r set mylist foobar
+        assert_error WRONGTYPE* {r llen mylist}
+    }
+
+    test {LLEN against non existing key} {
+        assert_equal 0 [r llen not-a-key]
+    }
+
+    test {LINDEX against non-list value error} {
+        assert_error WRONGTYPE* {r lindex mylist 0}
+    }
+
+    test {LINDEX against non existing key} {
+        assert_equal "" [r lindex not-a-key 10]
+    }
+
+    test {LPUSH against non-list value error} {
+        assert_error WRONGTYPE* {r lpush mylist 0}
+    }
+
+    test {RPUSH against non-list value error} {
+        assert_error WRONGTYPE* {r rpush mylist 0}
+    }
+
+    foreach {type large} [array get largevalue] {
+        test "RPOPLPUSH base case - $type" {
+            r del mylist1 mylist2
+            create_list mylist1 "a $large c d"
+            assert_equal d [r rpoplpush mylist1 mylist2]
+            assert_equal c [r rpoplpush mylist1 mylist2]
+            assert_equal "a $large" [r lrange mylist1 0 -1]
+            assert_equal "c d" [r lrange mylist2 0 -1]
+            assert_encoding quicklist mylist2
+        }
+
+        foreach wherefrom {left right} {
+            foreach whereto {left right} {
+                test "LMOVE $wherefrom $whereto base case - $type" {
+                    r del mylist1 mylist2
+
+                    if {$wherefrom eq "right"} {
+                        create_list mylist1 "c d $large a"
+                    } else {
+                        create_list mylist1 "a $large c d"
+                    }
+                    assert_equal a [r lmove mylist1 mylist2 $wherefrom $whereto]
+                    assert_equal $large [r lmove mylist1 mylist2 $wherefrom $whereto]
+                    assert_equal "c d" [r lrange mylist1 0 -1]
+                    if {$whereto eq "right"} {
+                        assert_equal "a $large" [r lrange mylist2 0 -1]
+                    } else {
+                        assert_equal "$large a" [r lrange mylist2 0 -1]
+                    }
+                    assert_encoding quicklist mylist2
+                }
+            }
+        }
+
+        test "RPOPLPUSH with the same list as src and dst - $type" {
+            create_list mylist "a $large c"
+            assert_equal "a $large c" [r lrange mylist 0 -1]
+            assert_equal c [r rpoplpush mylist mylist]
+            assert_equal "c a $large" [r lrange mylist 0 -1]
+        }
+
+        foreach wherefrom {left right} {
+            foreach whereto {left right} {
+                test "LMOVE $wherefrom $whereto with the same list as src and dst - $type" {
+                    if {$wherefrom eq "right"} {
+                        create_list mylist "a $large c"
+                        assert_equal "a $large c" [r lrange mylist 0 -1]
+                    } else {
+                        create_list mylist "c a $large"
+                        assert_equal "c a $large" [r lrange mylist 0 -1]
+                    }
+                    assert_equal c [r lmove mylist mylist $wherefrom $whereto]
+                    if {$whereto eq "right"} {
+                        assert_equal "a $large c" [r lrange mylist 0 -1]
+                    } else {
+                        assert_equal "c a $large" [r lrange mylist 0 -1]
+                    }
+                }
+            }
+        }
+
+        foreach {othertype otherlarge} [array get largevalue] {
+            test "RPOPLPUSH with $type source and existing target $othertype" {
+                create_list srclist "a b c $large"
+                create_list dstlist "$otherlarge"
+                assert_equal $large [r rpoplpush srclist dstlist]
+                assert_equal c [r rpoplpush srclist dstlist]
+                assert_equal "a b" [r lrange srclist 0 -1]
+                assert_equal "c $large $otherlarge" [r lrange dstlist 0 -1]
+
+                # When we rpoplpush'ed a large value, dstlist should be
+                # converted to the same encoding as srclist.
+                if {$type eq "linkedlist"} {
+                    assert_encoding quicklist dstlist
+                }
+            }
+
+            foreach wherefrom {left right} {
+                foreach whereto {left right} {
+                    test "LMOVE $wherefrom $whereto with $type source and existing target $othertype" {
+                        create_list dstlist "$otherlarge"
+
+                        if {$wherefrom eq "right"} {
+                            create_list srclist "a b c $large"
+                        } else {
+                            create_list srclist "$large c a b"
+                        }
+                        assert_equal $large [r lmove srclist dstlist $wherefrom $whereto]
+                        assert_equal c [r lmove srclist dstlist $wherefrom $whereto]
+                        assert_equal "a b" [r lrange srclist 0 -1]
+
+                        if {$whereto eq "right"} {
+                            assert_equal "$otherlarge $large c" [r lrange dstlist 0 -1]
+                        } else {
+                            assert_equal "c $large $otherlarge" [r lrange dstlist 0 -1]
+                        }
+
+                        # When we lmoved a large value, dstlist should be
+                        # converted to the same encoding as srclist.
+                        if {$type eq "linkedlist"} {
+                            assert_encoding quicklist dstlist
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+    test {RPOPLPUSH against non existing key} {
+        r del srclist dstlist
+        assert_equal {} [r rpoplpush srclist dstlist]
+        assert_equal 0 [r exists srclist]
+        assert_equal 0 [r exists dstlist]
+    }
+
+    test {RPOPLPUSH against non list src key} {
+        r del srclist dstlist
+        r set srclist x
+        assert_error WRONGTYPE* {r rpoplpush srclist dstlist}
+        assert_type string srclist
+        assert_equal 0 [r exists newlist]
+    }
+
+    test {RPOPLPUSH against non list dst key} {
+        create_list srclist {a b c d}
+        r set dstlist x
+        assert_error WRONGTYPE* {r rpoplpush srclist dstlist}
+        assert_type string dstlist
+        assert_equal {a b c d} [r lrange srclist 0 -1]
+    }
+
+    test {RPOPLPUSH against non existing src key} {
+        r del srclist dstlist
+        assert_equal {} [r rpoplpush srclist dstlist]
+    } {}
+
+    foreach {type large} [array get largevalue] {
+        test "Basic LPOP/RPOP - $type" {
+            create_list mylist "$large 1 2"
+            assert_equal $large [r lpop mylist]
+            assert_equal 2 [r rpop mylist]
+            assert_equal 1 [r lpop mylist]
+            assert_equal 0 [r llen mylist]
+
+            # pop on empty list
+            assert_equal {} [r lpop mylist]
+            assert_equal {} [r rpop mylist]
+        }
+    }
+
+    test {LPOP/RPOP against non list value} {
+        r set notalist foo
+        assert_error WRONGTYPE* {r lpop notalist}
+        assert_error WRONGTYPE* {r rpop notalist}
+    }
+
+    foreach {type num} {quicklist 250 quicklist 500} {
+        test "Mass RPOP/LPOP - $type" {
+            r del mylist
+            set sum1 0
+            for {set i 0} {$i < $num} {incr i} {
+                r lpush mylist $i
+                incr sum1 $i
+            }
+            assert_encoding $type mylist
+            set sum2 0
+            for {set i 0} {$i < [expr $num/2]} {incr i} {
+                incr sum2 [r lpop mylist]
+                incr sum2 [r rpop mylist]
+            }
+            assert_equal $sum1 $sum2
+        }
+    }
+
+    foreach {type large} [array get largevalue] {
+        test "LRANGE basics - $type" {
+            create_list mylist "$large 1 2 3 4 5 6 7 8 9"
+            assert_equal {1 2 3 4 5 6 7 8} [r lrange mylist 1 -2]
+            assert_equal {7 8 9} [r lrange mylist -3 -1]
+            assert_equal {4} [r lrange mylist 4 4]
+        }
+
+        test "LRANGE inverted indexes - $type" {
+            create_list mylist "$large 1 2 3 4 5 6 7 8 9"
+            assert_equal {} [r lrange mylist 6 2]
+        }
+
+        test "LRANGE out of range indexes including the full list - $type" {
+            create_list mylist "$large 1 2 3"
+            assert_equal "$large 1 2 3" [r lrange mylist -1000 1000]
+        }
+
+        test "LRANGE out of range negative end index - $type" {
+            create_list mylist "$large 1 2 3"
+            assert_equal $large [r lrange mylist 0 -4]
+            assert_equal {} [r lrange mylist 0 -5]
+        }
+    }
+
+    test {LRANGE against non existing key} {
+        assert_equal {} [r lrange nosuchkey 0 1]
+    }
+
+    test {LRANGE with start > end yields an empty array for backward compatibility} {
+        create_list mylist "1 2 3"
+        assert_equal {} [r lrange mylist 1 0]
+        assert_equal {} [r lrange mylist -1 -2]
+    }
+
+    foreach {type large} [array get largevalue] {
+        proc trim_list {type min max} {
+            upvar 1 large large
+            r del mylist
+            create_list mylist "1 2 3 4 $large"
+            r ltrim mylist $min $max
+            r lrange mylist 0 -1
+        }
+
+        test "LTRIM basics - $type" {
+            assert_equal "1" [trim_list $type 0 0]
+            assert_equal "1 2" [trim_list $type 0 1]
+            assert_equal "1 2 3" [trim_list $type 0 2]
+            assert_equal "2 3" [trim_list $type 1 2]
+            assert_equal "2 3 4 $large" [trim_list $type 1 -1]
+            assert_equal "2 3 4" [trim_list $type 1 -2]
+            assert_equal "4 $large" [trim_list $type -2 -1]
+            assert_equal "$large" [trim_list $type -1 -1]
+            assert_equal "1 2 3 4 $large" [trim_list $type -5 -1]
+            assert_equal "1 2 3 4 $large" [trim_list $type -10 10]
+            assert_equal "1 2 3 4 $large" [trim_list $type 0 5]
+            assert_equal "1 2 3 4 $large" [trim_list $type 0 10]
+        }
+
+        test "LTRIM out of range negative end index - $type" {
+            assert_equal {1} [trim_list $type 0 -5]
+            assert_equal {} [trim_list $type 0 -6]
+        }
+
+    }
+
+    foreach {type large} [array get largevalue] {
+        test "LSET - $type" {
+            create_list mylist "99 98 $large 96 95"
+            r lset mylist 1 foo
+            r lset mylist -1 bar
+            assert_equal "99 foo $large 96 bar" [r lrange mylist 0 -1]
+        }
+
+        test "LSET out of range index - $type" {
+            assert_error ERR*range* {r lset mylist 10 foo}
+        }
+    }
+
+    test {LSET against non existing key} {
+        assert_error ERR*key* {r lset nosuchkey 10 foo}
+    }
+
+    test {LSET against non list value} {
+        r set nolist foobar
+        assert_error WRONGTYPE* {r lset nolist 0 foo}
+    }
+
+    foreach {type e} [array get largevalue] {
+        test "LREM remove all the occurrences - $type" {
+            create_list mylist "$e foo bar foobar foobared zap bar test foo"
+            assert_equal 2 [r lrem mylist 0 bar]
+            assert_equal "$e foo foobar foobared zap test foo" [r lrange mylist 0 -1]
+        }
+
+        test "LREM remove the first occurrence - $type" {
+            assert_equal 1 [r lrem mylist 1 foo]
+            assert_equal "$e foobar foobared zap test foo" [r lrange mylist 0 -1]
+        }
+
+        test "LREM remove non existing element - $type" {
+            assert_equal 0 [r lrem mylist 1 nosuchelement]
+            assert_equal "$e foobar foobared zap test foo" [r lrange mylist 0 -1]
+        }
+
+        test "LREM starting from tail with negative count - $type" {
+            create_list mylist "$e foo bar foobar foobared zap bar test foo foo"
+            assert_equal 1 [r lrem mylist -1 bar]
+            assert_equal "$e foo bar foobar foobared zap test foo foo" [r lrange mylist 0 -1]
+        }
+
+        test "LREM starting from tail with negative count (2) - $type" {
+            assert_equal 2 [r lrem mylist -2 foo]
+            assert_equal "$e foo bar foobar foobared zap test" [r lrange mylist 0 -1]
+        }
+
+        test "LREM deleting objects that may be int encoded - $type" {
+            create_list myotherlist "$e 1 2 3"
+            assert_equal 1 [r lrem myotherlist 1 2]
+            assert_equal 3 [r llen myotherlist]
+        }
+    }
+
+    test "Regression for bug 593 - chaining BRPOPLPUSH with other blocking cmds" {
+        set rd1 [redis_deferring_client]
+        set rd2 [redis_deferring_client]
+
+        $rd1 brpoplpush a b 0
+        $rd1 brpoplpush a b 0
+        $rd2 brpoplpush b c 0
+        after 1000
+        r lpush a data
+        $rd1 close
+        $rd2 close
+        r ping
+    } {PONG}
+
+    test "client unblock tests" {
+        r del l
+        set rd [redis_deferring_client]
+        $rd client id
+        set id [$rd read]
+
+        # test default args
+        $rd blpop l 0
+        wait_for_blocked_client
+        r client unblock $id
+        assert_equal {} [$rd read]
+
+        # test with timeout
+        $rd blpop l 0
+        wait_for_blocked_client
+        r client unblock $id TIMEOUT
+        assert_equal {} [$rd read]
+
+        # test with error
+        $rd blpop l 0
+        wait_for_blocked_client
+        r client unblock $id ERROR
+        catch {[$rd read]} e
+        assert_equal $e "UNBLOCKED client unblocked via CLIENT UNBLOCK"
+
+        # test with invalid client id
+        catch {[r client unblock asd]} e
+        assert_equal $e "ERR value is not an integer or out of range"
+
+        # test with non blocked client
+        set myid [r client id]
+        catch {[r client unblock $myid]} e
+        assert_equal $e {invalid command name "0"}
+
+        # finally, see the this client and list are still functional
+        $rd blpop l 0
+        wait_for_blocked_client
+        r lpush l foo
+        assert_equal {l foo} [$rd read]
+    } {}
+
+    test {List ziplist of various encodings} {
+        r del k
+        r lpush k 127 ;# ZIP_INT_8B
+        r lpush k 32767 ;# ZIP_INT_16B
+        r lpush k 2147483647 ;# ZIP_INT_32B
+        r lpush k 9223372036854775808 ;# ZIP_INT_64B
+        r lpush k 0 ;# ZIP_INT_IMM_MIN
+        r lpush k 12 ;# ZIP_INT_IMM_MAX
+        r lpush k [string repeat x 31] ;# ZIP_STR_06B
+        r lpush k [string repeat x 8191] ;# ZIP_STR_14B
+        r lpush k [string repeat x 65535] ;# ZIP_STR_32B
+        set k [r lrange k 0 -1]
+        set dump [r dump k]
+
+        r config set sanitize-dump-payload no
+        r restore kk 0 $dump
+        set kk [r lrange kk 0 -1]
+
+        # try some forward and backward searches to make sure all encodings
+        # can be traversed
+        assert_equal [r lindex kk 5] {9223372036854775808}
+        assert_equal [r lindex kk -5] {0}
+        assert_equal [r lpos kk foo rank 1] {}
+        assert_equal [r lpos kk foo rank -1] {}
+
+        # make sure the values are right
+        assert_equal $k $kk
+        assert_equal [lpop k] [string repeat x 65535]
+        assert_equal [lpop k] [string repeat x 8191]
+        assert_equal [lpop k] [string repeat x 31]
+        set _ $k
+    } {12 0 9223372036854775808 2147483647 32767 127}
+
+    test {List ziplist of various encodings - sanitize dump} {
+        r config set sanitize-dump-payload yes
+        r restore kk 0 $dump replace
+        set k [r lrange k 0 -1]
+        set kk [r lrange kk 0 -1]
+
+        # make sure the values are right
+        assert_equal $k $kk
+        assert_equal [lpop k] [string repeat x 65535]
+        assert_equal [lpop k] [string repeat x 8191]
+        assert_equal [lpop k] [string repeat x 31]
+        set _ $k
+    } {12 0 9223372036854775808 2147483647 32767 127}
+
+}
diff --git a/redis-stable/tests/unit/type/set.tcl b/redis-stable/tests/unit/type/set.tcl
new file mode 100644
index 00000000..ee7b936b
--- /dev/null
+++ b/redis-stable/tests/unit/type/set.tcl
@@ -0,0 +1,886 @@
+start_server {
+    tags {"set"}
+    overrides {
+        "set-max-intset-entries" 512
+    }
+} {
+    proc create_set {key entries} {
+        r del $key
+        foreach entry $entries { r sadd $key $entry }
+    }
+
+    test {SADD, SCARD, SISMEMBER, SMISMEMBER, SMEMBERS basics - regular set} {
+        create_set myset {foo}
+        assert_encoding hashtable myset
+        assert_equal 1 [r sadd myset bar]
+        assert_equal 0 [r sadd myset bar]
+        assert_equal 2 [r scard myset]
+        assert_equal 1 [r sismember myset foo]
+        assert_equal 1 [r sismember myset bar]
+        assert_equal 0 [r sismember myset bla]
+        assert_equal {1} [r smismember myset foo]
+        assert_equal {1 1} [r smismember myset foo bar]
+        assert_equal {1 0} [r smismember myset foo bla]
+        assert_equal {0 1} [r smismember myset bla foo]
+        assert_equal {0} [r smismember myset bla]
+        assert_equal {bar foo} [lsort [r smembers myset]]
+    }
+
+    test {SADD, SCARD, SISMEMBER, SMISMEMBER, SMEMBERS basics - intset} {
+        create_set myset {17}
+        assert_encoding intset myset
+        assert_equal 1 [r sadd myset 16]
+        assert_equal 0 [r sadd myset 16]
+        assert_equal 2 [r scard myset]
+        assert_equal 1 [r sismember myset 16]
+        assert_equal 1 [r sismember myset 17]
+        assert_equal 0 [r sismember myset 18]
+        assert_equal {1} [r smismember myset 16]
+        assert_equal {1 1} [r smismember myset 16 17]
+        assert_equal {1 0} [r smismember myset 16 18]
+        assert_equal {0 1} [r smismember myset 18 16]
+        assert_equal {0} [r smismember myset 18]
+        assert_equal {16 17} [lsort [r smembers myset]]
+    }
+
+    test {SMISMEMBER against non set} {
+        r lpush mylist foo
+        assert_error WRONGTYPE* {r smismember mylist bar}
+    }
+
+    test {SMISMEMBER non existing key} {
+        assert_equal {0} [r smismember myset1 foo]
+        assert_equal {0 0} [r smismember myset1 foo bar]
+    }
+
+    test {SMISMEMBER requires one or more members} {
+        r del zmscoretest
+        r zadd zmscoretest 10 x
+        r zadd zmscoretest 20 y
+        
+        catch {r smismember zmscoretest} e
+        assert_match {*ERR*wrong*number*arg*} $e
+    }
+
+    test {SADD against non set} {
+        r lpush mylist foo
+        assert_error WRONGTYPE* {r sadd mylist bar}
+    }
+
+    test "SADD a non-integer against an intset" {
+        create_set myset {1 2 3}
+        assert_encoding intset myset
+        assert_equal 1 [r sadd myset a]
+        assert_encoding hashtable myset
+    }
+
+    test "SADD an integer larger than 64 bits" {
+        create_set myset {213244124402402314402033402}
+        assert_encoding hashtable myset
+        assert_equal 1 [r sismember myset 213244124402402314402033402]
+        assert_equal {1} [r smismember myset 213244124402402314402033402]
+    }
+
+    test "SADD overflows the maximum allowed integers in an intset" {
+        r del myset
+        for {set i 0} {$i < 512} {incr i} { r sadd myset $i }
+        assert_encoding intset myset
+        assert_equal 1 [r sadd myset 512]
+        assert_encoding hashtable myset
+    }
+
+    test {Variadic SADD} {
+        r del myset
+        assert_equal 3 [r sadd myset a b c]
+        assert_equal 2 [r sadd myset A a b c B]
+        assert_equal [lsort {A a b c B}] [lsort [r smembers myset]]
+    }
+
+    test "Set encoding after DEBUG RELOAD" {
+        r del myintset myhashset mylargeintset
+        for {set i 0} {$i <  100} {incr i} { r sadd myintset $i }
+        for {set i 0} {$i < 1280} {incr i} { r sadd mylargeintset $i }
+        for {set i 0} {$i <  256} {incr i} { r sadd myhashset [format "i%03d" $i] }
+        assert_encoding intset myintset
+        assert_encoding hashtable mylargeintset
+        assert_encoding hashtable myhashset
+
+        r debug reload
+        assert_encoding intset myintset
+        assert_encoding hashtable mylargeintset
+        assert_encoding hashtable myhashset
+    }
+
+    test {SREM basics - regular set} {
+        create_set myset {foo bar ciao}
+        assert_encoding hashtable myset
+        assert_equal 0 [r srem myset qux]
+        assert_equal 1 [r srem myset foo]
+        assert_equal {bar ciao} [lsort [r smembers myset]]
+    }
+
+    test {SREM basics - intset} {
+        create_set myset {3 4 5}
+        assert_encoding intset myset
+        assert_equal 0 [r srem myset 6]
+        assert_equal 1 [r srem myset 4]
+        assert_equal {3 5} [lsort [r smembers myset]]
+    }
+
+    test {SREM with multiple arguments} {
+        r del myset
+        r sadd myset a b c d
+        assert_equal 0 [r srem myset k k k]
+        assert_equal 2 [r srem myset b d x y]
+        lsort [r smembers myset]
+    } {a c}
+
+    test {SREM variadic version with more args needed to destroy the key} {
+        r del myset
+        r sadd myset 1 2 3
+        r srem myset 1 2 3 4 5 6 7 8
+    } {3}
+
+    foreach {type} {hashtable intset} {
+        for {set i 1} {$i <= 5} {incr i} {
+            r del [format "set%d" $i]
+        }
+        for {set i 0} {$i < 200} {incr i} {
+            r sadd set1 $i
+            r sadd set2 [expr $i+195]
+        }
+        foreach i {199 195 1000 2000} {
+            r sadd set3 $i
+        }
+        for {set i 5} {$i < 200} {incr i} {
+            r sadd set4 $i
+        }
+        r sadd set5 0
+
+        # To make sure the sets are encoded as the type we are testing -- also
+        # when the VM is enabled and the values may be swapped in and out
+        # while the tests are running -- an extra element is added to every
+        # set that determines its encoding.
+        set large 200
+        if {$type eq "hashtable"} {
+            set large foo
+        }
+
+        for {set i 1} {$i <= 5} {incr i} {
+            r sadd [format "set%d" $i] $large
+        }
+
+        test "Generated sets must be encoded as $type" {
+            for {set i 1} {$i <= 5} {incr i} {
+                assert_encoding $type [format "set%d" $i]
+            }
+        }
+
+        test "SINTER with two sets - $type" {
+            assert_equal [list 195 196 197 198 199 $large] [lsort [r sinter set1 set2]]
+        }
+
+        test "SINTERSTORE with two sets - $type" {
+            r sinterstore setres set1 set2
+            assert_encoding $type setres
+            assert_equal [list 195 196 197 198 199 $large] [lsort [r smembers setres]]
+        }
+
+        test "SINTERSTORE with two sets, after a DEBUG RELOAD - $type" {
+            r debug reload
+            r sinterstore setres set1 set2
+            assert_encoding $type setres
+            assert_equal [list 195 196 197 198 199 $large] [lsort [r smembers setres]]
+        }
+
+        test "SUNION with two sets - $type" {
+            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
+            assert_equal $expected [lsort [r sunion set1 set2]]
+        }
+
+        test "SUNIONSTORE with two sets - $type" {
+            r sunionstore setres set1 set2
+            assert_encoding $type setres
+            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
+            assert_equal $expected [lsort [r smembers setres]]
+        }
+
+        test "SINTER against three sets - $type" {
+            assert_equal [list 195 199 $large] [lsort [r sinter set1 set2 set3]]
+        }
+
+        test "SINTERSTORE with three sets - $type" {
+            r sinterstore setres set1 set2 set3
+            assert_equal [list 195 199 $large] [lsort [r smembers setres]]
+        }
+
+        test "SUNION with non existing keys - $type" {
+            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
+            assert_equal $expected [lsort [r sunion nokey1 set1 set2 nokey2]]
+        }
+
+        test "SDIFF with two sets - $type" {
+            assert_equal {0 1 2 3 4} [lsort [r sdiff set1 set4]]
+        }
+
+        test "SDIFF with three sets - $type" {
+            assert_equal {1 2 3 4} [lsort [r sdiff set1 set4 set5]]
+        }
+
+        test "SDIFFSTORE with three sets - $type" {
+            r sdiffstore setres set1 set4 set5
+            # When we start with intsets, we should always end with intsets.
+            if {$type eq {intset}} {
+                assert_encoding intset setres
+            }
+            assert_equal {1 2 3 4} [lsort [r smembers setres]]
+        }
+    }
+
+    test "SDIFF with first set empty" {
+        r del set1 set2 set3
+        r sadd set2 1 2 3 4
+        r sadd set3 a b c d
+        r sdiff set1 set2 set3
+    } {}
+
+    test "SDIFF with same set two times" {
+        r del set1
+        r sadd set1 a b c 1 2 3 4 5 6
+        r sdiff set1 set1
+    } {}
+
+    test "SDIFF fuzzing" {
+        for {set j 0} {$j < 100} {incr j} {
+            unset -nocomplain s
+            array set s {}
+            set args {}
+            set num_sets [expr {[randomInt 10]+1}]
+            for {set i 0} {$i < $num_sets} {incr i} {
+                set num_elements [randomInt 100]
+                r del set_$i
+                lappend args set_$i
+                while {$num_elements} {
+                    set ele [randomValue]
+                    r sadd set_$i $ele
+                    if {$i == 0} {
+                        set s($ele) x
+                    } else {
+                        unset -nocomplain s($ele)
+                    }
+                    incr num_elements -1
+                }
+            }
+            set result [lsort [r sdiff {*}$args]]
+            assert_equal $result [lsort [array names s]]
+        }
+    }
+
+    test "SDIFF against non-set should throw error" {
+        # with an empty set
+        r set key1{t} x
+        assert_error "WRONGTYPE*" {r sdiff key1{t} noset{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sdiff noset{t} key1{t}}
+
+        # with a legal set
+        r del set1{t}
+        r sadd set1{t} a b c
+        assert_error "WRONGTYPE*" {r sdiff key1{t} set1{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sdiff set1{t} key1{t}}
+    }
+
+    test "SDIFF should handle non existing key as empty" {
+        r del set1{t} set2{t} set3{t}
+
+        r sadd set1{t} a b c
+        r sadd set2{t} b c d
+        assert_equal {a} [lsort [r sdiff set1{t} set2{t} set3{t}]]
+        assert_equal {} [lsort [r sdiff set3{t} set2{t} set1{t}]]
+    }
+
+    test "SDIFFSTORE against non-set should throw error" {
+        r del set1{t} set2{t} set3{t} key1{t}
+        r set key1{t} x
+
+        # with en empty dstkey
+        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} key1{t} noset{t}}
+        assert_equal 0 [r exists set3{t}]
+        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} noset{t} key1{t}}
+        assert_equal 0 [r exists set3{t}]
+
+        # with a legal dstkey
+        r sadd set1{t} a b c
+        r sadd set2{t} b c d
+        r sadd set3{t} e
+        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} key1{t} set1{t} noset{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+
+        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} set1{t} key1{t} set2{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+    }
+
+    test "SDIFFSTORE should handle non existing key as empty" {
+        r del set1{t} set2{t} set3{t}
+
+        r set setres{t} xxx
+        assert_equal 0 [r sdiffstore setres{t} foo111{t} bar222{t}]
+        assert_equal 0 [r exists setres{t}]
+
+        # with a legal dstkey, should delete dstkey
+        r sadd set3{t} a b c
+        assert_equal 0 [r sdiffstore set3{t} set1{t} set2{t}]
+        assert_equal 0 [r exists set3{t}]
+
+        r sadd set1{t} a b c
+        assert_equal 3 [r sdiffstore set3{t} set1{t} set2{t}]
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {a b c} [lsort [r smembers set3{t}]]
+
+        # with a legal dstkey and empty set2, should delete the dstkey
+        r sadd set3{t} a b c
+        assert_equal 0 [r sdiffstore set3{t} set2{t} set1{t}]
+        assert_equal 0 [r exists set3{t}]
+    }
+
+    test "SINTER against non-set should throw error" {
+        r set key1{t} x
+        assert_error "WRONGTYPE*" {r sinter key1{t} noset{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sinter noset{t} key1{t}}
+
+        r sadd set1{t} a b c
+        assert_error "WRONGTYPE*" {r sinter key1{t} set1{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sinter set1{t} key1{t}}
+    }
+
+    test "SINTER should handle non existing key as empty" {
+        r del set1 set2 set3
+        r sadd set1 a b c
+        r sadd set2 b c d
+        r sinter set1 set2 set3
+    } {}
+
+    test "SINTER with same integer elements but different encoding" {
+        r del set1 set2
+        r sadd set1 1 2 3
+        r sadd set2 1 2 3 a
+        r srem set2 a
+        assert_encoding intset set1
+        assert_encoding hashtable set2
+        lsort [r sinter set1 set2]
+    } {1 2 3}
+
+    test "SINTERSTORE against non-set should throw error" {
+        r del set1{t} set2{t} set3{t} key1{t}
+        r set key1{t} x
+
+        # with en empty dstkey
+        assert_error "WRONGTYPE*" {r sinterstore set3{t} key1{t} noset{t}}
+        assert_equal 0 [r exists set3{t}]
+        assert_error "WRONGTYPE*" {r sinterstore set3{t} noset{t} key1{t}}
+        assert_equal 0 [r exists set3{t}]
+
+        # with a legal dstkey
+        r sadd set1{t} a b c
+        r sadd set2{t} b c d
+        r sadd set3{t} e
+        assert_error "WRONGTYPE*" {r sinterstore set3{t} key1{t} set2{t} noset{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+
+        assert_error "WRONGTYPE*" {r sinterstore set3{t} noset{t} key1{t} set2{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+    }
+
+    test "SINTERSTORE against non existing keys should delete dstkey" {
+        r del set1{t} set2{t} set3{t}
+
+        r set setres{t} xxx
+        assert_equal 0 [r sinterstore setres{t} foo111{t} bar222{t}]
+        assert_equal 0 [r exists setres{t}]
+
+        # with a legal dstkey
+        r sadd set3{t} a b c
+        assert_equal 0 [r sinterstore set3{t} set1{t} set2{t}]
+        assert_equal 0 [r exists set3{t}]
+
+        r sadd set1{t} a b c
+        assert_equal 0 [r sinterstore set3{t} set1{t} set2{t}]
+        assert_equal 0 [r exists set3{t}]
+
+        assert_equal 0 [r sinterstore set3{t} set2{t} set1{t}]
+        assert_equal 0 [r exists set3{t}]
+    }
+
+    test "SUNION against non-set should throw error" {
+        r set key1{t} x
+        assert_error "WRONGTYPE*" {r sunion key1{t} noset{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sunion noset{t} key1{t}}
+
+        r del set1{t}
+        r sadd set1{t} a b c
+        assert_error "WRONGTYPE*" {r sunion key1{t} set1{t}}
+        # different order
+        assert_error "WRONGTYPE*" {r sunion set1{t} key1{t}}
+    }
+
+    test "SUNION should handle non existing key as empty" {
+        r del set1{t} set2{t} set3{t}
+
+        r sadd set1{t} a b c
+        r sadd set2{t} b c d
+        assert_equal {a b c d} [lsort [r sunion set1{t} set2{t} set3{t}]]
+    }
+
+    test "SUNIONSTORE against non-set should throw error" {
+        r del set1{t} set2{t} set3{t} key1{t}
+        r set key1{t} x
+
+        # with en empty dstkey
+        assert_error "WRONGTYPE*" {r sunionstore set3{t} key1{t} noset{t}}
+        assert_equal 0 [r exists set3{t}]
+        assert_error "WRONGTYPE*" {r sunionstore set3{t} noset{t} key1{t}}
+        assert_equal 0 [r exists set3{t}]
+
+        # with a legal dstkey
+        r sadd set1{t} a b c
+        r sadd set2{t} b c d
+        r sadd set3{t} e
+        assert_error "WRONGTYPE*" {r sunionstore set3{t} key1{t} key2{t} noset{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+
+        assert_error "WRONGTYPE*" {r sunionstore set3{t} noset{t} key1{t} key2{t}}
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {e} [lsort [r smembers set3{t}]]
+    }
+
+    test "SUNIONSTORE should handle non existing key as empty" {
+        r del set1{t} set2{t} set3{t}
+
+        r set setres{t} xxx
+        assert_equal 0 [r sunionstore setres{t} foo111{t} bar222{t}]
+        assert_equal 0 [r exists setres{t}]
+
+        # set1 set2 both empty, should delete the dstkey
+        r sadd set3{t} a b c
+        assert_equal 0 [r sunionstore set3{t} set1{t} set2{t}]
+        assert_equal 0 [r exists set3{t}]
+
+        r sadd set1{t} a b c
+        r sadd set3{t} e f
+        assert_equal 3 [r sunionstore set3{t} set1{t} set2{t}]
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {a b c} [lsort [r smembers set3{t}]]
+
+        r sadd set3{t} d
+        assert_equal 3 [r sunionstore set3{t} set2{t} set1{t}]
+        assert_equal 1 [r exists set3{t}]
+        assert_equal {a b c} [lsort [r smembers set3{t}]]
+    }
+
+    test "SUNIONSTORE against non existing keys should delete dstkey" {
+        r set setres xxx
+        assert_equal 0 [r sunionstore setres foo111 bar222]
+        assert_equal 0 [r exists setres]
+    }
+
+    foreach {type contents} {hashtable {a b c} intset {1 2 3}} {
+        test "SPOP basics - $type" {
+            create_set myset $contents
+            assert_encoding $type myset
+            assert_equal $contents [lsort [list [r spop myset] [r spop myset] [r spop myset]]]
+            assert_equal 0 [r scard myset]
+        }
+
+        test "SPOP with <count>=1 - $type" {
+            create_set myset $contents
+            assert_encoding $type myset
+            assert_equal $contents [lsort [list [r spop myset 1] [r spop myset 1] [r spop myset 1]]]
+            assert_equal 0 [r scard myset]
+        }
+
+        test "SRANDMEMBER - $type" {
+            create_set myset $contents
+            unset -nocomplain myset
+            array set myset {}
+            for {set i 0} {$i < 100} {incr i} {
+                set myset([r srandmember myset]) 1
+            }
+            assert_equal $contents [lsort [array names myset]]
+        }
+    }
+
+    foreach {type contents} {
+        hashtable {a b c d e f g h i j k l m n o p q r s t u v w x y z} 
+        intset {1 10 11 12 13 14 15 16 17 18 19 2 20 21 22 23 24 25 26 3 4 5 6 7 8 9}
+    } {
+        test "SPOP with <count>" {
+            create_set myset $contents
+            assert_encoding $type myset
+            assert_equal $contents [lsort [concat [r spop myset 11] [r spop myset 9] [r spop myset 0] [r spop myset 4] [r spop myset 1] [r spop myset 0] [r spop myset 1] [r spop myset 0]]]
+            assert_equal 0 [r scard myset]
+        }
+    }
+
+    # As seen in intsetRandomMembers
+    test "SPOP using integers, testing Knuth's and Floyd's algorithm" {
+        create_set myset {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
+        assert_encoding intset myset
+        assert_equal 20 [r scard myset]
+        r spop myset 1
+        assert_equal 19 [r scard myset]
+        r spop myset 2
+        assert_equal 17 [r scard myset]
+        r spop myset 3
+        assert_equal 14 [r scard myset]
+        r spop myset 10
+        assert_equal 4 [r scard myset]
+        r spop myset 10
+        assert_equal 0 [r scard myset]
+        r spop myset 1
+        assert_equal 0 [r scard myset]
+    } {}
+
+    test "SPOP using integers with Knuth's algorithm" {
+        r spop nonexisting_key 100
+    } {}
+
+    test "SPOP new implementation: code path #1" {
+        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
+        create_set myset $content
+        set res [r spop myset 30]
+        assert {[lsort $content] eq [lsort $res]}
+    }
+
+    test "SPOP new implementation: code path #2" {
+        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
+        create_set myset $content
+        set res [r spop myset 2]
+        assert {[llength $res] == 2}
+        assert {[r scard myset] == 18}
+        set union [concat [r smembers myset] $res]
+        assert {[lsort $union] eq [lsort $content]}
+    }
+
+    test "SPOP new implementation: code path #3" {
+        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
+        create_set myset $content
+        set res [r spop myset 18]
+        assert {[llength $res] == 18}
+        assert {[r scard myset] == 2}
+        set union [concat [r smembers myset] $res]
+        assert {[lsort $union] eq [lsort $content]}
+    }
+
+    test "SRANDMEMBER count of 0 is handled correctly" {
+        r srandmember myset 0
+    } {}
+
+    test "SRANDMEMBER with <count> against non existing key" {
+        r srandmember nonexisting_key 100
+    } {}
+
+    # Make sure we can distinguish between an empty array and a null response
+    r readraw 1
+
+    test "SRANDMEMBER count of 0 is handled correctly - emptyarray" {
+        r srandmember myset 0
+    } {*0}
+
+    test "SRANDMEMBER with <count> against non existing key - emptyarray" {
+        r srandmember nonexisting_key 100
+    } {*0}
+
+    r readraw 0
+
+    foreach {type contents} {
+        hashtable {
+            1 5 10 50 125 50000 33959417 4775547 65434162
+            12098459 427716 483706 2726473884 72615637475
+            MARY PATRICIA LINDA BARBARA ELIZABETH JENNIFER MARIA
+            SUSAN MARGARET DOROTHY LISA NANCY KAREN BETTY HELEN
+            SANDRA DONNA CAROL RUTH SHARON MICHELLE LAURA SARAH
+            KIMBERLY DEBORAH JESSICA SHIRLEY CYNTHIA ANGELA MELISSA
+            BRENDA AMY ANNA REBECCA VIRGINIA KATHLEEN
+        }
+        intset {
+            0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
+            20 21 22 23 24 25 26 27 28 29
+            30 31 32 33 34 35 36 37 38 39
+            40 41 42 43 44 45 46 47 48 49
+        }
+    } {
+        test "SRANDMEMBER with <count> - $type" {
+            create_set myset $contents
+            unset -nocomplain myset
+            array set myset {}
+            foreach ele [r smembers myset] {
+                set myset($ele) 1
+            }
+            assert_equal [lsort $contents] [lsort [array names myset]]
+
+            # Make sure that a count of 0 is handled correctly.
+            assert_equal [r srandmember myset 0] {}
+
+            # We'll stress different parts of the code, see the implementation
+            # of SRANDMEMBER for more information, but basically there are
+            # four different code paths.
+            #
+            # PATH 1: Use negative count.
+            #
+            # 1) Check that it returns repeated elements.
+            set res [r srandmember myset -100]
+            assert_equal [llength $res] 100
+
+            # 2) Check that all the elements actually belong to the
+            # original set.
+            foreach ele $res {
+                assert {[info exists myset($ele)]}
+            }
+
+            # 3) Check that eventually all the elements are returned.
+            unset -nocomplain auxset
+            set iterations 1000
+            while {$iterations != 0} {
+                incr iterations -1
+                set res [r srandmember myset -10]
+                foreach ele $res {
+                    set auxset($ele) 1
+                }
+                if {[lsort [array names myset]] eq
+                    [lsort [array names auxset]]} {
+                    break;
+                }
+            }
+            assert {$iterations != 0}
+
+            # PATH 2: positive count (unique behavior) with requested size
+            # equal or greater than set size.
+            foreach size {50 100} {
+                set res [r srandmember myset $size]
+                assert_equal [llength $res] 50
+                assert_equal [lsort $res] [lsort [array names myset]]
+            }
+
+            # PATH 3: Ask almost as elements as there are in the set.
+            # In this case the implementation will duplicate the original
+            # set and will remove random elements up to the requested size.
+            #
+            # PATH 4: Ask a number of elements definitely smaller than
+            # the set size.
+            #
+            # We can test both the code paths just changing the size but
+            # using the same code.
+
+            foreach size {45 5} {
+                set res [r srandmember myset $size]
+                assert_equal [llength $res] $size
+
+                # 1) Check that all the elements actually belong to the
+                # original set.
+                foreach ele $res {
+                    assert {[info exists myset($ele)]}
+                }
+
+                # 2) Check that eventually all the elements are returned.
+                unset -nocomplain auxset
+                set iterations 1000
+                while {$iterations != 0} {
+                    incr iterations -1
+                    set res [r srandmember myset $size]
+                    foreach ele $res {
+                        set auxset($ele) 1
+                    }
+                    if {[lsort [array names myset]] eq
+                        [lsort [array names auxset]]} {
+                        break;
+                    }
+                }
+                assert {$iterations != 0}
+            }
+        }
+    }
+
+    foreach {type contents} {
+        hashtable {
+            1 5 10 50 125
+            MARY PATRICIA LINDA BARBARA ELIZABETH
+        }
+        intset {
+            0 1 2 3 4 5 6 7 8 9
+        }
+    } {
+        test "SRANDMEMBER histogram distribution - $type" {
+            create_set myset $contents
+            unset -nocomplain myset
+            array set myset {}
+            foreach ele [r smembers myset] {
+                set myset($ele) 1
+            }
+
+            # Use negative count (PATH 1).
+            # df = 9, 40 means 0.00001 probability
+            set res [r srandmember myset -1000]
+            assert_lessthan [chi_square_value $res] 40
+
+            # Use positive count (both PATH 3 and PATH 4).
+            foreach size {8 2} {
+                unset -nocomplain allkey
+                set iterations [expr {1000 / $size}]
+                while {$iterations != 0} {
+                    incr iterations -1
+                    set res [r srandmember myset $size]
+                    foreach ele $res {
+                        lappend allkey $ele
+                    }
+                }
+                # df = 9, 40 means 0.00001 probability
+                assert_lessthan [chi_square_value $allkey] 40
+            }
+        }
+    }
+
+    proc setup_move {} {
+        r del myset3 myset4
+        create_set myset1 {1 a b}
+        create_set myset2 {2 3 4}
+        assert_encoding hashtable myset1
+        assert_encoding intset myset2
+    }
+
+    test "SMOVE basics - from regular set to intset" {
+        # move a non-integer element to an intset should convert encoding
+        setup_move
+        assert_equal 1 [r smove myset1 myset2 a]
+        assert_equal {1 b} [lsort [r smembers myset1]]
+        assert_equal {2 3 4 a} [lsort [r smembers myset2]]
+        assert_encoding hashtable myset2
+
+        # move an integer element should not convert the encoding
+        setup_move
+        assert_equal 1 [r smove myset1 myset2 1]
+        assert_equal {a b} [lsort [r smembers myset1]]
+        assert_equal {1 2 3 4} [lsort [r smembers myset2]]
+        assert_encoding intset myset2
+    }
+
+    test "SMOVE basics - from intset to regular set" {
+        setup_move
+        assert_equal 1 [r smove myset2 myset1 2]
+        assert_equal {1 2 a b} [lsort [r smembers myset1]]
+        assert_equal {3 4} [lsort [r smembers myset2]]
+    }
+
+    test "SMOVE non existing key" {
+        setup_move
+        assert_equal 0 [r smove myset1 myset2 foo]
+        assert_equal 0 [r smove myset1 myset1 foo]
+        assert_equal {1 a b} [lsort [r smembers myset1]]
+        assert_equal {2 3 4} [lsort [r smembers myset2]]
+    }
+
+    test "SMOVE non existing src set" {
+        setup_move
+        assert_equal 0 [r smove noset myset2 foo]
+        assert_equal {2 3 4} [lsort [r smembers myset2]]
+    }
+
+    test "SMOVE from regular set to non existing destination set" {
+        setup_move
+        assert_equal 1 [r smove myset1 myset3 a]
+        assert_equal {1 b} [lsort [r smembers myset1]]
+        assert_equal {a} [lsort [r smembers myset3]]
+        assert_encoding hashtable myset3
+    }
+
+    test "SMOVE from intset to non existing destination set" {
+        setup_move
+        assert_equal 1 [r smove myset2 myset3 2]
+        assert_equal {3 4} [lsort [r smembers myset2]]
+        assert_equal {2} [lsort [r smembers myset3]]
+        assert_encoding intset myset3
+    }
+
+    test "SMOVE wrong src key type" {
+        r set x 10
+        assert_error "WRONGTYPE*" {r smove x myset2 foo}
+    }
+
+    test "SMOVE wrong dst key type" {
+        r set x 10
+        assert_error "WRONGTYPE*" {r smove myset2 x foo}
+    }
+
+    test "SMOVE with identical source and destination" {
+        r del set
+        r sadd set a b c
+        r smove set set b
+        lsort [r smembers set]
+    } {a b c}
+
+    test "SMOVE only notify dstset when the addition is successful" {
+        r del srcset{t}
+        r del dstset{t}
+
+        r sadd srcset{t} a b
+        r sadd dstset{t} a
+
+        r watch dstset{t}
+
+        r multi
+        r sadd dstset{t} c
+
+        set r2 [redis_client]
+        $r2 smove srcset{t} dstset{t} a
+
+        # The dstset is actually unchanged, multi should success
+        r exec
+        set res [r scard dstset{t}]
+        assert_equal $res 2
+        $r2 close
+    }
+
+    tags {slow} {
+        test {intsets implementation stress testing} {
+            for {set j 0} {$j < 20} {incr j} {
+                unset -nocomplain s
+                array set s {}
+                r del s
+                set len [randomInt 1024]
+                for {set i 0} {$i < $len} {incr i} {
+                    randpath {
+                        set data [randomInt 65536]
+                    } {
+                        set data [randomInt 4294967296]
+                    } {
+                        set data [randomInt 18446744073709551616]
+                    }
+                    set s($data) {}
+                    r sadd s $data
+                }
+                assert_equal [lsort [r smembers s]] [lsort [array names s]]
+                set len [array size s]
+                for {set i 0} {$i < $len} {incr i} {
+                    set e [r spop s]
+                    if {![info exists s($e)]} {
+                        puts "Can't find '$e' on local array"
+                        puts "Local array: [lsort [r smembers s]]"
+                        puts "Remote array: [lsort [array names s]]"
+                        error "exception"
+                    }
+                    array unset s $e
+                }
+                assert_equal [r scard s] 0
+                assert_equal [array size s] 0
+            }
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/type/stream-cgroups.tcl b/redis-stable/tests/unit/type/stream-cgroups.tcl
new file mode 100644
index 00000000..edc5af6b
--- /dev/null
+++ b/redis-stable/tests/unit/type/stream-cgroups.tcl
@@ -0,0 +1,662 @@
+start_server {
+    tags {"stream"}
+} {
+    test {XGROUP CREATE: creation and duplicate group name detection} {
+        r DEL mystream
+        r XADD mystream * foo bar
+        r XGROUP CREATE mystream mygroup $
+        catch {r XGROUP CREATE mystream mygroup $} err
+        set err
+    } {BUSYGROUP*}
+
+    test {XGROUP CREATE: automatic stream creation fails without MKSTREAM} {
+        r DEL mystream
+        catch {r XGROUP CREATE mystream mygroup $} err
+        set err
+    } {ERR*}
+
+    test {XGROUP CREATE: automatic stream creation works with MKSTREAM} {
+        r DEL mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+    } {OK}
+
+    test {XREADGROUP will return only new elements} {
+        r XADD mystream * a 1
+        r XADD mystream * b 2
+        # XREADGROUP should return only the new elements "a 1" "b 1"
+        # and not the element "foo bar" which was pre existing in the
+        # stream (see previous test)
+        set reply [
+            r XREADGROUP GROUP mygroup consumer-1 STREAMS mystream ">"
+        ]
+        assert {[llength [lindex $reply 0 1]] == 2}
+        lindex $reply 0 1 0 1
+    } {a 1}
+
+    test {XREADGROUP can read the history of the elements we own} {
+        # Add a few more elements
+        r XADD mystream * c 3
+        r XADD mystream * d 4
+        # Read a few elements using a different consumer name
+        set reply [
+            r XREADGROUP GROUP mygroup consumer-2 STREAMS mystream ">"
+        ]
+        assert {[llength [lindex $reply 0 1]] == 2}
+        assert {[lindex $reply 0 1 0 1] eq {c 3}}
+
+        set r1 [r XREADGROUP GROUP mygroup consumer-1 COUNT 10 STREAMS mystream 0]
+        set r2 [r XREADGROUP GROUP mygroup consumer-2 COUNT 10 STREAMS mystream 0]
+        assert {[lindex $r1 0 1 0 1] eq {a 1}}
+        assert {[lindex $r2 0 1 0 1] eq {c 3}}
+    }
+
+    test {XPENDING is able to return pending items} {
+        set pending [r XPENDING mystream mygroup - + 10]
+        assert {[llength $pending] == 4}
+        for {set j 0} {$j < 4} {incr j} {
+            set item [lindex $pending $j]
+            if {$j < 2} {
+                set owner consumer-1
+            } else {
+                set owner consumer-2
+            }
+            assert {[lindex $item 1] eq $owner}
+            assert {[lindex $item 1] eq $owner}
+        }
+    }
+
+    test {XPENDING can return single consumer items} {
+        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
+        assert {[llength $pending] == 2}
+    }
+
+    test {XPENDING only group} {
+        set pending [r XPENDING mystream mygroup]
+        assert {[llength $pending] == 4}
+    }
+
+    test {XPENDING with IDLE} {
+        after 20
+        set pending [r XPENDING mystream mygroup IDLE 99999999 - + 10 consumer-1]
+        assert {[llength $pending] == 0}
+        set pending [r XPENDING mystream mygroup IDLE 1 - + 10 consumer-1]
+        assert {[llength $pending] == 2}
+        set pending [r XPENDING mystream mygroup IDLE 99999999 - + 10]
+        assert {[llength $pending] == 0}
+        set pending [r XPENDING mystream mygroup IDLE 1 - + 10]
+        assert {[llength $pending] == 4}
+    }
+
+    test {XPENDING with exclusive range intervals works as expected} {
+        set pending [r XPENDING mystream mygroup - + 10]
+        assert {[llength $pending] == 4}
+        set startid [lindex [lindex $pending 0] 0]
+        set endid [lindex [lindex $pending 3] 0]
+        set expending [r XPENDING mystream mygroup ($startid ($endid 10]
+        assert {[llength $expending] == 2}
+        for {set j 0} {$j < 2} {incr j} {
+            set itemid [lindex [lindex $expending $j] 0]
+            assert {$itemid ne $startid}
+            assert {$itemid ne $endid}
+        }
+    }
+
+    test {XACK is able to remove items from the consumer/group PEL} {
+        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
+        set id1 [lindex $pending 0 0]
+        set id2 [lindex $pending 1 0]
+        assert {[r XACK mystream mygroup $id1] eq 1}
+        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
+        assert {[llength $pending] == 1}
+        set id [lindex $pending 0 0]
+        assert {$id eq $id2}
+        set global_pel [r XPENDING mystream mygroup - + 10]
+        assert {[llength $global_pel] == 3}
+    }
+
+    test {XACK can't remove the same item multiple times} {
+        assert {[r XACK mystream mygroup $id1] eq 0}
+    }
+
+    test {XACK is able to accept multiple arguments} {
+        # One of the IDs was already removed, so it should ack
+        # just ID2.
+        assert {[r XACK mystream mygroup $id1 $id2] eq 1}
+    }
+
+    test {XACK should fail if got at least one invalid ID} {
+        r del mystream
+        r xgroup create s g $ MKSTREAM
+        r xadd s * f1 v1
+        set c [llength [lindex [r xreadgroup group g c streams s >] 0 1]]
+        assert {$c == 1}
+        set pending [r xpending s g - + 10 c]
+        set id1 [lindex $pending 0 0]
+        assert_error "*Invalid stream ID specified*" {r xack s g $id1 invalid-id}
+        assert {[r xack s g $id1] eq 1}
+    }
+
+    test {PEL NACK reassignment after XGROUP SETID event} {
+        r del events
+        r xadd events * f1 v1
+        r xadd events * f1 v1
+        r xadd events * f1 v1
+        r xadd events * f1 v1
+        r xgroup create events g1 $
+        r xadd events * f1 v1
+        set c [llength [lindex [r xreadgroup group g1 c1 streams events >] 0 1]]
+        assert {$c == 1}
+        r xgroup setid events g1 -
+        set c [llength [lindex [r xreadgroup group g1 c2 streams events >] 0 1]]
+        assert {$c == 5}
+    }
+
+    test {XREADGROUP will not report data on empty history. Bug #5577} {
+        r del events
+        r xadd events * a 1
+        r xadd events * b 2
+        r xadd events * c 3
+        r xgroup create events mygroup 0
+
+        # Current local PEL should be empty
+        set res [r xpending events mygroup - + 10]
+        assert {[llength $res] == 0}
+
+        # So XREADGROUP should read an empty history as well
+        set res [r xreadgroup group mygroup myconsumer count 3 streams events 0]
+        assert {[llength [lindex $res 0 1]] == 0}
+
+        # We should fetch all the elements in the stream asking for >
+        set res [r xreadgroup group mygroup myconsumer count 3 streams events >]
+        assert {[llength [lindex $res 0 1]] == 3}
+
+        # Now the history is populated with three not acked entries
+        set res [r xreadgroup group mygroup myconsumer count 3 streams events 0]
+        assert {[llength [lindex $res 0 1]] == 3}
+    }
+
+    test {XREADGROUP history reporting of deleted entries. Bug #5570} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        r XADD mystream 1 field1 A
+        r XREADGROUP GROUP mygroup myconsumer STREAMS mystream >
+        r XADD mystream MAXLEN 1 2 field1 B
+        r XREADGROUP GROUP mygroup myconsumer STREAMS mystream >
+
+        # Now we have two pending entries, however one should be deleted
+        # and one should be ok (we should only see "B")
+        set res [r XREADGROUP GROUP mygroup myconsumer STREAMS mystream 0-1]
+        assert {[lindex $res 0 1 0] == {1-0 {}}}
+        assert {[lindex $res 0 1 1] == {2-0 {field1 B}}}
+    }
+
+    test {Blocking XREADGROUP will not reply with an empty array} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        r XADD mystream 666 f v
+        set res [r XREADGROUP GROUP mygroup Alice BLOCK 10 STREAMS mystream ">"]
+        assert {[lindex $res 0 1 0] == {666-0 {f v}}}
+        r XADD mystream 667 f2 v2
+        r XDEL mystream 667
+        set rd [redis_deferring_client]
+        $rd XREADGROUP GROUP mygroup Alice BLOCK 10 STREAMS mystream ">"
+        after 20
+        assert {[$rd read] == {}} ;# before the fix, client didn't even block, but was served synchronously with {mystream {}}
+    }
+
+    test {XGROUP DESTROY should unblock XREADGROUP with -NOGROUP} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        set rd [redis_deferring_client]
+        $rd XREADGROUP GROUP mygroup Alice BLOCK 100 STREAMS mystream ">"
+        r XGROUP DESTROY mystream mygroup
+        assert_error "*NOGROUP*" {$rd read}
+    }
+
+    test {RENAME can unblock XREADGROUP with data} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        set rd [redis_deferring_client]
+        $rd XREADGROUP GROUP mygroup Alice BLOCK 0 STREAMS mystream ">"
+        r XGROUP CREATE mystream2 mygroup $ MKSTREAM
+        r XADD mystream2 100 f1 v1
+        r RENAME mystream2 mystream
+        assert_equal "{mystream {{100-0 {f1 v1}}}}" [$rd read] ;# mystream2 had mygroup before RENAME
+    }
+
+    test {RENAME can unblock XREADGROUP with -NOGROUP} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        set rd [redis_deferring_client]
+        $rd XREADGROUP GROUP mygroup Alice BLOCK 0 STREAMS mystream ">"
+        r XADD mystream2 100 f1 v1
+        r RENAME mystream2 mystream
+        assert_error "*NOGROUP*" {$rd read} ;# mystream2 didn't have mygroup before RENAME
+    }
+
+    test {XCLAIM can claim PEL items from another consumer} {
+        # Add 3 items into the stream, and create a consumer group
+        r del mystream
+        set id1 [r XADD mystream * a 1]
+        set id2 [r XADD mystream * b 2]
+        set id3 [r XADD mystream * c 3]
+        r XGROUP CREATE mystream mygroup 0
+
+        # Consumer 1 reads item 1 from the stream without acknowledgements.
+        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
+        set reply [
+            r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >
+        ]
+        assert {[llength [lindex $reply 0 1 0 1]] == 2}
+        assert {[lindex $reply 0 1 0 1] eq {a 1}}
+
+        # make sure the entry is present in both the gorup, and the right consumer
+        assert {[llength [r XPENDING mystream mygroup - + 10]] == 1}
+        assert {[llength [r XPENDING mystream mygroup - + 10 consumer1]] == 1}
+        assert {[llength [r XPENDING mystream mygroup - + 10 consumer2]] == 0}
+
+        after 200
+        set reply [
+            r XCLAIM mystream mygroup consumer2 10 $id1
+        ]
+        assert {[llength [lindex $reply 0 1]] == 2}
+        assert {[lindex $reply 0 1] eq {a 1}}
+
+        # make sure the entry is present in both the gorup, and the right consumer
+        assert {[llength [r XPENDING mystream mygroup - + 10]] == 1}
+        assert {[llength [r XPENDING mystream mygroup - + 10 consumer1]] == 0}
+        assert {[llength [r XPENDING mystream mygroup - + 10 consumer2]] == 1}
+
+        # Consumer 1 reads another 2 items from stream
+        r XREADGROUP GROUP mygroup consumer1 count 2 STREAMS mystream >
+        after 200
+
+        # Delete item 2 from the stream. Now consumer 1 has PEL that contains
+        # only item 3. Try to use consumer 2 to claim the deleted item 2
+        # from the PEL of consumer 1, this should return nil
+        r XDEL mystream $id2
+        set reply [
+            r XCLAIM mystream mygroup consumer2 10 $id2
+        ]
+        assert {[llength $reply] == 1}
+        assert_equal "" [lindex $reply 0]
+
+        # Delete item 3 from the stream. Now consumer 1 has PEL that is empty.
+        # Try to use consumer 2 to claim the deleted item 3 from the PEL
+        # of consumer 1, this should return nil
+        after 200
+        r XDEL mystream $id3
+        set reply [
+            r XCLAIM mystream mygroup consumer2 10 $id3
+        ]
+        assert {[llength $reply] == 1}
+        assert_equal "" [lindex $reply 0]
+    }
+
+    test {XCLAIM without JUSTID increments delivery count} {
+        # Add 3 items into the stream, and create a consumer group
+        r del mystream
+        set id1 [r XADD mystream * a 1]
+        set id2 [r XADD mystream * b 2]
+        set id3 [r XADD mystream * c 3]
+        r XGROUP CREATE mystream mygroup 0
+
+        # Consumer 1 reads item 1 from the stream without acknowledgements.
+        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
+        set reply [
+            r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >
+        ]
+        assert {[llength [lindex $reply 0 1 0 1]] == 2}
+        assert {[lindex $reply 0 1 0 1] eq {a 1}}
+        after 200
+        set reply [
+            r XCLAIM mystream mygroup consumer2 10 $id1
+        ]
+        assert {[llength [lindex $reply 0 1]] == 2}
+        assert {[lindex $reply 0 1] eq {a 1}}
+
+        set reply [
+            r XPENDING mystream mygroup - + 10
+        ]
+        assert {[llength [lindex $reply 0]] == 4}
+        assert {[lindex $reply 0 3] == 2}
+
+        # Consumer 3 then claims pending item 1 from the PEL of consumer 2 using JUSTID
+        after 200
+        set reply [
+            r XCLAIM mystream mygroup consumer3 10 $id1 JUSTID
+        ]
+        assert {[llength $reply] == 1}
+        assert {[lindex $reply 0] eq $id1}
+
+        set reply [
+            r XPENDING mystream mygroup - + 10
+        ]
+        assert {[llength [lindex $reply 0]] == 4}
+        assert {[lindex $reply 0 3] == 2}
+    }
+
+    test {XCLAIM same consumer} {
+        # Add 3 items into the stream, and create a consumer group
+        r del mystream
+        set id1 [r XADD mystream * a 1]
+        set id2 [r XADD mystream * b 2]
+        set id3 [r XADD mystream * c 3]
+        r XGROUP CREATE mystream mygroup 0
+
+        set reply [r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >]
+        assert {[llength [lindex $reply 0 1 0 1]] == 2}
+        assert {[lindex $reply 0 1 0 1] eq {a 1}}
+        after 200
+        # re-claim with the same consumer that already has it
+        assert {[llength [r XCLAIM mystream mygroup consumer1 10 $id1]] == 1}
+
+        # make sure the entry is still in the PEL
+        set reply [r XPENDING mystream mygroup - + 10]
+        assert {[llength $reply] == 1}
+        assert {[lindex $reply 0 1] eq {consumer1}}
+    }
+
+    test {XAUTOCLAIM can claim PEL items from another consumer} {
+        # Add 3 items into the stream, and create a consumer group
+        r del mystream
+        set id1 [r XADD mystream * a 1]
+        set id2 [r XADD mystream * b 2]
+        set id3 [r XADD mystream * c 3]
+        r XGROUP CREATE mystream mygroup 0
+
+        # Consumer 1 reads item 1 from the stream without acknowledgements.
+        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
+        set reply [r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >]
+        assert_equal [llength [lindex $reply 0 1 0 1]] 2
+        assert_equal [lindex $reply 0 1 0 1] {a 1}
+        after 200
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 1]
+        assert_equal [llength $reply] 2
+        assert_equal [lindex $reply 0] "0-0"
+        assert_equal [llength [lindex $reply 1]] 1
+        assert_equal [llength [lindex $reply 1 0]] 2
+        assert_equal [llength [lindex $reply 1 0 1]] 2
+        assert_equal [lindex $reply 1 0 1] {a 1}
+
+        # Consumer 1 reads another 2 items from stream
+        r XREADGROUP GROUP mygroup consumer1 count 2 STREAMS mystream >
+
+        # For min-idle-time
+        after 200
+
+        # Delete item 2 from the stream. Now consumer 1 has PEL that contains
+        # only item 3. Try to use consumer 2 to claim the deleted item 2
+        # from the PEL of consumer 1, this should return nil
+        r XDEL mystream $id2
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 2]
+        # id1 is self-claimed here but not id2 ('count' was set to 2)
+        assert_equal [llength $reply] 2
+        assert_equal [lindex $reply 0] $id3
+        assert_equal [llength [lindex $reply 1]] 2
+        assert_equal [llength [lindex $reply 1 0]] 2
+        assert_equal [llength [lindex $reply 1 0 1]] 2
+        assert_equal [lindex $reply 1 0 1] {a 1}
+        assert_equal [lindex $reply 1 1] ""
+
+        # Delete item 3 from the stream. Now consumer 1 has PEL that is empty.
+        # Try to use consumer 2 to claim the deleted item 3 from the PEL
+        # of consumer 1, this should return nil
+        after 200
+        r XDEL mystream $id3
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - JUSTID]
+        # id1 is self-claimed here but not id2 and id3 ('count' is default 100)
+
+        # we also test the JUSTID modifier here. note that, when using JUSTID,
+        # deleted entries are returned in reply (consistent with XCLAIM).
+
+        assert_equal [llength $reply] 2
+        assert_equal [lindex $reply 0] "0-0"
+        assert_equal [llength [lindex $reply 1]] 3
+        assert_equal [lindex $reply 1 0] $id1
+        assert_equal [lindex $reply 1 1] $id2
+        assert_equal [lindex $reply 1 2] $id3
+    }
+
+    test {XAUTOCLAIM as an iterator} {
+        # Add 5 items into the stream, and create a consumer group
+        r del mystream
+        set id1 [r XADD mystream * a 1]
+        set id2 [r XADD mystream * b 2]
+        set id3 [r XADD mystream * c 3]
+        set id4 [r XADD mystream * d 4]
+        set id5 [r XADD mystream * e 5]
+        r XGROUP CREATE mystream mygroup 0
+
+        # Read 5 messages into consumer1
+        r XREADGROUP GROUP mygroup consumer1 count 90 STREAMS mystream >
+
+        # For min-idle-time
+        after 200
+
+        # Claim 2 entries
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 2]
+        assert_equal [llength $reply] 2
+        set cursor [lindex $reply 0]
+        assert_equal $cursor $id3
+        assert_equal [llength [lindex $reply 1]] 2
+        assert_equal [llength [lindex $reply 1 0 1]] 2
+        assert_equal [lindex $reply 1 0 1] {a 1}
+
+        # Claim 2 more entries
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 $cursor COUNT 2]
+        assert_equal [llength $reply] 2
+        set cursor [lindex $reply 0]
+        assert_equal $cursor $id5
+        assert_equal [llength [lindex $reply 1]] 2
+        assert_equal [llength [lindex $reply 1 0 1]] 2
+        assert_equal [lindex $reply 1 0 1] {c 3}
+
+        # Claim last entry
+        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 $cursor COUNT 1]
+        assert_equal [llength $reply] 2
+        set cursor [lindex $reply 0]
+        assert_equal $cursor {0-0}
+        assert_equal [llength [lindex $reply 1]] 1
+        assert_equal [llength [lindex $reply 1 0 1]] 2
+        assert_equal [lindex $reply 1 0 1] {e 5}
+    }
+
+    test {XAUTOCLAIM COUNT must be > 0} {
+       assert_error "ERR COUNT must be > 0" {r XAUTOCLAIM key group consumer 1 1 COUNT 0}
+    }
+
+    test {XINFO FULL output} {
+        r del x
+        r XADD x 100 a 1
+        r XADD x 101 b 1
+        r XADD x 102 c 1
+        r XADD x 103 e 1
+        r XADD x 104 f 1
+        r XGROUP CREATE x g1 0
+        r XGROUP CREATE x g2 0
+        r XREADGROUP GROUP g1 Alice COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g1 Bob COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g1 Bob NOACK COUNT 1 STREAMS x >
+        r XREADGROUP GROUP g2 Charlie COUNT 4 STREAMS x >
+        r XDEL x 103
+
+        set reply [r XINFO STREAM x FULL]
+        assert_equal [llength $reply] 12
+        assert_equal [lindex $reply 1] 4 ;# stream length
+        assert_equal [lindex $reply 9] "{100-0 {a 1}} {101-0 {b 1}} {102-0 {c 1}} {104-0 {f 1}}" ;# entries
+        assert_equal [lindex $reply 11 0 1] "g1" ;# first group name
+        assert_equal [lindex $reply 11 0 7 0 0] "100-0" ;# first entry in group's PEL
+        assert_equal [lindex $reply 11 0 9 0 1] "Alice" ;# first consumer
+        assert_equal [lindex $reply 11 0 9 0 7 0 0] "100-0" ;# first entry in first consumer's PEL
+        assert_equal [lindex $reply 11 1 1] "g2" ;# second group name
+        assert_equal [lindex $reply 11 1 9 0 1] "Charlie" ;# first consumer
+        assert_equal [lindex $reply 11 1 9 0 7 0 0] "100-0" ;# first entry in first consumer's PEL
+        assert_equal [lindex $reply 11 1 9 0 7 1 0] "101-0" ;# second entry in first consumer's PEL
+
+        set reply [r XINFO STREAM x FULL COUNT 1]
+        assert_equal [llength $reply] 12
+        assert_equal [lindex $reply 1] 4
+        assert_equal [lindex $reply 9] "{100-0 {a 1}}"
+    }
+
+    test {XGROUP CREATECONSUMER: create consumer if does not exist} {
+        r del mystream
+        r XGROUP CREATE mystream mygroup $ MKSTREAM
+        r XADD mystream * f v
+
+        set reply [r xinfo groups mystream]
+        set group_info [lindex $reply 0]
+        set n_consumers [lindex $group_info 3]
+        assert_equal $n_consumers 0 ;# consumers number in cg
+
+        # create consumer using XREADGROUP
+        r XREADGROUP GROUP mygroup Alice COUNT 1 STREAMS mystream >
+
+        set reply [r xinfo groups mystream]
+        set group_info [lindex $reply 0]
+        set n_consumers [lindex $group_info 3]
+        assert_equal $n_consumers 1 ;# consumers number in cg
+
+        set reply [r xinfo consumers mystream mygroup]
+        set consumer_info [lindex $reply 0]
+        assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
+
+        # create group using XGROUP CREATECONSUMER when Alice already exists
+        set created [r XGROUP CREATECONSUMER mystream mygroup Alice]
+        assert_equal $created 0
+
+        # create group using XGROUP CREATECONSUMER when Bob does not exist
+        set created [r XGROUP CREATECONSUMER mystream mygroup Bob]
+        assert_equal $created 1
+
+        set reply [r xinfo groups mystream]
+        set group_info [lindex $reply 0]
+        set n_consumers [lindex $group_info 3]
+        assert_equal $n_consumers 2 ;# consumers number in cg
+
+        set reply [r xinfo consumers mystream mygroup]
+        set consumer_info [lindex $reply 0]
+        assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
+        set consumer_info [lindex $reply 1]
+        assert_equal [lindex $consumer_info 1] "Bob" ;# consumer name
+    }
+
+    test {XGROUP CREATECONSUMER: group must exist} {
+        r del mystream
+        r XADD mystream * f v
+        assert_error "*NOGROUP*" {r XGROUP CREATECONSUMER mystream mygroup consumer}
+    }
+
+    start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no appendfsync always}} {
+        test {XREADGROUP with NOACK creates consumer} {
+            r del mystream
+            r XGROUP CREATE mystream mygroup $ MKSTREAM
+            r XADD mystream * f1 v1
+            r XREADGROUP GROUP mygroup Alice NOACK STREAMS mystream ">"
+            set rd [redis_deferring_client]
+            $rd XREADGROUP GROUP mygroup Bob BLOCK 0 NOACK STREAMS mystream ">"
+            r XADD mystream * f2 v2
+            set grpinfo [r xinfo groups mystream]
+
+            r debug loadaof
+            assert {[r xinfo groups mystream] == $grpinfo}
+            set reply [r xinfo consumers mystream mygroup]
+            set consumer_info [lindex $reply 0]
+            assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
+            set consumer_info [lindex $reply 1]
+            assert_equal [lindex $consumer_info 1] "Bob" ;# consumer name
+        }
+
+        test {Consumer without PEL is present in AOF after AOFRW} {
+            r del mystream
+            r XGROUP CREATE mystream mygroup $ MKSTREAM
+            r XADD mystream * f v
+            r XREADGROUP GROUP mygroup Alice NOACK STREAMS mystream ">"
+            set rd [redis_deferring_client]
+            $rd XREADGROUP GROUP mygroup Bob BLOCK 0 NOACK STREAMS mystream ">"
+            r XGROUP CREATECONSUMER mystream mygroup Charlie
+            set grpinfo [lindex [r xinfo groups mystream] 0]
+
+            r bgrewriteaof
+            waitForBgrewriteaof r
+            r debug loadaof
+
+            set curr_grpinfo [lindex [r xinfo groups mystream] 0]
+            assert {$curr_grpinfo == $grpinfo}
+            set n_consumers [lindex $grpinfo 3]
+
+            # Bob should be created only when there will be new data for this consumer
+            assert_equal $n_consumers 2
+            set reply [r xinfo consumers mystream mygroup]
+            set consumer_info [lindex $reply 0]
+            assert_equal [lindex $consumer_info 1] "Alice"
+            set consumer_info [lindex $reply 1]
+            assert_equal [lindex $consumer_info 1] "Charlie"
+        }
+    }
+
+    start_server {} {
+        set master [srv -1 client]
+        set master_host [srv -1 host]
+        set master_port [srv -1 port]
+        set slave [srv 0 client]
+
+        foreach noack {0 1} {
+            test "Consumer group last ID propagation to slave (NOACK=$noack)" {
+                $slave slaveof $master_host $master_port
+                wait_for_condition 50 100 {
+                    [s 0 master_link_status] eq {up}
+                } else {
+                    fail "Replication not started."
+                }
+
+                $master del stream
+                $master xadd stream * a 1
+                $master xadd stream * a 2
+                $master xadd stream * a 3
+                $master xgroup create stream mygroup 0
+
+                # Consume the first two items on the master
+                for {set j 0} {$j < 2} {incr j} {
+                    if {$noack} {
+                        set item [$master xreadgroup group mygroup \
+                                  myconsumer COUNT 1 NOACK STREAMS stream >]
+                    } else {
+                        set item [$master xreadgroup group mygroup \
+                                  myconsumer COUNT 1 STREAMS stream >]
+                    }
+                    set id [lindex $item 0 1 0 0]
+                    if {$noack == 0} {
+                        assert {[$master xack stream mygroup $id] eq "1"}
+                    }
+                }
+
+                wait_for_ofs_sync $master $slave
+
+                # Turn slave into master
+                $slave slaveof no one
+
+                set item [$slave xreadgroup group mygroup myconsumer \
+                          COUNT 1 STREAMS stream >]
+
+                # The consumed enty should be the third
+                set myentry [lindex $item 0 1 0 1]
+                assert {$myentry eq {a 3}}
+            }
+        }
+    }
+
+    start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no}} {
+        test {Empty stream with no lastid can be rewrite into AOF correctly} {
+            r XGROUP CREATE mystream group-name $ MKSTREAM
+            assert {[dict get [r xinfo stream mystream] length] == 0}
+            set grpinfo [r xinfo groups mystream]
+            r bgrewriteaof
+            waitForBgrewriteaof r
+            r debug loadaof
+            assert {[dict get [r xinfo stream mystream] length] == 0}
+            assert {[r xinfo groups mystream] == $grpinfo}
+        }
+    }
+}
diff --git a/redis-stable/tests/unit/type/stream.tcl b/redis-stable/tests/unit/type/stream.tcl
new file mode 100644
index 00000000..f1ee56a8
--- /dev/null
+++ b/redis-stable/tests/unit/type/stream.tcl
@@ -0,0 +1,710 @@
+# return value is like strcmp() and similar.
+proc streamCompareID {a b} {
+    if {$a eq $b} {return 0}
+    lassign [split $a -] a_ms a_seq
+    lassign [split $b -] b_ms b_seq
+    if {$a_ms > $b_ms} {return 1}
+    if {$a_ms < $b_ms} {return -1}
+    # Same ms case, compare seq.
+    if {$a_seq > $b_seq} {return 1}
+    if {$a_seq < $b_seq} {return -1}
+}
+
+# return the ID immediately greater than the specified one.
+# Note that this function does not care to handle 'seq' overflow
+# since it's a 64 bit value.
+proc streamNextID {id} {
+    lassign [split $id -] ms seq
+    incr seq
+    join [list $ms $seq] -
+}
+
+# Generate a random stream entry ID with the ms part between min and max
+# and a low sequence number (0 - 999 range), in order to stress test
+# XRANGE against a Tcl implementation implementing the same concept
+# with Tcl-only code in a linear array.
+proc streamRandomID {min_id max_id} {
+    lassign [split $min_id -] min_ms min_seq
+    lassign [split $max_id -] max_ms max_seq
+    set delta [expr {$max_ms-$min_ms+1}]
+    set ms [expr {$min_ms+[randomInt $delta]}]
+    set seq [randomInt 1000]
+    return $ms-$seq
+}
+
+# Tcl-side implementation of XRANGE to perform fuzz testing in the Redis
+# XRANGE implementation.
+proc streamSimulateXRANGE {items start end} {
+    set res {}
+    foreach i $items  {
+        set this_id [lindex $i 0]
+        if {[streamCompareID $this_id $start] >= 0} {
+            if {[streamCompareID $this_id $end] <= 0} {
+                lappend res $i
+            }
+        }
+    }
+    return $res
+}
+
+set content {} ;# Will be populated with Tcl side copy of the stream content.
+
+start_server {
+    tags {"stream"}
+} {
+    test {XADD can add entries into a stream that XRANGE can fetch} {
+        r XADD mystream * item 1 value a
+        r XADD mystream * item 2 value b
+        assert_equal 2 [r XLEN mystream]
+        set items [r XRANGE mystream - +]
+        assert_equal [lindex $items 0 1] {item 1 value a}
+        assert_equal [lindex $items 1 1] {item 2 value b}
+    }
+
+    test {XADD IDs are incremental} {
+        set id1 [r XADD mystream * item 1 value a]
+        set id2 [r XADD mystream * item 2 value b]
+        set id3 [r XADD mystream * item 3 value c]
+        assert {[streamCompareID $id1 $id2] == -1}
+        assert {[streamCompareID $id2 $id3] == -1}
+    }
+
+    test {XADD IDs are incremental when ms is the same as well} {
+        r multi
+        r XADD mystream * item 1 value a
+        r XADD mystream * item 2 value b
+        r XADD mystream * item 3 value c
+        lassign [r exec] id1 id2 id3
+        assert {[streamCompareID $id1 $id2] == -1}
+        assert {[streamCompareID $id2 $id3] == -1}
+    }
+
+    test {XADD IDs correctly report an error when overflowing} {
+        r DEL mystream
+        r xadd mystream 18446744073709551615-18446744073709551615 a b
+        assert_error ERR* {r xadd mystream * c d}
+    }
+
+    test {XADD with MAXLEN option} {
+        r DEL mystream
+        for {set j 0} {$j < 1000} {incr j} {
+            if {rand() < 0.9} {
+                r XADD mystream MAXLEN 5 * xitem $j
+            } else {
+                r XADD mystream MAXLEN 5 * yitem $j
+            }
+        }
+        assert {[r xlen mystream] == 5}
+        set res [r xrange mystream - +]
+        set expected 995
+        foreach r $res {
+            assert {[lindex $r 1 1] == $expected}
+            incr expected
+        }
+    }
+
+    test {XADD with MAXLEN option and the '=' argument} {
+        r DEL mystream
+        for {set j 0} {$j < 1000} {incr j} {
+            if {rand() < 0.9} {
+                r XADD mystream MAXLEN = 5 * xitem $j
+            } else {
+                r XADD mystream MAXLEN = 5 * yitem $j
+            }
+        }
+        assert {[r XLEN mystream] == 5}
+    }
+
+    test {XADD with MAXLEN option and the '~' argument} {
+        r DEL mystream
+        for {set j 0} {$j < 1000} {incr j} {
+            if {rand() < 0.9} {
+                r XADD mystream MAXLEN ~ 555 * xitem $j
+            } else {
+                r XADD mystream MAXLEN ~ 555 * yitem $j
+            }
+        }
+        assert {[r XLEN mystream] == 600}
+    }
+
+    test {XADD with NOMKSTREAM option} {
+        r DEL mystream
+        assert_equal "" [r XADD mystream NOMKSTREAM * item 1 value a]
+        assert_equal 0 [r EXISTS mystream]
+        r XADD mystream * item 1 value a
+        r XADD mystream NOMKSTREAM * item 2 value b
+        assert_equal 2 [r XLEN mystream]
+        set items [r XRANGE mystream - +]
+        assert_equal [lindex $items 0 1] {item 1 value a}
+        assert_equal [lindex $items 1 1] {item 2 value b}
+    }
+
+    test {XADD with MINID option} {
+        r DEL mystream
+        for {set j 1} {$j < 1001} {incr j} {
+            set minid 1000
+            if {$j >= 5} {
+                set minid [expr {$j-5}]
+            }
+            if {rand() < 0.9} {
+                r XADD mystream MINID $minid $j xitem $j
+            } else {
+                r XADD mystream MINID $minid $j yitem $j
+            }
+        }
+        assert {[r xlen mystream] == 6}
+        set res [r xrange mystream - +]
+        set expected 995
+        foreach r $res {
+            assert {[lindex $r 1 1] == $expected}
+            incr expected
+        }
+    }
+
+    test {XTRIM with MINID option} {
+        r DEL mystream
+        r XADD mystream 1-0 f v
+        r XADD mystream 2-0 f v
+        r XADD mystream 3-0 f v
+        r XADD mystream 4-0 f v
+        r XADD mystream 5-0 f v
+        r XTRIM mystream MINID = 3-0
+        assert_equal [r XRANGE mystream - +] {{3-0 {f v}} {4-0 {f v}} {5-0 {f v}}}
+    }
+
+    test {XADD mass insertion and XLEN} {
+        r DEL mystream
+        r multi
+        for {set j 0} {$j < 10000} {incr j} {
+            # From time to time insert a field with a different set
+            # of fields in order to stress the stream compression code.
+            if {rand() < 0.9} {
+                r XADD mystream * item $j
+            } else {
+                r XADD mystream * item $j otherfield foo
+            }
+        }
+        r exec
+
+        set items [r XRANGE mystream - +]
+        for {set j 0} {$j < 10000} {incr j} {
+            assert {[lrange [lindex $items $j 1] 0 1] eq [list item $j]}
+        }
+        assert {[r xlen mystream] == $j}
+    }
+
+    test {XADD with ID 0-0} {
+        r DEL otherstream
+        catch {r XADD otherstream 0-0 k v} err
+        assert {[r EXISTS otherstream] == 0}
+    }
+
+    test {XADD with LIMIT delete entries no more than limit} {
+        r del yourstream
+        for {set j 0} {$j < 3} {incr j} {
+            r XADD yourstream * xitem v
+        }
+        r XADD yourstream MAXLEN ~ 0 limit 1 * xitem v
+        assert {[r XLEN yourstream] == 4}
+    }
+
+    test {XRANGE COUNT works as expected} {
+        assert {[llength [r xrange mystream - + COUNT 10]] == 10}
+    }
+
+    test {XREVRANGE COUNT works as expected} {
+        assert {[llength [r xrevrange mystream + - COUNT 10]] == 10}
+    }
+
+    test {XRANGE can be used to iterate the whole stream} {
+        set last_id "-"
+        set j 0
+        while 1 {
+            set elements [r xrange mystream $last_id + COUNT 100]
+            if {[llength $elements] == 0} break
+            foreach e $elements {
+                assert {[lrange [lindex $e 1] 0 1] eq [list item $j]}
+                incr j;
+            }
+            set last_id [streamNextID [lindex $elements end 0]]
+        }
+        assert {$j == 10000}
+    }
+
+    test {XREVRANGE returns the reverse of XRANGE} {
+        assert {[r xrange mystream - +] == [lreverse [r xrevrange mystream + -]]}
+    }
+
+    test {XRANGE exclusive ranges} {
+        set ids {0-1 0-18446744073709551615 1-0 42-0 42-42
+                 18446744073709551615-18446744073709551614
+                 18446744073709551615-18446744073709551615}
+        set total [llength $ids]
+        r multi
+        r DEL vipstream
+        foreach id $ids {
+            r XADD vipstream $id foo bar
+        }
+        r exec
+        assert {[llength [r xrange vipstream - +]] == $total}
+        assert {[llength [r xrange vipstream ([lindex $ids 0] +]] == $total-1}
+        assert {[llength [r xrange vipstream - ([lindex $ids $total-1]]] == $total-1}
+        assert {[llength [r xrange vipstream (0-1 (1-0]] == 1}
+        assert {[llength [r xrange vipstream (1-0 (42-42]] == 1}
+        catch {r xrange vipstream (- +} e
+        assert_match {ERR*} $e
+        catch {r xrange vipstream - (+} e
+        assert_match {ERR*} $e
+        catch {r xrange vipstream (18446744073709551615-18446744073709551615 +} e
+        assert_match {ERR*} $e
+        catch {r xrange vipstream - (0-0} e
+        assert_match {ERR*} $e
+    }
+
+    test {XREAD with non empty stream} {
+        set res [r XREAD COUNT 1 STREAMS mystream 0-0]
+        assert {[lrange [lindex $res 0 1 0 1] 0 1] eq {item 0}}
+    }
+
+    test {Non blocking XREAD with empty streams} {
+        set res [r XREAD STREAMS s1 s2 0-0 0-0]
+        assert {$res eq {}}
+    }
+
+    test {XREAD with non empty second stream} {
+        set res [r XREAD COUNT 1 STREAMS nostream mystream 0-0 0-0]
+        assert {[lindex $res 0 0] eq {mystream}}
+        assert {[lrange [lindex $res 0 1 0 1] 0 1] eq {item 0}}
+    }
+
+    test {Blocking XREAD waiting new data} {
+        r XADD s2 * old abcd1234
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 20000 STREAMS s1 s2 s3 $ $ $
+        r XADD s2 * new abcd1234
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s2}}
+        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
+    }
+
+    test {Blocking XREAD waiting old data} {
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 20000 STREAMS s1 s2 s3 $ 0-0 $
+        r XADD s2 * foo abcd1234
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s2}}
+        assert {[lindex $res 0 1 0 1] eq {old abcd1234}}
+    }
+
+    test {Blocking XREAD will not reply with an empty array} {
+        r del s1
+        r XADD s1 666 f v
+        r XADD s1 667 f2 v2
+        r XDEL s1 667
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 10 STREAMS s1 666
+        after 20
+        assert {[$rd read] == {}} ;# before the fix, client didn't even block, but was served synchronously with {s1 {}}
+    }
+
+    test "XREAD: XADD + DEL should not awake client" {
+        set rd [redis_deferring_client]
+        r del s1
+        $rd XREAD BLOCK 20000 STREAMS s1 $
+        r multi
+        r XADD s1 * old abcd1234
+        r DEL s1
+        r exec
+        r XADD s1 * new abcd1234
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s1}}
+        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
+    }
+
+    test "XREAD: XADD + DEL + LPUSH should not awake client" {
+        set rd [redis_deferring_client]
+        r del s1
+        $rd XREAD BLOCK 20000 STREAMS s1 $
+        r multi
+        r XADD s1 * old abcd1234
+        r DEL s1
+        r LPUSH s1 foo bar
+        r exec
+        r DEL s1
+        r XADD s1 * new abcd1234
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s1}}
+        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
+    }
+
+    test {XREAD with same stream name multiple times should work} {
+        r XADD s2 * old abcd1234
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 20000 STREAMS s2 s2 s2 $ $ $
+        r XADD s2 * new abcd1234
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s2}}
+        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
+    }
+
+    test {XREAD + multiple XADD inside transaction} {
+        r XADD s2 * old abcd1234
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 20000 STREAMS s2 s2 s2 $ $ $
+        r MULTI
+        r XADD s2 * field one
+        r XADD s2 * field two
+        r XADD s2 * field three
+        r EXEC
+        set res [$rd read]
+        assert {[lindex $res 0 0] eq {s2}}
+        assert {[lindex $res 0 1 0 1] eq {field one}}
+        assert {[lindex $res 0 1 1 1] eq {field two}}
+    }
+
+    test {XDEL basic test} {
+        r del somestream
+        r xadd somestream * foo value0
+        set id [r xadd somestream * foo value1]
+        r xadd somestream * foo value2
+        r xdel somestream $id
+        assert {[r xlen somestream] == 2}
+        set result [r xrange somestream - +]
+        assert {[lindex $result 0 1 1] eq {value0}}
+        assert {[lindex $result 1 1 1] eq {value2}}
+    }
+
+    # Here the idea is to check the consistency of the stream data structure
+    # as we remove all the elements down to zero elements.
+    test {XDEL fuzz test} {
+        r del somestream
+        set ids {}
+        set x 0; # Length of the stream
+        while 1 {
+            lappend ids [r xadd somestream * item $x]
+            incr x
+            # Add enough elements to have a few radix tree nodes inside the stream.
+            if {[dict get [r xinfo stream somestream] radix-tree-keys] > 20} break
+        }
+
+        # Now remove all the elements till we reach an empty stream
+        # and after every deletion, check that the stream is sane enough
+        # to report the right number of elements with XRANGE: this will also
+        # force accessing the whole data structure to check sanity.
+        assert {[r xlen somestream] == $x}
+
+        # We want to remove elements in random order to really test the
+        # implementation in a better way.
+        set ids [lshuffle $ids]
+        foreach id $ids {
+            assert {[r xdel somestream $id] == 1}
+            incr x -1
+            assert {[r xlen somestream] == $x}
+            # The test would be too slow calling XRANGE for every iteration.
+            # Do it every 100 removal.
+            if {$x % 100 == 0} {
+                set res [r xrange somestream - +]
+                assert {[llength $res] == $x}
+            }
+        }
+    }
+
+    test {XRANGE fuzzing} {
+        set low_id [lindex $items 0 0]
+        set high_id [lindex $items end 0]
+        for {set j 0} {$j < 100} {incr j} {
+            set start [streamRandomID $low_id $high_id]
+            set end [streamRandomID $low_id $high_id]
+            set range [r xrange mystream $start $end]
+            set tcl_range [streamSimulateXRANGE $items $start $end]
+            if {$range ne $tcl_range} {
+                puts "*** WARNING *** - XRANGE fuzzing mismatch: $start - $end"
+                puts "---"
+                puts "XRANGE: '$range'"
+                puts "---"
+                puts "TCL: '$tcl_range'"
+                puts "---"
+                fail "XRANGE fuzzing failed, check logs for details"
+            }
+        }
+    }
+
+    test {XREVRANGE regression test for issue #5006} {
+        # Add non compressed entries
+        r xadd teststream 1234567891230 key1 value1
+        r xadd teststream 1234567891240 key2 value2
+        r xadd teststream 1234567891250 key3 value3
+
+        # Add SAMEFIELD compressed entries
+        r xadd teststream2 1234567891230 key1 value1
+        r xadd teststream2 1234567891240 key1 value2
+        r xadd teststream2 1234567891250 key1 value3
+
+        assert_equal [r xrevrange teststream 1234567891245 -] {{1234567891240-0 {key2 value2}} {1234567891230-0 {key1 value1}}}
+
+        assert_equal [r xrevrange teststream2 1234567891245 -] {{1234567891240-0 {key1 value2}} {1234567891230-0 {key1 value1}}}
+    }
+
+    test {XREAD streamID edge (no-blocking)} {
+        r del x
+        r XADD x 1-1 f v
+        r XADD x 1-18446744073709551615 f v
+        r XADD x 2-1 f v
+        set res [r XREAD BLOCK 0 STREAMS x 1-18446744073709551615]
+        assert {[lindex $res 0 1 0] == {2-1 {f v}}}
+    }
+
+    test {XREAD streamID edge (blocking)} {
+        r del x
+        set rd [redis_deferring_client]
+        $rd XREAD BLOCK 0 STREAMS x 1-18446744073709551615
+        r XADD x 1-1 f v
+        r XADD x 1-18446744073709551615 f v
+        r XADD x 2-1 f v
+        set res [$rd read]
+        assert {[lindex $res 0 1 0] == {2-1 {f v}}}
+    }
+
+    test {XADD streamID edge} {
+        r del x
+        r XADD x 2577343934890-18446744073709551615 f v ;# we need the timestamp to be in the future
+        r XADD x * f2 v2
+        assert_equal [r XRANGE x - +] {{2577343934890-18446744073709551615 {f v}} {2577343934891-0 {f2 v2}}}
+    }
+
+    test {XTRIM with MAXLEN option basic test} {
+        r DEL mystream
+        for {set j 0} {$j < 1000} {incr j} {
+            if {rand() < 0.9} {
+                r XADD mystream * xitem $j
+            } else {
+                r XADD mystream * yitem $j
+            }
+        }
+        r XTRIM mystream MAXLEN 666
+        assert {[r XLEN mystream] == 666}
+        r XTRIM mystream MAXLEN = 555
+        assert {[r XLEN mystream] == 555}
+        r XTRIM mystream MAXLEN ~ 444
+        assert {[r XLEN mystream] == 500}
+        r XTRIM mystream MAXLEN ~ 400
+        assert {[r XLEN mystream] == 400}
+    }
+
+    test {XADD with LIMIT consecutive calls} {
+        r del mystream
+        r config set stream-node-max-entries 10
+        for {set j 0} {$j < 100} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
+        assert {[r xlen mystream] == 71}
+        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
+        assert {[r xlen mystream] == 62}
+        r config set stream-node-max-entries 100
+    }
+
+    test {XTRIM with ~ is limited} {
+        r del mystream
+        r config set stream-node-max-entries 1
+        for {set j 0} {$j < 102} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XTRIM mystream MAXLEN ~ 1
+        assert {[r xlen mystream] == 2}
+        r config set stream-node-max-entries 100
+    }
+
+    test {XTRIM without ~ is not limited} {
+        r del mystream
+        r config set stream-node-max-entries 1
+        for {set j 0} {$j < 102} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XTRIM mystream MAXLEN 1
+        assert {[r xlen mystream] == 1}
+        r config set stream-node-max-entries 100
+    }
+
+    test {XTRIM without ~ and with LIMIT} {
+        r del mystream
+        r config set stream-node-max-entries 1
+        for {set j 0} {$j < 102} {incr j} {
+            r XADD mystream * xitem v
+        }
+        assert_error ERR* {r XTRIM mystream MAXLEN 1 LIMIT 30}
+    }
+
+    test {XTRIM with LIMIT delete entries no more than limit} {
+        r del mystream
+        r config set stream-node-max-entries 2
+        for {set j 0} {$j < 3} {incr j} {
+            r XADD mystream * xitem v
+        }
+        assert {[r XTRIM mystream MAXLEN ~ 0 LIMIT 1] == 0}
+        assert {[r XTRIM mystream MAXLEN ~ 0 LIMIT 2] == 2}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes}} {
+    test {XADD with MAXLEN > xlen can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XADD mystream MAXLEN 200 * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+        r debug loadaof
+        r XADD mystream * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes}} {
+    test {XADD with MINID > lastid can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            set id [expr {$j+1}]
+            r XADD mystream $id xitem v
+        }
+        r XADD mystream MINID 1 * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+        r debug loadaof
+        r XADD mystream * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes}} {
+    test {XADD with ~ MAXLEN can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XADD mystream MAXLEN ~ $j * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+        r config set stream-node-max-entries 1
+        r debug loadaof
+        r XADD mystream * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
+    test {XADD with ~ MAXLEN and LIMIT can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
+        assert {[r xlen mystream] == 71}
+        r config set stream-node-max-entries 1
+        r debug loadaof
+        r XADD mystream * xitem v
+        assert {[r xlen mystream] == 72}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes}} {
+    test {XADD with ~ MINID can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            set id [expr {$j+1}]
+            r XADD mystream $id xitem v
+        }
+        r XADD mystream MINID ~ $j * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+        r config set stream-node-max-entries 1
+        r debug loadaof
+        r XADD mystream * xitem v
+        incr j
+        assert {[r xlen mystream] == $j}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
+    test {XADD with ~ MINID and LIMIT can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            set id [expr {$j+1}]
+            r XADD mystream $id xitem v
+        }
+        r XADD mystream MINID ~ 55 LIMIT 30 * xitem v
+        assert {[r xlen mystream] == 71}
+        r config set stream-node-max-entries 1
+        r debug loadaof
+        r XADD mystream * xitem v
+        assert {[r xlen mystream] == 72}
+    }
+}
+
+start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
+    test {XTRIM with ~ MAXLEN can propagate correctly} {
+        for {set j 0} {$j < 100} {incr j} {
+            r XADD mystream * xitem v
+        }
+        r XTRIM mystream MAXLEN ~ 85
+        assert {[r xlen mystream] == 90}
+        r config set stream-node-max-entries 1
+        r debug loadaof
+        r XADD mystream * xitem v
+        incr j
+        assert {[r xlen mystream] == 91}
+    }
+}
+
+start_server {tags {"stream xsetid"}} {
+    test {XADD can CREATE an empty stream} {
+        r XADD mystream MAXLEN 0 * a b
+        assert {[dict get [r xinfo stream mystream] length] == 0}
+    }
+
+    test {XSETID can set a specific ID} {
+        r XSETID mystream "200-0"
+        assert {[dict get [r xinfo stream mystream] last-generated-id] == "200-0"}
+    }
+
+    test {XSETID cannot SETID with smaller ID} {
+        r XADD mystream * a b
+        catch {r XSETID mystream "1-1"} err
+        r XADD mystream MAXLEN 0 * a b
+        set err
+    } {ERR*smaller*}
+
+    test {XSETID cannot SETID on non-existent key} {
+        catch {r XSETID stream 1-1} err
+        set _ $err
+    } {ERR no such key}
+}
+
+start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no}} {
+    test {Empty stream can be rewrite into AOF correctly} {
+        r XADD mystream MAXLEN 0 * a b
+        assert {[dict get [r xinfo stream mystream] length] == 0}
+        r bgrewriteaof
+        waitForBgrewriteaof r
+        r debug loadaof
+        assert {[dict get [r xinfo stream mystream] length] == 0}
+    }
+
+    test {Stream can be rewrite into AOF correctly after XDEL lastid} {
+        r XSETID mystream 0-0
+        r XADD mystream 1-1 a b
+        r XADD mystream 2-2 a b
+        assert {[dict get [r xinfo stream mystream] length] == 2}
+        r XDEL mystream 2-2
+        r bgrewriteaof
+        waitForBgrewriteaof r
+        r debug loadaof
+        assert {[dict get [r xinfo stream mystream] length] == 1}
+        assert {[dict get [r xinfo stream mystream] last-generated-id] == "2-2"}
+    }
+}
+
+start_server {tags {"stream"}} {
+    test {XGROUP HELP should not have unexpected options} {
+        catch {r XGROUP help xxx} e
+        assert_match "*Unknown subcommand or wrong number of arguments*" $e
+    }
+}
diff --git a/redis-stable/tests/unit/type/string.tcl b/redis-stable/tests/unit/type/string.tcl
new file mode 100644
index 00000000..43968b26
--- /dev/null
+++ b/redis-stable/tests/unit/type/string.tcl
@@ -0,0 +1,577 @@
+start_server {tags {"string"}} {
+    test {SET and GET an item} {
+        r set x foobar
+        r get x
+    } {foobar}
+
+    test {SET and GET an empty item} {
+        r set x {}
+        r get x
+    } {}
+
+    test {Very big payload in GET/SET} {
+        set buf [string repeat "abcd" 1000000]
+        r set foo $buf
+        r get foo
+    } [string repeat "abcd" 1000000]
+
+    tags {"slow"} {
+        test {Very big payload random access} {
+            set err {}
+            array set payload {}
+            for {set j 0} {$j < 100} {incr j} {
+                set size [expr 1+[randomInt 100000]]
+                set buf [string repeat "pl-$j" $size]
+                set payload($j) $buf
+                r set bigpayload_$j $buf
+            }
+            for {set j 0} {$j < 1000} {incr j} {
+                set index [randomInt 100]
+                set buf [r get bigpayload_$index]
+                if {$buf != $payload($index)} {
+                    set err "Values differ: I set '$payload($index)' but I read back '$buf'"
+                    break
+                }
+            }
+            unset payload
+            set _ $err
+        } {}
+
+        test {SET 10000 numeric keys and access all them in reverse order} {
+            r flushdb
+            set err {}
+            for {set x 0} {$x < 10000} {incr x} {
+                r set $x $x
+            }
+            set sum 0
+            for {set x 9999} {$x >= 0} {incr x -1} {
+                set val [r get $x]
+                if {$val ne $x} {
+                    set err "Element at position $x is $val instead of $x"
+                    break
+                }
+            }
+            set _ $err
+        } {}
+
+        test {DBSIZE should be 10000 now} {
+            r dbsize
+        } {10000}
+    }
+
+    test "SETNX target key missing" {
+        r del novar
+        assert_equal 1 [r setnx novar foobared]
+        assert_equal "foobared" [r get novar]
+    }
+
+    test "SETNX target key exists" {
+        r set novar foobared
+        assert_equal 0 [r setnx novar blabla]
+        assert_equal "foobared" [r get novar]
+    }
+
+    test "SETNX against not-expired volatile key" {
+        r set x 10
+        r expire x 10000
+        assert_equal 0 [r setnx x 20]
+        assert_equal 10 [r get x]
+    }
+
+    test "SETNX against expired volatile key" {
+        # Make it very unlikely for the key this test uses to be expired by the
+        # active expiry cycle. This is tightly coupled to the implementation of
+        # active expiry and dbAdd() but currently the only way to test that
+        # SETNX expires a key when it should have been.
+        for {set x 0} {$x < 9999} {incr x} {
+            r setex key-$x 3600 value
+        }
+
+        # This will be one of 10000 expiring keys. A cycle is executed every
+        # 100ms, sampling 10 keys for being expired or not.  This key will be
+        # expired for at most 1s when we wait 2s, resulting in a total sample
+        # of 100 keys. The probability of the success of this test being a
+        # false positive is therefore approx. 1%.
+        r set x 10
+        r expire x 1
+
+        # Wait for the key to expire
+        after 2000
+
+        assert_equal 1 [r setnx x 20]
+        assert_equal 20 [r get x]
+    }
+
+    test "GETEX EX option" {
+        r del foo
+        r set foo bar
+        r getex foo ex 10
+        assert_range [r ttl foo] 5 10
+    }
+
+    test "GETEX PX option" {
+        r del foo
+        r set foo bar
+        r getex foo px 10000
+        assert_range [r pttl foo] 5000 10000
+    }
+
+    test "GETEX EXAT option" {
+        r del foo
+        r set foo bar
+        r getex foo exat [expr [clock seconds] + 10]
+        assert_range [r ttl foo] 5 10
+    }
+
+    test "GETEX PXAT option" {
+        r del foo
+        r set foo bar
+        r getex foo pxat [expr [clock milliseconds] + 10000]
+        assert_range [r pttl foo] 5000 10000
+    }
+
+    test "GETEX PERSIST option" {
+        r del foo
+        r set foo bar ex 10
+        assert_range [r ttl foo] 5 10
+        r getex foo persist
+        assert_equal -1 [r ttl foo]
+    }
+
+    test "GETEX no option" {
+        r del foo
+        r set foo bar
+        r getex foo
+        assert_equal bar [r getex foo]
+    }
+
+    test "GETEX syntax errors" {
+        set ex {}
+        catch {r getex foo non-existent-option} ex
+        set ex
+    } {*syntax*}
+
+    test "GETEX no arguments" {
+         set ex {}
+         catch {r getex} ex
+         set ex
+     } {*wrong number of arguments*}
+
+    test "GETDEL command" {
+        r del foo
+        r set foo bar
+        assert_equal bar [r getdel foo ]
+        assert_equal {} [r getdel foo ]
+    }
+
+    test {GETDEL propagate as DEL command to replica} {
+        set repl [attach_to_replication_stream]
+        r set foo bar
+        r getdel foo
+        assert_replication_stream $repl {
+            {select *}
+            {set foo bar}
+            {del foo}
+        }
+    }
+
+    test {GETEX without argument does not propagate to replica} {
+        set repl [attach_to_replication_stream]
+        r set foo bar
+        r getex foo
+        r del foo
+        assert_replication_stream $repl {
+            {select *}
+            {set foo bar}
+            {del foo}
+        }
+    }
+
+    test {MGET} {
+        r flushdb
+        r set foo BAR
+        r set bar FOO
+        r mget foo bar
+    } {BAR FOO}
+
+    test {MGET against non existing key} {
+        r mget foo baazz bar
+    } {BAR {} FOO}
+
+    test {MGET against non-string key} {
+        r sadd myset ciao
+        r sadd myset bau
+        r mget foo baazz bar myset
+    } {BAR {} FOO {}}
+
+    test {GETSET (set new value)} {
+        r del foo
+        list [r getset foo xyz] [r get foo]
+    } {{} xyz}
+
+    test {GETSET (replace old value)} {
+        r set foo bar
+        list [r getset foo xyz] [r get foo]
+    } {bar xyz}
+
+    test {MSET base case} {
+        r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n"
+        r mget x y z
+    } [list 10 {foo bar} "x x x x x x x\n\n\r\n"]
+
+    test {MSET wrong number of args} {
+        catch {r mset x 10 y "foo bar" z} err
+        format $err
+    } {*wrong number*}
+
+    test {MSETNX with already existent key} {
+        list [r msetnx x1 xxx y2 yyy x 20] [r exists x1] [r exists y2]
+    } {0 0 0}
+
+    test {MSETNX with not existing keys} {
+        list [r msetnx x1 xxx y2 yyy] [r get x1] [r get y2]
+    } {1 xxx yyy}
+
+    test "STRLEN against non-existing key" {
+        assert_equal 0 [r strlen notakey]
+    }
+
+    test "STRLEN against integer-encoded value" {
+        r set myinteger -555
+        assert_equal 4 [r strlen myinteger]
+    }
+
+    test "STRLEN against plain string" {
+        r set mystring "foozzz0123456789 baz"
+        assert_equal 20 [r strlen mystring]
+    }
+
+    test "SETBIT against non-existing key" {
+        r del mykey
+        assert_equal 0 [r setbit mykey 1 1]
+        assert_equal [binary format B* 01000000] [r get mykey]
+    }
+
+    test "SETBIT against string-encoded key" {
+        # Ascii "@" is integer 64 = 01 00 00 00
+        r set mykey "@"
+
+        assert_equal 0 [r setbit mykey 2 1]
+        assert_equal [binary format B* 01100000] [r get mykey]
+        assert_equal 1 [r setbit mykey 1 0]
+        assert_equal [binary format B* 00100000] [r get mykey]
+    }
+
+    test "SETBIT against integer-encoded key" {
+        # Ascii "1" is integer 49 = 00 11 00 01
+        r set mykey 1
+        assert_encoding int mykey
+
+        assert_equal 0 [r setbit mykey 6 1]
+        assert_equal [binary format B* 00110011] [r get mykey]
+        assert_equal 1 [r setbit mykey 2 0]
+        assert_equal [binary format B* 00010011] [r get mykey]
+    }
+
+    test "SETBIT against key with wrong type" {
+        r del mykey
+        r lpush mykey "foo"
+        assert_error "WRONGTYPE*" {r setbit mykey 0 1}
+    }
+
+    test "SETBIT with out of range bit offset" {
+        r del mykey
+        assert_error "*out of range*" {r setbit mykey [expr 4*1024*1024*1024] 1}
+        assert_error "*out of range*" {r setbit mykey -1 1}
+    }
+
+    test "SETBIT with non-bit argument" {
+        r del mykey
+        assert_error "*out of range*" {r setbit mykey 0 -1}
+        assert_error "*out of range*" {r setbit mykey 0  2}
+        assert_error "*out of range*" {r setbit mykey 0 10}
+        assert_error "*out of range*" {r setbit mykey 0 20}
+    }
+
+    test "SETBIT fuzzing" {
+        set str ""
+        set len [expr 256*8]
+        r del mykey
+
+        for {set i 0} {$i < 2000} {incr i} {
+            set bitnum [randomInt $len]
+            set bitval [randomInt 2]
+            set fmt [format "%%-%ds%%d%%-s" $bitnum]
+            set head [string range $str 0 $bitnum-1]
+            set tail [string range $str $bitnum+1 end]
+            set str [string map {" " 0} [format $fmt $head $bitval $tail]]
+
+            r setbit mykey $bitnum $bitval
+            assert_equal [binary format B* $str] [r get mykey]
+        }
+    }
+
+    test "GETBIT against non-existing key" {
+        r del mykey
+        assert_equal 0 [r getbit mykey 0]
+    }
+
+    test "GETBIT against string-encoded key" {
+        # Single byte with 2nd and 3rd bit set
+        r set mykey "`"
+
+        # In-range
+        assert_equal 0 [r getbit mykey 0]
+        assert_equal 1 [r getbit mykey 1]
+        assert_equal 1 [r getbit mykey 2]
+        assert_equal 0 [r getbit mykey 3]
+
+        # Out-range
+        assert_equal 0 [r getbit mykey 8]
+        assert_equal 0 [r getbit mykey 100]
+        assert_equal 0 [r getbit mykey 10000]
+    }
+
+    test "GETBIT against integer-encoded key" {
+        r set mykey 1
+        assert_encoding int mykey
+
+        # Ascii "1" is integer 49 = 00 11 00 01
+        assert_equal 0 [r getbit mykey 0]
+        assert_equal 0 [r getbit mykey 1]
+        assert_equal 1 [r getbit mykey 2]
+        assert_equal 1 [r getbit mykey 3]
+
+        # Out-range
+        assert_equal 0 [r getbit mykey 8]
+        assert_equal 0 [r getbit mykey 100]
+        assert_equal 0 [r getbit mykey 10000]
+    }
+
+    test "SETRANGE against non-existing key" {
+        r del mykey
+        assert_equal 3 [r setrange mykey 0 foo]
+        assert_equal "foo" [r get mykey]
+
+        r del mykey
+        assert_equal 0 [r setrange mykey 0 ""]
+        assert_equal 0 [r exists mykey]
+
+        r del mykey
+        assert_equal 4 [r setrange mykey 1 foo]
+        assert_equal "\000foo" [r get mykey]
+    }
+
+    test "SETRANGE against string-encoded key" {
+        r set mykey "foo"
+        assert_equal 3 [r setrange mykey 0 b]
+        assert_equal "boo" [r get mykey]
+
+        r set mykey "foo"
+        assert_equal 3 [r setrange mykey 0 ""]
+        assert_equal "foo" [r get mykey]
+
+        r set mykey "foo"
+        assert_equal 3 [r setrange mykey 1 b]
+        assert_equal "fbo" [r get mykey]
+
+        r set mykey "foo"
+        assert_equal 7 [r setrange mykey 4 bar]
+        assert_equal "foo\000bar" [r get mykey]
+    }
+
+    test "SETRANGE against integer-encoded key" {
+        r set mykey 1234
+        assert_encoding int mykey
+        assert_equal 4 [r setrange mykey 0 2]
+        assert_encoding raw mykey
+        assert_equal 2234 [r get mykey]
+
+        # Shouldn't change encoding when nothing is set
+        r set mykey 1234
+        assert_encoding int mykey
+        assert_equal 4 [r setrange mykey 0 ""]
+        assert_encoding int mykey
+        assert_equal 1234 [r get mykey]
+
+        r set mykey 1234
+        assert_encoding int mykey
+        assert_equal 4 [r setrange mykey 1 3]
+        assert_encoding raw mykey
+        assert_equal 1334 [r get mykey]
+
+        r set mykey 1234
+        assert_encoding int mykey
+        assert_equal 6 [r setrange mykey 5 2]
+        assert_encoding raw mykey
+        assert_equal "1234\0002" [r get mykey]
+    }
+
+    test "SETRANGE against key with wrong type" {
+        r del mykey
+        r lpush mykey "foo"
+        assert_error "WRONGTYPE*" {r setrange mykey 0 bar}
+    }
+
+    test "SETRANGE with out of range offset" {
+        r del mykey
+        assert_error "*maximum allowed size*" {r setrange mykey [expr 512*1024*1024-4] world}
+
+        r set mykey "hello"
+        assert_error "*out of range*" {r setrange mykey -1 world}
+        assert_error "*maximum allowed size*" {r setrange mykey [expr 512*1024*1024-4] world}
+    }
+
+    test "GETRANGE against non-existing key" {
+        r del mykey
+        assert_equal "" [r getrange mykey 0 -1]
+    }
+
+    test "GETRANGE against string value" {
+        r set mykey "Hello World"
+        assert_equal "Hell" [r getrange mykey 0 3]
+        assert_equal "Hello World" [r getrange mykey 0 -1]
+        assert_equal "orld" [r getrange mykey -4 -1]
+        assert_equal "" [r getrange mykey 5 3]
+        assert_equal " World" [r getrange mykey 5 5000]
+        assert_equal "Hello World" [r getrange mykey -5000 10000]
+    }
+
+    test "GETRANGE against integer-encoded value" {
+        r set mykey 1234
+        assert_equal "123" [r getrange mykey 0 2]
+        assert_equal "1234" [r getrange mykey 0 -1]
+        assert_equal "234" [r getrange mykey -3 -1]
+        assert_equal "" [r getrange mykey 5 3]
+        assert_equal "4" [r getrange mykey 3 5000]
+        assert_equal "1234" [r getrange mykey -5000 10000]
+    }
+
+    test "GETRANGE fuzzing" {
+        for {set i 0} {$i < 1000} {incr i} {
+            r set bin [set bin [randstring 0 1024 binary]]
+            set _start [set start [randomInt 1500]]
+            set _end [set end [randomInt 1500]]
+            if {$_start < 0} {set _start "end-[abs($_start)-1]"}
+            if {$_end < 0} {set _end "end-[abs($_end)-1]"}
+            assert_equal [string range $bin $_start $_end] [r getrange bin $start $end]
+        }
+    }
+
+    test {Extended SET can detect syntax errors} {
+        set e {}
+        catch {r set foo bar non-existing-option} e
+        set e
+    } {*syntax*}
+
+    test {Extended SET NX option} {
+        r del foo
+        set v1 [r set foo 1 nx]
+        set v2 [r set foo 2 nx]
+        list $v1 $v2 [r get foo]
+    } {OK {} 1}
+
+    test {Extended SET XX option} {
+        r del foo
+        set v1 [r set foo 1 xx]
+        r set foo bar
+        set v2 [r set foo 2 xx]
+        list $v1 $v2 [r get foo]
+    } {{} OK 2}
+
+    test {Extended SET GET option} {
+        r del foo
+        r set foo bar
+        set old_value [r set foo bar2 GET]
+        set new_value [r get foo]
+        list $old_value $new_value
+    } {bar bar2}
+
+    test {Extended SET GET option with no previous value} {
+        r del foo
+        set old_value [r set foo bar GET]
+        set new_value [r get foo]
+        list $old_value $new_value
+    } {{} bar}
+
+    test {Extended SET GET with NX option should result in syntax err} {
+      catch {r set foo bar NX GET} err1
+      catch {r set foo bar NX GET} err2
+      list $err1 $err2
+    } {*syntax err* *syntax err*}
+
+    test {Extended SET GET with incorrect type should result in wrong type error} {
+      r del foo
+      r rpush foo waffle
+      catch {r set foo bar GET} err1
+      assert_equal "waffle" [r rpop foo]
+      set err1
+    } {*WRONGTYPE*}
+
+    test {Extended SET EX option} {
+        r del foo
+        r set foo bar ex 10
+        set ttl [r ttl foo]
+        assert {$ttl <= 10 && $ttl > 5}
+    }
+
+    test {Extended SET PX option} {
+        r del foo
+        r set foo bar px 10000
+        set ttl [r ttl foo]
+        assert {$ttl <= 10 && $ttl > 5}
+    }
+
+    test "Extended SET EXAT option" {
+        r del foo
+        r set foo bar exat [expr [clock seconds] + 10]
+        assert_range [r ttl foo] 5 10
+    }
+
+    test "Extended SET PXAT option" {
+        r del foo
+        r set foo bar pxat [expr [clock milliseconds] + 10000]
+        assert_range [r ttl foo] 5 10
+    }
+    test {Extended SET using multiple options at once} {
+        r set foo val
+        assert {[r set foo bar xx px 10000] eq {OK}}
+        set ttl [r ttl foo]
+        assert {$ttl <= 10 && $ttl > 5}
+    }
+
+    test {GETRANGE with huge ranges, Github issue #1844} {
+        r set foo bar
+        r getrange foo 0 4294967297
+    } {bar}
+
+    set rna1 {CACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTTCGTCCGGGTGTG}
+    set rna2 {ATTAAAGGTTTATACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTT}
+    set rnalcs {ACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTT}
+
+    test {STRALGO LCS string output with STRINGS option} {
+        r STRALGO LCS STRINGS $rna1 $rna2
+    } $rnalcs
+
+    test {STRALGO LCS len} {
+        r STRALGO LCS LEN STRINGS $rna1 $rna2
+    } [string length $rnalcs]
+
+    test {LCS with KEYS option} {
+        r set virus1 $rna1
+        r set virus2 $rna2
+        r STRALGO LCS KEYS virus1 virus2
+    } $rnalcs
+
+    test {LCS indexes} {
+        dict get [r STRALGO LCS IDX KEYS virus1 virus2] matches
+    } {{{238 238} {239 239}} {{236 236} {238 238}} {{229 230} {236 237}} {{224 224} {235 235}} {{1 222} {13 234}}}
+
+    test {LCS indexes with match len} {
+        dict get [r STRALGO LCS IDX KEYS virus1 virus2 WITHMATCHLEN] matches
+    } {{{238 238} {239 239} 1} {{236 236} {238 238} 1} {{229 230} {236 237} 2} {{224 224} {235 235} 1} {{1 222} {13 234} 222}}
+
+    test {LCS indexes with match len and minimum match len} {
+        dict get [r STRALGO LCS IDX KEYS virus1 virus2 WITHMATCHLEN MINMATCHLEN 5] matches
+    } {{{1 222} {13 234} 222}}
+}
diff --git a/redis-stable/tests/unit/type/zset.tcl b/redis-stable/tests/unit/type/zset.tcl
new file mode 100644
index 00000000..94b2ab48
--- /dev/null
+++ b/redis-stable/tests/unit/type/zset.tcl
@@ -0,0 +1,1870 @@
+start_server {tags {"zset"}} {
+    proc create_zset {key items} {
+        r del $key
+        foreach {score entry} $items {
+            r zadd $key $score $entry
+        }
+    }
+
+    proc basics {encoding} {
+        set original_max_entries [lindex [r config get zset-max-ziplist-entries] 1]
+        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
+        if {$encoding == "ziplist"} {
+            r config set zset-max-ziplist-entries 128
+            r config set zset-max-ziplist-value 64
+        } elseif {$encoding == "skiplist"} {
+            r config set zset-max-ziplist-entries 0
+            r config set zset-max-ziplist-value 0
+        } else {
+            puts "Unknown sorted set encoding"
+            exit
+        }
+
+        test "Check encoding - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x
+            assert_encoding $encoding ztmp
+        }
+
+        test "ZSET basic ZADD and score update - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x
+            r zadd ztmp 20 y
+            r zadd ztmp 30 z
+            assert_equal {x y z} [r zrange ztmp 0 -1]
+
+            r zadd ztmp 1 y
+            assert_equal {y x z} [r zrange ztmp 0 -1]
+        }
+
+        test "ZSET element can't be set to NaN with ZADD - $encoding" {
+            assert_error "*not*float*" {r zadd myzset nan abc}
+        }
+
+        test "ZSET element can't be set to NaN with ZINCRBY - $encoding" {
+            assert_error "*not*float*" {r zadd myzset nan abc}
+        }
+
+        test "ZADD with options syntax error with incomplete pair - $encoding" {
+            r del ztmp
+            catch {r zadd ztmp xx 10 x 20} err
+            set err
+        } {ERR*}
+
+        test "ZADD XX option without key - $encoding" {
+            r del ztmp
+            assert {[r zadd ztmp xx 10 x] == 0}
+            assert {[r type ztmp] eq {none}}
+        }
+
+        test "ZADD XX existing key - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x
+            assert {[r zadd ztmp xx 20 y] == 0}
+            assert {[r zcard ztmp] == 1}
+        }
+
+        test "ZADD XX returns the number of elements actually added - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x
+            set retval [r zadd ztmp 10 x 20 y 30 z]
+            assert {$retval == 2}
+        }
+
+        test "ZADD XX updates existing elements score - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            r zadd ztmp xx 5 foo 11 x 21 y 40 zap
+            assert {[r zcard ztmp] == 3}
+            assert {[r zscore ztmp x] == 11}
+            assert {[r zscore ztmp y] == 21}
+        }
+
+        test "ZADD GT updates existing elements when new scores are greater - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp gt ch 5 foo 11 x 21 y 29 z] == 3}
+            assert {[r zcard ztmp] == 4}
+            assert {[r zscore ztmp x] == 11}
+            assert {[r zscore ztmp y] == 21}
+            assert {[r zscore ztmp z] == 30}
+        }
+
+        test "ZADD LT updates existing elements when new scores are lower - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp lt ch 5 foo 11 x 21 y 29 z] == 2}
+            assert {[r zcard ztmp] == 4}
+            assert {[r zscore ztmp x] == 10}
+            assert {[r zscore ztmp y] == 20}
+            assert {[r zscore ztmp z] == 29}
+        }
+
+        test "ZADD GT XX updates existing elements when new scores are greater and skips new elements - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp gt xx ch 5 foo 11 x 21 y 29 z] == 2}
+            assert {[r zcard ztmp] == 3}
+            assert {[r zscore ztmp x] == 11}
+            assert {[r zscore ztmp y] == 21}
+            assert {[r zscore ztmp z] == 30}
+        }
+
+        test "ZADD LT XX updates existing elements when new scores are lower and skips new elements - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp lt xx ch 5 foo 11 x 21 y 29 z] == 1}
+            assert {[r zcard ztmp] == 3}
+            assert {[r zscore ztmp x] == 10}
+            assert {[r zscore ztmp y] == 20}
+            assert {[r zscore ztmp z] == 29}
+        }
+
+        test "ZADD XX and NX are not compatible - $encoding" {
+            r del ztmp
+            catch {r zadd ztmp xx nx 10 x} err
+            set err
+        } {ERR*}
+
+        test "ZADD NX with non existing key - $encoding" {
+            r del ztmp
+            r zadd ztmp nx 10 x 20 y 30 z
+            assert {[r zcard ztmp] == 3}
+        }
+
+        test "ZADD NX only add new elements without updating old ones - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp nx 11 x 21 y 100 a 200 b] == 2}
+            assert {[r zscore ztmp x] == 10}
+            assert {[r zscore ztmp y] == 20}
+            assert {[r zscore ztmp a] == 100}
+            assert {[r zscore ztmp b] == 200}
+        }
+
+        test "ZADD GT and NX are not compatible - $encoding" {
+            r del ztmp
+            catch {r zadd ztmp gt nx 10 x} err
+            set err
+        } {ERR*}
+
+        test "ZADD LT and NX are not compatible - $encoding" {
+            r del ztmp
+            catch {r zadd ztmp lt nx 10 x} err
+            set err
+        } {ERR*}
+
+        test "ZADD LT and GT are not compatible - $encoding" {
+            r del ztmp
+            catch {r zadd ztmp lt gt 10 x} err
+            set err
+        } {ERR*}
+
+        test "ZADD INCR LT/GT replies with nill if score not updated - $encoding" {
+            r del ztmp
+            r zadd ztmp 28 x
+            assert {[r zadd ztmp lt incr 1 x] eq {}}
+            assert {[r zscore ztmp x] == 28}
+            assert {[r zadd ztmp gt incr -1 x] eq {}}
+            assert {[r zscore ztmp x] == 28}
+        }
+
+        test "ZADD INCR LT/GT with inf - $encoding" {
+            r del ztmp
+            r zadd ztmp +inf x -inf y
+
+            assert {[r zadd ztmp lt incr 1 x] eq {}}
+            assert {[r zscore ztmp x] == inf}
+            assert {[r zadd ztmp gt incr -1 x] eq {}}
+            assert {[r zscore ztmp x] == inf}
+            assert {[r zadd ztmp lt incr -1 x] eq {}}
+            assert {[r zscore ztmp x] == inf}
+            assert {[r zadd ztmp gt incr 1 x] eq {}}
+            assert {[r zscore ztmp x] == inf}
+
+            assert {[r zadd ztmp lt incr 1 y] eq {}}
+            assert {[r zscore ztmp y] == -inf}
+            assert {[r zadd ztmp gt incr -1 y] eq {}}
+            assert {[r zscore ztmp y] == -inf}
+            assert {[r zadd ztmp lt incr -1 y] eq {}}
+            assert {[r zscore ztmp y] == -inf}
+            assert {[r zadd ztmp gt incr 1 y] eq {}}
+            assert {[r zscore ztmp y] == -inf}
+        }
+
+        test "ZADD INCR works like ZINCRBY - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            r zadd ztmp INCR 15 x
+            assert {[r zscore ztmp x] == 25}
+        }
+
+        test "ZADD INCR works with a single score-elemenet pair - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            catch {r zadd ztmp INCR 15 x 10 y} err
+            set err
+        } {ERR*}
+
+        test "ZADD CH option changes return value to all changed elements - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x 20 y 30 z
+            assert {[r zadd ztmp 11 x 21 y 30 z] == 0}
+            assert {[r zadd ztmp ch 12 x 22 y 30 z] == 2}
+        }
+
+        test "ZINCRBY calls leading to NaN result in error - $encoding" {
+            r zincrby myzset +inf abc
+            assert_error "*NaN*" {r zincrby myzset -inf abc}
+        }
+
+        test {ZADD - Variadic version base case - $encoding} {
+            r del myzset
+            list [r zadd myzset 10 a 20 b 30 c] [r zrange myzset 0 -1 withscores]
+        } {3 {a 10 b 20 c 30}}
+
+        test {ZADD - Return value is the number of actually added items - $encoding} {
+            list [r zadd myzset 5 x 20 b 30 c] [r zrange myzset 0 -1 withscores]
+        } {1 {x 5 a 10 b 20 c 30}}
+
+        test {ZADD - Variadic version does not add nothing on single parsing err - $encoding} {
+            r del myzset
+            catch {r zadd myzset 10 a 20 b 30.badscore c} e
+            assert_match {*ERR*not*float*} $e
+            r exists myzset
+        } {0}
+
+        test {ZADD - Variadic version will raise error on missing arg - $encoding} {
+            r del myzset
+            catch {r zadd myzset 10 a 20 b 30 c 40} e
+            assert_match {*ERR*syntax*} $e
+        }
+
+        test {ZINCRBY does not work variadic even if shares ZADD implementation - $encoding} {
+            r del myzset
+            catch {r zincrby myzset 10 a 20 b 30 c} e
+            assert_match {*ERR*wrong*number*arg*} $e
+        }
+
+        test "ZCARD basics - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 a 20 b 30 c
+            assert_equal 3 [r zcard ztmp]
+            assert_equal 0 [r zcard zdoesntexist]
+        }
+
+        test "ZREM removes key after last element is removed - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 x
+            r zadd ztmp 20 y
+
+            assert_equal 1 [r exists ztmp]
+            assert_equal 0 [r zrem ztmp z]
+            assert_equal 1 [r zrem ztmp y]
+            assert_equal 1 [r zrem ztmp x]
+            assert_equal 0 [r exists ztmp]
+        }
+
+        test "ZREM variadic version - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 a 20 b 30 c
+            assert_equal 2 [r zrem ztmp x y a b k]
+            assert_equal 0 [r zrem ztmp foo bar]
+            assert_equal 1 [r zrem ztmp c]
+            r exists ztmp
+        } {0}
+
+        test "ZREM variadic version -- remove elements after key deletion - $encoding" {
+            r del ztmp
+            r zadd ztmp 10 a 20 b 30 c
+            r zrem ztmp a b c d e f g
+        } {3}
+
+        test "ZRANGE basics - $encoding" {
+            r del ztmp
+            r zadd ztmp 1 a
+            r zadd ztmp 2 b
+            r zadd ztmp 3 c
+            r zadd ztmp 4 d
+
+            assert_equal {a b c d} [r zrange ztmp 0 -1]
+            assert_equal {a b c} [r zrange ztmp 0 -2]
+            assert_equal {b c d} [r zrange ztmp 1 -1]
+            assert_equal {b c} [r zrange ztmp 1 -2]
+            assert_equal {c d} [r zrange ztmp -2 -1]
+            assert_equal {c} [r zrange ztmp -2 -2]
+
+            # out of range start index
+            assert_equal {a b c} [r zrange ztmp -5 2]
+            assert_equal {a b} [r zrange ztmp -5 1]
+            assert_equal {} [r zrange ztmp 5 -1]
+            assert_equal {} [r zrange ztmp 5 -2]
+
+            # out of range end index
+            assert_equal {a b c d} [r zrange ztmp 0 5]
+            assert_equal {b c d} [r zrange ztmp 1 5]
+            assert_equal {} [r zrange ztmp 0 -5]
+            assert_equal {} [r zrange ztmp 1 -5]
+
+            # withscores
+            assert_equal {a 1 b 2 c 3 d 4} [r zrange ztmp 0 -1 withscores]
+        }
+
+        test "ZREVRANGE basics - $encoding" {
+            r del ztmp
+            r zadd ztmp 1 a
+            r zadd ztmp 2 b
+            r zadd ztmp 3 c
+            r zadd ztmp 4 d
+
+            assert_equal {d c b a} [r zrevrange ztmp 0 -1]
+            assert_equal {d c b} [r zrevrange ztmp 0 -2]
+            assert_equal {c b a} [r zrevrange ztmp 1 -1]
+            assert_equal {c b} [r zrevrange ztmp 1 -2]
+            assert_equal {b a} [r zrevrange ztmp -2 -1]
+            assert_equal {b} [r zrevrange ztmp -2 -2]
+
+            # out of range start index
+            assert_equal {d c b} [r zrevrange ztmp -5 2]
+            assert_equal {d c} [r zrevrange ztmp -5 1]
+            assert_equal {} [r zrevrange ztmp 5 -1]
+            assert_equal {} [r zrevrange ztmp 5 -2]
+
+            # out of range end index
+            assert_equal {d c b a} [r zrevrange ztmp 0 5]
+            assert_equal {c b a} [r zrevrange ztmp 1 5]
+            assert_equal {} [r zrevrange ztmp 0 -5]
+            assert_equal {} [r zrevrange ztmp 1 -5]
+
+            # withscores
+            assert_equal {d 4 c 3 b 2 a 1} [r zrevrange ztmp 0 -1 withscores]
+        }
+
+        test "ZRANK/ZREVRANK basics - $encoding" {
+            r del zranktmp
+            r zadd zranktmp 10 x
+            r zadd zranktmp 20 y
+            r zadd zranktmp 30 z
+            assert_equal 0 [r zrank zranktmp x]
+            assert_equal 1 [r zrank zranktmp y]
+            assert_equal 2 [r zrank zranktmp z]
+            assert_equal "" [r zrank zranktmp foo]
+            assert_equal 2 [r zrevrank zranktmp x]
+            assert_equal 1 [r zrevrank zranktmp y]
+            assert_equal 0 [r zrevrank zranktmp z]
+            assert_equal "" [r zrevrank zranktmp foo]
+        }
+
+        test "ZRANK - after deletion - $encoding" {
+            r zrem zranktmp y
+            assert_equal 0 [r zrank zranktmp x]
+            assert_equal 1 [r zrank zranktmp z]
+        }
+
+        test "ZINCRBY - can create a new sorted set - $encoding" {
+            r del zset
+            r zincrby zset 1 foo
+            assert_equal {foo} [r zrange zset 0 -1]
+            assert_equal 1 [r zscore zset foo]
+        }
+
+        test "ZINCRBY - increment and decrement - $encoding" {
+            r zincrby zset 2 foo
+            r zincrby zset 1 bar
+            assert_equal {bar foo} [r zrange zset 0 -1]
+
+            r zincrby zset 10 bar
+            r zincrby zset -5 foo
+            r zincrby zset -5 bar
+            assert_equal {foo bar} [r zrange zset 0 -1]
+
+            assert_equal -2 [r zscore zset foo]
+            assert_equal  6 [r zscore zset bar]
+        }
+
+        test "ZINCRBY return value - $encoding" {
+            r del ztmp
+            set retval [r zincrby ztmp 1.0 x]
+            assert {$retval == 1.0}
+        }
+
+        proc create_default_zset {} {
+            create_zset zset {-inf a 1 b 2 c 3 d 4 e 5 f +inf g}
+        }
+
+        test "ZRANGEBYSCORE/ZREVRANGEBYSCORE/ZCOUNT basics - $encoding" {
+            create_default_zset
+
+            # inclusive range
+            assert_equal {a b c} [r zrangebyscore zset -inf 2]
+            assert_equal {b c d} [r zrangebyscore zset 0 3]
+            assert_equal {d e f} [r zrangebyscore zset 3 6]
+            assert_equal {e f g} [r zrangebyscore zset 4 +inf]
+            assert_equal {c b a} [r zrevrangebyscore zset 2 -inf]
+            assert_equal {d c b} [r zrevrangebyscore zset 3 0]
+            assert_equal {f e d} [r zrevrangebyscore zset 6 3]
+            assert_equal {g f e} [r zrevrangebyscore zset +inf 4]
+            assert_equal 3 [r zcount zset 0 3]
+
+            # exclusive range
+            assert_equal {b}   [r zrangebyscore zset (-inf (2]
+            assert_equal {b c} [r zrangebyscore zset (0 (3]
+            assert_equal {e f} [r zrangebyscore zset (3 (6]
+            assert_equal {f}   [r zrangebyscore zset (4 (+inf]
+            assert_equal {b}   [r zrevrangebyscore zset (2 (-inf]
+            assert_equal {c b} [r zrevrangebyscore zset (3 (0]
+            assert_equal {f e} [r zrevrangebyscore zset (6 (3]
+            assert_equal {f}   [r zrevrangebyscore zset (+inf (4]
+            assert_equal 2 [r zcount zset (0 (3]
+
+            # test empty ranges
+            r zrem zset a
+            r zrem zset g
+
+            # inclusive
+            assert_equal {} [r zrangebyscore zset 4 2]
+            assert_equal {} [r zrangebyscore zset 6 +inf]
+            assert_equal {} [r zrangebyscore zset -inf -6]
+            assert_equal {} [r zrevrangebyscore zset +inf 6]
+            assert_equal {} [r zrevrangebyscore zset -6 -inf]
+
+            # exclusive
+            assert_equal {} [r zrangebyscore zset (4 (2]
+            assert_equal {} [r zrangebyscore zset 2 (2]
+            assert_equal {} [r zrangebyscore zset (2 2]
+            assert_equal {} [r zrangebyscore zset (6 (+inf]
+            assert_equal {} [r zrangebyscore zset (-inf (-6]
+            assert_equal {} [r zrevrangebyscore zset (+inf (6]
+            assert_equal {} [r zrevrangebyscore zset (-6 (-inf]
+
+            # empty inner range
+            assert_equal {} [r zrangebyscore zset 2.4 2.6]
+            assert_equal {} [r zrangebyscore zset (2.4 2.6]
+            assert_equal {} [r zrangebyscore zset 2.4 (2.6]
+            assert_equal {} [r zrangebyscore zset (2.4 (2.6]
+        }
+
+        test "ZRANGEBYSCORE with WITHSCORES - $encoding" {
+            create_default_zset
+            assert_equal {b 1 c 2 d 3} [r zrangebyscore zset 0 3 withscores]
+            assert_equal {d 3 c 2 b 1} [r zrevrangebyscore zset 3 0 withscores]
+        }
+
+        test "ZRANGEBYSCORE with LIMIT - $encoding" {
+            create_default_zset
+            assert_equal {b c}   [r zrangebyscore zset 0 10 LIMIT 0 2]
+            assert_equal {d e f} [r zrangebyscore zset 0 10 LIMIT 2 3]
+            assert_equal {d e f} [r zrangebyscore zset 0 10 LIMIT 2 10]
+            assert_equal {}      [r zrangebyscore zset 0 10 LIMIT 20 10]
+            assert_equal {f e}   [r zrevrangebyscore zset 10 0 LIMIT 0 2]
+            assert_equal {d c b} [r zrevrangebyscore zset 10 0 LIMIT 2 3]
+            assert_equal {d c b} [r zrevrangebyscore zset 10 0 LIMIT 2 10]
+            assert_equal {}      [r zrevrangebyscore zset 10 0 LIMIT 20 10]
+        }
+
+        test "ZRANGEBYSCORE with LIMIT and WITHSCORES - $encoding" {
+            create_default_zset
+            assert_equal {e 4 f 5} [r zrangebyscore zset 2 5 LIMIT 2 3 WITHSCORES]
+            assert_equal {d 3 c 2} [r zrevrangebyscore zset 5 2 LIMIT 2 3 WITHSCORES]
+            assert_equal {} [r zrangebyscore zset 2 5 LIMIT 12 13 WITHSCORES]
+        }
+
+        test "ZRANGEBYSCORE with non-value min or max - $encoding" {
+            assert_error "*not*float*" {r zrangebyscore fooz str 1}
+            assert_error "*not*float*" {r zrangebyscore fooz 1 str}
+            assert_error "*not*float*" {r zrangebyscore fooz 1 NaN}
+        }
+
+        proc create_default_lex_zset {} {
+            create_zset zset {0 alpha 0 bar 0 cool 0 down
+                              0 elephant 0 foo 0 great 0 hill
+                              0 omega}
+        }
+
+        test "ZRANGEBYLEX/ZREVRANGEBYLEX/ZLEXCOUNT basics - $encoding" {
+            create_default_lex_zset
+
+            # inclusive range
+            assert_equal {alpha bar cool} [r zrangebylex zset - \[cool]
+            assert_equal {bar cool down} [r zrangebylex zset \[bar \[down]
+            assert_equal {great hill omega} [r zrangebylex zset \[g +]
+            assert_equal {cool bar alpha} [r zrevrangebylex zset \[cool -]
+            assert_equal {down cool bar} [r zrevrangebylex zset \[down \[bar]
+            assert_equal {omega hill great foo elephant down} [r zrevrangebylex zset + \[d]
+            assert_equal 3 [r zlexcount zset \[ele \[h]
+
+            # exclusive range
+            assert_equal {alpha bar} [r zrangebylex zset - (cool]
+            assert_equal {cool} [r zrangebylex zset (bar (down]
+            assert_equal {hill omega} [r zrangebylex zset (great +]
+            assert_equal {bar alpha} [r zrevrangebylex zset (cool -]
+            assert_equal {cool} [r zrevrangebylex zset (down (bar]
+            assert_equal {omega hill} [r zrevrangebylex zset + (great]
+            assert_equal 2 [r zlexcount zset (ele (great]
+
+            # inclusive and exclusive
+            assert_equal {} [r zrangebylex zset (az (b]
+            assert_equal {} [r zrangebylex zset (z +]
+            assert_equal {} [r zrangebylex zset - \[aaaa]
+            assert_equal {} [r zrevrangebylex zset \[elez \[elex]
+            assert_equal {} [r zrevrangebylex zset (hill (omega]
+        }
+        
+        test "ZLEXCOUNT advanced - $encoding" {
+            create_default_lex_zset
+    
+            assert_equal 9 [r zlexcount zset - +]
+            assert_equal 0 [r zlexcount zset + -]
+            assert_equal 0 [r zlexcount zset + \[c]
+            assert_equal 0 [r zlexcount zset \[c -]
+            assert_equal 8 [r zlexcount zset \[bar +]
+            assert_equal 5 [r zlexcount zset \[bar \[foo]
+            assert_equal 4 [r zlexcount zset \[bar (foo]
+            assert_equal 4 [r zlexcount zset (bar \[foo]
+            assert_equal 3 [r zlexcount zset (bar (foo]
+            assert_equal 5 [r zlexcount zset - (foo]
+            assert_equal 1 [r zlexcount zset (maxstring +]
+        }
+
+        test "ZRANGEBYSLEX with LIMIT - $encoding" {
+            create_default_lex_zset
+            assert_equal {alpha bar} [r zrangebylex zset - \[cool LIMIT 0 2]
+            assert_equal {bar cool} [r zrangebylex zset - \[cool LIMIT 1 2]
+            assert_equal {} [r zrangebylex zset \[bar \[down LIMIT 0 0]
+            assert_equal {} [r zrangebylex zset \[bar \[down LIMIT 2 0]
+            assert_equal {bar} [r zrangebylex zset \[bar \[down LIMIT 0 1]
+            assert_equal {cool} [r zrangebylex zset \[bar \[down LIMIT 1 1]
+            assert_equal {bar cool down} [r zrangebylex zset \[bar \[down LIMIT 0 100]
+            assert_equal {omega hill great foo elephant} [r zrevrangebylex zset + \[d LIMIT 0 5]
+            assert_equal {omega hill great foo} [r zrevrangebylex zset + \[d LIMIT 0 4]
+        }
+
+        test "ZRANGEBYLEX with invalid lex range specifiers - $encoding" {
+            assert_error "*not*string*" {r zrangebylex fooz foo bar}
+            assert_error "*not*string*" {r zrangebylex fooz \[foo bar}
+            assert_error "*not*string*" {r zrangebylex fooz foo \[bar}
+            assert_error "*not*string*" {r zrangebylex fooz +x \[bar}
+            assert_error "*not*string*" {r zrangebylex fooz -x \[bar}
+        }
+
+        test "ZREMRANGEBYSCORE basics - $encoding" {
+            proc remrangebyscore {min max} {
+                create_zset zset {1 a 2 b 3 c 4 d 5 e}
+                assert_equal 1 [r exists zset]
+                r zremrangebyscore zset $min $max
+            }
+
+            # inner range
+            assert_equal 3 [remrangebyscore 2 4]
+            assert_equal {a e} [r zrange zset 0 -1]
+
+            # start underflow
+            assert_equal 1 [remrangebyscore -10 1]
+            assert_equal {b c d e} [r zrange zset 0 -1]
+
+            # end overflow
+            assert_equal 1 [remrangebyscore 5 10]
+            assert_equal {a b c d} [r zrange zset 0 -1]
+
+            # switch min and max
+            assert_equal 0 [remrangebyscore 4 2]
+            assert_equal {a b c d e} [r zrange zset 0 -1]
+
+            # -inf to mid
+            assert_equal 3 [remrangebyscore -inf 3]
+            assert_equal {d e} [r zrange zset 0 -1]
+
+            # mid to +inf
+            assert_equal 3 [remrangebyscore 3 +inf]
+            assert_equal {a b} [r zrange zset 0 -1]
+
+            # -inf to +inf
+            assert_equal 5 [remrangebyscore -inf +inf]
+            assert_equal {} [r zrange zset 0 -1]
+
+            # exclusive min
+            assert_equal 4 [remrangebyscore (1 5]
+            assert_equal {a} [r zrange zset 0 -1]
+            assert_equal 3 [remrangebyscore (2 5]
+            assert_equal {a b} [r zrange zset 0 -1]
+
+            # exclusive max
+            assert_equal 4 [remrangebyscore 1 (5]
+            assert_equal {e} [r zrange zset 0 -1]
+            assert_equal 3 [remrangebyscore 1 (4]
+            assert_equal {d e} [r zrange zset 0 -1]
+
+            # exclusive min and max
+            assert_equal 3 [remrangebyscore (1 (5]
+            assert_equal {a e} [r zrange zset 0 -1]
+
+            # destroy when empty
+            assert_equal 5 [remrangebyscore 1 5]
+            assert_equal 0 [r exists zset]
+        }
+
+        test "ZREMRANGEBYSCORE with non-value min or max - $encoding" {
+            assert_error "*not*float*" {r zremrangebyscore fooz str 1}
+            assert_error "*not*float*" {r zremrangebyscore fooz 1 str}
+            assert_error "*not*float*" {r zremrangebyscore fooz 1 NaN}
+        }
+
+        test "ZREMRANGEBYRANK basics - $encoding" {
+            proc remrangebyrank {min max} {
+                create_zset zset {1 a 2 b 3 c 4 d 5 e}
+                assert_equal 1 [r exists zset]
+                r zremrangebyrank zset $min $max
+            }
+
+            # inner range
+            assert_equal 3 [remrangebyrank 1 3]
+            assert_equal {a e} [r zrange zset 0 -1]
+
+            # start underflow
+            assert_equal 1 [remrangebyrank -10 0]
+            assert_equal {b c d e} [r zrange zset 0 -1]
+
+            # start overflow
+            assert_equal 0 [remrangebyrank 10 -1]
+            assert_equal {a b c d e} [r zrange zset 0 -1]
+
+            # end underflow
+            assert_equal 0 [remrangebyrank 0 -10]
+            assert_equal {a b c d e} [r zrange zset 0 -1]
+
+            # end overflow
+            assert_equal 5 [remrangebyrank 0 10]
+            assert_equal {} [r zrange zset 0 -1]
+
+            # destroy when empty
+            assert_equal 5 [remrangebyrank 0 4]
+            assert_equal 0 [r exists zset]
+        }
+
+        test "ZUNIONSTORE against non-existing key doesn't set destination - $encoding" {
+            r del zseta
+            assert_equal 0 [r zunionstore dst_key 1 zseta]
+            assert_equal 0 [r exists dst_key]
+        }
+
+        test "ZUNION/ZINTER/ZDIFF against non-existing key - $encoding" {
+            r del zseta
+            assert_equal {} [r zunion 1 zseta]
+            assert_equal {} [r zinter 1 zseta]
+            assert_equal {} [r zdiff 1 zseta]
+        }
+
+        test "ZUNIONSTORE with empty set - $encoding" {
+            r del zseta zsetb
+            r zadd zseta 1 a
+            r zadd zseta 2 b
+            r zunionstore zsetc 2 zseta zsetb
+            r zrange zsetc 0 -1 withscores
+        } {a 1 b 2}
+
+        test "ZUNION/ZINTER/ZDIFF with empty set - $encoding" {
+            r del zseta zsetb
+            r zadd zseta 1 a
+            r zadd zseta 2 b
+            assert_equal {a 1 b 2} [r zunion 2 zseta zsetb withscores]
+            assert_equal {} [r zinter 2 zseta zsetb withscores]
+            assert_equal {a 1 b 2} [r zdiff 2 zseta zsetb withscores]
+        }
+
+        test "ZUNIONSTORE basics - $encoding" {
+            r del zseta zsetb zsetc
+            r zadd zseta 1 a
+            r zadd zseta 2 b
+            r zadd zseta 3 c
+            r zadd zsetb 1 b
+            r zadd zsetb 2 c
+            r zadd zsetb 3 d
+
+            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb]
+            assert_equal {a 1 b 3 d 3 c 5} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZUNION/ZINTER/ZDIFF with integer members - $encoding" {
+            r del zsetd zsetf
+            r zadd zsetd 1 1
+            r zadd zsetd 2 2
+            r zadd zsetd 3 3
+            r zadd zsetf 1 1
+            r zadd zsetf 3 3
+            r zadd zsetf 4 4
+
+            assert_equal {1 2 2 2 4 4 3 6} [r zunion 2 zsetd zsetf withscores]
+            assert_equal {1 2 3 6} [r zinter 2 zsetd zsetf withscores]
+            assert_equal {2 2} [r zdiff 2 zsetd zsetf withscores]
+        }
+
+        test "ZUNIONSTORE with weights - $encoding" {
+            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb weights 2 3]
+            assert_equal {a 2 b 7 d 9 c 12} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZUNION with weights - $encoding" {
+            assert_equal {a 2 b 7 d 9 c 12} [r zunion 2 zseta zsetb weights 2 3 withscores]
+            assert_equal {b 7 c 12} [r zinter 2 zseta zsetb weights 2 3 withscores]
+        }
+
+        test "ZUNIONSTORE with a regular set and weights - $encoding" {
+            r del seta
+            r sadd seta a
+            r sadd seta b
+            r sadd seta c
+
+            assert_equal 4 [r zunionstore zsetc 2 seta zsetb weights 2 3]
+            assert_equal {a 2 b 5 c 8 d 9} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZUNIONSTORE with AGGREGATE MIN - $encoding" {
+            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb aggregate min]
+            assert_equal {a 1 b 1 c 2 d 3} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZUNION/ZINTER with AGGREGATE MIN - $encoding" {
+            assert_equal {a 1 b 1 c 2 d 3} [r zunion 2 zseta zsetb aggregate min withscores]
+            assert_equal {b 1 c 2} [r zinter 2 zseta zsetb aggregate min withscores]
+        }
+
+        test "ZUNIONSTORE with AGGREGATE MAX - $encoding" {
+            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb aggregate max]
+            assert_equal {a 1 b 2 c 3 d 3} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZUNION/ZINTER with AGGREGATE MAX - $encoding" {
+            assert_equal {a 1 b 2 c 3 d 3} [r zunion 2 zseta zsetb aggregate max withscores]
+            assert_equal {b 2 c 3} [r zinter 2 zseta zsetb aggregate max withscores]
+        }
+
+        test "ZINTERSTORE basics - $encoding" {
+            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb]
+            assert_equal {b 3 c 5} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZINTER basics - $encoding" {
+            assert_equal {b 3 c 5} [r zinter 2 zseta zsetb withscores]
+        }
+
+        test "ZINTER RESP3 - $encoding" {
+            r hello 3
+            assert_equal {{b 3.0} {c 5.0}} [r zinter 2 zseta zsetb withscores]
+        }
+        r hello 2
+
+        test "ZINTERSTORE with weights - $encoding" {
+            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb weights 2 3]
+            assert_equal {b 7 c 12} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZINTER with weights - $encoding" {
+            assert_equal {b 7 c 12} [r zinter 2 zseta zsetb weights 2 3 withscores]
+        }
+
+        test "ZINTERSTORE with a regular set and weights - $encoding" {
+            r del seta
+            r sadd seta a
+            r sadd seta b
+            r sadd seta c
+            assert_equal 2 [r zinterstore zsetc 2 seta zsetb weights 2 3]
+            assert_equal {b 5 c 8} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZINTERSTORE with AGGREGATE MIN - $encoding" {
+            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb aggregate min]
+            assert_equal {b 1 c 2} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZINTERSTORE with AGGREGATE MAX - $encoding" {
+            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb aggregate max]
+            assert_equal {b 2 c 3} [r zrange zsetc 0 -1 withscores]
+        }
+
+        foreach cmd {ZUNIONSTORE ZINTERSTORE} {
+            test "$cmd with +inf/-inf scores - $encoding" {
+                r del zsetinf1 zsetinf2
+
+                r zadd zsetinf1 +inf key
+                r zadd zsetinf2 +inf key
+                r $cmd zsetinf3 2 zsetinf1 zsetinf2
+                assert_equal inf [r zscore zsetinf3 key]
+
+                r zadd zsetinf1 -inf key
+                r zadd zsetinf2 +inf key
+                r $cmd zsetinf3 2 zsetinf1 zsetinf2
+                assert_equal 0 [r zscore zsetinf3 key]
+
+                r zadd zsetinf1 +inf key
+                r zadd zsetinf2 -inf key
+                r $cmd zsetinf3 2 zsetinf1 zsetinf2
+                assert_equal 0 [r zscore zsetinf3 key]
+
+                r zadd zsetinf1 -inf key
+                r zadd zsetinf2 -inf key
+                r $cmd zsetinf3 2 zsetinf1 zsetinf2
+                assert_equal -inf [r zscore zsetinf3 key]
+            }
+
+            test "$cmd with NaN weights - $encoding" {
+                r del zsetinf1 zsetinf2
+
+                r zadd zsetinf1 1.0 key
+                r zadd zsetinf2 1.0 key
+                assert_error "*weight*not*float*" {
+                    r $cmd zsetinf3 2 zsetinf1 zsetinf2 weights nan nan
+                }
+            }
+        }
+
+        test "ZDIFFSTORE basics - $encoding" {
+            assert_equal 1 [r zdiffstore zsetc 2 zseta zsetb]
+            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZDIFF basics - $encoding" {
+            assert_equal {a 1} [r zdiff 2 zseta zsetb withscores]
+        }
+
+        test "ZDIFFSTORE with a regular set - $encoding" {
+            r del seta
+            r sadd seta a
+            r sadd seta b
+            r sadd seta c
+            assert_equal 1 [r zdiffstore zsetc 2 seta zsetb]
+            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZDIFF subtracting set from itself - $encoding" {
+            assert_equal 0 [r zdiffstore zsetc 2 zseta zseta]
+            assert_equal {} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZDIFF algorithm 1 - $encoding" {
+            r del zseta zsetb zsetc
+            r zadd zseta 1 a
+            r zadd zseta 2 b
+            r zadd zseta 3 c
+            r zadd zsetb 1 b
+            r zadd zsetb 2 c
+            r zadd zsetb 3 d
+            assert_equal 1 [r zdiffstore zsetc 2 zseta zsetb]
+            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
+        }
+
+        test "ZDIFF algorithm 2 - $encoding" {
+            r del zseta zsetb zsetc zsetd zsete
+            r zadd zseta 1 a
+            r zadd zseta 2 b
+            r zadd zseta 3 c
+            r zadd zseta 5 e
+            r zadd zsetb 1 b
+            r zadd zsetc 1 c
+            r zadd zsetd 1 d
+            assert_equal 2 [r zdiffstore zsete 4 zseta zsetb zsetc zsetd]
+            assert_equal {a 1 e 5} [r zrange zsete 0 -1 withscores]
+        }
+
+        test "ZDIFF fuzzing - $encoding" {
+            for {set j 0} {$j < 100} {incr j} {
+                unset -nocomplain s
+                array set s {}
+                set args {}
+                set num_sets [expr {[randomInt 10]+1}]
+                for {set i 0} {$i < $num_sets} {incr i} {
+                    set num_elements [randomInt 100]
+                    r del zset_$i
+                    lappend args zset_$i
+                    while {$num_elements} {
+                        set ele [randomValue]
+                        r zadd zset_$i [randomInt 100] $ele
+                        if {$i == 0} {
+                            set s($ele) x
+                        } else {
+                            unset -nocomplain s($ele)
+                        }
+                        incr num_elements -1
+                    }
+                }
+                set result [lsort [r zdiff [llength $args] {*}$args]]
+                assert_equal $result [lsort [array names s]]
+            }
+        }
+
+        test "Basic ZPOP with a single key - $encoding" {
+            r del zset
+            assert_equal {} [r zpopmin zset]
+            create_zset zset {-1 a 1 b 2 c 3 d 4 e}
+            assert_equal {a -1} [r zpopmin zset]
+            assert_equal {b 1} [r zpopmin zset]
+            assert_equal {e 4} [r zpopmax zset]
+            assert_equal {d 3} [r zpopmax zset]
+            assert_equal {c 2} [r zpopmin zset]
+            assert_equal 0 [r exists zset]
+            r set foo bar
+            assert_error "*WRONGTYPE*" {r zpopmin foo}
+        }
+
+        test "ZPOP with count - $encoding" {
+            r del z1 z2 z3 foo
+            r set foo bar
+            assert_equal {} [r zpopmin z1 2]
+            assert_error "*WRONGTYPE*" {r zpopmin foo 2}
+            create_zset z1 {0 a 1 b 2 c 3 d}
+            assert_equal {a 0 b 1} [r zpopmin z1 2]
+            assert_equal {d 3 c 2} [r zpopmax z1 2]
+        }
+
+        test "BZPOP with a single existing sorted set - $encoding" {
+            set rd [redis_deferring_client]
+            create_zset zset {0 a 1 b 2 c}
+
+            $rd bzpopmin zset 5
+            assert_equal {zset a 0} [$rd read]
+            $rd bzpopmin zset 5
+            assert_equal {zset b 1} [$rd read]
+            $rd bzpopmax zset 5
+            assert_equal {zset c 2} [$rd read]
+            assert_equal 0 [r exists zset]
+        }
+
+        test "BZPOP with multiple existing sorted sets - $encoding" {
+            set rd [redis_deferring_client]
+            create_zset z1 {0 a 1 b 2 c}
+            create_zset z2 {3 d 4 e 5 f}
+
+            $rd bzpopmin z1 z2 5
+            assert_equal {z1 a 0} [$rd read]
+            $rd bzpopmax z1 z2 5
+            assert_equal {z1 c 2} [$rd read]
+            assert_equal 1 [r zcard z1]
+            assert_equal 3 [r zcard z2]
+
+            $rd bzpopmax z2 z1 5
+            assert_equal {z2 f 5} [$rd read]
+            $rd bzpopmin z2 z1 5
+            assert_equal {z2 d 3} [$rd read]
+            assert_equal 1 [r zcard z1]
+            assert_equal 1 [r zcard z2]
+        }
+
+        test "BZPOP second sorted set has members - $encoding" {
+            set rd [redis_deferring_client]
+            r del z1
+            create_zset z2 {3 d 4 e 5 f}
+            $rd bzpopmax z1 z2 5
+            assert_equal {z2 f 5} [$rd read]
+            $rd bzpopmin z2 z1 5
+            assert_equal {z2 d 3} [$rd read]
+            assert_equal 0 [r zcard z1]
+            assert_equal 1 [r zcard z2]
+        }
+
+        test "Basic ZPOP - $encoding RESP3" {
+            r hello 3
+            r del z1
+            create_zset z1 {0 a 1 b 2 c 3 d}
+            assert_equal {a 0.0} [r zpopmin z1]
+            assert_equal {d 3.0} [r zpopmax z1]
+            r hello 2
+        }
+
+        test "ZPOP with count - $encoding RESP3" {
+            r hello 3
+            r del z1
+            create_zset z1 {0 a 1 b 2 c 3 d}
+            assert_equal {{a 0.0} {b 1.0}} [r zpopmin z1 2]
+            assert_equal {{d 3.0} {c 2.0}} [r zpopmax z1 2]
+            r hello 2
+        }
+
+        test "BZPOP - $encoding RESP3" {
+            r hello 3
+            set rd [redis_deferring_client]
+            create_zset zset {0 a 1 b 2 c}
+
+            $rd bzpopmin zset 5
+            assert_equal {zset a 0} [$rd read]
+            $rd bzpopmin zset 5
+            assert_equal {zset b 1} [$rd read]
+            $rd bzpopmax zset 5
+            assert_equal {zset c 2} [$rd read]
+            assert_equal 0 [r exists zset]
+            r hello 2
+        }
+
+        r config set zset-max-ziplist-entries $original_max_entries
+        r config set zset-max-ziplist-value $original_max_value
+    }
+
+    basics ziplist
+    basics skiplist
+
+    test {ZINTERSTORE regression with two sets, intset+hashtable} {
+        r del seta setb setc
+        r sadd set1 a
+        r sadd set2 10
+        r zinterstore set3 2 set1 set2
+    } {0}
+
+    test {ZUNIONSTORE regression, should not create NaN in scores} {
+        r zadd z -inf neginf
+        r zunionstore out 1 z weights 0
+        r zrange out 0 -1 withscores
+    } {neginf 0}
+
+    test {ZINTERSTORE #516 regression, mixed sets and ziplist zsets} {
+        r sadd one 100 101 102 103
+        r sadd two 100 200 201 202
+        r zadd three 1 500 1 501 1 502 1 503 1 100
+        r zinterstore to_here 3 one two three WEIGHTS 0 0 1
+        r zrange to_here 0 -1
+    } {100}
+
+    test {ZUNIONSTORE result is sorted} {
+        # Create two sets with common and not common elements, perform
+        # the UNION, check that elements are still sorted.
+        r del one two dest
+        set cmd1 [list r zadd one]
+        set cmd2 [list r zadd two]
+        for {set j 0} {$j < 1000} {incr j} {
+            lappend cmd1 [expr rand()] [randomInt 1000]
+            lappend cmd2 [expr rand()] [randomInt 1000]
+        }
+        {*}$cmd1
+        {*}$cmd2
+        assert {[r zcard one] > 100}
+        assert {[r zcard two] > 100}
+        r zunionstore dest 2 one two
+        set oldscore 0
+        foreach {ele score} [r zrange dest 0 -1 withscores] {
+            assert {$score >= $oldscore}
+            set oldscore $score
+        }
+    }
+
+    test "ZUNIONSTORE/ZINTERSTORE/ZDIFFSTORE error if using WITHSCORES " {
+        assert_error "*ERR*syntax*" {r zunionstore foo 2 zsetd zsetf withscores}
+        assert_error "*ERR*syntax*" {r zinterstore foo 2 zsetd zsetf withscores}
+        assert_error "*ERR*syntax*" {r zdiffstore foo 2 zsetd zsetf withscores}
+    }
+    
+    test {ZMSCORE retrieve} {
+        r del zmscoretest
+        r zadd zmscoretest 10 x
+        r zadd zmscoretest 20 y
+        
+        r zmscore zmscoretest x y
+    } {10 20}
+
+    test {ZMSCORE retrieve from empty set} {
+        r del zmscoretest
+        
+        r zmscore zmscoretest x y
+    } {{} {}}
+    
+    test {ZMSCORE retrieve with missing member} {
+        r del zmscoretest
+        r zadd zmscoretest 10 x
+        
+        r zmscore zmscoretest x y
+    } {10 {}}
+
+    test {ZMSCORE retrieve single member} {
+        r del zmscoretest
+        r zadd zmscoretest 10 x
+        r zadd zmscoretest 20 y
+        
+        r zmscore zmscoretest x
+    } {10}
+
+    test {ZMSCORE retrieve requires one or more members} {
+        r del zmscoretest
+        r zadd zmscoretest 10 x
+        r zadd zmscoretest 20 y
+        
+        catch {r zmscore zmscoretest} e
+        assert_match {*ERR*wrong*number*arg*} $e
+    }
+
+    test "ZSET commands don't accept the empty strings as valid score" {
+        assert_error "*not*float*" {r zadd myzset "" abc}
+    }
+
+    proc stressers {encoding} {
+        set original_max_entries [lindex [r config get zset-max-ziplist-entries] 1]
+        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
+        if {$encoding == "ziplist"} {
+            # Little extra to allow proper fuzzing in the sorting stresser
+            r config set zset-max-ziplist-entries 256
+            r config set zset-max-ziplist-value 64
+            set elements 128
+        } elseif {$encoding == "skiplist"} {
+            r config set zset-max-ziplist-entries 0
+            r config set zset-max-ziplist-value 0
+            if {$::accurate} {set elements 1000} else {set elements 100}
+        } else {
+            puts "Unknown sorted set encoding"
+            exit
+        }
+
+        test "ZSCORE - $encoding" {
+            r del zscoretest
+            set aux {}
+            for {set i 0} {$i < $elements} {incr i} {
+                set score [expr rand()]
+                lappend aux $score
+                r zadd zscoretest $score $i
+            }
+
+            assert_encoding $encoding zscoretest
+            for {set i 0} {$i < $elements} {incr i} {
+                assert_equal [lindex $aux $i] [r zscore zscoretest $i]
+            }
+        }
+
+        test "ZMSCORE - $encoding" {
+            r del zscoretest
+            set aux {}
+            for {set i 0} {$i < $elements} {incr i} {
+                set score [expr rand()]
+                lappend aux $score
+                r zadd zscoretest $score $i
+            }
+
+            assert_encoding $encoding zscoretest
+            for {set i 0} {$i < $elements} {incr i} {
+                assert_equal [lindex $aux $i] [r zmscore zscoretest $i]
+            }
+        }
+
+        test "ZSCORE after a DEBUG RELOAD - $encoding" {
+            r del zscoretest
+            set aux {}
+            for {set i 0} {$i < $elements} {incr i} {
+                set score [expr rand()]
+                lappend aux $score
+                r zadd zscoretest $score $i
+            }
+
+            r debug reload
+            assert_encoding $encoding zscoretest
+            for {set i 0} {$i < $elements} {incr i} {
+                assert_equal [lindex $aux $i] [r zscore zscoretest $i]
+            }
+        }
+
+        test "ZSET sorting stresser - $encoding" {
+            set delta 0
+            for {set test 0} {$test < 2} {incr test} {
+                unset -nocomplain auxarray
+                array set auxarray {}
+                set auxlist {}
+                r del myzset
+                for {set i 0} {$i < $elements} {incr i} {
+                    if {$test == 0} {
+                        set score [expr rand()]
+                    } else {
+                        set score [expr int(rand()*10)]
+                    }
+                    set auxarray($i) $score
+                    r zadd myzset $score $i
+                    # Random update
+                    if {[expr rand()] < .2} {
+                        set j [expr int(rand()*1000)]
+                        if {$test == 0} {
+                            set score [expr rand()]
+                        } else {
+                            set score [expr int(rand()*10)]
+                        }
+                        set auxarray($j) $score
+                        r zadd myzset $score $j
+                    }
+                }
+                foreach {item score} [array get auxarray] {
+                    lappend auxlist [list $score $item]
+                }
+                set sorted [lsort -command zlistAlikeSort $auxlist]
+                set auxlist {}
+                foreach x $sorted {
+                    lappend auxlist [lindex $x 1]
+                }
+
+                assert_encoding $encoding myzset
+                set fromredis [r zrange myzset 0 -1]
+                set delta 0
+                for {set i 0} {$i < [llength $fromredis]} {incr i} {
+                    if {[lindex $fromredis $i] != [lindex $auxlist $i]} {
+                        incr delta
+                    }
+                }
+            }
+            assert_equal 0 $delta
+        }
+
+        test "ZRANGEBYSCORE fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
+            set err {}
+            r del zset
+            for {set i 0} {$i < $elements} {incr i} {
+                r zadd zset [expr rand()] $i
+            }
+
+            assert_encoding $encoding zset
+            for {set i 0} {$i < 100} {incr i} {
+                set min [expr rand()]
+                set max [expr rand()]
+                if {$min > $max} {
+                    set aux $min
+                    set min $max
+                    set max $aux
+                }
+                set low [r zrangebyscore zset -inf $min]
+                set ok [r zrangebyscore zset $min $max]
+                set high [r zrangebyscore zset $max +inf]
+                set lowx [r zrangebyscore zset -inf ($min]
+                set okx [r zrangebyscore zset ($min ($max]
+                set highx [r zrangebyscore zset ($max +inf]
+
+                if {[r zcount zset -inf $min] != [llength $low]} {
+                    append err "Error, len does not match zcount\n"
+                }
+                if {[r zcount zset $min $max] != [llength $ok]} {
+                    append err "Error, len does not match zcount\n"
+                }
+                if {[r zcount zset $max +inf] != [llength $high]} {
+                    append err "Error, len does not match zcount\n"
+                }
+                if {[r zcount zset -inf ($min] != [llength $lowx]} {
+                    append err "Error, len does not match zcount\n"
+                }
+                if {[r zcount zset ($min ($max] != [llength $okx]} {
+                    append err "Error, len does not match zcount\n"
+                }
+                if {[r zcount zset ($max +inf] != [llength $highx]} {
+                    append err "Error, len does not match zcount\n"
+                }
+
+                foreach x $low {
+                    set score [r zscore zset $x]
+                    if {$score > $min} {
+                        append err "Error, score for $x is $score > $min\n"
+                    }
+                }
+                foreach x $lowx {
+                    set score [r zscore zset $x]
+                    if {$score >= $min} {
+                        append err "Error, score for $x is $score >= $min\n"
+                    }
+                }
+                foreach x $ok {
+                    set score [r zscore zset $x]
+                    if {$score < $min || $score > $max} {
+                        append err "Error, score for $x is $score outside $min-$max range\n"
+                    }
+                }
+                foreach x $okx {
+                    set score [r zscore zset $x]
+                    if {$score <= $min || $score >= $max} {
+                        append err "Error, score for $x is $score outside $min-$max open range\n"
+                    }
+                }
+                foreach x $high {
+                    set score [r zscore zset $x]
+                    if {$score < $max} {
+                        append err "Error, score for $x is $score < $max\n"
+                    }
+                }
+                foreach x $highx {
+                    set score [r zscore zset $x]
+                    if {$score <= $max} {
+                        append err "Error, score for $x is $score <= $max\n"
+                    }
+                }
+            }
+            assert_equal {} $err
+        }
+
+        test "ZRANGEBYLEX fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
+            set lexset {}
+            r del zset
+            for {set j 0} {$j < $elements} {incr j} {
+                set e [randstring 0 30 alpha]
+                lappend lexset $e
+                r zadd zset 0 $e
+            }
+            set lexset [lsort -unique $lexset]
+            for {set j 0} {$j < 100} {incr j} {
+                set min [randstring 0 30 alpha]
+                set max [randstring 0 30 alpha]
+                set mininc [randomInt 2]
+                set maxinc [randomInt 2]
+                if {$mininc} {set cmin "\[$min"} else {set cmin "($min"}
+                if {$maxinc} {set cmax "\[$max"} else {set cmax "($max"}
+                set rev [randomInt 2]
+                if {$rev} {
+                    set cmd zrevrangebylex
+                } else {
+                    set cmd zrangebylex
+                }
+
+                # Make sure data is the same in both sides
+                assert {[r zrange zset 0 -1] eq $lexset}
+
+                # Get the Redis output
+                set output [r $cmd zset $cmin $cmax]
+                if {$rev} {
+                    set outlen [r zlexcount zset $cmax $cmin]
+                } else {
+                    set outlen [r zlexcount zset $cmin $cmax]
+                }
+
+                # Compute the same output via Tcl
+                set o {}
+                set copy $lexset
+                if {(!$rev && [string compare $min $max] > 0) ||
+                    ($rev && [string compare $max $min] > 0)} {
+                    # Empty output when ranges are inverted.
+                } else {
+                    if {$rev} {
+                        # Invert the Tcl array using Redis itself.
+                        set copy [r zrevrange zset 0 -1]
+                        # Invert min / max as well
+                        lassign [list $min $max $mininc $maxinc] \
+                            max min maxinc mininc
+                    }
+                    foreach e $copy {
+                        set mincmp [string compare $e $min]
+                        set maxcmp [string compare $e $max]
+                        if {
+                             ($mininc && $mincmp >= 0 || !$mininc && $mincmp > 0)
+                             &&
+                             ($maxinc && $maxcmp <= 0 || !$maxinc && $maxcmp < 0)
+                        } {
+                            lappend o $e
+                        }
+                    }
+                }
+                assert {$o eq $output}
+                assert {$outlen eq [llength $output]}
+            }
+        }
+
+        test "ZREMRANGEBYLEX fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
+            set lexset {}
+            r del zset zsetcopy
+            for {set j 0} {$j < $elements} {incr j} {
+                set e [randstring 0 30 alpha]
+                lappend lexset $e
+                r zadd zset 0 $e
+            }
+            set lexset [lsort -unique $lexset]
+            for {set j 0} {$j < 100} {incr j} {
+                # Copy...
+                r zunionstore zsetcopy 1 zset
+                set lexsetcopy $lexset
+
+                set min [randstring 0 30 alpha]
+                set max [randstring 0 30 alpha]
+                set mininc [randomInt 2]
+                set maxinc [randomInt 2]
+                if {$mininc} {set cmin "\[$min"} else {set cmin "($min"}
+                if {$maxinc} {set cmax "\[$max"} else {set cmax "($max"}
+
+                # Make sure data is the same in both sides
+                assert {[r zrange zset 0 -1] eq $lexset}
+
+                # Get the range we are going to remove
+                set torem [r zrangebylex zset $cmin $cmax]
+                set toremlen [r zlexcount zset $cmin $cmax]
+                r zremrangebylex zsetcopy $cmin $cmax
+                set output [r zrange zsetcopy 0 -1]
+
+                # Remove the range with Tcl from the original list
+                if {$toremlen} {
+                    set first [lsearch -exact $lexsetcopy [lindex $torem 0]]
+                    set last [expr {$first+$toremlen-1}]
+                    set lexsetcopy [lreplace $lexsetcopy $first $last]
+                }
+                assert {$lexsetcopy eq $output}
+            }
+        }
+
+        test "ZSETs skiplist implementation backlink consistency test - $encoding" {
+            set diff 0
+            for {set j 0} {$j < $elements} {incr j} {
+                r zadd myzset [expr rand()] "Element-$j"
+                r zrem myzset "Element-[expr int(rand()*$elements)]"
+            }
+
+            assert_encoding $encoding myzset
+            set l1 [r zrange myzset 0 -1]
+            set l2 [r zrevrange myzset 0 -1]
+            for {set j 0} {$j < [llength $l1]} {incr j} {
+                if {[lindex $l1 $j] ne [lindex $l2 end-$j]} {
+                    incr diff
+                }
+            }
+            assert_equal 0 $diff
+        }
+
+        test "ZSETs ZRANK augmented skip list stress testing - $encoding" {
+            set err {}
+            r del myzset
+            for {set k 0} {$k < 2000} {incr k} {
+                set i [expr {$k % $elements}]
+                if {[expr rand()] < .2} {
+                    r zrem myzset $i
+                } else {
+                    set score [expr rand()]
+                    r zadd myzset $score $i
+                    assert_encoding $encoding myzset
+                }
+
+                set card [r zcard myzset]
+                if {$card > 0} {
+                    set index [randomInt $card]
+                    set ele [lindex [r zrange myzset $index $index] 0]
+                    set rank [r zrank myzset $ele]
+                    if {$rank != $index} {
+                        set err "$ele RANK is wrong! ($rank != $index)"
+                        break
+                    }
+                }
+            }
+            assert_equal {} $err
+        }
+
+        test "BZPOPMIN, ZADD + DEL should not awake blocked client" {
+            set rd [redis_deferring_client]
+            r del zset
+
+            $rd bzpopmin zset 0
+            r multi
+            r zadd zset 0 foo
+            r del zset
+            r exec
+            r del zset
+            r zadd zset 1 bar
+            $rd read
+        } {zset bar 1}
+
+        test "BZPOPMIN, ZADD + DEL + SET should not awake blocked client" {
+            set rd [redis_deferring_client]
+            r del list
+
+            r del zset
+
+            $rd bzpopmin zset 0
+            r multi
+            r zadd zset 0 foo
+            r del zset
+            r set zset foo
+            r exec
+            r del zset
+            r zadd zset 1 bar
+            $rd read
+        } {zset bar 1}
+
+        test "BZPOPMIN with same key multiple times should work" {
+            set rd [redis_deferring_client]
+            r del z1 z2
+
+            # Data arriving after the BZPOPMIN.
+            $rd bzpopmin z1 z2 z2 z1 0
+            r zadd z1 0 a
+            assert_equal [$rd read] {z1 a 0}
+            $rd bzpopmin z1 z2 z2 z1 0
+            r zadd z2 1 b
+            assert_equal [$rd read] {z2 b 1}
+
+            # Data already there.
+            r zadd z1 0 a
+            r zadd z2 1 b
+            $rd bzpopmin z1 z2 z2 z1 0
+            assert_equal [$rd read] {z1 a 0}
+            $rd bzpopmin z1 z2 z2 z1 0
+            assert_equal [$rd read] {z2 b 1}
+        }
+
+        test "MULTI/EXEC is isolated from the point of view of BZPOPMIN" {
+            set rd [redis_deferring_client]
+            r del zset
+            $rd bzpopmin zset 0
+            r multi
+            r zadd zset 0 a
+            r zadd zset 1 b
+            r zadd zset 2 c
+            r exec
+            $rd read
+        } {zset a 0}
+
+        test "BZPOPMIN with variadic ZADD" {
+            set rd [redis_deferring_client]
+            r del zset
+            if {$::valgrind} {after 100}
+            $rd bzpopmin zset 0
+            if {$::valgrind} {after 100}
+            assert_equal 2 [r zadd zset -1 foo 1 bar]
+            if {$::valgrind} {after 100}
+            assert_equal {zset foo -1} [$rd read]
+            assert_equal {bar} [r zrange zset 0 -1]
+        }
+
+        test "BZPOPMIN with zero timeout should block indefinitely" {
+            set rd [redis_deferring_client]
+            r del zset
+            $rd bzpopmin zset 0
+            after 1000
+            r zadd zset 0 foo
+            assert_equal {zset foo 0} [$rd read]
+        }
+        r config set zset-max-ziplist-entries $original_max_entries
+        r config set zset-max-ziplist-value $original_max_value
+    }
+
+    tags {"slow"} {
+        stressers ziplist
+        stressers skiplist
+    }
+
+    test {ZSET skiplist order consistency when elements are moved} {
+        set original_max [lindex [r config get zset-max-ziplist-entries] 1]
+        r config set zset-max-ziplist-entries 0
+        for {set times 0} {$times < 10} {incr times} {
+            r del zset
+            for {set j 0} {$j < 1000} {incr j} {
+                r zadd zset [randomInt 50] ele-[randomInt 10]
+            }
+
+            # Make sure that element ordering is correct
+            set prev_element {}
+            set prev_score -1
+            foreach {element score} [r zrange zset 0 -1 WITHSCORES] {
+                # Assert that elements are in increasing ordering
+                assert {
+                    $prev_score < $score ||
+                    ($prev_score == $score &&
+                     [string compare $prev_element $element] == -1)
+                }
+                set prev_element $element
+                set prev_score $score
+            }
+        }
+        r config set zset-max-ziplist-entries $original_max
+    }
+
+    test {ZRANGESTORE basic} {
+        r flushall
+        r zadd z1 1 a 2 b 3 c 4 d
+        set res [r zrangestore z2 z1 0 -1]
+        assert_equal $res 4
+        r zrange z2 0 -1 withscores
+    } {a 1 b 2 c 3 d 4}
+
+    test {ZRANGESTORE RESP3} {
+        r hello 3
+        r zrange z2 0 -1 withscores
+    } {{a 1.0} {b 2.0} {c 3.0} {d 4.0}}
+    r hello 2
+
+    test {ZRANGESTORE range} {
+        set res [r zrangestore z2 z1 1 2]
+        assert_equal $res 2
+        r zrange z2 0 -1 withscores
+    } {b 2 c 3}
+
+    test {ZRANGESTORE BYLEX} {
+        set res [r zrangestore z2 z1 \[b \[c BYLEX]
+        assert_equal $res 2
+        r zrange z2 0 -1 withscores
+    } {b 2 c 3}
+
+    test {ZRANGESTORE BYSCORE} {
+        set res [r zrangestore z2 z1 1 2 BYSCORE]
+        assert_equal $res 2
+        r zrange z2 0 -1 withscores
+    } {a 1 b 2}
+
+    test {ZRANGESTORE BYSCORE LIMIT} {
+        set res [r zrangestore z2 z1 0 5 BYSCORE LIMIT 0 2]
+        assert_equal $res 2
+        r zrange z2 0 -1 withscores
+    } {a 1 b 2}
+
+    test {ZRANGESTORE BYSCORE REV LIMIT} {
+        set res [r zrangestore z2 z1 5 0 BYSCORE REV LIMIT 0 2]
+        assert_equal $res 2
+        r zrange z2 0 -1 withscores
+    } {c 3 d 4}
+
+    test {ZRANGE BYSCORE REV LIMIT} {
+        r zrange z1 5 0 BYSCORE REV LIMIT 0 2 WITHSCORES
+    } {d 4 c 3}
+
+    test {ZRANGESTORE - src key missing} {
+        set res [r zrangestore z2{t} missing{t} 0 -1]
+        assert_equal $res 0
+        r exists z2{t}
+    } {0}
+
+    test {ZRANGESTORE - src key wrong type} {
+        r zadd z2{t} 1 a
+        r set foo{t} bar
+        assert_error "*WRONGTYPE*" {r zrangestore z2{t} foo{t} 0 -1}
+        r zrange z2{t} 0 -1
+    } {a}
+
+    test {ZRANGESTORE - empty range} {
+        set res [r zrangestore z2 z1 5 6]
+        assert_equal $res 0
+        r exists z2
+    } {0}
+
+    test {ZRANGESTORE BYLEX - empty range} {
+        set res [r zrangestore z2 z1 \[f \[g BYLEX]
+        assert_equal $res 0
+        r exists z2
+    } {0}
+
+    test {ZRANGESTORE BYSCORE - empty range} {
+        set res [r zrangestore z2 z1 5 6 BYSCORE]
+        assert_equal $res 0
+        r exists z2
+    } {0}
+
+    test {ZRANGE BYLEX} {
+        r zrange z1 \[b \[c BYLEX
+    } {b c}
+
+    test {ZRANGESTORE invalid syntax} {
+        catch {r zrangestore z2 z1 0 -1 limit 1 2} err
+        assert_match "*syntax*" $err
+        catch {r zrangestore z2 z1 0 -1 WITHSCORES} err
+        assert_match "*syntax*" $err
+    }
+
+    test {ZRANGE invalid syntax} {
+        catch {r zrange z1 0 -1 limit 1 2} err
+        assert_match "*syntax*" $err
+        catch {r zrange z1 0 -1 BYLEX WITHSCORES} err
+        assert_match "*syntax*" $err
+        catch {r zrevrange z1 0 -1 BYSCORE} err
+        assert_match "*syntax*" $err
+        catch {r zrangebyscore z1 0 -1 REV} err
+        assert_match "*syntax*" $err
+    }
+
+    proc get_keys {l} {
+        set res {}
+        foreach {score key} $l {
+            lappend res $key
+        }
+        return $res
+    }
+
+    # Check whether the zset members belong to the zset
+    proc check_member {mydict res} {
+        foreach ele $res {
+            assert {[dict exists $mydict $ele]}
+        }
+    }
+
+    # Check whether the zset members and score belong to the zset
+    proc check_member_and_score {mydict res} {
+       foreach {key val} $res {
+            assert_equal $val [dict get $mydict $key]
+        }
+    }
+
+    foreach {type contents} "ziplist {1 a 2 b 3 c} skiplist {1 a 2 b 3 [randstring 70 90 alpha]}" {
+        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
+        r config set zset-max-ziplist-value 10
+        create_zset myzset $contents
+        assert_encoding $type myzset
+
+        test "ZRANDMEMBER - $type" {
+            unset -nocomplain myzset
+            array set myzset {}
+            for {set i 0} {$i < 100} {incr i} {
+                set key [r zrandmember myzset]
+                set myzset($key) 1
+            }
+            assert_equal [lsort [get_keys $contents]] [lsort [array names myzset]]
+        }
+        r config set zset-max-ziplist-value $original_max_value
+    }
+
+    test "ZRANDMEMBER with RESP3" {
+        r hello 3
+        set res [r zrandmember myzset 3 withscores]
+        assert_equal [llength $res] 3
+        assert_equal [llength [lindex $res 1]] 2
+
+        set res [r zrandmember myzset 3]
+        assert_equal [llength $res] 3
+        assert_equal [llength [lindex $res 1]] 1
+    }
+    r hello 2
+
+    test "ZRANDMEMBER count of 0 is handled correctly" {
+        r zrandmember myzset 0
+    } {}
+
+    test "ZRANDMEMBER with <count> against non existing key" {
+        r zrandmember nonexisting_key 100
+    } {}
+
+    # Make sure we can distinguish between an empty array and a null response
+    r readraw 1
+
+    test "ZRANDMEMBER count of 0 is handled correctly - emptyarray" {
+        r zrandmember myzset 0
+    } {*0}
+
+    test "ZRANDMEMBER with <count> against non existing key - emptyarray" {
+        r zrandmember nonexisting_key 100
+    } {*0}
+
+    r readraw 0
+
+    foreach {type contents} "
+        skiplist {1 a 2 b 3 c 4 d 5 e 6 f 7 g 7 h 9 i 10 [randstring 70 90 alpha]}
+        ziplist {1 a 2 b 3 c 4 d 5 e 6 f 7 g 7 h 9 i 10 j} " {
+        test "ZRANDMEMBER with <count> - $type" {
+            set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
+            r config set zset-max-ziplist-value 10
+            create_zset myzset $contents
+            assert_encoding $type myzset
+
+            # create a dict for easy lookup
+            unset -nocomplain mydict
+            foreach {k v} [r zrange myzset 0 -1 withscores] {
+                dict append mydict $k $v
+            }
+
+            # We'll stress different parts of the code, see the implementation
+            # of ZRANDMEMBER for more information, but basically there are
+            # four different code paths.
+
+            # PATH 1: Use negative count.
+
+            # 1) Check that it returns repeated elements with and without values.
+            # 2) Check that all the elements actually belong to the original zset.
+            set res [r zrandmember myzset -20]
+            assert_equal [llength $res] 20
+            check_member $mydict $res
+
+            set res [r zrandmember myzset -1001]
+            assert_equal [llength $res] 1001
+            check_member $mydict $res
+
+            # again with WITHSCORES
+            set res [r zrandmember myzset -20 withscores]
+            assert_equal [llength $res] 40
+            check_member_and_score $mydict $res
+
+            set res [r zrandmember myzset -1001 withscores]
+            assert_equal [llength $res] 2002
+            check_member_and_score $mydict $res
+
+            # Test random uniform distribution
+            # df = 9, 40 means 0.00001 probability
+            set res [r zrandmember myzset -1000]
+            assert_lessthan [chi_square_value $res] 40
+            check_member $mydict $res
+
+            # 3) Check that eventually all the elements are returned.
+            #    Use both WITHSCORES and without
+            unset -nocomplain auxset
+            set iterations 1000
+            while {$iterations != 0} {
+                incr iterations -1
+                if {[expr {$iterations % 2}] == 0} {
+                    set res [r zrandmember myzset -3 withscores]
+                    foreach {key val} $res {
+                        dict append auxset $key $val
+                    }
+                } else {
+                    set res [r zrandmember myzset -3]
+                    foreach key $res {
+                        dict append auxset $key
+                    }
+                }
+                if {[lsort [dict keys $mydict]] eq
+                    [lsort [dict keys $auxset]]} {
+                    break;
+                }
+            }
+            assert {$iterations != 0}
+
+            # PATH 2: positive count (unique behavior) with requested size
+            # equal or greater than set size.
+            foreach size {10 20} {
+                set res [r zrandmember myzset $size]
+                assert_equal [llength $res] 10
+                assert_equal [lsort $res] [lsort [dict keys $mydict]]
+                check_member $mydict $res
+
+                # again with WITHSCORES
+                set res [r zrandmember myzset $size withscores]
+                assert_equal [llength $res] 20
+                assert_equal [lsort $res] [lsort $mydict]
+                check_member_and_score $mydict $res
+            }
+
+            # PATH 3: Ask almost as elements as there are in the set.
+            # In this case the implementation will duplicate the original
+            # set and will remove random elements up to the requested size.
+            #
+            # PATH 4: Ask a number of elements definitely smaller than
+            # the set size.
+            #
+            # We can test both the code paths just changing the size but
+            # using the same code.
+            foreach size {1 2 8} {
+                # 1) Check that all the elements actually belong to the
+                # original set.
+                set res [r zrandmember myzset $size]
+                assert_equal [llength $res] $size
+                check_member $mydict $res
+
+                # again with WITHSCORES
+                set res [r zrandmember myzset $size withscores]
+                assert_equal [llength $res] [expr {$size * 2}]
+                check_member_and_score $mydict $res
+
+                # 2) Check that eventually all the elements are returned.
+                #    Use both WITHSCORES and without
+                unset -nocomplain auxset
+                unset -nocomplain allkey
+                set iterations [expr {1000 / $size}]
+                set all_ele_return false
+                while {$iterations != 0} {
+                    incr iterations -1
+                    if {[expr {$iterations % 2}] == 0} {
+                        set res [r zrandmember myzset $size withscores]
+                        foreach {key value} $res {
+                            dict append auxset $key $value
+                            lappend allkey $key
+                        }
+                    } else {
+                        set res [r zrandmember myzset $size]
+                        foreach key $res {
+                            dict append auxset $key
+                            lappend allkey $key
+                        }
+                    }
+                    if {[lsort [dict keys $mydict]] eq
+                        [lsort [dict keys $auxset]]} {
+                        set all_ele_return true
+                    }
+                }
+                assert_equal $all_ele_return true
+                # df = 9, 40 means 0.00001 probability
+                assert_lessthan [chi_square_value $allkey] 40
+            }
+        }
+        r config set zset-max-ziplist-value $original_max_value
+    }
+
+}
diff --git a/redis-stable/tests/unit/violations.tcl b/redis-stable/tests/unit/violations.tcl
new file mode 100644
index 00000000..1d3140c5
--- /dev/null
+++ b/redis-stable/tests/unit/violations.tcl
@@ -0,0 +1,156 @@
+# These tests consume massive amounts of memory, and are not
+# suitable to be executed as part of the normal test suite
+set ::str500 [string repeat x 500000000] ;# 500mb
+
+# Utility function to write big argument into redis client connection
+proc write_big_bulk {size} {
+    r write "\$$size\r\n"
+    while {$size >= 500000000} {
+        r write $::str500
+        incr size -500000000
+    }
+    if {$size > 0} {
+        r write [string repeat x $size]
+    }
+    r write "\r\n"
+}
+
+# One XADD with one huge 5GB field
+# Expected to fail resulting in an empty stream
+start_server [list overrides [list save ""] ] {
+    test {XADD one huge field} {
+        r config set proto-max-bulk-len 10000000000 ;#10gb
+        r config set client-query-buffer-limit 10000000000 ;#10gb
+        r write "*5\r\n\$4\r\nXADD\r\n\$2\r\nS1\r\n\$1\r\n*\r\n"
+        r write "\$1\r\nA\r\n"
+        write_big_bulk 5000000000 ;#5gb
+        r flush
+        catch {r read} err
+        assert_match {*too large*} $err
+        r xlen S1
+    } {0}
+}
+
+# One XADD with one huge (exactly nearly) 4GB field
+# This uncovers the overflow in lpEncodeGetType
+# Expected to fail resulting in an empty stream
+start_server [list overrides [list save ""] ] {
+    test {XADD one huge field - 1} {
+        r config set proto-max-bulk-len 10000000000 ;#10gb
+        r config set client-query-buffer-limit 10000000000 ;#10gb
+        r write "*5\r\n\$4\r\nXADD\r\n\$2\r\nS1\r\n\$1\r\n*\r\n"
+        r write "\$1\r\nA\r\n"
+        write_big_bulk 4294967295 ;#4gb-1
+        r flush
+        catch {r read} err
+        assert_match {*too large*} $err
+        r xlen S1
+    } {0}
+}
+
+# Gradually add big stream fields using repeated XADD calls
+start_server [list overrides [list save ""] ] {
+    test {several XADD big fields} {
+        r config set stream-node-max-bytes 0
+        for {set j 0} {$j<10} {incr j} {
+            r xadd stream * 1 $::str500 2 $::str500
+        }
+        r ping
+        r xlen stream
+    } {10}
+}
+
+# Add over 4GB to a single stream listpack (one XADD command)
+# Expected to fail resulting in an empty stream
+start_server [list overrides [list save ""] ] {
+    test {single XADD big fields} {
+        r write "*23\r\n\$4\r\nXADD\r\n\$1\r\nS\r\n\$1\r\n*\r\n"
+        for {set j 0} {$j<10} {incr j} {
+            r write "\$1\r\n$j\r\n"
+            write_big_bulk 500000000 ;#500mb
+        }
+        r flush
+        catch {r read} err
+        assert_match {*too large*} $err
+        r xlen S
+    } {0}
+}
+
+# Gradually add big hash fields using repeated HSET calls
+# This reproduces the overflow in the call to ziplistResize
+# Object will be converted to hashtable encoding
+start_server [list overrides [list save ""] ] {
+    r config set hash-max-ziplist-value 1000000000 ;#1gb
+    test {hash with many big fields} {
+        for {set j 0} {$j<10} {incr j} {
+            r hset h $j $::str500
+        }
+        r object encoding h
+    } {hashtable}
+}
+
+# Add over 4GB to a single hash field (one HSET command)
+# Object will be converted to hashtable encoding
+start_server [list overrides [list save ""] ] {
+    test {hash with one huge field} {
+        catch {r config set hash-max-ziplist-value 10000000000} ;#10gb
+        r config set proto-max-bulk-len 10000000000 ;#10gb
+        r config set client-query-buffer-limit 10000000000 ;#10gb
+        r write "*4\r\n\$4\r\nHSET\r\n\$2\r\nH1\r\n"
+        r write "\$1\r\nA\r\n"
+        write_big_bulk 5000000000 ;#5gb
+        r flush
+        r read
+        r object encoding H1
+    } {hashtable}
+}
+
+# Add over 4GB to a single list member (one LPUSH command)
+# Currently unsupported, and expected to fail rather than being truncated
+# Expected to fail resulting in a non-existing list
+start_server [list overrides [list save ""] ] {
+    test {list with one huge field} {
+        r config set proto-max-bulk-len 10000000000 ;#10gb
+        r config set client-query-buffer-limit 10000000000 ;#10gb
+        r write "*3\r\n\$5\r\nLPUSH\r\n\$2\r\nL1\r\n"
+        write_big_bulk 5000000000 ;#5gb
+        r flush
+        catch {r read} err
+        assert_match {*too large*} $err
+        r exists L1
+    } {0}
+}
+
+# SORT which attempts to store an element larger than 4GB into a list.
+# Currently unsupported and results in an assertion instead of truncation
+start_server [list overrides [list save ""] ] {
+    test {SORT adds huge field to list} {
+        r config set proto-max-bulk-len 10000000000 ;#10gb
+        r config set client-query-buffer-limit 10000000000 ;#10gb
+        r write "*3\r\n\$3\r\nSET\r\n\$2\r\nS1\r\n"
+        write_big_bulk 5000000000 ;#5gb
+        r flush
+        r read
+        assert_equal [r strlen S1] 5000000000
+        r set S2 asdf
+        r sadd myset 1 2
+        r mset D1 1 D2 2
+        catch {r sort myset by D* get S* store mylist}
+        assert_equal [count_log_message 0 "crashed by signal"] 0
+        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
+    }
+}
+
+# SORT which stores an integer encoded element into a list.
+# Just for coverage, no news here.
+start_server [list overrides [list save ""] ] {
+    test {SORT adds integer field to list} {
+        r set S1 asdf
+        r set S2 123 ;# integer encoded
+        assert_encoding "int" S2
+        r sadd myset 1 2
+        r mset D1 1 D2 2
+        r sort myset by D* get S* store mylist
+        r llen mylist
+    } {2}
+}
diff --git a/redis-stable/tests/unit/wait.tcl b/redis-stable/tests/unit/wait.tcl
new file mode 100644
index 00000000..78c3d820
--- /dev/null
+++ b/redis-stable/tests/unit/wait.tcl
@@ -0,0 +1,58 @@
+source tests/support/cli.tcl
+
+start_server {tags {"wait network"}} {
+start_server {} {
+    set slave [srv 0 client]
+    set slave_host [srv 0 host]
+    set slave_port [srv 0 port]
+    set slave_pid [srv 0 pid]
+    set master [srv -1 client]
+    set master_host [srv -1 host]
+    set master_port [srv -1 port]
+
+    test {Setup slave} {
+        $slave slaveof $master_host $master_port
+        wait_for_condition 50 100 {
+            [s 0 master_link_status] eq {up}
+        } else {
+            fail "Replication not started."
+        }
+    }
+
+    test {WAIT should acknowledge 1 additional copy of the data} {
+        $master set foo 0
+        $master incr foo
+        $master incr foo
+        $master incr foo
+        assert {[$master wait 1 5000] == 1}
+        assert {[$slave get foo] == 3}
+    }
+
+    test {WAIT should not acknowledge 2 additional copies of the data} {
+        $master incr foo
+        assert {[$master wait 2 1000] <= 1}
+    }
+
+    test {WAIT should not acknowledge 1 additional copy if slave is blocked} {
+        exec kill -SIGSTOP $slave_pid
+        $master set foo 0
+        $master incr foo
+        $master incr foo
+        $master incr foo
+        assert {[$master wait 1 1000] == 0}
+        exec kill -SIGCONT $slave_pid
+        assert {[$master wait 1 1000] == 1}
+    }
+
+    test {WAIT implicitly blocks on client pause since ACKs aren't sent} {
+        exec kill -SIGSTOP $slave_pid
+        $master multi
+        $master incr foo
+        $master client pause 10000 write
+        $master exec
+        assert {[$master wait 1 1000] == 0}
+        $master client unpause
+        exec kill -SIGCONT $slave_pid
+        assert {[$master wait 1 1000] == 1}
+    }
+}}
diff --git a/redis-stable/utils/build-static-symbols.tcl b/redis-stable/utils/build-static-symbols.tcl
new file mode 100644
index 00000000..e634cbe0
--- /dev/null
+++ b/redis-stable/utils/build-static-symbols.tcl
@@ -0,0 +1,22 @@
+# Build a symbol table for static symbols of redis.c
+# Useful to get stack traces on segfault without a debugger. See redis.c
+# for more information.
+#
+# Copyright(C) 2009 Salvatore Sanfilippo, under the BSD license.
+
+set fd [open redis.c]
+set symlist {}
+while {[gets $fd line] != -1} {
+    if {[regexp {^static +[A-z0-9]+[ *]+([A-z0-9]*)\(} $line - sym]} {
+        lappend symlist $sym
+    }
+}
+set symlist [lsort -unique $symlist]
+puts "static struct redisFunctionSym symsTable\[\] = {"
+foreach sym $symlist {
+    puts "{\"$sym\",(unsigned long)$sym},"
+}
+puts "{NULL,0}"
+puts "};"
+
+close $fd
diff --git a/redis-stable/utils/cluster_fail_time.tcl b/redis-stable/utils/cluster_fail_time.tcl
new file mode 100644
index 00000000..87399495
--- /dev/null
+++ b/redis-stable/utils/cluster_fail_time.tcl
@@ -0,0 +1,50 @@
+# This simple script is used in order to estimate the average PFAIL->FAIL
+# state switch after a failure.
+
+set ::sleep_time 10     ; # How much to sleep to trigger PFAIL.
+set ::fail_port 30016   ; # Node to put in sleep.
+set ::other_port 30001  ; # Node to use to monitor the flag switch.
+
+proc avg vector {
+    set sum 0.0
+    foreach x $vector {
+        set sum [expr {$sum+$x}]
+    }
+    expr {$sum/[llength $vector]}
+}
+
+set samples {}
+while 1 {
+    exec redis-cli -p $::fail_port debug sleep $::sleep_time > /dev/null &
+
+    # Wait for fail? to appear.
+    while 1 {
+        set output [exec redis-cli -p $::other_port cluster nodes]
+        if {[string match {*fail\?*} $output]} break
+        after 100
+    }
+
+    puts "FAIL?"
+    set start [clock milliseconds]
+
+    # Wait for fail? to disappear.
+    while 1 {
+        set output [exec redis-cli -p $::other_port cluster nodes]
+        if {![string match {*fail\?*} $output]} break
+        after 100
+    }
+
+    puts "FAIL"
+    set now [clock milliseconds]
+    set elapsed [expr {$now-$start}]
+    puts $elapsed
+    lappend samples $elapsed
+
+    puts "AVG([llength $samples]): [avg $samples]"
+
+    # Wait for the instance to be available again.
+    exec redis-cli -p $::fail_port ping
+
+    # Wait for the fail flag to be cleared.
+    after 2000
+}
diff --git a/redis-stable/utils/corrupt_rdb.c b/redis-stable/utils/corrupt_rdb.c
new file mode 100644
index 00000000..df9c93ed
--- /dev/null
+++ b/redis-stable/utils/corrupt_rdb.c
@@ -0,0 +1,45 @@
+/* Trivia program to corrupt an RDB file in order to check the RDB check
+ * program behavior and effectiveness.
+ *
+ * Copyright (C) 2016 Salvatore Sanfilippo.
+ * This software is released in the 3-clause BSD license. */
+
+#include <stdio.h>
+#include <fcntl.h>
+#include <sys/stat.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <time.h>
+
+int main(int argc, char **argv) {
+    struct stat stat;
+    int fd, cycles;
+
+    if (argc != 3) {
+        fprintf(stderr,"Usage: <filename> <cycles>\n");
+        exit(1);
+    }
+
+    srand(time(NULL));
+    char *filename = argv[1];
+    cycles = atoi(argv[2]);
+    fd = open(filename,O_RDWR);
+    if (fd == -1) {
+        perror("open");
+        exit(1);
+    }
+    fstat(fd,&stat);
+
+    while(cycles--) {
+        unsigned char buf[32];
+        unsigned long offset = rand()%stat.st_size;
+        int writelen = 1+rand()%31;
+        int j;
+
+        for (j = 0; j < writelen; j++) buf[j] = (char)rand();
+        lseek(fd,offset,SEEK_SET);
+        printf("Writing %d bytes at offset %lu\n", writelen, offset);
+        write(fd,buf,writelen);
+    }
+    return 0;
+}
diff --git a/redis-stable/utils/create-cluster/.gitignore b/redis-stable/utils/create-cluster/.gitignore
new file mode 100644
index 00000000..2988ee91
--- /dev/null
+++ b/redis-stable/utils/create-cluster/.gitignore
@@ -0,0 +1,5 @@
+config.sh
+*.rdb
+*.aof
+*.conf
+*.log
diff --git a/redis-stable/utils/create-cluster/README b/redis-stable/utils/create-cluster/README
new file mode 100644
index 00000000..bcd74597
--- /dev/null
+++ b/redis-stable/utils/create-cluster/README
@@ -0,0 +1,27 @@
+create-cluster is a small script used to easily start a big number of Redis
+instances configured to run in cluster mode. Its main goal is to allow manual
+testing in a condition which is not easy to replicate with the Redis cluster
+unit tests, for example when a lot of instances are needed in order to trigger
+a given bug.
+
+The tool can also be used just to easily create a number of instances in a
+Redis Cluster in order to experiment a bit with the system.
+
+USAGE
+---
+
+To create a cluster, follow these steps:
+
+1. Edit create-cluster and change the start / end port, depending on the
+number of instances you want to create.
+2. Use "./create-cluster start" in order to run the instances.
+3. Use "./create-cluster create" in order to execute redis-cli --cluster create, so that
+an actual Redis cluster will be created. (If you're accessing your setup via a local container, ensure that the CLUSTER_HOST value is changed to your local IP)
+4. Now you are ready to play with the cluster. AOF files and logs for each instances are created in the current directory.
+
+In order to stop a cluster:
+
+1. Use "./create-cluster stop" to stop all the instances. After you stopped the instances you can use "./create-cluster start" to restart them if you change your mind.
+2. Use "./create-cluster clean" to remove all the AOF / log files to restart with a clean environment.
+
+Use the command "./create-cluster help" to get the full list of features.
diff --git a/redis-stable/utils/create-cluster/create-cluster b/redis-stable/utils/create-cluster/create-cluster
new file mode 100755
index 00000000..d9a3b8c3
--- /dev/null
+++ b/redis-stable/utils/create-cluster/create-cluster
@@ -0,0 +1,118 @@
+#!/bin/bash
+
+# Settings
+BIN_PATH="../../src/"
+CLUSTER_HOST=127.0.0.1
+PORT=30000
+TIMEOUT=2000
+NODES=6
+REPLICAS=1
+PROTECTED_MODE=yes
+ADDITIONAL_OPTIONS=""
+
+# You may want to put the above config parameters into config.sh in order to
+# override the defaults without modifying this script.
+
+if [ -a config.sh ]
+then
+    source "config.sh"
+fi
+
+# Computed vars
+ENDPORT=$((PORT+NODES))
+
+if [ "$1" == "start" ]
+then
+    while [ $((PORT < ENDPORT)) != "0" ]; do
+        PORT=$((PORT+1))
+        echo "Starting $PORT"
+        $BIN_PATH/redis-server --port $PORT  --protected-mode $PROTECTED_MODE --cluster-enabled yes --cluster-config-file nodes-${PORT}.conf --cluster-node-timeout $TIMEOUT --appendonly yes --appendfilename appendonly-${PORT}.aof --dbfilename dump-${PORT}.rdb --logfile ${PORT}.log --daemonize yes ${ADDITIONAL_OPTIONS}
+    done
+    exit 0
+fi
+
+if [ "$1" == "create" ]
+then
+    HOSTS=""
+    while [ $((PORT < ENDPORT)) != "0" ]; do
+        PORT=$((PORT+1))
+        HOSTS="$HOSTS $CLUSTER_HOST:$PORT"
+    done
+    OPT_ARG=""
+    if [ "$2" == "-f" ]; then
+        OPT_ARG="--cluster-yes"
+    fi
+    $BIN_PATH/redis-cli --cluster create $HOSTS --cluster-replicas $REPLICAS $OPT_ARG
+    exit 0
+fi
+
+if [ "$1" == "stop" ]
+then
+    while [ $((PORT < ENDPORT)) != "0" ]; do
+        PORT=$((PORT+1))
+        echo "Stopping $PORT"
+        $BIN_PATH/redis-cli -p $PORT shutdown nosave
+    done
+    exit 0
+fi
+
+if [ "$1" == "watch" ]
+then
+    PORT=$((PORT+1))
+    while [ 1 ]; do
+        clear
+        date
+        $BIN_PATH/redis-cli -p $PORT cluster nodes | head -30
+        sleep 1
+    done
+    exit 0
+fi
+
+if [ "$1" == "tail" ]
+then
+    INSTANCE=$2
+    PORT=$((PORT+INSTANCE))
+    tail -f ${PORT}.log
+    exit 0
+fi
+
+if [ "$1" == "tailall" ]
+then
+    tail -f *.log
+    exit 0
+fi
+
+if [ "$1" == "call" ]
+then
+    while [ $((PORT < ENDPORT)) != "0" ]; do
+        PORT=$((PORT+1))
+        $BIN_PATH/redis-cli -p $PORT $2 $3 $4 $5 $6 $7 $8 $9
+    done
+    exit 0
+fi
+
+if [ "$1" == "clean" ]
+then
+    rm -rf *.log
+    rm -rf appendonly*.aof
+    rm -rf dump*.rdb
+    rm -rf nodes*.conf
+    exit 0
+fi
+
+if [ "$1" == "clean-logs" ]
+then
+    rm -rf *.log
+    exit 0
+fi
+
+echo "Usage: $0 [start|create|stop|watch|tail|clean|call]"
+echo "start       -- Launch Redis Cluster instances."
+echo "create [-f] -- Create a cluster using redis-cli --cluster create."
+echo "stop        -- Stop Redis Cluster instances."
+echo "watch       -- Show CLUSTER NODES output (first 30 lines) of first node."
+echo "tail <id>   -- Run tail -f of instance at base port + ID."
+echo "tailall     -- Run tail -f for all the log files at once."
+echo "clean       -- Remove all instances data, logs, configs."
+echo "clean-logs  -- Remove just instances logs."
+echo "call <cmd>  -- Call a command (up to 7 arguments) on all nodes."
diff --git a/redis-stable/utils/gen-test-certs.sh b/redis-stable/utils/gen-test-certs.sh
new file mode 100755
index 00000000..60814483
--- /dev/null
+++ b/redis-stable/utils/gen-test-certs.sh
@@ -0,0 +1,58 @@
+#!/bin/bash
+
+# Generate some test certificates which are used by the regression test suite:
+#
+#   tests/tls/ca.{crt,key}          Self signed CA certificate.
+#   tests/tls/redis.{crt,key}       A certificate with no key usage/policy restrictions.
+#   tests/tls/client.{crt,key}      A certificate restricted for SSL client usage.
+#   tests/tls/server.{crt,key}      A certificate restricted fro SSL server usage.
+#   tests/tls/redis.dh              DH Params file.
+
+generate_cert() {
+    local name=$1
+    local cn="$2"
+    local opts="$3"
+
+    local keyfile=tests/tls/${name}.key
+    local certfile=tests/tls/${name}.crt
+
+    [ -f $keyfile ] || openssl genrsa -out $keyfile 2048
+    openssl req \
+        -new -sha256 \
+        -subj "/O=Redis Test/CN=$cn" \
+        -key $keyfile | \
+        openssl x509 \
+            -req -sha256 \
+            -CA tests/tls/ca.crt \
+            -CAkey tests/tls/ca.key \
+            -CAserial tests/tls/ca.txt \
+            -CAcreateserial \
+            -days 365 \
+            $opts \
+            -out $certfile
+}
+
+mkdir -p tests/tls
+[ -f tests/tls/ca.key ] || openssl genrsa -out tests/tls/ca.key 4096
+openssl req \
+    -x509 -new -nodes -sha256 \
+    -key tests/tls/ca.key \
+    -days 3650 \
+    -subj '/O=Redis Test/CN=Certificate Authority' \
+    -out tests/tls/ca.crt
+
+cat > tests/tls/openssl.cnf <<_END_
+[ server_cert ]
+keyUsage = digitalSignature, keyEncipherment
+nsCertType = server
+
+[ client_cert ]
+keyUsage = digitalSignature, keyEncipherment
+nsCertType = client
+_END_
+
+generate_cert server "Server-only" "-extfile tests/tls/openssl.cnf -extensions server_cert"
+generate_cert client "Client-only" "-extfile tests/tls/openssl.cnf -extensions client_cert"
+generate_cert redis "Generic-cert"
+
+[ -f tests/tls/redis.dh ] || openssl dhparam -out tests/tls/redis.dh 2048
diff --git a/redis-stable/utils/generate-command-help.rb b/redis-stable/utils/generate-command-help.rb
new file mode 100755
index 00000000..929761b2
--- /dev/null
+++ b/redis-stable/utils/generate-command-help.rb
@@ -0,0 +1,123 @@
+#!/usr/bin/env ruby
+
+GROUPS = [
+  "generic",
+  "string",
+  "list",
+  "set",
+  "sorted_set",
+  "hash",
+  "pubsub",
+  "transactions",
+  "connection",
+  "server",
+  "scripting",
+  "hyperloglog",
+  "cluster",
+  "geo",
+  "stream"
+].freeze
+
+GROUPS_BY_NAME = Hash[*
+  GROUPS.each_with_index.map do |n,i|
+    [n,i]
+  end.flatten
+].freeze
+
+def argument arg
+  if "block" == arg["type"]
+    name = arg["block"].map do |entry|
+      argument entry
+    end.join " "
+  else
+    name = arg["name"].is_a?(Array) ? arg["name"].join(" ") : arg["name"]
+    name = arg["enum"].join "|" if "enum" == arg["type"]
+    name = arg["command"] + (name ? " " + name : "") if arg["command"]
+  end
+  if arg["multiple"]
+    name = "#{name} [#{name} ...]"
+  end
+  if arg["optional"]
+    name = "[#{name}]"
+  end
+  name
+end
+
+def arguments command
+  return "-" unless command["arguments"]
+  command["arguments"].map do |arg|
+    argument arg
+  end.join " "
+end
+
+def commands
+  return @commands if @commands
+
+  require "rubygems"
+  require "net/http"
+  require "net/https"
+  require "json"
+  require "uri"
+
+  url = URI.parse "https://raw.githubusercontent.com/redis/redis-doc/master/commands.json"
+  client = Net::HTTP.new url.host, url.port
+  client.use_ssl = true
+  response = client.get url.path
+  if response.is_a?(Net::HTTPSuccess)
+    @commands = JSON.parse(response.body)
+  else
+    response.error!
+  end
+end
+
+def generate_groups
+  GROUPS.map do |n|
+    "\"#{n}\""
+  end.join(",\n    ");
+end
+
+def generate_commands
+  commands.to_a.sort do |x,y|
+    x[0] <=> y[0]
+  end.map do |key, command|
+    group = GROUPS_BY_NAME[command["group"]]
+    if group.nil?
+      STDERR.puts "Please update groups array in #{__FILE__}"
+      raise "Unknown group #{command["group"]}"
+    end
+
+    ret = <<-SPEC
+{ "#{key}",
+    "#{arguments(command)}",
+    "#{command["summary"]}",
+    #{group},
+    "#{command["since"]}" }
+    SPEC
+    ret.strip
+  end.join(",\n    ")
+end
+
+# Write to stdout
+puts <<-HELP_H
+/* Automatically generated by #{__FILE__}, do not edit. */
+
+#ifndef __REDIS_HELP_H
+#define __REDIS_HELP_H
+
+static char *commandGroups[] = {
+    #{generate_groups}
+};
+
+struct commandHelp {
+  char *name;
+  char *params;
+  char *summary;
+  int group;
+  char *since;
+} commandHelp[] = {
+    #{generate_commands}
+};
+
+#endif
+HELP_H
+
diff --git a/redis-stable/utils/graphs/commits-over-time/README.md b/redis-stable/utils/graphs/commits-over-time/README.md
new file mode 100644
index 00000000..b28019ec
--- /dev/null
+++ b/redis-stable/utils/graphs/commits-over-time/README.md
@@ -0,0 +1,16 @@
+This Tcl script is what I used in order to generate the graph you
+can find at http://antirez.com/news/98. It's really quick & dirty, more
+a trow away program than anything else, but probably could be reused or
+modified in the future in order to visualize other similar data or an
+updated version of the same data.
+
+The usage is trivial:
+
+    ./genhtml.tcl > output.html
+
+The generated HTML is quite broken but good enough to grab a screenshot
+from the browser. Feel free to improve it if you got time / interest.
+
+Note that the code filtering the tags, and the hardcoded branch name, does
+not make the script, as it is, able to analyze a different repository.
+However the changes needed are trivial.
diff --git a/redis-stable/utils/graphs/commits-over-time/genhtml.tcl b/redis-stable/utils/graphs/commits-over-time/genhtml.tcl
new file mode 100755
index 00000000..c4b4e098
--- /dev/null
+++ b/redis-stable/utils/graphs/commits-over-time/genhtml.tcl
@@ -0,0 +1,96 @@
+#!/usr/bin/env tclsh
+
+# Load commits history as "sha1 unixtime".
+set commits [exec git log unstable {--pretty="%H %at"}]
+set raw_tags [exec git tag]
+
+# Load all the tags that are about stable releases.
+foreach tag $raw_tags {
+    if {[string match v*-stable $tag]} {
+        set tag [string range $tag 1 end-7]
+        puts $tag
+    }
+    if {[regexp {^[0-9]+.[0-9]+.[0-9]+$} $tag]} {
+        lappend tags $tag
+    }
+}
+
+# For each tag, create a list of "name unixtime"
+foreach tag $tags {
+    set taginfo [exec git log $tag -n 1 "--pretty=\"$tag %at\""]
+    set taginfo [string trim $taginfo {"}]
+    lappend labels $taginfo
+}
+
+# For each commit, check the amount of code changed and create an array
+# mapping the commit to the number of lines affected.
+foreach c $commits {
+    set stat [exec git show --oneline --numstat [lindex $c 0]]
+    set linenum 0
+    set affected 0
+    foreach line [split $stat "\n"] {
+        incr linenum
+        if {$linenum == 1 || [string match *deps/* $line]} continue
+        if {[catch {llength $line} numfields]} continue
+        if {$numfields == 0} continue
+        catch {
+            incr affected [lindex $line 0]
+            incr affected [lindex $line 1]
+        }
+    }
+    set commit_to_affected([lindex $c 0]) $affected
+}
+
+set base_time [lindex [lindex $commits end] 1]
+puts [clock format $base_time]
+
+# Generate a graph made of HTML DIVs.
+puts {<html>
+<style>
+.box {
+    position:absolute;
+    width:10px;
+    height:5px;
+    border:1px black solid;
+    background-color:#44aa33;
+    opacity: 0.04;
+}
+.label {
+    position:absolute;
+    background-color:#dddddd;
+    font-family:helvetica;
+    font-size:12px;
+    padding:2px;
+    color:#666;
+    border:1px #aaa solid;
+    border-radius: 5px;
+}
+#outer {
+    position:relative;
+    width:1500;
+    height:500;
+    border:1px #aaa solid;
+}
+</style>
+<div id="outer">
+}
+foreach c $commits {
+    set sha [lindex $c 0]
+    set t [expr {([lindex $c 1]-$base_time)/(3600*24*2)}]
+    set affected [expr $commit_to_affected($sha)]
+    set left $t
+    set height [expr {log($affected)*20}]
+    puts "<div class=\"box\" style=\"left:$left; bottom:0; height:$height\"></div>"
+}
+
+set bottom -30
+foreach l $labels {
+    set name [lindex $l 0]
+    set t [expr {([lindex $l 1]-$base_time)/(3600*24*2)}]
+    set left $t
+    if {$left < 0} continue
+    incr bottom -20
+    if  {$bottom == -210} {set bottom -30}
+    puts "<div class=\"label\" style=\"left:$left; bottom:$bottom\">$name</div>"
+}
+puts {</div></html>}
diff --git a/redis-stable/utils/hashtable/README b/redis-stable/utils/hashtable/README
new file mode 100644
index 00000000..87ffc2f0
--- /dev/null
+++ b/redis-stable/utils/hashtable/README
@@ -0,0 +1,13 @@
+Hash table implementation related utilities.
+
+rehashing.c
+---
+
+Visually show buckets in the two hash tables between rehashings. Also stress
+test getRandomKeys() implementation, that may actually disappear from
+Redis soon, However the visualization code is reusable in new bugs
+investigation.
+
+Compile with:
+
+    cc -I ../../src/ rehashing.c ../../src/zmalloc.c ../../src/dict.c -o rehashing_test
diff --git a/redis-stable/utils/hashtable/rehashing.c b/redis-stable/utils/hashtable/rehashing.c
new file mode 100644
index 00000000..3c0acb84
--- /dev/null
+++ b/redis-stable/utils/hashtable/rehashing.c
@@ -0,0 +1,143 @@
+#include "redis.h"
+#include "dict.h"
+
+void _redisAssert(char *x, char *y, int l) {
+    printf("ASSERT: %s %s %d\n",x,y,l);
+    exit(1);
+}
+
+unsigned int dictKeyHash(const void *keyp) {
+    unsigned long key = (unsigned long)keyp;
+    key = dictGenHashFunction(&key,sizeof(key));
+    key += ~(key << 15);
+    key ^=  (key >> 10);
+    key +=  (key << 3);
+    key ^=  (key >> 6);
+    key += ~(key << 11);
+    key ^=  (key >> 16);
+    return key;
+}
+
+int dictKeyCompare(void *privdata, const void *key1, const void *key2) {
+    unsigned long k1 = (unsigned long)key1;
+    unsigned long k2 = (unsigned long)key2;
+    return k1 == k2;
+}
+
+dictType dictTypeTest = {
+    dictKeyHash,                   /* hash function */
+    NULL,                          /* key dup */
+    NULL,                          /* val dup */
+    dictKeyCompare,                /* key compare */
+    NULL,                          /* key destructor */
+    NULL,                          /* val destructor */
+    NULL                           /* allow to expand */
+};
+
+void showBuckets(dictht ht) {
+    if (ht.table == NULL) {
+        printf("NULL\n");
+    } else {
+        int j;
+        for (j = 0; j < ht.size; j++) {
+            printf("%c", ht.table[j] ? '1' : '0');
+        }
+        printf("\n");
+    }
+}
+
+void show(dict *d) {
+    int j;
+    if (d->rehashidx != -1) {
+        printf("rhidx: ");
+        for (j = 0; j < d->rehashidx; j++)
+            printf(".");
+        printf("|\n");
+    }
+    printf("ht[0]: ");
+    showBuckets(d->ht[0]);
+    printf("ht[1]: ");
+    showBuckets(d->ht[1]);
+    printf("\n");
+}
+
+int sortPointers(const void *a, const void *b) {
+    unsigned long la, lb;
+
+    la = (long) (*((dictEntry**)a));
+    lb = (long) (*((dictEntry**)b));
+    return la-lb;
+}
+
+void stressGetKeys(dict *d, int times, int *perfect_run, int *approx_run) {
+    int j;
+
+    dictEntry **des = zmalloc(sizeof(dictEntry*)*dictSize(d));
+    for (j = 0; j < times; j++) {
+        int requested = rand() % (dictSize(d)+1);
+        int returned = dictGetSomeKeys(d, des, requested);
+        int dup = 0;
+
+        qsort(des,returned,sizeof(dictEntry*),sortPointers);
+        if (returned > 1) {
+            int i;
+            for (i = 0; i < returned-1; i++) {
+                if (des[i] == des[i+1]) dup++;
+            }
+        }
+
+        if (requested == returned && dup == 0) {
+            (*perfect_run)++;
+        } else {
+            (*approx_run)++;
+            printf("Requested, returned, duplicated: %d %d %d\n",
+                requested, returned, dup);
+        }
+    }
+    zfree(des);
+}
+
+#define MAX1 120
+#define MAX2 1000
+int main(void) {
+    dict *d = dictCreate(&dictTypeTest,NULL);
+    unsigned long i;
+    srand(time(NULL));
+
+    for (i = 0; i < MAX1; i++) {
+        dictAdd(d,(void*)i,NULL);
+        show(d);
+    }
+    printf("Size: %d\n", (int)dictSize(d));
+
+    for (i = 0; i < MAX1; i++) {
+        dictDelete(d,(void*)i);
+        dictResize(d);
+        show(d);
+    }
+    dictRelease(d);
+
+    d = dictCreate(&dictTypeTest,NULL);
+
+    printf("Stress testing dictGetSomeKeys\n");
+    int perfect_run = 0, approx_run = 0;
+
+    for (i = 0; i < MAX2; i++) {
+        dictAdd(d,(void*)i,NULL);
+        stressGetKeys(d,100,&perfect_run,&approx_run);
+    }
+
+    for (i = 0; i < MAX2; i++) {
+        dictDelete(d,(void*)i);
+        dictResize(d);
+        stressGetKeys(d,100,&perfect_run,&approx_run);
+    }
+
+    printf("dictGetSomeKey, %d perfect runs, %d approximated runs\n",
+        perfect_run, approx_run);
+
+    dictRelease(d);
+
+    printf("TEST PASSED!\n");
+    return 0;
+}
diff --git a/redis-stable/utils/hyperloglog/.gitignore b/redis-stable/utils/hyperloglog/.gitignore
new file mode 100644
index 00000000..2211df63
--- /dev/null
+++ b/redis-stable/utils/hyperloglog/.gitignore
@@ -0,0 +1 @@
+*.txt
diff --git a/redis-stable/utils/hyperloglog/hll-err.rb b/redis-stable/utils/hyperloglog/hll-err.rb
new file mode 100644
index 00000000..2c71ac5e
--- /dev/null
+++ b/redis-stable/utils/hyperloglog/hll-err.rb
@@ -0,0 +1,27 @@
+# hll-err.rb - Copyright (C) 2014 Salvatore Sanfilippo
+# BSD license, See the COPYING file for more information.
+#
+# Check error of HyperLogLog Redis implementation for different set sizes.
+
+require 'rubygems'
+require 'redis'
+require 'digest/sha1'
+
+r = Redis.new
+r.del('hll')
+i = 0
+while true do
+    100.times {
+        elements = []
+        1000.times {
+            ele = Digest::SHA1.hexdigest(i.to_s)
+            elements << ele
+            i += 1
+        }
+        r.pfadd('hll',elements)
+    }
+    approx = r.pfcount('hll')
+    abs_err = (approx-i).abs
+    rel_err = 100.to_f*abs_err/i
+    puts "#{i} vs #{approx}: #{rel_err}%"
+end
diff --git a/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb b/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
new file mode 100644
index 00000000..6c7596d1
--- /dev/null
+++ b/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
@@ -0,0 +1,88 @@
+# hll-err.rb - Copyright (C) 2014 Salvatore Sanfilippo
+# BSD license, See the COPYING file for more information.
+#
+# This program is suited to output average and maximum errors of
+# the Redis HyperLogLog implementation in a format suitable to print
+# graphs using gnuplot.
+
+require 'rubygems'
+require 'redis'
+require 'digest/sha1'
+
+# Generate an array of [cardinality,relative_error] pairs
+# in the 0 - max range, with the specified step.
+#
+# 'r' is the Redis object used to perform the queries.
+# 'seed' must be different every time you want a test performed
+# with a different set. The function guarantees that if 'seed' is the
+# same, exactly the same dataset is used, and when it is different,
+# a totally unrelated different data set is used (without any common
+# element in practice).
+def run_experiment(r,seed,max,step)
+    r.del('hll')
+    i = 0
+    samples = []
+    step = 1000 if step > 1000
+    while i < max do
+        elements = []
+        step.times {
+            ele = Digest::SHA1.hexdigest(i.to_s+seed.to_s)
+            elements << ele
+            i += 1
+        }
+        r.pfadd('hll',elements)
+        approx = r.pfcount('hll')
+        err = approx-i
+        rel_err = 100.to_f*err/i
+        samples << [i,rel_err]
+    end
+    samples
+end
+
+def filter_samples(numsets,max,step,filter)
+    r = Redis.new
+    dataset = {}
+    (0...numsets).each{|i|
+        dataset[i] = run_experiment(r,i,max,step)
+        STDERR.puts "Set #{i}"
+    }
+    dataset[0].each_with_index{|ele,index|
+        if filter == :max
+            card=ele[0]
+            err=ele[1].abs
+            (1...numsets).each{|i|
+                err = dataset[i][index][1] if err < dataset[i][index][1]
+            }
+            puts "#{card} #{err}"
+        elsif filter == :avg
+            card=ele[0]
+            err = 0
+            (0...numsets).each{|i|
+                err += dataset[i][index][1]
+            }
+            err /= numsets
+            puts "#{card} #{err}"
+        elsif filter == :absavg
+            card=ele[0]
+            err = 0
+            (0...numsets).each{|i|
+                err += dataset[i][index][1].abs
+            }
+            err /= numsets
+            puts "#{card} #{err}"
+        elsif filter == :all
+            (0...numsets).each{|i|
+                card,err = dataset[i][index]
+                puts "#{card} #{err}"
+            }
+        else
+            raise "Unknown filter #{filter}"
+        end
+    }
+end
+
+if ARGV.length != 4
+    puts "Usage: hll-gnuplot-graph <samples> <max> <step> (max|avg|absavg|all)"
+    exit 1
+end
+filter_samples(ARGV[0].to_i,ARGV[1].to_i,ARGV[2].to_i,ARGV[3].to_sym)
diff --git a/redis-stable/utils/install_server.sh b/redis-stable/utils/install_server.sh
new file mode 100755
index 00000000..efda7da1
--- /dev/null
+++ b/redis-stable/utils/install_server.sh
@@ -0,0 +1,291 @@
+#!/bin/sh
+
+# Copyright 2011 Dvir Volk <dvirsk at gmail dot com>. All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#   1. Redistributions of source code must retain the above copyright notice,
+#   this list of conditions and the following disclaimer.
+#
+#   2. Redistributions in binary form must reproduce the above copyright
+#   notice, this list of conditions and the following disclaimer in the
+#   documentation and/or other materials provided with the distribution.
+#
+# THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
+# WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+# EVENT SHALL Dvir Volk OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
+# OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+# LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+# EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#
+################################################################################
+#
+# Service installer for redis server, runs interactively by default.
+#
+# To run this script non-interactively (for automation/provisioning purposes),
+# feed the variables into the script. Any missing variables will be prompted!
+# Tip: Environment variables also support command substitution (see REDIS_EXECUTABLE)
+#
+# Example:
+#
+# sudo REDIS_PORT=1234 \
+# 		 REDIS_CONFIG_FILE=/etc/redis/1234.conf \
+# 		 REDIS_LOG_FILE=/var/log/redis_1234.log \
+# 		 REDIS_DATA_DIR=/var/lib/redis/1234 \
+# 		 REDIS_EXECUTABLE=`command -v redis-server` ./utils/install_server.sh
+#
+# This generates a redis config file and an /etc/init.d script, and installs them.
+#
+# /!\ This script should be run as root
+#
+# NOTE: This script will not work on Mac OSX.
+#       It supports Debian and Ubuntu Linux.
+#
+################################################################################
+
+die () {
+	echo "ERROR: $1. Aborting!"
+	exit 1
+}
+
+
+#Absolute path to this script
+SCRIPT=$(readlink -f $0)
+#Absolute path this script is in
+SCRIPTPATH=$(dirname $SCRIPT)
+
+#Initial defaults
+_REDIS_PORT=6379
+_MANUAL_EXECUTION=false
+
+echo "Welcome to the redis service installer"
+echo "This script will help you easily set up a running redis server"
+echo
+
+#check for root user
+if [ "$(id -u)" -ne 0 ] ; then
+	echo "You must run this script as root. Sorry!"
+	exit 1
+fi
+
+#bail if this system is managed by systemd
+_pid_1_exe="$(readlink -f /proc/1/exe)"
+if [ "${_pid_1_exe##*/}" = systemd ]
+then
+	echo "This systems seems to use systemd."
+	echo "Please take a look at the provided example service unit files in this directory, and adapt and install them. Sorry!"
+	exit 1
+fi
+unset _pid_1_exe
+
+if ! echo $REDIS_PORT | egrep -q '^[0-9]+$' ; then
+	_MANUAL_EXECUTION=true
+	#Read the redis port
+	read  -p "Please select the redis port for this instance: [$_REDIS_PORT] " REDIS_PORT
+	if ! echo $REDIS_PORT | egrep -q '^[0-9]+$' ; then
+		echo "Selecting default: $_REDIS_PORT"
+		REDIS_PORT=$_REDIS_PORT
+	fi
+fi
+
+if [ -z "$REDIS_CONFIG_FILE" ] ; then
+	_MANUAL_EXECUTION=true
+	#read the redis config file
+	_REDIS_CONFIG_FILE="/etc/redis/$REDIS_PORT.conf"
+	read -p "Please select the redis config file name [$_REDIS_CONFIG_FILE] " REDIS_CONFIG_FILE
+	if [ -z "$REDIS_CONFIG_FILE" ] ; then
+		REDIS_CONFIG_FILE=$_REDIS_CONFIG_FILE
+		echo "Selected default - $REDIS_CONFIG_FILE"
+	fi
+fi
+
+if [ -z "$REDIS_LOG_FILE" ] ; then
+	_MANUAL_EXECUTION=true
+	#read the redis log file path
+	_REDIS_LOG_FILE="/var/log/redis_$REDIS_PORT.log"
+	read -p "Please select the redis log file name [$_REDIS_LOG_FILE] " REDIS_LOG_FILE
+	if [ -z "$REDIS_LOG_FILE" ] ; then
+		REDIS_LOG_FILE=$_REDIS_LOG_FILE
+		echo "Selected default - $REDIS_LOG_FILE"
+	fi
+fi
+
+if [ -z "$REDIS_DATA_DIR" ] ; then
+	_MANUAL_EXECUTION=true
+	#get the redis data directory
+	_REDIS_DATA_DIR="/var/lib/redis/$REDIS_PORT"
+	read -p "Please select the data directory for this instance [$_REDIS_DATA_DIR] " REDIS_DATA_DIR
+	if [ -z "$REDIS_DATA_DIR" ] ; then
+		REDIS_DATA_DIR=$_REDIS_DATA_DIR
+		echo "Selected default - $REDIS_DATA_DIR"
+	fi
+fi
+
+if [ ! -x "$REDIS_EXECUTABLE" ] ; then
+	_MANUAL_EXECUTION=true
+	#get the redis executable path
+	_REDIS_EXECUTABLE=`command -v redis-server`
+	read -p "Please select the redis executable path [$_REDIS_EXECUTABLE] " REDIS_EXECUTABLE
+	if [ ! -x "$REDIS_EXECUTABLE" ] ; then
+		REDIS_EXECUTABLE=$_REDIS_EXECUTABLE
+
+		if [ ! -x "$REDIS_EXECUTABLE" ] ; then
+			echo "Mmmmm...  it seems like you don't have a redis executable. Did you run make install yet?"
+			exit 1
+		fi
+	fi
+fi
+
+#check the default for redis cli
+CLI_EXEC=`command -v redis-cli`
+if [ -z "$CLI_EXEC" ] ; then
+	CLI_EXEC=`dirname $REDIS_EXECUTABLE`"/redis-cli"
+fi
+
+echo "Selected config:"
+
+echo "Port           : $REDIS_PORT"
+echo "Config file    : $REDIS_CONFIG_FILE"
+echo "Log file       : $REDIS_LOG_FILE"
+echo "Data dir       : $REDIS_DATA_DIR"
+echo "Executable     : $REDIS_EXECUTABLE"
+echo "Cli Executable : $CLI_EXEC"
+
+if $_MANUAL_EXECUTION == true ; then
+	read -p "Is this ok? Then press ENTER to go on or Ctrl-C to abort." _UNUSED_
+fi
+
+mkdir -p `dirname "$REDIS_CONFIG_FILE"` || die "Could not create redis config directory"
+mkdir -p `dirname "$REDIS_LOG_FILE"` || die "Could not create redis log dir"
+mkdir -p "$REDIS_DATA_DIR" || die "Could not create redis data directory"
+
+#render the templates
+TMP_FILE="/tmp/${REDIS_PORT}.conf"
+DEFAULT_CONFIG="${SCRIPTPATH}/../redis.conf"
+INIT_TPL_FILE="${SCRIPTPATH}/redis_init_script.tpl"
+INIT_SCRIPT_DEST="/etc/init.d/redis_${REDIS_PORT}"
+PIDFILE="/var/run/redis_${REDIS_PORT}.pid"
+
+if [ ! -f "$DEFAULT_CONFIG" ]; then
+	echo "Mmmmm... the default config is missing. Did you switch to the utils directory?"
+	exit 1
+fi
+
+#Generate config file from the default config file as template
+#changing only the stuff we're controlling from this script
+echo "## Generated by install_server.sh ##" > $TMP_FILE
+
+read -r SED_EXPR <<-EOF
+s#^port .\+#port ${REDIS_PORT}#; \
+s#^logfile .\+#logfile ${REDIS_LOG_FILE}#; \
+s#^dir .\+#dir ${REDIS_DATA_DIR}#; \
+s#^pidfile .\+#pidfile ${PIDFILE}#; \
+s#^daemonize no#daemonize yes#;
+EOF
+sed "$SED_EXPR" $DEFAULT_CONFIG >> $TMP_FILE
+
+#cat $TPL_FILE | while read line; do eval "echo \"$line\"" >> $TMP_FILE; done
+cp $TMP_FILE $REDIS_CONFIG_FILE || die "Could not write redis config file $REDIS_CONFIG_FILE"
+
+#Generate sample script from template file
+rm -f $TMP_FILE
+
+#we hard code the configs here to avoid issues with templates containing env vars
+#kinda lame but works!
+REDIS_INIT_HEADER=\
+"#!/bin/sh\n
+#Configurations injected by install_server below....\n\n
+EXEC=$REDIS_EXECUTABLE\n
+CLIEXEC=$CLI_EXEC\n
+PIDFILE=\"$PIDFILE\"\n
+CONF=\"$REDIS_CONFIG_FILE\"\n\n
+REDISPORT=\"$REDIS_PORT\"\n\n
+###############\n\n"
+
+REDIS_CHKCONFIG_INFO=\
+"# REDHAT chkconfig header\n\n
+# chkconfig: - 58 74\n
+# description: redis_${REDIS_PORT} is the redis daemon.\n
+### BEGIN INIT INFO\n
+# Provides: redis_6379\n
+# Required-Start: \$network \$local_fs \$remote_fs\n
+# Required-Stop: \$network \$local_fs \$remote_fs\n
+# Default-Start: 2 3 4 5\n
+# Default-Stop: 0 1 6\n
+# Should-Start: \$syslog \$named\n
+# Should-Stop: \$syslog \$named\n
+# Short-Description: start and stop redis_${REDIS_PORT}\n
+# Description: Redis daemon\n
+### END INIT INFO\n\n"
+
+if command -v chkconfig >/dev/null; then
+	#if we're a box with chkconfig on it we want to include info for chkconfig
+	echo "$REDIS_INIT_HEADER" "$REDIS_CHKCONFIG_INFO" > $TMP_FILE && cat $INIT_TPL_FILE >> $TMP_FILE || die "Could not write init script to $TMP_FILE"
+else
+	#combine the header and the template (which is actually a static footer)
+	echo "$REDIS_INIT_HEADER" > $TMP_FILE && cat $INIT_TPL_FILE >> $TMP_FILE || die "Could not write init script to $TMP_FILE"
+fi
+
+###
+# Generate sample script from template file
+# - No need to check which system we are on. The init info are comments and
+#   do not interfere with update_rc.d systems. Additionally:
+#     Ubuntu/debian by default does not come with chkconfig, but does issue a
+#     warning if init info is not available.
+
+cat > ${TMP_FILE} <<EOT
+#!/bin/sh
+#Configurations injected by install_server below....
+
+EXEC=$REDIS_EXECUTABLE
+CLIEXEC=$CLI_EXEC
+PIDFILE=$PIDFILE
+CONF="$REDIS_CONFIG_FILE"
+REDISPORT="$REDIS_PORT"
+###############
+# SysV Init Information
+# chkconfig: - 58 74
+# description: redis_${REDIS_PORT} is the redis daemon.
+### BEGIN INIT INFO
+# Provides: redis_${REDIS_PORT}
+# Required-Start: \$network \$local_fs \$remote_fs
+# Required-Stop: \$network \$local_fs \$remote_fs
+# Default-Start: 2 3 4 5
+# Default-Stop: 0 1 6
+# Should-Start: \$syslog \$named
+# Should-Stop: \$syslog \$named
+# Short-Description: start and stop redis_${REDIS_PORT}
+# Description: Redis daemon
+### END INIT INFO
+
+EOT
+cat ${INIT_TPL_FILE} >> ${TMP_FILE}
+
+#copy to /etc/init.d
+cp $TMP_FILE $INIT_SCRIPT_DEST && \
+	chmod +x $INIT_SCRIPT_DEST || die "Could not copy redis init script to  $INIT_SCRIPT_DEST"
+echo "Copied $TMP_FILE => $INIT_SCRIPT_DEST"
+
+#Install the service
+echo "Installing service..."
+if command -v chkconfig >/dev/null 2>&1; then
+	# we're chkconfig, so lets add to chkconfig and put in runlevel 345
+	chkconfig --add redis_${REDIS_PORT} && echo "Successfully added to chkconfig!"
+	chkconfig --level 345 redis_${REDIS_PORT} on && echo "Successfully added to runlevels 345!"
+elif command -v update-rc.d >/dev/null 2>&1; then
+	#if we're not a chkconfig box assume we're able to use update-rc.d
+	update-rc.d redis_${REDIS_PORT} defaults && echo "Success!"
+else
+	echo "No supported init tool found."
+fi
+
+/etc/init.d/redis_$REDIS_PORT start || die "Failed starting service..."
+
+#tada
+echo "Installation successful!"
+exit 0
diff --git a/redis-stable/utils/lru/README b/redis-stable/utils/lru/README
new file mode 100644
index 00000000..f043b297
--- /dev/null
+++ b/redis-stable/utils/lru/README
@@ -0,0 +1,19 @@
+The test-lru.rb program can be used in order to check the behavior of the
+Redis approximated LRU algorithm against the theoretical output of true
+LRU algorithm.
+
+In order to use the program you need to recompile Redis setting the define
+REDIS_LRU_CLOCK_RESOLUTION to 1, by editing the file server.h.
+This allows to execute the program in a fast way since the 1 ms resolution
+is enough for all the objects to have a different enough time stamp during
+the test.
+
+The program is executed like this:
+
+    ruby test-lru.rb /tmp/lru.html
+
+You can optionally specify a number of times to run, so that the program
+will output averages of different runs, by adding an additional argument.
+For instance in order to run the test 10 times use:
+
+    ruby test-lru.rb /tmp/lru.html 10
diff --git a/redis-stable/utils/lru/lfu-simulation.c b/redis-stable/utils/lru/lfu-simulation.c
new file mode 100644
index 00000000..6aa5911a
--- /dev/null
+++ b/redis-stable/utils/lru/lfu-simulation.c
@@ -0,0 +1,158 @@
+#include <stdio.h>
+#include <time.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+int decr_every = 1;
+int keyspace_size = 1000000;
+time_t switch_after = 30; /* Switch access pattern after N seconds. */
+
+struct entry {
+    /* Field that the LFU Redis implementation will have (we have
+     * 24 bits of total space in the object->lru field). */
+    uint8_t counter;    /* Logarithmic counter. */
+    uint16_t decrtime;  /* (Reduced precision) time of last decrement. */
+
+    /* Fields only useful for visualization. */
+    uint64_t hits;      /* Number of real accesses. */
+    time_t ctime;       /* Key creation time. */
+};
+
+#define to_16bit_minutes(x) ((x/60) & 65535)
+#define COUNTER_INIT_VAL 5
+
+/* Compute the difference in minutes between two 16 bit minutes times
+ * obtained with to_16bit_minutes(). Since they can wrap around if
+ * we detect the overflow we account for it as if the counter wrapped
+ * a single time. */
+uint16_t minutes_diff(uint16_t now, uint16_t prev) {
+    if (now >= prev) return now-prev;
+    return 65535-prev+now;
+}
+
+/* Increment a couter logaritmically: the greatest is its value, the
+ * less likely is that the counter is really incremented.
+ * The maximum value of the counter is saturated at 255. */
+uint8_t log_incr(uint8_t counter) {
+    if (counter == 255) return counter;
+    double r = (double)rand()/RAND_MAX;
+    double baseval = counter-COUNTER_INIT_VAL;
+    if (baseval < 0) baseval = 0;
+    double limit = 1.0/(baseval*10+1);
+    if (r < limit) counter++;
+    return counter;
+}
+
+/* Simulate an access to an entry. */
+void access_entry(struct entry *e) {
+    e->counter = log_incr(e->counter);
+    e->hits++;
+}
+
+/* Return the entry LFU value and as a side effect decrement the
+ * entry value if the decrement time was reached. */
+uint8_t scan_entry(struct entry *e) {
+    if (minutes_diff(to_16bit_minutes(time(NULL)),e->decrtime)
+        >= decr_every)
+    {
+        if (e->counter) {
+            if (e->counter > COUNTER_INIT_VAL*2) {
+                e->counter /= 2;
+            } else {
+                e->counter--;
+            }
+        }
+        e->decrtime = to_16bit_minutes(time(NULL));
+    }
+    return e->counter;
+}
+
+/* Print the entry info. */
+void show_entry(long pos, struct entry *e) {
+    char *tag = "normal       ";
+
+    if (pos >= 10 && pos <= 14) tag = "new no access";
+    if (pos >= 15 && pos <= 19) tag = "new accessed ";
+    if (pos >= keyspace_size -5) tag= "old no access";
+
+    printf("%ld] <%s> frequency:%d decrtime:%d [%lu hits | age:%ld sec]\n",
+        pos, tag, e->counter, e->decrtime, (unsigned long)e->hits,
+            time(NULL) - e->ctime);
+}
+
+int main(void) {
+    time_t start = time(NULL);
+    time_t new_entry_time = start;
+    time_t display_time = start;
+    struct entry *entries = malloc(sizeof(*entries)*keyspace_size);
+    long j;
+
+    /* Initialize. */
+    for (j = 0; j < keyspace_size; j++) {
+        entries[j].counter = COUNTER_INIT_VAL;
+        entries[j].decrtime = to_16bit_minutes(start);
+        entries[j].hits = 0;
+        entries[j].ctime = time(NULL);
+    }
+
+    while(1) {
+        time_t now = time(NULL);
+        long idx;
+
+        /* Scan N random entries (simulates the eviction under maxmemory). */
+        for (j = 0; j < 3; j++) {
+            scan_entry(entries+(rand()%keyspace_size));
+        }
+
+        /* Access a random entry: use a power-law access pattern up to
+         * 'switch_after' seconds. Then revert to flat access pattern. */
+        if (now-start < switch_after) {
+            /* Power law. */
+            idx = 1;
+            while((rand() % 21) != 0 && idx < keyspace_size) idx *= 2;
+            if (idx > keyspace_size) idx = keyspace_size;
+            idx = rand() % idx;
+        } else {
+            /* Flat. */
+            idx = rand() % keyspace_size;
+        }
+
+        /* Never access entries between position 10 and 14, so that
+         * we simulate what happens to new entries that are never
+         * accessed VS new entries which are accessed in positions
+         * 15-19.
+         *
+         * Also never access last 5 entry, so that we have keys which
+         * are never recreated (old), and never accessed. */
+        if ((idx < 10 || idx > 14) && (idx < keyspace_size-5))
+            access_entry(entries+idx);
+
+        /* Simulate the addition of new entries at positions between
+         * 10 and 19, a random one every 10 seconds. */
+        if (new_entry_time <= now) {
+            idx = 10+(rand()%10);
+            entries[idx].counter = COUNTER_INIT_VAL;
+            entries[idx].decrtime = to_16bit_minutes(time(NULL));
+            entries[idx].hits = 0;
+            entries[idx].ctime = time(NULL);
+            new_entry_time = now+10;
+        }
+
+        /* Show the first 20 entries and the last 20 entries. */
+        if (display_time != now) {
+            printf("=============================\n");
+            printf("Current minutes time: %d\n", (int)to_16bit_minutes(now));
+            printf("Access method: %s\n",
+                (now-start < switch_after) ? "power-law" : "flat");
+
+            for (j = 0; j < 20; j++)
+                show_entry(j,entries+j);
+
+            for (j = keyspace_size-20; j < keyspace_size; j++)
+                show_entry(j,entries+j);
+            display_time = now;
+        }
+    }
+    return 0;
+}
+
diff --git a/redis-stable/utils/lru/test-lru.rb b/redis-stable/utils/lru/test-lru.rb
new file mode 100644
index 00000000..d511e206
--- /dev/null
+++ b/redis-stable/utils/lru/test-lru.rb
@@ -0,0 +1,223 @@
+require 'rubygems'
+require 'redis'
+
+$runs = []; # Remember the error rate of each run for average purposes.
+$o = {};    # Options set parsing arguments
+
+def testit(filename)
+    r = Redis.new
+    r.config("SET","maxmemory","2000000")
+    if $o[:ttl]
+        r.config("SET","maxmemory-policy","volatile-ttl")
+    else
+        r.config("SET","maxmemory-policy","allkeys-lru")
+    end
+    r.config("SET","maxmemory-samples",5)
+    r.config("RESETSTAT")
+    r.flushall
+
+    html = ""
+    html << <<EOF
+    <html>
+    <body>
+    <style>
+    .box {
+        width:5px;
+        height:5px;
+        float:left;
+        margin: 1px;
+    }
+
+    .old {
+        border: 1px black solid;
+    }
+
+    .new {
+        border: 1px green solid;
+    }
+
+    .otherdb {
+        border: 1px red solid;
+    }
+
+    .ex {
+        background-color: #666;
+    }
+    </style>
+    <pre>
+EOF
+
+    # Fill the DB up to the first eviction.
+    oldsize = r.dbsize
+    id = 0
+    while true
+        id += 1
+        begin
+            r.set(id,"foo")
+        rescue
+            break
+        end
+        newsize = r.dbsize
+        break if newsize == oldsize # A key was evicted? Stop.
+        oldsize = newsize
+    end
+
+    inserted = r.dbsize
+    first_set_max_id = id
+    html << "#{r.dbsize} keys inserted.\n"
+
+    # Access keys sequentially, so that in theory the first part will be expired
+    # and the latter part will not, according to perfect LRU.
+
+    if $o[:ttl]
+        STDERR.puts "Set increasing expire value"
+        (1..first_set_max_id).each{|id|
+            r.expire(id,1000+id)
+            STDERR.print(".") if (id % 150) == 0
+        }
+    else
+        STDERR.puts "Access keys sequentially"
+        (1..first_set_max_id).each{|id|
+            r.get(id)
+            sleep 0.001
+            STDERR.print(".") if (id % 150) == 0
+        }
+    end
+    STDERR.puts
+
+    # Insert more 50% keys. We expect that the new keys will rarely be expired
+    # since their last access time is recent compared to the others.
+    #
+    # Note that we insert the first 100 keys of the new set into DB1 instead
+    # of DB0, so that we can try how cross-DB eviction works.
+    half = inserted/2
+    html << "Insert enough keys to evict half the keys we inserted.\n"
+    add = 0
+
+    otherdb_start_idx = id+1
+    otherdb_end_idx = id+100
+    while true
+        add += 1
+        id += 1
+        if id >= otherdb_start_idx && id <= otherdb_end_idx
+            r.select(1)
+            r.set(id,"foo")
+            r.select(0)
+        else
+            r.set(id,"foo")
+        end
+        break if r.info['evicted_keys'].to_i >= half
+    end
+
+    html << "#{add} additional keys added.\n"
+    html << "#{r.dbsize} keys in DB.\n"
+
+    # Check if evicted keys respect LRU
+    # We consider errors from 1 to N progressively more serious as they violate
+    # more the access pattern.
+
+    errors = 0
+    e = 1
+    error_per_key = 100000.0/first_set_max_id
+    half_set_size = first_set_max_id/2
+    maxerr = 0
+    (1..(first_set_max_id/2)).each{|id|
+        if id >= otherdb_start_idx && id <= otherdb_end_idx
+            r.select(1)
+            exists = r.exists(id)
+            r.select(0)
+        else
+            exists = r.exists(id)
+        end
+        if id < first_set_max_id/2
+            thiserr = error_per_key * ((half_set_size-id).to_f/half_set_size)
+            maxerr += thiserr
+            errors += thiserr if exists
+        elsif id >= first_set_max_id/2
+            thiserr = error_per_key * ((id-half_set_size).to_f/half_set_size)
+            maxerr += thiserr
+            errors += thiserr if !exists
+        end
+    }
+    errors = errors*100/maxerr
+
+    STDERR.puts "Test finished with #{errors}% error! Generating HTML on stdout."
+
+    html << "#{errors}% error!\n"
+    html << "</pre>"
+    $runs << errors
+
+    # Generate the graphical representation
+    (1..id).each{|id|
+        # Mark first set and added items in a different way.
+        c = "box"
+        if id >= otherdb_start_idx && id <= otherdb_end_idx
+            c << " otherdb"
+        elsif id <= first_set_max_id
+            c << " old"
+        else
+            c << " new"
+        end
+
+        # Add class if exists
+        if id >= otherdb_start_idx && id <= otherdb_end_idx
+            r.select(1)
+            exists = r.exists(id)
+            r.select(0)
+        else
+            exists = r.exists(id)
+        end
+
+        c << " ex" if exists
+        html << "<div title=\"#{id}\" class=\"#{c}\"></div>"
+    }
+
+    # Close HTML page
+
+    html << <<EOF
+    </body>
+    </html>
+EOF
+
+    f = File.open(filename,"w")
+    f.write(html)
+    f.close
+end
+
+def print_avg
+    avg = ($runs.reduce {|a,b| a+b}) / $runs.length
+    puts "#{$runs.length} runs, AVG is #{avg}"
+end
+
+if ARGV.length < 1
+    STDERR.puts "Usage: ruby test-lru.rb <html-output-filename> [--runs <count>] [--ttl]"
+    STDERR.puts "Options:"
+    STDERR.puts "  --runs <count>    Execute the test <count> times."
+    STDERR.puts "  --ttl             Set keys with increasing TTL values"
+    STDERR.puts "                    (starting from 1000 seconds) in order to"
+    STDERR.puts "                    test the volatile-lru policy."
+    exit 1
+end
+
+filename = ARGV[0]
+$o[:numruns] = 1
+
+# Options parsing
+i = 1
+while i < ARGV.length
+    if ARGV[i] == '--runs'
+        $o[:numruns] = ARGV[i+1].to_i
+        i+= 1
+    elsif ARGV[i] == '--ttl'
+        $o[:ttl] = true
+    else
+        STDERR.puts "Unknown option #{ARGV[i]}"
+        exit 1
+    end
+    i+= 1
+end
+
+$o[:numruns].times {
+    testit(filename)
+    print_avg if $o[:numruns] != 1
+}
diff --git a/redis-stable/utils/redis-copy.rb b/redis-stable/utils/redis-copy.rb
new file mode 100644
index 00000000..7c5c52dd
--- /dev/null
+++ b/redis-stable/utils/redis-copy.rb
@@ -0,0 +1,35 @@
+# redis-copy.rb - Copyright (C) 2009-2010 Salvatore Sanfilippo
+# BSD license, See the COPYING file for more information.
+#
+# Copy the whole dataset from one Redis instance to another one
+#
+# WARNING: this utility is deprecated and serves as a legacy adapter
+#          for the more-robust redis-copy gem.
+
+require 'shellwords'
+
+def redisCopy(opts={})
+  src = "#{opts[:srchost]}:#{opts[:srcport]}"
+  dst = "#{opts[:dsthost]}:#{opts[:dstport]}"
+  `redis-copy #{src.shellescape} #{dst.shellescape}`
+rescue Errno::ENOENT
+  $stderr.puts 'This utility requires the redis-copy executable',
+               'from the redis-copy gem on https://rubygems.org',
+               'To install it, run `gem install redis-copy`.'
+  exit 1
+end
+
+$stderr.puts "This utility is deprecated. Use the redis-copy gem instead."
+if ARGV.length != 4
+    puts "Usage: redis-copy.rb <srchost> <srcport> <dsthost> <dstport>"
+    exit 1
+end
+puts "WARNING: it's up to you to FLUSHDB the destination host before to continue, press any key when ready."
+STDIN.gets
+srchost = ARGV[0]
+srcport = ARGV[1]
+dsthost = ARGV[2]
+dstport = ARGV[3]
+puts "Copying #{srchost}:#{srcport} into #{dsthost}:#{dstport}"
+redisCopy(:srchost => srchost, :srcport => srcport.to_i,
+          :dsthost => dsthost, :dstport => dstport.to_i)
diff --git a/redis-stable/utils/redis-sha1.rb b/redis-stable/utils/redis-sha1.rb
new file mode 100644
index 00000000..24498e25
--- /dev/null
+++ b/redis-stable/utils/redis-sha1.rb
@@ -0,0 +1,52 @@
+# redis-sha1.rb - Copyright (C) 2009 Salvatore Sanfilippo
+# BSD license, See the COPYING file for more information.
+#
+# Performs the SHA1 sum of the whole datset.
+# This is useful to spot bugs in persistence related code and to make sure
+# Slaves and Masters are in SYNC.
+#
+# If you hack this code make sure to sort keys and set elements as this are
+# unsorted elements. Otherwise the sum may differ with equal dataset.
+
+require 'rubygems'
+require 'redis'
+require 'digest/sha1'
+
+def redisSha1(opts={})
+    sha1=""
+    r = Redis.new(opts)
+    r.keys('*').sort.each{|k|
+        vtype = r.type?(k)
+        if vtype == "string"
+            len = 1
+            sha1 = Digest::SHA1.hexdigest(sha1+k)
+            sha1 = Digest::SHA1.hexdigest(sha1+r.get(k))
+        elsif vtype == "list"
+            len = r.llen(k)
+            if len != 0
+                sha1 = Digest::SHA1.hexdigest(sha1+k)
+                sha1 = Digest::SHA1.hexdigest(sha1+r.list_range(k,0,-1).join("\x01"))
+            end
+        elsif vtype == "set"
+            len = r.scard(k)
+            if len != 0
+                sha1 = Digest::SHA1.hexdigest(sha1+k)
+                sha1 = Digest::SHA1.hexdigest(sha1+r.set_members(k).to_a.sort.join("\x02"))
+            end
+        elsif vtype == "zset"
+            len = r.zcard(k)
+            if len != 0
+                sha1 = Digest::SHA1.hexdigest(sha1+k)
+                sha1 = Digest::SHA1.hexdigest(sha1+r.zrange(k,0,-1).join("\x01"))
+            end
+        end
+        # puts "#{k} => #{sha1}" if len != 0
+    }
+    sha1
+end
+
+host = ARGV[0] || "127.0.0.1"
+port = ARGV[1] || "6379"
+db = ARGV[2] || "0"
+puts "Performing SHA1 of Redis server #{host} #{port} DB: #{db}"
+p "Dataset SHA1: #{redisSha1(:host => host, :port => port.to_i, :db => db)}"
diff --git a/redis-stable/utils/redis_init_script b/redis-stable/utils/redis_init_script
new file mode 100755
index 00000000..006db87e
--- /dev/null
+++ b/redis-stable/utils/redis_init_script
@@ -0,0 +1,50 @@
+#!/bin/sh
+#
+# Simple Redis init.d script conceived to work on Linux systems
+# as it does use of the /proc filesystem.
+
+### BEGIN INIT INFO
+# Provides:     redis_6379
+# Default-Start:        2 3 4 5
+# Default-Stop:         0 1 6
+# Short-Description:    Redis data structure server
+# Description:          Redis data structure server. See https://redis.io
+### END INIT INFO
+
+REDISPORT=6379
+EXEC=/usr/local/bin/redis-server
+CLIEXEC=/usr/local/bin/redis-cli
+
+PIDFILE=/var/run/redis_${REDISPORT}.pid
+CONF="/etc/redis/${REDISPORT}.conf"
+
+case "$1" in
+    start)
+        if [ -f $PIDFILE ]
+        then
+                echo "$PIDFILE exists, process is already running or crashed"
+        else
+                echo "Starting Redis server..."
+                $EXEC $CONF
+        fi
+        ;;
+    stop)
+        if [ ! -f $PIDFILE ]
+        then
+                echo "$PIDFILE does not exist, process is not running"
+        else
+                PID=$(cat $PIDFILE)
+                echo "Stopping ..."
+                $CLIEXEC -p $REDISPORT shutdown
+                while [ -x /proc/${PID} ]
+                do
+                    echo "Waiting for Redis to shutdown ..."
+                    sleep 1
+                done
+                echo "Redis stopped"
+        fi
+        ;;
+    *)
+        echo "Please use start or stop as first argument"
+        ;;
+esac
diff --git a/redis-stable/utils/redis_init_script.tpl b/redis-stable/utils/redis_init_script.tpl
new file mode 100755
index 00000000..2e5b6130
--- /dev/null
+++ b/redis-stable/utils/redis_init_script.tpl
@@ -0,0 +1,44 @@
+
+case "$1" in
+    start)
+        if [ -f $PIDFILE ]
+        then
+            echo "$PIDFILE exists, process is already running or crashed"
+        else
+            echo "Starting Redis server..."
+            $EXEC $CONF
+        fi
+        ;;
+    stop)
+        if [ ! -f $PIDFILE ]
+        then
+            echo "$PIDFILE does not exist, process is not running"
+        else
+            PID=$(cat $PIDFILE)
+            echo "Stopping ..."
+            $CLIEXEC -p $REDISPORT shutdown
+            while [ -x /proc/${PID} ]
+            do
+                echo "Waiting for Redis to shutdown ..."
+                sleep 1
+            done
+            echo "Redis stopped"
+        fi
+        ;;
+    status)
+        PID=$(cat $PIDFILE)
+        if [ ! -x /proc/${PID} ]
+        then
+            echo 'Redis is not running'
+        else
+            echo "Redis is running ($PID)"
+        fi
+        ;;
+    restart)
+        $0 stop
+        $0 start
+        ;;
+    *)
+        echo "Please use start, stop, restart or status as first argument"
+        ;;
+esac
diff --git a/redis-stable/utils/releasetools/01_create_tarball.sh b/redis-stable/utils/releasetools/01_create_tarball.sh
new file mode 100755
index 00000000..366a61e2
--- /dev/null
+++ b/redis-stable/utils/releasetools/01_create_tarball.sh
@@ -0,0 +1,14 @@
+#!/bin/sh
+if [ $# != "1" ]
+then
+    echo "Usage: ./utils/releasetools/01_create_tarball.sh <version_tag>"
+    exit 1
+fi
+
+TAG=$1
+TARNAME="redis-${TAG}.tar"
+echo "Generating /tmp/${TARNAME}"
+git archive $TAG --prefix redis-${TAG}/ > /tmp/$TARNAME || exit 1
+echo "Gizipping the archive"
+rm -f /tmp/$TARNAME.gz
+gzip -9 /tmp/$TARNAME
diff --git a/redis-stable/utils/releasetools/02_upload_tarball.sh b/redis-stable/utils/releasetools/02_upload_tarball.sh
new file mode 100755
index 00000000..ef1e777c
--- /dev/null
+++ b/redis-stable/utils/releasetools/02_upload_tarball.sh
@@ -0,0 +1,23 @@
+#!/bin/bash
+if [ $# != "1" ]
+then
+    echo "Usage: ./utils/releasetools/02_upload_tarball.sh <version_tag>"
+    exit 1
+fi
+
+echo "Uploading..."
+scp /tmp/redis-${1}.tar.gz ubuntu@host.redis.io:/var/www/download/releases/
+echo "Updating web site... "
+echo "Please check the github action tests for the release."
+echo "Press any key if it is a stable release, or Ctrl+C to abort"
+read x
+ssh ubuntu@host.redis.io "cd /var/www/download;
+                          rm -rf redis-${1}.tar.gz;
+                          wget http://download.redis.io/releases/redis-${1}.tar.gz;
+                          tar xvzf redis-${1}.tar.gz;
+                          rm -rf redis-stable;
+                          mv redis-${1} redis-stable;
+                          tar cvzf redis-stable.tar.gz redis-stable;
+                          rm -rf redis-${1}.tar.gz;
+                          shasum -a 256 redis-stable.tar.gz > redis-stable.tar.gz.SHA256SUM;
+                          "
diff --git a/redis-stable/utils/releasetools/03_test_release.sh b/redis-stable/utils/releasetools/03_test_release.sh
new file mode 100755
index 00000000..493d0b74
--- /dev/null
+++ b/redis-stable/utils/releasetools/03_test_release.sh
@@ -0,0 +1,28 @@
+#!/bin/sh
+set -e
+if [ $# != "1" ]
+then
+    echo "Usage: ./utils/releasetools/03_test_release.sh <version_tag>"
+    exit 1
+fi
+
+TAG=$1
+TARNAME="redis-${TAG}.tar.gz"
+DOWNLOADURL="http://download.redis.io/releases/${TARNAME}"
+
+echo "Doing sanity test on the actual tarball"
+
+cd /tmp
+rm -rf test_release_tmp_dir
+mkdir test_release_tmp_dir
+cd test_release_tmp_dir
+rm -f $TARNAME
+rm -rf redis-${TAG}
+wget $DOWNLOADURL
+tar xvzf $TARNAME
+cd redis-${TAG}
+make
+./runtest
+./runtest-sentinel
+./runtest-cluster
+./runtest-moduleapi
diff --git a/redis-stable/utils/releasetools/04_release_hash.sh b/redis-stable/utils/releasetools/04_release_hash.sh
new file mode 100755
index 00000000..d9329280
--- /dev/null
+++ b/redis-stable/utils/releasetools/04_release_hash.sh
@@ -0,0 +1,13 @@
+#!/bin/bash
+if [ $# != "1" ]
+then
+    echo "Usage: ./utils/releasetools/04_release_hash.sh <version_tag>"
+    exit 1
+fi
+
+SHA=$(curl -s http://download.redis.io/releases/redis-${1}.tar.gz | shasum -a 256 | cut -f 1 -d' ')
+ENTRY="hash redis-${1}.tar.gz sha256 $SHA http://download.redis.io/releases/redis-${1}.tar.gz"
+echo $ENTRY >> ../redis-hashes/README
+echo "Press any key to commit, Ctrl-C to abort)."
+read yes
+(cd ../redis-hashes; git commit -a -m "${1} hash."; git push)
diff --git a/redis-stable/utils/releasetools/changelog.tcl b/redis-stable/utils/releasetools/changelog.tcl
new file mode 100755
index 00000000..2288794b
--- /dev/null
+++ b/redis-stable/utils/releasetools/changelog.tcl
@@ -0,0 +1,35 @@
+#!/usr/bin/env tclsh
+
+if {[llength $::argv] != 2 && [llength $::argv] != 3} {
+    puts "Usage: $::argv0 <branch> <version> \[<num-commits>\]"
+    exit 1
+}
+
+set branch [lindex $::argv 0]
+set ver [lindex $::argv 1]
+if {[llength $::argv] == 3} {
+    set count [lindex ::$argv 2]
+} else {
+    set count 100
+}
+
+set template {
+================================================================================
+Redis %ver%     Released %date%
+================================================================================
+
+Upgrade urgency <URGENCY>: <DESCRIPTION>
+}
+
+set template [string trim $template]
+append template "\n\n"
+set date [clock format [clock seconds]]
+set template [string map [list %ver% $ver %date% $date] $template]
+
+append template [exec git log $branch~$count..$branch "--format=format:%an in commit %h:%n %s" --shortstat]
+
+#Older, more verbose version.
+#
+#append template [exec git log $branch~30..$branch "--format=format:+-------------------------------------------------------------------------------%n| %s%n| By %an, %ai%n+--------------------------------------------------------------------------------%nhttps://github.com/redis/redis/commit/%H%n%n%b" --stat]
+
+puts $template
diff --git a/redis-stable/utils/speed-regression.tcl b/redis-stable/utils/speed-regression.tcl
new file mode 100755
index 00000000..86a7d8d8
--- /dev/null
+++ b/redis-stable/utils/speed-regression.tcl
@@ -0,0 +1,130 @@
+#!/usr/bin/env tclsh8.5
+# Copyright (C) 2011 Salvatore Sanfilippo
+# Released under the BSD license like Redis itself
+
+source ../tests/support/redis.tcl
+set ::port 12123
+set ::tests {PING,SET,GET,INCR,LPUSH,LPOP,SADD,SPOP,LRANGE_100,LRANGE_600,MSET}
+set ::datasize 16
+set ::requests 100000
+
+proc run-tests branches {
+    set runs {}
+    set branch_id 0
+    foreach b $branches {
+        cd ../src
+        puts "Benchmarking $b"
+        exec -ignorestderr git checkout $b 2> /dev/null
+        exec -ignorestderr make clean 2> /dev/null
+        puts "  compiling..."
+        exec -ignorestderr make 2> /dev/null
+
+        if {$branch_id == 0} {
+            puts "  copy redis-benchmark from unstable to /tmp..."
+            exec -ignorestderr cp ./redis-benchmark /tmp
+            incr branch_id
+            continue
+        }
+
+        # Start the Redis server
+        puts "  starting the server... [exec ./redis-server -v]"
+        set pids [exec echo "port $::port\nloglevel warning\n" | ./redis-server - > /dev/null 2> /dev/null &]
+        puts "  pids: $pids"
+        after 1000
+        puts "  running the benchmark"
+
+        set r [redis 127.0.0.1 $::port]
+        set i [$r info]
+        puts "  redis INFO shows version: [lindex [split $i] 0]"
+        $r close
+
+        set output [exec /tmp/redis-benchmark -n $::requests -t $::tests -d $::datasize --csv -p $::port]
+        lappend runs $b $output
+        puts "  killing server..."
+        catch {exec kill -9 [lindex $pids 0]}
+        catch {exec kill -9 [lindex $pids 1]}
+        incr branch_id
+    }
+    return $runs
+}
+
+proc get-result-with-name {output name} {
+    foreach line [split $output "\n"] {
+        lassign [split $line ","] key value
+        set key [string tolower [string range $key 1 end-1]]
+        set value [string range $value 1 end-1]
+        if {$key eq [string tolower $name]} {
+            return $value
+        }
+    }
+    return "n/a"
+}
+
+proc get-test-names output {
+    set names {}
+    foreach line [split $output "\n"] {
+        lassign [split $line ","] key value
+        set key [string tolower [string range $key 1 end-1]]
+        lappend names $key
+    }
+    return $names
+}
+
+proc combine-results {results} {
+    set tests [get-test-names [lindex $results 1]]
+    foreach test $tests {
+        puts $test
+        foreach {branch output} $results {
+            puts [format "%-20s %s" \
+                $branch [get-result-with-name $output $test]]
+        }
+        puts {}
+    }
+}
+
+proc main {} {
+    # Note: the first branch is only used in order to get the redis-benchmark
+    # executable. Tests are performed starting from the second branch.
+    set branches {
+        slowset 2.2.0 2.4.0 unstable slowset
+    }
+    set results [run-tests $branches]
+    puts "\n"
+    puts "# Test results: datasize=$::datasize requests=$::requests"
+    puts [combine-results $results]
+}
+
+# Force the user to run the script from the 'utils' directory.
+if {![file exists speed-regression.tcl]} {
+    puts "Please make sure to run speed-regression.tcl while inside /utils."
+    puts "Example: cd utils; ./speed-regression.tcl"
+    exit 1
+}
+
+# Make sure there is not already a server runnign on port 12123
+set is_not_running [catch {set r [redis 127.0.0.1 $::port]}]
+if {!$is_not_running} {
+    puts "Sorry, you have a running server on port $::port"
+    exit 1
+}
+
+# parse arguments
+for {set j 0} {$j < [llength $argv]} {incr j} {
+    set opt [lindex $argv $j]
+    set arg [lindex $argv [expr $j+1]]
+    if {$opt eq {--tests}} {
+        set ::tests $arg
+        incr j
+    } elseif {$opt eq {--datasize}} {
+        set ::datasize $arg
+        incr j
+    } elseif {$opt eq {--requests}} {
+        set ::requests $arg
+        incr j
+    } else {
+        puts "Wrong argument: $opt"
+        exit 1
+    }
+}
+
+main
diff --git a/redis-stable/utils/srandmember/README.md b/redis-stable/utils/srandmember/README.md
new file mode 100644
index 00000000..d3da1e82
--- /dev/null
+++ b/redis-stable/utils/srandmember/README.md
@@ -0,0 +1,14 @@
+The utilities in this directory plot the distribution of SRANDMEMBER to
+evaluate how fair it is.
+
+See http://theshfl.com/redis_sets for more information on the topic that lead
+to such investigation fix.
+
+showdist.rb -- shows the distribution of the frequency elements are returned.
+               The x axis is the number of times elements were returned, and
+               the y axis is how many elements were returned with such
+               frequency.
+
+showfreq.rb -- shows the frequency each element was returned.
+               The x axis is the element number.
+               The y axis is the times it was returned.
diff --git a/redis-stable/utils/srandmember/showdist.rb b/redis-stable/utils/srandmember/showdist.rb
new file mode 100644
index 00000000..24358570
--- /dev/null
+++ b/redis-stable/utils/srandmember/showdist.rb
@@ -0,0 +1,33 @@
+require 'redis'
+
+r = Redis.new
+r.select(9)
+r.del("myset");
+r.sadd("myset",(0..999).to_a)
+freq = {}
+100.times {
+    res = r.pipelined {
+        1000.times {
+            r.srandmember("myset")
+        }
+    }
+    res.each{|ele|
+        freq[ele] = 0 if freq[ele] == nil
+        freq[ele] += 1
+    }
+}
+
+# Convert into frequency distribution
+dist = {}
+freq.each{|item,count|
+    dist[count] = 0 if dist[count] == nil
+    dist[count] += 1
+}
+
+min = dist.keys.min
+max = dist.keys.max
+(min..max).each{|x|
+    count = dist[x]
+    count = 0 if count == nil
+    puts "#{x} -> #{"*"*count}"
+}
diff --git a/redis-stable/utils/srandmember/showfreq.rb b/redis-stable/utils/srandmember/showfreq.rb
new file mode 100644
index 00000000..fd47bc0c
--- /dev/null
+++ b/redis-stable/utils/srandmember/showfreq.rb
@@ -0,0 +1,23 @@
+require 'redis'
+
+r = Redis.new
+r.select(9)
+r.del("myset");
+r.sadd("myset",(0..999).to_a)
+freq = {}
+500.times {
+    res = r.pipelined {
+        1000.times {
+            r.srandmember("myset")
+        }
+    }
+    res.each{|ele|
+        freq[ele] = 0 if freq[ele] == nil
+        freq[ele] += 1
+    }
+}
+
+# Print the frequency each element was yeld to process it with gnuplot
+freq.each{|item,count|
+    puts "#{item} #{count}"
+}
diff --git a/redis-stable/utils/systemd-redis_multiple_servers@.service b/redis-stable/utils/systemd-redis_multiple_servers@.service
new file mode 100644
index 00000000..108ccfc6
--- /dev/null
+++ b/redis-stable/utils/systemd-redis_multiple_servers@.service
@@ -0,0 +1,37 @@
+# example systemd template service unit file for multiple redis-servers
+#
+# You can use this file as a blueprint for your actual template service unit
+# file, if you intend to run multiple independent redis-server instances in
+# parallel using systemd's "template unit files" feature. If you do, you will
+# want to choose a better basename for your service unit by renaming this file
+# when copying it.
+#
+# Please take a look at the provided "systemd-redis_server.service" example
+# service unit file, too, if you choose to use this approach at managing
+# multiple redis-server instances via systemd.
+
+[Unit]
+Description=Redis data structure server - instance %i
+Documentation=https://redis.io/documentation
+# This template unit assumes your redis-server configuration file(s)
+# to live at /etc/redis/redis_server_<INSTANCE_NAME>.conf
+AssertPathExists=/etc/redis/redis_server_%i.conf
+#Before=your_application.service another_example_application.service
+#AssertPathExists=/var/lib/redis
+
+[Service]
+ExecStart=/usr/local/bin/redis-server /etc/redis/redis_server_%i.conf
+LimitNOFILE=10032
+NoNewPrivileges=yes
+#OOMScoreAdjust=-900
+#PrivateTmp=yes
+Type=notify
+TimeoutStartSec=infinity
+TimeoutStopSec=infinity
+UMask=0077
+#User=redis
+#Group=redis
+#WorkingDirectory=/var/lib/redis
+
+[Install]
+WantedBy=multi-user.target
diff --git a/redis-stable/utils/systemd-redis_server.service b/redis-stable/utils/systemd-redis_server.service
new file mode 100644
index 00000000..cf158644
--- /dev/null
+++ b/redis-stable/utils/systemd-redis_server.service
@@ -0,0 +1,43 @@
+# example systemd service unit file for redis-server
+#
+# In order to use this as a template for providing a redis service in your
+# environment, _at the very least_ make sure to adapt the redis configuration
+# file you intend to use as needed (make sure to set "supervised systemd"), and
+# to set sane TimeoutStartSec and TimeoutStopSec property values in the unit's
+# "[Service]" section to fit your needs.
+#
+# Some properties, such as User= and Group=, are highly desirable for virtually
+# all deployments of redis, but cannot be provided in a manner that fits all
+# expectable environments. Some of these properties have been commented out in
+# this example service unit file, but you are highly encouraged to set them to
+# fit your needs.
+#
+# Please refer to systemd.unit(5), systemd.service(5), and systemd.exec(5) for
+# more information.
+
+[Unit]
+Description=Redis data structure server
+Documentation=https://redis.io/documentation
+#Before=your_application.service another_example_application.service
+#AssertPathExists=/var/lib/redis
+Wants=network-online.target
+After=network-online.target
+
+[Service]
+ExecStart=/usr/local/bin/redis-server --supervised systemd --daemonize no
+## Alternatively, have redis-server load a configuration file:
+#ExecStart=/usr/local/bin/redis-server /path/to/your/redis.conf
+LimitNOFILE=10032
+NoNewPrivileges=yes
+#OOMScoreAdjust=-900
+#PrivateTmp=yes
+Type=notify
+TimeoutStartSec=infinity
+TimeoutStopSec=infinity
+UMask=0077
+#User=redis
+#Group=redis
+#WorkingDirectory=/var/lib/redis
+
+[Install]
+WantedBy=multi-user.target
diff --git a/redis-stable/utils/tracking_collisions.c b/redis-stable/utils/tracking_collisions.c
new file mode 100644
index 00000000..cd64b36c
--- /dev/null
+++ b/redis-stable/utils/tracking_collisions.c
@@ -0,0 +1,76 @@
+/* This is a small program used in order to understand the collison rate
+ * of CRC64 (ISO version) VS other stronger hashing functions in the context
+ * of hashing keys for the Redis "tracking" feature (client side caching
+ * assisted by the server).
+ *
+ * The program attempts to hash keys with common names in the form of
+ *
+ *  prefix:<counter>
+ *
+ * And counts the resulting collisons generated in the 24 bits of output
+ * needed for the tracking feature invalidation table (16 millions + entries)
+ *
+ * Compile with:
+ *
+ *  cc -O2 ./tracking_collisions.c ../src/crc64.c ../src/sha1.c
+ *  ./a.out
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Copyright (C) 2019 Salvatore Sanfilippo
+ * This code is released under the BSD 2 clause license.
+ */
+
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+#include <stdio.h>
+#include "../src/crc64.h"
+#include "../src/sha1.h"
+
+#define TABLE_SIZE (1<<24)
+int Table[TABLE_SIZE];
+
+uint64_t crc64Hash(char *key, size_t len) {
+    return crc64(0,(unsigned char*)key,len);
+}
+
+uint64_t sha1Hash(char *key, size_t len) {
+    SHA1_CTX ctx;
+    unsigned char hash[20];
+
+    SHA1Init(&ctx);
+    SHA1Update(&ctx,(unsigned char*)key,len);
+    SHA1Final(hash,&ctx);
+    uint64_t hash64;
+    memcpy(&hash64,hash,sizeof(hash64));
+    return hash64;
+}
+
+/* Test the hashing function provided as callback and return the
+ * number of collisions found. */
+unsigned long testHashingFunction(uint64_t (*hash)(char *, size_t)) {
+    unsigned long collisions = 0;
+    memset(Table,0,sizeof(Table));
+    char *prefixes[] = {"object", "message", "user", NULL};
+    for (int i = 0; prefixes[i] != NULL; i++) {
+        for (int j = 0; j < TABLE_SIZE/2; j++) {
+            char keyname[128];
+            size_t keylen = snprintf(keyname,sizeof(keyname),"%s:%d",
+                                     prefixes[i],j);
+            uint64_t bucket = hash(keyname,keylen) % TABLE_SIZE;
+            if (Table[bucket]) {
+                collisions++;
+            } else {
+                Table[bucket] = 1;
+            }
+        }
+    }
+    return collisions;
+}
+
+int main(void) {
+    printf("SHA1 : %lu\n", testHashingFunction(sha1Hash));
+    printf("CRC64: %lu\n", testHashingFunction(crc64Hash));
+    return 0;
+}
diff --git a/redis-stable/utils/whatisdoing.sh b/redis-stable/utils/whatisdoing.sh
new file mode 100755
index 00000000..68d7f7cc
--- /dev/null
+++ b/redis-stable/utils/whatisdoing.sh
@@ -0,0 +1,24 @@
+# This script is from http://poormansprofiler.org/
+#
+# NOTE: Instead of using this script, you should use the Redis
+# Software Watchdog, which provides a similar functionality but in
+# a more reliable / easy to use way.
+#
+# Check https://redis.io/topics/latency for more information.
+
+#!/bin/bash
+nsamples=1
+sleeptime=0
+pid=$(ps auxww | grep '[r]edis-server' | awk '{print $2}')
+
+for x in $(seq 1 $nsamples)
+  do
+    gdb -ex "set pagination 0" -ex "thread apply all bt" -batch -p $pid
+    sleep $sleeptime
+  done | \
+awk '
+  BEGIN { s = ""; } 
+  /Thread/ { print s; s = ""; } 
+  /^\#/ { if (s != "" ) { s = s "," $4} else { s = $4 } } 
+  END { print s }' | \
+sort | uniq -c | sort -r -n -k 1,1

From 76e4a345f5a17899e42df6f693eeb350716781ce Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 16 Oct 2021 10:19:46 -0300
Subject: [PATCH 02/34] first commit - job

---
 redis-stable.tar.gz                           |  Bin 0 -> 2527624 bytes
 .../.github/ISSUE_TEMPLATE/bug_report.md      |   24 -
 .../.github/ISSUE_TEMPLATE/crash_report.md    |   20 -
 .../.github/ISSUE_TEMPLATE/feature_request.md |   24 -
 .../.github/ISSUE_TEMPLATE/other_stuff.md     |    8 -
 .../.github/ISSUE_TEMPLATE/question.md        |   21 -
 redis-stable/.github/workflows/ci.yml         |   60 -
 redis-stable/.github/workflows/daily.yml      |  308 -
 redis-stable/.gitignore                       |   40 -
 redis-stable/00-RELEASENOTES                  |  692 --
 redis-stable/BUGS                             |    1 -
 redis-stable/CONDUCT                          |   96 -
 redis-stable/CONTRIBUTING                     |   74 -
 redis-stable/COPYING                          |   10 -
 redis-stable/INSTALL                          |    1 -
 redis-stable/MANIFESTO                        |  106 -
 redis-stable/Makefile                         |   11 -
 redis-stable/README.md                        |  487 -
 redis-stable/TLS.md                           |   87 -
 redis-stable/deps/Makefile                    |   94 -
 redis-stable/deps/README.md                   |   82 -
 redis-stable/deps/hdr_histogram/COPYING.txt   |  121 -
 redis-stable/deps/hdr_histogram/LICENSE.txt   |   41 -
 redis-stable/deps/hdr_histogram/Makefile      |   20 -
 redis-stable/deps/hdr_histogram/README.md     |   10 -
 redis-stable/deps/hdr_histogram/hdr_atomic.h  |  146 -
 .../deps/hdr_histogram/hdr_histogram.c        | 1155 --
 .../deps/hdr_histogram/hdr_histogram.h        |  509 -
 redis-stable/deps/hiredis/.gitignore          |    9 -
 redis-stable/deps/hiredis/.travis.yml         |  131 -
 redis-stable/deps/hiredis/CHANGELOG.md        |  345 -
 redis-stable/deps/hiredis/CMakeLists.txt      |  165 -
 redis-stable/deps/hiredis/COPYING             |   29 -
 redis-stable/deps/hiredis/Makefile            |  313 -
 redis-stable/deps/hiredis/README.md           |  658 --
 redis-stable/deps/hiredis/adapters/ae.h       |  130 -
 redis-stable/deps/hiredis/adapters/glib.h     |  156 -
 redis-stable/deps/hiredis/adapters/ivykis.h   |   84 -
 redis-stable/deps/hiredis/adapters/libev.h    |  179 -
 redis-stable/deps/hiredis/adapters/libevent.h |  175 -
 redis-stable/deps/hiredis/adapters/libuv.h    |  117 -
 redis-stable/deps/hiredis/adapters/macosx.h   |  115 -
 redis-stable/deps/hiredis/adapters/qt.h       |  135 -
 redis-stable/deps/hiredis/alloc.c             |   86 -
 redis-stable/deps/hiredis/alloc.h             |   91 -
 redis-stable/deps/hiredis/appveyor.yml        |   24 -
 redis-stable/deps/hiredis/async.c             |  887 --
 redis-stable/deps/hiredis/async.h             |  147 -
 redis-stable/deps/hiredis/async_private.h     |   75 -
 redis-stable/deps/hiredis/dict.c              |  352 -
 redis-stable/deps/hiredis/dict.h              |  126 -
 .../deps/hiredis/examples/CMakeLists.txt      |   49 -
 .../deps/hiredis/examples/example-ae.c        |   62 -
 .../deps/hiredis/examples/example-glib.c      |   73 -
 .../deps/hiredis/examples/example-ivykis.c    |   60 -
 .../deps/hiredis/examples/example-libev.c     |   54 -
 .../hiredis/examples/example-libevent-ssl.c   |   90 -
 .../deps/hiredis/examples/example-libevent.c  |   67 -
 .../deps/hiredis/examples/example-libuv.c     |   56 -
 .../deps/hiredis/examples/example-macosx.c    |   66 -
 .../deps/hiredis/examples/example-push.c      |  160 -
 .../deps/hiredis/examples/example-qt.cpp      |   46 -
 .../deps/hiredis/examples/example-qt.h        |   32 -
 .../deps/hiredis/examples/example-ssl.c       |  110 -
 redis-stable/deps/hiredis/examples/example.c  |   91 -
 redis-stable/deps/hiredis/fmacros.h           |   12 -
 .../deps/hiredis/hiredis-config.cmake.in      |   13 -
 redis-stable/deps/hiredis/hiredis.c           | 1175 --
 redis-stable/deps/hiredis/hiredis.h           |  336 -
 redis-stable/deps/hiredis/hiredis.pc.in       |   12 -
 .../deps/hiredis/hiredis_ssl-config.cmake.in  |   13 -
 redis-stable/deps/hiredis/hiredis_ssl.h       |  127 -
 redis-stable/deps/hiredis/hiredis_ssl.pc.in   |   12 -
 redis-stable/deps/hiredis/net.c               |  612 --
 redis-stable/deps/hiredis/net.h               |   56 -
 redis-stable/deps/hiredis/read.c              |  739 --
 redis-stable/deps/hiredis/read.h              |  129 -
 redis-stable/deps/hiredis/sds.c               | 1289 ---
 redis-stable/deps/hiredis/sds.h               |  278 -
 redis-stable/deps/hiredis/sdsalloc.h          |   44 -
 redis-stable/deps/hiredis/sdscompat.h         |   94 -
 redis-stable/deps/hiredis/sockcompat.c        |  248 -
 redis-stable/deps/hiredis/sockcompat.h        |   92 -
 redis-stable/deps/hiredis/ssl.c               |  526 -
 redis-stable/deps/hiredis/test.c              | 1425 ---
 redis-stable/deps/hiredis/test.sh             |   78 -
 redis-stable/deps/hiredis/win32.h             |   56 -
 redis-stable/deps/jemalloc/.appveyor.yml      |   42 -
 redis-stable/deps/jemalloc/.autom4te.cfg      |    3 -
 redis-stable/deps/jemalloc/.gitattributes     |    1 -
 redis-stable/deps/jemalloc/.gitignore         |   93 -
 redis-stable/deps/jemalloc/.travis.yml        |  156 -
 redis-stable/deps/jemalloc/COPYING            |   27 -
 redis-stable/deps/jemalloc/ChangeLog          | 1382 ---
 redis-stable/deps/jemalloc/INSTALL.md         |  423 -
 redis-stable/deps/jemalloc/Makefile.in        |  569 -
 redis-stable/deps/jemalloc/README             |   20 -
 redis-stable/deps/jemalloc/TUNING.md          |  129 -
 redis-stable/deps/jemalloc/autogen.sh         |   17 -
 .../deps/jemalloc/bin/jemalloc-config.in      |   83 -
 redis-stable/deps/jemalloc/bin/jemalloc.sh.in |    9 -
 redis-stable/deps/jemalloc/bin/jeprof.in      | 5624 ----------
 .../deps/jemalloc/build-aux/config.guess      | 1462 ---
 .../deps/jemalloc/build-aux/config.sub        | 1825 ----
 .../deps/jemalloc/build-aux/install-sh        |  250 -
 redis-stable/deps/jemalloc/config.stamp.in    |    0
 redis-stable/deps/jemalloc/configure.ac       | 2294 ----
 redis-stable/deps/jemalloc/doc/html.xsl.in    |    5 -
 .../deps/jemalloc/doc/jemalloc.xml.in         | 3379 ------
 .../deps/jemalloc/doc/manpages.xsl.in         |    4 -
 redis-stable/deps/jemalloc/doc/stylesheet.xsl |   10 -
 .../include/jemalloc/internal/arena_externs.h |   94 -
 .../jemalloc/internal/arena_inlines_a.h       |   57 -
 .../jemalloc/internal/arena_inlines_b.h       |  354 -
 .../include/jemalloc/internal/arena_stats.h   |  237 -
 .../jemalloc/internal/arena_structs_a.h       |   11 -
 .../jemalloc/internal/arena_structs_b.h       |  229 -
 .../include/jemalloc/internal/arena_types.h   |   43 -
 .../include/jemalloc/internal/assert.h        |   56 -
 .../include/jemalloc/internal/atomic.h        |   77 -
 .../include/jemalloc/internal/atomic_c11.h    |   97 -
 .../jemalloc/internal/atomic_gcc_atomic.h     |  127 -
 .../jemalloc/internal/atomic_gcc_sync.h       |  191 -
 .../include/jemalloc/internal/atomic_msvc.h   |  158 -
 .../internal/background_thread_externs.h      |   33 -
 .../internal/background_thread_inlines.h      |   57 -
 .../internal/background_thread_structs.h      |   53 -
 .../include/jemalloc/internal/base_externs.h  |   22 -
 .../include/jemalloc/internal/base_inlines.h  |   13 -
 .../include/jemalloc/internal/base_structs.h  |   59 -
 .../include/jemalloc/internal/base_types.h    |   33 -
 .../jemalloc/include/jemalloc/internal/bin.h  |  106 -
 .../include/jemalloc/internal/bin_stats.h     |   51 -
 .../include/jemalloc/internal/bit_util.h      |  165 -
 .../include/jemalloc/internal/bitmap.h        |  369 -
 .../include/jemalloc/internal/cache_bin.h     |  114 -
 .../jemalloc/include/jemalloc/internal/ckh.h  |  101 -
 .../jemalloc/include/jemalloc/internal/ctl.h  |  131 -
 .../jemalloc/include/jemalloc/internal/div.h  |   41 -
 .../include/jemalloc/internal/emitter.h       |  435 -
 .../include/jemalloc/internal/extent_dss.h    |   26 -
 .../jemalloc/internal/extent_externs.h        |   73 -
 .../jemalloc/internal/extent_inlines.h        |  433 -
 .../include/jemalloc/internal/extent_mmap.h   |   10 -
 .../jemalloc/internal/extent_structs.h        |  219 -
 .../include/jemalloc/internal/extent_types.h  |   17 -
 .../jemalloc/include/jemalloc/internal/hash.h |  318 -
 .../include/jemalloc/internal/hooks.h         |   19 -
 .../internal/jemalloc_internal_decls.h        |   91 -
 .../internal/jemalloc_internal_defs.h.in      |  366 -
 .../internal/jemalloc_internal_externs.h      |   53 -
 .../internal/jemalloc_internal_includes.h     |   94 -
 .../internal/jemalloc_internal_inlines_a.h    |  172 -
 .../internal/jemalloc_internal_inlines_b.h    |   86 -
 .../internal/jemalloc_internal_inlines_c.h    |  257 -
 .../internal/jemalloc_internal_macros.h       |   43 -
 .../internal/jemalloc_internal_types.h        |  185 -
 .../jemalloc/internal/jemalloc_preamble.h.in  |  194 -
 .../include/jemalloc/internal/large_externs.h |   26 -
 .../jemalloc/include/jemalloc/internal/log.h  |  115 -
 .../include/jemalloc/internal/malloc_io.h     |  102 -
 .../include/jemalloc/internal/mutex.h         |  248 -
 .../include/jemalloc/internal/mutex_pool.h    |   94 -
 .../include/jemalloc/internal/mutex_prof.h    |   99 -
 .../include/jemalloc/internal/nstime.h        |   34 -
 .../include/jemalloc/internal/pages.h         |   88 -
 .../jemalloc/include/jemalloc/internal/ph.h   |  391 -
 .../jemalloc/internal/private_namespace.sh    |    5 -
 .../jemalloc/internal/private_symbols.sh      |   51 -
 .../jemalloc/include/jemalloc/internal/prng.h |  185 -
 .../include/jemalloc/internal/prof_externs.h  |   92 -
 .../jemalloc/internal/prof_inlines_a.h        |   83 -
 .../jemalloc/internal/prof_inlines_b.h        |  206 -
 .../include/jemalloc/internal/prof_structs.h  |  201 -
 .../include/jemalloc/internal/prof_types.h    |   56 -
 .../jemalloc/internal/public_namespace.sh     |    6 -
 .../jemalloc/internal/public_unnamespace.sh   |    6 -
 .../jemalloc/include/jemalloc/internal/ql.h   |   88 -
 .../jemalloc/include/jemalloc/internal/qr.h   |   72 -
 .../jemalloc/include/jemalloc/internal/rb.h   | 1006 --
 .../include/jemalloc/internal/rtree.h         |  492 -
 .../include/jemalloc/internal/rtree_tsd.h     |   50 -
 .../include/jemalloc/internal/size_classes.sh |  361 -
 .../include/jemalloc/internal/smoothstep.h    |  232 -
 .../include/jemalloc/internal/smoothstep.sh   |  101 -
 .../jemalloc/include/jemalloc/internal/spin.h |   40 -
 .../include/jemalloc/internal/stats.h         |   30 -
 .../jemalloc/include/jemalloc/internal/sz.h   |  317 -
 .../jemalloc/internal/tcache_externs.h        |   55 -
 .../jemalloc/internal/tcache_inlines.h        |  223 -
 .../jemalloc/internal/tcache_structs.h        |   61 -
 .../include/jemalloc/internal/tcache_types.h  |   56 -
 .../include/jemalloc/internal/ticker.h        |   78 -
 .../jemalloc/include/jemalloc/internal/tsd.h  |  326 -
 .../include/jemalloc/internal/tsd_generic.h   |  157 -
 .../internal/tsd_malloc_thread_cleanup.h      |   60 -
 .../include/jemalloc/internal/tsd_tls.h       |   59 -
 .../include/jemalloc/internal/tsd_types.h     |   10 -
 .../include/jemalloc/internal/tsd_win.h       |  139 -
 .../jemalloc/include/jemalloc/internal/util.h |   67 -
 .../include/jemalloc/internal/witness.h       |  346 -
 .../jemalloc/include/jemalloc/jemalloc.sh     |   27 -
 .../include/jemalloc/jemalloc_defs.h.in       |   45 -
 .../include/jemalloc/jemalloc_macros.h.in     |  126 -
 .../include/jemalloc/jemalloc_mangle.sh       |   45 -
 .../include/jemalloc/jemalloc_protos.h.in     |   66 -
 .../include/jemalloc/jemalloc_rename.sh       |   22 -
 .../include/jemalloc/jemalloc_typedefs.h.in   |   77 -
 .../include/msvc_compat/C99/stdbool.h         |   20 -
 .../jemalloc/include/msvc_compat/C99/stdint.h |  247 -
 .../jemalloc/include/msvc_compat/strings.h    |   58 -
 .../include/msvc_compat/windows_extra.h       |    6 -
 redis-stable/deps/jemalloc/jemalloc.pc.in     |   12 -
 .../deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4 |  562 -
 redis-stable/deps/jemalloc/msvc/ReadMe.txt    |   23 -
 .../deps/jemalloc/msvc/jemalloc_vc2015.sln    |   63 -
 .../deps/jemalloc/msvc/jemalloc_vc2017.sln    |   63 -
 .../projects/vc2015/jemalloc/jemalloc.vcxproj |  348 -
 .../vc2015/jemalloc/jemalloc.vcxproj.filters  |  101 -
 .../vc2015/test_threads/test_threads.vcxproj  |  327 -
 .../test_threads/test_threads.vcxproj.filters |   26 -
 .../projects/vc2017/jemalloc/jemalloc.vcxproj |  347 -
 .../vc2017/jemalloc/jemalloc.vcxproj.filters  |  101 -
 .../vc2017/test_threads/test_threads.vcxproj  |  326 -
 .../test_threads/test_threads.vcxproj.filters |   26 -
 .../msvc/test_threads/test_threads.cpp        |   88 -
 .../jemalloc/msvc/test_threads/test_threads.h |    3 -
 .../msvc/test_threads/test_threads_main.cpp   |   11 -
 redis-stable/deps/jemalloc/run_tests.sh       |    1 -
 .../deps/jemalloc/scripts/gen_run_tests.py    |  112 -
 .../deps/jemalloc/scripts/gen_travis.py       |  107 -
 redis-stable/deps/jemalloc/src/arena.c        | 2043 ----
 .../deps/jemalloc/src/background_thread.c     |  915 --
 redis-stable/deps/jemalloc/src/base.c         |  514 -
 redis-stable/deps/jemalloc/src/bin.c          |   50 -
 redis-stable/deps/jemalloc/src/bitmap.c       |  121 -
 redis-stable/deps/jemalloc/src/ckh.c          |  569 -
 redis-stable/deps/jemalloc/src/ctl.c          | 2883 -----
 redis-stable/deps/jemalloc/src/div.c          |   55 -
 redis-stable/deps/jemalloc/src/extent.c       | 2177 ----
 redis-stable/deps/jemalloc/src/extent_dss.c   |  270 -
 redis-stable/deps/jemalloc/src/extent_mmap.c  |   42 -
 redis-stable/deps/jemalloc/src/hash.c         |    3 -
 redis-stable/deps/jemalloc/src/hooks.c        |   12 -
 redis-stable/deps/jemalloc/src/jemalloc.c     | 3335 ------
 .../deps/jemalloc/src/jemalloc_cpp.cpp        |  141 -
 redis-stable/deps/jemalloc/src/large.c        |  371 -
 redis-stable/deps/jemalloc/src/log.c          |   78 -
 redis-stable/deps/jemalloc/src/malloc_io.c    |  676 --
 redis-stable/deps/jemalloc/src/mutex.c        |  224 -
 redis-stable/deps/jemalloc/src/mutex_pool.c   |   18 -
 redis-stable/deps/jemalloc/src/nstime.c       |  170 -
 redis-stable/deps/jemalloc/src/pages.c        |  606 --
 redis-stable/deps/jemalloc/src/prng.c         |    3 -
 redis-stable/deps/jemalloc/src/prof.c         | 2473 -----
 redis-stable/deps/jemalloc/src/rtree.c        |  320 -
 redis-stable/deps/jemalloc/src/stats.c        | 1286 ---
 redis-stable/deps/jemalloc/src/sz.c           |  107 -
 redis-stable/deps/jemalloc/src/tcache.c       |  717 --
 redis-stable/deps/jemalloc/src/ticker.c       |    3 -
 redis-stable/deps/jemalloc/src/tsd.c          |  351 -
 redis-stable/deps/jemalloc/src/witness.c      |  100 -
 redis-stable/deps/jemalloc/src/zone.c         |  469 -
 .../jemalloc/test/include/test/SFMT-alti.h    |  186 -
 .../jemalloc/test/include/test/SFMT-params.h  |  132 -
 .../test/include/test/SFMT-params11213.h      |   81 -
 .../test/include/test/SFMT-params1279.h       |   81 -
 .../test/include/test/SFMT-params132049.h     |   81 -
 .../test/include/test/SFMT-params19937.h      |   81 -
 .../test/include/test/SFMT-params216091.h     |   81 -
 .../test/include/test/SFMT-params2281.h       |   81 -
 .../test/include/test/SFMT-params4253.h       |   81 -
 .../test/include/test/SFMT-params44497.h      |   81 -
 .../test/include/test/SFMT-params607.h        |   81 -
 .../test/include/test/SFMT-params86243.h      |   81 -
 .../jemalloc/test/include/test/SFMT-sse2.h    |  157 -
 .../deps/jemalloc/test/include/test/SFMT.h    |  146 -
 .../deps/jemalloc/test/include/test/btalloc.h |   30 -
 .../jemalloc/test/include/test/extent_hooks.h |  289 -
 .../test/include/test/jemalloc_test.h.in      |  173 -
 .../test/include/test/jemalloc_test_defs.h.in |    9 -
 .../deps/jemalloc/test/include/test/math.h    |  306 -
 .../deps/jemalloc/test/include/test/mq.h      |  107 -
 .../deps/jemalloc/test/include/test/mtx.h     |   23 -
 .../deps/jemalloc/test/include/test/test.h    |  338 -
 .../deps/jemalloc/test/include/test/thd.h     |    9 -
 .../deps/jemalloc/test/include/test/timer.h   |   11 -
 .../jemalloc/test/integration/MALLOCX_ARENA.c |   66 -
 .../jemalloc/test/integration/aligned_alloc.c |  133 -
 .../jemalloc/test/integration/allocated.c     |  124 -
 .../deps/jemalloc/test/integration/extent.c   |  248 -
 .../deps/jemalloc/test/integration/extent.sh  |    5 -
 .../deps/jemalloc/test/integration/mallocx.c  |  228 -
 .../deps/jemalloc/test/integration/mallocx.sh |    5 -
 .../deps/jemalloc/test/integration/overflow.c |   46 -
 .../test/integration/posix_memalign.c         |  127 -
 .../deps/jemalloc/test/integration/rallocx.c  |  245 -
 .../deps/jemalloc/test/integration/sdallocx.c |   55 -
 .../jemalloc/test/integration/thread_arena.c  |   86 -
 .../test/integration/thread_tcache_enabled.c  |   87 -
 .../deps/jemalloc/test/integration/xallocx.c  |  384 -
 .../deps/jemalloc/test/integration/xallocx.sh |    5 -
 redis-stable/deps/jemalloc/test/src/SFMT.c    |  719 --
 redis-stable/deps/jemalloc/test/src/btalloc.c |    6 -
 .../deps/jemalloc/test/src/btalloc_0.c        |    3 -
 .../deps/jemalloc/test/src/btalloc_1.c        |    3 -
 redis-stable/deps/jemalloc/test/src/math.c    |    2 -
 redis-stable/deps/jemalloc/test/src/mq.c      |   27 -
 redis-stable/deps/jemalloc/test/src/mtx.c     |   68 -
 redis-stable/deps/jemalloc/test/src/test.c    |  217 -
 redis-stable/deps/jemalloc/test/src/thd.c     |   34 -
 redis-stable/deps/jemalloc/test/src/timer.c   |   56 -
 .../deps/jemalloc/test/stress/microbench.c    |  165 -
 redis-stable/deps/jemalloc/test/test.sh.in    |   80 -
 redis-stable/deps/jemalloc/test/unit/SFMT.c   | 1599 ---
 redis-stable/deps/jemalloc/test/unit/a0.c     |   16 -
 .../deps/jemalloc/test/unit/arena_reset.c     |  344 -
 .../jemalloc/test/unit/arena_reset_prof.c     |    4 -
 .../jemalloc/test/unit/arena_reset_prof.sh    |    3 -
 redis-stable/deps/jemalloc/test/unit/atomic.c |  229 -
 .../jemalloc/test/unit/background_thread.c    |  119 -
 .../test/unit/background_thread_enable.c      |   83 -
 redis-stable/deps/jemalloc/test/unit/base.c   |  234 -
 .../deps/jemalloc/test/unit/bit_util.c        |   57 -
 redis-stable/deps/jemalloc/test/unit/bitmap.c |  431 -
 redis-stable/deps/jemalloc/test/unit/ckh.c    |  211 -
 redis-stable/deps/jemalloc/test/unit/decay.c  |  599 --
 redis-stable/deps/jemalloc/test/unit/decay.sh |    3 -
 redis-stable/deps/jemalloc/test/unit/div.c    |   29 -
 .../deps/jemalloc/test/unit/emitter.c         |  413 -
 .../deps/jemalloc/test/unit/extent_quantize.c |  141 -
 redis-stable/deps/jemalloc/test/unit/fork.c   |  141 -
 redis-stable/deps/jemalloc/test/unit/hash.c   |  173 -
 redis-stable/deps/jemalloc/test/unit/hooks.c  |   38 -
 redis-stable/deps/jemalloc/test/unit/junk.c   |  141 -
 redis-stable/deps/jemalloc/test/unit/junk.sh  |    5 -
 .../deps/jemalloc/test/unit/junk_alloc.c      |    1 -
 .../deps/jemalloc/test/unit/junk_alloc.sh     |    5 -
 .../deps/jemalloc/test/unit/junk_free.c       |    1 -
 .../deps/jemalloc/test/unit/junk_free.sh      |    5 -
 redis-stable/deps/jemalloc/test/unit/log.c    |  193 -
 .../deps/jemalloc/test/unit/mallctl.c         |  805 --
 .../deps/jemalloc/test/unit/malloc_io.c       |  258 -
 redis-stable/deps/jemalloc/test/unit/math.c   |  390 -
 redis-stable/deps/jemalloc/test/unit/mq.c     |   89 -
 redis-stable/deps/jemalloc/test/unit/mtx.c    |   57 -
 redis-stable/deps/jemalloc/test/unit/nstime.c |  249 -
 redis-stable/deps/jemalloc/test/unit/pack.c   |  166 -
 redis-stable/deps/jemalloc/test/unit/pack.sh  |    4 -
 redis-stable/deps/jemalloc/test/unit/pages.c  |   29 -
 redis-stable/deps/jemalloc/test/unit/ph.c     |  318 -
 redis-stable/deps/jemalloc/test/unit/prng.c   |  237 -
 .../deps/jemalloc/test/unit/prof_accum.c      |   81 -
 .../deps/jemalloc/test/unit/prof_accum.sh     |    5 -
 .../deps/jemalloc/test/unit/prof_active.c     |  117 -
 .../deps/jemalloc/test/unit/prof_active.sh    |    5 -
 .../deps/jemalloc/test/unit/prof_gdump.c      |   74 -
 .../deps/jemalloc/test/unit/prof_gdump.sh     |    6 -
 .../deps/jemalloc/test/unit/prof_idump.c      |   42 -
 .../deps/jemalloc/test/unit/prof_idump.sh     |    8 -
 .../deps/jemalloc/test/unit/prof_reset.c      |  286 -
 .../deps/jemalloc/test/unit/prof_reset.sh     |    5 -
 .../deps/jemalloc/test/unit/prof_tctx.c       |   46 -
 .../deps/jemalloc/test/unit/prof_tctx.sh      |    5 -
 .../jemalloc/test/unit/prof_thread_name.c     |  120 -
 .../jemalloc/test/unit/prof_thread_name.sh    |    5 -
 redis-stable/deps/jemalloc/test/unit/ql.c     |  204 -
 redis-stable/deps/jemalloc/test/unit/qr.c     |  243 -
 redis-stable/deps/jemalloc/test/unit/rb.c     |  355 -
 .../deps/jemalloc/test/unit/retained.c        |  181 -
 redis-stable/deps/jemalloc/test/unit/rtree.c  |  227 -
 .../deps/jemalloc/test/unit/size_classes.c    |  183 -
 redis-stable/deps/jemalloc/test/unit/slab.c   |   32 -
 .../deps/jemalloc/test/unit/smoothstep.c      |  102 -
 redis-stable/deps/jemalloc/test/unit/spin.c   |   18 -
 redis-stable/deps/jemalloc/test/unit/stats.c  |  368 -
 .../deps/jemalloc/test/unit/stats_print.c     |  999 --
 redis-stable/deps/jemalloc/test/unit/ticker.c |   73 -
 redis-stable/deps/jemalloc/test/unit/tsd.c    |  139 -
 .../deps/jemalloc/test/unit/witness.c         |  280 -
 redis-stable/deps/jemalloc/test/unit/zero.c   |   59 -
 redis-stable/deps/jemalloc/test/unit/zero.sh  |    5 -
 redis-stable/deps/linenoise/.gitignore        |    3 -
 redis-stable/deps/linenoise/Makefile          |   21 -
 redis-stable/deps/linenoise/README.markdown   |  247 -
 redis-stable/deps/linenoise/example.c         |   79 -
 redis-stable/deps/linenoise/linenoise.c       | 1225 ---
 redis-stable/deps/linenoise/linenoise.h       |   75 -
 redis-stable/deps/lua/COPYRIGHT               |   34 -
 redis-stable/deps/lua/HISTORY                 |  183 -
 redis-stable/deps/lua/INSTALL                 |   99 -
 redis-stable/deps/lua/Makefile                |  128 -
 redis-stable/deps/lua/README                  |   37 -
 redis-stable/deps/lua/doc/contents.html       |  497 -
 redis-stable/deps/lua/doc/cover.png           |  Bin 3305 -> 0 bytes
 redis-stable/deps/lua/doc/logo.gif            |  Bin 4232 -> 0 bytes
 redis-stable/deps/lua/doc/lua.1               |  163 -
 redis-stable/deps/lua/doc/lua.css             |   83 -
 redis-stable/deps/lua/doc/lua.html            |  172 -
 redis-stable/deps/lua/doc/luac.1              |  136 -
 redis-stable/deps/lua/doc/luac.html           |  145 -
 redis-stable/deps/lua/doc/manual.css          |   24 -
 redis-stable/deps/lua/doc/manual.html         | 8804 ---------------
 redis-stable/deps/lua/doc/readme.html         |   40 -
 redis-stable/deps/lua/etc/Makefile            |   44 -
 redis-stable/deps/lua/etc/README              |   37 -
 redis-stable/deps/lua/etc/all.c               |   38 -
 redis-stable/deps/lua/etc/lua.hpp             |    9 -
 redis-stable/deps/lua/etc/lua.ico             |  Bin 1078 -> 0 bytes
 redis-stable/deps/lua/etc/lua.pc              |   31 -
 redis-stable/deps/lua/etc/luavs.bat           |   28 -
 redis-stable/deps/lua/etc/min.c               |   39 -
 redis-stable/deps/lua/etc/noparser.c          |   50 -
 redis-stable/deps/lua/etc/strict.lua          |   41 -
 redis-stable/deps/lua/src/Makefile            |  183 -
 redis-stable/deps/lua/src/fpconv.c            |  205 -
 redis-stable/deps/lua/src/fpconv.h            |   22 -
 redis-stable/deps/lua/src/lapi.c              | 1087 --
 redis-stable/deps/lua/src/lapi.h              |   16 -
 redis-stable/deps/lua/src/lauxlib.c           |  652 --
 redis-stable/deps/lua/src/lauxlib.h           |  174 -
 redis-stable/deps/lua/src/lbaselib.c          |  653 --
 redis-stable/deps/lua/src/lcode.c             |  831 --
 redis-stable/deps/lua/src/lcode.h             |   76 -
 redis-stable/deps/lua/src/ldblib.c            |  398 -
 redis-stable/deps/lua/src/ldebug.c            |  638 --
 redis-stable/deps/lua/src/ldebug.h            |   33 -
 redis-stable/deps/lua/src/ldo.c               |  519 -
 redis-stable/deps/lua/src/ldo.h               |   57 -
 redis-stable/deps/lua/src/ldump.c             |  164 -
 redis-stable/deps/lua/src/lfunc.c             |  174 -
 redis-stable/deps/lua/src/lfunc.h             |   34 -
 redis-stable/deps/lua/src/lgc.c               |  710 --
 redis-stable/deps/lua/src/lgc.h               |  110 -
 redis-stable/deps/lua/src/linit.c             |   38 -
 redis-stable/deps/lua/src/liolib.c            |  556 -
 redis-stable/deps/lua/src/llex.c              |  463 -
 redis-stable/deps/lua/src/llex.h              |   81 -
 redis-stable/deps/lua/src/llimits.h           |  128 -
 redis-stable/deps/lua/src/lmathlib.c          |  263 -
 redis-stable/deps/lua/src/lmem.c              |   86 -
 redis-stable/deps/lua/src/lmem.h              |   49 -
 redis-stable/deps/lua/src/loadlib.c           |  666 --
 redis-stable/deps/lua/src/lobject.c           |  214 -
 redis-stable/deps/lua/src/lobject.h           |  381 -
 redis-stable/deps/lua/src/lopcodes.c          |  102 -
 redis-stable/deps/lua/src/lopcodes.h          |  268 -
 redis-stable/deps/lua/src/loslib.c            |  243 -
 redis-stable/deps/lua/src/lparser.c           | 1339 ---
 redis-stable/deps/lua/src/lparser.h           |   82 -
 redis-stable/deps/lua/src/lstate.c            |  214 -
 redis-stable/deps/lua/src/lstate.h            |  169 -
 redis-stable/deps/lua/src/lstring.c           |  111 -
 redis-stable/deps/lua/src/lstring.h           |   31 -
 redis-stable/deps/lua/src/lstrlib.c           |  871 --
 redis-stable/deps/lua/src/ltable.c            |  588 -
 redis-stable/deps/lua/src/ltable.h            |   40 -
 redis-stable/deps/lua/src/ltablib.c           |  287 -
 redis-stable/deps/lua/src/ltm.c               |   75 -
 redis-stable/deps/lua/src/ltm.h               |   54 -
 redis-stable/deps/lua/src/lua.c               |  392 -
 redis-stable/deps/lua/src/lua.h               |  388 -
 redis-stable/deps/lua/src/lua_bit.c           |  189 -
 redis-stable/deps/lua/src/lua_cjson.c         | 1427 ---
 redis-stable/deps/lua/src/lua_cmsgpack.c      |  977 --
 redis-stable/deps/lua/src/lua_struct.c        |  429 -
 redis-stable/deps/lua/src/luac.c              |  200 -
 redis-stable/deps/lua/src/luaconf.h           |  763 --
 redis-stable/deps/lua/src/lualib.h            |   53 -
 redis-stable/deps/lua/src/lundump.c           |  227 -
 redis-stable/deps/lua/src/lundump.h           |   36 -
 redis-stable/deps/lua/src/lvm.c               |  767 --
 redis-stable/deps/lua/src/lvm.h               |   36 -
 redis-stable/deps/lua/src/lzio.c              |   82 -
 redis-stable/deps/lua/src/lzio.h              |   67 -
 redis-stable/deps/lua/src/print.c             |  227 -
 redis-stable/deps/lua/src/strbuf.c            |  251 -
 redis-stable/deps/lua/src/strbuf.h            |  154 -
 redis-stable/deps/lua/test/README             |   26 -
 redis-stable/deps/lua/test/bisect.lua         |   27 -
 redis-stable/deps/lua/test/cf.lua             |   16 -
 redis-stable/deps/lua/test/echo.lua           |    5 -
 redis-stable/deps/lua/test/env.lua            |    7 -
 redis-stable/deps/lua/test/factorial.lua      |   32 -
 redis-stable/deps/lua/test/fib.lua            |   40 -
 redis-stable/deps/lua/test/fibfor.lua         |   13 -
 redis-stable/deps/lua/test/globals.lua        |   13 -
 redis-stable/deps/lua/test/hello.lua          |    3 -
 redis-stable/deps/lua/test/life.lua           |  111 -
 redis-stable/deps/lua/test/luac.lua           |    7 -
 redis-stable/deps/lua/test/printf.lua         |    7 -
 redis-stable/deps/lua/test/readonly.lua       |   12 -
 redis-stable/deps/lua/test/sieve.lua          |   29 -
 redis-stable/deps/lua/test/sort.lua           |   66 -
 redis-stable/deps/lua/test/table.lua          |   12 -
 redis-stable/deps/lua/test/trace-calls.lua    |   32 -
 redis-stable/deps/lua/test/trace-globals.lua  |   38 -
 redis-stable/deps/lua/test/xd.lua             |   14 -
 redis-stable/deps/update-jemalloc.sh          |    9 -
 redis-stable/redis.conf                       | 2051 ----
 redis-stable/runtest                          |   14 -
 redis-stable/runtest-cluster                  |   14 -
 redis-stable/runtest-moduleapi                |   39 -
 redis-stable/runtest-sentinel                 |   14 -
 redis-stable/sentinel.conf                    |  341 -
 redis-stable/src/.gitignore                   |    5 -
 redis-stable/src/Makefile                     |  443 -
 redis-stable/src/acl.c                        | 2292 ----
 redis-stable/src/adlist.c                     |  378 -
 redis-stable/src/adlist.h                     |   96 -
 redis-stable/src/ae.c                         |  503 -
 redis-stable/src/ae.h                         |  135 -
 redis-stable/src/ae_epoll.c                   |  136 -
 redis-stable/src/ae_evport.c                  |  323 -
 redis-stable/src/ae_kqueue.c                  |  187 -
 redis-stable/src/ae_select.c                  |  106 -
 redis-stable/src/anet.c                       |  595 --
 redis-stable/src/anet.h                       |   76 -
 redis-stable/src/aof.c                        | 2010 ----
 redis-stable/src/asciilogo.h                  |   47 -
 redis-stable/src/atomicvar.h                  |  158 -
 redis-stable/src/bio.c                        |  309 -
 redis-stable/src/bio.h                        |   51 -
 redis-stable/src/bitops.c                     | 1165 --
 redis-stable/src/blocked.c                    |  768 --
 redis-stable/src/childinfo.c                  |  173 -
 redis-stable/src/cli_common.c                 |  194 -
 redis-stable/src/cli_common.h                 |   50 -
 redis-stable/src/cluster.c                    | 6032 -----------
 redis-stable/src/cluster.h                    |  296 -
 redis-stable/src/config.c                     | 2624 -----
 redis-stable/src/config.h                     |  267 -
 redis-stable/src/connection.c                 |  433 -
 redis-stable/src/connection.h                 |  237 -
 redis-stable/src/connhelpers.h                |   88 -
 redis-stable/src/crc16.c                      |   88 -
 redis-stable/src/crc16_slottable.h            |  835 --
 redis-stable/src/crc64.c                      |  161 -
 redis-stable/src/crc64.h                      |   13 -
 redis-stable/src/crcspeed.c                   |  282 -
 redis-stable/src/crcspeed.h                   |   60 -
 redis-stable/src/db.c                         | 2009 ----
 redis-stable/src/debug.c                      | 1988 ----
 redis-stable/src/debugmacro.h                 |   41 -
 redis-stable/src/defrag.c                     | 1215 ---
 redis-stable/src/dict.c                       | 1315 ---
 redis-stable/src/dict.h                       |  208 -
 redis-stable/src/endianconv.c                 |  129 -
 redis-stable/src/endianconv.h                 |   78 -
 redis-stable/src/evict.c                      |  710 --
 redis-stable/src/expire.c                     |  612 --
 redis-stable/src/fmacros.h                    |   66 -
 redis-stable/src/geo.c                        |  998 --
 redis-stable/src/geo.h                        |   22 -
 redis-stable/src/geohash.c                    |  299 -
 redis-stable/src/geohash.h                    |  137 -
 redis-stable/src/geohash_helper.c             |  263 -
 redis-stable/src/geohash_helper.h             |   66 -
 redis-stable/src/gopher.c                     |   97 -
 redis-stable/src/help.h                       | 1438 ---
 redis-stable/src/hyperloglog.c                | 1595 ---
 redis-stable/src/intset.c                     |  547 -
 redis-stable/src/intset.h                     |   55 -
 redis-stable/src/latency.c                    |  658 --
 redis-stable/src/latency.h                    |   94 -
 redis-stable/src/lazyfree.c                   |  231 -
 redis-stable/src/listpack.c                   |  965 --
 redis-stable/src/listpack.h                   |   66 -
 redis-stable/src/listpack_malloc.h            |   46 -
 redis-stable/src/localtime.c                  |  123 -
 redis-stable/src/lolwut.c                     |  188 -
 redis-stable/src/lolwut.h                     |   55 -
 redis-stable/src/lolwut5.c                    |  177 -
 redis-stable/src/lolwut6.c                    |  201 -
 redis-stable/src/lzf.h                        |  100 -
 redis-stable/src/lzfP.h                       |  189 -
 redis-stable/src/lzf_c.c                      |  291 -
 redis-stable/src/lzf_d.c                      |  191 -
 redis-stable/src/memtest.c                    |  365 -
 redis-stable/src/mkreleasehdr.sh              |   14 -
 redis-stable/src/module.c                     | 9506 -----------------
 redis-stable/src/modules/.gitignore           |    2 -
 redis-stable/src/modules/Makefile             |   62 -
 redis-stable/src/modules/gendoc.rb            |  174 -
 redis-stable/src/modules/helloacl.c           |  191 -
 redis-stable/src/modules/helloblock.c         |  219 -
 redis-stable/src/modules/hellocluster.c       |  118 -
 redis-stable/src/modules/hellodict.c          |  132 -
 redis-stable/src/modules/hellohook.c          |   93 -
 redis-stable/src/modules/hellotimer.c         |   76 -
 redis-stable/src/modules/hellotype.c          |  362 -
 redis-stable/src/modules/helloworld.c         |  621 --
 redis-stable/src/monotonic.c                  |  170 -
 redis-stable/src/monotonic.h                  |   52 -
 redis-stable/src/mt19937-64.c                 |  187 -
 redis-stable/src/mt19937-64.h                 |   87 -
 redis-stable/src/multi.c                      |  439 -
 redis-stable/src/networking.c                 | 3772 -------
 redis-stable/src/notify.c                     |  142 -
 redis-stable/src/object.c                     | 1472 ---
 redis-stable/src/pqsort.c                     |  185 -
 redis-stable/src/pqsort.h                     |   40 -
 redis-stable/src/pubsub.c                     |  469 -
 redis-stable/src/quicklist.c                  | 2785 -----
 redis-stable/src/quicklist.h                  |  209 -
 redis-stable/src/rand.c                       |   93 -
 redis-stable/src/rand.h                       |   38 -
 redis-stable/src/rax.c                        | 1948 ----
 redis-stable/src/rax.h                        |  216 -
 redis-stable/src/rax_malloc.h                 |   44 -
 redis-stable/src/rdb.c                        | 3070 ------
 redis-stable/src/rdb.h                        |  170 -
 redis-stable/src/redis-benchmark.c            | 1982 ----
 redis-stable/src/redis-check-aof.c            |  235 -
 redis-stable/src/redis-check-rdb.c            |  395 -
 redis-stable/src/redis-cli.c                  | 8472 ---------------
 redis-stable/src/redis-trib.rb                |  129 -
 redis-stable/src/redisassert.h                |   49 -
 redis-stable/src/redismodule.h                | 1137 --
 redis-stable/src/release.c                    |   66 -
 redis-stable/src/replication.c                | 3790 -------
 redis-stable/src/rio.c                        |  448 -
 redis-stable/src/rio.h                        |  178 -
 redis-stable/src/scripting.c                  | 2835 -----
 redis-stable/src/sds.c                        | 1462 ---
 redis-stable/src/sds.h                        |  284 -
 redis-stable/src/sdsalloc.h                   |   54 -
 redis-stable/src/sentinel.c                   | 5112 ---------
 redis-stable/src/server.c                     | 6406 -----------
 redis-stable/src/server.h                     | 2759 -----
 redis-stable/src/setcpuaffinity.c             |  155 -
 redis-stable/src/setproctitle.c               |  331 -
 redis-stable/src/sha1.c                       |  228 -
 redis-stable/src/sha1.h                       |   24 -
 redis-stable/src/sha256.c                     |  158 -
 redis-stable/src/sha256.h                     |   35 -
 redis-stable/src/siphash.c                    |  361 -
 redis-stable/src/slowlog.c                    |  196 -
 redis-stable/src/slowlog.h                    |   54 -
 redis-stable/src/solarisfixes.h               |   54 -
 redis-stable/src/sort.c                       |  597 --
 redis-stable/src/sparkline.c                  |  176 -
 redis-stable/src/sparkline.h                  |   56 -
 redis-stable/src/stream.h                     |  132 -
 redis-stable/src/syncio.c                     |  145 -
 redis-stable/src/t_hash.c                     | 1209 ---
 redis-stable/src/t_list.c                     | 1032 --
 redis-stable/src/t_set.c                      | 1196 ---
 redis-stable/src/t_stream.c                   | 3668 -------
 redis-stable/src/t_string.c                   |  956 --
 redis-stable/src/t_zset.c                     | 4233 --------
 redis-stable/src/testhelp.h                   |   57 -
 redis-stable/src/timeout.c                    |  190 -
 redis-stable/src/tls.c                        | 1021 --
 redis-stable/src/tracking.c                   |  604 --
 redis-stable/src/util.c                       |  959 --
 redis-stable/src/util.h                       |   72 -
 redis-stable/src/valgrind.sup                 |   26 -
 redis-stable/src/version.h                    |    2 -
 redis-stable/src/ziplist.c                    | 2582 -----
 redis-stable/src/ziplist.h                    |   74 -
 redis-stable/src/zipmap.c                     |  542 -
 redis-stable/src/zipmap.h                     |   54 -
 redis-stable/src/zmalloc.c                    |  699 --
 redis-stable/src/zmalloc.h                    |  141 -
 .../tests/assets/corrupt_empty_keys.rdb       |  Bin 261 -> 0 bytes
 redis-stable/tests/assets/corrupt_ziplist.rdb |  Bin 1415 -> 0 bytes
 redis-stable/tests/assets/default.conf        |   27 -
 redis-stable/tests/assets/encodings.rdb       |  Bin 667 -> 0 bytes
 redis-stable/tests/assets/hash-zipmap.rdb     |  Bin 35 -> 0 bytes
 redis-stable/tests/assets/minimal.conf        |    5 -
 redis-stable/tests/assets/nodefaultuser.acl   |    2 -
 redis-stable/tests/assets/user.acl            |    3 -
 redis-stable/tests/cluster/cluster.tcl        |  177 -
 redis-stable/tests/cluster/run.tcl            |   29 -
 redis-stable/tests/cluster/tests/00-base.tcl  |   59 -
 .../tests/cluster/tests/01-faildet.tcl        |   38 -
 .../tests/cluster/tests/02-failover.tcl       |   65 -
 .../tests/cluster/tests/03-failover-loop.tcl  |  115 -
 .../tests/cluster/tests/04-resharding.tcl     |  194 -
 .../cluster/tests/05-slave-selection.tcl      |  171 -
 .../cluster/tests/06-slave-stop-cond.tcl      |   73 -
 .../cluster/tests/07-replica-migration.tcl    |  103 -
 .../tests/cluster/tests/08-update-msg.tcl     |   90 -
 .../tests/cluster/tests/09-pubsub.tcl         |   40 -
 .../cluster/tests/10-manual-failover.tcl      |  192 -
 .../cluster/tests/11-manual-takeover.tcl      |   59 -
 .../cluster/tests/12-replica-migration-2.tcl  |   74 -
 .../tests/12.1-replica-migration-3.tcl        |   71 -
 .../cluster/tests/13-no-failover-option.tcl   |   61 -
 .../cluster/tests/14-consistency-check.tcl    |  117 -
 .../tests/cluster/tests/15-cluster-slots.tcl  |   63 -
 .../tests/16-transactions-on-replica.tcl      |   71 -
 .../cluster/tests/17-diskless-load-swapdb.tcl |   86 -
 redis-stable/tests/cluster/tests/18-info.tcl  |   45 -
 .../cluster/tests/19-cluster-nodes-slots.tcl  |   71 -
 .../cluster/tests/20-half-migrated-slot.tcl   |   98 -
 .../cluster/tests/21-many-slot-migration.tcl  |   64 -
 .../tests/cluster/tests/helpers/onlydots.tcl  |   16 -
 .../cluster/tests/includes/init-tests.tcl     |   70 -
 .../tests/cluster/tests/includes/utils.tcl    |   25 -
 redis-stable/tests/cluster/tmp/.gitignore     |    2 -
 redis-stable/tests/helpers/bg_block_op.tcl    |   55 -
 .../tests/helpers/bg_complex_data.tcl         |   13 -
 .../tests/helpers/fake_redis_node.tcl         |   58 -
 redis-stable/tests/helpers/gen_write_load.tcl |   18 -
 redis-stable/tests/instances.tcl              |  673 --
 redis-stable/tests/integration/aof-race.tcl   |   36 -
 redis-stable/tests/integration/aof.tcl        |  298 -
 redis-stable/tests/integration/block-repl.tcl |   51 -
 .../convert-zipmap-hash-on-load.tcl           |   35 -
 .../tests/integration/corrupt-dump-fuzzer.tcl |  208 -
 .../tests/integration/corrupt-dump.tcl        |  702 --
 redis-stable/tests/integration/failover.tcl   |  294 -
 redis-stable/tests/integration/logging.tcl    |   51 -
 .../tests/integration/psync2-pingoff.tcl      |  244 -
 redis-stable/tests/integration/psync2-reg.tcl |   82 -
 redis-stable/tests/integration/psync2.tcl     |  373 -
 redis-stable/tests/integration/rdb.tcl        |  314 -
 .../tests/integration/redis-benchmark.tcl     |  168 -
 redis-stable/tests/integration/redis-cli.tcl  |  374 -
 .../tests/integration/replication-2.tcl       |   92 -
 .../tests/integration/replication-3.tcl       |  134 -
 .../tests/integration/replication-4.tcl       |  143 -
 .../tests/integration/replication-psync.tcl   |  141 -
 .../tests/integration/replication.tcl         |  928 --
 redis-stable/tests/modules/Makefile           |   60 -
 redis-stable/tests/modules/auth.c             |   90 -
 redis-stable/tests/modules/basics.c           |  539 -
 redis-stable/tests/modules/blockedclient.c    |  209 -
 .../tests/modules/blockonbackground.c         |  291 -
 redis-stable/tests/modules/blockonkeys.c      |  505 -
 redis-stable/tests/modules/commandfilter.c    |  154 -
 redis-stable/tests/modules/datatype.c         |  217 -
 redis-stable/tests/modules/defragtest.c       |  234 -
 redis-stable/tests/modules/fork.c             |   94 -
 redis-stable/tests/modules/getkeys.c          |  122 -
 redis-stable/tests/modules/hash.c             |   90 -
 redis-stable/tests/modules/hooks.c            |  334 -
 redis-stable/tests/modules/infotest.c         |  119 -
 redis-stable/tests/modules/keyspace_events.c  |  293 -
 redis-stable/tests/modules/misc.c             |  327 -
 redis-stable/tests/modules/propagate.c        |  256 -
 redis-stable/tests/modules/scan.c             |  121 -
 redis-stable/tests/modules/stream.c           |  258 -
 redis-stable/tests/modules/test_lazyfree.c    |  196 -
 redis-stable/tests/modules/testrdb.c          |  301 -
 redis-stable/tests/modules/timer.c            |  103 -
 redis-stable/tests/modules/zset.c             |   30 -
 redis-stable/tests/sentinel/run.tcl           |   27 -
 redis-stable/tests/sentinel/tests/00-base.tcl |  126 -
 .../tests/sentinel/tests/01-conf-update.tcl   |   39 -
 .../tests/sentinel/tests/02-slaves-reconf.tcl |   84 -
 .../sentinel/tests/03-runtime-reconf.tcl      |    1 -
 .../sentinel/tests/04-slave-selection.tcl     |    5 -
 .../tests/sentinel/tests/05-manual.tcl        |   45 -
 .../tests/sentinel/tests/06-ckquorum.tcl      |   35 -
 .../sentinel/tests/07-down-conditions.tcl     |   80 -
 .../tests/sentinel/tests/08-hostname-conf.tcl |   67 -
 .../tests/sentinel/tests/09-acl-support.tcl   |   50 -
 .../sentinel/tests/10-replica-priority.tcl    |   73 -
 .../tests/helpers/check_leaked_fds.tcl        |   79 -
 .../sentinel/tests/includes/init-tests.tcl    |   80 -
 .../sentinel/tests/includes/sentinel.conf     |   11 -
 .../tests/includes/start-init-tests.tcl       |   18 -
 redis-stable/tests/sentinel/tmp/.gitignore    |    2 -
 redis-stable/tests/support/benchmark.tcl      |   19 -
 redis-stable/tests/support/cli.tcl            |   19 -
 redis-stable/tests/support/cluster.tcl        |  363 -
 redis-stable/tests/support/redis.tcl          |  368 -
 redis-stable/tests/support/server.tcl         |  623 --
 redis-stable/tests/support/test.tcl           |  210 -
 redis-stable/tests/support/tmpfile.tcl        |   15 -
 redis-stable/tests/support/util.tcl           |  773 --
 redis-stable/tests/test_helper.tcl            |  822 --
 redis-stable/tests/unit/acl.tcl               |  631 --
 redis-stable/tests/unit/aofrw.tcl             |  206 -
 redis-stable/tests/unit/auth.tcl              |   84 -
 redis-stable/tests/unit/bitfield.tcl          |  232 -
 redis-stable/tests/unit/bitops.tcl            |  379 -
 redis-stable/tests/unit/dump.tcl              |  379 -
 redis-stable/tests/unit/expire.tcl            |  414 -
 redis-stable/tests/unit/geo.tcl               |  693 --
 redis-stable/tests/unit/hyperloglog.tcl       |  213 -
 redis-stable/tests/unit/info.tcl              |  175 -
 redis-stable/tests/unit/introspection-2.tcl   |   79 -
 redis-stable/tests/unit/introspection.tcl     |  251 -
 redis-stable/tests/unit/keyspace.tcl          |  482 -
 redis-stable/tests/unit/latency-monitor.tcl   |   79 -
 redis-stable/tests/unit/lazyfree.tcl          |   39 -
 redis-stable/tests/unit/limits.tcl            |   21 -
 redis-stable/tests/unit/maxmemory.tcl         |  326 -
 redis-stable/tests/unit/memefficiency.tcl     |  496 -
 redis-stable/tests/unit/moduleapi/auth.tcl    |   71 -
 redis-stable/tests/unit/moduleapi/basics.tcl  |   12 -
 .../tests/unit/moduleapi/blockedclient.tcl    |   93 -
 .../unit/moduleapi/blockonbackground.tcl      |  117 -
 .../tests/unit/moduleapi/blockonkeys.tcl      |  239 -
 .../tests/unit/moduleapi/commandfilter.tcl    |   84 -
 .../tests/unit/moduleapi/datatype.tcl         |   58 -
 redis-stable/tests/unit/moduleapi/defrag.tcl  |   46 -
 redis-stable/tests/unit/moduleapi/fork.tcl    |   31 -
 redis-stable/tests/unit/moduleapi/getkeys.tcl |   44 -
 redis-stable/tests/unit/moduleapi/hash.tcl    |   23 -
 redis-stable/tests/unit/moduleapi/hooks.tcl   |  163 -
 .../tests/unit/moduleapi/infotest.tcl         |   94 -
 .../tests/unit/moduleapi/keyspace_events.tcl  |   86 -
 redis-stable/tests/unit/moduleapi/misc.tcl    |  118 -
 .../tests/unit/moduleapi/propagate.tcl        |  268 -
 redis-stable/tests/unit/moduleapi/scan.tcl    |   52 -
 redis-stable/tests/unit/moduleapi/stream.tcl  |  155 -
 .../tests/unit/moduleapi/test_lazyfree.tcl    |   32 -
 redis-stable/tests/unit/moduleapi/testrdb.tcl |  132 -
 redis-stable/tests/unit/moduleapi/timer.tcl   |   57 -
 redis-stable/tests/unit/moduleapi/zset.tcl    |   16 -
 redis-stable/tests/unit/multi.tcl             |  646 --
 redis-stable/tests/unit/networking.tcl        |   36 -
 redis-stable/tests/unit/obuf-limits.tcl       |  186 -
 redis-stable/tests/unit/oom-score-adj.tcl     |   77 -
 redis-stable/tests/unit/other.tcl             |  370 -
 redis-stable/tests/unit/pause.tcl             |  251 -
 redis-stable/tests/unit/pendingquerybuf.tcl   |   36 -
 redis-stable/tests/unit/printver.tcl          |    6 -
 redis-stable/tests/unit/protocol.tcl          |  209 -
 redis-stable/tests/unit/pubsub.tcl            |  360 -
 redis-stable/tests/unit/quit.tcl              |   40 -
 redis-stable/tests/unit/scan.tcl              |  330 -
 redis-stable/tests/unit/scripting.tcl         |  940 --
 redis-stable/tests/unit/shutdown.tcl          |   57 -
 redis-stable/tests/unit/slowlog.tcl           |  177 -
 redis-stable/tests/unit/sort.tcl              |  318 -
 redis-stable/tests/unit/tls.tcl               |  158 -
 redis-stable/tests/unit/tracking.tcl          |  591 -
 redis-stable/tests/unit/type/hash.tcl         |  797 --
 redis-stable/tests/unit/type/incr.tcl         |  164 -
 redis-stable/tests/unit/type/list-2.tcl       |   47 -
 redis-stable/tests/unit/type/list-3.tcl       |  122 -
 redis-stable/tests/unit/type/list-common.tcl  |    5 -
 redis-stable/tests/unit/type/list.tcl         | 1157 --
 redis-stable/tests/unit/type/set.tcl          |  886 --
 .../tests/unit/type/stream-cgroups.tcl        |  662 --
 redis-stable/tests/unit/type/stream.tcl       |  710 --
 redis-stable/tests/unit/type/string.tcl       |  577 -
 redis-stable/tests/unit/type/zset.tcl         | 1870 ----
 redis-stable/tests/unit/violations.tcl        |  156 -
 redis-stable/tests/unit/wait.tcl              |   58 -
 redis-stable/utils/build-static-symbols.tcl   |   22 -
 redis-stable/utils/cluster_fail_time.tcl      |   50 -
 redis-stable/utils/corrupt_rdb.c              |   45 -
 redis-stable/utils/create-cluster/.gitignore  |    5 -
 redis-stable/utils/create-cluster/README      |   27 -
 .../utils/create-cluster/create-cluster       |  118 -
 redis-stable/utils/gen-test-certs.sh          |   58 -
 redis-stable/utils/generate-command-help.rb   |  123 -
 .../utils/graphs/commits-over-time/README.md  |   16 -
 .../graphs/commits-over-time/genhtml.tcl      |   96 -
 redis-stable/utils/hashtable/README           |   13 -
 redis-stable/utils/hashtable/rehashing.c      |  143 -
 redis-stable/utils/hyperloglog/.gitignore     |    1 -
 redis-stable/utils/hyperloglog/hll-err.rb     |   27 -
 .../utils/hyperloglog/hll-gnuplot-graph.rb    |   88 -
 redis-stable/utils/install_server.sh          |  291 -
 redis-stable/utils/lru/README                 |   19 -
 redis-stable/utils/lru/lfu-simulation.c       |  158 -
 redis-stable/utils/lru/test-lru.rb            |  223 -
 redis-stable/utils/redis-copy.rb              |   35 -
 redis-stable/utils/redis-sha1.rb              |   52 -
 redis-stable/utils/redis_init_script          |   50 -
 redis-stable/utils/redis_init_script.tpl      |   44 -
 .../utils/releasetools/01_create_tarball.sh   |   14 -
 .../utils/releasetools/02_upload_tarball.sh   |   23 -
 .../utils/releasetools/03_test_release.sh     |   28 -
 .../utils/releasetools/04_release_hash.sh     |   13 -
 redis-stable/utils/releasetools/changelog.tcl |   35 -
 redis-stable/utils/speed-regression.tcl       |  130 -
 redis-stable/utils/srandmember/README.md      |   14 -
 redis-stable/utils/srandmember/showdist.rb    |   33 -
 redis-stable/utils/srandmember/showfreq.rb    |   23 -
 .../systemd-redis_multiple_servers@.service   |   37 -
 .../utils/systemd-redis_server.service        |   43 -
 redis-stable/utils/tracking_collisions.c      |   76 -
 redis-stable/utils/whatisdoing.sh             |   24 -
 .../frameworks/tailwind/header.blade.php      |   33 +-
 src/Jobs/ExportJob.php                        |   57 +
 src/Services/Export.php                       |    2 +-
 src/Services/Spout/ExportToCsv.php            |    5 +
 src/Services/Spout/ExportToXLS.php            |    5 +
 src/Traits/Exportable.php                     |  114 +-
 888 files changed, 195 insertions(+), 289124 deletions(-)
 create mode 100644 redis-stable.tar.gz
 delete mode 100644 redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
 delete mode 100644 redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
 delete mode 100644 redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
 delete mode 100644 redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
 delete mode 100644 redis-stable/.github/ISSUE_TEMPLATE/question.md
 delete mode 100644 redis-stable/.github/workflows/ci.yml
 delete mode 100644 redis-stable/.github/workflows/daily.yml
 delete mode 100644 redis-stable/.gitignore
 delete mode 100644 redis-stable/00-RELEASENOTES
 delete mode 100644 redis-stable/BUGS
 delete mode 100644 redis-stable/CONDUCT
 delete mode 100644 redis-stable/CONTRIBUTING
 delete mode 100644 redis-stable/COPYING
 delete mode 100644 redis-stable/INSTALL
 delete mode 100644 redis-stable/MANIFESTO
 delete mode 100644 redis-stable/Makefile
 delete mode 100644 redis-stable/README.md
 delete mode 100644 redis-stable/TLS.md
 delete mode 100644 redis-stable/deps/Makefile
 delete mode 100644 redis-stable/deps/README.md
 delete mode 100644 redis-stable/deps/hdr_histogram/COPYING.txt
 delete mode 100644 redis-stable/deps/hdr_histogram/LICENSE.txt
 delete mode 100644 redis-stable/deps/hdr_histogram/Makefile
 delete mode 100644 redis-stable/deps/hdr_histogram/README.md
 delete mode 100644 redis-stable/deps/hdr_histogram/hdr_atomic.h
 delete mode 100644 redis-stable/deps/hdr_histogram/hdr_histogram.c
 delete mode 100644 redis-stable/deps/hdr_histogram/hdr_histogram.h
 delete mode 100644 redis-stable/deps/hiredis/.gitignore
 delete mode 100644 redis-stable/deps/hiredis/.travis.yml
 delete mode 100644 redis-stable/deps/hiredis/CHANGELOG.md
 delete mode 100644 redis-stable/deps/hiredis/CMakeLists.txt
 delete mode 100644 redis-stable/deps/hiredis/COPYING
 delete mode 100644 redis-stable/deps/hiredis/Makefile
 delete mode 100644 redis-stable/deps/hiredis/README.md
 delete mode 100644 redis-stable/deps/hiredis/adapters/ae.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/glib.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/ivykis.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/libev.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/libevent.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/libuv.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/macosx.h
 delete mode 100644 redis-stable/deps/hiredis/adapters/qt.h
 delete mode 100644 redis-stable/deps/hiredis/alloc.c
 delete mode 100644 redis-stable/deps/hiredis/alloc.h
 delete mode 100644 redis-stable/deps/hiredis/appveyor.yml
 delete mode 100644 redis-stable/deps/hiredis/async.c
 delete mode 100644 redis-stable/deps/hiredis/async.h
 delete mode 100644 redis-stable/deps/hiredis/async_private.h
 delete mode 100644 redis-stable/deps/hiredis/dict.c
 delete mode 100644 redis-stable/deps/hiredis/dict.h
 delete mode 100644 redis-stable/deps/hiredis/examples/CMakeLists.txt
 delete mode 100644 redis-stable/deps/hiredis/examples/example-ae.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-glib.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-ivykis.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-libev.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-libevent-ssl.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-libevent.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-libuv.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-macosx.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-push.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example-qt.cpp
 delete mode 100644 redis-stable/deps/hiredis/examples/example-qt.h
 delete mode 100644 redis-stable/deps/hiredis/examples/example-ssl.c
 delete mode 100644 redis-stable/deps/hiredis/examples/example.c
 delete mode 100644 redis-stable/deps/hiredis/fmacros.h
 delete mode 100644 redis-stable/deps/hiredis/hiredis-config.cmake.in
 delete mode 100644 redis-stable/deps/hiredis/hiredis.c
 delete mode 100644 redis-stable/deps/hiredis/hiredis.h
 delete mode 100644 redis-stable/deps/hiredis/hiredis.pc.in
 delete mode 100644 redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
 delete mode 100644 redis-stable/deps/hiredis/hiredis_ssl.h
 delete mode 100644 redis-stable/deps/hiredis/hiredis_ssl.pc.in
 delete mode 100644 redis-stable/deps/hiredis/net.c
 delete mode 100644 redis-stable/deps/hiredis/net.h
 delete mode 100644 redis-stable/deps/hiredis/read.c
 delete mode 100644 redis-stable/deps/hiredis/read.h
 delete mode 100644 redis-stable/deps/hiredis/sds.c
 delete mode 100644 redis-stable/deps/hiredis/sds.h
 delete mode 100644 redis-stable/deps/hiredis/sdsalloc.h
 delete mode 100644 redis-stable/deps/hiredis/sdscompat.h
 delete mode 100644 redis-stable/deps/hiredis/sockcompat.c
 delete mode 100644 redis-stable/deps/hiredis/sockcompat.h
 delete mode 100644 redis-stable/deps/hiredis/ssl.c
 delete mode 100644 redis-stable/deps/hiredis/test.c
 delete mode 100755 redis-stable/deps/hiredis/test.sh
 delete mode 100644 redis-stable/deps/hiredis/win32.h
 delete mode 100644 redis-stable/deps/jemalloc/.appveyor.yml
 delete mode 100644 redis-stable/deps/jemalloc/.autom4te.cfg
 delete mode 100644 redis-stable/deps/jemalloc/.gitattributes
 delete mode 100644 redis-stable/deps/jemalloc/.gitignore
 delete mode 100644 redis-stable/deps/jemalloc/.travis.yml
 delete mode 100644 redis-stable/deps/jemalloc/COPYING
 delete mode 100644 redis-stable/deps/jemalloc/ChangeLog
 delete mode 100644 redis-stable/deps/jemalloc/INSTALL.md
 delete mode 100644 redis-stable/deps/jemalloc/Makefile.in
 delete mode 100644 redis-stable/deps/jemalloc/README
 delete mode 100644 redis-stable/deps/jemalloc/TUNING.md
 delete mode 100755 redis-stable/deps/jemalloc/autogen.sh
 delete mode 100644 redis-stable/deps/jemalloc/bin/jemalloc-config.in
 delete mode 100644 redis-stable/deps/jemalloc/bin/jemalloc.sh.in
 delete mode 100644 redis-stable/deps/jemalloc/bin/jeprof.in
 delete mode 100755 redis-stable/deps/jemalloc/build-aux/config.guess
 delete mode 100755 redis-stable/deps/jemalloc/build-aux/config.sub
 delete mode 100755 redis-stable/deps/jemalloc/build-aux/install-sh
 delete mode 100644 redis-stable/deps/jemalloc/config.stamp.in
 delete mode 100644 redis-stable/deps/jemalloc/configure.ac
 delete mode 100644 redis-stable/deps/jemalloc/doc/html.xsl.in
 delete mode 100644 redis-stable/deps/jemalloc/doc/jemalloc.xml.in
 delete mode 100644 redis-stable/deps/jemalloc/doc/manpages.xsl.in
 delete mode 100644 redis-stable/deps/jemalloc/doc/stylesheet.xsl
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
 delete mode 100755 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
 delete mode 100644 redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
 delete mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
 delete mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
 delete mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/strings.h
 delete mode 100644 redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
 delete mode 100644 redis-stable/deps/jemalloc/jemalloc.pc.in
 delete mode 100644 redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
 delete mode 100644 redis-stable/deps/jemalloc/msvc/ReadMe.txt
 delete mode 100644 redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
 delete mode 100644 redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
 delete mode 100644 redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
 delete mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
 delete mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
 delete mode 100644 redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
 delete mode 100755 redis-stable/deps/jemalloc/run_tests.sh
 delete mode 100755 redis-stable/deps/jemalloc/scripts/gen_run_tests.py
 delete mode 100755 redis-stable/deps/jemalloc/scripts/gen_travis.py
 delete mode 100644 redis-stable/deps/jemalloc/src/arena.c
 delete mode 100644 redis-stable/deps/jemalloc/src/background_thread.c
 delete mode 100644 redis-stable/deps/jemalloc/src/base.c
 delete mode 100644 redis-stable/deps/jemalloc/src/bin.c
 delete mode 100644 redis-stable/deps/jemalloc/src/bitmap.c
 delete mode 100644 redis-stable/deps/jemalloc/src/ckh.c
 delete mode 100644 redis-stable/deps/jemalloc/src/ctl.c
 delete mode 100644 redis-stable/deps/jemalloc/src/div.c
 delete mode 100644 redis-stable/deps/jemalloc/src/extent.c
 delete mode 100644 redis-stable/deps/jemalloc/src/extent_dss.c
 delete mode 100644 redis-stable/deps/jemalloc/src/extent_mmap.c
 delete mode 100644 redis-stable/deps/jemalloc/src/hash.c
 delete mode 100644 redis-stable/deps/jemalloc/src/hooks.c
 delete mode 100644 redis-stable/deps/jemalloc/src/jemalloc.c
 delete mode 100644 redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
 delete mode 100644 redis-stable/deps/jemalloc/src/large.c
 delete mode 100644 redis-stable/deps/jemalloc/src/log.c
 delete mode 100644 redis-stable/deps/jemalloc/src/malloc_io.c
 delete mode 100644 redis-stable/deps/jemalloc/src/mutex.c
 delete mode 100644 redis-stable/deps/jemalloc/src/mutex_pool.c
 delete mode 100644 redis-stable/deps/jemalloc/src/nstime.c
 delete mode 100644 redis-stable/deps/jemalloc/src/pages.c
 delete mode 100644 redis-stable/deps/jemalloc/src/prng.c
 delete mode 100644 redis-stable/deps/jemalloc/src/prof.c
 delete mode 100644 redis-stable/deps/jemalloc/src/rtree.c
 delete mode 100644 redis-stable/deps/jemalloc/src/stats.c
 delete mode 100644 redis-stable/deps/jemalloc/src/sz.c
 delete mode 100644 redis-stable/deps/jemalloc/src/tcache.c
 delete mode 100644 redis-stable/deps/jemalloc/src/ticker.c
 delete mode 100644 redis-stable/deps/jemalloc/src/tsd.c
 delete mode 100644 redis-stable/deps/jemalloc/src/witness.c
 delete mode 100644 redis-stable/deps/jemalloc/src/zone.c
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/SFMT.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/btalloc.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/math.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/mq.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/mtx.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/test.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/thd.h
 delete mode 100644 redis-stable/deps/jemalloc/test/include/test/timer.h
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/allocated.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/extent.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/extent.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/mallocx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/mallocx.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/overflow.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/posix_memalign.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/rallocx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/sdallocx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/thread_arena.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/xallocx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/integration/xallocx.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/src/SFMT.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/btalloc.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/btalloc_0.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/btalloc_1.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/math.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/mq.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/mtx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/test.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/thd.c
 delete mode 100644 redis-stable/deps/jemalloc/test/src/timer.c
 delete mode 100644 redis-stable/deps/jemalloc/test/stress/microbench.c
 delete mode 100644 redis-stable/deps/jemalloc/test/test.sh.in
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/SFMT.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/a0.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/atomic.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/background_thread.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/base.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/bit_util.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/bitmap.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/ckh.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/decay.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/decay.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/div.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/emitter.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/extent_quantize.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/fork.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/hash.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/hooks.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk_alloc.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk_free.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/junk_free.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/log.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/mallctl.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/malloc_io.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/math.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/mq.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/mtx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/nstime.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/pack.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/pack.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/pages.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/ph.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prng.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_accum.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_accum.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_active.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_active.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_gdump.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_idump.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_idump.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_reset.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_reset.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_tctx.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/ql.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/qr.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/rb.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/retained.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/rtree.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/size_classes.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/slab.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/smoothstep.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/spin.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/stats.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/stats_print.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/ticker.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/tsd.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/witness.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/zero.c
 delete mode 100644 redis-stable/deps/jemalloc/test/unit/zero.sh
 delete mode 100644 redis-stable/deps/linenoise/.gitignore
 delete mode 100644 redis-stable/deps/linenoise/Makefile
 delete mode 100644 redis-stable/deps/linenoise/README.markdown
 delete mode 100644 redis-stable/deps/linenoise/example.c
 delete mode 100644 redis-stable/deps/linenoise/linenoise.c
 delete mode 100644 redis-stable/deps/linenoise/linenoise.h
 delete mode 100644 redis-stable/deps/lua/COPYRIGHT
 delete mode 100644 redis-stable/deps/lua/HISTORY
 delete mode 100644 redis-stable/deps/lua/INSTALL
 delete mode 100644 redis-stable/deps/lua/Makefile
 delete mode 100644 redis-stable/deps/lua/README
 delete mode 100644 redis-stable/deps/lua/doc/contents.html
 delete mode 100644 redis-stable/deps/lua/doc/cover.png
 delete mode 100644 redis-stable/deps/lua/doc/logo.gif
 delete mode 100644 redis-stable/deps/lua/doc/lua.1
 delete mode 100644 redis-stable/deps/lua/doc/lua.css
 delete mode 100644 redis-stable/deps/lua/doc/lua.html
 delete mode 100644 redis-stable/deps/lua/doc/luac.1
 delete mode 100644 redis-stable/deps/lua/doc/luac.html
 delete mode 100644 redis-stable/deps/lua/doc/manual.css
 delete mode 100644 redis-stable/deps/lua/doc/manual.html
 delete mode 100644 redis-stable/deps/lua/doc/readme.html
 delete mode 100644 redis-stable/deps/lua/etc/Makefile
 delete mode 100644 redis-stable/deps/lua/etc/README
 delete mode 100644 redis-stable/deps/lua/etc/all.c
 delete mode 100644 redis-stable/deps/lua/etc/lua.hpp
 delete mode 100644 redis-stable/deps/lua/etc/lua.ico
 delete mode 100644 redis-stable/deps/lua/etc/lua.pc
 delete mode 100644 redis-stable/deps/lua/etc/luavs.bat
 delete mode 100644 redis-stable/deps/lua/etc/min.c
 delete mode 100644 redis-stable/deps/lua/etc/noparser.c
 delete mode 100644 redis-stable/deps/lua/etc/strict.lua
 delete mode 100644 redis-stable/deps/lua/src/Makefile
 delete mode 100644 redis-stable/deps/lua/src/fpconv.c
 delete mode 100644 redis-stable/deps/lua/src/fpconv.h
 delete mode 100644 redis-stable/deps/lua/src/lapi.c
 delete mode 100644 redis-stable/deps/lua/src/lapi.h
 delete mode 100644 redis-stable/deps/lua/src/lauxlib.c
 delete mode 100644 redis-stable/deps/lua/src/lauxlib.h
 delete mode 100644 redis-stable/deps/lua/src/lbaselib.c
 delete mode 100644 redis-stable/deps/lua/src/lcode.c
 delete mode 100644 redis-stable/deps/lua/src/lcode.h
 delete mode 100644 redis-stable/deps/lua/src/ldblib.c
 delete mode 100644 redis-stable/deps/lua/src/ldebug.c
 delete mode 100644 redis-stable/deps/lua/src/ldebug.h
 delete mode 100644 redis-stable/deps/lua/src/ldo.c
 delete mode 100644 redis-stable/deps/lua/src/ldo.h
 delete mode 100644 redis-stable/deps/lua/src/ldump.c
 delete mode 100644 redis-stable/deps/lua/src/lfunc.c
 delete mode 100644 redis-stable/deps/lua/src/lfunc.h
 delete mode 100644 redis-stable/deps/lua/src/lgc.c
 delete mode 100644 redis-stable/deps/lua/src/lgc.h
 delete mode 100644 redis-stable/deps/lua/src/linit.c
 delete mode 100644 redis-stable/deps/lua/src/liolib.c
 delete mode 100644 redis-stable/deps/lua/src/llex.c
 delete mode 100644 redis-stable/deps/lua/src/llex.h
 delete mode 100644 redis-stable/deps/lua/src/llimits.h
 delete mode 100644 redis-stable/deps/lua/src/lmathlib.c
 delete mode 100644 redis-stable/deps/lua/src/lmem.c
 delete mode 100644 redis-stable/deps/lua/src/lmem.h
 delete mode 100644 redis-stable/deps/lua/src/loadlib.c
 delete mode 100644 redis-stable/deps/lua/src/lobject.c
 delete mode 100644 redis-stable/deps/lua/src/lobject.h
 delete mode 100644 redis-stable/deps/lua/src/lopcodes.c
 delete mode 100644 redis-stable/deps/lua/src/lopcodes.h
 delete mode 100644 redis-stable/deps/lua/src/loslib.c
 delete mode 100644 redis-stable/deps/lua/src/lparser.c
 delete mode 100644 redis-stable/deps/lua/src/lparser.h
 delete mode 100644 redis-stable/deps/lua/src/lstate.c
 delete mode 100644 redis-stable/deps/lua/src/lstate.h
 delete mode 100644 redis-stable/deps/lua/src/lstring.c
 delete mode 100644 redis-stable/deps/lua/src/lstring.h
 delete mode 100644 redis-stable/deps/lua/src/lstrlib.c
 delete mode 100644 redis-stable/deps/lua/src/ltable.c
 delete mode 100644 redis-stable/deps/lua/src/ltable.h
 delete mode 100644 redis-stable/deps/lua/src/ltablib.c
 delete mode 100644 redis-stable/deps/lua/src/ltm.c
 delete mode 100644 redis-stable/deps/lua/src/ltm.h
 delete mode 100644 redis-stable/deps/lua/src/lua.c
 delete mode 100644 redis-stable/deps/lua/src/lua.h
 delete mode 100644 redis-stable/deps/lua/src/lua_bit.c
 delete mode 100644 redis-stable/deps/lua/src/lua_cjson.c
 delete mode 100644 redis-stable/deps/lua/src/lua_cmsgpack.c
 delete mode 100644 redis-stable/deps/lua/src/lua_struct.c
 delete mode 100644 redis-stable/deps/lua/src/luac.c
 delete mode 100644 redis-stable/deps/lua/src/luaconf.h
 delete mode 100644 redis-stable/deps/lua/src/lualib.h
 delete mode 100644 redis-stable/deps/lua/src/lundump.c
 delete mode 100644 redis-stable/deps/lua/src/lundump.h
 delete mode 100644 redis-stable/deps/lua/src/lvm.c
 delete mode 100644 redis-stable/deps/lua/src/lvm.h
 delete mode 100644 redis-stable/deps/lua/src/lzio.c
 delete mode 100644 redis-stable/deps/lua/src/lzio.h
 delete mode 100644 redis-stable/deps/lua/src/print.c
 delete mode 100644 redis-stable/deps/lua/src/strbuf.c
 delete mode 100644 redis-stable/deps/lua/src/strbuf.h
 delete mode 100644 redis-stable/deps/lua/test/README
 delete mode 100644 redis-stable/deps/lua/test/bisect.lua
 delete mode 100644 redis-stable/deps/lua/test/cf.lua
 delete mode 100644 redis-stable/deps/lua/test/echo.lua
 delete mode 100644 redis-stable/deps/lua/test/env.lua
 delete mode 100644 redis-stable/deps/lua/test/factorial.lua
 delete mode 100644 redis-stable/deps/lua/test/fib.lua
 delete mode 100644 redis-stable/deps/lua/test/fibfor.lua
 delete mode 100644 redis-stable/deps/lua/test/globals.lua
 delete mode 100644 redis-stable/deps/lua/test/hello.lua
 delete mode 100644 redis-stable/deps/lua/test/life.lua
 delete mode 100644 redis-stable/deps/lua/test/luac.lua
 delete mode 100644 redis-stable/deps/lua/test/printf.lua
 delete mode 100644 redis-stable/deps/lua/test/readonly.lua
 delete mode 100644 redis-stable/deps/lua/test/sieve.lua
 delete mode 100644 redis-stable/deps/lua/test/sort.lua
 delete mode 100644 redis-stable/deps/lua/test/table.lua
 delete mode 100644 redis-stable/deps/lua/test/trace-calls.lua
 delete mode 100644 redis-stable/deps/lua/test/trace-globals.lua
 delete mode 100644 redis-stable/deps/lua/test/xd.lua
 delete mode 100755 redis-stable/deps/update-jemalloc.sh
 delete mode 100644 redis-stable/redis.conf
 delete mode 100755 redis-stable/runtest
 delete mode 100755 redis-stable/runtest-cluster
 delete mode 100755 redis-stable/runtest-moduleapi
 delete mode 100755 redis-stable/runtest-sentinel
 delete mode 100644 redis-stable/sentinel.conf
 delete mode 100644 redis-stable/src/.gitignore
 delete mode 100644 redis-stable/src/Makefile
 delete mode 100644 redis-stable/src/acl.c
 delete mode 100644 redis-stable/src/adlist.c
 delete mode 100644 redis-stable/src/adlist.h
 delete mode 100644 redis-stable/src/ae.c
 delete mode 100644 redis-stable/src/ae.h
 delete mode 100644 redis-stable/src/ae_epoll.c
 delete mode 100644 redis-stable/src/ae_evport.c
 delete mode 100644 redis-stable/src/ae_kqueue.c
 delete mode 100644 redis-stable/src/ae_select.c
 delete mode 100644 redis-stable/src/anet.c
 delete mode 100644 redis-stable/src/anet.h
 delete mode 100644 redis-stable/src/aof.c
 delete mode 100644 redis-stable/src/asciilogo.h
 delete mode 100644 redis-stable/src/atomicvar.h
 delete mode 100644 redis-stable/src/bio.c
 delete mode 100644 redis-stable/src/bio.h
 delete mode 100644 redis-stable/src/bitops.c
 delete mode 100644 redis-stable/src/blocked.c
 delete mode 100644 redis-stable/src/childinfo.c
 delete mode 100644 redis-stable/src/cli_common.c
 delete mode 100644 redis-stable/src/cli_common.h
 delete mode 100644 redis-stable/src/cluster.c
 delete mode 100644 redis-stable/src/cluster.h
 delete mode 100644 redis-stable/src/config.c
 delete mode 100644 redis-stable/src/config.h
 delete mode 100644 redis-stable/src/connection.c
 delete mode 100644 redis-stable/src/connection.h
 delete mode 100644 redis-stable/src/connhelpers.h
 delete mode 100644 redis-stable/src/crc16.c
 delete mode 100644 redis-stable/src/crc16_slottable.h
 delete mode 100644 redis-stable/src/crc64.c
 delete mode 100644 redis-stable/src/crc64.h
 delete mode 100644 redis-stable/src/crcspeed.c
 delete mode 100644 redis-stable/src/crcspeed.h
 delete mode 100644 redis-stable/src/db.c
 delete mode 100644 redis-stable/src/debug.c
 delete mode 100644 redis-stable/src/debugmacro.h
 delete mode 100644 redis-stable/src/defrag.c
 delete mode 100644 redis-stable/src/dict.c
 delete mode 100644 redis-stable/src/dict.h
 delete mode 100644 redis-stable/src/endianconv.c
 delete mode 100644 redis-stable/src/endianconv.h
 delete mode 100644 redis-stable/src/evict.c
 delete mode 100644 redis-stable/src/expire.c
 delete mode 100644 redis-stable/src/fmacros.h
 delete mode 100644 redis-stable/src/geo.c
 delete mode 100644 redis-stable/src/geo.h
 delete mode 100644 redis-stable/src/geohash.c
 delete mode 100644 redis-stable/src/geohash.h
 delete mode 100644 redis-stable/src/geohash_helper.c
 delete mode 100644 redis-stable/src/geohash_helper.h
 delete mode 100644 redis-stable/src/gopher.c
 delete mode 100644 redis-stable/src/help.h
 delete mode 100644 redis-stable/src/hyperloglog.c
 delete mode 100644 redis-stable/src/intset.c
 delete mode 100644 redis-stable/src/intset.h
 delete mode 100644 redis-stable/src/latency.c
 delete mode 100644 redis-stable/src/latency.h
 delete mode 100644 redis-stable/src/lazyfree.c
 delete mode 100644 redis-stable/src/listpack.c
 delete mode 100644 redis-stable/src/listpack.h
 delete mode 100644 redis-stable/src/listpack_malloc.h
 delete mode 100644 redis-stable/src/localtime.c
 delete mode 100644 redis-stable/src/lolwut.c
 delete mode 100644 redis-stable/src/lolwut.h
 delete mode 100644 redis-stable/src/lolwut5.c
 delete mode 100644 redis-stable/src/lolwut6.c
 delete mode 100644 redis-stable/src/lzf.h
 delete mode 100644 redis-stable/src/lzfP.h
 delete mode 100644 redis-stable/src/lzf_c.c
 delete mode 100644 redis-stable/src/lzf_d.c
 delete mode 100644 redis-stable/src/memtest.c
 delete mode 100755 redis-stable/src/mkreleasehdr.sh
 delete mode 100644 redis-stable/src/module.c
 delete mode 100644 redis-stable/src/modules/.gitignore
 delete mode 100644 redis-stable/src/modules/Makefile
 delete mode 100644 redis-stable/src/modules/gendoc.rb
 delete mode 100644 redis-stable/src/modules/helloacl.c
 delete mode 100644 redis-stable/src/modules/helloblock.c
 delete mode 100644 redis-stable/src/modules/hellocluster.c
 delete mode 100644 redis-stable/src/modules/hellodict.c
 delete mode 100644 redis-stable/src/modules/hellohook.c
 delete mode 100644 redis-stable/src/modules/hellotimer.c
 delete mode 100644 redis-stable/src/modules/hellotype.c
 delete mode 100644 redis-stable/src/modules/helloworld.c
 delete mode 100644 redis-stable/src/monotonic.c
 delete mode 100644 redis-stable/src/monotonic.h
 delete mode 100644 redis-stable/src/mt19937-64.c
 delete mode 100644 redis-stable/src/mt19937-64.h
 delete mode 100644 redis-stable/src/multi.c
 delete mode 100644 redis-stable/src/networking.c
 delete mode 100644 redis-stable/src/notify.c
 delete mode 100644 redis-stable/src/object.c
 delete mode 100644 redis-stable/src/pqsort.c
 delete mode 100644 redis-stable/src/pqsort.h
 delete mode 100644 redis-stable/src/pubsub.c
 delete mode 100644 redis-stable/src/quicklist.c
 delete mode 100644 redis-stable/src/quicklist.h
 delete mode 100644 redis-stable/src/rand.c
 delete mode 100644 redis-stable/src/rand.h
 delete mode 100644 redis-stable/src/rax.c
 delete mode 100644 redis-stable/src/rax.h
 delete mode 100644 redis-stable/src/rax_malloc.h
 delete mode 100644 redis-stable/src/rdb.c
 delete mode 100644 redis-stable/src/rdb.h
 delete mode 100644 redis-stable/src/redis-benchmark.c
 delete mode 100644 redis-stable/src/redis-check-aof.c
 delete mode 100644 redis-stable/src/redis-check-rdb.c
 delete mode 100644 redis-stable/src/redis-cli.c
 delete mode 100755 redis-stable/src/redis-trib.rb
 delete mode 100644 redis-stable/src/redisassert.h
 delete mode 100644 redis-stable/src/redismodule.h
 delete mode 100644 redis-stable/src/release.c
 delete mode 100644 redis-stable/src/replication.c
 delete mode 100644 redis-stable/src/rio.c
 delete mode 100644 redis-stable/src/rio.h
 delete mode 100644 redis-stable/src/scripting.c
 delete mode 100644 redis-stable/src/sds.c
 delete mode 100644 redis-stable/src/sds.h
 delete mode 100644 redis-stable/src/sdsalloc.h
 delete mode 100644 redis-stable/src/sentinel.c
 delete mode 100644 redis-stable/src/server.c
 delete mode 100644 redis-stable/src/server.h
 delete mode 100644 redis-stable/src/setcpuaffinity.c
 delete mode 100644 redis-stable/src/setproctitle.c
 delete mode 100644 redis-stable/src/sha1.c
 delete mode 100644 redis-stable/src/sha1.h
 delete mode 100644 redis-stable/src/sha256.c
 delete mode 100644 redis-stable/src/sha256.h
 delete mode 100644 redis-stable/src/siphash.c
 delete mode 100644 redis-stable/src/slowlog.c
 delete mode 100644 redis-stable/src/slowlog.h
 delete mode 100644 redis-stable/src/solarisfixes.h
 delete mode 100644 redis-stable/src/sort.c
 delete mode 100644 redis-stable/src/sparkline.c
 delete mode 100644 redis-stable/src/sparkline.h
 delete mode 100644 redis-stable/src/stream.h
 delete mode 100644 redis-stable/src/syncio.c
 delete mode 100644 redis-stable/src/t_hash.c
 delete mode 100644 redis-stable/src/t_list.c
 delete mode 100644 redis-stable/src/t_set.c
 delete mode 100644 redis-stable/src/t_stream.c
 delete mode 100644 redis-stable/src/t_string.c
 delete mode 100644 redis-stable/src/t_zset.c
 delete mode 100644 redis-stable/src/testhelp.h
 delete mode 100644 redis-stable/src/timeout.c
 delete mode 100644 redis-stable/src/tls.c
 delete mode 100644 redis-stable/src/tracking.c
 delete mode 100644 redis-stable/src/util.c
 delete mode 100644 redis-stable/src/util.h
 delete mode 100644 redis-stable/src/valgrind.sup
 delete mode 100644 redis-stable/src/version.h
 delete mode 100644 redis-stable/src/ziplist.c
 delete mode 100644 redis-stable/src/ziplist.h
 delete mode 100644 redis-stable/src/zipmap.c
 delete mode 100644 redis-stable/src/zipmap.h
 delete mode 100644 redis-stable/src/zmalloc.c
 delete mode 100644 redis-stable/src/zmalloc.h
 delete mode 100644 redis-stable/tests/assets/corrupt_empty_keys.rdb
 delete mode 100644 redis-stable/tests/assets/corrupt_ziplist.rdb
 delete mode 100644 redis-stable/tests/assets/default.conf
 delete mode 100644 redis-stable/tests/assets/encodings.rdb
 delete mode 100644 redis-stable/tests/assets/hash-zipmap.rdb
 delete mode 100644 redis-stable/tests/assets/minimal.conf
 delete mode 100644 redis-stable/tests/assets/nodefaultuser.acl
 delete mode 100644 redis-stable/tests/assets/user.acl
 delete mode 100644 redis-stable/tests/cluster/cluster.tcl
 delete mode 100644 redis-stable/tests/cluster/run.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/00-base.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/01-faildet.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/02-failover.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/03-failover-loop.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/04-resharding.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/05-slave-selection.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/07-replica-migration.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/08-update-msg.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/09-pubsub.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/10-manual-failover.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/11-manual-takeover.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/13-no-failover-option.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/14-consistency-check.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/15-cluster-slots.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/18-info.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/helpers/onlydots.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/includes/init-tests.tcl
 delete mode 100644 redis-stable/tests/cluster/tests/includes/utils.tcl
 delete mode 100644 redis-stable/tests/cluster/tmp/.gitignore
 delete mode 100644 redis-stable/tests/helpers/bg_block_op.tcl
 delete mode 100644 redis-stable/tests/helpers/bg_complex_data.tcl
 delete mode 100644 redis-stable/tests/helpers/fake_redis_node.tcl
 delete mode 100644 redis-stable/tests/helpers/gen_write_load.tcl
 delete mode 100644 redis-stable/tests/instances.tcl
 delete mode 100644 redis-stable/tests/integration/aof-race.tcl
 delete mode 100644 redis-stable/tests/integration/aof.tcl
 delete mode 100644 redis-stable/tests/integration/block-repl.tcl
 delete mode 100644 redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
 delete mode 100644 redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
 delete mode 100644 redis-stable/tests/integration/corrupt-dump.tcl
 delete mode 100644 redis-stable/tests/integration/failover.tcl
 delete mode 100644 redis-stable/tests/integration/logging.tcl
 delete mode 100644 redis-stable/tests/integration/psync2-pingoff.tcl
 delete mode 100644 redis-stable/tests/integration/psync2-reg.tcl
 delete mode 100644 redis-stable/tests/integration/psync2.tcl
 delete mode 100644 redis-stable/tests/integration/rdb.tcl
 delete mode 100644 redis-stable/tests/integration/redis-benchmark.tcl
 delete mode 100644 redis-stable/tests/integration/redis-cli.tcl
 delete mode 100644 redis-stable/tests/integration/replication-2.tcl
 delete mode 100644 redis-stable/tests/integration/replication-3.tcl
 delete mode 100644 redis-stable/tests/integration/replication-4.tcl
 delete mode 100644 redis-stable/tests/integration/replication-psync.tcl
 delete mode 100644 redis-stable/tests/integration/replication.tcl
 delete mode 100644 redis-stable/tests/modules/Makefile
 delete mode 100644 redis-stable/tests/modules/auth.c
 delete mode 100644 redis-stable/tests/modules/basics.c
 delete mode 100644 redis-stable/tests/modules/blockedclient.c
 delete mode 100644 redis-stable/tests/modules/blockonbackground.c
 delete mode 100644 redis-stable/tests/modules/blockonkeys.c
 delete mode 100644 redis-stable/tests/modules/commandfilter.c
 delete mode 100644 redis-stable/tests/modules/datatype.c
 delete mode 100644 redis-stable/tests/modules/defragtest.c
 delete mode 100644 redis-stable/tests/modules/fork.c
 delete mode 100644 redis-stable/tests/modules/getkeys.c
 delete mode 100644 redis-stable/tests/modules/hash.c
 delete mode 100644 redis-stable/tests/modules/hooks.c
 delete mode 100644 redis-stable/tests/modules/infotest.c
 delete mode 100644 redis-stable/tests/modules/keyspace_events.c
 delete mode 100644 redis-stable/tests/modules/misc.c
 delete mode 100644 redis-stable/tests/modules/propagate.c
 delete mode 100644 redis-stable/tests/modules/scan.c
 delete mode 100644 redis-stable/tests/modules/stream.c
 delete mode 100644 redis-stable/tests/modules/test_lazyfree.c
 delete mode 100644 redis-stable/tests/modules/testrdb.c
 delete mode 100644 redis-stable/tests/modules/timer.c
 delete mode 100644 redis-stable/tests/modules/zset.c
 delete mode 100644 redis-stable/tests/sentinel/run.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/00-base.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/01-conf-update.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/04-slave-selection.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/05-manual.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/06-ckquorum.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/07-down-conditions.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/09-acl-support.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/10-replica-priority.tcl
 delete mode 100755 redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/includes/init-tests.tcl
 delete mode 100644 redis-stable/tests/sentinel/tests/includes/sentinel.conf
 delete mode 100644 redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
 delete mode 100644 redis-stable/tests/sentinel/tmp/.gitignore
 delete mode 100644 redis-stable/tests/support/benchmark.tcl
 delete mode 100644 redis-stable/tests/support/cli.tcl
 delete mode 100644 redis-stable/tests/support/cluster.tcl
 delete mode 100644 redis-stable/tests/support/redis.tcl
 delete mode 100644 redis-stable/tests/support/server.tcl
 delete mode 100644 redis-stable/tests/support/test.tcl
 delete mode 100644 redis-stable/tests/support/tmpfile.tcl
 delete mode 100644 redis-stable/tests/support/util.tcl
 delete mode 100644 redis-stable/tests/test_helper.tcl
 delete mode 100644 redis-stable/tests/unit/acl.tcl
 delete mode 100644 redis-stable/tests/unit/aofrw.tcl
 delete mode 100644 redis-stable/tests/unit/auth.tcl
 delete mode 100644 redis-stable/tests/unit/bitfield.tcl
 delete mode 100644 redis-stable/tests/unit/bitops.tcl
 delete mode 100644 redis-stable/tests/unit/dump.tcl
 delete mode 100644 redis-stable/tests/unit/expire.tcl
 delete mode 100644 redis-stable/tests/unit/geo.tcl
 delete mode 100644 redis-stable/tests/unit/hyperloglog.tcl
 delete mode 100644 redis-stable/tests/unit/info.tcl
 delete mode 100644 redis-stable/tests/unit/introspection-2.tcl
 delete mode 100644 redis-stable/tests/unit/introspection.tcl
 delete mode 100644 redis-stable/tests/unit/keyspace.tcl
 delete mode 100644 redis-stable/tests/unit/latency-monitor.tcl
 delete mode 100644 redis-stable/tests/unit/lazyfree.tcl
 delete mode 100644 redis-stable/tests/unit/limits.tcl
 delete mode 100644 redis-stable/tests/unit/maxmemory.tcl
 delete mode 100644 redis-stable/tests/unit/memefficiency.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/auth.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/basics.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/blockedclient.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/blockonbackground.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/blockonkeys.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/commandfilter.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/datatype.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/defrag.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/fork.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/getkeys.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/hash.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/hooks.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/infotest.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/keyspace_events.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/misc.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/propagate.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/scan.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/stream.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/testrdb.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/timer.tcl
 delete mode 100644 redis-stable/tests/unit/moduleapi/zset.tcl
 delete mode 100644 redis-stable/tests/unit/multi.tcl
 delete mode 100644 redis-stable/tests/unit/networking.tcl
 delete mode 100644 redis-stable/tests/unit/obuf-limits.tcl
 delete mode 100644 redis-stable/tests/unit/oom-score-adj.tcl
 delete mode 100644 redis-stable/tests/unit/other.tcl
 delete mode 100644 redis-stable/tests/unit/pause.tcl
 delete mode 100644 redis-stable/tests/unit/pendingquerybuf.tcl
 delete mode 100644 redis-stable/tests/unit/printver.tcl
 delete mode 100644 redis-stable/tests/unit/protocol.tcl
 delete mode 100644 redis-stable/tests/unit/pubsub.tcl
 delete mode 100644 redis-stable/tests/unit/quit.tcl
 delete mode 100644 redis-stable/tests/unit/scan.tcl
 delete mode 100644 redis-stable/tests/unit/scripting.tcl
 delete mode 100644 redis-stable/tests/unit/shutdown.tcl
 delete mode 100644 redis-stable/tests/unit/slowlog.tcl
 delete mode 100644 redis-stable/tests/unit/sort.tcl
 delete mode 100644 redis-stable/tests/unit/tls.tcl
 delete mode 100644 redis-stable/tests/unit/tracking.tcl
 delete mode 100644 redis-stable/tests/unit/type/hash.tcl
 delete mode 100644 redis-stable/tests/unit/type/incr.tcl
 delete mode 100644 redis-stable/tests/unit/type/list-2.tcl
 delete mode 100644 redis-stable/tests/unit/type/list-3.tcl
 delete mode 100644 redis-stable/tests/unit/type/list-common.tcl
 delete mode 100644 redis-stable/tests/unit/type/list.tcl
 delete mode 100644 redis-stable/tests/unit/type/set.tcl
 delete mode 100644 redis-stable/tests/unit/type/stream-cgroups.tcl
 delete mode 100644 redis-stable/tests/unit/type/stream.tcl
 delete mode 100644 redis-stable/tests/unit/type/string.tcl
 delete mode 100644 redis-stable/tests/unit/type/zset.tcl
 delete mode 100644 redis-stable/tests/unit/violations.tcl
 delete mode 100644 redis-stable/tests/unit/wait.tcl
 delete mode 100644 redis-stable/utils/build-static-symbols.tcl
 delete mode 100644 redis-stable/utils/cluster_fail_time.tcl
 delete mode 100644 redis-stable/utils/corrupt_rdb.c
 delete mode 100644 redis-stable/utils/create-cluster/.gitignore
 delete mode 100644 redis-stable/utils/create-cluster/README
 delete mode 100755 redis-stable/utils/create-cluster/create-cluster
 delete mode 100755 redis-stable/utils/gen-test-certs.sh
 delete mode 100755 redis-stable/utils/generate-command-help.rb
 delete mode 100644 redis-stable/utils/graphs/commits-over-time/README.md
 delete mode 100755 redis-stable/utils/graphs/commits-over-time/genhtml.tcl
 delete mode 100644 redis-stable/utils/hashtable/README
 delete mode 100644 redis-stable/utils/hashtable/rehashing.c
 delete mode 100644 redis-stable/utils/hyperloglog/.gitignore
 delete mode 100644 redis-stable/utils/hyperloglog/hll-err.rb
 delete mode 100644 redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
 delete mode 100755 redis-stable/utils/install_server.sh
 delete mode 100644 redis-stable/utils/lru/README
 delete mode 100644 redis-stable/utils/lru/lfu-simulation.c
 delete mode 100644 redis-stable/utils/lru/test-lru.rb
 delete mode 100644 redis-stable/utils/redis-copy.rb
 delete mode 100644 redis-stable/utils/redis-sha1.rb
 delete mode 100755 redis-stable/utils/redis_init_script
 delete mode 100755 redis-stable/utils/redis_init_script.tpl
 delete mode 100755 redis-stable/utils/releasetools/01_create_tarball.sh
 delete mode 100755 redis-stable/utils/releasetools/02_upload_tarball.sh
 delete mode 100755 redis-stable/utils/releasetools/03_test_release.sh
 delete mode 100755 redis-stable/utils/releasetools/04_release_hash.sh
 delete mode 100755 redis-stable/utils/releasetools/changelog.tcl
 delete mode 100755 redis-stable/utils/speed-regression.tcl
 delete mode 100644 redis-stable/utils/srandmember/README.md
 delete mode 100644 redis-stable/utils/srandmember/showdist.rb
 delete mode 100644 redis-stable/utils/srandmember/showfreq.rb
 delete mode 100644 redis-stable/utils/systemd-redis_multiple_servers@.service
 delete mode 100644 redis-stable/utils/systemd-redis_server.service
 delete mode 100644 redis-stable/utils/tracking_collisions.c
 delete mode 100755 redis-stable/utils/whatisdoing.sh
 create mode 100644 src/Jobs/ExportJob.php

diff --git a/redis-stable.tar.gz b/redis-stable.tar.gz
new file mode 100644
index 0000000000000000000000000000000000000000..1e079faad5d1a98163a167396927a2367f5a5789
GIT binary patch
literal 2527624
zcmV(pK=8jGiwFP!000001MFORciTpi&)@hIZE7|WwIn6#upBA&hLT{4ZzxhjP(D`U
z#|HvU5-|=2ha|@Fci&%CH%O48kDVx)mp4XU1fY+)tGc>TbSzyjsV1pC^ySWXf6TRu
z>*(l^?)9U?-QqpJzN;V9_nsae9_{TPe79TQ-^Flo_y^ImbY<W@7UH{Xn1yNfnQ>p}
z|BGI6QU7P%PQTYWz3#U<%}2yR3V!<Z;8Xg4dT_L=|AV9br{9U)N2KAC*MGSFJ5ef+
z#c(E^C`@B-n5AAg#)~UO8i{lwMUN~*OylTh>7>F7g&oesD2js$UK~GjX+k1Hx*N8b
zX1*_C`Aa5~RNQ*DXnN@+8&-s^ppIgD9LO*gQ7oo*>P&dhH1=-oR0<i`o{uhLnhkx=
z5kT!^N#aGJ7{^gIO)6p*Wx^iEk_n8ZFYQE9W31q3p(|r1Je6^f7}1DdPOWnRfHK73
zbYiCr#<4>&@<NxmqCscftG6(HwE0pqC+D3k2O|L@M-p9HT2WXNZvpGh1K)bi61H`)
z?;sN|G^7poHAHS-P?l>$)(m4qv@Wl@y?&$9KNc6=*P`DQ*On=I=6TB!%~t>7`c$+m
z>)NyoLy22>NdgTB>!N$zJ{R3i`>i-NY1X+C+cb((G0esgs0{%?pW@u?H(G5B7)d+L
zVrghCCN*K+%6LX3kA?KX(@^?RI8K&Lq!~qH@X#bZ9UFo#zD?3}njG)!C=J%eJg(+M
z!4A-7!A`KV@kBi_psG7GjH|ZU0E_2c(dqWZRoCi^rr9xjjkfp)`0Tg39ZQMJj-?1A
z+=o%7SR&I(vSbQ-m9D`pS_#X-NoGkZgPM3PH=(<s6vU;N*wg8ZIGad+s;mtHg8kom
zt~6|nBuGg%Wf5w?WVR$7A9ewa^(PWkK_<4JM3^sZC-rV6)EWd?=%q6Ovs6;c5*cG$
zDy-CY-it1182QoNu`w4NB$rTMq`O#htQi<zvXk25v2=Ghkdv+SShqxsC7moLWTy~;
zVQjZXiXD&^&j;D?T|Eqv+OCMH@+h)EP|e&qQB3Y+2f3g6GXo(*=3F!GpZIUhi`XCH
z+{V~1AX_jHMt8n+K`g}^djZu5WH5x&lANQ^k&IJMpV$dz%MkCkp1i}{S?+AHbR-GY
z76CzWWeRej@K`3(NO@i!o<ez_3Md=aXBb)xZp3D@fC7yEY#tY6;@Ccgq)*y-#Q^i~
zK@lwPR@TI+bnJ}73kI^Svjqqp%95!K*0gjratd#L#B-#<R!Ih>IH^DupeM0si?Bed
zOXC@_#9mDCV_8Au$hI+8DZ>QMiuzIH!+sLxm1X2%)z685$CH&iGD%>3^_n)MMB9s&
zKIzB~ZGZNwbPLw7R})th%%vJWg)DJbaYefd-eABK%9FYE8~Zi!3QGq@k>@12GkYTs
z!zoIV^T0ancpM2=s{?>DZ6#W^UI5{y#sT><+7e7dK)s(Y4@5OD5ioJqE(~%SB}9{g
z06{Z0hm4rKn!GQc4T6X-z#x>G2>~sq5#q%bn{7sGjvc;Fo|MURTPnhE<R~nN2@AxH
zoQ#%0n;cljQYc%SJx9REVF%Drpb$bifN=!ikvsG8<oXxU9mz+>Dl$D@VA&?%19$Vt
zPU?jl5T|4ff&DXv=uW|-6F7I6dhh|^fUmKvEKE1tBxkbWomg>c)yG<Bd*caW@SQz7
z7T!n+I|m3H9H1$tIC7e106Oy6qABpQ1K7ABCm0#27hrva@v@P#ZM$m0r0`C;2h2X9
zRo7w?5K2gsG<r=eHb?_ds;y#Os2qaAtzHUP>om)S!^hr~RT7OVLf*ro{8>fZ<<55p
zffx|4?LhofK%cOF?<TXFxTc5+=_m_^Il|yEoJFt2z^f$(LXv@WYsLjF5?Tle@)?g)
z6(ul-B3Ou3Os{J!P$<=gGw&(og&fgDorxRERIM|4l;s?26i0#b6P><6g-DOE=w~|U
zz_wIWAo;NSyQDIZnq<SkOLHUAmT1?+%P4-YqakHwN{n0iN=1uitze}P!27CQC1c(Z
zWri`Vi8Im&DLsv*aNl8Uhp^Kv%!9Q_EOp?xIuyZdpt{sV2SJ8>8^kGRE=*&mk792O
zv8+sUAug=Bp2E14pRO{Htl<DghWH?po!pGT4gslZAURuD0nVdPiem%-gtfm*=!S^#
zIBvj(?j#!rCmFPs`w?{ER*(SZ2??3gRS$_t6iD)e1UBcThVtKSnz$`ESWst;++E&s
zvI|{kC-W(Zh{!sS{(?HBcS+F#3>ZqH7EHp%51fKjh(1n+A=*Uxx016acG`q(Ig|*O
z9A3PL{PS07I1*;=X|GClh<4&kL}bSan<*J5WsdK)3DZanBzjpAb6+vAurc@u(zRoN
zM|`Rv0l?zS@N}v~ITUPL`LipM3C5~W;bBJ+c_D`pTCP-oL{6AaYNAhKBJENVaKMI4
z+9411?!oQP8Ck?shHI=uMGMaCILI6S?tR;1T}%7_BzFFYGoXLr{D+PUzMcR43D*Pt
zk7b0Mds3S`9*)nS|J3WdPgnJScyL(%cK-8cTszx_*cNBebQW_4x8;<@9vrZWKL-_o
zt;R3j9YW%d`O{Bh%CBf;e6e;WCSBSoZ)dUn@<t=^V}SRc#u7<n!t-itCmvRWW&7Aq
z(2``?;RsnAHV)!P%0pxMYXLC>Xi$VE01548WPD30m0)%_JDH!)@G_98lNf#2LM=lt
zv}1LWMT;NhfmjN3qDfE!B)21EzyzbBwly+FO2oScm166aoz~Yy7KH^9dkEg=&?GG7
z$C|DOr14Hj)5LjhKx<Gec~K>(ytPDEE-Ts_IkLjQgj)D1%_T5Jw0f(upo#Z*HnN7e
z_6b6Oupp6~5b!zQYpu|tY0wn?OSI^WT|-*l7Gd5_q%#Sm^vGsB+fNpPUnK6uqd3i6
zM|wPu`a>HViurL1E%$jVOW#YA#c5lF{35`Hd&o(Vn~OOTyhlxVZv+YgYzT!C4Q3;u
z_HJpftCDSx^0!fXN4hUq6D~TDB8yTP6mN1;xE5O#pK<2)+rMa8!s@>4zi#wQf#<7U
z_f_lMJQt^L(P{EwVz1S_=!=VP``qkVqR}}Q^W*z28cGcdGfV6#=xcP|3iHiX&$KMj
z?a_f^y9Iba&}(%1Ez_!qR_CmJectLcD*`b1+^yZZZ1pj$->nc{0`_pG=)M$}X7B6*
zuZ`1IyVZZoC||bv9YXgK_!{D>(d)O)uG@{CxVr9LbuETQ{GGR~vv#9(X`Ult>;SJY
zUzwf0ur3<y_6ob**B!G*3>0}KK&K{%ZJf4Eg$~@Fw|eGTpV(SFok55ovW-x4WuCR@
z!F*$aqeky-1z<Tabvu^%k86xWzc_DPHk#mZ>kHC>hR&{g<|Pr{eMxYv>r<=W>R<Ow
z(d>55S?reCd(}EKtrOAiS}eG0%d7xNzd`5;3Z#Z^JfB`$Es`G#z0)^)z3VGF_AJv8
zFeC&SH26H1WZmsB&k$C(_m<$2Fjy58@%q9<J9OUB?DcyM5{Cr=p7o0(ffe%X7nl_t
zv)OJn&CZ!gy<GzIx@DPVrM#9!V_FLN>jp4i6Z@<*I-%yrf-P5AwW9S>G|peOh<GI{
z8V{4OTH1Ut&$>Rl(9$Qj*fER^Zxp(6B${UTqG4SOE(XR1-aYKO3QZWM58;1IQWyQT
z$&2MS><~WHMmU6m>23`M&eYEm`oC<*dqkj6l+H@xgRwzhJ4VJFJ>hOy|7-TTTX9)z
zJ;C4FkOIs1-wS@Bje2=L9DdU@SH}nT{d_ofB`c$^3d3XZ{JH2{!#95WZ3)(PTrL|$
znGCGHc{R9fyb*g(#m+YVZtscb;&4w8bv2eMn%iDL#B%&HudL?r54*cR)c3`XdfPvG
zc8KS$1&GH7b!2Qbv52PK=npPo1=VMVwcW#deec=Pvxfsf#wYu`ou-0Nf3~}(2UDrT
zNM}<?CLqHsfF3BQ=Bn?&a4*2zZe^+2Y*_u}me=NLiv_E_Skv^Wp=*E=_BF$~nMNBQ
zMN>xS$YUH@r%o2EVDZ8#qM6BHhffa%DeLEC-t=ssPOncCm<#0Rr#xUi6gSG~To+b!
zvh;4>7Xb9=Q14R^3P|V#esWT5<(YgA;id4Ob$wXERo5I{BbN5pU<+xle)6DM+DZDb
z^-iv9MLx9-1VbLI2gFl8(WmBp29@rcvx?+nJQ*TgI9WL3S*you-=P2Y$`tj5b7NtG
z2e(btvA148bf!TaC*;J5v|~E<$2<99LBaR4o4t3%F^;5DAay8Gq3+#x$D}xZuG2G;
z*JT(;h4cY819~4E3wZqQ%BW$Kg>G_lps?vT0uGxSFaq6H&)e)&pJYF{=JWSxtbM;U
ze?M<q5SoRQ9)6gE0|Cp@)#D1}#<uHa+Mo246~PzgEJ=O^(1cW*o~-M-^W5C(==vyP
z_3}~VwqZ@|DS4dQa_t@`nL{62=%rde9;uI4M9FRBxkB&5n=(C%qS$4}+FJ6mZF0du
ztPbZ_dhAqnluryY9u3S4X_K+VCwi+h3b5Ap=MXDv^r%HJ4+)idiw*>pr7*S*MA56Z
ziPm+L_hIu}Uq<!`OIsr0>kz(fTF(x?0^=9i`x+k4<)^gs1?7BJH%sH^0liX;%VHaQ
z6?+{qEb!k2K}qm;fuP=g)P@Y&cDf8|F>$Vw?fcnUPI3UBW$7zne4eSV1ac{3hYmZw
z4o)#9%omt7Q@57{J0B^w!~C&)@|iUEW1icp8%4@RZcVZ2-+f;7?Rwnn!TGOhpyQBQ
zJbWA+UpW6i+TB|{|9!f5c=YZ3_s_UCp6p~vyfgH|9U0z=I2+CkgA!0D@+0~P=WZb(
zs;F1>p);0g7SqS)n7&v)*)lt?ZZ`X7?{f1U?MOE_%Qq$3EeEA{>a#6P9q{qy^Fms6
zH}R<SaPNo3sx^#!_gHN1{cuv>EVR-$&112@yJ&)uqM^QMpnAX%O?!)`nWO_pwCxu`
zWk9)quxJVFF&#Og@o>@T%xnVov<ROH8}^S>N_WF7y;~=Z1+&~+`seQc{>{dRMf1mC
z;{yhN<c{5-WFXKQhU42wBCM1?WvVaj|8=*;5@Mk!84%lwQ_URnle557Goj@g6$X9y
zjgkJg;EG<Mg5#2==VNJ+DDz@42xK~m+%2W-<qWuB57Hkk83fBjNybp@oOLfR8=Z3t
z*uaOQzV`E%ee7jMk*>|5Pq!}aL)*8h?8|oDYDi|XlE%2wSM7;RtMuuc$^#s##8V%S
z`J-;xFdFT4_qBOG=<+$4^;|JfQs_(K`3v!(L`7bnV<-HIOkaLfN-pKd^|-{hZ`Je2
z_7mh?r2xA_8CN~`!Bj<so=B%C{CG^CkFnu*F_#X_mw*u&wo^cm!_rb&1xDyFEsctA
zi65m&v0)~YB`jK2#UWE~Dt)N>0TXjIXw-MS)!~<$cbI5rX;f8>%Sf_BR%I|vXH_Mk
zFOraWLFVTg$;UmQi{?&98ZiF{#KL|wnML@!=>Djp*VK*^If%HN2We8^>I#y;g-POX
z&5iCtD%er`YxkZ`j`&&6p-`o4+K$KccB9-KK8c)c3yo-N^qQ|~$;2C_3r9c@K<CYF
ztyX_W2X&=twX|f<3IS%*u)SKXT7PFO4cHLXD)!(*DvRRstg#<KH+tgIP$0{}F(y5&
zwBkT>u5LE<2!!hAEYSxesZ?^QksNvj=Zd4<K%mTP==rn)tioJ3{6<lfPkS^n=5U`p
zSGM&4@~urlv#7ka$T^zx*kv+42l9bHIT#ijHmD?qzCUTT(Z?d0(ibLjGB4faa=gq>
zy{S*-LSz0SmaM=~leyTDi&lQgB=AeFr=c=GMGv+fs`fa>no#?H3Geyb-iudmMDtM?
z#9~_M_~OJLe-vLS*@r0COe|Q&10cC7*(WQ?B{!>^OJmr>K@;xAD$uzG^*XN!s?Z#@
z)~RGE2<*@u$a_10;wa!$7;J?mB*oxUQVF)>dvJ3Hn=U$`!-5>RdO4<PdI7f!zGPFx
zsHM>$S!wb@u5@Q6Z#Ko|Li~gfY?T1s*1$jJF)l}e#|p`GktU#p$XrlY-S~jEdBiMa
z4M2&h<Z2HrpW0bjwVxv|+yY%?J-p^61N(nOgRF8jFy`c9SOHB@!I~$GE%1XzrHj95
zMJ&7b--zFe_?wR8%WFeEg~`ib3}c#MGhKS!=yh71=CN4X70qkyu#u;-^;_HXY5(-3
zR8x7Go=ras!TOc?s{CN%!{%J~n>9-7KEg*KVcV^h)RfIlJ(Y?ZG%e~A`n-r#l?%@+
zz>8#+{#%Ku#5HqVH6KK`(*0*R9}3htu2Kuu9P^K5qP!e5;Bq}pGiO)}Yn^{^2Oo3W
z(0t?|byQQ|`c<93`mw|?R}6i3uPg$as`*!{cp!vpMO2}5AekZ2y+6*;t#c*o`c!A1
z;s!QwO<!cKcj89JxpyU|cm<QG{1$+VM!>eGdMImH_VM{JZCJRGnHlp4w3xY;PR@ht
zdq=fh{8v9d!bVu_1(+f|c^$3&h>Lys*D0ztnDn#|F({#L1D_QVO<oa%y!TR3|8~Cf
zA9g)B|49c4??P+Nqv7~${a=0epk9BvTK~uOpWn`Z{`hNs{on2nRR6d4g^E1-83h;R
z2{)qOf~bnXzhYh9V;AQAj>^18EX{kw+Pudr&U^Igyhkg~`&OU#2i50^Q-<}eKJPDC
zpO+ifSJda}g1Qn%{kS$M6^iT-B__4W3;LqyC7~T|l`D8a7Q9u?>(E|C@g1EAyAm-d
zwpENmpZbQHHf0D`cFt6qyM>IFe&V+6l)0v&`j{8n2d6<oqoXp7$HYJ^ClpN`uI}Np
zafPuh!*M!Uuvbw(`Qkr`_p2=DML{E~9CWHLM!t=G?f2pge&3-wI}65GreZ=GE?x+&
z4n)K>8c;ROF!SFJd>NJtpJQy-?a>dQ%{ZoS(v^}*1F;ivq;x6p-g`k7&}M_Tb_{!q
zVOG&sC74x$St>88VDzEM*#O>gQrNK1+q-{1p(9%;zdzyg{S_sb#V89MbyP+hBDHCx
zCBicM^kXe$CThV!S}>9^Mv(gQb6i^EZf&ejAyqu`Z@?BH6W-*if8$}k7oH=^*S}&4
zp^V{}&{yb>`3A8?-*M~U)-?Ng%GZibR?nvX6|JIuD6vDQB}V__6#3?Oi>AMML(5o`
z;M0#nX}^D0{y+BqeXoscOB99s-!D&5(b_Q*6c`Ci9NUn_Alq~>cq1Gq?fB3oserPD
zN>NG1WX1g~`&ssred9K-HA@oMS-tw4)^9Bbm1^F`9COTZAG){n(+F6vCA$BCyJ8VK
z;-?g~nNm&yVichFL`7<LDf}~mJ31-k?iAr1qw0XLQz$S+4MNArN@1AmxG#zZlH&P#
zgrAl$hryDbQ~u$MV&|6#*h|2Sj3?>|bb75>F$H%C-^Xx!>6@_~d&`u5RBbILA4$i!
zAT*`my?hCmGKVgs7N#p<_psU{1RZt)FeI?6DIT0hYLeKDoM&q*$3N8~&cHw%D!ygS
zUA-7bwg0u+G;cDk6aT&Ar~h_#bbR*gaQAs9T6Z1;4xGV+>dhxl)*D941*qOhNn7_J
zy`cqw<Xwn2uHXI_Zr`kIU(vSB?OIklw=G3kBj24OJ4n%^7r-SA{f=I7M;miHx*|3;
z*vC)p_N&v=L+WU=;rD?k^8sUJDP_xK5CQ`n25SAF)EZ`hVcCdAs1!kvbklQ`SMVT|
zpt8&TY&EJE14Q|1WI!_mGSb=ii*$B11H`}{9(1^`hrtD=I`np&qC(FG6*~r%38!^^
z;Qd0UA&$mC2cl(wlKS&wGEjdq4dK`Ee5>c`;HdA`5mEPtxuCA#WM>Mg&>5RgEBr;C
zq8Y_u573N^%SmYR7}I~5jIV}ifdS9sA<`UNn!4q9X7*);Phr2wlM4R-3|RYPqHxD!
zy2RlAiqv}U*>j5NNH<Vrjh9cuQ9$#p^w=52S<n+$2O7BQ2p_a0ygoWO1q=nA4fsd6
zaGkezqC@SyexJN(8x7B`^gaqh7YXHtVWW)}p)fd^?LZ>x5(4GJVG`*?Ft*z&ew;fT
zxT!1jmjn8h4WV;@w7Mqb%zjtY;s_Xs-c^5f2Su*N<C*aI>_8?2gN6%%<!xHF=|Pae
ze#r%QT`@C!#2N%``&s*!hP!Fh<qGs!;Iirsw?Fz7w=Dp9m1+m`tx&3<{~CCHHi+)5
zRPGPJszIKAn2vr*Z{C1Jnj*{B@5XS535^+_|1|cSQYXL6=|rMQ1g>R{5SMJ<i$6Nw
z9#I570B<-Q4BkSwm|Esti3fb_uhpL=(D=X!_o*7qme|QgsN)NM9SA2Z6y~j0Nj9$7
z9#d|mxG7T=Cb^%DCpRlA{ERZu+(1{9yQdArdr}9%^5EI8XDFP3tO=sdq(%eKP^&vx
zU-}CZE_l6751q*&mRb;-F)Zc4I@pVA+;w?q-3cK0t8qR`E-39qLHsgw8U0LThHfwG
z7_M5km6e4AZ_NAjF7j3Cvy4=#x@WszuQ%w6t|H4Cy=?cp+h^4jFy%LVvaeHXFva&1
zw~wsJI2|zYw1#Y8o5?sC7U*PR_m0_2E=Ylw+ugwG&PDIEd;Dzv)Iet7^(Y4)aS9>5
z<c&&OqfA^ZSFB;zm{2H73rY23cMiL08gx_2ZGn7zKm8PKtVMMc1kQm6*d2}1VgGnI
zxOoO6Hta4e(xvZnAhjMr-8~JFRDAlQI>)0=F!Uqy?XlOd1!}l+(J)5-RV=*nEsXcE
zx|^LF)FBI~UrYChPm%NeGqfe)^Fb`b!+9YT$I}Z7irvAj?)qsDuKx4Ad<usp_||7j
zY7P;fkT8s-PYVt|nm;vo@(&G%06C{lB`u=NbAWGphwBFg=1@YeF6|48cbVw>q{z@4
zj`Xj|gwhJ(3zT#y#cW#uyH%x}w8cm0|6@ZTLhwEzB8yRm0hVfrsq`*-#H%?^-}@M_
zj03@Ye_Ww5pjXGs1e>ll8_TE`$j|He;&Q{<A3S08_uIe*zK@<n(g41!toS!G2+CvN
zG7+)pt&eZtzgyiIO~&qJiv011Y(#*C^Vhpns$tk6#K*pIqaoT>y4(>!@1vdVXagWp
zay+RgZ`avb<YEa=jQ;w3sZsI1IG3dIzI<(0zTe^(Ci1>~J*D^I`v!miZGEXxYK<!K
zY&cC_kPxsCt}83=9PqiX0d|?AVqR*57(MY*44+cMmzdE`or2F+%p05GNqSo^Jw*cC
zlvpU#{g78i`xD?aoCzi-yUI&IarKrqNK^uaJ^=8Hn6gAX5XMm|o#6<g%rbrlD9Ymz
z!)f5z!AZ(FQc8p8Abx3+fOf`MjYMF(zu!J2Jz>Rbzx;Cl=$HG@FB{lshStw;8OrTS
z7wmoEM`Y}0YMqnh1Kb!C!H3C@;O1h<E><EPi)!)$=TG84^K(T{@X!LbGr7UuIT0DM
zz2hs40U-z|{{{*y<P#;C^6ZTSxLP}C=~wucPbja{jW}vVAG3TQdR$`K_|`<W4F;u5
zq9}#gPj!#O(Nx4%>U28l)1jV@aPt9I{CgG-_-m9%a4E8GyItnZ5XbPgpwty=e55%*
z%;RcQBlh596*yAMMex`Y&X;8?>2F)~c4TsUe~@M}l}Gw)Ij7L(A&YEn*^f~RF02hc
zp+tvg6JaL6>;_gzf_Z}EUAK*NbX&cPw*U-DDz-<a{Yvwl#hlXR1S2S-IwTrsJvb^;
zO?qF5>L>laJotsFCO&Cty6N}uZGE{c8}WTu{zYAt^(xSIkY~{SyLXuM_UE=G$=R`?
zg!(=ZKKVfSC46;!6<Ab*<mi{Lx$a-)ulvGZcf}R!tvmJCU2)T@X3lkMJvcSs+W0RA
z7hqiwUf;q6hKykEYE&ne&6?a7wGjTw4OIe%_gXuM{45U4Zuu(M@|Cpw8o-d{Ed-33
zthY9Ma5>TbzTO=uw}s1`#<JuE0VHdld%9Bpbj>*?e*sld3%doTR_%=-SP<+Bbf7U5
zFRsPl-2TPop5;!4TMzqie|xVKM>F<g<nPC;|IYhyo3rwD_T!bmAFPLFHT27a!@~p7
zMStCG`?|+y-X)dzm(=d;W*h$9wo$s<HvhSh<gY!lyQlxmhxUJV|5ha8)&!!o`+p6I
za3|r|idYR=?`btAiNoo59JC18{xQ_QrLPQl%Am>u4c%-oe0%iEyXfsN_>XKF`~|EI
z{M-H|dLoL~9r*eRzS_#zop;Ld@hw@#)w{+Pu=DOM$+%84`)8f4rbs7czbt`}ZC;Mp
z*7R5lulCkByP~bu(YE7d@z|J<7814Ndn{ewBf<KfNYpk%s*S<cjs|Q?N|bGJ=;RIW
zG3AMYf$QdHZBQy%uh;+;t5=)vV$&*?nb9=K?}UtUwCM`O!%vk!{u;A0B2C2<X<F+F
zsR0{O{r4Z~ICm$T&Y$eY?8$D-n`}Ec(G6$LHf9CkI{L@V_0^(twF#6z;d!2r&WX#d
zqf*ad_Syt|k|up~K&)v6O}WNG>>UrGN_r4-V&wcfan9I8R?<fKWVtSZ-`E87>2&Y`
zI}mvK1W*#;RFj*K)mTU;X?4+8FM0w5bO%Tx-(~NRR0?@RlIJ)mykqKEqJBaf!=&+@
z@)W;JaY6>a!VZl}RUPzNR9=F%iaL5d9AqEp84jZ?K;+)8zKDO^7&dzqOUbNRbLyw(
z$#gI=o`_^@9p+{NW82{mm7M6PpA>A!g5LXiDrG$e6RO>F6T#i1#y}Hggw+sa?&QU&
zI~Tn&>EN+~lQ>3ERRiguxu*2&;`CIgAz%_k-pfcWtK$q{JIRHwwHCovqDr2~DK{{F
zZuHK^8rqJ_@7Oy@FK(`p0X*v9(h1zqw?u4Gd<eluTYQI8s$zsci2sXr(p0aof}amU
zo!mwyIrRK7MQ7-VDEl#FyIbUg=_Exx^e5v<hHW3LvB}y@>eXVCay)bXf|)5Z2h~KO
z08$C_kP}R30B2ilF>#b4r-TNDVK!K^6W`4u$N$XC#Ph|OiGL7<z8i6NX1b7XpEiE~
z%qBQ?)gbV&J&rJn8P@Y`Tuf{$_5Zl{{f~R!|LfiRU_x(<A8$YBt6F@OuTwo1-(`p%
z{S>`Dkod~90}PVt`qaPosV<Oqoa*DnofXQ<U+A*?^Q-nRuMSSyZ+B1M#ry3;;6)D)
zj()<4$UQ8MQ8L)|<qb{^xd7$L!dFi+h%R9k11ZQ=_F5tvHf5Pb-bDPjY*3?Pu)1Y{
zg;;YuS{C(ZBBcS*yxjqEKsW4m*LU5KY_!20LUbZ)Jl*?x7M62dVYs4LEXu;oBoyM&
zlOmqh&8R-hRLn5p=|r&d5%NDpu6A1Oz3uqp;4I!^{4OTA5QoJ<^2g2jI8D#+k28Ve
zk5Rw7TigtL`}Deadq(CSX+)14+%=zmw==7qL2n*^w}Agn>M||czl)v4r=R9dRj#z@
z5X&hV*DC08L2t2E48z3XNoE(rWbl$AhSNSfg+{YhwSezsRD-G2?Do>7<^5>@<a(4^
z`o%?@L#-h^A5q8A?Cbgd@uVCFKz`(I>~i#v@B-W*mp=;zU*P@sS0RIT#C3)H+ag0y
z!Rj(ZECwkADb3oy0dKw7x!V!7VuKXpBE#Zxl|3y2I_YID?5f~LFqBKy(hR`qtP~$^
z=~lh~#l`TsGkE8&G<P9-i_=yl*1fVEA8)v~@5{Zdn1K>$m_d=PrTl-2Cfmp}OObs`
z<hg@N){a^Ts$d(p3rv`CuzW};R<aZ{;9*i|*Oj0Qb6>YSw_SZOWhkGovcxZ35cm8X
zTFGQV+E7XMjOtWe((Jvd5*IBc>pku`u8<T<f-}D!J#mGMQn<9dhOxF&%CkZ1EeAt8
z!nGsw+krVj3Xp3t-=zU3tYBGZVF_kIS{=X<D%g(cI^fH2m10FHixxY>+MFfy4lo|1
z!#aVPP`V^kSzhs;+TVVwECvPUN;Bnp#|4VPW>zZR+=(;yrW%Nrj~V_e&MM|80`$XN
z^Dkn!GwP8TIvl3g*e3@A2gk8lk?wB4U)n{j&Mw&waeZfiFwmPDz4Ma}?~NsOu3hrO
z0Yy-)GkeKqD}1yV5JbbcWDSlJ#*4&a_+T&UxhJ77j#ZjfgoO+oUiZH#R$*ZhRp%H}
z^O)&LG(HNGbdFHUPO0F8tE51@>~~)e=`Efa1zF8NFGIIn$nUs-&xv;8{`HHCaej^G
zxXus5Yc`O-O0RmOn|dAHgqIuKW<_W!y&PAy3|;&c<PJacFF6PPHFd|_jTd)REEX=x
zVtAd6hGT=e?UlwkJg{tej46wRO(1t`O0qr}bf@QUH(C;~A*2C*GQ?p4)u?^f@nCbV
zx?A?U0sX@47wz?Sifzgyjb;L))V70LXK1m@7x(H;D$EvkMdI$!-Z7@lIXgIV<g0?t
z0)hXr{g7$gV9;VRQl~d!iE*MYjku1xD(9e*$W#Bh=R>at5F9H^2bvw*6HVDr>5(ZY
zFfDAQ7;Q2#D5&#-ol$@C^BsIt5!_Y+dKI@)8mb|^Z_6rH=&RXvnMQ-=qhHcUU(wfk
zWe3(T_302P36M>Fs2cdvjvB@tbhT+Sx2aBl_9&7@7TCB2m1HM6jaE$E0O|KQRa#JW
zC5rY>N3~?dBOCB*<&C1}sEJYgza3^RtM{jbU$$y^@97lN;6Q63(J&0}P7LF&(qAi0
zjcAITUCpwoOBkR-BPoF|Uis=6W8??-%E5lH1I^iyCPE>7`rut}PH0*sA8b$UXgU~>
z)nEM(^w<&_L0r|h;)2h_#CvgO*OlG-`(pVt=ysKAjH|gBJ%*n`n?vVAz#V-TwaP44
zNpQIy<0&$BViO~W+xQYhz&Sz;oU0e8@n;S8kwkcto54#;i3At!6{d{rA;&{mOo&@U
zo<m#-hD#H5t_sQtbHj%Vb6QV;BTX=M;gHqiT7hm-->8)vn9RmPG$^(FUB(V(%3^?r
zCgDQ$UZXZ+hIr%yu^JcV9Hr7C>{zRr8V7vAVTXcxhxbPB;5E3d_Thb*4f|ZuLEv(%
zK;rwY#}2hYs183F%@jJHd12W0*{P&tp@S8#d#z{q*#+A-t@apQyPx*Pfn#fUKzym3
zJcqewkgWRj*JGQDj4{~m`te=V1`F^^>eV?MU>@J&Il8Q$%X+Elt6cro#f{5W%!z(Y
zzRPd*LsbiQRlU)0)0@zXJ6<O{Rwp~UligpePG%B8Y?w;A2C^pb7xrUO2Kj0_i2w3L
z0E@9Nn+>IjqN~Pv5A733k(=^t7Jq8HN7oIgfNzi`%a!$F_oTg#4cgD!CmqMDTED34
z>%y?om3p}Qi=X!eD@XvdYSyZS#X4g6a-+^HFT=HhBjHYF8-<?bV-{!ao;28e8r$!p
zMgKa8?J*2D@4By0%y=zr>a@7Hx&TE)tmxj{N+s*jKTY`n`i;`BW*vbh<H5N{qGqsq
z9{qBtTR%kEs++F*l(BnL+1jO!i;KIKo;{B4VO!q|$TR8qlO$s7F7cmnnycPC8Js|u
zlIq)z<|%a~dC33bn`NKoviRL%Q~tSK*oqHY?IJ3Ek8G>?a*kS2o&n9}RJH0pTIeR>
z%R{B<K1z=8ZaEm9V-mcZ*>}l2>d7$R>F5krOf_|{3(`xcV$NI|`B%_HLg70TMiH%e
zib@{Y9b6|j<mF24bt$HnK6(1<v%_O_>%kgJwq;9u5yRFb1G~b|vXdD0D*1r5Ovd8k
zqteaxQp$Zv%Yf}pdl}{m$IU(`pEA@#tL`ZCDSAyyO+2p;Rh<qSC+F-}Et#W8ZeP2b
z6>fnREo+nKyt<(}$F!Z3$-tsX33+-|k|R-QPVxyUG+iRZZSO>fstjYIepilFmS+97
zw%HknBlvDG$By#`10i5RDZO3dX8sYzp&D-orM;yZV!ZvN8cX<e!DF<`T4Qn>%SPLJ
zx4?q)hO#wqds~z0ti-d;aEG_B#;_kEp#xL>FEX`IE6a=mbjBD8VrwaJV0A%6a4Zdu
zocvX(uI%hx39e-uksYwi{G`!b%p!7o+W@Om?rImPSVI{bc|8<qd3v&Y`209pU5yTO
zQgF`0_6bhGMGl1N@`@7raW^{Qv}*Z8zqJ#st*u$gHT<TdCnsZk?{KeUXSG*oOa8WA
z_H%gEOrX?J<pxkv;Q`tnDRq+5f!Y&0yN1~V#^l<dSJWDw<wQ??o_2bn(Adu^%GHM8
zPW1L*A46OZ+eh#(NU|??PxoHHx9ABV97eakIXHcx9_qkWMuJZCgtuqM{PAb>Q~TEr
z#epR|^q=m|H?ucHRy56qlZ_T!V_B?H<JmD1L%8vKmje|TK`=tYvjnTeQMVMf0*tM^
zALHLrjg)KOlzWpy)O~Nd#BZisS8v#2y<uHVyHTZ#UnuPpPWLK@Yn4msSqi&oRV$%G
zm_&J6U=M30M@7BjW=Vh#b^`kw?1X`|U?(=Vlza04zhIvhR&pj91*njwc|lt%YF^`e
z7FNY>n2-8s8S)~h6me-XoQ@usMzztCjB7!BRiCQN2&I+FF>_ZP?L^Jc%9BNu=vtg=
zbF2a;_*aJ+FdNUVEkS8Cs9gPL=bMvVa-|u{FWGfoX@y>475ri#;u-&Ufsas^nO3=#
zlFzSDq1mlkek<k!a6r_F!hgdiIqR}lpE?c5t-8Th?m?Lk&e99`shv8-FW{;uxCR$y
z;ly;p;$uWSWf1~9Txa`e<5HlvoPe;znHLw7lnWALJrlG=vrLFJOK?D-A^RzL4aue2
zD1|s#n`!Qxz@CMFyd}EOe|{`a3!gVI8DL4DQLoj=_!5{A{U_X6ck#~Dv?>lbBhI1+
z+r^(dCHx3O)Q=R~LlzS;ONybOW407-iIS^sb}`MTSjlCaTwxAR*9e+~gy9n1c!fq)
zh1NIG<T_U@?4zh$K3sij9*uFr#gXO2T7iyktGr-~O3JMbCzzRlSu=L#R697QO0`t`
zqnnHRMm!fO29CXC;%LO{beB}4s@X_0fg@R)GhMwa`xHm0PWxm$9ZKXT00UEvkF}x5
z-4G@IHP90C`rzmk*f2CrHOU8rf9#fioCOQm2bn~kGvA5q9&oFRE(H;6Dw+`#C8j!^
z>c?c54F*ZnzZoW1R0=P@05rRz-_zdZF#COqQT<Ax)tzPovS1|<)euDw0%V&%#WxKs
zN~`1|1rW_WCyvmY$i(%}UFYYnrQ7R(JU2q+gXs!AQK<M4RjN!TID@xY{QjMd7MzJd
z%^O#}yS}!Ttv2K6Dg5z%wYe4@<r7ivQAX~M=(-7{7Vc{q1U-OI2cq?P;*dqT<qI13
z{Yo7tztU_hzkjEet+F2@Xm;bLjR*v(xAmuum3n=*v8)<2-kFHbF|CLaY$w)E5s+iT
zajL?AvZq2jM8s@ZOwZ4=9tka1DKHy12KFVtDVzqm!fr<)uc~??3sDoKA})IgUS)dF
z{xsDUqOhw$c7;_NsU+o`p=ou<F~}^IBXO<M!it9#%kZWvKB3cw>gY+-Ir#TB1!QBv
z3-$QES><+V0K*}0*MCgLH<H#|bzmtPzlCSB59UD`{)-;U4ta;^1Lf?v1|-RKMg--`
zIvJXCaj)P{SEzGef6uSK$Je{`dLaKgSwF~a2<g-NpwG6<7|Uu6Q*+EIz||Z#RM*6A
zsRQ-l11PU%1-%+%Uhu%cNp6&-6YCyH-oi1a3}@Z9aE{+qO!t(D0S#SOwNLR2;A=WK
zZxD&N&O@^;QXqSzrPsy+N{GT10~DQ;9^3#ic{o)sShAteZR_-?$^;D1(+Rr^^)MPt
z3#Lx`wRte3KY_#nR2nPIAONd&)|n2i4i~3u?8TH5gx|`svR#mC?WU9KRJ`6T0B{Zn
zm6Tm}f<rb#y}<1=E!+vky4e_G-MvU@_0gCQ=eB8sBfzBF@3z#t1i13M7KEwi9d7g^
ze|tpVsu*UU+3V1yMf$kjWD3}Xa1zh}3s~b=hMLLXzJ{3unEh4P5Zpf9r1t@<XU0H5
zCicCTnV9nr!~A+k0terenB#ni6%YHL$`>>%WpJfPS>mpV$tWm+49-f?VheLlbm)ay
zhwhw|Ys++%LU*h>=MIR!BGl@;7q(oyNXU>`EAtWLgny<yh-t3a8}S#cIG01i@)@zJ
zXo175?IoO%-o)qFlLx!*P!&IGe`U=#=C+8}vskavhX07wv-!fOy$K`&kW}#42j5tt
zKLc9*E%VcseO|xUFdJq9nmYTPv!mmKql42JneWHmO+=I~!BkNo$Drgv8=<O|e56}H
zy~-HbXzd|3PxhK`9?FQKJx#d{^)caU40^vE2D(}}c$tjY1G!}#QpXvZ8D*4sNYCZU
z=Pn|ucKfnm>e-8{(HMqTX;%ZA3jkU0CTBF|mG<6`zQH}jRi6<AyoxIe+-LW#iVJwW
zBU)Q5r<y8aXqt^=5*9P<d6&{My{DoHFxgX{f1qQQkoy63Svnw$MQ>p{Xo3;X)YALP
z^iE;)4?L6U7_ST7>|hZV_XIP5gSs#G_+_ijGGTVkZ}1K85Wk=C4);=eW7fTSm`;`o
zs@uxvq({YBC(7)|`>jYd7y1cZcwBsfs=Sb_AH3W`u*(qNy57V0A!zy#U0p51!G~Aq
zol0on$3gM{pj|c6XCI5&4s{Wb@;P?AHjtU<-b{>KY9MLlptE!wc!e$v253T;yE4y5
z(Qaq=)j}9boUspO3{{!2Ts$(Xz@Otk?`=Q^0f_mF@O)oqMJmS^_7>0bdmzYYzm?El
zW{SpT{)-t-;lE-$;8Qs304ef#VgHqJD)o5H^>k5Y!xv?u7G<DBW>Z{K*_e^}c;@&h
zsn2`=t<p|?t7u8pzPLf88rvL_W%FGYVDw@M9nbiNv#8IiORiSzVJW;xPbnmSIc6Eb
zH#5-Awr#fw9c~7NzT7I$e>s$=wPG8;0<3RUyE(5~7Izykw{C^8Y=6b1x_6pXciyBZ
zNtq4MP%nCCs|J>xw9RqqGmC--SmVdSqSGTO%S}am%GZ5KP9a{Js~n0QB#w-?Bl(KN
z%B?{)qNSE87U%mE<*}>14r6TvPX{m70-T=(TUUN@qh1uFXJL#ry#CvDYcP82(ER3&
zJTr2y(=VVMvsjLMs4Z%FyRyf+Bn?C0?lGZD-Rb2IdW2#CaB8A`dZa<l<{2l25<Pls
zztJtf(bevP>|g_v`j`Lt{5Sgm`ey|Og#wn|FUGz5MQ@yqP<~(QeXTLp;j^{1iT`bW
z|6twz@A~>iv-N$m`7h1QW^3!ggYR1#@LqFkedGIoiPpc?1ZI7vNDHIrU#49^>*<X5
z=KTKO^mAYG_Kt4G*~R4~!gNNh_4OZCTkFkM9Cebx$AqNHPBJ{t2H9woM^7-AbDaKx
z7s$m`k`1DMPD%;%ph68sM17Hx2ptJ^QNI&JHXz>JDY2c%iJ}n>P3ZY_+)L?6Hyb8n
zQutgI>;r{%4N;O}FMI>B?JXvC&Is!mk`6)VSLGy(C>`XO@`EC^RUo&RE7Qp%nO9Vr
z8ztSANul+b4gNss5~Za;^9H5$V7Q^*WiO4D;~8c59ApJ$0<s4dLD0+!M(quf>?$3v
zRZRtkw1A?fq5=y7vr)5<N!@8SqK;8r_46J%E+%T{?qlv|@;$ji+h>MqHVu6(o7oG|
z>pPMJq{Mun79D0qYlaD%r?drVNkTE0`pCzHD)Ne{!!@jP45)`6Q$!S)!xdWb7(CD%
zgdX5F`q4T3z>p~N^T{=$fQ3|acd9C$qcNpKmlC^#T}2@)pbY9S4mwfi_}S^3-II0%
zf4@38{`p|Py&paO6@F|-d&jSSJvn&(;xu}3e7N5}=|sCn`|$MW^yJ{_>(gU+P}}W5
z%Nm^+_-*&-*Qou=tCM!86CIyK2QOb89zcIEz{&2>=|Q^_V+_OLYm5$zBj_VKIzEjK
z4_+Re!fU6;F^)@xGfOR_<7d&!_Q~E0_`3V_;PBw|R~qu!!RZkW_YB6{jb81ZoF44G
zKHNQtUcEkfb=;xeaDDp+oxQ`|gO~07HJAg88?}FKADu>>7rTdt-g1xM9JNny0nS>V
zQeTG$yH5|>JRGcc|KOy(cZ$n0f9(MfVUmYHcwV*l4)BlmFKt-S?#Zt)bW61A_^8wV
z->>04_&wU+eYyJ_)>xkd9oV70*C*|lIPv3W<f8lfY3KCd^z~^wdVYMoPhjt~Pkuhw
zYj++;hsPZP-0My|hCxnuad_+npaws~-%nq64iJ6>^rO@E$;s<irw7MJ4cPNH03m?E
zF0|e!SRWtJngLkHC%<C92n^baIC}G<4bNfEk7RkLC%Xs^^tISKwcmtM0iLJUVxyz>
z^TUJZ?W4Um{(6iZy*cQ#8@zc39en422Y<5*BfrMw)26}P_)iO$W7^v2;90c0|MLM(
zo?ph^03|vHf<ExH^Lp=vK%bMhfAcpG1_o20l{Il6zpUBME|aGFWQ>IjoG0*~V&XTv
z%7KjK!>oso&GRRNX|i^?V?Riyp9WdidpJ!>&wA)7<~{-%c8O2EVJ}$Xie8Oj++IF7
z%@3yu`j(#^0OJcCo^>Xabrt@MBh>(Sc;JU;Hm6XfFKCa=rp1@^z;@~{=wSEaVvLz+
z(pjBwf{KI+)z0aU(rJ7NNb`JVd!EYVd|p2iP&a!f*cG)uLv%syO&_ilyU}6QTLr4u
z{5Q!OHt2T`hS`KdtF34IS%ECM9S@*?YY)Rer5}@lo15SbTyXnocY1L_0<)Vz1Yd_!
zsXLw~hyCthHcVgSc^OafJ9UNjJ8LqB`2~77!4*6i-?-1|P8W}62axzayt0=}V1(WW
z4z$6C1&?Eoi!&AL6xj%IF~B=W;<SR^#5*0CRJ0)#z<}^Ie=*3r$pBTpzz0mnY<$p;
zIQvh}o}RRKe|mKc#JfXIBU_s!Qol?-S?N%^<23m|HMNUU2hiy3uzhs4-+s3H`tUSr
zJ=hXMCKXpfT^)JDkXeOd`+%#tkA+>L{`6|Z9rFAT9=vSU4FJ<K6z%LX{{2{zL8*tL
z)9$Oym9pTDnK0>L#wcpJ%UR~l>+PT6@>Hzr^^bNlnCyqNPt6Vr24zAI>y5N;by1|m
z6zR6aU@i~xi-Ou73cm@QT#;O`jj13*2s;aT6Xw>Faneh<{Y%vjnA_<@7(`t_J^hsS
zrjt}`DC`#iI51jsy6atLgZ^05UMQIG+RBRn-ZkqN4)nUCw*e%1$6XD@8tNhl`HBhd
z_?=PihsUk~RLTq>drR@3guC65(-JPk(c?&Y3XD+ZB843dg|v9wAHW(ysH(bvbJQI@
zuIQqh_L3<Z8M0!{bWv|a*GWOX#+K@v0{)6|Pi6$<Gh&5-BP<nw>1dIm5!|W3gTl81
z(?gUumZ0Y)*V4_Zczolr(s+q>-h#C=y&fiUi^OA7sD)5I74X}o3|XcXhoxR6pGZTh
zXn;DVaAJvYiC=;<KW=k&34fnqIUROnfK9zlwb#WZokc=o%!?y!YIJTs<GE+jw)*ux
z$gaJffV4ij(dDMNq|sL!f;c|RsFsdND8&;E0zp#|rffKxPPF^S8<N<h<^{UzB0;=N
z3QF?C2!ylif@IH_pkuD{t`@lw*>v$Nln`Ta_2mIofE-Dv*c*Bn5K<%SS#K!eZK<E3
zwQLEl5Dw7KiABhP$Za;sj93VQJc>5gX{NL=saZjn48BccT&ACrK1hvMaM3U>#_XoW
zJyC0{)e`|*YscxqjG(Dpi##F4Z7?`ug_V|~8K-f!clt}zn|u<-Naa>ZO%b4PTk8^Y
z%f0mw<F=#Pdb72$`C#k&hd(6U9$aBH6Mm+`wy=9*MeafWqT9u1uSZzXhn~iDXT;@(
zOx9@0vB5KRimT&nV(E&0(jjT=f*7^dOa6xpiMQ{UDJ~o5{<cmXy?y`g-ukC!>y4eA
z&4v|JY#MOVD{f-7P%pDJLtfv+Dy~!wRn^q|YUhFvA755XH2_x-b16E7afs3b{Ke<;
z6rJ-DXCiV?_|ZsMV98NHCrMRhQEp)gN$oOsOz4&jKNNg@Ll0^J#uE=3vC>5t6v}hJ
zEDLLEm<$)O_%{G?_=xpl&;w0}*Ro3=Oc5@ifpy~5@qL;U8D2^^NMf}MqK>PL6=z_r
zRTsu#0H8hzu0J6WlpEVjQ|3r+t3%WO1+vvtDu-d|g6kVf6hS1Um}cw;Z{YTZm0`SK
z@ruz}_UJrKkU7=$^sp~B#s?sZ-~eL6%Yq-%F}b(xzB=H1dxn&f!jDj3h#NdmS0L#{
zyEha}Lg|osI_SuKaQ`?OfyknRn9&>l5kt+|Z{j0!+T4ClMfr*ZGnz;qf~1fwB$O+#
z9|JsK33%@8doZ|J<LG8e%Und$f?W`z^Mv#OG7pkkS!t`&Y*G>rhP3#pVF&|!TS~{{
zrRY3M2b6VQxJ~Sa>&?lP#43wfGGR~{T;_!#&C=GfZ}CN1e1XzTonC(6)fO^_S>USC
zXqptMzSXFmaWshiWFz9|l@9ai#bq?k^DDbMczHA}E~5ugszb!ZA0PW&i;jWXB-vn!
zp$p{kLJ%7zs8jjo|NfuI`X6n2)-yp6IHOpdoa-DtZO|PtwnuYV$Qe3=(pXm{e^g9f
z17^)KO0#C^6;8cg8)(q6lm$TTN#b&>=7*<?833dgym87}tZMqw{$s5i`c*Ef0^rlT
ztS^sr4OrZ)rAJGTB7Sw2awrxdm$~uBR{Q@oyS>s5Rd=v5y91*hs_tTSb{ASdRNce!
z>>eBi5%&@UAOjtJ_q96u&#%?d+3b##uBsX~f19(zqO6ihj3{eIxtDl$FGf`rnut?1
zd_?Tc7pXMW3D5@x1Dh|$b^3Ls887`dUXnBAC9+h9iRf($K&P6FR_U+Rreyq5&0!Wu
z3Yd+i_0h~&PIR&js^zV;<}Yxr()CU&#AM7SDf`Sd%Bz+;g*-veE;r6kfuIYBk|slf
z!MfuKV%ANY?R%4`4hAY;IdlMT$L<{5u2$qn-RWGAE}(~A5U6_Nhv_w4=Gdu+57ts@
z`G=bKtG&_^@U3^Tl7$)|Ufs9@BF)#G|3!-izU9Ae)wfpo-|0AA>GMQqWT-;b7C2s4
z<@2SATOnIUTrbzj#q-uePfD67euK-*K7J!F?3+9>D-Y`;2iB#<>d9y4yauoUKfbiA
zK@^JF3((H@E56@t^_{|W!h5|Mf6N*zpST%7-|*71y+~ObeaTtFDYHQ*Wf}BkGSZrI
z;5tv*omU&^@qtmdr0FHSYhm-h?7d+5L13d6Ya&sevBP>NmwAzjBq0^B)4tuAFIQl%
zwX0-QL*D{QYb~<HC?8D+ZV_@0=W$qb>Znv~8|4!5bbzi!OtiRM9}#DuNq}G&^!{!s
z`cY>8h$r7zsMA~F-YwCJoII@=hJ2H6*=1!2LZx)pET#Oh(9@QHE(KL}^cLsZQ?gZ*
zT%dMR2|z6P_NE|vd<?{OFiwy#LRs)b3ly1%;;VF*An@r(aIMDR2?XLo@bk6gBnQl;
zCn56ZQ=QMZCMvVvyDft|*TQ_83rmsNY+#+3TXCa{+N<v{D|;6v=XAU#OLv&#0=Dp5
z%#Pl{vPNVq#gyaw$FH9rw$Jun?4ER1nr^Klj-$}mJO3sLjQduy<pJ0I4)$puZ7EiT
zReRLjTs|0Q22YGWSp6UcWF~o^T2n%m$5H@DK)1ifJN-1mOdyFE@HBlV(}SkuC9-7I
zvH5&!E|7uXGlJHI-@h&2r&0@Q#a>pBU!7xrA>|APv61pDANo2g?Ib9AWa^-MBLrn+
zh#l9OBTZh6@sd4`OeP&K&Gj2fk87*)i1RI}@?1ThbGNg)kuP0c1>M>u;4@%qSoa)l
zf?`Tmj0F>KRxj#qSnHVUP%KG(%3+hVP}IU+q_`*^4j$P#Pn2uLD}duH34#`-({^iL
zi+=aQgykNbTZU@{9@+Pm5eyB*!YK{%3jwuN2@m}r85Ng3W4aT7G3a;Kq+?8?0pGA=
zM@rRBA8;RyV5yUH{6a;F>W#SegofUUzAI`mFRO7^q!-ag0bqAB!BG$q&a(^DjiOPN
z$};&nYHhlXaaE(dC^Ezfy-?Z)toLd$1#xr_;7v)|<kxI?p7W2jVF&BW(hE-h%YG4E
z6&E@MY#AO=?YrVp^j-fE0mQitp|dr%o5%FGW$li617~x3II<nmBC#LlX{Ca|?!+GG
z^9&NgB;#PnYAWj_reZI0NdubyZM<iH0&NQ*d+!Z<`(klYd}nnsPDUfjr6yJ~ZNnu>
zg3#2Y!>}yym=3Iq0hnofoMe`oU8b8G=Ww<a8Gjn=M*JD5eHVq4!9*M&#Fyd(I}M#>
z`}ocg;x8QNwp;>@FQlq}4fqab`!NX-6t3Jj{2-ay`(mL}Rs_m6H=T^8%I2lLXvjpw
ziM+;9=VkllQ}k6X@~f2VFZD6K*i|;f3ZXsb82MBY#Ycx~gliq|i9v!EIe;0_@ZIC{
z`zrf7fL9yePxbuC51Y*Cl6;EN+~6Zg$0A9NiegI1r^Hl+ose&jHWwg)4pCf$7e#he
z>=NN}HbDa<d7(X$i75vn-X(S-<2|G)`Zut>$vFF&yDX=WQ!MBqW0lp(f`K&)9EG%>
z`Y0~iOYAO*$UAmOhlZH-cs*YCELGu7`Ru63K6&#^s<Ua3F)}SI`Gi_fvJu+D)SNoF
zfT7PTvJR@xvi^C@oi3dxK)RO9K5N&$R86g*#2S<FjU&L5M5Y)CtoAxKL;+Ky5O)9=
zd#P%c;Y~;;EjRVzGL`Z(z^n@-&d%7o^9-{+z)a6B(*f`k4O<i=DCZ+35ZN@p0>Y)%
zVbrSJ9~)`D9{PQC6s$N|6)?4>(1nMp+#!Ds`V_RZ&hGO!fuW*06RL){Rkzq=-39r4
z{S_W3NQbq*iS70Ak8?RWQNxR?!BTHY`A8_m7kVGcfsQg?mQWri*6i1!-Gbx+IQW<y
zND`OpE+{w%iHi>J(f6Qz70}F1bK4);s>)Wn9W=2F>W(&jdO6RWe>ZFX<|5X7Tdcaf
zDStC$%Eyj5uOq4`uQ;sCOmm$6KFu)nE<D%6kn!HhmiLV0Mar2+`lyt4%GOi)%1ZmJ
z0odWIgA6VL*oQq(vy!wdn7s@7ohZE`nNC<6!5#n;#{uB*_3qgzCqR8vT2rv{D)pXQ
zWE@6_iMgga3F?upj_{1ZH0IOe<HPpukr{NJk;6@?VbufU3E7Gwv}t%n6~l_l>W?%=
zH^;X<o`s#`xs<#^gA8?H6?2*glB3tis+PCGiodU$JeE9!r7Kxrgi{Pwdt{&UH@+G;
zI~PZ`WT>tlr74N2f)9l!OcgD&j}IMzfJc*PJ`_${h6u~A$?2(MhRD*glhlk3^AAgo
z8HKv`Sv;xi%Iu%eWb0_%rxd6YOdZuDP06`+1S#jHb?-=B<T;#<B`K*_!qO6c!e?0h
zisyuK^H@i>s%EfDlxnLetcT8Tz)GeFlb>$HFZ1fEw>@&UpA|jK3B~Fz3X4U^ppq#)
z&n0>#urm&d&4aD6pZ_C3i@Fg&43%=Oz5qDkO}K85dKUHkLtOi9{M)b=*P^Iag09*)
z&YDrFjavDx;7;-nfx$>$l7IMT+f>nbFSe<!X87xFEYsPlGb5G)MZ+rz>^}ueuf(!E
zAE0P3{Y#)pcS<SW6NQnCf)zM8Unb33GEB|LQD`msOK7qU6>aFkPG7^-2oE^Xc0zg@
zROQ(w5A~6Jh^*=TG*M8i$jeKT5{98YQbHZ&7An=~@@HpBq(-<U6q$~w;2R@^$Ov{G
zQm?mwd_ZzRL((M?lMNkyQG1$gu!kxT1Yc%U@l!#$R#q#wk<O5*kSOL3{@G3^Dv=jE
zodGw7zxZ?(x<1qYoKAf@C*v81vqCEp*%*SW7OsEB*$ABV=6~H;ztu@)v|0G1cG8J=
zQn`bFwv%d15asiF>l2||{hD!PJnigrMz~rpIo^HEQ)K(htpuQ5O<nLao5Ii<U5@G?
zSlG$ipwjP_j9T7Z>7W|5oi`Pro$6ltuW(*Gb9<CsiLI&iIr6<Mmy;KcNv0fH@n5JG
zMML4TQGa@|qJM=tRA&i*E#G^&e|G%z-}ZL*UbN4!LPfOEs(wLo3Pf9*+TMusck?=w
zoCqlC1llFf97h5=UZ@wp=n0x4GBeO+GbH^00ZDp~mU~xy(T6BKDN1p^#z{Kp7f$pH
zRR|${UeX)q1>50`j{(Z7Sx>4ME@M$JC$pjaO#a01+nH1+S$|w^+@n#>q>k3xAgJFt
z?ZnB*ZHS3C7imn1D2AvU<y7W;U5K+EFOuw~J$>gYa6G*c8z*8Td2mFRK)DLh9%<(U
z)SZqq3Rq8!A0c(k2a2@A6&RsS;~eidxKZ)V?3Qv#RbSUsKd0I>Y}?F17#>c>32WBR
zrxRoo5FhYWnl0PYsKkKk35yBvKv<U|#XJmsDU>wrp$+aTE2f2Avc_>YA&8dCP|E7_
z;n{V<dgyJ3hSjQ|;K5Dif(CrA1Qce(z!FmZoSb8(Lkwh`OwZ3*JLYZGk2TB9g3bZD
zz#JZ)z1clEqN=*6FDlL2<x?FWpqVd=UcYJ6OM(>AY=u@QqJr0ONA0Z&gmrVO;_>&&
zxRmDOg2$^579NAsniw~Xnsc+mbnO()vL=g4VZ99BodQd{>1FE!gf(&8IN#_aY->LD
zmMQe&2~j*JKP%IjKj5mO+CKO_mRdkaO_m$W)a0?#LQx;8muk<+caWY{P__I1tgw)W
zNf18O@ecasK6)c=ZNBsBs5<Ng`t{FI&#<n#M`fCjUa@vY#f&s0DFJ2QSlv;jMvR@%
z<vo_gJq{1VlwyXJtDh=~IA#meAje-vfYw<Nk~#)DmJ0`0TvJ{OS#TN&obdJ;igFKu
zq_z(KZot`FYkq%Gi|ecjYe1JC%R`$GZ4-bkrYGb#u3mLaICi`Z%rd?w^9pc!(q5I|
zW9CTQ%E=-y_JtES3%L~j!hK8Rrjk;TP9q!&F)z$u+`H#pa&O<igNM#!1GgZ&w6m>X
zZj4A}tu6wnG(ez`q7)Ghz5RH`WVlJWCZ%}u7BK-imWh@EU0{YRI>DP!d8fkF9L-G2
zg(Z2oP*)zI+EaERtL%UwSyI7KyxtCV?i_WMQUXkaBxFJwDhE?016iR@vCvbJ!{J2g
zPQ)J-jX&s*)o`xc_mmXhBaTiceNhg)M@%Ty{c=)33&=d+yR{7#y>2w04hvK18Vukl
z<7rpBd2yXPUglqQ<#3h3d^(QKkxvpn7%8Wkp79+N_)3jizArvLwx0EzI|QClK~I;X
zMz^{#|6;EASL3{g$(^q9{uFkFxked|pY1_AVSb)v11tur#VnbOOiMrO>1RDN5O6b+
z8$(iM1YM19=_pLun6CQhjjU}zwI{UAJNCZ$w`o;{a)ZP`UYo(9boOw@9>h=M8fB-i
zf7hoP%#B*O+^;HW9<KZqlEbUQkG#nsLDDm+1*LqiMS-R*ZsApAuMD!WP8_>wbNhym
z-%8ZuV$B+bull-xvtp@f*mY-E@{PfF|NJwm;|Mr8OaUSVkE|z}+yv@3!-sj(C(){D
z(vX^r2A)*P>Z<R0HOwX`_^G`aqX&RV<wsSwRq<puHOw>R%gPkl#?F%eLTTjM>mgNE
z^ZH~@S>q;K?mAQrlD1)Whj#-0z|3~?<*IKE?5TE?)Xu!bg(-hb%BW%zBJ$X-r$2%G
ze2@T8?nTH$936M|P7Yq3&J+`{95yV{%dAs4gVK^^$c0PN>d3m?y+b#DUD6vM^#(cl
zvGWYb`^RJekbxG|e0MN-m5#6Kz4)GKW8tjT=v!)acKnl9#Q`3|scB;}ODqSW8^oqV
zi3Kubj+}+;-W@3b#V8zVzkPJj-bZHb(QI_$g5z{W$Q`4?M%go+8T;{6^72$yYnEf6
zHVJ*-r(OBx2l#n(&7bv8?O(sjtdkzyXLIN5$eY4Qap83gqs@oL&3NJEYj)z6OUJy~
zNA1I}viuRqCs}bhf6^*P=4CP*ri1dT7u&^>I`&Re$5c{D?}K_eckU)%dO=tF;`9By
z5T$qnw}eIZkmA8G-K^gSL6O|QDL;PFU!}<MVvu~qO5n&eo}-5;ewH=qx=JV`Xi`uZ
ziWl&ZnA({_&HWr=+!<jgMl=w_W>eWWCkLmFnGwkuO#S8z6V9h+92-s9=To_Zi~V$%
zrTwQj`&scpqG?<!ro~Be!r?Qj$Ag#gxAt!ml98S%@C7mn%)eG0_}hd(ImeQNm{83H
zq=_`!;}B!i8I>mk%)f*Pu*D{)D(_>Bh*n&p5MBI>J>2wstgsUbhg<WJu8doRU!_zA
zSCoY8G6!q|Fv>&h{ftoRY@GWdwR|+h^Mr~XRlHRXu>TrS4iDN#r)MvBJE!fFMwKXD
zKFZ>YInHT{a9@SE#km0Ru@NrI{e#X=XYG@d<CC+~UthI>S2!x$$^%We%S})ApH^7F
z!i(u%6xC~~WWG`ONb+-;3$)f;_4(Dr_7Dq_v)by*gU;UZ(KD5N4!a==$b@<K_*rxg
zf-(m6v3pst8xUAIkW022Cxi^0nbk1&9i_ssaF!Bip?uk9z4v($Ebxf!0o7bo9@><#
zf{L0;DgmH_9EsVFK4$1D{)vB%UAEK^T{IM=L#kM4_cp~;&pz|YrHqM)XF_1@^4iN%
z`H`0E5oV7f$5sgMwNi~@x@e;{;n~0?GH}IQO$=mZNDJ%_CkvL}SW=#n`6Z<+?QYe;
zGG&PT&h~Sh8yU4ZXYdt9N}Wg2B-ouxshsXQNC#MfVkgG*E-JzxLyZ`L_y(c!gV-x}
z#&q~H>BBbJQ5hJ^7oB_M$gK`@kO%y=a)M^I&P2z@FFCwWWs^qw@AOu_NP$25721`=
z#Y#c~vj|X;N>(Fyd!Otc?ZcQ+)rG6;OU}Cct3Zuyt%Ij9UZru}<MJ2)dkpfnvXYqS
z5|lGD$s@{`4T6l&E#bY9&B0V617fISlfEYX)JsPy7*-u$)y+8VrKXGyUdoJgRGSGm
zPNB4-j$KI)z$YVgq@>!%nH&^{S1I3|x4tf228+n>8Ri5sJI~%j%!9xJ2kA#NeR7{d
z5MVGrQ9XWodg$%wKkG93Nqcwy_~`K0Kjr&w=O=WEeq3(#XHfO07PD}FQi|{h7WMSz
ze@{~qSy^|W^hNUD9?7inJp+XXT<WtJd3TRicdl+QCbx<ap^B!uZ=@M}hp%xjU=jNV
zCujS|Z;sARj?X%$yQd|#A$VrPx3W>A0Ha8`0QdkX(w4|&pqP7BW>-rss^ScunLcW8
zxLS77$4kfO8!ZND?ppu)h2C|E6|4H{GZkvX>6JCT!E=?&n<>(_(llMW;BA-}yh_>s
zVuq;T(9`R2GNKyEiuzqs(DEp`plTzW>G|dB!_$NN?O)n^Q5V+tA=a4%GLt<ZndDa>
z|6rWG>MOCUCX~4rq@B30EVhQ|W>}DOXr=Y$6{i0<OQk;EZ3!x_v0=BWxVpk`;4D#i
zcy)68YWF#u2o@VW@{Bkwg6=B?<d-<>&;<M4)t$_)wp+PWr_wXoU#}H52-InH3ih$0
z_u|~7yjr@J@^_go2h<hV@Cn}xe{MT3`AUqFsiVkoYF@xn&$yFq;u`jL4-d~ehsSRY
zkDo_>T91IpbRI8;9)65}sxCS>ryx`diy-w9(h2oYM^0rj(U}!g`@mp;GG>zjg<V~}
zwW2?*B{?ms^%;KmC+$~<x9lIAI0|-jSAn}yw^Pn=H0*8x|DDw9z0!GjdU(9|Q+vO`
z-ZYlOo1}v0970sCSCp212KtI5@rpQ{>U#E^fI|@_&gQ|UX%i+Wc48g*%9yK_Qk3#T
zYFT(mezF3cjV~sbb&A-eoL-94hbPcxlo!zxg!<_*f$!I|y%(>KemZ;l>uI~=VbiH*
zR55WoC0%qhf4St0p$zt_7=g;>U>`4a^w{H0m1z-?NESbgI{O{9bQBQZqi{1VoQ@1M
zq!%mWyn9;F<wmc#oCb_%yDe`%_F5v4OinNVCRJ_O^hxGFY8C6ojhP+dhy9;J`{i>N
zyj+f~#rr5)&e4_!Es;Uw8e9178KRffjpuP=O<HW0oR}`>spn*(_RF1Pzx(L`2hu&q
z;lWgs&(?87l(dcXfQ0n^+x2&NeJrgmH5?<phR}>8k*e01BTuOcSj-Nw^_tUVnVJQ3
zn&{XrV(vClr(g2SpMcKaBj-}m;FzTUI@OH?6_cb!#bfAVqny)59HS}}g`}dh)C@S+
zvf$Y{J~=&mc6@TCEPU35J%_Jg$3gpjy*Hdf*KAi)Z&yIA?BwHdJi%%EX+htrgVwML
znKKyWjL_FJuF}I9f}MKi_oX6wgeB3HjhhSj0<bBoCfZakQnCkqyiew5&Lbn)HZ_~3
ze-=tE<OHn?ARwrx%-McS#u=rH)7!A9PXoI$=f+QiT%#P~$_`=VA;tJZPDz?|bUddR
ztDFGwQ`1EI(V&BHjC6E09U^r4?4C=ifN^?GwaSozviqrDr@8~02I}QNpup5OxLPjW
z!PCrc=d9+SN{*YXrT}yBf3L#}G;8t--j1NNv-Z*6F_uF;JK23x@-&$Be*5Lq&gn_R
z9|MpNDPPXIBFr>d<)=T-OD+$1#gS^rcX(^K&Q;~#=R3^hvtCgSeni>X3D&-Tf?}XE
zqrA%Rjg}+6PwejT(Z=vU=orfjo`Y@4%P-*buS#`juPJU3x;XsAEL!|iX?%sJCpw^$
zTH5*3RDKkP=g0bH#Jbq^W`=fp%C)Hd2}>6$<JFk?X}cHYu7~-r2AHCXleRd=q{4r#
z?6KxhPrH?I9OrNv+dJD%VMoy(#&xVBMVd8!I0nTE+;P(M`9r<>8e^?DoV2A$zps)2
zs&Z-!_=YOEB_1d$!5r=kM!8AdIZ9!tA|EJiDN-@)3f~@>_G|uXIy~I$^+*IuW!w!r
zd`msDau!_crRBoHcIpyNS+H(|oz<~+UG{z|`#)4<9JJ2eOke0`e9t(<s$GzBc7>H`
zH!wkds}V+94#TV}@x&2}OZ1;5J2R{tJc<>??G=YxwBpO+rQVbz1hX^WVmi1RR%Pqt
zN8gaThDA8VWvWcLV<+>5_VRipi4K+PDd8up3+csrt$lI=yddBq9p_r3^fvc9<8>Ds
z8CD$v%`*hasR~vMq?sj{X%v;%0t+_@wa~54i8;U|LEl!U`Up6bxVSgw;&*d!&~?Eb
zESw~k(ZT!OgbPPH{qexhY8v^Okv+0$Z(E6^(Q=8?zZG4p-YuQ^#-4(M3#B=5?w_wa
z2~H7X&mrWeq0)I`uNYuE!v`Zfx1EVN8qFjT^)>cvM~p=g&r|?i+}EOGZNYVVq)x;~
zhpdK5g$upLx(iAs$$HgE#<}LMFY|$RjQmDqDx(cnX=c&XC4N+;i{L~-M)~Q?xe{E(
zmZd*kv<Og%OPeFQc`DF1NZpVPTEuxK7E3v5zCUJthb8J~s8dNPbIIg#jV++0F8qB8
zyf#J&VSVv*%zjfAIIq1Nn-k@Fro$FlqIETngoqs+X7gcvOo4uWa=3~z1fOS|Z@bvB
zAoMO5BBUe=n5$6x`1hw{&W2Yi9nGX4Z>VhejjRZ{50X0FNaL6j?xGu-RjirZ%s7d%
zXw3R_du3NwFiqG{l=R853V+r0Fnwfvsym#Ig+`g-CH6*4>W*B*nF-#i1k*w6ov{}L
zR=o`vj-bO}q=2}|F)a!dO!WYRQ1td*BE>pMRWcgbVK<!rPz*9fI!bgcN<w=M|31oD
z;Yyh&C4HK5!X(o}3Eq^TeLkqawP7u5U$^|2XN6{ChURiKgOh8W;I_lXurbGYEv9X>
zGKouPtVpEDhE-?NX#i-mmrN+Pg=h-%i<qzeXf^UeBW*r(y%G5_4iw-JTN%3~-k;+U
zOfZ50hI8X-<AdM=nkpn~FxiI0LE+l<Le%x(Lw-PZUT>@^J-nZvpA)+uu(mlDY)T5%
zFXQwx<y2s?@r$V3=J5Bw=2IfiMLN;iOLgaVQxI`8D%fC%ha~izb6txLsOsWhTU2^5
z#`48QmXi5NvW&tRzRt~wUU&`?tShFpK_E$)v7XhHy7WKmj$P_c&+ya`te>-#gQ2N9
zp+HL`tWl;O><W92`7iwEU~gBx?H(Q?(@cM(!F2KU64mfbXWI(-s?QvpNr$<Fb2=a8
z=j4^3u7Cv?IJC@{WS>N>1+jwX7)A($7KU`)0XZqfZ&uh?LDX*UtjMxqLgAHWG*MCy
z5;_LJ;%A2GB(@2nt3`&n1`fXXBs#=Ug{QBdlh{Vjb|RCRU|~$<YzNfA?Ivu`MUW5v
z-^~jQ=CUwODd?YLTDM6K7;}l4E~Est*-VvQTU{%1**$jk>dhIE_r4khKdvf;-kPP^
zs57)z-rE`uwc3)`ybi5xR$PaHc)!qlMI4SVHs=~`OvyFFJ2rQzvX(4xyJCJ`=d{x$
zSB&m(yWK%6<xfK&XgjgQEeSj&zoFd6^A8QZ_bnEJB&!vF*_b<REGejqlBl!ZLb|hY
z%gI*eZKm0T_wK9ZCNfEp(%}WNj2TzJ$o}9PiluJYoxdO@l1j#Ym?!<itXo!4<rufa
z$8?Z&F(DZzXWx6K)O7F-#UI`+wNE`I5%E^3cOHKe-b(3O|E{Y5U=A`-F(1C(Jv?}N
zw)^UUa0`FVN9pja_rA!7jmVxl1_D;S&Z(6af4_HCT#SGNU%W*(3v};8dYp{2)Gya-
z)vB>J1TeiuAmrYY!Ya<}yhf_P-KQ|AqurNn(}a|3Gum`cPfBe>YhT^y<?iW=QY%zE
z%xJS;o*P|o6-{ciwbt5st1DjSjjcILz@4t@TlUrNUTt+n6WCaLBQos!o4)}8Tjv~v
zn5RhP_3x8=47yC4qChblGvGXT^G}lArI(I}My(P8+Tro;ehF+iO%T6l!1}mTYDBIr
ze@ln`>|Cq#udp_2Vx?ho7jTWv*W}_l!Wyk2e6#YMWjE2tr^AogI3Hdqr)*Q@0Y`W}
zET*FoRohT>V+QUA$~g{LO>CDZLD*unPpSIeyoUW;H4E0;1A<3s!>-avf+d&ozIHt4
zUc~%y_MBlg8pE|eoG2|5c|?gg%<q#sU)D!`(||J0lLUQWIWw};0(xlyfV-&|)~Mke
zz8^@878PHtYei%ea;~5XKxhIb2{JG@vsrqWHo5*k=ikx7l4?pG*e_w>-fpzsX|9LW
zY-K*tuOSV<M>^A+;LS@ayGPOGWHNem|2{$=9^wyhXfD#VVLG{AjC=Rts<>|&tzAy8
z2HH{YW!}f!M|}Zf(odA*v+FukyanF$-FA)rMEc!}Z6ZUz4JDzN`}-AoUHtuX=~qB2
zoF$ts&Ys8cVx#oZ)nx4qZ6;Kl5XC-)XZ1-O4dduzxe4(^Sb0v>x&vtp@L(8tF%nmo
zYf7VJwTPqNYMtL|jWty51{=Z{*U^7&!+TdrHvFx|z9#%+558887_qUf4g&-{%*7#4
zPKt8DiI#q=t*z-a^TWp4+HW;@7K5Z290Z6|;CcAzIJt(csD@{#6>Up+PZrw{gjO}g
z7XafdAex|{^ix($P?Y^LfK~ubW#YNM5cn+yJQhl~F|)D%o8<;#J6n-2%(vnt!h)e8
z5h@D{22kOPu@qt<2OH~#J41@kj-y1#xdA%`QS?k)`&SNII%5KH25&jHgJvt&sl=Kq
zrBN5AprVl2v_yi<J*Ug(dG%U_d{2zqaCSu*0a?soi`aBTG+A96O9kdOS~9u|v7k4t
z`vMh<=62wkYFf39V-(6FLib5_p3=a!(=!?1Ie(D^nW=$gymhwnart&OuIR;|q?CUU
zvq7Q#=o=2v)Y0E0qj*`gDnRxkzb2C-J5?5BkfA=vZJ2UITBG9WZt!K>&tZ}D5`GO_
zUbt~}$qzmq*-VAGx<n*Jo~Yh%^uJb<pjcRPjVc90%zR@yJ`;uajJI&l`WR#CxEv4q
zU0Rwew}#{igYdI?FWU{*V0#kvGkPZ(-)INSoa!`mUhJ|FPCRhbt*ac(;nnl$K=Myo
z7E8)`ro(u&{yJ*^yn6_Js&3#le4;7{n)k0#(%q3hswnbaMwTKkSk?ld@-W(_rR>p#
zRKHhTCQNEMecV3$gl@@p-k5S9XBg+}@GB?jMOG-Y-`J_xD|{gxAGF^W7FX}PO{ngy
z67ODdNjtkf{_eB6u7o`(yN^{lSdf2(JN{_i1V)R`;MLuxfQmOxeI@EnM<^;y2ws~z
z9iuS6#XLj_HfwBoW$yT*!ka&MXpqC>=d3`UQCwW<nD0Kq&+U_^$DQ`<G32GYk8*T;
zdayTV5Ps+GV~ApX_8?08ehYM9_qiG95Y^<J+4xZ5r#RaS%AJel`6N0)-x+D<G_B?f
zPPODsHQ#3|3?OTYi$ba7M0FcT1+2HTAX9#Q!C6+h8r^2D%CM>mE35lW?2@zT5Vc&4
zF1uFqyB#!b{G4&jys*-{kF$IHY@uN=u<`DrbPjiaUTisJXukVEVom->47GcBxG3a&
zL;B*B(Q=iVfurWF#jv#GFLjF<u~<4|GW5b?^RWGh7MjAdY{>cjMFbLFu!xpua!Zx~
z?;L7RH%Two8aBT<8YI2ccIlJs|N47@oHEIB=oaah(U?&>9s8)w!Y1y2HpIB9Gj=68
zSMG+mW+}HE4x21CWHDp)0O{R6(BG01x>ARW98{=yK@<I_Jl{af9;!U;%N42CV)kW6
zKPV91Q8@N1s_XqSQYdR!RoQHu8HgnCsp&~p)Yh&iaThf@x~HlSYq%10abllb)LP;9
zXlY4wM+^4R_4?@Ewhz%sB~Q8wHL%rF_!$KCL<Vw7w`4y<y;1LKM1P<4)ALe^<DlB;
z^BlwxoIz=r#VcK{HK)?sT6{jrC#oDYLX49Ba0ryPJM1~#Dw_;<Wrs(iCK9Uvkky#-
zR2f&vn8sLQXJ08EQlvwiqKZ@}x~uvEbpDv7*GhXt?!d;)Hu2?eA6;Pymlm$#UTJMR
zO6H<(pTEOpB!{lg&Mv9$)fkh$EQ;bhepXVIFAY0`rCXenj0kYXie8Mi-CI&>-bH$d
zN>kXl-4t$hAhX*|O^#o-R=`~X*Us8nwDf2R|C8D7tNc8oA7BR-oj8z%+s@<`y)Ous
zMM#FmUPUkT15z>r0t)`!g<h~micVD>^YFlJFr;wth6-o)E*+I$$VppKm_x6UHgKXb
zwD^t2c>Ope=24`J+z)e8Gn?m<O+=k6Bq*rRR=ss^O3K-)j5tbbstRw+R;}`6_ULQf
z&*xnB(D75c9KPOlgS6kE6`OJwDw0V#3^_9p+uubx6c{4>!nyLQ#>8}YoPgxu=()eq
z*j+aTdO5_>5Bd27V9RE8+*qcEwOD7A!!U#ag_Xk|j`RMsrwMy8?M{H51e&StgltR}
zlr=0GB^GE@>;va>RY+zes`tdEq*P-I^zNCGEVJkW7GT9N8Q8Ek-2@48jiPbN6a@X4
z2Z`9V4sE-@TF`bvF`r?pLfE2EHUTIz1v$wTH^ZLo`OgpZ7Ng|{X2qJ}Vi$j`m({?6
zhfdOY)Ge!#DqGCbC@XT&!x}wS7i@#_mxRZxw4l<G`Pawpk7PG6ak}WbpA03_1>EjT
zRk*ZDbgVKK6p|8)U#qhV5ysz)Q<X6X_s_#6$MpjSVieK|CIYdKA2F^>>ds-ZKdzbw
zfAt)<W{Zsv1R(l(9k6-H|5V8njzcMXn&QB!h=Z~y+RyyBCbl?dEMv5!L=vBU^@=NO
zz$zPmk>4P1pM--sa^cta7G#<_E{mk~MwI|6$=4(!HRUDc7(={8xK<TrV(a!I-IFK5
zN)im<pheKqG2_bX1-q-O)JF0P-liDOPvLIKxOcgxRzTUDw0YB;EvK?2zt`e28;z7?
zO*iWVvn^6~BW1ZAtMYaP5ei=-CiPIF;u<=5r6jj{9)g6Z_t_TwAKxuS37#UJOnnTJ
zN<$}W8gFkm*+`2}r8G5guNAp={ZT?_fdR_JO)<eMq28Gek2~KsqW|DIFOhqYlD4F*
zH)Q~(%3;F@bE;xK4Za+3u2LrqO`LV}y-{~p{2eA-?3^89`^|^gLnA7e;q^auhouhi
zY^iz<1LN+DVIO}dp!KLsMIfqPmrz02tv{02hk5yplB(<w$P(5x#w2yzaW|b@r*MU@
z6Y!g+rIj%Mvl*_bhNEzw=?JAm&d;nHB4SMW{yaRRMPS$?jBMP}=_hoT#$V~DC)-nU
zi>(o-hh;MW56I1`X1DUzaz4oOaecfzZLBn9Sva~{Q<K*8AJe6It7@rLQPD|iWi736
z*EX2Fw#wzVs+T{Y<+tv-{Q7it003yL3<5y-kHOLcU{LiNEVuGQ@hd-^pWy-faDpv^
z#DP?L0RrKK+y)>^L;S^#>S&}VFmcu@i-~qf>0fgD>~noyW=)JvL?ugB#SeiH=lvUD
zFimtW*V9%(rx%#aB(b6s&82`^6qPdqxQnwVXaYntA28xqJKF6hwY^4r<5Weq;uT4e
z*gXvA!<0#)L|MXVEvdv$$YYW7rb*e&8EuLwG41F~fs&VUnmHb-U*H|m)i8(bCf|d*
z2wCQ#E*PTc*m<$rv_db*izeyg^<gvMI?%SR?_B^EM<c;fG7b#F67^C8ciH%aSl&9S
z%Z8oh9c4OujI|IbS+Zt0o+k{GZc5@BJ3gtrBN94F1(rD1068L~$6O&7<WSYSMcNgk
zm`g#JX(2J+;$SOK#h0|Z)p@kkTT+Y*C2GbXP1elWna2vzy6K6*bvnYZ*fHAiXhzhg
zpW=kOYFCEIWNJ#Ji{wU=4hZsAS|SSBn<lJ7Q2so1T@gBtd^VeTYeYQ9V;8}V$Kmbf
zhWPEGKtm;#qGim-&5X5rYn_rXo=Xl!{kTbw&*ZVnHKTrBX~j6M!&d7DI>#X;<+@Cq
zl#Esnn@WK~@u1{0h%<eb0T)viuVUzlqd`jw2XXVm7YsKqv=V!Ko=$#BZ|eQjRoLM4
za5_NtLy>RxFTG?^mj|)YTh=OGRqMpJ)q3O2)&g(W;C$8MjRoGE4gR^~{5DL7{aU<f
zJIRIAWvYP;B41HehHB$8Rb$PmuY>u?Li>atRiK_65T21ryWR^Fy`kUn0vcshK2AtN
z9k9p{AgTruss%Ejurx~=Ty2(fVQO}Q<LjJ&!7xgxrwR%sWHX+BpT7w=uz_7tCw?Im
z1!&{xaQIIHvH)O|4h`f@5^f604##)c>P~b#&Mwg6s^*XWiIm0McrR+*S+4b|=s;`y
z5AVB0N+|09$Gxhi;-P4jwPGJdD|uP&PQ)pZr%U1Cq;~sN^omZYqcGxJ$8X>|IY9eB
zFZwa+MUTq*NG>3thQXpfd#6}EZ>I8Tg^v2aUs1ZjPWA_HMzjJ9(ZnvW+vyjti?sie
zN=4MIIU=v46A)U@Wf!40C$dIFYNPwZ>Tl4rMwL^2UAHPzFFu^;3=3kvqgQ&F6d!2t
z7tp?>R>JT5><N(Q+=Bz;$?2bTkc<jSL@s~5Eb5-~?HT!J%c5Q%z3#O4>&e*tK5)D^
zRW=NnEo$`pnaZ=owR0pF66xNgWKZ%byP94pTr*j1$Y~qX&q#qEN4c)%zq9T844<)Z
zX{utWAK01L%a5P~m+QtaE>QlrKz+GvTVLwJJi>HMa8OXaq9@JiEWR5I`q35q2;3e5
zp;+_E3g`qG$Y*@Wxay~siOL)-kuH8Z0G3hCU#T;Rogku+6-c!_nkCSR!(P~7^Md7n
zZROihHiP343JtL04kAfmmwdaAEPBrl7*GgNaJi;*s2qn`Uk@_r2yvcj^G%pfF3kLw
zIdv;Q+J*(t?#_$Xr&!P;Iy&y`{@ga{ir1oN#GMk0ofLM}_+_^=P4U5IVuKY1wOQCq
z)=6Q@i9Fe!(H9zP^@-{w5LU&w6>-X640jvmbP`FSV)w`CK$Quc$gD1>kx_j*Bri?|
zDlu}1#i-<q?<i$G%aq#Xh6;yh<0^|cn2?7ub*KHh#dumR5o_n3B)b9!HelT#8PQ2f
zuy%A!JE1TV*)UOrg()Q(hCb#WQk|ZGC`FNL1N}Gu_y0uJ|CSkWNPsXJ4jqyRqbSXo
zb~B*)u!{oAOgKcTCwW1PgqSys`c|eVA8#nSql-!vUcI#_vwfl`zZ5bamx#NHH17O#
zcyQE?O?H3P+V>*rEC%tlHQ#1i&I_PyFt9@O6oLH|G{dKA|B3bwQb{ojtia_Y+J72O
zcf|R}L{L*f3)ptQTQ-@-^QvrAXDnzv<|1CCrNY}6(<HQFeWfDx<#gLBBeYtINzDrj
z@ak|-jSXuBRpmB(1MtieCNs>zb1HVI-688><=*V-1a0aH%ZHSIkfNSVwGnhsPD7z2
z?p(00lsg$UjT9I#FFCFyl9NRX-XK2f@7hG<1SFY3AI}of4I?w0USX*)|FOgdpK*V>
zhM9CvUlkXJH~N4m%Ql96!4WVVjY>*rxMe3ZV{H78l*#4Q$<cFdk%>%|9+PlTbK+<v
zqSrmM5FS`SwscJVw6iCU;?pkj@g^0QOSB^+jsk`IBOT{n=nw|qQ4&kMe#8JHw~Lx6
za$Kxol6<t+$&C^k*l$4lL8*IL%LR5Rp$-}@UbbI8ZJ$uWD5_2OQ~OuH<~T_cI3ucZ
z>!waqeVJgwy3wNfdBu=wqwsPqbsR+zRq2eV^FcP0gNS<X6v)Ddf}{KuJg?IwynHd$
zwaL!So62F0^JdPRVd6oZz>UWK(6RH1_pO&mo?D=={ChC%ruBO=fXyueua$c8%NK>m
zingO!Zq-(rCArW;wklmJo@#1a^b`cMLpa;`|7U<hES?>6WCj<PqZ$RRckw-;3LMpj
zih(_p2R%XCur=~}w4;*6_oCHk!%;CfS_IS|9O<c3Q!d+y`gBrBiuKT0Um&rt&~cOU
zOU>koE2b<w`Y^>Tgdfw&p=^qgchUXUz8Fx1h}mV8jftwZsjV8<T4r^s&=}D-DKP15
zGf}^P2lXjsKJ)Ggne&UJxYTJ#?YgS~YUY%!06xOcvMN@gNz?Un@E$95PAP||(#5bK
zOUe34Onb3QZiW+UHu%iRpid4Q>Z>G-AdRm#xa+>9>o?_WY$WwOJ9Q}^s!7gfNRS#u
z@KXC_bJ1|JlM9Kgr-P4~H?E`UNHJ<40$@szv7N+}s=nC0aM3(qHb27s8YNfSume=k
zkxG1Tl+AVaMR6okjRWsjT8IUxgux(rkn5Lrsd|e%cmfapeW?-sSW?FE3oG@dWN8)J
zG*ClCj|{901JQD;D4FAcS;83zmY1@4HyZ5Et#S-ALJFc<&`Z~LvzN*#AWnXO4N%8M
z4^-W?T8kx>;agcD313JT>HGT_6(q-rXvPm383~t`Wp5z{bZDbtK2b*<1czvlq7yYg
zAhai@S)B(PVNf-ucz=^1_@H!nNyCV+7iI$ub9O(<Nh4UD0#!m~k}-e%-ab2!a7Mt7
zLxuVJ0a~mo_zrU>qUGAwHUVa=v*#T!V^MZnLlhbz&(W{EHt`73F84(`)TIklv9g<h
z$;~~^$nmgy5NR;7iB58k(=QEL4H&73=-Q)US{Ks<xT1*;iYJsnf`o|d$<(tC4t|`H
zdf%3hQHe<8qv=37EmMscWZ~!rmOv*}u#g>C-Q1COv2nVsRNZ2ml9as#;~H?yotnaj
zm5o@K1QYHPYP5Uu{Aa7tieia`!CBo{HQm?>+=R6(w(qH>HKEMo7Q<jPpLF|KY_GDc
zkV9IYM^|Wprb|M-q-7RS?3iNeqS9eaF8Z}d73QQcZ=>Et^+YwMJ?*-gSwWYh&*U2^
zUx#y$ILFD(xsFy6)zHmfRP=?>?it?4RBS`qwMvzxb$)q@5zyJ6;rtlL`TTx1JWJV1
z(kyE>R7#Cr`6oM<hQjb@C2E!4G%9^~6OP8q94LA|%zCf2_O|r)Fc|@hfDNt+d=hvO
zbxcMc2xu2YAHT!(8?8!pp+wTQ8my!RQ%bPC<JU*0adRC%)?qeMe6z$>SLBqpMl`dg
zoC*EzA?%$qEb89=y!9OTY?ZWUcEFv8?UHZ*l2gypBiUJ$5xF)+fvUuA3TFyUZo+ZG
z&k7$EUn&>1E|Wm_Dyq5O$Q@0(0YjRQjB#xP-IGehEi{%qBQ?^(H6ht!Y_n`LUTvv`
zc^WBey|2<SRjnewOev73&0k72-v_FbqbIErwJ8xgJE%BHHi3Afgg#^wq_`8(17-!0
zFxs84j?SpUgZj8|KAMs}q)nN~9c#!*O8(;ZRm#gv3Z=S7uNkHCcWov%2ZRlj^~t$Q
zr$g5S;3veFWn3kgvgI-_Z1WgDbg%K>r|DDzP@Ylh1GWvIe%Wp1*zbKpR@M;&as$oI
z3#4#nPpSHmz+WWeF4kP=0b>Ab&J}NiR|a0X@?UZtM%OY1-Z>Vl?A-vup`l4!m4GB4
zB5%N|e5%@ocNO08!`@9<FO<qjDy%-3)FWYdzIV3w>)v7e>{a{Z;CSCqem_>J&bg(=
z!B(;?y16FlsAy=9W*nPqaOy>AC6v-9!Fz?dZ}(ok)`;>qVb()qK3Jz$EX3z3x1>wG
z=$)yei|dwXsvfVbxX5N+-wurx;$bg(oSKB*?wqz?#i52SQ|-=5JuMagLvFlEkuuL2
zg!URR>ANEA3ZmVW<~fAee0qxs(jLjyhHJ6&nGgr>aPN8(L;48IA+l%HdgfjY@n!{$
zj+3B*VdNiZlb8barWtYmcA?@mkGCcmp5|6XS&~`w(r6NF>om)xCHg)2^2<qu{9+&w
zu+y-)d}h5MR9!~xU)p=ZVU9Hqhg3DegzT7jRMfbOm$tW&ORRuiy?B!7!UVabS@jP`
zsQi2zo}s#`RBisV2OlL=oBXP(ObOqyodK7cWVJbJen=IMbdocWO@{+ODh(%wbuk^M
z#>#DRD2n$eTm3wDqGU25hYl%h5-r0N1lc&W*31WBCA@!$788$Ps^cb7-4%vIB__rh
z8t)llF4PPS81$5!bxVY}mA~-BvNMQrbq|O0XZ6fa`bNZA3<T&~Rxr#N0)>(h`8JI$
z21pb50qUjDQlyvXtV(hrYP{?#-z)$^%yo6_yMpW^4wnTGw5%9p>S9BN@&&_va9wX$
z&w?z(w+kN)QtDceVIUF=+vKTSR=|2kLHSV$#)-`g#Z&-}JR}&!mbDH8dJCr;k-bI9
z4c7rFuaxTA?FX>}Ig4R_9oec>A(f21>im4bw>aB?S78`G?0&4d8*<%EC%sE9XcTaW
z^T83QgkA<EI@gsO+U>%Qb<8Zw?35d&H{yL=rd%13vp#LXh+}jC5I15_*9jZ?$s|E}
zTCAi#1UZ3a?(diKQNWDfw%a@+XI6Yr*R<bTLdhP+CMhCS6XH#(PdMAd4R5=eG6*R^
zeG9%1N}4P<FEm5N79_|{0bMI50}L5U`m3a|FoO|rOtB`rH;d?txo$gXqxP|$_nJ;5
z^W$<G{7j55?A%7#JC*jCb&@={nXjM^bHxk3cNl(xwV11Bxhn!D%yT`K@sNCYeJ;?v
z8HZ=%@?-h9mxgX%FQ?R>p{!Y^yU&h4L&=fBa;#{7Ld4AwAI_1aUgfZ*$g`jimr@rE
zsNSCPoE?o)v~??wjBKpPvm!mp$4^`Q^+A6IL%ie>fLtoq7#Wi&2D1c;b|_V!WhwX;
z$%E&FLKO)pf1)`7Ax93K!oi9EF29LnWnZb(q?rxS&SmodDwtLn5Rr~<t~W}iL%Ju}
z#*LxFTzQh{Xbuu~cc4p%>R4v7EjkX7_`315g3&J~mupcc=lk0+lSI3n-B*%a;X1jo
zdkJiELopOOh)v>o@LH3|Djv=e8WI54jaZB=!gm*YiEFI>DtOzp@OG9>{S~KdKyH%M
z^GXX0JeOjn&vPsLPqmHRO<Yik?WQ<=5ATB(vs4qZ@b<1oK1#(kOs?d{kJyE2@YlC!
z-~9VGH7>eU|Fzxuv-9iG-k(Ru4G>-_ql|K<<UDa#Xi2Af9Mdj)#2Bx0rN3CirtM!2
zI;WlJ37XV*qPOzjwY9Z(s^b$$niI^vBpKX$I@U`K;yNG@=SAZ^JAB=F5xw1|>El0o
zoM!`NtF^s|xMlP+^0Iy8LdN+ND>tdrUaYD1<kV#a(WxosBMO-qFiezklsH9Gv@k2Q
z8<AG&tBwcBA2%4*v5J4JqKnij^Y5@r=h?-SHH5%8jZ@M^!)z&@5XZwZ;OQgP({e=X
zeiTtEj>~aAgvB65)Ju1lZQ60O&cdzG5mdGQDHAQ5F4bbWL>pLBJ7mrP8R)@|>Hw2)
zn~+40tCmqU$W7N7b%{);xrrZ_&glz4ZzLax=B{^!eU5e(IY$H#FAz&56>;@R-VxoX
z>bj-6#x80l;U&;>VD1YIkjx&TId6nkRZAs=2oj&+A7>P}#`yDN)QlblRxl&l3aP3v
z^L(6{VdgySgsOiMp3BjzdE8yKdDx4ywe!8$lfWCDFPr>>L##u>6Ok2Lb#L?QD=Va(
z(p)9Q2$(EX<i-$P<T?D+PZM8VcWVUY=-o1gzPE%jwMer09wG-4N6NU{vX-I!a9Zq#
zBkz<F!zgs06;`SysuRML`1msDf%v7~#yTA2jFxDnDzoReJ2)DqDCoElH6gbl9}LSP
zXbz#T$Gc37Z-$_&>q^1(vn#zP)<XQ!)9K*D-cyb%C19B7U)j*Ri#ZiUVJ`I0&RY&$
z4cK-T2*O0NuzGZS`t)_@*XSs>Spj3UXWkZ=WhY3%n*IXr^}C(Z_R0LIygtHPaQEq9
zn>MaHEpBYZrrN$l^mJSs3t5@6s?&E!26kHFPB<82fyG!(y|<crCm)Y(4+E|4)MhBJ
zEHy>36cbxhvlgkqv@|0#^mURsieBb?q<Yqv7R5hvNf(Meg~Qt?uW>7i%?s615?KHm
z?uyHv2F=GokW`TRFC!U}DY+DCOpN@Cq<Doz<nR)LO;167EZ@o%w;{9Vs#d4)q8K5E
zIWUrFl#NnyJh_!4*-W-!n3s8mLBA_@amPTh2w1Hm#j{4eNsHjHoLTR$8a2!z-FaC2
z^n!U7S^hjj7Us5W5f<8ZkO4%s``FR_qvOT4y)=#*qciQw`2sOul6;ae?U1g&pl<8_
z(??=lL`lJ<$URSb*&v%_Y4Mk&!m(=hm~k;jFA%hdOJ7dMsa4-kRS>dcq|iMGBQzb)
z1lv_fCn|(zgPbe21BWI>b(A9>JOSbQ88FW;sbFGVy&ltOQGK~Ve=Ii|k^rD#y6s(N
zgFZ-I;jZC@V%#gu4~azKPOsOU`WZUhB9}t3M@+k-tF$N*OJ{GA2jMgvxDkhp5uW%<
zw2bwf6#(JE5lYR=gQ2jfWP7UD2Wml7lbmWmo4h0%b@7G$bbwt@t?9u~Pn*xIt*wA-
z))xHFRjjXNs#Y^r2j17b%sS2*lxDfIjrMLawm?7lm$gZgbYw0me9|3xZVJ@fH0h2k
z7a3I{TlTLpb34^fSIMUV;R~ES%nx^V*gk?KJllPJc<R4(b_wFcS&^!V2y8!P6YHq5
zE=c(azdHUIL9L)#N>Pe@O*+h{7nhR!2+gYL7zMn`DaIIHBQqeNH-i-DNQ9=*B29UV
z`W=3RzQk;%yvix~QtOeNJ=IrM<)&hQV%^`?KZ9gjquK5V4+KmYD=(##|3_&r^nn04
z<Im1)5I<0kpeFWl*zNZbolg_=CsuTT-_m31s@(u*>8l~WNa9OSh^>kguSj_8@FE14
z+2S?MA7v`-;pDXott3%E_AKLkO*-+HY#+nhita-lHM^xu#@W>sr=BA1aG$rJZ#cYf
zY-iXSPpIZ7-YtNkh2UlK31!w2=x}m0oE>JSTsQ^e(Rod>lXBA?3k;rsH%3(;zZb8^
z=CxHj9SiTbo%@Fy)KI_4iGS3qW^UTUQ%)N0p4wkEY4x^vzLw9T?*kh?uolm2P;QuB
z*Y)Gt6MTP%P$20do#&lH`9&tN79r2EBrsfGA_o9*i&Ps747tZ9bnsN@Yfp}ZIn5>v
zI^kLnt5geu21lGg{WOMK!mH@IKxPFoB*2|~C}$0r13~+2*c(jy=%H}UcbkeRp){^K
z!6-#`79;q(V6<1g5Wvt)g|g*{_mPW$xFQ(1a5w<OLvo4=&|2#`V8{8@q)t!b+VXeV
zZ<v-njxZ;215f=S8Ar^GAzkog7<|Fred`u=Z%y|CDo+YgRwlJl^D_-yB_lKt6mS=>
z?vN{3T;qAy0CD10Wv}qB^r~AfG6U}0?$){96)hYL8}<nz!3yruHz=gm)g2pipK{#k
zOM}8;;QYF#wO!iZ>tu|!dMiGTty1iNW;w$FHj+4O2e2$#0d$nv59Mdd>5HzTI$y-W
z{bS21*~B4m7nH}^J0)`GSw3v`t<S5{d8x@oKPk6Xe&5Oqlx<W_vPqrlagz2fhuQDb
zRJliG1xIU-CR5iFxxgGB6ZW>^+<c=+J}wnC6?a#$T@VQ93}%w(0>8lf$d{pub;10?
zH{@P-V-lqBX-1EaRn7v#5`#Sw`}^St!L*1fo~WtJq@s5cCpYp`mYn{Ha_IVoyhHlY
zIyuaXRj=HZyhp?mB;MTUIFca|LhhhY><O{Y33;lK!ULXtK(7<c*$@_G=tDLg=^!fM
z@8z~dol!P~qlju0^8LnMOxj6hzirr1aOX=4^f)LTM1zD5G0EYrbni`_klBB)#8u%*
zlm%`_v&^u}Ptld;-rC&Sag@yZXK*r+1Ew&^XYfXS@5RC4{@LlTui9t8XnBfOeAhqp
z_$kTN)KvqdPC)4XBMFQiPlw8+>#@6QVOhJ%P%|ps*g}2waChNCqo~O2Vn__^6`DCP
zJ469b;6f7I){#JrLnU7!mRhk<!Z;8A@w~XQ3%a4u_Hhq>T`Q6^OlIWkHTW0aFvs|0
z{i@;vx1-L%^Rt8JN2Q^77Ipafw0-h2j&Q^{@(NRw-aR-v^<MR1hPOYR3}k7A3)Uxv
zwWpev4#;{O@cI(^McJG_h<B=Tpx`6g8z%+&S|(CML4q6oj+|J>vIAE*y%CcyIUbI4
z0J$Q}Rd1q6iD&5z7m^?p1&Kw8P@fJFu~1UahZl|B$lDIQT-cwA3p(_~JzE1+<!&9?
z;6fE-MWAND(cWLw0{PS!W|m#s1Dd|?C|J!DLi=ooDFR(Zzt8F`7MTZ1V5M0J=?4Eq
z7VwngYYeCHz=U!+s-LD^-42B-U7K7SLsV)%W%i~3SmHp6(Ez0{F@^WDb4rJ-qc@nt
zRXm5u5qQmhibkMP)k}C7E=j~?PgD>gTC&DH@z5cjtUoO&v{m$8_D2fj7v5*}fiPFP
zy~DH0TOh!g7vA#2Rm|If(e%Tm=+8e(_B_Uisy5>#F&<jDqu*U!<+uG{eOW4;VrRlJ
zzg^Om;j6d<-pl@SF~KV^&G9|0QB#0YSvoz)IEl+iMb!^7Y}zBuN=`vslZEi?-ELpb
zo&u`?b3ly0UwJd*$X8;X8K+lLNsr_-Dxx}!o&cW9WOjf)j;)*pju=_9U(_O?Eh|~^
zdk5#t+A!Z!Z`hm<FnZ)Nn|`u<psV=+;=oUH6}1-IR?g~ta%DjCje&!DZdv#UbH&j0
zT-P<I{z|F^5DU?)W9`PwnG?nm6v(>@58OmgNRf{6TT(DPAykRVO9n!NmxU;RDaM|1
zw@OetiSA6HY{s0K7<T3w_SI!Qg94Xztb2#Yo%Y%8GvFi0Lj9{fUkU`ZDH@(VI==v`
zx}56RKcf{|a9eTDhg3PQYi%Adq2#u4l?xC^tBo2@rHL;_$@P#gc47VTnlG)mh$E$A
zLk)Z1s8DrJq)L~3>U7s;ocZZIpAONBez-~jxpq!?i$Q12J>xL5&LhiqQC1psQmpiX
zS-clu8%8>Yh|cNIS4h}$yY5QM?k+hrRN61TAijYUC+Cv}4~E@SE>#s%Aej+tb2ABX
zJ@lRhdU=sXAG3t4)AfeOz(}yF4M4He?#XzL=0}yUaCI|kYFaEO-#BGEaRoltxP&i0
zqu+&ayNV_p=U_sGLLQg)PnCCqM<?ku`rtTFzc<L7yV)35j?zyc3Bb>dvY3Uq29le*
z>yg&z%%iwJNp{*Y)%|YJuf=r_iSUD#dPLM1!~k?paP&O9IIh#>L0TQ&N>dnb#hY<L
zrB;yNCX#hu`{$C*n(x%Y&g;OXf~nT$bWF->Q)yJF9;p>#Dho=X_AK*b3_bfd@R}(Z
zMc=-p=Q_a8On@kNqbq_tn;3LyR=qfSVVhT|y6FNY|Ih9bb!uuTUdrM*iEE8nu?sf?
zu^bpyOnE{OviUGw?Ix6Nn8R7ITPc=`#Fvs9j#X-qoJ$6inw}YA0xf$q!|>13Nrwi<
zd<<0j4PUaY1zG<SAqouJG=vPFK8e<WF{KxFw#`kUJhh_Q6K8aPkvlbq-4j^6h3?+@
zWNkcEQYV*|Od_i;c)+kaOl|UXVAcB$E>XGt`6;z5`=XayOYvOY5hl;t-j*(1QtcCI
ztl;a;)U0AHIuNaf%Jrn&i<D)F0~tT9aWytiOJ{+DVnwOmN?rWpthC^bHP+H8NPa`n
z4y@|ex;LvcPJ+R=_b}x$BvhouhA*sZ7Jv~{*!amd;|qP+3E+#R*ZS7qHttdEJj&+#
zE!$?Fp0sy=dUbqoblTxUV6MRj_Q-0qvhq&Q`L;K#4xA3{Uu+#jy(>n~NjXH8t*izB
zSZgD$IXNd)k+E^Yz!=zsuZ6^(w^aa*OO8FNgVj}61#*>MAylM~mG`mwW2G6}&EAK#
zfVMOB4A8eJa|)M_Lw9~-2h;As!?4}#_bG-ea0!t$uecF=7Haom;BJbvZ;@1v^|eb_
zn({{l>Ab5e4yo+>V`Uk@1IT7~nT#s3vrPQwXz&V$R~Ha&=Q6s{jktd0GFA7{wlvNi
zK|knB1DskKcD<&auztIyMQ!TwqvPU2PWj}m=Oh?n0bV;xh)&k2o}t8wH^7OJ@sWHH
z^3e^c|Hx`G=3U98;1TL;(7b(>_p|dGHf*G+5rs@)#Sf{mWsYfI$l_$FVrU?(h4H*P
z_-aGlH@;?N1jMPh=^1#_$9$u_&p)J?d5@!JaV9ha`oeOYNiTK{%P!3N*gq9WIH#vX
z(<sG!!<sI#k6bS6BB8`(aJ*q0oibO=#7U6dNz)I6K{UN+`3W7O9klytFyQ*oNAGf6
zAH_?{OO3}&H%E==B4=ljNlv+zEts%AYP8ZMMdeF8M-iPP{6W|fe+2j+jKD@me~=Gp
zIyytthK2D!1b0#?LHm_$l_!gl8GcG8c~&18WfFELKdS3NzV1ZL_10!-H3~*_ULw32
zwZ2f#T=4u4u02vmeO!KyXx&(r!ITQdMSkY`>Dd#RhGzt|?_w0vyByktk&`+J1f6nn
zk5lK~OQg6wVin!`QV@*(yKu=Z{ja6qw$e7an~J{eRwQ9*SMR*DGj>;zl7gpV?J=1l
zNa|yK2A+=b#hMQhYN+;~zEteK-Kfrb)<zws!i`p<R<uf|9$i*c+$epWxh&G*;&wA{
zVCsX7;=-URLk`Q@z%yD|=R?NH`gGz8xkG$}R8t;dhTd;kJ&Q{nVQSuQS;bqu!3=3V
zphE^+OE<06;XQF_fKsa0M|>JNy_kD-JpRT8&ZD4`h$3{Y@Z9Qg`Ig}8TiKyp23_6R
zj#nus#`XP~d;w)Ry>g1oEmMCafw<xfz3EWEaeAJ8GM67Y36@w*(+b~FNmE$DQK5S@
z;x^62Dx{^}1wOSqGSUJMi<k52&fnxlHbzfw6Mj4L-wt;hMRvEr7b1%jz=J3-WABm?
z(2EI?Nb$^xYu^>$t#0(G){XQN(`sYp5w$h}^%<%^twK0ZZWFY{HPkX_Z#BD4h1z(^
zSDTDUTL&~^{Ts=S#MJ;eRZYQ0%D$blf~@f%_adc_&>C!+InOCK%d+Y=gn^u)8BP<0
ztS0<a^k?{^dR<M&WMft#DRtJ3vg^owQv5cYrldy`2fig~wd7I=jp?vFF1}7PW_^Y<
znaSukiP5(t@F1TraQJqcGesudLLLEk4&+h~q&z2lpE&DWz4ufb+PU*`dPTL*l0Lb;
z=^~+y{TVl&orDsK%I6YROCa|zv3`U1ijpO(il&2UvcxL<SXq*-Vx*&_D1=>CfK@IX
zm=wr*Q`d0SQ^PHi$w=BHuW~55_4OT1y><#xkin^PrWwbbB$c;R{fX%$M}J$iQ{9x6
z*|gvo-W;>KTip9F)t4j{Hx|xlax-ETht4`DKFUAu9=>jO&i31{PG3ZIN~d{n)H&VV
z`{{nG!DT)B-MwUD=6sU&$W62;7xfhN5C1VpKc)l6jZ{)p;#?@j7`)oBh#@stS)n|2
zf!X=x0#s?sBCb8TN<N{Eddl9r)RE%7zKxF3f*^t@_T!FD`pu=g>-wlr9ccu>Y3KCh
z;OO}yJ)UKl5>xGDJTT}knd2wp5qadGnAP9}bOS2`9m3@vHneSOnxG<j!Ah``*n7zY
z6<IZ(&19b*A0M`Nj~)d&g${Wh-8@Hgjs|-4V^l*OSuJ`L)y_fwa3Y(6!yLWF$|0dq
z)Lj5qz(p;t_wy;hSpXoFuGP462RS$ljX>t%xHilNro3onAEy|67uq}0_L62G?Vn}C
ze)@??q4p!-XV<B`MZRPr&AXf#9nmuu^Hmpbq#|*_&M!mEUY4DUw<CH#xh^b}PkWL+
zqJ*%dPmd<oxkmsg4<5_7SDb<wi~Tyu+<}l$MF4t@b6#gg2|=%$cQQp<);P(n(-ReF
zk#s1ibSFgw>QO1vt6xnjAG%H{1?Tr0Hv|5<_V2BV-&NHt$@bmQQM>Fv{~^8MY}bi+
z1ZESZDZ>?I17|WMmvI_?bQ@LZ=OyBoZ8$}V9d=6U@EAB^DF7+R97F>`1=MUSRJeD~
z`3*mHhu*EWDAdL}PeDJ8($SH2F7h@SHWGTiWbC&Jm<PN0h}RP%5M#N!%E{&_YMr(y
z;B3VE8oCJRx0o|*#!T^j&7DRHImz6l_SkcEmU%pzQcb;zX|zf`wc^@a*TdR=w`$5Q
zo^q>l%E5u&ZI`FK;7HZL362y3P9Qla4QKD~T698!C9-<tF|E%@37jrA*-2xatp8Yg
zm4(&;=HskIk88|=P&#ObGh&)m7S>s=rfmnL)iEH92kY^wP13yvEx$p_ZxAYVM??>(
z7S?&h*k@9$qYU7ZEdPG_yXUFz_}v$=K5ah=Qa|GT3pSB1KbM^UN&aP6grBz-zxtoO
zKH57yIF`HLJb&G3pX~3R?)uM9U!1ge_x-1b2hU%4P4Hs~CFe9Ese=?cOrJziWHEC3
zed33Z>QVB0kS3=?yjF%acb|1eV!e<?WVcd2=2kN;)|$3z=5AYzm_nV}?6wRLx8>v#
z#gW<V9FV!q2Z({If#E|8({CU(|Lb?7-)gm3^%0Ne?SG$3C{{3h(B~5Y_bP17D)zer
z1BBTo$9_^MY5WDO0X-s!jlQ<5`ynFNVADNm!715wGE|uq*^AEQ%0WO|T3^!U48O-Y
zl7;Ui5)w^f#ci)^^};Ka64PjoOjx0&Uy6;=0VzuO%qdkG$yYiNlSrLdenTbD;yNy#
zAV-Ph0DyfG)X12TiJZ7cykQ9f4Q<*;dXs4~@MB7RWtVB`1I^Z9*@0DsR$A8OM^W_z
z?lFO<4$mt`3^J6pg8*4fUWuykG=G5-{@DT6!9|l&u4YAUZP0XfJJe3!sUd=4THL8A
znK|x0aC*0uzD!1UYIg+u(%nD{GU1&X?vsF5(exWBCg|DCh+|lymzLNWmNY;G`(pcQ
zAdY*@l@?93HI`OpDPK~06O^JNo&MT-hfK88u#0D$^dLY2>dKo2POWjQp|eebyH05-
zl{%DOTpwN4iqjEe*=rm#g#}Eqp64tRf?p7Dj&_>EaNzM{TTih(augLykCq-qqK&RR
za(OKKQsN(${@0x5bO2_wUzyWh4&aO)R=>E1<vBf=lRTr7|C~3CbS50Xn>PnI*E5=*
z&1p`@dq(@e&D%yi<ulsHbK1*c5BA_N4<mKglF+V8gee}5(kW7^z;s+FULtrr8ZlXE
z>F}dzzlRMmX?=8&eN2Z!S!7hL*1Y5WQ#yBIBBx(hnlZ&ih)LRwtz8z7z)Pc5`b%Gt
z3L-151#ZU5i{=(nGi8?1IFHsw(QpzaYyk$9rW)UqS1r4`JShkEm6u*adz~AIZ?BrL
z!*_MGdLeBmbOSHP?mXO{R^&(B=X`k1xcC=@sK484vh<pQ;9a(QHe+$8{l3y0PMe6v
zp2$>%nYsU0F5qqZJR-x@*TDvxQUn@WsvF-8O)t&2P0b)zK&Nc+3D@x+HD{_XTu5LR
zv6)5XOy8Mz9Ex{0Zt$OIvjc1W&$`h*{gZD?<4)UB#ccm`Z_D5R(!&xMFxuXU+++P;
zv&o<Dw8@o{(HC9%wK|%10PVK!blX=6UALGMLY5xCmDtV6Qe)OG{*5es@q<Rd;Un}q
z+XL^mz8SLN7eZakihz$ld?`aFE=GxFC8^R^;d>Rul0CC5n<h@|7#A&}KpZW3B4JQ9
z=a*o1OVMaBr4Y^ZnjQWq0}S>u6;A}^GXoOwMLHqd+mI><`3fJq$X6M@q*Ti<jE1N7
zgnoyUY&1B*^Lq~yz1hr7N!5eN;z}Mn>=<1mrDpWxV=~^E=edIk?UNx(0q_$70h&cM
z_y;whH8%5+^q>Rx#7~NyJkH0cY&EGoPzguBP*foPXy@Ldq7K*_^q(mUDNWad?W-|)
za|M-XGB+JH1}{-a5r{R)g8^M0m?CTI8>u|C(ZMoH;tt~*Tv#=}mvDUwH}{lnld<ax
z;6yA!i+V<FhW=Tv5v@99t7yG0ifWm~An!>%W|%{qS-AlHOw{&l6dA%Jd^M^IaAJl~
zC?khKCs$n=*Pf8J)nKR7!nJsne)scm;-|76PQZM&Z`p?s0|_+2lJdHDPc?7ii8<2<
z>XXT3hzng~uk7}Hor?_}t4}7VCbxpIzxCkAwW1s7@mczbYEPF6%6p}?6}DRT^@V{S
z0(vNH%??*Tl28<N!pdpOg5<&win=O7piAI3g2V$4I33eM$9}3Yb;8U5ttcP!T`rPq
zo%Hb0rY(ZbXd?|*Cw1c8bG#lt$N!v1_giu3W~{0&Pg2Z|lZ<Z~<xIW!;e>4B9$M)H
zsu1cs1XeBfkZ>k4I+h4;WJ$|a@dECRzeKkXRTUvARVU?bE++x>kextZjd?1*W8Nts
zU79`v7~Yu`z;<8}Jge}iiSKd)o5=&Yt^;*q9i3wb(y83qjs$O_xO8FI62&er+L}j1
zsmUpQVK;h0v6+;<5ND2_LA8drO{I*<Au4T#l(c@1dvWGZ;8D#E8S_UJ$5;E&;?bJ!
zjBE#S75i33B7a5R1U%>4sIue(6AJhlBO|!BgS!ltJe_z%wW;4KX%qKdC02ny8yKoS
zOoIn|Ce#l&cvF+*M@!!oOEq-q_u*Z6@9J>QD!xD_QBKTTJySx-U39p!P(mDJ%gAR<
zPfup2dM<&}F(+tr&O}eK`ZHEz^iNQ5rv7aGaM{X@v`0tJaEc2Lu}#(p3$NkLSYe&`
zyU&>XT;M;M3w$?vb(Pn==v+<9**JlpVC9pFejOTE5k($GzBxQ(@N#hCTxyiP%;fJq
z5QhtRFv<p!hzgxfC}^0?p1}EBsI*uVLyvcg)Sf`YYfQlm%ISfnSdduGClM$2aJgWe
z0O@1mb53zI;}Sx9FuGG%3ArXYa4+a!g4rL*NdlLV<D6lt6s?O{X*Db8g>v>K4COs+
z1A1oRxFGaXot<V}i;S`e-%me{#;zlm?54^&(1@{1D^t%Yr<xYfN(od<|M&_0L^!V!
z{H5}>>yF&~O4H=<3@hAl_%3lC*nuL-_&3nke+7u1ab`N7r4R8d=pRXm6n~^yQkGu|
zatKC`h30^3Rdb+qSI)sb0D-&V359{}P{dEL-ui6+MdvpY7}ob0M)eaxYz|l9$z*#d
zBUp*A0;2?aSG@fQ<1U1;Z^rA5FiZG_fT;pXx$I(v1P3p|)>+yeuftG$l_4vX?bD(w
zZ&dMam@o)Wb`T4uYf)su^+@8_WsZJ+q*IRdlz_%{?_r!Z0%${xMk#Hbj$)Rb2P$vB
zBx8%wCxdYv%dw<@%;N6J3OuVnip`&Bo!%I|xM8KPo`+i9hK3O<2X7>Bm7I<3+HAo(
z+m?*@EmcE8KQALDauD%K<a(o1=?shnkSt+TQGp~_=m+bAb4-s(s;RRDaL)f|oaa~O
zbZ`LxEEBh+hFel@X*zAVQ1{~@1t>tLDk%l00$BUz|NfuI`X4#lWW7}T$KbR`OM0D;
zX~zrbAv9h$?IlyL7)^6hsG&)GX(YDwOI}t=e_yvtL!LW{9~+$bS(1#8RB^>6!n!4;
zi(#*RL==CpC4-(zCbMyoKPtUhZ=&uUk&b$U9b7Tbr~}=ee<NV5M(_&$rq>&l7K2%|
zHD*|ZyrlERWd2ldm$5^loT_V|YO3Jsh~((oR0H5<5vm%l#{M1J)1p;K!efKE;)hOM
z#@1n1gtuDwaS0*Jzz&%b@y8Nm@T-*$(UkXy+z(!qSe4BsJSbu3R%VD<hd44tL!7%n
z*bKZ79tYP>Y?R6BsHV6cn4)BUA{ynSte7(~MTp82-|UJ#h*omS>^PNgn)sT|5+7Qd
zjFVnEU!P9|e<XUjs0;m3L!`)*QAO7)tyJtId|9oJtrdZS6N2WLp{u|<#lCN)y<^v7
zqrQ{$|0P8{zD7#CfPNLraqz+D3<ouO%eHpbMW2?8*MO}aPtGtoBDtYUvBp}Ze$HVg
zf|1q0N?<8k4}&CPQUvQCBaqf9pbryl2Hu95kpl5Y{TIB8rW5L=B)F7xAJEDQW)FI)
zO9ZFQw&=jld1^JqHSKYR@D%Gue6;Stx!SZD<xUieA~IrC3M{Xjax=GPi_u`)2=|hH
zTU6EN6m-QGVR@L4R1#fC0$^7+A1*S2$M-efedx|#=;F<W<tefJGL(whmak8?qb&fv
zp2yaDXmI#}-zaTgu$Id_tW~PuF&E<_W=z{OF|hGF^vnfObgdS1xehbTe6z#iV@`)u
zbH`Q!m<)S~ojz1kSfWl+XUSwwi}ucre^Qyc%GnnsuTM6dQiemFbAUYk&)O#^x<G>D
ze;ts-%UPv#Dp;;)J;^9uGoLysz3~38AbT1$4b7uFmcDV~C(hyFWn)Tp^u9{d=>TF1
zzYQo+lc=bX@srFo%w_P_=xptHTFE;a1mp=PMWB?bt_`&AXrslrAxU^b>8<YJTH@#)
z=Co>5RWv2NDM-3+F%gWXGDR%55@I=IuFUyR?yRsil4ukMsLn7q(4nVHKHIdnh-W4%
zFw8NQ6hoMV%GX=tDW<khD)gn8iOH4%lv)MOmf<UjWzL49>BQ7fDeJkGb;@~4CnsJD
zf{tmwWd0;D*gQ?}*O`jku{uj|B4(OwoLXz*<DniB3<*l*08&n-+<b}h02PYCoYO2=
zsu~{dq?WbIzjZpPB~^+Y<ky@^F}=#iH(t|nG;rZ3L)(d(PoA`bJ6VLw%vFP-6gI72
z3t%w`3bGv50EL7FyNCJM{n=!jLKa)svClD;l}S{$zyd24W_RCaU8S9PuXN$rbw}xD
zU4IwXE-l-6>9=$+Vnvt7fB3aBG36}0`-pB0@7=eT@8Bm7f}Kmk6f92zKduGa74Pum
zxSx~hP_x0L9;bkNWXz}_aJZx4JB;piKf8lWLQ?R2hTHYtX@c)efU-SP#ITi4GT6i5
z9p&YAK4@=n(zQzN7<*YWdwYv-yqnV-zZC4p$7V(`&RDb#M>iQ3kMwL*3YkS_^tLzo
z^e#G(#C;T)#E+ETA9fqIoy<FwN@wBOVLAhBYNrC4wZymA?<l!Z8Sp4*J4GlAA}rBb
zno)C|K1<=ANAJjatBlP`PvhCUXZAuaVBVSVVk)g<M~=hDB4FFYTnwn@A>i3=Hs~2c
zX9vA!!c*+NBa3@@p|+iUR%^C*OKVKg>m(O06{)Poed%x2?(oF7`CIvZ7VmQ1UZ7QH
zcJ2}<?@+c50mw-8;g;z;s=Dw5F;D?V5%40vV%CsObDi8OO===7`ZvNokKYkxe$u<@
zYrIlDC$0)O+`-j5mT%rt1rz?9j<YM#4O?!YBr^a89a6@ranzq)jYwOH<vbTg(GG1C
zDLtr)0G!1q(7_JVAzvWzXPdmEvS)6OcpFd-Nm{p+8;g0rHKb5dWqYwXQfXN!GLNkD
z5GxK}OAZ_0(ct2#m|*DHzPd3@xYv!;t!JGm;_#uV5gfc!Sye}uZ@r=BsUo+jii(r9
zml@R}uOJ@Wn?ZQ$lHh1yNV#2{oXUYb;R}P5Zcn;%#Nb*s1`pf{F6wbb9d*sK6f^i4
zyz1%akQF=FVmPBWTtm<d=oL~{A1fMgk%jbT46XPQ82;~HGR9=a7_80=txxL|zs`<b
z&6tE}r$Vz3MU$U4^9v`_oiP~#Zg4K_UiOuzlFpb)r3qTO9K>IFGRcg|Q0>XUY(jFD
z$lugN%FdDaJx+h0rp3gUwyGp8Yr3RL1i>+sQVKrd<&0-6M~poo=xS@|7l1cBq0x*9
zvHx#*Larh;Bo1pY{kW`2#ZS<q$8-DrI`}h~u|CRR>Qge4tFxROHjY57fX5HY>L7&;
zAr%6tnx<FP%4NGFe32aA^du-7t^L~Ps?l2wnV=b`<&UF0&m<oyy#I9oeLVxvl<~C$
zX*H8(ERxTyCQ@adaqJYYImu2G&>LuT**L0&&aZrG*W^@Z>Mt3Or-eBOS06J@9c@YU
zG3`zAph~7PMYHjqF}-QGX6}_VwOn(AJ(x2pJtGNtGftgXT{+Ajacs2fCWnA2zSzq-
z{vXRr+E9+U`fi_dx?^%g);^1!M9TVd#z0~DsOAkOc+~}8*upbS4iR65>5Dx7P;v}0
zCdK7sY}*+<=YMSwEE^05HS1SDDKx-yb;o*Q#S?|oO}ib?(ZFXgRCi?b{}Zl8XIVW_
zrS_4`W$>JK3}LEnFMu-YJ4t(=QiXWSq0Lw~S9dDSn_4li91zr~oaiXS91dz$d5@OR
zcbw+1_w-{r)QPrU93TI*cl`S3R26bzE>x^r-E#Hcs{#i&gB>3vqk>8#%U>^xx@A_U
zw+J_^!=xMIe@I4iJ$>j`e*WW(V;w~mjUGi<($qE@M|CyNoozF!Pv^}}HcLbyz?TP!
zm~08>9aTNXsxmU3GlnyP-ys;K7zsTp;9b`#c%Z@&lOjiJBFQFE4v_E?zhNu=mPTE)
zU<af&KIOIO(QJ^b4|BAfq$ilfjhAjspr+s}+Hth*o?`|xrei-^y@YKaW(EG^S;k6d
zIkjbyO-ITy8nXge&k<b-%jOZAd*D|c*TPWnLfC>|al6QFE4w3|a5iPa>C=F85zSO~
zoN4D2hb^i<uc?A>moe|hQl%3s+1WNPli8gTMX?Ff?}pSGT#yybIlT{*o}2Pu!zK^P
zSzUu%zQU6JbgbN2j1id3OV)zfimGP6umoUk=@6*`Jb-KEWe#LIA7;JR&R&&T41us*
z=GchoT3ui8pTGH+yM5?%t`_74b{{T)`$aaoOp433-W@v(e2`h&+S<hbHot$cZvPiP
z8ylO=jeluwHd|W{9(>>0fcKgYHoxEamuUU#O`-ZT#eImPf0=ft!^w2UdvkvOZ~D2v
zj2P6(MlWE~t(<Cmo*ysW6?^&UhSRaudyS~I-fXSHKU>kirO9yh6|jjJkh^GidX*GK
zPJRSW-osBL`DHDUU;gz14(?zLn9rT+Za1U-WSFIc=-<|&r|EbIL>dnJlm7eezxKv!
zH>0&l9&Y`8)JX;(6Ds}NNr3L-;Cb`}v$>7aKkUJ={b??0*ohdDiVPk2K-$5SlF2m}
zr%a|3;F0P@gXvozj*WP|03qtBDPVsb<~QIUvGQyRzjSk=F!Yl6>SBe6{CsjvPBc7+
z(X>0rdQm?|x`usS=i@>DnySU0It}1&IJZE{x>FoShuRKrqHD}(JDl9C(dvH9r^>s7
zCN5Q9`>Irz=$!ZV)}vQE`aX>w?ehwWu%i<JO@}KdSQDY59YDO`a!W}>e{wmQj2_*;
zPYKXrAQUh#gK$2+xX;Vu)!j!m`u*nG`u!cA=;~Me@V??afqoWJd(UM1>)tGmA$Vo7
zirOSVyH0M3M>IxLyVt7|)Ld<?X<3Jy4S)emKeDHH7ZbN*N(qz^lfrV~C{X^Pk_N5S
zO*WxnJwdE3wfk)M;3v^%D~=vE{v#Ioq<R$})a^*N<wD%afUr+{X@8aEb`6MF-09h~
z#7;$Dj8ZIe!W|XS%jx)PI>wuzrG3LGt;J}Ze$4V|F}R6EGQ=*dSw{tcNq5yZ@^lx=
zv}}GCoo5&5=0YhmFlihX62`Xya4(W^f0ZmsGHrqVWj@kUFh=l<$qtc^(5dPVis!-J
zWJpz#ZJb<_m0~U09p1p6u{Swx9_*lmO#ty9_R*ErS^!OEV=a2gRqBKbndF$5j=|@K
zO4zO@+S9xbh}4^?(sru$ExM~rfot5_Je#onl&K5C8G{_s!8x+3fCveB=JIJJAy?e8
zB$0{s%pg=F<0)IB^i1Tvg5XoA8U_#9KTqwm)WiW2PLEY1+JQ^>b-?Iu0x_}S<{FxC
zKBBOhaLPfLaXLf;{Kr&d0i!#i43z-JC7OgPJW-j(75Z^@Q(f;CdAU9&??nr>#0wCF
zCQ?xb>*yicDC$MU1*NkCQeyOT^f+ZwEjtmKEcL4PELQOklsuF^QmYf$S+oRAfUp*v
zEr#3!hinGbarUw+bTE3C>^@k)&@{IPYszeEyC?Q};#-1lnXuJxU0hJTc-WQ6T93;g
z2?b%KT}7&FA>4!oe3`g|i*kriOG2xuTlInsJ~m*p@R6#0s4;htexwb>q6(sY`i9ER
zWW(NI3Rv(2gA>P-waXprSuyFOze(v??mt3waG&)k1tdKBhJxd8IyusmF^G-{8Tibq
z5#9TF%Cwg9O0r8Wxi^rbCelz^lRks1f7oYiclF=3M<y`8lfg9=U~>F`dnn8=?Jl8^
z)I%@6rGH<tr6kdJ^;YUj$<ivkSmo`iUUZ#Ssa}P;iC?`&#5v3+6WH?hu%9I?S{2g~
zR=1KmLIW-|o=_drwBTAt*SW3h!SmG5*mR3(GbHfSk&7AxKQ6;<s!L~Bp_6Cy>EV`$
zAsn*#H-H9L8|v53&VG5gbq1(&M*1rA_*39<1kbY#_yL~&_Ras#{UJ%ly~|LGWPC-B
zb%~?bN4tjy&yU*sXNT=G0M$2t!;sDMZ}bZ%$ESz&PjGWKqPoWHdcFRs5j}Yl)w>NC
zBBHN5J5haWGg_sGjfUys^+xOT_#q5XAH~r}ZMMGc=QrBo`lx{g|F(HH4{0(V8x22l
z<aQl4OC92B9^STB(_t&vVRP%2J(><Tf*rOn@0@}2*5=oPv)MElKIWk}S_<5^T1TM6
zXeHY8JH-WUv>LRc>>Sn<Ku)#Nho{GYh`3Tf%jLSp%;g3=0o?l=S-66)-~A)IQMb<l
zVWXS@_i^(bosft4+sqD2EnD0YuqDv#2LFh4Jj?x7bhycF0Jwn;AMlTx>$m7|OWHgP
zb@)C1_+X3n!KEg8C(e$J_jWsX-H^ae$W5a*WCqkL`->|2YvKma*~;7W*OLBtgTK7L
z4e2k86SwbgQ~G0kxz%TO#}B0AFs^+;$6Ko7#kXj&j=z_V37It(cMe{i9KSx=zuia`
zL-+IO?_b!F+aZ2Fu49_ikENK;yLX87sfZW&*o>p*#+@!)ufzWbW>^aOynBc1dWP#U
z;_esEuthN3_<A$k&@<eKZ_f+_J46_^z9tO+$|bj&Uu(%<5p7z3?MeCmYn_y@xXUd)
z!`2s{l+P+<=Q<Ebt%?z&N1gNf3ELViXTw-h{YjC~Y&b~uGyU2J6a|3?90r*{990j5
zqdeA+s5P5`6|cP9i0<)A!izY~iD;~U`hH{Ue5=3p;QMv>>%sRAC;-rXu}Lp(ZEl@^
z-`Z+!rTEuYKk#CUU+jJV!`Am(58%ZI*dXxY1`oXnFKuqMzW)LL`hKJQ;s>0gVPQWs
z{NJ1I@4#C>^xqK=CJ)Xj`8Q=)<efGGWjFrgyGWw%^sU&id*FES^9i-a_wPmDdn0yn
z4@`4<O|DXYlTY#oG0Fqj@SB*18RhkF>*_c9N{JF4<Fv8f<FHSE!Wn+(I5{{l$?Vbz
zJn)qjN2Ts_>k*H6<@oz>kr@otK6eY^e*XxT`=_^F!z7bO!Fe(mtWGY+Q)Nh{mRrG=
znkApn@<Fhr=JaQ@+zhtVa>b068^M-ZT$$0b6>O<Qq!|sH!G^%$m+Q2wKXMDNSXkDT
zo%J@FH@RzL;QFWY^U}+Krik9yoKTh8;<Y)OXc_sO{7Sm6Z<iuc$~99ScQxVqT&AyQ
z!yK1>XEOWE|B%`LA+ukN%qp4wA5U$yn%R;BZ%1`a4@OA69rZOm82R~jRM_-jB>LM?
zW7C7tG2D(Sn;x{*<95{9bbxA@|4&kBv_Q-?sYj>n&gnu%dMe!|8c|r^i`~wPGi?0L
zH!huFQ&MpTJFvC+c5Cz9+lQz$=9BYxfY}DfBkP~mQ}b`XkN<9dPk(pu->q}}_j`~F
zKF7M@IlZ>Uul4ZXA2#sc-UIx1;|Kir{2?{mbQ(TLsDJ7+q1XEK?>hbaaGkoP4%hom
z!xoMBJx%hQCf29Xf7qfXTV_5FA2<!W{E+_rp4Qu<zf&6PhfVXOckVQNNFyfH^A9w=
z9<Q33JfM|+Pro)FIt_a?$&>(cPJcfjP;AlPo7AMo9d@0D8w^k06#Dlet@ND6TBixG
zw`f*w!!3H)+B6&S1Ht+GA53%p7k{;ZLw%;3W;@mywzNSHTV~uJQWpVel<p4(XBd)<
z0A1?j0dHC2G)!oX2}6=zYqbnmS~PB#LFZx)Z+iN`;Oawa(j{zpNDZ6x{CgJxexUhp
z(1;ItlIv#EA5bSLfvf3`m@=}p)GDAkJ>d>}^rXd8{oZXzliXxb@TL=>wwhK$dXhAq
zhJ50FpnrQb?gPeKT3wG;+M?zgF0L~0`PlM^t)AKR^aq0yTR*rB>9szsf)Sn%)cLyE
zh#pOQ(?z*%->ityjCZ!#H|V|9SIA(GNN0gzo6s7YiGlM2p3jzAh<&WSH)ni<F^4)~
z9PV{ZC;fHzAk&B&JmQ8qn?F1-9X{9yoQ@tf<m1c}V+!z)2^2M1r@xbjf$d1n&DNju
zsi%J*teYdybsI7sc4^#)G`)xPq|b;)t4o^-?MvseX`jBX>1u<X_v!DZi>o}1-nluC
z>kQ`&v%d`ImWy)91GCY*>2kCgAWY}`YVuY?Cc;|}%oZ?l-m-ziRBp??0vK~FsPd-p
z-to>p)a1o#xJkYB=!MOu0mXS@pvq4+S^-M_eb1r;Ed>e~*Sbx<cMmcn*!R@u14aP)
zSEw8ljSU4f`wHMaV!~_fCZ7=@*X!yXdpj6Ic=>#T&?NhWiW{3&L+^gvG|*%GS%0Wb
zA97V@A2-}JKBQ6ju9pjlSIYMV{mYbL-JL4;#s}w|?<~GCAD9U<Q_*wp4&LtXX{sBH
zpM1@2nH}uXgnw`w_SX%5u5TKgVT9+4Z$ooI_Cao$9pp>=+#*nnS3&_?l;b`bo=nMw
zs#7QHTV^31^S~#f)iuzQtCnd_qRs^a%BBD<a}xP)zSj8(Uq(y^&fP13kBnS2^g{Co
z11P>&<%qcrn+#Q^qSkf8%mb53zI6KT6_9q#SnJk7mL?BPhaM&86PIY-NnsBEEjY|;
zcS#3dYD|!s;_*K6Ety(8WY0a1eBOnNYndY^d@N%TA1)Vj_=V<{0e-h-;VM(VmO8EW
zdF0nN&AOQDV8niCakJ|#k~5>uXvT-SWpO?!^9D>Ln}JIw?U_k3B-btWEMaEe<2q;~
znC(oM&hS1mWoR0_YPq<|%)>*A>)1%l2FXhKess5E-6Dp<2+{QTHesmpuc-^1CXMyL
zB1*hQCdEw~4P2CCcAC#4UqDR5`Eaoevaa#RhAJ)p2L{5qLGo_XK%0TK6}rk>j3Ha5
zAyakcshHmW;BE(ln#W=az?ieeXuvm%=AuhT&REK8;S;*qGZ1Dz<Ogo}`SCZ#t4=hJ
z;@g-wUW}3ivWV7I9!KpL$MqH{{kTLYVZ*}80U0$TU9*}TW2tog!OK_2C#Sndr;n&w
zoi!TgO&n`S@z&}l#x-D~D0IdilJDlS9twK?n2slsIu|{a#YEMxocD5aTNYPo$_a>F
z4D)OBh@N6avgT?_ez$!bNf(Qw)G=6AX{(fAj%umRcX9OLZFB3L2|mrtpO{+QE}ccX
zw~R9)XAx_0R#q|->;K_xhO&KD@&48(zwabj)lJkRN4tw*oB|P4A7?OKON-}eG(YMr
znd*g)mM%D2ZaBIKH(2f}y~5yh(iX?iZUtw)96fBr@c%%hoJ0lI5Jt36l@s;1VGZWl
zc<e`}5ispqSANL@%;m;aCc8<I^%xUXEJhmez-Cu}9Rg?I250nAYSCUcEeIN|IOftD
z<Q#WWi<`~Z`l;F4*nF_{{X_L%6#{qJGF>SR|CjZMaEA$gyA6Fe41oT@6MxY@JUssE
zCw_-v{<4X0hbB%r9O#h>16Luj@~ufR{zw=wvd5t*ls?lYIOSTB>cA+%h_5}0j(_@X
zSWbYi1}^zkhdX(;dvMs^4|deFJg`L-`d=N2_h0fU$A6}i-e{VfQzY%pR|x~19sk)}
zUw`1oe}2CXum4Z{=Re>B_sjNI`ylt><4?329cIJnr~6Mk`~Hvk{uc-P=?`V)Ho>5K
z7!2B4kD@;=)8TcRMWalZv{&i)D$^OhF|e+C6J21?BxVZ0#3q#P?J^l(V0>0iVU;7e
zRWV0j7xU;5FZm6Hv#S_NJ35mxsuV@u%P0!8pZBIFT<n~Rd(|aReXS#nY7H8ypC$tp
zu%mv`;hh-RG0r4diNj@tZB%bivWY}OJ5np&bc%IcaJDhWLE?W?S|3Ga0&j!en3&Qy
zDkxeLxQdj52JcgXeGYb|eEa9l967KM3)CQRDOC$Yj7Gn{l!TWZD}ePJV~~nV4vp;R
z06rS@JyinARU&^Ac4@*{9?3=`i=A{aq)JENVss4Fv*FM-tO{*5TYf4o6V8b!0Y`m_
zc}c9rjd3OzXEnhvON_grFdA>sit9gp(T+OD&raX$p0uNbPW0;J_~(QD_I^~`?Z9{7
z``#R!zBqn;8o?VUARYV~9Y2e9kA97QIyl;oqxLVaPTHLgc6EG$GQ{CQ8y+7V?H#_}
zKR9|GJ%y%6$EVTZ!OMeF==b!P#+2R;+8yW*Tfc0d?7e^|yH5`e4^DrLqh|-FN6>Th
z4Eo)TUhSTo9_+n7+&zh2y*_z$+-buk_MzvagQI6BFi`tt`{;BH2FA{gj-&R^@IC6h
z*gZU?0e4@+GEO=;%e~`Qzn&aCe{mYUI6mBO!^5X-nBVTx!#0lwtJ^!=J$OlowZHpv
z_j#Kd9z#bb^rp=5&5JfYIyizx(eB>q!SNBoXYcsv^aQ@fu-ubVXiD(GSKl0T+Htgd
za?nBGJUcml8Ak|RXmm{dK+~f(cZ864Hwa#V@7USvPTS0AzrA}1-F2|N{XS8tuSz5D
zYm4sL^P|^io#WRhdu{El?L1@7#EGCAWZheY(1{`T>}-HU`0UJXhnZ369W{!)idmw7
zTDvdb6!%BTIJxr1hQ~nBvGQf0qy2Gmkq@5@Zk(=0lS@qV?sg;(&xWH=M@Q+zpHQ%u
z@{;5iOhtK~0g!4YTBp-K>$FezUcKIZ_UzyYQ1KhAy9WZ6Q{6fJG&!5(AE>sTdHj3K
zl5mlZY*zPoBl7-^Ec#^JyByblkLkU~!PhjKEsW{!#7xUfC>0#eU^u;U#)qC&8GH2C
z;p!#JTnosa5aw6Im^y5LocGdi>r0e(Ei3xjMK-D94^|mYnZ#;SCM8|+S|<5)P^Xb;
z$mY7WB<UX~Q{9_k;yLb-64gp3GTzPzkSS990hMfo?_5Hevvn)o2S_&`3d;6MT9c&s
zK%J@D<4JEa1$usi?I~Y2;4W!^2KfcR)#SOrt8tPIR_S;&=&Yxo5)AOx*SZ?>QB+%x
zTk!^vbNpkK|5$CUKWf!X<}sJWaW+lnqP>HxpGGm@l(?PH19rk<rA6rs(`%#Y8H@#D
zJ)ghF)}gUODD`3Xf;6qO*-#x;_2(Tz=j~<hb%T0pxgI)jyxcI*CmhAIe{Y{0*Y9zk
z4cl{tA7S+k9+?tMPzD@(;NSTL9G9Uf-rktU36A0KR1im>Xn3*|F9G8<a#c^0D2byk
zoLXO_B>UKe-RiY0hcK?wBj<F4Wliva+)Jc#yrb`NGO6JQy?zoa>yMlI3ulh*Z07x5
z(_ICOx3s!sYrk6M7viOcH{V`U6|cgm<~lZ#uYf1;;}hs7n9I`;q^4eJH?-2=YV`^b
z!(m{;^dIf%QjbfImKxC`Piyx@Q=c{cqH6k;OHjQ@Y5AEA?PtNd8<cM~iFTrHV-Bte
zIwu%|-nGLHyrZN(c%<Nxs{=lV4wd@InS%f0o7RikH&%TT^r<W=l$DhI&TMP=<d;bq
z-P$;~rkd-q@-&sXxYMs<SKOuO-Vg|fz{(z;y?Jr4_aY{!(4S|g2f$~qHg7YW&D7w4
zigU3>1TLm-9uLmzjoS?1Y~+Hyt5w4wW(Ylk1(!aGkoisBA6=`#s6bhXHNxxdzgkuC
zKcBzgQ_}zak&W>7{D<X#Ykj}jY(DVwzdhJo{~!I|KjL$rwJ5Udlxml&k`VU{EOL%j
ziu=q=1JV9KwMr;MOhT^%L7`M6lAO1ja_ML;t%Zf1vmO=Q!-9<kX51>GZa%rxd4MRP
z(r}Vul4Z(>RFJ~pnoA+`4_x(6O$KW^5PNTaw$iyIn6HEtRHUE-jt$<X{3QoeR|m^3
za>Zg8d6bW$e3Xt8(eDhSG^0B9oJ*J0J-A-c5glWlJ50T}7QM)?(L@{TO2{cKT=zz~
z;xk+?*2>0#C7l{i%+w#_BuSFzNH#)}&haua>D2&Bp53s?nRCk-6<Kmcwb@{{)g3BT
z)z?$ElEM|c{P%-bhX<Y0==kUM2`Y*XcYi&8eOj$Gv6Ocg=@6hbhz7|GWe`5Mr%cFL
zhyqaS{GR+VAam*t{xwOm0sTR>Se^i$jc?3<*Vfj|vp?XK{*H8VbbQ)=L<+z2EFJV2
zzX&@K8DYaI`A$m7cVep6olmS{J=zICLG_8s3=-+tWt{A5$frZ2IPBUbR#u~gOgc+A
zXW!zKSj!F!FsU-CBrScfWTTsoRnjhj8js8?l4N3>7KjqzQL!e>ZdJ%JmE}rOsV?W2
z0(8ZMVU!S&lHuVwodOz;Q(Mi<>7)b+#|c`TDGM8wy$%6|H%iif=jZ2=j*LzhCU~M<
zQhIN~SC!ce_nwg4J*$yuxX+XFSuIZ!?eOQ*!GNI4^GycMJeylIPr@Uarr92x9qhqc
z^aeATnN)mNoM;(yvn@xh|EIaN+EVX|zJkGS@~_cLO_eIQ1VTB`0(z#iIhBevCCRc$
zdQ~8>5swOI5f5n%i02L=7wC@D5o|B^EjW~#^3N8Phz<&e)S_d_1z-naR|F&tlaj$g
z9z0mXw9|AH;CPI$^f;8*wovGT^>?tPwd1;Q7<S?jk@nH)$w9jlpdRvKo2aaVFBZLk
z6`p6GnEG7-%Z%la_^QHMG?*SSnq21*oTy$(Q-oPyQg=z|wiZ1@3})&JfV_bD3xrhO
zLp5~a93a9_IYaht@*YyHBvk|(zTkD(NztAWtD`oS%NF-0qnV93#~znD)_Yf24N%7$
zYsx}30>@OSmhV*U9U|*gH*PlJgn?e4?sEC%Xq4Ox@`T)*qE60bW8p5Eq$My=UN*#e
zO{fuKiZ1iY6lq??ZBewilfy>AjjC2AKnSi_rAXu?aJb?tB;tw>pj{~7WG!L&ycB86
zgvyx@qhi{-R2cxVKYJpm93<=^Ly-dDb;<@lojMhh$jw@ub+64ro!B&vaZq*ELTN@H
z(Rma-q;!fP$5rEH0;C5H(I#I6ag<4s(|m}UPhe=KSE)Y0lnW0}Vu=n&$BDkNhFC)F
zVbskg3bcmw$=k#a710H0;bbPT9~OPsH1knYc_7uH2}X2R@QfJY6^VrP)StB*_;)ts
zG`p~f0a|0nhM;OVac`Up99Oid77B=yd`RaX<wVHznnp-?16VIiKZ$80hX&W@?Ujuh
zeCpSENgIJvpb+MG4CfJmIHZKRFk%**rrCZ6=+L*y>ACDp$|5Ml5~>-le|pxAo(R?$
z7RBLuqUzIYBf1`fxefs^Pq?3sQglp|n;HplI#f)aTyx_a3$rws6HUn`8c|w^j)fUP
zk2_}OoDhkyP4icju$8WFd71cPsvx2&B!q}wY|PGvjTTls^nP#!Lv?cWw%Dsc=7FUk
z#`&fk3B7gJdwSAbf{=wHxX?aie0?kWuPXfsJ?7%0QoA<k;}PB+Qsst^S$b{lf~new
z@M3{XL9B3j@W8=U8FkZPKE1dUA+V2y!mrSni7QtV<?R;a`Ez}JM4vyS)u>6m;bZ!A
z`0nAOPCSHwopQdGNX?cUfT+GjP-80&eQG>L&A&}F&QlBNevRkVlzIIwADm#z9I?C1
zu(`GIP*1YC>Ce)08s--i`)O`iEOn4w$ob^SN+qOqGug3x{w(D4=R`iZjt7gbqmr)U
zQiO7t1svmjgK$+e#US#;MVKJZq5Hw?q{t(0v{vOrY(<p#)j9iCcPbw?oe@A>-4n@k
ze6}#rcqObiT8qP4fQ@k6@ZfkLXVBuCl}u3=+-c}unyMFnH^RM;1XbVkdTHvp{IF0j
z<N#cM==Y-MvN^w(7UQLyocczoFYGRKS^|ANbh_g6Z}s#EKG;*8a1y@(Wt&{5KxR>S
zNHhu|*@&{MtF(`9R?()zujs*F`x3ahmYc0LbBR&qV&N^c^%&pPJvFJ#hSv8W=wv3%
zCM6{2eD8#fF{TA?s?_^kL)?mKcS0Jez9|E&CcsPJX~0<QYi1m|44b0i-9#w0nZ7D9
z$dURKy**SMvn??3#SrTl2S?qekE*Q`;cJ^11Ui8Em^#1`L!9QDE*#1q&Lw;?Tf29h
zqT;4N8CFfL{mbslSBK=ogx)`|cMp{`7!m_3G)acy5dWZ7C{mxIL@4{EoV&en_+WKQ
zD;cTQs?pZg9@I$wlEqNj8vu3lfnvE;Zv2l~K`29vES5z>V8W%%)nc?z6un(P2gKq3
zy@PK(=UYquyB?iy@b~jA`0x4oJB>e)mof6s@}KU1|5Qztf=E8Bl)=A5Wr6o)i|gRR
zvgvu>hA@#`Md3B@Y*h(H6e_)NK*6PeO!fV2soerCpU8rQV?9_R+!`y6NXnZ?j&-d;
zQr&45?3@Y~>iJ;g9iZWP(wivG$7r6+Yp`;X%94pvQ#D(5F+5vQa!Tr@PZP?YZ)lHy
z$ys_Ng?gq#>__W-@siU-sKpUImb!^Ev)d@l{m^8dVY+xASv5kQn%V;1wF(80%&a9S
z&hoCo@=77ZN^noruoXp|aNP^iH%!O&*s-oPKxE_DhV;<O$1tT)KI|7tJEV9|?=qNk
z6Hp-zrBCB(1=L&ZSq(e71o}xjlD=Xlu;*A3t20Fga;+(H4V`-mH6dI%?TbjgHFWsV
zyU)L0lCDh2egHj;E7m*c>_ZvS>8FHB6yWAsBC@OWc(&!}3#1Jpa`vG#3a<^7joZ-!
zy%w!{bEK6A4h9h&bTo(0p3zmE43sV=q&LJacKdy<D!^(%!Be%f?5Zo8B^|%SQ>wk7
z_?<Ttv_dDGEj3flU4JPWQ2X{`K!`R(QEtQo)c(*}!Dfo+T&AC>_Pe)uR+C2uSILEv
zSA^zxT&xyYnN)}=3kjvCg``y~dJiNV>3A3Z*?bsnJ&3k?^uP0{wH`hA9{>2hMNc;0
zm1r$aBqlt{LMl4<Xc~kpD|$TDnoM|<Oi=4!i(<4iDkQ>SlUgDr!5pU`lX=2zcL>GS
zpIT)|XcvcY&;+8=RLhdj)L{d%G3FpS;By}~9K%3;YqKF+=ukoUeYdlBa9|nuh`n*}
z=r1&S`BkUZf54hmuvM=z6n>+l9B9qu6kzsb)EnwA08lC}6!mlRR@|xX>-%_im7>M^
z!YFGgXPb0^UpW}|=%8ZxJPr;(6d8XsA*}Q^M**m+ep8Atgbl{JgY={ev;t5973a_?
zo#lM2>@L^~7h7VBXH5IXfdLaLA;g+(gJ2;if3~osTICv*=0*~sOo~{}D=G7#xaM$d
zK&%)d)~aS)>B1gZt|~Jt7_~P@vMViEl&3;0t_F&l3M>`NFokBLW+9Wh(`@7@tFGKY
z6A9X2QhbHte1;TULtj&1dm(y#M`8#kJ^>3v!K@gOhPio4TY%RoGTPKf4hQinxlwYE
zhINkDMvi6?Xby9@$|qD;3BWT!FM=^uC6f!-4yLh?isUD@!uBxa4^eK6I5o7wJWNo=
zK_?uQ@$^@6@GnO&U@!zl9UMG;eTs1o62Czw27bes28q?M0yV5K3@c_M4g_t)D)6A(
z5``ZxdV_|X7r;SNgZ1qnbST=Qy^rA=q1X+x+~YS#?GujSu-5vN`tl+;_76_l7=dwc
zWd7O%Ai^XMfj+%z?;YSD?O)okqTQ2UV+qrMo;&UT{Tkkb-*xmyeGYVBhxT5dP!Ng)
zv~*rS?VKK*zCLY7&ySDy3GAKr$<GIS?at%q@VG;OdyU~B`@5&RI6U?OP=lZ0@29Uj
z2S*ZGb8vLpJ~?^)3d2Ggu;*_8LI8tZXuVIcK0cx~1F()yC_*O~q$10c(3B1UaPQQ9
z6T?d|Ud1dnI%+>ZJb2zd+B4xM7{b!v&EqJR10MX%?yoA81viZ%RGzuG9MjfD2Our)
z|9pUx=a;cJK#9(QpbtFlyxw~u(C3;>^NKMo7F`mm?L?7hh4ZZT#}&D~VAO?qi0=08
z6U9V24^6;^dB*w!_~oPfoSfKH5vrOgeDLoFug==Av8@LWw2*uskV=@_TIwiHYKoD<
z03EA`rw7l^;LQJg2tY^U)cxhs<5kWEfmHD-`BZZ3$Xy@Wz$auTRN9)F2o*IkvapTY
z)cUIYP!)A0-;$e$t<xd$Pt25K;$NHB>+wWoz{n=-k7W7;rukVr+TD$wK8^PFqW%4t
z9l7T9X|<qhKZ#1#DQ!-f{VB<~WdW7|ML@d0HW<TC_O<0hvBvj>spTr5z;I1aFXG_?
z9Qm`CyPcmfm(05J3s4yK%f@=C&HC2UsJ@OlO1B!NADf#`Q4bpaaijGV^~mKPalj^Z
z3sZ^yjMkq#*(|?7&E<_|@Qtla^F}N9M$39*BlyO{r<99`AnWL2Egh{EL1qc|WTJFs
zdv6DDxPzB36|C3KBRbbFlY%@fKn5C%nulki47^zDHR<=~;SheXwjT02Y1&sh1quN{
zXDB1KR?iH`IY6Ts@ytZi-mG58FZg=jdL0+e6kFbhcUznC=J)6L@qdCb>#OE9AW99|
zjh9JpoV#|p>^v;kttpd`(g_aHtC3xLzEK`MwPv#xQ9;#$b@;^T!!Zh5Y05zAAXe7_
z85&p=iT-=fIa-bAiTj<_@p^(M@&-sOtfyF$Q_M+xV0ja&7D=*urE<}o3F?^7p8k5;
z?$rMnsLD>NJ{Q_umK*p(qu~r>JlK@a849ZCmK9PIhK4-dJvcl&e)bF_GjL#UNPM<p
zW!k2aV}V&1bwFZth;V7V1{`Q^5e~>c%bT!CY@#5$uR;b>KDfXa6ybEVw83S-&G-ED
zg#n#f2HL%<ma*JY3n4u(Ivd*a7n8&z(u9d|PFp3^g-Ba%ygYj3{fflGYy@x6T68>2
zeeJC3g)ixE#0QL=>gawAF7-uw7bJwU&cVO8d8y@f*-J$T$TB;!M7qf<7><9#TNo)$
z=(y1Mz{Qxsz40IFu`Jve<+$Fl(xuqyM;qQ1gPorIN=xRw<(&+GV&15hYp08(oQ<ob
zhF9mRe2laYL*;bwOxe?giNMXj(aO%dX}#j$%>^4xjSXGS{FVAUHkv`l1o!M&n3uHX
z3p*+&XU2RrZECCvEk79c#-dbpObZqQ`wB?~x+9dhMdiXOXd<M_M#+>O9YoFtqG{F4
zmwSYiUR&J}2|EXiCkXo1BejJUC&*i}w>-JX*n|lg#{>hv(0ZopG1FNVFA}(PZba{g
z-$((?^H0c`m&lcSNnfNMTu5Qh4zr7qW)Rv=3}K65o#RIIcPSo(@ol_M%`Io23?;;y
z%Pg~Dl`#rXO{|k(^)|2T6`IXs=##^z_o>M7Al1e%bPa>8!##|e&!19Ki{TA9J;qWJ
z86Z7OqHzYClHTf!SS~RS24DgUIqU2`YoGqgG^h?t<i>h~GCs-3o#Z?{&3F6#y2cq)
z%wn&xs_Frpmx{@hCuk|zhF5-6-8>!S-NST<t9_($Jt5HX#TD!z+NqjVDe63wqY9xW
z1>4<la%S*SOrK`C14}L8#5FFGip)Jss@S_SQIOlQ?MNU-8`9*H%yrFnW9$l%_B<O5
z*x4*`>Nc~%3Vi{{@m*Zb)1=4-OkB`s3&RG5Gez%jB&3qj&k~+U5E>`f1I!cmM@m%^
zp0bD~4rV;Z3ZY5mk_-396}h0tS7B+Z)Kt$xKGl=SRA0DKl+Wf0sPuV;PD>KVuZ;TS
z#hXOUIBFrAq}^{8_$V5Bpgkm**dZpl;&a7notkB()w<Sn@ikP)w%}?_VRgnwZ6^`C
zi}JNv;KNbI$S9czD>kA7=;CN2#%j0^0fr0pwjR~7E0GD6EZ7kLP_ib87JGq@Q1)>$
zyhy{S#am^ti*hpBs1KAx{wjAs0scx#l|4fyj$O%=NV1IRqvW?`XCVtM!iZjKC>>4~
zX;3YOm`1kNTg5IoST(#52XKPcLfru;!9jS$Pm>V?)kfHU6)x-EhqPY-wB?bH;;&p@
zisCj%kaSG2vDgY1S*wbwAuf#!!??4n?8;9r*P4O<tVrSGZz>ot$}|Blnd_att?qc(
zvR!`8nM<8UrMLMt`C@P~&{Qi$%0G=%4iJ6kw=La<ae`KsRAN<`ho#G8X*3xxv6BO`
z)$Ejncg~V(yX1OqtNTMoeU*fF#l7wwqiVZ8;&d?FSwpJB${NgLEV%=3Hn<X+VWzBC
zJb~YCeQ(?Ojex;4imEuev*URYO9037=iS4DeN?TSdyKxXqLpAx{~|P34^s{0CVV`M
z((yQlwF`eyJvhKmXY(20JRNEUoJCs}3XBg5i}f%uva|XajM;Y7fPelOg?>W)-=BZ#
zBNloE)q54Kw>Iate)zP+eKjAKXS=gq(vjV}XF7bc?d!xA>UG;-$NJV{6S0~!H_J_0
zvzq`oOHCd)%w{Dr5EE+S>u#shJ~=hV$v;U8eE2l6^`jm@C)4G(+to9(imK|<#YIxh
zx#5#yq%97k$UN^}Bs+$>%*B4-s20F_uC7-1A5%D&!NN!Wt~<ZO33=pgvGY5e0sZ?%
z;CI+}{rhI%_bsdaLzQ0kFE|8T=*?rN)TIo+bQ2T6fjJ-H;#H!B=IeXp@|%ZnQ1wJc
zwX^Av#B_{pth=SfbQZ5S<7|?;7ZTrho~zXmuA`+j3}+i5FG=}&U<vQVX#+E{D`zbe
z(OyZNC7@4ea<n_XAlC=&X=~wN=J`KerxIAh?nq-ZNpghjSuWd#$rFxGvwzA9(cetG
zY`q=ic%re039B3q%Ylm}?oD|wEHS4+lc#V#5*5y!S(qpt3iu58h><rkv;Rg`^_)TV
zkmPu#WKY?U;9Y5_7w{}+<ZH>BZz3sZ+X1Wmqu;?d+Bh3Uv+6!i8CS68u}eo7SPft7
zr6$aXf#lMip1*zY&Pr<S+9H^+*jc0Qqn{LN#xE|NSh|Z0-QBYZ`MHSCKk`@SMhc4!
zL%WQQae#7`@nu3uXN?vV=dUr@N)L~d6pr%=RuSAd59Q<fcBJ!iqoC>hj%!}WJo>f~
z@=t-6mBoqkX_v=4FO5j57$-y7o#uh|&Od<xl;L)Euu$hcUSqjw6PwDb_aZK*=*>Mi
z%gryGC6N4z$ygI_Z8l1iQt!6Bcbi+)?{0YSKCFIqa~3?l2|@*R$5*2P>T8`Fn+_9T
zs0l9>)kd>~idCS~VAF!LofHhkXNk8oLCiplM!J72u`s%+k7DR3#&hi4Gc=SaJX4P`
z*Qb&=bfki$d6Plvj^@KVp37mfrmh3qT4dlw`tF7u222u`js~zUosY>lql^HkjTw%x
zHmBI74e{(z7&k|`E{O!WgnjA8Zb0j8gch=_h_}9SAzY#xrJ{4&!C%QZ+3;gB$P7E7
zgdQdBn#30CB|&k&4g5q~>8~9*QFlOpRP(wE35ttx$##c<PCX%F;ZA>Zj%Hn!)u0rP
zx0u(g4oP|z;aMo;ZMyy~MC8LOM_Fk8%Bz>$`l?H=dyD4kz74!J=!fRJs^M<2WR&H;
zWXTV{?viC;TuZs(MS3mXq3)PFY`x>s%3rO+4eF3L<EwPI`L1zmK$dp-HiTeyhcq*5
zms#R+<tiQ7Ss`I9->=x^b*+{T319aE8X<D(D0k?6?xQ_-qC(<?KwDV=*w{-BJV2}?
zufxw@2s{UdUui>3hxqvl#MSLEOcg|*W%g^{Sf;}nv_|v~4c+SuTDfqCtxc=Ljjzxl
zQA5??=2z%&%bwxGTXpya3X`acz*cEaD(6)>!!Q3-QyX`-Hr1IqRdw{f+Q-$hqwT@4
zn6ne=VD=<Z3T4C_)<!i+=Z2aLWG$&S9Xr^JZAk>gAH~uFZ+&(qcK5xc=q3I1^{9`A
zLtV*EsSwcUOlpKfn$;opIZKluCRw}g9VJ<qZdjV%kxDV`)T%P#q2>N<m8jdm)Z315
zq=cK5W_%BRj+NuqMyt_q-ZI`l@NUD_A1a+@v=aGlXG${qqOCDzk&swq^u4xCUWtq6
z*o9K(Rcm>?ExN_-@Lp_}_d=jTz9CQiEonqQ0=yoT-~}L5mA`xeS^1d+`f_y(f&?Y)
zfvb8Bj$yqv6M09L7;Nz1vuySZGgiQtBa9C^oOR7kSY}nUM0N&bJMBjgQX>ev9Em`3
zYL&nzP($MaOMO<Od1ehu;8V<hXgjJq2zQ8|x-*S0l+XSe2FIJ>7s(cX<vkE|L3W7^
z2YwsPLshC%o#4v$bqYEnNhrCcpJ3xQ`6!UdTR9r27<`VCA<s>f!mUnPa1}VN{7+}*
zd9>y=Og?58iL!O591NJ(@j4mz8(IrAyTiiKjPqQV;<DRfCH1Y!4CmyqWdJRHTuVn)
zf0=P+8Pyg&`wO76eg2)p0O$2~njWV^{M7Ywj5_5G2h2PF;#{P?Kj73Z#!t?hp^}Tg
zvMONXYpViUUt1N>yt69cuOxZT$>fu0|L~>Jl22~XZ<MWUl7zO<bSKsx*FpQ5%D~s7
zDEoQ*m$H%Saf4(A_^ROrhi8+g+c!G5CA_~|k)Vf3v5J+y_Na~~R<scEv{Gq5fXY9u
z>XSXT$EjLKn9|$yYN@;?q5dkz;glo+0t)(>%OY97ZJ9GAOQ#R>r_pM(YXA~_2e(@4
zDXZjg=j?o2jFO%e8%Cyt1ioA(-rJN5(0?0MIg~R;mRMkDJ-sBkW%xZ?#z77dm_zg!
z#fZh*NH)H=u5!DbNw+<!ZHpjP>^$=3qRU@(2V#zO4_yaw$tta|xTs-ND!Ge5S4-rx
z*md*#>ol62ftZu7*!CGomjqYoM|O0>5Hvf}i80C8Fg>ldIm?N4U`NkjO|ZtCiin{s
z{?Rv1FZ=E(=4G0uWqMW}qILshMsmH9CtM%dbz+waYtVITFsRqbwZ6d<)l<7iWB3N_
z=a|Sbw*7!zD6h%hpg;N&gO;-k7nV;Zg-BsWC&%6<M;rSSBT`maVUema&YgD&*1C?m
z8~*kL?(~)~TWJtRC9Thjz)-zv>GpN^@cKigA=0DpL(~h+AM4@MxdUKiM|lJl?=gRf
z=GOc%B%0G3gX20E8Kbp1e+-a^17qOR#l~=K<3UL`)N0F_nf`0}BfR5nuwSX$dZvAk
zI*tq467{fz)@8V$W1Et=E@@P$4~bdwF%_5o09jROGpW}qPZX`EkbIw6bL+8sKw70t
zYn7zCY-_XH!BDB64J7MzRlR-GV9kR(Xjt(298jG4s%J~p(cCJ7TU+7p!Ou!f1%H;+
zR1%@2Dq7ANo3zx{*rXz(v7bD7SfK&C2X8e3Q?shv(<>`YJyH0!>IX$GG(R>0hUOQ9
zjZxucvs8GCjlJc;W@~fi*jt-=?5)l6*jt-($G(Fy-MLPVa-i}^|FL3oYy#n3vDVEt
zCMnkBN+?kZ@mwYKo;vDE&z1CDXO+@fCeL?d#`$We^9ASnFi-l`=lUxiWb*$eUHvUi
zG&k|i^<B=fpavb-(IQ6{-?V<?iRgvi?x5(w;Y5rUITPNYmcbQJ??Oe^OQ$42AVv$2
zh=u36v-9vS2V27mFlMyK8OAru<Ex9~tDkJaNd5M`Qksp%YL(tRbbh5zysF1o8<x-W
zGmzdS)da>Wa&;Ig-%*OV99p54r%t4%NSQS_#L0PDvr8u^iJT(o2l+L%e$FMP1~;7M
z*hG9H?<#Xl?6_|nTf|K_kec&fKp(tf+oM*!PyBDj$)B@{Vztl5X(}GP?v(Uw3U+6f
zfu6%|NbDAiI-}`C&yXDSu=e8(JBq<@BnsC#COcDHyev&8{8TwP)sSpPbA9s_TSTH=
zfN-klpygB{Pe_pne3u_Y<vnT`0n`sCidHIGYcgFDUX_R0+@|!!{=rN|kl6gr^<c>Y
zOL1?J(HxTtc_Le_@3qv6@+wV*r{_rEDMxsXzV-pZlR=fOG20%Nbb<Z~%Dl)(M5SUd
zOX?LCNGYb0MV~{%DBuZ>L9d7U3#ljvW0q1f*tLO9L~YV6WtNcxfui}kRXDATd^#Em
z8e%y4j7V|`RWHfk4vKP3bag<^v~o4%Bfk8{fHP!ZG&*clAlJp?a5KsfA+1z`?bTA+
zj>lT_e*F6M?D*N)$?nnfHgIYYtP->L4&dq<p>Ly_$e-xu)`)f@9s)B};Q05Y9MCu&
zr%M=fZl$Wa(ax*lflq<Om;)@Zd*YzJY-;43C$y*Nf?mfYX4-{l*!Kfyb@>trp>C){
zz{c90ZM_V*g7926*J)|A66@;tBI@y_6yz_UB6p<&E-g?`I9EYG>to&q3fKuajKvaN
zz(h(7f#k_?%+-9;xrK2SwIiidsP?qYV^Jz8MKH`E@8@ZOQyixrs-^u4o%%)*4R0>)
zabVC`;8UQw-PDw3{7WY0(+$LAZ?dZ%TF#rJuh00VG;uov&0Qv6hG-*{79%{c60p>Q
zg@~AW_>{ydX)5DaYm`f;pz*k3#-a1K;3{-xbWX_5^UwT?`b%hrePTkPyX6)$4qSCC
z=IuAlS@LbRY_Sb+Xx7Z>Ss@w<k+`6g7^+ozhP7&(xg`hr73ueFX?NA0+?6WcjUvv%
zkuM>IUrYwQiMcnNp@x5(4l#p`-EG;?iPQVdjzmPTdzK}MJe(bZe3D#S#;m*Yo{F(i
z9BArD77k~N-RXV++wWnT|AuR7OV`|8UmKV>sQ(hUl;pvR1#9_{7Pk1Jeil@Vys`t;
z)J#`g&{S=POuI|_K!XIt+keOwHyhetbC2q)k=^(@O0P!1yxUpHd@+N6I!dqWxSXJQ
zmp6VpB)Y7W#Sy2ul4bBt<BZL9X6rSP^%7;Oyk(*+3%%^8xb&KYk_oyUIBC*^i~3{m
zmd09bDlc4Ek!zqHm@}d)S<i<ozwBeUg%XzJD7($BqOXm~OidA?DD~bE3!KYpHXO~X
zuu%B2$TBIfo?W6e8{+iP)4(b)T}WO$U7FO+`J!ruNUoDy75giBvZ=1^Sa~cD*y~Nl
zk&{?(;N=^&BPN?tx=(oqni4v8b#hE($DS2bppo6g?c(VVIF8=qTE)*?6mNah1XAtq
zamr;MoJvI$SAUs|MsS~V^)effqGf|7>`5SNuT$<vD&Uil8+#JTZga|{^a^VaHFQF!
z*fN@1JAk3%;_GgeTFERgL4?4N%NY*_vaa;}JneDZd5?YKQ5S##>QW)WCX3f@v2sjb
zoc5-qC{>vor9d~Gl-?jmz~n0Jf#q_mgiM7_mPX88ljpy|PKYVxeews_b?Ll3da^*u
zUWGNPd3O+P#wiummW1Mw%64ReU?pp$=O$^e9s4XU$Jy|M3(O3wPYkjy<=4aNyB9;W
zV>##|x?KK}M78q)%nP=(raIwCB}h23p*yguh{XyK*;Ph<n$UFkAxbW=83$|Gpkk~8
zX89z+jnwHzCC_KURgzRT7QhO1P_S(05Nn(l2|BZ=bx0XyH9@N@2@SXL2P?<IX`={g
zYNhji4sWg#y@RKg(2B7DCOH>rm8`_Gw9R;(Q{e}NOq^&#Ji6j2TT9m*7zhww?*7V6
zutqh#9HQspkdY8!pLe$dO=FTPH-LaF;3LaPYe`jnAc|TiGc>#6X{ssQwRB7HQ9eA>
z$7^xnhgSW8LIHGXK-S4`&OCRFvnAi5@GWc7$T~}+cyzp7q5W{ef5>9&*Wh$a5)KGc
z3CK#WiM%6#U+l_N=p#^nu-a@?rHrEjgrYoMC||D;aoRS|<ftFXM?znl4g1P0^QQne
zR`L&X#xANM#g-+ClOIm3B5tlFM%w@qE2KYUUqV_q(J*j!9OWT_)HZIS%OB$d9cJSA
z8PD;=Q_61BQZg&Ua3HWDEa(T!ks<FI&>l=U)u;k4Z0|XhaGr94(<{s=n_6hlcP<A(
z1#88UOp12qTWe=ZHpCJK&1lUGH2f`6lCAaI?dD^->P(#sti^|nhn&2U1{C3HXY<=O
zzV2PP%s*5Pp|HDVZ3aa@adlI?i02GO+qbjrxL5{qx&#_+&uk=^9mI)|j}Yn;^xBeD
z(-nD5G0x+(m=4Gq%J(NJQ8)#*&fT0x35q6xbfxHH8xsd=Hb~Xy`UnJoQc+0JLko0s
z7Nz2(s#fNFlT9^0+S}_P1J|!Zj#gFB1d0x)9S^2Q!to=RTgIq$G~sxUR}?MXwx(^*
zg|936QR5o<l_SHD^gkww5<$mBK6YlJQ&Y|+Bls~S$DP>Y$baPy)JC-qQXKjbsg9q4
zi0KLZz!TBW;bK}@@ipf59i(cIqJ2b24<7$+N?NaBS_guzh`Xjv=0+kP3cd$zzgvA<
zm`$O}N*2YO+91zIPDgy7$%STM;Q3I!QI6@FLtu_0Ktl`Wg6U=GJ61nfb1{exOw>^7
z&vOP~_JyGA)0+LlOG|mr*R8JA%9Oc@C}*QY%otRwg2!Yd_sB=30-$uVog06l>wkrY
zU!}pz(UF0SM{4W5MP@_F+*eq#gu4$4LXy^7wRga=*h25R$cB&eM{x66?6oSKNbEK6
z9KvIgOiU3L*#(w!Etz|%FfJuYQmG*lqTZ;7vh^hRcJKtVg2Pdpn421Pde-bmin+77
zN|BIRw~a5;^)BsK)u33s#$r<F#WIV6hh9k~v=Sp!m>3b<c;u&T_E}gGpe{E4YSz#@
zz_(%)F}t9s4l<r57DG@q)(cCF!g`Q*CE=*$&y_Gu!WJ$QuL;cRH!=DUt9t|aRh?&S
zH7c_jjW{YDRu3XFCEv_aYBp;W`$kwbna|`dvVIP;Y$eJAAgRG?y7aY<9x_*VY`9Y+
zqL32A;mS*l$PCWPX=oFr5O0Ot<gg?okrEB*bf$}YY*uhYGbZ9fXeCS}WfISFj966(
zwCy6o)_B%#uWozYI~VloYQXQ$s3`Z-K?)$R4X0N%h5RvR0!Q6KGO@D|6n+Vo8OmEN
z?DGhVNcmn|4@@bjOwX`j-h@PtKK0!<N@$UaZIVV^0g1vuK3iMOhm$ZQrUUBqpxlKP
z5ZcRvD|Px07hPe5dd8_qJZTOMgIV+hA^JGVR#u#>8A!pyb~e{cVxg;m-Q)d)+a?zy
zg20+;!`p>-)vEkpRk%POr=hlov9o5qXmCk19LMG2xT_tP!ssj^u<K`LFIA%%!mXS+
zJhzDN|6xwif3P5=wZ5p=B^r=$ncRLVe^31C2<0>#I&litJ4?pe85Yhhl{mDAUGqCT
zW%VT|e#9gYIVO}>8J=;5v8@Y5^ihNZ6S}yaNgM#C!y4MGCoxmkqEDCoEfF~D7zIKf
zN3m?K?Firl+Eyv!vP?=#4#p%&eiXf*UX4uj{v+5$e<5t1xDG_{lRh+7v8NQnD`Y~Y
z1@Qa2gexdf{&Jp=4XM}lTq#W@+U^rHJ0-=$?@D!oMh#BrB7y^DQr;|qlx|lAS6569
zoF{VGd-BI%MULfa(-W<$ub>6?Mi_FrR>)rw`4(@+>WEd5MxSL~<s(}j&WKvr8`h{!
zvSGn-yrd(?9Td*M62FjM_)xDY2$J?9=}FZ&WuDPhQDe3O05`6SbGsd>ns>fy23MyU
zDvJWwL}4B2vaV<60cs)3GfR%mhPRJQwMeWntmX=RhiT0sX5JR*KUXTS>~m>fh;>zr
zIo&<ud^nlmk|*s9hh2y{jsxy3{9VJJKXCLq({a>mmo_0cuSpO30I+d}Md*uZGKPy3
z@q#_1*$u((uAAQEV$U?r2r=5ehPFdAa{b8tial;To{mB^Q1}Dd!m~+!Ml##B+SJwh
zXcdrt)yu%Fn0r}8Jc^z63vi~VJj-k>TZ2?ylj$R)LZRufUwC=y1})S~XtF+Os8Yt2
zt@ic^S|BxDn~t>i^|spi)c`(Lh_BMvkx3BZD~invXce#`?6@!GCj*KBuaw-Xz|vFs
zbyA~WPz%H>d`k6{QA7-=8#S1pY)92z=dPpkB5oO~UvG{?M)l47Eg6a^#zdzrw|xne
zGa{gms3q`%v-MQADOsDbQ?1<67VTLMy3TZ5*IU}-3QHhtgpQ94iz^3gaHBG!N;a7x
zd+_VGls))K;YlNf<z*r?U{Sjs#v%Sr@(M64`g~R8e~2v&@NK1<aPXx0-OG7^nYLOR
zn-8|WfA|A&<k>KrWFUI{!TV2E10XfyAyvV8O)2pcZd<k`1U`zj1WxIOU0o<Jj<~4&
z3QuWLELfK7nkxfls8F+}sfnBt=$QLgx~ON$Hm0rqc0~z2KjlE;h#E7bhOl33FhNsA
zV4jbELYMzNST@y@X7JtF5{<#2YROKU?}VnPwkn;S0%0fhDpGr%Bo@TH+#N-XhemQ=
z#P_PoIJm_?Br<|->(OYOkH&Th4m;bX(ah25;>D_pHJ+z;NdN4P3-?4m#geBn+EJ<6
zTd)cSM;T6ixo_F6<i~c|3zQU;W!AXAWG=6$r(bB=@L2)>jSyoNju3e%w5RO;<%vPS
zCMl(I;9ZFgGsR?R0xNS&NiIg08@a_osEKy#E-Z<|X8py1g46kMd>pcJ;^bx<SIo7f
zwdIy$w`kn08_vyqqO^Jfh-|1jv2~56Kpi3UkYu1<%KkN)hFVm&Od@^^3&sqrM&#5@
zH63k7tD7j=2~3|voAwbYlX?6&Q!9n7aOw@=Sd4>_a)u)xHI{?up!NG>v`t}=<Uzo~
zpjkP-zgP#3dQ6`1ip$A`xj1g>*dAQ|4b`us(cnf!H4-O#&CHGXN)h*8wz4fswGl4U
zE|=(|Fl2#?91Eo^V~#DPnwRy)qgA!ym;tfM6IpF)P<Tw5P62D-qQ#(z$=#rD$+l;<
z+heC@THw`$1^+CIE>Oe86bGd)0?hUdjlo}Lhzri=tEd#diaO!zsS>Kx2z;R6{#H8_
zR3`9|kaKz$eZpUAGPX{O>ZRIVd}>GYt7LOZ4Y;@k*qtXyz&`c-dLq@AiBn}!%7RFM
zJkvp*BVVnQXn{wJJy2Nn<0y3dz7X&k+``CX6-L!u!l=X|sCCb)|D`kU6n4uJ-gtSW
zMlmy^K706$jWV8Yps6_?PZ)if;_a);yDyRAgA?5?6)8}k{t_wLN2&s`ehSDSZ);cU
z<J0ydPEgBU!j_}2+}bLsqL4L>`d2uOzP80-Z|#iINvIhCUDiVj_wLkFVjr@#h~0&g
zadL&_(2x_8eDHmJ-cYZ-)YnyOVLFssT;-Z%Cux{2yVP5$4`SQWrG{W-+b}1YloJMm
zz)6ZkahShhb)0xm;IJ}-Y`8ia08?yxI*Tuy1v)aa0K6y}Fq~Nhk@H-9voYREK%;s(
z22K#D2{4wbVx+2v$Y-A5O;Y0($M+9XRg$TgQep<vPQS1BM`9F6D*iNr1;J0~JdfNj
zOfaRLqlBB~&5PON2q7R2M6}J*p=4=B*eahAwM9CUvhy=Ql}j=jRvYh=8wc0ayLPsc
z8F4yv9DH5NvKUzX$GjqSpgD5_x~>vx2wF@B%=ZJz!o5jgBx{V$X0K?4q=(=%^yu2R
zTzbOeIq$fSN|BLN+F8@VJu?SR3(6P<LZhEU3nyg8R|}odyX|a#wt&@{JNMkhxwWm1
zlB`l*$d+krx8_MMG`OtC9bMWlFuZB5g)F9z!LYX?p90$(BX<OVcRk<v(V5s%_)Y%y
zSZ&&?j3Qx#rWOYKB`rgOkt@WfrAd*IkB25Ie0ziZO*zcj(+?yEN|Y)!O3^@Jh&!B9
zxc1aHBc?JtigPXbaB18<6I+OZqbIij)*#83!^DFsoF-MnxNx~f8F5>V!ej3Tz10@h
znRghNk;Y#C7v0*%8}pJ(Z@aRZ11t!i#A;dGO|0N2j&r0h#2+da=FiPrS$J+{X&zj>
zl?CCV7q;%RNqfnlHyt2HcTS#t+)cf(#m!NYkxKyFd<i=F>BKB0mlK;5thk4BHLNTR
zglq;g-8jPuE4ytGj};3AE#jA7bu&Dbz+6frQ(<e6U1byE5HR~71zmE!Ril~J1L;4X
z*zf&lo<FjloAHGuq6?^y>!54p)8|^rhDxcCmFOgZ^&&#Gt^@@#;ii=$3VoE%QEI$S
z*%>MtXB1SXv=a$jROZAvL|8NCb7i0)C6^7jMK2yrWgl!rR5>fkgLI&Beq%5tqp~4d
zasc#_^f}Y<vi!t1#~}^l&ODN(4$HPhBT3e#eytNt2sXM=M^jv1`L%ivej)0L3R&$q
z`xY?zUE`50Zb#AE)7_Kj?Nh*e_%)6?$FEQJ@D%Wwc;{(!P<W6*R$S6iJ~y#{=wzzF
zTvQb=mpU&;SBL22w+4*P?GlEgnC|%(#rFcS{RA`!t~aHUsLT9U1&~fbWI~UgwIOuA
zJ|@f)vLf2=z~2cCd)f)TFX5da-J0Ht3TRbsMWkCUvKLi5UEYimnkXJ4o;SskIzhB#
zk^n}Le>=&F#bEJZB|U|E=sd2<ZzH^yqN)we5FLr8MElwoj})5{0R)fa-U1ZiD_AF2
zRPU^+2yql0Y42yeyb`@s-cTZF%CMq5(Z^Y)L=T0j35@)2R%g6lT7&D-%nxZgqV#JF
z@e-hI;#mRi@Ga|p>h?7qK!a#yp<dj%hf&fZ?P1jpyO(ic3uO*cSG8Q5)8Pc5oJ}ZR
z5F{)GT6A?mMP#W77Ubbl>YVRVrLHVY1g%Kf`G@4DVe`zBbTEkA333oL2g{n^2w4lJ
z#Y7xX+C5@vKiM3#NM31jRlcDrv|Z}h@_$$C%h`e_hHhwQJ(3Mk8Fx+LI6A?bvYS|Z
zd-=}$1G~|;v7sVb&=jFhKUY}|ZQ-V@z~WxTrMTSK>r;>AbZYCb)DJ+P!gBnpX;I22
z6L6UbIY@9?M+)4j$mKXP2B10z_-wmrQP76wTEX!tscs*6Kfp;d)^S;#@A`o%PopBV
zGxSga3psU?j+5$%Q&<QadM7&T>rwg%xIJxNxWI}ttW@czpSUszml%nig8|GxB}V9z
zD=VQj`qEiFsob^7I-rz$R-#*-$RYojaq0#bGZvMUsR=hjGjo6~LR(7i^!VfK-MYQ2
z$}QaI)q!GAK5>=Y{19+um8WSt){PeRmzeAQeN=YRrz{$e*#3BtBRVK&<RZ4b6V<Km
zQhL<-FO5l+N-i_xVImfUAu6%1g<vbofFv!hchf<B-H5mVo7*GZjg&qz<+Pw0W9SAP
zVK*0fMMAlfE8wjiSky;_i_5<6aM2LjoYmEkFDf}W>o9izSKG(AD!D7?DSa|8jccRa
z`<+*5;&Cd>QDxjyRLXQDpsIikCzGIk5|rb+_Yu<u*k#yFKuAP6$5@F)t&?$jJ{|Zd
zB2KV<&hn@I`&F*RbIw0K!eGi78M@rfyM1s7enPn(O1o1E{5Jmv+M~*rslkrzQs}5t
z@j)n?Sa7b=a^&T0vm%@<<6btj?JG#I0UK2)TQDXH-x*cBqQX9e!dn&$P4mxHAv24@
z$0kLyHb{snQYU4bbq(MpcAIP~bxCNZvHFg&Q5gF-s-Z6~YmBtXLAEw#8b-z#CumFu
z#!4WCD4nc5cZ~7DH&hoY;Zn4W+q!J0g;y9>*I^z*d-EG*|B~(CZBoKT5dp)eNS6Y+
zW3OKk(ft^jp`)p;;1Z$DZIEd}9zr3^fo8+>z037P)MmLmZGynxaJG>eC3fPicf83Y
z=aKBbCCJ2bX{-2PIZ{YH9Xt#n;bQo)2*aWZCzrbUk&pZ%m7>!sGcmGxX!kanjY$5j
zcBlJNUEzi!uzd?ww@Y{b-B`q1p}dRsd}tW?v3x^C(oNo7saYk4*l20FD6o<(Sz$pe
zUV`gYv~WnXbFZFGZaK=X>Bd%&o3WY8U5*)6Bs-c;<O8&d1}C1+F3N{0P_d)i74{^f
zxRvZ5*fPKjT$G#fi*&wDAWs}Mz0Ci9rctSSF}GIFGOgB=3YS?dv?}u<6ic}}@n4G?
z+IHHioKbf5Js7tU(ePR#Ry5K|cS^+k9~_lia%Dlp2s*Twg}96&K@jsDQ_~U`tyVo+
z;TMd1*Ib_}8qwMf(<MA)A5ObgQ+b5gTTYmnGs%RV7!J*!R>yJtwNV_m&=^RRJSJlt
zUJR5k6x~P8QF3X@@`z64F4~U8-)nh<w1sTUu|)tPawFih8D!}YpAFqH%Mui%gw#Od
z)n>qK;i!9aLpxC>XdyL@Wv)}1^bMT>#GAGyjfkhkSa^&st=$AGJKd3ok-BI5x#g_P
z{xVlo_|{~*N_1sjK%YMbwN)9`s38@@$Dv*DI;uIv$=p%L5a-DK%eyM+jOHMeQ#}#T
z>4<ehI^&C&WHdWlm@J%`NfWUgaI~w+$B?k5fINaEHqpnnxto82J<QblERb+P4wmug
zW?d3=!wMN^8HR9^C;R}ol>pL=VjReDqjVYy%f}EyJ|zt(dP)60&43<>S~yW#L`k=X
z5<tNDK(X`=N-PBj7vVvo>>|Yak7*n$fJqx1sK_stVV;$Om?rsENsu};sKZt^AvGs`
zZfu{+z-1Y_-*m?ksAzet>U=cB<-}3?sW+Gs-=erTKNTcSm>ot#{yASe!0gLHiDriZ
zk<*DTd&rzvRn<c`BFAY-$>UVJZ>*Q^5D0_oR6|+!yUM?=zWX5zm=5-au>0CL=Q4qH
zQ^ZhiChEma?(^7v<u;zVYTEO>bMX`Q&<z4yaCrewU5mL0Sj(Tmje(@yfrA~7VyMtP
zTUM}N39<q9c6$_iPf~i=QpMPkD(I?M5-H+boyH~XnDhJ_k(>&2k+fRLh|6g6nehNG
zZZkgtV&ZmCD8Ty%`w!R`xZ>d78R`qKy2O7cJ{-3rxz?Fl{2Y7gRN`_A?{r%DfyjR~
z3h~UeG2C+7iRcQRigKl*837VZ+<O`!IY5)`ziZKc&ITsySJJOAH)cj%wm2)KHAGnw
z_KL#5F_S`^PHJIZAC%*kd^)ZcAKya^f`2Q>#~)uTf|#R9U2R(^Yk|=|)9a?x->~oN
zY~{Gvs-$9+_OkOV)u~52AF>ggZ1{Icv2C2Fd~%H$FIBd6+<>e=b-S`elB}yWl#&vi
z)J&41|2&`0RPEx7@5G&aERzY&r0r4;SdvwOm%d9@>JaVtIFm6L3}%=MWj#*^dG|0K
zvTlstoS&yy3Nw23KgzRP{@n^1yH$A*)#!IhyND%H$`y##22KGYbq+Md!nyI(CE_xE
zbai-G=9_4I!WJfK_S>l<U#e!1(5m0#h_T_LCQhL)tOGN8T>90`?K>-nu@248l;ck_
z#`tTiB7li9Uo(lL$`hg>t3DNVrA&QB%{$4iC=*mq%1wOqIKWU}X!yy8tDLtMril3J
z#-%&Tw_sjms?Ox_j8%}tH^23Wq}c_)y^k0Kaqr{IUA3Tk;6>^$ITb$8LV|8z6YZZK
z`YcDU_g?ItkZ&#}zY<@VoLyl^M7v0=nAKTb;T8m8q&_yW(Bqa73qPNOPtorYjp^Og
zY#i_fXrQkcRu28g;H{yC3gPVH$27JOGK6KY?`GlOS}QlH+|Etfv0<+7>riJZ3`zUh
zN!^Hv!GJ_!s|0r!z*>7!RY+&3`XF#y13^i{H?uqDV8GO<q=>XX)g%W$Wz6shQ7OyS
z31wnMvRqCQgdcOo;a_vOG!)CQryzxvo>U@EZ#vp**ReM{V%#=dIJzE})!Z@YIJP|_
z@&}bgmOO!%Y>96O+Uy)RA9mQOj`JbYlkMbhZ|(drA!GKLn>dAaYLzvCX#?(Ta1y2i
zMwyXo<&HiQ7?8bEg%T&}DqEsdf`Id=xZ;G$7%%K|*#lkgN<lkVsmlR*g<v}<RkBll
zB3<Cg*aayYS{ZN^bX~@+5~pOCxmy5JP}Si?12<j(Q60B6t>-MKeYM2i#aYnN7<xQ6
zzQMJ>bAdl@_}%n#RI`2?POr4?7JmC}X#Z$CVe^m1RefGIDeuMV6EvqwKN{c4%`wZh
ziOxjzkywnO<}1=+s(t7(plq<|r@u`wV@b6B>AUrZgHLhAJG}MZwfa>rDEL1ZOsihG
z?2lRG#B=coUY+$OzVltH@(m*^%<RY&Dd5!^J#r!+?9IU-{M6}MRtKXoa(`v@zuQ0`
zB5c`+I5mR%jxT+$Xm!Z!_d>s#b<X~^s=b%QfUyUFLTL6Vs#!l$YGgNuH0Mdiq{!84
zD&<PH2l{Tk_36)AJbIhG3nuc`6B^nxv2?N_L+#>PDtFCqL1K7U^DY=yU9}T!289rc
zK_x|UeH3r5$IZBy^g%3B0^leekMnW8#_#xJ*wa{BTl0Uel>gkh-MbfL>h!b>mfdc4
zmK$eiA{PAMk9Xe<2K`zr2ZzsquYU5iO>=hsbLHkcW_&t~CYiR~$KTUoA9~?_N~Ksu
z6osYV=v2pOMPg0Jbj*1PNU!uC{WKl@2g(vyM@&h{rRH8;Zq%`c`e?GV9ajPzI4M*q
zvC<9xhqwca)l?HdP=n4W>B-JU*civ;<L`At*UR2h2IyI@8*??;<zDv;#HTSw*z$&>
zG0ap&l*sP{AOw@Alm~rl@oP~X#eRLYSqfxgex3w<lvm3B$a;UvHK4s3jY>RM%$2nh
z6n%b`OnR5LOSio1$DiKX=bjtDMNTyzW=vQa#5wruO2lpQx=Y7b*)W+{1&>JYJ9ta0
zDf?+V>bn_3UO9EU-KaHPa+rLsX1lx_QDqMQ10=Fy%9Yb3?G0jR>5Znm;oLebXjUjq
zm*+8F{_7a8Wyk+mwGhwX>O7P3Q0oh^ZPm)t`%c|>+oinVd@Q&#=v+Qz4FlY@v^7Wz
zW>&Y?04(u};%cZhuMXArwm_!nR(Y4~zf^46s_iPX=VMl=$hUGGCA*l(x7#j67n#iQ
z2-iu(Wgr=ZF(-~naFaM0l_q&!o`KLb)XsjZzEB+zi?}TW7EvvDxvIQEA~w2&tAN{Y
zN87d*hA*|5jR@__g~H61p_!DteYl`Fn_jA27F~Z^+#w1LsSFI6L1bLCdGf~q>CBEm
zNl(e05Qj0^MMT|{eKaeC)3@Tpi191(J?#EFYleI7Rly|0y(0`N2mLqrtusY@7Sp@n
zBAkY(4m2qnU`hJ1{aWQpd?&yYARYM?#-yhMoOq(sV|+;2(~7n0>>3MFwoC(EX%U*M
zIt@2#Nba}%1od_8UxH_kJYbE^t3er-U?@q~MV`H=*_}#(S5;g?CzZl!u}=$5l;*{)
z#86>ph~oDomnqj_CG2n%8U%n>(AP}69WkR80Akg?%?BB#<v+4KI@x_^623pIyqh$!
ze)f?fFi?M<4^;|$KPR2Y_tumwm!s$DkewJQxjt7xDM}81QIULvY5cVMGjF<;a1}jS
z>tg^-y%Bw9uN(NVsAUuszB5`hHlAqaXY^XeTLgf#x<mG6^*7sA=<fl->#@By?1QrH
z*|$8t<so-zIuu}ovl-2r4fLdE!+(pV2mhWq8$LSBNw6UTCEMQ%EP*P#Hdew>J|bAC
zc_LhK5=ZveuBVQxFT3*bawEb@g5{@OJ&hOXV8rPRE_3V1B+6r*(ngTeBHG_!p13rA
z+D{pu=zi|Ovq6T&IqP(wC(zG$iu}VtVDt6TwtxA6-f&L@j;9uke>3=DXS7FvJY~(a
zzP$M9fZrX^%VFxpv`L7Up%R4?Qh-VS;P+yQvokaOz;EM=VvVA|fM?;VLBz0Ry$@nd
z%D9x~m`06NfpQrf{W7pO&PX*}oes0#F?b)dg-j%wO+s$DY$R%|sbDiRzDvZ0;&O{+
z7)j1U)5ZkL<ISLA#Y{4$x!(Z&Dgp$osM74lLh_ag%8$#p-3PH#umLsXfbc;!lwOfP
z?R)@$lIbH6k5Pkol~OS$CG@amxj)r>6&dS>_Q}&33T{R~`_C0~9WY{O6?MQ_0e>Tm
zP?iwf|1(4jAuj4GfCc^~)%6vp>Onp%Kd<XI8q11OmquV3Yf8x~qY$tH_gi1#ijZo8
zTJi;^iu{{Lc}_V$7^xWulrjrlchSuVK;550zdffU>`YZ2EwWtU41x1Dd$*>8$-N7P
zOE%;EQoh5~yxcrHm|;ZH!RcHkcyzDzv4v+>4x6ne!7l<E=Ci{@#k)6ZM7?4n?{#V)
zt20#E-`GY!3*6_a(j2JTS5z|DVU&n6B`B<+pItH@C&>DuJzEP;I#UbHzFaY0v^?6_
z64QD;+e`4?Ubn3Z<Syo2-1x8D)^s-#H?2FDJ@=#Rs_tV8JIj~yG$nTn@w&jV%9g;=
z$T%Id@@?5?{hA<MsfsxIP~o+pu%Xn<I{4~Sx*7>O44e-G&D|7lP0#NFDq*6oC4FnD
za{&m$<KsZHE3>*c8{=9wtw9)2ATqWdFSKJS*p;%N5R@8!@g;0-RTc>3IvrwlDSe|h
z%q^@gZAn-gxVMjvPgj}DeaY2plH8hXtSY|T)EmUgIE9*n>Wc=ze796mc&MU_uqq*N
zIH@X=l(_<wPFRjr6vXaK0IhT;u(*NO1h#)9PcVZQsN?`{e;=0K_lO*o!zF0$*td(T
z3yHR^-wd%n&85<;iUb>Clo)%Bq8k;Z{$L+py7m)cO=6WFrkixLK{gSGqh)m+p(BtW
z%I{NPZ>+#)p3WdWC$;!>!dedQo$*`s#cvi9%maO$QWkqej*nSE*&jtC(a(CAaS20r
zt`knO&wi|=&84NN4u!2!`2b+ujJ0bz#rTZt!i^?pY^Qr?oL(i_kiE&69k8z#dDEiZ
zBbzk$^C@~!@mbyHFTgI;`FVrchDLNhI@vwiciq&a>Ese_PC77lJ2fY4YOzHiVA(-b
z3Vod6pKO~x{aYk_lLhX~a*@czE)oWpPvz%bu-4Q<c|q)x{54jy=!)p>3a`lZ71P^g
zdu-9dsj+jl1<i_ggO6oEoYO(TUZ}j|Xohq_{w+I4(c`4Of6zHQZFf%L$q>W60H=zZ
z;y(FhUhbHuwWLqV)ytaotmqf`;G4feUnryZ)9&=5ejZ0_YiqEHw4wX$r>~zkl*tl)
zJ3IS%_iXp%dFSk`@fdG#k@G#e&7!~|j9IUs>~>hrQF>i(C?_8Cn39ztfZVHQxludM
z^I9Bj#7^43TlMh!bovRp*!+SnE>n=lppOT!V>P^0AI<gFX5}>8aHLs)J{V5!0BicO
zJ3W89(R!zHhRaUF(>Q|Jt=Dd|9BKsuF`P~8p%Gk_H$>~<`d>fF>epL|wZ-ljo2?%<
zf7trI^~2U*J<>2ADqr8f8gN%r49~`Yq>95|I(87@4Qn?o(w?L(Vl)@s3z9oz`X(Q_
zn~QXUkMi?=a#O!I`505wvNJ@zZn=U?KCVqZo<Zl0Wxx~sG*<W-j%d$?6eTcfS`>BS
zPVypF;nn=dRr1O5Z?K}SiJy$$#~*?UdligN-%y)38NY44d;8!WfcEcE4N(EeL=9n8
zi$422FIlY~8y$+JHj(+D;$+*Nj=ymhS<v0Q=WgCZHyQk=>@OAC`3g$A83*>8?>Jle
zvY#U;X-CNz1f8yo@)7Hr0WP-Mg>7})j28afKk(c?z}%rj_~Q#_4`chBRw?w9gYu!5
z^|%?n{KfO<kPId40r;>VN8;8-e}C8iWR_k3u4usXtpPBdxXh9#U>48wC`HT^go6LP
ziy2z01Ux%RmV|JtUQ*?a1M{j%JTNmkXv_g=0UqC^5V9l5atu$cloo>dMWY|1_2^Ng
zE2m44qTxC3QTPojg6`1}r8F(!#HB71DBJi7b_flmu0vv}{F?nbnxOf0XV8y<+%WW9
zqPWCcj%NSycD{0-orzUBJhFQnLnL@M!!D0w$BR4=fL%_mDE+igPL59=MSD6B641)+
zJN=YR>dgQ?k}VPBD7Hn_8NF0OU<a|TGC$Z6$e~S;N0xA}!yus53X6l^)#3eB{H`&I
zdnKs@e$zIl;yRo3E{*c}|Igl=@3(Oz34{Ib>M6=}TLLH$BuE{$4tgOHk}&2q1ZmkV
zYv2M<Aj<+!=qi8|-PZTpci1=FC)v32ssjf_$?j=lrY#Val}BV`WZbc(Mj>U-hRLDM
zFMCdKFn0vMZ9aU+zgp=Nse@Wh2M@l@>7ll{ncu_aqCGs!b^!8$KOIa=4<g}M*Xl<r
zkh6pdJqKimmk)2w+wuMT?-;%?lnr9Ej>@m8f?O(M!M=Ylf;jBwIv6Ssr`5pTWSuy|
zQuip%h1<84qQ-UM_($XTuynVrb?$t(x@L(ySK?tXOn}_n4c><DDyX;+mA(v@%6cZL
z&eGbDu#7HJ?17x=xgA`)-!+U)q0Y_1tUZ-@QJFgplpcji&fI%~v$wD%Id8M*TlZYM
zg}RZ+>aNl11eqU2!?2gzi{>kp$}ZQ74jrl9rWz7IwIK|YKoi?lXeI-z0<KNiOxg(M
z`1lQ-M9QK|V!K~*)mqp1=PY)Cgg}lmODFafC#YPQDMy8I5xA5$@FXTo#frK~3vHYw
z^(33mi;Vd93yTv{Iu^VRO_Q8_Ep&1gnGF|O{lwX%H*cA_0Yh9}kAq&AtO3L+cbHx2
z>KSVjlOX7AduwZcw>u@>vg?|C0<RF&g4J{@Dl-`TalweEUMticRI<6k`B7eek&rWj
zW%)T{(kE=^6rhn+h=_{Bnc8(>!kO4Bsx-Wxs4UxPQ^rL*UU|4W%ryPLTssL}G5#b9
z@#)3et#>+YEivyY-HF@@R!o`+53|_g^!p3EjE#|P23Y24n-+e_Rxf?tk><aY0*K=4
zC<muWZqF8!ttW=HONpOZ7*cO}Bxoz8OaCgRPL{y4yMcDOng)e&H5vZXr|OPs!Y(Un
zop~!q{YPgud^zUu@PW(2^DKkq177ku@R`9c$kwCC$fs|KP^OGDIDd~HcqL5uz+N9`
zLHS0u{6T8VtsHduD?W(WVRs222__s`lb0oBvjJC3{vnQ60O4FfO!}lU2i7ftIyVOY
zwHi#pH|dXWW&_r0U+&PY)oxGS(!2gZRY<+rZBHM(&$;anZnu5uZGVV9pj3XwyLqa+
z_VAYM=IlgMTsMgKCWZ6{I#dLs-i<)rPOYBrF}K{I!^W;=Qf+7M>Cq2w=mZsp2d8z8
zsng=_QwmzjWS%y;7aZ3c-tO8>Zg=f=yR-Y0g4UnA-J3VL-J7@Do!zGtwEm3kCOeo!
z8taSbv&b%=#6n&7g8dvIqr>4OS-*Kv<MxQyFIaYJtjzO;k4SdEE2dfjridWF<Xas0
ztT?bhqU#h?za*+iWdm|8Ou`GPh3IWmHkL(;8D15r8@KTzqnP}}xz=uYuA852uC>bM
zP0qD;lXK;SndF+o;@qcPtg~kQ@FuZ=W{sXln0miIh%Rp!z7KC~ru`@q%BZW^-UR8L
zCw&UtWwKj9bv0Q<(wR)+5n7VjSGUCORECfi=OE6mH>)4Yhj=bUoJ)cW?g(c=voicH
zd{^Z5Kr@+}hO2N9_CokB$-7FZi!1=<bKZ9M*<DCiQY~(MO_Z0?EJ9OMEtdt+ok~+G
zA8qj%S8m_zcWpZprc9d{6xn7B8_Yg9j^4(`NmW;dyasYyzkiRy(fbvbG|aVoEi=H?
z)rw2l=jtJr>HX2ehg**pnZ6Al@f`R{yi9~Dr1BS9pOs%eY;3^)9x||IHGBNahyI2%
z$N$w<5CLeGXgUUj+I%o0RW)|;5dQaoFogbm1pnIvAmShW{z~B_H@C{!CH_u%j|Gi%
zK@2H-B?T8S&I<m6#pVI7c2yJiR1j$8NVHCOb{eggN*jldW*r(+?cuYXoEyce<e$?p
zj)MV=^zC&JOWitiG0UJ9FI3^s#<zM3^pme~VrEZ(D_w<o59VTwxA|?km<TSr-Dl{I
zP6blXIRu^5wl^O><ZN#2BbhIpaXE+D+s%iM#Zw3bkxlDQGaYdrx~Ns|eYjWIeE6uG
zeYRP-ca?rN!^3<L@9PV^K`CV5qE;?)AYZ7XP2JIErX$@GpgsENa!nOUgO8DtDk00{
zJP7kD1I**6@}l2z`Kin+3Y`HEMI6-ZLsGlhX>2YsjbhZzLH0S=to00(;A|3^oLpfr
z3#;F5z0-&cnEcU37s-MLP3UR5&Ig5>+F9cG2m5j1x%R5&1uJVB|6mtR!4W*Rso9eg
zU$f9c%5*@7%KvduURU4VZlGgRUP4=SHp!Xuo`27~?}gf-Q{J<fIQ<nL0sI~zgaA-L
zufOj7vT^UJ^`!Rht>@M9o@}PxS%eIH(()FFJi@$2ynICf(4{sv`X~(pb~DB<^BiRZ
zm{taLo_je5E&!0_w0xM?a<iyUn@H{2r9!W~8kN^XB>`OGASL|j_V6pgn450SV0jTA
zd8)IdT7m}&Szi=TH$z=^I6)12C8C{&s5>R$3rD@MTR>9Wgl#6`Dkt`62By2wmg-jy
z3v*H`rjG>1q~)SN(;7QqZ{-`10K=4+w#WsEFXI(Zcr2ElTy9y>)Xeg3B(nF@f3nw+
z^-f4-MMTz}JMdcQXqG>5?C-w&Zp|4#3#JsBRtZs_vx^A%Ei4*_<>Id}BEr=%i?6(a
zXI+Y)pbWB2SH`EiC>Z+TJSQM@|M`Vm|B|CpnCJMj*hKsVCc=~O7oEgRcoli3&X^_#
zem__YT-f;YKnr?)xWF`M3J;f^!Y9${{UAOIhzZQaXp?S?kRM&e6F5{)ytjl~71SG6
zJQUnO7zOaX%Tx``KMoo1_svYx;<j6b#6Q#YL8fWm&JhqwccD34y71q5`&1ubCZHbh
zeeoF?wfmH_U6F`zM77A1V9>8FiT0RJmv`hc@`B-ba;17rDpcl}f0Kl&IdxjC1?yF9
z$*PJJg=rJI6T>wZ82bW*?2KhYbt0z)fssbs2W5xH-OO1bEzs7%Ve)f=<6Mlbc#B}N
z1Fy{jG-7~lmN8)G+XbMeGw%}p`L=@Px1V_5P$3d8)#oSD&duA)W?6vU-Zo1BtH=xI
z7P|@n_V^aNZk(5CQN|Ev*Cl>U$~z@^MH?l(QW1Ts7^;$uph!mv4GK9COW4-}D%~<}
zXYjKlqY^u@8V7y%rvoe{fj^Jni>tJFjfvAHa1Ub@@PwU;6kk%Tlt^^O2<Kra70<2F
z4NNE~-^^Y`8UmPfgyi?$CZ>7up1{Awg0~4$oTq$BaeItReRxhNOUy?4IX-Cxlb3)u
z`;=z81aDL*y^U8|Ez_6PayjWGh+65FN%Gg(1~wl)N(sSOT)?o$N!sw0PVYid>^TWu
z@FNK^bY|VVUabrObn<RIar9|VGkvJkcRbr7YdRyDEKIUHpkks{5mg{24$27f_?c-R
zFU-x5{-kp?6wc38xschtw6VA6-S<=)!R>9ptelDJu1t1?+*#CaViun;{^pH9;n}lm
zLm`uMBK^tcph$o6>c(b%!t~d@o>f31&qlm>hARe6MKa+$oi!dDcO?2<kzfmI_U5Of
zDL`QC2zo~<{5tTNq5uII1(%X`OHD8jHRKHC4od34`GcPL;ow?>=Jz~%i)R)ARtXeX
zP{C+?m=>9;+&mzuewU$(m`~nEpS(+-(zc$NK&^x%CNBwx;Q($iU0VjZfFRDUb=3<#
z1YN3lLiZxJKIsnF1eQ$U9?GrhoTrNVEeBF^AIo*bO>vig%R|syD`7%ulc<)(-J~E-
zClyhHc15vb>NAUeB&I@!{h5g+ray-vus`T-GQOgLXeEM=`HhhS;s#k8m!41&*u=4g
z)ak+xane%RgR&YsZ8gpIn&TCK9~SoqXz3xGp2e*0Ql-8HRL?W`Rp8b_AG6ge`dH{l
zvLt^hndw}%toCT@+Xui-)E=3}l5fu@fECWuS5evaT(5)F3rM_Xzi?f60SR~k6#RVX
z$L}?dmD0NBbBG08DbEtuzmeffk)?l*oawXKe5q#RA8dR_#@H1<>GfA!EL!|V%TG;u
zjea(6tfL$3=?1!5sjZNU@2B^(f&O|o($Pj?cHE_V+9*s<yL?w0ZnoS{>kB)3w1^>J
zoo;<p)c`L;C%6wk?onETqTwemKiFoGebninh28!bZ_liwTTc2HXISSoTok>9Kj*-1
z6iu+QCIIiT>!!z0v;WFOwig&J7lAdc=1&E72CU!V=ZgU#Qz7@S0E}$e-rr4utrvr+
zBWyAeIF7{6;l@81XbWl2+HIu*^pmdN3r@#4^I{*c+>B_J#_q;1=j$kr3TYhYOiN9F
zt(Xv-J-DW~%91nLDkMuwGgI?1pwT-ENH0O^(j^c9(~42<J_=P7Cn$D|##-89<T@iw
znbc3ofZQ{ix5}PYz<l?p=46*A;7w@;j*O<V#?`z`{yyBrWHaaYt(n+qJyRZx5B@qH
zjPA^x+>eM<_xyXXXp2j7iy&K=a7}MAjKE1fON&_2gPWq!ncPMyg{B*`Vq+D?V}BU?
zqh2-RSCCzM=dZl>j=lEmh`AnlGGZ+~VqPxCT8=;Qj4h}+)0nvj4cdSbRS%b<7QON!
z`_aX*Hvgjgp(eM?emq=aKQ<TJk52A>%=S~2X>87%h9uQo5-m2DMhmL8g!2faX+mkb
znfxz=A-%schV=d#7@`pMb79Dmh`O0Sjjb8e*!m2Jy0ti>ssLBi_zpw&CRrpUuM@L9
z!%_PdSN|%wx-2!z=Za1B^^bSH4o1DOf9G$vpMSTHq;;O4Zhbw8yX%woxu2X@yEixn
z%BznaJ-~l!j~{N>|H8N0<3}5h{#JWX+kEu!;p5FMXjgl<Rjd8Y+ql6w6n>^C1A5-y
zrk&|%GM&+G&hvlM&-yBs>D-CNS8;fDKJiN3GOBF8Tie{I0i|mBgA1SPnzsB=KOBVP
zapXPoN0TrPe#b<RXG7$BdlBWF-^RY`AevHN3A*88zVIFv7R5)$h-{NM>`Y0mfnhIF
z**b})aW|k}I^oC%u@Y+tCl!{GqnQ4UrW5RC2*O`K<mlxJ*BuYyVK_m%<v5Nm!X6bz
zhRLA;vmc=|GD?fx2#A!ax;hNdtWWduGIJvdUnbQ>qa~H*29oDX6-vJoUEm`Hw-MF!
zu5fQ2m!~8<74%~dEEQeNtYFmczz>H(TrHXk3~2#HO$C<Pn|6b|*{E5_q^>m^DYvP*
z>P1~ji0-SMTZc`Fph4^nQEL(UgTz3ec8!a5nuX}~9Rwl0NM&U)odV2?)(jIizb0I3
zHo*yVA5omBvfY3-Jq>G0j~7uA(irD3j3!j86u<+o_h51t#-t6SBvF5Ii6~$p6@IWD
zHDVSjd=TYg#HkTu7X^bVJU)5dY<aE2mnU!P#|;m@9~~e5*xYUGdM|#4hYfG%@aX5`
z=Bw8y-s{7?-Ntdts~_ybufV@IU!0yC!VfF;7QDGaCkCF?4}SI<KOG%6S}pJJ*lX?s
z#}EC%0LS%%lV+n;@tOxad#Ah2gI5&~`oNOE-d=ORc>>K&4l6h=c9wn9JACQwH;#8+
z!=LpR&AsNy&ot!A=E(sL_Y%gddq?%-ljhFpUj5iRIz2u*Y*BBxzTIYPXRqGeZ|qiK
z4lu6Q_z@%#ul2gVx0hP(;hTfTF)qMa>kH~@uUUVw*Wlq`wY$yZ#?A>Y%Y54bAi^Z~
zfbbkOcAEI5@lyj<R6qW?0^Jg=Iy`7K{`(Z#!E<l7zF&U@Yb?!y4(!m*>2YHpCw}-6
z`)QrNXq_}qPEQ)%tHZ-x0(+}*{9|*c(R%9b9kvK?r>#Z>205wY@YoAL4Iaby7pJWz
z!jFJ{aMCzFK0P{V9v+lo&))!q00wn<dzWB+ctC3gU>zR+jQt`oXe%n-o7WBa9rpY{
zmUnVoM{u+NfIBC4OBfa4d15WrJ7~PxYrbk6>@@J{A$Ihp*=m$|^O`Me)8xV5)M4aP
zTt00Y%#FWVxLl#F^_nle`tFZSoIE$i-T)<9O+g>{wRO7lTA+`|V*QR?(vzx0IAuPc
z0hKt%VxV`{SJ!UxgHwAA9E&%(8V6qes0lyZWdFD_bYrCOOr%Ystp(!bTSc*>&Tj!y
z8z4qWK<-PIK*oZAe5`<i0X!z2kCRmn4Dh>8nK(RRxV!_TT6Aq)23(|>LqgdDk$rM8
z^DqyDJ#i_DFjh@uW>Sp%pHm=wTs9fT2QFvCB??KvBmYhu_XMDJ5?}4m43Wl_Vi>_&
zjVd00u}XB1ww%8L!F4JMvSgsN&C?+nAy`g8hn#3_TPtn9dhQ**_^&pg>>*-sTa+7R
z5h$D@N9ayNMFr8G@f=6Zm@>#YJn1D3hR-2^hYM|l@5*krBfLq%(bRH7Hsx<{s2=+6
zsCU=4$CEhag^umEJ%!!?zV^`npzHu`j>AluSrm{N!jlpJ)>;1RlU(=jJd+B-_5O2D
z`xkxG@KxUNEx#X}MD<<|Ax?%@c*g?5LX+W&FPQKf(VdIH)8*+~L7t3^*dHK74;TZu
zIN^s5@F-z0AdV02bX-Y-H32Tq1Lm9PDWWL4;dhYrn2Poq@kq_@6?!B`!+-E_1|?yK
zxQ7{*gN)XK>isSD0?uKTD%;I!ZY)~Rc2K^<8=hCNMr`72vRu6|e?8Sl2ew-ky(P4&
zv)FE*nCAs2#x9(~`_0`hVZcY^q2^y@z2%lN=<}|qBSe3dUBmvYq40w^7yBJ=906DY
z?XJl9$8XZ3L_Og_(jJKy&a8ED>%M!KGw{B!XO=#E9}OkDC|Ch(qZt+56)y-(gnCq2
z68~#E(K(~T+twqaS+NF}AJ=L#59m4Fgybl<+!@97%sHhM=JzkdgoTb4@Juu~_7f&L
zIX<0cJgKSEjJNa&PA%s=D^T{r?xexR^K|6K!sp_(J`&_*ihU8*Dq6@R8N}}e#!1vl
z^Z(R_H+BN^|Ir^nb4?sygOmj*ItVU;f!Cjox+E0=8(=MYwN&QoJQffm%xHf!(EKEc
zx*>&tYKcjN5ENKwldvF_*%AOV?S;3~KKvmCcYA+!+Q5%iy%VfdrE3<@)o8x~sDOPK
z7jWPeL^dO$Ndh9#Lxfj2xo5qKLOZh^D3p@m8zCnW#rzOSWA-gS(Oi=freJ;CHo@vo
z(*c2lheug0AWn%XXu=1->kkI#zr0GUjz75cuM%OF2vTZ4WD7gONl_5428h`OWHk_+
zCJhI+gsJ1KO7M`&qK14(^6o0}t<Bz2`BzcieUrXa6mykgo{FvlixM&D>}y7KRB*dS
z6*b#5waQ5tDZoQ`33)R9`g6{vHAjSyRf<hbu*9_Nc`@Zsb1j#Pt`W8T^aYh3kJ~zo
zUtZ42%zCX`A?*&%gzCs2h27H1>FE6^x*YL|S70&8)11EHtSZW~7rqa&s8uFMenm)p
z(U$Om#wd@ldye=yO@jV(fCx>b0k2V?kAfyI=UP;XrjrD21y3n_={h*co*%gz!W0?8
zn}JD@XvA2GIaDNw=$nV(7gwHS8w`4iWC$tJv*LYE-ywXU(!dZ7zxWPGow=o|Jr69Q
zC9?}rh0jT<d^4XD+QpoE#MD)mM;!FuB0$JmB%7J8t1MVT=vDX@9*jMhHU6)}yv3}`
zX__G5)Av)P`gbK;QT)j^<y}*80P<xrQP)%jiT{R+B)upgG`T~8B|vGIF<^-+4O|r-
zQ@E>+q_*+&y3{cTIWn{|gD249w0UsS-mm{;S~+L~E%x>fVMuDS9MxrX@))1Iy9I=o
zr$O`mo+tGLfE1pElccs$GQ8!r>9IfkkeYc3ep-?k=S*2i)zc5|3_qD}4x}hEpga~A
zRmhiOpcwTMMWv{ir_d_J`_>%1)##d3h$Glwwm6&+LXYlEG8{mITF=1U|K)g^iderE
z2IkBl2hq%>pF89yqtu2%C=8CI+e?!-=#KJY6QW=cxh93!N-nTIRfrt`t?pe35?N9f
zpb`*bcJm?Bs^Q<_wJF^2iz^j#TA|M02UpaT2SAZaW!*vpMmHLhimy+qMic><MP}X@
zxn!|f0kd#93gYBE91DHd{fyC30506u(PcojebGeH3C{hCFw#sm$bdn=50?SUkN6Jx
zvW~}bG>${6&oS_!x6(L*M;*BIJK=;xk;CJ)pjTF=w%7I6>vpSwj>A7R+Ao`py<Kl@
zjra~+93NRTSDKuW_~kOIW_$XvzIWQNdt!hs(i3*}MoYf53WP11m@IKaUuRmY8*}&@
zwP7HVSwU}6DJg^WhT_k3oE{hdp31wz6QQ1%W913)hzyY=9K~GmBrsyPywVB!Xqsi@
zl|Iajt7(v<nFdfMj)P<zjo5d16v>i#1x)gWfiLo^;39UD1Vgm@b`v%tj<1wFC5dV^
z63V#icfN+V!%>jC=cU@SXK=&iH{s31CbgU<w2Tdh0=I%(C83csSZhrywe{9~_GT!n
zm#5TP?<Wesv`@0FsKd{a(Khq6Xg931TVzQ5+>r7PKZ`5y456Q`#M3*acDt4z5wB8~
z^Q`9t;M*z0FLI&Fh*zjcc7)EtP?nGGCH)nzAxC$LffMG!TIV&4{V;|*Mqo}Z%0m4M
z(hMvVijj*px$FGY5IZ@$4ycwI$pDhioyV0F^sm~o7rJ0UN=CTa36%AYiN2#^wSZ^y
zFCxoC<r%gjN%`h7%nRF!uEk<Gy44*0sI4AVOX_7%O)|lhT*YV}$)IcHZXRjRqabd7
z-t#<t4Stl0$Yq5spe)cetf4m@=jwahATpa`%p8X9oXW+bP@p?74+@y9hxQ@6aAu8`
zT6o{AHNCmnwO(V-E^c(2E|%FD+*8ZW39!#vZ9YXPpnrfmU}7YP?Y=~(Caxc?_2xYq
ziPM!RQ4%4^Bd>awWP3-x+UEZ{$hjdWhWxS#+nR$lRO5#)PjwX2c8wXkh;NITTD@(<
zTErkmdnF5rgE&Y5ssOZQY_i205@#q?K5F_&bcP?aqA(*ji--6Oxp_3v{e2c5?LUJ#
zD=1OL9F-LUAo6Bzl9y%r$d;y1ALkNIKQudCD?0hk!Cqd$fJ8$kPv2L|u4$0<xQ9Qa
zf#}RE&3M&q`;(l0>>N%xx@<Bhfu26((eL+>J@%!`43LP80Hzn-Ii?qcz?I9?r~8{t
z@NQHMBI{KI;Mk~$jl+}5F@%aWAqBV?H|#gX5s@E~_!UJNbv-MpSO@*wJ58ynu5s#h
zUskdu0iCz*ZGHkPrF+IrY2lX0+H9=4d37g@NqeHe%B4}G*ceHgqi~{r6~dZKNsF(h
zpYtxdS^YjFBaNzik#40Jyz_8vTROzsn!lMxR%EU`Gr!rEm2kO@#P*ge%~R(=#;eBK
z(U}9i&WzCuWlMou)KJt5x%n+U4{19cXFN%&q=(PjFI%rXZ;1~3pXr<yEmPw#pYu=~
zlJ?Q5Tx3Toe8c)E$KH2r?4!ng#55-TVKfECRe6yRV?f3-(>_#divu6%D65`=9FBps
z0iOhsMVNye4ZF#VQlQqc4n{r?p>WtdxG)b=J?cxnAcq;{69^}vKfo)cJB<^Bf_sx>
z6(i4c6(dC~jvZK+%d(S}{K7}Kkws^aubOdZpcOtB=_{@nI<6tz7VbY)DYcj~YSv2a
z*)aZ41E3H*xEVXf_>7nj4=HY}c~}(CMIws=Ug!tcqkv@cBZ{E31AN?=MwE-dor@sX
zc7;GU3)jC*OafBz3}cQoxnR7jkOz-HGQUTPB{5Du${UUxkYqcn-ccM)BJzenS0j@r
z@z;D~*sodN>78keDU)rBSss02{qyCyKbh%SN}r|OSKYT3^I@e=z9Z`luhfM|t98-i
zf<X|)W+aUM(D-?#)1*T4YdB73P%yXiYkFmV{QNj+)QW{@iSMK_QyWQt&A44!sA){8
zvyoFfTP(ckub13!%ct^(;7Z8Nj4e$0V7l!W^~MxPEaH(l!40G&=z8bIQ4-p=LdU66
zsYG0_$^~62$xCaNSLI?ZmEvmk*Yc_)^mV)`t)#4lbW|Lo=8(`EajRUGP0aVfm~{_?
z6`5{6y}8~kjVBzC&hpF2Kj$*IMcWEJBcVIHmE*Pp&u&8K$tV)gufe9Dgn>mTPuzyt
zC~lOoMHG*b=peXk^^ye%-c9%n7NBxiAtcB+4H|u|;~r>oR;S$oO#{@w;@|_v_0M&e
z+>4_3)A1X0Svia)_kVW~B79f7D!2=FK|w&YGO+UldK0KKy<F-7#qCtErI|6EYaFH2
ztwa???#n6nN29mN6J&5Gc6dOn6=+%L+UuZxUyoji@)*V_D?p3!EE7A#VQbyoD{hHs
z8(a^xU4&v#f-XvPiNv-SRjY)t>BFDbTS_;PgToe};Cl2{@xPWP+Tr1-kI*6+j+!Vc
zr}|>%UvTCwzOxH|<9n5iRC9SA0x>GN0(wY}TH+C#HI(6QD!Y;M5Q##DuDPc<tT@bt
zD@mr^$LICHhAp=bW*e1x3IDBF6VB1T;|s9b-R90oj_TN;+Fo?_I{2_V9ga(Td+j&%
z;{yy<UQrfjP6s$08^vl5nidrA7PWOML#9#{7kNntsg{#Lo<P$v(brxuA>XcaDVntA
z9Y2MND!Z&E>yk2hYUiA#G2Us$BCSE{PrZHeNJJrRxQ4E|fcik+*zYH(nw@n5Iq|~b
zm@&j`*9~0FCup4vNf4n-L5AP!OHKyy9vcoZ-5_4XyHi+WmmSuqZyk@IJR{Ghe(b|U
z1Cx#;6^(@boO2wrmtZOg4Hfw@io>&T<PWfbpv!<`g+D8nKp0l+44Ch3G{t~rW^-%V
zU;>zXDP@O{2Jqjfg^Kcmh&1ALWgF=t)OW=~Xf#6=nPZbwLDs(;>DEe-Td2DPrlQS8
zJf-RX-D)hQ3Aj<k!~Z$Y5iI(?mb+T5w&L+?spiE;UDlmC6!Xr6fs$N!i`-N8E0U3~
zSD9_KDKC9#Ugr)}5m#C73496wl?L!Frw!#7oM3PdoIPr}W;uMZd46Qhj&(Y#=@Lxh
zRWetYSpM3b(MR6JtJXZ*XGOsy>noB~PWSSFLq1&SCuajCt-99Ne?{+v8aP)aJ@Zan
z@DTMDK0mKdZh-9Lf0Y@EXdd4Ks0F~XsZ91GO97x56^Vj?elG%KSmX|fgD&bRsQyHP
zX@a_Rt5R^8+=k?QCb_;b(?mMEARGt0rB|o04or-!S@lUg1x&ZhuMwql0urC*f@!Z3
z1)fz(uS^N2sl%t*t>+MsgJ#@gXK%(lN;_2Xe6EZ{J(|+&c!k|#4{)CtHOpV8RKo7p
zwrNgMn~Xyv3TgZD73E0MR6pBUAGkV>cbCI65)+=08@g#F4cCN-@@&N4Tf!&xg<X}O
z<V&3HRP=!%Fz_zuz!8@Gih1O9i<hXVX`;JP9Oqb-a-5!uSLnp=JDYU>z9UuZuzHn?
zo(+>KA-!^&C4^#poW{hEuod&yUJ#6bMFwi4!pU25U*}ZT*z7`v>E-oNtDu`%!g{!Y
zSVPHQl<FvVu8145jidi4N~E9T`J@;KEI=bJR>9b2eZQg~(puP=x%#=YjZ}7ib=rP_
z{ye;{-YY;@=M9e<hlg6!1lFf3*<Abh%jy5uMr9tOpfZPx*lakfS*wLznnB&*2oeo5
zP#F5}VN<7=cPwD)i8zkoXvV8XXp-X$h}~3~p+&-yGH@ubILo}xZ!j!e-4Uq-7|(aC
zSQ8=yO7E;Hf0<k_ur5c{24b|O=cIM3LS5otti6V1++b}RYifBmg^}MX^pI*%Who6j
z8gMNxr9d1HBy)aeI(WapoVDCXuV$ugX~YUvKpGmJssTOR5Y*obn8ePDDb`Ibbt_(G
zNeq0vrE_1^;k*29YN@<qT&FeVc{u{PjBAN&AIy92gR6UVUEPCj?s18LPM~C<bE<oa
zgoJz2(cZxMN7|`ls3N=BJrxNpnYlRSBAYhc03#VqV#GL7d?XR+RKhV-muA2WtHgG@
zJ}<P$2G6WyBsKU_@v<IeeEi(~A{CAM6GGG0_j8Az<Svg!H((-pzGS~rou(WD@I0A!
zuw~EY9AUO{BC_iEB;Cx>$0ud?;<Xl8Ft|=#Vz+_U7MXx)S~!V}OXhqy=crFqPz?e0
z2te#Wwqk9&(#747>f`gKqZ4&W@)>f{@d1L<J^HZ2qZneA(&-z$J!;~OQ)ZrppweC2
zrUYoUcUhMYS25zIjf>Qq6)p|$oI5K@I;wbTh|PD(xAk8c@`xlc0dxd%(fvJ$qoVD$
zBLMXjRL}bFE&1DtA+&R4=Zp$0h<&2rg!qGfp@Vp!2~@p~4KULjGq3iqpjk5ZyFudu
z>Ds~JN%Q5;EbXn}&aGJQa%XGXq0Q4u@K7&|Cs&GJwX~VgMd8+S>1~lUdnRRqMhSxx
zJc%xsM8;I>dHc~oUi@Vg5B&+OeC0AmVr=*p=wQlPYm^)BeUsc%xKE4h4ts0c$n9ma
zT&YEUX%v-3QyFJ^MJF8G<l;%v0ROlTKbpH=ffRoIDj)m86!wMpYX$hHSi{%*@FPZB
zje!Bg-ph28zs6r}!#ZBix=g!f5}CCJ7*jIc=lXnYyt7n?WVYib05}BOJ=ml_{_s*i
zw(g}&STqSs2vZngGcN*@qC=`znA44Q<f8YEc4CPm_vy#YK5DqN`c$mJ-mh<3X2x*T
zjXPI`2hWn%Rp4<KE-+xfEIpn>m_^~2vNtbah}Qdh7EIJ`AcxDUrNdak*HFRAU7C#+
z$T`@-J~=mb1Pe0gq$#v(7U#&MoG1)qCU<!qs`g7lz~*3($)jWUxRGa>bEq5AHRBDW
zIAQeRLg6on)5fth5mO(_Xhw=!JPSD)om83#<=->GaU$=o6MdXHN=o_ZCI?j5<;LUD
zUgCxWIorU<FWpT3mS-hN3DP`RQ!QXu|M)`>%AIVdI@z{5+18!Zf3i9$yh#w&_##U+
zKze(D`s0$^#WCMTe-K@+6y6vH8uy>mB!m=zIQu-Sva(dSvsngszmgaJ$nWM5KfCK2
zC0R^p7N%OrAf$*C0MIXH5r|0jqA5l)TeRwFii|0(<L9ASyEOj4HPzAyz?LUjz0X6k
zJlgo{(5oCje??eI7QU2iRdhkLZ9b*SIk5<kFd6wOz#o~CFbPL}l^bC(BEob-RYf@P
z50I=hNBwXVPOgf{h~c2HST&HZHqo)&!_yagjrPv#`f*Fjbs`e87(D20N{Sb%<<22f
z@U_gupt85yZk-&rU!U&R56UUBB-$@3&8{^>H$jqIU6kAZXP`@rV#^RG#q3JJWE?1E
z@9XBl&hd+%U+x{&Psr78#7w715XPUNPu5IvF~tuiIfQNQad3xGu#&rhVwAf91u4>m
zu@qZ3OvpbtCLddWf?fowJJOor8In{ysXk=R3BD|moFlJ(_!8X_Fi*K=$(dNf#%Xr~
z{;th`$Nr_00?^&BIG|ipJ4CXDfY(LDg00)A2*-?U?P9NNRd@o@8n4^qpudA!<&u5^
zr$J12bc+CHp(^7gDw0nkq04C(!lJls<9$}>0jMzdU<$ljcfM%&mrkL^+W6}vQF9e~
z*w3>p=`Vy;F3m2wdy46W<)fVT0V~SaP^8Ir*Tj2hzS)<>HIv3Jl#?){CY_pW&x=9U
zQQOagTuzdj8`4fPGj}#a&y%CiaeR1>LB`1PR6wnTf{b9*Z{cUmL}777Hupcr*;j_n
zB^Ds}X4QQbn>t)*X|yt~GNJB}-3VO}{7w{4Oc*J;k7g<h97Llv%EX5V1})g$PsS5P
z^b!7O_vZv2ulHZU-IJUXJ0Ypk_zLoI`$8^Egm5Dpl(E%i;4aR~UgnNnz=hgCl|WgK
zWB&?Wyt=Bp?wTsRSgg5nD`m{zA-Cv-g@L_bu=qCpR<V<Ikj5TZwCEy}#G{n;HlKy6
ztOx!C6eU3Y#(?_G2Gnoak|L=bC59>cEk|jMA6c?e)8_SM@<J6c_q~pcH$%0oJ`PxG
z+2<YLGu{`|Ve?<k^F*_E$n8yQykU&F8gHD7S(r<xXN>TwanLw!?o?LNV`QL`{>)Rm
zqo|_OVHlX@=m8W6E%FBU!Dl1fpL`l}mXJYIdojQt{8iU8XE~`H(-{G)T*&$=N4^~j
z>dfJR7mF^sfvg0dnR{I*jBPION-XC>EK?q{Ig{VYXE3iHLbtHbYAT5CPvQa3f)TJD
z-Pgb``Gf3ToRi+vxt5Cqh(xIY=c2+cRn{HNT@b5u415skfK+NR+Z&iNlBIu_oN?cq
zRr4{Y-iH2I^PK4QV?FYb(RsQo4bgM7TpkS}S&$$CTlq%EvHBiNQl)c3|4}RBJ#&#N
zDKjvR11#F0>Sf|*)q4$0B$h`+9~i4Dg39}gDmot+SX?dXEfQ~tseF@Ql$fkgI?Ygq
zFdGOhyCYfgd*2@mXUXFg;cXr->b@aykaL~pmvNXcT4RoYJcD8brJn7>PPlI~Zy#sR
zAU7xCQgg`jfiIYa0_<Ebb4=P}dl~9z8w$PQLbaI;Ub&eE7eyzg8SBqgIxQzOMhMDt
zgC?4rz%x|HOB7JMbm*V%49?*vbfz}KmbdeW>@u_aqquiY3%{h#&X;EkOBQ#dU3b!q
z6FPJncNs&<mCKG{9ziZ&Y{{;>A7|6Bn98vqCqWB)qbFHVY`&}9<+rkBS*{CIx?XSz
zpTM8u>#rDd49WmRd8!!(6b2skNRvg=dJ|5RpRs-GI}9M5wj966B*!sQvk4><yD$%l
z1z=SIIa%kG+{8YRF32_RZQCv~HXd2G#b#E}OWua>s;+OX{c?)SvR|<Nx+WW`-X9om
zLVI<2c02q%f5tOrZNFswmDRLnW<G27s-M*C)rBFMQKC!WE=E^W_%-o5;n^9`e$j1p
z0+Rrx8x6;Z>M9$RVRq2ErK+S&rDVWF*DhFLNnPJ1E9jE#PlB_n?>#(K9wr{KYl-XV
zRbK~}65|t&`cc&>8gN`c*rklO?bhiFw5Qci8n1qC@1O2@TeP@l-;<*d!o1=uiL>_;
z4qoy-xQMP`0`Zxhx6*Z}PN;AltaXZSV{vhe2%HYdH-9=Bgu{@M*$(L@gV)(znv$l#
z{mO}bBahlq)|2z>SP51TH>G!T7Kq;t_uH-d{?T5eO=YXS+Q!C)qMq0f(E=m`WV6YU
z09ecu;S<_1bDE!JQ%D8wtq}vJqwt?bm1MlIZIPakWm(EeT<(0%9Q!V$o|xz^!w2J^
zR;=y7+fM1#ltklFxUx4WU~yIZH75rkfyFgr3;I!Wz&^b0D$M(!BTv0mKO$75?W2N3
z{(wY*gb#$na%nDUBab@=z+_=L(^Q7R9raejt34qHfA0R$M~96wICU3+PWdA)`FIeA
z!Q?!m!fwA!lgSe$#;mA>9_e$lg5lb5sYv#p%kyZ!u?7L1I>L6<3B{IkFaRFZ@B*Ph
zfpr`;KyYIndo-P3A*yf?V(wgwV^N*xpsS>s>hN63Wg`bdhF_qJk;&k13Y@8~?9{cg
zEV3axyYdz7JEExCo?7}2G^fnI37<b-;40)^S2q{Aw=%D#E-O3*3+q1UFr{*E*v~{X
zqjA>OiW2oN6c>>WiclZU@=+8Tp*~7MGb@T=_C{n_k{N*A%;~w93DJrk%!)I2PO~Sm
zxFSh?GX6RXAVH3T5kGmnBC&_Lnfp_jn(@x7Fc}Eisc<~}Py=*$paZl$@51|jUV|s;
zm_PiGE+&({*j`t8l_rvtxn<TC2@sa<*FHbFxnL}CS+HSPeJ}s!t`tAqeC_!Rs9W1=
zqG=LyAl)5fE||H=97LWag)H2WTeyKU!(ii7v)@%Uf^2jVe)2CmPJ>I~=NK6%Q#o$5
zj<!5q=8BBBBW7pm{^S;${D2g3DxMa*CG4jD+QN1)*q<>M^1b}|#Acrsybbb5x*17d
z2e|=*`R`boAG-86`ReA_K0B^d@$=^LOT063MZ)whek#4YbYk6<Tq{=O1zh_O0d7?f
zWfp+5LhE}}m>b~BXtHy1S{3OHh0jy3E}L&-$tz-k>){iXjq`}lC+QKF%+xf4f!xw;
zpo>gJSfTt+ZM0H7%o68VIGxNvSj|p0M_fyV7(fuhbk#hX14YOtU07-NT--KP2)z>d
zkoVMV<+Q_jR8sscbB=yDUF|kUeJWi!+%CrHP^f;;^{0uh3N!COBJZvG@v(xUHwcm>
z=X^Rmtb#vRj2!u}p~zrkZAMst>W}IfQiuU<?gJd}JUlxeVDN9y?}y#c4l2@;$?B}F
z+s>Tp{Ny|d*0TWYT`)n9P_{H8FF`BxyDAe*3JDkzR22>6swgILLs#u^62b_%$<Uh_
z1V^V4po|wfO}6^D47ldC(u~a~<-%Kl!MW*Nd8tHs?vhi9mGNR!=|J*mm(yP7YvK|u
z1=uk=`3{BDldfv^Nhc!-A$}eb5C^dB<+68<VB`YI7L<&TluloQ4NgZOQ@;mTy7Eyu
zgFto>wuKt~m|LlhioiiD9yjQ5S_BwAEo<S**VgQ<azU#TGhA|>9HC1(iH@q4D)|O1
z&|(vFvU_2QC}bg;Tc)FzWe`ekBKuxw6{^k`iRZ|rw&TDox%9Iz99mk$lgV=E@@z%A
zlWa;W2l(kD)eBQ3TW1_8=W-Aao}fvcbDf~}d7iSl_;$_S`fw!*6M7b8uWy|aghoUJ
zgw?CQGL&C#Ppw17tSpl$+!@??Fp8#U=cEaonk&TW&Cm~1ecYuXDMjP;MfUYo3KdN3
zOPi-KrWjn9@;JmqJEJtEljI>TTCAF42&~d(%|7)HTjKYgWJ-iCr88JWK2IyP7Qy93
z<nz3KoqHuKC!f+5+tPAYy2YK!>w31ZJWonqPA<kzI+n|&$S6Q?l~RpiC9zzmj4)2Y
z6IaIrXU0w*klFq`E#fC<XH3JEsCkK}@+|-A%}*r5r<&7-+@+}+jQU;$+CIsoG!_7!
zpc*^kWN@fr<}{;1I&4<4nN#)M>1>sYccZo}(vCnTaLr}xd7MP$h)Q)Nw<>2pEn-;l
zLrGu^51E&;>2CfFV%Rx+zcMd*n+!%snq+&#Pd6G(!ckh&?5c%mdv%nUwGD5W)U$qv
zxikOLzY-gUKcRx06b+#2vQt2{Rq4m#L~`rx-Rw<0Bi9sT;gW=Ic7HSOZ{o^k@m$%v
zTa3n9-XoUi?K3)Z+uqwZ&6C$82DIM2GdY~JadJ*d1Y>Bl0G`TA!sbT&+aWVlpuk9_
zl9^%qxwn-z$w*Z3taxH{5E;x0CeDllvhp8)n7@JiKR`@LCNVN2-Ql>D&NH)Ombg;R
zgbFx8tP=mHt$fK9kmV0SoVJ`~sJ+qs+Y@sU$bqyKBQVRNTtOqUg^}}AMX%v4iXe|e
zUp5!5cnWJ&W|*oiBM{>jI62(xY?{kjnNvYbb6j-NcIJQ0THuVECC?aLxeK^jv97n-
z$Cs;Xe7y6wKkWnH3zM~kIED2j?ye6fweP;$dc5}NLA85BV{E|Z(W3|WZ|(8J4f|jG
zy7lPc*57ImYMYN9K772n1?_4Nw>BUA&D*%4@n?Rf7`W?sf17pyU8ghJ&3XQB`dKHv
zW!>9Z8^_UE><`IzX8%MXfmhnx*m$u1-TLNtp5##~lT5ZlrK>tu-iiNy`djE7gvoh0
zoW?#0Tl@a|2(IFNf09gx@U2Rx$t0P7^k5COo6;llJ^S!A7=h4o0_+iLkH<+c?L{KO
zFn@%75D$yOD0lfH=;LiaO@M}=?~AUANW$0z6~iz`dQ4B-@ILnW=s_t7B*G|)`BCSp
zP39qZMt>8_2>)q|`znvP6OFH!4=L@GJ%mmrvs{8f8ZZ=$R38kOi@^YRc6{J&kMSS^
zDeO$S;tg~_ier#+qiNg?=$B4NHH9&5J&`>7FnJ-l*b66W>`DewjC33a@i3gAa19%L
z5%$O#Sd#JgBM_c0Lvjcj^{CViajy8@Fqk|MW};S2&5j}<Wm;Im%o|P<(s=s9Yxx~i
zv~?AvG=aqsu5M6a0h2OyMty5+TBAEL7`8j`!(kx%?RlHo*}$k4WYla_Du~ZDA;;q%
zKE0?rHJ)wo<~o*rqtahPw1<Q!vg%FHNe%3!s5Nd?+2lg`aU+y365^t%T@)wesU~r*
zq}NBC1soJOLWmGB2w<U^8AAd~ioh(;)kd@<SP3lZPcCu4)x9kWj4r$sB5uWqJR{Q;
zqEnLSxt_dkw!GHi%ab?t<Aw*{kB$$2Z0<I8y%#^j!v>X&IBvdred4`7+}mv&w>;o3
z;n#zc<K~Oglf&Z{cC%7%!OJW3tbXvb*ZAq^xY25PhsR!X|7foX{lNghn4UBnt%}z?
z*x5TpElI_LKD>j&6YPZC1fb=~VTFdyzUdvl^!6LaJFnr-`itgX^W<k5@@4bn0Ec^d
zc+BMRsD6CX+&SH=AA3iq$47^)hKK9hZMJsy>dpPeZq<WHz`$PP$Hu{l*Lsb?9`1S%
z-yAfKJ?_z7ulJ$>Q?0+)Yv6da+}-AJW9J0dWxnkI6k(Qo6|Z&F*lEHS?5Ocm16EZ(
z{<(s%fo@xk|2~Cw@Z8(2@7G_!B1>8D*s#HFV3&4Ij~n|qcYsOj^hN8Wd2)Kv@LnAr
z?h@QvjpHAiJB`*;Z||^0kUMQPDlo`Ny&|iEUI22?0-C=#Z8Zso&4ZK1@$u==N%Qca
z44eK2AOth5!`r(A?85_EGXU%G_-E*sw@$XB;=Os@fJes&UV>U3!O;Tf?VQ-nU`PPw
ziM3el=b-UwulcHRu+zW>huG1ZW~)(#-D|@9USY2|_?tS6d`fG_O@q1d*Ct`3!siO@
zuGf6&)pvhv;{2sOAVjMv_(R~^c`eXa#9U<!ArtCJ)w%_|Uw@_OGCJ6D52i1_<la3#
zarK>j?*#6vgx&No|F^df6qg+Dv>6k4_wf|(%oYqWVER+rsM6iNQTDbTe7m-`_3$y>
z+xyk@HC0VrQ69`NJ)tLfXK!w;^?>k=@br^zH2CK<)Z{DZDIzf)g+zyQZg6vbfBFi)
zg$4eXKdO4bt9%Qqgf(t3`0FFM3E+08LI#*@9bFPHgF!bEuf+4oWc*}({qpj%3Z(hG
zdLG6Rg1}#!R{d`ExAFS_8Lq*T_5G9eU^uCsPlf}0FBtma;E6}iy#L#ycav_IeIN69
zkg<tkl|ih>l&yEZ4oBU=6z<Cvi_1P=F~2`cCcQAKo^RjLZo&r#-d1f>|GB^K)gC@F
zf7an({M4>{8y{Xg+}M2d@?pLH-J?gf?;78M45FKz?n8r@^7)qe?hO=?sLFRTp<r)f
z96*BG+Cs~7V*4uZ;rox}eR*#$@Y65W^ovqcD3Ay@RYQmwvI`J+IkCS)Jfs}U@IS-J
z+k=C5PqCZfBz*q-;NX4@coM)9d8C{T49nL`m7c)&@U^Ej8PiVppp!cAtEA3I@rXGy
zW44inM(Akc9p-fkRCqYWQ{c$8r#OLU2M6@;{rg5RhnL_Ne9bF8+IsW=1fb2$t#2PZ
zdi>qi#>PVg?<)3zt=4Mqy#KNP*xrV72tw<9?6s_tg<E_taJyJGfWXcR#II`-N(jr8
z=E&VD_gS+^x+9$}gWoV*Fqs};lTC*PZWaTb12{G6+oG`ioOdkl`%a!CJ9k{coD=Vr
zg2~yy+INrOT-3fb5;<+nZ_h>V^d7y#4-U4i1%8ib?uk9LwY5)S9PhpB84J5Z+gai-
zuwV4e?47f7tKQakTMr*T{0@%b)?@t7w-0dBooXHT4YYoH2Y>zc6ptLHeFwT2_)b*}
zKrTvQ;cBnKZ9smQrN&W0dYH&lhJYL2_}lh#YrO_MAI-|&KgZW^V*Q)nKHB_l3t{m1
z@#F6v)E+;4oL>K$7tUGnH5Mx>9o43WC+*oY@6i?wwcmO{wKtx6ev(W{Ck3Ogp=-Z7
z7IIKvCVcGVG7C_mb+0*?_S=n$xA{MC!PnlcQT=($whpi6Ah1T)HZ%mJ#S>*$;}(;6
z&YK@3JffJ6`ez%px0~;t|7(LPbEpgBqoq&<N`lH%hM=`9JO`ItB4@(h^>F*^3YPdm
zTGCG+xiS@DW9cLqajk$}#ooVl^lpNy#YZECf-R9@*Z`7e@MCYd%n~(wK+#<#XKMI|
z55D~_WzpdbIe^nhkJtA1pQZxZ@bf_<@ZHn>@*ni|e(l}ez5SFTR$)6e*xx4{|FFGX
zE5jFtb_w>ZT>5Yq5v=?!&%1?53C*T<bCW6U@2|loUTa2bL^?Hk(2dlPssWD(!_^iT
z%z8V_1k!xquIP$XZ9jPb1C#lH6l3!{tfsW_;bH2d?aZnzoa5SKZu_{l`v`fJ#%}$Q
z@Hv^bThbPqJ#I7_8ykivdYYcY1D(!Zyj?#$UE=(2rO$uSvEOozy$n^-t;?k}l_=xn
zYUM>I1Jj5Df8fkTvcH<1u|+L+BKf1&ke-)n)s1zy&K?6#yZP|J;|CkxeFr}+KC|+I
zGuyn0nQbmQv(geX%ip|$scj<rwo!ekXZYaZ#@55{zI(L!7#M;F-#t<@{5tFdl~mf;
zHgvOJZyr$5ClEwNOWYGkBi}y2Ti`=&bBp+m3ZOrJeI(!U>tp$jUy)_{s4_e}e_(M}
zDLrW_3&a?%&Pl(tf&q+PG@XFlMxt&87Qc*EY|aYlvll+Y*HRJ3s>g3OHwJ^Lw^GUW
zrD+s#1K&J+{`^5%zh?&e=*;k!QSlrZ-L5f5kh{O_yK|JjmYSm}W%lvT*TJY4_CJr2
zC~N<TdecFWtl!`mNLU{~epq1tp-;yC1OIprZ*UHUpZ{?CPvQQb2ZKR0A;tTr+5u<V
z|27`g9&V=g|1k({xAwm;@j*2W88hlfO)vOB5nbNens*$Wu^A3kgy(GHCv0Hf$V5sp
z-(*#zHR;nbuyxVER{OT%wfw<_Pkucuf7A~L;dmT*&-~FOjDz1%JUK(noY%w5&Czfh
zyUDe*@d!6zYg@emTbnVo@w~ju+?KVpDT5aG=3Ud!Rxp)onAvz1H)3Vuu5QH0ChI#0
zLV9r`rZ$`vtr;e4el0e@iSbRtI?o2TjO|Tzly8D_Om9*M{nL$a%JN1h=DNnWwB-#u
zyO!}S*YZYFOBvr5wY{YcZ`jwhY;UgNjmXq>Y;P&U8}@Sz+gq;Tjex$a?JeK%Cd*sG
z_Eu<k<IP*p_BPk>hP}<Qy^(TC87+<*fHC`ryQh1NHlTFlxVcZ8+J>vnGR0J@>%;^x
z<5OUcaef+v9rw2`7W+##Lk%KXa`Y9eYHOPUm~^AE16^Dq(z8#q*qMCrR=blAsv@>s
z4clH8U{@RWwghcc;@8U%BP_m2z5>aj;*~gyXjw|qQa@(6_DhNr;%DLn+SuDWJOPLu
zSLwe}YnT=yu7YjqLHP~l&ffa5C2oGJRDg}dRdiaMxhia`W?S&QTeg!sQ~GI6Uxf*t
zYa7|z&Q$Ms;G<(Sif15_f8#wwdCu|`L{N36eQ06>sZNmwn-3q^se(rWZ>-+{k18v5
zDhu&VZ>7THSdFdD2#(ENK!9Fq6n2=W=eVmC>ZD>L3fA_pd(DH)B<$shllDM5NTEf}
zn7ltUq_=YT!-~cPa@y)oN0KK7FZ~W)Yrs=sN~DoTu`hgY${F&S6RpX$3UuJ<jTK)>
zWn`s1rU}O6ZX^M-DsXMj`f#)t`F}pPp$KnJ3qw!|b}L41TB+13c1J*VfEu@JP9h|S
zNSRD^>E8>6Wn|H=yYBc^nS~y%@bFevFm?fx=&V#W@c+trQ`7y-oMO(y!yo=!AJ^MY
z@n^RD?{^0`-~~L#|M$^W?NM6(-+a7zEB}9q4~EC@?77mvS0Cv=@LC1I0|h>kT>)H}
zU*T%hJ&&VNG)>q?XVvrV-^PBDpykl>r$E&~N@pp#`bD$`n;W(7y!z1p9R`FO2Kf0=
zw@OaFAcgsT)E=P9zj~`AxK$F|DhY0t1h-0pTP4A#C<(@sb7Y@g`F}bBV$x&ze;qJZ
zBHqphQO6%pK>_8eXz}x>SZ83B+dS3Ik!0d*PvqS;Ua4)4v22H`q>_@@;V!QpH-0?)
zq2UqQm^+!0bzMa7f&O;8m{f?f0nk(|Nef&2CFOgH?#zRLE#2F)(QaTdA3=T8+ZjZO
z)JJ47H@~}dyyKEWGs)cPbPuz7l2WGB#VdmznED(O@(iw2!sQ-xkDZBF|1rJmSTZxa
z>0FjbQn0M)Tv?3B>D^CsIkvyn=BIU4=C}w>NJnzK@-!;eD=XY=B}Wm~3MQr@fK|GO
zt?>r~rLI`|MRcTH?xl#_0X|iAvm**eG2q3L#2b+demTR^B|6;)C-x5eR|YwNr9pg>
zwo<wT*c$s>Q3xP%LGq5$Y`#YE5th`(rR`7;y^<zn`m`wpConM=bCsOB(G09fpW_)s
zGj)LKrzfvp?H#^=dpdiHK%NQDkO{R9j!Fh0CzW`=;KM|pr#cMEC;BgWs1~BApGLW|
zR4a1^>J~CFamKFcoLWS>l8aEBNTlN3Eu!R~bbu6#fckG>McVkUq-EC`uarukGtR^C
zx@fV3SM}D<2RjNa^h!9O{ZB*#k|V<3gSM&xl_j@oblljsgzCHG^;Ix=F^IbFgC1|+
z5u8%k%Uw9AmRSPR>Q6+qPGXeX2@i8Li7}~$H5Tlxb}q}+faaqQK-XXp4p-4dt{7v?
ze@WHp_|#@pvdf=_=IFv70G+`}u+SK5orrrLK9RzsN*ALxKM4<|lRq01mjuHxXAL78
zS`VggfFc-3>EkK&P9k3cHaXxBNL90U7qS|J$1_ZG3*B7i9HcoJSrX%;b;0pUUci=~
z#aPHTrAeclIOqO&3?e^Ptu>QhHQP#J$-Z(F^>EvCJqZ3~b%MXaS;T)b6LgNXx7z7K
zLwe!u#=A^on^5R>wQM`KHPYie?(THd!BK@x?{q8JpNk-zWGv_Q=Itb5GReQaN2Kgr
z^zNo!KF8IKM2s@Fe1+Me^AP_H%>Aq$hm$M89k%VVq}fKK?=7@lcAqaSz|w@>i>Q(z
z2$k$fs5rNw?8}`zjLKS0B}W^!TP^Ec*9xKFl}^|GiJ}a$d_02|v#B^o#}uU15LVFY
zN(!<`s2PTwGg9GUDJRfIkxW^~g3|;?K+OduMf+Y@gZl)ya?DnRW(QRI;`qk(ceV-b
z)*O31bFAMT{E5a`G@{}5Oe|Aup{QM1`E(QPauY+1k2A9(70{QS8s2y!shjD|mZ>T$
zqi7A^`|>j-`&VkBg%`*T&hvkx%43$Mb0&fOv#qKBexE}7{~4O8y4ASz>0`{x|5baO
z@&B*g=KuOKpRYYm4*SHLPWo%#-uc?o8;@ZCJJATP{t2fEm_*|>BnWox2VpU~$WIIE
zcw{>9oKLJ0qNHrIz>W<4_<avcV57a*pH%O_yD}_|$^x2XIaZDDU|gK~qa<lFk?l;X
zXUVivTK{GBm-WA|!<ChN^grJBzpQ%S7d-q0UtRs)d0y?FN8_&~t$6a50$`te7_)_m
zA<Ylo3bn_8b?!464}cM&;4XSH3NF>dx9{keuf3Py2QP_+fnH9<3qEv%F-AtSIiDmV
zgm@32z#7*Fl31i_2CO3E_pd(&Cg~wuVQ4xSREgJYqXGH*(mi}~&yAq|8b~x6kb&Xb
zZ~t`ld#Q}D{?(@2^y{yjmI@vx(|#Z39VV%MqA?|;9aO!>1&F5H-7365Mt1ZPfp3Fe
z*N-XIoAuJYs?!TzW&_!d()Z84`n3$*l-}0Yet&nr^!*dqoL@@6l*`|j*DKyVXOh3v
ze$A{5i$9=d<e$@s;yhWJw%*drw73{tjj@(ZfKC@^NFSZeot^0`JIVF(zyA2}hqv<U
z*Z=zP@z<4)3(c-;&53G@OP1^MG823ID^8~T)?fR*{q8=_hT!$f#-cD9`rSB^I_I%?
zIiQ#f!V)s`&?JbHZWJploH>zSR$(gjwSV{sptgM5So;p9HU~s|;pn}0dc21o8$maa
ztb>I9s8*9B<&_ZCRT5^dWl%1j*8lwBl}nffD1p6N|7G2p5d2yFW$oR4^V2Wu?*MjA
zXV&N5FSWP7Y`!b~vRTeKR^x$BL=R(z*Ls-Olup8Q6w=Wi;ZKFrL<)?X=KX*F&;M(m
z*<hq|EhzwLiIDe+<+m{QNQX@xG&Ha{1daVOlO4_;@mBzlKySZ?=S6ge^}oAcep@QP
zTm5w%1UA?zXTE<&vh?BY-+=^v@2$MWJp@>M{q?{8Ui(;H@t$}ebaS(_nhrjD<_)r%
zQ1!U_TNI9jeBzq#&|-rQZ1Q{0N3WSlMCTP_oK+pGZ#PKI>~}Gb77D~#v`s2rXF8!`
zk<e2om|S9h3g9$-xR`n#)+87~W31AdNiIDw<Dz~8u7WP6)(M~^4f=6JapGKH2!|a3
zLSlX-I4vZV!>fF3_)qdks?t@ayKmE?O7!1~ko>X|Na)vU=L!xfruupI92T3F5~$4`
z8%tna6TETwZN8G$E59VG>nbBopW9R=0S?x>%<cB6(=V;9J&sJ@gbJmV(h3H+OS)ld
z<<aGc^k2Or+f8ZApUd#cdDxd~b{*Ki_ratsn`6>Oa7(`G@Vj%{W!{3<9AuRN@56K|
zczfR$2*VeenK@zUVx0Dya?PhtqG^H?(?6#tCC{srADMx*=KN9?X2CfU-1$>=3|@tJ
zy;4do%kPiV(<nzd+6|126l6uG&T$k|QRk~+CmLW;Sm>)4OaeG8y^5*_%NL;vizm-G
zn`vW=#h?0DB@h`ZA<uURyR;5hwWb>Dm|U%Uj&0tC?}P(l+t2Xr#yk6O{HKZ(Xazc0
zsjS#kNWeiThFlf(#*P2Af=pT!ZAIhzD^Fodou-2E3w2v?0#~q&5@h+N^yzvbbzv|u
z-h&PWu6m_6igZk3RMK(1U92<)qO26y`<i}LNho@lW2Yj!)eFV}s^Wxx?JFkPE!|L+
zHQ+w2JcBzC8uXt3vhwx6a1tMXS=oNJj=ygIGSaZ2wqJk!wfC#E`ZfKKruHuaz(@5&
z@!){}`~x$?ur_l}FuO~*W=My5hxhEh{9qjoB&cw3`MLM}|9I=jf3G`q#&n|@e)-8-
zz5H^2g%=~o<R~Upqwa!yo`_w5lNMq+59C7o$nI2-H&p{LiYEbWXuF5XYru0abZ{7U
zzpa{_1KWYhXuFvOGG}YlJJ?No61Br#3BQ(ew<`zCfHq|K>CsAzw15t%_s~V*Jc`5L
zkx?6Xy%2p|<D4x~-|j2mn{D_Cw&8!?{<7}913~FuwaVs4@B6iXJ=~~#T%WylAakv|
z*l@pgQ(I}JYC%YX1QK$26SV5#flM+Cj=hIzVB55HMH;Qag<unXCQ3+KsyJ0l_AhMG
z+yC(ujRW><?Os_)k8Ah;SiAps{PCV<S&nIx#PJ{|f)U1;K#|Ax1cOwy3I!>W{b-Fu
z7ofW^Y3Cp&m)4&0qUT|zyKP$J{pIWX-fF43S~i=gX7$|ryX@p3QE%U`$@?TvFZ8mY
zfxum!GwkjmvwP2CcGJ*{r@D+HonXmb$aWL}sqd-sHm-_608#Z?Q-YrYIGIlPZB4_!
zmYWeERRtRE8|8$|wW0_zZ(bDNVHysdMsgsTcI5Apz54teShuSdz^9aMwoaud^5DNN
zFq7f&K5FBHticIziX7k3Q{kWg58d9_znK6&LF3$4&tYTk;n4OkUuS+<zvsM81Fh9;
z@<3CROUT<d8Y813;$ts&+E;)TZ1O@nh&5~VZArvj>z_EqyREzuDhhLeCBKB%s}WGm
z5`F81<d;!uw_i5*8tpbPtoOZ@^=frpbqH()kP9DC@WnJ7^vwNEeAOM6d!XlkeZ(P%
zB_$P0n;-Nd?+>ES;UDVE6>N%uwAzD`5xmT4l3T~&VMxj{+^EQ6*b<GW`qn_0J2&FV
z;f~saue}!IX`;cEyOwr#F+~Wz#2u-L{>rNNR`?MX9}92Evbq}8s`UFWogI2t`dZO-
zwRLOspv(&eVC)hP`$T|Z<Tx!?`lJRC5&+9gmH|)kUR%7g`kCqK9H16G%j|CoS2O%!
zK48-PhsF>Wu>6p5t%`P@Y64P)$YdY>F#E|09p26lv~M4!Pwe2&)_mW7@H0F9lemx1
zod0QabK}9|O#Y|Mty}xgm-wI$mELLP+`Q(5fC6ttPdO}+y$W416g^3VheG{p@@3*Y
zB|Frk+w4%cfuFa5pSOXZw}GFxfuDcH>`-&#Lvw>kGFL9SI#*xp9q#<#c<_@u>R%(4
z1p8YZUWKILTRui)mKQBn^~C>?=N*qRI|yP)`29P^Kr9miL6ETFV}m0<0)hea1!5pd
znYah^GT~DLmnK$#CDSUiOMX`>vj-o7?i3Zmco*yKX4~7UQnKdkemYh{5FjU7A}3ga
zV<i?2mC%tACKb2JKIWE4DO2m2@e;~AG8qKHxMU|6qjML}a=ORkB8{mbr#{OLmI=R@
z5qn{Y2pwL&#B~yX7L7)tXw_-&gfBTj#)r02>AJB-vFuk4T2{;kn<0n|yQGc29GNIo
zK^hzqk%2)~2997POqF7ua7^kr4y2M0G40dtIokX&x~3OZyz}TXxBwn-gsy3bbNDQp
z4$zN2nczrT5b}KQ(!Ub7dfZrlV9!W%`WX<R;T18I=E}-so+R^*{t&Ig#ORZbIZ<Vc
z*fKPTqH$`uwX!LW9iheflK5jb^XAWiWE5HV1R2SZKMCyV*IV_YT=KAMtz$0n%$yQU
zFf0_@i-fuX^NX$%E0vWO?%sbhcEI<Q<#jF5B^@0ZK=Li@@l`bSl5^U+?jZ0-(=q-O
zOGT=6CAsoephH9iymV(ER<~6G@r;uKAV*&$4xmnN`(-#7IQ=;0Vhvg=qDc<GGdkqk
z-m?kcPTMG%zt9#TRbp8XqrxsHu`aVr=;PKksOrm7%qNOIPE^Q`!W;w`qeDVR;}U=5
zh%<D55$^*gW~i1Yk8^RsApmfP)m&cX^Mq1uEfz|ZLyprw%H#_|0eDI$k>*KMIqJJi
zlyNSuZ~F2vq$?OH6iOH=?Q<$fXt7CQv2$6>mzmbhhNz_(+)9>XtK{%16}99P5x7J{
z9a3udf|BeAhTJFNs4Hm^L?dP&VOEu)I*4x<{OZercdwMxec}|1UDfxZoH;Iy{2Td-
zL`bVH=?vmo0+FPu$|0qKDGdEp$sX|5E+EhrJPx3H<>3Y}0dnYDEHmu@-3X(AtIJ~a
zvJebl$RZ642^13%$9pXhOuwnBz$fktPjok$mLM_mEq`%opSu2e%QR4225p(p!))Xs
z2Odh>6qBZ?g+76KF@_Xkn9EsKh>iP<5r*>v4DG%O;tM|y>-|IH=a$U@J`t366v?_+
zr=&|lW85@`yEvdjGK#$3bUfh1BiIpDC@k@Mm<ep{)DOy}Iqio7xR3%1Dg7R~BP4hz
zeSHA~DVto;4M*HT2fb~=3#>>+XOZp7{^*KjsbmsQ0Sb7;)y(NRkQDAMroOB&OPL6x
zxSqWiPJ&^Q7Dax5^~{t+=FrkS(L~*<S&^IvYWe+Ohohej%9*RMJB^blHV&AQFM_y?
zK`^qSvT|{=jxLFWn>M-~9kx!64i6f;ZPfq$+}>*($iP4)^AAR5vU_+&%#EI2HQ*_0
zRaTiHN(IQlW15xY<hg>_1N`P-rD7G{VhH39lbzP-XkaEbXJ*~Ft-$NdBRx}UPLOOc
z%9UtMm5sS;hY{$ET(AFH!4ectmX7mIM`-K5OM0aRV9anYN#*X$7p&X~xQ&TDQ$bNW
zVLAIwGuk6p=aRt38iewQOAl5maq29SO}rTJ0Z=a&=!*efCRF(?Rp>AGa9QvL7{HLJ
zm((G(%VmBn1gGhZ-qX3vSkNp9rqbn=RUFWZz>m;k6mVfuY6?Y}ys|VXUr&@#OdObs
zu0?qv=+5C{Hq=0gUUVXq?m_ZDAaU=Y9zv`w`c}Im+=&W;KT#d@C}9?vxH$IS=c{rp
z9Ia8IOcpKS+QNVXJuvr2j8`0}S?JNl{G;63g!w^VPrTC3rank>6Je}6fy_<Pe`qO-
zZjmpUYRVSEYS+(aVR%!eAR;+a^B0!tg5oj={>0FajPm>m{HnQ1BkL-8UU>V<fcR1X
z<h_l16|(3lmem&tT6L(|{-Eol9r!Z1HyB9XG|eg{fWRt;2=0yF?M|ssd7%2sW8jw+
zhlsN@|JnF!^Ycsc@blT}6n9iX{n1~Xm%h!_v23mmLXtl*TSrwUphqfDTzz6TjHRYT
z$rMsE$`JXRNY8PbSm8hIQ|SL!Jqst{8C;CPCyz0w{v-UA$^WobdwA>r_a#27)g-#J
zTKy2+9`XOk&ustS^C<ds_uqNv|MAv?bp7AQ4<6svfBhmK;8I(}GJ3eziCqZhOFHp>
zck9G^>%@EO#Cz++d+Wq|>%{w4bmE;`;#HJ*tn}rQ2{{E{S@p%~>$Smto<;^!X-zyJ
zuDX6gGVM5}Vec&FcbWG%$kEL6TAHJN1e3uyejLOtFDuLaCgFPUWHu4K-q+s@22*(Q
z<eMJWo;AK%Fzd8x0!{{<@b(T+68r}!$E!vgF!KP;X=AtSeeYW6jN1n07Fux}Iqb0<
zyS>=)!nN(NSHXY$UN5FEm=A@$P6?X*!8AGVb^f|L^Aab>8`F0;29-&(0Q_?AwDo%T
zMZ0wZ)Yqwq3orHo6ur)9Iz)ZyT5T~C7pb*#3{FL+)|K5Ct>!-(l(NNr%~+dZ3T&^;
zH<dL<li)0f9Rrp6=)%XmP{B*M*tK!xn;t820V_&?qdjd1+I>-WFjajtSSo5_GpusO
zCN%tHN&;o3j5i$5Stj|*$cEF$JGtE~uzL#u2G|-Jv7$S>=HyjJ*{R<u#jmXtN7?K%
z=)@fh{IrvFf%gqgA{GdVwz)nMY0B5$v97a9?&X%30{A*35#if?QAv~NRNTa^;(E!?
zZ2iw=6c2izIsW?*{wEXv{owJf{^v`4RQxyXv>pHL^@B^L2}+bpACpr%Ym4Y8P+K6b
zf0_uR3o8;$^kij|cm$n=3D>5<JUV{zUdM``Sl+h1C}98D9_Amt!mLhbNd5a$%*?}C
zZK===O;Qa=z8Tn+o;3>Iy+9a2+a-^@Yn5m1ZLs>Sp6gc6b*tyP)pOnIx&CT;t}m*>
zVyDR#qI(17Eq@q^*B!g#ClhnItMD-G1y7_1<h0*}s_T@8rW#}t3@8i*<ZTaYF{OO)
zCG%-WE|QYs97!h8F?PIEAq7*+(LA|~aQG;m_*k$Dm=V;sB~LJosz`_ZVA4G=o&`si
zGRbw=gFvV_OEeTmhsm!<`5;OTpYGx@(EOD5C5LJMWlDXfrLX*m`cz~<OJKCyAtlv3
zA<H1o(P`^-^`L$NqA8Xe*4UAF$M{GhU4i>z+<+_68w3}@z^NTU(S|B$6On8M6Zfr<
zx~2lx)qDFzcofqO3Xi0^@d%hgQtfmo7Gn$oBc<S0Qz7lZC>pH=AK)&<N8B^bEkcf9
za<1;BpQ9<dd-g-Zh%hk$ljwl!#nJTaoUx(r1LFI<E)JC8HB$*)E5KeO$`Q=#0H%I%
zL&$RH+7XdyB>5q@@>T&RDK*?7>;gO@gi#@nMq;<H;<!=Y{los@%`w~>c`o34umK2%
z5{%|(H};yXllDoyxmS@mMz>rkW{9WY6T7n?{lPR4-*f0M2l=T4I4&XoasJuhv6ego
zJ9v?&(O(A>dFQ}W0x4k>_Q$|k`Q7u13gqU%UFP3(#w`gr2M!KoHFE3KEFo?c1tFSa
zap_-GNv5K{WB^g3ff&V})p)*?TdxUlHbkC-zThBAc)WiBk_jc<1w1!n!I@1c{#kd*
ziLbe9tPSmd2#3=la)ZocYHw`J$FEj4CWqm4L>OH?VHc1!dwNg_^jAAOSp~V^%`DA0
zVaG~kB}rEF$#U`DsK~Q;KT|!vn2LJ-DY)Jd*wmsu{6D2XXJVOZ#)TR9UO>@YLS`9g
ztjZ-a$_6GrMLm$0xjShWb$;Un2Y|E$TD5^e4&lWHoBtuWvq0?7@))xK79b6;wodn}
zd%ytOEa4==+~iVi0#i3jU=BxYab+o+2BMr@!RSujd2EUVRLGC)wWx9!+cecoxbA_@
zWJtF&l}QjbuG<Zg#KjN1lv>jv+$5h3L6)id`l$%AcZ@bw#E`+jpokUVxMBaXR&#G!
z5D|2kr}gt9!F4vesE9iLi-PRtM%T@VtXnvQ(T<~&rQDxAYZFHI@kR+KkG|~bIobo^
z8S`k9uBn$y=wHgbfXKcdT>#U3kN&=AI9we@HbGS)p#44R;hu`cIcHu1`?x2)-m7}e
zKAb5E4Dv@ji0Kpg0L=gZc29t3$HB2|0%lf6#j9>>0<Ln77T)JKD<IiN>%k}Rya1)o
z!S?121wdb5sLg9}*yz+5cS)XsVTe6ccGh4x21%PrCM1)@3BGa+kT8prt1+dnMqW9c
zJLHGP&nG`0F`MpWe7{B?js2sOpUZaM``no@z&>pzbNb+!ut7CHq)ZDCvZnmtWZg=}
zTQ>A8Wvx9t-fz8v9X>pGh0}Bsu2_-!cwV38Z)bjXn5}n}yYyCWZWwz*m=-+qHp)f8
zc3%cEbMwzourg0~ZOz**3=UKT1xS_^Ii9^+NI;FovZ{O$)mjAto;rC>;mBpKladb$
zE&DPovVFgXL!OH2PG3e=2)uo7*;nptIoa8*`TIG4FK<ke*u%nyCMBGG9g=N^Wd_m&
z`qN1?1aYzJ4TE761GV!<{#h^--JPx4^V!c!G9o6EX}@1|L)D?zzuGO;#!2ndB5&`p
z+k0%Od+dL~-E*xK{U_fUH*yu+fI<jF(A_HK`cYX6$zG@xK0ujOVILOHNruphNR+ff
zsxxbBOsYPi%7W<RIZR3P$MB4V!_P*~7Zm7co|^fGrZ(fy*k{HZnHxDPiWr|nR(45L
ztk70T=Fn7r%v1)bvUo%UQZI8A)j4c=Tj6oodWV?6Kl4bY5VC!XD_l{1QIZrTeA-%`
z+_ZT)$*CBqPqXBpyueA|WV(wS2Biu0Rf03inuLiq8PVAfr|P|sj3ct3m9JLBQHPc2
z;x>~}`jiQhY}-T|Y4c#`80%)4-r0S~s}Crr8XP(04%OIseTefj4au%B@}{HU!<fyc
zAlP#~;ZpZJ!1O4qs#sm(CN^~y`Q_A!gb`{ts$RQEBWXUDr8W?gL6Y&$Kxx(QPl9;W
zfjP&55MU~tcE(0mt)bQ%?w$L(#`UNhNLom3Otf06ev%2?6hk#1m3&1#-9OzsX{tYH
zLj5Rm{_gm(`kQvXYqx0p)Yy^l`A3MBE>r{FUa72f;eXJBO)^fk#@0e#$|s|t=OhcH
zDwb*r3fpy#Buw^0u5H7BEnGQMGm1}KBhKn8Gp)rM16)?}nD6}Kuha0%Jo@z!lQrwa
zlNX|M;#Hbz&Q2|4RlE76VgF+gci_b#pb_*o4B(tzB3wptLpu3=RlcZk9F6@mLRy@{
zz(*b4x>rAZY1?PQ2^I&Y;Z1UFphdCcuBkfrk&q<zWsW9Fz9rbjM2s`~2A}xvQEn5>
zKHE3DvC<xjIY3kN64`W!^*@LCvS|P=daU*cC*uN{m@>|?R*_9mNS929wt+$QNIfKy
zm`PT2nt;goMDZ()qrFY<8BT8vn4;|r?Ybe`(e*irxipJUUocBJ&O1M!*Y=-gbCf_c
zPa;~DkC`jQIBYTO@}k}ZhIvEOGRZHoh(|=Re-1Kh2s2Y5BOzNcPr@jWDHahZ%pBol
zxN^o!786FT+=W+iB{KNk7=iEuKiGK%5ghlQyCdeTY!qDP7;sW~BOUUJ6PhCo6-z=q
zT%kRuz*3`wpJtQYY~_;KOrK+jWV)DmyZd!*gygF3J}ElTMb{5UoLrV06Vr$3<<8Cq
zl6zN`PN0~n?zxZU+u@SoI@iE$6Sq7akMZL1*_&5v>3kbu$pSyd`qw5m?<|U8hhfo8
zrB+nxi=S}<lwBeLF8nwQCRb(EHIvqp!&k5N8r7Y8t3eC3DeDO>Z3kxhS0k^VnJkV-
zyG1oe-2rR@X(UC}wt!-yo9n?VTZ=U31y&d>V)yvm<_vpv&u6X9rl3Z>QBf9V{NQ=W
zCaGmyfn!Hx<1W5br0c{_+EfkgbJM`$#KVM+S}A$^+q-hQ0ZkMhU}czy&L+2WBT92a
zEuB}bAyTj2ald`c@(7Fizhz4e9sZEVK3|(AGAY<UJZ@AQKOHrXnG_5`kO`%lg(4cw
zzIJg#`N$t&4#q1|J|s!h4T+OIIoYcKDVhWn{5e5ZaK-Lyg<XoR-n~Plf0yt#W);^?
zq?9T&h%qQ6?KQL?#X;l4IE-)DxA%rvxa+zf4HL|g3a7{K^)Nappd~I<`2vef(A#;8
z!>1^qcrKL2HBTP<Y&01g%GjBt>5Kv?dMu4ot3NnwGjiLcK$-%pL?FxOY+Cj>6@Dc*
z?dURx*FJgwXr1npTM!*A3OG-?7?Xx42*0q<NrU9bQPd<c0$L}STn50pSREl7tU5D7
zBMGGA=_GsDNNs{Ujjp64-gM?;bSh*@gFND@NFq&BD~toa^y41K2w*=vKP3!eQePA{
z@kyYnHIe2LyOOFvaK5_dRr|pI0~URZvCKDm-h0uM(h%be+qATb`~k~*nmNkL*a?eH
z>n;sx&Z;%`96j>9-nMjaF!{pM|49a$7<V9Lu=!Fn;5yRkKU$5G<?HG!!y?%j1Ss0}
zja-&~)F~*>@Q);zybR-H(j2w0EulHl8XGV5&QexcTRHw!x-;saG3p(oAQJQlLN*la
ziOrM`v%;b7euqPNlz$&_Z`9$k{t@`Gpa-P5cwT1s158eD$bMFs)Gb>R7S!{!G}vg*
zzXd$v=7NAfih~OW@YjQUiuYZ_DzrI^M;1Cr3ImNy%f8TA!XLEplew{n;ix?bK44@8
z{|kQuM@WCezZnfJTW`ql6j1^k)TAdEh2F!Ea|s}E1DEk$enOG)6oBq%WKj*vo9As*
zxlO}%6dn6OU65l~d4_?<+fSasthQGwBu*)v!AgBJ@}E51T&Y^j0Zo@I8nIio!J0Tb
zAM5B806^G{&SHOjj{4vMMSUrj#3`uAw~1FWe&h)TOXEs?3f}q$f%wJG0PHgJ89iL9
zMC~AiRlf@2*g~M5awG~q+&uSi6VgJ4$9VJ?Q;Ga_uio^mtb0^#H<3rhY6+8cGo|-t
zaYUhFX&qnvIpl4zicJ4T7mpEvif*5Uuc<{?0Q@MRD^>VnY(ehCbE@a4-WLmHT;LLU
zjd=xF=8L;P5eMX1M_=qnEixZk`f6=OM3M{ZVde9=pPYMcCswc)QC2d|k-A%kqZk7-
zwo3Fuk+^A144EsnGRBo5X*w#VsD=lVt)1g5SE?-Ov1o{-%!+SR{9tbz?Cp>jCH5MV
zxBT^q_ksfA7p2`;FK|&+_AIsZ>w4?8t;Jqig?;lk0BqB%fKBTWAQht)VR@c0RUrg4
z)rK*9GOytTL3bGg7B0Mf0OVNTBzL(ByX+N0kAE%l$;a+n^ScKrKHK}E#xi~rcO_eq
zYc@Ok^5m$#i>58|OXLV5%T|_(0~RN!aMZ_&*omj!SMEj?B2JV$0F^!B{Q$2AF=?)l
zpd{141Wk{|L!EUXxk`YgL>748kGtoTsYwwWH4wRNokda4w&F=ZH^a$EjK!`K*uly;
ziU!EWMqSMNv{I2mO{9~O)o|%>)hJMhA0~7~^{t3#ky&jV=+sW*I6|ii_VlWc@gDXr
zgN{mf=n%|NHyBS+<u#vpx>&7@$5q*NkhnD?8XN1Fsk&)W>x$}<$IKwZw*PY)D2EQ^
zsg1t&sJFYqHDZML9r1ut*>T-Unv*PjuX-)1oeQ%gGbRO<6R@!}eT%4Ac1bFgEhCEr
zmKVecBf^Qg?Kqd@Kc`{LUEr*F7=}zI=%cWsy-TXz8?J%P_^NHOa{2M(D2O@Z8F>Wg
zz-4L6D)wEWL=?ZrXxH~B$Z-o2Wu{z1+*}S+gf%@yU6fl7F7Q=gykn}b@_6=4EFhvW
z+K<D*m4b+8ZY$$R<aaT3MOx<RPmcWFU+&h#evDVd*zchg@7i~%es4kB2#+_{&z+m4
zW2~;BG962yTMn>x>y<fCy%nIk1POcsCmJJ5*=9P4bFHRFlNh*D?ThT)b%I*$9)O6>
z>tG8zpb1$1f@1Cyud&b={08ujQ(qqcRyJRgbBN)#>U1(mf<fOglu0D;_H$M0vn+eG
z5ZEoDK_Fo*;7EY4$RE1;j?M;w<(;8?C&UNXz37~I5_Gt#;*tpAScVBZ#<M17yKJgb
z>EwDmjXn4JVigYlJ~@x0%Qc@|NHkH^(`SHsYtIGO1VsorI@5j%I}9bl$@9DS9poZA
zyg9>`MP80G8|9&EHk1Pf@{2$by5p-7Jh;y-F%sKEW6v;x(>A}D_TdhpX+amcQ~Qsr
z0XQdHG365d4C#t7C@^9UL1kVX!<iZe0FZ?0QWDjJ1u8~D0aS33a0nM;VGph=<Iv&I
z!nuU(w|6$<Ovo>}vH2C6l1kxNKYsP&+i!Y^qTeK#aNGN>;w7`yOofF3nS!KC1LkBP
ztE?auMF#HEiv%t_J50P)9Z`m>^b`wnUsYBxLnJ0`9bK(O(GZac{_l%T7Fnjesb&%l
z{S_v<Sv1qlzsgkclvb1JunM#?J=uaJD>kBj;dxTfZ|*d+2`ln|y7|Q?TSdONc*dCk
zX4CS|n?43hRY|Xzo_Kzc-k(CbFfgE&nO`PkNwDAxPb_opv+)ReVqfeCu~TvtW#IJm
z3Y>bs{2Yhqip0)T={XiS_kH;}{to1l4LqqC=6fUkIpi|<kUPa(i|3y*!*etQq^Flv
z=>M5lW6+;~ERh9aR)K<roj-M6g(6Cf1Lf6!*!SND{c!N<)qm&K|J;1^;8D8%!^Xyg
z+xib*;&bO~mD@J(4qJDo=&jLic~72ue=jA7s$O#Lt#!S7^u$|Byv^<PUU0EKn!>X`
z{_ukCIRz2lE8l^>0A<I3G+uw;pCu%34Z_j%gSYNQ$%i{(KlrCt`g=)6DOdLJVfoJg
z)p~vS;=kHEFZb%NTHg21y|p*+|EM=z>yM%}DHpMJ2LFH7>%b%?z31KUzVp@&H`Tj)
zyXNHt<hG!92Oa5Wb=|vyX@uSDjRDxu!%7+O50#?pdD2~b5Jm5&<2%8q7xwSmskTmE
zzHI)~Xg%?&U9Xx%UiAa~FS>IF=J3R`s;s~x`iru3t3Rk1z5c5^n4<7+no^Ae^;a+K
zPV^sCxmW$+cL!MJ`A)S9gFm_RfBn6*vs3ognpN0jhD;g0*^q*#{iEg%?)=}Md25mP
z_y7CO9c!}Cjh9YI?leduXK^1Q9CdHE%za^}YCwT1&S0<k0!JQnr7Hr(jG+WnPdvNz
zbp~QE&lpMV!xPVGzsy+U$vNJH)~ISbXN+rh{E3%(=UM<Igqa0V!Kf#m)BZYR5jxHo
zO3?L*XScr2K!oZu29l%j#IsvpXCORAGsfXl_QbQ=E;&kf5cnfFpYhOJi~AmyW%sB+
z`{$$oh4;VNmCs!NySBNx^*B@i`{C{V|3yBk{uAyr)qQe;RF!=kpJJJY_(~G=rz<vD
zna+LhA{zJ;<O1FYS8MD6M6RZ&?VdzqG3Arx*7OT<89R7NvH@Eoo_z5-P2b+uX}Yb`
zbX%wCwocP+ou=D5P5*xN$T9O29A--swTt)r>JPzHGWNR|-m4t(b^*}UR^!BbMtN?Y
z(S5xwr@bYvjwXNteMZIDY<@KUk7!)&4ts6r@FtTsEEv#?uh|W7(dhrEmR(RE0YLF4
z(9UD;gJ7KFI_6o7Oi%e2qGP4)Q0x(r$K**AQ>wk+F14>%#wja5yB1!y;%0)T<<x|i
zivIPo;lH%!uhgDv4n;@%YOn3g-cy+u%)K-iNP@ml$LCXe5~<tCIuQpYUfnE8ERk?A
zX8_J-lg5=-dAO4DxTQB$rq0FOv<{}6WK0?P(<vSn^fmHKCY+C%-Ta~PGe?I#qYy$q
z%fK7(7oBp`+Gt<1MHKpM%3x)}sod~x*=dRIhQF$qGX`xd?3|^F5pa+e@)`kis17!$
z`TkismB~{pPE_)_DR(<9@EBY=QRnRJwx8tPmzTj76D0@1dsRdwM!6-AvLKQ-(S2wY
zTjiX9ro7z3oi6EV>O<kJY(HN?$s_Idc5L#3a>XY>DZ&Ch751nBoOx<HBf{U>LCnCM
z$cqYR!XbV@!aRwQc&ZeiBKmMa7iha^y3b`IpGw&<34|2J0_~I#jFr2*0HzdW?Fw&g
zGa`*%&-QaqP$QM-H;r023@X&&4DmoK&z`U7t6-)v2tPB@2p9XfA&uwdIB9-(>cv4$
zMFC9eO$$?YP{}nN=WdmYg3*|k{h#V(_bCZY7je@=<;!RA(p%I7%KG16VwpgNbIdo(
zehL2yn$uZkPOorIt{MA_%?1u*+SqR2pEo%#Je*uX6Wx2y22lri9iyVFD$ignh>2m?
z*a}$&;suCjG?ZT57`d7L@R*l`ubO?f|7`W>|N75t{lBs{eVPeizW)EAtN-8J*sN{b
z>i@sQN9q5`OzX*hlOezx!{xL-CiYi;#<(`I4%}+vZ?*Ba+W1>-{H-?rRvUk-ji0TJ
zSM%9#Q9^<C5yGOD{rM1n-ZXkWfNTqPvx?0T!9~zKf^Pl6K*WWc4YmDLiPKSx0WI8N
z#$g`=iqAOp6{)jrNK{JGQ4*e^3mvM5R?91|0}y7mZb;Xyph$JK1cVqO@t1_3s%}3W
zj^M6O?3l^bu$PWRdlgIszz5hGS4B{`tKPTN*7WvrYHLgXD8q27mJ!Mdz2cONc?!4G
zj3^LKl>|1iczWIGcsv9&x`*Uzvs^edNBxM#ge9xcJpRvJ>>?eiH)rCT^O|NfXfmw3
z*Sn2&bJtQW7Ix?4*1-7|rsJSm#Odva!52}N?I<f0Zp4sJr%RsTq)??qq&CMvHvrBh
z&OaVbtR$TIAZ~}fiZ_Kl`?k%AU{oXLpnI!h{|X}`x$V{_XYkGo``?QskuCF)E0q<R
zBj=9!rdNhl?lhV|!Yx6()i>4E<cW6=|G8(WO=u<s+fp$z#{khXg_X<vatw<L(YC`p
z+IDyzezj70Fsl@eC$(ritf%9xpct04W8Q<Fp>DJH5C*TBO^p7Un|Sy|H}O_ed|gek
z$p3$$vREmi#?1U!2r+{l`ZGcY)kIOqwPsnwaopq-0l9a>1TSa7J9TSgJVcLESYl3{
zUI@g5<nF4}GXqgJpu9kM`zkL6RppF2#7sa`q(mC3>hA0l0H**(pvv)LnWNNj$sn3k
zRd;$Md`#q9(X4YHLn-3SfVzkdrm7H$SoMabMSQ9*e}K6=(MWw2O}$<uDU8%9RaHr}
z_>UPxDcO_i31927)|(PCi9;)lPdQE}(ZnCH7e_Qy$&cQPa$EHQI~k6r12+MNdtWFH
z<s}BjWNeVaq_)v19Mi_*GZaNpinDF3LTpg+E>Pnjn_k!_Z<UD#D$>a!=MwJ4y}$JJ
zfKzkWbDIOmO<lNncX%V(chNjn<<C}*{s(+!>;Flt{mlOVTY3Kf4{Nvn|6k;zIifJ_
z#Xkxz6*1%-9#nymb1+I>z!j3P@obwE&eRBq?X(Mr+UgQ{CkhTQ`RABM!-GLMdQbn5
zVi<dR^uX(2ayEGH42WFCss75zr=wvoIp;(#oU{&z_`qX3Mlgz|XXjKQo_v)iCf75D
zG*PV>yjuo(Dp)29nMc5e5vF64>Wr!|Dn~tVg0>3%$^bGTLEk>QMtYq7P8C8VOLoUk
zC^y;UJnB(eQzY8QyDwC-nhMPALfz0<iZKrGMN}YtNjuA<TRY3Go#ocfa%*R~wX@vX
zSr)Lfd@&P>+uLYT5afXArM*>7Is;!h%Het8$7^DC;1N1GxlBvZJ9dU*PLZBsUDA9D
zI{wF2*$kvX;Rx=?i7Mf~HXis=>pPs>OB72)rK~tL?<fLkd%TWmzpU)&m=l(!z}-=r
zSSc6JNo|=0(u@pw24^xVJ1k7%+`0aH=B=nmDHiP-1Rpp9Im5}*U`Fk;^2Q!b9zAGJ
z*cnWGeDhkbj(`CJ3GZpPw?irvE&b)cd>;5c$AOsAKf+cYOots#_iP~E>xt+2jKNl!
zb4&ePLfvV(U?%F#h$j-IOf#Iz5~mmSORG^?B;9Cj8z=9vAx8h^6m1Y`I3k55sc-e5
zP1@^H;an<u1F)FEOc>$@z?d?j3Kix>?GJn#$H9f3q2&louiU-s;lFF!93%3~9tl74
zGVibYQ3m4|%_FvH$iOoJC~XuN<xe$<=QxSf6KhCg1jEUtCu=pOR|{e^%+9&(tSv<E
z=**TK!_@plVN~JH&EBl;G_I&KgRS6ivv;<yIy|t~Co6+rZLp^`IA}<sH_c-nAiYzW
zmm;lIFQ&08T9L3KvZK<H7rlWrMp<uBwyZYc{)bBt{qT9iosz-&T>Ry-PHVjTv@o`R
zk6H~>f59%+V0UM(=U2hRspF&f@bi~$aLS^q>uHHJ-t<;pJkKWv^iaP~oV?6rUvqhh
zY{ZZFYGav};dr9XM#Ln=gyoTDf(z*kuDGez3m4I&^GTH2^@3W=Ty?`*KfH+)C-*)r
zuzefkXa$oWaS>FoLcd*sK8r%<c(_7T)4gSY$0UPgPhf(CU(kR_U%4<&h4(+l7!2Fx
z58%YqlVeO(o|hPWzO5fdpj+g|t1J@<HI?J~SguMU-qLjR-=tpI|K^f6|4w9-P^q$f
za3m5_diNUDXBQ8%w0mNtf97pq#yZA*tg~<}Sn1~YaR@n&62&rt$xWW3-7~1}GQ_Na
zv1eWy`}*D^qC$M@6HDT_k>E&!2HCoEA}`=fKwcndtgRIlDat2@7JomZ+8Taj!G`T$
zHbya3WNkr;3XmXrnx>)Ygw}sa3VOZZ`CAHlGZgfO&i_I@g(3oYKA(6Si{N;HSk^FU
z!F-PrAhL~xOEt}s<Ty6GYx}EZ-Zuy91;;hA=AL{)&H_?NiP2G)IYLal47e*)_d~aA
z1?*it!3Qd#NB2CyB2#_%jk_6<sSs^{Xslw_tw9Kfr6L|OI9<3vphG0@ezzNu|IFaZ
zt#<SRM`qCf=^k7;Ljioq*phJ?e!&pip*0iBD#!O)M_z`hq)+-ypKJcJh(EZ-!FJra
zveh&T&I$QjS%;Zq2~(9!1TN*n#2AMDIton{rVRpA_p&b*RxHNPs;;>c#o<|qnrU@D
zQo38{dg#9o_>icCeQe6kP5dyUT<9$BUy*eDPj{_moG8O#5KSjbp6Q&!BOU#j$7ddm
z&jcB)9CMjFawX`&?2S+EQ5;^NOins=bQ&XY*g(p_M1W<SbuH+il5H2d$_Ed%ULC`b
zINVH7<flg>9iDza%i_Gqml`Ls`D<&YT%+0iiy#gYvM#7Pf82{UUAVp+#>*li<hPtH
z?5Pqwm|z_u<w;8AYKHZCar5%4%``o{UJ|NLsabc+e0`1rt|sx1LS?D$7+fH05nqwz
zE6T73UUD_+p2L1e(`0Z}Q8YUdr_)O;E_vx+C0-w0Wa_Q@5&DzEOB4Tt7vOA@oZLb(
zhh+rl2O##!Yd4Z#s92;`0MfE-jv5m9DOkDz7V}RItiHF4+Rd-xn_a+imy|ofLzSOR
z?pz{Ol#7<{YrQ8fLCrNt)iySAj(C<j;hfSuVkLX;RdR@ZMPN>Ax{o<MED~M7l+0t^
z^DQyrk2cc~!!R-6?{(4v3(Z4sHSTqob_Sy^`t@4WlYhbe-mv#|-KFms9I|rhQ)$(e
z$_n7ry$LzT@l{IhMbHiU<apooRw`<sr?PbxT#TNBRRB}VCdxM9=c%Fn-l@d2lwctR
z+7(wwo2lSt^@keH)qGf!$(cthJq!Hg>7q@s`j0kFklsFPgY0!${zZ_xX}rH;+L&$X
z=9SMk?P~>;ZJ%_A8cfE9cv|;u)JH`+BkaMzsz6y(s2Iuss2=r?$>A~sBR}frvI`XU
z@TFikA0CZiIH@1LEa7xl(uPwwPsw0~GJ7o#sCD-0J&QmVq1X;PdI}34M+)~iAscas
zm{X8>8j6|fTq#yiFV{*LDn1<g5%5Z<98pK%W;sCS2cHGhvKHlcfR-okzW$T8U{zsj
z&PgMVI%mcO?f_~dGX3m^XCPqM$jHBVtHa)33GaAT^<Gc&CosPyku1N@#;DgqF>BNf
zpwHXry-$eVqZ|L`L-$gCcl*LjOop(_23xA?)^@vRjZWj__2F(CCemsi9vCjP3N*b<
zm;ZAw&3U9+B^V0uJag4qt$-x9*_+;JXh^=*7Km1RO5sz_v-HSnN0rx~yT{&o+~c$Q
zJbj)S;RSq#6y|0~1FnZ8r1Um!0OvongfXid72SU$ag5}R$-ae|dVcvHH-BC+HJWQ~
zMY?>6;m;^ZM{~?6gPLbD`qSpuDFkAUYUL(pc^d)vXMHm9f0K3++(6AA`!h5CueMox
zxVf2%|9c4kcN_orB|hu9kzgC&t!={2+=heQhJ)RPgWZOM-G+nRhJ!5=4kjY=`3lPH
zHyyc5MQMZw#aQZ_>|SfUlj#V~`)=6pzY0b`K)RY^W=qg&x8lW7=Qj}QfnDOd87SAo
zAEW8eHK=4i{AMqikQx!+i^gS+R(t7pCu9sHaoSR^`IK^-uC>*!KU($9qe0JGAvMcN
z)qA77V#NRZ+)ublhw>j^3r28}kzWG6Q;}!btIE8>Lt(s>v6)~coU`e`kFh&S>oVcQ
zD*!8AN5aNDmMlt1FYz4J6lI@FTD{~r5IqgPUr)5kh^ND{D@YJKXu?X14Xkf((sW&A
zyVIa$KV^+kz1PdDR>WE!0;;0w&AwIq<`R>^49J-Xb(s=YMjZu{3f`<--U9BIXvB=m
z2K>cZC5EC^87S>%PBwFlOrsZT?6;&~FN!7sE6l$naGuiADqaS}#+Wz&c5Ps^1M<q+
zHf=sm7yyj*M}c4*BK>H;KCyLsR0VSN9Ca7^)$t^L>NIG;b$kWri<%4k8)kUyUzW}%
z6>BHWD>x5VgQz-!-9pnfyx0pWu&Ca2EGkj!b*u4@{y-Y1hOqFUW`1SWqJ#`A1`VL&
zt%d`U1+n)o0p8$mYPBklS~BG%O4?IaeQapMQ$Clt_4b1b4N|!)y`%uZE957s;qil(
z+Gun^K@X8S(?nCWL!D3q<hOv$O|nF66<$ThqtO*`T)>lA8HSw2uttCAe`rfH#3#NJ
zV1PD0;IY*6r+L#Iguv9}WNWX~a9(dJsiA15p~UazPXhsB&tdzyS9|tsYonZ+8U2`@
z0qs1Evlon<eJFd|b{FMbYOkmw!(6>zNguxKxLHKT&qssS=@=LR*Gmw@*x~Uk&{0Fo
z^+rNCy159D0p7w>Pfy{5$)mRl)N|FkUs%ov6GeKtNSI8~1;DDO?<oq376OBQLRe8v
z94s&oOU|?r!|DkcN##BF{5Ukm+&EZ33lHs51jWFg$35~#VYjq$I(k2fE=L3gMP^p=
zOtl+yL0N?UI2eKuSJHPX{JRvXr#BX+^hA{bM!Rq$;jJxiBa~!33ot2U!*|ao2SI>T
z5f8ildbvz{mh)hFdOdGRpNm}6t}rQmnm!q7Ihsn#zS$65oKAmfBx@%7#LRp-mO^HN
zIPo$B2AZ&Lwd|Zr6Ip3FZ~PVRZJ9i8G*6$urxw7yeAZ1=8z|MWG~12FKJ}x!tJ*f4
zc{2p${T;I=nh^U`BgKIw;o7!zXLv&M$ZUw0*(3{P!iBK~oAyFsEMEm?WzPMZ#gJJe
zWRU}#hoRxZZfK*D(3tWyQ73!9Sw?m*Y&mHjq#Qmx(>K9RCiXkpDB&k92kl1}x|Av9
z1qg_Z7j-7F0bCd|vBgMHqDuTQN;l&u2`82=tQBI7RDzB2ufhn6PN2CnDj=x~rzT!&
zx8-qa7fg48eMk;A3dCZypU(Rx0K;l~s$?q7NJGgKlc$nYJZ((sNx4=CHk4ouc@UCw
z#}TFK6vgRy97p3g#J|T8%^15vDV7pjV4m{9fWF#cAhPy@h`IqFbs|xC@{2SYy{CFj
z6bFOu3VxD^=m($zR*18=5b*<8j6|uc-5hAzxLL4$y`UeAlJEjk*EuU0MWZ_$K!AaW
z!9bL-T$T%6IlAXujMGoJf^Y1P5$A?sg72s$DLq0QQ0q}dmjE!5dUw}mimSL$d05U@
z%qoM&<SAJd;4XdyQqpQ#80GQplb|~8WliL3*1aoJGo%Ma)1K|Y!gGZNYqia-2M-@T
z{`Nc0Is?2c#u_0ocGdQ1?)3Up3Saq(uNy2(Yms8%W{Ha3zh7Y(mh*0|{1wtIyYSQt
z$RatuJ4BHTIR*_1Xrz5Z7zeWvS&+t8=)=Q)1bvXLMm<1t<w1fej}-Qz*+_mztVLsu
zg@0v_{C4yYN+(p2S>Rkz8v~Sx2nQ3Rs@IAT=$uFx9Z<#I<Eul=^b`8F$c!9o4Dz79
zdI?cppciK-M1z>46-*}?=ehHMQzC=R7EyQzFI~q<s030whi^n`QcArfQSNiSyrs^%
zXXNPNid5Ph>V&Yv!~>XJqMz)m-ahIf@VR`b?{bfda{%(wJuj)(Y{aHuskPb@3oQ)a
zryJy)jwg92P7sfVNT%?AC1)1-y}d5%3B^O9{g%=z==;;b#C<2lA|%r>R%-})vsnav
z@+fx~#u&hRF{*^b`8lCfRT4Hyuf%XqfDErRha}MZNbV)=hiEYA6e+5#Tgz3<qPR)T
zrP70t5+&g&vq25jo+EFC$<7M;%6Hrg8S8(KtUKK5iZYrdMq_L%S8;X}z!@tmVZxWD
zz8?V?csI(OX4w$6Ns~`q)mo`rsXTqOq7+9;iC5`rlou3}GwNv%!44-Vm#Ny(qrzn<
zI4Y7L7EAJ@P#vmgs6^Ha`rpVjq%QwsLe&Q2UXCVXk?VgsHAWr_0GH)UKa6=Yc#G#N
zA-=?gzq|rNk15IpTEyHH+{lH#xSW$(7Tx2zEXY9E0!rwEIv{q}&J|5RQK3NHOaEE5
zLXMbt4Ml>Z0zgf$jF+beD9Tc_1em3^i&E4IjmC>Y+ppA1iV!AnH?i*qke(80^F`4s
zG>;5j#&k#A5neg~J<=DGC6UNMHh-eXhbkUf<SY}dn$i`!XI|Kd8Hxzu6)epyMy62-
zCn}~RJt>S+si<(zV4v(j!`#oJ2hehsgr@UUr#TFiqD4T4grJBy^e#*R%N<i9tCZOa
zNumJS(xp=vF>Q``&~$14eFAqJ;69Q!`MOI4Ka9~l-K$t83tK7c4sa5o`H=-_wbPdY
zWkvV9R{B!9Z8*)CeZeL6=%h``Q%3Rl)_N(Pz$>NMN11`<A5jmuR!ghm6i4%XKEszr
zDQyhsRn%BBbpIc%W1FwT32kU*Q7nx+rfX5k<PvjNwcJ~bk{GU240j?ErRj-@(>@Od
zV>AmXHbE6gK^Gn!i;ky!cPdH8#PdMekThF%HuZruodkjLwbSe;Hx`cplY3voNPg5=
z4x&+DGm3_$DGrUzKG<0t^f?S&=wdD7hyXJeI;7KT>gP}A5F$R2@Q;>*)KP~XRFOU#
zwW17BDrc&xbEyDJJw*WH@-p*5L$BORObaWNHd;=hz}C3cFyZW>j%8nrwnTRn_wfR_
zf21U#ZNpH#z?!HdTaj!v8wSJf_^L#$D)9fQ$Jm7mqZFA{;8*eJ9k*@q`Ql|}uKHP!
zNvWKznY7a0CHOIPJq<I9@X{PnD`Oawp6$j^NF}4W1k$_9C<$K}4+|)y<uF1%D*V>c
zlx-2ZvpAz@X~f~i$#_u}98hE&fPY{Y8B)`$a|?eBqUil}4BYw~irDO~ZTC7A_^(O1
zsE!B8ZX8B~EJQ_}P^AFmmbUDXS0j^0b-kR_aGUSabiCKW4M<N4hj#<hsRSn0zTD*6
zm)y3SEq&S72%&aXb^F^pWpO1ysibHh^@8YU*YJU<D)-5OI_Oc}h)Mzc@Pq!teM}BS
z)vg*BDAgSto-|+nOb2xZw{*o`CH1wo9rhe-5Z8}h7*DRe`_Fl{+yK5(Y`jTZRpCin
zcoPT1CGn<5Ms32J3P$+HWTLe(iPFC2q0?c^`JB4W=AHYPlfC<U5J%;*!Vx<a(R@t1
z?xq{_a?ZZH1VEN;C&x>5))JdMtzjemKBKRA1k6AS^>H9u%RcYGS$XgNY`L+da8)M%
zIk6QcI}=;gRLr_uo%)OcUNsIH$IYF}3M|7JW43$(pS($=4~)RZK2tddM?ug!I=F~=
zXD9B`ZGrBn{KaU6>CwUzmpho(d{Z@N&4v1T>z!en#1T`%FEHm#FACUaDEJU26Kxo`
zSs^vqEd5rX!lP*)WCL&eHuyMW8j6{{B-01-eHEqu>jeogtQ;KyO}Xn;u|se{sGOH&
zA;eQ-9%szRQngp*&=uY(MOuo;kL+Us1>$uHuy9(kYoz7-=hPomyw?8Vj}4X<M$uX{
z&WAF;R|Myjw~0(0wp<+OzIQnn*%tJqed1kblPrBVq6zsjGi8#nj{w)qzPk#096*1S
zBDbjte+oX$AszE+lUgg!&0dUI9i~a?prM2GKWrJW_sypNw6^ROun6hD4hhUM1u6L`
zeSQ+<lp0Rx<fAE$55B!&Sp?Js$mP}aCeCKkHs8t7NhRxC{1URsHeSMNne`ECRx}Oi
zo?|qvq_RXhh=v033F}YMVS+hdRNeEMvRg^|3_j|)Sel-U{(bIxHm}bDZWghCIcEkA
zyM0xK3A@=Z!s->WaG1>U^Kx+34jAfY@n%XOD9<7nymWksV%7qL#a!sifQjad9I;g(
znC#kqCyFO-B2_~;`_UBB5gtUNH9B-CL1TamUlB-H)a3?)V1y=Fs9XEZ)_!CEMdMi6
ztl}UUM<cN)p$>`Mt)sq&Ycd|&IXgH@q{HTzQ+l!8QV>-spEXi+y)|#Md_Arl$Df4)
zzhzKhE*fM|VKzGOxzb3{_2YSxbz~o!=rbIdXx<iBjH-PZQE4PeJV_Oe2_sipM~6p*
zm(NJqx4ps@pGRW-9Z}I|?HOWxz;wFQL<%Hpi!LDJSOKYQnTmme4*FGHbSApw_y$bE
zmUx};?2HO%D=Vxr$Y4P%1dsBlgX`N5$*%<UTz90x=QOd?TCRvDU6g?<Xh4U*&#u1r
za1%VV%GzPKsg$qS;V_~CV*Q9F{B<wrhrlu+u-eG9wOc30^^?Y{pWFMVd)`BZAFy(?
zs_Y;n3-N?~eHpi0TORE|g%<WSml6ZqUIpSPNUB*tAqp0@udTCSazw6!7XhNdOJH1B
z)s{s*tPd~{75!JrG1um)c$DW}$(d*wr>`cokJ)h(Eat}7u2x%9z;QSlPbprUC|pvJ
z2nDPoi>g-A=!S`A;zvD9CC$NNCNxfSlA~~7uXJg>0ufbs=`B1$s`;+$q~(!gw<yhH
zrkFtl#{iFSMY1#cmd^<1r__ceGB2WikC%)-GYMm)D~~YbQ=DU#Qe~GklaUv#b6QJb
z<JSmvl(Ymz8;B!e21T*~sF}`XTHr*?WKq)sxU75oIn5Nr7oPDGRr^9SwDnfQt36Rr
zJaKHQF{ceS-Z^BFIU}NgLZpw$saOc3{8ZdWp<Ol!dzv0SVHesfI~UvKc{B)|_#U%?
zdLd>HVfJqVc1yB42`JNpXR)9Jp2Fx@1yssgNfulHcpJ#m>48<tUdCf_L(^2?fw^?y
z2#ByF!QkghNGJB>j^b$SpRsrnCi-GQ|0r*_v1gTHbW%`~10SaX6`=eWU_>u~W>Xyw
zm_q*imsEJ=OT;@U1#S{W+ajF94Wx)KWzeGoL<=FCRNreIH}-Y@v#P?pBX|ROKFmk1
zUZ&&^in?FW%Bo&{kYKW0NhU#F+*p$FY;vx;VoxFgBd0Id&QFwHW9(1P4Nu4y40>j3
z-4On)f7p13#Dal|l5^^D?VY7qs=aeH%`G;L17N9cjCFQ-YT_~;p>LU$uQ%->DQp$o
zVEI0i@(WoH$)zXnW;I*`pT{*OCpepiI_QI-4@aW_kU($0k0b*3&D8T?I)BN2+Q@@f
zQnVtU-VD&$kcbVj8N5Gp35;yAj7Ik=U6-ns4$fX94raHWTw?5AzaPYuIGH&e3>cM0
zsx48>%_k{Rsb^v0-%*o>mc}&eWeFoZ3nXLc_DG~mc{I3Al!?@NP-JeHqPJ<HsrPBM
zfYsXeqzaLtr&5qHTl+@#4pVl@G*GLPiDu0D+q&L$$N^~2TXv(%s{NNR4y%tkCoiUh
z_ZH8dHv)e61Q-J<`GhiKhb*4%q3C^OH_ZvBQ=wJ3!kmEb+&I|u3U*#h5eJbmVNk(8
z1N4nyAK&E`R9du;tm!7>Q%oz!1kmbAZ|n8Lm)VPF#FRSs>cNkufSX7GZQ`V11E*Nu
zY$X+wZ7gi&I;^P9DqC42#?kTNQT-L*e;elchxzNcag^SsUeE>Bw@<=HiKjF>P)@N?
zTZ<6|Silv^X%&v;@w?~b^@blg%*d%lmcO$|e08F!Ni^g%@QPI6X-QEF)f*{WlWF%{
zZq7~sn-g$#<S9#O6zvpz7_;LgMKE7dwj$MspQVad72EeJO{r9Bd5TET_o+XcSYRkQ
zj$Hf(y8klW!sP7}3j$@Gxt>s*oKCcdil6XcjC>{2mlML}x&(4(*fUAzln&nJA)Tu%
z<xr^1BdV8}T@o;A!eOlFx`j!yY-QCZRw$EpwIP9zz3d(NT+PPmo{6<?lqJ}I7B$u$
zzG<hoyfF$XqTNewgo8PX_I$r$c$Ym5cUQ5V+l{53=GXFR--0Akh0|mnesp&K1WrxT
zmy}}Y%_`1ergnp~-G%;N^l*khW7=1zR9YY`M#8i5op%2ExAb51p1r+1m-SRdOH_j5
zht5VM1Yg+zOip$^e&-O@c$sVUuLyNW%b#pw7+d0VVAQg7_i~*TD#!-c0qj4LP|De;
zuSwRt5ciB4s5f%|>5I>FuM|RR2nvPK_hevN_MDld#oxpZx|=2`9>U%EGFB+kaKa+;
zM%q`cpr4YeF14Uo|IyOd&NuHkjvCqUy|mz&6VXTNAhCu#r{d(6^)OdwT%>z2ZkMXR
zZMQo`DyZa)9CEEI<N`TC9M4s4d@iN#Cuwg-)4?E5b9+72Eh^Ie+?YSbzsg*%#gV8{
zEKh=2V=Q?&UF(WjUI5HoNY}ncvP?+IS3pqjlk~|3=GVHOW~vmoDwY<^o`AdEbvM?-
z7_CrcEaTX>IrMBc$+?5vep3qEu+JxLw)e?j!}X*UP>w_pYv3vx3Tf8LzU%vZuqpH0
zHf0{y4|c^gezO)$q!O+-z~?Y*DkWmpu*p}lHgB>bOAA;xXx}stY`0EdxT?1;?Ix_D
zaihjgyf~+$@Sn!TH62XCF(b>|yb@7h-NR?W<ddzU*v|k>JI>LXVJpogrbsS;IYbub
zLfLbN0f<*mY?+>8R+L~r#AqGN;6lh{ZopNq6jp(wRM`~FrNhb&D^Q&^+yQBGlqMz`
zl^t$WEoE(BsDf<GhI78J;~GRni)<IywZ1atm}AH+GR=ks2HBgj#PYi4T8`Ly$+7y>
zJ^H07T&QrN!@$}em8BNef|?d>_gqog4$|7J6+|4k2GIf5Hc`sPBl>770>!LR?gk9!
zkHZUuhJ?S9Hi}Zqs~p~*Km8C6LQIm5u8>+OMdglwV@#^44pC7s8eqN=F=Zf+PqEXf
zqE@OaJ0w<?MYV)nH&Vh!L>IL^wY=@I{gK2BrJBsN8!W{1{fQQVC3OWBbCxUNXTQxr
z+|BEo-5tAG&VJvpsePvUDF;Q;p>s<psJxjPs=tDI>NBAX1M2r+ZEab7iD_end16=3
zpKr`1p)X-O*?K{wioQP3#pnUmEHV`m4TY~7YcjFpl)i9ql@1_x@P4ZR?+fr(WnZ-q
zfa+i-qs5HlJQK4f-_4Q8IOLQbs4#NhxUDB$fO_{_97Hi&iDfLP*hYb5+9@!OAfd*J
zZ!W8v1wz{FtOBAbd3Pu1`qM-w#hFJs@Tyb&_`pd|T$}ogEDEHyVSNQ44_;?tvQphi
zkvdqGU=DKq;o12B6ZHlCe%N(%*_z6%&fK}}#VC-&0`_{DEir}hCcsogaRCzZ$y<m-
zIf)Cr6q&mj`ZXeVrVD_z#QK|}Q@YLdXq@iWWEaRc(kx}X&hHhCHicceG|#45s<Z2-
zImqqSig3ohW#4S{5&hEa<4SdN2z|4*IFBf9o?nH=8<q7ZtuZ$VeM|<RUJ7Q|;B*9h
z=zD;#oBpT305!7_CAWoE+-1<Cxna*4b5`z+lwxEaJVAXor3XOrayCaUFD7<b8tji0
z_kuaX)7#^y07);^(<C@^@|l+DTIr+%pOX3ejKadB>Df6+XH!E#tj-J`n8Y?NE~E~K
zE2dkK;nq%RC3pda$>p^rOd9?E^Kk7?VYxq#*>|4Jmkg<t=SwArQTZw&or*>g`zGr8
zbcGDoxVsZTe~ADETe}X1Hut1%N|jgUk`X`MliZ)27o_OYQSf#sr`8?YR4|X%%*IV;
z0x|@qMFwg9ugjZxckwuD-$+@2z!PqJBR&4h!C7-N_rlbDY3SZEVr6bp<z7baEV+qP
zdtq6p<<1XhLGHZOOEB)Vh(hM&Dt5B7S`A7@Q_GrETYLIeRHyGu_NlB2bY4KzHPm%8
z4P~>`j(@hjOd@JT(X3S^0!Hn~TP53snA0Q|a|iZSWq6!n9h;|BD>9BPZyUQF9bS_D
zE+DsNsO>Ux>PMB1|DQ<|Bc9-$-U=qki>n<UlS})9aB}5TK2K^D&-r^Zl`c^$8doXn
z(dueBsbPhZ{70MRbkTvC-8`G$jY=`>WUIGwPN}q-t=;C!mz--ehb@VNZh#7B!V1#I
zv28-KTq@ItpO^@iM5mw3Li0GdSRSC_(_I4;vw%>6pEjMJHuDSz{V=AQ&+z*94$vY1
z;}gZGq_ZSqF-Cl8GyT%0yrj2?`+p|y<ZU9i*iN^|-5-g$MemA*3!G){Li5Qaf5aka
zPMI?o#@J^%cU0780GC(!eQjVXP?qW5ZI?ic!WSm-!ryr7$p8vR)Op=q%Wr@z29XTM
zX<ri+!AX-|Mn{xxa6~DuC=*a>XG`=br2-lV-P{Pd$uwk3-v0Iu&?LXP6-aBfHaCV!
zdO-Q4T;7pPKy(nvMosFYnAKM%d@Sv*P7m&9^1$Fm!@v%N)dverg`=q@!F_b5m%14+
z5u~{s+$rnKdg*E__QmLqU}naB=UIq33vZw@>PnUl4FgF_$6Ot0d3-l3Gk$a;XR`0G
zjwvP^gwxpZxu9RSUDHnP5{ch+4w&=AHLFX*T!Ev|;w>*d&AhU(JznY@<|Vo@dy${4
zz}+$Y%ul|ND-JCep*YXp(8BO}B4I{kMoJcNPVWIQLGV@T?vnR3FjX;XM51Y|u)-gl
zMR26ghxZaJF^i>reazx4ctCd=ZFfcJsY4_yGdT!LM~q5gz8Sb;A>6lO^#@jPJe??G
z*d&_xgFIzIRpYVBGOcn+lG%5SI7RYNsZff3$_0thIurja(4Olari|0_|9RjZEfu_D
zIm|=<z<qY#lV3l|Px`c|<dV`C%Tlr!DsoJ2fGWG9mAaoD5Xjl%3Z+-&KBl^2jTA?&
zrBjWhPMCFbDAdAq%Q0XU$zMgxq7K>;_09xQWx~#EL>4g9FV)*N;$p~Gs=?<~rA#L{
zYezVTG>OvR_T^MJWpOP{E3M8%!fn$!V3lf}Fsh`mzRc<%a<~hOcHH(kQsod-k6b&N
z@Ed{bBjA0kP(5P(6DEF9{cyE7E-q{L$>E|{vl>v}cHb%1J|}NC)JdQ3!OdJmMWtQL
z(J||bzBcosSD2*loadgJOU^B*T3<tPw7zO;x&lh5I*Eyhb#Rzzllp#=xxrI&oSRv+
zDEabNxz(~%r|8kAz?peHyB_@Hq><B0WfMH*>1R@CRlL=wLbO<yS#1s_sO7py%8lua
z*<tNSRk5OEMh@+9`{6{oVUh<{HzoWW=)TU~So|<L=4U{5GcDU6JG+&guLP%2;VyGo
z0`*ZEuOOXHH2o>qCjvn3uXB5LU$daNB=9~31O=-~P0eB*Y+8Sa9wrm?S{8>H%DICi
zkhlk_v`Tm<MTRZx!CC(%qypuk9D0&-Gue+9DkWxr3UwJs28}v{;FX0*uEI3kt)*5e
zL|aSZ%5Z~4%I<3tOrH03&XpDDWb$wopOE>;UbM0$2P?)*^WVAgBKdL!vcCDuiDerm
zj;5lF={B2Zb1>qCkShYI3D^n|mF;aio3=DzrL!xrxVhZaXHGIAc_;PKT<>pQBLZe6
zt0b8t{S-+)3raC*;YaV?;*#GC(Tkq{d6HqC1DNBD?&j;u=B%D5p1h@!J}ADu(shI-
zGlnB&iwOd#hxl&4#s2^kWmzC-^9zj+`6@OmONtl()@sVMZ;#nJIXrHpQ;QZ(f-vy9
zGuhNL*~~;GX+LZ$m5aBL{+ZOfwe+tHyG^BWEKD3zsCD$Dz7R^lg{%jEY<(lY7mdHX
z-qGj>XXy?x3cQUf0QM{YU!XPoch>X`NIpQT0~;xnYDNTuwD(wDKc`xlhoytn{jvz~
z2TGx0=N-^NRwOoSVSbf_vHe{A3mG^H$K8~1Gou!%aY#8i(82oR<&hcTO(59}0tScl
z+Cj}$Con1#RS}kh?kN3?qrr^E$b;FGfs-b($ZK}gl$l1Dw?X)CV{LcN+)h7DE+hSu
zW%6F|tf=`|f;W2u7>smpSZ5aZGoJjG`oMWb&ob|o-(20I%}&{v#NkL2)KQUrib7q<
z=@PL-RD_bi#{{c7OqEhDQ>spD=Q-_C)q53kr~zfY@Ou|9gn#CS{JIcW$E29%^0kOo
z$!+-TxeEx)kyi7b;M>kgx4HnrCs+YH2aH|Dc@I;Pv2Un#+z2NHOmI3y{ugxSii+$k
z>RuMBXo5uM0T^DDrcojqIKKvhjKYrw;d`u;2R*?()=T%&Q)O{1pHNinXFO4i{uXX|
zUL#!ct`0YIpUpF5&hR&RqkN3XM~g$7wf7FI6fuz(UBFe9Hk<Dbb@+uRC(93K{s@zb
zf{iE?F;0;f0On0J9+t7cks&XV_*|)8B!h@6H(2w_N)X8ED7Wa@n#+8m!wKhH;pKFs
zszY)(Nre-HptqAm9toX}`tn1f^GMj|%<+PAc792+^p&Cyh92QOskmn*_bwu)W&PHP
zz|?29+Vi(G-BRk$LEvgWRqU+o`coip=SrpU+6?)fCTc|CIlip(9aEhILi27O{OS^*
z6oOEDizZuK(yEOBaM*+%i(_2BkMu>C8=s>$M@ZS-A$_M{B)~)}sj6MX<SZl{U2C%v
zZb<~^7Qlm)RkK$M)<S+7ScUk~EDDbP(Es28TVvfcl>!dOIT_9xE%qkG*evQSp1N;8
z0cV%c)Z=I7=_E0%$bg&fB~RziN=5990x9A5uV%bnq_!-VXO~z}UCdA-;)jidY?6kx
zX^c_KUZ|@SRw*tZ%wKChF<4Hy=N|uDGO=_KtEGv;=4_&{Sws|aV<yt)UL9-`2V^`2
zxEso#C9$%3-KpP3fcKUWI-JZr;05AB0-TrCr_D3c1!(v4pMBT;R#-AgwYcVOI8*PN
zEd*86wH;QVyZ$U!Z<<GMd<f}w66a<yIP&IEW(&U8I6WR?w#pi(KC6zXO57sZ<$xRo
z{XP}_&T;g1lq<A3DRP+Rkq_BPfb#&2Cc^1ul-Z=bW}CCeZ0;~Jw)6tKOE$l3F56y+
zxEX!*C*bULLMK0!+HxDxB@g`HuduH+erfZM?Oredkr01|1=N$PQI{+H>Ow+Kat}cM
zX9+Fv=k&O+T>6t-pNoGVD@F$RSz!vcZ-o`OZ0i8&ekH-1^VamS2$Vmk>4W~8XS(2x
zE3g{SUKSe+7D@8%nlIAH-t9>&Y|Ahh_9;`#w`UYgkT|@8=^%oC4jAE>?hF=&kUn#t
z4?t#iJY>@Ki!mh?VUtRzGmVodwzM>3KTd)c_D4_h6W#Dz6tuO2A-ma3H`mJVg3GvW
z`6q%ayq|$6HkbJ##Qyeg^`WxvYstj#41)C}?ygTK;h=hcqhoBq=h34F_;2m;!wvgi
zdbGK<^|#uC+UBE&4<B!CLA%<+joPEXc^fx6i-OM-)*gG_-=-ZPtJ4|n<~;v5{j5{b
z^_^&Z#on(aIMtgQ8{e&MZqzm_Udta`_{1Hx{81ky*6}#<p7~T2<abmPoelkP;PoPk
zP~N^nMydgO(vo95CFxPM-H#F3CUMxAav_OPkKFEn&6XmY_)90m$WD)p9a3&SidF0y
z_QKiPxEMu+q{VR%4?{}*h+ftqmCjQ&>HE=O5M73p+H1s82#c7*023C`yu8fZNYa)`
zQGtq~6h=|*T7D;@^jHdRc=30G3iswQpGeNgQQsL@0zu8J(0g^@heKdQilzcXT0l`#
zfu;7Q-5_r^Y8Eo7Yt6<=)JDul)Sa4KZSdkcYznK2hUiuu`h&zkUvtOyLiG9$f{<R+
znLA-tv}VkLr+=j_2*pc|`iSBL2D?H-0tS_7Sc8x_>cK<IDvom)Mia{W3gCg)doVex
z5GWcZqW<I(QNThfqV61t-i3EVM7bDoYQ)%;B(ef*eDb>4@>+*4Pu|qw#)j`l$A>>Q
zcN@Fji=W|P!`nGL`uVu|>h+2D`fzWzaoqCi2fOg=!O3y+#VOqLEpMgXf;U&_#K5!q
z!Ovdfr=#OWtK}UYd(Hi$y(aVr102^6PMVEY#cLky?46=JTg8JuJYXxmz2<)N1e%>3
zR&ZSGEc>Q+_|n^N9Phk_KkF}=d(D%dX~>t&lLH*?C5%`1j_SuJ&7IS|`muL(dVF-)
zqTX<QyUo_lUcI^B*sa1GU|g^9W8>h&YrU?+9qKOk@C`7zxBzFZFQ~7*X8pxpgNK9F
z?lzAbJ14j-^KA!!2$KY<uyxefY2ug0PYqa6{rKk!bW5}fc*(|ppF%r$?(Nq1>#tyq
zr8&@n9ojiPZtUa44_{(Gt<x8+ljh0kNyB?}c(_YoZ#9m8Z0<B#Prbdv76I<G)u_NA
zCv_YidjY7yWBC5!wADoT5zx`g<@ogIgltZ)58nWU00wn<dzWAhOgOF?fOUBMGxm$X
zpslEQZ(cXxci8g-S>DNU9l_B80PdXFEn!rE=ZUpg@1XH&uL+{XP6MAFVn=V9twxzQ
zui3&jO&<JB9Y#LI<<q9Y-1w`7%N5#Muldre@BY}t$#Y}u4N#)h6!d{#Tc<m(1^Rd_
z*6-Z;I_!^nLEme)j~jq9?bDOyUi-Cn2ul47&BdetSu*K`qe=CA+x!NCWl}v~kwDS_
ztr6jHI<(9PU0~}lg<zbJ-IFt8AXS7r2g41R`|L$iU~F*uobZ_gnoHI*GQ0cU`SgtP
zm7E1-qEn<aO{K@Q96CCrRPoM2%w&zBCB01(EUi|&U;nAScX;rsy?b~HnBRsI2#4X}
zYHefl0j<oQ2B{%pxu-xZB|008nNUNgn7$aH8=$eA`R=`4%=6Q(pCW?e2fF;GT6?^w
zL$;;G>(l-ELB(#-_wIWqaX1{39TwIU!!?fIsW@l)^~O)aCFARRK0f|vmfS||*i(*c
z=3j=G*9rAZ9A}GL<*km{C2Ne{cb@$~`FPO-{5Fa(G8mZYRFCQIaylt`75Z-Xr@#N+
z#_*I9$~4f%IG+rI;RNo$y!ozjpuPPBT8}&N`%-Fr#E&+`54lsr|C-127qr1XRc}Lo
zOh1?A_Jx<2`^zNKtw9jsj;Ap3t<5%inVrE6TH7d1RS@ij{W#Ij?Z>$4!9X@Qe@X^&
zlr!Fe_ht%?=G7$i?rP4<)9l->JX!eW0;A@>)|>yH9MRR@*nM~QtC_cYE=+-jxKNcB
z>`4yhy<^XhUaX`JCh4xBH}p<C3nukW5)G!4;K-kxOP|2j2gq=#69KJGfCKzTGz!#7
zp@R!=G?N!_ybhqTyo*1gNdRa+5+|ncCymw#y@Imj2_CqRi-LA50;*N2jX>wi?}F?M
z93=GeHL!7E|Bm|i&lZjTBR(1Ve-I5Wr;|t3?#+!cTmG*-ew3B}A3VI3|G&s5U;eLs
zcPskeivG8v|E=hMEBfDx{&PfsY_WEOA9d33ydrOE3PrHb(%#|T8(51J#;8iVda3@z
z5_>Nq7xxL*f?UO5Zpl0a^ok5@XY8D4Bz%kv^Shj?imM2w>QnecEGTUyKD8=!5CPK!
z;@ls-Cr9-CuzQZ)8?VFnq4&}sbTPF-U&x%Ue;5uiO@??|kKt}5;zps9_@tt%HzGLB
zfH(p|5B#%fFtmu09uwbdou8kpD2~{}x4S^(F$D9%j1My#6P=%qBpW|=Bv~||Bb9!X
z9qpkL^w8=mZycrY(b^ieq@S-?zcC}JlsLygr-kl!{n3RlMYiM)n#SH4SB<_12HI&3
zLm+y7jEO-9QA}V#dJIr|g3qr!679JH=w*N|YzzSGD(U(Ix`SX>uT+N!zD~qhBNN=#
zE(LAHG`Ag^R%vj_UqEiBf3-;!>jI$59fb*#HBqI_AV)ZqWjMwQ{&^;gT-!bm@K%Q3
zT&Fnw$_IYsgZ0W~*qfZgPdRRMqY1+T4WE~<g2_?%App6TUaWkmq&*Tu|G<uRJM>}z
zfElC5=|88zs2fx>o^{ajAesa^E&|Q0x>h$#J2;D@DWzk9qvChp%bzr@s?$@-x0sSM
zh^Fg|s$5aH1?87Y$QMgoX?(!!vvg0UYO2D4By~WOjE`6Xmpo~W253rlK}osiHlBE0
z^sZXjc)GRm^ufk(<*9PbWk|dLlJGv=ExlSZuYR}jw6@{Ci-o)ppKH1AZd$`We)`~X
zW>|W6GxyysYuv{$?&I{hZ_dL>kbV_pb00uEYq{|1e<62?n3?$fV3JL)>beM;!vOp^
zuuY>$zl6V4R({#o+Iss<;?ch_N~N3cQif*yEA(M=4+~~kaXLp$qVzmksni^&7gdD;
z9xG>x-PpfGUGMuV%rHMjb@9j|JQY+qL~&0N7gLTPKL*M`x@5!p-ZLHCGj&9&-kT6O
z&Pzsk7AGW+GG$CgB<HMPK<)3aV<S28Uq(!qg!o{0_7oXAi6TV({!@VvtmY@^p>Mn1
zhLp*ZNQ7!bWFX;Ropy@)xb67YREM~zL?Ix7P=2GpgV-tzsi}~e0Miylw)Lv$m5)!w
ziG(t%V2L*UJVR_NUKTQ|Nm#bPgW@^`)25Ne#MS~i#|F}J%}YYn%Db=f(>XMoTO#4!
zeok-0SGV|zL$9$v-X$d4>aY9wrI>b$AtR1Zv`P5R8}oipL?67FEdtLc<T+0Y9o0)8
zFw#yBS;GXXAGpRydKPP&IT>~ek_}n+3ck;~o1T7sFi|%+wWWX*l?#lRC-JBRVlQ<%
zGgO?9CSw+r^(4O=CkRiZ>~I9wVwbK?_hnGTisKWM#eVv5_v!R(9f}joUJ>M=Nf6@~
zb8;Gep!x|K;JGdGuwZR7uPvta!_Ca^2{{KwMj(RD)7-F)9bhV_165=d?tgC_B_!Zu
z9c`}QB_xh|b%J#aB=I=|00HOcN3ziUJV5mS07t51Ad=$+DUI=H;rT1^g43?!vIvLU
zV7$@uA)dCw)N`zfTy7pGOg%@@e8^=}TW{hI1{Gc1L-7sX3iq^<*GtKm70ZN0=mwtr
zbLz+0!$~Uz{6Vm+Z+hQ&xZ%9+Z`>df`vam${sa7|Ls$bs6>~wqZ|neE`}0wyua}ps
zqg#-IhJ5wA!Pr3B@BIeH7M1%9T%GD_A~oLfXS%A;MRrFOgkvT!4^B3$7&<ff*tJ@Q
zlcfdEU`7U)cx9#8;Yu1BDj<Lvg;#PRF|#m0lWjO+8BEn!M9yF^@IP3rE{P}KQr#Dn
zCzz(BFF5S1Sd_@zak~5pmJp&)A)=H-xeSkOy`WNg%Q2}KY3h#b5FQ!BGz;tThEprj
zaq<%^EC)L{)Kzu0=5&CUWuQ}4!jVdB)<#IQnVQ~neNU?G-Fzxvw<+?DzPndz5>{2?
z)V-rSV-5%_|J6WNlE2adQ~JP3v-{7@N%}VBfF4$ngkk<=YMXgV9piD_(C6`+@3J1}
z`T%ZbFI?zFSdTQv0whCsnttMrkza`5IvsE2ERpG~Q%VCrIoz7!(e64yAB#Z2?1h5r
zLTk*vcE6TA%<AAA0725n#*$Q1$Hu;1G~QZBxRGKImqxzXh*yks7Q#I=J6L<*W?#{*
zzVRNE%{wrf{b<VxIV!}Itwm7K!4eDp3u8#mHa=7`+(+%=BWk@zN|&cBH1hjf*q`Ze
zl)Ura#xRw4^7O@(5^jYvWj){&Y1_9Op1f4?9&E@pPRVwG4Zp;<$CPUWo3KiY$hcTQ
zXBUr!w-6lP3bxR1F@tDx!w~Z$barQj-&g|RRMiC%to+fHlQ+fGgK+r61<J$L&}$wh
zm8uY{yKssrxI=9&ITSkR<60LQ3V^T|4#NrGKE!p%jxzJ0b7=bsfTsh@6D235LZ9b>
zKPDT`hoC#1=&Ox$1e1m`$1hCnIL(kl>shNw>LoTuxdqf<C!b*|0NGP3r9S-vd$F;x
zVIIRDrUmUey&XFTL_bq+tH<=Vf{f-s2zN1#Q86MoZ%S6C=bGjwh<D;jfug#k?Wbj{
z<Dce8gb#VDHJYsYq*6+b7Sw5IHDZNKN&RACzE*x2?FK!`j3P3JVUpmCUIYV7B|zNM
zSnaTQ>s5al8E$;#P^rfGeO8c@B&QYM$ex{t@5A@eFp9&fm=I9~?XAq8G<&K1*f?%+
z6i{w+R66N59L19gMf)*`JHRauDXp9|l=w>Zce%1M`7l{A0H+Ww{ZwejCDsm01O5vI
zl4Sfpx)BK8l&<l{qCjT*e{61TK75q&|9G^y@!;0~<4b(*6gz<Mq1y91$*ph4t#8Mz
zZ^x}~$E|P2f0}PcPFM%5<N)>+K#~*O;XKq&@z-|q;N@X^52oRHTbp;33C!mp`MoF_
zKh-e~^31Rz)>mMjb3!3#gw{#@q|rV&JZMn<$n*m>H^8Ozqx#NH<0$uuywupuJ^@_H
z`56!f5c(tBsA|S7pspAn;Xvc%Ui}q!(QfU$ZtR}!!LE2-srKv{2n(Lb2RnlZtEVL(
z3H7D}<($IB&|*8(#Ps>*7!F7K1(1m*AfG3F)=Zz25!UPYaU7x`tn0|qUfbQB{CotH
zJKXu9apGB@T28Bzy_V;GHqADXP+eLz0NL>e1JoV9oQ}HXQg*Xf@q5|YXlY`4z(8%;
zdFkB`+5#5cqlH@DYA|4T^M0=)#lKjt-}NUxKN<STdsQ_M{w%G^j0$Jy#$kX|5KDwh
z6i-sYDa3KKxk)}8RPTBf_Dra{&fIzMvU;>22@$|Q+8h&Ndc%^fGdkmL>_7wfZgnC6
z?;>i>+C4L%-$kRtj3Em^!tdomBnc*Mf=XuB7w%nN<UNz)kQoDE^~pm>uQo=MR?ndK
z0m#Aa0Bd|M2FT7J>b}Roj!#2P6GwyTWr0&t@~P}MEd6TKZO_FzjsTgU{Z$3NP*&9i
z`=5h{H_<&RJ#KOc-Ui${Bu%q6?PH2sJ=Hg!)mZK>m#nQ$sJZ)u?hrKMPUKN?jy1@L
zq7D4BB>iI?^iB0cPvO}pvX1a7u)`P7UmJ-;db|v2Qiot>L+3=!Y-yh>GtYkSDY=V?
zM%aQB2!~Vj=Tk{9dx1Y-ab!TwV_cr6CnSUNH^EWC;!=0C!q86=kaet7P~1dnvS8Vu
zZZs5$QjHsmP1FdxII%vasTq$4ShQR`NGb0!8XZWdnLyVeslrqZB2_7yCs-=8oWnCv
zUE{cQc}@~hFN|RxgDbC#3Hn@eSSnXgE)xGIQkP<*ki;IJ0${1!86t3%9q~E=EF483
z^4LJ#nt%EJ5*;k5Zd*7^IEGfspBPw6ZkGT*Kb&aiQA#~X72h%c%2@KH*;(FjlF2z5
z7Q=*i3^b~$b%HDd>@J8cPf}~*MT4}~BfkZ@VpO&^*^vq@Q|%J*M<t2a6-y?|f_|R_
z<RG<~lx213$M4nF6f$FXyj7=AEvu59En?UwrurIE^4!hDIiv2AWPH(hE6<le?IDHl
zNiJCK%PVp68`@HP!Q4?N;EsF3sf$Z%I1*F##Gb@;Z(Wt+hv$fIu5BZQTHE$b$Cd0|
z&4!%@X%@reT;?yDMbAFpdiPb9XkHYbOLq%tQxY#wy#_rx1Y}4NkYPA?)TQ+F&Y88=
zpB@j(KcW|^3d07PFdb9gLOiqUMAg(wiNum~%(=$sKBp;SY)44p%-HNB>2tllA5sNl
zQO@Md2M!Eo=;wNOFt6al7+R?9&EH+w#GLJ2m^qER%$aHp{DK^6F=lkFNmV=^oCnr}
z<?y?VF)xJ2Q4JJ`LGo`r(YZ{u>u=C=s=!g1J1p-=K9{jS5_c$-b+wa7ZunJe0}?J=
zDU^I1M;)?55oYwEb%b^S^tM1X+W<~p5Ldg}LL(~6YPTXJqwim^Go<g0(W}Bob|mGj
zJZno81g^KWS=Oa^pVItf&W0KOhqs5NN2<4HNHSe4L1G+%;DFGnDQ%Y3{_SB#SM_5B
zZ(m|o_;A6Fj-!N5VAZR8Yc)07aKtvHBtu{6OcPmE8;80f^1fp7If~%g<5&;6xS)eZ
z{Z+krutv#cwZ0U6X99%~uYw7&T0mln5(FykwzUbwg;7n#2@;SzWx=fNm5MCa5aNnA
z@>2I%@%UX!^7|+O7=F+AL(bbhBz&@Yp58tA(QF?6;O-r4o^zYQDcFz-xU!Q<`)mQ=
z5(cEZzQ>m=Y`^=;|C+t$@;Xb1+{IfStFDlE^(&T;uJ-#3IpY}JZS4!JB6j!UOBR=h
zub@e=Dz_V_YNZs>Dp#|*wdl&j)WkFIsa7x{#D6W^>%!~^*5RB1hKwRWV1lnzyp23?
z5Y{dQ4SeIKp@FFIIe=kHRu(Kws!0mHNudPU;`tC?dBKRnbW|fzjflAkrA=5QotZ&^
znH3pmPKP8montbc9?K{iAY9NzDIa;H9@Q8bVZL$9lP)EGNxBGCc4o6<N|K_mK62F*
z(;bm6Bb2CO49IPsCP9BX;E7&EQ{|nGCZL3hCs4(b(HY4<y)bzXC_%DZf|)4Lvj^|_
zK-@{x+dXkQ$I40``kIZ=b>&?7mn?J+5F9TU8p~mUtG2rC`7mm)k7@CNXp#{*GAa%k
z(qa2_OY7LNh(u1M==H%&Iu`1jQY@zSw6$*}D_0X-DNPbC>BS05LX^DIVzu**n$05#
zb>D*tG_ae()#L!s)zew4bB9y<Bidu&_X=<M#Z^u-HdU+VWH-4#>c?T&X3w$UHoCbf
zT6fg-XShd>OP_g`12stTOf@!Jc8^u95)mVF&~uc5MO5Gwr|Vu84=3s!o>BU3b_Q#a
zPN~E>t8$*RJ|O5xJJ!3QwI#p#$zE%IU)V@lS6KZ>8lSd5<@7+Bm;m`ZVznb0UJ6+u
z<X+)DG1M@?X1ymViX1L(Mw{1uGLso`o6fqaQv(x73rGy>HT_XASxY8Y0~Ch*F?qy^
zG(~CG93gPla0k)+HVwL8PrBoSXg3)6SF_sghRNcMe+YtceGp#c9n6rb0s?IZ3BY=#
z1y|__pQoIctW<1?_0n<By;%CCqacV+qL!r1Dj*!;So7N9xUEyqt)kRx_4P7}hyLVc
zuMQ${VP83nyD~PmCs7+NGBy`jz<`b8ELzu_Ue4v#9QC7RW+?dhIv5ZR5*-^POvn5I
zU7ul3m3|^h)+3*t5u9~AjR54GAkJ=!tP=WyqjSXk6P;P};3$r|L6UwbX}`!uo##$~
zbNI8p<^K15GX9@zX}QVtUo-tbYg-SuHfyzX{;#dgty}-kFYzgG|9o_t|LfLA^wvl8
z)<^W#NA%W5biR-1`b}m4!x8t13rW2CQ8Pt<!cm`ia<&E=>+Vn&E}ZDZVR+DyTyV-E
zE7U66ZKO#alcUR^lYoS%j(r2uexc4xSpj0w`Vz4_-fyd5rY<ESCnrs^t*LpD$&wRe
z^|WI_&NQm%#c(clma$(oWW~b>Htf|Oz4u6$&<Q4&K`>I;!qiBbu&c?EvnE?Xkw#7@
zPIIYQCTrI(b)w#t<MAR7`2OsLOzWxAY$8U~Dg!AoYI6r5*pmx#f)Ey!4dFG^7|WCx
zaxRR0a@y!cmm|&*=51ns=OCF=Dz~s2RMF#wbV$yNUw>Uu>3_HeC$)+C4iIQW?69P7
zuYeLIgq+~bXYA&8dA?or=>hTGkGbD+)jOn{P5Q*%sM|!XP-T-q*?5FdQL3Y%h3kN=
zsC}AZ`$U{iQXOKRXrghP(xU)81~!x%CAgB@DvX2hMd6J)7g#wwi;orxxSOXB9Nx-!
zO(S=tC&5Q_Li*bl)tZMZ91m?5dy`aq{667RGz#oh2X+%;5%%S%;n`%`AWP5~JK|gn
zAg}|*!)ykaOem1#6x}!+Pdp>uB<p9$H*~9Uhgg%FBVG$6##1f?&W{OjVT0(*{W0!!
z+#iM!U{Ev)yUx$gdV_v<<kU}imRu$4sC&%*ik@8f>&+8w(a@3Y*<{R0m;{TOUm-ip
zWD*R~F%5mZ2npaV@`*Dq5+_gRhKxhOhjAp-oQbsD61rX|AP=exv6pc~Iw<Lb9sWjy
z;AR$dh{<bC9s6PVGhjo?i`~Lu)Y<GzKDcQ?Y#d+ZiDvzWwcCC>QDG6(MK7TXQsocB
z&-yC;q^e6?Qks?lITj&pz%)r#VlPF_tqf##>2A3M=5!K{^t8+rdLp;sW?csNIMWkS
zQBF*$?hQD<xRq{i@b0AD4}(GPX}UMb9EAOm)7J?7C6O|ZRE9U-!`HcJMHcu^Gl2@J
zHXNmpvumr}$p_K%MRB_u`^kA5=oV|}iu>FR`mulJ#6D!6s_x6m8J0W_<Xo64CkZ7{
z6l$pMaecH*o;e$(tf+}qHVI1hKY8B6Fzr#PEcR9%e$IG@R95e)yn(+t$>HFvKDDq<
znn}V`orH#xHG!yh25U(W1Mt9}*-5&nJis{A-I>1d9IFJZeqsf&^rnR5#PIlo@OQq&
zR0KVW!Q@`86WysrBgLWzCfuGHBkAf~3551Uj8-&^bMC-g5=+8_t1Qz8G*bhn`?zFa
zV76NBDe9+Q2Tm3V*;D6r`Ozk3=L87$atM0W)Coc|r{(~RCEAl=k4NGo!%Tzw#(5O!
zgp{x0dqSiVjnJvrn2&*_%S1{Wc!+CdX9`luCIxp@--g|n$9^Xqz{UkG3J})=l#T;-
z5<}Z4@!(WA1cTx)xcv_2?N9=N=rvWxIftCcWV_pWDyh|Yt++Z_*o0i1Jq%>?h!`b#
z-I?=^tT%k6E<G>P>)9ac_yfj0ZmIGm7T*~5cZ)VS6oCs~A~pf@rN1ZI-Bn3M<7iCD
z;}j<-yb8Y#=Z?rGx^u@@6=3bgW88ABo}n)BMvf<RyNh~`kh*UaMDhy^H$@+6_QMQg
zi<+_O<;u!Jta&=Q#F@t9Wo<m3^Qjvz7pa3y=CHq~>1{H1>r8-~9`k;DstwqD#mI6A
zgI>dZ;E`V4I`6O}yDe{R+nLFD5?4ivZlJy^&>6Onu?{{=*0%j2P&o7sk7FNpL+>}0
zZ=y6U1Y=Aufe<u)ObX$|SKWqN9eDEnV2DFrIq-t{n3xQXMv<rtctyW~5BM0cuOIiV
zVgt#3vww)L^zHh7`-jHQ-bT?w)OH-avH}ZJ&yO2Ndq0E3SMd1daig*8ZE<=#^v4a6
z1wc>`*NGyPavGX7#a-06JScifhyI}sO&Leg06GOqgDP?+QB{{KWf75^pvrj|0njc&
zUlfsSXCr?W-Hqh1#8?j{FTq1}L#Lwa9!6}y!)PSB-^}i^tcKJs@JGV?hJ17=@<E+`
zJfOiC_+1eF^g39Ge;r*Svn@m+X5JhV#`(PqAH=*fIp6Nd=0(AYP<r)Rnd`RkvN7N!
zZ$-Tsn2Nn@mU%e_M5x;F$&rsHflm6#kfLMEB0RWoDH&-5hl_=9(erW+JKhp;Hs!a+
zVbBeXLy__q7bjC<RcQTPNhnWxeq>pC!3U*HFf&kMbKRPgl|GNsl9@s5x^i>?71>jc
z?Gl2cGbM4v&wz_!352`n)6siAg1IPsba=SeuJ7#~?zH!t2kln#9}TaBh3HnlEzf(Q
zzSn$pfa%44528Mmgjy|^XUR23a5`x1bQKG2F;&N)pQr9mh?GwYgrHPst0PMFtXWcC
z|J!#@UGCm}YaSbI(OQH$D{S~QD?H~w4t4?Ej{qO&0<;84jDSf%7UkUL`s#}8&P}FT
zQU8%L(5*9oeF5h7#MjvG#!<q&S0WK#uw)d-E~y_T`kvpP=tC>vVj~vK;DSEaK@>XI
zDv8UOGT&Oc0Sz5F!Zu(u2Re)m9s;>wYESwojEO+H!s<2Th*U8~c8a9(h|+ykVwBSR
z>#%E2^I8}YneQinFt8_htK&^&iMo^pkm5x4B|ggN{b+h7-(Rt;of0+TfKq67ElEfv
zgyR`|=?}&2Qxg@c=6kwWMdA1^*ShL5y-z(A8G{aH+@v4HcQRuy_?euOOD#spIoo4R
z&EXDKh5ryi2%jm!!+Z&luM`{NN^$%;`kiFpg?nZ+41<W3`0_?>FGMY7^+I>t%&s_S
zHXk@BAz6fQ=j5k$wOZv@bSI37t7D)9V-WdzZQ{%lTkbvKP%>pBpqyc?U{c41d%@^z
za$a&}q;zL(a+1{uY1S7QE;0R1YJv)lFxHpieC<^p$&WluyojeG6%vFvOL&$i;<TjH
zsp_40tM>cgitzM@fCJ~Q%;ip*?DQ4C9NNNZPn3T?-uWU1DzR|6&VatcG!s+y0_J;)
z*utLXO!{!fX$$}cwgq=$3z*UWK5ev4*b&~&%MbH}l_$qs#9|ePX>&yj$@e$^Y8(4)
zRNJeJbkOc_Oy~k9^#b4=jcJpWH2DU>JC5PkGtSy9REDvBS#V#HpS|K&5e6&%04@+U
zK(GRL;DUY8G=Z0tZ16aHj)olcC_i^PGkoC(i}j!jN;u(g=J^sbUKZ}3PxCn<+|}km
z^Thj?urwv7&}jKCoY_}!T*qNW0zR_;-BACp|14_xuZ@o%3#Wk<eB1kteKZhr2AIO8
z89e0dE`{x1>|p|zU6G-%@#g%-C(Zo^nv1ddR&n!_*T;?eZo5@~*`THm=J$*a1u9UA
z-g#L3j{17Izh6JtZSSDV0lxBR#w(|LC(U+azj>nie_Srmk}!7%rxZE6kz#RR&kx~G
zILJbqvj~Rd?O$n%s1&x=(cSHMtG$l=0GA_?1XD5tyI~I)x;Hf$;ikl6sdN4#htg3y
zVgWh+fh7i90S3?^L)Uk5aq|s;VKDj%X;Ms#m7|>!-(dM>PfrZjkHiFjHgs}2G6^g2
zBXG&oxcCR&C7}#M;dRU*!fa_x?9Ps9q7PsESNk8W#z{I|ycP;b^I-RF?>4^KKCU0U
zLMQxG55H3#Z<MgT*i{#{x=}1;zB6g+e;))N%!>o{CMsP)#>;=l$TVn+wJ-k`8E4^k
zraMcOWdQD(hbZnT7}>lHsf2n<^dm0wYzcAJ?(B@Rl>pl0l^ww%DsdjC=5`WL2(*vc
zspvjj^e!%8JsCuafWoN~)k)cz$w%*ZH$Qd($^kbL_`|ul);a-dwV$aGMK3pZ6+ptC
z*3}Ax0^)$V)`G;8jn48wMg_D-(;*8&gP_lB`%9LK@NeRc1FTurx3+)=$lU|Hjzn{1
z9nhD^d5{pt&w-NEDM$fm7P2prn!p7muT!#ad($~uPb5z6pHC$K#%XfzckJTcJpG?_
zRu3>a+lE;SE32%m7$CE4EYi_l<EH|Jq16cPn&U=+;?Qaa*QvKf>wB5eJR<^;2Z&Zm
zJGxgb*@*#;<I`--LBTDOl6uuvaDpNGVj1?xROpp*ZW|RYW0%v8&$_eCk6|J%`?LC;
zFQ0a^wn<W3B%&D8URvm(O1?`9QpQNdo>Bs*Trf!z_M<rZaJ8VBJPSO}7y#sDx}c?R
zG^V5P>##THP&jib_`QJFB<_o{%<uu2)9B>zsD9jPsBC~FszsBi8x3^gmoX-m?-iaD
zYd~NUg%`pkfG9_@sgz|h#eEzQqrWg;Za$H+<rt}-DFyZ3w~USI1XUf6GB4ChCX!kP
z{_kW<x};P<%8ajExYSD`4@S0lY1L>mRRORot)jxct?)X<V-LO!F#8kMiwd=2X$B6!
zxV*GEETA@>7+ROvA5tq6C?)dR(|+PRrfLO6^k}UL@har8#?BrIc~eY>q%%+@RFRsw
zssah6L||wWv41I09Si1Fz50lZSK>!Py2tSvn}Ab1tjtS+_bJco4Bh$rR)^9$&05-i
zE(t35_>RXx6<O{x)~T#t98@ep+MMiaCLZfFVt7?b1^}`bRn#>^10|ZM&-nNZr?qWH
ztIiZl?kIJ>ea5_q^0dtCj7mJJ4body;hgy~*T^(Iy4;_MhO;dF)S6RqAk4(YB2`&{
zwrmEfuZq?IHGecQM6hXRjpw3fsk{4#1E$pRx--5sT3IDL-=-Z$$4R~-8GSnX3DP|~
zQjjG*lh$03FNU_a&OFZUrS`9U^)8ZMSDT-nWlALDp9?n{8Qvby;5fQ69xGgRsV{~g
z^doVPRFS6ID5~}P%@p$9R(B$8UR&vio*Hb?hB$Pp#7i850ntQZyVB%zD8bV6x|C+Q
zo)ZphLIElKr`zX_rv0XcH8o**@H}g^XF0{?tX5d%gOo|Np?nsj=~&O!>2TH6pc=4`
zZKp@#%B?sR<@HFwo^|r0SOLZi57IhingRT0v++zqWG%3L%4%FjYq)vI6(nW7kp0it
zFpvwzG<wobIg9w+?sUkt28GTp$|;a5L&n_Ty7=@uVJ|fa3=8cbITZK9BoKE)0jVya
zokDfnV<;M-Qd&D5HT(MHB0zyNd11hGh)SO%rI8nXc#smw>ype-*bhFAr>ZUaZRu{v
zWf!*As+QKqzxiG}p?E9INv4mks?=y#e!GlfU50q7L`|zhAR<1yTUvsv;<v4SXd<d{
zb+H{hRSpBgz)zT1AsURjbPs5%1N?K6@v+R>_Q+Xg%m~pQP5~9#lQaOid9sgBz31MM
z=o$A<Pa3SUZPxdi|7aXPRsFG}Tz)Tn;k@BwmMCpduTpOvHdyv-9bFRmE5_VW`j^%q
z2*xN=n*?*pU*j?tr>$B=Mi)=HIH}n%8Y)bk35ZwCz1hp2A*<p>A<mDn94lwTLHtue
zlX!2lH#|8d6ke4XIrPBlWR~El_+B?j9ZjT?XF`IxiXi!enswfMJLC?bWlFNbw}JrA
za7(o~iBuPq_d7w6gB(?2M;@KS5~w~}X5fD*OVNq(w$$^|ZX68k8P~Py#RjFh8bh0w
zWP3@&pP^)3;HvjJC3eMR=86fWi8-#K6pe%ucp~`|Es{sA+xWiel0CGQ#fx&Rq0Wlj
z`Fy$_;j$fJy2XjLVRA#PYBM-G*aI2ITywTnmwHd}i`iW;X@O-C@8{r)guR->W>bl5
z|B2#Esjb|8anQZ$D#Ih^xeBz<AR(`u*_0e8Bo;^Uf2%CfCgEhtljHKp+RiwN)HtR$
zN!3eG)qYRnbmYU(m+BR+Vn_P^m&Dn_D%mfLGi1`mEl8z6CAmd4v=UBn6N>{b$E5(B
zPZDzTQn;1aBunuR3`eS5#j8IKa7az+<qEgMIjAPFbzqe9sPQvRg^tWQs=J|92gg1T
zAox##Nncmr_In`^f2FASnC>lGb0F0K4JcXBpC+=}qYh*?%F^P+;nVCm_;lu2qEmWF
zZr;ZKC5M2L?$78PQ2&>fy;6P6jCgPw=Mehzyu>{{r&>eNTe;+v?qf?a$bLK2d;y9o
z9cx;u)kHbcN_u@>hJrdq#r@rv&ApSxF{XM#^-NY@GXvO9oz#O!M#ODDpC~!+CNsAQ
zj{N)GXrwY2mAO=D@FARF$^uCacg6Mrr6op3*tTR=Qp0EW3VTM6_$<by#-yk{H-|e3
zRnG5iJt)Fy=#KClt>QBgr$sL5*qCU^!e^beqa62ygJ(~>+cR&}OWI)L+$uS);Cx{<
zOyGlKP6s4HLawLq@v9$6S=ZdDpEPC}^Qq;*VY`0#a+VEWHIqJD%7jn!HQ<`&=;|7f
zyFD8oBqu8G{ywG52zqF*q2$Qq9!(5XbHoa#d%(HfqxccHk?!%@?|I^7SdxHZ$!-rV
zxWU@C1aFin^M%Q;ugbBiZ1WYxY^#cLJTG?eEhWsvVL~)wg<HTV%Y{<5f!un1c)GXS
zZZ%&W)c4Rep!u@d*d=#}5(Y|nzp!*W`LMRl6a3!$s$~7C=j+{d0DMT1`v_u6pRm(B
zNe@!?o_ICMof%UcA~RIy6cm#Vc0_RToRcSZ<Vm93Jz0FP+^03mLW#hFm_lh~4ERPs
z)6uaySc9ZQQhs8>cuIhNy!!$b35ZeXaU=QfDGw*Mh$D&<vy)bHK1FmC4Ts^tS5X^0
zcy&(nB3IX;@(X#FVxd)r-s3UypXn$WLz+Jp4h%<^X{fCLaawRV#w(7tQK?Xr@2f-~
zS}S(EfcQV+(cc_#92C}wW(U6s^k~8()t-hU#*HOxDVo*tR8E;oZAzKLM#Yw~k%Ao(
z^`c6aPU;fYlxhd}&J|f^h{EymkiH>hvu<S!d*NKKzU0Q|Vi-J3g@l3n&R(Llvg&ul
zD6T$%2>?;K+m$#Y<-EtCbMy}Iw5THFDjVFx9KH`{s+`L4E8T3OZWL!-0~~afAP8~O
z)HQ%zi9CICQNJ7u9Ze#NDEtf&#dM#;_Ho@<(X2acn$g{po=@dc#4X1pt?1vBvgL~;
zPR)Gw{f*+Q9ggzNll7r7`zo!@xh<V!b;BMyJ-OO}{%|7c?T~vN%Xi|gfOqlRbY}gr
znjH^!EL1Gmhs!2x_7BMGp<tqF@#wyCjP$TIiN;w7;1I$X(HrQ00#A+u__qLFc5|Ls
za}?rBnBTJ{S%qf7TDB3Tf_#liR?bMhYFL@M9i;dvm1pzj(f{kOz1LX0+r-2G+jeQv
zh)6sFBbf=w(Si6$I_1d3e;<rE;fUWQzi1+1%83s<3oclWgznCw7&;pAZS1p|iDgZ7
zp(^+FDT=xo)zZxYL(yV54<6;7AJSrx&=xHo4dRw@+?u*cPeb8oyo8Dg=|VZ*0t3J)
zRzdJX|AVX;a2XW}iMsj$BAf$cKzBtJ&b|hgnW}<4LF?yes(4P;1~GLvD+L&^2m%;O
z{>~+pi}Gp`B&npgzsr04Or_q{@az7^z)!7Imw|Etx#QcA93i`|b9~}IX|PIn)Nqv=
zWMC`)-%4@Hla4ybkZK26i_5B~_IH)T9Jmi1N@^01=54kb5*rrmIMqzgpHk;4Z$h{&
zdaLD;npRmyI8r8f0Xydxp{Q1gr^3ai`*_I{$!sP8Mq#_k!~ng=whNd|u?=t(IDV%^
z;ty*1RB;1%pWYNr5EyBt%1z~uU$ilN#iE{^`$~CNr1wKcOstvQ95E!u$cdc&JjC``
z;$=nt2}jyem6*eBhwyUftJ<Zp3d@jwa+!*(z>|*Vz)%j56-Wk^$c~B%U!-@*r?f=P
zzIsj`1ZB$&hKj5`r#wz;+a~DIU<*Den;&I3)AFN{h-G+>M@gkKKesMw6Hsbmk(F~y
zDuh=B_n5%{90i;XJI9bo^wFAfT@m)+NeAw-a4R`~xWvpLyii^~%Jpr2>@bt&t4oYQ
zInf2y%-Sftk%c@}7%J|bhm(MPQZ9k)6VW0SejhD(IO4=SU|J@eh2$Qou<(2ta-cSh
zfnmce@jGMD#*Tpqv769kRFODMFZkf2qlM>tTQY+5E>hS7HLi5XPRYKvnQ5(mlBOyE
z^u)3~2<i1W8@WktC&AOfNZS%5rc;M{2b^Ka08l`$zX^d4*`vz$&Y}n|#a`fBV`dOS
z`^)@F)BF`*-*E3YeVhtBRC6vB=#SY3^!eUU1^NW%=bY9~>Zm?-J?#2;7CYYeUT1Ba
zFklV85ixn<Z9KhWRM8(8=GxS&CPsa1KX+$rjiKLyfo26_n-kC5FDrg#b#V8t`D1<4
z8q_pdf9`FXo(OQVoNr94vZKLJ4emd;`dQ0=(R3}K)2+4@1j_)-4FFySpo)4akg{MY
z)-O&Di21%;FLw>$XN3Uf3jl{I1h5K?PeDe%s5`g&qMytgh)9Zum5}+>PT9L}-m##g
z7XRElbsiGPP~T+#C^thETXX1r$AP9w9yYlEZuL3#B^2?#3w&#<t<}kK;@3Y9cVMTZ
zxAdl|82Qh`H7GnAdBJczx#HNceyX|$s&uN}ukh?wzL3cKg42xA3#4ZwuVW4?>q|Oe
z%DtxSzuvD^a?1QwY1zfk3%Vh~*a^D6MQT-ySD&4D$X|7YR(PpCr6}zo+P^6cfve*F
z!7i4gGlXKVRJ@JT0QEG_ONl5{`L?{}I}{!3S|(BrQQyAy@KhJGuM>mt>oPcA83-sF
zOq}^6(~LHSo^A0ncUJ7p^L`XvN^wOAZPS{m2EJdQ_%ePgnja?B7W~JMb~PWxhot9C
zFtE2p%=+CRMW?<hK{sTV2vWv~H^<GBM%nx0506^VCKw_t=Pw0Y6<rLw*F7)UYaru}
z-TH^d&s4T%uh}|zqPxYFJ{JY-e^0~id(^ib5+0W<QuR;us1-~O*_2X(SAp1&jK|5N
z@Oc|#<@WF4n7&gXotcVo`%QE-#dL7(UNEN0F`DYZ?8HJ_xGIe3$zK(!{r<rd%C2jX
zu3y(%uk*XcEKk?#ljG6yd*zU}nf;2H?MWe4FxjW3oqDgwIM?e`=wHNn7*M)4$ObbY
zoX1~_)tRimEI`S_AJo-wl2*k?)CS07gXmI12eQ=N()^_|;Bd)g@v@e3$*EG?im=7O
zkW~as%PBny98e+5v6VYgs?(VO337_Vgf3@iad2jQdy(|r(e-|bH$JCClS##<r#<Ls
z5?Hl1cV9RpS1d7<-Gu}UP5Q}TLFS)`YDJl{wrCsl<1^~lKSP1Gb0sDB^lB1j%B6^3
z91tccr&5|*KUK9jmocx|fyEbA<S_;6&;=wQMco$-Dl4`Hpbe)yn@f&&0}NSg_K6_p
zs>UsLemPo+d_T+4f|wh|GX|!G1KI)E=z?Hgb_r?3(W4G6#V}H$ovJf<ABhSc4$0^d
zl}Yw^njrxcg4%FiO}GkJ3rOVb_x_Q35$zI-j7Mb4dhZ;F)xvXS@?=k!h|-LAHAyn>
zY&h&EZm2x7`SV_9moO+pqAbeikSHV2Sv07of?I<@5?H;vnDFtlu&roU3A=1C)oyJQ
z<tm}99VYvdvOep!luQcM2|^-4{(Xi=6OCotCL3TJD6O-t?#s4RPO7MgEU`C25B1RM
zv^yD+$t3`K6J_Ojxr&}4MBgw75Buv~LHFdXG<r{-KO8?rsvqPwxm3$k=d?^`aKsQM
zxa8xI)al{G(CXxB*og*0MtGiT4dezv-qfTqLT?h~B9D0!IN|qa5CxD}=-eNUzEr_k
z$K5hfKAOZwMw5!V+bDWJ9g6{4rKYuP>f~`jc}<+4Mw9oAF9YR2%cH2r)qJ|0<+vS3
zQx2Nq{%{F|ayG?wuW*SCSXHlNu5#qaG0EUWt|t}kqJ*{{Uha4|RYVzvL71vH_D$8!
zNcbM7DCb(M7A|VO8J#O77u7kE0Q~!9IO>&zedHH>OxB`yNvH?iBIiMQCZpu+q;wAm
z@S{H{od=8XIxM(aQju~PHgV6!)mw2w73Y#?mpMKOl)&E7yTQ?C8<6(iF%bqvZN@-g
z|GXoW7bqIlk@*qlLgiaCOQ)?P;FOY~tDJfTzu!>G{(B~VvWM}sS5!mSW2DoSv)M5k
zeapzk!qs~i4eZ71EJN<H3>!cbVHZr756I+wDXXo%#)KK0V27}=9sP;k*XZD$_+1@D
zpeH9dsMpXAM{TQdc0P)K)X4)96*nS$BhkmbsgM3#w7B)gPmLY)vV)lu<&~pse9;Ab
z)Xtim%nfD~pwb7}CF>U$GdnrPA04-*JnKal(5Ij)9HpXF#W3y#mDZN^sM!TWEaGI6
z33A0tw8#@5X%?ozi5aI9<_2o+I88y{N*5V~we7H1xyy-)>1m~AWXz-E!=w5uEXiI!
zeEEm@3q2_1B$G6thiO0uRDdwGIa;HwtQ+ba3sRTRC`X|bK;QiydHSOuV~0Jk8=Lqu
zQk`omMW9c+w(aI7+|sB=QMcsmH$-YWp&L3oF=i`5lj@lV(fgqX>u^k_9qqQjA<O1t
zDtmYD8Z|5L7OtVK*H9fzhtW7;C5B<jkUWyh@^9=-_nY@@=KIj%{(YNgWP(f?(!5n@
z4Bgz#?*QI@``f#x&YPs|;al}N$O2>F_35uvD}V|A?kd9Zqx&z>>)m0mLSHbFk-t$+
z4)v{Dk&es=A1w~mWO^g>aQ;fHcgc8XIEZl^T!hgSlaw;5gd-hFj>=;8t5YY~js`8<
zH%0p0#B=rp-cZd2boORy<+QALz|h~rvjIdW>|uxD#2M9IH0l^iceCS_U7j6b<6J8&
z)#ESZ+@~*Jyl$*K;nv+~#jDJ^0hhT**~5&;O2%!@Jj>XW%_BrJ*4n3XIokNnCg1#K
zY2|-z8cElRz<a(Iot5_X+HdN|2UtDLLGl%3REJ@Lhy(lx$KGO%AEr6qBu~5*_XXG8
zVm!FQ;`X$^CD+{2IypK#XzaGJOx@4zy~aT~-4$_{{)7@sNxU!f{My&n9;_8iXgrl!
zvy|zNvgcM;+!Z>`;TFUA(cP6Ia%g40E0cj-!mTZisqARN*z-t7<%T24l_Np+?qfJO
z%5jcPm*R@Z(amJtcY-(B#UvApvKuC2f@NINoL!Flf|K56wTl!rKQUsL$Q@NArzDrC
z;?AbtffEIgNSWGH&PBOwp+S|w`$x82&UN!tza>}*L~5+|&^(k?!bABD+8}Kp5>w$t
zt>Q9>MDxGhvaR&A$;4f$!y;s_IpSg+NM93H?<WcQpmwH%_b)j8#}uC>y=32i9~?)~
z5F_+dZXMb`r4R(+5JVbI8d6d2WSS{vZ!jNlMP>P?LZ4bLOm#r%S?ufs`o5Q{T2}g&
z4o95ZT?yC#7*yxWyMTA27|uDa7vlsIi@D&;rb<?aj#W?6zewxT5$EEiKut+|9bnAj
z9=V63bA=8816aWgc8MPQ=iylOCzlqX7RS6vEClzdIGszMglvpa!OIM`$<(#uj@0>z
zgA{uQd)OHSLt}J{uUPZm7<D5QNja?=Unr_Kju0m)o;=wl-;N2m<oTH#sFvgrYWCeN
z0jKXr%^iiz9fiOh37WzmE+d2)8!^98kM+ltDL{l71=uKhZ{Vr`%J^i=51v#dq)Ho!
zV*mSmcd!ltPd{v0&AG>kPV!ND8@^lH*6(b4HJ5Dy5Dj?;8NAwO+q|B-@LjEg(sXdD
z6b|D+0#vcINq9++mZVPzmnaMBJt0>2Om_l@kxv02ioRCtf-gFTpTMHXt}>CXNS|x|
zI9%cAXe*fu2Q$X1tfOEYvrCrel)VsLBGAWl<sX8c&i9y@#PO8Pe0>1uz780V*-A#D
ziIY>WZ4@>k=~4=pFgd5Px`-qd8$~QRRB0w~J!cYlZ1Y?c(#(26-;|PM@dNj$8=Z~N
zqd}c9-!655Afu(Ou&^R>2*S+1(3=UyXCKMpk6DFA98=1a@G6+dwS_PI82Z4psG?eK
zjyGh`MeCo+mRCt<Zf4T<NjK!pU5|@hbVeaQ^GZ!854LYLDVP<cq2VOAK8gd(L&eWZ
z45*5?Uze_5oW6Y7I4+x+SV^!^(6X~(=U>XSHP&^^x*Myo8!HmTH$n-<j$8G98xvwq
z0DIUISTsLC)%9f;QQ@f}u2xZC5TVwre&{|`O3?M$oB=-6t}(bm;3lU-N<8yfj16CZ
z?d>SS#4&|p%*zB#sN_A`z6y|p8*AwDnu($qFO3VL6wf@LOvcHR^>sQ+)i7G0MB}iV
zs4ALkaE9XOGet~@cj_n_t^FRvk;5y<%q6sx6KZt_s1DM10Tq%$n(UD2ife|}#EB_d
zM9Icf#sousmC*%hvouobIw|`~Ds-M^j@=V*GM}W)5J3f_X3HSy16@W(;thp%Z&?3a
zMB^P+lU?fhD99w?S`z1@M5+2h1~%OdY*BJA!Gim*VlEMxL#pHn+VvAtNKS1E-4PrN
zF|mp>&%7nd+QLFicq$x(9RSp#IW$C8NU;V2f_{WSx;U<!2j#t_IG)9BE85Fd%>dai
zX&QypuZC1)fp(jw-A6ScG%7w(^HvVToq$smarQhyW`xQm2RlUMz9hy4+F0sIvmjaa
zLoqO#vl4@j@us)sQ(co7Ib_Zq_aT+kLq$XA<rO9qf;qVU081W-KmPE(qF1cD$mqOP
zx0qo2ndLJqmsFNBP<pX!c?a|$B>xn&boLScmTDDR>RSN~=k&K7r9%xdSyON+4xze<
zcVFJ8KeoMZYu{~p-}66Dte%W^r|7n>sO~kNEu<#l1--SWdH?=9m<0ePZQ_F6)}h04
z5mDSQG3UM#0G-5++Ag57Xebk>rU?AAoioqKYnr2-I5GgGBI<h*CknG#Bi|Kq0+b#p
zv#U;vuTrPUsFd&lqg7cfDM?g}#y3i$HpR?UziB@bdY}8&8Z|7tyE=*92P6Cu{z`z?
zo(zIfDX9QB=u5e>;;mF_mAllVYyb&*mI_=7zNB>BJT2s)cnn9K%?7ARj6z#?I4(^p
zE94lo0@Oz{f;;=W>@Q>9BQJ@ZmoW(g9_`HgsO>sD*!y{Y7k+OTjxz7pclVnI^Iz@-
zqpP(j8fM<#Z5;f3c(}h{51iyI)5*bMYv;Imbh5xA2IQj_Q5E$}KYNGu-R8lo`Q41C
zon+d{ynl51qILRWf!zQs&4I;n{a|+yQ1Bv>i9g8VL+hlzw*WqjqP1ZJ(m@nwd-$Pw
z)ZRY?f#vXcp^l`;d45N&y~8(qhYNrd>;GlCcv){Pu&FQy%t(-f7FdJj_52Qo{?(ec
zz-PMIum5b4zs&E<W}Px!@tyXnae`OcLMxN}T}55N8h7?iTPKb5URfSo9~C)6eKrv>
zpy4H^Iu)C6;S7F5W|MzZ-0E75vo)iFl-?p{LzJYLFju)Tm~tolqDrOYBur8X&$LS1
zx)<1hp#%We+$q&)t+aDlADesl%RR$fI+;u4P3j~XVQP?U+Va_cH<oj{b@x%d7cz%)
z{?N`exx$OfS9h71%Vhs9QFS=>5ptHNPTIY`z`NgpoKqQE3yd~rteo0KG_V+Xx0be2
zo3T*AIqr1jahq{H9PI(^bke@>=nb()j;0e;IYIhPjhJ>j5<fB9i&b+Gs;P<yaF}_U
ziKokb|4R6m_OYcbnx93%PQB)oU68V$4Dw_;2JT7H=Q_1JGrm@OAvRCr-Gd`e-|nd*
z$+RAoSV@6P3&Z4AMgh&D4rJUxG0pdO6k~=AIZX?*c#{r2K{k<Hs6jMRqEMfsbCpQJ
zT!p8v=W2Goz-uWG!~d-cAF{gogaB^u6B;Ron3zi33sn)iQpo9($qxe0h%FXbAM%k2
zC*`UhOS3IBoIRF0s5A(@NK807Z?H=eO*1iFG5eA?Z9KXlQR8!wZH?yGE8)aB+fu=-
z9dDW#GdN<_37vas;wSGDYe^c^nI+*!r~>nQJyi}!1%+!Afc-C+2J{=6BaSJjF?W%a
zk&Q+@5&7JC2tUP8*(Hsd%7g1zEy-z#8`~gtm?`X}o_(3a867VyPhR09ZUyVX51Bx;
zx*n+nk$LpL!niACA5e%kqbChLULPOdcsjBR$%72r?9(X8G%f-&ftmoN>m%baF+dU4
zP!P@DUwDGLdRAXh8HbT~H0`XnrX9ktQ82K8D?DOOKZqyfZv-ce5+hA;yT?FqDd80-
z5i=Eyb5EINRvAx?b&w;zbc{e|ubJn>Ii(Mf3snp_9{3l5*jNZ)g#abI@ThA^>$j@`
z4EHW3bYO_11W0~qg<VZ_m25L}i`B)6bKk}z#uiuc#^k0|N>sttj(*W__N$m@59DGD
z(-4I8hmqX18oJJ;6x(bj1%G7@9&Hr2{M>UQ4qOpPXM-uhxTt)>iH_YnBV|EcFcsMO
zk#|^viI)z5dF3d{19g4d<*~c$SHlFfpf~N;NzARIhOoRX5@2-vP6!<CRY5;tl1u|b
zI#dN;4FsEe&)~VzZ>nlYN^eF=N4$?_Af^R!PiI5ms->qo?ExL#^<)x_$qZQ7oeG{D
zMboo$ZQ^!02QRrAP5ciI&M9Fcy)u<BB{Jz+O-`j9eyM0OqC-|(T%xlgkkOhT9Zu97
zD~bWh`v_A~;h;~IoKDoaDIK;_9p`;m^9x7(EcS;cwFL*^adk)vGa&U6AXZU7oHh~O
zN+f}l0wYPAnlf7l7LBEt%VJ8QTt1fGU9*$r>Ea?qLmm(wljEqB@R<r~>BFd!+$TX1
zBSpNaHLO+kS1-erc^M(BmEa}A36LhP!!R&N{eIZ3&|Nd*lAN3qZieVD$Q~KYYU-NV
zI2CP3arKV5thybt!QmP?<x0B49!d*tYsGLgQ%|OL9UY7&cl`$<4jem6Q|RagRX^VM
zMXE;9HLjLb!!l=)puRw~mVTatKs`Hd0UMW;GCWt<M;Be?;wgu^9ng{KEgD%oyJi|T
znPDV18dAyq#~M-)PfOx+=W5SGmozDn8AW9`*#pJcC_Iq9%Xx`(M4h4AWFp53LTB~7
zRQ?Gyr<E}-Zl!`8Yxi879CSq^b?S8Ccst&~UK)ip8OIK`*1$Q!B<uDGM(UVQ>R0Xt
zJqO8!E0|mc!AOVP=&-N~Q5VevSyFLC^1bSanQj?ctb~-3j2^32CTi_6(1v%{S&;*@
z?%5s>_uQ%(+!e~BR4^-*rBn00gfy<D2;U@Ei*!zn?zpTx4YX^7vd%b;65?op&-l!n
z-xU_;bgv%SgQ(xwU6eb-Z+R^c2<YB1!yPm4H9rn1aB{7d_f*jr(eGI&KCiXCALy$>
zPhKh8P}I%(t&DRA6*7q9%GbPRLLV_C)-P-%bd%$5@mpS_Vc3nMBtTizGP1aB$fLLD
zVI2HM{>tr{tuS##whcypVYs{^naVE=s0gJ`6CzTv`zq(YiWQ35%e?PSFGQ@Y@9Y^L
zr{=DqVdS*4YwWMkFs)O~4^+E3M-A~s5uK@1@l#0xTr!9_;m_bCqKwF`V8WBAPvCOx
z6d04UTtP@quCZwF#^FU^2XRW7F?K1U2!%4`IR@ZzXy>mMsrl8SS}FReT>tzL%K;-R
zK31hf&qPfoR=k?!wnT#N?4occ(%PDyxfX51x2BnC+Q$#dj!U$rd2)FR17qE&svW9s
zo+Du0pBcdLgul2CDO0jU)AM~>O7)7E-np971h2(eEmZx5S#81*kpx2#tOuCZJNrN-
zmd|;kAGN!k?1Ns=kNq>}k-b~bJ++x1i(H|sE8Ag_@R%*?k;IsD0I$D*S4-&wqRs;H
zZah>j`=%(LMCbOL=v+bUig~}R8A4*pG7p4!^)$|=fI$3$R5&|5X#T{61_M*V0c<MY
z8njN6za3V)Z#^Yv!<3)ZFu{IGI$~qr2a#0DP7>pWqd3N<si@XTM?u;6xef7HT}r8>
z+@6AgKgQPVG!{w~L>A;#6*^TqXP-$X7KUq}V}<e8qP@kK8l~*<hnDgmm0!sA5$+B#
z9s#xX<hD;1qvBzxRK560&YR60rbAQ>P|5+qHV2rgeKb*90Y~h@A0)b3rl~(?m7Y_z
zzXK5edb8~#7ShgMgGCRs<*H@BWiR-JyQNNdZ983=uk4~?{yn-Jf&_9S3j8#N%s>x5
z%8O+5%0QD`vt}45F&}`z*h{V|p@IkpS2`0zi8Q1kpP-qb=Lqj;qU?v|MK-PB3h;$n
zw!Y3WxdB_7*)p(!Ka5mFE#8$Tb;iu88dtL1y<bQ;Ouebl8uR7JW}YVbsI>rQ0XriM
zKJ5dif*!N7G7PAuvo--@tv70`jELFNCaw1C`oS*z**wGr93HpONawxcoYjM?is3$-
z5cv)(wRBSLio#_v=QEzG9H(4~hUh_`L_A-WW!5>8&N=ULMP<-7HW6`5B+~$PhFYXG
zz>D`VtAxx(T1yDMi}s?bY^EyN32P>iMRL6}n}-dW2uF+J%wRGSzvDQUni8&v%`xTc
z73I2$rlloSETaIxe>%SO$!to==FxJ=rZ=OOG}(y9XmBC5ok_bViLB`50jt66w8VuQ
zJF8|5ZLunln63j<DszUs4F9asx)nNOs**n{QAA#Oo#(2R#%HegW3(KSC~GJ)VmlK?
z@WRTG_Z<gZl%*6_gQ^`u{HA`g^ZJfxE+qJYoDaHw7ghdc$G1U++vKDzmRyb542^i%
zVu1|U`RNF;PhH`>rX_cQ>?$49(V%gga82&w49H>XhG1rQY*Cj4SeC=OWjeB=Q!CbY
zm3Ar1h<za`vaU8sS)zff@y|GD!Ab`D8Kg*9O@mDce(@Y~Q>LYSW`sPFj>HKw^Rsp#
zoyJti&4`P~l2Jc33pF%(^9${(%$h5g6PDT+4(^jz*B$NCPpqO;b2i#T<tHLF=7E{$
zy0%Z9)4PefM<)Lq4NC+)7=(NiNOW_+t|pE*mUge#@hVn&P@8(|YBj`pZn_WM@;B6C
zE89X8?&UlAaWcp=1MhFKZ0x;01HNh#gqhQ^M1v?A3z-{Y3GLAoZhTD3V3Bh>&$r_V
zU;qEv`}c-6t}I^w{okLW!kjh|5%|$PeP(c+Tp47C2?h?}JUWvDg;YSrl1i<Tj7i7y
zS?*`KpX~1S+-vWul7wTs(|wwmjzOy0&$ZWH&)-t;fQ8UJKKQ*RzpMM|^ziIu@8#j~
z4{}hug8_%paRRZqkm~W=D`@I|m>%E&%v_DP1l9ko)HqlneBVr<T@BL5SJTm7=h-|v
zBV=T@_sWM(lMDi<qwkW93hH&`kuQ=*e{NUbeCj@aQrj@tPo#>4{k+506n3BR{-T!L
z-l&Y)#$Vbmf2>UUr!5R_dy32aWTh7-h-u~iTYVg#`26!ws~HQiK&}r$|Fg;o1fb+Y
zvsC{Dl^)aM1c&3206Q>*#hsry(is^qZjtG&hD6DO0ii7I&!`nbqO`-JbBdZwQ4E)Z
zQF>wqF7e68S;68py8uk{)h&6{e(=~N2}D>q^@#%dBnn0NF#h(1qk8<UilOs>(*EQH
zhFB#OQv8rZ1sK%@ee(8aLtcHvuVQvK0I}oef{oPrCBNGI1?opbzA}nxHi=x;1M=Nl
z)F39~d{uYoH(g(w$<N?2{rO4QM0B8k%;m7qX|ZTUbw?SV$FqWmCCpy`+tN4rSO(QQ
zU!FZb?)7$g%cF%qL8MW-5%H8U1g*yKf+IyfG{v@^LV2Uu4dG_YuK8R#@pYVmnwCy;
zI&?RgCdxj*gNgZ%aA(CkAxoKKfOow9;F7K`M$LjGPnR&J%|{U|6a2iZT`G4t=PZWU
zcp#dpM76jXW;rUYgy;)T%!*0fI>|~yj1a{exkJFLZdSJ*)xmF8#~vb)`Wc14y|d!=
zLvP;XOPQfTMf`HRgq_yi!i%c&eTYjJydZ8=lp$>%Bc)x#0~s2?vRoT;ua4`Rj3LSj
zxfvi}q%7vseugLx@Ez4)0ya^(aiksEbu7v?ea+@IC**+;%lDP{9Gi(hP5x)0z=X>M
zY_=gcE2e-7`_(HVru?6gt$3<nh~fAdi#LpekD<dIJ2^Q$-aB})4f)Q~<Lq(=?g6SB
zW%D?i-iG9qAGWKdBUf(Vn;yNca{0<{?(XfJZU@y4!MNX9`F*I^wp~;5u(=g`+U_7X
z!{Y{Ri}$Bp6`f+-g;-#G*dT2sCPn+h>9VXxpM=UA;0k{nojIt=A|^Q7c~p9dzZ0Dq
zk133-QoPLSY+{9}s$-yNdOM)VklYDaak!o=AdD1~ThTnv-PW9QX(Su{?Bv&TM?~ja
z$w6V_Q%G(kAbIv?a889HL}=fdW=}XNR8$-Cq$eDrFTrwd_EP-_oHjQMqDv#j!RSI#
zY`%qGDcx)`U&GEq_H>kC;z~hFRoxYtEN6hHZ_<27K}aHT$S(1Fv{~2^HZf2!9yx4{
z0ZJqEcng=h;%$XMqrTNNUD)yniXw!S1HA^tBA|D8hdL{CU&~QDMQHXa<b*DzbFLSV
zOx$O)%Y>pJxbUcroL+hwRyztvAn$t`e7YMrb!n(Gi=5~_b^_uXnoFx~TVuix={url
z5jk%OKBNY;As~)+GAR0UQ}_W5eNzf1S&_nyXsAo+42ukJZEabvHfL)iAiW~M`hvqx
z<Zt8@t#sn_pOIuh^1EiWO8mM*m5TYzY&>Y;-^+=b$(gbDfh3diLlAY9s<pgiWn(<C
zL3)&gK`TEJjwvLs9`<_}-8jpxkR_4I2aGFyjdgJZpAJo+?p7LN4FOABO$Wo*`df51
z&?QDSfZ-HipR3t&f2TwZfx`Q4UEzQAr0s(nhC?+D0-?L5{&D~C;02HX)-q!q%d=RB
zei=Tdg>JdW#ZcvbZFgL2q4_`J=g>L4Lmc<rhohxIF~87+(%(4&t-gu7IIH?Cq!}lJ
z%Jw~a{2z6jHfY+j!QW}i<mA&t{&k#}9_K~WfM=OWVmKhn<MrH4^U`Uy<H7K@LM8ya
zh9`aZ@YOTWWWMempVXfAM#>ouJS1)_=q>pw+22JT^7X5i-GgLX{sdhq4v_go1UE+e
zLbO}d#J`AdA@MC2#%tO!)u9^%m%)4zh~iW=`Xh?rhBlZ7QBk5~Z+Ee}8SH($<iADZ
zj5Zx&g3lW_eG5Y}KH;XjrP<qEecSQzWWxtXmhu_>f+6XD%OOM`Ql#9!W%k#1l@y>R
z*)|x|eQ9!aimA7Sb&@8ULA?01UTF)f+C!L#1sV=&k79y=`s%q8&;~<Cxk0JIs+uKb
z({j#D1bTt#*A$A<%v?|y@>EAvnJhjp4?qGAmB_m%-6O8ZiI#Bk#j&*(>ox=S1HEkh
z!5*Jk=5iVIlX^{(A>NS01CA&4eyEg%Uxj;;{{x$xasg;u0qR~AQ|b$gYryj)|7jr^
zHeX=Ofz)fgrCi<i7F)k6qg3OG=Js<za~vaeB7r_?%r1-ALUT#<6dGrwZHVQXcF6HB
zr~qo!!7wqNie0iG0>H4LRl|J@iw+FJD=}hndp5ITYJ`qb?+w6=i}gOBWj5U7#LWf*
zc*#1Jzsjd#WE)$=3TdqIBDV09=wQD!K4s}=%jBm8<}Z8@_bH%ZIrqT@uNia;f<DmW
zO5q!hTP(UlXl5;61K!v62_i1kx}vGPfjO|sG~l#!<dkCcw}uo4K{X!415?Lm(|KmX
zYkqK@ASlENAudvi_lJs|vWEFlUEZRMzoXD}dP{;!hY;Vlff1P-LC^{33Co;YCS0a5
zj;fv5T9+e@Tj4psD(BJa5|*W>E?-GS7)LMzwr&*A!W59y8An7iemXX&hj^L}kj^~Z
z7Vr-4m8m0Yax3Aj>OKGl0tqz5<z>epT#VU#4&2Y5B%p02LrS;TrAdS9LIdsr8&W5z
z&)}F~lS)%$MFWH4P>l}5OpJ@9dJytbkZue%`6_p0%@q^y%V4_i!7+t3a?Mag3cVY5
zjBxn(#{DTr;CY7Qoe9W6kgCS&k?*I7cOpL<#4qUDwy`gIdkbE?oGsia0e$k#pfu1Q
zra3Hn^4;|<mkxu+JJ!O2{pB+7AgW-49kfydV9dl;vcF)M#Vj`rxAX1b=6dM@qst9Y
zFn55Y#ZLh`#54=0gkjQOCC{`pI@hNJum8Bz%xkk~(sHF0AihTsDWl79Rj@4dnClr1
zrUjNN!)qNrdlbwlJQS5X(F6W7$}TX7$RAD(4P(8S)~^dO^8>0TLV1S}{T>!x7}s9-
zTsvXoUX1X@h!a$M(a$`r+G82W);)G?0Wh>62=z0~JIC;fn}Tp!(ply7DwlEXU=j<&
ztzxi6S}y1owI|5UwP+>j*fj#G)|AqRHj;Y{QDdn>{Drc`3D*wMoPDT>F>tLg+$;w1
zLgA1Z3oWQ@E)`N(EWEc72+B(Ydkjs_OT1zgfnHeLJpt}s{Jus4OX3%YzF>m?0^!8<
z79U*DF)<)$rVATY`$Y9K12m7E*jqYo)L)Igp$*F`!8vYD=&}^9kBR~YG?jsic0P8u
z@(}*KS7+$KU5CXRym5EATM!@*@oPoHCMbrPYiEQ3ZS427_fDKHQhWRgD%Y{$%?mXK
zC|tSszS!>7sr8sD@O3d9{I*NZ{b}m5xa*F5Ox@GHowMWK^PR(22dDNbt2gUeoMh<N
zvYdMh7*a(8v3I6rg-3I}IBNnsE%}R2eD-$h-v96ao0$K{9iYutkWIWur<m_e8{wVh
zZc#V}6WCRyE%)kULdoDlLj$a;?yKYQ%d;CO{)_;WtesSvk{asOdEqO1al|iH8sfVg
zPCUXW6-FDF<^Vr_*&swzno^;{4yPqJ_>qLw{;Kjm!vGC1_v(hBu0RvtUOI~~;GODd
z#LqZ7cm(m3HP+>1ZI+d@wNCP<`u85wd*<i}$v&!iA=JHBeduxZp(-(68c87-5Rw#H
zBjU|6_RUIr(Pnix<3cnKAW`DBDdmi!NKdv74v((T<v3Zdo7%cBhvoW|F|(lwZ@iUS
zax1yMoTg6-N_#8QOS-qcR9ZP~m6tKnVlc4dBv30Q>GaA`@$yleqIf;Z+3f1?4}mPZ
z+r3e@Kz@u{hVyxuZdEI}<-LYumk?w~2Adc88_aVPJ2=@ui4k<7`zQd_r{`IQl3Y9T
zw}z&a$lxwgmwBAcZB+SN>r<h?gZZJT2N9)m0uo6Gk{F2Mu8rY<)Hn+Im`$P1<099E
z1{H0Xs3N`%Mdb^EEloe!bUG>lNn#Dd3r$G_%&Qh$CtnV;y%uJbV3!-@eJiN|0JT{K
zpQ6w0W>y*)lvqIkZt=-1N+Fg{KTbg5*X}0GKwx~64b>(x$tc_T!v+>=Tp<8%PXiU2
zO%p!kfkRC?T7ECbnrY`7!{PZBndYjw?}y(Y*eGSwZ$+kU)WZofdCF*ch?<P4r+9JX
z{h1j-3sUF-Jh|jd;s?m*+o6x5cYMq?{5k**BG%JF13ea#v+sPvhkSS{a1TBn4wXte
zG1Wk1NAgv?BBuV|U4AM_@$Z)G9XYnE8#Y*Rzd&tiLRyz7H?ly@WY;Q%NEE+ZhC{}H
zx-DTx{o)PbMmE%2293B4fimk)p#}@J0&=tWkH*0oEqUQ-vg4*)w?%hfZ4*mSb4Grr
zYi<H0RyYW<_`~|umjf|abReRw;Fmwd29)BJt}cJR^732o@`d}rJZ8mxC_|6A)Y{tH
zEt9p+*AgyOu(r8IwV(*DnE(T#9aCTK;{Cd-kNJtcs@*3?z>-}r*qC=4`y=BoadJ)5
z{^L_yqw-1cZJGVme(nCO+{kgpJKoHMCS28#>!BlsK1LICz}ys(OQgf^!$+HsI>|#g
zYmdMh&)5fOAf{OGFOrLn`^U`||NSz#@P5ve3v6NKJBVrrYZm?s$>=xebiK&ODU=8v
z78fO&9>8%4mfVcX+q%ooHS++$l^MTnHiMYh>M7+JwQ9CHt+hm4L>Cng_QXVul&!RL
z(XK&xYO%b1>yaYzv5vaUfaK(76!rR2ykW|rlKHs2hV`-ONfen8UCTAYC+V(>cE?xT
zPSqB(lG)|6r%8}Fw?YMWMt0-fAjcUhcYq|fIT>Q@29@ujn1ae?aRGETImJGSL4*{w
zl^jthfY0Sb{XS|90SAxv++e`|#zkGmAXcqa1zeva^DbN(r9ZYv^$vCpp{UYX@8vV6
z=S0pGs&jYE)s)xVFki2cKI~n}KF>Z87#C|`V$*k>-!B_oWP^cs{IQ)zGFgm@CijQp
zpxH~Ma><zGh~^wl`MCRCz-X2)(q3q@tG|w@P6h{NgBv})(F3$#R`43!vhcrF3!y<H
z?c)v;YEV!~Ri?petsD;X<y4!}L=tS-j0TD7LVv1A@IK)Ot;i)>U1BI+);Ym9dc{P)
zptKI&v^BML{4o>DfI2uUEHf}A-@$+zW-mZEWlfgMtAkf3z1^0tLyO97vVd)ccG*A|
zUUa2}^x@7}K=nS@bHO$GkrLi8fl>0@>Ht2p5H4^nCkqWkm4}2;0U%bab!g#bVE|mp
zh1hfuB_s|Q0_W5S!*zOLJ&I$Ya#ucewzeQDv=Nsa-P+o6y&>cuhj(B)i#%diKJcx%
z<pIz@uVp%#8{KL#uaA)%cmgLo9Www}dQq@te>`_=7V8%I3I|tcs0x9g5m}|5Yt4ob
z44g}yV%sAKth~y$8pLVY(O!KOSE$+q7xN$6bxZf%)Gb#R@R;R*`Lk`lTabM1t|nZ6
z#2<T(*;WAnld{sa8)&a~eSm7$|4^>WBCMH+ZGvD8V4R>N)sGK<s<9N+pGS+TNq|~{
z69d_j=mT&Q*f=-mfz5g|*HuRK2`aS+(0+Sv26o<2W^B6RXhuL!61h#YC>hrB+9o<?
zio-U$MhhYsjKzgklAA}Bp=6L#tvT=;7f#3VMHK*JLdqH2lDOC$!CM;WFMfvuj;ZH1
z#Rsw*9iF-%%)w|CEeN~<z}F1EgHT~<atTp%c6FSrgNuolcn01Kutk}ZZ6*5@faqa-
zs1=led2pN|s%;G9ZPYYC+r!JsC%Y2dO2i&(-R`DGu>=DwC~@0DfbRt-01e9$9*x_^
zdp2=W-guV#KFP_%7=ko80J4}0A3#pQA(*J%)-0|HgIpL&O5JOGC@&ATWw(!udwU8~
z^(m$(j<f^WU`)$tyWv_#xc7hpS!yU1fh%#RtZux>W_aibzH%A3!$N3>)32dw>)A>7
zc`s0t<vpJG84Vx=JQ0np`W$FAZhZWg7YIRet!u()0I?eVfMbjqA{!u%>yHO}$s%SI
z1}m|!H%EY(@Op&^l3OMw8=ap*l|`wDK<z}F#&8!d#e?;9B%+fjNXa3HdLqi;a(cM&
z+FBrd+m*I!`c45s={glbp8ODj=+g0pio7)KEyiSYs~p}yvZ>si=DMp&5vwO9GHv%&
zE{*8h3$I9)3*}KU$H>L%g_>&OV#9R@OQ&l^Ld3fJXT2Jdi64`$0ow*qPy)`vFre-d
z8O{f}4<6@3&+YcHQe3d&sD4bQ#hZMPmBA}(n`>~VNK2$z1L~@YEw%DXt&oR;21<Bq
zpu3=ylAPX7vNbJEiE@;qU^q~BX|JxWI}p>oI%=Zkm!@vJ)%+yX6o_e^waq`2YaQtO
zZgd68CA#BTF>RfH4x;;iPyc&-j&T*elOrI3S<x?sZRSbQJzUOns;PqXLIuD0E_Ka=
ztc76kY}zZuI}bkBQA*frP=)>)A#9QTtQ~%{mLSj<6`K^X;qE(Gw~;3}<3&+Qc0a)n
z`YHDF2o@Q3^7FOMqjvpwZY)xw9fsBL)EeyGTIcayNnuR5X#_szE|YcF&$@t5l^(`}
zJ})$YujK5Jb6w#Ls4#Imw2CcqCW`tGbj)m&bEqx%gXCaf+yX>VM~Q=ZA1MpID}{)?
zE+SZ2a=`-kfZ{@9c70y6%V1_{h@(vz8a2F}K)R#2+|b-|ba--lba>F)J?kDHcYiqB
z?;Ut#5*9@(!z#HeXpDk&0c*FC;)x4+lFhm>$$gAZXtk3TMT25oOG#0Y(vDl(H2?@+
z;}|a$RN;K8)fA+?_6IsdIJ89<tGD}nlw-qj2k`8YU8!JfPKt6iaceO+V<L(%G2;g$
z3mL*cH`*J4)CfQIZ=K;*eE!IqRcjyoalz|9B~OFy<gD+4sy59A7+A8b10Koe4Pvdd
zDbxn?Nd)q_0uKo!Jbx}BuA0yo@uIn<kN9T!Bi8Nn56S0`KM;`~xRx6U^^<UQKZ5@1
z?6__z#|Z+zFi%WA%=+}8$-nOcIbtJ|?-tGvr?<*V;dM|e2GV@mT4hq%xtOU|;^YRV
z(NyX6cZe|&@{N_xvQa7ezNTnU31d**^a=<;N`vS&Xo`>p(X@hUdLhi7&qxR-aw4{&
zD3TkK=9Kf(n_@>6O9!sZe2mv4-Xz#^9B_9vPp7F<=EwleL?%Px%g2sPlaFl%F2Z*z
zUxHK^nZR?Cjb;S{SvZkOP%!-QQRl};4?B+^cK-PAr=Q$nlSKurVpxXL>IjRdBMw%q
zyEdLIZYVHOKU((mN9y+BogRODx5xju@bO4I!55&?+XE~K0#~!6bJ;5|%B|ko<4S9@
zVnPj7v|ou-zks-8p(bmpqiVN6S3-pTL|M`&Q|nE}k|v~aUgmEd#a2Z*f&t;4Cs@6`
zuZB)^M1$={T;NdOeFo{cQ<j|Z7=g*gWP=LPi)QUbSU3FJuoe%TD99>dpxNs9!m=54
ztNcl%w;->gNj6~w<vRr&fKPvvm$1NtY=$KieT-}JhjKd(1XwO%8wCIir&45SX+w8A
z;c;`&>(*K)EKm{^fA#mF70VW^s3872MlG_Uk?(?b?=F;v?^o~)SKeiVTpGWzOr{O+
zOyAWRHZJDF*KBR*2sT$f=0Kb@*%AMJH5U9s*%`3!Mb7jUoaP@@_<H7+Xom;b@34pN
z4*v1qwBF3#D0;bclG%W>SwSDz)DlgD540OQs~UU&YwD9Nz9jsZ#sAO?Uyaycf6<4e
z^7qO1`{=6+y2YxFWorf_O{<jDmk*|CH80iQL)8MZxjU_~5f|KDLULr5Vn;hWr?ax3
zLPk1dl4BWD_dCioe+NGNZ8p7dBGwAHVt+qQEMs(glwkiuKu=kly`8Q7HoE~1;RBje
z{;rmkyBJZN7J%^-STjD2YQSrd+`Oz>Ujb>J(1feG<xbkXoDbEtA1Bt)t6??y4e`H9
zKokdypf^{6YHHl1It4cLV%jV{cawQcFo6W1c0bf@sc8Gl7`r~1Y~a{FDlq^KGJ2ze
zfL81mi`dVKPGbM^a*UAC$)I#+48L5hyd`+E!<;%@`98(4it@%;9_xd3$*eFpb3Hj-
zq$L-$0u+Zg=`ds1BHyy+qClGzWFMw)2m@8`!#FHoW=u=9ic27-w!OK`pxAy;c6=w4
z*^kLlB!8y@N&A~A!6yBz4?}wJQNUa8Ne`xVirukTNPiEaAe0N5E)Qc4NwSF1irKU1
z9%cl0bTgM3j{RKr;%j)+Csm>Ed7RAvM+R1^|DoJgcLTQlBxD#(9VCD_+3OQUC-2Y|
z!VZ4UP3Ru&eVn-4ue0IAqWSYB2>oWs%UAoSdqk>Op^|DpXXXjGOtD&<iB$|@>*TK2
zLe*PI@B7}4;sSsbf2j9obP{+ecJp$Q&idDQ2s~br*wu&@j%7?Q!Q8%gd4MQNiv%TL
zC$IAfhmu|T`yLv~QEHi{lOQMzPav)eL?mMF5d74|p_1X9Oj#G0KhU4%6Q3A@vGizP
z+semh8Ke>Z`fFl7aSK){t+dBAxd^5Ny!K#kqitd;1t8D5PPG2;nQMGDO~+;0CnUUT
zA3nIQHn5Ix!9d3lxd|7FC$6=dG~f-nArA5Z>^+8*-lBuXqa2o!UlF&$IL_`-r<RO0
z$`kXt$`ayagW0Yg+qh`j3R|ahmKdls-ex6i8L(X@^#73WXg=XQ5cZ@9hSM4$ipuV+
z(NU+Sq)sC9P9$%<2i(~Sz`a%|*(JXozI@p|*gf0nI>uPF^-=-|wN$#n56;}U&}#s7
zN`;|DR>9ywkO_(6U}9%FF`MM&j^yD44WWDEeAc>O`$FLQhE-;6a3l}lLASy2P?31^
zON9sSFD&4M^mx{Lxp#UB#rC|?LX0g8i<Hd{O0?j{4%0UbMA1Ebj_O3_?q&jj1UG<C
zhXN4s{a>HO5n___ShV|+(`)g%g(EkS!v!t-1BOH+QO-^@Dm4hPAKxwF6r_}jkhHzh
zgzQ!VkDA(P(BLFK&EF#EqU~tp^TIX^*{fF;Cc`mIT#_A{f{FWV90F&Rv;!&-hq!QK
z6ydY!C1gVK5kyx|PzPLghq@`P4oC{1Y2&hH(wL1>qClA8MaU(7grcUUCZrJ>c!#^<
z%R)#Dni;{>Cn6)qfexw-%J?}O6SD|n7&=yr19b4|D4@Jo9#xs+uGYGk;hn4<uSr(z
zl(&xn@CZuoEyT4-HAQj2xicY)%)49~RB1lQ=5$m}916CFl5E$3#TjImsXO_d=wc>u
zLb(Uh^@ZD6Fei=2*-#hg-`o#5Eh)>$OXOA!2vRqK`%k>vn!$o*2+HWH;I{d!ExA!b
zm{;83D1Qa=pT@T)v=86Yoo7n}nNm34*WDQ%m7VyMXv&5^{SYQt0iLXiZR$SdzUlVE
zR&{-=EX6Y<w{D&pVPjt0@O<PZREHWDKMR*%eX>AxhzSgNbYn*qr~{@W^l<?_VWK9C
zoC6CfA>qM%%xO0{Dqbl8xe+;CWbVe!L9#0qzH+v0Su4$Qsvcny!6ZuBlBB0)gbs##
z)mKG^gFz-RFXI!!01DEhk=sbO%EQ}$YB}=?L-Wl|5mi}lLVl?7Aj*kB_y@eN0_IMs
zbAuu)*_@188S1qZ$|*-Q((s5~FSYOXM+4|!NyRNHgpCpdU;p?f>t)5o&&kFH<gW#e
zNG#P1d3sNihn<8Z0Q{B9blP%VBq@xbO2M!wUe71o&9hta3Q5Wwjn^ocpSh2kQ(#4|
z<YI8fpa_!~uu2mc4Mm!3C?Cf2Bz8f~cHKt+7W2wcmqelSy24W4hgIm@#}(+*))<qy
zP}|GWdR1-8hLZ1RnK-BSDSEb}d!X~rmG^6Io>iM_E)lG)VD4s9gbr>a_m#Vhqz%23
zyfh3-368~=)FcVHPB`u!zxej-;PA{1)d|G>o)Z|4jt`HzFS@5a_-55cpjztQPWPmt
zCHUGeqn?(}D3H!)sTtm9)d^9z80!vLie1U7#E9CU#M5|Gx;|Fu^=W^?S*a-sZH6$P
zi;S&E1I%62D+N9+XY<QT&mIuVe>4XdROSZOk;cYuvu-ku4uhHvLyE@1xF09)t2FQA
z5{M<?3lk<^zNcd6bsD{`;8b*KG=&b(eFskoZI>t=adhrN8-uqy;V}(nb=Qs!aSRp7
z5FXaWh>HwEBV1QFDCmG`y+8lN4O5T@d?soCq;n1O>Fid5k{24fPODhW(?DJF8ga@w
zw3sam|BT-hoGdAR5>C~$l^80`qlF<h!FU6_xs@He9RHG1g6%AFf{rk9jB2(ZGck8A
zDM=*2$W8l9t-mxR$5ug{us3z&g0eLjl;nI28jV{3DguQO+_G8Cf|1>b4{qENaLS*x
zNYSR+P+SiXf&~#9?snrjxCi=r17VyuR-vJC47OAjGFyaR%znF-7l}f>sf*Ix!^2_^
zO4G>+Z4Wkyy%T?8LaYLA{%gpQ-}gj(IBP7Mes`ZCVSJMjI)&>Xd6A8?Y2N>M24IuT
zzqhMaiurVk6--ECu}%yA3Sl?_c8Xb}IY|-9r)!lH)g9&eFlJL;<dpihGB>3#rtUiN
zA4%FORoPKhT+(_s#7;D)qF<4nE<`OtByrXYrdhwZ8e`UVT5>y}28bREod7IbSgPI)
zSd>m3qSQW-2{9TifT25PRE+6NZY4XM0PZf{F@SfGT#cO}4N_JT4+R6+W!dnQgIEFB
zYgc%%F@}o@Elko9zR{3Lw@GD|sc!!*;=I9|&?cVxM_9n%|Ni+;$tLW?-evMIfUj|@
zG|JL(8HDlPP_!=K*k>Zc;&cN&GRW;hrlyob>`jK%MYv<~;>n`JdRN2g31TY0jIJ9s
zz#@zTWqr9`2m!!AGa1JO@ZMpO4ls1aK*5jF{<H|<*FpBMHk7^6y<5$*KYNkQ=+iwC
z2#~{VB>MB<LGm^FI$&N(F+&rM{SHHg=i@TJ8V9M^j;Y$#SIO?@gBwfq4+E|iuuA~Z
ztKfTdclHSu33WkC<OnYCx)gH$W^Wf~wj+PZX$z~UMN>l=P=QvtC6O`79_g;OP6dn&
z*=9DKj<K`^rbQG<@8Ga^a2mIkmykySZE<z2vCeY!c27@U9W__g(;0zUcHma-*=_x{
zInr~N=AZv`=7v>ubMh97UW$LZmUdfV0la9Zz06AEe#+}$?eDc9Yf+1vU*g6uZWq>J
zVZ$0Pf&?VtB0(2Hlr^dJ1WDCc<JvsGdd0s=459%RlgcZO7OvSJ3P7foHpiC*?qVBB
zf&@v;tKBC1If<omP2~V<GC>PmfOP^!S6>LqBt}g@cAVxcJG!$pbn8|@L~++c2^>}I
zflA-<1?zZf)xofX1rTLh-o6_0Y!>zIMTuI6->9j}&w|1RkvpvS^L4nQN}WDgHc&pK
zOZkYu@N0V_En#}6BmTS-9Rw<GOFg=&MyQGOAtNR(G+)?bsNH}22)cyQ0sWkaWR#8E
zac{W~I}auE6dsX0QupiTm$Kwf{kY<T>2=nf{XKUK$?xQ0Q?Q+SClx-wckul1?D>B8
z1--bm`J-3QPF_8GpZ4j^r5(IF*!%wM<Z$Pk-s$`F0<Y8COM5y!?(Tf!&hGnkBkwNl
z<k>z9X7_#i;8#r-PMmWb0{}0yJNS%nXAch!&Q5<g>YbhLpS(|ZCnsV$$`LVX%8)P6
z!%>z^5nLC;*iF|RY(E_grb5K}LA!Gw8nN^Ye>-9}ZNsO73pf{n5@x=|0<TtxFf4X~
zA)&%;i8DOUr`ZY0z`ZvhVb!x+U`cy1dkqxye|8=_t>>{-7JKYhrH;=|^N+w+qdtMT
zPLa7zL*_aSnCsLt*Xcs$ir<c$s*_E9umSyjU6iw@PrU$Q9)+*!9{;NP(RQ-7R(YS#
zM)0sdDEJ^!;NX#eiaw}3@i>0sarDTev*Ply%qsnz!I%79^vdJPD`f_#k7v|F_|gjK
ze#SLy&={Mgekb6!Jb><oRY6taf0L))by=e}q4eLD!-f_G3CVI&f7ywTh&f<ZJ6}>x
z;hsS<3BtV5CB&!hyq}+IE(D);AS+5Y#V^XlL;~{>1@j5uw$ut49lIzoq?|YMAu@8)
zO|W;cce>Zz-}_7NxD&C5+%N-*mEcYCRbGkT1?sITAb1Bok!uOm)kT+4O#_b56Z7L5
zP~A@-MlT;+K0p5H&p$m09^N~8^C$4^xPSkQj{r7w(95GgpYgpHym-2EgrC+tJh+I5
zM4l_R=DW`<de^q41TsZA)dY*WS8WGe5Da|AlBn!8eTmHj7paG$R6CO2uD;ZjR)}c{
zoZzKW06_t;HV6p8XgkSmHmm8vw^c{}KpiA^7+aSo6|nlae*?I$#lneSXWn<xui+c9
zb5WSd(#A*<4I6U{bTq$sa5BGu3ocu!9Tw1nb}rQUAB31JYf9uv+Y}zK*V%0e@eTdg
zBtNXwniqoO)tZm<w{D}cer5?HovqX$MSxaTj6OzdzwEn2Ur3#Fv3R6d7*%|Wp`pz(
zVO+SBaIe{4NeG#cT~<mw+4$CCtk;AYi41629^uzXQV*A1Zcv+{4I$|!xCzgBouryH
z3fG3EdZ2}%GD!V>B^H7EPFJNdo{?e37!G}<mhkF|je|}k9nUUXYhB`d+sPkF01tEH
z-a=8`w@OArcC}Oo<F)4xZ&_Ld_KnZyOC#>Zx%oWj=%GkZcg;{doO(NT8eSNEnzUN-
z@kYC!w|{*2Qy|zZH!|p!b-ds!0+3@f!@Pu~Jw}SgIM4Y7#BX0f)C{CeB#uYz@11-t
zOr&i+VBEq>dVS@jTmUaX(7z5;tNo6L(g@;C^xDsIkeWe-bK{*~L<7+dq&2^HEHn0p
zbCff=Qmj!^=?it$am!6jYIz(UQ5|%&dIL&xCx^r>xApGDBBOVmHCxnF*KK{ja=)&Z
zbPF=*CSHiF_60I<;h}@M0Vw&KmD&&h!)2(a2F7MbM*DLK{>PjF4UeNJQ4A?o0h<E&
z03;eQMcl(z-~deB3g=s)jtehNKu2;L15xnz?ocN^gJ|EHnzAN9XCtV68Vi!RPU@sb
zCmP6Lh8b@p`>(nkNtWQanA4t<R(AJ}Pk*3O1VLptVLYnl7<J#I`H)hUus0UX^Jzsk
z33X?P2Z2lR<jf6VI|z_7P`|hherJ|7h0|EjSPAr!+Cax;E&3G+n*~o9lwU$L&e*WQ
z*T66zzZOT#%kIf(?|A9>@hR#lrZIGuqJFuom6QGMx4q^@Ft%a&yt})H2m3!XH3Q=F
zCf9#l*wD`Yt3`7HIfa-O3XIEI>mEL@Z3$f0;4Ea0xO8^A&#0N80r%;u4ZQ4r|FZY;
z@Yt<SwVjvgTdq&)bopg1^}gNPId!f0m)L~`RE8dT-~)Nz(AA`Hgmz2uH~^b8aQt_c
zp^Uq%x5LAi+p=~gASi*RB*j$wPQ)8{FE{r#va^{Pl!rx~2n^A7vX9kj!S((4-~V8G
zn`R@-d7#{YK+IbBGlg&iQH1>1u#n}_k?kLLcX3o?yo5Di_cCn$14ltC@`JOz6R5Mj
z?~d6)At4rc-c_Hcv$}Lhra`bh_jXQkfTy0Lpa4FlD(c1R3*~=Uulp@SbBfi$$#W-1
z;^1DARd4f4iH(HSd!Lad#ELIzD{?gDUWrLz)v-A?wRg}9my8dN*_gWy4;L$+m9kh?
z7rJX(aBWWk3dE5=QcbArHFG;h4BxsBzTVrX>xb+|MkWK01c?2=nig|P1zPdPEi{!P
zq!ntp4eTV{SKlXU<8Ln=9_41CoItBT1_8_Gjb1v*AQ{Y2y1{U*)yKEfJxN-#V(v8D
z0W!Abqk#iN3#I(cFH|T3tT+z8uujv?hXYx(0P-A^JCe$tgZ#5F>|;FhVeTgMoP<y|
z()Rh0Fs8P)#sk-OFkjVtU2&!D_6~j^n@ixdlb^;+JX+=8?I*$84<w_@WICW?F`ytO
z5^g$4Zga_katW&ppIW)|xV;?b2hDL0Ja)j=B$<~2@xi(=#!#;7N(~q{NVEr<vD>uw
zn#vl<SM~Ka_}lGjjR;+g<o<p4U%wD7*+>}dnL8=J1|PurYqw*nSh76kDBJZht5i*d
z_It3TaVOwEsci&ur&n!+{pu^L!b_TCv9#JC%LA)VjzkK7oV_52QAsSiiO^Qf`1Uf)
zm&rri>(45#F336m%=n_tP=-Ituf|SxI@1<{U0=4IBEden7m!;#sxuz=XHOG-1yU$b
zZrwXPXy1j*@TE9}{>W>`Ro*8#$HnCtg+se>I5F+)@cHwVw<t&q5x1LLzezexM^M!f
zR(|Ey+)Y`{4Z(D{hOt}6W;IM}={6CW;*!Pb4olueJ@850?iw1J7I)e~(F>mhyi>$L
z+9I~p80J{%8lOXZ>(M?4(x*L<ejTX?<5}^w;4Zrp>#G&O4HGnFJC_VagycK&-Uc!I
zy@tRu=<UA$7)YG1y(Q~M@L9tM-m`xckYgU<R7z~Zr`I?>JtM8pnpS;@c4fmSFvu2q
zh5di-<D15^YKyhI^=~g5up5wn85;v8vh~0JeU&#wJNA6!2#a}Bo;u2!Q!3yA;${|R
zSUJ_Ei$ePjJa<ITwAxGiwaP?=9lG1tso}5Bu<xZ!iKxxvm(rK$nhs3Jpt#PFatY3j
zCEbjDMkKc+N8MK^y-EfSY3Ni?F6ZohCo7Y!2$B#ALU?j7LHQ6+Hoz7~xx|wc<+Isb
zIxRh>7{m!+MwmLW5dTB0Yoz)4Tu8F^34lsI%R1t=$9i!Cv>sf}r)X3jq_b3JV6DJv
zfafGCpJ-1mGXEq+fOH5?fYN=&nIwFOF3M36zJ4Bu;X`9m>QENMyr`qbVGawgXN$ja
z#E=YNRw9!&q$Ew#OHfQMZZ*ZE2Cl${N34CehU9=*@(r&U%!m%zdDVG8pNW>HY3rIk
zKxMP6=^Zjf1R($`?{y?I5!Zs6Aum1cW?4WRvuj>QnKSCFe$qujiIO~fSYg_DK}4Dk
z6di__*QAP<ypgaIxRt(2!ps!2M0>gr4HSZsK!zIP(JBT-uuVdn44;vrZ_(}LZE~HZ
zZ*Hv?3t%)vf!C=P!6YD*09}1472hcRS#Y$eIrH9LGID|sWs^cCo{u3cWh8H66UJ3K
zy`b{r!(qmFS7{0RS}+pwfRADsWamS5EvWf}-(Yl8HqDCxr`R#2c&vuf<IBr~rh22*
z@w>35Os}Uz4z1X&1+I9~<d0yNPl+hI;{kEPy-WOf&{7BHj$6#DY>|^qc&OIfWlui^
zGkW{&6dI~lxeFq}Fbxzd-8FVd?xyr|=7B*%AW+4`@cAW@y;X+~VMs!~UYEgJiV9L*
zQ^AZrt%<^w5nu4RWt4emX$?U)m{f~tew9NcgX5STlVOUUwJ18k_$(2!h9PRgiq5`@
zJfvK@&be>^KTKngg6mQn92>58g;EgbIJ@!A{y=Og<y~7!m>v%twt=()VG3WxF?ZWl
z|36XPo(8mqXxEU;$S@9WE+E*s(_nDh;63+DD|%()^&|v1)tOR?$m{Hu;3Mcygv6j#
z0B=v5*5LKTP1e1LhLb1y5d}1d?qdI~YuSCx?TZL#@~ZipwtoXVckkf8{^OhiRDCom
zd<df>5QogmO4>*}Toi~TKVj>gd#GKr)<8oLa=58hKBs)n<XU%Q-AWF%ARtVQaxtm8
z=fWKcI<M?brVz8GyPq9%gmvLrY<>wN(x?+~A4B@iUru_b+sQBP?s82WXAl7l%{)mi
z-1YGKN%-)|sZ$7FZYS94e2cJAwjec5BJ3~$-n{xQj4^=da>}=JTpWd92JR%*<J#>g
zzFL@Rh&+nj=ETJ@8CRVgw2Ig?tR-VLVe)r2g@^%YpqRjIk45)5s2uh}qo3rA(?&=n
zRNa92RTl6VH3~%!CuW&6x*hlv4pKYfi7;G+Y4B05-yQFr_K*(AZi>MSQtz1t!k0lg
zV<yj$wq--HBc6RYbqsO907dN{W(9-dcwrWMxJFS>ytLyl4JTE?$S3pi+IOI_!a5I(
zUISBt6xvqkRcNHT6xEbJ4^Tuiq}j9Vi|ZaUeZTV9m;H*5k^2S$Hn1;f!k<2h*K*r;
z=!ETv4K}ho<#K$&s;tu{(;2R0{RFsTA(F=7QSadFn;ux<P7h!0eEn6je|Y%Kt0Vb)
zTb&EQv}zhanz9B0;fxe$<_7m2h)@uFN<NK<33qggILan4j!LV?ZlmwmsLX=fs+!Nt
zt>`&8@tM$qaH80bo-wFi{dxj*4M$YgP%<4HC+AUwS0G$@xZgTrzSeNFn-U(Qd`Gu`
zo!67-TBn+cKo`U#cimZ^7PpNzbqml!P)w5CnsVaKbAFKz^VzM%GR&s!hHFHR#e%y7
zQ%{hmyJb50`ta5M?%B!Si-Yby;8pHD-|Owdgih#k3GsdDvt}y1f1jK7_9FWGB>@Hv
zaLKt{6^if!A{rD0Oo#XpT<UE`Q}G|rL+%*=#ocPhAZnh>ib<>TJ`Bp=li^=<YXT|y
z`_Db0gKxYEE!BcWi?n)F06}cT=Yd$-tP*8T5*Pr?hc%>9du~a(C7dQ+8MhFLtVG9*
zE5POqP-o1#u{Hu^0GMIn;gE`0D^UqAUTsaQh}is+`;+qAZPq}yy7s{6Te`FDnwUkY
z$*ZE3xnfPS2wo|W5_T{0DZ8#P1F-k<==6v1((!V>+!?Dc2sm*JRk=@_qi};EJP{uD
z9atIw?`d{})PZ1nrOHPf=nYF_lqrheB~)IbqYZsCg{-<VpBg_b$%)IwL`vA+UNm@m
zB$62S_fAe1z6B4&Qf6=QD<{49jlV2=<uBEDzV4oUz3?4)AbN+MSojwG*&sJBUOo57
z6F$2Lrn&HWLn`m8XMzCe<x~&_re#_5bC2k1#9#D=6FhyH%uE(Q*p6WH!_$H^NwPT5
zOv#cdd|Ff8xkWh)z>iqgL>MPfeXdRI<pqbAt#9y^`v?p5bdq1PX;C?}T%pFD+izj&
z)tY{HKD%{*9q)N|XcY-T0ZPvK_uGpO4@la;f_O5`Z`rd@QsVQ8TaN{A1jh$d!KHl!
zhX;0WwULF#fG*9Zx8g(aFeG+ECtw<Lf;v(YSOXD0X6i1PH=q!)5jc<sIY+SH&n9S~
zQS)NyYg{!dL!dPbGRiN2W)8<-h{W)!=2Xb7XuzQB$e_{AOygdhuI#U)U5o);;fDTf
zi9ohIfy8W#5orb&Gz67MBGF7`BT)-tV3UREuFE!eKE~inrwg{E5-3N-=9prY!jg`Q
z@g~OKU_D=`Ck%@|&HBSMA5k_P1>kyI*Y-ant-Qj;`n%Ffx4a$qKPJJLs}B|}dpmJb
zjwotwr$%mDa>~6f2{&-WxK^j9SON@|d|bd^7&TviRVLmjA6!DQL<#XS-yiKA_bOX5
zD#0mnCZU8q9Ot5a(HD41=<Md#7HCEC^wVVXQPX9n%U-jxIs<Bwo7;TK<7tJOEPwsw
z)8t|DmHdTv38@bRB^u!D@OPK~Dpz6`WOI6C;gX`q6rEYr9HzsJ`x%z?pbdiLTylDW
zKeeTKxGBjeN4?_{ce(mRv08TuH?N@Z0``r@+DTF77)%R7$`v74s)0~EDqaqXDG(@4
z2#FmRpa|BYJl4ZI0&fv!0>DTWd}$d3bO8x0mX9bCAy{q8$wK$W0vhea)Oi<XQcsoe
zsSxiM6d%WbefG4T9@_0ibR2M}Wi44WEqe6xnBY<D3lHETJ4J`rrNLxIGRor9`~jF>
zdQlcbD6;no@|Y26ah8rIe?PX@y(s@tIA6fw{;~L3@-Y}%11<eyu(E}8_fO2tes>(}
zh@4VTUdr8z>C`)qz>@WR|JBLYU4V5#n5hW?7C`g@U?cO%Q=I0OTMQo#jvNhK`R>WH
z)ZMc=1*mio4;l#{LD9?kG{ncIGcwJuuCO4l!ilf|j`1bFj0uMz$RO~zVRTUnlCFWJ
zq`n6i6q5vY5YZ68ZpTH)Ow102G6lw1bjt3gvlM)@6hNTUBexTFYRT0u09f1?L{%fE
zd>5k12H=vGi|%qbFR#19A@qw;Enq_5eb&ORzDm&gwEOI=d-B7<&bIz}K*$#-)f{%{
zn|BFDWCqxlKir5AbQYRywJVW@fi#8IqcFO~E%H_~RO{{q+CY{ktPk@33?HpzuERH#
zVWotjiB<Kcj*f~E`Gp-XA|K|Z8J}LATg@<~$Jod>^-f0}tGFKBtvI;wuS8>B)jP##
zoc;*&TDT8B8mjg;1gDJ*oTm@QGYNXjs1QMH!fQ)O?WrLPZ={q`pLiZW+>iy8dzo3H
z6vQ6|;Np^>>+aumzN^*MY<w0SGG9n!0fZlM2*M@6wtRTg0m&;QYWT!S@S3HwV%k~N
zv_Ko@Zr1t>b#aaRJKd|~;ahYk239do%2x!{ev-|;S;eym&?B9Pore-gWGxbiO}qSV
zn?j~Zrn_K-YNiHi4=88%Wfv_=C5NgS;K4K~`VI!|q;&y#)EFDr&)O!q7%_nX$r<BK
z3(VH%P-?8ha%-&jj%#jChEOAoI>wIx`x?-G+#L&WaNM&M;MQS_))NX3oD_^XeUZ-)
z-0kpqvkF#)j{PR6DvSnkCkxz~Jd(P{C?3W=han37LE|ZaHDpTHc$x56!c(%CiXlyc
zDhbqX+85He)XGxCgXA(TuMJ4jp@e6)Zl(out#&nFg`f62oJ=7K)&T4u6zn`fp_UJ(
z3d$@<Uu06QlmdJxtY*a6`gUf(kr>mD!ga($BlTe=au|rj4~yffm}IK-A`^MMmGl7l
zA6wI-e>!#Jr8+UWFOWf1ncaNm2IbRrDTY)acWuIb?%u9U*9lrV7rx!3dC{o=+0UMg
zu>STRl>zETH{u1FtHXT<ek8CEV|3{4EE8mO$x3e7Bc$FZ>ynz4+3-@oLs=Ay4c09d
zN|t`kgf@5Sd9s^#HXcF^8rf#*n%D#uBA_<x8tRf=@jYbD@q>F*%PUy+TBgmuvkkX2
z)u1NwN{_kZ0rSBP2;kk&g~m`Z(ZDFN7F~bzwD_d8D)$g?ouRzWY>oYh>EMl{T84YN
zK!3QD*Yph$?ZQ!Ii@uZ6GmazF=wqs%lwF}y3GY=h<ZCmt84Mc3=SVv-UUFJHoD`4x
zX|ndkV3cm+XPfllmuq#F@VYQ2SX^HP%i0-y7eP)`*dzy~eD>717xi)^ySePvb7q8D
zaL-`qH|*2YvtKds6zG^lIv)4k)(^C5l-o!rTwlxO#w*d13<LTQAa{I@!60)@&=u1T
z(wY_oss*a_=9f4MXo9EPJJ>md6x_4p?sr~W4le4!#VZ;okva;Hb)hqX&+(qwm~sGl
zqQQz!Vx;=$%gA-*IYq@x!7xQ`bxJSyg2NIod2m=xD9uO`kI2UjOi4EhxS;1<LCFyj
zAWg|2s^wu2G9%_I_Mn*c3KNemGG*z87r&peho~_YHYq+8FInXVohGT)U-SHhFc!Sp
zr?jkivkIOSuF}6hdYrs`76jSWL?C!Zuk4CH7XMzb7FNE4mgeIj!QliOMpWu$6~26`
za<$$Ui}<u_*tPqy+<3LYaP@qru{9cD@+GYK#-oRi|AhZpUeB<nu2rmiNed`;m4{o&
zfB8!#rZ7%?)A%RK9UR|cmPx>eYK(Sn$~<KE$-~8{iOX5Noyazm4Hgs&2*>SZ5co$5
zezBn52G#5UE=3Xz(}D3*+*R`_jNVgWsfGVMh%79cEQM~~%!FC9sm$@WvutUJk3xSw
zU4ea9$dX=*ql}}Msnx4#aRX;HZo0#(Uz^0u9evTzk!u!kEN9b7qYtai^2$~&8AxBe
zfvm*K`4FxW3~eS#tA$)?SRpq^_e}~If0gg57%a6*bc_~a2<|+YI4yI*CP>IO()%Z^
z=w@wC`;fr!AuLZ2pY@UKPDhYm0e%gNrK9Td)ME#3(`#1VW{ALK>n5xtPW8Ix!)!$t
zoKcPl?lK5zfjhQNnRefCtRG*4TShC6Ui5mj%|Mxo@e6fm)NxRaUSM}>0+WvoVEz_`
zt%aqlzdzw2T%B4wm0Rk+$DIlhe|Kt2ZyZ~I7%v=V`hl(22Ho;Wl(0fvDBo}gh|L#j
zY!Tjh1epxYoPFKv?m|l9|9Q2y^NoIzY?}{GyL<cXRZM5a#FDvIz$8Mq#kBJo`7Bwv
zV@61-3u(;OH0Bj;43?JUEM!ttou$p0>*%6j;StQ{Bg~&5wQ@^Olh}7v9G4OMjwS^v
zsxSp;%bw7!+VbG+Er<#*VtSQ&4cHEIy2KH>#g>rMP-12l)$Dq}^HNNf9G5$qZ)>l6
zb&uA3yWl{W5+W!cxn+lhBcWi*?GOU~2(*ixqDq?$C>~*#{$TM8n1%$e8X3udOys(o
zK}yHoB_7k-+z9Z~h``q1tl?pV$BIAvG)@~t7RFeJ58}9?=F042U7|b1Sc=!cseAyr
zk${&i2z-1Yy=1fkm?pZP=TiWJf1^l89X9Mq4hE+0Kx!gs7q|!W$*@xU2a=H7zG61q
zX|dxpQA&){^uH)a+&~A)ajPq|{g>|U?%DU>xBV->K27k$y#x383NIftynL|A%P&sr
zUw(1A!pr*&FYliQR4tGA@S9AFws>O$FjSCmnpgd~+xFkI?l``~SEpz0U%*_lW3NmO
zpIOkxtE1iS>C#sCsRivE93Cxc!#%NZJ>B|9I8!KK`ZL+7t1h%&_T6f(TbWWCkaTdV
z5ri-H3o>rcCxg`3Te_qIYhTv9lFqy%)EH${O2w;>#Zd~|j_yJ1z!$xsMPk!F6*Z7p
z4kaY;fTh+P%?BT40yl#TCx?>79!=ngdFfVcGUq}?1(M=?%orsYaB(Abjq1=cl67o<
z0zP6Mn#2x_3ymXVy!9!03#`43`quB8TyD%Mwv!%j5}N&jo!Uxv3y>9%k*T;{TkM2c
zN7S08aNo717pL1mLqb17H%J*sH)5l#*g7S=0w3E-q=(v{+A$?Nt|b#?bb-Rzg)fKu
z{rAn|-d}axLj}gJ4*H{wSt!J5cB_*JGA=>*^*jNj&2%vE2PV3)YujS>MXk|-6d|X8
zW(`AVptHjxMBescV(^;!X%uVedjvE-_?|Hdy~kD}CxU}sZ=Ob7HuPkpW?Lx-80n|7
zrW>{Ld8kHjg%9Rspbn!v#g8zLO$Nmr038&Vf&_XFh-w|A2kijDh_AhRQJ&kvmYbAc
z68JZSG1)s3z~khO>;P$<)m)jMN@0f7wNIchV>i(yjLTvcW3ia$m(n-$3-6NAT4+<;
z29OC*n(y4#b?(sc$u{jxiQ%xcw^}b_?K-`ynVoHBnLMQfTt(AA4GNzCP#Ivpr5J%S
z%wK1ghTG(>XXp_0n^9!~9}vK#JgYDnK{iprrbO5vhPCSW$aeHN@k0tm65Nf9xyL-v
zi4OCTjn|@nIYt}(Ih7ll)Ctdt6$M4siY+gwQD}rWE(?b8P=OUAilJFe;IjG}=N&Aq
zM~SK9UsQ4igcD&jIRg>p1K|_IWM~r@|B$fp_#V(jrX`qW<$Q=G$xw!LtSM<(Zq)|2
zA_-(c-7y`qfcYD#4Jsri>u#rMkR1|@W*T*KnGc6ieMNr*M;A`Y&d|(L0=Gweo-Lbo
z21TIAJ@?W@Z7SV+F;;zPLuU6cR{OzOt-NSd%)Nu1<KN1N{f_-(Gh=euM9N*o2pfre
zAHdO1!FLw$)QeooBg&5;SIPJTv@hiP2ZyJQTn41N;fNgbt;nnBU%Mq04wi0^v=n{|
zxnVXygR&cBhhm>tef4ZP6^v8Ews@^H4#9vEVtvuPDmioi9S)XKjw${gXlI>LqX+9g
z?*|oMj;#pmbxZD#4K-!udd8umZa9x%b`Ps1x*gf|i;-@pit9=-ek_X67HPbw9U+8~
zh`GLsC0{zti-EcjuZb+9df!U}<_d^61F3Nd`qM2339zaabA5M2Rt|CYOr9tE_i!ZL
znOT44qaT19?q=2ltbDK?b2*)&Ox7`{N1n$mHh5Qp2AW!YXu0A-US@PX_uMqkn6cTb
z*@k4Zo5)z7n4<9HxZl?Uzf(n3taV97njw=dLu%cH-A!57BcxlQbs83DzeH?#qw4ip
z^aNTFGMh0MYmq0gVt1o`k!V73ra?AXokZV<z<<#h)DUyW-`<P@zo@ytUx<S7v`B`=
zM{to~x><k&x*$3CHNl?2<68uf78-5b=A0dO4_-h*qEr{K?}+^?0Ae-YBSz~ZHTciK
zF&vnPXL7UHOt}!}Z5i5yp~fiWw2981XjCn@k=>nC%%^?w0u#i1HMA^PqsB$r?|tvX
zYknz*(Efh*7U$BsZyOp;MWj=Z!!jEa+9!_Q<AaUzlH$r`t&pJLZY@dWOEnl<$V!<8
z<pZ(uSYpI9sB<2v86zpBXK4n_oBb)|OPDabDz<DjZ+)#d9w@dofyuL2<{2km_w*P_
zDgg=DyBgZ)LC#_dk^3Kk4&;Wjk-$p0GP|#{;RK@LMdX8%%p-iBPfMprB4eUGW{^_)
zdOwZ7-6Gejz|zzmgi1X}n}tS-IkW{0VUbrWj+Tn(?ZmsN?kiZg*Dqnf>yk?=_7eQm
z_>9Pufhcs~<tZhx9J4#2b@Zudvb^PGKC}n@!YMcqj%!0ZZKk-qRAbptqWA@M_IzfR
zbCK>o%E$iqlp(y`hnf7EzLj5b`oEQu>Z4y5U{<cqc~5o@k84<OHVy01d9tFd^L4-H
zrAK}@Bu8#M0f*-bxXee4%HoLZwTf4<TIrbsb_(Ao8^2(Y?10@tk!pIZbV73u!JY2E
z_Old##NB_x=d!o-WcD_EHshz^^I8!@vkjg`*#>{vJEB+=FRj*JXml#RN`Coe$mg7>
zE{^VWLux16m7vP{AJ-Uhh32*bk$UB6oqSWB7fi_QMoEC{VUmM?=5;>7=p^?b;Kcso
z7TEpvWYyIv!_{$r-*H9CU`6Ep2E~H1(2vq_-fykF8kh446~?By%Id5I2nO*Tu9Fba
zwN7Ax7Z*y3blhr$89-okM@I7~>zJ#aBeXqW9SF@tk7FV)115_Kve$QW#i}2K?0110
zBZF9^wQ$%P@j$GnfGSplK2nG17}#gzF7f=Ma?8zbioiKmChP9plh(HGPCA7rJOiIS
zTN>QG2Ga-rR!v%k=0<6MS{OyluF28i$sQI~+B<l@cL2$$aGe?G6mDB{KqA<e-ivPa
z^>KEU*1wKgDDp8sBlsO_**WESTB7ZmP$s6xN1-9C^g(o{w?0L|VMbg|b?Sk4GBoHE
z%=l1T5v#+J)y4e@0cOVWf~N5?KNgE!RiWlL-?I@kL(NqVO+r)91ieic^dl8Adx2NU
zpujf?VwxJ7n)6pE0*$9hDWxLv455?6(y1(8yj&F_@9(%;58JB?t*VyPh^+p*-zcyS
zv$uJ_xSFPuYbfWV-0uGk(e+*xi_ZGTX6frHm(v>pT!vKeLH(LkTjMV%6+ZjH>6#LJ
zToICW16Q^8AYs;hp8jrx<lmXR>qy&*yu+%@I~1Xp3|PaXbXt0A0IoPLFTA^o@yblx
zOdA*54cm=}{K(`NWdgmNgC*VFGI~YgTbc^&iT(y`tK;<<!wa}4!zohUHi8}b`U@-T
zFpgM1p`fmdT#>Jb?<K4+ZtoveVAolp%zd|&DdUyVHvZm%`=^xLqwDRrNb)3-sW5*h
zNggl4k1oth#!Bs^E7urYT`9-uU=+%hk%H}mCe_BE7=rj-y^bg^i16v7Ycib)grXOz
zqrl+0i?iYZ*O(!=os;5b?Ap1`C+Z2M5eO*7t>_|CM<!`WRM9=@9@*#=W0OT;zCqyr
zkau>22x<A43Xpdbv5naHNd@e`*Xlg1vvO<HZ^he)IWUUDRl{NK5t@PZlC$`tq6U+;
z(v6ZNt8$P4Z^GObB!a0}wL=5u5buR5O6cvYNB%Nb`TK~0-c_`e!#BV29^!){3Nj1~
zhHY(>!S$L^Tu#lPOqx0rw#AgSU+5}+k<BD?teT%5tfw|X-SGPd+1pt~wuqX7AKDvu
z@0Z~Vafp_anrv+B1G{L#9q`F)A4YOvspJ3xA~uHOWou|wMrSn~Z+?ltKdGI=iK(~I
zf@i@=%?a@QXZu5nA9qUQD`Qxh(nHC-DC7znL!D&9Dr$A=V(LYRM-|xMG-#xgJcK8>
zgpkC!roxzKnPtsW&u;D^nnsnczz|08zEj3){c%XDAHfr6;~*<)g=^%q8fr2xgI;t{
z#Q29egAdI%ei<$j&ue(hvZD~a0^94q#LW&F#V<qV4X6ydb5~JLWybJwyP*mE&NsnX
zH#H43mG5h^n#)hPv9+fXejsmcis~oTf`kY<YsdMj4))>>E_w8x#bf7=pJ!66Jvf-e
zk62o%YD8kg!rIXlRF0Y*Ez>vI;EcB++}_389PN=EWNp7ea8!6p_@)jow4O9JSlxNM
z(w{lSj`DwJ*~|1T@$63I+iTaYFZ?W{5&5aoiu}B5S}MP&;Y;ytwtC=3%^YY2ei=H^
z&@KY>+Np$de5yrw*LV!QwqISBFyg_t^9gVN4ly^r>4({yZ205DpSIjVyGf^mC;yb3
z$JUsXpZH9{Tv_s|o~+>QDuJy+T=j(Y5e`aOcTh-9`{z0>?=M)!5~1e5|5m9mZfK!o
z7@D>|h+uf+`u~?;_%Q`T*kS)A{N*JET>U^WbR-7l2(WaxkVd_b2Vb`v+QaX#y=QS_
z*|5H;e+I6-R9>tc+m9nN@}`74UrzxdGx{B~s)0olCMvj__~=_T;v)`VMe*^4yAbm6
z??8OyRrBln3B^ZV1nBkmeIZuY<@X^z^5%i~2+XZ2HvY3PpoL<iA)|jXu`!t0?_O-Y
z^C|hQV&jL)6sgHh`8qAH-x~qUSM<Rg?~-aSKtbV;gaRf(5R_6bLbLi%plANB5|o52
zDhAMu3XavmQU`!WnCK~QKwH=&C;o@wBylJS4yzVt+qM5Do#yEv?<=GL0v}?+C$#|4
z98P-IrG`eJbWw?KQ0Qcbu#M8P#(%?jNM+LUsMgTN&hx$A{w`zDXfZno)50nR?X9Fc
zi&Hmn01t@egFK5P>rlNqaBxYUstNln$z7;fqm5}H@<f>!cdxFFESV;UzD*&p$1XT-
zh->A|kB@#5B9JIa_u=E8EO<`f?u3(YLOCvhwI7OQV;)q8o9%E*1m*FhZcD*GjHgJe
zLm1lNTE~23TBOu5Oa<1RxVY7XUH8qXftF#(D&ySk?e|W5A7GC9dfiV$x77u?$gWc-
zF)LoIz-BsW7b1-6V96L;10(0i&CUtTune_hj*zyrPl$4$ysmrocuCa4_XKa`!HH}Q
z2@0;t4dF}v`oaYYphu`|k5XqXP7)5~`}Y{iorclT>@osgAv)@FD8}NZe9|odgN*&u
zpn~3j@I~A%K(j>Ii<_Hjk?rR7Am(&Ji$XIdp2ra$(8zcWb#k)lC?DhCb{2MvKLj^h
zT1cA4ppylIJA8F;de+_F-%j?}U=m)5uK5fvcYilB(_QwXfj)xWl6yQA^(jg}t2D?6
zU3gbWS~iVpD`|BR5yy3bi?B*_f8Kh$)#fwximsD`?}I@9PH@@_C-iXHb&RGNa_>xk
zzyu_G1jxsfzQCf46zJbX9i4zOQiQN!sS01jn-W5WhRKd>J)Q$BbmK1&=F0wXtz8zy
zT9{t|Z2?59#Qy+me?ML;gU3!j0JA+dSQy)e0aqlnI*tSgsl`+%i)xIJu!mSi7g>hr
zLqbKZ++EMU$Q=Owz$38kP??OYVk&<@EDfeQsqcibYmg<{e5_O$!DDI<64)rk5<?+$
zwUZ(PXbE_Z^KrF6NPr%q6{OCy>2zG2O9@a02B8paNA_(HWr!R!&Tcd5?HzpE-REk5
z$$Sh57h{9?$l-PQrO2GHbzA)I!Qtu2tD_hpGb-immeU>muT|KTm!EZapW9cLV5?wv
zy@OM}F?l_2z@p5H1oInYWq+DqzyTVA$YN;=aOU3#<RJn-`JCf9;&-GBCBIe0XyH?X
z^>ARZhQr{hz;PhnisFZ|H0+52i3ULj$4DHstSU}G3)d_jCu9j7P!=*Y<Cqk*_<aO0
z=yqUlr?*`lZ<#svHOu>qLt~@(VOs$-Sn<119=OP6H*gY^UI;X72&>5G#g5|&MloK*
zfP0uL^!Om7t4!;LQA>h+46PCR2|}n#2F5VNeGtae2n5a|*4EaR=+$r1GYl?HC!yUP
zOCSqo?f<lDgs0@!T7|obcYS}?7no7r^(`Toc3?Wd!|hafI<Q_{56uI$#;rwYEzo6c
zH*~gF=w~^uOik->_#4}<adW&Uq8H9iV*dc~2RMaCb#bJFk)5q{(n&06mAgTPS?iG<
zdQDs*GJsC9fg|*@0ar$#>#Lfpl3DD9sKcqYBoy0_$l~6o=AXhmobCg&fG;+p7(D1e
z9+g$RaO?Lvd`uc626mj@1kr2M00fOe@EZMPOa9av9;@T4tYY0@7mwB3xuk;6lIHEk
zd`%qad*Y^!1vG3#m0f)Q{jW7Fq+;F66^hpl4DNEM575I8f*Kb%$G9$yjH1;{5P-Mt
zj`L^KM^NTKeipoaKyUNQ%S^7TQD#tZfas!Xs+4+ek!99wYRxWDWnxezFTJeOAW~M2
zl(LP67b-^zS;Oak)2O8H>YMffR;s#6W?g`?ob0AZgxEINt9K5Meh9dalM?0X0eK7^
z$yf{%gc#62NtKB*1^h@hk`wnTS7T)P!}XkC{ENv31R20dGNosAwhd6V5gsQ6K>;<b
zelfYdJMRmY$gjY!W(iKa-}KJ#adX_MXa*a++=Bg$SQzf*JHKGE->1`CU#P)uJG9Vw
zh*<}AFGQvA6vG-*4Y_m@6DIBFU|Ll2Td*D~7$jdMkCJT}LCE3iHy<`sO4aDTqxgFR
z+iz#k?$}+tE^eU0gm)ehL~J4XBe?hLIMa0@nbL`|!{2(x`Nb2cCYT*~`7_S;Gjl?y
z$cv1AwfTPhv+(5EYGCdv$;JbBm8?`Y1#eaoDG-L!2v1H^34*KfF%7TIW}?90$kVYg
z#&1QSv|8PmjR`5)lo9-B!zjsWe(pH!#EIhLlxlt&8$;5<)Z)r52@SE8y)8<c)aODd
z-A1FlubInM&RI>Fc^W`q{S&nMD6xdT)My^U^T!OORW138t@s#tbO%HJG9$idk!VvS
zbIiO<ud*h?ikBRx0PDO_W{~^#q|pZB2&FZ;U2gHdPYo_HTaxAfK6M(}V7hG2t}_C)
zaSa;H;iMP`S%z@O<Wh&-tC<O+bk)v87OdHh8d%E8s_j(lV_Quv^}gRbIdu(H(Y%eL
z#S#};XAsu{&r#zcz#yZbXos9#um~W80Gjp6x--CNtyCNtdqZ*(G*oUE376{}<M!F;
zJ3t#l`j34}bzT-(&?OWKPCQs_N2I`-vH|Srdl9Od3#G}m&V6lt?Rw(=^gYl4R<c|)
z5#CQb4=;Sb*GQ>Ff2f#AHM`1|f)Cdg8O}A~(B`uSR{(cLxjczGXO5@9Zd>!HTG|^O
z047savOU#cZI{JXqw7TF=qk17%xEf>n-{;`a&s4}#X{JD52V|Zav#J+BET-uM(}w>
z?`LsHEP*tuD$n?rHQ+Z{1MK?$pE=ky)r?MV5<tZUOSt>PT47dScH#^1sw)KqQ*t|6
zHwjP3)nc|Awxwp1L8I~sOTD<!WdUMB<4ZPY$;4_b2pgtlnVCBy7@WhTw8{*nGi|OZ
zrfO-OMBhSvuvMTaEPL3_PU|1W4^`ti!<p2!e5XXtreW4@bv$mLr(7Lyc(!)j4Kkij
z?#`?lm9Ki0>+gtmJafEdWFyL+yH80No4SM07bkX!50(^cbUm9*%Iyaarf^=i^5Vg)
znB@KP0Y9{fFWcZLyvV}S<sRJI700E(K;>iZ$U{zbs7ML{2SIxjgmP0PfBw_vMXp*U
zTsb*-!!EHd7lvAhL<HTtFSwDqfdI*PMPlwI@aI3B&61Iks_f@w_E-JlU0r)3JH3B}
zPHaev){raP*VI%%F4r!xs?$RH_F!Q<CM6q6R`@4AQox@(x}+I80=OkTnkKT9>;qoK
z_ubuH+(4*)?S?fPnaY8i$+<iB=i9#Ygo5ZXQMmnWfsd3b3$z&~h2O<f>E7-pN);M!
z;l8$q%W;vOV<uRC?bYew-Y&dWf@Z7(P8?0B90;D$4kB*Irk`(|i>8covQQ<ivwU#A
zEuQOh?t+}5;wGQ58tvzpmYiGQdX~TrUl(U5EZm@ts@wfCxh>|54%G*Lr>U2yfh>Ew
z=+d`ugCrh|h`jB8onsLQc!TEzIsz`QHIsmAb(-FyW|{xuCOe*w_&{zXkI&J(o91KI
zIB5{(z)~cn^q}uD4Mfopn=DOYWTjht8j&i$jd(svj~e=bRi&`>++~^%=hLhctIsip
z4-7U6Hdq{5!1gO-Rt&D=jVz6^1Xu;6q=Tc{c}naP!G_45KqPwSpaOnj_wc1Wf0aW?
zDo1ee(!<S%qL~MEAHnfYo$u|2aZ!9!S~k>;NK1(w9sh0a`T4WG7xEmxdrhT806W~{
z)J%$!K-Twm`ArN^kIIlxw8pF`+)LA|jKR-{Cj@#LvAxC$eMVEOyBRj}K`llNn%Tj!
z4TVgEaz#pWyzpDtbEs_No+~X>y?W~XS#dhvL-cV$o8aMs283)d(s_!;EGvmLIQlER
ztsS>V@7b0<s}*UgE#VOJ0eAqh!2vRg9H6R9b4%Rz^(C0@>cpqPEpp?-2z@0YJHQnO
z^8Q|a=o)sdu3r3m4P@o*i3Q)>DHo#>ZS}C4@TZeqDkZdZ_>MQ==pEg|6)i;qRvxtC
zACl-n<{l{60Hz^OROK9ueb`V?U#%|w!H=^s5+WFmghDWl7>|?o_$U}J^P-JLOg{v|
z+58fi(^)>)q7{9$cW~;Y!I$0dVQJ0Ryu$u_JB0@%5wFPpYR?t0(G`!CogYXvaPhez
zJ_$c|vUl~v4f^yfR+{cYkwGFZHiv7+Wceii4i`>{H2#(ca^DWt$IZ~NyA!C9wKvN~
zE$|5;gH|rvN$$)1JEl#G>KSZPFXtN<H=_1h)JR5uGpghcFk<qvvGTo@WYp_T>WG?l
z9P}TG47Uw}2m+Z0(Y&`-KdL;<qoSNm3J?{@HRO&|w>*aKoSKmALIowjW6k?H*Y2u4
zgsjwWK&UP(6@~KGT=qYcqbeI~KzVRC@`nl=$?5|Qjl$zSf+W1*E}_q=j6(RHQv8-B
zH)VtVYbCgMD}Yl{oP^PI$fYT|POQ&#HCZW?$GEuYxKRB@5iY@un}zCx;Tpi5SrigQ
ziz0TH2*ch=9|*t8%4z)`h2OB4Y!U!r-dQl_#?s0@h#nRP_;QmqLAtad`Va}&e%r`I
zSz{bvag#gdK%6!Xl463`XD5k`+z%M`p(zGvbPtKgJeo?4K+K)2fYqpiaEudy*be^V
z;Ffwn>2F2!iQj?vR}+VZFTje|v82T!Vhuq?%;0W}eW^&J_dNZQgH-f4Vw)Xdknf&E
z_bZW%+^_fL)!?3Q;GAZ4Yc~y|M_^InGXzG7JIr0tgQ3uU{V}N6n)sQBNyBC150rHt
z9=eC{&J+I3rl&==CPy*H-P6P4v)=bR`>#&+zU{frchOoS050da(dW!=$Afb*HU(It
zZghlTyi#w+y>ENRC(swM7C`GyAfRYkW|ZRCQP_RyPK(guAmpa;oo>oVY4zMC03}R|
zxsN7ch~-x$8>|FV_9DB=$7l>HE@LZ#G!1=H!}G~x)rL(ZOLzzW>mvNX7ok8DExZuf
z!XyOk-X~Im62bFXnRD_Tt%o2Qt+ZVY(FHm+h@*06iULqBC6+5#smeZ39tz&n)@PxY
zwxp?1fzv?^LkKT#0C^EBJT!(bS%_EB7CYW!Ztb9T{ltL_)vlgHGa#y;UWYi=7#0Wu
zI~VO(+!PjdXvg6+EldugEEc4XQ9c9l+{U0RY7?RnP@s4yd<J!{4xCt4zn;{zqcTVC
zBgH~Pn|_QUP|{ku9XN{np!(f6*1D%pqX4py^4g(aXoZ9b|L{r!qs^nSaZ~r%wOkq6
z(&53+g9p`5AOOYPHEsjumzVIz@|PN7Wxykws6TV{S7=JXEAP~QwhA5jf+MjM8`9c)
z8F-N}8@_XNYHYfQ4Ao@NUC}aIl?3XurB=As7p6;zggMG7G7*?UlLh!w3+Kx^CP8rK
zSvQY0HWTL<zPm`qR)#1y*PW$l*?aOVvpw_@<?<^1wWVDZuTebekT7G#Y4>!SWv8bi
zUhnO;|Aya?6wbeff;bXn!opGTru&B8OA`Dwd~bolu1b+{;c*%-nmMVvaewM~>U|u4
z8}@w%*-@kt!C>7#`r2+rui@bRYn3pg*czRYZ=W4hG#2;w%kKA^?tc|5r$zh894FXW
zvN?HD3AS*NRoL+r!n#^zarw*!+L!iN=78lkau;>cZ-FPZxNNx(CBUqX)XLmZ2op*2
zRYH4_Y@=X|_bYrzWFj9TJ{&gaHPxp{nVZkl;>LysvDgwwBUdPEFjj;Ghbrxm#qD8T
zXL=(Kv&-4y-i*j29WE{;<L-{KMxqs8z%pr0&NT~j)2u&CbGIarRZroeze8OkCH2Uf
zsD5`!Mvd8Xxw)<J@?Wh4`R~zC^?n^MzWMH8DEbA|1aq5K`Ga@;EIeq>^YMUj#t^Zb
z_LgipK+F>91P8~&*l?t90Fc69C$X&tb`|LeBd4lITH`z9j#mw8xsuXeU~BhLI1+vn
zhT5zczoH(ZOEhWN1qxcG0f)^m;4iR(n38zD;l@sUW5W+6h=9347Bc5Rr4_l+KP)S%
z<uI$-@@E*Bg_uPJ)wzTv%ro6Z5(I++Nmw}u8rmBtlPM%3_A?C4s=dX~M&MK3s2Ejh
ziUQ&{(A=!XMPTkFgUbaOZ=~~3hFW@w{zW(E`H1RU(%n+o?*K_-l%-<^yl7kop-QmD
ztz@8}fHX30)Z0I{#3_O%J+?rkv(?US!_B}8eHSMO$MkGef_naSi!5<BMDnb5q2e+I
z&%(lrGk<{?7>6T>v!VV~6*FU(g^cM%26TWzvuOy!1JDc=t307s3qKW~vTY!YW01#4
z)D52tLK@x$eHlvgROcFym0GwHjm{MURc8k^GJUHkeJE*vQCoq;Uw!bmN&V3&(Cp*o
z1goXukQW)5CBP}w`f-7*0@4fCgDfXd!qM>wEk2%)W0?ffW~0<*pP$BTf0|8D5z(Ts
zD_Lvx{%}n75&_TA!W_rR){0ORa=cu8QtuWt3S@|4O&qq&na*BZkk@b&jjt)Vg?(*_
zl!JlCAm{iIvAE;=!Ub`=b4^fVs8Hiw-;5b3(w<EtgbNSt=h%pi1BW?`6?qLYtDua0
zd7WXdYbAFOWD`g%q<~|TZvQ27tt@kef^&2vk+t1L;t~$BNa%vb;LBQ}%er<}mAX)X
zLlDp3B6Wo-(MJ%HXl+(4-06>C{nvUR|0O%!A?mr|X8fWlTK7)39{hI|F)gZbQG@s;
zf*jGnFdMUj2Y#)ySH8%Yx<L90-CXiFwQ^sZF=!)7X?6)b{WT`+wrKoq?oYch@xTo^
zhrtT^q(jqbr2=+^-f@un>C!>+V#M=*pF#Se*g-C!ug%RBtUD6&*u;j}-KlYC0bED`
zwCzP7V!q8x7Q8mZpQ)BEyjC{yW$}amKCH2?J#=W}9V}O9LYE{~CFZ*q_}B7OpS;P$
z+Tp9XQMRkOdBca@%MG_}!yVEbP54iF1uPE^Og{cK5o&Fe;}N@(7wTr8^kNC0Id&}V
zP1XaVqI;oXpw=M0SY3Sy#o)_1K}wTz$H&pSb6$RM2bJ&9N|!-j3z_QaH1}cS5UE2M
zz@4PbNBJ<t=%w!+Uw=um=F9H)`@Mr&ovsl<I82LOB`X&CJL?`D9Up!Vni~uek?bIJ
zY6htQ(*l%c2D(qj{Y*iauqM43@cI9o%P?qW6~nmUEnr%8^L?FV6K4Byg0Qgkz+a&6
zDrU81>i}$hm10>r(KyMA_i6JwEvLVGMrR|NM{bP9O8k%VWZ1N4x14IeEF{LiPkU4s
z<Gnbd#ZU|-8*(E17Y*E{p4V?a`gH8QuCEV<>8p)vkU%<dhvx0#I03VWjCJ@h5X;Ky
z&bA~%p&f-Mbd-@$&+SHr1F?t=%x3R^a=-uac#U`AK|lpmSNAr&e{q-($YGisE6X#g
zKLC@tTi(gPxJx~EQU8iN2ABh40?O*ML2CGsqk{#!2wSeOq7Mf?0yO<^|Ca2K-JCJ_
z8IXg~Mk!@c@~!|G#XamqwK9W8Qbl$I-4Zcv7;bLF*cBdch4K6eBx6EQ{vQEIh0~|0
zE{8coFz#dMR}sBnpl)G7qxFduG&Xcf01D_Yw-j;C=xjM>VNQz4d>9&Kr|Au}HY@tY
z5Lp-272}4u8^RXlT20B`*f9z+jB`1NkxIp;(APA-x)xkW_bePR1ODTrXSdjy`=WoH
zr4vkOEYMw5JNFHnf~p?_!p#wk-7=+}+1q3T?Iq=)q^ZeSt8bddR}IF)&)W*v<o-ZA
z3|Mw%Z-Y;<6RbSw{;huFu4eEJf+_(;6k$NYLjrbfPw{c@X#a=j``s63r-w&fh#~~_
zW8ZCTGD)Yf@#@<v-Cp*uso@_V{v?y_190*B|61QRe|^5bEuB(j$ZDT#R(fJF=;-Cm
z6<&5q;^A@4yW1<gyLWKfd(o?Vdt-&SyT`}fAA)xW*=0H(&X&LW>foD$!|x7)m%X7+
z7Z#LfHx#%zf{*^!I>KboXOHN!&Goin<BPkmL|fqt$TbmKoJjx3?YgJhv%PT;`W}<B
zBe3RopUsD_IadFDn>c|4@$5G?(gh%)C2yl85);g?v3}6y;!}cIFsZwPJ0uC+<R!Xe
z<_zMkoX&Dh%8)ZB*%kx51n4RDgVEE-I^hsHwm3*<sju@QIP#w3;UR5YfrWFo@=`0{
z6!#aeL0dpWYnaUar^){;W;6FJPqC{~VJ&c`8)=jGuX>jMSJPXDDjQ!07W80)uVl=0
zLN9)9VGum0TTZ!+9c?tdPBdHd-n-v+US(yuq&(dxcKM&!?<v%ze?2AU^!cOC`hQQ?
zr3?spwjVorN4}kG;%}ReI`_FvC$4P`hwY}zieLEraqz%W*1dQQR^&S$Xem%-R6XXx
z^^MM|<txOG8iy2r0-Sv_z|>v3aChVXm4F_zSta_ECN&LH$2!3k#`ZZse3wzOSg;DM
zuY5UtNTRPU6+ILXaIg-WkKT*=gS-Fpb*Ef4EmpD}o91hOnxv@3i@f~u{3z!L!T->8
z`|~PiNgn5RCQ$t2vB7eY@9%K5-sfP^)Ba9;SD_gKHLNHBb?e*Sh-MWKmwZQGfnlZf
zGr13bPQLKpCO?1vc>_AP*~n~|`90HNe*Uwcm3v~D0&&ngIqmH>6=+)`4FvtDo)dje
zT9H?g{MWTok9)^>yOAb*^SX5J79Y;lE+*0nH2$wYcdFAH3iM(rO{-l*k{Tqm>X6-=
zi;f!GzuX&R#L#ThzM|*~G5y#beTBV(Y0=3ps-S?(=nIOc!<+P$lDSFngdYeApHOWg
zvO*+ZbJ3cMEV;_YGl&U->amnWFa>0AHuuqdq?u7(x~|CJ**)3|v6%c6K%-en=p^d$
zBIo-Ht^P2;>%q=8ZfzW~3&-|smY4%lcMAQ1rE^$084V;*J%~ZUB>17^n)tz*LOent
zfW91(23D~ec)|%(lNMW0F425T!3MOk7~cmN@U*v1LCG*%(Y$;yhax5I4%FKf=!|*a
z?VD0ZJ}a}~r8m>~Xv(w<v0vrQvLisu96d=5Y0M<OVS+!YMngz<tC0$mS_7r9rKcQ}
zb_=YzCEB015oTZ`V69U$Dl%(;d8MTN#iuu)3D7OOF4kdrFm43q>zT>%%d>!tR=Kes
zn3_Au%{0Y~P60ldE@om{@)eDBx~)c`rP@{)$2)c0Ca!l@h!w*95z(cz29?AG0G53h
z7q^Dh1bn5&GFNj~EIM$VhrClhE(#tTv}(}ekytviy&Con^QlqHIjlvy1mymeb#nfs
z#@!!Ul`57UVrmOVr`|k{+@1g$AA}U+u$jr(kykyxO=GXUk?na1Reu;wp!PQjyW5K%
zL4kJR6UfcIyd18V$^>#_#?L(rkFr_Q^?dMleG@SEh?e{Qc$?xv%Gvlj=Zalu1;32<
z2BO*#W{gi{J|1Lm8R<sxQx}-B?Y^ND-=l#nmN0nJ-E>yo$@m)mY{50k3mJlby3Ud>
zpPF5$c`n>3e>J*yYe?KH613`40g7ds*!8IM+N0+_2!XG(ENs!x3GeS89=tevxmSCh
z$(T|zT>(x<ze<Sp&uP(ww&SPoZWXAnjXIfK0Me$9W($`<sbmB9>O-yvYqTcXZ0Rd_
z=o=^t$G1TOeSFBPYg<A>RIs?@CJRzH1d`L7a4_=1@aVY?FLpuREuyHc<WTIyPPW2h
z?T>me`1nLi<a<rkg*)B$e{Y6tmOPq@bP4xtxEmeA5}qvThmX;=5!sNooh16>pa1le
zm&>s5E0V)-_?Y&q<sRy=9sp-Rn7{6RZFhpxW@NhMqlcEl80&Yjizp(}@G1#qUo61G
zN1Mf8ajceDi?#3Fs}xfL1Xo<5o!Y%{p*}oL4xf&o$SfBZoF;3RquCk=+=Hy_PxA{3
z(4ef6%=@xC@GFo@4iY-2s8IZem%}uH1hK+`dV46ft)s}jj?UiDIZU#+`ZhQ#8Aq88
zp$8l+X6oR8w@8(NTB{%%0*WwUpIYRwwa?a)%`d}9_Tv}dBDL)8bWeNwV7LCkgTu4#
z;d6cJxbZ1&@q{}+9P{aKRhAn+Z*x9=l#r!<r!vSb!+;<Gs3R?h>utVqoQQ(EJ%)he
z8&tC?@M3qTS8sq>ymE^Fa~xC4GXMT)K&1)ohi;w8)__zt;omv%##fqCITd0>fE=F!
z8XJIPpTT+Rh<?nY!a4(j`XCxex5TQdpdwt&ahg)<SPC7xS<re=(H^V@f=$f|(G;!=
z2nZXS^-*X%oRHrHM@8#ycI&D)=xE6>39fVZef#rA=m`J(QF4*>Q*i4=r8;5Jf=0lo
z$3tx)J~*=!nEXb2L;Gp_xj&od!$GjGrEKg4D6dH|u06Ryzi1-nB#<BjM0S>E#eYhm
z0qoc3pZl?JTnJ9lX<=h3wdZb?NeW4zX6oJpW+(>ix^CU5ZK?{mF^M&3c<O1g-d}Gh
zx>rV3)9Om@;go6cP4k9}Lnd890=8ktK5&W$Q&t8;)C&KxV*!$^tJ&tB+x&8xU25rK
zitOs1?(I0<@Eq$*R}DYZdd=XmIS6jzFb?^<9d%t>r!F6x;$ZI0#Y^WNShO$~4ZGy-
zxTTxK;vrqM{!#k)&Kp{Dt5!xktc=z~9}k03=ohODgonW4dXNW&hM!^t4Z#0ePDEHZ
zvNx5HA={IKPBtzmwi|<u3EO-Vj6SI&L|O1R@roz9<dqS8m!a_n`0dry-KNY^iI-v`
zH4bpS)an9T5y4>_(+ruXyW;72$T8b|r0;Z;f8J!tbx_rw+rSH)Rb)tXhhc~jiq}XG
z_TmNdy!-Q~ICpWi1y9_SF~^IVhe!kXgO*<U!hQb*cJ6))eJ%PEoXa;q=0DZdK#a%_
z9*drOw}8q%t5BIj^R?YW{L8OT7l=fQh`9US&66OtsO{t5(zb|Sl@7udufQzr?k6XM
z#j-j4OyDN;ACc69PPVIlpe({BIWnP^NUy27-rPH(xj!h{i2MArkO0|<u{cxE5eZ48
z8}!~n!E1L^p|+x%2Wp<__%;kk4dPKn8h8IE65hrJg|3G$adTVpu$vh?*sW>{tOU!^
z<OaYVEwam2(sL3Q$;_4N?;f7Q7m{~OBW0{+(x2&@zT#U*UAK5FeXNpF7GfM1qcE!q
z=bxQ-lJhQOI2@mopTVMEp>aBm@HS+yTSk%CNX{?Llg&+BI+ZTbVoqKT@k->Qky}`I
zV}O|)WAJ%`lz1ua+2c-aVOl;{$D=0QnvxM`%Z#GmFbZ2UFPRKsF{FGuz`qQKo4&An
z+cr3?ZP4GEVz@A`lnrC3SS##HZz?af$~L{{ufT;Ze1<KYWP$=0Qm|mBcv3^(0;;Qo
z0p<9QZLUkr%_oy7s2A>Ah_#rcS4egp4BaN((l*rMf@DZt!9pH~?dcoMjY5|-?ZNrm
z+S-zXn)YXNrvV4^s!V^&>zxW@z9_8QYK&3rVy$ATg@Q2Lx?pt#$XgL=RPo-R#DZ-$
zTUWFeeg@Mh<RRU~X+FD^CooBLTfYP7b#z0bo-Yp_^^RX|Lt+WR;ehP0Gn|(*RPxFh
zr1X%10n<>%u7Pm^YUD5}hlRFseE9riX)EAkOfhlA>wmZ;<5_U75vK=472Ig|Hr36+
zDfLcw55GHDsjI$xTDqy<D0I9ar$cRI$L!N9DPo`KAjqWnG=S_tBMum+*7go|j-UOo
z)>$k2YaP6X9{to=d-QP4;Ag|t8^7&+R%}qL^^>b5`)_7VJUbcPI%26AT3~ipbEG!#
z-~r-`7o&^}B)Fs4md6@@XAuG5j>LuQ<Ee3E46d#1#>&EcVNzw`drQ43^%(%G8C2Za
z7D<QP+6fM3hbao)WFsdj;2ZrABeTYeLR4q1FA}4}600}XJgK-ztEmZLqf@c@X<D*c
z0jYcnp9O?T7CXY%l*VF&0+!m{NDv|b)e<nVs2u{Pv&>?}iwf&_A12$mPu3_?>Dmvr
z&b?nJ>)LABGX4|C{U%8<pC*@(ZNggtQjeVc>}}ScYbcK#8aLKAj>pkF&iJ*OLW9QX
z?w#X4ZwNwdw!|1S&E_R|V|f$-${K8UeV?qk?%<y->^}(mY#Qz6m$VlRV>ZKKvoCkZ
zDSj98@>W2i)KUZ(j`?Z>ZwO6Y+BfvOm9+L|oJe%x9=p||->FvvHcU)|;4mQ>Q<Gcm
zc$AInNQZRuON^!BQ-jB&aO(gcdJ~xsn%mjmbGO<Vk)x-#?;r*T7w{$>;}r{<>P>Rt
z?yA=v8|}c4Wp5{VkIyQ7{HmSo_6~kHd$xbL^Nq&Rx~B#glvA|%rEK`%Lcip5ND7Ys
ztRHAWKswj}4XK@&KQ_P2$7isv)~e`cXY$(8i{g!1GucTt4uH>eS4%vGWx>dzw0}1l
zO8yv-;^sewhKB6Wl;Jhea6|4RDu(@GmX7C>AZ8OxqCh07UFAb?!$?;nWueTzpVRlP
zzTqYNMe*9rLQTfSO^4HirM2sH0LSGTFMl@@%y1(`h7H~__gre7ricrUAM*Z>AiHvi
zeeqygyrDln{E4iGe)~RikFSEvQMWKm7Sv&%%98RQaCNC!J1z4*Npw`#q6~Hjm^lm&
zzW$P`$C^(*BYML`+!hkx7s;moeo<YDl{R(nGMQ=66N%Cyg^itHg+Xy*7c=>W{umOw
zlWmzzZ#f|+CF$FVnVTeLI=Qp#cn@9nwx3N<@N@c(B#}xpTu+^qc({E=DU7M^ied5a
zjKTk~baE>=)^h&|%juq+I>9Wk#*g^`o`E#!R}Ml+=W>xk4BeYlGOiP^X3rb0B%A%y
z;?9qI-QB~3{U3hizq=>ElWgf+!@g=~v2shWMpxPFz|H8{?f;o))7w_RL-g9=1Hu3H
zJ6N{hzFz{U8Bw*#`JZs@9nZUk07h@(sT#0++gJv6{}pV)8HgmuXP^q49Ur2f07_yc
zm9CYvK|u-afaV%s+Q$kVux3)*N7a_8uYvj%y;HTg1!vGd^UmH6a@fE|oF-R8cYzO8
znsdkHEM;Q~6@E7nh7%|^H=g-3r0>8H<3KDHt-v@%`qQ>N|7eS8`O(&8QIM9&Ps984
z-Q%qbC%?lXhNvssMJwORwgAlvY_HPh<E`L5G|h}LhnXP8O#7gX5qEG6$oqfXN(iJ;
z3eVXQ-mu(a-SOXM(+fAAku=~Il;jAGC36ow0CNK-OlNf6+BVtwjL+kUj1`gQVCrha
zf}hoGjY@PiUvh9s<M$kyLo5dhx-4i($mV!H4xF*J_P2ZZOl7W@yJtJy{r$6({lo9}
z4__p|nvdMkII$lb9DaA)Jqlx$a8!{f>~4@7g3zQ2AMl@H=5Ybc$b;JiB5a+gBjOD0
z*G;B&B8-~=E8fdj`=@&kdf)eUL<(d%2!x&+$P>K)V9sLXZdm{;vF)YF{ya?}oMSRm
zaMQw(;aiLu1X4g)|6%$jD+BILd#;4_az32pdzS|o-wW4^b&uqYmAZ}1za6?g&Bpv{
zcIN2#@TmL3ajDQvu)GJc{NJ@3crOrW&_2@f@3mK;*rt;pxk~tM7Yfq@5@Y2?M$sIy
z84xGUIN^)2drwYp>9#-&>7mV&35Bm>AJvC_3mO4o0gSU7bcAny32s#SXHv){^>1%6
zAm=?84LI1h5B_bi%h+>3mo%CWo&k*}8_*xT1=sJlU>C$To`ZgCnlMCU2I&@2F$+2c
z4Yff1YGCenXm2+gLI>Jnr@j-vy<*x}0_*^092>(QVq-3i0KdmK-S+Bgl7M64!$1gi
zN^!(`98F}iq`Y>_XCTT_Szwj`;a`H99F`z+WYbTlgVSj`E>n!XM-@dkVSZ80FJ6t^
ze<%j5>ogjtj*Q*??@q<TC66AZGq~a6M{%62IJ@2ueBCK+rDsQA&xR0H(ALao$sNYR
zS|}t|>|XpiIB*io_QOq&1s7;A9LX#jO^T^gqtwp!AfT5B8^H#Hva^L^@luVRXS=v2
z{i_9?(-rvGDqgdG?<2kibY($kZWV!Km9X4u=E_EZ6H=4E5(dU{7Tia|)}fh{1aJUO
zK!MWv4r~G(`?~wG3o*=e-J%l!e!*9KevsIqvT-rLx@N>|XvuN6G6&NU2&80KgP>mD
zBgs6DrZLiqOnl&Rh3y$(l-Y&_?_sWsIdlLc21RF6^p6ym3f*3!$xy4CGOz>m%N1EO
zaq6}(RE=%>p?FJeAMZX(%JhwE=E1PQ%Fzf_23PqsL#G7MqhkcFso8ZKpmRvcEi=lt
zfkZDVGB{%!`A0$*I;C^+pGdwX2FZyO;@!UZT{h!G^yndAy18xZzd=t3t#>M7)t~=_
zUn_RB#Fp|w0-qZ>$F33W$FVrsAn05WcA+e_shN;FnOtDl3}kz<hHmJ+-8J#*A~yx|
z6f`7N#<+dmLEce-cye2H>8?+JwlX_8%{CRMUPys5)da``FpQ*K_ZjRnQQu&WCjc7e
z%@=pjo>rx%z)`|kyEN@dCICC^dDSJYq$2_9m%8?05oKL+-XYDQfV`7V@-T2EV&t(#
zxT9rTQoW=+mme6fvJDv~X$NM)8!o+()Z@-D<pxIZcJR}>c8&64yEn^r^5<XU|8rAl
zfmPK!WjZG#{Gai2pF-%(^RRS|uz>LcQT_Pvrw*f1W3EYBq8re@-wEOYF0#vljYzbX
zrA)7b8wYLv$4^@_9B5D<O!-B(M+H>{VN&Mt9~85Us{qh(L;gh@>K5*z0Ge3q$`4WY
z!w%^Yj>Qb-eWb@<vMJOR5a!Rbu)zsfjNm3Cj2ov;I^uAr2u%<rJUK7vf}<U~fRF=p
zbCv=&$k!&sZAfgdJLF*a1bTqMOPI(#vaCTj7l3|9zfxGRyI`Hn2c}WHEraWlZWC}-
z9=O(=95X#}6dxIO*1FGjc6-lXe7*Ny-|W9UI6V44$0w(+zWwg|AO5lyJ(*tg9pAjV
z&VPPA9F2>~UmZ2f-`u>t{Uv_#;iJcY{L{bx`G5b%e{P<wIeBm{Q1&AoQV(`8+ZzPo
z*W@Zha~$rO$<6$ZmfD?%^49I+uv9gW?cgJ)Pil-a(kCefM2KP$V3t5U&z<kdd{!I5
z+Xv?GG^t%eFR5}|Ek+W9t@b}Pcjcjfh{^8@$0L6IRfzFRN79e~XdlPtb)gU=kQ<@!
zI=3h$uIfK4SOyhD37A3$Pt(soMRvi@Ch<VAb767lq9!$HvI)(Yw-LM0{r8J6l0UbT
zU*R#UVA$^;J%k5n!htLW)uXs-XqLLMcH~w>=PV$B%4K525|EEMEttL3uDPom43Nxm
z8H_Wm7eZWs&MX91QvLY=fz%Tvw4ySU1{1jzE9Y1V(Hp(7(37StdS;Kr<Qo(SJ@}pc
zA4E~lZh@XEv@iQP$on%7@;!jiO85wBYw@QoUIX4(_!cp~-P0M<5*J2qfjJZ(0PyVA
zAa5h7#vUQ|!5e{E#_l_JimYob(m`QF?w9aG&`O<XJvIt1e0-eU<l{k0bU)nK&i!F-
znk0q0H5`iq4TFY9D&>oVRffYl95WzhH7<RWjryYr9@Nfgw)rKc0#M|u{M~L>fZF8;
z=6_5%^tu59J8Jo10w2x7uS~3}IV%fWt%-bO2bz*0;|e3a_Z{a$c*3v{ga~b3Z~_t+
z*-7;cI&Z2*(1GI^#j)UBq^vc}$M8Ow;ZV$(PqFjN2PTP$&$XIQ=|ub+3*2lm*grh{
z=GD>JPIu?)-r33CUwX+O@2zxd_I6u_Mf&&=tOUg*?6=Q6>h~ig8_|<-3O_at?<X4(
z0UQe$7R?&&ehB2)vS!zx4dXUUyK(m5^uq!C{L_{r<<G>69>mR}X+)j^KKm4xfC<IC
zZw3oeo~IW6jhv%fq4U<9BX3mrM0^P5KdOxn`N!r;ApM;!Vohk|906zuM?*S-`gfA}
z<*FG#%>)edHO`5U?`%}X;W#+}Xop9$`K6<sFG2nw3ZmcZxE_w2->R}YgTg02cVu%y
zrQHEXUc-5EBNY=x;O=#Uaa6MC6a~VNJtx8Ox99AsGU~wE1s}dM3j8=}&Bsn9D~4|}
zci?zu_IAbatO7gQz8u@U@z_EHPeRch7}%jou|{i4KnrkQl4aLt$f8vR;@E1NKnmTh
zlhx&d^r&0NgH1utbqW*NX7m~W^#&S4SWR@BU|<piL?=EV+L{VtU?vfPkp){}JreCb
zQ(j$~#>Y`m{ZGjCSpV;b>uir#kruxF{6C%;euael)Xn@ZGV;b`a}(k-+;D!>X6`3{
z{^L*a{lLxtS;(UTGJtYrVX>Y_8!2vBs`M5fzk(HurvHl82BpG~AqVg$j%Wdr9Zs=W
z)0?m%{4*rp2u&;Gb-$S05-@^{A9^H(f3A7b_>|c3w!qE;ko;8H2s4joPB@;BxZV*J
z8Y^LYj0IDdoRa$Q`RrUj+1>f%a7u~z8uHoUI8U%iBIG^&IV;Q`IN~s`A3ZLvZAums
zh;&On=DHib5o{Q<%$r}r#4YWlg8>e%2lHyVk*x)D=Ts04po4&ywQ9P&&2@+W;t|^z
zXEziNEFHIW!aP+NBu&%|lU`dqNIx3hIApc1ixmbZq6Jb65h!N>LI5xK?%e{Uj4?`t
z3X)!#3*d?vQQfKPqYQ(;*tCOeN<!+lk|Vq~aB&^09Ap#6xFnjHEGigN6{v;XqdjOP
zc&w9ToJ8-)aar{980$=Iq99;%ha_>R%O+j4G8k(;F$H7;FJGOU0%x9&^S{p3>Wgv=
zS?W~u?ib~4iBP)FGFoca_tw@H9-0{<5s8-@iiH__&#RI%f~-NayZM(S-TWo_&&`MK
zI1cB;jAl1QvbK4)W`@1xrg2pi18Ty_87Z2!&>GcAtQr3N3z!_t?aR$Coc25@reB^D
z@BlwTZLH0vS+?07&;GKOjM7^yw3)1(LVRNAod8Ps|D;Z?nP$JNIYOXtmkXyvQ$yf9
zo)WkPEW#Y2xbV+mHls+vY&a?F!e8tH$+nRN0yeG}$w?j>zrz`p__6SHcY!;C$$vo#
zlBGu5BA+UWtM#LR1{`;X`EEfrKf!m>Cal2{u2DN9@UCRst+8k8UQ4by9a!8$pfL5Q
zP%{uff%@4xO>$i{zD{z@NQE{^&F#m0?1l>Y6>i{{o_th-1kn?u3N*T-V2Y4I#Smr~
ztq-4MYQ>O)?b8xPt~CsB;b_QDA8sZ4QvD#&N`!9Lucj%4Am%fvrblr*v?okcm}D}@
zFA;@r#?iFg5+(GBk;tzhN<ZBBBM<3lnYSZfYNVXOe&Aw2CNTENmmDXwMN1>dRfCH&
zc#B%m62=f`Db6?LTWk`fn-`73PUTSu5UzcZAiv~CMeYM1Y?+&)I2YOM2FedU#CE{M
zX!#e+9#Th&K?#K`H#TaL=8UR^VhKHNF$?t=_$0=f3K!guaRH)NE^J1RAyyg61>Zpu
zsxpmHQ}+h^Gz@Vzau=vgx51w+*_bd(=k$l8-r39E>DPz5XW#aYPxcNEI+a&t6X9aU
zl%F$qQuo~l;A?*7CRP7R3F(yfl@s?t^DAj_dB(0w|5o?#`7wRg{31qv>l*^&C(p)@
zKX{NFV#KWzG^oa2rNKdd1y!81$zA-rc>tqqbT%*3D>I6h+2|E~vS7ONx6z_@=Wmy;
zE4&r1E4{UNX<>!VvP*CThYQui&zfJHkB9mAwSVUo{@wgMO3C{4j{9qe>Aw2xAcJ%@
zv&#6lJZ~R=XU?wBBFP`VCc3D2dWhj<!h<ZApf_KY&Mn&<tmjJ2!Gj{^6g7<*3SOx_
zewLd|eH9^XktlJc#>B)463h8+@7b#t$?o2Z-pT2?PvdqwzEWG7PmvmB$WN1L@D6Ln
z;DiwTK1uso!x|>ZI@ku*gGAyiM^LFC(CXFqXU}@i5087mRY3iUzwJK9kmucJ!JzL*
zH?@PVp`#=@@g?nKaXRYZZmbAQo=>R$>)j@HtN6sOG-BL(C}Wh79Rrg_XV-z;v(B7u
zgb{3Lo-Wy$3N@P`-C&sJBLIyu5iNYXO})wwp7&w)7V<Lk@f)-TIT3)`hH;C^OjKh<
z=xvb3oKP{oRRlAXt*(mkIE8T_itm<jUsGj1YFic*{M6YxpdAoa^`Jn2wDNY`#|Cr}
ziF@5?{hTff#tQ2YqX*z`P#&RJF%1Xn8&9#UEN5uIGmbJYZYhP6_7^mOvM9znJpwp@
zv0P2Td*)t)>|i@<)<tH?4dN2`64tJn=lictzV7btKfqsHcP&sD5}Z8>P4HX0BWhD1
z^KuXdHE+a+9;ggw&z+WZ?HWY5m*O><^<X@@pupbm#Ec|e##>oJlaO0cBh`7gBBirY
z16+*}<XfnuSl^Hr8pXFd<A(RfU=7Gg`Mu5|Dk!~xqb=5}Qd=wL(>?>4XAn(BiZz^n
z&LV`!s{yy$C6m34jG(ZTF~rJDF;kw6Ke81xbWQcf!oA!Y?ESU~%}&a{aw;s48-dtK
z;L!!1Ek|%uxHx7|2%%z|63xj=+(4cXvC;`4D2T)BYph*y1QKr|bqK~Q#{g;OdNtv7
zeOGD#d;^fJ?C}Dw1#Pjqf<#fnfo5PfrlR4QVIO0L)upIO&P_Ug$>PLDtIdo_OX_KV
zc*AHzl*<c@jr@LfLjY5CKAvZCKDqcjT-~DJYR@P5%E_#lwA#wLQi`bII2uE)DK+W8
z1zNatied?xFB%xfo8h-3h#tBrrl?I}ooM3agJPVafl?o!wk^MhXF7hYJM(E-fDxK;
z9HTE@;1?WBEIT=ys+5KrBaS5PPm8iNiYO+yD2-EQCJ`-*f1?cY9P@I7cgbss2KK~E
zIW|sOa5t0Fk4E`ST&_vOV)L~iYYwYMo4E$M8F##9dM4wC<Lp9#zAwVpq?2DliF&sj
zV(e79MxPa2bI2;lG&0TnUCi3Az@I~O38r$6XPOISE>$!H`Fk7|w|>Q_RjsFBg?wE<
zVLj^*<^3kxq&7B3>D$fH4PcWrpmm_^%lyi1+%&@nWy=mvdxSfp3~rK2NyaoeN7%8A
zbM3}D+$|5EPX;E+F|i>f$nc8ECPBedH~MvHjw)l10D}c4GG-GBEXI|$PZA?F>;-L+
zHq;FR6fvxRAiE1@j8geEm|CEzYrwuA%aNHldU6uakmG1>GQvl?r$Lv~jA|ATDw)Z{
zAiE3liKfULirYb3RAuZSK4~bX2F=B|EVyAFO&Bk?>_#!eeTWcU>&IR|NqzAKE}x7q
zMb-t|*S4NfDp(xsJhRGjR*-cAnS<|veTAIS_a>d@VhBP(;c||KQHIvcC0hv^60<gr
zu6wlC;W$AJ3idWDZ|oXD{OE+8I>d+?5mQv<<T#3W1vZ|gLrBRUfGPKsJSF}mg!4Br
zCWm9t<m-?@+L3kU!2^Ucp#dQsZEbA@PsAOA5l8Tbcb!&(Ff0Hh;z3eCXAUE<s&6bs
zEs5h0JM5>43~1tc38VIEVjQtO4r%oM8;aq0*Z|hOFmOyG4k=(FXaHNlYuOIho55Nw
z_;RBiPv*ymKl$EkU#$+7!*4K1!@N=#gTt-V1>yj~Ja^|vt)_Jkfu%<u0!_2-A-0*}
zbH*xB_o!H^@L9EF)jdgOFno^e5_J!ORS6$~>&QP)iAf6I>dxQl<V90|()_HhfoR)N
zq#I!0@Hc0(X?}I(*4(5UCvP6FJTh-3(^>H)+cZA1k>S&%fHpk{<}rK><oBkBNWP&(
z$6tea{88ezHfAFTQ*BjgaHE|>6wc&YaRC3)52}xW&z(;xN6YvK67N(O@DTdTe`{>U
zZfO4R@Ci0$>Jxr1;fc^9j1N_a8AoF5ulQ6%#_){VbnyX8zwj-aknuZDxX1wDBRTnB
zK2085H!}{>+i~gH$6HkjmIv*8`N8N2n+KJ2Yu<>+`d#CA{}_)qv<1`Sf8462Yj|8O
z!182F)8eW(kA(D$t1q@*dBoB(4IV;MC$}1f+Nlpsr8gk-tUDM$9NVc=qFX^GCB>~N
zlvE{{iBn_{0Imdee2lU?=kav3gm@gdLV^dS<e|7$8il#gMmz4D4zrmU!N6OlDqA`x
zbBDp@i>!kIbbB~b%;e$GLL-uRM43D+eU1|n^jSFtVb=Bl#>N;Op6d{KLFWWx3Fm=)
z@QoY821Q^5Y(pf1AozsRwB6IVDOr@N{oU~%pilhzYl2U}Kx+#bxv|m?qL$~D6b1pU
z%El5Rw?Z<-ff+VT<SH9G3B2!S#%*9_20<0+;0J>X`WI$dbRKHzYJk%!*^u}o?d#K|
z2q-PwQK7nSS<Xiodu(JxHy9Me+PWjb+u!tlApacxnUL>Y$!uB)-6ska<%vm>28rVM
z0OI1<<mUAjp)UkK5kk|<w1EW4nJzHiA2httWOm!(L5-_WkpN(bmd&ap>Z$ETHj9N(
zAvQ}-Fh~xJb)=)r#qLA(Ti1~+F*X-fiV4@ZM*gfuQThH%D3!37H(_zDPq*d6;wI3a
zgWYyo9vU{loSYJ5Cr2P*WagVZaCX=6f%e~nV2H28q|(Tk{sC!)1ED`s4z&%Y!H@$?
z7WQ^fc<jS<DyhCZWN#MiHolc8aD<HERrnDh6{>4ej6!W6GY8W#f(c>)LNI?rU=I`m
z49z72a9|+_LOMw=@?kzhuN2zd5N=M=63KluO>;ySLI@#uS(3L5tUzz^W{qQi**Q-!
zg@y$84wH?%umqSF#0k7mQcTGB9A1ToN2hy-2PbD=cMo>mpL>T?8tEhe<#KJ&$~{dC
zkbPKC82(F05l87b@3-`^H5{!HLg>P5mDeBzg24(7Xz%cOdn@rdjBCg61-oC!X}}A;
z{)cj1yePnb@Ne@X1usFn(CPXghQs+fM`q)G(;+l3u<;ZPUW09HZ)>d+tU<V*Y&5HU
zAAa5nQ~9vG13ZgE314@;f0eYTYz6;~r*=D8L%{6zT2#`pgj{Df{H^<lb4;!?);1p$
ziFV;ZPRR>Qsz9Er5Cmohl9?Lg{~YbT##C9^Sf3#a;ZQ)du5YrBVYN{7USP!q9MG^R
zOBMcTO}oP(7=}=KCb(84owD_hmW+oL-aJrEpcb@k4LSJvto5EJv<c*Gr4+ep&gotA
z;U2}r=vGQp42%KIi+Pzi&IHKE6!46i2S$eg7uz_;0$mh$xx$2rOG>~U2oZ42BmElT
z!HEnkhVyEo<I$=ad*$BY5)LXJTw#2gB#ZF;W1pYPpa861jRgsvgEQhBKsHQ+vxd(J
zJ4dTGl0+_|x=xl854#4a{u3%q0w-^r-9U3bVK6Aa3uAu8<E_rvq>WS*D4l*g;PtW&
z#RP1sLAITHjH2h=(BT<(0I-!QbmUg$Ot*OFaJP5%YVY7QD8fi@KTS3twF#&XrmwXz
zly5>=6?!-v5r=#5fEErWj^KaqzP0W*KfbMxn=4bYM$<tv^=SOY2cn*Hv3H#>p&w{0
z1fIbqRJw391S4;zp@lSK^Y7tH@FG2pj9A(gkrZti^l7)u03Azv{5Z(T^|VDB35%c`
z`7ZPmm{h=+fO!DVZk_7w35QgU`zz2-(5(&9aKysjZ5z2gknQpa^XQ?{5QOIj{LUWl
zHj1RcVQVO?$`(!<nL;g3n2&)B|E6m<f1=OjPu>Cj2}HB|Z7Y|IA2p!_Lv_92WAk?7
z)B>toVQLY<HqGw+rZXpxS1_h{muTK<<y)1hM~W)ND`Gf?fat^*OEODebJRyZo?vi7
zZKV=u<J5!kaQp<sAdo;Vs&c&QTtT$WP&`yr6WP~gI?7GKb@8#2Ygsb_27craiX;{U
z&)H%^r2c9Mv8Lc``TloQ$v|Xxyr-zb+NZmzf+}-5uJTh~S9PpLDFaTUqe7rmr@7uF
zJ2l0g*+z{d+OX%(Frl_?=dBkQDkqxaegE_XaGc)oLhGQsB1sw|EQv2Z_^D`OPvnMD
zxvUTbM{W7fcx&6<ltygMyj6emP`Ri8HPE>D>!pmSaQi0|G?+FTMGcyINqxN_FMwZy
z=#U3GTEca+zQSJj54*c(NBiBqgJj!(aBz6g>m<BFegR4k;m|0Hl<y&jSP+!v`weYv
zHTRoJm>rI9mrC%c7sm20qkP?9$tqGOp?XpJrta3Vya`*=3yN;65Yvr~y&j_uGi4z?
zS}GjZTs-7=!-yrh(9nF%ayeugKnxACL9GQLg-5uqhaEEb^<~JBc{@tdR6G~7s%u?N
zi1ln3Who|ZcZeu4K-Gx)yIv1#Uoy!!qtcth>ubL+I?a(fT{-?aIJx+^Esz0&J4fSK
z$H{e;PRx$+Zc<^64Wt|YWrbk67-+yz>WWfZqVVE)9>vMm85oYaWM><*KBE2fJBeZ!
zBu5r89-?=RtTSs{$0{0be<dZqiA>SWF`pG9hz`TpL-Zkd;0T5nW#JB5Lg-1L>{8t?
z)IW)4Rk=(7UMs{=!>#LC^n(3<)KOmbzEZN`A}lJq12VrDR^cnHCY|v^ve#1Jk<d0B
z86*ek0Xm7s5cJGN-?(~@L25<bM&at}+N_nKcd<K15V7FHU(~E7kMPqQVs;N-J=^bn
zI{D_Aqt@vyEd=?~{;r0Z-$a9SlL<wjA<k?g-&Ys6mD?(y4}OJDT@!`;E)6YAJB{*>
zU5#c#%L0n{yV+Vk2y41@-OrYACVb|TF{bCxTMb{L&uiEc4e!%)rRPq<{e<>mB0*e*
ze?FdM_OO{HS<0Xnm?1Tg#_y6J5!E!ZBeM|8xKSM`{9`jC^g;g~g{6HruttH&d|AVt
z%$!!{Q7GeH%rAd@+5O(>(FZU17CYPdx_f-`lX8uH(>A2t`m8brX?N?*u-WE2r?t-@
zV4=hUIX8?ExPiL>LU`&GU)&#Wol*-I02K}%(=#ooI>KS7?$<Vj6?XP_!SrzUb?^Ij
zU||nLcDF$AHW`XO3S+4(e=~cjY_ffqInAQIUWwgQ#`7dvT2BFJU-xGHc;W7c=C#kt
zS*0`DpvS{Oi_LMJfIql~Q7J6dHWP9K-VjbGEf7zJ9CVyKO%c|xIgm}D0aT2fUyQTT
zM=5cQisa@R@X}v14g(iCRl6r$b+oEwcmB5JxLN`j6l8gWs42yArB`OfEFGS4wy%f6
z{zr+$_}xH|E(1pXEQrttY{6E2DE@ugrLepd(lqA=hiw~^xA8Dwz8WneQUMSEG}}ou
zY~2pdz5MhkTyTG@^m<oB=FLapS7CX+klILms>Y}&K`jeX37Y$8fsPOX%Gn(d?9#H>
zCzM}%3FsYg9)siB{x}hkfZ|Hfe;FC;<%*{<#&HFF$8#`&Pgl%G#84odOd6uFI%GcJ
z6C`vx$$ihnH9!b1;J?Xdb40jAtalAkQOjloj*3=N3GlH<0g~*=MQ_gS%|bb0z471#
zb8`FHd4l+Jb4v8aIMDhLa`YP~Ya@Ocj*~&;Ab~m^0Ng@ylChx-tDQ0T3~K{LSctUO
z5PUkmEFxqxv^W2Cp1Vub!?Y0sNa=wI4gPmZnZfj|8W;;09eQ19-f(Bn$2fL?bd#yZ
zb$n<oDZ4fG-JN8!HYIsasCJgrzRZK7CQvX0N;?Qa{LN;GI>PJG=Pmx;q=UL2vq>%g
zjbJN1%P2h1jf5~+Fx`ZvgOU`i;H@V`*cz0|1beL*tMOMY=7Vek6)V-bfMo0U1HfI#
z#EtOjx@b%qvY2k!CTR|Fy9kelDeIe@C=Q=9G~d^0dEKGFayT?TBGOH(ZV@3go?2;I
zM$R><{Z1u~aDkVuuf)$|{UH{~xpt$T1bBw3V&f7>Ss7j{?_0pEX9!d^i_t-j0-5Vr
zX_VptWrH~RnhuiNylWxnu9lprQ1FeoBs6M?P4gdwFyF~973#ca6%k@HuAwHAI6dI*
zc}J{)uQu7pz?oHbUyt&)^im7TNEaP=%u4F$45{ID@gUmgfj3?Qjn(%~`{g*y6&$TT
z6?4qATqCO@Tnz}IY6yKYx;5$+1H^UsU(-VPu?!U*SCubRyg-LxV1M{BRDp&~D$sB!
zd7;r7#@dc>?kab#UsxfN_Ib^OErrxhSf=>4n3_?&?a<gHl@R{Wyw+?~W-|DPl}Bh2
zyBV50f&d#WF{XuutNL29KANp_6*={@u9x6&vcNAD-zS5^NJ$mPBnKITlKMbia#L}Y
zGN%%j?2*D!j}+CrF3#X}1E+!^<nc%;JxGps0OX1lOihfG`()~L?rA!OKqOs}2ZL-=
z|A5x0%z5c?(F6^ic+dLotCvT#4(rEGPCGpAt@~QJaQzr=BlDG;pIyF~(<dmZcZ_3Z
zFLGGQ-OPa@m0{nZ5N|deO3`{8Go_PYd^M$%Kw~YzKJ!~ifc2%>Zwl2y-74@plVEai
zcq-65xJ-C8aPCUKm`>*ttPSW$<7bf5oFF&Gj@pJcReHI&WoQ%10OIr;CstynG-|l)
zxs+U0_c-LFZh6)#o=Aa=fYPY!PNWE-x(G1{7ou-N4NM)BPU)Sbw?0EUv^C_MPDulp
zDl)!%ZEu{<zH?U(v)=pMN(T-YW^2f~rncPEdxtw@Y5|)<fGFP{%{tluTRFw@)TMgb
zpsQ^l@)1<&=KGn_(NhJweT>jOZV|!eLAbk-<w@$mcxt=JDCtHpV7B;CHr5wgXs(s&
zrKCIBr25u<aNb)8jbclHMfiuNieRX^09#bBSstOXs=>!mwNuTRCIpX0CP(teI()iL
z_nP6AuqFZ4RW9k%E5v==h1Y?i{?EYcnu0yhZ^;Mow5W!CcnlXhIxy$od=i%(y>d`u
zR%fgI8_yoTYhWRe#$gH{jm)`4He~uXt5pEv^1+mPPWDSmKIcfX!)O1+A!!|+-j?fu
zu7NGjpQLv;B5!J2T3nhNE`w$yoNT6kmXBm+fy%O&Ol0gR;i>v?U5YKGH^O3<VTE%z
zSuhx`<t2X-DhPZc*H~z2!E;{{R@=hV4U0PB?eWGSAcY(-55yyVkvT<%3UGL(#{UfC
z$STN_bvFx-;D%t<N&gQjK@i#+C%ewPW-Zd=_;z-kduV;6<$H)-#x;h)CuB1?i6^;b
z&4!nOkPU0?)^S-daDOx)R4Du5B>+JH{?u~k51Ww@Aa#e=3L53B4iDBwrK&d~`b@9-
zU;*!-2v^dtTw&}@dWH&YI$@6GS_Bma5u>=9XSX}dGdazZr((SfeXm8}U@@h3zqo4c
z@1K3wJwAZ*7g$W!o;$i2ZX*RUvG@aGuSv*|b-j}$5Y`D@%SKqs`1QEB87l$78*5=_
zQJQNKPC%ZhNfve=jR7d5w|DSucRywx!Z<|w0ZO2gz%a~Zc<^!#WAvrXN$gQin%fPm
zRM1K%ZnM;+&AUo#Lr`R0_YugHuiQ#M$3|L0U_ev%Vb44Falbq1q^+BsjR!6L8+MM`
zuJKxYnjJ*R#GY?CO>OeHVr^w!CIyypM|_1%z6@LfA7q1{&4;fc)O2jB^#S$!#_!*U
zJO4Z2f$%V4pNJcNePg`?8^d)Xo5rTXv`~?D7S{uW#ws<c7LO>3+=lIk@~+W{7OYr+
z>LRaO>43xr_$F{_d^9(PW43Y;3G@C4muf67I>!GZo3ZQ!Cvop^x$75YFq5V0{(gcr
z{IFyjVw{esv~`NMSg7K|TOalB-kdq{5ph{Vyp5gH@6YxQ_D+3F4+u+7lV3&wNLkpP
z$e<g3m``mVL1PBNEXEgzp5roH_CktgA0=bgB!qd;Pg^k!EW!Qx6ap70x}E@?$hD7|
z{o+Fz1A%yMWGktVG_!>m+61`ac)``&2@-BsGc`X-f7pMn`fU0pb$ZJM8c7SXL=b{z
zRHm#^-zO6KCPPHVWh7+Q&5h+ZtsB8u1V}JjcN?g_w+K*%M+`lFl?XsovK=I2e7Hl(
z%)nh(S09G~JYZd#%eRBZOUOYUy4Pm61GapCjfw`LD?!!P4<xC-9a!!q2L0+dy|HU7
zkprO=iQ_QVBO_aS`7W?ykIJhb_YYs3VIWcOAhcowy_{*t2}qFG0bfiKR07U8D2c3{
zuMM(``PEvx&Fk_sagqc2l&K+91)JY?(#AzmX3_iK_Ku$&p7d5~0ZI_`;|2~6Pxp3K
zd;cayGh@^M%RZ)sn&BmA?!HXtLy`=1rRdo&Se)9TN#?U#FWcjzvgEGSay)UTZg$yn
zdqnP+0)KCJ*1q^d`DL;uNOE5#7Sm;0D)mWOzBjg^<a6yJXfxR~pCiGjaHs+xkRVQ@
z18>O5JyP&zcNDJFI?B>6)(1<cY?p#3$VtnBT-xtvlNsv1G{(&o6+JKDiR+HmFE^oQ
zgRJaN^9#{nUDL?)@j3SWBI5_$U}m1;q7v+;2S=v>FiW{8Ij$QClXB8Jw>PUhF#El4
zdrZ{lZGKh=x9Mr75q+M?wCQmoSbbWEvgvUq&+~SeisdmFVRv*D6$P6Itw`)n!5uLD
zaw3l)P+jJ4p%uh*=iQ|=Sy?~qKmgYRAoG+1HldU^!q4Lq)D))$`EjD6Ui#~I!0_QJ
z5TWfexy){`H!42iWG|b!1d@)Hz=6xyy)V8X4}~T5DC*4^&=w<fQ_)DE<vt7nEYDQ#
zKuVIu=t8OBCF)_s&^Go{+tjqE^6Qvv*~Y2>cg0ee=>?467!|CJ&wtlxnZcdoy86oE
z)6%uw(GH=HTD?**L$27t<3Y0?pr#l(iex1Nb9IazB5OwiT_D0)=TINaSnf;AA4A23
z>6N#WP@R|#s3PB#qFXh25rG;QNKKjpk3-2NvCZx@qVasHEsACDl{W`Ryon4KjAYZ9
zF1S5QBPdA`x|_TBbSrxcK3wqOw9jb|!1Ure0ehQ)gOig)OxW%#RZH;ctz9WCOXHD>
z({BIgV7j}Zb4oXoEj<9d=ZXLu=w`_U_YrGR6|YOKe-7K|h`~I@UeH;MaW6QBGHJVe
zS#>`#@fSrU$D3qV&uGN5Z1@&EiBBoqCEP!yL@-blQsK02fa5;E$BpwD5j0$07hHvb
zW6buur@e!nA8@_N2*xH=Fs?xA=IeYi$+Sj-Gz#C0=xCtA$-M9~znV|UNXt)da`&6S
z1KpV%4#LAgPeFVKhHHgu1=DdNO9_E_5F$YjTg_O;^W{?!llYS}?)Oal^%ja@+$nb?
z?SC{4<C#;U5yga*TV`-<*k^i%Ql{=Mm_w#2q5WOxTjIac!tLM!BW-h8Sz&2pvzSmt
zh7UJ6QE>pdFr~Z!aGp;!YCF9FC+sALxc~1UFa@q}w4j5i&@s<o3X#3{(mq8slIs=&
z7V%O~ClDeq&9N*I)Jdw;tROf&T=8tML+jmYdp;sXl5S93kqyBJNbVEbqQeq{QU<La
z<pBLpQ*WhI)@#2gCJ+Qg=lXIW-a$9wH{>Bi48XK}EyVol;MGZQx0Okh5C45R2>-@c
zf={GLrCQN6r3w|0*aZ!Es~`AY=VSaFu0Nc~w#Ys7Dkf1Crkn>|W+jW)c;v}QlWPRs
zC?7!F1SE-ISO#~DUK<mP=ijr5+$_eW!?MuPgUB?@((!!4S2%JieVwO}F>T<Z;Mqw8
z4bu_Ft#N68hxiIegCeF<R7ar@<lMOXgv39Z7@jNMew+<=%TE)@v-b=7XMR~XQNMl^
za!GY?-5p4m9Z))C<ZH<?s`n@ANZ7H!s)8FMFgkI^;{s#RvZ*a<HZE{sO!+b|EU{hd
zUVx;;pbX|d4^BWFO*zO63c)o+K~Lx7v1(Kt_9%x=reyqjG?B3v<#nU|S>%ss4BoWV
z;;C=+<!m*Md*cF}Tm8*1FDAugi+Voee$Hr1y-9sXLaJS3?v@&7{Xh&AsCi#eP(o2I
z`cV5o-Z`@(DAHV^dWP9Jj9c_?!4cxtY$1CVJ3ttf<Aq^yaACTugRP4}X)iYkrzT2k
zQ1VV3vpysWK^Ml%2&4JpT^YDA8s=yH3RMgALd!GSnr3geWGjTnxtE|b`7?Z24a@L|
zH7UyjYEgy<=nwxu!z5bwL2<h18*flG`r*C}au9NH%JdCL!UIfzLuP}x8_E!<y0@~g
z8J4Us%?YO4UUmw$bg+q=%54C$#p|3(R89k0p>m2fBzFU-<kTMQv5hWnVd@k-L5$c5
zXRqu5!|vcEbFWBSU@p!f#;C)f8^llA5@H3nK3Y#G-2oRcY}{T;2qdFhZkC|w97{Ly
zoUiG5lTqx!fNE;;b&>}O5xNCjc9JqYP&3!HXH9<!#nE%KM@)0fK4o>PYlnsJ{mMg0
zzNDW|`|}Z52ufWkmQ+H6u-FeI#z9T=uu5274|7a}iA!5frke6Xh%Qwb8Kz2LmO*r*
zk*zw{Q9CJm0%bM{;=5xCr`@6kh9w>gU^rar7Gw!`9lzd6_V7YLzI7|j@nC&WSjbr^
zRFb$@RK^|tQi_PCL!=Ag_XOaFH!({TWH<yVt-`&8&lKY`tR{H>e)1W7u9r?bI{iVX
zt-eGtdd8xDE0W2c1#;E`IQH$>66Vpzz$<W%=KRcbt}tZg!^816ZW`_@$^}9H7T322
z3T8POr|RQfsNm(yOG-}KLaUdkA5v_wBi<nQ+ju^rUr4j&GaJU!++%J7x4G0g)<^TP
z5NMgHg_RIT$>u`Pjg+wyZ?~Hv9dqEMY?@<8Dtj>WxT4e}rUic=PP2Z-<rmQm%4Rl{
zH*01;=8~Fq!@>5*R;b26$6IS;Uwl#|aDncZDi4kr(6ZT<vYYF&VCzO!3yqPyh<xX#
z0E*s^q-{*h8S^=p@{y4!sG38Ez`XqWBp4T_B`4SdugfgU2MSQMcFI|6RxHfLyQVB9
zJjW;-Tk@D$!m;Jb9p9K{SLqb3NV3*9MA$;@(KLg$L>B~c3~y?Z&}IBv;$LePB#mCk
zGpjYg+7Cxub`Hj+H+1bI%m>XwDF3#oV7V%QQI{JXEEL+dDJjwtB<j~VYd2_@a?19n
zKSIS-J%J))ODQrdPvy8P!#T)nY?aB!XPIJx(D$fThEKfB`VvaENG4wxkq~T*#3uYU
z4S)qmUkE`SU{T`p&%KuLU8Y(K4;CnmeJ4h#1NDdRWC`pPa+AwV%{{2X@4Mx6Ea>H{
z{nI@(qo`?wf?-i$mpZ5y94ko;iAH3!jdr~P%f(5((FM*7LBg>}!6^-Tg{pB*F6*a;
z$da#;7Cq2vf9^kSC)<)!AKaKNBAQ=+73yfa22eNJPWt|N74$1L@Zj6<JVE|<@PU6Y
zK2>Jq)raeZX};nSYlrIlK)iT1+tp`xM2l$4azR_csdcRcfBP=Y6V)$yQnGSH0?c_#
zY<K*q>m0*4e|?(l?C<psP8mtYO!NY44&rZ6f6#vu3rSB&fcVTt=mbKOM^3=k-8x)N
z3nvMm!7@)9za7l^i0A`yJS!w-!V0RS<F(Ia%*2l$e$v6<7?zA&H2n^<vaiD6Lp9|x
zHA)1jwYtHP1&8xwww7$){dK2qjLQ_|Kyl1hg5tUIQW?V(;2fV9Q<MYyooD-pJKywn
zdAB>r*@eT4tpJ5C{f|+2E1hZwBL7D1+jmWH9|!eZ^aD$!b^6-bb9{GbvBY#Rw6xTi
z;y^+R2SPQN<`)!8%2LRBz041_JlZ6)K^6}3KWldqdDN(Vh_}hOKX{87X=}?k)Rkih
zl4n@0j`OFDq$XA0wQpz)H5#om%}-9VQJRmv2@N$wDzuaV@JM=<<}8g-*n)(-<DBzZ
zuy_~XjB^*!8r~vn^zv5KwJOtiguZca9bnH=3s>E{UsZ_;Yu}tsZ%^O_A|k$)QFHMY
zybcGa+gf9Ikzq&5AU=$N?`T@gQ1ygqm$0^*oYepU9*`rr&Rth+2z>L(HOUGdPaV!V
z+B^|DVtmVnbjP&D{o#C2r<b?d(p2_#GR*rqX~As*X85;1|L_0&kBSy+7TRO>Gz5Sy
zG{1qdOz(;KF*#w!y`%jf{PVJ?xD01l3@*W7!}x)Pw!DRQyoEMA+l6`PNw7kpC_uKo
z7D~w*ZTB_A9e3zoin9*SsW$>B{XMe2^#+rmBn#m?cQ6RVZoiHVSQxXwhQ2ZkBC(Mo
z<jS0OYP~&y4r-yA?}a9|m>@}U_vr}~eq&UspvoN;xtAN8yfHM;&@JNa`ZgBF8+@j5
z%@+;1lGO^pI>H^^2Ew4XX#}a1fW4d#7tK`zEh|6d7dOjFGO|RA(7a&svfQ~^RNyC;
zFt=rVY5|ZX!{CV2U3h4iaTI(`5?k`>0FU5#^B5^utH4Xk4z&ba5KT%BhHS?e$fMgb
zY1)C%NGnQoXla2Y6|^Wdk1&EttJ(yHLm3embGMtHuDGrmEt(xa9PnX8cNZDbJKoG5
z+tjy`=V?yyC~WBT?Xi`lbb=@P=E(pG#!nNRgdTt?+o!;uA--ojw`b8hNZc8mYN7K-
zTBO(?qtpnScw;}Vc?k6DITtQLJ(5<)+r8lVk_Xpmz;F*oh%?{VaHHH{K}_S|j6qfc
z*Cg~NmDs&L(;^-sAJJodfKt}4^z7uU!g2_I1+2VQ;6QU%DPG6;{CK`<7^vXS*^?-}
ziAa}LS)Mq}d<{Y))J2*$GinsXP;DEa)8sPok&Wofme<M|Y4?Nb44CfVR-g#SU$SYz
zn6JE;FP*4CIh$U^!kKL+&opjRrwjYyuOl6}c%nAcIoQWcCXMhw&@okFM1$J`#3qt)
zAO|0KKlE{1%tN3cwO)(dMuW~y-P0!+$`%^AYaZ*3p<WW8IH0IJjX=G`L#4Aa_o`hO
zaIRFc!6T6}vcLb%?R>QW^>+L)-e_!<aRmK$tPv6Q#i*izhYbLes?X4G<RTq0`x4>d
z+i1Xry(F<4gEV6Kg}puK+$mpkAfAzQ@~CtGk_N_cX44tyMW_Uk)+0(!NA55T(!-}P
z;K*9IpD7xGILyr~Z%`$GgdvO^q(KR(%}X+@K}s=FDn?R1+dn!y0-}BP7x&A{?)Tf4
zapPQsLHHYiWzg<P_oyQR7x_v8X9C;qOJDD<m69?tnU~i=m@<K(HO1GUQb*BHybNF4
zP4ftAl+8pOynD3Q@#Cp!_N(Ad1I|EOR{#fu@l!a1mU0E~Gw)UqYpQii$Td$fsyJ1+
z%1X3|f(f)k`2bnU02z*Y+$zin#!SXYfl%C(Uj%ijOtWG3CLPbjVdJ>eRmK6KkbkFk
zUW#L3k5SkjB?AEz%$uxsQp8=;8AIlt6hH(w{4BSH3x)ehRmaE4@zJZ3ua)9pB61!8
z@6AZ4GI1j>zy<{17%-w+c#nr^fN@DGg*R?eikAX#KCaB^XUUTKAg4LO)ixL~bX}3G
zJ#r@w+JFnZFA+9k5qIRnjRnBE`PDcbev{pHONhI>^%Y3E<6H3f-e9EmIvo=TTna;L
zYD^Q%U%Z!&{iAfYp*y;zkw<KY!TqXJ<Ol&T8xITLcS_ooZ4Xz?YJGp5XY)*O$nfNV
znTG8@blf`R4ZIaO=5>a2<VJIox%Hw=e$4=82n)i78z2}7d)JdE6RxZCQs+Ug_Yj&m
z5LB!hoU_K42%MUva+Cqm=G8?p<Fc+}SeDq%hF;2gyP9yt2G-Lt7B%nb#9Pv~(>p$v
zhRCqy&1%SQ!!k>i@uo-`%8s?ZQ)S+cbA&<f$UTGod6CTmSp=yc>}Bna$jZ15&<;g4
zUTYPeIFU20PyD1>N`6l1_;pE|BJ9<zlWj+QynvO?Cy2u|%-(wbRra%SI?W44jwF|}
zeygO2VL52XMdrnKttsjK?`~7F5$4R`J^)fct-n!Z?-W89AmDpgT;=`JDv4~28&l+m
zV3YT2;MXJJLjrmv9@99EL+w^l4<hfjr>|`xB#L+C%}0<b4r3VC&^3e%azsJc@RBpi
zr!!Q*>kSg*`sX+g>_h{C7O3HHW>G^8ZJDeGG$NcZ5|{CVzNw4KAf|`0>zZ{CJRtdH
zV7b65U|>46X&4k9Z&KF!5w%6vaNX_ZxFjehwppW~QB5qbLx!$9J?I*U!NHkOBrTSb
zYWSIk&9V={@CuD?c;hGzj({5ORcqzY&Und+%NYmmaJ)@mM|lN-Xtfb&%S|jkti_wc
zG(>xGOkL9I<(%6?>_-j>n}bLMCq9Tbr0CwbL`A<ppSDpzkt8cIp~IFA3Y0*6bF(6;
zV1q>AhC$ti?PRB-n$r&%S&f2zgU3N_M6DlO{}{Ct2D0(+!?mKz(*(4%@1|<<o%}mj
zIDcbc$w$&t1CM8Y%7nG$aJr>8cTU{tar}aiFQc>xo8%z$zUa;o*=mbo>?*0REHa_g
z!2)p{DNmY#dsfa826AJ(X0-27KtFK-V71!gHOBQOnY%9`x|MT)MLdBHKwAZI8dC_u
zS|zb4zKl49AdEw=jN35rL=c70A;B3?-qgKZSDH1xy-+Z&iPmgyg?`B3+h@0wH`EwW
z1TMuU+MQ6G?%8NQ%if;BTdn&+ADW2t5}vRaST!E$_VOqY8*0I>D3GSQg8`I!I8F0m
ztG<69(GI;M>{^TCup%cZWNrQU=%>zFcdhdXYg7a!5nvat#s$j=Xw2=XRpcToXPb_$
zoRX=|%6By@MIni+tW}MCe)vsria};JiRmyZF~Ll;x}+yBlAB{3Ak2liUs34qhs`yC
z78X&ZqrJe?cFZ*&rt?_IUGJ~kNd>tzD9=<wi9KHm&If(DS6UB!`7tK0@gbF?Ak%%-
zz<FVI=M`=%BRH3|EMwpoX)2V+N=`Pa@psio)mpaH1m~*U<`WoI1z>UvyOaQ5i4&m;
zOS4M33e-qI0Okr->}Vqy&yEzYjWB?(*3;KTNz%1GNAL}}QOrEhr9_96<rSyr&7r;<
zNMDq^DU}Cc46<^pVgx;Q#0Nk?4VXa>I1XTr15vIVa_(9oz3{lbtcQPHfQATI-8o>`
z&NvYwPyrvs@$+GHG1o+(WQuZ<-i$q$;L~nfd%R7$(oNRDHS+LA#+%<O3v9hwA_a6B
z!kRs-6qd=r8(a=Rph?I4t2z{Bi<A~WW667({dJyCgJ2@J0U$>BHCH7=*OQ{wy^U;*
zg{(DA`n89K@<Ccbz`qGvU&a0egy@fu7PT+}wn{oc7X&vI9RDLykO0Kjv$l%7@ILo_
zL;6U3KcdbL4q;IZwSG3GORBL!lpa}1EP~>r?lzP-$eebO&1RY8^_S@-W51Qfbb71z
ztsQ4I;#II4>+N1oDlJq)jN+>}euGG>U6(iwe!Icpd}g1sV1P?5LL<d56%D!&5N&*_
z_WB461%c;9Lu#x;86<nyq|1CtkvP_n<EaaK#OW?1Euod#$mKAuc0mYoumCY-$1(%N
zDjVB{PoOau-(_{JeD@_;w=PBMW2u7b(tydkpDkCx1+*-A#V)ZMvCxP&0dw{cAAr1i
zk_L|M2uZvH-#D})IWK`LVUcYM&I>R&wE^oTZ1$d_D=lM{5;{?&&Jf%`_U<Tcu!cu0
z!b7S{<F<PvxlBiZbgscujERtID!jN;%4`VMAs>b6ZQ56W_sAVS-trFE8gqRpC7Mk&
z3B=r^T4A<;hoS#I<rJd^lX}(N3eB(yJ`SfaD2n$2ow7E9eldRzN|VUDXyS;ok(*DF
z5Bje&3LrgD__3$?SXE(nP9%+~TPrgE5juZhQmBe)(sJgJxDf}-xT`po1P@774@NtJ
z`q!g+rFixg&B25<4+=CuI}uA_Jnkhi=s}0`g)Ov!nu4(gmu$J%@C88v4PVCkaSf%D
z#--QR>NeWr5U>>;7n@izR_tKE&^nE7ooZIuq?cHgtAz-G?}b>xqKV7291ga9KP!ME
zxUVy+QlYXYlZ~Ws#zr8I0%M%UnqOOpp9W=ka=l4QYaVT7O;(fOSy*b&f<=!Q-jT~z
zLR*Ur1rLA1azu|XdiGH}co!CPAJN|$j1oaDNi8+`JfA{Qq53y${(gO}N!3#u^8TTV
z-E0WE++-^mj!i%BW4W->AeV2%CC6Phi2B2#m|zCIl(IsglJWY?%7C+C&Ox-L+a!e7
zD-CcYceB&Lb1JYTl$S={O*}(^ycq~L)|0Wy?P6Q9`ic4k>dg=BAcZpstf#iPFT9Yf
zU43a<L7UM?%wmc=qRt~5$k1B1o20aP>9Y?+-0f@Lc%%@(=T!kOPT6@6j0`03I|l39
z_w?*8!`Fykuu=YD_LMxi5RF3~YK-Qu>$4KoFF&IKU@=8!1+8KlK9CL5iPNAdl<>ZP
zDyrCe*9?L1Z9^B_->b6K*w@000r+`mPxGtE09<?^?ZR=p;fp(4e*={n$9V}+;z4Yq
zUI<&3+)<>l<{G@5Yhx{_6e1M|C9j@sh<A6CUtQ0*=;S59cv^-*F-8b-;zW5fveJ&}
z!D>e+J}h%wkrP;u!!h$+$kl7eCG6<-1WRn!_<4XjB49o>TC_gHr#keNeV9W{Ya!}+
z@D=>5bmrZsJBJ4cy`9tE?gu#fALc+;7EAzkeAjnBDS@@6M#4oIGg4<M&;@Ku^U-{m
zYPK}|5LiH-m6|jWMN^EuaTHZL&O`~$nn?t|!W!{#U72=Gd+roYz@CE@i#*^BwWEm^
zfTv$fQzyoWikeZB5BfSJ5}SLdP;S2sB|%Z=1gI==Uvw%d!e(WmYc(QNo{A1`P4#l#
zl4oQpFmV~yHY~7f2Kz-gNJ#e^BF209fWjdqO$N7l;uM!zpr9(|k#9)L3wq5pv;y1J
z6S7@qf03Vg=pc&78S)J0vxu5d_=`Z%0su7h(8aSLVT-d$M6?$QgD<ue3y|FeXgi3T
zVF5ICe0*FDj*ntu1qy^nwz5u03i$NbX?a9LI;If;1>V13VP&7S`jV7>UvkoqdI!6E
z2QSXPJKj6(MOEMbR%M3Or1qeJCzUshkMwJ!(D2Hi@ls+9^{f+b;JXIKgZIb!MSq<_
z+bG|xiRRIUlT%!l--&6)A!{C9I<iwTqY3fIQG^eKZ5!Yfl4CpAGSA8@m=>Fxe%e%(
z<)R;{GW)2cVkD$k0}BY+17uv)XM+CTPc?pjmoXV~b|h)sM2h)~Kw@pt9!Q}*C>E)c
zbdlwnBY3>CG<fV~in5<;t?Dktlj2q#L)#tij56qT$=Is<sG7<9+q|r9J4Jx0xCMlj
z>jIh-MH54=Yqgbhk=jGo+q`1#wei3RAI4@@Mn@5{32$l)V-8xTtPrlrCLGd<m?(Ub
zk$4MHh}a2gO<QQiW8E0NphtTRxv|3hIGIl@<Wth$7em4-eSBaqxmb$+=`z(nVxIcx
z-pk(MEAz%j$S+@6psqV^t0<WZh2Z7@B7a%lSzme>Fy9A+OD*<X!~lgl8v^F6P8+p#
z*NAf+Ary;-7K!B=HenqJA+}{cmUc8%tfQwD-K!X#j*91XQM@)D`ASBoh2>c!-v!Y&
zPEOjyL`#E1;!9Ab3S$zaOXr^Fkfx0%titQO15pERP-Z`dBJ5>twqX=GN#S!MQ7tqG
zVK~>rPc}PN#{8{OGg-bbKlF5&34{}V!J0=1qRB{33tWe`PWOUfgB1pkV~-g}JUmSs
z$t6=n6Y83v`yxCE3{1VOjhb2-qS{y(xiJ~#j?-3CVm$ANczlMRz*dlP%In@9`rL5=
z0C)(pE$RV90jNCahte`xp2b)v%pZ>Y+%@B4G%1zg2?Yb$DzPVEk%1#SpT)~t4gZc;
zxf-3i${Nc>RvR>^)P$A>C8nY#1|SShrnN=+K&%fwkSNHmlMI`D7C~BXuyZI6BA6^^
z2xh-)UjAUb!P?0}2JzuaB*0An?cW@IqRr?8Y({*Mf21PLyvM0R%1EW5v8^TqaH$dw
z=k{!rzV^|w$~nlljAu^rrcHikiD?<A_p&Pp0sCe`R7UXTq^JvmASf#26)FV~OsH18
z!p58hk)9MqaV}vLj%s}*1*O!meb060uO^{+lk8jx_Ss4fXBKg*#^7fYMh4l8%upC<
ztN0e7H~*9+B)DX0G_Zu7#`Z<UpSXw7*$3NT@owx=5Oo1@F>URmkVkSNJq|@dahEZO
z28V(cB=`ABExsbPTiUcd*Jm8j>XOt|zgMzD;Os2tBUZFYMX5-HX=y4rnOlv75kk<2
z;&{d(*Z@b`;B<ZRFG90Jj|OYz@U*whdC=>CJOr(iaZI<jZks@vc1wUtGqOggVv~b#
zB&&d&e3#p(EbF<2AVE9>$HCHkEL@fk(cUi0x${!1oAFf#M9l?_;!DMpoUL@cQfyic
zqpc#aBKxhPt-=eGle|cgb2@f^f{7oU`}lN+Tg5-xM$hr1V!bQA<RbrISaLSj_}<;q
zXBzd$)31+v-QBa3?(?2TYIulaOOJV3Bc#MEPIA*lhvA&Rd?pqs3~`k#Rw6b@s1%@A
z$LwC~T}xT3s?4iQ{yNJh2?lDHgoS`Z^<{6fA*oX!a$aBoI&jw!j)hUM-0MCnB&f^V
zggIK>ChBYV!e;h#1Z>pS*^XjHgG3;NCH3EWY|?j;*b|94OOCDv(ib%%=9p>#2``WL
zQtH)2ulW<ZURv?AMnd&P&r1o!EUz(Vwt)EH<Z4)4Ag~VO!o8u)g_M)-vgwGb6-?$+
zcUeMoK1S)4EAWCwX0%AKioY6XH)r+ifWP^zEP<O@#1{CGMYzEF$m*wDUs+1;OnLl*
zr#_1Fsdp6Gct^16+-Vc4#vpGCB2zv6&7seIALq|i@X*xBDvrejvm*t=sKBt*-SI$m
zwU;}Ki_9D`hk-~oy4Sryhn=Cz)~Q~+S+GuAAj>ZfEgUb%i@p7pkBK%YMGZaSX|LF!
zZ+vDnuBvz$%tB)rFXM7k*P4y#Bn^W{*rKREex@CTvipja6+GA|Y~MbKTs@mkokT?V
z_LLsfch`j5^Wm*kwJOs-o!;JQjfwpuDlLS;XgpT9;>77&@C+zh_M)JH0%UjTZ-qs<
z2?6h~5B;|RcXnF@5VDTwQM9C!kqs6TAxp$}Cqo{WCqv^*FbihGQJdXo?n!DSfY)tk
zhL<aBZ8p8FZP1L$jJSDJp<_;)`6%i%t#<;ZstJ?;JSb*xPcwQFr(b=zUPZS)nO|TT
z>5RlI?tE-J_nvpSs&6)_h_a)-lCl41z61-ry*ZADzU5&MDTtSV1uLnF^rF~Ovauf!
z8R-c;!K5Z=H}U{Dg)Z|Uq84%(L_Q_RtrmmFh`k?-qx?Ixmd*NYZ+b6fS^OY9`WX7e
zxkD6mM(GUm2`q946gPy$;WDOf1PbtivEtGLgK&mxR>`>6Z8|N4LV7fSNUcI8TdK#T
zW7GX6jHu%TNa%`v2s#NnV|H%3)8|&PBrk>LVW7#y{rAv~PUna<ilQRo35qAG-fspR
z4QhKo|KaRK@1S?Qx3itR;A+uYB?5)~-QIpD>3x5+ciii^*AKccd(CZ~oF4BTyx2}o
z>@GJyzQ1>Jx}EHUdvMvKCq4J%Nw)mKue&E-Zzo@;PU>Cu=wGN&!f{)rZCZxi?WFg1
zl20woFL>wMJ+K41ci!avmELfR*z3N;Ma<IC(#PqqZQ)%=<V#=rruW0ky_1t|V0D|L
zyj=c9cYl8yiUSL|wt8>Xf!o-Ad%@lxc6VV}x^!UEVQ~7A^iAsICot9FK{slRLEUZo
z$;Sg|M^qpilMR)&C2w~E+_QuVz1i0CMuF4yGX)>adC4GcFJprn`41RQZSfBrV#Zx0
z%M6&D7`b!@^#VFW5L!pStuk!{#Z?ZczEsD;fZNPL6}-r1HyMpm`So}ZGkLX~f@V44
zTx!GN$VE5f*!@(@qv>lvn@UTH$>((sN`HEmj?wXyeG>p~gTT?+FnrfuF_3}PPU=BH
za^|rs5Qy1_N_FVFyxo99B9_c^7|uBtzB9K#a*@v%U=6Pdy1H<AfteE-DN^y&R}#-h
z8NpgnTYQ;v`&?X8L1?jDuE?An*=2s39IFgDNfvsuRl%*UcP~~Dl?KHeHMQ3Lgpr8G
z2HHsxw+JizmQ(%1e0~_5xWNV&0O@l<xTAst@+KoZCKNuV44?#<@oIIFx9lAHf@?7I
z$|fjB5cBFrkd2YUgx7vPra5gv^>JW4K4dF;62d4M-WShXictEL@H?(sK`xG`FlQL{
zTi%ZQ*VAHL%uBcZPKBLzIRCVvjS-g@z5wJpz#=7A*)6M%0Dizb3dQOLV;b^UCA107
zDW?R9*_^x~>bNN`FM(4+yCaz&MBg+O1rHa7xHab0DF~X6YlDo;CP`}X$qu2QV!lwx
z%rwtRFDIV=Y&c$2V`g%niXF)Py2u8EUn60j;jw*6V>Dmls@&G6gz7`E1#dD+{=rY{
z0e7l10P)!kc7<ehaexCw=T~zS%k$YNoq)hdgWOcbLGJe*#WXE_<!(V*b$o{SKk}dP
zqHSrLeRl)FuWzGWj}%D`pXKF~k)6@VWKvEBD@s0SVSDI#WE-gOyQbqM_ejm<umpJu
z1E;`z`RlLAXU5o9iN370J=9F4MFVNk7}`7tgs+M~t-yS}3N7sBu61|axDz0-9#w7A
zub{oL)yw8hcz7jnh=@nv6vRzHp5<ny6n~QqA}uqao2_9OVMJuz4ldj*E%ig2ip~Mv
zDOd>%YNRkvx|D4EJA4N!m7jlUgAOaXr#0sjb5<Wl5sC2P9tcju+~aG7DZ%i`apv^5
z!Gg1Yf0(y@{N`~sg6yh%s&_gWraim~h#knLcoO)*{in(Qw7kgP`xc4;{F?YrPL8@e
zJ?RG{D_Sj0q&>i}K{t*d&vqrQTa#DoW^o7vM5iEFcW+uiNr@Hb+dw|**m!lU6@!#x
zn_;9TetqObhc{Unr?s?VwtgR%3Q`S1ejQmFqp9CD;Zm;|bLlL|hN@WXk27G?J2eSX
z)>pPA@)rBaf(IXfy<|!u%N8((<_n<@xT3C4s9WuZ0nzw2^^Vq_i-Z`y!2(ao72pv)
z)o%quyvEH))CMa_$}b3_HLqrhgqP`~C)F>b>zKl1nR|H7+OB!i-qH5U6_YOCDcYE>
z3i6gfzzZnVAl`#mJfC3rJBVa><wW>#`f6aWw6~koleIVmAC3#b;~$qfz{w26F*yS9
z5v*q4*9uNS20r|do6E~n)y?~GX5YZrTqZliIT~U=nt2%%M(Jb(+Rv4V%G2x$%yY}8
zTpGZ=3cn1pOF?k8%#9j*No^gINp>2ey0SQB?`6;dv*}q5whq_Zf1HJv_k0XS0r2SI
z)06ZTD4w4E<Kr_BD`4LgOT_?q4BYVr22r9)Dm8N$01r{LjixP;o<tz1AnkTI!kE9|
zWunD6y{=m@Hvq*%w;nu&Pc!4dzi63)wWS#-E+Q_gtS3{p;skICheRnX-H%w=pss3|
zLhyb4P&UTyI6D!t{%f}-izWnzanEUjrrsh-C!Fd4d!0{yJm{UC?Hz&j^K8F&z$hW`
z?4+2^%%kp7o*@nW_@{?IJyEg2afrIO%!9+--r39U$!QP0m=L0h8{lR#D5^sw;`)w&
zEAYOWPE)k2TZ$;R6UY!vF6RB$8CT01=Hu6loxy-dM%$9Tr^pw`y3hMfE8P!2D1Usl
zcX0Y2ZVuo7^dykrIhlxuMfQ{_=Fh9lZ79xM7?6Dxbz8O;9Mh2ce#6lX!VM}DhXTHp
z$wMC&F{U-O93QTQsay(Y5YY3~5A<V5XVXt0n>~!KCf8>uviR-69gwvq=4jtsDxP5T
zteu3n9)3d;rlW7K!ej9rrWMEBl+oLR+XkcJsbntvcU>yUadm{$#52Uqn-EQBina<d
zuBpJ4#Vnbin>b(!luv<%3@UR(C3Go@K~llR`A9>vkrt-ABFaqcR9c*m{XC$dR>>)c
z8W6x(Y*k?Jfuo6;)CA(2HHa9H)vxFJ^_OsXWLLjB0>g%8HRCI1WIc^D?y3yK2X45|
zd*eQ^+Cj^h(;SJVqpb5Vh-SD0d*}d=X7(n?o&T-O0`t@6<H2X>7=+4=xGnYh=?(Zh
z(c!I_|MbMwmBZ#i>{h8E0sZS%=os_Uh=ynAC5nGgl~TO2|3Z9+G2B*Rqhk>M#avL=
zin-t_s~{@@+fW4;fgkvWSV_!O><_F%?d$a$zq~;b>tn2(cPlbLrYZyeQ^OL)1mkos
z#~Cm=$8FhqiN&jop4vny(;6f6v~5Nl(rhdS22a$PsriA0R5;a@Tyz09Z-if@cZvy$
z<$8^HB6*xZXr+fEpo;>k(Ne{;bBTM8BJk6oE(_QZ@o}lOi85G4@Y~x3SrTFCN}_NO
z^wW~OUmVb;DB2P4gHzAn@t9{){3Wo2if^-0%{&gby9^{YL<rMZJq(~`?_=ez!jTIu
znnpPSm^B3F^1OToI~ew7g#;VF9v3%bU1)f?vnamL#_z!<h8IMGiia{EZAguT7|DjC
z@~U1gT;Y<bH=O_WJBMIKuuGUUO_1k&TAbp{T7H6F7{(dGjBp<AM%fAKdN05<4tQPD
z?83lvqmHoamzDOiLkdawDg8@XOF{sY%t8bMfl+T$tUpzEa!&UC(&MAk5{zQBTFv1k
zXVXzz@#@)M>l)Nk#hp+wODML)Xrt#F?qNJn=lHtTe2g*beeS8PG=Md6=VPf^&K1W{
zR+I91K5k2`9!y14T{MVhjbbKXGB9ZU-sZPe0>WNovq*mgd~ufLIA{X!&tqRG8!;i1
zXUNRO4uCc}<WF{GB!{a~OUj7Bc9^ID_;HpHaOF!J_THvY^~8o?z%_IRtY!}S$j_SW
zMdx=TA3!i}^FmMu7-Wx4_-rwdoLfJm9X0tm`GR_IzkdEX@&F%rVH@8su3Bqj^yaU1
z*3d}#hpmlrtrDrx!2UaKyg&Z@lOM&qy3DlNMRITAYY*=6)X9fgd9Ic#@+vC5FNknn
zf$@3K*6xm5%0b?row$!$VFO_9hE9#;M0QT3jTScX`J?tm!^-i?(8C_yeQx_U203@?
z7D7H<*f%`eLy>i3ka@Gt&)%HQw&Ov@Eu-ytkhj})7+`(B_-<_reaQ{y+jQs}iSmEo
z5udZ$+Sz{v#vq#J!C`lI_xRV~v#+}cyC+|Fzv;Q|A*>}I2Zm^*C9{Z&mkxe7@r2&&
z&~WhbS^la!7&a_jNy+v9Gq0qK2k8UlP+`vsVO~etA>K``%)LQUTUkgcC?+|n8K9Ca
ztUiZwD?tqM&>8K<DYw~k!Jos;BZHY#;#k6Bap;v?mn!Q~YPX^V5`S2qfQE=%$&)0n
zDYGTgAUq3668}-9Y7U}d^6eT>hESLlNZTO6(S>wrg<&>4xHUiyfYY_sIpRStZ+Y5#
zyFu{$-FQhDaG}R{bPGN?BGbwo?R8%#%mXy$RXQCYxI9H9=Ti@?-vZxad7Zv?lHs^;
zO48Il*MWrLwo+`^347nDFTjkGYBZexU5?Po-_c?)R~SHvrH*A&C^Sr*lPW8)P)&)k
zYPCWcnIKCd!I*h(a19{yz3Ub{4Ay@s4|iJ-@IC%xzbIbMC+O_56aw4UMrI(Gkx~e<
zposFZJJ#YIIw~fV&K{~)Ag(A11Jd+$`X(n7X-D1R!|VBAT@W0a^dFo3ZuJ_gxnMmw
zv_eQk{n6pKTE57!TMQFkrojZF6!EGuInO8Oo#b4-2k-}Y7S7S)caHbNxrlpoD#uba
zUNEyaG=gp-i$)dk7{vhA3~9`@0{v0bzRRSAAu{qZS_bnfMW#tPOy6W}j26^I?oiAF
z%JdjSgW#SeCU$aoum;{NRD{W&MXExHK#((x+JzJ*TBmy)LScsvW5Me}t{1}Rw~H-+
zlXTZkvk67kb9kyIC5WWCQRArj;iR|!e48(zQ(>n~PorDMKkXIel)Xd^FP`jozwOC;
z(TfOo*-snZJbK>U+t)Y0g9I>hm$~J;O!Fb{M$PNN+vHYco|8JB#i%ecmc>mS971D<
z-_io$jsnpn6pSm5CrD~R^$Hr}WM3PN7ppHzJ-DFV^KTRRO{s*!tTtfZ`Bx-`X2G{k
zmaDQh4Qvx}POkCf*I!j~`3+(owqXo%3)2I=I5BC%AsVA>H(|NX{Sx{yt%$Gd6xVYS
z7T^^`$sd<2h)$s3ap5hJ%52;d6{v8Vj+Ymn_Ksev9+n56(t`HNjw-E5cdzsDAm!RM
zC0Iq_zJg&@K!L+u2o@X<9Yj&lGf1t)WoRvCQP~qz@a)QBbH$82f@rUqY4_ohR^I8R
z0Wr6UrX6w8c*r9yhTkqE-*d?!b{u1QKQO~_6rRam34A@-xSV^i1um~4iDMUz!vZ#Q
zF`77{xNyv1b{klegTsYQP<NF&0t<G9IBr{BjS|_-BdfQFTzPSe_{hpFBIPV>5T97N
zJ!Ikw+ruYTZf|LGcWTWu_JwWw$5u{U22WOK7o+AaMMAZ$E4k9JruRh#f}d6l4;tts
z8E0<+@r&p6s&KD4Ie;`6L>XoQsV0JW0d$2RI+_5faI7fiqp;%ox<r^XN_Lv&7nq|`
z-nth@q!<u>qrgf^+re}&(}T_P7jq{lJ;(LYq!!RMvYD4(WZ!tDpYL~HxP3X3jam2*
zY|(LV=XCGzK=Maq{e1c+l~68ykEZo)bWdgDcu$d8qNp!-KH|HeEWu(?UA9{n6n)k?
z%S2G_oFoJ_8N}_8VZzpy9gdj?<Tyf6AiSapdB~|96S5j(6t<X=XVY6w0^-=v`lPE#
zI-Oy<0qPxsF(9!n==luio(``HC(mAw8uIy0hQ+M37j0>3SQ0E&F-foRGEDo^qSRce
z>W^x>7g$xECdL~Umb6we3(2Y3L60tsW{D|a`!W0+6Io1x{(6n{QTAXMob!dGe7D{W
zP5jmYn5I4&h@J#uVp$bQ^M~&wrItQNtmAQVonKwU(d*}!dcOvO`<S0uOVSGnNM|Wc
z!bqrAR$cOahQWr8_>dMs(WSnGo*X^8^9c3k@yYyB^kPo-BL)D0*hI(}kVvs>;$FZO
z6_rS`@u*%G6Za^XCqxq?-wf;36C5<%4B#uquC?|rJ9o`eS*MQ^9@9bo)}8w->rk8I
z*vKG}nqKR0EhWyRPbI6!&XML)g(pQ6tQjTs$v{)W2ehN&P#)@ZfDuCJr6jSU*A;c+
zG1Y+B%*OJarXS)cWcL{3#;-4K0Z&P#ZCorfE+2GCZ<?3XC4=;W6^Ld=ua-!Bn$5tm
zs#0YA4wZRRx{{5BRgBlKW6f+*5*U%7t^v2?hJX?J*TU`@Zzm`l{Nc_ZnxQx%a+*4J
zNT=`#@(d1M_QZqB5Yk#nRt6;|<h_{ONEwb9Ht2-n%|~bwdl{`sE6uk0ZQcxxBc`Cq
z1u@Xr>XF;ihOlP>^yTt15`|5j3^E8rpUj}LJ)e@a<TBiXFsn1J3m1-uQO$SM(BAmg
zdZ1iQab;DfsGFS+7D?=m_+qbMQG8Rp&M-;GZvZ^&m!L8XJDwwpmaMq1F`%|2a5XnY
z@lpal$L3?r59UY?CmvkokiKZ}vENl@Zeq-HUrBkYX)(f0y@OhLmZz*Ov=0Fynw)oN
zkJ*K-3U63N3Sb{V<fbI8UJ0I0ge4+y$b{oNZ83?YlpnVb6i(@I`&bLm9}F<p&<@d3
z?3!XzEO+R8EPe3DYL5}|#J}&g;?n|5{?i!;Loss(u!Q&kM{HSl+;Ic-I!-xF#eF74
z*YXZ=igpwO0@ci(I!*<x3p$jaHE`oICv@h;Aof2#3Zk-HM_Kk7`&s+HYgq8O^DuHP
ze&(K{JeMgrD=*wUOi-1Mh$aT(sW=7i`|mo_d<%qRL8Q|!Y%G}n6pRtG;(Gq)KiNlP
zE%PS%@~L@gK}a+)l8qTNOE;Km)vh~4PzUb?A=KEzCkUhFej-Fj_~CEDplW&iJ?e!q
zy-*Hji>R{G3ZkAi+Pu5;&)F~=cMRg6{E%mH7M1s_jSnT~4u%p7t#j!d4ru`{;$uVl
z1X#K5NMc>?|Iq8Z;lA{T1HhLt1r`+=&*PBvFrc(R=Fe~taZ{k0=74CRb%fWIqsPyh
zx@LWFUaWh1T@O5hU<u2IA~JzI0th*kX&{CKn*;i2l-I3j?WD9MmJJXuzMfxYZ7l`i
zTSFI+Id)(8<&J`2L)Ox2Dbs2D*Ei+m_Jc<cA3j8Z<ixEEnha47D6@Vs9+Z_3+laYH
zZW`0x$*h<l7qThAa`zZ96i;`71ugp7Fb+?(Gx!4YTf;d$@@gRT2@Xr<!O53lHmpKe
z>g#N!ib**T&*Im+VCH&xc-#wPOLqjdcAVW*#BaJ`P^v$tp3j4YW$1h<+aoH1_htHW
zLxi*p9N`=jVKwdnWl{;xq5<sfvW3V(o<Q7$wd(t9Y}p6EMR8jPCyL=Sb4C=}Vhj^T
zFj2Xv7>#gj8Br#J>QA!?!%9=bP9oimv15u$)3YMAXN!ftHYU!cvl$8?s-AHkg9<>~
zj4_g1p@<Ldg&PNj>$wpq6IjQFvvgd_29Vr@`@+e=nG~5`XO^_Jpc@D`Uf98uO;XZW
zKorSUIw=(ziE_=cx7OZe$o8DpTpGR?bO=@Pu7*y&yx=o8yTNkp82Uh7XexpV<07g9
zM}35-i@V^+Nr9m7gL)-ngxti57&NKQ;@u3ClB&)SNdR$7I^9ZqEd`f&UDSDW$5x`w
z&2<a$TPkXpTU(lCiQua`#EWEGWVjk>%ZP!W(*kWE(+!`;LLp6JAQdFOo)zPTf|lck
z&mmEo@BSpd{O=pV4pPi9QW%8CVuo2Jv0MhC@3_pIoZBEx#0`@8QYTWx_ePy8;pZjs
zX7-Aa3&q^i7_Goke65WERwW0yAHA4yfiQd-v$CdOw}6lyY1wI|j`>|9wiDkwRFe}e
zTl%WB)o6Yxi()JhK!}V8EP&?T%D0>brOeQH-@-mLZ~^MYE91nE*iz`WsU2LPa+`ey
z*IA@aRCF1=x@+|r`F5caV)c)ZB0;|xO<F8<*3w@Ez9Le2Y2IYF&&&pG+TEvRQQLe)
z79&$VE^Im&5KA9d6Nu7`5}jZP2-t<q#o4gKiyF~&z2NXJTv-*0LQ3AdR8Q@=AOhx#
z6HNp|G7Un4hA$*IV4N*oAE6ssCabGU<L!<f6xUuYp*%%GsgZ`#%rpOZL73TBm46}-
zW&+k9Xo?}hqR6r7EJ;=2*+5teB{p4TAkQkoHU`acRZtp@6ehx$|H&lGyj&8q1=}L!
zUMSuHZwE<c@Ohf>6<NzzsKMt%JPXXoeg<6EBS>#?LtJpV*4)Y7X0qZX8eI$(Htrha
zW9hV1<KvkLb(l*6K&8Ta_p{*QT@7RkTBosZ@a1c+Vl}cX)@8$C+gqoqz%KMiA6{tO
zT$mcc1iFp)00o|icq@XkJ9iu%)yl_#G-n`$gGy{dNp<BFusfkbPdQ#Kh+-5WHw+I0
zr`LG@v$yX9M0yz06M(1(5j}MW(d}831lJ7Uz7>T#`Za^xRhWGc+Ngdc0?3G}pW1jv
zf$t0B#^^vaMvOHa9hJE@ba?+1=SgQ1q#N^G-IvBz=Z3Wz+9pjS$rl6{HVQ*{{AwYR
z{b*Iw!Ml|Y{Gv1Z;aokDyS2NsZ+xwLkc7la5>?qm&msCc=MYvrQ)pnwEOj3h)BKl|
z!{GqGjmTyz`LO;e#n7qGO+(wg)InS?DJTITn<$WmPC9u=G?pNISRV9V%}c3X=k7bj
z{N^vI+7z`yMgI__ZYBZTOv&&z_@S}>F0oXqZOUE`XaN1T@nDEa$e3o=(_(%_9J2fB
z^lJf^?MOcud=qRBO8|CRFqjo`)nXtL0`z<3I^LlU8>?DFA7|bwVX}du@8DsKQH?&=
zVwh3M@xYno4M>s~S&aLc`rduiiG)IWiF8Bt`K@FRXY3RatwsWtOAv2|Tu(ZgPw06{
zitvq;lqc<LKB6lf-T`w6STO?8Ii6(zfl&8=Ehb$5q^k7(>vvkVVVVIUlL@{XY<qR*
zIMXMrRL>Z-PQ{xKLDgy`gf^LFMabsU24SjBYQ5&1QL1`>gPXEwY;8<q^7^MS>6<6D
z*gJKe3qulGSNt{5horFq<9cw&NB5+Av`wGfq>9nN4InNE0g!i0u`ldY2gmUa6i-SS
zo|1q7fX%l8tSt&h!NE%?mMC#Fo-d8O-ux0N`DwD7U8Zg`;Hf9~3?=BQ_{)fl0C-9u
zZGc0>$RK9ei)<6u7{fT@{t&=gbDihFoiaROa<)>yK@PzZ;J%iqAu2O=CWX8L24G@{
z_Id}WXFL0cC%v=oa|kEeIehuDd$8MJeZIu(F{BvizSVCViU&)x@Yta^j5!(*b;k=Z
z7KTg3@}#2o5&PzhE+%5M0vF>~ND4%2R~XmfcQr*0+|O)rS5D`5N2i!ikuyYMtPC)p
z;RO^7%;HWN2Hbc8J{WYMMtxB!+z2l)sRazI&-!HcB2T*xzXctz6+rnB0B^v`Y!;_J
z7tAl@d*R&M5n~Ly3f?r3gyv#Ml7(Ee5pIyw|57sCQCh+itL`upPlnN~MX=?1`=V0Q
zMTZEbSqevn);hK&u4D;X_6>A`K|m@N3<`2>$m<l@2yDX*&5^MPM_b7uP_9ox>1c0c
zFR%q;eSBFwc7nM;fkKru)y8m2Zb7CLQf~%jQb%E_Y0)9F76xiZc~4Q|$;0AfY~e|@
z7bJoQjM@=Up7({q2v{K6TKa1LI>TaR;K&)wF|rn(!HfprlxQslv7n%E(_n|m#1f(a
z2#$LndLSHcUtSben~Hgu)pK28e>_+eeR!x=_|p(UyCWlaMda>6^woTMdjjMF)+V7L
zyaT8Lw2Dm)Pz995OS?wfv_<848UP_W0Z=n}SaQRmn^>|E{4MT^EgY>#7It~V!Sm_B
z3_eAK&`X>q?pBl2Qnfa>w;=ka5asJKABztYt&K2DwIa|-nWUKYk!NLGb`h2dGl7Xs
zn6<0qfmU^DdKt<KvIr2ldZI^dSwwh2B?m|U)cvb5fkV;ec^9;1dTThqEE`RVX*z|<
z%I^Lm-5rLB1cx86x0+Uk#es5AqG2f<0_6kMj*h+pIORd<zG;~UO?AaN$~-<Ry;S^9
zoFOPOo=7mFR4k75!a$@A3GsoK9f~K^Y!|TuC;&6WQ<z?5Ti(zT9gE5q!YE~b-Dbe!
z$dAW^Z*qWmq`Ta&N?@cjA1uonA%DOGl0M5)B9&8S8q7hgsz^0KjEabMx68E8SgKCe
znx${W&wzX>r5o;~clzq2cZ?hnl_0VA-a}ctkJc?VrvaGsaI0TmZK7$xp`DsF7k&7+
z-X4zd%#=b6L=hXZ!L{#Nn-eqA_yV{{q52orAf%vAtTc9W&9R6R#goFZgwRVfKWMmM
zYd7EKW<nLlVN^)Ly~ua8p@I%P*a5$TR`j%--Y9EzhEiXs+<hQcM8R1^lGs{p6=QoQ
zFQi+oVygRr#*fJU!`Bp=H|)rY30J02Z5VcfEx<@W7+?y?kL6a4;vWWNqJpU$J2>{p
zoKc}F>&-Lv7OgYWQ1B=g=z+FgLyk-ysC7=$OHCzH*^gi$(9nP*=Q~N<F&Nseb_>0u
z#59HK80mvyHX>XCHw1%Bx$ZYXobQDZz!*uPx;ddCnRWOL*{n`7NlQ#PLo;+7?5i6F
zJLQd3t}9vq0QTa{SaK2xNc;sB92{C|$OqL;Q)K2yH?n2*Jkpb}9d{acGy6stP|=(^
z%awcEmBh3`7D==BOh_Eue8C+dMzYH~V<!dYqt|Vkpd{hf<+)ovuriHHP#>cgmARB1
z4w!KYw-Z(YJC-&Ei<Sl^NxJcBjjl|duuE4{w4SpI0}53^-RD5a56KqG9C2}>pcb!D
zO7oDsvq*5S&zUlOFk+8v?+D5QiK{^f%=#mgzO3DmSf(UA!M#LjNsecApY8W{YXaUD
zC5;24rJ583)mbuhA;_W-5rpYFe8UJ;J2IPDn}{tc1OAIv5EJ9`Nzo2M<7nS;n2n|*
zQ_e<=NVanp3g_OAWWS9qN{>ule63wKe!01d(&ERh#Z!J=^j>pFlga(BkPG~HA_^my
zY+?B&;#U1-OtvpMHe#w*9;KHriCyk;=WDo0ph4ezh#sq8L&94?d}=<A$hoUtTYu7Y
zDLNt%T|srxbV%|RT{6*a=7pc`9T`DIHsa*MkHZ>x`xbC3ip}$55V^~D=R5MvH%num
zkN~)t9DN@8ynoNM;RM}g@`zPph311O{0~kZbSt?{5bfHH?F9+p&u$M~_bnO&*RoK~
zE^n;PuJ1sM()g-0xEo0@;{jXn{k6^_G+jmBDs77P!1lU3EO$c30JI2kXh_O5%iJI!
zgX%CLLBWU^KNlCi?zQL|R*V53i;=fN!za6kMsS6SzD~{vXo^y~$WZ2n;o1b%ER@^^
z^{NaUACan!@C2s?TBiV!SWk5Nk4oZR@e4tKy=Z5a7Gft%<cP+QFXWS|U@bW?Ai9>c
zA1wbW6dx<}vg{;NB<Un47D3uRnfE1P+6+H3++nf?N`MK7faD|=9Mhnrs9?zvuj9z|
zRI8d&-_nj3B|U>!D622dy|0|*O8$M|hCqZOYWUgh-fqhtBb5|l$ieDi7UA$1-2{ZV
z2!*)RoyN(6FpU9v7&Sv~xnp6WX~#hNeZTeZ5C4-p+{EMn2m+#FQmhoQ)!PrsuCpcv
zc+0Rg4D&EJ$CWC9fyoi2!D>xKQIS&_mmdq}(<7iW`VWqJFO$}@w9Nker*=Yj4(i2T
z5hovNi!PO76aQ@MWYBJ_S?r{i>L?9LFj=h?m;(ZB5Sc=;IX06Wop}}0uJVKcJSC_5
zCuYs+o{OJhm_ykJw>EAhm$*;BPPklWU@n$Yl>+(&FYfp?z3Z{~0H=VW3&gmK8w^sj
zo1~kp8{<*tu3`v)?>jNteQFx}3?8m)sAj?dhC~+1!;7EY^0f}1{TElM?_j5PkZ$Jc
zc?4Q{nT?9+ZFexBJJg<`?n`Z@jACuej~+O+ONHbC9I7FHigV%z{=t@DX5#%SpxQpo
zyp7CPm_6cIVfxYov|>Jh@)z#E<N0VapJgM=|LHg$;2yaaQPiF3oMYV8eKADW)KvkS
zp%xx@OlQ|014bau4fFFSVP)Oz<GO}{iXG8N*y3<Am(P?<O@nOWWDX3d9Fuz#Dk_7U
zXDc~E>|16J5vM>Gr7(#{Ti_yeqeDI;rqrCOGf#%;m?G>k_%iiTKpJ1+Cq%wIllM^0
zr*9;R0K;U9Aoj$YI?-<i{fXs1C&~VC)7XI3$X}(0q?61m><rq&NF{ba>hQ9F2;G?a
zPEIT{Kzqer|G1?H@B+!C>W&OqdUwo?c2GmTNr~akOh*KrQ6$5h5D_u|V3?0`Yg1L5
zZNGpbZ+ql#<i;Sm4*iS@9gj-}=KS%`#jTjgiV>CaLQVnYyPX1qBh!uH_MFr@O!HB^
zBJ?7Zq)2Wu08C<+2!nG*H7d9*h?H=L@d&Dun6~8bQO@mFd<Ov6FfK#*vySfzkFP>a
zPy>US)G!UT9c+FH7#<X6o87cl=dKZR-QC+c?L_sA2LXU|YNsxwOz_dc6x&<L52o}v
z+Mh*kXSx!GK*S|gjH8`0IRxI1ZCf#E*U$+(K_z!0wCbjX@6@by5CvJkfY9U$OPIce
z2V1m3fgjK-eMTIFoz?6LbAUZ4GgNG*<R_IAK=>9Q<L0^WZb|~Nj!4r}rZE&TB;jc=
zupdoF45^qTKth|(OVLf8%%)m!44Xm+0Olegxv=`xVRbPF1UV>Qf$ZO7Q#c{6voQX?
zf^H0bY3kbsHBko94^2`3fjR>#>SVT>6&14trf9KA!~Kp{4K`TJ)SQr`mOgXKM91@V
zddn$>v;!Szh2M6s*`yBMv6j64G<noczKR!PyQzA~e*QWP%+V>ey&=HXb;C^(<CeR}
zVf9!hudFODYrJB|)Z7POwcp8-aT>BLg+_^4;kSl}YFDGaqJ7O;h$?Alasboc{1PVb
zq<FUuE&00*E7D##AKjz(pA$FnA?Kx|T6J!QYZ8$Pq*Gk5%Dui-UnmL)2aRO~M2kp7
zQRz=Zs7zueA`6Ww)>E$-(uQRWXVl+G(NV|v@Kz$H00+c<y>651DqdAK-+}ypaT^Mw
zkL*dT8Jv6Mp?So!KYtr;@Or<vJ8wf|X`Fy;Aw4_A!WfbwR5_yoh%~-TjX=yNz8a=v
z#|OFcfIH8))Z1YFTuA9J-s9xPi*zR%udYx?<S&*TUV7J)IAjCX+{$W<w6`*K1%s(%
zm5P2T*YKr!lAV4jIkq*P3X!d5gyWDhARR@hl6VjeLn8>SwKccK)(($ny%-MM!Ceo}
z0D899H_UgH<kR4sQyj;wLGgh3QPIc&XjVReQ&9C#othL*RJ@=-ey2>M%;8IM+wNNA
zSCKLSCfs03wO3q=ZG~7R6Zad2OGTKV8ma`MqyghdB{~y1N62Y+v*G()rnG`h_bKO@
zR_{}OEjWby;%~f0aVB&auOzf>^&7{%{T{bXxCr4{#PKXTi@FqXF*s59P!J~fiP8jN
zuW`jfHyS;uK@2rgteg5|GQ5?|r{m&iZM~SRoAQd3!!IS~sF~Y94;oF<X<lmV3Ecyr
z)dvI1GO9dEdGi?=t?*(*dkeoB7#gOTkIp{-zvpfVH#flxX&Y({-3`+(uBPe4jhL=P
zsteObdgizPSN!%6AgAiyzQ9=A;N>styXHB>WoP2MUmAIOzDgqy+w)hj!Yyv?i^W6Y
zC0N$T;vq>RD-P-D;?_n`yBxu-ImfQHp&&LNUBa;OSd_$VA$q-?k}b+%spzCW^&7pf
zqZEY?q+L|~@x~@|C3s-3+%Ha<eJEYBnkZw{g9IP?@}K>5Odd|8W-!mBB?jHun*hC4
zau8^+oeDF;q?a}ub6RZ!;!8}TE=ZCEOIlT+Rg1CUez{$DZA_-FlfKTR-W-H!JR)NV
zJ_+KH)bo1lNCz;<Cf;8YbMCvt`f(KtQm!VXeDh1V#sL*bZ5ND@0^d#ZPGH1Pj1>OT
zjjJN^X_Y16p*<$OVci80E(AG8<&uCKo9GU%3yQC(yD?T?=#|#F{&K0mPNHob@PgFe
zE#^`o5yI1XF^#Nhi&hD&Y#IoQ0pC!lYdnAlZVh#&VkvdKA$+sDS&2{wVE}AkH4D2d
zCh?jHUFm`d^b3(hXzj{<oDJqgf$fN_)|^PbY^I&6<mLl{tpOWL`ZD^gFcdba=@Prk
zcdnu#x*)keynxJMo~&gro~HnVVVcYgJ&TO3TISOENIGrK88@POLQApZ7I{-F*N?rn
z$_!EF>#<|lnNkt%`CS&6fvsARSfzzPY*C?MuOdUc6@yodbOa}L1ku;v6o9Nr<G2ZB
zJ6V`xY@@;gh0N~G2aU;d5vy7tw8legQYIHNrN*hQKGXN%L^9?<zA7(LgNnF<z~@+F
zj@B(cALJw)I5lxn8Y?g%)hoF~r%!B%w^TMsq(LEGmLxc<1M~P4M~q#q<gRnWt(F$<
z1bmNGIu4FjF?yO!fMUm1^+J;7kUlTYoNo}FoU_=%T()AJY2}wpeO94u6F)ge2oSg0
z=N<Cw&D8d^0A5Md(a^A^zA2%-`P+P$vuhFqZd<924+EB}_Do=RT8Q`+M*n5ia>P&@
zk}soh|IixXzSIYaP!a7)J~ANW`We@oCEHJ(NVe00J`gqyl+pVL91-Rvb5rm$aa%dN
zY^_06;^YsL{~oV(u%2jJG-2cnf-KB0zN<vXxTQ4aI9U7JNk-$p$oeTLQe`p9h>amG
zC!BsqJcJD-@VPm~<|OBs6m)Lh!J6<M3|AfqJllM3F5P_sErD|jkuHiU1@%!)DheAc
z*((iqRt6}Vn9+i{Sga6&r$1%R?8a{+f-sjMpWO<P)vdwYor@uR0p60V8=dV3kX7Lc
z0*?O{m9nvfTTP<C1Q}^aU&qsng3zF9gCn|V<djnFIkbMrc?(K|Drz6gCpC3h;W@cO
zxJfK?49^RIbcpALok(~7*$T*yZ$tQPC0H+8BptKH0@n|r?5ep>1dj#c56gJoaN$Ud
z9^w>3&XF;fyi?87M#bLvT$M@$YA@J4P_I7N=Ao|kJK4NgS|BQIlh$IE#~WoqG~ybt
zkcuQxcxdg%lA<bD(nW)tB%TU|?MM|gfG)BE!>hvP^4Lfqu5xm;w@|eQ@K1py3kXk=
z!vJYVBx6gA<l`qPq`g(gO~ax2h`>SSV-Jaj=Me0X<#@L{Sy77%TM0eY;d9b&xiA2P
zinYYbpb5m&!?a2)fG5>@(hS7TC&nkjcbsKmt`)i1q?Lef8)EfB0ne^JMjxyy$u{$k
z2IgUT!K(aY0rP<7R^lJcyN2ig)9o7Zu1~gWJ7~wv0y~)B6}nP27+9}PmK*ETG)}3%
zz#4E5gvD0MxdnD-LShBsk*W^zrR|Nw5+nk-<Mbu)i-oFg+rm4FwYuUKl5a8EydEAE
zIm2v4R8tLy_k|8`xWtsyB1D}!8|5>!Ne1-lbVet%fT(2{>JTfrV8|G6fVcB?q>3np
zkt65`11M8XF81q!^BG#Ud^2)OH)RazmOEO)ni4EUF#@})Mj9e5!ELb)%7pd-^=yXX
z?j1g_UeER5jg-1Vz9=5gDwafe=Qp~cWcF1@6ywFE)68Vu(*X>m)zzI=GP4h)=6{T3
zZnO!!->TpHxDnWZe9A}yA0dpHcMdw~jR&w(&!H>3eej(|Y*MwVR}45n4hsr^E(Jn~
zy}apQKqBC+;vf*8rGt-{DJJy8U8k4%TjKWTUy#5D&wP1y?h|+@UUJ+Y&Iei2-TX@@
z-TbBVaPvR6G!_N?Mx)8>Rs^!#F@`>ZTcJIN@aJ?8Eo?C8?z}Cf3$ao3?8k=53UIES
z7|VV(v$}kp13tAqDzK>C!Qg~mYFh424Y&@ZFgVUWJoBhCgZZRoQiubr8Vo^!C)uC?
zRk7XL0O?b!P)$XX0HcQ8%3Y3TE&a5UteyR#T<av<fus{bLO|Zn5o2#mxd3ISQ6)gw
z4e#s)3EaIn9}8|(h|CA`%ExEW<{1)_A8j4snu_laHmDF{HjqHuZF+SBBIF>XgSQN<
z!PD%o^9&KUT68@Qhi!TKaoe~Hm~xlA^2avWD_BVB*Y{POseX0FF9a~Z?kTr-V8jN%
z{rVR=eiPenv-M@9o#iiA=_rQo7l0(+&6D7J*)f@MfG=!i#5(p3KepbGE)2I;e*Sq|
zdT@MEsI;XYb=LlS`rqR<$)T$}3H0nAPS*Y{`NIjmVb?8q*-V7d|C?4|F}4x#%93Nr
zi6w$)G0KOjinLB2K*W;0gXf3IH@zQDj=DQN%9WrB*^$9r*a(vThA(-I=C{E>WT=rx
z&E$SLWpf5FOJmIDioH?s!HSvJGpMz*^uDNLU>;k-ukC91*S|+jgM@-}oQ)>#+z^|D
zKj633s8G9E`$OsY>-L)e#7S!>=_RhISEa%O+7W(UJ-VIbz8_V4QL8~i=3U|d{wnd!
zc?&fI@%xT~#~YrlIcI+1{ZU(Zq<UZojt*3oRmeCb)rgK)l6vYWw~kDf5U*S6k$3&9
zch;drbXnFB;$`t8%c%N6d-KsxPoKIMO{wcaxi{`l_w8d0xK&Sj0r#unmEkr#Twxnt
zamH@6dI)R4j41a)EQ(b<K=GkIL`YHt7upIJh=bSwZ6$ny{sI)uN)i&mcOWw2IZW^z
zo;cq=uaUp789o9_06##$zgQR(SdF@Zo&R?3*1&^epqf?q2=kJse>mx^g`d(af{$9R
zsW#4m6rm@JMhm+RU%h)T#wJ&7IHQ1>c~LYRY5gddpb1uaLA2-XCYso}6H(9~zhgQm
zSD*tL{>R+?^1XN8j_srE`ED`47-lPO`2ZhI{*HUjuHZ%6zV+yTUwxXLZyt<nK8)q}
zz5n~g_zM2FA_e$D&%fh?zxTU1_<O(ajem8=o!792e+UwI^}8T}S0A4Qj<F0aqM}Q_
zy*PGJp%(n~5RX;tbxumfr@X1viJl$~-N}-Tig&Ah?sacVWHKTVhnITtRBrBHC;*CG
zC|KLG{skb7Tr67=Fci{z<xVjK$0Zigf{#i1x0ZOd|G>!Is-5+xX?cA%%_hZkMxTlW
zMg}%8PA?9%9#E=}eA?pfHQc&C>y2mATlaKk>!2pB)*$28(PukosLW6W3K0A~-}$%c
z(6tuVX^0lE9Z<h7+903Q@Bw-g%h3OgTI(cc)nGwog*wSY_y6yFb5ZZD`_fpavestc
z4dxC=DHJp^MixUmhm@PnNDUJE&p5krB%Jx;p|U12hOGu=7T2LhN!G#JH6~7An!GIh
zx3Vtw3Hi)2l>z3&Vo;Ql&>#<wKDA5-{zX*tT8d9)f)!RZuTemS_*x}X37xeOiwNo;
zVE9`)_PEdMJbnWZA|WR1&>%ntA0)!=gX_X^7aGlcHkni8XN(6NoB2*~I<OON%B1>Y
zWikw2;o{$D>l+X9H~9eaW{k3pK8%5zJjO5pIz`DiUtIGiw*3KogYOb6=dyDUqf-||
zqKq<#P0!1bfitN@IB3he5V^@fQU25Az>1M+yvh~gE<O#A2vCrsU<jLa?OtVL9Gfw>
z$qc;Da#qaXn1V6WH?V;p(G^=dPA~&&5c3)`4WU&?3^|?TF<9-mC2rguk5>Nl;gcl)
zLcVdogBjiM)d3hs#~Bv9aS!~M{}l31`1HqzV0-$v^>z)vlzo}NSZCAz^%P&}B<tJj
zF)MaY)in{6SCp`nxacA@YWRwE%)`@eAt$rx*{tpQ*z|uzZw(N^Lkl**GP>tKe<Utp
zWS5(*MXj~fz^2n$f^*?|B+!PC!HO%vC!oH&XFtdN4ZIFW2h*%<5xGRWU5j5sH8~^P
zn()m1?x1Uy@q<OD-IVuyA2b^}#~ebP)ECqaifO~MHczakxck!b+F`UVhB-v#)J+Pr
z^j9fL$~Cxs>}Oo2UFeD<J_DMoma$eSpJ;-d-$V`gyEusE=kf=1#}WmS6uN{4Dcm|F
z!zDB*Nj8!L413I%6SU?pC6mA&#DSL_%5rRPYB5Z66<ZBgC#y9l5P9o;eGFgq=6)}7
z4vTLDN}*?GibkR25%JGtqb+U{a`aF`=E7qDnE-mC6604h(?YQi=@Ujk1g6JK6&T!m
z->i&(ScFVY<-ij!=G87aMJS8Vm+~r-TaeX1&aowdNU|^)u@iRJiXXLo1fgZW`z`b$
z>4!bPd(kn;%_$)$8LrsjMCK_59lFmzXa~<Ng&$69&LA}S(B~(q6z<+UbGnbI$1V{!
zlwMSab>(d~wflI2YyBRZ$w(+XB&}emy$y#?KFwx_@gh1N85sooHbq|W+CQ|n0?BN6
zsvi%B@saM_9}e3erO#!Jh&_tmAO62b$u(xkT9SUn&wVhWuIc!nfx72R-v6(Ybjr@H
zdI~n=OCT!0fr8nIR!g;2Z`^O9S?+3Z@lQaggDMwx^ZH%TEUxcI#-yIlpi(6QQh$t)
zXrC7D`1rt`uZvrVA0}<~<m>Ju1QKwY42sAIiV-u$%Y#Ao=E0m^q7;gJmZ!t~7tk=W
ztYTG!-yskPk|)A)s8pnc0O%1<fQG<$TNqQFU0y<_Spd|4U`e+nB(P@yb}@k*nqr7X
zz#UDisZ=_R3MK@qxI2x<IH6}Sg7{nv0E5pLI1vK83SWY!7UpV2owVbGLcv}|%Pyn#
zW0Fd+LFQYZV9rm#aMM2eh9s{`^N+8yxA;B0@#DkI|4cV8f2v=Dud}y1@L+4T+3Vx+
z0(>}vjZOw;N52I(0<6LVs4Gvuf1G1dA!n`#cwurjEglyQ4YR~?sB~^%Y?QWz1%nCP
zRy<ceJj|zd`%LiALx<^hx1&)uBZ17LlF()7_97d&*BpV7(Y;iv3NAXLE&MpYx}N!V
z*!obL$i&F9HO@G(l3^gET(OJ>0gi=nXK|93tbkf8VDJDB;VZj%+0uOm{t%xJw)gVr
z@c6WQaJr3yNGCatLvLxHs;WQ{LrnV_GGsB<%!8JO`6VXzlT!nhf0_+*h`-~C6_CeI
z)in6>Plq?@Eu`vm+8ia<5?~DA5?WVj4{5{i(NZS>&qOk{U?Xa<ptQkcql9`gRX+fH
zEO$BlF3#4vvTXD{bmhK<f4m3)Hc+r$a1r_v`*n{yVS-F^I$rD$j30oS?dZc^+hkb7
zCl)&6>nk%gxy3QaALF5Mk)g7STM(h<+M+3pz=vyV@kFE`JQtxZE~D$j6YF2+`IO6&
z!X?KpI6P4(f<}kRLp)#^5-z2RhCkrkuFcs^=6D42g$P8=r($4zOg?0a>Nf)qSPYu7
zl{_P;3%q5S-S9;`EYbnNk7$`}#`FnmXA^JhD5R3k3UTqx;hNBm2E}fW{V|Q<MW6Ti
zG*PesvunVY=p<5|hB+%>CvnLE<*?}tDqRym43{?|rYf1G?DE770mKDL$Vc&M8)#Sg
zvB#Q&8e79RfC;1KduoekB&EPi4PAKZYXC{1k~=lnDsa*PUS)K<L#=5Y5vn5;Vx7RD
z`v0@{?~QF6$HF*#{?4aB)HfEXP_m@lT03?REm1a)B~cGa#YxjVEJ%V9Vv=A9(z4R{
zeD-&4djl3AB+KnNzo%?tk-%POXJ=<-=K@D*ONNW1g%ZGJ?`LD8&<0pcZ*^)AHv6ZD
zE$ojf6QktWD<)p4)x-zu`{T#tZXu<fSZ`*xC$hR1jIy;!l9(tfD#%JxM0?A{mDiO|
zo;b~dBs)pmbD1gHiAxvpK(LdovrQ?4nDzQ|0+p=P!Bd<Wwy)0~wZ?nac)at>1g?Rj
zl#XcriL=^*Ro$xR#^Pxx<2O#@x2x&V+EBIPYdFVv)g!_-Skd+;VlYCIU!G>GnihSJ
zO1$1n4;-Ie3g4-wAfSiK(e>--wq_qal*4g6ylq$qP~CKIjtgu84xMulLi#}KHaGIL
zu&QHbM6yo9ZmsS)Zp>+z3EoVxb7Y%o^f!+DCP;@0z;~H)VDVeN{^7eEJPULhJH<_=
zlHiB!7uIve^^9aiRtjmlra(kM{I*kdUIET8072p*OOSX?1RNM9v@wK1!f(+jrIL{)
zHcx8ve<n%AdTz~>+HuYr;dHo(OI_BB&C00Bj$}*%r*X(AHohXq9%Vg~#caPN7CyS0
zA(m&CnGqm5I~G`X-X3a;xcu0&zy*u?j5)G#w2JaO+1<$M<7KmWUI67UzcdeRU&Jcr
zNz_1TEOT{g(<!MEz7xJ+L<6*1vXO1ijp@MK#7Z4+30kSy4uYUvx$#;#h^kl}+F(+d
zleyu>qLH9lu@Gg^-Dd;BB5@&)|EXM;;{zl$!Om2LBXV(Cm+D40NRnMj^k^D8SL?Ou
zoJ>_x#!`IkXuq7H(H@4<^WEpf-nukUjY`@x1R1Mo8k!@YM8M}+OvDxd6R}OV{&ap9
zMDyX2fj^PgNjxQOhD%*TAJ!CM3rA41aV9868r7do<q9$6gbV+3FhoZ7F*qXZC=VO0
zyr<0d+!bYJ`PR|~w{|Dg@wQVHh491l&FQ%qvmQ<_<Y=P;8Gj&P<@AA{L|Lo$1;wFI
zl8UUN;t3Q@JaS%B3_&vPjICg>Xf>{>WI__tTvCVPE?Z33S63pX>0D7Pc_F_)!Nh!c
zM+4hb2BTSqroCZhgcOiPY0fxy26rXGTnb0*{8o!#djaii?wq_FQ%>eGGBs7Vtmjfc
zGPGiTtNAY#5no1xG5TZnM8`>(sV&0Qbt>Hg0IXDl?fJWe)4?(wlDy6M_Rx8&viUmJ
z^heMQ8qvGM!pdKHE1#~zV0(!T?2Wi875*A6c+g;)OFPMY>81?GUzlb!csyqfY)Xen
z$91U4tTI2cG87mM00k$JFqAs&9|o;=g5`jK0$>(}1Ivd3YtrMVG;bLzn(2~GLUI<z
zN=)X+)nPzNfM_y_M==LJzGcfMio#B@$yf`>**j*7aI}&@Of(`GNK@tLP@7f7f=(T6
z0ro|jJ7s@Wqbw+#6UDcJ4fknh5zUb>;)`fC+N&$x8aVESsG@L27VfDm%hn40t%y_u
zQ2&;_I*I4FcBq&^G>RuWnW4`7tS|!q!-(8U6-sbP?X}T3VQ)(|@4mu7r4(HxRaTB>
z`DiUUMmOt0`K|`b&{|nhzqmbV2#?g@1Vh-c@}yzTYn&zUlFKD(kTRQ`C8hAz+Kv`Y
z{2MC-_j;}V-*mTv$5tNKxsW*k5OkCB{t+o$N7N1eX1Ahtx7AsO_;NR6;LH)lW3!QA
zYjRVG-fa`sGQ($q8m;AAW&Q)0bP$ob8PQ4U9<mADC{=+pq?O#X`ME<t5gQ_k$dHY^
zv+U|hBS9doqK1Y#Y4Mh+a<0&GMma-utfDy++GsQ~f-Fd+$<5pbBt<aNNhsu!DjcHx
zfD}XL2z8bd&^MY+ut4FC%mE8E{Y2j-%6llmZgu3epgqy5UeTn&8H38)hWJ5QYUZP}
z<CFGjzttU_cY3YUlfS|77hb7NiC1dKchX&*QEysfa`*Y>hB4|QA*_4eGT9;`w~Vhi
zq=`;L<AD5c7@AN(LnSD*TxL+_h^0>PET%1tDPAYZGIJ`@02=041gs!cbVBC*09Ue*
zVWR1>3PMNnBUL!1=q~mtceJ~BM{8SD>jdU$n!ur@O+dn6I88=xIfb}`XUEY>h11h5
zs^(bzu>-5VlWWmZ#E935s7WY(SHjzqwLGYe0nk}$`q_HAiWk#JixSw6#gf#Nb_jI|
zFkf@RDlalZKeFfz&92hP9Qc-zBEVpqd^N_YNIom(^(`ko=gmedU8gj=?1@LA_|U=Z
zQ_qD|k*txumJ;S&IdRahva2aoLi;s7(*tq~(7^Ee3jbPSm8}f)3Lt?aPn7BpC*CR|
zeDE`$T$?#Qc=6<Z(3Ja#byD!QrBEYu(j!dP;T*bXW4>fX4sr`fLlg#EF<UYV^trP_
z#Ssg66!(!N$sP#B$g<nPYC>hvAiPU@r$Gondvs|u-^Lr51+at)aQ5)LotfcfB-#zP
zo^)Rz6NXLTPP)dj380GYB!Xi(r6AN^NU57A?$g>f8<ZG1g+*ooSZh&ABoM7NnJ`L&
zJ>YKM;V$2Oj^7&2i;;dYV(H&@xBVE^h^rORHE@yN#tSu00BG4+uIzJIbP|1((QWM5
zF@Oz=9a_hjF6z3p)+UO+Jt`dl2F42}wp;Z8iKXq9W>4+NXx!``Cx+VA9%Ym*^hcHk
zi7gW}{Pom&HF92A*C;wGiP6AmF@=mjr+jECf_WXLEXA7&d`_x5Dj<?0dl2{NP+4cW
zo6D>82sK5uGSu9epeyia|8Ph=?dF0h*)iHh5|d%d6gb<MX5MRyB<0|~`*o3*^0P1|
z)l0H<SaMRfU6tGfo0G(3e0Sk@*U8R5lMK~Ac|P!AlnM%nitsb|KG+X_{~g~1&!1U9
zDR#)vW#0V^wSH01JJXVEe(8r85fz;dd5@q(qCuC<3rw=6KvRHiRwEA)-Hrs#U)zDc
z2)`(*x+P&~FF(vj3QSmXi&8_HP!16loJ)dz?HUg)9V5RX9yrO8JBy}ibc2FaDVB=U
zW%Y&fhVg>g>IKC3??MB7i|JcS|JiO96nVTQX9K92r;Wh;7=3wA-x2=LGd|4=0&r@0
zb7t+bAcjG~(BRANu1(4<go=N$>%i~bgI{dja0d6FFnoXNz8ayvd9%sU27G0CUBzg`
zWX%q?iS&Y)i~;hMczAD2HE5dGGu;JKb7;!)=3Ow=lSKSuQMD?q@#E(>8ZEoggvopc
z1L{x9@ZzJfK&JslU1=qXRR&qP0KNyY=Dq$;f~DHKyjP(o)B5f~&M&`g_kLNhdq=yw
zRTk%jR0?c&tGsGWs*-oHqrDz9iEPyY+ds>MrsxVut7~r&Qe4gG;tp?{Gh2s15cAD|
z(RcA(H1Ay__}8W|AC%T~5?E>NCUUdCXzheN)fRYYpN+ahD>2nInvIO3C1)X)3Op|{
zTIGgGsV^Ne=835{Am14k>cMZa)&dk=E$a>kB;x!4>(n@2VU7_B6|<&n8}}vOJ;y9p
zI;kuyKXVvlPDHzmrXgvk<Ti@w-qtL9&vmwt-c91GwNZ;;Gds}bE-Zsim5KKkx~N<V
z?*uRO_;BkUK$SjUGK|o6?@A|clU9fxa=c>leTbpv?tw`H5tyW?*w&fdw<LOyVlO2@
zF%>h*A<BM*6lT2K2(Q*;nuIGc{YH}o?xu_LugO|*k!kcU5~rZ6XmzGQ)>}c>HO|m(
z|NDr_yDAN7;uGDc_E6D=*nryb1uD9Q<-d+Th5rktf*VH@w*9T`*vAhH<mg3xvj@A$
z<G?1**1Olyt&^@C4Sgk$fa+M{x#U%6(ielCHy$$i1CzTdH`rhTg7}Ake;iY}Y(LpL
z>t&iOEyFANZA=m{kPbBItp$yXsiviYpw~)HbSJIM6&-slbpV(#v#T4P8dA@=uyL3a
zpW)Rq8UDH>E^a;>tK#+2zWn0F-+A$0$^&1L4Pb%}E6RS4Qo^q!rwGTS(&45uYyTEQ
z#QZ}A$6^Sz=P`}_(c1;*E(F0EQA*<vy1O~&Shv+YRs-M)lX=Zo(`r(qimE6InQ4+n
z(z`N`vk!7<%H%BK<d9-)K+CSI5mopmH+B<h5i{{2G{SH&0sWKPuKD~JbeSF1X<lc{
zFO;0XzW^Yr_`drb5jhv(Sz)_6tR%yS#inx!_8LHfWSRV@NT}?5hR)=qv04EjWbi8L
zUFE^^NROF^=ktK;@b)ekjFhi77*;;YGaYmS*A=hLiGjg|xJk`@Ehb0d)JRjcG1wYI
zJS?;)jLus)9%>U6J9;6t5<7<Sw!t>d49g6(D(bG(IcrOAeX7xI9?fp>H|XhaPechb
zHpYcIc#G1-0B}@bMjZN{RF?rk6Uoiom<x;PE?u!oTp0F-3S%r4Pk7@gAukroe%tUz
zT8EZ7{2B%361OEvZKM`PC*0O*BfR{_lv$IB1VZH2$!7vDWjQ@6`H4xa7%U_=-#S$_
z*?EfZL=C1~55(`pfw8fd2x>SaMVesBNnJ9}k{O>nNHyppsHqK#Sgb9oxix)TB*9S>
zu+-|xa?<eW46@fSOXX@#YDBbjh;9EeTqP&fu8pW_-(`Fa@}$vt8L%!pHwg9uXjs>A
z;!AW)iFKd)y7v%<kw$Dz{7pH|?Cjr;BO+TD&DnBSd}-ODdPPapMsLYp3z`{;U(|T5
zZ^D5UUX!ty<eU{k^^mZ#%k^n^XeNHd8}k%~r?Odm6l`6$oYFoo=hJ+z#7;a04vV)J
z_HeaCZ~EZZWLUjz&wM`IdDRP@I}gO4bIED$NJ_MGbTirK{3`p#t+Sz!=T^HjN6Y0r
zQQo1n_>(Z6TCSUZ#9I~~%3{LpJ9RzopnZkB@P{nQGSM<whU^_R&s`%rAs(bOK*{f2
z9Nj1h@M;}`n74|=ppuD2D()GxD4eIpg-{GaQR?T=r?4m3c#ji(ryRD)YLX^TB}r@x
zDI-`!?r>z`MYEu^cGw5nwDUS?`w9k}ve=yKWSpszu;jW)8{~BQttV)_fDy(3Es+Ec
zk*2eC7kdMW{ejsNSlDu_y$RVkP)}T?#3i>bEj;VC5g^?D9%*UN5uPpi2p^RB2h4&r
zXpw8`rt{d-S&ab1_C%RUh90J3IOoi>M75wiQGb-P(b6nfOhZzUXypncgcd@XzHy2`
zwxhk(9(J@G5~0A($wRwEFEb!UlgFe?zGB`&nEYL{P1qJE`mp1?$&9tyl`nwA@KKRf
z3OZ}fd1`7JvSnIi=XcE*d+i0Uk{j~HAPSE=dX$hu>@-nnLRm|oRmS11xDsKGbe(CF
zeY7Jr25W7!U6kJ1)`_48)esGxQIZJ;*sjw=nm2NNIqo+98l~kNe`g0$w3u&OP057p
zS<pJ~w9fk*Vv10H#+AwNV~M#U<^Cg}!5blYG7ml!$TTR~s-p=W)6G5%a0vgwn?|NW
z!y}Swy^a+R(Vnd8N;#g&CnJa)II}kL3Qt-A$d$F=4+#_H3K!u2GCCK-ihH>F4QXob
zp>|Q-Rad*vkS)y%{TAhmUq6B+?x`Ztjo({K!r=>9NkHj9EuRm5ud*R|LL732Se;9>
z?zGFo-m^@;_GI@t!W>bGR4c8%jad0QABf8Ns=jLWUS;F>7HfR$)(e6)2Ki`>#l8O}
zGja*Bw8JB)@z0(5-G_1l=QXBdkPuKiG%^(|^@CUIL(3qzFNmJk`cOURl7<2~nU#?&
z4o(@Be!!CY(Q&a<>L>O>@q}cukJ{P>Cz%F8kS*Ww*IP1Zd|0W!gg)pHS)MmV^g)UD
zxQTWx=^lSq6zzHcsK2b4yN8U=(>H>CR>o(HQhz0y35<p!KM+_kC=g)q#@@N7ay3J?
zcLg#5QZ<?RHFI76G@;ppCYjnw2eG%eSKlBHVll$AyNcUd=ZX~bUnP-y#BrsRE0D-v
z<6Jpc`z~;HbH%P95b@rMB$0om*#6+FdvAfiV1+kM>YuC^_z0l+RSF-8*&nTSa8wSK
zcu`I3@JUn-EJPngOQfVGY85*Gtmh>EWo1b+=qFylm4WG&UhiVu=UMdt$EC@t2ecmE
zz)bu_a1aZaABtrn$rI6LZW!Z2kjGED;_LQ8RRRgplZ;4N!*rytNQFYdb40<SJ-5cm
zXsr);_HWR>gedHy2yWzWHFi_Z5~Zm;N}*TL3VkLeh9G4O)|NK53@WYJ>IZAmB4#!O
z+GGH45lGx4*dapCteSWW`Q%gF5*t~R%_6FjEXt%*+P{+Q{P*7j!_oU9sA$o(ef~r9
zv|MzhJhMC3D~CBZ0z_7H*v#rniD*7b$ZtqWwa$+^$L;f%gI9ewSp;>RQ2xuiN(P^>
ztE?EXsjJ@W_Qh$t=j*Um`wdyNojUhiXDQwp!2Oo)lW8xo;p>&%oGX)Rl?EZZPo;sM
zVztI~sSd*un|*4G?92;P8TJVB>I?xz;G}W?umL9kCD6pa3=P`n{Vd|JVV>I)JpA@+
z46r#h&zN6<H-Ic?q0QLRfVy9PnTy^`<M&AMUgHKN@93?E|J9~i23DWRyk-lU3~^gj
zvOa}^rh%V#=@0T~u}Q~NN(GPxZrHJzsIF+C@mstg@0R&EdavMXrz^=+d6z0W;k?8Z
zeK(Ef=9QH(F~6dV?7GP)aE%v@N7xDci&;(J-)RQk?i$yyu!&ssXQwE^Hm?AYK#kPR
zI|}Ifq@dbn+<BKr9t*7GcB8O18=L6Pb5@F!|ABMPY#3276zrIa04m*BxdPeDmJhr0
zDrk2<Wr&qYvV8mL0;_0CCrjWO!A2dcYcj){Dy9<f;kRfWr1NlbjTa_~4mm$V=3mz%
zK?WH}6kC*BXZd;wCvJ5tv9F0`XJ2fJaEvw$zbV#swG1&Rh6<2Nx*XO<p(M!mH!s_#
zfw)CyY>>rQfK_@}ja)ww0YC!K69kBxq<S=Uf(TwqNwAoB)v$CpBw^X&UkeJLg7XOL
zvCzdF_##|#G!JR%Z7ebi_fXR0YbXg)(pzd$iIIf5Y>T%vb{@(WM0-!m&6IR*Es(Yn
z;qFQ9BRB0e`$kX^9Ah*lp_mPup9H%H*e1%9YrK_%@9BC(jr#h*;b8W{P^|plMZrb;
z*b=6wcjMia#XqUO@Aw8FENp25e;)%lUMXk{mHc3|!*cR0;_+a`y}(z?1*oQ;Va5P#
znmRdp)jmBQ^nbc&4cIcVUeB>txRYqqmg^w3(2G_VFp)l{^{Z{sqh0YxL^RvVE8xu-
zo&lU4%|8XcJ58=?r>BEA&F(o8=&hp=oo<Orn3zUSf-ll7%4I-tQfoxMGTMG;^cTEl
z*6?Q<teA~q4^eHPP|c*K-B5C%fe&>u7fQJ){m|;Z==55RV9O?bB!mM}0!Uz10AiR|
z4bP&wUP5p9E4{oQB#yZqU@{!Pi&GW3n6{uD;8-gFXaJ0k3Ej@4nxFU>(z{SJV~&N5
zG*0Xm0CBIDh`D6m)p?@~+C`6`NB|j+Sy8>YHk;C8b~^17^*7bv-#ih$9ix3p@Bw?1
zwyhH#*|m_2=3~OvR}p}A2nT@N<LII5q*baUC+(m(#<Cx9h`cF|F1uY2syL+{W)4xU
zxC^;utZPXjrC^-d?KpJX24EE}XB_K897<q)N1Tv>shq8OUu9`xISF(KibJz&A_QVj
zIba+mH<WHA3kc<i+<7zTwg1w}PoEeGryJFU!&Ug5d0wldBIFn)Gt+i7RwPs_5Ybd{
zuFG1vT#&NN!qw<HN|m0QV*wsPUlN#~Le$$$!9nZvYK{!K2f|jzNyNG#YF@hv9Z7(D
zPHQnv*c<E?ZECKx2C1)B*${KH4%E{Cx?sPqn=sbGID4Rx0V)m0GRZMB$HB=98k#m+
zr|_d3O_ci}0ScJw9LWa(D?_vP^r$Ehg!)l;rmfBv+_9^01w4t|SNq7`7OpTtXStq>
zA&sGe)B({yE5Evs!R&yn%T7GIYuWdWUi;-`uX{jIUx8eJ5O2d2KP;=^Qz)NrAb2Fx
z!7E#6B_mE04CsSevTl@0vZLV|{lH+cM(f#n${I#(ccpc}vbN#7DAj9+>f9CK2s`me
zALXZ(QR!7ZvvS_sN7j}+a>J5oX3pM|nzCtvm#0AneS#Z>zkCO41?&f2$>s-f=(YmZ
z;Sb$yV{H~9A~S2pG-&CGbI?5C%Gn@=ThpM!0Wm}fnYzXOcxf4tz$w~A7nh@rqau8G
zxjUL4jueR}Q-$Fz>LbFbq1M(GJMZ+{M=i5)90mj1vG|LIqWka*vr0<4_-pglYgnVw
zBQo2u1ncbGS5mB&Z@=N}zDkJgnpu3BJ@cs?<v8p6b&|YIGu9KIMncw+@7P`e4mfgJ
zZjk?MXx*A>b3^0AE-C6MoEeUeL*u0ESfk}ND}JxO26{)1(k5^rpVfH(Hy+2Fjg4=%
zls~-+TIuHV2&{Y#Lw05$Qf1=tk*$O_UBxJ9*!8Y{U1Rf7%tpmQ*@*8V!$-V}ryCgd
zzlCw%qMR@B!pKb2jF$W{mNSX*snY%?j#;htEoe`i=Qu3tNXOhG!{3l1#l^`w1@Uv3
zj+XI)?I~B+Hlv~##r0fD4bgq6J=xrnkw|4AV&Km?A*WOBDG_nqk-a5cp|zw|r~}2>
z>sl%bs7kehYm!YN;TR3Ja4poefZtiux&JQtWLpg)AY)Z4ua)W^z()8{xhBizj`<OS
zgp)oK9<z6`sBAKBMox|z0^x`wt&8)HPDe%3ofFxgqM!2)+=i)AXJ*T(NHfaEi1=uB
z!Je$Afwlt|pC1{PK`b&`R#EVH$2{Ttb9Jq{jeW8TTP?SBCCg4f*0nq^>bL<WW{i4R
z+N@mdOefZ!Af6Bxgpo{IEtQOdFOPvNjkOsygMwf@iI>J%;RN`A>6GoMwsGmUHJuT^
z{zbAtHV(-nfsObIu?pZ(HfUg^Eleml;52%Nq8>JvOEE+7t0ZPV&QNI+DFJvY>&HS2
z^@<Cjp#GV1f6pTLz=|K-O<>0mzv)<Dkt>5Bgd1F)ZTrPoKZU8FAjP~LhaFZ;upa~V
zqhut;LbU!0mz<9CS{tBi^wTM8$UY<6vube}p{f-Dq@Ey^CQV7IE!zV1a;38uTJaX0
z7|A?m<cCl*N+||4AnE>JD-vud?YPlAdzUX-KcFI@+qyXIc1~MIubSsCTgSkCy&0S}
zd;M1TZ}+K+&)P@Lzh%ZM2*^80Vv%AND%a$XXagR2s;V77)j|a1X#QqxL`}90NT??#
zvk!h^4NS_u0}YVq%#RwuBow`#tc6{buhqCDYSO6z{%LRwUy#E#ZY2vG{xP5m$=eKR
zrb?RNvCtsLoJZ&k_w3RNwaqG9Uxh=e(2IaNkHh6{NiBU|V3C7CGMRuB=kJc+6;?j9
zD|hHCyP?p4IHYyFx-F&x7Z?E<O@7GYX!FkR9=|{lRLo7AofGKmW*KurPTF~T>jFVS
za=Q0`d+MUq?X_VGogcLZFp@#9-|Y4`ZYR4IjQAe4dOw{X-Lu2i`El#`PBl)N?NhE|
zZ*&fjYyobyjIXZfj6+6@SW!(O$s$(;Igbn>lv74qWlb?Z>5G@W<_|6QpdxxJ`7_iq
zD>F9LOm5wi5ndt!<>8R;fPcpCi&=jeYr1F8$OUQ^FIY&hZpdKU$_3e2XRgE#4&DSL
zKRLbZy=tPd0vSP5@9Fh=HBN5kRx)xrgb<g-eGxx6smvhk$h*$vpwUK=Ta>t$5!#O=
ze!pgmR+M!?M_9E&q^sn&W9mDh5oy*DmxK6dov3ai{`0Z-B8wy=ZW}1joQkTp*jva=
zlCT#vak1xCWTGh0+rvPDn3~9dX}wUGf$$?%lnn}r9mMdBbD9pF9n0}>7lev%Hk@jn
z-$R8?rt9?j_(cZg&05ko=nW$|%?)-<uv$=?WXvWBdIlLSa@w%s_$i(ty`7J)m&rW-
zjcpTE3ygrAaqFSzm&~Ig8BwKygk-4!TiXlQ=^pze*V<Qt2qZk%RsH)N?_V7bP!tDX
zJtY(6z8vvXoz?;4%ON{XdxbBe_v}WpA37}gMArwjTJoTY)L~Qg_FS>{B8UK_9B~=r
z@V_<NprDy}HUn_MKBV2L@I!m4qA0RnZE8b^6b2qp>^fc4=i#7$IUdf}GX^HD5!&Xf
zJ~>=g1NG7>3OlxT{35M34z(9o);2PfJj?L1g>Uw}-{D*kEU%dqyad*G6-s`BwZ*Fo
z4rRGcl0J`L;B64@U?#q%!DMb9Qn%4+ca`iCAe94d3FSCV!ZC}Ls(~XOJ+wOIca|ac
z6SSA6*#Z?ankqgfjMO2Qt=5sqXc0=l)(pwWM4HeN2ZBnC0sBFEIYDi{iGr`?54{!-
zLugJrO)@>K&a<c*)fpt+2k_B%tWu3BQl;|@kuhb#lSaW94=P4wl^zu#PNdQtPkN24
zlPMd=1O)7DRG4r;^ijlDXx8CK%Tj`sM|9q@NS#Mb;jbh(w;a|fX97soPX{UPK<>F~
zFTHPQD|}`m?2D9_(aO|(aoZl(>Yo5Dk51e4hveG9QRn=;b=0qb32r?o;8ZPGgr2Z{
zSz@PlJMo3Yz+$OA3=XK2LYb+Rth5NvxuveCJE=)l5?WEpZKY*nkzFZxr4W?57!a`%
zbsEn#7enkWI^>x8n!kx9q5@^#G8h((KfwZvOs!U`bAH-BZ&lKF*tJehR5i2Vi<Ic7
zAk*2efl^Px<r7J|uG0Hxx~?t{nXhKmJV&-dcO9iHjo|R*SOylGsN2xcQ^G{N<meV<
z<N(f!(<E7J!VfFwHIGw^aDuhiP)&2F+ET|J{W#I8#$l4YeH%p!GBG$4y)S$7F0Hf5
zq%ViMmeUfSQaBjApuoRKV72R^)~A{^LQVDbHZykHr08H@a*HoeEF(<`9kN<oNDa%)
zH>+dm0Owt^b^V(sx~IaABDBpiJ9nX_X5Cy$dUwwG`ZwnEnhTKE-p4aUFB9=z#%-Wd
zf=p*b7f$2(TR+h;=!Bf3LSF|*==Scmh;5;j0^;%(g{TBqORXPlz1n(F=h-LgrPA+N
zngJEG>k7?a6kW9?Olnwek5q=K$QCZCg`0>q8fLf2C7IGFB4<YDb37@U0(4@O2%}^P
zC;4i6`w561Yjp=evtAD_FE&y;yZCYE&3VZYCTLjwaN)DTSoleTbTaYHCC+_lFz|2W
z+A19B^851Kl)vXL%>e1XJJlq5-Vp!}P~*(o_MB2Rsf@xFSaa~SH@!3?#}Kz9HW%`2
zvt)B2W`vuTA21(n*vEF#<e1V|5f>~<I}|@uGdeNuoiXB$LdZq8^RnCO^-vnA%=GI@
zFzk;&jyx3q1(ZD3hO!OKx1`NxGe)iZhhJ~HRECz=@D&3%%-_zD_?B?TH{l|qaVsV&
zy*JGZQugT_EHJ)E+q+NJaO|sgTB0-66F*5LiUc=K+5i*P+qSN>*zX58y=jKS2hx0z
zvSvWy|5E`rwjUf1MJGT7ifb}5JaudGLtV8*#CQRW*4pMDZBY`+zXjGV-Nn;y7k9I8
zNh<pgdd)+Z<Do{OCfybzn})6<WP&oJE<|Z%{9Lq3N`jrJ7Wj5Pp2n+N9m9m8nT<K_
z*q%u)M!>$BCPUyKX#FguJFt{PbuqhsKcK;rCL4aBsiS5yIcUBLnWDH*)ePGsjkH~j
zOy;o~6nsO;CtPwOR31$Fi3Fg*i{{bm%ZtHLx7F-dlYUecpm_aG_ilAi9By{YBw^cQ
z#;=R8O#Ev=aJz3Bcxv#ykY#|2VIk<;NS5=*<2Xtm9)KsE?&|?t9>3^x&o?W{P5I-t
z;UoHXcnM|P?V4dK?X|+vFm>peWzK>P>R3P8tc{gG%1TSZODfizb1>g56XHE}YD=`f
zQt5zgGZq#5F3Q<};#(fSm4+VO7u4wb2^#~_Qf~~7C&o==q?CKE12bt;w0w*-DtJm)
z#+V}vlL1f>^q%3wnD$)|3xNa;opn<g!RuI3%ZSV|Mv-H2Yo*CE;S9=B0AeLxlX#5T
zOa@LVLYDK^kNpj)O(@7a<^`k>AaVh=Qh8I24HjK*)9d!J9{1hS<T<`_Hds}%JS<-=
zk6ko%)79xi2w^g{;b?>P(W3xgYM{Yu_1z6wFkD9A+o$AbpkTpspWtn%p8f|7!ZVIp
zNdhP(lr+XYQ-wP)Hp*^-7bF-@lhVjKD1iAE-DnFY=Vv~^g@UfivseON%C>0N<GAOM
z?RA{<4`Vp{^N!-2FBfB_G_njKGj@-*Z<%q>Ein@}Fg;Ifpf?bB>NpI?V=Il6>VuFX
z8#zDHp362~<g=`5#0Uf_%;UnutJzGcB`c84E8_L`VRJhxeUEKP%tpP+;8JI!iI$0_
z6HxDUz!pt?*>iTjOBHk=A;%Z0odS`iaracUS`jJDT7YT;d@_zRgh@yJM*^8AP@)O#
zw>#$pv;Y&8=<$;*s_2P*@1t`$12Uj{Ps{qX>`y9p<uzW}*ppmp-@O-g8@{mzks$Bh
zgAzSA_TXGc+`S+7He+LNy;qlg)DzvkBUN*AAFc-eQ)8R00lO~{rH##N)rGBe+UZ=}
zW1Uph3NsR?$NNr(e^*6qtsJ>Oj%)SGX7nT3{~pLk^{Szsh%$HY#Fm3LlO8Q9+=KcU
zF~jsTjwa!Hx-zXXpCsqD)%?EkzjieAVxr3zCd#ZSweNv$BJBf=M(A*C;jw0!ri%`Q
zDvzSYLM(qN%mkn3Y`~;+CSov*s$eqaCjrE|8&J0EhGR2cFqZy=e5--`pqw019h)+d
z=}1^|6)t4!p7DUO*(IgyF&6D;rcd9Oav{KX0LqRYcyDdfXAIWDG)+cvE@PgY)Xufi
z4T3O|6m7=hOSy@QuNMH`ma()2Zls)XX_O7yo5MI8o?vvoMTmpYuxa+17a7;$6-yX+
z3D*FL8Cv4sj9WXX#}VxeN1;o^tBIn}uCAXLOi`C}qLu-90eJ8T6?ELv=sF4)Zji-!
zV*5;pi-^mLo222zT%9*{IQx)?(*fH%49HJZhmiS~NlaxTZMiJvh)af}^E8YSI55^2
zW7AI2-T!gWK5tv`*NA4V-tTE{+_2_WdTu=i?s@}Tk{y;{W81Y4Q#L4k<%%-JHb#kD
zr`O78371Za<=P7*_=6JdObnKJFk7!UTmg=mDFp|(gx!YziVa_D<mrP$AuV0FMuo^q
zsr5LA1P7l8CG&;yw)Zv08=b<kC<3MppS58x>nc6fALpLo3JJWPfh5Y`cItr}%R_xU
zD4z*6XGJ@a%lY>F6*+YJ!q(+RAhZeORtfsrjj$iK;_>#hp+OFQ#q}v0WIaDCQ$eMl
z|NU7Yc*nR{UWW|R#W$9G;FE+rD3^O#h<|VqpGhmvIp>tFK3+4Z9}a?1{O+KzWXAmk
ziZ9EG+qaESb~ehEMFkRvkX;4GFIXU@9KggY@X3kfS#2=cG<!jNwVk@a+rj&AIU_X=
z^H!7Nz}heR>K&7F<Qk%69hodEsM1uH)y8>_)3h;_;7jvtTWB`FUL|;j<3w(AYsXC-
z4{K)WIjVgYP%J`Q+mjWgc(6GaJv7@~Hy=j~8J8}E-7)ymQ#?!U5#mjQqFCk$#Kw;~
zDzF7$9z5I0!RJSLG_^=X;Y5p62Ak)c!F+4txC0t@pFn=&RGEOFVDWgRc|V=?S-Qi%
z+?m9MRd6(u7;~r0*E5d(QTHye7msz#`rW7Mh>5-lTeAUbS2}|k@gJH|@Xr8uR6Mu2
z7!6t=Tzg`LkYP}qQDR`09^h6%3znq>o=LmU$!4Ootmzbr!;ei^l_#-PK%EtI?}1)b
zy3sm<Pt-n3(f4WGCAKby@#U9pVS`4y&*S+3!%Fyy=oB1}@LEaJhX#v3W<d3gtz+i)
z;^FDM?&{;=kzm{I;|0d&Sw^c)P8h<*n2nnmQ;vJ0Ipv~fe$eS*=@vuzVW>NdRIUZ}
zwa}A5rLH2Lk3A^FNJzZjLoJrOQs$)z%+Q=pEqODoxm1C-d!?H>Eb+h+)*VEw>X%aP
zoYdzbFLTUla$pd4n)BKSv5+6rrNJOfCTdtFpzl1nftg9vn{|qc8i{DdDW9y80GNTg
zM%g#_l-R=aXV&XX7)4Y$Fs6xbgSHD&@f)JKzJa#bqIhma-ot~<g}Mw`8Xc^X73`hi
z?J7#$<HKqqTZfIsxYGCEAAp?lI4Ew`bYE<f1*bI~*8i}nUrtXc$52I1Oh$D5TgCEf
z!d9emzwT%AL9?kxMyh<s;_RogbzDA-@%@@&=hM>9qe*OSs>di}kK(aOwMz)CBovOf
zgIY@mMV&2y`{2vqV4pq)ldgYz>X6?zY^5Ru1JfR$vmvE+90#yfgYmG5PFctF=<#^i
zvww7;N%U2Y>J+Z_vz<T(s1ZFZMOYNtuFOHm9Z0$ghiI^%%$zXcMqW#JPDa(QquWdL
z%y?Vlh}9GmS_iMTlQ+OmH&(fXRn0}f`hfzU?abZ*yr|N`jzG?3`q<9SjPwHUxLJ4S
z&rtZLftj$`F10l!D3CQalZz-FIIHq-QKs-*R1OO4jv=aWeDQGIs9;utWehq@afV3<
z(7qkD?f|;Ipd-<4QcO$&_;n;Xwo-PdAx$?P^yE|X_jR<4b^H@cdHR{w6k`WR9F80?
z<W-nn*Vx{e^%|H$N0vi0#GFcQjwMgTjHy<0LecNkIU(O_iD~R=`ca)DjN(b)_Ii}e
z&}F<J>!2RULGH<+8r$XhWv_Ky%LFx7S17CHXtt<P3tZ`$%36=(APi;TzzQF$C(oqm
zJb)S&nZcZL#+*xt3Fjp6exM5O-0^x*tuW^CvkH6R*05V1@v}P&CE~jf%=l7yMBY07
zDp-dca5*yf0#ztb3C=UZgqf(iSjXR7#5H5?4ze;pmQ&U7n&WRwN|Hy(=2*wU)Vrq<
z2=bX`R0Fj7e;7v-bXDuNUbgAZ7S_Lp<?6v-sr~%mwrqB9EBFJqDwtb0`+&j^cFzVF
z5|3J>?fsHXP0>p^4yVdVSI0dU|KBYAR{b9V$BrY!SIF<8J`XR`;N61UXq0z_+q{*`
zkG$Zgc<sY(!wfLKXtV3=Df1Sk5;qEmIvLT~3fa2y)DjmiS%vWsHwQLE2HCm;yqCk2
zOn><9tHZCdQ*A>jA-BC-nAhwS2FnwcB`;Mjm*|R1>y@jFH&o4Pj+c(+Sn>4*^YhH@
zaz4c1_^N|cBpE9+T@cuettc;m)>8(Gd|Abqb4nX|_eh>9de;zGeI{GB7p(%h*3;Rh
z9b0BC6D~Qd0Nweql%Z}Q9$VeNmPWL7=rTXCOy84ux>Bt>Z5{Dt$qBtLZU&c$oG)cO
zC=tV!L|f7t84EM6&_xWJ%A@hN^yJWzfxe1h)xL)~sLg3b6J5lM$fZdGS=j-;s#lC4
z@9;trPM$~3!B(ItE3$krl*|hHN{M65yJ~Q6+<E+9_|n=zHX!gBX4Tf6%>iDjmpyGb
zK$qYlY<Bn)O(v8f{)Y18MR*esr!($khcM+Pl2DY|h=5w8C$S2q7NQ~CQvD`I8EDFM
zqPg~P9<9!k`3uTdNXJ$&xPRXNMW%J9S_i*a7}c5!J|$_io6L9dvMxZ<fhdH<Q`^K?
zVgtS9Vkzx+u{*{nhztx&dIx9FG-Z=iItFMosWZ!?X@aekpp!el3gw-d9T|i|r2*`!
zC5XcB13(lbB=z~tGkEv@Ji5tjS)mrLEp3`fYG-CutT!p#(4Do)BeF{w3$@`kCKRC<
zopz7~G2i7WKT+`J2#y>db<Xe9{nWOV)*TBkxUa!%4ZREqTZC#te>z(JDLIBXB3i0Y
zwunmO^cp%QES`}%FeBc`{moSP8_;aL>5AW(RvkxUa-8FAC@3@{aUfR}H4?5q6`xuw
zy^FskKCd}KkrjbN1wdv01M4hTibNghLWB&TvjfPg6#vjP3lE77r41FMHnEp*7N;sQ
zrv_}+KNps49zD@<q|g;-8Bxv{#>V#&Lrwy0u(hrtjSW3+bU~zeD%zLFvQtt?Wl|3F
zOZ<|A2Gv)V6b>_;hVLR0<!6jwFhqQBVq4jvD6`BDViKkv_&<mv4r8!EQ<_zk7NFgo
zEm0&Jy%`;iti>7NrS)P(s;O3!vb)dG+NdGi@=jep4wqN&8uqV|tM#Mk<*jblJash$
zo6k+_?6kHAuf`W}L<&L@iUK}t<!d{0$lfE^r=~eMKV-N+WFeX2nHx=kafu?G7nW2z
zHFa5mx`4F)wD3K%PGu#KgB{+M763RXZWFVNMdlqzH2mr}>qY%(X2O^ArDl&9|0~QF
z9Ts#wO<DB@vdqEANKxN#?AbzcTbZKmjALPZUq&lTM6BNEtO?Sv%1sX?1;fXYwON8%
zZ5&BUv|GloS$rBRnIIkIGV5SxG#i^y{18rSV_SPg{v$I)Eg;Wy+h&=Ia1+NdaL*Xb
zc3EcC#bqy+$$J?7Xc1%+KLjkP<^)yh{3==@r$4|!xabYbA3zbgN*yhBpVRE9R{mC%
zX0zCQiK3v*+R*HBG^9h%)qcKGvW%|=6>2IxE-u07Y)`SIQ1+fZxBb;<Wp8QJ8^;;;
z!S>xUrz@t^2|6Zu*Ae*!8n3&CaSy>W>8Q{v&mzUPc7>?1XjWts4u}*7rqY0@vC<Ax
zob!Y(4eLV2bpupOK*EpMfaqzK-K%1Jcvpk6a>E|klPI3TKSn~s2Q`MmqjV)kqV)D3
z0r^8q*q4Zd_F1xxvv)s-hW66cV1_61qoCFsw12$pb%Wsd0KdNMUdXpj|5ZJg7}a}t
z=@b}Wq>>vPc@TvA6HE}UbNNuHAh8)l-+p45V2Ss(8iD7aa+BX=(Ut!2q9L`KCW~m!
z;OX{HDcJMx^yRd3)I7BWT~)<H4DUKON{hxTg0^QUquSzWe*8RkMoGLBWE3qx&Me)7
zKGNHnjKAUN_BwOiE?d?tRUi3Tj;ACMN;}qYE6DQ(6nagg_Y@5}Kbl%S*m7&b=!eNv
z#ZaQ!5;J3~ky-vC(3z>#<ZvJx3Y#1_lpt#i0$f?v6;c}v=WcR}xB{z+&l<wi=mFu1
z#;9niT;(#YRKdrbd8>SQ;C0WaYk5a_mbB7}8r_$bm4WMjZc?RKDTI{nTqK=_nKGa4
zjT{W@5=x;k(yGe+d?8Iy?DN2v|3?93`-^m2MY0hNeJejO3mRFw1mh}@u|%kPb?z9N
zmEApWjyF_R+kvfL*KAw=WK&#yMyxVXCF_1TpJT#~4S=AtnF?kc3i*mWQ^Ee_lx~-U
zc!+b28?%JuK~JPKx>m+$G)US_4v5xy=e*T_!qL)3*J>))9M0J@1F81nviH*yJ9i}0
z&QyGkN%uruk_@f_UGrTz(@B>_VrbTo;pKavf7twkM`#hQ{v-n4oUX(5MiK^7(^$g}
zXO9n+yBL4~*pu7e-jD*8g`VXA<BEsgJ`iFL(S^v5-aal`-LpIQQ9x3>9W-Ay+vgQ~
z&?NDtm6b6h>vUE)jes|w2bLAL;&RsxpDTM%J<jtQMcjo;27&u=4|Ya5m(h@({Z2tu
zeRmwc9sc6JysN_oPM1eEK*o8E<X(-{<{hjfs*s#H3`3^TQU-&z<0h_BK~*27icF4h
z(Wk^71s(}dBiK>%{HS%>I`(qUUOZ!5voOv~y=lCK^rc?SIZ_MxqS8`^7b-2L_@B~3
za+g+fPb15|bbecO{g*n?M`rQWwTLConQIx5o?Gn{OtH}5G&er${2SlGlA@7gJY0s$
zTgOXKv1;yS^jyKQWK72s$v`55WNbwFwIb!J^wuQ@H{%Ce8~DMk7FA;lwdJiiS<*0R
zI$s#m-P{G9!w7MA^(?*99Fd9y_&<RsQc)Gl>KEZ4v4Sduy}D>{?`!@1<QFEo<W|F@
z!?YAi>h$)MvLD&^{m6aLGs;vaw@#=bA_b+@c0CJnkHq25y)@zQt7wYB{7hDCi324W
zagpPB)jB=xDAnl`%8;zB#N~z(8L13<DBowIROXT*9FNg2=k}CJ^T1Q>ZK!ob#oAY`
z{*sRT8drLz`f4th;Vp0;wNV3$_2S?35-GL79ksK<*_lzjj&5CT>_%qKr@~bOJ_{E-
z+(XaH7whR;vEG6bTR4ubqGB&7^DY#lEe^v*TROtV%?-mw@U?piObPx6MHDU@->FK<
zN`-Q;vRBbuP(VDiu<!a4xnK*k`&5O&AwPpz&^zvl-J+F5XBKSz%*An@zniazzwhns
z{j!Cai0kL;x*OqLn>@yw<QkieOe<cYsV8!SHnr}`u*+n<TC9;(f*&AQ)V6-!veEA@
zKHU~Fc`nZEj^Ko>@oyhF!Via{LOdr99c`tib@%G5puw%*x15D9D)x&iCZvd;-vJ+%
zv@nW0NERHy8!6@7!h*f3Yun)lDqJI#FPklKs6jn)3GD?sF7^g++#SQub_aRAPPbRz
zv{qZpTkOWkE?;hIP}>z?X0!Za++!Kaj)M02iADZ_4y0LH9}>C8$QRqB3gCv-^?g(4
zoI$gdh9q}N(SZoTi`DctrZ}l6_dpHG?#9tF`T7nU)4}voZBBq}-YQ;^zq=EVOu5%;
zrGu3+uoPEnYFrO`9Q|w07^h*DyP;GyDwq-1pJv*^mAiXW=3-cHG}%I%+fo}ir&c9o
zQiwm9p`X(v$tX>QA4cFl`=Zx?)9cw6aU)#B_($%%@oPp)&XdO)G<N(V1BS1EUH*0M
zx$bAq+BzrA59se5#g@-}P#;kDs7lmjd_xwm!GLclsJXDDyG7q}$%`ED>ABm~hQr(<
zBnafE+LaJ>#=<@d)lif`o}RXQefuZy^1=70h<zUX94@a?Jg2Sq%<Tu?BQT$TmN9n`
zAve!KvIqvWfp5)6Y#;LT!7t)qq6s*^p&Ro<^0-7xf0!*=`*U?5#y}dkoU_=z0mZjJ
z|3bF@TR1mBge@%7W#||-#wDA3Sk9UJ_b`y>0kJ94gnO|oGAYY2T&Y2%RK&h`MItsY
zV>s1`!?`O5j;aHZe6`mmJV#1ov=Mm@5YGwV{sNq~0D?e$zd{w#z-f^BK*;(j1h4}5
z^Jl?VHb~ixXa|=m7ybgZM!ZURH{h@?x;eKs8Zp;UC3b_ao@U>_qsRn;9AEunt6`j8
z7(9IWEu{|`m5e14U32OCE!2m*T$BPJ052u2%U<%<wwhHS%$6q+A1dW&g$Vz45-vDW
zqB(`$4=!la%Ehx~FE>qKi)}e8SGa2Hd4AoVW!BArM-<-~0No!NndQ`4m05a~u`Qu6
zlwydSt%X2ft$5y*kQ+m-%iO&*5Jn<g5e?sZnyYEWLUVhf+k}#iR{47d%JRMB_+dit
z(J+y39=39A>CYCa=o@0ODQk6yp`wcYjzh(~>f-!;>!w`aD;=pI<60})W@0T*@y&py
zg;!xbzsulBeP40(6wzPobmdB*(r|CWc*TQVD}Rdn3^*4^FF#n5FA(o)Rc`pbYVCh0
zCL1Rdj1J{_rWM*(-%$(lIP#{4<-`GxwH#?UwD(_uw#TJC`Qkn3fY0^b?R*u!7Xp~O
zwN`wJ;yiR<K9jJbAnqH63)UG-j*|7<^$)UK!W?bU(@)|W`iDORz}pAWJ9g8=J@#oF
zL(wHhd~w8qi%r5P6eEgzr`^i{vmuQ2VD<<fb!ufR^f3DuY@@aG`&k6E>lV;<8jr}M
z`1C{?+6&mf7p<J}{+_x*FSB?G=tBu2I8Q-&5PKXLYDU)-gnHb_g^@QQj_n}w(F!Ws
z!4(kB?6f?ixCVd&)8%>)kB!Jr*bYUMe{crpii5KQ`w{`ZP@kP8K%iz?!BnRW-Ie+F
z{Mml+XPn*O=(Kb6x>gUK1pAHPpkCUo3Z7jwB1Y1ek=V)mmYZPiERAnvOvV+%KWwK4
zQ}u#lYi7;M*OTrl#PghFe0#}WR#~#0?3(EZR#1q0ucPvIQD{AoSw0HRnm?Yk&N|(n
z1}CS@mjjq^rDd{57vUTLg*${SZFq?OFczlN3zya??d^RmYdS&q$!I>h-BWozogHh|
zF1uSLLxa0`ea`jEEwWbvaE;*-n4%d4GF#7CrxQ{<j(5PUq@22XtgiOhQv$orj*!Mz
zQ`(#F;mG*rn|c)*aB^Q7a8iI!CXmT=vL4_7KQR$d-7q=$BpW>o?aEu2<4iu_Hr@>N
zoh;b(gMZyVwub;Oj-%1CIUh4`amQ`?a0j?>31@LSil)<W9wlpL#Xkw3K)RZ)EIeJS
ztf$jJY%fm8$9Wc}Z$$$oZk7ZG0*%`D!h55^lo&rx&}2rkcVglu;Lq4)8a+I9?gH{2
zyOm~*E2GLOhiBB9QyBy;_AJk2wc?P)(i)HVnINS-i6(mRKDFy1(zx|pZ9baEAjb3t
zXP2k_Hes!<&7a4Q%W9CZn>|nYFeiMU)|{*lc8j06yD>L$m(v~iyTMrC!7fI2{ZNb;
z$|>8n$oOB2Ail}m6I;-J;N&MU;H-cvPWg|-lw4a?@uYnIB}gMZ7GsRHUe-c!uykDL
z{rCI(XJ@n7Vqvcwi6!6e?eBe;Ln9sK2y5<t3;%t$mzfRQqWr+!Wrt6rSAn+%=a**%
zV^*o+XzaU!YfIpOkYVPLVCH2D7X6<tT7$Dz|5fK$wNG>UDOnS?vtMkOiI$5|1;|_Z
zI9!DkJ!X{zXbL1gzMR2N7%S^!#iD1?>N*+oKDkQf^N=sb>})XHh=N&sHOFLjS%8_g
z%79ipO>+ydm}0O8gdc+lwbW$QNO=rp>r*r$%gYzp3B?$q-w3Tfy6n?UhstP8PPE!S
zn7nD_ofR&MiA*Tzts<sZsAw}bz}9sj1<9siV0f#y5rV@&w@3GA>j;2hK@qP^xYg-c
z4aLa^O=5BkSbR(Q2~)SQdsj)1ybjL=99W`_uRV;g@`&afL741IXMQ}`BV~h-goH8z
z*kC3^J#-4`<uaDguuxR+D_zhj#0J`=9fUQQ2ivpNwwhdff-o4oQ?e&!DdJ#3E_iHf
z@!_qNMa@Q8vqpk(yiR`cQJ2L~V#=upfIpDM6Ft5jog)k|?>A%TEF0i&y6t|e9{m1$
zKqWAJL3JM0Vr+E_^h;u=eeT3g+t@4>;Cb3%)$C?<bTv}jzcc;JRu$VPF-OD5FwSOG
zIZB&ll%juPOgshfD&}dN9m{N4Q48X&*D{qb`s$L4=zz2aI2WST7m)zOI*jrFTm|nz
z5L2V~5t33eEkLS6SMBD$j02LG4D_^<V6V+1^s<2s9kRAQn!q7RH;)vvpK{C}b<WP3
z=f}azR{wSDr=B*0;P6(?2`2KgP^a89NpC$*D0WT*1Ua&MlD&;H8po`nYq<~j7*K6<
zzLaQ16q9a9sF{@fET+j#>Nrr~ElJSJ4a9OQ1KO(`C)(#fG*6!d?KzujsKTfxxHYp;
z000i5#cmeH3xw84lNq@?7Aqf;q%i|SY$rn4!Ju?*fOfHyM1xdG_z7=!Mav<vYB@^`
zlX?mTfu~IL9wUUuD@iJi1O?40fy`q*8YJ)W%8;8K#YxjFkx|;1j*=}G<WjStZ!!7X
z4kpgUrOm{jGsf>lUf{BUv5h5#WU>MZk<G4&6=9n%*Z3-Ynj~-63w3c$H+B1RQ&+!-
zXNkF}HCDqf!gz{SK-jGZmz_MAS+8+51iDwimvm2rdo-IjLJe$x^O)51@ty*a^EpRX
zww?e5<f~gC!!^3h_&(S*@BKb1v;j8ve#LxsH%c)@!jk_yQv?FD;(|D5IbKM44CA5g
z8)iWC7>gK#9&t0uvPUBm2G*fBd+-DwSci@KVgo4kAfku|UNc=*0k?F<W731dpTqUU
z?)&kMN-`^uiIq_ihWx=qjC>_Q!~&x?E^ck#L;N@{Gc4Yr=lioj(n6w54JotofZ=JR
znN*Ut_enGxEpBl-4SN!ez$%x!$$CtYbgWcSl$6MthdAl4(4_-yHSkCw{zIezbECK8
zS&4dpxs4h~#W@s_;bXUvZAupy+J@6t+bt=wMr<mL!^#a~!IJ@E&DL36nbs2HALp;$
z@F11ARch;-bm$;9&50sD{>-+Z5z5NN1m(}6As>NtxH5EMf(`pQ<@XdDpv-UhI~(U%
z8;fGf6Dz2}PCZ*+g{b&MioN4#vJ9_2-NhfCePixJ!d<Z$86pJ0I=qS`{m^(#2NuT{
z6BB;T^?ycLhqx6hrP<@p@Fl$P7$ow<aOuQ=8uur+aTUoqX7s_haijUz1RQtw^$y@s
zngILy!P~`CK}8kwB|BEOFgAJG;S}DB_RwNVl9QpdX!KIVCE!LyqQGIzLY-)J6)Q<r
zXLr$Has(7L93Cacy4}b$n4-aGsLk0-0^8l^Jh8!Oh{jFB3YzFQDuA_-;IhEsv}>^M
zG4|^;dT&KrW3d+Dp&4R{er-ZbFQR3fj8(#%Cg%mJO+p}xDq$K&2(=kr-8sTp<?<k=
z{syzLLo+&sE%VDY7!!&dc0;j_#htE_g<>{o#`s`?H$}P5Py++2Be+9o1wuYEeo$*k
zqu`KgY0NVwJ`}Y#lvB&s!b{Zx63&?d@s$YG*-_C6Ktcpg77=S2O;%Qn)y%MYlIBhZ
zCHaoJ@oHFLP)QkGzFUkhR3R1njMcd2s&6hDj#Wnfk#%l-#!1njw<`>@M+X;WWa1P|
zA_Ap&l)`bxnin_?c#4?Hadi`k&MS2`3Ino7qw4{LYF;X09{`$e<JJ(eq4Q=q55EsM
zi$SffEjW6#$Rs8X;}uy|GIbG5Ls~IeQ*Os)v@7al*3HBkh{_LK_5hqnzKPU{^))h&
zMrv$Mlw;yjmD`k7Y<3I}rjyG{2tC@fWH`^*>d+uP+F^t)@E8M=cmq^m67fQNo)je}
z482FxpSy=*u$@sei*nN`ys;=hsoOD3j;M`@zhlyfbYsSuJEP!l$Y=~W&duM<j3n}%
z64Nuq7#fPuPJz=^8YBZ9tiBymFvDGbvO5dk@20RdcUeWcoe4>(gC8oW^k&2=iCk@F
zAi+e<MBLGdKLj5kp2JXbO|CRPFs+bL;;{n94P_`q?@WR|uyCZEkbIWzt|Kj@Uln6(
z3I%VGtN|`6+dS)ng(%VjR~{K-j7X>xV8G@}ltmAh-cBtn(o};F!c-B*aLk$p%$-QR
z?=GXM%1CNwK*ghzcw0bl6%A6xi{3jN_LSFK6Lb{eNqf7*tXwJdfqEL!lA;tigcEh1
znvk)|R?dkyiBa|?Q5>eExmt(I5cnR!EkF;Y)aSLq#a3nu!3>z*c)^JnQd$IT1lM&K
zSsNoyyv#XLNV^&tmWE-GWod!s<mc5CaywQP<OqaI+Q=19ya~K<vk4yoi0maJ3iTNQ
z<yfbv!p4;!i)7|IJ1qsTwFxGq!L!MWHg(J^uGQ^?9VSHG7Ro3M=b^4Jf?iZ`m`{{Z
z?KoP6F-FIo+uN2(`c5HpoL64Rod;S;wTSkbR#-|AAi_YjUc$7JfrnW_#mW+afY~<j
zcSD7<#;<@8+5jlKH6-jS?9_M36eG#1PDoP6?J1pe5M~Zoy113ts}d=8MVeajRcHis
z(}D@EQ0%txC)@Q+$ZYpK!V$n>-Cz|_HlhsOAZSZki5x#q<SGK_IGh7kH=(|K$lo~_
z?kmzrr>KkVT!yh*qmZyvq~3%$13uK*R*Aea^aX~JtFWB3qQdx+R#McQik6d|F(WBo
zP-rxz<tsx`Nrhoj9q20$cm_zur>NZ+XEjh5%moeZ5>9IA4O6Jun8~Gc7@1dx-U}n0
zP0oY0Hn@G};L2m7h+-7R_K+h@T^6}bTn90A`cOfBmS>_eqzHke>qex76fDWQn+p23
z3(-q+NQ)?(r@HnMDbZYcDw2SR4+JtCTmDsooa0gjEe>zh;bTn)jl+Y^91ZhF(Lyun
zS_6OeE@hl*;7Y1qEz1c$?Hf#TBSKXPd7Yb8P_vI#{g_amIWx&Tfj$eExo9Z@4m?UQ
zWOM3jgA}_YH=A`vZjahruXpZU8P<CmN^{vhY}Dscogw-IH-bklme;j^>;)hF+0$&|
zx%!mrQQKT53~V{p4bhoe2V9*JN+*og7(+U>MM8r4(vl&R0fIJt)TfzvETKICjntd5
z39mi92bpcACt{Rixo6<xq@Bnlb8;>m-TPN3l@q=9E~!#=P^hARpvj~jjhvMq%*96=
zPNug;WZnzT6Q#GwX#j?iiVUu7BayjOjL&DHFkSMk@>p$+aXcaHU$GK}<BcclCEHiO
zi&MHVvb3q39zK&E4|7rR#2mf=L89N(9+|0=i~^WxC#_<BK`%q_<ueObdl?m*X#brw
ze1_N9e=6`hPb`H5OY)9VnDq)iU9htE37V@_G+V4Jy6LeVU}Fb3BCNP>qIQZ`w++QE
zn3EhA>^fYaMMyjY<~s(go|0)Rnz@XwBkX{AO_lN7*?ijm)nN{p#pRAEgU2%1$Aa-n
zZ#+4O^Igd7vfGUjmyHmL_S+}hK&a?l-ddoyn~YZ=wv#_hxExQBk4wmgmpCJsl+H4r
z6KnZ8S<Jl0E_yqI1_pq}oo6d%?_90|ep{GWvw&geWi|7sxw7rR>|O4r>GOj9B#5bC
zbD5H+OUd&LrxixKokte>nRp|%eNjA7(9t}o#tK9j#0wt6X=t&9*x29KF{*MD-nvlE
zPzxar)-auz0PM9S<7aAN6|J$Eizl-kK}p&(7e4UOP4(J;X${VrKe~0~^>dYjf>(AR
zgk~1LAE4T0z-pJQ<E5q-1byKLS$S$v6(`(T#Uo%}*ne?Ou1++w*j7$8v$PFa(!4_%
z=^A9qDAf(!aMM1w$pR<tN*zzLkBuyWkK9WY%SHNLG3W0VvWWLz_Flq8vV4~A`>ivr
zb+#*e$*pl!JQz2`IIz*cs`(*v(<Ipi$T#*z`O2bYT(roj^n?>Ze%nOO!jvhfR7XYy
zT{FUzh<F-Bcr8QMOye;LoxpftD#l8=-BbjdY%)k+0xv6NVZ%yyCUx08`;K*;ba-?M
z_+GG-=X=wQ3SZ$xxbHde@#FQv+YRS)V*$ilHIj^Kz`rcxVd^W>7L3J<=@;wt)>r1u
z682(~3`V?jT1;=>04J$}Xq6UfSpoU{C3>W(X7Q!8AVokcEpfh{PB)io0c&?#UJM|q
z;;mij(8>kF-#l>YutK>XqU8|yx><#yT!bT|l@>gz&=`WPyb-`+`cYcyI9U&;UYvGN
zrnnf{y7R5f@z9UpoZ7(mt^<7a>&QF8BMc;2@D3j1ruV%fhOig|FcQ$kIxT*ecy}?c
zM?WdsJ*rGGsO(lYmx8}hIBOpl5wD`>v~Cy6WR(<Auu{y>FWd7~bmd1>U8ZOibb;cP
z&_!s^w)onsv>*fKV&xwa(OE7+)@!A6v<g>gtZdn{Ws4Wq*J}0B)kj;3I9AyU_-8dK
zLXzVC^g6)edXL=oDmf#4d=Xip>$cLDimLhwaX8Wf(!e>w3tsZb;hZRbd3@F^*_2D*
zrV54*t+w7T;$;z$EPmOI(rAUAH>rPM$HShn_j79kPm#<DCi@p?t~vJd9Qdj|A1#N4
z6?>z^KUjR(jlAnZufq9NgtiAo1y0bUwmqlzsc=z2j0RbyoHTeEy|2*Rrc(4$i~&nX
zk}ir;O=*FPW%RDJKnp#5LlozI#V}oW0lMO=mxY)N1fXE;`6ch6;`d4z>0vg*D#Z%V
zO{)|_%TJc_<xWtr-&}OlJo?Lc_M+qzvP=1g)=tp^_Ck!Yx@fMHdLaVEn!rDJ8F(}?
zC6ms!cTW2CCCEL*<lhz-wA^XE)E7lCp`-m}h+ZPTVi!p=EtZWOXFy+xyoXwODceV?
zyrj4SZY)&TR6A{V3I!M~ZFQW0gKnAlY93CZ82OMC9VOvAjPp*{7hYyE3CCscv3{?#
zcJW)PTYNn0x5bhMwO`nRd0X59_EOBeU<)N2F4R4lCZTs5Q5Mmnmsqo$ZNlms_-h=w
zpmskghk`0s&VaRM@v7N5@i$V?_Eiaz4w@;@0Y7v?%m#Z4w7o}8%Ei1&6Yng>Wx}Sp
z{q>$N`YO1%kE3L^2n#tLMX3OG?M^`%*j-5Ps+Q4?mA;~s5S!_!pEDem7igz1IM5o&
z4JDLb7sLQM$$C{%6oxNlxnJP9-wA2;5^v1kN)^2H&x(&!2msa7Srn%0CB^tDJj9DC
zwEU_nB+Zmk8uO6K>K2qc2JAwnrc!wnH!2m(6*?_|RIXrud0V;c<-BMCj^is>XWV=n
zsG}}eCOL8;fOU^;puPKuq9NR>*a(!{q5$NclK$gO<tFJTn+t3G?sScR&hY-}3QqG;
z6u&Dt7=Y@yr3*P8DuglYG1T(rQWVCyP^VF$9J4i)1>R57l11T5#C?2MGSstM8HAsa
zG?OV3=U$Rb021Ac+f`J=M{<c*(fgz8aJiWb9LFipi#h4%3K$|&<Vfyat5C96cGAFX
zlQPjlCRG^BcvQHaMemL!Fk<05=)CBiFrkI-3nVS8YSHVLCA}61X~&#crLY>jD|+P!
zXN3)H6ye-LegV!dgL;bS?Z*DNSWzjI?FySfX}R!ak*uvM7QGWDrLf%+CZ<K#X*y3;
z!L}%U-*r=Bah@tad$O!r)G5$hUZoU9v`WbWT+9}0&x`oaY{`;+ku6#*s-GlFFTT)G
zave{{uOdL<VdR$yTJK}xF{z|iFbB2?yC^K6)(B}kI=^{&K6r-*e?+&bMI~OKhX5i~
zq51+#wJ;z0hBD9>y)S0L?NTKdMs~4cp~x;(#<SSvF3Sq)5J*J_Ch3?<OPIGWqY`~k
zu9SDD=Zlrd*SWH#l6<ao>1CPdfe={=lsp$uJ5H}lxF?H+vvQsloW-Zz%Yva4yy3W&
zMRojdEZM7rH+m(C71WcZUCc68h0UOX1p*(G#pHl|*U&}dI<M43xA{dpLvIw$+3A9L
zlJYXgz_2e9zd}eCf&;KnYYK&mo)_JN(y&<YMfG68ikSk<Bd;NZ$<|iX%5fB0nI4<S
z#wTf1EHB%6A-NP?_#d4Xb>Od1R5~9zuvkA(7&y)^zQg{Z9n(``%1SAi#3L)+&qr`x
za_7a`5FNaws6;LZL6IPm4V6}Qs2QJb|C(!4$>P^Jv-aYm#`(0kjP{e-RD`*e51;+V
zzd!$qk3=0LkB`Uca`gBrO0L87dT>qYy7op7(8oT;PyF_4{Cn`-H~aQq_#A%o?ZMao
zaq#uQ;kVy>^WEWBQ10Nn{ey4*BiMg{zBhi>NXLWVKh{HFuh%8zHoX5|`gu%->_^Gs
zc1cNbYomH_xPS1~F8uR#Be;#{e~)jXdGNjZ_Mca?FrMy>lG$@_O{jDhu2um^r1Q}<
zo=k%8XYl(!ucG-?lv2GtZ^du0%WoS&FPy#$$ql#{&L{CS2J#(zAHtEcjDE9vr&gM1
zGK;Mk*K=c>515VCc560`6c=F({hF+oBX*!0#&gPelq_dygS{{?Rw28=i`TL~ZyIc=
zjwanJH0W10>&6Ad<d)AwOPfV29V9k8G%}T!F^w<)Ai3$WPZdWvA7W<Nkp>v%I3BUH
z4t&T0RHcBjyA_8;GbZSCG!0R~wO23@4545kq6Px<9IqwXW@aoh1{u-4#v;izrKNE)
zS{sKtsP`DwLlVKDZFd|_Qv-M%<I<jnn%sF5ONdAlHi$jR=81Vq(8rh{Xhuv;B+JzH
zc2{6d(5yDWuz*k-MleI?9|jH79>dTu?g8b_A~2-MWOajUZ($RBbU>HIGM2EIEA)g$
ztV&ZEKKc2*YWIR(=cNCp*=+^z{i56Xp^fo&U;G3wTftH1;-_x=<*R=1s&jhW>h=N*
z3wYEy?|0iTF8dvLu+{8A%`Ms~@UD6OQ_%YHqTA~Af=)MRpIw}`p*`rJ+dS{LTfIim
zJ_pwBm~xdv8|b+hoVL%}eJIxNG_YTCZq3yUIw!$dtBZ-3`^^{a({}$S>hh%BKgaG)
zpuc8t(d_oyN0+C~Zg6qgz3B9)HJsmZyLWWjY@fA`_h1arZ$K%TgWjv=>1k%Voj2#L
zE>6InD>n23lfN}zoVK_-nC)@9+dAsww9L0703r<X6iCfQ>!^)iT0gd6M$PU|4QQ6A
zQ|G+b`ahRY4&DdH&9ml9m}6}NbYO*!F1xKW9C+u1+)6KB^!n}oWxo}?>~xL^?7dd^
zhxSpc_cS=|^aya5y;cJ{={K=^Yz3eOui^WP%U&DdM?gOZ{;7LODL?D5=5GK(0D~q*
z^&?n!&S}m7tWNhQY!`t+OVJ44ylTO7So3q4UccK!aP$CxM}4~_^a}9oTayjWTQ5)B
zFI(qFEqvR-hTgP$tvWAWyN6}k-1(a(^n8iar$vLY@mC9%8?>}R`y^-{|Io(4Gpw*Y
zphT}N=mYh7mq)Jz`s@nD(WW>uLl_)=`6celBiy?x=(B7<jJ7!*;{N<qoU$e6CK<z{
z=!PCy>y?DA4X#(KMf&9N<15&#>meR6kJX9y7+ZQgoF>D^<F60D+5bxMNjY9=vEV`e
zA%>%G4U~LqG7Cq`B;C8-vL0rtIq$~NaD7FUoacCkUhiE$hqlMj1U-t52i>4{Hn?a9
zkAs6h?(gl_^{ejStodKCP~U#_-5(FW`fhLEe$zguH{X2w-8YAOUmbjXXkIn}vx1r`
z^H{ZG8g3mOA!^sszb{v{gT4J=7m8D@9r{zRo3clpv!J%W_YDT}q-u3oyvL7&{~Rvk
zXhIPH*6BK&1{dweFn-Q>2&cRRZX1(&B{*)q9P~SbZu1!ZPWFH^{Q8@(4*zuc&B34k
z^fi3>=DTnIbokY`f7<`<+dqE&$3K4i)b67Nt9-qk27h0ND|E{nk+XEL49D?0C6}r<
zFMGRx{MzlZ1vKgv_SnAc4cg}zff{M+GX&@1cYpeB@0)M;|M(5`<W@uC*MyCOUQST>
zaDV@+@4h?ycJHh2o)#5^E%PkcbxMAQanfL*F<LlAs>(RJ8o;P)@-qbCEcl0sMSBG>
z26T8DeDGI?ssm`ExcXyNU2iWtG!umhfI~W2Qb4CfCz;`>va4tj)P{J1E|ze#k*I2g
zEBI58M&S|zfh?mi7$z7PSHi%_Li~LlX|I!YJYW5BfYG05i?pPt9(0nvxb0Gfnw}PL
zl!F=i*a7b*52xYE4w7M)kpQ1E@566dFr{dYIEQC}WCRhnCa3E6&iXoOCGBE6u<%dy
zD{NLd9I_`6b+n6x&}Z!|e2Y=kmogQ~l*Id;;5|#2k3uM7Xh#m|LtvuDFz_11*y7r&
z1h|bc`+6@D%tW@w9?DN7h@%s90DZoJ@mTU;cT^N4B&!P`n(t$Yb}+mp-^KMxWm-T^
zD@3<s6>AGvxOg0g^HeoOyfDRA!nDa_U<-$9c|>t`u@&I7Bx2q?x!JS*6QNe{Joxro
zjI)T}zYli5{nqs(ix#`P2Fj)qP!Ut<kFeBsQ4>A(WQok+Dv=D(1U+X6v`XIx2lWhM
z=y%Tnd-O|%NP<`R)DyRIn5@|s8FqkLRA*z{2I+OUh%m2Aq|krwI(Qi+J$z1EiW*6O
z-v0#%uY5oJMaAcw#q)T!o^jl_@I8G;*F9PT3Q0kDE%gqpHohuvLza=wQ1(cth@-&%
z3v+E2nr3y4+P0;f!J}YGc9{)<!h4x!oT?bn$qfa}s8M)2im^>XPBgxXSau3Wt2M>D
z7^04nqLM-%H**mj9HAn-g2lDcar`wGv+{AEKRS%1`|;F~)`Gugiaz#y%NEMjQH|l7
z8m>@-h?d=!^*G;}T}QX&l=BYDGZyFVUrk#EG!|?gXQARWmU+vKodYHSlFWlw5ePR6
ziUh}>Ua~HD69mmAq9r>r;?Yfk$=M5D_Qea?OfQo6HMK#49YQR95bQ8=I}wxABRAB5
zIyux{!MMKI)b8{5x3JgTLW1f}nFF`XbwmiPOIXY)pt(GxKn0k%w%sLph_YP-e^zx?
zdvZ8Fv7YR4%a0H1PJcJ?7^L7&&>b~Qy-{}#7XyF*o?^NRF_5qD7cx9Q10`d28v&4W
zD}z<Cuv+4t{S7@HCBOm*N2J!{OFf=?eM3*fWVHej;UhZR&3C4P;BqKH(dm$iL2Ut~
zY^lQfYmN2h)Ldft2#N;^NSr3<={vek;!$Kp1)+FOL^**{KL!d-6MKwDo)r*8bu%#C
zU|e>Ey59$w6!HL5LGs|uvGUAY_s?c;?B)Ua#Qzo+)M@>&LhE0aw*F;F>j%HsGu$=k
z>6H4)DfMNxl*b`|w5Dhrp-LBpXLTCXMiB+)`ZD-qot1xdP6=-{O5Ra?U}npZyQM6M
z6Hz*uGz>cUE8#}z>A$CfmN<Mw8opyz5i3ulJ)S0_0#rob5oVZGgL*zqoW+Y<Y8phK
zKYpF1qKazjW^g71ewtK+AV*)Hy5*=lrX|js7bqX#7@Vi)NHB(|Z=0)c&U+juf!v{Y
zfck?eYGW}#1b@LN;Yyx_E0?oRpQ<qVxx+(_454{)JaBF4#n4r~ORV?dD)(L;1~RzZ
z`$PM^r#>c$f7oLQFqv0GNhus|mr-GCsLPb%^BQ6!>?tJyf1=0~FvZRp(g=P<B{6E&
zxf2y}1T!_G#;tk&QgS&pkfdQjQXkaR>GFRMVIS4>(e{52>l7G=8`0x*We=_7k&Q@n
zQ3bvmCCj-90%Bxf3j!KUmCr>jZs3O};5jLGd=GJYzC(P+`&7`+9q*3kbQd%s42KDo
zO3Y4c4TUXrcVp1~H3<2%+iQ=k?fyt_cNv}PY>xL81w|Vgb9ILe8f@bc)^%Ibl%Pg0
z8;>+WaLXM>)T7m*>5nTSxu~0{JVz??pVn0X_DAz%eRZv(WlZB4QYW2M;2lL@!FDt*
z_mUYUFy`p7IpGbj6yPT%&jGPT$KKE<d&uICQk;zSNGNX}MYHBHHB`*6dA1c|B!FY5
zBNYDLKx6PH!oXlDu*pl3sa8qCLy^5;jZ#bc>V%5mAC67GXLAqZXoSZ@G!Xe#m;@t$
z+r*hh)!;!jXfO>LnJhr*%9%r?Vd(#!wD^er)}P+D85z+d`g{Loct(%#&;1)gfIuTR
z>^|ZsF3i?D7TQ+xY#Z~4pt7e$ayUfXSUBIigrlBY&4Z^O)jxsL>OY?UGx|sH@9F0_
zYeU2S3Ektu+1<zUkL=zGF2>~hIk4l89=XM{I<M4LdOaKgwp!argiCS1fDl{reT->0
z`932<n^MC?uQB|4n&uR80HkNgQ~bkOK%&w%I>H(VXO@i@_VO>SZl{)^5Z1&B%M5NJ
zXZIHu%#eu>WkUto?YUwCHw`sQ3k%C+M^IcaGbi6rZG=}~P3D`%S{Yas3f^O=2CSQh
zS^-$zb*&736?_i=748`K1`q-x3dwWb5``gjgdr(GoW?Ut98!6bMB0K)CMWYr{QjFm
zlDK5EHmC8`oF7RVqO4e^K!x`&-+nz<1$3dq<J`mVB1hxX@4tT*)V?_cDVyFBX+w73
z85P&b%F&vE=P>Wr6oDVG>k92(gHgO3O>HheS<avykpf}kJp|jxNe5&58p!^Y%nzM+
zhbBOtDbGP^=?|3PU-)O;2qY*ZmBJ`xMj>>d%u1=M{SL=d*YyrF^$x9ihnaf%-I`L2
z&1*GoV3!Ags$vE0ce(^Mv&+M<OQ`Fvy?wli_1|so*r*+1dnDnkp~f1d7u11C&pYbJ
zA^muV|4G&pOFwHZPkYjyyVrK_5A;gh9yFXy<^8B?ho+kO%E({6l^um#YW?*CBSP88
zg@c7rQt!74q)2y6z2`EBtXkR8CT#)^Yhk<)vH-Aon)Y1p1Ex|~$&5-D*#%fb^{h8_
zT@i)<TBD?-BE*Iw!qXKfUmd-V)7@~&p`%f&8e-J&h7rJ2iyT9j?;=BCDk2GeuMN)}
zJptuHN>je`OqO)ZFqLS$N)Bf;Koa0_M55EDMA!JVA=j+#nDsD~4HuOi%o<XEFni*b
z!!iu9;E6p>b?ckFrxFB9DWO#z!$?mydq0w08r5CRzA?aIIX4#8gS+n0V8b@ep^_oY
zgAE%{@Q9$4x%eRUZME9?_rTh|PRGv`Kwz!;0@;42fb-a4KC{uP?@LQ;D)Fzd|IOKd
z(*q8@xp)0AeU#dNAMPK1b@*+@{u}L+{%!yL&-nZyp3E_~qMi5Ul`#o(o?7N;>23O$
z6vJqfW<6ewfehuJC1kqhNo|R7o1r64Es<CW+&F!jia?uYD=J$+PECzgPivK1g~MvI
z0O^}Y=XJ2}eSsN*4misEMLQ5JYjHbJ=!aH!a3FQWOGlAz%bmt}@}wr~A!gSQONxS`
zWNx8~lg|DcrR%X+S*ttV`Fb{l6T?pBAO(Z;c0RgZCUYP_Dsy7NTu|$c%;2le@c<^(
zYj@6ruQVtyi&iQLci2cTEo!LSY90r*gYUn$%@MQN?5V&(T})*3<OdQcG>G1>mZ9{j
zZq2qaz1g--q0Ywt6r*^RtVh?%I_b1~`S|qYQmq2!Tp)%afu=E+QxQ&Fw9W^wTR#oX
zJN*vYoYDxtt$*e%ecJBz2d{9Zeng`8{bu`APy^@0o296K=$e+Gb#~GJsi0L=1}%2a
zUqaJmg>VSLVQG<9&E6|m<kGHM{ow1;5`V!W-;@^NpTW1ACe>=51>XryET)?v)@@y!
z{xrBee|_G0a~|yap}~a&V1B4_5!m{jZUIQS1R7tzY;_A@%4N_P{-*+vatR7I{xzq2
zNz&CKF<I)_Osa6c7oA@JqI2Fl=3WM;Et)maKnglpRPnqsX#IH6?zU9%9yvqOg|^<@
zh28$8d3-$h@ki!)O7=CCJGaUml$3-2TE|lEu%z7O#c>l&>#^KdW&L(8biZGhlzZ7X
z<NKzh+^JRWTP9PeEU5r4+*2@|^OkUlew^b{KWf&w1g=!{N4IDJXsPJYNxOA=+zZN~
zOGR5h0*&bDRto^kt#&TY`vY{uP%!2kryPP-aygbJYSv{lYNnYemh^)(`g<k;v#R>k
z>a;l?V|uRAwP2DmAcVW@ciQ?~GDEk6r&MhZ&aW=n0k?iUI=$=x4^Xy#*-BmX+34vL
zFgFwoQn^!gC_vX>eis+r&W~ygq;6w}>VVv%p9C0%K&5%*G*EQAFNwNMg1aGEsYt4H
z%O|^5-?Q_4t2A4f%TBVbi}b5nq?A>sYmmi9%XqOWn#586$HB>I^JQ;vdfBwrrmz#r
z|0N0EFni}b4cSJ0V+UuKr~S4CbL=9Xi>yYTB(pG;#3376YN8Xf+FRbH(kUiy+t^a?
zv?-|bmA4^`SGG&Z;%ek4fr*f#kU@cI98^ak=7g9|>zjK--mG(e`jgtjzD~`GjySp#
zrIp>>Hf{w4m~Zk;V>YB_=Ol>cC})m0w}*v={QBDJ9>1vG78b^~zVo+r7QUCnl6WLm
zz<?jmT4(5Bg>C+k+B8j2`eN1-VcTdB@GfR7T_n?ZbjufA=w3LcP&u3hc4M!tAJ9t+
zd;C*fv(1!Fa7`Od<>efK;6&zOa{oWmBSVT(NKi~i9dz5ljl!GpRO`tOzxl%M=v^33
z$>7cDQg>Iar@@<M_Z)dM>hU1A{V^{mWfdlS1=gH#>~Ko{8_(ZX=m$Bk_K{{J4h~%a
z3O$7FHBCaAhq#TBjS=D@W=%YPQK6^PPV-pL#_VbtGa<x0p<%P*Dqf~A;c1{D2&a-0
zLq9R+AY?^RFXCLrvfH(Vd+C%1ZGiImY5TlorE^~0Bub!LQhG<&=kdF!!6qjRW%jql
zWb~wDTvdlMcG>GUPvwOBItK(I-M4}+5|Pfh@iH_>xT|4{*j699>71Xp0RIsu@{bYZ
zr~!!5N<>hP)2dE`6}t7x8SIjxAW{z6IguT5ASB!{%Xc^U^t;XT-U)~ty610wU`oh`
zt6`0Rv%RJt*E=Hw_p2$QC>Zospe)`PB=CxD@l|eKPS91M!zRG>2YB$ReJb1Tk9v-C
zWD;6GwvISC=maQ9FkZ7;QoLN<21m_aP$RJ($UD-<dW9b8j2|4gyM3n22Y)Ks=NXQ|
zn&t?DhpEX{=o67h&+yP<Ulfl;VPn|q2`#-aNYM@FFNOg$6s1wAtYKOC(g2OJI8S&Z
zn6ASH?n_$qa4xR!oHt7+%cj&}8;5(`I{#_#;<R)0T4COyXkjqyp61_>IyBh#A6?)H
z>Bg)^!Nly)Bj$<{8iL^fKL3n;29ZEXDr3ngORj@#6p#Kpc4}DK<d`$h)&S+h0jW%P
z&T0(&^E+?-$Y<o?VO=R+C}@yq#Ap$8GzVCnFeQh&78=6wPxebnlTpl*rnH<mQfOfb
z*pKG|ECzsT5?`$)*W+TnTqM|%$@L3ZkVc%wmvwSzq<uRdaf?u<ee%;_hn{j0tm|U=
zoyxv${nWc?9w}i1WhR{9=34AV&%CeHYHg_XvUT3-wvU9%4W!o9hFYR#VU9LXwf=t_
zYLTLf8B!(VLajn%R(-Yl!fFOqtwKIZYLUi^xk{_nCdmIqb@rWI>$eTHSm$yqOromw
zep4-E^Q6|FbgdHIj)FWY&xCDLwF-GzgBydhcCV+HFRnEUYV0#gTN-%+w3mG^Ua3Tc
zJZ+(Bz-)xVV_2;@@JWUnQ{xqyMj{XDZF%R~JGKG)WlZ6>K>EQV$g!zWp|^i|x1xv?
z?o4$%Zm6F9ohsRvNTl=PUrQ&;0-|jungS9{F_BX%gB>n#t%OwkUP2MP?`YrqYqbhq
z(DwDd`AcCPwGI6*Ww#X#9ygWu9se>!uBniu$=*HTl&|SYXaR8#UAcgLMBfK>!6l9g
zk+x6}B*esw6hV<QH%5RXBq(zDp}E8wLY8J``*RO*ORzt)^jxl^JZ_z~@FJ#`3;VWH
zC!@}~a0YzAHsdgr#XJ!y(9e1=2XDHa^OxjAv1Pt?bXw%_Dn#6r{d=8E$Li+h22&db
zz!y>KO1i__@}uNMr`IO#vVDHiKIi+Sz5T~-2n>7CS}&WK^1HeMDa=IG(d104cpq6f
z(eutRG;~b*_pklxT`F?+Q?GS;vPr$mMOmk`LA^^wS!tw;7N~cr=*0<MKy6a*Qc+W~
zOodKG&pTMS^Mg_K_<2rN2N7S!`fxv}GUWzN;{|}o*1>n^XoPo`0+b?3Ho#ChwIAw$
z_ngD@2S$L?<mw9Xa2mafrl`G!ABD`sY3JoBFjc3phhAL1l!z@`<wapiFFHNg6Ts>X
z;e^~!9LWr@dRrV;YeQkBL)p3smnhe4(Ue}qE9(X|T)!Wnv)}-xc6EgwMT+d;8$3qo
zfhuO@<}SMYzWj0UqIJ^gwzPV!0L8In^8^=66%@)sXCe7tVT7>=^*pH6Tv1H0YYIFs
zxv^8Dq~_CA3dIySz{;2`G2Yy0CGni-B6AH?aW81229+Gw!r<Gl(O4B*;;Zxq5YthJ
zw0b3hhOR+q!}MLcTQg$ni^NFMPKD$6eXv?akqUr<6)fZSt3)&(5#8CL;|yKK4R7TM
z)o|`o^v#HECO}CF<VM5^!Ocp4bsQZhsII`rHuHeOVy&)}Y-qd|uUOoHVaPGW>D-G&
z;IreC_9-svc}LMX>jvUD0%2+ynYeh;DjtHovO$FBO3LDpJ-BS{rjjdr-0?j)&d!hF
zXS>5^P|q3)21r4CNuyOm6al1hK&A^Z-0e7<5UN&h;2}GWM=`rb>Y#!Oj*`5zkv+q;
zEyg&J^B+e6z-Bc*{X(_IXX5rflTM9WBVgYWFcg@HB{CE%QqZ}${HEDIdbI&MNFFIv
z+flne=(S&-H&2mwX`i$e`z<$lB!i+u*qlPyO$a3r`m8lfME#gnXImSJ2UU*C0vl;y
z?J~3!s2Aknci}Qdt#TpVA!$~tba9H^4&ozV!OK>WJqB00K)V(=IWUTu|E8bIoxu6>
z3P_dzrk~3wO|Sp1pUWJbw&@QIt-y?eOZHw}_K(qw!EZ?6%vrVPH>cpD%uoP}eg0Y%
z|E_GHz^B2CIv2qo%NmuP&+YwbGjIkM-Ofu2HF!|AEWJ0)3xM`P*^-dX_eJyQ_2ory
zP_`~`AiWlq+<{q}LB1dfJ_lb1O0Xl;7l}?#)RO69ywRit=~N7)JFz7yx$!2H&R%!N
z<ENGmAwMh(*<^E|PGuMi`b#|J${BkzV<`s0#sW22VH#{>m2GP2LvCyoY%DwKqt*MT
zp2x==uo+*f8I$c*Z718R&Ms5)HXiJZR__~mI7KnY;l>DHJtRmsxR;$VXVOy9&Dez{
z+XewEM^n1y!l;|T5X3a@nPtjboxT`L=mR$UZTLIAz_m#+iCeUxCyOXmZTtkJm222B
z<qZoJtJ>(P+<lcdDm%MsqY^cpK)#`6hgeo^zjwV}jWG~ZdE1J-R&7>LrqZ}ws$3Z`
zAnTqc6!E4MD2gywZTF1sgHGf5+e(AapA(fk;{9By6Z_n_BRXCzldC1(J5@qUec)8a
zpPO*8aU=2hbQj!t0pxGJX>F||t@6fK>1{S`eSHY#T7D{$7cz9nd9tar<9s_dCbx<V
zZ)<tb*xweKCSAVBQ8twP@XEH^FJRETm71LsspMx3yp?)CogZ1<`FRCz&DJ^Ur2Pz?
zw*u-apvKpJHp5$mxQ=i9>Iq#zVRL1msS1?=rhAa9^v!@$H7Wr~6|M*%RlE{#oO43m
z;1@Ff1=XN{sd=zrcy3i1<l%-v+H@5-)(vB`OOq6^X+%<?(oo#<NnQSL7*V#;$qCik
zG_FjwvhkS;$X*F|1=8vpr3@{T7<|>F@1ijlRICC)VWg^UMO7H~$wqLgvei&ZDgEf?
zY!gQD@5^&3z7e66p1i_9vS%%6^(qo5T?ehIHVrCQsWQIHu?p-{tJ$xF?5YOz)9-YP
z)C1lsNK2aCV~c<mZw^(5X7bf0ywj)n;6<l<z7g|G@#A)dHMh!V0qd`zxM(iEzlmxp
z*0ox3X0lY-j9-vRrnbQ>nn`v0{G`K|1HIm9nPxg${NnNj45<9-!L32IG@?o?xQoeF
z!La+Ujh#fLI+y3|AA8tSzwCY{Tgw<de<MB&5o-rl7<L-fpN`%j&1q{%i(q1^kxpA_
zI@t{ACcFiX5KX5j(sVeS-bzF*kk84g3~h?=#xK(sHbuOq=nSuu<ZVj#Z?=L}Ww&w?
z;MMATmNla_{BR1xNjbK^814ky;w87uSE+kCcK~!gSx-4Cax_P%+=T2_&AO9d8Br9x
zQKTbjX$6Y~5*%{cu%kQT11vF#vjE-;+H;06#_?`s8r35;_r9@G%}?Xs5LD3wd&Kdv
z5x6}NiWsUFkcP&$BRVK0#tGB@<B<*!M$x_(OVs~cqmjYLkhvvXY=BcTq`WlE7i|g*
z9<JhHJdIbkYE=Zwwqg2&20292o|R-}9@0GvI{m#%rtc!L^o?hn-sU>F!6;>7=oX4@
ztRd~sbo_Lf3}4uwQ#f?0oFgf)5FzdY^DT}z4~$wXbL9?|S)aFIV=3RrgA&D`MXoa1
zKNYx7WU{OhFSgu6X^aNOd1W9`Laj{9Y7?`xU?*4K(nLyq9(T|_)}5iv8!9`OKY#u0
zFHfDq?TdF`qg5jO{g#T@A)Bz1gKq~Iu6DU{>-CQ==xM&}c$ghfFPc(D>p+aJKlq{i
z!@*N)-Ms5iP|v^Imh!Linp;}NY6}n4k_n&+sO~I2#S=ul$IXu69m+rY+Q=ZZrUEKs
z)Xg64%#BT<rRkam;qGobLLi$RJIh4|XUlbjs&Zx0J_)BOJy1r?Hd^g)sp}+NSzr-2
z9OIt>ul1I-`TX2yTvYQkg$0V5;Std=#|JLLo*}Wby$;&PzFLQFtzLx5uP~36zpBOz
ze0?xTCX+P6;rlw|m)@F(PR$M%Oa$QLLpBJ4)ywUk489g^p)6XLwcy`OB;-`yMx@&Q
z|NaL0>JaZZZs#L=3nA8szkae#*%JeOz)&HFVEJ>dh4FB{p1F8O0K_}l5STGMT9rw|
z?g5`Dr>A*Rs-a$l24-3Owfsx(D1Iv~zoS+D|1Jjb^%YVNW%N2g8ut|EBx&ko6k^{B
z4X)?>J%<F+fCdjz5U#9wxa@k{U@ls6XDJHn7Vt}2_N&A$$z90*BisJ^x7@ke)CqUg
zenk`zV~hp-O6fH5@IV5(LJmk>GkNP2#J0$)U8<~M=DOzJOIc+p?WPt2xu^c7)N5@$
zyibDo!T#ab<QuemP(G<0<ighTw*UhVJ;<zH5jJJ-<jPto&~1^Hr!qG{*K@=FN05mQ
z^T8xu3O|hO0L(u)9tQM~3;1g>QayER@k3MXgCDd-t8D?lpq@9LlL^q&Vnc3;>m)`k
zh2<q}Vm=ntQK#E7W;SS<&i~9XlzKE+@r~vgCQP&q*G!sKvYH#m@8U5A`NKtsrxa5E
zvA4fwzuz5Po};1gXMZ42Pq4^f@bdifXfWVs`0<&#nz~RSTyZ+tXfUYN)^o&8Opl0l
zBM^+Lwj?!R3X{+Nz<-Jde$j28_fPIOaIRa6$L|}X`Kq3s0S03YSGC0waBtF3rS3MP
zOc!^W+EM51taGlWCS8ncYJPQ$pZ&RcI+_BD0*^NjiW|;O7g`|9g(mJaMSGa;%us7G
zNBkqVe@k)64uy=Dz!pYmc8wYHl12FUH96QT<w^+`wR)d3<0>wV0jb=dWu@6KB>$wW
z4w`{+7$@JuvYPFV`>U)hhD*!-E-QZ=Uqz|sNm-p2=&c)#MLSmXq7)YFUXs^D>Br?`
z&i~$2zMV1oR?kXDX`7K}(JAw;ayx}DN-+Q+k{N(JD#cQ|BEW*jAp91;DQ#mE&X3m1
zG+Fwemcm_`NN%v3%-6h3T|nXQr{>H<9hYNgc{CfJtmmV;?YreQt(1+svlA|_-ZiKp
z_%^DS8F3!RsYGR{)`z=2c7}HAxsf}*ip9-SfZJP4%w$C6U`H%MJ@b1T-Dc;s<MfMk
z0eRG1pP0FLIUaJC(R>7WQVJbxs29GAiW}nI$*!sl64+34{l4m;_&Z)zZ5$r7T0X+c
zEp;PIPVa9iOeRH3Q3QiD{tfuGd^cy&>=K;|xgTC}e+&L$G6~O(QfU3onEn<G%HQP4
zGLqrkZ7Nu=HG%UyKO6@@cc0`X1_OEfk*(%8#Zj`jEo>CUAZpn2Zk258(u?y<5c7+r
ziDw}ZvoNay%;a!AW53ldg;0UL?WZ?3l}UkHi<Sdrj*hvgZBn$JryP--OE1D()XQ;M
zlE|i;HWs>WfuLMO`y7M!lKI((DS<Pn6}_g$*$=F=O|&mPPUg`o^3YmBi$s9l$16<r
z!h~aZ%ihUqpy;SH*f?4|d-G&Oj(J1#VdD%&%P_qjEF-+GDQ%NZ<rmctLBJo>vO4dO
z54I5tgqwF8CxabB#Z2F(Dc?@Q`+V;k!sI)3kKBQHG03`WwFrlsA>1u&Ft;l!?a2Dm
zGFKNnYH@+4CTr1bpU4=xfqYQCrPN_YrO-LmTgp1C0yvuhf#|oltbO2MJhQ<Xe|d|V
zvn3ddq~Ix~j*DOdU%Vx(qh5R578TSJR^GTKn`O?8w{SS-6rw>5BKqwuZjKhbWq_~V
zQtG4tI=Hy?!%8C(3dis@6UWoSlBa(C;LBDYqiWZ1pVl!Swc80sy=X4t+LrxnEBFI%
z>zbU^JM~BQ``{0MAfu1E@=TqC>*-2d{n1NRLij9UIPZfRIyP=c?}1dJ%@D`|X!U**
zF2|{>zpEGOk1pDNH)worGyz59NY@h@ht>yZr9@iXWxwC`_X#hGH54+K%piqwxHMwW
zoKEq?62516OT)>w{IptI-6-VNghs8Fjo@AlyUiljTW#KZct@c#*EtY~p&lUqsnRlY
z2bq?E=8xA4#o`LPQEj9-sx5oLZA_8<`?Yw4IhYjZP=Qm*ou(p}2BX<{0)I1n)oMv5
zOLEeqN}Eng{Dmf4`Ug5jQ}(-iVS#oZZ_>U=E6)SF)`C{JAa3zqU~DT{7n*&sPH){M
zV$yb>cHdxpl;#p?k8e)*Ym~HcZ{pSUDKw7%6~N2r-7(VaJ@Hl9a~%&Ka0c9HL6f|i
z^XLX+ecY2CNK%4(Fq&kX1f26dQCWo-@UWScc1IpoP#F*5`!?v4dIvus1A9ub>mP2Q
zr*XQvSf}0=wE|-qdBG3(P^D8(P2V7rMFE$u2XV*FjAGn(@KhjIKwTNV?1z)tsuAq%
z?NvIPta_dy(BMEoT_x^d%(&6I>{cI%J1Ftq|H#(umiBhf6HT>}!}|NQZ)jjaFYWm%
zy2>gU?$MEVpXr7?d+k1*R7Od9)5H`Nt!ad=pViPJ9#<mho3|meCH%6&_ORK>ikNw~
zF`O)u*#n=JcOSqpB|t0aUb3TAI`Zx}_tNfZ;wnSim?`D;8kow-G6tFB&gfZjToo|H
z(`ZHh`(DGLtQB_{5GTmksm80^ZA2GzYhPje6dxq&^8T>#)kl!~(p9?u`jnh$0)W*L
z2&dx3{T<!;NGsu|DQsc|ct^{7iW$169>%DuP9JCK)kk(nXF)0D`)KH$ucy=EZa#Kt
zW{cJB$F=T3ZfYK+PiokAMn5!+c*S3=CzDF|8pHMEuIFM&=SP+C4f=hMi9R^V*n}Y^
z-F{^AKSax6xQeTsSf66;aC3c%X+0QEvO!HznfdtG&I&{mAMQPjyut|4PYiomeq0$o
zbLYNl8P%l%YI%n`oA1ZZuUd!pa(-;Dh9fKQ^COrt&$-ZCuaYxLiSxjFj^d#IGxP-|
z-789V@2OSMMQ8@@Vf7JrXX!tss^XZELHV_P(LLMbi@k?!lc528PW8+0sw{jl^L~8R
zEa=W!^SkL=3(3TCJ<n~dTz~WErXrRpGxfYSoU?X5<kFP3*)T)lNW&jD`sOhG6cZ?K
z_Fi-F^6F`{LR-)j@fZiPj3{ixfXv$H1_<3Vt2D0-f{N6G$HN|88s3*eZYERRa6V3E
zMOPH}TZ+E`WSZk~!79iAg+O}0ft+&S3BL}W!MH<reig4{{ljR_N6Vp~gxzZ-hKqq+
zOcn1xwjNclObKZ)s`roVx*N^z*fBwYlMddOnW2u+^r*KgxEQ(rgii2ExIHJ3QXl0@
zK8xq(dnh-3@Gw$e!}rlgApdFjKWH!ln$zfg*;qX5PUG@D4?h|-|MbCZCWIP0k2w9B
z@4h0pbRWGBu|o_Y{lMFS+Pzpt?><Glt@*f%2@N7Yg}-0xm?FEFF^na=cKQ)=2lnvt
zllIV4*`+u4Q6MI6aKIp=$oYCk7NM0)or(s@5<{i!cPAOPs6QuJ_C3KvOjaI7@)ix!
z9%zUUdOEp{<6h5P>uiL(C^B{)WZ~_BoM3C!NiZ8C4;Fbf2frq3<iWk!HFta^2>LPC
z?c53GNq^zfvwM-zx{&1>57d7l9&Dx)_cboVv~L$lN?y+0=<jO~Tpsco1DbEHp#2ha
zszp)>eK!h5nCp{+arvzcABHK=y`bGZ+2q|8^w+S1qutxc&BPbuj@YJb6hA=g7Z}1W
zy%wLA>K7uI{B#~o{mhp%cJJw0*;*e^{%j)HM9tV=hLcG=s@Lvq!grA*Q?X$7!tAcr
z$5tccf$UctqJklBc(lO;Rk{0Rx=`K~JLrTl;~)2ftZ5T?H8S4Ye0=aEXBj8DkL(^-
zHylOx90JJh1IKq}CxL^l^1wE&pm_y2USKm>?HKbSq|<yc1nzrAv^#n819aMqlaIBk
zmZV%Ir$Zto?#Do6b8y|+>h``94BthUa$tGDW)bhoD5h&<tV)w`T+-7=jK5br`a2K4
zc<hC}+;iluS-fg?PQ1f@&}*zBsO2x=Rrek&yRUPK>B(cT;hS#yDa;sY{fg#$?>idP
zYRTNJi<-MQ=j5U2x&2pth(@O}l1usgYzq7Mh;g4xlW^r7_5|NlA2k=x54xy>j~H`-
zwS^kEeK}uw_;#iIBuaa{_i;;WD%_ZDDq3y_kbA3mkcZifgv>H1GEOMA1u{P2A2}+|
zI-e$0ERZNMZdKY_Xgc~;<Li3WK^5~bo{?GW_2~yUXr>@au3W#aC_jW)UAj!;`F;74
z(-4!$-8RSLUWjI%nNB$(ioO(`a_Nt`|86c8(R^HLRam}X?rpK=y{E-c^PkB6Z}Sd)
z1tP^i&G?WTI6@!e%$1^QI`nopyyIMH^u=;KP{(%XzT80(In8$mtUc;t{srA>3G2ZX
zlV|aC8gtaev@ZF@?}hdpbO85!5m%*R+srWXh#QfFu6jRu=jkDMJzebX4Kyk`-WB%N
znvZ*^(43E=g5K_k>J&MxKsN)g9#U<Jt__84Hu8h2G?fAg5?jcbl-!|NkMS9{2sFUg
zqT)Vm^C$RD23L1-w)b}{TA+VL*V(&D-K$@_@Q~B}g#CIMVC>@MJr<ZuM&`-KsJf)<
zyUqA+{rW+D98K?uRdDQsIP+0G-)DiVcbjROqCNWH?p)ax0K?|ml0`9aKH0dc4a*O@
zd!IM<7&3RoX5{1e{y3nTM^nS-Z65ZjhlgE&Dr33BP(BjqzNN=Y>oRC4J(0U3N%s9%
z0*J;mpSJ7Gyr=>}H9o<N?Nf~<XJGV6#^Ogyk#+vHd&4JieX332bEMz|ci#AT-lb3_
zgHa{H&vQEj4WMWdjqskv6}_B*d><RHhOWS2esct8-cIG=I|KP)b5|b)G-}$XK=;gL
zL&(36ABWEcvt%Ir<AM72sc4J4zN?D3yl<~WTGG1_P#<Ujmv<e3#}ei~7uA^n*B&*8
zDN#YCn+gTEzree(yOP0ERLY0ZqwAJmMxM=Ic{Db3Bm-x4EtKDRDK|3rtb4#w6dJ4L
zhTyrstvC)5%aZkKP%&!3Mia37@Vr;!pKO5Md#L=NJml_^4auV!UJujJG9E@w8r;oD
zPQ`+J)O31|UW*voG8oC1dyXwyopvubIcrUq>p?uOrXKWKnN{dx=i@rTiJTO5VwsOl
z)`Q71`uqK7QlXQbyYynUl?lb4>73s3yAB4lD>CA-A4)(+@@pL^Oz{@MRX{8^h2+qn
z=(9Qwai+_i2A0~X+p||K&2qN0Y@-aok|2`v^^AXHf*s%U!kcW5(Ec^;M&bBwrbiEE
ztLm&FjpJh+`|K`FYKz=CrC+gf{0^3uMGbY?pVB3n)(A%Q_oKTx#%tH)_5r%_Py}eF
z0uJPQ%fEgROy>7NQvaBWuCDGntk)RA{J}<+F$Hd7h>?4@gw$yfj@)!1AK7d>g>#gS
zzTSF)!R0eNhI3l#o0oJwq(}Fj3ZK}L=KCW+VvK-G+rrS&t@n#)8KdW0IOTNo95*@}
zHoEoWMXTFBYn}I-r`WMKgmku$PTcp^gPcVF<IkY`E!gFJSTM(2x}1mEe(h8mrbrYY
z>laeeexD)pAf6|ij=u{4iP+IU#0glAl-bTX3C2UZGz@|0P#5J0alh7`X3nB8T`wus
zNdAiD6L;9k#16k#cUho&=pp6C?uC;`j-7u-r^nHXoMy{Ae*ja0PufAQ@zX3$ejK9b
z+V3xKKdOr=bGV%6cGkzu!jifbJ3=f%nePKS=eSZ!HsRU5)%MiTtuvAh1G!7`wEJ=;
zo>8UuWpbQ7d#tn2MfZ0O^jZ}1h0C4NL%DgN>>}P)K3b(RAG-|~DRXIIfxcfwD^I?v
zj9u6)y~<>%y1$1b4emS{M-^4gvA%zZ7wX$A#71b`q#{F>+>X>z-5tT}@u`QHVi@;w
zzdv-#o@3FEpxF5yWpHsdM?I@O$`IB*_S&t{yMozhRT#4WiF@~?vyKHB=D4yV-e<9z
zEXu~?nUcv&^%4Ez=}+xdx_Gd=)?(exGMa_)9O&Pj$5W#3hk>2ls;sWZ)lERX@!ky<
zv#sAp*pt4bs2}5G_JSN-YZ=Ng#_Wh6Z854lc@@1sf_78210JUNUSypKN_o9Wva;SD
zJ84btM56tpk;N%?e74Z7GC|8DI|%bY7<&N8XbdGP5ZiDOv!fg%_GDcxj#-gJc8{*_
z%4|CcgY(&<<ixg1RZtsb^CJT1Wrbz9uUNl)fYIn&jQ1LY(^PYLl^!MQEH9W({#cP?
zs%lc79Yof^(?5bcg^$=g^Y)zGaH{v~<$r;HdYJL}Y<vHu1M&o5`6LU2c|)CEGKoZK
z>t)l0-k0zKb9^07$FHJrxf(|3@hF$Li)C`P1cv#(bT%gE7iwI^grvNu_iOKUJe?vK
ztoBCub+D**jQhMiVV7N|(U_wNcTuLSCTn^5i!(}dXLyU9;O>Tnl(^jQU||Z}FaKEq
zn{79n8weuTy>EX_L(QYpg2vqo{%~|p8}a6PbqzcUMNnpTh0-b<o#y6M7A?fERE_MK
zSm|MN{JzpN+uX3u8~c#+DVa<GaR0TlIF3SV9!(U&lQb&5rpPDWeXx6A?)L}|IMyE(
zDFN;gRA?vP8J`N(i~{m8?E?5VQcfG|*#Ix)?<z{=$HXxlWoYQV_khYh#Z(sLKK2_y
zoAkDK<EgV~hRx)o5oI%=-^uC6vpl|DbHz$W;A!;U-mTnr?>bqd0d3af!c8^(5gqWA
zch0dZGcngJ?PF{N>|S$DPNlt;m?o&iy!txU>ad+QJ10yVYPjQT^zXB0!Dair4|L$H
z`6K5!?qA1gfd8M5rt2~E8e=f{2>zt;I0`WMCpU}{)1l=(yd+Lnz*LNAo=&IpcvbaO
z!nzyNs17dAFMF-yr=P4tPD0LG=qg&lW8AW^nSy7MCwgb6j=1*o{x7*)){<Hmi}H#W
zB-zEx>-L(~ot~swYvwAuHShi6_mY6PxBz83E`F`@D;JmOaU$Z9AvmdkOB%{%+bu5I
zRyQIlEpBm9E7NV+EVG$wE0pDs5)}$MNwq4J=X6pP3YyGTRfcOaRc$DpNjz0$hPH2c
zh4M$$fl<ArooJ~-@l4{Rir}s^JDu92LSZonu85l(OS_qo%Ql;2Ixa4vaut{CY?V~F
zxX5eC5?oxu&iPwhN+<E%P$Vg%M7fkmn~QD)xF-$K=E6FAP&wh=@Y+hQTTb7rAY?A_
zY=xp5RyLbuwn9lKHEf0QCY{fw^T(HYr&^smG+hC)3X-qht&clby7Nq`U}!!iXgL~g
z9E4s?%&u9&^O!7H<z$m(-3n!N>Z#(gCZ|$y8IvPv(;QK%*i;4+6>TIXD#K9ei6B{U
zN?EUsWt==crA<{S=48z&fjZ~ADQQRNt0^v{^3Rl)kkl~cg*Zn`c^OQmvY~{|dQx64
zpT(rSd@j#OrRH_=jVg^-EbPmiQK1HTvsWlbp5_(GS*a<CORH29<t1Kj+Od-AVN)5o
zN7+=&jcQT7^d|l%pL^gg#n~gWYK@9hb)xTAD_lBke^~oc7L}vam(o5RUA{soCpvt2
zc{}2H$%*HQU|w9>L@3{Mc<ZR*#RbLi#SZaZrLYr_yGjKW8oOfIO%0p4)fE&DDiC!^
z(OfL)lCpOA=Mr(nj@?||TCYl58w*(himMdbD9u{|fU6YR*q#-Tx4ga0VwMh(Ti(#7
zGMTWo<&9Mn0DW;<H_SF4Yqq$83V>bKWO;{IoA-^1Sz6LeHqz)OKGum8TE;b6F+5Ao
zYZGg8Q^zV~OC>7J0VYd}y0Iv$7G*M2PF9?VkR=?mH{N4~@)cy)d}zgu2MmTWESCy5
z6wv_+Hx$8ubmc{Kbij=*RcmNNsh68aRL)cCxN{qeY$%b5+;)e;mCKg0oxTuecPYK0
zFh>C^FT>%wHn&runGHoY6BH+0RT-_zgmWrkcHA&b<pncgl*$V`VURWszz%6tt?=fH
z08gZ#YK1G%Gk+kSQlf2zso9|Hs#4GsZssn9%h0DVSj%0iRN+sH0-RKlrc`395?RJg
zQ&ln!e_)eR?jIw8ln%4JfQ0!dZ=tk6K8(gD5yT29QQEIR^g~JO*{}^&imJd2Rm!U9
z3gu-tye^-ECv3nb2CO(TK$&QncmA(HGnA`+Y0<oA{?pGYx!aeune+cF9YV2RYB|BX
zOL@Q7=pD){FVH(w5vR^do3W&n>y2NAB|azm3gt6S@zr;^?crX%mbj*u=$?$L`3Be(
zdW_$_UTc%3h{u1Y(%F!4FD<U)^N}rus@HwB;>;Zn)y*tnfx~GTz;bS&8;)n!E3;~0
z_Es#X6L%<XyD63l^2&9voV02;ztUp1(_NKmZ;(wh?s63hYL~ZC{C7OYO7uY)kFWA`
zszNcp2UQul^m{p#EV|z(sd|NSsk*@Nr+S6W(tm;LOv$!DpO+20*Y#5=TXEa>q_~{x
zQ&Nf-SwE2y9hLC|*|e)I=ZkWBQK?|g=b}XXE;G$9IR;DpEbdxwLnW`x{szX^SlyQw
z%$ve*-tCrYdl_JjG5V%bdE@a-H7s-QO+}62cD0gBFqEY<)`%xT&9#(v?M;J6kAkxI
zHS$cVqu1AZId?htZdXR-a~TrT*BaU<lSwjKBa0z2SMxO4dHwXW4}KGG*3{Pq5n6Y{
zzkg=e@BQG3J3&?O4}+*N7@V}B)d74tZJ)!JdLsg&Qah;E>sBvk0LH<|<@wQ|cX@Hq
z>GoU4HTGqoKf&kEg7eGMQ>+qA(?}VT&#%%TnNM#6Zf6`!l4Sr}L`=ui0Ie4q!8}<7
z(R-Gzf>om4eirPA6*{^Qtk5nUQ=^f=xo7_3YOqX(zkVhQ9KbMa;2m|kEvoH(`wCzE
z$G<-nKT8DtZn_GG)97)!96kPRMkm7F^~3eC51((p{TlxseD}@1{TII;9(?uPe;j;$
zaQN*v-+XuY6_h*p=9~S){|NRUZV1JnH7Z1c;6K(w;91rs<u<(kU;2UFBP$;4!mh=b
zf#D3<w;-7W^gP7<JR@cz2ycMjM1KoZbYKatTC2k@$BllJEN++a)%7Z<0aZEN-~ZF@
z;r_vXBj|<GcX&Mz!M8c=|9G)Tg6~5(WtY)!LAVO8W??)H#y~?x$?Q3{1;<iAZKXg#
zQ&h-|_oN%57f5#3r~nG!R1DTBI=2LAvR;lNdNPdXAq*La6^4?%fg?Nsx`ls1R>xLm
zWE;Rrq(*=fTSUuQyu$e|mdU#q{bp9zFgPT3lLTgZgR}|n^T<#orAo7C^+d)M<i?gF
zkYrHkO&rVs-|$2TVX)Y2I85H*D+M>8qVXtdaBBh6%PBO7?bsd9$C*(<ucK**64PGM
zP@qc-C~7D$)$tmJ=NXL}g$(LmqX~GTs;O}@T2pLFwQ`SPQ4%Py1Y82XB@U;lfj+Go
zwro#C&+j~nsUjA@qZdcTPEGT~Jf$UwS9na#xs7C*LT9(ZFhaB$Ygi`%oG9=zLPUWv
z%#s!Pl>>O7`WOcH4o^RL!H`Ik$%;0Fg;e-S7tshY3+l#*a!bUiIb&Cv$_%h@|5dve
z^g1W~H%&Ow;QK|l^F#Z%bsW6-30}5>qt3-o-S*2@{oqyS^tjdS1<mtgczWLNwqIQK
zJMdtu*@K!}v}531^Zciv_2Wgi)$0YFZqPovIBi3F&_TC(-fy>hji7xFEbwvr{ADA6
zHiGj`KR9ilwSgN5`ke;$i;d-L2Az}Otkpew1wWfF+NbUQPt@f}yMK<|oj`xh;G)^>
zw~sDQo892zvU}0#QENCqIHQkFo9(mK@g9r;`VCq?w9flM?^W~kG&9}KoAXu|C*aKW
z1+{hBZoW8ead$A=<94@o)W>O=Z$|(`RI~!&xo91=@k{H+7R;#G{iy-X60Pc-_geqw
z63W5*;JA6#d<k=`ZGaA}(9vbLg?e0o2e#9@e9`N-`<MMz@Uqi6Cb0Kf-5=UVt=`k%
zw9_NNUG`cH=%nAo?y(hs8oY+@FD`p+gdYL@ybs*w<wd{UIj_T-zX1pV44UXJN3iak
z)0_cVo$gQAE&_v=q7l4#)q>}+=I1iKez%F>=m7wa`gTd^72w&oCL5f$UY@pJw$6`Q
z__l)$y=nJabzZ!756iT<^EXZC`4Xp3iw0xkuNE#hXlaA?Nzgq0p^by*!q^(1M6WIA
z15bOGN3R6>xGf%&@_dfk^TFURXMh=<qrof9DcaAFJ>{D#<U7MTok{a38Vie>5-X`m
zJReu1Wy0AvQilT_4BkWWT3Uy1{Ka}DZ~l<d*c2OFgNYCNM?4%;T#fIv{UWGstwwx8
z?ry0r`bR2;?%=HXU!86}*xK{HY@fqRXjfb~gYU1B<O-NH)#Tpwa~e*rMf3+fKzS$I
zTJZc?@NGT#{dZ5D=fQ!Q!>i^Gt%1y=*ZxZ@IMA<zSr}mWf!d-TtVRR(iO3Frh|nY{
z*gB7HfI?dwgBm`ZJbz!q=|A2w9<R|f1K$5?m4o-!C<|UyqXfwLA_VHvA}=mqp0s~-
zmP7UZSbfn8;vWMp%ONg{zkghu174hh`p<*Ido9tgky@g4ifn$>l~VKCxKbdCUR<F3
zX@f_AV}a)GBhO(L_YV8M13MjdH83mFcsL5kT~o6a$nHf!O6muo0`U|X%K(@#IPrmZ
zfpcCMj37jUlpD|}T!cg5QCGKn>_|Nd=g2Ii5lOhycoeTd91c_HW;#{O-+4zha@oTJ
zirWHi1Yr)$7cfn8<fwziG+YT+ieWiXbpgD}Ei#jeg9zTvlbbn?H029Rs7`DTZVFE?
z(A)_6Kqgo-<<4rOV&f`Yj$tIJ?gWaeu`uaXl-Js1-i^0~K;L3&__@LY@BHhC@P8#W
zNX?)N95pYF09_E<%~MnzzUUpxbFSo215fkp?cQdjONs1zXKzBFTm9s)bueELrt-eX
zyyQ2oZ~onJIkN>-ixz6Xi3s1KITj=?mU-GS>Awte#*wIHU=aY_kq=#`$b0{n>|0!C
z#hI&Zjr=ag1;EWfY%0im>fKCir3s4M=XLlFTEvD}I-pH~Xel}^U}<+nNW>O!fQGrh
zj^`^mWsAr<VuyO6soqJq`Eu|ISfLEHJ8t0{4JvlS7ckc(98SuLY<V{-dADRY`I-*2
zp+oAp<yOnvvM%6tSugOqT1UTOka|<bwBX>4-HC}`%I~t%zEc$$q^jc|YjJfAq&s!0
zVRzSBA2nKnba7Qvn&UnEmQu6?Ck6y6?4`I_pJ+T_EeR`ZRd0$6M5{rP%m&vS6Rjoz
zuB=COnSMRrI7awgrm1Qe!&2C<WCte8K|G%%3W_^gdt>Gnj_}Mhzn2k)1EE_K8W4_B
z9s7gf)nG*?859SD>5=rV%PiK*E1<955ii)fVK9!DtJ@ldJz3EBJ!R8bxEKua!WI4<
zQ0}Z+K8;^tbp||BRR{WbPz`chOPvKaS+Q_qo(xtaw5TcBkEV>fne_=FM``wi$c|nQ
zS#^`cD|24h#pI0295(Lhl0Ad$!D;iPLBG}OJ17N<u&SB3P7=u23imV`t(SbgW%xm*
zinj!`e=Fku7kqO1|8O+j8$E0vrTYKFZ@%0A<}joG|N7g1>;L~bpT}Ok{lOpqt+M~O
z%KqOf`+uwK|E;qBx5~bX%3gFOTSWDjd)Hg`v+MBin{S<G-%m#K)s!`+>d^=jm*6AR
zf;@Z356<D`G#Q4|07DK&q~T~Dosuf-;krRcEW`J~4%&*PPmvw&lM)Ann+1|sjC0HM
z4G0(hz&i?{RO_W&M|?&PcaEb;xSmo_f~NsCBZFT?lW2)voLHY|EElA<_E=$-|FmF1
zZi9Jr6Ntq!l5wDgVVWkRI23c87}KvzfD9Kk)4c4zLMr>J1?)Z6CtVWMw2kwa{D(zt
z!0AmhkP*|A>2P9@VN9-Y%u`koEJJ;IVHH&It><Gop>RTz_zI;FQa{DhsHkUR3T~op
z;85_22**8zzEndXMKN+*nIoyFsdx@&XgH03Q*6itqxz#}*EWj6LnfS}_<UQ`5Dox1
zBv~MuX2fc2o;Vs~1uHy)=D12l&4d_%3rF1pO14NqL<2ZIk!dYcY7Bo6Zjp&vVM{Ux
zogPIuN7I2F6D(<R0<{zxD{2e*6##jdVznNbq%Lc9T5?`-czl{%J(c39(?^|T1hOUS
z7^lfq!;BiiLE6v+BbdTjy`lvz>YMeTSR03Y+Ifi_DjH7)dx&uoc9gcNyl9UDHh!aB
zE2fsrp<th5y@jp%Zba94^nMj%EBn+0x~A%0V_{0K!<5YAh7s@<u>H6?H;HrrhkFD|
zeU&V4+pB0MflRYePuZ-{NiXvBvkz36JCru!DE;{t7!kMfkFB@j>9ExZj?Rt;N6mig
zC7elv*R7v=7tN#AhlUhHtj!kcwwlMf0P;t<X5Mt+$kj#CXq7F{YxT`*vJ><bBD+Mp
zD56WY)M>kC3IJHIvjtu?d#_AqbQ7HG2@cuwm%7j}Ucn+~3%zLf&zcveD>$N-fSd6D
zT#r9pw7P(6@PA$WDoV1&UbZ^+xT0|88CR=$rVB0B!*o5&7P<fy=JJIu6pn#NWXm*<
z&)Vm@$Rx~z@uX>iF$F;&H<r`R8v`M9fbjtG#cAj0wGGNKMsivv>oi;PxOx7v)$LsN
zbWw98Wy=CLbPl{BuvNP7Y8lSc&|4Z9r}JLZEsh>Ui<NKXkGgGO*vyD==Qs90(77Y@
zHsRyx!&7^6A`wFejyrEmRngv%NF_jAVM?7WL0AbuG(y2?giHz(?MS3sejm~(jwAMs
z;^6s@Wwrzp;Ox4ClhfwQLF*h@ZnI^R$;5dNti4+Rh(8htrx0-YNF3}kFk4u$X|5c~
z80W21w=9#ReA&*~8L-Bt>^xZjIdqDhcP^SeQzCsEFLu)qkKW&+-9>ndho@7a*F10c
z+ka^dE}B1`cACe7-s`s6xOb{r4J}9=3(G-)@p|i_n(axVJZEam&aJc2zm0<0Q(aZE
ziZsV#G}6C`#-?0x+isX_pdD6Ac=rjXZVSZfThS+zQlCw|BTOf8g<6*hpYLLf9W79u
zqci|$7>Y;PH7Z?T*=_(g9b+1#y#rjmH=XYB;1r|^kQYG$U_wD^@SVd?!{xt<ra+)6
zLO<&{l&$(QVkS~C1+K-w!^;6^mCkphzX2sg&YFSAoRngo&}x3Zt4b&<0OS!!W6~!U
z7voOEDf8?wIb^ITpgXL>4KRMhS-=93`(hBn<JBr0y+tKU5+p-ZTd@s3b7Z8$87AwM
zXj@SDaMwExenmCYEP)-9EEOjey$9Az!3r}Cs!9shN<)G)jR!T2fq1F<);t8s(7Hi7
zTrcp~HwT9S-2nlkjxFIect}V(jY2$lV0O0!6H$n$8b`JZN@FvN1UN0^9*1yzjIM)O
zoGwu9&4SP}nvw{FU9dDu8B{TqVmu#57~}|Zd%#FXvxVGAh3ZyhsAA32&*6F!{tU;~
zNgJpfNK3c{FeE>2fnOT<dRX}SsX7w+TBo<VAplKT4@LSv_+AU^!I$&}I!_i6%RT@y
zIy+ds#(eP(AP8XpkWgw8zlTZI@ZMj6sxGi<Xl0-h&p^P8*|<QpL{LI=8xcHRIzgmJ
zYXEss8$p@?BHPQQ8beSMGOLAALYUS?;?yx;LCRXoF}sV<;i`xo-9#a5o(Yg@%7@x1
zGIWXzeMNrdXZRHXKrH-cYB|^%V|yj|YxW2dTT)~Kl9DwA3k5@p-jwdCxtiTT`p27?
z1W-&9i_2gMX?W{~fLJV%!5M)xI*OO0^$gmD^+;8FDZzh93nb8G)KvgN12lrmbGnjD
zCN)G$GN~D69}kVg(}7HR7R}%|qB@QJhTTG4iE1n%&2eD7QFPy?^3bU~tWp_XG_RD7
z-61dzT8xqfTE4`jaz@iAKr8^(DlypQ?h%8ASP5YjjqMSS7PmZI_}^4VF*YxT4fr3w
z(Bqr};Y~G4D6tudfR>GMtbz<i*~}x<YIqoT^d8Sv)G()dP<Uq5eq~Ye*Wi0+9pTBB
zUn;7DA41vRp9S>#=U;yb{x1`nUw@IAd{Cq2c%6KQFa%QZ_cc0uuo0W?TQx^0^nVFu
z94|I}PXcax!Y7;WSYsB64#Af(nz+FpLFI&^4BQrDKeGnF`M%Hc889@m&qK|Xsm+;6
z#-vujD6bbn&9Z4tM^kjY1u5LkKFWX-e&neCV=!91&(H*_kNnNgIkrW}G?$3p|D5A=
z>;gL@G#GpqZ0#Q$e)aV?-+uSUKZU~)@JL&NNvszgpgyVg2-A@~wI8n+V>p=TMZ=xk
zPTfq-V60RlO%~U}IVh|poFZyx@G3XG9CG0tf89AmnFS~FbFD^j`Sq7a`|nTo>(8Hm
zU6&bKrN2Bd<*nkX<Ods_U?E|7ai>D%Mh=|yr!E@NvgqTAeyB4{;ndNf^BRd@EK0O@
z;WRdUD&iAXYv9Rvgsz=@lXVlPjI{_NRHR%-qqhpR5Y4ja#f@NT{AQsR(qDOm4wd;S
zS>P2Q92pnW51PiP&Y9C@8&op)8#1ARQvyi~9W8p}C<+6>49C$Zo}qakS-UrYL5P9*
zA@*`T8<I|Mjxxhdv>b(Lq=}Phdpq2Q_Cb!nx(>D{+cte7REimuVnC(bG~uy}N(8nM
z)F70IEwn+1)ke?=_6Nt*2+k<zj*J8O`M!Dnr|r7ksvn95%^YMqQhv9eLh?9GZU7hG
zMN<+lD8SFBlPL~FTu}Fxn(Lw)Q#eG^fHZw6qWOFc=aX4hk}QC&87Jb63q{Pu1meV7
z5JMIqMMO&xpi+{SmH<ao{9!lAgl?IXLbwsQ65^a*q2f-M%S0G?kVaS2$f$XT>#LN_
zO974Xf)_=Eh%ap6Y}I;Pt#;;qM#LOM=_p)8sTP%#B%*1-z6KKmhxM-l8hg95*D>t#
z9=&pn{d@-qkyCkWZ38?lvxtxA9jDZ1Ed|6URt&$OL%_bxfaMT&-z9&<V~BcKbki(Y
zk&@XyR7c4Y;Iu$K1E!67C?t3YCrj4UOeApUqiX_(R$T#1Oo#%dl12sA3yOg1$?5qI
z?=j=mN&ouG9u5h~<9_bQL2!MJ(iYGpl(^`^qNo{h+V|3fvaU<XgedTBxbP})m@k^6
zI#1HavQcdLmM+GW;sLkT?sHw9HpOR(k*7N;BJC+0=s=#aR=ff>nlI9@aF5=+j&9}l
zL{Jt3@tolRd*f6zIibo;ro~co$|5Mk#*mW5X|$3F!R|!6N9P7A<vobonD5=x3?6IB
zfW>(iDeV%Di6SZLA>mxqU|<wviAm4$Lm00mwZ}(}V@C#Zyk7XnVSs{mz0PPj&<Su2
z$a9iZtIb&qrIq}vWEvH(6u+<5RbN!r@F`tu23K-@8;;}m!3xv2F<DewHgs-wmASpX
z8#d>=B8PI{OZt|!C4<vw(={Lxkq5bd1R(=K#P^ADD&2|{#A-y`EHrnzrYp=gi$5~F
z&N6&|63@pqnrV(vrP{g{Y<MURBJl}c;%d@I_ioICvrZFehi%snvd_-Cu0;3U=QOux
z7VqfvqKi?ccPN+Fc?Up%*-jxGO$U6zGLXA;T|H!t>mW6%S#?LKikMyfjMkq)SgTtF
z1V;<rD`mR(J#T*A<h)I4cAt$55pZi!9G>DzvP<1MuwzQ9@P67bHlFU?hUV6(GBUSD
zg@GwJ-(_IgI-3WUt>FwzbR!mGDXcQ863<J8_ONd_?p1}2)>t<vj*BC>uN93W!wStR
ziI*G-70@->?_C3@0f!P<Nx;FhrVL5&eQOfFjkaiuBH591ON==AdTN!hxP>&-7z@CW
zHqjP?z)Hr`5LwAEMV*J@-GqFhb}U&1R}pHDsasJvG9fh-bdPE&N`|elJ&m5u5+D(#
z${<m$KG+BWH4E!>4fDPAl0ca;6((;2Tgj_f<)6R(T4b0k&y!<m()ogtZPip=z25S>
z-q;!p5WM){$rt0nV5{+K-7qOUKve*Gamlr5mbIL^S*r;o)usUn^h44@JYPpvxjEUo
z!ZHR#th>=Hc^4HRod!msMTrJMW@I*k(t9Gu64FTeNA}PvB6zGOq1fdQA{WtWvjq;v
zDj_axcxw(veV*=RwX$kA5MC=BT++-<bul6>JkuRcNF$rN%**gVa*A2RL}uWS-lEq`
z|NL(i5t6sw3r2azK4)vq{k*v*9gDKK8B-9vu_gwv6Gyir@kwM)qR&{HDL443LkZp@
zAeCwquTe;DoJXmc?(DFMlw~|Nw)huqAC`q^b3VpEcpPjk&B7OffuZQ(i-8UXt_*gj
za~oba$g>C&!0Fr5#-nL0kh!^zVV<?xbS@_|n)B4~eO*V%vUMBOK(I4XrJ+MgcLNP%
z_TXsux!Qv3tl&b|4QQc8+_>1cDTBQ*y`7J)m&rU?r_)=!U2*r^jxeH#`gpSj6g14(
z+p)N}k{Ahl+4`^G;K7RtEgj<epn#4olSLf%isC(h7Y)C&4bWafAs(1jv`Qr7{+T81
zUnkS(3GmF@Pz)A1TYrWeHLzh3P#L~z!dYbP9Eo#YtXH||Q-^Z|m4j0=`}#<)m|BLw
zwzbR_aT_ARDYsrsFvuVZ`SfYb)|~_k!3zQw-G|-CZBlmZBMfMWGZ@E9Snuhr_6(<G
z&kdh232{haFoy^naEDpElG!jn{QI-u=(OEB?+=bnJH6JRdC~{=SS&K!`F#k`$;{K(
zgo46iS4|vVZB)-x^orLGSu`S7vao2h;Tkl#6;}*;y`3&c+s61cU7<;a5N<9oPFLGn
zwiZ7Spgrm?X|YU35#PJr;!e8`-{IAENH7<l2fV?MLDYu&o*b29wAAX%#9<60G2V%<
z$bb~dTiqdBI6dni7^6mvzrs{(s-;Lclqf#|q(I>rK<_iBfZM20DPT`)Fo=9_P7nFQ
zPR~wn*|M2Y$ekKh$uYrHA@|fqD`A?v)$8_fl;B5A(vRY^aIC`_+qfvr2e#~|&1@Ze
zTe<#nu3w$0SWVdb(sv(2f~xF9G(7CVkIVCZj-TAr58nOxcCG4C6qY5`Q9n<5%v>Y+
zW(Bfd8zn;bUyHfJ@*!lX3VuFppfgNUkj!Y-gS9a#rg5ZAz76LVY*U$SI$6}&i<H1B
z60g!|I`MKODae5}GA5>Gw3;b=k0n%kaSV7)L;%=mY@xPOr@uS(dLeg{yZ%zT-u7|B
z<y`5c9Nt=bq;1^MJf-a+9J#j6k#&;UJ@hly_=SmFI36#BPO?W|pl;9D&Lpp7hCZ~;
zQ=5XckCEpfRoR$SUR6i&2%DpkkbinS5j!X4r-ki6kv+fOpD*@cokvP0Fxop960r5l
z3G|vOO&gp3D#Rf2?A}G&idUl-e-Xns7%iFS11qYO=V*ebf9&9V?BCFttv>@?dj70v
z>(@P(Tht)zV5s<5(L~jH9UlEriXjA_1qZ0}`~G|C=Zm10E58%`vF<7g>{~Lr2F>3!
zDKs4NB`e~dT6$AR=_vh6bfCNvtTv#DeRFlIjNl4nwP2h?%+8KzkYw0rOiSs~!?sT%
zjDgdfY}-g-o80hy9j$))Hlt6)acM-cJQ2_xVots|Hi9(dVkLD{61F&mfq)RzU1K^m
zLhUIqXYnT*Uqyty8O%c(VX&{nzEm(wqa9-*OzNq|yfRz{6n;ci9uc|%r%4!Cw{E5^
zl<_I9gql1GsDaO|TL%&|zx+?6&k6a>=pz=ucZHOW<2R86qx^_zJ;Yc=U7RQzLE^8;
zfU3blL!?la;Dfh*hK`}jC_z68wkB&*uNyOEeHDqajvf~K=}0&4;!yec*lR-z6V6-Q
z^a(Y5l(pz}FChFY+9)6ey9fF-=!sP1-;n;Di1XeiQ-JNDwvT{6sPBCQy3Z41d`PHn
z*{1FVO}x{<&>}$u0_cdHk71=v2xzs7*<Xx}6y#PJcar7%LmS!N*(6v+nD_v?AX`PD
z7s@72*%i`i0zSNr7tSWbxvDr`gf`Bx-mAXL*Z_pa{)so7X~gM`dMw;~AnNJ<bFy5?
zmVFldx2`8enWe@zUPFFY8K+$Lrt#az57ByqXmLCTmMkRU40gM|-O`v#_zA3z;suz}
zYjZnIHZoV^2J_K`Y<WfA>kSnSi&`S$BJB*>)7)leDDWDPVcms@oX*H-CH8_I;h-}B
z6sR)FM{!<9^#t9<ksX|{nMM4|#BKFPyvN7`QVf{1trNVYrpP-|8A$0JN_DOMX<0sG
z*M{5|q)UVO_Klz#P#N}*XxBd5Y)2rE>IT6-r@B7QXKdw}1W_8rm@((%R8N&g4+U}~
z8=BhW_W)HRSIsw$q$yJKjSIAV;s!(!Q<R6`&S*9^!}uYbLR(pl-)yY+54j<6pn6OB
zPUe(XbJTvBkor7!NAr_wO(5mUWPTFXpo&0c-dSn5ttw?sEUK<m%hv0RDZwf!AM`qm
z<6@>#Y?w%`LY8Q3<gLVP5xr~4yiSM={C`ZpCzHBkRRLn#_Gen}iLyE|kycv>o+~>h
zg>_=ub~N@u=o;9F#*}Wg8fsq}Ca+<v2W2zTE>y2+{1WX1hR*>@lEs=m4s3DFu|34_
z>uRsaj<oL*vggnap2yiolgY+A8Skd9fA*<&GD{~3YSwX>My>k)f$i<xkml$w+LZOY
zo}~s5s(<;VyH6?Rm!~A`47=#ZY)<!fSR1I=_S<=Llnkp0lcililuY^8;O&t>RZBk&
z+mT#(jNc|}C`qAPna`b(=oZ4s&wkygBkr~O$cSX*e>&P_Qd-UvqQIl!s}Erem(hsr
zeKbYUl!G+_4Q07+Wia7uY|WXb#3&GNfgUrDapM{5FxvTPf>T>vyI0l<m?8TTP+Cs5
z`chg6Eh6pG7o0#NV2>oeN;BhD!zB?i6^{udPw|8;=yBE!#gOn6Y=9s%=HYS);wkh8
zy98C{H!6-2gC<0g+qS;9-B1OqyV$1Z&Qm%go1JL3Slucc7xLm6qc_C62wg<ju>f{r
zL?R#pg>M2F2ISQ>cE~Qy(Epi)$nm<(e5sq^>s<~(5d<dW1ciKpze6$}K;jL<iAQgr
zu=E*RMRVLnkuggpX*FCdjJFgbE!n)%Z8gEKVJ;=OnS@7%7>mJv8QS7Rq1qY7E6XP<
zwW1oY_?Azp>0n{WQ5f-pZqb%nJ|$vK*otOV|JeUvTUuEr1&=0c<KXfNb$rm<4SDG#
zaJr16CHm})CEBbGu8feS<24Ie3l?Tu<+yCkf3MW^@wmk;YboPYQ@PzK%m77+3YWL`
zy*{8>NH=#=zStpu9Ez~aZRwlQz2F3GF6ZoL#WTXeWhRA&%jB6gx8hQ$#)$3=BORkc
zDHt;Pg@&9+4lZ+F@EZx1YS3tkSav5=6H*Dp9FtC391}<68fhz6?R@qM8W|I!k#`w0
zPvPp%cx|~B%_t!^`}AsEi%~NpsLe`-MpZ|i2)6>D8X*RHpH5>yZ^!k!?p%#*)RZ{Z
zyoxfoSFaW=fjQTB4{q^Dwye|HiaVn4T#9WqNSi{ZWL7S=`aIaw=Wew=ce8yON3zul
z$st+b#)uC<7m_g&lV$Qg7AMz<v$%ve3c8w5C}Kt1fiHu3U!fHY5&mhCPyiED^0<sH
zTdoS?&Bsj2)X`26(<i7f2|*rahrP~ZMYj=(-8N&>#xtrtlsWlAn~bUL1KASaCHxRj
zNbAP-hFlav-4uuDA+Jf^HjjzWXdVQ<Of6Dl4z?N6V58<&?WtQ|vGQ&PxD?t>0t4Wn
zBLz3{Hi{Mj?*F%$37ZYembM7H*zzyr?dzeu*qNfdt2Mt-Sn=BF&04EijA!`Tnxn{Y
zhYgNuPfp-^Ox8NWadZ=-n4tznT)$NQS#AY<7W4JTB`<&8|3!IqiFu<Q&VEDPO~|8q
z-FTSdEwBPW*`=?~STZmS`$nTl5daPx{{q|@h}6%5U2B88^3yDyiz{&ZypKNG4M2$Z
zDcc=er0C<_9TZ_yOMzFn#wyP#<_;0LXJR&Spbg@nb3%QgB&mSkcm&Nn!e&Z6EOKTq
z&b^SLH=3ZRn;lBFK=CJm_B?Ufv>lYVIU*7<EVeQazbn<Sbq0p>4Bazr1%`hx2Ya><
z2IFhBF-%_JP_Va2bb|vostJn&%lFIU($i%scN6grWo;bt|KV~k$oJamqUw(7MEB`j
z1vPtzL=}hu=~OMCYFOqBhy=U!VfSa!Pdovva@Sf=-Yz%CVw1_!912s}=iKz8N15ru
z2Ly3^^}X6%oa}^0@=R|zs3{G}j;m*+<GcleZ0BF|<^pCPlizawz24OM{bL&!=&x+@
zHIBy^5<re@Uh|Bej>m*FrXCF8Y<O#JW)z5$h2z0s0T@`6EdVia4O@-i(As;d3Nj$c
z!oOp&+uWx0F(uFd@gvTl;`zIhaqaTBzRZrxs)a+NpZ6P`CQICgJ3yBOgMWn!)9GdN
zg>VMKss&q(1FM{}!*wca2PN#??phIN8oyx-4Ig)cW+K-rj37pq6jRm=Q)2CA%j5ok
zo!U$6N!h|+gKEpIhWJ-fO{1r$Hf$=@DNI8e%K82ktiK*F?l0b6fW-%ylg-QJ(@;Fe
zU{zFealB-*4H=`OX16I%YZkARs@t5GwzY0Jzs=nk=#>KY1F36)Yty4gF0<jc%aWn~
zVo0(J|13kap&8&Xyc|&}e80@Y_s)w~+QIKtIxqxi^BnKexd(gv=Cp;HU9HYq#xsj5
ztx<E3ietFO66k-4(fXwO{l@O0-GtoauA<TPT$Cxsf}AgLEj1AkDQ&4WX9b291Ucdo
z8*-4bRchPa@|ho6mIt;<GaM#ME!Jq&A9Np$Leyi>dz5rgZx^jrid_ti>G?8F-?C0A
z)>1R6`WE5p+EG!Ud@@_;-MPUi)%p13mBPYh;tTt}P*sak(<yM8T-8ob2XC6)bBuWH
zG{1G!ZTH(p&C{UO?RL6P$W?`pqj7>93$rSW4-DWZ!S)yF_EsZL+H&4G7a^cPZR<Qy
zOUSLo^HODSeM@USsA<;DQx8uw_5#W`3^1v*#YS+gTotqd0jjyjTmun7YyWMvzEam>
z)!WszAdJ+C#!s}J7%BD}7zZKED)R|;g0oJu5^4<){9PO>6@KY7Oyo4P&z#!~_Q?~Y
z%elSLI1q#O5y`|rPHjlg>Wk&2ZI6}$48=B9dB_DARkcXN@73z(bo!bhLI}D6ja)Gq
zo8*9)$|XO04xpivvfQy0ij6=5RWfBT0V(A=M$rVZ@Hcq9LqU%uoF?0H0lgu8U?cc%
zR((C%$sM1*vEo^p3z7-aO!my*Tv0{MykBLpzVZ6;O~@)wT}=Ag%g0TykI#tQSe;5f
zCMbJ|d5$o3Xer!Kk!=iq+|6staZb+oY<XR_9CjCtd0@AZ9<kJ0%R99{xKmqZ83HJy
zTHn-^1tkNU*H-8i=Tx%RGKYC?NFh&GfZbb-uZlF@S<s4iwSjDP=(-SIl>@kVxOo<+
z7|^SSz{vIRF|cldkdnKtfZD<vSK(3VDtN2ljm%0DIGDuO)-2q0)6VDrx^;W>&tA79
z`vA6CTFqXUUQ=r;i2N9B4oIm5>}QINF-*)$GFMhCf%ab0u3_p8W!h@!%QWPsL$Z-&
zvxH%WwTOV|(zT6_^!WrC0le_h28?)g12ufBdS&lg=}28WGamplA_qh>>0qt97~LH+
z0Y1$DMeR@Ct{2KWtSAytkzPT=l(bBCB#)YPz8D3>32p$!LZ2F>p_<7omittei@FyV
zq3Jqh?XvOf@;H6@jj5F>sktY0EQs$F5ZZDHDU{HQ#Ay`BeZFOJsSu8`sn^fTa#Am@
zXKl;hHk7s_859<BVyk?}tx`mJ#~7)}Uf9$&>@z@jvPLgV#n#cyD@Em5+R}xf1KAXb
z5dvU6Ma$E{127W^-D{K4F<AhQlRDej8XLsYb<eWQC2OlAGT7$cALAof+?U5Yup+{g
z`2}vk8J|C2DcU$n6I<<3R?7s|DGT1isMQ>!?%urDk&PwWjE@Q^t5YRUIi5RXLnIum
z_}Jj>CR+ems9J&|#SM06Ff{TY#~@R>4ywq8Na}V9?S~{qY)-34L@~?$lp^jwHtcbX
z=_Hww3vd|SuQq)|X#&``Q_nHaZ}3ROaK93*BAUZ~zlxLusj^g4P8(x?q##6L5>2)p
zGI%5~G_(-`sm=r&C_r|kO>O##7(*FvG<7e^$%x7IfHd=xtQ(cKsy4U2US=0Ua|mKy
zV2+`9j_x%^f+Fmpz;XJ5x`YH|4h&`z%g8;poFf~Ik`&HC4UiL9Bs}Ob8U+O*26gsE
zFtEe?ZS1^(d%>lTx-Bf=Gk{fyagO$N9Iq(1juFLr!zP&Avst>Jf@Qo!u>JB`a9BoT
z<RH_@#fwXAw$8S2y-xA#%E_An)h@;B6`qRIKUAuA@Joh7qMsQNDvY!pEh*!CI2w`D
zlD6IxGuEwSu_e~HDqOd?g@vMxS}1=<vUD_&NmKx7vK<;HDlsRNHJ{d;P3wdPKM|KN
z9Y8*tg)B@B!Q11gd=t~!ah&Fw+x9t-W!qKRBK1d16f|j7dP$}@ViM#85wW7>cv?fx
zBr*v_cAf_Q<@d5u&!IrG$bmG}xu&qru3hK2#P8It_T_(muS__e7j@<Hy<$%(sp$t1
z%N({5+cIMJu>YjYMUCJ;fpx-vRa&S<u(!9DYs@yMZjhrVYfNEObZ#qia*2vU+EDgb
z&ozbRIP<6@nK>F^@jt<&Cgc2I`bsW9=}y_ckVW7u3g>AKR(xF|r@}N3DKV;dC!vxv
zgez@jD(<K%X#yEg<{GozR9!s!-8x=0PK71|s`VNdd~PmWa-G<pF>fj@6y<|#VFC+2
z&q^CoVi<b6fsjhp2ZSoS$E_EaFMsc~UY;~BPx}PU(w4|bRa-E)mc3hFZV_B;_hWzs
zny=!yK=Ok<1td5#iSC1&dl*mgTFDsu=5bY)KVt-}mJb(*1P}4}N^eu3!ZfCNVuoam
ziG&#{@ZaByhKh&+F|sNQEi4%+$9Z$Z>J2d<+8p;U!*qd63g4GFA0tgU_R#+=#>fVp
zv3aKS(r2zIBKjB~Z8u%rPIWn6MN*2)Nrpq+Wqw<=bEKV7^EQ~Rr>l5j8cfv+(u{+^
zf!2TTuqPJK67||hlZwe#xJD(MRv(puSgYjj3}#d{_E6R62lt~KxK&pK@;uFuF;xZm
z1*X0|>b76B9t7|j4$j9c!XvW?zM^+okmuhkrT=qY5F#o%?N3H}bEE#dB71J)C*<=I
zVvO_P`Rtai22>Q3V2dAY***Bq0z5Y;co)(d@=s?<p>mtCAA1eYEV_JR@B2S|kKyp2
z3*2(Eq6`P#sYzCV2}kvIK1Mf@(Tf1jjm}jh{GqLIOrhi`a`k#;l4?5*ah?M@2k8b`
z-9Xymj~7!kmX6*(AY8t;SG%hsG1{Qf8dm?3Gtzu+gV$~*lfJB4Yx$WO*wPIxLf2f;
zQg5N@gYKk<`E#EZSvi`aFA!Z!uTle7G^|J|2q1Z_%OOE{s&?E|o7S8AYCAhqNMWRL
zNMn=lN$E13Pi*{VL%ibs`#L5LAJ}8nH1Xfe<PZU*3v~}|l8N6aj+SLXWfjags+1ZA
zN#Z<bytX5%+ra?kGC!N$SXia}+-5Ui`2fwPS-#w)t+zuBX0pWV59T4$5hN%vveBR;
zyrK;I1L#gfkT5>inwdIBIlxWAK+&0k_B0(;t6oey4blc@ut~|`gO@&KeMhEyy%RBo
z)f#FwDWS17VuMDKLBXVsE?o6gVVO=dK*{Pn>7o(s*`p)Z7=@42cvM3zuEdGpXfS%{
z7U`g2s|GGO=7A{8bRsFvA(}ohAZ-{{f$i#ZV`28o1S{7077}B?#M#Bg1lvNkJOUAj
zDewfkpjzqku>I|1v8@Dam98nHp4w9dr_p>{2e}ZxJc_a<XE$Mplda8e-Hwq(0ic%(
zgK1(284k5I4`G*$!&Mm6CN{%@6`$MZ?2JNPkX4qdrW4N5`gFAGCMz+c=~!`4<nWsW
zy9b&=xvss~szeg5ix2NOVwgnML~T%dVry{B4C3PX6;4zV>|vY?adt#UEHNfgx?X2p
zfQyF#&oM-knNlu7fa)q6EN4AON>8y=5mz`)>g{|Lz7L}1GSSifIVSI%AG)Cj;L$u$
z4tauw2E{q;kJ6^J+UGwsPoEf>m6V9dLV3HQzRsGrP+Hgxk281T8R{I*`Jk-nyfYMl
zRVa~3I>SrfI`6d3`%hF}OCp$b1(+BcEfYjV1(9P<Omc+w$d3d@ZoTzmy9cfR1g9_=
z!?JT_Xy>z$jkmS4MN6%9G~+REDLT{b=ELbMAuaoo&J48>w(~V9Vj0N2<963GfGi9@
z=^)NK$E_cph=3;h@>WK)THcE4PS_L8_fR7`q#A{&;pSd6kI#B9xjo`k@@<i#R}|G2
zdup<2S|<M9h%(8d5u}o0f+(7OV@3~@D~0?}R6v{WI|cWxkQ1HPPuX;O0n)l6dMGT-
zlU=<hor?}zD-8p~yvp^=^@fh5n@hL+G+)dOnxs-tI94FuZYPr}{krXybnFbUq+frc
z<q9M5=3m}8tZc2#<Eu8b@?MI@Ryv`LLsJ>F>sf0)_+-oe_s&*5YvAi2h8TIdc0YvA
zo?!4LqtpCNC5Sy#uXe`pDsXvp7q}?XtAbHx!VhnPjTvV(_&iwej=OvX7_kp~4ooE(
zMh?IErb3R9a#%Z|-tbeFTA*aMM!Q*Qvb%SlY?X8>8&>w==1Ss81?tJ^?hCh@8=!j=
zCYN;T&h@^%CX1i<DSzGeb4tx<e*a-RYi$dnIkx1QCff~Uua%_&Tkkn3UbFc}lEs$?
z4LbIB9Wy~++<LL)&L{RPZPW_HnD<a(2K<@gkvvX5-prIV#DW<c&&#5@eda8dGLjaH
zO_M9mF_M<{t!B^wh744e(XOzmT8PzLqgMN3*oS;5y6Ie7e>k(jfi%Zs99ln&r<;b7
z3u>iIiSk7&V6hiTzt14)=Q$)DN7FJS{XU1JQsMt0BsDXxfTT7qRKrne-s6s&f5X_9
zod8ups=qCz9*Cyco!hiyz3hd%1`-KRS;OR#^s+u|`|oX!AzmfpeP<{n%~l_Z>dTYO
z)LEs%{zyY`xBfJFUsb`1&A1?*2i#;uYGn)e4@t0!#!^nMR+ab*!&!R~=uu?^^7$UP
zi;5bF|Cf+RyFuIuiLwfsheM>|@jL_~xgv-cnZDdc!*Te1@C$mCZvSTvxsZdrULyCn
z{rh&^XVGb)g=_qei&R*{K@8IT-T&~(n#pDZlD3a|EN&YGp>X4|&q2R50<IhU)^~)U
zz1(6d4*E)&8P08Y0x}9nbEc3IfE9DkJPUq<)xfm0p4n)VVAg-(nqehcHMb;`q2&*@
z|GK}Odxe&g*`d1ueRP~o&aC@JvQ`<}R(BnDGDgS}fS+yjNFV4m|Ma+$EN)A&iEY2B
zSRR!=2Gz3Q=(|?9Fnd&PlK&_ON8(gNR*Pg{!G=j$prDe}R_TkU&3c*U^O4CuM8Zcl
z->k*FF9bYP_)ZY0u-iOC5Tp8x1+&+B0rO-vvgjr%WY~p8=;Dhrg03?~&?>aPM-pHx
zV+)|*g>?zvx4V(j-i>~iA@rt0_3retm{#t)rK-_M3qtN;<OpKB03r>uXL*=$6hlr%
z>a_Cb;2?NnM`BZ4OL;hZU?{#kY;cpsV$*#Azez3Qs$^0-<*9u`Vk>bPTD<GL&IM#B
zu1jj(d)C!z(1Q9zs*18_7c!{sAyhmBTVH(l3E-v4-D~Bp6z<-H3Gtb!m*W+Rh;$yY
zoPZgg0Qxz@da~B0n?W)=Nk(LAJeCL@YP5C7hF@K6^RPG#i{uh>?%xx+bR^Pj-`$y(
zSz>5mDK~AhRT|our5H|r>&+4=6UY4C;t3;W33$}ztJ`psnwN5QuC0`p*`WP2Uujft
zNz*bx-q&)^I<1SVlVI+v-c<L!?maKUaYsL^$=&)^?z9TFw&ezCJK*>XcJ=|W!IKMG
zvf)E3BwsU}b7wE;13<PlJ=kWmJsq$auaW6i)YpVMu9X~I0!)-JKN&O>EqHK<n1=5G
z6-}WEp+b5jA5`vrE$<tTzN#-C2y6W|j)ZRZm8p@6%k=HnmIa46Jd>4&cQ9makDL}A
ze8DxeGLA;%RBKw1feKOM!6>rUMk)*o`&;BO^D`b05-^|UO*Vl#$28}5MT$0!ClSXg
zwj43BeJk6qL!+$cK{mbmmW*Vp@tqKLi<(*$^TDNy%Ki6Fg+h<26iVh53dt>0!%88h
zVIA6s2L=+rG%D<hkcFKCuuF;@L@DCWqZ<{@pPu%UQ#eFLIm2+QnGv2QS4FR~3siU0
z5UTw^G@iw2!QMp}FD3N6J}gDLxHT~k$fVEC*OE2WBAM4Us#5k-+JMSREQjOR)ngE+
zM~)`VRn9x-WbTy9pXf2Ru}phSA{d-Dv9oZBqse4AO>4_!_$y}`#r_)s|JEjUDiIT#
z**I|)B~gnW`t!wV*+|DJ3Z2eFbxBH^N1t?3#31{482STic&z+`IOY^96sE~lJl`B;
zMH#tx$54TfQe$Xa2GML?t30L2yB|j+){k_OD4;ed*C2i*XT2C~p<ftzyl$QWUs1Vs
zNhXYmlh%wqF0~acQ8<896yn)4kJuTRLY6;d^d!{6icx(2N=sF6P{w)aMBIMBAWS4n
zAtfKc*eUf1ra4F93Ir=2Z$mfb3u!|#JQvIboUxWdJ+vbY<Z4@Jbc5FP;RwOSZVBj9
z-mq=tC9Jbiefbd9MOJ_IJTDcnW8fL2eyr?u!=<F>9jzLoW6`$pI9keRld*tj+hsAl
zrPP|Hju<?v+`=?rNn>Rj+sbrUiipM5mh#jgsWn-+kbtB60P%-3;KF&@iLsj2c<F%P
zboar|NRh!!WYNA~&32{hno3HPv(O6jRXbpF(nP@9wPqpiOLp<YUV-NcW<I8YUSp8X
zacxxhP&$RczFZc3;!=d*+6W`M4USvq?bh)Cy%rk#4R-|PWK?3ZBotB-kZ8F`QXNmx
z_y>e4KBQi7?as)lStMbSBE!mB*!WWJ0e@m56)IGtrc_u^?$h#KmW(ta2B3!mE5O>v
zK}`i)A~zCDHUVVhz13WO&&_*9*iYOEr+2~z+sEYf0!<)q@b@*N4Ll~-0nSXNksCVI
zk%Qnj?<QmKY$XG-97ouG+HONx=L37D+(cD$C*0xdx%iS|eU50jjQA048&?UK*Wg;&
z-)3VKyGfr0#LBw?np81;WULY@RnuiH&Os*D9vcqAdX!-tiO<}L<;6)%w*gYPku`qM
zy{T<vy0`j=#y;n6lGO<Y;?JBwMBB3iw@|<4fUh2p9j#3GzC9;BP^DqAX5Vy{js75+
z;OB5!0-s92diq(}INhbiBZy$f4R8_ut}lByKFXYq4Bi~9mq)f@7(4lvvWb=?mKQKe
z4aEl0p@$AV5>|t;Z)9$f;?&CQ-LMi!kpcF^Tq5o0I4MX}oJc!p9M9WuoblccCGn6L
zpNA^WC+o7b3#$odGZ*(eD~*$+LCc0{Hz9LOxB|*F6;B!}-fTllOZE_{1G!mN&1tsL
ziWX*tK_EFl9W9YnXh@_N@!!b0jSqEpF(nw+EKhPF5A~eSC;26ExL8G@FcO?<ONV~#
zHGgP1Y%HUXjydX0NNwSmwQ(35wd_XTY*v&c4zs`{4}~o02$pi+5jm-%Ay>BW>5!K?
zQ4GGSQIDRA;?a;B6I)D8%p@dN`qa4*FNe3}oW;Z%79XoSNyRg+5=3rE=E@!X*#LQ*
z7-z7e#w}k5CV{hCVIUM4B#}BtTc{z`fT4M+c82cB!WbCH11|1L+4)O37IrwelpN4H
z`h;*`+oSD<5{uXePgq6Datd4#oE+?SDxO}t9nv#XMsI2;8(v0u!_@LPR5yxJg9#S%
zU5XdA<vi?A<zurahO7`JZ1p8`m2MTUbaZwcFxR7=yl(wuSA8PBY)g(oqFn0ibKkl{
z)^j(ZiZwH&X#h_Yv%V>QNm^=%r!V@3dR9x)<@(xYHKRDr0i-ebqX`zFlJAAHB$w9H
z35aTICuDzKM9Z1Yjbo7=XgVIhN47Gjl#un3vrMI$rCrI$f|2u|X5@D5NNVANQVu#2
z4lX$Y4rF+`rFX^iY^*)OgseCo7vhi=GA3DORzTBeAP=ZcP@%{$IiMpp)UG2~<pw=<
zQ{;VKZ0)7vJwJLBd|p$KvU5wHcZjjinadmHhn&hP&7u_yj!*B&dWo=ZxOl8SJ2t8*
zJf(wAn0@5$^O0nHQMK=KnV(%1%f3LeCwWZ<P*_`Dje_rkLyxCHVW2w3kLooz>X*+T
zEN_xv;hZ5ZrDh1k;X!Ze%(CD45}erpD2e$+Efx&>4ue%a*%#gn_IE!Y{KCSnw{82g
zahRS2$@t;KN@RMKK?qL0wHNeO$--69*&k{=n`AkkZKE1t(D<VQ17Mbb1ZcP7yO7i>
z`e0(ksDo5ljEN_AnxP3oF-r}JtrRYrI9&1N-vBR1(Dp(T4LqyhO^#APh1XD_8>Pr&
zF8R;1;AN|ioea9I-sNe3&^~WldS4{>^Yx6*l4q)g6X0#NWfyY*f*A65)Of_r*WH%n
z;6NUTUhiSMrid>ps&wwnC6iN++Amx+sr{xfB6^lE^>vy%G(}bsE?7SyRrADYu5xks
zw{)d|-S|O4UEQT_4BAZ<nD<m}v`UprEqIDkP*_?EUKC8&<K6%4T1#`XT5MoHYT02w
zzpqLWcxu>Eu5!Jx?;!_y(BMbG_#i)M{77Q9?Bfpw^gzw^b85DT=2~ozVS&m4sCP^h
z@xH6&cZT}pX)^4~atc<Ziw_y?cDi1^i!m3lx|RrscrnevkQ;^UwU(VT=YEFO@(3K-
z-Cx;aqk`c&UPXx1N>GS`D;Sg$V1O>-`OX*Ru$TE5ShQN=_Z`g^)8rO;{q>xJpR;Wu
z=1-b(BqH{_CnLnJgp5$4!bCC6(9qQ~oa3-uu|Uk7j3AL?m@mj&>WIfpY%^|QnMZ@o
zBzHocz8z}H=oGqDxb2ZWK63WBbfJVrmjGoiiPQk@lU<_{Iod#m9A2@e)(5#>4AT!R
zhN3TOR+LN9*#x!Et!kyzNnnrQLef%{+N^+<WN3(ef#jzZ9;S-1#$)wWvR`obZHpNM
zBKJb&uplWc4c^6xR+_WAp57yJFEC<CiUFlkOU6?H3D*nQymT`otOyJ4Z(}9|GaNvg
zII5c0@J<k$dv8z9DMOeE_rQp)+V&tb6j^vMx&i+z1h4r{CovdIW6~$6B4FnU=XS!p
z%@lbGRbZK!VRRaWAL)7#Emc-(iq#@H8x%3K;N@JpmL}g2*8FoC0-&IG@92b#_u51<
z{aP_?QHZW)-XQzL+?kTc#ro4M9%E-F{IY^|59vQ15h8vgO%?=HIn6C(6&&<JQN?WK
z+Ic{hg3rF7Q(A~hu-nhj8hwHHELh{J!Li9G-M?K#wGm$lp0-=({Xzeyi`L-c@<s3R
zMWMKgysBDC-jEIwsgDH)7=T#RT5RVc&M*QV<XU9FvnWC@^})MnsI~i?u50s*#%AnF
zn3;2tE1&mwBbKSphhiWqrl16f7MA8GTOrA+fqW)%L$)20ZZ-QhS3JK?B}rL*<Hk>7
z28&K^V_z;y{M>!P_Px}={%l+`{Cx0&$(x(ft(IMHJV%1q@BUG=vUoklThzH6cgLkp
zWgp+^=6=#q6D@6Ph|$3dwBR}ogrx|-qmG*u+%_v)S=k*>G%=9R_<m_UXEiR?;5%;f
z+?cHz9fP(r{mf?B`xZ;A1IwZ1=Q5chPae^|nMKx-z0lyp{;|0T$qG#&Om%Y{lnj|>
zv5vu)6t<SEUF?9b52D8pvWk4h;R3GQr^N=~@)v@l!;y=cd!vr~f07nk1Q_Z{tyqyR
zYTMji-b*Q^eLuXpiBNk3pkw_FeEE_9?A72nQ4w-PO(_U|72Sf(jw#tGM>RfwCIBmv
z;<X5`<#$hd`3<amF&+A6%GwUmvv+Ud72haQWXp5SvnLyqZwt^?D&jHD<&o-Q17Q_G
z+e=ohp3Tn8?%C#a>b-Vy_hU>1cRB!|up628=Bgo;%uT9Q$KXm<hBJjMvlmgYlEM`>
zDS!dEvTNziG~peTO@|r>@V|X`WZJ+#+Y55ll(XPo{fItxw|akzhwAXa?a%{QM&D--
z`H@qBLh<7{{5VL%cWiVqH@P_;u0OzBN)gDqtGPK<-vO-$f@r1d4du30k~<{JnKnVk
z554?enJGNSBpEal&Uc90ib*ji&-hGP>S#AEGK5FFHWupDbsGCUDQ|6fw?I?dR53Sf
z@ql?SVihnoWQiWhIotjSEFE)D9uzVp5$W)-H1&X~6HNb5AQ@6La@Sv4b?=GciuR<o
z`wt$F4ad0O<q19$8yx#OoF^GMF3M{7+1wRs1aga?;<b`xo#z@js+)AWgOZ*byrh&Z
zAdMQ9ubxWl;iM)uxy?t>5)A__4lSh!yTeFjCXoe5&@xw<2~vI)wgfB+B#V)ANnl5~
z<eVWIF65OBCPxFlwQPZFu!ia~834&V2_0gv!3WTr!FFvAO1vp~V@y=hcWN&PjM!9D
z0m-ofre(vc<CA20%2-EA)E&B8Vv3KqOMD!tVc51q)}?S@-CGhHvHweB3o*oX)>XB*
zCEcideN*OofSzZ#Z59hj9?mA!v{-109bmqBerO^np#O^D!6;twnzE0(K^2(iR0-=H
z|E2jfp1+O8%AJOaJ1p2CGhjF&Zw^7rr$}|s5OzyhU&_yVu|u_SN&8$ocKY4*@qWVT
z%y%bMxE94MT4{ihELTS9VPX3uZxub9MwH}?Fwd->O*ic1vpSZ?jI)5*iM(*MGACyp
z4sz>&jr{y8XXS#b7!*W7TA8;&0X|0E?3vjxG?rIZ!wP3m0&b7fv11_3L<<Rwl3J7_
z4SV-wNh>S&#Hql_R*yR8qAgwD3p#UsL`wvXn4JLWz9+dd^vrSof~C%#1&Ycl`esuU
z?D0rXfuQA>8{W;q#)kI2wU|uLMpKo?xa=xroEp2uXMw5&ge;@m^aORX3hUi$9(i&^
z(>k6eSGCjA!JB6HynX(%vBix!rfckit;dya6*=Ez!YJskjsu(JjH$geG9DDR^8^W}
z>+IM|o#D!wGZPor|FvE*w~!~8g5{l=nILQ_a+7330R*`|&vk-HQuEl#uq?^Yi}mX-
zWs<WQl~p0P;6%bd&%3;+kJpdi@BZ&IJn*6p71x_wak9bo7wGW~Z#<61zR#AX$+&o9
zs{bVTBHb#pG_YY|Zv>uO@zwi=v&3HES1eY9COewV-Mh3<m^ww$tdZ{oHz5i|L(G&B
zuXNH39uIYZ`A9hOgXjw>mqX6%uCjM!ZpF?!{q|9-!EWO;30fmc+#*w}+1jlN3%9kM
z%(sza#rwyl<A7iVwt!>c3|XTp4N3-8Hh|}F^e&8<nJmN#oA&vybT=N1h{~zHbk%<R
z=9(2#5+ag5k)00=S|m9klyD|-!`Pt-C4-n0Djb&}afHKgrJb52;fM09N>wq+z`loY
z$N<B%L_>|OwDel$^vRoiCK(B{P*zGPN9~f$Wl7)cdU0(3VH@?oM%c5BmerULFz73|
z5+xD)GOVI`LpxPa(>DSwW)092Lx-E-D$!o>6UZnGMTB}P&b->#I;8vTVZ^F=3XOt>
z10yXJcIFXg0Zc$5o3B)gH_8hbkrGu%7zT?MP?Ect1D1v;zI1;P`@|4LhRftF`fIRQ
zFv$TzrQ1N#h$%xvgO*~mY2u1(94rAK1rx^J6m~I4sE1)RNkmW-!*KLzm1BppqG=Qj
zoD`HK*{adzdSyNj2+(L{I5c1aFsHg!?VnwAy8R})$J=^w?dcpU#~dbxO2*G5!L-GC
zo)W!ZMl+03q2gFjHrNP#m6p2yCI{+^ILqbAgpZ)GWI(`#;lw&JUD+%**U2>E6+x{h
z?Evx)NiF8mWP||#U?yovJz;5jNa~YGDk6{z>7z8lahk3v-P>9zY%MkxIY41!(dhC7
zEp_a}T9F(@;7{78EqJ;RF#^jB*OQ+Q_7A`Q#atkC7LiLG9OZv)vVhZnl0c!FY9Dx>
zt-3dy8IDi@O2W)2TrB_|D-w!mN7gbvae2-Fy|AD+Qq#r4BY4huJs1Qz^~s{A&C!|g
zBQT<@q<*TT8f&4+t5w#@WKNnzvt)Veh<<Q_$P{H(w)NEHDq5vA0JREG4`1tz$-+ng
zwi4BV3R$$YfrUkI907rY<`$Mux`{o>v|<iBUWgo86&o@@LK|&!d~Md02<(cgJT;Om
z{cbpG=S+;dpyw%$Kp4tYxjf?cdSmOa^R31~<B{qh<J?GvGH!}^2)a6vV)``;-;&QA
z`AF+aE8&DN6*sq$yXPVmunmMeDpGi?<3#ULg{`d60RiCJB+3#h!*NrVQ0{#I_-Q;U
zfqZLiD4t6Ka@C}B5{T2~5@_r&#K<U4BKri+K}i^B?u5ek!4A9_tR-#>jpL~`YkVo5
zg#($r6^n&SUZ%dFFaF3a&UVuHroiCP6D`%mY|$MD-y2*EVppuunm*TPoD?U{6RbX8
z&+wY@%L7Xkre=SRMXdsxc~(=88e73%SASgsw%Rs`xVzrQi(ohn=Whk$vjKsn0TrR}
zulw6|x-yUFXj<bmMH`j&r@4o>nj>APyP@>(l)JP1hK&`_zOs}`YDC;jVPHuQCFZ9E
ztnt<t>60(UPlEM)7*0cS?ECvVS&8y;G?jf+#95~%UZA1RvOw7=w;F2d$%p(>5JyG$
zBuo<9GFzUvN}bF$zpLAvC`3A7pRbWnC4&AEbtI@&&Oo@zK-r7}hA51@6=V!Y%t~go
z3ddLzx#3BOlZ;9l71m05{a~x=86Xh=8JgsjgB33j!M27*qm3(zXy9FOe|0|^Jk%<P
zZb~~h8vT^kP5GSDa*8tcXL3~D2Ob64eHLL`?JcFmBgtAP)Kfga38Hqtebxxns6P#)
z<%UDpXwi(%5iQjD<v-5jiLL1{hdT*pl8BnGO)xR)d<t8+DWWD|>=m7c;WSO0R)DI*
zKVdw@zEfI56LjMyl3-8D^AQ+_@svdzyOm7bOb1VV_aa`EA8G5%Pde*1UA*8&bp6&T
zrLJAJ%o$}@xbtnzCsXy^V-w&<oiSgOAUJ-?k-SiQm&afH6lw07`l5~$lEO@4nqlUk
z$XpyF9+EXYp!Sk^HyeML=m<FM8;KZilb{{)K!NQsVkCy*R|yH?rVR{C76TNQW6uD>
z`Rz@ZKiXuaxnEl6Pj<+0Xm~XArhCaLMYlG3Jd!;eNJ_$I2Toj6f~s-QdEV3%=#isD
z#48=B)0uD4JwXw{zSk|m=Ee+OKJXoZn?;%e0||LlSwjK5vAJo}G#1I7qe6}(Knaa6
zFnPOKuX2Tk6gSayN>PrOBgkJpcnMcA5ZtSW(pzH+m~1oorRXUzD!IYTw!ngHMgVoA
zer6@0r-9P$Qgk<zAQ6BZLWhM-f{>DQw8iC((ijOL<jcu$WSRa>Zyjw)X2)jPQsE|@
z)Z}VRqzuy0HsHt_#}oRA-c@++JyB6>Y-|8AY#HHuIv+8_l|+l4Be%pM0%rI)CG94i
z*mSEcM96N-8J4SJ7C{>&(qtZaHZIaL&xXr~T+QJY*354)Bmyu@!U#JCDwK9hX}odY
zn7B?P>*nIFSOaU=?PrDo&2%Y}Z%xbGrA_5$p~jcO1~QGf*S@4Y5uC{>w~RSJE-YNO
z`O8exO3c^Ynpc^lT^;IMa-sKxbQDrZ85mJmMBXooN-dTV*?XaKc0`%)jS(A$RFZVu
z(ReFAF;{EHcQ7xbIeHmHbm0S7YU0_ZD!ddP)k<Zj@G^fZL)NWbZDxky3n>5#v9vmp
zp;pvT`evo!9<P^*(``TQ>}jJbPoP;cUO>XKOvdYx%5e>Z7*0OE=F>`F+fbng{Axeh
zsNWSuq(@zc?MyI^#O{Gn@~vhI)q-P2f`zpqr(Ak!tqvK)Txqa7N^TKd6fkh7iatsf
zMro>Ynq}O6%1dV{#uo6bhsS>H(K2q>sERM5=q)|p`oCMWiFC3G*0_?Q>OEC;(_w0^
zVHxjXR{N(mt(ACC@tkkiEJEf|H`2v%8HcnfiwqMukHq)DMrQLKwoy9f@RMk}o(V?h
zlv5T8toO;-fY8kW6Vqe9We|&rjlEJ$4{6Ch*El7W;ddirqh%Kn{jX?$J?&d{KbWOX
z7PMTJCj)VHuxU_-EecSjMM2y`bb}49m%znmSpmIAp8Ctccqg+}&3fM0+Jj%aU&Om#
zv@LN26_xd?XtjvPwR(eo%~Fg|TeE`?)@YZ}?TFoEXYi)mIY0gB_s-y`+iLb3``>>3
zHM2mwP7oKrwM0kmKL`+78$6MKoEXB*b0JcE4RV#>sg6SRdXc>ad4o5mwl5aWimp*%
zYG^KDnUAn6S(6Ozb?3#VDZP=vbf0E6_^(`+jO$Mg>2t{#b3&0uC>O=D%nJfyNz3Uh
zts%k{7qg4SKkd}jMzh8VP$;7J7On5Rep(*r*peLZZd+ZVd?tf<q9HY*D4Ylnvkv;D
zJuVE$5YOMbV=bPA^9E7PF<f+g2V4scbi_mJm@!*S8}mdCX~k02ay_4uNx5ZE&6Wjt
z?aZbJBC=}_77|X$&Rd7B)fSS(iHIEs8igp+_J!R3tIQHC+bct`cy3v5P#i*SP@<1c
zWo+->`;({#qO_IOg6+QD2<Rs9#4IL*>|r8UukM{@(ds%Gr;fWnUg^+5++5Mgyk6v@
zGkSD1csKGn-;JOvEYA2enqRH1ZHvjgw!*u4oPDvSY&UVdU4)lWVi&+tE=4mM?JX^0
zgH*m^yDGCg7a_E1Y%nC!CX`$+vhAQP4;xOrjVKBf8a0erhRT^Ev3!_Dz^BH!ydzt9
z2c0%BPzJgh@MIJs*`p&blF^jH0@J)R?Tlj#2F^_IZL(fEh&2R;lY$e%>hIZH3Sv<0
zpza(FI+0o4Xx485US$RG6o6f+Tq4L=*1r4S3tI2#pr|ywa_lQKOvu_$c$&%RkCeb(
z!Adr#kKAew6E=oooK1NvX(K4021c0T;~>Zhdol;VB$xvcgNgtBq;6GL5AQ$q2f=-G
z#XIf1931t39P~REr>!4ar@_AW_333ZIPktXyFBf;gTvgrm)*|g1+3QKtO>2R&su}y
z)@i>Pe7g@HbC&3M$g&|>2&Aw8G1<Hs^MZu^c2~EH2+B&$z>3PQ{DxH!OmTz7532vx
zvmyHSOgIxQpTXB;ULT=SX+)B(W5vPtU?w&J2{ibK_=|Bgzg2>nb{w@FSa+PZh_!yd
zdTO=R$DF+HFjmp&Iz+NVuzcM5v32xk2gW;&VN5do73hyMsy@fW<D6ZIi4n|qh*n*7
zG4|BdC6%4!7>`G{6JHZg0Nn^P=m=c=tATq4CuPimR8xX4!kGeMuNQ1-k}$w&X`LaB
zP&l;WKTx1!9tpe%YSfAv+eF$M^A*wud-<OhIalad+C&7PD8`H44!7yF*dA_kdeL|m
z1I>r`$@=P=nF_w(k~>}PF{EaMHg76qkiysi&jZ0$qbwvPA;q?46K3R$6(6h}C$7%W
zkDt>E*hsw-HXJ1189M$~yU!U*kt7e*5ADjn|I{uiI4DKsSGKHP;c+xwh3EzWMQKTQ
zsTQrfZj}ptkBo*Yze``TMV@b>48Ac-h$<KXBYk72zA5getd90b7@F_?dh+YQgt2BO
zLD&LZOoO<JcSFUWP6)vvr>BwSFYPSa6a@r&?eg2xNY5z$LJvCsigt}W|4p9O)$p5R
zR9g|6X~eY1XhWHKv5|LzD;EhyqliXz$dK9yE%b60zK>_?8O#HjO>F_7BFz(pcK4rH
z%PBKmiehAT8t+7<5R%ySymJiWKU~iiLSxsYrcWk{<=5+?wwklgW@O4QoshpQGLouy
zfCZWSvVAbwgxU_b;qq#cq{iV=rM%D)uw>W8X*QNMbmR|}(UAMeSZpU!*W8z6939>?
zFp+w&H6rX;f6m1+8BQ^~SdZs4b&W@GY;><mkp*PvHza#a!gwl%+7_ud@(jnazwE!l
zVZ3Uco^~2~m78wj6Js}Ro9c>l84FLth(u#f$VD3^n@z=yJD|+4#TX6Nq2U}}YJ=Gd
zEsg8uY{~NnybCkFgz!))0BB=Th!-834j;)<KU4gGeqs5FiCdv6`Ya2k;Lm1Vo&-AD
zhqb$@bE31)0;L8M^-2osF}kiP+Rn2lhiNyS@RPuh6D!q-1RM~Zg%xEl+XSF*z6qR`
z3Jk)lA;CjSn-ZLVsOAua<!$Zznvr{<d`(A{FXE2ELNs%g@6UpfIathdD^NHGFa!3u
z9ys+x;F+$&0Xq<>$dHP5W80xbL~FxuHUzPaxJ`SOo@bQno0vvhZelFvlm1zrS9fl*
z{7uqysx$}%3ogcr>nKSht0onrCyotictxf~3rX3A@lmu-x7h9?jZxPi!kbZamkeu`
zKOkI2j7ClI`jZr!1ro4Ns=H$j(J+gN8BUgOEnN>CXn=-O=9TZ6NRDZg<>KlPEfp=(
zs29ZpmIu1KOX1Kedc!&`t0Q+~-nbltDm5EOI}3t)N)cCv#(s{YDR!l1or|q(`CPw(
zB~#_3y-eYPn4t=(9ETVgn$5rCWNdRHOo4;vGn7^+mBkTC4w8*T%Jw@7`+^CnzN6__
zhw90oBT62Mu`%=6v3MNR3sYP%<-zKnZun9BAdSXl3H3r4YNIJnzJ#1Q`UJ|Cz+vh9
zM>1i>Bs*-QGeDcz8SE7_blB&qIt6otgxOg!T0-ec>34;*+XKLF1E--35ZPW)VhPxw
z#bjlxRP(TS`n!Ymqg^nyHC22UYAIZ~R2{?{qv8TKZUEg3tc)~vCyETnwmSvVrkcqa
zIAsNh@~Gs6P_?@++kXE9jn*=vT!&U#r%w<b2s;A02$K5^Z8h?Yz4hEXi)N7YynAYh
z!0=wE@92Q2zT;(*e%|i&)pzv&?WrF}&3^Fn_bQ9}^Ivr3Rv*h{JwWl6*Y*OXvLFv<
z%l-_nbz3iUZJ9Ucm>m^HFa%^by}x<YX`Z#sq+a3}aZ^7Jeh<1W7~C%wcRrfxYy*lj
z*IXx=NnkKC3d?6Fr!Y*4oxuW%Hnvc;&sO(vRH;-V&z}WfWfjO4N3B{vv|AU7!1iIf
zunL4!#r(WDOhL|Ucs%Y#i|H*H=bn&lLT%(xK3^*9cge)7GJCVFG)hqO_0-AS?Tz4I
z??Pv;_MLsQ3{`$e+whyNJ;;JP<et!bOC?aSiJ-W7ks+zDFgCA54Ws1gvPkU3+Mbx~
zaNL^ly3v`TjSRVf>CPg`cP`1s$=lQzSzb|ayFI(Xw(Yj1J@H9Uo(J>9I6bK;Dj!y9
z)ngWiP;+fsGyZ38@q351pqK!4$7+tcZUpO$2b3fXpJM2zF_|*L98CBof#`~pV8apn
zmLOr7&^Sw=O`OUjT!^Wu>^-lUJdcJY650Pv84lom@T=dj*6HP|&Anu7>lsGbz>}GT
z74rB~8roOf?D!FXT8Yb|=(-NRupwYZjZGG_Gd9Ndxmvb~C4s9jo`(Cp$R58{6z4v#
z_BXp3Lu!}|Ts8)xO}&m-P72tB)c+K^EH?3`?NIsT3cifqC2ym=zt);_a?w;b#zW2W
zKPB<=8`7c`liCJL2e>z~%E_p~@K=WP-b8A-#~ffZHwUzazhA_iji&E5g#qf4#fUO&
zQAiG$odOmD?31@H-|aoU$I*22>5U|S^~jmzT6ZNw1#G~tSvEj}TKxMoaJ4nCHw?J5
z(E$(?g=Jf+Z0qQ-l3;L2rpM##iH)DiTkcZ=Kn|@uRE*iQ-}+iZ%S)v6KpZSBE6Ztj
zcj}MU^-X!(EDUYV$GBl-tJZv!O>k;cYBBt%r9DmNSNI>SuGFr8<X1ix^;rhVOL&9~
zyP7@14u8odCeH+)_A{U7z&hrlv6nE6s@_?+IK}Q8-(<+#3DHyAOIm8YSWn*`i53#J
z1<_p_@A-xcHVP-2QPqyoV**GC^_Fqgo3Cd~zKaRM{!;`c!jT3BSiXl<3Rws1MDW!s
z+wtxMv$ZoODe9x9PzC=$%2Ch&rh~!H@M@@LGK+B$rYSlGS6PsSD!b*O=*{IayyYG(
z<pgD1lUg?BdGomWbGT*mw@GW3t`a}hGp&)8{B@jSOPduM4k%u%(HjS5sOqadrheD`
z94g9CD%|U4Fe|-;4P`P@n2ig}!liKvby@Qrx7b5(oI>lWkqjEVj&y#zDnrEld|O#U
zQku@tPg^XcIj98qtsU3;Jg2Oyh>|?htkd5^XBV^!-aQo{Bh?1ocsaPF2^URQ*=ZNC
z=@-JC-vKccXIm9HG#mXt3qdr4{?G{G$t|Tm|4R_W0xJ1N<k%P-3kSEzy&@$iGR0PM
zQ~6l@&S5r-DV@~obj2#JXNB#S9!ltr68|R5s1rZR<EA9f{jN&tWud#0S<NDsCH$1Q
zEzzU_xO&nXnF_t2;&i0tJGpevE~sx;;O7AxrqqXyEUHoFI;Gd&Dk&aG{K(@*RZxeR
zU9OXLsj|mZ#kFelsIu-<Ru5ixE8nWgiA)V{*m3xA9jfSEi8OI@orJSECrmhzX6z(s
zo}1e2cny|0)+3gnVVRUvrNKGzB1d8h48Wgh_k%2uJv1o^#|1Pg4c|pu^<3s;kB}ax
zV%)96fJtCdD`NI4!F_ET^X~;eC2LY%-ALR^iR~$-{VG$Vt;y5*qd6MloUOxxFgWU*
zpR`{F-PW6KyWa|Gz;dq1?dTTzp!>&A#^~9rARN>kyS8+dXb%I~;-1QTdAHro*e3ul
z!Mz7D*54$%delrC5mK%A-OTfISX+Q-o3^9t80>?C4zchF=8USStS7WFHA(4$TO6SF
zHU#nAy5PHcHhs1nv!=-v+Z4<Y`!+OUokCl8f;Ld=a$t)xVOmj<;EVdhngbEOj`+Sc
zj<hC#?0h{@H43!>-j*`BZ%OzTb2FYceywmO_<-VSm$c&oO+YD`+=1Pq#=@_2%4||;
z#S^l|f7uaiUC!UmlN-#%!d=l_##SSHXOZs?KY68;y@DZvi#11<D(DVqP$BK4>{rY=
zJ5XYLrUjF5(&ZJ)(@AD^7;ITeZeOxE!48P_W=J3j<daL%nxG-3wzfMv9-MWKFHc+b
zf{;qNDx<q8xh%WSd<|KVDw?g0Nhk|9hU%q~26m2G9Nr@}n{puQ;A|Qj0?P47OdrUr
z;6=ON3%=g})3>@5-3wy#KWEE5{^QQ!FJ$QVDteC&%os^%zT(r@F%UxIKs2jBHU2l>
zQk56CI%bQG-~jKqnAVn=*fx4mt=UL&T+~?O5!@j&)y`5KCuY|*9$~W$H@q!=^sT6q
zQ&{yyWBDHT9fFa5JkJ5^zP1mx&55>^pNY{oIe}}htNdBBMT1dx<;i-rSg$nD8o*2~
zk~F4}Cen(h2@H{y1YeA|8o4P|)|u17B7)$`61cwns{Z(ETHr24AHvIcJrQHbfzL75
zl!GR)lwF_*$qdlx2pg@Du9Dg>P!1Z_K3BAy&AZyTS=_zCGgTJuY~E`8;*_t1%nFlJ
z339s#Op5EJviw621HJU*qJZW_$Z{h~Ofj%VZuot(E;|_<(Ie0|u%XyO0I6L}!&~y)
z4yULP3lTG>x7o(F$eL-(<VLhu?#XnWUOV=Ru_tC_(ebR_+v||M^^q`SUZoMLW_r;I
z@4n8+6<nF%Wz6<Gv>L0n$SmAzC|KIMCvuvNe+3My`gm_S4Ng|1Tb%JVPq?g)qG8Va
zJP^xoUGYOpNGMKTX$sr-y;~nI#4vocaxcnf6wV{(4aOE+<<O=kF*~@O=Rw{`)Sa6e
zSiaoT{B@pns8YR;zRby)oa0Bk{s9;0c%i5Q!Yk1b?q+w6pF7*L<}Ne8D=3h=!-4T-
z^<19YVeRjeHM=QjmmP4j4YSD+ze}?h^y0c>+=#M3@w)No#-6GBsI8}2Q+Howa^SHl
zzm0CIRn+b}cF(LWuhsxN=vcMUn8;sMJLOoV*DQH#m2GVQqUc5{uAw-k_!n`sdSAAJ
z+GDn039~LPPXcc6+15&2y*B{Uanv!jXBd#XV%5{jrl~kxha1*FmAwA~a0?Zo&pud1
zThrx*jL(*i)^40-s}TZax>CKvtcjN6hFh)E@G9CBSNLqd<7ACtn9)!dI8FXluOYSF
zHQpEX#|QiS`~I$usS5N0O;n_X?6HQboa#^@rwtnf>|0W%19DhUG~ml}tJl%=|IgmL
zx2JJs`NH$>$)~7j-b5fHSr=QrJA)-;b0SL`A;n2&a+m@NsbZ*ND6p*V<b3vbuiL)W
zE<ldmJv}EpPj@WX_siPr`dbs1F|s{2;n$x5qWN!Mt@$qWYmKkgp!_jJexQT1lOwj5
zaM)I4>M)<Ei;7A^z2DN>4fzxsWe1>92#O&jwpt6h;k)kpdT56fK^?p3L)c2$Szju>
zPK@X7I)XgL=}0QMe*C72MrTBr8<aLTRT=TQCgEudW0-TyeG`wO|Aa>V({SniIFkl@
ziJ$cfQ>+Q@DMraaS%`O#IvohB5J(^#GbZpQYmIG~!iuNOL#cS4Ac_-JE#ogy@jz&T
z)3FuEu32~}0MQw`py)~^!i@*VJe|{HATZ;3JX7uV<}=)J>koU&*)JbesRLR!*J;#1
zV(J!Xq!=$!I@A<Yex?3QB>N{}>O)D2-!SWlMnZ3b;DQV02B`@ZfekZvwk&<VQP)o0
zdANO50a#MBGw<<b>R@JR)>`WrTE$gMY&VuK=~L}6?<y6VoogOcT^{#N`a<|&xf5Ez
z&1@BAv2UQWwQq}>sM4TxX7OxZSW4D^L-?T;70x&jSqEEFXJ^t2`JF|)NDWiHuHhjd
z9{st{3W^=VudExOe~oHnm3sLi+TYs7n_ai_VA~jIIp^J0<OuT26&gYX6PIgChV5sL
zsk$gm1)H)FkPX@f)Tj(e0^e;=Ld<UR2z5zH1U9q|2JED#a{@WFH?u41JL)eIY>k{u
ziPa%va)o71M%5J5b&T>LBMh(wW^jVlx;XM;r*2>t-$;Ii1m|lgHO&(YNJRYMZ>B{z
zR(>2B@rH%Y02Wj2G7XWhnttfvDV{6Z(40}UA&28xX&rq#4?+Wt)4o=^^pflNLz<&N
zeU*M-WH_>Qi6#&RY{CQOvq3KgrIeEqM3%iY5K3U-N{3vaPEO&GU8ws67RtLXf_W&p
zLm@gxk7tQR%`#TYY~2&zR0kEz$q3D|q%j1a^H9QJIi`S5_uU<$%xoMBI^#BYJK;s?
z!g{K90AR)25pZLdvK3A3{$gLMh1X(NKRx;wDyrJFhzoj_^c(u*N`FBs?(*P>1^x+}
z07m;7SvE;BBfW0wSx({<qw9oRO1f8V<CnnO4l{<jrkoXXPbF%V0e5ubOvS^_Cy-VX
z73&1f@?Z0GnxMliyU#$H4fvZAtYOYYBnXAYk#dsIEQgW~@X;lPxm$Nj+?WBqA~K6i
z>tzLd*)Z><DMf>iN!kE==+}o2!*J&l$K6QWnqIEe8<yRG#TMO;8ypiF3pQ<`@a7XI
zBF8|Z=9OGh)hucGtSQ1C|I44B|A8N5W;cr&-0Azpw0}R#XG$*E>VL*Q06cMj{{j4W
z=h4G$`@itdz5Pdf|FZL7XLtYM!$-S&s@%@Qy@$L15^aCRF;sr$fV&w*|1$3>Zgak%
z+>+n_Nk8|IDTdg*X?k@%Q%q4k+EshfP~zz5LyYcTomdgzQK~4k5;D~*HBJ5s;JH_0
zB}GRA^ky3qLk_ujp&82BGyR~R31+*IA18qlA=WZ{Yk-g!iXrGzG<Yw~AY2i-!Upky
z`BYdIXoUh8`!OX_2L2cWG?9OwO!E)v08z#`TMi|z<BSA@bcRu!P-&dZbcXBF*bx1M
z2h|5_1X_lt35LgGxHAM#Vx9?FGPp5)h)LT(qRP1mNuy$S%z28<s2~V+6sKd1Cl3!r
zb!jb%429E1ghnHy;6Z)TXxOt)ni}MNWM5+0x%<EgBLcA!50hycj|#K;T9aT;M9=Sp
zp^MQ-6%*nniE3GHzQrv7Gdt+6u?=wC1M4hne)L-Bkij_zv#zSH#xRC-NwhpOQ1ndG
z55TpO)&_KC`EYgvN5DE%_*|0Oqp#`$pU)}At?*wBv-hUmi8`l87w?+qtw{a*?ELhH
z_F?NVdi9g~u@xPhp8a&*e*NYmdUJYw*gEe-&67j$!n`<dzq-6QRbQ+%JF4ay-Wc^;
z^W>+f_2b!jOYvc+=a3ouxUJe#9h^5$F50b5BWj;02Idf8gd^2PbaHwT9k<`MFI2IM
z(+2d*Ikml-(dkk2wsj7Ml8ff6_Hp~-C+za5eQ^Ta9jX4B(OL8SqJ40A+&quYF3-<S
zI|LY_=6BfcDCV^Nwsp9r#-RF*T0gW-E~3txrsBTb>7KqjX`RCaoVmWjwvOA)SH~^t
zPR;hPecn2_fN7b39jHZAgFIG*=d5+mhJUnvY^fPF&wpyDW|2&to^)FOeyPf--=o9k
z+vaOE$J&zBQ9E>SdER;p13x{2b~=}@Iv4GW%Zpa@`t<Y=mtDzMKeP{8ooCVUX$Kch
ziChiU$wd>ohgQ_8sh`!qUtM<EuztAcCl{^r^UJe~_UTDo?fE;kLTU|~s`eqS_2~)D
zSuNJ-`A^U;ECy~xBYO9yrM_2te!|ncIB&vobkqVKT-YU5uWCIntjR_vt=Grx*R7L-
z7W{e&4ZUl3T6NmIb_dF|sq=SD)$=7xA2&^njs9t!<pyqT)IN%uhd;Do@KhLDQ%9oH
z=HsKj?OYzb;ngR2#IOD}&HAIcqLpjx&UU?K;o4$CYQyV8Bp9HK2v`(y98A>Fw;6(n
zI`bZony)aw6uI0ZV*B-MHYuLozfbVxX?}l}PttyI-)@9mm!N;pIL4BfM!QMDA5O1|
z@D&B3dJ?t>q}IAhSQ1%QiA3~|`P9624j})O(+O?v2>gDUfzy!A@M-zxfN%IXo=iyT
zMCt8ssV5D*E9=+7<s+lXMUF9{HMR)S$Xxgv5JUKfXIfp!IyVk>#jiQ2sIR`-n1F6E
z1e;Fg#lB-00i)h}bNwl|_}dG(iS47GAZV*(&!f^;fzs+kx76vcsPX>=YQSwdd0kOq
z6sQ1pfr{cqsQp$|>FYr0H_gtQisF9_6#q+g>mLKf)kC33=3zyRBveC@wTsFc-v??y
z_~lvipjA<&6|RCWLq(NYc-LCZw-pt};Xb-=+nr8Dl|i5iIjWW_SjK#`Nk}#<5_Qf0
z^Uv67IGM-*(k3P!V@$0;#t=w#W%8VBOkrTt(68(&A!OmWU^-yvjbWaUn(%ZeeIU`0
zAT1MQVMr*7fF^v+NvEnSaPqMf9rZyu!M`BC3@|ALlN^MQK)+dL=R}!6_~lU5r9nu0
zE(8r!%pjWnK!qt#9bVKTl$i{ZCb6>9&<#|2*?$^(quXJ{iu${;)-*v}C2a?$qj7s+
zT2l`<cI8Hd1?m&!si^+{Ev*i8sG{;{dEc$7y2aAEK%*)uUoWlvm+GGXy0kLWuZsE~
zm)9q1R#87$WyciNsi;0%T3tNfgVhJt;rpth0imrGO?+>f2v<fbTT!{StTK|%ippbC
zStn7lh+Yyk&)SxZoinu~!P1Tc6WmhD9I7dx2;8J!`rf7=%(Wmp*kHqrA~1xdJ?N!~
zgo2gVvCKMka1i9{5VsUcMLM73x@wH;&>$I9xl~WGQBW=D8LOc*8_(h%yff`XaKe}-
zy240_n2OYDU2|xHFcC-r(ukH$)uNf;%l6DNX2IX;9}TXr{%IIFGA+wPhQ0LW!=HB_
z{9?>-fQ6^HNh_rlK0L6Alpu*1@&-?V(DSiyRNSgEV{ozD5@Q@bguUAdF~KOh+dQ~y
z<DncwR)a})m1a5-B<k_eDI3gGynn^KM~pwj8V;?Eg_R_bSMC_T&_+V_#cg?R#>z$m
zI0@_$?GWz`?g}41YXRLkYMfhqaV-E`=szD08*-PLo#vTi!~I$Ue`u|{@}PFPfp2kA
zbuT(X_8nMx^yHu?myNwNa&;*%moWTMw+7$Uef-<=LGNX^`}Dc`;$`$4OTLWC5|oT}
z*+@&I%@PW(5tN#Y9x$vmYZ!{+*yNUu@MyG4*Se<8Z-e3P)j#VEp#-I-C6HTv0q1N8
z@VD9Wl4>YV*Ba4YRY?rp#*%8pe()IIMZFQc1*fn6H!}rz)$LJC5a3P8wxhJTew!3U
ze3jJnm6n~gL%)*#^gJ0JfE$DqbghT7t5{j@D(@%l?&sK5esh-YDh<QiRp<(Lma+i;
z_uXXKfiJz&YN1x$<Wd3alzb+GT*>}39rU)YKTFg4v&8=MXz$Sj&;IjZe|P&&`_JFw
z6Sn_sKiS;f-r4=r2=u2B=uacipGKfRjX-}IfmSgB4Kv7b+3lVmzUscw$u;F~V<mcC
z%m!(`b^X#Z98KX1wi>-Ud>Y9QC>3T&AJ`~G0k4yI06_}SW3|=ExR|T1A%z;=UgP^q
zuKpU3Jq07tO?*qQ2GSvnIwlKHFYdor<N~ulOced=p(`ttq9{vH=)!QPXy0OoPMJJR
zU7dxFIvCLt9Ni(O43(S`tV$WoCAqx-WL*f{&fYFXz*7c0k~)j)e2Rn%7<X}(0}aP0
zM=FoZJo?Pt*nleIyny(Ks|;UIwLaXmNl!OSrw|B#OX)9BhMr6T5ufst;1J~9+}{4}
zNBl%DUW$kgez0#lukeZ8-j+(DM%kC{Xa%7gY-mRs`te88qWZdFH?Z>nYd55od(mUv
zTn0Itq`95#--x%2ex|h(1^X}1Y%>}{Y6JcS+s;&do;1Z>qe6n7MZ3YB=;!?hRSohl
zt2Mau+v%(C73rgOK*#f^^Z+5qev$##F%V6aRhyOi=|`NpJYDqR11T{vsG)*fPilR*
zAw1yJP_gA!?j*!Zz=>7#q`M)>ZROQF=Ho}`1^auHfpnHr;0GmMfd8l?3=?nAVN>@H
zjwq!}SFbm;^Z_Dgk-39u;c7zG+|tF_f7QM?R`h7w`F7_4f4$>;y|*i+KR$LV>_0HS
zxOLP#e^8Iep7Z4~7zNIwOGVW89{@4~UR$Icv1E}{E2>Q~ytKR$U=&J=_tAA+SoaBT
zh3r?6%o?mcRm^jSIW2iRt#Bqj3v?2ojE0=R?$ClHVc(Qv+~eeE^Pc)^3R|mY_Bh&>
zjaQSydlWI&wiu(r6?gWd9aC{<fAyN`!tI)xeEpW!JpRj3v=>=}<z)wItVo_VQXMrr
z7sr1Q%m3SWqR%{N2VsHWEwI1aQl<LSoKtT@o7fOY_IS407kQkFA<_=^7n7CHIp)Vh
zu|%At4O*wJ1WII>eoO|E&l_60;rjwxHI|c7I`tPnowZoC;GKN@1&l^&A$9_FTJVFF
z)>{Aa7y4<h{0mru)GrUhb-KIJLs)XG&(EmZL|i5c1TEy;Yat~(A2OUo`&GZFo*rS~
z1*wOTLQp>lYj5dWC-Jn9y+Y=F@ds`NqugMARcgPNz#kCU$L}>@ikx1wo&q<f*rh{e
zuHNCc!Z;hz<(c9GThVmTYZs&hx=`C)t1I^Q`1G9|yi@zo!FXL#UWAtiwxRo%_SxI!
z84UVKc-x@_ZU0W-V8DK<YsRNwCvZS;OHCVrgCgVL5`hDQ<M{W>_QCg9W+!lR$i{{x
z&zc9{ccPt#pKpCHz~qzy`9(7TS+lKM?X0ig)~p`YYBLB6+lFx886XTjLXb!L_KE&>
z=V850VGT@&k$6mCD~qTGuy%v{bbRQPs-6&pPxS&SG=L_Af7eUfeR_6qdZ<r*^YX`N
z_rW6~Y<%|P`NwpW0<#N7r>X|phw3`fXZOKlYT)?%GD<PhDjk<!Q?7V)-uic4@d;Nv
zx>WM9Vj|UHEni@+2xFCs54Wiztcn^h<qfQ=sD#?~Us|dpRNRR;Bn&`pK<fxvqV%sx
zbgkZisusv<jA^&uc2py~{1mi4PSPn&7YNYUO6b14Db<d=D{yZCT*qy0NlTs9u@YN(
zS`Vld^_Rh3aUW#hf+`241S-9>4|#6HxG_t{z@YNFu~iQBE^6@x%u<2POrKJ(D?V{f
zkK0aHV~h5dM(S2qawX6Qs@`$l@Fg`bvF0w-yv&Nb)IB;rZC)TVfH@)ZxO`yT3Wukc
zpmKOXdxH<wvWd~V`;aDvoQ7U?zSmn@TZ$-&U7P*?O3gwDdH3Y>1TN`z`4`36z;4%e
zo<HBNmw!GxZYrrAf8GiF+&Sz>?Oh^MWbDsLyq(OalboE8)R+l`GoRvf=M57g3Oh7R
z%@5kV)=91zQ8<Lqf~-iXmFDSD_Y5dMEICb#TY*)(uc1JZW)zVs9w`Pc9tSps8a!{Q
zcj%xAN)=v-sMH|5u$`Yy4l0IptX_`p;pG`Gm6=!*uBDX(m*i-KSCC2at|Q~mThF#1
zvC0-0g+|PLGM(Zks27Qud|)}RA$(L!)My_jfK(8}@;)jl{4L@0aem%yy*;}?1Dw8T
zl*9{~0pBTfKd7pVsvssQJmu_`HMWd|3lqfD<>u|GP18KuP+v46C-)9nqn}A}dERt!
z^AolN2u!9W#%F?9ZvLk<VV858fPipoECMo0Hb1M}TSM}_UJ+k|KsHnr^B4DBU6ET?
z?5?V(d**8HxS;5UYK2%lcYRdJSGVWMu(G%{tqnCVvN~E*v-lR%1bKqwZdZYlZUOeN
z5kTOEbOAZMRq-O#vzCM});M0p{r6W>fD~NXjCTz3&Pe^I=;ZzP$*iaVwLnV01xlmG
zjQXC^K3%9|jUdL8bO4C5*Xd}W{z-!a{e2gXWIS@aS!GlO;heckTV7VnB?l@wb$FHW
z0E9}@zg<FM{C-SV>^{k-0k5JgL{G0Yba<F&2}RCNv7zK+I)j5lHG8+AwfH`{MOd=4
zIGvWJhrQB2)f;c$5Mq1~$EUPb9aQNM$I+aB^o}!7%m#A~Z~&u?@yuTgOngcW5N4Wb
zg0_yTGm3;$)$wn!&bB|sP%*u$XfO9_oX0opu3AO$Hi|~Xb%^Q^j)y9Vcs6Oja(oSq
z1Y(*9-tbo_FcV+muMDFueXw^JdR(E-#s~jcP$lG;{5nJUvZ|W}H8x6B&eOb1MR^q#
z6N++8x)&?7;(j&go#m4`=+))R5YhSSUz2Q*4*!g3{+EFN$81!5*5KcNS>pe(v%UR5
z{oD8d*!wg7_wVwli2r@kV2k{5+$;X{>iE;E<4>=SKfOBs^y>J3(5oZpWnsPp2tNSg
z1D_1%hj;*_30*S&H64Oqh#Fe=^sIH#=^Wd>Ao(Q8iehvh;sqR+5dDk#U-$>bB!+*O
zDpD5yWs;2H2ct7-sf*CPIPP@SDY!U=e|-@9rmvg}747cmqC3lq?&_ku%Zl#lqI;y@
zyHs?rh=&?^i`2Wcu&RoxA#Ns>Eg!aynwQ5H)N;iLf2$ad8ZSiC{h_w&!gqg_d;~0f
z#dQe$BT9}37hTd6C=Okn5da1TglhGIbQM$D?aw|&1kwF0_%kAIIi<cT;9={d5CK-h
z<ZPPH@_s%l4lp*QW@EVm9I%Dsm^OS6c5Fo&u;Qf!U0;-fRcrH1$MtN?^7raAk`H<@
z8KndaHJc*DB>%hKh#)0hw9|;bb>P0SKWae@*g%}o?L5w}YRAW2b?r}(YOb{z*-Nd_
zrWw8qz(yAJa?&mxPeiWh1Wrl7lquu`hheFImH{Yj99<gf&*?8}FlrDVb^uS;jO4c$
z;VWRq63iu0YISSHcDr|Pd3VK@ckkTt9$^cI@3F0lU!nKCXM9KPdKHHPYi#W~=)uSu
zI)?;8wg8ZT!P&r<;Wj!|gj8L>Egz}Rz8ZEsHGDYyny<fn8%!^Dr&DZ@k1J3I*MMxs
z;3@*FHlB6Gey-#6*BktgE$g4V>&QOyUwiAHGEF@{>*{a>HC}clKk-pu8dKMi(Rk@}
z7ZQDG@%T(H3*yBmu%N)-$Fn$!N2>e5EdbOH3{G)@6ty9HNu~*q-b@H5I8;Wr3E9$^
zWMY>a+<q7T(p2^S2C~b15TdJ5-it@-^eFKIjFDQFh(@Y!7~VA~F;P~FM<dX2lIz(C
zF!U_Z0UBUIzMkyMNce%$$@55U)7G}}G>w>(klWHdxqSNy0Fk5Zk2|1LP@iM{TmkEG
zaQ@Sox-7@12j6$}OJuPo&hN4g698t72i@^}mV5*?9`g}hm|J0<7}O1_?~iH92Ru>K
z+m5x)7Akc?pKU)pL;g*TQ^;tk*D)-=({*%DTC<)7=m}DEnVHyx*=-eS*T#~QqjVSD
z!t=~4PJPy3+V$Zx>kpU)o?Cli;A|XBZzr=H)~BG7+?iIosuwroRh9YhM6Qxqm(NmH
zj!-R_umfzi`8dh5L|+F%hm?v+&Kyz>%dO}z&(>#vFEg9ww@NDg+J<5+qvO)>)K2iY
zviX=cLqH7N9eNS{bqw&m{Tc_jxre6?!O-+C8~fQjue=)m`|9otEN#s{8EPr51UfW$
z9&-^|%ksg+05iHIXs7q?2i`*5T1AlCFa&!`(W3xeJA}=E%P&`%Tt$&K%@kn($7&w`
zRzDj`6t7%wYN1xYFJHifyL~)N>I@XulBLP`T1pcbO3YM_I|o|Yn}U;?6pA)WU0IDH
z%Dhd7*axl<f)r?`YJk;ky?o&`Mn`aE8V7~FDOj7YSc2sZ?UWj_Cn4XpPudq`U#6V0
z&LK0b$6cEE&H15uaddkAz1OT}8NjFwrg?6&OH8Z2d(aC0jFyAoue9}aWzY;zLHv>Y
zcqFT?*%!lvpEpkqyOVr0syP`VDp(la_NUQNoQ^noL8AUU#k^}Km>{E6g%-Xpy$SAH
z4F4f8{~AH0%WXUuC2=;NI2RH|>j+Zza9Nh>BEpMX%0V>_h+&4hcs*!YY?Y2o;b4Dd
zxz1XZ1-As8{LD4M>>k7o3~I;iSD=#ft5B+|`}ftG6n{{ggd|MyGRNxRB%rl$t{Shi
zdr*mC6DrF7ss%g8zfW#4z(XS>v+HcE5qZ>^5b9ufF*G8N3c)MZyallj7z&+o)(bY6
z-GIHU!HEavvImzZpt!2huflWMoCu;Vzli26sgmImzU(TQ)RsQsySgtUN<k27Ns7f{
zE=DpIco|9BG3=z&(l{CSC$|_Hj;%Iy+a9M3>{Z<wA+J8=xQNx-D8Xw(&Ykt}!1}rp
zu;{ocx&nbdIBybgs;osSAVz$8tGHE0O<FGy@*T2etBvmEiY4dFH4x5#JTMUh`rG2)
ziIL?E*4hllbm$x(P~UV*lq|x3liC6^K6M2Z+fhr<pEL%I{$}lPKbg)jEi_`mVM>DU
zBGcODOSx^j+*9{w`Tkj{X?3_)X;~L@8<wxD+wJn{T%~a;8}0#rvrtmhbAdo95BGmD
zPX+CUtxCf3_=S)$K=D@p{;<2(9aHW?jkY00fZ3vaHbqTUZr~56XWf(2F4p|b{d>=P
zl=zp!(-Uy&?zGM?*d6TXy!jgR-JO+sT2MdqqScIe`)ydwVC4f`VU|?o*<Cv5eo7Zz
z=)_$){nPH9df)w&-gnJfRt#eAPJ`I{ltJuS8(JF0!RcGHLWy2!g;uR9-chkDgUD%W
zzD3vK6R-$%(e%_*9MF0DqV=2pwRv#RI=fK+{z0)t^ketc<<XIPexH?ESEMr?-kSE+
zdkvT*XRX%xZ`R*O&9-78k6_gBQ};j}cg;qY8kIB=_zWv{vPbO)p4h;MN|iC&1Snvr
zl^Q*|^~j+&w(eG1Q}vL}lGR)N`#MfDtU@hmT3g3F$TlYhtgy}IcC#9M1#&WeU8^^k
zu95$dl0E59CqqD(O*Pypx(iz)d>VaI!2i~)u}MExyH`1wZebV>r{+)nY?^*hjegI|
zM01u!quoAgAGa`|<gE4fAG!z=8Y>LXS_CuLyR1RYdADNgsf85Cf!_w{6!ImP2m%T_
zbU{F(kF85w)kXLh?BE}>x;nE=bkMYqT1~N+FyQ-YY>H#br?<T3cUfs?uIc0&aKu0g
zu&*<Hk3v;o>8R2w!d+-eTwShApy7qns5S~zOm3delByZfkCjuzU;p4dv5o4<QWuM6
zY(Fu~;H!2N<-}4??WxyYVbaKsT#uMGP8>Fyfw#Of=KIscj9;xVC#1<IiAhPMgmB0K
z1x!4|DT5rKL_UsT&@x3vVW0yT*$^`!ekC}~GqE$OPL^}>4p{SQOsV@r!2T&K_H~el
zUtzmXa<sTWl})5kCKc4zYpdNtr*9#dt9K31YoFM2O(4!djR48mSeH<M<``J6gX6Yh
zgfR=SVjVCH(5j(CKFDh5eLGDkVkCv6$QD(G&)1ct9WG@h>0P=MEq1JeortZ?$ldQ$
zV><NMSoJWZ1&h&qkkQ$+rXkJ13T?^?fge?ZI^5Nk+p~>_t?kwV=)$&sz%)Quadu~-
zSZ3j#Rw@Fq`aY`6MzIL&qClmaP!g$a+1Zktw{0l}DNLz%pX?S1x{r1HaUV1SAypR;
zV7pl2@yi{>Uw03h2X7#n@cakO1G{Y$1yOQr03O>i9d|oHtxBk+Sr>f#^LgO0b6enI
z6^%&QbkOaaWwn^!H6(ZHA$VA2U;2a<Iz2k7`>&%VuFz#ZZ=JMWpDMxQ;x3|2pl(1s
zb`LNluk6w}lt*@TsqLVB_C^URwCNBvr{o`S_hJn|B$`UQouogw20E74OY_n{Q71cf
z$JoAXFyKz61h&IB-OEm^UUAx02kKVG<Dx{sflZG#2G^|p8G<!uK~+W2rZ!1Ad;^u8
zM@?TuYShnlxEj;`O^6xshoYEUVrSL=XSts%+oyIG#e)xyTFE9|w8tI3p_Xej=my6I
zn*X;NANEIik#Na+Y0@iB7-l%slSaG0T1*<n*20P3ZJxI1hBRb6=?<>x2*F@|*#SPE
zMSfU)v-P}DY<Rlb=9h#CI*!Css)^lckxKOpMl0YhJBndT(s6TvHu$~5^r9c(iB3hG
z>pyQLA;8z%DxPD3iqwH~wOPkiA50(P^=sScQ^6)IH8rhjBJ#~qC?|M7IFr(UxCR7B
zr+GI41An(>>J}@Hle<x8ALS7v)O8PAuP$G|R;O8esepKJdU8U))Q00(19ErQqyPA-
zbP=!!IdVajr_ox3<-6S<n%(C4>rS`pyKGjpu3x#bH>RqA?mp28Ad-#Pm&kELx(0zr
zW4#l0@cnBFTBM||qj+Zd*uMj}CDpF$%amaH35=JfOu^tWS1``{fZPWF+3ZSPnGq5?
zXp5cs6C<`Yv~`DVy-{4eN2^*7d>#yh(qxhsDPe{2q;wm4q=Xfh!W<_Pbk?%QImi*x
z2~9!8Q$+LvG@<ti<-ol$S<!W;xH#zewCfdppXE1@cBg+G$<j$W4n+l${#?!RhN0^?
zs)2yehk*IE6)E8rVe1-jI&Tsiz8$mvP6@8cTP$vgAn#_hLJZRdD~KxxV~=sco!Kjj
zesx8m9^4AGEu+WW*aAj?$ZYsH=@lR^E(nZ;%aCOAF;k;=O=QEGhw9GmG|X41CjRR8
z=v|!6+NW?npM7N?>@J>cOpgq;yQWf9a^rT3lLFfGTXN-giys{d%94BpgF$A)N#c<N
zne_JB6enNwjZ-nFmtp!BZ4|}GvQNREU5k{0s_F#%yd3YmZl=Cc6vpe<IH*}&vzd{U
z5&UJ%*bTezM9K5u=^Y%pTOx?~wy9?)NVv^w<F{ndW;~GY%5A{E!I!G<_)@v0glT|p
z)Kj;GXbUf*Z-t22zYPa=q6GX>EioJRz^GRu-!*$Ub*zKL+#ltEtgGXEA*!svqVLp2
zNp+OW`V?CQ!K+G!7dHUHi$F^<B8MSZ9$js#_xp~!-5gULtF9>1b7(;=<1jADC@zpO
z%W})%eMmFM^`RqJkN!#zo%gl3nDnjX0QYc5@?NjP7kcd|DH5xD)_t{A-b<q4JH_`e
zE);c75#9s*WhtE+z~&_r_->vJlIiFc!S#S+qC|5OaK5qfxbXv#QgSwG80cdA{;6tV
zmX2@)O>DGQk8a{Za;<azx-|QczfT6<rfrTCIUMm|gmOy12S~OH@gAF#J3{t4nRRC9
z@`ERWl>gK&uFAk_AA6=T1H7rEtA}%vkd88Ze4D&FaEy^UG5i9%<)R`@PEW;EEuFY}
z@bquj0~d2RaKFUyg3Be4;Lb(!LM(`o@y*sU%9*hlTkj&^!8cs%f-cmNJUzF)k*eu{
z#okg@JaB|6FBNtOZY5>K<5Ne>04ijgK4o5x0TcjxN<t-kLYdM09#1i#t$F+j{epFM
zm40=CH2`e$y8j8H9^+AwE7^54+AI`*qv)FDczdVOtZW9Z7_B9lK!3x5-IqC;mV5%m
z=+<`e<d_P+cT&Z(VUucgQ!w|8;CwLm5K~5)<2;{48_9?PB?jWsMNj5oJd5d<v0~Qh
z#Hyc7bAU=_*M53=fLoX*{lo;!^6P?l{g-%2u)<ADky7y(0e>;ZK#8H0R8G;mEw8+p
z;Cf-x7sBULi#+0Q0Sp!4jwot8I+t{IS!5nL!ZuO=*oOM*B^u7BsQA|L1F1$j9yktE
zum(gyRcqAt0ca6J^hv0hI$MBi(Xe>RXag3&b(-X2B^?KP+|digtb=*NtP`Xgu&ts@
zCb+t<Il(&%4I&Y;SXuYJ!UxBzx;JH>mCEoT*nYOO6X1WB^Z`Xav5U@6orC7_ak+ya
z3xfYG_jG5Lq}-9so=|V!MSoS-ZZMzJd~IO#)Kf~z$0K*}5t3IbE3jQ(`!o(di(jaU
z?kuenFFjAnA!%k;#5-6-Qne|Z@G5vetPA1X2PQOX-Qq-XA^_Ax=^w?;miQ#oc@^!p
za6909R2)1EW`VxGjhZby+2B&7xSr%N87bPN`wn;AaB4j(HT|{KICPH1pmkz_R%u<T
zHA<T$ACI(C3oAU=RTth}6FuxZt%<I+cun-u-EB>z+Gkyp;Ju<TGz<0LndTz{4g9Xp
zK3%khC;tx|bg2dk60`<@&XEhCaX>U9fHX@#NOs1B>IlDSQnQ%0@$Z!z_f#XcrN;~$
zOx3~bq1X76uF1l!$Mfe5Vc7^i>BzgYrM2{?Yfk<rO;_K56{oAmuxtpQME1(OCXHqh
z@z?C6bs44*Kng#L9twYP^~q~KCtH827}gix3>w4|;=iC_{Kpjk{|5gb&#L;@noBl@
zgN7@iQT0anUU4j7qvB@B&n|;vu8JHEP(?ss$5fON-W%o&sPvdw0wnyibpS%@(^8+B
z{Sc8J6%51x1Z0K)tv0Rr%%ho?$57eZS5;xTAPk>i*tR~_3keWuPwSyU!)HYyEIfRj
z`a9HRx#I63E|xiY-UCOl3r!YkglwPk@faziSqrXQNPwX`iTCeY<e#d#q6v8H9o5Eq
z&%Uax1}<_)AFk6GLgZgMPi2EG6JVr3b<#Cv9IyIpfUV&M^l<h{)^QXBO_g%Kgi)Tq
z2QRxQpHCOHcYgn!sK<(}1qI8@wOJSw$?Jc94=;>P_R3v@5)8t9v>vUZySrT_96;4|
zTGAX-m{vd@bI-OnL(-PTqmdBm0Ld|z4#@_uzLktNG)B8<$(sW{A!awE)^jPQxt64K
zsl1iTZsbb0@sHoc&v%_Z=T%zi8daR>#dIZHBYfckm+ez7+Gl#N?tZ!cS+0^EzPU>7
z^wHX<1}?HnEht%n2T6e00!P`>V%CE4I&ijkkx2Y2EyEPKr?QtI+qZO}&Q$Ltm-!E>
zc9Iy~f}vcj_5!eik;K|&U(6aBq!9)Tzq;ex;KIPdK~{td21uC~$#6b`fZ-w^BVIFl
zPcVF9s2z+lpMH>`Ow{<$8Q{O>$@Df#$KzxG1~T<^JOrKZg!IQ8DeJd}wLI#v;TL+7
z-$0x!Tn`TKYM!6BTjz*2lxX`Uar25|Me)QqBd3MmoGJ#RnHS=BffE7ngygA`ilL`r
zI!&C_q~$BMG?X-UvL}$eDJtfQ9>;iz(90psRGS7g#HW@U{%#NiHkbr~9>-aqn!!g#
zh74{Zelxrdgh$dDCCNk)_iIJU8__6zpG3prHbc*1H8`|SLSv~~G`}H6G{N1)jmx#a
z*_KZ~5!;L=Xw(RD=Kb@|8}}?g_P7nWdO}C4Wf5-wMf86cUjK^ccx4Lf5UDVQ{k?Q;
zkHTlCyl^0QX<Bsmxq1}jkIvO4bgNFbjs8LCw1vqXorB&m_sFAJ86+*VKlWYH>y~Fp
zaMk|D9F;cuo1-yHkhj3&ps@sc>n2%O%Nm!+(G=1I=EVHKzy+NETX9^eK=mR1VsN<!
ziuEfshqqp!!eo5DbA*ATVRlPBM7KBbZE)klTJo^q4=gHoYH{e%%WCP^GTWCtnHGt;
zP^dW=fDhC~oQ`UC<)A{@{#5kGfGWr8xpmsBXsN6`_}w7>-Em4#;4m4%bOKWeHMB?z
z5}H}qgtbse3?kXVC#a1to6|jQJ8#ODvwgb=Cy9uL{I}K|RrsrzCUr4eQA(79ZS3A0
z;5Sf&qC3CeboUedWT2WIfe~_RfxG6~JWF0J<k41w%L&>~O~cD9sbvf5f*uy$fIo8T
zS2^iC8VxDC)z>@Jb#^f&&wALzrqM6RhIDD~5A;`p3~)5h`s}-9q>a07HvVZWJX1uz
zbr(^j)33uGP#QXiJ<OqUl@1$Rai*9kmVM47PA)8Tx|7rXkkz^vJ@SweW}))s)0Hj@
zRTDJlcgZ>?8J;GXUdMmuoIn8iGN>}Ro7SPcFLW%e!@0Wt;WH>2tQjuUGJNF>9;yWI
z%7LXKcSxR#ZK*gFPT~RpvhHuiwBM!QE3Ox}{pt5BOiaU9>g4pKb;sM(M#NLqQpb;r
zU?4&(QpX}h*2<~Xq7|UkF)LD<`imDdD1V4D7P>URs4I~=<NOiEbCufzKUlmDDG!|v
z=7#S_t65lL|BZ7hmcGB@8F>dHO7#h$=X`(<Ib)5%9|-gHsatK4(uQ%0S?K`iD_4Re
z3mgHL7~bfKvdM}jrDyYpX=BZJnyp4AeL4xPP}`OxSADVNY@xs!X7KD1Vt8ydUpLz)
zLE>oRCkII`3|mkAh2>24m)7~I8r8++`AJB}2cKHFCcB}b-JiX@7THikwE6h76SBI5
zz2H7Y`&?lu3alFT5Pn^_G%^*z>v^8UgV61yd#M96)wNXr{#>`x{PB0Yol}`7UrwBv
zOzGKwyPHXh@Woeip)w?VHUEk3X5GG={}0_wn>pe;`Z__KgmDi2QsSk^g4$)=`Tm(b
zYK^U9(UMLw!`EK;Q-3s-JRW3G=6sg%bebA2k4E5n@w~v|=E_PHPcqb(rc#{^Wt~(B
zzV2~hP49wLEVCa0%xsdoXh4HMY0cbaa$KS8Rr*6ib)fB&*(-((zhDHBu>Y8qb(bMT
zc%*U0P1IaREv=k^0-c1i@k0B4u}0*Al0f<Mr2k=+^4@Ib*^2YA2Y-@he{lTUE027;
zN=G4s{zUn!a(DjNoBqiXR!Nj%k)<c8Be?HH0##4L*;h+edbZ2tC_NBQB2t3Ymf{Bz
zG+@pr5c00J8eqgeNaGUk%xZrTt;pSDoWvOg<rripsR!s{Xawj1=F%{q_CYNV(K2Y5
z)vEaw-QxmBo35t04tf=9i=5udz#gl=i)BHY9>CzuvsskYl_C}7O7i>)k-g3O)q*I&
zUSr}Vu0|-@pYNWmx+Su~#LA9^d9;GwDzR1T&TXucNoke_7)nmlr*yS+7sCurU~8&`
zkpE^o<F2hQQTR*yd6(xn&Hhn`7gvbe&e&CGd-av0a;o~~Cbgw#;V7vQ=DS5zU?P1>
zL=k(Ux6a@88#`gJAsL&`eiIDM$8;7lW#M}T55oF?Wb1y5u&xpOw7u@RBtiIqL@8|4
zR53uR!&auM74uD?ZfH0m5d=EFcMl9x&sG~04(Q&!&@Aoc|NSfI{OQs&3cvFa#g;30
z5ha{}Xk0CqFbsly--KubRYz!FglG7@0)0kJmRj11Z7INyt>7YL)p+5WbNEN$BlNG_
zAOGz05T=~RaB+Dn#D_I0{DU2!BPviC0$8A|0l=U96VPE_)Co&gRt1mg4+<4r91|#U
zG(c_@w#7?nSy7#?Hw*oS+GX4&5Mt$*fOJshQb5wIp)p#Ad#t|t{n=LnqxvQ;&dA&c
zM%tPkq5HLCuJ`$mZRaqfi9gA%X4kHfAG{Q_a0W2o<O3J#63Vy1^JSDi(_auA%Sfll
zATUg5A{mHhL7-dHz<F|$W&_s{`t2yK+f=hQ%DAl)K;?p;9qmX3ahLJ^071yA4NFTK
zG;^1O1b?@eP|vFjTrx=j^2tIr(+Q6N2SN3q@kTS35r%+pYvkY=$-SjB%#8vVdz(oH
z@!<nVlftpzgTgv8XR7xDhz9(8S`s;8_~+(JIHj8}<-D>fS<5&=%peHQ2BUD4CfMYU
z54WFCCJrlb92U<;gD;u($pokhgqnQSK8-edDX8?+KM}+R{#$g%$+%XxTEH@7>cfEo
zcp(uU^-C8<21N+p-8o%SS?64X_R(8FeQTX5XKZwOgss;?DRiY?GCuyAS%I%9eGIe>
zi=sx~MPz*()3;nt#2nau0K1zc;|MdUs%b;k87|h42D!X9VEa%@GlbBF4{{_~&p6#r
zb;7d+sh12zIk-CxH2bbtKZL~||45fWh@znKE?n&{;4i*&jieW{i@NLVXb!8%x)Zp*
zoFqHN?@AP079})RhR6Gt|Dhi|kDCR0aNaMb{rmlCe`kNI|2g}B1YG<358%H$j~;H@
z|Al{UKYaA?Uv?hs?Cw8&_-J=emD_pn=;8jqMBATp5LKVKn)@`0{$<{qXS4Z&a!Y>y
zC;f!7yQ_B{L8$V{?KHi*o<+NAmo|6RPDQVie0r4>(c2_Tlc;ucbF(#ue{QL->wcx3
zZK$*xb>h*77}3i*v7%(7bTY}KT0Dpmg-gjq=WqzsB}A9iVs<-9DAWCD6k%Hc`$Ac3
z1t1G+%%*8?u6YIk$x5@R$mi2O<=%pvzf%P38UuPGpxNYvYNLc5Xl1N=95P$dK+N+=
zG99Ng7?xxNlMJ<qYG*XcZ&)iiNC~?VDvc8msx}x3u{62@9CCSBh{b~-?TXIC903sb
z@(=J6ubi|KA&?_P6Cezwl?7OL&Osz*WUAl(C|2SeLWxxjM|Ep0jSNRkcra(rkuNeL
z4tOw)4f6h6ot~M_7<^xCPmYj3WAzwK(|A;veZc*Lw(ZGSvph){CLb^-<8cBbgMVLU
zDQ4Q7VdTp}JWAE9vovl*uafEeWR%>hSxw!ML4Dk|bcXK<^_Ncz3AI7q7Nq%XpuR;Y
zel^fBWHhFAoE6qQ)l@X}60Tg44`(-Uboej|Gu($%GmL9GQ@ju!M+8ULh;(n-ov3qq
zbn&iv-ip+}&(2SOXdku?qgOwvA6wCR>osKeikc^fz?oj0w_jaeoSt{0|NPHpM^#u~
z$Df)fKS6V?A2G*Mbb21O-<}<}RXeKT^XAD#8(_NHCkMxuhlseWT8U0hFQVi2+xCSj
zc5&Lk{<s=Krs|r}=~48yb$;+h{n>ogK5k$9guNcMFHWGlBh_CsLe=8I<#F>oI=ehS
zJMFY0H7RK6u-!R0ZnodH4!6`8RKHQ{2Q{mx^9Fo37Ebe3OAQgk7wUwjdDuR09bCYC
z%)buQs;SW(H=@p2>!1z)X#LnyvuU3H)PMz1&30P<eyIwnAEU$O+ve+52U@EwSr)Y=
z2bbq9$g&0t(YbupxoBTpUbLdur>BRw*Z}<AK4<|n<wkUT+QAi5{8K~qbJ4`^RV!+_
zI?v$WuP!@nT)6hhMeF?h5)s_$(VNqEYF*Swo4|U(T3}-C6PPxv(&_n6&@QY8?m;7Z
z_ok)3KZixdRcpdpbkyn{T-e1_mufLD+{s2Kt=Grx*8o!w1x}%%ckNEAu6C^r81m36
z^!%==y1m4?!&a%W(LdX`dUALhxTjJ3C~6-5(1!7Id36vvZ9X)(d<SoM^*Q}Fpg^7<
z?CeK~I&4vpem|cMI0EY6pnY+nQw$e!e=zBI?>73kSP7)l<gZV4^6|Jon`8VQ5RD%}
z1^yPgiBv!F=qgt?@_O7bNhF~$L*+DRS|KmN36P-h=V`P??XNKq9s~ntAnLCDMZRBC
zU2pE}-)|nAo}a7{bn-wEz={UdAbTm&>9br-p|aTa?oL#@5SUDv@yGw8>feL^?BahO
zs{h}?C%Elqb$43>?u{Pf;Ruvw?QEh*S?_k1ScQ&aG_;#ir}G&UgQX3W`VoQPFpdtR
z=W<ipbjVGBZeeXlaf}c5A3c7u#!c<*9PH6Kar`RgN|M;w2lYBIxQgG!>^h=g-2Mn{
zHy~l`?vDD;?)HOS^`E`%{XO-c2iuPysQ*0NjvuQ3>~Ht?)qfssCyyFj`SH&7WA)XO
zo!uwuKk?3kSpBEBv)@zy>F+%5tN#pk;(_{4vZJ2Q?T^EqWGI!@44_NZF$`dD_Yrit
zyZaCZ@Nl;WT|U@-0t0xoJA4EK*d6Rk<tKZ4(B<R39T-4w?-6tv?>&S84EB1^Wq<Dp
z3}Co79Krzh28mSOeXx(SeDDCeR8z(kc(4t_*?*AWEFbit%Lfl)T!9CVA4=u;;Xcmt
z;RERM@xxtQfrr~LoaAAGvwYZxF8dE-T!Dv=2U2-&{~^wD{}BveXMYD*V1Ew=@MwR4
zv)muT03Pl?!4=r=J&?-1M-Oq9j~>AQo;=#Y6?n7<0~kIU;4B{vVE}_iPjCeu_4-oz
z!Q(#8<Z*&~`S>x;@^K7Zs%^#<c)X8i;PE!D&g0!Zsoa0k$C*4ya4(-c##ugzq07fl
z9^eW**~c^RWE)rK$!<?7Ka7VslX!r88TW9O@e>%pPW%X0AbyBvAl}2(iFbCT@}M`w
zne+y@m%Sd&viAfA@TB($SD^P0&p>YvSEsiVOXdB3jI-=N#=Yz(xB~q?3}?5$i?i%+
z;~D7h;|la2>`3Kg5aTQdk8v*t39i7P55tKEyEx0iHlBgOKCZyv!4s+cD0zajOnSJN
z$pBX%8NvYek{z67vWI6Nd59~JJldAZ!{HO0<*<i)IUL{$42Lj)-f#zJIo!iDFnowB
zFnsh_UyPl{Fqp?X@e{m@{TOd%(!;yB-N&1`JHWg6Ai<ltZ?5F_V_1gm?RW>NKz|o$
zLb8WcVEX~mgx!Zo1s?1pP1rZYV6O*VKG}Qn81Le+hc|N&<6Ybv;LY6W<6V3-#GCn0
zU&-y=9(1V)$u?4f;U3b2!7fsPy@yB>b{-%Vc=QNq!b43AdJhwv<->jt?_!KA@bK{y
zyo>ud%ZCq!co%nZ1s-mjEBPS7Sw86RAr**m1s*)!K`OA1vwZO25mJF&T!9DMh8R2=
z;4B{vW4wz`a0MRq9^+knh_ih3D8ak9gDdc8PhZL1{Q=H$f4GZO;0dn4es3G8z(btn
z{-b@Q0z0?@`+J%g44yo|nLOFYy?nBbvwX5U#JkwX6?l^18F=y-SLaD=uH@qfIFrZw
zxR;N&ah8vFA0ZX!;|e@Z@C-bDjH~lFHpHO!2xroJh<n-F!&&xr61<B;T!G#I&p@w-
ztJ8a;ujGUH5zZujh<h3D;Vk2weWU_IT!DCiXCUt3>cmepF&GYZah8K^+{?i}uE5~I
z0PkXqvm89eGcZVS1qOX{CHuQL%l<a*Wq%)6p#R_@Qh^v}*?){@pr7Ch^!tVw40mvr
z!#&)~;X_=3;iEp@#V0t+VGqy1aDXc?9O^5%pX}f)lReza<RPv=^5_9lfhRc2q=#o9
z8Q=;e!)>$!xsP|v(I!j&bIU`SjFj_iCV@+KedEOo{6me);kQyLdJe7WKkwZ$h9&q=
zBQ^D(=g%M4qyJ-AiW+?R@+E!=BU3fM1u}AU^oyfiRHZ<<_>Wfp{7XRp*Gu!Q>(ATA
zV*TItgT397{%?P0_fP%b-{a$}`fB|;sQaFv=B^P|-92a72@r>_#&J4|1`xuYk6-@N
zYVH20&Q26#qV)L#8oSS^ultPJy3ePp3v22~1<Z=L)%0(Atrx1{R?xmlL!VCxcW`?4
z(|P;#n~Uhp>G5IfJfNpqLv0*N_N<Tl<H|Uc*h@7(RT+mvQ}bJ{j5E_ceRtA2XXTl#
zlS4I^qn7(5ogC7tkXr7JIyuxsEmF(fK_`cczC<mzqE3#dw@fX!icXF;Z$-7-Qk@(s
zmX@jI{xuzDkO8UN1zY<Yok2<d)+v(EUOtNddW#16?l9xLq4D&p`1u!3WYGEuuG{L~
zHqYA7JQh*Ri7~!E`)ZyQ=~b2tTrUDP694bKSDX&fLk*3{>K~O=-o@#xGfO7r^5D$~
zA#iDaI#QHGHCiqsL;F4*jV`Xi?WvFv%1>loN1rd%1l!h2zaN3$)PmoS)tVitC4(aN
z`bGR-VuaN)c9C<X1aGvQuj2mutEu{S5dE6>qI?3cS^*0y+XS10@l#z)=m{J<I6)jj
zp3^C$mO%uC-Fj5q77&ZR<yUT=9(9j8Kb??XZ^x;uej_}qQmy0WUw-Nyowu;ZXxFKg
z_kK-)gv0dIj+W}4T)yp|o^_Zl-}@hLtp5U^68}H?>#*DZd)ohZ6}SJu<NqJ-sQ>)Q
z|Nk9675x7;nfu?yO4MzRl8-T@%8HJY>v5cA(et8zJ<g|-f8+md4U(6ijm6je{U)^c
zIhp*Ot>`ne`Jc|{QwzI+5&aLd&acETLt-e!zLZSV0hZV`G~dNUU1o{#gng2c+F^=`
zD@Jp=#~AaxN;c``%r6aXRjc$e_80lLJ6NTcu)k=7yMtAF5&Mh#c_*v%LiQKe?ap@T
zY6cjmx{6(zR3GYIWa`3vNJh5}Ns%>!)FI@Jl2U$Z$BP8B5Mo(Xc?<=S?y0|DpIk<-
zlPsCWqv&kj8!5^3Sl#bT(bL-6>$BsvdW4=W>U!=*m?iQS(??F_>jtGC<QPOm2}VzC
zxU_|kKkVu37|A6gu>zW-U`w0fAlcah6vW$nt}c9WjbKthO7M4}^Ev*g2jI*abM|JV
z+rW&?AQXjyP)OY{5*&nnh30P&;Cdt2yw&Wh&Y>cIxKh9p56B-K2R2Y5e!=Mxd$;P(
zQ8E+YMQdG%#F8ueWE2zO9UCe~l$H`o4wx!h)g?<Abiq^83pdDdhS+l=B-ih{f%((=
z=>$`M!*P-6FPJ+tWT{qQ6<D7F{fm$${(g$lJ40_j;i%tq+J9+9wVmks^QiXb`1EzX
zF0O!sJX@bdY9VfA2>|{!8$qTym{Tvw6ekc*-+wKK1^l-00gH9&%s~PH4lo~%0Jx6T
z5rSZKtsN?T8;$YVEfTf(>RpMmE44Jg!jsrbMrrZ^UU)j?v*;$DzAvI@b)2XOqethR
zi?9AQ;wi#kwMjjy)oPQUw|}X_R3F!)-=fLSJHOOTxs%q97qt%!D*3@Kwu{BmVRU({
z=v4QpiOoyB_Ti7UYpfKxt{N|2Mzy_-$I)g)3#<O23e=--)k@>CZ$>+HXj#o_7%A%c
z(;sSj<6*FA$Oay0uy!5&pGf_mn&m@PfAt1Y*kYNB4vK1&_o0{cW90mB|33iQbdiqJ
zkz%$HsdPLa%~HmF{y@9lh?1=<JO?nOjp*T{z1^MiaJ+Hwu~CE%C?95jE%Hd+KXto?
zae=2TOK#L}2WOX@;JTlWCsT-HDP&NiTOr~)XLYU?$!+c`&j;YL(^I!BDu6uUX#<Gc
zS-sZJ3pMO-(Qpl)y82}&*{^HuNVE--c&?Z>#ovvh(O*AoBG9vQ;u~sZ6tTWReI_w%
z^8!0d5DdS3mf<AR-l=VbgB(7`bd0&su2o1MgzNGib8dJc5&U`E{IRQ^LHUzNhH5%g
z?)2!$Ew{55EO*{A<*1;#ard~+9*`nf!ERSQiU-|p^zwz0_w^JgNo7s_XWF22i~4$W
zyS;g;j#}2GLaKErR&Ug(pmpohY-A0}`Or@k9I{fk)X7S1lbcd$t*P<u5Im!(waA?T
z1mkQ2R)k+=Hl0h2aFrcR*!4viFtO%Kpd`R!_(ac-@9n&VQ9e^I>I_(sMx?%av9q<c
zw-@F8Swfz!s%#FQDCdu=0Ei`1MT5EgBQD;Ea{A)I_LF_}j17wfWtg3v9jbZEpKx1`
z7dJz<O{@9T&HM^g8a&a6jmHcoi~m+<gAm*7TJY^CQ7qK|qFtg2N<Iyhg|Ag%Jfg>c
zITD!8^VeUwTir0fM%S~rC!6k;s(<x2Z0T#iDYx=7Q=47f9!DGL1WnWW?>bM;glNIH
zIhMlTWk%23X4G|2v`3Xv4c_Cm@Y+xnq0EaYha$WLZZm4fFa!w5-f$>v5rp(%%;yax
zj8C$Beub>$bv_!XpRSnYo#ZJR<JA<0$y9L|2_g`xN2YTc9Vnh8DS#^>G;`1d)Hqaq
zETTFgYGCs~Nhh-@wAGy<8%k}_V+Ec7rketp9LSm-fww0>o1-GKz6A&%_#VVXp@d`V
zHp{80EC(OVXo3%s;&7(%q}Yl&slYKJ@2hyI8OrsNtGuU}M^!c3RN_VZM`{TMJB-s2
z^1a1;0-A6ti2Y7jQ2^u229QT){{eK}pj;5@MTw~$G-#=ngh|Gv{KYf{Gg?UGl9)gZ
zqT0Lm$=)u4Z|SePZ@WM4KLGCsecZchQ&e|qJD<U}dQGFDOtI5A8Kf?w6fz=UXAHUI
zs^Fm^bC8`|b**SBoG0||NC{_#lMi5|AVe_ov8#KbU^uh(N&BMvM#=W-$8j<S=$0B>
zoCeT9I4g>U#xEd5Qphhv<Py@GI@kB^;UqytIE$w93~5V*15-ud1y*nW1OwnON*Df$
zo=1FpHltk{m&8%R{e9CpR<ilVwR+KK8uNe~gy&j~=mQX0ZWe!qvVbtBhN^BF@K{(#
z7XZTeg4<LDbT{2s?WPjuH>3eIxK00883HWqPHEZXqYedh@*JADZ}CX8q+kFW<30@s
zun*ECODKT0H`8v`LriHx=fR_Wkc0)u1P>HC1U5wV%8W#LKrfk!F_kM7P>c=)yr#tQ
zsL7F5q1!xezdrH0u0i>oUo^81e}atg0`ktJ6Z@wWr3ZbYtyVT_^PPP)Al#A{`p<OY
zPuI8<+29XqZPg>J_`e}uDMccHhTgm9!WKKXgkolQpH=-njz3ZneJXKv9eN&_Qv8pX
znkoBE|LZCL=%5M0xv^OlwT18;?12k8aB2KZD860IjbNN&IRx-fB-0Nh0pL*zWFg35
zv|q!e477^3GXWJR;njXr#}JR(6b@jhNry_9FI6u;Z{pQgNA4F4oX3Ci{Z~Kp^>?al
zzQB=TA+=vQ7E*&AVYojW_rE67oT-L<(CzHmGuNlg2O+eU71%jQ5X$?qvtO@!h0E39
zqlyFlB5=!L^t1Z=7hnL@_T#_np)}V26jlHEM*Qbw|D5d7s-^UJgS=FR8uz|t-UH~v
zb0OgT{$c0z0%G5#B@T?m83(kr3GWNgIQRp#c{kC&k`x9s(j|*2a83RTK|_1AnC5K&
z!v%r~Faa-LvH}3Bg5shITGhkyT)pKedK7Be6vw$oj~1+slteDpUbUq>q*<=$9`&T2
zwk0pCD*N(<&0V_dDR<~!9rYxz$wr}QN^fqalV_yM)ITHguBF*5m-czKGAmsEv4X9|
z65us$7}{T|m{fbc@OZ5{?k_h4qyKbIUy5u&XhXg0>>twQL;bYjnjzcY*!RcKkIl{c
zGoMqHlFmFmrWJIhV{j8@B@smd-mpO(Ow}Hd2yu-zx9E&D$g!!O;A+VY+z8Sgw-3CP
zFGPJ=UrdcYfg|K$ExP&PEwIp`ndJpu_oc(;#^4#D7IP2RwooEg2Ko(=xUZ9G;^k(b
z^(qUdu28yg9q+J)_WFIo+O4>5)=Dkx1Sq7gdRI=J*AFERUrVOC{zv=le9li9|7A4C
zoTH!718kxH*Q34d-Ln7J!`+8}`hWdBKKI#WD>|Tk_hRbBDE4Q7$e#fse+G#B86fg!
zfXJT#B7Y!2q>MFYz7xj7`4S|NI8zt=1Gy^656_F+;y&0Ai>>RI-q!@c?|vUoC-MC>
z^S>VUv)Rb~YMv>IGzhe+C|mhkaK3WCRmAQZz5!Q{W^^^mdrBIbCTv;+S~R{blF<-Y
zPC)O)jErcsqh|!3QUrlVYWSAQ#-p3~wjhgWp>w(`CXLo?^Ch*}5UV2l9@4J>|4NQ6
zF+B_F(Zy!2k)RGJYqM22+TbDTq=3$keU4?(U)3lQ8=3;T%o$rDnTkZPaD7hOTXUM@
z?4C|JgrStgC`%H;Dq8$u;HHChTU(T5#VZQ=JI*kLG5vj<X78hok@|mX-46J%svJQc
zVs{ZLN~u?P+MLg>+ryJ2Q4e8xDH>AcZE*$0pZ}UCh!t$Nc1dYnAVq=%8ez!0Y3p?|
z>x}Z*t90h|K=S~5psIvune_APB!d#gVN&#`DO#8*3MmDjR;s1m)GpehRaN&y@M`7x
z`}yRA6AI`EeO?Z4gz7AGM)3#lFpSYK)QFrf3n=HdfVK05le0=6CL=6e`76|i5=HQ6
zdL!?ww6^Z<&)(w1yb4}1I;6NNa#ox;vU0Jv>D4sWdo_+fc5$r=9&|6AjpNCMIzTX3
zZ50$4UieY6!}wSAFn^UOW>R&NB$Hazg@$8IhcR?xDz7<EAhjadJRU8YD2B@^X@Pbo
zP@t0_wso^uWpyRpuv2J|jCf#h7c_CSh}#iNyM{L<Z5SX4S&ccmLv&~69;u0aY)$h1
zb>M2gnvW+0`HLmq5qo(6X3(sdyK_`h%zTtU=BERpWBml744vBrd1#VpHyzO6a4b|+
zfA_dcluL30c?V$<-;VN_%kJ%V2}<Lc@kBd6_~F&%Q5XFJj@9eGv%UMk{}J>-iaAvb
z-|0bA+j;(ccN?`<J8xeJX4~fH{FK4T;G56az6|<Ut&IJcMg+!8!ooT{|3Kc>h4F8b
zD?9pRgM$)!AtfJCvYLvPX_J*sHGF|VV7ZPblOz+LS!n3yTK#>KM38=fJ<b(%hCBvC
zY#n`l=p~L~r&UnJ4h^7X0jz}*lq9243Nn)!TRehz)ms{4y+Ij!V4$P}Bhg%@)n^!M
zlJRb0B{Qn!F``q#Lj!PXrwv$5>l(nK(ly{$Q`S)cTrdK4V+dYq!(6RQO$s#DrfUKK
zPU+%-FN=yEeMhZ<r=`i;0`@S-HxT`5B|d_t1<Kq-Ip^GnFQV4TsgecC8K;AJokM9n
zh(|lluWHA~UBx_~fb3B+=&iwGNCbi$GR$XgpR{j^r|N%e<?4E2U_B@UCTC7`)%}q9
zqqbvx=_DisM8)ewowU?CzwT*$3cnS(vjE76DpC@UsM!rTl;n?>N0dau92=d-3fCXD
zjdnFxn^A9kTlCO7b#n)7IYn=)n03KL3wFZE_cEk7<e_aD31yp-d7Z^m4tqgfod6(_
z6=vT)I2<|##lPjS4*fWj>GcxT7kW9N?^=v0y>266{?#uggaP;f-7d1((#i#1d&~&N
z$|CUg##gvVd)Olcu3X281?T#t{h%h%-KwW^H}jJf+5U=j;JG~*AE@;d;|Avpz4VZ6
zK(J*+K-AgErL|dpm7wm$3UwKPkGPD4-W$k#hL4d<O3w{W1bF=oZ{aXN5Dy05z?*ST
z$)p`62Y10t)!EqDeaxne2`1FY5`9GY&Z_Glt|zH8u*hG>*h`HoIaxD?YBog;mqX})
zIyokdfpzyOa^6b018+WH5_~XU`TQR9t5yMeQPnSnWs6eBu=75hM7>e0xFbAp4LUh&
z#34dHkm#KrhWns0D?_I`bCoxu1e9}X>#PSMpGu$+pIf+l2un(^`FM3_xq4#;c1u0v
z@F);#I?pigL_N~6{d#4<ey_$1VFsKo32e&FSKI3dqOUrgC*H&-V3xrM4f2DB=#S|Y
z>I%v6mIo;T{!$lKo)SA0&;)=(&_;d>+hpB-7#|guUByI8!|}}I7v{kb>ul1GDA9cF
zgCY=XeEbe6&PmY|upd$A3I&%GGkfK5Dv%tVpHuDp2tK*+a+449j3U7B@|KoV(QCNp
z{qY1xua>ewW2u*Do>ci7O7^2~!1C`-(k_YqWxvARc^3T|J*QKx{&nw#su%DS3k~L1
zHJJW<I#rv5oNC3O^i}cH5q8z+MX-vlI-Ab&`Dn!b-rM=5f%!0Zw(GtTTfehaBZh7I
zLDBb58M0IN3ygWuD3<XE@>v5aGJ%Ud&j>Tvd#}{_NilkJ{hMMvz%9s!S1dHzN+$s%
zh=9a_*HJw>IQxco8R26HfoaFSh3CoD9OA%u(DVQ!+Yp270Wn(%+DwLNG8z>A#lbs(
zj<|pOq~QfGjypnvTQM3kpKB(L-WnHp&X%<xe6KxP^>tRtUk9~IS~Z~x{-N@eX<3P>
z<4LFj81aIk4-i4%tz!+?Yju>T{p%@prq1#D)Af2i#2bHx6_$T(OiEeo#>u!pxvgcJ
zFVjgw#-hds34Qp_`aPR{<%c%MEJ~AmJN_@ddBM|z*<lvg^?zIUb^;2OGXHVSa+W>#
zA)I7S4Vy<2&+@d!Dl%&;+F6tXe2@h1B421d;PA$*{Tp<ks;&W=I6gh>+p%RoJ?)H+
zB}Q}KP(s=i1E$fOmJH+hXvX1C(8~@O*|mV?Jpa%Fbm%-ykbRXWgDdeJ&54%ksh;Y+
zNSLy-)ANgN`{dx<eQGZtpn4RinC6JiA3RL`QL33$%(2S^47Q$hiySU&kF)>-GkCLG
zYqk}&XCz}HBRb&7chDu_N~i$?XEDqBIk7YL;7BN-eBajG@x;I`!in4c#cUxllclp_
zov@;@-dOjp0UR+^Cve>5*RQQttZ1x}+I=mU^`2geW>G*sqp<p4U)wTS*9!frno(A+
z<m6K4-9CZTuy23rw2qHFe=_ql`?EqGIXtWCE}HP~Rl7i~=N)_K95;Vxt=a)ZV|{nW
z4$h96?c=+2aL4w`%}a6BRu_QFAe^Isf7E>E*~)Q%NvgPx-`{mL-!xASJ8zobue_pJ
z4hg#N*vrXj^YC!xQ<3FE)-K<<8(7=ZA67qrsw-$I+|PZ84TOL~OiVGzOMZY=93oxT
zvp7rpwY5uT`Jf{pg;PqJR90B5`I{XgN`?Pyx(v|k1Wjq^5Hti}k*%nckQm2b6IU^r
z1KH*8)(eMd!<|H@l9K3y^mXqSkRFvJzP?#Xzsr48@>F|1>xx@KwL&{!+6!}8du1*Q
zJ|3sV?Jrtg$k_<<&W9LE<thiPCLIeH8@*gc&XJ+j(j(iCik|yw-POPK!v`0<n8o8s
znNx<B8z=bS7j-h>iG}>4*h+{rxOE;%9o1V`_h#4g$JjTf4OT(h7G`UW?1C>macbWd
zrkqDxPMf7(Blj`Ven5O7CJyPl{b_mlu_F)PyH^sivl%&^Hc(sQg-Ymy`|B^F_V~GU
zaCxY2z!?{Hp{Q>#`nLO)B93NIav+Yh6)|uifwvu`Q!-&!9$2=@W`TGbi)9h98SY=X
zDTm*fXpLF9U<G>vA3ahaHj0Hu@7osXxYl2;gWhWW`FdyxIAGNr#$SJN*nhoLpb3Do
z&!cTnO5wj>8gh;r!%7vvisFoXDm5<f`8}}I_g+MMflUevi)B}T$@*H77u}XhByAET
zW>~@V!^oCu0Av)_R=$9}TUD*1kA4@Adv})q4F3Rk?S9|@ub?b3ZR@MVZG(`rxb^a0
zlvEYgC~P6wzc4`^vV0a?336(8Pj=|`%@Cr2#L3dhuVxsyb-Q}FlQL64b>$x6AO1yB
zzl2AsYf%)3d;6R!fid6V7FOOscRD1l@q}nK>b~bl)}TqMXCV0OE*lp02)ZKTyb8so
z&2ANi1~Zyv=~^PH1$5Pa#Wcm1DZ@5-;TMk9@Z|KOeb8#Gofw;;SZK*Q+lboh<LH~M
z2iwJ3gC)Vum+X}zv*_gGgjrOyja{n;c@Sj@h|^@9ei}Ji-2$vGC~F(@7_o;Rql7sC
z2w`Un7Ygp~@V25i`3-hpUP^eyrL`CwamNYyG%JP*q<P5^eig%0&-M{*5&`FBuzd8@
zcfbi3j?FRPp#iDi7wN9;%e`2~9rFJOB~Yil&0o=mKP~TONe8U>enojfh(X0Jnt0V#
z<kRUK)29XmfGv>#N+*d--}RCaRa=KCsry0M3@t}WF<BU7&w26+@Xl5n#Wy|z@u|Z}
z+q5$@qSOhX8=8d+V_D>Jo2>5zpmV5#IMZlz2hrVJe+2jn?6^<i<YWn@;xzVVvR;D|
zI#9rI+K+DHTjQgEUX*ZFKBUPFf)bJfjxbB`+}x_^kJZMEA&{Y8fPs`<E5!&3TL#0@
zW;FozQm0R`rfPPB`BY5$I4tniSRairDhUm%mV-Nh-r$Ih&qkKqfE$N^$7rKE%uVsh
z5qs>IS;rrgpo{0@2JO`mdy!~^FfWe1N;lW}NQ~m_-!Yjco2c4`!Q+^2Vnlc9rB_#U
zPbUBgIiKnw;A|lCIx6vTjSxsOyM;ARuQJr!VH^RQ7zJYu+mDCpoZZCJl8Z=3O_*Io
z;M+moMfh;JkmQfWjv$2k!$_OxHBjv#LcXI89W_^amaBfqDymqDB$-6tzKH&>yk-}t
zho{|6^M_XV;Pm9E{n`-E*DM+nksBBnN(P(5d1oNHz|yhBkvS@KmJpIxz&1OC1sZTn
zQ<|jpQ=96Py*I<^8NdsBX6mbTRAZZ{(*RUJtG_xM*7_+~Al(ssGaAj^A>dd4ky-Yo
zS{YWqzK~$vv8vO(jNjUCnh6*S`f1&A^QjF9pGy7UHrXYzgYHVF-FN4wC&xeicG^8S
zZ#6F(+xrh5Sb>c%z$=9xYV%5?7J0x(I5+w}FoAGykqI)qLS}s$@`V{#J}|yhlI0Kc
z5`);gv${Qhp9z({y_)7X;KKu3YufM_D}qK+Mef;6Ho(qrRoZm=EBg`2P?5mEY@kcM
zCpfQKL07eIe{YsmTJZ1sC*D*{MWC;$y_(p%8e+Y?wKNym;0q>M)~hna_l91aX)?}*
zEF+@he`G)(2f{_ktycSvkfm4gv=?6`E>mKk;;-#v41Q2U?Uw-y>TLK6|C|84j^)My
zs!#OyV?RH`8R5gK2SGc>{J=nb>xlWK+XP=&5yhHs!KEC?fnBkM%^hSi94}r?>QASK
zX%eLO7XN0w45n0RHG)jl+EF}<M^E8}T%SdAbX;D@K*7iHoco<Qq+@Z*^lDRj;2}6$
z*6M^cI!faAh2<5>BwD@poJ1TS>OLalk+TW3EewaQ$6jCfE1@+e9}JW{@>nkLDtcdG
z*a%P5vNz(Z9V6jlizFdMZz9%lLv0q&OkrWjsT1ZRensl=r)b0@Y~&i*-r@lqbM?E%
zWF@+Xy;*0oE~7rpqGH}h4<+Aav_Y|hHz}f^GBXH4in-!MkfG3ggm9L^K6<W+YM!{F
z;I4`{ftEVpl-hq^>68kWi#E07)|)BWX%tV>LeQY&2*Zjt!M-|B8#$t2)*JLKx=u!u
z25`(biOzGZcxlCW!HUzK<9d@5FyMCM&QB9?j7XxclDfJ$p@Nw#fjf@AX4t-3w_D5^
z5$`^F<l+1oA5hq3?#|+tkxM3@C-FxU6o`$o_k+DbGXx(1tlVfCV?ZoNkaBb`{4Nc#
zx0fxOAxkFjw03CqpXJ{$Jx%M!)&V`x&uk*J+WmK)y|n|R0=N#}peJTNMF8<!-$pt)
z0ngi2ylyL<QgO(5m=sYzK0Wxp+xqc0{O`%D03~yslHZ+P9v{Af(k17N)m(|zI!biB
zZ3Kvyh<JD)zM-7x>>ZAjYAw)M?^Z36AZO0JP;%1zpV7g^5VvAJW#`*aW2PNqq=AZ=
z@4|x(wL_x+T0?J>&93|bPwn<td+5&iQi)&oN+-f7sl3Os>bSuF%VQ&C>nT1cxP9xx
z!8({e;7&q|_}tHouu3wgiAk3$NHGPuC508XKeP54#d}`(9==Tw+2H+o&xhzb9Sw9H
zBvw}}52=d@*URAGPh#9kF5HkNg)E`?^Pj`Pf5Pbg(`D7WFw!mzy{igX5;<E!kJNzF
zlWWl{c`<RZwIa$Hu6D_851I1GTEYv2o}8r9f~QV=X^ZH+YFV|o`9z>Cy=JA=8lh{%
z`EYZZAY)u7odE)7j?xcFgV(7B6RXpZ>1Q=?^;XErNsCT54IQ8F3=kUu_77GOwgTF2
zu*120kGfAyf`h`5v*HkmF?eQy9bKM4>~hVzVgwrm2NoY7?Q`R3zKDG~#E|=fGzs~X
zVp@Cf(r3AP&aK_zOW&K*dx3l-1?)Ga>=`tGT;qnW-$jqF$o~?*4cZpy<CX7|L(<>$
zGsTWkyj-(U(Uk#yXMc&sp2|1y*E6}xhwPwbW{UIIJK;?M3}?E!Ka(XR;ZbatD)+6H
z!;V}$SXOO=@^PA?SW`7@OVe$S1wuL8qa_V=Wu5G2tUUQ;wVws+E~#uP+Wy1~3V+%d
zt!^r;0j8`v--~+cFX>9EyFy9_wdd&JQe)+dVl`0|g}Y_ET(D3bBhiFC1PBcj8wQ+1
z23-`{L5(!G#NTo*4{qOkovrAXh7Li8ZWM=|U7^3Pk_ymO=|dVvB&<iB*2R{mHKy`~
z4r(LcMw*)%oESCei@4uctQ;slZw=9KLZ>OLo<ch@=F+<3`Dj4Ryl|T}`a|PaRNfNw
z{^({(FqI<Th3QR&!;!hL?woA(M$kveE&kgJYm|mlb_*%VT_$UvyI=%xl@hdU5Dd-|
zt6iQQ0+u}@*xT~7y+0<sr?n-(7ognwLSw+W%Wg#h5w5pZ7C?NH@L-j`kA!j%D&iS=
zw!@_`iYhX8Pve<aDoM)9o$#+^tyX21#38>>{BeIq-s-h)E$@%wP<;=1N*k8fMzD=;
zPl@pFy9oYcq8_T6eFcS&RoPYAm-E++=d){ZNUWHTTNcxou3C5sK~*c3O%`utUrFQo
z=62Qm3-n!)eLZNNTy*8ysT+9G3OD1$l1Ojph=i#n2<a}3o=ekjJFmMJKb^s?x;(j1
zKe^sXp#xVS)gLR4FIJQhow|Nbe=)tSSWg_goVveP9&`21pnIvDKOt76LoU?-zl?@P
z+YkRP*E1OPZ<(m8bZ#iZ2#5+wm<gsE!beKUkeVF_tSIoHw4KQB!T@jX7)n}J8dVw?
zP^L$@&e#;RQqfEf3~N&p(ha(~pwYZ+(YC^=R~dw>Gd{_E@gL0gnCSuq31k=M973zE
z+8`ejCYNA&nFnA)M<JG6lIkYUm+kJg)Ggh$YLuEqN5Oz=`fmYW^16R5O8yg7`Vd$U
z$BDu<pSTVcda$1FD3-FvVBWNy5|_xo)vHwG_Q`q2!gGwiwxqSaI5;yQ7a(NG%;?%<
z_^7H=l+OQfuw~I+=>jAy*TJRTmP-Y39t88IUB{_wDhL6TQ?wo<UzuZ=1__|~MB11a
zY@MIpvUV8`TnyzmuhXk*J$!69n~!_83GI)|W#|(PzrBoV`wt)PJ=`qGMD?Z0#b}MR
zU)C6L!Z3lYke&)ukov%l$McLK3#kRw($01RVt4S*aDD2gz&_X)hmr)Ep;UGKlUqzi
zjM#yS`F{w@00aqg{4KJF$okRYyU5|J;9}k@tzjej)||62L8@q+Zhi-Wy<Bi8t3?es
z<CH+lBj_H=8>k)YOAa<fYTzuo8cl*00|7&Iz&=Y;y*ifR5PU??y?66v^gg+TNbZR!
z$Oq|1b<z`XyAS{qOp^yn^oj?GU&`(*?_z5&R5Kq>k{fX`TJ-#44NeHZ?U1fTkFr&(
zZo7#=TmTb1*yQ^tncgRf8?ntSDugNmaecvegr!Tl_W&lT1Gd^{QOpsGAPc^2wJsvz
zQuML}RX^X_BT|P<|LOhR=fJ$MFfin7R@-8)EMpY8j7nLQ)DBeVP#GR^U_mCy6kOO)
zeS*-EaILQ6DdQjs#^_ERkx_}3(#sE?G^*-V4lt7l#Ij3;5Yn??zlr-~!=Up9RoGTU
z&@Fp)@$R8ORyczwq&6^Y5G`gDl+W=BSnEMOI)!vqLwBgmmz*#p1UNKEpgUH3SW&Iy
z(qabyz>s0N)EKt0mHj$iAn2*&d<IYBK<hn)%98-b3JYxGkvnZL{^@xe?<dSsiV>9R
z1yXHYL)$lTS#5wDio82aOGpVwN$nZTU(I)8!2U?^Z7Wl68Nf>!t--J67F~co6c?SB
z+-B-vyzPP`Lx^h#NasHERf)fVytVwGTxNv^AhQYicrv>^?A11R8m+fy7e5`oQoK<2
z=(zd1V@q`wL=14|bj}*Iv*LiMl^wVd#zm=uqhD~pq_4}2&bP)?!ESZSI;LZrVmcg;
zV-D^xxL@e-`>WOZk-AiHLAh<bZKTVmbu{!QWf>a)_2OY7yImrh*n|T;QX3>(_ayl^
zs}0hy&v*$W&2;!fJgN<}ldgR};O*oc54f;<fM*PFW?oci{+wupp3fk)mgkMWx|p=?
zDP9p2ol#M*<T=*gF*b~Ie(ei_gmzGXnhDrrYbL8HT0$i&gll{Th0r_UMWwb%jGJ9v
zC=n?n*{$`w)lsj}o96l9nirIGk;_`3N|gztWoNgXguv4iMW;|SHc@=UVQ<(?whtTZ
z9J{HWN6dq%oi4F8N1)<`ChsqB%S^JGEub`v-m&?%b=*3!=m8vyL(EDYKHUv&+!kWk
z%cuN{x?blfEWSxT9;hQxtUQdRf>WjQyLoXMn4)HZ+q+BH-WuC<4$pOwvWnb1L4-w4
zjx<P)LWJ%Qt4u4^rK{Glo!&Gz^7&BlHVJr7u7xYM0O;cv0O1oQ2LekvDggK@0NBa2
z$EgQnD=UfdYf(SJzZK~S#!b_2MK<Wohjh2_@pONl_CL_i(u@6d7r#<JdSHry7P^#(
zZ`=Nb9|ri3Guk}M9Q`%hTH#mO{Udcj!Tpa}C4%OJr%wCxz!esjGViD8`GXxI82o%%
zBwGPLeytqxJUfumNseo5#x#pgO*(-*ZVI-e-P_mUyLAG75mF4ZGYlCFHn9I@n{Agt
zvr5jBtNuow#Qxn7n2M!kohVa0`$YKB7J4TwA0@Mmb+04%PQ7Y$Kuve1HM+-?B|38O
zQPmJ#X}AP$Ty+;LA89BD+zp}$Qzej?Pft!b_b~jkb#T!-tW<&g&^mv0+Gzz`W?Cps
zle~;67QDz39xXf3@KBD`3y&3PIQHA1ch1{0I`<`pRg|f?x|GBh-ey#1<|gLI9*S`Z
znZYAgM3cB6KTXnrCh-9E1T6fMlL*QYAX-TrhG~UFd=8hfF0*7e2ARg3bM_1zpsygr
z`%63I3dkayaXXRR5+vDam~q8%ao`BFVLOme(Sc&M(%G$kzxec(sjDRiIM)LHquuZ`
zC5)UYxm?vfR11N7(}?)!%3ho&S1E2ite{>!c|WNUAE~=x#4r5=-3CFQ1=v}60GkH~
zt+R_x_Y5sHYApf!=Ck68TPDdq=@$Cn6eHh3=-Z2hL*gX^_tJhk`T3-E(QTipYjzG#
z0prcEV@)FIefe(&Hn+Z!0a}aPE{7+@6l^}9H274p^2*Y6^T{us${``nLu+5qVvna4
zva6cZ9jb4{5MsylkTVF$x7U!jiX$E^pO6tDpVsy5wWKGtmYbUn(MA(YoF%i1{)9GC
zI#J&x(`f_uPA#jpHmQHt8_~C-_K}v5=#kH86L!E;K}r$wx%}Goxhzq*)#%_-TF3;@
znUEKzVUswE%*pk!$$o_@+-VL;Dc*Nl%w%wJ+^L}&RsBPq;CAceqT9T@c+>r<)dA?I
zat%_*LM2ZsG7PmfH1@8ez&uj3lHSHctyuaX(XCRV+d>!EWsj0p@j{rO*%UKgf~)fP
zD7d#vA1=M(p~ow{yLPpcJbQ&6!(L7Jvz5Vvqb|isuB5m4HdN+&C66@0-;l_vXC;Km
zp?N-6uL|fG-Oao#5=>Cv6A0<{{ZnUgN?O{=y;y55;{-I^@i&7tzRix>md8ZxcuzM7
zeOokPCJ^M)1c;_+1(R2YLhoEyRXC0P>jZ$)K`{#Rqo{^KG6Ba%2rtf@<LoEO(ruNG
zGY`jk(@NZ1*dk&#<K2oE&aF`OPS5`cfr8K77`Do0zSMpAUF+9T%t4uDGMVNd(=kac
zWW>VMTtJ$TnF9SX#pPH&{^*ScRLb)*wckTL&u)04;s_7S_Hnrbu#z}VOJtTEB#Oqs
z2_apA9vi88dbbec3y)RSw?Zf^Ud?s416v~d;Ss1(D;ACroE)OrP3}h+84v3mp?8(M
zP6Tg&U#RPTrMS>5(1_2;^?N)Y%~Gv6hB5ByTg|eiM?4ZFKLhu5sntN4)KSlHg`#wG
zr@paUCug@Wq@?&hxs8emgrnfK=dh&D*N0>Xc*oJ%JNtW&A6VE#TWG}4f5XPd(Nzkd
z!S5493eJ1rnNLzNyWSJ}DV#XWV5g4G&I3r}VF1df{hfXJL$xEJR05@t>R*s81DFK-
z;%{49TfZw=W~MeFYoJ<JJo3TbJG)5|i~;)_o{rxsI}zAJ*b~#FRU6Jnat?>{87s{c
zxrDf%WC}e(J7}gPKT<A?Pyu*cYf7S;j|syX^mU-O<4{F%W4{6`VBNibz+kIJ->5-R
z<`<07Qr|S>C&*f1I}J9X#N-j(L_p_kkbEStcbTU+siQ%G9Gapcdd}^sf8V=TcgVT=
z;pc+jpZ>P)<}D|08ufMbT?FH_3{9|8w2+J_O^mbpKbLEUc4aDj-*CsF+lKt`ZM6My
z@95~rbPIi=o62_v$KOT`0Jw;xnB?@1t^dC68d6YSd~fGjlvp!QLNiZj=D&w${yRcC
z3DzB-s_1XOSFDFM@x)9VfMoDbHKIE$LVGCG9%-qjsJ$G69skC`dB4Lu4mS#A=PewW
zk+Ly;mK@n}IsgTMo(P>8pCIb7-BTlOB%1}qZ<*nJVI3^qsODMw%MiB%+a1m31sX;U
z<gADglnPdGNf@#wsj${yMN#yd@dbdu$8>-$L9u$XAoqcB9->_$PqVK?V}V8uP_T&6
z8`Uv_&RnyieTL~r4F=0eRMtl$Xox)>IqZoNE-2~KgwPrjxx_yjR1%{B0%U$tz?g`k
zcs|R=F@{$ISGfV645kLX_xKW^eW#pn?Jg<RT$P?<H}uupsBX0J5Oj7jV=`mlWmG~^
zSEkdjk;cgbUbgetO@$kv5@Ag{{}wXf(NE%=Z~5f2_Y3_lE~mT()|Yjs3-WSFvtjP2
zU3v8LF}YKCo#XeAV9WnOf9tno&>;O^Y$!(l#sgY(dH`)p<&QSvtMfxit?aColCHdk
zN+<3rv16UnW<T`hB=jW?Yno7m*9&A@*{R&=<U_9RT5$OJbfO4D#gE|O&?TVjWxw0z
zlw#INW?&R~o6N5BL9IO02I}5j+yb(^5G{8NA&A9|@qpxZj6+cm5jq&4XT%(Ra>ySO
zq}y21!LXy4B85>h9D;H>MW#vPsv@bf7ZKg`YdJ<KlQmMp;57;;GMbq|Afc+7%&jvp
z#JX@IBwUz>Pex3-868W*#0;CD95Cy88ZwhoDE>AB=aUmLju-rJs>TZKgceM*kJRy2
zv|~dBAVMuZP+XUYy?9YFE%(Fy8G-ePs+?nS*O<r)<tHP=AqW-5{n!`*J)+X?Nit`S
zDvvVrO`EK7&wOeQBckD`Axs_iCVZT{)p1jLDK6MreBpDP17leMirIN`qqyYSsPXMc
zkULNzt3<j{#&;O~S>X4eL(34NaYmWC*73;pO2M%AshBcfMD9YG+M6#ILRT9k68Xl@
zWOb@>2^?p7S~A1<27-pvdJFk8BjtgbuPZFX#f)7RE+8A|s4<+n6lBLZ2ck!ayOkDp
z76|(Jh~kgUpB%qSF)50RKsJMt3ZUCBY$<1(r5jE9JUihPgK`1OAB#=_6G?60Yl^rU
zMFjCJwgU?#=71n#)ih$7GieZ-AxS${8xTfrYZDg*BTgkGk#r=C$>uK*9(Kz;vgD)(
zi+`YolFcX1wGL(VEZyJoGw?YsFFv_=P`YRz;<K|*0UOq;*|BBa^A<W)|Ij>cAGR-k
z>b|`^zVJE&yI%>b`ODvM=yuawlb15-I<_k=X`{wS6n?+Ew?bY#^K#*NU56!F=hp<B
zIVaQPLz>Tv(XAy-$oqlP=dFIH{9sb^Vxxe-cL7+z=@?Ka!1W87x&pL^3Ev$p8=QVm
zClN$Q2TBkoPq#-6m@W!&>^5Yf_(+7uGfmX9uNXWvt9%Hl<<(46wnG~xBhv{YNyY`D
zp}Hn9L%&)eyTEX3C-p{jEl8UJX&|y3!PcNHRhHhqb9g@h^AX%#2y?-H=I4~cPJnEX
z7g3wNkSEyDNe11w40e?uLrLm_<3PT=hM;dR$|?ybOC7KUFFFaXD?R65h8)Nf)k)$h
zW29HT>F5_g+|EDrd1f__d1w)ndSvud+s|12v&uYV0leF8syVX_kc*|H-tu-WKfKy%
zV3hG{v688{D)B4aOGc@>E}H6?TSW?q8E1SXfGpNRG)#0mKbdDj46H{}VDYtP106m%
z<DPez-I<Y<VVS$zT^0tG_!uF&0zwe^S$HF&ZM$3EZc8OAF7UqhHr2Mo>k>Ra2Cv5w
zp8`dG{uNb`P9JvZ+OMEK4743gfu{ziC{CPageK0ye63Vjy=}kN)&K20E485{Ygim_
znD>5dcwgYas!eB_7j>)EQKoT6=o{2r5bV;}H#eV^R;fHe%$Zl79G9yABY4|>eGWFr
zi_;*pPS7vzFg;XcL_I1WxI1Tw51h994DYjU@T_zw2)o1#FxexbN>_#$R2<Tkk7ya-
z$t?}y2qu@sRHpVX=CHWn1~Bi9`bK#Z)d8!Ay7;+N5@NpbUv6>J(mnTwieydR_WOuG
z)}|sAJIS*nBB;2zK7a0PVk64m+d8-4-eiln<?D>8X)>r~*6yemQW}?u^3dh$XBzME
zMhQ8JF;nwE;%Y;iFwpQE!uK%ziCHzpf_kAC^`IXsDSU%V0KpTYk9}5gvh^^o<HB~~
z<-=p=WG)g7N^0V2kTz&VCFfief5aMRnygpeiv??MuXR}!TH*ynov*bT$c}+ApY}f=
zBGbJjW-3GERFjCOUiE;PBA9wdhI5&r($uI{2y4cOoH#Sy6DQCjTdekWGO8>Mw$Q42
zAR&kCg9`{@eI|zjor84|do2lV52t{Z6muRZ*iDYAi`|rws<>Wqua+MSughK3vJ$@l
zCCF`AZ@l}hjz~~s-BLk>Y$U#HuTz#(@jvv0&lFetOv8?;KRB97Rj*iQ=e@G_(pWM4
z-6RW1Xj7$2d&3;*HuerUk7di1lsI6N)Uz1>j-&@zMy5UuBrymz>yeQ<bC>`W>ya#!
zr6e=afJM1ny*EmvxU!;9-^SDTZrB|=P9a5ucTx$-nONc^ELCR6^?X4R4IPrEi5Op$
z^4MV+nudnd$JX$00PB$iC}2f`lP%4gAP>O`2-aI5;v9OF&bVd0?A9@ZQLIF78VH7p
z?U3D%c?hipch9R(eCNCll97L8f2CuzQY5Kda@iw}_;q&UE&-A*d%aS29pY$Y9`4;)
zwZ3JIs_HwCHRujKSJYmiUo5|<t3XUCd~KA^<|cSI;GZF+RG-hvn9`t*1*Ko9YpV*D
z2AcYJyP=LUJU4`78laO}dGFqS(>ak_ocaiJYau`?ywoL|yMX8D3|y$j;{3q^{LHTc
z=1a6*hXv1k=+f#fI0EfW_#rC1*IoWbNc_Yk3}Ozo6!Ycpuw|<RUo+rK5ylr&ZZH{S
zpNp;N9eGNK_oMbyYoFZ*O*4C_#o(<)>4mlb3F0(peZKZM!Xt(2ew&ESA6l8DfMqK{
zLg)aAz~YEmntnv}E|10b*El;pd9A+quX%!KL>gn<Qlkc9_M!hU*U*q{PHya-wwZ{E
zozE9}H&`qId)ywjUR}O!tl?P5<4p|#gHj0qz(*9a+n2%VZ8rSOLe?>=I!a5K6(|()
z2%&*gop_H$b8h12b4l9tV^1+GmjK<qtcRziH>CU>g`euuN_54G(cpAG0(}7^qp_;{
z%vnIlP8Mgkb|xf~<Ylf7$o_+_7M<<XQns_PE=Tc4+jr$C{(C$~{(Iy)0ihkK&ND3i
zywaN^jYAvHmt_5-eioH+NUtg`=N;v7VR3oGiwJVCM3le)-Njf9<(#OvKg|n`a4Pnh
zntlV%PJa-k1KDC7Y?OM#Gb#Z^wV3+XjME~neAev&=Q4Iwmy8dB=8C^-;28qskhpl7
zob89#h~Bj?-ke@u;F*TkG|7s&=Hkz+z<LiR7GAI7eMHcgXfHtgpqPF5+0&5O?-DMI
zn43fw;?2*2sS%+Vx#dPV?F8DMwY`Z_N!Y$7HSMl%>0AQaiF@cwGM)mNsN(=K%)ekz
zZCK(n+0EL>JjVz&3wh4mz5S5pqgb-2LGq@4IvKHP(VjV4890?+FR>N@S5$8h4#^ao
zXQ_H;t@EhaFWb@F1;(NX1Q;Z^LT;L#{LLWW+8d0&0Qcv@I-|&h7#JhQZ6|(3OA}j`
zIneSQzv0pI83Ct><l{t5PjL`(fU$jfKQ!R3Wevt;6_`DX4MF7AE|MNajR5;8a5qLg
zM7u0oHp%T6E;|1<j(^Rk0G=09?f`DaaZhm%i@tbJ)Lm+1l_(9zWRwpiw#7Li4IU0Z
zNuUwRhm;VmuO$Aoz~BycYj#EQI5PrxLynBl1#mMepKQ8i>e!&yEx5oobQT(O*|`|}
zF;X;|oV0Xylz4OnOLRS^`N8mKbBvotVG2h*5C#g>lR7hm84w>alUOpaG-#mX3xuOv
z13($QrG!wB6>HIS4oEDDapjwV95jVM$OVcSu+7qMznYIH2j*pZr^@B?*@0ZO%7=S#
z8cFkbg%ECDVD?r0f`-a`{X%y_0<C$R7rk<#6|ZV`l{eC206ssYw1;=%&S_!xmlJ*G
z9NZsBZRZ8H1vAtIRwI<mL+oCqv?HN(AB(+9*>ywiDr%raHH9LSk(hvIpln2RmzfO3
z!FwxiTuQi#F*O9@h1vx*?<xf8RrBEc*XO5~Cx`M}X-{~QAqAQ>*;`npCYeFdUy(X7
zoH1w3j17HNd>qp=o1So6;-Cg?q6_g?gg_f>dTV8vWtoy6S}cReW!4iS5mt0o#jloC
zj*zf}0m;Iv2pO>uv-XCrJmwK95D*95JQQPqEY?<ZSrB2fx~2@fMaVq|vwGnRmrxi3
z`}GuaHJ1-*VUnv9w?#ZqLZ<QdAw{L$660<nln&kdplhAfmApyJ#1lpo)I*Ianhj?M
z>rwE$>2;}i$tYfe**jLBavGh<G@ry*K#WtJF}9<a%A|jtQ9Ok|jg+r}$udPgRX5@S
zC0SNw3$4Qzd|#V<O{j--1TS@3h^Ll#SoP*tIxxtM{f*#g+A0aXtkT0<HSb)XLpPen
zxF|PVKsrvsZQ^X4$Cu^A3t9<z)2$b^k1sl?_Y3oAmI76DMp`?KlY`DUqjAh9Ze`7>
z8i+pR=g{7G1Dvb6V+jD6rNx-m5(oD|7{#<GfXggJ&Y)&piJ@0>ObdIlU<2_)6LBk$
z=EDJX_yRWG5mU(|N}c5Ka6YnQc+#P@?64%#n7!`Q2y}^QsTm!<CON1f&bh!a@_abE
zkrPwb^dQEgPWMg|ILz5I0L!siPU5*n);e-NVq8RvGvf4qYP>8XIa8N)xsKgs2`yxS
zk#APAZ#ax7>9E7oHOFTvVuVB(^cE53M&ImBV{!rH%ZRDu6vH~3rfPw~4vnMNZ%6A*
z^N057Isf@iziRr)v%DP}6p<(7Q7&a_3E9xdwT_<snD+ClX*{`R(ji&OQT5P11jI7P
zL8U{p46kcJQze>7g;~={t06j-9r#dh=p<A8G8jS_P!+ic*Q8?^B#_h`<eYJ?+1rVt
z4bhI1+>zYB^${?l2Anhw+cs&|nOkn?W9>{&4^5VZ^1K75jRzbOG9&Bj95#zIEukDG
zD(fm{3Gcw-k`IJ_xr$oXHxqEkrwQnQRZ%tir`l%BI%11T7@%3ahY$eD*TDm+fey-?
za)8sd`0KC9+kgR8Wstx9=KY|tTWu%<$N<GCJUW@UE8CDp!9Tdput7sRp6Jn|YSuwl
z^wqS{b8zbN2col9Cm&~U2uu=jMse#UWDYe<C%A&BYk5_TQyr2XK2>rMsM`SeeTm60
zAzQ35+yB%#66U2O3{9<#-!draYb(eF&f4p5?;t7s9ioDZ2vfU&QQHe~wSLjbi7EXj
z<U!61mY<k`jNP5TA$N9-0u9e9=)fT8Rg`$}Mq&&=GKwd_rq+lzN-2_8M-4+$DZom=
z6M`I;9N$;RO3pZLcP_dY7sqvn8m5In5eR3GPo=?It?;zK2LMbbquZz2i(adQPS0Pr
zE{w>91U?=qIyjlntYA4b+~5V#t5^`Ah)ta>d5i-IG@h0p$wCz=?;j{)B?u<&<#Ur+
zzC6o@F}yK6Y&t8gzpUGVesZ9};2K+CbUTrfB-HcGYGr(V^b{$rAw2L%t@gL|?xByF
zBD>y_>Y2}S^MH6M{)A5&Br$rn=+{c|NQx+pffCtkMl)u%8)0!xG^0oYm;;%VvxVTW
z@Q?tz6k)`3J6gf@ks@6WO4^po2;GB>jDxc&N2&nsY-T4v&iHz$1wxbx!7QivP&jwQ
zd*<(HLvjCf#Tb_eee}1!fK^NI^TNkKZD_=ggq#EN-UpgRDjboPV>bHLf%9!)#3B4!
zl-q@shMI3?@^O-Ktd3f+X)5<YUnqvRk$bLI8e&*1g}E1dk7i{)Bcz>&mAudKkM>wl
zt4!Jy4Ao7uA=;GjR#+*et<5G$dy+E*Bx9;jb;bS8AY%lHf*1%ljz2nDa;*%&gHE2K
ztmeQcVm`s+5DPDbx0YohS|d6QgTZ}VJ|z}tkpTcscmeyUp^W?e`4|I-OSbS=La8`5
zz|li~DN~`9TI^G-hN2y%17kYA<VUuh&62BR8g^;nO4`sj&r*s*b5wiFOzGAP8r=K$
z$!%?*Q_3x|Inpc7YwkT6$eofOB&T`;YGJ=Dd=aX)a;ZyXAQ1u3taMQ2(NN*gP<4iE
z2bD!Wmi8*91IjI6`yIFmsoDm?2(vZ-Q_)bDhES=P)en$f$v9~?ctbZNK9R`kl3x&H
zxPrVS2!0IjJYCWxGd^@UIbJN)e=QxjyT071$DO(5Ak?Wi#tjVD#1*<1W`kVM4s6tk
zZUUq}G&i$!VbEFRh%sH{=T{#{q+37bb7m++y9)5P-fIV9X9I1#0%EJmJ=l(Vw=;U#
zQ78tzWyv}so$*UyP)-arsyL$R;Do(TN{+uvj;rHGv+~vnfeI`?H%cC-G>$LK-D`F#
z`N)|9Hls5o>)b~-DIhGwaef(h7(X*>(tlqN27@Im7<2MCp1wDc<y&kn&?=pw>xXO<
zN%UNgodh}WG*3NHH#MJMT`!6fXR`;ff{@OER%MILuPti8Qmnv8w5^sI9Iakdmo)~?
z!H59`H#C5xf-o-NBebzO(P4y+(MDZ6D~R55T`+;5s+86WA^TM19G#4v6M~ko%_1Yv
zXi#Be<xwL8HUX0u=9xo5h#i(VWkV!$gX&?2ETaJd*>G*lAO=}1-Zx47zQG9AAZUXl
zp}nMEQCz=XQ4EM=Zb*wO#3)-r6x-l+m*gleW&=^u;xzbP7;BO04FK*^&5B}*V-i-C
zY>(?AOqMnlS?8^l;+ml-7x%B-10v&O1(_ZN%?oLuHg0IQ1fwjsd@9s&Ii1>`1E!M#
zL>cx!P_2z~1HRuwPVrim`>RQb#2uMkm7>6XPPIFQBONk-0T&gRh-SgTS?%G8dIXZe
z;-CvYwRV1FtkwOmc|M(wA&fGZ1@}Ho`yND6YAym5XcuZ!gVQ;=6&v*#V`}!}jQ1j)
zl|q0d#H&=X$wDA33;K{~*gqb;vAmz;;lNwVxfvTQKp22biJYnuwRT{JL<~kqJrY+(
zD)}lx8HQ-gFc@2g_S{`iXJRKg-a6}gApNtIon>7aCrvR5FNh}aoKs^R^BmQ9BXQZ2
zL49kjVY#VV-rN|JU`epjf)h1W8AEzzvL@T*{8+<MDGU0_L%RTBb(+V6e#~BHG9%-h
zJj;m)^zwlc(Sg*Ujg#*vQp~TIm&EC#OsK7Cc){!m^9x56-f@(Tqp^3)_nf1PUBYJi
z#5`rF7HP>IJ5d)WttQi23<nCmhI|?{7_2(Ff{>_(ATHw9$!LPUcMg3eB>CCgsLw?=
ztN3NOEj8yrSOpfid^q`Ss+>XU%Rskq)Pw-V>*_KbWaeW#Hf$f;y@iNK)Ngxcu`<T8
z!qy;RNdR^$<Jc)^9qocMPvTaD)}kWIspw+N7RPD3MCF{EX5txPbS^j;@13V-6$mM6
zGw6|)vq2}>34|^MSmMxs`%Q>|#>zt@gYQ^WL35Dq9N_3YbOb|$0A!k+FXiUZzyiS2
zmJl2K%^mx9(HfuowdiTI#(bjaYH&7o#?ysl%h03Gd+MPz6IO%)?6%Jj(2T7uO>1^2
zWumo|DP~<`E?JjTPcHfD+$#1@jNEM4M#gzQErZ(78xMC)?Pp!L)trDS6?JFe&zfPM
z2q=xT5we_KCnjNF;3!tVjI>V>$LpT4m(jNR))-s}ZpeEH>d{M6VlmdegQ|3SqITh;
z{kDa8O7*a#+#fp6<-^RhAKo9*zSEX~V<~&Wdi>hL!~fso(7I?V(|N)qM^y0)kHWT;
z=uPwFu=A$*eTx@u9MAgK%-17*)f$X+qEp1evN_qHOYZ~e?p?(97%4QF4OsDJfM>~I
z#6l1nlch6lUPsJ4U#am%T4-lyj9tx&4ai;~>8TqgZOoU}yZ&8b2Fci+>B$S%T@D?@
z(#32F?m=L;rjx1GCY{vn%WO_9VTrz=4Gxy*OA%hs5=zm+Fc68DON>^B&TI!gu43y@
z1W=CURQS%`iUQ&p<5O-ynQ!rBC`#Hnt0NE~`Xoy-S20D{%2P>}LiMaz1Qb9qOO3JH
zA+G;Wu8vWwpe0E=+qaspo9z=tIWJ@a1{uW+$(n)2Et1)z+}diN{LnmB&9u+J{DXT!
zU}Q7sFfBoJ;rf~*v(hbbPbM>$P%+D=<8D<JC9>gR8VDG1w@?QlzJhygVP~AVN$su2
zD9w^tcQVVfS`%{hwJy|QbqVjcwOY;ZL@n4x{o5k0gNU1T;k$bI8Hu-wqC1Sosd_kH
zMBKjPCLA2W{)$7`x5u!5r$OvjI4jd3d%^o%a&zAHxfMvuUAeS)N}iL?Ivtsp(LQFI
zSAX}NU;FmY^*=BmNL$XwMKUeGpO|`mP-#i9oTuQkVWlY7oQuX&#>N}l4fix!CK7ka
z^_p8qHL&B^ET8Bz=j=9`?9|q-c<ve=)uizSN9O=~mqxLFhhc=y-iia!>$KoimC8sd
zh)4ua1yZ-=r=n>a+}XQ@1Cxcu*CZ()0mjGEt2rff(K+nP(Czj5R@4He0(nik!1S!{
zv?MMo3R~19ekwj}7Dm!=xH!!?{pNfP5!qfWFFv=jdII?EpnYqoZ}^Y?PN2T~=3775
zw*qVL46M`~KF01Z1t(5Y7YmFPh>{8R3J&wz^7YL&KZhAZ5=%`_mF$;`=*=e58yyQk
zZpq+D*I?W}k?0{~o!oJEfb1BY$s;;Kh`f>=mS^}H>vpKB9NxFZRkU$EFc4+s^rR5{
zv$GG;y{JWe5ve<OUDQ-1a1~Quxq1}UBIH)2-lB~wP^*T1+Nej^1URy6fhK2*Cg(I}
zyH_G;q|QqDo&CpCJ$i$YfQ_@yqm!@?$Lyx;(^C}8ewyMHizRlBGN1djLU{&7)K5L;
zli6PNzg}LzE2HSC1l#-getqDbHEp+U)DaA#W^(y9B7a!ee;}Iw^=YT0-U8B;Vy?1(
z`(_Z%h;>D48P-f(;k_)&bFxfG;THVfuPD$@{YkLB()qzkAPBHml-n8<03P!D=vKTE
z+<Q{kc5)UO$_K_;fIyVDzgeW@mn+T5OIc^S<<FD+h<%+WCpXfeG<?i0-HBu1m(g%B
zRyma1d-;3g9vp;`1hqX$+)=G0aQ{|Tch^I$NK1==>R~Jm9$Qr#xbb(&{stdPrA|ki
zR#aREv|&IS&@h?Ff;4b60?Si2tg5g-zX!jqHceS(8K)Vag|$E4;)d~T{vnGC*^0pN
zCkGUqFTb?zHx@mB4{05>RuJF^EYo*1pCI0~Ts}JXF-Gr~NYaMJAXGIZn<APSY@0Jo
zVX8~&Tn=tS+OQ$=DAlC&1{4Gmb7mj*wAA1MZbKj_-@s@sCt)94-mZaKj62_MPk8|!
zR&ki@FE3o3rhHbhM+VSZ%g0rl7hqA?QU*`Rh@KcL=S<+>=sFuOFrPA79S`zM9sC)4
z-R6-JX+|l#02`a5cbL@ZM=?Vul()zDb)W`=j5_6Gyg@jw4uA@rPE=JR+g8|o9wn#?
zHB-ZmA8v0ugIAMLtYVz?lX~O>Z>VlU4fP=_YU#AVhlE{TzURgaPWy3B^&LDP&Z@uE
z8ZmpDN_E0CDo_;}d}=#DG?$Zuo2tjz&xobphXy&;x{Jma&yF0@TD7b~W)QqcB?0)&
zfh}tmkKW5^0^5fLVqg&m?xg_%YK(Q|H->~@G$05~Ff3-b4MM&Ld_nXXge;2V$&4L>
z5iqNY%z%p7*BQviK;7Jptb|UDAx%z&lhfwm;rWspe}I_PLV8_fYwLE%l>S)y-LGGG
zjP8O8{Zb8<{+H1{v&0qfrslWueQ=PlWL{wvO2r)gDOMIPm0no9?-%z|oV&#<j6ifY
zo_UvE|0~2nSy0+cWvLMn83=~Jf`UtD4FrC(KO2I#%~%7N{smMcsoWzBMvutrlMp(=
zSm?K6bOmJ2h7lDInSINV)3z=fjcrBXvMXA_Aa~IuPN#(=<drXhw)Eh6BJeySekK0K
zKn8)Y7+@Lwnj=)Z#$Yi1UQW%0lfq!fspWvjLW;!Xxp75)Qz-EOY5<bzOxxQK-$A34
z`2+V`shY<^8R~P8rwW&0Tb^8Y`xmGc<RfxxN!?}(?m@)>eE#_<L>RlzE@6=bM_~Zw
zL|Q)UBwUFHn^=L{XVK<M(XjWCZ!8e3alJPmuKVFNl1d70+=G2`D3^Sq>u|&8fEC<L
zC+n=0BX)yqY7J&T*zl{S6%RPW$29KSp;>BB2HqPJg)6B9d@8Jm8dZI$3YhG6aQJMl
zQsWM&^#oAT9;Eh?R9D0P{^#vq;4NGKkL`6^yyU|K?c1fRkCQ6t8NW7n0OuAO7Jo@G
z$8k(25P%7>$wizQm2-*O17CBd*5o4R$&+4?GT7r1xIH(>qU>(|rD43tuZVd(Rwo&A
z3Q;&FwY*=P&I$I3`W_AtR8g%aDj~<WiuBR;Q+lF?v}+nQvF{j2hKmXZan9MfB}X7+
zg3rvEVCC|)IzVtLI77=<4$7Q#B6d%5#2?t4rI|SLk`52aKpq6PijE)xgl;j6Zjb5Y
zKK2C96nV2TCyv>j@xiP>m5bsTS*G<QF0QMxHI_CDeg9H{11CME{opyd7`4F{nxO4(
zQajadaG~3@Q14+Y#Zk>(|B6k;a0Sa2VRa?`w*9;DPj+Y{o+XPoVu3&juSmaKL`bZd
zm);2{gb{m`rxFzuC|DGhn@M3m?nF)Ef_?hov*9?l3=)$A8KfwC)1+<8iB_PE!<9@n
zqT+TuPSl<5Q(=LBnllNOm}M~0Sdp2Q0(L`MY9dg9mA%xp*$}7%aNG=37#GmTI&{0<
zz>sNbCuMpxM1Nc`*NB;nFXDtuEw(E$&{RrpD|n#9;2T@tSMnMf0<MTDuCAsZmU%Yl
zc@p$CG2c&gao<w~#3CgUq1BD^>au^NH$ZwK?`uk=1!66>T7K?6yJ3uZ6?uCtW1hoB
zO#B}LhQ2$CPAdx=L3Fk?rV~8vf#*BdK<8MrwN#-c%c@vQVBN+8^g|FIY|s$Qr<O0J
zoh5~1s;oQ1-l7CH6;Cm>ua&pUUM}%86)S-{EP?=`6QIzMHQcM!d<TI4v<qZlK2+XM
zY$muXNhs!TJzJ;n1TlXsf|z3*FHyC?x^NuRfYOC(I81zdZz5u?paWh_&*#q4zL1n?
zIaZX6s%rYA=jTPJNDNeR7qwtkObIImOwiG7K{6OAjqTV*pKR3}NW?a0l^3FO-29>S
z%q>)EvkCv!g{l(hFq_2~m<Z;oUDB;7|6%mSN|(^3PWnEiyY^ys@q!>m55xK4@oA8E
zfT9A_6+Z@mRWH&pHHLC7F%q!@-D3RU_*X_?a6rNOqZk5?z^y-FlY$MfreUh6&q2;9
zx~EAmmFBP=!jnmEN|Ul7r%;Ey5yEfge4Rs%^+9A0%0xAvVtf&Tj+l@UcWxkhb2ddC
zmzj?Vl>jl)5O*&d=5?C^)Nod*1#SYxZ?03dd^eU--UmITOT9&4eTtm`zgQcSp>GAn
zt#z=QHM#f{%E+@GrSB8V*8-txJ?wudPe&v3kAg=%=psO7j)DM#0Dd)uDb+C8tMr8h
zMg=)2n86~E4)-^Zv&GFOF`x30rrX)T+yc&5I(Q6$M$#!n_u<hI9G=)pKqF9ddMf}7
znRL@PnUbNeA-b0yCxUEbm^Wh8-zT@ANeAAHsr{TmCnfHd+{$e<NNNlqBKao<wv#~9
zY2qFM5;Y9`Bw|ncEFz08{06Y1N}m#jfE*|~JhO<xOadNj4D~3j@#$Dcn4ID^>l^bC
zSH+GbCX@nYA^yKm2L=G!ZcLmDhqn(9{Xs{3@xs~n8kc@%mR*xo?cRcWNx5czcJl1}
zV&ny@OjkU9wjEi4Bc>_x7bt;oTmYGnCrE~<2;n&GNHg>@Lz7I3m0?0ykS775)R-1W
z<OaG1_*me-rLAi;@N>Q7V?UY9kOpZ!CzCtV<**-dtb<>qkFKg>|1R^C^ix2B&6Tl1
z<Ri->99bxTE+a<qcd4Xxr1P=`=!qPs3@8s14*Sw_24EE=1usEg7(#<MPHKP{lca;-
zqep0-QtO&K9Ek7--$^{^Q=jd#I1}-_3i*<Rnd8H>=raH-lR&vk6#q@_Y}rvuHrm_o
z;k1d%lS1{<**KnDs6~5~&T16N^J~c|!afh60Q7AJ7kry+cfB4a&0wX6r`P7WRp^+j
zQ#OgSj)_57G!k{qHL5&uOsGM$kPGqwanWFo_VwaK9Y?qLGFgCFwd7+A5Mxg%TaLiy
zQh(x3Uowa=E1@%2kywo*y|FS32qZp10LKHc!lwj1>osU0@oph?!FPe+!(<JJo#!@X
zKJ}GWy&}2SqNPXd28U^~RbF`Akr(6KPwDWfKPe7!)2m|Ao@t`tv{Vp4C;0XHO{tIg
z5V+i)Ta0iVM2BiXJI%R~x!n1zqGNHu;#pP4g-?85=3AB-LtqP7t3*qvR+^b&Ivk8`
zg>YrXcNEQy+5XBB!3LV{g@dW|epobrCX*Eo5couXug1~NIMG^FNhTdeL@SjFJ4e`$
zcIj~jmEo^pFRD^m8zWynzn48=maT_=S*kqFY<7|+9Ufr$2@a3Y|E40fU7!diWmZL)
ziC9qbvjG0fr#d3>6Y5ta4se%7GF1!r(j1m}Oco+tQI6EUN>&7nB$9<#sbpA@vO<JT
z2gS0hr)NF_DWL!+dEll1kw%bNg{NoA4!It<trPf4Ep~k~?Az1B%i~t}=(zd1dve-6
zZymPJTL%~I(-T`gWocH(1wb3>z*|cbWPrqGf{gr=N%3lD7144F<B68(aKndu2Tjyd
zskftvvX&S|$#CYzZ*P@QlL0+5G0b2T*-_1+0_4XZCGVib4cE|Wg4sj)X4e`Ti7?Qv
zrD;?{3XSz$f&z)vFsc|d<e7OV>AayZ;;J4sb@=vMLrc8qe4mE;X9UsWyWDS=nGq%G
z`OlQg|Gx;3ocdCh)@gC=z*U)$0#-nfwk!oF+&g|c*4!rI!rd&+tmk;imO~DVzEuY`
zcqKl6(vmySu4OdK3K%RsOl4d>M!_KbHb=da`64>$9SE}1a^Kr9axh90eZ_!+@lwmm
z#7dwh9mx}lC*&N6KiN(3a5M}7#JDq9K*18B1>uDh2G}rC7YuX^7Bwa^p!J>obK5AT
zRii1Pc*eG!jA*eWMWVq2Zv+GKMlH&Nshjf{>lnuZTYccLNWK_W+Bq+cI(!Dn$YO_V
z=0$PcuGKvNsc%6V>yYJGtZS5n1EaOjZ;Bly;u#wrru`4S`EZMKi_62Oz8Vri17yqG
ziL~O~`^q+4GG#@qX-X$e0nq8yH4<=0R9(zeqX^oi4Su2+q_H+gCcD*n>R30$kQbso
zU1;Ur@$Im5WHDaZN{&h$BATH(cRV0iKx6sdc3OgBU?UquCPkcS#G26v{8B&%1Ls{8
zl_S`{<v{Nm91w6|i4n{e_26Hj@`JCdK4UjiaHM7yxP4gn<E=SH?F@%eE1B875Nk1~
zyRl^(b@soYbMQ>-zV>#zaCl~;B-0+{Xj!H2>ZT-W$!52c#5I`1Hxj705CR9t8&=mU
zi?^NE-HV^jfcjpZSTVFE4qF|JqT8DnUBOJ$uFyY2i@ykO918OS%)>LYZ+u;V4}h_J
zqt3!Nqd7S#SvE=dvEf0%*CV|q!bF{MCL%jby0Bk#UfJi-&VJok{E!V5<_j?i!Na`~
zv0qh#J8F;wwH0XarL&z~7?ovEGz^8=CqR7x0ZSgEv-8u7QwVtRUYLWJ{66t=Ym7>@
zUdGFthw1u4o8F0xx#z|W9>f9J?s&c;-^wBY6t+<ol#RwRU>WdF+=~~bBZtAOzx@_f
z{(g$TI|m|E4&!vOR3Kz>NmQtF2O$w)LU?eH^AK?(**#7)YJ7I>&<v^t!X&v6m>XZ;
z<gex#a$`=IsWkv@;U0uG_-&Yo)cS@$aO*ItQ$?-R{Zn8Vo2vCAU--XOt;eU#EHJg;
z%pf4=^H1pP^3`#>^X4Bkr?Yu)lor?ZXtTtUK925{zO(2(#Trxft#NU+1^j!KjEJ_}
zttyj^u6aN{^NE3+pWWu=#TzB-{`+OCa}iL&tyaHz@ckX?zCBX>{(11if36MwOshoV
z$v@~6k_q?oZ$0Tb{sEJEi+Y#Pt=fz3m97G5Y49d|!VL&HJGlYSCK6!F3N;{pv!9RI
zNjqbGlGfCSCnKQfBsN5VW6K92k8`{k6CPQIr6ougL#i)!t|eGq%n8HL44it}O|fU?
z8)DFcm7ob+A7qRSrKm&jyu3m69A^ArhFSv6qj!41lyj1-H(G!s7%@^$5R#Z6$~kH;
z9jUgVv+PJ}>o@|P8L&psy_X3^v8#>9mI0&{3)Was>-(K~FObfvt~DOewjKGW_P%U{
z{Px?Z1mzWoeRdH7>|9L@?nd!^<N(8Ix1Cuz9AA)EgS#-_f56O+osa#QU(sRa+<L)$
ztY*GWpD!1ufp>1~qLNx8e-O-m>z+bhciWni3c4e|gc_X=Y@(TK2eqbRweV7Jy1f8F
zGi^B!m)Dr94gcJl{8hB@zgH}s?S`2Thu}nj&OuHvc;KKZVMo>Maux5y(6^;C=F|~@
zVZ1@s*o;n1^u6qJPdmsSG&<X(s|>c4N*D<appQI8^63$??*wkW5;rILWUlj8zdiEY
z{LJZaPwIHsg_KMI9KEuys#7H3w;GP{B7bU>${@DoTl@6|%ffc|ta;gK9s2bGBc-L$
zTlFH^+%fmiKhDc)hqm&rryD?)j=>f4<g$4z4B#S+n4p3iK5OSfiUa2ujxcSrr`N`s
zI*+__o}NNhx<LRWV%f@+u9^ijo29c<vJ8>lL-3m5^n%QaVTlQ(5P^Bz>Rer<sB%>f
zpD043Xk2AMVC~GArIV3IPOZpftsxj?hEK71HF8COXH>I1I4iBNuwQz~lEA?*_LYSl
zTc<0sE<vM+Tj0b=5}E|LXJKZvxzmW-vpNnsVigkU`q`i%78CGo9MUmD>luSOQxK8~
zb0^0Va2>S9fh@$_X+)iiv=94kg=pz0rX1s?Iyvxic@H$_8WlXWE?#6^N>L)f&Pj?v
z43PqYcwfv8Kou2d>L~PGKmb2Y9A>(s+}YCs<T@T$;9lVMQeg;?%v`i!R;V(hv=wk!
zNc%TJ6G<66z-|n2-TCknpdeip@lTatY0}e5x>x~&vs+S2i)R6MvqaLX#TuxiE|QRH
z3NCyh!G#OyZC9cU0Tq!wQmSZeMP!xd<%7UF>eO`9&Y#5N#10yCVpTW?)Ym}XLyjFL
ze8x;{X|yj#$Cw(8Rbp|&{&rSqqQhM1=oCl^8p8X+ftWG>LC=U4LvabnP^T6UZW8Rp
zF#3669L$O<BD(5lI6L+&A@50o`oBud?EolZ5PC{ziO7<rSJyM=`U4lxh=gb03{mW7
zgsj@^T8FoR45c2kLhgm#5KEFec!0cqIXLaK9GvFgnXiq2v+6Tr?T;NZUgDeXiqGh6
zqZ^c_<9vdlX?7hiWZaKj^olNyVRQ>Gh-M6|&4OU@Pd(l4d2X91t(eFnzw;zsXVE+}
zij0OaJ2TT_pP~Sk3>pAOK)Am^>Akjsz7U1N7SLGOc3(-lL~J96WA(|$F0^bxNJ)T^
z<S0Am&SQoUV!>?w%N~!Fq~lCtxEmpJMJeBa3BYOK20Ya!VvaJh6hEJZ<NG5<lMr|K
zO%dh|on>D**zck>0O`UE5rCPr7R14Icue~oSU-3aMn|t%8W*c{$p5bdzQjq-HTV+K
zXg_k%{y?B91&~_-c!rR}W8v!>>=C=k*!|Dlpzzl8#GjTBrR<Q;vLvKiaGdZgM0R!n
zsP_8_?L;_Go!uLSEZ57PrSJ)_2YkMS52Sn+h2n+EhhY^VYs@sU6V$~;>6E3Ci}%KH
z-?2XsnKS3`Bnm1=&vNpH@B?M5mMIzGqY}JO_QyqYb|)FSI7f)wOjyhydoYGRfYHhM
zVbEvH2o(nMqFExdLkopvC7Kvr^ewO<WT1i*=E<HTu8cR|M&xR+{kkDCr!SJ9&t4}w
zA5@`8nvN^)h+U*2j8*eEtJMDO1+j<Ux`<;G=IUaOVR-E4W}l6j2xJ8%VEAj$uy&xD
zeEE4uL5^99!e}zv(vy81Q`l-|@}1!BwGT^xS@79#aYgif#rUlm`RSu~9LE91h?$)$
znSPcGLd{iy(!nRFZh;3{hX{<*LJwQJA8kcV3`Vj}A!hH5z8NUNBZ{x`h76C+!#5%2
z6?{tj5-e3yqD3820Bt%O*~c6}0a#?e<tkLC;K5xAo#xkMQJm0t7M5h@J3!H#QmYl~
zR~PdU94cV%{>T-BPnbYg$*u?agyKiN1r}8+=OzWl|Hg$ubCg8_m}KRRj|R8u?4*53
z)8|Hwi}2`a;dN9b84PDhG2_&C(Rfb4RE$@ry|xL;&QazhCiCY&TkXgx6rNP|-n=Im
zBGM#a>^YeF2L6Z!$tcEDv}h+~+yzo|eaL5=sIQNzJ{St>?SPH4+rVXuHT)Bq6wz59
z!q?!PNM<&)3Vf<LJ_7gACJm<OWneeiKVMT$Oj#vL$ST!-dtr^BN`|b$o+9lCD@rTo
zyhwOM*}zj-RT)r2HkZ5dnnCTvm$AlG@R5}`@o0OK{KH8J3(l2-7Op9Xpx#Vf0_j57
zI%c?1VS}u!Baf}|gHJFeVAg3J4aOt5CxXU_b<D{}wbohealIRuB-5zb#yPqvC<&~_
zU`h@CagZnYDEsy8@Dh_PuD<1!^Q*zoy^&);ZIScPF;<3vEEoc&@3&#)veY@Id$-j|
zE5qTSu+lnD?-JQ{1t!u;{c3;yu0dqgykeH?oSRFgTDgjqLQUnXhz>lUyqyAuL7`4$
z|N1FE0Gls08h{Qg0+2<DfnSY^gQkj^VB&ch{Kh56myqdDak&8#BkA((y35gcF=4SJ
zzpco{K<gL;0}4t;l}P_iXXUl=`XYU=4zR59F5;O!D@&RsOrj+T1TbGRp&w8-H>L;J
z#n&ZBr;>_0Fb5W)5&tB-Sn?@9!$FB`Rh>iy5YkGW`>ZwNB2}%~GOVMjrTN@Sn7b%o
z!g`6fR%nyhZMCflPr-Lpx;PW*Cu=F@76^l07)5MIf;r90G*~`XmRG;A@Tj?2OxWK9
zhq$<&KQo!wibvz~9Ejj%hW}cHOG3GtL&~b`)8Li)ln%jLH7Ew`;lL!<AWaK$pB@Fg
z297YpaHD~XO%jpVq6<b+vd8}xTq8Lq1w;pQY#`mLaVsULB5O_-SPzXs2QdjAg9UKt
z0ArP4x!5veH-;XOYN+%!;tDl8%`@YW$&MGQ**STQ#v|~Qjk6+kTjGh8ZS8@8kgkj2
zMA-xhtz?QGTN2qj3_ZXu@(+dlnHB_ljD93*E2>qZ@hzsb_|Dmv>gU`aYUm+~z7tK&
zQ~z?gr`&YYt)?aJteBH<YB9V)wHl30om9%^C-^%`RJ)=YVW%$YH5*IDft(VSqoHx?
zg#mVRN^HRYl@25bjdX}L(r<xzCv>Q%fn&W%yw)UO)be(5AOjZ2p~0<G-&-3Hv?YeI
z&{)nagPu7H?^+r;s2#+NzGh2Fk%{t>ktrIH7J$NP8XO)jA}-eSgB2!=)*p!nCaFZn
z_xm6&*is0<MVpQV=j=v&)U6R!kzUap&5L9>A8EZ!p#km$8EpblvTRFM>(X$CriP{Z
zjww`K9QSTfb0kjafSLg2I#>&UKuE!lh>n}x(sf*1OGGp{*Rz?|#bLuGC(>t>JCvNo
zS4s^a3mzZ}47Q>c!xUAlMH4T{E8GwZC6(S9H~_S7JB{7O-j-Vt!_9bs!2WX+-!@cB
zSIG?HXfb%(sq!jZ1^R31u-*8BlBqD^SjC7h8R70#bc2z`sHkb$F4dS+J@9HFoRS;l
z?SN6h(p#?g6xb^#;1y^O)@O3cni`qWG-jZfG(w2FOIETe+C%X|(=JAcj|W;uM<bZy
zBPhN)-~-TP_rh6@k=T$s!-9K_Y7nOnlnQOc&WkEqJe|r~)P$CrK(%<oD#v6*J_+>&
z^vb470oCEJ9{+YXNHV)i7n;m@Ov(sl?pT*0hy^pz@MjsOQz!%asv~e+^It9)!$RyQ
z`Ba;x|5)ZaFkL~0q#*W<M7UJj?y)(8<>><1F>1$BLCnp4SG}MMtpD(_JY?v>)WXej
z82YMCL)roPfC5s<7*E~&6sh)PK-5C?6Na~yeTl0_vEc%u;%zF?6}i*s;Q{C!i`vTt
zcXGWDaGDB13O+sc*1ccV<6t$(sXesVBaS5M=c7?d?#t}0qQ}UNFT?bsP1uk`Pjf{-
z$JL~&q?#{*Iaae@0q)xgN_wH4K>MLv8dU02I#a8e1DH01%a@fo?wY;UfiU6`>AAdB
z=mb}EJHrm|9*^w^Q$xzzS<2%Zl4iJUwHgjXC85+75{)g`q`*bTbgbM~I42SPxO)Dz
zw?B1S$4AQ*oeq6HIlX8fRFKy-)aMHcbOAotg1(e2+CB@>UDn51>nd$rSTS!Zsec4x
zqbi#Jr_lVHOBPZsue7ym?W-(D0l?W`+*aFnb)`N2r2YMU)ms|?9Z-bx*Jy)-_#4p%
z4?loBVFmg(A}e&?6(A2$vC(7o3`lKk{2pNfo!+mC<P<IsnmK$b2fIeayjS$6X-`R=
zC9)3L<2vbI6Jf3t->-^yd4z?ZU9h6~1X4RHaiiJ*Yi8_%-Yf(`a8H=EP)phfqaj%1
z(4OezOn!=MS*yGdn8IqK9`39+AHDCww~eJk|03PqvrkiHTh&WKTgWgLZ>d;KPBB;W
zstl6;^gJ0-MqMtts7Se$mG4;)d%}lX{#qVHgZJZP65^bz49yi%T>>Y2#A01@KD+ik
z48XbI6Y(;d2j73j@lr7aztV{pJ^&&C=l(507qB$TXmK`qAU8Tl0T*TSagUULtTtiU
z-iuf_8HC+fy5zqgzEbg%#CP5xJu=>Q2#=Nw99g(Th^iEJT4E7I#+PM4#!!s<i;|!r
zVtY4M8{AD6v6hRg2JvfA`+wWxGz@Y78q+`g*F2xj#|#|^N|c!0ssK(8TwVjYx-lRT
z6o#OtFUb)rhu#K)Zdbl_g1X`&8C+N(<9N9G0CSJ(7CC+G^|3i~CUJ<b(1bif8ES>b
zx1<~^zf50ir9#kL$FhbC<)Jsi4It;pTj3C;Lk`+i&zV7$buLK1pCb(U=+*<?Dggcx
z`Vg8?a{}Rmf#k^QMfVJZ>{0ik{kC;_d9ko6sSeB7#TfN`FiIg=2{?1!tCbtxu)e}j
z^6uNq<BNLZ;JDp7x!|wfowprkE*#lcy`;Tc4IhfEnD01U5l}#cOf>u`yT_E=UdIXL
zHhKXDzd<M{YAO5ibb4#=)qgGv-u}-9gL4YDtya)-{CJ<%(m4P#i8EiNd9fT?gQn5i
zO&Zefrf(x}<RaKnKhC;HL;n*>?m$Pe8?BXVzjX^Wp-|K(?Y~zSGd7sORga$ubPBre
zt^W9xVUXO=z-Qu3#$YenG@CL*?~G8x)Tsr{;Sq7v1wn4dL8(BtiL>rNhy9`AFdeLu
zPkETNMZ_LzwnXsuMiCG`a0HptdAN63jBo^J=IKLUgci@kMm)(W(j!Z5N=9vn#?EZ~
z8qqRo??vM))Ue#@gT6|BzBfogR^hjlc?LDlHFe$1IOS}G57rV`fM@>s{QQ8$9!!fp
z7cs^s5$WTD#ua1sEZbNrAE$+O%&ZYu371?~9$2w)LZMGW4qI@+&ZhZHGQTp0dr9ao
z0(`JW6jpSDIZk;!dU5}~enKz+i5u3^utS%%ah8f!g{o?L#JKP&yz4<6GF<@gS1TK&
zakh!nzJ2Joh)RL5SX+r~2K62reAr+O_|2-}=I5Hkx1&6+9KV(?O#}4nK|C5ANIVuQ
z-lj#(e&ic^>J0>S<&GL={3Q)hnCH;IFLDe7d0Dmk6r*4w3k#Q+TR+F+vebH<H_E^f
zld4>U0u+Qp4Q;<mG_HvR{bf1g)RHwlW7Ktc+<1YagK3_TnUOkzb|hII!^M$X1!f8+
zrTi69P~9RWI^IJ1(PsOHoxB#Q?<|4bD&S2`cngvl99eV}M3U*PWbzVbVRVbZEv6~R
z2@P1vCPf^<(n8!z`?Li=Rl^}y#L3V;0FQyFZ6?x$ng(bW27{ZX9{@`Qc|pd>MotM#
z;GFomn2(9&yqTu61l+9Od3X!?WR{MJrB4ZkqL>hsP$Jj7e~lR3g%v1|2BQ(YtkW3a
zTtr7yN|W~vx+H7Ev}Wz!2K?K@gf^=KT!H%ibuv3s^HT&BKoGGypW6a_cmTo~rZm$^
zK>3sFW9K!>BTjD7MK-{M;>Dm)H>+lUDM@Ydv6Xh7V;<eb;ot51rwpbIwK((>PX;vq
zw2a+hnkUSu=sTJ1v3kV$z~J&cjn;~5h_S+*vomg$kC+!><)-Aqu@8zVcoR9ZZpc^~
zY9M9-LhD0Gh0U7@;48_@*<d?yJLhPplibt@KQwUbkUGRAw(oc;m&XQGP$E=}iZ?=E
zcMlva$pN+T`Hx)*utU`_{`P?cz*g7Ayx%9MMhn7#yX$}y&3g{u*QX~ZWG?_l=%jUU
z(K@U=g<?|2#1_&SQe?}FuGSj!8FL<zz@fzJlUJuW##p~{mGHr}&f$_kz(D3WOfr0x
zk~Rd?LIZthkiP+j-q;!W7@n(Q_I~R`@750%Qs=+VlR3iOgX0c+oUrSREFmb8o@$cU
zpUwfZipITR{6L2>JjzN?R5$+v0eTH7AVV-a^QuIZ@(zJ+>xzQc0daybMo6@`A-lwk
zFRkQ58GjDBwPuKS(--hU;xPnEXHFUDW^RH*)Iynr-vW!Dj|N>ku*nN`a&Cer1v`;9
zo;NT|<vZv61OcX=E)u2T$~eO-=N%!t4o1mmm@gWD5`if9P*Aa$7FQi$LY_GzF6FO-
za3?~dMLR!I_Z04jPR(F9LZSX9PpQ93btHDK*i{N7b0%mLa8_f-83q4f52zS5nIwh?
zK)@^?Xi8KQTh_TFXrnA4ZImQPChQgaH#~oEA*iXsI`<a%r7%{ee~jEl%mbb6Wng7O
zC3Bmwf9gn%lVo<^0W+8ZAg#6hFcPU=hCMU#&BCBBI9Yu8Loc`xPC*w85KfO;E~S)p
zlP^8iJRC7wNYTt@4bx;a5MMt=DyCm_;!w^@GMuaZvBCBeD^E2(o|J{wY(K8>IEQ|1
zmL4;WU>ZJ2C!?8tD?y9he$ztKD)D$e?OpKJLfQ|-OZ>d^i^s>oqCE3ULV^(I%R4;P
zT5tnTKxiH9#*~P{Sd9_;w5C|FzeTcFae?QP_+8FlgUHFeb*@%h+S81HNp<1ss7%S{
z(PQ5WMW90(jCp7skH?hsLu4G<EVXO=D)@E~Ivynh2rqyd<>P46UIi%-^gqC1W$5W@
z4z1OBshiajx`dZSahIia;X&y9C789zN@5b_nd5n{la!PdPL%kxVtHgVPLyJLrKIVD
zac`~hfT9DcTs6z-Xx!v6Z`&sb2w18dcA8ub;Z;6suhhoK{DnA7%}N+jya3?{`6>~=
zd-K9c?rVRRiXHaH=I!iHm2)1|k%Jmo)!@m651u5h`BLIVQKqvRw7w2Hw;>H;x&oAd
z_(+hExD8M1%;gzZGRVunsNm&AmB(u2XbcPn5*Y+Ta<$2(FJBsk4{$vqfNpJ-PWEDf
z6<S4z6ymF^MOOHj32%eQx@M7j%Igd8WlQA&_^fn_{L@oKq4Wcb7aU>^7+a6wAnlBX
zq#!9T5<Nom3^hO=C5J?XeRcGz$-8V)joPWxI=$rfLNtv#1bbjQEq96e9qc#J-|%5H
zq8D26f;;10Bf6Sm3`R7&N&Dh~i?Sy4gb)FvcnUlh7F67+suiSyfvLYR<9r^SAN=s@
z@~Hc^`D6F&ywyBDK0Q!pK^NGFcAuKR?uCk%XJq%OdiyJ)h2;I3{e2@avPx$<_%K4N
z)Aqg6GDE<HY8#i@Yp%Q_FG5>#w<pg$cjeYxKii9Z78`C4xq@Wyo#Y6MtV~NKQ<3T9
zCA{~FHaV|snXrZ;_Jdj7@S0WyNd%70OF01TllBF^ffaAwUqMaav{3P;_-AEYJ}Uay
z`h72ZiGsUcjtZ;-0kB9q@~KA9!F+$E>sHSFOA^Bw=C6e8gcznTmQx{KoNus=4F1(T
zo+?2p;lM(d%_kn81Ud@%A$V*><`dOaACm=oIC^P@gN;!NE^^P{&hmmMO5p1O@YGtn
zCuwj|hoAFoj6*%(*<qh1D%O@KKwQ>7bw1<Y@J%w~;;JD8Rs9<og}*IVWWu$e;vS@0
zK(7gAz*q5fntCeEfR4Kn?TDJm?i1LLLD7$A{$Lsrj-Ll^rR<aR3#b&(sO^|zP@kk_
zxfE5aEDWub81b{FK7?_bw1<{GBes22ME>+bNFd}*L|g%5Cp0&-L|A4XSj*3SB~Z*D
zS^n>MGc@~ER9uT!(>xvkcO!QLf7~E@2AzNF@PpHFTh)qZiqG2^q|fxXtqiO_8(LpI
zNY#meAAosP(~(-G&@tR3J}V?R*H8lvbx)FykSdnqs3|tB%9$nCl~jj6#G{&<Gl3jB
z^y-IV+{7QEDwu*oC){uf1CZ^7Fqc{nP$4rMlm{%MtX@^hSZfwft%V%>SMzi<aO6}{
z^K2pWfKYG9tKx+aBc5bE#{*eP76zIf)C-hP33SHeelwWXJQ~qJeF$E9p^}-ES#{gc
z3$)nVc}xQ6HBO#(#{g^s;6<B_5wYl|!QLCduG`Kij(Xf_iro36A>)O%Uf9^sI?k<T
zB>@X4*%`w^9OYP34#x7rb}~CTy<prrX)DES;nS<c#!j)r)-)!9<E>*wczIcF>YhTp
zoCfD9f5Qu{m|C?R7%#OgFa{fl;YM2|DOABfVU}lwz7{5ps#Q=uqYN8)zV3a!gI^!`
zU+?1AWB=<t{JLj<Eglv)3Oo5OvE_E0iOd<bsXpGRbHaoY2?FD0IziJlIVmI=*fR!=
zfE@%g!)lix$?#lIx)F9{B@i={(8SO5bSese_9KwCNKFTq5e5OC;fP3ZyG|57o?A&s
zjMtIbNrK>4`x#6hQ4Zm?Q)xIx!Pzv^ON&ib*Q-udp=*2TH#T=%d{JYoBgUt^H$Trt
z#pZ8{C)oT26ygTCUC|p2q1i>NqW!o31!~jz@k*v@Gn?|$nfjrqee1XNZK<(uz1HgH
zHdzZsPW&#ONDwLHS!n|WoM=06d}R~;oBg$)1jV@-+@M!UEDqsbbdCmn@7$$vidB{K
z3-&7t_WgpAI++T}z-`!Dni*zKFUJ|+_vW&9Sk>)>Qg{!Bp}VClemoBFXkD0f&z`8`
z`zW>LI0W2Ztx=Y9Y&m%f0*`^&cAY=WY6KWDD1C~*iJLr#o#kpgKlZCGB_FfW&RNsa
zsk!`_=;%S%x4<OILCays{klg`biTIV9H&P+VVmVWfv8G}Gay!k08Q>EQ?!wYsIe6t
z=}>g}PKdLZ@8=Uy1EROd)S23<LB^U(`s6Iu+`<Z}o<GTH{EH9J$(Z}Q_1a6vaKJ`2
zoq(P<6!yo?@*&yX8W2k_a0J{2nM13#Ol+#?uc#xje8)aXWe71Rkn1oD#i<K+%7#8;
zq%cO~{kodgI*yY;#Md!?X<Zso%}!G|dYUVMhG;MaYl6V7@l7(CfIT;#mVE(mLhu?|
zjCH$cXKrkKkblR)G(5S=X6S#Vwf7NEuwDu2#J7A=*d)L-(`<kK^%w1V-^i*^(o0D7
zWGJv;8ysiTU*QF$@o4P;(V%owUGxNnR8|3aJD0jfKY!c45<dlkW0FP;gNNs2JzEbb
zo@TW8C?bcKKCN1I_oh%g(FP5j=Fii35q(>+&gm~MmrP%i;O#7am;sRDwlfJ`$jtik
z{?7LHwqL^oJvO!MAMBdm2o+12;r}z)$S8}N-;2dcWKKRQDbn}L^aF)lRwHw{4Bc6&
zw?Io-J_8fY4oSX_l8QX5rsUBgKGb>OBsCx?5pxqDekwU!C5lhFLbqAobU%lYukS>X
z5Kwmd(z>Vo)CPv2*926i{_&z|NWc>vx$535$)NzA9`V%S*ufnq87!%7x$Ph%8oFGU
zf~btb;h8aX@CtkO`TL+kONwh!52g}<_R)&HrJrudFX}p<Bv$W~Tk)x_3$VbwqH&td
zRg*V)R8z7ca5Osl5=jK7+ZB`{OXf2gOhv^d%j0AU?q+>-mmtp(hGIio9V!ob2$&Ge
z9aWmSIbCMzT)8f3<U2LfVayhyJglg-PA^J`1D*<RbJs9iYV?rn^>*QA4hG*vJL>xD
zbWZN_%T!?XV#*aJ>Z@oEoRe;`HY+=9KS)W6cEY+7@clv$Ea;3MS&gA+1#p9wCbL(t
zD_PN1x#T0~royH$n}P8nHY0oBJGa$t*u#$>n426V`+kh+Tb*9+@3I#lj|>0{r4@0j
zgL4I~S-AtR^I}$S=t+Z15uAOsjF0`Xh)=53>Bg>hEv0}YK2+ch14S@xs)J>^fh$G%
z-9gKpU5x~go+uYzo8;q!ldtN*gQrhE8s#@S{(ZyRb$=W+9<HH`s@?$nbcZ;!`crS~
z&(2R@ssFq_?R45_-PXy)dArr=o`I&SdGLMf0uT~UFPg{vXD3+y1>!Eny>tXipt_<Y
zt-}NzUoc0jp0&ld-8Q5Z{!oakqAokpeI=B??VcW?&bXshk~~1w<IcAJ(ix!oX;*#s
z08n+Q1%kiTZMcU%E+8mFpM+mQ2h2AhsuhSWV2B$WGX8?g=u=W?gIb+$4qj6{lIj{3
z=re|qtwcG0&8KRuI724G_S-7X$J^gj-0=oS#^6ITL@;<oG-S*IeMFJG(i$52@MwCA
z&~Y*%Dn5RbGmKD_IbCpd_;}pjHp7X9ebk3Mmp#XTOMSF;;E|pQQxwRYE-y~37jwtV
zo$jT6TCQ!ZU3v*I8A*<M{)MDg?S`cU;=0eHy}D^<uk`y%i<(;n&6k!|G*cY{RdWn!
z>g1o9WDh3F+P}B))Tl8TAU-$gWYFi3fxf6Y^@VBHd447c&!mSMHV{%FZw8LEAAd~8
z>ZG$QNCv{ZFF3a1zVi+}m6hyh363%kN>Qx?J+=4GBBq7Y)7&5;km3xigEfKl&-m;(
z{;)jrKPGS+VY?QTwn>JlZ}73WXRmSHNY{koU19#IGjS(EApv4&&}0f>3{8A#%f=?S
z?fEoul_oU!=ad<%T&ccjacJ!9!qF!e4o7JavSuT%E0fmtapN`Z3~$9`Fc4axCE2RX
zE)*FdYPgDp1_6=n9KkX2u|xGnVc#4$^Jp~0)A)j~`^KJaXSJ9+LUM7~`sYF-z`|s=
zwz+AG`Ht<^SYXdFA>sGQ?LvF6HFJ`CQM0zdjH|J@Ql?Pal=76AE8A6_-QESwz)M`u
z`Wz%<H~d)ga#C>%hO*=gMdLKsC&u1u57jV5IzKeaLg6Io&}v1X%NeN+!~L{_s;Ggz
zP&P_3K#iXWMb{Q=Cck#MJt?Q1Y$$CU#fN}G+AjT|9vxb;g*+Pg_TAcf>UCa_Kq7%f
z3sMW4-d&44jnD^6lcvbYpNu4Uh4EVrXoSk8DkLIvT{bsK#!ULx8H;8lLroQ@J0rN|
z0$GlOv&%AUP{}vockh5>YasB)Mr5=SnwHMZLRBA-5bItyV9NEXlLUF#(^(Lh#8F}e
z8+F3-%u?xZtqKC!^t)^77w|mm;xr^}`<U54#cmB8qU=0i9%U-~s>m<CzY2Z-2|g?E
zS?ad}XU$<|UY32XSMg`D%a{FCDqK@4@SK;_my1+g`Rhg1iC|S#U+q*u^WLPxC#&Lg
zSqJ-_dMZE(LeSvwzKH@?(EEia1V1bkBxZgJ-3^QVEl>>u_mt9IDBd3&y(E*lWo2Y0
z(Qit1Z=LcIk+2VoJ=5QvLmYGuqGEEd&XH_z$Q!uwy9_R{4jBd1{TD{B+B$HOzlDWU
zZzAxmp11qohgr2Y*EO%sGoy~JD746o6!6N@{#Z^yawR4YVppT<YH|tm+I<93N?NDn
zwq=dnSFGX!>6df{Mw3J8J;xg{Q#(3P%!kC)fG)kzYCH@zKvo8tE5!`c(?ohD!m0xB
zt|$e-idn4Tgd{P8qh9VP_FjAi2_*u$j#9*f;Di$xZI9U|5W<KQW`(Go+{RhSCE7s1
z;1kbban6iyU|yIar-r$6BpHvSu^^`_O38qz{=7<n`>{R)r>fbyTAQmm<TuoMq{8yz
zA;p{|ogn-RHsB4CVVbEgd&wxjdCDydjeB*j$m2n?bJ1-o>c06hYAW`Qpiy*lTj2`F
zrw7er$`aO*nyjG!`?IJ&Hu*b%CnZ3Ff29#sjA47h?@pIHVgJuFwVO56qT{;#zvS_0
zIC+3LM4tpJ6)L_$Rn=*+EGe*J)kB#i;Jq0Ms-XKmM1tqe&|EMC0dqIrJ^@JZnp>hY
zvA|DuQb1>juz=PWLrd_xzc<?IWI4A6lcnCl(^V)f;XLawQK5)K^7;qoN_Ae)P0lst
zs$VqaGRe9~RODfYt!D(p8#17I0MqoRVC#mBYK*;9GOXEw%gbEvwP8*}Rk6v-{c;JY
zwLxB1NB1!4tDPD!0J4i9Y_O6`1zj9r7gL&}BlyeBmy_AlZO|>pUrM=U>X0h<?`NNt
z9SL$Hd>|lX^l^00nf1NEIxj`l);viWu6ik&wys--lU~U62w%vs0ph5N_gpl2mVGs-
zoO4294P7%ZW;N&RZ`Ad<ErmImIudl{uw8U$&?!K$%is(IoRoRur7PoHyWhXE8e9=W
z9M5GVbfyE&#|yB*LoGC{Nt#R02we=>I#EN`LzLIyVP(Ob1$Es0szN|YHHk`BLya$h
z7)J@6H~H(}$*41P&82*@@8lmS1^2Ku9WC#Oy_(J9{%lK_K&LVzmy`kLz@l$_`pM`7
zE!09PILkO|ft|4K4Ov`?9LOo;;OSR{Buy!hjUxa#t*Swn@>P(@yLhkX%1Ly@tPj55
zxe0pH;MD#D2A+R4dVMs;>0;!Jl^&qGQfOSain|iX0nyO^2s<QIom#{lD@UQa$ElRG
zspNfw%mm6s;zMYDTSv5044x@xj@mL<x}4L=ic4wue#R(VeZ}ZCtfU<TcahUN1-OtB
zKm6HtSE!8131$b*-(m0BowQ>2D}Z<#77)$?uk<B|!j@+;L+Ci})~gJN{Pl%zwtV-k
zuj=lxERo>=#an(%Bf@O``|-MO5hyem7+b<wZ8(Uhl^`Nv{<q=4tXA;K*GW7HIiY<X
zUiq$PnDKMJFoQ`u0KDZMKneu7$PlD07!n<L+a?<d5`?*p;sI!bEU&IgbXwJt0jaG*
zz195WKc3s<Gjb<x)6`kUZF0%Ga+}V<t>898$i5yj?;SZk8SLFTy;4oxvn<tOo{dY@
z!x+Das~Kx`9zKojLx?F$843%vCk?~OfRmqQ?(lV_u(^a(oYRE8@5v8qrZK7ujJ9q7
ztX@9)z#2Ys*+HiywPJ;67d6ZjBPOy6hiU2pYHDj2^&BO;>p}PQdkGmZEusR~g7s6y
zTIc7iG&K(WuFJlm$GlA!`31HJus6kwX{4;(Qu=%+LL5@DVcKwWGI(|Y{T!E<N5nwy
zvq~|ndBauL>ZuUdL96CiHp)*I59>R-ou~9nR=iNwg3&_hl`*$S58(8BIpdq3^JA%q
ztt4USRnDgk!dw8H6a<!>A(GRXx~>gU^owH^Tq#dQ26<toIfL#Y4}jRs!UnM0z;KRE
zZUoe50bdtm$Q4AnV-S`Uda!$&UFU@z>Vkp^c%zcT0QgX_fK;%vD5Z%ORA;FA`Bu{B
zYR<&rOw@R*=<EX8KVr0WH6z`Aq0@l+VwMoumr_%k;`1+AnQ9}kWWl?X@5`2($ks)2
zvyyhF=tPY&4QG+pNQZFDIRBCr<PLgoZPEdEOP$Pl=7`~(yMpfnIHob&g%!H*XT#Cs
z>*e6%Q%V3%z6H=8Si~@Al0g8V#|Ez<gSSHjBw?D*rv%_0z^lZL?bKz6rSUmrvd_ZC
zhV!>+hd%*GV3-9b$52Ciy_Ui(k511ITFry+LCzIRF+a`he?=*A#&d9$v66-qmIcm!
zb75<xA@m$7t})LL<on8}iWT!V9Dq>d;pJ_Htm63;!e<;uk&2+wRf0)nmY+igSk)*U
zRB-5mB^{ZQ=B`@3L9hcA$|8Mmzldg``V^OJb)TqhD5v}Tdu~_-wo6C>5Z*@4_4Wyy
zr)ol0s(;pflO%Wl9J}=cyg-trhN6E8jMc;B<?4aJERaq%SayFHr1*+2y?;9AWobVf
z&X)0G7i8WwY>Z>}HM_~Vys&`-7v(_mcJZ%4c!N?Cj^eG{LP_`LNhSSJoQ{)0mmM)9
zU6T<qOza^7v2-D)kX=fX?{Ak;Z;oWv@7|FZ5zy<>%hG8AyLM2Y+aNw%`?6a8QIxMp
z-C5ZF1|vOd;TH}rJdCdQ4)aE~i`a%0ky9Q8<Z7gGkjobGRH@UIG=n|fQ{!F?8Udo0
z2Fr0AVfAg6rD7I`bBiLxR4)NINGl_mi@Ic(HG)3^Pa{_KphFJ@0`_NfbfQ&_Nmf%Q
zn9*+@f%r*PJ1AkT!SdOhMXEz__^>pDTbMf2fi}5!hieF3k>{mQ6z7I4OQ+<>qiaVx
zO`y8@(IClE;yDp29&t~p)7m$q(HuaaRbTiGeNl}e?|g6Q8sd<{|J6g+e}!5rfS<r8
zoP?vTU76vU42(R0yYQW$FgOWUL(JPq-3B1UOmWJ=L7%=OtL#d75_F1SOBUxqDgE~O
z*BBoFxt`)BCwYXKz76slok9dPTKqjkZuT&GPKV!l*TvwTNp*C2t(FXGo-|RfhJYcK
z1t=1~URph*r%VjT5oVlWBpq~(`dYsW?7?rgJlu`%lC?TQ`m)18v`#-I&|Bb4xaY#!
zR12lWU4}0=;<laF(wve{9CcuazT{#TmfSa=+-b~9E)rxk!}$7{b<y>O!YCoibV&Up
zExXY%+YsMnG|>?UT$`+G&@AY}(QTZOwGq>W;z%;ZoLVdav=fi6Ak_AHj9LqDndJyP
zh$hF7a>RUBw>F90S4^VKqD_|{+<b`>!)Wl*v(|ND;5VXO|6+X}T3Svau%@WcI<0wN
znK|c<BDI5PoQ_6mkpOSKB==OA?poxw=ELE+A@cRjDkCR1waW6=>q`mu1qLL*;bLMd
z$`M=%r0DD!Zriy<6k!%x^MA<65%X05mxi7sl<V8pb@9`p&Y*CcVvccJ5-)Bi^Q`uL
z;Irmq1Bv;*b9{Qy31S41f5e5F?5h+6SW66OM868)PuTmm6c7xxe*X2B(7R#IYq`7&
z)b{*EK&YvT3R~n8dtU<cB?~>_t0OAw4RFA76#HQmf<ECS_r>9v-ZsdC2~*SdZq56G
z&u^?*XL~A$<uCj0oDXV{GfI`toJg@-iXR)I)t1B>Pkrlzt$Z<Jfa~+kfH^E?gJ1fL
z@siAQzkVX)6+9v<wiP%<%P0V+;##!UOE}?$tRr<-{Q^{kC9jx}c~Qz`tF@B0(Tej5
z9wPtHTumv6PEJiV|81XuPvNseR&BBP!o^urBYD3jo_^Yz(J)E4P3+4o`G~m7s<7c%
zoG1^Z|InfdPD2|>!G<%wtr~RzTf-=2Zbe=Kw52n3K*GYWMlYGo&_?1TOHxkP@g$xa
zry+9E0K!q@dgCO{iiQvx27pLziLjV-Gdc{XDHzK@pm1K>qN{*rb)+0Ms2;c4I9LBq
z7=4Hd_!XzWb4SZYeVsYXXc>A*KL&DjE$P`~@|Nlo9K-<4N%PSxos1G$GzjDqT@I}r
z)WV%ZmI|ln7GO9|%O8L#D0ioG{$dR8AQ{CJf(JTU1R5C`&^g;~24+`cG%4#0=KWJG
zh$JRi+&eUKT)^_4(jkKpk|B$E!uJW8ux`@K_c#z}&~r6@$7rQ*N;JN;0YFiQ)}Z-n
zeD8qz(MgZjEYyEzLEut$#}k#M7nou^iG6v9&GQUEhJaa|_*LDN!mLt0pXtSuEJ!k=
zRZvoWwnh+KQDFwX5NqQwCkFHv3IJE~wT{N|B6m<=I#5JS=v=vS-LF$BvH8-%X;tr|
z%&(5yBr&nPV(`_n#N54G*-}Dd#&yvntow&|#3n+z3Zwigy1Bk(Sr}ET?4vDe00=1@
zCt64%O*uI^&pd@Whtx}0t}*@vMvW=D;r^ie5d0yCRO>SwmA=Ioq*w?Cm(PpQt+~=p
zdWU@azJTRW)vu5}0()^f)E*76;Q7!RuuNq(ohK4HxKk(kp2P(xS9G|iGa(u#CWcTg
zp@Ng5DAD@}Hqf+DkQ2H<VZ_nN=}Al4N3K(>w&H5eP27mrC~eg+1%p3pX>DN|qY2f0
zB{zCd`XFgna$wX{JvaE7xI&!tF(iDJ<uBP|6<2}C<u`h3qKLIhdO2X<h0>89fYg&M
zqjNB(#Hn${%?R6Z&^);?CcyL7@#$*-|7xEeMl2yJ!W&NtUdz3@<RNUZ9}I6d?yj1a
zfLEAj7{@<k;2L`fLx=*9PVPnM$$!y)+d93xV0r(B!o@Kz7E{?{;s8odEse+_z;~h`
zq%m3_x;un<RrWzMhhIObatf|(2A>X>bc10D0#atlg@Ahs`Gv;lJXEo|8&w0b6Qv*^
z5RXi*%sNrPbt?x$$sDHGKZh7{vQ0H1ZRwIEJ<K(#^PTo1PBjb+v07i@X!&*0nTWF-
ze#H2CF0n}KaW8tfy}fO0AOt^yhu#1U8qUF-X3Y0O2zrh+0Skom)oR9F*_$qxvuHlD
z<@oAtIum@p!udB3lVj3ZX$UWPQqOD|1qlzS4B_GfKBKIOb?+%HxTLI7q=86=s1>eq
zf+?K&@6Rm9#!OIj3_Fa+NRwDtV`(U+_DhTHqvKnvX=^C`^chw$Td`Au&DTc=j56M-
z@{DH``&07{F>sgR%{y#fG`r2$Ed$%5&br!)H3wk_G1M&GBPRw!p&#6vZ@{<I7pT|H
zFwoW{0gl$?05BW0DFBe0!?-`or|VwieyK&uma(;Fgj)-rdBH5-HQN_TzUv;gj+;M~
zrur^Uwf>7(Xjc5SQAB2D8Z$6zmg3GsX#IHBK5reCIyVBRdez30833L^_Q6k|<PWD8
ztxn}6Vf%pdXI4ir75V*xmyvZy6$2O~!&u2RrS>l~0wv(f3?aM~Es)yEqn(E6ED+Dv
z4zvbwp7~rJrTv8AREX2*Sjl35&p?9V5T0b6stfX*jFGm3K;+qx$bat!Sx588T}|U&
zVKFl6g`&~Lb;KG)Xh&lavUWbXA^F!<XqLPUQ-JXB;p6#@Bar561}H*p|5eV1v(z+e
zD%gTpdi><%os;zUQ$C-v)yfvkEI4*Y?8--jYAGsgbF=&atlECumk@v8VnKkgk||}F
zVagJ(tWkB684RrHbtbZi7P~Gp#jA1|D{e$_ng^&{kVr^UMaKnea@Zr&>-+9XXlo5o
z0L)Ptt(T+mYsr8mnz3XArE9->;0gS5b1=Z4Y1)lnOSUJY`BUsDMfx$fjw%iVm*y`l
zm8G=6o_bAHB9-Im^e}}y<Yqk|)T1+eitWHs!H>@M5xzwVOCA<RfRN`_eKZoLy7Mql
zJCs(3y3+peftuzPSa%S6BnWF_js0QWfP~$|0WVeH6x7wef`Ae5lS<;L8NBWrrJ}c3
z)5x;RL}B9fFw)p^AjYYi^C$Kb$|eZ-vzWRe9t+--p+o2kli9GR7CT+V7d;gzGUvzJ
z8WmIB3FkDAE!SP(?$sDEnK3)fe8*DUh4J=Bl@tm6Y#0(DN%EvSaw<UsrQxGQa5Xkj
z3n>t6a;BMc7-cuUN<5w&)V^JUqOdqJpMTY?D;9@hMq5Sp)h>HXy$INjz+LJ-tjfJ;
z$JC=Urn%yPex2NiDVKWyk;Qxh71cHCA|n%;FN+`z`b!bw=`Bwx$i2_<LEa@6sat@e
zKKk}W^nV?lJYd2d8#mc7T&|v~h(I-B=|AEZM&=<%G2&V@Cl0~!ilspkjO0Bj>J1Hm
zZ+Yospb4~xt>eEyHyIl*a_07C9EhFU+EGw4)P4Nt3m&gJ@Nb(x)@&hsW4EyjX(k+d
zv37qs$I+yO+Hb7(+@2I8@?r1HV$pG9*XS*sTF)aIi`UdH%9*+kv)}4ByXc06vwt?V
z)npi{Fqf#Fj3K{}D2q4HSgm1CT~*O;%MuU(wqdsjirc2HI^lt$K<^w{sMk^5ol`>%
z-Ta7f<{FV$v_e4!x|u!fz;&_&A<`(x9Ck_@1h{4EnG%oAa6jrXq~xw*_jdCxE?|@l
zm+eWIOZ}C~vS#$PM`D}~e7^*&sE(N-NXuF%XM1y;Jh7Z%ZO92>Dh{z)(`a$@f|y(A
zJY`zdbYmeVZg9jVu#d2~qK0=ge5zScS_bUMOSKYVX$x9gW@CkvK=RI%k-TjRA<yf;
zm%8N$8D&SvSrPT|oSW`Nbly5U?shJk7icd%X&qd&4jsHw8PW?;J9KAtX=<LOACVU5
zS5Nf+BgErV|BUgzyLo8!UhHV%QVNQ`W4|~lP=t0-A76JHw|s@ixxTu_`^luOKz;<e
zjSDsspt@ODNDD;1wE8yBr9Gp?_KBlSXUHO=z7|C^X{$t$7@JYNsK9l~*-E`SFBj4J
zdU-WB7d{Tw(<`i;X3|m$jZ(}9CHyJl&JznNY8pK^)YjPW%4{&67l!IdVd}PbJ5jO}
z`<?mX^#cD}rb9A<E_ZFQKW5zwEvuRHWgjL&MaKpe|C;6lK2nMkGlzMRgBC^{E+1Y!
z=onfio<Tv+*GVtd+j-KUO^4{3xR-?^(I?a7Lz>SE^U{g-NhT_cl*K<?n_LrY-Ow3W
z6osBoSVfk5=UQ{rFMW2S>@2;A!?ro{d(NaEZf`4A8WQ!TACm#A@DzcC?`<O6K+7Q^
zH5Dep*mW+#RYXjA)z3H32AX^cW?riYXE#ZbDK;FI$?s<28{^K)<h5F{0z>+*T%PUb
zA?v$!a#+<4J_H#_SL{i^E`6|4`4ou0y0s2vfc711_Kua61tM8+Nx-)P3K|2IohXG}
zMkq^)<Z_|bF!hwgUj*GV)SEd;)UY62^9~D-2kM@Sg}K5?+Ak0<oTSf67e=)z28Wgu
zbXh1Mmax^Uf<{B`%q!lLXLp?+o~-``g_rwdc_LoW*?EPa6bvWC<Tm1}f(ykjMalKn
zvk9!#aNPg;4Pal8KLS*#Z+T97D=gclUbeebMGqd21XsFvxL583U5AJX;X6=(E^7{Y
zAX$xu!3Dv0TfC^u9kGz=92YHH%Laf8a*fpAskGzzd=9N15Rn8Oew>54qCU+5q+J@Q
zLo`OhwPZ<jK1Vcx%jm`3h`6)awH1X{?U`0cz9#X`!il;EP77<7Mj6RhmevIinsJf9
z!cyl%iGQpSBOP9~?71k^C`9W$Wlx1pC?sK#GU{fvCjezoF6=X)p)>E(CF8$^c}Kdm
zbY-w%-N`bg8g=3m+!gQgy%+W{K7kDKC_^=u`W>GW0iXk;Z(UAAin6kl$(ka7bPPk@
z#Wa|PJ*NfweJiky6}RM$K^8u;X2R)~^B)f1C`TTa*Es;0y&CuG*khLx2ya66*vW{W
zgFT5YWXOsyWI#od`qaU*C3oqto5g!$ZH19|5C0t~z#>lBb|kj*Q7mpcS=ooX^5oOg
zO$hx4BttgF^_2FH^&bgETmXYozat;LQ)+cZ2lNHX_sIB(VKoA#Bz??X>IK}|t+R$a
zyQlxwC+qjJ%<sg82u98wjv`4aFJHLkjk>GQduMqmQ2{L>4#@$|()qgzt-G*{N2SAd
zlV?w(_WD???9%d@m(q*h_VKM7yFwBToz{F9CXTX9qUChrcviV={)-uEsC*v-4Smw1
zWcN}~1`)WIoZzCE_xnoJg3KDyVc;DKUfRGkoVUqQ_(Cp{X;Mre6D}vjG%;liU*M?5
z;j`3TK_LEped8xRN$5SJlLmZYAT|=B$LZBn{OJ*x%l%d&8I*twn?wvUdR=M9MzpFp
zaTo;rC&A-=m^cS>i5gQxeGVT{2V#x7Ox7aH&mtn2Bn%15rxV5hg5HPw0FBCUM$Vv0
z#APfbX2m}*>{=K?3^ka1p2#pgNcsTLAUrrrV}k9}lXayC4V>p71$0n&5Na~Px+YB|
zoESfK>!=<~^Gq>HG8PPmAm3BV5&K=)m@l5qZB`wlM+4GjlGX^x%mLz%acPT}xC2|m
z5i7daqdFOZP|R{fj1%hvbVcu>c2h@RfP!@{BJ9YTke3okS}B3Gq*Frbql}I^=?*!8
zP@-*Z;=zRHq)`VipRzUotz3s1#_FU)N}HqF)-lbixGaO7DcRI=;5hzBD%?V!X<ny~
z7$BgHHFC6ToLk8_RMc(BQzvY8q2!taGMp+w&@!T;DqP=kSk~lYJWeyj9Mw5nWhM)K
z9n9)*PEMYc<Hgm8^7lN}icp%{DwnQ?z<@GJr}|sH>Vp)YQvvRT_Eyj01NO05GKqGc
zva2&+Okwf$gMel&4(-U_FXUOM?AOL-clv$Vu?&0N4fLurB2f-a=ugoLL*e{Xv+`Nj
zo4DDFr_(f<uFILA=M@^3BA(xHl@}b8D8&NZt`ZI8T7j2`_h5POKp33PXTchEeQrd)
zfPVB@dS0?W>B)9^Jt{U~Pcdx+MR?O81R0wH<y;H~v=>G;9_Nxdi*{iJlBUKV$t@Qy
z(T)q$DkQ*a#+nQuj4mT<W?<OJTFD=TQWz6*07NblDFM7d#v6+DJ7n%Vp0T{IgdE*H
z5>Hz-PKIs8wxin>2OLq}V_~$@sR^2qhR`Do^9$zoDCli5a4mXXTTydnMJuHyARp&6
z$P>DKFgg2~64O1z4q9|gtMY0VMuo&c()@L<b<<^?9Fj$IHqUe*p)_$FPbLYUhwFGc
zM(Y3uw$LwzZM10<Q8J-J{~a=i>Dvm<dKN_n54x^?>QOrNq${1nj)|7Uy4au<29vU3
zF>DwMC7%r)H;Si-N06ftgF`9EDCmXuGN!4cHLksFzdi>6_u`ZTw~UqNhDRvF1ztd>
zz+*k{)bZr7p-`_0Dgf_IIWclMYZ)UuGwEaG9d|`7P2$qLqGn#9X6%h2A-l{gFbfqP
zxeE|v9RuMmLEt{gvm^3ip+H<afW1VAG1F`HK%uPlYbj40tOvjGI{%yY;K8;v2LL}>
zE%P#5Ok<AoC`2)Y3>~wcdRR_mO=NJ>%qj33U7R7(z@#x&Lk7MKn!!pUB7DM?x2uF$
ztx}PfM2EatuNU%=Lh7G_bscptzTL(F)?mIf9nZ(sVG>3nvtsV#owA$bC#!VY%*lEY
z;0xvBvl`a+8#cqMBRxRgf$_x72S`D}VK5x)qnB)jvVL|JHOB3-2U2-}PCqV2C5-Y}
zslxAHh5r&QJN$oT8bOD<dGJ(wNjt~E0j!R7Y665!)2B*5<udk$!H+J*yxM`q=ANNE
zqT9*mfJ6WXN}M6YKscCVmIM>*0(AQd<4h&8(0YVXf{PV17wcrAJ}3nN5~!wTX(2oc
z=cMvo+CXnFZ%nSWcfJdWAxqX)hC<x6`C^l*lnBL3D?|g-xkTjKrzd2Ju-f|C_XA=O
zfB&tZoGpk%r``=?4qpkuYVECNhakYjlkyRA#M8scygYm{69mKWijxT8i|esGBd4u2
z5Kvl^`d5u_Qn(rfK1h5LOGZ<PN4P97_CZ|~=~$K<fxlzO*M4Dpe{0#1g51$dMD!cU
z4A-3vsC@b?n_L7QiFEpbQQ?HiU`daAIhoM7DfXQby$-4G1l+y?YFUC+EcC5BnjoY|
zf0ROyn#5`o)SKlk?gyiY%a%ToM>-;$+js{&vLP4PP0$ms0je7ex#h@k@Ww^K0^6bN
z(?tag<5}~v(>fG26s-cd*|VZU-*VhQ_`2-SV|z_n%{{<?9Knuaw*Vv`TuWR%IfzO_
zQ1b7XIh|4X)yEEpAg^p>s&`n@T!ch{LK`1lO9f}#=m3&sPNDw#xfTUu-wNGB+$G+9
z0ZV|kdzfg3K)7c)K@e*Z*T%*Y{T{RCg%0i)?$gyk9mx_AD3~JIA5x&S&QroT6_}F%
zqa~+LE#Ls$knX{8yLEEWkxb-i;qHhIP=c^Xx>_-KH^a3dI0j^3)b|udrOI$<{vlm{
z?O8iY$Ek6)EmIh~J6t+UQi6x;OwrbY{6_NOEXnB73BFZBpEB4XX^D;-{?xF2XEd@9
z*v{cB4ZGB-;Gf_EX&hh*$>PQF&ZV3Pj#r30WS^@zADIpD0?rCQ=&CUI3gYn&4WVD}
z2vV^O=9<{V#ckHVp5__2eA;kO_7(gBSyH}2<Gr}=`*Y%GIg%C;_yjf^V@7m#jLe9f
z8wkKG(U}yv*dw@|(ps?sB&ZN(+*u@n*cnQt@;p?JG$JzyQjPfp159#$3Kj+knz-9g
zK%f(9yOI|mYQhfijW`2B&cQ>?Y(Rbz?IC_W&}Ol(4Es^`8xlmLeCZS_S}~MV%S?e%
zoO|3-6bA~q_v%Hoxg*h%?O|Yzfl7cU7x2!w4e89R_1IZvl-YQpR$Ox6HY<L4t|iN*
zaL;RRs|Jm>X{lQgDr)m?RRN=##)!VWKLyEJ7c|gG(G|k-s7rPePqjHDeAdTGT$KQY
zvdLk=87{l)WPzhq1W(t3%?QK9t7GB6<q{0raNlJN<7H#$Y?><S59UyUl@oa+OFjy7
zS~77hVhWaxUysk5Kt*xy7Qi*A2faQR8*a<^PpsPFA{SNHqXVMs0&E&HR4yl5hWe8a
zglnp|M=?MHwumr~i~2w2N4Er$(s-zqoF-SGL6%F;3a%tg^_~PKP|Va(8H>do^rxQN
zv45iVxSebLN1Ui#pRzl(_O^L)**vz|{KC>7Qk-A&-WSXn2Do1zlRnyPceYs=qO@QV
zV&D=gG|t<EX(huXUZQNqUYin8C+`|E&Z19X7Udbo0051<HH^A8k4P}0wm=zb;TUSM
zowxDFkkKk=S+<)2meOwLq@oQgnyqF+`munaVmdT@oMzn#7~9Y^0eI~dpsj2?=Hgu^
znIqmq0?jIW53y%JieZ*MdX`$|L2(_w_aoVKoqPAZ$%=^VAnL{Xr34ty*zz`WO)4|+
zO%khjI)MiYxMm~83BeIkwy6p+9+A8tz-Q7|!es)nRC2_0o}o<hA&n#Q=!-h73vqs+
zSTv5ALH14>WKEy6NzUh#CT=()91MI*!6c-Iu6NSnO=t%=E$1}(&{c!Cw+MHW(&Nmh
zQ~K4@f62VnkFE(zhE+B<=$<%O85DTjyf&Sg+7{*30RPg$*X0&o+^q$xCUADMDd?>E
z#|HmW_Zo91!@q>=CftnVs+B)o<+53J?#;8HU>`h=fFfJq(9rmchZO)pK)%1Q*(bLm
zG3t=M_L=0eZ79yAtPoc+;+$VPL13Q=C@|aYMhNfCo||HM54D8CC3OaNYC69ZA>kWu
z+$H#{>QfD)VyWPx3S^MZ*qrM|^?_`hv@W{svu@|&ylZl|+aJ@+&u-bxonO>=*8gLB
z-K`Wf6?rXf>#7)ih`Jg;HXxTS-+L5WE!h)<6anqfBv0$~*d2+qkjOcaA~LqhQq(hA
zQ%!^>LYrdJUx7`^6f+x-7)c4X3&N%?`GEjcqDxX=QKYoAhN=}PWJ6tmtNonq5~u`m
zeq_gdG*!V-nirN+K|*!m>`IKF$s6v|{l(xH#v!F#@i|BLhML@Qz!tS*Fj^E)#~;Q)
zdW$8Fpnwe@W&2s9-P#Ey7mqhk0c<9U7-Pa$dR3^9{fYqMsX!vd(J;9|@?DT0f;`&5
zV6e-Yt<XRir1yHI8L}CCA`5iQ0C5n#J_YxT#xOAUmQQk#2>D?Z-3fve(&Y8~{@J}L
zY;olTo%2);waApYdz#1!GqJ;T&G@MEX6I8$0xq8o3o}>tGs}h01?~C9hoI&<5&YC?
z9UuMXe0Or%JUl$F+o>iNwC7Yk1E$_JdoEpi@Y%B0s7YCy)Y^c!(0SARzQsa6YLQ9r
z3S3$`Oo|C$i2v7IhyB`%WQG5`X=g(I4%r*IgY2z=J_a{BjY%I#+{^M+t%gIxgx{V+
z1eORS$_Om5oBul;iVsCLsGyQ^z^&}S{1WOL%AzlPW~kO|RCGl-^BrFJ18nNzxKpb~
zPpxk{IjD{OxLx?Ylg!Sh=?7H?5>VDmHx2C4tAVTpv`R<cDNd7DPo^w9nB^J~Jc>u{
z^Ug*0Rr}<y3n#SN9&arVcR`AgX<hUcRs0Kq724|PWI9!s4PPO?sf@=I;y0|k4rl5@
z*Xrn$6eH6?c4v(PycMe79`dXS2?Bh+)jLJ{BDgVtuBabx4x0njbYLkqn0cp^1VEJ~
zxga(hN6-Zx@fy9&>1Y&crI!fjMD-wW7rcQBL#@E`zBh}(F}NP&tIVM`^CFE|>D!9f
zaQHatlEc=kOUQ?Dsc|-CcOXz8crw=bZV-L>`J3XGr{4^s&6kABsn1=ou5%Xo-ehVc
zrqjB|Cc_7~Z2KYxt^j<>gaAISgNIEEaJ9>EmGJ*dJwDFR;VY+{4uBMaByop0H&RsW
zY#Z6ta=$>{h)&J~4M=n@z(3V)%2swb8pp3|MvDGMb>gV->=dLtQestzv9LNI{$wK0
zq?0xy9}PTjBNX(F;m^iH#trh^i5><Wi0tQ_@HM_qZWr<ydS`9E0A=6>d;!m!+`ai$
z!h9VTE!WwNu!Kof1z<-X$`B#wmZCa#-x2UZq;JiY`??~nl-tVc?1O%_>t+9^>RvqU
zj2W)h^1PIh+glr=<i4T@ss#itqdf|=TXiMPze<B%nAnfV)f(JF*<f*>amQQooUx9R
zepb91n6BCOcfeHAU}Rnpg-v8aqFrV#l4i!J^<)Ny<P-?k9~S~zW~r1A!#|&(vlvJQ
zZoHEXmZyafqki;UiV8^<Vv?0u`8TDhNTPqVqdUUmVg#rlG#WLfoxpQpBn-8*XSY;x
zb9A+ojWQgnzKFge*3uwqrK<VP(vX@j|9g3ZdkR*RN((@KH5dZyi$qU>ruuIDY)OJ}
zPWr0S$)}JU`;j^IT-osOH$X;(7*pGeQBu%}^Pv68n9L3IR6+tJ%a>dt7z6IYRVk?1
zv)M}n3&@6L*KtqJ=Q``J;-&4sKuyaBOJB@%$e?sO1GfS6wPNz@&xSyZi)89LoRdbz
z@$k2U3CnGvPfR{t;QAj37YM$HwzKhe*o{1dT)UbVzEiFIEcpb%#zKJ4@71Gy>3Bvv
z^h3&&U(|}@6#(kQ<4_u}OOnd{xL)UNO$Z61U($|))d_umoMbU-qee~?oqek`+OO7)
zXi?)ST(MqayC)k3m3uRbIr5}B1CQtx<B`uUX^Rf>L<|h$2>+T{dRDH4@P466_(PeW
z@C1CdBlkDhN19nZ@7&sLvY<@5hy`jE7Zi~C0810Xz_OcxUfocau2jYiB)YCGLV9)Y
zGxjl?7p<%g<lP6JfBG2k2=DLutyo*J5N=Y{^zJM759YBsWb^@T+lP2$pUxsl<Y>;O
z@o)%96)<AGL^G_-T{4WStf;`)Yd&6|WAtMce@c5JH106STczRna-}&Gm5>H)qw+N}
z11JkoY@i)XGuJ;}!&KWhN()nGrzfxRg%}Ma#fpEM%@qcBN4ph*U=-B@M)fBdCXEo!
zIhOUNG&XjEMCU=f6;R#x(ksR!3Tr(1el0xNK718?YR=VnrHxNK1wI3R2fiJvFVYw~
z#8*Fy2*_{Z>Y0wSLoXaOc6xHO%G%4Cj>XK)2)7y_U}(ilz|mfrYKJ^}oWi?^=l&nF
z;3UZio2c>eGUr<9thI8lD$c2|6AN>!mhdF`MwHm~9s*Hy1g?X0X(enK+O*qohlb0H
zu4tKmH9S6-bdXBCBc&sDNki#l{s*L=;xIsn<<qoy@9>5j#AeId#6(Ioh}{k5m`5bA
zgyk>T8hcW9TatXMpCcB*RK$*~pJO@(f>lOvP;fLEM)2@wXm-XxX1guSHO;iEH!rkW
z6Fbns2+-nFwcgO#brOFd&c<$Ml*a>l<8W3?$2i<L%yb|D5&ofOy?f8C*QXwRXFrKg
zox^&!k7+bu)>-AP^97IlCf|T$W<p?b&2+^&;`&w#;v!Y}%)ZT_$g|{TEwP8}$H&&n
z#wb@%MDtWhbb?PvTeGpTfi`2#t?W-CfItMFN-d80k;ePmi-7U0T*dSC+F7icT2UR`
z4ySRU0C&gj-pV~m=K6d%Y>2WXA?<rAGzL;^IZhY((19q&u$Kse;bROJk#@j5JaM$f
zVd+Ir)`5P%hFr<UhsWHp#aZv(#6?pLvy_U!kBqYx!^E$Zk_mvts`Mq;3$&lKtbMb}
zCx57YDcH3_-zRZ>t9BZ%TTZ)ywF@YHg09kD?DppgG7NU?IVqcdH43<|A{6a`C0@wk
z)u0=qN3@Bu9lY%71vg#2V8gs6V=L~_kxj45I?F95H=2b;0nRV#DJv+>W$GYD#})Cm
zna&gCK)OU5vzvTF6e)H?6+!$Z^&^P>Mse`+MFf(QE9Bb&*l=0?*Z=Z8ngG<R%lE;c
zs4UxM1O8*FF`QcgBX;QAZ@&c{2aqF_L+AP$I9@P18`zS(&YW21np6ek(>bE7Je1i!
zk0^l<=GfezQiY&yv9{0(e99+cKZ~4XGXr47Dc~TZOzxDU0_7iUGa9A{fHvpcVOmy=
zhfY2#242ESUm@lQj<{%Wz>k!hs3Vy{%#eDol8=*ERRb+$T)fxF7Fx?c$SEp}72>E}
z;H81RmaIeU6JLtCu-(1=%zQ*B%CLc@6iw!7qJS)THK;NoT7e5-f2NVN7>b5%jx=n8
zb4C|K;!kpE2%0r8Yuap#+0ifxl+ZycLW#;rrHnr*9ABR#E^v5vLm23ylwJeN(5~@n
zv`N-v1d72?Z0yiGN+Sa59y%P7ayYYn&s}=4?8&&pv+-q~j@6$JW`m4_?V^oYyd_2+
z7SJC)edtX{T5$mZa<TD<gY_Q{PPt|!t1X=PC!`7(IvK*3Trlt7eLukxKAFQ?1y{s|
zfn7#brMHfNsgkQz!?4Kn0;N1~q*>mz1zhX<24D;7rUmQS2()FWf!Iy{h%MPMYc>gU
zV^%cblF=-u1;6nSzgR3w2kjGzNW@o|BlZi$vH-YPPo3;_wUg_VaQaFK&5HQK*W*|*
z=^Q?{Bm8Pl%tJGbUq_SI4FGFw<IclkQdMXil8Nd#3v%eE9~-#cs#jTaC1xn;xOa;}
zkNW=pV-w^8UE-JDKB6z_y^d<s*3VGu7mx>co<CP#k?nI^_C|zLXeGuz3GK(4v&>aq
zI{I5x{6gb*#;wj0javqMpc8oBdB|Ax?=fh|uqewd<K~m1&4muGj13=ZbG*!crkPE|
zF!uXYpDb#v;B5y1>9TO*Ai<#BG3jgT1nZzNF+4~x?1^v$WGGjO&cZx}sD0ItKF!<*
z34+BNHC#5UE(+)R1WSHJ?3eE)@Z}tqgD_?xS0NtKJ%KMWxJ;|)B&-X}4TWwiYyq8r
zbW@*E>SaRcL1%q`f4no`&b+}(na^x)720~?QL7BZd9Y?<Vf*AWIS3U%21vDLFMVe0
z%(m$l{7%b9FC~e9k6uGtGE>6R$Z`=`9X0KYD%<c8)>*eukzIJEn357W><S?oY4G-b
zT-b=0fODA*v;y440(LaMGoAKDI35_km?P4wYtVq+ROxt6FeYSV0vACn!ol(gQNvWm
zu0)7q)65RR?u0-EYd!Qa!f-!O>td*(U3VAj-kL~6?E|%{BSOX8Br%hLgD->vI+?v=
z%4~{yiDXdTDl=<Y5`LH=$UuisFf+(7wX8SU1cb_}@pY0Ux}MD@#nb!uuhh8ay{&#e
zzOTlR7X1HcWiRgUZ9mvE_I*f*T()$$**14D+^vd^dc1#Dr7$%|+om&28`SM9zn`B(
zM6mjoBP05Wt|BBzN2~?h+<aCs(Q`8+J<}5Y0#bb?PtW_RaB#w}SErghhQ)KG!8HeD
zaw;eT8!GhjnLxmdQaY@3MDQ-*K-aT%c1`EhhMECA=$?LW0#L=n7=U}2@^R7t<Q>{W
zvnobFGndTr)-ot@EcBVnhia0HLjvFk9dujg=PoDWE~liuUwUjpV9~G?Kg0k3A^;22
zVJW!Tdge0w^eku*oK>7-1j{K~b*P?c$#?JW);K0lt`s8y=9w%YF7i2R&Fr1QT8M7J
zB^#E6;FYm60+^<kFR~ggF0#L<?xF{@P}X`_nw+n*&~j7VW}*J;Y^OsVc=eIQt+WRw
z!nt}IG^UWe3wb|9e@lb6sW%Dk%$7h38C~}PTN-c^i<c4)6qKu#m_?h&Ns}0SFE0GP
zU%de{JiX|YeC#m{C`fjov&OGgDk$0SUp=)G56R}PelI@^T&nyy7@hxpMgv6Cz)Ubx
zoqgES0D?vl49t}PH8Ey>#>yhe{j9kK40<&l!wxjWC@+%cXhfS}3l-yJ3?L{acL^DI
z7l+oJ<&AB_7#8VYlYF>BB}xBR(TiRZt^g0q3jKtt)xRL-hl9$Wz@tuEVW+|Pd|et4
z5I7@X9>HD4FfGX9Y~iFMvyA*9%eEDRgEIr=Aqg|E*wJ+|pQ_g}?H5~7vv07{)lmYJ
zBE-uhq%q?9e$CTN!0c|O=?pd9I=iRNxoGRcG1vz6kjPMv<12NJ=ip)jEG47a#Wd_J
znSmJ!gYdIHxdr_z&DJP&n?H8XTmSpCEx4r*x3{;;rPR-UsZybL=k1H;tK$|I*@cFj
z>tgFBee=Vw4PdXyreq{&?JraI&1WDA?VW*!#qK!G@+qWGhHt|KQCRDO&A|d_UQu}n
zx|2#>tYfpc(>7{mu7O^b78tIWwV38;JUX$AAniH*zG1SVXtCfb&(--HBr)lu@hI8M
zBSzrLp_2AAswDydKrVq^4nnJha9oiqu+xqSiIi5*4Uz(OjgOOUTScf!ImT+G`|}Y#
zgBs1-2k#{Tx{q`__i$I>mZ4!OB~~xteWKPHS}(8L%h{``uY*GlU!lK`;E20=ZvQx-
zXIJ@<xY3R!^z~}bhs9=5#|uI-CT^Dce_nCRLg_Fd9$)bu^RaWJU@K0)2WYHy_7K72
z1P2VqAu2yvMnT&p$=~E;(2J+9Yh))$2>=;*ToDS%m_%w(vUbk;(^aqasEg&}D<^R4
zZVXJg7vb@K{l$u7D_OIu>Qs3%k?WGvOxcSmw0dE$qMjmxUi#2#?2iLVN93B7)N}9V
zBr@!#MVvH5hYlan`Mtz&i^^3lCZ+v+AJ(-q-I&ZHMz{3AiW76xQd))Uu3Q*)OMdZl
z0tGh?P&pku{!h~O!skw^T=?8coeQ6Eeur`-Otp)gJ8?gVMfzCim{<18Bix9(l_uE#
zl-}&>@R{G8Ev!^I{~mCLLraRh_J~1}lERZvgUWVQ>v@1F1P&NwIks|Af}3aX4Bdw)
z#(O1Pr!u$lygJDxd{!d@0nR3zlEPc8;~b<IYM)odcH7f^e;p9FDIJ*^t>&JH)6j0P
z3*mHZ%{i-ew93Y2jZpRi?+MvO(4}J57bmL{?VqeegJ1bkg1%gFzn@HI(SOa8Y0A-`
zhRq^&$7@LU1|Gtrq9KSkQ9*nSo4=AQpI==|?gH`2wi}8yehG;P<Q`R0tU4?AvXTLJ
zFO|34Rh6Dq_w>AyiC?WJuaa+cGAG#P0zM_Qz~X*FC;quJ!m4Nj8|%`#4SWa>3~gW_
z<_s_duZ&+=03X!H;dSL!1}S@r&=ggd+gY0LqP6_}TJ$tp1M7qh@>#(!`hw9i9AACf
zMS)B()3*PL>IO2UQPK|dj3<wHLGc<uKmcLu##hq>{TNF4h3>JpGF1|lR<hwBdY^!6
zJ&L^7aUm8H3ks>6!?hu{-zc&Kb<WH6lz(W}34w(zRuVFpBDA3rgn=HY*|I;J9UZL0
z7&my;ompVUl9=@0g|MuUP-8wd8awrQh5b97U}OTeWetk>UCU3NhsR!u^kG1G48*-j
z#Qd$bh*A6P+37i?l%>sqjvVZL(~`Z%fV2jie4|q-=Q5*)1m5Yw1ob7&pv`D=Hcfj#
zho?F=39U#5ZzLteFkrj@fgt?|xY?4D)SLkf@4)w3$zdi%Dyk_CUu{!DX`{qNK@&#;
zTIHBz2Tlr_YQI1w9n5TDkbH1O<IgEFxE=7f1j0_+LjIgqK2i(Ook0<&wtCz$=wcio
zPgm`{dJAR(`cM6;4ezT}BhAs;&f1o?9sd99y?cKXN0u-=|Gs>R#`6o7O#31OCgGOH
z*aGy#*sNuT$ug{-w$!p4B(+8@**Kf*XMfMFu3at3Kr%bK=r<E&b#+}%ojP^y2RdLl
z;N3K1=-c3+eA>9X0FgMLNDt4JV_qb|Pkw&R)pxplmhAn7U1aqDG$+jCGYRvR1WKX@
zEilpBRhn{Rnz6zkEU}Odb6CBOIa~{q0<EfMGP9=w+_A}9*e6OnRZ;*Mt&jK@%V9G5
znQ}((Bw}AhBv{CJX;l-U@FbP3j#^S|u$!3Nf$Wm1vI<bvWz@x36pLGEpH5A{=E<$g
z`A!};_glx!JuDYwZZgNN;H#2!P_&A&XYR)?3&m+cIKGQZWvHcMky=!x53XUysXlH#
zDn*ZQrs_qZ9rf@uUu(umRq7+0Az%`wZ|RP;;ND=tT>#iS1BoVRctF{p4QzK!w*=vP
z1AncD%s+m~dR64wqNzk=G2Ck`iYY;C@zbTFjn`7o5>ZnUFg+z3Dc3eEe<vh@6dID)
zVPrQqw%jHu`X>NiYa|vF%biE+EGX#e`@`X0yj+rW4_QW3{gPB`RC1Lzr({ah=k>!8
zq8b-?grtD8D49R8El(vHbD3ehSR9{c3bR-kp=#@8B)g)gnOVkqfgPCiz`<ZmBT*8=
z&!LE>c8|Kz`Lq!)q{CVeTbz|45LQ2|T6m@I4lAVH1~BF_o5({)q6qENM)ZP^i|yR3
zjdK&WICRtVT-t+ei*_GrySil%j!y9KmKiZs1!LKL3aLGUEOfNevd9CDWZ95ug5SZc
z!l~i>&k9T)ff=6uO6*%6J!?PXmeVSju6N0G$mC-ko~OXQ<YGcz4y;^XvV*qNBFo5K
z!?TSBz_IKps<O!2bq{R|t`#Q4=vc4v_HMX-g|=1w>ly#n#Wfo%^$A~25f@Ts>FbT6
ztc=<h(y{lGk4&QL>*}y`Em`=ty_G!9B(h>Pu9J~DY@RkTkgoR8b(R-Li4jstx#R<W
z6e?iS_6^%Ahcdb%zN0~s4ums8CuG+}Y!|=(R^c{gp{?7I?`cL`TnaI84fRT`=pS@S
z6z7GQRw;3hDe1M%8kq|B4ix!3lydnfpB}4AqDkbv>-G?gY8^@DRVQ+_qWI4rbeaxT
zK040&j`PF`jHa%oy!a!^fw5N{3#vE|N~0}XIfFyd*y(U&h(MWK=`qq9pz#=AC!27%
z7x&K-<mBEV1?1lUGm!TzR^(T%la=4&P+P)q)0WS3xGkZvY8tID&mV3|8hO(cl}bNW
zG<8~X(~6clPa8E~(Ycf>nscf*y|ht|QRS6wRV-J`ZFTV0%I~x}WX2kG(P=?PNMTJ*
zAV}k6l5j?8_CX{%$%H`EJXmdZ6t(x;Tw#q6bG4hT5^*egg~8H2bMiO|J3j4Zv5P+@
zvIr!Q4l>Kxd1sK4k6N#QFSV{RQ=sUY#gSN<#K|UrO!ZCWfD=ML>5N2%j75eFr6hO-
zzPXY@7=OvUM9~sYL%1B>jV#-l9qOgtW7-NgcE+oOt*9Yj%yTPe!ta)(I+8q;<VD!)
zQMGvSCB=QlVOID`#P~`0)0Lz(Jn?c-fG$l#^%N`BDLiV8x|0KXH(qaW#zQ91m^O-C
zzzK!)c*1RTGesR=V(b*>$?q1I>j_2+`V>uN=+Sq&?Wjvs4n48uN9d3U<UXl{sO$<w
zw~T2fr~q^PuqQ)ZI<chZ(J{`t!iGOHgg0TmuD~JK?oP&@OUWR~uCB8p?TqP4ah-EW
zi>%>IfKyMgHSCan)7U8a&mWz?9_e&Vlc~`k&@{R^X;Wbr3SBY5>^<TJe8c*<*R^_V
zl6S;@MeoP{tNkHkPV`;z=)3Iye3wO*uAV!x(@9hAXzzJfu30r<IcnA{s|kxbJHoTr
zVVRT@A@5`9HNXZcj<K@7Qn7kk!b;rmd{6?+O8G^n;as>OQ#7X|m>$i5uiA1UCLE|a
z&bt@7L^=xq^qcQIV?`?&tWm46BXUZe>Xnpw*97T+-QJ8}{hOnob%k-pc#-Z?e4F#%
zlcY2Y;h#aG7X9zkHTl#u2uiuq=Qgslmc``-Tkl%A(ti7GZl+6OO6t*%L78zy=ddFq
zl%2bJ#X(Kv@<|4ucs(yaR?Ep$B|$XgvJAvbXPqIV4P}x+ZR`|l8Ec>NnB!HE=JJ~=
zMu{V*N{UDkIXgIj6DVi42>xpwHmkYA@S6_pY@+VH$`t_DtrR|=;cvvDm;t|z8b@d@
z@Tlf=-(~L(x+{5xTp~eD_d}JRh5OcRd<&0T?KaK>aOs0>qND{uw^c*qJMePw9Rx!l
z%f2(?58<i~-d38^maW8G^Rn!}QdwE4y0dlNUyKt8^jZ2Pgbi*>-}B=CA{|GB;giU0
z>Xl?c>&=E^IwfLdFmW{M)QGmw&TJF85ibQPZMAlX&4SoMb)g#uj?rA2@wFZ7%FgTW
zKD-a@zqMUsU}2_x-m!Pz_12%QQ(CY0EAfYLBCn+e4QBeXNWzk;up7?($xY{8F>HAD
zLET$5Z>u$uz=r07{QO!+ONgx+i)2q#qMabCd5e(C*iwkTDnUf7O02Q8LN0oujGW|>
zg(AgNt{L9Wl!%}|pJ_fzyI9v1F9xnP#(C^1u+xf5D#l4SmAb_0ZqY8Vq=&_+;zLS_
z$U3%BFT2coGo8fM)}N`_&{f!impR`=Hke|4nu^FJ6DLGLP8RL3<T{iTwQTp)KU$uY
zhumg167OkA)Hf1EdDbfja8~K!@nKe?+VzlwX>|xz_TFu&7MQs|FG|b#(!Kg=XDIw8
z?{;Ss%S(VsCj|-ONVb&(Hxf;m{j%*Vyi{VFg6?jzv=GE@*G7h9%HCI9jU$`sFx%k$
z92qGl?2@Uk%B=dT4D=}%o%7^NF3_6{VO^`)64z>(HTg3TQxVA<OZ-e7l@V1uVqzwR
zFpZv~GNS)m5$VDTU3R2%Ivq)-LOwXnm@{sTmHe}@_FiKD7j(0kq(}+tN>i}wWMigs
z+K%(Km0H-+mKhxer#V|;%wC}trk`+8c11_vQ^u4eI+uJwl-GkoO!!3|`O5$?p^%to
zawL<>w9|pL*4TofYNniOys~m?$;!xOG!6il2D=!Y9JIAshHTF&z<xHED!414j|T}R
z9se|yglVkF0GzmB|2dv6_h_C2F!lXmt80AJkvdxfu&M8?r*qXB_{v>~Kd6G($eXqG
zdyG;E*&1P|_3M^Tn`?dVW1UB0`-%;GQkQhTtR>}pI;bgfZeVlkRp^LVBjivv5W=j&
z*bB>LE6&**O3jp5Hv~n+Soy6h?`fga((iwd>MZUh?Qr6Xr6}K;qs+*O0VN*O8M7aj
z;j1JSk232q{6+<aogV|rp1+SQZIA4c_~~04Q;{w^EU!DmhXr-Ldhc<m(DYK7bn#({
zC;oc&sCBP|J?fb`r1R?yKsGPTZZK7~wG~QCU$d*@$@MsG)9pgXbqas#(+TWT_o8P1
zgibuc?COscq*jo<UU@vH^^wy$pWpg*vw31#57TryuQeKoOlxwJo;Q=z=LfC!D{C?{
zs*1a41T;Z)c27@Ub&i|=cG_%P6HI2)i}gwRkLA1A-TTRVJ?Va&_c}+8ns?Y+VlE6{
zv`==AZ7}wU$(j2O`5juXkbB~attr(L7|~t5LMH@q=$v&@N0VbrEn1U1aIG6hll<&M
zw5CtBQU2mlwR{4ghXeQ-|NjD5iKDX*SVJ_A?{Mw~Af)7BYk78&Q1c|(qO`L3{h7}d
zQd2`sl3tId*F^u@S~p&4jX3KNmH(pKdO}YB*qiNaFUwX+9S0V8gzB;wm46ThV!J;K
z_9CB%l3!AWXvkDpRcN0&oFEGS2Dzo<=b}NqB~^Ur01+EfrrD>_J+fsnrL9rWk&2n=
z^+1pW@jxgq&2ddSpj@zQq*U<PPeGuXq&>2d2^iEfwMPIxYo>D=>FK*ob|;hMng)oY
zd)~9>v%$wbAy8dY!&6$(twP)trl3QP3;!UauKGcM4BVT|;-L@lCC~@Q-O}MvtRODC
zd~Tq26n(l<a~HE7!M{LYk+Rn0XU5s1!$Uq@Fq1h@`V50u2x!k|C<_~)k?AHX+inaX
zhay{OuAA_ISbLo!Ona+M?7%SJ>TIdWDM?&FHQ|&M?B?U^%`sxA2oKe)i{)7(iNAq1
zfk@I7KXjbR7??7eBr846&nM}*@i14fD~7|WxhD1@lIcTi)jW({h_$+F3xQoErWUJ(
zgUpL@*;-NvooWGmvZf-a6~=1ysd#Ham5TCPh^kfK^6}MruL^bbKra1LF04$Oi*%}p
zn7wTt$tw}j`eQ$ZEKT(_$b%WqS0&J45*~FGdZX5jq^w66(xj~{h>l9hZhe3>r=pV!
zJiSL92<2|Q3AErYqy>UE+~yve4Wrh6;Q4(TMWxuAGmL8TdE=n1TAe76ZsE&-vZhN*
zM>4BYivmTlGkU}&8w+1&2+n0Lvu~PJvmi{~rURe<J1bY`F;sAhW1Zilq))W4$B!-l
zvsH=oI82xv<c;k~mr2qd3yp@8tj;#q;Yuz&NmMe26F#vm_LR(1<Hd~WzKWVE^Tmqr
z>PY|tluXXMI4YH+xLr&qC~<U$V|jM@u7Ov>bP}&zq=WH_Tgk+dUGb?nRIcpq?=$v1
zL2x~b-pRi}WZtjDw^s1oU2=*yv6w27lhjw(==tgEH_bOkd$05xy~{);i}3<E$kl`1
z+B-TuJXuF6?)131e%!<uOPB{;T3PRz>Pw|Y*10TD9Gx*MMLa6f9sQQ+`KRVD?babK
zPS)mi=qAWep*-A_df9ItECh|@oipcL+{lFa@&Tnp*67`fqvO5iZzsDyHSurV-y3)h
zv-qet)lET!0ziM3+NsgF&!gj)&65z^$p22>^>bU&tMFb4O3@RFeDa|M@QILnDA+#9
z8KkY{vGSKl6-^3G|0{x?2Px+r)J&H^NAI@|UmSTeu%T;mc-hOrwa`LfvZ3A9@q>&q
z*oxjm-AME#8^hWWqj0CsX2m*v*E_Q(btx53Pj3IJTCY8e*T1y(L#ReT>QNI?Dtm2$
zft(m6H$qUeruc}o)S`TTq&j#4n~u|e#FKwQN=^8eaRe6yQ!Hq4{4X6r_!m8yo<#<$
zu|qh92d%x`lV%yA_H@oEXA_e`V=2JIJ&4E6Hh}istKH-M-`YnnPTreEW01AePpy~s
z6JQD-MMd79*6DqCd!36GtP_1vb64G9l!r}M$dc_JI_Sj4@0yP0{*A*M@LQWwI{ii^
z%=8lK_AqSWmM9(#r)qkof7c=(PiFV$Ca*}fhpV@X>3c3MMDnlz{)Y(xxC8r8RUQpK
zRV-Q#lQChyM$|;J3ICX(sS1x^U*nNn_rP_;c481Mv9{i*T4h-OiD@r|vG>po57{zv
zJC{Y1S8(azt&EpX*&S@|ZARKk@=vsH!TZSYSbsmLdz__G2$zpH`I5f3St_GJBj3}g
zYk9}28#t^?Q?tGIK926NO-9se0e;Ky2Q1py`m&R~H<ZYbg;i}I3?#M)eQJ2Muhq?L
z2zDOdHYYiU$6`DPaoF<#a32BCoeP0wp)e~x4+sH3+z$dG1Plg<{uVOKcSWB?|J>Cq
zE|QZ@>u~S58nVJ$;|Y7ELOC?#wgu4%^#p>UYP-PUj>xN_**g4r_n;~T%K`{9(Uziv
z4ul^q1hNNQHSxvR7X+u8D9jE3g8Arjw>q=+=0YMt_cBunn^mr$32fGNgSAC>WQ@{8
z;$rO<YbAz9tr13;Dm_vmW_Gs%-dU;?PIXs)`vUbSem+x0iXSu-GY8{aH64TVR@kPg
zHtgqgat61}5H^lFizRY|&A0K&^pm6Mw~dX(O=<si)?0d4k@X5`@m#f-j-;HU3|n@3
zbk8n5KNcs-^{Rpju^Y~$4_#f{Y&wQX_q7Xwj1OCq@ge9HT@rowpX-8t<d0z2+ba*h
zv9j=@@*w6U-*$pE?M6<is>-ynzd29r3R`8&50ENrgXZrL^r7~roaA!un>`qT-*mS2
z+0*ErZ;rFJw<OvZlt~@chhCNnd7&im247I|NMxK-KYBHjBtkj*6-$!j-I}WmdhGNC
zi-VR+uHRzGRPJrcr?eGU4G~U50{zd}#7AYPlSz?MXdY+QF%4~UZqldPrI&$OaqGQn
zx9x3q+m_v`bl9d9Ky%;P8!Iq;c+cq`!@h{W5^3d3ls9E^)D&<F0I%le-w!KZ@l(NX
zv^f=nT|>fTnOI>23e5O3)?-n~#Vh%;72s}v)w!4U!kX&cyIdXN<})_lg+shm#!{-Z
zioGLq`ya5T-^+*MX0Z&C;v(qoOWLt1@U($=7b|ZQoi2=rMTG;_`_w@jS1Dzk>Pl4u
zzrs3x)>N88<eILO11dW-CIi%8vG!1TxR*+=>y<1S+YsEI<#U9vkteiE04H>bgX8gI
zxi-Wi`{OcMTinTV(hAHqM(%*!7-tr%d5Cnl7;VDH_s_cC=W~MTls#O$8~VP-d?{^I
zV=L0?Csr0kt^H@-&1^L`IS7|%%<8P_=SI)v_oE8Kl%Oq^#5pzZDvIHjc*8gBy@&xN
zYDy$xu@8b23SZ0-I`dd~iEdk$sFSf>^$^<Jds+%n@k}M&I;bd_cafSTFE>z*tPY9i
zAWvmQbBs3oyV*)yLA{r|bI`D=_W2;sKhDOu+cjT@QvVDtpe32RP(BvjB%xiUs^Kf?
zZ}783RGKh1k&RjN54^?+O@+T4C!XFMCxWmeL{Y5DH)Ofd(w4epzW`kd%1BtkmHR$;
zY;}P$T;PA71&I2M=j}RghhCp^Mm*2&CD)A`xcG!rubQta`mc9Y;iu&0vKTP~;o!GN
zH$c+UkqN2!Q!vwFX3a5Xj#lLcSY`6Ds_WV0;&ko~w^qup&eE(Z=?S7buxC1%o;zfT
zw_Td5k-Oadi;tA#UdB!BqZ|yvuil|bUUp?Kp(K**&VUOmL|!6euIH9ho$zmkLQ|p^
z2nU#t_yUVqRspSASj10g^YJq;SkISjIP12FRhRr3sGhdceB=ClWZ)c)0uLup*UNs$
zd6!90^80YB!SUEZObPF9$jpJCWyw-mV7f6u3(*rL8U?n_lZ12;$*MhK_&I{7-n%#q
zdmqNxlui*PFQ84}m^wGPWChqq&M{mFt?JujQ9T{yiL9y9kka5`L1Nkg%tghC)fG^z
z#4#bso6aOw{AJ6&%6ZNyZ?7=5b%FM76yeX(XgtZs$vF-a>g(*<aTW<Q3B6_NX=SpR
zlu4Xp896sUEMhRoXd;pT-O2*t_C{+ym&i$7vBv^J%%Sn063i8?WA2ksUn*mp%E})l
zei0y4ZeY$ujaRX&&NO{lGq6?zi_8bJDK88TKPQ(r_!{cTCZW7(u!km8vr0E2yYhTC
z9PgRAyyc2$@Czm^o)xva)*DpZ2Ei1u)kNH0H^=^{$_>`R;`^bRhzF9Dd>KE6A9N!1
zCSs9{fn+wdYaB4c99CfEoSsZ&Q4el|+JZ@*^njC_zCo9Fr8jwge6+j2x7$AH>;gA`
zBZIjw`<DjRR%xI6<01j*1#5itw9<YfI+<MSS6(#_-rU@PRINO+R7Ag3YL&jO^5_h3
zpH9ruwma=|=__xvu5a06<r;@MQpHQAVnr3N-2JYIz8ef?f1hAzYH34jo{kTzt<YTe
zDcM!~q;+r*daazutgdsmS|>FC_BKY>#x(C6LLJ?vmIgR_Bs!*BHgutS7{*|CTC6J*
zbGRf3K55z`KU~WhN@>@Mj!rbq-uLud{?YzxjQ!X@sJ|_%8}zqxzcU3$r6&KH8t8+?
zl-ykZUXrY;^G}DF4nOI;-N=PO$cNmHCkm$fFfb{VH*>R$oxpY2JDN@B_A{Q-QPn&7
z$9aX-^jFy%^z#U4OA-70l*hp!BCnBiD&S-V&Wc@#uP0Fm)d$-daz**N6MjGXuAtLi
z(Zt!yN8j}pw#`2-(~7oanTCtok-$#1(TYdk3F)fnG5a;0-<P<Tc4$){X-XJwJiMOU
zE{-()2$r6DAI~{8p=bHW(60o^(1Y^tzT=0NnZfHMP@2ze5hUyWYXVU(+hXPGa-MWU
zFF8W{0$3r0o+=_ErHD{ng4LhNqm{EgZiGERr}?xqEI4zdOK;0<R99A!9Q*`Ap-PeA
z6r@m!h{8`$v4Sh=oXv`kS`W?dUG`q$P{M@PS<BsUoxyOo9!U-m4=d56^>Ijt)$MoO
zGoFNA1@AC7r$W8le)+|eyb70JQ`LIB#W;|z|JkUZ&~RCF&}h3HN?6_h0cfFm|C3R}
zTGSta9)U%bpzl$xH<P?K>nisGWW&dke42wyz7cY2w45+$TH=FASzIbzFvH1M=Nq<x
z-(ap{KCc`SK1{8Vnv=wai)1Q6!K-7tz%AHGk8HR1^z>X1PU0%;Kr~DFRN+^SmAFV^
zC6DX+4FQI#){-Z{Q}opfOBPPpl2iT?xHgQtdK!5S*A^rLf$H$etE9Lf^(1^(hyh>g
zH(d%TZE-!>=tfHl2jGRTTlO|^P$L*<5VGlWB9oX!4Ha}SR}rAxist7yS>(c?v=$7M
zWmOM>y$Wi@Z@5VStvOrd`=6*Sniu;Q-l$>n3CF2){gk+JZeyiF=43T%`1_x`&r5cH
z54u-tqY<2rzaCcM0~rU~-3ZBCMHqH*0|yz@CvplMbjD>%&5)DKCL<}3O{G!MEeE<E
zP=!=F!&>KN##-YL{UIkrOuEw<P;qx|&VA+J2R`j&qmH=i1kv9GtAf}w=iR!7<WuK&
z3&G^6azR$*KmZxn>TB}0o%(_?mwkx5Da8>Zb@{D89uw)vYUC?lq(xBeVuvg+Ehh&^
zcdvVC7qGa$htR8)oA~~7)^wJRCddH=mZ$eB203J=zk!K<yKJHlo9CA`%~u30Ejl`u
z0;$?Jr+i)`;70+^VZ<JpUt4ILTBUeh0H$<<ake)Ye<_U-PI5ksaDIF4WW?3(_Kj8N
z&j(5OBNhPK<pdJ7QNTBo<1>PfmUP<;=)kPcpX1c2Du0zdSgKBf6+iv;4+GZJpoXE+
zc35qAHt`Cd;^&`ogxngRau75))maE8cv<qe?FGBM*|q5RVHfgq=4BnjvKl!+3D7D{
zPOWy|s(>JckEka%@pM&g1*yp@QeC4^>U1jy5T!P>FLI7(!4jx+^`XVR+fB#h|6wLx
z<U`xq=oF<TkQ7|KnH-L6*AWRKzhaXU7cVa=VC&W`^j#Io)eq4v2pOt{k!p)JtE{Ow
z$vIX)&0lA4a3k7~3o82vt*F&H^;B=<&umq%lr$d!3St!^{BPhHzbHr&kt7)QHb3r5
zr5^C&-sX^BD%;ooinLc_s%KF9mn6lXLCQ`7t1E<pF?QYzvrjR>ffHf9Ftl1?sQ<f!
zP={E4D@EfxzTe5@7-0S>I(tFFX`RpS!~1ZMwmnBTeWH_VTE;6Up}twzJxOrul9Fj%
zQZlWS2sne>oL+iZtvV`ah58>QS%inQ)k0PUI|eN$Cn#9t8`VF1zm(@#aEsg|V{Uqt
zd-XY+R+-nzKeK&Gc0*1L)8u1HK5VY(%u7UaFJuu3t#I2CUAyT@(AKX;_v=W_hn?<O
z%{bh-wH~j3cWCmIRBg$pGaJG+mloWn<eydPh2Ws7O2(pY>Ee1cO+KZQ&&Yh@a>x`r
zJ)Wex<o$9S+`^0HmwcvJ)B+P7mQacOKZOIhfy5jTjYCl=Wu6^FXLKejyn(ccOw}Sr
zD#J%KOm8rq+r07NyU6x(DLH`zm?iv_{6MH4p<3lqIbm?Qul34$xGcD-`ZSMtL81GV
zv5DR*Z5bW@<@E^_)w0#&k|%e+gNOnGVu3EMwYrsp=k<%uN$Yj<==8)RCF)cL0#0_#
zk?rLvGc_tlMKZbudIk8N45BU`fsLp&rShOIbk=kY#X`K5-OOF=`s37@SMreGQCGR-
zVG{Es8y1!XuqstJxc<nQa?@1K(1EVZ97+Tw=qI}ZB#G*IU5dmbsE<jH(dGFcAi7~v
zwy-z+4V(<Ex74O1W+vSfD8fXDNI7#5l}W~<6xc}RYM)U#9BkCn9?~&-LUU9ZD!Qqh
zPcrz(-r6vr4>~3D0r5G<LO&+cVBYTox^6^oQ!W#$eXyqna(-_hhAVkc*VbKrOJ2B3
ziR`TqNgXJ?za@cV1LAo{<xp)b;6}nz;Zu6ksc2bs)O-Dcl3$g`+&nwkmqlZ*^C?&l
z`_;~4L94P3T8a-_2ZACJ!GrQd4Du^RvqEHeH$Nc-I%6u}L<v)NSJQk-Arrur7Z;e9
z-YbwhQgtW|H_9ZTpt^d~iw$>T6pExH1axx2Ny^lTA_Z`&gc}^dpj%yGfSBDK20w5n
zO3Gzh3Yco`#~Ry7fdmVYf`qsVxL2pnVyzH^;u?k=V#yzXQHGkR90}f)0@Yb|Zp(<Y
zfJ*<Z)N_8kp{0>Qy@aXJ8GyHUky)>tjm^OhI~&_z&|8U9&*#}f{{^0U(X(>mkf3l+
zn2Y*535!dr5SHqz&F2jW4fI{gK?!h?TDrrP@L~eqtIOq?IyAl<GGQxO3n~t<PFi44
zx7*P0Pb1Hz8b8a0m^h&&L<VwlnU5~Bq>{*dnNxg8M4IPh320hVuH$t^vC`Oc-w(ou
zipc9rwhsbG*QS3IZdzodvu0$PjRv#s$7`f3qY^iS;T}5EGbax#vcjgQu|rvGYSIOy
z@cW}6CXM2=Q3h9+ni`e(6Yi{ZHGfsB6@Hdby5i@nCPySr`|FDQlG+!u`u>LbeM_P~
znL%CI9-Z7U)fQ#=-J}M}zhEQU=k&jLfbnrj%KRdw0FD(F+hv-csS?1M&h2+A*zZ3{
zn76DoXDN$cTxQQMh}lb~NlXGT5^>>&=~8hx6%31X3?j=Kc8tjepxHZv|1Y0b&_zBr
zDxOJk&K@%`3$7@8J@%@XbE#3^blyhHK!-bhBa6v@mfE&wXHvGVO<OGsuB;012bIv<
zKYjfsM&O<t9XE-u<P=3sRaCF|1FGs-MJJJ|#5t@>dChP!*qlyBw3@HR2teGuY$|nH
zsRAmM!%mZ7G|th^z!?%IS-vVYv2_(tanFET#wtBcyyZR!v~QB@0SMYPcr#iX^B=nO
zn)-rXm9n934#cxrAIJo6n2yuxPP(Q}R6Ctyzyto8+N;W_RPFKp^K~kR%YY!|1L_Cx
z2E?0jq?%(*!CP`9&#tHVf=D0|@?5Avdh&`@7kt!%OBGmcYAn01Pcf{zHOeT3mt;;=
zATU8gf}eKEuiB({hF-r+!pNwi-pd!aH*I5bS2e(TJISPedOy#}#H~brjQ4>3ALRMR
zB0``&QULMM?QReW{a^2@*D>!UY(yk;ihhF&5@B4>uPXlhx9EHMb?<m@=YI6tR~p?O
z15YCKPT4xnfSX1v8D!Hb5N;5yvt%S<A08)xm;JizC}QLm#wo(H&d<%`cI)Ucx)W`E
z>h~Y(1`TXbvs*lS7JXlL+6h3`pJn;R8R5nTT!v2R(r}X)zQ)_ut}@6}$)ZUYZ8($e
z&i&d}Tyu`oTD_vjGULkL&f(??1BdBwl3woI&-!O+?G6lC|I(FVC-L`nRo(PwIClMO
zld-_w4k2SbATb)ZsBE;<O4bFV0lAOUURH2fXL0z@8A^%!Mb%_68{#?0KVmUt<sgD&
zRQJwjLjtX_;A2+Eg@OuS63?zOROoh^$Hz39c}@fY`MFD4l1&)Bq_5*RLMO`(7QP;Z
ziQ*a`UPBcdJJ1|Rz@`0TnN;qoV%q8i0(|@f@;&~@2qks}N(({vhp9{md<mAadJ;9Z
zR3bQDHV@D9!xZm#vE4efGP96P4IC|A0iGQ00FTj=CwOjtlP=-pJ=Qaj=FjYt=+8zs
z7D=r5n2kGXzdN*-bSoOsO}~HiQ)$j~4%#@zg?_)_WT?WN@EjRoLU&%--EF{oi8}g`
z(d&^~1Rn;%MWE-Ha9gn%B&U<_@Zg#lO)AHY_Yh)yB*mzR4dqhod`Dhp`K;hF+n6N-
zB?rO<i)9h+7W(VY2Bdm7da7j1PEFd3MOS{0wAU2{pya-PtS&`$s4OBzCbEpr9mZ?m
zr3B+SNLRyHq5&DEe@d^9Q#d}v{>DaD3#Uv|EaKs8Fqp#;>d6rMVn{$bLTR|?u~Mdh
zcZu7%W3FIpYG$=3lVnu%Sw+rKH4HHB&vrcEz<lX$!==MEQYkc1n}{HUyUk)<)&bo?
zTz`komAiY*_j>1GNmz}ja`UW!&FLVH2K`y5KS}>Vb?)HL$*hz02C4ODcaV2KT4nH@
z4X3^2?AOS5#bhl^ls!8+D{$6Y<P*d>`(R+l!Y}fyxCxj*cFeUl?dqTCFmiu>>S&yV
z)r*P`>aKrSx8&F=;q`;<UX_Gw<z`)FYr(=^84l%6HGDp!PuwL`R<j!4TKY5SuEMx#
zHk-13>Lz8)!IH}14|f~y<2wpz0-+-6qpP2UWOKTK6ygQ+#RRIVP>|OCK@;tq5gmwF
z3*Z2TEnj-&ja-ym&PMu!<I~RG!O`ANzP%36kK7i}pf?*j7z~hc1pj4s6nExEyQ$CW
z*WFD)k}uj#g=iA|qyK&uZ9gbwI-I+|FOHl47TR07*q%Ja{yuM;Z@z<bG%?Gnr^5OZ
zb635#k`ZPc>ZpweN{63*LYbGYQ&WaOi{4gfWW(aGZYu%?=%w#mk|5>MC8_;(^<^7e
zCgy&J7u|JM+`=|XaB_0MdrH|CDGx!B+PuLHj8k}xxuz*=_Rd_)IYg@aWI?G)U4BW;
zwVJksR~+Dt5ob}EsHGH#Au5X#e(F$><ou#Sk_Qa<%Y~)r9U(}IUlSuXp+J2#$uWoT
z+y$1EA(~AJ*E}MYuZCO#peV5W2hh|~iKw?tPHM~B2YAJ^5B_V^SFA?`JY*oT*N^A_
zGY2Hk6WJ8jEG^zxDI-bjH|M#;#c|M}Q}De<1s*M(HwSssK{S-rwCbI4Nl5ERT2c=p
zEmk>YuAz?n+uf(i@#nGMj5c(aNk;S2ID_Mgj~pIE3SHpnWq#)hiNhYTkHSp;3_vH4
zZL9MSFUu_LcTv1e2Cu1fdfEdz!zWg+$ZiXS4R9WV3&#MICfdDfhes!^7r%5~HV>P}
ztv#xBvVyP1q8-nA{(utbkWHr7b^@Z`Ef`zjfq+Y4<#ZG>D=ic%aR15SK)f4}U}SwV
z^9nBX&USk}v#GI}fNYozedvbw%Z6Hvjno|QzpS}z1DQNNJ(?W6IK@@P`tH^&nPz6<
z#@5!B(l#!!LCb86$Qt3znWOag_lt!crC2Xuwphe6>2gL-mT6f?yM=xxYv^!<j%ws^
zKL(0Cy~3iP7kM##l#OXK5-OV~U6FF=DrJFsN**LwxbzmM)SNmsiL((U!-3O_2aEJa
zoWzs5;$k<HMzUvo0EWpY74AzFG-%?eFT!s<c1J<CR@Pd{^7nwq*6O;GYw9_f0EYHR
z>M`NSK$+4jcnkeaSw{bBFYRZeRDrD11`f4((%IYHd)4f;PMWXV(awEDQ<)hm1mH9e
z3uS1gIWF!BQMs{&9dYJNdaY+*K`9xb0nCj$yM-hfIz(&3tUFbCPWR}wHg5)Fx@-X{
zjPUzoOE^u6X{UFViFk?IfC@DH6`lL>Z$Oz)-;Y^nX1z=j9Nn^SIVd9YQ6@97n@kgm
z3{}VxtCW$~LKV0hfl59~6@I!l6+(q#jK&HqsD$;)QAdq_Id}&Zp56dy2kUb*h_qQR
zrJU(mae+5YYs9!qLF(%bM@5Mp9BC~k`V-B%T`X@%77$*uqw-`Wsu&I@N?!<60DDTN
zQ?zf87X!KgV%k&M`x&NoQL7d`tMt%=Yo$x|P<feRR-F|(*(=Q=*4u;_#=BIjV|PYn
zDaK4Y->n54@?*eO>;lDgor~@yp=94{;t~2u4m6@^05R6oG+w4tnS@rID8m-g7xkTM
zqOu+Zy3J?P`drMWI2KGrONw(b7Kwf_fTnBRBA`uE$*Ykjh%n%sNaIy2rH_Hr%S^1C
z8DA9lRPGN~<#3n!2W1)vzqj&eC2q`ZfirM=)<3A8yO>-6jomL&*sPzC%T~%=fl7xL
z*b$NwW5?Fr*)5!_Qw8ssMm);;GlzVb)Qz)I_K69Kd)-F}fA_{e%w1r|f^c;1Z8qL_
zLkq8j7}RR|?FI9l<T+-KzGf;ON4-ftCaVaVgyHDsLq}l6DKtmZ32-32R6q=feM~L!
zzMnre8+7Jv*dE{(?T3KfbZTn|VTuwn4>`|5*X|7a5e9euCd+_0Q5dj3hxZb^SE^f#
zU(<VQ2fqEtlcg6=4%%?<KC*sMRL8<Ac=jCGCLmT)=A3?uBj1q-b|BA6K~=G)3J#+h
zkWfqF$a?Dt1UaFZc%Hc<O;<+e?tQTm-Vt{<Do%zVyUDryyM|+PgrS-z-SJ@#dzM_Q
z9@QoQN2}*S3=gLf<l@^?^9b((qgxN89|2Nl$brNlK8=`i>R&ZaU@4-PKGuj%$bc`V
zEV0H{iwrP#`hr~F6|q*Nzz}<5I|<xp;rm0O!DrtM{{sp7?WHJsKqjjsMjjzrnh04#
zdb5BLOB+oob>W!u9u+lgpcaBdwx;OL1IKx-ml=}UPWq{OvJ_2r2)keb@l~~&CiI8E
z>%b*c532Jj5Gp|B9W6o4J6O?r`S_uOb(IuRN~JvS>Im$b`h3|HVkq428k)x`MQ`a{
z=w)?ZAjR{;aoMDgMJl9-^1HpGH@`%`MPi17Z@Z@_uYm0;imQCmL)VuzJ$ZbzP2S~n
zyi}w2!ag63lys&mRH_mx!$;DlJf)SDKVU|bfDcD+;D5Hs?+3mdmS|j+m9dg;5kigd
zHXC2Fk<hUiN{%%4jL`G4s{)8)g<6jN$mYhaUyLXzY1i^g^%`DetV|>!OlIvV)z>~c
z?E$5TJQjYlQF?_u0B%5$zkuELR1^-PO%ut5V1@+<_L~O^w1r($7)`9*AqZt9JL@pH
z?f~(dTpOby{!G1hm}M}^Ml^}SggQL>G#y#K$HY^DP{`Q=a9*_KY<)#RgT2--l=~b>
zy2e66xtJYYXFr<&Enox0JzD&(_%XxdUiwM-_)t4svGew5Hta~QvBqPX-E%l;;{Hql
z7wY20K31XWs^uqbIe9H@Pu^K<Peu(4Jj6*US8LQuuiKgY7FzWX(aV-!LI2ON`~E=|
z>e=+7+$FuHps>(t_w`(~@$<pYBySygZ~DH8t(SDCj^bKjBFxR!{N4mO+hOQv6nWxi
ze*F^wWKl;o<GXji5F!<D{^EX@g*3aI2Qxm0Enk(j&=%%2!q3WERKBuCO5Lm$8H|m3
zUzQd2q+ij7L5Xa_*El0mL5W5_&p>Tc)DL&PXbg*BswfbkOYncM-5KELM<&No=Y5h6
zl>!tI7q!l%1eJfD!MmM|GJq3Vs{#h#dB)!dX#C~d-ZcQ*mcu3bxexsyj}QuQtgs~O
zX)3Pk38A6-3rO(R)>gGU97CNQ;#z&w;jk+wDs;qK&Tu1f)XPDl=83FXuBoUemOa&d
z4zq%=nUiI6^vB^5;PeUwwUXUO^<?R4x$@x^)%2cTh>AgTLvK~MxCq5sqnnLPU!sSO
zC7><uPt%chNbk*3DPD#q)<L8*XOMTgT7v2<Me`TMFbF%GCL^u8#U{kS{fhO*QIC*c
z#%?B4bv6VQKRT^HE@+Jxf1X*KQXo}nCzz|0eHt&{<(P4Pu4AJ<*+5srVj9m|x(dDK
zp0YeEn?3oz7M;j5BW9bQJ^IOVSAJQ4tTLru25hD5#|ShTc;4E|UBWQR=w7cD(t&C1
zB<DbSI2fVCvg*UaDiud%RMyQ~o|v{bh|;>*8sd-(>HKBN%yBl7GM(&!j+N%@x;(48
znsl{~1hVx`w20QH0h0m!iYu;73e|;Na(A2{<$P)wfghuL(W7YF()!ISJfG#{{zLh&
z$Sh8CTU}d?sbhO5m+eQ=YEefkC|j<?_w9agHEOn{L|>mVhU%-jq@C%W`3F6EStanf
zlTh2^6@pPQ7qWL{EjFfrAcSf+51M-?S}v4pLZXYK{pUKnoS1xybU>C$M}XoVkytp|
z(%Vm2{FO2=XivLB-XxpKus_<E#+|s%2%m*P+h2@5JiC>6=W}|}X~U>51b_#A5;^lx
zCuPSNChlnCadLJmzkyXM_BcXo=qQp`0tGXzk13O>Jhn43Y-18}>KWvC_F$k)qDZyo
z_J>tYVa-51orz6QI-j`{lPI^j-RZjtD3-EP$22E2F-t##MCIAkl$q@=$|+rWks;Em
zls|;JszwL7S|}Dp(0ijKh%dTU9f$R*;zK;?WXie9mH!O8v|Ms3aEA)%_P5#B%%w#<
zkZQB;`dHcB1pElqCtPi&Tsxk-Xw;*!C%6-+e4J9E`cz_;YSxz5h5v(nAV)>?@{r3a
z!HkULbHe8T?9$0!GR_N5V8%)+a%;QD2dT~{qGBdJtdqbAyDQ<<SiQptMxiQPPWwuu
z75fcv944}X($*0_fQhnBC$d2K<vW|_`RFvbdl#F0ymTw?%_A1Bh*C|*luqTx=mFfU
z_v=0yxhWw!DcQ_=uFY@hdH8d2=%F0C_1*SQt;3fqal^S-O9fy)i{{E0EAhi+i7wo7
zO^&7!d5{m=7ZU%EMk7!HkgD9Go7BJjf*`j@Hzz|AZ%CqLipYruAeQRKML3k0l?nE_
z&|ya^ZrRS(IVaQz7pQ617vZ$atOP=j7P3!n0I3(Z<iKAHWmOSQHi*f9jB%i1s1Vh&
z5H5AeSX@!YMYMHBAREe*d`YQrxTjL`g_7g#=i=vzOxZdphOK*%ePYTRsse({7mMjq
zf!+A#7&*<NY@rx4==&ctOgklzvTD);4c@u`Q`EhfjXoNM4pnS27pG%f#Q<ky8i(Fq
zSzF5St8i0Dj?$bYH;bu9UaD+hzz=(T)oSt%8<Y`~V4(UsbcrUz((P$l>ldFzwVnHG
zjjiqb7*J`xKT?f-uVOPFv@N!;M_q|^5NjibUEhTX#PYr;INE5V`?`%el__$!u0{>q
z`>tFYNPBvoqb7y~Mr<~ZKR}@0eX3Vep+!@<6}H|XP~JaQ(j+T^jPHdsYgo<NEH#81
zZd(nH+0)l*sSp#@8-#~sW@Nonz#HC@V^xM}+!cKLARAd5Lo4C1>Aa7KvSm5bu%68*
z_k2*6CMB}fylIK#v~W@lds2-rnUtb!lv&lXBjQOS#G#7l9dSN&?0KeN-_qAh2c4|<
zN$1mT*+w^8hb>NmsVQgBBSU09cJ_65ApE8z)HLs3QW$`6gXnvyxFlO_6}la31!0b2
z!8kcrT`FQtlpDual)i@Blt*O7R^~`(bPlZRsIIa)piVMTGgP$mZUf|(Zi0DOi2^$T
zU1EwPb9%G_1Fop9)WD=e$)-*f4t7b&$Jh19n0LeVlWJxfnwz+h?r=W(ZQJO#T|z%!
zo8sb0&?pele~=2(KBq)hwy1*U>iTLa1Fv;>h_Y0-Bzj^V>u2t?H^~cvXAQH!uslLD
zqtGB-2+4eK>5(W@N>4_6Rys#P8Lh&z%xOdZ2GAX>p#0RQYd*aAJ?I)Alwa3Yv1&Nl
zJp`slJ=krwz07yiC_q#KeO2UTJaL`ig=~qVJat`BGg5}etF}?Ey61wXChORhca42<
zE&A|CiLQ9+ktPg~;KgF@kgOmHU`z>B@Z$$vU6zZB;b%_FOvM|^hc*$fUlrU$gL?rp
zA(*_$$FqT=t|elfJ5(CO)@-+BXWC5X-pPgH2-kkwY-Cqm3&7!bkH{E48P2&l?-B~d
z;@^Iij3ia+baE}GFVY{JQLaJpq>&H;pMvvZ$zUawhR{=nJ4Uvf0&A6p3ojM8l29w6
zWC^b02aP%LH_t;ZZB}eBBY`9xLy)JG0NS}L%0~^(v_p;IZ+RW7mT7+;E5@4{c3?Lt
zuzmmN^u#wt`aA~b?v~}kT{%lYT$rK<kGc?%5rEmU%c{y+?^-L$n?iZFbGc4MX32FE
z+!YmBRZNi)z~BUZ;Uk(&vhxg&AiAq<a%B@%6YU<q{COifNR%!}w^Uon%1G6j@nC{=
zBeOvJByk^@8P_N))lS$juZMhcg9ao!-m*l1lo&>*%;H~gLU_|Fh6-S`xqI|t!%_oN
z#%)(Efcc3KNfkS$eElTl?^UXcvQxZA7jwq~Ql6)N?MaGvVTKOdBW`oX7^WIA>hMg|
zjp7r@DXSzStEYifxr#1OzAV;Uuuv?jAL6OvdmaHGVy&Ryx|6YLnBu?lt5G^BF0wJ=
zsSH#iPC~%KA*nL)SYGxshx%@Ci&B2`9YbkXl;CacK#$T+tGuqtxsNfSG;Ovomgi+i
zW598c@&I7PvZSACH9GfH$7rrhpQQe5I<pe%n6uo{WRHyd929AvZpnj<tI-MJ9rCN0
z?f;AJE!J%cWb<s04qb~VC&(m}W~$9}x0gv28F!_OSpS%%v(!nL&2!>%IY#l^1EM7<
z;?*s9GkWVdKU?0D7B?1@$bY{zXAqAnv{|`+J31Zr)D3L0tfP=SY^=lCC}ecxXtT)2
zR%BNvd`(#gWvy%+Bu!+3{t?8!MR$*WvXh?MJ>yw?B&Z?bsZ5F}FJw%Khj9$&#=;>c
zGskei^gdv{Bs&9D&#f6x6}JEMuu8yijJ5`+D?Jpz>@0OFyZaov@#UpseS^HBwrGLp
zLK{;@Q~NZ*(?On(vB<%tN+h37UCNzW^#zqNR)-qr7>PN}rMgXM5B;;Ml%^#moD;y{
z`6>j-icZ5GxXN+SQ`Q=qJKc>Qq!3VOLS7o2Igcb}N^*}I3};Z?R_>e7DWW6CMH4GW
z^&lo`4g`i2;#~M4pL{If%PPwJuw$HRpZR2VnxpM0#|{}Bd8EkO-XKjzv$4%Hs!AoW
zmy{Bc??hS=*+}INbW_r#jSmF!1?qxSj>fVy&XPSSyd5p?=DcmRXtM1Bjx4CTm4uU!
zKwR<1a!IyUr&t&)!RS^rT$)UPA|oG6`qyxLE%$@&S-o^P1}Ly?Bei%nB}5e3h<6S`
z0}(F1EgZ)*#u|q>yVvfGxG;nGE{X^4N(#27Z9*IrKQB^i<s-SsT!kef0o_w%R9IED
z`;_;d$N;01s!?&|GcsY^ms)O39Rx+!5PxXf<i;asP;=t|eq!Q%S6nD_`i@Yr?A@hZ
zt9)Zb;E>>+_03_xoP%nKdTQ0)QLY1+o(0E=je#4S_G`wy$yEtdMmB!O5%8{>f!xX5
z4s6x>kI{+<f-BLZXa$b~Iobx(=q;CedC3pbGL?%_IZxm*9uUe=m6HiE;hX3nolPWW
zlbNJHC|fjEtzgTrF_;xpjK;FLClOkY&7?S;2E8jjZ4z-$RcTd!B6m|ET**yYD9<G|
z)-+df_TDCLMD3Js8aIcf*zm;HO=Y{_^cZX>bs{R0g5z*2f{m&z@g?`hK)nw;`3Dwp
zQ6a-BHU{QReO2cLB1UEXS$~k67twD|qrHPx^YEm@0Cdld$Ep0Tckj5lyMJ_e@Qb~F
zD*vaT4(<W`n=0*n(p%@q7_LCPrt?AI4_vib=ps@hwe7k$SSq>B(30gRVq<SnZ3wa-
zsUcLZbDV;41tFCR!ri3S#z9vLyGXAjrA&I*(ZAXjs$IFkCcZsxndI=y26cf7PYN;p
zc-w3OsWhNC@lq9}^epc@jsENA)0E^WB*jrGcq?n^OxFR>P7Vk*Mbn({HA1)-atG>6
zC)kn&0Ea#ZT_IEw3Xx{W<EXI4Mm^d^$MJKHd4!7*<q#bPi5CSYGLH`49KAVybJ~6t
z4X+272ao@$(|oq;(Q7AkQn-2)ju0^}sAOC$c4<b~oXcxaVPf>ElJH2ZHkC|z;)M<Z
z?>YQZ)Hh75rkzkl1AwuLe_Q}aDHUdCsJ3efuX1^aRpL7|#nzD~!t3ItjhOcl-4pZv
zEz*^l)|urlf&7S4oT9}rMGFerF8KIPQj){FM1@yb;zizOHC75KQMXBqi>ldj+}v*+
zBdvoQovudb_t!^1H}`ecCY3Kqty8bj9*-s+8sqTju<56o5d=ehZ9yDiIH?UBtHPui
zS2c7vjX3P>WrhMPmLgibaD}q&-1d%-+U-vJ;OIn2=&BN&BpfQdpkBla?1mX>5PNfz
z*TF^Cjo^T%hwYQy=LgN@hQs%HjLaK`55$=i^i#)y*jG6cT7AKp0_l<-B3Z?*h<wF#
zGzZsO*_=4XrwE=PcRBk<Zx3Nj&yP+I_x&XSJ;OJt6b4OD)kMQ?aHePE1B)EW=vpck
zIjNCs>UKWJ&s6-X$uM-w(oC&j_0JV6&31p1oM(J`?E-Ey*7XQZ+5N_py(niP4gS3V
zG#rpRk3xQ`0YLSVxU@m};qj3?R}SL3_#5NV)ktq66)+RFp4o;^X?KPyO2e|z1+F1W
z3HBxDn2rW>ib(^}#xKvW{|%jw?Bqz2>kH{lA=eiCKGcOl)=*%JRXB2&zpWvDGxE`&
z=G^Iv&M#$c0=>CkvdD0FoOwiXyMp@4p-RLh`ngRTzlJ$<I>W+xus7^Q!>;Khiy7I-
z=}G%*b<A)25OnNz6n<q5tRyjXr{L0Wq*TroLBSv{WY}hdRI@31Yb{b<cs?r*tHkej
zgfB1^V2}1s51O492fHtUcrq?E_f9agzQ+bh2{pSAi&Dsve2aEgSQ|#C3@nqySwcDC
ziqscs^;TN@8a)lrb2H*=S_4;NqABJ5z9%(U;CQ4%%Q&gM){Ed3qb!6PuzU%tOo9a;
zgE1O?QCY1t(5ep@ayrT2Ea9C=RTv%p!P`_FXzkjb5OFHxWL~q6bn|b`J<T}BLJw>U
zS)z1m1f6j*<*K+;Q<6=T7Es|ltv^F^CGx{~oaLl>nrOHeg(rM{dT`Q;5G6E0hdrf9
z!QaG}p67BK=(s*x&q+I1G7#Oa83xoDs$TbTNxe42qi_da8xnP_*3Y)^e(5ns%6ZNd
zPlymA07=R%tb+&4ATfIp9cfoNjRc8qctt8RasEL#z->e`-Xvhi4Mym6m0a8X=yYqP
zY2aOY<-mp)sYwcc;ExS0IKe|jUCguD$n(S)b~i-3h5z`!clr0O^E)60J8+hCKNNJz
zblwjWt>BB1a_46hW`gigh)VQLu~Njl0oRy!GpFDvxjJ#&WRyiu03hhR1S^C;U0<i*
zeKFK4AgaU{$IyiWC%~X91T$Te1v5sUDqI)k4zU0;<g(Z}3EqNt+4~J=kfDIoZ{&ek
zHYCvM(i-rba?KRSX@MClCj8IS=w<T+1ImHowE^Wit;5!d=~`yaF)R2sMky=74_6S=
z;4!cH4tHvaunGp47@3}JkZ+lpRKWc#=zV5Dj@!;xDh>Tk4e{>7d(Zs?Hv?PC<p&L4
z0V1{GuUd`E6G>kcj{FrLaS*oOb$s(_Xe@lKFaL1xEPj-3SWIL(^9VUCq;P5R5xKG*
z`Um;6Jk>QZAOvb*5||AmBJ&P-@GzJZ!~)(zCVQE#FiHi^-{F7XhkbsU?0tnX<Sy?{
zTA5fGfZ;r^D4v42+t3n46Y(m)N>#yg=8~b$YnI2(6xZ7m>m||5BGensVmd(sb5GeL
zL<~ToSs{6yOqMDGO_7Ac;MP2=5Yh7BK9INeJcPiHK5A*ohqYEdSbnD#M^lN%^Ee$_
zx(Sa`O2lV>eh==wvF~f{6j^v9o6+`&!Xwq*3Y2Lf1Z6wFsC{3^U7@708oBFG3FHJ%
zQm8BB;m~t|bj6;&!!E8xMrcXadvg5C?#tcQVI=|puAGqhf;lObZCkH*(}02T77#4B
z&Ji#X<Qs<!*o;(Qn(xvH6zl{=_DACwb2$~IIm#919RZ@~OmjZgI`+TROBj1gf=IxP
z^LN{=)SZSavlQgg;7z1r;F7cx8rb=zvaT!RZl;NqLz`o&2*I9u+$8;!bf<&s&{k?5
zhWy)YDvt<~TvhJiZNSB3V7o6B`bLR`h6hX7styPUw+%h7YAfp%I_>3kL%%KK|3W(w
zoU!`clys@dE<?TupmRu=QE*j{HJ6CtrxGR92jizuVj<F{^*^khAd`fKpeMBjms8Gb
z<9~cjK>(>~-iuJ(CD16%YFe}zwT!k5w)n@0yk&Jb7%Kpg>;@g#Yu<_f?KkfzhALQl
z$w%%e_u;d5Tkkb`>x<HPySz8HPQ%a1<-7OdXAzb<8I|eavVf9}l(hUK9^{euMU`(5
zE$ah9p!wL=lHd&}{w`QH))vqm9fidvRA@l<w0cc+d*s(9N;a6<dCq(IqxLqgoM@(~
zUBd3fIs@QHY6zgm!c_;K6&?JcLjxi0V;k5U-48H{blKfD2iDCm%sIDQeNk{cpM-5H
z)3AmE*M^@>n2|W65?NZnRdozp{8_W#$5DbvzO2T`C`ny33=$se8YJb3R$9E??~sx1
zrVA#h@eaC1(Jx(*((Eq3sM5q=Fse`T+4+T(n;4LLwr!;6><**}?mhDNiAXMcgvw?v
zgEUcAlscNsQd3R9ShLy5hFxXV&vwc&k2qL{N~J1x%v8>qP%Y|4uZ-dp30hjgs2sKj
zz_=F57fs4x<iG}gnkr>J$B?j<s_)5#<THhCZBea)@1_G;rzix)bOYd(0TBIZ2HJ~=
z!d6%<Gt9}>$YyMrnOHE~vYE@=2$7>NbhEWCRQ|GLVJ;?5f5h%luHd0y6q9p^)^Ls@
z-{ZtyiMJ5+e6sEupNK7cq+mqf%D*%_?%z;G#xlP3W~my<S-sfJC%8(~j{~VWXB)Tz
zg~iOQs2mQJH=L2eT~nCGz|mzsK<^Hhp_HAmHV)n$;_k6$A5kp{sWjR>GD>sB91+1h
z)h`0yWB)CdBcKl!&mlm}65-`XrJ7uX4Gu3h2N`aP5Xw~gx#YD%t?d)6S8Nn;eRC9Q
zprJ&3)R^y2*jMHe@37eoWg3^~mIa&fhg=EBOVKE9qkJ|Imm7;li5r^6GLsU}W15`!
z;|z#9x!EZa&AD%@Zcs1E)BET*1BMIS;hHuIpk}sH?%&SiRzfrFOJiZ<?b7_MhX~tN
z(MGt|csCv9nSVm98#I8M0OmUiXMuEZ!C=61We$6!+@JLoHp$K}rlLV~&Nf|)+UrAK
z3)Fv1N)8LN;i!^Bh2&VYv^wmvmsFBk%3h#V7SXatheoqKDkJSvsneGUikns14k*}b
zjDBS~I|HCCS`WuggUQsY^dpWRQt#cJ3|6!1PV&O?0SP&wgqC30GRazw6n#dn>Ql!j
zWp%V_RX)NAQ6doH`OPG!TpWttusmx~r$nSxDa@>`c%4tu95-FFC)^!7X4rXS&8a5P
zkV8eU+@W$9lPm35o^f!LZJl?`=xl9wZSQ5%yGvcExMYPgV16YNYDZ2nKZzz$kuh~g
z!CHN9lodCEW6@j`b@v1HESg!2ldF;gj%@-XSQtXK7W9W%VTYI%EBJ#|PU1;q-cB5c
z8R5=sCm2TvDuYem!>%)%hTUw!DP9qL#C`TZ2XIE1TCj=y7B=_gBeErY#;8i*`J#c@
zT8Wn|x~-z4i!EFipEEB}(Jw!(SNgCTtIG`sX8KgVN9Vl*gwDU1NMaHXUpP^%H&p)%
z9iaeh=w2{LGL~@|8T&RkPY&9M@-`0JCiBrcG;louMwsa;?XY|8Q>~P+OD<Jt#_7|Q
zIzN(h<z>n>VC84d!F+Uh*g5&-O|t`o+c`u>vV^DB44|J8a2fRdNAvX&eT8r3kTKd%
zoyK;V;Dzss=(}F@UGeC<o)?!ecYkrOFj@irrAP(ZZ?6MGk72&qIHm>Gt0LJL)^Czg
z)~&60ZdvtcHo`DfiFDi0$f&)Py~2c2T2K79^%JqvS%C}2Zi1>XDV@nR{!}1Gf%l2+
z!l4;rJLnhKBirj&rPD=iQo%~z=jh~%l(Wc&*#MIfNhL0nyC=F3D7yP1U0}{v3Au%L
ziz4u@h)AOik(_fWJEAby)X}}V9R-1*=bR*+2TrLTC$Vf8^fMc)D+`Njsu&h3fFr)c
zR|)$cp;aj%6(^^kh)l{H4lZJKi|^B_PhMa7H3EmAW+HR9xdg>RvhT8_Mq%I=vDan6
zb}ySnlk^Kp&`>DAuEY$m#)ef(a?5tHRgraiWALHnn+!CAs=c^e%5z=}Gb^qBAq9+v
zg96HI|MLT^Ewt~;pl4iJ`e`K3I|r@yi9=UIjsCseT->OA0;0z2lF;haVzPg>t3A0{
z?^?d|Cf#K*99!0>THB=xkqTSQ2im65<-V#EmS{nVY!86gvD~V7Ud73#oc$0L(4797
z#0{mqQ~uB@yvXhcUba>;6jxn5QH=3$JA(w|JC%i1+7>B&vD+$_kP36YoVsr-u4HzC
zYJkeLt5`LGGxoCMeaTN-v|eIZx13CnHSvlvnkrkm+!W&5I3I6V8R!*MmaOPSt03nc
zc0q9~UzMG9svUN;vyRTPX?frTKrb={3y#bCu57NA{ql^)gp}9px-0@CM<ub}EE3Rs
zHt}`Nl6iyl98CFQ!Tzl5DnhWWRwo1vYUK8af#_9=kia`(bwg0iP%_Py&2R!{Ukinw
zvib3CDmp!#Obh-9keIArvI8{uE>x1wY?Kt7^e`r}Ada;*Eh$kZ?r7WX2pMGF8sRqN
z+QL*CaKon*Dlp{a55X-X0NkGEcyR-7hb3*FdfWw0MGI(AB_ljX2C4MxxY-N{#GZUR
zcM`;(hDI;_QdvFEZ&;?WZil~HByvudzuS7KE!0E(<=f}0eaIbmopl_W#iYC0OV4KK
zq;cE0_)24J!DnaZKK|Qy_+ZQa7eDv!@7()K<9=g%=fQ)A+xMVdW2f=p{$HZ4uQdML
z51bzmHKM=F&Ss<OY)-oc&;La~S~$!Gsfi*ZB%q)%*1ak(P}E71kvJP&Vuqe`HUp9x
zS}SP3UYz?nh22xsR6f3Dez*p5!Zu(?9JQ0dWkTs`+X?W$gAAnq=n2*gnxwy?dkLU%
zHh{Z|(vm*IZjh~`Zjkk0y^WeR#hh>e2+A{ba~9-7TL9<LWs}TVHcBQG2!oMC#HnLm
z88)umBExP^2e`+iZw9Fd?@s`njyMb@#nRc?*ut7lm9!j{=2npAk0(XShoM*<5>aka
z5*w;DsO%5ZtjpnP_@O(Pf@q;1dtfCB>RG|4-9Z8(?qs8CDkv=*ps1<9QhPH=I_S+t
z%|a&iS+fx>uIj3ncPU{>qIPZ*6HTDx3g|nfT<wK{zLu}-h3NGia)dJ529VLuRXEZp
zH^0&rWK)v7xDRwal1dsgN-QX_#@PK{j>ReAb(q5tv!XG0rg+XKl<7@!xuK+<_or8g
z0v1x?N2N}HcQZseNghMk1)N&0)d?rBTJ5NP^y1|0?r}4M?{AKees1l9<ox^>c-W*2
zn#Zk|uTG*@M+f`O<94)rxQ}|bljGL&(~~3kVP&@sZ?4dZfoHpizeLTyy*X~S+tJZ+
z)O!5}Sm*r+1~}e5JZUxCanw2lc4EJE_%e>5kLd8|Bsyrl1{QfgIys7QTvBzE-i(f3
zM6a92d#~Wn-RG@?*2yn4<crqHArAKf#@mhF>>i)A_D&CWkE1uI$8V0>)ElmEzt!G5
z*u^9&8!!hLH){S2Tz%AjwR>>jEf?6V<}oh7S?hD^>!3wZwKN>8mLukHS?1dw01+m6
z0EFjFbFYP8ntyA;igu5GiJ@B}Q%8sG=D(dnJ9r-L@4nuB32Uq^fDY`?-sy4kHBS8K
z1@_ZEecnE4ot&ODqnAfV`vmrO^Z4i1UbFo;Iyh<*;7;4k7zR1n#o@6RfEql8@6S)$
zErcHd{Sdgk<I^`300?{j79a#L*oC+E3D!r4v}OR-(eW?XF9L(MB97j^YQpcZ=ZCVq
zljB_kM;idRcVf4MQ30MO)?%Z>=F5ZD%jV%;6Q3SoM{is0W}P>$)y6h09{lYtjC_jA
zr%i*o@mC9%W7^uN^&;Bc|G9;e=f>C@phUYR=mWpDPxoF4^zm41-n#YIOcdfzifJzc
z*5=u*zxL98HcF%Y+Q!C4y^2d-^7HpwOo*cY{KAgx?(p-X1!%d}AA=0oNB5)J%I0)9
z-W=rT8`DqIm3SptsXt!6yT0hV`{Q^8b=s)be)M<fC+c)?s7?pJp)!!a9RM12I^GDu
z?mC^HcRRbsFWaT&pEo<KDtEJf%H2_pEa>g?I<mX_T@^Lhs{hXtKT7<6(JQ_h<1e52
z{Qvg${Ra;{{{Q~Y{jG2O|DW+emyZ4RL3S2xZ)^eU4!7-I)Vl^I2Y3xGV~gzB*(AXn
zXhB|lYiAu8@&}*AkeB#+=;mmG4ut2Eq^be)V+Y9@@Zhac_ZwsXjj{j6*neZ}zcKdz
zD;fL#2pD-_RpA=zywY5~`dj~if4<)RTL-WmFz9G6s$rQUE+};?{RGqm-4;ifONmN<
zVEe-(j@-A!hwEY!4aEhC5Vlm2OwLQc0XK`k-NH9;mfSV4Se&evv(Uny7rn^?vX+pw
zlwB0BQg$aztbAi+fI7RLB8_9GbE0qBwY1<=q?GTINhb$3B-iMyfME`3<9>j^P?tL=
z+U48~olY{994MVmRI7D5;{+}Cz|z<CG}#a_8?kwamqZhztgQE<L2;%=V)udv(U5=Q
z5u-smItNPam7RL`{_(BfAKzdm->aDbkiYL>Ep;y4OiD`WTs@=Quw2;r6Yh?3=)Xu4
z^jaZrh8adXAk`hQ34ik@>wEwWId3Cg9$&h&#*VeN#?G9@(ZheS)!o~+R(EfE&g$sl
zzu4+_?pv$dxj$!h^zgsM>Kr0T&UX)@Xsi6|_fga+{|eZ;UH%nz`Cj=~fX@B$udmUC
z`(gR_=Wy+Ly}a5#?)<!aTsw)2x=Ja-fdA`XPk^*upj#rkNUzmvwW7YRs&)BIseYx`
zF?U)kwT%|{RS$r$bI?4j^|8Z#{n;~TQT1E5(AfpJzHBtWx1`*nIAHKSgmoHq1WaJJ
z(fi`vdPAa@3g9cd7d3iv$APSEy{3p1Gey@8Ky0l33b04Zyz6%HePtI2(C-1D>(2&u
z4MX?!#?IXL8#{|SxVJsGgL~VHI@q~Cw}YMgZU<#+bmdMammux_iF+B2U)r)=oT~QF
zd(}Q@xP?LAsp4Y&8BwojoxTssl`4b#J!dT1?yol(;KrQ62sOUmV1P$+1|u~3+`$&&
z9EF4ciWTV;$p;}@tT1tuUJcUGpGil`t}5=Rtj@00oL|@KaLxjW7`U-@G5r?RcuCQd
zC+<~IS%eHfUh%`ZRIEh4uskn~`FQz0ebQE@X`j=pPw&cv?sIzeiC~%fE$;RAYP>{|
zsDzjB<G(CYx~~d4J`LZTcVVIbUD5jP)2KANFGcDb_qha0-?+~u5PCtMDs%!baw_{;
z=Q`GWtJkBuidn0(0A0ZY(5wH$_&JtYzKEln+r@G`-P|sg<Lay~ZgR&;8Q_2NEzA0&
z3-Olj<)U#X4G&gB80GN$6ssU}VH}Q8?dK&g+s`K<%(r~~yYaL8T|i1cyWa)mWXXQ{
zhD5aK72H%P1L4+MHp-^f?U*4i2j^5?m`<*5{0_WOvvr!-z&z!EH|)p!)|-tTYW4V*
z!h0$Rq<)mv=ac*js~dS|!I=YKo^|)zbDvhe;I`(uPn{O<U$+tdVK*6HmqwL-Dn=b&
zSB+{7duhT2{g(Y9^n96g$l{fZQM-`!Su_3e@N}=!vAS8%3;LrF!Z_-tT8&HO)cEZ<
z+K!`ptj0hG@tbvzFO7Ox-(DO%)bC(xe$jqMqhdA;_1*>AXkkn-JA<YkZlJZ@-vaf*
z1f%72d+!DL6J~9_!D&hLPFqi?_=^6O0$||Bp@ZEG8+nRtSs<$Ci}8Stl5={jNx>s`
z=|wu`sCxK94=KAn<(c%(5OqCC8GYBL`NworaC5))G#}(w>7=x@X+9f|t>0x=(A0=w
zO8Ea8#VgT&E|bA5b<Pf2aYNfT4x9`PjAU|NIMBdLQI?5$ip>baWQ;9}ApXG|y#tmT
z)JR?G^&!tjHEva^C7_}1Hdkb!+}__SJ?5ClL{@JP==fQJ(Oek(*25I=;{j#IJ+Xsi
z&(o<LKx;KbTMXwDrJ|h)0DqEE1}IF}QRrM;<7CuRC0tAsG)jB5N#Gh+&#k;eYMPWK
zbIf%pt#s~Gh62xCHf5IwLV*oQt;K;nTr&kIK$l`?6BEq?%z?62AtY;S*7`bX=+3lm
z9V9bFChP!mi&)6J4)UlU<0#yF)IB37G}R;g$(`ah9pqPlp_l2vs>23w;Btr@qDPf5
zcHgv!HRpL?Y2D*IAHK+al9cp%E*)x(x|0J-UNr*i#H{O>YR_Z3!#37=H>Xka{#g5=
z+lD{g6TGG#y_uRbjO%KC(kYRJWy>eJ7#LdYWO0;EA{k0?XLvw1z;-@NxnPpr245pL
zjL}DePE5WGT&%^)L7GmbijW?-;Or;ZT7`$I0*mPIfRrpE=2MD-;XoK6%JIYK)G*C1
zF%vMg#85PO+vG4oKy-$}ObgWD9~({`DeG9{UpPpy+!R|9f1;b!$!JUWFUB_k8`o@~
zsB7RPEv7Y}mQddF_d+we-5CazTi2xg`_FdQ`s$yO{~u;zkZd#EuQbMd|G#?=wzqal
z@jnkAeDnYNGd`Q)@R}cNFS~CJcHbQAzB$-^bFlm7VE4b$!A|_yRwT~;V#WFmxrK{#
z0Eel-2dW~fVIm4uj7z8prntoF)Ii*Th9oRe0ZAC8Q%uckzbVOv5@PBk$CXvGJ}It8
zT@<${ch4v}m+B4}uPRkniTV(sKjY%>oNx#8(7{9ynPgTV16*SM-JUgm)K3$vCRIqi
zE-HYAnR)PH;|xWVc!zxBGiX-Kx))SdSBi{5!%cL%<C5^!9Aiq^Je>|GPiH#qk|bCV
zRklk@Q!XO-pTGuMZ*(=WA|^i@;{9=+Cj+WvqjJ9hU`NF`A>N*nFG#w$lf5?tI!gSN
z2(h&wZc1&$&K9bqveuOXfP+n+!n$=@rwvT&WWa|seE>9Cm6B$nKSALD?<&lgEOqNY
z!F2*-Qy{WXZCVFQmiesEiJEcpD%lO+S-QF@iPk#P1Pv*DrNrH4oHUQ_RjO!h&6U$i
zu{=(K{Y0`sooAR`VRJT8U!y^Oj@9rebIB$r#^FIHBHqiOq90J{(QUw>a=w>L6PDQ%
zzQZ;#hY4r2<9s`XT&#>5dR#piPB7<rj`FDmSyQt++HLarC=>_NOUEh0UaDE@>Ua!I
zR522kOtGFFAkbsdg&@ADUq-83br(p(o?a8Caf|j&I&Iof7H6sKYho`P4<i+FqkP50
z@L<w1!VEH7NG(oXm=tFXCoY`~t}T4=R!-=nkZ_%f6Ehs0(~LScg=%<6DPc0bk7ctt
z&o%N=>1dPRW{ANdnmz{ETA>C0L+Ci#qm}T2YjrspQn(u)?@}i<E>O&~0$RYO_ncW#
zMj>991s_SwW*;XaqdY4B7-oa{oO#KfQJy>OiZeAS^e)VX88s6z-TiEmaylt~oc1;)
zNz_ynUr|&evdl&2N7q7yP^H1z8bsaV0?WKy;R(n`sjdnOq`3Jg+8ybdQE<@|Tv&O4
zHH^);M2|Ra4DJn5HRe~@DUZ{<j(Sq@kMUiyc8UUm^lo%7U|!b&9ze{`KATWCT=MeQ
zMBhMEewtM+k{%(Qbn-p`kSVuuzMk^BfY*k0*=R;-+oC?)UlY-;5TBZifp#X{3sp|D
zP<4uJO4>r<X{c&U;@Vlf5&YOxgbvg1Wj$4*+s<Y$q#Y;B+368Hl&O!moD5trXVPXS
z=p7m*S090a=5kRWbWkcUMH*ksxU!-{FPI8lWt`4c>xYsF^o9XrOy*>r?p?zP_%;-`
zV8PV@2!S=a#(GnetoUf^3_ILKLP-fxtvWnQdp!oarP^Y&hzTL2EIU;aV-jW^u(iPH
zVN<N%D0&+G+BJGBn6zo3a%SN#>(4l)Ty)1Gjpkt=vuvYxiEVnuM=ICyo~n8|O0R@Q
ztW%HHgmj^CDPwF(G?E;|$00-zZAQY-AA}NjguB+-JOcVV%?1uhBQ%%$jf!n?X8Mo1
z`nwupozK18YI1YwI><!03YA}3?d!{QN`*ZU58xQX!OHqV3xzbA{%K@g+*2pL;xuwK
zRW6#IkAWx5P|MEA8D+tyE24&Y>o8ToZ~7HhRuFXn#GK~cd{D?07)GC6fwrI#Y83mu
zImlE-yb_x9d-hL~D36n+QhK}2?%rM#1eL>=kAv8xeHnPsJdU~x{3*HS608;->-?*p
zDP_{_&~t6_Havl{rn~@-R;{`tNT5?a5@@i#De$-_-SJ^Qq9l>efoE&>VXvmofrzVl
zQd%t<j%K0;x3a}!UwEb*CyFYNfoykl{Mc)U$=*7EN244X)4!&L0Cf-FR2KakZxnvT
zYRtG(R!jV^f{vhs1uyP1Nf}FCWP`Mce4Wamm=0n+hZwj%%1(!3xtsmV(4_TeNvith
zSL-er+Up$sq{z^*qywc2FI2eN;d?ocAM+0!;GnSVRZ_ggmRurXQo=K}OBS-OKjSq1
zs_)yX$amFLh=E>aCRh^dMiarFtLCw*s4UC?q_9i;Mt9vf&#1DXR+ZU9sod>&0MqFk
zes3RM3!Ff<WMH2*;lPp#^j3#PdrE_<NxhWPh}IPloSU}42)&&*ksxI3IjF%oTT}D~
znS>H`EmTe@x^oeJ5m`yIk(QN}9@Awo*0u7E7+m1CUZapL^?F!83M?g?ov5e|#lJCs
zue(AEAL&LNp)cYvzFTTedzdW3-!r^}$btpjFX@d{yd05Jvz<&&DcwXB2q~?tA{4iM
zDwU-BDFPyNww<Gm`6@}{_M3gsZGS#J3w)>U6FALvSoDh%)XJ4k8dbz!yi+4hB#Q1u
zDpl1}9>e4g$C7*L*oPf+4xE;mPmv@RmYk7xnR9hU`{ZOWs+S2kJJJ0nw3Le5?;RYq
zo1OOFt0oq_-}ec%v&3J?J}8u~>Ov%HRe2qnBdLv$_(#X``@`;FaDecY?uvJgU(@Z)
zm4(fpL|amx1FjuFjV9FrD8nFhIq4>_iThMu0Sitrg`VnSzIopj#TDB~)w!5;G*^Y@
z(=iN{N_AqDi$c<LtIbsMq1sMsOI>s~X?;t#U~|77xS{6X)xSFz)dYF!s{N!gh*h-p
zY}VKN2;aloI8i<DF48-yvDw4h(0D19gD_SQ)hZP54F~=>91y9cj0F{(DoZONMwKyw
zIip*l<=qZ*<n;jKxQIPOB+(7gAH|SH3+)j6Hcu1#v#;w(J0tI>ZigXY61OEvPmkk^
zMcX<@$B7lf;T7~MAW0vt7cQxT?MMrUN(qN=!|S_eOQmPYWP-XNr2Mw8l1xTDHYH;b
zRk`LUcCN%<b6-%-=Faoo<KtHI7&XVD38KvA>4=ICYYVf_<Fa=Q)euy^U#!<w+9p<f
zsXAchO}s@>eFRr0DPu{gl;>mSJc2memaC|WU#&!5_L;)Y1UfeJfe-Nr2Kel{%lBI-
z>ayccX#|6TYLvxywF7(ZfV@^iFWz|?{ny+#8TkXtxEVWD=AWD?;VAP&u24VWbjuZj
z7juWOBfCW0LUbZ1j_FfrBieF@65sf&Ls^Zf^8~B8h+2)Cw&+!jnvQ_xW9IEZPdCO6
z#cO{Nb_6lP>OB5>*dbeFYiP_?fuwf;yn|FUnlI-S(@Cn^**u5CJbU5~K|o=G#K<QM
zmjj@8(Hg2LSmUGpI!PD1PrPwPcHH7){T5H<^bqarwR9lRm%p`06H=t<?kaBRAOnKN
zbT6%Z4JQ)aaU?8NwaC@gAm9v6$l2(yBJ!!$Xfk{>M7@d+=9N;hi!#e+8b1y+U99E`
zrjuWW9nl@!awZ?7!=FQcy<SVKO#t?FN76G3@sw$%*r#2Dd@`is-dDOfvc9{?9h)5s
zsIG@`y;eMp5_`E3IxkOzm%!QyMcSVYPzh0JpIo$evX7JfI@Mq`MPRW|Co$>&n2~m5
zI81w}$3f#2F&9>Orm3khORbemt$wtsO}cCkRRfx;I(UfZF%=R`##Bqgs}c*3akN>%
zF=jGRw9ciEBwG<$1|8riHb;7J*dn@n$ht+&5@dy<R7aRlT%4a-)uZ0`po;feOj>+Z
zGdZ@4G13&#D_OlR>ttT7JxJ4WtsY(EIjov2dwujGS!Jhq%7KoZWB?S^fpB@WJE}5?
zvLQJYRCxhUT~4N&1JW<za=CaZ#vjimJkB9|?DjysfYX7#y-Wx8b!ZAdO9|T%9SJh}
z^vV0eQqbI%<zY{1v{JeGsx#|c!tR;<UCrS|7>k^0rUp_=5ABkrim|!eGdsEDJ|@Nn
z!9ChA%CE{uuBV@m-1^;r7yzpT-{(?2O*pU{T6s(Wk(4@HWU^7ixJH_PzHNre{v_$!
zB%9WJ>xfyKcj928TVH9O%@g#oJUTu3Qj3vSk=GUp43oW1Ze7ZKg8iL=z-9SH*SMB#
z7?%s8u401CdMVwARO73kbTN}Fc^KGk4AFQ-3U>6pL#H&+p9==6P#H@=fQFT7RSr9&
zpbjglV-E5u_SET=RdYHv#O$igtA=M*p&<OCi5<Ht!_S`AK{op8Ky&(CYJM(F(G@!@
z#0QQh7PGU1t-7pd8;k3m&=3Y~UH>saf9`H0Nj;lrS<>K(dV?(zb|bRJ$WwK_da8bT
zDp#kgH<oAOykI|NjiMTt*WixKzex+=wmQBRrBc;nz2k|uRWi4{aSm@Nx|6%@ZNX1k
ztIC?4(Dc2FLrn?Lr&ETbKHqk;5<nGB`;92GLZ~4kskJikqbVUGC9l&~-hiYPG{lX>
zk9dM`lKfcs!yp}XsNf=Jb5YsexM|%IDbZ&Ne$7R%%m=A`bRfu$-}z>UqdW3CeB+Mm
zatrD^!%W4x($tydXLMTBD&M5(<RouXF3n2%keLwIY}_#s$#f^XbOG=27d@xP=tpxw
zJ%Y)?%NX7)9WjIOV!v~8)Opiv9(N9RUpMQ{9B~^ClVLUe`m*^kz^mqjn-G}O3yPk9
z(c1;yq;g&Xqma^Bbf$Tym`(^6LsRs-F9XrG9>so-&RppTE@w#=o~lwggmdHWSl6ds
zbO%&i+}9gZ_c(9Z<_LLZ;v)CcL2~`|hA;IzZyNhq@kh<0-1WSP`~>ppE;`Kz5R`>X
zkTWim!Dmm$4B$>9HeI_1IUV&*m@NoQ$*>&5B5)+^m;K>}g*(u3+P(bjf$WzT4Wu0m
ztG3v2bs=`#^*#depWJN8Qq)U}?j$>tsB6<D5RsV(f~>2+LXFC0aU``zBdS%5x+PWd
z8Wu2~O?4$T^crVpnu4?(Vt<kuuJn6PpY(g9+3?v4nP;)oJBEy)Qw=b0XW1Z|UTa51
zM<tB4Xh;40CUj82rx;0o5u2PLdBgd9m#r}HRq0Hig6j>Se-^%5K!&#oxc}@Z*#Ets
za{TwCTa44R_Z5r4EU5qZ;6dYo7ytcW=ia?<@!x;OXEPA|eLs#~C(~)vM*Zp_>-VE4
zz}igz&v`mJPm7Ij#T37VgntVO{}vMdEhPMZT}Zf7a%Jy$4>qs4Z&h8fezFRo0Jj(}
znZkt_b-pQG6rr{TTu6VkbH83wzqwAh>M!*axJtVds)`|<G<LWX{B2<;q)b2FTi>~F
zy!C}2+PM$h^mLGRFo|MK<`?zhV$#zlChFby@84}d*m<vV6PfqVvh&Y>d6Zy2r5n6|
zOF!{fPz%3f^#yO(Ua~<C7ExZ=3F87I!kWL@aEr!b5dC4RQ@GLCDd9$Ar-U2ON^K8e
z<J|3S?6|mb!<S3AvFQC<`iZ}STKFBSuP?w2Z$yO~Ut_pMV_CTIN38B&H#=BK{sRtf
z@YOPZ@n^pL_we3>QvR<8Tif62fBq?-aQ?5YAF!n7_Ggv!{3aGg-^9XiV&ONj@S9lp
zzeOzcGllhsl!ePl6^8QOAUms&0qvjA%<KNvMd8l<X^;WM_asUnL>KNavk}mro;Lti
z@B|9y{@Nep$+W6|r}>Rc^zKipFKhk8LpgcUii-p|O_d_;<sd%;p6eRZq9s!*JqmO0
zqT}j@3R`D5(9eD%a(PGG_4tp2bY!?yyD|48$;s*afwF0ja&*5{{`OShzGk{ZS4I7T
z?F=WiE2QPSt@ovp6{~BjZoLHRJMubL9W>sfu?XJrz2EU8jqcukT=fWgTVHpdx+QYZ
zNNSA?V>Rlf&cq<qpc0A%b-zpo!zTz4dn9k))chN<J>SMW$s&r>o>}`PdsUwJa+5c`
zh9IfOnGZ-^9R-IO<>8S+bu?Cg^zb1(mC9)Z`+R5h>23w%_B7@RT9F0#sX(Y|WWw0K
zr;)*SLe~FSeO$sZX!r+VFa!FjUCR$YjFF8hO!TJw_rI@Nrw&iTv!~H^=;Z~oo<H;I
z8SwTZy{JTfwa`GxEh}8wTiE*`;lPiFH`QGUUD#RxjjFYpUaH`AqnW_I+zSxM^~!ZJ
zZBHgHqE_t7h>B=fEw|^i#Hu!W->Ns72Y*J@IV$F;dYn>^m{zZ{nOX|;R^5o#P|?fp
zl`|DOI%kq<bX|S}|E@2bh_vSVBvoy@R?BWhyYSo<pKuq>>>?zL)+-y4!w@1EuM(pX
zq9+9DFFBMIScxGGi{brQgkr(G7S2r#tTqFabk%K+=Be2zdS>SIWs@p{@Q-47@H#4W
zpr&_Qu15bQ{=Jetnt%0w*{$vsR>k}3QE7fl++JS+e6YrTf<?D4Ci(2#S!XZpC$qt{
zJhM5N?qT@tg&4jRv@7v@E?(chAzm*xl|KXx0vj3LK*M%d-Q&zDDZ%NF6*q$G;r|9W
z4oAx3x$9RoTYt;?YfF1GT9QUsJggD}T}(A0-vPNLhM%oJ>#_7BKl5MpSb9{Bk}qbz
z{_1yFkERn9K-rxn#RVlyMLpqJf;l_KvuTCw+v!7hohcS=;qVfkH?0d=zPqOw82SZf
zYJMRW=DIsbvHW5~{LRcGs*l*Aaj1nnVr=2}*4LdVJ)RuL2TYPt50>?v4iuP9tSen)
z^KesmU^PV#QOXkef#v}JJdsi0``x=#=l<P?_jW&x?eFKm&qK@m2$MPQyI{EcG=K}S
zbVxF3EVGLNS?y3t!6c_UD@2Xr9~0@E6xeBzjwt5@rYId^`7_k{4%1;y$>F5l(P%b2
zOH~Tpvui*Em_Y8t0OLDA)&{ke#>=ynI%jlI$7k!|y@&T3-*4Yn8IQ1^T4QVb{+j-e
z&P04P!o0#1Voi}WF&^4AjL(ovN$g*oO;<UN8s-S1Jt@MkGRmmCO8v{TtqtsvV{)c;
z5iyw@mFB{(w=i|hc{1q@Fv*fh;fry2(JFMXimk|_7P^9o&|$Isq6GjBA&{U7j9xKG
z1oh*Yb!yIL{da&9a%{NA*?@@tYy<~&h)H$El$u#+zf)n3U(;1janxRRo=poYXohC7
zrh{(icj&&ICX+533n<tg);8joX=bo|jIEbJXDGIqkkYl87K~<!WDBXEAz{r5>InX-
zTP>_N|Gu>v{q|dQ8*mZ{7}f`z#Vde8_MwNh8-~u3*u1ws2H(>3X3mS@@c=6qy*aEJ
za&4J$hn3^5Ei?Fe)!+wfOHbjvata4);fYwZ*uyD{<2F|%6DNghdy>^!kdsMFA_W@I
z!+sUW23jOxmUNoxoC}*s7x%tq-j8ZxKjM;eSX))~$Rtantqk`xnyp*dE5AO|k!COt
z2O2k6AptKPVii;LTNuaOxsYc(-TVVy0*Li0kq!|8kp9L~$tR$~mZfJn+pGZ~aA4PW
zxOLo6w4Va3sohgMg&q9WY#si*dr-#{CSxG`iNk-vDh=UWLkcC=i%^k7T^>?%gR(u3
zuBE`8x;!ZH1FUI$Hu)$S`c-0Cl_M21!V@*(k{<*o=nLs@IiLc@q^=x(%Pywrl}W|w
znEEmOWrbJJWiHRG``ldS26A@O5jPz{Q`IB<1?@|MN<pl^Q*QQd^j=2{-N7f$k&y>>
z=G)h3eCI<XFviRnNtbSMI6XO*&YPrgC(|uPgDBH02zB^vRo#zPl3cqi2ti5A?5op!
zl{2;N+OaQi_sTY?4bW9b7lMD88l+#g7a2Frkc~^34a?lt{$Ajm-evDY5(zf}goNj1
zp(LPJG}6fL<zrKLu}ltsrRWrVTfJQ66k<aBxU{CQZm>6#q?dgHLd~To(=-|kw)rX5
zoR~yID)}<vlEr8`$K66Vt9#oW#T+!YjI-XQ9ny9QkOTVS2|(tFd9+=6WS-qCKhvMn
z1D^yrP29(UCRJj-ZlY&#zr1Pk<Uw>7UwEb@lX}%YTJJpc-l3_6gy+Dj%Zrjue<*cY
z*{#}<M&K3eB?spk+t66=_+_+N+6sk~2S}K8%Q~gur&_$sRuZ#ZxR_Mv=9QS_Y!)V;
zJ}ZRp21GwNI68dUdEGjsB$8C*gxo+>sU2mKRqtzron2zKolCsYbRYHT$Dk4=iZr6v
z*Ds?-aAE4d)!Vy&tKThOedeHC;$xit-G-{D5e>7^tkBadaY%k2mwI=6nanWr!oY|X
z-XvW2<uJ{g7gXC=RUj6b&T6kR4O%ybNK$7R$XFv%un}#^Cn{Slt17lQ1tCtrxR5=k
z{3cSp$oMTKlWEpP6Elf;$(V~@4X(M;7gc~zmA<f-QBH*^RG|^XGb->ko}CS{E>LkQ
ziL7dBPz~N`+PxTM|Cpt9<u!IOosNq~o10fxR~sOvrDu8m5rd;PVYsx|R6nh!qw@@4
zgp1moUQE(--7Ye-4suno4m-Nu-E3?%9yIP;okNshLDp{5wryvnZQHhOo0Yb0+qP}n
zHY)9x-Rqz9TPsF)9QTCIxA!%(>&@<_ul;T4H4SDs?RJz@=20Tv19=t}5hIbBr|c7R
zLp*!%G4h)GjK@x42G^PjT{1dCsP*6IofRw$p_#XcE7THmF7HyQWdfOgkr5Stb4qAJ
zqrJ{+nkHk5M{NPVx$5g`FRhnWJnL&~o~?J^OK<>z!usvD)i(INH4AQQ@7-5};jV`6
z=Iyneot{=7zmNXsndial+g87}R+m}_yN{i2ua{e%wpORx{qEb__1dl7j@`CipP!wt
zj~D!{-S(fm@0S-p_qwONdjS5=z3)J9cvn1b@4GMHkK}BcwZQ9aFRm9iysN7#?yWc9
z)6h^Ycx?Dqh2*=t{=w`}czoZVIp5=t>f7IX?dNy<@v+PI>U;VTy6gAz1<%*#=<EOX
z1pxdF!1D>fSB-JK2yx`|DES;@R_ojupCm`2hn)vt8e4qCl@N`&eN}oqjk3To)MdN=
zh?Ptx8PYDfJZzh5J(CT8bwh$%@+cL8=kBa)QX?x#z2llYped)lakj&=bzsq?JI45A
zg1lf=xx&vbWnV#*f3l+3NEd!@iooK}hkd!+!0r+6%16ZJ&f85-1?9rT@cp1vwUk#*
zpPk%!b3;5=M7dS&J#dloSs22dm9IgR4KsNdO;7Pv4l~v*$ai~ZM*MW2z$=psrG?|<
z{^Xtc@h+<?CfbV2@)4s|z0NA?+aQ6PrgwcG3})O1&AgMEDSW9gX#2dg1LR#LlhOO(
zaY=tIv!uS8;)aW&g0W$ra@=QPh3bI`I^t<e$ggoqk0kCst)uV#)-a9b=EXyFKU0Bn
zvs9i-qdD?kVMHcxE}!p{Y^9q^=(NaY58?zXriegE+H6j>oO5=(0bxrg&AfXm)n?l<
zIH`3h+&+dr7>?37hgm6R7tR^nsVY-uOQ1V_2x;28#B%VjTy_=~MZ!wa>l^`k5;N8=
zo&9@J1dZQ`G;45k>K`IjQ-p(HL&ZPS77T2OuP{!K?A=(d(HI=i77>y8diCYai1EU=
zRp$WhupB(i9l)_ZvbYeoR<95(hvF@kXZ?GnAqWWuW`~56<(P#4XxxHSr-f4Q5T*)C
zLm?O!P2mnk!{eF<ji6=n&d9i+hrAQBBM`b`K$|dg20eoOC8M&xnEDE;h!;N4{)h<C
z_hy@mCfI*_?$TmeLf`Bkcg1Jll*c-aSVygs=?osM&WKn++*4l!&6|OeP!#xKW;}bI
zW2=0DTW;b@$n$m;w_8P?`Ek#Q6$B9H;<-$!iLs!!tkmCa<7VUjMNm<%KW0b0XLa;V
zKT$b>-XIk(_Z^_3#kLjT;hh96K1%&nrSco|WHlsY-i_D){&vtcR%OGU2NXpx|0HgL
zX2kJysG(MV^BkRhz1bdZ+An)?JLapB2sa5uEDQJ8&To8ho7v_;SEn;yb#EkTCX(+O
zd53Sw9wSrU3gL%@ZJm$`iS%f$ulVgt`g{un222vUpMSqtu>=JPc+pr!+942#Spy|P
z9T-zno+<)9jSiBE_am{TTy~}^IajacfBPbW$wh#8BFed6*6Joh+x^YHD^2gjU*zeI
zV&aYWVfWAlbdrG0VErT24YBCGbO~V*toz0k+G=LgpMf(+hy;qc1q5QTDE-TlYws?V
z?#rzq&b!28hf9F<m&BQDH({t<E+K!1w+H_2LPbnPme_`Q;R!$^NZ}6{(O51>3)4{l
z>WY=7eA{N(>irMfR)7bJ?U!Q=EF`%JNLVd<1=iAhFlEdYDyodzt?|$I@TQwGC5CMo
zCuIlx<2*)8X>j|~zJXvf(NwV}+jS%2O3d<Kk67WYOY-%+u=O*hLN@j<*Vw6Ri-k@5
zP}F2@l^T^P;@aXp$JIlJhzB}TohjX&T!RFSJY21c`Z{Rqv{_N_aL0aQV>`0(Gw!GL
zK#g=h2!M%W*s0sVzlfbM=1|uwim|saV5C|&Sqcd*xVdFQE;H&}zk5iFg9`L$Y)c?o
zOAP1xDf^b}842@RuBA?uAR6Z!1vneWlhVWO!BiQ>pw$&9lR}||s!)_h9sg$nm_Nz_
zNA>2Z$mw-vaX^)PyCb5J$BD%v$R6QcTmc2+35wyQ3Ho}dis7?0v?r>oV5%p)*y!Vb
z1#g#ZzzOf4xRyvjydTh503VkwtbbMD*BV9PS}NeoOej|27?VMQ%9WP6o^Me|AAYce
z2_NrvGy?xne%$ZtgN(a})kmBnS3HeI72tFL06;l|pg+V)XMe+D-D;hqHk-#{JI%}l
zg6?BHc_jAMgbDNbJ@A2E3YsyHQS&KUK;P#aq)9pmFu}kO@*DkJ?4*%hCZIMTyd-RD
zBzALxTQ<Y9VuigJmX|EnjWJ4OrP|uz+Y{t*zVR68zlw(C^GQ>&vWjm9o>%II+7%3w
z25Z|a!=xx-E%ukQL)k%B;!y+Eo6YerI~T`O{H=fKu)9ASQlYJxvcmAT;R_CRa%I8t
z-lCQ(+A9|#I&jj%=Vj%lxh}%y1vh~4xhufE9-)D90D`1JKM(cV{FazZQtu^sHi^ab
zJEjfb(5;s}RmQFoV^pJo3*9+7l|Joi=xE#h>L#&&OpT;9adoBuf>%EhVbrSu&D;Ta
z@lK^K5(Vrw_3?VT5SzupgH&@6H+1GnK<FHw*oI3Ai=8&!P<hNcyesH40db>g^IQ$G
z5B272l^7*4LbuAs#xDcC?Lbn!YGmeS5UmR92c4K4S}4+om83FUxN`qIHv(0wUBnEH
zbQ>4?=Amm%_a0lCSAeO9=BWPp0V}QB>_V@8sY=%v+J0g-FXgwKlm0Y!V#2l2Ho<RX
zNO9g6BR|c2T{X=lNrAgSIW#wcM}CoQ0E#)4lt5fwTifV5=WOM*O4i!J`axFe5o!K9
z1@9BV%W;0zqPrjQtCL9%wiFEwAb5SOyY=NKYcXgb&oE1oWw^+x$5eo0Ss`IQ*9=i#
zQhIp0Xf&<F-6@fFk2GX84uIj&{Du)}a^e&Gp!og!7@OyB^2R7D9nYUAwFJr4k;f~=
zV}S75L39nUJGuJ5BS9YWingPUvd95QaklZ+e9xVQSG-9OnS&W(0UHP0!9fzqOh8CE
z*T%)oE?YhdFcGI1<v0qb0EH(+`AN$9Rcf#f{axh-L2yaT4r1p6hxHB07}jZ^6#eb;
zq`)u1+qr)ilvOrFf==>!5wRe{BB=!^_;OzEAwm7BVtaXARoKh`sH_k8mK&be{ZL%y
zKD+IoeZcX==Ib8-9BsQGT`Asvs~s(_#}&@r6MQ;`zYG5U%NIokV(+u1=Kd#$7tI+8
zdXNfGxRQtB`7vteJhwrTwDl%%7jD?mp{LaK+tHWp;XR=jmPL}uC#=8k-1__Q3)iHq
zAGJ8HA!jT=*uv;ZJ-K@X=hQGR(&wcNVgKq{{RzC?98~iqScQwk8~$$T)F8qHnp&kz
zhF(629xeC%g@3<W`brnS!i^~(QOuxB9uGq<Q~E~+N+TIegqD%-Sk!*MhJH@|=~n<3
z$i_=Q_*b^daHOXt%9L8QXluW1Sf7H#Q80&VLY3l1apHkh%q!C|dtyq2N8MQ|wWxco
zYcZen(631-w#x$4cB(UOJpQ&yYDUt$yC<X(c1+$YS>)Q=|7FuAd`^KM=ZV3MkQB&i
zjNAIx;PW-^KV6WQ+vv>cvX#rY!Iu~2k8*SxAS2~QZZ(VlTG5%s--gK3=R;DncdJFM
z5|n@RU=iLtgfaBO4KE9_)(sj%<4Qi1GV}u6tu9;C8_Ketl>~aXvBCB!|L3~jx75dR
zYn_LO!&CW!OIj6<yW@cWmoc)p?^(uvr%gl}CVj5*U?(+wM)2lT;sgZ~!$o*@Mx$e;
zaG38H$NIwMwHc4DYV_fCz!X-B7_ZFc+_3}-9G-{(>_~JFai5QKVy-nzRs0Tx)>-K$
z-zL@P<x^gxkASMZ2O!pUsn(PTSY<>cn}9hMZ3@xL<|j<rb$MRTW@s4VvOWCuJ*Ly=
zKuh`!ML{)wF8o7}iZj<iO**w`Oj&y?y1hHZk+%8cStb};LsS!3UCZQ?YH{3mF;ekU
zk%rcRj+}wlRECYMu<o(t{)hjvGw_N38vu0(hyHdm*FhyELEub);|m~o^qzqIbV2J_
z8W`ohG1?lba(76$*4I1;2Wd&H8<8W$is#soEV#XYg^F``dpjj9DUOv>%NksKPZ+GG
zFw3w21^S6GTM>k2s{={GSZix$9vX<_Au27ONQDEO&FlR5L|QlKhiV!<kIhpE;6pg{
z49KW}W)r7khXO79#t2J4Nj5F?aE2nr6bb=gsQKcH^N?~iNs50vsL9FR7|_%lc?c5<
zxR42(a{|f(Gdm>_PXeL-SZ}JBDu4QofKLhxo0Eo-{~%4&FGim6Sr<3i@^}U{DXz#I
zqP4u?cS5M53TD}g<w4)RRBhO7jp2f4_HMTS<k0U41QyYwWzOBnfZmzoean-{H2MFO
z>(4{}su0<z(4jYriPP+vXJTsLhHd<M@FJHM<l=}*1_lp!7JZvH?_T)O&Sk+`(n(}E
z%aJn_0(Ndrk^i9jl#_Q090%1sdBlu!hF>Zt=d@FI-_ygi7v>!TfF0GiJpg7A6l;Qp
zGq?sBcP8E(d2$EOC*Fguv`Tk2O0ag9)Igm+cAMie7dG=QbouhiiZ!ERJE<KchgWy!
zAvGB3sGha%?%5j@%V@h)5#8;3@z@T1G0bl$n*MR@l!rr_;n3fO_$LP(M3w?j%dwUG
zKtipzJFy8${cP)=lq=YurEbnuvzuW-87A!mFv1i!P2Wg>byAXQG67*0HR1B?HSTgf
z^T=2dS-fSN^)z=&Gk6Ge+n1`Dhl-09!_>Kzrt7M|TJRHh%k&N0`3hf;@I0!*%rSNd
zCTlw<liAva_f(!n?(1T#+4BQtd(kbULa1$F0maR?3Gce1*S)jtB;<zk4p617DZT4(
zIP(Df2W!pt%WKhb!A0-&l`<DWfRfLQ?fjl){G4?BOG6op<elMelNfCkm*`&UAysUC
z^pW#jc-Z~i+0Lh<_3)3hF+`TWH9q)f{>^E+J(-OdmFBH@7g0647yj3%64qk&24d&m
zo(-GcihX9kk8794?H!->DlVr)lbh^MnhROJ^mcne=@|__@SG*7Skpti6pO)720EIq
z3Vx@T3608KM5MBgI6mO+I4u;n0SLtxRotC8@NGUnA-pRUI|x~131fY?t?M_T*1v=p
zsq|kb`gYMB$eh~;+C%7tNS0&qyqQE!ML6NhoeN72fXUmKm2czY&894SIF|qV9Lt2+
z_)b@MS*$3!FlR!YG-`2XMHQ_4Ksji;7FMAPd<Ig(`@>1=@u=qBF&hHMg0cszqoH8i
zIL}#C&+8?C2kailt+45KEf@*xq<db)I7y*I%1Bd<Uo)aPF_%NPj=kV^LC2LXe-@_M
zNQav(-ndtM_sy14%K{zjkr+rr-3%!$oLSMPrWi@PQMC)sZfK|CCvkfu`K~nxHwAj;
zBGO7b=BTxzuf1OIued+ILyxMUuf8J=cfSN$)(`o8Jn3VmeHSrdz}#ZrM3ee==X2fm
z_H4S{Ye|7ND4$D%(Emb5x}f1mPU;>7t|v8o>gJh4&spELx&##(qY!`=J9HnmReOj1
z5mzJ-#C~{*z%mmt5gcU~@xo|ua@s2(@l`AEqRSp|g)SVwXv7QMDTL@jR8+N8xpfvq
z8$qPH3Ns^pHuDsioZC+<`peTf^$!yhBRm@DNCZ+WIH=az+PWq$oKHp_QXgD|U#pS7
zr5|ps9ZpS@LirJDYg<R-ANH%xomlr-p6pA-3!GEfSaq}=a8n)I12Bx>#{<d_R<Rn(
zc4CczEerp&tBh~BT0yVeH}Ct0^Ke7=BoisPU5%wqAh*X9-pU+dg%8Py@^wBU5v#-x
zcZw?%lEWjR*!o@tdAujD{}MBR_*@y-&uZ(AO0BLMOjF`qyBYvpc15~Y(3}K7|0CQF
zH32iiU=7V}Al^IVQV}X9<nagB?Yw8;mlJ@vr*!FqEu%{GVe)ix2Wl8$4?$9W;BkQz
zS#OrVAysG$%_HUIdYHH%AH(GSs{tUCn@d{Cp2tC9ckn(`w+ovj7YGKNb{%~ouW#cd
z^dn7ed8-1eQG9^h7;3xui}F|$A)Q*eqL_(v2QstKKe^`!3M$!>d@xaCfSP1Q>Ge24
z>j7-5MfL1qC%tDWgAhp>tA{qc9=o_5v9C3VueNGAu%|-;qIAEfw+{4LHg3#0u^KZI
zhS{?P6x!`*@1ci(g^H}~eSj@ZEL~ainh#`cSdusxiZv3kzN`XtIt7|d0}s{i-6cEL
zYkyJ{)yj$QfZE9jI#12>2>$d;j7vtoQ?UP_r${XGsod%D<ayl;F7c~qsSYLH@R7{Z
zEm9IAbJ`G!0V|%@ir-6cNi*YrX}6&`Dr%PzjbWEtctW}Xvg+SjunRZJbzp#>dJqPp
z{(-FI{^9B>U;->K147TeT;{~}Y+fY%;d`)RNX&zDVVP`GZ<TlxRu0=*nPpx)uMHWr
zKfXPic~o;UxMT0NmG-;VPXN;wteMN{MZ31fJ#$pBB|~G*qu%Ax<yvV({3o}O7Bt51
z4CWj<QKJ4E*)s|EwPKa3+b@4AV~Ti1U>c@~WxcQN<x0o(2cC{7f99l+`%}`Y25pkU
zjB2znZ^Ak*CJm(FG%U?PpGGzg@H|gNUpPqkN38y@bH&eMNMYH$g*d0LB;-&#({y9+
z&o(y+3g}f|hX3gFmujcef_1LC3wA<*IJxr9eoEPQ7>`JAWQ;>Utx1+JPyGxXCJdrC
zY!s%4JK}UH^=VD9NtU_S?smulwmYpV1<>1sBRx<@>4+Qc<(0m12nRsVUlhl)CG;!4
z_kwS^B_CBDe&Y88Kp^`KD7eO_x68Utja~;f*w!!7HyTz!A3LAun!v_yszkV%w@~~Z
z(N(@rgrKL@bMNkom+Rj;f@f>Dz4`Xt|Mhzf=iU4CwTdxAQmJk$uT5;&09UA#dYzhQ
z;gJ@q=U~(6r)4{J+dHt}n=7P|N?4_rT=LC<a(;<W#2172WpH#BTPW&B!tf5G83a@6
z>fUXWUHPwW6LyN#`Iq32>d-O&mMxa?C@!T~gq>f0(-i@??Tu+bb<}qWt!AKpg#^h+
zo6e?xa|hlaNDa8R(7^Yj>G+6p?IXNP$5Z!(1pr4nf*bQ@!rkLyg>wx1PXpLy78^n$
zj%NX$?^A(zAJci|QAB7vv$JeL9jvj(c=W_J-D%^xpGE1OG;TYicW3SiH*N4{x5xO6
zZ)$r7VReApp9;>;Gwc|_D)#~rpZitRkU({ktN-fzRg972cBG(RBan}lBh(|n!X&X=
z^+r-}P1DrGxBbyqp%#jp8&D3bb1M9+FnN7RAy}R;#BY0G_8;Z4UkGU6(vJ!?|7`Wo
z)|zMC!(NWw&)d$I-Ba#Q(roMd?Cu4hU**pfu21F9XZ82P?-#xNZzhE=NEI&Csa=6e
zp8yzhaMvT2kIrSw=ym<Oqj8?7{Xr~lb2yEk4EzC360c4>&ATrv*J$XS$1c*5#)AMR
zG3w4rl0*hmWU>Jq&sNQ;vq`FLEJ)EZvZNRD2sJA5aUo4D_1jz>u}Wh(jpk1lGD<JY
z#?G355rV7AaLE%mx8)KWw-t&~l_(VTSPr(oC(L=~x3q$2FCt1Z89au=iNH#ZcDzzM
z{rzUhKh&CuEW?ODl>H{g1*72`2Kx)nUmBbN)M$42af~rJKf7@H4~Rr=r@OLRUVMZn
zuN)SD>}fS2G*V?M{8ygKTidl_e4_6(@1&l_U-k`~oc7b>%>5in{)xEEbX*xgPxrzV
zUVZ$_(s`%vjrB@|Fnm90Cfl(PqCoi}5G8ho3R9|fdkr>D_G7EAx}m0M^$np~$kZ-=
z)a($s*KFeymn*8WV)$Zj%VG1H{qkb5g?D1^4Wh^sqt_t1Plte><ILeYdK(97vp{Rb
zd&{i-&tWObiCrj<uJ_bZ8BtDH)DQKsNu=CO&fKqhh<7j-7sgtefRC{PVso@qg}V)F
zFQjMiwHY!qqh5WmCqj0m%Or<mq0gFMaJdrTRzUbQPOhg3$Y$%<>M!sh!CdxZD&=aR
z!~fuV0DP|iI7fe0&C_Zlz0uyqb#eL-=)|)0Cjf`{B{fmNO?rU36FAOzHiZr@uTpbu
z_L*Wc(3KgHQq>>9(mYq?Sucun+XAxu^NKev4g-D4^}d`)iiz?PgWZdGdtP`vaSfxI
zIK%#W0Bn3l)Q5YtlF?fGQXk_ojjiO4AI%L0_oj=P4i+qsWvF_}CdF#?WR7Bj17qs3
zH}zjS@k%3CNeYJ$1F+$_Ak~g3S=nR+cFj|-oJFYB=*5#keQz!qo!cBhN5$@j`Q&h|
zG(G96_qH!tyyPwN0?Ouw`WSzYoQANr^J{@k(m+^9`=wigY-G21=31_>GURKbdAuId
zvYCQ>VugbLR0e!8X44zQ89q-l;NrR@O?1sN+<8jmGc*JhgpEPT_a+!610}=M`c_?P
znwHr)NXAq0@yuk=7ayceoJN4!ekXS)n<6J{jI-6brOQ*&T2`@3-h(k)F^>0AgsnQl
z8k^x^#Xlk_#~@*9e@;(67AL?%0Komm9toHYw~HirY8A{>N%k@&c$eELtGJt(Iqn}u
zy(0`$i=%f;ikkurSiv?is+s$lZ{C@RnA>i1W50N#Q=1=njXY`b!qMMd5M3uL&xSim
zbB-haS*5N?q5$Z3Y$4<9Y;^fRF-So9W7XvjZmrdA*gHy;%dyBQAd@$EwkH-_L_bhD
zq+E<|O^`ri;FPL$@iG*i;?Lf)7gew%Fe&aVn;bRI?x=tkJUDmc7O*yxcOHkH7qa;Z
zVA@7&8}cmA6J8B-?g1_3_|;7&9kQGj#_|@!#Og#H)MDmrjN*OiL&7-1bu9flsUoYI
z3<%F%ZlrUSGzV&#mrYJAU&EWYIAlMjIylcmda}%pi_EG<PsYgSW6en!6PutERXf}=
ze$q$-+r@MIP^(&Qvs>wxSITl%#Vsd{`eshXMjp4G4{4=9Kmb!kKQo3om?Q!&KGnW1
z0e$h=(Zki1-l<MF>Qc1Q=l4(kVrSpBdAJRu|5i^(GXCsU`#!!a%clmD^hUDu2Kw9y
zf@KY49|{SuiMRv6kp;|TDhILd{B(>dzkiRE0pS1-uO+vYsE+tpOFuiF#9ta*OFBpo
z=?Fhmzl_;#2>%)Sw<W|e=elH(3<f`A&Jzfb%V^p?UNWk)Iibj3GkO4x(%s13^7}2f
z?6ukqPk8O90)LgOXCq1f9cStwfy7QZN(b3ycdQtB0v;XU_^ixp?NXCDm%t_^SpzBb
z`Zo-+2E(()#lhO#;DZLE#9mg($VB-BiKG$S_aA9nh;G|Ag;lUAvGQVxlq7RiU-t0a
zf<5_Sc2$?#NonG#?vr_S3xFRLJU!Ol9Hs#3u0{n#lcoupk!?9^)EyzZLKIp4do#h9
zW%YUy9sLX1@MbP`ET^SXB8KQiQ;!Cev*lz>$gbWW2e2d_(Yb@z`hq6ue<6WvrPpei
zqmO#;-)!H9cG!rrrcaBd%VNgn0tvwmuQ)}9HPqgs^J^MvWIC5{j9ptR9cV_AdVD?$
zYD;6n@RxCWHgJ$PHGD#1g^C?;)Hu<Z+C3k4ISLSsH>rPgdA(8}Jx9;o?YFa}|4G1_
zwk|BW7II_phnB|zbnTM1@29ve$>&W!#5Uf`oj+|tZY8nz?`YtZd$8`TMz@LP^SgT+
zz`eRw#Tss7#yxhe^??Tf7WOi0s{j&dY;2wxu2cn2GC+}jtbJ#47CZV@+dcx?mM#*@
z=4u`yPrAl%v@Uwnw!fz|h~8#jKYIdc18W5o^g!AMDaA-cvkvB|P7$TMRNtd`ts8q@
zt6(T%=Yh`IUR8ElBt&dThTKaH^+--`OaREON<LC(rq8kMi#9m5Nh-%{@^fHJfrn3F
z@hHBp&IJWTWUy;r-<=gb9iW$tG6P~KEWy)z@l@jxS0M2GZT$J;NfdS2c$WRvQD1+*
zb7#Uni$o}o0FM}{PRFsc5Qw*HJ~wU#7qL*mLb2GJN%ORLTGM<_YW0<+U{P<n6u4s0
z>ETUuxRS%B_iJ_X+w^f*;I0vq8(BBuZ7wx>wMB}i9$f|5Wxe(Q3y9-C<Tc6<F^(D)
z{g5TD6gJKfEYSLMM|Or)dFP&K7wjI)2v)Ns)jp6cGS7spIT7H|?bse5vW*4n7vAYY
zOGH?|t$ya}z>`6iyD(lv($5J(ZjZU6_srO}FQU%iIj!!$HF^7c2~HGQ$KIL%N!dIB
zzqVR{R0+gZxS-j(_-G{TK2bpA;gkmq;ps$C2&*L?K*q{4l){16U>ZK`hH^>r)o`a(
zqjYR8*cPw*-u*)QQC*7vsN1I3<Ms+-e)Yo0>{(TtZCpQLPIQ9Mom}ChcA@>A(mz{}
zX(~c7I^j*5cR;m}2({h!eP8gWfIU-uOew}<yInD*Z+=DtrL80T4+P*NeAj`_^F)r#
z*|orfd{}i!vAsJrWO<m&^FAjSjGlK3%x&7{`p4B`vYJCy<ZANjHMVhYd94&99Onzj
z=NF3_TLvuH?Vi~l^yqD`dGbhxEiRz+UVxOS3V5P1Q~H=T;IB9S`YvJl_<7O1*6C5H
z+%RI<>3bckZGok%qX}i19zDKrn7`85S)etZLlw{KCwCSM|0PFh#YwxzW+fabBx8>f
z=E=foRHX!y*VL&~<+s~JWuW#(D7bCgHpe{;cP}`iDFYEo|8-!}A!#t|<mAWkiWPa@
zl*xyNhxQ&Z#c3mVSn!jL+j)M2j~>?XMq@AzIJ<9Y&+&2{YQgB+MlI%m59}Tm*Ja79
zr!~*arL($(QEha;G3CuV<Aw4qdQx|W$9UxuzuU-D2n~=gavg+SnOX&@oXOoEHE-CP
z2CJ^pWsIPRpsQA9htJcgIqrhP?ELYU4G-ryQNrDKpvx?1he&w@=KdFMQa#v&etKor
zpClqjBe`^-UYgRtw_jFVEL%}ICaE^%Nb!hRaA)e(hCN4DY}`0O+liJ*Rn<<|F1d3Y
z#7PhJs+EzWR2-Q~Gf}cacS=B7g(2wdf$Q+^qZr+bv!`&fPh@9f)8SCsVON<Y*woe;
zEMT|%qDK?}3OAFb5Mj>2tEk<C+u5I#M)5>@94QO7w!IML!29%6$MX}$x@*PTreNiu
zlwRKAoZAKb5b;B(azx*Fvb(4IF5fDug)};!1k%EDVvlziJgI*Yf1U!<qm&f|YCZxt
zDFQ8TSsBR@I1O9G2LLR|b*LWai0v7Y`W)LSQ!<uhx=H#>7WfYl2UL)Ju+=-{fay`4
zs-F>>4ey+@$rO4w>Gu>Nvzp$5aEj>_BVWCpnm~+H=sTr7(ak*k4V|h+8g4gd9b(Cu
z{VL=c-{VtAGtbkH{^W`+Zn^5gy-tU+kf}J@;2k;}9^PA!svQnlTCQJSsw7y%-8W%l
zq^mn*+H%DP>wJL!!`pHso};;MvR~YeV_2@8Yo#-ls80<3G`CQrGQQjc;k`tfFcW!a
zkQoh2Scx90rR17n$5#rpQ1t$zZ3bj86=5`?u|~b9q0fmc6)oj64t9PLs#Dc6Gg{Cb
zLKol{Y5N`KGLJYt()(z`5=nMK`n8!w_<wSsJtePm{bECu&&Qded%-{Kb8`-FQ1{#l
z<<-+!_DDtm1xQ&m57_Cc8ak8MPymtiwR#27E8uo9JJxuEe$IgJ)a4)qFD;Htqf>So
zF9DD|AJ~ei_PF-3<~4XW!ktM7^yHf|jC<wf>~hz8RIXNS{$xB%NfTBQ7)=urX2VIg
zFadAwkY0ICb`L1dzVK3p_3WPYdwoyNwTcKH0-!beVyZP{YxR^&6)An|zG}VHs>@U8
z)I}YGJMT;q@|C`>H>`!Ms)<EOm^G3Yuq7;}W&r4qmX^g-nglrAgte8EO_Jgb#w4;G
zc%4X!M^)2oKl4$T&vKJbE%b+^q%2=aGTYv*yjKcvrB=&`BSOSrSEUca##*=-J~en0
zK$51$$CmN;Ekfr@HT@n-vf_d^Y)zSvSrf|x>~2}bX@K0R%!gw>#^p+PLP6k$vh0r2
zf6I{;uEQ$22B0Y6a6cocoFChq|J+3YW4z|%Cc}liLh53*h>yGo<FQrTaKN&gitm4x
zM?#Im%f@UMkm@P{BkYyOm{<?WP-OBe|DCt@ghSz2DpLfo&sg6g%MCIcNdJ9Z;8rZ^
z{LDBwqPFd)ad*>s!uQPe*o|m?8d@m?b2UEyq&YYHK6BOF_HP5lHeW%kq#Ty4gG&3{
zH!Xro8kqOnp1kP&gXM8+iHl<he7UzXPqtRF>aA@9M5D()a$~8XL+zF8t$J(7pV02)
zVLMNN6n3`jZCws;u^ovLmZB(kq@VDIPbiqI)(bsIN5?z8=BArGrB`iXI2qFNTJ+sV
zDro6MKnOTx-j|Aj&i|~-HLJzshL6LxTenUm4gI~*HB1G8;RWCi%lAWVn-#Rn%G>Dh
z%9f?hlOT&stDww-j8vn%R3M9G8!H_=1;;)4jJjyxK%#=|N=6v*0aVkU8#UkUingEB
zxreoEuZV<jmJ`kkf2^2&e`S7@^7DwkK573np$GyM!#=RhQ!S8BD?93va5^WUnnlfn
z@a6BwBp@k?1#0H*cFD)%BMUjSp7L$I@vT3Ov*|L;#ySjjbh@h;i8rFGdDJi%8SUnc
ze3fa{JN?mL$T>-|w}ozAVx^(v6g)M7?2t)S{=2%j->@>T{)x9V;5Vq=M!{4K;DWs8
zHU)^<c3>GShLrRSlqH|q7beuj9@ZPSQq@Azgu^!1A;y~iHGqfZJ)m(Ecz}&5VZhAG
z(W_014ho|f=G@TgG9jT7WXu51B;b%PpYE*X3EZbnl0IJnj%J~MF|5_|kq#paspN$@
zRNomb7UcKUW4KYRW<Pk<7BMmQ_OaiCjO^|4s?|Rl4%V<)jls5qlyS_`3as2kZShGM
z=g^GOuOwoDeWt6Nd2oZ_Ew|TxmvO=bL$7>u;_%a{we)NNNd$`wI50)DAWRs>1bsk?
zIO_yC2<9%_=sl3b1c?$divi=vOH*&2svv4)c?YO98q$wB4wEblkbd$@7Y610jBsEi
zG7G+Jc~HVMQWY4}7x=3qs$5vlg=x{H8PIlAl4v(H0BdU3`4!XiNRcd6oN9qm?~eUQ
zlNr@?18>~UQW>>@Rk6o{h~^y&+#cYubj<yWLK4iuK(T`AeD39-729=%`lSKuZ{|S{
z_0%F%?F=;nbaNHBhaGP=^OZ|MGc@Vp)*V#t`aTHmVrTw^b<e_{?|vkfcC5<#+#uaU
zRBlgd<qYwsy~<49R}(E^(3ZH?FaItY+ltw(lt<4VR>|lA3`F_A!K_g!0VJl$SGDdW
z_zvBUHpj+Edg+yFL$eWX$V2@1EY$`L_=PXE_{s9kDG8g>_S9kSK0CU96vaBc2B0MD
zPN*}4nLd|}n;ZjuGFv%IYWzn2r5O&z_wwi8>KO&I-CaYp!-9J~i;veBz@K5Pl`AmQ
zcBIQMg?k*}VdPhqJv0#4ds|w+iCju_sk9<Q#skuY^epk63|S4su%jOBSiT8MsLlza
z-Upx!;LGO~pb$^0z{NI+ms=X@0RbW6r^j$w{i&pz@V2k($yBJ^E%5~Gm(kYeS`AL9
z*oCGX_`+o~eK~F-*9N(TvQm|knhQsC#o@{sypiW&-ob}uljRfb?O)$hS7cKQhD{r@
zDNAXS>k{1{CidBWcx`#b;jyH+4A*|uXio29w3y|z)NaLr?%<IeXYUCbSZ6;LDPlo*
zZ2Fdmk4IO~XFzftBlU@+40SGYVHxi0<0?bj`_6&TYs{ME>}x(^p<;TXEMYp;#7xS9
zI1o!8AqJc6_-w!FtUHWC5zpZvl|<@@s80`O%qMeJE(+%}`=QV%@oUWLQ@Jdl-J#}I
zDR6efW;bHM^{9EhP&yCu&#iE)uyu{Z4Lskldb~TUH<wgw_{-=)qJ<X@=E2JfI{m8R
zlXC(NFMmN&7%qU0U4KZwYuj154$ghJP$Iprur(n~BNn?LPqPU$a$TX=VhMi*X9q56
zWjKLcf|rsT`;_plTO2)KHs+rt)Q_G&YnEVd^UZE+dCi=!HV5jFK)WD!nFV2m(i8<x
zvb5+3TJkj`(Q&wt($Y25g3Wg&*<dVwbn3?!YtWoPnjON&mo~0QP{}(GawZ}mv%HGo
zTC;N4sPpdDr|kC9HY;*3XTQI;Qoon4z9q#GapC5sP^{(jo!qkIBLdirN^8yOBN-g3
znfyUd3})ahE;%<>@?POcpK~EYp#wN6Y=jvw@f20Q%EycXJ))i$SG|CA$({Yfty5pP
z)f`p_l$9I??dL9%+)CNgdGxkIU2+6b@-qNnPtKyI9zxg7kdDGSavd=YouufjVJDfR
zuV>ckAq^h)IC&a!@UZFUOW(t<n9`V~nY(-6X0<`F4!Hxg`D21;sYXkc#?^+Rr}x!U
zRr{|!wuC~X@uW$-_yV|?`Zhc<c9g+`cOqvMZjZ?jN7qM#P&2|Cr47jEGel^J*Uf5z
zai3(3r2^TUqJLU>jtF71%1fQqdc&DR{6p&L^@+G-f5Z+Ce{-$OkMDh4(f~G&#ssN}
zK<8H~W6laP4Mo*3Q6AC3tpFlC48+C;t4zI9l3njEEOd}^*GiIW|8TlAiLQ*Wuf&^b
z>CsG-v}ycCATwyG;vkH=E=OgDUy#g8RNf_bHYgb|EW(Hv*d{UmL+??uDK)(FAV9~t
z<0l)O4J|#iA;WN9Av!MpPZG66R5Et4rT@GXKRUh3zH26cA-vcoCDK%O0%LG+V@<kN
z<^dC+Hk55bX_9F{seAM8dU~8TFgI?H@H%`Xz1=rdn<eftk<!h?-JVx~RGWqngvT2g
ze883B?$&rSwE0xwtK1bd-lv6(Dl-2a-W6=n+Ol|Np%}yePBRgrgKy(dz5Tt23UT{9
z0de)!R^7+<c{vCl_O=hz<YQs>c9>vHF!v;3_hX?ndhe9c%XI6w@Jl<y?#8*hIM~##
ziD>ys)ILSU(4XBY@$$tzAyMoFbH7Gj1D_-j<r2NvOW3P;de%RQ<dRqZG2T<1lX=M`
zaG9{)yF+>=%#qp59yCnYH6jPQ`XEO$_~v+0RS|AWwIcREtoTB5?|(TWa-J3p)1oLy
z_kSvInf0<hMUP`IZtyiJ4Q&>)U|76Kp|TlLcMNGKcm8sPC|(Sk)A8`7uflfp)OLU&
zvG*PlfFppX{Nk6BUO2TdL)CR^CRgIB<Yypa%f!(+#~r^*4HrnEAiU|nKg2EFn|0+4
zBQv-~Y35R>Zi{gNavB<|o91KNjn3s+R^(zc$xBB=cV?%7X%kIaF-(A;9_@2`?t3S?
z2``Hwt69a2a8`7NYU@y4_X#9eCjziN^`#dCL~Z_tj^;#IFS$6iMsPj^qEr~6Lphfq
z^73)W&HaFi?l;(2UP~bA6bJqVL8RD)S9YgjbKle7>jSbI2Mx>Ul}$L?t(^_E*Em+w
zcu}kQDbh(kE#0c%hfhSJqIwhcn~n-hTDW^7xb+prgPG?SWBU>qhdnI?=q8v6Jl7I<
zkn|EG?#j1(iY^1~8dTwZqoCC=pB?=GB<5GH<^;620je?zS=LaWhpnD%V{2ln86a((
zAlyCJ2gVsA$K^AD3aombQ9Ue6r5>fw!IV#yv|eK1;Ttj5_*WnyQvoGO8Hv%;pd*Hj
zrvglpzpT);TBG<35#XZWyKu&#u<4lu6OqNllff9I`!W$^Id8<vc$R=tT}Q98r>&Bg
zw#CR?>(!LRkOjS8CH-&lRGh#t4T=Z?U2zX0-Wb7$h!OCJ3DW>K#Ddmo5YIJMSN^vr
zXCEs0Y=RN17<h9~Vzjo}vZ5_Qo&i*Venz&`w2=01aB)>#Foh!pb_qBfcN2!YMFnoj
z)tPc(@{)@~Jr+$}4baKB1r&8i^jRKu7=@*OZ%JbRQ<jMILu~_y3`VeJxb6UDbjiS{
z$HWm{+hf(!zS0(_uD)Ru(F<e#sP_y^#AwL^sLHtz$Bu*VkXzWYQ$%g~XID@%Tr(k&
zuRxBa`mE#9q*!@`qjD+Le&B$JGCl)oJ&0rkE{W#|3{-T8Me*8;dQ42^UVSW7jtEA;
z5ja%;k<dVXL|Tg4scI=Eef$D56bHD>4(gMGpgT`CnPlyU+1;RqO7q_a#l4hj6avws
zzu6R`5R!eTe<#D##qV$SUb`CsYnq~T?7CO)rAX(&ZAK%^M$*>ACLJ?A>oJx`Z}MPq
zP|yr~SH`p}bEL+c^+5>@>iB-lhvC|%7$W~LB(Lqn?Bd{euluxnEnERWeoTM5Y<WBF
zg%=2OvZgbGJ;H8Gl`9x-9#rB67ufDc@b9w{ma8{ZDCD&?X6M)4?WLp$4ywRUl2VBb
zsWLrY1O3Gi<|thewh`%7>4oIWVI9F6Syny_b$%%*iMiQwh+j0<XJ!`3w^3#YDSw$#
z%kdn#>8Dte;za6<Tu>mPu*TBm^(L{<a3;o}L}Xh8FpNW41U)F?LUx+Smi3GB=0KW_
zB_#m&q{P?yGRMYea0imR?LL*HaC+(_bV<G0|6brpY8i+_!v_e_T)Sg(9!fEoRBVxv
z{;atbAcwy=cGFH^I<1!r1S!25#9vN22XP0f&n~-ELYIA#Z`U1Y5i#qL77d$!QwRfB
zjPExr#_&CvgZ%{ga)SAan~FEHU=!feYil{5a23;Ws`2#6+?1JMg~alXaWPy>$Uei8
zZv}w#Gy8Wo9nDC~t`I4d_75RaYLD+tT4YjVd|kxOVPN*O{7)0t>&I)1GkPvwi!A5$
z$<F+~uU8CSV9r_6HteVxE^a!v-IHTbK`Hmo-A>`M$C!pVPnC1@A1-Uq?wZQ3&H(|{
zR_f0w&{H@kE)+S-aV3toSW42944A*Cs5ccshMqaH3%ze|AXl?nTR{D6Ko-d@)SNF>
znf=oli#u{k`hF)TOm%z@feU<X?XVTkXY4AZLUZ6Le-I+Jn+0=n=(dVHCRVO3D^wBx
z-PTP$qjIfU^7uguzQ*Lf?S%Jw%?weT<?9DGi`1&S5^o%jd7(@XD5$3s)o4oJ9Fvq6
zh=D8!0(KT?D!|&2&PR;NX}OHrA*gQPlbnh;lW%aDv%t%7eoPPQan8cWJo{SW_P}sd
z1UF^`0Xu4LtQYpRW9h-C@tIu|K2;z^D6=U>e4;7peDGPQ`JLvJzeRcrMwHu1FIwL`
zG*e`vZAW9(Pp~!O{Z9K6MV$h!Ig3B1s<cR4xj;Wc;m5gSUb9tRCb~dD9Idhh(*v-g
z*_o~e`(<Qb0ag1>u!j!kiq3Yjti8Ub?eNCJC+nTmMVHuybp*wxxKUIaG5^SnN&+es
zktPtIJg|$q$3q62QUQ;#wP&Znj!ciM^=oCTU{sK<2x}M{6qwr!nCG$%4>7oX-Og7U
z%qsHb60&v1Ipy%`p&@cSO|)r3SAzRnsRodQ0;acCgt0w&vHdY@oW4QQf6X7JodU=Z
zf}rCV-P|$2$Er;eYvCFJWPreYYAJ6zxks~&6TxSb+Q2$2a_@ZO)~(!nUwbE?%!MD0
zn^kq&an^;DWouVZ2Ryq7D)rS;f%`jZph9y1Xkx5?zW<4Ni&IBR$jpMBn=+i+!uej?
zX?t%owCpuDI^qA=aC_I8{6y-t-rRD3{tu1!@IRo<Ug6)sFV_Anj1Y9;8C@fj{<4|V
z295hS-TOMp<d`mR51AWp+sfrU>(vD3=jq3p3*)(HXW%0;fdywc+yXTJDk9F{%`km#
z)KBbZ=e$&IcyzG$Qc2>KwWud}7n8hLe00(-(zhcRxtpU5ha>bj8*D>M#5ZO_tuz~<
z63yrv;UKRp`Ji<~j1nhh5o@hE6R9Tay5i_MP{_Hm25n(kJ)*}0F+68FMv9fm4n~X>
zQOLp(jL&5!7IzuZMZsXy+NTCiiZSBM-T+5hdVkw5Y4_BlA>XVCHw`h$x?gM>Vr45c
ze0VoADLrcHrjd-a#9&c_?l!@PP64|e(rc&&SV+H(OoNePO4S^?t{cO~-D}xW?79%0
z+|DgF6Vcnx$@|gCs<$1V=LZyzwQzeeQB7=g{^!H5)5g841M3>^X7I-^Jj2h+Y0J8m
z*nRC6fV(FBugu>z#tmLhbJ`WB8SVv6mcc?6hlh_R94=PY-?zs$oBxztjNysaPP0}-
zjILmH+GwDzTkUT1=3zzP@(3O4Mdb1bVbmKi@J7_mHC9g3s}#I*bUst5EqsGsOMS?<
zvfHh0({p<(l*Sr&plwa<!E7(E@VRn35ZFs+Hj}>e*N-D}gS^tb%V~R)y>~U;%Ht0)
z1w!lpoJl5E9qh;Qvl0Y)h4+I*jIkGE!S-{FqB$^V?)UO^Bc(29!;4YJ<p1_x0`3e#
z%I^QizdiUL{%zd<@o$Uk^PvG`KNws?Cpm3eArz|z6Ho5%&odKO<_&l}T^`Z)0GPJ_
z!@w>2W#C!@jQ^K`8xTk!tK{`j0T~;E7*qFO2Cn$WQCqW{Ve=57Tuh8y)v##jbSijt
z>hxeY87~i~hlsruUaw7arpsEHDz;X$`)g|_{WE1X9visns2<Hxlm+yBw7J`l*;(M6
z%*NnOt5yIxNME-akYDg=ConrYF_bR8_UOnWkW(6kAKBxh%DRo&nF15>f~3MV|2~ui
zXP{p%H+OWHLZ5U}W23-IG~Awdtbfjms%{U5dO7vWo_VIxl0d>hVYzS2@Nr<HisG<x
z411_hWp{){5gWMm7hWO}q|KhFLs5y4ap*#i_9+wlow@Fe27lpcL1aj%C(umA_)rv7
z^1p~_5(-UUOHQ%?p=awWypJA}t^%FB4BOn+m%pEgMTXZdeaM%^I+~ovhwY|jmd96y
z{lOAdj>qC@cW|)DMv_uDN@+e}Wd%>~BwwR{GV9g_Qc3{HFVb?J&rrd^%+AuZdpg$B
z(o}`fn?E_MMq?JDP73k}L_!?A9T$Faz*X=vAM^day=Pq=PintShKg^{Y1g$6?IJ%P
zKmN&4E2|O{Kg=SnW@{h5iqdQ!iAi0|6j9(S4UnCN-<qLPA4InX@aT)@uk$A-1YANb
zD6EE$z;{@g3w&=vB!Lg!K#_O}lS)w9-^J#Siqc3hds?IWtgqR%{{-kY{ed-C!3NN6
ze1LSH0V6h}qrn}TK1zyTB6RxG77tv2G+pUIzOJyo44|S`FUyf$22s)~tQ6+Yz16Nt
zfNP%;ECkKPHZ(hL0IIMsC@c}A9H}O@lVHt+#<$3Q@z$i_?M$YKichUM!C0@N8aAkT
zV1@@p&na@V^(ZtG4ez9q+&UY>9fQJK!cNTfFrS#RF|$82(4&{=&^DM!ZX%G3qvs5)
zfSAKRaTrXXQjrn;m*<M-Q7{3|_qjy)oi}u&$Sa*Pm}+Dayrn7c%Ei+g<OzPsIe!Ni
zODle!$^dH(1;Z5>0_(X%;1mmt(bOoYBnnHoIrKg4rA&#JiLNye$|PL%l~aZVWjpQT
zpmp4_?X|$0AxZ3Q`#=Z5_TE<6V{Z6XZiiXs&Is>aoSzlWt#f2e3xVkJ(=V2eRGFiz
zD4l@L0+c-7BqV7Q1ij{Aok;kQ0UqduU={cTum$Q7yC-TD9f5#0Xj(<%D}3Jq(w*r5
zEIR#B&N;!#4%wT8hs>r_EyyT~6mF>i)02WiwD-Qk$2TEDPRuqBBk$YvMX?kx>tHCZ
zjN{~kf$-lrcJOCiK7yhaN9iOkSq8M~(Wxy{Fn-v|y@lX(n7a7mamlJu8kr<MvN-(J
zKzj?guss8S&PVccdCmL+S-RHS<Wr#xhDFs*T0Nj$nYc=eEDFzQz)dXO%}Ww4gL<LU
z!wScIW$d?Fd*>pb&87>8o-Z9W=a7b%to4Ml+(tLhYKTD0M!V}2!8a+>v;U1PibX&W
zBJibfTStsCOQ+Nus8o@|i%Pg!zROQi%nL>W6;vYZ(M{ct7$bCa^#Ra6S29_ZA`8z+
z6;vyR2<K%KZc*7TZTaqaw*UH^0u0QH5v;(s(_L2@VEb@F&mgTqCfI#-KHoos{Hl2k
z7!>TT5vsrm{1vj+lj6|S1U$aGf)R%AR~I-xJzn~<c#Y+jo(J5ZJcQr~L}|@LMVUSm
zqs=Jh78GV4?nN<<VM%&0&iUZ4e<F<Q{VrqYhrgJ3Nx$?GT-oQxMPIC<8T5WypYHIu
zou2&Q@ouiX7k|Dm@g<E|^7y}>8bN0L5^S9nz}c|P!HSFUJ`H@lD(hhxJsI1i!=Nq6
ziQA?d?%88=^Z{l`zECOe-VktGyf_%JX4OSQxbQv%EeCR@Ez{^$aT!O)E(UAMIUY}+
zi#-Qtm$AS~|E)s})|SzJN=^uB?&gyY8YW{SzjIGa*EWG-XhmY7T@dG@v>1vEVrjhT
z#z0CsAuWWa!AA5m4O`hJ=w$dqc1`~KeuPr!6Que)i_5$Rv8u>>1U(=%LYDxQs^of!
z+4&S)89Q5^@8=DREg~UaR=a#VA4mMG6U>-H<zz_in8T(LJin=32;NbLl~j6Q&M$(X
zu@IPcjNQRwjTMQsSb5KS?<fyp&ch+qeByXlkmHE>@(%Z1QjI~H>*eROq!csp&?~}6
zU8b<xLAMesW++cRwG?Bs%fEn>iU+Fq26DVCp~pm@z1nRDLHu-u##L32Bke(z=-`^!
zP*Ogue`?viB$(wmf4M{R|G8i$w^N#+l-cqStalWDMbX>3C9Ku7-<qr#TK%;qHQLQ8
zhcq>x4fik?6~P8?#gnBo#P04xI=h4QYCV9M*7G~Ak)kE|o<?yu2kAt@(;woFQtYXj
zq_n7ZsLt`p73zhS!CbG%*T%nCl}K#ME;(mrP+K+9&OaFTKHN?p7H;5rc74N`X~Xk%
zFvdQ1t>ls(Mi~QDMAD<0xfkCM5_k8`9io_N*2}xv3a%BTj2uzF_cB$`^Gl{yCcVgl
zR7=1$Y1pa)b{)=1r|Y%}N&7-fTC&Np?`DEW%{8@uQqO!0ljt<@^cFDItA@z(K!k1U
z#%_<D{w<(GH4c@ycfdnS0&ix;*NeFk?mVOI?Tk%oqO~s*`1#xIrswIk#aZq-J`nM?
zw<!nyv$cGKi?i$9yd%}H(P!EN$Xe!TAy_)6cZd{p-+X?&g^a6-JDq50A(J1;{*F+H
z<*$jR+AwIqc@<Oplx_lLOvi!7*iSB^a`CL!*`U`6)l<@fgZ`)-&u?`yc%;<p)~b+F
zHRyCmIF5~yZ^SAZ;(qd;Z}sv)<Jjw_FG`%cb%zRIQRq^k`6RJ`zV7cvr+Ml0rM5^M
z`1T73$w_6Ism(nI11&ZNzvAHL1ep?OVZxs7S|ccJ56nx;gRiSz9$9=Mbmdp3Bi}25
z^YyZPsWT@DUREL2p}~=O+KVw3D32AbcEh6HwR>cMJq<nHoLt%C(=|m~CX?sfCgbVI
z_7UdTik(>}3<F~!k=T$(+0`<5)Oj1kDgPGXBmI)2`^c!kf1g_ZVQz7|+4bA|@Z;I?
zc$N8iF!T1m_e@4XpNAykH;@D*kNJsdVKOUGroS^XEbHonE7<}p?ZV2(zcZ!7wT^i6
zMt<0{Gt@ghM|n_w`M2LObCAbmZ+&O%tQRPdG!@1~z9X9&NqC6F2Grx5rB|=x;F+A*
z0<l>DFpD-qyR|vd!Ye^~2u8Iqj^q|^OkCl$A)EcFS+vs674|1?y-cpy8<7GVd%n;!
z+0^<p)AZ_phqc6XnyP>GW2l5%0y;K2bxeo##-yX3(h9b*S@ACad-*~c$8|#Z%O*jf
zSKi%*4tgfVYy$7hR6K@oTHc$;lG07=kh&w4tR@^iRw<~`#7&dL4oU%8g;?g};r|1b
zKx)4}w6}l7P{rgU6)`L_PRm0!XL@(D$E}$)AWs!m@EK+Vb$n7?PAB0a3p6k>`DB`K
z7B{@&iH63U35_mRyb#v&(K>rrA+_)2SUu?~q4EF`Wn9NH0YfbO!)y@wZA|hRI<laX
z%2d?{N`T4820c~75a(JXl<dl4e1t%nN);SIO5QF2n@%?wbrct*&Fx#Uijflzi7sgN
zCnPBevj!zLNbub$u~jDY^?Z_FsqEl19k?f^S7|y@j-SSH%hVB+3-D~#{fJu9XFN+-
zUpJL`cBn7X(OH@le=!(cubw+b_lo}Dg$Lw*5>+Q&!)xd=;j3(#qo%N!(;C|2A++Y$
zAr$>IhDEmehlD{j{3%+yz(^c_wp5gY-ocsyZ;%<SxerOxsb4hhe@d@gSfoSu9!IuU
z1Eo!x!Hjn9cc!$9v78<(U9h%B!F+&6rfWTWtchUtir+8>FIq!r#L_>4X+N1JZ>E#_
zLYNW~DQAxP@bqDdOZdJcTZ;X3R6m^pp!=?|gIX7w6E<n5Q<MT;NE_hGdo|U?8or<-
zxLBoC(QVBCVWn0@n>uUybnn>gWnlP#LZPBZlhZO)1u+S9RIyaK!T^aWqINbWVJCA$
zF7endGW58+*ywU~M~wvXyEwn-d1oVqIdoFc=Y>kadCjogtlw2<l%r$#7xZYlWbln_
z@YPBPjW}vmhE_SnWnmOC3IkPbnBFgYz&%(%U{HMsSwD0(>n|8x!2(+@oW$JYf+qkS
zfZfflenC8h;U+@T?vU(cFiDdhrWyp{BN@PMh?sCO?ci@U&SnUFTl10UawYlY$m#w}
zlG2e+I=qSjl#~2gOj@=sp9ly|gpSPx(>=+=b}?Ol#`CfZso}3e&bQoOTwN^wN<j}#
z#fD(&R3va$U)k%1Sup{_|BC6%qhnf8Sf*z(UFo50LtE=<4Yx%wW9rtWi}smUb8hLq
z@OchNnCBDWUWo=Tp1ZXVcY5p3E~f9cR2YBxk&f_(Ke2yUG5(`}!~VsJXAPwvPf{XM
zJ*m{C-@*h#{LE~k0An9`Y%4DivuzyJp^_+)voPT3P<*nPvq7;G<Nr%#f=LO0?%i4n
z&Qy(iWIht)y!SVspYHwCJZTH7GD;KjoqYm~gaW<*2f0Xrz5=OxEz8tw6ROXi{Pr95
z)+&xuq2jfk&Xd3((8-h3N}on*w>A*hEd!J^c)~BfI_b0yTPTciZ7PisrlU~1$NnwE
zoC+YXdQsCSeuBb%*A#;>$V%`g7L(6LM-oesK4G*@mKwB@BfCggI>wstxD;+Lxh89F
zgb}}hez?q}HkdvgOU4F48|)?J=~32FRo|OE>lI+JRq-*yjHVmT(Nb$xhpWtQ5vgBu
zSEkT_t%3G~Xw3zIF}H0p53D$E#K=L`Gd0nRp-%Pbg*hls0>d<GN?xe^xh~~Ub1S19
zA)<{{z;P2-sgb6HlA8XZlI^itN14c$&jrkKAk^GrYlV?jfY~P(Ve+Q$gE&z*6<Jj$
zPa<`a^iOM%#g-8_yH<yG>iMEY5w%fFm5>=KA<t`4TZN(#fT}<9O2z8cSqGJU5h{n<
z9gsVE8Ui6_w$=9m618y-xF=z2l;v24A8iO&)f^sMKg&(29w{muz*S@M9Brt(_*Vd8
zmv1=L!&({0R?>|U!t1{5i(SoN%{xbt^$8Ng-`#S9)<l<@rNG7T3Th`>1*;;bx>B`<
zJ+W9nqIWw5{;aCt3rb*);dFvB>Rf`XPs!4WPU-HfomF{;;h<yAr=;6W$5YCw<RFwr
zA_sm>2`y=XQ1&x7nR}GLW=g6{Y1>2!Z`%{=ljFWr5=jPTX=+-EColtgcl_L|+}lu(
zR3lI|xwfy|#WdODx;yUe#Z=qL5mh}CLE9c@HWouvGSE>Y_#8cntofZxu9u%8`w>_;
zZ!uo}l<&BQ!vU@H=tr}XM?TQsFi4B&Fe;|$n3edUJ>Jk)X~UGErWER^*ukrovVJKo
zl}-dskt%tBf?27p-Eft%Qp!3-G)oTGE5sU@O9ppV3SkoVgkx99mkaG^tWm-OIipmi
zpH?b2F~rrEn(+lkno-OZRYDkJeekjhP^=ypHA3YJbipJ_@ma)ji33iPZE}`OfZ0rq
z8O)ZZBs`6JC+%E<W1kO{7A%&jWF{I3V|u3%LE%$$xYpQ`(UsZ^O-1<>oqfy}kXdR-
z)q*%!5DNg{JgI8mmB|=>M!H6Aic-_0B~$1ql8HphsG=U%<&R0+)+YgfAKA!H6YbCf
z(EDfvlP4zPHLS!^2s+Dw&7v0^@_2g=1FZ-<)!wX)Kn}ih$K!MS^putYtOtm&HUj3P
zmzMHE3&I+j2NZnOuquLhbZllE#3`qU(Ny1(hI>=#R=v47Ij}iTrNdPKqvmP@>ozI2
zE@Xy*dzrkm+rAH7Ek11z)d*c*cQ=zDDm!2mzBXACd#NqN1ZMKshW2X;l^0o#XpahW
z6hbifK)*V%At*pd{UsVLsOO)>+mF*t*Pr1ZrQFjm<$CA($zp{Lv%%_v!Y<+&>Xfiz
z6H4#UJ*6(Yqc2y@wYfv8iD(cu6bLWgKlb;{eN4*;wGo6{U$5u@ANo5_P*JBNu*Y)|
z&0_&W7-m?NJxnO5YAA?|!_8BsO;;EBK)7@Co(S<y%;|Y&ot<snnbsedmS92JJe;E<
z@mFN&Jn&;^le^5<6z!eM(yWD;qXdnK+-jQJ8okcY`-E7y!qFpp9;4Gs!R+&NN?E`9
zz2v%fXL@O8`IC`qwVEELKE2$SUUp!FI*{nCt@_;>{{j&0ZqhGCMMEf$S9Nh0>zqxK
zm1t<qk0WY1%`Omk)dYPYFz$5{>HB+2DtdVGZ-e=OVoIt2=`a11z&dARtbN0GmI*O0
zRDk(pHX3CDG>Un(?x+}6QQs(CUJhiPi)>ifMKL`+)-#Lxsr$!l8l_u6<ym?2l*j5w
zT`Q^WmMfIYpSD|kQ{KA!G=gWYgcTZaooDlm7GxE2c03|guTC{B%?*qdTS=l$!dx4`
zSMzbak)$GqX(;9n{>4q=aCvm)Na%nfM}av=4C&m6-l76YIqYXrL%OiMV1`+*H%M87
zXV^zhqzhN_5Tkju#t&V%Y=1JR>I#LEE3YvW$<9!}$oUo~APYzqWX-si0+5Xc9Bag2
zwIE8Hif_-xJrwYbN!D5c?kX1l0j5LAgubbHHqFsJtV_b?Fgu@6og2FOUNw+vyxL}M
z8+p+Y(+Q`75(SY@PL&oO$7sWzX-#G|Vl(x0F;JiV-CobGFDAF}6p!^Zpufgmu$Zzw
zR+a&WzXFx8mF&WjQDt+vJ>mW1<O*hiZ`moki7Vt9=wao7SOI@d26**yZFM9|E*10y
zr~}~Y2EdmOF!3wyD7qXzDx(2BW%U8i74^+llI#MhFG(>>234Y23ln&$OulCmt?0&$
zh#5JE_b1<lLK^fl;g6_S@;k^<;D)&1&oyOJs>E8Vgw@L?X?F_P0s=6JGS;wUYT}eP
zjNzR0B%?!(sXBU`V1g5tpl(-dsC-?dl;i=Ljg~9r=NH;m_!<wdt-VFdCG0G>)#>eJ
zFWbZbw_s4XM{r|#SLJ?EUXHY{G=)M9-RiTTD13z^uqCaUC8{zNThS(Qy0pgmc!v3~
zdMu9#g;7mpQKV9kU#!Ap8}9I^_yEMgfi$S(eYXY_Qlw;*$-pZA6PJTxcOP4Talz>y
zw4kkD&KzA<#L_+vo<Z{~+wbh6NdbARL~SfBuggG-jExMm5R(`W+d3*ElxEE`>UbOH
zFn=}f@u}|&5l4FYh66|DJJwrOr#i6fjgqRE`PQJ`Rw;>`%ssRY1lWd}e2biyoi&h{
zK8_6zfuJ`Va;6y85TY^w&1)D!uR7xFJVNZrix_JrP(pc<OtI86Y9<k_XbxE_NpiYf
z$s@uY(Yt-jDMoK-7+y@}NP4z{A0y52Mvo$GJCwjaIm*60l<9HZYNW*&ZS#Fc8}{DV
za_wI+s>xuUvh<>~pmw93PW{tERM23B5DSsHgz%e6N3zE<jJenV|BgVgCvPpH`0i~N
zlXq@1>8V6-D2Fn6&vc%AA5krW)UcarO2C(U(S@77dl94NOey22iS)+x>2!fUN{WL%
zV>IHZC)YLk$k*!3q#5O^x`dcFp=>ZtsU*V>a|fSwTgQ<mE<i<Rp9H#U(@vlv=FaK$
z>?5&ZRTxlcO8O~XX`oP-1>c6S=x%By4X<Pr?pR(;ickoz;3|RUFbJ+t=1Or23Gv`F
zbV;2&5%2$;{3U>`H990dz?RdX5V;&v`KjYi`VP8iV^zhEdq;KL2hI@1lF;B<8?01U
z@&Y>TW%;b&3AChBsnto&=%bG;fKu`<^01$cXya5*l$lYS6t(u4f@ABkQWaAEEcFBz
zE{`bh;)R|RdJtlgGPPq0HDJ>;!UWkhjZ9`kumuL!N|QUPuTWU2Inyr`11CswG{IkL
zbrL(#vj)vNR(2^1m!t|RXL>U^kP4svlnS8InIY|NnKaNzHVO1ue8C#NL=I}1Tn0MN
zrZa@!2ht)bhN|`LDyjrSQJlpD<50rPgaD~b3e@?TbN(OS>}cBL7%m<D_fcee<K1kh
znDtGPX%0EBrlBLcJnkq|A6M<Zly|Rdnt3`Jz-g!f>H?dZko_Q)0xob>lX#c1gD=4!
zIA-I#Xv<n203|QG45xt@bYdIjba(`;Mneftdu6Wd0+rQx!e6CEk3jdQ&6<_eVMZa|
zaFk?acIPIn9o^7nB`4ps^pv7+mCbhRu}Ftcs2CP~cSCPki*}*4qtqm%A-yoFWoaWk
zgrikvIF;0ptYf(-X@{j!$<wD7tff_MJD6+}7%D2Tp}0zE60D|$KI(*54)>?k*Axg8
zsGWqv^Nh>UwPrPjoeFBI>EziabNf>Pu(_R)l<neZsaqk-vi%p8)vR3dUD=NHwZX@~
zmws{96w+?vN6`Gj(~7&jX>9SEU8F$>nYSzLQ&q|~!bijtye#{q%mjo`>Q#@p#qt)C
zdgb<nUYRrE@9~DS4cnq&uxmN%K^$(+Ax;6G@qnYUOV%#9aOoCG3Tj@DEEP<}a?C*x
zBdl`OqfCC?>5Oz=lN9MOxmm2K3pBPkElZciau>Twd%xP(q9_*ZBZ<Ia=+`I~k`Aq1
z^_ooun&lxa326}7BbKvdqf{RKKZV?<(h1S)TK)e?DC^YGpz!KYgGT~_N!n;}3z@ZX
zaY<8AspVl;CHBX=N;MZJS0<`Hr|d<pD|-XJ>OffD40(rQLxD?SsGp_%oTN(GAt&dx
zl6}{rx3ZJ2(VO_vWQuvs#r7<@tw~eM>Qk+&aaadpLpC-xSThuDZbtjLwG4tTwWr4(
zVlytpnn@IpC8Li8E501yO<CKc!-T|L5nIJ7Se6~@NzWJ3Y6(9P9DBjs!w4j=<GWAR
zdAGHIr1BGq_L<6I1(ieAtiI@|8$IwZARwsWyKJ;|wmVl2Q(7WoC~+F3gx<L&(vQW4
zfw+PWS1OZIpl5>F>P5OLxB7;z)f0xF<2S8&C|mt~Vfk9w6?Up_wW?dpy0sWa`|KJ|
zq>lo&ZSrJ$q3!`On7A{&kd4BX)esD4N%v#D#yh5&4%hD}GtxHBujCi4b50>omN7q;
zMNf>^J@AOyv;G-9b-6R24aMv5mF+V@_1t8#*c*&;C)#=N;NF9}@SEys&GIF$dp*?n
zzBPKG_jR*F<$Nhs+#JuYlDApJv@Bv)Dwq@nK%Wb_P-gU3B{TZ(&aN5HcXjEAI~oR{
zB;AYDG8xE*%2X7<WJYxNu4itDf#auO*|sSn%_0HHC_+36O7P;Ot+^D!S=ilUxyj02
z$of!96W@v6M*Uc87i}|js71qRA(nkUavsrh<yW8Lm9<!k>+>YAxGY_vo`RwR>H#SV
zAx5L>>VI=RvOhzx(r5UeCRcq`0cu%h{qwnSN60nrI6tcbn~XZ?w0rS0ay``uR91sr
zC?sJZY7~r1nrCS6qujEj?m|dDG7~}76`CE-(+SYX5nFkqo%_)luqfg*C(3_JVokK2
z)K8QZOl9uYcMU}pqtX66LxmK22*m8zEXMqPdc`P<b=}j+6b%TUDEav`KTnZ2WzG&+
zO1RA6*1`K(+2}c(K?jw^$aS8Jc9eRxR>Eu)=~xtBZ?BU$7#;TPj368{@x4lEjI5*e
zI$J$VO@a)a0uoZziKU&4oB|)!IfXfERXO}~mi2lt0n37~>WsQz)kb(~hYq!H(2WO(
z?7y0vZ+JHiGd5-x?{?nDksBiA6f9TG$We(Lcj}(^)nm6|!+11_6QS2&+i7408L0;M
zN<%fmL*2KXr$R$La2oJX>Xv#dH^-rFj`q%CHl!H$lw$2g*v-&4gd5q>UG#%eI4jQ(
z*=MZ{hYmNQ=O9y(bHyWRuHHK4dJ#|Q^_uw)bl#}nh5v5TfA7_?&ad|_aphNuQOHv)
z06AXEdf2e1F_Yy$GHBG;m{%7uj60+v1Ex72`3;AEGa2oool*un0_WYQ2K*mfSIZZY
z=Ed>B76<B+9Bzc@Z8ACs0wFX<ft(!HY}J*ZYwf@AOFg<95zwM1PonJx3oWXJ^?M{y
z;On;6sI;Sh{zIBSdlqfqub0~JLu;&ib!X`Bt&!KF?VSgU25Bra$hJGkeRq(?!i9Wa
z9;395Mm=yp;Zx1uv=m8HG3M$ApSyA!BasRiYw>53`xX9Je}-`~iVV;XhRLvgR2Fv~
zT|~dqwcxc>!m+u0`FFg;o26&6WNcEs<TeabT6Pp%w%o%Gob-D2gx#dBS%{g$*tJ?2
zrV84871SDjacc(#6<*g`+QU?mvI#^eE%<vLzou*12;2!2xSTEXykN^O<MP9*W}MU;
z^a(SJl*}xkldV)Y^DFiR|Fm>1hP!nYv({2We(5$Op6UBaNwrlV@EJulk!8VXCMNuL
zSeNadm#uK4^4>Szms<wwjjNBPX?EUO2v&7KEqU8a*_uUgbhiudWLNR%)=Pov?pEII
z0$oAzo?68|S0nU_h+WQ*6|(kcjZEdHES@NyBuYbT(o5CX%Vf!#XGnoy(JE;b7VLv!
zh9ws}q%2HcNU~Y-#D_^x`KXKRKO4?H<E67Lu_=M0U46ElTa86_TAeWw5QLJ56FMrN
z9$P`Jyo66#yUi(_bXE*`k#bsCMb65KP`C(=sVNE6<r~x1Zec|vtrKt*Z5M_+M_V2x
zG{G<F4b%jmr4p!WZ>i|=;E4(ZD2;NX7|cfOm8V>dxBMfe!xggLr}aiK&czOd0G@_-
z<n#dGRjWte2{;D%v_N>QJMHVf4lN}H42iiHS^Z-v*oC_?ZQe(Zg7mTc@gi3)99pL|
z9QxK46!wW=3El_`ckOrF36>*$E&^dv%gsiMP>1;yQaH9{CFq*#gw(N(P29yJR*x%L
zgRIdMlxqm@IVF!#r!i!|)^3hybtA9;A{nJD1d&5iLG`?pW09+ermA23I;T@MgAp2P
z+AOEbT%3F+EfZ}>6IG!olFm%rk@_(u{+1^|xGF6l8)c473wTI*aeciW8qZQ;g`z16
z@`^5eg#w*2A%&=up&&Q{J5LU2o{CI1W#*>FAfy9N?XK*II^&=OM}C!dXBCsbkrqV7
zhK71UXKxc2VN$KA2wHquyQ`ZRi$2JzQ^AO{oaA+^;b`*FipR5^>A=z=+up2Fjt|=9
z(P}R(R!OZx+MAq|KPWWAawn7IT6u9XIai&tiI^Ku4p#~_p`sAtB82q<Q!FGWpt07;
z4tl(0x@6-O8a0bT`OvHV6~h+b#{l7jp4`{oX)4rlvr9~B{II>uOpt6wMLJ7xkhuZZ
zLwRpftE#D5Mpg=FhOdEkYI0)a%rG(*)o*?F$K)y+)(R$y<dA*?IM5;=vFXANJf=AG
zauE2`w_H;Vm089UBqiXrvN9&od7k&2Y_{4bE7dk}h7c1wqDgKi0I(H4c`I5O>J&&6
z+Y%~^^dj*H%tnmPAF~k!cbHniIa%{16ELq8PG>RAx~7b&8&-`z+~~NA^$JzETZuEN
z3o>%YNIwttj5hp=hU)b;Op!J00h8xi52Mtb*J#hfmc$Qa#h_DzB_S=m$$IFb49jk4
zBJIA)@mBPH1KVxOFF%Hx3pPK+NWfw8$-N-GG)wRpF{y&ZdZHFY|A?e154k(l0X(BN
z7>e%uC--tUx(s9HQ7aB)42d*yp6awz>f`8fNhepqyE&Xd72k)S5-0BX7STTv>sH~+
zza2eNnhp!nzKYmDpP~u5$7d1A8un{X%JIuq=BYscPN1`b`kSo#(OmvSsO?Z92^SUK
zKZrnCfZtkxNW>W_wt@nWt#eOYle%|+iRmXs@ya*9pseh(f(s%RG6QDAeY8*~BT#LG
zQo&g%$`oI)(KWdENUG235Sp|w&cOC(jgu$v9nXQyz1c)DVOGGVBMVqTPHtzCl!3}%
zbFd|)(vqGzg$&O|(!BzGpqO5i6v|SzK`P*7w-I_Dw1X--BX~&;Tsa}^Yl#8XIn|4n
z*l}1<cQ%=DTnzdmVW4UPa;Xa2=g8QyoUo=`(j)*wDgk?<5;HQq2-=fiM;Ce$7Cj+Q
zDNufx4aYcT<#DtT>Zitqo|Ex71%`kwwDVm1Z=Ge7xr&0P#aXQcas~Fx$Ww9_!@9rB
zljd%q@Cz5S`Mrbz)>J+y(N4dMTY6+~TA!>H$a^_-Kz$s!J+k^$-XmVB2RiVx5hoDL
z&aGpwQ62G@b_ZZfk;DF>&|J8%R_L#oz^$$rDOIeUGU;)l=m+JU@x71A*sVxaNV`Z8
zEsB%@JRjf@GC#QYd+Ft6$Y#}S!ir2!)mWvhoZpEk(#x&|>O;FXV4>0XZxYI>(#SAt
zIzm=4^jVW#51Da;?R#{$`fds815c}Tz!d_i{ozZcQi+U(>4Z~ysy0^ToTcBF*Zf+#
zSk$s)cN@XIcXXF(3`>@!f)*ds0PkuP1#gaiR(rDhrllNx2UxB|r*R?<iz-Nvek#FR
z1Q}zeP>IjytEi8#59|=jU})*u>PDsBQP*pk=Y}_dW(---<CrbhP!xtsQ7RP*feJLR
zy{|PWC@qz`ez*rCAXvG9_>wTTU+j$E<+|)r&4wgbV<5(9Cui9pBi9Xp7I!pBk#EIl
zIdsZphYJT%60d$m!R9G$OGXk8rQ_<6qvpyW!`!GVLW^Z5h_p%;kEzLy1^s2y*_0Dx
z9qNNf#E@1|uw<_0Eo&la2QIjTxD?Fk#crY$NJs7`C?1nLGcT#EoD#^=B-uqo!ro9L
z1@9HZ9B=JJS?SeAJJWFhO?2R|y|fSOk6t!UUhKAxJBO#QJ54OC(QHSJ2LbK!izJ(r
zHO%3VDcGxbfsWsMJgb(~j4{)Qda-mA2Rbr-fJW%{JE+s<$ua*mow%G1Ir|J?7j<wZ
z$incB71$;mr1lE8UJqm^-H6(`>PmU2qp}f4j+wm_qCTC>g2crnMo>X{+}kzfL2#n2
zgGvvr;-TP3%Qa6xY%A)^7K3_VZ`ijE@sX5=EdANkQ|&eT&@l~t;dn|@gd}=e0M_kl
z<pL59id(#xPREZnH_s=@_yRQx#WcbAz1~LJn{EDAk;2gFWD{P$NV*@3jf?4U@YiGR
z^i49soB;zXRLxJ)dg)aexD4wA@b24twR_xo-a0XvS1;KO0-Z$2>xUI<XQ?TswH*}Y
zNih7ct<wWbryA92AZh|912>Xa#F1Y3kEc?6^U0H_uq5M4yvJ&n=w(sxU4|t=f1}^1
zDg5?d^kd*^yHq<u>H?5%I4*Q1sWF%>NGai4iP=aj<*iZ23Lil?n<N<3<(&XyRn!11
zQqq6JsX-l;Mtv*4Kc^4@Iif&e5_U!>RoWsdw_SG?hdNCU5>b_-#~4hxU>5~YI_XHF
zh~k)K93BIwM4KrU!Z_IZ)0E~(gWs#OOQ3T#OCJEjt=Juz?E$EMo2Egnr`9`jN^cEm
z@o@|%(n0E>2UilPI73d@u#vLX&Y27?;FZx`+kqc;dZ5A`U^p90voQvTWW!YJG|`=k
z-P9EAG5JJP+75Dw*NWrS{%94(q}!cy32|J5a*1EXSZ+=vtKU)X;C_q~cCy+_=@rTG
zs@_o(e0B6Tf>ZnU==i6$4SKUTMx}`{QNYXcX+67+-ef7>#fLc%oQqk;84d8|A#pUl
zG!dr3#EEN+r9E(ijnIxVVFx%;R};-UVdZ*kXVB5zDb0oSIl{nYI5P}deBaUpOB=TI
z69McAqh>uNe^u#RrF?-~9y?V|so1U4iwUmL3@0#_KpD<CP>ZU&I1FYvdno6E@7ZN>
z%myGDXoM2okDb7ZE?K(qf^`aYh#D=yPJ|kBt|_X2lqqi7ipC?=y?6$z+CKCrZ4YI*
z8qf450AMIi4Qpzt(}oV}HFAl@Ibd%2^#;CNyCU|0f8Yc}H2*0fPw`RPR4@_@h)yaA
zrIL?ESygaxIIR=Aqza7ALC4`$1C<Vg65%_?lM@jsra)<CtW8qsz8gESnIRw1nl1oX
zj~eh{Ly`kej@TRdJ8v;6FlU8b1LQyYm;jCN%uY9(&!zxv-c8g#0<)_VI=y|hdlJ3c
zee<Sy*v1lJSVW8~^<rr`EW*}0q?P|@k`8(E!5U3)%rtRBZQeQB&8~T`GES+h$s8MS
zh!4kfvBb|mB87|sC{S|>*t)i}Hp;EZRE@a%h#g7g1U4F5Td3L6P$saN)TrLB07tN+
zceA`GrKVHo3vg)XzGJ#eO}0)N@Jccq!%K~Z*-?D1WEQ;s@-r$oNzTY;EZT^C_T!JZ
z1f35`>M62eL}irYq-d$Cn{v$-SPM#`roE+j;R0S9>4U~OPYF^=YbhxbEp}R9^8DK9
zFKjYP=tb8^tbwa;!VwTQiYY>Vl~axpg31<^f(-F2;*FYF5+HBSIl}8KJ3mK3tu@uq
zRT@2OZp_i}5QPr<UBy+dM&hKOj)W#-zA^=3iVYrJOT|l|Nq8P@-2f4A#<If7!80D9
z=0d@#oei@=GEtU6Zym)2$e+NnF|S8a5;mqAwJWi2I|!8TN#~q|CNv-_J-xt~E}E3V
zckGo${GRRr!u~p&Q`O8Bqckv!pd`~AJInbLwVt2uCdOypV>>1B70OZ>zHTihW+nC(
zo;n0I9lx3|px6@`BXl8F7p3Z=zvfzY3O}Z4LHZKsqI|pCI>8L5zZ{(c<@&i9t)09*
zT4So!j`mNFu{`2&^VM$q6@0rbZ~c-MQZp4fi^)vIi0d0rapm@@kd*d}?0Dn}byA*}
zRuy8(^}=43x(O6-FcK3Bo1S!B^v1kf#PAi3t%mZYp=^7kr%A|f!!l)2f<WAVylYfb
znrCgRuDYl-=xfOuW=)CM5WtLCH&vN`SgS$ICb?2@eLy5YNY}->LA2gnMl>;a97{D4
z&P@~JdN@F6WZ<SV-3ZiCik4lYYM;AUfwOJ1Np=vAh1C?RgdPZrbCL8d(Z%c>Q{h~K
zB#@kQZ5b{Gi7OdV2B}PJv66{xR=92ySkh6wPc@M7HZx3UrubVtBepc=N&#1?mfzKF
zIpl0_ly|<H+6I1}{H&NMCK5hrQm{!mg{ewCYjz(QvmXtDlQK=(qMQboDtJuU|J8kL
zWFpBsKv|+PK85T8qf-?b8P{<EBEB%~*?gbUXfo0DPYN=S(w|3Hm;hkrRPI_b_lvdB
zR2mRr@#I4D)7FteX^Rw)7s-SO$qcm_sN(41ji7EX$tWNbk-R+g{%ouhSz_iN4uE&{
z4O+HWt`Su(f}SR%vYqNst8v!)qlJy16PVR2%Cb7=MN`s?!lW%fRSX!If`Gj?6^lMc
zC))Z*6`&n-r9f|s#xlODwugjZxyU-%$YiKO&c#T%Y&&OX3Ka#3oKb=X11CqH7h+&S
zGpZsvjYep?g)Z|t(~+eP8sd}bmZ=-(CiQO)k;Ey-GEKZKqYsX*_NK0PsiyWJj_zRZ
zY+bxWeUmdh<x4L$@M349KyG@K>^*2Fa>nnKV%1e}x$S{&FB-Ge%|-|els}OhDe|&}
zt%Y5Ni5WsA3`}*NZM!QAbeGX@Pow`DZn+?DY0bd2Oah#@pOQZE(pK)-HZi*atMYs+
zBcp|zs*-+hnBN=k-RZqH8Fsgni=VpR=x%DLUzy1*C;KO_2En-K8N3h<J+UX}2YA>M
zv?p%uV*s)BBYay8`wizA>ul96kf02?B((3?oEWF~lO(SC&T}wd$x9e^!LFp7q4(O+
zDUAZms0H7UU;g4<S#oC@4&a^o1ZH>qMsAzR9a^|ci+8GGx4a!wyEczjpxo2N{WK|&
z6~qzgH$2b@HEKNeel1fO`rWs_m#B?3%{?XCGT?{~S~DXtPZ<`wsVap?1~zMwzbm-o
zp48xc{|D?$-SzGd#p&pa(l=sM7lu`}td}jltSZSqHzFmfF_pBZa*{B+E{u5hVmA7S
zn2hYPDLPIDajJDykhnwo8kJ{})PlO)mi%?anfP(LGvf_M5)0NOMLQmMxGRle0%umr
z$56F!teM)hU#dujk0Y!<bG!HQ19<_X;g@PbuFflj=q75si(*Kqs9~5xto8C4dVIN^
zY<e*>UJ*}EcZROr%+I+HtFB$H<E8Aw>J*PN^(j#xJqH1-P{qdFqAk^_I&@BcJyJ>Q
zr_-xQCAVy9yd%l1MsN&QiBWYMT~n{A#}=%s>P&{DL(Im*5N$kaa3R@Pi~o~UqcUsH
z>?*&?YRyZjoe%OeoG=#+s3Y#9&jKfz<0NFTJeGk{saUJ62;7sB3^#R6u)-KES1|l<
zg_Kdy>40-|$dm|)ta64^C+0wUn^SDZ57LV6+__~iH1q4=8ccS&+4PHD(VP8z(oN;v
z4lTQGcVBU=#i`odW5GQxAH9He*sBe3<kTzyiD%4SH`lDXa11k526vAF1WE@6iwvW)
zR=A9>-WP`4)9B#n@MY)q?%y<Ws~>Qc2d8!vQ#oKAJ1F~xn$URNI9hueZ7Y!3ah!$4
zFOg}4Qot1hN(-Inf-BnL*fJ8>8QmpC1#2i)Kc?5KcIuaMru8^tBa@x(Q4zd+EE*#=
zuV9tGWJqRBG0kCJjZmRN<4`ON9uPE6x@ncZ@hFqlq)VkRZTB)^Dq@c0jNDqK#<ttq
zD7~sXE;9y`3<8-d2Nn5=Vk?go^fkW<gokQY(kpe$yc}8Nd#XAyiJx^Y2Sq8DxO7x^
z!5fFP5h|l-sYrv$KJj_Uuy8&L^I@61)5M6Nz6lXoTStt(o{EuMD2o_sXG;0=6Kho@
zJ_zqy$gR}_v--H6r4`PtUyvM^e9rAa`6k};ZYpvwC!$G-SdmpuH-B8&s!?ingM#+X
zbSVZ-D#zQU+Wgz_snmMYZ|-Ns(y#KM`jCsS8rk9(<t(%A!%}iNaZk%eJrkbFhu@S7
zIJ*`@o<vp>ogGiob%0-2h&rVTBF~ILPqNu2s0!~nFA0ky_AFJfWJB2|OerDN@{CCE
zWroCq=U^?I-Wy?kB2qwa(i!a15y=XcE_9|ZYOBO2uHjLL$f=eo?4*GJV6tT61%kr~
zdHY^+WhdlLbf5J1aoT@={boAZ9rddB2w*jyPCU{b%rqB6|7gYOht#`YGi%`=NLy+C
zM(Z_)EE0{e*Sm;TG9Wd%oReeF>C%~1*kM07m9LkBaGne=g86=WHakB@1Ygi{eH~?Z
z<-$z2X!~UMq}}<sxp#8VJd7S}-6GCf#69#220o*BHLZ0ol1a37HtTb3>JADYefBdl
z`HEswd%zGX4-;d$FAEOvB-0aR%NQn~)E_1e#0w<Nr;D0&2bXDgnor)9*Cxm#lOIH;
zz#;|Rs4TaBavv4%Frow|{Tf0*t=vI_mBXA&m_XGolWd^Nsq@*<E_zv7{C%`iO4qPQ
zK2@Bsv2f!^t-QSDRY^u(z3%M20Zmm_-}za5z0|vQ(%q`KBt81pdtYN#j{h<zgYdw9
zLGsX1+>~8PWn}m)t2iokU&04{BJGJUCK0M5fBp-38NK$Jo=a$-Fx*x*cofyjE!G=#
z2YTdzuHJZNpO3nCSkza`wqc!=yM6<Mbd=GXRd&M!a||Rs_I+`XaDZLd_<whxPQd!W
zoPm{BhMoVeCr6?7T~U7o_-<NR?lq61?*=pXp;iA|v=@O!COm^MD9{3nqT8VxfhNi2
zxzj}4{nK6@8gFcE_ZK&(6I;=K&u(jn93eCe(1cXRa-n95{`?rNkTb0jkyZd}RxAON
zT*<7S)ZvbGzG)$}4rw**YyCl<OzRe=Y)W%^qPpRqo$4)fDH8C+K7AonwkZ@R{w|RQ
zY&Sr4gP>R4&tbMCD)JUY(RamngC6cZ$k4P$-+fniz)yh4v_$Ej#~)W<E-Q~#yf@$q
zvsMED6Np(qZt7ffSUR~x?J*%eS{T(z>Z+iJr)$GYH|bIu6dg{3wdkg)t2Z_9n)Tl)
zfKam6)xU48I;v^FMA&P5qwY!?>aJgO(_8v+b(f060lkNLaXRoqM7!wRx$2RKEAmYh
zN{*hEcn<rnHG-Q0Ck_JWFwlQdzw7#!utFI_VpUr&q-2TVK_Yaug08WcJ!Vm^Az1)6
zZfN;1I$LG~qpm^o&i>in!Q~ji=OCqA43o*nB^kl253FEx+}v-qJ15Qdi6uQE#P(Eb
z{-ugTApKXaEH$IWM6_6|lO95Fucm*hGY)b*8|f|dkglgoNpNkHe%aPm8w?|C!~;=9
z(#bwNIyr4O_iKKEfdN{{OVd(YJlGCB-L_J%!TYxX;kIq>7z;APbl4q^Ydl|kHHHyc
z*fNI?m7$f(HboX?b#s@)ne@0i9(2zql4ai)lYEGA-4xqxQcaVftNNz)h=upIg=NY(
zB-1|ND%%S49)-mguY5Nc^j2c-Qck{=Vivh81z7~l__{`!d4SF!QzI|DgYRL&rIWCt
zg5RL}zWU{<tir}zCfs-!{cj$=@sIXagkHV%`(q<Mk@IusOwFTKpIhQxzXpWBdTCf-
zMvFZ9&*<+oN;*i!B!&b#;j-<IrLBM-x`0cHZaK~e1$+bUL^MQ6BW8E*SoK`Tw^jbQ
ztvZpFjm=34Jj!~JPRKr#isM-H?g_p8Ecy)yO49AlkXw9jmy9}rwlzxBJ~{8kf+B11
z$0f^x>Ln-1`G?2myX5?VW$7sz9Ww{fN|fs!@B-7ccBi!ScKHXE0wp%q7VvO>c<}D~
zjEO%(^--NX*rJcc`-k!vsMc`UruhIzyL@+#3sc06Ez7S!@__n%*rPezLJ7+(*=})$
zAr3r)6B+5Mi(FqjKomaIW6_*`u;we-JykDHl>yAT1znt8;X=n)EL&PhC!B}ZsGZ<T
z-J~zD(!VF!lvZdQMxBH^fqNah@<m#H?3^H4dx<0aA{aBuqh9f86ol$yXHwc3GqMXp
z;IvFl2n%G;?zWTR5kE}kP5a;`98i?LXi!O_(&foTv|3Rh|6jWPsJ4xPuc)c5|0%F=
zBf|e#fZ^cvKOQkciz;Q?U1DLuMeK6%2Xrdu<)FLyKX()14X(to`nT0D-P)(0x3vZ;
z=z=c<_)k6Jr5nd8y%%0>)y-mo6r{YyL(a=~!TFyk4qDZ{$uZ<`YL&ylPx#tHG2|;<
za#Y2VoSQH#q1UsnJHC8OiK{>{>c2v7S^w5w{^x##r6lFmW-;k*PO^OC;_HrqjM>i4
zef+oa@WGb-FMhp`-y8QE+dB^)Jlwtq?Hc!Y?mhTRwDonT5&q2Z%tg^(W@m7wW^>vt
zc>XW?*(ArAy?lI)nUbebty_<_x3+#*-`;9~9PB3%h@OnQBmGA*jn0QjhIye#HSnyu
zuOH&5oeVB9LMnxCqkcBX#^XGCl2C=kU&DRv4h9kRMd4s5_h?_A<J3tJB~?BttUjMj
zx?F{igTEt6tr2r9S3Xg3so2Xfhx08lT`~C!jnl~xRd+pOuhwO#Og<3gQ!^<tH9<ex
zsjh)qnj78TGO2FfOLc^p@;gb+u)=Fs!)=sLvo1%_;fJg$l<k{S-RgnGLC4GrM(qv~
zkVv`iS7<6aBA$SvrXq=OL$gt{kV$>kY^)3*M0oQqWw}Vy&TYb`aDea-3-e~lpfJ$a
z<)Z9`==B{+2sdeDv4RuKiq?$zCiJfbr(rHgn@xRS7_<10q553I8WWoJa&%pX*I^Dr
zbSY!-Ofmj&l3kiQ!xRPApI#-Db5bJ}-Q=9GyNlvKq8zJ(8M}%?RzQJ|uUhS>ee~kw
z?e1|ig70sRkA80LH}|9Gzfh)ty`wk39JgM+I*DE#9qc!c+myp$?+9~6JwH7;f*)3P
z+wkTJofvqwd-zM#{M(!3X1g679Y?L#Zw^|}9}IB3dw9}nw&SRExOZ^6-#UC5N6<%f
zcyz*HpwR5(D8_NgXRq{Tbo3&6-8{y;1t+`DTL-O^Uueh|t&>9>?gfmu8@<^*K56Zp
z9_$`RZ%&Wj9JQ%8T;G1Hy?3zNdfnXLz@!I<M^W?V=HW@yezkjW;4Sy)?P2p67vQY*
zd6Q#SDSrYD2dmw09XIz*a9QTt9sm(0c>sjxO>?h>Uz&ew!isi}e~F=6qE$zS?dHFo
zLOXaK?eD(c#cT|<1<-*V+B-dNzQ&0ky`cE?)93Az*2(EfGkSS+v`=7fH;;dA?KRtv
zql2S10q(TjjA4+IT^t^J0jR-a`2PH~-9q>g&<{_V$H%8{Fd(;%8DIcH0E1mrB@(QU
z4r$E*tfS*!uwMiQZABctebt2DVb2d`c_+ua2#z)YaPP!!38Ml$Pprj8hs~D<t(VQi
zy(T_A!j9gy+RZv|UaO65T0HpMT^RWkmrt7pbK|cTF2}UBnD1hD|K}D?o*QFtfD-MN
zpbz}oKHYmI(B~*nQhJY2>)q+F-ut+9)On?~bMCLum;#N{=t(i{A^-Bs`)M?Fep@Me
z#m2>o^#jm_QOY3*@Vg!d`+sq;`x1uR-A7kOfJ?3M<jGdO+~n;sAc)nbQNMMIE51e@
zpaH_DV`N6s{fMcJbVP@)$<WToeaX)ChgGA=RcV?J*a}=+U?M#vC@IyDM|-gHfI`ky
zb*7!83M{w6#RI1KBTg2FbtWd0d=gX13H6f-^Hx>+G^;MAq1qY_R<GI1T2tC@+Z1JK
ziq)Gm;nJ(Nbs*e9-tW`<n3UgpU1|77_`E-u6&K+Kn;c#~8}|Tyo$kkCHpCnIBJU|b
zFjb^oWe*dpF?;)Bz)L~7U=?UptTih2nLEJbOA|_fWN5ugLQOfBcsT70r+U%}n<&?h
zak93POF0<}WHP3*JwQ!Q3w}a<e;-ro73{A^R_I)3Q8^pr-H((!k)}>j`RcjqTXn}k
zNOW8d{z^MlTeCrV!#%Zk#9tL>bQ&b*MN}(N>ujynbrNx9`4TWtYtyS00C7D{%X{MD
zvp9vPATeTV)6FpXMCpG~I3J`=FR4UJk!jNH4&LfWm+)SP+L=D(*sp8O;4+yMR&sRY
zg^VyyK|1Rap9N6tQ*a`B6FBm-fZo+|7r6P;iR&W6=V+W4wu+oPc3gYfNI}uBKGhDN
z%Z~e^1y}M~e;gW^M@oC7A9zlCqt6LZJ<hFET#ve?M84cZ0!$k|rXHxFWE)*oPgZ5q
zecL;)6_@0!bWhX#C_npviHU3K{L_XLlUL*zM^j(8c5{J5Yxw<fX^h~aa6e=^@Rhjp
zS>Glp5_#agj5~~Wd%YF~UOv};Yer98RA-QZbn}?r;Vcjo>qK#})Ws$(-6YJQsm$rG
z$U8vfXis$Q5T1mAA>B=YR5fxJmYLSw-65FSyYpgS@XqWCA3v<yk&V54>A^k0i=p3p
zZ1ss)4J5Za$;Kc7R3MsjMr>%?$Ry^k-=i#lO!h{MBt(YACWaGycuR<#5sb{;j)DWG
z6Qgt1Pr9k0_|Q+94C(f`Ud6aeE6ERgnV2$aI)4$td{Y3mNrh}Aunj{unQD8qe$7O6
z5IjsU;egDive#Mu7CWsGji1aX@>X0X)|w-FekaH%`38Bh8(E!L_(q4jGtE1^yr<NA
zh~}d6NY$e!Ji{L=8$5~}A3a%wbKyna54A~5PAJa&>ZLxe7=WR+!D5vfcE3Fh0?$QK
z7m$RT`Wrj?h;IZr<aofee7ArguRpDP40G}>O;r1aT03si94=9XS;v628nHeLr3`!i
zc^F0K=1)ba39Z@11!At3M+LL!<uT!N(3z(7cqwGUrq#IQK3#xHrtv~dVzLbgbOQ8F
z5Xp0X!cv>`upW4ytRY$c0wsvb*Zcgm9xe<=w<zV#`8a~>RHxX+OI)r(lD9ZH_cc}@
zBUO<uRv!x+r0z;4|MY&BJSvC*HEoDp!aIRNZs@9^u&5@EQmeax^!6&zwg=PUcEQCi
zJYlz$V-$el06irAZtE2C+}9j4ExnjKC%Rp3Iw|KS(X(=gAbR3Jr|?J6JwJ{9s}@-C
zZ@~eLYZ!Eg8KE&(KXMqFlqr4~n)>aY6BndgB8O1~nj!mWU%3v88J8KmKo>6zX=Q#0
zWiZv~#UxF21M6k{-5DDuxQ0Qva4d(Mp7y!$ar@%f<}nJ-XM>Mat;I|q&6DFv+Rr}4
zmIDyH8+f%%_Dhf3D7(C}NEvwF*ny=7<Ha-xzp+m_8FYJ2(GU@|gry@>*%3(!k8cU)
z>eu;q1FzC6(HaODHtfl*KkJ?n<=qp0Y$^WA>{C0P?t<{s2H{7)De@N5Q5<f83A1GX
zn@&JZMPHuoSF<tAxBu-lwzlti_P+-^@Xt5<-=FXS5^i=pT95Vy8HH?M?#gb`<pO4u
zBv3WuB4MM;WRUd|Dd-ro`+YO{eKYxeGx>cp`F%6_eKYwjWAd}CbL8MohB(ok>AOd#
zkg{u5on2F1sb2O88m2@K@WzTcL{*tVL{RcucKO0<?PHl;Q8dzUtS6(VQdA6y2PTH5
z9O>zVh&f%2OzW}<l@}bus!y)NjJK%HwM=za64f9bag7MQJR*E6dvF2)&u|}q!VSnV
zKH&dn@82KVII;zCe1HAsujpvjM#2IEeq;t4=VHJPcQCLB$CLH=>eEOKv@NMMYRQ;v
zvVZ&cJnPlfLfB63-Cb+<PH=a1Jx-lEb>4^8g3f(>CsOswWoM3@LWlFI*;F-J$6`Fz
zd^dcT7w(s^b|S6^Ddm&D;yFt42fi+;+=f`aqA=m5(;f01CtoaQGGWp^PO@H>V@~an
z$2-6^T9)aBfzOWgP2Xt65UebbVbsUJW?UMS{whf(Cf=HMfNdohqQ@S80-hnSCpM^7
z3Za>?_H&YcN|sM$J5D8g0tflit7DR1{1?U~<$ZTrOw++WMS5ttT6*M|r~vL-M>*|H
zin8?7ICFov4_BAPAUqn9TO2dl+@d$wluHT&IV&Vp*_5U#=BKN8(a?BTlT7k^NSF$7
zlBf#U>Fh9wVb3g#(N%Pm4G!VPe&Q7=6dgF+!5p*4mF_q%duhulVKZk_NZZXBLZtc-
z_oUp5q`NjKEgXztZd}wxrMM6cswF#>k8m-Xft%%7T328IIP0Y)#VBh02;mQoZ>=_e
zcV}a=ONmhwYqf#AR}|x<cinU9r&32UQ#CWmys_Lx515_I7<GBtlBJQlEKOb3x?Ob^
z^}Dl<Cz2~{h|J>DrOK2O-l>_$WM!$hwCa_Om#|B;0%0k2fo-3vr2x`U29LIy<S7BW
zn^IKjU6}m;vScoxV5S1l%-U`}1<Hg^r;I+^-}O5%gi<;%S^A~e?-J22vt;<(=9!^P
z?1S{zYb+18njGN@smKmfP`V~~5TfftRQze$SdTt4>4q`fS`obhQ}`#CwMweF0ADQt
z<N0UlXf~#8lJH<kLZm0FDPu49TGsbuUy@<jI|HSINs;z(n=JsZGLtcMHZoWRlT+sa
z+HAcM7-6zf3UW=d3ph`74NVKbR-aYk@g>*QORoETXS;LirSwQY?Q2f`iIcz%o_Ekq
zzIk_&x1mE`N>?|qtCMN@pJdqw`l9h44UYG6!@W4p4w_+pKWtV>!sQ(2<+GCN27aOd
z0hjnp@>O(Q=l^uA4~zboByO`CJM{8BbpuD_1x2?6YW(yQpEYQyt1R1L#O~c*Thfm9
zTJ0bhLH7I&R~oQdW9sTh_armS%n9}h!?Kgl&V5d{1b{3Ci8)h@TQFors95wGKbhMK
z$z`MoM_HWJd@WF$yD>3P#Y*iGvK3=O2@juWii=_2oK}X1;8FFIlCD}DVK{DqsF<OG
z3!W*@;>A3*nSsE6WyPDPqX!TA`mJ(aPmcb+cSwGCC%@I)B+)Zo>FEgMp2J1EfW{z%
zRQlN2-oZjNi}rGObZ~TZY~n^-qrp^SXGkN<IOLzXWVu{7>ezCfuqg>!Y}ghXUB~#S
zo<jMkD_KXjq>tpOG);cgC!6xbi%XGUb(jMTV*8PBb!aDs8Ja&8Il}5o=b8kQ6)Xn-
zdc|OX3>xdnuz>G~wKB!T6v?78G7@{HghCW8j76&;|5Hb$q=IJG$UZV^m{ApbG9%hL
zuo<RN59I;vxkSYd9M)C5vPOjt%;l+^p(L-HlR>o2dL_Du*WARShTD_N5Bs9Zvf>L#
z6GEYaJw(n_VxpI;8cyA_c(J1sDUT*6*?4emuUrsAh|OKrbsKyD_Me|AN>Ff@ymV5w
zn0A#sEp~H9m=l$FS6l}`2@?ko(y<gb^EWLkJqj+Qqn3V!7U-JWSl-?CM%K^f-pcs9
z`DWI|RF7?y>PN|gPVa60Zsi%K@hkf!=8_1Xw_xZ>2i3XIG4GcSnr`90N7)s2dJ~JF
zzqH>clp>4e3lxN>&0cN6nWVu>PL}SJONs?$?eWD{t4ZUg-m+3;9dUyc>?Q>=vgk6-
zYNLK$A?a*YfW7#q2B0+{10WM$a8tYZo$j@$cu?riPoesI^%zw8{k`to#*S=0EwjP7
zcTQdMfFYncCWGcMP=`bWp`iGSpNWN$y}B``$@`j5-<xydeOo;uw?OW>h|O13aI4M5
z?yrN{pNZA=pDE-b{A?wGH~vCaHR2*8#e;l#+*fWYy!gLMtD2+RY0rhbG+DAE*qM8p
zjUER2ZNllXQ##saZZ(oB>ph>NNTt#$V1Zz$bB8jRv}1MJcG#(fq_R+ClK#e)_&S2I
zXr4H9S@pOg|B5d?DK>Rd?3|-gu>)0C!1uF&mB^~Oa-VZT&fHWyBG|#oS`KEYT*RwA
z%&wZjOVy0T-s3e+X+IW)Q2VTGSEBqy@;jYeOJ}!|P`STK=DB%NlEm42XJEcqHE-#2
zzKk8*dC;-zabyY1pFWZ*MO7`C$2#L7llpxnkt5*6v-5NG7tu;BrRw=ZBZzg|m2<m<
z&Kwi?wmU7BZ2fVrVM9SaPKx`OI$RZlR&B)vdP}YF?Ai>l8+-bts!x0htA1vFIzY}4
zRA&ZNlbkvaeZKJ`r)n3de=9LsD%EM~L@);%)sB^(*dUUR$jF_W?EJ=Fy_&qzYK(e9
zdX!F+C!BEc1JA9&LPo|Usl-4aBxqI5o0AdR0gUsM3mlYzxKJ-FP@3X-B7dt+($}P=
zJ;#+a_&8_~Qv>*7e_Xzg9HF?#UnAQu@VzI$M~<@so4IcX^g&fbaR;bS{HrXX0-?OG
zs|hEy3KYdc^7Sz0PIUodxIL;L*p#XndPAdAm4NxSr|SENNd?o+($v|XPMp*lT>?<q
z?QR-`&l>HGY6eWq^XqDd+gR$xvzS=b@5s{#xH%LV#~0E0&OuIY?E6uh;~^@?`FusY
z(eT8}kh5M}gsUb`&3>uF%KDXo^SQJerenHMM%p}RRpbY|CCbzpM@-QZ5^;4ZJEPi%
z$TLt#K#2ap&Clh+*=|qeu;2EW-h5tTzSDT$aJVDKbCJ&FQ`VblR0}&$Q!!+$AItt{
z07gK$zj~9ITBZ)yilUY8v&LItRY2wi+oSmANC?Hq0%Gc+n{qe7XYT#UBp~heib>x(
z8dzidB{>{TlJjheg{Rsk*pt1MXc%%EzjBKj3f<=0AD&C>=naN+7LC+9;bKzE#-$oQ
ziIqp!HL*C_`%Bk#A`S#pmn3FCIuUWiEw6(JG`f$LV}zUmF*~-2Vpca!speH$-iQA~
zY-K|#_A}{oo*<eZ^Ar8-JcU~uh%}bOc0#ti8<f&(*PE6Ijh|FL!x`W79Uyw}p*Tf$
zdD?Tom$g4Jl(5N@y?ZzL-s`4?Wnr2!C3x$<)Q}dryMR5y?Kz?H*it1M=J9gx^zVDW
zbl_(0yguMkQ#L#rXqt!&@-=3L+TkrBc6iuF#T_Mt<p1{Cce!gPjq3N(jY|_ve_6&e
zYWm;dPp9t?GMv=1N-@-al}zI%eKlpP^r<r2&Lg=KxpoD<20Cnq6;jO!v1D~rpCTaD
zWKYlguK4I(#ubT%J9VhG<j8feChD(N%%fKQxSV2EMZyXt8TDkXh2}PoID0>T5$zmH
zJw|L}p5@ZcY|B(%<Gpnu;7uC)tqO)K&+@(z4)GtJfap!2#<xbf+TY!y5k*G6d0x_~
zW#=aJ5^ek07D&`6YiX;!b;gr|D!DVOh4oj*=w}Z%12l&tc${GUQ%oeE9M8@=vorK9
zJ)V`9+E+^*Rph474w>dQwMh4QkvP0;s~s;v=6D+5^~dhB!PTc8R{Ku*?<E*@uBd1M
zLzh%qVmVW~j<72%?uI~IVjnv$W3R#LFf)7)$faS~w(J|a=9HOxi<8i1{CEj~G`C(c
zST!y|<empD(eFB0!IjtxyG@!I5)@&7CzF(nUY5P>8^<?^nM#s$JRamdE(mDv+7)1W
z)txy_DC$cuFJ}x@9MViVi+I7cib)%U-E)OvyxMVKyela(jAvx8UhGei`xWCxRRt!1
zHgX{YmLqxyPHt9ha=!{hpfyXy=Zi}oH!jnl*U-tJC_c=_>}&M=dVlw(u6&C4J-w>r
z@14i-JF;fgtHFAxAXNb_x1txY@lxVG=2JyxhGwFvk)4ezMx<+9T-FbJvSV52BZny+
z6%>1f5~U{@y71{?P-r<$o+TSG6PN1Dk%$}s#qPB?BI;soMd4QxWCntdZqEv>U<E|F
z57`JLzV$g>m=LO7%%&ILXG@Cp=idGP+n!41_GJun*F%}~2;~6UE7BvO!iPjT>k#G<
z;N$_4UQB4Pn*3B;p;)g>XnyVzSE>jAe|^lXU!a3RSDB+KDiZacBe?-c{C%YH#&-%8
zOXX}l#!Nj#MnMLjNyGrpZUYs5R~VnK{haZtknWiN6#s<k$K-asgF>H>7%t7np&HzA
zRRktSwq(Y}v8tPf9BhRvK7ReY^ZI#U$9_YS5t37OzmPl}co@fUxMyR$o<|qJlU(xF
zk=Q}Eki{~QkL=>k%GsHc(w4dsPuYt&wf=kFDU5&JYe$qSp1wEC5YDCqBrNRB=sRfR
zG}t>9k>Ej_B34{S%w>y_Y-~^?m+DpC5ORUoBzN8Qlnc!iZXfwnB87334Xc(?lpH&Z
zh(RvYZMvN}DY1f#tsyf{S_wHZ4f4!wV5Qb6x{~L3L|Fzlw=!Oc9=dv0n714F0(L>~
zKfd?sV6R_o<3Nnx>o?+eyz3hj6>%4NB0a>wSQP~^TjWZk&dV6XiEeo4ZR5I!Vq?qC
zxNKXp4`l74z>FUyUsO}oF6byMY#UXb*cx(EbC;CaDXJez8dykTMSUlFEwNfrKmafH
zDs$>C%5`Wxls!%Tyergls-d$o$7)#5<2t>>Y4KcFxhS7x0=*+XES~R*qhW2?*R?(>
z^L<lD1~P6QK#FxT@rp`LQ;cLsA}X$4;xeLZb6iKLWndMnbY8WQ=Bt>X=Se__S*mjh
zmMQpIBF!y&Iq}hwS5EK_V`)5646>JS>{ls<4yb0Upj-w{@2s%Q`^GWVBR-r#+N#m`
zPR4sRHEgpwXn8*FDpNRp1sXzjdS;cRDEnOcX3T_YXsrmYKFMhJss>Wu6=Xgw;WSgk
z!oCthf@#;On7lYR4ALGSQKBwHO)LRoP)SI{DoRCxfaqyL+mvr;nwB3D@y8b-ROA{D
zmUt}T(!KV!%tZXKTtguvY|&$_71;%`24JNqH_E1Bap8n}jwotf1`th*&j98eAfu?#
z4!bN9MaAkuMFvFeGwii_PU$v)65>rLL@eo3qH}i6N9ZZDP6_tMaPziIl&1Pi8|iq7
zj?xmPRVsb)nC(BJqD==Sz!O!yvq7fTTO8~>FsD$eLCdzf>Ss3$hJb_%(7x)h2;cDq
z)I;K4;KCz;T$joQ)2&3a)$CGE*N#Fq`-t^joKQFFQ!HO2bHxD+C1QvKd|-Gtxjp4I
zl#RwO;nX7wGs(!_%Lpv-7O?#zQZBH^bHNCC?S*_yRZZ>%Q5fSjQ45y%a64#b#v>F%
zae1M@>#Gvmif7iw?ra%GkyY=ceZv>SaXm?|qPJ00Vkb0mExI+vK~L>Vt|N4}V=^Lf
zyLT@vs*`5O*iAQQTdou*DdVm6pk5a`$C%>NTgZ*KF!b={x3AIH=T6EYsb_UJ?`uSW
zC?E5_tH0Hal>BoM#YgT2YusP<-5V-bjjN?X5=2Hi#Pfh{pT|A10)vtj@Wtn`m$nZ$
zc^~s)Ru0@FLo^iyfEba%JM}UhkI@Ko?sjG3PqDPL*v~X1(}>8f)i)`DktG(>Uza;%
z;DM|lW|U8U^R0^C%lmqFhv0)7nv22NeDc3;V4Z&d&fR3+J5C{jj~rg2E!#_b>0YLu
zkjJ+s5mcsr#(_o=r|Jl5!BxLLnaJI{5vWiJr_Wk@Ohw6kI#i^+HirXJF%dQM5nrZF
z5g&Ti&B6)NrXuxfg|!iA=>=Li0V*WO5G>VS$q%U{94FR<`4R<cUAXSbmZ7g6DWZ@c
z?}<bjElMSoPh@`Z%>)k}7HLQJ2SYEkcBopzDJEFBIbcjE^JOYeM5cpt%{r4C?x$*G
z0(5{0i3AVoFSRx|^gMo@M=cVu7m$`k>Qp|1*%W2gNIy<?0MxgmWqL<;%u$|CZHA3=
ztv|i{oKlTpgNs3NmJT*KM1*5#u@0*Q4)+U6g)Pc^@rwwVU1cyx9{0jZ<+Qhr+>u(<
zzp6QgS&E)q4P7GDI%+54TVR+emS4`{PN9yxF)2heeglY=ByoGkKdzY}F9v<iqhN|v
zDpsE0Njj}oubfOBxtMT!GHv<wE-PI$iASh>NvX=T_sO(9cX)#?+m7{w_h#x^Q6dHu
zfy{hVFONo?$&Vu1F)y&oYSnnhxvT@aHXWi0W_jQ!uJI}IE%1l`@FcrJR!KTmFW9>S
zHwZwoP&Nms(Wd^1XBi;R@_k*kb~&*61<dGY6!D;w&|1836yQ9H-fNdYui)&BW`n_7
z(IESt{<RHS?a-1?^-$M4Kn;)}Exb5*O<7<tX#?dAGT1G01X=v>X4Di_wJvp)dXetN
z>o1Cz+t@Pb%((_*WhCQgqqYn4*UdhD^HNConn|ThKod|o!1R<-S2M#ep0JW|iTDjB
zQz|vrBr_om!c{T(FetFDz!hl;ICdY8pa!IK*?~4uUp=23P&erV*|owZX?{&+Xm?Vo
z5p^f+B#mHkpVQ^@ux+a-wMjH+@Ux7i=_%cxlx7+w4;AG*h3aJ`O{aQfQL6vZd44gY
zrD@vtpm&i0D}K{%#tn1r4bu-<sfDKX?jb)Xj`h)=tn2hS<wpVHwdwd(VN+vDB3YP)
za0h^*d?7Z#sjtVZ`Fu^RUOH6Y+-iwYPOvG`Vh&;lm}T-coXQTCo2Q$^gtoE?$8bML
zelcYMW{uR`4W1$T2B}w@g%q2h-o;eA>_0@FpYjpQVhQEK#2dvjdrpdeaXXsduN_}`
z!GPR6-7=lIWTtk-_;Y4SfFw+vAS096vg4LgzOe_yvG=9Pd3I&I8R%>A$fbB%<chiG
zM0O6SV%TNofiwpPx|_gDzzb_Qw^)yhD9H(WBxxKjt-aIcyv1S-c+3o<BjT1*L}$fx
zo|PrrC^*ry(6YO>2HiCSh*9xr2LkUoT^*$=Kpqm&l>J22G<J3^HZ^k!uF}B=H(knn
zeM5|HvvNVE8Wf=Cr*7o@jghP<E6~*5z|5$b`&O`Q@92f7G0tFDKiK!R%sGuCnV74=
zu8|>bfyg%^vw>qYl+r<U@fqFjY#(nbmay;!xD!Paduuvu!#SJa8QpU!Z$c!J^dfka
z)RW_)aJn`G-Z-D~NnxBJW<$unY&YFYeXCEL%tkIU1q%+*_nvVz!~CvzVEO7%cP3`y
z)kg{CZgJyw7<*1&D1rkyYT@oIIYMz5t0%T)7DtSKzM8(dC(f=Wa)YXqjHs+u7)~=o
z+6WT})HVW)7z<400ayLOj^xJA>|9)C(El#i^<L?Po(;#->$YM3O^iM&?18i3T+w}N
zw|G9w2YsWztVY{wa;15;KI_9v^;4~0wHFJ>&|2SmY@A#qwROSQe41cLOpwRqE99dQ
zlOa{w_#PEIJO}lMv?r*FwH{HBnLC$gJR^zK%<x7|a0e_u=H=HyyF;6mgUE(_$EPlz
ziuawT%MUYF(Md5zV1g~`($8k+Zy#)kbFWQ>jIz;SgQJ|Am?l~Dx$tMJ?N<J!k~nw*
zIT)X?Px)@=`72=FPKsjqqL{E#0(Y{!{;1j(WK@oR#%7J>h7p14+Ti@GuDrIVe@_01
zu34?fP354`7aFE}WJM7C*%JH-Re(1EIGV(uc3uCy;R%V0LFpEdn%8t*)`bPTkEu23
z2_G8zCawtM{D(8w!Gg2XMooX}7hFfDS(J0UC7c2;rFh}s_nz+AI9S-EXLJ26458h3
zBnVLy_*}nFXMqss8<u@@Zhl)5fv+m@T2h|$=2$rlk@&t=dlOoiKFg=WXsK1ZDBxK&
zvzvdg>OC!@e3(ga71DN>d0-A^I4nj12N6rgNiw+mTXsCosyB74s+69FdG{^>%t_A`
zPF|eBP~LW3zAEkn!rTmE9<lBoZnWz&hB=$Laf>W68__f}hM}l>#j5GB2SjAUH68X^
zt!nEVa@|QdTut&AB_M&K#!oq$eIj<QUjdxEnQ8yB=-sfHz4n|$Yq}QdsBXSAT2!G(
zpQ-YY`=}@igE><M7j7DF_j~1OR7E#`Voc#p{u1;)j81I9bT1o`Lx4HlK*AYssuD+J
zSULer{+yKJNHpBEmEkcKYjHwBkT!$I$Y=sgR;@FNM4S!DT-L{)CsPxyY&)c}N5xf)
z2+$rdRBE`%x&(c-xhZaNi-P}8a{f%BLaecb>W~IXL~4bmJatF$Of@#+hT-@1-OFrh
zb*la~#y3@s`jzHd+ZzQ-x}Dvq+)_C~s|!U1^ZA2n9-GR*UX=Jk!}>Sm@3o~uzWx3$
z{8j3|;B7nxTwA^TYGcf=|FZVzhsV|WFON6A)qnXjex!=#9ZyzPl5OI~xO@o-eW*pp
z>Kys6CO_klqW{=M66G8;Z5oA;B<>bNJ%4ju%;*L@&(ZpB%cfjTr{i+-{{4%5dO15=
z1vdA-l!h@_SXW!-hi|oIzSWkIuD;cl`Bq!zTWy(dwPohkmN_3`ZH8|5V83&E3}Sfq
zr|<s4X^Q=awhYbFa@rr{XRDXb{Aa+C<1_R5!EqO0{QUKcZfF00?j;-RDE)1$0e!j1
z`6gZ2_>adAFl}doo-+xMq#+1M8|z$e8Cnm<5^~ZKe+v_GFfQP9BP&nQ9pxr|;SBtI
z4^Vb5S#zIlzkm%-*4;-Zdw`~}4I3a(_$ep{V-(Uvq25d3%FU<OT3~Q6CONP23B31x
z9HC|B61asAr^SnWdh-YPOjcZZUdg4MVJ!xfgC1;PI&GM0rOBB6>aRHDGI+TRLUMEl
z+vxM$|Ew9ry4$75k_Eb}J~30&F$UuU%IdusC_yF+8!|*la$F`8MrBNRjY|ATcP}s#
z+F~Ogq>HvB#oGd~iG2$K>c>UDwGe!cNhcPY9BB|E15mwCU|O?JEw1=E82>C5`2Eo|
zyMSBxI`*BWekWYT@A_F59awv-2f07$f>2x@+er+@b4!6%<iAOV;i=hIEdP0<{I~Yt
zhfw}|_~_9$`R~v8-H*ywYkyk-A#3BCko8T-`X*$36SBSuS>J@Ln}sY)drjtDE>vcM
zd|u{L#FceCoxAyDdQIl8nTEcVV$`COIh5>NtW?As1g@2FPN6rHFvnViD7MmilcS57
z*u;q}X)mQQe>*-IoPNZU>rmNQmGuf1^-O6}<&G{J&O^yG<Uj09dXFDc4O8aHh|vO2
zAS7a@C(Lry>Au`Q?P3cu{`emf=;nV32kG<|-)=--lihc}?|sajpW&Mva}07XfVLgL
zVfokd*ZT*%-TmEgh{|N$>CnQPYn3=S8LADSMysp*vt<l{;w+MK!PLHA;*na5N;(ov
z#b`3qGOv^>q8P!xP?UX6t_GLcCviVO{M=N->qN4^mY2nqW{-dq^Wuo&#%I&<O!6K`
zaQ_*Gj*G*Bvq1u4&a)izi;uXm*^*PTWY0bRdw%E@@fyL+G@71QJh2*g27^xx2jnEV
z;QzFI4DiC7b<lOsM$6j(-F~wL{y*@m%71WpzM}09e>cc~4<0-W?SBt{fac%izdzyk
zP5%2P|9zAHzR7>z<iBt7-&ZoSv2Xy$w|n%;F|!4azf(;;aUciCc0BxRQ%z6wup<wR
z<t5AdAQg}*+w1fIdwuxV?yK#8;8s9m_$#jO{`T{K75-0(kNtW2|3~ZV4>v0M{~x~b
ze}Bpk1aH~#WQ7Ch9Y<R&LDtuN3@Kfknpqk1y>X?wR*jz)^O0-c_{eX3<TpO@8z1?N
zkNn0*F2YAvH1LZ$W!Y!55m1c2|172QHKft61ZfJ%0fJyG3_&>w7`8{5f0`|?B+2=V
zEf#LJS@;%PO7uJCXhVX}xr{Ie7DjVq-ST>PRt!q)PpVl+c)c*UercMs?7W~HShyOb
zvC64kCMGX$d71W$E2XzI1>>2WYNFaJPP+d-lY76gsWh<o3ofCbPWpQLOVKT2%YQ{6
zbO{KYL=1C3X&rlt8lob`zu#n98BZ@Ue~|aE!HF7tD~eg8`w-?d%zGcx37J<w>_DmG
zr|qBjfbBmxINBjcJR>3iEqt;64|dLLuC>hb?GBvM)9&FBz3LvpNqcc{^rl(<3T-f=
z411QX=r_CFa>jMKoG0US(u+Ooc3bh`MQ3ld^Jb_yt=W->nvy)TzycCR^(Os&&+GMB
zf)7n+l!*`{^=*(SA-dW8wp3^s<|9gyAup&{5=@NhwP9j;MLL64TCy#X%7j_TIe$%#
z0Vg|Sneo}zrO7_N+CQX8H$SzKCjQT}WG(qI!M`>W2bQoLvOa#of<8H>{lok-6Fkp6
znfr7UvT2WV5z1P7f?PDRv)4e;x~Drl2fL9@QRWtW+jakK8uj=gyWE+k)u-kI%7F~;
zD9f6*uRJu(%^|~P<{yYe!TkSyZ|?lxXA93Cn%-*u(0-BmLo;Xo-W)&Cq}mic>rB;q
zY(DABI~>b?QGIF<UO$|T(W9;_6sC*TxGqn-+l7<PL}q`~n>3M0?6L&ZrkAa`ozSwJ
zK6bNsAK!@qkVNopYN}3qPHQ#_YFnnlGMW@e>=wna>9`ykf-J^DxCh}dv<)%cOpaz#
zCt3G&a;?QiMBYp8{5s>JU6=vEnjhKomHMVcozk^D1K|N(n2G$m(`_#6gkhpxszsVj
zT1wVzy>oXxPbA6RwV^jKLjfO&8y+1wPtMa^i)Ab=&q~y0EOAmvQ@EO+GSR}?*#&=X
zFSq4i0TMD5Zrt=7IprVHy+XN`3R_^At1{WrQy3CBYJJb4(=8`G&G&R*yzDG>m!58u
z16BN|+{^g39_^hOb6p=^rmPn;WIzKy=>?Wi<O>X+E;j{W%PpF*`^EfWgO%T63X=T_
z#&i34qNiOljVfLX#-n(bjsQRH);rWNI7aU7#WBRIm}oaFg7q$pT^RoUdFUQP-LJ5O
z>dfi@_@xK#)~9WemB<%gydB$?)1g#%$U+zgBIat&u1!K_=4jceLVZv!3Un|@NwFh9
zF?<#3jz%deWJ-eKj!9W;ICd<5fv!;~S}0q!n!J`Oi1>~!!0ddIUKkEvxfw$qcK2SK
zY`+X3J}SCXnraMPK8vJ%svP9DuyOwYW@>xqr#<NKaPPL;QcpK3^ew)Td}HF~Ig73c
zFI0sJR};%ZS$oOXO~K_pYJl*&%Ya7@K4B16;!N`CAA9HZ{@^=L*vIvDg|ClYdvmr!
zF28TL-xu9}4qnA>!rsEyNEL7Xi`;}?Z3%zgO?c}wxX4Pr)=h}pAu`>c$BD~;x+1gQ
zAiV0cD3qG2qZCBa<HPWB!s#q2ZNb{{gT6h9+!_P;urWQl&uO<Dcxj!+wx+YSg+$LO
zo2Qfgj0u>OfW!TbB#8gjQMT!`ILWAFANJBa%4`o|w%FqhQ+3oOF(MrfbR&N@myQdN
z>q$9-oQlW>+6Ig7+NKJ@&w<u_W<Vya2`3|S=h^%LH<4nWy^I8Vp|QOpR=g|1hp}^c
z$)|Ntme=h$7uO#Eb!UD8#T)O}$fkTvm<wEaHgj&@6Q!Gr-oFayIKfkBTEZXDN%KMU
zE=HO{TTYcDKkp_ux!p|=rRraIb=7%Rq5icl>My#M7Fk#H(*DwYI~MbnM~_-0MwZtl
zm6*^<4?ztdyvd9`{!9wVl7gRWRJD_f{9`6n{=8~`SC|aGpu!55AR1>AHRtD&+S;j4
zAvO6h44M^>RFILPHLSrwMceq*EfDusSdsI*yZr|0=<Me_3Ms%2=^;Wsm=f=7&CK-D
z3@^KtpidPWtz7H(bsN?u#?xs3u^Zk<#q%!iTT9ChFY^anU^iV2kvoiD+g?0!-pPmg
zAf?bF0)BfTTEg{7u)RYMSt(IVM;y}eUw2RK1^EZ;uI>C!-e->M`n8-+`m=GfSB!uv
z@iUWOUO+rR)_?=r%GNyzq>^+L7AVbus`Dj{?6_UF2LZ8WyGckfj2+02DdT3dp;%tX
zctmMH95d5w=#PM{jY3Spluf-$L<}}DLye9dxqEPj?7wUQ1ooUe>2xZQnxo{Xvts<D
zuF`9DiF&hra=3r^a+B`^y@zzn3z+VtEaB#oo2j2kz#AMoiOf^wEBZrFC7?{}(22|4
z*{r;#s^xm;N$sRbo=Hg+it(hIj(G>F42&ljugj}+Jf^?Vh(@*dN}c=*Q-T&V-N6mk
zzzGomCK=UR8C^7xFkDbrYNpi=jKhYmmu9qAPIL5$gU?~Xe7}}xiN|8g*fACl#FY-v
zU1bbXT3%-4u;Vyrx?t3xS8FMz!;UUZ-OlOuY0LH6xGwKcug6&#xZ1#DJX-$K^WJDW
zAitUbe|5jSB&C?v2q1tb=ek6vk7l>C(>+G_D|<GjBly@kQy4z^aP4o8-#O1P#uwfE
z-fle7=QzT7zpZ5+oFmyzmOsf!G_jQ0K^r<~H|_(k)4P9X(5GcK+U#GDz(U5k4WC3J
z+C0bD$zlvg-*j=*J=r}vJop6;3((h<^)T})rT>Nvhi@s-JuZeSuy_S#dV`|Opov>C
z!s~_wcc&RMmoOa)+oYFLkz(Tk*I>aj$V}G8Ltw(r^K3u|g4g>L7Wa%+>}NV3Bi~6~
zt*p2+95dPLT~2_MEhS5V8e-f^##)KucZZJ+!SN~H4K@B0HeSZoOaEM3(s1Ll<j<$Y
zU;y7!;_r3M{Ecsyw+PYvq_<_sT+|>u2B+Jdzhm6*qNf0GmyzB+AEv#_`&e5&@)-Z8
zn~(D8qUQwr!Nk8<s(mYYwY~FG_xK2PT1Ga8wa<FoqI;H>d9RCPHks0YxCxCqEHApa
ziY`}p!cM74SCIsl-hIB^+283R1iCv%uMbZh12l~Q1iXu9Kx%7t@nN&oHb<kK+{H&!
z(D3hjCx_k6>z$pwPN$+5lKrGkaT?TpJDfyYhNX#4TX%WNIEXX%mLGb~uU01+){lcJ
zGWQeicDIXZ&7OC5yWPNfYj=`f6r&e|YjWWFTr9xnSY2+>jh1cvK+D48nArW3&+!3Q
z<G=@4uo@n;EVUcvXKx=0^~1l{-a*ry(}ON<gnhh@k7;j^=G*5R-t+G9{;qxZ0N?2z
zJ2=5BZ$guH@({K~c1LE~mQqA(Ev_vS_|n-82$4g%4cf>LIRXnAzh#;N-kT)2y1ZoV
z$K&qD;hgU+ORRW#5W|(jY$`LoB|?1G)^B{?-ar0R_Ff-9d>5SzzIyb|<`eh~ESa~T
zbGP%RePl+b6VmsXmoV-kZpC@|1x$`??07ORi6+}!ozJu^%A9bwG4|w(`IEfB9Yg-<
zc>idJVJ2H<zKZfH|G$t)3Aq$!k9bEXvY)bFaG)0et*HgqOR21;CuKw=3tPyIHC<%a
z;Q23`i^DBBi@Yh;J{0zw*d!I?TC1z_srK-~b-v&d3|QBjRRma!VE}U|ll7!ILSv89
zxTRfCFwJaIW=^G<Kpo@?f}Zz4=(lS9J}Gse3rOR7!ndxf8B|f)w~l@_Kl24h6CbmM
zo9lI~8)$OVfJg+AjG-5*Z~ImFJu@*B`?VANo5#0?1Hg#aB>i*lafB}HU9Z#(Cui5B
zvP8OU%7OlBNf=E-&{LdE@dPyJc>_?N{(%3MzuJG4zp9|(^d#iU&T2#jRsl67b_%_q
zNhnpSf>=udMO<1LeXl1e38E<28K->3l*=p~!&*oHEzM%wN#p8E!vQt0vNHcE^H+i!
z&e1kA6UEcz&Xvknk?3lCyd^Nt)&|8YP}vHKw$1Tuf(Ho?M2~8rpak2RGilydn6lv4
z{0T=+hRmJZ(X-MZg9QhbHB3L4aww>T<{~4+2&Z^<jkXzqFtU{pk@TXR-9(U(Tb9gV
z?vfORaaHD=#TF*#ech^PP&K1~?w$b$PYz~O)tsx*I|Ok6M9^$Xzeo`FWX#3d)|ZoF
zRLsi3H6p{mW;x;+xxrICt|dfBEH847^itu%6;{c~w}0kU;`^AQ&g=W{c@EW6gW)X~
z6D$iWGj5or!ouO}cCyYs!nhK%K*E-$vm^ls?#XOK6<?Yf2HFxd6h-S%$D81EIJP;K
zOhTj)x!XB~v<<bf$5$J>VyL?`?qXHCLdqb220QAdY?6x{X4Ou(ht)g%Ra!3eARPqq
zvpXt%XaH!2@Q80rJ0Q<i7^C=h{V#hZEKcjc;G8s>jcCf#8<EgL_4n_h_ieYkeSCbd
zhq8fGjYA@VLNY<K#f6Hn4%5WpAqem#5b-V<y5N7iq>TaI0(EzX#Wd5XW38?MoQ`NR
zg%-O!$?B!48<iVkO%}E^*-a-`(DGliY?iHFa%XNuchV;|F#UP=r@ign2I>nY1t4Hc
z7m58)U{;UJy=1{-eJK@C$Czd@%PF4>R~UkUm}l$asLJ4SHdM8wTLB%lQB6tN#_p}d
z<ii=UP?WtG)`c@+1{lqb_Ys067rN%pDV+Jt?Uv1rlQbXT)Ek=(v@_<cAO;p~l4|{^
zggTRKZ%zT*G=aS&vyS%3#dSSxHr8Upcs`jotPq$Q`jVo!=?=fjOEM@+cPs0$ZdgT}
zQ46l}C~9HRxabw66WsfhqNniYjfmAaDa*}9dxa{T1+h+!2Kd$Xai<mIz+-)~LY4lO
zJlW$Qw;(zvzg=J3c<5JcW$UiZbcbS(h_`G<p+1EmzSuw5gHgtgSc4#}NFnE_kUS?@
zrxD^vqurP^v<z9LaIYtgt#ADGou$N8Ax!QG{ddb#7xP#Mg(tCjnNFP9I3XVA73C;v
zV9#L#$|k~6N5{WgZEPQL3?rF)IvMqbWB!PD2q7#oc2FnJ+NwkmOJ6O0a8<en^sx$n
z^ewAp!&ki3_f$zsUEjm07+o!3F=B}SsjW2kyK|qNiy%4n873OT%8x>6=1>{pwuMFk
z8OX^vM3i^C6sjnxAlOR5X(&;>O6f;2N*BqJ&?*Ypy#%2WdB_Qd<qnJ~%Tn@fVBvq7
zU1Z0^wh+-B6)VLU>Cx#=$H{q?!eZ#Gi(RXnjg=TkkmMNd5hNFMg1_{T*4$!*^{Tlj
zFb?qoXcH+g##%%>ID_<Opd+Ft?oEiaFj4i=$==KTqeIpzAWH~6*YFM1FW7pEW7oZ-
zo}BX_#wM{I2U;T+xxYvJhf^caY8+4Uk7!V)w5ywqO1;oPMFp!^h5zeP_uW2xgebRc
z2DgI=4T_CPbozE98D8m@LwP7!Kd9rH=N?A;*71%N{wi?^xIVLF(dDWf{@}zaVmJ#8
z+bV>Hz#(9kf0#}_U=idpk^SL}!tRmV1kA?59%Q4HqRVo2*e=X^p7WxZ5`9-fA-8MW
zI4B`upt@zqR1Au%HWpol<BuJ$udS^O%kS$B<5-ZVPdR(T>oL&n)Lz>G3d-H$X3G^J
z7m*uQF}}PmbC|U*v3aunszq5}uw$Ze`%|=he*o_70_DN8nXs8+8zezJ13n7%W+WM3
z<{4&$nG~fZL7LWp<Cf@?eli;qY1LFXSley${{2zf&ww?RL@8Y24UPtkQ{Kl6llRyD
zcE8u{b*K5bds$pD@MIYx)sq#c%euP?W%b<EaBL7RlQ(IpMtqpps4ppEY<8NRog|&w
z{6T}fmyOD7Q}VaS)O%R+9%K)$zFe*rlZ*S(vb=wGegDDg+WkH{^kk#%>kh$UgU8mC
z5kV~1*){OvAAw$;6oA>&<d9%PA3op@O_6WpBbm#Fk6yuClMW`9806>Y)c#?MGf<2W
z5ZNax+2>|O#%#zix=EkoB(b0ctkxl}19GEu^)HLrDF0M3oZ&<7k$Lb>CIi*W1})3>
zDVaCBE#FRrMvR}{P)pOnPj9-f_FnNd;EV^4kAM251Fs%G6yaEHBO5W>$WL#c_-wH4
z*0-407f)RB2q*BU^N-bJCH5m8+c!VB)2j?%UOn*!V9QfGIRa`1e>j8j0EY0YK2<Kc
zHE*We*W-sPXSp%%tMig;RSG<y#c-35<z@pF9ORsO_ZC*0ip%ucfxo~P<RJVbd!_hh
zH*^RAsIXUvk1MXPh$@T3p4d(f^3m**0U5g`cZxwe$;<d=1^RX~ch@t;naFayh4ozt
z7E*)4vg08NpX_ZP;A68cV~|d0HD;LsYVbNegfu}Kw>$+pg$k0&izn{>@pK}9op%Ci
z@!#$G2s!cSmIb(P6nwbQ-~d2B4>mpz@BbvUcReDbZC{T*j4&_#Fq>W$BzUO3tDjEO
zRR<UgcXiZpKl|N8;czO=)4k5A$!_ub5ED;v_7&EheFEHcm59JsOi9(2PA+<FEk6bS
z_{fE?uoU?Oc$iAmnn?6A0)8!<V4r*po@iJ6RAlqUD^_}ssfaag>Sl7Mk9jK+oLDQV
z`hDuB`=flC!=*@SI==ZfG4%y~9JRb@2kgc#Ho^6c2SLZ%Mw<!mL`0=gZq>aT*OWYb
z^f(yAhBy#jK!e+l6vmNh-*~e7$+&=jWs}=<7~$^!vol<N`_22+*8lFRcKOT4xFP@l
z!;SSY|Njr`KRo`H|Mk!KeRlotZ`HfMC4~K!5cXR_*l!78za@nI;|t4eo3u$~HpqHY
z_skeGIUA+>z9x)n%&~`H`pHedL>CK|mZN%LL__`^37|>7>X9#cNG>N=cmZ4&v*ZeH
zD|`TBuEGS%B1!vwF$fu_DIhh_7KR%DEgPZ2+D-u@jDgQa*A}$-$lp49$pwq|7!f>9
zju&L-Y?+uI3J^4f%sGC~7GJ2oh^APT)`PKdf6D8-Z$vCH@`?M7a%7QEQSFPAim_PO
zZ-T;q;;+L0XCL$4^lMgsxQYJ<mVcvC|6v_of8+oEgdfn>SLr7)7;&l>^tYl=P9%KI
zgOk?@;e;~Q%$to1OtqVpEhWQIP55X2=2nw<{7rcHCOmu-9=-_=--L&6!ow}9Ni>M+
zPyA8>XINjNwzhy9!aKdx!VzEjrb~9yX)114vk80de!T%iemX7C6=8z(7%ADmX6YcG
zUaRX1-tp-eUVqBP9rY^1KnYCUgBeYr*@x`9WZ5R2(nWPq6qxN6s5V93pvQt`6U1L6
zo8Z;3Cyz001Nzih2i6hiT*yc0!$dPNU5txjK;z&vL?U7zio7o(TRR!grdsm(0=+fx
ze$cljJU}>zwCt%<5cXyG7Ak&_j*^2HubHX2cH~IP&H%SLTx^(Af%4b?YnF|$5p>ow
zzPn2KHKBt5)|qQrFzhHR5(dT4QgK0pbaIhR#L=+H|Kh&FF^5??qIL1NxF_~fLw}d4
zHl9iq6Nf?D8;)VeGlBVKDyRURsG&!**O-)7D#Pvle0+3t!1W{6ABT@AukCKPv)kbo
z8;>4+CtifQoyV}7xZBqn0#>P0O`v+B)?Z4iVWEeXybu<MaIj}BW83YQxR%iOL9L&E
zhh^gZz3R5-_^|3H(0+$Q$6!&C<bwwM5cYyL&i+{*>BEe=`&@k4=%e3lF8^8>E$=yx
z;A}qmL&(m)Ul@k+ZSk;x@Ekn^j2I06hY%#k-w&xzZ&36;w9(C$l3t558azX8y%;d3
zW~%O_gcW>7=x`#-*+)x%DFzBnLpD;j4DlM#n@Yo9X3(*)k-WPr&jyp3cnAX|NGcXA
zw3L}P&~rGr$fhv+9h|5aqpB_eLyRHKnyvfLs=IS=wDb2a@KQ$yulY*8o7m^Cw*O(0
z?1eelbOBsOh=C(90S0)h60_jGw6McofSD%tHsv1dQM$tLKlo>9iny3wk#1sGNeLV&
zfQBMal!>JhFm$JuE$&0N6uZEDG{q1oG)$dHTiXeRa2%;|juRp~sRrnhM|K6)22>uT
zy(X}SG;8b5fqt6z_2T~(Gp)pT!aBd&TuSnpcG}iI>S77>J^L9OyfDuG4r17eN~$DE
zp$8iyv}WRXcMbvK;tY#5JK*X72%@;eujPv?*ryR*Qr}TjGwf_hp@v-Q270#ld)DU*
ze{fNNEO9yXL2W6r20-&U*au>KipV^H5tHSjvH|u(2M~7C93LC={@GSi(8+T*K+le8
zwPG4AM|ZDgJ1YI$BV~p?Znoo=hI0qMIitzORXHaER#&@#C%E)?!O73$?FLh>$&4jz
z$~~5jrZySXYO+UZ5$RrZqPXyCLe2nFRl!+9HiN>0l0)Vbn#d@S^K3%jm#BzE{Ft$$
zD$I?dHj_s!>}OnzX9H4KGb;vDJwwM}>T6nHN6du4i&ruNc~N6y&YxMT^A|EX4hzw;
zntL-lo@<{tzO>)B$+~oKVmD=QStJiwjELM28-xc4sFW6P0|>Pc;h@<y^?a61r%D1b
zwzu%frSiDW&^p!a^Qou?XhIl|Apnw)Fa-_*o_H&F{uCpIQ|7$bKLH{BNP*qz#ta|z
z3oef}L>`?MDyjkLLnC&1CH-uWO_}8^3)=|w5U7~ITY`awy^jhymoOr^3VWO{GWwHi
z%Tp2}u|FZYzY|Yx*mOG(&z8C)=w}vT;I>FFU;=Vo6P{jWOVAnm(a$Evb6dK)1j?08
znSG@TdBjYqdxO*55Y)Vzg7flG><fdR7L%?nivhdMA(yeLmZcpM955m$yYj^ko2k)d
z(Y8(c+920QgpbR{HpuP0c)Vq9UO@3dgodqU_k{3g$Z<B`vqR(i<f(gx;K99nF4fG&
zZ{NRLC63uksLan1I$KUwW&1`_By1r+3=qHoJaTi4^Y*RqbL4&PfPBXV+$+4!#vW^v
z6DhpR1{h>z_#9kqRbp&YP-|e=6VsSMIahK#ro%$iAUVe^73|F{)dXx6+Z~|^6B9!G
zRpi)3rn1t<S$=U*Pd2a*I%|e@NiXzo&i)}JO_3Mha78+voH>z{5fEbos6)iVLE0l)
z5{R!PPx|s75p<Cp&D3!uVW$V#xzrKyzq<ta*cF_mJ@FAJI`c`XoP%Qlep5xDcG5=z
zvMi(={?;cj9{;ocq~LjT69m3*Cm*~7e%OJu<pIjK!k-P*e9@H`@8qOub~F4G__<Co
z%y3_t&IIL)c3oFB2a)F$9>F@H)&`V{h-z6BW~J-{XO;a-mO;-cTcWJ{y%VF#2U}JM
zt84bNmh;_xBNFr(<fyK{Vzi*{I4v#QGZJ@53}>2;EIYL9e%j=Kp-c`9qG;A~xp@pO
znvGSl;Pygyg3@A~w$rUI+OQ&o`C21r6Jnr$cDPfbv-uuV<o)B--m9aNU%EdZ9c-WO
zAMABcPY=StHtNJ+0DdRv*<vW;pD*%JziF@*{s@9$3k&m~(*eU=-~H}Ee<vOEERAx`
zrG|^DmWr2QMO;o<>H?5He$PSf9PUp<2+cq_J2C?s$0=Be!RP3%obK)Ov^RD8qHaLm
z>Y)vd69OPbW=g<MS=S^SlhN}nydQU+?Rasp{jv))s%!<{RyA@);R4kLGA=&gi^_oa
zEz?6qO-ICfa|g^alPG#A44A8I^yPzPSDhyp2=lSil(M|?p{gh)SHo_U6;$rdQ9+7M
z5>8m#FqNs5+QXg%imbi?B5yCbinfpy0ku6*7WUPoQ@Dy*=0P)5xoXy1r(|p{i5n_i
z86878JEJ5C`UU(6f``*U&H?NzmYJ>Z2rl1^M~^%_bZ`k?tpL=p<mUFM&q}7-V$#;4
zqy(v}Q^J;S;Q}^n;?PKu4)7S&O&a*Eqr;aXl5$43TIv!?x%lIS9AkBZW<$d~99EVw
zY81b|Ta8-cwa>f=t%X&EAx5maMCAqIO&ich?YET8KO?pC*{t^=qjDGajgg?-PNX57
zEs_jI4%HMEM>w&Wd$3&4e(+gfN~Dl9KlmJUa`$d1^W%!%eqe67{w<C9l!k64A2iJ^
zZRa_TVoLX5duPCvb?!NmwL##$LkaDK17v2=0=|SXNsK87s`6L}LwH=ogf6Tm$barG
zlodQgkue|5;*sN3xOsqzRC)2x2M;`D+2SdTi!x_r?jb2;fmsm0H&fr7inO~^j3Rw7
zfT+s)uq)X06(9jwHH;ZZu#w>w!b=IYQI0Bnr-hkN<?v#bgPJ|A0gB8Uqid3KjGVpj
z=EP|Ks0R*E|3gw<=I2wBsVvxDmCSjTqAK_xJ_nxRi@Ep6BszGXpm{^!juo@fw*YIk
zhfBquwU@x@imh9WDU}a_xS~#jV0G`qz4bQ#5zqM`0x|W!_O7+ubO-scvfgS{2T*J@
zvy06nibDd5L$1PQx1_oqE9)_sd{|kjP6uI&dq=xucE}OJ$efBMEl%aslKqNpG|Ozj
zYh01jN-v%CJ@lmOT&ZH57}oFKn%T3@!3Tr>Ylf`(y|!>jjxV##BHQQU2jj+iJ4AyI
zpS|rhSKBE|9h1!P(bnF_fiE^+pQrdjiT&Ea-DSg#J4KO@{Px`{NyH<FrXIP4qMQyq
z>8M#12qpzOHG`y&a@p`2c=*vYEkQ&$fxSm_z^2>5c#;h%iA++A0S7c(=WLMb|M{#t
zsyihPwqK&w$KM<x{P_M^jg>bfZQhlDePZPdzt89q)Pfk^X0}lWiNoJp4>le;hD!tI
z8-9Tqj-Je!lHWc|YvQ&SuFRL+^`$7h$mZ)=0=}Mwl+Clq`!^3rzxhIJ`XJw7@!yus
zD#2xuz7yRMi3l4HC4mZAL(yMwEGnc7R&J2cagjH@eMg+b+>ryW5{uQ0dKp{)R^%+H
z0a5ZTY4+XmYyy{m=IFZ0@gQgR5++U4B}QR-Rq(f^^@Nn)`eSZKzrWJo`u<)BMDyUD
zX_6eI<lx_%FhBWQa&YvryOSipE!GRIjJ_a~%b>VO$!3%HSS7?9gsGRs+^h8y5xpUs
zC%$u~npGnRO42`*&@RQeg0qY!ZHhu$J1UN*z9*7z*tmeeril{>sr(EXOOZ>bysStw
z;OQhCeW2X4A6Pd}Q!B{jr7hgEktV5xwJ}v;$U{12>n$5y#wkiVBZ<2(n$3=|Bs3r;
z(2<=){<IRb!DYkngN9i*?O20cS*^vNi=H5CUyt%n;wz%QOFD#ronD$0gJS0y0^5rT
zh720BVWUU7Tgt(AHIaHRY#wXb{E3VT*pY62j(#<RkF4s=jR1ps6=MURu=2&-Pil<)
zP<s^5xwXk^lwGm(&XXe@19Bx;M6m4v&Up2tXE`}|Q7)JPM$E9OXqXwtAie0hHWdix
zC0>B(ReCMXN`NwED5?mtchcQI+&}I9ynV2$_B;0s01RcXM32wD9DHJMOG*YTY)IH2
z8Ie#2V){@;0hyyz+v4k3BJ;w2ngC+}1hp{C5dpNNS`@Mc(6%6+_A)kavLs>lg^f`H
zFWrmX*@WYPq*>clSu&!<$byR*gnH;fEM`ak7+UyJ2v9-sV}m}!bvn)z+#P;jL9DZD
zR3EMW(GEPi5ISM@P)P+@PPpv2sG*jeT;=)3kz>lKJlSZEx@77LHhY#+Y>H4fq70P(
z>tOd3o#osW6A>h%@3|-%@G1)~%c`>jG<um$QRlcndc{+ZI`fFW2vZy3DEA+)p$E_7
zM~@yns`KNZ`8nq3b|OA8>e+$1F3-DzhBuCu*&rPwab)sDAhbQgr9s+WV%5))YBUG^
zsfR@xjix)KBvHv8Lkpb@a&$<SZDI{|X-FSi$<iL)C<RO;4nqXs9?!QKm_qu~xVOj%
z=DZb!zgtZf8a><MPPE=_akT>f_EJvJKH$@P@K*QZz#c{Ma!?AD>d|DpGn(4cgO?s(
zI-&|pDz}A~<=~pzV_`1x1uMBqu9x;}6(p-EB`zV$_|#}GF%AA-yHi{~OmiP**3?Hb
ztTBk4V{TlY$rkB24J6=iv5yrqJS9|8kN<ALwcc;G?w@QQ?y`58(+*AGoXJ}|UcreN
z`eMPaEuUiI8~fRs*B#ol*H_o>YwKn8ojRX&fgE<x{!mN|H&11-pvQ4bhgUV4EK8p1
zHi`{P4wcUmaOPZ=-kdjb_;qz>98b|NNSfkWfz*H*O(oqt0_odlwxWP@fWH&vnxX4-
z+Otn%jE3U0c}A6Q<vqa)<;FPMsOadC4`Vt{7lasfxc7=s$PEj+LX<X$BT%Z&cm#BS
zM0(vdfvpa)R&Q3LP}g(dh0})4haPv<6D1k?QlL+zQd{zY;r@jmJ<q3`L`gDny40q|
zphU1X$CAM0?V`(GX+~E}hmEX-m?2CUZJaLowt)HGYkjmAvr|~|>{;^HCy_?xBx=LE
z_7n!>Z8q!zCzKa`s#F%+o#e-mbP}DrU(<TiE!5(4Z<A5k*}3mQj5jpp$7BuqvB%zN
zHt!6+QQlasN^D-=K6-&g=gzYU2X2)E;IK56wtYianwMwE^Y$0_QWPMEq#GgJB5mNR
zkCE)&=;XfSOusk{XLufW)k$)Qil|pKG~6|Z#dL>O*MC)8TN5u;EL-fSs+Rt@C~oZ_
z8(mB<l`r5|UWqJz;<|{!SNjO|LH@*hc!*})<-y3Y-Q(kv><UfM-U#ixgWS<{aGL1m
zU?h_|%sx$<*rbxuwKvEqQ7m<%tzq1s@p6L>LL;{V;2!z2?$Fmqw6D(zybQb7STBc{
z+6uKQw)UT_AT7?RGAq@whCS;Zy?EhH(;c(ym*OO4zlD8m-Ge^>E^w`9Jdci(&DZm?
z)!xE_q!R6l6PbB#c9ISDV-5nB5Sw8&IF|B+ih0Hq4dS%zHrc5C4k)AwGoxgud-Qj{
z5tz><>U^ZEJo&eYdq(k5d*W^e`7jr0!%$~A2o#{z-8(sP9V<;E^a<2r8hwtjgd3ca
zI)BVjlm-yOMS!v?RyE;;kq0+Nh1fuv3_}qqJUE?P%vi52ej^+*vIC+uDiq{WO()Wi
z*!g&XD~1D1*9C-8^(>M0YKhQ+6<O(!C=H5elni*LSE%=E9-Cp#3aoGmHw}-1bOGVs
zGD84Mf(#)JLif8Fz}-&dk%h+4xx4R>y1B#07ua$Zh{T9i7#*D$O6zd1nQSXVx_7c>
zL&r2utV9bi=gX!%$UbJeCzr$%u-EW}lstTd)^Hx{?0mqb3`&1}l?llFgxMZ2+*gxV
z98CKxS+741mA+_^pNkduzms4N6AIr!B4z5K5FXmX+=4##0q<x#0U-=4s1me->jb*(
zYJrC~{R<b%fAQx+`q2(dtWrHG;1XrLVyT73X5J|p3y2wFib_0~dR{oF99++<c)24}
z_g=!u5tX((+sDRa;LhHu^&M0tQ({lxY6;k&x%;(U<(teUO*owA-75>xY{n`x6KuWk
zEAF6MeCVcSih{`Zp<@STS@l-%)No^_jU$-&{oTErd@ma+Q$?(?%Q#_=Z33?3;jZC<
z0O2eNG1rdnR8OgZ!zFp}r{^Is9Sn0Amif$%mTR<qHqGD9OgG3V>f;sDH!+|FPn~_4
zpmxP0p@5@ypD^mfJr(+}vR5I~!iULs=!hDUOv5If!j@UmeSH$&a_UfchZ-EH+4=C8
za#&~d-u3`tW)?xix}gNpm&FyA|CY`j&r95M4_}z72*%KOD-o=>+rvbyWyqWJrF*oo
z)0UDvY2y(vvjCv7eztlh=nj74IUlmBKOH$N6IUN|?59KaNTecfRsw)42W7uvx++mN
zOixI@#p*;$rA9(wPIhsFBON&Dk!3D6v_|s#mv$!Ygm@nEt!(oxd1WlUupP4tv(M?&
z>c)tV1VEeXgu+L*jmtmY2L;NwLs!KUISaB*^gCuh1&d8S7XE9N_dX0P!EkOJIpa6b
zY}4|dPHirFDi!$SX%9wedDO?jvB;#KMQ~h053In60{1ahS{8GH@<0vqS%a)GXBj*^
zQ~eT<aM4EqYeuCJheJR-K!w3Ivub65O8(V^g;rATlw&cx0eu=#`Gv9gZCn;yK*or{
zy=yFt08#`{5;lK1(=i!RXkt2)xYQX>FT!R#Ez~J#&OuNbmh8VIk;geXl$kgU0K~~`
zL}odnvrelJU`<0a#g{+L_HbDTxT@t$|7?3c@NG%^%mOH;J5aQj)XwHRKjX8h86y97
zzIO{kRkI9iZ6$j@@9&&;PhKA$?jOE%(3Z~3hb$Y*(qMwlVZs`2{3VEKE6D3&22@RV
z&~}*;ua8x|#cc;Kw)YRH3&YP)Z|ni2PPx{rY|eH#2*178Jv@4Kbh4*NZSJ6ax`a`5
z=VT}mkeJ<5=3k435FIuzHOR^s?fk}TZey*If|Ii%O8FrlkLkMr#X2yd)8aVXp`e`a
z3ZBhLW-7RiP{%mQ$K<AfdM~uY8uT}?UIBtQ(aRTZcv6&--bj-lT{-ZzN{GQMC2d+C
zy9L%zA9D{C5(g7}er?k40qZq@+p*Nu=NBWooAjLO<dEAFXMK2Ck{nGo6wHT|XXR>S
zV%+YsfUkh-l!rKAmpIBUkJYWG#_HeB2Za%LoO1NIqpx)~jyDTQ8BI21N{^3zrsPc0
z9~U7c!>X9%NDaf02IQ$=lqvkB_M_n<2o;NWl2*j&)}WvV9#S2%{^=N3bIK@Tl)C%p
z^cd@3hY<0~MN%F~^<6+oP`m+1JClvl9$L(sYb)z(Yb_2)C#9?0xejvsYF?K{9$?$o
zrKuswo48$~BVpCyT)*s^(VuOZim<o+6s~KWxT}9$@FSP!Mi^1)zLb(yT}(2{F(o4Y
z>guDlwOQ$Uk_m(#t<4V5!{EjtRZn-TS<=eFS*}0212Q|XbJGcB$1;;`OMxQs3{H6m
z5#9dx28GjO_^I^0we`2ZC6V>`Cd^h7*1ft$%B-vA`s(_l_5w=<3bhVjwOZbqWq{Y}
z^Zz7CT;|T)4G49@Kg=595PMP&d76Nn<2r%>gFt-0%n&Z`peVe5PRtY%c;|H+t0AF#
zw#pIO{n@p>C5f;$!<(iLq`EKx-TU}zT)-wEd9X!{NDI;LXCr2l90vfjD67Ea%!r&-
zSZ}Jl6kbx7ShjQI2LW^X9H(wGh%z~4E&?{`G9ea-MFy($!GeJ4#DkJ*YDtn9v4$({
zBVi<#?zuR6vL*}lU~L9QK16Zc3%0?vr`QYZPd{Pv3aONFLsuLRE&>pFzX(n4p?oqM
zp|Tat@*gwtz;aj(qvO3O(g7=~1DoB{Pxqvn=zKb35Up^qA90H=4=Y?{!pI`{#Gx&z
zh)%>!vL6jG#~NiV7S<4^jMK=mGL=X72repyd6nQFnc>BWTjoniJ+xryAnbAtafwl|
zFy@&sv+SulIr3IUfepu=l>H*!7~}DkJ@)LL_GaYxJN1#uK4ra``tV^vFu2G{K2Hv}
z#~Z2I)3#~oE`upkl8dKP>IlPpn9UTpFBE3oRF%Y&Nu@Hwsq$~dk*eV#CK#SBG2G3W
zj4_AED7hU9)9iO>PN~=-@WwY}iliu9o#hVQ4hcBn48smh$jXxCm36DJGZCvR+`h|8
zk`!Ibbz1H~0jGDR<bI&^#g4(RR&}fT4s2uv9ehJQkgzUV>``_>Rpg9jhB5+S5h6Ho
zBlMs(*M>X^yX|L#X?i;gq_!1g+j927VGpYM?z`SnDG$J1yWTd3w199WdUOBA41v06
zgx%p$mp;WjJn=qh-l{Wp^<AnGB5ahtVb9O<era_iab}GqfG*))cZT4Ma&fX2v$KpF
zyg|HM9VAw-icvl-CQW%}J}WTQ>Cjg@On7_5dxJi2-t`*j=MuMO2Y<@Jfy|NEeerav
zCU)L2Fo#?#HX3E0rrrLTuUN$x5p?2+rHjCi@SXL1=Y4|fYxgW!?w|Ql?C=Es_vXm<
z`60c{Y7p^nu`u7?e)Dv}w~y>Jp9hhZa}yTe!K!3xb3bR>yn$$aP?(RSWH;%OXtaeT
za`CUAXZ*#SGKT2*jGWM51va;LS>!;ES+zwn7*bX2E)spkG0lbe{6=$YNOm7h9AL84
z#5&`A8@tb=!9$c#A?Jh&IpDQySpRG^8^RMmuY&s{j5V$AIY{ocLIm8pMXdPt!NK46
ze(AK5AEW)*(N~^P-<$NONVV}fAYwOV5AhrFQlLBoRJglRh}-?e^K5WBjkcLZo3<ko
z8Kpl5kM3;=7RB2AUU^!5LRYKputiGI52}_niJ4fbRTFafvLFNX6-Kd<JV_2?s73H%
zTD^Y4ZU}Qe(3R#yA3jManHXTxhn1B&$eM_?FmkmT{_6ge=s7V&Oap5Nxjov|qk^B4
z!eIVecPj9|hz@g6*I9TC#?(eg-fk*#D86_$aq#*ER|>}S^JGPl27lr1e;<Z~wQ6VV
z#WBvEwI6ckU!bveHeXZSYQ^;xJLEdQZDO8hlVqItKCD{bA&vovuK`15E=aE^nIV*k
zqSRlP8F2%8{^mlkpUp#7%R7V_X==Y9D)M>wh!h1EwYs{Rpi>>C@#4&5H7mG@(A7nY
zek_0j!&Sb5F4e_Qv!fx^(?@c|oq=zcXF^Cp7rnKQUWE(|{cgwAa7T5FjcSUGdM8a}
zArx;D%?gLK*Pqog#}w{9*BE7urWKBJNx00V<YPL?MQ0p#;XD6+%*&iZr+1%M6BT?G
z-++mmn)mL>Tw2K;|FcT_fX8?rX>kL8F=uDzu^5Z87jzIkmSQePVdyp-$P?ORI+pld
z{f)QyF?R092&kw<{E#np_FhOO^@-zWLnWX%s<D!gNG2ZwBiPicB!fS84u`Mtzgr1a
zfX_M<4$jGmwD-0IP3vG`<ng2!10|Yfd$fhk{#lzl)kI^1^w(>=Qo8tuQ5*-oFn{kl
zKUG`>SuQ-ghUG2qQcB2X3l0wleYro>&2rXCRRmEUcS^!DxOSC<l8pluMY@WxD{Q^H
zcYsPP^}80c7zqg=8+@pSvt3H6PQR-wn+y-B5N)y-`G=DI6?vyEQQQ*&AVP>}Jzj!g
zR;W@=T)aA`5}Q|yL(qg>b+GscISO`mFtbrQz(@shrOisz(ZSNP5#2WgdlcQ$!7Hl&
zlJ()N+%$j!?Z|ZyGcG-%1?8<J%Q){*S)rU)8GF<^(W<Tk>)Ewo9ViC8LQP4tgmlbm
z73R5#=r5-E2$fjDC$9B1j`|TQyj@<8dV<yF1O*+NqSyYXotwXuiSCX13$8()Zuk2g
zN*}j>en>~9+0YMH0HBTb4c#!%S8fe;s|EsD&d~|#Pj!HB^L9likNk<7pNN`;$ja$H
z>!5@Rtn+J3n}`@ht{%<9qtpEtzp&D7Z?~N^WVl9^=NGC+*O~F=u#o6YPO@`y5Nbw8
zw@O)DMg^lBo$VbAZQQE41eMuwsGKSgN!d|KaOqio0U|{)ySO9{XqaACx<V}p=|{@3
zq~ip}hdlB~(I=tdDd*iAI%@Y=Pq2$QQYSL487F)3FF40QPn`{OS3r|`SzW4_De!Nl
zR0QIAIJvrr?A2v)(J+<s!K}RO&_CQT532?ZV0ws|_K`B7G*V8BvE!m7ag<INy122&
zrk*C}`6tw^k0;rRNg5wscB_7}ysLOunj4uirD}i}2I+BCsOjZ|DteG*MAJb>H;0@K
z+9F(1h+QEeyyEdWz@Dy6>>&bSil)eEtT$Cu+d$riInWJVDrJU|)gxh#E|5#BkUNJ*
zA-T4S=4+r}L0T(bow1H&Kios1X{Bm&2;EG^=crz)<_4lX{{L9>!aOl^j?ft4GGn;Q
z`Mk-X$(!nN2q4x>257!lOR;NSi~;j9Es;MV^QIsKTL&?xq*}f`%LS%+m>Lfmzc)n|
zU$sjV2mT1@O*J!_LR@SNugj)yUr3(Sm_h1*e*ZqDYatU~#QuVg#Y7Z6zXkFi>D8jc
z_fe0xdD~v+BDY?zUPv=e?@a-gba@H-W^hv0=If~N7rH;TNvFgATdTN=J-w|66w`fN
z6c`Hu*g#~1RIiSql>EO}{k(bK+5d&clyseBfL!xdxCUd&O`?fLm8zL^0BpyX&W&BM
zS+j{h2Bzdq*E(pHzzM9_-<~^kEtR3ak3V}e(HUlfoSO1Ap2w@_k78lDTybYeO&%0x
zC&ZOTiJXv9=uwQyN$U1Sj=XSA(b0h}-g7wga75o1XC-UxSdP*2oKK1E^A9e`u6c3H
zY{kFBr$^_f*W;}DeE+C>u>C)O>ApDG+p7e1&Oi>$#?6}ZT;;;QoC*g<W!%ylBo_3e
z|5Vv+pFLiHyC(1GM%({R48=St^78x7uBiHd)~{0kw>QYU=(tjhRxiKO81w7@u02@a
zco5Y8eZ2nY!MFOqf5uNMhj+U>2m3omuU;J;I%UKCr%pY@%bXC0N+M2yN?{jbEC&SY
zbPhliI0tdc_;{aaNus24xKCFN5*j6dy-V1G<#HtUT=aF^rf6a=shd%K_nNPIAec_3
z=EGeI(<V&{OJfuA-@^`jw!=~)wlJH}+<yD{#B|;HkdH;qcKgC?Ql|8;7n+EE@m*}$
zr6$*QbsUQCc7p!KGmH_R^1soevu<YYdXFdhM{G|D`h0M!j!ZEE>W2csL0-tmmz1FZ
zuPyzonT|m&rG)<j66c<7C8r0SkL#-&Ew|5Q`Mj*_7xOt~<xRbF*AL=dQx8DuJxt>o
zd2cXd5r&R&DI>zsPS%@EvYlcy%7i%u08v1SAaS=W2Ou;edkq&0Rk}GBmqEC;^8tzZ
z6tM%-f}4Ge{!yzYY#3(|4AG>1;onoVt1ScD=p73FPn(N7$yO|96LS2iE<$EW)5e0x
z@cb+XX@5epXP=$w$q(PHBQnk}F0Rqq&Z%cXrU4Gg?TXzaS#2;*$z#}AURx90P$g{6
z%$Q9uae#)imIYcI(JQxCtPqpKFjA*Siu|9z<y`=aa(#aw>6OZvQ{c}4%s3F^DCd-~
zvcv*(CA)i)7KD`uDW)`{)q=!JY2heDN4zG7l2{epX(u1t#SN~d9xMSkr;0z5^h%Yl
zz~IpsY2t33iLMq|pEyor8);NYAxN2TxR)jd_n>2=gv2Yni*ZKru_KVMFiViAc%_sx
zff{q<3<f;MQXCHfX=tj5SP_(Rum{FB(dh7Zmy@AJkm(4p91szGq|XrTaf{*4-sE~b
zEm~SgA}>?jl>o>0p#kZG{(^k!IUaEDj=&H8v#+#ozgzq&{NL&Ypa2CLeYG)e;Q!Xv
z9&H5t-=oKm*1z$8f5vZl^`h5Lzr+8G3i?m+@jK@2Fh$IF1NisK<#agscC7!e{8i<@
zNv|A(=)KzeYGcel{~H@?YY!{ufBo^d^Z#f3?i1g&Q;e^rPWnzO*;reDki1HPf!gj%
zMY$t*D~=dv*P96-$>WEsz2s+Lb&#cAUwuf)xp%W3e;s_z_C}VFsIJnhbUIBs(-h>%
z{QNw5I)s1!+eJnxqk)5bCJ`<x;`RaJ+sV%3hbxqf0XhQi2{Zh1Xb(2y0()YXmpC1*
zMTV$Ng90a*0`CTM4twYF;_@8~1rNrv>3!BJg^fYFDuxo|%<PgR+owWX9}7xUXi`G@
zZBQA;kw(S&^eW|8BuN+EPnObhB`=rS#7U!8GaaGZ-x%W>DV_%%uPM0?d<wkn^qRx8
zu)xblt_L9|9FzdzgEKS{43Nc3H6jnY?59I?V}O3rNnV<ARrnzXxUs5L=ZFdBQS+(R
zMe^-PDZ?;I5~FJ@iU@zP_m{gk9Z+(=qr#n42stHE91gPyCf7(v{uA_&P#~0cNMx9b
zg9*^7=_Eg!Q6g372o<xKm7|<-MoX>pQlOB;&LsE&2mfs164p7_YeBeNStW;`bCg;F
zOPyp0cgo@VB)KkT<~=JodxJEWV!inCYEp=kP9aCdf)Aw#Y*T>`_e3G8Qd65_;(A!Z
zX^{0Vq~;QPw{nZ5U-V|SZ2Ogo7Q-Kw7shlY5|F3a*)R)=RG&>YR+DW6EM^rhW@u0r
z)Gtl^{TP;pg7^^5Feh6^bvEyd10){Ohg3p2Gt`5p3JUn<fn;<<*Mc7BfD)kV0Yjvb
zDH2{H2FY9v5=h+xkIq0}_{YDcgV}JDulBH$-sNi6pRwp?)K?92$z3)`N_v6khV}su
zzZP9CnReJZu=?5KhXat@23Z#mcN3nTj~+iv=)dg*llVS<*q!pnZ~yx4?Z%_W?@Yo`
zeG9E^)V}%?;qWD&8q6F5aKv1_*HiR)qjasAiM?i5NQ~rRcgRulG=YKOkD98KBq@G`
z#v`k+=P9nedpmkZ{%){<=2|<s`>~y9uHN6PlN_-k4?#6Gbme?T)kjJ=$Jxr+^~ztB
z{@!xFFbQbjOw7*Kbn$_#ehF5l`s)*{!Bt6h>34$vyqm0jIzNAx{6~TtM%i5h^9VQp
zV1ZFh5cT_aJ|e6?t{?*3f(|0AKc0sO^!Cp}gu1;R{ol3Mc6Y-qfBN(@x17}1NF}A1
zA7!B=Y5^?C87g#&31_S@$xkqYf<5b#?BidX=3kWk<}dlVmPc=PyDtx4?{vEu$L2hQ
z8)kF?PhC4#w~HFdX+G+nl~?Kb@xvzO!ugAFgENB+H3kvu3+^AD!o!^=f@5vX{+~dD
zd;puNf!YuzlEA;|FNE5Ycvsj7b`$Gp{c)_P^~avoj#@t0fHo<<eX#LF^h$2EXg981
zqOuEeqA4tI#T(-zDRD9*w$z^G7c1B?UaphgWe)cOVsMPILsOrudo&&2Mvt?tB+fC-
zNEH$pQVJMcl5+^-QBYgmSPkMg3{Js}?A9dK1F}|kKo&iT2?MF?9|*$R;Bh3$Z<Q+g
zKm?NL(ZfFrh(2}xuMb48UT_Lr(P%{rs}gPxF{jCRpcDulxJ||GRKO)@PC8`|(}f2e
zWh(ASuWk8Pvdp;-mg$gb6*GQE@%NOJ&%C9KQje)@lTcuZ{l~IQIz2q6PrlP)2g>$%
z2yV%u?3ITYZI54?=dZ&V##}u(>cGP+@2oASXs0byl-r9}XOHEYKp4Z?w32O@@=IKa
zOANB-e_f%A80Zf5DQS`w`6Ox^Yp3143)B!7FrH4j(-sYTH~FC&t-%2F0H8P7fADk>
z(dKh7FrZc=wAVN}k#bc`CpSae>`_w|@qG&uE3ofdbsf*P@Luqz`yX4$vfaC7THKR)
z3;H2o!-Bo^+CGk7<MTdwWIy4nXMt}X+HW=<F8Iv@`^|%m1;5#_-#lDf@SAn#n?+$D
zoGyF<N5^gk;oZG0y~YJu&;|XkA-?D-uywiwPdNVKEaPlD64UY5Rux(Pc(m5?1jwwx
zBbSf%sD9JDsi!RZ;s0xt#W`K|I}z~9e<Fb~bOkTmTa%gQNLGT2YgPzJYXRZ|U3i};
zNEYki5zXPYlxTEoIyAa96&l@|290h@fkyx3>Ce|e{(ubK#JgprU5_$uRye6}ZFRg8
zeA29!Ndm6Pp<s1n?)HR@VN1L%{3($7d<tdP;E3>#9y>d<_|AL<&c&O~JhsI)TwjQ1
zvF$e&V_5754;JHA><14QV^!=2j~3%o><5n*V^Zt~KYSU7GVhpwO$;(l#Rj{j2GaHk
zy0dRmK6Z?{!I~9tMVB10BLQR)HA8aDPUzRk*`)Z8jZ6W!fOFAv9T$^*o&}`ZuYR=Y
zwL?2tDF!3`8K+)1t@-G2vI09ak38SVC4M#T!k=T5wXhSe<qv#1aclO%CmT2N7CzCq
zk+JYe#*JKsPcUv|DSUEqBR}C0i_d2!7AF;7747OMhf{zLxdE(YG&_I0wz`U4tiNN|
zNl|C=rR^lzc6bLI#Ig@FdOc3Ds35Q#p2eGj(Am^X=@QTnluf%=MKUR7(|iQ12)n&f
zu%slZC-O!1W{OQCV{)i6jc_C*%5rEA(-$%%NtAH82Y21i@Vwk)YSy|tN`9<rnP@s~
z9-Txv?6z+3&4AO2eq1MfI)JDee*&rV&jW-Jia!$&d^Obr0y7m^Wjvy|i;H9|agb<5
zy{)I1B6lQ}`T|8f19FZoe!hLx1<icqu<Bt}4OgHM;6vE{Nkjo&nS7`N|I*1<b=x;i
z-cif@lmE~5LHhRl&-+#U|0e0Duju+mzq$T@8yk-vRQ!J*K7Q~m{_9WqA#aj?N>)~q
z?PQYn^H0eX173ro=@On{-TgN3iyx8~+1X@<ktiE$>wl9*jxS-4d<lP8!ME+ClMX(n
z7;y!Ejn4ByJ{}jz({wb=C)uya)m#kIe30}DtdTK%Mn#e_V>b3h1#d9&%1MRo`U2Tl
zm65s%;ghp`gtNnt-IBfPD9D+;>$p^obxdq?y$tkoo1#Ex-15lD%l9oanJzexY?w_=
z0n5tVsL+K>s)u!6hf-!Q70<5p3^QBx4BXf=s;$Kg$z==!ra1Yy9hfs_JF|jO$t{hm
zIY+0Gk6fVWRM@vHi_J!7A(Q&7*@z39cIA7p!H4(JXOi-B3^7ayxCqB7l6H;qU3k7<
zvcAJCm&6`fGQz}7Fe@%PFe>a*+5!w?!c?EsM={}YVP}~s0!FaLXrq3C*5!f{7!1*^
zPh9ViU7qA0)h*5U9(0h3m^SrP9ZzyZIS%z<>>@8plXw27{Z7(3dU5(@`(!VHzmHFj
ze%{~R+fAPT0x$QHoulJlPWE5^bejBhbg;X3(n+=tcj4*b>B;`{*QZDDpt0S7FR5w*
zzS}<hCE5GO@yTANlN_BS`>&1<_Mtx*;AH#obbqhYPWBIX4qor>AHHlS&_{B3bebIO
zzuG^AW~WDO9GAkeDqki?FOpY#Cp$mEKewOnAMBt0LPNgTKRv|ZUch+U$?^8d>Hf~^
zgYA>#`1Q&0QHOfN_3iF=b`G}pU+wL#!W>}SWbfy_!_%bm)AqqZu-v0JhkGZu0B^0&
zsjq|m?dJ!3JRGcccmHH>=M<M^|Jnf{!XyuX@Eq^$?BgGM|JZ{SZJ+$ohHi;g9UXS|
z{>N)*2k(>J?N{3`VU5ijpaVO!^ZI1(6;Ax<1@_Z<{k(I!fBO1#FL`-%v`b*`?4A6)
zzq8kQk{ld$2ym}Edu<rxbQ_1qUI1$F8vcI%y0ee)BcLCi?wy>xKBk1|u;*_8LI8tp
zEP+L^K02f|1F()xe!+eb7_=4b<jqfe@ErF1P?mRkvW?*A004JR-Ig#a!1L5uY;w5w
z@?ihv-r>$3zCFT@-t2ewTD*Dt9c;7DgTL8^kzeETY13eC{HKG<ZQ9yo|3$LB`}00d
zo*REhb%i>eeL)|1+IhY6lR$qpaMgTTPWyxW3<HhbXPA=Df0k0AoUmO#FZ@T@WHJgK
z0nNGeo-~jLLeEeQjy~D`NB0#V=+RD>p|xisq^qy!^DZa!!d}Fq$#x&<%{V(zMH4AG
zXzYKQQ0fA%T6DW+ziZBHM<I!n6cLHvM=a%y00wfGy7&1A?wwW6hrzX~z1qPT@tHKx
z3-=tO1RDuJ$-gJrgIN7~jY}4MO%pJlDI$c@JW4CoEdxjni|GrBLEK8HXv1;~0ks07
zuF$9}vfKs-F0S10OLnuf*~JA;>4t`gPc#b{jy~#K7FSsKyy=Ee4$F&nLes=b>>56K
zimU0HkxT->VsyVa$AZ+9u_+&z5MkWh-M#0pUv^)0UcwF2n-qy$SCoUyf1j7???*`-
zrN$UCWHw}!o%%COzd}iaWP9zTsFb&OzoXxBAM<N-@!2+33?)24-yaOt<s?41N#9Wh
zGVMeb<l;p(l4L4Q-EQoroKYQcrv?x8WoDdUnH<h33%!ey%CB3Ve(GdX+KX4^MYBbS
z0*6h{ngNhGW;D_B=IZKdt6ouZ^Y5P|9#h5{!37u}r0*~65PxvbkEZ9%#+`B#|9^k;
zpVLM=>2_aWGTtu!h0Eu^4uIHqyR9dSblC0wyxrYCdD*G?VDTBAQ-Zf95Jf<a&+5zR
z@b~Zhy+H!g#4|K%RnHke7dO?&mezJ<h^JqKZ%|xtQ^x)Ly!Kf6Ub)l6*>+K}XmUXA
z&m3@M>G%Nj+llIKhk8u<*T7X`kz6df`uv)Y63-2qUAteeCV=WDDKfdOQl)fYQCXXY
zjPttGVw#};o*#1%oE0i9J1Wp<z&ay;Mf6HFa`hw;JDp;!cs-Kk93raKrp!ltNs)+%
zi-IRWkA!-c=C<mkW1=4@`~Yd}X~;bB&PpKY^A#<q+fOj8i84S4gp<oG9kai0nq1_V
zj%_p>o@EoM!e!GpnY3%1=r(f88F@>k7fE}7_*P1_DVXn7I{2Uz%aw?ozKnEC89cCC
zhg{?ODSd?A)9J_jLVa4PtJxS!Akdv~(=E5~PjegW`!3N0--v6vK`newLH%ZTm!~EV
z+_YSI#v8n)e?uQ#0{Rovg7?4_lEFvA^piftli4}l-uXNJFGvMlV547kY}29`^0$n$
z$3UXc6$(Gc6I<A2w1vCC`lWD*l(QZhNZN3m3X=oOshjRESPnle5y$Y>tBUyXbmEqh
zau&DcEi0^I?!c)EsL(^$1*+u~sV;PJE}YS_JKFL_B#)OjWL;UAoA)nl&ASoFs7HJ=
zCjB}*dbRhe`rg*vbf5b9?O=0y<7+$hb~vYYJrG=v=~!|+-oWKic17S6*aA@?;MyT?
z31-{hd?^2+aC5g&Clor6YddrDmba1(HBEY*yftWz-syny!AaJP!C~pt<6>+MrU@67
zgXwd3a!M(+kEzvY%Tx3GFu}MarHzoLWph@Gag;Pw&gYt`?q<twm<DR4l@>8rL@c!o
zb6T({040x(eQ5%9HIq7u6tkgbhne2IzAXFj`3tOH&&s-4(F@LCXx200l8#)iq0cw0
zEuVSQWr4lToiLB`eT)#|k)%p0rd{hsUga}>q#mx*Wq;LMcSUYp2WiG>pX}+9M_-Gw
zf{Y0`LWz?k4Hb##$a|m&O_`*DG~w))h#`T0EOETD_J}%7lboMYmr2+8pzp9>h58SZ
zH(|ez!Q&{4A98?lO8NBRdGb(&Mw$c;h~-C9t>Gb4LtYQ$bBeTQ_eDUMzL;#4Z-<RN
z=2<p%@~x!l-)SpN^X}e5s>0#ECFhyogY{Oc0$o*!6q2Bm<aY-E9GA!Hju)Z<MiHH$
z(C4&XFbP)PN|tI)qVM(+E)J!b0~l)u8y!z4%@Hn7UMw%eKSV5QlCgHV1r1usJ$WeY
zcDOLF)NF(vR^+{`TD!9^ngFsE9Ox30yWPE;d@uhT%?1NZvg&~=*+dfY&+l#o+Ic<+
zp%z>33v71tf^kNa!2F*3gs{n3zhZ}Z*{V)c3l~$BF~&!swY;4cfw>3>8Xu@sHSVe;
z&Mv((NFhr?`bc?&CJS>C+s+wP)}9Ivqed%op4`J!1y^Nvo6+5E-7_GV3myYa*>b{R
zyX6*FHY<;oW4+8lq-FmgA__^Zbe78SJY`qt((IfhCJ)9oBjyf#uHqSE7{G)Co&9r4
zbB`Gc`*iLmvyAx$r*bnDUha#Nx0CkmvKaK$fRvVHAsG$`?G%HZ^0-pc>Wb%RQ2Z#6
z5`;l1O~qc?R-*#MKQh)|Xg)SsP@AL)UQRYJ)n}!Z5;?3l6KuV9aL?Iteb%~H<Aqb%
zUj5>UxptkYn9=WT`Q+h=ONx?Z0*xnt7{YD)<wnZ+R=5v*tw?3WKYfU(Rej2696T0i
z`RkI=u!Zsn0YbvuB{c}OMDt$#Ub`Hst<ua)s_wh)xmQzIpGT!Ne9>|MM(t|hh3f8S
za6U3E`sP05YsttE^cZhi9#=7Ot-a<Cr;V!OiD9;Ij#gZ#%&H<zsSjiNN#zFyzX(&7
zIna8elLDjx%2hD?ln-(=F4NIex=MAym1VKAJ=1cg?YBRhCp;Ut<9A`KrbTQO=5Y!x
zZ%R`NH)o_3EM;*_hxlG-I|bnpo43|A+(hZYY=XY0TXk1}hsdrtI%@N$_k7B$c&-XV
z0&)OTRfrgR>)zn5!tiFGjO^K6_h|`o?;$#ks)rhXDt9w<#j>;PyP+vlM076(sFe^7
z`lV<LsQ30=`d?{E3u)D0ushdvABkVq!`3%fy{y2{MW&Hu!zu^L2Z=)D^MGJ?jsGnG
zVNi_f03uW3&xCdY!_Q=s89$fxUm7hXCWnuzJ`JCgEcKQgI?HlxNnHu<wKaVy{<k8M
zpk<450FST+6-<OYMo?NNX=izPSyHs-qYq15q>M}6I=&ye3)1Jxv`}*)(hSP<{GC)L
zvunJ<%teyo`RX$7U5aA(d^R9*MN`F$5^4q=q*`BRIg~2UeI&Wa$Pvk?tJR0&$Y>+Y
z3>@9E?ZlF^q?u32{{+B1x-f#5*!H*(5DnAjB)4XwlIRwFYtYPxTc@s1Iy4zyTdOj$
z`DC?i{C1GVqS>NT3mFNi@L7fK!v2v^;1L%;q@?E<Qkh#BPbcm(XT$YSvH70Ql`sjY
z@(>@`TM^umu-Br;QnoC+TKwCU6}lHtfE*Q9lu1m*ZOmyk68U5`d6O*xq-NuOI<=P4
zB2sY2Ac%-B*{E;pBr9(d;%~;bUn-~v7z&$ha$Fc-a??3Xf;5P7B|7>myvC`-mntkw
z>Mp*Y!%<<9qd><xYBPvk{*hYEVNGambD0y~6;^zX?1Z<CWanPowk!yGo)^hq@2@|`
znzccULwQ{S2f~9co70IKYLA1aOp_DL%zDcPaLOLG)!fzA?ntCDG>#91z;p=-@{%fm
z+R1n@<EV^4K!>GjZv-G|8P_fuqm-~$Dx<RT#HfO}I|WoJB?_1IMW>LmR$R!(&|T}z
zhj3`Cs;ZHm^|MBj^)IqYS16`$>OWR67df15V0x2>0zF+Vl3=nTVxB}Tnuwq5VK_Wv
z<5`9o&wB-&)p88-KFQ+<GVCfC`0Y=-C(G~N;?&-~-3F5L?(K8>-(C9OJ^bI_wqO6_
z__yH0I5KIS<jrKAGjHjYfd>><Zm&p#O1MqBOk#+g)2z#G5;zcw4>l-$$`Et0kBDM(
zH(KY6)fckkG6_KuGd|1EtddLanRga{jNXwI@KkvQdu7DX(sJpbEZAcCK&DUjQ5xFJ
zYkwrVnJTD|OrcJ3{occS+QXJ+0oV-S-F!YsfuhM-BHOJ^APC$-W3|!x?7e-v3cq*!
zzd<Jl8Tvn+=a?^_YeQfPDZF<A!s{L@l5on|#DFyC;(qiU9l;gm8wS~@yjNUI(($Ew
z25jq2OPN!Kr*@ReXpLTjMx0GpF+VO!lOldA*>JR2SO84e19LF#(RNDwp?(6oVH!&5
zi?CBlUW9)<)q9Tq=_fG~?iNYaTX^{{d6x8AZv847t$$ctQ8hf-ymmqrdINz)(caQb
zoiQ;ssg`#o*9%K{*d3U9P#X&-)<-{DlE|h8E8oa1S)7q2-lXS;Yx4u^3q$-{1eshk
z@`wflIEbMwF(PWYUrwF7&sDcM;(~>ANx_KCrq>q=2+Zcx3PmtX{5!sX=Lu7|K~4C+
zjT4Twvzxo))E#b=m-#umGwEfAZe<v{buEY3DJid2nuF`r+C2ar(fz^L8U&&B&NMn-
zJ&oECk-uCmbEM9dE?w0y-(r_3UffE++TxSJ{b<Hipm|s6b(u8Q8(NpqJEr90V)HI~
zBO4U9wj3i(HJP>`-)KDK<i0#hOC}Ai@X|D;ErowEGnX<OI_F=rNkMf}guw~>*_Jw&
zSL{WD2jPPrJ=(<iyQkgICI*Hj-M3|}q?wMG+bPbd$cL|P)SiS<(Yw>(jEqz?EwjP-
zYM@);$!;mzzM{PUN~qOTe8mEVY2L5wq198<oe9D$Th*9==gO-KqT*(qWz#Dx<hXRk
zvei<5$w*;KKoXs5_9SY-H!kxB*Gu-vkm;(e#SlI3#0YdvM|$xP7lhEm>%oz^!;L>J
zm~~SkEUEE=J+xPeSw6qiZqQi^A+MS#`BE8QVW256q)n_C5#5CetV2|5xiUcmB93wq
z-BXdyk*i#jqgp$h*A=a~xek>K!U*@gwVJjrb#$#NA{#<aEeG*lX<2&LWJJcv?0l+t
z;DWnkI;SOHlB07f0wdHZlQMyd9ev8M%{Q8Hra;Yx7NwywhAJ0u7VcGG)htS;Q|2oe
zAMxn*L7vS=sY|-d<dySKpK{|uZ1^8$RkBZ1r_Y%X5?pj(#9BZcmu_hoo17_2hR3_B
zWHZUCY^TGQQ`En1Tq}{HKP(&<#RtO!>5ZSx#Yo1#DqhaVNGg7d_!7CpgR8jCgj&6e
z4HCw24pA+_bun#VJ+RV;IdUg)Q7Uzs>lD3Kkn0~-@Rt)o#>j-JQq7TJdNB*NrX6g1
z+_Nxc9>-d{H>>@3Z?n(Z8=qQ4kNP@6*geDE-GLk^UfHGShpqaP(qLlf7?Dy>p$7}R
z$m-e4-e;`mrmuJAO0@S?iDlXMt)v%Mi+u*>23kEbIbtW)FMtuc9*sqRZ9i|{Wfg~f
z!wMm3Y;=ce9F)gad#Ep{E8lLYitkf(FHlvtaIu=~-r*3m;(}-AEii-da>erP>C00>
z8z5b5#KV~hsk0X@aZOrPP1GnrLwi$F80t-pPRz`o&?tzNG)EL9NEtcZB-a(Lu7+O6
z(`%!%a!ljGn4Hskl%$Wt7}`_UZI6h7nnhCw-QB9?<Zwe%<9j0j4ImM@myIN&{}`1?
za>LNOP2^_LsR$Wa18DZV{*JFdTr+#*NWZWPqiiCuWlpXJZh@+LM>-&-XuZ06xpXr-
zR&>`@4K>@VL7GO{uBx%d#@23=u=<nq$<{f$Z%Q3<DMH}=Fx_1lvcbUdk(|z?N<t<Y
zx-f#tW^!kBx%}q{q!^42XyF=M;%2PomLG&+Ri`}VQVfoc_hyaq^5?0P9g~O|Ox73i
zl^FPL5~x_N5SFU6?cU7-eaDsubPT6<S{RK!mSRrTe5xN(d2&Z&*Ga}*Dt=!~GakBD
z+@u;`{yg2di;imhG$@Ps?a^VmDcWT_P~01EI@aV-n{148uY$O*TpjKANdK}&`$IB*
z0C)2M*wBF!d`NOsI{3h<aq{&<ZjkEP6t3SF*%?7@14^_63teJPW!0yD6W4jjabi*h
zs$-i&YAmDM`r_o#%t@Ozg;TfYKI9iJnEs2?A;oLL=QJVG;-X^&04bFi5_@S`^|!G2
zLU=_Bf|H;K%A~2$eqvk{D$Li1`u%FRs-NP^gy?ZWhECGSU$Zfw7>}(JtK@kl$JO9I
zY^yepK|LPiQ<9X4xQwXxma&%NO?Z`;Ssj$LY)u?YD*liqI!h-oRh(zipPBenLIuPO
zSILw*Jl!xahv^iq4Cf+bHh}fQ<X?yxi%?&Q)>_vw_8c7x9N5dIvv(;KT{3OWT%C!w
zJUg&!9EWwXMI4*qbe0rCoZ`zhBqMy-cj;6qIMZ~SYJutPQfbV(W>AFZ@>uNc=T2WQ
zxW-po#w8?UI5?;f*?gF?*>d+BkuHSmq?UPKuAtC|FbeWj6Avv0d-l!5!bnzmPlMWX
zf`{G+EV{Lh+cO?9!RiH2nph2D*f49uIYzt^&PWOjLpO-KG6gLLWKT}Ae_@_ydsLb1
zq>~Fue1U0^2ZoYRuUWsv#z((916Sj~Kr>>^C94uZdTa9f_)FnStGXzQ{`qj2^^s9z
z7Yt49Zx}q9k#SuYx7+|c<~URIB!GR2erO6_%25{r6qjcgl$WB-%sCT_Pxy3HpV=-A
z(3(aSJ<_~(6>gM?XJ7#{9`rt>pwD*l9%Ta98ufAE6T}CoY(*j?giC{45ALToKyaGs
zF1R?8sfXQnkif&qex?RuZ5x5<gk6}AF8TUphrsZX_C%(;PBWL;%-KRju|A@t^0eL|
zbNarvy+B^L`z8`aE}C=h>`!ae&EDL+6fOmL>O6Vsrn@t&FGU774mh)%iy@8nrNb!&
zkjI)=m(1wMdX>$&G|W;M*F`onS>Jn@O?7hc{N6p-p=t>b?fv81_wUe?u6&!n^DJok
z^P{}*llRzO#;SZ0je7&&?|mc*3jRlDi5Ys(g}P1d@c@Gog(}IYQzjQh(f4P(OeC(D
z3{$Esg&;{Md`wu|kA>w546v0WN|g&~uZzib*w+v_>k>H<QvZ=wPWqR$0Gxq{>AlB#
z&w)Jwd@iiFZVBtHdRS8<Rh97f9_CCrn#qQfPD?~V+>Q<v2{&QUPK>d)(tv@UxV}lg
z_Qgf*5Nqub+zIHO6V#HE#|qyCYu+T(o$#`4T+`nxKYr=j4y!5`YHJ(ViR@eZoiZLl
z=m1@FsOPrT6#WgIa_zD70<{TE);{F8T|^XAMMrco^10ElYp8w69$QA#b?%eM=av(J
zslv5j0QS3;!97Am7oIHD5+YI;3u$j9hRP!?vJJ-U0>|VYqcIJbolf+^1lr?ny}e1d
zlJ}m_l-rb?#<?MrfOQdrh)f7itzOQ^sCu@0^{7;~ll_-gb%(Xf+}a|HCxEYxqWlQt
z5nhU~9I(`cps>Itwd-djF3|24$-1yZYo50vao9$D2qs}%GB~4x=R6*Z2cTpGq4c+A
zd|6RJUZTS%hw#FjIEJ_F%z$4Z<3-_dna+NV(-=w6`AaOOm-l!#7UmGF3Q7N7F3=Z@
zGC(NEg4mN>&}QUb&K=^C^;FRIISfmS@V5*Z`^dpyCdIOqOYfIL&Wsk~2#&}?t3Xou
zRip^R(lOG>DXwz+HFFF2|BBBdaPBT66zJ6c@|VBpc|m;|D;imidS~ow*AkebqYBBH
za623z>r>i5R`1&J+IQc#N!w#}WUv!T*2vitJ||nb`rIKLt}cs#Wx)2&)xd2?=kh}0
zx#Kkf2SbwP$+5Nl$N?hd2?k?vk4nac;~KDHA!VK!j|p-Y1`~`ac{XA4`9^#ih`XLT
zp%zY@DV3J>4c?9qi5KYQ+T#rLF!B8NmO5e~#rLeDy}wMe^<f0xzQ+}<L1(QBo9SW0
zW<=kQ0tlHoQSIv7lD^tgbx@2%jwd<GAXSy)rK)6L_I%4z3<Ipqp7)Re60SdphPiZA
zb?z9KExq$y#Jr5&`M-O!yR1urFfYSFHM@bsM**~6v*R=oay1*1PD%~k&fNlHUIk>A
z5w)+rD^PWhB-7UcUq+zfkW)wB83m%QcCBWi#E{FKq%&t!@h0zs!D_@xFFd8>L+1K7
zIrDRZY?fL0$FCJ6A+uS#Dkmz<Wq3{c2X{qEAsn8_p=D;`&JDo1fFcB`>U6~PJ)au;
zb3y4k^U*A;xGQ5*F};NXKhc^rIVWEkQO%;_(>N+8`@{4CrFUP;x^%guwAB*2>h!e}
z(aesfQmDuwu#N4*!~N&m2YU?;^RSwYd|Kf>H6VRES$UQmn*Z6y|9Ou8LoW{SfA$>r
zNW<N0FHSg&WpwEwfr%How6`SSS0&{HHkNeVo{OA7(bb&@8`-~LCk^}u`MS1+yc+!;
zEk}ET2g5QOe5|^O@4K$+=#ZAu#lSl1Ty}_@o+Q+e?33z+puMEx?-u7J&RLzwUzs(y
z_FnDBntVM%zjU+|TKDniY%pv~qqB2Ff4mJHj#V{=90_{?qgMW0qKw>h!fBAA!T4|C
z3++x~5(38z$s<t{oUNwP=~Yo(Yxb#^ji=_K;%o|(8-$dN?>RXz4O;T?WMncu`6Gr~
zyxx*K)Eo*-$a=EZh=A1oetZ5KLA4&db`R+JZ!5pm^t4AkVTw6JNdU4JMM8N58$6ll
z&TUkt4%@vyf8ut;c~gdd=Fb|t*`GV{%4{F_vwaDJHxE$jLYukXR#_%-0<hV)!3*;V
zo$lQk9rD8FqCL0V{;hs_zrCEhu-}e;i|)olZ+$!a+efjTkdYhn&n7qZXZPFAd_=(k
zqZ4~nL6g|TEUGpZAR4E}O%G=PT*>9omuz5)z^~9j6e=MpyHg7LDank)eKCcp(B7?i
zzhwL1<q^owa~lO6YNi!;BAC-KdFV)WI9q<jBAsVobS{j!Mj4K(sao<tA}c~teE=B$
z-#f<#`=`f89rbBMo5RXk%IN`7j3vuZjy<@NYSoaysR@G&B3GH1UU}X;7so-|wB>9x
z>NJ@<%#!dBrF*N0hAi!y>)j=v^sQYO?D)e#c=lK3uF9FCYY-9(a)pAgvO05)9Vq$l
zhkO4xwb4zk!bt63<|v4>4s(-c&c>c4_L#hKmz5QV`HfXA72aUJk<0+<Se2@~9z&V>
z8^V7E+0+TwN)lxW!i$U!A#)a$uajnKOhzrIEA_HsKUeZ9VO^3XDLk9W5YDze&E}N*
z(<-OgIB7g?gbRO=u3}DYyZtETZo1^=#0E0ks9q;ii$bf->5IqL%Dx)ypW7Sj?Z}Y~
z?Zcm}S=kBdrW9jltn4E+m~nu&?WjrT9f8C($T6Kh_HD!JKJlsze`z37+5HD+0T8|q
zfp9v>hf#BL(*~|l9Fgk#T7DWJ+moEn<i8tzt0e${gdD$J$w6g!Ta>Wf?o0v)-3C(X
zP_#=hQ`Bp~;UF$-oz%2$KYEpulDj!buTj70_?EP4cPqSH8KFeyHa&-raAZ2jV$C)o
z=~|W5rc?6Ix8)}))YGP7qLmvMwp<^Pwg-4V-)Yj&dC?g+`e*kk`4keQ*e5Uu%*3C|
z{~*v@J+AY7-6rgH2k<85hjSE60xNJmi^A2Iy=k^6f-wPQPa<ko6XNlRXGWvHU3*7r
ze1k=tPtndd{P?kxhuD6k`5GKkDj}MAVlEOMb=~En@RBm5Eke(*_gP7F;4>JIjaxGy
z#OywDZbFS{UciaTlj@OM9u?-Qv<_DPc}#{`1ewODFtTQh;Eu%Eh$GL~0t@$(L#sHX
z2z{O?*juXo2|vQM{*?csnOJV5O>qTP4M(FLVMP8<<RC%{<EnLRAeB*tQ1Vl=YG-a5
zn~kX*Ub_doLaqGddrlWI(k4V0R>`-3N5$NaJ2B;<z4<Hd;WpCJ>BJZTP=^>^yQ|K<
z>N@C%s?LOZP}G}64ClghM%p&y!SKUsGqy{1Zok@fpK3G=YtQdjR|>$$*;~^|Z(*`q
zI9=hDIW@k@bFa<#J)zrO%_*tih7*MDSI(e}5`>F=!}_i3fHp@+Z5C3Zm?!(EKfMB}
zYfiRO*L30-OUS9^`>m+U&3UuI^5ACDu`1p01e3+Ad1u^0Lz(FSf8t=#Ru7!E7XNVd
z@H$e5i&JP+e(2ebPT(tf3y|Sn9{buVsHVxC{${dtr?*63zi*oyR5Fd$+xPDxU63L^
zX_7@jxP8Du(+_!<I6g$MCkPj$Z^XTZCMx{h!cqFt*UGCuxm%N19X9Z3+wr6p`wc#B
zMb>qQvxAkWC6l*+T2~wMDZ10ArpCe&@j;0gUbGMFL4#v;RL=<0sxt}cq4HTzC$dfA
zKqTrPWeE@7VhNX1#wmXsKNWc`N0wi!+tf<(9{$fs;*Gjy;+DENXg4proG$Hqr+4+r
z&`^J4x2udv6Su(}vfhnNy@o=uU>g<Qo~cwNQU<`1EZ=Sblhw}lv2n*HvL}KmS8SMY
z(Vh`9K}Scg;<!rF5O)<P3<T+L2#y%e3V1a1rP@F#=9U{YqPS&&8)BD2FcL0eKXRi+
zoUZE9YgQtKBSzEc{@$2tQ-2m3_1QLqb3nd921RcH2K$i<2B)jf1cTkMh1Y;~&7)U8
zCfjFNU5e8oXc~1&%MI86Xj;s;YDZw$br6toB>C+(Z$eG~2pSlxjXG@Z9C&DMmLtur
zDb<IxiN-PW3E*NH$OP(M%YZe;<V8*AX0LQM66m@1&bqk5#TJ~W_mVxn;yC&s-CS5%
zRPoZBcMIT;U6w}GAgs^;FK|-(v{@UcHw+p_3re`I4EA$DXuESam5@M)oNd->jw%q4
zEjPhc@1MjbXIc^Wqg>GYIE`?Fx85hufSdaf{%<q%HgH<=g`^u%+f0&SMlPptFGC{t
z^>$XKv%tPOJkz*_SBjrE4KW)piU`g}E*9xj<x?FjB#NF>?D&bYFV1syTVrcHJ+I)A
zmjSrO=NNi^=rIbe%(0nVk!uL4=ZyALRdFtRaD!H^LWb+_Ae>OTX?1j-?kQZMysYGk
zj=ZmCnDrXSQM2=^?MRQ2L-?PC1zL3H^(*&?-g|#<z3r^OLfCJ@&^XC=FqC-s8peG-
zUer*phd{lIR*?h}N2xe(V<?2w6*GLyd$dVtZ4uecY7<d!)W|>dy&GH{LM(R43cT#M
z?YlCRf==Na2xgC0lbwokl7r`&Bens3c44ad$KNvMcJMOzH3MsslOw_lS{huty|@aM
zRtOsA4qU>C4t-`q66nkO9h2I(JgI#_9l^#TIs*K88i0+(Gyvpy%);Y>iU5$$gS|5$
z>xxyD!4qdGka3W<o@2pqG#~+|iS9@}3>6$)#{|MUiLX{n`>Nb^GLONorrlmZvWUo1
zan{^?F=t`#-Sxb$3$)j{et|p`5fN{gwQ~(QvOtyLuVLKdRQLwA{YzY0|7$9Q>NO6v
zgnN-Y_ZIhUg$IbgtKR?fFX{Ld?QorXTU5PXZ-0R=czIVYZWsCw7L+jNNEda&LbOGN
z;i^gnRbbyNw0suRJWpn1sUn?ynlDpC<O%quRs*5>eE0gO+HZZYQv5B?KO46YOB|e8
zjB$C9kMi>JdkmZKGr<{Ks}awG9ELn`-)oGoZgyzlY!AjQz2eO6;%?{-9%EHJ7xBMm
zkshsk_!|@6LY@S+Ivd(nQ|l=+!w@HOS7cj&sU3*f^uCiNBI8wRB03F?d1EswI!S$p
zd0A@uYU_f}5yz1*V?V9BzcKr+XEl~%FC-m@c$`bNP)XS>Ntq^@w>J}2;=1--)zxwo
zKc)Hvs({6WIVcMgC%L^){2q?ALSrdcBz20>hn~__%_T2#6uneNWL`l+Qm56ozK%iH
zei#h?G-E%uv&m;x@~Yy&HhD(HVh@jY_qwmJYV7|1-17^G(9v^xtTe9?(tw4RI2kV`
z)MdN8m$yxal8P)|1=I<DxhT+awix>DE;$d+<&C<9c(4urJbl7V`~b}jIW05)8wAAa
zCW<Rsd;{$T39IUcfvIyqYzjocLf_`^G{M_lznlLeP@cE8ApYA~a$GFG^wZQ;^Fl2U
zt926`{PlZLW33qNt_%EG2x2#f0DT7&+f))y30r!s=z<H1ZA@hlcgq?lH!oZ{J6n;2
zJ;rZYuc%?srz%IQao+|*WikAa@>rq{%jQzn?)pMtHRRZIM6o?Ep`r1C_q@WmCCHZA
z(PawqFGlQoPK1&|&~q?qS2MZd{b?2`DP30slf0qFE(yMLcr}N~yNvSEJ`!kVfNWHn
zcuN#a7+l_sAo=YGK`Cn{2eRfIv`QY9UdFSSkYt4;4nRM0Q??W0tS0|XNmi1p3Br=A
zKvZI+TZzeNgMrmECrnV$FdiXj6MtdeC=G*?IP9+yfNk=wn6h4#@NNnJr7tmLd)-v_
zI>dOL3QSBCx~Qkf+t#eq8e?Qhl=q543fTe6*x4}<OT+6mCuB9ieU%eladM?pa^Bpq
z9WE44C)fX3fLt?xe1SzAOkOi)DL>f)@kDi}FUT{WN~OW+rjeEDCzw&1AIZ;*CFwYc
z@l<{N{6qulNMt;VbYHZjb){OJDJ6!JT@YB+tUi%2b<R5x%lnvUo>k+ypmiVUsgviY
zE?^xGyBJR}<&XrdD}_=wAseA=bdhE>A{5xb-b|sy;B3#63JzGguTqd(?+~tW<75t7
z5`Qfw#FW}mJfXEt9wp(T+j+^BEwhZbsjr2h><+n6e4)*jU_(kmG0NOX?o;=qak-n)
zxL%wyu1c7ShgH<om|Qx!{3(t;;=;0+?;pb%FdL3`Wkf(s=%Zn$oIQ&m<7TlvBkb>8
zW<AV^*z&WZDq0>B+zx;NunAHbmhC_ms$iz4IPo*qa1UXoNXbLYvX>`gs1mE!1~FMP
z0f&l%9^Q*Gl^|PBZ>;>z?=Cv^#?|bREc?^-2Q-0PIaxM3b^Q-*tsY|_lVICr{kG+w
zcegmPn;ouSWI|Nbvyi)XvPrt7;_{J`cuWu!o%+-A11C>WCsRh()k+rM5wSj~7cZr3
zfWv)7ifH0ZAJlW3zyD7D8@~ey+XiyvZ9fanvc^~_I1myE+6g6SUICqk+^y6gaO1S*
z)5)v{n~=5I8lylvYjWP<%;4CRcwe$$j9cb}XjysLk%!DlGDVDCMvYe!O&(TF{OfD7
z&6mWnS8eDX?C@v5sA}tidBk6eth_dNBCf)ew?ELA)^9r<k#N_YQ^?Qtcq&fVlm|{F
z3`$dGDl>XoI!X|t1po{e-Rl(-v{_Um4AxgoNeuFz&$17WYqH@YM?fZpz0#f59uS14
zZU&4_<wGQmoy~GrO*3<Ay13k9_W^nuFbA1Q3gsoRyHD=x9nP0o1r{Y)VR^{L<vXDT
zwF?atWb0AYSUUSuwLieawkcqM8rgt)lVZ1)e!F6HW@)*u^}%Yw7{?+2ZiMo;PLWYY
z4-ICs!AkY(4fmC6@k!nxCTCtrttpUIHXwS3Yb9yo|G4|qvW}$6xdq1t`$AS~Q$1~^
zb1R?|u4nD+-g?`<Q;@jjnYe(2iG`re9>VQUl;4#2k;<V2#$skdqk;-CPVEvm@4G`*
z5lHd!ce*EjzG5v+!j(?jZq-v7i6YnBYF;Ff5Z^*&S4YM-4Q{qFthO|@Np_vwP|H**
zO+*{FiW5!|Lpo$qo2Cpk1rO0Gxlkl8PkWQps$5z}Q!=?0&g2RRQC$tAX46HNdk<U5
z9slbV9u4&M^7|yeFWqocX2zrojMeMt17)-2I=oAZYnQkOmk>-H<9p-Q3L_HmVBUmR
z1p8LjTg!oAcsW`K#~!@~e%f&8DD&D>J|t2J#|IxtTzuU8>x%5o{=L|W124Kzvrc=k
zs_VL^qdN<HxT*<@xcI9~*MrrHZC<IDZmugmWm8O_3Ht@ioO1B9GQ~p@sEafRSMt-K
z3Sq@jKruW=#Z|n#okMgcTC{Fs+qNsVaVo|i+qP}nNyWBp+qP}nx_Q0Vy`9_L{k_Im
z_~w+WxI19SK0AuZ8I;@`Cr3Xl7vu1E<6g#b`K@tp_a6%QXr9g`3n(E^Gz*!eqK5;H
z4ENb+_UvAoXG&DXY*OQH>UXinH8KN%rNZXdD4JsUBCpEG>`d-LrC7U+KTd;VaCfQt
zPm^qaX4<$>Dug<M0|pf%IPZHtGgy8A6Jh`9r4+NM66fOUK}Q^KovkdRa`O3fr}vt&
zo3&%9T}!X59kXH9VT`^wt22f0q$|9vdYE)eRa+V>9=i!+ye%iRRc#X)7j);B&^2+h
zFom&~xpU9U0cf8`pby_j=J}_V0?jYe)N&KN*oT?zt<wTgbE)KsOH1tbbF;wYDQp=e
z3$Sn_)VQYJETti=`#XUxC7NZZ!OLq8201r|%2HnAYzfNO@~uk8DD(qX!rarfG9u{H
z)9<50ipA$;;n$2+jJfk*sE6Fr5#wjlMHL0s3DuET9VFR^<XT-{Cemi`tUCy3S<NQ6
z#OU)xX*RKq&Y%Vz=D^-uSak!cp@I@#aANy~SsX%(Rlk^P-OkAFys!v3+E@VFB=Byb
zA05<QMOtCBN~*hJ{{ptle6w{DKckwO?_(KJq?fU3j;;up{sZtDT}v^A+9Mnp;NdyG
z55*MdX&vj~DG!3F{0o%u=eY<C_fA>T6CU%3H_gPI6%4xY%yFRZ?zO3EDIaU|)=sKm
zf_}MVJC6C;y~4>WKNaWHsBV|PW*-iq0^dGfS2ZkHx)o18X+29~jvd+j0_}?HFeg$P
zahduWm1@Olu8#=g7U2I{I<7&)6_weU(<#T1+lw&JhwD+z7N#u)61hNeL0`|pA0hi>
zvM2$Z*(cY+wU{w$ym~PClF&MZUx~?W%9lccHzhTe&q3CIC1X`9D*y2!c`+t)gYxC)
z)2->3wpt=a`|R=BF=2sp?Img>TYi4BZFK>QYF3EFCs^Q<Ew*VFtlsf2|N8!DG(~A5
z6&&d;jj7eZJVHF=P4ExYG5S(5t&?ij-2{5(auf|3vM?B!FN>A_#J4R%o`!{61M?p!
zGYqVrc5)<JE2-o#1n!+Wxg7Pn#$%GK)}o8huW&%mkjOEb=533JUqEw)O~g+2Y}1<0
zj40%E-fXjzCm89=??#Kss~>#)NAGs{UBe58ejAHI?=bR}8``@@hOd7eK{Vxk_V12J
zplm*Q&k>v8D#F1)9K5@H1_SdAJ+$FWS)Yqf(tJ?cLbY^695TYS(XEMcXcmqm*)53C
zA8Pl#c|h*X(O?Q<jmv%+OT-*|LhE6`LKW9XwH2g*u2(jYjO&&{DWiMrpGnkw>>K!a
z`=mXEKTkGp1T74jQd(Qs#Kt1Kvuju$ncmds;v{NPJ$tg>*t42$oL*w}>N|Nmk~G)e
zDJyoGVBwAXI#Ct^y0uG|tlh?Hq|rXue;#dgm02kt{T(Q~E25DxG`OVas#Rx3Nz<g3
zeYeMdEe`bvpQQ~jmZjO2aVu(DqKub2B~CZp?41?`Q3mI!UHuSqY;$%WqJa)JDbkZ}
zg&mM7rr<eB(mvBK^eslOu=<V=rp)8^lWg`vnT35=rtBUwcI%i33F;qV!~rk)M0HYZ
zYhqWKllydo25WS_JVy*K=c<Z`?CF>Ss&^s*g@#B6T$5>K?EFoX3tNzlu3L?$#Wkna
zC{w8aMY3=!p$W5FHX<Lhs1RRqI-!i6r!AY`U%aOZ6PiuxFT^})JFNvPQs~PE6lgg7
z&A8KXbq}&0bK+$NxyuDg^Pm4q3jYX0d@)vBxMIT~oCk6p88KE-0@6;6D`m?oIM|fA
z$6)ZUPdAAn7Dn-qmdaYF^Ny`tsFn9SJtkraN+^4alpcETW<FJ%#Nf}(o78<aMPPH!
zM2{+PpJ()cwVG!Tb-~-EzAZ^N;E3F<u*We-@X)9fTmRHbQ!flEhe9jeOjCtp&z>yR
zyb1TxFvB>Z$q`F<XIhtYo+b`eg8xMft!CL<aa;#P?RJ~C<I?;09EF+Zl*`Ge2^2mE
zo)&}=Bni`=-lQQK*zDCAE8#iZoj75wN$XmiSVzD1G=QP#0W<@1N~%wwvhVDfvh}}b
zQd^awnJY6p7};kkd!y%A5Ko5A-PKH4K^*H{M>Sdo47h@@200z*Jww18tYU2F8UA|d
z`D(x&Gx7qfP)tm-)%tHS#}VnPceP4}9BbF$r4~@J%PdB>i6RZ<{J9C~JGrMPNTX*6
zjOf_b%p*e<@KzU;sZG6vKxU!|CQqUS-cPuepPl?G=!9Ibk6I8>4iqi9A8eH2nRfbk
zPpYbj1Br@<`}g0~_zHJJ13e{~!_syVyfgKM#?v^F#kD|pTJ^r{1U6|aHT^7vv(`FM
zGgR|OVnjTYX^xFlch^iYcz<2_m~*i}&a{**N{eJyQ}*Oa?f%U~4dhQDr|N4Skv!;y
zW=nahClpCZ4GokUMISB)9V08qpn2#kL;_oxbiNtxtub<WNAK|+3Q0#myr++qa4R6g
zG^PGabSza(`Q%JB1yfOWo;ZAW_zFG2xm=+@C;HEA`RVSz!ce+S!~MDIT_1qZI5FkF
zQVmUwdhC8Ji#>R219OAM?Ri)BoAPKGEqQS>VY7YJDw!(b@b*L>_H3PM#{UukeaZ1h
ztHSfJaLke#H;KHKyCes6=Ifp;sb3>e5cS2no}iI=Ep1VzEs+G7rnTwG_8?`PYA8dg
z00jpxZ0%ky$H`{9)2#7$z?Lfjo7Dk&jpTL5VaqXVT2<v3TpVJRvQH-lw?=bOo4Zs{
z5~lA%&wk4@sa9E%5hW<o+DQ;BbowH0alIOHY?L!LHNF!uJqF#~$RPh8NbDtO4v>@|
z$X;wKjQW>Z2A-=-7tw*Y9>p0su`U1$l)fRCxggYyb1}oqqwQc))6N#zE7B&67<f*m
zF7H2=Gb>6cKQP}$8$WSlYLoYAFhi-uRj_MsfGFy?MZN6uvw?%+Uw~i#5R0SI&%stI
z1*I8k3jJV2ETg>CQyR5hqz1jR8VTqV{)2Ygm2{_M=^qt7g!l&j1rI?jG=AfhO*r&-
zPKClp@(9qxOTz|dLd0KE*Qpq(&u+rO@Kf;`kH=nLd*BNc$h@BkmuZcyUw2!X1Jd&h
z<e3QdUh_wZC#Cl3IkfIA5opm-(E;rMUpPNzmra(L-DTvVoALcEaON;Qk9(Cn;+}u^
zar%Zf!sBxfUUAN5xHF(d_Qkaw(lfMKeFzhmkYwD&({$T$M+8DMUSc?Rm3{d8iBzOc
zNjs|HnfXA|kM?MRd^qD~)tOobf`X!t^Cqzb$^iD9JG3~gLkJ^?ngp~gdZxOG|Bn}Y
zUA2^@1oEh@&Fq*5xwJ&!fe{+ajtr$SItxa)Cdmz<scm+<rxycMGa|RqN>=gO4-S~1
zs=zo%gStM2%}*lorFOx+y9;^i5*%i2=N?rcTy^`k6;?R~KA6tz^tu5^)m8NyUmMF8
z79_CN%@7fzkFO2Agnd@MVnT)%gpC;Gtc%}#x!+$RN+KvcASR~vRwIp{{qRDc+;?g`
z5-#zP+nO_Fh(_Q@44w!t@I;(s*4PwJge?@jL@RLW_`JX8$iEPKM~ndkn<^Ujb}<BN
z`w*6MS*VwNY|5`=EA(O9@GLeq{@@Z?rXa7?-&_N9Q+EHBm7F7U^tJ>0JyZ+8$2fB5
zEXWmh1UR~}6#HC%Zdz5NC<jcUQj~T7(?8ss^+83<oNdfN6NPWHD-VR=O^E@Tt$IR6
zLOXJyCD=qD$4Ht~J5&Flng-9P8xQ?r3J!mM7olUeROW?b0Ex!x_sks!z2Pn)y-i(B
zd0tvUmHGioYXgY4#S8wKWt9J@D?pMoUzdR$U(zhko`f~#zB+3T+UOXnzgtk)LNY9<
zj2*giDHO?+T=Q&vnLQt=yW0<8)V`7NsI!eU5##-DjKo$@g-|eoX2lsZ2w?D@*lioC
z+JjG?8q2Lj=$2G-s0pQO(`{Lhp=x*`B+5Uz%D9h0Ec|98V2O{=y4l^9UA%1)lI~Tq
z`;cExAXPuaFq!)t9M$i{kbG-tP04j9GA{#*Qg8EBJvNg?|9UBd&BdRDav7Mcnm~~q
ze{y)wc<ggY8<CDLZ9-9xn}B65_UFs_q;X?y<KttydLw+n<<Hwr-7-4nMuaRZIs4zy
zI;L2BmEyHpRxCPpZ|a-lB?aYk?Q|o!XTSac<t_wI)+IBDl-vWT?qs!6f@7{L4f^>!
zPg$BNvvKWgW{x7tibpb}q%+XFEY)OrCjsQYTKx4odDD=2N;Wx=D&(xw#5TD`<zI_j
zNZq`WE-%k9FMx7&O)Ai;p!Ow2636=8%A^Js3~Brmk1x6k9Ffy;@ro^pHgq<$wa9@n
zI2;%7PzXcCnkV7BlLkzolfM2{X49jhfv6UAKca4xHXPfZ<H5Z&013uC)*rag6&pPB
z#0rb$(U6Y}_>LYO9!uq%Q_2{Kq3YK9C7x=)_#ClZQ**gyB<{M_n%SOMBVv)i8>*=5
zXi`2Sdf8Wrwn#;K_n3Tndee5N9PQ0wFK)BYr+@1mGdDI%uncrOiI|)-rkLrwB}cgo
zN`6|PLR+0asei~C$r3>J@MP$S4Zee!N3(1Yc0`Yz(z>0rj{Cd>CunF#X1S`}sLyJa
zx5UV?w*PX$O-@>g37q3-q%$>%f(udb3I_Go13ZnEb&%2mwGIBcX?HeYQR_^aLwXp(
zWV_!64)`g8F;P)ADOEe}NjYjFp35E2v=*B!8?6y|)DZq%n`BtiNf#2w7kIaMjQj5#
zszATFaI9>A;D&xR`e2g8tQq~*inhv}D|7S+SZeH4(zj-AW|{T1mTPV6Euivedb{S@
zS#w9{TE;PSSaaAO(^uKo@&MfG%_orFpCClt;IVs-8L%{$qCTuoIl4OiIu6Z?gcCu0
z>vqv=Z2YCYdH>usaWe({@1*^pJe$TZ?PQ0Zv!j`ax8<Xd5RQv3Ayr#PeKVt+G8s5c
z<;uE|yMFkoK?t5lsSCg0c{<_|HigL<7iZr{{`BLCiGiypA>NprQ36?fKX|VGua%6G
zdh?+iU-B%0s_F@z$-&?}tJ0BJ99b%MnC$^(EhGKy11HUH?AHi2aIwHlJN4d7>&}%G
zA%)WVH6Zr$!)rUt(rC$fUpH``AlDE<Z4vD1390?HRUiYJ;!|1HFAZV6TL2ZV9|3p3
zDT&n87xpgs#X%BFrQ?%fKW1yk^fvSQ=HYe5BkQW3F2@sBhc#&GH{*-kyBQ)@l`(_|
znE5zt*2?*)=n;9s9P$2~;<8+d{iIA1Cy=Mdc}v7@bT~ILM>S`0F{}U&T%<L+DsR$v
zvu{jU^FvuFdk%4cI667>y`fS$OR9^>G6oG##=L@`elL>dT--dpmRR1^kVLleBIk-@
ze|I2G42i+Nr}C|RO?~+!R$2DPP)3~K_3Q_!hCuH8_9}OQr8y>tWLf{s3I4@c+G!ef
zo}=QK2%FB--V%|;U1`ITA1_^yU!f{DnQPWjh?7l2d=QdM>thz&$+l+}>w^8LRXV|1
z5X@J8&49T75rH@A+I=qqxiEz;hlMF^L6^ov7q`U_u23yG*nWOP(W^Ri#SLeW9IHUd
z*1g${6mE~8dLbv-%+J@9Hu|d;N}{PlSw|-}*ib{0?7babd^?dS*Qy51$wnH*S8-?a
zOcryH*p*{T>NW&kT>=ZG<vy9U`o4cQa{^OkG8Z59?*f$7h|kbu64A*xw7dg0s&k4H
zpUFaPi<i>ql{KAkMtk}u=&`T-s7je|_^FW!xmtKBFo*a{|Nb$4`0K2%z|bN~+_0mW
zYGk>Z<4>!$cX#h=T0s6d2u0rq;}@%I9RVVOmFrffPYtmTpjdCxw;#&nQxXjw&ISjS
z-#S-HE=r~{Ra`XPXFG+q`XLSnT6yD2oVh{!kdS;;W^ym$6_CzD%g(@lW1a>-{pax#
zBK}^5#OQMS;K$jhbx}W7Sf>F2dwhzd#o~}1d6RmL!sIc)g(^B}rNI0hn(rSYu{Akm
zl>~T%H~6=??d*{0l()*1#RkR>C98>v;>eu8b{=P}7S)BayJ3`QdikIA*8S^beZWuH
z0IpNo7i`U;3v=qdFT-Jv72J_3^$$6wZqmV?m-x^0cY19UH9BN1f9WuKU?;m~wybf|
zQ2Fg5TW5>@kOd!8u%`XElT^IobydQAjJIq=_?<CYk6Iv>4xryax+$_Hp~zH<{y$W(
z74Hz3^=iirIx{K8nsL(RffAk2K!zK;iHqCe<DWe?Ri)IIA>S9%Oi_NjVN6$nP*xlR
z2@V8;W^w%D*${)QV#%^v{{%TiN7s5%q~wPFpqD_)74X=R`)37k;OSBo3ET!hS|s%M
z(OAMf%)+3vu$}lPZo&03Q6a(JOI;S}k^!?c_z^|tX=iBGSva#4(C|@Cw^FBe=PmO2
zSizZjM#!isO<7j(QSpN{mB7S<H4AJL{MM2_W*w@Oee;Q8>JO#5jNqAPJBpY^?V&bm
z-Tf0CNBx`8c$#XFMF!Z--u+KP9WmL?IgIx3^B}L1gp{!jD_es4lkWJ@I-mGbC%-f^
zGVoM`vUvih=HUeB$^-(Wki&x5q0q@N+?O%wpxT?Vi`3@;gM_f@Q}c+ISmflc$KFT^
zg+o5GgXsU((BO5^DU_Xt{sWKEYEA`*iai-EghDYMJ?$*Tlj^phdWzkWT>ueJQ<TE^
zi5Ua*d>vQDPCsvTpo2ZY@VmKvi?-2Ed7-`Q%ee<dJ#nh09iH5cXS1CObI{tCM|iQ}
zH3+VYn2rniJeE61+X!ogIw4ZU_lvj{zVHJRMA#lHsYXABT}wkpr7HAsYmn!0Em^Q{
z_qxmp!wW;23A-IbXxZnpCb?sefIsl9Wz*)pNHjn53csoF7ttn<g6jY0-9V=?+uO25
zt9c@IutIB7#K}Est5Mv`G6vehh-)zEAo$zV#fB)C#-?%J<*opnDr_0%cGs-O^SoqR
z{(PR8i@>LJ_PExl!0OFguhyLU?sV6<0V~}LsPIGcx8}9>lC)l%5ZiW~aa%;`u#qfh
zuFm3GFC<9<y~C=V+mp9>zxLq?;M+3mNP4`S6qOLJ9F`yo@%#pyJ}O$+#dMYEEF3u;
zVzda?x52RNgAD{ju9nV2G0VbZ>RVpO$U%>4B&azx%|a<DBWt?D8yQ#Fijz}04GbE~
zU%7S$$o6MTG9<d4OJZA)z9C0vl1*5jRb>16+cH$ca@4Skt3YJ1d<(+EnZ6%H6|?4y
zshyu_I`e?eSK#au9*e$J7!2_hsDb`Hf6T)Q#BaVTNbu)o=zRZo4GnE2+oW&u5S7!V
zmV8<+|2H%lF&#kD)s|s$13A|fQ!Wof0kls`*H9jNQ|e>h<kQW@@vJqJobqdM1f3)z
zFWB%}O>$Hn!W{FkoGZ@PQeSi`k^;R3s-rbY2?SqefbZ!l^|GY(dFbhq#}yR!X8NxR
zjYqTyu<!lZHq3X@xap=w5)RZoE!sLoO`F2fJ9oB#4E04`BJDk;84yRryd|ia2cgZi
zd8=`pNVNlG(>*nSk>gK<Ip>7LzEM{1qpv_d0FeM0B;L8CX_m%kSSHMzjY2$RttkxG
zN(`W|(f)I&5cV|u;xBb&Z5Hp`sAz0kmA?Y?lNQjp%*ULIc#W)<QBj+HLFNt%88y2@
zvQGGY%%eG_IqJ3Loi!5u%>7D3MdlHsnJahp@#=<5F2BhH^Mtf;oUiO9iv04JQFnEg
zzuH`i-0$V8xl;ABKialRE&`htnyGt560yS^Iz;Hy(Mr%?(BGz~W@te()D}t=3z;Fu
zd`<C=B$BXck*2{bE^1m`7ojivR?3mu7bdmVldNHsls@whVx+5I$N}D@ntN|uMWU&>
zU?q^M?bdrt5=b#`?F<$x2zGZj)GcDD(<BLb>EeaudJOmSl_D=vURIy_gDdDxrIvJ>
zL^M=x;P=BjJQY7D&1I&9v>nrp%&HcaI4ez+b5eKRqRHsCX?_v4VEnfvKK$+w#-m`9
zzDpA<cSM@oT<X*@PBlYQmQ#DdoFJvowd{J3$pV2nq|Utu*YPSlUe=+9Ntv`taEaz&
zF+f<n1226u5i*#6Y+~T$DXGh*)|*#bJ6^2t%JhPF5$>$$1Ry6{_p8$8I_yk5iCzN#
zb+L4!7y{JoH1KqsMgxZ!YB#j#npVcA?gzb0&P~*dzdvexsav_#WG~un%MI78lGb{{
zVn{3eHzFT1!`(GZ$=iy8$9;#JA5wxxka&tHxB&R2-n@KKM#O?2nk<d>EtwI#);mN5
zCa!POsVB33)%yvye_tk`mEcYdxLmD||LK+vGrUuXc3CvRCH`Ana?%*&aLy)o%Cm;y
zbNZ3pp^=1X+Eoc2dF?q=!N+CU2CH5(7-g%IUJetKF&>A3;K6iOo-1s$A{?%&G;-ri
z7j>lcPFW2|vB^hX!!XR8W7e2-dV+P~big1<%1x0=)1Z$BG-)XV19FNJBiH0;sA?pN
z3?VVpYJ?wR^?e)Wafgrd^RA_JvYd7Ll!b&A4b152=b>+T|C&|Dus(Y_W6pMBhl-VW
zDp4M`r%DhIw7j!PI<7(a8y;8iaYEZOVrCv|SrxFL-z%HX&rCQ;GYPd~y{<SVfMQb)
z>@>G{=^1~p=$QyP(YA`ZGOE;W7zN-4s(}w^W2h=IYu1gPCU=^XcUdtH@$L`SQsn?m
z3NZ;;ZrUv;Dwu&=J%|sQ2xlhDpTup@{9OQ#ogxs!?!uF0MzCI4<P2e!$3|hc_gsQ7
zZ_+4WNXH3#=6ihqq1nbcK1{F19_c4ACOP3$tM|F_l0!?RAkt(+U7-)OPVq-?lr6Lr
z-1KZ5k)bVund;<P4a&&g;q5l?M0vS~D+Nj>#1p|gx5>~|>`6napm=adG~2d}VI804
zoam4=3EBYDKlVap66>Tb1oJAi0{Rw>3_<D0-rAlQb>3^`cy+XFXm<k5vg$3-h%w<U
zOjcsgv3|!3H!)(R<S%!Lfpzh*t&dX&5V;hTIW4wxlu33r4PVVgLko+>q&XfE6ca6V
z33+hC`S>W0Xqy@F0o(o)?zi*|Z7{_u8ynmc&n>YxU|cEL%n(KT2H+9V=!C?S@-7!<
zCe2r6c9AkjV3_{L|DY6S*<DjcUdsFsmu`}X+a=sKOq9qy73*41QhE@1(2h&uT>c_o
z*)H1-NMu8Z4@{?E9DZRAIU!!K=XJGqhF9NVB&_Qw<&NPm%4&=$6iDaD_|Bk&AnGC}
zfEV5-zR#U6j{X_h;>ng306yBS7`L~@kvr>ULz87Fb~qbFDYbPs_0nwVPXp@`u%w)6
zULR9@{n_SRS3eC73%?ig<D3z&wjgM)@KRFwR9+n`x523rtbcrlbXLD#54~A9{EPK$
z#NS@}ajHHgw%u*3c->dw6!3j#jZrNB76y5o0JMa;<8onOF(RtQ_aH>xHGpw<Ri*{%
z3r0FGCVN+K^s#gUvFB<7(2pH^VcEn;!WtFNSLjM5O%s(NG1S%Py+eubaIK^WGU`=r
z*w2qnP`I-oBL-*IEl$;FJ`75x*dZutFl6v35D%Ie>Ai}fJWaS*H5{C^MFk$PqYz+p
zAq&Sg*Xc1y3}_nV%$^*fp_k{$SAZR%z?NZrVeN8)$S3l}A0yA7HOIe&Hy9Qf28yzW
z21`nF7id5Unxfzf#OC!`HP-dbRbGmkAGTIqn+~2A4-DeZLUVgT%EXW&^**=%<XWzw
zyF(!Raf?tEOB@CtvpmgAzsr*vZh)@+Q6Fm$p&o}(MGNTMT3g#`@fcGw-uefQKCR4k
zZaBpsXEeehi1>O#L@4hSoHMjNr%~WEu-zouIv{wYho>Zzf|ArkJyp5hj7>EI{gBXd
zrhbE;zF(OV;#Lu-SF~Ae-O==H?tRcVAQtQU`bYCN>bN5d%N;2O4BUmRxy}jL5W5F2
z`NEn0(dXBilKx7c#I+O?`t$g<167Z5C{IgbLIzy?G}s|$Td4W{qmrJZ0dLP>EA?o9
zp!j#;#P};R%7Tc>$UW;(6@;*)s*ni?kAQ8mph4ySdBAg{5c0>TME8e``A?3nCOvy8
zzC`sMh2Qj!#JO05SH3n7S%QqMOX2E?y1h*64Xvc<zJ+zc0X)ur8mJPwh8%T_;7#0r
za_5#Y;)GEP-I|m_vD9@+##DK<Y{|PMY91YrgY4rLI9-|w+mhhi(nB5K9Z-nV8PPm^
zjriMVY<@w_%D;r4*6XJFX8sAQ8p?$uzKxUREc*h!@P7!ee5vCB_2ftDIg;!Pgr}qY
z(jjLe+lD5rMT=nlrcyp;t=kNXRwC=adI?ULpP`$zkU)P?;R!v`YQ7x%bzBB4a2KeR
z(}>33ZbdA0-sFDPwc#OIY{{z$6g;)$T2mab&oJu0Lct-)7#Pp8jyj2O2*_-6peKOU
zMZ&u7Rkv7_<y82QYH7yVF+YCDJ_+0&Y*n!*hB%L8F{3A!>I<DGpOFrh5(wa+DLz*+
zgFI24`oKZwK5a$e-qf^R;DVP5(<D?w<%QZAwO$<F_|Jy$LRJk<A}uK!o$%`(kyWGc
zGf*I_={dbhmY9Xf@B74TtX98<Jg}|`b3Pz&AtUaX@J2Brxz~MCj>R4rG^%nX6<~qc
zGwhFCE~EO5n~cd+FVc?pcCGBb2TjhbNiJ|iq2lWsDSV1QRJolN?-cx_9JJ|#hifKW
zwv%U56Jil=8%V4pSqrBR8!-|m_TKMo2=R62q@c+|p}zN*^|Z$9o<>s~g1`p=kBw7@
zA@$aDVPc)j4Zwkrq;LPe2Hqh!es};rS06VgMC#L<G543$&e5&6!my>ZT;mFB$%MDo
zA!${aF$EpxKXhY<UqDp9cjRtO)mu~*$jFzRoU)U{7_gGGX;4Lt@*%>iPolc208d9_
z!YgLVFiKW;e3L%hJF;jQI2m0%JXuki0*h-vD-cf4JQ^j;94OL}{+({1f?#G&c%&43
z>NZGY2RQ=_0z>2eTb}j%uW3|Y@Ed?BaXk%3?(aFFGDc4^xy@L>{PDB`<~gz2@r$k=
zDW8%eISeeX!*Rtkh@DgSQ|Y&O(4U)`dC)o6@Xtg!8bI@Isu_?srhgl)v}_VP_HbGS
z3>~%irUYU4?(SkDs+3J)Yox(q(UD_pg{;J_1`|9r)Kvwny8Px>m>Wq3(c(B{;o&rG
zkSK!T<$q}(=<0ZO2IQ)j+0qezAPZ>?_5(u`1_e?)9>lLA@?){$BMKzhNpQjPLz2Wp
z)C%4~{?u<^j{>2r1F|uK%arpmFw~jTdDUHxrqG03lhh;%xC;acK@(_%luH;qWQ&4F
zv{cog^6(6M1UO>=WRCDZA<=PFcl_4wlN*?KHZA(r;`kxTIG2sK6IZmo<EIhkdC6C=
zf3cwF!R-$hl5LjPOGaYfe~r>1xbYYlD0UXINV(yrIltT|nP4hMj#TDY^gQs|RKy%&
znIGF7pZFcH80R*Se;^1yUk>vfu|bH6=T$mBO-#$XFRyohKX2X<W0yC7_HXtI2noJg
zo<c8hV+r}*fra0Gnw!5*Lz|j@k}JKNuqWT9W@CvYzBex6kZjpYw%~7m5Wl#dP!@t<
zu(S&d1jLS@^Ffk0(+USJ%TwbRbm|N6Mz%}PihPY>YMn8g!ls5}OxV;Z?-0eG-j|m>
zDyo-Ad2cLdBYtYHR=c;AmZqYMHf-(^>0Kl4*f0-;;3tOH-`8P2XMQ0^g@LiuMgA9s
z1rJ_vu_Ge)Xhv6FzoJ3;I?Mr9Lb9)b@nC_0?q>Oc2=AnS{f75U7k^3t%q!mhMs`lg
zKsp7qCW!>9>AVwSYCEwJip}aG6#m-1$p#Gcx(gKFkgrkt{36Ykywv>t*4w7b<13$7
zOY|4eenYJ3+2fmGBS{kSWS?@9qecBb@rw{OXf_1~=`Z!ocHonSaQ6vXW}E(EdHgV<
zSMc**sdc6RD;mZ^P_(RwUy*`IK|`E`_p(*c%wqMsh^+~_*6p76Bg%g<_*u{m64@Xx
z#<{lrx4f?C+B^Em3!!9kxkpeYB9@}gMedTCak5hL;|hdBg=D^4EalEi9JQj=Rfr5M
z!f2@jNKe9W1eMBQi63E-CN7P{cl%x*!Bo3M=-QQ5fGgtI7%C2-OdKYcq@qf{ps1W@
z9*L9Fp|gyu#4fOJetxcZcVAaq4)<@^&P^$om>6HKHQ%=d^ZSLlzUyrX$~FGY;F8c1
z%8wb{9D=^UVHe15G8xMM72pl>9giIHqvl!mw+)iV9U;eeKbkl^6}h*#F*>1qJ$Zik
z3jA8oH5<kJC<*1<gvGMu;o9cs+S+mVuJum9>*43(KbNy@?cVyDp6+}8uISoQP6dt1
zxcusLbxU{hS?A}3O7?s_wz~nt+^u@zdUCGq`TEq04GmnnzRtP4%G|HN)a3yZPCW!h
z%0B4I^8PfuA@r=xze?0ypQW2CFBq8K{&9o9+V!sQ__FvQudH(ib<zuU(aE{&>JKOE
z>h<BS$#Dg|$m-@?lQYD|xIkZKbtUG!xIS~sCIl8B0AD+s*1!j5+8o@j!V1Fc4D8J4
zx;`WOfISW@bR{OPjFfzch0?7)Z~zhe^|5<(N&O!Y-VAO1Q2sx_Th3AH&38gh?E9Mg
z{8jd~^KL=l!L{tp7kKtz!KANvbDd2}m4|lc0hv0KK#7!XVL;@wUd^PB$}`0k{if0v
z$(!z&K=?#c4)BX*6493txzHDiRz<T2PaeI7?BT{|XL#3{*vJOH8aK75@Jp$!j@1p}
zDX#A~<LS-p#!dc>|Hei}i_YG4R2G*4rV^D$l)Lf!Bc-b>NjA@uuga(M=TXfoswE_<
zGe#C`psI<*^<%T2EAS?#uylS8xo+sXk@<_9V?%rUcwC)#=_Sc;V$k~qGk4?d%@;hr
zu>a>FaGOZ?%Dal``0nT8;urPnp?37cLE!VNppV+|-fK_D3iPhuK^TLHK1oTq%PHYA
z<c3c>YU=SeOzvTt*hxLIoxJBTdBbh!WNe`An~Zj>A4;xBfj`+BvHH&xieSA&cEVhM
zL4_g5J$6<Bo&N&yzF}A0he;ChyI~Cq3b5lFg3S1xxc%sX$D0pSocnWe&yS-~E?dFp
za4!6_=5EUhU(7MOmre6!D#*`p7yfX{OsNySkyQW$lCi|cz0Gs!gplb1o~||C=lv?s
zBkK)Zajz>rqx}`orfll$&Fns#-&EY<)$p%Z%B3q?Aq}{CHq?IpAYrGh3r5_H-~Xn4
zYy`~)!pRUA>`pZP`|iEOm&rXjZyi7!+Q()*I<WhvGvT91@j|4)nf0e@bIL)z{V)5w
zyY2ab;ra;fobU5R+<E5*V!Sa9x_jDNta{S*6X$q8Q-H1C+cgR0@JKH|Az<a_xdl?7
zlGkT+<nLkSN~pMCx<E?;1-81z*bLnV#`OK&#e&TV8r0<Tm`y!KH`kg^Vr3|zE4Kh8
z?(yCjf!qtdUD#I7%@w{a;pI=~3c0~E%k1)#SgQ#6F~a2of=c)LmS^49`);FWr*G#9
zUoZ~{^kiVu?-gvm<2wl0%=Px(j6`5|M=b6Ge>_v-Fby$mKbnp6E<&|oPS&OH@Ls56
zy6Q;kqrp^*Zq7H_V|1*6jK6{FEc|my7vMJdVR+5U``zLL$?Q_1#nH}b9a{MCX$0~6
zz4kd$^@BmSS@x=X_l7CLgu};w!yTvvH(Gw@)9B{yxsQF5Z)+jP&rwJR(ypTU?VDI{
z>D%U|q+r_I_2aN8Y&N>Z&b3?WS&VQ&Xqy8#{)i%&z(Rp%k%X+DvlyDg+6>XWCw96_
zf@MY}@hQ4V`P26zL!eh<Ourq^u&ACHw*;$pRrWbH%a*CkgeeVzkn)j9{O75cdwt8Y
zS*{Ue?9>1~hM61JNoZ1%VYi3Gz6vGugO76EX34cV`Ugy!%fs7Evbv7EhziRuSFw3j
zy}5H|k#dZW)>M9DV|wn-t78k7MNM^eGv1X*;;egUNl1vJQFVi?qEgvsXLQE=nTuxC
zJ0EY5h--Y)XVJ&Lk!?*Hfa1*g&s&n$*%{%VnXr)Qvx8SKaX6xxyFLc()%OC_R7%nO
zQ(^Fg8mu_Tp`mS~fN*_3g>7n%8@sbMtsyuV{k6}NQv~CPvN`fP&c=IM!o(T0YYxP>
zK|llZ<@af)88=WRt69h&9!`%nzSlP(#;+myjo{Nvc{}?YHYh)vIi~Hx#JLmr0E>DN
zF|PMpcSE2*(7diCCaJd-n2;L`9W_2@m-wA}IH|ne>5B_g7Ta8_-|h@`Q!6JNzV`J!
zkkTFI-Ap}idvnj%*WuRRdOnVY?_!~$ME7<N9w5_+Yuf_inQa2)kW<qY+HWR5gxhRP
zgu=%xkkYVz<6aOiD#nc-acMKV`CvlOL&MV`xhy&UoNn*1iBb>hd{9^G&$|A0p6w@q
z`?;wc;-vNMwTI>B*W(#E5(J_90g@biyezPsFK7Q5pY@G5&lIDZ7@y~s;M&3u6GE)i
zl~7904IY6!w`$CIt8WnT0*;lry*>sAbBtb`|JWbWynZ>QoZS3Z-J3i|4Qp-4Wp!@|
z%w&<oEbPACot8+45M;lrk%Oo2?K1;6|0&;X9(SL`HOITW<}S}zxer`TlC0t6Cq<WP
z`1HSD^024OnbndDz5?q4XpI{_#FX(Nx((KKxc{AAJ2oIjNB8il6S9+7`{5?@;~*|u
zu6KgP9LTL(EjGRx-|X(5!ne4~@u-NoRM$bk&r)J>e*QljgNNB%{%n)7s>9mauLXk}
zn0r>s_Z`hm@+&^UyJ$pL!CkA2k|>t!ef2D)4x&T-rG2evQ9f}0KLHVE+B<e$)ENB%
z7|4R{Czx|(e{uq&1#^}3RbH6))X5NScTnEb+*Bv(OW!~0KO2c$RomTx6hD?#U3a^{
zpF4kFd&F*i1$uwJejn`czY((qf=m&8&1wX^pnhI}zHJM-zE#aS?pnL*5Pq~j{(KVh
zerz1<<al8c!Wr%KPo4@*Mb*w(Q#9ToW%C7?#uDuI`j90$MXdX)n@@n#g%&JN27B|@
z&1~U4zf#gjN*P?a;wh%5mI^B|JG~#tn!8i)fuUK{PTm#G<3PrT_|8<b5oO`V{0cB!
z?hyHPPsIIq&qA(}vL#wNus`B36D3<dZR4^@bP0d}bg$Ipz<S^G$Pf(3c_c#B*m;56
z>`K}aYrr}9i^BlURc08;Wqpjn-fUFJ=1w?7{`D0n;VS`UdWRmt=!B0O^Svk6q`b00
zm%g9tkOKt8g!B7uYjuQ(G8T3V(8#of1x`ZKQdShz9U-A&DkM1u*r(>C)1t-~efI0;
z2MNv_dOeFL;_+Sts9SjrpWTw45#rB79@`wxe?Lx?%k^WRPa)o$Va;nn%^kq4FY9?>
z31kBOuAiYof3{puV!FJ$X~)g^n=g8O3k09Z%oH)Y5Ys@H&jeds<6OBR=N;7%UKxBw
z2u{|plFxXF0x5H=uPS}n)8VN}x_v{kR{#i+2`K4)Zf9tIV`2wujhb&zuHidx(M<LJ
z{Wo}pZJ9D3LrICmz+qYlknmyJJLVkOSxF5IyLoY6=_PL1i=Dq$Xb%R=hAl7~*+hds
z1q@R6KbIP=t`7RD;GrA|{8>is>eI~1o=Uj?)=FbfVP4Wb|INp$LjiO0*NG)Ly2Q&+
zejzD^`Ro<waKjKBnJM5Ux!2%AT0eRF4*L^sLOjhLpjAV{e;PCnon@W`PEs11zJWvN
z^6=!qUxA|L5y^tT7I_L5f4`WqV)xmTDS=Vh!Be~SYB+gxrL(H?OJJWT8&J+LXUQ<&
z|5t%F$X+`LiTi1((rbQ-k}jZcawOs(VlV22mHhA96pi%1^QOjsv1AraPO^}p)eDPn
zvaF}3|J*g47wx*kbnm-yXT~S0AM8UFt>mFc9C*d|c4L@Uz5nSC_Z+Nb<p|3fdGyKP
zW;=ffW`?@p`tP>I7LqY)O)Rur;QD%>^pih`Lw#59oaQL!I89v0-$18a(FvFp4Q?NS
zt){C>Tr8ay1*+4?|IXdPYZy4$L7X=*+y|IRGg#NVvm&M+slh*IM}|tJ5?$_dd(VWc
zOB)>PeZA5zulanxnA=h=^ZIqCZO)!TT9-tK_JVCz-kCBo(ThCC>&-D=m$JFU?r?iV
zWzNAEF|>tes}HH{Z(bcfd-?LW_N*AE@M)OFUgME0I#G`-;&SC_p1rbx^KPIwE_YO3
zmnF^}p@06W{^57ERiJeO%MA+LkSQ5L8U+LIdh+|!$Iw~jgfk}96?l2h(jP_Fboj&+
zhS1eV`*jyO1aMqVc&)#gd-8poaO6nW1QMj3;@F3%foEz?RQvG&kNZ!qNAlvHUd8G+
zc<kjI{BE1KkZ#9-KV9QzfDUyRs&eo?5?6p;ygaO}{cdmnAnZ9jO)|hcOfC+IiMbmb
z1>47ue$)trT;0fcT*P(}?f({KBcWX*F?zf+-(8~KB#LCdVeYCq@EHMv%;AySh!9({
zyFTz_lwjPu&Kw<%8-PIbT0c<=Oj4>9`&4Mv*~rqFSZk1H)sb_|bRFG|HTfqFR1aeh
zioVFe7eU%bEw}3jbhr7IZV8i54bUSQkC@JDs#)a<XlQsmo5)xWd`<HUy*JcEpsyT8
zTyf%r5P!>O0aF*}o`Vfymy-v7Ci|OwhY;kSHbwUJr0h>-dm##tM!~Kvx5w4+mcNd-
zu+l2bTOlbjR(;rmwE*<bf+avE(=7AeCn~l9B@lfolit7S)OPU3KC#6L!WHqPgO4%I
z{IDA&VKX_$R83eGi-27XOFEFU7T0@M2+7B)#5vdz-Y>``0RmvnxR`Mz6hnhU3ui0x
z<0>+By{YKqGXah0=f9?ck9z+ydmfWa-i;Rn3*4?ZYaBg%l3CYrLHZrY5C)hf%nO9#
zuLo2*{5eT~7$?Eihb9Lsu1W2ENM+j$A~H#tV0}nB$=!pixP<PAi+Zu;+TF%?!5z<t
zb0V7P)P9Ku0{C6)3xytwb-x*!-UC-l<{5E|3advZNSEM#-?4DezhNo6=D^Vu?gE<m
zHdKFXGBzJMO%X%zN(k$bRWW+k{THM-F5<!sbHo({crzpvMT^4!!+iNrYjI@9%Duyg
zbjR!!Nn|jvr#OoWE29DODI`5uhd!e^yL4eyhT$n8a`R&w%9>r|=R^S+GX(Oh1rpgZ
zPQ@FjJhE_1uH?uB<z&d4Vy0jIr=;QlUKP7_0%1rk4$zaCkbp-y4Z|>OgG?o6wc&Pj
z5GQOxwg{y@OMdE`7g$N|*W14V7Eev9(HGn@TcE09tX3Os*Z%ic+lcxD!W2$4Rano*
zpA!_;Z<4AbpKGS5Vj`t=#N-HG_(BvZTv}!`_#)75&!xSfzgJC>r{E7tR{F=U=gdcC
z%;>xd7?3p!<%!*dnhX9Ck4MHC@3Oxyg%xu(#3HpqF)=pQC&|@C5Etl(C~F`9`ka0q
z$|HHy`APi|v?e|0+L4y>^+}Smzti&t@yO;5VJDt~M9(+r)#}uJ$cZ2qsy_81(2x0N
zY#xU~E59c<!xL>-{jJk|4FGXkeCX=7MslGA%m1JYH#^eH<x$_OZE<KXe_&?s(gF@8
znEFZ`C?tLV_Y&0)M;~RALH^`#&Uo2jrkjk%CmMLg?cyjV&=3#$VE>Cu<^;@Hg5J@X
zDDBKu8_8rNA{5kUz3rc`ZvM4UefQW3>hN1t=qyA)0T*Xj?t%f3lJ~rp&31>FBTRQe
zNFX>4%22JFi$v=YFP2iNs8>;-kPEO?6<q|>%dBZlTYUmSC0Xw%B{B5_{TH-Cc}JHE
zic1Wm-2<jDD!Yj10mB!;Q(=dgcY=%zikGx1!XP2AKZ?V%dBkiy&3~w!|CY#v+Z3k5
zOO!%AKFcq)P5zP?DRsz4vcd2?GKuj4W9*~-xV&Sr44CB1{>1%*ZeViA{FjPilkYo4
zCE*^ix2GuS{LR9p)u)HXTQ^4kz<W(WABlZ3_3=VJhaYh}1SZ@xb$GQ=;<kapCi9DB
za2-=r;?zb@<p2EG+1;_tA(@zf-~JEQ3@Fk48IW+eM_xCU>$TCk<9GbU;xoo|wY+0Z
zk+N`x724C@t}(SB->xA|e?36;27bqQ^tDE&yZ4s-f=q>naAXHWmMwSg79rxsH^#>e
zwnG}DY8KY(GvP0oG%F2hJX>9yCr5@=`5tqI*9r0;C7b}Dd>tuo3gxXHgy7pKhjPBM
zC5@xD6N&`cUQ+8V?X!GwEQa#hIR5Xke$d-vd?2Hx;i2ut=Hvqga%dQ71DExr!~i6F
zXkGSy|78B)^S@m)xDm(<_|2+89mEr18uZzYdq$+Gv7yDVtiz3<y@*Zl<Cv1B{yN*>
zz)?cYLn)MYk-<Y?!_$w_nna)ht-?>qjUzoK!^uGLt>iD5Th`e|GDlNsw_(bpR2(}>
zjgn^LT@%nx%R28Z<i6U)OyL|p2S(<o8l)@+IJ`2A2e$~wow;XL!L%SxCfxBnEs{fb
zgJuPu^bTCE#ZiG|meZV#kK>%vSc|*ay8oH!rykTvFQT&<eRxA{>pG<R6l0BEY`<`#
zoZCk7yvF}D{HGpOAD?&|+8mLoYq+7*Kv<sbXFG2m|M2oc<61fmv{U^W7weQ78!hJ-
z>TfEfT{$Ww;bo<=J*B?O=j#tUKybC;W-m!^0P0<k!PqRIT~E|^)8Ytx`((6wZ_M7G
z%pgo<!`@Z+FhK|4-eEu{lX)mTg8w4_2CJ9cDcR+z03xhxfmA3oboD)H^mKEQM223k
zq0xi5==5ZjePx(dXtAu7_iowKWAus~3ghU1hrDMPBa(F-7LLH}U9M`OdNL4cbHn|C
zR5#wLzs;htTRj0DZttoX1S!x%8<z-iHmWy4{i)kz1_eoQNdw<31|p@gA9&}P^a=l_
zN}rjxJh7+el<nyRmMq9mhoA=B)%RB$n(-dPbN1CX2cd%Nb#{(bt9|XJxtTF+QKvK#
zAYz!BHJVG~RYyO>6C|TosM<*-7RgH0U)Gc^=;}`Zzh8aknSfr9wCofWBJBs=aNUem
zq)>|0#4;(7*d^3a&TurVm!P3p;j3cBgyO)_%Jbl~QI9f-Lk|HrU1BSidYH}{223&A
zO`2Ww%RY-LI^oO?7!v@0Q28F4<+@PCJ$(8_FmU$s-Kq;X-sad|_^G0xjYh`%Zsw|+
zH<FhgpL8W63~Rn?oJ3}(Bt1Asj8%zahn>ON16U-6b9|&9fX&(P2_Snx@^5p`u(vg=
zm1vt*2t6?kri_l5CRxq<mDtU@eO&#YY48$dJh)Fa<i1~q^;O?ryCz^layX+k;co!w
z36|_d79DGZM~Z_OJ60^rsY(u8NChMur%UY&Gv%o#MiQN=Xbtv_u_=$kkNrvmOb{)o
z<seZa1~LgEk<ANxYPEwSie?jmTnjy>6nA8wAUKjidWy&TA!c+uzrOp9f~iY0Pq+u}
z{y~*HyN`fa-Y+$L#G4tFCSv7)GCsCwUqjDiP;mi5HkUvpFgBrPu^&DZGPj#V#vW)S
zB-syq!5ccO=`PP3H>4SH^!|ypXznoY!zTq}y+=WNdw2{ndDW{9nC({$5lH;EdN$vy
z|JDpEdM;j?If;B!IgA_!HA<61x=8q9B7@OPj2&ssED%2h`dK@#IRgXA21kC)z`AwC
z1YUjan49-~saSpOM2TI6xs9+Sf2C|R)<~e2o@n%=ir0pMq~&dp0hiQ?=(PcPGwxKi
zse!y4%lK3BaIVFh`OHMh?Tm%Eiti?c*qG_c=~^fic^099e^@FK82_PH&IG-iqvnjY
zOl^-z5D6jm@sADL?a<4f3TTF7>X;f_;M9kO=zC_|`(x4hd_;RCRjXzrmwVR)Iz-_G
zZzvC?AW*;-UlIl(78?=Ug}|^1hdaV0P>@4ym|@ME;TdjfC6^DKx6ubX&AGV@xyMHd
z3ZE$by8~!=rL`~H#>2fmkGA`bhY{F<?{s?qO!uIbt>Kvw4HiaI<36yuL&bJ&%-e#n
z(ruHQXmEPD4~$%}5gN8WPIM*WcKa~?SPDe)e)HOH8vSWTYn8+=-J?5Q#D_Dt=*<l_
zS|XPpJnl=GrhK^%69Qs`$bW2~RLLG|noH(_jDr211{&ZWL<3f8fEGHKsTXO}tu^Xu
zVC)I6C_=Qc7<Y$JEqQ3w?rIK1uIK`0t#yk+j4A%XE*j?0{m(H#)UM*<Afv{4VSe+%
zNfufw(8VFGZ3m3brn6hmk9rgLz-r#9!+r$~6|3}Cv=+tf^yt1v%bfxWFNcVoi03bM
z-4e1z)Zh@B8XM8OF^dE3+3=WF6P{09{e94ZV@N9ASQoXq=v(6?#L1F_&64AvEvddl
zK}w8C!Z*v0%B|e|dw&yY3QR7@OtF|9$GoPDcd?S4SppqI;_?BPinrgXS3ROVv@csg
z7M&@OEXfIcKh(eHsiV!?4HVM^H}w3nNW3+KQ=pzNMw)8TXdutDnse>;0GM*))Bm`*
zJ!4<kwkSl69R_WN+Be8R4XZuML68q%Ujy+YH;}1=MRuCe712<om%_&c#3b%#WG_r@
zS3+GS-wmxt5x<*Fa`bqd;Qh8=txk8~9Oyjrm-Jc#ArV7BE@iH;xSc!`R-ST5b1emi
zQ(^$qntGiA77AB0Da@^|7Vp#I=>|`kwXi=_8DSxLKBhVj6)-EuW=KdPmFaz<0qP<H
z>)uqFe%|&PafEz%Fsjk|!>gw<aUnJyIk&#w67G5lzMhhiUe7ZSs>8$FaO`{OkHDMd
z>=jq1WsSqxTHrC>IzMNue35`&w2b6L#%WLE#th%7``@tTF=>qi6y0NL-K<k*`GMg2
z;PW8>{!2;-W>-R<dRW#{00;dYTLnJnLmM((7n5aX4A=j==Y~gJ3rXtl64V!u())cy
zTxp@w(*Q~``~6Dl55ge2UT4~P-a@+L(jqClz7y~4_*~WD)uH#sdovac7-vsCK{<Eo
zfR94O(LgdlUBg5%;J#!o@MJmO!A*GtPSTt2puW;!&N6)6_aRELMd@~z!N}CG99TPX
zAZ48Ox=MA4FiH7BRv)*v^A#3LO~cnNI#MzaH2^!#O=KFwWL#OT{elMZ{w-f&^l0gR
zR;8F|sAi)`5NPhtK7Ywl&K*^%5nr9hPUCBd36{d(;ARjKRSc)Z__bU}r+Ms7kL8B`
zZ4TYDQH*t3kF`zBjs2YS!=Uazbs}!0bb*RM&Qugf%6p(2t<1WzMOnitXH<{<pLSlU
zfw)#s8K>m1zc||!sf+LjN)^JBjcf4~OQ(>D+}0zk5YpIKw-NOIodDh?I+3xWBS^7<
zkHN2ie`wh)Im&l19$2Apnb13N(a#0vb*>P;M*5W1e(n-w1+}p)>$ln!#{3RLvYEER
zlafA>G%|lU<sRO&M9$zJ0}CIEWqH-o+*3j<MZyF7*_o=TYu`QF_sgI9!5ht&5ky6(
zo2vLm%x|1dKY(_-MMR&{^IJiF!lE&}4CL%Pc3M_f@gCQ2y=PV2fqtS1a&K#qNKyDG
z_xqx5E@q&PNOIBO?qAfIZXXkNNO>A0yBfW0ty2E#A%J+mxlZ4+S#iRlpKykE#3W>r
zLVaX1TT6Kc{n_G!{d6+kI)#e*+u?S9G1Mzfl^kE-(WRuAo>IHD#{Y~Lm0uZV1uo;7
zkR*J$;V;><pZEPFD|Mt2ot??~fGh&2)+IcJ%d)jswdiRe>GTc2iq`A%)qFrsw;RXo
zMyEuosf?k<Lg54zqld=^o~u+N=uO3S6RYQcsb=F+hQ87@ok-njU=_mdJ${jhx67(S
z@6^5PJ>jS1<=$EObMZZ{7H@z9tw^Io#aUK5zzmLhSg1{2{dA>3_k+YPlUs&xa_)jB
zCp$kUB1+h_vhj!G)h?2a=YIf0K)k<2b4otV$$J+MqzT}vLIu%R4{mIAxZAMD-i9MM
z8gMVhxEHT25L)=(raWsC2&1bc!ddfLx|2@ku78npk3Tv4et#~jb5lni@dymw_~B0;
z^%hT`>BLb%aFEw@()z=ER}QnO`Z3%m7iBigeZ^5U!_eyy1@2?%aiBIUQ%rq6N^K;+
zOTf{?qNEa|m~MBaOwT!&ZxB^A<1TkP)PY1*l@@}zR!4O1Dfy-!-c{tubeCE?*V=^i
z{qB``j)fnk3k-bW;){X$mOs;Wo>tm<=vlOXul8?gafoT!qMhi3U4)yU1C5kbM$c|c
z8*8)%61OMb{}!GS+PyuSUN(dDE7MPH$NgLXMxR#ecNo|!t-g<4Uo}uxX2@o$qrbaA
zEm;lDxlAn}W5!RIP=gkQ&IdFP9?$dKzVTD~npPxTn7McsRCix1ZfXA<?cYD*I6>b@
z+FR(}$%((ooN{0`K$2x);SI0072l>uIZXphbGtDkMQ2M3=Sno2i6k|Z!K~xld^Na_
zW-zpeX`Q_T%suJ4wcdbl9m<Fk1bf#aQ_O94OPy&sP`C!g=33DkGVeQm6Lsti(R%WK
zIbzu52gp%{MZ1bFmDox*<lAhHo8`zh4I}oy6a^8NV8NZ^2b>87fMzwxSl*h1KDUa<
z$^%JcvzkPZ6PopKZqwqH7)l96ydv(mL&%>n)nM|V@qa(=$w~vv`&v{<yl#9dw3_Ub
z+-Qs!nghI-O{fYFWq>mg?&5s3skK~8#>PzwJ9h)<DB2W*=m5pCk09H+b=t)X#&lzU
zsm<w_a6*VxcQEo7+LSbo1U|{$h}}EGBM3bnDVDAUmlh<&pljao7vkmLHR}u|S^XrE
z{=%G&7s$Cv!!UNnClG7Vx0<yf(x8TDIH-(2%6m!D9!6g~Nju0z_bN*+3N|xM81As`
zl0S$^M_{|JCjYPi^QKqH*^ZqNqv$;ja+<{gVt89jE<D;oKdVQ5Qje$_INs;$QU0mA
zyf{!v5R`6Ko&gd%E1M3=$Rcd00L9e!9-Ica$OrUhlWfNzv-NP3?oBd2;L<6fyX!uO
z)1ZeD6F^8EcPO_PBE~2K9KibYZ~#vaI?hot+)-AE{KDT&814hRx@PVpMvE=XYoPA}
zKW3o%zUiD^b~Ic7Dh^P3mSVD<I-OR$Oq|Iqb}01sxrd|DS=@wD*=vdz(ans0g1@<k
zs_jDD-bd~)df4h9jpa2LpAUm|kvY_$5B?S)$hD|ikEVc_F0n-md3teywKDRLS%NiR
zx>WQ<ZZu)DG<%NvK=8=i#12eZWQqyZ0V>GNH?!GLQ6WxIC}-k#`Uz+U^<A7(1}V26
zn|E$o!rswA3wvVM;(Uk^+oB}wXH&UKi*u@L?)Ky)OxA~(hUxEFHr^h<lA9D&k(jMI
z?`t$kyatY|_2kP6#k02L2xVO-)&JXl4iAYFr9(;FZCqC;w3KA{kba8jZsSo~)?f7K
z@2v$l-B9ZRr?dWoE*#$a*8SKFRD^b%lJSx=sR>gA%Y+Ms^d0>I5X`d&Xo4l1_p#zs
z3>{;7HrKc!@bvPwwY&*cSbgR~_YH5+#^FU4))bQ4oxit{A)%5}%8}r_)1;rDleY=_
zs`N8r3ZG}^=p>IRPt}hdF;x+rdeXu+C24;;e@72w)&HF5KtUo*BFgXEltQ&RN6h(7
z=!HwIo$RZQm9@%R`XG*PE5Dm38S!%dB*BP=_|K7xWZV7#u_#PJh~tW~Zx2Be%bVx#
zqwAy-&YQY$6bQk+<p&q%r6d~wCX5!)tl(S_+B^r`L<E4D2x11X*#<oK6@wAa{jI3y
zzVjjHVi=B_kse5W+{n#pfOlM9Yt0#Uy=GX7K`<H(OsfKiThq`gi9_=vUj$2b$faZm
zmv4HJm8+Z*&5fMt7a51lYHOh!Fei$$$uW&IGJzBYBk>w%8J~5MXM4qj2$QdZ2L$3o
zgmxoOPk-^Z(e<fB|3_mIY^*#>?EE*0&t#->qCp%h>%<42jS9)@qe9S2daLG3&*4ej
zs-XQmd~k1VvldBT2>%8g!1&|_#ghwG&|d>D0DyxMY8Qk_4g71+9SRL=JQV%^jp!8=
zHYI6h-8+EZ_7SuyJEyvSbQ8!wMfcJ3suwn;Ibjf*lv<bpp+Xrqqkt50g0pTkIRT$h
zRlAhWF`ibs@0@O*zV5{Pr=Go@qAeQsf|xgw#Mmsb6b&Ru?hFQ0rhXCz7t9-H_vrQW
zgS`cY=@+xJL8c(P1;h}!H{&m{yo?>1v)p0*JgSdPwUF`ZmyFvc$>bDhRXXYGb7XMR
zk>&A$%5b<J0s(HPsnZ8(XT`>55_)k>X&_ZF!t}E3bTk_cutHxxT|%27W{(E^9-3T@
zSdca3k|%S|cp%ETz{cX(4hrFa{G)vnHqlXy35>BL{zZe_xao)c2XoFyqdCe4t;LSP
z^P{7AU0GC5eoPuo%-Vn*CqVI==P7_<!C~lbtU=OO+s8F;I(w%zZ;)fy4DrI{8!C=u
zb8v@4DJz0`1g_$*MCA>uY3Yp5bImxg&|8dhnU<HIF$loy7K4=8^fSgl=-*-x6xM1+
zxdqTsLvcau58h7;97~fnN1WmE{wH>W3)RwiQFi&Fga&Wd-F(eq1K<{_4e(l(_th8H
z2UUM)-AD($8CH>?&Q1Onko=HLap7X5#e;MLTp?yI?q{DW&OIJ`R93aKbMO#8z7O2B
z{|$)SRaF>+&Gl)u<3ktg0W^OXH>*728+J?}qKjq(tHSaYWGOhC4L+2@#iFPE72hK=
z@&<c3RlLcE*$~jTX?L!@lq|LNqX5~Q{nZxe#evCSqYW(*YEoKeq}sNl$O1bUo1cu$
zGJ!p#)na7*wRr9at03eW&0s0xg*On-xO{_a_}@#nr$f%?e~Eo=U$=tSCIPlR5gI{j
zpJ3|iJLR1_cV_)NJ>Yd2=56jZ1YGEnIhi9M=+8Ucm$P9y>cSY%$J|B#Sm~$sm*3xj
zTP_mrVFrUEfqVWc{eW?!$@&WA+2p!x;YX&H8=ABv0fHU{&T$P=b|R~8+dSE*L8{Jq
znH-C;=CO!-V=QhoA_{Vu39$(Bmbt$g9@N>;oLy1j&d0l+pSR7*!wr-bvOGdlu;)6C
z_4s3d?T8%XN_je|h~hlPcA?w1ICP?)_8f0ScH^#D29>XG>j}mMaUyfrm#b_rhywMd
z0~a?k<T1i3^JL#pT-I89B_wDuDDZ`uY(0zGeZB_F!x0yUyR0eVLa)Dhh7kR-I<pG1
z+|SNaz&^_zhI+2oBMK=NZ6(EUCU^QOrxJHzyN{&I6gi!$PW{dW4N==UC?==bWa#PO
zB++YPQ<b0YoxIY`k&dQrnsN{t;Qu#a8$Y3+Wuv7pRk6gS1{13vqMY~rawnbA9Dow{
z5Bg`UlWQgEcr5znp1jraOOnLJOOMamWnfx(cj=QRDGgMgP`Zh?^&z$Mq7z(zv|16>
zM!Re~S17_zywL>!9Q)9~hb|1XaS!uwLhA=V5DnhtJtxl(U_YjQW?H|?Nd`T(Y!Bij
zZZ1u~H87po$ZNkbxBWGchvLfn;KAGv&Va6X%^%KfK1?s*kfz=jkLG^SyH5QDJf7Q}
zz~{C9K{l!IRc0Wyu0440_D=o;{{O?j4I6FTtTufn2wwPf!tA;K&UCdl3{FO2oq+^*
z-O5;+xlOGxDGWVf(@NpqvG6Ck?wG7Kg5c2;Q;+Qanbx2RftMd;hTtsQji)rzX9P@b
zP6+)Z)|k|Heq%<yn$|E|zcp=iv@t2;{Kj|+qHWP>e$gq@r3j7D^~jss6yErqDBjwB
zP!@ZZJmerEE-z5NeekZ5HMqp2<QPryY{}_Q&KaHl9j?+y(OlluY*GB}2KVuorOLvv
zhv#^GB;x|sZaVOYy-N=TkK0W3=Idoo(yIkD>L!z+N&Tf7bggi-pmx^N3*E<>Fw;vU
z>#H7E<|%6C=yz{YZN=J>_S%gjSycJ^C3?=eYC;^saa^$_rF{NOss(%WMhOikDnlg@
zWfm)Q3>?IRf#fLAi!AGPyPCYo>>Z5c$x*wKIu&ko_BzbVun%<RsaE-`iW+nkPSptk
zZOAacx-Z=ior5jg3shs&m*#lHx3*M^9}7JeU{-1jR<$i|bAkOrjk=uaex1uag6xNt
z(9nsKC82oX!$^Mu^(`$c2^ev>yM3}7nZO)(Mf}w|51E4yy<u+B4&M+Few!2d`$EU=
zGgQE?0{E*MThPQ3F|gd!|Dr|~j2o#~kmi!4S`G9(jkd3yzO8zLO^lT2sj?Y@#9FX4
z8UY=-fn4csjxk~}X>ML1^iA+Iy8fF1gH;eJwQ~N?g3XPc#iA@1ndrUsKXn`bY>~Q_
zo!aUA9A~F|UB6Qo@(;6i^ZrqTcB6(13Qdj@e=ij13(etk?U{chG5*gX#EY|kUj;}v
zSXfaT@zu?%loKCsR=QZf)U3LQ@ia=GNu=uhj0Q+7i8oBgbfVi_RZ_XuLCR?yJYMUz
zSDo0$D)f%d`Bx>(CYh)+B}`;g-P(4jJDo=;{}YKM>=I?-LL(w~sdd%!5mo2Js^U&D
z^|H?YtHyng6OV8i_FQUvqjyFi!8)3cu!Y^Jm{4pT9e;Nub&4z4s&MBwb;<ruH0y>*
zUtinn$@ZJu&N0L~%zHroS?W@&1><iV9B})l!TFl2A3Wk5=8XBj>M$@-7tcgdQP4vx
z?I}7AtqL!Ki#5oox$s7Sh~r{3O-C7GAo+GOeqLpim>Yu(s=4o~6}7|CDV|g5>%*Gj
zECEgiQeOqJSp8J>WyPW9Y*Xkn=^}Hm39$`UT=izxHW}eGRn65TpRxf+vy{N!E!gn3
z<SjK`mvh{Rm3(n?-;0+-+_cYg!UsH)?j*hH3N=w6@E&xXpxK&OTFZ6$DtjY%uY2+O
zSl=QOsHm&>-LCAl8(dHgWu)M;%Nao8Y82iqUoCP*J;r%oA~PT_I4orSv65f~jfs>9
zk}g`RF*2ca`r_&Ur$J)2BI+0~SkDca>+T=9-pTqymrJ;=q2=Dr(c$6A9xwou5#2mK
z-ap=pL}bm6XPZBjy`vYm>Cmb26?0#&qdCz|5xS{KI+vpo=qjCzkc=4(uHY$0B{)~y
za!V2UJ3$8A$w699yGY0-H@4%k9!Y5BL~A&acVXm*<VK;WIGg5Z86N#>mO0#$gHU0J
z-A!={E;2MjPj^z~y*m1NZx=+($6TT{)?~Z$_XLZl3w~HU7B^xG4)Tm%cD#-7aF>H(
z>ibvoS$Fh$oFtMR^eFQanP`eK*RU=AHyx)WEiE5~6+O+L$=l95Vl%bnQn}>4J`P@w
z-PiV%m5C{CH%7mq))O;Jf))((;BSBXTe80K!|EFRzxB<>5B|FD_As_Rl=s$cA3+Z=
zq53`uuD%ZvLNbwxa?r1H0%XcOXB=@e7%>UQgDF%-EUP2R1>pr#I^)I*^5GQXjodPT
z{t9ZSrbj?D3+2i)iZqlMZw!e-z`VWFf0qo39%UZ_353E#qam5tyzS4u9nP{k|C%_~
z#LL-lt9#ZRqIiwOc-U3E2x47+4X3_n6_So!qs*pVpw>O1Ar2Y6Dd;IU|J5kiXgCx8
zz9P-W1s0X?zFV+T5k|(&%VDfszG}T~xGK}~9QN$8S$Xa=Rd(+di0AS`46BiR8a5YA
z0Nti2S=_`dorVT!#Z<4Hf*2C%YcE;!dlyCyNA`VaoB{0NKuBvvVxe%5q1!&C-=IvY
z4HJ3p=>)uzAR6n)ADHW?^7_X{P!`uqj=i$Nkhyn{vSQaDoN{izd(uEG9?oS|z7s?f
z$oO%Q(Ya!YS6YghMzq<W7+lS!enUwG&0%iw&j{*`R*d6|j7EFE{tn<fMbs+M2LES{
zxAGyozWtcPY*<XL=MCD74$4(VR%E4hsSE0++%K?BCm~v8x?A(6D|Gz!^F@a6GbYLi
zc5A4@nE_^N?pDU9iE6#Mv%Kvz0h$kLr-@$hqu$)zkB@gTNynE_WShHtpFN(z7k5DG
z_IiAB^p9VX{lgbWHewrtJt<wnjwGmo+x*kD%i5Y6^%wc{a(1=~pWaU=)BMv9kM3&%
zEc$e1jGuah^=1^HZ*IR*-N}Fz@TlT?g}6p%pz=9819>95?WFeWVKK@D=4##JCoCM@
z+(9`zD|?gtEL(s;kDbP5yfHkRoh>}v^{BVdNYu_kWRQN$oH10^e1i#(Ob%T5b_N9R
znp_^rq_cCfe|(zk?md6~vdvWiImt4zf~g2qDsK9BH`WfprX#!y$xWl0mBLNFTsgd&
z#JGX*8qcFK@sq@NOo(40SgHNSJ9MfntGt4FtH6x%+)<Ylm*uWWx3q{mi&xtLbMyA5
zyg{-BS#q%Z9AUlp^Y%dvh@<#{LlI2tXW}tO6?dBTieMAEy_{^nc@j*YgI8>h?rd~1
zz0|o1|Crd?UWgpaTB?k=Otrbx*KRPglJ4HVmr`cPgKLcji~olh@P%>>GrXLNZBSfg
zT-TD4$)LI89Md6Zz#A81BM4${T=v$tDFaDV!fn*VfwDM`Sdu}WQVMPvQY&s*U=vZ^
zCa-E?)wf~ZMs-PysguurdAX&@g+KbvIZ{j@Lf2wW51yvh65>EbT9LqLJ8EQ@YJRGK
z;6>-*q0{%CNu@#oRF=n?6YbF~2dk?I22_FMurr+uR(4Qwz&b+`*5`FZ35c=i4;Jwe
zBb%Q#MvIN|mgmUMcaAsibDD)fvpPRR3<(9n`2If40nb<1ssPG?Lh^<jB{iMYq{<0@
zpOHEz{8h`R;4gZSM*RKeg@4$z`u2ScdF@3SE>%%+ZzOe@$eFX3x)xGI%ei>zc1T0L
zg0Diiz}TH0EcaK^9aKpI{;E0?JOQL1M^dSy0<kMi$~V00sU9!!m=4B=P+ABx|JUcw
zb^f)AcMPV(PtanA!EzF##)%yzl`Z9Zo%MRK30T|UT9Sm-<+hJ<VU**FFHlb&sNh`m
zoPA%f7Smt#7{&4%hxsx|BPvW#<OnV3Z(6%-Oby11cBCM<$qW}4%_r#O1iRgE6yoOt
zc|FDk{sAyH2}ai=P!w`A$+%T?Grm6X5lgGU2&X*9ce*}pD*kSDDbz{si*#_ff3RrI
z#zjy*z8g0Y|F5wjSlTb0^do!nr($TmWBXTu+s#l4q!s){Y>i>w&I;k)_Y9tnLDQzM
zBVQ;t>th;D_k1?NoXW`(GuKN>|BLgaKkFyPl0gN*d}2ShO0;VUA=zjK0!22iJg?R3
zyK&qXFuCM>k^_T3xDLz`vCFU~b0B5aPmL<bnEEyK-yk1-2xLMr2Kasz_OlZ=t6os(
zq3vbt#R%>MxS85?fEDKqt&c6}`Z4WNiKbLjS4fJj?|YoS_K7bx#gq6c<1Fchlcwjv
z@LS+TP{*+SbHe3h|K4b6uvb}7a?wF{K25UzMV8!ybCAKpD*<3`M<)&_k<+`=|L3HE
zHUwJx4Kh<zhG5^4koQYIGwZWr^7p+3k~7mt3nXYZ$0L@c`HRyt6PQ8=Gfc+p<q@pO
z!;HUL322@qASZi$jec=y7O<D91vJxf8*@>(_8})h<wujD5?i%X*X9jf!1-;ao)<sC
z((KRo3uAT&y*jr%fmp95S#Skj&K1b#_gOXV(N{S}o}$ZoPW3zjC=NA$P_?7ir~xHH
zexCNSKcLQ$V~NFLO4$(?IA5R;ubcUhnNsq7X02CPP7W1oDPkv@{`0LZty5N2f~tx$
zf7foT2xI@fd>iqjp6kLP`xbNKpfT><^IWV$-YPbgnwiW{!P8u{uN5`}e_1D=YL&lm
zz_1Ke=w&glv+;aD*SNXd8i?h>!)SW;#Eh}v5R-+55Tz%17EO!6z%HdtS+UpG7F|+4
ze>_fan3Q-6_e%!cc@%KY?2N*8OFvu|%D>>GMhgMKXT?8fM-#y1QL%y|_=<S6)MDkR
z=wiFBdcG`*oH#~Wen5wd+P>v|ZJ!YkrH*OEKb$gB?DBSDYTn0ZL{-FYjlC;q@>*!~
zxcu0y2bj(8obCYPxL;2`<9x47(yQ7{s<p-3+%4ePZF;T-H_z{$Gk31gd8i$P8+EDC
zEhy_sul%_1#CJMBFWRlK=ht*C?*kL=!u_uF$s6K^&au(0M;I2PqS|vg1{QrX8+OO(
zAe&CH$M8`XzkD+Ht1g=4>OQ5Hw}rzcERno)ZVl&1BkAl``!SiVOtW&j5K(}}U2J^A
zY_wIGVhRTXvoF00S4d4?&z1z{{>AzfgT+_w71`c7{8M^+tS)<;Zz$d)yu5Xf;}j5g
za>G>~u)y+7oUM?TU%&(_rThb@7L-V><CI*VP3?JsvOyBSq`8{eN0z8Xex7ISx)iQ*
zwQ2>!UsR5-WU;7$V~%yDM`hkyas9GxX4vGb?m|?j+PpuTu#3#+GVm*t{@FrPy~w7}
zbpHIX!FfK&Mp)tIGkB$OKCY)W`11Bg4nA6usyz!WlSYvbJ|C!O`NfCqx}Lq2_qV!a
zv*Fw><$dkm$a}dWSVxKq6innvY9!;6;3`ZOnbL}M`4y-3nP9&xrgLE=?{5Qk>%w#c
z;)q+-t#N*U=WkA*RZl3V!547g(CrF(oUP!I`urJ~v_{z1A282)k2o*9Z1ElK-|CL5
zNx~Am{ela4_g2#hqq9Sh=<6?-&>VKp3B|d^3BqXlqO9*$-rq_Ba~#)eL5JV&9K7zF
z?wxdBZ69vG#Qz@c?qMF!ieirD!|^A>e*73ypBQk03QzyBScud|P%O3R1c)`(zu!uh
zR+d`mI9O$Q-Y3tJ9Nw+01e2L$aK($e^{aFQ^PLzy|FGYNX{=x}cpN9WhgpV_kaa;F
z?)%RI>1XIf=k&Q!j0V>$?9@{>s%C`nJo94JguBYsB!AnAsc({SgLhu-c3&K9zk~<)
zywg28Jox4FCM<HwpEl#p!S>I4b0$1zzILh$TvT<l)=obE`qk<1R<GnYklGvO!@YF#
zn&Y_GRL&>G@QY@F9el|Iro|TxKP|p=^@}SY=YgR6nc7KzDy)e8(y54I_;yoC!nxd}
zfu1{so7B^D0CAOJNzI$Dt{bMo-P9Gp#$Uxc`)2#(5OYsa<)mIZ(#q7~+>%C=aJjz*
zCHkCRrlX`7^)eKwZ~o>N9u`A9I8i7MS7H^_w6C=!hl>oKVjfYdrm<3H<8(q{)adEa
zPV#JXq1jYcJzC$oN=6%7SD&RFz#no4S6sb;?&BDHu`Hu)>CKHFRGEw`_VfzfuE;j~
zga=W}>=l)8sB_{jIT<P;BDUm{z<E&Z!&c~*6m)^1`fe9XTT3nLDpT_<ts&%jey<=p
zFEwKFC!j5K3bq85s&iQA`>p_+X7c}M@8A2|Hj+eP`23wu0dpQ(q)f?@d`Ti-a%73N
zwUH&SBqy8W`0xjjkc5~5I0PwKnfUqt`CRW8d+XL$G(b?cGnw7N?l>aQ*Xru(s_MD~
zV1N-E1K*meh7_KmC;#V>KWgFg&*w$-A(aQy=c-7wJ779a&`{&EMxz?}0<bwpBSenY
z{~6Fxt<>EQHyhA(jbdeC2DFm-{H1ra=)j8ff-*n-38OpOef@TC>$rClz8KDkKVgJu
zT)VZs@Bjz-xcVaM%Z+aP;LXA^Mg7&!7hGEudlnrWuq`VT2-OlRzxF_TuiqU1!eZsZ
zuuNh&LRZKFdOS*2@~iC68T0n5-u93EgP-?76keEPPd~1p$KlE>gYzA@mlGKIp9k(2
zyZ_bydH48L|Ly)^Z)^M2*7LodlIkCS^SAVLn4Cs$k9z%sH@*F%qrHZ+n~tgn58oEL
zAk5~N3i*bqt5D-cG8E9T$#j@D6XQ&Gy57w@y-|-h>h1=e-LNYP?Xgf#oWXhFjsTxl
z2I=^mHq2sE<61ZAG|dXKk*-$b8g%@Sj{6A3{$(;rPdzIJ*<#0gN9+Cj7@GKK_h5hV
zna|Q`a>MCU)i4bHhRL8#zmfkm8q{UjJ}hDtH6~pM*su(XNIr7Frl0tSuR2!N$tu!C
zs%)U8az!NG@K=&F8{25yuUu$gLC5zOB53FN)e5@V&RsAPWwB<}ofkePyqFc~ARYn4
zIoNBByl46PmW5z%66NNv7i)e!*n9(pii$q#Ku$93VGi~hO-8FtW(%9q(!1;TNwEYX
z^}FnSzSJSC;h8kCL<nDS=nII{xqw($$rOvbSx_|BcOhj}2R=8v6HzVWRhEe5bkni0
zXfKsjJ2$C+X|yzf{t13+l+OU+_`(GS>m!uEaOHKd7VBwnvGDQmFNj-!ljv%7mSL(E
z2@etFljtNKT25-vU4go!O+wRP*g<?`RE?EkRU7Bta<rFzNHAEq@w1E2NCe~m=Hm#%
z$p&-X1T;$)G{510zfn*uTbmpABm1`42Ci>UB<>Q?%78+1tQ3@E{$eH(QIe0?P<oko
zHbkM&(lBkhW~UgbDNy5x%?U!WQtc>pjzK|LzgszC>Wc>LUhb>@Rrl`5{pOA**Kl}6
z?9yP8I$<a!3=f6jMl_8Ae4PUW+p5dA7dKNS+v<QS`xFRt(Qf_B6*i-{1=foxR^L@V
z8FECFrImOIaeQfIwxm%$vvJL*!!2?RGHy80MSLBhI{YMwiug3)88SqI;lfip=pn^{
zBs=R~cG*_r=Rh<OO^q&*lI*e@oxq7R%&D&&PJfEu2r|&F4p&nk$Z&qJeFaVAv}OBq
z$-l{-Sx~XR^%i8L-u_QAPNF6jIDIGw5Xv)fhyOTJmTPg@Ki9;Ol}4e?p<jAO-eByC
z)|eFgVSR=Zb=_rV8VZ#S)LNgsbS#)|cx!U@0v6^7oomY3PETg1@7C8g9;o<}L!<;}
zk(+~sKC%1gy6+x^QuB~}^x|Qgtm5)EIr4P6&~_Kw_MP&i3LUr}>C-2^F0-=k9};8A
zk7&Zw5Zb|{vtc|zuVgZY5Ad3fFP{EO&sGBU!*3cm4Iq@z0Sc711)B`mz@5iZ`=^}G
zQ-9N<f8Julo00kW?%>Ta2q;JIqjzY+@eYSi|E#XAzJLFoDn-%CdGrL&2RwY9@jQ=`
z35+LFZ=<$KfMH@LcUD#Par6ZJrJflGN_Fz0GF2bl|Mq)RtB9WPf%MF)CC5}7X~87L
z+!lHmNXW^#R<{yE-$MALoi~aOPIJ1+qxd7Xe>Ue2EvPfqPT)~DbMdIib!P8YR3<X;
z683#M$up!?)eU0W4%8Qs7d>8-Qd}cVw&_GcLOZ&yZlev@ev(s$LJAx=>~brLQbyDG
z0|0D{sThVyHb@Ml=*~NOg8#}wzbz#AGJ3ObZSTRhxQ5{^;lv_Ujt0228to?uAn8hM
z+M_wx(BB%RF(pleRlze7-I&vYY;sMQt}MAyW062zx<Pe;te+S8WFYbJV3_Qa;vRDs
zP=~kl(ecjie$8_3o_dgizZrmZR3c`D7q_}eYt_x-UZtZE9+~M`1`9gWvzr0vC#khZ
z6uQ4X+|`9(eb{GDm+NtW9LsoHv5NZ<UN;rGZW=vN9(7WiA`C*CdZt%#3TLTROgZdf
z(rI;o)PRtHHqMJ86*T5iT}Q<XSSxCa2L-IehXjWNbV3g>i=GTmYyd<%Zm1w#@_wo7
zBXs%Jc_1YU*nPnBe3}pP5l47Z)jyW1Bk?B#F0=e)q*)ol0MSqo*pCU1b4UGz6`fus
z2|7Y!{u3DT$!zq2<b?=BW-=d0^u^G-Uw_Ta_S;#Y@kQDllqTDwc!H5I2pki#eVSuz
zy=Voam=in9LFFeBg&mn?(`FI?Af0A-GDdWuMr83Qw3QK(V>waQ@;DtaVg^*wwAE3o
z><$_Z$dgf8oTCi`>FQ9)X2rlVWC9h&bY3Z3l8r>vD$R!JAlA9lp$$_}6tPc`@1VNd
zThTVWfqjKB=OcWNSS^Y_Brtwu)Ehs6f1vsf0S^6~IP=GJg76+<qXW|@i%RGZmDFx6
zj1`hn{1h2wma9LpPijPwfG!bIL5J!#i)$Fq#mW^Np?YwW9GGluv=Ba0xk?b(ipS&8
zwVATgn(7v}2#54*cY)Ai1(l~`%14h=kSsdR;(03oYe0dFZIDr>4Pdz8HUD-O0`<;z
z1JRoa$K%8gY6)xVTWZ+o37W?|Lz$$IxGk6j?Ua&>!<quIm4a=U>*f0D2JM}b1i;X#
z27HRzg&}Jdq$N0snc|$MXXi;l*+ekbWr0LZ+3ElQF^6y#wSR4G{@Uu);LA}W@p*WB
z?e(G<buftR7&yS7fEvXoXqrH*&viD9KXO(MAn5EKWN%kbz3qdIRnSdg$E5{;_y4<r
zty|q0qKfR<0qIGEAR!nW;4tVN<voEM4*=(Ri*70IsXzyXq^?#cgoNBX-Z^-C3@3K=
z2vOpWqv`b8;u6^j*($_Lm~@HyGf69U34OR7nf6R`w$riI9RG&Z1Wt(~eGVhw9UX_Y
z!lD|*r8{!TM+PW^$qadL)(K&0o}XN2&yW)$+Dh@OP!47GfdY-{xTWgkB#g2_S%Xh{
z>NIWAWT4Cdvr^Ja#*C^vs4TYz3zDJJD5XvUN<A8p*B-{d7c69%WfO*cK~XzVHA1nV
zbYtQIXBz8q#vMk)m>DIC@{(q=d{$s$L3A*}o}_O5DTQW|EDXV<sWDiCI5XkBE)&D1
z!7OH34gSHpC3td!xH=xi*BrSs9+52;Pkc2xz=gX?S<vS_kx#0dWL&}RX--SnA}Nnt
zu{(B(cFOCN<u$8(eEdrnC!<`kh}sFDasRCgA04&Dh!i1IGsKkAN&(uRB~Ikx4jt?n
za<#+RAR%*3fXPS=wVu=<Z$?|DYi`iO$^#2gl;d|q%4iFL5R<2{pdT#EkTDm8+r;SC
z;L46{AX-Zu>H`*L{UL&DHQHtXq-bx8ovfrKG$!|aYV8O%Poc*lmagpl-ZiS^kI>6S
zwDIr}9SD=+M#F0`I&oHyo}l9#upvic^@Snf;sLBE1}h%ru?VSv5Z|q>Y^))k17$mz
zxh#<iR;wSYIrR;R2k}+RYZofl;*gI=#3Hsrv6>y8FrTE<I>(bZD^8IbfcUiYJQ~g}
z#$0`pT;x-w65%rzPAp=kYCwpmk#=l_Q}Nf<%CD3rh84Id9#VugOJk6ZUC}}h3AZ&T
zQ_v!vDC&l3#ySdHUE}(&Mo)mm?`En4PGAERb24T4v%mr*AU;K6i0TefnFGg*!D?%!
znB@{xEVUqxZNi|iQ<0w=;u#DTlfteN<kkpMAdo96xT>$5j22?2_hReq-f<t3`}L1^
zU-#g&sZt3dRFn&?K_wzt0$Tbs%JUD3aiABXN6D@ul{yzMV6Ykx6q_?p9;=Hqjw+zp
z1z%8LiZ4JD&IeO!RyoWPT)#xifoBWIBpmE`&0+5SP;AgMM@*x>_3)H?Y{OYYae7%Z
z3Us7W5$uuNU&J4I<SXMGHaj8P^5}GCu?Tpk*v}rtZv_0M{+U7{4LI7~+V>SXI>Z9%
z>R4v}5o@WpGzQZI_tv$LiGl?P7;0uEH*Q8vvD_)Kf$m6-NTpkt5%N_K@!DG5CBX}r
ztE%oEAMT`U1PP^RMUM>4Mr0_eV&t&v71Xxc;*UtZUeJQ*32gIc(cvsZE>EP8izF^)
zBq~U05w{y~QO7VpYKCNP;E)J$+*!vL`79%(_DBq0S2_YP2P2h46iOLm7Ibe0#|LHd
zz?^zq(K^fElyDwW3Jc3hU2%E}YKn0l8|0KDHbHi8S0lqvKnJ+0l+8iJsKNOp&oF<m
z-4w1{HP8&dX_WW4QBFp9TfiwJWR{9ci6=Gqf}#qt*vRbzmt&4mY1*e!N}KjX0Q`*Z
zQ83xT`{*6uKK)hQok|fTPOEyE=zsc_vt59E%Gw3fvvLL2&rkBg(Rum-%HZV5v!y8~
z<5cfN)Umg`R;TA$kykwn_k!5;O}FCqBjOn?8hum@sxvJT68t*qy<5Xv&tt|2zVXgz
zPpgBF66X*zPj_r9KO>XMX--x|o{S_fp`Vtpbd>t5B|gT*ri}ir?I6YzM5aj*<@hpA
zN3IUmUG_px>YG;YBcFS!?E!4kd&zWgk5*<F{b60_t$buZv1|S&HO%+3x{oU$sI09;
zBNRcQ6pi*{RVk2B)=3Ql{Zq_jyg=ylrs$u~U=o|<s;;n)BVGEnmCZ(@m0y4TxVC1z
z(td3%u|-&*4Wc<0*SwckM?fIp+*!weHX<^xSjT@h@SppE>U30^BX4PWbA99fgNMsY
z2I5iF-iL8++S@?-)#edey;MX$_I^2f_nryF*5S*a;BR1WFN%(7kuF-YT<>bY`ZHh^
zv#vEX3R+7EOl(ov?BQdKOa3dRP6RGGP>fCqTQh~5#9*3W7PUphFd+p|;qRZYnWet+
z_R?0Oj(BqMGaLuMBt@I89xjTrE(b@YE3W=2YIH0M50cX@PaS1`f<ieOe;|OYn)v=S
z9u<k$TP-VFkTC^4r)lFgY*t*E{1;?G<FsPuNp55!ai`Wo!ZEp!yL>k*nlf*_4Ro7=
z$}hoOmxuxl2FZBZ*^FA<2!N#+_CTf{ZB(HwDjL{GJdnCr?LKB$G6{cWoMH}f>nR8s
zmQ@L5+CmoVw9`?6%(p3`0>YPVIVSNnV>((gbtAcwh>Mk!_&`#O;V#ELgF?$ShVK>b
zd6h35MTbY~z-;CBWRiEult>vwu(b=_=MGsvA7|J~8VXvq`i&Jk9f!CKH123vY~e`J
zP-P3oS(Q!|Uvq1=oyGEmtaaeez9hR+d9H><2gZR7b)2xjV$)elcxBtR06w~1sRz51
zXkWvMz+b-w!+xnsA*)BRBVAef4O0ZJb@Z-=xs{ufVf0mrz-L*Ua+q<~HI<t;(-@Yl
zsQ(czZwFp+#^=~8>R{7_PlzZZfgHn!bVI&C4qbuPy1!r^nefv>|M7<jhb=Z*UhWO~
z%#p(F$m$d+{EwRN7&=@x6)-^_rP~r@etWzB;^1(*SDVL&1~W=YbG*%+QrL0dBwq$y
zH|t<li|SlJE{<3^t{3PfuohMp?TUnHDD`Ynf%X>z&EnIv2BQMe5Ka;<DlDuSU6Ya3
zBw{j_a+t-#&)N~iXE8Dol-=VD1s;=g9o{<z0+yX|$Oc|Ajn}Vgz~!Qp*h~FoS@Jpd
za#abmZ30jqwq04HmMI2TVKSlJL1>9|UXSr8otmVaz=2$*L(Ap{ItI~SJQky)og*W>
z;YkIeJu)-1j4#A9WYzHEk7QpUfdw{?Vk4j|t2aRu7$AKboYN%|aB|oTTCQavi;$UO
z)N*gdFzo_xxnq=Yk<ZKVl$xHeMz8WKx=lg07F&Tuk4ZyeiP<_yC{`tdHj3qDbFN}4
zgi=yArO}+Dwe$s`64tiV32oM=w$LmtpKw!At0UKXVy}zhE3D!LwiH`e8Yk(Q2HvWF
z$m5nmSZyJ!c#To^<Rg8VPG}XRKWr|pLOf6{Juo1_B*NAtKgP$cYgH^IHKoCdQ$(1d
zSl+O9^RoC~Y*@69lW}rjTC^yoe%$W~7r-y?*4Y^X{_lrqBif7}QoKTM34XA*v)H8T
zLs)gv#b#G*Ggm6PUM_hTOLnnz;--l+Hm;Ylm3<~aN;tSroeP)6`(Gv1;jM?3-{$_m
zSoL;QibB+7j!GXA;M~hcM6=eWGI7Vks27l1Kq@~GL*W1S-YQ9FfNPThU1T_#Lu?4e
z6(I!HZ~(TXVj#LdePcegOWY?@9HL)lh&Jlp3gzA1gnq5mR+t3ZXI)D5C`~(bLXNyR
z+*SJJdU6GmYU%1(9&TXGYrwOw)?(01Jim<0Ygutr`qbEB?hjF`1vuTZ76yf=QXLs`
znT_-ZST{K8ID_q?XkT!Miw@8A08yyDhj)R9+hwGqd#UW&K`Sh7<CSkJJ{eF=ayi(^
zr}*PdJUzEu4-U6q?C$l@fVEqCDVIu?JA!IYxk2!*<?mP}T0X_3BB%KnC;}Jmwk9oK
zh!xKO-R$YOlrgG(3PUd1D8~wsL~*o>B`cyfX%hR`Ul*3dzA1s9>6f85*x4P6-smPy
zRhD&>pvt?MwlVGCHLs>fThztGE*bP0I30}gB0*@_{En8`2%MdglK|d3mKI)a>t*%b
zEMF$-`kJ*abZ(kL#_P|5t5V$TX6ZBq8T@zVB9-E{OWrqP_1o2^@Y@HkUvKU2SiBL_
zPNl`6OmdjI2=!OMjgiVAqg+PX*$aS<oxXye6xU0yrpXy9-_(2lU}X)F4XKG6PBP2W
zB7r4*jqKSTywENj_SbE?*~Ejy%7g2_3e<ar#86i`w|@mnWBxF=#;O0NW8i*}F^{O1
z5WzW8Bty{&I=uKkT-h5rPIGAy!z))|<Y=*6<f$YbuXc})1H?nWcF6}#;ogTN83O{W
zu!7jkV{{c?<IVY5JQ<EK^DYcjeWY=SvD7d@%MAeF&>yXPfZ;stX;jb*y%evwEYefE
zUT~WR=&tMLR+WyC30qr2E$O~heq}f|l!rAdG~vuZ^`=<PCc|eD9=U<3;B1NM6W`!p
z*Gew1mbRnpw2d1cEpo}TwItU|dbw;ko|+7EA!6z<<HWovYU-2*L>`<cgAXEap2wGB
zz=C5_L_$=-@TYsIFYD}+IAFs2({#f2`k~aoG&Id1g?+J;$t26G^chZKB+Yt7cNiYs
zXx*pzR?p<wjJ<2<g%`)JCWCnz^$xf8U-nQtWM1v=<JGOsOCLR{@Ge)6xPYoK|Awat
zLz}KzwEL!;C*FU8M_Uv)J?%&1JmpRFBpClGYX$5loMzm@;(%9urH?f}Rhy&S*{2dd
z|IAmYgvsa#iZ>C15sC#Q6=-8DAju9@^AQ&I;SlenCwS*wLdd509Aw-TWH4q2=ZLOC
z9D4-SK&04)(&pWD6Q`g~V6Gq3fJ4RKsDZod*o444l&$J!Q>|Neg0gO)Y8_;`JEfy$
zYdEah0N&wMu6qQCR&h*K43sH!b+}U{|0qhK6fW%|kn|p(&?S}qG}`Im9d04mJS-0h
z#ebirQ`W?+Rq1a+)$n3dsx`%)QmC2m46uC_n_{z)_ScCOq4cOUj|Sp}{WK=O)uh+n
z{Q)S#DDe7P0kY<tvvhHFC)nIf3W374`4aqRQ5fR0&@m=5G9DA+90$w`&gV55DWUK~
zFcYI9vWO3c^T4O}1j9#dWVAe4l9rd)k}#;>T@7t+>S+#EQ)rv}`r6n>1YugMPnjmk
zO4Z|(@h%D1LzkFdrBag4jmk=MGO1hTO80K_=zz&RABGra-K~a~#<^`QcQgRll>%v5
zeO5GrQULu!h(W1(05BH?{?YDqp>8}b@U}L*Z^Kt5E9w;HJCnQSr@l1_HpdC&^V!70
zN#zm(3^VFt$tn#u2H7m0rdd1+qy946UsrCNfchVEJ1;<buy|NV&=nAQ;vuD251tF^
z(dn48w!0&p+26*qw=%p?)hH>G3@adO>$Rel6|!na-L<lWv<w}q=|cD{WW=$MX~m#e
zxFwQyq}sEm(ZjX1I_}S-?WN?F!33oZ2xa^B>c%N?Io&pAr|rm~?ybAI#a$@Wzj1#7
zqT@+Hh^+m}FUcv`$JfO)hS0E4BPexj5%KNP3Pp9#l#@MPXW&mLXZ2ZmlyN7T#c?lL
zvploZYxA>X!@xM$-I}FS#CtH2)k3y9flF9B=cuKXzNK2~1T^}=6n8F9>sxK9c2#6W
z$scXEZjBxPL}xU*&y&|(A^4b92Cs+AHJ{b3Dvb8QgZE;`<%HF7uiSJrcw+>^Ky|LX
z8EhIN8r}|8nQ>aErHyK^*{_zuy>}_jg<m&&yJE2FaTD=S?x<}oxw^^-Ut3T`Skb;%
z;Mq!aYJJ0~(SPfrJq6o6bjb<had}f1QwB>-SY?Ey2z@Dh5#zh_t`$CAh%n>nItEsv
zAQOgC)&~-!@DBiOPfP$5b6P5^I9MoqXfv}6S>QWq3}R1!rY7Yklw~+Hfi8Tu^?;dx
zWfko=;E+dqixHE_E!lfdExH|#N`2HT<{tNw{BG^BV@#uO?4(KUAHWyIaiMG`#ZJ*C
zzSd=#wYt`gnOgf>?hP5&t&eBe+Ky2tg^jbW32!YoRb*AWI~*Cuz9L0q$2;<Bf?SD0
zTiKzWk|8RE=khP@NNrt`2kljmI9dFv6e`Q@*S;vT*JAfn*|Hd%QE1e){ZkyzlnRrk
zs*OfURO0c_LKOe=l;7zDW30{(vu$B^Em*X5w0*ey<~Z8vJ%9U>ykT0K-b+evP*xJs
zu+VZSNob%4C%>Vj!mooH#aQ?vJ6^-15PgFg{~oYlp|j`i{f>KVU2fP$CG8e+@~u)4
zwkDyKGM~t*cAiD8n)EHRZQW?8sCVfu*)Q2PCa9jU_kKXrP@%DMe({8UyL*2{H&$!e
zTAo0MXpJ4*^^*s#jrV%jC_11CS+{k2*y>^n-uA#7MRZiQ@m-Ee(XDvcNlFV;HbO17
z%|1as@-o5W!`V00yoe13X6H6M;#RfM?C6(OWn^X)vn#0*q@wiV0yZdM_vo5D=P`Q{
z5$5u~Th>vF&;v-h#)*>&A5H008O2>kLsI-F$P0(sB44=Pn>}=>1K<axQ^lwfV^p5O
zfXFx<s+(a|>|C*vO(<Oj6j^_w!PBHPs7eh2g^M0vx1C$cZfj%_(`Qjjk$$I?f2iO?
zh6{oBG|rMr4AFsW2&3v@paqQvni(U3`w*QIZ+HP%DvNcV>z~0}d+umofy2JHOkSzJ
z-`m+JKLP9o1epz{=<RBmY0^7oL#!$=P|3AyIRmz^cq}WwC&7W}C9;lerffx^(lF-Q
zv|TN(+RC@lmwX$l?brNM@dy-zM&i>^9cuYg<aq-<rdgA>D+Um9=J6u^c!XJ{w$X<W
z9VVfHVG7e-cFVoZ23R5)9!U-=xkN{IAdI6F1kygT%l{DcA^w8R1eS%tFrqXDR<Naz
zbZp>(x=;Q!gP)HcfYdUWO(sCH`pGySNVHni(!duC$%Q8M)AHL%GPpFYl4sOoYZ>T8
zALc=O;{`cRiAOf<S`ZMR(U={-W%)ReEJdxDCXcNJigtH!vu6}Dh75r*nU1z#!8_7)
zGQEDRsRaS*90<BnV@=Ov9bSj-sZ2Ov1j2VPCrSqP&UfrO+B-NtvOKJ)6r5c%1re6p
zIMt{9UVt!3;lL>@9mhqA_DKK*0?Sq=o>S<qJuD<190f>Ho~IPQjgW-y<%h!(>7r-Z
zslaDn0sX{cPYwXt-7)4<G?w%NapBJxO94#eASn+6p{F4t;G<1X-nSeuD={TxfNk@F
zMzg%pu^ZIWs%%h~Pz{<FeuJl@98gE{;W2jo%vthgLI5TSP`Vf`Rjo0|D@ADDhRS{l
zY;UG57~RsMoimBHs`m{=I{f>L%wu6n${mA9B*Atr86nM@iqBjoGRukvBVG(JSi8_)
zhL^U%3sfX2fGWPpNhPQbMEXEs*TmM#0v8B+k3*Pbx*s_U=nRA1O=+b=4eaOH3b|nM
z45(xk_z5f)eOKWX@csvbK4YZGWIlusx%e@b-o?-k)qv)m;S!j~rLp-9@(_2?%bMeR
z#Tp5;aWe3#A84rcW8H&dmhuaM)Hlb6eiaXglgAdg#RAQ|!dPrDNOY?zj~_dEtkrRN
zAd=IvTWCkUek$X^a!14BRa~5R%j*jC{oL603ohV7`(;fP4A?T9jhhuF?%NcW!Tgw9
zqai2|wyxjufZs1Ll!RBr2-MQaj{e|u!t#J$hj6>HpO^w~;sx`^F%oS={JATE%k|%E
zHR>T-y&A}V1}c5o)leIhwpJ)d{hLWXs8C!#c51ghKJy?WDUiGaJMEIDs#{5yGIl<}
zSjGKx__4zj$7l0VNsECrWZer}=^kp;dzW0{>$c)iyP7|R?wYp(@19@p1Ia=OvzQ8W
zkcKVZ%+?9WbC;+Y7?xW!&565(UmwVHG9`|_9fT<+OL^=>Nhp=tEd<7uE$HRvY#P-g
zBKOe!d@2oM3+yFY*>aejtAE58*d9xGW~dj(6RT!oSP>)QG#y9?5arHQ$9Rp#_%?R{
z^H-@ys<p+|sNB}eWV)42)2-9fG)t$~M}vG48Xj|NutSK2=^9RV%q(s<%!)1Nr>7jT
zPTU{$?>>9uRpSn3!MR9(Pwdg%U|^;XWF!J`oR1G_Hcae>0)s^*999!|r+GzXKTzLp
zh4KQuKw%Nv-X@L1=WoiN<8=BWpU4>gBUianYR0gQw(*K8aAb-!sfWm3e%5Bb`Z5{O
z<&IFX<>>TcN`YVNdfY8|y4xxZ!_*sONTmU|jC{ipl$bSGiGz%Z5hBJsplMV?m!E1h
zB&nb|5fj0qS<gh;=XBkyrK9uo^vg}6T6!B#8v+##kH64xYEHcn`=GCH{mc3w6U6sX
zm2A+w>M+gy>ihrs^>>m{GEF|K2_iW+txRO##<gFhA8%Y&q|eW&FItZqw{Vn9k2wtL
z&0$X}o|{7-Soa%OCU3->R(>82KFq4C*Gu;rcTeqPT+5bzxJulJmdEg~k?-RPumHAB
z8O??4-x9{NEc}}>z-TLn7yMAXd#~lsf3yZf09rn`<B*4Lw6f8ST4?0EzKJWoj)xuP
zf!e3v`^tQ>rPQ|36PU`g)~BxO1~*z|FZdBUS(i?zP2FTgW^&y$24Sme8Hq!=VG<~H
z{nPYgRdv|l3l6JWo044jDY~z!euX$x_D$w51mP~oz5EC3koj-SRHvgc(;E!MOfHf9
zvt=z;JV@+;30bKgniQxU9P4$XCwNA!KfPK9RKY*@pI+@h>&}W~g>KLlO!QFP@fH$v
z+aLJ!96^_lhVr{Kfp|Dv!S1TYFDF(v+EC-olB+(=0{<W*_T*z)kgl6v>tBLAExIY`
z^7vQMp^xgrWK=r>bLQb7EC{kvFa@k|@DndRD|Zfjqur^Q39C6BcW6SfU0~1Re{crq
zsh}5teyDwGrU9&(is)U{yE#EDaGL%v($OfDfVuvr<I91{ZA)Lf(Om4uKP8iz`OTTo
z%x_6#)*a;I>oUTe&{0q|5<Vzsq3o$~rT$PQ9a3X+=7@@%s&?`8>PBl_(a=#nM{N~6
zc{q=1&A~&zL1-J4PYhkRbYPfPL+{<=!U-jbsI)bk<`;C>Vr)swq#*pLcE@Df1i&m?
zNlLu)Su#D`d0wa1aanCTjJ8AI6m{3&V#q0bYwb~k3qqA)qIc?}RSKLhhAYn~&^~2v
zwiW<CuosFI+(EsSWX<R~K)*Kam=P2+U>g%994C{DcBjMD<|h!{KG-`rBx{GTV$R_|
zBnean6zu>Pq$lX=Wn|q0+Cz!qNszVZL}AAe_0&}c1ne~8pByV<XW@-;RmJkHnx#@G
zGQW;lNDe^BrgCZY!~+hzbB*Sz`Lc^4?(wHp44R#$Ui%qiCR(bu$~Z1_F8MNH1yzz5
zO!V#4-pse2M)tQ($a~YR{lu#M#QV04DPDu#RHaPx?|O%a@1vh5=ojUr`Iczg2;1sp
z^y+DupzJ2(b1^%yqGeY{5}X%LQ;<t$XjpYq(zq?$!q1)ZG~Y^OBWHA_!O4KQ3)ky|
zvNT)jWnfr<<x$bB@XAmVwRGI4=m?~T#B+&$Hqk3kjgwi?SG79d*eA+>V=(}KJ85%|
zOaFVx@&y@$;$u)P6a7||wR_RkoH05BQ67Zs)?qt~1O~NvlR*jCup@o{O7Hz4+`X$~
zqOp;htlFBhhU+R?;mc%7B2ko%b!J>PRJRy0iB3o^dFU>hXO^?ld0e1@*-64#hd9__
z3XBvW10^wKLoJLsjeBP)9TPXQ)TQB(ZHbBysKa$|%c=!3)EMh<gOUJ3K)t^x2?v2c
zu`vpq2&1E!=xJDiVFsMkVXFP0);Wgsl+!8}x+XS6l_^Z4%E*f5NaB2r)*DN_7@YBS
zNv*&VRHQq1RDUm<+1cH$*<lJ1pMjf@ZSx97fEN?n7wG9zRK%ujrhlv3YW7hn-mgxu
zCvu~8k9h5&>YNjLYcqp@uBzSvP(>AZBizAzzB|k_(+=o(xLUHZq@k6%D!K5kzjwAE
z$N3&(Y?NDcrRa6zbz*j!vX%4qnX#MuRNhlI?}t|Q+a*4cEa2LfZCuB)dE7<fJ4%h|
z7;~1R%)B{Fu2Nuos44((l-e<b;1nHkphu{he4MuNdoVH(s@t&*ES#-8qW~|C2O7D@
zU<n7BJOc6#;vtm7j)kXP%`scC4Dt8MGZppdmI)>|Obc>DbP8B>l;4Y$U1+)`;D!P0
z0oiG`YhZl?c+;K<fZ#L>uK+$3kUX^mXnyj>%}e79+$!zD$=>LnJXjKIs^_8b!F($L
zUt4Te)zSs5s%oGW;q*yXcyYMf+uxyJmRvd=cS?w=zZgb2^+#x|1q18jv&mi+hg)_#
z)n$MMwm|)Rs7Q%2$+)%IVdIgNj2i<Z(`Bkhri)aJOk3{;M^;1Nyy|5f)D4%h&<wB%
zb#WxX21JwtZaZSrDw_mW&<!C5!8%`uC@fAB=97fr@U2>5kc3HuUzSbn7la>I`g{P&
z#c?&r)TZFu<;9@HgRB9QOuZIPvQVC_e@U*u%XDuX!J5vd_$=$H8hcbS(Jp!O@rf<q
za8GL+0@e{yeobtgVy^g=@NkB+lBR8U1jDFG9p#Y_{D4jg{s%r~LN7~n$UoA`-^kOT
z)L7tP_0OIFKs5EQsi$>WYr(4F&#ps)|5YwMfU#d)JGDP3+jJuu)LFO*oyKy)3ga6a
zN6R)pAa_zLJI`N8`p>!iA;yBAOy?!$F-mR|;J~C9)xMUCwnDLprImNk20A3G-<@bB
zTIcYZ_m<3Vb~^<u(iOT<>z-1oluC(i#wyFP8EIv17b~}i@bBtmc+%?X{Zua&nl09~
zHm18`sym(3hr)1PNzQAXz?6(yF^3f9xkQ^_c*ijc(3kNSOf7M6xQdBXp&m-XcpZio
zM?lgj1~5wOOF%N0=yFH$ee-ofO44v)xd(9O+X$~fu&w-52Eu-r?R2_SM6<E$XJ<^0
z;WbiyXtxv4HAq6&BI4^1Xq5mju7mX^SclqrHjK0j80|QQxQ^}EH<m`b==1ruW{~mL
z1O?i*{?wkVJfjuSIby68akZVSwa0oPEi5)yanRzk%-yMD0lUT20&X}HoJPp66E(u)
z>-I8f9igVn7vdu_zb^;8Io#bpwrAAN0u7iG-BTn4RbS-u{QB+Q@vaGWnpyr6xK-+r
z;RroZDgSUxC^wgcg#rYWu1Gj0cAJd}TQtCyCDjzO!2rV`m-O%+W^#Qt?&j4r$kQMS
zfXceSy*V)J{a0`MrXcHmOa@ILc4NCY+s++zgk<mj&5gm2bN$lLmp1$@Nrhz--*Pwc
z*5TpSFD15D55)^Sc9zqPW)f$!acFZ$gc?f^;!Bt^6qVArbVpPICIz~%>o~VTv`Wf4
z+~IM`b7=%t46;1&NeACKNkez;=*71hmsjlxAB1q`1lkDDMZfuQM6m`$i#jb29iQI=
zB8t0irBT=!kWA4}-^ki;e&&9!HGEf|^b2eC=4tbMp+Y%0Q*WB#v6vb=+?P|CbEcV;
zQ`3>N=WLIT5MJuMTp)$0=_1K;`q1%miekin32r*M+Hep7wDRuZTE}}w5fLsOjHiqa
z^}th4wPa@6u}?@FdxEP*uyj;E-q^SE*=QJ9LFtkI;$+Y9G_vnE{hGIn&D%pg<IoD1
z4}<d9Tuxv<l<FZA;vXcvP<(cVml&8k;>TX^O@C`|_orS|U<&D}PE(p$xvo_oT!gz=
zb`y+a;1t+pV!4F*hLle+v8r%p&NyA`DTU}%Z5XTREeVK$f&@kGq_oK(98U5}$(ha9
zVA2XkrBki20z-RZ$5}G{F-gW-BaGk2thop7(_uF<Ssf4x1cW}2yWZhXTlQHey92|D
zyV+2^li1sKT#Ia^p88r6t{;f5<ZjH?*4yJ(fK?`>6%E34gpB4*8>M#VvnbX)y5T{P
zpV5aKvl9wnJao;r&kOHFv@-utx^OG=$<<y1hsg!t7U_E@`2~7MwoT9u{A)ocvUvx|
zVz*;@5I4UdQ#6n=w<*P9IZX(9g^pMStNR>f9zCu&sF|r&;bP7uE&_?Yw4Jrt2x$n~
zyE`2ezHy*7m)$@Em{)s7+DY)j8eli2lWoQny3WdH6b#ptLIuodV00W#P(AwtiiZ5V
z8(A6(_%h8$`BgHJubsy?K!~vN{^r=RfYzQ6NwlF9;u)rTF;=g-0)vu4l7eK`2$cj<
z#6&t^QVJeyO^I=P81=OZMWU10G=zR)PVpOBWoT;+vX{VkOcIZQ5O{Y7gBwyX>6i~6
z%;J`Q#6xeErGK9#Q9PLBMWM7rG889Mb5pFYcGPA3{^sBK{iou$E7x%vOdr(|=JM{(
z!urqm*Oq}^Bp2ua$b13$FOW&JXuho1?k$NGFNh^}OQF)*-G6b=V!p#xtazI+mz=8;
zb6%Lp<}yE<u?lP4u|U1I?PBLPV@pYIX%7UQUFNG=2nZJI=qMsf5*jHnsol!$tBTYq
zM!oaCM)~P0KDp&)x=%;%$rY<Kmp<!;r5(YBCRw^{R2hq*^nBTU!O#K$<)y6X91Qc-
z9hGaQ^xCZJR@%g;SbEyQTY)_|OUQFSO-94Eh9F>#qI(>|b*QgZs==s}JFAYIJC8zN
zdg$W}HYL&YRSqY{B3+RV@jezMUiJ;b*`?YXvdDoLVlWZBWS|f62!qyMM`&qVL^*ZA
z2T+~9l$UFP7z1B!vE<@`=B6W_&RxP&oj2KDrQyliW-H8Pn=UL}1gS7V%$|)LOS_s?
zZAN3{bF?_Exz$8KOUZK&VR+*y64yl5*nMSy(Fp&oDtcn3-?r1@Q!-NKzBik17i#Qr
zS!ju~X}S_iY>249&=p-PAvv6wae>jxRLHIiIt24m+$Wc5K9b;nXjt#Gq(VHh5rDpA
z7{%A*yhWk>QaF9j^DDAIj)x;wn23`Y=Qc;bH;z9Ci#463z}<50dQys{r)1YVjdtHq
zc5${)#Z>D#cOdm;?4)4f=5?S*X^P)sBiafXOT;5+3FDmWp71lJdgpBK2}4ZMOb^I`
zaEN^KX^t_1icKkbwDr2z-#P-!CJcr(T!RPoH!%R310l*#Xq3BeaL{;B%OhL08#&tB
z`l%OTBW?rd@ud!ID~(VzTqajkrh+>t1Bg0&vAe&u*FV}mIP5`h-W=|_<53gM0cXz0
zZE7O00Sw9zldkef;p3Y`wqW-5_hdp@x4FVNnVg~~(y3rW9zR67rJO^Z#2CcsDh0l5
zI=M#m+*v|#_Gly|*IY$R<W)l3)#xZibBQZJsGM*D^WIY?N|1AadmFH+`e}@6Q46bz
zbJUt*Q&{Q5T|h>o!a}Yt#V3V6&oWtk)b$k-hd7tZ?VOc=dS`VtE?*@}Fe{m6qGQ^L
zK|PL+?#xDX+s>!fFi-f7KD`+8=#`m%o+UOYCGv~0-cKpKy$&Q<KD;QdM3?ONVI<!u
zMBII&7E{HJ!KSd^X+Fj9gW3&e_f16@SZi3?8bDd#69qcSFB3(mlv}}w!^^Uvfkekq
z>m;Ht`3el#HGm8mbipM(?=GMI3~(%@z&)W>5Tz&<soG}F$YmE%6Wp_`q7-&9|11aM
zQh(k0PYo+%SupVCd5VHk+KqlQ90qoXg$;k=O0dLXS4-nok7c(7vy34h8}k*I`T;Zb
zdNj*nr$6j;*=FwD?oFHCy}=9ES4?G-atLF+*<qt%7MAGbTB+tI37-aBz8yH%_?X3m
zCe1GM(Iug$sm|tWf>|^IqU0v1sdw?K7JQCZpoKF8GT!A+qdRRuA=loRg9NF`Jf+_f
z!{v_Ku!=QUQgR1<Q}hh1L;z+yj5?v505#^0c6FY~Z{9_=trlja3P=7Ix04Qgt*C1)
zPc9s?8CBuFrqHq~^R>#AZXzJVnE;YSDa1K8h7!k9eGh8P7k{uVGB<teMo(H5Lpy9s
zZ5+1%u3s-hQnsAXe|Sk>pdLzAnKIghF4wVqhbPTivEgjorX&&61`w>D;*k{d>XT)V
zRkM_xMPMh8BB6ijVu?;7h9z!4IZ^o#L$rcpjn5OJy!Nv!y#?~K*qC5L(jFh0{LxPg
zzu<d#Rt3_>bTGO){M%N^F)mu2F1H>stP&kq)ptFrI@<y^Kc+|n&N7y}b<&LOQ{saq
z0P7^ZOyPt^>k|%+a;oT_+WTjdd^WbYOw<3eO$V=-wZ{@EF#P!dBgo?s;;aFV7Zs$$
zuq~&oG7uzE@6|*+YGh-t`Jz;$Hd2$86x*)1KUV;*z~u6_7qzfc{>S7xSRM~b>VOYQ
zF+UBhHKL?0`6Sw?BTiIKWkI=E>c}B|7Y3z73)9vLh>Rf&w(6+u!jaVc-mK%co^DdS
z=rM^wHeY5jWki=tyD{kCr9QZ7bNfqE^|_BD3-~ACv!IiQf?DR-pw|OV)lq);c3rt}
z&>2SgGr0ncEAxsjw=MPtPtlTAKDfZdKxt64J*Lo3U1L9<f?qvVxf3l4bg!m&w{x@r
zvlzCO62pd%<%FS$2<`u15s$t&%2?VPb1omgRCrD0317`4C!Ujv&6YP18dTRtCb+>h
zffYE$wuj_VP}-%k?V>xjy`1!5?bfqr&!XeWHJu~5k!h8>hi%A_@vRHb(82@C5vokI
zg9W7%N?;IwlvC&-kxy0qF(7HwJ3S@8a*8cOP8)e9hoy?S025eUUFA!y2^ybJx>WX!
zb}sQ$M_&GOGA8j5-qJXleUgNIweVpxL|x3IeqmI?$1*Qn9I0-CN}q*?cl1O)r@D!s
zs|V$vGg|0->p@7aG6mg>X!`>exQZx>!Iqeu8YB-a8HE($Mt(86j*6>ztg@g01IDT$
z%&Wj0Fq)C2%3KVeWm3tgZU7HYM#+V^S%{90+vX;_q{2!lP4$(-tD!1Gtjkz2p_FTW
z1~F_7!-k_-6=HNJy6u9*67fQ}?Zl-&HF)<<HTb@E;g&_G<zs1>KH|jtItZXq2N-?8
z3SIHt1XUs(KgjFHW~XT5I$wQ<Eqrd~!rq9p`TB0F#LZw^yrk&M9da2jf!GDhyAYJ_
z-hJ<~CZAlA7X)k|$)Auuca<8LA>b3l^FYU@uEtPrh8n?r<p%*y5?4h6N1Mg-WLIwA
zl;_`81xttGHKj}UmEKuOD4)l5e;RIOd!$`mB2bym*yO7JCmk8O+s`>V)Kg+*@G%Jo
zIpI_kQ_>nB)fe#x($pivLf05wNtd`99UuZ+rG-Obfd#sx>xPtghLePBf~n~f^r$QH
z5!(b~?!_#@E2HQ%xpIhfesPlGae&7}QA%cN0RN27?2;)?87=IU^<>%r9ymx8+BI`_
zoUl17D>ifeSv+fb)p&1R6laEwQ`bgM9oE!*ALV#*T_%{+vaJgLP`Y~FJ9ydO`)RL#
z^mco@cXSkO&cn8<27cZ;+_%_e>9G^RpkV~9cLzVdkKTl?x}yAK8Y2eWYH@WE*$t2K
zOfC@()#WDJt#{bx?*7a7(GeOlSeK|3H&p3Fm=480JJ!|E?9-}7D{fZ(epI_9aiFc2
zqZ_rvi2(Y8;*J|knXh&3v12P29VY&h1a+2G;}VC<vCTEYsSGgu#SvAXYfGkL@Prha
zmOqOLqM_~DOp-my)9M;&EN&`o_3_n03W;e5>K?EVtk%VKk&I4T9XXB5Y7K$`O|E0Z
ziF~O!{86jxxRy9&PA^Qc+ed&FRxl$%QP(KLk=+Hri{l7KG@geeWNNqok`$60vV<g<
zaFJ;81dkixKrqJf2)0rmt6A>^8~jV3V5-B?4G^dHDyU6;p~1Nl{m751SjfG&G+G>5
zmA{>6I>nsQh61917+<<5pi!X&m9$*QZ4mKAwfXM$tW|aobhS}Fh^-ES31V?ZZk=Zp
zsirFc<x~#)AXb3reF#LXz^w$q%I(?vmWN0S!DGeCk{v=+pDQr#XZ4V31ffRIxH%MD
zWgnKWk9mPx8~Bv}I6Bz>T;tnWCXzmxi;)MHs|dv2e=G7VKr@`|suc&1f30QY9Jiv0
zS7E7|TfgEt+|tf`{yn3^8k8G!n#yLQQOg>*TBv%GO61d2QpZB=S#8x}o)E8XWmWN|
zIt%IblmdE=yV26hl64m9SuM9kVZPLrAf9G149xJI6$Cws{sG*J{X2?&ZK2}+*Vbml
zK<x%fAbV6_0@aOJ;`T7~Rl}Q#6rmyn2mJi*cJaQl0Ha`aN3;(0BXuJFP)noH%yP9e
z*Vz6$I|>TFaa~6Pf->)Mua-3v^NHCA{j=@vKm4a7j)M01sl01ts`ja`x~)Wy2*D(<
zQKru1u*txg&2dAtNrO$b0zvW2z)YmQ+K72{0pY5saJSi!jzYKe#D3Jr*ux9OjnFl#
z!+h9r_sSQnn2|A56wUPmCLPo=%p0rCVMk0bKVC&|!brmOt19-STn7&wyBh3~BiSoQ
zL`-pnT^?W6DeNk~!ozi{I%tO@@NrI8#-aS<_R%MluDoD|0&x<s8V5QIVOwn!#0qS)
zV`nwOwsPFWX4q!OQY>Q|g-i|<or7&yZ4S1X0F8`o-h>g`^s6dtE7!rbwyRZO8;x%v
zZ1aY@7`Exk7Pk2TDs5~F2d{LxQGH++pDa#->ie9DdS6JCJ^P&sc8l+X=fkEshXDwQ
zD_`<K3(y~v>!=vVgM>0FkLV)jOLjx4*4WhS9CeNBkM4i>fYbNV{8!0<R{tjZ{OByj
zH1KE|mKIvQM3(bxR)v@1(+CeoG<!xX==BHD30k3xm^_#a)*q=KXvQYSy07vpREMe<
zVVt-(!}hu1f2^*qeu~EN6i&db%W=rbvlN|APm<|Xl4RJ<Kgc@r6AllDj`6&X(Ht7p
zq$iX?{d6|cLCI&7RvjaS<(QU!kW8>gYzGEFnL#|GY_j}o$3-!_U{e&85gdP|WYamG
z<P;&IW1Hq`hM{bu3+s%jl#zdx5RGJWg$3acykE2;c7sTgP)_v%V^6Il7{ojqCLdXm
zrY4UotBD^+2#N}zfZQJZ4a}*tdEvvmf-Qmmv83b5P!Y25!q?Fc5ss5!adn=Lc=;H*
zVxfH!7YW6B)5>O|4A`!kifkQ11MIe|KHQ1cKHh)v;)UrJ`y>a>A0!+dT|+XmvgtJN
zTE#eLtDvP%ORJ7qD@hc0*B?iTHS;7i^Mq&qDLnH}OX$Rf*Q3~tpjz~gPZjX6CZ3py
z<5e*Igb^(Sgk735YD6iP{FEcg7tu*hvGI7tV_0(xI|AEmf*~DOX=FUlWo=ET997cc
zaFm#dFwW?K`(wKcBkm?E1!`%`@I1wssKShX%(7;$j1Km>nP4sbn0SAML|r1GRl2hZ
zjTm>JLMmGgkQRY{!;uo%9%O1vW+ZenlS3HSaQ*7^z1*!PA+X6m#*t1Zh;UCSke@X5
zL)3cRiZ-LxQAl8RP2;&szLC@HSIup#Gb`d9Xkx7+kU@?jjNmhC*})~laeOTK-_{y0
zD$=W|Eh^U6O$4T(XJU(`6%UkGBj1E-?b|c{(V3qOhE&n>3gPO`ho{1<xy^|(t1RF~
zHdjL>100b3-Y)O+_BX(vUo!%vu31E+s8?I8T7OjTwonSNhJD_Ci{5^zm|;mH?V?k+
zIKgohj(DvBXz%$7@9g;*tZx+i=1&O)!R`{_%n?!0<5&}SCgf`tc8S76UEc{C#Kbhj
z_M6wA=7Upw-A$Hni=9#)HBW69bYlJVn|~$P(|uX<^CWaXbITB&O5<^~>oV3-Yvr%Q
z6SR2>TmjI+QViwqJ*oI2xxf$!HnHQszw_izs{I{W{J0sCoVA)%+JH|Mw*jA2*?>>n
zHJseg27EHd2Ara$U}?-?gLd0ZmNrPl>J7&ogDlrl+%_aP_z~_zp@whi?Oqn$AQtP+
z^P}DW)ARKkrSNAsbUT)+7xx2$)IsCrv1_E2$`}p$%r|qv-lX7@@ZFsqP_oquLwb?%
za-5PNq`4ER3yW3m?DImB-XOA^SzbKxJOr4taLrmbXT|32A#h&B>gsAIT6q@1FQVLk
z;9tyC%AaUwvWh252#R6GifIq8bWJsfm#VNClrzTP4m8%gPo<CWJ!r|;<={h`?S0f_
zL8iN{?0tET^uDWJsc<NxJm!O~KL!dXicM<aUeu<qoeDdEZycbnZk%$pF~tKwwGhaE
zm&pVMXu8*(XfvA^Fq89$1rA=DkmECxxsz*(<&FZSir2BVvqPh)b#~qw4(mfWaiEmS
zFhz<C8BvKiisgR!gBuE34mq4A8MjWaa`XphgDHySsa)+<a3_$|lhLVB7MQf2CA^C6
zMjJ+)Tb7KhDhv_T(%#CPF;;P+9Ojwcu`fVPCDcAhJxQ>J<V(QcvOcWS2els77ifWN
zee1rX3g7X&a%2_G*NSDuBw!;fkvFta;be7}%47g1T8ffvBnM@^;*)WjsA}gu%Mhpu
z$9q2fA8>E_+OK3IqUP<@N8PyFZlE5%x9LPFf2S(sSY3tUfS3JfJ{f%98jq7~sB()#
zlU|flN;_x=(p&CO@<D|tMvp+vy-cPi2#ysQ`A%QrPU~pq2S0wsz<Ce0&5i{Dp>G9`
zy-{d(KKKHbg5|l=&Z|q$wZW)LnRnf6T(t0k6kN1jePMcmGcg>bA9H$YVoI88q|>S8
zA3~`y@(anI$!<f@Wtv>6-~>P~RZdO2fmx=T$hE3oCkKf$zHaW?q1dRIw_>?Wq}K`&
zV#PonaKaH2daK+gh31%8eR2dNj^?8}Uo0@{OOE<?aFtaBL%XSsIGqr5hgOb_Cl2;B
zLo{qc4v>CS(7B-LD~~V7kvk-HA;#JYiN*BX!uL75$k{^nevsMKu(X`cz>@3#83_s0
zFl&ZLoVn>0*Xn-2H5<1Qx=OiU<VM)khtsh_sF>z%!S$+w`s(-zHxB|KBM~%FC9T_F
z$q+7fPa9#NWb>esd0^S_z+&PHN4^V|nup)S{j!WB_3hqZ!~s!<+OzXjmYP!gq%tnD
z6+2Wt6(Jg|P$ZeRx<MICU<wt&(KKiRCK)fsJj|M)13r~*@9JaN^<8~k)cqZw8@j*~
z>_Q}V7*=LE@G-XI=wu>}>+EC+=*Xah^%%-ULq+%aC``b(uvKL$oYC?5RC-(GqOQhG
z9aiS*P^Fru=%Du0S&tbBhy>t~H=`SCV@1)z<I<S$wCa-?@ljYQJgqm0cVAI=qd{Hk
zz_db?^R(tgxNM?8TDQ)+xtBDhr*+gj#uE~y?Z)B%y@zKfGg`Q|R*DlqOF4KOM6eVT
zE5}?dNwR)AqIscngPi<=@pPrX8wAuf3NSlFP2)sjj2pp5Lc)k6D}1SpI@{3b1h?N2
zVaJ^NZ`-$GVLhszoZ<Xz)Yhh7t)t_u=X<@sM(VLj!0jZXTB>CL){q2&q>)dOzL7fm
zbF@VZ0(+;o$C|9$LjkpOtshd5+z9M<+_1}bVk{nc1Ff?i&AkFH_{qAhqB)!;(>@(i
z{ZLw^&`RkxkrQ?q$!c+pr_0EC$LZ4x$Z*SQK6K^fjaMfx_o<?KD)_>ty7sD}s)tnr
zb)|e0%um5(uAsd)yAtrTlih@IX|$n5iTmeLK&@W(H|1Y~>Q!0}Zliwq$K<-$&FW#c
zFtedy{N)JW_QBiz;~#s!9PRGQX;TKZ3VNZgjlXcl#fCS7dKjULz{OTmVm{O%{PWqx
zxQE^%Un6^{0{-*2uiy0E9BjY(YaHj2_yV&mM=H}<P#PghA5Bfd(A8*nDq)l5Ncu*n
zFpH9pgJe7<<&oaelHCkTiM8UoQe1KhU}+5Pe5t)T34jkW7#a<$H<`3cOVX{>)MZS$
zPG+MI?7qp1`gZ^AQE$fqn7mTDX8_g#T02kTv`~Y-ItMmc&+#-)M^Rg~%<<iQdrtHD
z7KeYY!^xw0YEe3wnv#_TI51s)nD>#<cG4hM;cF=kFH78I=Es+P0J6P|Letv{XN-2O
zk~JvKK|?dleKI(N7g;y!28Wqx8t?s1V6#W$8&=VxI{vH{t%+!;%n={TwX0~34XP^m
z`Z;^0^_qRr=z4-Y3)ICZ>3&Qw2%YpsU2-qewK7vZsY6k+o$NRT?6P%&^K!P)weOL4
zde7g!jCOWk_KuEMe%ji5+jFz+(A7f5M%C2PYSg<-CfDSLK=HBI`XB#s%2Bc`iD#-q
z{8M5Bo)E>62ig)3hkWls*C1H3Al2EbqDpHxOEjI=Y0foao0E||zZl1p1lfR}sL${@
z(nNiupI{43lsNja38PuMMOxrwf&?k;)GYS|U3FP*TDEk_=Du8Rfh=_r;#?n-1mGq1
zTEnMh3uyWReh|7#7afgz1J76R5|1xjk4pw_;0bZ9TlT)bW`9_^l(*5_uR<l(D=ybV
zU@Tp+*ej|6<OV9b!5~ne=GX{kS@fvoa-16Tbmw~9ZW$df?o;4U5Tb6|Y^;m)*;Ow#
zs;|ndvXeluz@7QJcViw^T$x)j0?lastMm2p#re9GMEKyx;CWV7P|-XbzC_)Uuh-9J
z<4ewFqdc398_i~;YBn3?A*_d!rz=$kG*(l<=4sa(sy!Qs(x_Qn_tlCeoVBFsjW5?X
z9D&$e<G$+_!o-9x6I>W7&Qbq%a{yLW*)YF5pFx+j%UmTr@@R`W32>`eBd;rpcxa8d
zTohfkNPZB{LG-yA=GoE|q!K*IQkT2%VzJ5H77eN!=~Jqs!-!f1HcAED>&|c(rE(7&
zbX&L9p_3N)PCVw1L6T_GnQI5|4`q~J4+wqh_9og06j0a1CF>XS!XhtW_VG1cXDKkp
zAK+A_yKoOrNKmwsz6kFqW-rKGz21F!xOLo9JYZMl*2VE-{x){_JHre(SCbqQ0Ejt^
zHegvA=F?({vgNSczz0YSD?in&AK6Zd4PZh{CEv&~ciSv^qfDB0JxpUmJX(>@CW9L#
za18T&AXuFxHw=?lAsR3GC})FsAgVt}l77QU(uT%W3u(4wT>|!=F7IdMezj~Yg~4-m
z_X9q^X#CL+(Ra~i^sQ}UW2Z+SP#}WRN6a2BAJ?5;g$af)CHokUUCv=cC#cbSL{Wzk
zjiLj3r@6$2EbW4vELFzaXdplDHXc5FZ@pI8?wv11CZ@(x3B>6&bk9R&A!DQCN~nvQ
z#+(}bw#-(`)(<k)mi;QT&8lCOy~Sm!p-alfpbOc(ZD0wRidT8Vsw^e!n)lyZ{sX!a
zy<M}4J)mN1emQ!*Zk2mT6VX8Oia)d`q6>LyKEPnd%nO@k#G)}E>#?=1K<YGaN_}g-
z@=Imy`YF66On0RX;a<S_quF|U{A$DVz6gxxp<BWoQ$^d>DCV{=FtrDM^Bxf-3-(A*
zoY!M8SX~I9^Wpj6FE~33zx+wzb%eilN|SM$T+}i#BsSMb%!+1fp_zNPHWf4CA`pi}
zg`;B-1zvXCeW(O!ZAHRqg%FrV{_a|Gb|<ipD}-@;SUZUh&_lMVhjL4+OaA7zig<u?
z9r`LAFDj&0W_&yewvI!XFWkDy1y8{B`!lxgWf`{_#<-^9dg0$U6qJ3|B`7mj8oD>&
z!krF$UL2E{D@`pj$Q&hxwBE#UGq_0oNyp@BokG*$bt~^RZ@}t)Ar99Vs@;?wC2P-g
zoQ%>;m|74EPV!>G>6Gls!?s*}n{t|dG_=+;_w0)Vv?`9J<x!Nb8DH<Px9N-B|8lxf
ztnSUbs_jmg4DM3wP}j@afT17r0-q{ZuWlXV&lT(MS_KtvVqVyK*>ms2&9!)QTu`VK
z)be=lBre6Sx)@X67qJ0!yY-#I>umw?`7C=t>U^$EpnB%(&eW1F*BRg7LzFm!Bfw`k
z@VT)kglB-@iggN})rl;cxY1T-vcRT=9PvqQFAC?|s9O!W+DFZar(bcDUjB}otL{)M
z@;NFAdc=-lt^0YJ1bT*UkQ4-+H!+3p0X!*{USOk15TTP<am`#Y{J-BA=ZAm(_UIR&
zFfDDG|G3mpmQVYDsF#$RHL!7SNl&3&i_5KIb5(eXwNWv~?RSJhC_{W%@d&6NUGltx
zOS%5=X<}=r%Z3;T8d3k`+Os$e*KsTl6)w)PJ#=8GyQ}g|sIf$J7HGZP0X`K*iRx)g
z@@~Ev<{CDtXTE`>dKPoG09-ug1X&a?F;TWZp}ehX^ZfCL1>Fh+-_;=rCBDDX_HwPR
zO3Njg*|9_j!R7Lw3783n<`)z@59HS<GFRQ;@F~Rz_&J_r?bh=0a)cNgUB&KTL8zce
zpo{oGwAg6|Nf_=O3cXMnP@&>63bLRkuYOv}ImJ5#l&Lz7s#QwHqn<JrIg6@|edwY_
z%P`hDMQx#?oxp^bmFwy``>tXTJ~IALK@rJv#J&CrwX$o>Ka#)C;*nU8kTb2mGr&*@
zWR6lnM1?=5e295AuODr&B7Fri)GSBQih`9HLW&XO{|+^#Y`ez^l|P!Blwz8XgN;RG
zo^u5#N|jI}791t^nsI6@8g2nw7WRt-+w62P%H{yG9#J4rIef6Sie5+YEW@07P80?O
z$!KLo&}~J@F9N`d{aJG$;#09Df6Z`H9y4Ac;xWRRl#`*ZZW*Df&a1743efqCJ081K
zc2@OyF+)$w!r#@^>OtdU+3tvoprm`RsZ(i<TC#6ya#AS*A>1CD5mk5Y3PaUk#-{{o
zGz29`)A)oOpiO2nyj2e;1uK<IcHS`Y32>7BQzm%!Jh8*QBs-g)OMiYW`p{D;+4)Zp
zI&)Et!1n@Uy-H-8cG1x^)8Y(?dd$b%mQB2U>pa;5s|~_Da#n&P)Bh%)eT}Ogn{g~!
z6%ihwu-WLCEv@PNDoTZk=dt?R&6rU2EO?UJV<b=IVaQe4FUd^$Fyy!F7Zo37F<ZDZ
z3_2~_4=Ik??V;zuJZ$2@Y(HXp0*wsk_%A!Pg7gEwtV9w3@xz=6RB!O=4&D%np<|kC
z7)~&EtL(JJ{b8dPoS>Z95Vs_9DDhdGE`F?FQ~4yqG}?GVJLhwgy;5$CPWAGMexrdA
z7hvLp;|Y4Bb}m5_Nij_IoP!geKlMOp+F7`T8m{Azz)tD8HN#WQIFy_Bby$vaBhbQ4
z6-u8W@5=Mp8Y%UBhLw!-2zUA=ruNwyGWAr5W|p4XT|g5Xv99ls`mDydQ$2FwU8}9G
z;|9xmzBz}6sK4vZ6kq-AO|7{aT!YqDhnH1@3+;0i{;!&NeQo_xqY0D;UqKtIa+qkn
zx4TXz<RqNUp3WDa(^HIY*e<3+V{F8YW7nHb7aqRMQ`Og?T2l&X?%i4O7EoFnWVfyb
z-1K&y5hgMZ9LG`R5fCn&xB<iU77?YOS9bv_+s6SNtf+8UE}_oBo8$gZy~F1RM?E;k
zqc;<Zjz}hzmI-BkDfW|9O>7_R?cfBUiPysF6eRJ(8i9D9WH>CI!o6=;Nl^Dp5~Y%+
zGfl#)6_wq;eY1miAK3ld@enV`t(b!}5eC>j8(5XC{pZ`=-Z4*Rhm48|B{|Oa1*{94
zaZtJTRvlpQ1uoM+?+)F)ItT6w`1Nv3PL5)YUjs3YH8h-<V`_)OEY-52AW6mt94Hp(
z0R6EU=?E8=1mut15r~=yJRuTb%wFaMXR*uy=3ks^!vWp5oYM2FmX31*TVF2u>L4!r
z(Gn|}HHM}~!#Q<vBU%-M!Den*&4mNYg!RE%4{YDaG(KXiNJ)OYgL${(^9B}FR5u@(
ziP^Nsz$8I>#n8%jHDPV~4VgY;&|<L49(?0nU1m1s`0yU7c$dkQD2Z6{&X*RseKDDl
zsS+vvGx+RzW7J_{FwR;yzS^R3)ou_^ttym!g&IPlyElj%-yn$Kq%Q2hX9d~9=Su|I
z!pFH8x={;?(gz{~+U7MCQT^r-5LKok(qiz|-|ae}h;3kIgHOrSW>NXVHMOaeCmOh^
z1+8rGsk`ef@y!c@-?j<{5+W>`j+#5l&(c9Wk^|MI4>bggSw83Z5;lSZP2<1s-Gx&)
z<`!5FFyQNMBy}7qM^mTqy1~>f$9EJ4IH3cvoD>Q_$|sbuZ#Yz}EHkCU<TT|#Gko1A
zLFH?`&uKJBf3|4^b3(7X5&W!lBQzC%o$6z=iwO*)@>(~{SIm!!SCzWRG2vb))(Rr`
z?lv<23lXnyt|K)}$D9bQ7TS95^R4uPiC(0Bb)YEq{7Hs+pDHM<N9N4cy-F)LOovX)
zj^A>|VlvYh=S7j8j1qFlbVs%<sE_Fchv?*ojUZcKVL$J#>twnb9p!jy$|fa#LsyAH
z-L0doH<$$TQf)2Xq<He8<wcit$!Z7t%?Py_!SYW^wjpJkZv(ZG2M3AF6mr7n0(Fvv
zP?Rr@mPYje#g-k!sBj#%_Ah@byNWi~c!ZS=KgY0^Ghj<b&bqrak79Xb1#nMEHnnM1
zAS)C$_#&T3VyOQBd~p&(DFzga;WFyv4bm~J1LBy)pQ_MR3DY7CPr3^3$EW;3(U1Q)
z*xm1Mzv^xO*x!1A6yt6Mk)Tk(_I+)Tox~luwz~fCR7S(MTesXP?-op;w>6B~K>>QT
zHAkq$rx+#4xV`Qn&fU8T2G8t?`y^$U4yG!uYY97FCeyt%`ygR#JPLs|kp+*ZIR;>!
zCSij=_I9S`tqeO@`3UHge5$<ku2*%2uh#I^0}ut%-qU`-D>ckF+mHipVP4t{h!+r0
zAXRh&=npq!R>%Ork^nXZ7*(NM9t-x!1Bo4x$|aN_qWqMw2FW7W)%>eb%uj;T2LeLp
z68!F{;epi2%~qLvalmk>-KWUfVLMKmcE-xGzQoI3<HS99<)L4NYqC{}#AR>uFFnAY
z;!*7Y5v#`Wq)3EnAZr7(6chcn)uchNlNnSW`*-x%RcSTwj>^Poy;;EEhi{QrC}}gn
z0gzE;bGThBf{*I)@RGD?&CC&;$C;8WmiChMpP(;dqj~RJ6ZHnZ=)CnrH99YJTT&a6
zT@|Pf%dSd@3W2i=gd?%z^BK|D@lna^`?6~r7&25EFo^YnZm#ZjO63!sQ?}u~GmSuY
zW(2s#KG)F&yg+2Q5h}DmjN;1%veo@HJ4`N;ixWyu5>FRuX;2y&W`;5rNsF|_4t3Kw
z8^#lq)$q>&Z~3Cex&SewN9m8Tfd!>)k{56S8ljMCirs)ddFYgwcNRNU!-ti{N`(b>
z_l#yHaW9XD+Ib+zAzD(gmeuwTc6vuG?V*BV@qWMoA(Fh5S~}~hl)99BjtzaYXhvFu
zp~{>S(h<Du9lto-?d|Uzu}lC}F){<pCy$m;x3Hw6i*!jy&xWGY6zK*9ltK(+MVqL!
z7E8F3(<B>mXgL;t#xoQrD8QXIceQHM6;i#3j{rgFHb~4(H#!Y*x$M698Szbd9fO{`
zq74X##9uH|)Qz)O;gHUfsal@;3loDQb`*_eRIV41o$s+5EswkW!D9X4EEpT7AgV=K
zk6YmbVR;<+sZ`}6imJMAvHvlO{pNKk)eDSB&Jy{h@^mX_OOmYn=}^7$#NaXP&^{)S
zH&y7>BpF<qSG+&_6ic(BAsFz7z7{lGj#6T*T19MW231S$!g`P$oHJy*(NeTjeb5GA
zYd|*5KO~ue+5Il?_W(^u2YYyM-bRmc??M1=`_?v9${cF@aVU=o6<ptpWQpb!+}PAv
z*5{PGzZuyJJE!!6&B$KnIi(*;X~BRwr5|lZ9&*g7@a<;gqDpo7z_Exbx9^nU1V+~(
z^~yKp8bok7e|l55**cvMHHj&#uQ8P*$y>bRsSDWg{J}W>SqL6Xj5eDfFG4^3-9lC<
z)SN$bR{t=L{81*?bhGsOm!sa^3lH#4Z`g|Wy)?qZq~N<%mbU_ohFXd;v&%uGF5;Ao
zK6Drn&uLmcve!+88vFPlJ*bf&jZ@!PwmwB~lAgj9%|KS3ViPNo47^5?CiY~QoCfKO
zdMe11Jz(8;oeWV;uY%K9S*ex%RBLsLf+5BZuGJDqrZj{Bg>{07zFVplgru||t;TQF
zK3r8D*ljD%R$8QJM-uQ_UEkO8LUX{co-s!Lx?f+0p)wfdXl&I#nZ$z+6z@w=6S#z>
z_f>dlPtI$h6KZq*h*74L6vG^5MgwZj5U}E~u<BK*3Dm>nM_Ws%jJZ$kShEf4;q?a4
zZ@S;`KFw!m{Tea|6A^7#bm|N>1LJuYZgM5UpkZ?dguwnX-K{t24i>Dsw@>1kT(@(c
z$j-TUZ&%sl{CnRlyl;xhV9|Y}&7T(BH@aSV-{?<`_l-Y@8|)k1#Jg~lUwGfl@2=6l
zfd#ACH+3f@Z6-Ma1yjv_T3V?QNbCo95jIkD++~zka580w-s*x4b|kd}rQ&IxHbHCb
zP!%V}qNc26S!*!4O)adD{%JysQin{!^KscHPpSKk-S9j5boZ`hpW#2&>WqPB)RU}P
z1G@tkGBy1Kr(DIhEEYncbekKP+byHW2-y|fYTGhFg|Qin1f42#GwREaP!qZtpuF59
z$yVe0si+H!>5wcCT0OkO-vsQwj7K1>IyxlQu7uU7wWe2LQLPMNIdORB($?jhqox1t
zpEGo>Sk^0pur8t8(q_1&e;E)}%+$(}OIzjc-GQ$-c7#e#giNmX>1vh_NV;<9Mgg}~
ztC4wvEo<q@u$B#=lzk?Qi}Sk1FW!&H?bPhrLv*}NoH5wxkORBMnI@Sy>N}b8ry2-}
z!b!mDm3D_zhHM`&H=MH>2eMt#0ldIU746vSjc`X*5T_j8P^#}lv{V{D^~I<SScem|
zAfVec)a!?2Q{MWgmdZd>HA~&ljy)X*t+7t4&synO)`Eu_E`{iK8j#m3uU{8w8V=tw
zIH~p093?6}7AIp}+?K6SP<w)3^PRbWu(h*u7&uhQoet9i4xua=Oq1c4=z3@OX!~G)
zzqftdsC$eP@g=%_v9-I`s6#S%Q$2>#n>X*1OvcMtK-xmB3vS>V>2zr<Aj1SHWFc8O
zeq-0EaaWIQ!8=f&CWnbkmr%c&1lo$}AmMYGl^<G>4d>oy<TT>hU>T*l2D{Ust#s$c
z^qWviq;RikNfh!{OZdh&D6}rV?%au#9@+6U3>yvJ#8~h!nL=Nea<hqH4rWuwdXN1P
zO$rCPIaMwr#N?CyVHtRX6fFt2MkBc@RS6wNK&Hq{x=4qK-L`9&$N9amC2b#8kyxUO
z#;Vjh&es_TU;dsXr;_QACygK0>Thk;jqQs`enE`S{F__bE}J<H32&_Jj$!$3mD|~7
z^2us>d!L67abJBO@?oOe(E!<TuSdCtBu<`pxr<%z7BU>U+P&kB*R4Q~r~CQTGWa64
zSXs_`Xr3tlTKmJzA<$?(`dXfc#156-q-1O^^=+I4*dvnV8GiZ#b1fN6l?|j=$rjpW
zf%D~SIAAs4PTRpf)-fhkR+o0%jj&a(4WRJML;P&%lnT$^T9mTDQV&s27Wpc!Y}|Ui
zKie%XgkHI5tge5u;UvkLBEI(dQ%w_!&ehX5F5M}!X>&U(->7;x9oo~}5Jjr>wzS=V
znu1cdv}^d`=#RNdNqXk+wV%}t@~Ht3hMB{;fW@b*;cB=EWIY>7Kw+E1cR(%QM{hGS
zE`-4%Z@`=fdJQx+02d=&4iDDQfXbkMH*#>lLh(`uMo&ehb#iW<&GH5+p<j(_X+XU3
z*2S{f?Th!Buhy)fyrrf56r{8c?XpVyni;cK#Y6C3M7h?L0U!r(z_C)*Z%jYU4xI(b
z<O1Hl;^|xK&sNo>xIC3KXYld)^?rPjI4uV>7OH`2iLWML)X!Uo`@8!uB}^WajMIw(
zx70~<t6dgu(d>Pe83*rZcLy3>BwlUC+bUB5AZq3<^n$0Ziv^VOwgIc}(<w17qtjVN
zDV7VJ75y@vr1`7>v4O>be4MaJD*I&yQg@GlW98-~#|h_B!K;GxZsfn(P^)BT$z4t<
ziKz3cLk&C*l-&rI-EgHe)<Hna-3Y3%*>2V70dg{houn8z)5yFzWM%>t@(oU9In0^?
zZ<eWhrK;*1_0>0AVU%jPS5YhUa@~1ZF?*RbZMb-ZX5Ig4bBAf3@W^G}8~TNvaURvA
zCC4vzP&-P`vKZQ{7FgA!>C#)3cBLidBBb&t01K6hs}PVe(dMq%;^VTE$04{Uz!$Sh
z4tep;b=}qEqkMVtRjq<O^VctABn;rO424|{{1hXdr@tqENxNHZUKmuFTJvJl(NYO(
za%8|q#R8m~g`TPkoFQaV7Jo>hNuFO2>#?-CL~i<0riPhg&rH`!wL&?WA~?Sb-N`B$
zkteD3f#q_I>?|F-LIG;IE!meGnjnNQgCM5VT5UG4)?C<1lZ+&+r41OBItH9r*8QxJ
z<8J6{1AER2bf0U#S#P&lX|Gvpr|BDB-l{ab9E403)N*UHBJs0n2Qrd|?w`q$Vjw0s
z+61FY+VPb0A(T-c*306{-;pU(0~~a{;dQGSGjHJLsPZA=9!jMFIJQ@+TsLZ4XWu-a
zVJttFviz|W6$y+IUAoG-Gi+RK+i@SDr}iLZWg`X;r(`UqVn}#3RjZwVq0dEffzczN
zfvzUB<{S@pR^WcX9`EXM-iB!xV@$gD6bY#(V0zj52BnOS>S2;eC}XwP4cyCe*gN|Q
znejAzA3$N5Z!s1hGbq)i+97l&8^>bKMXNQs5{<Ai=beQ&vVj1Iq0@rZz%;y4tUId_
zZ#$K~uKQr+9pz%PsZrWt0cozuo-^~X*+*a}6Y`I=)%PAUn6U)0!omozWe^;diH-Vz
zIf@6ZE^atKx>Tv|>BZEoShTwC(mAN4M9t3$#bGTLlb-;qH5WXLC)EQje|OMH$&PB~
zwg^#{o&q5*?5G~qHwgN$ckd=Rs)uSTdKxu|#PQ^*reDCbNuV0#mwX-<oUSC#*kKdz
z{g#R-9$m%PcK8xAUj3?L=?n-*(9k3WUcS$i)v!kmE>r$&RTbM~1+-Np2h#ZGN`u}t
z5<%zmtV-A9tea<wR?7ohFx9)n0<%L81Bzm&-&?qO(eOew(8c=xW>+>2r7wKvXJJ5a
z;D+#;ahjMt%FAATawT@txV^JDFh*%Xb}Ty?jL}le70|gMbglb(67?b;yaba_@?15<
z@^#wRm9fiire8(Qp68HT=O_CYl)vkxZEf{L#eu_c99?UQZgf0X*P625c7h(GH8skz
zH%+UoAa-V3>c@pyNGwOKl5G)<zhz$fg%5PoL5*mCI^V&xLL*>X*x@nix8qsh>DK<J
zzh`WleWoT*YRnc!a447<usDxDuzJEDi29lYon|SHx;+(utkquq4GU6C-f5N?B<w7`
z_QfWAxAKfwBhSQE7QDK=V7zVV94c$C$y%s@3oPrGU)a5EC2HEGHoh=VD#sReps!9i
z+g3ht(M(x;QQ6gKcPf<&j3kc{$ga-wf`h_Sn2iaWUD;8Ch;4~E#1qh33TzKWB!e2(
z7*W2!{1jX8N>hlKL7ZVsL25GCyluk8anb6+q1}v|HT2wzyoNvJw7XMA)*bkId_7K_
ztcw3iyrs*1G+<`}946KFH?{$SAK%G>h9B6;0*maAJEKxaCk+oDAoGGb)zF$zO+Y6n
zAX?a$+7B8hc=G}$qG+y1dP1S<&<2fyt3}dVgQ#mYfxx7Z`H2Ow8=y^ks6Z2kvvJ!W
zF~_W$YY>bNiYyn`hQyY12I{d3i3rcHNPgeEJrfaLuA14XHf+D)Q&<iO#;t|4Lc;ZX
zM@X}h6>a{m%lY@;0W@c03*J0oc}3p}<FY7H4pSs5NikND+oTw(dC5$KW3UoImNXdi
z0)8H3Y`KYx=LI0HXk1ZIpZJu@-M|KqtJ<+w!?r~dPED!1q`ZCXnb^$(Ofd$PRk(X;
zah1XWE&;pIr*bB`l!}d}f=tDeNqmj9*B{;g?m={NJ;lKIJ&J!ujl-czzRAi88pBq>
z;;ieG-pgJ;&>nZMtQzzYOzCy=X*`Ou83j~>g|Pc5R_iRANjX4;IT{FqM|XW=ea{y@
z+~iJEU1;DH^q+9*`6@YIuEx;%N0rJ;rb0^XOy-apuBf>SkYoFM6m(ftK=3a&{A(D8
zGN?+nVj{4y$wr&dU=IK(F+CkL2!Ida{*Sd!H(7PL?71-uqY~gm;=>p+4OTa3(KA>@
zTm$-1v6SwuRJK|ZNM40!EeJ{>D=z}%5z*cD9d+Mel3(eFnAAc?D<ZWLSH0Js7&A%p
z%xakUA_sy_4i`WmbTqm%BAzfLAqGH$6k9Hl=!<bONKaFt4mPb1ZH_Xz!1q5xcdzqe
zYNbD6Y~hVtD`_@;bb6yN(pot{UJWVmj9+FKl<w;3&1hShmZ|)8r6_t|-I8&>VJXVt
zj)9)9k@Zv(UM>@-bd$U$+Xrv=kALj_a<scIiAp4+l&5Q`Ola-vD7(=l6o|bd0ih%f
zfgX}GinXm48^J)xP%S4Iyf7`43AUhA<(;CdsG8Ks?$(S<+<q4Lab4mxD<q=6eb4OX
z?kLaR3QLdV(Fs#unoOevB<1`grER628YR4C2d8M@@p)Q=`5&>BB|X8pc%LEPY?DD{
zOlpxr&DSw7CkZJcE@q=?Iv(kq9fr6Ts5>f9-;_|&k8<N(x{iWTOn?mpu?hyv<4lG`
zY3oRB`5ltkJ)Fj&G~b?QqgWzdqx>qt+X`j7_m@>Yd?wwhGqkd`x0!EM47`91qfkh`
z^7i$hT59w&Q94%WW97~0+A1iVT85amFiO3q77wX;jZGB!kUe=lL?MB2`0;-d*4Thh
zT=pl94p`u_v@xYyo3FnFNW+hK2;jF)blYj*zYSFA7=ekdtoS=bVRabiQM!&Z$_ArC
zhXdy+=aZvUt+PgWk$xn0dRqkZN-;H?a&qxLW@ew8!cjmGWH3w2%j+HSx!V1&{?EI|
zuljHI4|`kNueP4=^`I0MK9VSsA!#|_j)TT6Bo^u+SFfz&-2vb*`Bt^Ef{v-%Lq{*J
zdIBmlj5BB_pB0<Tw5<$ADeE8NqL^K9QXgrP9lcd$`hX{+*1uER>WwHHx}^D_22r&+
z&9P{K<|cS{Uf>I6SZtkrvC1TH05~#;XGH?ToW?+33sy<t`3e01i*tp8xXx$MRZO~o
zXqeNvjjzaZ?^=HuPx3(mScc7EmnMBZfOrMLv|_<%MNN})6_RI56K5)m$4Ne>Q=P#@
zXa!NuZUjBrcS1@^%B<^TbfF(vzlr~F4)PKzkV|9h*|TS1RB$rG-%N?Y_ByOZdg|yU
zJenYdLa|#+^gYzEjzC_;{{d-3$rb<UM84AA=p6c@UaHYct3J4>M5U?HB3I^-sLmg;
zsOK|2H%uV002#NT{{=)kJ%V8DFnkuWFbPZRTHJftbA>&Y_h6rdBGNT6N%8GbDy}$W
z7p_zUfom8f!+)w{aN$$F?f`O_Or~`y=C%$Gw|=Prg;YyM396inx<Jal(%kHlZWJ<o
zRb5y%d8SGyY_P4K&<+GNYrF5em?^p{okm3yWT@%3vZyY|Tn;%-h>b3%nqa~wpCD;l
zUNdN~in>K}5&La6u+;E6skT{!GJB=?s~0+tyQCaO6ZDuRieWNNGRjPuv&akYXPk<2
zm|_WWLtaMXp8cG~9h9I+v%$IAQl_%2s^mr|+KS}RYEu4wCwi?!Y9{LEu}UHD)=+$*
zoR4M7uaC;|Cv|F;zW{VVi@yXjo%xBr>Q=*Qr=0TZ25G*mvvF=(FH5Z&HOsTbSq+@M
z%ot=PIZz1>%AxVHM5*6=<&4U8P@*lgCRMeD$!QELQ?5qqRaMKDAZn81s2y;XFz=Uq
z#3L?6&NZ8<gtL<i&N@Ta+`tk}80%E(Y7`W3YFcSVjN4h3Pk<vwzMM7xs;lS~u%)oz
z1dY~uYm@OfMG?nXp-?-g-Wp^{DaxI?4xo#@d^F0haI4NT=l+hj3p7tXmAtoG@nC}N
zvZc`4bmK|Z-ty46T%JzAhT5lJlA_%L9ur$H)b;3zTw>x_N$Ak}3IxCp^^V~-XiMky
z=P_xFy<dzcv$km+8-~j1$O^?9I9sZ?yLsxFc`Z4Tz_wZv8uM*YTP_#}LynNSr)7XO
zJK}^A2bd=w`7$`f)^5y@Ey`J8;`$UFr4^&OwX;Kl4PP82LzGXiF!587OJ*s3-(McU
zG6x-@JW@J~HJs$L!4w00MfqgNnM*$;$r!_p71z-B(0A{`C({v+D=u^i67z3!!}MoE
z(I4`Jz>#H1Efr#7{W)|<k-Oi};z4z{2*Hsdd?v}6lEon%Z2vrhqmI76AjzpSHJi_Q
z1{xIEg&Ql|^V-l^j9)23{8Rz$1$tVveg4-Q5tObTP8H=nt%mNuNi079iX_(Thc82G
z9a4MWV)ZT@ai)saQmHRNYTfP@p|w1Og-Pv2P8rw3{HFc1X#HYa8vFtEIbV<DirDZc
zQ`~<&YI;+)bQ(|2Fu_V#N7&F7NHk4Fw`yL9hpMOgh{j)<iY-Fj8*c;aX~A&xfv}MM
z62pT}1@-q0j|Q$z3$Xt0^FaZ#;US^vQx?iNZHQDBN;e&_`^tjJrWLu$JbINiNi`kX
zxSX*lo0D;xOra)}zJkG0l{7>>Xi2Uw@pxz8ityg0MNwvj`3#jMj_?ucJ&d<FD24Wf
zw=Hx|Z7H>W<rZq9*yl1&@EESgX_@a)GWBPKlU&l7iI&LJJ_!$MIcg`DNrpY6T8i#h
zN#_az8s`L)gFU{AuPY|D>|l6Irn-}4kfcP9@ID59QQW$!`l#W0z5DWT>$vv?R-+*W
z(@$&n^_zpk<K6w2dIi7yN~u8Gf!inyZ2eR3@cF?}Z+>{yQ047|y`Ab|dO&*(=SC2R
zIf8WU#S}jCAcN0*aD;PQg|5(`6^i8{j&L;U;?LS+foqm#OnJ%Gkrk?LK+?>P!>n{2
zb`eMUKv6cCNw>?`OtV<1&={4?7Q!xCLQ=RCT~YMX8G18PY)#m=CZ8MZL6a1bNQP3;
z<YYd0kxyJJ2yF<4{S|yMqHk)5G1tuz3AsX>MY3mv^Djv*3U0DUvLZbhCG|1wf$u*U
zC(N)ZTkHRsb~HJFL4==w+tB=#Y-r}&z38QjERI{nj9HG38Ho7_T1WE@38&rQIyrL7
z0Q12B4qNe$vkLLpmgUlt_rQz;#;)48MaDLL-L~?f)=L&FGBOm;(QsJW#`wHMC2~L_
zu6Uk~SDPNZDPquUG$dEDDN_hFVSCt3+XFa|210Y*dPrTQYN-2d+SGYI8ft=tYzaW?
z+`aB)aM}4|!)}1lvYjh4a663Nq&n?t*c=GUm=u%YG9mVw0HBPr2(<t-`N<{66V}Lt
zBrDFY+16W@nr|%=ed8#C!6?ru7y!a#oMYUWG#&|{+40c77XP1Ne=C(O->Z-Y$-YWv
zn7NiM!N~KTv&te?Oba=z5TY&QuoBRdSY9i5xH(=b;apQS2OY5}EOyYbBqX!BT7xdQ
zvlT{iA_=7BxV5mFW3Jx2$?D=$j?6l#cbZYfj5kb}RrS@tyClgGJ)~<kt?u-8t!vEE
zRi_8K_5ytdMzKZ3T2=aDo@hrR?I?m{?m^_c-fe1pM|kj)$BT2O#Ak5kxw?{ZKAw$4
z@1ln1R+`7Zo+9VU6~pxDU!C}%@ki0O&m#0SF8cP#vsUU%m-qK28{g{CR2<l^lpGx2
z-=&~QVFk5ysIjWrZo)CiwZ}!8F1IQnm(A$=kA(b8#*rJL&zc~{jf#GVTCHd^YIUnj
z`U2;$irZj+q3{i2qqm@z0S4LN77d@0>5)!HUu_KO;y{Ju8wf&$PgUYO*VXTq(+5!a
z%u0UU5RbfM+4JzoVth0nnf%+ec;r^SF&<eHY=%bxUQO`G`SMS}Ba@!J4v%cg@ul!c
z|7jdSSxs3)S(2hFqeZzhz#TIPk_a(SW@fA1m#Gbrhv3f)n~H~+nNMUQ(*m6sX-4;=
zb_?m$Sc0ZTU%XoKM)eW@mIEc+33vq1V9L%$|K{L6hl307ZG!vF*|&-v@<q1%Lfidl
z(e2)Bt1qz4zd8@9$^#rQ(zSDTvT1>?q6`c0`XaV?2H1<328b5it^e3>-hpv_^Jc$V
z&Aas<+Z;5zS0jDO9o<X8%`vyD>6rGoK1t8clEP?WoS+se2nJD_gt%BU>wDG^%VrwF
zUC(1Q9hK95t{8t@u8G6+C$g93?Z#G-jPUA)2(h$qavl9mP08`x!bgb#O|Ra=jQ4^^
zqIq~$9&O`b%vY#tLQUl`&z7bvAE`OfMK6dY@E#S&>2%dO0V<&%TmdUJ+%`4IFhn^_
zBhqRUI@sC;j3`Joj;9)o%mX&fSW|s3jAPYCwZZbXNX)f2UfsD@r>oUyW+?r(DC`hN
zID3~$r>ke%z}Sq+F{P6~J!)5Zx_Q?_YM*)`IU3NgsvaCu1*>^9W?QU>FJp4>1xyVD
z#Foy=W%g8Jh+;;eF;mW`tUMD)-#?z@V-VS=$tn<<DFtjBOo7eGXd3ot3!1V`P{$bQ
zLP0XuipHE6K^E-gB6^UFotfi}0QwF^oD`deCKMRTlUmx~9#Un8o2y#k=d+7(4;$p=
zU3^s!lZ#x`&q8I<dBfImXhMHalX-hyF2yhJIPL&xD5i8~TR9^Y`lFs(*J2Uux}VA?
zpc7!kR`#kB1ke?iTnH4Po7N-ca*5>lUZsTvB?>)PUVPO8_U$NmNT;(J?Zs0$eAyW$
z!)t_dGJd4Ad3mO_MKaVAG>K%d8Q?}Q6XolriU9`8T^QeCVsYApbk9|I7L9mzr0N{k
zTa%0+JpEHwkl$i%Fj@xX)f5dCspu><m7$uIhMG$8=H<|UWg{A;BF_R)DE5Y$6{R#+
zBTAhG##>m?TLxt;5|mC7yt_)KN?00C6249_SH9j!=^(V25ORsK38AHoQySE-l3lpQ
zOPQ2oICv4|!j?u=L}Vu!u`!`K9efwzCbR^f%qPs=!CqnFq}M7nVb`LiY{|O_T=LCp
z<{W!CALr1ce6_7g0kX*q7w%G%fY0j}AxFkZ!<qP&mvbB~LOXr&Y5_?MhSJOAc#Ws7
zMkLo;%+L*NdhxMVXbv4|4P)s*z5aaLBqJbgi*MzzLcp{LP(Rzjhb;xtOp!UgbS`nn
zD(hmDcMO18g5zS6UgDhvvZowjyV8K&QTnc<4x>`8U!SL~XZu8Rn_(I+(T-5{Aw^j<
z)lKhns=Fq>0_WFk*{gIY#9ho4-Iy6)*uEDg&U`ri!6|TIHvEqM@HlgWJ%5DJ=k1%F
zt>fN&M%y(^gRa#6*F8A9|C5W38-$KN%fbgX2V{4-Lt81JFTddHHL|uR@d+HuKuK&B
zmZ^G*3`iUSGEU>k6j>cK>`-j)vZYJh%`BDzcqMW}BW6)CKGcCtz%~0*GV=&pbm&wQ
zHP;`NJHb=z%|pcvjf!gYw<R#JnngODZ+p)7iauJ-7XjxYnrjAWaTFFI{?}qE^p^0C
z#PF7|J8g0x)~q+2#YC1_o<BN9b2p^UP4u@de`#xVm`x@7EU5KvuARh3OW=AhYt9xS
zI;0s6^3kvbzwy*ctV3FG-sX^Pk<|$7DJk3B{p!;Y*eJ>9)H%`@jo<TELEg{0!LGxA
zN`BBbw*P#C2_kLx7vW~26Eu~SGe*mr7B0wHQ?{|?rjQqM)R5OmKrQyj93VfVt~j0y
z&b8*&)e}3yD8~ET-HGDDZU@E#r5Op?IPTPAE{We#Rp`W`{3U#1Y0U<KMk_Yl+I&PQ
zWeiMDwT61tQ7%TA9vILK+>`%(9k?D88hn&zUU<{4o3Coh9e7ty4OmTC=Yoek#NnOf
zqS<$==`&jL!c^(*=O4~BY^o>UQ%w2Eb$^<RmGgQ%3;IPkST_bPUdpq>KtCOpzJ@OS
ziHU4zJ`yw?aT_RI`rpKG#GZlQJZ2vY*cAkByhC;pqT?_fg!LRHchayc>0g9_p~!k1
zWz{>N@vZGfS$RMQGs5cSuyJ~ALD;JvFg@MH7>^-N5v-S>BZ=b}ol8+aRsCCL6mo3L
zGEph^krKKpVQj1sbjvLC{jfBrg|+7V6%ik#RHRp&mWgSjrhLlPFfafg!~t2cLETzu
z5+A&Na84Z&fPBhcQiyyZ$x=NF=#{qVkYnZTyhF_&b(4LL&z~Eskv0tMm^zQk&tu&e
z0kK7GgQ-{N@49W-DQerP!@bciF{eMNu>yN0G(n9Q<~p>JqbRcy?zlpCM2jo|yUpE9
ze!}Okhot`$<YUpnM?s4<Bi2zdFLicBcf$T>&Qr}bdUuqi&Kn>4P1r*XD^}e6@kgX@
zak9{2eumW>K69e4%I(TpU_n3I1WwJgWXNZK)EE<7@`)Allvt0j4dpzmD}2h%r#Hn|
ze3Yd7z*dxsd6VVRRVB1`QRuaGANoc=E(wFAEm2<N0YMinJPTi!Vq3@jOy)SOEgd){
zv}@F}q<}q-CyuoNnk-Hxv+<ObIZSAW!%<SQ>-_qAX5OjvAb2V*5}&Dodae0pG#l@z
zcdWNuv9N`*J+u~U4y&z}KEqb^OW7_eYVLCUn-v3Io3qB2`PWfCnOt`**IQ#^roB-b
z8G>CW)2MxwPd*?@1OA`kHCShrUAwU%wn}W$lx=4Ti`(^$Bk5g}hUBuju=Mz@tHk^^
zJR8}$7XU%udfOFVEF&J5KA4SK{$>tl{-&ZLhm23vH{Ws;zp1pAj45*yM5q|U+P19F
zZtY#iBR8BwC*)o18|skzDianq)O0u@*A-aMS~M6H)+Ubw19AOLo7#PrtW7@iS;VDp
z{$mjw!}m1tal;x7E>$$O$LgDnD1L)GGCLNGb(UI}<#j=rJj=$foFEg%`j+oY+*^{=
z7oM$@LKN$bO;m&CS9GJIbOl**rTyhIG7G~nH%?%iRJnPl#wA5H=EVs2TtmLHH(>3J
z%V+xw-c*@qXob?}J*}~T^`mh&x0R}i^HXb!<YTOAt5W&+xe<AqMdDfbYPX>}YJM)d
zMkf(*T-*GL4xqo!(nPbu_9k}-UvPulBy*Jc>rs;f&f5qz6!c9pK|^HRx-w|VhTNVN
zTK*t<+L=R8v1CR1Z3F{wSa6!+ElU^oQ2{eg{7hrR{4?Xt)CHTdU@1%D?TPdJ3V~SY
zFc9`A-Lks{Tj_7>B5ixEOie%RKWF@ezkr-7u9i9#sV)XiG?A-qhmhZ@j`^wbal3gJ
zHM|ABB^^r%DGolshz@>yA8o;bp?t{Aa9FIZ=VV*1NsaNYFv-9OxvYpgast$ec2ot=
z4O7kWlL;QBi)5CTY8X}%I4|gglN~u1a$ntH-JGEnYCZCtu?AO_q|=!I&Pk%A-0{u~
z_;P$bPJ*OSaJ4?Al3idBPsKxw-_GY9Tkn3}I^5sgf5|&QZfuZG;ITKdjcNHt1r3Dj
zhW?IW>EF+$wYW2X(a?pT^InWc@gT95U1x?F7Q@-Nos}<JJDqY{?3;OdK?=2$;${5+
zpt^lTo|y2TKpk&&(FaqOHiEx{I^a)r=%H)3R{icO>6x27=aau>jGX=NEz^9<_{KB;
zge|jR+yb*@>Z27j-7;1y|0A}H@guenJ+Nhbo<YHMZuTV8Y{#ux&X=Ut)SfCcLmIc;
z(C9o`)U9JLn@$q3)E(;$axr-*Ha8zr88z<SosS#~B8EYVur~CzT#-r|)J{}dccoV=
zeW07@+>eon&pnEVX!BV9)o4v7CcD@oIPw{*c9WIEM<aQ4I7|~Gy6TdX8z~8m?&5uN
zw!$39Sw+gA`qYd^mYb(g7Er<zc7qBg02OL_kz5oBXWhf(65VjNP>Xfe*=GZ)%55tW
ze%qc7YY|k%vbKObX)LSU9@;ZchVyN1>Sk3ElpMLObgJtw&T$STTM2h;=d8zwgsj0K
zt<pi9TrXlrR5!0O9GeM_YQdOl0F}T{CRAqmp1&uD!XQOMPHyR|spPY}VW{lthva%E
zVXy04k&mNcVcvx*fh1L`gpOKOwd!&;c$^<~5LO#yQymkzL_?@4ou)cO?o7C3QlS~W
zNX4m*w+dvi+*j8TeH~f!Gve~r;*HjuY`^Ml|JXnHd7pyvs^N#n<N3}qNxC{uNbOwd
z{oExzGM3BC4lyHMj!tK&VOIM=ta{9Cd&POxNS~mGV$}QP2psAXi9^9rPkr=+4=jhZ
zV~FW}%oQthF5_1>?J_=pQl{d%Ahp5s`7e~xxXy+y6hE|SOi6qK)^O^%w=Bv!@ewFp
zXmHqslZ17LL&Vtd=37=*iqkx=4$%LZmclkfET#P-z^DpArkb7aMX#RFv7(-eJAW+@
z9Le<_O1kQnkMbZjyrDFA!0uQpf<M)|&8z2zyP`bZMmwV#O8CWC4BQ~iaWzHrgYx53
zEkCHIn!gU*&|9~#p%ibbN6l}CyR3%J3qWuaOvAs=ZyGyIo|bk0UuB|dKb4jgp{F7S
zAU?v8Rxi}b%3?dWc3`fSt?s;gYR3n|r<zUQ&jZF3vus$pB9JRCUT^!REwpLm9l7Y|
zlS4LM1HvqFaXP%21w(aStedrmbbNUdr$y37R{NWO1f)6V`p(=s;5jlCg+rQAoD<3i
z-oGd?o+Jf~A~(BnGDuHTKy_-OeH#d|gg*F?q3>iPRBz=IsuGKpKsOo_lHjULu5qn+
zR5Hx+44z-_#}`RE9m<-TSz8x<xSy$oKmL%b!X^iPjWCEi-3LxL(t{`s#NxCC-3-7#
z85c82auguud~qxuGBg9*Nrr!wQoaO-%`3P&Rf}cEC&SbWjg0A$`>-=IHM3lcT6W5&
zav-!4Xb3#zt%}v{jmmtb&#zpJXVXM>=rN{%kYsi|hN4TGB%58Z#AMx;N6YL;9O6)k
zHJ=Rnib=8)-EzB~F6#(kZStws@WapFLO0{Q31Li=DfRgK1&HqXpl$lV=v%)h`Dt4U
zDHdWeYaTu6FB=a#c=wNwnfu+RvgMerv-aI+I%rPs(z|ytOb#!sS?|B&=Qfw=8n|~A
zNJ3-k*c8*dZ-)^OAB)HV!W_u#0|ADAW1#zjpRT-A0|zx3>z?3rl*fQ&s4Z;M-yMx|
z(LD=F%Vi*WD%4cG;3$iC0!*~cJQD?>EVH9LpE#c=I!yeL6vt>CkaabO?+cH=@%(?Q
z79W2r%Z`??YE9wYZvijQTWq3T?Sih2l5oI4t7*ix2L<lS4i+%`Ho(RBL3IoXfDLm&
zR|*&QUX%TWuYCp`-@%laY}p9v6<`4TR+e|2DBw8!E>-dM`#5o%`L(Iu@1$3k-T&Ao
zgw&u-2`MyE*~lb71*iD8P4$}75~}*eC`sk=1gJ`t7-O%JDXrqi;@@G1O%5TeSJ1lN
z5HD2CDAs~l7~6SJ<`W)|+5k{)=2To-iW@A)=PijrP!Fv?dE;f?p8?Vcs=%+1HQOk;
zOh#RcFJ0yvtku<3J9!xJE<iU&If@Co>vl7BWsNrSVDI42x<fF%gfcAux_1BmJDaO1
zK#UojM{Syevj>pJ^?Thrc-i0kX|KP#|Kea%HHt536#eH1dpn)SC9}-BmQbG&Xz7>U
z-rm8_3%1oeJPb5-*jsc=M{l>cdq+oswq73gdi&+phRJCRqFJ!>quz13f=xUx<34T0
zSlmV6H${AE$78w)mBqT0wh6Q1aYq+UV3+CNJ_fk!9+d`GkKnkow<eSLdN)g_0bYi_
zMawb%r@0u2dx6fi{wT?m<VS4)Ny|B{^X~&b`E)tMWtNArtj<JfgepNJcAHKCZ11TV
zgY(T|Jvg-?&>Hl7vB#$(X-(3zG>b?4k=v6vJQ*e@UE#JcM-Y;<Zyf*H22iJ-=YZWN
z-Od=FInc0owhIKi&Wcm#v0p<iPHmw8>t@1r*xX#3`B*cW5+fU$7x1p;h_Jg1@g|a+
z@;p8D77*8`nC264`NINAO+X=!m+;T=bh6ZRsi==HwnM@qn2bs981|yER`Z!Ql{YCc
zPSKKDhtD}NlNI3_0oertHkgn*Df4-bKgY5IxghM7t_^{$p<3N@8Nygu%?}V|xx91r
zI_hk3YS&?yBR%{PvEjN+yB&of24FbsX7mqu<S(_jRnl3LWtDFPQ#b01TZ{Lgy|-Kf
z$ves2Jx02%1<4ycQ1<g_5AXbO^n6`jHLDva2bsaOm4fu*qBt{09Da>h-3Nd2d+&})
zl!1cgWTLPd^-^{5Dq5itoXf*&(gzk55lvc*ZNPZb-7RKeP%f+(BJ8Mxp2jFK#%We?
zvdU5u9C(XzkW!fFwbhobMX2-dw2T@>90)lTbaB4(j&rqk+eStF#aFLx{ZPV3ZQ~DQ
zAhM|!M;XW`6b3L>qh=+XHrDx)Fv7^VACtjsnplprut3V)Lwce3eDx>5YbfEtZ<|^7
zHxpn&mN93nEd<1qv%!2L1uXU00v^zqv&%-+E*)sOH{OmGozxvTx;A#!#erRRwEME#
zzTRUfMr}KjRcc2{Rf}{gP<OLQ-F3Y({vrrG$t|MB$B0XbGE{-OYXi_;hqN30)-7kL
zt%6%w&+6;rXvs>dIO-fj3KQFOcIl|z_$#7AF`Y~X=aV*;>_$ufd&yI+4a~Vq<(Gb4
zTe8|Ix3F1mp(3@&sfY;0bjUVZyL@Y)0wG77lR@XR!PjA}xW(QX(K<9-zPZ7iNZ6Rm
zC*nrM4`^+8_wK;zsYb2oeM-n@sg1keyYUUU{bAAVJj>9tpU&YDfJ%5vty9_NaL`oI
z*@QJ?+AWmB98u!v4pP*5tw<$(=N4R(Hq|v9rN1k~Sl>+ji_Cq2S?}fXkgSq;$ZHkz
z)&qB6<KqkUZw`0&k3rmhv-b-s2o4S_p@B~oAU^$b!LnNrzqL3jcx>7~84-MSbA?@&
z)vB@gqf1PdS%cMBgw(|+2}R#;U=XNEn!1vRU0<R3DD`>^e;)NIX<l0mtgHL9bTMvI
zPon#CFKr!Q(oHB~?PjFtvg^x^$B^Qe26#Y;k72nPig=<A*GcmCSvo-}3WX-jm2=;5
zgAccHOlf+&YguB6Zx5AJmSG4b1OKsR<XmpD5^R-_Y5khv7`D`aO_!5I&8LB#GfZ?j
zYU}acjn?fe6&HQy+L&9e!sl^uuB<hUCaCVxxrKpvWD+WNh60Q2iHXsMV9J-tP&NRj
z-yQcoO-oQ`VAZv>YO0fEb+KfZQ_v8`DIFJqnwB~a_1&EylWxh#FkD}?S8hs|y4el#
zTr1D7=&p+9&y<a_d}nF#h-%S-nl6hi0+<Jb&?@_iRHbYzodVn|4<wLSwV`VU^+nB;
z4qhCY%tCYqIF2C4Q-uq(@T|Of8r^BDMTZ%CoSG@9b&nxu#X6m}X`-~XYO12T$EoR@
zMuJBEwtQkbuz<E03VasGLSU;6id%)?E=w|JaIE>Xp>-!@G;2ZYod-F=qk6OqQDUKS
za>nAmF%4_-smb5nr|!XCDnYBb5-i0=5^VYa2U=g`j-U-fbT3kd6oHmTn4FVUqncE3
z>x0>(Acu{$)wR>GjOn)5#O_0mbUi7Dtk76SF=vsP;C64zAny8eT`5IRp?c3MK=8*O
z5m|$H{13L`?p^6U+{%hg!gQZc7<?U7mwuUY>c;Ce_5AMk@O`xMEMjk#+oK^g3jgx8
zdY9{VsU>TAJZQ(%rNS14`$l_|r_@N${={kS-EZ&9q&d)G`8vZcI7}zgYquSRQv{W}
zPTY1`)2H5|Dw;<B!HceZ%25M!PC-;=PSXoC?oUQzy7xkZx|3u&r5s@CG>u2x4~D6q
zrYrI3DZajjGN<YyARj{;aKZ!AIm?VkN(fzP5^8tZBxCJ;ct@0|Fd-`K4Eu04r02cY
zupNxOhDKq#@701^&?7w)MT_dsvROe~7I0_rC5Sg@NT9LDYwz(lQcLlnn}5cJH=~77
zSQ1j%UASE8iQ&^jS9Jb_$r5a?<&&(sFf4o*wOouajA!T=VlT4^^MJcUG#Oj*wvulq
z=EFU-L951<dAQ<RjH$_IMz>b)f@1>6BL}B8a|Ij6vth_&<@N*~*5E2nZhR_C>BG@q
z9T-2smGq$QnUR%!V1#*8OG!W7I@+YzX_~@)g`AqDA$!Jl#n8%>Pj;JHz>ao)-gV{}
zbaHl?33uRkOQ{$G`2%PYHI6W)T^I5;@wQsX&p~&#@=RKqCLQhnUiwmQz%LT%kOT^8
zE!(p|#lZPQAmLRH;G#OUf%C=_NIH&!>E);gN(jJzR;C0n8_aCBfC~`OFPnzf#yun1
z$R+uA?vx0=$8q~dgasFG<{*(yVohpGj+b;j;~gEgY|>cVXeMfCvHh-!2USy-%~eeO
z8bAF5VF|W?T5bu;prsn4+z4tFN-@buM{<?{yU~Z~lNGGxRzd2r$pwZ7{RQf@w&N_?
zrC_$mn^2}+SEcp?vW8Z34srfxrO(Q%%-E?$<=uh;&ndKd9&*mc_i_UQ5U};j0quio
z1@N73Re77k&s+T4A~t2>COYPMj)0%1zsILahi#D2eky}5<5Ls-+#F!eq(Yt7gf20f
zL_%p#xy#w!hAs)HX+u)>#?df6JxwNT&w~xBROa(jzqFDV3L=Qh9^c$npWAYX*k5v6
zI6=wjKcVfRzEp-RU)T<!rS$PYWL6kvD-1JCEwE5iHpGE`m-i%(UW2R@svQ4b6cdk<
zjE*8@<?_1MJB~mIETAOGfWPGpf@+Zmmh@7Gz?R@wTA#lpT4|oO>P8(OH6J4>ddnJ+
z5<Yz`>@^s9k-)ikyI33%X+F$J$)6!c3J>DK^=!1E<{@kNh-m8;sQAh=j+*i`I_&N2
z9@z&$ryR2mpQZ<hH1CFj((|3Ok?;v738HBfWv5Eruy1Z*ys-<|ckZTBSCnN(#IkU~
zod#v68=i0hs&Q{QdYJ;lggGjU1kiY>Lp=~tz*(T}dY2MePKIb}2mC78O<}?g)4_6d
z6{n<avTrb{5sDW9JmFAB>6U9g6L{5b$7C&*<c!yJAy`bY8M6E18_HRx#H&DPlwy=5
z<Mw(bmHHV5`y!vn?dgBOFztvS7-+mmPG=(x4Xrl$3#4A1OU-Us++39k<DbA|{tsj-
zLtE~icpwmicw=Omt8H}`_0PjSGl)*)45)l`61i<=iQ?Lvu<=X~PW8rN${gv%B)_0;
z%m_JufeV7lWuKQa+B0Re!=<ljG1|#Uf{_W49442^<a&CJgj7fkW2&fsrLy?Hjn(f`
z_))pJ{Gw_Cf77A0bbsscaO;=;i^E>8N>iZ5+PBwdp=k4bYKo!Jd{fYp5okT@#jQ+|
z(>~qRi_%*EZFCY?M9dl2y2`N84)}1EC{w*xc`-#C+rAiXP0k83$;B%NHp@ljBJ5}G
zQvM+J%P>HMU@G1N)F~QuBke<z)NZpj>*P<?VbKQGsylVI8x@{1%&cQU)nxTtxpSa~
z9I6Zt+2mtd5DOt)1ct|C2pSQh61Ehr=&T7rkfuY~Oaj%too&}pyL$IDT3L}=E26ao
z?&%5x8moXNUCauHu$?4DJ_3F$Mf<p`sK_}j+Lg&2eS&BwmvO|JA-sqm(oPU=eEPcU
zIUY{=#L#-S&+ua{hcscg0q&CWD9`Ca7j;RxX`$laa%WYZw*+v}?F85sr-`QF-+Uhi
zBt+-R2yb^s8C+NOYmr6ow3(B~bl!YXRl0{3c89{m`oZtS*~o6EoP!!4t=pbW^9!Wb
zlo+Q-Mj%oFk0(>La(kH;D}!r0Wh!!aDN+ISNayLn3YCZr1uEbXwk4-CWjIWR9!0M)
zEteiT)u(GPuN!A`8*nSQ<qdJ2Z|NAYfDf`LW%lHgb=3JxKh3mVm2!qI#Ek8_Oj{W(
zSI@rMcwIN)a^JN!%T+U)Yj&<X3z?o*n4LF}E-L1LPrb%?q4jFAGGa)+@VfYx<X>`C
z>NJA$(g8V=MN<QFwHdjV+R5vWHRU*}(#6=RzbZ&dNtx<4<m_SmbrFA{6TH?`nAIyr
zrMl{HQkqMiqYc!H)^dilh(@qh6IhRcrNo<hI5cpTVyjbuFN#A#E)!Xmc;x4GD_~g?
zTuUq28YPdV1t#A@x-)kCo2>)I$xQTF8lf7D*jC<-Ixv~K?aogbDVoH!_K(Wib8((F
z^9Fc>)NOZr>$taA@>XY*o(;hlMxHVP;hPGJeiM{Y_O;;508U|m*yvhxu#ODQrT|n9
zuS6A5sZ>$8R7Y#X>#uEm$=4Rh#AwV@Df_FqyZ_VH-tJES)xps*$lovBhSwSi(>uVk
zO_TZZ^xOTnN4*`AUoBRtBw<^ge#(2nSigIm#)9H&rPxXxkj{aG3G&8NmVY(d^)R{M
z$V@`CIWkj8sIA!n(r1ZUS4gT0F`_j}HwL3R(2&E?qfRq+>I9;>h@flfy?nV<iRCuo
zCGngcf^0ARZxl@Gge`%YwN<KQt0poP)in~8+qk<I42@8ox^}>~JOj1*?)5Qm1K?I9
z;j1Vfz`TppR(vH<E>Px=&*C&&t#om(nNpCmd2w*~l35b>s^w&60&TFK0Ry=;;dShb
zV`<&KI>tt8`5eXG%*|!Txc(P&15(DId=6CRRW){Xc+G)Up>dIjWvKpU@U)bb2CoEk
z&;$vzj;4jQQmScE@=!Pmj%%U0)w+pk^Wo1`3sh(XYOselN`M_|7}MMh^WAM~{dbep
z^*3aG?5D<#@}HBpzRqv=CNPrCe<J{u3G`>dqyaqYU|~EYUSPB@(qLIMlp?8Vu@FXH
zp+c=CmE6eD!HeTYRB}k{*w7DC?5`9377k9%GNegB?i^%3l68t&H~`gHV~{fw?m&GG
z#Qz#REv?4f+o8{AQ%!u8hMa0OPuEO2*?^m?y0a*o+RCH|ST2;;|5*!182Im%yZOq^
zxo-aFtm=#OWBr;ox?%bwa5|L|UWdV8BbOBusnOttqyINj)*)rku7U0jJ(fK|6?1{i
zu@zc7T&Ux_TAY#v5n^gSb97)X3YSh-if{3TQ#)W@l<RzE?9#@Q{A83|6zV2*qSI=)
zrg=d*GE;fN=iXpaF$?NW;D3BXbm8Wn02-mEE&r-;#r0(ebtU&IzXBdKyO!F+948!I
z#Ti{Pp|lsZNz<`T?l;5E4;49a=cU)HTNAwnPG+a?9{B+eFz5@0=OacY9=1<m?pcnl
zq*<p6Rl1Kt-tSc935n?yaojOZB(UGWVWKY^S6K0lHL)!mmMTeMN0)xhmV#zzNEgn_
z_p?gWBzt+-(m2^Ri<#IIVmN$)U%i7D&~9CR8h0#yOf7sAl2Pm|C?2>NbpXEc@Zo!#
z48c0j#n5SPA;B^s$o!0ZP|A_Kv7@q_tuXUvv|vaJF{2zLsnNde?f@3rd%6Oz8lVnL
z-j6m>i#YR<rZK{VkmbgRV*aW}5OF^RFc4}m)ua`NpFX(?WT*+9B9dQ4pCkCz%{c_<
zA_h`-Os*e8;8X(&8C>$|BtwZpG5D+y_9g2pRA`amm7h$K?Dq+At8q}yfdoB1wQ9^t
z4Fi~1cvjgamOmx?T!LClDr1dj$6VM=ak9LUv`6j}CZy1u&W3rGEJb++Z6X<`aVNvj
z$cw<x1^G%T>QpaB*2MpIdo<gGqac)5Cg22HNBI}trE2y5=aP6k2oS<2YT?SaIzd-^
z?V#q?0HkOI9nN{jG>jTl<@*q#6UAg;WjqL!E)xzKs^k|d(+(db*n!sE`ZfSMu@ICB
z)Yniloy<$(7qIEZr`oQYAXc&Pay0w!<Rf|PZPIodMFm{W^9d2LZnV^0s<z2q9?wN1
zZslJCD|oE`BhUgLVXww+I2Xqo$G&x&Buj<3y~G*o{Dttt05H;TQn*epe18qafkp{$
zfL)eEDqS{+GC>4UO*aj-@o!|nXAX_fJkOlVFbZhk!rpj6sKffP^X;GEmsIZ<(kSOK
zrAxG3gv!WPnab-H=BMX7w_v8iaLr20$tuJxFC(z#m7aPR$tA}?)JNb2w#~bprI#2n
zGan~n@<jICiSHp8!on(37@Z*|JETzfO8UP&G@PfT_?8|F^Jy`LlzP}=%fD(?KcW^P
z<bfq6<A$*9BPv3nYBzciV5L>AEhyA+8f14A^ZJtqgq;MP5O_Hd5*8rl4@Z%&2Oez8
zqX~>e2|gu_WGSztp>M%;G*mSjkK)XlL0PNpv}-5JV)LzLZUEMns?^s0(mN7suCjc#
z<EpFZa07Wq`!&FeagL!@%5s&c?r5S>`#LG^WqGHWT0v`09(Xae=14I%x?%PEVe#CE
zHKf(!v$h2z1VkX2-M2ld+Uoe!d7K$RKOd9E$X|nlH^=>-dWX*sj(VjX{ZGuTSLuRU
zkzV^X&@oB{Z)e{#EQ6I+FL+jm9t2p)d9@}RcLV>_d-uXNM89T21U@HHc|969){J%%
zJeNuEm#myi(53@kw(5V*Wzu1C62k@`G;sfGa3d2sgO;z7^z0nY-u>K9t-)$3m^k`o
z4Ws|2cRTFjsB~*x<@wpb7mOhn+7rHCYNLkw!PFaOF_E8}uchX;N@15p4mVOa^NLGP
zm%M$4^B&hZf7OWwO<cn9sgUP6fb13P{!iO??~c8}Rq@{;`^&8pknAs03_Qf9m}Ltk
zFX-Vs5l>Mx#nD=BZemo+294p6a$f>&aF__vJ&mry$05UTnor|VUzfE|otWIdwW+Od
zm~oLKP0YUxDKS9isbqzEuiqU1!dVAYr+OG+t@sx-mqaZCvy{YI5rp)`C__qX6~3}*
z<>!lpVUx^TW&zQV-;4Yk;JR#l^3bx}gF!_HyY4<U&6vV2n%VImeaTamDTOEZ&Lx#Z
z+C$))e43Gt=a0bg+Ec4o-g;UcB`t!SnvJeCa}I5#(`c0EABw1mvnn$=$4Fq^8poG3
z5~!w6b1eYonQLnc0cJn~CIZc6bA)I-8q7xVRGInW6|b;1bXw|gZL87lbct_Gv)RQ7
z3^_mL4wj{wHs~(S^Vw(!OHp7L`%}#1kxtXggfiKofjPa+lCzlJs#fffJ|~G9#n3oY
zp)hui@>M><5T-CP6%UyaUya)fe6H&>xPDee1uaZd7DY1~<Ik}9cDBd6v=q!9p^|(Y
zv&XYaao=uBi1?}q@;0UDM9Y;przwbqVermC+9PHwdMuAUs-&tgS(0C-kar4<6Oa$G
zDL@C!v{kr4sD6@6uabmZ70sZR4Foi9s#Gc2P;UC+RLL_G&oB~}Q<*3S;5LYJ99_v^
zj1Gwqom|r=pyU%*$&F$zRP5Vmw&v1*^Ql7f?Lo03p8}&ZkQ@xLjvA`d_@rpJ*Vooo
z@SoMSWd(+NZiAg*xM3C@xvghr&Ykjf!eMr)0R{JGQR#XYpSev1PBCoPt=9?e`*oX?
z(J@;pRZEk9jwhLB8ZCM%PM){slH#q=$jT6e$|3Qgy}i0|di%B+bOVRWri7`1w=-;|
z=gA;O!vNR@ly?DUh586Id(ml?D3S+`R_#nE9IF{=%09ce0ALUEgdL1fK^(2EMz7JQ
zxM1&)SeRG-^IRN7;6S@fhdNM*?8XTiD_q6b1u*DST1VJdT-(^<xZ%^ZQIAbUyd5%!
zI$O<r{aXb!L{hW?_fR`<^_Y60c-u}Beu3~c4(2mP#e?`;5%EeV?g6hs{PzNix{O%Y
z;}pBK?3|6<Wo<F6I*ESVYf$OqxkQ@17!M|ZuqKUFz2Cwy2@jfe#(mhpdD5Pxb1;@P
z4nUPofUBufDYy+bOvA%?<sJ2&rogD~(T_>tQ(EYo6c%zlFC~Lm757K?ko;Xi-@J2$
zCQv9JqzL$9smPWj8@9F4h08ljrp_MkswU8f#VURQb7u0v+gnxo8K?yklj#*IpoYmu
z#667vXpf{z=eYG28t)puQL=L*zQAheY~3o?h%^hhG|1@|0;Gm%I<mqTQ8Y+vuy_JU
zHj;Zn$ULfq$No?o09mqnF&QYUAXgw-v7M8P^n$tW&k^XWV;$|je!I7I+;ezSHQFa?
zi1QfIA;rgVky0A5lgw7$pSd-qQ}1SDc!EkL;9`at>7k6N1S?erny4xRY@aeuZ9|(+
zu+k6M`X>D48)B-m0a~oH`>;>8+FEQX5y%#x+PayOo_c6v74e7`Yh+&7v-!_ZqHlbD
zBLQbfjIJ@5&dAA)Zh^JX>G0I}u#$TuSFx57svEM%v}@T)j1k?(maQ(DUu|*=YMndf
z?$n*esN4%ltdzBZ^D44%W~meGdktNQI9VFsAAeZYfl1M$SV$$hMSioC%#&gPZ)*Q=
z?qy!2ZFyQe09(59qXy$MSDgx^yN_#Mr%xq=8X=M46ol@ftDz+4t=h(aE5$XgjHz6I
zTlt@FcYDXtA9aulReSqpN0VXusk`sApBpf(>bdznsQoN-^LZnZ0i@z)6>oCAYCn9{
z8gOsc9oW~dHK?neN~BXyov|`L;s|VhhFWKBpBl+#4P!a)BDH#+HIZa76g6dyP?Ciw
zO5kIk<)rTsvSr${PjXD0R4##oa@t`vx$qyh-dc?B{E~_fQ{vL6a%>&VnmKlRik_>l
zm8xnlCx`R#uXI;^luVD)iv)1)Cb4z?<S;sPWb$a0tC2*~vHd!vz>{cwt=`BD=1yWj
zETKlEA{<~N^gRb=Kf^WxXJG3h9RWH}5PHf<9RscpBaj5*k~Lh}DQ{jxoPYMkdj7%W
zog@noI}PQ0`CJ7D(VkNZuxZ8-qZ<Wb;d_OD$w(}9wnF9L&b9F@4)$N{zN8R&H^`fz
zL3-3XzG+pN_6h}XkcGTqTT<JPjlp1WZuaOMS~|OOT>hcVlm|j^a6~rGOln>fI@&Y&
zhw1?=v|Jd@;;{Gg;qGy-b+h^YQ|DTz4NtE0e#XQA$ZT5@ZxiV-D@lKf;Mga(xysf9
z-1NlyBpLQ`uH`!w+ItGbyb)V1Q-s)jyZU;~+(}gG9UkIzr;4WWR<NeOsSQaQfIutY
z%BFmJRN)||niwlkRfH6@QhTYGg4U|7qVD40$1eT{W;X8zLM@MV7W_qmaqM0o9B&Y1
z-)3G&1<<c$WxAxc>id>?T*#Vv|Drf^il7np;9_`sF<pcys<g!WhqVDpz0L!$cR5sM
zugqmx1E=bc1y*2C5{(XXF6LRZWTMMs8%xMKO_IOQQgj#%x}w@otC*drNVrQWE&USW
zZo`T3a^X6j1H9kiRrx;}O!QMzK3261%f-kde>7P;0n;vjiCi#6*y?KZOFq-O=XyAe
z;{sVyZYv%RCy4v)6a=yLjkQ($zxB;;*MK`-1bWpZhIb*7Mv5uuszVh!*Cd*n0-J)G
z6ScCEHJ+DX;Rf9C7fY;Q@J^p%4k54^LY#Fu;|E5!Gy&K>hw4?+$Tr8;;${ZZkCBeR
z#WCQ0*jmt#8Y|B{-?Cu%Z;!0Ew&|h=uYavL@x-Ozb&Nh6#gm5zQ9=Q;;PzPD>}ZuY
z+V`TZ+4Njzzp}v-Sqp$@*+&bF2G=U8=wrV=?W|_?v8Z)NI7)Gp3fA37_aT2`@s3F~
z2jpPxQiLG#jRL2_q)8&{0{ipO4#}oR(%RjBanQ1NhpCUgAnHe5Hass*y=efwJ52+)
zqLIB5+;5K;pRei>DDz&P5m9=PCZl27ZP}zD>?awjxrVO8ahU64qI~RyUy!>^MER2>
znjb^e5olfQz(UjX*?K)g<)pRPs_#5M+WkMhf9Z9nyVBniw>`|1eumphv;;N6j5)aA
ztoo2#%T?aa^JtC96*S&4QHGz-Qdswxt~a8UXN(OO@wn<_0$NOFR#4<!(AG}wJ1>$8
zOkS-EQ~n3BsL(Gv&9xx@1xT>(lJUX6uqSS1B#yH6+|#<i9aiyo>HA<hOTD0}XKJaQ
zP-KE{+`ojOQeuH5w{N}PeR;@XT@fAS-=V!h<=BbgAn|vee8K~z1a+&UK|F=O+x)8A
ziniV!zuI8^65zYli2gyHJ&w#2LYHLox^SB37E3T`EPTvM=CpnA<`-jl?+wk23yTGS
zd*g1AEN*T08uTnBTOE^D;w^ymXnSiPnWuD$4%UgWI7Q0TjV{tN^t(p0mE2gkE=Lox
zXChh@s~i-LCCXqnDRLybE8l<reb-W;&oe9Jf{wOS+VY)234Z+P3GFY{rOi0bIlgFn
zEp~(v#9)_fAH3Z^zJY#}huK9X|C+BK`>eB2wes2LApzy4i5(>-_ME{}QbcR^<yy&z
zET)R++0$sFNy&HX@0<1Iz{pfztEhf-e7L*+(sQa&s7BX86^*%)gf>uKpzGcJ;~s4H
zioPov5>~`jTf%Nu*C`c{Q}DL-j(4J~Hi8y}woLh<VsutFC0jyS)(?}~MR4n|hy=re
z?yzDBiDxkN^+$b<Mp+Woe@w1l#l<;U4L~DZYGagSelK-#;LOpCe^uB=zSczacA<^6
zD5My5tD<nApsfCG5Vn0jsS?`17<p1p)u?XR9L;pC8@P|bhcEn*=vAzLkl3l36C`vK
zA#mj)_=H6*iRQs-Bl4e9Ar%^0AmP&@kE>1Xyk62LHE(KCm7INne9L}7r9~p*S38%M
z;D_mh4t{h6%b=6JzJ8)0LUUx_>IHFuTo2N+M$ZhOq=4%1#=_LX`juO#B4v@!N)S6j
zJFcTcm&kADl3{@u@GatCea-Dn?ku+B(WrS~03*hJ^&Cb2bk!;XL|NqExYZpOio$Sm
z5RBMXQn{64jb$Y%Qz<1T*Ql#;0f11e?c$%UL5F_nnx#GoS4O5M>3eI}>7X`*Ebezd
z;L*RFRRb>WXA4Q}M}E{l*x&obkCz1}hnt^9jn|UbNe`ob;gASD(}Hu*eA%&*YN6p!
zpN587HC7Hk;EEfW&W=H8dCKdebGZhigVkpZ*Cn>b;{+&><R}OHY-d(h4kkzlw_>X3
zQb#C=YyjW-9%$XHP*)8vlc`uHSdF$X^K^&}weK*A_St`K;+A4E4t^xw!?u!$T<|--
zE}PK{vRl3taB%TiewQD?t68?YnkGXnbq+@93wlX2IgGDL))Rpt+zz|fv>ApSzZ<VH
zbwX8_a@`+!sCqNkS$o(??cEjpXW!gEj|U%S<Il|J=O?!RA8<x;G?0E;6tkovJ&w7F
zG*$HF2Zbci_Iz#A)DO{GwCRz#@-si$fjWQdiSG$5e}9;g<Zfp}ytf=3AM6}#!eUBv
zQLAifuC?JOV0%8f*19g-(7zRVW~o%)nR6DQKsjSoio><P!ud<sV20Ikhq&$$Ff%*U
zC*m()OuH`UUt>I45wj4#_ND1^Z6NCZadfaR2BRT7vN{h9P&eOkx+R(v`j+a{hmFIi
z)R{l!It}8=v*;)$&#l9q=WJOz*HkU9O><afvk%k;x}aG&ggCf<zh>|4kd63u98b>;
z7B}8X7KKr*yn{B7S5?0|=xNBI#_uh4oOLsus=?tK7~nlMyxLOifr~FRV;z7_#Y)M#
zsGCwZv+^|8C#;?ZxAtOpuNN(|GW#?iTl0hgUEOu=HgODdFMN$LLxKLT;`CYBKdsq9
zSGeQZw2*~2Ksg;?G?X^Ka3prMPpmCszp{oxtdvq7c=SaR`TF}f=W0|A5sZd$L7Fmh
z0H%zNDjH3<k!q$j=AbrsRepso{yBx>fq`A;vnBX_mgCYlYKp8?i)l`g1=2!JhSiYj
zBRD;sXqmZ>Xh2?rLp&Sw8rP0v(XA+#W#NI4aRGC$6xAj+(Ti@`Y4!dJ>FQo3qlK9@
z^XAg#M7Tl2g9JkdNVkBo_o^49uI5g1YIT~jD&@DwVcm{Gc4;C~y>Ghg!#EyNm|8fP
zA6mKt6)n)7S4n|THOOdr2>(2d?o<H4RWK0u7hfc-1ra?2G$3)KyEsJtrpCIW%3G(F
zKmCaH6{a2U;^8+|j{F9*<o4ljoL#vgCy;GfgGMxz$BXETPT2bI&8XG#WkdR!lj&$t
zWmBMhGs_^6iou%-6cOw~-Do+<k%(iwduc9Ik5)P8T&z=ZNC}D9IG&RvK}`V$W4QrK
zD=U#7OHq%+&7ovJ7s<t7e9cKL#$9PR&<wV~AH(TBDwZFys?qxEHp=K`%v%K~+=Nl;
z8Pgp#0^)8c2LuPbeD*Ygl?&z|DZ34iVGdNfya<2RRQ(kV8;6uy`Zaq210<QKivi-g
zDh(X2@Mwj(^CFol9~}x&9X?cBgE*7eRUEbo&5J3921(Nx=_k96uJXwT?ZK61Rc&E?
znW3D+nq11(sweaZvPo;`d`&%z${PkO06U++ORpAvw<x(Y?m2{952K2XOHcp($T)Qa
z?6ErS#egRO{8otJxVOCWMW1h?<!BF>xop7s>PPZ7u!*Q7h%PvA)tBrQ^$v=0A|<Ev
z`5L-<gHULXa#%Y0=OP7;-})KD1_rSRBP_(1XZ9x+snt!8u}gwIJ)V*M+QHl7H*b&o
zN5@<HJ6nf4p%h}!9q_ZG(Gatbe^h@$Pn#6>C~D&ikZ~@6IWIZ^rkBP`qom>aa(+m(
zvjV?W4SD<Mr_g9=bo>ttj{YJPs~JRt&JMSJuIen}e-ILlIzxp08z6j|B@u?s+28)9
zf3)@b&0eoh7JKV!sJ60wf=MamS9!I2bbN65OMj>LV(abRG1-(H0&foN<l0)ei3;>0
zrMjA3N%t>WD~(bTB}wYjRGA-!=|(C<CjVhM`nqk%KI)@M%LF74D`Ac-fd2A>|K=Xr
zSJf&P=Rt@^V>V3H=r}Uf)99kWW3X)**c~Ns#39j&F=U1E70_b_hzw$miMO(%Xa^qz
zJnUt@`(9a@#8+KB)r(6ECv|lWWSV2=;WA7(-XTbH87eNOMmcF=ssW*AMOXSxhG`DM
zR~Nn~rE#)9C)!a6id`lX&a3JpmqoT&E6sN{ohbR3PIdTO&i&;Ca4dsaeVJ>#r|yMX
zZ+7=z&hd?PnKa+=<kxKX-T@mUxC#J#oEh*u)n96L&G1)fJ{EPG<3C&SRprGM^Wsvd
zOWtn0*Lb7J5ZoaHS|j_<NZu)z2^!u~f*+aC6YQxY-37a_OFzRAb!1q<(m2+;%?1la
z?=ib%0o(&m^HU5TeNp~#{p8)+OZv~okFd-X40e>nyn#n)mXxDI`R6dwb|mdc+5Mxe
z609;}X{;|KCL}s6)SuNS_M&mnC1KC}{ryGy#fNsrT8$7AS~d>|ctu?~aQ~z*TITQy
z12N^JScTJ=#MxQGssfHvTmhucJ<o0zpX!sqE>+%=-ofVrWmb%mWZVuN{mZuT@TafM
z*#aS*PSTSZ>BW(yMc|18Z4qred<63tVPNu)0Q-xt!0!4i%?=#c0e+^6o%se&;^|~I
zm{N4uJYr?8Frv=%g#E#?^j?+uhj;YDB9f`aG6;7cHF1ZgPw`mJ$W}fr%t_y#!GJoN
zW_XM@k(YfF$V@t=(7jeGu6;d-;W3>16B)-=QRD+kVPQUD3zumzi%042v7X+i#{>~n
zu0oO1SvKHEY`|E^M0Q~2#PGq0-y{<>5#U(rD8B=6F5FfTS0pYcAi{{b5j6=m9i@Ob
z86yZ`4E~X3FsE-Y)c1099Dl%Yn3)9iqzKyv{DoRQ48(~6+0k(uou&#j$&&c&>Dd|D
zw=73XusTZ--8rrT5*Je$3~fCM`gxKt{~28*amMjAVch_0K$O4o5zqliAdKy(-p@#3
zKjF|koNFt&O!Ha6(YsOb!z<!ZA)d0+d<<j-uL~1BzZPuxC6(iw6G~*^1y6KraTw=p
z@FBsNU<Ep8U^~*n(c9N;sRcs*s)%p6gegvIEt-v$<1S8`i>k3~;eB?20Ynq%Xu#o1
zH69enR6{`xKnNAKOejQ>L2;g6?HPnQ;^DLdyJuPcuq94_fo*yCn=sA7NGb->KnD5-
z=u_NO_?JdcOA(Kf=~TO=P!=?bEC>J=09b+BV@@Y1(?Y%xPzsISb?nz;+;CTbfw<|Q
zo9VSeZL=z4Ao7KJt+s?}V3=o1v^(KAfeuELP(TgEEIE?Tq`;*GPIqt)tPOw^ue|h3
zU?-{2^UiK#kpMV-Eiq6pbfI*bYZ{?hnYH`(-`)T2@x#Y!7sALKaRim*i~?~p@unR#
ziU%Kb1Ge@?bT-xvAKj@yJ&G&qs;rZA)Yd$jLek#^NjcCz%&)Bg*Ow*iqsDDzz2j-D
zcyv!AzxX@Vy`_wH=KKKXe0z9tdw^#;>bI#z*BO$cl=juCKjKoH7pnvv<|I(DCK$nM
zQ5;L)DUEOK;@8Sc>rZ@U!3JY~GdWAL;bxgIFp=Yw0&)f;MWfj2MUH!2hg8?38%+W6
z_)Fp<9bHobKXgs5+}C^5xg-1A8&=I}p;O(=TvcC<;HZ!OX3%JLZ9Q6D-*_0U;{P5x
zr+T^idUvCHzq`7++WnrZ)9J8|SpB{5UUk*Cy3f1Y-JNbv^}fE=-B|11U+X?t>ponY
zSN%ozW%pHgxBDM@@ax^xjqWOp=s_38E{IiC{m1TJ_jPx_d(eH;{m<?X&^yfLLHE1v
z`Xd~|qqXj{M{Cv9(SQpmK1>xjpxd`MBS*Vz>0g68uC%p-n+SbXN;~kk3M*qDyFUX(
zJ_U81nm_q0h15S;>l9>S=c$-xj$lFikZd~8!Xq+~@&aeDB3cxHMh}lqTg=N4163%d
z0K8Ft7Ej=axd5OSgBT;h(up&G^B5E5pzs?{G*eobsV=Lt45$l{7%D@#V$Ya)q7>c8
z2BaU7XnkdU&DmIXOC*jtGWI`UPp);BR+m0?BWw6;NGO0kbxLkL#G)%!Q7Vb##4Eb-
zkXl{#i<V11T%(eI^GlWrA_ic|byE@wmIk>Y#WtK`8-B6-QtZA{?7m;@ffRe-6nhYu
z1QmPe6e~^PkraF66no?s`&Np5>lFLeFZP`j`_3u$onP#GDfYcn?E4USsoa(>hu~cc
z!I#QCx65sm%H3Dxw(WBFOXVJ@ayxdp2c>ckRk@yB?qR7M&4UWQPz4!Dqrg0<+)Jn2
zMiiI_m3!rsyB`JSLFIOxau1@wJgD4%IOQHjp?OfjAEh9nduSF^YR{DN=kUOkdTmPi
zBm2&j+Bc=X^T+kb6g%KzIIc%QuyL_Bx)>~fc}J*X|7lu7oepy8c2O$xgH5Ke=(AGc
zPme!G3qJeT)`HJIR|{?*VQ=!WNf-yxP;wb-9@#lVYGoP)i2!?#&LLXi{WNk*1S58M
zLWHfiSI?Z79rgr?#Y2FRAc_Ailx(25GB*R5z8XNEp;?V0Go(5Vz@#la#@)NoZJ?nY
z7JACl4vG%G=ShX$Ky(Bl6>>crq@KUFHuVU7#Ylbn6*Z)XJJ0*QgBShRTZcdPG13wo
zP~V7Hmtc<Q@dz1K%iC%hjVsqFOp5(xLt#P5v;x~9bN1ewJq$g|aa>4q&Mi@GWqeU~
z5SxTZ5(cidoAVp{MmEALsDziX*)>xi9QH6}Q$2m>Sxw6Vb|Mvo%pqd>=A^wyIF3?h
z_7vHj*#(>xrsJ`_`!mXuF^xxER8dBkz(Ui6FDUyF`X-IZhAN%9>V_&>`pLqG?RXrw
z)u<g5X${~Lh7?Zn)0S83aCmZ%jjkQ}%dI>ao~&RlRBT|qrBxb-NjwDJ{wg}To>FF`
zNj^IRiNT2`xJtp#P%#nZ<3#N7Q_1!Qa~fXbenOpxg1~92^_8e0iBS0p=fE{;JheGP
zAs)ThF#0vN-3W%-z?f_pr7RjTexu||G9((TJVRA!fsP_EATXH`b|bcS6unJ?7fMIJ
z>~GT`v7DEsRHiTb-f?_A%H!cG#^V`ACm<xjcTzwj$zVl1wIm)M9h{bor+~vrnGt}1
z1$!TWGWn2@*AmEe9F%9473o=)3~gx`26=Ry4XU631iud}uT~cwq;g?CuFOS0w!#W&
zoUICz%CjbL+4D0x)&wXz^^2a5sLvXuCnlrcEQ1XLT~X7RAJ9ttHJ;?te2|Y+TUZFj
z!&=v?n3dEQ=o&#nYl^Am2q##HPLbd-DdHI=9^|`?WT;x36%<dDEGhs@S1Z6uB%=su
zgh}12>|h_PegEivH(C}~3x!=7F1Kv~5&)2EpD{{*26>xYZ4sSXSn}5i(S=83!TYF&
zs<e7U2Ctw63DU%VzID`04~}-@|MNuF=NWd2<~d}6S;$=(ZNuO2(uA)R(6mnLn1P%F
zC@OhXf(4O$*>QvJxV!E#o?PfjAmwy;s#qKccrqJ(z-@O1%gkob2)I)6;nMUCeN-b@
zrX==Dzh+CwE{zf7Xd3J@Xj1eR7wtr2HyXB=s2)ornykI2##ff=lR_YN5XMTDc$F6^
zXsYZjr|J$4j%;u-#%}Mf1Go-eY__@&m{+4vP;ByvpC5M6gt^2m*kcrnZlMD-gu4&B
zfjYJXQcgReJV~aLX+9f`WN;MTdVQ^|;WH%9Ia{~{?L8O_Qn+`efyhOGU3LV(BvL!C
zbjm61v0=kN2B@ZN6}*p7^i#1gGA`wErpUzl+Qx(TMqQUr(lfmG>?@lTr9kB0mPn|(
z@^*$90>JQKAEO)m*JFFtFsh@TILM-PD`w_wnY#P?&PUEJDi#MZ<t?msp=$9Nhld^R
z)afM73Ot*EM^8uALFHuIDA~m<G?v?=QI+|5^?<}DQ^C~`Nkt`hxC8g7wll%1rE<jd
zz;S?2nIsDOAQz$6{FyR8$9><4ez1Q=o8C|r!rYXQ0)A+ux;Y_LEnw;-Z_YS4K{S74
zCU+CvbK%VyuM(L7@ZGw0$p-$GQ}n_j&M>LwD80b2g{z(=mI1~*8mAtib!OKfm7*qA
zO7&~^6Tze|q1%K~oRykb5ts!AhB>vYk?Fs9d|hZTU~lD5=q?l^6r)O&c328}SRD=$
z)2k4-z}zb|0p8hJ3bz@+hXA?FPfrU9vt~#gx+gKJ%^_Gr%FTL8QQ(m-&_q_Fz5MKq
zyne;ijc*E>m@pyWPF)cUNi`>iL?Ipo8x*!Jv}5Ihy)#^KXlwgNl!Vq?IyZj;^T%rm
z$C5M`9c}PNN3qz7iDT1aXa}29e6-<fT~kTRc-~^~h+9Rjkt43GS)s!Zesp6n=!U!#
z@2mM?AQ{t#%vVyg+!F&4Z7h?b&WgiSuB?E}E0#J4|3b8p98CZVE109eMpjI8L7zvb
z2@o|ZjdM6fIMX7dRD6*GZ7h-r$Soz)d=Uq$VlUXY^`}EiA!CB}TfE9L_KOZYhJ7U`
ztbhlhglgpA1WIvjVSe;9a=uv`Rr)B!e0Z5q^b45I3n}8nG4Ls>M8mIcoN*8qr0-7a
z(_fyQ1Ua>WlO%!jugf5!9hH$kyILfzU;_i`?R?G<TU)waED=>!>$ni3ST!bdAlQ94
zBN8Z<J2tL{*c$M7d7tfe07kda{}v8TRj1opQ4}9<+Oa$viCU&Xl*Q3)$q^NCA&-uC
zfFAcT^2Gi@6#%dxg`?2DM+g1w!`{~M9|!%P4>6)xH(Go2;DN_Co)QYJlspJZLMpS3
z*agB6p{C_i-DPQ20V1U9#FSE5-f6~A3Xq#|*WD;X_)XDGv6{~={!|VdwaV38Hk+>I
zcs;cckFDkj^CFCar4#j|&(_gsRq0#8k~b3z)E=R%I)bc~VJb`~f<iy|3yv=K#W|{{
zX~_SUDE=)`d{K!)br3*@&_QU#2l%Vhx4VIE`2_yXo#=Er0p2f`y{AbNV}I@L(lssJ
zp5!O0B$0j_$LjPvO|!H(SFv$bG$3Ev3F$TFotyPt*s2=CP;%^C<t3FDiTDDr6#{U+
zTSr@OFi*f~fh<mk?ro;=2Tl*@oP@;n8G>iCk>&V$q4l92PW6)1%oKy*5P`!g6~|f4
z+60ua98u}i&d+Q!;`r#Wi!N8ephQin-JbTE`br|xbL7Z4r5&)7=@>@(mG7tD?7r!}
zKG^B?DNAX8@8IAK?#ll2Uygf6QG0#kyJb|Eb{sheM^;h^8z!2g!m%eYhm4jVIgqD5
zM>J5s#<>+Ui#Y3CDQTD2fxAWwK48gJt`hBQpEyfkgH7IT?e~uHzPAtT*!zl`Zlm%A
zO2-x_C_PSQs6H4ZB&g?EF}r{rro1ia&I?tIX$B*3+<i!!;g0+wK1&DhHr9C5M;KZo
z9*GsuRYGP!XBlucx*gnXc&7<8xQ|4;PnIN4>3v(W&a)IV!Ml0$y5pt{!Tacw5wI`F
zCfIjli0}xb{XBb)-`fJPuI%8IXR<LB0Bi3=wqv~0L;VjYSR<DW5S^Xw5nqGciF7^Z
z63h&Y<MKX@{$EySJl{Lm{?SZZQ$@VH)^fbM-PLGEj2(@ZB=$(z-or-cVJy28j~U!s
zxVXM|1&Aytb#3+fz`^fqJ>Tnj{Ld}Kt3UoQSkCEDsNNq`5%(BZRQ06MIQcmSSXisl
z#V=hkgRvD~VsJ5)3wiVuAR!lkE~=(F0F;c9XaINYS%o4i5puG9hp}l^&oHmZ0&vT!
zhWP++M?R-bd`LI-%EGQH+nxP5BM3wR`t(idRX6~$JwP{HaXD6TB(aJcjj%#GQ{slR
zAiNl5QA0f?CfrOjJP#UWcwDvAB~(GTxM1Rk3P7kxF+pRR(!}ZL2pQ+m?2W@T?lr=x
z%5idn5-3#JnfpjnBNm-DN)o00AX}wG7WN1=%0==zMd9TXm8?;3`_)192$qcn!tSYO
z4{;S^G>JiyUMhQta0_)?+<z?2-^z+e2Uk~H5!Or`ALTtlZdE*EHB1}3SF6!mJ#vNy
zwzK`n&QU1=LQi>HRKJzxs&H(cy=%DfPjYgo(!K<|bwV+<gg7&nucD_%OdrmZ35LcT
z#CT1>aYUF4jI*iR^Rh(qKt4s&lmuNUS=NZH9yS>_(Rq@O2EQq?S&gG{K1KU1Kvs$A
zsk|dG16&E6m^>(I+zBZRD$XmE4g%*DnJnoeTxGYNcU-Bn)W=q(i5lhkxNqra{8KAn
z9b=7JvloNeMEv`R`6LUg%3X#d^iKcqR?_M+Gd|bqNRA?G?5^UIyQ*m)zwGXP^-uLy
zCMt?D6ppmF^>S->A1SJNwYz^@OXu;aIP@&*C$pH1LaP#VYBiMpQ+ZaZr&3vCKQ5+J
zHnjkq(TITRGOZ7-EQx~9-FYQlq@G(mfRDy2mbv+OFi6Hz_6|b@V-T;yT!-dXy?oL3
zQ?{#OK3uC~wS;fCR?Q<Uz!<?4cTd&61u~dijHlP=@UHc}Q((;I?_*`Gb;~lo^dCq4
zElTe8(ecjizFZN|-tCG?J0}%)-6rN{=A6a%*l-gW4A^0RpCu^8l0m50TE<a}%oZbx
zgAh-dTY;mdj++2ToyC(Abk0}Su!=Nai4CxUUY82YV{xv~7#KYafm0}^_~V3H9VZib
zqw`&?*0r&Hxc7pN#j`BOU=t_ToLyYq@1A4Q%Ut3o6tz4M-!cx)b9B9|EJdJO-oStV
zp9lCa&XRs@tl@vw);I1yc=+hs@4h#G5wxqRhZ9yI@UUK@h8uzv?-~A3-P{2<2nw(~
zfCMx294%P)PzO*#8)Y9%*dfO;>EG4b3x`qH5Z&f|NZ3BL#J(zYX~>`Y9?~0Y>=jf?
zyIJq@8#>aGo&@B!Xzk<aX*D24caBJKcVpe~zjJHQHpXgdFXP{xmAd1{QhK>{=2USs
zW1&a;%EN}@yCH)Rz+1+A1gjW#Bh9Tl_I>_iiCCHn)$<W^<X%H88lC^m&;HtTf9{!Y
ztxCncj8n39G0JC8_`ocmDRiX#@kfKR{#m`Ic23~qFiXxMg1d4yVB`}b@B_SK=pDT1
zDqDVZA17CjWQr(d`dF^ivmw^S(P?s}q9kDI3`RsF7DJzITP#GDn0}G<#fAix&wUl%
z_!+^`nYB@Gtaz%AXQ3vl;*$AVjQ!k97G`pLsAjfFm<VtQXA%i@>D{;nbsjahYii?j
zMHSXnMz?8Vneuo2#kvHMBt2nGtYZlGwQoFLq<~{5=^16W{(6CV?b`sd?17W69kBmd
zPPMH^-~vIzPc16)EtAZ^agIwJC#uHVz}H*H+pnVACmzB;_c}kiG~SIQcZ=6&Xt8R$
zH@&yIIL-eiK72GQ*Lg3fX>8E<tx%Tgy1w`ECKXFz6!tNIOY8)3Ot%)9x=yWq3sY;?
zb-BxVKO(6iF1F2j)eHU;HbJ@NXF!u->IKpGK|UcrD_L`~DqJin_v4zX^U{H<;fc8j
z+I_^+T;KQs(sGz|_FD<(_wEvUVlH>pp!mDU7Iu@Iz=^hVas*silfX4tfdcfXc5C<g
z&U3V1Fp==<Jo-O(2Q8+rFW>87x+7Eu3=@t5m_$7Ko9w8lZcC~3>GL*~l=HR~52_i8
zznsJ;o{J}*FvQZJikDEI7ewWagQcbAq|v8#&h{#uu#I1g8885xHzom)kUu<Aw&*ox
zulyV93@(QLt67$c6>Z>zqNs{R^>-`&Zs02gI^?0!oQH*Kun*vY@e?_~xOI<tCio}4
z>tjq#%6jvUsKtMy0X=N{z1}|lMFuV{45H!I!|Zol3;)8Bdr|{7_(iA&dl+Ch36%%J
zcDRFofDi_28L9%}|2fyezp(5p>Etv`M#E5*-*q>?OF#c-em^Ll#1|R}@HdwKFX;>D
z&?F54f#NK2HTtuq=v3<mDy@i;s<o{D>c_)jdzd0wCQ99vkN|8A<CgCOK*tysLv1iU
zh-LcMWK0%GRDD<6getb|w5G`4Y0eoXBAt`YGMK?3ZoyDxkft>Mt>X{SW?=+V4(!w!
z8R6hhj2W3;_EDnkM*PBxfl-<feB-7i&y=ogvAaAN3(*b7rp$lJMf47_zFYJCUB7mG
zCJ_wBNcq%2chn0N<qJz34U1QRr&d6kNaz+Jvi4>W(!{6|e4q*pHX6>x%?e|TG^?--
z=Evk3POvdB0bRf40l!~hC<#+O)a2w>8SCmOXeNe6>?qS0wdUo<)F@3mR^Q>Su?`~k
z6>6iBk7K0r5?I&s&w!cYY83XC>f_&C=h(-yqH7@=7o5W&XnISz#tc9624p|-PdfhP
zP0#oZnXsPi^y%8;^a*xqc)`bh#u+yr$R!7kYhjx}O`N*#Qf7uenPbv~PmqXn4?=a|
zvsI@eSG4AFHdM}BY&GD^j>PaX5e9R?*%EJDZJn{a+!5Q1TTivSQ!{gU(PGfBNR&sU
zMPtLL%}Ja)K{-AMVE5W$-X%u)rnHF|a&)|P{Pw6E1L#IJ8YP$zN-|YOySJ=~C}j<O
zZVy4#mX>0~UIJ$Tz~^|$G$NpVYFTbo>I^LaRBV7+E9kn5Yh;YDUB%?fc^3o+QjZ>-
z{MVTL2@}e}Z&YivZQ`OEv;DH<Yzcicq=(nnvtr`3c&=Jp3Sxh-Ye2?p4{d8!&7X@)
zjAj3UX<M_T)#>2A<!qP{OjmX;F3LqdoKd{!_Q`C@5nggK&rdMUF~Yv%tMz3#4j<!^
zThsp?!z6hyz-Zdiiuq8V>-<xQ=%bKVwC9ufYVCALTZB}Vn4KwJ5KxQr>r2VL%DeQ<
z=N&2}x7_qlK|9qC>6m3B(gVXFVj%f3U9u(9t0c)tvp|v)?ag+MF#|qiaJUPGQ2HB0
ziZoNRBRkNJtI2KO(kuGMACdV5NWg*+U9(C9ovLil&K}UE{gk%B!?M)j{BskZ(%C6-
zJ4(%U=AWs0r58L`3AL?!AubL*eOkIHu3#5l_g)_y{({2F+oP?QO*n@j1RiyxhhJv0
z_v<I?8TSlz+*}wW(`8f*;BLhK`Ec>*|L4I3B~c1echu@yqxcL^b)#>!de=1ASrCE`
zD<CKUqa(&@y?m!o;@F6+{dXcIJ{sZt_+VKpVThMh-n}|=K;#YSEAy+=<G%pE8qo0x
z@Q%-u99YeC0HPX;ge+iUvUSQUeu5Z+F7}tii+WbCuxE!u{D9dqOyqqUgF-LDDnu^|
zwdipq^H|ds<~;{cZ(<5fWI+ka>>P%shu1txP9?!=i!kgJ;{6bn@NzQ}auW%yX|{0w
zwhkh2m}HuwA=M_;Gbp|gXLSlp?(_5vxT~UVvq06Xj*Kl7{f<fubsoZa)E5RVp8{Qb
z3U8U)ddeDzboz8nsgyjvsmr`wfPIPq%b^WyEHzrIU473mwBBlt{;{WbVm{H~$R#7;
zc%Z^X`N{=h%eRTOZr|~BL#zz!xIL8^W}|hzV<}|k))KAj9j%O=-%nyHn7}L5<wfOs
zM{8o|*7)7-;`b(fXl1LOJN&fnjE*UT4;>d{OeHmlGjfVo>L!g*uoULj$7<jR5PMco
zq(ZcP^OLq@e~XS(n@G7hpe1!Ujt3G%fUmMqgD95`aGoWj5&XBDd*N>p(2@yu#iuQ%
zenN7H(_4+AU-Frb8?%y96mqmZ#;7(Nk~|rN+Qe4Y*Vg!$)j~m=f;eKz8rUQlDKZ&$
zR)5XhU^P?)jZU;~Fn3S)?RYfcsLpVzPx6oH1^#U%^FdW12!xj6k_JcUkAqs)nF3|E
z-!seNIyuqpO_5(D=F(=IryM#$&JFP&w|mmUy1L-MliIcxRLPJ*b1V7SJK{-2ZeNem
z0O<VXK7j+bLT<WTfXgIB&lJ(|&qGB;exGoEN^$OK=9fFmZi}Ilz-~rFQfa14X#?%~
ziY4Zzkg>W&tu<04z2IXKvqCBGVTfqN3t?J{TVb=apdpv%&m};FiF!=vJU&fsw>jo#
z=5n_9*eYS0;27<I4RKqSV3lBS!+-P%Se8TV(P3Pu*;wDe<C*FVswvB@@W@dVDVD>9
z=S{ftlH&(sM%frMAe^hA0gtGz9MN7~aU+id1%q+f`S{1GK?%y+3`|y>X!J62?n0>Z
z6E%zq?~fmm%1$To-~)xpF(jRC-Nd9aWes7K{kYSid*|c~+0p@q?w`tFvdXXk40{dp
zrnTWuvT<(*)eyw}2VofKNiDTIqNX<f0a5__0TYG_C8!_-_|zEqmtIM~p>|sDZm&ID
z-8j8{`+f9W*6;SpBUEN$hP47t>v+QaJ(<drQC78i>R738)s<!mI9-j}!3JE3fTaPv
z=HFEJ<{@{05++hWZJCW02Wv6W8D~_r|2)_l6Pz4blo9!bolP*HMVTZh#{G6Ac}FV!
z78I9aEzOatjNm8I#4E#bG7#v}e5E4aCHqIjAJOr=q~u9E9XGHvg@0hH31DIdJsFsb
z3DY|#2d^YD@JlT&Ux`mzI%QuSZ8_AI%g5g}r7*UfZ8@R&8~-po-OtI=Bw;tp5<{!a
zB#RlaiLg24x5F2z;^l=B2LZ(Z-{Qb2&T6U3nm1R`p`otCTQ9i9HYSorI*%EEJ2V2l
zjrasmf?)K6W+M5;J+)?=24p5?guP>E*jEXYfG+PH);VD=Nfu|#y|}qaQSzb1AIJnH
z1Y=uY`|Kwlr|n_daWqb)6T0e##y_S)L|4I76E#iKh?t=pj77`l&@6w8IwiV|h?ct}
zKWXXr5DuBRNHpvKC>}~#SoTkWwi<_kt8fm2sI7>UvK;GDvU8%kf~4+IVev2_uxl=;
z0a%@O6?*^RiBML5_7<oblf7@;0o}7p@g{1zl-5^wxwK5lL5gmvZDm`Nm+$CaOp?Ec
z?&v}{Z>L!HbL}w>p8rR0`xuGx-@mk31~-j&3NH?O|9KMwjYr++3)pCcu2%vYe*)(}
z!A1iwbf6PsRrZCM**Q9OTKR=^>b$2H(V{C3Un+l19s8Fu3h6bo0SS)ZnnSs#uf5#C
z*=Vi4z1=Id`^+=4VFO`76kfRbOG|^neHFZE`sA;;cNt_VR;%r;!u48v747TQ!SRp1
zUydZ%R<!=8q|bkqPf4F&We?93IY?za8{}kCymR{_vbH9~3sK=bpJIEVVyF=RRM|o0
zZ2_MPqMXNDf<Uxi>n4C3NMVgD6#0K4%`yP%-&$qEz5Q!zl^IRHoHkjZy;cL$i_cU8
zJ3N-t+h17uYqOF}6L=b5PXlXd9qrfu3R;xXfD3ftPuci<oaZBsOyrICL-{ll+3Z8~
z#6M#&1gJX8o|%*3!~0J3!3P=YO+U!Y%a$0_wI2n_RKfcStNBU*szX~HJ|EsMz`Zy%
z*Zi9JsBpe&C|&i(-E|c+K#vj{SpHDchIG`G|C$!85tJHmja(gw=#_A57)X2-rmR9u
zYh&;$KHG#PvsJX5>6|A)2p(e03CGPWx_X{rCER~oMPbwylFiychw%MVwSh{kjDV=F
zKaSETPdzdL?_9!)G{&POE6Qj?*26;WXQiF4hALc>AeD_xn~Y9VVcxAkM7miUsVbzp
zU;)Rl?rVF{AJN(M_42D6n!J$|R^~K?mEYZeaS)MfoeBLw?^Hw?$u`qMRa}eGV{Va2
zxrxW5IEA4OQ37Y<Y^35*AU{OOAWld-kt_|VmEBVbB7t2?3Q}HM@(xN1?aW|jXJOw;
zU=4O*I4`hnn_uDZx;ozqyjOU{ug2_f4F6A_UR^Ho*ea2&gV2#}*spjRb}sR8M>)P3
zo1rmXhq56tH+xqi!er~*>)?FS9(R|1oh(U@*@p9>tKL(vmJK98@b43--{CgYuy{aa
z?>`)FXStoNuZ*E{X-op$$XblM{JCSd^bTL)Sz(eZYA0)+I;UOTOFwYnzxX6a9h35E
zLl=U0Hq9?$WeW%-5qPAjg#{?3<&;&H*wxkOKwMKmR8I@a3M%Wxf#i4htJa=aURe4)
z`0s+tPabP5)|r|mL|~rUUT^kvQ$SGzl+wzFeblC6R^~<g%#@oOa6mg!P~8?-m2=l3
z`yHLnE+hu9gjyu8UAa8OSX-OlaDMIQ-Du+_I?AuT?nV!O<Y+H=>gJQ_IRTKA0@V0%
z{tBBFs1;pH6wegMM0OrpfXDzF9m>3nGRo4*lBM>vc|eTDv*H9?SFKPCa#wJCPP4XC
zekrM>i#q+`^H$g9M4VvmR*)lTyv@<Zu?xEoR4*veGP_5GZ08-TH{fD^Y<0be{!Z(A
zd&`YGS+4Ktb@QGYb>|GNve%bZucZ{B@OLR3e1%S)a3-F8M784IXGt-&;wq7v-U`(j
z2+^r?FFkr-F|mGNH4~aar98;a4udgK@XWHs(woFSR;&hnoUb*lb33CbQNRg-99R{N
zS8>xVbxc#}FZnxskaKd4(3ceeXbJ}@uz9U-TCB>T2TlP2IHiLwIKF!_G^=JkCa;9`
z+7<U*?i)3X_Ra--a7D_hFmN6$2$?>3nhS-v7^$r_Jh?sG#Cf&4zj^EMfeE{NELcuy
zZiZjAIwWf<ie4q9;(X9zDWt1)hIe~3Y;~b@=vs1ReH}*4qp*QTImyMIrUb*f3AHf$
zc%N(9YvWLO99GqUz6*|LTQFp?u?Wt<fCR%@0opSUMp4z6o(s0NpYOdnc=HAW)7)^J
zg7=>@%Bn#gs;#uxh*-O+w6Oj0B*!b(WLP(}sC^gy?a&CjhVY`;`UCuL6Z>6J@59LW
zy`F>mXc2Iz?jeOm5^gp<UB9p5!rc%<);Gdvi-d2IWQ*d%SrK0*{WR+<ZJs?WY~YVM
zEyVdLOo=n)IL$;)p4h=Zo3w?L9bE#b?uG>(5OfFUZG?$^c*ejitZn+C<>>YLX7Efq
z+WM*It8GKoH^SAo4qh~=eZRW%yA7Lo5N=}cU~6Yib?azyO;gm{c@g1j)jFTPn%GaV
zTEC9e?=W}JPgCYDbQL(WQ-(N~Kjn)RC~U(WnE>b3&f*9Hp~bY0KEx_mQTtRPT%A()
z=y+>?XX|jMLR%bhD#;4PX!Ste{U%z{Qlr6VPDA0#ZcU(>=`07AlsS-8S^iq7>h{{5
zKgk*cP4!n3l_sK#t<(J4%Co)0x6u^s=)SuCEXJrubb~Jmqfupwp_4yG?US60A~6Fm
z9CRI^C@8aIVuq_^vNDRVaHz23K$bt5;i1@#h6$SdkZ7No=sGCp$D{Fiyh-oQ$lr{W
zYxJ7(8^aF@_kNPbs9?K_CxGK4?1~#HP|=1Zf2JVfSP#(u(dq_OmECiiW4Im8dh*@c
z%EnqWnSu0wMfXJ;YiKs7I@8fbSYuIeJn(oRp$lP`e@Eq6Lowk<=GUZwuoCm)`1azf
zLloc4>kEuQZvBiwuoOiE4ct>sj7NaWf?5dqyE@!9QmM9*j5&&QC%P9M0%b7iddH}|
zfsvTIjCLD;Vz<=YT@Y4Rs00p7z3MDaqPyj{hAy<%SJ&>f^#@n+gRQTuub4@9#-q+%
zXh|uAUM3k@=AoO5@ll8`NYJKiT>#qAWY$MK7l)KS-KUCmT|qH@mk~pGC2dSIiXhl3
z$It@w2I8A&f+*FgSgyg}NTUScMP_km@(rC4C$mjd&RBOi&dRRq@TZ{>cM%IaObwJt
z3k<8j{mb@Vum7fZxO=ce7pTbK(SI)h)lv!6OH&C{+kMm9+uiR`zR76g;hJ;&$*h~6
zfCLtR>$~-h@7~+$L9$xG*!=y$^<bn!su{h7pW^NR0^>JM5e*+#DMQedF`1xFFQP^%
zsq?zTCFZ-1hp@AV)ns!A{E4c;!iu$z_d;Y4GG?<#N)e4Q;3<eZ*S*KJqJ4_4%w{Fj
zrIk6|w8uGWIfEWd`HZr}VJf{r5+!kwj;@^$&lXr<dtDR+1M56706b5pl1UJCz=;=<
zn<1p?!#=bdeo{h|fP*^cgQg0lDD}Qdq5^?}%!kGdps(*9y)U28`2L}*Q7`pvv}5p}
zC(%Q>GQ+B5CbqP-be9R&?e@~|ODpg@zzev$7>&T?G5~GO1Le#1rFJ~y-Z9!r-v$8-
zTXHWm@%eOf5QaxG*VMF}dI@vQeWf-1qQHDfz$8e1IVe_S=4%E^qx~!!?y5&5O-pB5
zmn(oowUR=0v$8xsVOF$0jT}CKfcUjT+27r(9|+T&s=Q$hyM^N?o{gsUJt3X@jDF_j
zBk=5gn&k2crBmnYxZ#X0m=q(ukd;^YFFevF6lfW5wVe$cG9#gj9$<i`#XUInqCcWn
z06C6;AGL3jaY+Z>zNVG)-j@tX2<p7Z<qutbZGyk<wXMRPWneYj8q$ic!@tY59AAsC
zE$i%JblL)MM1ffZ4x3~i#p}O@gBcUJAXluuqc8z%J)5SAo>6><^MtS7<+2tf8f>Mw
zF7QGZ7VbHm^D53uiUw(?(<=-kTAWk37ijG=9b&4Qb27(0K^Ysf(Ot|2=if+HRxv37
z*<loolK3(yR6Zga2{JfXEvASpY$*$)UHv*@+_9v2{B4HLmuN(ahN&}T6-5HW-@t)P
z(86{Jxb88`0oiOABbhE7@zi06$Tf`wm>Dvvz;z?9I+*0bt8z*|mIE=R4gnYAn*tXx
zL_n@ahqJ8k8*<x7SwRFc#H*iaE4lg^9zSr_Fd0hO(?5-isl(;!3dFq>?=~JjdQbM!
zzjdRj;bB>lBXis}ZA<NTrj#yP6-37vTM|ZSHV92WMvK5sB!+0}UMDqN-f!klQ5Rsx
zD=UsuicL7N!fzmZxi)X4&2ip{rG4@4H|Hg#6q=ehG6^)?c-O`{cd<<8&c?%s@9mu|
zk{cH<IXk7e4*@uXJ>F+1TO3XEF>!d>-d4gHD{VZ0YmoE@i07j|*;A9~+Mwx*B;6!i
zCFlqV2uYbqy14oKYV&jUZp1OOW~wB-GTKh=P}S?hc|coYSqxcu_^LOkIa3V!UELm+
zL3D{n?W5h7yZgu8N-%Y*Z-+fms~ge$WMmd+NMEg?Si0o!p0G-|ldz-|4L2yULOobl
zB>+boFY(A#6`pwJuJ&07{8>JkTHXeJ<!APq`3JYVoEi*v5yf1+w#YtPUdm}{6BJ5t
z<8&C*qAUH&<yn7LSoQ{LweKM`9*2q(vPnG<;FJ3<#L9c%k3VQVo@xB5x|{zsquJ2q
z5@U6%#H6&?3z?_387gpl^}(r2V(*bNXq3g7euc6z^w0^X1H!($GRLk=I&3f7`Z=Fq
z%B~se3G)xo(c0-p!fw*&#eC=}cMlnMxKkSu?n&n%tAsUYLHS=pVNeww7a!ilMR5f(
zf7^IIM#~q)nI<u5mSlNaB(I?`ZrWakmPl%^P%E=3M(ful+gSZ^xb{w3*wux!Vhdl5
zQF?<{a`6R#EzR1UufR@lI(cZEU6IZP$_8y2eKi#z@#ASaK~i!iu;Y{xxQQ@A`t(w%
zGLwrUnYQl;Q7(!R|J6kru8q#!Z%RIu_vblKw6TeF+*;rGc6AN@Z@pD6h(rlh!uP-Z
zzVxlY`|_z19!<W2<d($KNUL1E3o~=J%ZK4fHoGXjO*0_S{i<*1qdb_Vmr3bcaXy<4
zG0vp_;Udq{X+G&At5o_po}Co4lkhin;?;gcU21&^;47zS%TfBS6rkbSA%(7A2rm=>
zBH<R)N4$RP!)D{;9v;v}c-bASewIup!wSeC!KnBG)I0p8%t?e7gwtOI@e77?3Os>$
zmzKU$3bt^gc1k&=^Vr_o?eFwnY`xt(Ce2F!c=vVh;O((f^CUeJ*S|GyCrpFyDG?&<
z=h6ouiKRiq!i<67mdayl?oj!JcT(_ue>6NPHKaZWcUJMSxXuRUuSD4Cd!F@^&>p4?
ze1nT&UxG2LxO*QCuM;>p%V0{Tm|lDkTC6PZBe42c?A9AVr2YlSq-phTh%-1bC(49o
zwF+OV$|J#U+&B{SMH)XH#b@Q!t}0EL{RVOK3Uu|jz;LGdLW76a`&F1(TS;(yu}W2Y
zqpH$XlAfIhkEZ$>{e@N>#Pn(NF&V0}z4!L$xOdopy|usf692pV@^I@oOm?bT8>`3`
z)y*j-akJ5#Pm<z12hQ0fO7<H*>^<Mw+uGlTk-j?Y9lbi(+iBGHNj&&48^ZzVV#|1v
zoUWo$s9;Wk8J}@70Nw}jWR$=GfP9Mg3fdjz;vHZ5CZ}V#PTxxEM&|p#aZab#Z8}SG
zRC%J|M2Gyo;M7a9%XaI<){nj8<6l}GozBgR31S<XC_9tGt)CzJWyZ7Oyl*Q<@LS0&
zqoP4&xH6~Jbz3)~xSo^#5K!g9;`of}R;?V+?QkJhNeFL>cjED+NDjtiuh%AqmKa%X
zjdst<Q;(M=!g$wy%gc`~^#H`SSDSkl1|Th`r!Aed-cVeci1@{5EU!VVbAzB*%{QSn
zfxes2HG5!=*yWBgy&%rI$Y&tvMj4)d!GZrRJ;e-jZ;yKYgEzhXqoX~4F4K`a)KPkr
z3}%yL7kJ&aZs>1lLUPK0ppYm)i%y5}b^Ffr(uql&Lbd)`lHvX0qX+G_WsCq)$m;a6
zkLvej?Yw+f-ojZh=tTcFvhK2}Ju(|6utl#KY^13)*+!#wiGCgI^xEz&;})a=xljYy
z4F-ZL;)rsCQJ%}~P)S>P!(LiY$=4qQjP=9alctSYaL^0Ape${>J;8t!;Re@%BBN9c
zY1?boZCvm0uu~q{$Wr-L4#GC=m^UIVx_pUYffzpx5A6tLjH<C10pzm=fili^JdW)(
zr>4V0dI<vT;m&iuAPJ1hl6}7Xu;AU{@Z=yHUE8mrOBhkx+LLCu7|*H-fLiGJtbt-H
zVNf~wn*;refb?0t+i~XCx>kfTXAmQ_G^rX!AWh6?4a3+eg)@$LW7Dx)$|Dm=@v}#!
z0{4{n7YO5(+e-=RpVht9pi$;1t+uD)ac%_&-<9)NdEm;zIW%ykNBF$`r)-<c^wPEq
z4bezjIrCX#uno*g!`M|y5$Db}FrKjXq!YdnvQFV6x(TuMX4HXXVbR{)X`yaxhj!;I
z7fJAgTb9nivr^kV%h2HTX!j*bA9ycW>T#O$6&Kz(E3ZArNK9W2VG~_!tH1kl-*f8N
z&!-9BP^X;nS*Al#50>bj8Kw(IpYbnYGX}>Vjy=^;(R4AMvbE|7g(N~#JMmXf@K#pC
z2Z^?0tl*%4S!^6qd6f?^@7YyaBwZXSMIoaLW&rPu<Ni=qOJLxp?%F$ecFQ)_anQ`d
z6Mu0;osO>wHGJN^B#B6cEYGYZELZ#H(>MR?ultbs6W-CCjFNlBWN_~sGw_Y_Gx-12
z!I$X+sobMS5AeV1-#%Qk{|kRTT7U3x{eP`LSl@W`@Zq-`_o3YSqx;|9|6kGCm+8L#
znW4xPMgMDdGRvm3nsRf#|BF7DXV+fwXeA=|;OG^;-OJD5|B>LG#3w0cOu+~e@dP!u
zqjY+01u8=WX}mEa;}Fyrpa`deb+Og`Sw2ap=NBpk0cNKK8U$2?dsKdW$_{5cA74*M
zP1OcrWMggp0noa5bcvByfr7@ci%02roJUV$iWB!c(5dL`B2Gs@;?NS~;u!_o0GdV3
zU`&Jp4&P*`dZ2!d5P;*Fkp!yb&X_p5EarIa7e$v%iSvoFxWQI{uBNByAZBj_wCovU
z>i8+nOdl0Qi8<~7dJCjvbOItL`vqd9iv&&KXk1ZgY-G<YgCbS%1=`*K1&Sry49Ari
zXpm(&ELGCw)*`k%qV(g?j@_{=g&7s}IvB+u{!Uh_hJrDx4N%ljV5-B}APJ2|jY0->
zqtQrQ9o5t@AJBmitChP4i^8eJF>2l<jYrl&O{<12JNEo)e)~yE6|n$mz+qI3l38xv
z(h{K6HQFao8~LP&Fj(dZ8I2D$taH4HhmQ#&3XI_bk75Q7R3F0NFsYXWi?J=jETp1?
zo@2}m@EROZZh|<KF?JP&%z*aXtKFmM=-|ci&s&GR2>yO^c<|HiPH!iA{tJBUMcW5&
zemUHI`RX`Aon-IuDB9ZJfw%j|hr7?;9v{Gq*47c!Y|)N^Z(IAnM7{rdbJ#mNiVhB=
z-PdpScA-7!;BagIc(-@djdu69_ulU8?!W9t&_=X>a2)OJzTQ2CV#fzv?3YaKN;RW{
z7t!n9;r1)|x%GT^Z}<2Y>hi_z@jiC<0{YvE-fSHn?{2@{+d7Qiyght#a73-){NP~U
z-rL%J-P>7(F+jgj@2B4Wadh-*Yj4k+?!nLdy+fRUGuP+T*52;c^SvH-2eaMTJ?w2C
z<Fw3Q+W<ru<Q@>7H@)p${G<0@J($tf;V)fimdMn>{!#Bg-$FU~9_?(s-g*ghY|nuX
ztkCw`!`^Eg_`wUZiF^C}=y><|?Qt)9d2p~pU_a^|{<OQ@J9-@L9UKwh-W~zRx3hJ;
zh23K-05$jwe?NbFw2SZ~pzj|8i~aV^@$SKX2iE*&fDpi73+<=~)(87EX8;!FUxRiL
z7_=1K=;v2Gcn@p7FVj0d+(K|10RXp;?UK+d!1LIeY_#8dxwreWx4+%PuLs!B&$~yx
z4lmyB5tiBI&VSze1+}->J1!cGjsLW8xl2nM?Y@Y%c7EE$!E<3UO#q1O3i`m?qqp0y
z1p2rw?xAWB-N=AewutIaR?l13%O`aII9)w|X1xQ_agJ};$}tHXh5Arq!UJDVVvIr{
zhL47F0o{oUMbNo5JX^?+^w9$#pi?iweN6OfoEPNb8NFLa^FnbcA)11ARzTXAI+#N^
z1<FJM|3sNS{@?Grk(@SzoQW)%YOZ6}Kq9puf8qef=&Z6#tn68e8obrgV1X6;?m_fu
z1&gavoCi5(pSoxS{QrpNH5kl*3%<7es3IuEhDO-b#s?LIwcO8CLtDc1P%ICQ)w-YS
z6wC;46y)fr8A>zoT}db@Qe>8)(0*;g2B8VJ#x^5p+8Y-F;#FV|irgG5hDn*xI&f`x
zb%wxpFk#E^Gu+z7du9)~C90Q=u626Gfrw)j%MV>)mtC|uBXM&wVX2IpOAAlxV*f+{
z3~;X-|M&ieH77wj_%nKy%tn|~Z<c+)$Ow~e^eP^WHeHm?qBkVH43bSVt8}1_p<V`)
zPZAY8DJC@vEgG)h7D$oX7Dw1)G{q_Dw)BWL-bZg%qZgz2w|taLyV3ve|C_+^_F`55
z(j2TtFX0@|XZQg*ffuXMYs>}!XvyPc9(5DDRbz{x*XtrJcwh*O6*4x4wX)gN#0)C-
z2gO)7Lm#T?RZffyu!*w4^$uR|z?sw<CRvfRyfWhH$zpIqxe_V<mXyJqQr9xxSay=Q
zzY_j#P|F3~_LQ1tvu8AXlYAixtMOwoOG$2%#t|!Yb*yGBvZQnX{`%V5#^@0VJ7o>V
zqX#JARFYF*JTT5jbQNC<sIbf{IAYI}c*vCF>C>n3{&}uAECdk;(4r~%Ga{Kj2D(DQ
zR-`RNUU8#U0KdydVt3_#>R<j73;Yqi`UM8_N7RG=?caL~|1ut~M$sQlTKGmN5M8@P
z4<vRN@?ijl_zcbbm=p<^D1i!<X<^SC%CFUH;c8<bNtzGr^BjGVyXfwZNm+pcNPPfZ
zAJ_>v=JJVvvVR0@&QWib#*aPYEprlaH0eYlj;&f_ZOIf{ChVW4C(5T9ZK(JR0o<RC
za7@D#4hAG1F)^2#9Yzfq8ZKH}Ma+IhVnMy*39ccN!&6O6$qHZ7)2o<$AXpSiFhgJ_
zq5zt`IQ{|cskje7lc%#0Hgu8<Vmt??w2=@F=O8v1v6Id?8V|s1YiB3Q#|fKO7p%?F
zVi@Pr1!6V>3g8oc)IKL_Tvmwfp$&kJcKJrdAA5*Xj;XVZq&(OW4D5<;*He9-4dTH$
ziv>1-Q`&bFko_Wwv%-jm-gptH8laQ{co~&q>{3B1V)Y_U@6;9vWVC8(G1Z)QXmh$d
z(%r|$dJC5*5#ghdOF0-dyW{OzYp?l#+`A_#%6n=buZtr5j}3U%;rZh}JsTT;Jbd_o
zo@f;ws`kgtdQnq*go{_`z@~(2v}K8f1FSezK>}EoB;$2XkHMimNpLuNuIRz*qvu`G
z8>pc5S@LnJXh|W#;1&FjLL{-g0Ab3><18%tt%4(%^8s5>B#3q$v6F<4NLcbQHPNM$
zj%zE*#nZrFntQ`)P>zWZ4NU42*wCd3+WtSiLl9^F3;#nc{Is>FW=rq5ihm*kWY*R`
z(!(t~=b~Md=mT%-BK^qAx5PD<y3u$vE28zTx08g3?7K(ZH|&qSw#qsx8Q6eAL`rwO
z%#;ZLh$=ZEoXzrC5p2i_HL<29{a-b+#(5}!Mr-Rli|AS&2E_UUgaoz}0EU8u1BHm_
zM43hvifAmU9;hf<S(MAp10}XoW*p{%at({I3}K)dY%2^+z@};pTED~xF=%&6&BrM!
zk)nq-E^%iTSL8+r(F0-pkE4w+BFdJa4X&e&Rv`$_2LQ<ZEYUcZSUs9Y`H9xr@ptUl
zY~e0_kpUDD)ukeUDni*AI|dUHL>Vh!<JK*PNDBtN?{9PkG6@GB)?XfQV1w1U^hg~<
zst*GK;xA&EokU(?=)s_%XLN5wb{Wq=7%?%<vuu=pNXSVN0EfBh@V2;^4bH7a!ecki
z6dx+x*oP~#;?v48lYEJ{SQz$&xCWoy)$SyrQ*c#r1<=kpri`VXlBfZZ5}QKOa_IER
zX6C{c#XaBw031NUMPvuT32)mz((O9NGohLeesg8SYd9`2ERz}*%Kw{8n>J}Xsv&G;
z%+kk~d>BBF_wh<=<@aQgTT2RSqDCUVjq7V0{O>vsfh-Es%fv9e8<cYk{y#tl9bE|>
zPITh%`Lb!#(oKq9(mvEfSzG!3`|pV=DKgX%Qn9(wUB^?uy>2i@$}lc&NJQ<_Y*?C2
zM;%w2>)%rYrZ@P!zOuds?@PVi?`}}xjq>j2?(UbnD;RDFwvIK$hxZ?CxV>&{tl&c3
zce*9rUM80(j0e@YP8=I4e!kUlk)ic?C}%tBV{8SJ*~!=@Vuc>`D)xFt!F5I?XTrky
zd@UaqB#@vH%oSa2M^O8MFE1#AkJ@LbC7Mn^^c!k<Wc$rqc6BzgL-ii!7)==EnX>9_
zS{uqjD-Qd7j=`CfbC^Bi%R=D7iWgXEl4{s`g#)`-rQ26ZAixz-5|0@h_9cRh0N5jl
z(>y20aIEV};=qX&v3+%^5F<=^SXw&4bUz!9z9j_${Q2O!hxq4x`18@X-{GGR;Lq<K
zevf}Xgg@8U?%&71AK~8{YgGDM{QLg5^!Io8H*nkd_xJesx9j(%ANcXzcN@~vT6F)x
zcWcrY_WSMk(i`-=_MPf)ErR;rNry0ywFev0BmDSo<Gysc7JdJaq5eJfv$po#cdA$X
z`SAPo2672(myM0@zT?Ft1zG?XXX8jkQMXqWmg)b+X|3RNn8H%h&xxmDWo0Ub?qRR9
zf)C-#e00geHs#P!3`Qm9BF^BRWT}oRp>+-wM2CgjhAloo?>LZBXBSEVB(i0&1KLaa
zfbvw;9G)a8>JBCtA#H22keHzs;WCY-G{uTin)K1A&m-ugL#0+zP{2fT%!3l=!-*Y2
zo>VID9=w07O;lKoqRcpE!18?8pK9^tF&DD6CXUL)s|J9@{qpWUbU^OHeAP?T>U2f|
z^$g8QlyHpaTd5IT^LO9z5Gf%SiPjdrbX}cFsR6y^-|;YZP^1?D3W|PutgjXZrM6L+
zRBB+#MMic$Y`H6_>dX6194`dU?miq$yF2LJu)VeYs@H}^=tT7I$}^hXx9>5OYJ2_3
zlW#jtRjTOJYJ2tWNHvMZ{f$%o4M;AL%uNN`gUP&MLRVnA1(B@T%E%x2e@5*`4_2t9
zj%vq>>yP4$0D$!7e83W@PID{dR^S;XcnGCBtDI>SL?IHC5f_Tmhz@%%chT<ph^B2u
zMzH|jJVkQ^mTatJ(re;P|Mk|<k5SucZe^XCL9bq1W?*xZkLCu(Z{qpx@lo^$EA+B_
zc6QEJ8yIAQC|dOBzB7%adL9_O4;EGCg6(!-C{EE=JBJ+mO+00t&FmJXJ;{aJcGbIW
zcecx_v%BAR?tRw@G!jvaI#x}o&0m@X?|P6>?rAMbW!b~6pQDY356PYk8Cup|qQWP`
zFf83DBjE$hPYOwpVOIw*^?Uo<2Xvpg{*9YB1t>o5$39X(K;-CY)LM~Eckui_qV0S#
znT?UjMgA$L=$?dt7~i|ayZ>qR6Yb?!a-oJ&=tYeF_0<(rK$h2BPP0RE1&^Oil06Jb
z$98*D){YtF7ztaFnGbf$cl1@$dKD}0LU(=<e}J7n69G&K?P-Q?SV|=fQUc$r4JIk2
zJRyx0SvpXN9Gf8(?PaaHR<14p+S><j_m4#Yw2}x4L}CfT=SVa;jEJW4LhL*WwEh6%
zRp6}-nk)e?aTRk~#F)a0XloU;FG=O39k6@K^jyKWiGs4J?sI|mzKPiGb2D<Rg1j@n
zQm5U91E?dsE8k|3Hk+<DSeKuiPFHc=Icf+i5Q#MF%txXdMZG97TUH_!a^N8%oV$ur
z1+^ZFG-Udzp)LrW>&#~?iK6{<)NZZQ)3S_%K)8n!ej=BBIRB0<ZZox25mxEuhbDQl
zrZh+-2hS#~jZd{`fhC^84q2w&@4;?>Gf;iA7KneFg^i*oE71Y8N8P~SPu2oe)bO;7
z?T!!^hvsjqq6yYyTP~}OJrD?r=q$ycNhjBO^rt7*=x@X5SDr<W<l`Y(j1}kUDUJ@i
zUOGKlqJ>>;Iz#lPN|{?>&6=9#A6yDBo62pGf_-B32xTAPs8%b$vIj_~2Dh$xf$vse
zM)Vhm-}v87^+@&Jsu=0IE{CPmjCiCY(>oO1&_D@|^x%-=e4>h%RH}&mrzrqPK)1gg
zI%IW2Vj!a|a69*L-G)H;F3=E}g_8lC<-C}91BP4*5ks2j6{})Vf}q1JDW-I;ZC20R
zg*~jT1$bq!=1m)5Z078hu^NK8YPdy_{jsgSc4*Fz?ssWBF~3>?xu02IiC5>M)KgXy
zQ>ExY&ig|mTYqhp)gVZFW0tq4`Vv7A3Kak7B9OCc;ofFREylCxY?L^}=j-q9@*cE$
zILdK-y?wDJ7@p<w4hBCKQ;m+&?%OEpkX3zV113@oHO{Wf=Ko~pI%WG%OhP6qO=cYu
zfc=1tGXWnbigBjFuyifa?x;F>1t3<Q;QiStCyq21X$OZ2#4BIwk@k)xb-jJAE1`eN
zfxS6n@<%|PWV(bGa>eXIZb_E_BbS6+8eP0~^w2GBJi>6l*NVjQ0!`xVEGh9)u<c<4
z<ATk$GKUKxIBFm=WsoN6qLCzbQydDR6U2&86v`H8QR6+DjNUCvfKN+!Ad>Ebaw?mH
z4QC3(943i@8L4{f^n{ES9vKD(Hc?|z-|R4hIg=EKEF{o@l?xGfTu4Z`LmGrS`{?{f
z9SLh#h+3mcjQAF8MVl}1k|Bk$_CQLA+d3^;3~R-PC_<e2`Sofhj<nNIwifo@V&;eV
z$4B>r0FrWX-~efjWLT?pJ#bAPXcfuCw9RY{ps@wXt>Oc4cr93F4J&N9D+cWfxd^~h
zF4F>FwrI2~Li(NY%7zG{<30&3h?1xIV5Yf6Lx@h+YtE>Kr*jCyPG*>~3;V*UGj1s6
zG(N*iHa&efZAI^D(O8-P$+cl8)Yc>%Nf*Zrl%}T9#+^qi>$)7546LxBD8k>!K%NSt
zp|OkcE6{?hC6eC;h(Zuj3x0BU-QABE+rogr#gZx%ff2VR6)2)ld=^qgFrhQZ5>v%K
zh>mRL{Qv*#{p)rcN0KfK&u?8t2|X483ZzKt;BM;RMUkL{F-39+(rRzFHdYZRP_RH0
z1_g+s$KKcSUdwl7U&bjjGAj!JWp~fa-i_5QOF&f~BO~MZ1eQbq%}YH6gB9^sTq?jg
zSWHG8wTTxQfT~g47ASo;>21LwXJa&o4tqnW7db+`6YN4_FXr&AFXk5E72riHJ`E>g
z{<YDwbx91!NJP@*-f5(C|72gN%h7FPQx>9w`753q+PlHDt8LAEJDy*!QAx|s<}OA*
z!x~}9lS_GRg6v(Z>K1U+nI6lwn>Vd<Yo@7FgUv~kI&5Hln&fYuadW*3sAzTm=XxWV
zJeMatfK#*wCs1<`nz9C<M}Mw(94S6{_`$c84};uf^cVPR{27$wx|5%993Lv4*;day
z+_q0KNIz7-FwMMr1-$@na^1Y};stgO_$MX98oV!+Tfj8>2*s1T?y}iq6ia^BzIOD!
z%7!8${r}`m?S3W{3;EUVZ}Q+}@_*_jLnm!kqx|@<FQF~^IsDZSLPc{#34boN2X9b|
z{6vHhqUO1%17}n00Blq<&!pEGi?xQA*rM#0$k1dDCpjvF6-Lu8`j}w@lC3XK(Aa8Y
zkK!-<uy@3d|C#ECaG*`a<LyotdZ<s(XRvPm3nygjOV8Hrgf6!hc4^x9>!L<t(`i&R
zWQI@8NGs*3MPJ2sk6Op2F+3hXQRwQWb?*dk0h#?7*~falj+LbwRV~55%>OT1(h@af
zsA`9r+pZi0yc!+$q8Gr*jr}E$cNRTk8cv>6u9iIUEc(b_y=Tx_Qq`4VT83Ad^WDVC
zIf_xie2^bQDQNImym+zmYrPJSnSV5XEpKjc1gpkQT~>8R?JsZYuM64&*wXIEZ%y~n
z9ld&m<PoE8_b^coz3^b`%V5x0Fs!|!)3<xw_VHn|wfXJN_TwktKHb>@JMy2mzukKL
zj1IK*WP^8fYxC)&(YS8Nj0Kcxe}hgNaj7!P9TcE4meO6`&8OG%>09&lPE%sojo2-T
zjS$r5g+RktIr>;R2?Rc0neVx1I<x`ae~{(;NceQx`&cA({?|C0&!&d72p8V$*|R5x
zr@GNSd$N}>!Y{f2)**ulLAevG<mA=mD~v#BE2rZ-wnYSK{nC4uK1sj*%j2h){q5{8
ze|h>`JqitgOX<nC&+Q$JuL7bMw4D5JBqfL!Xgm-4z{?zs)-Pqa_UncjarAjYy2Q60
zV$&P&$AfPzJQdLxK5!rLyftKk9UlPH{|T@aUjKOB>Ykh(w9c?NaQpoHsMT#9AGG(5
zsf>-n>)JbNzd3Flboci6F>R4Q*V%P%a$A4!sR_MG85!wHuzLRlU<~#h0M9q)L>^ji
zz^nF2MD{Ab;M&9m_-RW4-hV<TdGLU_>Vcmxd1?or+J3g=vB&t>&XXmNJ;BEw?<{%j
zDL(dOYsq8J=&@x}_!b{~YNnuJ(dhB@m&vt${eQnSf0$cp`n>X?kNA-OxBokl-%D9p
zMg!q;Iza9Zl5g#q0*JV8cd1P`Zhv;b;s!<^+n9Zv&Lu<x-+UH-(=K22n@{6!+Wo11
z^GW<oO90hxK90X>DXjX<o%owV!PPHr$6wqEDs}M|M%(#~SqHZBQPGCp_tKAyrt;C2
z@<R_+DmhqOV-tnwz74Kb_feBuV5@@7hG4x*z>*=#Yjaz^l~&<y+D!H^&JHdUHh_a(
zhDsPTq~g?7I5Kz>(R!(y!XPWWPJp9-9F0!X*-<vG`!z(?Gw^C~$w2dWD(i>J&N_5#
zE05S)z%<>2YqCil3m_rePZXda#)tT^E)*ORB(%Vl>qTqOCa*)178zN%@}}g1U|MQ1
z$*JBZFNbqdYWIRPg?XuFw2e*HY`$QyJ7<<Xd$Mu*5Onc>2MZ4w74bcJ-QgHfS73dq
zZPyYm`APAZSSK@6)3kx|)CebdTbnzs7g~PE9)+>ywXH4FuKgKi|F}tB7HY)>GKt9w
zRQO^D78wlflinfAcQk5J@NJsl#O!j+)S5Yyw_9&&7~*rorNHoh0GueyBYpCR8L>}7
z*UA26U0y@KDgyb*>_isi+2ynxFm5t3rpX|?Nrp4YxwBDkDAK+3MWs4WwNUfcm$cve
z^W)3yzi0qWI5RKl<p(NEisSb5(eitG^@{YsQ-1Oqf*a8CC?Ru(HQ1DIFQUq}0k@sw
zZ5#{r?~Ugak)`8Tu&M?{jzN~>!Vok20a=qaP_VLIAZgn{z$sC%|6DBSIU$^hs{`k<
z%@H#<LXR-08oC)a4GXIYOS4Urs8;87H64let#MjSL%RA34Clp*02ddz4+uzRnHrka
zFpp+#^IL_o5X~|Sqfuk;v9jP|psco_EXx$uq@&Z(#f76>V~&LEn!r<RW+dmXa#pT<
zS*XZF!;sc+YHMQkU$fCdYoP%KZOYT!@X!IrrMhrI%%q|;6%Dw6E?MP9<a`~d@;jtd
z9)vH*&<~)@*x1f|mO}zN)e*B1^0#=1#jb6B0n4@{TAO!>aq$*tf~?}jyw}Sh?%gKi
z3@Fl^6)3(UZK|y}*()Qlp!C=k2GUc)1C=`7beL}F?e>3jS0oZmC!5u+ZekaoFGbwq
zri;~ut<rZSe3_5>`Yx<6cFR*u*9Bcs8YB*m+$-ClK1CI#)}XN_y{8fH@bt)0tALXe
z+-p8wwY`47=E*8Uot~tyyMpv#RH66eG8pGr!U=Dfejhf8oc?qlZ&~q3VkacZe10kU
zj%oy#8SDq%6sU~5L^QK<e!{C)DlScKrjRs+db{58MpM8o<Vpu7#&{Eap4IeK#)>&1
zhIW&gjqCyj47czG$`~-45|Nn|jS|^%>C7t~rud>ql5n+IiBDgK4>XOLt-XMRfh-Ux
z2fj4PpjvPnbGaj!mz8rY?-%J=Eov1x5?$@9*h<?w)?dMTKf^^ia8d?adNX(STX-|N
zs^%-q_QbYzJ)fVQyh>Ibt_O<o7&!*01mV?^y`81Kk0eZD;N?v|{Zxo(L-=gKaU|#Q
z@|K|igto|7R?rau?hO$W?DxTUY+F#X`4gntLFF^kB7}HS5A*Rf$Mk2A5(*C(*}n_S
zwMMge@W6$0n=hY*b`)AS@|n<d9p~^pAycSEw{8BvWBzX>)aeuR|EK2v&&>b7HUIy!
z`Tt+arLUOHY~$<j{x&qQ4J|+{`*i!Mg3%2s>uzs>q8cfq3mF>b%#C2P)J{z>xsz{>
zQnBGFIOwKEsWfuRv&X(>IR#~)jz1dZ@LBS!d63jrw1bx(-=W91@$o14IO)evqK`kO
z$9Fzh%X;aNCpfsr(ZM~X*B`6FJy|fgXY}|JHMpk>2KOyJ{&d0M{)~fr79HGQ==Eo6
zaNjN%-1Zhd|E(I`pBId7n|J2V3x>D7gX8;4d}n#_|Dv~cYtaaw@aAr*A#QIk8Y6Ge
z_O?Gr|0(81KTWqjgtdj;Z`%ug+gb42;|0GxS@7G_1;0I8@Y}Zwe*5!+-~O^_?h6-Y
z(aLNuTAJ-eYqPy*akgo7{9nOlxUDRszr_VB!^<=)^Z0X=rv>abyYfd>Ayk^@lsx%!
zqiQPIl{ZgSTrjRpMKME`t5c#)?dLAu%_hyq(-SFZ9PKq&f@6$umnZ{(1Qv<`2>BGi
zWuZP2<a&1wI-<%nC1{ldHt40CA~~35gzw-P<D#mJnEdv;C*O;P7oQt=k}z`z;{kK4
zlI#N(xz<UfnaKM+N$$}iC2h}nj*?J)nqU5$tXnw;wKy8j%Ou};HJMGDw4g))ezN4c
z`J-vx9`)g0hL3qauQ#YAXZ0KQ!Hz<;Y0(p9XbU1FJehRe5AUEhn&SDHJTyZz@7C#i
z1&7{_E(7Qf91-h+*C5uF1<<|D-l;RVL}!tB(->fK;>IfrTEo76JYWrJ7WP+}H#x9W
zY{L>-Ly>e4DmoaVaE7#wKn9Yv1fS5R7|FyODr~fn5S<Z?EOwZsJG$kjyv$;a!eCd0
zWNIlR1ZxkKESi2!9dnP06;u?oPLD9rJg3abVL|360N`aM58%wuI8~ag-Y&flZX4Xn
zLo6Ze{(^%hxnyMw32OoEnS%s<j9lLn;N?1v@VPQ+O$^r#JdYx1mm*L?UQS0Nd07$X
z;WKGCP-YzTj{nod<Jok@ln3$GJB;G5Uo{N)VW%{b<-NHWk<z_H)hH@LQG$_~8P~b_
zhcM1Y^2)zZ8_A_1kWWa6C+6ZAjPje3{7>6T?f50j<x^o|K@wGpZU0M?CJ>C1S22_)
zep|4md<_TeZ`ox6IwF|`t=-)8E0nH)|Lg*Jx+3iK{g>eiy5%rD0&c@P9{92;2`{g(
zgu)>JeMvlT#o?3?T|^Dy@kn2EO>t-R4+s%(EXU)?zpY@h<wg9**la;Q;Jn+ld`*%&
zI($>m4^YNWtO3ZH1EB&9vSfEP|FY<<<n7`%v>ghf@xTd$$lp|a2j@+l4hPVZZx=fm
zll`?QC_la=(QMnv$1JQ6wS%_QAgFYJVadvVBrqiiPQie=CtT>mkYCju&solmWW%@R
z^5{#BQf~_2p%T<{kvfAe!1+iUj+9~64e4t)@sO1e%0huZ$;R-K^XW>(XtN#xWU=x8
z(SwW&X<=Q+?#)171j3TfAtv4d8X&<f!oVmAhG>Z+p>PE=c3B?ug*j`uPS&*`Xa1bP
z|EJk!^B>5&c<$_!=xJ=i0*uwS!=j6~Gs=(VA78wGasAq+yGpi7lA(2y3a$<9N&tv+
zTfO?0OJbmhC4!i_QTU};<*Q;D8_88pF=0S`Zpet*WdT~!Dr$gIGl=a1Y#qp$^RZ;4
z`fy*)AwdyO904&rwjfLR`wf<?$C!#bVFDJDk#hrMJU@QFVMe}ze`{>|E=Yo~$q4p=
z@ROvt!;M|M+zGNA23%OfWq)pS_o!x$&MfBR>I|pkuf&6I)8%0`><-w=z+4qD(6c<h
zJ~YZTD>je4VoKQrVo6j^8)rw5PpQYXh~!5BZ_N#l%X**eDh(`*9C0u&sgqf%y}(4#
zLXF3%Jba-Ufu$^9vKC~1V?9V7-UuGXr^#t=Ym>rxlY*^Sd@dhyg(CQ62(W-WQ{Eux
zjh7$n#&+bGDHUzV=25NI5FBzhzDnsCIY2%^>C%4584K8i^lYO?oMpF{8|Ej_MHX&w
z(@9qA>aW)SgGvZs4zQmmg$q?6AjsA30UPNyLVnQ6r#9`=gJZCX@z|4y6|Nydz8p+3
zT*NNvaE!3n8+3Y|tb*ev!@noM;<`B>zObg1v=QE)Wx7bEenFA#%Ug{}`=TnqMkBi^
ziRI;Xs&y1ug_8M=N$E9c0oI)*n3O;}esl(?*DMHn<3Z^dJ$f&=Fz!Pb9$@E?f?=QJ
zQ#euIfRe=IE#J}6efUz{gTL8pg(eQg+kXAky#0y;U0KlGknjv*jRd1j*<8>7AKr>w
zhVP7;v6JkYKewI517DF|^x=0V4p7sr;LFR01rRI}i9;O5WD!nyRN+eW1zb>guYIJ)
z)0s=yCVA4DMX(eC8VG2M=Hm??bd1k>=<Qla_D;}H2WBO${7zc75@D9~Q>N*X5^W`*
zB~69L>^J}Z+u3Ch3E|VbywbAZYe<!AgxGHReFUP!o)+f5(tyZUKA|*$^Bai@bE=18
zhFzPig#l%2KznOR+BZL%Q^W)Du{`Y!1iE8zuQlyB43Pl=i$daVD^6l7HHm4TIcKVu
z#svp*O<Cbqx{T~HxKZi5Nrll#^qT{j06ERiE0{a)ydPNMB)DWU0-21fHZeXXUQI)W
zKQ4Oai{8g@-}f3IL=QROPhlL3ZPiz8fK`Bxnl)WJJt(N9<RTJ>&<bpH#u3E9F%dxz
z>NI2NfKAnm#?nYm4*_9c^w2F1HiD8Q$Sn$~a7MLA!o_`EH8s@4_~uON9wIZM&YB6T
z5y=)eY)vq${EsNW&uRV^FTk$FOtmDjQY43@iP6bF53xK*;d3%N^qQxLwzZ0N40*O$
zy}i;cW?M14$jY7z^(npoy7ay<o|jOA#J~8XIaH(|ZU^@@>P2h?sJ43TH<G<EMNh~&
zVXPZE_>nqr4K>6$<F&vLb<C<jy8O(=;qatL>Uo(kEJ6%r>quk4{vd;Y@F1yJk`<Su
zycBK$4jRcDhPh=-jF5G3a0xLCtlOt>Ms{%`RR#<0)85ZiO_qz#xpE<a`z(HnUM1U>
z`{F~TJ&~t?%fb_551Kxl8M1)9$arGN#HH#Hw<^e)sK=55dkqGY$;k3V#&0Hrn$mzN
zjajL|wtmL252R&HFW9WKM$d2H{5R-dO&@=Ts<UwPH$<{AhZ|aF!&Be&qo|Wv7%Lqx
zCMdAysyN)ZmT|7|t+_C7)>!p-iZej4kSm7)_F)X0SZID4X$*0g2_szY5W9W@Yq`zG
z<{szpa)@9;eC`{8KG0}16rPRKRC;r)Uk)L&5a*^JxKWi6SPV_(t)HHL0Amtnp8bb&
zI^xCci{vOCAEgmF#oB*(5bi)z@*FcjeY}kXF0x!uI+^2)aIa?U_d^PK6wzm#{&1fM
z8!}J2i}0BZe4y;=pd(a~^IGM$DCLEYF)y_2pcn_f9OOhXe@@Wy@`kJZ9`0`uW;u>9
zORp_&QGpQRYYM+?sPM@D7nZctO9jC~c@&RMLHL|cm-yiRII@m!I}RW+^>NunR^7<o
zm3DsjxC7nn@h%28&xSLJg7uiC^&2oNuFgujaZ<Y=!1UQz%Us%p^2^&0#gA8)Z%1u7
z%Ai!@|DZJ)Z&(hDKbSG`E{oFpT>>_SZS_n)8_iOBirU$rw}h5pJM1&Bux!0sLEjeo
zP(8Q6_YvCO%iS2s4K&FHr1(Pa4%$I%>rMDqGaL6e@F8x%45dBpO^@twn)19n!TG|I
zrkQ7x<|;pdne^dHyB22dEQ0NNwD4p%d6$7*Kkff)_RW<`F{76Rub3nl@d|VME~&zo
zRpJg1^fVBD9v3g%bwhE&UqNt0)<<y(HKWb2`<~Eb!437b4i<5=lYK}3*-gS&qQbOI
z<nk1+^A7Yyj*X}0ztq2<JP0lM$w!G8n_;WDMc==_ddNf==>Q+Bw=<q+>TFlph^kr*
z`FNyB&B8UfUvx`AFr40E-9)n$O)jM3y5Ouq048AkF)A}OLZ_qQAA=#+M^{olOR^<_
zX7X^`t#8CK4EQ3!gkf(#Z?7ER0Z;E#KK(G%Dq&F2`b+ax?DA$YugYrnF!pV!6X^&V
zdQoa=f#?9Am`?a`yZL#$;-ZI-u%}5A9tDmRu9JMq+-V~=diX#y8}XkEo$Ya=B~lS0
zfo2pw@61a!&jt?Q+GH)-6xpS$5erBY)U-^zmZ*+1*I>X)tXLawO6*TLMS^nHTHrO1
zPx&Ot#}B)S38VH{ssJ1^w~GyKaon1XuB28fD<OCREatkr$G6okdfg;uVFgEYDeyDL
zWJ?Ul2^|L>CVa)HW!4Iq9fSlgXQ_dnMWwac)I0|#XeA7c`b8*}<ZbCHvZ_2FhN69p
z(x3x(H`lUaQ>GuPu^=wP#hPF<Ws!-DafbiFBB^q7WO+pIL<l8+eXSfDL#mXWUZtFj
zS&Y)p8G!cgog7M5_so@m;h}H5l33<&jhbYcA_urDvkdMO_JeZ|Dfre$BTtRRHoIoa
zNru-cSYfzYDJ_u1sXeI7JgfT+fo;npSN-$zW!Zr|<^K`sff^IY`u1I}AULqRaGC~g
z7aEOuuL>Cgqz&rCK@A(B%I^88f`ux+R}SETlV<~X{_jW;bW554j@-aFfSpbbq<+fT
zffBleawq;Bqu1e|QeR_1-r#Cc?-bZUtv^(qU^u)8zfN-fZxLf`b40d2{5KCnUS*{J
z#gWP@44ztCajoyUKdT~lK`OVAlS0YlMXt*3i2<t-dQ0WA_|du5bVE)p#Ha&ibJZ~Y
zq<x9p)8(Q47}&Wu0jSU(#rBr+eaSmlKIvFQMB2hz^J6xeVCaXd>f#uRa_NfZJpl-3
zm;9~jhb!l{&w4gEdbrnQWz>~?DP*?S%%Na2+LA$4R53auf%WDij#z~_KV~j?lR_{C
zA|uOa@<^#6m^xOxF`6{AaC*p9YQVfC&J%!>D?G+|mfqYwr`o~<t=|~=U*nstH^QW1
z+bCLYoE1QFvcvRWkIVt`HOQKS6T#gEh$9hh@#iH>fda8SOj>BV;t=E0rseA7L3(0)
z=@UCkpLo3Vi6={+c)Ik7XG@>>_Cq9v5I(R@PL(32^A?YuJK9EqxlVyFDG$ESNQt%M
z?8XZ=H>U>p1tEqoM=1#HL@}%4Q-)OqYZzHRyEbA`YdRY>lXUvm;pg4$Z?|?fx3+iw
z`~>K`pU)vE7#Ic&qR#*RVy|~YMqg0$-Ly(n`}nYZ+&=%2CdF_3aylJeXWm!0E?h?*
zGT(fWZxoGv0T?o6UZ%#(!@sESfKbhY$*ueD7QVZckRcKq_+4`o{NhXNzdWy4{#iQz
zuU`D~bY8vmTbtm53wL2_bEWm)+$!zBcCt~i3q}t652N;cX)NA~TiC9x&8K>EHeLcO
zSsmMMCOeJwmAAzxiH~J#&gi@H{pe@$kpt7{H7PK6HtHMs-&`ic9;`g5upz#8!8h4v
zvSzfvH44PCAzoCXfM4kxbiDLhaX~N4SqbHCR;U)HEpdOUG94ErWs#dyBU?3H$BwZu
zqhqop!LO;ZX({dpOI{ceBcFrKMuuhx4<#ETH5Bv7B*z*W30Hozcjg9Oqc#iC44EtX
z5kwjR2sIO5vnJgg$BSW84jJ1br~85$>rR_mj51gEU_SE9XL5DhYa7xCz%B#Y7DQKq
zG0lcRATBIb>k%6cK$FmA|4f&aFYE*Z&{?}ivBY4lAIY)hgLa(+qNsNaTiyi^e|@CQ
zF><+3&Pz{nUeHvC=x7gjno`-Azt~n07HlQJ8nql--LvPWX3@&5YfbcYt@m5!1!qyw
zX?3P6qARHSY*Pd%ur(dKLu$=KkXODd#je4wh0_BoJyHXp^O-jX8BTaN$vI7t$Vghj
z=|e;a$N#}@PK|y|rV+$J#I#@Q^lMTmN8uTV?8W`;$p^DX|GD*>MrkBLI3js!OXGs<
zXva-UqIqC?vcjV9Nvk<V+b8uZ=pYdCgC62GWcaW*v2Om`z=E<mv!W>q{~bqYI6^Qy
zEi|t*d-pb(;Z6-P_3E{Y@uzWqGxjc8+xu{=_*ktJ_S>Rs+t1oVdu@4>H<M15No43B
zAOTQ2%cOwdcD^RY3=%>8dc#sHpYjilM=U5b1aI1E2KWeQ2d@ynaAV_Vy&ot)+2(%!
zpf7KIos;N_PxDYnGE^!<X$UO{6Btba19MdOAkWvY*RLP_BJmP@<tuRGmbGw|ZR^^~
zNZ;5zb&ED@E>5rLEE@{H(nMJ1@qrtI5s*Fl_i&IcE7(l}05BL*a0ry0QLw|M4La_+
z5w{L`<V8m6vM&S~5*2<EQAo(wetFAUJuL9My}vrVvY&<@nq~;*KMh)TMel3ohc#P}
z$SaM)H@<(-D?}<K&6w-T%NI6{ibN!y5sB##Clpme9~P$h6MXVydX`N_w`A+c0k0HY
z^Bf*}limg*nV!Ya<{5De=l}s-$$eripy*5r5EHeq<t5$vppIT5Dz3M)BbdoI6Czjh
z<3eII|5D_L##a@wx7y7l{i2E1ev52mNCt*s8I)&O2IZ+h-GTU@(9IHaQX3KT6^JQF
zRrFu3Cli|Z!pp$}QjryL04gqZP<~V06M#@)r?$UVfL`F3T^1jFDs9v<zm@FN$Q18l
ztEQ1um`8C2rLefWnxw17RBe`CKB&6{0p7&|jnCi73XNm+F*CjnF#|r!Q8T1F9%O{z
zwXdY~X1JNSa4YP2#1Mrh@(8p=47h@pwS*~AZT$9lDf@;OR7rPGShgUgQ-QIZH8W2x
zSSeRMCD;`~v3aX9iobY1G16Q=vzYX;*a5KksBC58zSNz)Q0id)m0e|V;&}yc=I<e}
zFfiy&9Iv)suf*pv$;0UO*XurX<->aEIC88Fl-)_<K_HdYe;VsM4L7uO{>AA*r}+e|
z?AZd#1>N=qChB@=4B%W4(U%sO)JJ~1T=w0bEHi|-(p;3Wne0mP6aq-CXl6N`R?~}T
zCpSZqG{vfwdhQ(}diqs@4auvxe3dIsc`p<}?;Z=eBFul|B{iu}q8E}-pKPdkVu*`g
z3#-YxgF_B{d$<HSzzmwmooW5#^}lsH=V$HXH_gJsy3+D5M|R@%jtExG+S?zGj%v*(
z?v)Z^6)lBl^vkW-kA?%uQM4woR7`E0oJ3M=+{h+ILx(uWPPi$=_Br7UQl4&wCG<u^
zOiOfPD*>>8^rtzZmD(b5CbeO>h6rzYwdm${=KJi{*0dzE2__M1NDcV*+<aN@HS?z1
zmqx>qipR83&85-XWW}*chlV!qoAc9xZOQt)-+6<>gIT(LZl9&dXnG9e=o&`K;i5k<
zm*|V};Hh_ra#nm43l>q!X33g@v;@v5b3d)UT?2c!`hJ_f{}H}-_67I*4*h-<zV}$Z
z4+mT!Fq0SnhrV^Ze{ujz9(xgz(qcCXg9~xO6HodYvP}h%t~~Lmu&yJ&Bb#wwJxb7Y
z6{Flk<atAB$s{%0qaOyIFoqw$M~08I-$&|3f-(eH+jxI=a{T7}$I}*)F59Q&NY=tT
zr{>v0Xho>(Y|Xd(v%o=Yfa1(P8}&RJW%mD@o16IGm#>oDEzsz8x2;chGB6|ECrQJd
z#Ne_9vqYYMnorEg--F?>-rIQ9zigU6)9KY`Ls*T)_c@$=4xXb3m!B2!<gjUQ8wFWW
ziuZoXZiR*EwXm^JKo&wU66FV<b#yLZ>LM_`AW%$Qh7GcSQ>M4<vu?+Hc{NX`snN9M
zCdTC#WE`)+1>8J7vWC4SoKU20u>K|3Bf>Rp>PwDS&$>WMiT#*pR_3iuB6J{8kx`#}
z!|GpNjEj%yG^3m12UyqYq5Nh=8x^fNvKVPVeJ*wrRADf3-&(JPtckU??T{Cqdg_(E
z?`UXt@rPu#N&Ip{>kS#`&mTyIt+v=QGa$7#c&(w9n+;Udw^wI`N=bP=1bZW&0L=s6
z+z4I`*#z^DE~KHDo3s=t<nNyj-6;zhKoUGO4|&h5TsnHkwFk|KHr-YnXZRQ{H5}ZU
z$1wA!_1SD={rKd(efXn@IW^=VHBBzq-o`5<^{XYN1e^YFIzxYRDP?;}Z1Zm(Up0fa
z9Ob(N3An%61H9H<`!ALgg*B3=3z*}^tA%dSBAab028lsM%UI-M{%74_(38eOp}J(~
zY1;rM2Y$9@%uPEVlb8k{m+K2W%L}%_ylo3M*tD~@(We}v<oUQF-BDaU|KpfIgKV=t
za2Xxl1R=@Gwk6QdwF>dj(@P)^H&PWq2kgjFu}g_nT)Yh4k>(F3R`_f8=Z430jgW12
zvJO_kEh)BW{-KX~1q!Ws%6q0Hil6Phr(B|iK3;D$&R+WxLyu#c6?`mf++NHYWnG-;
zix8M*n&qMd<y-vB$hQHP|M^42x~T4En+1U)QBlmVGlv0;!yX%+k0Lo;(9_Le9Cx~-
z!ikb?owFCsZEUFk@k7AwjbB|N#0ZXnOhf)%fc5NwVCYA&#+R0iGa<;p><qA8E=1W%
zbvJHKRN-@U_-LzB><C1TtHuoQ^H^j^NBQ^){%=NQ-F)DC$Gt7#uZG^geXhJ1iyxt!
zJV*cuxD)sv=7#Gl@Kc+@XL!|S(jt6_sS8%&To|ubNj|lKmB8MC$`yhQzTs)(t4XSh
z1kd9f#`m3>wTGLHCJKugqj5+%v%u=eT5!A(uuZJ1m7*w{BKd-_L_%Q!VE`pq_}Dg@
z?F()<+^GKoY0#rgZGDJ?j^jb_rc@SKWaPjYQ4CNrK!o-E8v(FHiKld+VK_Q+w1I3L
zzAaS%#YcaQKU*r4yX=K>&D>>gl*{KXd!t-Qci9`|qPol8DA(6r_J%99D^EvV6=)Q)
z0p-DnFqBPB|8N#P{7ZJ+<8}`u$f$hN1>r~f^GCCF_-OJ2<q!r7mF)+E=M~Rw!*g|f
z@YSp2&y6LI?|6@IKU?<vWAFK$C(E9H;ywR(XW8>lz2~27Eqnf%|NPSVe(OE|v|_%G
zTvQyw1m<JlxKq5Ez~)B+9D80sc^xxb3&jZElpyU%MfavFWEi>ATq}?t56SLQ2p&46
zS|t|x_AOZ?QZ6N?;TBvw3UAit4^roZgIL1DyqgY)uPF5`9-<u)HDEie`X+kVyVlv8
zR?>&ug<{&<hCg=TkH=`JGJiP+OV!EuN(Do8q*4V7bq%LpEVoMitPE5|)|C<#R4@CY
zsCIf$S+(!1b$E3h#cFREqY~;kLkq|RI)V)WQBI!s+1hAC;d|21&>{)iT5r=K1{{L(
z$zi-MQHWO6JXX*;zCz>p{n|zeB<aqo20?(QGse>eantbneDs+zoRcBf3~FKxzbcog
zmi{cEVEq`3yah23U@izQ0STP(emQ5?P(?ObQB+zKsiNt5+n?p{SEg1`q&y`GsBVG!
z^v4*&>`5fk@gs;?18J7`3TTB6u#v*o3RjCEz}vp7+54YXZ1^m(V#jc#%xU{%{dfpC
zH09*@;cU%<d=eNOaGOWKY4n6#A!*=9P#6hKVus>uO-ze~3Pvo<p}+B(ptA1dLd4Mb
z(wy&VB6s(JD^RA1kNvY1XbcDq&n(F5z++1#7z19Q+KF#_#yEH6A3P|R@Txd|s~^3%
zaR84-V1@uXwNWE(=5JM@ltLpq52KhEzF@yFbuXH@2fXR$51hGIM)8QV)kU$X@CoBn
z7r-L?+@ujSo=2SlIzTl@Uax+$(&i6a!F3E+taPM5&TpC}1B0QclH!6N1VZ$I2{1Rr
z?!*F1JqcW^i<g89!T`fyA0ZbeNZvC}EG2mnlOi%B01~i%A*I1@g@hRH18o7265)Vx
zuMHpEFjNjlh|M-GTILV&Z^VS-vdJd@)L0<|>^vip=23ExUCytNk*yE{c6!)p9UY#x
zI_EZyOVk*_l7Q{cMuQFTW$TnFcOw1Tix?Hs@e$Tp(J{=4VnDKjQB>e!WBi2NFsLD;
zssD-60g+^2aNYeM_m5hgWP59COQd@k6f{&V;ETHtCH5x7>f);R3n-h+&>fNJrog>l
zr47Vf0IJ<4KE&1)CmIl}Jr0lc54c6;rII2d)DGJVKA#k8Bq_;Wn@wjnvD?t}@H2<t
z!IxGqR0!WPf3u|^BY=Eh4~5lG;bx^i0rZW*r_-4g@JyRSS6P}0U?QT<(4x6<IzFTa
zvE(9!aR7gW)mMyaApR17&Mjo*iZ)^jM<;XIu$?ao&^l0F$mH@iE4<VxUJSr0!&ERy
zR>UtdJPbxC>Kif+hH8g<r-*KkUa|5ukTqB&^t%ut6Zkni3Zk%9U+`5Fy{LLzQ{UPi
z>>F!tg6}xZbY_|>IqzWI{?N7Xqs09QeQof&QRjkXTWZ5Q#6lN_F-Pye8qnh5Ui+wZ
zkeo?!(>Hw;er5gvsdDCkeq-*1Xd}ZWm=tG?aBT8*ys{t0AN7prH=a-YUrVU0K112r
zRUU1Sv@i^>%u~!V6yQt#kGVw<qI1-9bb-1Er+Wpy7%Y;C5yeI*De^H@!h#f!7!GyV
zCdSr<MeYdWnQ$L1d@~gubb#W;%#0CCd)P)3k>3DEYiLLc;!Eb^(eM)#V4yN_JXxq)
zm<~sh;c10wD7{p>O#3y6k&k(;g#9|eEL7W&D>6pdxbGFz;VHtgvD^}Md?-9(hG;|#
zdxbLY7vhtIZW3uEwAln_VJo=Wyu?E(a9FLaahlxJP{4Fb+3imrVamE6)NXBK6uSW1
zNvX&dkiZ5u6j|o`SD5AfTK-D;D(vfKBvB*OOB58~Q@Rx}qRl+>zp-y6)mJBqg>gd<
zAOVaGVdk%1WPk)4t?-U#SyAwADM_$M?rNilRD}&pNad1H(bxfCbw7g|qqe{(cyM<v
zfUSL00<HuxCZh337x1&PCf%>fn3YecIC`8j$S$B-jYZb4eKp&wxW-BcvQ)VHYMN!M
ztY_IV4r^e)WgJZMnBR3daFmaDg#BTGgIawpVzVa}zhqt!)Kolh>19D@UoF7~-c97j
zD=mdTQhRU>wQ)Pya8xIbvi@vc4WJy#vDe2Gbg^>Nz2M5t!kN)*aeK>OBvJLKC>n5C
z5a-~(oJ<cJU!a<3ZUnv<%p+IXENtj{-usw*99}^f0u7^2Qf)6EjfMoE=vQ!n`^qr&
zk|$@97egol6pbXoJ=xxBxYgPYRt28oEqMXP3cEcU^tbY1<tJXbJ)_3|K;h?{%U?2~
z!Jh1XGaAi#boloQ@yBsZOcaDa8j95J@Dla)l}rOZion-l7pkqs9jaS<-zL(;HTZkn
z>8>cDSX@{sjM^#;CCz)&vuwaTM8zW>v|eAlNnRB5OIFlhB`-c@x3AC*mQJq<_zS4u
z2UgYVTZ@1>X(*oAXj{YQF7vta8TzWca;9M;mAW=1clWO0Hg^^eox5G(P4faFbp+p1
zJNnL2J9;Ua{`{i~b3_|*KhM}S0mkH7rPWgUxl?$|idNtqX9bSuamc0{UB^gSyxq!v
zd*3WBm<D^-le*c0X3g*{Bfiucp=DE|F3o5kbJ{{`R`wQIh4<u&C>Zwf6^+JKJM%}x
zMg-P0Ed8BN4aXPXHX6~#PPT}6xz&XkH}lHC_rQ7p86mx9O!$S*-3-t0iKm9cXLWt|
z=V0w3?sZ>@)RtjIYX`0UlY^E|Yc`d+L~w>%<^Aky3C_zX&x3sOhko$|WpVF=F9VaR
z$cBfG-g;Oa#HZwi(y6O1kF8d$q~#_W{z5FAB&vlHTG{bv|GFUOeQ}aI*odkU>1FPJ
zzbyDt(ldO#-RPyWiQ#y&fh=dU_RH=!{iN2U&Vok&L5cFQT=-Rn{=b$FeYN5JvAOhL
zwGE%mT$(f;?66{15lf)gvboQ$U89Mnc{wVt=c7;iudzCqIWY1pA80vc{*jIxz!Gng
z{J>SYlN?f?KQSH+|7PBy;J5#*q0&`r*7z*{=EqK~#?oX3I!2J17iRLhACDz{sG8;Z
z38f>hILTQ~<Mw$l8v4hd{TRvr>qP;c^0xoXA0r@y;|3=sbhjj(2wx5vMO?$Oh+9Gl
zPS#J>zA4sf&BW}uM>aMlN%k<3PFmLBYVQHSO%;+g6fq~`u2@8&Kh=M&Nj;kj>|g%x
z{7fNUa-*1mjrvhB?LC6T^<j_Hq23?U2N))wJ$nNG-TwCJmj3V7)|02t9`8K)m+dFp
zJI|gz{dVWEd2ajJ<EP*LOS1LHbiepB2Q1Dc`Iq^n(LCo1o?G(!|IiP{4c?A>AI;H#
z!p>^@BYtksv-k7KEyWtujXJ!uwe^>covrPiX3|MVpHmFg?4;wta5S7u^5g}CB22Si
z!1jN24St3`MigJa!U7bd5ydTGg=pYc7A_P6dCi@BIj2}sh-oh}g4vn_7lUsuhvRfg
z2zy17WAmm`F$bYpF}kA1$l+YM_<A@4qkv(9pNEJTBL0R!J{sjW$O`juf5-*{sPUT3
zc6nS$X>903<w3bZspRe@OpMF?GyEj$2Ei0PD4xBJYzad!Mnj4=&>eH-V>c?(Yj2be
zue0f9)lf{AYEfh;Tq7bj8W{x->Z?Y>@g&kzKkv=2T@>)R|Hy0#;i7@JY&uLwg<E}F
zYEMtZ&hMDZ<H7@DaJQOKQH=LEci-X`K#3v<U&1!>X(0hVa}4j}wa!7g$icj9UgzpR
zTtZ_8`qdQU2*_v(D^cWw*$t3@A}YLG8EoFXI|P!O0!@vHx{5*_m-DynPSQC!Jb%A;
z)=JFZPtQ(%Xdko=lGi_)A6v=($?1=0?Kf}FleZ^F2LM{PcYI*JJw88czrHv>F<;d7
zI_6D8d4}Kij(<#Ae?2{Gbvnt(S<-%Ydek=UnGVkOj?dezPBUpA?;l-&%-Bp!8_Ds>
zd2-Z#*FFb(<w+CzMQFOxo5{&x@~(BZ|JM9-?{)jAef}eMdDuQbhVBkce|w1$hR)mj
z7e{+%$?3(}=}8A$gZUk_JNrj_?RTw%O*015Z_@gqb$p(5-tHOg(Vy<g`{ULbOu(D#
zYi#SNz4!X4MctX%9<<L|`{yt%_qTnsh-Q#ShVh)X_S^86)?Zs@Mtf&JHchk0t4@qW
z`R^CzIrDpRu=j57jhSP8$?BLL+P^q!y@P?D9AbFS#p}*_`~2d(mApAQIlyJ_w9bBL
z??WKQ(Mbmv?xNFbnoiF5pnGV=teW}R{QdPsrw!|ei++4=M8k{I^Y+Pc!|eHcvqEMK
z_RQM{xYj4fIA^n1CucuGyRaCz70u-R+m`v>?D;WI@BC~JmIH#Y_RsZ`rdP9`=W4Ra
zaqG=d`;E~iTJY-$H1xi0q*~g%b_bqmQ|IsZOwSiEecUuNHu|fg<tA=z(mqV~4t{9E
z;OSv#&5%T=&E#Xg?Og1?<<*B{@#x;Ydw&{^d!xBwmNoIs)zo+9KVaVRzq}mg@P+&4
zMR8j^0++_-$5-mx`PeX$zW?2zH=d3Bui)h(?|sT<k?#%ff^W$ftnS1E!}HQ<e;*?+
z-=#1}!tHuqdh{$S<`@O!J!}}%I3vi$b@+Sa#g5@nd%aIyyOa5>10|?V#-rglv-W5#
zOJ$xxy(b;_veB7q2g=VHsr*w`Cx8g<8Vp7hPdEcFY?@q+@=K$J4@T(~MYvpNC?H#O
zqcH>)^j!QQ#uJ?#yoQ|?Txd+cuw8SRZVI1)N|L70oP%b}i^%}$a}38A;3>76Y&R6q
zH5gvarxenKIiX{$eO7?kPYOxHv`lMnWLU3n)$B<Hgqdzsf0B#YkT7~}v62N(Z%7oO
z0*)tGQA7*3@#-Zccig6AIN2TH@Xgm<z&}Tj^>jGhOy1?ijH-tK1UV=pqZ~aLO&7a;
zlM=c))bdKXNrI>|7auZ~Q&51W5HE+YqBFY3vA+cRbG1sSX8kBjr&jZU9ONea3!2Kl
zq#*n4Cbj)hUa&wUbc+`@Z+5c1wYj~yv-x=U+2cQN5!MnJ8Wc6W$%uH5%}rf)rJy6S
zN9Kvk`QWGH)_M2sN$0$KYS<S<mxBF>bCmF*;RK&)pQ<0pH!z_z!L`3_t<m$)Uhowg
z191JiuwEMG31)ekWz+MV+!yd9eAgUKB${D3X*jR<#x|j3g;o}97d=C&pYMWy@0tOZ
zj1=^{PbUpetxw0<jC9*Q(@Nb;QHEyz+Gs-4&8mi6cUkD2Eyip&3mdF`Q|ua^iYodB
z@9GA$_Ns=RRf1|)HpnDk*xH{W&e6D2RD}_Hh>@m6>nj|Azzso8<4+iiZGIi)j1>PL
za|pjjgkExjE0}**bZ#;k-3mWK9@WoA8I|qG?U&|)m}S?S96bzCE5zLj_Zn0VMDCdO
zK3z=--1j47P6{eL!A?rQ=;-f*pEfTtGj!G)=oQoxE^qm)V;7JCLvhBs&f%CuY|BRl
zdH|$m992Ha#!Wjt!vc6{cF7RZ5_3BhzaA7QVpHK-S`Qir7I`x5t`(S}mtJLD_u4h{
z5lZ-hk%@H=jG3Qi=%*!4Z)QBR%>44I%VU9*(-|Ko=mSQei@*)QC=2tc%dgFo?%Bb~
z@zIaJo^+2-j$a?0?0>HurUNWZWX@}lca%a}3p8Xm@4Ms>_7t`bcAW;q*zXjKfq$9e
zE_%=<NRT`MJLu}Po^wx|vYViZ2{j%Fq6EJ!j1<hpVZbi#Ehs){$&w2>1+4~yr;8cv
z$Hx@$6JV;P0`wL<Dn58wLsy#8Uq_x#8*7MOL1eQmgG3_Ua5)KHqv5QHv~CGWf7Y=Q
zyCV{)-+<YG?gW;@N2n?~7*NOHg~tE-)=)ZI1H(jIeltN%K>Y_Q^Z;?;`08fTfdnW_
zLxh{O)S+}_JB>NO02e)CNi}jTrMto1n*CdTiK7bXh;nN=*rJ4?zDP=8S>@dx_)M2R
zi82k!m=p%7M5x#12pDO@1E%%hL0NQ%OQCy758Jo|FXh93BKhSSt7gRB?<$!2*w0WE
zfSgQQ)emurNUy9eC9n~^$oQ7h1BaN`j@y2TUK=Xz@p(99#!Lh^btz^LGH5B1BT=DT
zJ^eruFXI9`X_-YVX+xXXjKr8hDG1))*ktm-031;C%Qb2dU3|d&P-L@*wz^=cm?~GQ
z!DK%X@g$30ir%@QaDVqOa_pB340hA`7}cw!jUi)H4&H;Ehtvj$_jPa+_<qH{k`W11
z49YL~nDM$(V4@-X3GgV^9qv)mHgGm5wc{=`+`E*%fFkrmFkFHcqCUwnapN`_0po+`
za7X3NyUvjZVYUSZe>M}AepS0>Bq$yutECH#H5Hj2j~QyPjz^HU+;6zZA(~s{6j^Bo
z_?xZ+0j!n3N?w3Yf7pK0J!_pFbzkr8e}8oHru(jaOfk!rNyzgr7e4Q<zsemk$JGwU
z%k-{(Lta?eI!MQnJm2?{QX!&GABzM-47ySI$qoovyoxN$0Rd)VE;Q4xzV|56-RwKk
zCmuU<Yrua{LxEd_PdQg0h7LD%3+H$QAVi<eaymo1C|pYvaDO$tN-66XQvx8E42l~G
z>V<CWhKz~>umUQe2_Ac&%&3r(hZJ?04TQ!@m*Bcu0q^4Z1)ar_#V+FqejUSIndvTN
zylTsjEqio)6Jqx)>vSL>>R`d%dXxW3)@UzHJe;tAce&s|eLBKab6Gkn1m2)*S!#aS
zw#2uD661(-8%53*nW|vR4tHLa{D4a5Lfpg-*_NXlptT?njebIGwQ|W^p)adfjB{ds
zR7_SGA_f`R)p6%|UTh_I!xEi^ns;mxUar`QWE}&dxM&VUYJ>@nq!&Q+l#3gzoDxL9
zV4VmN2F`8DYi~G(0<Z4&hqQN;1OaOvqMmVA*oI}e1LCyGJ#L<xS{H{|awEo*i=<|b
zL5+)y4^b#KOr}T7Z8W@A;v|JUsVU-2XyRadqeEB8iZ`kbp)a>fORs1#UBh1a3`Sdz
zwD_>1m*%9&Z7ty+T#T6?_6JwVMyluS+e233LonZs$OtCUaV_G3;q$*Ox&`f9uU44M
zV$NIj{&OK~N&aN2XYC)Q*MR+w^^yHOvS+eU3Rdwy3m4MW#eP2pI|11uD;PtAy|n2k
za~W%pC&r0D3n-|#0Q|6w&Ac~UigUdJEPdoGqY*?c9i1G%K?@^DQfz-@_QZVMGAIqx
z?Z*xQp1y={b=$}1`keC_9PQ9V>e#JV%J3hJCQ6NsQY`2MUo0e2w`5&llBtL!bz!HP
zgew+)(xmhK+dc6z9J&YLKN9c8c3r-DWTF6HkD3=WFZUA5T4*Ao+l2fA9!iIp8ef59
zqDUSj`$z58@i|Gl=3%h)xcamTEx)QeL`^|k$W1!LiwWrM^_$M#4=uzTf}*VPA;4e2
zPL1+%=g7QZC<8zp-tV=~yVL}Hb9P=D5&zTD`l&@8qnpOouYnPua6y)~iLQ!Lp{J#g
zA_s^QCDo7WkP8-ybF3iDgE_^!oLeXNw;cs&N9Y2-yhXj3wzcr=rK(Pj8rVHbq(^nO
z&9yh9BOuoWR*r}A=<~}Bnzy-NXXq+J8ztxdsSbed(2r0YPV;N>r**JH!yTOZ6?q=z
zIQEuN`SheeG;7tDS{mz+m_R>3l%NnVymkx`9qS|J_V7&`{5_+gO5td_n{)vK5dv+O
z7ln!(%<>5%#M34<g?IoJ3w8`J&CrepIm}iLLH!li0hqo>EWD8v$^bh_ZHfW9sdrRb
za;SLg!+u5>B5`{~drZE;o0K6$Xj2V$khao3p!!IiI@GUqL+u06;CWniMkbk2Bw?W~
zCj5wg-<EV`GP0eBBnm&!EmbtUL+#yWAHgDERaH*`wmU_z5WrOQ`PA~U^vU`Q;0yBU
zZORm^AJlGWY)~;v8suDRJwz)Yr4hf!Zp6?PoGV72sJQuA<+)#vbY@m)3&yd?;HT;V
zfd@P3w2oT)=N4WCB5yDYot>d2I5D*h)NMBEUqa7xRQ1hChZd?3^=7^6zMors2&HLI
zdp~$xSfOV!%{FX0xj(d0awv5Og-vnN{LdE<(Q$s#?Y!MPYaMi{jqd)tgH9>0LIwtR
zFong^S3glx3Q4yT?3JGEI^jY-?uVtq120?{73>CARg$SB)p>#SF7>4RU~PTpZ_~ex
z|MeOCNlS$P{-zKA`KEwBBgv3%QcYr>I!fNp>IGdH4tqde77;Qe?trvB{d~E2Xjdyp
zU`GlkL`fo6uRl0JXQ&VI32HtVX<!ag`|2ayLbzkHFS9y4Qp)=90zKgA@y08}nuuh-
z+^>|)C`=><?gbwk*^Q4i^^_x9pbp3jb3T6kHF3wK@__ghtW!P1-gFT%%?E@HC{||y
z)f9`V5S9=vZhX6p<(ASV()kzv8h`ls!}BOPVtom70gOIz=`TVk^x?@(YZQ&JzUHf@
z`XrmD9&XD?hO%!P+f5Woo_h_M*B)+DXv1`^{L>EoG*&-V2>9j=5b+;A)+8P#^HmmC
zK!dhn$E<M#^`jhsY3M9`?@Xj9sw?xK4G3ifKtyD7D_imw8rcbjB7AOwK>#!kwC5;c
z^<OtP_s@<FlSz6z%8hh7(iU8548f9kO9zlzpWqvT_s?zQzpnXbX_d{S)e5uis<(8>
zwywCf%O6*4FJ9`Rx|fGI^yZGoGU(5R$5lxL_M|Lgo~tp=RhZ^o8Kx&;0Ku|sWi?B!
zQ<8X(Fri83$K!p&Y>+h-PSMilet7*q=Gh$KpAyD~Gm?rN2=Ky<%8i0JGs<R0K5OdM
zK>V4y0@iREZpS@$sz~s41^akX5k?kcVPQTn-5JcEyhVc312Hw@TkZaklpFSyrkqAf
z#%cD)hJa)gASTWM<m5>m^_rj2#R8oGQb4W0m+`lv+$(zVLE4_1h$8&ov}YA{R|hTN
zT%a(Kt8C``TW=tCXa?-75NJTuYB2-J?uEXpjPf<hd--UW4EZ?}%t5QbB+EWo`Q~2W
zK-TI`@iD()(U*7^xvm5T3c(;*-&;?v=HMc|fx&+oqON3C_=+5^1mNYYXwdKxRN$D!
zJSI!@mq1BzZqWW5#sf!rN9rFeGo!wcm)u6WRu;UdR65ja2g<e2uKOHYa$Lv`6K%=d
zU8S}9;Q|-yh8=Vx`9{WFZO*kyRF7f40xyLCuK;bWam#D8)lQ>>TygVLkSOk0sEkP4
z4DF1qgTOm2^+hu@YtT@;lYHmDy6nwec~kKaH-1Cv5K@bSZpQo*;EO1GB7`zxc7M-7
z;4Ud)T0p)9_<wL&cN0NL{XCqRW968@a6HJB{bWAwXH!IBqk~1^Z%W6d!5^6ebad2x
zzjt<w$f<O+oUCd(<h)0if_M=nSD3!42>BqppR(1VrHDpTZ4|mkK;`g-Gsh7ysSS(o
z0kSm2#8;cyN@h9V>_%QYhz1qYx%s;y!X?%=Yu}aCciZyOtT=)f6<MauVORnh=PL80
zeNtN6!LWeTM@~Z;4(eOJwP;Hp5mta}-~2M)tu=Y{&;4tMr>1TndM+wG+Xj1Pvxf!#
z6M|&n3QE39=x^q9tZlAEp(^Elqg4C2+IQ4=F-F&$&wo!TOx}~5`xNd>zPd|OaBlyA
zTHobHjLN5luBl9<dd<Jw!A6Wzhy)5qQw=a7-RCbs?Es)`A2(-JGqYs`kPi(U(PH`5
zYY%O~TdFO8-8cW`7YK?7BDo-ZbM~1x;0iEpuZ?2TPjBlFW}h{Jnb(0c{qWb#+Bc*A
z<~Li<Mu4h7KC0R0&DrN}k@dWP8-65;D+jm--khV0J&$OX^!w8{Ms1s?A56ENbxXl%
zl>4|iZvVC0Iobcdb$-{r=Hua)-ERulpWHw217#0YMfk4Lyw|eXk9{Oa$UtcK>%E45
zrdQI*5%f&TwXW)kTw%CL?QgK@f2$crMH}oDg<WFN3>(MmT$-*EWaMhKY1yY)Rgv~L
zZy|mL^D!)w<Y`om2kYF*#+V)1_N-A0pC*gujypGS{;Ex@{GKRFip^Ty^R<kY8}M1J
zJY<c0{8W=h>dn(L%-P>b(l`_&4YBjJ-dbFX5g`Vhsi-GWDlNr@S}d|Pa?Px%n9_`t
zkkE$f#8R0;<oeQ#+&)iTSn0xk|Fe-lJ`E>L<+=CdG6bP81pm`1sM#M9?$1oqDCw9N
z4ejnG-;73ma~imt=L;`h7s!Eb8x`!csAry@b#_4mTw<{d-4;l*D>V$licG{maw~;q
zSG0a;)vDFoHmkTw({J5Mtll=S{VMJ6L&_%B+UsXuR__6n7*(*CD_mi={WY8>)UHt(
zSD~SO$|ZHmfgwtW%;3<Ps%2VX79G>l1SMpqQD|BX@Dy<#f0mP%kFd-b46vC<{Q?`I
zYqSE9o2x>E;7vP?pRrItm7Z+ZvQj79ShR&ogI*F5wQzyj7@KD{Wl$p3<Y%=|obDU!
zq=ae~V3-k*{1R*P7v$&UA?-r)%?i4|voI2ug&sGPj(Esp!HX(S#%`D4TQkd{(G)nl
zF)E?q%moJ~f~BxG&5L3K@yXMv^N}nyssM?8k`%_J92E33P@c)CXjj{v%V;d*?=njK
z3?_*?nj?M&V}x&rSU5F%uQtM&l?@UWB&!byS*{94%y{+?t|@6kwNYiz_*t7X;7`63
zR@uMb!lY(qL1aDvln(H%OnDRWiBqvaUsLQW1r1?FAm8_5)u$MHXj)+MfqXIai^`b}
zudlQI&<IOlEFOq8!o0<iSuTyu&@BfsaQJ-oCF{*m$^ervr9bkR>`*v>DUc<MtbGb*
z@irOMPjJGXRnuR;a_pll8+wA%<k09&XDwV6ci0?X=ur$cg6a?En5iJBJHuZnWu61N
z{Nh8D6XWEr0R=Ze3ux6hy|@x5P;x+EYPK6@Ln)EJ>73&nr9;w^t$NZdNpUnq#yWvK
zICvfcUR+{725{Vn8w9g2u#O@}o9N;p+>T0y1q^^9{fvp}yuJ0y+oV6|A@F&Zk&-(^
znn8BgXi7-U70102whoi70&qbxgm-ruHb&MDX#)SCB+HIC)ldiawT=&TP7*H(kR#NJ
znO{Ss4*}u~IBBs^13-iT9KhoS1F)5cfaWU9jM~Vqp@gr*H{j^dVN&GWIVDcqNFa^N
zZt(_yJ3@mbAG^xh1@gw#f_vo>2$L|;1heKC(#t9TP1_e;X%F^vl#VV?FJ&wm5`~ud
z3<KHf34`B<&oicANs8K(nS*v;-J`&?D+D&MC0Qh-32m0VX*Q2ob=83bgyu=J^oQo$
zoZ-Rq5j3i`28&9tz4PY}&J@EYJ(jeg38RTZyIuCsNr1G7bI<jYDw?!1nAFgmjqH9;
z_w-ecTbMhd%h)OCD1adR1kY|*SW$ptE+t+R&VdT9Fl}yZduHPS(Wxa!X(vLL%;;iK
zf_`MV7tOJ;t)wiB*ex=QsvD}C#`Cd4;TGESd4W=qwdQipn7)!c8}9u&FMMDZIz4N3
z@gnooY1&&5eJTMA9x87CO@SAFMPQTrsEc^mZ(5~Men!hxJ{}YDH;)&gCzM?itN3^}
zbNPU4fQ(0o=2jPA82t?2XoyT%_S1V$oO~bmFo2<b#JQus2w<;$!jL!Y^z+d0D7f(M
z=?G2`6ezz=)M+495J`t=<W>}pbTSskq6gWeJO2ivOmSMtuyDc#x?wW9U`RHx7K?c?
z2gDn95nI+l13jPKp3;!c!V#4LOdRhZ79g2a^e;a$cwGq+!%Fb@Rk#kQaablJes`O*
z{)wWvl`Qrq$FnWcgB&1mK2sSI$ku1K3N!mLglGtk10+YA6`f6Q36=+lK^hq%CrH8m
z48b@M7z_alDP#DgmpR&lyn|`3Zo%mW-%*G&uK?p8cuOnzD?-EsMUSAapj>xhhF#iN
z<@qhAJhu<%-Umb+B2XJfY{QrB8s4PiaeA5g9QE@srGxODgmnk)6GQHMoj|;@tv%<&
zw@7$%In)>fu5;@W3F|T)=aPnQ1D8qX%K;r?h?hEv-TpWWiaKZ?Y+Fvx$!zU|9TMWr
zUy_gc4bp=z!IKRyb+WEX_LHqv@V(v<X!?v1yd}y+u-Z#Tuu~X5-YIm6R|Vi-^|=B5
zwGpECpc;fHv-Vxh`cp4&y_?A9KjIykme`19>E5s*X3TK#weQwqK*C?MLh@O8p?ov=
zf0i54x-Jy>+;25&r&ZjU@)itRo)|%HH>pLhzuK99BCdzUbviQ|LR}22#H!#P0JnED
zxxTGxDj-@UZ-nd>tl&n)9lU5&N{i%Qo0V|qf1kC&OEK$PMFtDH0_noqf!qwz2H{k+
zIi&!krHc0GXtG7Zzn&JIi(my7J9nb%aOe(&-1Kykcngi(6xk}ZzdmSK+{aVF@#!HY
zJqrR3BO0Oo&M6LHO)EZe?A~{Np^=DXMzI=?)4ZrOk5;|$DsG8_R~{}jWQS}kwgcYU
z)-J|Uz|t4Bd@#3fNO2ee^buIBdB*mjipXZjkjz|-&02H8ruifnNV{=1T{g6ovnwJo
zG$l%^y-%lOG=ZzhLFrDEMo4z0D)Uxi63h1$y6(8}qRLPz3t5Y2|Meu>c1hzRI#5BV
zuo@|sUWB-3Z(Dce7T+eDhqd^m6zV2rAyaD}p~uZl+8$$z7<fi+v7JRk4qCQ{fIZqi
zzG%s-j~iqP(`W#A(CSt-aArmJ_cao2m$H|q_2B>dQdBimlb_44RSNXU@lpHOf2?bU
z(nZ8KYs&`LJ$&OoH<{16IihQt|G-<$pbD<ny?!4;G|toE$j?%0N_>OPzG46cjhaYi
ztHPmO+~Q86fZ^%%vY=q%v1ys<jHU8f3JCqL=e95{S5X9PJBUUgHQEAcNMnSRf<`RJ
z+QV3Ev=EVej|D)*<KxL~7D=#|PEw;f({k_co$it9ymMF8S?DH_WS~I2sfebyOVik{
z=h^nP>)xuGb*NSM%1&3(m0eF(=`%xJ<gji=IO9S#zCg0Dnlv1=Zwf1AY~qQ8iw$@+
zJ0KNb_kHwyI^ogH;A&pL;l1bV<fDxLkycM`1d&U;p#_^}$yjN=J9wR7;qAb7WUW4E
zvvQ^?$EP8$0BopascI^G8McCvX;B)Y>`|_Wm?=YsAWMbNr?DXVX=Z4p`1mHzITn(F
zD3mMla5(jJb=C|4k82Jl6~Gg6DieJR?{shhTJUTAtaZ@tygNC#IBInfR~wVz+xvT6
z0PKF#T4aCH?{+R;$6jatxu_Km5i41X1kbQXHH%%UYZH`Kr6K98&wJrLxT_c`(uJp7
zku02F3uY652zdmByjQl>8WHKP7v%jLOdz0U@dr?=c}VBtDU~)5JzpYV6@`h3g(#Ma
zYkpM7#%Lo+$Hl;foPt~-fN+E}qXGf4QF^QVv@>?GT<6!CCVcxHd!NV)QDtX`ECMKu
zz_`Cn-xUB62u9FDha2A>Gk`OL3W^iv9Qjx-G6ZCnLJ9zqmZHpTtN4oBuINpN699_n
zeMH$BfxR;8v$H@8f{zc&YStL87n>Zy$a<H<8QS&$6+OMi7@*O}on*+kn536Osum25
zX)jI@q~w@3X_avKr-IR3XvbL4T+mxFp8)RdCZL9b7i30C4cLIxwFt&eaH-1#JI<X~
zu)&f<OUr&``;_nQE!x&}=fg4iq!49-cvTbhDKiZt`|*xmD+eJvddN*U&>mIvzF0Sn
zAvo=dDR|?twUkSwb6bc2JIyh+gu4@NDHS6)u9|0Jq=Q3?>vl9xnK+PcJTfVbPlOSf
z1&z=Z2Z5tdAnySZ72B{GKiPq;UDz6Sv4z)H1$lzhm5k`<Oo19=me5X}^_5OYmrsZv
z836|gAP2j++7BKibs=d_Vrrcns_<$rz}Jrft`rAq9U&TZ;+-->gWL6$Yk%P1Su0Ax
zzZA7(H>trCYL>P4FFR(TKo>}+#ju&In?J32n*MH<z&v)!KnL=8{ek(_UHB(s!uaC`
z*U8hz4KVNp+$k0(!5Q=={KcF>D5-&bZG${Z8~sZkrv=*!!(hF6Hv)l%0dIL+=Q-Wl
z9a<1+&`EnGxa_cn*Veghb^88g*Mbv!4VIy@qiG>=p1$ib_#tX*%E0v5Nb;Z^Hdzyq
zOUJ*U>}_Z+J&2|QeRnemDWvHsZ&9e9;-Sm>EWY^{5k)P*^+L-Jfj+Y}*hGp+aK1aZ
zA<SVfRSckD0>qnU9BKsCcCZm}^}A-YNGYPER5aKY{xUF%{hUncea`z(E+pm2xKX~3
zOGe5EtDPGMkuD9d&j37Nn;#CeTM`jhGqk-R`Z7%l7l&{=jgWe7wfezuocVNZ0hf`{
zVIqNdm=z?4p*AxbWI#xEg`@aIH4>B?mUb0XLE2KeEfp4c<YJY}Mx?G#IjOiInoPQM
zjc9kS+&NsS*-NA%*yxgOU4m253m4SkyUSVQ#n1;s=f!wtfPVzSLpgq6DH>J8Y+VjQ
zKu9fW;`roPm1GUxVgLEd<o}e-GWr8EKFCIJp9QNl3iICK<CjFFh>W;7Teb<e#k0LJ
zyAvZ-Sdq3g31?c`KRW5Ox_gJ`tuxezeylWphq}L(5Ip9HS^=HVq1>{~s=KCPV_h)V
zOS2C?ZYt<Y+)O9-nuH$}qeVbnV(p$G+q(;OfaU*qdZrCo8t}7#tmG393T#w+LxP=m
zqOKNhRS6eT_<*6&>gaeaa{*WmXl;Rg3#bY<o*|0);)(<-F1XPUrHw4b)NQfg4rzEx
zg^y!-A{@G;2nXcNnkERDpaA%BA3=>kmojeFai5+kM@*RJhF4>(6o@MLz#RcxmmDj~
zNj}Rpip8EuG6>{Bnkj=}?SIUApIjLuh^++90eJt`W`>SyG09l-j)N=1FcR6A%d7|H
zhty)JLEXR5T#998UnP&}x>i+dIhtXMQ=DpOBCBD3pe3o;3y<Xm8GLQA14u5lq;?q2
z)}s5_iw<(oLUUg|0NQN?K`MbG=f3B<0YtU%n1(fPlNu4x;a>ab1gf7A^S<OjQ`{4_
zu-&1wc&SXVKkBA$XAZ}x&c(&poO`a<6{2VLZBXh<GipxQ1I3361}Si?Uij`ZFCBbp
zT(;pIRHG-!v7gjSWQ$T2JG^N;<$+?lc<INe3wP-TF|D9MjM&aKyK?(gTcp3LWSJED
zXN2g)DW%pe32}ZO$)2`0CCL;`Qm_zZASYR)E?p%6>UYwW3FzG}6}I0vKA}}VY9D{k
zC1FUX#@=<m<+Q8t`ajDC;Qir9aNI4OY$5QM;J+uSc>IYAm#TDp_^gYPk$(b9=RyR-
z0GiLPfD-JCzH!{zKW`oUo~0OL?N*e#C1u{w0S#pN($K{rN8RZ3b6uT+CV=L6F+RFP
z8-xqeq7ffL(h+R1Ff}P&vrTPB2J^gc-DM})G`oT#SyN{eb(ivGHoM7qd@OrPTvU%T
z#iTJ9Duq?}YAn<fKx_rH`-v?t3VujadYcxfG<{UmvI0EGi?%Gdn1RT+rZ{bowd7(D
z{gPdZ+MLAw{|yF8kUScwdFlpP=nxlD0INgjwANaqcWHYPhxJvrq2enZ&Vq6QJpXhl
z!c(VONF19q#WaXW5};@nD};eILO&ADn@@%K-{m(QF#Lkp=Bwldxe;Ck&vtaG22@>>
zDl<1qBGJBdTuNFav@clpF$neKz<uS_-x4ZZMPvyrZ7T%LHk<?+3+LDbmPN)3CW>zU
z>EXlp#e$B+h*L@Ma{UVS(R}pPVsX89K(&)dd$hmPL123cu75#sSr{5gtMA|M>#~E)
z*=yg`nu)j{BhiL_jA6MgoI6DC&Zm={N;HgJXaU*-N0&P4r;MH#iCgq{H4?j6xn<dO
zs`u=-xV4jXWLLt{%oG;Sn!);6iubJz&l!bk#yvHGyc~8bNLopKH2efVL5X|AU6T!h
zwrOk{RV}?z_lRy#F>o>`W?v?diiOD#1fK)fD%kImz5VYIQ3X8eJ_KkahQ+2Eg!kfM
zluMP;C+u<qF~B<8do@TBODTnBA<8+p-E_J0zSTY_>Fgt?53!4y5OqMLAUWn^;GA+X
z%qn<fL6}ZSt$!YhHsVwP@wYqcO}gV8outmD30#e_d(L~4<NN@AmdK6<^9XbOPKStM
z4UNlf5e~6`iPZ$9Sli<0qvf$cR{M;iq-#Xdhzzi>;LP?i2<EWX65-G(1Wb7W)rX=t
z1xcRH-3XEg6Dk}S)L9B5+Tr%0(y<&Kt|BaKm^#WIx{(P~e&ncj|DYg^DWi0|uaz$B
z$@_K3`?;!SU8y2TT&D51gc|E(05V*+@t9iqEDuIrm=6?Y1jU1p9h2DK>$H;XT{+2E
zm)YjUHA@bcn8MIAGJL-aI9_-ezil5KbkBc0Z9z2!9aXMe3jQnRxvqNcpxyaC5<!3R
z3GiB7vS-0Twraea$q~APdSaoGr1q;k_s9nLSYVWICd18aGg|tT69FlX(<fmk<7@d|
zg$9xKVfy;S4lNy#NR+4yo4!N92XB&ZedIFv_763-MvScbXJ?J(!2`!3G+k7E%-t!v
zlBCm8@M0(>_$D&4N2>EvE>&hJ?+zATNVARPHdLnX`Gr7q28eyNY%26#3eq9qb7^?M
zr&!=FC@r~7Znl}lv~EboM0Ybv?*XF*usjYS(Zr~uOoF^)Ox&3cudcFb=Bb%{>`VD2
zhDIRTpcJObE9Sn#3#9yQq>SrnHicM~ral&M##qO$I!ahMJfIqVEH_>9H9DU;f(36A
z)R8|50Q6?qj;-E_4>}xJsZByZLRwCg2JbH=18kT~c_*kPOHG?*JdbjDc5!n-Qt%39
z!P<KzyD>0Q5b#l3X44}r$z1DA9cu<cp~Wc1@_TZjgylfo`pcH<{VuI^bQ)wpvWLb6
zKXTl6NZoqcdT`N6`&Z-6;;Ye%Z*%2z9c<hk??`Xf%dbjCpDSOM=k5-}@C<Clf+B!6
zNmnC;Y}1i5O2`a@1U;StubHKkke*EquwJ$2x&fX1?GzFJ28?g9w}n*F$6xDJHr3n8
z$GdJ>#<|*7CqDT57sUN649r>(&<^2Q;T~5u)(sSr(&0Pcr@gDvZ84x*ki5yT*HKde
zy|zC^gOl|mN(LeYjt*yqgx`d102DMOcoiNYV1Zj_Wk{#f;pcKy?dX1^qE*^QS(=qu
zQ&5pvaUpkbDP)MIhGkx5NyBOK05$;1qEG%p2=U1b&$=Fty}YwE3L5PVgYu$6JogO&
z@AYP8Ird?jPU#@lOBW@sPi07<M`XVzpD?OG)Q<D$dI7hPJNNY)DD}?uDGAOCx40rt
zup<5i3Cs_G!6}3$9{f|x$qXkXHj)?l1loF)yg&){Rr!m}O;_F2`jwqE%n6@f5i*WQ
zj@BWw{F7piZKN%Pc8Lu%Fe;b($NH*n5Vn4n8^cu@PKKh89R`gZyo9bYzl6$nnM4#r
zBY+Ns>tZ2%Hc<G_Ad77SpLzj*zM`LolZ~|BM@*C#!wG)*p7Ylv*b3h?4{|xVsjUg=
z()s#$S5h6arpCBYMq(^|+Ur5=H{iTL%a*4V;tm;3RhQ6L!MGsMSo`?!gxwFDc5cXi
zUu5~<SCo-<N>eC{$!f5;VdmvsS;8VQ+<T*#-Hs^CQR44??xZ#fTcEC0BV<PZyn~D3
z;Jgc$@0Pp}OT1C~U%B}}#+b9{uiHhYFgLH%*~~+e)8|cqfJl>2lnlWgc``_+u0un7
zrce0$#Tf0JENss&olX}TmR*L-*O2Z8gfMM@b(<hLxO!tja8BcNQhdy3%QQp_$P5R#
zGD3v$j;#g523C9nG36nMCWyKSV1#%hoJ3HNxBAj7Ouz4nAV|7`uI0<O$b>OY5M3`f
z$F!K_<U2z~6)l8;Za9W{HBvuU`??*^(l6O`y3{4g_X`(7p%H8lO4=kHI-S~L|85iZ
zFE0nc|GwM_-7zs2jsWY{e4bJ(U2FtoVt$ImYYAY-BCw91A8vn$Ut15LRg2w0&Y-da
z9tL>8$6lv)@Ll9*FL|K$Hge+p!ZmQrvpj!@@PHqcKM1Cz&{_0~2pq9_0l)^2Tj$-k
zC!KSw7j@J+j!6w(Rwcb?gEhRb%Mpy;?*vEOpHJ$Mrz?dFk8Te!b{w3@_O@2{3S<8v
z<5-Nx;MKC6<v9}3Zt~49oOB3Do@${YGmGtd33g!VzQUDJ-chiEQM8$NrGR^kIeeZo
z%8SKliOYtuzJ)fLHFF)+A_VO#9KXH{G!B2xi|6V3qKoUU-BHHw-Or1;XQIpM`N2Z}
zC9qr<<6XY{N<#ditFU|zCT%hqmr8h<t0S92^&51<+G11C&KPm+tlh|iIGPt_1t>&?
zixu6g3`cB4iCVK!pOt#s+)N$_`oY~;CDx!8Oa+|-4*<(CV$lx-aCNb#7NycF%4oB^
zhN)ap`OC9PnXQIAGz59{cheb1DLLQ83lVfLQ=ScMtYfZY*a|8OAca}P4{nXnOH-;I
z0x}V5#t_WYprnqHO%q(E90J4jl%Nfq-TvtXQlC-hO(*7Ta|tNVV@=KAEQrKGzL3P6
zqGbC-L&zFRBp*|8R=}jMax?+Vt&(FaPDzY$B>dp=N}Mr$@T}Cu|B*_{CoBvA0-Gfs
z_C6I2%9Wgt%ch0@n41UK@=aS&=hDJ(lEZ3fXfH6sjynlfGQ9;J<%NEP2&Kb7_t{Ez
zU?v|%cJj4cfd#RodrF)x_i7qK>+lISRu3aWIU}AC*MwE|bH1G@8#o=`V)?N9;nI~t
zVOQklq&O^Q=x<u*nx|`}S3*#YS_qFo?oH{?#!x*XJ06W-q%ZwIbwinZy-(qmeeD8>
z7E@XRy#j{lHo!Yz*8r|FT|7*%X{{RMjcxr-N|AmO?;9{EW6KtVL@%G&!87ohf4wZe
z)!c4AkWK=beC2z_4e}-AEJp$-w3{U&==35fMe$dbM=d*9_F`;qgZv82*L}C2q+9LA
zai_QhNkAz}L(kox76#nvfcdA2DqV&r6uwOhv2o}=QeLqV+Ab71#jJEj+MQZ64&QxV
zif34dvJ?Z!AlWYW5U*f+85RQOqv2&;nRy#y%eH~`jQAFnA4G<QhAbeAeVenVjIb^$
zF_jecA+=#qK?2)Ek~lmZb^_9PBme~fjihS95SvMTutR}?KIPzRK~PSJf79x3`XGvK
z<F3<NvI*KP;Zae3mNkjllAx*tr|y6ZwI2!oTJlr{mN|a?*ig^8xh!scK(m~*FNP{W
zXdiBj;<TnjV(APa$TtIO#5k`RSVnp<WVExT7Owi8GMP}@h&+W@B_wujaOa3>fx7@p
zBQpbi!{0hdyoGewQn0iFHufu^GW!%T0FG!LS}ZBOzfT&;#iXCwVzX>!t3haq-K3hc
zMTK{?4)c)vVF_@v#+_1+F2a=3k1dd^$wox$JxGBCV#%)g%t6nnFpGr&5*67(QMkDM
zSe9)F6_*yirIkb&EJ?c}eh?RUb1ZckjInP-li9-<JJ}4uod`H%>LDm2!617+&#Cps
z9a4iGbe{Et2M0lUO{j3LED7B<$fYn^-~2hw<MUl%s?``n@az9=5JOdjTI&R<0wGyi
zSb`OD5-b7IMg5+*SK`CoPqOJS??V(RVe@c4JUi_1vXx@SSXft5?IB$-om15ZKYnct
zFI$_L;0`Jvf^{n}LSYLtfC3Gly=>DtPSFW0jTH6;^)Q$9MDA`iOmj0qR37^VJ`ZzX
zx8~$#(-~AwpX6qoL&BTk@6gpU{ya2mer-!>uo)j#!Zdwh1myD^c81*^g;z_%#i2zJ
z7&zY)Gzs!y!X;}%OlcF>7oZp*&I61WDj5u^sx;ycyDVuPjlXV30S|JH9bL*;##shd
zh1Q@Of}TMxFe`y|=jom{>Lp@Dj7jgc08wi8fU8eEOIrXV<hrrteDIGUfm*-;#=zkm
z_Y;P1sZE-R6CDbPUVOHPZ(0VAP;7A#e8g52!?JytQ*-J_Qp&B?G3~Xo<;psuUl(_Y
z#XPgo6e|yG`%nKP<1xP~=RFqLc-OGXuV|uU-s`@;IQo7WWVBt_Kv9JcMN@Jpni%^e
zT2efgB9oOg;TZG+EFtw+T6-#U3X@5S%kskGG^5}=4~k3FemAyb{+boZ-wtEtD2_AW
zo+2sRt3+%K1Em2KRsI)5+*cfb1MQG<Da1f9F0Z<CkVrqpR$^(GhZNKWf$Fu9bQsH`
zuB60uOu&%xDFGM+{AMoT)9LWDS<ZuWmewg>gPxYM2d8Hz=O^9v$?J<l@S<@Egn~;e
zk3syJ0mx)n5aBh4dpHO)yRJ<xV?;Xb1k^?l;L^eck_ghjaMB>9sE2`PE_}ml$8dB|
z&pC?Kh=8JZNMjB;h^^P)7peX03o07+3L#7Vn0<FXr58<|vIxAW3~UP0Zsf%#d*5Ph
z2Fd)c-Pn2Xi2H}u+3S-|EQcLO!zezo8L$y{xloG2)vYkdFrgf!#f%eOflLDWTp&He
zCvLBSPddx5hds#VvwR<ttHzm8*HG{5qT8}*S6OG1^ouD-)v?8FTGHIu4%T(S4wS+f
zxEpi{$6g5Hhs#eSln+!gHV;U+H3Hz(N4qgpTX0#%WR>wNknijW(DB3e4^fAvXe5v`
z2n2yg#T&o~iYn?^Lv~iv`*%JVG&`-<_vVT^=e4ltz|djoZNT{rSc<Ai&F{WgRG8H&
zgJ<C1@Ch4K;6>yt9nda+m((U8ETSCPIynUFy+24lMAu?9Ur=brjq>RhJsQ*_5C`bM
zp-uSY_;?Y9K=oq9*ub*Yg3s?g{2@@2UZjwcl7}ztDW~VYmN^7Wn_72C7xW#L(Dj7d
zyvRa=)!fGaMWrdqLM<|UC{-Fhfu&0?+i$iAB<i-9K8m|1HpCK)o4fKI9^4FVqhcKa
zy|F*XL=g}WC&P(@#Z@|F|MJxQqUW%0nx=vD>nzn(2^grwz!z`R!dnI+nJ6K|R*mdL
zYQ63zxoB(N$dIkgh^9q!RzD|m!E$uR^J{3O=yG`f#)dWK*!(t1<tE28Hb>rPfHJng
zwlw^F%A3Y@oXQ!1l^vJvAXMEl%3(b;atm39xS4F!EKLPCZ!_6zb<bLR2YauNT20wn
z;F-M6>}fKcnFj;wn_HjLbUf_U*^guXO{O+vBN#G|C|Hs1Nx&j2SFOYkgv9r`cH!8C
zC2(vC6RS07N~vE<`$EP|^xsRItTp{1I#l7TgXvW|951BwW#mn>+$+p~XQe#^+qmK8
zueQF5WI-qP8Q+roqqOAEKNKnn@8$)zz1SJxX+SmFpe1`xVT()es+SdaRZNb769$NC
zMoDMHsn*_`z4mcsy36mn)RtaotKRb^;Mk?N8GL?^xEsCIUQ}&j)E=^kFD{HDQhQ~?
zaxjerUf%R&R&6I=e53FgSi%gNswU}LVY?<aBm4j(RshvjuD9T*E6yh;Jta<hl;@LV
zJ(Is;iQdGBstLZnPDdGzEd64}^hwtC;`pM|I;i7U&-FL%CI5Tdi#qv3cjWKK_OcP2
zg5cD@On!j^v3ai^m#Y`@t?=%7`EpA#zzAikzFii?%lv|c{Xsv@nVLy_XqKoentf5$
z#o%!i&4I-*pZN9H#C`St<l^Yy_0h@xiop|c&f*frpd>3_LQNvM1^lL1>Sclt29OV5
zZaq(ik>e{{Vt#%2FlGb`FDQk7E^S}~KMg;WZBAB5E3Xc>jlfNjc;`FaXx?-en+Dt_
zl*b=co`3WH^=UX78TA#z$(9Bs-CK$5Vm1K7pCE{EL!>&WX9@-@&>8yWxGIDtG9$Z~
zlr58Kc7RaTUnk1_4q94bJpQktD_*7$U+TB7KcpB=3F~Id>5!cGjk4iV(8heSiH8+O
z5Q_)AaiJ&nRdfOkhT|bt(%^oew2F&H!=zG<mWHg!bbw~I?8|VrnfNQf&@d{$p94n=
z)fA+`z{_B>8O|^~<2s#w@+96=;%J)=CDnDp#m8-sYY7R5Dq@ugnRVhYvl<426cNpz
zk3AS@%kWurI_3QAjfS5y{|J2*#s6pNc$P&oobT73fd%yMXg^rmuVJWPqZq`$tuQ|6
zj=tUqC7(MT+?%hoQR&TFYO9jZ3b&G*z=}6hdB?+Fek*-r_{^R~*@sX=<V?e{!uI4y
zwPCSTO|qjd*}lR{s4^+Z#zCXZ4c_Z`#=x3wd`+@MDPN(yBA8FI<`Lf-p$kvbnJvNN
zT7btPxOa+%=@L(>m|*-s!{_(tT;)x()fsNUA~d%VNkqL8`zJ~Y+(kYtUePQuXT*&2
zZG3eVpGW!(%AWjlGr7!0`As7h&uy8*{W9;WPz{3>{R;IETUer7gjYO#s_lOf&2izj
zxa-1)J@h3$b*ID}J$K<&ut@gy#Y#+YJ%c#P$rhjJ_AX&ES4pfMzL8je(UB8wKcch?
zs!`cKY-4T$fTE>_N25qBS)o5vc8%gY{T2<>2D>Vm2Ur|qARfxq^#RU69J@zI6gELA
z#Qm^#MI#a!=6VG|$`FM&8~|)A2#shlM+~=IKvX!2n<6Ekzzl_N>FQ}v<jp3?>(QH5
z7^*Q^x5bqJgO*D3@sd8I(Cj!LZ(JI^pGv<~gp|YRp&r3}#At#RtwP(h1%3phr4b<r
z(V)QqkU}e}7+4AAf`hye;S@3BVnA_*E#>#5q?DAC!qQ?KWgI|QHT0s|QgoCuW$sE?
zQ7ps5xVq&9vyq3kSByQQievy^lNKD@q2tOorOP!)eOfCO!NY_oX6H)ECu|dn{8~4{
z>42ce`kZcurQ9?QPs16a=NKMMF{BL6LntO#3e8TKOi$3goXB#_RXN^jg_x?<;;B|C
zB=Qvya}{Ajh=qZ`>7bWH5<MLq+>Zkp!)Il)L&)zDc7mXUH-++Pvq@tCCd3k3EUG6i
z{QY(>B1E{fOyWv8nLZKkuxX<X;mA*+uwW*+AfW(ZgKI$96{h8qDv0(<A(+&6*p>te
z@Q^lMB}AN-g6#z;*=Ph1f?<wfV{y?D(DiTNejH*M@Xtod5XeJ{+*u*_G@8n`81U<N
z!TfYkb%rD+eS1{KJ4?m8h7Y;rgB2t2tE6XB1gcZf7w9=Fhwv+EW0^j4xKpV=nrpL7
z>6NOv>yo0P61_`7lyqTWdYn2{FQvhVa1v`vGEXocUDew`8M?>yJzd<2S<|-~Gv03u
zAs{VOvY*8c90?+uB|QcR5f?4i5D;h9`#9!cbDkL#bBa72YXHIHA@_=i9dTh`p1Ui)
zzl{Or7@{*xi!n^T6rl)#%6z<IP3*Wry111E?h_|KN!g2~`(r)~l5P`>qP;!#dt+dK
zBNJqWkcl!;B@<kmc~Q|N-03(!k4#mrTluXgn`pDUaVd0_bjW#qC1z^7cNmz3N0bD4
zP)>GQX-lzI{Ks3uGe=_hE_uyC;;K1zc-;s)h&3f-U_l6BsgO%@i8DmpA!DLE9BT)x
z+I5zufutHun*?D<Ym)V_D1=!oU{+XHCyC{=Q)AqYjIEBT`HFKE4#^#=DNqm#MqNfv
z;5bS9pCNkI9QgxE-zU-TBW*Aao(Bc;`#eM&pmvsk15gmZ^J)T|Y!+f-P)n5V=?`EN
z4*HFk2?F>902|~Kl|?%Ur`uj8vyYje><!9s*=6_wYN`}BD4#nd%T>G<O`O|a{K}Ff
zx^qgK3kn14#wx8-X#Ok*V&xNv=Zu7tpLEX-7*`f8ol$7wBw>+rKw;@Y$l?RT1{N4f
z;d3Wr;zD_oP+DO=k5B+M^g%?&WvN&3FUsdGX2|6h!_rd_KW82@tFu|my6~@sFU082
zCN?a5Q-#tN{lc7ri8=AJfv)dW``2$qqdrD%$K@thN6iAsG$P@EfwIA?c$dIF`K*!*
z8HDb~Ga>b7MLJt`<D*FhSgg+qP=X3<Gvu^H)jr_DAYfQ%$}Iu#pccasbDAfdHS4S#
zT%$!5b+T|zR8j|612n=4E6IqN&0H=e<P(TXex0GnWorishGIIJ!9}iTgyj!}%W}ym
zr<cb{A?P$Zf_*U4eVctT%QY=D)a|g}r0lWo*~M|UebDW+|5wWk$Kc0)DnACEg|)wJ
zt=Xs;%)P5~87Xsw8tg0tB-wO&8*B*Yl=J+X1O;v`<}WGSflUioP*sh|2_95K+Lk(U
zx&OLy1g%x1E`(mI>+Bkeclt#YnrmBYO*nJ;!2hKYTd19dE2SQ%b>Tue4D!vsM_SK|
z!YAy2o*#)10&S>~HAaAi0|rYkpA)csdHBt09cAI{;c!%px-_o6&PIht%mG7doUbiP
zaXP0wv0oUMfuS>P$vd_fnpWn8s1UA&kbrF2(2v8xtoj6)UF}V7!(H`H!J_@89ABvq
zPHRnL@hWOLxHA6oVY1Eo8*wjf8$fQ87N0EQ2B9H=dq=7PfEsg~x$>L9TBIR`f|d5k
zj>$uyzIO=&p3ait@K`V^RmBHX;aEg!uqK?3T*s72fC^37nL(>hw-WY3(Gk6IC1}C$
zLv|-~?YVlK)@EYVlWa1xg~tRGh$<N>pWJ%#bi1kRY~Y%i<syz*l!pnWjA#L#Zn>)9
zFituE!$Mwn;8Hg<4+r#{&SdMJZkGxv#gD58KZL*XZx5v~P<5r63Lz_-ajbHjZ^Ask
zF^f+aB{Xl@bPz3!X6bW6c*jhi#4-O2ESg;Kunm6PSpFf&Y3Y*)MuF)AKr}_NEk^RI
zA*3vqEh4Dtfm&RAM2HdeHUneW3M6!l$^e>a7wz#|d4Zw>G-u!(@^Tf-S6&s&v(|pA
zZA8ISvq4ntI{<tyH}E3f0Fb@Z3#aAWLk^~~4s)#wTj)8XlW;voc6W^ORPq(?F>sWm
z3Ra-^Y!VwAgS8*H>j)148jB!_GVL*&6|I^m%+^Ii7fO*_&CR1mB_-~Y4N>cpBD~}b
z2lENGWLTI!#>CygGt(b_9u`9*DQoXZ#D@k(+Z%-Ko@HNV#jY*wnhb2&Y+F;4v`gY9
zC~hBI8i5;+zkLl>%^rVz+yWt`gbS&b(pnf5yr)GXRw!e~w2J3Bm;coy2IMg8VKzTx
zq0*CGSS%Mz3qRH^oR)sZOWsu98_wfia>6s<zL<>#vOuHMkmXe~h$~$AOT%tAvVq}&
z)lOF+VliTNi-ro^i9gXyYM{&{lDw!>CU6u2@M-r%O60;8BHslUB^2zFSOnN5NtBR{
zD%4fTIk$`UrA3{|AnFt%ZS=9vh|}nYMcc1cQda3mzx0mu`Ptra=dg9AvxOECg=L^8
zT#tck7`R%#iU~-)*s#JWqlH*8sTufhuK|3*9DO6rc=tBD#ZX+%r^qlM;ay)|O?MAk
zx<{)TIhtX^`We-V&*Mu@c|SB=*8RdLHS!MjFV*?bV}LL*Y(%}T_Qa1`W1ZCtm)DI6
zjt_W={(YWJZvpgfUn*O(WVe3r|M&kT_&*~oUjr~Sn8n86gHXQ!cVc*?gVynnU5wf`
zmjQ!_6vXJ1x`+S1B%u*}*PE)bL&!)HNHVmwzdkxWImLiUKpV&MCFYP9DAS?eT+6|(
zA-A~PH(2|upFN$;;J}Gqn_s4vfNYBv+`d^7Y!`g*u0afQ2)z+_YnZN}+6Y?|Q*sxO
zOnEuK68I2q3ZYYZe&!LJoe!HU*F|2Ad4S`fS8Fes<ON<8z(+RFeFq|(ooB28ykwwS
zD8Usm(xPh=Ynv8yLb5MeZ;o%G#Ht+hvyT|c0!up|(>{>I3s<gd%r(FWsjS(uC*HJC
zz{w?JIwHYV4nDfMo93U7%4emFn@BadpWll;o6Z4Q2C7<uYrxt?gQs99WK#3xTE7%k
z#j7a^kdgOo!_ha*woWBTF_Cy0W>}y!^m7WHL7H<wRGw0&`%z^Py<)V^+~zBL-a|^~
zYYzf_4$bYT>uqc|Jwp)SFpc`6Xqdw<3J4dW1_bdD)ylZZm}vm)V9#jZAc*+@J5`(F
zvf5T4hM;aNBA^(yD~KgUHZs&@E@S@=K+YUTpd`${DT7%t4iOUY-pL`|5AJlBsq?_Z
z#}?dVySlb2zj!?#&4!?_GV3bBTuDO>pcG#^euQ!Dqah_un$^#~V4)E%0*v+~us-YS
z3U4_x<UQyU7N{;)ku|(x1j}>?D(-dqrHg-sGsAXfjO&&!x1Q6Z$qV=F^W@<}{7aY{
zOMQdEs}F@R>Z-nV5Mmb94Ly@+?T~6n<3<QCfvvEvAF*IEkp??(KY)j+olkEW9}!bf
z(Ks{~dxsYrSd6l4Qg`y6m1Aj5Ub>Z7ij5FVY43dRh=GlrSD$T6Hj^PL7{QJQ6M_;~
zBHM@y85W2NR$f|L1>AA1FBJO#UUNNFNDHWYk}V7LKqH28Nyz1qkytGuJ;DocGB-lw
zWuA{RU}8p)D)^G|LX}Y=k;9J~6v2qS^pr|lL<}DnNfb({9<@51?$OEKLAUdM@6>26
zzTYTb*K9#6@87nLy9ckkt#_yApynE3?L42QBZB+;KD%Z7K+3=4+3q7a6S%JhHIPFH
zT^gD>OD?z#lTF|#OTtNMNj!!qYhp%opE}qZjUev;!e|N-{xFU{D7m!)#dSUnCld<k
zquw`gZ7!Xwn*$GJVg!56MaaTA`lMrba!Vf+wmI;x!fW4VqY2p8gxgY7V%i6EJaD|6
zrne&^F{w!dg35eiYk>w@FcdX&m8{UwzM(7zs8yNMT~Hu|v<0Aaml-li^B$^TM$_sm
z8b70-UgHZ8E(ngEe)yC*6}@!Y=cf=64>z=b$zQGOrvWdPzK<DaXl$T1-g&J!HGnzE
z2HY5Sn0leCErn6Lo5>j#xgu#i<sryQ;~gUyIJnNZPPEjqHCFnR1i%pb@j!iP-@HLZ
z&9Jtsrmot@dqOr|FvZiB-J{wSxtEtE<8s$t<rdc6mR!!^zi##MsRRDG&cA*Yz4nP5
zFp4P{yN!F6>D$1x_~1RtDh-}9qKzmd)8MXyX*BVf<^p?xo#>w2H2J(>q-z{63U(8k
zCF~QMCZq@!-??TAf9hugFtH)8eYf}5?)$U$`MF`TuUm&FMo2rvmg?JEJ5Sc}k3Tnn
zrT#g2_gYCU<&~{OPg@ZWjbh&6&k>-a1*i^myM;GK`NpHi%jX(j=<>nQ8Ay1?!CH4A
z`T>Pj|ElAfP3bSUU9$0gm*8Dw?xa0jsz_AYiXUm`_@sMywD+b%BQmme7g7`kGlvP+
zp-cXAI(0byAM+7yJ;d@rR%6qeX)wcroC#v05)HteeVpU2rFf{THtT(C67f(VyUG{9
zAa0F&gPTXg!Ywu$3=AUXZhT&P7zT*rTlzTfJZ5d;&85_#!0?Ar6&R~h0vET(1hKkw
z;M96(RmE1L3Q$#dF$5|?kxlzYh{i3*RdAk~9&wq+hIyCau+4ef+NubcSuQ)kr`CRS
z!YOf*$E$$+aHgb{S0n^34v)FY!NLx|SLO-9LEriSQ&`(r`^q`c2$S?OpU!*$eNm(Y
z8z?#lGlYlRtBl+g+EAnZ+g54Vz;$QZaE+nXsdZLBkZM83C-BI4UTlCZ_D8tR;TV=%
zj<BRDg~Bm9Hr`Blh_Mb-8m+zqL}SKtJ*g;p8_+8>H_TT=D_O8eMqyw3*VVSR_BvJm
z8by80l8c$dZ_{v6cb8W`S^K6~1DA;rG;Z^`1M$adE4Csi{EYS3zpEjf=H1BF)~`l)
z@lEawd{pyN9JF|l_=ep~PR1Eq)LdWdhEvVcQSz@Z@VvdER|Z(qg9KZONt9wNUR6)o
zs6w}A#SsB_lBzlw1WGdAM{Ar1j>N2*0KL8H+Kzj-S;PUm#uPIUctdiq2C`H7nw)Mh
zP<6wt>lXjj+&sH4p0NKNFm#94L(}A|is$!c;f=z$<6tZ?0*%qC`>qvAaxi1Q20@^Y
z3#eQ39>mx*tb;|NRM{BeA#HR#8JwYN9!4&ux*<cHBT|N~+k+}_(D2aN$F@JCj0~{~
zU%%|GnoY-0s0Z0kvj$63Yd#@dOe_pEn*w$w{QR^54&6wgQ*fx<y%&Uyvayk`+$OeJ
z9XO@lf@mUp_cphdzXP&IMgZ=S>kll{C=h1Arby2~Ah$kL{tRQ2*ChoJ@x;NSx*F%=
zaLFL5a-|Fuxl3Mbyh<3uA5As8%wkZ&*9j`fr1-EQHGpsxy=F?{=yypC?f6qOvf6Hq
z^o&nS%ZPiz&8ll*#yrbMOlu&_8qp$(DDelZ4+L@W3D>I=FF~YZM61UC$E>CDb4DTC
z@0S`4itV0>Oz6YoNfrR9w^W@aWqUFvKBQ9}EWd8=2aISBm;!HZc(7T^fsG{7zkg{(
z=>!ylKsE8HVk7<=^cCLm(t8~neE}u(z|h=KqXCdt{B<|>YxE*T6^@ZLU~!$?%RPoD
z&G>u>Su4NZ0UIw4#;_{n!{Vx~@QDjIPSl=}r5b`3p$HW6jfG-1Pn`w*??SQLta(if
zh(_26^Cf#=f*z?bE*n);4`tu4LXaMgHM#?gR!4Y0V(^`m&~&VsO4)}vW(e44TBH+C
zD8@U(6LUC?UTd??j09(I(?`lftvw%fMNxH{p^#6-$%8mnS64~t$?0^O-b!#PSdYmc
zggP;lZl4DUUP}ImW>nG+uXN4Bhi`OuHv?<OHa5x)R3<nsz0RxCLolHCI*E;UV_fDT
zJZ3;zP=mIAqoJE~e;o<559j*OJcevS=*$~&X=UMcBWJl@MGT6qG(s_yM&Ogqc9mKX
zQVN`S%+3*(uT@i<+FIxIUQOVZ^d*#z6#l|O3%iCSLJV{6Zm6!9ZVF1K2A7qDn)c_{
z6S}E5AKIhLuha@d+@zc8&?`nMr){LzG5qV-nE^CLDP+Ta1XYihWon_CVcw9;XQy5+
zGEo~-W-;tqg}mc=f-6{dP*WhvwbdX)jvd!R7j6!+kcYgAKKmsw5l5O<3A3a@!IuMV
z&RZa%fQF(@MeITz%%(;|OBZZ@*_>24tBojM3_=Rvvn2Jrl6-LETYNp^xJxO(*2)lC
z04wU00R4c)cjZ*F*p~a-?(-Wk8j>_Bcm^~wth|)tf3?>#4b|zGwh#LcZnT1G5T?oH
z@CvT3)P>S#*ATI8Q+A=md_Eaw-VJRpW7dpI+@;b^%J<-E2CD7=t2ZGC@L~@|6+#_Z
z&#@KJm8yxb>K<Kvn1QGTJ_P)Ut84tOgW~tpbd##U4qUjJFWu`^*WJFzJ=)e!rnwti
z6fxZM`xS!LVtRPFK#}?C>$+VYIpnK=xlBeM)@$!$_Oi=lfzNuPOS$1)EXWUNdStAq
znJS^GK+?Un@i=NkPo+#Ae1a?|lN@o4#~S_2S>?b|SFkaT4QmK?aPA`&P^wZKL4;%J
zF}M@vPoU7!R+6}^_zD?=J<-TBnzmjacBxuP6Ns3~r;sjU`K=X7+NzW*YzW%ZFKqy*
zYlcD@Y_MI#aqTU|&Sr8lwTXDZ$jXSOkr~<IN+Ppi-xygcBSfu+Y9lFUlFo6U6$!F*
zeCx{sYs;a8o=enu&4mO5i3rISvwVWaIEWjXW+Dd>$PT;w!Am)0YbaPy)Xwmr^(AtX
zt&K(;<!rXiaQ@qke7r$&7QpBgTEkJNIyJOSf#^ogGsEeg93D1sfI6T|%>uT?5+y8M
z5aj?t8y4x0bgx^Et>e;GG7T?HP_o1%kI*y>AzH9Ucz~vKb|8%G#%OrbMo_d@!Wo7$
zTZ0i`9Vn!&<o9I3DR4)t9GtI<l?qD)08f^UaWNm<cK`CH4;0}^!LV$PMPIgOCLf{|
zA%*Zak3&_s#w#LWyx=-rWi*#O3NGyER<ClNvIq6|=y!?tNY*DiS?Z->BcWWDpI96y
z?%4rJrt>eu(GWP$D8Cx^5cG~mS_jmhkt2q|&_+~I<&DAuL`ss##&**W6KF0B){td-
zT@J%R0)?n4lDpJ})OSKX@E9sTLnE}{D>`V6VqmYbnOsALb<d{&&0+Yrm*{B(6OIVP
zS9-EWlwCdo9DfAM!uoK$1fK9|If$sgW57O^uyLNAC9g;-M5#8-9XaF?uOO}-ubrq^
zW_BG&t{V>wb1sGn;aDM7TKo9$#Qf1de_nlXwdgW6%CKqfx&ESU4%mBh(Lw!%`UCT8
zlQ9UY1Q=gcvvu0())}gGy9P%IFfqVc0T67Bk+rE$@q1*`ic49~AiOekaUR|ghjG4!
z&O$(BGST)vGoVNSfs8ZKAqgtf79xguFRJ4rnlLI1X_3mw=k1f@Mqr|2qC6Ysw5qXp
znh(r|HmcC-9<6&9i9msbP9<|E$&eR%NvdrThjI~!q1Wc^F~NrMzh+bsLj<LwBOUx6
zgYGat1UL&zj&iI@YvYhmKc=Gr23!g{nDA*qEPyQfVZ>uMCJt!vn!?5XJ^WD<!&lyz
zant{q3QmL$GfYhO;}FBw7K9{5F3OUXGF*FrjkE4&tiCeNop{e-|2j<G5Dn<H;RXOr
z&p|~Q&VU1OG%RlzLU(}CfTI+P#5YWajbUYI!{x8@S>&87fRzspnnUYT1}3G!EVK-K
z{qFj9FP2zbbTNo>C@xu1*e$Z;aQf>ZQLzY?eax_0Qk0rc3wm=ndqKcdjFevT1~35D
z95PvoGKnn+8jX-wGl)ryJKW5A{E$thcmmjg#2wSir=Z5I>W@Ta)vy)x+968;J8sNE
z7eRqydpx|c$P$0QWQmWM_7-qz{5|T3Q%sYc`PPX<R)EWC{wW(rAxBr|y6~ywyrl;h
z`V`d`>KShbf&&29jOP;yYf&7{S6}n#@Cp&tNEw^u7Q{%)4>q!843Rw}KcP|)$<i5u
zq;Q<yL8_2_EV%$=K%2jwpfJoBBf5ML;tZpl5X{SLHYuXO<mBdxvlgnFAvmTA!}P4o
zM^+1sICB=2^b(95`r2P$M2_71LDtWdp(7@$sxaf^&c|aEq$7=d&j9HnrGLX2ep9Ky
z4f#c2c9GyOj?IZQh2cDDFRO~+u)!O&s*_>pm8(W#*W3FJQ86TD4;U?ute%dF+(p2t
z%HNFyGyDL5l6G8^aGeZ!pEE9Uou$*!5aZWIBZLVLtgnp{_ro8njIzHk?zSW#;<b$C
zNZ1i7#(^e%bNfej<g5Ksi@gxPD@?$<{Sg%qf&4K=d<y?2&n1^{fT%hzH=*RPH@9XN
z_h=>H!Cz0z(LAPlWWF~N`>rsq&#otE%Zs%92X8Qq!rNk0>%S@f@GXw4(jT|)u%c>b
zI3JhF7rF0Ojw!)=D=#Q12*_m-QAE4G9OnBBx?tM*xBSu{Mofi_5)x>RQJu0<o&0+#
zgAroTnB%`g6%2|~^fO8+z(pv)r)zlQspGE)R2HT0rzJ+G&(~t@Ol}wN*2^zv>2NH!
zUff?=nzKeoIoBz*fS{#rfmPe%A}{@zV0U@dodfjhrx<B0t5Wkdx*PI)QP#rYtgO4q
zihQMx#uDSA`XygaB7aBn_#;W9k}Osw3ALoZKsM>Zi$+VoUd6Xix=<#x_!B{$w?&<L
z32e@lct~mh)<lvlTvrMUfxBL8NQ?u*k}#Pp#>}ZeSu%SfXhfiL8CA6mKPgB>8mP#I
zZI++z=Qran!E<@3UWY>#A@$fL0h%ghTNn=f7G9tPaVoWQ);ef+-kls=9JRWw9~?GG
z_o#jReRu!u-tn92pgQx>?{_X<mz%gaUG%y(&p|TLLL^ZzV+5$?f|{qCqpseUe{?jy
zsRzmlQ5}Fb3Z$St1MDbun1deRW*pr_Fe;;1Co3S6meC29Ahg7AQq_VUWstwmKFo04
zK)D>{R|r<liM(8wgWWE&5)P~0nwQ|cX?B%P`{=Y3hkQz4c(;^ZSj;as2yEAG&XfR`
zw4d@a!-v^00|5I2Y6DhZ*u5GJtwZ5pXU)|Dx=&?dqKx+?F^2}Phg!AQ^h6ZyaRnE(
zz+GsAm~~UD(G+vTus;utde=q&22`@SIBlK%(C)Mjx}6_Q`|rG%ZG;ft&#$lNW5fgM
z+?uIh_v<xa7#E$FcN@|s2KFN?48wc6Q0jv2@3hbUZ5ZF?->hZGvC>Y)IaLB(2o)5D
z*VksGW`HAXeKMbg$RJYd0@+^ZEhfWTfXcSl`=lxPjN}6=SQy$Wa5a*#lvKTmAdk?c
zX^%7^;|#B^5V=jo3S@#l2(EZ6e+G{-((Z)K5z-9Xmqcx^iUDBYh(;XBh8=V)wcMk;
zO*+%drCfQ<><eZMud}hG<1`AhU=y>i+4A)Bou|(@vsmYTV6tzR6zxs5I-6JJL#&$A
zi>+$PC%n%pZ1#;a9lAm+;ZAmd-%5Avijlu=WM=<4<%0kSIt17`nPwZ5B?x>Ap^`Q@
z)tG?BXStR@#LfuYv5ugh`}EvddJ{qAGyNvLYwMZS`=DyJnkSm(Nl2@Mhrc4Tdg%td
zcag>mmw#aeRS#%|BsYen%&#Y)E2psqlrk%vgA^<#fK^;D5&%B6cX9p}-?3F+Ea;t&
z23_)v5I&Z+2nz@*<BdRhGr0U{^Q5#}(NyKzz#y06-0bffN>%1GWoX?L*IX))n63@;
z05~`cL06dduu-k+U@e-mvHC=6zLryn)1<ahgKi%&zfg1*A+pWQO`(O)X%{D%PWWyl
z`lGrDOby;IW|BqhR|2zuUn#?ibNXmF=4;35_no++jtp+4w_i;W2=SUsF3oyRZ-qzO
z<Z40TL2D}u8E&UY#6vmR15uM^h6?=%D_nuLiXHg{Qp_?T+0@fXQ`!Eh6rOjmOxI@i
z=6UlMc$#P@Fy!GwBCZ60W8NCO!^vMm*@|E0P_^Qlf@)WAdae1f(S$#q>!HAANO4oX
z<n8WyZ8vM{+-|MO?{Q1|dGjYe%!6^1f$F0BR@Thysab=DBL#$kL)Kg3gH7anr4}vf
zDDd}2$iK{Y&;JfQCizD&8M9WOyCWz$0jPx&j8z+PIR(sY<;-ab6a4SRR`$&3D^O+4
z#ClCW`Ec|<H-$Z{+c{g**-Cz+I0q5{*r4vtL|kN+BICjJOlW>+NxsMZs$%gk;A<)i
zuaQn5a7-7CrXvqi^J=^kA9TC?o%=gf1K&;5$@PwZd7S?$<MeY$^|LGsz)V(nsz%N2
zc=z=0JfO*)Pv|+6HAuK>bj%<SfH70d1+aAMmz-uygPRV>Ys#=1M$*Q}d4XNTQlS`9
zVk;ptjOMT?=3KY7Mo6LG8F{H@Ny`H^5&c4&F;ta|QwnBTkG@Ry!4Pz3*tY;i`de2$
z<Z6^(VwGSp88|)=6b$ZX44dgi=u_ww$d6_<1p-^D<J`kEZV9tb%`#k1NMA&#y|kb0
za&P96d!IS5UfVAeli>QF%H~Fn`r4q6>?7G}1f#WZ9%wssX<H81nqHQ&jS{tWk3!TT
z7}&vTRuWLtA1dm6(`;^=SsV1%AQ>p^n#~<PA~plzS}Ljn%rDH&%>*z1V><er6^OBF
zae1+D^p-!idz=f*VBw5b%LK&W%#xpv*B5E0(k+Iy4iU$VOg&AhGiv)}z}#)$I5YLt
zL3crL-wr|9tQxGf7lA&XAPS8a5o>Rjf|5(tt@6%#IP(FUSLGsco9xw3`!>jv!D&zy
z<Mn<|NP^yC`ui-GA{BXn9I6)8aAxj+i;bv7H!jn%3C1ga14<54bqNeny#nj9L@TFb
zg0g`nzbEk}k#%;Yi_zgX<x$I%0<NpD<8Nh^N&_N9ST`(MqZ^*pa17aQ!yZzqVEEG>
z=Pr>6!X*H@iONtA95@0AbJ>Z=*0^jS(>p_t!+DGz0$zXN95e?bGo81OFIu~jt>n|V
z3#`MQC^tdkc{W`$hvxb?Yf&<yX^0wu#Uxq;eQZ7pc=NCj11O*S;M3;f3>X#~XU)uj
z1GZfLD1hqpGj~V>KR!9{b}mj&PtML;2X+wzC{ozrd~D7Z!0h&UYEWGr3KUUk_UH#?
zAmH^=*~|f|F;MZrY$P<J#$k`c$=NQ$KXEx}k^(g%L158vpqVAQ+{GdjLY+R-tvDa9
zne($ByGMHn8u8A;cym?@7G#C2DzM%lS<^7V)IZeH^l?6;YRG^snhgf#A}Z9~wTD%g
z+;7&T?Xl2+jX)5w#g6B!1l$BV7?Kc2zCLqZHO>AJq!qq`Cm3s<!-T>mlZ$Z?z`J4-
z*d#!Gaf=qSoQLFVAq?f`>gh?rFfiZd6KCvS^SWQ-#_T2MITW1u@#vmK(=1U{vK9X3
zxYu^@lQ4y3C-}h~^W<^xlXsAkC&90lmXfEg_>hq^Pf12N3q^zq6~+;)XHH$8P?Qxi
z2BoG<B;C}k&rgqcJ~)dBwxM#t_;f*3y0*36FL%gqw22`2<ix22f$+%^GX11;!ko2k
zJ;Kyn**ai7SY&83IZCah&8~Zbm(LB8(#@p_>`{gIYdHrsA{E=D!=M=Ox+d(Vs_l&x
zipbV#<+n?88chtRA-7T3R4AsEm0?jP#;7nV>W_g&#21`A*0D$fQaQTxS{O*6smIx$
zy;sDW7$j?q*;1nkP0aB6yGFAHs8z1OSfp|DWC<oR8sfk>^oumKx>Sz)rr7<aXl$B}
z^(33#$yf&T6dlBAW#2%w7O}7%s(Xzv3L;qi+IKboclPvpD_k>5VDoWhm}eW+#uC*x
zNzx>_*&+~g*;8?61~@5(rmv=ab&T1LfgV?WS}dAD6>*g7FfDNC9d^_J&2Tag0Xagi
z(t#_jbhy_(I{Be>)@>hmPtQ)?7&hD~!+60}?pX=QL_peet?3bgzogQBEi8i@rHS9s
zQ`meEK!*+A7bENn@o=?^v9LniAKLT4KSC@#I9zNjiT$=p!k}9VtrNH#Hx`Xpp+AJ~
zUU9SO`$(32iO*4&=pt7XUtcc+Tr+|h6*5Ff4p=_Qu3{)zarX~xX|X~KDUPV&LSgeN
zsx_v!rp-<Nlx35^jB6xkM3~iFy<#g?S*~SU<t}qU#H1nC9y)2J*4*Cq;>*On%Up@<
zzU%gyA#0glO1yQcu_oaJD*at+=h>Ipl;bt{(ht`%3>abg&dZ9hchziasDNj*maLT`
zlQG&Qa(IV*@juAN1-`g8&Dr%Em4^A|;Fok$zj*_=&m;Zy*W^BTVE)RlQ|+5RctG#3
zf=jk4T(gp>Bo+hf1te<6!Spsuzifurk(BirqV6>xXI~~{JF}WilObnDl;xz_^oO#}
zn}409T)tY1Ijk7-adP!n@SU(BM!zkx?7E<-7##vD65o=K%qZrUqjc=mL5mD#*!TT%
zh<nQQyHSdRYo`?A=@)(WOGd>ITRkZzdV9obQ(4hO{u|OrOfvG{U0PW>{&Go(Brwxa
zU0qnK!I{<$m3bowk=P{xupB3`uoBlQBaVWQ5+VW^>8^5)7f`mBrY$)^R*I-SzRYom
zA#t|gKECCOH`<}D!pq&E@pyTZO^Y^KYyPDXTwuNwN){80u?ixUmnK-%IxE<%iIuQY
zVk6CXC<Im{0ZL(@WZ!f@8y4ltob5p%B2qo%z6T5>iW;;GtwGN0@R~v@xwIj~UQTs8
zUf3lgYe5PG@3Q&Qm4vn>&!w=jkJAmT3jp9<V4>CdMDik`3)g3EV+3_0KyQBJjr_(g
zOpN(@N&N5Owt^m}-$68yU;pBMBu~HjQIO#OHeEyLIQ7lA^bJ7jn}6$Ti^?eVH+USY
zTt_%Cvn3I>^Kkpa^BBi7PdBlL<v`c*h8;gEUCD55n^S{bEYM)1nHHEECv?FS7)?r#
zOW^v(bwtnYP(AKi(+n)kv*)fmVuvu~NyG}&);`#2R?_Ih?db3pR<e&SM?6eA7BjpP
zL)4QH)2}Fg9$N_o@aZ#U3bv*KK{sP{{7a@5`K(KMrIi<|iKMe2TDrP{_|h(FFE;xF
z%Ofmij$=8y6rC(A@e(qJXIOi;3O#|_qTuR!Fo#OWL(EnPMR1kGyrSM>-!;nF9HXDS
z`;s*^&uSsY3907?x0%b&VgHNu3|?omlwC=h&k`fH@uNCbg)qf{gks_7J#bOzmM*1c
z4H$GBrjuE24)Pc-hE=$8{5LI}5)$O%54GcV6yqV$bvn50x^<t_U6FNFx#AvAHR|Gl
z8oHSnai}Ug_$r{{vrTSCbY?8NDNW%D@FJrLu7Ms*UzZ4id|4LYCZwe^y%fH6J?Cj5
z#01sabHi7VOwyFMs?HQoaT}MJQIimrMJ!{1QwMjsQasx@KB0Jc$U8B5^kWZ`q4YGM
zX_z~s*8FoL3_e~iq{ZA&^RX|31T`)}uVVMxWtLbk7|6E_n;M?omE>2uh$ZngoN(*x
z49aeV?t_7=@hC*v1Y9s2pCT1Mo2ax*@uH0vA*tEbDaCDj(=RD&D{qPQluGb{JwwAt
z`f-g8C7mH!DHu&79L~L}{a8&KnO2@4uY#}j7Y?T&*$R%87d|2P5^5NiT*_uW0q%S`
z8W!kxcLuH?K+09>3*vni<_K_Z9p(u%jQ~8gMWBh+Ae4Z!^so%C6x@C4eitJwL>YR8
z%J8g{w-jdGca@0~tTxSsUn${)uOoEKq@Hzw!z?;Sdp`ic$?-{Ya@<0IU$Fk62~a_o
zR%QxW8@I~JJ2owO2061ln13B&e8f>qNgIQhL1vUg9jvo!vzTI=44`zDb%I@VFhr|d
z>cggCn~IQ2Ng6@1i2KWnMZ~4+mhV}|<X#$s4**?~ffnWfz$e6m4)Tq-d>9BnR=ITr
zy@l-(hY{dauJd}At>&dLT~)4y*jJ8YXHr&yN!dooc(y$sstKYgaQt)zoNLpC6!1^e
z>^e0^Knq6G><UDxsUH;MVe+1ym~~@ke*k|MHC6k3AwaM(Z(xqeLPx}sB-gXneyjaM
zs|y>dZRmQtao|94EK>BsGekizXqosZD5spyQnD9N&KFo3dnz#0upMtfN<ppSL_!fE
zn4*NT64_#mST_JOk28ZaE<I{@#zxWIflA9OsHv4EvfMQj+UF=CFdxGmeUr1z8f*8V
z-@gf7-n=m9-VFbtqbj}Jbpb4P`&D~bYp~Rr&cSmz6KS6WI{muC7BK3!IoY2<V}M9g
z08GUU56_TZvw?((m3pb63FO{D@>Naa-7@qq1_xwQ8zt1IfPx#qDk;2XE{*hB(ksks
zV!U~{rg3eN^jYFE51}{;IRUliw}kMu?BUba*}D}VhFC>!_G-$_oj-?&Vyn0=TU;4a
zWHey6o`?qZ25U{A`nd11{L6yMlFQxtr7I+Krtl!W%D{e1;O1t$Dpq{Np;Y4rR>{gb
zt>c64+r8t1&fC53ecf=CbL_t!h~=105(#eyU2YgHvZpOPaMq$mLP(b=etHbXyZ@{a
zd7@JR{`f7}Sjx!2Yy^7YNpq{Y6+9*B9OX)Ur9pu_7c=?ckf4nZp`i-iC>wlmMD}?~
zktlameh*#=U5!4#N%crzLH#%VQILPTya&(2_DdruT|72#rpb9SnAL^-MckiDuA!1i
zi3CSPya4UU1yj-SGKwJJ0^9H`I8d1W7X(pJ3nMh>Ao3b$S~i2<BhLRU(F;6WNh?%T
zT8dtF;n{N81MJRjQRJ0ijipd4zc3pWUClP22BrIDl`iGEaz9I6EWZRnfarjoO^K3#
z?E=&s{J)NaSwb-^sz~BlME-_P&F<C)G+JwNr_o3f;gS5zA4_<{$?qe(_Gyy#`xp%6
z)18J`$6t&Ha+6{ZEC?aTd*`0O(fKr-xOBbYWJ6jV`dLEQ>xR(RhIxsS@scnYqMD3{
zlaTX$?Jl}u)|yp)MYr_Mo7Tq2N`3#BWd(a;9Xo88rJhjXSisL$3#-={ioLoJ1M{zq
zVs<;qJUDN^+OMAo=~_bL$<A&NuaJD+L1J=N$0D(Q+T?|JK$G^ttEwTY*dx>xsEn;Q
zJFvS(Lhx78AQo(B4f?1xYgs-pfAT-jRI+myo#U>m7u@@y>QzxHbX8r%H3`i0e)%H2
zvwC=PW<#t(?FnTgU#I=Lv3`x-6zs<xOS-ENL7av8uP%rAyT$82UdWAY$O58K+hjSb
zfARc|opWROJv#@ijgB}PXi)Jnqe#cMO|pWs$B%SQtA#S((VU}VhE+=A3Ungor8?M`
zdXNjyOGk|)v~4RF(F(9{6~kn+yH6p@C}>4$X`lYV3`QE%?4^9i-gTJ!d#8I<TqY(M
zd_C#P`2R_`UqiTV3;v!&tEpiD*(w@=H+~0ExDNlDkp+k%|ILU&lLHLzs|ew1jXbBN
z_`oV~0vn>Y$-x0+!A2`}>W9+Y<5gdpfySkYLQDdP2T&pK>r@2|0n4fY6jf=jtIUf6
z)&bxy_}haOXcD+VdD2pD6M}f91q-`?VfHh?fu7yzjJS38pfv`peJsn^YZ9haDHWnZ
z4I?lwudr^x5cH+&ol>NBdTGwlA?L~XjX<!gWayZ!xhhw;S)`4vNTOCe!pW}0z}kaE
z%0{}l74)ZgAqrKUEZNEX%Z9hy)fnPY?6Qyk+6)?!IXO;Y3E!yEOKwiySTNMxO#Yi#
zG_?0AO>w#FQhU6C!d4<$i7kg^^&5CuN<Fb<Gc7N|+-gYNopMch*=-jQ41=FrxX#JQ
z2v2|jVi7doo0Y|YjUe#J)`RovGyu{89+9l~5dbP76M^y@B$rJ^q2GKQ_C8887~^HQ
zA|NZG_qu<TQ4!A=Y27^st$G2iZQ$2mllT)ZBD`cm2e4H+=;TpfmS7O@hC`njn6>$t
zqGNC<5~&sPh&ZPFZ+;ww_J|J=b|r|O(#M;x5bydR9GKoTo%KEv8KGt6Dwn`lVri2U
z++rNB0{cgiD)tg`pasLitL_Ief)pJtsA>)m2I*xuvvF`d6$~iP!9Jv1an*ZkW1$+}
zsgz{`2O}b_(CN2w2uFsvqt&z(1fAbFAIR9|V~j+hk|W}%_jCOta5aAH+G5&V7JaY)
zi<V_9$vuF`3BIdKEXTXYeh*45k?2<<)m9Eq<xhMyY^^&i;W2WDhr`jRa)F~wix;wM
ztK4Gd0c9Ovv<a~_$~3T&6GTEnXaa>alH51GRpG;%VX~t&gF?Q7JxAawp8}q4e+bpb
zEnW-e$5XHeHa<4eLrNG`<K8rb6kz1TgUnThRRfpss?<qikpN}PBh070Y~h?`vbH6V
zxT8_E81#aIa0*aT*lO=10pYvWooFF@a~R^3XsqfJ2`*jA$3w9;mg$5)#`Cb!sSUys
zBrAc)=&!()ym-H*fkkH-SI?k;Hdv9((n*aVzSiJT0&RQt6>zVm@mNW${pch_e({Z#
zCDCbd0hVgJr8<*l<QS}D&JD*$x$;fmEkLM7dvG*PhS7=+R6#kvSOX>LNQmObMrj2E
zMnQ_@>^yxIG26pfHooa^elzMrsf1dyZeD5xXu(aa7X=Q_hPmk{Ll}y`5`9<hNBTSI
z?w_^x&VM~IIt!QjY5jHosJZp*$&-jbr>|<m_#mM;n^Bfcyuv7cN-XxjIw71)$k&U(
zR(3b&G~%YLTE^#V>B9}JviQR<rtSWGQZLt_sIDzxmZ2PUD7hD2SSD0qz=}33KO+^E
z5Wp*A>wtB@seNr;J56t~z^*rSNcI9XHH=5c&<$t<z)pU`*iEe7d(=Aq5YBL6IQD*u
z;dGQW5yThj5YD8IG0;9y_`BAWpiXcT3j8Avu_<Xw@<n5XSkEO&?)ll?apzFN+~buu
zpwPFg6%u_0Wi<;vTnYcp)zZubu)@R3u)=+G_u$-8ZIr&PgAxrdj!)N*!VWZXP2=|+
z!a8=bLOGVo=Hz7A)>f_rv*hTysZ<};*w$7TQVI4z8CiDWkkjGxJhqK6YB<gbJ8T+K
z@Mjh?$csn&D8T(CYh~F!sgH#@5)dfEVwtjoK<vIn#;qcXiYS-wh_>+XpC5J1WOvm!
z9Sr2ItL?|%I1oMFSJRiIKIX+N_zGi;N*CyH>%4o|KI@!!U$>7Bx_bu)XQjwv#|)R+
zikweX0<o7#D5ZGx`1~~2a_6$**(Fy^Q8GNU+KH32obYQo&1xsYEZ6fgU5n^haeqq{
zY+F-a#(na=m%XBp^2Q2Y7SmYb`3($+YE!5PTT($CVO&QJ`F)7shiI9M!{>p;4k`Yp
zi8k>C<ue)*5KI_#m<a<t>@PfMD{lRgZKsvm1A7n(4_N&#E>ei41jSXnlsBwKU{mz|
zUhAP)1`ZY^mUEs?g#YXn=D)M0=6t!nd9C7$zU=N9^zXm)rPWm{i<K*!Ex4%ebgSLz
zW?Suc`z?B^(2`h$CrLAScC&clYxy_}PE`|tABZMInl~+Ol#*GbwR|f0vr_TLQ@#XV
z(;{mVaBlP#^bYrSf)V|k;Klf*VY)LX=9TU5f_hozaWWuh9{44j=3!@GH*q2KLoB5S
z;coCNS}9Njz)QIL_z(~zFPN^#vhr#03a%_TcdI+IJ=y2CQt0anxlfTw=4hj77i~9p
zwtk12%EEK~m81X9@W$LKMUmWhyAVFS?d-p7^qyuLHi?pR#UN!0iwWgkO8WkkAi^mf
znKWH%E$0NQnhjhOTX*r1qMXux4RcE3!lbkJ$YrQ4D+tpg$&g$-Q^_%_h+RsbDDB2Q
ze}SZY(JX`-Kw}x?nFG3kHOg}^44fhxH4<JOrZGt^#k>OuN|o4eds4=j#>!v~VaPp9
zOH%fE#3D48p7U>D{eE0SDx+^gyM9&2Yn=i2TVN^O8;!8ed)B9y#AwR@BL18qw7=A<
zfih)yjywyeSts0iHD=7ga%r%1zvpU%RHhJo6j<O}D01qvs1etyJkWSI<b^{C&6O!|
z2SS<>0fM|4a7r+1HKiT{g7(*&UFpL~Y)?2Ao`T?I2^eZ5&#${?q|>aM_J4Lg%uY_;
zb>Qp0{?By;-?GNxI~b_X0kH#&?H>)(r!wk{86;B%++%V@jBbNw2osI7D-rACR)OX*
zy38VTIvvF7dqfbu%%olud|}`4jcJZ{V3?o<#7Y4mpY1n6I0+@VX_G(Vv!v7XIx{~P
z7`}mSJ&lnhU`_$REu0m1G%K#DCGcCCk-{VN#08A<-EEPL2K9!=$aOi>X>KGZTG-!N
z&Qw*m?w*~Puc@Z#!Ky_~T`TZ5zihbodujO&<xTHUt@RF9cI&`hdVilHui=_R3%wqk
zygy#nh+dDoNCMHDbHDQ5`~z=Ft`vo5S5q`JGqZ@%7MdVcc)r6K5P9@=ycieue$*;e
z>59^qpcn9QETI<wyY2hT{z+usp@YibQ+>Z;39Dw}aCp?s`g<-^QJ6dt)7_PSwCu7(
zVp)w(uXZWDCld~5ZxsT{;o)#JJ!~{BN45`SLF*KJn1a{dC}+c&R3B303h1IiAOKjo
z8i}joiggOo!Uq<t#t?MnaMY-zE%WA33MBV6x|W16g&2xb|Ct+*b_`Q$?FMF;cNd*=
zWe6jY?k3~PF!WyKE-C`W`YlH6CM08DL$>!l1N~2j*Vn?823YkRvZRYmBWPyH8#AT(
zB^R^$)3=Xzwj6nW91doR4%+>?+kZvzkU}qrXe4!^VogcOyBaEzfccZ4{_~)u;#+(^
zpztg@5L~f_Etq3PHaCb61+rR{D{>p$bLrgr5EgBu-Ly~&y@rRZ66%&*Vt^f^YCE{a
zamcs60H(_hmu(?XO<sn~<k@K%q2!z-!)sT@637t5<G!nstua?G=QFPzPNk#J@MNdy
zr9a}BLEY8Sd>*i-jn^tnYrT)5en5Majry0mF2e7S{7(>+E<--VVQa{mtRDtL-OPqT
zJ(sBjK61H5!%Rf)m(ep35qsidio^@%<MKWToE)|UGW8IWAyZ4^wksT&QTueL3fg$N
z0U=u80sU}AT^WFZjIW>Ts5xD9J6v(3$8p}J7rVqsDm(|WsAm~45U@wn%<!Oag%1jP
z0UAJSzAQan0K7C5ei|JJv}wn%6%mL3CrJAwh1@~duP#_FS;`oW2_eY5?EU$aAWAr1
z)&*7GPz5iBK}?k$0e+8{9amZH@U4~Y%vic7hliC_$z!%>tbOIYIWCpk7Uzp#j@@&7
zfg}YFdGIE^jf%#Vl9neZ|5MJ5DpS^y7I&tvre;MBZIp4)jWz;NHQaq?vk(X;cYz8w
zyUk`zcYWMmX61rH%1)uIAQa(l`i7@nyAi1XEort=(MP@_`gs_c?swp6Q|Bd{v0}T)
zG(~Vvb8jfvt-ye6&oJAVw^?qbDt^P_lf4fvGxF&4ZhNCFiV3B(hUIaD)pq4DvS)Q2
z89q@x8Gb;&l|Ik;z^1~JdbQqD2Ux)RIN%l|L&;>?8_g*?7Q&BH4-x?J-sZC$Dn4Pt
zfh?~X)nIrv2P`yKYf4lBF<Iwcp!^tug(IuX-3uf2ig)+>Ae-JYiXCP5n+wNGW5FD}
z_|3(MutBN=l%F~2O18sSjD%ds&??#zp^GJh;c6@bFAMbWh+#Iaq4GKILhbmZmeh=N
zTT7^vrnZ8}mU#MMC<G~)*TQZT9-@X|yuw`x*jK%cS6D)M`@_bo$!yxJjq_SV17*b?
z-jRp%aaL=TQppw_D_WnZ&8D2BFJ;AEnu~Hq3LON-b+F!c-IcCx_QH1;L}Hj5qLs*X
zUPnAkDW`?9C17%eVS0E%vHuDrfzpp0d>cC3FnU#4>SfK$$__^9RgpYM_K(_dap6I(
zf*YgslvLISjxWbhTPHE$X%l*JGM!7YO|F&Y&u-m=LLPt4p?q#KFo*4<=%(DNk>}0r
zHJWq&$*>3;;)Mt?yTgN()b^!Lv#Ntff{>b&bX&>}EGO@H%UQq5W=CeJ56y<2TtYU`
z$rSsCt{oLOlLv&?M3z8+@a&#^-)Ka;vR~TVFI5;@R)03*{J#n}-y(c5v`=9szB_T{
zTO>HJ{#c!Ks$D}bJqMwD;uoCdcQ;(17Q^nTYF}VMS|Qgw#99lM%cUx<*w$uptRoC;
zctJUPl<BS0FU*!pChEhJ?~}b!-!L`1Pb=h1*Jv`B77)f+$CJw7LpK12a*Xq2GR-~@
z^Lb%mfD}Hj8&0Y+RSdIL=XSkRuD7C|i*gzVygmtJkgw&qODKuF?sw$4E5$&Td2*B=
z(<TT>06lz60qrmUWHmETOoch_LO9K5C|aw_U<$-3E7mOZxZ8O>sk@zIEGIOQ_6gTF
z9eK@7vym7_J;UQVrx|8xfikig3KXv48c|BQGlQs<1DAL_)O9p0W^K~*o_k*&gOIpB
zQk0Cnu3ulG`9>wqjIHkB%n*9H_ombI_9z>hW!EJg<!1=n-+w&^8V7lchFfbsi#!Sp
z9sUm+Sjsgj7fa%ynqf%;2bt-`Y&?#p;ZOK1yBV6L^o(oG2cw~SjPhLSqp@ic*C_ik
ztHUFunk%v)q|TeC#~ZJ(%&N~UFo<I~`3WL-+owi%Jj3LJCcg+0oFqAKykcAy^IfDk
z%zgVp3=2}?j!&~}dT!4$HH$e0!-*8~7)~05k;OSIQEn(4=XvQ@J?`Pe|NXbpsCfvm
zeO53>v4_>@lVhW{w;C1wEg>-d2of33+YpaktLmpUt?Bi*&@SBwhT!4`kV=hG3X~d3
zkw|XwGJA%og>KbMnYgKKiIpu$n_PPdpJ6LSP}(rEh)<WFQf#qS{iIv!3cs9wqv}`(
z3v3A{8Zj5jHhRi68!D-4&&Dxx(b66Zj10~<7#ahQ#BR{(7<8lOu?({CZMGJL4X}W6
zr#9NhZz`HG`>|R}5=9xd1Jd7}#?m^d7)sWUx6{uCsS!5Ax8~zd<NRhEf9JQziCJ*!
zLzszWG?;wnOC7e9bF!P*nuWjFP(SpET0ot>{qJ=$ixPvKBhTntPOz}$!`J27&-%7J
zXxl0qktF}XU(B6;1osJ)zezH4a(lC)BB*fO-|KzygY!kA2;&D;z13c<jIY&We|;&6
zEL&g?PtNvRA&$yjgao^j4*YTXqh=4Po>F_>v-_$oa#kgOnf#w6a}g5Qh<?OOxWBjm
z7D9o|>uiOMKacN#xfJn2U2WOn^<;$pNDCEIs$iJu3R*US2XxYV9KUug*s!IN?c&sQ
z2p4`;KMY8pk=p{5TwTlED-ni*FPaZPg@H_ZXFVL`U_`^9x^?RdA<A6jBDuWPUj2qw
za~Jzo=j&dqAiV;uS8;$)<jQLo-G`*bK{HU;#D<OPk<laM`p(eLozf4Sx(h}+JZa`6
zn{BwplgMY4$0m+Z!_~m2UMuEC?;H04VgF-V@E-QfH9|!tRqqmw4<<#d2IUq~m1pRi
zc3nK8AJ%C2$SyasET%=Zs2uEh@@dE+3pAa3gwp`F`T{DTn^_e^k>smDum=X%LMxLh
z)wEe2O1!RGBk{b+La~Lb?#bXQ>wbQOB^AJDnhifktMJ9sbySpPS<#AR>+lLQb5tf7
z|A>e-wkQ@4VVM}`#U4dn$`$I;*h;0~`^R(~wJR<Xh~Z=GfpF=Vl*7X(pyxYVeLOQc
zR0MdoR<H}(VTgeJnQxzB*ZOEOyZN>(E#-i_Tkb#RaD*;V!YnwIMEx#J(Pdab)VmlV
zCxR#jT#L@2`Mm@w0f6sw;GKo_kI9?n`kl;Yg?~ru5Hmz5st1Aqj@S&?rJhC~<4(Ha
z<DpcMQh7<rjgHG4E@-W6Eq-@#blz^r`kuSBu!=5dE-f_P@NFl>w#+{ZNEFP*E-PCe
z>0aK>M6>7b%^W7V`f3V95+R<Bl#r42?0CmR!ZbMJXbhf1ile@?-lvru*o`ncA~<GI
z`2{alG&u_=0Nog)rr>QKc>p#soBDOut)0pK=m`$=o#!(Ct)gQ{5l)WN>nz?il!6+k
z*I7m9_Ghnq`8F7Uj6m}hUM2yZQnw_gQ(`G}|AvGM*`A>y_b-KbJe^d~@-KHF0cj^4
z6;ub=XQHM>n1EfB)hJ@6a0?evjG>nxyR&NzHHD_WHc+6T`~VNnD@+!U^d)42xL!?l
zd!qO79%V%Y$pRc{C4roV?_K9JipLDydJ@p&f|=y@G}qAlTKqD8ol!A1k92iv_XzK{
z>!vAbgJBRI^ZDV-_a950>WLZk7-Ix!M>$}{4<1Fhp`3u1U~m}hz+pNl6IkH94weuC
ziNQ#&x}hM{5o_mi+v>76(y?g|0W5-@iYh`C`4r{s+=`+)HBK`D!Ei_*HMw(PHCYC}
zzQq(0UR0M!qC5|^g=61M+8E`a1bn9kaD=UHE8Io%GoDcgIBK&_wJ3pyN4T`a?#Xq^
zk+9jQUvXE-xxT#hBRAj-(Gm+kk(d)={vvR2?65Q=#9u_2JQu#OEQf{-WMc$Fi;l<y
z0%z2R+w_ge0Zi3`D$mb7*S;?z-N+OqZ=dfuKrK6X4abE&t}?pnh}H0{QN$`ESz(}R
zj6Ft{8fy}HA)gm?vXCInF?wW;4H6*eRe{!947JOYnGFBAs1!73LZ(IJ9K!FO3>u5P
zU+r=)ZD#-!aA+>F@H{ocD7>kdS<qWA34>Cf5mg*ic0#~j)Cz+z=a9$5G^~nTmAJa#
zyQ8CO1NVW#vE%#xP32UFs>Q9ee$XrB5PR?K#k;1r<Q!sN%L*zoPaSO}o24uXJ{BaJ
z&C-I?7)0EcD^!)#46^gAF1<ila0;eb$pUe#N+8wF40DeJBZ`p5!wN<REapu((Q9a9
zAhdIJ(kU-An`RtYVfo%D8^jZWtE-R4>duBIBepv$>|3cR@*;uH*!;((eVGG)Iz?Uk
zz|1}5B3v1>`ly%5u+DV2e{|Amb@vXz6o*E*U;Q6Cd#CZHRJFvc?~1DhPa!7E*!-0(
zI=>4X28t1fPcIGKULJh=_lcri8bNz;dZ$=zs4pODHCCQ7=YTFqXMI@0_bag9qQnGR
z^uL3i4PigjW@9<fkrZj<lVqbD{X1fKZM5EE$O0G6OIMR+pjt+xs>b4TY;zBoMmS|k
zt%LAyucES3-QH&?`=M~{a)J;z7Y9Uutpc0Nnc5n=Bs6{?TVi7zz05`!UlGM2zfFr%
zdJR*FvLYCM7zh}vZd<_x#$=a2&m-IR_t`pIBY4%V`}*ypEu=pe`3cZf&_3QkA9!cu
z{A2?$_LBu}f{nP{9G%0gJI=2!smhqm>Y4!(^;PoXWn$Dt2GHHOPQPrJZ#Nz6j1**p
zKs+#-W=(BK#Cr?m3lw)@i&cp?c2i*u^>IGG`luXMdKi9;91N<S!*y2_4SnC4WiLLy
z$@4ztiS5JeJh7=1$5M`Afk2fj(}ZHV6gi<7vsn(w?wRFXIt~iArRrI;bX_y{KsH+;
zs${i@k`<y!;8udNqGkb0w^g!{gb@gIiIrXJIu_$)EEXfIpvz>mY+Yd8CA#6a(sc;G
z$}1AG1K&Mgd{`2dmXvh%&)TQw=wWLuI4<HexyrEshs4D8DFHW6K4sYi)ZyMIJTNF(
zy4czxBP%xgd+t$qye4YTW~B9Vk=U}N^~2s#=j|SF<{|nqY|`91so_QqCchNC2T!wi
z33rlS5pE`u>w7YhfLb$|n6dP7Be=2{D;`7gprzngGN%s5g~^AIn>ot!PxHw=N+gvz
zb8umSKJ7xr-ApDUKmfs88%`{hlT<DlR*sC?K_g((5)_{{kD8H~x!80kLm-MjnbUU7
znXkye)%>_(xhgfDexj@{7amDoK&)quE9QQ|%|W4@l7Dkh9Y*e|;35wai3~6I@&cjW
zW-(&HD80hD_-t|c0&K3A!z*4zd<Zs`sz{sB!f$TEu%{^IPtfv#`71Xld|oA&=2p5H
z_Q78`?u#QN$I#HMPuM9$4Vaf8UPc_*K)Zpb+2wpV>Z{3m7EE#van2<IEc5Ek(d)7<
zGeK^zT+9BnKqVVxwjHy7h7i-K$Q5MR)_N9{ImmBl%_x2ECZB#P#3i}iNLr5SDP5en
zAD_4ab5YU5Oqcmbh{@!!+U}B_1`rP>ECqyY-e6m+9BQ2{ujpN!PvEnJB2F3YW`r|3
zqNuD&%Y2_v;f{d>gBCcT$KJ$l+&aP{(&)K!8$nKY2F8AX(8uBnj|YpiLIEq3<xKC}
za^Qpltr|^)UPurL8tg42OE_dIfl!-5g`{vZ<?LH{>q#Ry84K$@Ji6$-wfP0mjpKSc
zC<RW9m+Q{`W2~$?Mz}(5hf90=v_S|8s9OLVqX{@asaZ7lx_j>#(gX>8GWMgBy#p&O
z3qk-oIDty-H89N(j*JcliWHh^!0U}Cn*7KVyn(hvFw2H>XcAcpiUBY2d=d}Q!52}-
zhbAilYpDZlUvQfNnLYxwte@-~Rt<>V=09XLtUrKfRHp~#r}NuM)+~9f%dHKDgPg?~
zZq52*(EV86&7@;13Gs4d-Wl<YaX`4_oiK|=50**SQW$R?+{<&cE;kd&w+?(05UCCk
zYBM8))i_C?yG(DWR*7nI69RLtvT-(r7z?^wXchs@EoW)gX2>4sp-l-u&QB>01-X1c
z1p!YfdXMU*iYo{hVe@tx!UJ{3W1Q$TBjHv<G{zYe5`8vssD4uN0vDOQK6{jJm=6X{
z0uqJ^w?S`|4zDRt1vAy=V-yvxvuncqSWNMUFddKNfl|qpy@;eWv63tfh2FBtcYtue
zp0@Y;eGJ=20mpJ(|HRYHjM7aY`oL>Y5t(U{r6m-FuJg|t&;|Nl#v{yFAXURqWNL9;
z2~~4u^adNRV5Hq!!j=PYe|*>(Z(1P0@jyIN01V(L8(+;nE?!AcAQtha5ad#8Y`n&R
zB)!UZ$$WU(UfQ;P04>R=R}H1?&>}FuJ1{gct0oB~BWksj?!rMo(%j4BpuK+%*<*fQ
zf$0H8vTz#BkwDTrLl4jsvnJ)<QA5W~UNmmAyWtTq@4#T*8f|9rfXutzQCKip&Yz)h
zI0U^VWY|HV+|$X(zL;U4a~kq%ESGGG647J{Hh{xH!QXLV$Z4gM1tO0Hm5rZ<7Is-W
z5De4_OLeGp^!QrRi}!ucMU`F(T>0(U$??fW$J0?4tEE&(R6Gfg7^a<mh6IOK76iPQ
z8(C^<4iP3rW0^rKJ8y7HbcYmDB$JCy>NW++37N6c4#_J@ZM+jN3|BuQC5~L8>UP%g
zUL;nsG_7P_vmmsI6VhvpZY^W8HXv@<#e+e8vef!!I(g;77<sth>l8|jSus=M3(eIg
zE0fR@FAUoi2>;?$^5WX4Hbc_B3MuIG$|@_VR5A;#X*MAiDc6l0o}y?r!WzN&Hw29`
z;vQ{=lpNIq@#K<(hXD!-#YK7w@wpPGL77rY{*d#0Z_-;w5T4+{)+8A)ES@j4n``-!
zot{BvS|a;IK`5@4XF3Z5-M#%sIUU#Dy46UbDLyHbQPR+$LK#SMBPd>ol!vBN>i*ot
zH4YsdY)NZC$SeMJv)ABJ2)>ax-q<j?xBopwt(r4pzLsMV+YTCpGf<Fuz$d%HNH=z1
z<Gx+STdinPLo^eoEudzMp&7Ww2{^uVaoNkMQ9gPphHls-gEy^nm1n@wMIo3N&EgWn
zQ#x3`sNrIXv4Wr2Fo<-RYHL^1d_Jk!=Gb*3aY{5Di_lSVLM5e<SC{O?qdcF0y=Tg>
zk64nB(kIxK!1H2%?X?9DFMB{Sk#w*337kHRBNow*uCf`LK0%P`+Jwbz|Ne>_%yGIl
z!`o43-@oC40A?La5nN7azcwQ-Uf-VJLsZlX|KK#nyV<qHYP$6gG(9i29<Q9q7rZSA
za>=Wgb}4XnzWJChZ_Y)fEyQyO^m43tbFMcG_lp@H2L29ED}>0S0uMJSMRJzwXp&&s
zx9Qq)-6;nJ9D&MQ-0Omk^UOqeA7QTzr8)L*#wq_$k0_b||N6$O8w>;vV@2Xv8znRo
zVpRkQAyHj;2TS0TL<AO_$th|}>}j+df{Y_1VLaK~LQ&1VU1-1<G89@jTb(dH*<y(y
z?Ue7;5bu#Ql#?uhtkAGhBevj9aO#uUz)5<AWdfIjuIxz|$RwS@o_ngy0+0xoD&Ksd
zx5)>Jh<45`pVM|PYJA5u&Q#I7IBuVJ-?fj9+MSkR><1m!xb)_`mndF<3zv&>ZtG2`
zatlZaj<^gNEo4PZW6J%mUpB{5EeDkQt&Bx4)1k_^Qf)5XLkDq#)6>}vXdz)!IOyDX
zoc%xpad_)$1R#StghS`*hVb@DKG_uU>!p8a<!6p@q%$e8fcgQwMBaieRK<9}T^=d0
z!ouP#;M66|zWMs-WdHlt0T!-SO8YwnfGJXu^45xk1sAITFhtC;v|c1F@RqRA8=i6(
zcr5HNdL8=#*<MZ;3rjY*9AZq#AVngJ(6bR2X15cvv$1_03rCN^V)~wW1sO{;eRyUQ
zk0{n-<tczL3^k|{K!74>>;B+3!H7w`!Jv6}A$ZTcr+&_u1j;u=#PZR}(rNGG_u1`A
zwBhOKrj7evYEi@r5p4~P5RA+%@HWnyFS4Ji!GO03*DpY|)JeX0O|TTn@^;@BxP#Lt
zsd8{NbGe6b-8_H4y&JKvpgoLRPA0-1{DY{)qXkk`g$Na0w67JYdKJPHTHdt%)o70W
za>`&~4qJg{6{Wd2&%6zG#zd-;%IYh6!<hstj?Iv5HlJ&YgU#LU%5Br*a@`B>lZI|;
zC`iS~C2V$c^2pu%82@N~2cIj2f_QN>Xo6IG{@{T}0<T`ixO5P;5PV9Mq8d?OS7CAa
z3?W1!i`;!-e;PF`hDrd`>=W{`3p|*ABZ3&R!h9o0BK~PB_w+pe#*+JR_0_Cc(fDHG
zf>s1zDSc18Frntgx~EE|u~tgSj!_SibbI5lt$d3RdvwZi{7Br6ov8=jWCV-N+Ztzo
zn)6jF1+h&1g@t?I6HkB$vJn;0R)wxFYd45GFE_9BzDJg`F;m*u*3l%m#?~Lk#pV%X
zfxT59L#*>4=9|o{5;=h+l3IGOS6%jHLX{LhI;`_+RKX?A+im`(&bY!vm7B~q4WT?k
zh^&)lAnf=m^DD-1?=O<AMiO3h+>ji;CBcP3%+&sw`D4-3Hn{Lik!^2k{*X1Zxf9!T
zVYxt-c!t$9KpX~Rfsy2*^xuV^x*%xkyW2`97RnpiFnT!`pg==n76iedZ(Y_HUH|1=
zGf6~2^z=jix`S=km56;@QE`(Mh3^*P%j%2hYiq|Xz`)VhTpb34DL;)3-BVEcw2{2>
zYbVk)Lg!pO{FYVRq~~Gc!m?7#_~xdkp)V+lv0d_iz4mI+w;!FXyuz`-{Ais(Z#Vvd
z%S8e)Izyx`Dapfj)g%Cyqq^W&73eqPVtbM$w+4gQ;6bdpWJ0Q#+#eR3V2?o^&s@Y)
zh-E;5^Xs<-=Fo?Xd7G%l(Dmq{8%K~GkzRlQrrC6gCA(IU#PPc}j^SJQon4!}I)+q2
zIG>{81O&gd{GHFyh-Yyai7L9B3VzJpf!CJ;TCY^@$-VtYz*)<r5iSW#5w6g8DH>4<
z!YCgF0*cW6o>6?vFz=f?1k^Ft6kF{vZdBS3d4R%ZKs720eSX@*B1+{UYoz2bxgoHN
zou0M2*mpx44of&p>arosCw3Y#vaAFIBH^KHq<Yml;)q4D#lZ)W3}ZSTTC=oTI&#P8
z?0gl<+&BCM>ey0pk_QlkrXf-B&i7B%^=OT77)A;as|YMGx=pTfEYqOUftGqa3{(6$
zS)ZT|PBz-WBuWV-v_fgGms2hzn3muj0`eoe@pijjA$)w}agI_O80oU5385S!!!Ugz
zyLnV1YzTA4!6POGOn}!@>@UD)Cn;L)DP>-(*C|`(_XQ?B9V2`LOEbH!)tijE!40vI
zSzcSCS=kFLrvwCD6{N<|??N^%bj~*;K)^AoO=C!m%%=h&wRSyV@t<|eH35v!ia+Ln
z!hE_G&V4xU+RDc-J$6;EfSoU!0{rJTUR^`253{L3y<UFIc5R;NQVFe~#UAi-;`*ns
zPkig|L533u>+J!4-LE$SAKLu|vkP@7NBmnKK$9XoTlm&jf7R9<8d;d_vA$2RTu`W-
z<7fM8Cfkj&YUWrvi2hA+<&Lu(!zHq~N7|@R8>PHiq7<|FS1KgPW(+BVt<v`(7@Jb<
z;mfmw*O(X_mJ-_|fDt}f(XsVDro*vHP$JGNVS9j5A&n`Xhs;-3=CD~LDtZYcm&7DL
zwCbk=Aju*9J#%HI7(|S`ZN>a@L)YGr00u)GUxp4N!O4-ce6lez%y{HDI$8K^^(o8!
zVPgraLc%twF`L_fY(TW7=zWP}mcj;blNjD`iLnUO6m(G}bzbnI;SdoB9woaarh(U-
z#VVAb1@@u`yLnD2+_-~+QDGE!WGSq1lUWCA%o3y<CXs2K9izr|qA#51spPa#dI{f-
z8175?A6#RIdehBK2#pG^1QsrAkD6d|*ix17L3`ZGrZYo*cKNAWiK!w3MlyhyVG2}A
z>e-hR?(<z1XDAJz$Qs^F`i~0&z>u8ogrN`uX1px93_J<l*Ka!f&DnX#eecvl>-eC=
z=H&+OUv_(D(uQ~6PB2Qr@Qd#L+xF2x_x#6G(;E2I&Kn_bc2g@s!J3`L1XmAGIjQ|^
zTwBa59cB^kcHhNTFA295S>kRm-rm>$D6s32)p@ln!zv7Ge!EhvjvD!^!KzW_TP<0#
zN_~tB6h2WkGO76$AMLJ-^RZ4AVXSr!ltvlJ(GKVnF%|=m7_C#7x-1{9l;U&o$Eugj
z$MN?6MH%Y0MquBYFkW8ft54w6aSk6TJp#XMT&5t|>M#(HhzD}Z$!A@-ypaVyC3vE-
zwB7(S0>gIDV>X+EiakT~FtjPD%YG|iH*}w7(`&5JqvA*8vkFz0nNtNndRfJf79R*C
zNp!R@BnhW3-w*T>{aHfz<<=HjQ1s^yJrbDh@;~u3gzUb}aqB}>%Ub-Xfo?Bxqa>}R
zdSX@~=i+9Pm+wQIQoaqP*GM8SOcXsK1IbmBw(2fst3l?2Fe21Nj3FAW%W2#VVn%F^
zkds*5+{muQ#TI+L`86SlF#v@G#(MJ$CkA1(7CaAvtcMnK;1)$CRYTbqvI|$THMICI
zyk$kV_eh^dhex108bbP}I%Sb3OJ*al9!Fpl;Bdhq<R?ax`BnQtHPTROfhJxp8G6WD
zq%!pll~AQH9N7-^Z{DQ01!tTa89d~eT1Q}LJ_JU^hS~=^p^{T#?0g+4G%nIv>>!-(
zr_tELb~w<G{5hO44M?<#3a1&!+^D^k&X{Wmz}n0N`pUgwF|5TxzZ<+1wy}*tN@ybw
z!525fXUz(o%%`p{xCMi>7CNJi5cuw7v@z^&>?m8EYsP#oGZz?dE>oGOd8gFrV;Eo)
z%16SJqRWb=iGa?ul7&XJM2L@4w|>${d8bO9KiN!<5dDw+2!17WHZCcHIK`@zD9?Pv
zB;YVN39k~SE_xEhy<Oh2DivwPCt)HTqD0X(nQ5V*V|pC-ZllZ3l&oT)DActiMNpYu
z<%4mR!tEn)h`c9u!bjk|swZC4fhpD1TZCaLpPF|03K!EQmA~m*RkU0(t7apFtQ$x~
zy3NQPULQimxFu|=T9YzYD`%h@(T}WrXo=KW!*Lrr-HmcnAiD!f(Q~InGK9>{7)#Et
z;Y~G~C?Z)}vM3*Z6z)nlO?Z#Q$_y_yHdo|hf;1T3HSvr&%DD9%Hu_2MrZW)Kp^==m
z$KuR|V2UNq;(~bR%B%(1s+mtu=i{-pW(!jO_*Pt>8E{G$Zwj55_AgA!=XuA7hc-&k
z8;di*+!Y1Mbrr=PYCI1YML7%}K739%&&&oT$bNvl$MA||J9+!Ru#2FyYjkyk3eEVt
zVT+_s5TsFLam8<B4X&~PM?kp0vSnKf+1djOTbs*iLqtoUvQgm2P39v%V;)eD5JOF=
zwHM=+=amupGbKl@WIRz}17E=WD4^ov?n<XqxS%*#`G!l<Csvd8>z;m0i#?Q>_d(}6
zr63)@dXSR7nvkU3WjSn1rL5SJXA%oq{@wK5ODAapMYO6+GWuI<z4<S()9A<Us?Z`0
zMHSRa0hU@1JoIt<42!U`5e>a1@SpNq{?6!{TJmvwQ@4M`VrNk8M;H6TpLR>{FZ$RP
zAC#L~5Sr+T?E!5C3cQb4CTFvYX4k-K>K5yjpNsFk)$M1a^tQ2})GV<aICiw>o0N!2
zkzY1^4kGgC^rfLN#Jmc*AOo?^ARGm=EMYM6&wgf$GK`%*=o<1^g>yZEiaJRzha<CM
z5$Os?_4=wXPa2M@Zg<(Oh;YGp!9y1%0JnMjbocbcuuL=y$@iFBV7laBHaTYyxy^mm
zsSq25O#pk)^;lQ%cuSMq;~$;nCliVCgz6%N{MvBhB9bf06e9DrkB7`6TAt80NcQyM
z!~#r1iNa)Ijl#IKMh{olCJavBeN}yzHcSmXVoa+`jon}gf=Yq0n!<_QPc;ty$pQ_4
zjxpm(e&&ei$i$4-%0^Rq<?H;S=bl3cE_PJ`eOEfIjq?q8P1VZ7=jGvU`?!00cJk(|
z)#<nw<*f}PN{Q3DvIV?84o}Xyppm&YnBi@ht9*m1&Dr;DX*hY-7KQVUD;BJgvgzhX
zjaBf2&pVoA*#Zf^;G}5>KNOmZl59w_2%tb`05mei-wLjIgxP0MkA@Ij<hahq7^vYQ
zVNr$iHqdQdMR<XeEaZuN+RJQ=fcyCutO&vn5jPcVfvzgNSp7f@-Z^-TC_NmIM`qB9
zBP@E5*MZY|6lBgNv<LCk<EtDU`!XwY4#Ci9Hi&-EVCpHnC5u?srz4x%SaTJ;6^_pv
zV31R(UW+Z^vS2!C6{v}d9^+uMe#CZN-A%K4@tZKk=Sf0DALfcI9TVtN_A=8W^O{}0
zfH77OxliDnU5pD`e%h<X96Jj_7;voYxPLl7NnX4?>72hxUclY^D)|Y^?|t}?{IvJl
zd}023-hS6Qxj0W=2z<u}Xu_fmN<ueUZ+bau9xxSk!Y{MgP3GqjU{R5A#<-ZO3PVBi
z50uO?`e`~ta9gk>7J+flG&4b57C`?xcP-;MsLsSpLvoO{2rNVt$3Dv^A(FyunhplT
zo*;XLjY>2mhSv2YsucD;n1a-Xg!41M<|Gw}dYFcVdl0{V_Hl~2dz2r^Kw$`|p=s(P
zmUl4Ef!S5tX?eyosHXyEu^f>|_%(qN4Clf@L}a$J<e>6aQ4b`!k(+8#8jfHHq3th|
zeaF>RQ7pvsaV%_5^g`NL&4!C;Q>e*~0tpY{JwGzOBosM>BSt(;-#Uz~lG?@32lpft
z@-nkFE4GVsUJC~RaqypGi~uhpp_p>d(uUZ2fD^7ZZVR4yN2q=J>H}3Gl5CfhLtSiM
zEf3ROi_kqpeSbzjj9U#jhJ;dLWKcwU<gi;E2<q>Un0p+V=t@S2W)4@vtyxZ45XkJk
z)JRfXMNtA*5gUNJfyQ8>_+|Ul4z<J})QAD%5pz%2Lq&o2!|N2BX98|Q1wRz!puRPq
zh~)wI9qkS60R<<^aGTx^+MQ2lv+R0;jbpYk3|OX0fq;gnm`N*$JZWc@((gg&<3eNz
zOW7El3*<pLzCDQ~HTuYA#L_FD8kCaRKf1v9aod;!W1<A<YP<&cQ!HEr6>mezP<F&L
zS3FxfV3&XtdT=N0fN-8@;oU(vY`mJxrp+3@Un`;1uO=t>DoeP2N$ogSr*!PjW~~uw
zA#U0<b+;*=WK)yBmB=Ah&=v|8QxItWX)&Mzk~$v)2r<1@wfsOeWdW0*#QA%C$Cv(`
zM(Y<9H~V**P75FNmEnPA=@&-wV9sPUb$9^00Ljk?%47cXBH_(7|9JQ?+_Ts||1A5=
zldB;`)PGJMCflyLk`5Ovg*B4Hr>v*002zWEeyEOAc;NLIAc~aeLpt_{`2vO+vAI>B
zYvGo{W3Dh{7F}iIWGkf7kapzbM?3uNRjhYepo@1WR~xglU}Nr+%>DZ}17KEAdaeL(
zSu|lLaDQ)cCjN8g2g8Hzz8ZMiXhH6~lNWBScP6(>y)58Ov@VW2&?!WDe+gTnKbI&2
z_ba(%H6==lSQVFy@T|Kd9ogOl)E!E0axEu9MA4x&tMtFvaktuF7@@a_`bEn_NWw8F
zI)D>&-)9QH{>o=&wZV{23R;vxA9i?`xhG-y*M1GdlSr!5vQ}&Y@X?bXZ><xgz)lFB
zB`$jTdDsVmN!3S91?JwanCH<6=^!wan$x1Kuw>5TOf~O5vCo(D<QFeuxDKbR7XZyw
zOG~tjQR)jRP%R!WpiLHZC>lz*rc8nmF~iy>olB<zq3w<n55#)TW4ObF78;~}F{~4?
ziIoAX`W==};6LG`RW=c~f^4xF85y;SWTNsJ?`UZ88dd7CT@{|a1%?|N1>`0FQ;Z~~
zE5B@fiW&={t%tr$QxdVOEQyZ0EH?1P?YPh7fJ^e3ZJDZZk`a*Lqez@(8ug5WM@J{e
zZ@TaH{@Rr2?!AjntBZAzcxfs`UUt}6y*q#@fJ0L#<4@lQ5Xex8#@a`cB}oPlfWF%$
ze-{JA5B&$g*5bLwJI>(6Ds*A}XSPo!5;jAF;e=wW#$dM|Q|?bc<6Ibtar9JWiDQPs
z8Odn)$s(TGR6$$3)dM8879a{5TW1@D;;(EoV@Q6u8?F&*crc%W8C+?jQLu!Ha+YPu
zAx=lW2pk*|5dsQT!AP@2yE^%Vu|;uhXEtlSoZMSJMJ`yg{M!pWVpS@nccK=SFsqEa
zD%+5;Ul@D#rH59bCQcLW;?Qd(plX3}c>(i`#)&OB{>u96zscdwEIq&mWM3x3DMbPG
zJiDvD#!7zM=%HFLw-whRGS|`t6%(w1z2NvkT9JYaIC9FblT@)_7J*vN!bmb^kU6%4
zi6O}<uXm8o?Fn$;C)&>GnPmxCTbN`zX67USh$Z>S`Gi(?j>M&}MMSxRYh=-d{CCKI
z66e3RZ=*Q+5#wWL7)K}(wE~Hyc7FA^oQ2+ZS$I!?vmm)I7gVQ?nFp5o@<AS7>dn{V
zy02cW%7$9OzdxKbm3M!kbKlOTG9^PTD$hr|`{nanc|w%EL^!iI9+S0|S*($KjFk20
z4y;$nvwG1Y5loB3+l5gE<+d)3uKlSx?no^JPJZn(m|Ev(QTM2Rs9A`*MCBn+N56tb
z7fH3N-8U=Vs@B0kY75=0TyNnYa-%}VC%apGg-tokd^d=9k^HW!a5+OY((}Lk^Rw~?
zv6VIo1h#%uOnZ;gtebs?1>NlZQGGz&u4m7lz<;;DeY&OpYd$+qpKR~^%eMLB+0&=r
z?mRZnZ9m)E+4`4c>yH}1qR$+ph9voy`Q_Yba|@nZ^85eLk2%a~w%Ow<+~~b9%GCTi
z=Q7=Bgeat3$9_J!oetrU*L#g*XKQ<>nfzORi|_~Sac?u(gIpwd0Q5*athUq##>kr+
z^Kxz@9zly98oA8~ALxHKTAI;lr&w$7x}b`MSiQnkE;QrBiiBKjVTu3*T)k1uZVocq
z1u#Ig_7GkoAcE^`=4z>gV?#_B9u!toy(UOzOtC`DjmsPhILcxe33}Menp`N1u2&1w
ztU6}M4mT>$Rw2WYRMF^AOqXg=WGH5;{dq5ojYdYngZiq`Fl2=^)z5o#XC^Q&J~Ep^
zLG9PzdKso8XY_QXaP&m%{Ej&S4FeS*ohz60iE-|}EhNeVWFu@NpW285Dd>r7ohL@4
z&B0BVPbI-Dq2-xDT)=dwijKiGnGa?NV&a#>bmGutIs}rN0!@vHx{88lfDZV#?M~7;
zIXr*Ach*YG-_1?_L;Ik0ki7oU{MbtNPfmY4YrlDWp1eIdI%u7BlD*>t^X>8ZS^M?H
z`HA_Ww%0Ll)}T4~ZSVNUr1jTR5C@Wzv!wm*^r&sxGaa1m9iO*b9do*l_m3_PFw@wy
zkr?qHIcmRa1B%@FNfY`-i%;pz<m51U*E-vOYyP?Sx_#6>{}H=9Y@Z)PcZa6Gz2tQ7
z%!nHoM|)?<>BZUUNe5el`5m-7`$v22cddg>GX~Rd()yuwd=AyBj*f!qp1eOc+P-Pf
zo9k<A>!`i=`lv<Snb{t+&szKEFfI4DeY1#WkVnm=bK2T(!(Uo|ZJ8PEo&DG}%_0Lj
zIqtOn{lYwFeoqee-tE0HbF42}9kWCG7iX<^Fz}N@EW>p1x^vz>zc_CtZ%$4QaM?Sp
zvmcDi)p?#Aopf;FE;_BI>EwJ5x`$TGs+ph7-(O#J+OU4O=*Q=+v$Km+Kq76JJ%8T<
zqsKm2`wnoePmXcUX0cAreuQ>mF>ouI$@{l0^S#;gW1imm*&Zy1QE1xx=lV(0>p7U@
z-DH#F)|;dDo7VAu3w}L;hTgY3tp;sgy93X(sq^=HrsoToK5m*B8~s($auc^UX&)wg
z2S2o7@boaWW=NvbX7VxLb}shc^6GQZpL>7exY6WAis<c|A782OumrvT70MXFH=_}J
zqrNI`i${PbQ20;c*O1>GJU#0Vu@?zo2R}SXGu?i6Ip;WldyicCUQFw<c2J6fO0#6|
zv~Ac7Fhz9>HUVh?Yac;2T|P>uMsz}W1_blR>c0h};PB7M_SR;SToeL3<XWS!-a!g1
z8Vg7jc@Kl=U_{VfKcmFATvr#vMN5(v)LoQUkS7Bsloz>+g`WlqtZ97*DFXX0+~vpt
zbLc<B!H}unu>N|sd9`Vd&B@V`As=!E9UU3+X{fqg(`>E4*jB@zd!KHT$uOge)C3OT
znU;4gxF$zE^H@F)F*YmB_9nyA9AJ%UV7e4A?vP##j&w6u1}~YbDG81761miD$c%#f
zQ<7L=Nn`+26ZCU7+Ay=Yx-yd@3z)J}_f1cIFi)5JZGuOS(y)iu*X9y4UqYqiAtH#<
z1xY(@s|djSj8d9SN4FGL30wX#Mf*3U&h{a7*-YTQl{+>Zao~krA`r^!#o#>(_`abU
zvYdT3rwS05J6brrLhxPF$_=q}7rF+R_AT=C4C)Ba!R(nr<p{}TN9)mKl8p<Sj^58*
zpBT2t5gPQIpqx<YHra1gK?4hyn`vXhcs`m7jy1p^tOwQXXHqD6&@Y&xxGKDDnEV6&
z%3WhwfO`x|<&R=G{+xeOb?I_fnXqX~(UFkcOt9?fpzobP^K+|>th}B!P(njiLA(LC
z#t=Kl^KX30%!o(c`-XwnFTEFGLYza?g^6-eH2LZ}Eg*sw-x@NW+H5+{EU27aA$#oP
zq`32jrw^lpM^M3JHiQzu5IqZVd~PwZsC*qV(GeRS%QRB62!1GMB|5VP-4K83X9IBO
zzT5k27e$Ef>%H^+x1Il$Jl)>8cMq7nc><zz=K#tHePb-OD*6f^INgK(^U$c_eIBiA
zJ}YS0riHF)W6bNfs0q`+pOATS1{W-%Sc+sEZexBbP3gmPX=a5Ma33q$@LO0*@L9~Z
zRV(z|yYBFNF6o<QEm(&mC{eeb$zOFHT{beS<z5$K)i2i&JlU(WHPb!PP>$XEoRPz9
z9Wq48;R;`GyrSJ=S9Z5&3k}Qb!DE!V=<H~m34&dO5g9fcl}vx>IGgQ{^6X32^IL8B
zBa-b`IP4U$hhHSa<VBf6&DVb1o^+sSVE7?OkPV)pUB;*OTHWK5<Cf<^x0|!^DxC}w
zli?*bL67mAx6nBp?)F&*dsMO8l%)sBL{O=iC&8Xg`_Oa!EkA3$;K$}7<NW3+_LRWo
zuS@xshDPZvFt$V3!NqhKBfj!_@MiT!d6AWNxJ)dOWiriunol?%y<X~-7HVJ}zRWO&
z6;u+?Q;9}2c?Wdz5_*aF#7z4kQUQIvu`N*n7!{t40Cdr2tAdFYZ!bD!N|NM@fXY=4
z$Y~CQNE|s_pFMfeOGUbY&337tgTAa&lW}Z|Pnw~yT;;{#PCuI~b2?R-N$^(k08YYL
zYwrLwL$@B>!mlq`{(K&J3xX&Xy=6pI)tlA;+#3U<=#OUuvq?r8Ga^*&n_@Ru!TL95
zmRn!G`O+{GszFKyt_94U`V;0d{VY7ry(_B)aa7&T$;H`zt9y8$-*%>LJbB4_qYgwj
znN7R11}-ek-3$+o1gKD7F{^%3|E6dlh$CzS3>DxxzJnA=Xf&VJl3mP>!N@2GsBEZi
z=y{(nudsBGjfH*knnl~UQ-KM-Oj>(y_S(n($tZQ@lj^R%=?T9|Vhh3`B}r8M9AyrB
z{XX)jg<Ld7^s90&ISc>;2k#qY(#SD)-cE0@yKtz#p)-wiiYpGIWa?oSPR*?+9aK&I
zjWSAHjmWWPquJ3%V>HtOea2Ym+^WKeH6sn$j21@D5Ka8X=l~cLpwui|cGjtFR92dr
zx}lua@Dw#zG2q8I#-7&@V$I+`zv>mIE`J*IKY*K#J%$sMLL%1yvwkNhz+S-9_d}wW
zWu)Pf@t}_Z6aa}do}oq+m9mYH-kwQL4y;x>$P$5dqvp(n=hs<8H~&cCq_+MN6zI14
ztJS^CZr$qUpb%OL)kXjt3RLl13UDG^Unh}lQX%R=Um~n@BU*g|UB{?_0KtwLV6_IP
zTJQrm;{?76k*9r&dT)hcL-tJUjU_Ud*~|}cF9^|;1j()Fof}+<{+Mb_U&5tBCp|P8
zaargf8~u;qF@2-Jt-@ITfJ1dh!Z0Jt94n$@RzVXhoLjE68P|-_3Iy16nBzwQlcU?<
z%vwek*yq3vriwQ8b4+){5JTO9Ce$RI0QlCFY)J8AR88LxUMByCh<lL$s$O_$^$>r_
zBO)t3?{qtNO1y*Pt{G-2z!_xS7A@8hM10yW&0)tpIcW^NTZGX>MU?YTiFo$_Q5Dxt
zB;CMP$dPE$lx2Zb2Hlw`$l69FD+peVz^EV-HXoo_3tqcn?kw%8%S}+?V0Z*VuWQWW
zL8pT&C0MD;DVPf#7AnQn_GWRr9p9e}11UMlp9Egs_T=u$@UmQXOJZV%ecVw<<t_L=
zTf;2t>l}+ft((!VTQR{LATqbY;T}3eT%Ne<wz2bsp~yMdkMSfV7zqsm2I1A&Y}eG>
zepi3oeIwj?Hyp9i0vZv%f;=sFGPo4VqCaETg*7lpG+r`}Fpv_XG3yOPXtUL5`1(?7
z!J$zuiz|AwNw3kH&0Q68!<DAt(?#p}<X!6>B_>Vs8D!(5$r)>qVO*wlL|aVCgiVJx
zuFw%Rc9o5@DO;>@azg+l8By6ntjLfe5#l44P`sEm2}disxf=`(n`VTc2*F|O>PPjV
zsY+lfh;71$%f>}0xS1hMZy_jf4mQ&bLsxSwgE+cv@IAn80NCNej);jj0dP7aW9t^l
zzFlO<1q<?sTmnu2!ynUSA_@9&`d@)Gev4^AaPw74Cv2Jp+xcfB2d>XP-`Ru%&#Gp?
z=PqHwP19h(hA1|@kO(vMz8e#FVW}Pt2!7FJ%R|hL8eUIWii&7JuKvF8a=I|wbyIdB
z$VDZsq2_5Wh^B-+ODSO-+!d4!Hrw10_+c#j4#~t=yov}Pz%c+xff}4yw<KnYQ+=y+
zETu{eZQcgj&>v};3gc8CIgtrdJ5YnX1bh*c#Ui2ZE}GTrG0Js--bx&2nLIN5(5$kq
z#@Q>D^T~V}oR9gfDun{GG*mi@hrMg;S)KH?nwht9D#~j7+cHBnW>S5g#7f{w#QyAa
zx5%I(w|Q>k75(dZ?5VN;*c|@3o@{SzDfCBk9?c_?<XsW4P7k@*`jRv#=U|N7i<uCf
zBD83s;Rir1K=Psz+<YoAjfl@>{eDB2f+JK=2!F*_3H}!I2F4<N%<|knCSz-w+;-BA
z9b9;IvwmG-C(Y!6bfK4kW4tkVn5K1KruFNuu4^F9lKSJXf_dD1(>^{wi&~1eJOwA&
z16Uk)&y<8DP0^mP0S9o`ZjlGapozYcG%Y)haw7RP<UsIYk#x(KX-IGbMn3$o3B$@h
zcX{z1usygOM^84Om)e|s$5tV<VNtVUZw^ui)D;Il|2{O2I&s)pj=Ag4m%glwT9J}7
z)e<c(epITZ4UTB@rT5{3@YV6b`>MZus(9Ke3sB8El^Hy2$S|sD%wA&&(MdJrzra<%
z>KQtlPr&zRNo&vlpN$$X#eWmF;2#(K{Vz-6zaKx|dh+yf5dZ!3@z&FS#()1KK9F$d
zA<?4bIZ3A&vIY*r{gdOv_M7BQ>-<rtbuK_SVT4yzg!tB9HYiNIla4;87%b9BO@E`|
zWRfQ@Qp9Qd1tj6CYoq2H?FMwi>sJ`U_|IVSe+HBPGno9J!Q}r8CjWmcnA}Em*Erwr
zV@-X>Kz{J0iv1q+#<Nj5N*rWCj0k_UzVSzX=&pl{lWt7lGaH!kY#7S~6Q=&i?qF4d
z5J?i$TI2aO%d|Rb2Zr-peG3*oGdd&Zs`s8FB)2qjoqnM@Yu!mc8uo6xnfdl75XY(c
z|Ezt^M}}#SvW?MnUPImZUF)5p!tM_zM|<b(qgMCm?Bcg(>FGh$(}$6#r{+e;uWQZ7
z^M(r@oV+W)GMkN}&!3+k*@x57=u>uE(9qqphVOje`my5;+&(&pKYCbxv^;2eIvDdf
z&pr<^Y)e0Ue9~<hZUJXro&<wRGuis>-f#Xc8JdP_LW8siB?2Ow1PYQ_Zu2=hdDAsV
z^UQWW%6sW(3x0&3j!yRXj<)<Cx4j>?{U3L{A9ws8AA3JO_J4fh{rJTH@u~OYQ~$?j
z-jC1xAHVf}{C3&WnRUZZ|MHrlMr|59I_e&@USGU%B$iDt^CF|43?qJRE;F^4AQRDV
zl&)=mGBN>VveR!|BGMaPWMk(>I`}*^(nuE&N+TOPL3|6-X6ND*ZWqH;yBDWew8VBy
zNhp2)q0Wz;^VYiqN3})(@}Jl<x9dUc+}xdNcK#z^%Urg?P~d5Rg*Zy1hiIVNBI}t(
zq4Luq;NyU0?d-=+YhRrwsL1C%vv*`}n~py$_v`V=vN8EpLPmMokL*7K7n`QfTBn8x
z+MVx@%!O<SYwrO51>%NVzkIv_fVa0B{mb|p<{m!o9=z@vdE@*?w>LNGr0R{%`@PeH
z*URQI8x>u%c^|usi&UNoF3<T<r^}dAW@F!~MXKFqMdX1WTW)~`bUE_a2}&h<N6Utp
z=hxk$XH>mz+W)y?j3+1Wx}E)#vsQQS;NQw4bU&Z9fSdo|&ek*ow*NU>{8W00NhDdR
ztG(BqlOrRlEv4n&s5_Zo7W2z4mux7{#IS$J*%@ae7&GwN?%~ni8({t*BOkYpI%?QO
zHd9Y;E#>qnz^ea}b^G({Nq3Uo#%Y(%>E3bsy#2pg-GhsFr{&f3f7ZLrgj9Nlw!IS_
z<D>QDWImhBXUXM!FhHo9YtXJRafOj^somH3`w{-k!czH%16tkUCnhy47JTyh;;_4a
za&dgF=DKBufC~pEZ=>K{gBOwv+yA+}wew^h|JZr@teLofK6}zkp7A?WFRJ{?;~o9R
zpYa7szCZ%NgbSYd$-ATjq%CzkFdJhy7IDn{jz919fBpf4K{Y!xqjZ57-MnBvJ6q<D
zKW}X%+{GJkcZ2zo7Hl{kOj8p1AO^xlePa$zHZ3Uc220i>*kpGwuA9GL#C1dT(K9l4
zZd33ccyEpJijOx@b>E^NhGYD0Q(ik^UNE}FbV3Nzr8<^mU?pEefhaheG7bt)v7><6
z)c#n=ohZ|A;e(ih1Rex7I4NUOQb#OrS!B;fW!r7fbS&av#%2LZceATmK%CVGz|2c)
zgV4@U7o{j<RR&xh#jN~SFABahmS!Zn6VC$X`&n>1L{GOE>Gw*OIn*vVf0OY|p>(5w
zi+=>HagLKT18ahNteF7QNOA;gpJrH)0ncZkOI+sph&nrf)DsuZzfMDaPJZA_s7`7Y
zFaRyj2TdZR17Vr+d`ju0g2-hx5n-r=5G8H%x7-4!`Ek<-=}M)*RT@=&T~U3b&Pq<x
z(}dQkA_$yaDJP&aC&+7vZ5VMHdWGr<G=%yUAH{y&Bg0t3@7>b6>KhX!km&C)3ZThb
z)pLqfBr!{|Vi3Otd-lAf9})?cc9qAY_Vx5D_H@(VRBE)mtp_V@>E?nxg_hU<%XU@w
zj(`0J?5qsLbOQXKi=t+CmUqYV(Fi+wZFW9O$KvJ1c*8-0&+)Do9Bm$T^7$W#N2gtd
z7(;aA(@?3ZXNim=gw`)gR8~N~<Np*IgTek+QJC!;{_@|Rx;h7)zXOG7`YDqaNWA}u
zyGi8kb?7j-npDPqhKiUOA~lJrnl@>>_~%{sce(3)8c;NXyD^4LnPKl7HigLJ_~Kpb
zti4aVMEm%>S^oAS{xyI$$DXeE9x<L5y;JpL2UM-t06LYwoE#oTzlX3P_~AFb5an~k
zKbDTtd<+|-Vv^u!De%$x7_k1Rh<&m?*RZ5eOJ#i&d6a&ckAi3Ug~~VNHT3}G8+W19
zuSP<*U+Qo3!2rI?)mIF-ygswRYl~S1FVTuTgS9R)nsc3O3A;l45c@U+z8NkEvbb<T
zdW(OT2sK5={P!+w;&Te|B4Sr;8DmG`;oR$uTXQQ4C6K1wO8~>PGso`|{La2E)30b|
zKADu7!S7aSh8Tov?C-=DT?hYF%rO{&`{zG|QI-z5;sbQh;a}?X2b$k)RzQ+5p0ZGX
zpf8?_e5Zfub3k@*SHnO1&oynUANd<_Ny(VXObh<m7N8_oIeuSE26D@zX}n1(s8YP0
ze!&0&pRRc8Ffq^2k9na{x61+-dgJ-xj^+~`8PjQ<H#wlJNVf4=u_A22ztAE;Jc+<o
z5UV<a+Is9?KqCSzZ<7ru7~>CUE@+sM0@V<Bpv)s44FU+QKMfKpan4O;n~4!&dA=^}
zrzzG3Dg)6+_<1n@G1nBNZEsbtU^KR*TQga@zTDqg3kxLpeag94+<>wS{66`y(kg_G
zQJc!ZFA!1c^o52{rKP=?er@(Lo%Y$VS>c1VjMC6g@_AScFGns^g<{X?{fMq(cu`si
z^T&UX@dxM!0lzqWh11_E+VbviD2YK$9>U+;n>J#_Z^A!+7P8Dvt7ML(5i-_~y`b!i
zx?Q_Nwl#d#js!*P?8_vFDdIdCL&|IIw_qd8Mp>w#lY{mlhKh8Vy0&aS0~fr6AT}t(
zC=3EqE^LcFn0x6XMckW`F9anXF_LmqBObNiy}LNqqo{8i73jr_tp=TdvA(>~3VKQK
zZRt$d&3C%JPV2bS24_dm-Zr*(kfV*z$sSbD6_b}RGYKrpU^~Zc14Cm#$TX+orw`Bn
zE<qFQTmk-Qsi*imL`$G0owP?@3FMw|^sut!jIs$KQj9?GA@rvE4zk7^rr4%$-G{N8
zM$xig*D51~#<@c;LB<4}--C#GIPj6QjZ#rHezu9tSXd?a8lyMly<R5u>L|O9pW_)w
z1sOYk>>j7jdN)?~<Y|L79_2Sw%)`lRe&j6zhE#`Zz?$LR7Jz352@m+LnzRdJSukr`
zUmkGZrzuLLaE{Bvm9{~6wsqH~q$e<BT7m%s_4)L%d^t|07u4pmbqQ|?D9cw~+pGz%
zc=%8F@OSi|U0ph!W`7}<LHqddg!3jTzd0B>2BDl{n2#-E5DAZ8FvDoHP}9QW`#%bL
z(I0unOA%P?5BfW>64*TyjA!|<P77#@ScNCJXrj;6on1~giq=px507*8?3Q{~p`4ku
zBM=DyQtWqdjXUY*>@=OG*F~MRT+?Je?iWOC<XW<$l=2|vr3t<S_->dn3jlB7k5a%w
z1ReRIv0i?5l#L&53nE<U*Pmj~f7s-qVihF(+udI0$-$|izg4^rV|(b958czH)zf6p
z5Mp6FRkQQ*-eSE|ev|b7AM<RU9p!2N9l}VW=@)9QlbF5^)ii1IsD`LBbPm15SpuPi
zcK#h2Y>goSc^zyE=9lME85jRmM)6zFhHN6gOXWSwEll&vpVu4fIL6=wEFk|9W@D7r
zI{YirBxD_8F<ks5%ow9Gxk0*^HzLXqA}GPL^oE!h*9PU^n`Q)N_2r+9hQ2f)czv(m
zhjKdS>2M^w&3%|v>Eb>$`3qZ)jY<K7<UO4dEJWzh$8BWmxT^dJ8s8+J%tr|Ru`Yy?
zdqFbn+cgZrdf*><>Di>ZmBI_^LOMlRt7BpUD?)^t_)0QultU9L()q&YN*l$Oi&s+C
zvxgw4;dF*s=4Q;8%KHGGhxm&STmc&bp<(TBTWgRP2@SkRHg>kQw&b6$Abg^f@XKkH
zjbxpm(`s!BY=Fq54P5jMv*;AAYZfjO@MnRuy3A%bkm5{T!3M%#Hfw(V8guCVZtLtU
znj6f^iv(-MH&>(Phip0=+`9Y{rU3^vAad$0LzCnHZ<Zz;TnM-cVpSk`T&o>(#DM4}
zkm*p&ILd$)Vu1M#!_Vg8yrN_mM3^c9>=0PUGLb<1T6=%*gV~JokMH)NaQX+cLE$>6
zhhD$gf7?Dfh_@ikFQ__q@<yU6<9UoV&?aM>?Jp3n41|_o<w01JaX#LNt;_w25~#J)
zQ3ko=h}Siuee@DsLKHg4MaL{CAwJFo0_)%~pIa3k1~WD1<Pso{p?W>^azkYoJzr)%
z>UXQp@mC#V)g;pH0*+-KP<Hu+&(R^!@2EnaAi9I0OA^nNr3ZvNOz^%*$1`UaMMasg
z$OwhZoRQ3{sC%DSpB<h(uP5KTdW#oiZS#sL&J>#k>`l;2@Ra+2C&?M$pWz0n^y<}C
zJ3`nC*3H|HGIpZhn(#b8&0&)rE!fiIz_mri)H%wp3gCI=1+)y$&%vdY6>$gbswAKD
zRVAy3D-;+VSedelQ1P7q;;WAGZE)@Ilh!V@34Pb)Yh`i#&5jPPcajBZ1W<XM6(OzN
z#WXfrUsX+T4A7Hf)U;nhMBgl*!M}^9zH2e|FduZ)lh%}O#5Z_eJ&Xm>$X(>{AMha(
zu!_lOI0G4nEl}oGb^mHKYmni+-FzS;X;j?k@_QNKSR_(+x<xYe3J}U%h7T3=F*eDp
zqYnbnbzQz{){?)?{x&tk^C8-j&Zpr-a8W3o@N$%nKk=LcXeVjyr!B-RS^E=;2jRCy
zYG}mJNT4@ZJ_6|y%uBBm7JX%*K~`~7c%Woo84<k@FS*U<@nU?Lnkn@%&;)XH5{`rG
z2)YP_j4PvblH+hXjS3mEcAS|xRy8x>Mxu08ilY2%WaJ#nJzzA)X1J^*oksvv%sPN(
zgll1%#o0E4Rp3(+6f*oxQ<RbW!0SkI`PPSk0-)+;>KXajm<;)q)*`Eij3|j<!t!7w
z{&4mp%j2o;Jcp)krlEx%`B*kY2K)yPl10tnLk;us+WF5?t9HB0$aku$RWjk-OhNiK
z=kyY)2@f2_2c#ySILVcFRFCC;nFpJD)MLR-JXJq!f50g22Z#e)G4N$0D19Yluw8z7
zN!dv60AMqJB=KwdZhgsm^O+TE2ncZaxy;>S^ijJUj{CI+kPmMAtH`#)dHA^r4!SAI
ztgL8zxQ)_>d+3!&D6iYc2YUwxXHc>{wlPdi=Q-Fz$G4D3-dCNm+a~MRo-f!xpL)Oz
zWtJA?o3Ob6f(Z}x&vbG93>a4=GQmsmP8adl%unT$3m?y}Bk%n5^M}Tw!G&Ggu~9dr
zPRh-zGO4(aKR?_KyNu2QHqLhDs3~qkv=lNQ55E*p9DN39=89HcMreg0hC=uq9**A>
z0J308+N?p!d)*#n$_x2(Fe!&>WNzhnldqDkZ@>L^0hx)$PVcaV*QU=GD-zkVH3K=T
zR$@a`JePECG#a8jmax%}Vcwu;^w&#SA-Z;N*Dxx722aoY$qBR{O=k8{<&ZdRXz+7x
z2Jby8t?qp#AjTHammecsF>VVjorf~tV1jxa>y-*kh-o(kYdKR&q%^RyQhN{YL?1@I
zj9Pw?Yy(}%yD!S(ihM#+vYVKJr+Og?(e%S_Dh%*qc^9L5u!;(KQ;uU)3@`_(RwhRH
zthif|9-~xmuAU|A0o`&R&2x4G%S8a><CQHIt4wV_rHWRj4NyVXzA4tABtQl3lw~No
zOu#sAL`Wg~VpO~Bub#V6YT@`Tng3z?s0B9ltHC6=JiV)g8;kRF{xQ4+N{2xeqvuyZ
zfw?aVOnJc}gaPnC2?P(J^&zOlta3id#+JiuVn~IJf+7&m^6IYx*O3Mg^o?+_ZDhz~
znwwv*6R=-TH#bY@i15LcGBX{(2!h!(YiWpFE7RuJ;%bw8=oA|%te4IN;;dhw22*du
z$q7D8fp$quU$`tpg)0ymeD2C122`E~=k?Vj%J>yaNHjEH)U|Yt>lqatD(*otPSm0r
z41A(*artd{&l_v$awywA_;10%AxT^4hl;F24e-c`iE+;ay{S>&x&y!F<H%)?9fuuy
z_8t8x3;F)uR<*`Hu{Z}Hvy$gEDYb(zv*JB*b9&%>C*cZ}UpH5!lE~B#uaaj^pFVyH
zKdvjE%L?KdHIfjB-pX=6j{sBi1uhtq;ydSi=NQ&>+}b~1UGxQ?-o|zMW#gCO1pl4^
z&J(!d{UcNo^A1{j2MMLMdyv_8?GLS~OAhSUcQ?%tU53p#wIydwLL2+TVxJ8^>%D7`
z14me-fxoP}jj;O54Bb`bLucAqKorMNG|}kcVs9Ek#I`r|@_|}JGU4)(H!J~jTsE`4
zpaF-&`E(8(T#j&)g+e%k&ktv|YN&0>#qQ}>XgSOT`@`Ps08x+Sa0wWmwQWR2fjumU
zTbFiTCI{{P^X|#_A($ovf<xHR&5(ROXsYjfBg90cBsD{U1bPUrrGU1Gj-Z|3I~B;t
zIL3Z~cyGj|temp*Ask+5E%y5T@<KpU=FjVX#huSB+;^)`aqr7*01Z}L&tj5@5QJ1q
zz~V)BmGxJ@s~L-GgAH9Ph?brJ$**_m^=etN{M<sZa`~tsE_;K*xHkyJVFOVdaPYCU
zmiat&hL5uKsW(as(B`h779(^4sVuK=F`O-aKqC1+<}$<@yn|VpGr_lA8#7c^S*U+R
zVg?ma{;82A$UnV+i(QPTrh}{T@E0>Ij$o(CV%Xj;mGFgdZfo+2IEQPgg;Rhc$xQ$h
zT%+4^jotEqr#{Yo5REX#06weUs<3bX9-LiEfCb73fh-6gSjO<l$CXcZV><nls2Zc6
zu29V7uE?$s#YNer<wXSX9LS<mZC+T%-?23I7{P9KbF<`KTJN85Pd{wJ+R<0t%i9^6
zB;c!x!&ub{&fjmPOviU=MFq-vly7Ib<e<lVzCM52P9BzA)G=#7Rs7KdD||n|kfSZ_
zEw6B1Eg3Z6Y7K5T09b93_OcDGPPfEjA;}G9t>jGv`Y*_<d!A#$gJMIaDe~)8c8);u
zr3zHUVnBdTd!Qae2yU`=^{=Di<1b&by|v$So|#Z+Il3~bu7$CuT#nW4!vGAo+=Bo=
zc1t6JR`>Rg_Rs)k<~Tjfr$=M~bq*2ojCL{dDi$&!AJlgY-Twq|J0Hpm6gb<j3vk?-
z-aFY0x~2_nq4pjT42m&Z2}}<X$!h-EXx3VcjZfUWpP9{L$LlKQDVf`cCXFd(n?e#X
zoqgS=FSlJujN+1g3?ohDj6RS%0sTTdcaRt$x!tJjqo}dm@e;$V5r&3xb*|Il7z#KR
zx)vJM7N-O~YBLnj!Pk)Nb@oo9Vy$>Rqi2-H&yl#?Ji_TMF%iqN&MQZ`3uwuw<Qe)M
z+WLdsrnpHRZdloH9&Xe2Y&Y3R(v--9WfrAq*um?xuV#f{#Fg&g%4h@m+cICM3UUMV
zvReu$DmMN2Do>;}3L-%70X>)PJ~{~4+KvKik{jpH8J2V<Ze9p$ty0T@uu_0nO^Mw+
zrf`?btK#N)4it^$PazQO21GEZU1r$IB?5H*|JnQV@5YTJ-vhlr`>)_=j=QVeQgs4M
z0F>SK94*wo@6yaX9dMCEi6Ui@s*-fa?{9y|_ykCRo2aVt^nG`3oo>4<0g24W$jFFq
zY!b>M;e{~N&8s^ku2ozzkw>ZjG=et54VTHYz4)>1^_|PLi;sn&Cw|R8@yqzJdY)d_
z)Z~q^<cYL%`oN|W+ms0{au1~q0e?_B{VYEn>Phh*t)G7Ssj#wew6K+Cd<xc{+!VV9
zg%8y3{;~71kUW;_QgKjTUO#jtI1gQ6<X=XQeo&8V`RKuHRr^_&P$v;G+9y(ZW!z}L
z{q~z&483PFXK+LZWO=NgOxyEQ5I*jt@o-s^-t<x=qHj{T8H;WILt!A*5-(II?UvZk
z)bad?neYM%7f_!~UivFF9y@<ck&-l#H<L}1_j0D?$`{++o8HWXwRNbp!~qWBMhhS)
zCT!KYDBPXiNNB}GH2z33F<q0zK`=WVPO?6e+1=9mF?RjhWO`II%l=p^uDR1RGQdy6
z`qIg3zMk^FqyJ^HmyK4M$EWM+CD7D*k+}kssQZDf?&&j`)3dd{Q~sN$$_?(Mo-ZlO
z4ze1DDrZutMH$t34kpWe$oN@$Yngd;_wpD&%1Hm*$Qx{C#kId8UwzhXLFzxrGR7OK
zQlGw)JuE|Ry#6Ia*5K83z1tBTZiuS0R}UY1$%J_%J+npCIE_D=b?RULOX{TQd1(Gf
zHwEpsw;OUOg(<QdGsH2uu*s3W&{Qm?WbBQb^^3{A%1?j!Z=pp03e#l|h?DeSXO=#2
zCMJAl=09?48}n2;UUnNM#pM#*`b+jw>i_UhN-*pfTgdl2`4iF%)BJAbuui>u>8f*F
zCf7l;_Tf@a)#c|nF|Pgtf{oVMtC}a}|L5Fq&O3Cexy1ilUz6Q*8I3MIt(Vr=mWMz7
zl6@!{*gb?nEJ{!%u3g=Cvk$omxp7**j9h>g`G|*CF?*i~+xz(Wd#vWl6-4Q7C3>y<
zzhfCq2y4&&rP&-pB!*WZ!GFm)Pma=-RBdv3;E6`sbO}fI?u<`*F@DaxxNxQ~{#KCH
zO{SYGbu@}@nm+p{Y<;ttLH^kF*}qVTCciAFHoK_mCP?1btwW2GW*73cYj}J7OIPdV
zQbK6?l*ilt*L>1*zVOUK_0OB{`D5oQ-)0J$gupKk>)q5R*DILPOT=zhZWCqX7nO~@
zicXqL=FV}?C>elFl8KH;P{kK@nh<Keb=Ce*o$W8erA?Mwu18T#k5B)1`3&E&gA^wW
zQtS=l0uTE??JGs^iU9xaVcx<Oy@+MNz`qO??-1Z6#}pG;X<~Tz<k0YOLk)+BkBHqG
zSjAw;kkLVAwYaK&8|B9Zg$9xxE>4V<oi+qq<&7s2Ct2&rXpF3+nefd-S2;*b`j=#K
zorLG>wNLH4fk|e&)b|JYqo3R8JQR-eD1qZ@t#mTn=T2=R#H)|(j-1-L<dx)jX=TzL
z(xLU2MFjOL^!!yaNmDdTs!(YoYaKFM-gLCMOoP5NJnE8m69v1!BuUiC=BhZKuaa3k
zz<RaM&J-jk$h|+9YU_TM23E@7r-}+scK|51Iy*&h_@}{8ut9L)^K3yUIC&#;(<kt9
zG5O{~^2y#9V?pTQiT9J`Waiy=#uD!><GW3My7&K>z!?NCkKl~i!tM8D4wv|z9A?)n
zu9HFZQg|SlS+5eID^$mXf9@~;r@~ypxnc5nV<-Q>p?bM~`?cWB_5yp8|1yKA5yG2)
z8ODBx2{~dPM#`1`W(>yr%Q+jBQ7|gY-Tg_E+y`7s`Ly@X|9(4=^PYWH^seMrnF!F4
zIYr4lg$gcN%iSAf#(Sd^kTMT@{fEuyNVsVTIhL4tg8q@^qLoI!WPYAovU~hyp!1kb
zD*SDP7bIU7WjL6iS3G0@F6p^kvs)&>*3f?S1K2YU|IHis_#5%#h2a45NwQ)}Q9-nK
zUe6)6oATx#RRoOoeC9;uiqs8D1m?_=n<;G`A0?~sWvaN^F&FZL*-s2r`R@>ar|P<j
z3->Oa@}Vh}`|Qt!e~9n*x57VMpg{63=b_hsrH=aFM#`@r3-)`;uk2*AUKa_eNVce1
z@4I+hTn!q^mwG{aXFk@iT>6T1=uH3oRQPh!ZVrOziWa*PdDUtnrd$kNa;RyR?$#IU
z2eSjE4as}IOk-+roj0^^Oso58D2sj?VLV3Y3RHRvsYhkBraUt#V(Ig6hFCiEw*?wa
zz2g&izRv-<{~F~Abbq*pQo}#JhI;Ob!4<0YpWYS!-K+SPOJu?wF?8^HJdmH!_X|sV
zCxZ>daAj_j$st_s!SS(Pmm@E=zZJ9h)W9Y9e`&nbw_m62_Q;T`Nj93W2ql5Z#+&Mf
zDhymv1$Rd|1^F)nXRLRz{L8PyHK~#_JT7$WGXkI^nrOyY%2U5LZ<C+*8-@=U8!zWa
z91;VQs693oEKl!gBEM3EJ8wGXg1$ydsCR^6B_e7k1-umxNDC@W0>uU1%|YTS&HkA5
zmQHZyi%VLswXf$Ml3%xLGqcH!Y-XhtXx?O(jH_mTGl;%8)gj!kGjS6RsLVdBZ4!G=
z_sck!U3bUsjr7M5gw>Vs;Oft0jQuf$hV~~nM$bHMb)Ftvc1gWgZo8MkIl>F68tnjd
zmRVC)0quLhc6%ke)1-m4q)l8%E3NNtQXIJ1l&eR5SG~1OK%;u05pdSe(qtu;8eGXL
zp;FGzrr6lq)JbCzQ~geyvx7a<<Y#lEJ+?UuVC=64k;tLvbi(Ozo^ETWp8WTkceV!5
zpXVxE{U^8zubto&VK>5KRBQMAKN1!s&q<{VSE4aFM=cx|v)+KGDBZWkr{>*K>Vs8(
z%r9?0=Nv=-hJWbi!puzW75RL<^S8hK((}yx#}9v~zuSBqxxg{L(0}goq}Z!lpUXV_
z))kI-mVU!Bn@yjGhvH#n;3-x*B}F8(;5`(`xWHE5c7bJlM!tsC$N)dNxV{&Pt)>%O
zu3sf0sb1T1C9$$WIzK6`Tun8R2?GH<o?rUUzGqEWkSWzQ+WXZWc6tf&kzOzVe81Kx
zcFB$a*Ng;y@|&FVXANLsL++nz=l<!vk}1PB%pxN+^sFDN=OCN35P9g`E5V)i=Pe~$
z_fg;zt-P0a{tQX*UZH}trgp#9z_6-0cE~}AGOR4>=;_Zd`FZ9m8P)DfT^(C^wQy>w
zf9$I5!e~2v&)7J&6FhQYmj)98ay*c%qxz*bD82gOZn<r6gShf<0-a|D8qEV>qrXfe
z*hYx8ANrd-cCq588Cb0|`jRn61QN<nu8LD;=3^=!<?2k2M8<lb=+{kfG@SYIwpRGD
zHYR+}^>#}v5LfDFs2KNcuW<M1cSpW4x+aRF*R2y<qgInxVngF+7vqd#S&74JM`Gn;
zb{nVJ`?focGy4`Mn1Eq_SJoKaK>K~n(JB1cY(Ay`7{?|#G)u6o+cBj$#-lg4!zj{M
z3^52HjbUpC;eDKXBxUn)Ogoy+e;V6Pa)JE!GxI>1v2l{T=w}N9k4?$?vDu!P{g8uO
zd)t)%(wj>iDuDK<%5^Q6GMo3gj(oOXCdCm;o*f{Vi#FFjAa8!{-$pXH`_p^O*(3dr
z{xZBdeh~iWo0p@`X#mq3&e6%uXTnZ*M&CL^1I`W?D47IG4cz#D-j<JnB1cH@(P*Tg
zkiBjz6H&#FZ)+~&fYH$uIIMM&mt<aFy?zNs8nN2==@}V!+itW5i!9C#{5J&-oeZ2}
zjf6kFwWrDVM~JxmPlr}Id8zI82#kN$e9x<Ts4Dn-F6r7#?~t@d6%8M9EA_9gf$x6(
zrS;b4jilk9b6=@#-c8N^?f5|~|Jf88nAKPQ>@)#wUijaK|B)4^o2p;GJX~MhSvWdA
zC>Lh_wXjMPC=zn>)10AWmSkCxizGH2Q5}+M7C*jdtLrvdWUk=8t2dVq3~&?x50@5r
zE~T|i!$F|(W^EvlfNZ=@yU^(V)%AWWG#hvI!c4Di)J$RSH)+)3Vi+W2kMOaM%ZqyK
zXck}ct=IZv`=i*LPs#BJ?PXV{o`}1pxKm$?J2xMQiUul5q-DYa(v_R1HtR3$!6lcm
z`B?wJQ?CC*wsB<dU2o_oE`?hDL&saLQ+}!aI5ZajO-HZZD_hALr+mllRhliFI=$&%
zDIMB7eWnx2yJWjw+VZDrvim<s?W1hNOZ_d)XFq)G=gv)fY>L*IKe(ky7h|~MsJ)d8
zu$=zzR~2&uJ2jh?LCIoolAraH9u?alzi{-Qzq>vtFNNCE!<0|E;D*f8BY9#rH+GdD
z4!qId!P(sSGMnD-vM=TLeRgP4LoZ2Vy74QK9A?R`e}0gHUw{AMkKuhdOhn}W+k~kn
z^_@0Bdz<EtY@PnKa^l7xsQwP6`KXuOwxqphnnq_uWj0Tf#tHXvj<N;qk=u2cQ9AGC
zzOZ-Uxmq|YZGBT4$^>jlFL~`7ky-yvFT|H`yM+3uM=4U457NnWyvS2<NgwC^xRYzQ
zmFcdPol3%?m)*G0%uVIUbxzj$sJfm+->BEJY0(-6_gEiNfO3DNmNOA*y$kKJaoy;r
zTx+$}%$yQ!FVW=_e&|gqKPTyA<2=a;bAD+*x~u_d<}2?_o{sL`r<7J{C!BsC;Dl|{
zL}+EdOoFG2n3BsgP5I7kP(RQwWzOO2fWe$VfAcD!v7P%|FOAy$c<#5fkx9P=Vdm$_
zTiA^_ag$ps{dLN9nTCUz_x^qGslWZF)`RG^aMLbq83+DYMI$*l;|Nfb)x+&a?J2KC
zXu(Hkvn^v%(#R}+N=xgl)Dwl3KC`;4ya3SL+0=-V(2h|F;7uVxr@JKm^0F36uYljk
z;k6Q=eq}Zd3mM%)uQ@B4%TFJH+4^M_Ap3&WFzjbkDD9O8T{K@p{vm;*l@DmvobdP6
zQ`5-=*u5nT4<n6wnTp4*mz!%NlPiCaIkmG|l_PzLz9~p(9kNh!4V9e~klKslnM0Lw
z<!zE5cH2*hZBZM;E!*+q-9l$Co!%6Dl1<}N`e%v|BtPkwlO1M)fnDuMd&e(C2j(g-
zrUq8>+unA$Z1tYru9`aSa<pR(L{I*bb~Q}wfn+wxuF#cH$TRA?o0W<Y8d=lm_m6iy
z;2+Zx6YEz6t@?KV(C*MLU0T2o&1$G$vA&*ts=s?u2+~ymk%(m%ousuw-2w)?9#7b%
z+|L}XcAK>oX>*)9n0p;W(y|Y|f(_E`bEfBVlK8V;{cGpmq-#R5L*<>_vMa=vYjKQs
z@2z4J`F2!kA)L4Pt}xW-Q`Pyrq|J*76;>)-{xVA2&xWK9GUdqEGfL`+cT?e>@yX|}
zluW)Wzex3ip*MP$bpJQ`4e3!|Ug&#7hYkogM`B-#=<FX05pKP!RBrEg6?7N~a_o0a
zO@+ZghpzOtE%f_tsh|LYb$z$~qnn4`lv7-kMzXYv#GWox62)6Wot>)UI;pu+Gw1a@
zyGn*NoWQxBU7RV|i=pmP?x({IyK>FC24b^G)6VZ=nk0MwAOp@$MnFD}Xwx#p76a`u
z#%nuHgo!pY6fH2Z@z0JcGL_P)Crop_$8y9P*L>{VjmJ>^VpS8R2)^PbPc7GIQL6qs
zow3utclTc0ak|NstF4p$^OJN)cb&_eWOgkxZ(Jvhr@?+^pQvi%_$A?n!7+6GLp9xU
z5VGUdnSU+(+rRx=VKCRS_e?eJCjWE*@2Jg4Z?qA=n!K@j!1&F59o5cE(}n0v=~R6A
zeO3E|=9@l!8az%riS3x2w_)Mol5G+jAz!CS3e-qD8SVO(=^2w#_+`hlEr^Gd-w{gh
zbQDt(XBTnw7`Hm|l~kj8>b3K9hK~BEX8J2h%#Y4PyCutW?xyTAQYY2`Wk8z0%xs!(
z>gv-Z4@z;Vyb`Gd7B8AEE0<-OEbSpRi+UT(jg8kW`QJc4gqeY(_AnxAE72ypV_X2j
zwCQgZN>BcKHvP!MT)z+ATkrHK5l!**!{36mA!PE`!5qAvhh+5E`Kb%0YmQ8lP3y3u
zmUr@qr1WWZaB}bG{nCp6;E~^EM2Tnfa-VhrQ55L=L{)a%{Pdvq!S7G?M9vJ|D5DBJ
z_UmGj?E21XmI5;50M7}#JL<t?8?NrVAM(GNo%!*w@Z;f3Z|_GJ!=B2_bSH0M^n4w=
z!F|p@ob}<1N)?-W4(U>cKmML_k?x;^^|<m{S89}CN966uJZhmlB~fW9)-fY3HL(mF
zj?=z&sr-om1~TdNEyzq`F2#j<&`}>-abFi9_0#BYXFMJWXLjT_{h?>+J%B(=YZ1C?
zU~WA3kVET|=Tq4^Af7W8QWrPOW4#BJb=uX2xOrsxapAi0xjxulR41th?2IVDGwu|-
zuGh|$GMiHp$X2E*!sv>MLf7NYlO*M3#_Kw$i{8w=uTt&YS&^Nz?-_B6>IiZ}rTy3Y
z7DAd?nnmH#R@u#$lp<0dQ5-`q=Q~;b&=OF$Mi+%lRTF^-ItmmzkJpWZbKOQsWe~S*
zTBkAj(L>v*<bzccza)#iPCagJydkGsI%ODBda;s*`y@(t!es8m)HG2yHIDmcY+6Rw
zJ*8B0xwS2)alDMdAoTD|iP;U~4}BbOwhwRSK#38Mg!|olF|AaacmqLk(;S9A{srSe
zCa01=Z|4nk?^dZT$WBLky{BviPNBWE-0x)wA-gpC%PX;CG|nEhGCBK5ETep#+fLUZ
zYYE+23f`?a*8Y%9&C1*O8r{}x&HW}PYCtFJ$%;<bVPZXSe!Op1BYl(kK6P>$S+6M=
z<o{G~F8sJ!@5_yx^v!l;PuI3wZ@T4uXwEhV^99|nx9Y9y?#+j0nzo(oxiXe%hOWFU
zEUa|OUbZ8D-vf(B-i>`2J???%Lkh{DwK}L>OxCA|O;wK6TPE(nwLi(e{UgJQQ(C!y
zq^G>c&D_YRz5BSIBmGwi!Tc+7U97;gW`N}XyGpMjJYCYi+Mft8@m5RABB@6F$=z{1
z^iS?-_o3Cr*}``6|II~rDq}b>*#deNW!6KI*|x+IC@$yF7I7?GCMU<$iRjN-CY^4T
z8|%8_sAhcoQ|}*rXzf1t%l^;r(w}EU5=qU8EYiRIm<&B!k08}|vY~TsiZeepo3-o8
z%&ffp_vF<aZ;t-J{d+%f-}}J*R3Er|?+5OBAGjO%z?1{%>-qG(o<``(O1Q{}!VH38
zPE5dm$SaAhF-ij(b4@O~SEhF7jJhWKJf)gV{|AZ6BR@;Y)`M|Fo55|lynfXK^e?~m
zUi+nY*CL~augM(G4@O_|>GV=g5yFuT6(vx!Gou%5CLn8qO3}ZNMRLrdAPnm6v8y)v
z_f~uIE}YjpJJUPWM(u(m;6r~2^%<c2JLo(;nR=Yeh=YlNBlhd-D43RDnM6T?>As1C
z{Ff3j`@ke(dLx;%pZJuTHB!B!jn5-hXDjubijSK{l@w?@XmMey$(z{$<7?-Yi_`ib
z&u;0JcDt{#Nwoyoq!Fm;dlb*S?8+&15~`IFCYhPDt+YS1GDxFGhKxOwn`268&3beA
z1^dz80>p4i{<J<rpK(X%;~AcI@DMsZg(XHk^H_g))Q3`A4P1#Cd`HGUTt1wRxoh7h
zq8)eU_}cy8tGK#nhKm8M`<iU3U|=*47ZBKOx?3GHNSPVV9SAJRb2x|KyD@IzpTfBb
z8}&H1@K0u4>Z!bob$byTj5LmWdwG`FVqE#s-Q(kAcJAeH{&(pe-|_Yn)l8?5Dj45M
z93+}rwc9H~KZbU@?vd%~_D|9g+J7F6>cVz;&2~LGn(-acb5DxQsT--+twX#dv(EC;
zF0E<Ve|o59MkV+zR$o#Mwo3uge(?90Z7L_@eJ_2k+8eR(Q#H4DSvab1#%G7q1griK
ztM#r+UEF;<Zr!!oUs@lk^_-$SfeD7>)igR{CY$P;cONABbN!9WGI?U!u<Z=z-;TZV
zTKy1oaklhsx>S#Q9GqXTT2HRR&08(Hrnt_AvUx|}W+}l2CL>5|F9_(b^4po2zxHAy
zaYSX5Pv!j%5OAd~{;7@x9mxazwf)PeoaV8M8{T})8Be|8GPVDh`Hz{IkG%|>A^Z8O
zlf>WRVEOuw%`q9{`Lx>6sp9WR3!jcMax8{3X#0Ea7^c9(P7L;A16@RN+^LTwPnu5B
zQ)S-6gTseYS`1D+oUWDOI}hi8)*15^;@l)5sMf1rb?;~(Q0+jfj<R#F1zMIs{qmq`
znJd6z7jTf6Rm$^^opclh?gqUeF1*PV3#-PDH4Ug6IQVhZRivO(P^Q-Ldqn^(E#DFW
z{hrz#2Wqn{LVjg68kNZ2)m^y@MR#}FUEG2F^};{BA<~_Y^Md!Resz^lmhjVC^=Bml
zrRQT}q?Eo)puZcVDca}B_?cod$$5Wl{F46c(D|o6{N=GR>zJz7k}df~y?!S@pZWjH
zQ0p-*NlYYK^2knNBfCd(u5jV2pPmxQ@Ywj|a*@UbnTd#!r?dNzlPWG)M~>{%P}!K#
zO8sE2Ar@Mv>e^W>ENv~jzcwm$x6}_$Z+=zY9N{Av{P|n5M|dqSd;aLtzx^OI{AEA}
z$xEYUP~U}{7?0`c6?S-+1WJ#<umnn&s%O2#%`fpw8jKTHI_>6@i*Sy+H=R!-h0}85
zy|RgRYF}!(8ZMdoEy@2=NHY2B=yqk(EO?+~iynDL@>XB{Xs5*od!+}52|56i^#-4H
zGu6n`5lR<1_HXE2JoHtz$*>}u6a9qU#08S$XLH#k+4-sTP|PhO!1{3xZCvg5?axj~
z_k<nhe)^rXC1x4|n2wakIO5)SheTP{tMhgj(Es|c;er5v4p28FF~;fdqWYvKsV_#R
zFI(^qW#1dgbE9+p-vAcmo%9vn_zF`XwSOiTLH(Cr1a+2^lh?+TDaacbvuO=g`RVtl
zo{-<%?+PZ#^m<?tB^5sQ)+1L-w$8$LvGm4QfSJq$)ac<g-jbKT-Xt8{-U+2?(%t;J
z8bw*&>&uF1Y6vCFIAo{D)aC6(nc|kby{snPs8L3C(r|w!PiCl~^;b=1aFlPKOj;NF
zTc<Nz7%7jp^mxS4)44XOn2wWkwD8XPEv3l1Y6<S|BZ^ABiy6l0ce#(c8Kxg~e}C^s
zhqf!TR1S=*p`h^7sLEOSD3~<8A$_SAjr_5Y8K)N!JVyT=f1B~Yk)^#-b+Py9Ox63h
ztpBels`VAJ(Y-bp0U&Wq?cr)8Z=lD6_0YfJc1+WU#tX_(^BcGYzmE^(-Gyc{%2<1J
zEg5&cS4Yz<BPQ~hHW}~PME=wjysx5-RI~Y;H>#dZeiqXZY=mX-wb!(?4x1cel05MZ
zeC7@6O}*A+qq$BBC}j$UwyEQp!D-1yN0XPVo_yoBQ7U`Bl+%b<pzq~E?|C{p%<3QR
ztKM(?+yAZLD$C2?cY1wx`W@%Kt|HZUIDn&3i2lq5bj9q?zl{@Dorj{^PA(W1PCV>R
z&c%I>%=^z&h)MHe37gi&J^1G(2B0C?H2s!HgNc8RMRO~W3eS?ZL`Ubi`*tkyK=XCU
zc^b~f5UD%sLa#5GMc<!11dHdBNQY!$TJE-I^(F>wW@QrEE=j@zgy}ysoTGxBkc&7?
zgxScZMDF?CGCq#TKXZSw>&!-Wj!Nbjph@r9zIu|Ss`9J;Y<6(Uzl?p$Eiiq{b^aa%
z$O!J!CsKA@aRKbZTsmAIWmG(SvmSTq?`EQ0E=sQC!~kRH^j+++ert5_@%ZO@84UW!
zYd<czUl*aP{?=NWBr;ffpq~S%2z*+h;2t#o2NK%~m3sF}z1~VgAjQ8sQ~32avJCpc
z-XrRkkQ=ilk4YGO<z?hlBq2t@qV$=xF3?bAsjS%gINR@;A(BZmRvul%=HtUnoE)c_
zG$*BV(|&5!z@;RxT)veRF1?J8<Sh2;5=nN1fb9;rnk_U0BNwbQ*RDed(@8%jl_9bZ
zF*Bm%`x!N3nb6T<S647K8#-R;LHIw_8k!rCh{yD&Z?ams)lEdyPqkEI1j_$VOVjZM
z(XTl`e?%gAJ|!dhY@)~|uMSvrJrzP9+N{6uP*zkfi`F1iOgFXCe(Lt({6?@*UpoDy
zN=Lt_#*pZgoRQ>~9$CynkkT=E&)o1^?duO)TbIk_#pBi48JC3JPb*>oZCN;^j-)bf
zZ1OJ@&!sC2J65Mi<B*k3o63<9Vs9om$g^XT9L8lcPDsx9BO}c-!mh`$wMI{<<qxKw
z;?BfelWfL_UJ|{urb06QeWU7{3b*<-LXI-RN3WMo!8p`k+xW~PYsBd{=Vi-#P^Q3@
z+0b+^7tGenux`GLPAJ$-_(}dVQ|W`HXn~ZzhLY3UYncih4BDj+U;0BCs(b%%=|*#7
z{rld+(V8m=@t?yHEbh6^Q}US0grE6zCVx^ZlGKLw)s<UNzt)BRTp7RDW-Zl_B#A8<
z*13W%X`;~!!p}~tSClFHL)Vk+$Bvw#EHV1i%+xu_edHgmZS8;kSD|0{Ir-qn+#|pJ
zI`WIT3ar^<e!6h5v%a&M%xEd&iN1PDM7bMNRJV3pV&byyBMPp#dMgXt<)hu*t=*l~
zLAykEt!JM6YvZa`zbag=?i^np?j9d3l~FdOao=4#Q5+q5lOx{l<<iz}`K-K@eEMH|
zC5+SLtiL)(OTw>-&D)hALKhv87<}R(bOm?n@tvHIm1VkY-nVN{lBp_HaS|=}&NX?j
zKi8|D)4Tq@QFGNf(xxKJZFp)jpH{7L)%VxAX9qjMjwQ9btzF<Ym4DpU=OO_<{Mh+8
zu_^3m3io7e;e#^tKT^OwJ!Lt0JILK~RFj3w_Egos>B*QK9H%g+zsX8NQN(j&{$o@R
zQSH^`7%1VO^_`=GjM6UsDwiGKRhsSUofu9o_d$EECRezW-^h3W>I?7D1lKm@@s%@9
z+zg%i^5MtV+DEdOBvp6x9`x2fu|Y2_@Tv*NwVoa_zsj`dWT3zOnj=td>x7FsFRf~_
z1(^ygZ!(d4WoY`zbZU*x-DFnk<ttrPZ<50yTW>;ZlT-2kO{>Y@$DO;h$?-cF+l@Cp
zPxmJBC;;k!80bsM_fLcY-*>`>v#hv%GPd9dU8yj0&{LEKKb2mvPO!e@<bKcO`$4&f
zF7TS$U&~wtOygss`XyS)-Jm!cAr(eA#D>*~xLcTUl71#z25i)Gn$$1#z&heUcj|QP
z0(ClFurX(9^$HuMak7cF|L80QH2tT?da8{q<vx-Lc<l9fA|0jiIGFgJP{7$%Iwdz&
z{n?@V4Og$H(W*9|YHycOPLq^-+U=*Fiqxxc<vfzIfX7Bnv@s`^>NoM{hJ-=Zc(g<G
zQx7DpNN{gDYOfSub#mp&!o$<!L%Y+r)pj))W2`1NLJi9*aAvelmMOTFNlVWrdcS3p
z_0iNs_3XhD!lpf4Et|zue<*lA7jl*8^n3^$)P8y#0bitC{~;~2Hef~e3&=_7xQ|2C
z$9nps6L0+`j;Lbh4NTVmc_6G!;i}ZlgLa;_^p+f8$<^&@>;^*Or<@_zUs(F7^?z!2
zv-HV+t1g{suXk9lly`5$*+L4$WG=1oIDP-o3F!v}V-5618QI7rE&8@xURgNaI=VdG
zSwBnk$feEl(dAzGV0+ZJM#U<PX%IFz{MPQOt3x<))NFY8m{sPYRL4A%4Hg^o$Y4a2
ztf1ecWZE?=E<2~YnOlDvN|Z5021v2Ab?jQQr>XSg$TBf>X3YBDinJKVLt~wgyfEkr
z87u&w$b`l~O#UdB%|M)ep3H;g-Sb}-K~nr#p}#(!rnuK|H3_u=N%No07UKFTQ(7m5
z8q<<2nc6gIOr$f_dUa8xL4bx%rlYm5`u+!v_D-RvM9S2jgt@wzda@(qDu-~q5$m@<
z_o}*R`G*mTh1Q0tyIr6>k&KnjR!WNCbJOa7IY>4a=G(uH2Jef}Zj>x{sfsrNzDUnY
z|D5!{m##bonsUDxLAx9fpPR;z0{1<8V9fRPF1>87Tr5<po+9b@@vYNHULNXcc=zv5
z4fsksjMKyr5dC}3EZM@eJIB`U!m<l-I$Xaf7yKan!I7v@1<h%;<C@F=&pzaWWYU-G
z_mz6hHAQW=Qhi7MMVHsK$s;{4)BhsyOxvw~(nyi)dmm@hU(!*t|6AH%_I{lP;eE)B
zJUcW!_sjM4>iyt~g<iQN+q(Sgntv(FT(v$HKJ~6?*MK1XnA8~kwV<!}CjpZ6K}PHU
z^qQYu=YN{&C%-!TqW8W3_~DOPs+9<j(4$hYpqqNHv$skhn5D0|q<zN|#kcL;x19V;
zZDRp0`#k4jy4?`s>&=um9?*8WV)nat)2d&Boj5Tftu#eNs>jtE87<YJ%jpmDo}gaG
zmY>~2KNS`-J`uN1PMy1<DS_iR6n`0pD({cor-x5(zWVe~L&3|u-0#u-_WOyzNe*1&
z^&5uh=amf)kg2RCgKP^K2S-Q|s&oMN_}_&$7TfJ+PnbyYXE~+f@^MY4Q!a0GB_?Y*
z(I*Si0an$}pWJ_ZdZ~9>?N2>bHuEzz`YsjFPlTa<!C4vo4;<D9#?K|IyJy*le3Il(
zi3OE~oL?M-E8p$58y|A%jEO$remjWmxe*+m-0Q=hR$=?=i>u|6aN}QF?Z0N?%v89W
ztdCdxHT@+wI+xPi{qm|MrMO1_Dw)o#vj8&~QGV=(R(ngP_tS?VD(kvN{l?Lt)nB$U
za59t3qx^8h412$j`MK}wEVD!#{ZaSuWJ2lByeuCKaN4TtHJo<ACKzvs=SFwW8pVo3
zrAWqpSCz~`CaezR(9XVTSNA%1XCKJdbrC+6(MC~ncI@$C{=MGma;6u1EBL_t^itGF
z?ev0ku|FvQlbk1I!&yC5{if-|7w_<>AM?-VZ^69Gn9U#Y+5AS&4%5GPfA?vSxh&;3
zJt^~-51G~VE<@hVlFeO<`h)ya*@NnCVExbhL;aKTYkHP?4@gsYnp07|V~ijrc4#_L
z%Cr4dei-;^qP=#BYjNK3mh<uSj<7zJXPV>?NO72-3$MxVU1N*!&khRc?8Lu=h`!3N
zW~87T{#{x?W0J5`I84RmFd={Wb_&ZZT+QHNf)3s^10q+49wBoFfAe9)497`fqH0FG
zknw7aUhvz3nz7w;d7EZfa%VZ@n`L)?qW?DXr->*ZA;`1S_;W@12xKNF%kx_?TX^HJ
zIoYv%I971fI#WuGT4#u%`O!pqkvuX|Sp1wufR1@=NKT~l{GLK0`RZs1k^jXs;=#=!
zFC2RG`sEv_m<Bjz>-uEGLx(;>Z%K#b3!_9s_QxLv=QmC$q|n9S^TRSByVSP@LOSkL
zA|YjlY2<+;$k1dn3mR_Zo04_tt#S1s#)zDm6nOn(>;nE|NmA>K5F@E}omtpyVe~Of
zIBoJVO?a@M%iB{N7q+%`PcO^cdq?M&herqNJF5lL`(^gWm+Oa@!ph#D)_Ir_w<Gn=
z+)?=_sG)-z*X*DwGdp;5&5pW5^6IFTX!}1`A5G^oLRuvc=YBA#!w&54^5Or<o148A
zXLFa&Y)<;j4jtuz4Xt(l@7zrn%kN?;tE1Hl7Y#X`Ug4gs4FEg*Y$CAJ|G@VFcHDSC
z`%FbESW!<sGb#7aOC5Xg+U<?;Yhiuo=yH2~XRxC=#lIdi#XW{#p$y92haYq0Kl&3a
z{Nx6dIM^KJ`jhOxMNn<}eBSpv7<!ePre+}M&t?nxA%^o72mfeE%lvDDfl(8`I3xe_
zN4(+&OdFL8b7rY61p<4cnAy1^J%n&c6|TfF<i^f73rgnOsy@7YP!Gavp*N4LFCkkP
zWrVAtFjw$gG_WhXlL<0Tl^h*1t242B9cxN7klh}s!Vdi^<<9p)g4y$#hXixKNnX$o
zj8#K<euN@A@QeOTCxU~6pZ^AMurEx$!NAPPjeO<1(eh(h{(T%aJNr}nb5+G$8Nnfw
zGdIcE(V}K{tn40zDwcce8m#~%zy2rO`}u2YHh;^^=J{lHcyID|zfj`;^xMC`e{$u!
zRzt%#{i>@t78m}SD}?%2@%(n&ud*)pr<MdiX)Ppmx+TB6u6J?n-9Jd&sp}+z$L*$G
zy%Q0fa>!x%D6tB*%LnUAQpw_j#54X!UiN8C*!16*GL{5)^<TVPcTGOC^#3XUGF$Me
z@e%)M_oG|bFTM5m!cC|D;_;N9eBztA2>oyVxC^hJ=Htze{al!DUhuRZeQM@c{Cz&}
zzCQiB`wRb0pFe)r_n(?0Xz-n8;<S#-saUVml}V7g@*O_>jxVR5{$AhSU0Ip#%WXc~
zzPkDzpFLXNo^r)qzU!pj;D@J`ti1#-tqYvSLFEN4xvG6xJC&ea{qqDZw$wOr`<+GX
zq>nv)<JX4I_N1>hzj0~r``Xhter}BLnz+F4vBGzL^XXeZI!Z!K`d}iazQ0JE_`z@e
z;s`-F>3i*O{M;x3IO%)c%=bj@X<`0x@R7d$7J@XSDCWMMw?PK*BYkMG{p6y@UY49}
z95k)^LRmq`$?l|g@_)AK*!zUv*S*=}$=<sXoW=UN93(idr<@S6mr0!)R$B@{h0W$K
z6CZkbs6Sp-+^15UDxGoWR}+VjR?nk{$o#55guoBU+<wb_{J;K7Cj5`=a6{ScX?|`G
z|H<My!*JIyf|r(y__5i1lAB!qBKbzHHR_1MV43L*|1z_H0R(IuX5{|l@edB3{BuO-
zy%9_>js>KTpd;(JU6jW2j>O~k=uf40Ev0vDBE84W?TshD^G=M#q%!j9dqLcJQKkr=
z`DL^KYjiH}rFP$7$;jlV$(R}B(;fcghuwCwnL5e;!b1b~#Q0&4Ifjyb$3{uU1*XDc
zXTFlj)53p=s_gftn)9vC{-rrwW@2bsRhKX-bvdNnL8n)%$TcVK)~{VX>S?#XNBn;o
zc^T;)Gy$+3yL-cM@Q7c2cys6>^FVy_qi^1Xc>Vbd0Kfh7GX(t({pv$=Ebcq>&Hi+T
z3H=7*n>$|9fWEzkf}UT}+7Sb7fih(uM%h(P1>v=(4<~-;HO)->2<ALWV_;@F22NVe
zcL$2Ua-q}7m3(4gu191hWFd<%kJj(Tgl6PZ&xYDTea$DbV0NO7l~;Q?Z<#2E?eg~S
z!Fl>~Z)D<0Z#olzaJijkQ3A#R;t=&u1;&RI^4XyqYIf*Q&5q>DJV>rj48r7jeeZ+(
z=OD73RVqKofBy4e^d4)w2b9TY2Ynt1Isdes9@^(WpSd#2&l?^?(9mGKfq+0mK9EV_
zBFFzTX?Hw^cu()6-d1~JDAoV1)N@w$DC#xe$9n%msdqe%d{6JApCjM@P!jgAo{?Pm
z6>RuFl#a&}3HkI+N**Q}_tF1ADgpqGqM&O6^Bw~JkEP%Q626m$M~(acktD=(Fp7fR
z_YrXS>gs<Y{lw8TihS+2$d>^Z8=VvP@dfE5wOqe?jITdv8`#kh;=eYoTCOPL+QLcM
z)q6QuSnZkkpZncm-JcXPV{o_fWORp}k%V83TdtZ`#T90jo>V_OANR~4@H(RvC7g5o
zz_qy2N@}TFyM|jl?pFiZsNcuUX1h9KEU9iH<v<ed>D)Au4U+08X}PeThh4waescW)
zhQ~>M*?nwOp4>tvBy9I9P#*6bAC{MeLce5x06wafAu~e^p}@LP%Zq6@N3F^=cB9fw
z`4?C1YQ3`<cj$uRrZ8%kYL#?kw=;iL$d#gBQt>%1qz}B2qW;Db7Is(utTj+t>rYw7
z-+wB|>>Va1g-x{ZjAUs@12;LvQh#}_+vqmybFKzxQ!uo@k068V)o|pVJJQFdCdOx-
z$M6W_=+c|Xm9*n=^KG=4Z~L)d=;DbW)np})4R<0tU%Al;vdIhV<<O2_?6@<N$qS>(
zVR9M|>)qb>J`l+M>#v2S%ksg&D1uy3-cw3ubo*7{-P_-^=Cz9tIfyjtIi6~<nYHC4
zg!@6lf@`mC?~;qd@$`+<;_C$gb=+OkX}da$akW~1(Bg-kf|LrsDo7AKYx}8?h_2*#
zJh(USDf<z3+9HPatzL<wToI$oo7aN$=<bt$==Z%=INR$xmunXvM~#qsV!~Lz^`2Zf
zduuFt;+O24<=2C6j87=cux|UY`?VV>_1ayXNGa}^tjZO)al7`^q8D>5TQ^LTL}c6Z
z1w?gva9;0uhS*B3pL$DXDRcXaF0%39>anu>N7aWlS9q!ZIQb|Xv+J&Kjf`55?)1rg
z-Ml{)!~>OHxy|-<=hK7(G6iYV%X#toNQx@=wT(34;G51!a-1)3^%Iws>q{y(XJp9a
z**Q1MVqCpT7V0dUZ{UGMVMzu!pzxkk6LeUD`E<WrUB1f-zqoYI&uR^=X2YG^UK44$
zpr`xPttV#gmzz4J;M{8k?eZ<>KlyUk2?%lRR_a&o?}@tFq~c`nT#q2#=sD#QD#k5q
zY6@@1&uG4XqM#h1i)wXtsfPD!;Z+&L{imY!A3n~xd>lH}xwMUTcggiDs@Jr6-GCc=
zROGHZ%>R&YOl*{p79F0^zx>=Q%732{N8M}ga{AneGX<OqA6y8@M=9j$79kCY;(V(i
z9pb4IU%OhuuTLMfq^z{cPIk~~x{a3W`&p=eZdB8HfPZh(&8U$`ghsQ`eR0gDSBaY)
zg`r%v-nb>5qSHF2ZLNf!&VKHpov_Etr+%xk-mhjM&!{}D#8z_ZNm*yq`S5Z2dv~?n
zu1V#~&Ns5vBxPfW&mI$trrx>fe_S}`!&K*BK~z;&*Z12bVCE7r&Y7O}eQ#e~QU~{6
zek~*#x3d;==b_tvU<$i#3VEMtI_9Y1ejPcST;8tAS$52k*UspxM<|uBQ8M%!SI+RY
z)8~<CIOVW$eZ#d_#_IeE^7lDl?0#hHjd!0OlCQSnrryUr&hA-<Oxxumj(+e>kxI<M
zS2MrskMJnRow%<CS*N>)QiVExkZnp-NG;Xp&U|vwBx2yDu(F)*UFZ1bw;_Edt~t|d
zH{lIe7_%d-PX{GxUsUL79P18<aagxs+ws10oe9I}J)v=A$!}*1Ge^>uDD6|!d2ziN
z+`1h2kn$fa!F}2@?pjax6<U+&gl46HxnKm@K8pPrkB$XPrjh^o=+zEWt<OS(&kp7|
zPD|(hDe1G_=(Cj0b09A%t|xb6Vr+?ar1PpLTl9|+*IjnPe@oT$m1P&av%a%*&_5#o
zdx$!5qGGr!d+1AJJI228Es<Mg5k|QYhKZdDC&xBYk~ld)?T5m`-g>W=F5u8tvCz!$
zo(=Cneix>fZJ8p+Uw^5L)1YA5ZuT3lyy06iekEsVrz%Q2+j{hyB>pg2e#olx0v+zf
zoz4dhlbr3<=lND!{7CCCrvT+c@|BrFE%_UGCvDOatGnaCkB*X{D}``{LIO*5I$zq4
zwX}q3ibFbM{u5ttmH)9NrGIGe-CC{T)TBfQe4*!#yFu#0ZgeuQC)aWPx!eCn1H&#I
z!Bu#kl@MR2?SFB#;~k`$@RVwQBIw}tfBaeqdSZTIY3o?Xt4(QL<?=oK$T&MdTlpkZ
zyxiR@?;IX(4YTi2v$J${{U@MAx!p^*Z~dxpv?Uju!p}%|cLxeo@RXQMPLL*39cV9r
z!09$Smtxxg*MAi<KYHw&MgzamvgvvGlc-q9@0QXpe)voFh3>P~SfAE{*Jw+(u5=MG
zO>*C5#t-h^n4NOvAiqM+Oxh{^YK|Wqnm1eEpKReM*~i1{t*^#y{@mGZ9sZw*DgC|Q
zRRz9rs$a8{ITqQGi56E&<NrLqof0KW=9q!WwhsRffXQ$G$#!H!q!c3=sA{cgQvdEs
ziu9O63M*$4sN9c-O192C)+(ajcb@KNQkGrc-abBBSllXWd}>drO&-2XpPnsv>GJ}u
z&yM*(ElzBhR-&)HJ$&!c*@BsB>_&SIEUz<HYtPAF-u_CXtpH%>vev$ozqs#ZKSvpu
zxRz**62+ea>hkcvjVEUFDV|GZeSIzkMS4@(-d$c_Ssyj0<i*Rl`6Yho-xc-C^!;fm
z%>Z+qoA#HvgxlJ0lR`h~-nevcOiTBN$96YSXzH~&*V1B&_4Qtm9vIUu$nj>Pe7FwX
z&ZYYHXM{idZ@l9>bG3SN&UHYOt|rrLnfq4q(xrRpQeK*tda<a2kM*0l<3#rq-x_#h
z+I2ZRXHEdR&Rn}SSGjg=I_9Js)D$0eZ(s8EWxI9B+m}-5Xv)vmyK{Zd=iA)qV0!ob
zr940M73l{;hvMW(_n<uIT)EB$n{X^^FRl2#QJuSaonqPg@a4_x$Qdlu;)ibG=G6)P
zf6dr%pT-M?`1Qr1$aC&5b1AkujZn}RFWp}*(-)`ZvVqS&KO{ED`#&nLecdM+&>gII
zf0iG*<Mnl)c9zmteb~L|K3n*P?_MP;{ms{XSzev`+wP{AOAIlmgUofS4|A<Vwl?FJ
zX@r;a=jf}K$*Y(8>U%$Z=Q`+#+<eDJ<t34u(|+!{{cw{|R+Y~wKE(@{JtJ;P!Q8%@
z(}bY8Myu*f=T<jv&RtEpKnIBH`<I#bFRxhZbW*d`p3{gGxsDRKtwT;ZfmWOEIhn0*
zPP_iJzn5YcbFR%~qQ$t*i`Ub9KJ5Xf?_aw2FVpwma~aD$^))--E@io<zMA}w2V9=+
zT=y}tqmo}v!)}i5?xoA#OYiwya`flisuQ&(zOOW=-RR`COSj(iwP`=u-(^uW6R9!h
zB46A#xoU^$uRG3pHSo)~w_e^79@MvncuzX>>Mt`<cAqAgC^}IQv8i;OVSc%vy&-y-
zn@C%E<2}O8eP70!OH8js+`8nn{wzlP=B>H7zhBB5m*ihgc{+41&Jvk(FkpWY*&j_s
ziO2SPzuLHNwG+9}bKLenKH@i1&4KqWGp^w2W|W3=BucHCfK!~B;TVw2=SD}OyrIMs
zzB;uAf64Q?duc?l?OS^FOD8ebhHk_0dbK?N-peqR15<w{6#?(PbbCJUDdpbq_=C>#
zH`nC0_zQT!oQs*6tF^yOqmidel=p!SF5UZ=?)|9=`<Pg9bE9@}!iU{ExlJ74+aVA3
z8=p^3n*cfQm_z!?h&fDLue;vr&yB8AWgg;IW14&1-EHn2r^LuR(-OC*4&OXXW9y|F
z@Xf<}Z_kv45RCVYYrx5`U?LgevNyteWwHyHPn3?SwlMuz@15a~rRd>sKcW6Ka>e%(
zN!X+l>{tOYT<<?47n_%9<hARFFm~zrZ}xloPWbGoP6B-n>y428<eMLUXw=?V?8L9?
z>+kyH;6~3i9{Trg{)Z!We&TevgVQlC8xQZA*nRBy*cq<lS+DS4g~RgB;rh|~$&_>I
zkNU33^v-3DAY%{2#3}Sn=vNX(FX%=su|K}<Sm>24Bg{Hyaw4gwJsbU;jY$NU@Ns8U
zWX@#m>Hfj}Y-V;i-{j57<dZMHQbr_~er7&>g~9!%KdVd%$=f>wz*K#Ba*ms?J<a)1
z-o+x7M*Ca8o*Cj@pU$Eb-#CR4L%oj*V9MW0h}<aent+-uU*bpCtaKvmKY>Bjh)G9z
z$2~S8G3YDj&<D;h(~)M=kf*c*``*Fs(&f?mQ8MCDGRW4#QF(T3=F#l9jGe5KkZ&B8
zS!J(%i{29PQ+EO;`n9)&8}+UI?$0C}lJgy>k{LEXm!WW@4CSOf$4Js;D&Nm^o*t5K
zG&+;buiiuAT)U(;ek!8!znm=`9`BV8PSy|0%a=R5JLR!-%T0s(>?*EG4A7*xaBrng
z4$LM0OIOLyW$iC5Y>n6Lv(w0f&JJ&zbXM|cv!HXi*$n@Fws271+qzs{Kiu3ZA0A%1
zLWAzV+_1}2%`jPBv;KLq-ywY_Kbz$Lm39ZJY$ZE$w7xXm-VDaqPx^H4*-M_yPhs%4
z$q)-?TBmAf_p*GlzI3#{yEE0SG6?ph3CYbaV0CULy&um?SozA~`OZ@E{qn*2VR>n)
z@3-6ca}r887uRkl%^(+Zn4d-NSF?rP-R;Z6rQL(_<-+ntLXi9^&qP3uCrY(B_wZEd
zJUMT(fSwa+lUPPPeVJCO$`fhm_p>fc<lu5;Yhm>=xha;`7It>ZTZhvf@x;jPHeTy<
zPTNb&^q04eSNg)Gd*M=F7&z~v9!Vt7!cHPxFUpt8$J=`uLJk<9>(ome9l_Es_cY_s
z(@NZ_Pm26Vj9lrsv~bop{VOt6FPt4H(l(Y{nQyxAo=L<><XIR5#h`yXCod#FD@OC<
zKG)AN1R_6L+S4eaaSQJUzf4}a=a)vszO*!iXVU8Bj!)DT31N1x<rCw_%`CZ=+jCiG
zT5<<foiApx7s(9oQdYrqgCsLH=4*Cr(CHz0&WX5nms+<y!tpWuz;rXtJ3`V?E*Zs5
ze+r7bSDmnyVuJ;ju*K`+dBG{Z4t$?`Z9K@|JK2D%5i{2YWW)1!Z#y{tQb*DZ#5w<K
zsP3H7clAUyYD%HqcWr(0ZtvCELh;+Sy@#&NRpQ6T#w5gI;;#0_xzusqJVIkmh@ky*
zxC7>@FV(~VxNl5E50mfA&yVpZ$N<UYT2q~9jnMwN;Qd%w+B+^J?-f48T?&-QLGRqO
zo3)SQ&-bX=$Ist5`}ldb;0N!Rz8~oPlau1+FO^l^KmXnfb3%YOI3tliX3RQz16^vV
zmuU`rZ#A{Ht4qO9B=Y7fqcl2&N<A4k8TH3^uS`huJyxdGYu=Q?xuqo=)VNRV9bMd2
z+tp7=HY^$C$AMLj6>wKib83ThCr7W1IK9csmuh)TC4|RMp;oWPFLSPE%2!N5UcPiM
zf2Gt&FRzEkM*9&%Okv>6Po|p>*Hil1S6{2caX@o#h9HfY&2VJUrG_KDArD5+s&5l@
z;`@g;!Z}CihJ8y&-~Z-$q``Z0-FhoAf4grH$jcnX{%q1wF4IxImX#e3wx8ZoVMmaq
zQES#=;OWo5Mo1R)qdylK$s}40O5jZ7^B$J3`u3pDLw`Jt0zTmBKp+1)+9f)TRzjGd
zcaK(R(h>>@KY3GJ)XoOb!~%VByaqVr|EN55=H6|m40%41QKlnSPT(JR>V?0#`@|I5
zS67|-1S@7}-rqjwspspanK96&pJTWAJ!qRIi@kTQy(F_q=Vxw;Gd@D}i6qunlLdVJ
zrSOoLjXi5C(HR<T2Pb5Hrx#cHn|Dmly{`5ZuYdK8?kuG=Um&@-9wuSbqpx*mA*CZ+
z$_QU6R$Kt!UHyg7$2afLvF4le-6g{i1lbSiegAyiTqF+i>*wO;A*j%|%tJL=0@3H{
zS66QwI}c{atFgR&$=g%eNGmSk$8$mco*6H^CMOh(vLn-iQ$xO)wTsEf(AvdVEu+y&
z4_arg+n!5<h2<A=OmaVdhennRz&Y!<Ht+pV;z{%D*FBkPz7Df!N(5bYy8WMi-E19x
z(R6Wi<K@DL*`~<jai+MzX!!9sujHj^{FB-8c!WOHt05tm<>a~cD|(EYt1JCHX0n;8
z&;tgdqjRSkx8|-I_2%S6HP5+gc2@J~T+T>zM0bN-GFWO*POUT~;-W)(xs<Y#3Px^-
z0^?Dr$o18sFrO>5SbvBglNB~!Cak!V*v!sy6rQS2gjmdoHR|iIRK2Be>XdS9fb`98
zm<MmaXBsJs2xp9EkAb@3lEdf}fVrlt6Y}0^x<p3lW-4zddhVM%kj(Ht+1W;?o=mUy
z#^h2>%%!VLqv5zI4$U!D#M~f#UB`QSsuL!ba+&*oN8q11$H0^3Hs_6+T*_}!XpJ@}
zZlE_L#GCVTj{8>iWzOZ-cH57AXz1P4(~&N9q&_zEo(q0(dM-b-Ek~pB)VzD^e0avU
zKe>O5U_cp3j)@zIvl4iIv-wlztz7q=VUgroDixetzuxHzx+oRzCNgHH>#{K5OSg<f
zOg}az0}msq%Q&#6TZE4DK7eL$a-wvr1^K3DU?f+Ls7d%1IY-t`90Z{6E0WGW@-lnl
zM$0ZRn|3gX-p9i$%VZvyi7V;VD9pycP(X0xB(p{EXKp0sI^&<2l0OD#>&D4>XL|gR
z@c7jHk(-*!(seUSlpXiiubi06-F5R~l<zRD*K}UrNU_&+W<wNv&qbb_T3(0J5VDGE
zP4@0{mDiv&j!cG<6aSBY_~V%JEe}HDN|5z}OS8Ihr3^Cu1H-YKmRD)5_^q6({nNt9
z;&&{U4#?Lx$vu)u2ZXB<+M4<Bt0pzXqhCd-ArAdEO5HS@a~-K#@%4mC#<*mRES-v?
zfPBT2x{t{X;4q)A<Yu^OIc5L7vr31#lwo9MZWvXK-eqfe=$!2qR!1__rwJzlvuiHV
z2OeJ%1?B20(eB>VjwdN83@9s*L6b36t508=PEqNvXLV5&6&bC-6hCFJ*4^&SxLBHO
ztC75_(Cto)WE-_dIYl9B2!!URx6s6a9lB{hJ?3Yc>FF^XV<Pau8@kO%l`9)#A{c_G
zH{rDVFtUu<XwSjdpvF^x#JOrx(?$=u$#f`_GFOeOH}z?VH{{aD6?Xch<6X*lN=M%)
z2`A1yt<yEu=`u9iuXABdoN&(+oDgg>X};O)EH`1bGpESQ%2a|IN^9(wRh#&+Oo_QE
zKbU!A+K*-<2Hi(p{Po-v=$HGPd-hVF&BqB2{&v>Y{JLD)S}!NNw{U#4c6nYNAH_IG
zh=<3zlh2GjS8cdL5YyE28DI^DNh^`)FkiblS=ODd;?D#|%@+WgIFEd?f$(Jgu{)Q`
zV0&+J)WFQ#fS1ELZP{tPF(v0|_?|OzZinwOp}EPK0$(?)%W-)EQ%y}Zk?+5YC?wy$
znL5Gmy{9_AZ{FI0>3!E79+=~|ZFKEs&SBg4o$pG<+RY`Sej^p*KY;_|@4<aKv07u|
zt@}0eN{0OEX$dA-Z8yIgtMvx_dP=>0FTRUP>HYX^(|KyVVXS_|oMg<26Vpa(sj1|i
zDIC=w6I&qewtFVX|8_tB<A*<fac#fmzUQAG3O}XIJhbFv!GTmSi3Z<jb(7zI&yP8q
z@N>ISQ(JI}4}Q=Xt)Hry>awn3LqVz(q|;k19~HjbBqy}s{QAir=87Pv4g!89jUu{_
zuAp@F{^3J)?zi~y`t!eg|2g;DL-%oZ=DOaU`Iv79P;+SUOWD;Y{7{{pk?&`|>>8@M
z+0<)=+LKf#&`-^L94xCkT>Mo&Uv<@7eK)gznKZSVdh;Paw`!&auluc5TAgvz`o}}u
zO%(UmZ!@z$%(#aSDB>!Twx0aP;R{{S+oTBhb+cWWlb(aUH>JT(^1H@k+Gxv-<vP3k
zqgOiox57W<cfHRX*1Ht-mW|ZnxVaa)?erZP@1UHFczCpM)Ssv;zb<u&JKaXL<8tN_
zqmd*JH}v|>%5KV&I>hP0`cb(*0PSCfr{To7d&3=?9u@!4LfhHhUQ4K%Y<9s>b-3Zk
z#BJ(04sx5B*<3rYYsr)nI`z2xonN>f@rB~>7goRi3y*FK+zt$V$Iq8(?zj#M?tC34
z4|hJ~IKI>S{*gn*Mn56PYV_~Zy-4<<ldyQb_NjgM?sX7fGI13{-P|0PxTnOZ8|W1<
zBo18Rd){`E;PI)|lKS_J?v3kZ7wcXK=gkasx5x?w1VeU8I(NN~h9;O8eNqM5H8z;0
zfs;xsJt_sd3jSR9(Oql~ftK|o|7^8C4oow*<Q3`4=oZc?YxKNfvcxwB)Sdf^8P}id
z)u(RSL$&i%b>SAD25CBhY5F7{nne26;ZsHB%Hd0^8$atVj}_#9{P4g2Z~P;LJzU|q
z<XHZ_^H}|RrP2OW{l4FD(0CYH_irx>O!nW&A3rjY_rE;r`C$-5eldB@v!Q4HSHXPW
zX^j5!<Qha33jgb=^3>`+O?d8&-~a#V9~W#8SMRPL+fRuGu>SX5IiZcJG-ajD#-~I9
zbQ+>GYZHOla5)M0($z*=7$w??i<j!UZXm5XomI4R8Vx?`5<t#pK8e0b&lPDSQh%&F
zi7HJ+;zEaf&)&$hj4a)3`-2p!&332$!T;z6)AmWOpP)9Cb8T>vc_cH5JN>SNX-iet
znI!qoW}N6$?Jq5Q;lyqv0p04Ys?^k{C$D^oHid=zdMq7jn~l~TKblQdr$VjnQWFx@
zqb+@^+-Oj%Q*d!KvxQ2tE$$<_@gU`uw(HFA>Z$8G9(<|)wb?Ax8>!1A5xq|ts=Fav
z=R4`U(CLx9{pd#G-A*Dot2guosMM1qU06%h*3Wcdacx?q6JxuQ9QzkqJtS)2y(?qg
zk&UM#i!LCRZ`{W(g)gy7qe!+kx$k5gZAeXLp=x$}x^d^OQ~2NpYqVUqfT~cW(M>xP
zCCh1dIt^)G0Oz=g%Sz(pfmWYfD_h5hYs-s&mwzufb?&D=F@!}vrgU5`AFi+NxWDx*
z8(7zEkBjY)t$%EMZn)M9$*OK#rfckOv8SrgKG8s(wgQ#o!fm^f;bk|L+wQoK*lWTl
zUCm3DAG?Qtf2u!mcpSN37~tihE=*sRAL$!k;zk#0yUk3VbM21{?q@OvjFob1Z!lqZ
z7a5ey&~@2KSH9uihw};@*JfIpv%7u1eoE|sR##7DE`G7srngy7jspB&<y0n{Ru@fN
zdjQ?Hle04X+Yjw#E#WGeeQ#Vi=dsi6?aPSM-fAZlcu{VvW0<!e(<La~li4P`Lf5Le
zlBij3FqD1A0GZ>KmltVUNf9Zo)ppH^0w)Llo+w;MhIDS<)3{BS+kSX?Y+T=T6T9zY
z!8c}p&NnU)<uGo3j-?OkVVr1E&Bnt+Vj?BGlh{nJE+g^!KGD_+wYH1tx&O_LwcxsA
zy0JQ<Mki9EH*-0Cy^im~FHcTaZlx{a-A^iwR{SV*zVFPUQ6*$nt<{Y}hx*hHBa*>k
z4_&vt$(DX@IMT@x6%o~T7O?7qG<)jEONpiVv(Bq9G&f;Qom915OP+obc5)rQW!PkM
zKf7P0baT62t<N%AfgN?R2~zMr^I?^}{aGbntv2JvJ+gJ=RFY3-h>}hvS!(U6S|2r=
zbQU_PubPcsgXvJUcJ-;BbgFGm+amB2rMv!^ob67Z`m$?s$7B}LTi=e}6w<HN9sOih
z2<BG1|5MolCtciyB4e}#7<fth7xZY|F1Ye$uIothdNPOmc2|T(LY}T`u=?og&Ze@%
ziU0Oh_lskJ3{#1&pI!@+<tdF?T_%}umw1zUn#J1sVc~Fh<tQ--%7x_bdk4EG>&xZk
z!s2=I%W`39ckldQeRb`qu(rFkTs}A~EbJ^hWaj8#eew8cH~GQL!eR2}jGUO{cMCh`
zh4R_nLHY2ouzOHg-`?9=PsU3=aImm*wC>z_>pM$Z$IDW}DjB1&vwKw7THj9WkLAMA
z?yUQ++{{C77Is$(+vNjS-Q;LtaeZt3=v+RzvVOGVKDUy5Z=tZaaB#G~biB22P}n;@
z*xNmn(cJo$*AJJr7S^}R%b$`tB;PHRPs%$-1-aV>mb-hpQ$BDD$gOoz#@Z5OlFucp
zU0y#ZFCDpM_5Ze%5HXqLRw8)z%1i6+FXb~SymfFsn+&VK-(h+GIC(DlePMZFdto(M
z<A*n><0^R_AC$M<#CKQRIETlJhezv2$BF&6y1Tn9WIuG3o|ejozZAB14~1~YhvnJi
zBS#DF^KO)cYRRvYzb_sit~>e((RYr@2M5P{uH4VZWY14s?VZBXf@^&xwBFs3H7CT{
zJvevcI%3FH%oa}9%E`}@J>Svg9UUw<ayZa-=_vbT^3{Z%N14SIcFL<;>#OCRrLz0&
zt{dod{jmIz&09Zo&#d$D(}m>A$8PzuY02F9YlfF+WorxTD}{w+DS4$2yU`MsI9ylu
zNq%~GytJm&cgN!IKe(`tR<-$*2+Nr?DrzS4GiRtJKS;ZJJ)l)wb_<n$jg^02T;ILi
zIo`h9-8=lxUj`q&Pi*XGeL?;{`Ee)c^yx%lNiJyl$<*&88v4V8H$<HN<Q{ao#K1G!
z*RU^F<HyHX8VpMFOV{Vp^*j_&*XwPW_JJ1Nq^FQM((mq}l3^+cr0Yf!$@eUYjbgAg
z+ItM)bgSK~qvVwjAEo7{8YFJ4WCB-Dna1b$+-R!dITI;k3U%7|8AXL*oCI#PKDV2n
z<#K3OZtG6W0%`Ome^#}Y(P_k(`<&Bwq`#w6Ezy*?wN>L!R4%9Mr}~;GPEH?onj*?p
z4|&lJ?K*Mk4*8SXEiIJx-ZGSoQYuEs*=eU#aa0G=O`&?-?cp}%!Xvt61G~@myNhO6
zOCK-_lbuS0YPV-i3VS4Wg!H2nO*U`WxD~k#t+ne|C2s#ab!|BApmBE(Cqxv>Qs(cb
zP*6TqTuH*r$S?mzf}fJVxR<`%G^#f}b@og0J={;Vp4Z~<qPX{O%J}hG)Pi0&AD01k
zRg+OyYC=z$x~n%;%Pw3tRNtY&fNSh>)hhg?e_@EHR<+N0!Y}UEscnq1(VIg$o_K2*
zC;46H-~Us_+EV?e|F~Kgai`Na8)W#a^s~u;4uWSucfPO~`Ur$OX&?A?GVVwAemlNP
z_zuGugRS0bKV9EA$3gWjd%luglCSnH<61kTcx4WY?7+X)>Q{|cV#St|JNfcx?V!A{
ze0g}Zu(Wx3xPDPCeCS6*+K)1obyrX<Zn|uYfkO!dF`H~<{H2u|`I&FYqLL-M5oCoa
zmYa&oxZ8b9n8^L>m)tK>6O*5Ii1?SKyTAX^W0TuV7twT@acUvaCjE2#h?bg48Qo#W
zS08Q*zZT3dh1<eE3Yqhl{NQhY%i_-Y+r!mS`0$th4RZUR(#I|Xqvo!H{^QvzWa^jt
zcgXN7y{qHaxyIaevLuJ?!@x7CjFHFk%@18dh5EE$ElImcj%}voSfiWj%pKRL0b?sU
z?g~LEL35kR{M}za{xbaAYjMA@nLIW7m);LD?c4vQ|HJ<7Crj{tN!$K@X+Jh4%-*%V
zahrbFZpM$vf3Gy2>%G0kefpt4#6QOIfA%{+{aWxxOujQb`9gN`DOnGaH$(u-@hG^!
zT2)a#6;8$cfa*YhsYuD3A-3?Rz9^wjrWkYWM+ZSTF_4I!p156K&b(geHyBRtjfZx6
zhh2U8nj_E?P|4$RmVf&AA$OyFbcZp0T3VE*{0vL}MVo&>v2lWM)`>vZZr)7i_gP79
z;O5VTrPyU*H2RWiF?T->J5pSqgAd-2>m)resV*r8CM$}ZQ=})?4xcLbjczi&^xkzU
z#cW~VvivFeN4k>auXDe-3)796{Od#JH0LFZLjkiA#tr?S`lLJM3$@x#yH-Dn8_f?r
z86XeMy6^E|_TbC!{`R;0w?xpm9gLg9@+tet{N$cm<EED(4RUBJxs_Lv+t86HcSGyH
z=~bL;dGgICS9JZ;r%x%hKF61$AG>OPoo=t!_kwE_<K#MdVLdF(5xcJ|31I0!B<cY7
zj?&OQKVrL*-Fc-S%?Ed)+gBgh#J?5vKRF5?li@z}rk*+hWslQU{+g~+g+j6<=XsGP
zxKcE`|N1Ze1L;W8;7~S_L)m*K`Oo~3?0-vCl!oKg<P*t%^gf_d&9;+Ho=BKNpXjqn
zpO>8!*jl(azg#&eC)OMcHMF%$&J~fe{#Ea0pPrsMg4G<YYD%V|*(@cNbop{+eQW%5
zR$Tq6|EB5m%Hs~sW*YTw{KS|*-bxTNB@ws-k~SGA)r_uPB2!oY(!YG@g4{zeWt;|?
z{)#?=If}xc@Io%8NS^-f*X(_e<-3uRI450aPN~ZNvs++#9SQ5F=G~Xa-tvBIJ^-vh
zQ@_p3y1xzip(R8ir>&@uM`oB#$%RK0@@(>RW}sT5b15`Z&C*p>*H!?Ig)av~7b?kP
zcfaIE?(O(=1NTZPzcp^}m`yisPlS#cx7W`)8NvnNJUlI2N!72HG{7R$z97|9?h{Lc
zwp*KtZRC97AJSh<e<?Yas{4K6aD8=Q>tH+451l3A3~(`Ggb~F$9l{HekM`A+YQ6Cp
zwdjkB-m0~)3tUh={!IR}e*e&YNhtK;FL3?G-dTuiwam|F)7fM+%5+J|6ZdiF?nCm#
z<>J=v(xz)lu5Zb;{PC;Uy()T$8@WdbLEhV+s=DB@AtZf8^+PV^#qE{5><d3NTbWQU
z)qk7q_CtY=(j2f(A3l){aUfBTcqtX!m|OMMb@ygKeUO-&A=N9VFgToLjJhy8hC9+f
zsatoH)|IShFIh@@mG``K;up*<pxIJeXT`bO1{csD8(H6M&HX0fc)w&nwXQDNFNMBC
zwp~E88ExgNNBGXY<LvSN!hRB8DjG+-HK>U=6`d>LQ)Ug*YE(J$s9Q88QDO}wR)Dh}
z#L94P4iLV9&E^jIbwET8?lGYSdi@PYGz|{alZb=kq_AZzH5p}K32w|Ddq=Lvx<FM<
z>4{t72g;4)oW9yC>Y?FOYXySDdJ@Qw)NMzQWQKB(k`GqnWYocd5{X<8iCm~97qJ7q
zl36%>%ms?&D3($UIV|t=s6s$m;V*y551;(u<B8c)UR+pSap8FVpRDhkENp$uz4E_@
z25@SN3(ar}V)v=@%g_UHw|(EJt|rnglR@bihEo2#Hk%pZ<G3*n-xy=*vV3sx{<mep
zvxu|dmqqIIC+8@+bh*1Z$UW(ww`Fej&x~tr>dpXLECA>3N+x1&as;6J^GEI{Bg6RK
zL&0Qa`EUI3)`9A&0)r&US`;7hD*tqWhkLG---nq~(YVsk484{{YpWk~=5l}PukOnq
z(0Q|xY0F8?_}U$B#n2z?jjllD3JSVwYSyiJ1TdeKqyp*oMWzPGNK}k|Ao<_$b@VZJ
zgr`?q+#h$7EZ3XviXF72o2@Z8n*4fhE>DHyRz<H5!48<Ui%}9vpC<D>?A9N8K9z(R
zaqDH|#ARWX$97yxG{qqpFuMSOBLr&_eR+a2C=HVVb$4KOdRL70OANb#Qj8;I&=Kz?
z7wvoDjO3N%mL4MR`+x`cteOlm1&FeqWw#;E*f2F_H6BgTHrc;U8vaD&QqQ1j)t|dP
z4@WNu=o2abUmA+-rDM54dhQnGX1M^}lskom!-c(m#9?L%=>z$Fl_hk#&XbWjD*XsN
zEuxg}aW0fG9T_)b&x<GOmR`bzv`g=odN24bb*{xZUDo}k)~0gYm-geGJDhPphAmM_
zaqEueuz?ftPhc-6gWUszaN`(#ci;$4(sn0)_K)wt+nWt_`=lZHeM4LD;kcC$u-dFA
z|90Cju=|~x_EXb2Jk^_9!!{FEXmtPTe0Gg)qZ$i?b-JpTr^CC`Blv&vpB;_K=?A+J
zg(KW9o>mz-`KGkM%?C%iA17wgVR`lBV-M68r)$Q&m8fX0AQ)($^uq0>A7t6JlRVPt
zq{#{Te9jByNQR-?$vLAO<0X2*Y|okW9$4J5&>&#^Yj1Bm_2$)wj~_=EJ|o^sl*S(8
zIqEbA9vE$#xq+NoQ|N#7w%uqAyo=*#G_daeOs{XvEcOu{N2s1c@vlGDocW80a~4XY
zm1ba!Rorg#hVY<bHdYP$PSfpbzM<>%b~|2S>)o{f?7;Q^_vgF(8Or~tK32WZ6@Ki>
z&pzFJ`!^=$e-x8HUO15d5t(A}|MEZnJO2D@<ErIq2VE{5EG7F+4}rDI%U*26&@bGL
zyHF73=qb`SE@?BlnR)<H+<dr+6D_U&*r+<OhV4TZ$Gz*#Cm@J0-(L&Da(dMzW<cS(
z@wwjOmjx|K<1#3^p9=1wR58>Luw?emxh?2w@{Fp6omq#v$`=_emiT`cQRSY}5MG^F
z^0$7Byw1ZR!2?rBY{IU~6-euHYJ`gm)T#-z$RbJi=oSd#%jWI&j}`^Q(i~nB9=h_=
z`wjQcU@LI{vg=Rsuj_O9S7_Y7yz@x@wRPhDW%gI4puId8?cT|Qw=#%bF1vq)fh)x`
z<8Q3Ff326?KUe16KM&93rPhi(y}6wH>xUUzzmd20Hs!55sp0MINNsF$_*ov^l7G&7
z@~;~i#jZ$ej9|&iYirUK#>^kczkGSpRC)4D1_|$v<zGwkr1g1nTSk!?{V-FN2faO+
zLU1P&3U}6J(mID@nY(GpoVPFJ+eaJnvlt>=2z^58{)Y=f1Z%4D$gU8m`NjP+mgmf(
z5He`I%HvzlGLhgwNN!K%Nz;_=fYw2)D8IUM81_u*Tt<w9TK=Z2$!qP&&pe?_Xk~@r
z{Ia~Z)|L??S=644;ot1YYul{wYDwN+T9BE<pXC|bSd{k;nlcCB1b>}Hm004c?0Oi=
zgyLiQPQ?l-P2iR_b0A}suH>I5%%>(j=z`dn|9X`c@8Pa+W<|bL3<8;mp<A7ID^EsD
zq0*Ai*mHR_Z0@>$Eyy6I!i=|I#+Pk*Vo|1Si%j`>L4LShkw<))5mYnxLWP~*<$<aY
z$e!HGOe#{}cqU$!j|!cVw}cf+tFo#0_p&G}Om975xS-hOOj*uUkuwDshNtdd`@FUV
zo3H=QnPQH?EoVyh$ZPLFlYN<GC?AM+p~bC?V(XA(Pe?NV%%Nh#tn7ea7Lr6Qp;P5|
z_Ic%jQza+A7Q*fGoczN_SV;akF9M@-(1uMKeB9^BZ5f4;jW17n5u)Wx1_|%?IaLgH
z%#$s4d{gLKWxw}gnb4iABivyd7hqL`kk}OxNtux!lG7-gWn##1Ary+su-O4;=Tz3}
zm1IXCTP)9+MIm}+NhT6s!8@BL9IGQ4<Cv3bAykWlddETClY<&nnaRxt=ZZC6Ar}rs
zE=2bTi#0jZCX!|Cec@QKsuF8lz2#WR8lx>vO@n<oxM5YodcwrsF4C>`nPU~oOrkb|
za6_2X{4VQ0V2rjrspBrdu}3`qisaZ8=B&uK%z_N@D$g-$xOmN(V!r1{^QH*T1sTCq
z5U=K5NU-z7q1xb3L5OFrj%`@;vyjX)oGIBF2o^kWPdy<uH-)e5j@&UzGKBY_*Axt+
z*A&P8HkNtVWw<Dij}<S3!`9_v=8;QLeiW7vG7<OHwXm!W<zux&VH>|B^YJ4&)fOtw
zL&X~r!<7>I9tjoAO_39IAv0N#qkf3IZXsnhg^qzI5<1+I#m@^Jy&b;kU2`%J7k9{j
z9T-HXa4ch;$;Y<!PLx@hDzmC^_+{XPB2^BCj}%)L9%VkU(6O{Bg516cd2ACQ40Xez
z(7-f>K9G7*o;yXVU$7NzIaCp}wFb`Lm3jEDEty9+4->6%1R`0Jzk=+$k!`pOIZa&7
zhr(^qj&Oar$rAVEqK_cfrYy;8!O~^f1-lpW#1Y2=jtS&MA8g1>N-d5PLaWA^-{*L5
zaiAN*z%>y7zw3=Ci}ITA^s4Yz7;bYgPzajB4hzp53>o58=*MKjMKr1}Yi!J`JQ&x7
z8!9q{Szx|xnUqdufpc+$jN0U`*%7W>l6O4|8|(-L?on|pSB=M2^9;*vLvCNT;>pf%
zbcNnZ=PC!{1fE#twSZf6Ll|(KTXdgYlHsFW<iss+UCSofN7T25Y>&5vfO_OQWR6>$
zru7#HvLXZtmP#BaRMUIJ@1aoSK`0V!3zh5*dt8V5dqVyB2ac1FdPOLAD33)ggwiHM
zJm~EtKRlC9$*75@C|~mS5K4C(@f{IBw#t?8S+7EwFXNieoRlhaI)kh3g{#7fkRVuv
z1Wh3iB#VWLW)ac;0t+`0?co9k-k{g*u5+AZ3m4_dQx41pThYGZEXjp?$N9YCd>*1P
z%(Lh<bcIOP<gdtas0Femr6PB08DX&J%S>V;Tv6E<zA<}T@IvC!Er&_?ATTnmn~GdK
zQCsAZ-GDm-uBIJM6Kg85!qp0=33Yr6LD7&WYa+b@Wa_K%G{c6As3k=iB3MV4YKp}4
zPh}ORB14p}<gn_n3!IB18Kk<0zE_uXY>trN3woS{2KOi_mP6=0$wY!pVKciUH_MW|
z?OC|uUP$hrLGtP%=LyO9%<Z&|^5Jt8!tPcSmqSR<f)O@3NOg|pp0LmSJq-R?CQ_F(
z_JCB}-sD)w7<NTAG>jnl8h89Wx=<*y+86!}OEO`*F2~4T%cQ~s*<HUOJaP+f@1H<p
zAxK-MZEvw^>@s}6&z-p;d|&e6RkfkG&@VW<yK<6(05&y`u(%A;l<kV;xh@CpMTQ8s
z8XPAM<LMR0NhZAeD)aD9<ddcf4bJ3{h4;cE;gZn6`p{ro=mVvzdhKF&-U*?@9ZXt?
zYmd3)Te25WI@&^QXb7YDAxm17iI@gTM@cAA!9)u~L{Xb-V?zkPDkM0NF-l)JO+sQ@
zlXDs^2=ByQj^v%36|*PY9LYiRH)Ta@T=Zqx@KDS%ckRmbE7)!(k~Qtg7&R<De_pR$
z;d<L)lxNQFy$7etAf*i`e$V-MmM0_T5c)Douqo^rV!SQMASWIa*^!AA@0dArupWEz
zidMEOeCZp#423@DLP$s*VxQR~Az%gLErM#0$y6X@S$0$jU6CPd@mwYnc(M!et4w6R
z!FhrMtqgUj<`Wd(WS3W%Vzj||YI2_BdZ;r#D#SL&>4r~VZ*iQ^SQ;XwZj~UIVE!s3
zD+x~p=kkbMhW`6P{~Bgp$(PleeW8CSl#4yt*b2sA5U`i#Gv`SLX$qwmK>`A}`GU>f
zEy5%fK6(moHD%8JIo6Xr*@Y`!;H@oYj45S((2i}P4>a>nm}wOvoWaPDI)YC2n2oxY
zV<<#R?p}G&+Y{+p!4!;ZSbYtw>n3OPlrtKlUvIIh250mDt6UC6343rCHme~I_T@B2
zZG^;z5PnrCcW^56@Hb^mYe=6m(#OgIqaEbr9cN(=bpnI-Ok|?B%>u8GbR8KaoQI3n
zL@_WOVZl8;Px2t+28YPi6P2sa$klt~sxO0>B?j4%dEGyAo~}4gNasx?WlN;^l8kX8
zL!1j0p;s8+a+;vSD;LHtcRirn!Y1@+ViodW1&inlL_g<tYRZNz018#u2n;E!x6=~m
z0#;jrg|NShXA7Jrw4n#CLit&IBnzsDLFW)fV4FSR%6W8_Q`xN2nT!=e#x_UtRyZj#
z>_LEdeHDr8wS@sqC{)}Bp2DKD>rk->6%T|f{RY?k7Od(QVSBxx7C9Km2rMvrilI@G
zQFetz7C}Q|`C1i=E-nk1g5UKnl+7)z$nToqCGtSgB4Y12{yTdzj|lQsFu_bq=mV|&
z6V7uLlAp;a;XU#f@>(B~Z_9T0&j{2u7wiTr3}jLMGJ@~+iUY+dsNHd()TAlN5`q`_
z^8ia;B$H{N=9D-FtFjZpB3I@%Qfm#V70H?2L$N&L)NjLUSHfgA;^x`mP~UOo?+L*=
z=tcgftjlY`v1M4pVpe1DhElbBW=U?u6U@sUdG5Z;iQ;rT@s($+%zJszTag)?C1!jt
z(_%WoA*bU+&F^yz>870V1umPA%VtZ6pv10l?u*dp70%lgnpb29vmo1XF3)XYSi~Iq
zBZgSvrHD&(jZ1VMcC9l!n)^0fe#2{ZX1FIaoR`h^cG$rOu0wF&BM7mHbX$fV`_SVx
z<VbPu_k|vh(4!4KZj~O_XhH|T+6~#CTc{rj_w55sl@J%}U``eG@szD@${4#s{1~H3
z?<e+o3-j`K*s80Sp-i}WE7Mp6A&W7lFStzFfUOWIC_{plPzQ=t!2tHKQ}0lRcQEdk
zI1oPEzTMzFab`}C^Hu15#+kY2%=ou*NJ}S>wZ<XE(u&#~(hW3LOf-KP!wB=ulsFly
z9S#(9D9Oqzn0@8|<BSt=hT~_OMfzVjP?5|f*hU1c!JiSAlp>|O94JIv8F^>9(RWY;
z?&QhRIeN3+QS#tDVwj<<hlt)pShkR^$7)2OK6~>rF$N9}5#}eT1sHzuHHOfNOxY~y
zkrFaMw)lo=74@Ft=4guaT;Syp)@Y-hU7)MQXr@PaN$e{()vi#zB7>L(m9OXQ>nr=p
zRlP0uY!ESLACCoyMN1YAL;zk8+;L{XD<TVljybv@3)^S{Km-QBz+NE2+VJ}VlFG=k
zU*x<2GQ?cRpau2?y{Lo*yvVscl?T0&kOhpvfa-woM2uwD(Tsv3x6grWvH=Y8w&WaL
z3)g}0L=0tbneQ@+SAb@@foun`FhDT?JP{<an+Uc#nip7%4;FI+uNq(-C>8<5*c*0Y
z1<mUa1nHTZ2V}^;qWQMvpeR6~q7q<XOSV4(t_TfOI!Ezs3NL^U9HBcKa0UN`gS*Iy
zEwUreRajMC@O{JpaDf3>0AvWOu<D5%vPz8N%Ryg4C$_S}(kgwBcR5d77EgyVlW0dR
zMER)?Vxdw3ILK?sDXGHmA%I0V53Sc^T4iBd2KG5X9&m-d;=CTpiH;ys@Pg(BtP>#P
zeZZIv_-vI^6@qth%qvz^3xqcy4`5IUVQFg^K*2nxiEZ$4Iw<T723|u)@<8G38Sial
zV?|arA}BLWaPJ~GJa9SKd2q)m2Zj$9Sg{e}y$DHwz<tzF19WcjFNAGCo<)xQ={_e)
zs4F1&4>K{wDcE^s32NbB2#WGxjP7M{R(M;;4Pbb6c$8rBb+&oA%8^>*NI?X&z-!rU
z{2dW6yuC#auyr^Y4}<tBX4G+kHtM5|#z$)WA`DkJHHT0<RMmprz{dfhW3=MR0Xz=y
zy#-hvbHg2h)Yw-JX<H5{Xt`1B9N-%eJY3|~EV3o%NCaSb(DI{*^CTw&3_Pr&tDGQx
zo{>J=EYL?Q7VO-?5+W4=!6W<&_DMzwa4>{87?!|@9#}NK3a>>FLm3+g96n+W_D;s~
z0piu)adX3oLOfg{#SihJh4avQO(bVoIG*|V>q3JKFvwL9x)7rp;@SpVA})>@+#UWc
zC>&ORtsyUehv|0F2R9%%K8}N$%)<v#@b!X%#qlpk01@_BjSb;@Ji^`;7csuwN=3LR
z!o3_se9f1y74a|Q5yqEW#C2|8&{RtEGLZ=1dF383LA<~-c!Y808eF^fg2UT}wHH{g
z;V#1m>;v`~{P3Y(QON3B23h9l2QbM7TA3K!4yut2R-Zi1<w~T0DVkS>qXBeOIu;U^
zF2J{iXu&<o)r}A+g1jNFbMG0n5NE!@b&gLyf=+f5H=3=ZdEq;Uyxxwwq0k1TgUJlu
zT%*2SoWMAQ!$q#<B6NC%$?+~%(2Lc%ix+qc5xS2yeT0D(;5iTRoG+mm<2W~Xf$<1O
z_|2_{IC)0*#c%E_o`rYU;0E^3IN?>OdxHOEp3}c3PnLz7_CWLen;J(7&b&gOI+Q`;
zu3CubX*l6=$ou%0y%rin85;-(bFd3HZa@W`@Hpi0+<W-VZ4DbJ(7Ogg*#;!X36DeG
zUl)>Z;O|;hFqk7^*@k1@B7lm}C1RWicnS!f3JIPHI?V91-iNY<61bG8&R5u`L_FCu
z=D5wL7deQh5QJzYB9{np@(!TK3-ll^EL?!LMkx0pLlCz_gp(oO$zDMFHf~nC%wGSl
z7ZkVwu~TMWw@E0#1ne!NTmubMkm|&kd0QL|LemIS3rmD)oU6_U8%Mu$p3qArF3jnQ
z5CN6t9!9=_K6MTafnmg$dBlYo;=+hii&|>^${v@>G9YnF;UdSc2$jw`piNMdQ|v(r
zc=}<cbR}C);8L)UKsZ7v1JRG`L|1_mX}lA$O2jS2w`xS`6@@xZT-cJl>k$@a2vzdW
zz;p-;vnNYz&NI@Ez%U<2jUnKvNbHnH?3BGiWF8`1=i%`+^eGKaTai&}0XSR{-KdPc
zMf6k*q+i+R#1owsaRU=%<`Eed7~JxKUQ?)48_<EsFm+q3qhb(q7MyZTh1gLL*f!Mu
z6=D*ow#YF9HLw>b`E6_)8*@mE5YvD!fHeRV7+?eY0w}SC-?f7C`&1shkRiYt{1aK(
zF=y_KFqnIkp(VW0K6)YWLJQ|2Fo6di6WpQnwPcWB4;A28h*Y{3jsR;gz!rx@67B#?
zZgQ49qPwi{+dPImu!RBJc~HqnaKp_V<XF-07U;c(iUvR=mmM%qSi)tzuAwvpH67rs
zZlE*)$QXroU`S|WZ`p}uqM8<vT>wH}TLS~0IcH!NKA1%@QngQ51DGKKv8Xf^=R<7<
zvH&3PKr9TvLJ`Cwz9m4;V^3Z=XVT_!#>e$t#3gS)7C;$7%rtw%iN%DAz+(Ui3~)ga
zI0maLcm$&Pg4)o;NNUJ~^O(KhJl+d&ga8(i%phTKuHT5k>;{f*upMw7Cg6cr*cyKE
zeT-VjRN0qr8{imd=7Yv~pfR?L_uA_1D-^GU8oEP(#AjjyYM6edBewqvp<I=78)H>j
z1Fr#rdmF-ri`bSx^7aDw9Y{W`$RvVQ4hQy~e=geya&ExU?F-XXNIt}_vOe4f2o50b
zpP>JNq+9$A;XN0^9(!;M`L1Qn0OBC$9^QruR$*KNl=8Sg0Oj#qc#6pzFnQb`!44a~
zsZp5dkP*QeYZ!evG7OkJ?vIEW*c)biO$aV_mEQmpz}+C{z+Y7xkt4jm$jMnIIC4Qq
zUc<sG`Kk*;b2KFa&nlRO1_T^5JggF&a>7A<Mu!BDH;S7Bq8ku!(C`R6-g?Bd1_1IQ
zfIPUl2Oe)gz(K>qm>88KVx?YTK)emUkzFrhXaIq?k#~>CyD!MQbu7oGh)!U0Q$e_T
zFMvYe@pcvM^Z@DFM7lQ6$roi5ydStN@L|{*l6+qdYs3uf27(1|2c8cfM}vo>!Irr-
zEH`ijb?u#y>1rOD$!j-4@FK1TdxgWZO33#-T(kzk#oI9hrTwCUeSizNn!_#F4Rg$%
z%FbU1zwauq;@UO%d8^neF#*Ij=42T8T4_aohj$pyZi#@_;0|o9C8s{Zi5_|gXgtDr
zhl@DTkGa*)h=#e>0Kp~Bv=1S1qx;WX;h0rcuPK6QZV*)~Fh16pzb1oh!XkK@4*}r_
z9<E^D**f;f16Lx7%PAofK2CJJ^U<!N8;}QMEX0d$#F3v|QzAH)xf9XHN<_k~Bap6%
zZ#n=2AfDRW(n|^sZwXJ~*!3*Itj|I~yu%TWX6r$uXLxg-b>iAJ_<0QuVVuKuiGy(h
zyPspXY{>!_aQ&&L7ng9G{R|OVMdGgQD`yucI=<a6T-11k{R=Mr7}_3Pb1-204b2k}
zM#MGm-^zn{^lgnG!+p$5Jk7SjtPap}iO%=e;d*@fb``AVKt_omlU;)bIOL(3!Hw^2
zbJbkoy{XDsj+9Jy^5m7!v7;9v1`#fFTPDcR>P=JOr>FATg}g@a5>ZZum?!(fTU%H*
zG2*4Gx1nqy(MyY1MZ`SW3j#ySLYH6<f*eB-;+3}HRHB?b0>gqkoLMad#S-GhN5m4a
zMDUVNe#SA>KZE-B==Ce?bVqL|8Do>JCN$0J<ph7<T*DxB`09bXP<GlQe990$bqGr^
zf$)wcEhDA_f*J@i^V*n{8k>e%2Wjms<he$JJ^-a^06j=(*bg(yveg=>Rzgm!%U%$z
zMCek4tz|t~UqJX&*y4B|s}Y6lCVYy}CA-A2I6)o2><b8=GAHCEEvZx`Ua5^DLu8mO
z!hq+9o-H}M#5j2bh8g0O{0kJbfV=z%Iroa3BQ}gEr!O)DA!fvz*%~r+ADJ340lR@F
zg@NXi-BOD*8G%`?;!8L{aU)@-g3)IPPGdTTFf(r({gueDm>ir4^4c{FC?dmz*3Ki3
z%Z<pe;F#;l0=p`G2@SgfFePTT#q92cf>)RzWzN{0&}<EEsB@9;As4rS9&TjDW#NWB
zbsMe8fxCnCRzMyi%*7Hm@jBOO2u!>R7SIrO*Z^I=1`9YKVrv&O=vF4Y3Q=oZ5F5hp
z4N&MBxWn&iY`${-+NkTxGDuOVa*o7&<xnl)wOf`m6TWaxw`5ieGQ^RL@QQpm=UWxf
zqEj@uGvv=bQs#u*l?S$ETS%~jXj%eV_F>yi)SVs3{Ul^Okujd-xzYjp^8+UPlZ-*8
zRS~(pMfCYP5LS^DhuG5VIK@iXc-I8=;*4nnIc%^WH94Na0+7QkE}UI}i#^nXx}1&p
zNWK%^fxwj6RVxdem$lpolh-*7E1bi5nSES=P3;Qj=un<4#j>57Kn=b;c?`U926(g0
z(TMQjlz>mSL37V!jH*2N8K{eqY>Q~UJtpdbknP~YxdSRP1~y!P2(Mt(yI?XgV9b%w
z=|u?HM2$P;=;4fsWZ#1ljI_w%Je3D8u-Yv2yOX!pFcLkibW3_b(Bihelh>|zZ3|9X
zV-x0audFb|h<kjSdEdws%kt?xrq~ejZ(!<OgKi%{)DrN`IoMf<zjPHBT4_mmy1|n*
z$p1SIwYp5?=3IouD&g%lp*};IS9z{_$D|Aw$tzpk239b_zC~`8CUiOHV->)qQ;e$c
z1;*Nvy<Ct%ju>NGNU(#}yoBS^hdO6)@jT+>glJ5m^z#;n3ESUdZFzDM;(gqu1{=mh
zNbGUP1V!c_ViK>*qHbkpmQj4Jk%n8G&viTwHH5)FTX-wNU|o**wFuNlkheAn?FN#x
zjM%Z9!A)7x4dChuf~Sr!+yUFZL;G0a#2+H#o@M%*LV-FmZUxqy$M5s3&R%rr6BLMT
z@=eZ=sJ=XTjFdY=qHb$w!XDDjgDZCkGPo02U6m(4<M&|(w#6VZ{)Qu2?~4$ziRIE2
zDxPvxymD3S0`e}xL8tQI1=rFGfg0wNyBvf4oO`LM_Yywa8~FPWZ1@T!<V=2e2h_EK
zoQULWm1Q|ZaV*?>1vFfiT`yIH-fIBL#~g~iN9eIDbPO)!*sY@07=-VJkg);M)q<Y`
z_M!y8u7l}<6s@xF4V-mbI4+8i@jw$*kxW}WSp*nfM5w;vtvkojR#6`uIcOGO_!waL
zNWRC&=ki=B;tVdpBFkJQo3Q>4tnYC(fm60{zi%R#ExhlMX&jz0*gePlWD&lU_qGx8
z&yezvBkv3QUy}{Vr`ueu8<4366YT>l-wFq=3ylF;uE908IMwSoHiIvmi$}c)<y_p#
z5Ou7M6ZqwxoUdnY=N0bbL!37^BJ4JWEmu&Q>&W{ZZt*)9y9~!#S>C+R?FQGGImY9r
zR}&20VvIdrev+Zih?~7bWPIit#BO~i`j~NT75wFj^RrFh%^CAO<v61<G&s3U&`i6C
z3RRRnzTgslfjCC!cna$D3d`*xjbhIGk!;8d{>}?FVoi?49dE7hR>Y^b*|-~dtIS(h
zxX#R-%yEqy?3g+3;s4n||Jsy|ykd%FJxoH71_W6KuMc3qT|oQ`A;>Cuku~ViXmFSi
zu-CXd4+wv=B?QH~kiSL>+^THQD_ebz6t5tqPuZ;(wt7n*ToCFX$;Zy&s#{!T3&iCv
z!&R?vRhwBI0j_i9KBLTSqRd&8IZsa@EW85=JP|b~n2p;)ZwO|WxDb49-ZPHNJ-c)w
zWPC#3sBtv+Ihwa}G}l#04Yc}%e7Vih+(1b!GW}4<KEEfMdn;q;9Y{RFm8OD=Oo@B~
z3mOQW8xcC2BDv~_IG@$cqkBK&;0?>jI4kR$mq&^%d0_<!SLc%7;pV>siQ7Y2^Mnv*
z)OHB5d5>|?>9vIZ)Iv&Dv9GQ~co*m8k<xw{KJ{f@$B6F(tVQM%L8P!KdwjuN@gib!
zeuq03J)^;0(Zn?rqlq4IF}1mvF4zjgHOR&E%Eh#ceHk=ijTbp8HN1$c9Q1~4>jr1^
z8u@nsQn3rla4U3NB?hwwHZ99-AP$xR83M@I!qD3U=d&OK_#n)k@W&dsV;!Vy4`g_o
z>-$Fdql_MP#Ti-?mcQe<&)Dc4B-jmS;~pe<1y~N^Y;(OoW0)>+zn_$3A`yex9ZY3U
z=y)Q7Jj;Xk0L`e~;W10P04Qr?bIY+Qib8(Q;d(`xS^z&b@W(mFYYSq35h5N@cIB1R
zbq-)(0YAPL_E<sJ@L1&zNmX|ut75D!YgykW&YB%zlREe83gF{BsMZ>Q#1-do2}S!x
zn6bEx5rfWljf3n84r%~~u43|s@Z`EI>Q+wCH7dli9DoW|+|7#&6=31neOxtF+0Jz!
zE+bEz0xxWU)a(La1_8brBW(JDZ|;I4dn#Y+;?X+?7ixl*FQVBLk!o9DAuoK*hYgpY
z!81tHHuR~Y`kesg+~ccR1JgCf#Ae}j3GljL#|3-b8D$~)8Nt*cYD7cc+JNbccsVhx
zYzbB21s4zGFA6i4<e$Yh(^+PY0nr)3E;GNCNv^Wl2DZHulB_`zOe?zwU0bqwag1-&
z0+9<<OAB%av9N;A(7(eTV&uh(GLbUmzxsU!`~idY8C;RELLaT^hTXo$Ig0A-5d_~N
z5N8wFU^yDc7_iL2?yysy2%8fb;~YMIWuF!}g@!vfypWBm9Ha6cK}jL?t2|i3zOWTs
zoYx>_hukR8+7yu#j|kT~XVkL9O<B~9obnZpXdQXDLps(Sc1(DMJUCqDM2S@0lyhE3
zAgq8}-UHpPAx&3-oI}pxx*UyL;$`F?NFFTru)!s8gqYh$%)QFw*FjRR3CdbVQnb-(
zZW$!t(lD~h7i8)MGS$e(PLZh_$kbg#<su4F5jA~FjV4&`RKC_lfS)74n;M2t#kp{T
ztKlAi?F{047CIhtUp#YPY(t$ruBNhZ)R`KC*s8|_Wf6w}Wo=8ZCeHjVSnxh+>NU(5
z??Qgsz&yn$vjI#|A{nJBr>dsVq3ruSn)e3sZk2;^fN8d^Wp{*-WuRam`MV~ByhFJ9
z5Hk8Q10=(V-V{n+iPY%e3A&SS6?cda_W+Rhh}~o?y90xGvKz%cdEr?;c5gULum~1e
z9Fku@&#X@5V;(Hx%_C+4&f5|Q@`)zHa(1`i{UY}h!fXp1=o}h^AjtEmco&S-mM1GR
zMv-8eU5@iBCw?FN*pQ!C2clfz2+VV?*WkA+uH-}1!5d-xO<Bzf_DmfeeMc_ncmZRf
z&dGSt%TP|njSO*()8z<$Y2$RcRj}-c6Tc6i-3kk?3tKMBGWX>c4z`e24LExh77AJ5
zx*X?QMmPm7(%T95S`+cG$g%$-LtV(1b~Q?+%T<V>^NR7>W@a%)ewUjN58#EK3hZF+
zm`%;DpiB;SSLn$OpCO0uIPks@`xuYQGYq$_5r9?nn-eg#d(59RHey4F-{8Gv-U|rS
z+GXQz<+WAvh-$pmkU4I!&#Rn@1F)D9>czTjV@;vMBM7o41i8bx>2m}l6zpwOgEb*Y
z8G>9vkh^sb6NIiqeJqTi#nx>K^{<4e9U0<TK6TGNKj^(g(pkg=tm@&Oh?*1mmN$=A
z<p!N?3D@Qcquj7{_sr@<KIRFtyu!ifP@sZm^BRlj91h-sgNs6)BXZ8pIWDh|ae?!0
zPzWwKE^VQAMaK9-h8rf7J>(GIh>Y7LVj)sA4;eSls@G6d>j(l%48fvo%nbt7JRk|`
zIMlEJ;{|+4hRYz}V!ai?vo5mhn%Dyj`Jheg!L8veakYnBE9(Rilw^g%82iY$Ekr~^
zgQ^!<dr_XdkWcL*P)|XH2t45PwuvB(@gH=#1*xTU2qBDo>y*F)?7s^3Uj+jy^kj$6
zsO)v8x{xOv<fBzVTH6A(uc9@da4+3+FP*U!K9?ZZ(lgi6He&LYBhm&z01PO~v;Ytc
za6+(;m1MBD!xwH~un8k*zzoQM-{jr~QLq(`>M1OA#sz#2IszI1GT^gW21LOwae90T
zTY<XR9k3YSfD>{ep1HR{U4jR$^g4OaEwm=ki7ON;#d83D0D)|o<FkiD5pW{BkwdKj
zj>0+MKFlUu;jBjL7AmoA>%zVuI00TBa33(B@R}oaK=Ghmw5AO?kia(vFvq(Pf`b7C
zU5@JSDp6%YKm)-Vr)L`u2_mi=;0gbp%N0z)00#gKM4KE|(22?`veBdb6YzuwJYm2C
zd`?~XiW2;U(<kPb90_xSBA5%jAO=7Ha3Dqi1SQbcMKt79ArL4+$;#KbIshkvE$p3h
zIY2QyZ9}T)2=X%n3Iv4X0Zs&f6X6CBRaoOp?t^rI{1kTy8RX;{Fr8or+hqY-l(B0p
zd<pgf5Cn*0fOIU#OI!gKKH=^-1jUJEOE;;L2)b>+x}$(74B+<Qme<<y+WfYh7KO;0
z%n`8LR;bVk-X6X%NAPw7Dh@*K<4N%FB-kYsLLYc2#Fb$0p$WJ+7&+*6=>Vnffeom$
z0Vul_qqmdrE(p27E8(@M4aZQGTQvy*5y0E=WfT=|H~1xd)$LZ0n~|_g0Nx(n$adn*
zFzVaDFM*FDyyj9lP-~atyG}(iRZfN0r6oCt_$UIyp%3sbSL&b$=OQxHn}Kh`RzYxl
z!;#{;1o1XN<G|#>8mDv{=G{Z&c``5%x8mI(<DlfxCf8{TjoHRrjYlGV6yXN%UX%#~
zl83JdpIrplB22U@%T$0{;cjqoFmn6CnwyNV3gi}&D~V6y7O9GPf>$HhLa3f&dDjr(
z`$$B568I<ZWSC`0-bN|fU^~j(7Z%Seo&@|8K8^%~UnAH-BfKNiEI8qMI)vKdmY9KJ
zxH1fm4LgsscnxO*4rIH<*VJPRxPYIxjrm<cQk;T509I6vxifLt7BMk#^Oho5Y=L|I
z2xiAMZg(If9$UP(&s^S{IHs(S@#YGb!x=-}<L1RPj`!BbF>dhs+9mFFpHzqd2Xc6W
zC<j|GINc5IdFB(YAT1-5ie)sX7-dEM>^R*^6(KpUdRyi?5f5^5KcPBp2<xwsfG@uB
z<mlp`htvVSaT~B3C64nth2tnB0PEwNFX9;wuhGR0FgWqq;=hgXAlnw##vZ4_lLg}F
z-Nv9YxNMJkZVd+ChO?_E$)EKuq|D%&o(s8Nap2k)X5Yl5Swu@-l^I{4K;!mZl;?2Y
zhOZplU9D^qbKH-FEnm=|@%!RrH@Mt`HVV-OB&wk$?Q;h3&Eu!X^MJ=aETOwLkVMxU
zibuT&<y*H{R5;lUF8AOb)8&Sfd&O~Hf&k*2pMlIc*$>g0aEphy#ltcZ#=?_0#)~+{
z2|sG%1gmh|Pw|t5FTA$J<w?|%zbGRUfMf_qvJ04-M@;bo$+Sz*IB`ow`Sdf2!6vfR
za@>z8s70KY-GLqww={DCJ$wSa4Dm>I3F+d)erFK>9^w<YL=cl9XpDiw6?VF#*AhE-
zBm1b4W*T=!&=>(^whUA4VPOU>(1Tbgcm-DxcxDJ1BY-S09KZmfv5PvlAuLR!nP-qR
z1dS0u7G8r893Y%a2#Ix}H<4z)EB-({ROre2h(FR`B*K<_y_L9$TL{uBz>O~_qDVYc
zX`j6%Zt0j3bO)d^MI`C78co!E(fA_?Msn4Wh}wWpURZP!sS|K#93kWIIvC=S7Ue-=
zn8H^?9FbmO4T-vsL?s+bL&!kU&9Xcgv_bGTw0y@ks#i$y#69X6${={FH1Mn>^Nqpt
zBghm+#8neD2F-{xEA6tI_uzLoToq8sT6mIBuVRacVS>#LsgFdYS9nM4(=$ix9y%%>
zfHDb;V89fDLtsvynrEOB7Ib1s#sC`dTWT~>e+R`oJjOQ^Uf||$1CR(HFatOMim-+B
zS-_)g@U^}mnYIvh-~mT6!mFBtSUMGeh%Yim(B!&k2o)8;Sta}50Q>*~1*aeu2T0~!
zeA>4{MnQ094%i5AA26VB84q|sHcksS^QN$-;x~%sfVuzyg>^y)_R{+np?M|}sjU7{
z0G2bMwo>^De{ctf7H|O2fV}|k+~pn&WWG1ovh){jJ^+Q7b4cN)b3$&K7%_GcG8ZWq
z1UO-U6bx{HkLNmk#^<}L@fMto6LQ?|<xsQ;L<SB38i?_qSB^C75X<IR9t1-ug&-jy
zI3DOku!DxYDMu&(ov;=?5O@L<2>b>x$Ij#NU1PpiIJFN^IR*EbDFRNQ^a17sTfmMl
zc*(+5jz)+U2<`#|bdA=xEaa|W#ofH%VOU1*+m{DRRoPA;AOp5-0J<wL8k)z=^2}@Z
z@|q9U?%@>jf!aNw_Q1*pMP>4?0NX8K`;rU-J`S=C%xxDqf0$JvE(F_#9suHi;{e+w
z><U`}_W44QnV3+qiVubWB7VdexFd=H?Ga;zA$wH<S!qy3lAT5cH~1rp0PW#2SY3d~
z0BR30@bF?BXw6ET2skG~tSXBSAvPKzL-{eQcOdd|LC&BO><Z?MI0`rsVhI(SfwBgl
zhK<p4YBKN(r}F|QnE?|AAGa4A&s{XaMMzzg6)Lz5)E&!nz~kXLqM*qTRf48YsC#=a
zgl-{rfW(2v!)L_KwpuWI$hc#95@@>=a<hPmgO3Myh`1Ia&V%DD5DHj3o{1GTmw0Xm
zzTS*DONj16HV|*bCh`;?#sji@o?wnO<mf8F>LE7@&IlY6z()8pf-R11gByDp{@LeF
z!Wn^M;#x0TBt)AlY2$1LfE(`K;aj+Bi@1()@RkmM&M?M8jIo$N-(Vief~yv{Z4K+L
z6u>!4VD>8rq;;sc1r>4C9wEo@@EZKRK?oV~iia1Bg<IUiEso#T$0=^`_u2*MXcWvt
zM&DAdjKExjzun-N$4MVzjM)GVu_f|?s-!<G0xRQipGWWBfJII@76;53zj$yaN4Lz&
zxWx^gd1xIIsca+m1GjjHTl|U$hcXF=2Df+-w|H15mT8YsFyA=U=R}b;;kHG%s3<E`
zC$GAEao6IywHGk>E}BA&B43kZfsfbQ(5oMBEuP!pj+5I0;@HD#IF<vCi`Tn@2l3Y8
zxecEQBin|xtK9u30BU%}TQUUxb*mQ>f_O~}BVTdu4>_#3<#EyDUN<<~BSs2w9S2Vw
zj0e30MZV&pzeep_hQZr76<=Yw8pnA7{Ryx9IycO+UV}o#0Izu1Kp3rZ7ld%-I?<XX
z*$KjrJffijqM^cLiqR4cWp^}a90n&G$`F8Lh(@wYc=uPxjS0_~<~#?AxFuqk2thIg
zB-x6RRgWPg*@7fQE*)VDVv7=wWEVK|2L8K%{B6iDkxMgQ2nRI;jS)Z=F0<Fa>(zv8
zzm>fv((C|plAy5-9y^7t4w!EV45uLv5@=>L?2MQ(rPvib98vTqAkr&16DBUh#6Gkk
z&WixDu+D+Owg_76-KOlMMw$_KW*1pH_LIgRX*3dXOGa-d&Sq0hm>6TRCZd4&qtc-s
zL2f|~F~(m7<1ezX9-&@7p<W)LUh^34#4rVS$ek8)C*r)HAm;87b7x3ZL)a1_Od<B4
z-Nxj+LaH7jRSAe9hRi1o#p>k*hpz!FJ?TYA&D%xU8bZj3H8Vt>Rj~fz1)%l_I#up8
zR#fOi2pO?vMIya|HX#PD!l)5svLR*xVPifiJIi_($`b*hUSUIP1`rtwKpX-P+cQEj
zEC_M9Bqyh(m9RNDXmW%^hs0zD#AI6_;)uwQB8aDH;j;uH)`)0=%`FhIC3rd{M4<@-
z?_$>(Kw=Gv)^Kw`Vhczd90*NzwS=l19SvItBer0~!Iq|JVYGu1d!WP~D6z(^0}@+6
z;%FBqcc{@I;KUN}KH~!u6S%HX?101(Bnv@_twz72qWZ*}LnH%6Y{7^v@#evj2F7#B
zK#Bb|@-RZuA1n@;B2EHw4>U;ucTA<F*_Pz?;g7NSV+{Tnau56$4PRk_xMRXa_5^=S
zfImjuABiP_J4TZf?zIyH$Av(lm>{AGnH?Vf7!Q98ISM5W4#6E0Scr!|CQyHjP^(0A
zh=)7I#~l-r{t&4@#^R3&@yF~T%5cYcxMO_WF(K&>7JrPz9}__~=w$H682mB*x_0nD
zdnDJSf(Z~4NOYhzY;nkxhzTLrB#617)ggobGbT8@rOg`932}cK+@B%tPmBB0;{J>X
z&MxBrH26PD1ceY%9pe5B?kG%Q@qdQ+KM98}tq@g<`_sp44v9Or#8g|{pTU7_0scl0
z_ou=ANl0}})I<gI-D(Is4p0vVsCP~jvqrw-0JS(kgDs>^KtLTXP!AWVzX8q(Mu`K|
z;sA}9P>2K6;sEt<fD+U0V>uiApBDdT)IwDZmN@$w)s73a7HVyD`57M23bE&w*mLp@
z48aDLU;|4ULb$6bcPyN61Ckd=JkTrzLJh)2s=bE<8(4x348aCuFKFHYp$3*vgRlxp
zO{{^{>;+khPpE<B9S~_?i8KfvG?RhkGeQkKLJgJ>t{$NVKA{GoCPENvV2L#dS|S-E
z?aqPFB-X&c(S}yYa)J#k!3N>H%!?co6R{`68u-K-gpc6Os~QbSxIqN1$ucp78+e2p
zkUA2?T(^W91cVzz(E5OD>UX`SU~;sExW<i13ate+j!2;;)%8q6?g5Prpm79fT&dt?
z0yMT{zLM)&BACB~!b<+C1v9oJu!coVV31we)m9X8#7S8te>K!F^^5fQLPxTLeK2FA
zn6X|{gu(zBM+_W-8Cx)8@{|1yt_2Wd17ci>wAdVu3=)(rps^2VTszb#A{>!`#um`n
zl6M@EA6!A%@PLgCurZm&nsy9m96_^?{9sGIvIlAmrNbs%q^aV#XBLpHWRz=qIlh??
z-%LoVy4759oHL|~lThyCnz6WM?1G*Qgci;j59bV-;+j#8YsTW539ON6g!pDGzL_Vz
z5@mgwQI2QE;+Y8v=C_*9KQ9mNX}1h=_9IRc8*+$u=Su5$z~2lUX^}ZxGajy)8U}>j
z<6PjIvG`^pNJc)t!8haKo6(v8`{2a*W^6;-{|L=~SLrD4;+pYs&4dK++f}WSfd@1q
ziB^(UXUJgnaDe(aKtpn91I?ku18T`&ZE3p(HV_Y}`K;F=b6iuUkBF{{ES}JL)6{TC
zT%aVrT9REYE>Np!s|53twQ6=r0FviOd=1GCws=6p0Cy5DP|}Qj^?;)L-~hEaK%-rx
zyCu`u;so_^g8Dc?H9PrH??RNHEuznt;8C2Q9!^k$6BN>V_&_Z_&<IM08of{Av4<OU
zp0FzNlQmfxCujtv$qm;;aj>Y6NQ1D+;nW0kVhwy^4e)=LG>)H8152WKOg=>wP|Of(
zPyzKW;@daG8dzct0;`8m)9zqSq7BF}_s_Iw7jlkZgRqJljA#Q(v;j%wz62Z0kkIcF
zY7i1?V6RlF5^E5Wt?m<SU?NS?qI^hzc22N?CD@>{uTU_Tls4wr<2;eDEJER?!nLG{
z_{17S5Svl}Mq&*TUM1MTC)gki^)iIv2selzH>Cim3t&Kw36ZwD@CGr`7T`DtWZuM5
z8-QbiqKS|W3DLGM1ejY5rY7CmKUX6PT?pvdKheGpU<pJ?Td?DBNzMz=)Q0#k59nB9
zq=`PSX!JSIaYXd_Hjr=&vqt0CfsQTEam2u}rpE#vdw|CT!!wcwwSyc-j2mixwFbk_
zYx5A9uZFRQ+KL0{r38zF2f*jR$F~GwfF5fgJK(VeJPtJeoB((WeCz=q`y03^@X=U&
zG$j(OeS9>Uw1A5y#6=TnIz)&87vQ5I{a{JMd$1kx&{)zTBGMs3GCcw^Jq%tNA1@8Q
z6wP43M-yVAMdW!@Fy9Pb8lzqsd?_VOxGrkVSuOBL;UPvQXT%Tn&d_{GikFZMQNcvB
zcxfU=CTWBW5)U5@(+SCju#$I@Fe^@)2%<#*j5uk?H1RjJeFsMvA58`0EhN)pPkTfP
zTl)BDY8rz_u8CDA4bISjIBi0s%`OO<hc}eyYD+}5#T#k~j*bY__VI@r@rTY3QB8Pt
zh%?mU47E5zL#!!6qf2C58+@TYzR(a~s6A7P;0=ukLdX4By4GVT5|#Msm=N>|#$ZgW
zc7Qk3!y8I)y9UAI3$^${BjyuERKg%s+u#oM*C=7e1T-WbZ)n7HLN%rEhZ4<R#DVOu
zs%5AK7><Y%cPatx7Jq1oH0v5xod&_<4y|Ad#vUe(<{%JsU<o=14mHt$GfLEfN7R8&
z)Pd$85OiQkLWoF-2njm~2s<EkfjkCM5Hufwh=VZ3oC(SGu$ss~)B$-6WFQz~4lFST
zmV|_eTo0>x3`8A}#^4cjU<f)0$+Na3kywHbBIZM~i8(;5dPE&)63ITNk1P^P*g?dE
z$TlJMgrpIlpo5TP4@=a6CF&r8&g7byJtBMvI`9ZOu%wOHEBu-PVF%&7kQ>Sx4Ljg#
zpvN)Uv=;c-0w0IiU%Py*2?K&2lgk>DO<ToOv7pDn?_7m4L}>-kst8=GsjQ&K0qAiB
z3oIg0n4DJwdhCH7`=G}m=&>c0)dC)eBntbW#|HFRbB+Oz1Hj{GTg&Yzd`#-H0YCP^
zkG&@?^a!4SQ5Ta=8<I|IL6A$7!qU`bY*8(X1$-Q|k-wx0M-bZsK=xh{@T46Z0Ave*
z9AeXj)WWhL$Q}r?4}u($x*lNrN~-t_dE?}l8$2}@PfdiU#^R~5cxnuu8c#hn<d=Im
zYAlYL;1HH4CEsf9IIbE}$4M|ZIBG188cV);NJ_rd)Nx!jWR8<zuIc9ZX~I}78XPqd
z1C!iuu(LcIH9n4-a39U2rWNwh&q?+Vw8k9s#Z_Z))dY*2jaALj;-=Xa&QyPv`f5CU
zH6Fei8xd!Pv&Q1Ai6B}>uS1G#<E-&<)`X<xTlLnE#2QxQ5pq}!PEitH{h~Jg;}(6<
z(j9n3gWtIinI&FPgI84ZU`eSBHV{oXMI%y$$zU}&MLnFNngvU$aDY?P;uH<3j70{k
z+16Snctw4@q9I;UOCD?(AvH7$8ONx<20kS-(9C7LqS3b2$mgT@MT_`Fef*-DtNft%
zp|DIO6G|vT>aoQ$>fssn)HBL4#xZJfj0SBOnSxjr&nTJ4K8{iHl?{GTi(fRvFG{Ys
zAp*e?fe`KCHVVmJuaLd&5rg0pgMe4uBLu+`f)E^vNQg;auVD8XVh}uH5IkZK3^53n
z7=)P2{IH1tA_&1F2w{Q32tGjwh9HE1AcQbh&6IT!g<yz6AnDvA2!WLU5M#>{gJ6k4
zh)G}fm(_~mUL^*hh5;84gJ4%F6ID^uj|}zzV}l?Bk01n(AOuTte&FkA)ci@IgPOBM
zA$UX~_(UOuR_{f&geZgvdUy0*#L=l?(qIObIO&L}?eIWjqsgzQqL~3|03^_;Y3i9p
zKo+5fjVu#g3~1p~(#)r%nE^7en_8e$g989$Eb-Q03%=qptQ5!~prl!(5$S|jTjH$^
zMa?{lnt2p8^C@a(DQaekb+-h?2a%AurPa&P2f%g!dO|>pfY@zIP<+IM6cJK<2xteG
zCnO}@66$V=i4PZq2oRU}cmuRUpnCusW3{H4J=NHGc@p9p&>;(G5dm7jVLq6JN9jNV
z(h!1KRAG5bLPALGKp+B=6FeXbUk}kCW|}5QSP~K<azDsNFdznGF%-dLLPClxNevZ_
zddyMRd<5`<67mt0!IH*c$!V~fMnX<W3GrAVoL6&CKrBMiBcec|S#A-MO2{Gs=J6>U
zXuvCMk!y+Rgk*l$XKhZ!38Ho&r1j>tg9oRoia`-`&?}^VcvKH0sRTTzq(LN}R%I7T
z$7o*xvD+SHIt?&5aJd0Iw}e=SCF0Nt-L}hQzMu#C8!BDN5&{k)!a7nM9v6cpb{f>%
z$HU;GkQ!A;iLs6}E}dv;OX#!#_^zS5X^b`4d4;(2xJY)BC3-smh-WN=^TGp%uW5mo
zZLLGjb`!oGF?3ODezr7&SXh_c28RzcdYcgUkTRXPD_%5K5-*3Z>L_vP0Zs->jJqY^
z9Wr_N7z}<6gVQ6x$50_K-J=|?0SXU+;w@PUmUM;)FdoR<>=AS2fyMh2#0?1^v7{+j
z5*osJp}m0SGbA^Vmf%wlH>4h}B}*J#1yEZ}*CuF?0Kpv++}-8H2_D?tg1bYDJH@pW
zcPsAD;7;*UpcI!Dr$tKT=lf^Q%$@tpxjSdi?C$K`BhPT=0wEZNYU_dgC|!iduy-Gb
z{?4BLf8CIYMbXaiFi|XgRb}_lX7=Lvmvyt?Q!sv#vGJolJ%Udt<7Szv^82t67N5)%
z5?wf1dVQgK)bmI&Vv;>U0X2b{aeVjWx-Oxijwy(etCtB(f_o#N4@0?OOKf;z3&VS8
zX08%`RW6_dv+uH)h)hZTT+>ld-Le0*Nik_?c#HH6W<e`+;zdavK+XC&PiUbedwrJ<
zobpd<<h92&dZ_6aytL-w53V;QDvuxSZsXl8I74RxuW?*i1g0+_bjLXCUH8TpiUovp
zVHJPF%x~z{=Am)*`m1TmIKG6~S$xsuhGwI$-&o18L7Jx3o74ZJk#kSGb;Nu<G)$gm
zB{LT4!TaO)w{X}1aYEYCtz&>DgrAbChUfDkos44%N7No<omllW7w;Cx+y2Y%=9<h~
z;90Cdp=hqF(L~nmqM7SPc1x9JAwp}a-V1L_Rz19eC_{lRqv1XKVNlSt<O4gDB5u3C
zvMgTH*s1|#H}Qd;v34Bwn$N5rBPRK9IQB6gjRTu1?B?;P(-?)vQN1(5nqDsUpA_=-
z<=%fam=WtZ$akLXWQ1~Ogb%&p>&N=FWHQ~UWVpyOPwfsp?0zsqNUmx$BxdGQ$h#@S
z{o?bcm-{JqGlRpF?@wTv06L$u#CgR|;^qVJM2BMUzS6!%B`m*&SyG1>7}jP#hWW6l
zi1tU-?`Hx5W0dNO4R%<YV!V=KyopZ+BPPq@T!)a6+(s0lGo7$rR-qQAj4!dBKvK*U
zGecN%tkbrVIpQ|$)Md|Trkhokxzr-KzasRmV3&{cX>Nh}W0UsWf02%rEYu?_Km%M=
zNEee(C_4NJ9UglqX}mm*cKdlWn1|oxfC>}}o%uk<hFK#D_2=TK?3gV5m0_7^{8}*{
zJY<iJkDEfLsJW2UZ*ov1^er)hxn#cw68Seb%t!q=STV>L<(Y;Mu25M3iI~ZJqR+e`
zJR|7{LjkzRjC)hoS9<@m|BLku6}0o=tw;Wf0}7X~30;)52&%We3VU0KWC)Ile-RyN
z<bNv~l!wrQe>Mi4dO;bt0J<fcml1>`sJ4+ra<u1&X2MMdn+>{+ajCzIsil}=EirHv
zbieq*gu(J9A~6WN@3G!-%6Cr-J3(NbBvLe}2?SwVR4EgD(G>;O`jTO@-HmFrpnNAz
zxB$#jTw|uGIZ>ez_}E}abt}%A$)Avt>t+LEusT?`mkk+;tjdoRGTS0!d1`4@7yGpf
z+S3J`aw&q;Tf%x2$qCX0WGM;Ym@Si0)98Uz%J1cVj%=r|qY#<sl18!EWXsn-Y065Y
z_3i4w`Ov!(rrxzwawu+iMWAC&A<;TfoPiImA7TFwMhIA=V~!!wGVA^{?<M7LIJmu4
zt8HZ%;jrhRV2CD4+z{6IP>LffH=+P^v6&WQk1~BMB`YjIRns5VP0rT=x_~20gG$NN
zYn_$gxM(jbnu#wci=C=?q?Qc67rcz9;B#(L6eQOay^O;kRghE{^{4DMG$@5xkU5Cy
zd<JzEOVK}c_f~d4-bK}>jyQxCJ|u{q+fAhh0$#pnpJQT-oH4U~&zO291CJ%*SCr`b
zimW=;LuUC7HK%%G4_WQ566;w&4{PFLYg#{{oROZ7<Sz=U!vj++supm~Dd|cF;yy-C
zZ{apusp|(CmqCG~QXtG?o%dL702WW|(r)w*@f!v~yeYo~yh0vVukh-=Qto=Sj16Ih
z`gk$uol*6#jPC8~d=O-@AB?g&jhqQ3ndz+L+Az@kcu*vARD@bWjr6nj;=4&taZ~>r
z#k>T8zLp=pLs|N^=Xrf28p9O7(N_GD-0Ce343SaTj8>^KFH!52BgKeA$80FT7o$Ng
zfM9)&1-sM0+H7h=Vf0WlVlHs<qZA%~I<$5GkkegRpomBN;wI!RU5gYQ;k>}`fpuEP
z6^Q_GUNo~&>|r(zVaLn&Gc6>uAUbxnMMYzmW*nI`4A5XEeVvI?z3Xob)mU-I={#n+
z^_ty+>c0K6ChM=`DoABRUwhSjZXFSIV#nAwuS)q?!2C?4@jXio`SNraAMto>i~0*6
z)tX&lz3mB=wxLafsMvR_Nlut01KQ*5Ug}%yx0s3Z5azUeRMiE{5-GGvMM5Lts13w^
zo>T(;2Srd5QDo!e3HRA_WUdshD#sfJf3Qm5aE8{awlsR_)mwNar<oP6q6-jyH@6Gx
zX39~q@5$2h@Veh8xo791xIA!baE>Kdo{46WbF{t^3k6x)l(6}z3-mDye#tbV+k;IG
zyLvr@Y!%v~yICI1Wxe&7=1lXdJoq|T9v2-?|79|bE_29pT9ZK4m*83~G^ps09T$5+
zBpGq(E7`Fy)FfO?5^^E2BM@B(i}m$)GaR6C9ZPz;qALJSf!xiVRC<4ec3o-q4GSHT
z2P*bccR*1C?3R7H1w1Zs|3s5_LBxU^Reo_kHUBLPS#8;SIX5e(mB-*F^Fhpi))*6#
z2wCPc!xz63=A`}D;$y&xCn~06mI6UE3R%<-vzWC-HZcZq*xx#+M*d77ykp;2ZON*h
z&t#`|cH|eIu~8~!TuupdPza-Hb%9{_<O(^dziDH(DToZiF7xRr4^wY1!Y*qgufH80
z3mq9-oFb$#gepZF3#&W&%7V1j-}t})+z9&we8%^mS<M(LqiUoN#t2&!f9NJuIZX2t
zO!=fu`MlgoV@48K?Cav590?Y;VFK^1@5d{9u|kNWUU|Cqit`xhdZU&^7&bhe-nGrT
z5P=^K!8FIjG-R1bPgTM0n0O^qZlnD8ZNL4w4jz;oAI5nfD;C*eAV(UI;~z!cj4T~k
zKi3o`cLW6h(I-ujQ3xx97;7d22&o;XcL{`|t&)Lo9VDZehTR%lj%xy_T^|i-XYLHy
zv&k(-wd%oLdb>GyX%KLaD{=#7y)zIyq9IrmfFn_@PskXSlf94`c&!mzr{=I<Gt&}l
zT_lCiVFYQ#kY-sF?U=JbB&Zv(5!Q0V%<YW&x0@aH4n6%5`;W6;&!2*m;+9SNmdz`|
zcJ3GtlZhT^h%d<P319jv(Wy?nx96fs_mSV_G=)R@d~laTYMPSlET={gZPq}{!XU?3
z9X42$Fc);V0$98iKKeTH@)ua*lcMHS4+mBmpkn~g`Fe7>5&I*}LHdo!u}FUqCJvk^
z1PgpRM)~PPguEub9_L@j^`x8byugnh@_VH3+4A|-ZeYc1D}SRGdD<K|9}>JF%N4dm
zGVy9yGFl+8ejJIUfii8fPa?pgRMM|`7vl%YrKW4vJB2uVloI4kNLc#U%8ySiNAf?>
zJb{Y%-C4Rm3c2Rn_5-8LQvONQ#Nkiwy$krZNMa_z81DcX2Ko0#HX6#}5tIdD(AXCb
ziXDzM0|!MD|EBZ?S_U_PE<N~`okcyi2JY4TU9B}ok31I&m}%!m^&BZjqRdLQcm<{z
zDedJZHo!CU)H276CVBbaq?yDOECCe7*7fvLtwG1)1cQ_1y+(*ox~o}MZH9kY>90W=
zclf`|%uDdxuG0Ov&n^3gtje4h6!L_J$N(+^UO{Mc-Q0(tv-oFFzEV#Ol1B)drpA9F
zbb3dh+wmPprx%hf>J`r84Mc06Doj5)E&}fKk$DjcG`sj)kPL7vU#FCIxcjiCiI>W3
z_s#>PS7==K6(1set`z@?XUWOT`Wkd(leJ>MO;~2+J2f7&(L?`;8|4&9O1a+M;4qN5
z)lsvJn_Tor4)!Hy^WMg)vA$rY=|0Jqf}}g@Y#fng^u2*`&qRm0(kAv{gkCWYx{ly{
zM=9)vt*QiHQ$_a48Oy)LkZu_ei2S>lK6GErgKoT6-=pAnfzToLs3Ntg(QH~<kZA;h
zzHh62+*Z58xqih`b%$}C|E95e>eE8(k(KwaBGdqV;8EG6t47+V@|{RNccw;Pd=;Jp
zXA|p{K!*Kl!W;CeiP5rCcO23ZNCg%pxBWo8#Ybcg!vVI-u^=?iY!(b)<t>xqH*A^b
z_KQuahJ2^>x}~zJNOSFpa!a!lS0XJOC~TX1Qj_V%e4`h+ABvow+`uF++O}Z8W1I{&
zP<BB{a+8flS<)i^<n?aF96EHYujQNCQoc|207IJ&Ln#Ua`J{MB#o3seUQvP1ThFD#
zrUTm)oP6xlmgxWcE?p~4zew6FMry$GPZ0X8+rUcM`khbDTQM7|qHU<x0-)#~Iy*!-
zA%)S-*XWgJj5Lz&o64a$JwQD%G2^VB9!BB$jKp3sbVtxr^s*2%GbVXb9+(bIbgyTO
znbo4EZAV-6U?o0FeTs%K)m9*-MtvVPK=Cxsq`jl1jlE0XsQk+gaJ2Fz-M6Mdb~a-#
z8GorM{MzEJzQJcXd0L&*T+iL(6N6LgD!0q1fhP?b*G1So#MmvRTIC{wVL7bHrrD&Q
zwyLi;1l_)sks3=!!R_>Fy`$1riHpAsf9{>ff7<R)Pw^($`xtYr9fD<RzSBDIDn+q(
zZf=uKt+*hvf0*PhlP$Nt7<jo`Cmr;SqIh!*)3sIA;c1(+GjVShBqk;+&zsdrX<qu_
z61w3kUu=*8q~5pyO@*VF`=xqWIvuEOddJA3WXel5)=H;jN{R<NF;Je?PSVVifw4cJ
z`C}Q?x*Ck_4W$?t<%zxlW5}4~-aYOU5Mn6F<H~bwk%J}4Vd6F^Pqg@&#H}mHyALVA
z<W6Q{`DRc`a8kD5i_bp}*j}77>bXMkKk;*U0Lu8eQ1gAFBVq&q*pQKOHmN{Pg}JNN
z{!h33Px=F6%-*p&M$UxBC`$vOsJI^XW97U;wZ3LjzGid2UQIjEBf8_cQmE4!7N<QU
z^M3KTb}DPaExXhv<HTgw*bLRdfANxi$Fz}Ixne4k$l<^dK2`>*V)%(=ap=URIEy6~
z^L7{icitFuCEL1Mf*%~eL*8J`BKnz{Yz8q_N@lZEtcR`mx<198Sh45(gR~6yriONV
z5F;TChlexlo3iL4K^|cACo1MWGKL`XqXrgwGv<qijofba7FU!Xy?DjFs=*6na_>f5
zjC>N-dl)WJeC{LCzHbuA_Ao|S9;+dYb4M`^=BX+#txI2HGD#ZvV*ha<XL5^HrCg_B
zu;a1+U?rvyWMMcADGZ8R7`8~>bxPjsC)f_a<qlDGmy<1bhYwMAK52_l8~i{D>SkOG
zTQ3r(-Sk^ei~~ODQG%=qG$gWBi}pIN?dv#Q1R}%Etp|+<gefdVgIq<x5J#nBgUO3F
z%n0$1*#vUF@9ho8-Lq?7>e{&Nk&zq7?`;^7@?HK030}B=2l2ymy-#?7<1aMA^*J{I
zTj9+QjN<v<gIw!@drnMyB919(d4lpfA5J={gXhsIRX`6SpX15Q{O7p1CA*>}!JJny
zCLtsoBJbrhePL1F4&*;b<TG($sA8cp^>Io!As>TLIU1%YbQ0~?6rPU3KmI}G-Oy|{
zt>3pcl|u;~uSXn39e9(KC@YocD@DF4X5mEeQHl*<cx=T!yWEZ%JZ(^YQjD!=#bUHG
zi+#Hq<N|<1oS6;=91Sm{p74!KK2f@PW+bs22Oq1Q8Y`pQ>}?u{4$gqX!M4Tq^XR^p
zK8m8(*Cb_kQ0jls%v;ogO(nV_fi#xeU7BDoRDIL6E~P`r*8@{CU01^UZ5I4J%J8ze
zx~~UAJ;ZVW%BMK6F@7CAiijl^8{j&THk`aQB-;3kVq=K>A!$dxB&Fzv+%64t<h{M=
zTd@s~{F|h?`Zsu1XpcosBWaIhhR(v{?yYageXYjm=_WC|F#-m@oVZA2HaNd)ILm!!
zOeSEdFm4t_xCzy=)2KbgzuZw+y0hoJj4dm9B4aVJ#zqnxgLxs&5+MZ8GSn#evCS&6
z);JOM2MqAXqY4!leCVr>N}6Hgfx>C@%rOb>k3Uf-B`Ii?xaK%d!pR>u5R**MSW3<f
zCBn7Z&9<~9bdD}SFWMto7FRQrP+h~-z|lNQunj{0Rt2{kYj?8Y+mqG7p~r#QZLEyL
zoE!!RL=OGx`T8$Q8(L`7sOHq?uX}u7Z(5}ZU)qMCH~z^+TO8Bz)v~oVw%1ISPqNti
ziEA^hCsfzG6SIBro(<Om-F5EbHN<H@7DiXO#{V~&3_njZ0)ybcdAe7Hl6xNn%k|&r
zWQD)E7a<KOw)sx{*n;ydH16(@4$unKUia>8gv6gv9;Vy9W+o6o^Btw|f7-<1cz7q`
zUU^&>E=$`m+uE~d7kElID<ADT6_h+%1=8(G%kW~V38z(=Z-P5n6`QTQruS)^ne#!+
zdpOShl1m)l;T~J=gd8{7?X;bfBnA4hZuyRw(Mdh0Pzj{<`9zI$jbZKxj#5XV$r5XA
zeDH-#a;mKhhafNnCp_fdyu5;C1Hqbq4G^#KFF-ZcfX~Zu_vG@=yp_mVAm~0gdJ<Lt
zx5NEYuEIdF`Fpuv;WLZwrPo5%4QRg$8;TPBc^Zh?O>^F_vB4V|m`M`g$6>YYamHVd
zH!QLJXDFhLLjunQF_nxz9keA1Y-e(xO;H%F!r9xZl^|oyH1oI-;K6LM0!^)B@myUa
zPg%viGPjH56t5%_zA;+s-{YaX=VkGhF+UH#Ouq}kL?~}Z)(|p#W4(oDmy=S|;zanw
zMf8&c0#hRHZ06iMuAJ~@6vpZ{v<2}TJn98&<EB=Cu^y?e;l(;!ZRI>8&vArNO41Rx
z;>X0iQyd%=uWe+}0g9ZL`>4IKGWnOE2yb(zqPr$Qu_0JQ@^D=Z{fX^7*4F%%zfs(N
z)}@K1O6gavZc<1TU=%>RC6ud5<7drVkTF&%n5$GHoR|<Dt=O88ts51$iP%I({;52!
zTLTAW7=?8Mjm!tc);@gEkGlXQLE%DqWi3m5ezkpU@f*KuzR8<&jLXH}$683X#J6cj
z?V=q6^Rv87NJa%#h#ko+;3oipqiypOhj{2jLW<FbURh$eN2pXrhMN4<F^n7ApTnZl
zJJz1nIJH!qE`L_g=lz0exGVrIUp7np1pmuOJXw-{g3YN}(+mADMFciH(kq%4!Ps`+
z+J|IL+9kpi8je7JwB~{2tG6h0Qq305v`y|}RVl&nUJNBP@~Xl;%siii=$<N8F0zF9
za#7>FvO{4x7g3(2Vn9bK5&{C)&waJsVa+H=8eBdwzt^eUu=KJ|BuiK%%d7kw@jy(e
z$xB<R0ci1?QcXNclvkEQO&Wi(3yHJsMQs;ew<O(mu@U4phT#(e-L@k9j6AT_^;@LT
z-3Uy5){{#waMCL_C`&!4y_*{OCaH0lBD<*hysy2H?kkINO6KjK-1a5<jZhOA=%9){
z(e8P<*54y=S4xp3jNac{R6v}<m{KFG-pxnj4#`mEF86?EL%OjH{tu~cBdmL(1!UI!
zO>m~+sIGY45%V5_6bTV8rpK*KXPhGhHtLtrS@_mL^LV?CM0!?2Jhax=i%a+hPw6+@
ze=TS4><|5Zg$1cCTVIp0XssB_ow$=9?#>q#=&B11`#Cw%qn+yxg@HhH1EVFt)kN1M
z;0g1lz3!)1<ap$i!ZvUizbG`JQ4(y@UH9|DPX?UOsPuSOHiA1CF1=;bEdviWeGjcl
z+;EdkcSfTtY<)30DpUZ&TXk-?1esyu<+_n;8Vy@zB%@G3l_Cma^|IsI$J`qK6^b!s
z5*tefP6YK9@#r_(;_R)qXnNF;556OmtU>wntr^1zIqkaM;Z1L4mf@ae=dtH72fX>T
zV2-V~f52@}dQZn<LK!{d;e~sZNt0?v^VJ>vp=bES6>SOuoHdQNQm+k@S2FKb8ra9o
z^K5x3@n`uQhKo5IevZbK52cB6rTZ^DC<z;$A;&Qp^9yLmueXYGbla)R<TtGDnFgOA
z%fH6&BNiGR_mCPaK1BY9OX=BsO=g^P^-y#oNcpJhsX%kta~%GAzwCWpnTV|17m)ED
zrl0eu`g6X5unqh6fbzSc9=G9TY7)HdWdTqc+w><NE{{%_hzmN8*>?ARTtz4WFRkr~
z1-5!!3Hkf0GO73nkui3<^U@PzLw&M1UC}ER9S5-u&}G2ZNPx}uqC&v=wDEpk$*}6{
z6u?gtPkHnkDyPGCN87!`3GS<}6#<ZYLmkILV;<h3Eo;(#M=;KA;RizKzKzvbN#`u-
zUHwTeC;=k!Dmd&1Iz6R)h8z0Z=Iiy;0a8Ldhh~IkvJ~^LDOR$XOa5^Irzq>%(pW{P
z%bD7c#*YjL*)%2s6La1gZQh!^Kx2^zpz;4BoC7$12}fA;ym4G4+5E?2NBChi*PX?W
zOG+v0J>MAF);)Bqk>8QZTX}$@)$Sg6U>AATwO5P#xg2`^3mo}sry3aRB(*bn{eJBL
z%Maxpwtyg&kMcmic8bxd9X?kp@k3FLpg5;?2pY%k_;lm+G}Hamwr>3rm#<LdVg)YA
zpvbRLM&x|w_MRgB{8ekWA~!a>UCZwl#m+3)y%2Q9Rd0(K;v3+=nqbu?I#m=b-H|Jt
zL(V`pk`HH+&rPtxNxZ>HxWSQLwXrP&k~0R(eUeNxwGnQSbhHZ(YMH6L_okXZSP&j7
zpp07JP$DYDUoC??n+7}jpr^?3N6m#r4Y*~!-5>YLW^kN~CO22_p#}<?#gru8;#dhg
zbVt$;u;bonImpPOSp#2+FX(o0rK)}}aYMNJM=-Di(0fo&q5xVg0K;8@U&Ab5E^e;>
zS|T|2Yh(%Wf}*~Rk{X`?-|c<<s*Dc6%yvkY`yYA{A#W~M6pBCDPD2{&Niqlc$uBEg
zMnIZ3^}AaVot9tdah}L7LgOVLcv37`XW0EMT0rC-c@a97lez~MN-1IV9FJE_Vfw9-
z))6@1nS2``a}f(=>J^~3iSRYL5P-*86kFl*u$5~s`!I_~M{gt7m0U3zDezMS?Qx>C
z^w<{^0Uh)LKGA$WOg5B%LD8@*Zv9wzJD+`gB!Ltkc{>-)Ywnue<JfEdMzQ|1a}%;l
zEGaev2VU(p<6n4LQS+ARF0Xx4J&3(n*}kEnqrW1qa1%+K6f+{1Y^B1Q!&#lg%D>KA
zC5yq_8e5aLvne9P)5&4)ej&n2vjpbgA+#_Uc_soq(h>(YDqfkg`J$kqu8Tx$+pujB
z1KPJRYucE$E#wa{sd!P_so@^fy9>ta9G>|>0NLkAJX9h4M)%7OD=^7$BaUcdnwuPW
z(W|7E$LnGlm6Z?mw!gfT*xMFDhmJ<)A+Z`H_{fO2kVsfGcw4>`-1S_rslA$pig-ZT
z3<sr1#C3Dw5v<bjGY?Rx3ykHq@E0c%Hq7uK>fzKfaqHhkkrg^4xkzD~4=CD(8}f7g
z`C_e%7wIW|o~=mf5eD%R9N*~p=+rGuRGk1Id0YHc6sJ7^)(<#&mCg#79DON=9-w12
z_B0TowBBNy1JUuYO1UuvbXjkO+i$n=txE88nW5JM2tO!SY#>#l_sCb_KWr-@3kl@-
z5LD9FabJ{5Eg4vo(>*g(_fnAjkywoD>e!#dn}2d>CoDD0y!7=c+>V~`(%b#mvT?pA
z_-mIxZ<#KS2tQ_(7vj0M(8A4AB{`T4w5+q6KdAcofPFXG?<&&aNpCeumfSEkN)(!0
zLRNBt$<JH+^*$m<8Slex%E23j?NNwjZpMJSHE!6TNR*Ujrk{e;K7h_Ux`M369UR{?
z{MoD*L!-e?<I>vyGOIHAU}M+y!HedgjDUXvHKo<s@|cwP`1>%F6+Jo^RoqG#S|3fi
zFiw=U6ZP~d_9<<ZFh*AF$a~RDYF{p4V}hB^atdkngHCZ{H~YamF<#kIe)$hK^Bd^J
z=wxqk{8#)$rU9a^kq@q`Tgm^+YEJknwjoCzw968<&$5cy&PF&3-E7vewk&u>T{?G(
z_Ifp@Y5gXvwx8VTqRldvrji?7cB;@Ywr+K_;jd-AN*PcDyH!F(hNSE(^y6Ok2U+p4
zeviHoQfLw{vd-05hd+zx{ck+Fkg)HTl&BpE_<aX(x(fLVY2V_*v4hgdZjbAZE%(cO
zr!f0H>^wPxVmB~f5HGddbq0iF8q>UFR?%-Ks<||le#$I{*PSr+X#|fTe~(?zjUh`7
zg^j39NDobTKreyFM-hQ(lzxCGCzp^1ajfGyWO$q+OtR-^9g*nxs>qLs>>z4a{GF-7
zM3P~*$G_#4qaFwxaFAg=Z;vYi^Ef8N;uyj=a`SJbHT;!-GGvFOiZNQJ?DCr_=HdQC
z85#aQGOXg|m9hUWE`tBH5hDU@g_|OuZ4?CA`l0k*E|v1c&vN=~`_PXl(SG`g6~GK7
znpqhALI8_mZI-jOB>POMFh#Vd&Y#FfI`;twQ(v(tZ-Ne-sLwQ)d|I`eW6<3SP{@4&
zt#rjm>ePzJzXhT}x~ncF&RP2telyvpT=NfkCP?6_T|bET0FMh(bvE!FZer4cKQIns
zOEy^l9WTUDNH;>Cmnt7v0J1YKxY0@OboKCFE~aR~r|MsV)Dyo$KjV(frM$PGdcr%l
zN=#D7z&tHG-T^Nw@_4~`TC{muSbLGv>u`g&wqGFZE4g%|F9J#YBxBGiof!!-=u|Cz
z1M|ffnlGr|EMu|MGuVO~Y@v%ybP|cjHgXs??5rd8VE!zh`xG&ty4A^rW14G?>3H7~
z#PwnOB23<bkQs;I?C)LK@&u}7_`->A7Z#PXdaSI8OI%Jj^GqZa^oY1t-CXO-sO!u0
zkVQq#+IK7LRit{axfXx?VC4{nb9}R;Ep2puM+~#L2+xM5E$<YsukpCFG%fNhyIJ=I
zQ{%Y)H^U&~-zhzhRb3JYJN8#BZ)aZmoPOGvGga4kp<}YOyePREx09>y)KIq&uV^}o
zBZ}@Y=ekU$g+f)cC5XD!iPfLRY`7NHcU!3iYwxLxqe~yB%~Z5d+P@rT)_-{6q^VTh
zUUhEIcEp`7v&?RY!9R_2InCxHnC|H6u<qWBdiTRGvw9x7XH!|Da4OrrqV3JQ)uvqQ
z`+13HWF^H~4PS|>YBIDCtTA1d&g4=O2kzh#`H@^2tORTBtg?uyTJwV8cWQqCR{Vh?
z_BD?ED|;6<-Fo7LHJaPCKO{i^K<BRH!-(E9&ihweD8hC+n3K2C$LEoirf)Gc`FC&C
zvwEiAcCDrgytw-sm5wPS%s3=0=Fl>}P&B;ULO)hYXye-Xri}ZYGXZU82rVMy7jb;t
zj~}7<py_qGr!&CQ8Kn0U-8)t(cQQHo7G{XpV$808vm{ZJ>d?J2*`BjJANQa_TP@>@
zgR8pBti~Ak`s_7B{gPW&b8v*W3JUdd-JB{uFZ@WZUE&=<blu^+QEz+K<S6NS)2NUs
znr_476IwX+WzmJJa4K9`<M*I)9*Vv*7Op^Vvb~Q=3R(Iz?TchaSmek_x!cH<q_L1=
z)ve@4S?3D<gs-eR|FE&OjhDV%Ei)^1{#Ik^h)Y1RHf_s;R1%4q*~~u2XK!@xY!Ly)
zD|~Z!%3iPj(^{6GSJ@hpkT2<9n>+lwZvRlvbZf=*Yj#cfwL#@koyZ1(ySPR$2Zw#|
z3&ehR6~YX)uWfLzBc;~mnXPH*Vvk%z+}X~QnH4I=uf7DU(jC|nv>ZGg72a{Smx`Zw
z_1-6}_nE0gpsjwfm00b)Wn(9U>&{&gdeS2_`3XYw^io_*WR4a)mG0U_&=gsmBf0AT
zP;s*>3;%%OiY<M9*+7!3oN9)ZsT1s-)Gl^ca85Cu+l`nuwr`eeY;_l|*fp+x!zw(A
zO<MkpA-UTAFI%91+Pvk?e4e=}MJ^ItuV+%PrxW&@a4q51xOly~{CyzIy*^^b4C3%U
zY^E$Ud#Aisv^}xonhYb8Q>Z<ugZ|lR5QJS<p4+vc{N3Y;3g-#+hlT<FH}f2}M)%rS
z{3^x-Y8Op@wX*o^LDOsqBG!YA{a6nuZN5n16_omF6k_l`sUxLlrPM+~`Oz;0$e!lV
z8KGAou8XWwo=hO}w*z4mvE`ELZFHA^L1WkQR|qc6>=KK>VAoP=YJ?^0xt|X=nieIs
z8OhKx;?Xj?;Pg+qn!Z(gR)U|-ET2UmkEeWheT%qghn1YBo0=HTdeF9NlRSLczpWC>
zHA$aucKOUb!;iI@_jyH9ZAxLDvq{|TXOetVMY(Y$={Vwt4dTb%%IRp$QhZlH^|BvZ
zRU1)G&KvNiK+*cn-c^VagyoFF=9B_VbfNKpt^Hlp0xj414@<orhUtg14BQNUk45!5
zO@~gAoPd;s4v{s`{z-Zzw+(;2d9Z0g(&Y{$rw+=YXTqVUD*C2CVHfL(ELz#rC;8Pm
zfVo?q!@;0;|6vgoPpR8azp3|ULBTucLfY%EPEWaY0v0oga;>rriSNn@2EDA{ni{iU
zS6BSPF!(jcDwPo?#mD6|=}O)8@)S8@f2+`SmvLOLRLp5x(>^s$8a>}n6~~wLG%aXu
z^xVDbqo!tPmSscy7^%`tJ+7y^mHtWWtTc8AlW&@_t8Z`5jQiupQjF=3VidSp8!s}O
zg}93I!RK-%J|i+saq9XhZ6Axigwg=OS-?(Xf%&+CrA(<Hc@2`BOogUwjXj?4Ws$n<
zy+QGIBc~2PQp=;$v20Y_)={pexGKo?92qlVt%e&1oTi^A%EfS2RxhhjF_jHLtK;)Y
z*XI-5Cr@BpU+|u-mm2OPT6ySE$sBlQY?g<1kCJ=3(z3qTvaY+yS=r}Z8=J`f!{O9e
zJ<Y1*RcChyF={+~TdX{{WzBTtd8|2WTTaqiI~kkTHQTtdv7QohBrjR^H-9vowP1fD
za$QvfQNoMzl+FIeA%W*C-;dH!1Tvn&UG@2#5-DMj6uyb~mP42jPq-A~*MrV?@_jHl
zQ9ftC-m-s}Dmx->F~cxI#<ATn@?TxI>r3f3$@WjS9(Csf81AJApR-%4iEdSoqCIK&
zj!|qd0UXk?%QL^>P8kAM-Ke2`ra~{Hmh?|$<iIv-VhY2!sAD=`N&QmtDYTn$_3KK9
zGt)SgeHB-06|AicCcqdf6eFtcH7XdYnQ;h9W(w`WV#^HUwd0!hWgUa+Fp9f57tqcS
zZ86@0Vp8C9q9I`Umu6A<GZTj2|9ibR2LDHysWZKyU)xxARKo72p=q0D+aF1`6@Ijy
z%GTw|-sQ^HrJl%HqIIsk^}8uOP%CyHmVB|C^v>~mRrua{?A5H&OVlwfmDGjOrap|)
zP4G3TS#{i=VfjK{RZPyB{780pJz}jfyscI2`zlO?94L{*WX7EtR#p%Iji_@ua?Utp
z*}p7G)X5ezUQ?6Qzr<m8r#Wzq{aS|tnwQt$QfKCCz$mSAJ1;>=UXE^66c#~{IsZAa
zi#dvlYlYVmz8;}FVmFLEJLMpDjwdl)-=r$#_<{%vSr6Hidq5#Eo3&)HIyH7R5`JBf
zB{yrTXZzjxZ(B`Ob?HGNnf&6n7NOTS9S}ZgSCF);WC%6XrsG+ik^tq4RaoJAGdASx
z)%T?h7TJIJXD`EBQB#3l<m<ud&(qhgxf@mzTQNU!usho4vB?1M;tB{-?KPCLMwZSy
zoe4k)H!yUu1Iu*f-`b+%#*j}~VCRGsH-d}#RcgRR*_v0SyY8u}YllDB>1}bR@>b<y
zyU3VCa^0ZWQUJ_PwX7Wvgiu>`=<*NC4y_+@#mYB}`pG__p<|m?jHIKrhDsn~HUY~0
z(~Irvi|qj=gkh#H6GlCzB7ksPqlUcLm3wn0;#MnTe=4Fu@P+VsZrQD;e%^gXA4`*Z
zSHM9Hp?4y-cqxKuA2B2inRj4QFt7AXEAu3%d{gRC)pTPZM2+vvqgVO4rR;Od(t`BM
zYo3r>%AZmij|6cgNlNXv19mY_vo3ObuvHoMhDVyyEZxx-L1uj--%>4$U|s4e1c6)#
z(l`Ve<b<f+3Zd$)?l>ih4*~(S2=deE_++H5r9zMteXS~pBcaIFz<lA1fS$5U@5H_#
zzu<?owIt|rB)%xb!Ws3#%QtFRE}mNX9s%^swYMbY8p&6i<2NXD*YV_l=up=b=Tfg<
zN}sd{x;sOeSHW+qzJ&4sgD0{rB2M2I(QYn3`q_*6*>`gmt-Y}{@RE@JoO*As;#pOa
zQZujn4TxD-rMStZ<Vw536<aMt7ye!P7t;6wO(D8K_8GYijXj;#GNUTVJukkG?495d
zXDAR`wG{Gm5cPBT>XcqBrTYFMy;$I$1oAZEUBeH0hrm0=r1e1X5+mZ@Hd`jce5tk<
z<0r;|#tL_IFf!*Wx+E8@AD7r?>I#fho&*+&>(X$p%8Hb#>MrSn>T>SX*HK;#P;2bh
zwpZtzdH!#&+ks=y%E>B#Dc>%hEV|0B1j!0Mdo?YOOAPwkmq%Uog`VbC1cmWpzL%L9
z5ZRQyA|i_`NwKF-`_K{2`X|#i2W@j`g)!aDAVAI=lL0qI4&Bz~Ow%;BLBX9ZBtE@*
zK-9mNQlt{I&tk>8fitS9LzMkwwql?g@Hx`)#>w$z?ZRrUe^lPqMGXPWF<TUj7AYv<
zOFTxxKX^BrQ89D0I+Rxn;##7^^a{2jC@GK_?ksA_>gvg}5w@F<bPS3}R7_c1BwmI{
zk5n8d4;)lmb)l!eH72&qrjI{IxGb|uB_!S#i0OBgqLT{1!&{8HCt5pxS7W`knd|os
zYuFzdgojA430Hl;B*sB<mE_lA7W~6>fr=tc8^e!aY=p-SZAnuo3KpPu70Q8%OB%jN
zQ3^4e1eO;dO1X{dB0P}(ji^TYvZ9+l{z?tJD5;3(S;if-r|N&`h~A~Yx$jLqP#kP@
zMwxa6(mml`ySI$hK?@{rsUi#=dOH&NP`*a&%2+`0PJ6@S7&;OYIs#9KwfAjNFlvHp
zRsMT}@=reDHKdf&86k{LytKWX?pZ`5CIzjw?&LiqEmHC&C^@F1gN2!hNcsmcG&^6|
zIA4I5iC1fSCo#=alF<THDnUk7o$>9jKC@CaFJr8(#5IVCBbcb<%=*i04b~N(6J>RR
zF5H5vgUv^Fg|k_;w+vCj$Rqa{-Q9yV)MFxezz~>Jkod0npb!!{ih&Q|hMr^a!70PY
zrPmOm|4HF(;_LSZ6ce4OMk7%O(83kw%i~sdo3Br0zzA(!gBir7&8I|l)P%`{y_K!e
zmA@&Qnc2s584G)c#RDv|R<M-!sFSfxcOds}D!J_-fTr?RQ+f5eya7k)BhEwCy_wQo
z)8f`BO&hhmvs9nT?z@xikD5X5I(D-^12WS(_w;G{Fdv%3kK!gi(46~*(t|(5&{LFL
z6Ls^gO-5@f)$m<=uBAjJJx1POKW}XOPxUx%XC0-3!#2@pGtOr-C>G=qRDycCCneQZ
zO~|tR4(C*cbWytLGL@08CTz@@)ZNoS`6OhqpAgnmb<+{FPat#!`1>_NUU>T)@Ib8P
z@GX~`=0@y@@zkDr6GOGtngms?G&JaAv}A{+`J7BbG(n+JU+y0yCk;S<!){Kv5TX>6
zFRkWFJ<zWtHTM`3{l+qm?*Z48_wp`(UpeR_$iv!v1iWxJBTclUt1USe-h659f4Prw
zUsp}LC*2)Kq>AV08SG<q@ZqT9F;DvUY_7m*SwQ{Bpm`#Rz>y3(V_hUT=gsFouGwF4
z{+5TH=TJut@Sxlbv(*}TT%V|jeN-qq0mrn7eFQD|Zr`d|n4d&qjb7?BLn<|6sx)ID
z=822UB|PA`^qPq4x)xQYO_?ky+e{+?Rogr%Qv-^ZI4|;#x5cn;XZf!1NX}*1G|_s~
zni<Ykjttm_^w%=m2;uv~6}FLwpIY`=2okVMMFQu2(qB56KhkO{Av8K?r&r*G(KA;n
zF_XAqU|IbhB|B*u7T86xVVvPFsp)^1ad_C}qiUPN*kF0De9VT6k$LJ`ss_Z8V*FFb
zBOmjsQrb0N`5KhXjd~k`&IKMIkv>%#_hyaaV2Vm&V+936Efeuc<gn_lO+1zS01`?;
zMhqARYZyQiXc&8?j$%uF4VYcg%NWm8aWM;GKV74z*n|8m+OmxykhaT*`VP-VTjr7~
z?UDVZ2Og#(yW-sN^1(qNp3@B7;_he#ZtNgtb3<t|Sl;36+9pAp(Qv+^B2ER7Z?ShT
zc6i@&a^JIe&mf}-dzb%Vq<pOCvxLza-A^FoebsP0L?i_!OutbMbh9Y|FdsXRf?Jf7
z%%~%Ig8Wu6n6D$aQLU3(V%>=&&5Q{QNP@~>dCc^zff)`1`;9wmTBwCD#W_hn5fN0f
z*m(JJ7<WA7!R~}@yHGiEYXNujlsm*hsk9t1VLv2VagG7K>)Mj9T`m!?1;bc7CfrFB
zhV>pYRX`|sEz6CUfG3pPAH)B}xfQ(-KR(}1COxGlHEKAp)C36CTPhwkszo(`1cTaJ
z{3`jw^H-5%$u4S<lqftXLNP+`JL48X>d%{m8&J$l_$o>epcc}|7p*t;hw>!lzEkGH
z6;vAuutaeIo>{t{SyFHBp<rbISg!AZ0|L9aTc&@}JiqW;Kj6>xs3u7DV895{)3ID^
zz85+wF0(0^NZ?Z=X(Q-L;zr+6XmU~=p$<^wZWxE)<5HvCJqpp>%i5g_>qujTU{thh
z%X_BN!vCkLbWPEp^3fOY%4$EJmFhds`wKV?vWB@Ipx*s)SE2M4Ts!dd5Vs=`3ydZ4
zfILLwdrHqew`r_fSVSYCQKUH?n96y=5f5l}k5WPW!)T2d1<2BzZlhFg`650jS&p$&
z(?UrRSC^5~)aG;mnkD-RYCPTOrh9KPTAxDXA&7@yn;tCKLha^FNjLFz_rUYIBU$<{
z<_ma<8H)AP+%wa_=Gem{<!+ZYi6#+$mrY~3!qH>BySv9vmM84Bi_!Yg`ZhU2Y?G0W
zbD@Sk)EGi`s=s9k!ABkf7Np&Y2r%*K=xlvWtVWR^31uFs!#3NfBYrG*o-cIe{*_&&
zW#r}mw_g}Wvb$ZuDajbja2ttL3S^=`x3+N~$+f<XpE7t2N{nY6MV*cZx4LT#?;sdh
zTo!Rzajrpu(St0;I2D{+5a5Ci@8OLBL>na7tXTWb;yBI}37{diHvGK8rq`vQCAnik
z;OQIDE$$Y%yXVpM!Y7jI>rF_#-S4RCTe8H7Fn7%pqhc-m&BgTrt$TmxC*t1qV<bx#
zgFO(EO!#sXb4Ph!y;|x|A5A8guJmk@j;iy<agDZ?x|NxaV^nUVcCJQoq7R*``NHQB
z9<41ysHT)cI>6v=D6Bv`u3&buzb-0vv?fQ8b53>GyT3~BqQtNDN5p%#<6-<i`aR|D
zz)jr5N0vU&bI`K%g~;zH4%x4!A8L(DTBx;bq{eKN{&<a$7|dnl^X(~xN%7NlE+_qN
zu3IY?qrhxA!>4Uz{?s55C>%#q!-u~Q{4eCR^`Bo8=*;x{O6NTVHCjoF_R3~Lb>}*k
zN;1XVvgZckgUuM%&avi3ipMA<z*Hl}OUcY+&)v~l>ZwW(--Z^xS>7wh9IBp(@%yxF
zoqeR>Y6;SlR6w>5BY3$jpNVj}MTG9Kx@@i(jw%KHlnot{Gm~gj_k1Z$%lmEDSq4V}
zOL5FxR=B)*w5IwXF-h0V3Z+?)Z*@_s6m#FbZOM~hCfFv0Wy#VuT6C>8_cT#%0NSOr
zFLZKY(A?j+=U%Aqk`P!w><9u|EnUxrkF#H^YyWpo#W=^B#%zlj5G`$q(f*&TXR;7?
zBqebv86k<HjOI}~$yUT^%OgfsGF(vmd4rgytL7M@_JwN8{CLs0X*){c%{AXeAn$KF
zISX~KjaVA^NS^#=>y{pz@p%Nh3et}$;k-dCr>@yVHtxQ&HcRL&3tWTpq1kB1r8AG@
zLFGrI+UVp{26Ly1IT#k`_6FnfnM+=sL;h?ueZ=sMtE`~!*A`jjHwkjR-DUCd$FNL|
zQ3mU^h`M3#InTxO38tZNn5o44XDkv&$kCsO&Jy=6ogXN4cWUFA*UL}#gF-&vEJ5~v
z>D8~$T3(LvP)&;8fM0NI9@9M5yx6Y~OND4{N!%vmOm@z?H+@Bn0xztwN!+UAku0QH
z$>H2mcT?CEa{)TONvfZ_o>R)6mRAdJg{}IU9k^lnLjWrl=dDaWcVU~t8N)-%x1=_|
zhzydZzIGMzgio13D7Q25JYblt;4Or}V}TR}LLdm+ne5D(DcZ<^u!Mr&XIR>2*seYz
zmdPvr&~nlNMW(*uSzqNfSV9D>l}&@I`t=RF3K^pCncY$&#gnK@z3^lR*r!n}nfNKL
zV?Uz9R^8NF*0hzmX(QcG<37M7w|CO6&_IJK05;TB#g|{Ua8Jv?8T=_uV5<xLQSk*H
z>5@jKDO6p6OmKofRmaI`_W8;7b*%ZFeLa#(^K;JZo(JdRQ_%(Q8r~t%=FwQg-^RG#
zaoBN9MXPL!GFh5wqSd@IgWY#&yZb5pzkJJ#x3@G?t9X(4O3&wP<*$J6!rJo6%Pouo
z+uW3w0Lsf;yay*F|Gbw~UbhhFZKJKap|`AID|16W6SIU0g@nptI<(R|=8I8-ns3td
z*P&eZSBfi47QZlk(u3Tax{~a^PUYS^)7o@o(Kj)|M!O2R!xP9v(=KFxi9BsODmCo8
zRp1og*po7+Yj~-%^sH%kSt&zan-RaCMkf#=E|NNj)yT308N@wuF)mV+O}o<`=t}A4
zl^?ri?RuQvdvoYBecwdHJwv~-P+mql_J~3r>L#jYxu)3gr`bg8NyyKr<=O%gQ}!cL
zY(rJd<zf4ssVEZ&n!OdVaxTxS$VgXZ{^_l~PQ!LtsU<O6w5hZqaNH2su)Ruk=fzf9
zLMvI}7R=jhKX<*+HRZh~YM-r!!^rqUo2(#r%O|Sf-NJrNx}G(uYn=Lq<H(h((Z#Fi
z1yYqMkLAv$<47}ZurgJbc7Gb}B~D>DTb1zWJ4^ci_i3PJe|6#8n;4Mlmp65uhGjsb
zQsI)?O#f8mVx}0$rsatl$x7QZg_P-!L;;h0B#Eei{^#`(Q`6hC4C-`KLqKQax6P)A
z_E(Jh)oq5bj0;(H6O8OO9Cn9JR3<KmE+;l?%gU($7(cf<cSAxemqB0s;qc6>cNxL5
zFC?+9emW+zx)rl7sm&j^Uz1>8v!`4-=QMMO-R98YXmPJi;;l{AW-4)WD?G8Of3a#<
zo9y5rdqH!Sv>kv+&T{tZYhSN{2g@~cU1f6trOYKB9nqvT+65L01@85)p7lSAbSTzy
z`R3_%i<TZ{tz~LwyH@v+`L{~VycpSz(@|ug0kUa0Y7~k2Q`>ByU{*cVRrO-*yT<e=
zQ^Q#k9jAVnIOod(E!jK;+nF@2Duo}Wqnf>cJX^RSDqwt~i*2*T;W6r%Uqc;^%Klbf
zZkQOd6-Q*BJ&nUA=g2Nc29KK4jY<hIrDL9ws?P}B=5sP-P^)0dL#DC6KXL^N%v6MS
zq#B=GHagSt4{6TVq!(%rb)}|jf7H8EZLoKK0eaZg=qIy(VBif^Grj2rhrn4lmrV`z
zx$$cqNa3?dA*M<$COYH|F!qK7UBh*k3bFe)x`v#DCDmZ3Lt1zZ=c0rKou(4h(Yg~(
zJ}8r~m7zt?tcJ41v7SKot(?fWGPVzKKNS`x5uQ)}dxDU?Qp2!Rc&hMGv`)_PI{(Qu
zCdHCIk_=J-H>@S?td(;_+<U7{HLXv4J6&U9jgBL65HAlEi|IHgUh71ikujN(p`4Lv
zDl5~~ntkbYyc*sXSbqo!LpAJyxR%4ojyj~inP9BG_`R64s+G&(Ehv?-Hp^giwaPt)
z8^YG%8PmidSeN}X2`=q~ClUUboM6G>V#2-FiBiSB=Kls*^C?~&RcY9;rra<VXBxmf
z#l<{Tn|kD4FQC{?@XZxtm7!e{rjFwlzdCc<iB35$gEucz{Dbb$qx_SKtlUm|)PO$s
zeFqv3MsVjXKW2d@?(K4&NM#cLc()Yyl)7M5IoV;=W~+2%J+L#5(FH_Y(7>I7&~G?;
zU+eG2Zf!7Z*k9JirIb8>dnJ%Y<dDP`MuVucnQ_3#*Up8`#6f4W`Ht_7qfTne+&bgh
z47sbjTgtjy0J!VWnGUipQ^j5wXKH%iIBC;srBIua`w^LoSkOf*ch01I68)q;a|5EY
z$!?@9_9I(>dHJHgZ0sq@U0V5gT;TvfI2f&I+O?DA3PATZ&P}2!%}CttM?I*6jaMmU
z)B%n;6P**|mn~C`@K)RtR0GAEx){6C>bYzzHUxmUa_YyGXT|i~Hgw&@7Hvmq^>LFx
zdcQUn&5hM5^b|hpDu^#q&1B2mpK-et@9Br&mh1-Eu=Pjp(;+Aw>gk`kg$oxypYbU9
zetogsa8_Z(O04o1|3&&d=j~~7dIrY?BsTeij6wrLM=AK!s1uWvvYd<8Aw|LTz1hqy
zX7&+?eYU^ckoZ~UyMH}JJPA*iK6l#>OM<#r=1xf+mZBY&AI67O_iU+&nu!p@HZ%0Z
z=dVFO&jy;6QaX38WmZ3hjOzb4#F80qlAyh3>l=wrcwkqN;v-Ax(BP1r8g`!jTabhN
z3OY{i?GK+6TaB93*Ac0?ZRN3C3Z45a2!xLh2bZU&?pkvbUf_DyzS8)zzh7-=wAYg@
z&I7LOG-dde|68HFp_Ao(z>X`!(dntya6>uS5qDX%tIm!?ON;E3*3mvxIM|3?Tj~2x
z+2q?D7irEW3yooRg{z;!U`v^IpI&BCR$v7i-jl_}R~gY}{uXKTO6PLJd{1W-C8aKx
zlwTjlY^UAd^B<$$Nvn6~@77%1Ar(ViRdHKHiP{WZPIfA5SdcsrRj(ymw@V)zm%n_W
ztfH%-W*(Z2&mQEqMHL0#!>Lj3Smh~ZcTPPmhZo&W@(V9OVeThS6oZc67>0!!goPTa
z{?iPqN~9QZC*|r&A7cNJ%kTg5c||N1Q#f~m{Y3!WHeB2`r#yDKavdJAA5XQ3m$O((
znKeqeZ4e^uT=B2zf2JCC$~3tsge-5Q8!x5b3v^9GN{9Id9eEDT`fGKQxn9Ns40<%)
z_nrBGW`KT`Hyxie@xr(UJu>wGcp3!s3Irt|#qc|sL7HKxg^%c)WAVoVhHoDitsjji
zuFrVgPI=wx{!uTNPSof%m6_<2YU*_ua8Kk_?Rcn?tsu1>@mp?<yx9?-NH`u%FA9Ak
zRwxAX$b|Ko?@ximi{Oc6FiR<8%Gw(~S7-|Y?yH1PElSa4-cxr&@uRX;D287shW)bk
zGn1Qf<!8+?;{X*iTWDhIVDXXNruYN;ckDD=gFLiN+%0A#k?EHpp;>N>pk7dTSjR`a
z)G)5pFjV(L1ptC-Ip4QTOR1RCXME9Q!iBm7<1zhSXsGLE3DcxQqikLyA=rUH^;_p1
zpBT5^Zx~qG4>xIg*=b@~aNOl13ErS_{qw?N`owBt!w1r&MJJYWS`C<FenbFYZUCQ9
zCA)jpnmuCZawSZ9`4wN8NQwg7`WrW{$%8`*?$bICX6CwF^}Gh`KdLSJ2JKdpUM%(_
zd1h<sgPAND(ZrjyDx)&0wlg2FfHLmaYLT1aKAbZFVmWhl0{Rj<84}+6D{%oQ8p?}3
zg|`LiuY?RkA0OMuCyNTa3W$G6vSuHD2Z@*YRq*>+5_GuY%sV#*Xo}0yEDFbp2ns6^
z*enp0;R|VEcTj7@U=Fdk_SxChs+})^SW2l=EDj9I+f&B#MTM+t=I3&zYVj=%3WsBa
zqOm*XK_aW|Vc+O7zF`xSJpiN2XH&l{?M5?OJ8W(TZBG87G<jjj1Te)02u0ra)|KKf
zImImq#5pQgvoS612>D&NZVtywY(c^uJO2B_Dc=btc(vr3{x%U)1|ZFS(Pc^|z>a|x
z!HQQaFRQ1HD+AVX-RfFxA%vpfKkgFKJt~%3a7(*g5+07bjB0&ze=dUkA4y*x4fXf`
zKZ`LKX2w3*cOqku?2KKJEuw6L7Fh>j>@#B-S`dm#WvhrRmF$_ZSKgwCvNV?L%UELU
zKi|*qoX2_n@w~5d@9W(2dfnGO&--{j9(Wd8;fO8~@h^eh`RiEW2oM_pPL#^|;58=|
z*?4x@I$h#2*IUa5XO`!9`P>ZqL*1j}nw=f4K#}uJTCqp^M|`|1=Ru|;(yBsUJ~6q1
zUP@g=?vapp+Km?9*}CSHg+3ECcjLBSmsc)6e=f-WYkhTMC+yLGauWZxZaYUh4}W!X
z8d(+dd+@VF;B;1r=af4%D~PZEVwu^UtU`@Jsg(k14r0m5=}X0h_0uR%9LL53nel9$
z^5=tBR`4$z4tZ}pTOod<@F5?nl`Es7>_&LDNkSa1(GDY_f(~jNu6HDjdO0xcR6Y8i
z^J&P`UJvL^9t~43OO!N|O91EsJ$OMSXNHW9cB>kFS$UK5nS6zoYzFvA(y>;VP(7!k
z81d7thWAF&TmPh|h0NEmr#4(emT_g~cVrgC-aKf;98r-hO6e!zi+3JKnKfn<6?%w%
z43RnCjepbgz#~yPSa_`F^ykhJ-}zH#l&X)YJS^(zuwt8wUn+`Fz9-is*68*<u$3ME
zxky3tHK7Zx(F%cAOm11(UT|&Gi3f_l=O~VWnD0E{t25Q^*HN@2V49i~B!RBly<_Nm
z6CM(sAz1D~u74!~@)gt7ImHLBVa0WI(B$m95m`xW8whNCUbmNG<m6*wZd-PAiGlT?
zg2h!6ZHGaw@X0a!<P+l4Hj6{sHLgc?Umg@KQkd#++?U&vw!{~076S;x!^{4q9~Rq-
z0TgqXy=Lh<$y)5oK0g?AR<-id;FV<E_T;eQ^zV-h?yWl9o6436G)*=g`RuO{xNv{c
zW(nJ4YSgdjXIWoOXu{lYw_YtyN`gLZqVVv1;$ulRq_sS}AYJ`jl8qzT#NWZVh?Qc@
zbzRqMdcvT6s!hwos5Tu?gopkEFF9m6a>%!711%tWLax;f!**GNl!5Wwtdj7&hRLU;
z@93}59@S2$aes$wzHrmHGGMga9{Lhn`kgmD1=U(X(~6K9e}}+-nwX9_4-qXz`T&0N
z&wRo1^iWLw=n_LJM!F}3@w+V%=B#q?NrRagS2DK!AavB?OQ4{~DD0X!wkuFD-LvX$
z%%L=EEakl}bv<SDXL8oAIy$&MzC|B@N4cN-be(?5*u=B}y)C)wq?T$JhM)M>X~rgZ
z|IEVFO~Xtzt}*2E=vJuFGS}+yZ|-wFF%y&3Z`&7E+w>96Es<$Hs-5~;Nn^J=p@Ko%
zcV-kQF=D2bEuA63w5WK_t8JQnLE8?nE~H>(2w^d9#&Sn*{hZg=b|PJR{9|O&v!Aph
zqqab;=x%Bm_4?g26Tn{7GuVJK{?)ez$+70qaNkC>+eiGLpOeBnbm6KfJ$m^k#yQJx
zStB9_uFT-LYoptlflWW#qAVI$6!WLi2cMiq5N`G3{tStIXU3yliWbu{+k?b=N_x@6
zh&0@i=<RF-IH^^nOyvj%Mdr=XoDqgGkWcHs*;n(#L%ONjt3xw>-XJr~DDB(P)3HQ+
zw4_C}=-|IT`b~>RTguz%xd1FksEk!FCu5I0oLbn-{Tvj;j(Vj`E&TY0o)l4tkFVI!
zBCF4|jqs=o2am#5XKwa`eM|b@&R@hRjgiE_67PxscsP0WU}(Cf2jCVTL?)ImlL6TN
zJ#8={sn`Jt;6$p4hZ{C)y3ka`%*Qhn&n%-C<Mj;8-e@#0^Ei_;xZeL)%z^um>uLwM
zWDT;bfJ^O$Q^T9PGyhf+gefCk@;E<0bRcm4Z}B2!j<g9{{0m-$R9t~^+=T8d>KZ%;
zNZjYPWF6zdSR1^tAXrEhuaf)b#&`fFcXD0=@V8)Ui_mJastXCat9z|73<h*t3<T7%
za9$F{sH~yfLdBi67A+h}TcI!GlVJ4kZb3#E?ZFHNqQ>5SqaEVQsSmz23yQo97W-n+
ziKrr(gm470Vfm2P;ut~nJ{^Vad3CW1s*ZxXm8^Y$K@{>D@ks;V`H)S4#vz+3h~KbT
z{fva2k1I7A=)e8cjfCSVWlkR6^N9la>nsD;a6enxcgg1qFHfI$JGt_e|Ff$QxE|~!
zRN8iS@`Bk*eS(Mmo1c{NPLr~$&b`3>BIHIj&VkX0H)%}{R3N@?2FLx^LcB=QJavz4
z)F5`^HN((DqVSh$$4lo}2OO=;lFQ9S{v+;LDNScGsy@rkd&DBmD-W;di$I?-bgi~w
zmSWsS=gvd=3t|URDco>YQNc&zE~EoNtom*$>4Z{~{Jkm{`5D*uYjs1XjcrDh9@}EX
zO62%5(WXNm_uf))T3Ye(7cuTd>VocZ?2jQ|k@jkHDzmaA^SJ$n+EVNud}+Wysb}fM
z4sSId1;{nIT+WqelWybwvw`jf&ZV*iv^j;cIA4XzucrvdlU1Ptkda_FmoPtY{dKAO
zBYU?I-S%6Fzve9Hhd8QsqE^~eo53B}z5;rAs9N4@o5Wta_?e##bdNq7om^`X;)RG1
z6pRoYAqr`^SI-W5v@-}0&Bw#tz`HfwxE<iLH3lkRyjF-aqqKGP@ZM`12H(9YOr~>&
zsTX-P2C+@x!|m7;$Atl~6Sp;q7nkjcaV)bxl4FjQ*~oiKVjp0F|AxJ!j?eQMv4y>s
zID+ihQv_+kB&Ih%^rBZFC9>!;?c6`2O_`_(IJ#3wIi7Rfk19=yKQxGNf<2@DUTvL8
zzGi5Ci+mA6Vaew`f&l{JEH^A%>Qi&M&6})B)+-9k^_zJofbg%vX?-M7I<NR6tA>Cm
zQJqN8f8Zs7(Q};RPI<q*#CC#IZw`7?MQL#>eDX-HX_4yMjtgSnCy2g^K%C&^a9pVk
zCQzJK08P}oH*K(32`wD^NWbW+7wz(~u8`VPo!W%SfMT=4-`Eu|et(?t^szqAOYz;a
z)VnoY`op6sPO`t->_K&9URG`5H4s<bW)%L`Anw*q;m&S<z8(|l#zcBZkz9tdbu%rT
zg=vxkSnt*8t9NLy$f#S`cdS9OS{kuh+#tZ`gB=tTAeR%#^Yp@TO2%+<_wXn<yZ%8^
zlEUTD2fr;D!)=i<&>v8}Pac3)dqn=M&|Cz|CAP6z{CHcpE6KKbm0dtgN84{Gy3}c@
z&GqYZSDiY#CSy0+y;|n<<$aVc%fIAFoJBW!Yy&^=e=kKXv0FREoPDi^Iovr4|D)=*
zRjX~&$ue+MtIBd<YwfBvqU10k7$3!)Zviv@Y2r><jO;0>#7byNTn7DL^iU9>wmWrg
zian4P?nYS}(M<teO8oiPWT`PZ(7|u6?Fy_r5FmnIQAIQ2Msg4jE+N1CiQv*jPFy7f
z`CrU0mUcOc!z(d6%M~s!z3a{;Qkr!q8~@o?{7m#|-ex5#2}WoUy4>qy%Zc<xe8aGf
z1m{WZjmgr6op(LxSXJa7{#_HkA!al+WX-s>qNV+_*7T!{!pWnaV1Efd_UG%r{h9Ld
zAQ(XASNYeW4n9!L<h962!77@{YP*UDG^*ti%7l*kqtk^27=;2YH|%1@DSl2+sV~Cx
zhDea*6c~cL0TWgr`hTLR8h>7LWO>~eBd8!p%}~Tf59tG@6p2fNl}4G|Y@saIPGhZ0
zTUJ5oGvP1Y6nhY|-@re=LQZ}Ra)R}$xSj(8fu>{wF`w*KQ~0;WR6)JW6@7zLYUYrl
zmav!$ET<Wus^SDFayxy%Mn_p*hCb98CJQFV?xjVl_1|y>#57RvJJp34djR~Gq#Inh
z@G6E=ok<pK^!L9_SLF>#h!ReKwBK_;aHk_w;)`zA!M2y9LC0r+)ElYm<0LoGozG33
zC6s=jX86dU0KyY#NwxstPs*>a@-EM@bw>(b3XLM)!zzjzJ%I!*n6Db+8&%I3_ZKt^
z<$*Ci+#`wwH_*hJ8uN8WP?y{Z66J-L9rpfVPsJ%qb;0@*t3MuB-n}KsjzXQ=aw+#8
zVry7eVSsObCvy}}Zd{?%KP%{JqDBX*{w!yyehizx!eyx<Zds-5f`;%bC#L}Ku3|rx
zg7e~Jq6{Susg|5}9}vPdJ7V&~i4W@G*CP0{(qT%f_ue_7(&A8Q`u{^*0Uz;2rQV}6
zSM|IKiojGc9cq3If7<cnC7mRbmE;rKTV4{*1SeHlNUTBNB1EUlsFrTY4^WKoI&`=p
z?mj?^Y7ss!6wtvxl3HHP4T}|(^G3)`?QysH{NET<y1PqS9ZpsNpnI=Flua2(L}-*v
zbE>bOlaM5nbIB7t$pFed80DTLAH}dMn>^vp9F5bu=7;Zbl=vpe1{~nvX~aw3GWUX5
z;3?1q&LTLHEb)K?-$lT8F%{-l&W`}cRMBIqz{}>w{PcV4^m}E6L5<L0Yp#cFe=Pf)
zlK9(&FOf96HVeOcUf718?rPVUw(CgNeFciN=3hmLn~mtNcM}-hgGTQaMbywDYW!?(
zoV2dRCJ_h@DWd38Yc(U9Ox5~pZvTUyLhh<4$JD7CxA}w(viOGTZ@DoIAoj{bDU<tK
zEO0KOC4Zmo4jV`z_662)zf^M>=&(ZDT__&I^!KClUr_CwPwqQGP_i68{-@oGD1}-D
z!YL(uJV%jG{bnP*kL0yOKd7MYUP<1(gkNLCMKj`l+8vDuy0A6Bn12(UeAhg44Idwk
zkKZdruC(tj0Kc!c9bPd@^Og7mVMYA8DOyr_-suLxP>B%_8bDJcnFjhygG3nNNOl#V
z1x9Ek0_Z4Dzi2Bah{%d2vby5qn*c%tfY2Z}`y}|59r$|zs03Ifh>WB^w``Ge;d@z8
zmx0W9l4A$$FW_kBKT&_6bL!DK{S=bL07-)+<zC45f(>IHeULq*gha7ReUjr7d?8<^
z&NL@&3B2!o%4)(Q;9`<7fhu%@L5M#<Q>=h>6r18$^|GI@5{~84OFIi}DX;cuQ0Q3&
z`SmAWFHZr@Pe_hEex}a-0{_SO+pW(RlYbzJYck%ni;-RQ^X|tviq85D^B8-&qwdS5
zIFWt5&Tiw*ZX@?Nz@=Z!eav`W?sK;<iYDe%$*@{Vk@5CMn#n^1bgmQ|dvOf~bs2Ha
zM;v$Lb2@=`)2;2^l7lh#=uAxjZ%*1aPQ#oK%5Uz&em3R5k!-aA=`^>l1>z9l>H7X6
z%VzZX0@Z*nv4E~{y9znTGcS!ws$VnL4@If_vdgG*(>j*3;Fh)X^&21g;yO;{`u-Do
zw}-`78RIRi8(8w%H7{9IM2q%4wy|(nz{c{-aq4l6lK)bIyOu5#AcC$CZhn-kWaSwE
zh{)!v8|15pvrO&t>;Ts|i`uyrJ(7dFP7wC@a*p*WMjuNU^X1>7DT7RC!CtYW2a9b=
z*ekFT)#AgRaM^d@Q$W7D{(!`*P$jZ5P5%;fK<|A1>4Cuv*=sx?ZmD%$BvYSxbFn~(
zyvIH1Ns2W84vKAaEs@i8^b(J^Gp&@mH<T>+Vb3PC#f#EP+3!n~9yF0q$`2bQZZ_eQ
zB1#6izqjY#8KdZOoG6r?wgjpI<Ly{lqw$G9>8$@wU>{z;mp#*F(w5%fmgc}b*|dre
zQp5)n#rgQ}m6!6nCkqaq^v|kNs?u4+jbElA8o7`O2%!ek)9qZpNmAnVsoX7#SZT8S
z2av5oshrmrjfPhRHRPWLZ_HwN;yG=7`JdY*own*#J17Xx6yl!ZLBlJI+!bT@Q?FD>
z-e>_e1KWDJB|RX&so>vK6KXx8o&>EY!TyJiRB#|27-*-PZHdQ-Q@PxzTp*Wz8A}mg
zFv5Py0B~qPUe^b}k*?|3FqVJLq;m}W>~ZiI6+BjuJ}Dtc+-K!c?PujL;L_{(7n92~
zD!U7?dvthz#-mdTh^K?_^x`uyT&ZA0YT}-MNFm-t0<MS^vCJ_<9*DIa=u5yCB{aSR
zML@kD?kg-QR&<N~4+a(8;egtVmsBwXit1ZX5;q@F>x>x#*t$b)VqlN#obkUgV$SXj
zFt3>1r2HYV<!*x<ReBk)GQ!J%)w&VR5^aH;cje*f;PRRtHy_lfUUu?CbNUt&KkgH6
zMHZwrREsrnd-now2wu~@*ByR)xs`Msgk9n2?M9{JetGF_<Mb*My$!Z7h%O&2UEE|6
zc}CZ|ThueF_cJSyV<PciJ;zdrt)p?85i$D}NS+JCBNG5b3n9=?u5v}VGkx`#zDP2W
zz{2i|vK(OdO%}Ce7`UAk1M!SiIudYjDH04nK)??$_o+X2Wd5l20rJnLT4dHk>V5U<
zeHT-=81&+@;^{}ec8mc>dhr7)uc;}4F+gy3$fCrUJEuyNQOzzT-|e!<sipMr+7_9A
ztU2wO8lQ?hFT+XB?lMe#>^gQ<qyE-n!4s8Jvn*Yl_aQ+-h)FrIgOjN7AzJf+9j@Nk
zz1~;}pB(-FK{Ou*4o;A>`}9*TgH1K)Lk0!EHMC6hwM-6)a|qwF`0r@9LQo|uXdK-5
zJ5gm2Y!iLvjii=b>`73JxVI)N+9vi<vAK|+VB$_Nfq)P<OQAP?Mcdb9`-SM+9Akyl
zk6@4rfxt9gLZ$z&QK5Qy$l1GulmquHg?jpmCT#<5?$Ej3QiZR!7*o%tbH)~m#TM2M
zH}mn306ipVkI`GX^@w^PNxKvfR!yl8b;7~jaB#g238pA2oTS4b>d^a>d8SbGsYp+&
z8mSS1!W+9pkwN6*Bq+@8M5uxteH6&v$U0T9Drt6|=#l}?{L4>-yAk1v08xol8LXu#
zR{<DNkf>um$TQAf$Af{Mj1Ze-N=TJj2k4agn5Ld%r#W(;bGTpfg>S}+2-hRR4+3Xe
zqa~k6W{pVpH$q$fGohzKM~t9*9(E4`v<^muD_8@%okr5*I)420ph4Fp8MW!es~s(k
z81W{IxHHaR+smMm7Q5W?knPIE&+6nxlb)7pF)NG`C|TbnL!UineA+#^)Om-kPf2jr
z$MpRk8{f9U=Y`IaOhK4e6?(ZlRqGMM$0cKFemEiVK4LQjGCTbyFQYJ#8of-5UJjJL
zWgdvQX#&di!dA8s&)9cYi^o)p4|`Z02*3endiY&3l>&^=ouQ&r#P)bM=zp>2lObR=
z^273~j+V5Za9iW<kow8e2Y@i<Ej{L~*wULo<Kd?M^KJw`q*gj$Gw}R9h~Y)9Hw77a
z2SR!pu8hIk513UTi~BH(i_qU!#=*nn*IkLPyH+kpVr3NSA9h^J^L9d;eqLiU+cN(E
z4PrC<nq2;B&%sZHEGyo||A(|8AQ2(TeT0tH7`055y#k`YSvOAmL2mWq%+Lx>4!qX=
zhU#>QRNiHQiy!B|dpcdiQ8S6zH1($JBz)2n92A59NnqUnS!gGDZ%E&KN{?V(&bY^#
zTK={r%XAlY{jNnC<|l_+G1{$|zup|o@-t$)+TcX673iJPUBDh&%+EBJ6%eSjN6@Op
z^orw&wPgRnWd9GKVFhomID)x8!8}gE@uY>HU|#p&^4n+$9X_=ks`}M#qF;=bI8Qp~
zA79(sx()m_t)|jBJy%V+hGqOvp9VN$i+O6@a-VXvjr*U!l3ePAm>A$_E_PZ^H~y3u
zHkcUp0Ul~KsD)<}!?VRhV|i7VpLaZO-|MD`8cmO8$-oqneg`v@qj>`15@eVJ$oQMA
zuLy<(fl1OKZ^p6A4FgO^Kpubxb3E#B6d8&lXUJSJz_E$p*w8q(p*o(2Y$C?|S}d*U
zhj;1|5SB@M{y?dXX{?kZ(KNF<A*m(?D@DLc4XPHM5Xd`qfT?ysB&~|(9Sz^@*_W6+
zq*9DBKzxOvGFQZnLT0))h-M6;S!v>LOKv*oF7c$It+Nem*9gx}Mr4~gZ)<EkX~-Jp
zlmn42w&vs%B6on}+km=C>NWdLAaBXpWr*1KCquvsJEWToVjU~B@y>@E<eZd-0x%ls
zW;y=`TS2OuV8ydsP6@0K?A4oa34H)I2G5*qv9+^u-i|>SE7j{vvIIdzNNRga45jh?
zWVD~X$=6?>^kaZs&~Wk515C%6tLI?d1b-HCoIDI>lLZG71-=BMJfUTzyMF{E*vUML
z)mNyN^gUvrW2Rw$a#`U|nxyfyL`rp%&OHGPkA!I<DBJ9xMVTInTLgCz`N+;<85+QX
zKEqml#?kBE`U#AyqYxqN8a3U-Y3en4+ebSyR->w9CGd&gjnsL)q=)sG6~{~?yCU0;
z8ze^dRZ&gedjc9s=c(_0K+fS|<}g8X*qU)@$JDIF0YyGUwnvIh7m=z|qtGKUzXsy^
zbpPT>5VImt!IBg1C9;8xpIS*%7fB%?<`+0NZZ~3*U_C<HVF-mKoipp702Y83l~g`Y
zvsX4Qy^zpDhs86KdKU}*K>A$uw`<uix?z7}Uc_Lp3<IUsSuk8%w;?vHBQ(f0uB9lh
zD4iw1s~AAT@B~9q^!$a8+a$ebcme_26~meRdQ{LKfMjnB^-6<c#NY_=C>?$3j6QDc
z5UqHThL@;>F}2?G{8#|zt^(!PfKwjOPWoGX2JNzv<sf^0EWpKV<zcl`KgSIQ!28O@
zA{pd=c9avP<WRw`O%9nBMV_fW4H+SmoFs~GN@GdKbq-H*dD}9Va6JN%NI^kti%ubr
z?UM@@@0@J1BN1(n<wMxn9OfmCq>0N*>^hm+&yuoIPl<W)Xo$*@P<#mBY5tMP7$mt4
zM~U>J?4V^5wNcPB>l(PIk^k(;-@v9>^*l*g%%)HlBY`vvQg(4Pe2g{Kk#v`4V(f-^
zAgjSd>97GpCTFpFcRJp;wJ){sg`p;XwxNw310XiDidj$3W0mxpCu&PRu=f9=WdAa8
z3xIgs5Ulh{^G&`xY+~uZVoFYwab%mgsMSA-dX##ZNzhOF@N?2&hqSUIgBIwczbVl)
zL8%>V907KK<ScztmHn7lPGs})9YgU-Lj7O;B*~Z;GL@&ihlOvLqNwNaNBlCH*?HFp
z-~6-2dQF(2q90PgfA}K}+}54u$Bz6@PoxfEnePy#h9b;L8BLQjF`_m%I?|gMYnSQX
zm2I8N(&yTAiO4@?cXzp}&&crHo}`bnHn&25n7mDVPeR>BOitHIp80?jC2m(y6FrRN
zjKsyZqMh^_kTH`+f|N>msz0HBQeb-$yMrW)N#wW4O)lelFxn@|G=#hsm_1L(LQ%Pm
zMULsbnx$+iFd!}A)Mt>NYOjoe$h=r6Ab>`Ke`_w`AX>C0S{~|@uC&LkN<y)a)iABu
z^6I5}#`BoU!Me6+K){M*Pc4YW=^sbs2gQwuMu0(-%1aLJZEcLBSdm*DX=9Bxfu5`e
z7=$Bl3fE_CbJAY1Nmb^jX5<_x)2gZZQK>0!pRrwxZQz+)2HYsS)BCLT^TSkGtX_aS
zIh8we862!^rw)7$EWB(sVUs}o$C~uT1RJ`-RmI=<dlj6%3Myu8z6xk2I9ng3O2Ub<
zRT5#Zm3q_x9Wte-nAJiIFAWy%efNCclGWQl{V<Y!IY?p_EHOKNCmDo!qu8t&&-DaV
z^hH1E#W1M^G{Igt?@G0IdLUi*lUAEv8fx42tu88^sM`QAbOIpDC9Enb*w8h*g6veo
zDz3s7&`L*Cs1;Tj*fs+eo0Y5>GdYM7UEd>zgEr0^9|Mav&{WTXw+N&YmxLl<@D0By
z%4)`tcvH;y*k6?oUGn*@<i$!@(pAW<P}wc<5%slaIrU_(V@t9kO$6v*as)^_fMR=1
z=384~wLhSyz1f_go*X517Q$GDteh}lQAq9CF2;2bxDfGRv4ZS)vzn*A`V;|RH(WSz
z5+@M7oN;v{Dd6*f!Kvv_kEZGwr%i-60qqm!5)u68P8r#?U+Z6oz(9FUf}sHX$S7Oq
zs*&;-`B#x*W{`~Trp&J^P@yZLCT%D;mo!C;EA{tuyPtjHP#gGFQ#yAbEnu=OK(aq_
zMrYG2yA1et6{xmmBAV#b^YGeDG^ZZFjBa_m+z(R998k@3GisRp$<;gCsK<CEZ;nlu
z1S>a!q`*dm^lVpU6fD`Ul(vTgbxEV-GZ|WxMXNF+5>R59=Fee}c#BmXxR%JVtm-tw
zxAl#lVBVidNlnH|F=-Y!wNi<49RC%Fe^cH7%`HNyn#6M(v<dgNkvR)tl|s~<K0>!~
z;A$B%vn)SFU83KtnLTW)Mn0XAK09jRZG<qANB8Ou)zv4;YMGr;OSM_wF%r+awphi|
z4hBP4artU4*YsxiE1pSx8MLsI#SZc3{Z)#rt~ByZRvtIm?)#1X9%E^G4mZR<^4E(`
zkfCvJVIsr9mtBVPmF90bBvqgU1n_KW1T2Wrhr<aXe(sFHPq-hG{xR&tx6~>x>nh3Q
z*T*PhWdE920b{C#s8UQ8dG0jB*z(HV0Tk>I<Ex5q5>$vuRn#*GXez=b@?!6X7<Db4
z=yz$PhoKF?AdV@Bj6^828On$W{K5i#;I@8^`WLuEfp#=QnX!<|QK$}m)L(xdgGtHW
z!ie72M%HuQmK3h$JJt>HqV-o%Cu^4WV5b6tqdnb&)anI0VimuTOPPltyx>RY3jDLq
z<U-$Z5!?~cZh?Z7BLKTr!7&7zw@YlKWujH(7}p4FFW3q~cdI|gq&k*S<ub4j6+{0v
z_D?lOI$%&;LgMG5)@-PGnb!5ZO!P-Ybtm`rDU*eb2a3Zc6?g7BHaL}hfjs;uYb<Op
zS9|H&MI&EJ=$<F!C<TowXK6Z;i{$%wh&oG1jLXQpLP##}A;{4x8QamR5pS)QmC4ui
zO?w;hFz3t-YqI;~>ObVlRdM6ibyt9k)Z7(__BS_X+T`TJerK)kOR0+6vcUr0H<TD9
z&Xeb>sMDN+EgAEpLPf#)9U8-`63mTY+0W4Y4Yb~t#*E%3vTC`7e+!<$Azdml_ZU{E
z=e8v#m7|}e6ywTs&^appA$;<@1yN0J%iv&sLOw2{hV8^>>r?FKs1(#rqgMXk_^I&}
z?3Uu#e+GOSh>!(Q-w={%y>x8>?B?3JtQ$15<tVKY$<V2&RK=?HT=-5<t=wg6b``P$
zi*vMdK_8pa&I4EEsypTkbD*63%m5t0Pg*b%7l59J5ogFl%FF~+z<D|17};R!13+Q2
zvLI>lp~Y1IVWUnqSzrT7ASH#-DoJDHQR@A66O~_Jy7>-wljjco@Sp52q3<B7tf!eD
zP0<0?IAu|F;i1wQR!2p|dKDW15?>ZAae=Qi1M`axGBN8Yr!bra^Im$0)~xf$!^SQ_
zFL)8Fp8&WuH454lEvFYi?J}fySc9mZsRhH7So-Jd3jYFVI3fZ(a-MvH1TPl{pPQ7l
zX-Iz#JZsV$3PHVDOrE#HzcjYkM7~;<ym1Qqp5r^A5m4HIEgvElp5#ZikgjgoBi=?&
zL?zeGLjbDOA-xXG7`BK?$;J^xwPVlB0!Si-d81$`mfEgosw-XHeCPJbYb@r~@i->c
zvI=&GLnesk`$75fdt%WB(rs1p`<RJk^h#a^Sn9hw?uDXd-V&(OakSIOw95@)v=A=Q
zL5z4K;S&S_)F`UW?)BvVb-%F6oAh$u@(HY-*LZLsdxjOO187Y|BbQds+W;j7-&j6|
zousId4=MK=#InFlp5^rX1~kSmrbqVl0sw&A%tRExi=w2{B2rK+NhpS2797CDAa((<
zG6Nf=lV(T26_z(_85<tcmygnhkBxcaq#VB;vRf=@oar6SoL$5%OXuD3q&0M8FNBKo
zJEpxAYwx&BBJJ`$qVOs-yeQZ%)+%4xuw-qnTPryK!X%R&@9Q^Otv6U$W2F<!9I`vw
zxtSL=asHK4{-akVDM<z&AkF-TOJKqc-v441zPs9$BqTj1^n&w35xJ?Ee{_JFOk!lq
z1I~9CcQ<L=4r;@e%}Q1Ay@zD@53$u)+wULS{RT;$)2iDWl2v9sG0>!OIPR$*>6dt$
z+XqPDtcZTP<Y9ap)7{$7Ig7ke@@F$eXD*^CQ#-w+m&N=T{wOtlM*Oex7W*d&mlqQk
z%Ak4b2_S+0j@hQE1}f{S%PCb+@xdWNv(@L)nfRYoA@EtP8r~6ikM*AoW-IM51FpE{
zWg)*_wurlzM#9kb<+)h{{2m`J1&vUfDsk0u_X~$=*bz~7gw}nY*Bg*a1<)H49bO|T
z?CYHI`Bskqh_#xaz-a3ZLCp7qdzrPoH9UtY;87pAz<Ce1igsK2P*q6uel<G0CcbKY
z#P(n$S*E$`dCM&KL6YiafTwQf)%$dnxX$;?9{1ZM8x%%+6`LNWRSL@7VtMt!);c{>
zf&z<)PRh^p-GN_zuP^csXeoZ4NBC$*_r?wJ>fVbVHobm~waNW^;xZ?_ykfP=awDC$
zf(mV3zAtl*^6$_>%c@&%^>k#&=e0%<yZz6JO<YA_&jQ$ACq?a)+Aa8`5tuZl)Zdu=
zJ~Z|H29I-}PwEYdb%&k9k}<HAm9p0X-PAvOnt*g0gZPN_+E#b9f^(NF9Rlzq;DOoP
zSg4@!7w+X-kt5HYdT+fDWTMWs4);&s-V<Pt)LFhpu@BvVZ_m=6;=8P3zPdL<63PLO
z=%7ao)@qhNU@AbrHOG3I{!(FQqWf#*OFQW5Gaa@#wyr~z=DJn<=xNOWVu+`t<58`M
zjLQp^$A}{~f)R^C^FBzElA-)7=ZTZnM-AWG`k(Bi=&<d-fGL~3`wN7BV%S||z-^Xd
zhEfHxwGtNdMdRDDe8(GS07;7<L-lW7mJf;|Da}fsTd~d5p=bf(^6#Kg-vM%W*?wA&
zBze+5{80@|=rW3<w11+sM1XYSjccV*$?gCR)-eWr;(eIq1=0+WrS+6guy^7h;q;Rc
z32{cHCQ*D_W(S(|TAFh)%d;zK5AgIdugR0Cqb5>9ZNyz4-K3z%o(}fiv*gNE{@FiS
z7o_@6RZTuI==uzQeCK4om4bFq`xEV-f~m9``77A!!xM9WHPG^p$dMFLLeLXyx-H|>
zq~(kDW3tXy(%=;XVt)(lEB0AkU(D*1vLl6qFr-QtQsOKpYsZAjuJ<*VIev3PWAm3K
zs}l{qJe~g@wZBY&=?(agsO_B)%zdLeMGC{%GsW&m?Ni1!go2*t&X>@tmfCx`8K)OT
z0J00u+5*F9ucu_k&WUP4+&$U_Gu`96KI@ZY>=KugvU(o!5(48{zQ)jG)@XNrc1Zs2
z@)%7liTGS`ZHX-w(`KnSe6V0ks08VDpGF$b>5=x7FdSpg1Tpo^B<&T|jbB@m<>3w4
zdp`BRZ<sHr;)*XJQ|N>gn|Bb(YlO)wO~6GdnLl2Q1_rFJnWvO6T^#xCAY`ftN7sIu
zGhOsD^>52)M|1+VNz-LbEXkd-@LbBIz=jQ1*D7L+v3~mF24B+>D|yp^_$;oUk@cr*
z4fJ44Dd1Ypsj9>qwXOj(-93ly*Ef>J1_Zu5O7wmXHL8?+Ju8IC^dU|v^#;O8%vj3O
zN9oQaW@@~*-*Xf823mvxIVl=y_Yb(*;Ew6A?S)T-3A&EV&*7jxWqZUPk1DBL-kCgS
zz1OZ23c<8k#gS*-ID;y@q;p8%^0Zhh<oUeDH#}NX5;cyzw<@oo8@@bb5=7v7wa0VR
zd+Ej-F3gY;*2U9m7J*^FZqQYL==q-0Gr9lPPy8&Rq%Dye^H%zwl%>W549Qyhax@ql
z#?T~MpWCwSRLN7TSqDRqE7D8W0{|s9m9dB4lGqUH^)lSBkCOk*GgI(la$hX*9=f7O
z1Et7{k!*&>B<n9fBT!ax4m#w|w_ulN)Ghg{LOOy9GuQ5_v7K6zPYud=X~41!bMN?U
z;tKP_vr)xjftMb9^I@`|Z0ln$_`iPr&e<zKE9KPtHWsa<FG<%4kfqm9bu~w|V_8mt
z4Alw~vCtls(P%D#1jwen)gs2bgF7ol+~{oMH4a)D6Bx6l?@OOfkE3lhG$!tF{(cfe
z{Th;XS5WUQY~`5iUe6rc-oyNpq+<%B+0AIB%KO5;R!E)tGJak)xaPiM9$nQ<Ww=_+
zjegd6^lkH$_IRkgYxQxyRT)&PI6lSfcFJar5<fV~uyw8_E?qhToV$FE{A7*DtaK;W
z-p0>NY)<a7y#A(JlEN~=fHwsJAhVoP9WVp5VVgT|;a#!T6^Mw6cnO-V>vFrf9`2pR
z7$jqs#ACmZVQ_%1!nb7L^7SD0#*SM=ryZg1=U=3aP~SD5$Q8wKb*iUmEK9$z?jMRv
zOJ+WP(b#?o9pFWpd7wx0G2HN3W8{5}*-mOYJ|#UyRt`YKabntb^x96DGvU$)><_w3
z&J4JoKGEce;fh*&R2Bkk_2u_{_(g-qguKO-dBj&DPE+3#4%n-{>WNvXs_v_zqV!a)
zO$wX4E{1WY@Pvv}hPBR*s5+yZU{Bv5T;Ck?DD9vu7BVR!8>0p|sHPFv)6e!ZFh@c(
zf7FU)k8vI(d_bJuVD0`Z(*4(hU}ogILtG%7HhSu`Jg&pSa3$D^wd3K!`h)JlsqIma
zANwal1eC)Aj)+a}Ejddw{@yhdJg$^z@IfJ1@XRdl`)50ruWKOoyCMNMIX`YnUrV-P
z%M-<$%&)$v&j@4GEBE4s3*RWGa`YE1&ZG1jxCvtdn#-iZ39r{dUthX{Um^-#r%Ot<
zZI4dZwE$Qq!DlAqac5uWN!%{Yt^UtLJp+8JT<qLmB?+WCJv&@M(CL+??}wJV4@36p
zrSA2E+xYWX_AS<t?X?<}^^cLUtTxO*!}j*~kj-_mM^h{+`wu*~;a}#gSB(t#BYib_
ziExKXf^;6qQ}t9i2CRu={WKf6&AWXK95BVF%g`t#-1W0y^LXq1E5TT5L=wK^ipprp
zob~ih)HDBTGD2Fii%<paaO~GW_Cv&5+}e?`oaTHR`|#aNH>1bVkW~%Ru2z!XHt<o2
zDsu_=V=n9SNYd6mFn^LuZ&5$5^nh(_I#u&ncy*e%zyuaW@ZR1E8Tv#|{-cvz;7nu5
zn7kbYz6@F^XI=5{d3q?Yqiyrgb!<H&BzYhCrMXUvf4}<PPh{76UgToKd=k#Z0>9GS
zZ4=GeU6S!I;akx+`3VJ0w%nv%y_EK)o7(lEP_k=WTa+P5YI-}9ZGr1aJn<WZ<B@aw
z$D1qVd^DwQ;r=*U@DdF%+<E$U7x9}+IGbmw;l@`nlZCgAk6F3SCa~MjYfw!*L{AR>
z0ma?krKY{G;64KpbQQ7!bRA7Bnxi29OP8#2-yF56KYp=3D3Jd&W~|`j{li1C1B*&I
z6y>99bJQxvT+rYlz(&0^3OJ~zNmTj#@J9#qNIrFvzsI`&Z8Nu9QB~eGr+QN*+%H2C
z(*${}-2BvCL2bgn2U2H!2rFSL-}q?eyvonCgWcu&`zBqIkP#9m>Rq#>SEf|2xr1kw
zA90a9_Y?iD3;SP~N&Ki}<+xl@1ESy>*U?40|Mme@^Qc}?zfRfStE1khAhL1wnx5EC
zDMik@Q?;?}aoDIv>cSSG9KL&d!q`0S?zDF9Q}&TW|C3cm^6kpB;~41j4$8och?pP?
za?)V&WVJ1LY&S)JMSt^|t=?i7<C${m8w<Mb8bo`>+q^07k9>6l@AE%gYBs4}eAcTs
zRp-5Cp<`%}?IE}OR{bO_?|}h5>4jylP=JO?-n=2m1Wzdq-hs4MKw0A{&l>M@4;N}U
zJ!Tp9e!~*JXH919Ve+UA`scfquEzI_9?0gr@}DhLty`M*j)vU7#kY>}TMJ3gKn8P6
zvt+QdvIx$ye4BgB@@^=h;}G^WDTWH=zClt($+_k6Hfu__BFKCd=vtqV058tc=WS-J
z!sPu67ff(yu9D9SSPW^rGg+hH-8bE1e)K9p^9n2}2KKerKlP$YgQT@qCF(YAw+tSV
zipwt@3cgSuF4<h*pNCiE8nN(tR@$aB*{)-++v$`5YGA)zK4sciJztM$rov}l_&`~4
z$)naAfSV$6B0Hk>iyynI5=Be5L6Lo8%evKUTVCeGsG@VA={<=rkYG}7mKdKo#DxVX
z%Bb@2-p3NFd~7KFByp?j9KU1_{PLg&a;W}uBh#m}+GT@-YNS)0fd8YSBapn^BlE3B
zme1GidDTz&jn$L&)$;@&Hzjf6@Ot0+7P=QveMp6~NT<WH(<50p#wOWX+gAoAQ&50j
zEM~Gk_~lt><<}P-=J)T{BRo&kY=?&JByjB^UIXjtg-y+*Uost!^Cbqi_}9cnNVus8
zFUEH4*!z=Js=51;1;OvGCVEXPuYMfiAjNL743wEZW;46ZnL7&1;JzH1SMQE$Zei~k
z0BF-Ml!|VueasWVWVM18yw<j_N*uZ}IV-Wd-FOleBi43zu}#T7nKoYT{WN0WtN)oT
zE01~DX9u_k_^z%VUp&P5%jrjcEI)v(GL@Vm0o2n#XmSGF09C-uj|6F~@qT2WE0!4n
z^?0iT&e<K1W}jF<<S0hvQ*OnjgJ8lr9dW!;`z%@@Xr!qQ7fN|JM(J!h2U6=S2iLJa
zjp28A0ZXid{m|;2Ims_S84i6UQR}f$MoDf8g$5!rq2jzrDzwoq+FMEK)qB6(Sjzi8
zo#8q&U7h9G0*ztw(n;xTNq_FHCHDr?(EehbsUhIQ`DzdN?zb)jFFpr)p0-G|;7mw?
zt))QkHYLcP;wT@vvo8VKm%E^E*-}smJ5JH;c({HE+RZ+kO~HLue{OidcXE=jW8Q5h
zVE7<0p+i}(>yb9r-C#Zs|F02$5FIRWVVfS7fY4ZETZVYJ#tVwHJlq-iacOKZH&hLO
zn}Vxe{-8`F!ECEwtyRNh4yHi0m-q=aPxVJlXB;&FW>IzW0YJQsx$1W;GN1OVx-Fwc
zR`I><R%_1HH*IKVJxu%>|AO%(|5<51Yr*Hc%37H%8CnAFoCM-#Z1?`y!?7jg^5oOw
zQ}Juc%ZKVnXl2MTueiI`ubqCd+le7m*I}5YB@k(Xj{WGAhghu31Gx2gh&CN%o(I}i
zDaCtg1@2p-P*^qtWI14Un^hd96<w#>yQ#>y-=45^$aad!@(NkSngUrP$n3U8r7%X?
z;+8ZevjTjaUl@IAm{D$k{Hcf41@r#|3wrF(?KmIy>@wl5pW2nXn}-Z(ADd-|CB8#E
zuyC?yyDlZV?(Rs1PBv#{bp5aKJ8stfZrGY~gJ#HcH|yr90`;+FbpGlDGWx5n9p+GR
zd(vQ@YbTa}B7~aZMtsn$NvMR1ZA+gWxHHniKrJs3#q|v!3$ZA7l?M$VxtIiD>$DIn
z*;ENvYE%P2dN<tTMKr&*cqR5hH=Remxf|&98`S$1BJ_E4Mvi3{xb+4&KQv`P#DQ>}
z^Qx^N?n6EWwqTY`T5vz~ZxESsd=c@QJ#kM#Q1THTwk~+nIt^Cl0x<{ojC^zWeP{S}
z*xieIRJl(l)*;3{0taJg2_Gi{|01-W7xchPvNvuj9Mm6x_?WEoD!wPFKIMu<za>%G
z$yKYsITq_rG>LkRW95=-0%TUw?A-ymdvsQ!$&fjnRU?&-UX^2r(WHU(EXeE~X&DA@
zz?ga}F4tNOC;?3060QTMd=74_Z{q6CJcch<wsUp&+MlrMdwa*TjPKhiuTt&5dErMp
z^8ly7u>r6NMPgsGYW)s0)n5|LfgtxPd91l&F~GB7K;6xBFDm%iq2jqogPu4g2r5c;
zHWWH_RcPw!9{b2^XFNr`9m~1Iat4f%tj8!2#B2x<1;t}oiPQ|*Sppry89+Nb*;YWW
z#r>NHw;+M8p-H3sU4TbxI4u6DgAizyD#(Z!2X=zO|I;U$AF*N-U63D}sEN&_opk_o
zn}uHdVz;E3_da`((iy|ZgOBA_n7=~jCIP5>JGhGGfsQBOCR_d#_5_$gkN$c0T_L)3
ze?_Cpp2Ve_ET&)V6r-tWqkn(hE_e&kz=h&+N!m9@=eVgHGwxKcSVbz!Cj~DdhE#z%
zEB58jZHWz!jq}{nAZw1BW5`E9aX&Y%SL{_O+M<~8I$S>9%K`5NC*Gna$eM{)x7tp+
zBX&zuxh93K-h(A#!ITvabN)Q{W>nLsZ{1wxEP`?n7rfg@ShFOjdR-<7PU8FB9o5u1
zien{1Zi>HNLG`!#(_bIL=qd%vmvJwM{A>auJ8phqRGUL}z6*lFA-U)A9q&*9*f}i^
z%q+ozXrNKpI)=TmB+*y#8Me-jQ5^Z`?$W4_sJ_Rsy`aQw%ZT#7tk~@DB|!-sZOPI(
zkMa_ij!k<Q(`#|7&7G<P|M3xKQl|+SS%BoA3_%*{1<GwQee&Y30tHio*0>ZB0ACV7
zo<h@d6te@KDft8LNSD81V;_NgS~SJuUZpLYL0OrN+mo5Zu(m&-oLdO67|yn3P9LIT
zPIbRWR5<0m7wo0IL_TXLci<``G%9!ziRL08=}#GGyo*hU%YhFz*y!fEH}&=8zU3Oo
zYCi*$ard$C7v+1?9!c5S#7tL{4;$JJf7%9D+xp|WxV%Jm3ipO=&PK3XL%;BHj*f~3
z+;-_Gf9^(PJiSkZR!oa6t0$1J$HWN2z;_AYDVEG@25xKyXI7r+(hP|&;56IG&eFE;
zt6VhO;0N-npx)8MMv!X^|HlZX>UPZwuUl0<dIq=UgL7};J2(NA>~=qsE!u^rpEFMl
zzpYDdp8(Pd>)W+~-y46w1k#-G*HqRkyGQH}(9FO|diY72{VMj<wxnot+o}O;!(^F$
z&fqU%%QERV?-(&mn@_9O$L%e&nFl}G*1FU-y3|4%T?U+nN&{TdsaJnFyORG1z&+|t
zKLn{33fkeCf#(im@Z1%7%-@p_DU^vnAhbW?Sw3Bn+0o=Wwloz$aXx}SxrI2l004{8
zf<m~80q2fR{O0(X9g{^nN_OM6A!C!gJHflx+M8DIREgT`E+Xakm6tc%^Wc+j-hMK=
zV5F7qFHirZu^d(EhG#S`ugZco-`g<*6VXWz0`bG@)UOlkWlZiKb>BvQtxjR=<WW-g
zzR<=+(TbGGo|pcrcE$>1Tah4FarF9cwnxx4zPjiWF5K&S7-dbs?Sv-3^6XSW!u)T_
zcc;YfPNYqj{H;)^aeZ8`G@J;oG@@;8H%vy{Py0Da_S|)IG-`N^?>rkKGbvED>k=E$
zn~U|=8gZ{5)z|7geDQbQTX@CzYNF>SjykPs3v{NX2Q1?s#N?3YD-@FheJx79MAZL1
z(XPFPk1@UvL#}=&-I)WuXE|`V&dCL_D}nQs>tuS=+Gcu^wtj=YFY%mKdo$|I*SXF3
ztC*z7=LIBgg_5q4!`NIDBzj_fFHeXyqHybg6rR#k#G9ka&m|Z>wPJ&XfXCxHb{im;
z=H~VZ5TgQ=BS`l#z<Pvd_6mE6drD(6zqR?y3!;%eLy|UJr8D6*C}PxZ|2k1UtQ<63
z>9q>AW;YUN7ho@VxhO319YJg`{`Ieq$}^#A#pHHSq*|iwtn^hyK`iyk@*F~|l2z~M
z86Hww1CXFH;L#>8`tR^agWdRH<}EpZ3`rVzQdN|V$Z-y2$?k`s$|+o6JwApH;K_=K
zsV*z)(bbJIQS$eFEkW!(ClUqJ*9%$f6(-;PQ<SSL(hj!-^q}ZI)W;3jXHgdQs!udT
z<d+NGg9sfbsX4}wa05rknXdZh@kcc?2Q`~?T4HNbvBzKngPw3WH>aNP%1h;r=Jb{R
zQ%M<9w{`{?(L(Sx33yfX56b$`Fo9AYzxYq+u+E{XVLM^r^}AZ9V^97nhkyRH(cxeB
zJ%c)ToWi;fg;ZMCZdT43gy$b?to2&F-_45Hi9I&lnp63sw`f{yu|AY2_}^y4(%+!J
zzY^ZMo2$!z68aNh)BfpwLli%&{+=z;Q-3t#&9`S3EsW{nfmjSa{&<|d$=S!^(RcUA
z_{jcP$6b}xje@9%qoZF5_PL9x4w1#{Hwe0;Gp*mBX=}RQ3}bjAw$V>4pewVq_s35%
z$X=y7`&Hj>EVM?`&fJb?o;#|7+W*-#i(AY&vR#^)3TPcL7|{>@ApBZ>U&X4gO1E!W
zQA8gv^5fg_mFb(BbA30yoj!a!e|o4&=%U|^*~hom?>^Ei`gAp+KSQjyjW8RqEvkJ9
zQB^t+ptt5BE3WUd#H!wu9Hz}B4}Y6{ba*`9c_s4Ge&6msSw3&D%!0`qFW2k@qw6Gu
zL_jaq8btQRzS9;C{!S2Qa6CHt4%;74xZNiN{qM4CYyWP{=jMa8msy)*LOVrs7<g3X
zF<pKw#<5C3zbxUKe%>p0=Zo`ry_J;3>{WtR8f&4tP3idIw`BYu+w|i|=pE^l9~95z
z&1niMaV-YMJidG}?&;)l?bX^n@uTA^=C0MCc-f`-52O1Qf^RpwuI&E>$DLXECZ_j$
z<lu=RBA@F-W$d}MaJtJ)ddK^PX5FW@?e)tzzQtTdgxd4Iw&(9-e#e%I9Xy#HA#725
zoxgnyza2Ues(AGCWA6Uy%)_ao*|~v~A54_Z+70J{`R}Lhbr095e~NH?{c8>$`P9Ou
zGkWzv@$98F*5b9Beg6@zGUwM<m%8kyN7mh<&VJ%hTzu3L&N?|C8sW6nyYTr}R8v%Q
z!mQ)`y@5;n8)`)_H+vTpSU<NO(Pi$Z38{TNB4AK|`afI~&BqDp(C`)M!1a+UXF0#x
z=!vClxmw>XxvYG-oUh|Uefus>;3DgT#<H#-c`xi*(z{wR#YMl}?CZv15YK9b!>{Pd
zP|G97P5lh2RMPu~#nDCH`xP{Bd{fMzp6~P4;7ehzFI>{&EFyUy=_wCI4c@&Gd3V1-
z%RuYa3r$bW3Nf^KOU;khK{=_aoOw9Ej0p1TKSj|MF%bpwB@1OUl>B@dx9PM!hOVu$
zJUR1r?{7iKhy97N_4Y+I;eRJ{R)yHTC@(l?b5USB{4C0}Mo&#x*N>GXwC`K#VRh+L
zx#(4<-_Y>Fs@d1)$Ntt)JiXJHQK-r-FN?Ru<8^OxXYalr-<<ti^Zd@eH3<=xNI%1i
z&j`p^$8q!AAH<#wyERR3mPOF(Z~1tgmxpRx{DP>m@xg{Lbo;NG-<mOz!Ly4MZ~23{
zvLpwuXln;ugDdD?knc@vFN@Y)X}iT7bz{F_wfD<V_f~BlH@*K&{JCBAqxqvbm2}s+
zrWgw@GbjD@|2E(6G^s>9?d}_Vf)0OqG_SnsSNHGBuTY0eze~Q|iN2y%H0+lxs^#%U
zIClH7sAzt(ZczEJXPSdIhDwZJdvBKA;9a7%frBkNN)sEG4F$Vn<QJJ*@kWN5_7<v7
zpa0gFzFsmL-)D2p@?WeWP*sgmGJ(>C=iZzB^uaKKAp8YtF))91y*LPyHV4*#c8>Ch
z8FI8gzp5PGdxJ(7I#9HGhUiwuYsPmj2l0G=`y`$>@*o3h`oYVZv+(VwqT^L9n`lzQ
zb!V=}g2_+ps<vM0{FS~^&b1dOe@Ktts1+*GICB_VK`_-@44*yRviiGwsdL`=<-zHQ
z<<fI;;fw$7R^{Y<P+f^XLpU2{w^EF6tFko|wRqwCk<k2h_3g94AA+}o?SvmqG}y0a
ze|R)5y7bw7Pa;n_Ua#(FAM1cmw>SKPJ6+7zzKX9-9Qlv`7-1fH-J<60^xb0V#Wh5X
zWX<)hmtSO75oD|Ii;Ca55?61F2nPM0&IWfXMlM7?fX=l2MGuaG<JQhZ=QX_Tboq`*
z>_$g#=ln%})3efimG$vxQG{|kEV9aC`l-=KliL_LvU-K@QwuL#D*SR@mT03P>)~!{
zq_pU><PO3gKM_&IsIOb4jo;njYg71sPv-L1@oDhOC!hSZTw@bjV9%7EwCZ?VkaTWm
z3m)ncbtkXw6qh-4%YS7Ji!EAZsB0kqgq5^U<dvuwaYh!Q!+CB?49q`3=ergc24yaO
ze0BLQ{4$-<eZlVzSm+nwVLCH3@WVITe82zx9{^N9tG~CdYDMzPNGWf8!7AB@B(BUA
zyI`VP@^ESurd^A7&J7W6G@d!L=^YJisRV(Z)bU^;)hYd5UHSi=|6fXkeWG?V1`*dr
z>&}|`*XDB^;qQu0>w4x<Cf7Yr@=?t^IC`l#gc9Me?|azn?Q{n(gLqeML4Np~C68k#
zucse=r|v5ydYcaJeLVH_xw?pYC-d1ok1~@<KS_Kh?A`NR{;~aFG&__Hc<*@ieqI-u
zGKj~c*txm7GhC4m*~}qZ$Guy7fA{!25zZl3-qYw{_k6d#`=a4g?rHdLw|U+?ej##l
z^`6#^pH7=f)N!^}?Dg%*d86gzRo8Uuv&PZMi}q>bta)<atoiOnZJl*X=n+OVmm9A|
z!knU6Z`|&LiqnMcco2pYTzQ4`J3moM5pCh4hIy&8R(bl=T`z8Xamuz;h;h`gvY=s$
zl#Tt9<HP0)ZdYB<?y&X#c;9ZgwV<Jl^7ZcV#qLpRtRD8#Yt5;ZSQnE8f)w0i60K%e
z!HjQ(Q$_i*(xi`HumE5)c+s4@Go?%o?znYKR_*XseMUW9N9qZ6olIDUdWc@sUWKYM
z889EFTdV9uBmR^hC5}H-uMg<j=l4@*H&<i?<@ZA#n1tO(iR07&!|jv7RQKKuBU0_u
z3)H=av8gL6oKjcZG2cpSN*ao0=KP2WSq7t&&sm{P_PX_=eg6JbF$8*dS}Qv(zJ!xU
zhz6DPBV+Z*njr}Fu)eGdra?8;#p_VXsHH(T`#yF)jH6M>T*6EGVTore-A^#R24!w<
zZ;4LCO75G{#oke~_0p(dG^2UvQET3z|0*J0Ig{yl5?n&)zh^*vhIcQ{U#f%r=AzL$
zhvne4(zKg~vHf-RUUv6iIldm(d$PLSjpvZ1hIh_K+UraD!r4{ImnE31opPlmV^ZN_
z(p~z|<$QYY1YaL2E^u~ki<zfvk?1P<a-@19Sto0qSk~Xk!G+SrAKNQ9?#%~@1#b7W
zskg$?oxHEK)pIiOSOV}^X@bsZKJ2J|)F~dOn1$w}hkR%8`BUPVyqt{^Gdf4(X%DAx
zGF1ZfNGUAgbQY*DU?UYZgAQe1DTQPo6&X7m(QT&mb)`b}=L3h0Y0+>p2#2a0+L8hL
z-NGsLs`{Euqt0AuJJeTvr+OVatSnAw?5VeznRMoAJIrJ13?nb*_@Hw8@M!nNqWd!4
zBz-Rwu=`AN*7qCxWMa~c|AE#QjNzC#rXml`HUtq^RHtpIBnP!w+At8tOBD5Ekyy@P
zO8m!tnq;C#QhTBkYa7t5XxqaK_)sgQM*A;R{z=Nx_R@ipPqjs}KOGMfP2pimBTbK3
z>86V(w!i|R=P>Sk2<ZXa_+SRkMgVfj{*p0H|C)3_UzgcDO?!<lEwWc{vU)DvL~3zZ
za@aAGPRVi)ADTDLRa@VqVKVb*Ovc?Se%BFE#`;hVoDF<EW)3NZiu)PG(Iwdvc?!&r
z%pBO>|7aU?0IO0uV{ZWKW3DSUp-`)KH0qCcpgPe*^k=gD@HA-f(4M(s75un1K^V?)
z|Eta8iZ91IxyOlHQ*(7(BhgMX28Bf%c|&)pdYq_>QGLN2#_Ds~<J@fAw;zXE8|rss
z%O)~YG<)Ez@H15Rnc{M6fg#3-dFAXKEA^!wz0uk{Uu>D-F&~~!SL%!XrE&g1la$t`
z)lYWz#VERk3Gar5tC_<_#l#Mg?m!7SZ4t|QJNXXuS3G!Xoa=%7Xe;#)jPBrc%l5!r
z(qc{N9_WH$k%&&PbEAYGy2G-4ki^ilI?*RqkAlDFqpFoNZBI#WR?{KLeeH3-uU@9R
zT{tr|D`o_y!|`;Yj#_q*O3@JxE?ihQ)8jJSTz5Dav+Ga&%Nk-rIi58ck4F4`;n>pr
zHJbc#+&FJHPn9lo)&_G$PrPl=SMzkCA&U3<XvU7dypcEGl@_Y_l36=HYLU%zGEmaT
zdWvsN7Ie6<Kk8x@-eM#Vos*Fg+?5p9TjhkwIUkY?lp0_J=}!$aHMs7|gR{J#Hsz8v
zu#EK^WC~83s?YaNA1UIqjhL<fIogvx<ZRfY#!hND^tDJN>g=dnDHuRxAbyroCH~0x
zD2gw2=;r^h2M?|c+v!fmsG7T2=TnjmakCnFviBxMPwSFCc~wsNFUyW~WAoGMvd_si
z>ZW4(IN`Xl_)io|4C$DRM^F`XSG`Ehl7*}|y$CM@r7bZJW=b+f?0IVP36P+mvvy~o
zRP8n`l#yHF<Z_sXo1_ebIrYPvlu;y4W!PGY@3T-a8>a<}Uw87)C;=UUqC7*Q-ThA$
zNG;OLEGD|U4)5Z2mpt`_t*61QbfyN&jq!QT^WTrcK@a8&I=Aq8UE|^e)8=hL3WSoi
z+0b8bCu$9?9n5D}Z6j@JF_$!+XgrUJ>x_t7=&n*bD%}asZ711RA_38*5+~O{OeVhR
zl5UcVn#MDohaw|r14j^F%O%A<FX?F-Xg*;S5~dG*&K<}pbEtL7f1Fyrbf=*ac16Mk
zPt;u%(n;x*v$pAG%0^HTG~cByq0)`w$(BuY71o@XO<N)MLfW#pVY|PCB(F2dI`$3m
z_VI97q!|tS?Qqn~GN5cXd`S<YVWcjuVXTDw=$1ZOf4Is#ntYjj3a4YaZKh%&c3vOS
z&?eLIC0(%h&%<!F1stN^W~wJb0bDJUa7rdTtuGcqHtu^Z_xms}il|p&L`EJ-JVqjc
zB!`%M+K~21_))W8g?egFZ&rwKaJA7M(g!cKA=OCKo@{g18E18qF2T_zuK@1B#GaZV
z#wsIXa|+Ku&KDajc+N2&V4I@L8J*I-^n;q`E#Y+L_>#8%R=r5HRC!hE@UlYB<}`I{
zkdl}pR?fh_Bm87^si8fQkzw|@U5lEnt*3U2wmVy*eh;b#DV0iyDA+MHKXozA<F+<i
zGkg4{&;lkG$<n9w%Rj4!35!k1jh|xg5E&E!;KimV=5cu?eNFv@w~B5IGD}1cLZOKm
zowld2OtoXcNeN2P*z^hI4mE`uHAhM(VDtV>%3-YZNvA~eNvZ5~)XQ$d@6}=HlfgeC
zd8f;Yi-0=FBqv%kJk>N%ZF!?lFT+_p?p{-WYwM2otv{sAJd&=-N=lL>+wVm|U_pl5
z;iNdz4XY<nWCHt#W$00_FE;j=ZNF7bDZQD`Q@ZT^3XY}I42-U*$OIiT9NFis;<pPm
z9MugW8zJAX)=PovkT||Rrz6{>m2@PQN4EcV$CJDKEDGOmw5Lt_x(vNLnVQ;?q^V{5
zQf!zQSY;>K%CF<g1EuA^7{_rm$tw}7t#`IJvNbO1%d9^kFGk^j;XdhaWCL2?q|9@j
z`QW-uriov~D7UQ`7m0Qs)EG!dQpD+oSK~oXuF351#G$fmgoQ@Meg4}CZH~<jG<89!
z6FX8YM;+OWIdmb_n0p0@F&FkdrG;9T`^t7nm>4_JY#2-m=X^2gfoCnBGA#J*sAuk{
z=7AX?yZ)p}>U!f<OT)HSeRP}b+-gXfN6*zqFloEQ^s2Sm0-7Y7VGESl`i#v0H;*EU
z5)H?r48?>r<XvL#EjtY9s$}P5+T8h%2iDkkr_<n$W`10F$O@EC-YrE<FZn;eRD`Gg
z!OT>RSKh=I-J+4?kE9ag)s?2Z>f?~=Ig0;rwcfN#au{Elk(om!J&M<FwGOd8`LuNV
zrq8+Fw9=(`>hAAS{CC#yhO*QY5SoL-pPihawBIu1&O+@ed4;6>*|<9%I7-Tl4Jdgr
zlT=&t7w=aag4iO_m0eGzv;ASG<g6`pqpjx;)oeV|=gK$}1=nvZqKS_>#q8CHcamY8
zW+qa$G(48~$4=$pvMUtEE$fbfPc#3Fb(%Bai2U7Z6m@E9EPz0R6GUEPA5tQT?jmoW
zGO{~ZbkOaNrzFz>5}+B87V_@#A|-JcHrr>Y!}p2Xgdw0>biYs7lwtMM8q6ZmB%+xy
zY8x0ua9>Ah#m<c1vMwhIouK~MC@soe)X(Ed$4j*+bq>0S-?*>4^w4l9nES7A1LBrg
z?3f$gEw}=$cfr@RKq!@73PntVz*IwMo|ZAI8H>iGgIc<nT<nmge%Y#ufVx$ctA{*%
z#@E=N^WmQx@Id;2rB9f=o(@{tKF-6rSH9~m?5%6_H0oiQbecSB0hfy<64-$)rU^w@
zoYA4WE8k{Tw|HUs9r_B_JcB=cVxug`*Z+%Kss5UB0vBE0Bod?r(>&v+9$z<)X#+TG
zWRxEF*OK<@oAOan|LbY!7f93zXG{VX2?6B-Xp30Lj1+8AwGwkFX<_PMeT>K=P3(?b
z#01)+_wikwcrzEqOK7sVh}Jm}6kRr4r&olES>E5_$=QB`kUzj*P>(N^uIA83ik+t5
zMdE#3RomvDB!Fr@F-Vx=I6Ow+m_R>8n3!m$gHgMMPf?F4Lt7?L2!11Hqg&SZI7hqg
zkB38&@;17|UfG$BJ0F~ljbM8DvCK9Y^;;LeZBWEJ@gw;&h_Bao9<Y@aZ`E;2djqAF
zhrNA%U$cMAF(S$9)k7c0Q7`)xn%kpHV@vSX^cXlgs@+u$RHx>Iu>nO*UXExI1fu4u
z?%y?f`}&SflR?XDg?17Z|J_lj|M~fM{p8}m2cP=w-ox(Ke8=+m?~3Qu-E91KMg8YL
z@!$V~pGS;k-XBlyrqSiq%vtNMJ5{wRn^m{s63(^j><+@)fN%Dr@Jeyck@Ga}UJb|7
z$=~F^4}0NrK}ECb1B@Zxaf;89NirI#`)^K(8t9WwGzz915;}~_@Byo<OB-aBA{X_Q
z0Ln4qGuCA2N}Yt$VKk%LL2lGu;w?xl`39Z=YyL2tJ&}<)r2b^a$KVMW7%^36IA^>a
zLoYelr=xCBHrs(bN+yiDVHy3=j|7atrEkA{)XR)ay|=3*zM;C#%!sN5BT{d+=%YuZ
z=G>ci!=gbYgOSmF(Vzs)opjb4cjpA34D>=iQfmZEuM%LwX%r0NWGMs+5jyr{^hD2J
zHd{{X<na96?pec8zbk$GZSz2hGJEgUmkpLQPR^YF`mf!V`uh9to!#RD_5b%y<EPWJ
zMyuthFPpDVkD84G>Q8lZwtIZuY_!Tw^H|+v2W-FDyEu1_PtKjA=IiFU>iqnq%)QH#
z)??1eq4T<N#yf2PrTT1luX)rwf6wndY@Q#}JC$_g>^i5rXXnlRi=*8$=k((2^rWRm
zt0r;KZ0#TIHeWXm)Dkw2)qAP0#@oj6Ic07+I<n`r*HB~PaA59J%?m(Q8h!HHzM_a4
z$x+#9oi;GECjHg;si7vYd-lFeWY|ABZjnf)=COO^9PGZ{eWB*Fwww&qnWFjr#aZJu
zjZjU$b+OkvZ=PSAH=GwICkIU8R^#k#bHCBragI(}Oe7_5mK};~;diSp6meQR)E!Oh
zqSa(dHIJ1fadvS^$lP`3<;lASnOgQCtrAI3j(OIKBqwL@sb3-oQ=EtP?qx%Lbw+el
z(>p)gC4wl$t+{`0wWL>`pPZdrlXZ?8FOHfo8prz$`u61fCDW~O_O97#tgD4;wy0GT
zuYb3z-hIKdr^QjD!>`unEb|gN%|mDR;H~O|x0|$AYu{?hK4AjxzZClGeZD(T=VGJ|
z%*SwWSBA45dO?EH>Qi`zz#3U<pEGNvw(8*_HDtc0{(f<M;k*b(;grHR$oSTEj@0=c
zDSo<EdU1MGTGzH7r^<@Q=#H_4Q)2?6p47R%xr(}1PB)0bKlsqbn*H&cPLB|zGGW!9
zumEK2rbJH3aG32pB(E)n2HcQ!kitedx|+TxK0oF!%>Yufrhdk30m{ud8HD0c9DJxd
zW`@JQPwM`T@tGTi-CN!6wGI^fV@i?O+#_oS9(H<4bE8M8m(HE~a}XN9wnZ1PSQ-sk
zLjo|~VZ!CWY1zp}_ABO!*5f9szjLRjW(e0C^9=dTp=P<+SC=`cyc<neH=ymJr@v(G
z)KM7mSTq&HbVcufzzW!3q7k`4L#Lz!z0-$R6cMRZg59?#&4ac&#EOsoMKXRUc5sf5
z)<)|}cNoN>`c6OpRH-7P@x!a<#qAyb+Ii;SS)}KqH&MQcv&JdqBWUe0;Ce^~m>UA$
zs%wT+vQ9)kVL~>JNa+a&ti-Bk*V^r9Yul$BTJ5%K>U*5qs@+y6Wxw5ao<E}?IXxVb
zWQXIAac8X;EA>eUw`H=du4lE>zmrZI#6xwcC~+1)Qd+Lq{@tj-Pn^=TgOWq9STC#J
zTk3c9CjPyvem5_)A8|^qdBiDI%p*>zDvu~_O^9aG4ioFG=?Uj%Uw`nI$uzhe2F{E9
zeRUNFm!om4cB(U($5)HKQ#$0B_G)SK9R-d=-DtMiS8Fo6nvUm}YKO=WjJm1T<N>P*
zoO6r)wQGvcF|Z-(abAL$qFUH%Q?@KYq`|6>)dcfidw$gZ*-)~e^pNU+J|+@9Afx<z
z+ris5q6uv_{GmSGSeN(jpq1{ETk-e0`<+xbX6zKGt=g(?e~>Y!dqP9%gjzmx#?(;8
z#{LWh;;pF;o=Sh~JZbICNKL9cn+|s53;JDksAlxT58@eNJnR~O@zhzXI8UECwRN`F
z45As|57YU`_BH*(qAxvW^`v{_0dtqn^)%K~tMZS`8kytmtTn28%@^xCnFh$&;<)M0
z|G?hef7#f7)ovc2UYutJ5?KSW3AM^Nn#XT<k5(Rtb(YAvV;F?h%zQ=!QkRGNKMjq~
zBQe0FWvng(b*u8KEFUmmyj#^LwEceg!7QzOURm(DTl{(TarX0~w^g?nJY8S#xxe7^
z+DdQp7CgPR;PVBvsOD%<__hU<spKdlpD&<AB}a>*w^bHUrjnzKe7=Adl^iV!-?o4<
zl?A(`vVa!OO1s2aKpAJjE^!vn!dYpTI14D_EZ8N^0$MoBcZoUX$p`o^onPRCy4Q+D
za7bh~T*Ng~>{;=2^)m3N=T0rfOX)J9JgIyIY&vUT)89GnZKc0XoO*j*eO%dDfeoq~
z{9nQV(=X=9DcNE9OR3clhTw~*a{qLSdS7i?i>J0=dVKrX&-R_o?9HkN%=aPBQfX8F
z^eZv_ZW`Frj9l{1+5<~(KP+<9ekOAxs-Z%RUVJ06bhd2p>h-~VK$f}8PxAiUSF%KE
zPZ6<rrSjXVcw@1@vlqo52rx-{Zji#|*gwN?*qz+vW?Iyg_RBNJAlTABf8;*P(CXgt
zlJ{<)^l^@$W!1VnQ~IJ(DDexK|EvJQ>`!kIl;3bpHN8Be#*c`uo12Sf|3`j(I*P2<
zxpiZPZQn(BD@~A8j7_Cu%=1&=r?$W7srnZ^<$uvrwJ&<g`=Y0|zUZmy7d=(^qNm)#
zr)D=}+OQ#EV3d}*XuIb2<<d7UxZ-(N3fse7oKf`tSWSzrE!3jN6aD6Yx8LS#{p9?A
zm*dG5dECF^JMQuSx%Emd>;K!Ty8rS2{VRTo{eP9mWv3MkK2q-9Q2jRQM}ufG89Psd
z(JY#VpD1Qi9gt|CE*b*A44=dPJ#e_21R<qO<A2^S$Vr98HTX5Xg4wbCS)bsSdISrH
z^2N@;ujmT=N{&FD-?3$%9tkiIXxY&?`IMI+LdGEUK`DVPr-`BUm=Z^;FGG%5pN=`-
zDafN9@2SBtO3!3YiO2of4Q&ByQ_+ur{1uCzMzrOow5LYcU2*(5uFU<D)Awi17cbA9
zmnTODjk6Xzz}T(T+`BkGQ6H4p%UR+Rv(V4^nNCjXY@wg?vt67#w2YUNot!xjXENQB
zcgKx0@lYmn-Q&JK*ZW!E_+&QqCBDy$<CFUNGrmvT@ySI06TVN&@hQ{$Q@&4edt&ka
zwC7VAv+H=N=QHJ1Vy-`BzY>K$Qe<v0QfE0F5?6V_!i59;+gNcm;!GTX$*4$T%Fa^)
zl0Sdi3*+we`BSxRpFfQ`=5nn6yi(E_u?hK;FoS&kG)cBoPZ2NBk1)Td^fBy?1p_aw
z(Ff}#NzTLg#8~2c!T=~>c1Hxg-WjEv!?2rb5-GGEdjOCZnZ}&{gh#SCIMHsZ$C~ay
z&$4WidBEj?1Vl{HXY{MO4g15{n))pqPG)y&>*dn7@wf5cXXgLW-=}{cm6ilbV)XZn
zI3ej@lV6`0VlH`5&qO_FeqHH7o;37Ny%Zefu+}Zp{L5<2N<&?v-`Ay``lvq*LwrUO
zzsV3rL7YmVfKyh`?#<C;KHK9=)oberv7_BO8j$}`qKN511CHkmi*&=uP9BngAUW8|
z=2F#9UMc-O9I^MB6Ap2tv!WVDE{#X<A5Sm&c2x{k$wG7Or@!H7Pw8zCepGUoa~<9p
zm-L+#7K*Wm8<}H3k}WJFN0T#*%R;7#{Q)3Y)jzMzGpD=xoM5nI7If9BaWb&5#i!+j
z^MkFG9+k?Kb+wFW`tcW6Czs%^$n#6(Fy@n2;oX@!RBNhTuTz#+tS1pa&2;EJQ$V#U
zYeh~ntP8yv|C)qMlTC;Q$@!sv|J@mHKIbr$Z=N|Pdp{EPUopXTJAjCfmg+?v{lu`5
z>L+bgLQ^%HQiERogvO|`-Xdlu0fK7WrKH!K#V6Mnju9S2{0!~W5tpuTO2y}*L?~~e
zh7w@Z{<U6N#IVYxs8q(Q%ghM*U+($}Pn95=$=kr%O9h?$0o(dNay_bk#=4DJ@%=#<
zjOG(c%pZ@HR7b(}6hJ}39Nia)f2M2zrHA`xM~5X!wqqv`!)rD)zD6g!=gid|0*#NE
zn-7O-^lIO#vl8?<BiR+_DDMVy0m9%M=<f9M1ogkvlI*^csE*Iu`${Niw093tcHs2r
zJ*Q$t_))-7+#>es&V**E1F5%~eY(~Ok)jS}A4u)|`LI%^@$E&oCM6P6((9nd02)Oq
z07>*qHT$74>G6~vKHWci{`BbZc}Wcbe2`L8F{cy7=In5PUD5g)?-T3nhVCKDflCi@
zt!(L?WLmx)-%!N_p?Y{5s3B@zrIVNFoK6EuhTRS5{^6)AMX-+Irgyrp%P~L6sSntI
zqz*92@`_Dgj>i&6MsFh@I8r`m2VQyT?91DPYJ|UGhD?YlCEw3w{aDsluQRmbd`voS
ziZunTC}<Uw0{KV6rqvK`#?t|P(xY_xI)^6?PHgpJ5_AU8#zssponwcqFKBoat?qdG
zFf*s>Ls6T0;}A)CIo*JcU86T5_b0~}F+_;78EIuweelE@kLF~={W;8CFV9Vq+haJE
zlzH}6LO4`%B-PJsL^om&w`p&DGa8J89tLB*JqaKJb*PjO*UK4Q+I`XM^foP7^e|vy
znzq?n!j~h&23!5~s06@tJdd+<+~VX3j#5$w(d^EF@vF*4v4_(R&fQIDVt8n`G2OB9
zYWr9(fl3@l!)Opt`or;n@m?Cd6&OZJ$$iEwc}fD-^cIsBP&yNYI7?z?ix5m(lp@hH
zdZc8XFR=gQ?0=N3^XtO@@3a5;l^p)x^XrxW*#G_&KO`RWQB*?5<&=VPDOp~ugSDPz
zejIF%{O79uqm2ixm%Ee{Xyoia*t>IDGsV`_c2>g7)0lq$Ti6@kgq??MFRZxkw;I-Z
zFs4L*4<4M;we^-&i`ZG?aUC{KTNJzQRJPsC%KC#+(CLzBwEOt+<E_S)?|60B->&$(
z&fe};qgtz1ocean-LLxl&g1<9_h9?+0YB7J|Aguva(-T_f3DO&k^1L@`sZ5xGf@8w
z)juQk&shC4QUCl#Z`$@AZ*Mg`&#CNh?HyG8hI-R(!`t1hIERmGmFnY0&1uxsmURy+
z4|dfhG8mwg(j=Tk#-dmXsIM*c*yH-vzH{L1dk4F_o^$9|8jZc`o^!Cbdr+-!RUE&z
z<*8F~_(0Y`hwmx%`~0ZUZX6#pcaI&NW(+r)5?iF%_dT7y3`t<8a|9Jy9Z@Y$E-rC$
zcnITfq?kCT0!8j2j>b0S*din<dr<VarTVKS?nMBES|4%t+stQ*$<I=smEy5tnNi%2
zZo`;t2i7;V-%_6-SR2Sy8PRk+SmR=HgdLs5R3`#|GyY<YKcmXD=F{iTowcnhd5G|x
z1bcP{*RIk7*%UpvR=-JxE@r<GQv6VmqH3UN+EjN2E>Cqo1hmljo-L~LslJ+~T**pj
z?7@j^wT{BzPGej5-k&$xCuawZGm;BaYi;Jq<BQbvIuvlY`F!w8^ef>RY5vwn<*K*-
zoqKzD=(_a(b-|wgo@=*F&CuxZaGf!}xsmKOUo0Ai)s=<^vwo)Z8$|%h{SwE5b!Ly-
zHwH>-^^}><ca<7VDK*ly=!eSII(_qh?a#LPBbi+4n`)*p_o~!Ytn%8K`@>mfz3iM-
z)&IBD|2?)6!Dy{hrH|Fxi*zQ&AynkG;%U#^wU6bS@@@I9{Hd&_@#%+WYil>(t=<0L
zyY+ST{~v@<Ke)HG-R){!ajYMBtCnl)J2%hh*PHSdDN&}!%KbflUWe6uhd2NCHr18i
zIC$LH+pXN!)mFjS)^2{kUH|TG{dYCW+jXnc?Ze96-u}V<eVuyuk8gk1ukKe4`~_X{
znsP$Wz#*okWJ|@AH`T$$27PGEKadfpCL4je@st=gyBdPOvAu-W_<S0SVmkM0CQAng
zXaAx$k(lVRDQalf{Nj7RY7?D#Fi<Q>JydpjWhaE9q;rcP>O4`J(|vZSyF^D%lJNXe
z@lCRr{g=CEzISwT{G#ITXkbr@KT|uq6=*{FW>~vq!IZPvP{hS#5~??I*$<t?TjynD
zTnvt6S>{`Id@qFp%B9u23VJ$Z9vY60dC^LEL<uX^FR`sU%d4q8HHa;x<WTUS8!$eb
zhHIx9r$mC>TFb-Et}({N^8qUb+N&eLb_(30-@_Z#Rf!)ish-Qu)p%m5A#62ZJqTkC
zEJQ#ed}ryr0YWF3^wgK@n9`1oV|WBNEVP*0+2(WXxnF5^R2r5D`Z1Uq=u$xDUv8pJ
zZyocAPAAkgpH$_Op7~@;J_*eydcUcWc(}1xa;dsDGYo^SqTJDVJW(4~9m9c@HbXJQ
zpxh~U%e}I?iq+wyPr|bP%&FiL`WBx#ReXXc=rc!~6V#`=Cv}EAw6l7z<$CvXz1Nez
ztT$|<oz?r}Z10ua*ejK!ujCDt-1yZ+mFc~b8+)au`>NP);PF@N-s||p>U|rZSiL{i
zeO0YDRC)YWtM_UJpCr9ktN0}8y}Fh3mAs+qp`F!xE!VrB>%E@zWxZh=?X2D(XM5ku
zjeV<<^p(6}D>weFt!(dGxv_86lD@1r<i@{M&-I=g`<9{omh}dY$G>Iu?p5$f(z{p1
zCrR(#R?=7U2G2t~tM^*2cR$yAJ?YDO!#3Jky+6+OUdxTWR!RCw-cZYpzqXa_y_Oq$
zt(Np<y&*ULT0Pf$ZtOKfd(V1<&*S&3-u((bNqYCI_$2Aw-%9#Q-r##^XZ2po_3r0-
zuP1$3Z`ejVtM|v*-s`!s*DFb1$s6jq@z=Mqz1MSNuh){ktT*JwU$5tS&yBsVX-}!}
z#5k3@p%`J$ceGq)5A|JU61(BvA_Q%)V|`TNk2>~8RsN`Jf3(FP_3V#4{wOr#dKXPX
z8cf86I_x`>Zb`Zq=_aJR&s{7yDXAw8XIkp{{_pPhWk*s5@n=?;-XD-dsSC;lt5i!#
z2}@;fMoPpGN~9%CYO_YawD-?{+R$yZ5Gnm>%`^H01P;p+!Dwb?m5~@+QlOMrU-xR&
zEw{2$)TV+qjl=ze-M#I{g>9;6^LTr2_hA39QP^e+Z7S|owdU3R!Zse->~9@Z8<j&h
z(*|kkdCZy5FvcBC+OzpcLU_qgAu=3GXBqJwnFjM@EtK6i90@VBl3eD5_^9lB5Rc4<
z{5ZAvMXsH-{Ja1XCqu;6y7ScekoXsK^VN9lJRwvk1gn4kysFP04P@;DSu#|&-#Px4
zHHZ&_k9VG{&u#aoi1FW<7l`KaK`Az%!&;>J^}Wpx+M!NAX{9K=yk#fTne`l*%h#M8
zCsO0_x76f0(_uujq0rql_I>$FzT*s_(XUqT3C8{dHcIj#yCb9I(`ED4Ju}u{o!e;L
zY&l|X6F4Qr@y;%3&QC6R!Fti9&g7r$z(ew0uBG)kH2kINsuwLh@k!9pPWo@|f}Nt+
z5;`MZMrV{DBlmxkYBwTFF2(gmL-Jp+zll6H&cVwwD_i*fctqI>Gn<a}K_@0pBDpt}
z8o;g|trSHgYcxucYH@`OU2zTRt2yJfexMUwZiZ|Xl3I6UT8u{e38S^`aguCKbdJn?
zbeG%&(_Wm`wbB#c=yxfw_qz;*9+*vty`Z+lQ>Uu_^TQA36k7VXNy(W%<B_F`6CCG*
z73sh)z!p?H@u}nOs2-j_f97l}wn1<D-^nK5*xbZW)4OBc(Mek^bvirnZ4BHRu{B*7
z0@I!5xRL5j4a;->>bTAmrH%cX96+*&u5E3q7T+m`vaVKQd)*<%QYEPkdF-)#<lLN4
zroWNNF_^;R)7|P;T{(FcLpE&qyDqDO{Jn&l6!6XOoSLhc#5ZcdN_17T{@>iQ>$+*i
zw5<0(7LFky9TY;oY+*~+YJQp_t?S9=_LG}i7dh)iYm!iWEyLq}i4=GL^`3>WX0=er
z5vj#YH6^!fXpXbKV>kZJrbp_5<coD?j73hN5IJ0z_=dEIMI{_t?ej+K+?W9OE)HAG
zpBs+nKK2un{>3o?DA#V+9b~Ulzj5Y0dIx!l){<0x-~e_8ziyX`jE0)4YIf^%XSYRc
zlTz$~F{^9g7a5Pf)XASLhh4@*Zx!k#pM1=GqKA+$p|$9lyAwT??sse+#P8+ZqF-f%
z!|&9XrR$`R3LSz}2i6v+CwL}hP1^P3DB@<K3DZI0uKBykR86$MR-!h~O1T$SGq2Ol
zzjdp(r7{R;?q>bv-$%NmBoy(F|9^|0`JeuikN*kBw4Cj$a4;bt?^k%oa{s^UyHzja
z|F651|K$Jsm;5Y<|JkDae_q+Si$=diH>AGk-~Ps7KM!@tPwq+e(Cc6}qe6<K?jY*-
zou@<f_unqV5vBL0=N=Y5Si2|W$a?X^|Ea-7Updz3%R`O6UZm023pDy_aYkP|%;;-H
z8T}{7=${j0L>+xWipBo~8U42iGQx(xFTEmEh!N=!FB&H=cUv#pFB?avl)(D*v~ARe
zqVFv1kO(&^@X(8&8)qkL@wyW~Brp(pLm$Soa3ZE*-KyEr?bg1LmfwBne1o>@c008-
zOjBw3`|pl!XiAHinhr0*F~JuOquW|_Pqp4z*yL?6MT6q{B+`nSut>gRf4Vyj1I~Ss
z`cyH>%c~Bty^;Qna_Y;sXF)HT)9XkJvU=Yi4=2HtZfbFE+i%_ow4pWiX@?S)OF1A}
zh6WXT<iL_}67SvNZEL;pobpdj39{Q(muEOt*Ry;$2xgLjUAovKFSWW<_Qtns>UFKF
zfQpdBR}3hZhc-Iw%2p4irlq^sSL*GY(q<Bc)G)Y@cQ0DoUbe@i2eVeXlih*RC-G4M
zNvMT-SjHodya;Cp5eiD_IS<C8O3$9G`YUB4P5&fMRZ~w@dubwBZ)*0NqcojwE9TL=
z$_mBw^kdcJvE<h&cfEQq8$B7<3IoQH6pq>&)cvov-~S~;|AO&{UG@9rz^wC4)SF$k
zhvwZ^boOS}2cNqr&OPg5kJG9GP{1w!Qw`w%t)D#pUrFHVA{%_g7=WevzhCicl}a}M
zhwuLf|Nk%fF$GRrvhJDKB+*E61p*$EfuQ=IEFu5N67rucA^%a}|C1%;|6v9GPh|;7
zKD&w#cF7;Ivyf87pPV+1TdgCj-I!7;#Dhob|Aig2^%oLqV!jXJyHQs%-s@nbE>}ZO
z#U};RN$^PBgtJW8(p~(Bif<QveiKBQPy5}`Y(O792ydw-gmzMfqmR*aJlc6sG)HNw
zer0dv2BtF`#BFw5F8P|Hb<xV?xYiLC>~U?;X*g~iwNGh#RQ;{`<HGnp<Fhs5z~x}v
z2?kR2Z&7pY<ppMjGs2HKPej=SHFI{6s1tI6jmZ-(Q8)>rX;BSwErU{DcI{P@6D6r7
zOtBw2r-<6$Qa`**K@3S=2D_@`Ml{Kk3}+bQ;3l|>x#&VX9?)%|E0OECeaXQ>))9Mn
zs1d)L&<poeQ%Xe(87TT-I37ha4*N|N<!hZa+pl-26q_T3{Ze1Gj&|QR97ihjrN5Fj
z<?pJQ@7f27)ABc4>zHC|&O_naBpjFRtc}LbZ}ahVK3vZY=_KjElMYUD&vPi=bcmEH
zsML|~36o2@t8w0Xi((=RP$`Q+aEV&ASJCJ?wvs(8|FJ8q#yqy%D5#L~iQ>8K<}p<R
ze!=%B4aeu<97?@JB;X*~;F4Frzr1K__6Oy9c_g_JsJFg8IhXQ{^;8uKF7HkG2uwnd
zz7bS(Nn*PzbsL@>AMys^-nQ3GH?&<8^L;uBZ!nJMyj>S{(L5$%a3_z~QzKEl@=9?k
z4LY@mvZ$|vlj8>Vsk@$;mg!83euRi!KqoFrY1RuJR@PAsdracCu5Bqf8?f$DU@~<E
z_RpH9=j~U`qoagWl`5|{zH{h19WKjsqLL$<>f(N{*%_tZc)~dmpcE)NaDZ>jfVT`S
zG?Q%}AD*;N8)wav1Bb90ZoUas9Jia~TkN)8EpH$Ny>+8%VWWe_;qJxJIUhgdFLAbt
zNA$9Bbac`tA&_`VsomCWuHAle6)O3^lz-;Dsk&BD$cq=M-{Jvq6B*)K(eyXAY?hZD
zH*aWlcA6(=Bv(|5UV%2U3(u7tN<z#6y6b+GG^>PDdieeEe#@!kTXNml=J6|Ze5?de
zvmCXhT^m-ThqC6o8(SMRpn{3M-u+4SdrY!gd;jG1Yr>xwPqT5P#-QZK`=&@e9yDlP
z3pS3~6OH5da!Oi4zUGS}Qs@U1(>ys+q<(qQI;XPBEoVvZY9F0kD6uou`hm@Bhe7v>
z9!-L7S;|;&s0>+K=ey^P_AzlAS5o98JYgZ9TF}kA-R3#{s-&U{Fm+0nLs@6(vP}k}
zS({kE3jMWsmE_v4qR=w&bd;?oK}hSLD|L2!&=!`iCQLKlO1SFgb6x*;)p_CyQd`LJ
z%v8;|lyo$@<XHNZ#-{He8ePk&*_V&GdsgY^;`D(2Bb(3Xs>YC%G^Ki0#qpxu&f*21
zRO<1frMfKImjw-3CaLhI<T`6gvqzn0HV#n&79Ft4S52}{bs&GtCX4f{5Gh_Lp9Dp@
zk~~8AX;l3ktLvg?vMI1RMdty~1_kPc-(0+Bk59N@bK!AQs$JuZC<vXK?>N7J&m1*&
z5A=0fFZljsk91qzVjH3IEhVx~W=?n;c43hNdB`j@h=yvK#p9Km7e{pA*Jl^U$E1B0
zFdS(?oJ=Y57wRO{{H3i-U-vd6=IQvvIccl;t|K?O;zqYTQNHY#&Wn3$oS)Hkw0L&Z
zKrzE3rBrX}*KH-Q>x8qLFr+jgvuPwek4dhj`d0Jx#gSUrO*$|aXAQESa^31B8$~@M
ztrrtNX|jJt&L1Q-)0az52f63Dgr$gv@<5`%2TFq1K?IN^SToX!(L?7Q<uJMlk%-G=
zpCajh+&9WW412EDoT$9{orrv7`<17YgBeNpG21^wy!ukxDftbi>oTQaB;%cQh@4J0
zAtzSiJX}{gErggBtZZ{UuwXbw=fj8238_Cf5m~GIiXED_z?7WKKwZgt0`xAVR;139
zP(ca(knqfUkyVM&sc8daYb=&ZR+uS!o|!MSSY6$Qk=s-voR)(uwsytE*$r2yFPI(Q
zfU@Cm-cRS9M@ofEl3XgydeDm{3l$Wl4ZbvKG`(<!o(M-i5+gK4)jygr$tcGd5r&eM
z4aVJIK=hu;wt2#J<~PjWq?838RnO$4DoZjJ(XZ{VB-4Y^<PkzL`hF&fz&5Z?Y76P=
zy1bh>BO#|>tMO>FjWqd>SUsf)@E+-*t|igTtoswKnGn5j$tIhVM#CEj^W%#_tr;S3
zo;elDjYtNGBIAheg~lMp5i(Bb$9Ga{<?(#jp+u4W;#24-RatGshqjf2Ec~ES*xN}u
z8jm(PeW}{r))AS8($?vA*|^?K^+j<aii~Z&lXfzLGCPcQFEXP^GGN}rlfj+ojd$oS
zDU$m-kh0t5DiJS}-HT***3Mn__+;_pYOgzw$Y5fg9}-k0Y|}K`G-DPA`FS;OD+i^y
zJ5mo#vJXvGduX6`P&*)-OEkOV2Pp*{PR|V;`EJOb3ucN4NXz$wPUwsz?@zi(9VQ}q
zgoT}Gf#rVlhb$FyGj*;aitgeRrung`xwNTg83|H`FfW)%ky<|UG&<Qj7zkOah;iIM
zn1m*rd@`D?t8EpF4dfj4QbS777~kI)TcXBF$v|RY9sw~N{SNR#Y86~k`m%dF6dtE@
zVDbV)V8xu6iaK|ZS&)S2`#YRS`f6k1Nl}|u-X?dB+LTC?M`EbX=1EDIbN~BM&Q~nF
z5O-r)x7m1%+nV|43Wy*i%aRM^q0{UQBo`$g&f#QE*BB=~UV+f$^0fCFR(%nP#wil5
zb~si*<=iMOg45n04Go`>ASUt#l%!MBt$P)AukY_oHj2IwBccy&754Ua!h{uvi{^<I
z*_oQ>*l#<VQ5JEX_$)*k&s9vIW^8oaj0yIS)OD2yE*9TP$*sn+ZgLB?LYVd*K71%i
z#gZU+Htr|R0n#IJ0kdzwq#Na&L3H<gjKUjJMA@KT(%ntxqX?Iv1fVw$%p-bYWxDrN
zyWiCLRbNvIRuaLqAn;HJtZFPL^4GP)$+&y9qa$$DCv#-jarg@}j+858gPamO*3`%!
zVqLhFV6Z`J0bVbHxV@Rn+D$IvOG<KCbV}wOn{B6VB4#3NBvfP#w5+(GBW{=6MJI-b
zDAJ|;8oVxQe&$sx969?|lo2I<eLcnd`?-G>knY;F)7yNulNm9ORoi5M<3;Cwwx}H2
zf**?pn|RYEyIe%D$&V?<NLbiTMw0jWh%{a(af}Q5$hm!%b-^9*)!SAqBpUa2WP?L2
zh|t31;|`e9sAl<|qEUaW2-{am&DDad%d9ln+a(z~Ry#^gMK4lpW<%Y#iVO5?LDZ46
zClaW%0IJ10-uWVhMaz}=vIYZ3rxy<f<gg8hc19vyrMDp^Vk4abBVlZwl^2@z5=zs(
z(#T+wD?4mpBk%(etLzX5C5wZQ;cP6o2{gN@b+*SHV6=#+I!a$>)KfF<&j&;^1og9@
zcc54c?fRh0GNi^?*%#?}Iy0#R0N|QW9qez56+U#{C7K2lBGwU{c&zhO>o@DpRKrUm
zcfjV%ZfMj>rNd!-csoEuNXugJUZg)YBjY>-v0BnQA$v->Axmi+-G!2i#_ZnIcQ{L#
z^GX^aX$Ac@46jAPIn+k2N74;|w!PHa$z7mriJ6_RFOXPYV<$*cZR``4ZNgY#EZ3aX
z6OBe+#>NZ{Q-S69Gz)DWPnFVz!+EDrHx<LHS@O%Ny6?&AsD(mXwG5_|#eUExr7ngl
zH@<<$iIE!ployy;he>drx#uY(cY6}VhDfLC_Zzjds1G{MG{@bG^OunH)%wU>zk^uV
z4T?Hc4^DN57csGdq4czW6tB?T1DnqI^)-7*t|Gee!NC*$&reF9yu(>UV;-C$1Bcf0
zmSkv~RyXmy{z&Q_NJ4%xa$AfyeKhdKb}$-^=V~k98aTtJj(o~lRaWUSb7-)p?4Hcr
zxjDTCZW!^0KTonxEs;GpKuuf9N{mf9y}t2BBrA@w$x@J9rdQq))d-cMnF2v3c(S<_
zkUkh~V$PcM!o2Hqdf`n$Znb%APl>kyK3>+HIk^K;efeK{4JL#3xZhXu*@BIRFAb4w
zzh8=O;LH|RX=?eJr05JwDVwiYr6TEEy=d7zNbSt+%-lsXX4|QqwX08Qo%eL6$ECY0
z9#HD7%RA)D(S~1tWRI6x6A&h0qFR5z=URWDye#yae(U%6`umK+Yo0b<%>~bkZ9?66
z?Dizxz!1mUW43d2CcGwG?Bv_f+FJfhr+Z3WhKn0cXE{~Gc!0GE%gq*usirUbTX7rv
zoZX7<PnQQvpGns|#3jA4?9(2MseH_i09GIX6%1ZXJ~u0garA?JQyUi2*2C2pn|7zR
z`3Up)PE#J%{LO7#fU)=haWNBYysxf<-jL<5)GaHOL!Q8BrUq+DWU#p$CN-|tMAe?)
zUyPFOGhCJ5BrK(k);reM0({i(PqpAGX-bKJl{V;JWfTRrP85;~n7-Fsy2Y$`hPExn
zLt5Cx;a$}G1zv1&Gq#%tZOXm!17%u%q?7gQL*6{dpG-M<#xUTRJ-ILT!n9=oLYcUd
zk_~(iu_cFs0o0Ke{#iIpol&d!=T&&8*_yfkP>#-+DoxJj;-BJen0Txtdvl7f%%Xwq
z!C<7|l+_Tm7z8EaifeyO$r|$!RTq-AHxisBUCIuoY-7fet%EXd^2eFRkYO^?C%Y`q
zo99QGITl#$r{TwFJdab4<_#v(08t|Rw_<s{fkg-o#MqEww||?5^DqTjRh_+|4{35F
zW11OKpaafPRvZ;Mtj*w8x@1qGPoS_=>|BoHIGW&ek24BFwDeA-{Qh*DQ_E=HCqfLd
z8faaA{&gcRqnB4MAe}@*Q5M=_IuyY}eG=2R6zQuWm3p+jaCE1)kKrXdfCUefPLa6e
z8|SPzCukWwwE_p91hXqDltkN=7X7ao=}}|tK3@|_({EX~pP`SWJI%=UjF4_?EOtsG
zoKILnrGcu=X_^ooJDv|o&ObPAaW3|d5~}N4qgT9pvag^Ok?)eeZ5M6xG{(JS;R=Qi
z)2v=2w&N_e<-@qM42+J8@W*jyfqB|GodTOt9iqjP96DqpP0`u(u02v(ajKVug8_c3
z=0s4Do^{M^Lzk5XEz2!-rN$(42rB*tO`k_upk<|5Ul9z*_FN@*xNzcoJtJcSm2kzK
zOrk+RXH9#R6+!O1Ug#$oQ7~gKD8#*Hc4Uf4-Pe^29u?h4$s@+*QdK%<7zQJ?hP^Q=
zq0R60he#EjbaBX(Bsz(DbXi2bg_|dt+C)65f8@8~&axm5gX;*whh4?)g9(F9mc(#8
zdq$uHfjqNblZpl9J3qJ%rGAZc|48@zNWJHZswZ&uzXvd&@hK$h9)dC{<sKC|upJI5
z^C5E%)tq)imjX)}CNb)n8mj#{7{_cn9ylxms~5uDig9o%YQa-wjxtaHVdEp8g?}sr
z7T^~tJd5UB@L*%0{+;9n?Dux8Gt5Qq${ZA^exW##)a%qzkuVu`9d?t-cT^gczh6te
zhZIY^p^WBAc#l3JLoa=<#JX#paB>X^62rmzj{d#hOMd63lI1Tw|BaAq2ic!(tn2se
zWQg;UWfZRD8d8!@B$4DyxdqdDr-%^#51JQ`ca@3lQV~o=gY@9nQ+w$%#*y1xl#_h(
zxwXyu&e}KX6WLyNlF{T-LJV2eT*H0FlpRI`Spw>=tePvT?-Fo#_kiLo%h@eh4o!a1
z;>jP7EdMW_{0eh-?YXNlhWF3?o{6ee#*X+`FS9U@%v9ym&s*kqXU%hanUf>A$~yn+
zr@zANKVzZw?C+VWlp_9G6V03x(_i*mP&f1SC$3u_rdSVd7VOE{Ea+aX<!D(hy1{~O
zY7WWGMoF^Qg05n8=|Pz}rV0;Vag9<_VKCq!2quJ`aA-jyhQv^rCR)5zD@(5nKR)EN
z{oiD3Y)fj`{dVK*EO|G!Hed5fA5nKYKz*16XJUVJ<AgG1ys2n)J`GunSkt+WL!I?F
z;q>aMpld#q&6(^>-cTrru5bGk@5$~@<4+AQBeuMlNC9@>l4SiTo~f6RjvtOR+A%#9
zAy|OBhN|JEE}tE{Q4f19X(XF(C({#exl~vDNw%*{Grd<+&AK==Nh>);>Aq;Sxgf`b
z)H0vE;{ClO^cb=$SD7a9?H+;EgdS_~8H<#Jd1-J`n<!ShabIl%$|EnSxr#(S$RF^C
zs7;dU?Z6;n|71sJ04%&DSjubQHRHA7PQZ~EJdzcaRIdvxy!zu8;S7GBy}M(jBCjRb
zDD`aGGN76!Adw^X9jq;Nj1~28@|hhFh3>*wX;b4!24`qxqnP#$Fs(s#C6`d0M#W#I
z$Cetvx!O&w*}~CHqwI3+cE;10_FAp}815sQ<3OG3flg3Po4LHmHb0GY(mbhWFq|<)
z<Nmcqcp3ZO?xlNbm@VSd^Fat@vZ2*YSr4*T=@FzKBOZ1iQHtM4=O~z>io7{VU$XuA
zgqit|dOZ7+{^BLl#Lc7Wa@+Z>(tcOj#^uCvKMj9_)m|?(eZamztI>w-x64xIa4?Ur
z00V?}llh*b)6|V9HH9QV4%eK1AWM`}b-66vwDtoWS<QS2S>)B<;2`&|@Ph9z6<;a(
zX77$@zdP!k%}33HH8?R$U_{yEXegVE3uPONncI!gP^`QA(;&Xmv{-t-*e;TlZWz8_
z%tF$TTfLZ)I|@U>{=5$FB*mrOY(I#@1x*ob!L43}cgU%kmAUoCHP2OYpH%Z*sdxUV
z?nFdZJ2nmrS8?gS!s9d?<7s*u3=TpVVW@gWc2M|x-1(rTR;i+p6QGxjh@RG>g&7cA
zxYy!dyiU=w#*ejN_~MXSmmnVw24Y~U649O%bMDROiQ}SYZ7cF~41)<riCL}<$$O$i
zLB@v06ac7kYyvkG(5fBIK^@cOl>`tS=ue&r!K_VLcG5qOHaP!i5_Bq3CduL1w#g%E
zCpbMN<gL{BV=%BA=QedY+jAG6f5uRf-DAC^cz>1kh;q-c+j-%8*Z>XVI#uvylj}};
zKLOxjHWXnsVrPv#PgIu{)@$0$8+sGvkdnZ0E|Q$qlV!53qSTR8Wuj0Kek<q38>#PU
zXrz*jwY$~=j+mW;&**OZ&)!*SME``nBLHI)^EN}wqP<MgMuU<UEtS4h%IQJ;`<5!X
zaLP-TN*=II>itW#{F$%2RLewwX1WIBXKSRgq-#K|Kx0WYXpZ{hdmFXF*}ZMlJwjUV
zz3m9{eQzVkq%T%@Em|%Z-~-zMBMr=x-C-~O<yW)E|52jws#2N$Eltana;Z-j=HHS~
zrBc}~^LBOh|Nbb;^Sa|wIYa&OX0=>m)Y7u2=N)7!Q;+Lk?dK=+&ZhceNe}ap)ra+m
z>7}wtFB7Yi$rp}fk{Zh7%g2H}l@K(&$;w-%6NlDmNl%2xO1iN&J&$Cnei;v)zx4=Q
zF&)q2B|Q<uKIzHY&1ScdnQoIq6j$mH8@5!&e{);L(SuuU4_?h@1hZBnl;7-m-nRz{
zu2Cw}zwKd+#+&q!^BG40iJQv&AA0~_&{fb?2TJ{Gg|lQ66|EIj@ryMGr&L5yr=T;<
zpxGxKOsBz}h*XGNGuRj4NyvPAJy#keu;4nHphKDRl@!EjVZ}qA$}EAL4AO^*XVt|H
zyY$X@j(|hkR5O`|qL1(QFUi~nUgj_XN*c?u8BI#%%txdP=nn~lv?&;*O^rd)U+M{N
z5`ri9A)$rzhXNwpWGjRIkf4eBcR}xL8u(0ZRLM7*><F9Ias}Ca$mUHlsM8N`C@1eQ
z(1{O)e7&$A%m*_B_asQ@jU<Jxw1A^tEPs))8Q8WExfdj7C@WCUiqcx{q?%2~GmeFA
z6JQY48X2T4TSZ6BDj{GT3;yU2xwFX;qZ=NnEyG~D#%MOZ6U|jkekfLkQwv6(bWX2K
zS8XnyW@>_|FqsdwFJVZ@o9FS|qO!=4CahH_hnbli86(bpK`=i!TaZt~VA-;fgd}J+
zhLhRdnov-`gO8(V;JHTX>?GM8?3TOxN8}cm%6V@dtR+PSQ`J(%H)9I}>yHXP{Kfrs
zeTVC*TJAwXPbo1laSaxU8XEv#K%l>>2P*7h_4mVv<Pr7v=JSYJs9`6<jv6$71H(B3
zsbX3pCS>y<VL<9BLr40-kf_GEqStP(mm?{GlSko=)qR-;VHG#V6Y728bhf7Zd*&Q8
z_s`oWudIfP-j!aNukb?Ck~jjDMWvc4sl7*;yvd=(Iiis7bt0-PvC|QS<f}cLpr<x;
zx}PMaky+Wkvo;w|xG;+>$2o27(_k8hht!<rQs()@{P;Qzm;H!VkySIX(_j>J*Gd;k
z0-8vyi=9tNSE~HOoI0y~J5^X!q5}$#8~k!IUIUX%LAVo#wfSD(F<2}(IoH0+S#|7l
zWS%8dazU3FuyR3*6e3xD51ijxw*L%_x}c*JAep?RQLN{X?aaa(JMj1}Y9Q=9_pS_%
zS2bCb<SO%IA(+>Gd};Q>>@dPCEVp<%d7N!=yBv15XkfW4i;HNtw3mGP#Z<xHWKSyL
zKnYnHj>{jfucxk5Gf6{J%<zu_At90sQk2>PQNUpurYwE*srvI(K<Us3QV`C{#`2nb
zR-*}7_^^`hTOx$f_vl&35QGp(U9-el3_qq8JcefiOt3B&G&&kzt{ok<-|e1Jg1I!d
zwPbF55;Eh|q!ba<1;m*bVh-O#BuV3z(E<-2J}g<xH&malnWEKFzMi2IiY>(X;g;VK
zPo_a{R=#w|_F%t_1trVGB|iH^eU=(+xqzwKBT{@ZWGAiq_h`JnaB_v)<uar)4iwMZ
zGjT)m4#~)zlC8=*{(^T4q<XoDtY~he=iz)k1Wlp+D5C0k5~4}L)@jCP;DqT-lNQNz
zjG`G8ZQ;9+0!m0Qpj%DKfTZKgnNlX?Yr~mD-D}F91U-n-(b16A=wb>1NuJlc>7jE-
z0v}~flk5PxCr&)j2{Xe|V+p#`am<xgh-As7m6gNtp-YgqQa5snJ^b?FSHknS>rO{e
z_*$q#%|7r|oa@lusU$kn<Y|P3Q%*?(YJZ$Djb4Vg`%3GIGyJRIUAAPCce3WLdv#_I
ze|$hEb{Je!4!h3$@{%|Z)fs{A7c(MyYF+&W2d-q(UoFSCO38B4oHf}>?-WA|M(h*1
z6fdvZ5kH7#3S^MR2u<&-kO|RP^#%w8xG#yY?TIh-9<Q&2$4O*ocAc+a{Y+3?LHb$A
zh|ef4pn@V!yB*J&**&BqeKK;GnZT6GN0?f2s<WQM97eLkD7ro2@+^(x6LkeXarOgB
z`zIGIk~hjV`4H`z$8UF!o+$Z_bCe;Xdc>g?54lW58Y6)Gj4kW4wR9<h#8JI&hXY2F
zUyd8+?dEB_b$-@9Y8?NXzQxgd99XA@NAlEhsahoe{@n3vwXIqT56M%1CbLLs0Yu3}
z<oLsM8;sQ90Xf##vSLOaP4u-NP1cK}HkL>(e|2_ghMZ^g34T|zJvlyl&leMaK*D&@
z=y|Q~9eqp)vMh!#4vbh5Y(Ce+A>|Glj{d}I#6qZit!A2hA;Kr>I#>gtWx=61!v_KR
zJvg*I)Pd5vAQj3)Jk0ML^+amhWLAFKO$-}_TjGmmuewb>UO)nFQ$z>;VhJ%0DIG@=
z`<~1lXO0B+<UY+f>x)QWfVOI241Treq=#pHWybtTK3dN#)5uCvIlCF_0ZQur@HeG=
z@&Ik*3yq~2H|V>}_=0j~X*vn07P~@I?wQk(U%4dgY}!>b?+zzxJm_*qhQ4sDf#Fe9
zD@zH!F>A}#*2<2U#~bU)C;5S=dDOj}$-0ar&rT5oW#+4WdeKbh*2z{%DdIVf#V#jh
z=U>2fvdqOzZR-3YIeLj~+pbo%()_;&N|xCg%apahI`+|h;_&;k3}>VxpeQ(BsTOQV
z)ek)qk~5m*q0>D5=(F0C+U}icK-G#wGUm)Tlo^+n=8(kT8Bb>2>5VxOocI@~`pwUH
zchsZk-Q^Qck&R`9!oJotn1{tlwFp=0BlUUN`ToiG>kIMWYG{fUlc_ofeS%+vY=m4d
zJEdQ~jemXeZBI#9=td5u26`(^YW2Rpjf;D_S3q(EKX0ciSkhh#NCeZPrG}74sG#v>
z*_q5ck7CNS%yxuSmlCom*plxVU;4eleJBx@KVfl^vPEz*PtLEGNT(WW&I-e98eLu@
zR*!l}Vh-h!yLSYHpECmx%#s77YXYAN$WtJ*;=pOvm_;JvZl=-qWs^jOE!+mHrDWPm
z7ztUm0jY>*PWVD*Yd7>f>PhF+9Cu71Mnbac`4mjW4w^TZ9U8?@b-)3kCU}-BN%FSY
z3@HB^3zQOT+UFx>!ab)D#^WUCKix-kI)W~n088KgtpqFmG?KCFNctqjwkBvql@r5$
zbgL^7Pz^1Ul&D9?i{F`4WK0S+Vqm6_<<o?)YL%W_f761{-xKvO+V{`(BQnF(gW6o6
zv9Pl%Nob&s4%d$4l3`Oshj1_I3(2a^B;xR1hm6z_WymuQI5W_{IZua4{?6y-FCO18
z$%bTxxjVYkVe4iQkY|u-%`_a7hJiFkSV+?O!a*PW?`xpAi>|XmV7IW%k3pN$Jp>ag
zugNgJ{N?E61s57fREMe3oRmU>^HU~>_8pl%lG_`xjLx@zv#(<H!e889>1zD`+wVy}
zp${tf;BVijjYmt6z8qZ>Z9a!J_B*Sx*Sho9!aKb1hxNH94)r8?wi3SrjaFdA)~I-7
zBjMJHFh+P#zk_Ex@=s6g8U1T1zYt4f0;W-cBtoNv%u;xh(bo(iFFX2I+!*<uB!%a)
z-gFb`(f%`aqtTC82)~F(|5nP_b1=WD4e9*w%&DfVpUK?lFwh2ezW=-Xeb#Jqp_+b-
z<t+EdI@NMK(;Oe{j~NVI8lxmxl65$~LFe|iQ|FR7_*$SuL)FY0`A3`5KPWCY2uDI_
zi|U)HFZkF86T6q7t#1D{^I6&ymE!*W%=OL)wpb)^hBaJX+9@>D#L)2hGi|6<|L=_B
zXm+=59d~WI0)xXQDV3SS(Wn!~B50q~sH_aRCNCb{2!U-k8-)d<Qq(>oKgHg~3!CCv
zFnA_4F<N|m03f@@gA$6;@3wte_+asabQr9aupgUulsqC+lW43p&0VEWt9dW%PS3*r
zKEZHxvqfL0pH5bGU#H$El0#B5O##`SJ+q}a#mJT5@J*4|;-AmO)tl2iTz`?Ua2lZD
zdif+?IS#J@jthd4mUNZpPI?F1epD<3{=L9qCH@Bnj3w4o?L^R$Wn!cysbh6J?L!tT
zSq&2j97#`NMtAF8d%D(uP?2oW@&<xFu?&?Y5#mEA5}yHfygoT@o}Zkh03M$iOk|;r
zn=@)l*xFuXVL%8BqdwB%oxMnW+Al)$gk_?K+gn!R=88OWYYfVvM~=hW*;+4JU;m8V
zJhk5UHW;YR3he!m;B33RUaeADNoq<elw`DgE7EqBVyLzal3sEKQ<j-nFIvfHp3g9}
ziqTwNMppAAi%^m@jf+DF7YX8c+>LnG5Humb($ben7qgZeGo8z5BmR)`aam!^Sg81e
zy1=KGAAkAq>w031Gavr&!>?(hoP3k{5CmIRP;2+>MT^RJeNl|!GGUrCBK@-Hm6V^)
z%wDzZCRr8=i6yj2i3c=})aK@Xo-UlGy}@~K)Se_9)vNlI`lOL>tfv|4H%VLLax3gc
z?7UWU$-+K?)&<2Z<zS;`Km1^C{H%P!y}4HRGHa0PLy@iegRxbA&{xj098oL?#|Mh6
zmsD65CPa2r{tY0~29x`Tiv6-eK#cl)!XPi#AR)SwJF{cU{I7*w^CPsol!SXc?uF+;
zlo*WD*qAc!cYWy#e2>-L0R<~?4m+K0D!Kf*{1jZ(SCN!tp&EN>Q9upgC>&kRt`@v|
z-Fd#ajGn#ms3)3-voRR$q&{sTL9nHn(WhtOO*HB)n(=po$l9%Z3Y@jI!AM|2%;Tv|
zA(J;dXfWD*&e<icck7uad+57Gl?2y0MMN~3hdZgqAHk%9wDu#$X2$k<1e{w<U9Rj@
z*Io>}2b#k{I3Rj0qQGFZo__0MCj24OGIN#_%_xP*TVd&+J}Z>r7Vn2NCgX^4)5*;v
z1~iQb1MZ7Nj!7i7k6=+1^J65`C23?W9wP{nib9cvGl-)Bl?C9l5X}<cDtc8bj6!m#
zAD(PZD^?B^Jd&^W?oOlLn#rT4_fvjb=eP9dZ0FD1%7u5vf}KsfdbMq>WNE{_p7Cr`
z>nwI{J>frWM}!U0q5?L$td>cNYVz-~@@CSwa5>D8$v`OViV@s+vOwCHk519M<P1&;
zllLqPePA*W628R-Dr#1GsFsZ6A*mCfM{TF>Q@?Z4$8xg6DBTKNRiN4ipK)y<z=At!
zzus_sCo_d9-ohLsm6r80x6MLyWwCIetC)WGoxQ$G_Z~O=to^5(CMgJ0(B9T{G+|v-
zwt|d22hROWeq8hlwiyJ-_E>g0^BJ#ZI2z9{uXJYI*a-*0B(}^O_5iGVUe1X1$#dFA
zg=0v@{(D{^k-_hzTBihxG=f$)F`|o>qlC!n0i_mRn|-XuFQ+*T;1dd+2AuGDjUEIN
zW<8UvnSHfV%Oq*V$@~eT9t@nvkIU)IiX*YQXFEbKra&=l=+|`A)Dc0qxeIZzjwL}X
zoBUu2u{=vG3nf@?+3jYu3isDC58usRsmY#u=KO#6E}VWOCH2vdg|L)Wa0?b;U!CDz
zcH*-^tdoXi21jb%M@uzQlQ5!XIQke($5{yhKtf@^is&Kx0vY!-?lP9Vmm_?e(Uet4
z^ao>Lok$rsT4w5zVoUJ?u4HfAH0_v66m?<NpUrtn!<N<W676L5OW)G393{U#iFykS
zGF-l8PBkEP6``C@(ugKnwn*xb5)IhhgM^`=<6p%&^o}a|%(;vb+lQ$!UXfUA`tvF8
ze0<Bbe;!huU236yU(}b{HFj-h14FZmI~xaH`VvK{XL_XK@>NP)g`ITzu0jW<hJlso
z*Ggzhzw+qWhQ#nUyt^#*tjkW-8AhYB<KaKs_)o>hf4AgYU%swXxdCsSBnxorCOIRb
z9MC)0QW=Z&u}KPmF;xq=YC<yGyg(`2q^r$M#jzDLL=PLrAs~Vbf2<`L#&;w3Pp3ZT
zN*aU-ACW;si>F%k8Wsqgx+t^|)jX?_h?Hsej*|)N4Aa&cP?baLk<J~;`GWVBQ4~QS
zi*#buEu=)BQl-QRg=x=-Wdplci5;AI+bVoqymfl&INE}meK}^ru?LhF>f8*mNG8*n
z%9KtGT4!YfE&YNEQ0*=C+Zx4gekaeBop;A4FL%{tPnu_njZ*J4_bvkP-Zg$|o>MuH
zi`JSvY#TUK<IbI2T`6W=tf($C&TxN<x4&y1wwf=FcaIte=8fz2Ti%^F&R(k~1>;%7
z;5HX9IDLtwxTN8EWkZOvdA}_Wu!MKNs*^DY(Nhbw=|WhtUcYq<PRkO?nwr46sA>e{
zqr0C(hk0_o5;n}|=Nq+=i#R&{<dtwsqg|v7J=(}*?am!AbGnklMT|Ci^@erQ)R9q#
z%~?Yt9^~(yz_7{;XT6L9g8CS$Q)zc3F1Lm3+dhKo-_%J?K3y{#?f2iUbMTCKTw1`-
zSiZi=b5B+dh=V4IU)Fr`btEJGMWMXw{IEojbFydBx-wGpyU&mPNJ`Xkg7`s5Izqz7
zWp_YZ7>J|PV1f#S+hpHr)@f}jF>rJ&f3c~$Zg)e=S-6_t6iALXCH}N{Og{@nWId#W
zyJSw{AF03oc}A>1a%?jzT5fKpO--)|eP$JAkvdEqxP13LLRq@F!f^QYWqsfEmLyQh
z--+~6suQO~!P!5>MDgFqu(X1Dp5;PoG^fqX@n2+5R(+f|UpE%=qk9j4thl*C)gB)d
zf>Z1rk1IzwS7xhTtJPhTugdCDf7M*#{B7#O265szJ#8Exs3C4jOz2_<YTC+`&v)|~
zrby25I~m;VQc{bfaJ1Gf-*4w#-}!H_+stOmcn$4Yy$&XrQ*FKA+r9bVdLLj7)ucp=
zY{x`u6PoRR{9vo71+=r7(uefTR@7bbNV3k&`v%U(%pQ4hyYyLG$$a)#rzCu|<UDao
zMrSCkFe-Hl7LDmh9U}U_%yp8)qw#{SYTQeo_yxmI<L9GZ%AD2(<1wN}jt|`<HRKe~
zj1=?Ntif<oziM5PHX{KM3DD0|y5Dt|?&2wAX3S5lIAv~|VpR7nEsIi{N|ai0fwQ7l
zF#?9*FL7B=a%Dtff~6(p{ZfD>4Q)>2jj1m0FeJQ(hVlwpcT;e@l($L!hvT8ue@QRj
zWKb{v#*kj;>1>S8)PHS|Z*yh=bzrvP)eVx0h=lV+P8KDT>k-Jy=vh<WQUYB{`pFW*
zxn+2SG>_OER6^>+5@{VJsfCTUJa0ATM@oa|YMX%cD5YXz3Z@H;XY;u;NtaqoVm11x
zaZ}>0Sz^0INnJ3d0-avXd!Lu&j8_EQ`Mxy8x>U7BFf%Q(p-nW8>}RuaDsG6H&|3Vm
zRaH0fY^;B`A{aGFtGFy<qO3xDlUr<11s-8dzd-xo_227d-WfK4G<gW)(2wA+^|IPF
zcJo!yWyRx8ICl!hYd&2g>eA#4r#x!x9x$XX**#CJ&67MTYf%WIrAe=s4cU{23R|ni
z(u-1d1oyT|T<^0~!u5NS@@M0ENu8pocgf#HMfj)_MEFYFn$@`k(>AToGUh0|F?W?m
zmC(l)9%FP({H>4ds0O-&&wD0sf7r`@Cw@?qAtzz)_`cgsW$=)PiazXiDIvxvgEr9*
zEdGu%0As5ye3qL8#7n69w)q}`dTezj6j*oGrd)|_UADHQ<oFUR#oD{eX?GMi>ao9o
zlW3@A!-gWOWs-j_iB}o1v1&A)nqt~yD;ixs)Q@E{+p^Jq#*y7xn<K@Jg6vceq|(uD
zp(-M5h9B#f>h4l6=5lU>f#rH7ilk?n^}|_IwHxJW9(+_B|NcJ4i(aJN?W(OlV@ZVw
zish8DYZg_LWDuO;o;(>=1P}FO=LfS2APmNoSylJ5mOmkd<zI{nLQJ`v=ey>+WUoJS
zx@mM!!68`X^!$<Od!qX;JV9M`NKq&xd#Z}hZZcPjMPBO~CU+1j-ZBg&L$YBA>@u==
zQW<V%r#Br>xFQQh;Fiq+!Hpg=K*h>Wfbyn^Q3}VXM=7oDPyxqk%pqq;B+jOM#K;Ou
z)M88uba6SRE=Y)=R|86;M$COi+S-V~Ft%BCq67m<y=h3tG*nt&410=MzqNwhh+;Ze
zxpmHT$O)#UB7^wW$Uwsh<f6-w6f+z?EI9PYk|?270ukXl@DOcM8=ZR|jk#2-l8VAx
zrHIA__k_fbr!I=3t-lZ*y#C-Ha`C4CRH@72xp6P2ztE<tWDlE1vgST&qLzrU_=;@^
z%?n(~Ae$cGP-zp)g!Rg4(#M)nn97Z`)w3o|;UZ<~gEwF7e6KU*f1e4}6E`VsHNDNU
z-O;Xl=p2cm70H#DS?T>i=7O@*Q$y;K+#KFc24hYOl<i56nm0e0N;3)5(s%^k#_XCS
z)}QSwDB6$7R^%;qm%S$R4|4zM=Qp~YoyA`tak1rO1)e$I>4l_~=Z&0!BX&C!Yoedn
ze12u>E$JV?fV-U{+c5KF$`>F@M*LCj*n*aLm(s*-?@&<@m7Rr;CNBYpmBL;O0p`^N
z>Mln?`uQXG2_~+(9hvf&`Nqj__C;yT`VPx82rW)5?V|K9yZiXan=`iaIqfI9J>cjp
zLZ<HW#fi*#-&yYX_$rVcn7Y1G=v{TRp%YJ&(0h|Kqd*i;XRF^28S$f)He0tgFOq{y
zY3StK>)7NZa+yjiEA}#+4`$J1V7(VNkT}W}M+>L8L&nJ%Cs%iI)D1XKt2JJEduKi?
z7<_i<5?DTuL+ubBT@FI)_9>%5%%Si4>r*mEPdGmu;~$80lK+pofndpHeksi)V=`t}
zdeUb}Z80R%;2au6Au|bbCiWEz?-h}s-;kLGUZmEVVNro?Q?LX9&Nj(Qlw>H%rRzAK
z-X*)Tg)W!WPjL!vu58GbRy3`wtgFT8;KEXTjq6xs<U%RJ2NuD*NNo;@F28d!K=kCo
zvo6$1L07wSD)``lIx@U}ZOD)bfJ=uBmFXL`T@r4V&dG)IZj_VMIZ5^xpQlj0r<X9r
z4ZiJ|<;iRqWf~LskqaVASXjnwtjGDx3a~2zw)3dfbXF|1q)iu^I`O?#x)=ROc5btc
zGN1$*mtGe$aM@P;b-|?NAvyr5M_Q;pISRSbb1+dN6LF%44<D+v=nMTaYiBYd^op24
z*|{V$#5W@Hu+UBGLA%*rJua{kOW?-H<bBHZm&yE_mt6Hx$%Z59&q=|gPVrY}g|ny3
zc7QC5O-n{&Rb8YH?ultjJ;Mb#MY~e!65kdH8)xlloXY8`Zu2uM9v}fuSWhvpRlQ9V
zE6DIkdP%}4zaSEkH`8dQ`?q{jpUrEWRhdnCV6h%qW^{2cg+Bh0n8v~>&<--xFNnX1
z)02o7&0@)@;>@Vx9LRt}(_(WS*ou3h_`5`8)4fn2z3y+)UC)cRpW8{ds1w;IS=4Kh
zBwKW1Vsm8fIaT(tl6UHZ^^Ssl32Le>XXZwst4G~BiYw~$T5AbT+m;xcr;q4kHUtC_
z=YV->R}hQU6$cc}oGbg8=+PV_)7s~QM8~Alo4UdfD@7vlh)TQ}tCzM~;ErP%lif3&
zagVJkIz1`I(94K!X?7uPa(U*$d@3{)E3^&as$FxmI~bsPVf=3pw6H&Iui2mDMgJ<f
z=f9&sVNiin$vA{jmXQlerbY?O*hY3u0G6ObmggijF8yp+mp_BMjjfsYxRs@X7jKCa
zlM*!!())irfd7MostgY-?mA&i`IKkaK#Lii)j>JaS&=N3Fw(F1D(1>7ig0o)jee}p
zHv{WuIROr5I+a;)k?2Lhu<m$r$A+z>y}j`AXhsdzS}>Pm?xo&^(G>}GnRGo&4Jje3
zTUwveiOXaFHED5d2`ym~>G<oVLK<se)}!k=E?|IH$0z5_{RTy5$TyoZ(@o5@L^*nj
z&n{(1__k-K^fD`8Y8KGr_CQiXr2WmpJn?qg??UGZ?!B;QqB<T*NC&6cW-X1=O3{@x
z45rtX2|adFegu6rMKgUN!CIZPU=+T-osP$|@ChP87#6L~^VS$qkUlmaaksrON4To(
zJ&&~^h%LFcB)q`kvwFqrWlmG^t0b2ZlHFKVfN$6cmi7pt5#@+U`)-mwhZf0hD|G6l
zaxO0MrsiEd5(kvu0%20i-FcK=Q)7pHNLvE&Kv&_A=+5p7@-#}pdadQ@T>M#l#h<Ji
zZ`T*#Pl(^{bE5vGOAII0SE@LlE}(15(B~L^@gSDM1r|sctHTA-nH|fLpUWgF1cXKx
zX41u9Z1gX)ifIxo&Y@2%Gd$5jSj-8?RH-G-q@OX3wt0MbqBg>8GM~X}hb!PA46Xff
zTPfO#J6=7p0=ryJ!xM6bLmhVZkt4<A{@_l@EE!BK7hjTGN%zHdaHKAjl*vh1l1+*q
zlzh!fg;Ft8-Vospt)tzy4FV_G@~Rm;G1c$!`1gji+MlSy)KW%fGX@^4k@5(%6w_;R
za$kB>*<_K_oj{(fN^Mws&VOt0VqEBf9Xy=nUCgS0jHplMv$48;$m~XbpV;KWMGjmm
zbEmmm$bihUn8~$^@Rm-fvm5tlOdLY1-b7*}MR`!AK-@4WM4`Td-6>un8-392j;G|)
z8{C<g^9`pUiM)kVFB&_!2swc&O(N@yhWv{6$`)<xU9{dy^q5H=m9|<+zCKxu^mif>
zaNJswuK$4z%iwlYtwBegCC=MLHQ>|JPM7Nj7A;Aj&!-`qx7scOPro5Q(?Y**I(g(m
z%`c4!lQhQa--$NoZ1A2=*YHuii89})Vd<ndw&tj{#<k?s|89=w?<rl<fYPkT*NQT-
z{r<aNNiDc1sSpqWsfAW9Wf0Ah<c1=F7Hm92TMHk@DZ5eEA?*>s^z}Or=>&rjkYO~M
zJfhA}(p;TL&gh%Uu4rr0L<dVu1tk|GiPj0HEnzt&R3uMJE+R=7uLt^?%6G(banyyZ
zn+uM@<niwbm;ugswks!<XH<6&M1kNJu>_|VLnnhXJ~jde@x2!HbU`#5E;}|gIsnI_
z(abnGeYT4NPKg7^hfmQPmL7CQU1XgIS*q)uq_=bSMoDP9V8P6j>5E|5b9$TSAJsQT
zvgzosQBsdJlr5BXUAN5|Maox3i85Kq<niPiQ*eUVW6mya*PAfs3c^b24zuu#{B%?R
zOH^9#x<TiW;vgwX#Mox^CHCM-^&;(zOzS8N2{nss!rKPp@kEk#)9&t4KbCDB8t~8>
zWRh}=|GQ&8wvG-nGyS<Z1ue4Brvin|l(f^TEFECOIxUAr0n&5bYQzA$d1nE>PPgEy
zwfD5a=4w-c-8N%F7PpVlDvl@}e;OS~Uyql6&0lhYf%YVvM&q8@+0I|h7SA_&veYV;
zFG_dv?zp{ss19xNW|<;U7DLPruDCp%`6gG8j>$nMxjj*%oB~~%8w|66_UT#k<g9uA
z-r6W3^U$_t-8MkabPV0UO^3c<z-S{gqg!Ob@T5h$N?`75CXMJ^);z%d+DFafS8W8I
zGkx<ToebLJexF3C^gE1*`xylrlRT2@Dg2UrLBg(5VFqo|;0nw3o$j9P9vxA%&HLm1
zR(2DZJ(rooXOGZUb<&fbhQt+mHnh|3S-zH_w_N{5RM6oViK=amEhFM{>y3|#_>2zF
zSo$5m$0jJ1h&*|#mY-JMt`wPntWD{BFN+Sn-7c3<Fx5aqo(q=LjD!LvPcF_2p5_>!
zHu5;9U!cQA+K>#gR4d4bo9EyQqA@bfXiJz6^*T~nb$jtB)S+z*a?h-5W`XEy?YY#m
zOV~6YN@gDEb;;)gQ^Ek$R7M0wmsc}UM(v`;R1;UKA}49frx|xQX$60z@~_TPkWHO-
zl}g0n#3fpY`ZaI0L>;rVvC}vzQaAW~MC?nOu+1Ayz7ncKL4Bo+0L~hK%&cB(y=ROd
z9Ui3c3p2(?!YBA?F(2sXb3*6BDo$w~?q1)Toz6BzJo{yFHZi+p`7ZQu=f3AIt!<I<
z%V?4&Txc0cV;b3PjKLw276=u;tg^o%cIsWF^*ZZg+n<$cUXT$x->UfF7BtM=rUh-l
zUkko4vcsb9NO~yvj`)Q+M0puK<Lt;TTK1Z;Ra>eXj*BBX-CFnRXA!HMY9r^jh4S*<
zclmVZr)MXxPtF?$>l(H#rzcSk%x4R^FSq?9lrWalBz-0~j;u7^XBo?9N9m);ERG6J
zR`Iwj{-Wq(ys1U6S<A_n3s0p90OZ|*8b_vfp$5#W3;#O2OPfftL!##w8&UGcjRhI!
zQ)S0=BCjjdFcBj1D8*+JtAWnweXs!9WgY29Opj;@{Ccb?-3v9yo<dwxdbv`?CB{?C
zfksWArNCd!Q?au+f=bnIywB8P6FOsU`G${1UJ+HaU)?6ML^Z}D$fjj2JDhc|-csnk
z#WTz5b(xc$e4?vmVYO4$$&B$<ysKOhXq>V9a@8j*)wEp&r*LQKiX-=4D;j@VWa*Gm
zmvHb(8AHVaKA|7tx!(JXF>sj2WWe^5`n&mvPzj?_vHR0XY|}~^eAo&lWsG`ccGcnl
z`vuGwV*W{N?<Kx*xY`k0if6V_Stm`}ZS9_>5aYHxRw8>kVK<-yFdkX>AZ>00GKs^H
z1SbnWDo=*IYy^dX*^LFK9sw~&;SJ*`Q?Ph7GdODuAmhfWWLIb!*R!Z3S(=LA-WW}<
zjO&}=+SHRP4-uv}U_eQh?h(}hHb5iv@><@Y+for`0F3SnzQ%Tk81N-nMwx|$AL1=p
z2;VM37`1|a0w2g3;=Urxs1Utq9!lfRDOKxiN~IUgXJsK#Q7TUA^+2&YrGDl?M;YPE
zT;iacjqTG3U^3FkLIkXIp$~3L2_@Zh<+ZeL1oN=(bx1D(zm4z{Q-;Eg`-wGBBWA_3
z)MxF00~M@&YeyE^i6|w?P#+S|mJHQ&AyLxpPAH*^O|Gtd#X(hasl}L%oh^YYpHNS5
zxN?P39v6FNmkB8=LdM`)F_SM_)go<A&!0In3kGPGEalNj2`|&AEjPI(<E6wH{`&Xd
z9TDmsU4Uu|$10oO0xB05#0)CaG-eNHN?zrj3eFbau&BEVqTGZjDTHoRk`Q!kw^cV*
zJ0)z`l9^F~Y?6~ojASB@6$mGP<k*WjJZ4e<wJb%mlW!7bs~}VYDuT^3X&G}Y$Vu^_
zY;r8yKSqzQS<j=u85NNg;&H)W?kL+&_9tB*jnli+nyfEMtYz(F?a9<Xg=GX*1(V5M
zDX70%q}sJ@F;iD@myv0Pi3^ha7Niv^p2GX|eoaTMHXhx(JEq#kiKlo~&u-$WE%p$a
zjb#bNS<hHG?My0mG3AU$WROaWZi4a{7kGknc?HupxhL}2B-QgFb#*=_lj})8HTO8r
zT8&TrD;0D4mmP5XV3-{3mIrI4vP@RZl`mQfgaj^L4JD5Jzq%TfU-a{rLnkYNRfmIK
zr52abVi?R-S=Vbviv%r|EveP?7bfJ0lV6+fhGVPpBM(=p5#(dnIkt7-wDBZ_6#zYW
z>w1jp%V{joooMRx!hWEhcR1<YLq<S^w*e&&l-ja{Y7-o)1u0cOlW`nJlIp}Hr$Ulv
zBQlD0i1aap{E`QOvh<2ISh_NgYbOJ{3wYqQbrSA4=L9k^a7->D{YjNkk|gYBNq#I6
zKdJSl*03CZJ!>+x<GhTNE2CZGc^c4c8kx0@O1k+<UuTULS8X@ybIVz)Jbmh}XDgP)
zn*A@f0~DO6)$C1~t(vwT>uvt|4mB2=5)j1VDX(Wk$CjD7&3L}V3n^(>mO%S0gLf`|
z;4_~yAzCRekx<?iGmIhHW=M<7)Vj|Cm*F4D3;#VXK(Skro|QS?Y+kXQW=ni{t2hf5
zS@#!XHtzSXuaZzHX}2h;Ql`a{#7fz|7AIF)-BFnJMHX$i+@XBYIBuNLZfLw!A1#TS
zNQy=>gWnW`qEwD7nY(S@zK?A7wNAD(<S4Z9m;vNqW3<Z29TUnnF&*V%-K@Ujy}MJi
zN-81JUtcO{;LOkDD*N}vs;y>3vQ+{5JJ_0;uxpwi#^dX*7X_mht(#h4P;e*Loau94
zyy)jxm{fNKGE&C8D-gh<EmjuCbUb#zz;yM9Xd<vo4eTW=E4!VuwtJ&c&PT&>kKdcJ
z4O^ve#WzDw{QwiNoC-kHmRf5$o?KgOwH-N+$L5kA<Dtam1Tm%Yw)1UJiVr*2#*#y_
zJL>H-O(gzoHB)UKdYsidVJ;dEdN84EDD5(Vz@-~)7+E6WzSQk#J~ZFBW#_}r>PMA7
zlUIHoz}GxfnDxW>;?CJPF6Kk7h3t}1u_E3i_OMY|F0s~Am&OA}o3T0Lhq;>Kz--})
z63q$tNPRqXbbGaJn~aeh6CyX}xwfKDmYo;Ene&6{!2D?UyQW|UifJzamGE5Fsm5&T
z$)liBH0loKy(II4<k_-!uB76@DL`H=3%^jnH8U^&dOXv1@-1YWHcgsw<F`3Q^3#Jb
zK9yx5*Nd!Y81XM=&;IbkuLZG<R&SpX6`!hrWfL<M;%=B&YGDSwbiC(=cpQ;l7h&p2
zG&)jHTInYhNfbwUWXCA#esuQ*;OcLRC@It{>opcq{^K)An0j2(P?HJQ17{^lr3FaP
zC<XU}u(o9y3Em^z%mQmCEY1EzHAt~L{oNAmtl9X*P4xW8awaF5!rjcY=t5XSDtG6D
z^E6?dJCqE5)$?Iz-;ndNEI5TD(v5$(EX()d*UjgKxfU9At%h)A=*jEA6~UTV+D(CZ
z)%23F%=72#%OZT)eU0I2AvHOPQi?kZmP+t$sWU~M3<OW~q&6lW(V!n1?}P1I)<@?u
zoW+*0ATf<gbguoOjvLWQ%;GFSD@7IAqU-5<_HZzdulD%>XVSAG=}ii@Kn^WR_?h<s
z6D*i+xfA{cCHSoB>TC{*;&hxG%q|pKsPwDvhw=B$Fd7UZDFIg?zFRx&czmD^!{K<T
zk;A049~x;s`Dl#f!Rl#QO6wEBW#&#?S`W{k+2?jAiE5PZIrnIa@~QUZ0wHgSmDt~Y
z3B5BeK$l3Gc9V@w-v9#eDKnPPqz9O$qyJ6Re<tU;Rn^qk|AIlvu?e}&az*T8AR<z(
zB1u}{$K-A!69I#e*o<e+N7+;g6u6tolAsUNB4fr`WB=s%5DcnC6yT&*obO!<Ug>+!
z+>TayLM^>z5K#bF%g)Y>(8z4KU%Lcr8HBw{NuQ9Z5WsiTL&eqAd}mQ?UT6lBxxLs$
zr`dyTyED^n9usu$g}TC8Dd*e*s9r&fjG^fHVoOnqxY-iBdY2cz*S<J&bt*DXS}hB~
zL9yng`KS{1$ipa2%Vi>b;oQ(lpxmb{G-#Ad;`2yCj)cA0@=m(m&2&5oE)~s)Y3<TD
zPI(xsorBM^Kv=4f`r;Q7lm3wwos&z|!e7&c{f96@TVm*`TQnyq6w2ql^nLqTlDT~$
zeU4Lw_r%iBqJr<T4qi>Jg~o>B&85|PJ0ovQm%WMmP#>gWtMQX0JCw9RYWN;}D+WnL
zA(gDuGsL&d3Fe2xu_S}HAnPW;n2uZX1@BZobSH<&JER+!210c)P_$B)g88SEMWczR
ze5429T=Pnk54+bA6Ocn1YyA9ps%4mhSoJcG%<d_b0g$(MSwxzN@IUEYG6clPTS(Ng
z(twi;&y@r*B|XQ7RQr}pg=IY^-5ms!nW3eOi!)njh@rGC(VZ9$`T$#|V3vA6z78h3
zTGhQMVd>RaKgg-xP5kNl>$FUvPd;z^<O4JkTu(Ur$i+7cP^no^xKiJ`8H2d_z}V2Z
zyT9sRo@mmoQvSk$<OstSUC%3(zjzUj)EOg5FL@B!M6#8Tr-sl$mRY)-O4z_zcI})E
ztiEzB5%D%I0L^mf_kJqCl9PDEYr52nSv0<e*EkB+)N-Li!tt<4Xric;Yxc9IZ8H9J
zETi6j2Rfo!3u_F@F74!d;hEppi9s|O6kVU|ee(Ck-3kHk>lwb1z8&Xcbtj(QCmF78
zxfQe3$P4i{nJ+-?;}bQ+q-Q;}{Q%{=f%r0e#{k<)b|1~-x4TFAKAIzr{RgFxLr*`K
zn~{Fz0+?incMYlm&~8fQb<&;a+k>)}SgAFbh(w!*nwD)yfL2x`PID4{GHRSw(^4+m
z-1B*R9_Np@DnC-QbP|PZCyMU?T+r_JsYl9SFK*L&o|{a=_7^`(dd+<g(<iNPMuA1I
z!`T%JQTI-vOsr3n@n{_M-cWfz7N0)5+sq8VYS$S8Ebklps;9K)>G<xmwwB#(W>Y=d
z(8dG0M)}_q!X+JWRm9j~y_Lc1k(8z3bQWY@yJIu8sX7xI5B-Ydv}ktUlVA2!md5g^
z7<URETDonGZz6?qmhXTpCA3JW;X0|W0;;@N)_jEl`2a5)sJ+26TlNro!|619jSlzw
zmw@?MH=XU_V{v{yqDr?&O5{Y4?IY)@BP?Q)?QQ+hqHlh2m6-2DX^jAu-Px2lEnzzI
zPes3$B{PMdYzl^80QjIHXNnv0VM*OL=`(<QBi4514N$nt(+_fLWM?Cqg+s$k(@Zk+
zq7B4iJag!glspxy%W<Y|pfzrRx|ikT_pJ0K-zbqMOl`a{b*76o4I%^`K)Pm(I+`*Y
zlvDApllfF_c9FU>9dfZLD#|zsrm^v&r#p4V6IdoUQc4c$)v!p<A0a@DY)w%d&#kyy
z^pa@9%set|hos^SrWx-{q8NT73XM2bk!r!@GU@u%i*{CCv&2rD+^0_V2<wQNel(>c
zM1Ta#tg`6bYdv=HMJ+Gan`imGoZ;^}ZBMeT@;%UD-&o(U_L;TwC=5>hC-u2dl`mHQ
zE%z-Hl-_)@X6;dCAr{x*ezQEl8mT(%Nk8&I%9O5_Lvc#N_0P=RLhlo>T%KK)v+R=-
zoYBt)BL!!<_V$+5n_QmNJGL8z#`UGXo1#8X#$A;#HC;rxB(Ex^TvWt*c6&XlS9~5s
zgO#L`(2^4VNCM^-ad;WP7rizswd7y@1$}14l~kwq^0I;2@C#UvHiHr`VOEwIy<<y>
z&~q}PW9lZLH>J-e1)%X^OJ&KouTZ7)rC<lSO6K|M)E3`L+;^IP<uXG=>AcKY_QJH}
z02V?6=n#RS((cKnGPwI34wXt$s$Q)r&#byYHepUJ+|Y1*b87Cu=;O4MCuOu(+kKh3
z+J$AcQ?AL?Zs&sP+E_;Y;7bPJ?Av?no{L+PSoM>&SSCxI=B_)rR_P|`?=Q!*F)xUE
zLsl35qj<#%S8Mgf_|HOot%YD0S^o0*>=nr|(*G>WXD$mX3|aoi>VcLnWZmd8QUV(%
zLe>b00&Unfkt)6^?}sI*Kba~{Px2dmR(48%A8l-GIETCEyGPm(f7m=~IE}NjlQU-x
zPJnOYbw@S(`^c(ZeAYN<w%TtSXRYSRv6i*6y`P22HJP~`Bg)AW;L>rv?NQ&F>Wg}N
z{`|S~{kQS=rtPAJ-^Sd8)>VYW+i12{fsRsSRV~^(Xps@{X`hHfy)X=IMFEUL7a{9D
zqezZq|EVpZ&*W1nn@(0i^&hE^4nWECRBZv1AeBVt**L-ry<f9nFlqFZ!yL6u@C`oH
zDS|7OOWC%Pa`D0?$QgcR<=3)h^yZJMzph>$A{qPEuj^%j&Oj1)mJLr#A6cEU;$A~}
zE-J)2l!+i)xOn7{+hm8_rj7SVFXmQeF&8{!7T5kTwW#b!Sri#5#LfrsCd+y}M&x%2
zNo?@NSxfyQXJoP>)$H4fAK|@KXpSF+mjTy*RQrpuIE*|oNuce~-0OZeNxbe`Gwu1`
zlmM#bi<NEt-*J@+^3L6}NVzBe^cvkqb)D>Rlan1Tr+K>Ve@BYvQa2XR`#y@;X}>m+
z&1*SX3LY@DnFO<|e<Mvek3pA04mA<VKXI)CHI2<m@y0r~rsK$T;xHVN2021TaRy0E
z<?paNM?SyIS`=qJ6wmbMEeUe0ZE6(oN~==*%>U$t+2<KqSm+g&s8n>JmzFQw!c>%B
zw04x8Zj;h(EMG3u%vzy1z8Oz@|7MnAXYKuR0#JIs6$rpNfHeW=5B&P?Cx9d;{<6~x
zbmk@l7t=(jW)H31)OpJPNloAQn5a5E{w2?t#ItG$v+;Z|Fk&tP#Vc-xD(T0bCvbz*
z7wMB&+=g)K_TQ^fWq23$mJmZ?<p$x%tSVQkVb!mFc5&Qp9<*D{pBu%z;&m{Pd_e~A
z#qNHGUMo%)d!dKnusgZ4!Uk2dvL;}`OIKWZu-<}&&v9$3r8xlk<^R|3{!C`|^yaD-
zZLUWWTxV+LNJ&S^1E1P9kw%Siu0%=c7NiQJQLQ{1X>A@<B7Cg4Jm-V5w02R~JM)>{
z%S}l6jy_7dT)^enDh$w0Z$9cNwJUK-Xwv28|0hpLw!hUj5#q{M*+h2B|5lqQlQ#RF
zO=J<Im?8`e+C(4;6(Gso@k^c(j28KoEJ}J={Pc=(I*RD2ZVlC=i7|uxTV<@ZFNh>s
zY70r*J*-6XoUZ!o8b9pZ+`KVXIxn(2<PD`<k}QYvWa)LMu#d#JwMwK`lrdD<rZEnu
z;ObB&Qi*OMlQo6GeJM7R+C;`dSFnqI;b(u%KKq$F>MQK3WM@V9Y%8(sm2LRr{f4&B
z-eCDn_W2tvT|qa!-^_-vGFjMipqC}Ee&_l0E=ft!x(X=pUs3I|H#7jpn;Jo#VO;4e
zAl=q%B>7wYCg|l&^U1%BJ(1H^osjM@OVE^Mh+3&{@~yVAL(ysU3o+VwQ5ik4Bze%>
zKWB|Iy>~Q-2oGdeR=$*Oc8XYAsl`RyWC1jYK2t-9Nt0eHn>4HK3!Q*@Gny>dDy)XY
zQ*>?B=UI6tBX2K|YIJXH)mwT=Dl4mmdO*b6RvbHHhx1ozepph5CE+70533iB?!-<K
z8^g)+;T1mOJiQC!-$&ydffN0Lo)g1DY%C3G)apSc6I&zK7Lnq6v~&tw9!}XEJr2W^
zfm;<DK#GSAwJ84lov5c(pyp=@mTC$ee>11#uf7?LJ93ehzVhOmf#q#A3+DiPO`)OY
zOQ%p^X<2y+0@B~q*!+8@k!!xfzLjU%$us|iJ)0j`USa=C7P%rx^6gikiQzo|RH76N
z?H;NmFG^x6=&WCkqEDd}ZJ9BrQrsy;x+lRERu?u5yGa=aIVN6v<j)%K&YI^99&?g#
zUXL@Et%tOKUH*6)-b|xeQDwr*h(h@#-7}qV>SxVvXOa-b>zqP}Qw`bJL^XJm(ok|c
za$u9DK+v6zV@|_J>C@sT+L{1`b==q8m+g3aM0!4uj57JyRfOKfyn?eUyIKv;6i$3S
zgcBx_hO4HV@Q62f;ETdl%k;16j`^;UNjNR|xCEVMhN}eH-{zstCQsic2-R*d(};y$
z91bV5J4)tc78bU&Z>hR^%5G+W9o8hy@W+vAw1(n=>26A8dTqI~UNFSM%jye;TYTx!
z`18_4@%{W)r=$*M$$3I9gwp5Evsk>q#8(}`HwC4;4jRYr+pYbx=IMD$qQaXmiU^tG
zt0pHBii`@ZLK4{YoG_RU?sTL*S=MMbOFbru(^p@H{k~FhbWaj4kico^xpXa()mJQk
z5u{ct`?KVh`g1FnzgRP?_PN6;TE??R>*VNdqy6%vb$-12y3s0H!u&1p1qY$vDp`%L
z1vlNFBW%I_{8^MO7*G*ucaM)xE{^w$Y0K$y?F@+FkfN+?J||Epb1e{eU7krRVTfNn
z|DaBJv0<lH*KLs+M3QP+rH-=uNCUSlp~e(%T$BmG>NRaAC`><+%OZ5o{>+hE?MePe
zT`|4P=G1uyq*{1EA)+;Fu<K=e=#urQus;}@Qkjody~AXSB-fZl^;9pfgX#5de2PTK
z6f71?%EF!`Yvvd$s-sJh+(m1*2&a`1P#2ebExbfbP1hob>5_HJoz&931Ep0RWY;vm
zu50ApTwk1IB4>YD^&VaTj?1szpI$%R$sfflnFDbxSi&4Es%QnX6+FM*I_8G?Web>{
z#h0#M4k-6eSh)LEE&~Nyux=SRR?(`ZOX+^SHOmZ;8R@+XRy^)6U8fAR?q7erihyYg
zR;sAh<yTvaqH%n?K;|l5kj14qKYLY*;C=u4rCESZTd+C{YK(rh1zIqg&s(FVg-}0x
znHE6){`D)B0Mov+Fj@;1Dk;<Y)z&6?|K}}7wqopOuRsFa`_~XXM@KGc`*rEaYxf0o
zw5scV86DX%@NZx<Hmu5O{yAhU75Bz6&|tn)Gg-^S^%8N&Mgo0_%8>$>eQmv?keVrc
z(VwPfs<%H)O&enLCDcrzto{{RoCRXCY1xaat0v~Ap9Kbm>iszYC5fo1{%aWum~i*y
z1hh&YKQjg5GMym1sBJe`8+XVQA5!6BJIBT%D?-|5hHUJVI~2+L>}2PK*;LnQVM5A(
zoutRj^heFUkCWuBfmMYlwyO{&Sx|Y+Zh~B2+9(>&8QI>S6RuGY=%LdZJCc$<HRed_
z&1ZYF$|_np>h+`KW>7E7fr*wTQg2%sz+oC$&)ov4b<Jl1)jwZ;5v2ih->#~g6k2(b
z!LFCBk;BIGr59EjDELpkwDfPqxiPEj3#@k;xY+9KL!S6^9OPcskS?TaG9+|!S^K}n
zMlydU=ED1ho5IbcnV6u?EMs9(#puuNDdQ6T@3^Tl(6N;_RTgXY=WZu}!lW#wyz*6e
zS8)FT7?y5XxE;TIhh<3e?W#J6%%H3X_@%ohgZ%q9?;5nzZj(d~O~tHmdfLmuxTCII
z_}Y>BkstxOq^0;oR`pz&p_LZA6Ov=Ge7FFx|CxTObO_H9U$q6bOXWB!LeHgB3~3S&
z?5Ds%7EPRzweTsDsjF(rsievUo-r!;tC|rIsc;ZqA}rg;!}O*sfSxSgnoIj#yx~%i
zz<a1{*G5`ls}&4|;e>_qiT$(S&3}frjE(%KP#37nh4f89^or@5huwV!k*#x_Mgyjy
zBn9vI0&=FIiC>eP8PMbX<Rn|tD&)-C&%S`1VlP`v&WvH~^T}CY82d`(1pabI>RtVz
zi~QYFq3QVKyzvAYprmBfdA}k_>E4@%Cc`;jOejWIw!_CX3Jp`}jYEW}SvBR*Q0a+R
zIvM(88h(t%^LTJ)_e43-x#Vs^c-n(|siQNqcW62@Oht`-s9JFf*jQK6%_PT{aVtX2
z63sD%THqF@g3V{FkI4s9aCP4I?80;;U(i=RO~w~=lFj<?1zi-TN%(?(7RB~|L049&
z`IkOz^RmyIMk>_x3pz-LIetM0nfSgh?!hQ&U(!W3R;M`ItfF$9XFFsMLmsPebV)ov
zm0lA8ucm5>E>TW@Xf4(-8;O?9XR^}OFZaSe1*rklYmj<+c$Az~jh4>F+B)h5$0)RQ
z$yEhrr~#Yr9z5z=4R1cx{59s%LPU^gCUsoY6tDG2PEeV6E+KPf41@6{X%aU9#wSs}
zAdmVkU;o7}vSsI+<YKcFJhUm<kU76|@KI^3SDzTi#QEZ`J|*AEigO8`dAy?&X-PZB
zM4@XR{>z_JJ4K!&v#7mwbY?n`4L5-fd9^#&W3v);Wjh9toU^vwn3Qb{O6Qr5CoJq|
z-*(bIJ2*K$dY?ei3wpq+_j}9QbgA05Zqqn9%r!DO-EK@mHw@=!e3>d+EWbQSwy>@x
zVk#gmE(E3ip`G;2H{U!FSx0F?6x1iRB-X82G3be=W5&L`^oDa4O?j_%O$6V)1vqr+
zjaDdz;@yk$mr0QnU7<c#IakMza4PaJ?4h=;b3C3&B~#AMjWS6r;OO=wU+C}v=}VyX
z`gAo#_F*e?D`8T<&DHeie3`yXEy|BkfWRSX#rH}6xc4H;<QshqIen^XGarUlNf~Xq
zrlP3>YlfWZI!SY_t{fT^SH94h1ex55%7$QLO5tioAM2qqky>M?6U0%MQwV7LLeez8
z3WTx5!O)@{Er_JkpN$#9Z;wRHEF$@eI@OeXM-{H95(d%-1Y8les1Q!d_&=KlqZo|O
zDzIaUXsG6@2dY`2SfI5)obtb?WVr4u{QwD4D6hjUqFCtVAl6X-g*5G>>je=Anq|^P
z-BlBB_K$hnEvvV~r(u_vgW_hh@OI{GbWKWM&Om5~FC{5`t?wi{%gWGe(tcUB)Fk7b
zrAF8tr!vy)q?<_pshlmjz^Ux(5M#dNZ8<!_;<x5p=J&r{2Og)xkeYobt*-G))Dh-L
zeef0D0knsuf{KL3BtNNw+*WW|_S|KI)>czWv!q(`*iQZ-9jLch*SBJtvTCIeX@5MN
zC|=Zw22^W{XPam{O3}9Xmu8Du7aK9pj$$tq@-Q9})1d>Sl#0tS|B;Z1;+L|nw)FJ*
zwzb~5c-G0`;OW_FE+-T)-G29-{aoH)4$&YvmnfRmO_crv#UO%d?@Y<Wcl(N8QPEm*
zW^n4!ydhgZR#1scJyW7>SIXGSt-V2&syLvUGkz%Uv-zBoSt~*s*MP1{Z=HzZ+2+p!
zT{0Bb#f2dQ7NMuGvFod5cmHTJp4|=7_ii#;sp2-f87IYD%cdV>IG6h&p9$vAQ2FZ-
zng(0`QksjrL)E_akD7|{IIRW;Ll8$`5{O2k<(<fuxve{k?jK{VdCD2g+uLno^l^LK
zZ?m85`R3E4r}pe_5<W-xU+N9?Ii1Z?ci1a&y0*!@6VE#(x)~EWsdMLiPffqqmodVX
zl%f&S<vAJ0aU|j*r=-_%K%D4Bxq6av9S1T!oL{N)2kIO(Tjym;FFToVGHP;Q=s|Ts
zFiP$b%!)478Isj;=7i6@RdoPaK&HQKJDPFohNV~j;(Nbpg=8eQKt2Xit%AKxRxtCo
z54Yn@+JA=Ca%L;;I}wk+Y<nku8MVjtUMdWyTd>bTXnUulrjFj#{IO+DTy2k&lB5=h
zYnaG;kJMAgp;A&Pa`XJCwN^xT{6ZA}OVl5!Th+N}HQFbqjpJ79h`SfPQd;gj_zQ6{
zL&R^m)Ano-x4W}jlNDpX-8ehL@Kis}MjTUJLG^2!JU!MkfRCz2xlUlg$4{K}8<O?=
zMs=EfVR~_!Tt8(Ns`svaCllCwPOD5$DuN?Twt6z#&tHhveM_xN6|F`}6@XfZoYv`%
zjc#Ii2g{@)Gt=)}_9nLESc1tUdJh)c{+7$?Oy@~?Zwen~l_IHpNerHzj2&J75zrmQ
zS{^Ch!jPb06chX?e{#>X3~jR5EIhr&z#wv6!DydZ*{gR_jjiJ1sYaY;R(~obk|U{}
zmn%nX?QUm-Y5U9^61>io;-*Au&m3Lf+S(oT#in(%20<(s<`L>`KTTp5PL-<OK5d*e
zPY%+vTJrcadUax^-`6XW?30vB1if^-MdD8KU7BxFKYP)rXAw4<lrs>H<HmXWuzA)x
zZ|^ma58As22X<EN)T@;s@{Rsu^EoHo4@Sh%$CNX4E%~bZu;0scVjf%syKAV8J0ly&
zL1XXYMY*)8uD(rv$f$3MCZ#g*$8Z1U{N+$-hOnAZaC%4GZ&w!WY?rW|3n4Xpnvlq+
z#5%-6$`^1xHI}oskZC4UV+KvU;_J`SsvxD_Y0oda<@d>wlO$N;;g!u83+a+s)vq)5
zLOe+7P4O%Xp8gZ_$l<{Y?!%-qPIf$P`(!5Upm^xLU>2Z^)pfcFj$gPtn+4q~ZD|Y#
zMWard(`hBa2s71^gjthf|GHijB2+^kfUu{ZUiP8`!-+rhUHJzWB>2kNPt=xJK!Re)
z&}v_18F)Pppk-@f;1KV1c3ZorI>J7&l;sptdwi#qbZlCXbWC&P(|N~v<h0bk?JD=S
zp~5Oe@Oxr1;XEp`{g$xn$v>A}Pi%HQS<J2{OWE~gb#@H}<)6i|C;tqNJ^3Pz{W%j|
z%(QdNck-Fc_x@ol;lGnV$$uyJ@?W@%sHk@l6P>KiZzo^QZzo^CZzumketX}$z5>6^
zk>DPFtA?aa4S6)>u@Z^NlcB!vPNR-NjU;Y`(#vo#7?;??Njh~dE2l0WpI59Glf+U%
z!suhjuXwHG{os;v2`x0**^e&Jvs)K?lpbcUku@sOkCE<QHja)?+WRkekMo%@p-1wh
zzR@P9f8@F{mbxz23^xP>#712-kLa4QElg~d9jHm>Hwe-yNol?~8cqgxw!<TW&x6t&
zv4c9d20ZL9IOf(G8vRE9Bq-U;CAvQd1L(Rb{ZIV0;}NCNVal-il1<KOW1Fdwxu$ex
z<itw+N+~a7Brzilw9Q$#){C_%b)PKsJx~f<Lx&_Dq)44jiU%)nfj-Mv3uA|DXJkHG
z{DgQ-&tP0&?LN{$LxfXSihL<nH+rcIt3VV#A&tMX?lh5#s5_g({b!t@OJES}HLUWp
z>RMHz2AL4m9_*9JQTM=&w)6|g9o?e*7-XS5p<noWZ=IZiCZ35jU#EF|ctT0rhDZUd
zb}m^Xkn@v<#NSI64!#tE%du5-8jFbts3V$rD;O=bKuCfWIfvM;X7x<Yg`8*2mLLp-
ze>@1=AP1}##m(2Uy&`!o=MG`X@PvN_zQ9dCDOaDfX<izQ`eXId{xpoQ)@?Hb5lPGp
z8&$pG1agy5aXg<9G!DfYEkJq3oWtE~qBYekmziU`R>?IQo+(^S*;NSZ7$+c+(R|3C
zl${S2azqgl$3%06uDY=a)-o8RhdrJqW-&RjI=d_#RDOG6T%kV`c({D2Uy;tX-;csU
zFG=R5rXQlfs3g+k+JxqaNKx-Q&3?#TZpxt>FZU=*cEe>7w`ZFeMw^qgh`3`>L9ZS|
zSvz<9-xT~`a$a(!Z-T1R6w8u7lc!rQ{e4Qs@~Y+UH06apTsZjyzt8!g_L2Tt{gp1B
zykOxar@LuIx$+=|h4C*ReoaTqOy{F^)O+&ObDgX3mbXg$JnKOP+J3O^Jb&hRbyiTQ
zzQk~{HYk^*hf=wolf@UrP314zX)YBtzwn28*>f{jS)tTwMmn30XjrDdvh+c>yj%2U
zn~p|SKR!8c?l;P%AEsevJf3OMJS$pR6gK<3D5&ZSX2~;McvagANG{@!gr!qQ{RvPt
z?h{J1UPf-=@>7P^J-7Xa1U<?<6HT5~s`ZDi`d_6?k3M^>e##FY=A4HMAr2W`F12s!
z*>9~agvtly8mr(@+>0)w+1lWjnw?@cy>!CTCS_*>0c{&fl+M^1WJ9Qb=pAZ$rS)Zd
zP|@;4^4kZqV(DvwS`XbT>hb$0->>gL*QL;x;$T2L_QMZ5S`JrzOvVwV7$qziW#=R_
zzxp(547YzI1GKza&HDSYc{c(=7QcN%9{&FC?)N;3(R|=2_BLcb69%!8GZ^5r@Xglf
zxvzrp^XH0Bb*%Ub`-e<EX8gQh)(q5_ODBMbKY#oSIR#Bdoq!cq+TJ@WuC?>SGiU2-
zEw{X%Ph)A-73as*C~ALt+30aiZI<!nE?#Blq?SCjWqG~rRsF2(vi#{ka^^-ZlpxBA
zj%U9zwQ~^qt_U+$f`C$Z2&I`(DK~)EyNP0sb63*!(irvBWlS>feA1$qkm9Pyz**dR
z1(!0TFD-SV-cWe;=%3{E1(hhiDXK(4Kc9PT3P0!nEWJ1jpw3@>5$2?}IHIsM3C(!&
zw5XtEPP*BuF1e<bzoAs#au?oL%fw2q9yAyzL13$5DhF*;T-S1Wq^C+!`ID#g@8z?p
zRI;)fJ&19X%9V;*a}n^9TReHEF?6Q;bc_0w6;}gKb;+ADQ(p#OKPv_+rq_~^pgxfr
z%tc2oHLhxATy`I7WYwH>Y6cWZ9+I~8h(4S})tKnVO3ps`p;9duc2bayV!=_eB*=U(
zi>1keVQZa=Ms@F#WJzcvtYNuLmwvLxaKWMxcX^VpYe7FNFB<o;c+tqVV9(sHkRkJ4
zZKe4^#rAR^E>abWdnoAO-$8liEHKeMd5Zt8umq2bm%#2!t;FNPmB^99ddhiLNP@NW
z$$4BZ%_k7dm45cu!bglD1stk<)I5IGZk_L*U$oj6r_Phleu#`Z_sI>I)?^xur_t<A
zZD{#z1&Y=(6wP#{s97uE3<)iDOKVHl3LL3uOun@CxZjUMb?Wfn6^6K7I7GWIHOlR!
zqqG{^CGgZ>x2^hj*+GlzudQRZdrzL~UkSka1w+sGxMb+L#ukmY7x<L5y-M5maz|CT
zH`{ttgEg4ZEUS*T8f`B5adr_Uaup2vOB-%#(^hND5Lfk34DdW6dnXeh$qYbp77b<^
zXU3%@otU1aM|4+eI_mjOm_*?|G<m+*l&#3!Avh_y>bar`UE*M0y_AKXzxW2Qt&|nk
zW*@mP7qh@zQ*uJ7zte8-0-547S*@Do(HLQa1jU;HIr{^3yoqNu&X0^I{5}q*qDW@d
zdTd212rhdw|19FS148R5&9i%zgaoBc`zZw@CuYBGob8>o8fig)HH5=65HHJUOZGfD
z^}Rj#jDHS}yT5@BdQmh%a^5_9WyApgS4Zv`ev?$a)Oc6D<&G@?WMT^@K|2B#lMK5_
z%s6jMGV9V_AC7yJIb^JNx4=AuI9QOwgq}(OfO-fo5hO1@n9b*+Eb@$EwQ}97RBubH
zV$M>TmuJi8m}5!DIHTeMaJqva8p?N_P>0Q_+1neA?EFzLoC3X|n$1T_XH?5aDDuvo
z@$?c^u)o>EWOreuiMtVIFq=k~m(;15=O0<(fFz1GLZy|7BUH%HCLb#W7i{7nOsB)s
z?o>Ht2qK1e+n$@585#@~Wo&!>!a<&%oxDCdZye+-n`?G-l>LOsS>8ORr(c{kTCIDY
z)=9)Mwr6>%$w)G$a}r}3?RUG)a~Wdu<anX#DK;Q>HIfZvD$&fT%zsW&gg)%qp2Msy
zgq<%*cxF0=64{FcU4TE-8*dQnob4$b=%5J>2Isn>yv~{;4-po@yHS1H4U^!>Y+nhI
zL3JkOnN_<;571fTfKCYv2OCzmWwx7un3|du@g8j}3O=gg&^cPqqav(jw3DA^qUX#C
zTQ!o4y2$Q?g$s|8I5<MBRr^~>*;v6Kle>;g?DG%$Y)U2L1zwYMOkOmUX!*7rqs805
z)qG8axHxOH_s@1)FHzmWIsv&y4QM7B9^x(g(;&Y3j47Gq985z=YJvF`;Z_pz7tLJ1
zhfqNP@i02S-{K4z7FQ^nIUhB44;p7hDc#71TPmlbG$|LR$@#ZnVd)$(66b<XiTWGf
zdF$=>LBte8*%i(~7ba(HVSlV(4G2YW6O7nNi*rk+)sK;q7gF(S^s`|z9uAVCepMGi
zBw{L11t!m%aQY7Cd&u^MC`a|pO)%}1Q7DbEM^>;sM<@rQyWD9up#?YU-TIg$p#m3s
zM@_Zo#EtJ2_?o_1{r*U;NfsVqt;EvjQikB;@xl0Jq?VKH%w`6~9az|f1(Nvlgb4T5
zB~Ac?R{Sdg+t})T(x>rccWHr%!vbWbqNNs1K5ukZ%c~CRY;!hV&VTZlry`jqb__@r
zvRB~rqJAIJemZsSih@p}(qx6f6tHBWjVen-iMFxrliz6SQ2I|!lN-O3I#O#nPEl+?
zTwl*dsTH1!!h1#%7^MLQuTA=tbXEsKK*=$-cmQr_3vgwNal&SVMJx#O{*2S~XAV;4
z3@y+!3(wIa!0i{GpH<Gz;&aoFZgF5XyHda}e{QlT<p8N1L?f2F09ZB+t`Xggbhu7P
z%W6xQS~C+10_5^9Q5cHPPf88e(vsrjzgvGdk4ZkyZ+D7NNIymDP42<_l?SVb-0ms1
z-7nal_Z(&|b+xgGINbMJYWc9=J1!l%ci#&oLG^+?Zjt7h^Z#XtlNVso^!I0Zs^25G
zr5%u3T8l=M@w|9jFIaZGEwk_kC&!IdS6z13z4T4l%b(q2>Hci;77=X`foXPMMBd(b
zRCw2Fo}q}Gf-n+hF%^4V7`$9|_@NEDh41tqlWFvkVhRk5aS`%Su~OYuV;KuVOC>@<
zP>IwBk4tr6#gl%+BOpvMhqR>QM2n-<HaDe92F$Cc?cn9j=bR+KL@1v%PLJNJH9k`c
zN3y`n@Sb!bsBOeCAi$FTNZ808!rG<aw0bKG;&YuWi7jNJ|C6Cu(jV$vX&P?3A$ZDh
zIuQ_Aq@r0YwNYcqmNdA_BUFo`>%V-3?_alz<BL|~V2yiOPkm(ivdE7mT)b@A%}UW`
z|Jkg$%}NZ(mOK|UY@D5)WUYA@#yaDak{le`$Wj8t$V3<z!(V~~Cp%5I8%`Ljqj!3~
zP(5&<d``-x)05*DrLreD?u<)6+xX~Y_n=Ab>#MZ~uO^=&10dkaT)?WWpmLt`Dv?w{
zch;t;g9L`mRbCYjhoD8d!C}E8RX3gMWsw3eL6|7A?7V6o9hsvpLS3>plSvp%V;GjR
z8aLrs)W_X`_>AHif#MYLor9d8#W<-9_4Y1W?~|n|iU!O{f&k?gwau&Gm|>e{2vO`_
zeYP-tNRkj>QLrujte#;c`$LgXG{zN*7B7m4;)#~l*B9#miy;lmvyj+7f8;*N2^3k9
zuM%=(oeSE}`D0;a9VNdTCA;mJJMB`8(%^nUhe~>Kgcgi8Njf`Dp<`#R6MdBQ${tw{
zB7I#N3uW$tJDqb3;s2Yr0)eE7HH(dXGVfri1YfBmmnL(Gvt-lX5J7(rof8eD)cW5|
z`2B#=H=3w7(jF_W>)2V9)Ba_-X}&4CX_EUW(wj*SFu#{{2uI*tkv&w8((qAE9I0dc
z)Uaf$=+u>FJ<7-c$t!8(B3+#+324)4DA)SIb-13}nu>R7Cx*#&*|)bS=VwY%NQsuM
z2Q5)uobb1t`G)!u;ZSae^nL~%?C{Jr!0VYVWwuc8ukArN()$*5#)nY()g&lGInQES
zP5n9?#ZUAayU(IYx$=x*ywzuj%Gi3As$Nm{o{2uhsh{+dHT|jTz<*|Gq~*H)%XYh1
zd1M&XjB%75sdy6($7)r}HcSnBe6HI2UVG-G$K({e0uO*X8{B^;%tuIO$W?Yq<x<(H
zl%4O)h)jyy;^>{ItV7}KtTy^#;_llSk?Mp)_S8n6hHRkhhFSJTJ2Ab>Nv7&#Dl|*$
zR4H_r)AsH-+?a>(i}!0b>43Jcan{`KAPh$H2@5F~Bi@nHbJ>Znqlvvc6O@VGQ<QwI
z%u%oeR1Xbj$s@OI2CaLrfq)on#U5+{ToA2%yH!lQS6wNEfa|?GGRN$WdS~-d^I&b^
zZJn!7RmPj#Upcl${;JyVO>I9LQiZl#zgn=W%#1SL$IO%UUyA@)$g>p{pl=o9QOrai
znOyd{7^c1}oyeFo(ek;@N{3o7gwK`S%)!VMeACqmi2D()-gKqup6$(mWyqPMd!gI6
zAY7f#I^SLN+iL>bsOwGld^jBs#qA|KvtT(ijij?8_~Q}_iOyFi<J<%$q9nEIilsb4
z)u{8KL_w+1!hsf?3Hsj6LqE#`UQ8H70z(?5^AKAJojHA^5IA3B5UW9pKz{Nl78DRC
zZh0ptgWlL^Z$PB6*v3bi4GBd(@}yN0mpyk>`6w8qstZOYbr_j8NOBM{B$^fVHwf6(
z(AN^8+IyT5AjNzZEop`;gH*+c*00YhGRw_D8O1I$9@po`HJa@y^yF<?Dsykk0yelo
zI@z13qs<wTyFFQ$-EGn6U=Yw0lscKs(e6N8Ik8Og^I_4u!c}Oi7G4)TjOd;S8-3Wy
zc8-DNQ8wx2)9Wj-Hpa=GSB-PbSby`4VM6z>X{j79j8>K4Y6PK5`ekvhGxjCX`k5kx
z&dIs#=?9sH6V%O(P9~0QwsQ1{!$TJ76NV?66;O=}p!T>1s*)6nk7O=vc5MLz<km8%
z^XXlZ9HXTqHp&|nM+;rg8T#J8D+~Kt0YI}Ten|{tNHCw41=I+QR+9N9ri89U?S~l?
zSi0TwMRnsAq%C@w6-H8je@)PkT25Vs&LC&<g_G&$^UL8aB(lk?(I2OYn}V}NG4Nn{
z^I}AP$U^AX(;|^9OXUTiv4skU{q77Z;2uPP{44_oq(K2VS*gft`dKXdpzQK^&?_ps
ze9ziTjUC+Lo0R!t8S`4w5u~e49obgMoXze^%Bn6dgO@6QS=gem;%drCUoKdj;=VM|
zQ_5*k5R)b|6$qVA7QcEi@y;lHhLofp_4Zi?*R`p&mbPd(i~3xEXIm!f8b{~JUaN8T
zwsBV0h_+(6L*`w+XO>e`R7(*?Kl^!XcwtSV0%owzR}|Zup!gRW_0?-cHI@Q0nWzz_
zdfB!Ts3&ZrCz;Yr&M7fGnv}$BzDe?THD}**Dysf`V5%;O*^@IM5f~aWZKBl$oQ*By
zEGb3}(3rl0yu!JpUjGU!XvW4#ABnrKyIySaq{POl+`f5}rnTmr^(df1Fcg5Lu`HZf
zEun6b(U~KFmH4AgRvK?;nLSN?7pOy=J82dSCk$Ngu!j~!q!?49JF=2W)7np_<4({?
zWeihK>7>zwl?=mSoJ6Xp^4XZ&eegT!$>q`~lV2zp(O0MmBeMr7m53MKPSkrjhJYsz
z2XW67^`R&YllO~e7w~G6O^ExWy{cwOrD0aF>F%DL?Y_@=8P)mbItSEttN1%5cNg~u
zANzubDqr$Yb>)XB=n+mYdz9<|lWkJcIcl<DDDM)VeWVVRVihyke}`en;6%08;&4Ea
zMLV_y$s;m@r5C0W=Ua8FQ}11794_cHOB6B`YdgER8g+_6ZGg0`>$-}iv2K4qjlM_b
zHO{E68G>Cut}`76y>6fr%N19M8&Ac4v0+S*oMbQU?xCF>sc-2O<9?>Ll+6t3v?L`P
z5*zzf5N86FkXz)5wAIukL$>*y#R2md?BZz)bTVw%#S?3|Z3{25gv)!8f-Yuvpynvr
z@j%wN-{#?*rQRvL7UhJ2(Bqt76$Tyvy>pq}Xl;32@6RgFM)PR$3njvBp3)I%A2p7D
zwJhqB;BKJSG}GdTid*%5)h@7fa#E?qloWqXnx)DXFEzLutM|eHuD>cSO2rBc1}@zn
zBw$$vk<Kg&`aafFWUiE`W#3rE8TSi|AV|@Z^pVjMPON49<XdZD#kQ{5G}8U?eMN@)
z=4m0S+3<`7)xNEd?J7vQmC0Esxnj;JoE`Sg$F12Ext$YNJ8~RTRud@)qFxJI_TfSM
z{G{DF*?-lhG99|QU&aiaEm)Bss~OpnxgsGz>d(SiCR;5@ov|qCv7HWiQU9q1R>uok
zqE*H_#|6`L{l1sB3&<?6sk<TvP}5rewCmM>8<)TBmFeF~MK71w@JBkdcDXO|%kYDE
z7Nzae4{Gjh37ZA0RZdUbDh16YV9X<*VJAo)LUeZC8zw5?5^WF4McMiztLhaFsK^Fj
z3bZcFwp)xtSq4p5T)62TK#5!wc8cBN)VgK8QFan$mPxIfKZ*CFP6~>%u=47p9sA_?
z6bDt3q*Wx>gga8XZFTU1=^X@$M2<)z3wz-}iSCL!GL8vnMH~#2r@o*<YbKcLK)vLo
zpSoV+HF`58-;}>K*QAei;csW77wwo&8&uX>eH8BKO5vpKt1r}D(hB-Xx$vY<JbZH%
z4Z^jxUMTI4l>$aJ#Vr}{AGyUZ(zxVhZ-asAEaU6VBP*V(n{z>!)DM-687cqt=F+Ea
z-n_74dQm}QUe&l@S+ioO;?SWjq9qc|y4oER#%B;~B2ltGpR&qKW<z4G>P71;OUnK;
z0xL0HBS0p*avG9dyjLLZf*F`{U`W%e)WNHfR01XGAEi`{$_chkmE%Nv<;d>oofSGG
zKGQ&F=p~RzF|AX88&eA&0IT4E6=AF1b~z1tTx&IBEk*KT=W?vx6!pRYN-YyV8K#B3
z%9cSjhs>5R7Y8gZ73b_)M&IPp{93|Y5pPP&tY5m<i=SR)uYVSA$$1X{R3{wvw!V=0
zwye4xxgGrfWAEMH+BlMh;qz<!S4`M<Z3zShoaCJ23wbcc4sS5{0N&iz4`+}@Ft*TW
zHIgyj`1{+xx^;JTPtQogb~f2JdUj(p>gh{$b#>j#d5corR?d?`wp;DIdW#hsj4AK4
zagnqnYN#W2TC0gq*{{{8w?^aaZC*?{{dQZ`+NS!*+?NtmIx5%torz74zyc61z!p<n
zHbRg|AnccM3WXi2J~C6*@nX6bzQjY9b9;j?aCf8sa=UsVKdR=spU?d>D2S!qk)yd(
zF!I1D)kx)((cW=9uSy_qcij3i_x)rlmF?HUj07}jQi&0FI1tmxFcSp&7s*5r^LlWd
zBW*Q$yR^ok+^s+G#`b)@eMp6V+jTHhQ07y&Q6ntL&+Fz^ROgZjeBLGO?oeiHJ_APF
zmlNx$iKSGuf0FCm9OKoNU&y$o4BG6oQCq>y`;qc3@uE7kUGk->2Qc!Eq}!*8LaH=@
zP2<4l9+pK}zs+O8`HoHCvm9m;SK24`u^f#Hm<u49D)Fb4nT>M1C!fhS@s`<*LbNmr
zzwS84YP|zjIDuSfh_;#esw%R{AivBf-ZlSx`$xE94ltnMbm#E-^X-Et$7{Cux9P)#
z>!Y(4^iohCm)T_j?8IwMyw09nsntm1^sb8W8-Ska#X_bvv<mWcczu;#>*Pm352wQ(
z4hZchk^{sEkk<Rt-V9a`Zt~K2I&iO0ct+t1DT!FNAC5|Pxr3-eBPrW!x2{ruY|FX+
zG=dgQ0Jayn2fH9OMp6rTDQ)<i5qE0s(g{}{P?NsOByVrYbF=6wMH-m*V-BuENDByV
zj91fg3P=<yNMQGlj@KGU<s!zD?d!^Aa_C~Y5!hRa8#7VzFx6<zeVrM?q%u0Yt~j0H
z!Ncc7gRaZ8cbQ{F3+l&ocMM29NXKl0FvEvs6R1E%(Vt{PKPp*jVpwD-DhNac7o4-K
zGjB+4Avs#a(wJ^s2b91D={rX@FPaOW70o2na<wOZt<5Ub_6+^1pD@ELnH4H=&Wge&
znAO!}o2{zoyoNCxvi42E?jPi;cajeyC(Xth+3dwnmp<Az2h5_GSg&QnkeReZcW_Os
z<gT=;<&`_sGpEhc$H3wv(;(QA`W~Dk4VO9DkUs2&s!K@ja)L1R<zG&)^Sbd?O}$aS
z!&n<-mP3+H=&p_vsrKj;c8D5VDPRT?%1Du-Ce=)bLHL`huIg7i+0tlI!L@~XVf@s_
z3&;3j|Ai<|jNr38u_gHdUp!AqW^YrBIAnAHlZ$bdC2%YDDD{Co0{)&vi`3e{Cj_U)
zj%uJ=O$T|rgS(qC&5splY%xW*G{cN|F$3jCty4?FZSPQcf^gkTStp~W+FZ8jkqV}_
zF*Xg2UD+o47DmPIJ;OTS$-`oVgnp~S0<*Up6{V9h<KzaDEZh2v<KpafvRrVeRysa^
z`^!BsX7Mk4F3fMn&}H?+7{_AGUC8$KfXAX5e5EQ#!>;@;uWkY8i&ohsIGn}cZMJ$L
z&R*q`m&TX(h(>_kuCo%zNRhYTD|OH|RuvBHI7@r|OO@Ezs?=qaQ#%S4NmldLWg%m;
zG|KhQJWXpo_~?1&qv{0XCNh)QJNj$W9NCb@-mZ3`3r-U`pXx-<v&lYS7XBaOAP&!7
z0~>>5aEucC;i_wfzJ#&~59wAg-?ox(zW(~&*S;7$=T?XXYmr^BzUv^5jQ!<Rpl!|T
z>2z{&iZ8@~UTwv&$AB&id%g?(ys6|qeIJ|lrlWA1@Z+7<jRn^?O3QMg_2CP%*N3fs
zgY_xnaE~LQcTrWxX316;7P@Bw1;*!7(y`z9E3$G$j088tMdL>T7TZY?&QN=Peeiu-
zBL2!|syM$Ax&#5Sc%$5-p1^vYDqK}NbVXw)tVFV99s8oU_bx^Uw`$4{9K(68m)1MW
z%8-1j?t2rigDofXXaFqz)&N}#S+o0{2(UjyZ_a14Z_Z~ox;b@KyHPp;W*EaTc{bca
zxf~8CM$^FQ2}Vf5w(bM!n<AMxS)M1|i!8iTOY%sd-&!(ICvvBDHoQ}6#(F#*yx9?_
zhHmUVg{JX$8gAHclO?zaDTDH`&^^gY0(P}-HPOqrlgzcC*tI?PiXxZsr(Y7>(~GVJ
zulB_k0k`$H@k<;Q^GTLMclmsasc-=C^%y3AXkFar<>vGDFX?&b9bE0R_M!0x|F-eh
zkK7jjj$U|qe6!zld31r-E{}elYk6fhG2{?LWul0k#L&!+d5OupCb{<hl)R6}s49e6
zx5!wAU#wd<g=Mt7XQVBx%WQmbc(8ll*g1d-46~&Nv)`gb*zo7kiF=pwE^<i096cQG
z?(goLuzt?<QBsO(PIEV3F9%P!kHe?16mKo4wdJ0Q{^_t-WMwwNaj-hh!-u8g=jh4H
z8SOga9B!wQ(0Go1UcPvO|L_&>`e9?AIH5{Ey{w;32NTtZvjHsmBD`N<8QBzmg4The
zTVQ&S5f*(NPEu=@rTg8Snt0fz<tN-ZYW7WCW+fSM#@Xd)a&4GGW+pDrloT#?@Eo@Q
zzcz3g9;+7IJb3pl1?;Ea1l1?l%9MwtvGFW7b?ff2c!Q`zn@t|Q&`|o4skvZG$C4&;
zk>1HMdNzPKK=fNxV^z_>`9`AsH?J6bP%QD3LX<A>+w`@wRFcZQ)6~IXV+Y0T4va@~
zyaN;A*0cn+K-8>&>-9CgZgs~sJs7i2*h$PH8t+24nFAJ$5EXmKOt41nEB5w`_ieKt
z=R>5#=jb!tIEYII9`DekRc-9VODY@h$B=Z`ig~&+nMxZw;}oj%bcbm~XLN=MLz}nb
z@Mve(Zc1Hm<l=W~wxJnq!z6HZ=u3f%r*HDXz`@V4f~+y2wkB8yo{cetQhHeLtZud+
zaGfj4okEtbrOuKO{^O*FyA<Co(edbK^U*IlV`8>gHD-%B2y@)tvG~x&+&%Y@);=B`
zYVLzNTe|bBILzj}NyD++u4Qy-T3&SxZC7&ZU^b@_aDX4HXsTJo!Dc|tDYa^RjJ{1;
zL0<Amt2W$>>x=C!PO^Bz^CSUb#zdo&2$EhdK7&s%yfd-QjdJGFpNVAUDjAot_c=sv
zGsjg*39ZY?s_E5YQxkJBbE3t~Ct55z(V8jLnBnK392KK`d?%^!fHRXHv$IOz>ocob
z+Du5I&3jdB;B$b|Q?gcU?bXBUo7ml{jjXp}l2pmfl=qlJ>(Gjn+<O$n!?^-(wTj~f
zK7I|jk67KJI9*!+WfoeSG?>N}qXx0!CCzG9BFQi~7s~84;5d=kp~av#oL-t@Mzcr6
z0F2}Oy{b}N#;?73M&(RW)@5bk;jPE}jb^~9nC65sH@?w0mhliL#5qR{E2`XR>`^+#
zEV+YKbhnuYz&Nsb>6Bh-9@k*|u$bh1iEKP&7CKCLQ-=uZ%~gIgO#ITI5{V4!zv~}e
z{Cud+p7lhhraH-D3*eVm&C3g~p=R*e%TS9kw5V*n<D!)(YgQ%hh{QK7!Yb6dAl?Xn
z^(?qT#_Y?>gIl$f(qh#%!Xl}~8?sGh<MGX|Dp?R3ycS$Zyj;w;HP2y=-+t5#=d>C{
zi^be%T&^c#%3d!tw0Y?x#zm20l?z!fG&H^^1+Z_%x^O`Fs;xym=jigDt6@Dax8hR$
zG!Y4_;+sh)NGc;2!Bv~YWKrHL$eMH`K)$7-lY=bn&0{sBQK_w*Ao+6hW247kh=1c(
z8u&N0i7{*4<=LRajja>LA-lt;=u(9hyR~m7I!<7=2aeavdl?nAGl9`bT5`@1ZG5R(
zTcR<9%GmNT@y_^&ydLE)dt_pr=Jw~1UR@CLZyzmfU%I<2Nil6|j_J_VotINw#v;us
zmo}BWkDq<o)O<M2su)*e80(C6=1K;&LpHN5(NOCE5x2+V^txg=wt=LKkywgv%2~hB
ziq&&LE*#4wDI8dmTB|0$msq1dthXn*s3e$8u#RJ#O(-bG15w@^><f32kho?GRiYN1
z>ilr*+^Q6I*GjwWtVCA2TVngJLmA`FWpL+dHtAmc4gIuQAv8MJq4sFw)Mj~%Hp^5y
zO9ueeY4^f_PqI3vlSEq@X$EYTMF{E5m&Z6!*ucN^vOY{n#eE$A&k?2*TCe%(;P8K5
z9v;1Xp0qX|K3s3tw%UGq@*TC=XnRq%d*%O-yme&imp2D`b9sX0X^BnAk8weIgRk@3
z<ibehvMuS9A8d>|#z*B84z)osQK-F6F0adM(D$kjjI(k&n0Vnb3^q3=UK-<4aDe36
zYBcu>&*yu}q3;6aSM-qe6t6Bi{PR=3sDka-#WRVjGDf=?;&YNCdnRO`9wz96()JTB
zx6N++8g7R{)d$sncz5n@u52{DjyN2?OgQN95x~TMKkyD0by+PpR_hE&8GXqOvWt?-
zCS3^1d)T;0Vj4Si(p&<TDsWQQE<E__FRx&3|Gc%d^SvC{hXOaG6I)B2TTA$s&Kqy@
z^k@%QKVL3^kLoU`T}}WXsut-^a#&#A7143HsK->Y6kVpTiKSPK(X$Djy{GUo)0eFi
zj}LUT1}ZTww~~kC{AyQnj49xg^FeWjp^)(v(3{!B@AH}K)AR*czfe!m#VQM#tJ_bW
z9IZb7X%(|p#X&BS%oKY(BB+p;ykqFp<>*s)8q3(o;+;QFhg_nk3jZOda>NcXS~e};
zNFKW+Js)QoCqcnbNz&Xopc(}pj=cZ!_&Wxg`JFOQI2aLTT*2mMR87za8T=1u%p0WW
z-NCeHDiaFQg(FJMSbU6;U8_6WJKr?}lx(qGPI0P3M`=|$s4k^s<+cKJ$%7o59YorN
zJBT}(Jj_RcX}Ce~k4%+i0QgRhDDk5tFn4kHXV<XX_i3jwJ{c)KO)NZfcS_UWsK9#!
z@BvG!(;Rt%aUdLD6jv&%EmeBM3|xXwVFCcv-?7&PMu3+bAI_n;_Lb6{;C!q$=lS8m
z-pL_Mie}@(i)n+KBE>hW!jzno-bZykRZ7j3U}i9a8xGH1^2k5!J&ByDy(eKxUzg(m
zn@dRdDmx7v>mx5Vaw%_D>O?^F>e23VIC*tQNDcwA7}{F5r8cY?VJls|*x%dPK5p1d
zw-Z*DFbOXMlIm^9(XJ3la%NTY!`xbCC$S@ebJwdtbt$D(co^w~`Zbs1d{d63N1A8y
zG<Ds*i!g|g`v^(4tLtWC%6w=959)pI`OE$7ligLMp)Zeilh)4B_VIVC+fVV_laJ`$
z;lZ!^p>@vu^}F5u7i~LwemNa*EQq@x#%Xzh;~<aabh%Zz?K`-gQKZ6Kx;f^na_!4%
z{F`6LX2_8arB1_J00+1!addFsz@rkRs_G2mN`Ou%zuai@v*vCniCV!dSu3*2dkw3U
zu<80jSiW@FF$>uYv*tevbL)n1oGGEt3p!)OizNSVe9ushrDz>=1Nb;G`kn58g}Sdo
zui1ebOjah&1vkQ3H0#i~hEV?7gEJ6A=cWqR=>LlXj~0MxX#`yQUj9(6vVA=5_p`A_
zs4#OVv#h5_FAq-lo}3=<{k*&26!TI_Pq4Y{?3(K-)ndTSc}cek%j(Z$TS6$y`!x-;
zAVKL_0^uT%DqPx^GcSD><#A_b)sQZo4PRFbr(`{p!-&}4vuoWCu@acBgOdwg+uSRh
zd<oMI_3}OyGn^>J$7O2s&*<J<Q^UUarOZe)ssW4#X0G@`LZ?m<Ivv6vh|E1xjc`m=
z@rtXgr~87Ys5fAt$q86uUno$*nye+eC>cAZARY2c2npR8)>b2@z7f1@vU*3CV5>PT
zEib7Fa!QcQiE%PHlkUb$!9x?ZY6^bgwC4UwR2^4I<%gUj>tw6*vbc2N%Yif*P6lX_
zu$iP>WKYqnor^G<CN6ivIQvIfMaS0q)TS3_XTT3@NMzF<DfOuB+@)j24+>#<NdlXT
z2caK)0{zVl0xfa*E+$`yvZBZLUUhD}if|^qZg}TM1N^I<eFdFa2z9C?e(}$jvBJ~g
zO)*}ex@JWm?)B_$DJH|ZR-PuidlSy@Uw)hHm99py(R<L-a!OFj-(rd@+{<sdgbMzt
zF_DPfeRax^VC4gpT6>(0aB!7gm!@V0lA)#brAj(MTaRgtUWU7EOeLijsdXOv)Onxz
zTVk<w!w1yg4DnJ|K@0QVqJ_fG!-z+;ZFCucMbpfuUaZ2QEU{eKKqsK*TB1E?+o_VN
zNCHNNQfzsYPQ7|Pe{HVkW&b9|k3HUIBXI5e^bnH;wG5qTyA!g|;Rxrj(95@L?81Jb
zq9cc5DW~IEwbfBT_?+acXTb9?CTg~TbxR~tcLWX{rpA61W&9ZKNg4X?MNHc$tO`<n
zYw{*^@dCSVzhQ>f*}kXNF7Ise%Q0KJj$LlKr0O+rL;T^NTtXK4z8If}VThA@wl2`D
zG|1RZ%z9*v?$)!#yUNGcFL<0*NC&Nz;@R%O?h!_7?*0vfUKU&|&}hTeQs^FVwQNDG
zTmD>1?$0RYGzmB%kOJ($SF5%!y&DJ9!GKPIO&g(L>Azy8z;!|9EC@2r^{rKN_BQ8o
zER2SB>afn(>k8W{fts|^g>c7kjP=M8w^IC}W#F3xEa`1H?vW0Sb3QGta$sKa)Y@r;
zI|h!!#2fy7{P*EfxU1o`K6n#!In|K8r??2jy;<lV%<bUt+2P?6c1<CFgM31kKT#(k
ze=p&T3r>+snd}$mUVX>icUgBzNu4QqgYX+5rCBTj`8ATrCWxHYSVgu51KXD85##po
z*GG|f#OU>>lLgU=<~%4STu&?t_2(t9N?6N(<P<b1aBY%t9+xXMme%aNsA`5~@dl0U
zY~#;Oq&umk90+2y6{bF;MD{fZQ8F8wbIAl3c&HeZLRomAuZ-wthhZ<>=0UtscwWgv
z3S5mJb3^=+C3eCAMv{_0CmX1~FqMWw|Mu!}_QWr=PX(!uknzX5haC~ek|zhp+-gdu
z8dUU5(l;P*4AQQryHUCa(j5^j$j~BXtD<THQ)cRjC(@!4QckL7boQ%E)pG2ONtw10
z`7nzKu&&#Jh=&LJKM{eY2fIf{v!QSH*p=f#_?v;81$42Ucwu}JN)laZh_&Q|>VZiK
zbkFflXMVRM%qo{&;YO{PRt0Ie1BBpmoPwhF^Koegg4Uk~b&oqVTQfmwQns{kJSRVQ
zv-;MCMs~(j*jT6oRUVE87wP3hE*9QZHP_j^7*1Ofvs98nE_iL!fMCXay&QaVi&|(d
zZ<4jx)c$*B8@)ZPwFTDW&T4==`n01@+!Ns8CK0dEdRgb@`#A5ub>EoluWsj@zu6*t
zXZORpYyMvM)ARqV_iBYLz0C^=shqr9bslYI&Lx*c|8mlD8H}nlcWLGD`{b{A#I;qf
zd^B@7=P+@+V-Jd@YHw1+nEd^+9&!5}S=LOt+AEXH=HQq)?^Wwr9G$%#)+eP3qPJ_@
zKdWkQH>*~L4%L$+1CjdtBBAsJ{>YxUV--OD8kFyn+yjBrOL(C-P9NP*L!6j*&A}Q0
ze!<8UI3%AC5C945<w+iQ*1yx)&B6(N@V@!eXDKs&iSp^lZhU`MRDPP;JZvO3PS~E@
zRK%KfaW_w(uKP`Iae-|;$mHy2Y>h01wxek=n@Xiv8SSg4(Vo?hHiLtvfVaksw0Hf~
z?&3a1oN+lFaWVia>dfs4fEgjk$F#xvuiRBDSD?SQO*~m`AtgO1^S&4zllDOT>gsqe
zs$3ovJITqv-ZSHRF=E}~a#Uc!`l8SBmy#FG$HjD1O1+uPv(Q_OjVDWBzb80}ZZWz(
zeUoJ)GRatvz$fy%67gNbHQ28w(C2vCMaRj|P|IOx!V#SgiZ11j4_T!LQMhmU?j;25
zpd;*_VcWW`Ce=wo`y+mk##3@kWIHw=z&{Vo34kvvD=`{A2P<SgbLqYF3NNTvPBBF`
z7y}U}KOYw4L@-<><0&fNSjbfysDZuR>$N;6b*%ag|EeYCF{75Po^C$N@c)gqw)RBz
zf82y0u>rX>D~E2sRU$22D^XZho2{*_`48{GdtAGyb`t(OjaIZE=tn@-hHf@B_IOcD
zE{w_i6ofMI<Jw3dGl*+UkwD43p+NXqBpgV;7k9(52m;3#Q>$5hZOz*;04h(tWF^_)
z>}x9<?7^H3`XRn9U{<M1-GiT4`kuPtIDY0H{1{UKwyUzA^}xdR9mzvy-w*n(T#mX+
zG-J6yS%)+_Sgz~^L`I=nsc{WIWfb8m?vv(YFs}4bu57|N8m1<CGeo?yf_ZxN4STMe
zHSIfo>i52!XY=txrkHvR(6b3V7eh2C>+k?SQC!fSTYS(zeyHqz7=2gv@(Mp)*Vb#A
z+tRw`F8#84E4Ot&QQ|c>?=Eimt0+`V#|=zb#r6Lont-;<KS0{epPE^NJN>mfOD-jM
zekmiKnoN^c4ug?o3{n(3*btlWnpuR`nnieBWfAID{@Th77;GRZ*2vU{d7>+BFwK+x
z^-&aeVk@DLh*JuQI5lw+RdkG7_nz{giEI{3^gfHk)?F|zO)im(DJ?Xig(hbiMdwVr
zz&w`yDSCO)+ObSz>698Z-BlAv%z<iAfV<4xzYWA~5Xx^4a#^ax>XioE$`Bk^Y|IPR
zY8<QiEJ)PD%uUhraiiDOZb#QxKXn_k|B^GKC;iI4)Z2RS6Y3sm)CgUkt=Ro%rS0+b
zOnkYIuZNTLolMrec1w?c%L%AWb!nD<7)wnviDWgUe>f!TjyV`fb4?nlO0(P!=zZJE
zSU}fs$vb<B%>F4=A8eUN#AqhHBKc?XcN&Tc^JM+fl=S)aS9J2$Up1!6^N!bD+jfQ@
zRB+Om(&mBsjeRk=Yb5U^l30}%UGPS$rQXuLksIw$7@~e5xam#D8&D5`j026KJG6|Y
zde-*(FwS#c3)A2O{QE(Y3#_;Oia-=@`-{Bss!|LH=Ra5Idmx#6SSE$cEQXhawSbXz
zmMBRdfJODxu0KlFJKnxq=WtW~!a(1P$Nx47kP#R^r;$**?akjCCWc*0(8M$Qcr%T@
zA!Qeq>dv>{#YP1f)rBJ-JM^)&5pEf@ik-40zIbd_?z(2Y-R10dqv^~x=+jzyDZ3Xx
z&NhI{zjWg1M9eP{IXt(~D5rTZ5*RS&*^eLJ5gheNpIdrVa_KMj2B!}EA8nx+VX5!`
zbuevehQ8_d|JrM6GM)~Hm{?l;mu9q<R;T}%X4C8xXwCWL0w&S?j<E2j9;ald?yui!
z1u7y%yi_c?-`D&UEX{9)Va)q9e^rc6udZ&ukmd8WJrPm5CZ-lY3ng;VvshGnBa}}P
zCsHQFK!ebfkXpUhbLC&m$FhNSp%3o$GV=O-=Ymj*0r=P6eY_hV{k80H&-j-(*}$KG
z!JUYila(2d0PC!834M#;Ab#x0Us=&=P#&<_ytx<)_u#y8tMA8@VY6DPBtwgf@{#P`
zVuU75gh~CicR4Z<30AOxOQED}9~?V!bhy83Vg}ce6L=z7IdV$h<;by34`VV2NaUU?
zN$*mNk)nF7!e$&5gRGX#m@8qFx9W)C5!czcMRfivXc*IIR!)3lUb`Cl@cENGHDu;>
zF1IrhI0c0xRdxq9jQvtE&#kSkRr$xJ0?acEDWt;bAcY&A>x_f={4DJOM@P?4SM)el
zwMs`tnG+v~f(vJ!;|$^e25aPEy2(pWT**iKpHzHL=oj?x8y8)27NjAQRjL0uO7pR+
z%x(2d_nP%g#KOR_LctDN8zvkJEw7^5%e0fhT%Ar4-dzh9k~tXoEK)J(o#Iqp6NF!u
zobCyQVZh*&qDlwFIcje(!5?}^tyNr~H5<osX(%v&)@Qq@t*R&NU5<|m-|Yd%_)zz>
z71|Z5<w{ppUcaiU{p01Ai_YzVUw0Wm6?N6ck44Pa4=TS!3opB)Xr~*ir2swZ4Z@Fg
z7#|m-^c?uGC-BlXzVm`!X;n;na+JJ$)iouLWwWYT(&yNv@TGsh?FqBMM|Nj%Sch5R
z=YX{T%D*3+{haro1j^CG_H%$b@*c$#UR2=BR|}JOAJzfwH2}AKLN6O$TS?4ho^MjH
znyV<Pk6Sv*f-G)*n;r`%PRY!&A$q*wy;GxB2Ix)684RFPf>gXF$<mPD!}*%{7@KLo
zt|Nagy?o3;-54}=T};O{+4^FtRYIT=z2(Ot0##wl=4;vw+UArj5d5I?Be`w@PUFpa
zQ!pPW%n$%$*z_d^P!AL9qCrU}@H+-fp?}_jOVi)1wr{Rt3pK5f(ea@3Z6Z-*^8J3`
zxPza?4_sX#hB?k${MA2?-Jiz}7PiCU#5jO<;{mLJ(PufAa}^M&Z}=OXPIT{;qStdA
zNZT6EU|C)j<KD-eLk%!nBRc{kS3mnV1PhlspBF3?|N0RBTk#zIc(7o%bzq@^e;crv
z0FpUiVnP}z5%<3XFDeWA6g=oSqwMjbTdRPxLKLZJseUDS2-3L(?!qQV5e`j5(rPY*
zOQfTC<I2vMnyWGd?Z!GLIkeSSr9b(lac9CezD-`QZUD|Mwqqg8B(G~ayhcD!bUJiz
zve}SRg;j3`z*8|?T-$-_BiIV89kc2Ol|iLK!UPtUaq4Hh@NL4gRQ`smx6A3z@cTG$
z1zYCyJCyN^l5F>Sq-7y>=Vdw?kyl57sgQMkd%ZtjlG3tQexF_M0Q&6|mmo|@c&*I7
zW8fXz8;3fuIlbwq<(3>ab%-NPO~2Kq#vQo{sGa!hALcxC{!(hZ9gJ6pD9DgEukn1C
z6)uCHB~MMt*$$-ZU=dM1!uPY@FW6znsnpDmsFf3M4y0zQq@i2ca2=Ib`J{W%k~Ut3
zc|d_=(=Q3x5E+ZHCnhTPuO<9%sT25h(AYQ0pyYpIy{>FT9pcY`KE8S2ujt;*SM(Vd
zHDg_$qw8usDSiTwiTl9~Vb%n#=5f86c;qv}hqv7n^xEJTWmW5Z4cs>t0FF&ymA?&!
zs38C*jNe)f@YK?QkDO(@k^lmHf61=e^UlZn{z9uYOEQ(B#z`M@EWCL6cz^HsJ9ACl
zm!yt1Q68{<{plbnhFp0EM2HM!J1W|hNZ~Is*4fmO94BGDxokjBhZBxY&jxvUA-79P
zR2G}@TNC((omrp9?{@e14^MZ#+de>e<wP*g@*c>iSS$#eKF+!+OcG<5F4DJN&TUy+
zM^cmas5k{Cp9`k1uTNSEW}*Xjk8WAat(LsWhdr;F)_oHcWGWtYT!FQ!?ePUKy3xxC
znYf4-a~u-U`oux}8@=GxNNGz!L>^826s~SfYt{Nd+K#7;0VrsHhah~;y;p+$gxd;Z
z(Sw7hT<tfkJ@8TN<Bp8Pp5_D8Tu^q|GX4s@gtj8&mrCZu%tBRt1yoOXl@z|M>>VjZ
zj#Y+8w1L!>C34l7Y=B-iNJnVda$Z2j-yv3>-NN6!HoK@hL)G)8;8rj<kobq>l{<IW
zL8*3UU$iAGT=q-i9yxI%DHn#~9|zFH41jFr=Yf|K>>kd^nLDu9OAlySm$WAXtPy}f
zhOL!Ys%7&o2rPav8j(`4PtnBKm3ES=RDGo+lLJ6h(-(Y@&Zr8Ydk0+p^JsVH5RTW*
z$?1#TqrJl?9ZFLSKmuZ5>5J;dl!O==jvqxV?))Mh2%FCK8&@I9+o5h(XZH+ifSWd_
zxEMx|#ASh=J%8PI4ep>vz&c8Yu)!xNCJ^=aR)*mZibv#z{@O|5I7qK4sn3w|{+hhL
za$~sLd)Zmcfew}^uUr8w@y3V)!aph?#<rq{%)6WI*+3;M9~JX-7AD6xbYveo+8Gom
z`545vJKNFQ=ljjv#V|h~o8eL{r)U2HWF8i(A9MC34|f8$)?FZc_KNlpT)k(9miyKq
z-*R%#9OD@3kLE!AQ4Q)Zi2JpjGp&<#6B5)cX8GR7qQR(&1}{fFlXdAB-Q5!OfLlv`
z$bd$|(ReGF+Rg2P5gODi@87SI$GwS3s7py-@!XnU0o_!e!r-~A>l1NaDLLgk{6s7b
zJGXGg2ZWx+IOLr&j{mNlm`*YR?o+>s?NL=Rxhm+pMqY9b=kXm2SxG*Hm}9Q3ts3_Q
zl?b~g6S9{`ne+q2fGYV?xIZObQ8hPR(*S$Cx0r}3%&eg!D=rlWtk_@`5SK{ljaW+R
zFik+M$K<1kj<QJtBe%*(jv)i1k}G+aIqU~7R;L>XTYIS!c}f*2EmWdJRy-Zetc)tl
zop+(DGZ!koKT7_;uwo&nT|E7M4?4tctY#B2E{{=86S(eT+!Kk1nHM%E*+ekkiY()b
zDID@a$8&lGlCDj92#1wKvCAwSmfTbhnoY%Wi&8EKP6H`VlXC#-kWb<m1w~h{!A=w}
z8KxbQqKIm-epg&&7&B*u2ub)OcRlBiK%Rk14xoVm{k+bnDU378@Nz!`-iMZ^YCTa+
zIV$lracWDN9yPaQMM^)#S@OgAIC7?P3l|2R4$J(UYb8$-tCwHzBt?+x-^H}f!cWEz
zmOUJ0wNm4^8sqJVTmw{>U$i#mfG69ba->FV^@Z><$h@&Yy-@soR#)?iS~*U;1)K~R
zPbaI^HAnohKz8d<5*7+ATwZ+c*Id)ba?|0Y++lW=hyi6m9PuwJ>MTs#6GfE6o6&9d
zrtiolj{38|*yMtDF~49%1!zb}ux_6a`ZE+dei+bk-LRPJdZ?lNb%*D0QQ}^KMo8d;
zQGm$D7Uom)Bhhsce`fR#@oGQJbD<6>V~Ka!B?2$su!rw460?(nQkYs|4NOIUI_z3!
zV&boLWx=W+JI`vb09-($zvNz#_OTX|;-I$CjSU#l2^>+X$gYZ~n=hkr{uUU|bf%Lu
zY^7<-Fw!h<vP|L%neto<ngr)@Ssp7A`6buHz_=@X%}<;s3^EIp)>yN;DqX@D^tRJP
z>~Ve?yqm5?nuPyNhuOQ4i$JzI1a++j+5;&S?&^n=Dr0C|V&Lk%GZ>g&P;b};>M}O*
z&H-^^`apI+aoL2PuF`8?@?YJe%u8_Ek9MEz9iL)#wVzJ6kB+u~q8b;gTegk^w7KU=
z@b<S~)?dZ@**iGdedaT|>aC5Mw~kMa;271swAnmV$i9-mgHn}5!4P$z?Wm^?0vNqG
zxOTI1bUJucwN+R6OtlF!Y;``LSO2azHPOrlfGlf@i#P+Vlx7-AnH0o-k<hSKlUEYS
zsM~#_y(~JCo+<QEDUL$NS9x-Hg)Q_NRGkdhP6{BwB_8azK);%rB$`m5(h5IIf8{zc
ztR6&T*kCYSQt?pHw<0i(wrg4b%&n_#5mip#)qi0Jmg=arFWH(=@xf{Z15%oTY%qM|
zC0S;Eu!BFARR6YQBB*U3bp_)jtr|(~0lRlAsOEJp9E?%95iO(|X0dYJ__nLQeVLB^
zIS)lRaixSO<NW+Q(`C;HNlh%im3+64zvp!NPm<Qg!-wl_|7M$UQ#LaA9b(iusB+<$
zu7w!l&lX!{-icTaLiJTWeO1<L^aevI@Rxg=%I%30)K1=}gP=~9UzwWr)>Zsg<~+o=
z0)00KYw1D+skBnE$!Tl6?H9er*Yz~LkuVcXXVE+Fi2FWiz8?gc$<mV4u>OgRoGGVu
z!;e>kZzG~#<8#gBw2V^S=AcnkJiJ76n{8#5Q(9lI(LEY1P_K(L-!JH@$cHhg0~%Gf
zsZn-ik;G;OtmtDRMy8t9U$$)jRbo&na5g`>Cl6x__3te=Bfa-PY&0wegUyno7%9kB
zN&!$AoQ?rev@{N%C1Oz>`^{!vZ32j2W3zaAye{jn*BVhod{5xIC6|iEfelG|o{rqC
zJJ#7~siqP_G-O$Wsm<j%ng?GKl}1yEHHV)j9*RkmA}hAa&hZJByTY_u?d03$k+Je?
zrM?(vPUh{jwKSamJ`hig4q~n#*BT48wN%?uHZvMJqxKG^VKTPVqVE;QN#5qE;~&C2
zXr4==A4;2FN^&UbzJ)(JDY1$5Te5VEQd8-P)y~7fK6{r>TL1mu7Fb>-LVNKL3w#GF
z@)2KsCm|Ce%5SWM8T4#bQ7M*$e2im3sWY2^`;IN`M;)QD+7vhuT`XLPQZ!YVc9-?q
zh>hgwsA?Ok=@@X_vZYYD+U|%8!&4}`W+-jVTK+2W@s{5=*=M*@RjzObQ)DZix=M!P
zCT;<#8ZCPz^ptOkeH+eQ{Pf0{9=`>V$Vy4p88rzS6kx!(bKPF0_8}3&JNZ#Tp=Jr5
z-cPHhyq$XJmO-T_<BNT$RvU`QhJo?B*BqetgOXFsp4GOsppH-LQ@|Z@aup8Ls$|S_
z&^Iz(RPknNO-45)wg@#FD?k~h$DQh8Ixe$;_+NPmsV%cbf|X{Vj7f4>Ty;D#2|Dbe
z`IF2WK*IW{WRl$2ES`C}g6#;Fyr3O}hp#YN%11u{iFYXlbtYoB-*^&gQdY)zaku~K
zjN;oro<7+<{^?-H!|CM!Nn&8v&VnH#+K7(;b8YAcjKev(Ednu_666=kgBToGSqK+!
zS4-&R0o?-MWdqCz?rBF=)`We*r+nBQlNc_Fz3Gq=KcngdbLhRzjF#TfewqMnP(BQ2
zx(D60IDNSERd)2ewQwn7q>29ODC?1-sBkMeNz00iz%Cu7S1mgL)8X5uBa`V0r6}`A
zkq_?E36L)Zh<mJpKzTCg$xQgTv2lkx_A<f<9++Pq#MSuB8f=&F?*s*7BM8qkdN1ol
z2DCO9$q|Al(3rMd&53j}p~54)#kPzF6|_?BHDl7plLRJ+T;&H$jdi;EPs9yEwKhgn
zxkFK3b5Trz=O8y4COcBnqUd8E{!F1grL}00Ikn87C$g9@BLK4w>d3Z9MdMj=ErGE%
z+qA5#2Y+{ke0{FL9-6tC2JdF~4~0{vEN)K4b3T?_d;Iq)E1n)GDsg#@Kj|k|IS84)
zNFOce9{hBfzB?t#qKvj4!iExX%UOngt*zoIC~LqG6b0bvAe&~(7<jeGEd+v0@P1|{
zGW~AH4Z6fmUS?}19f~yohwXUjavA-;6kS%0z(_2;no8gPT~)`?#OsGBTJDH!s4kiz
zxLL3gCBb|&ci2mu@o+79Du+(+a)PRtA$e$^^0XvxCrpz;nSx5=v4zT_?K7%%sA$Gn
zHn~EgAc)cWdi}4I&tAK5ZDXk%vM8b71kQL8*m8NZ*BW=*z~d&HY|oTAPxUvDZ`#M5
z=6AN-d8}61a0gXb0sXT*{xazI*|m>O9~RnGIxK$HV;t0O6I~tpSD*L1&L*8C%jvMa
z)$;0PQBF)BC}$T#dBfl)DFv}LN7ms$!$L~1<4ug$8s2rD*^n3Ske#Wc;`5bAC}f;(
zDt@sOD=P1$ho8Gck6W$u>qIB+56*IUjw|9~1*@7)G57n~a7*7h8mAQ1KDE9%{Qd5x
z;fvfx;ksLH%!k3Nzy6x&9|MOBx68qecguSwe^{PeP{a$vwvwiST5vW(Y9QPfcV!c_
zq2ZgHA`hQdnQ6m~VA@<DO&Fkqb|sE6Ns)t*@=Hg%KOF6y*mQrM;8jl8tvJI#&m_og
zfhi@*H`vqF1(3*5QI<JsVOng_2mV~F`gHer?y{&HA6gGN9EfW>-J-)uIW5N76;NPe
z-)UBT(K;c6KwfbqaXAyLKe;|o&$iMSeFvu>2d0aRe1?qpf`+{^Su$`uI7|)?c9$&2
z8F5NL1*DmedCj!JiP>NtAST#H3pGoC03f~Q<QU-;QxwC#7K|d^_hYW5i#?zwKZQN1
z3P*?oR4)9mUmyC?LEx0`CDaNh%cKt00wB2>PsYwH#cwf_hgEKkuSsC2VlBXhhVWI!
z;aomcrKT17xm$gl!HQc#-G>x>7Rc&ksnGMq4-NPzSvojW$wx1<%kJp9B}?fn;a+yW
zs!O^oT|~9!G@R?$w?kmx$`pZy=}yH8;T+ZW^pVnVAurG}?W3RPb;p7&O(x@XSf-4j
zAZ?@D5m}!ZN`%04oXO=SE#G)-jLSk3II341ULCnWP~0VFZ%n*(S!xF7h>l|BxyZ5;
zlxcLYojkGDCK3oGgLKk5o62>Ls$8+6YhRzXB{-(Dg#6fz?HZfH0*ytb7_NE&O`~x!
zDY^v*L0EH_>PjXO#w|J5BUE1%!#fiZO|?0mPdt-M8>%h>;+6HgCxkA}h%^zb;d*41
zala3<DUGMe5M95>t)7#qTJ&DnRAmnG6Q&DflG*{NpQYV5WST-V)Kay5jaBLS%l(tR
zrM6OUXlo0V#+D1noO_yeqXp(OF3d!5&$~Q1Y}#gq*xoS&?+>$XxvA%0Ip6S~V`q_5
z-{0FkI7!g?J~{d6#cuKtz0tN3I_iUKSFVw7YKp`|zXj$7HrM`ZZDX@z&d`N8v>O7E
zQ<70EeQ0PGviQ>>kO}-QM8swB5L=Mx4qq(GX=cq`GFfQ#HXY|Fuv+HL4m!*8oai8{
zUXak74}r{6p&B66RJ(vZ5<52Yu_o1~2U0;3?K6FGoHiC=96G>Qt^r@eSK59$SiEZ4
z#SfF+(q9j;4iWz4XNA3ywR=9Sa~oW-TF*j10(xkxHa?5%z#=aV(Vup(geG5(wQI8b
z*5T`HoW&L&KIhq-|4i=wxV!V2Xf3{l%&8L)Ceu;Xdx-dYGMe~qVZOx~TRfGY=ZoQJ
zRNgtyAtNK!I1oIlbs+d*d+!AQJUV&ccc5KPV@kmX@$rncWo4zwDECp8&c&^q4Z}^w
z*Q>S+bHt_o6WOHV`*O;uEULc3jA|!Hi>*v0;r~X<PqK_KkD_&RNJzY_4Ao%;JxP!E
zMFInUmYr{sORQ{rmN`d9+a1M30i$|Qs2b_)YY@0}5vv+&mQE&ELWNw^Q8pznb(+8r
znZ)KYmq_LUinYIk@w&p>nPOFVnXsRk6^Dh%q|k%PiW6p!sl^?+JJ7^IFBa&2Y^HI<
z=Nn7EzR$)5xl_1qlt5gS5%p2t>mQH@>3m1}E-k;C;=-Mioad1!P8hf;r_TM<7u}j-
zNi4lvcdW(JhE4od_Z;gtY8HqLvX6RNhX=g>R;z%%l!JUS8JGaL^THq5xxzJ_yN6CP
z4O>Yt!t!P%ez_m<t|HU->7W3asD~=xhCxFen|Q5u2SpddLZY5qX1*)lo8hNn4awbP
zV|{(ySKpE9po@*pru|<wzj+lzmC;Y9<JN7OTgS8vQ<vKgzIp}ozw`I?I}cQjH=x3B
zHCEm4n?cwJ!N9L|F5mhk)X+P8qQUMbdyXXx?_A@@5cLI&fWpN-I9%rE-o@cx+;W^f
zE#ijb4+bQz1FN1>`csK72g1YE^D<FQNrYoMI7h3<#U*pIz*m>ID%uEAA7C0JO~DUb
z(h=2E8DSE3ZS4pV=_F6~jwNlt?h`}a>BO>=$c34!3B<rTQ#I^D<@)%VquM!X0!Gqs
z$hWx%ylSzyMVu;-UcIMYl~8zYr@HvcILMqLZ^kaLG(9~DgaYlF6r;6Py)Zrx3nkmL
zS&gCxIIfdM6Z?9cmU)-bKsjr5;3#d==)5@mTgL|&ioLh2q6Nc-m8Y-|!HsnV2NfQz
zsxc^lz=s$Cy#4^$Cf9Ih1B-Pw09G01cMek5nS>GNy(}div6{NXI!jN^t*<Q9{4dD^
zC;@_hPRe2IkoJzKc+v&tGtD`u+RSO2jdOg%axqNm@C-dNxmQm!CS@`uVNSoy=n_u8
zZYQK_#n?Nx4)Vnav%wo#I~=;{;&xc=tsIE$OJoL(+XSbnf^|*07e+Uho*`vZ?9x@H
zCr+=B;vG(-a+Sh#(_HK%d6Qk6^S6o#e31Lcw@%IE*Z8M1*0PN_ca*CU8ZI6>$=>B4
z50BH)g~7c`%+Nm;za5kI%c3USV-jiQvUq7sB(}#5Oh{+M8ZU8~!)#N@RIBGL*J<?g
zl(+?RN3p_nqAQ@%$ZDr30v<KiZ0!pOAtGeIm=0;YyPo%xa(ZGiN~qCluh|nYEm?8+
z58RSgTiaEL7ermFKVHfD;H5J-Iygo?E+<R;QioQ8dEtnJ;xEdd1&c3Pwy(?SK50JX
z(_;L>6hdvWKA&SvQ)3k1uV*u2PM6CRS%<n`+i6o~LwNhF@$ED1PEw}E{}o<46{j@I
zceUX6wv^MdxQq-D{BTzJp&j0t@z+=5Z+rF)+t|bA@KCZfN<5bJS+aT{I#Nk1z<UhT
z4H3TWG11=4vEx(eYRjLz`YBKl;rdtEc_mFACTFI1m9e;XkcW#5V#e4~V`xxX6}v}f
zyj;0)xDv&<NNt)L_SSADOTMNbouA+&!PV9qNFb=`Ov*P&nqHAw(R-bhgHj<)V)R%R
zl$?n+pwx7Q48vNo&HY&#i02KiJ-j~8jBNwm=Z0btRQ`{266G8uj||o-2TgM_5{vli
zM{;YmZ#(ZD_mW?!%5ahv4Z@e(YG*53>)xvCK8AGildkn?&%No0wF@;=BSwAaR8z&N
zkkvH1YTxe>lZtLjOns)sFYB+`%T*6CuJ9M=aVoQxi%5IRA=P$CSZuMgxt;iIU?Ms%
z=y)tq*36j_MTx4BZdSZ#$67Ad=#Xl9Xk>5aiuz<Ie>zV%CNFbDeUh|5nPcG=&>0x*
zk;9$>cSV(~$m%=dk$Cd<{GoelH@tU)G?6+Y3uPb`>Df4u;ED`G4(%(I5LI&Zkc4Qg
z(gnJUfzBjG5#z+n4rhtrl2u+H<)P)H<;{HJ;&7(rG#!W(hLXWm=2E41$!&)HE?jph
z2n*wLBa>GG0OmOnd`iRp*ScyCv<{%2FW2l|bPBS2v$oq4U$-JX&)DI(?79^_ywR=<
zIkdEEWd#*9)cstpoMu9{1AShZZ?<ksE?u!u<LG%_4vbB;%&-?zV`;LY@OlC7$yv+%
z=xbBV+eWFf8ho5GlMlmXieetzn5GIV^FZNi_-1I6F+Kf|<`Yu$%+7YpEH%6OsmrD`
zPpmOFNFnRu;H(3s)mu3~c6`~zLRH+^(KhCl%+rPrGY71y!G9o!;@E*`5Dt+c--XV)
z4l4$8@6ILZ1l%gbiOi;AOgW~g=T`MLw+Upe%fC@2lhis)_C(+}N5K&#&yHrW`b)b+
zSlO4A^jQ>RZMD^2x)R(YV^L6b1}&M`-QV3g**iQqJ=uG{d-(FiC&wq+9%0@V=KA^G
zf%R#w?am{fV&zu49}BWDgRWV4W$Ihe%85RCjjT8Jk{5ioeO83_lsvZk39%Y*TSz*)
z>K)(*w#PK%Ta_6ukOs?^#Y}O=t1!D&Ascmx53R2rzF^h4URlpjA*?A@gBei<wqb()
z_+E9iuq?Vx6L7ru9C7#M(e5cl7N2fE#k3Fxm)f_&m4q?OhK%M5n1GL|d(H$}_j;|R
zat2)N9#Jo=OxIWGGSff;Djy}vbI2i%EYILYW3tUyd&&P`eAYyeow$6~>}{5pCJjvK
zySowsdIGdPIzZ>oDc15T9rrw^wW>)^W?Ii>&vOV?&x@j0h47q5AQJ6XpG?&ty$r@`
zz;Haxzl%G;i=)HmhbOyFd`A<pj`U9LhB=n!1~`52<WzjrP7e+b4|bb6YQ*j+6b=qg
z_I7q-2tE{e6n)r?Vwi>AJ*+ELQ2Nk-{niippg0`PaRg#+#MahKUa&eLoak{4;Ei&<
zZ?E(#gVI`bT0^Tj$QbE4ngp;P{!8v{dq_ZN$Orlmna;>nokAIf1xPD5P9=Z5j~sD{
z?w|ACKEa09T%<R?h<J*o!1JfSip<6yN1Va+)*5ec*;da9-0Z~<nJa!W&dzfZHdBxf
zhad}fldiaARSJA@9($&jrZ3o3?50b#H*9KKPEJTzXxL$tJd5!gil^WLn(!L?`YL~H
zWIEVJC}|4;3;X?yjHZ~B+6bA}I~WZ$xYTyl2RP>0Uq!2qisMyIWMA6!C~6z(C_+*p
z30ELktd5L`q{u;J0t!(UB6sA)#bg!OgoQ707P2%h;G}8O?Zow7(N3a4jLtmm5=E;_
zBpE1MqG;Euu?Mx%m$RwNq;oLa|BH@G)th=PIi{jr${*j|wn%#T6|0~=yY{bg5Nu0h
zFr<YUgcn1*Pb}AJyjMP&;(S7CGwa5$y?&lht&-j0oNi52O|5WsS4pg)uxBTH+*k=4
z%?>x)sV;I08iRpKXps-|5(De=*cJoM7+mpFhR0l{LLNrU1S(m7yk$HinXStuYdF!2
zCG>Kc4^s@PD<}*_EZ=s5Mk9#i7)BdqW0P@nSqYxa@w30Vf_SFx*YJ*{{iP}xPXSs7
zyR%flG5A(r2=RB$v{z<>o>EGcjH!ha0fy1CI4);kod=kPW9($PdAk#~(ZIAu#4==8
zF};nYA5{-nl_ID*i6D*loI}>-u3p%C`Q?iz_z#C<%<89+%l{Cnx|E{B)DS_*ihXQM
z$XUwnE?K{i9IWtS?vPntEO1L<*H=ks=%A^*WLOQRB}$AHjYRN8P$f=XBNSFWpZDx9
zeEx4h1N5uW1fDmc5BfV*wTK=6pyOt<k@r?3r^&os9pw*VBF!Aa+<ZPrqle83rQ9>)
z7K)^k)w4SJ+;$d`(-pY<7o21=XFY-smFVgOWR`~xr?E;NIwEiB(=yI3L9j$_OwNr-
z6Qf<n)6oc%vXcM7+ekQNGNrmhk^Fy#&*8{U#Nq`E-gC1sY==HIp4Q58{0F&l6&C12
zw0D4h;O)?yXBWE2)ww7nG(25K0d$fb46?x~h98xFn$;%QQL~RWY1gG1K7NyrB5Wnw
zPK+zQx&(N+)r@L4<%RTI(574z>_1Akpy5IAvM~a?c!U;jrOY2GE+>VyU-(j0$MMv8
zaHC<(Wvx(}cqVC;F^bMJ$s1}8X_;IS@ipBc$oly^OeUiH@y|OY2B@a~jqri`Ita7!
zMoh!TOACiPMJ%ZnYD-kDHX?Io3^4+^(=tQ3WJvjHm6Tgnt(KnqOO*`MwZy!E@;~wP
zrhYo<gJNQY>|VhsUaYqbXIvi#KG4P3<tlZXmk$#)wLmN0g#9z<(#Lp&c;{DZ+0>1-
z<xTR_-T$-i{)MjUM%=9}Zngkx(SV1M+ko-N{ddlURFvk{W1$hdJW_+S!Ki}*X{%nb
zVIw(W0e7hF#0#Zom0QmJJogJXH;E+%rT07&l6csVvoW&$6m^qND*oB*$xL@euNPHM
zu=cZ_y<vUWN%2D7`*^Ruan@I%K7r07o{QT1)Vyh`Oxv_|^_C}El4P&&bF#w!di-Cd
zX*B~<DUP}Fc~`TbyWXPj15E78_HUcHB!Fg_O*s5=d)V6{p>&(sUz2@G^?+FwXx`Oc
zYwbpeVb9qmW*)PtiZG6sBh$IAB0d+<l!3nXig&D4)r)H4hF&Uj1S;Q;lB%j7k7rE5
z&ly}kZywAyoHmL#4_L7$-+ai>W;tu%z&!X-qx&X=*)Vq6`i~mcTwJ*9<K|IAIjw12
zBXF`aOS~AxeH-uMg;}RVj>J354EdLs!U*wAyBN6)ZO(<1+dE>_sPzQ(*OUXM=OAFi
zok*R}7uhY70Edg!0J}>{#g>FWUz62B6hBqM?<@L0?)*p3_Jf-De68KXdCgUZx<ty7
z#)khj;^%b(li7jgZ5Q+hh?}Inh>eKB+Gob+^nh^Q>>p;7R&efhIMuOmLgR)C3l{Um
ziERmWElU*KXf8IaUQgN=`A&|X17My21BY-_&M?4O>Nml;>SdUgVa<;pb4*m=nOt@1
zy!pq(k-gxgUP+101ydXp%^oR7`&H8*`ziFQ2kAQkqIYoSGEJ&&d471XcXCJt=f2zC
zf9marVNc<WU4jk3k}L-{Xd>WWk4%m(I~z*^wb=23+_-a-fu;1loC3Vr-Z_a*PS4Id
zMp1l~$qq;%m0gO9yhu5<r}()7E}ZP`pCp$>FSDKo^yC7ybr^Yx4D}Vp+zor=LCCUX
z(NldRB6pHO{w7PT6KOf^^|E2Y$J2OIQJlN)NM(HOCi!4e=NPi;wes={IHG~GHg$G9
z`@aS{b>JIh8tk{&c!^vMI!k|{HxW)$7bNQiMwhu!gT$ocX;3BD+j!<UIhV2sQGt_<
zCtfq>_p7ZD?)lOx`M<=xA5P!mCQkLHE@jY~kray=(ZEG3ACJQtx6K(jpm{uN@{Iax
z<Gd3q-c;S;DAVmt@&+Rw9G*Vi-+p!+sLyB8HzOoFRg9bwl(V5#I_3~%pd{0A$<@cZ
z<|XIOi2hvV#Jz-R`;2!@Sw|-^_xEAnql={!7pR0H%&k4IQ^pccbvh|dEkowzjb&rG
zgd3*GaC&*hk=%r{rH*frM38pTd`$(Gwy1*It?JWh>6?p2H(gAXb20mzRlAJtA$C+T
z0xt5dLGhTCE5fqPY3_}h#A0|c&i!#i>(vK$Z&Y5ddR)&?t5kb%xZO}Pt1i`(Lez|7
z@8O`H?49hJ%hg8g+Zz{IE^5mjE$F3Z6zl24#wlRF_I&uZ=nC~<_oiD?Fb3r$=wUn^
zO*(jfvU9F3l3sG!{l47J$WnO*g^RRIMk$716P@wGgt=ZZf2H_rczb{*9L&gziEffh
zka=?E5XB~decfVbKsuOw=OC;oJI!~J;m~BE$n<2*sULG@X5&2w$4o~G`&a$R(cUvG
zDeTPz26w4eD2YNO+lufuDnHAKDvDuJGH|G#37No!5EG5Au=q=+FMBG80Y|I2lnTxF
z*(sq&Df0PZdM=qCkS(8@Tp#^$@je^+;|PPkclVH$@W4}bj5tfP;!IZsEPyjvC&<aC
zgEi(p2<RqX46drY2I_bz$&V;I^MLUUUjyD6WLlN$>m??bOwJ199_(e{F#D!<7rpCY
z(!GSMN^@+Ch#AIEMXneOl@e8}>;Z~MrcQ}D5S&9gpYYa=qud>xFtUajao;A`<dk82
zL6|i?nNneF8iRK7$|N-F0&XChtFq>lgP4%KS8$+IcT&AYiQ72=esIUY$E!$ZUEwg}
zO(>JvAA8wgf=MMfEskYSN8{{mUQA2v6o&+ln?Fp}F-tpt*@~ZtXvs6-dm}za6`p!7
zuX>f1uZBrxy5_iKZ%l8Mp@XXj>l37LLBYS;T?j<1hTG1?)iK)}hOJMBFF4cWad(`L
zCS}<54&%;=aqa8XwEG?q4VTb^qoA57c};9t01R^1C2@&(JgS*E>|PsxR+fR60;0cU
z1TLMo9_0J$VfSKOVD?raRhGVy-6C_D*qz*WL6+a)D&9i4uDk?h3qdb-LT3dwY2wm}
z%UQwXi@VC+rR;ueLIpYB;dP?sg`Vke<kX&JQjLN;v_homw-Un88fWEnK!-lZtbk`l
z@0uh~^oY)fLvakY^D*&&s{Ug+8su=xj<Gu!9LrKEI}~cn)-K)yZZZ#Z`egU%_DeWr
z-~F7dB%DMt`D^t@#Nhw<V}2+jEV{y<4YIrCxO<l$5R0>#7X7vE$B(fNpKreT3jf{s
z&#%|@zxd}j8yoljW8<rh&2PT``ad`CLA#A_{`2c^{v%oc_@QTirij)_@*mSPV4bE7
z?PmP`2mRco`*NokU61qgi%HVzwv)~E_5WVoT;JI2BrkF#3&1D>nYow(sdzZ*4(%5>
zxaXIc^|@D24yLWfzK+wu+mwoH9H+xR@C>6-kvs%mBp+w*<9%VlDe4PjlIVQeG+0C#
zC*%BV%0e+v2|VLDrX!tF>BJ%CoI#lyxr)oO!@4VAFoa9NUf|jyhKTt9^2J6fI6<-m
z+}GQj3eR5%$%`_U_|j!IF`Q*mnHvk|JgF{Tla$nToN>-JmHEuT4S0~en{`YQJ>tqR
z-4*tu2bOp-H!F0Q7^HYttkq2ghEzZ?Q-P)Srjk=Hn2ni*OzK9n5jBVDs#kQUE(-v>
zco&OjQaYeZ^bX3?LFu4xHI8~Ac6|p@_lSI+@aBM7@ufK|+*8^DwA0|-M12(F(xlbH
zq-7S?D9H8TM-qQTNK6<!@H$+zAiDI78vwcs6#dB+qJTmwx=dJ&-Q^rw2^N!>WJAWT
zvXm8&aQNNcadLe4^aQx8-30!Aadh~%y(ha*lE**6kGpW&y!Z*2yzfqu?+*8$>>eE_
z+XqkZ4g%Ki@ynA#c(Am63~w&ciGkm?4}MB^e|&+~nB?#%*?azCe-HYD0gkqTcicVh
zBzp%t`!Am$GnYUg$-&`CvcLCy?*y8i9CmPADk4*P6a7M;?;h=Z2Vb`z@9poM{6s@O
z-8(tJ;hw^H+sTXVqm#Xzm;2jC$%~gqFAk5XH(Vd4xZK~~d%pVw#DW71i`)Gh`V}32
zw~ZOsz2zSMZ~&qnbm*=1G4-{-xBYm3mxqJZKG{3k-8sQ!xxaP*h%m{0AUrR2clPj)
z-5+;hMcYR|b)Z`*2XwsqKQED^-ri51Y(L+A25W51fDY`?&da0S=QwfnCtpsEUp_tt
zvH#`CZu0E#@Ckwac=zaUdpo<w50d@EV*=dE<J}Gna<YxXV=n+T_!<6w{PK7Y;YUC}
zIN3cqdijEEZ?NY->|!nMoo#sg3BmgCfYuDaIz0Lb`$b^TR&<gdzT1W8u;&M|ypyAC
z1jjJ|aOXs~gi!&WCu*_D!S1vDy=S`zJG=PnA$Ih`-tlgmH*fD4+wAe+KWxLuFLC*_
zX)rhbQ{i%lwl>*&nruJ$+a6Ay8)I*P632UjKJfJT<<55keaSlbmwebAOo3J|8Ln)}
zJ$ncO?p@SItzB$E(_V(!h6I3ic+^^3TLYOP`8#oRlnLbY6!YkAtZ#nx>VZ5jhj1!~
zlYWbS!|EoKU4_22JMhNewokW@o*kc_wkxklB?NhezQHR?>+k-$@y%fH?mp$VO<FGZ
zc{VD_4$p#mqq?*}`no(l>H((r6->|kQ1ts;@v^j!Y<~$R{$;67QXdXWpr!|$5xB+4
zPjD<%G8^dT5c7-RVwe6t{`+vLvq@@CFFJ$)xU@@pARuyohn9bbTk*V@z^c|a-{Jq4
zItb16SM<-ut7^5>buIhRTvx0J>Luf4kKDAk4~uF&-GkG-+#gAOTM!ld`MVA;czJ@U
zjI5!E8qnyQ|MjYqEN7#Mq<KMr0c84<46dM7f21tJedwU1^~=W5PD7JeJb!E@*a@#3
z;l}f80v@+W?)<fTM<9rQE_GyO+|>-|$->cXaWbA11DwFhM&~xJxU;eD=i~|S0Nb=Z
zI6uCgfD9Y}T80ov53=F;#MZ;3M;JBS2wiM|k8y~W^tRFAo;uzhP|GhL1*61(M=p11
zFZt^L^<5Jzs0|==Uzbe(*yRi$Mse<#%Ub!sSYA$iOfxWf5bTD^Vuv1A7Kx#wJOAen
z)*&3WoAAjf0<fAOYMcck99vNqW-AjssV?Qv5D(I3I2Stb%Wadj4~Gt>#`_L)GkZO2
zdiL!ArR4n;cz<<sW)G%$`xk0&vzXU!%J%rYtF|O|_HCIE1@YxO9ce_pG3^x1sqN0&
zQfS@fc}U|zWgw)0kPa}$gGuh5N}AS*@qT1u(ne^!{*qp6C-I}=Z40dy*LfSK1K<?*
zDBF^&;cyw8JbB2oPIA8nj@PANHFSC#OFXqhPcPFruLK6_Uv+v)pfkx5t!b%U`;vK)
z+Eu5gKXTAt4l{Gqr4Cm$;>mm>YcQV=m8UALYh@YPyR19MDpprz4;NVl7r6OUi>NV&
z;fJ%bxdL9?LL2^%C&kEwN)HP7+tiBXIO@=K-(Xe@sc@L+h><0E#YySL#ak8+-tF6R
zm^jxNPy^wbDqA6NJ>u*m33~L4vLCS<MM{J-9Sjd`l!egif6MP)7`UasmdF4x<K^`r
z)P>kCOP4^DJSA<|X<GD8(F==8R3XgF9l8u(-ul_+uofo@o{pv<H{how#V)Y6Rcwwg
z%k(@$UNZS*broKHl{~~Q*I*7?G<zJ<=OEBSrDe+3tAjwp0I0oj%>1wtB=)rNs`kBm
zA(6wA1*b~h>nza(m#X}vUeDf;vNYmgB>Lmh+&Vlyva%MpL9v;e!kzrvJ7@2x<VvcW
z3r?gKj=Wvw8bP97i~z&TEILc$6`e*5n^YM}Gx84lrccl-gsZh$D46bMOamZ4?HZ&+
z!5}HmG=GJU`}myaM^_Kr1!r{BRyP`^M4jDaN_>MNQ;lru*;+X{#V>AF{L`cOQQW;8
zO|EY=t})7Q1ChX2NSQ++rs*&_dh!?<@br=rLF`D4%iL99QuTFR{s{53#9N~yl}m(;
zFd0XvUwH0&v*7}_9wq;Ua%ZBPTTJaHTOfU06qnY|5&OEJ0Cq1@iO5Hppa1f;!fT`-
z7ioEF)@1o@XlPS|=I3o-yhWth2m|KA4;GEZs}VX_I@*1*cf6!K(n%-rGtRE^VXw-`
z=t<QbeY8m9E^#EVs)EHujDy_*9Ei<(X~*QWvHM_PVfwr8A7lSiFa;m?&X|G|^+xhx
z;3Z|~s&~Fwg*Rl;cX%hsHOq8}u`6d>iejxgmkJ`APlZl34h_Q{e%~>!o;Jx3PG^$l
zgSEBD&{dC`3iE6DWxK=tBRXZ^xdzNwrE5{oi#Bzb4zAy4z5CSW(O(CHUMDHuoK8ol
zlOp(vS$9nn?3n)iyH2^((iP*NKTnU6kRAp5@E>DWiUQM=gPWfyvoEjX$7&Mv9imrA
z6owpK$_seJg>q@<QU8n6H{vO6f_?y4>AvD3)s$&z>N`$Ze}{#(;}hBu)9Sa$FV}Yu
zUfoY(7$4VlloP;~b}Z+O`H+@KSZ2}`T`zSu;@5gOuWf_(G4wN^IQCbk50~5!b8P5K
z3^zY=i-q$*?=RLLm`-rJKILINo_6t|^rx7H%M8+skD|_9tXqAKgo+SjvX;b2;7f^3
zA$|*(2+nm|P<;n@!X;!Q@ULN}YWX9X56#8(CPbs(9Ta8e=md4X-u?qy!2jR=RP6un
z^AVNSx%hNrG~55z|MQ#8&A|Tu_19l*{%QaJEk1wR|NpfA|7rjK)BgXb{r^w<|L@BF
z-yim}escQr9-!dy$?132&aWQXXZF$V_LF42^7v$XZ$H_fNRC~M*v=@5NvN+dJQSC~
zv?N7QhyotRsGmT$+jCLVOs+>6&Pz0L|1`R&A24E4-jX_q9a9v$LdeA2*DBExXSF}J
zY`WN*-WtQJ{ecQxTYID#Ri@{Ly@Rjb!SCdtO_X_n32QEjL63D@@NMeS_$c238uWvK
z2}OH7xOFR-n*4f@U9pe$gPI1<v+;S>3VvIrLXMqqxyu~QQQOyxX?YQL^?p$4rtDO~
z)uF$xP$yU0{T^W3yIB969}a%3eU;+KX3uO?zqE1ocF_)STJrj{tTOy40$$kJ05;1E
z9Jl++xcv<vqErHNOmwbYsU7D@hB54OjMD&8?&Apk>KivTnAdQ6S=;4NHX5YedFHkF
z`qggkaPg+uJGu}|pQ85mCNqCawo`AQw}dtR*l+SW?A*_W)q$Zcs-{kDtH*=ltga<R
zhPX`_M;jTsj3c+qs{e)>3}7gUjO{#b`)@8Muw3kX8R_O2tC2!SYU<|oJtVML5H1Em
zSqEz?@#S8YjhYI>!Y4jGzLie9XC0|e+dVr~6Z618VP`MWJOT{0HFT&a#Uve^Qjxfh
zN7s|(H`#UghzUS^tg>-1_C<@2QbvX;YY;|__i~v3W7>S;ZZfJG>^SXbC&hNJ7ovvR
z+O&ta5^^MnU}P&fJ=r}z(fyoc<)mU3CiCPg#)`Dt#RQ0W0sRGIjQY3aU%bX0M}s%=
zZ!7;-^gmdE?o$MPs86&0=j*T5|MNdX{m(l5^QZpjH~65(2#Nu=a0uq<lX~A0?_3&D
z^-s;tpPHRNH9LQ5cK+1t{HfWwv1X?^v}0*RC2-*xGDa^j#6KNySzOKy01I289mCFC
zL<mrqi?xd_d?_!7>9EzN!QP`}LP9!FXW;5etkk;8HE17S1FQL_Wt#wJSys5`F*HH$
zkJzMRn8l&V=mY%uI0KsIJtQ6wWsy!YF3w(qM3n+@7!RHQa<!YXNFIe%*WsZps$Q&a
zVUN%V|8WncYjob=zdYCKvM{+zjxt+njMP3!T9!pOPsPz5p98Zj-Z(;O&+rDz@ZOcg
z4nF-KPX}2Uq|zX@PEsJB%UL{tF5g+cgBQddnIP$;%IR4-$tTl^xd86alRJiLZniNG
zx_bq7wtJCD61>%|CDF2VbV`b1D0;R2L=tn*<%;=*#>EvmcF|t-Ole4SpQPwkbpdnF
z&?&`Sbm-zGeM(={v%HJIqWAH}kpc+Z59iinAWQtd&1NSZ(MVik4|l~eJ@<lTXaAVu
zUAgp^rH-Hdsl+16*S74MKo76LY=F#&UA=HN9(RY?Gv!{S!1??9GcM`b?n&|&j=TT>
z18@}>kF&|$eLNx=A04<ZrPi2EabuPQ=z}@I*l{KuT&33~d*<cD?De@|c`m^Zl+k2^
zl82BsQ&Q0nS5bLMDoQ>{gQ9pd9etl&KfZp!Kw{UfCuhlW?<_cP<|_e5^nY+qXP9uw
zchntqlI1@9UtF2X9$+YR0@5G6D<_J&0vN%+*c!JGA3YNN>T=<{d^x;_G$imo{W~hk
ziFrovk_OkPaHWpCIm|h2xjDpyLFT;R<_lzHvrYB~<G=`;XDe*;d7<51TU+DZT}t|J
z3Z`SH`NgF=0s=I}gi?`XBRs}<r$>*HJAb)D?%ViegP;6;{f=M0xjR0}`a8I{Et+#R
zE{7ghy*T4*6c&yS5Y@Z`q5?#`w}v1Cnt25WkPfw3eF{7rwJ<#hRp?`VLzmt4Jexe>
zc83a0G5w4614YcVFvM)yqG6CsNq49if@$N|GoY0KM8i=$kRWQIR~<eQm@9O+GNsTc
z`=XFgjU!j)sIezkN-mYS!8Q*gpc{YzPj#=z*t6&|eUo8=lG1Jdhy%;I7h~FLjHJ=A
zLnFPtxZYXYtJ9&H^*p6qNm!v57j_404rJ-Tx-AO*1su*K`IF~b+v@Wa;eV~s%0`DS
z0GF^0QF6J}U*TBB5F^c5!!CNL9i>&aS6ls6{$ulj-<Hp`-0F16$lk#S9n+idUmqQ<
z66a;|0^%m(erj}gyJ08?o=2MD1A|fiBH)2c!cmsW8f|YY8@OUKxo_<}S2mOTi3uTO
z+7@3t(Ky!~PiMsqZMuNBxf?}A(8+jo-Fnj@{IZ?2{a;rc(Zt1dc!=6YGKCHzL}eN=
zJhh>AcwYIwVM-w@WL8o3YM-tdk4wRGq)Xhpo5b!uvT*i-IzrEExRMwg#!n8=CEol8
z?5@%tM=D$_!Fe&k+*I(p3Lr698@jq0ju8&U;p6{%`rY>Ncaa`s!AEl43*SQWFC9u#
zdXqR7WO&wMx4hGIFLM<(EWu$J0660I!Z*cqa<>(p=Q{!g2R?zRb9%+8*`cCiPbgtm
z-64!D9>t@BXZ6eH{H-!!VVZQVKf`BXn!nPPvC^E32LZ#>tR*P2NQz&+E#Ps9><uR>
z^Ww1d-C1}cNgh5|5X2#X*UmonBm&@4ZV>?P&)YK|t9g26!q3u%ESqdtZDW&0Tw)oH
zlz0{}tu}Bb`CF>q0g$IAr(>zD$3jQiV>MKY$p*)Og%dV)OVG-&hvkpXFcV$!`1r}H
zRnA;xQgDnIV$4%W1LMtO`ze#Rc}k<44~jDw;SNircf`C8oDyymS-8})Ff4W=HkxvS
z%PZOMHp+^hI)RTd3<SFkB-Zd6{JDvLZaVI<dpXjj97H}QsHB6@MH=S#onBHIXj#}=
z@*Req<dZun@8oY$a^^bFBP_*2NeFvM*)7H{x3C!trnR~?U85h9E$DI6eyw=TUyl5w
zaysZzck^(LZdR-P_{}g=F@dgh1>`707<JmAtv8jfldDviwk~Z|UKT^&61OaQ$EHK}
z5CNf2SV`VnAp|7|eDCsZaXwB*7dd9&y<Q7D;@E)nT9`ykOol=qaol;CxO8fhyz8BI
zw|E&;U$-TL5G4%)o;z!fCRE^rg%l7yhCV)2_E@3Q*>#|q&<($oZG>4OTkz|z$(OQ|
z{3Paqk8?0_PMD3;2dHsI3E^O;<_!q9o<CmHoXRj%K}zNmVx#NT)su^Nrm<1?*6>R3
zMs556=lvrTmQ<S-**X?j@bI#ND;7p-`^rh=MEMh|M=k@Ajt}JO(rXtZ3nFsE;tE-4
zP?#tNgI3$B2Za9M+REuTlM0cs&$5OH7bg>G&iG>SPf_r=Rhubz3niYxU#(^%yd~d?
zf2*TSawkL-BjG&f-ohKwhT2)`J_mz<y`Q7ckotI9Mzx?`R(3(aSjDmK^HpY&CkI+6
z3ADTf=3Q!5ymP+|*~qh&{E&`Ow|3uTrR{N^+>#<+E-9BJWzijFQeG@g&hiPTEXE&@
z+f2{$K|Z;5$y^oh(H-O{zc1U+cUA(sl<g7kJCJ1I7WKqD_W6LNQ!RD6rrnQ{u;((D
zWUJhWA23&pM5kkdQnO*tb^5x4x7vi*CVK5H>{l_i{(so!Ji};zN)Z8oMje2iJ}WJN
zSu&yv>D+MGA#54isZJ>Z-d{<1J)ETP!e2z01~VZqGWrWxI;#L9Tt+cT=SHcpK0N;i
zEOeMep8Sx4IB}s$65AnJ6n52^Bvmqfl^EXTWiGiuj~qpt;q=hGChAXwlR!oF`G^MM
zQB6iy@)5}<PsdsIJeyn;y_S2SLzxkzAqvl%v^0*(l5D976<VYyb-lF8iNL(vnC$w0
z_E#zWv+P3$dDW5%&&hl_@5pQ5t-7mQVcrJZK-5&jb6k$JSbeRpHNM|nZVYbp_LtYM
zm`X0CWp}9^(j|l7QKql4JAAXYzc>@wJUu*M)eg<MyFrh18kZ<fg$3SLkS@VMt_24U
z6VE&aDVfpwaEy+D*Ddt=F+Hzryy_&k)v@o?aUNfq5|WW{%sI!}bYqE{a>iKxPu06Z
zlK@>8(tIMhO#EB(^~$5o#kYZINOc=3;hu`tXn;Qmrm(X349>3S8Qze-`oW!6|M5>&
zX=@d+Vl_fVU?<7fvNbVzkh}=;OW-@W?4%o0X@CgjkclR1k!Y~1j9g66@h#4Lu&P(j
zn-`9H-&ocP^HI0Z0^BZu0G5viKU>gARKAo4jN#I8+U~U5%|;RCaGBr(*V$l7_1dVg
z!VDf++MZ@ZbZhI?G0JJLM+a&bQ5{az5=>aaYK<h<%Z54K{mG6Vzb?di*4e>NO)j9O
ztUotGXCNPQ;PYZot3Zrdj+=t)qe%_k&)dBoTK7-Ve4uaVn03A~08aSy@Wm-CqoWT-
zJD4o-S>X(0yAs?=8eF2w>~_ivVC;Kqym(l9Shl4BDAA-#-dvp3ffM0Ncbx4A4r2z~
zDi=pEj0&<Cq&?C(P1GDT9<UEKl}S;su9$+tsq8x{g_K)p*jlnTu}M<IUe0cEsKE7#
zQhjNtzAE^_+-ODd4%^r}vzuu%3wdIE<XzUn*SyTi1bzq2p!{c`Xoiyz&$$w9j{d%j
zwEr3U=fy9u8;$sPH3sGahwxD_zJmwFl~<K%Tu{v#0~D*%=OhHBv6zbGvOh&#s$s~9
zO4xKg1`Sim<$}d~$ii~BM?oBPp&6Vd?H_BmOmD_%L%4s$FENkf5SSzpn9a$!xP~7!
zhV#rFKKTZ0`Lz*un8N(eH1EE_oiNs<2e(|M2Z{<4ZCpx+kM6*sT;ld>q<fH#0zD^H
z2#K0zm1UvzjKVI!pc(m=j|)_9Q>6(SX^6#FMg#GFHIk6&3#AYC$>ej^!r6BW087la
zDAi4kA8S5NhFrAA^Eb#)a}U5Y%i&TK<lOR)DF9v6tIz@Zt6<`tq?Cf$G-bQE+L`Me
zvuubuHU3d~6g`P8%Q61?D{^h7=+@5u-tNK4>Hf>@c6hMRa9yBN@Am$S@3v$5R4tjS
z^H!BYJW)A3RZlWDG)Sd4lFTQ@(LrrUX?@?;A~@`?-VqA?yoa}UxL?z}L(O&%b`H@s
z@bvh54n9x?N&u6s2eZT~3VAkmGDE<P*8`W2_U2>lAei9PP`vw2i6QbfTKo2C40q`C
zHD_OkW%+L-VDRnZ{Czg#-JdHjW4$kWvDHElEw}C5Q7;I$0Q~NE*30@SoISsr^#`H?
zdyx+FZfogr+GFyD5LjZ<^EPRop6%=;SFF*h)?zdc0_@nxA|tDZO6YfT%@xP=C2h1x
zEv;O7h>3c>P1ck9TIVD*Y}j+nxo>H1*R#3-FVZV3s+mz9un2*}02^uF@#+rAoK%PI
z9Ps$=r%i3;#J;hC-*foN#siPAQe`nIxttLJrP5ng6PpjkyOAj=`U0jD^qW$7Gedk>
zVT+cWHCu4k^a>NZ9}rLRcJvPdTfW_SrNCj<TeYZY&yYNrxIx=$rnp?!*yIqqkh(b3
zV_G^IL;j1?ENOv!^3ceMq8Hz4hva>4DE{m0IVJh*xYQgc$P+v>8HCXEnsz5snj>%q
z({5%-GdWAz@{AU?Fw1@hN1nh=Ig5=_7Js5zTC^Fe8qb)D9N7}ISSSi_h{RO*LHE~G
zE=r>m#F=3Yw)`BBp_raun9gjmV5;#0y>RbLtb7-uS|W+pLG(wWhWZAH-8^y@FgX@>
zgt+>phpd%LMbiyvzRD+Uqsl9%J<aDBV6gBkwLp!XM5#^P5LI{LKo#3wcBjm#FLi3t
zTDTzlYrqj$qmKpOsJ1muyl+ndq2C?z-W`L`%BCvzRP<6S*;M4b+|-HYD~a^MASvW<
ztaKN|e~@o*+U>#@_;Wzg#*^LSo#bw^4gVE(QxC1Xa1{}AIYxAe7%b<y-Ew~T=psE~
z8lw9Fa?;^*037JVu&&4#<zs`corJZ%a&&x-Cm@T2ETKeh?oU^$br96jG%Yv)GUIT5
zzk#}k_u#Iv)h`XV5Y=Ibt%q{fwOcj!I99l$L$ZogQ?8cA{#*`+`-x55&{hsR_;D(5
zccM_sA(NnR{6XHiO{=Xait)qm{qp+N8hgE&S22=aUaRUN+)Kv4A!>Zq&5Yq$@qYUA
zI+X6Kx(%FFSeA5<2eTtL%XbXkyMQnE&5hTUa-&q!kV2Wb#BN!Sa`-`%TNRWGR1?OA
zRpXM-NIF72LWsGu5OKYuQ6lUqis6hZb7IEASTP4i%!v)YCaJQvS`3&4b`%A?!jJ*b
zO9Z-k8iBbk28oXGJ-ly2@V5A|>j~j(yq;^yE63o?;<UWzT=zQM{cjC>SxX4|a$eB?
z%u?urm!)GNKkb$2v8MmN7pEuoVmucjr4sBOs0KRf3pu88bqoHAv_R!D(5GSZS)gR`
zI5}qUl&xNGJEx+~`>uNJs360<_1No}l=r<Nr@SoZt%J6xDJ#qYUYixB09_7n{fh{?
z{tY`A5<n26(|q6`7bOOQ_*l8q%&U<wyFo{0#hkBpYm4d5-6S|m_UhIEB)-8f>#x=T
zK5(1$KHbEG6_3|cU@B+!c6GH{q8$|g+a+el`2m>py<xvVEvsBxFt8zj!DVX5=3uzG
z<>3;3;?&Xe%;yd|#_^xY<ZnYKEkuQJ!zG-h-8Z-`sC^hV?bZi<B0d@C66ab1j%6OI
z?S;MM<g?3_cIpq%1MdZQzxHzf7s*2c-FW*QqbI#w4lf|AyL~c!Y|Qmby-920ae586
zuEjdj`S;nibWw{szef!G-~l$grhCCPt$84&u6sFrGc2x#Mq8&eQZo)Ud6Q}(+DPwc
zCt(L{EMQCqdJ*T@vL)Wv>RMJJzBYKp_y(#7#G-oQ$v+PeHsMaQ)7IIw%_C<%2K&#h
zYaDsSsel7QjEdpxI%agI?zJ7wMQ5@tjR)#@$kZ_!`7a+u=%NJy_1(7Rq~~`%pjyvf
zq~v^y@Fp3GW)%=tJo01kjiPoXIFMI5=K`twUb#E0_E75)Orfrsi!=;Bu|rBV=X%^T
zyA<5c;!d+>R`|0N$irYf(u<A9LkeTsJ=#8awj1+vvOQ4Teq|=@xWjgQq0~>@$uZ*E
zji1IEQnGe3$ly7ZTf*8-_6|<!K#tZO&ufR>nY9%q?-QwrFJ#%|bzC*(pccJ4G?B14
zpK>}Hu}+x+zvKP%)A1VBoCl7X80#+j=sTCf@DsxYR`fVjh`6sb`HIh=rW=ScVJ3d+
zwCN1qm56Z#(W|ty;p>vTAVQfc9#&plx()O?%WT|MFYZuPOGCYwsp#R3F`5-;YG$t<
zL>m}WBmEn1Vq-i+3IgKyZGtwQ^>}-t%5?C>URr7GR*j<Vyee?>;nW^-!aKHIr$$NL
zQ88D>Lpq}jp{B!1XvWP4s1z4E#^o6IT;WQ6d(zpo-$xHNaYVN62`=LUW7o6Yle<rL
z_wVi<>>R-#J4f2-7$BMsU9f=mFK6HGZ~5QlmNFTjGPPnspki(j(x>sW;=Xk_q-;oN
z4>PO@d*hvD#vIL_??Ar_47**5s6VVjW|iYaK%N{P?HXGXMeRAKhtdSu8%9X{8(=u&
zoqxA7`E9i0VY0|>$AU{Cg=Lah5<o_Y>@86qDK6ieUyz+lP^Dfu`d`wfwC$W8PX}*c
zJ{|+nu6B6DWt5bc+U<%qSGf9tF_05SkIkaDdpx1cNTf>Q;HqSmIm4NZ+sNjai7V}A
z@N_kN(a1?$%KNUVBIB3D2G(ErW)lvkgF&lX!=E(XPr4Vgl@*$;KOTXvZ(7S-)bb45
zoGzuG=7X~Cf}U}k)`EEU{p$Z!nX3r{QQ~0C`$;XwJN(|kkDhx}>m`(EMlN&(f#398
zSNF&0;wcX`f&h9zg})#WX=1jCC=hjr^UwqQEJhP(t8PLU=*3S%8}PFzeK4D_D2*`h
zF`dx9d7iRjX{obbH!OZo@Ku}49{ZI3-JNw4E?iy|(*dycm{g^kj^hEM^jW6gjsKL&
zec(9GZfauWIpbkdXVopi`@3$nbrb|Y5rhWfQHRF*GcWO*MRDgOclh~qB#&mcAR)vL
zrIxVlMnwfoYP4=gj)$Onr>wF8m~69u4Xw*j+Rb*~0xq-;4o~);{zOL7&JwPPV_{rB
z^%x-^8h3Ro?**d?d*92)lWQy=ZdXuIzLPoOOmeUL%cu|;42Vnz&ndxb){Cut{zX6A
zJ=i_k+rdDwfm-oA3#w5EdKqB+4KQ~+hE-Ah@G1-GB!HbkmJX*QgO)RtZ}IU%hVWKo
zhT78F=+QmD`p>GTP)w_;pnS2cX2L;SI0KlAL35)&Yrg$Ed@A|BC#PuU_@o)Y8}omE
zwfW80-+UeB|GxLlpY`8<lh2I$Z#T&7{V8k7{h1{^`7=xSpIO5H%o6@*mhk_#vV`AV
zUj39G+9T%!xBX%do_xvyc+Ls>kMNB^E_Eh)i!D);t0KW-J}$c)Clo9OJ(t$Zc<xcI
z8_DmBtuT=Bu*L3RZP*3Ct`nlUfQN^F+x2V;sIE7@gxHTis7~2z{RDB!ARV!(QnIpg
zsNQ8d8sY4jsOrE2vKJ5`-k!Jxu;W8R-{@Dz7l`Sad%DHh+5B-@7+Ru|LWv{e*|q0M
zfmxH^=GoO!+bqtxBU1iqIFXV@3h%nClt@)IO_P*})_|8};c^fvXduL`>!9AB5+iFa
zv&&+9y_WpIiGtyxQ#qPxb(iTdJ(nzY6o#wkMrIh0{qn&zO{Yju+zM8J9g!6ndVXIH
zFf|QoIx&^v30;zuw-PUSOe!-hY+lcd*p!QcaB_`Lgwkb6qV6#)0b_)$52?B9bk|Z-
z5btXG*#OEw#-SMAkQQ7fH#Oh;$ny;-2UMEuB$IJEEC;E{BtUjH>#4d7EzjZW<l>S{
zqHu#V68w-426=j!yqKO}AV8Lm5xG!<T;9ifXk4683Mfp%$NVG(V^Jt8fcJ4aNQYhM
z>I9%uE_H+*<fx>{1%eELa-U|<W<(2CfpIohCgIeGlgz7=an=s<5gM;Hvc$s*&~VlQ
z-Y~gCZ{2BAMnlAJ=n57GXpF~~I_pwr950q8=x@jFqiBVMb3%ScDI4mp;e-v}P?q;{
z;#eqrhw@?aYbCHhoIf8^wM~*Ga@tEamLwET7DqMaQ?x2(HUI~EVa!0D9m!ah_BzN*
z^``>@$InN*e<P=lHL2*?Q1-#pZ}>cfzXkyX&0vWMulw^{3sfeo9PDTBD5dSQN%lM^
zXE{EZo#g!>dq?i2$TKF(_+L|{%)Pb`uchy1zjjM!&ay{uh+>Du0+*4+h4v8y7-vs>
zig^bJ!5xn3mK@zZlN*@2P5Tq!zcEoJZFb;04a?vu5uxHNRWMpdY|18;C$0@02t|<<
zb}~#JS-n+QF5~^My+VC1%M+>3YWvv7AB}6``{C-A^>V_0-DCERw4RvaPXB&ra@kqX
zVwz)1?z}at^>TSsSr6rOd*CmP+KO6G{LsUdm2TST49%Eo-I?SW#b{f<O64`pPR|PZ
zKbv^()92ei?gNLm-&yY{FT7C6SZ!a?Hb$JZUt71|iYI5hbva7C)ajL$*1K5uXMNOz
z#B;o92wC2>r{)@UnC~48liAwhcZ^{mqCvNBKV%&6az*Z@!16JafDn6SY|1(53Q$N&
zfGXbocvNg@6_sy#&88~UcYAOYuyeBkaA-&;YX>yQVxP7>D5S|1Fr1l>yL!N&AWqF`
zq?13xKfeRbvUd}M-hJ-ez9182+ooO;X&c~0=$}_r?@F$LBx|)j@C<ndp#~cl=GVu;
zn{!O1C*?9QA;$Wk3mxSc=JP`0wb}Y+NvEKnDg&eQiDNi(Ho3~OVX{G7RP}&iM=eSc
zOV?uw%u2gsl4p&It86?-uOv^PrvsxB$H_&0e!=`E({!3FAtk=SaXn`)kNcWQaSbrx
z+M7fxE2JwRJhW{|tHm&DwQsM#dkUX6kPJm*UcfBm2WNEPo>pvE0<ac6e^`YFCMn=|
z?#IZHY$KN^7RpTfWSp!mrf-+!^ioO*nbT|YvPpV+gj@EGBKI+4QDHAOX7jUQpAv(h
zXdxW8MUDwYVii|IV3aQMks=kCe%z-jbg9<dl~QOqEKIe?WjP&TVcB1*(0T=j@*RWS
zOKggDu42s}*!|Btya{rgwMDk|CHwA*zb?P?&L<D*cFD~z)ZgmHgCxfgXSi^3Ke`6f
z$&>CGXJ@kkQ0f>KCSk|A7h+ha-5(WY&dv_bmP|{_U%{X`nul9@Xp=63+jyD$1i{}K
z@{_wOEt0k=*3K{)4|&h(e4m?MeIyJ@O{OTs0?hpu?Exb*2tzQ>hdO>ilz>17j-&1c
z?_=Nciu)NECuV{b>?4@J)5P~KWiw3a7>0MKI)k{Ic@L31$3kKhLx@~@Z_1g0oNpyd
zS{*<HMgZ%CsZ=ROz~zJ?7wKq(Ntvi;m7YS5I2>4a0^8QlBP%C{oG4{L9x?)^Gk+bZ
zNru%~Cr?931A?n^jd6=DbxJB>ApRl3BlIvae@0?K>=_6`Z}e7GPHUx6fFN!P$bZH#
z!DCs4e7F|xD%>f{1x(@`FJl+H-n7oxNqrQZdj)kH8ZioMlEjS@0zenDm9aeJAeol1
zGSn0h7G*t-cU2TAJZLr3q@Pxk7H!`8EBI5kvE4j#=`!+OvXWHtjks!8^d7=`I-C^K
z?geTOn1j$R5V_q++6xZ{{SB#`Tac>ooyXj_<Sni{rrAXx)x<&HPizx+V%}A`#C8?l
z>xw+8F@;8X?&Mmucvq3N%o2okdFPlAPWI#YJ>%L1FSBz^$NhPP();7<W1{dt36Nt5
zf5aG7k4NWUeX&3|gn$WnS9v0QfoALS_z`Q^Rs?tBfdPPp^rse0Bi9b53z<!S)bVV*
zlwwY3^@q(*AgxGM9gfB5PaT%IZ=MhRKjS!8X|1FsMOL>!jJSO}CWvW1$J-r0KeTGL
zTETOC#F))!r}e@lkWh6_tHZxr(HU!vFqa7p3oC7yYm{ZH6m_XnDMZd0AVH8UO!+?S
zW<6Fv6N_hJ4|i;-5mH%m2O<v`L7k7I)0_wW=awJg<}K97lD-y%d(x`5X?Dw|SCQ}S
zB8*b@mPy>0PNY+tSj<S5PO=zhQ&F!{A1zjm3PXcE#nlt(#OWH^T9y-6zPY4`DxuKw
z_zh$Wp)8+D5cosz;-7#S|3p0Y51C7^dWm%wMgwJzb828!M(Ii{Rv7(exL7ek<>J`k
zoqJouMuj!gp<rX3<#oLkg&G_ps+3UI0Qj8&Ha@iAw7`QF>w)IcyAA=r;nI^!&JSDr
zk}%qXwx$8^n!?JAw(Fg1BNzXMhP*uES{y_^h>!s!n1sG$#*sizi^KxNj-HCJ5TtAI
z2&iw>G%u1559=&&2k0x&Wn)uXv$i-(eXZJK8cwPz=CCX#R7eO`=m5|DH8Ja}9u+;-
zFGp-XW`gQQM;KGWV9FaqMg?nDq=|9cj=C#o3TFU_cPSSeQf6qQ381yR>aY4vLIk%4
zzq4yLeYz~Pt5|xD(h&}`D^d$Fyz#K)09<+-Rk=kO6hf}taX2bZzvrY<Pp2qXMvX>@
zF^BlXI)dJvjzgL*zrgIh0&E{i&Y8a0S_E14hV){l>TqHAwBSe`so%qu0MRy>4zDrE
zkD)SLPgiR7nU~3$N`~m%rzO9mi^M?uhIfg5{r7vFnEn30(@Ro?qM2GY`aTkm_!+lK
zRz8kqpS|mY%0GFmBNMQ4zKg?CKGF?hp*iOzQYpaA<j2`EeVSuQO*z5L*g|lux+g++
zOl6A-o#T$Jx1jXk(y#h7$X9E*t0K^B>x8GCJS~NifBjVp6b^?SZP2MrBXAFTstP)$
za-{7sOn>^$*<4MV%5_@7yn}*EENb=`-KB81?(2l~)@`L{RKY^F8NOJN5VPDSK<$Z(
zo+P6|s;W)T!AXP`u<Xhi!K})D&@qeaywm15rkb>fp0|pGn<<vQ<Gg;T!LYE)V6CMc
zPb^P8Q+0Rf*7MGovOQyIh20Uj%UVd*6Y)X&D#%4*{0>5=1KDI#5)K}%Ze8ZX>>XwZ
zWi!~8dyK*B=IJB#xH7nSJltgP^qn63p?j<bfA~l}4sC%fk{VB&5vDm1Qx0X8Bjp~a
zd($G<Ub#0UwM|tsqoz%N)?CK#99=p=oin)=(W^{PDKEcxY9ZqT%+$4a`l&Gi6ku+?
zr0>EzO1FcPtr}up2lr!!Z>pcOclx%m46lDZyQFc<;49McWq?_RD0CPoGrMk11y?_u
z;L@DKIp$sr=SBqT=VQaLS!)!Rb22Vt+QoqJgJTsKt!Q49v}9Ol+ef7nhgwx;@F`B>
z6CfHv%xCQ2E~HX=oQfRXFsFq0l6BD}mrTb4AM3shkbhtR>{p2XR9qaEIxG@%GcixM
zeE9NY+0NC=*D^oT7eUV&4z7Yh_L^(rx!lEOGR;$b@h}@35KEm8a(^H^0~P|sG&t-C
z!yB<jF8!bx-KC*qKHw2BWA7?E+H`XKja7%{UFFaW(trJ#*-!sGGSwrqcd-0X$EAuR
z|BBO+myIW7(Zc}XgNrYI7;0{<*@wYs&n11ouZ!bxjaSg66hy$wIIc#2jJh}7Ov;*C
zZy^+)vv=l83uN@fyVAwf<X!7)T&&3Tk$UiOS~?~cT;iOR>lMwEmIm1;W}?08jH+B|
zn9z4$7%bMAt1QUM$6lCx4}um%s=G;1(EeEu7s-hmF}uyC1|3NPN{Mnmfwv9Kg;&x`
zyxP0}5{3B!S6*_XQ%s9*(k|>w$0U#$Yl^)y)ZuuDDE-hsnYCA-=~xaO_FD=>Jg!{>
zN^EG+E6=RkQ#=Q<AbBg+UdTc$0}1n8r=qDwBoo68{^`q*(u)@2Y!&vr6z{)x*6UR1
z6b98Kc7lOAhr+vvyQB~@X-(v;`Bd#^@2Y3Y_f-EE9IJoLxe8qVYc+ZQ{^u%)VtD7R
z`_FSV7n?v%kcLZ;>f*ovV4lJ_pK$E8;j&9|yRWGW+waOK)PSGZSUtn#&Av$`kGg;8
zJ@-<ng6%zn(LM_iFri9B20H)Rt2Sx5*{oDNT~K`=E$pLS`rK}rx4iKT+BS-p`fR(I
zayGW#<6&+(o0XL>c3`cLONWzccsPUZ*)^NVopJn4cJ0Zw>n?+>dC5sJWIgV1&(=RB
zVg{xLK$pyM?M*F<O-@bh(rN>O_$LbABW;!p9A}uHWs~UPUc?tYepBP5|MlGO4P8ZU
z>LxOuN$(Na^dcU-pM)A{mB2f=_|bg>RmuN=OAV1j!JY+d@_p{3V+XrM4OdAe6O<y6
z`*A+M4Sk?sU2&H?r;~MOtqjf=Wo{-9$rE!D((ySZ7x5A~%h{-Ehn8z<g4En)7IzoH
zb?-v@9o|8Ycty6i-{LMplu>Yb<N-B6k#~*w!AciKkr%~iIxvP-Cvn)KMmB@9WE4<J
z6he&>gZ#RQm~&pFFge!GaaK%d-jM{E@J78cN~hb$@7g5x$g@$os*5=L)C5>V(^XQk
zpiju#bg+hMMzmpy5sEBWT&Z-N_49YmXG;Qems(3S3*c4p7*k|8RgC7O6idY@8!oM3
zkz+KMPA~}G^zbvqY(M_#cn4FrlDVt3vG#S++Jyg*{fT{x5Oxn?%O4{28eYbC?W;H#
zV7cz%5%$44C8csh2+W;#-@?~ss;Ad2{40*OWG8PSfR=63wz!<%Y2B&hJ5>EkRfOQ>
zm5pd|gqorV5-nv-pH_jmbGmzU^dLSqVT<-oj(IlEp6Tb9XXq#md%5uDrSIJ4;p=m5
zo;01kdDMRZ5_$O}HZOfQ&*sTdpL6pXX8JkiX*N&O)Sc7A?+s0@OKp&VOrLj)^Km-5
z0GcUQ>ZW7}lGsP+9Ig{n&m##oS2mD0LqYa;f5cLA%So$W6v<_l4$(2ZNH8tt&=STr
zHTflI(j62f3z@3Xs<aULYW$~-M>e%t(QVRqu{P9Be1_!boKiC6EC?+3kY5sazQ8$r
ztWw+D;_AxArY~v8oL{(27{a+$0D(+9>2MvPw?W;E=?;=A^5RXOPqIrK-q`_&)?4`>
zx7c(komhwZx>Zt$o~)G%E)y<kcl?gc14nlh^#i-gP$8%JjBE!W+Q7vXgdY=P09w(V
zy9W!9dl%QjQU>+Yp$i&1^6y)$mw_#XcJR&1h3UI+HoSWDcUJD)_XtY&mkoP*>Q2gX
zc#3&dk0g`N8ej~=s^Ztg=gEz}`Z-3&yLGP7TWa+BUVG&*yTY<wU7(Lr;j7zT-DuD3
z|CdVt>z}B9z?pP9nB1?nu%P<jCp#Fx_>8JH|5b-Qq|YSyq9@sJ$n)=g<|ARN&DnC8
zt?Zfez#WMqb=vJ>aD9tTlsO0ON?rxqWh`%t3CP0i=k^N!vbwigsEjr=DA=}%A+(28
zFh=@r&N2LkwPPqpDvuMln=n5&Zj*dk3`nqo0K<AMIUFWj*Qr8)NI^oTOn5~-54O&r
z07v-HMuz*;ruZGJc|rFB(fATAg!dY#SDnOAzxQ{SjSPF9xgsn~Y+3xaNzkM+R3eq3
z)(rQ(i;f6P`DuNu*`>v`ko^C$wh)W0H6L@ZbpBcN1s^T;cut8pktpRS$lbOb=)aNh
z!wh)q)g0sfAlPr)!S&y|pCGElLj=jJ)If78g)&0IWvG&IWFV*DG`SjMG&<*xW35Ts
zI?0G78*xyI=T;6XC8G-tB}N~UKJg#Z9FT{(D(qx6ANJ{u75oGF41S?BD9kee1f?WX
zDPOo}nlz;duCun%%y_?4<_BEpnf}2M4(VZaqoxbHny?Ggx9!5uAtF#rJ7=Ch>0-IJ
z8vI%94!0b%xF_Y`iuGrc`|~wrU-ars=S%n1;QTsscyxw+INwaEsh#PfZnEAD5W35{
zTX7DX@n><GMV<TQh&d8jymOZ6I3F2xePa79E_z0Pqk8i<aGb50lVir?Pv<$?Xtb>v
z?-RMsI(+$D?z5i=@eB%mLXSW-vp=#Q?Pqm<_+vTJHhVw(5j|=DJUyS!rM8MKzx~1a
zZG37QFSMEG;#1~nr981eGj^_Gm>jyFe(rqXVnl!cesIj%UTZdFh1OeObpxN7x2pIQ
zH9DL2f7#glFO>-gn_#>Z=MRP76^gv&%A)Ewe(y57?2fMSL5Bu?>*^ul0QeQ1Mo>NF
zv)fW48s0N0L_g?tJ<BHSWgD!lL@l-~BeLkgh-wzjkIAG;|9Ol56~&P9M~Ee;!vPhV
zR(^laTMzT4rk&dahTAwQ{uiwh2D=Hy<;1J2Y62VGR)%1#)}fbI)FONxysSkt+`wbY
zL@oJF=>WUnK{jK8)ZkVm1>rvD7X0P_cjBHX5yen46YTCq^qIqP@c%6y(U;YwGO!N1
zRV0D5D(CszZ0LE=kZALMAn%G-K^X!c%{846?A_{d@2cbeNzRGi$y+?!_cm3MN1)QU
z11J&2c2(_KR=;a{)9Q)>Q(DJphFwZVZRd`e_@{mEG8G~=7;N(UcJGl432DQ>+a0~D
z^d?P+mhGK5UNzbusqcpZ_iuTq`}9>5+$1R?xx5_l8K+(24gv|0onA~fSS*O``jMvu
zX6;ff=(A7BmqM(0KL`Z=_a?XXum!)}-89tVdBMpPi1`J$j;|AT4J(G8`v9OW9#c{y
z!5?cJSwdwN$i_szW|nERlKxQltn}RP2UM4|GV2Pa$ML_3B%Sgb%crGts?dl@JsNt0
zqWE$^fan$K1<ACqp*UNZ9uMp`?^JiD5tl}<zJD4RWxbi5Mkry0DsiNH0Mu|)#|R19
zF3WOGou|pNv=un{=s=lh$JyJwn3gv}3yRHAxvb|!ix)8H?-?!pZKc^FT4VuQlyzv4
zMc+Ryo6sVg8!h}T^HC%FNYuDVy!$by{voTGs-Bfg>O*{bjk~VnlnI%Tu(>!)eO<ah
z$Ox9y#%Bg?N42crA1#`m9*rDE?G1YvRWs<Ibre^FVB{5g(;d0n*2_h;iwo1tixJ}-
z+iE%Wk;3>eHf&bxeC@nt+Jq6oyuDK~3R%W^Cur2=^Gq<RqBIU0LMA=e=+CZY36b7E
zJ0Ei<e9C0^W4+yBdeC%aZmx;Z2l{=J7Dn_Ub@y%jx^22`W8}RKkpl88mdILs51h4T
zD*s~rHlk^Ou8wjCKltS|e1~qI^HXw(X%pvw6exTlR6Ezk&IxHG|8>VihxLE@Q?k1G
z=P_wKCNXrLc}xOb;JnB0vm6u0TDgz{$-iYHXiTEUu<4o`Q~XUxYdTiwO)0?M42vt_
zt<nJ&=_(b%dr*jTp;;CD-tKuz_cpl|XG>{6+rdSPpGw-xI_5H@4OVFNw7DU7)@Z@D
zc5XLcr@68>KGvxK-tAGur0?w2hIJ6vB>KV6b_IRJ<}KL#8_ioryUDzNUwpeYxWou>
zgEgqiy?+F+{;xIS*YoR}ieC@Ud>zN`-4Fqqk8Z+!uWRl*oJAx59nM0KcIGTTDU1Ed
zd;x0N>`#QkvzhHr#WN^h(wnmlbmLYqj5I2rg5|AXjqdrkWqO+!Bx?$_d3jkpr9z^4
z(9aAD2Y#9uY*OgNCi!`o?$3B|0xy8ia&9#H{d+z*5%m5jCb;oP{>cVgK>gm>;Mnyt
ztQht2Y=jxQm%aSlH@j7SGZ~R^l)DitCnKo8(B(ERP{KMe20V5so|_ENHnaL@3S1tZ
zX<td`Z9Ac&UE=Z_GHdNQ`Si+@7-G1@E-kZA+3-=Ca{+DB=UVcz#EQh-bN~c-bd5)j
zMm@{ADJDR^A|p(%!0>>ploPH~4ttLK#Ta2WN~2?dgw@s1a7m#t+b)yU8(@&#%sdKx
za`@!%K9+k|Ip7NGwy^zT55IEexa1&6<5u+hSeo4CWF9zRn`$P5&TS)B&G^~aNC!2C
zlT#>f&ttD-D^qxCn+~m08qs%Z8o25hR>Rta(R6(}5g-`ryR?9n_KdmPbY^Vb=6hSP
z%CYW@uT^58A@^chULf3N9N*5*l78o8drwo#dAf2Fmes^Miy6PZ&$5xg14D0Y*>>C_
z!0&wG(pO-)2CSQmQCi-amDd?fSKklfQ#bj$nIz7nWmR@>u;T5TEI`t9O9B|1TRwX2
zd3RO=xsKgg@uifprBpT}M!MeH%E_{VDB;S7j%=OO)By0SBXU`kYuFF*_^|N-CX0RD
zIi2Sk{kU5cUosv2Mt7=h6TiNEZU=q(^a2%{d6K<O?>2xdfN(Aqe=<_5s9GIoKC46O
zATC-cTgvg!SD9Dv1+%V{qr%%gau@Ntx&(0oMG8*fX`It^8^&8ji_HO~1E;8&`J9cj
zRHut!qQUSniFYCZ+8vftDuS#c*5QUV^U_c$>zMM;rE4xi!LdO8d~USx$l?hApOKX@
zH#(AaauLD8bm*LgyG;UQKB0PT=1e=(QIeN;2L%MnUq8tT;reIY;*pH5^B97{ls?On
z%eH}fG?;?CH>khi^it(^K{%L7bdGT~Ph2~*DS`dh%BpoYy8@Egv>!}fF|%u=6Lxiv
zY-K&_iIl6PWv~JtAWS~Y2E1dKS7sv0V23gMn&NiD?2q$ZV{t#)PiKD;-rH6zv#zre
zRS_38YPict{*C!t0#@iWbI~Lq?DK<2l#Q!tHO(iagZjwM!Zw)24bB$kb)8eq^Rb8P
zvmB+W=I7u3G~Gl`_2*%k>#+PGa<#?}@)0JuYm#{z^R>=-vavlM+!nmH%1KUFRJ6B!
zF$U`@lGvlWx!j`8RyW%4H@p$$6Fx(55U_uj#qje71%)X%vxzu^WBRs<<dS#~|E<8B
zo#v^rN;HTx09rRBZxCTz69e0e^F`-Q6o2Sg?-~7@%)QY8TCy%&=yKZ)vbv?J5Z7o3
zShRYP4)bnn>E#er%-#l>87;*`T+=gPi)3lZCOgIOEsALl$Q{9a?#Kl)W)$xz*czm{
zr9yJcE`O|uskJ^taS*yOdBPvFot4v$J8MAwpsrcvUXHYJQ7Dz;?;=rX!=oWXW=VE2
zU)JG{N6@1iKS5d7-*hK#kc53n8lsk{&0znuBIkX%x<$#TA5nhc9jdI>x{X`?1iqhK
zkFrjvbtwr;*{?%h(4*Gs9OBx6AK>EH8}^G92||Q@5hrnaYf;5Rr0Y8M{tTT5^*o=(
zeZ~alk0sKW;>8qIB;<@r-Zcexxt4*I$9ug#sLW?ks`dW}BUpm%_(`clkWlXG?Ov~C
zFpp&4+g!|B6dAD4Cwn_5r-$E%Y?Q>>7~ZLKJJ<lF4tP)gL?QjAU(7RFMEKlMnE09e
z6!$=sG8weKYK2O$S~~IbCm|ES)oqVP<09=|BxQb?57Mz@M8<qTSSOwfFkWTW_F_vl
z+Bo=h;wG`|>Vi&k_)l7L$wpJp)2dGu$I7&-N}Ul!jyV66MH#i178m8_Y|i(g@WOwg
zUGsZ{MCcOn_MJMtj;&GO(Fh)J{G1@38`RI6f#fp0(>xx;4yL<<2~#UaqO3a$gL%)w
z&yl0>F${`{JS9FP2}*%;3NXA}3l#~RW8rO^opAu@)w^~-BkM{<QKic5^zsZuCA2CU
zdBsR}m+8Cw5?FTY2Lsn6|5!}YfoqS?saHvWCpzHl9j2f(uHL0ie`gu1lR`r5_xcBv
zKF#B_#QueTb_22!nI|v-exh?x&C3O8?#b|NWDinD%ykMsd7LLz38h_J!{1I}a;E~>
zQw+z-vr=bpuyb#EkNri}Tk^wk+Rsi3yb;)I!Yw;2rK@>Wf?ag!K2Avld5h|tOC_$h
z@7v*f4_#&kReUt0Aizn%IY9**mqjfg8AA;U*&_2?oW7E)&(E(%N&a-kK1vrVMd{H$
zX*|xT%)3p;NRl&*c?W@T2Q%E=;aT6o7Z{4w1c5FCm0?~yEbNuC^cwdJb|=C&FijFS
zjV8al8Luu%8*&}7DB7`8a*Tnetg0rXyWxdwj!69-v`c}b%S2%DJI~bcFf!3VVcW}^
zW{e-}#<45~f0x_XA8?0%O9w4W;6JSlsM8$7xsx)=273XWDrLKiJ{2H9bXI;VsCr6e
zREd#AU$k?$wg#9QwCIz`%*@3kw>-JvKx_E9KS<9@WP;G=TJry1BL1Ic7wOx)7_TMj
zrF=M=PUIaV!{km|fN*mKz2BFHKW{&Ia=Lf0b96u18v@tCCO_<2>Oy%AkLdDshyJ=_
zleELU2msJ2cBnqJ-OL~X9r0gLA2t;y>&P2f=Q8fguHxXw`_S@5HU?gRb!WvW8%wr;
zq04z3AJp~p<AVK|+cfCr*-2A373?Uzz7fMLO$%UgPBNs}Yc-4mc<g_!2@tl{k8V?|
zTHK;k&LwKT{jLiikeCJ=Gd`eZ06V#}Y^tQ+!D-!5-+1Fl|E)0I-U;&{{lWIZeOeB`
zSxyH84ZCPgW6i9P11kJ~_sM;E%i7Y>jj9Kn3bMP-YvC;G7cvFRA>4MoynOLw`vm*Z
zz3|A`7Za48LhZvBJlBIlZ6Y=u@%Cmt>-z;jJ@^sH(vLp|`EiM*xUb-4Ju!?U=7vh2
z%Q?D%^00$OiXzWwoFk<p@M0$f4IE1rL@7!^R0B@%3Kh{8n79--q&FQKX~xYTfyEkY
z_W2khK|}WeNnZ|oe#JgJ1Y1?pWm=lvNNSQjo7iX-m<ABUti##NWd};k^!z>>7pOEJ
zTa?3h+G|ZvS*PQIiG(`_+u@+lX|aWwY?qV?dR+9T07DoLunc{sdpY(<^RcfOLdu*T
zvLeuyMMo*UL^^CeHAC+a-x4g-k!1Zoa{GAW^yvEbZ>P)j8ix<$1e2k`1ohZE$MZ5|
zD3%vgEp<iPA@Kd@*<}GYJWMA&&rDkWJ238@D27>LORgbs{bu9xA|DwNKrgBUMV;hq
zieBp@V4W%ah_IoOO*tdgh-S>9C8t<Fn-5P3aV0T)F`bz2hJ!N%MkiawgHw!f4JC82
zAo7nW=Pq2t=&k)W9XoFj9;b`qVatq{+%}Yuh#?u_RDqx2yPC!aKZZ@;)iwRG()4^%
z)AZR%*mO|Wbl+?007iBLGI(ZpoH4SPj;X`|07@u?g^Iuz&Q1^&dypQGiym<*oMny^
zcKd9Rv7V6>fbnZ^=mB#}&xJ%PS<wDzUe%j7E$#5-2~vN@R{B9z&Zp(2V(c8V=w&AN
zI5s_<kJi5{hgs8SOWUhG&YzTm2EK7SuL1dw-^zW^Vd5EOW8(fz!*?++B?aJLHG~ge
zRGpLjbj;@S;Z``y7vpSXu5ag(<`LR}AcS+pcCp!VZ!3=!Hik`_uxXx!Yt)J?e!cqZ
zhZ*2_c5-+B<lE#BuN;v!Y>)^X8{r7=I>t<{sVHPxaNup7?kxw1HU&AJPrM@D3a5U9
zohKx-MA*{f<dJ6zQ-C?*THkml0-wOHWqiZ(i!3X}F~o)lH~>Uk@U+6udc&)OSG8zF
zUNee+@4VJI@YO(7SgbnFzBr7PnE&Ow%IO6Fc1^@lz=%(Zg8f1hId`lk^yY~yXF(3U
zMIn}cW_g!^h-BR<@zZwo^<hkb<#=TSomgk6(<0>-l}BYm2h43nUjMS9U{i_}FGR(A
zHG(pYdN-?12{tn3xI(>s1SZWqPT>nRs7Gx6{71TRP4m)>2rdV=vtQpdJwrlpHYfm{
zsS*MqpK!8QBvznEkYqVA5mr<z#yr5X;gd5~bic{2Nt$^R7+*e%#w<*rjFyQSeVU?y
zHOe*LpeTy9KQu#N2y~<3?@tz@9)N$c5Fg7z#PNSV7Q#6Iut34)1mgu@UTvi09=W^9
z;MDg>nl@$2Nje(m=lReX;YgUTVi8-LQLs-)vUiD9txm<tI+W)dhQmTMv7SQBcLhlJ
z@ee8h;`V!G-F=`0Ee7WZlSxMU`R({3>*3Lxj#^d!jQ5|zqvQR2E*<mV&<kDuwGjHm
zm-i<%%&beQgtv5`r@+cG9oL?>esmeDnVfHJFi>VRYjPW}(DvN2We@RyY=q1*U5{di
zM2)QV@?KX~%a&;Lw8ogUVHoS)UQ70rIRXwN8r5+Oay8?KK<ZXbsOqU&kT{z#MSBXX
zJeGyD4Es^3!XEGz^r-55XgQ6SL*T34#CVN*J_9eGY@+UA6YHg7d@JtG37T$wI<No>
z;2f`Q$BN+LPEq$!FKdhI0fWg?##~94Bfy(<IJxgOrP7h^C+$wAlsQQX!!b@eWoMNF
zn>b3{%hg5Ry&xM26}hs0<Gx#wxM{f6A_@1p$*e<oE$pQ@Sf6eaK<<&Z55#efvy5>e
z>k;}mlxW<E3Oh}xLz%B8Aek{yH9~esR71~7kE(J9dT5^r`RN$e1ONQFh(xD>4A7CB
zmlD*H0j1c6iB&uf)VclFs2FJjYPE|u(3Q-%C_am@Wn6foWU`ZRM5ezoeC1+--bm#U
zQD^5{*A|yM|LMQ*IxNtDcj1`8Vmj2<;xo?s5b+o@<}O6gbqN%q2o<r>NHY|emy=a{
z0OWDinvTt$a(=cqNOmwtnBEu_Wo~l#dupelK5*S)Fv!Swbc?G4yU^R?SZ**Nc|6p5
zN200F?#7Qc#F$CB>Ol;gTmb8eB#`~LU@^9HnK=3jjghk`+1%VuVW&DK<Ix+>0|{dj
za)}X!NqEz`CHyuTH!0?abZNy^=29FVTH25YgAR+~DjF<JCuU?U`#hagNA_a785Z8)
zrk{)a{37#mEZZ;=iu;MsosLjxnp{m#iFM`opW{S?$_zM3g^E|97?qE5h57_x3%1dM
zzWA+A<#}J5Mu#@htGrBZwT+JVH%`4%k+>qE<TxQ6aEG5o+{|qtWy9nRmenZ$5Q|nB
ztMso?XMK|t6I!p%l5T=>qdarf`tz#(s5F}M&8}7d*~e8jogRO@QgA*eI}0^NQJC^G
zAs<bWFs50kI37vDPSVe&)L}&d;PZMo<d<A(R5$uPBhSZN@_tp|G`YwISP$4bR~W_S
z&f$xnjE@L84?URzYGJmU*oEJ57t;AOg+)#>CGI!{IW^`2!=>}Nu}452TI~~DHoi}m
z@vIU?!EQF*p#3heClgaHWCM3yE+1rprz5$F3R}{~-b@UeFvbqQ4YRA$_a-@uhd0IQ
z*5rDWnN$1o@$O06IU{gvmN?K<*`o<NG`-E{fdRd8$GHY*>p}7H_gfJV5pjVp-@9Aq
z@t`=9l0UVVAVF%NgWle&#!~K$8+9n1lJ`4#H$UP~l}wTu8?bf~eytKZu}Fx-EMP^6
zt)A4+rOmSJ1>{8_$Vk)R&-`u#hl+t=C0+Q>u`diPLe~SM&p^dNdcmOhu?&{aJr#kd
z{X@q2;5=#Gl36R#va-K4i3hZLphQf-pIV6TfWeb-{x(N7fN@MyWSi17vXO|iBjUN~
zdeif0-%lv%V}3argWOdLC!F@sU5*_N-53<)gFm9Pn(NOoxL%rP8ipo5CXKbY!kM%R
z5tWSYAiuoKdg#|UxJLieQ6dx&L!COwW%|ZwW!N@A0*UMCu(i?FzR-uQL2=$XXt%v9
zY``1mRd2?R1WD1Qv>I1K4~7&G6)2PeK@b;bX{sZ3MNe^U@ENac9Eh)N={e}k=&ijo
zAWZ}Pwf`b59(%`<nSPYk=a7T>cHlb`{cdqoz9Nmwo(ifXxfRnS5@qk%`*NJ&LV9JO
zUOmObC*euJ4drOI*n^Ane4J0NBT3;YwrP0^>w%W3%?CdjPvJ)Sr+>WZD)gyNvfR(J
zL9aAqaT$97V44oy<+Y1aJx#jD2a{e*hHy=xCvT4xexyzw_AD6agtMbFEL~qxtrqsb
zx<!*}C%2Q0wv?)?y_xERyvy1kZ*>$nV#bC00`zWEt;5?Tg?ZhE)`5&twT9xk;FUi@
zD1WQMbg3`w3J6g(_7`rdfISv$XE5+Kbhz)1aLr#jBTXblia{ltZ`e9FhODjR@~6Jz
znxpl~iQ$d+Hpz%(VOn*Ar$WO7S&j0AFp3d!D$xUE{QTcumW}=w`OWnX`#MKo=Xg+T
z_Ev`J#roKw^uA>mU|>_Bh$jy!C(f>kZPfbDc@G(}CBpu|Kdh&~alJ?^dJt-c-`5Rc
z`t0D^IY2C^TueD9Cu5{60tj{9NU=moCKW+}^_4c8{!P!n9RGj9v~>Cb)b`u-13c9a
zMyJBMb;lPrtrm8vk-)(rBr@jUaEadBlr`@v6Zvh3xwnTZhE%AM=Rt$rtTFG8q($$H
zO3$Q&nduFNMp*A+Vldt3;CrR9uUN*%*2T3o@~8+dhWPbL)C9}Q#iXIWB+FLoWpV_=
zWrrpUO=IL)hkm3`)GDpPsAaZPn2^g61`?nsb~YWnnPbj2V3uC3OuIYCkw;qYc9NPE
zkP?Qc>Oc>71oihACb9E)+V5xMR=1N>mc+pK<YoQpKCBV{FYmggs_;^fHG74NA*Q9K
zsO{u}9ke#0B6r?o*LUc~x&!^(VYcne6dp}3ia}4aq-#d#yyW1797quK@V_RUhm#;7
zu|>Zx&WMabtY_CYNJnCQOl$@cEGcV_y|E3BLP>ISbpodfbigDuw0nbR@rc&B%adz4
z!Il)O)f7H_2>m^S={H1}N@pLTkTM<24B&(-`DvPuc}d@A*D+fM9XZz?TY2gtSd1K+
zM@c2)Y}ibSkh6la43t+43Gb?0EH-pL=tabFZ+l=V55iv<LN5STEe+j{+G5(&+k7&r
ztBPnuq3If()|dyCO0;6iic9kj{oxL+`P4d_+P(yYZR}v+t&-lq5&!<aLAmuQ^J7sW
zu45-Gh(fIV3~9KGR_;6-W@8W$OnerF2(ge%Ir7j`hRE2@7y<P7Cq*iNc0S{`clc#Z
zzw!1acN-@;kSHSRn-tzdL&MUH@WrHckRG&`9w-$Wy0<<`x~p61`26iJ8?W?lPQ6x}
zlnO8Dj-U&kcvtoSr~JBOl>{A_YvP3)(K~tXoqKv$V#Q3DCWTay5QDLKp1TOMTvtX(
zY2)F<!-5fTncU-4$f0<nV*noXF{TSwlmh~6&R~Jcj&n|hoSCiwj&MnIZP9T6Tsca+
z#xKx|{Ngx8ijGQTVF#8CQek-#E$Y21F`xEr?_ED_plRy6++io8NwM9;JF%@g6dyRw
zFa<M5MzWQ#{$nEH208G3KmJIAn>~C1yOx<2YsvOR*!-T{rm*K^)s)MdoVKO*fHesl
zsGEEeI!w6l>cXxX)&Vn&yCPK%vo;yC*jQ$tKNN)TYC6hi38t;igL&gs#C70HV9<~Q
zz}oKcR%dDWZmHc)e6KhP-*fLdXT$L2ck!2hoa^Q81-?uNY~w-V_$$n*=p}C<ytJ7L
zd~fIa?$Q4_Iy)p{^UUvj5`F#I$viI);xF%qF9$|Svvo!qcJTrq5z0A#9Ot}2obyI-
z&Ktg2AG>LmzikT(2n<Lh=Y%{aU^*hb!Fe#6S#vnuYw7S>HLV^^2ThBM=8$z)%}zaV
zGKp#Q*JP9OrkDr%yc%I+7j-G3-S2kTDQ>O29!}DCa4RZ~N9XqW;7{f*QVRB(xnk`!
ziWIDxp1m#uS+3gDr&x1z&49ZCFG@=ZmE1d|V&A^Uv9};tibsE!e*BRxCk*Kq)RntW
z<qHEEiPyawd#Q2xPRYlf`WVH5e)|LO8~-+#wCA7evy)D;e?q=CcL5roa?YLuJitV}
zU<A~3ElOn1vlFCr`zLmXOehB~$L{<VDm3R^7v-?vr6lEagzldlfDa<Q3McVUq<%SO
zJ)F#U1T=?Ch@uu_ma3!uG_%W`j~Zh)YZ1+1lq3@_;0}!+40L1vP!5b@s5E>NmuoOx
z2>`h(jNM0{Re&Yz6V+cz(Re%XuiHq<Oc5QH?cwEx<N0X4X2#?-T*c;R__neV<~BOd
zCQqmv)Nb%0KOEBz!RCaw^vdhy%~ze<JfB})zv@)eJ_0G+AwBJRfz*DGrNikc+>rgE
zc!O?X68%Mra@HsX&f+k`z}?LjBVzO8fO-P?_lI#l$yzYs-dP9w)P+TnXrPh+7G$FY
z$s!$_q;Wlo)#<_CkfP9A#N3`vic@B6jY}Y|X9dp<WAS~vr)U)@d~aM7L}x@_QWex7
zhO#-}@}ZIBE1S2$OqNpZ`*P_V7Tu^kTX|2EWRcgM;^Pce{&u@M;+>|@WNs`LX~~3L
z1PqFa!a#IY>?JE}U6KXmnMQ`bD)0#RLoU_#r{*LX;?2i-G034$l3(05Bf_6HUc_g4
zO=pj)WlBQA$ueo6Z>Zw44|W;D<6&%6OPkqO?Q~YxUP6J|hR+S(`7-*}!Ql%yb5<zQ
zFPXjacabM9_}<IMlWPnHZ1FT@Xw;DhXYsyw8v!8kY>Gkv$*j6%DhJZet{sIw(@JE6
zg59gQHJLXKfVj81zD|rM1Yq%oH*YA#E=U~TCf;(B`~2M<7TIoIG-uLej8`;}<q}{v
z4A8U+iP8u?7Zok45{dA8bQC`%pI?73QaPGIC#{3Slf9=uu_KDFOG7r`+hplIi8e6l
zCDgwxiAIjPU){=kS~q32G!^xX&GQ{m;dCtje|WIlR{6tm;Ir$S^+i&L>I=Az+Kv{{
z^039s*2W-cn7~5%{#rTcwxU;@yPOe{!i;xOrO>u%2=#^0bo&`@$)~rQOm9Vah%yZ(
zY=Sy8i+*jc7qi5WD1^?)Q8L#%lW2w*3gX8DSrDN*XJrXJ<}9pU!p&bIV24<1dUZ4M
zX+}fW&vp-XkM?#tOE9DQ&gVUuA%T=-Y8o1$Ee05b=jg51%lb)%8V!cd&qvz_&vs9@
zU!EKia_Wch-|xK#$2*5dyWW%i-5)!*K1ivjQ|$i%SFm#$+n<kipHt(<KT(JJ0e7gM
zK!;Yttkk*ydK#i$x2vYW*>Lf%n;u{P#PW0Bz~mLbAyVTC^3Y%M)T`8EzVL6<kJS92
zG9S+4Ulh`WTD&Bq6L!*0HcB?`i<VHL8MOWs?{otOJcDXat0%*Zv19>#c8zYjOa2)^
zIRf#jNs1uRffi-GI#^T)_}h8<x(9tBWc;3DPAe5-RBY{pZSyUj?$)J{vJD8@Toy&G
zS5H?;ZrfEivv*6Eq>aZE#?Hvl9~9|iDIkb?neM>PSTG!>`IZZaS+iJM!Kr4w2BmMb
zWLz)#x!A}}O2rBn;N?Q=ud$R(#Zu-#^H*d}fM1-n9f_#w5#VHP-Z$dwZJAUFeFEX7
zo3@N(y7+A_bD#BJ=%nM)a19s?ont6Ykc6Q&m`I}qmqL1oH#-0Mh~8VFFMd<BR8T|w
zLz=;#Gy7ZjeQ@`NZ_{y3;lbQui+HHAU<D)j-5NiJ$rwaqa+Q+7z4+r3LnQI2v1bJ5
zrQmMq9Y9Pw3J0@Qg?ZH+cx~5Q<w_5c-)U5N-xrtXa5OuJgXro;6n*dA_Y&3esyVtE
z&2A=T=tpMQE3fiN_o7v~Z3&6dsY5Xr_oKfcj^6iR5e<6PMYLS}D?xr`qXW=@|K4_-
zj_xmD7WLqC9n3$vq#3cpGpWD9xImTX9~CPAsxb|@opV?phho{mJ}rCx`Qy7j2hKTO
z&PL077-s_KJ$$Q)O<oM&>PPmI+6b;KK4t~i>PI9@Gvir2n{P-T&u$pnZQO+Y7?971
zpfzm6Tn_Rcx&7)sT2riFLn+yhfbjcXnpMH{Q>kSXYxmnrv2g{SC!aP-roM8kk(ree
zG?puM{HL$TQ8G-ua;Q$I>}U=u+AoO*H}9AQk!a7bo}2fJAo2u#&oi0@-EvC8mXmc!
zXeU(W1XUL4mEqptKffiq_^T{GznBQOHXR~o;d7g4+L<7$QH*_7lN+Dnk2sKjwkzJ;
z7Jr8mnpR#ui2au2x&Qn_61J@Enw`V(ztyhs>7FbD+r(Q$B8qtq7rGb{!qsPQm1EsZ
zSiN5WSQWSa>a^#nJjk;S->x0ik014asnlx>N72E2AE+xM)#KtH+~Q}&s2q16u>bSR
z5_38sy<sZ^YB#9_FyIxNwpFoKA~Ns|WID-=fl+as4c*ppcq={~JQBKVlGxw|vBAMA
z>_!sKQyO@z<dY6e>|M~PgrkGOQ8X(ddTSuzP_$bIv$A7SkJ9Gwzj6VABotC+I#|_G
zHW)04Z$;_`p?vsgQKTiCJoV|2vgL5vElG^TtCgBo!6esA;boALFrkjrFX&GPl)CHi
z#oxB~PvQT2PfpQ`n;p=g-Bl*W?7slz$%mP=e6n|R^3y41XWEGV0)1=-KiJN{qFp}5
zA{GMWafa)|Yu!5Zn`1*`M+u*G`wSF$g!iXs)BZ2_HeWs9B$xSHG*F+BzrHigYroC#
z*p!tD+Bp|!87eg&{U<Z=S$?j84-VTNIMN-^Ncs0c?DzMk0iPMUQ>OVINc)Czwd~nJ
z=REE7UW`_^<Wi{Cc=U`1rnL_GMzw^t8_0B*a}?!oV{3f0W)HLOr&cW3J2(mY<-Vb_
zaxJHLV>jtQK+r97r=Dd(;^Ls2hW{=)^u=UNN|nwYoZ33ieY*+an_<EQdDR37P#O^1
z-z*D#oQaKauhc^*sf8Q+bFc&6T_wd}#wjI-AfIAM6ybb}(e!$W%BH^YuEEc;ANm{Q
zEGoIE6Z-a=%xQiE^v_TBo<6<%Ga$(B(cPb49_$?+c={Q08bbVgzZe2WlpSV&-VfF|
zXTVG(fR?cYIJT3{>SiS2hJLdqp@<qFk{ZYLueyrlK=o2N=<ccscpSn+kY*v_-b}rO
z3C?$pp{0ab+xMhcpdb3Zz>%nz>)b+TiHPF2hF2{d8ZZ39kl!7+;K%<)^!Me#%j4ZA
zfGTaeE0LkoXYc0JRmCM*aQ#lG-e)E#p9rLNCvCp&e+Ne<2;Q6KMo;+>hsGKb<~cSu
zI}tJv3#OPIrs017xZ{y5U(Dt_WI9%db}{)EAD$bY3KLIm)zzN>taV33X`AN)uDyNO
zI`n(If2<3=WRx@&1#Mw8GPzRG$g=2gjX*9c%jqOjig>a)3`{X&O6x8@(3DTcrc8#8
ztR=U@f+NeZCWu|KN!wh@!=8;uGNZ72Fy=EjE2Ovyr7oD}oC{AAf{qiIl4TXfc@x3_
zudi+yAI3mpbuXHn64aVgxzKNy*(J;bA9vO};;(Jz)^7hk?rnhMH(#AjSp2N;n_n{Z
z!W1D^!0K25s&hN5qzUmMsh<jXkUh=@gUD~j0d!++J(vn0?Q=meAGyLZ0cK{}@9ZN4
zJK?xR>IxBNuH~wbZdBmg?%JOX0KZom@iTKv?0auidK_bh@xWZ&@GP5PMAjKaQw{QN
z9<R0GNoLmh!k4EOLjzBcQW<yDNS)h^E2aArlkk{72kj<YfqU?oDVnXO8L80{L!hK}
zULcH3vM7u`%d${C)ULn^MtuP?y%HyHdkgYs5+L2pWkcB^EA`#@M5<mQ3BNo5drfP~
zn#9lMe6Woj;fh$xqeoJD{XX~#1#`}XB)79M=%E|m-;lv*)!)ru*59_22i;9dwfpr^
z&@jlbZnwN411@`)Z4L&uwaL_LFLZqtE65g`j!{xaao?Wy`DWGPoE?rvL`lTQO{+pm
zPdp<A)m#=^1BJGcu_Lw2Vt~SP4qZi_2nM+K0Iev2&@`9)L9;N*o%eVg*UWuT1jD5r
zs^5-T*Q?*1pA*gOV+fu)a9TDras<sd4}x5_y&UZpHVIGwNHI#8#PqCZb#*gt>8co<
z&)uc*!EeX{yDU%0nO`lkPjy_juVntgB)&44FozjunZQYZ=@l?xs|>)}fg=LY+mDj}
zFAC9M!(7e{1!&u8<!}!?*CS~znIn~$5Pi3tjN>oQi+~m6b6qqc-3LXuIVIKnhpbeL
zQS_A6lVCf0mw+gMkl&Jqs$?{(ZgS%hq$HVxO-5}GqG<6m!kT^1?nDk~I3?S<k;K_d
zftWH}q;9rKvniVL9J%TY({b1QK9=8$kr-jA+Jvf@lx%R}1rgaxR{>~(#YKT5k(3px
zM2eQBC5d^1EZvYD>-V8^Bd@|3-$7V=`*!7)Wcij>9%^{pp3f>my6g#V;jcB7^y<<=
z#d+7o4J;p_Dh#h!KY5mcv(0;dG3hv}*I<?USAgla6ma8U`)I*doO2s-)D$yp0zcYl
zO~NY0%ppmU?xU3e|3&Eg(JI*nzblHysHxpxF?l{zp08}f=Y!+FTJm!&gOopce7yq_
zDkkQ~bf;J|XCjH2%Z*Orecz0iw&B!MkCdUuT}sRCazn=UUy=euwQm_?I&M7=uqE%b
zgPn0L9)>MUJcU=+OxFWcP&mroE)ED|MyP=%zKD&NX(lkX@r*j!eX@6ay8Z0g(dqHa
z=gOB#{qTJ6K>1SXAGUu??%5ySlj{&>p&etETc%{EKv`M}!A~<6oAfP`^W=W~BtXM9
zV#oly7D$N&+zzvSem>65F}JQ^E|^`h%my(Yl=98A)QpFHh%@p5p---Kibq!dTJbYV
z-qj^EC>fI^w!bQ5A|yl|qz4=rgrWxpAHgr~5H4ezm3-K@)d7js!l$e7)Vj}QrAc}u
zsr@lJ-!DO!C73F1k_s<K9(zOW79&$V%W#_OYwML@Brb|9>ji@5V6bj(U`3AW011c_
z2PATZ5AFAF>HB^2eg5vZf2{9*Yp(7+5wT4B+2k6e*NG<%#wa7Z2;C)rA%|R53MYsw
znXf7Gol*RG`c4wg3e6E$VVfm;c~VSL9s3pc7mnOj(!pi=4lW}WSX`#&i1S#_uo|3(
zujQKndU^alb5e3$8d=gsxx!VjBX&w{Z+5DY|F#8zcU83%XjUR`f2d@oc1z98T7_QP
zX=sAXWCnE}+k^9BoKG$;H?(vE|LK^!V**F9BdkTQoV@310A)a$zs$0Qws&t=4G0*P
zn1g=r>C?mxm2604&9eN1s*90|y2FVf>m}~RDk+uqcJos)W~M?Z8(b+%ypX8e=6ICD
zB6*W^y+1#PlIe+^d}Uy!ROrCB7R>#G-F>f-D49j1gq+F2@^cq5h^e%&x@K~K1dk+G
z^zkeDrXznnw2<dv0=Ve-nc-Wp;z)AX`hFQJe|(P_8H;j4e%FRxdv%ZuFzp0FIGGuL
zZ)PloSb5$-<H)?EJ?2Ln0BB9JewwSn1^9B<LO`t~cHUm<Lsejjh3)tDYKm1A5ek91
z^Daj&>i-8!%;rYjAhUgGOke19$=;V#uW>>t%Yc2RgxY37fRMcmvp7+jG)|yQ!L(cn
z9dD{jWPC9tDd%;C<=dQQHUWRnA@TO{_6xh#e;_Z~f|Iwh(cx3Ky5U>K;kS0Do{tJl
z>$l$%Z?MiM6FU*hIzcY*alQ?G|FZr{ewAV{#)UwB?A+!a6p3_9$W)0DxhX~+=8m#C
zR5mz=3NN#gLPfT0Z(<_*@!CRorsPj=!wdxKzId?gs0MA1F=-AY5`ZR={bOp2W37en
z(}Cu;IaOqVEyo0O9JY@6?`WG@CF}wX!fxDXsj9v})MsdyuyauqW%fi9;;<i6T#aqD
zSJ@pzu`GQn#0>}NPtg%%bu=ytK)Lg%^%nQ=^{X|dhT>hdPl7BHf+ZvX-sYDX0m!g2
zt(K<6kKOe^lEY7=hNDj3?Olssa!271aH3g?3H9fUnSr9FQe#MNFAmgvPbtYM3mJ4<
zQ(?%yLE<m8Yb-CM*a7Sk88pQYEJqlE>c}m9f3DOt)T+~pyR19PSnHtv!r%N2FZ|8$
z!Uy2azSC`T=IOh9kf-Boea+zgg1+<QTovoeJR`d^(R8xx<nE&KZg9GX_Td(49jt!e
zmeN^r|LxlwoAVi0hRZ2i?bxRMCXj{qeC&e%KGsHLm&l#!GLPCIp4R^A0mlc!3+WiB
z4lo+D2F#9NKo~DGZMv0e5(S=JUioYuLzs)yCD$fO1mwan8UthvbOB<44PBf_%ZL*&
zWv@7kIq$c{8^t*=x&0n)jeP>0>F%(#30!-w3PPr|lTjuD|LnROQ{^D~2<{@x#8`8y
z8TC60LqbwbkTwXgaAQri`@}rgxDbHqRsQ;wY7x86U&pR<GtJl0&~f}MM1g5`A3=rj
zb2CbeAGOb6o#0x<qFvrxYcomPBK6xX-NaSJ02$11b+y|42Y=2L$C}-DIY}~(T)6Zs
z=#wzKwkdc4uZdEogQ~VRNb3)zjjYH+V4eDX<d0(9gm;JtS8DSb#4jj9&|7nN>Cy%q
zWj!R7MDT1bp(Lf8;<QF2KbI)sU`BPjFqKTePqN@4mY-?C|H;V`FH0tIT8^PS$=#GF
zSvu%W2PRuD%7I4Cq*zZN%T`!5ZoWXJnQO&&#>Mpfg6<eQdyyq<hp1npCELyMxQj+D
zjCYU{cX?M7wsH2fiEFT`N2a(2UdPZs>=qTvAjZHEcv#r9%))DKTgzz?`LITi*3~l9
zJ<CEgX;cDHy8aF}-PB*jin*DOcL*mCO5eGwNXK)#DgQ8g?o^%ia)i0HX;Y++GrX<O
zP_8oNn2iH`K7_^zuE!#rbAZC#JOzwAy(-3U+?5(Mm|PXA!6FwYih_M2XI2SAgpOo5
z;cpaJCWcp0nWfJ>Ep!hi+i~*S6{a57oTMvPF}%J?uPdtK*TC7YV-oj3f)bg^Nm(`F
z8D0@Z`=<}a6>Y8YrE}ZZg0$M$-v5qp>O+M!uSNAi#+DSbS>#wT5Rpo>SilRSwCxmF
z7E}8IWK?-*9vIV4Vs5Nw`CE#MC<|oAdT*ioRApH7S9;eLNfGe0{NEow@>knNt4eYo
zUy3O-Kc`fK*E=)%j9H>aw55vqn3zl0&k<JHOhh7&KSV_&EZ`JZD?~g-e`!%dZ+&I5
zdi#-IRRBMsx>xnnNi0MZB=pr_@zvQZywNtBN89{_qkS1+O`{eJd&@*Dx)eHR!aFGJ
zt5<%PmKUBak`oE>zEF$rvun}4wYbG-oWI3-kiN|l-rJ}=K_ly}p47%fNNjhz(@W$N
zim@q~3A^qrAu^**;(q`QvC5`Z3mGKi>Y&jNyn+c_Rbk!c#wZ4<#+Ai)!k)YQe1WNC
z9KPgg(9SWV=sWRO@Et4#aYa=tsA4+4^x=W{d<Lf6em}?y)OO%ST_7HBzx<c2t7amz
zT+J|(gZI9e&^ieR-FG+yzax*2PdI@u{bs&k1Ns|lKT`QeI4@Y}ivr;9V2uutaFJ}A
zI#p5$O!$g5x>Ln;XJY+{<&s&EM;vjkHl__w)xAW6-&K>k>*i$p2s+rblPyMflH=Wz
z)5901vSj(j=>}jF`Hp?!TP8_y<7TK-#hi!<$OolKr(#D6KKw+5yCUb(F|xn92b?lM
z8D0bXxYi4p%cNdcU^N2tC1Rdb1kSNYb~!eMvUfktQbXiJX4P!{6IEnM>LT%a<zhlW
zNlKsd9E&UI1gs57g>B+z4eVD~4_oMYU6$cW48Ba~VMEQEr@(onlS<_q;8M}hIYEiQ
zEQXjomj4ig|5`55RJ)hG)h(=lJhSi(r9d^dKmr(a<v4VL7juW0-l&iCM1f2evz4?=
zA*q%I(8@-;zGBhh<)X}-(bk}Mk}4B&$tMJh$-4s>3oJy}tB2#PNUWlC90YOVx#ZZ#
zG85i99wfQq&hwR(PROD&B6A8~KAp+8-u^}F(74R_?c{#E`4OzP+S+G(aM*@m5z2%~
zu8Chd*F@yrD?dbhX6XQO&4_U~q5^8%)T=QZC>)?#h$P%!^9i&($SUSaz(_2i2wF&H
zYP+OpBj-<;c*#X84A(!KC*k}1t0|-6KkKI`b)p=_Y3>M7H#{LqdgR}=&#Oc8k*eVc
zl$L56+bWHoI_Gt~nj+VpK`$X*u{23mt!4s0q8hagqX;xY1W`9v%vahCwe`r7h83i9
zk;b~jU{D^Svm{Vkn(0{$XYhd=H>N>!$2xw5JNorHEoDA$6)aRKdpp~S_Gdn_P{&7j
zIo$1S673^CQ~Wd?R`ZD+JoEWbc^ar;wTtc?cwvWB=&{+*un{#ZxAG~FgY2wLqm|Rk
zrCQzfEXJt@W{m@0=EH>te7<+^5d)_079Vi?$Jzno9nC_?g&70=sl(+e9yeozu7{v;
zb)yMa<*L6SHaph!Q=qfQ2+!+Ce&egXX<Op=y8o9dx>F$|f$kICf|UK*Q#irRDppnz
z%E*2L!s!@wnZ?wlk6U)?kUOQ(@TI5$Rrj)WK@ta~8SY2E?~z&-OEe9&@<hO4ZqZLw
zKFjQ>;r8f}CvJvG_im=GGyTuj*vU9A#^ec~b3H@M`$^6DN*k_<K~AhUG$^|@lQJRe
z`S?R_W^5uy7K-ju9QTzJDmDF0ilUl$pwX$zeCBrUG9R6DvtxX{Dy?iaLDq@O<-VLa
z3vc`iVn1v);<jB)_s9qfc#o;wxtSN4+m1!O$zowbX05Y)u<Dk9A7+ytDR?eRcP5*3
z-J8*H0xnY8p<X*KcA$nSQe_DibqVw5zidq;zuBzorxfu>v+qVO)XF2ku0!-RHqILy
z`yh#etxpgi`6ymkUkl%S8h#dby1>s2$BQPP3;f*N?}BD*bzOBXY#|tYzqw{N`gl*F
zyMzafdM7#m1)sfl_X{a7J<nGPW=Ne5U%~`-=*DZ^jw|>(L3+^o4C!9fLnm1#he%IW
z_fsKzS63XJ5M8HZNq?MEDQs4$!Iec^gel5w9Jie1*nH6af-KGKrB51i^vgp>W+JVm
z&YhMSSq{e;S}I}=skAy$%eNE=JHeG}yr5sTy?yfTcq!(_U`J0|H!1DcvbyE?`5qU1
zFK?-3dBFzgU7-R4Q&+DZ&7R(38YJwx@N2ceyvhGd@V0uR=kwg?dDD$f#i4*-0oLuk
z$qybOPx?yFKg*R)&LQZuD9PdT()!AXle9$-+!(jHQF3a-dVp{prB@+pMM!7owmDZ3
zg2H|Wz#VYvd2-arCtgAHu0cD@2ZA-J;}df(%@Gxo`P_)glS34+%x9U)txrdnE5aLK
zqNZ<(SE(0Ar#}?^F&zR&irxS{oN_)vNuel9s%)?F;=`ZswF7CjFXt6n%MUGhM|`47
zLSXii%KUmUK;-k1lOF?}4945q>61~EL&7wgB}lBBZ`EU?OXFzhN~L7;X=GpgHSiI$
zUOW6%9EK1xb8_+M*7CT1Dsj%8VGf{i0dfR!t)`p0-oHavk*mz`-Mt*-C1jw@9m3Zf
zUuSiFh>~zv<~?3A-(r~MocQ}RIm^$nhD6qzj_NuQGj)%>&WxL~)otD_&0op(i@n;N
zk29v`bgyo`UF!*V)x@AK&aLFHns33)`|g1Hw=)H@sqihglX{KO$Vr9U+Fz5i4GoJc
zj?cYH$I3x13=wkyXKrLKns<;Pr5Q&#3nXn+oLlX^x|?}ny0bA|QY=Ahi+#!IRD~lU
zZ>M1SmL>6dUYitH!=fG95atak#n0@(QfejlrnJ#CW3fmVM#gH&pg4<<`7-KQ{0|<q
zqM@ge1_2ULM>TAAsQzM)uDI{eZRI?4JM<o!uTB}ewiV-`I2rjHk!mya-`8+8iHu`O
zICl6To)kYz{eu1h*{NHs?waZN#5107RWmLJ-${(y1NRZMj+6=01xe+d;H8C1*2g|k
zAqmUc6OE)~OG|-icfPJT>>PXInncnQd`FDnukG3MGa!o<bz>O2%4?Cdxc`iT7(v@m
zla%npud*lei1OmGI(Gh!M{bWfiq0imb#5jIn!rGyh)c+BA%3nAJ`=3itsE8Cvvq30
zbTxyZd8C=~ePJrMx^<DIK-aO~x7h$SXdplM**{6f;fjuM5B;!r@*UNVJ4TylIl_D>
z#4n|WRZhp_6tBtz+Pv6QAx8LF1~#h1JBM18rrEtUa-}A(e-L`1v&(cO{g<38LEMak
zOG;dt2Km_-FF6z^$V`r8iF5Xq<i0~fC*EKc?X)s?+`f&Qi?6UJW)x|+apIV0A3b7e
zGnRD?72MM~->Y1GAbAd(95CWj-9n$y$S7fD7t`eNbns?}Q}1DQ=b@L3RKAAv%^%$j
z$9Ji86XU-b(S}X<rDHHLEc__z@1Ts;^2oC`Fu4LJmN?cIENu3Ob1qpMuR6)5?`Nln
za@6xv55*Q2HIyaHpL!%>3PSMRd=U0D-IxKhPuG7GP@k@Q2OU%2EJN25?oFy&KG{3k
z-8q3}QgL5$^NRoc^zi71?V~3(zaH)WZTIMS7t5|uG0jsJ<zT)KnnvF_JUD*&eD~<|
z<fj+#ZGUg~;G{AKzY)RgV0+&Uh2GTD%WQng-c4b-I%&nC#_0vX3Nx=ppQ@K>KU&M&
z?1)-D&d&4UQ*r)nx8nUS<8f~2<SAK2-)F8L-rJhaY|w%HLb{sf5q2;0iBQA22hk4c
zBReMXpjwwadtjSEa^8_$D9~U~8O#)Nt(Ip^>cB65NaCyUdH0kmO!If5L5-}T^h(#W
zt(V)WAa!E@YO~)soytBiTn6jNZ<_G;F8{-R(&xMi=OoT0<8SFeYSc0NzuVj>xgCZg
zy~}J!#VV2E;L^yXizC8Ou9+Gmk^cDY30=Idmc2xUNd-$XfGW#n<8k_@-e&JWRzU20
z5QV}uewMirzd*jEGd|)1zSs-acajip)(gPTjWM)?U&&`J0Y8q_Sm34d0v(J`GdNeL
z#9f|hUb&Vu=`POj2YWork_dA6c1V-#+kN?ARtFK1!yVw%WsGrgDNW+<hm<4ozG?En
zL~HO*i9y24Y;sZbxMHnv@<x-#XHcIGMrjox7J_q!8qT0I=5Cg+t6K&);1;tiWd@4|
zkr0_!+m5Hvt_G^b!Fp26H65mHnwqmc+)#A-CRlWu4^PjoCzun$BfGc$X*C^owsn{o
zb7Hp)d$3mE+k9P0jD4@XBlC|=T)X_(7d2B~ot&`um0>ie|6$gi7(85PQ-XrPzXzaO
zg-{&o{|fLLQnUbIV+@jj^OFhspH9gC7y-X#BT#e>L9T^<KP$e25_;ThddPuR4k1?c
z2vs3<osc>GFpD@N=iyUk=8i1iF`GJ5{pwl7`Bp%jBhH7Sg>^oN^U>p{#dw|>d_sCG
z&xYBRGOu$a!-Q)x*w`^=L~zv)X3$a98Ah*hh%s6K0@!touODhylApJqJOP31^x*Jd
zx0Bp9Gl4(NG~0GYr0sB)2Cu#ok2)LpmPc3w`g0N9n?g4%3^C3A5WqBKb}lG3QCM~g
zSI<4W3Rx-Y35X$8sL$4*A*FNxE1lpVv}aUC2<VY{ah6RZSz<`A4WVgHZsvj7Jf<$M
zsKu?dpn6ZnZ3mv+U>@*Q%n4Of!i~0Nej`z6Yq$X{>)^>3miw=#Vy&Xh2NBS%Q<G$c
zCJ|Lj)OcH4M~QLvk11dI_`LBx`i_Uh5$3xNjABm!AC;Q%Kjx5$-@84J&hy>gbcR<8
zpo&+W$j?kDV13<-q(!|8iV%C$ppSDlI@@_fszfRmm!KY0-;c|cK^HzN80jS{Tn3#)
zM5viP8M+ebD&+iKU*a%41ENNGd2^T&#r{~3)^)NVM9nq)DIi+y%S-XqaF@yPqZ%D%
z-Md3fFTbel9*Yy2DUD%Kr8x7wMY7lInLo+UJ%|)@KuV9Z$xP*@(`|{iE5_+!_>~E{
z_DY&bt_G(QECpGC2RYjP8~wRv6EKLz@@JaS*){z0#+V%DpXGbvb~w!ft7GZ!3^PXf
zsR}y6IlaZwy|_a@$%GXJz<!{ZJW6G5ztZgNqkxHV@kuHfS&Em$dvqr2W$&`mCA4z6
z(@YI@$C7Z>L0DAs5Z!h8&qwsm3Vm_SFcl^>%BbcBHGw}H`&kbudxTIJ1XPLW_J&ks
zVK})jJ#A40KP9EcoL=Y&N)cgaaMz4YfPzd=CsGyNuuUIG?W9XCIz4tH@R9HYR^9a1
zUsY3;KWPq1rf$F5JO~=hb_54%TZTmN0#7ddx=K@Ouh=3bA%Z|Vhe~#k_g<X*JVlAT
z(ra)gNHXvv+#=1WFl@41Hnn+MMt{VU^wu5#cT7kY8WeRA1E$V}$9|d<>2YUV@7H+z
zQc8%{`$1=QbG5a(%wTPDB&d1aysBoP1sqJ*zBlX_Xro86LcJIt1I3AZopZhO0X2?z
zDVY7OhPux?GUa@W&tz6Ns=Be1HRg)OT&WcI$@3{RJEAplcbCNz{fzVAQEDT~P_Mjx
zjo<cpF&w6N?g2{*6gQe2{B@n=Sb=0JRajHT(0pca1@36mVts9)`P8~RH#0A)Zv-kG
zhnfMZ>x$w$eoPr>tl!LA7F2A;PX*oOO@oT@H)R?+tge~R#0q|?VqXygQ*p4uB3@0t
zRfD1L-@C&J@cT^6aZ*%ik#a?j^S3!h=bmMKM4%p(a^|#`lDehhucR(}4XT0l=$fQ?
zQ1@P6EbG<%F|PvVN`}+N*GIs(w9x03t^z}0EZAe{HCVu>>|<v|@2zZ9F#$j9Mtn0O
zH5k^BB&)|73?s$7=RH@XyHaInI@De4gwgtCvy*SBnW@a3+^4TIU8?4C-EAn`_95V<
zX7L(TX22>GwBGt5aM@eQ!*bk(|6b-p{BQbhEBWQ|Ph@aNeoY?#w7>h~tK=78u;IV^
zd(ZbylA_<oNs^lCmCJbMbWqmWq2ddqnSYzX2EC)SaW&-3t(S{yQq^GGwu|p}nuXYQ
zZATS}M)m3`l47nMs_iCuGsz^-KdBRUTM9NMc?cuSxf9MPG}pG&J7;}Ph_fPQKA3Hg
zerO?>iOd%Rn+A`AME3TN2n_h|_Yq)->sot08Cmd1iOTY%R$?YnxQNIs1YnePlV$p|
zQ<b6_M~(Ybeu=?{%I>hB^z8d-EBWY#!sk=UIrkQe+}oK-24556<;jS0;v{vl`3B+{
zF~6bM{fVW<e=~_rGirN%gA2V52D3>BH*kIw7L*S~xW~jK9xFF5k7gve_k;ZuCAcH(
z4w+l(cNTx;-hPTXx|?42mh}v)ijjO`DtvQ@u*vl;!HShdknrd8KywL+3`v_jJRMr3
zem%uZJL8mj8owZ$Dx5I6D5fePRti8F3pg+3EbFGzQXKoJ_{lIcftFOK2DoRRcNW=|
zplFXxl{swKKK#rj%hYE{nkCQh?nU-7m_5<3>f{5x#4KqPbD5uEQlu*>7b=L3Szb5*
zdTg;iTD+nGP!y>RtU5(rKbvIFa|vV@Y^~I}Xat<s+dlM`zMG@B%4&be#BW5!=yHK9
z()Bsjf;bZ<>EJ58F8%2&C*`!;#klnVBA-}mVJ?<1j_BW2hXDKYyx<ZZbb<*N7el(=
z_;jk?exIs`&wisBA>F&r$~iAI^Rj=P#oqp-TrRMpn_n#i4lU--iMIB=W_3%`wZikR
zxm14ZTf!<tKG{t%Uyt)q-+76jXo;+{N4^INpHEEye?uIK_V?K}OtLG13d5)?W{Bi-
zXe<H&^baDdTOm6hg;rHwd>Vj>V&mTnW}bqB7fK7ST^?&2;+jRLiO>@yWd;2eQz)>v
zu~&oOMQZLexvyjCyMgFYJHAKFOg3NHw9@xpb#5~Ov^k;cvg!ldib;ggT8&lG!kp5L
z$^n?~KAA4U6eGGw!h7~C_R`a<Itk?S=DGK^4ZEw$>(bqg>EI|y1L=EAUV3<;QZ(UT
zs<NobGDlVLvZ^@lF=qrw-+H9(g?h!nZNo|F;SP#qiH2ITV?`wYI_YB0+znysUY~_~
z>aVnPi`BX9o3stKQN5^Zn>2}KF_BWB7V0#ltRNP!@M?8cCaz@lis|XMlFZ}6vRPS#
z16YK|A_^5UM)>*TOHl8JkyCB-yl)-^Sd6uL<A+vl$@@AnCy5?Uqy{(^$}L{!9RyK2
zyv9T~Ne^om0fo*mODZz%l;cSPRf6=(wK*kd7-M9$w$;Sua^OF!`HsvD)lwNrl2!5x
zc?17$R8$!TSR{Hj!Aip`lqn<NihxWHQ3El~hB(1g!xezd2HM8}&H-<=0zK?=zLWCN
z>~<{0k%~rQre~17`-FTC^!6LDKKt3b&%pg4>%-QWazcSv;^Q~TF8?5`5Vg`YbMSPW
zIcV8~)v%O*8UOTIIVB5%&%-Ru1hhuI-wQ|8#4f!bz*;n4!MFV9W0*bxBh)<SKUtxF
z9V_Hc-=EyjeB971h()0GCqp!wA!?-4Gq|NWd|>u>fAl<H;CrqA3ouFxdB1p!Rm=e<
z3>c|%h~Zma`NK$%%x~)s^DkG^{CjwoXujrV&LxdK{OMovr+<kH@z+cHeS}$jev_qR
zD#dC^;J&%RGR~y_3!PgkVENO#<xlUH|EIlMJl^{z4ld0d{828rKYd(o=;IPx7{)>5
zW1L)qJ7b<M|MYVC1ADoE;23k+n8&R}$(4T)2Mv*$=XYtj5p=8%%fAbNf&iUmPL>Ol
ztZ!0<a&JaGK}l~_cpl~P1KzOYN;kc1G={5Ug5^~K+7t&yjemLk(~HC7UnM?Fv>%j4
zSJLw)C8<JchQU05$s~P~C7epzP*+OlgKcfj;12f35`@vQjMB2S6+}5vnI70BGUoff
zl<GEEe+}&^)`&!malaT0iYuzBL$!#J>JRca*?sJ8fhfgUj#IaSGZ}31XUWjKc!K76
zwLUTHpPSx7?oYlB%Y1oY6;c5Fy!Q@M#JYW5F&Ss5LHaJzVAB~94@bB**3n@;=YmQC
zn{*|l5F1TSRSpsFIp@S!cjMthFZ)gShU|Ow2Vy_qIVRUIlQWeUsmd~9X%**SU1h?E
zkBpzID_+pT(t$IJTJD4kD#C1EKk~qGk8A$&o^>llfANh$)}PRjW^22vuUAzia483m
zY$UK$^Oq(MuH*_B)e!R*o+p4VwTZPev);lqo)NyZ1?W%7lYo=q43^5wYI|P6nhCev
zE_Or=wMJuQbTywjd)_oXO9-Oh@vO@2&DGHH^BM~PZbpIVjyec#@nQz?;`5Erhuc$E
zoDY;mZphkODmqtp54gGBbcS@V*UwQ6rEb;VU{-|l3(bqJmKg%4=fxmNTDu)FD)a4@
zjYFBgYFOs~8v2CBq+Zrf;aVyY66g+rHr;XF16k?pIzoHq!#KD2MpO}w?}6>PZYNxS
z5%6I+v!l5?w&ZxX81@HPB@d`+d?Ai*e~E+}Nlk19I6$LEiEtMge(xmAAW;2+!F5tj
zM<bRWfDeLO>P+$haE8S!C+^2E9>thBk9y}5J#|0xact($)dCZDY!26gZ=CszdCrL}
zLM-%2Yqj*Tz_;wmkU}Rdw>JOBiZcx6US@xuGC9xRW>gFF7r1siZ~?#aG(~VVa&1{=
zINYi%1H!C|`oXX+@LuQ{WNJ+Y9!?hbO!i5&FyYNq!bHUT`<17Ni}&>k72n?RxN!G8
z)QQb?r}6sCwZ@!j^L062w**hqE#|$eyD9^+86{=-sY^IX=u-zOmAxPaF>@Y64}+*5
zzJ*kEjrCq>vE!J`=a_#paKLe?2ZoY2tDwMxRs)ENS6%}w4EKLCaLnncHy3R9VI3)@
z+<d6r((3N23Lutd(^<UL5QZMyyRSV4Nmd>9ta95Y5aKu(X0iO%PRP0x{xHsM2}LT#
zdB55Q-40a~cir+ZRcj3AZwg?5pE>RQ(N`8pOfhe5Ny@}XNl4qV{XQ?K&PkRIr=!ZY
zYqv@=b*cCg|3z;bze2KJmXbZPkR-|^=&z!boA>jsS@fqT_zg)&Eg;!B#8GV{>H6A)
z8m#Xmb6wa9+;h_3rerX7>bJ$q#VtW3waU~*&iYi7^{8XL-;SH8p=NrnF>qEUZbZ+I
zUxdPE%5z#y;GCnqhzTGPNi;NdlB?{_V89lpemWSePA<m9^qkXs6Oyk=GP+xW^7q{-
znS-mWxL8?AZ|3O2?b31YqrJ}U+-CS!qkHvY-qj%)@WRX@&SI5>Jj%(wIdF0j5Bo@X
z*<!07P6vZuq^9VrkAwo>{>DRtnmUhsmVs}xaR`UmIo&-vib)^`Fr`-4AV^(Z09%8!
zQZ|QSeEGS6OlTbeZ}b*j7=u(LS5d+xtF}CmQ|=|G@oCiPp@Sk8aKU;zc%7o6Tlk4G
zz08uU^cqE;bSNo{ReXZoOT_{p)vDRs*K_P`?fyphc;-IyUI#ml7hYKJ(`<VsWA=PF
zz^NY{636i)^p5`5oxmDz9jWxYiw4T9CmJGE@7MbA8ZTZ-+&jp4Uk%heRm>a8l^r|2
ziUulQ-r95QpLTyY8!dB{y=FGibwD=0h5Oj>33XauDVNcp;F$*zP1A8%j1@YN2LBj)
zqhA~%sF0=G{FXjIT3jKlD(X>675~*7FfL&>RuwUnB8-C9D?lnbGSykG&`51eHP82>
zVg#HGMu(tz4{L$-lCx{FxBdL$@Wu1JgAV_(4Fcz5c|?NHV|lz5m^9H%1}&D@6?T)u
zCiJr8Y*2LH;LUD4Tc$&LlyheNb1HNeA3)5Bd;R1N`ar-jy~7!Mr<pU3BE=XY4W)eV
z`DB8gNHB-~bYPue&4Ae3S$2`W&5N-e_7@oUR~YV9M=GCPQGqmmiA#%Kf*h2i9Tf)i
z&8yeLF7Rl>Vp=A6E(s38-}Q=&H3L{LjT|pge<@S$Bxh4Jnq6a0Q_(%$AtU7-s{`fQ
zYLtY~&H&|TQURxL(|mx!Y}Jh&_BKLu`Gg>aeai$G{t{Ar#q1~kDS$T3X+|&~bId4d
zveB+-l8yKr5@heOB=4=e#J$)<WtoG`PvyA<3*3}wea4MuV;sPh3TP6j@DfGEgr`6b
z*I}MFXu`}ZKnn1$K>gLI$gm?O4+FZaiLEmWM5W_c$Dv(-b?DY!Px3}m47KMsYmCWu
zf0ZMwdH}+_e~mca%X{g>DKl72D)v%w*}`WJ303qmc+U})et`xnE3e!X!>cybdjuv-
zV#m<}Fv*A0ECAsgH?3(O6}1iuw@M-gNcKiK`lAZ65ac~fkr`F*#u?ic(W-O(JZd<|
zhNtXVAFHuyZd~SFbiqR}4)=%5qakdz2x(j*RW!Us$*FF8#Wb1oQAtpbq9rC<{Xsfu
z2bCuAyg|q2jEEAHfw7#7#>HE}vmSbo841_+Cr*;>HLP?=H7Psn@~1irJ0gniRkU17
z?D~dO%JP(d<w`fqCz_fzXmqiie`$!4TlFRR!a0|13%Xtrkc-8`V(>F(XiTJOG(0BK
z&JU6C8dSq%ET%<6WdthEL_A?C0=peX%K6dM6^G24N*Q$1kcI+|@hRN8$+yYsW^&(C
zD&pq`^)qI@HlK&Q?yceo@BK>4jF(lU&iuZj#T6<wFL6e1+3m1yN9fY5h6c<NS3C<s
zP31slCwcieM|J!(JF9bxSq|%7D~Y1@yw(G7-W0*#lP7B{hS0VIgwpZP_%zmRh#<oW
z4SR{2!n2H6p1CL9ctmPzFIY_NO-F!P(MVE@Bi8YFhFW1!Ctm7kz8X94sWR}uO3(Ue
zhb0<467OHX%)TMSpGX}l@6u)D$tNO5RbVYt9Lr3WAXNfv{<(xa$YnlU>hNFbyQL34
z7-tpzl<o-gUXk*mTUU#+QbV)biE&~dd=P}UX&nQr)MJ|!U65|5>!n)-h$+9J-khms
zsuq&P&&rD4G(SK^-R>mTV5}QlMu1=_mIX0ZMrW#3#RdmF2-wo5F=)=%LsMsz%ZxT{
zUl2QBJmI;v%Ic~KfOf2F)5g`-(I&V?%4l~xnse=V@2^;v63NAS+qr^^9FM>J@{k&D
zDOYbs{aPgsG5w-w-AeA&dc@4*R#o-JiHXM`+&N9nMu&;`-a%*G*@Mi401xf~ad$c*
z;97)G%G!bY!}6Qfp4R)f|4!Dv{o{?+ZWTCpt@_5KGq4&cM<NLzMqqi?sI{=_iKwFQ
zvYh0XSR@huDW;}yAu8q7xd0*mgny69`LZbEW(&Z$E!}lq9_*c*9`EiP9y~dA%%63O
z@YKCz4|q-53vCNn-KbatiaPn&De(g_c`ogsX<XE0i3rGB(dNS&@pC2F*%%|<lNppQ
zKXJ<kVQyHAFJW^%1zI#-xEb?aBj&OCX`>TiJ7hArS2;#NpsI%rCEmzZ=~hwdMdvim
zt`O>65m#pQH$V#VX4#B8^T!xHIf8Pu;Y{cU`7qv5bd%l8njDNn_0L`(m6b3gdmv#9
z1*;lacgbdBI!dS=!mq?(+sc^ug!mcQT-1)@XW8gKLHH$QYnGB@rU2fYG`IlJPmill
z%cJ$SuX9`7;zIPd6OOMreX@J-)9K^=!=3Lz3aGO-(goz1q~ck<I6jk9vN%_S0EJrP
z{FyN(AjpL1%hO_vS2AoeO=9;6GgPu87|@{Yd>umt5HH<-gy!9KG>-^A{%37%?UjLs
z5V=`bUK16x*HJJe;NHw38*Z98hTQ(KU9AJ0j)%R=3}ansuaM*ZnZ+zkusy{CYfg<+
zx;vbVuSsEChR@!ngVM~82&r$v$w?6g|2*U_;m;ss0ws0mgH%1Ln(-ohEB1kN`z3$1
zRzhd-mwjF~(J!cPEW(?2E3&`tOy{&Q?+<YJ2bI;u2s%EuGmen*3Qvt9{PAQwDSF<!
z9s3369*t<9qi@qmumEKqhLihUag_kNT@&7x$yt7mvAvQJ;Vg56s#{!+kf0j(Emz_m
zYa^rS1aW0b?p=8PjUi=e%v`^T$6i8TM7TZ9ufI*uP6x97grkX}HQA~>9))_nq|6u~
zQ4&r2OE2qVnkICtdGdVs`QzQA)8m(qPmfQIwoi7S{dD^L<$iLHRtI!Rjsua;Yl`_U
zfOxXAdy0mlYnZ|KT!)U2;rJDocE%KN2aBEJ+m|UO(i)c2OA_^`Lvlw#P3R?Y<M2A1
z%VK;@v2<7HPQb<^YKJ}fVd^|qnT#+Y2y8*^3h~dw=cmWp&tL5Cp0d0A#`^lYG7Aeu
zKw_{HO;u?U9EDks46a79Pj+Z~9WOT>=KpY^Nn&3D{0N<l_)$Y1N5$_(924DnS8f)5
zPDdUgn&BGX!)Yge)op&mNolP?#a3^VmwBLQCxaSey=lLyv|a+D^~fd3%>ftDwW`C)
z54_E{kGEeCV$xocM<ga6OG`MCbUvyEw2CZzbK3|SueOhOG3f4u95b=|E8sAO**P4-
zx0zJ_&P=`<JeQZ*<f7=|TF^)CzF}CF#F%pso}wl6u7PVtvMyX*6lior#S)!C!hO>T
zTg}na&=rLxwux-P8N;n-GCL&c^j$v4F~wakousA{ATv{tdd66Z-S5zFTE$TEJ&*w#
zbr7X8^Ab7Yu7YfhxU6E_3wGs8+IK`#vppN(t?0*|n7i@Oqd6`|?sa){o|~-lT5x^I
zLHJ0eu<4|t7Zz(Jja*GFfuCO9HOxj24=H|smQ9|f`S^&yi|R4dCgTqg&K&L6Z1$8l
zv3)O=Os^j56^^6<ikp$1>v<5H{Q*@`Gw0Mi33r<>x7bj>+?F-}Egj&R>oe9U6Tr+3
zud$ZJm__0bJ$C~0@vjf@)1_0N8Fip;Zi0XLyll<9?Y^Da;(ihthJ+Hp*GrVix-GmH
zihfJ4ti4QAi5Q%kwn@OSaKHL^#14lBn1T*N>s$FZx>Eeu?2+|wR~yTx?FF2>vZW8S
zzirG5Gea4{=SE><?w<V6-S?zg#>PQ2{vmkZy&JjRXk8;rbpZc=pdLXd$$R*Z@C)Pa
zS~(?sl%sC$CyAc4K*I0tS9h+G%2|^kr#a@o;3UAsxOE#|lNA8yN-T2xp2U`Q=C}}*
zkZ)Hm0r-B7dY3Um*|2A1wMUIIx(jf&BhNVB5hnrq0o@1i+OrpzcsW3Sr@}CauMG1~
z-^$nfnhTusB8%NdZX|n?dAC^eI|>%WuWT~c!R}v*rM8lZySK~a9F-@?WM8C1p9hyt
z)Fn^Oaz^sG&xt#(6<;9S%X@9obBr1Alr&p)w&lzN5|A|*H@}nI<_(U>kqg{dbKF+?
zraJDG#606fuHXwQVJT%&>$X9+`pMLft^``>Wi9TJTys9nZr-yzq`#eY`(lFq^v0SV
z8bw2vbSE=##xkROL)Nzv`-u8D8V_VgyoVF?HAu=X9O~|cIO_}s+JU8{1TvN>ot|;V
z$ACL#zBBD!1hRD%3}#*)uWS;QnJi{`f9CoO=WhB*LH5T~7Zjxx9ubcNCYv^^p`l3%
z8;acdXf!Th{-!%}VkL)7+T5>jxQqP!Vt{^2S-+om^K2M7J<E+-w^cb=v<b^SVFh<+
zZ{U3OO2$igc0ws$0(~}dpzlT~9ru{vsvj}?S+7^wNL~&;nSf+fj7i|gNg9GbW4Ynx
zIq!~_tv!_fnT#>dFx{i{3YS9s=L~0@Dyux}oZ}eB*@TZdGoCY#x<4Xz08noA$cU?{
zxj<Zu!_DUc5J(i6F>uqBwUtCUD-UV`K$QsM#E;Mbj1686L4JJ$VD`n15Y%EAZ)}7=
zVgML-ne}LH*mK2^0~WQq8ubqlW6U+vohy)J@7M!M=K@9MF@O>&7i*<7)Ub)+M*u2$
za5}2M>g5hlmXXnLl6`1dh!Xbq@^-t)4EEV?yT*-J{ECzA^kHbXqZ@=Rj~M<AUU@)<
zq=5xwa4mjyAAL<P(zh9r=<`|H*!mlzdXoW}7v2UVs>7p4SDU?UDGOT9USt(Y$Txyj
zv65rV6i6udoee2?5>+HqM^RO0?vP77F#1z^2R+cdeUw}az|EyBh`oz=79+esdNAuz
z-hD$FA|EUamDER*Wg}0miPD#q-_$?ZLhn~R))o@1=MiB;MbA9AJ&y<*>(?XgRZ;RK
z?Q$ScR^>n3tXS_e<jGlr<YJ;Dews_ke3zCN6AbRKE^z3@z@a<7t)i`W*;j_Z$;njK
zH2lOlmkStePOioCIl_;SUmojW{2ufW4}cWhN|jg;`yOm2&WX2qmsj1gN_a#a;Bbih
zQ1txUgkvAAhe~(~Pf+z+Ab40U%ksAn7tLJl^~vfz05J8gC6Bk)*>Zy0o1n@`1y~G$
zTj%f{kDcXlN<6AaS%Z$`3S}>=Iu;K<$h(!oykQ6^vu-~t5Vvku{n0qV4>4`9jrhKc
zXL+)>a}vq&A%hVDm(?EeQw`g|kFQlB%<#M{&3r!X9Zd0(*ro!GE+ffD-@#S3)8~qs
zc%JHo>$1v<<l*^^d8sV@OtM0zYR&ts2zA!8Se8U*LlaGrKA{w)<s>BIllI7WN}Clu
zr9vqOVLqa0yp;8Q`-+lBDc7^F5I-Wh-0np)95!aFxp6`^r`XmL^U<a*kz%8rw1cKm
zg^07PW}MZ=MEO{Il))PlB)6v7bjbpH2JETH%HvhP<3yQrhq4Ai(z9ZukxNqs(|<NC
zu%6_1LbGZcjy1XxtNW^n2Ha+!;Saa|<M;CcVCLm&NjLpnkk{{y{(;`_Yu!&c#yWhy
z`Q|J9cjG_5Uf2KPpPS#@TmO%Zui)RWzy8n7d(dv<>wDj9{ztO@3FlDznPTFbB>9i&
z86fYpq1}w%|DYcZ<WSj<#Zr8bO&%XVNe1~@HzAA&9aJvGr9Yv(TRkf5a*I@blnD^S
zVkc<7#&;=4ZJ+a2mE?kQglK2Nn0JcNHR(87JMCn1ef_^zHvub><8<&grS!7L>9C&<
za_D$1*&Ym7AyOizLKbly4qd=+m^=y?1L>3;;k#yuoYWC7zAyd{ukn5&7~grDY^-hk
zH_hPg`o`UR>&fQ5`}h9q{#RcmgXx>>G65zu`9ELa`*)XDy_o||ZYLZ6{ok7%{O>*Z
z?F*dEQFcx;Wx<L`kPs+Ddvc9WcG5u(uo&j)TGF&Ef)$X=vnc@{B~ns$Vw}o!+?BXn
zE_Mg~U6xGDF`&p6fmoLP>PoOZI&6-x?i&WHyI@Ij3z&HL01Q?yr@YD73%+-mO(;lz
zV=b5(tyAWNnI+f<5=d++tYvzJx-Ppj*h!Me{)l@o1y&V(HLP_Ub#sD2yMr{p%*F_#
zWV1RE7*IjPOa#{1n|8C$G#BN}g)CRmox0Nk@7=|Kf6Cx_iHiFig-{E4c48&w-z|d{
zcW({OB4_?&#q(trL8oEiex_~6CnfR5)K@VsWmf3Nb(XQ38r2nW#bNY1ybV*iEGAew
z5n%*x!;#L>-9+>u0FSchPp$w1q%U*t+e~JoF(x%Yzvf9cWb~rEZT5VAw|ATzA3i<#
zVf$z|fxllI9sX_a$?lWn@lWvMZgRByZ1>>gI01$<**QEoIof;t^5pR7IQifI-9CmF
z?%ctju&eEZpOW1lUjS=*oE#n{d(U6&??FG%F>tddd%MS-Wba^S|0QZeItlcW92}l-
zwpD0$a@fJ~D6>Q5&E)WD@_hGb=R5ei{djMG@8l<%(9^w>103!tjJKV<*giVh+j+Ua
zeU!X-dGzA&n0mu?J=r_n+27uKzWW4@_1*ytob3J$mX#cTw+$?cUMKYAE%Wg%OmX}1
zKJ`W8z%n_z7p}+swF6Lt+3k0d;}^R-d-%uhkGrsx?W3PM((Uo?|Gb1o@FVv2Wc&H{
zGgw?}23TNAc3vLsKF0|IAdX)?K0etyd3my%JUcvma*SO;_s6?Of7{#HJ${hvA089L
zULNmuV33n-8XkH9aKX>;_v4qxdjz<>gOlB(qn9r*Q&}53`tI-t%vYA|Y{T162*`&A
zv}OR(;n7dnFT#WNpp*RY-7Y*oLYNZNwh<P`0KJ_P>`k?VQ30MOYO%?|?z8<pfcnlZ
z{(6WV{jhhu+lDRMJH`fkJn|3QKhYXr((-Y$U~c@ULf#H-X|ne;*?#i3J)FEW21GdC
z6QntOiai~_-1$zRzec(LZ~X<t^TD)-8Q!nUyJ%4_*Dkj7a}WlG1wK<vCq1}}shxO4
z=cq!@D8BED<;$#h4`Vbi)~}NU|5`b$wcKu@7w1Is0(27n4Yj#`-}wBCq`XQ;m|~^c
zKdL`Yxd;I&IgJ12Wj<`Bo#d?jMJsJ550lneJNY(All#dT-kb=P{~?xQ4CDh}AQJN!
zh~)s}&)doK?%rTrT;C~^rQIRi=2<r8@cm<a>8WIUSz>USL2;IN>9nw#24&^A%=w?!
zon(j+lwW-D_gi1^l*yaB1yApa*Fi$BwI6UJ{5x45Q6v7l-4YnJsN<mF>$--oO+yUh
zhrjRx-{`$BP~d?<9>_EJb7h4dy?*e8efFB3P2`D_1x4w#x|)Nyy55%GKe$ae{$cyY
z-of4p?gYBJB7DS~qa_>JPO(6({Jq{z{%Tw>*!dGgV3-43C&BY?6O5Ke3G<Qn!?(#g
zJjcW-RV=z?kVuA04HBIhEJ}t_%tGdgB`9uvLD@yk%pam}Awb1$HP>}RRKqQXxuR2r
z`W=T*zboiq6TwllDc(@xWokE!G#a#FG^pO^v~71V@>}$kGk7Kb!dctwHvG;K{}&Ez
zED(7~SjW|Y%dYKh*0swc)F%lW{zXKwr?~}_>)_Gsum$mS(uOu(hgCuY_c&6T$R_e1
zT}^Acm!o#lNN;G1#lHl#DzqU$FxHcAZ+#)C-ohVn0Qn&~10-unYx}SZ57VR_>d@}1
zx3}uwM$*(x+LeHlTc<1y%l4!iSLLs)TxiK1`C}jnLHXO5Q(yu(zF;_xV5sHM8U6=-
zAV)p?&j9~(iT@csu!IbL8N)Yyaykf0sUQP~5i7Xe{~{m<4;bHv0D%8QeaIJIP{_;Z
z63K&51OUqlw0)4k(}(`kAvzB6FDs9*Kj=Vuz>El^OZaI35LYjueigtDk5>tCM+4fD
z2lyuK75-xTB2;hTlH~=Q@fSv0^Tmf-UsR_GtGSCMKWJ)ZeOqRIG%?p6yBiH7U0|th
z(}nHht99<=iyqw@FwTFuM%*=>3z_f=ZVUap39WjxA#HAYX`5ccP}uCULtylq4Q(@=
zk@P};)4#6ihg)8!1L@GUfCh#dj4tuPD8(H*i)=I;#t~Nf8TDqsg?9SE1BQv*M9?G9
zXLuhry5$fMUF&e$0hiNu+a{y>f?=!MxnE@SamHs151ce18h!gfAUbnTKFmFhE>B}?
zfoZ@iqn?>Yk8xB@qwAi05R8F2Y{3)=ktKlMbOvA;b*VEwf7Qtc+=L2V4h`hTTwMTw
zqpt3RAO#ObDR!;sKRv}#a&7glCHJ@*oQ_}?edUv8x}f<ERUdSfj2VGwJXmQ~2@1mx
zQ?^q)8c57e$HaJeNrQj^X|IfRNg?y0z=BqbsU#2|=mx7+xUbRrJ9J&hJ6p-=SiOT^
zvFHQS8bj7$Vq-YVNRIITfCin!Q08&9G^bj<KyK#hY2|pZzCce_a)v<Dx`^}XFd1i<
zI+5ximgwvNw@>#?LMa=NyZzz|I<2$?h$)B}JmtWeMav>!SE2d4f<2{6$2*CT{qFJ?
zU+`X7H1jv4{Q#gK`8RKU`rBCEGn+17-F@t1%di6jAeO{{DXU)wgs82>7JaY9!>w$z
z@!i#p-_%4<(f?ziyzIBs|9`dl^;iE{(f@z_r~dyp`P^Nu>anc~zLUJjGjuXOD2j3K
zVw#u9!%=r=zoe7o{1TH)^$POM+G^}8rq53vro%}-&fdrS`U7aiwMv{7qv6~ZRf`)X
zw5VBct{0C@<)(`9PpBFHWU6soUraYnYo4tV*UE4U>znGtHB#Z{(<#Mw4qyCqwD;`0
zljOU@{U^Ie5%u^IX~&mXG5+L_q8yLw#@%uce>m7Zis;CVvUh*?qjcm%tF)T@hB|Uq
z^7?A>o9f63=vqyFa~-)X&r_4%P)E+27plo`sw2nVd^LHqj(pO~YjxrJ8S03=XG_A$
zTr8<);`Hf1gd?A)L!b?B{pZ9SrR494Kis06M3c;32&Hq5<a>Y&;g~D7Ebhx*Vloo|
z=_&lV@eT0L{-b-Fl}F!v<t0O?bYc8eVRakdfEd@VX$oDdruQ}*ntt<@Zu-qv)btj4
zl-bxXbhXaW_1e0Fnhb=NQga1noV@7JrqJ7e0Y81pJ3+x6yYjjjDS4~YkG*AZz-%$A
z&9A>EZ$W&J2irfY(vCc_a2YPPPWJ|2@_WMvGkd$Y8Hv=3w%qu}<RDY<B48j_Gb(`f
zkdlH!3q1`c0|^1svuq-j8Cv`xS<XvVj#FO-s?e3niO#SzAdnqT-kMbiwj^(HvKHLX
z1!_D(FlveRGP~@Ku3NXEYY=;6pyf6Q4O@7bqI*Mo1?MFQ1nqQK0K7iV;91^3%czrz
zcbS{C@^Fhz?A~T{V)r(AVz}U@iNWiYiQU_jiQU_bOw0hUlK;Yvz3~l?jj(MRd*hqx
z*c;!-*zjX@Y}_XrdlqU<OOspzi<su;Q+-IA(JY2vHpv~27s1K0gX6+;2R~f68Pa89
zJeK^nH=HjC=`#Lte6k&f`8bA6=wi@c1t{0g*FO(7prYwe)E$IhU{07~m1a|O2$~L2
zJ9ZFiX5^oSx)abiBY{TK>1o%TfI6&i98WO5>BI!i$vYBtY7zm;m5x|q(SiOw$gW5)
zq$r{wOEuDie=`SC<3flhA)QyR49E>s`7`r*$xC+^P+%S+x|xhVifZoM(!+0y!I%k4
zVKw2pgsivBgEll;Zo+STo7or+7JT?9Io|tumr@9>CN)q&xB>JDaJi*q(rQJ;j#gHF
zoTcOLh2sy3l4L}b!IlUwmeve8+u*$Wj!IzuoqjRJsH-7KWiVQqEI}VjCO$&<r(Vo4
zgP;Pp9b=uwFgd8WwFFU*P^;ilR?7~cC|f@)cEp(&Wici_Pd-ElOFrL#12R+$0TU83
zN59m*FDp`v#16}wKEf;snB_4-%@`fqs~gZFNBfOY?V16))3H1?Zrmpp8n}QVCM3dT
zF!b%Vc-b12%XZxiDhZm%B7%#-CHb*Hf;sCoG{&pYO&115@Dc2<vIKK=OFSR$CGfR9
zx5G*WyG(^{dIi70`;0qfceIj#nW3`f-IQeqARkRzpchvMm6&V4hJ>Q{Jov+4@b#HP
zug@Gqd%1H4XGEqgvI=>e6(Nw)Ril3oBH&6AJOhX%TU$ENfYB@foR?Nw0~lI|%VI=_
zS5`I}!4rEm<>K4D)#|H$%XnIA#|Q8r7^vru62ctDs$la*4K`Qb9oC)%A*3%y=i{^|
zSsR3EVAvR^?i)MyhRSRaQcI035;x$D>|D}yMK2!de|y-&psZT5q%WZVVp2l<c_UAy
zUl?Xr{6bU^<S|^dkiA)(4->I~7`Zy^8Gb|DIX1AEhof^(DMLOk4d&s)Y|MAGA!`ks
z053sbj{e;pVTfh6D;p|-i$FX%OS^AYC&g-iT%hL$MbGw%;hjlR02!v#z`P_E#_VYx
z;A-NfFL4+ShA+abj9>3%`UWWXl<6b~Q40rUdSeSCbf)yDRH&IM<p{k+(8?vN7%xXY
zc!jI0PLkH_dfDOMS7fT4s4T&4I*d~~?@vW~sGFjfO+&`2o6&klW1A=1`wi=M(|h0J
z1N}FekU<@IVVbnW!_#;UcyN;DgE&`+`e*fZQkWykhE2-5vD_;s?if<Lv+GILbW0&R
zUIy=cE)fbdQ$0%Jve1f~2Yz57^-U**Ysl+cev|~ttQ$*JZjx2;sCJT(rZXl<%DI|r
z!%d+oG1X2X(safYNR?=AAN(&!Y?zs(1)X*fpXePc+V3$3mD)=tV4*AWS>pxcbXv>h
zwA;<fGQ4u2*_=0sMO?ULA6Trk-I@Usuf(4r%N8%-oneOUOceH2W{W6JxpBwxph%Pr
zT_vLslPs4_SZHiILehja$)J03#v~h4rk=tDX1oWMU0Nf!6LYj-O(!-L6uVYnx(kd6
z=b~$LU1(w`P}^!axnYUm3#y@cm0p(#K`QH&9q)cJPym9BF~$N;kA(nXK%T!gv@OPC
zlpX<%vHaU-6m8b`r8N@*A4qI?CuvS!GM)|wAP>TSM#X4~iDX5Rv!+D0vsytCmc!hW
z?n;T4C=0<Rh@fF)q>9+!3wg5A&TVA+V$6FCC*w?fUPeQ{7iUBC@W_Qeti1}_m3xTQ
ze(-<WlT5|GII+=Zxg)Uv5>>phB!{f9bp(eKD>cy^WFUV_db9rER(LWWHeIUdLNzB!
zX?0N}<E#(b51t5}^cc7SPB#%w>F3brSml(VD+f7cjHvXbpg_<&;~?^ps~dGFx3bZ3
zdcj(>=Pq=kI<(U*Kh)vb1nu-gI{HkyWo>5}dhD016GHPpqn@wkd72Lwkf!EGHDen1
zDBSUC=7@$&a{X|A069uDVSzIJtX5Rfv(G|1Y%B^$DocQ9!%4q;`P-ao7N1>Hc5o~m
z+bzc9>Bx+pjMD2tkvei)u}t9Na0#vUU%BW3FYZ}PfMChkX?}iSJr``Hy$x~-mc+<L
z6SK^YEvCvek6)rPj&Fvcw8|&;w~e(bT7(7{O*tHnEPF^Y521EsU|IAQ0c`x^6R0UP
zNY?|rklDJkYp2Y=P#P3+sI20KV*+Y$A~w?5pg3doHu@<c$H~eI3EHAYkD(0?Tsvf-
zsW$G;bu($yobx2%NOA#R;c&C_vBYqbUs5_rUE1|E(GL%k|LtYj=zo!10j5Zeo5<^2
zaxr1Hk%sBT`q&_T(+TzyQiF2gouoH4#fi|9iZPdi^2ZsRre0|*CW)mnG}4}#jBI02
z({*G$VmZ+fc7PL#8d>ayv_}sNU)|;6(5SSKTZSugQCiuwr`GTBt!$()8;LtyvDKT)
z^hR>3aq}hEoccL_=apa8%SpB6jU~>eZUb|4bGIAcwCC&98k$31Jk&`>HkDX#?DP^7
z!J>@PLf%`Dj<8duuRWu5@vcIX-8+-?dxpZVZ@pCL(62~w0KK>`CCO$Tx<sb$QtDPK
zank^g9<A5*N6zweBqH=RKB9MO8_%m8F}fB&?s;1w?51Kdmn*Wg`O(IMB!5^_rN}b}
z`Q7D#gn(@@m<EQ96`R+>icAmQ@UX?f0%I@pelP1MN4rn<j!#c^k59r#Xsm_dIdz#Q
z_-e8q(UKiyqjBUS2;h;}%1yNh7J_LshNk`2(q9LI-rt8y9c63{Vdk-t<~?|)5>1$7
znEpwEb}-+QjAzFxX(X2k3Pk%!i^Bo_f-Y)(zq{g%XYn@O9DW}T?ka6h%dG3Y#Mc((
zhQ_?`leawbc{ZVfUj1Hr-MT$_t1}$Qp0-*o+i!dFc5U+Z6gqD&Z?IQ?dxf9jh<Yw&
zvpAi!xOHF-W^wA!iH@zo`w}Y`!40$V@FBKr8~cuJpu7#dJ1Mum0fzJwYS2aKu!1gt
zSUE2o3@c%7hT^;7vs%n{F7rRYb<<R57@y3`{8IIun4qI|Cwent0*uBHB0W2Bx98;q
z?uzS04oj_oj^a}Yt{dIM2F{JQSg1J>N4DjB<C|J-r>{j3$pc>aC4Yrf0RLFo(8UjL
za8t`<*jk_8+pN|8#wT-cQznCdL?=@jisgg+o3CoM;qjrq`AUYuKZ2nIi&SX*%LDW@
zZoO+KOex?m#W|k*|LnbKV;Wb|D15(;e?^ChEsz0A@{&Z3oCizDW+DlVkm6)KzT6fx
zQpZ4(?nX-{xxf9b?QFduP&|3&KChXH1>I+@Q>RW<omzr~w=4#rQ*Phu7@dvxuRnk@
z0Csj($`$Q_xw;Fp+m(MOv@4MKR0+)$s>rCYR~f!}a+P_ah9FfHVI;xY80>C)Kqc)&
zQVgv^DZKG?>#G-E*9!6T<x(v?#umQ%BQ4MvzA0$IF<rcK3`Mh8x`oEp=CiM!ef{*s
zvp>|#W8F*<MD8(~BCt57rpt|{Xi`fz)A(j<>*>?4wl<!=`1<*?ufBTz^~Trp@fe$Q
zcBT5<ceMF#zPe{Oz(BZ~T(whP`w1K%{t!FNZj=1ETJT1WtLODcN`LrL8=$EN3+lbN
zXT4{iu-+H>iUwZz;ke3SQVha_;^c||(;VTklqzh&;amfh!<$(db6#(5Y(2}J%f%BG
zZP~`n*Bcww+}&EX_E(06L3Gvo-?Qji#xCHVlKNH`dCug%pjMZ6>N)`U0=m!vp#Bl$
zeY%y+23<B!qjg<O-3t)?`SYjGKS4J|B-7SK<7{eo6`{e@mR=%jQT}7$+xU+HaAQRX
zf09k`;@N-tCU~~>&9iS_e6{t>r&y?>b9Ci}G9&sQwjKWSK;5_xtpCWy0730jY>a;k
zVfk<08#w~?AG1CFBzXVXJ7hV4|Jyf759X945`I0$ppu>sSXsRKC*@vUxuDQb3!W&~
z*GZcPFSo2WMg@uCHqy)z7-b+S0yBBZil?bxQ-jb5={6Uz$1nlmj>F8wxG3TtdR0rq
zSj(=zQ3($fpz0p}P$_Z}j1Z3sV;l*pa<lRnjDY4==b<)e<g2a`NDz<NR3k^e82VS6
z@ZZ*b1c;5B5qt_oh^tMbuzbh`Gtxp{SGk#mAbtw*`)adR%fvIf+FHItW$FVB<qlD+
z&o45aZn^2J)VDvrtL)o!QQZG`hj}Ue<l_JQ8qOyEta<qf`&b<RXXE+Si+ue5XB(g6
z|NI#rG_>b*9F14%+o3<p7&Um&EDa|>x`sqFkcg@HCA}c<1ZM{HauU(4?<i6w8lUWw
z%@^QA7~1$8Vd!&&q0bS9K1Ue(9AW5lgrQ|342`B}j)J)|4_n9mxB3FqJb93@hvRcj
zhZ=ZU{2t|)><jePavxF7K--(v`#27!xnfuTI8*G3is83)wyiE3$6hf01LL3$SkNe)
z=}B;n%yh1kvhtJ{_wFGTjA^|PIP1!L$SHcoM!@);yM6O17i7sk+mx#D-rd>|G>xL!
zYZ0);o{<YF``Ds_oWW1lZWd?D%$zCYjYJD(Q*0mlvdG%Yv|MOJKpEaXWUL5YYRjkp
zbV2I>(N9kP8%N{o`JbBq?FIbE$$wvcmjC{gPjUR$&96TTQ=f&Y&%)GaVd}Fm^;wv@
zLzw!sIzFxCBUkPbCiT#nM>)97LHFPt%w@poi<=b3N`5Gx`(Xq-9jN>z5H@UUG@nY0
z9H3VL`ODWmtNb~}H=T|B0T7GxThFIRF`0y?J`sz+A6(K~%Dl)y$aFGOJ8*4<&cE0V
zC@ajB{p?$yp_k<3K+HLpc%DzK{nCE_qUiktiRlGww~whzQZzwJNhd2H!>9(4`08N9
z0GWc0xz^NhhyP#WF$x?%v4*N_VhA=l*uxh98#~Qd<2#dTr5VC8g?x-*4>0)S4*mp~
zRx8{xf(`Gs<TAxB1xJ5XJ*l&70o$#Id#|K82vep8`eoFW^RLRv{X-C+!xB%bgSsvV
zb?u6^dL_L{)sR$5di_@U2@06s%aFWp1!}K8c<-CdrUtk^ZB(l4#Dmu#GC(W^o@fSO
ziVg%`nwQv78oz(>>_bT!b@UJZq9C97rpjk7L#;UerF4M{Z>-D3<x{Xjy}OdICsVoX
z<nin1sq_oh;NiTv(cGxi-6&-6+PacMuy6&}OT9Jx8JQ;>&JzLy@D4y-Qej3aYRzCF
zDs<fuQCg8Hvsvaoaowz*EVo)!mtG_iFN0j{fk~UEz|q*vAo&Sype<rn!`L8$6Ien(
zh{=MiOI@{=4gJ)LURJ$&zwrUB5!Rls;X>oG($A*+-1>lPu=dTGlgh<ZdsbR)hpW{r
zlyK>ltc3QaFpa)gWh|KimCvJOKrf00lqr)VQZ+kf*bT+#A`Qh8S^!{*DgGc3K!qzN
z)4d&Z1;->PYwaDij*Y@~d~B^F(~_OikHWiMe|m)jDlbVNr0IwL^frU8Lcqu2$6$QR
zMh0|d;!!%A<F-Jv3W<H041nHEo#Vm8V?>5u+I~)0Ek9mR;23gvWVc5Q<KkTeQ{c)6
z*wla~kUeKfe3Ouxae&-@)AKmzHVT;0fCIt~)ipaG*3y>vRLd3x0zp@mSbcoW@bcE-
z8`+!iZ_-0uhr{%eRZp-LL5$+>=NE%$9O-2=O-OIK$g=W685Z!b#w%(bO4DEW6?X^k
z_>22;7Ty5fTHPpLc4}yyt4LpyV3GuB)va2W8Ppe4RQVUFqB_a;VZCLEX{KzUL(EYI
zd^PLrzs73vJPRxZL^hdlhbbemU)Ag&(!NLKG&bthrO7qDUHn6i_9zB!)+I(L#gmu>
z{uHH4L^#w{5Z0duigUqW{fJDPQn0W{lXWCfJOo)BLudKq#7j{hhKS^Zv*TctHqvN@
z@hhh6(Z5mOXnH?IbHZnekz$3G(9YBHT|lkUYJ=RV;yDR)_hSG07y*$3E~D!W|GDKq
z4(cLdx}orhzy0P>%ug3LEz*0dirw191ZA8f+g-%>H;-@EomMdpG>xJ(JbrGw@;XOT
z3m`gl!T9=3kS;U-f77Hhk)H3Iy^baW%Z4#Kb*AH+&HC*oBJ<5w{dUU=i2j;_TV47S
z&mUhzfG(Gl?D`)-D`nH)l=;hFXq|s=6(Izw>M>lZf1Xrtwi-8zE2bB>^5S-@acjRw
zutxP}6QFgoRg+MgR-|Ds!J5@uEO1*`Ac)cLe0b9s0-6R}FYRcwn+~sOp}WkI;8y2p
zxGX4)2+qZuEo2LB={xqGiSintNg4FNzU5Yi=dU~%PuAuQhYF|l@Yb~^gTCOjPHu{9
z$E3M$VS+`iJ;s^4t=)2Kx7pTycabOgWsWpw5Rd>nRMBkA#<{8A!UAgwRX2J#T?R={
z9BDP)#h8y#J|R0(2|xg7$-$g_E{p_@I;Z#}sIwK-U>b*4p+ELUK5?)zqM0B2Ab7(G
z?*&i|`_igbL>|EP>PJ#hc(+6z68=d!>I2|2!gHjr-XM$z<A8)$4s7RLM3i&{H_!%-
za%=s#)AV`~@M%dnpqL^d#pxrnN^B2?^z1o^!xwO@By}Dm5M^{FKkhtvX2EDgA!29H
zLt0m=(J8itL8VpX@JKY5cr;Q`RL{b}h^z|^?Rz{Oq2VpB`pt&wwuWF^gY$%<unOp;
zwxWInUUvx?^ww*FK1nca?}|gmrqpD-$9ir1w6;8tYYsL6qKG!w>Y^T)b50T+p2BJ8
z>%~e$q0G{~EQmD@70<&b296hr+}noXoPyLOXk2e5GDQ59aK+q0;sAus<;i@UhBFC}
z6P=@`oep;ko%N!maOx&w0S=JIx6w64E=Tn)wgn43nGY@j(U7f_ESs9eRFoEo8#FXP
zq6iY+jLze&JukWRXMygEmMVx*^RDVC7(Y?NAdVHkV=1|p01((pmvoH=2CQ!s4KWC0
z9QlLGEMe~vaPB<WN8`v>*RA|rR=beG&u-p7`%w30x9_zkz=*=6qz@8G>O*{pKNt|i
zFBGHYZf%1AgcL)jSnJqPWOl5D46wwBa5+PIA%UcNe?K{`Zq=GBOI-UVC^3%WJOBxV
zXaFyv!VbCip+TXFp5qD4l>`DPt(vhAhl3$sOvBNw;EPCV)YX$6Z?pMq^V!zs)8{X?
zp1w41c3`FFAQOryx`Ny;%SLi@GLK~^>sEP1a8DlgWmnSjaLYRO#LsMV{WBaC&)`oc
z^vKQopFdawKzgZQ^VqwwEz)o8l1xfX$y=-BM?7R`NUpX(9WXW-Qd21(Z03w6mPD|X
z24AOv;rHs#k2h-%pV1TjT^-<mUXs(#pVCk6{-2ZG{+agQPhUKLmcRdh{`vm@&-lol
zfw=}2)y`3nzV7XT&~iTT2qUs;8or7r6|6q(DPPNcHpAk;2&Tv$VqJ>YF0m97qAdE#
z<a5SY@3RTQXA=bPvkAgy6NJwu2!F%`p(h$^VPFPqJD^fWML?Q>ij8wbv*}uc_mBVH
zgGt)v;N}s@YY(`CDyQ1;wF&H0e*<|{OJLRY!DLqRB)%%wseAUXnyxpd15*EF{W96o
z{`+iSbNrtld{Wy_{4D1GK>m96Rfhk2_H65`&-~w?@j-Qf610OWIAR;am_ua8(M9Y}
zNb><)U`&ZHy0VMLw_XQMD9%WP85e*_Av+t{ZGQ_VYl*Zsj-r`Yg(rOfcRCoe8O|)m
zDC;#!&W8G&*r;~sa1ANR1MwVi6#Hrr)JNbaw|qHR%0s^R>=XEzhy2V#e&!)R^N^o;
z$fbP(m7ykZL5|_3KMlxi(+*jk4#UWeS6v*%nx5Xyg2a71p8{nWW{RdmIOg1EGazl*
zQs|~%94gy93F3GfN%U+r4Y4C}=f-KcX?B#^iyw2gJs`NEeh+Sl6Yy{GB8PQ6Y!AW&
z={8A&i5Ljk<k%S4l9Gt4$fb%u9pKdt-ZCMBE7`xraqMmDhjzdH!!clsvo8JMYDWA$
zOhFrUIdzV^2M6-hu10W#TJ**-2eWH`5Bu`0ZN0LZ`1s2_m<OtjqIRspNiYrusau%1
zc<Zb3ZF}GcZRC{>kX2gu12(YHk4O!l1gRYx+o=(#ujZaTluL_A1V?Bz4F{cRm{w~q
zMe9!&K+2+xZ7s%Q%8EIg!I3va%f%3Cz@aD!GL3bi?ybQ7Nx!SrC>|0Ud|pI&!o^}Y
zs>?K9(bobyDnHl<;f-ckTURsB)gFax=vz=3UKG}*3;KNjJW#a%$TxrIB%}wt+~#k&
z61X{OIBzlO1vgk;2)$%GLlXtm?kXjy=U+_xn~|OM*?M&zz+MZIaS+VPy7ouF|12yq
z8v7SkU{VC5AGBs6W2yluEqY@!3oXF7HiMe@DvsyA<F(rTqwY~#@*xn8(~bT(NY@e@
z|Fi|}x_1@u^&hqqrkU$1E2g_F1qCxQCLr0Re;<BmN_2S{jAP?tZL9|{ne99d**AA=
zzn1GG7cVG_W90>OTp?>rygoUDD$K_xQK*d3Bl*$>Zzwri4>M&IlZ{LQojh)<{!WAO
znC}OsfTRHbAm;0EZOlM*k#)tmv2vA+L!xv7Z1=WduD*Q?`n3n#@jD-=Q}N*VYI_=C
z5!<p$o)oPuW9x6UrhCAR^xw5Qrv-Mvxhju#y#MRgQE*NK4Kc}dIGIm0oZX3|uuG?4
zho8m)oEZrj(WvrxS|Y(xwh2XxS4XK>>`r1Q|Dn%nEw;><;Z6vrVwJ<zEw6Umj_FQD
z^$pVe9F}Sd9l$h!;lmod>S$CX!c;VqWtGGzmK_9}9>M6fH3^RJI)nj0gWd1%ZcjoA
zkLF_wLm9q{kyP?SxW}M<)KS1<MT>U|uvi=N(NGHy1g4{}cD#Zr0Im%6lk{_Dh`N?g
z!A#}y;|~^>j<DRz`u$GCg7)ZLeTg%2@zJK}`Jt7G%1_1gN|_0xMRqcdQnI=VZY2?r
zBIiS~USfjoPxU!~lsHe(v&-{%^HY*|!G+%+D2l{MCJpnom}C+j>=zO3#iv2(Nuc1X
zEwGVtdV(pa0nq^RgHy#ac<V@y`zh?}^)zr{<}e>Gjk%>)HCY<)BP~GXG-$lSU)f_R
zwWBgpNvUI>Qu!0ifVP+33C}#U!^wk~PB6QncfvwSF&gq;TzeCWk@wLtoKN05o>Fzu
z!n2dro}c=)2j+}nT2Mqu4BSZ0f^oJ_T1Ri%20#Ub<M#(<2(oS?1mmMT(vF6<>lR^I
zYsmZ6qBk^2oS>pOi+UdgxPf3Jz`<xz&S3NO^br<5X}9)J$5Erw@kqgHhmQ238t+az
zr>4erVGVp^0E}jz`o~KL*15f2xUUtnI~p#tlUK)<<uJgugkOG1b-QXY3>$2kR5ajS
z;9dJu^1_jv%rS+!#2T+#Cnufu2{wkuJ7o*BmO~rosX9Z)NvUZ46mFQtWh8`s0L*gi
z%OKc}`TEGK{$HzzfOIEM)zNgj5GZD+QKD|0hY@PQ0Gy1nXsu>>{m}{XbHND$Qj+&G
zt}EKLH5zVmvqBN^{m*iUd|{0&YhRwn(4Q@zF3pQ;R7vi@NSoWe3lEiKwjyzn$_ntb
zdrYieMR4^wQ#xQ%XA+L#lnPKspV(v<+gL<)?XuLzK3+7z3}db}vVW=_YPt=FC8r)s
z(<*U=b7rQBouRWVtIB}W&O+KWFq(h@+KNXe4Ivzw2ec=5Fqzt+(!!i2RZLuH0|_?i
zrjDYF)lvm1n}p&E2L!mu?BAx?LQ0DTBw3#k^woiXC*yzx<6xxnHE!7O;U>&pQcrY$
z>D`JERYWB;8(L>SQ}b0&F&rv9$t?SF3{r+aQnL(+e3=w__IwEiP=IV7v`^c6eY$4o
zclKPLkGvGZM8dR`W5OH_fFK^y!=tVUo_Ti<ud~Nq{YWBNjC~tj1KFJ30{#u+NZ}u>
zWjMCnAX2(K6U8mErItWzl2=kG;O`row#=u*!Xv&K_EC@1tsd2sC$+`PVmtF`LV9HC
z;W$c?5MvEUuvzg(sG??Q8U#bu9rHCCn%Mg>iOJ1ovxe889>`lAN;6~0<H|U(uD$eF
zd4YZiBra=9cuYep_j}$UIuM)(DPBtB^>mV=Hw5Rfp_mUbXG@p(4-5)y4W~+tY}LH8
z1bt|dk7&A{&>1c+AW+Uo#6DJnk#lqk)d4*nM;FjsjqfH*`b5eCH&4!R)!Kdx`#VVy
zyW=}0mDTn@3Ds+CYOcU)FOY#aWTjBdpp2=y_;0@%O8Kp)9`ghDShjjlRHAgR7|l20
z8#>_Usjx$6s#pfkS9bv3cix7#oq6gtutlXAI%Z9mgW1k<DP5QbR@tfV_-$~Vz|sQe
zPA>QS1CFCJw2!mJi%Z29o|sCLyc8IV=%r1E-B1i1uU$ba8C(X#`B*|rt9|9fKyXQK
z0e#KV;+$w)DAmevI%r)2ry3A9q)`DyZWL3NFcES{gUv+rUzZRMDDjdmTKUF{IuAY4
zl!KUZmoas*gE)YqNqEJSk<WF!iAn6)+YnHPZ+60Z+4D2R4;mnZ(|O>&`Mt1<e7aw5
zoZo0hp%|QwdR0GMbl?}YQp`};L&-1}{I$3dmvJnFTc(gL;<yY|Ef3m7+oBlI1<Dj2
zM&a`1m+p6GGZ{VHbs+dSE1*f11Hb(^oSM$o8Q-;1ziCc!vGSrk)((Ep@tQM9w#m_u
zL{z&yf5@spIUvQY8&BH0cPV~*qBy)nTSt2B`We{G4bgaMT(<{fjA=&mvFBg-;grVm
z5%03Xl%r4JP8-cJj=kI3D1ZaEjL^Jd8ky(vO0jm~N~xClq}xHXDM%)Z=h2lv&g8-f
z)lN~ug&B;Y2zF{d{BTQBQHc~bW{1N&u-k6E(Qx1C11j6?GTQ-RA;VMR^kMg;UA8wx
zjKY>5t7+LXlZJLt+FaGha-8|^5Axsc;>I;7vMd3jH`+Q(*`-qNx;i_uy07V0hh8K5
zSfx!T$Q=h4n2IFM?p``6Fi4GXv3elPg1(bD5+o3ypElia5t~1s4v5X9D_<o5Q1BOb
z7|8qsi;vf><a(>_{j4!W7^xSSbXZdmENY7XhclJ?qaYY=ufr&yYbA<7W&*j8I}qXq
zS47`YSg+Q>0k2h$^XtHrskM(GR0Q7J5+?Ng3me++9JHO5%v6`De%d*7t7k=-#nttV
zB438u;E>sStzPR`mI5ZJoX({O5v68IL;`6-QF#?F1ReMNFkNCWy9m_Q{%QN9-#cix
zk7Yt=g=q`{6mk*0$Lq=kZM|;q!~V@SW*Z(9x2Da7valdb)45Xx24+&`;!yV5GU_xO
zwbtxrdF(oN$Nd=f>yh9ny0J&!Y3Uo+$x@|$QI)&n44Tv^#+v=oLcyA?x3l__<M!Gp
zei2$88xvJ)1Pbic7R8mS*G6ayKm0_Ld5PVu%_FD=<i^qQ-{<8sDuV3(C)wX0Y8P&b
zs%E(n7v8Uafp-;7=&_|?s5es0iA*P|U-gp{*U&iev`DY;UhHc2(k^ey(Ih{M`HXX9
z7Y}REsGRd8(|n=SZeNu-eLIy=S)JoWuA1ppKM4k=X)gRk^0Z|RNG?AwsPM3?0$#v9
zN-fU1@Q`I83b0FJItX({mimm3s6{~?4#l=0#LtRDw5`sAfj{RMYYx%84s>lrKgFOV
z+YFSTuulc@Q{j3Qu?rSh9guD0x&HzPl|o4%Wh^Engu(eZ0$^nZY#Jwh3RWcQjwBV?
z=1g&$adD8yzF}Ts{>#q22s27Mwhw|Y#MBONd(3!pr$|QkQ`lDV&cP@Rib-%xS6j!O
zI)^n8${S5VfI*o=nI<utW6KD{6EUG9UdRy^^ofDNlJJV`I2w-~+3_knvKF4No_i$b
z1Q2Vs)_J@DaMn>?3OCbIG1&B7nS^>U$6+=;1%8&gWy%^i;2oO21Jx6jJ6Bg1rOTUp
zYP-T{SW<j6EGR5CF&nHf&vF&~8mF&}utv;aWGUPcS}ddI(>3adf`N(yg2x|)$klj~
zm>@#rf`M<dbczd;-;>cBDKR$T=*8iLg5@YVpr{!li1C#g3C7SNXQ^N2C|rb-NiYnd
z4|q%n;27pz=31j#&CJtmp|?hGx38fSqRir3L^c-~k_GLFb>x;X$+iW>a47SHc`TU)
zMyL$7f#PE~xIPXfm3WeAX`~{#s`a3NN(pN6eKK>V2uk7fN?j0;o-I4s>{1{>s1tUC
z7%g-<;ARvTMMH)e<R&I?U~1K)ZCCRyqX?ja5jVY2ayuQ6{KIS;wiViTD$))&z$+`P
zs4sVV&D<GB_Z>7p=K?-=pRYcK<qW)vRYCqxBwTbI+eQpT1e_`}#OyE)FU@!@CI?tU
zWk)5xmN%OOrlMPwoJN&x&vk=zaYG6s(mmO>mWXn6F>{59YVJbYeT7Gv{ThxmHUI|0
z4nQ5SvU|)fDgxKCq|lH@F+f0Xn=xomI+itguE4Riu}+ZDu<n}9)GbpArvZd(Ru#i7
zms<d^Dt-jV+NB-bHV(A;u-(${Io#PV-kF8aDFlfzJ;{TFK+5Ry+iw}uqAzw_h!xdW
zV7>k$U|k5>-|qmA%MoV?Pu<Y93_eby>vGzrA&v3eir~!M6yw;Z!UWY<@uC_$fApvj
zpvy07UiDwT&VOk8P$TzR=R!TGir|R<B0EZ?D|11pfLJ2;KFD=|5xnwOi8)>_r<BAI
z#Kuj)XjM$h2)ZYk@v$oNoroN+!HUraT#&1H)*@XZxS@7OA?y={<xheejJJpEfL7v=
z@qf-_v&5!IXAoc!AHBMO9h@o7Pn77wQf|~;jk*L$el)|LB#n7As=`lY>jPh#j&Wg`
zeIynXaQ(L9q0d?8Xt8}{zDD=#)H3p{YLz`sN(Q-EcV}PQ+3_~B_vzSjEKNU>vD7pe
z*rZR5{N)`rVNBVoY6^E%ZJ(Unx9Z!o<GZU08cQ)z#b+gLQ;3$GccQTgJ@mur$|lGg
zjy=N{nF97|WHpkOH0UU^e=DRxnNN{myi!G5Ftk7+`S#Ej5v0~5e-dy$OV<mCL|S_3
z+HeQyYs1wN#Vu32`a!0ow{D5=1>kmF)vRBc0gxDdul|h~T+qGa24{Z!kB(HBi~oZ6
z$w<&YVIPa*zdU^kKXdW_wl+V<fB7>$e-(o|wd@c6YKKzU<#2o}2T}Q}oxKTf2*!br
zoW^`Q6i$|d3l8uG9*$vgb-^eM=<d%0p;iJtGD=JlC4t;wQZT3e&Qa^2zq^0XdebAZ
zk{=xG@e_)y4$WMPZ=6^W>Hvh^Y&@3;wIJIM{dnkEZK+mfKHsGMRjWSeHuQWRj)y8P
z@G!uOT#y|@7+>{o0oxMSy@R=5_uhuI%jzgm*AT$@KIGDF=3kJNhQ!~sTV)Hzh(-f#
zFyBZjOn4~qM0j8br;wbvpJ32=(y;J!!!!xTDkm$C0-C~c@FROP)E+85&`_tEX0v_(
z1GzRq)02xqbhTD%(sJ$DP{2kK#F?SehNzWn!n|mWo8Bp22M{FLszXrlZ+M@L7XjP{
zlwTuTPfv}5CT@&Ehp;STG^$LR4;~1%^)H99x4q+iSxqhj6z(s*#=u)^KAC)!5>TL-
zT&~p~%rRO^zgJM2-gu3~+j{i`I(agk!#i{nA6!PLBG8o&%PUV7RPG)F*WdX^3&U=F
zx6|luJ=kj>w~zMPN4r1uPg^H%+NZspOU56{ATW*a=3qScJs5o-ppjCTrUyq|sMy=y
z8Nke@6tsrEJ)l+Ld|<%&rlhOto$l>4X2B5m@4##9@#6PRVHCSNYin2sjaM7*rcq<C
zx!DMAQrM>)QwY#&>|^#ciGahIHi8?}@`Yj%G(=T;G=*knV?U)ZNb0Twkas=_C?+-_
zE$jYpZ-t|2@QYWie_6$d>m1-hdit`uyIUh!5XSv@r(jeM$m*=H3G|`^QUecVjqhrS
z0y6Nw?^-8EPzV)6jdu(UilQ^UXpF*OJZu<`#yG*1-1)L<uV;;cpJIk5rDdY6X(DJO
z-tOk6*KeiKBpf_|@BP+k_pq~DfJ}rmm47<1LVT*%ynI#hUIA5$nuC|#KOg*sAO=XA
z4tHRBSexE?jflQPP}tz()~iRGR11dq-fN7c$cL9=r9$1_21(_m7f<-*OW3CR*8s3M
z93kYPTRnkV9jeqG{DlE6BjI(jpMCR<!1}@QNqfKZ<99nx=1Kenll+VybdCTek^Su)
z0c5#A?a6sKRd04kCp#WLIR5@kf46(I-+A-h&g|nwgCm;QxbJh~ATlteC!}#!bQ+h3
zP!dhe(I55X@WCN;(B0j^0JsXZ6cQcQ>V7=AdNHn*y!mQuV50D@eh^OQHvkf8_-E<c
zK{=J{8tEeD?t_8g(S+)Q*axu!2g;;;5c_~0iM|>2wVlr{oel1mqBLi|9}g~HJo9jb
zbu(g1&B8|lEY4^?#mw#vVhb1TuY0uRPV_ZQ?ivo>g!YD?hUai}r5xprtsdA)$gH4-
z>{+kfKiy?;Dtr^*rUM7Kg;n~8oudwXEved{!1ji(MNRyzUD#`8NlU6sBU6L0OT(fI
zyhV(m@`o9Ujmxe~e;zax1!&^g*w9q{fz1rThJkHX10sS{4F3XU!asZM*Jp3=3zx%h
zHak#z;BZjTjC?Z%tq0tgs?vGg+i8p^59sMm<HBoPTnx`~VubpL%ulxnTNAG_X4-|k
zqvBD>6lFy$GhG9wNt;>l>mAsePrER~zx>ssZ%FdEgw<7J@^lNjvSC@P)uGZ~G(t~a
zJbUmL?&HoD6tK7n`ITuy!ArjN8S?lWj#Uh$E&QV5&Zv}Um3{CRMGyxwuQ7ur?cqP(
zfg`@(Z~u7OKEkYZy?!4b{CNE4g(}GKgGCv_Q8%6@_-_&oJ^}@5j6npC##iuVhN(}0
z8H7ivA_*A?@A)z8bpkPeE$9JXzKtfqc^q7$cM!0Qz21Rbxezii18hzLy7i*at56kb
zJMbDRlngQN6nqNWItZarYK#vCzIMcnBq>&<u!Ce!DYpJYn{gS=Y59m5ZDyv%bp6G%
znmu@r9w7shcu%5P`s7l-NW8b*!}jZw_PaixTMz!y1-1@`*4GD}U4woA|2j>Qv7C}t
zKQ~{$cru#}q$dNGrMl6@-9DHK7cOE8j#<6I{_4Tc>~`DJi1lt<Z=3@Ved{LA-IIt?
z26G1S?F^CXJQ<esj`#o^8$nvW=a5L+Gusa-?CaL<_ZWAst*EjYi?tD)l3t@@!AIz-
zUD2B9fmIU7wo^)t3(W$;>4+`zWP6uPljG~tEcxrdeUiW!Ej2|fx5@;I=O>IeO;Em<
z&CqVQgsjB=MKs+X-!f%UzwY1Q3P^T$V@ogP-A%pq!;f<&GWe~4kVEtRUia)|x2=0I
z3y9ka33!lRNAbr}j8X)qC1z3_1hv}>*x3^Jv|CSctGPbn;Vq07PT9XK+UIye<oMd<
z|9!v_`CMXVh@0>@jSjLkc9ELFaP>lQGL3_LVM23+0~`@@*1ARb?7-lxi8r629%G0G
z^U3_Yp_CbkKBhCH)oh)Ls0iHcB^$a}YLW-p749^fPq33GO6oUHjQnpsoBOD?wd*;0
z0TDqlgOxfchdM`x1i@wf%gngIRfPdn7ANyGY79w`h4Zxb;PqMOV6XqKbNaU5`>A)@
zKHS@xMh_4X_?Kb@r8|Pb$Xi3IBqi3AN+_6Kg>f{Uh&{(tv<j7JRH0D1Bze|B`av}p
z>Z;68Fd($_fR^!;I#B{JBNJh=S&eU-MozN^A*{GHZjd8cjI`x%5Iwbc2~u@K`~ywz
zX!1c~@|RzJSL3-_F9-e<`5H_oO2bBz7Ud~qbco7`U#$#T9Hr10(1tNtaZ8MBwu4D2
z4jYE@QpTi4;4GR?t-b*>Em*f(#NX`7mCYPyWlgP?mF4n_%tm3UXb?!FXXJB~YWyod
z9J573?2S;>LS6#2)=CP}h}3i>D!qz)5SC0XBMan9sroiGbAX6nYXy{;!iAc0*`AcR
zr{u|^CTwvuN3F|b*lfc}P`!5tWs<JyNQt#I6i~9tNoYxny~X`2$=4!Ls)nJ~W@xze
za^(Q&@IUpt>3dqhqSYx}<<o<nySQ3{qj3qj_RO)MMBwb9XG$n>j`s}G`V}b#h*l1@
zus5yU9B){8y4<Er00a1Bx2wVC(d<6H*gg5___Vv~xQT6#N{60pRF7U>EHwe{!<vI#
zStN%@&BVf&#|B^I$V60;uYH(3VT%Qmnr9C>gFuu8<Okw!CI81^>-%<J1Z*wi{1+um
z2YQD;9-hPh|2bWwc8|W_?H+VbYEt9NDr^{j0<T|pj`;hR)y<myYV*~jEz|gyRjG}2
zHu0Y=mdKE85RUt<5#H4XPgrz6yRbTcKkKwl;cJc6#~B^S1Eu`YC2^{mvU+=PVWpK&
zHPnF2&>lS4-6aU@RQ|c~^y&Mj&nA@z8ixAe%T0LPJ8_FXg=Y$$>e*LR65-)I-lE3}
z+VXS*9+?GKv-fsN*H(sF+ud~+RSm56<$q<D^yLEss|76^tif+(C{x<HKy#@M?m)|e
zJ{(NJ@bc}G{!#0&y(6XrXnr1}e!lyr-#gn!##$FXI_(^_58UF&`UK;W3e<Y{_1|{<
zA;mh3ykF+w;G=x^1N;X=v7@>40RM3J_+^;Dzbe3a<c)tF_0``Y{FSsoP$Zm9{2A7`
z^f&ppG%weJ@J%Er3`rh&^E4d8p9qd0>T-BaWwl*9{-S4TUm~;PS7{TT1^o9{_2tq}
zF5!!WU55!pBOKrS9K;IvLQX5#O>jQP*D`F(GfEAR<v3o^z|o0r!T2p6Y`$nx5{b~C
zLc>>BZX8{YBWi&R^LSwAR5j**fmg;3gGn0DV4<C476e27`r;XtPor5vfaZm3($!@+
zx}|3+S`nsUI!36GBNNrWyqyIxbk6-F=Q<rwg_$3JL@|aSi1<MKY$Fz!nkNjDiy)%<
zzuscZ1RQIGp+az~SG@ipd!f4_6&1kBw?3RUGX~EkaoMAYpgM|u0!lcO^09xT7BBE8
z*dHw23_Ww;E9!eFwmyCzU(Zwh<+=Wbp!Wv|nTu$4NnPS~ji3)K$CM=}d_GPX^R}L2
zEpa_!P!48ue>B2N#ao)G_|N0_bn}~Uo_^K96;UMnpkr^V!8k13QCN(&6K@*5t7P}+
z%Ffm?`+zoF0ah5`Db%xv3+?p>(PTn1E*Sf3U?ATfwobmcXK)TEaybF?D4d6>LbI{x
zK&E!VB#S2Y$>+5Dw!Qm(|77pAvnmR?i`Ry#w7UEGDuDf&Di2@|+xia1BEvQ7p+#=3
ziygrf^TdU}RnnP5_PH7;aCZO2x55?u?JZEJZLfn@sFLP790oo)d(Nj~#DO$s&3jp^
zSoI&+CL!Ao{?gE0;sy5Mp|{=~c&}W;kuCf78skUB^FXow8+8~oQ0`&kId?KB%m7bt
zxc8>pLa6{Au)#zPFO&3*n%$2&_nOCVyGK85lTZEwv@ikO(wA=AmZimCXi{ifA$M=D
zUS+T7xCq%5sEfI>LfV|5yolT(YC)~EpcaRAY|*H+xFuZgxT1Dx6@BTbZWYT47ThbA
z6}7J=cQUt>cT_UHWUegBsvV!Sf9PlKPaXDmnVP0omm4ms+o%qPN^C)~iV>9WRI?&B
zV5r8zECQn1<v0#7+IyIUl<?e-FM{*|cQ~_O!T$QMG(v~CFaHbc?UJbwg&`p)wz_KF
z+&fb?Gtv$^25ubegM%Y*<es6?u;G@Qd1SER!n8*FPQ7;D)CvcjpRSS9N;@-GuDRay
zs};NZt7r4N4~nR8jyA(NRYOx8g@H9RzxndNyf6Rv0&x{Y)r?{nU&7a%#={yD^JNc;
zkAdPd!wk$45|=(&Oy~N5dr)$Qe46evjb{6Y)AB*dS@kLVHwU2Ue;hu@owM7{(ffz-
zKq>vrH{d`@kU_IS4@%DZ?E)s?kB-o}aBzR+M+)T4+bP&9+Yg)3&co)gmIYq^g)?&f
z+MMD<LkTFaC7cA_G-%!7B?TZu2j&Dsg((I*L;ES@Trg+3%IBfVGySVWYg$<!rYbrr
z+ALvITIHv!i(rsdzE%^l5kr%bDJ|gYUxk`dTJ$NJZs9EjhI0YA${(b4p}D9Icjzwp
zmNy^3l()Tyz!?<~F|&}uLhZ?FHU{38-#&Oiyb7EI@x*JyqyG$s61cnw{<|0qefl%y
zU(pp~brVH5Zw$X1m+55ea%nV?kzR9kPKxoX=FZfU(t}r*tVtP`G@UZeduRhW+T_W?
zf;>82r*&(5mVqv|atCLhh1b$60Vh6>^`+N*0<1XpRpTxjGVU@8nXf1{{8^})P-oBf
z(kN5du4<-+u1P@9w@Frb@Bo*58xfkJiWq_Q@k*%?y!5i|c#Q_TdM4f`b_AQ7FsBjO
zc+})Kgh`FYIDqd%EMoA>6gKOHZy!7$@>)bfWp2$UWv?DQ-8v7`?E=vW#emMyn{Bp1
z^+tY(H+$qK!De%}(Hva^&goiSMZpmRC(@h0Xn;7>2%moa!WOMG*o2|2pj}!;GvNI5
z!GjAI#tze6X^fy_+-eOU<YmBQS}v#oMDrr>8hg84z?jyXcK@{9JFR56?>nkP=hG;f
zrB?5@^)yuPZa|qUe|!Nl+;CwrB@0y$9#H8rSh<pc(_UYUnEOApPWt=ZlU<a6j&}Qp
zt=*GuuaX5)feld}6dCg&7$Y)wsG@3KB3b}BK|N#gL>);D)HVSB-Jmk@If%hr8snkU
z;<HTpm;ai49EP#im>HEnnoQG?PEif)>w$XFX0N*y@2HtU?bRx4LXfZaU*oCQNJ@_+
zyY!Qi1Llu3Vyidq(MXm<o=?>(nIp=n_^*<cC<AgHeuW^Ym&~eOJkbBao{gVB%Y1VF
zpR5kO{FHqx_W#`2c>3%`#{cu#S1&&MfBq?-zse2h?#b?pXZ^Pi{wjCM>USpL@ie83
z!sLogn9|4l3U(iV`CzWXD$=W}{gaHI(5Y{lgcq0`ke$$zx~EHxF@}ZY;$>QeTm{95
zp!QCId!R58etd!Lu@`%MarOQKhmG(t7OhW#wN++a`TO4u<^SAIZvUJ6)=x$Q7VrP9
zt*1|)X7>M!4S4-||NjY}C+pS?`=!_LTC5Za2i`E6qsSp18M;(1Ks$x;wVcKW=rq3h
ztPX;DntDBqnl=tcBk$V@{6^X9B1oF#CXQi0F&-n<LoadCuj<Ia<mi^h;rX0%qJW%+
z%A62AI_9yMdY*?<KPGpvNm6H*5XlZ4aRyZoTEmgt)YsY18m(bdRQiB;auuQrvCa%*
z5|?ARm5?*gV5LcrZp*m5+}J4ltqckSrm?3<jN$6p%+)`~gck!1BfLQ$1a(O_!(Pn>
zz|ff8yF?N+LxZjdV;=*zHp|8X{aTPw<AM1O=YybVNNOlDvilE7EPGXZ!)P$qxS|Y>
zSu-|4gVxX=CuSYAOOHJpJ;@`n4yHIp=vo~qZ^&t6p3-83nDQW+avM>cScw9L8tP;)
z0WZn;6vi;YV0a88s16c%h%xL&@IsQ@N2Bx_k-<VQ{7A~B0n`l<`C`PbDdSm^$P6gf
z_1jL*>vi`}LFjLL@csCt`$K21z309D30}4-0K!S<&D&G&ZTDcWebVz<M|<$}==7xX
z`s}m|4=Sx5)U43nfp@K=pS<>u$0zMx&+DFeox|gU4zvdyoV0+^Z};k6=V<rfY_D_l
zrtU!--ck3|I{;Dm6pEd8>)0<vY|qv7y8GT?`(*bm{A|7M9CS{9qAvG4r$^WwNX9@d
zj$0?Eo!zs8)`@p~c5>Y9QENCqIKg)hTAjo8UK7TEsj4XUjn{jN#!BvVyYG(LCpZCT
zuCJ-BgARrP;_hI!d!3W^?kP^oeA@*e!XOXoUhlZQ+rcmGAKNga*2zzGXqG5c_o&zY
z`x%Nqtpjhbb=Z0XbFAJ09ay2=vy=8A4!paM?exxG_f9*fXQyrNO}D#8U`H9Qv)k^y
z^bWc`0^C`zU58FiTi89e0#Jk3@cs2!uY>R-pdX#KPfpH`$z2@Q{2f3DV9<ivdj#w5
z5zQHZ)jjzM+eKi|Qq;Y7Z`<%3*8E7OhweTAjvfGT_tY*4y#hQ>t;u>v?KcOVHy~xU
z@og6yde`ZJ<VuUz>0y};cmA#gJ)hz9Y0+S8{MEwcIxVf&+4ov|KXh>LT$s{&0Yo~2
zKJc`6w)<9~&zY@?I85)!6EcB60{|VLp7ak}KN4$5tZKji_p{FK_XnNcY5#4%uUXdY
z^9K~)atOps(=m?A+Mx_5(7Z1p_$Zph5EJHcRIxc6MI6XLXFB1Ku=Z(*O;cuW@9CCz
zewzj=BpF9SJLl-0VqHeF@vWnlGBgl9LK7>G0tzIYwggAy_5z2K^ub9IC?&_XxA_9=
zCUr`M3Cz>e7Z`Z##`|^5WpQ*bo`0msA^4or_W3YBievjNH2RTqMFdkgwqU^9-j+0Z
z(t5YES@#b9vA?q=eNOQ>3u03SvtVMOe{_x!=u$Ao=x^wbk-!MCWZgTDB23#7&jZwQ
zP6cpjFquU$o>4<xMWVCJ6aRwK&H>8+#o(~+7q%MsaH!8!wJRXmBZ`wM&YY-lL@O+s
z<4qd-P<cZ}Pg$ExY8Y(gr8o0o6)2kmMP{79jE5X9?<vn3(ICB@1&D~U-tJmC(dpb*
z>n2H2@q3eDBqJvMI?g<%ROr9H^z08Hr@}T)G(QzIkZ^-eWyS@>p_i&MKcd4km=Fu0
znk#BRp$xRK^^zMvoY~pL!xYhGXRD-R!6T_iNelsxxS~R(lFA0RaOe^hJ>k=t&<Y_O
zMstoPzzFqSVM}?u(k)U$10TcCs&_AeS%|y@Zv=~hfw+YYaFFQ<-35jmWCE}K#xA0v
z@*HC<y6gYar7r+OCNIw(A35~pGU7YNwdB_|VZk^G&YGF@8lgOufHtW17#MHljz>;8
zraWBQehjs607Mj-D~nQ?M%9$5sTQ#p%K6wmZEpiyti3EHC{nMA1mw)Q@hbV1X(0w1
z$-DwO7TPOWr=_9ivnZ4_7rqOz1=|x}|EqW#0o?Jevu$LZX#<)uy#MghUN@-4%l0~o
zKH|l@B!lsXnw^aUzDE`bBjCI>a?5NuY#wb>Qli|d8)iD1RCp($aqu9#AS=~`1Iqxy
z`{<$=F>%GHAbheh-J?VwlK`;tR*;We?JmaQ1xA$6!OG)+?DufM=Awzt%0O~=O&)M;
zYxGe=Nx&=}`nb($jZz#vCnCfAUzBc?`^JkOPX2|VoG4ZmO-s5*QIhljaoA^M@TG>3
z;>4?}Pyi?`MpF#PT~jc#Vw;}p)u0XpmgkrkY)1ZQ<nlD1NLo_Nnu9)|FkXsUs=JM*
zObv9l&uS826cx(YL?^oH2^*bLa_U-h5fUmq5lqY;07M2f+O4BJ<KUaB&YCitKf=t2
z8#g2QAWA;nY9MO?gZZoR75V!CrlG+*h|`|8`7HBlw|jV8^6K>=zkuh#cv08(5MDgH
za|kcWhmd`xhd^|n14_{`6cEJ~w1RWnCoypxf|yUc43HpR6gN|n(<0)s!3c<MC^sW|
zLH`%AKlF7{%D<BP4UQ~`W8_t)AE(hZ$hI*ijb*_T4pOaxv}w8!^bLoeR{^gCQ0(ZK
z)Lb6Y<r>$h`85@d%^*Ef=m3RY;S<+@{uUH8!y#(n5`Qee?QI}oQI9BTSD2uR5H_ZE
zIpvT^rfDS(TOYf#Bce>OO@L{;3fyzT7awc8JP&IWj>mcmxQ-39bpf^xYE?}*ry53%
zgHslm+laLyYrHc*#!Qg`RU!&IjAwD+(?Og{SU{o?aDFOE&B8t{j#kmw`GXaCLya~@
zGZXT5ZPUSpM4)){U+V0vnHQM#FvI^*SY$#3%>zDJ7YxvR9C9my4oI}|r*L$6o{)nr
z2UClsL{=z|GrWu{f;A<)fOfZ?UG4Iv*pRh4l1*V4UWLOso-}rY8CFqqW;S7<<9Y~$
zoR}FrPq_&MJ?0)#Jln=jG#V8)tcZ4B1SvyXGVs^bS|2Ex^B?GN*&?HqDGSY4A7=U2
zt@;J)Ekb9pBoJDee_?(}kP<xjD@AXYG$tA59p^m^WA;RG=70lTFpu^Wz3=Ze5p$fC
z%p&vn${){jnT_!u9m+Y&x#_71DC~LB!116|Cy3Dwv|D@LM!}2IR_DNLY-Wfyu>eZm
zAym!RM0bLI`)Id|+Lb;?Lf+<`rI6*^%Jfx0bIUr!4MBRpja(Z_#G*qiT{L7=8?`z|
zXn+7xSoxq$IT6ut<f^Q*?44v+6ZR^CuD0Ohbw2;3)vR)*#w#sh0(-Flgf*3P6R01c
zFio}yLw6|yuDYr$DsdECR~1F8I}`{i5YwrP_JUN+at|p{wWvLAgD6!|1N+d;f_gZL
zqH0|_#*#Z~F6#S)-Jl9vfWlZ&|3024mzb-$q&sSu_pQ3&MIow>o3p5?Q#i`**OWU2
zZ0jEF)Qh-493+J?&Gpinq4DiMn2?rqm($dgAQ!jw0}d<MkE6-LR+kC#u0P9;fH#2M
zcQLXr+j~*JF8n%EVAwcXdkOS1rwpAKi~3&)Nw|BC0so2mUu^(;!I;`LofA{AjzV?5
zZ)DYOvzz85n2r5G(1OVfgPW3B&^d{k${U6LsJB_Xj(mV-yMqy*pg&JZM?7Kb4zJC#
zPbdvZX0H0@n;=z+_i8yGQFj@Y<=O-23~v@Sy8M1}dUvMBKpx&?L3R|}q{}TZoogk;
zSc9gZrIP);H=o(d6vg31c5I9^i=dsGAYoAvyvoouI~@%6de?5_xsAh;>I+VZC7J*s
zC|&Y!i)OoXK-<ZJ!<0^j9GPFd!5l7i9gZCf!0QPRkJ6gFd#mdSh{$oRn(37~&GNvt
zf?0jC`7E9Z{z0=ZM~F1%4GLEU$T!Xo7&$4B(X+FiZRUnK+u}*gw)!BeLOVixZK81S
z>nPi)kwz4Kr1{oZb!(J`l94DU{t4@7O#)`okAsogKSo<uFX}ZrVb$&)DLb9T8t0p|
zw?DU;YiK{a=Zc$gH;PtSqa&z$Krb-G)5Y#%jt9`*Q^YlqAZJYX92uo`fYInra)O$E
zPIB6&GVeqAH*@)mt^IeKR{cNm$=Uyzpa*}F{olsZ=g+hGUtVlHd-2)+@6Y%cql&}s
zQTMca)Y-MHfZeB0_?ksyh&Q0j)u_`(?c%k6i+aWZ5X*$qH{e?~i)(sbhjp#fI2cQg
z6V$DeDH>TMaE82S<PH5>x)Lh80iy=OD@p;53K?kol&`vqMuzt~s2RMN`>{Vw<yz|;
zGm6Ggd>mbb12TsI*=G=<4FKJQQFClFmW;_}FZmc;KS?gbQOYJ^zN*2UDI2dn+qIMR
z`E)f9V(`a#Or~`<3~AO@hF=~X8&aU^7ERD5=(Iob6HWt(z($L=3F>++7^4cCGTz{F
zp!W&t@z_F>b;790WqZWk<1>I-cZ#8<ozW#;m9n<q_-N!=<H4Tno%VM50Ifh$zvfRj
z$~PHw8HodP2QngaJj|~%k1=IW*3hRin)rh_N}89ILi=*_Y(9mPW=J;Ym_A$2Bb<7Z
z5SnO6UOdJDZ;jvz5MA?77leb<wuN+g>c=6cA%NMadvrgu8q`*paISFlxgu*sC^-+4
zOYf03Y1H=t*qCaW;F2WKAS5K$28~(Nv=CgvgJL`=WuC}(tZeK^IxW23!J%1~3fgX7
z&6&BG6Tup@<RceU*8YiT<HqM<N@h58sZREr3<c;6Q=`OF-Gx_OzX;MpHJ7ubru1pl
zHzi(=C<<%J0^)qe-ij(wN)apw-qHNxl5qz2JHmhy1;}27hB2)S<zEg{wO{11KV-vH
zp&^NmrWyiYDR=58l+=!#yfH)?EtLd^!Mg~w50+F;gg9vL$|OV&osA@_r(_s}jp4<z
zw1C$|J|@$_WgSLAg4aV+Lu=61XxOX~NNv8%fTDwL6bg>}^Qo{%cvTJL6mP3w)n-Tn
zWpUcPMYq)jm0qIBE#?P}U#b^UuZPP~eI##d`n4oAlv0ODRh96*^)@$Z-oJiFW4v(`
z&6r`^+?XV^on^-16yp*wTkUkE2eeL@(8up8>7Mn-+wokKl5~S^^BUQu3n-@B&o?g_
z472Te4Xf-Dog6OHi5ZYx<O#rOV}ttm&vrq{@qZK)ZtzL_xP$-u>e=Q-&j0KAXa4U`
z`QX(_63mAj4G`EGx$+e^WIX9dni^$H;sbApm7aZFC9`2w&Wq0J`bo;oZWDiEdq-$%
zcuM%D8@H0qc~MMx0y)g0FCGgj9`wXdFPl7C?)YHtXPi>_07Vlb4pMaKU*R8MYX+F=
zgOY}z1HpNKZz3{XAdUp)7>+0mx;Dn}s+3@k`^K&)4F~#+uO$RDAS}v~fRe@|=LS-8
zECy6+U@AouItm=09KF#XmUD*&q%zQpomGA?Anhic_Rgd~!HPh-f(xM92Ds?e5MEH4
zL^6@_XEPA<)ro2{G0x`aWAgSv3oAO~I^r~gYk@YGljuqfa*7sFl10(1+>~RL2rIPt
z&5I47D7SE|?0RyAm!$L2sM%DbYka~_nFG>B1OC~nubjK`vs04gltlWV{}_Ly6-V>g
z73s4p(q~ts&#p*+$Q8+0xg7lkEmC#N_1^b?sa7|=Z@=}bM<7{j)@t5kFY^HZ)m09<
z@2WR7sH846YVgy0L`|7eZvhFh7?#HOuU>ga=I!CxLG`BY-PXNdYk&C{p88L>&~+Z9
zs4CsYV3l?C{kBG#J^xbuwf27F1C+r=$M6szY~lmz4WImOJpW<W{Y0JMSfvMQ_pxag
zgR(lqZtd*>Mw_u!e}&d{Q&6K;_ikhaH`vlGMqyO7f86-X#?8~G8*TGs6P~nQ@9vo=
zTkvEP<O9<u)@r|aVal|y)?T~4Yo1`O=Vo&7>$U#XYo9*F;oWS&f1B{%7Ebv_fK|QO
zfI;KWP5!wlKezbjmNfxriDpLApVoBCw2HU2_tOtG^P@VgJ>JYd*!ti!*WRmIqw=Z+
zL#=Z!ejNY-|G~o+J{%z6O;bRQPpen8zo6`14dLC!OD{y<FZlELF$lBXO)@_Z--kG<
z8~F2*{)HdtAVa@@CnOSi7utGhAuC!<{-wHkKxn^(CnKZ2maXRsM{nLg#a90Xi(QB1
zh5xp^-+}p2kIf|TG0ozoYJ{{4=pCiiO{!IrUk{WRBBD8!ti80w^r}JS8(hH5w!OhM
zhOM?)W9@^u7(m-SX<K!O-1n6~R$b9b;f!!C)w??HEA`V+Xk@0MJW^EiGZ<Xm`-T3E
z>ED4L$G02ucN3<L<&h5ffTn;5^zTe&E8B2J4+pAp_T^@-St(&Ri-mqEs`(2yZnw<!
zHuZ2~d49ut1!2SG0oL3hd|~RqZN^Xy7vdLOhsW>}|2WstI4nRfYVom$ozbsN{<X!w
zpb^#ars{a6nzUYSn3weQ|G#07a{3=mJMc*rKnwLhTU*b*%H97x-+cNx{?DKCc~U4m
zZ+rv7^VY__gy(Eq*bIwC2mU#T!=35ivyA;&#{Mj0f0nU7%h>;ama!|6yU8{Js8CX-
z%Zf){V}LrF+CdKm7)gB&GwGd@!I-WmVGHf1Fx3$}u!MR)p7~Eg%p2nv8K5-okKJd(
z@n|r0AHjokTxy;m)^d~;Qs-W_imJ@N+<-E=k>tY|#l$p<lnev}DoM_!`pRG4pcoQf
z=pWj?&X~iw!w|TSxX<06-n{D^QI|Z7UaQ~5(4@QH8v#^5@-}WZzUGTMw;T3A=JLa8
zzu!7OK4|y*H4KDpo>Go<cxugW;twvL;6FS;Z5jAx9G&CwVBamL9&n?5IK`qE6EtCb
zc9LMx6iLE~Kmm^nsKD+R62c#2CgNLf99>+9H>NZyNs9ZEIY6(U?|@%GH^--MPui`$
z{vquBAN!r74pNfNKiVg3Xt5u~a5`XS3^)q;s*J`?0v<GaLT&P0xJa$^itG<|V?Vj%
z63$CquRR@-aplKwJpLi{dxWBFSDBEVHx-B3K?j46r?Ed^*Cua02xnYwJ{t#D!C0(Z
zckcRld&v1;u*22Df)WV_&2|A)d<O;FmUtmHhybQ)Em`C9ot=<55(%o0w7b6A-RS!7
z-B5T4{{p@InIn^?$S8&VbBEzYAb!C;^4PwKVu=s|YeqIL!o)-~b$O|%hjpol^(+2x
zSdj)@i<tS8$^~f6K=*cuI?j8MRH*v(^ZK9;!aJD=od@O`4$arN%z54CG72SNuzUO}
zYt>Cpm1XiQjqA##1Z|v^o&kW>-#z`&8>BZyzLS``>irhV-s=hAF0^8NBYzg90k%PQ
zCXb*Ik%jTu8O1H2r}d=HhSlobK3*VJvGuytqF1C%`kD9Q&)&Dd=EL8|k84_F=SjW)
z`GfbrcX)6=e=wRAfJKj%w@cX(7Q-cu&VTmSBL#_wEk^bNWVnaiKs8dLy#}(>jvB8J
zqRB9Uc~$vWO$x)#jZcCR+o?yarFoLMmnNGx&fDPqJQoMexxTa|97g^aI_A_6bd@Y<
ztY$z)h!Rsk_+5N~ZC3be1zFf&jCpm2e1mN6y`%BaBZniyFHeJOFPa7xW)go+m%Y-q
zpr(>t<mnELSb#(Ohkv6re68qSUT+}E6U5ev*YJOTO3v0Zk==Npw80Xw>-5vo?P9LA
z$(m8`7${Wt)i7FOxha17lki5$RYp-%sX38vte5A0T&b}Q9mdDUrK2b@rcastfV~dr
zH8feNdzA<)Gn+za3eA4fEh{l^)&4BT*z69xYsX5pt&QBSl{ZpX?LC;(zi00mXnm@^
z$9pYEGJD3)#A>sG3yCPoNmsnJXss!B$JoLE^%xR($KfO;)c!Vya7g`+vc0X1L)~6q
zM&p1wPXYiA?1Pjt+c~4dUmt^8Ej82D#g=A%7}piC5QB*bv(rQX(n}WXDUOoH`P6|1
z+7*(qDDF8vBgHz=TjTE6pbrj|#B_+ZfKE0K>%;TH1CjwGqb5U8$>&8KTO1UP9DAIm
zP5Uf!u!ppWd*^^R=L%;41n@WK!Bc`*TL10Ok@dPvqv;qi207m{^m+tk>$vTrQ5C)_
z%rXv2oEy{_8Mf(n6~@Set6979d_H==x%Kr2*_9}K_(ImyVp?XsOpaA#g^{O*imvM2
z*MIAyOm_4}O-@E%u<O)Dk&*oFA-iAHAo{h~&5;8Ryw{-&*T;CbqaOoaXph3EzERiF
z4WuW#4ff{?I9h^wNoJu{RfK#T$6@^uJN?-s!4EGc@JsmDjN(lIgiE;z+T|AlgPY0J
zaL7fj#P7K|WxXoNPjE4adu<28u*F;eCkSBm)Pb)x5}<YXAM~CDWtAVBHV~#lL6Z<b
z`o)fSbcU(OT-fH%2Wm%ARsL1WfD4|Y$+3D{1SuIs7EsCEfci%UQtl3i_JsEXZd7&?
zexxBgr~@{pBRNP|iR|=qPUZkWK1p6KDi_e1yq?@u?kXuQfSmIcM#OPm8|rd39%pbA
z<7LBPgvX3Eas1$LVBivxg}rir9oILq%SH;3R)TKpRjQ+qB2&(3jy5N>h7}eyn79o(
z1(g-JT_m#-x%Q-c+~oxBM+i*#7hs0}j<ZNf4bT}3L;rOQ^?LY=#+4lpekQ>r323(q
z=5H7#$NnH@Vb_ZWPVMOf#574mzA_A#{gE9|+}L=$#R6&-P7ZYn!Pi>-io$j*I{>Pk
z#<-QScF{2MkV&ST=RMbV<zaL4tBXpVz+BMQ{YH=@L8fxyg23V`oP5NXk>pX+P$HMo
zloE*E_r(+f^Qr@3NJ<C;CV@6Ye27FGAKB3eeoY#$@LBfEfk)!&KFn@tq3Odwnxpv+
z7m#sUHhnmlL3|(FR)<APCDdeH?HDQl1M>Aj(RR5LDb`D|V#$qGggwigMrCzBE$026
zTfFSqHVo~PuxNKPeLME2;h<VMlfZsS6eG`vXr_>}k~>n%kIT2M-dh_RP#NNK7MF;W
z`f(X+AtYLrBaFKY3E_78?UR$mCuinZb|!7{EH0b21YT%-R^!^`@MFx`90k|CVFJUf
zD@gReZ~v6%2JeMdrA*Gf#`Qz%;H>>;jBHt){ym2=S$w`+f~h?{X}1m?zBUE1ZlaMd
z3161H5{I!QRB}9$HU7sQrc~PV!l8Mn9I2-B2}d@!FpEj2+ZR&fJ?iUGIIKU?)pC*s
z;wpxx1{rh*e+>L|G)W22lUaIOMQV4}e0Wx=hr{M1!GDwBm(pbwxO0nYP5D>Zn#$Y4
z^FWWg(I}$-8QznM)}5$#_D8{xieb2mI*XnC98a2GyEhnJ45~3mxuZuMw5X6XDfv7y
zeLvEDFC^{)Q0`IJUZx6<uB?~e3${fTU85OJ_s%VG*xfrjXxr;UMg@nI+?2=UO%T2Q
z^{<WJ>+s+2W+<Ei^#_*zCsze52baLz3I$N#I=SNRvqg~3b8owRk5`=xtx4m+Cn@qJ
zSR{*0=1uj{WLU>O2y%Ckn#r)KRVMhoR(6ira&W<sDC#4empTf6S9+6<QGs3h6dHi_
zFm(zC9g?<*ynw?STZ3XLYv4p{Y}WFluYB<Zm-^z1N_}%fD-G?7C{fO-yCS(Lg25zp
zJi!xvt5YYk8kh&9xQ_$Uu*nq=srb<J$oGKP$HcU(1@|v5;@|?qVv7Pz6pT0QNhV4_
zb-Tnr!`NIXiGR6&YpKmiSBHHAahP5NDmFqKB=a%MV?T=7G)LV>=#h<rV0i8iKB5LE
zh}FeJG*1C0G6tF&8VKPd+r2KBCOQzVts+-fVALaxjK=|$sjZwg-KYjdXS>JiP^?|1
ziwdp!bKYf{lmhl0k0A5X;?N0|_`Zu8wseX@u7#ta{)L+%RUcg})9s4S$(z-D@v0Lm
zX79VibYXZ7B%g1-tSw_{LrL8uMIZm1QHS90d$1X+!*dZpD3W$ft8C5YwB?qbKeBk*
zb1l2*!Z0JmZPs(YhJ(4z(TnAdQf-k*bj3<@YdH=1SjVb&-J!_-#gDDHwRLlb&@<Ev
zw6^xZI}&f6wA46)IHb!q-gp5ow&`_cIV_<pE4MD4bT!uNQ86FvFu|U>tbkgLD|78;
zjSW9Y1sBVD+$$6sP>?BGFIt6niYbAwwJg(-J45d%9~Fp^_WP_>Un|Ph9aEHT@d+id
z!8q)+xZ_*8+7R+@gC#Avq0E5Fkb6dyGC9vt1v`p-{QPchnFSKy@8p@!7BOeNcK>f}
zP6jPkWH6OMI_`%Uzl>6fd+P&rXF)NpB*ImEF;ED`=}9CGGQcG<GzDjV9$wI-DaAyU
zc)J>322lnFUowAVmYiEoG=f*DP&o0}^?>u;)U0sM#2w=0FwhL*4PWZR6bI&^H-mj;
zU?M7yT|VO?NDtsS{)f>)83(#ChMv5w4$yY?;)<;FA7Q9a-c=-ZcE7K=`-prkOyh_E
zJGwhw8XYYYNh6a1n1d{f$hh$G71F_fIm4_%^E*EWeOa9<4Qt~A3n$*A2$|_e7@|(i
z{yPu3)@>TG^)&f)8ye4v7T5*!fF!tm+&(!(JEkHyTDVV3N9HE#svOA`=ab@<B$EL}
z!zi6bGmH1C?=Ke5k0${OjdQ9~+`lqKC-7N%?UGBp<8DSDOLUUiB~u?)oAP@Rq;_`N
zog)yNOMpX|J|U~;^8jD~*u^mMHGW6apa>eU{7-hgt(RnA_WGyOcE5YF*FM3OdEI%_
zZy)V-T1UBBh-}|}yW@Smj&Z@ot}I(9f3oJMr@+_7^bY$JK^q`hd6-n{By-?noPSnA
z%z{$0(o0VRH}k7kJKl?DUZZ>-YJ6(X;xd~pR5}`K4=y!BSzOz4K**vfzE`4*F<qEz
z0?B+JjQZu>L;=$Wpr(R)O(_0P5@0NZ>p;iY8HF)yv<tZw*A_ECG%5NoWps(dA)Dwl
zZMmZwFH2Tr2fF+2$+`{%BiTU4n6aRgEI8X=wtXqp$?mM>FmoByw2&bj6&@ElB0nsN
z8~_<nS0aaAp`pMCN<Gp?kcRCSFsi|1Rz;Fk`Jvm{tDx7XJu+RJp-ULBVJSTcHs0M-
zk=v<rNMn0)0AYfNVN?Z(ujk{ByFEc=dk1O7!F6H1g}}eIfKR5o+1go}{JXY*r7cF@
zSG#PEVm6rGNie8E;}tCzAj}pb3xODT90W7J(@RyaVDz$zgGP4rDSZ2$oG%|#THXD|
z{=r%AZKHS4ZXbK!Qp_-D_En|+0L`(z9?3B*5&(-C%+%f*jpxawk~^UtvB9+MwpAWJ
zY^&AlwNFk}t7Hg^CR{#UDpI@|V1xiXSOT39-n1Jh?c;+6Adgfb0a>Ku*;rhByw08y
zwMj<C+&xXz%O2K<qj|Dz<$|KoQFK9Th`DBy`8mg4;Q@7z_B(H2K<`dEr|rgm_hh%-
z0M1c$bP#?FJTBx(A<jyK1Rx=!AB^)BUd+Wlm1zW0H8PLJy9H?qSlerm!`b8q1#xA?
zs)M@N?TnCdGWl?r{3Sf*lNKy%>u3*#z1u~P16bTKw8-(`^a8&{Yvuv12lAyL0TT=B
zWB7JBwB1UW63f4(_SuL^wbEt9gYR7iHy&BmlZh5OB9Rf1g0V_d0x}*MvQJa1u?A`5
zy>9^que|sCr`c?NxT6zUexAF^fJ1UGyX*i2Q4>TRwNFmEC+O#o1VF=p!^A<u>}WK@
ztP+E0EX19-c~u29Difgfn5oh`OM=myv;6U{O;n5XDXP3k5roMA!^s@OUrPJbERW})
z`vySF?djpXqjN()R$>&Z6wvycs=ht#owiPU-nYZ^aG0G6YXT(R9pDOJ`9N<J0~a0-
zss_%1nApuWzHk4;E8!ry>J+hiBtoCl7aMe^Ty-tsRgtN-_JB^P=Jt_(DB^*JSfe1u
zFo5V4_EAuA9Qi|C1cN_P$|Y{?tOYypUF)YF(TUD(3pVC%_wW!f9$>QZ+onar(v(>M
zgybeLG#>#^Fs75e<7Ep8$FARC6eIX&9H`dBYEZlnRnkz*+cis7#3|CT5kLZ%)_`oy
zbx%0_A{n%Te|Jw0H2wqVUTNG1=^ZyZYH)mF$uMITU>QX+q##fP7HOl=J3U#s9ma4P
z9v@DX?(4s`cTZh3=v_wFfP?TKx*2%r+=3p40Ehnr#r{vB%^VG_+dXv2zlGDXK_rSP
zG}eel4N0&?yM<afZXI=YmukbCq2`(^b&t;u06DyGDKsVm1ZdJIym|Ejz9QRcfWr~L
zbxH9>K;l78heSuVzn#t}ubQavRt-@kNWG`fu|YK$rj{#$wkXFzuR&959yh=wkW5pL
zPr9ew-7X*jYT2z_4NQbmRU%mtTg2Rk##&9OOd6W=U|Z%<*Mnkwsf)2e9kmoNr@A+t
zqonW0v42Zyb4)Qjt7FpCI6SX=GuW_o4E}l!P@d@KFu`vfj_<J$kdrp<bnm_J!8QTc
z#+4^P{|mM{fQxk66#tU8y7z-W1_tR{ZtRs1`EAwUI{GfYX>Zf92pcTb>!pm&v0dfg
z3B5K=&7&@HKHD^);D&>}YFcPC^XCBvLqnT$W__?tN;{|;^Gf=cSZ@JehYW(5_H0H6
z9}9V#6*H<{>xcHXzSS^e$xMctltCjnkrmLhlQ5w+pcub+akeFAvT=l#J%nLwB^vPz
z$T6i4AV$wxB{OMzjLqVn^n7gB2E_ze^AmlU@C1B{PfbtdGcD{+t*yciyn@O%@3d<A
zBA!Z)TxWI|Q>A5i*f;2Xg~z|JOt8=Vt3Vhu*j#86&2Ol7Zx2}PqlL5-ikRrMqsZl+
z40Samwby>L-#R-uEv1PZ5HY++f{QDuaoT9@o_2m{H`+fQcTU=ij>-*{i!9;GJdNDw
za}N9T0(ff}51Y?pf<(DUQ?2=f0VjH_n(UFZ`-$sNQ5b8@+zA~Ae0(NC4lecSE2p%c
z3z~;DcHg#lzwezLBLCRgYoVX5JFT{~hMcmR(cm%|d`#vO`9j=`!Y+1x$Mx=>w1J74
z`L~Gq+$#%8SvDFkqHV}ybGlH|+XDhUK{rRA-B-9NvKK#Wo$kJEoLbEE$sBpn(frq6
ziPj?@p7W3cIdpJ|D*u{x6;N%S?Vk2J|7d48LaK_&IdWE0H#)o&WNfx;Tq~G2RVm+=
zJpQo*m3>f~^Fe1+9UDZc-RL4-=7i+8Aef?{i~?%@K7XOa3;0cV;Yz*h)hdd->ovSr
z-tpFM)>dnkm<YE?=U!ZnY~)IGQ0mk>n}#>+G4*gf25QOSvq%SD!^c%prLQ<ap(K@>
z_uFq-_2$BgB-u3pog0`%9mZY}RZP(p0ZDhRD#lhmyxQ@e7U|FLx=B!j!nj6{s1LbM
z$SG>o{X(IFnl4Xigx}&dLBU{+MwfD&jr|L>4_y+l-#MLCh1&Pg>%V={e}f*?`!MLA
ze#^XJxxX)Rf6d!=XO$_9`4-K9rFT}cRB6C<npZ8qJxBwEx+m6@u$02Wy2VI%yGYI~
zSrPW~inta<6Bp^VzZ;rxv&>LEJLn$0!8Fivm(KbXAWat+NUw;Ary%sg$65N%U&*4%
zwGFluW!bxnWrxkGq@wN0mh11}EbIWef-Y3ujSuxrQmL)j6@axu9`BY~?rFZ?gXp4q
zaL|9(Iys`y6GAXR=HK>6fhgq3><@O9`=nqQ2mZ%920KiKb5rx*G74cGoyFljip=GX
zw^?WI3BJ87+{AD+?;o_@^kf6sn)qWs7RJI#2_PCa@gl{bKx}rye4=gep!g66M>%dD
zT9tTsCq>pD0>7N$2Y%#cV}@#LHTj>js&krC22xO^ULiKMQh2k+^Z(5P0BQ@~_4m$>
zGq+jAD?#lGJ6zTSFTutt?ID+4+?*_9aclYFIqK%H^Q5Ou<}-|qz{XaU!uw47!_cg2
z830*15eoz<nw5fU(V`Q_wm-Bn?$nA)uF!|9!6Kf%5^+hCu!Kh7h-}OgaW{84gl*)U
z?S|(lJ$FbhNW!|e4*%w`i=P4bq4;q$Bc-FNR(%vFVJ(l1(sES}5ct{0aZ_3|ZqMBN
z-?e~Z!J_Fz5N91gJ|U=CD$hxjsM<ma*@m>JlH8?mmI>HS;LAy7LUD$02>P)bAvKP2
z+hx&8aEvSlDc`&Z&yyg=yNc^bjVQ@2GHtt>M+VG$=hen$y?uCm`qSQPpm2TK>GiD3
z7V4z|yt|}ot`2H0rQ|y^SiS?8Ug2uewHXl<tLl8Zpjk1FC|Um8-lZ>i+b>E`t-nPm
z59gCvcH<S_P~xZX1g$_be3Ebg0Gn1+KJl>$o%qoxb7JA<WWd5Z3>=e^-D<15-|z14
z*O-=a&fhMOu6;C9+q4F@#A>gy*f_{cZ`SbCy8jy%`|f>y*UC1BVVvITus+8z>^+zl
zD*B%|dU<Qx6ypQ~z(WXl2m&vQAL`=a(;^5PLoep63M^F#He@&9+?z{`h!m*UAY(6T
z%p57-BlM-LKkHeRjVwuv>>n2{-ZTOUeU%kt^MEp&LY@Sgbfj@x^Z;lIV4VDHn#OKQ
zH)-s@-+cNtT}yBL?jogAH|HRz6F?TTWK(Jznx(&)(~mY1CcvPEl?@7&%mBkllL<v>
zOu6G1la&pJDwzsMKc*Tc1WmGLPZX~SPn8|x$HxP%n}LDc;Qcc0Qv=%%$8(Syeu2*O
z-V!p^$2-(!b}`j78%3{W;Fx~ahl9%u8}o#FBY!}4*zVxPRnfmf&{g?Y4M#?|Cr@OI
zZa>RT78<1qZ$E5qjbOs?`;$*LGfCEGJ@F>~jaFlkzAQ8CWv3u*^r5}&heKI3?CFzF
zBusWChkG#mt_Z~j`ZWxkSBM`Vt>3uc3Yj)}cINjdpI;iKKyc<$YZ`?M<K!dGniS!O
zgt~%6y#f`CBlnUvD*p?Q@lWFwPN7iL`4y+dWzcHRe)s#mplVODkCT)QukD-uAXF{h
zS{(^JU}ENpwrp}*s<6+KpKd>#L9-*;*|6RjDXgN1^Y+684{6Dq2fP0wz1)8I>pWY2
z9M7>8_|q2^c|U~WFxl}O6(g=D4%JWVHL`ytva1H-7UN^5t^_3sQ*;na$qdcXLDt-Q
z)Fh0g?x86VhO6b89T*U%#KY>fCz#i*?%5~9(yD2)%>Pt;f_7y1f0{)o_K(OP`sBd(
zg&kbS`|UUH3jhK!7CIIch1<VNI5~<^)Jq}+1Fo$t9`14wUuLi1rvek}LkH-}h{!yw
zd+LdQ<%eVIndnisJ${r|YgAxTnYPpuyDfa?v{lIu%esK@EJu+$3sOJJ75xVff&7}5
zsxan_$w;~6NR})Q0=n%_(;FsdnAVY009DD%pqG24y)0+?;>|2EuCiMc-EdfD5JS&{
zDEc^`nQId3mL$9D@)sp~6RR!gbY=(C_+q(;JH^|@z0gC$Nt(gkJ4Wh3ld%c`_j19O
z!VdqTm@XaQjSfq))`W+^V5SQLFf6{x6J;1JT^5@5{g%D5-|l$NbG|g}RQhw4N~052
zkxZ9~Fs4=raP&AzLJU8;+_f2ZyMz~xd#K#Z{LF!X4cXzqD5#M?CXOn1^JgRZa|F#Q
z<9_ym-Bz&a%+S4>w|MYb&r2M2q2hf({1cIu^0dO;x!)1lu6Wzo>zJp?+&mkWjE}DZ
z&%MQ=O%R}C+VpVbk&P!W3@*vS2r^mUw*r;wG9E7FpdyPBhE{g2au#Fpot=$5A>xC6
zWmuHl25{)-5maLRfvTOKaB07!<dhK?N4*)$ZuL=uW?ZAX+5q3~aOdBt2ir25#X)Dz
zK}s=8iJfPoNKhQ-LrJfR3=ffeS$enZg2gu7eggfKM4-(cWm_3H7bjw7l|tDnyH_#=
z(x!(sTOM2N-Ay0?HcX;<NDL2KDOBW5E-?{ax-^1vmz(@n7?GF~T$xBAg7nB_J>1y3
zsfdf|`|yL+R_-{m#aI;tWOy$SH)wacfPS?Y&|(OWbVmKxY&P+)bB&+|-9n2^lynpm
zF=%WR!D-36%)1v4KV|OGcYD=alYSR?!w9pcV^9N48@=;j;B%M*@{Cb7*W$(D?&)>!
zI*LCck1&od!U4G>bG!&P`_HMZie)YQ2<L|CtR*C>pYsycck~xdl12X3#Guu3Zr4l?
zOyi~A*F`(We*Y=A#hqJ22IOoH{H(~GiNnQW##(O@Z6y7k1-ReDqWL#gLjK0~%)g;I
z^KWF${2O5EZxerJnNF>H*$<mJ|Ato1zbPZ<-_W@EH?nR1U?Y;~mVJsbn-Q^H4$7W4
zUBXp(%=ydnVh^>-+W-VB?_CswXqV@@i@Okbl=opdkz#Je=gT(C04{HLkKRM8Pn(<1
zHlKg9_2T){=ie;bI<MOT$b=V1^9cfl2L0lzZx((k^`~Dg+cn}!dB;ca*10QN*cPE&
zd1Dr}ep<G5Ezb9;(CC7t`+3<B0s5DZrx&Du?r2~mmXGGppRGQcJR^C>_;Q#PMPn3Q
zenz6RS<3A#UUs4%`I(6YB^-jYLJLZJ9Icd-Sp^J(>`0s;yJP|*Z?KRHg2io-flC4Y
zZLQS)Htf1Z4O_7OW^tHCRP3vnCOZ5Q@bY86`VA6_UE_P#!I<3Z(Dx=LADChmfKn}7
zqUnu~X~HJb&@K7Hh%X}<h^bz4@fb>`-HRrH8Q86r49#h7Y08YJOF8l%!`tGODH$H$
zh&Kkad1H>gg4yLMSej?qrt$V2Ex-iwdO4EY>EJSsrqMicR^>YIf=QS%%>C?2IMCNY
zr*QM0kD~#F*cVqxj*@{n<@{Kg<78W#sexf&4d`u<&WXW8f9Cnbcms2&b|nOVn#DDJ
zFTJ|REi5>`n8<7{+ZwSQcQ&`NY;%gIDR1!yDS@y#6=!Z=JAD0fDx6Dw>p4vICS6)>
zu62s<FdT?+ucgh2gKK)n6tRcI01OWzer<X|ln>kToZcPW-2F9)<OF}mbq?Q*4<!cy
zw3bH0tbJ|P-p5$s&!ryKU*F^`T#kLk9Ha2TOBBAn^vV(t(yL~Ag_mkjpWAuj<yzoE
zQ!Z8IVh>d@OeDVP6rcLjh-O`VlwQ@dk;y-SDgxH50b4t~3K}fAE!5HywCSaRxUzbp
zM*7@HpM8i>;_=fc{P)^7;}nvQ;jE$Dicsnghh)NZ-`QY$ebrvywD+e>$d5)1vSw=-
zgul;<pdA`E)92t3f5y<qbHCw_ul?Jkp$y4_hH~4!??j-{J~!IejrLWef6BDT5Bg3^
zesq^k$OIUEOoMCGpjH|cI(2k8y9`VO{;l$(+;#EG!a6`;Q3BSrD*v4RGp^Jto>xK6
z1zCz|gz2ir;WQw3K?!+aAIzCS;6QbA@js^(hX>Na$`CaWTyE7ZN^}#ox{H;b6d0RA
zuodfAtanC@LJv`bO%t+@s8>b7&c+Ma$=9{-UOd}=y0v6esEm@P;Bifw!>6?+TR<fg
zg-*;jqm^LGwgt~Fhw<}#OL7{?`_-EJ`i|zlUah&!7k9L``C_#OpKjgJAS~ue4Z`{_
zZt%skS^?4{+scSft*wanmnqsQCyOZuyZ@cr(Y$FNV9k<!pszQdZG7{h;C^#ScffND
zRO;Sq=7V=~Ty-4G(iSM>EqIQx1H28i8lms6cAOZltMrs(X1na*7E@Rv<tTo)fxE@W
zY1mrmf)DGJ_j@6^^kQ1?x2GR~8d~kDfUsCJcbBK9_Z}zwp_$2W;dUzB@eSK@1LJI3
z$sZgQb7;wm11peIxSR^hPs^5*O^Q}^#m&>e8{*}xK5Te+>zAnxUF=}ypJon%8FnQ;
zo)xDj4#@v|5U9lGfefaOqnkxZ5<)TOxK6Iaba3g|mN*f{P<$)Q+~WGf=5=3pWOBg|
zK~d#vS)^Dx2WkG}%LRjan;8zZT-0r*rQhA<yG)ldqhmo@LQ`46k#fPQypRKaE%t7!
z=ztJVYo1879J8!<3glUmZNFQ%e=oCHatgL$=E6U(B3NnTaXfTl;2Yua4vwwRFN6Zd
zA&j!&;#eIR2ZJD_Xia>nl<m+t=-|zXX{9rC&cSiu$IjcWYQZ7?M}$ig@u86xU)pDd
z7AHnTA45s>v1ZZ0j0IL}hN)4f>G)O!27@D$g41IVfo%>v#JMI{^(p75C;(jwiPsoK
z@gM*pEq~*en+m%nQMFxaM7cO|lkB^<NgQ@#v$k+AdZmH<B>JGe>P{TT%tAV`9E)Ok
zIiOh#8HsS2vk!1i7bi5e=Aa&Lsju#Zzs+>4Hi`z6S#BgM8tl@8u|nGBXp=_8`MHSH
zz1wN(-^jw1O-&L(EJ|9=5piGx568IGm&tKX(GL1f&O1ANW`Gi^6Ht>;5U-|C+*QEJ
z<bszu6q73Knge8F=$idj=b*iZL#^CV>y`JA#Lcyb$(lMsNC#b~G2w9PL1OakS^kT(
zrN_~Q(vsCUVliU!+tv^5{_EE6_oo>1!V(eetn(a#6}1YPSjD+S_li<Tiq$8!-!2<Q
z@%m5_X|&_;&#4+EoJP+aNoqlUzO<Y%HQao_2!W0DsGYamOrpBfOVFMUs~Z@^*F-gT
z7WkOPOxF?|A%a&o7l_qlnV^-2Vp9x&^B%~`QNMGv-|Zi?kCZ6%hY?`+pwm7&#kiuU
z?H^C?#s?m6<CO}TfZh}sWWsffVH@dz6kDo6oF}%Ike|<Vig}v|O#G^@0Z~^jbm~E^
zwp0g9{5^Ig;-6BF?Lc=n7F#W4ENz{~7@j)AeA^a0`TV^|{c;`#rb_<yBqj$qwjC`G
z{!pBGuGA#6YjW*udk@h&MfupkuL7gi?40V(6U*~5KXmA@NPxa`$*$f%9HPVKKPwND
ze^&6676&0%$XaHIKT{-rcTlQ)%_8TtH+9cqAcZzy*1pUnkuDym3qM3GH?Q=<S{AIO
zW(I%@Yuj+(+SW`lD*V||ueIOqQ-t3BN&C2aa>}$(l8YeXF*(0h@ydoxky79QzNIk6
z(>NH1I#?fKQ4<xdNi-3*Wu3&I#4_R^P>deFCg(KY&{8n<P&y`mX}k*^M+1s&NQcR7
zkgCS!lzg7T4)I8+I|}S39T9=1*t?PH@&H=L0ZYJk)mA9!UXa*J97Ig8mPjslPC!(}
zD_s#qZ&ie1jDuEds&+6v5>8kK5T*(`5yg<?IxxV1EAqUcgCr1GkeQ(#)s*g7RImt+
zUWdskK<woRj67Q?bph}ma;Q_h1vjI#+l%2n2-ngao&+d?z_?(56qW}VPCQdM)F2$M
z6xi_2{Njc5DJlqiRED1ZwTd!`u0`I%U&+IeRVd=CVbKZV8Jw3uh*5ql%CUn2s#fCQ
z4?9PnBor*|X_b*nBu9y(gguoQC1zgTm9{hM8dE%;1H?~pZ{$r*8eN@-{D5BJqU5Bc
zyV8#rb=M2n71`-aGI^87)e;?L^N|+!^cFWvt}B&^a`|axlZBVe%cNM%^@&=cY=73a
zxI16)5@^-?D1?!Gzn$)@a@OE5)@y>RjaR=W<kb$P?_Sw_4$k61P(H(g^`+-IkSlh(
zoR3u;OVL^Rhj~(o2)&3W%^uoO8P{zBvbpTGlCEUzuCTSN_(gnP?G83yhAtM_rJz*#
zcwM28Mxy1c{3JO@Wcf(lSxge(j+)J;8vm8wC)D(3FV$~~^;h+0btqf2#E{V>g(vT~
zo-38!m1ZmXmEtV<R}JgeeHCI88U~E2((jdVq_N^>u>kYM7hib2Xp~-~3EI9Nj^{C&
z22rGfaWKL-ZfGC`hj_{dsWSLl-0YiqJogTRVVIJB4$lnluOv8woXh~Sm+`Zt>`KZR
ze86W4NoVOLvXTACJPmI8Xx~?T1jYN@Eh8+yw02syfMh=`ppz&5wY8AH!Pk@4J0n-1
z)xi|0)Jc1<)AKkK6f)BuMcmx>b^#WTP+^${oR|#{47%_jo)D_KS6KOxsc3}17fg3P
zy<@^A*IWiqC?mr_!fIXw>EVEL!M4L$buQogKndpq!8MG42FN+A_WP~l<AZj;Pdd6U
z)Z@d}Zok{>|JeVbebNJJ-QV2kzo;phqTBlsShmfL<_pDJx=r4E{i6Tk8MG;ALg9jy
z;ldmww)vnxkzqAn_4`TE?DykP2-9Cd46$1apF(r1wG~)x3H!Wc%_NRDR8`tr+0oeG
zS{_=jcFMuU0haqe!YohU!V$mM$BY>57th=!xfdY*%|MmewN4ISJX3SawC2Z?zF;{;
zHv_x?1ntiT)xv&i3xN*=b$+9U4V@q0?_wO33F1XP`d+EWKPuFu8~i-RI_ui+cMgu9
zZsFr40M*1~zRCN|XCGdgu|3_=!^_O&u92+J;|se-vl6*A_qjh^w9_hGwro$ypkIbc
zxWaa;fDKDFiZy40l2-kAaG4ozt3}V2Y~8e6h)eq*%)RdIS=b~`7UI(~9Zv?%Ub#1E
z#D=U5TsVvFESS2pkSF(=Me;{Rp4>g!qad{gdv5^u`;7SgllGf_yL0^E6TsSO^TcYi
za3XuLe-Tah$G0o4WbQm-OOA{Prr5n*)=5<PTwhOS_Ps%9>9f%>bMrZRX1-z%%|^rK
ze_VaNKODwnrfok3@o@Gyd|6V3edF^r-iKK;EfEa30B};zmJpl0O7-E!*W;U-*Lda8
zw+bbBkI9XG(G6;ObDJ-8d-%1WL3P;&wJDM)nqJM~2vu|uUglq5s<b%K3CUqmPSnE!
zrmAc>ipfOgl0_EaDc^K@r@$(B{D67J2XdG~f8`9?og9Zckq`H*bKnni8-;MDH!v$U
zF{zxie%xkYdnd2e*MCk=cFp5G^H^2d>*%+=j;Zwe*gQVYRr=b~Z@=+OrOgffcylvX
zX>-fGeQH&DW*$G!RqE(*wD%A6+ufcXz<y7C^WLbh)=for%arnI{>?oqo!_U@;69ax
z_o@`$qf&C8O6Rlt^mLy}U*Dt7H}|NsxpALLoA;@-b)QO4?^Eg7eJVY_N2TySOUubJ
zR<1X=N1f3<>RfQ>a5=rQECMqg>$L^gUb|Zol+yzkCv|o#L;2f8`M*XY`C5P5)!+8y
zn<-C3pWgNKH=_9b>^M`t*OOO5gsD_Vm1kmXm)|qx^|yUh3dpp4y9b#L?n9=7`;h72
zK4dz$519_`L#BiKkm=w)WIDJHnNIGpzk+-2|KL8v<~~GYc%Q-jKS7)Vn>Z~{EiFTg
zZZs2kv#Gyn*6-$Nmc_f#{NK%U{q2SR_EoO@*ZSQzrYEb@9OrpsIL{l+dBRuIah~zK
z*)&7g{K|Yaoo{}VtFvWBv1QHO^uCp!{gxTUmYM&S>3u5?fh|3X(M)|C$Jt_uem5Ja
zZ-ZG9Yht}Rmfc`}rF+!cyjQKQd)0b+uUgOURqOe^YQ4But*`D?>+5^f`sRMCd{5-K
zA9ifs4?Q;Thaa2wLy*n;VaVqFP-OFdII?*^B-y+lmTcV*OSbMwL+*zqTld3~t@~lg
z*8Q+#>wZ|Wbw4cGT7)GfmrSEs$tBauEsf(()l%}w##DNRb`N$G&gEqoxRod6Ugz02
zcFSGuS(50#|9bB~L)KMtYO$=F6LocQ{mmA2SCw?tjp7Q_PO7Xx#8oFNP-3aF0?C&e
zD^NtKu>vua8Y|F2sj&hHRKU6ieDBfA>fl<1#gHm19Bxu$g;P`wYvmdnAMPQ->h&y9
zt}S)RZ|=A4Tbs{!E}1)*H@*GUZ&(yMtd4W{pn><<KC7el>Xcx0vUv~Md=El!k52vs
z(y=<K{Es<gR`29Khs@W1fYJh%m5|yc42FtH>R)*9L{-)IAC0E%M@!T8qfxQ_xMh<&
zUC(ISezdf0KN>aLk6X_R>%A}qzOw3>VQhU<RPX6V!BeAf(@MC1PG`ihYt0?zzwM(<
zM35w=2@Q?AmeMdKD^>Vr#R?>?uT)`k)e2jyR(QH<g=ec)c)n_d7pqqIYSjv>uJqQb
zEB$nZm7WcjE{eBD%eG1zWa;A04tnqxsRhJIzAa1FN-t&?*i|l1$ZQ79=G!cG?klf=
zgq*xE1)f{=o|(r_3+ru}0-IL74gI*iTU2i}+ZIzTFPtq)(&ReflMpn7Hd$S)QvRFO
zihsRY@vl}Z{$jP_&sQt{Y_;M~S1Z1?;ySHXeEC(SsFHp3gI%eI(ehLVi-)TfUxD0V
z@fAoO7ROEWrxQIM=VD|3jDhwd7n9Gj@+Xm%(Mov*3l}QCf^iF#U%{@0%CBJ3!sVAY
zOri2C7_#tum$&xd_E#*wyn!JVU*5KmimzZ+$mN%}DCF|X8xwN*<?RT${PHG*Tz+}$
zL9x+at^8^>Ls(^SA4?g*q$Mo)KHp)m|ILbIY!w^5dzD|2jICmnN99)}W2>0rar>*4
zU%>#6nqPe%tzve^`)<VvuT*>mn>j3gFLOCrhs8`&#vkl6)AVm)nvx|LrDO@_C|QCb
zN|s=Pk|h|QWC>;`S%SeymSAd<yBV3}ZssLff?-LPU{aDL7?WfPW+YjH0ZEo%I+7(A
zjbu6IB3Xr@NIo+WcS7?{#vxha@L#sf65IMtMj%<@@K2UF@RKDD`Q+|{Jz4HBPnI~q
zle-V?<nDtyx%+TVRymN9B@W?5ZqA?2VDHl_E?npB){iUPNxD^E-@oea{j2W%fvTN*
zSMA-u>g(hC_j>=Ts~A4GHCHi!aBHq)2$89}im^hb>MB+XnX0RpFJ!8&V#koFx{5(V
zF4V$(tL`7P-t_KUd$)HlGlU#Af99uFhkg70B)WZn65YN(oo(Nr&bIGQXWRFuv+euS
z+1|akRQnHY$oBmy!S4M#y?4$1d)Iv9Ql4c)%zWk*KVNcvzU2CR$@M?~lFN93m(x5V
z4W73*pUf}_C+5x5A)6@K_<T0wXwVoTE5#`I-QE+l5v|nhfLr_xt*qRbnv}T(o}O@=
zF5kn5u0WoX0l+WCCL@n>2zkRW4hERwNaC(@rX!fNcO9meoP>Ox%T~8)UUHjYO#3>#
z@KbN#Pbv6*0s{@F9yFeY@ERsg>G~3txEf7Ts2K`0%2~=2N*Bo8K|5<Hwv@*61ZQ2v
zX$Lp{WQN0@$0`Xq2am_5F!@r=gHq7u6!U(yjyoJ~KMsDGQ%*jgBBYOoO(>65cE=IM
zrcQZg1N^l|vxgPh$9zXYQms+Id5lmN&4Ov}wH@u10vAUY{WR()=`fmOd{mVkmxI^8
z-}r!0#Mb_~vG!6|8DR!yx88ReCwixQ-LupFe&?Wl)b&hmHXKaVZM^PvF}POyXz#af
zfA^%_I)%UQPP#`2Kh?dB7tfvv{z|B}(eR~&3_HWs!f3$+j%!-SVpvFB&QnWa#EJ{@
zwEhTOFkhBar^a1Xq1gqIV<iF_=UPZ`mjVX)gFv#u;nQ<?NY7w8h#pPODKVN)2}Lol
z1WbV_0-+V9Bfx^V_b@gtzB7@A6EE>c!T1(&%EMfCK{&%y9`gwX>xRan86~P5dsW;V
zssAzHym-38d`1D&txB+kF@194T}Id5#Gl^kZ3Dxg7`-ys1c!%du(7cxZnQlPuFSFa
zP&rA<Absf|+Vqy7@qTk-<AXs;de+DAcd%F+bw<*{9biY=#wgwVQ#yM5m_m8t5SeIc
zFe5!uD~*j)b~2T|3hQ)67`B-S0aBloNCh+j@PMXpH6w2rHFZl?CP#baM`4_#Uno;k
zXI=&s=-)c#byoqdVJ1+*M7iso0+M-5OLd$(gRD#sM?;DoE?NFCmbl8h=KTwX*CKdd
z`|%Wpj|2bRilz-~WCuBf;_rwagB;<R6c|Let*nzWOcZ_fc>eI1R3jQb{p5CX9*vX!
zXjpwj$h3(lk%`BxMl6MK)M~^E{2HpSRnyy_28^Y{r3a4%9qZQmH}o@_h?>IgIPj<Q
znHq30ebYqfj?)%{F<y+Lb2<T$;CYzz$=Ry(n4<05M+xQ%!J?eaqb{-klS~x%;`rYd
z(qhUj56+L{vr{KHBkyw6Jgmq?Fr|YR2h!urbrs4!xLl8>ttBg%AxaW2Oi58TQkgsr
zGi{B>oT0!TYh!cCex)f@T5_P|hc7QoaT8o~5)J3$fS0G~^`c3@)CgnD`_ripG|3zL
z38w78{IT$O6aZ<I+&dI@zG-8?A-9)Dfu%us*xfrjX!jPbwu?{zN}0xP1P9xI(>++J
zXgmqZ&ynu$hXO^wHDJWY@r09(`sa~E<*y9pF=p7T$Vv%Y876f;|2PGPJi`N2%8xOt
z5l)PTNx7N`pPSwxCp^OWAcbM}Qc?k8VM-E9Epgj%cyWojovxil+U0H-^IWFSN`%0L
z`qENy&S9O!V_>)-x1w1v`?uuQTXlDxot#jPJl<u5A;sGZMgu&DN&X=_%fgAlAd3nG
zePgP#X+>?c!tLZ_uJb6sFXgTqlq9d?G$+G=(m7f2dF2U{g}uPZMmI3&=*)4paNH_i
z+cqVOq&fU-L^J$I20Q7NGv2(kM-!g}qg_m6R+TdPd{k%4WdLkR$h;i!C7S801BW^X
zihBz}%E#cgjwm{Uwor^p!ePL27k+@73UJH9%=cc`DaRJHm`IK@K48p-@{=SQgp`<!
z6IeU>vlPs|SC}C-3-T);4##yEjWx?~khZ63e2WWWtp%oNUbGII9~@9YS!`(^I9)0;
zJm=Kab!;dLSxQtNWV2~;3};Eo{DVKnBFm)8!jV!sPz7CpBIQZ(!>JMxMnDv!Ym&oh
z9^067h*!U0d`@54<UVf1=iiIb1sb)ZINLYu#8(`jba(rQt>az|Uh*67uzh&i?w!Kp
zA5jb2=^pjG&8@GAzP5mVO;L&g=^41~D<vj#g5uyN7|anNM2t>?3-W`|f-V%sf|L+h
z0-5;G;4NmC=}-KbEA^si>aCAvmKcDEVnCkQdiKG77+p{XO7j@Guzt#!NBSJk8u%&s
zhA#_>T>*687tB4=B>uUhD9#jhEGR{hh@+^hmdO{1J0zf@h%3_chEyKSpyG(6^U4#9
zzx@Pu>*xtWtx~VV6{q^lu8xndFQJ#}2=-A@r4&di{y1jdsbl#s@>$hc@*?oSb_EE+
zzc>o4WNlHEv1Mk^5ldmx<IA`@tFJZIGMnxT=nr=WW)L!O)@P3&d$z2OALw;a)7~Fw
znhw|$XeG8(A<3?S@h9B<rwd#SlW5_4QCL-KMI%sox~1^O#`ea>QYGVSx0nm|z67a<
z!f7-gS9!6B$J%^RbHJD_itCv#C<3f1-!Q%8x~6R)i2i{ZHbw2`@&)w{q#`P17Vl$?
zne?mXo|KjK^>s{3HS=SU(~0m15#lbqhvOTs`fxl4UJc&XoCu2Qlhw@@%xH;9xyfaa
zQ45`FYAkok)QsqfNBB{c(LGo+U7COV*b$47oRA+Lk(pxNM{4F+A7^xxW~IKl{Ai@l
z$2*#y&*DHhUe0wd*&QsP{`{eCpanlR%OIs%|IVwlE8ezO=`KCC-}AygUid9jUGY&z
z-P88A*CF*99J{w(I6>vOkD`H6V={~7>bRpR@K?avD@N)(pnRlM1N#b5<qT^Rkf;XG
zf>V(bkj|$-!Ifs7GO8-YGq)r-O@awXe3+jNK`i<SUUSi3&NSOys##!UqJx3qjDk}}
z*PwX<(lyu_vp$C7@gZ<Crxe&Mr=f-x%^9RJcHtparPD=3k_j}RLZd;Oj~?mdUIQP*
z+Htk8TrHQY3_Gbpmv}lzv7e)GT3nq7U5$pZk>&SFa${fv9ydUj4=C1wxQBfNL&<)M
znIaL4I1W2iW^u;pyZcFlcoI&Lr>^99JC%mx`%v=s#`CH0l~_0Ns+=PiFlDNQ*BWx6
z@N+&Lpz_JP_HQ#vX_QZsOUlTrZdVAG>8c}4*AjEnf(qd@no-}X&yh+43_p`-N}A_g
zEjY7CJd7wqF)FOF<!CAy^626PWRMh>9Uu2PZ+h)FKhU6~co@W@C7%T`O7wWO<Qrl?
zAdv^}S5P8RbLU}Af`qmm-M(;nBXlDcGX}ftW(K=ee!ejJ-l`x^v23SnJyaQKhS5HZ
z@sPSaMN+7GSj2iObXKSvOlWd;+Czm4n5f!1@hpAq@}m2Gt9OcAe)r@j4_Vlp+^%Mr
znY0?_-CTSwQ~R=s1=WWVQpyn9Cnwz#Z?ApY-aT#aeIc^$Z8VP+6k5I3u?IEW87$s}
z%MN7ULOJ3!jxjUqUL9{x0@S<O13@|gv>6jt2i|!ceGH~e?-;gTLfaKE*lvk754M4K
zKF~^n(3OPNK{GQMp#h6%HPeS441#Z|svx4zCx|~79g<R;>s*X*ny@s4gMeZAH+cU1
zAK*^@5AHhRoPfRscn?hXLQt&zHQqFh$G_A-fWhVxRuT;5YMJgwSU-+!;47V&JQ|HK
z*)VG;Zap~iP<6>yV3hmY>`!d&$FE=PLbXJ0nT+7pr|i#KlgUqhmYX5Pow3}4f`Va2
z_r`rvVBkM5)p1Wrms6F>{Tvph5sYA}037O=7*jnpf1>864(ACR<00M~ry-CWeIPq*
zqIa26f>;>Mzc%b^8JGt!XwLwMKzF~577t%!`8O!kcvi^0&47)f^X#VmwIv@2hl5lf
z)@!$Qa3G7-w26f~LO==-4D*Sr5PFY)e*D~^p_ByHZ@r3lu}`=9>3Xd?gHoH>T+zcZ
z)>phB*Q|SwZ~^!r#<QPv-NSL%Po@ao0wGj22Vmqj9&Ox=Ml^N)oh^(Xktizr>QWH!
zed7iN12~3QkthRl2ar*|;3wO!>eem!yYuU3gwQiuiymK42AJUR9N55c0y`4bX3lz8
zN4(wxyRc}j7<EbQ&at^}RnyHQv;}m!NwYwGS2FBE`e#mzy|cq(DCO;T_u5|Tq<eO>
zN4JOi;Bf2pXp>O3-|9KgKKM4P<x27Ogeg^6=u7YBX6Q9yuQBtUq?6ebgiP}?xUqhn
zhtq<3(fQAmt*p`Thd<9@XJ1YHormyy&ug5+QcQiI!;OiD_Q%^mAR8~9-O;9=tqUd>
zgX-3ACR_UVDD!@Vvo323>t@7qrhT|gX?LPIKtsN}^<I|j^W;|)zHbvC7Ncsvx7$B%
zy=nJ4|7d4+E>ot>Z@=AqDl!vD9>WOl%P;+_z%mku@C5w&qgRE$;V8tj#=>g+V7kaq
zP67#sqHGSP!A<JT{0o4|^<_A?B%1~}Oe<*jklwn`2WmSGCumWFoT(f+$jrho)Ec8S
zhs%vijp|B1!aO)_gKRs*AtU<oX~cK`aTHDJXyijYZW2XP;KZ_%;Y~=$y5q@~EQNg@
z{xo5zm?5*ckdI+;YThI7|5lS<8=JL7t*}O{unm~^%N*gv@~^1xn$*SbZaKy)eA~#j
zjI%9KNxuzl(5%drXH<$ng(L;a7s7iw$K8gVlfS4?mQ2Dpli=b?a%z)t5IjOo;R06$
zlMdqFx-4803}SO$oE@D3BUhD&FYRYUI9E@~uE$wn$>(9hq7GjhvULy8yCDvcVkhAb
z5F;szw#rag=PBS28n2|BrQ3y<C<=?Lgwb-%lh<dxy9m8C#@1jUVv-651{4_YBly79
z1F$HO(Xcqf^S;II`vAHVb*9t1836qY(Y!1kl~+L_i{W(K*@Kac0ZM1|4Iw0XGVPWv
z5Y0o&V5B@jyqk-X_K<$EUh^0cxE+1k^4-&+l;bqv)@oph0-og#$nOeL7zsWgL747T
zh*^=Pz~kOg`MD-o`H^w9dsWm<!)a_e=`ArxG!8~?#Onp1%g$BLCC{kvnC-rt6!)8i
z-<HIj8;LEG%auOeE~7kQ+jIzRc1>L@dz%9`?NYiBeLt?NxmWL*nxD!TL;A99F|3|W
zKq$0DLbPo4MaRfml4~D?xj4MIfOCqrhY~fTIG&RMpzbE8d$6GFtO3$Vl<$8C{T>k|
zHsQl{QGylWB0lj2B?swpCISzDYuo{HL^RENef9>v9d}Poz4p-_+Dv=|8EPJryaj+8
z&w+Z7?PKq>1%==#m4g=kNeoy;@JtEOGzSYj01&(qBPxa#mdTt{Nf%*yIX~Za+rZCd
zn$EVLJmL4vK{R<1BdL~useYns_2$Ve05F`i4q09L9a^+{RJI{zSB(ZPTth8l<Pj%y
z3y9F<cC6JVQw7vb0nd}vUV3}PQjvU2uWGEY5*2`6V_0`fhouh!Ru&C?cs0dK8=$=M
zESb+x8;{Do9g(x-4bV+gUDtr67>Co3)y!i{I{m^ykgV`2_2x;?4{pM=A5Hr+e;N+l
zB*yrvYBMwbd1Q`Iqjfh}0ow>GX@hVvni0cTpI0783+_nI)*mW~oK3*7CDFnlfeOfw
zL9}Tah|nk*prBr&`UnubnfU#QpL~?@$rCc_hhw1E>K}plvkzz7Z}_8o#D<&n<D}hd
zpT2D!?KxG&kk_Nbxxcr6psteDuBy^ekA1UUl%-un;ttDFt<^QT1W4@^e2`pSxVF0p
znIT#V(DR~7JEYuaCMwI$kySMtFtR3vE;<wwb>)xeL6I_s%Hl=*i{~Hez$F(dWv&1i
z)Pi+?kN?0Tyhqu(vaz}K^x5+lUw!?Je?EZIsFEc+RUTRe#YT_=6}$QHS9RZqHWe~r
z!#$p(QSN+XUxr&lrxIi;t_M?HzpA}@r3?zVz-G1pssx-8TOV?_%;%^J*fPISqth@y
zuhgZU+FIug7$@#qkVk>LBhGx$tp$={0*Ru)c(v&A)z0L3>zRMc8>+AhvK;diD)pjK
zdW|<z@BDOdIgCnB&ceLED%$@oh@($Xd)B;sCHQzPjWFd|owxtP450C<VP3>MC!Pjh
zxN?H^gg2`T*nK$P)HG~^AyTh+?^>t3Z}+-yywlDh(3bX(#~nC3QME$;H>HzVjukBM
z5Gor^4^ErgZEqSWmmne|mQzF1atK<g#YV%vSy1X};Cz7<@_ZzUt%H+8*sSA_E?fOk
zN|!ir7{Iwp`UJfE2_v$mngCUVGYw`rOz5JiGlE7CcVaT$ALC^Oh*{FXu%7V?pc5eu
z8ma*DYHa>amteX_!bWUdb)CQwYBQ3$OJD=ck>cX6^uahx$jhx|7_5-mLW{F7HGIN5
z9I3f$<L;dC7)~H<!tqNKwV7V^0X%pgN(G;6ZfuBEK&I53i&eSYLo8QYH>F_&%$fM}
zG(tn#0hte?9~DTznXX}KGy&7Q)2ID<?z{&Y%CoO_2=n0#Z5^P}(wv2iG3_ZU=n*Xx
zp;2%)jKZB5qt}S}07a?_)`l$ALf~lVsl^is*P}X@0y*-$fO%F6tcMTWJ-lW6OodK$
zw7CRMh;(gu>l&nUMg``B3~gUmzCw<s%3^Ga_!|7=c^lY_C}rh}m|5%;Q)XL7DMhQY
zvkO=oZL!)>?t0TvcrlNybxXWtf=*F#m7QLPgTUGdT&#|}H%v6!7e#oDEi|hbRnQMH
zia!D#k3)bnaMSzY4K`!hZNMr|gJ5WJi3SmH$KWP;B4}{=Yi)hYGI-!Z-&!?lo~~)*
z6V@mp6jG0F4qBwP&Ql)4z?Pt+r#j;Ov&U#v3>E9zjf?4h;dl%bV)Rnm!t%Rn359mZ
z<^o`BFdTY{5aywvkg2D<vm6IHTybQ)J8zEUETAL6AH(*FL282CHN(?vdZCt|>nALc
zVuQcTgLzOSF)Sf4Y%GukU`QERV8Na#UFQw8#K%z*k~MBPoz2O3DH#XBj3C8?a1ckD
z5FP~=zFT?}^C0Nn7MN+fJnXb4fS|Ft0a7SlEyEu0rv5a_5mu5o_JXm0OGFjPy`{(L
zk)8zj%PB7v?p9QJ@JQJtDj@|3voT%*w0&?%Y9C+{(_li9a^05nuKimwiW*$vbeI58
zd*q0LI#;w_O4JEPuTUZy^DRUgOdXM$4ybPtYt;!EL+>D#KlB<r8xp6#^ES8jDJRvi
z3bxKaa9#da@kf*gbm{ygi3d-nL5gGvZ!-oZbyocVk=l6i;u-$k{Ob9J{dZ&I+0(6!
z7hnCa&1aiiFP=aD3Z$+7wXykP>*>?~<!yYT{uh4c$VGVG|C*oAr|En_xjWwfKl*vX
z{^8N=mQ@>7K%K3Pjc*!TAo<q4o<F|wQ&eE|d^j1$A#mc}xBfH@<KS0RfLu)caO@4E
z6!yvF6}Htvwieq;JT}7&v>Q5IL!@zdK4+>8TM4ZaVUs1%JcjLvPvj~TO{`$E6GMf*
z?rd0vtxO`|_|b0|+NhHS;tcK7QdCUM;^-<wUl}q`bX^>fJcO)}z)F)K-Ij5Axv?c|
z{z!wOD}@Q3eQ<cNbzFd|qbq!+;5Ln5SL5yJI?)3n@4)Plr@!5?Ts@jmL9c_cPe(}E
zP@qc-C~7D$)!|%Nk<4h+C}dFg8jZ&jRZR_}0lDw^YUQ4wnJHPh0ZR@i0G?AC`kD>4
zC!*(f6og_P7kFf5p`#&8BlDD&AOtKz0!(e79qxp^+|V*m!#YA09J~w=QD6*{C=EOY
zPl`V7ad@R%+6fYd>o7<~2OIP31H1!3l#3Ckri@)lA~PUo_P3p$*X!<|f@s<H;QR4O
z_lM3Nh{>;if|qS?w|o54N$1VmQ}1o}V6T1B^IAuH@bu{Pr1Sdhv<nX^tsc~@(2jw3
zt)rh%);?+XdS3U$>l_{*bf7)x;G}hQ+G+RdUgv1{;B1esr=ShA4fYN?hn-U>cG|6D
zza)j`YI@y$4+NUsxA3#|x^vJu{fWBV@0=cCcl*#^%R6qJoOX844q7MP@!837w@0nv
z{PsG%-Gdg$M0+5H9znle`v<)B=)Fa29(TIkcSr3LoPaae*VNWQr}g@v&E3Il_c|x-
z-BX;F`L+u{gh7Jb)jMwQcJNF4$2QEUb@Edknk8D*J?gdpeg@^>y|>poM56((dIxmS
zGVSc7eTW0^?qfT>v)8@T&gt1{+k4aP?h)8~?UNrmyY1df@1WZwz@7Elb?D@@h23K-
z05y0G-(R2gItV`k`q63o<mBx5w9`GR!J5AV2muUQsDmL`caLb!04y{igmw`av=nvk
z-P<-ihc!Qv>7h~uz|jK$?w;Buq1RKqyD*dWj@oYyI&a!XyKQ{i#fIK>dhHr7UZ;m;
zI^6lY)=%g(i@oEb!Pxk#h0AqXTCcP3wf27K;NZD1wgxEC>j?V5)85(cTY)~uWH3s!
zijqhw)-yOofQ`HIGmqg9UI{u6NeP!kgO5RqYB=}#JdE6jKz=UWCxi5M#tJ;!S{%6K
z<2XvAK{RfYku=a1popvo4r26gsT-$N;F(AgkCJp2O#{A^J3&L-Y!PTwF0R{G=tKPu
zwYjgyIDBS`St1~cgaz}ZB=m|EwT6X<Ur8P%n@J-A0OuGD@JOy3*;4BodVt2_Nsmj$
z5Fvwq)O(;T0<86grsD+>K~z8+GI%B@gJ=R=Ih_NRV=_=p<kipTqY)Itq0$tTSK2W7
z$Akvjg9qqZ>m_a^j^q+ee}+j53mvC%Re7q5H^8r4o#Gc%lS{39vEbuR(4~;X1HSB{
zp#zgmAi*x#1047Oc5WnhMw|!Rn96JAEJ~0N6iQ0rW#)Jhr0hA&j*z`!g3)F8wzJA^
zrIG95-b&za`VP(<x^^XBr>Gt^ULm?7E8l(nw?1zAqc=*@B9WsCMS>}CA?R7IE;sP@
z5zE8Q?;;^U4f(c$UIzY=?Z}z0***k9c(Ppx`l!|r|0kT1G%*awjdI)g^dXA>ZB7@)
zX>b7;p~g$FRzBveaLFy?IGA1_lQ+sO3I~o+Hv34@?^qx*n1ZFBPYD^4nLh{?EZRXZ
z{SR0wbirC}iHa(HibY{6*96`Yq*LM-hw~Y6iFhB39P?#lOW5o1T2V%*@&hV##SBdY
zbYR{Sxr0|@@;QB3@|v!j6c$zm`?AGq-eV8iL35j5l{pgnDa>xG=-B2(d?UDIO#vC*
zNhu2jobg?A`<1TABc@JtO$jhNM7;>(m$nyIw?gNtrgD1vW$uq{j7+M2{ajN!mpbDO
zdE!Ke;9xltcLiUgk(^@lIid&cA--K#h9$}a2H0hg=8`Z42?2;HZaZPiVK~+*TXoIZ
zC-cDGTEpQHh)Aa(2<iY4+<9HuCb1ECpxwse02b?9L;!o>Q<Sw#tTgEld3F>+hnBVl
z)o0|pHi@p3(UK}Y&CZw<ZRjy25z<sMKKTv<1CR`SkR?IJV1rGc4qo=NL!DIwGJx+G
zw+tGuxVJuzyHDfZp*bA*Nt%I!Kw%Cj^5Pkgp%6E~Wg1QAFP>GQC2cPj`!}5_lAcTh
z{ct)AZt7L%_IkbcC>$#HRA{0;s5=)GohgWU{+QSZ28=%kC{0t5ok<%NF!N?JN?f>y
zAr6S7w4hdg<&Dl<C=Z^$G2@m6=}ey--GoXSZMhD_XO*?ou^4SIAyuUe2o73N^JCNn
zyAJBeq<G^MD?T3~qkGcF2)F&CE_%z<yho3m`)KR)#iHsU2%!YCXZAaGe!>$S7J|qL
zgdx+;PLp;yyN@BFe+*|c2`cC(jv<KyXrv4<!V4(sCthV5&HN;(aFh(X!~vn#XcJ|u
zeOVO()E89?o{PYhaWQv4cQvAcwg~Lr7ul6`2(vSE0=|ZI96)JBoucV9kf3Y$-93Wf
zS=qT#vy7q;j7U!?j*d^-hbdp~XkRE|i>YHE6c~U)Iu6v{X{uFYrjoeo(R?hndA>MI
z0%tve<x1#^ClTi(6|+L$08Q1s6e*#JNs>;ycW7*`TS0|}j(C9_JQ8!&jMPsuUXH$Z
zFbAfK+=gpNm~kj&lXBvzSl}fP!|$VLN+&G8eCfR7OViWA>?mT5e5Q<bZ<7vYAA?}#
z<0ZUnzlC+ahgU6pMJ?2e>bN}v9Ye8A*#l55bPpZ=eICTOXezL42kWt_9mnAntnr?o
z`ciG6Zw-Z4#PBqG=hZ=dBTM4ta0msFS^9kwq@C#?Rx?Gr_r5Mz_pGnVN{tQ&wDNJA
zgU4}@pf&K8en5!2Lxb1PNV~>1vicctIe^IKLI@uHa^BB9Lg+9nW+Ef$w{lO_UtCJP
z?au=LqtiO<W#*)<XB3_%^WZ8wczo6e-nS1@u~RsT(GJHS_jAqIZ*uJoCIsEaE3}>E
zAI^L7s5_sJKe9){h6P3Stg)#dCg^9JDVVu_!#;_n(7lo*qwlnpCF3-_!D2R(oIR0i
z7C2{PI?O#ZbUi)*(WG_S2Ks%}cFOcYX75MH8U<(~iJ>FiRhf;W(J1rGANGr1Kzq<a
zzx0JnGxG+g+@GP_CoBmE;<d{pWB)23o{Fq!`(*f&FCei)oVDUN1Ape@t>yumDDAe6
zTX`_t3a7S9G`#A<@wU&NIt~gU5~J3*Pd+~Y4<E0FGc&{{VT~~T@gYe{Rn=s@NSLTO
zwf5$-Y^4I>$_({f_Rs5s?(X;PJ$I7lvuM`D!Ep%M4fn;z;5LznQUZZTEN_1w+`bL`
z*>OZDNgeJ%p;PFoZr%Ut4wRdwOJ4BR4WZ3N9L;A7-ivZ8w~*N;fV<A3DixW|CkQEE
z7?S);!Pz8mA#j~VSGvZAwG^ln;>B!!p3Kktz;wfrI4%X=5`dGIW`2t5i}DVGAP#fH
z2vwp*6um$Yao*1`_Q$aNz0^muI=uJo<DGCED2lXET5c8xqwt3IN>O`*7-$S_cUI8#
z=V)kN)MBorAUC^L^iO{}Mq+ky*s=}+WC`&a{hU$5JtgdyFwF332#0uKDfX*yUKQ@+
z%)-^}ux39*T7Z+fqys3goK+K89z4ug*&?@k3DO)tI>a-nhvZ(r6h3)StT+IwpJe1?
zZA@aR3RpUq=o>_tMd=&HuD&->ng`L*Te3Yc%31<kzYWrL<~7G-r9WnhFV-h@4&s5~
zy3`oxI(JTE^h-vFJgS7^pw^UqnsU30xR?aEVbHJ+oXz!7|L%>WXof6jpe{LiND^@s
zHGjv<<4~kuj0mp4SyRTI=wpMI-*St}ew*mv=@GV>;h_rMk2&=CwYryP*imo;0V+mo
zxQxbRC<;u(b+ASTqGT!}P^6l+jh!X1cen_RS97}sBB{1`bu~%6Fr*b)u+|haMaw25
zT4!bHI*g`tgU=TebQ+_z4$HpulcuQc3xUK0z^|*;XaEU2Rgl65h=n6_kZi65Od$;z
z1RfQn?@l_WZAZdX=cw>SImXD5YIB8|ec;mFqk|5VfAol?)M7rWR%21cNJJRUfp7wr
z1!L*pWj3#n(pF`*0-zJ=o^XaH2qwcu>2CnjXmd!gCO@m~W6UQ*%|y9~+3lEhb~o^;
zQm5%n(+Kb=Q$wXaV>g7`r!Ha3^~O_b9H$EzI`@=tAdAeXeA}Q3#9Bgp3eHo2{SMST
zG5uC3L^UNck_w|?5c?W-7x`?VstHkf;6^>r==Ix9A$}PN(NcT9#XG@_woZvhy#I~V
zSVWvD2L$<=24r+jJf%d|x`<R%x!9j3=xsg?u8Fz`{WAb2*K?RQtUcN;go$g|p)6gL
znX4=c(|Xy6x^b^M#fZgYja8^Vt#N}^oF++;;O+Li-*e=ZiR(^Rx@c4Ks~4nVWI`Iw
z+TlxOk;eoF5ff_DYU%-E+(>1g(Ofh&)<n9~tLt!Rtk%IeP9If8Y^gezJQ3pvHg2oC
zPd1ChnbhhOod&P0@vccVMB^p1Xo)4Dk54scJSo@*zyQ&LVEg1m8<*H6I6NC2?g(Zb
zUrH0vBASA&@F{0OJYx&xCqbf+Vzb8i9GofwKt<fo1JxDYtC1cncUFiUjjAHCW)nk-
z=;Yku-i&JBm%{<I@3>yKe9T}}P&wJJCEy+F<_Cj0h~<8&Y?I{RkU7egv}#NPD&ake
zWhU5#2KVhu%rOb6@_W%2ih&lK^KhKj6_ErP6dUA_4(s~RH%ORdj?$*W(P9LE@#=O=
z3^WW)G#xTN=1*rG%63LUD20DHjfe{<Q`%D;HEau&e^Lf1&KORBM4?+`f|*%3=1=wM
zuMtHd12aJAufsbRV>%%{x7CK`0Iv##JveLqCSN(cd#z?;yiv@;z@^;oLATfLQ<N<_
zERkElSUyUBiR;c3M`h3`8$_-_t8Z8lD_H_NdLs{k)-U_s6R-Du=a_+j^i|@KAeIrn
zgjW2el9^LueQ4}A=K;1`D;vk5&zX|AH$~Z`!#ZAjp((L~XRCLLYWVKSZkrn?cxm>H
zz~+py05;r+!&((FV)?#`=Rk~{Xe%=XC^n0s#Kc7+@kJ`E*6@=su?kKa5NQFm6E7E%
zCx8l7LnMvHtxJx0+O0LE?^g{PR8{=LNxQXY;prMNhUg;R=}MG9HY}%MsAdq4)hX(`
zXDE;o<}2%*)k&O-kpn-^?9jYOgZl8~3~xDfL_Kdl)8t6a#^Ssg!f*XVw?GJo#=^)J
zFJR1Z;<bz#zg%3g?qN{J8O3;cse-n#Jrc`=LhM~LBszP;Bzs@sP!nds8lUn*wvEv>
z`zX5^i{OZGCBh8##;TugAj*iW1#Hn|mg*6Z<2s#TY8&uvuYgTmF$v>DzBNrY*S1e5
z5#&@QWMMHIn%JOOHY1XAf^GxE3{3(m=~xn6nhcrG=^!=dn`ua&ZK&-f9q4KFntC?}
zTivs*_>u)d`TQ&3z=(_7(WW7E8B%NLOA(7kl^zoNr{o)m1g`X);=@pp3c8p>6K2Dt
zm`N%j3LvJoEiRc({Y2PPv}_LDCc6VNqtfc*n)k~1JLQfux^31r^0KB#--2m0zqn+}
zDGO#g7atpFxt#;U{>qds>{D!W7}Ae5!0Sof_{8g{k9XkV%d))-a#xZ^X$4VjN<tWn
zim7dm2pbH;RL%ig{33>duU=!knB-qAK{#_gXtXUF8_AmVG&+FJRzk=X(M!e8fo@RV
z^w!5y+tNg@cbPp^iaIK&F#S%q!NyGEX>D87o(eCFB5w_=ttoSRx(p{@sc@uSL4lxQ
z)2LB4A{B~n79!I?_5#4JI2fY2T}>I8(!rIGN&tgmOm5ls2Y^qVA*-+28ATZ28hw&I
zWcyK9qJ=~}AR<MX#vhe2p~c(i1BDoA!T=n$SQ=7GI>@Pw)>tYN>K5H(s4Kj`QreG^
z(#DWaC{$uucpQ+s?4=}pB%4!PSAo(f&DimjHKd9HJBDMnQ}Y_~10nY^TOR#BFt{jH
zd$ofw_zwTs=0~Qy>_Tn|uWcV&%>t^{sVVCw+`Pr85%|*TJpTwOLBoFdyG<mrz|<BL
z0*Sh%KM={BZJl{f`mO>hz+gwmC*9Mo@Xfn#&yK$Dzy9g8-7A2p<PqRdf+f|yD|@l+
zX@aDnk})O0fO#eMh88$s)|3{J!W3G@+(3xdN=;g=xmXCHyT@A<KwUQ1Wt?r4j-_yA
zcih=!k%aKVjeD21`qNjI)U0hu;ohk}wsG2WL8l1uOlP~(F0n{_&>!G+>j~esRtLr`
z;`e_SANMxAKoiIUR*v~j;^QKRVRBeHo$J!5T1+dxSTzEdE}B|xyc1%&SH0%q8BFTX
ze-n!+Y$4xWdTa1^O_4-&EejHjf36<aovl6;6{)umLb0qq|JgqHiuDu}6&4Tq%%MkS
zLBpgywR0_Di`f8B1uSA6%8`L|U71VE@0#h&kxPmX_65xdE^=IN90k47R@P!Bu8p`m
zN2eJQxKFlNmT@-f)@TtDeH{So1W*fG=g%c<V#qmPQKyPISSPT#h8peoH1g9FHjz4x
z@B$IzujU#m(lNOzaurnR>DGtbImD(f<M9?ZT(z>NQ0f$pnyBIT^3D~+2I$~eWxZ4-
zXLStNSyg|G(ZQ;fcX7nt2G+8nT&}RWR>=??wQtbTW-ZZMX2Bk*qY)u28m2Z2;K3kO
zSE0sPhkf1yJ93K}LJy>KYfm|@G)wI#2jNbQC>`8jEV)E`%P<d&qgWd{ORjR-CDwx3
zA;QfWU$lgY+BQkiwkugeyApR|55l@d8Rx`q(GjDJfLE;)5`QLcUl<#oHFQp>9RaUe
zt~9>YA=Wc;GTBq(F~^?ErWo%didDcAHBpzNnzdB76vWs7B7_6(RrqFoYpx7Sr-UCu
zpV2QCp0JZFKYL&<U{#2aQ$x_{{Gcl|%;`)`l5dpcRmRGNu&)V&PZ!(hSbLKO;v^j0
zgb4?q$9L8s#EVC6B4z%0Or~yD7L=AgFBT(VF%>CAKc*ilhi4AQ<dQ&q%~T`gRoHAc
zEn5Kz428;&Q1+TeM)pGEC8cPNb#qM<Pt@H^gVIe<pmS>9JLGtc-|n8g`u1S|m3#R`
z?XbhT6@m&)n%O4UU@KCux~W6^0IO*iZY`#f9r1OjZn?O21;^!8v<u=zFb(2xKsQhB
z7@U|*r0LO;xk#EoMoANd{#}S{<UIb*_@C1}4iN~HqGJV2GR_LhDNse{LgSN!yR0-|
z@hWV5;R4grm}~gR;xjdEdR+~rYclj_2vuAI20S1!LNbQ-17yTRblL4u7s%G1t0*p+
z_qN6)R~MmHsc&iA-HTZH;VTZ5BAWS<ZAp|S81xC*J+DgXYE{Ugx;LK<DLFfmK>%xz
z4w^NyB-j+KM~?AZYB{EZm>6E$g-Jntj*?I&tPl>OpGK)a?o+Y8TzaT@g}FAlF&ew2
zm%kSdu%X+XSm0H0@i{C!-w0#65+tKfw>VB?Z8=175X541)%*zToKdramFwQqGImE+
z0o8dR0eX}p4RaO3x~zF?brFbRe55h(w&82mEMMwoBR=vf%i;o@+SB1N8If1{SxwhO
zfix2WvS=#F<ITEh$cZ{%m^+8Ai^KpB1NE|wnzb@?Ifg1%(ZSg3n2n;p1XvB9W1_@T
z3}(!;g51PFUDt}`1W`71u`QTNN(^N@fY_$>WNJUMC7G?BwC<#vUQ69&n;EfV8*(|S
zF}k|47z;%s*5O$4FYrD-Rbx=M)TsBJM#7x}{;Q@iyDA%A1UEhksDS$0nX4}Nw0~$F
zcxx0$sEI?ZRuH0<`uFXhdXx{>v)@fY`V~&1Qd{#jy_-yn@3i-y43iEA*l{x$eyZ}_
z#Y|zQ7lGDG@|MH!CaNidj*63_pxpG{N~$DQGKp^vnR|dtG>08amJkWwY^%0X$`gdP
zQTPvAyWD!0<XNTj9+K4}yVH1dyr0iWppX>ZmN(WwOk81sg|~s<RXdjZK=~TmR<L}{
ziib$yYcgA-x9m5f-*)!;t?qt4nQ9u<y>*N&U}<ASKYd4i`~b{$yb8Q%$Q^BiQL5r@
zc8XoFqryT|a@+cj*%tT8$WhXhn1$!NDrzZT*lsG<&+jgz`1a%3#y2l&A^_v}ml-$@
zCPT5@wtP*#vwn!L&bC+ic0T<$jjpG!tUik~JR`JDI;Wjo*njYyB%+52>%RGRT2q!x
z@{;VQg7#V|*2b*h&2?bOm{pkR;1;&a+MUf|-f1A82t%~-tz&|Qv<Bc|B{KsfbIvTn
zcM~z3%rBAT<7Uk`6c!Ze158q0q7B3MyI7E1M%M?(=%lZ?QZ+~Qt=5STnNL}K4u-|d
zh%xmGyfrAXrsOi@^`)k<eJ0MsV)PNhE+dQ_^VxJ9e#}T4y&(s2A|4$Xek{Rvt#QD~
z4GUQ3624lcGS6!8Fqx!)%&7V3q*iQbmKCIztTa=x3e<yIV~fKmb}puLwHbpniRgv%
zw6ewpLD9%b-e3TVqEyF4;oyPR^<;j6Wjt!Z1RX)64h2-MTr0C?e%kqRpKLa$d&=mM
zmRBMvT*+#ZmYcX<z&j?ME2oq;j4Ag81xmv{1$Ps07!|wwf(V~KV)tCOJp`<x{qaw<
zwYjCZ0wvJdr^d=KWHd?Z9&koFh>cI)G@dVsz~MJ-<*GlcLs>I_FJafnfuCMU5;)^1
ziAC$aN~r>Ez^1S2-$*{<aDoHJD>Af)OstdxUX`v9l<5!KP@LZu0aqu%lEDD9CMW=~
zxM;ewvSF|RLyY{a>0A^DlW;g3>swa|H)PZVT1=W!B1NO{K-$M)`kI*mP5c>&M`lp)
z7mks-=WS&~T^B#|io!f@-l<G<^{s$^^W+{XhMX+^xT3R4-(Q9=7+dM6=xug5?tJQ8
zND(QiQrgvj-liy<))ES1Bd>{dJ<yK<AHxItDw>rdd?AgrLkpC?G9XY2d=MwE!f1|(
zgad7pK>in4GO3&7JmMjN8;@$*@rfumsoB=Dttgj|8Hyb0*dSScl4OS|Zf$~w%@cIa
zsCm4a?O_kaVO#zu8Iw3#HogRR?h!G@dBFPc>{76$6K32C#uSElj8fgjrB`LsD~$Q=
zdz(+5$;#;Q=&So$Mn@V4Yj{#qBPgN{0`_Bx228Dwy2nPu9w!lb!Eu7uF}l>EiiV;=
z^O_4b;WZMOoxm`pIYKa+)G#t)s;|=8GGwTZ3S!>$vKB4{_9eh8TW_9t&ul*1DpqPo
zk#&U<Vi}ExeX(7ztpMzn(X2rxS7lQg+XCg^W@1tGQ!ywRMX`M!sw2yx<Erv|t^J!!
zGI9>+S?dYcAV`7JHOp{zq(C}%g_)3Gi1b#;B{}0uamFDt1mUIV?8mEPva}+{9iqQh
zx=g%{BH>k0!$MCdD}Y$ht}gOgaH2=$J&VM31(_CG8)Sqo%e<16zI@$@nzFh{nTDr=
z@IOTkr0U9$+p+ve6N=106KGvr#2C*!VEUxkGi%~%_bqv|WjQ97(|61JxX><#ozMx8
zNPH!+>1+&@(c{#*<d;s1P6VCh(#$re`sY<;DqhMm5ldQl5LMOh^%}NOb_!wOl)AT$
z=dWcjj>)_j?`QxxOPuYtu@=nxhWUd*FcWVPeNAv3*s!+^0^GyLT1<AUSD6>>J4rjB
zVD*dK7OmOmC900c6hfZt9clZpZ6pmuc#<rq?+i*uNF(I|b2KVSCs}qQddrShS{==y
z^TiJ-CMcxntvOZfFpWf3<JiA7R!&B#nrJqQg@_4-$42woD4H1Az+s@CP$pV}Av=7b
zU8QoImDC6X3>yqa&6~jd!kZ_e-ABwOGcD<aaY3cI9xET$C#>MY^e!sgsh%y&pLr6(
zi|SU5vJ@l9A^X#&w`*c(8<-7IhnCfkH%L^)iFyhtr_r>*(WQXhL*2WuAQWaQirtz9
zGFHvHDbq=9vu%X2u{&4RlcscQ%4m=INtoBD7BC(TW{;<hS2TRdwTZg8Dm~cA9XMRl
zjr4_2^qIv!gvr<_;S(^tPa5^bs<ouPt2?x-yiz2_QS!Nsa*3SHBR9{6v8F3!0IBL*
zN47Pe$2)cz$0ioHO{3(sj2?>=rBy=+?*(H7vSnpC&SomM2@ZZNt!3fBet+PsFCm$|
zzLFU_zrK{V*;!wFqSuFi@cJq!=L;|99syCGWidk#v&!{(ffVzhpVh7AYq_<xit%zH
zio7fu+2cHZ6fVQK)W)pHy4kU!yCdkS0B%`^_w<k06hqGo`B${uTZ(<9hKxaR(f*<$
zrAtu6zB*|F^VY<A@Snn%_&A!8Td{N6F$YN(vmgjujOV0i)C@Cil)>eE`q418W!zv1
zn?y;}6*3dI#0ObXL}G;*uaH#yN3%Z6x#4VJ$iR8L-`x6IEJh8Phv$91GfPAd#1HFU
z<>BDrcqpnshDQct@?2<LI0My&>7bZ-Z6OP@+`^c(C|TM%RgqO(TVE^g@z9^G)}MHG
zBU`g$g8uDzXs!Xhcz9d4W?dOuC29(V*L9G<<wh^qS2%%Qkbd$B{NJ@tHM&;Hc|w-l
zZG{_5jS+U((>$gvTJ+ya7X5ghT>iHV=+#=y@|i<7t7wkK9AuA7&QdJyXYWJysF*!o
zsW`L^GeeM?N7Z31V_|#{o)3tj9;!51iC29adc6o(%rN;vL}I?X!EEMeRm;xMw&G<N
zBE_b_1pY0BfjAG+ls$mit(gttNs)1b_xB+cbu5?jTf$|o)P!FHEOt2xH&PMeO#weE
zFuDrf$T#rIUDilhJ-%tC4%La0VO#Zv`c-$T=Rd0c3#j&0-VUkI&})dM`G>6^`v={l
zH~qct+3SNg@K&vp-s7hqG94xh%G$>LxP^y&b?^8I-38sDQ1+>i_MzntFeHC~%ERX7
zR~MD~FvHCznVN}JGvS(FKBU9pVZxxK@eT8thI1D$)RODWRJfW;48BgIm;UeQm#Pml
z{Tk-O*?zCXi=+9Z_|j$Fo6aW-d`b%!!$EUx6U{9xaFobhOjXT=R?&NG&z+%VEs$Jd
z0JP>H9*;6y7n3HUg2nWS!?FWoNlNwk#GjH1Pq`)I6|k|sM^;Cgu>x-ag@}v|ON>ck
zbfhGB%@q>MC18j#;W5m1{<ionj^F@>n<ta@B!<hZjCe@l(MaNgoe2P4kF9Qog|NpZ
zMHeOOl^vL{8kH@s_Twoe0GZt{em%o7zn)?JU=Ool^xvKxwvHB{NTt3Qg<RL2!WPW!
zXbBS0KYpV9s`!k<SWV&{>^-rx*lcV}CIzqkM6A?P6SaG21#S42d5>4$>V95*iwONH
zk0iKo_#Xw`pjtUR;eW=3EWchI!!*k}7@q%>vNU*P@$=<VvYvrSu5Zyd3OOJt@hFlJ
zC6`pz%1Ym-^=FZF4L1ULm3OOlWdRV(*-Vd3Qy8%7PD!;wBVm)uNyNS&<PnX!z^vk%
z_`x0G03SU9D0ts;MioH5_Fn(>*}?a3_fGl;?IU^pDx(_7Q<e#?=H)PcKOTQ5b5t_c
zhSm_i{A5E|Vg$T;xUw4`Shoek5Z!&=dG7J1z0De%^|A7;#TKB#<4tU3?Vs_Q`*@2V
zPuGe~3}l-<ep+zxuQ0a^Uv07mP$8YwB7*;G5Gx|2q0jX;7uJiWfmJP6vS@<=c<O80
zYXy@k6T=<R+lVSlNZxmkr9@oOLn;tH3q*n9859ees%&1${I^S%i-%bXguFQU$3)0`
z4x>zNyoYFZ$9nx%v|a@Q;-~NVRZ-7J^YJ);-MS1fsn6pt8=HJ2KVO=U>~n>u_8IPS
zz)>`|p@A51zRKv3y*&r?u!squNdZZ^bFkD*<*%uh-~KAX+p{bO0{k?F>7r{f3TimO
z_@XnpNS{WursQ`UCY)IMq}@AysxQtc;1WF9f`fQS*HUmSw~jjv<tudQt6MP2J8fOi
z2g>1S5XG^0WpY#Mq_2CIay^H3mejFz-!Ey%Df-{JxSb0lj2PmPVYVz=p4Y)5M9uyn
zCar%OOftH6OO30p21gmmLi}2`y)U=6o<7S>4cY6=&ddchaD3mBOmaESnYYwwQ3p;W
zqpxA#(5|SU@6g(?D6n9lxk=ScMn7xg6h3stH+zh`>UP;r?i!tzJ+qQ6tHWlCtSaw-
zS`l{43XCilOhtU)dH7YdAxgaHdK$#ZWk_LN6S1{NvqJRwsufPM*k6B{*=P&Kf;myE
z^<=r(z^STc<73V!QWUC*QE2Yl$t1w*47L$)M~^JLKL*;v^OW!awW8aNvPs+OO($Rh
z{@`&a`_H`jr<c|3cslD@&45Td6qa8D$QGA6Y{Zf=4z+C^^9G{|!HKY^K|Ilpqj#ga
z(k7Oe>e>V{F_$NKQpYFsT?En9>=^UjTK162i^+G=lw}11EwjFORw%L-$T#&D&x}Y@
zJQt%8P-#Q?z#`igIM2@g6zw?ifI@wa3do=n;!^wqCv`V@<lLldDnxcg7pW+bbrg=#
zz(jdlN=85o)5-B7V5aaAmC@KQox{Tbz5dPv6?U7n+tQpKrscn|Z)f4Eq&I2Bn*{ze
zv0{;)v#1@z*_CpVHy8uu0HYB6>oiOy(n};*yg8c;y$Y6|`0>XfP%yS)#tj|C==;;1
zvIi+!F=Jj&?M=zkO4PtLWJsUDrVx~0ZlvmKKWOBzP$6&$eb7C$&$iHY8Qnz8jnE!2
zq~Hnc0K3k{F9qQueh{cFWrUyc=ebGmuNO@g1&>)6{sx(hjM_M>DXZ)}{B@3G?dIlY
zyFx;^VkC9*>odOhek|=Zo|ytjz0sA<3n`5X{Q1^<3V$9y&T8Lr;_GC^ftrAgwd{NR
z%-)BjDDc)??RB9>+^T@>Do;0E=Ry8kk={WjwLry}`~el<R2XnT;9VU_$>#_L^F%vh
z3;nnZIIyrzGi;lxraCToIK7HKvdJAeCF!7DoG)cQ!yHwF%JXv*&<nNH$qcYkhwogw
z492rHs}x6U!KXaz2OL}gkD73*BDT;yJld&-(_mbnj)vN0TVx%Zw$ENpa0cI|!F9FD
zIYd=fwf7qz?66FduNIa9(Xr4>w`R!v`B-H=Q+=fozy&wdWSHe;9M=+aDOGuxc;6b}
zyz<_E3*&-6S7;CN!FwOg(hulw@}cSVEJy=wf~{owQ3p9cp-0!4Y~8COINsw>Kh!d#
zfpO@Uj~{=?^6a`$<!$@mxKcPFe2Y(yapxy2s9~GUifWC3^mxbHe91-|1JXU~5Gsg`
zmLaYxy;WR#6h*03y3nklPRmFCW|*2}esK{b=<Q%f0{JsGf{(d**+krwB47FVVotF;
z#7RFF2uqjl-A+^gCgah0Pc&bMsg7fyg{WtR6S$^WV$(V0HAYEOCX~>cp+_|AcVM~!
z%@K>5)&;PPQ4MjEhggc!vXbnMw3ft!wZh0_2?vZ@gDI92C|K~pIPl{n9|ew>0`5z#
zOiRFIg5>Ju7-C>!^#dvu#NmnN@j#m;=~NNEC#eAq(hTS9(P>XW-8qQtNg-E~x)UVA
z*EU*1jK3QD>7`;!$Ou&Tq}t*wfPO+8T%SF+;<-d@4wH|RXb0*dBa<6uCSNbfSr~dJ
z4*Vo?qLuS#bqIeImoGv8{~<80#Bo(8{_VLNe1gMW3?1VufbGI;2IdT>jlnS7fssno
z2~2M<vWg{x!SY!Lut{FnN^Ylvs{6J$Gy#`KTu&rYzlyR<=6QfTl)VA(U!gYaA_`zQ
z$^>+0NWo5#k=xy>9g%%eaNmM~Vu;1{C3>G5*R2|agc~}DulriZNkaQX4Sbg?L42pB
zVB^MEhqA6Y4rnUaG$(r|E~Ll{gyXb$Rf*PQ_f*q&cAQGse#ZexD9sjQib=eJjujt+
zA_Te1Aq5vZA2==VT!$GA&Tm!n<f6c8Dw&G{f?5pd_6a~r?`Z-~!shVKy&()`<*3;d
zw0VkF@KdD{w0xZOiW7+_j;BtGDcS=)e|-P9D4g<`Skqt?Wb8BVjKQiY#LtAhXP%lI
zi54nZ{FRR2UbJ0w+VrLDV2M(1>O+MhTz`Ti#maHRs<Z)$kg&mV(<(7N0x36t$Y>J`
zj1lC^q2z{OM<OgUv*vZ@>4U3w5}>1BU@e@zTDb(irkI$+@6Bh`+)9giGZiM0Pmuzb
z66gl?f?DrOaHa@llq!VmbklgQujY;3LuQYzAu3Y|&%#QGqSCY}cV?9gPO>hP=KRRA
zTq^mbp4V@`c|{2c%>5HL(INw6J2CfN$=mVyn|xyKnw__Si%5D*Y6q!T_vlEn`Qg|0
z?rD3^IUI`)v7Go@;RuXuI8BN`i+_>9Z^M~aVA?0cLYF#WTyba%4%xw-N19@!Xz1j?
zJfEsOmw4~PL1rdson2)bN4cYGCSRqZxSX{KY4>#$4>?B-MI2QKHDFEDNIa#_K@u5~
z^D*-<3=qRd{W1^mii>0f%p{LKk`$#)x02}mHCEzIwBr;%Q`HulU`fhMPV9-90B*?2
zWTeBM+UyX==+V>f)ATI|6e(~XPKR**#C;a3(2Bt>C26+LptL!0&U%>N=%Dqcf7Cs0
z^?G+@L^?a_{MhedcIMMua!8WT2jT4fQTw#tIVR(&gZ2^IbNmYi^Sh-K0!%p$g7{Q1
zYLbgSlnWE|$_Qs@9^y%^VO^C#lE#C{42#q&n_FKsH{gGp70TOVzuMl0hq(}cDm;$2
zliv)Dz4lS3y(hO+3-M3+^P9){08*8SI4;0ReNL(J04H&skWq*+s};qmR1}V07qo&&
zeNkD$9xw)}$-$oxQ&=#LeTR6+vO0BN(4g7c9KfCY?HS`S%C?G9lgII9QERYiF$l3r
zXeW(xGpKGQUmeUBJ5Pm5GkCF55zKsa1C21++*C(oF`?&^XgsHpZx>bGta*P!)i$(G
z#*~>wvl8Yli2GGp1A@BWdE@okr>2DlwJ?p=76GWJwewp|OWEO?r>|QfA?Y$o(hTh@
zXiCu0Tzwz5zHfWIvy-+#S&Gm+KOct!SyT?zT+|#5f!(PBB0sn!lpCz+0io~&3@2?$
z73vW?{!uRMi_nT=7tVqh087kGL7}ah*BTR2NMH)=6MbWUw%1LW^w}Hkwx~HwfumNG
zK>)BGg%|UfH;deROz8;FCGXy}7<8T!1+2l6*VO?-iXRLBqpxL{_!hPEwC2gypc=u@
zUSEKabrVAxFk%ib>Z*sLCPN9VMyl6FqX0K~+=b(LR>N!5`3&#JY#PLIxJ!skVM|Bd
z)AqLa6U>Y#hmw8(bF3}vpNoq#>Z_GIGR?H0MGG=Igq-0?Y<i`)4RF~QIIKykb60V%
zm?nuoz?u1Sk<9RjY-|=?B5-hqOWCf&sLn)1hcuxe4L$`>Xf_@94E+4={IWyr#lg>f
zgyVR!w+)N9CHxfo!wT<Y_cEPNEP$zQI4S&o7zaHn+s052)syyKr^h)e`|TfC`eY&W
zZR_YwdyzkfUA1@ix}dh<OBb~>U?%#nz{`bzJ!rh$+TCp*pZ5C4z@6;24i3D{jg5^5
zqQYPeD&fX1knm_)#%;5a6>%_Pk-Q$xax6GQhnbfMsp}|u58cUC*x3=VNPE?Awh}+i
z;|G4blpp`0eexQld>1a2mO6rSEI4i;6Z|<qj-1DV-)b4=yqGaBEQ7i-#eB)^4F@I<
zYBo=g4|h=tS5it5dK!lQKnIRCN@ROCBd3f<ib^1lM<H5QXR}YXhLbQMB_gU-<7mtV
zUK~eAC$F^<@T&X(NVl;=25nXAnmBlg6_&|Tk<w15m@7<(C{s1w12i~h{xrCV($MFe
z(cD~!0gQNamnE@t^J&+-#~dejj-gn04M^C@!Kh_k?WoN?@o!Y+BGwyuTC*IM<S^hq
z`oe^|F$9PameBXmfxS!;N%^rS4HQO5b$H2`6)+i!>=-*Q*QeW%u1qcheoCRJ&QZM;
zjL-l;cE*IW2-IaEMIp(tbSRW@(~QE7zJo{7=|RuNOX9@QCoj1~>_je|@{nR0=OjWF
zE1QKr)VaGAt6=Y5LRMyQ;%Jt4=rd>4@(0!Z52@n#uce36id$YR6|LFR9u#_O=jGKt
zLh7c4^an+zLwD;kM2`^%7a`&*C8-)pJR^0#h+zwO9RE4=lVem;3^|=+oNg29j4vUF
zl$BWA)*_bBTVG;`59osFV-U>v1k@T-CDZ@5!!N8PpOgy*RrN$Gvn1GT7@MA|2(3z)
zaUCg^54ABWa*Vgx^mZ}UOp%tXW=FDlscLLBO+sYf8_hY$4~58zikry}__dIB;zxbX
zN=k9phk6IIQ3%~hz*ZS53SsBCHglC_&UZ~HOPN7)!N?0(3cKYD7qR1T5fnVxrPj;o
z^sN1Gr(Umo7u>NM?!5yHpQ}KS(|wlG7;RNg(>fi@)Z+UA@v{dQxokZc3+p#jcAGQk
z0plm}^NF8)v^_Bfc(%jvu{@qfJB3WB%_!!yTrRs9C<8$GO&vN<)PNjo4k&liXgD}D
z!drh3rg5%<hC;L98J-g~$*kV2?meP8)iM}2qVV@E9C`*>RS{?sPCnpf+wZz(2Yas%
zy1SVSWh<g#%LsABYGu!v&(bk~5GFuJgPUN0^D4W%ReZK#tsf@a4~G?jSr$rVVg;XR
zs*N69Dp0rejrt%|fn0O=dC>cepP%vbPsdNdyDA}z3_TqueN^xCmH4m_YtN?P&8I=z
zW$^XihmkmsGL-y`czMLL7<S;W>=DcXl6;Z+he&1q4oPBoX3)?u2;Dfm2&ewI6<=Hx
zhEPSrrf|qMM{@N`&SW`Z;|t(>BWbOV25A|a3T=e^GaDiQ?0xHHstn-i<Hu&rouCBS
z=HLIU{H1?olb&q%FBLcLJoa|1(5Tt|`34`LWGliftzjXMXihK99NqaXF)epCQpXq*
zpmLQ=6P<BmB@9y4Pv#RnY?KXAwDDA&TgoJr*m8H1E%!_YBeX!f^uwt*`-pZLZ}%w*
z7=`viZ7Hk8DO>FIR3%xWNav!?p}^?WGZvDb*-pT2VNRyi*TL8_OCE-a46#Sms`%8l
zzv!f7sPa-jP|;t_lat^&oDLNs;_mB@#-V_fiCI+#E<Xxx(ki}ot}iXlSr&S|h5-!8
zm^kY%NZJp!p@=za;q;bcdP@ecYoBjUhV#h`|DNo<_Aqi$a!EcWn6|<rMO=aXtjRC+
z^L%&#a@jnlz(#gkc&BqN0lN|Ppu(68X#v=maWoBo<(me01=5%{(STu6Iyr*%I~e21
z@LZ#HaD!x}KM9ru|6=%it1f`Hzaao($an#MM(;+i;jGZZ&1Ln$5^O_4`dmDHD9@FM
ze(zeH)Bfu>J$%wW+AGWQBUUP#`AY%o?S?U~k)X2$Mm2P+A{h(E<ji}mQ<mxTX+9o4
z;B0JhK#{Bld}obDXM^!v->e?b&!6<>=cI?2f`n~wNChAvYio_nY`$Ub?_JdX9nvNS
zv0iV)`E(pkKW5Bw3*-O4bS+A_XLKH7rz3@~(#Cw6;Pq!(WOgA%`^wC8$Ab<_-eqzH
z>;^H#7>{N_ED2yp{cs+zGLi1i#LCICZNj^_0hzHI!l+~Gcbwv=msDCK22Ma`+t6sp
zTGGl0^_P;t%(g<ow(WeX2m#p6I0FX^a(R}Ch$g6HF2W^It{S*9M92p&<5!eaqmMp~
zSzc=nG~mUvJ}d_wDwk<Aoxga-soSzFkblF&$Y|F4u+f8?y7sW-AXBwR;ZV6PK~py8
zp+0s%RJX}`(ZJox1tpwAk+-D{LyJN)e)?()Xwr;i6HcFxW4xxd_J>!Ehv(iboCUU4
zl0r~(*m|_uMvEf6nN75ja^O#mc?YHk2#tlPwL}@4AI`s*Az*{$iC0-hv*CFkXF%%a
zq>RFmUs&dzlvuSL@f6FpCYPT{p#zzkWZ@9V4~(L5WD(xMy5adTR3UA>u)TPB!<abK
z+vR0p<??<rm|}m<VS|3mzjAMxi(J(#Rda4s^2F)bXpzgdw=%or_^KuLYIzJg1}p$U
zs83cTHemH}+oP<q-v_tZy(~TUsmJ;tC(WopHd7Vq*(y=KpEJ#lGmw$t?|A>WXacJO
z3+e0XusUhC_U;EN?C;Y<idtP7P&oQ5oZcbBZXH~7y)mDjW5{J>35>Sh_vj(HPpGp~
zhliKY`C*!exM?hV02Raf?1;qp_L6|s&G+@O@JFGXZ}LtM>p|!4-O$U4!;?u;7jY52
z0}7`nt=;d*RzZxfPNjNvV3{}DTKlCrFZ)7X+bY%R7S(c^pz9-8&zQ0*Orz^Mo0(zO
z61D1htEuwYP@X6yMPRBbvA@4-XPtCUb4Jpun<(!`v0}^&qSfVQ3Qdx=w1@{aUqAwG
zviVKoT}IIWNkF#0$J~l!51dbKtAn2<>~)~PQYJfuo3$)tj-oUi-OAu4P_8(wSxOmH
zL@M89@#)dv;HumX8Y=Jdds>w&LvK+M<Bo;A0ilNW$*}NDQx1hxnt=Q=59UGBO~_*z
zwTa(rY-RDHoEfSeyjS#Z83oFu7-JRS1T7c#TeU=@6>$=I>ZWWXWXIfr?Zpmrcb_7d
zQUQ5}Pj`ao7ENvedoek>A}VD>Ym>5t$2l#Z*-ZhN)eG2)=)(ZPt$p3tLp{EAy)QGW
z2hMyVZK$RU7KmBVFk-<rOn9X~+6k4cB^BG-P#Xo2ucS$<%j2q}@JqHS9Cbh8YxpAB
zQvmYlk(XcJd>ZKzr$yTc1$Lga2@8@o?fB26B(?FVYLU(EZufw%qkog9>fp?q*V{){
zHHVD9mHN14_1lHpXeFCSG>3>TJQRyFRGA>bS{e)L*|g<_iO5%nxDx6fCIa<(*-X(I
z00(vCPq6>oZrLY03#M1Ga(mL=^2&L%@rquXz|qzl#m!|(Saot*jJ-hR+%d_POc+^W
zUoa)J#j)MRaA>AWxF5w<C~vZGpgr2q|7sS^njeE(+wJu1=w0h{_pMeW<7?IDe0uGt
zgUi-<4Ad=g(ui5DQW;>ovJFp@`8h|uVFIjrn89O9qoq3I$5t)qc2~+&2Xz%yv#8iH
zrumJhcCpONxmI8GSv(ObG?Uh>xe&Hc(kQcTdSx=L*p7eM8-?6s_g2P%9_=+l61RnF
zQpP<}{TrXWx=Df+c%3I*MKn1Qew@@rDM)3szEQ{VvGtZZu)b=8lE5hyrmK@u2|JAj
zvuQBLRxeufV&e0J2?nWA<}+^>RV<s@!09@m-JLi5qo^!Y^^R?kBQM$?E|x@DE2;47
zM%%|D)Jo6Ga7-DD(KCeE96Ywrt~Q)<Tmozl8>_R+1I+CsE@7x_!nna+lxfSPaiuh)
zoM=)foTUJ4cqssf>PJo@<P6Vg%1`{69tkSDkh7!2G<c0rbcb+$f%(mx0luE6x?|T(
z9aaF{@RVbgw}y4sc*^jOpQ6E--JF$YM$mE?Vra_ot$3~zL%<=ga3xTyH^B>hUu+Pm
zOS?s7p~t%v(|il85J`u@*uT}@EWuC>Qr)Ex5OOM3b;AKgf$#AroOdAO3n(=I4{Gpe
z#rhO43{T3por66-C~@-TN<X(6l<iwpK?3<cTetW|sFsP-?6M(<uh8@^_EoKA83bz+
zmcpP16Q_{bMb-dPad<u&A~TG}xdWwXQ!g^CidAg}JpTj`tY#n0&WoY}v$ht~$rccg
z!|qY%v<v*;ciLJUc1Mafqubibmu|f*o;@!NjQ;@JKX!E&ZgdFPFaa5PtMKXi{#N@&
zMI7e=BiY(}1P(T`1^3jY9o~6R5D8+hxvgLg^RFoO$hj#tEup90IJ(GfnWgwXikO}=
z=I1eGQPD<t7)pN{^|@f5>BNq0Sb-C;bq+9#<nm1v4f(QJ+yNZ8qGG_FsL0V;$3RMl
z;;b<x$lg6V=p41(87!-WK=!?}+gef!fuBN6gxgHNyT6Y^TBbS2h~(}wduypPn-T+4
z8+RPrN)WS<j_(C{1bepNQ5B}by^JM~7L3(RrZ-uA$pwW-#)J)8-vCI2`)Qhz1EF}<
z4xPl#RuC;?;jblf!1F$resAur25_GCF-5z)qGBJshH;Z#P?kD<Y3am?wG?J$csunc
z5^qZ<@YISBoxyb!2IFC(6}=Rf7Wqu56-#@z0!7yY89Eq`vdaWr0)fq1v(VFwVUBB$
zlQ&(#7l!*i#5@~fv|S`%1#y^*aMgH)Jg?Qa{RS}<W6Q+uxODgu%L-nmZs|;YjN(b0
z0}(<=56g?b8zaVPyN!jG9Eut%dadL2nO@I@n?i__1rCJ+r|6x`XyXFYt)+dluN;yi
z_ChuqG_#Zs3~vRD`ISEohuURBxKiQr#20)VU90cFFJ1tbV{8O+3f*F>F*Q%gyM=Mh
zg*|4EX%%OyM3+TJfkITi$7jfAyEouhDY@xlp8Qv_nu#a_`(8Cj9`G^@r2yn`f9&B*
zd4oV?qEM&)5Tv@6h^f5axUNZn$V;Z-N%2-kLgDCnOhGHC2h)l)j<q%60az`qcf^n>
z`S%BBEjO36?U0gd<7HMQ7Djy;7vA)8$_-a!ni^jJoF_u`T&X9NMbw&HK%pUq0HB(I
zNX<S$vuVheQJcCK2(<6na&N{R^d~^KZ~7^#tow*NeNsj93!py7r*H8pt$%oS+WxWM
z0Uoc@I_UhPeIj}VryZPP^-*zKmhxbgS-2g5fV{X1CRkccWkhaecw<(!uFR7%zM))&
zLIFcFLv0pjHdfM^(%!;u{*K){_IRr7(9rJt*@)#}k}($Z3a!O7k6d6iHYmtGoQ-U<
z@Y+g==yqb*f*Zo@_HoZIM~AwS+FrFYRL+5pnHjyw#Bnlb$F0}dtD~6CDOepHPG`@k
z&V}fvlKM=!^VwIrMn7*GH=((*^7*9=-`GTi+sAt>rhqKB=i37WQ!6x%qL1?#!|C;H
zXRm5mBWVP)?UM9SZ?AFe-|QD4(lTaA(wcx2JtV0)nDRcxCqnU#0J!Z96sS46o=Og%
z2|cD=<(g_qFy@^Le~HkWq^RQI)0gEdDne;F$hVEH%ILz4H<)!}kD?g1BXLeqZzX!X
zK1Bql=-Ai^>it4V@qsGK$&6#hsJm;j>}8i-5@K|O^9<X<?%NzGoQ?y|s3!?O2mx{f
zAU=c5+%}r1y&|TkY@Ae#&vezVSnsJI<8Wjk=cP#$jr%mp-jcI(M6Mf)A32*1`N9g`
zShP^AY@lO_jG@9brV(({9S{PlHg`|e*`g)siyjTtfSZcOBofnmsvMPpLe{ZY>$k9{
zTrfKSS!c)O>2PduPVXH#ju@qp)tnn5A#oB@?NvTEyfwCb01vMDc%Wn2)pc79^RPhg
zqFeoz5}p-URGI1+(NL9l%UF<d$~c8g5Hq=+p$lqgx=u(XGY8y4J%@x#V!bN|kGDVT
zo(VKRWSr2!9&=Gg$fX)Et!7Py&DkVYUx7heCJtl4>s;_a^|1`jiXy8=`LhmwQN&Vn
z-;h};MmMM!anAJ&WO0J3$W9(}WWaWu!3H(OsnoMY?UPSctKU6F>O~*JE<lz?WE>XW
zwLP{#TvzjNc>h_rd>xRw`IfMl<pa*%1B40VdwUm=lQ|wa>H^$!(URx--?)YgP}@wM
z?_QXBP`R#D0!iUj#uNqiIuMVEyt-;#<gPi}0ZGJ4nj72Y1~)$4As|7>?P>+RqS%uK
zT1WNCCswnfZ<=g>>QiJr`efa;hmoKX5yepB3mytQjXrbe-bc2P?A=ESJxBA39oH$f
zHA=x3V<mH;T36zovAz056u|*J41DehUfJ!iJg3A8anz}EsFrZV*;8)4u^(RqDl#6b
z#{!NT<=o}WXBdnM&B^4>(ofkOo)`#@K^BRV8*^7xiuw*G^mP=YBZSr1Aej1b$dL~|
zV&E%aMb^G=|J3u=*EsO8Xc_YX<7)PemEEYMP{VnN)+M?UrflNhh^~*K<KlY>6G77e
zPQz}9!;S=FOr=6OROW+Ao{^u3^^MZb(2X0HEF0D#bQ4ih7Im{m_@LVLt;Sp~KXh)s
z<Vuuck9l%c0puOm7jwhaiMWIpmyKjb!hGzHM&TfLr)eo&pSW>@iNm~zqiYY(PR_`V
zdnTh4x9H%jQdG`fNE!PawGMQ__S<jnUi@`J%FaHXWuhmo){M!zu3gKvUle(hZ-*Uv
z|NA0ta2lk2hDcv_pP6dSs8!4{l?^eI4^g4)6qkrSi=VsWUExRKRNycql8uSbQmGdN
zpO8^xDA;nr(^!znn+p|U!$wB2M24R_KG7@=IDyH9ToWWFgcK8d6>Ac=nuGe};zI<$
zcQk{vp@{s@mck1W48Z8McE8tYDeQ*$s({SV^i3Ff<Y7R;Q2AJrv4txaI+x_{BspS?
zu^3_35oLJd%_xS8q+k+#EOdaBZ5X8Dm6Y90MTjf+Bb2NHZw#!7mtBOJ1^Hq*v7+oW
zch4|KJgZq!B%Mq8K!Oz@VbWQ%A@CV6?R^k+_#RAawk=6;TZiS$^kp|?4jJjaSXeb8
zs2GBhl<S;2kvbSKZeDIJ3ItBvIK3dXeOC-invJuoy>;zCPNWw=w2xKHdGuI24=_|(
z$(`ff!R`O`iFa~rG###zgpIKUFij4ZMO%$<UU*ogFEP0RryTa*NcMjysyCL*XbS2k
zR(+YG<7ZYqkUeTJl>k>bT%Hs16?MguUPd$4qXZ_ds&bAGbiOEOx?cA1OfPY#`%}u_
zr1a@zc#nqNWa+F!dcqq)GLAV0T@nA}fSc5C7vyHCWAC{++(e7Q<wey?$s~E_(-N-i
zd(DZKMHeD6X<<A**CnWSr&`$cAiA$3afwRUqHD|eBB_xs@9bpn@^U{7KFx+?cShl|
z>bc_wud32Gytq(APh#;=C^pu|nhkd+aagSDMq^YC(I`RwjY&MQy|6VdB4Hv-QWh9H
zP}}7x6Isj`_kPMT-MM>9#cJP5n|uRyZ`lpMVTTMW?hKbjt6^<#7f}mxcwI7};YgTQ
zfuduM$iy4l8D-tR=`Gy4rAxNdajZ6;AN0@tI1Yn2FJuctMfz2o-HsfJvj`aaTN)vU
zZlI<0E<%*?_W7oOQ%l>Qb!H@(Pl-7N9^29hU#V^uFutfEnLvzO_cE)!NMu5;I0=V%
zPfP+lvP6pflG(J1FCAa8Nq<g@mjymrD-jK4iryOs!3;PGll_{UPJ(PZoV}Cbg+pm|
z_eo+4laEcket?+*^I)2gtu{7Ws4f&b;YXvswhDqa``x3gM1miyG><?^@ArN>+U>Uv
z-nD+}x!Q=la>v1l%`zo~8eajwf(OEDZo#lFxg)x6byOUjPkrv<HnN%#hr`eZi#okg
zCJ<XPl?2Hq4zO0rzEx|>R1|u}ZdgqeWhH^N-sKv{&=N*q3a&W*iUeZ$PQEl=VOQR^
zZOva|*-iSPU)Uhi3hOdKLl;b>>#)_NGFHzTn@%byeT(C@dgxI|o-ImEV<|HDst<#A
z!_GcDJ2>ssjnaZ*>0XP{iFg+bWkd!}n&Z|TDCiZK02Rt2*cYXVP;diT)=$tdK%i<6
zxajQVUY$7)BSTn}(aLUX_pLoT9Z{wuX{dcTItHn>&&VMIwu3Q;MNCov5Dgm8Nmg_v
z;UpaU+AIvviwAf=I54&?1qbCa+LxKyhF{vOP0A9J--mG>GdiH2ZhEWftG>{%W|4yj
z(ZusW?osffkEA2A1@bSnqKQkZh7|f3_7AUODm*Nbu7C1ySQQPfqN$qU8>LAepr%y+
zsQu$<MmEjbw`AMAyKib$3CAUp0=eWUJ1!OWC=MDVE@Wf{f?>+}a@JMWXi5i|b!w9>
zI}CiX?IK}SEeBr%15T>zUt+XqU>um6(?sf=(BX7j?sI{YYrj6j%n}FP)*c_9jLc1b
zP0r%JcQ6NeV-SZkVojl^#_O}*PwYsi?uL7jdrM2B6E4=C$@#7F<kK-~)o?azxHZ|R
zU$R|?N`O%@sc_eYY1W=iX<V@t&lBbsFOb8FsXwM9(vHuIohnQuO{}_A(~4E>WJ2l1
zjFVwjlWHLE8|N3m|6w5GnEB~t-5M_Ht&JJwkoOQ7powh`t`m7fsxn3Z7EqR*Nd@?=
z*?4EmWSyMlbUy)ZEvt;kSeY-<TVx~1shvSsFrN+`?p&sVSV9qa043bn)vQ=Ucg%YQ
zC-Xuv&V|teINbp&<aYm#T&PJ|TI6}KfN|${9hL)JAm<zr6pRlr^`cPLL&Yda%DNh(
zmpTnYbgSZ&E72et6FESQ88EOX?cQ;n%_*FGtr2jp6WNIZc*o_D0*aGxnUEDKpAzCp
zy{_-o6x+b8Mv?8XGK)!EyBKwltaFMbjF05DNv2HNDn`3#u_&fzO7zzsN|-s4(0t~F
z05%f}xoG9g*3%~zA=cx<PKd0lZrJu#_d+yho5(QTz;N)NVoPbVY?;q^WOV4R8*_Ii
zUL34l`RZ9AsFZ?6R=q>Zn#odVr~+jqm<HEa$f#m4c3|E6xsI1^!6?AE7nhitR|^A}
z(RCe7uz@3--#FGNgaPBgiZH=`D}-pM#RG&QOq0`GI!7gQ3dLgEGZt+~emU<06|b-T
zbGl~v`Z*!>jUvp$R0K9#rCZP2`;llhM8_+~8MmSP^j>-7Ro(B9+XdY@^*aA(XLr4m
zvl(-7A7|D)jWC_qh1z0r<ypz>{{;1rT#;L<l+>%|_d9;_8du|H!IXkfg&;IgM@JS;
zU+j2=@JA+eU6sNcC;;f%KjSsSfU0+mEY_eIqDBQEXQ_}IOOeT_u16>1QkVp&p&Bnn
z4gm*XqRzdYSyc;>RI92Ihx3G5362eZCRJ#t{s{L##ti_TTX%9?GmlqyqQiW8?vIhv
z8p0GKiqJGILW(>>6xLjX9gA?{NS2%~E>w(9D;OjZA98czJ8`^($2%@N?@Klg=!jD{
zj>Q><yj|%coo#W)k*ItStyL534V$r8H*3#6k=}A%|Mpo<K3&jvpKja=?ywXf4&`D{
zIgZlR5M4OTliab0P?=9f$D^j8uKk)i?1?bein+rS$iT%(K5>}-oOE66Cva^i#JooB
zXv$ZG!(1c`QFE!$)S0N>_><XKw{RYq08PiJ^nnJEiSmcp5E{yMf%YR^cXA|5ifyc}
zOHp;KfI)(quXdv)3X*$l#y^W4x{Fu!3t82r0%q{;qwNXUNc*mC?M~h*MIj#K%QnDS
zDFd_1NyyJrt*f9La1I6j1f~+la{|V9bj7CR0V$P9oPv=n{MckIWM@cmO<TOH8UFyj
zs&ZzKO>d77;k)Jc_9065iufUg1<Dtyn9*8pXJ$=sO75I3AzLW_;~h<jAG?&@KH@21
z9a2O;j(xhJ&apKXBGB^X4Nf`YbCJiF3`wZ9m~2$VB0G-Ge_pSxXK<p_Ni3HGhxB#Y
zVvJ}Q+C9e?^GRTbC!>&t0~1=gZik^ZF`8YGf&w#3r4KrlPM12Xc3=MuL;oYTx&fR`
z<$;sqCo`wVbaLTg=T>K~fB|VivEa(}Z7?PiE9HHLdj*r0I(#eI68PbmjvFxq8%Gyx
zvOgVaEsqKvm6YBhd%~|52CX4DtNe1zdF`DY9%EhvZ*%KwC!Th07ojkcnhaZjbtVtD
zBMizh0RNrip14H=O=I~|><v{&lvMMuq`sU@m}EsV<w60pn!g1xYmm9g>k+wT5^tX?
ze0hRKCums5=4q^9MGG*Jj-2}enk;PF_gl|jWRlh_=4-#rKsRR+1VS~40i!DA5$8RI
zP1GxYx5c~RoUXUC63*JgWDQM%7I12WqDA(|f3)Z3da~wKF^?8mK0f?)E;gL-s3z}W
zZ0_`*Y?X|*?k$94!)@lSW{cX&)^Hem8)rmeiz%%MLUjE{L^zKU>odSfXx_9Xo>1`O
z3uN0j){259d=VzpG!(1VxRJHynk%EsY+~e&5Mwy03ra-@rbAnwFmml?LsD{HaIU`M
zXbH0IzVpnf?rrBThnD%69bUvVs9|JsmAQ<&SACe&m|-xsZ%wv;b14ogRz~)buiS`j
zwa@Q4wOqA~YW`M8F10brv2|JH=wC+K6wX^4tkrdD-TBN}B{}DiE?>c+6iG!<*RU={
zjs{l=!x!Hw_qMIweW2{AxeJPyO)8a!s8noijnVu|pLI`Ln9^ZUqQFsl8`|nJWhA5O
z&H;n3DAf&nC#|5pS){soK#3`r*4~t=ZZwqa0OAWBsQ?ICuLJV4(&UM)Ut+EWkiUCi
zBok4~qau%#T9{@n5rsS&;S-fK&d0jW2;JF?u5N98t?6~u+Q_W|@v2G!DpWgJMtoWI
zR8}duSVQH+LB>`hv9U#?fB9!@XMoLKkM88mMNf0F9!UX6wsLgIYm+S7ULUWxIjI^c
zx9gfOWV?O451OQhgYd>=)P!<2>ia3cl|L-eU*TtI?O42)i4wR#^QDS>673g$meznx
z2nb?$ON>%h3&vnB(}We&ub0~b;HS(E(Ow_MJrnCQVRtWdF?UzPf@_&73cyws55C%B
z05`U3wFN`92ly`VK2D=++Hi8+q^Z>PWrUg)TxzyYwp4k9n5GXhm$`^MpZtL&aK{jB
zk65tHqG@vl+*cEPujfZ$+JRzN%M*QMM22<S8jl?aZd%w}2x6;1t^Q~{&Y=4j&^GYy
zK=NOCn;Tot*72W}HMQZCJ!>`95J=putJO6PhUQVT1R0qVCjTKGKB`7A0Pjig%RG!J
zvhH0|$#N^GX0&p}2lts1x8P36Th`FmmRW_O?3mqSZ;8iS8Si?40(;Fl@~Yin#^^;8
zec3Oos3TOTe^~vH8P*D#h&#5HGuc<#D@+`EGreXLfWSt#4<3xDH$_^KqieRsP*EP^
z`<+Cp^*c@@RqT_UNchQaky62-^tf8;wBi*kJF%8Hu+*n`C#lcxxhDlar5W$mRn9j2
z{Cm$gYs|S`OHL3JSHH|jtN3vicb{0=vL((fua5K#ZP!WNzV>jiR+d+{aAZqyExMmC
z>84%j^-W6SVq7T4gUs?SI8OCQA8!^Pr&fXNajMqD9I4+HxXr<5ks}cW;=|KS^lc<e
z^(X#KA9n<j!rYOTTh>J<^n!z|crl79t_uF_LH*+C*Uy$XtBWRf_j$eY4CT0XCYU>}
z@0g*BVD`~naB}0pZ5LO7*%3N@h;cdluRCx0t&=xJK+&G-j#B`MM85b3ixWGkU8X^L
z9mOB>+jN~m$U{|%`W~k0zKyN2#8{gmSYjkLYX(J4ouka_$Hw+i9CV^t8cu-lsUeXf
z--%sm+8{4%zUky?45HaBUdf^9f3u)QQ6sOF@t0Ceu;ajWz#=NyxA}3x7Pn*80QrT(
z!Artl&?X%~G#)?RYO3HD)SzMw67PcUCgRd|ux=e4NhTAVoDN1F>Z`$Pyvw2p7~#Z3
zkt+m|#7|^@$V+owrOqcdi6a1D+5trCQos8<^xeRC%8`XLDB~BPkr)GX+RfArXVcg$
zIk)XyQV^p6KX}m+N>~QGIv9uNF`^hN`SGbgQK1JU=)fiExk%4#`((R7)O$u?RtO+9
zMiV+7hHwZw<s^zG`;o)R)e%6A0&o`0y)3nr^yjkYrdTn5s<e=~K*@L9WT=I;_*Yor
z>=LuZkQYp&`Gt7ZS08U7H=4$NNG7wWd8uW=mtnCA?<}D0E|UhIZ_Yy}u#Cp$zn%3?
zH6}wt0V`eI1+}d1n7$AV0otpm&iO5RGtO?|#kxkP>zoe?XKhj{N{N|>MH!_E{Y)%8
zE(k=OS=C}9U+9pMUqS4kWZ|6Z`F)zXP<{M((Uq#*WgdMC?o!QA3eMYMg5LWF?o{f)
z<-YWu=zLeZCkOjQdk{*1d^evMOJQ^g^RHoXN50X)i_=jOV2E)JqY+ID$tRz1c+*wT
zTW+_DMO1IE*FWlFe8Rc|^}^Ybn@B;P3iT=63}tInOq6Kd_`+0HuUM!wgZ<;{=omKG
zP*|iz9Aw>TGB0frywS*8<I*2e<gLY$R+J8PyDINGH)>~r_ByW<L4^lhh=>U}U#!?J
zOqTZ&R&e=0xkL(LychsdgSGH%O8w-cis5anckwP-nb&H&{HCo&CtF-poX@Ail&I)D
zFt!BKtD*@Mr)-Yc6OWDSfh&;<2%qhjl%>sBl6Psp=z$6}JEDxRi8rUvY<$i0w23!j
zGyeijJM_JT*i{i9X=gEtREr6W=2`^{np%eS1LMd=w^W6(YC9uq`jRZJYSQh_kP8~t
z>MDi<hg~$DWKL#XZCxjS5WehD%Vi61olrHLNvl^c_ufIQ^~Ym2&12?RoJH)AI*DW2
z&FVDtlfr8bjso4Z8njSAd7kii!)YdkOifqYQZwTPELvTd*DSxB*1FZLG3W>#nnU(y
zXhA=;x52V`Z=B5Yj>Dh!JJ;7v=%Ce?5$`DLL-@VO8;K=llpo8TzcTtf6@m~MMwwU<
z$VL{5yY>NkU}}{9u&<sp3Xkf?hGJ&Tr#e}G7hi2F%W+xap0l_iPA~(@STVg0M7mKk
zl37R?1;RKYLPF8hT{H7ndi62z0fyg0C#E4r_~1xKRxrN*kG+3yOykHB#^L!ppQ59E
zV}p!jNlr4emgW4ggl#smq!m&;8LuC<fkx^WXhMT!d6MU|zvo()?rK1eGdr_Sn2815
zb+1#W&i&{riG3esWhOIDdoB#LWUi?n`7ue79AKk>L!XN?G3EtBJHaHMX5_G;4Pi2~
z>b@K1gc#7)KDB{-(c3bZiIUP~rN)Yx5|&54w}529R_E)2EWm*S&AygJ$`{FNXHd^!
z+c_lyI=ZlFV}~YP$m(9jrWA8uHFS_gb%n#NmFh?ppJ(%3V|*1mVnd_67UxR!kRhSz
zl<!A`@gY#-m}QDCND6_hQP9PISi>BMQFJQl0wk!nb8EKALo)Y>bnArdG<m;&U++jB
zY3Wj`7rbH!yg5F=z*-eJ1`xjOLpmv0G}s8TWW7PoISF~hO4Q%Nc`O@mh@nU>eU-KU
zvd~TR3t!?-jWq^<sf@v$Iyp<hY&5XR-GfQr_Z>Y;IUjuAV(9_|h@Cl1!*_`*QUsn&
zk7H$6PD{_)4{tU?PChjEJuJpN6Q6XLo3Sd=4CI`l*aY^yVJA#>z%=MEMbE5k!BHeQ
z%o^Rrb4iqmZiq|{$($)*QvMpXO3#>(FxT{J%2v+#!8j{GW{f_AGbI5NlcO{h*V~tx
z5fW%uQf9Dq$V}3rQ;8uQyM!Y44~QsoKvNroSqxN@EmTZ4HE|_qZit}0Xj*>0jS?tW
zP|{7&lizxu(!pVi_~B@gYi>e6n6vnyLLnU{tO1bm5>^pwG$Ip}r6-rUoBXW7);3z*
z23TiQOAF@!(06i#A6vWLGJd1w5xSimyE#^<$Pcacjs!z1T5!3xU)C7Q%c!Y=H{H<G
zVmpS{;--%yaLWigsI|4kj07B%7qNu+Ldu!US7M8$3A+zZU%hIctoHl#i~G0Wa_m(d
z$>Nh@VpW-fB@|nL#jI+$Rb&dt>d*B@BvU!hM$mGKHs{Ap;uzMEu*_t+We4dmSf;Gy
zWB1BXCIoj_U6l#EV{*u3tFsw}TBS@P*p`BwJF<o*-SwmR#hzVX!x_Kl3SBgj3-N5<
zqtl9WiJ8nAV#H@ub+Wvk%bFZVql7mC$&l={kS%aLP6la=fi6)1JPSCEm%`bY!K@J>
z$uKZQWvhwIq_P3Wax!-<Tg8x&U14PxWREOBZ+hIA;+Axx0-1FJNfi&}$`SJ(7;sc}
z!{0gdugY(|3sDCQb6`$M{QWuM<7<h;K-@Vqzl-r=6uYt5%8AN^kEl5^TVk>iWH<l<
z3h6lBB-?;`fpP1_2(WruL`;}CuvwKqaI}cYy={PMgr)veft9Uv(jenhl^hu_r;Kwa
zYD7UlP^`w|EJWvfWwS76L=TJ-M;gI_U+JoF+hQ+sj2PlXEu6zTZ^Kp%$^fijSQ(@D
zLL<L0TaY`3(YYIi!)8;$@M6p0ccrPe6QwK+)d_cI10YjiA0p+%K&KqGvu`2*RU|uH
zVuV)}!dn9hu`vI<^`9(wK%xHn;@(g*Y@|~qRQ>gf;?kNn%8i6(8+32yptnS=2aIE^
z#NtIZ#e+CT5?E4sqHvI6{bwX{Hxl`V!dg+o!cfe62T0Fp5-30;;Ka*w7Wd(f7GF;U
z-(pkwVv6}kwGETmG@@A5oZd<G;<&|Wk_Qzyf)uW(nJ%|6Ao)@`Ez=<Da>D_QP0c#F
z0e6B8z!OS?qGoY#cHRQlJ)hO<@Qpz1A%IxGM8tTpvGjVCdPmlp7vh{(w-oFPKSgm|
zpx26YRraiwYXvQ;%r|TOQ3bB%=q!QQlEr&9(1u;4Xe-a+N!qV%T#7B9i$pd&k%x<P
zOxG^e!*m#FoXF}jWczFFBm2Rm4pqBRr7yKcALV>!@x;lQ))3>1`x+akcyyHPa3vo|
z25_!5vD|>`H>DFqmr9Y3w2j5N<QW6n2YKwgLXT3VJ*}W_Ff~{O{w;;%sbV|yvzE=@
zYZGr+!U>5=D6m+;seCGbV|RBcbJ(zX3X%^JPy9M$<FLs=ut@r;HYaYRD5k`TY~n;g
zi7-&1rYP5)5yiRjFWirt3(hXE|IG@(FJM#zBUxUM!K$^S=P|mrbxFXYgv6GjFe*h7
z`V6s-k>8&1k;8wD>Qtk;^t_NRhnk+-i(wWIEM+b|GfhimjqbJ0@xYg;4R^L}!bun{
zAaO<#@f*=Xs=2^@Ee<Tzd<timmjkUz$PCZZ;8bUD;*0QZ37q&A4dri=<uk-k`}Eo6
zb9C=C5+w~1!5S0mbs<>XredGDJOHsZRLTv*CkZjw%8cz>8rB-_16!;KGtrBC=?Gn(
zjZ%;R(dc3d1}mEJ1PgYKI%<vNvEwA7B-K6V_b`eSA@ea-9j!1LM^Y62j1|Fy+FqSy
z*-qd#--VD{a<9#2PV_3m?6GKQ$sWc_r^cTBjzWd$FE%qM&q2w(qAq3mH7_ier={md
z`iruTn{(~ItFV)#(hlB`6Uh0caJ*HvGa<7rpX;zu_HoYlO_TQlG0##WIYlT*q_Bhx
zjFQ0>A4kuZ$O%2dydj}qVqW8dDq6&W64UXldD&@|=nFf)ryLu^K6s*Ms_q;v^V-u&
z5}t|<LQ)t{6{}CXQ@Br|1FBb#N^cGn^C?<h%ZSd5m+KK;6%5R{Nkihg<}TDxu_{^Q
zbM@7kKM3(3te5tqc+oAPH4C{xqK$J`!tUk)`MhaBN+MEAfSV=pNYRSnN~B*2G;Xg-
zmr!0dA}>Fz#{{g@w4&J;1_BzCowG$!qN2~5W2{h@GVW<JnSfcR|C;Q?*uXE%JyOVv
z_|GCdUk1jO$Rz$^jILVX9%EpN^yIsLCxfCHK~d$(2cjR(<=B-}vH{jG{3)La+HF5|
ze1$chTe81)B9rC2Su~TtL~QtAe;JX0d3{J$scC)OkyY5WT4xD9Q{*jS&{4s;ivp0O
z>jWQZh($4NkUVy-1?MF+g%@LuhwQHFw_mRewxl7FTqQV4{y7ZN2Os#E$3&zN)qW-m
z@(B=!K$KC}_`Ht33#p7f6iXouJS-Mo`&3(sUS-Hu_u(s7TqQumW`#sWnj2Mq(`wX#
z7*T53kx;u@42L(f$1J48;E)eQ^O$&Oa0z|j_qk14OU50W#B}8*!4&1dTXGBwwR@N@
zA~#@6U6l9=UcYiek5bMLzwuEv;s8p$w8uP-sTIuQ@f)%_uaV6;n6>XI4zeyI4VCb9
zg5mQF)2quID=8Ab+(Mg$9cN-YAKVU%^OE*dQ`i(5ccVEN%ur;(*kFSJuAhyF!vRPo
zbE9<nn1qhgIOS;0nCGE=_Wo<m@h4DEHlZK3Z?`{gzoYUErTHF58@qdd-rj-#?LOY!
zd-U~&+se1-@HC_J_DC1vMfK(_P}%5PLk+jj$VRHcIuht@<IUs8yKf6ET>_pKoug?7
zgC;-TaVkEXkEahQhS%er4YhS?P9lF9G@a8hooh5D;;3jH;XcHya?PWob2J{OkW-8W
zDY~q&<D}3UcydvCuU(x^qG6nl#4q3KY9-8UHYH6`9^J<!xo@L^Y<vgfH9j7UF0j4Z
zY~e7~Bfy;;H-yj#Y3FCgx(+5i9btq%qpajaDkuz2I6hZ0e?GX7n;}YZ>yXi53o@kP
z3DaS8p1RebUL_O3n=oX#RLq$dBL$Akfpc1dRD^lKQe7f%De?ON)0V@;yRI(7#y>7y
z#g`}TzjiyQ)x0PgL|OoGQ$m^UHJ%g=(~M%{D+HB>Lkw^eb&tsNI=VPK3w40hBzvDe
zAK+S<84!K%_ga{?BiAXZ`PDefxp<}tl6Dvq{MK;|!B8@A$LiHXSs8Q)SR*CpF!CgK
z?6SD|Laf5~h#gI!oHOjMeI(H^VXqN8Y2Yn3k{%{XM=D5YUbR%Sm7@nN95s#xDwd#}
z%AJ76Tw>T;J78H&#dscXiU;(qALvD98*nfW0&|1QYmhPiRc|~$>H<T4)@q%1Pnxe<
zzD!QL5RVG2<f3sg;4p>5RvdxtC9gw;<Vj4<bK#AqrJcJQjkU1KCvJ6zJ3YY`{xRF#
zkpWk1xXx$QmYaF6z3Ey*w_Shh#v_giY`pDAx876?Z@#|P?LW*WXv0Rj<+xIi#@T%`
zH_;c`j9o9roVfs52oln02q&@TOB~Ox=ze~mmYf)bFmDj$PHaSuN#-s;A>TK<-@a`~
zYK1qC-g1ghyd~a{bfJCn{FHX25p7OoS1@86)!ko(&pB9cQI-)d`|9+heQ|p3YYsQ3
z4<2BAx>F}U9pda@q0arHb!Jsp!trUvSNB)W<m~cU=kl4Ya<;mPWOdORA6C~e20dD*
zx4MqzezBG2>sRVNJ3sxtb<#a=9kreHIKN8^hp?Eo>a*2Vp{t7@yHL&68mz7rNK~n{
z`>ShTo|M*hv38%7f=;V7*XhimVzl1n>UyX@JUww|HghUX5&KaM`~F1U>+k>Cx$m4&
zKGfxIiy19c!1yxGy^I!a@$#4oHT^^t;i@;@0p-Y(cF2T2tq%z+ZzQ3!q@WPdRhkz`
zG$B7TAoHOHv}>-QQ)082aehUOUFPvsAx5KAXN?axAWiXm`{IF#3e?3)rWqVPvkysb
z?rRiy$N;?-05$)O8|m0KO8lav<V!HqHWcUstxtY-7#e{Banp4&L)R|3ugP;ul2}tj
z@<Ep5s8g4bQ6Y-?&V`H!0}ZYg6M93}#x(A;!3+u2CYa=I7GD{5LfqRN$)eg4a2_L8
zd5IIY=0DtoW;3$rf}3qj5q^c~-wrO4u8QmPS%zhb-DKc#)jpY6Pwq9&0<qzEUUQsP
zHqybtSC_=k9DIdpH~9kp$NL_?0u&v5)do_1M1SdM;`2f8;HwlJNAS;7{*vklzn~Nh
zTgJazD7T_+U{qT$Z2S((Lw`p6N1npWv;ZG#?5RH<;2+pG8XL04@TKhpxTzJzF_Wvh
zSy`Zp9Wp9Jq1OWi3N)QlM6?1N)yid$3{BC9gdWoeb+@`yAp-2XNGy@ur(}v0J&rcq
z8QO`}3PRs#%e2|Y-}SrJDu|Vx`n1{Qp$~fgs@75@xdv%}?j7{$q6c7svDGINpl0gD
z3a%8&uQHA2cp$wh%gK-L%;3hHri)`#J&v|^SAdBMvWnPgb+!0?oR02XF?8V9tOBj0
zZN>7!fmLMz-->#26EqMZYwC#1;#3#e8@E&y>!7*S4u^A`2T@*SuLhOb(ec4ALmh&t
z<eK!K$XS8|gIv=_xh7%`ryBmWb!z!yn#}N7ePcDaSvvGP_jK74$f^#yuTWn^$VyCE
z5ExnHjkgbAn&xOELT`tmp|~oJ9BB<<w9owPt41lxs-h+A?d)t;=A>5briq!5)os6@
zTb!+qN=wpF<2^`53uJr{NS-1rAH3#uvzd*xiL64glr=p1NQ+v{U)I?8ugOMZH^dib
z6)r6*lGL;TQKxl*Jb1$qyc)xL^^)DB>y3q}n7D*9`iXo3<Dzq5fSVbDT+OxnQWvJ2
zS!(u7tecQXR(!kY_Y?NCEBZ02^Y49(Jn)5+I+(rK=zyc!vYN^d#bwXrLX<$<IB-<R
z8AU8p5oGsHrcvZ>iDVq00;waj7tgiPE!oCnt;e48COg@oi3HTe*Nzux!J&x!TQ%j6
z*$ry#W$XC(RQH1-U^yAaxGR_oN{&uv6yD5AbQ%%H#f&ydO5!+jdiELS_Ew#(iC=Ht
zcu7W#s6@J<)k24j;zEjFw<e2JQqy&`#k!ukPbfmPNSb&OgQO3$93J9LX`Xt5A`ueV
zAk_}|vr`wJ3Z0UTrS0knT>#GBk$Z}f_lx(Y6Cj;uCP(ME-MJ9)kocIR!RU7MW45p{
zAW08mV?9_p9FubaC&hHW6H47CuavM4UPct$RVNV&n#&aPpb(?_=BKyt`u>;qF{&W_
zdK%sTzv!Akb`qV#cALPF;^dSqQ&)!bR6`Hkgj_>xYp_e2Q{IR+%GD&YU5<K{e46x8
z4~;tjK!pCB#o&9Zz4+Dz8VfKiE94{M6nDx7JOj_m(LmU`k?gU@xVfCG=~j(ij6oLS
z0xy%b`a2ipvHoSMU@I~?<3odniiAZZO(|hzSJvmIvR7~$q)0_yEz<nj3j;B~$$Vek
z3iAw+3%YR)^bX~WgWo5&dhd?2NjlGFd83>(io@>W{j1llErD$vB_mvbQcJ!X+4CW-
z`9u80lX`k6pu(+)O8(+WCC#tXqs!x#=TcaTnMu(KCxrdzazJ!2QXsMRPq_=(0dt7(
zx?6${HV`q$g^+H>x*|_T(7{m;hO%QJ9b;s`_GqkUb9o#k!x)(0<^t(&DL&2yi&1it
z&C}uSB`o|Q=_9P4y(HVZu*tV=Ocv&dE+_C0Iso<(BpQXIaz+#?b|zeu6f2))yXK#8
z75wU4WVk@-dvpNhWbAx$d8HX^0j!}DZ4ZNrh4Nl2sBkLrUkakaUp(=&@0R0btv-GJ
z{1@+mO^z)KpwNXjh6`Mpjq?@|1RIVm3h(8bI7FWqg4|tZ^)T6Euci463AX-tYW$9N
z+3%>aah;5&8{RQ+GeF_nHy9f3?_X?an)lj|t<Ener^vKyVEGo=kv|kDj+6sYq1n6S
zmK_DX6z6c0oSt2@PaeX*r<WJx?*&%`H2I=+LE>_4o*m|0^xQsDqi)0GFhR@lJ+*(w
z#9i7&;w#WBL71xKG<t|lC4x2DM}c}Ujuo{|o}U)#p-={i3QC<~f>st{mK2)#zI}Wg
zJrO&Tr`q866h*@ND~w}}Lt%<KwVC968a*ME<<sa*`N{V7_S?4=tplZUI_0Phu<nnw
z6i^#SN9R$^^!UpYYXtE0@s5F!a)ZuzNzRG%!Vrxo#oonsar_(mKrX_xKFWZ%DEEP>
zFVS=q5&SP~8~TfQEC0e6Zdo@dGzSK7+qQSvX`M$;kh4PIdb*@;Ay)CNQ_E=&u?a8^
z#iJKRop<RpdIyb?$zTZ#quPM4g~!otlGmw4B5mJfvYoi=D`B*J<r#Q*TwKJH)ALu&
z<6q>qMP%4MZ2ltpJv(seODP|8%{QB57W49iY}~b02g8yC&I?6_Yp~J02<=g*Pfbt*
z(G!$B!b||nU!S)xTE8@pkIl3@i=0f0fzhEv*Cc#LN9?3w#)k+D8=*GFxZZ$IGfY*A
zt+2ay?eydqya#Zz%uEk~Zk}Z$>;I0K?h_|4Q5bb7tN6r&AE2?)D+g)u+Z9cTZZ3Ml
zb4drV2p8>FEkL`!Py#Ho5SJWXu5ciI7X)fjX&0SxJ$gepyLEU0*k|zcZS;opmhkuN
zy!E{O*XYS~mJHJmMKnX7H*^!crN1z!x5cFsZzAAl;JUNE5M+5KwjAE5e6&l(dFE2c
z>Grjerh-d`w1#C!_DcjJ=6b}?<9IvzrcUHuzU;b92OD*9Uom%d!4yk4P`F(j#!b6E
z&L&s*A9UYGS@>PMhoimr0ALwC8!!><tuU1KBBd`CYPs|JA({06<BVZmSwn;xS-r6_
z|KO)`76aw%j`K!BX`>iF#AWph`SipK-;GeJ)AwZ(1$yi2Dtc>AN5Y=PMK2QR&yz1c
zyFDQ_khJjVtt;Sh`&Y-Ra;_0~h5ZB%#^YJd%&`s5I9X}|KcX#)mX8KMD?C3vzYkir
zr_rO8tA@v><O`1C62G6UV4Uy1BM}RVS01r=MY=DESoC9q`}Na7d73x_*e*Sf=tIgr
zaYlgGFpKrm+eUP+?<%fBpN+O;Rxo64dCvMNo`d2iv<dhrCqJ<we6o_x-YupKg3oT-
zN40)h3>T<#?~kg+RxR^}&ML-R#1j!AiYOE*zA9RJ0J6R;;5Pht$3cT7H*$b(;1lxO
z$vpm$%!+Vb_M`F;z?WIQ1cp^w7RO}O9nSBJ|44pbLi~@y2$887hnOh^P+4|V(I2e1
z=s}L#^2xsxS?R*^>mu2W%HEZuBdi|TaJXb>Hh6#;#@)NffgBHDs$n?Ai=A&d!B6G5
zj9{TOy59xR?*e7Whg99NJ`-y@Efi3$^bK*PZ;?GIKP)BcMSiYyHS?=c@Ez&AHtFBe
zjUK-K7x4Vsue<Yz43~HO^0@6JrP}qM<AP9B*qsKuO?FY~V521N6dY)(&ZaEoDFzss
z-(t>d+P}yC+Tl!}2BiHn4omAos=w=I_&a20^;#V(FlHvQf(>$|KxrsW2!G7-WHj_N
z3*n1BbZ4g|y(Bkk3RN;?{n=!Ye4rMKvp&HvvEHmH+M-k}NATfLa;d%IgGth0An33G
z?{l*}IOO!fZXvCfZcYgF(;{83ZB|{5ma3SKr-6>NvlXO;>Hop*+r~X;ijv%wv50<5
zWSlC(fciy9rC}A{tUv&%Pu#Av4r>s+IJYVyQ<rHu>8qd5LjvokND8kSCw`VKdzmI%
zce(LwueaO<EMSKG>03Qozw^=O?;SDsdYuc7Zyp}MNam;mse-cg9jozUy$}m9umo6n
zDAkD@^-}?^CmE;Bre^-7;FRx|_4cc>F|$t_w@F^j8Q~{%9p7c#wyR0DW=|FQsw#v1
z>F1NEH23pKJ64G#K7B0fbDSv}4_9W1`8{b_mn=oK8D+u{0k6u?F@`b+h?uiGV926y
z9fLId+|eivKfX!basxG5P0S{M_!Z6;!ZN^dm8~%rqkeZnrfS;QsH(M+Ve)9b27jXo
zoi+p1$(Ni?%Q3LVN9kZ$HNuuo9r_Km$nJ7UJtD$o6L2x;pt}`{WGZQP(s?+hooy@_
zz%IZV6i`>?!L^|oe3uJT(fh>=$%6+~r-DuyhV9K}15v616Yvo8rm;?FSvbQowGZ!=
z1wtTME}L}kIG#$;VyNVq=C-k1I1t7sjx?ReSsC(CLygJ)kYOPPmzQWb4GxKz&e8O+
z<VxjoyJSzoVVrI#lFdSr>ad9;S`N<hQYif5q89<CeuqGv>vHpwYlyFHZ=b^fO4t3k
z;_`YiN|zNF7_}8CtVDnJ3)!c75&+9lxnf%6?_>g9wrO3;ZI?3KSFO$?!|L#W!sJ1q
zXZQ7r9WZ@R_4RsK7hSBC%X_1+1)Oh8?H&Q>MSY0MQqmxX^6IV=0a90bO>TD&c-?dm
zV0A0mTMprGF4Z|k_nU_V-JYDAZY?efpwHi`oJpCcMKdc&_Q8$5if=C%LZqdjP|(}O
zRp^o1so1eC<AJG@mA27KJ&g;8YAwV{2<am8riF7FoZ3nG&G^~Lf<?;M8gA5NU3~4-
z!oYgvoJ4D)wmg|5C9|$TT$S-9EF7}icA(WJy;(6Eb7QSLfvbuMRH$-aR7^nZ?SiAj
z7?C`if=yltShU8;0+XlTaVCoiS#PX66R`+!XCf_#s-+fCuKb3Db_Vy^uD~@fK%S_g
zTE}k1o%}e*i>Qk!c?-9nNZ8bX5gY3^m#MDrd<Bw;O!#^Vbxsrbw2Lq<>J^st<4w}(
z<u_i2yd4zkevAe}a1GLo@DhYB0i{M!)g>suD(}MLWhht2s=E;O+#mDhN&BMvs(pOi
z?z9e1PmVhE>Z{Q^Gzq1E39BZ5!|7488~=1atwglet|*)Qk`0He?TUu!ET6x13GB*`
zR$;@fw<WWqsE`EM5|(6U>XUIs9i(=2-dpzA*<_oil7>mV;U|l+DX`<mmpvl|2dQ8J
zN)FFiWDRSEg04dkJ<80t(1K#EQ~#4yC9}=#YH{9AE}!YP&+GYRAOOC8N{nIC*dSV)
zd>#k6Eum-V)hG#grG!2kZvL1M?TVj|q-f_Iy0gqHIPEp5+@IiN)8v@Yg>?#cUZyMX
z6JE~WG?(HN4va63aTt!;&vvNFLu)|TKH|WPX+AG^y&28Yt7~+wxZyB4xKt^*Y)!K~
zPsya5f^*MNc9fIPf_mYEn$s}$6f`cDG-`P~!Fb)|92SgMPm-@9Q$V{=UnR0H!Rm!)
zs&1mtxd6K+oML<l@?)UI`&}T_`?Vac8x+ukHx-<(qC+c%@FUsW>HaqzVygkOk`)~i
ze*feSE1CP{J;F`$X<be-4Bda{E>BL6PfyQ2txE=(PekPA?)pd>MY6s?poRp)J8-kU
zSu@w%gWZsFjNiSnr7+9AV>!1bDYxPbe6ng|l@!ChwH*(MD0}x<lMlgdZG2;{9sd}%
zK`zJI!OtgIS-}vVajs|T*@UlwFO6tyGKgi)Ffq1VJVzw!&wMkA$4L2L++oSK#>qhi
zxvSl@iL~Y>D+>s~zpQDml@YE01`QCbv}3I#)`i9sqY}BF@`(Ci;+@5|;u#b|sVhJ!
z3=yRnFLU@SPYy}6Y&0Om3gG``$XcwhU;)w!eRh)@r;$~Q9wyJsK!8Hi_SU`p!n^V#
zn-ARwfB_H!kaG4Tn>@s5;F6`BPYQx=_=?=9IzAjq0DWm-hqlZCNQEM)Xf1YJvMJ@*
z?|;XZL1o1*g))oTDz)IP_e=O@TA4R&wQo2zPirlndx%EZ)lyLjuQ-kU_d8$Ji^d}a
zbh5MvuEuX(3<s`>+P#f>fGpXw(PqVSTpWMD^;l;?mf#dwk&swxdCNGnl})!#J_F>H
zkVwgabR8t}`4Gr@$m92hcDX$RR|;Oc#PFO^=Z6_Otzj#c<rIp|-n&(3{`W$Ed<|RA
z_Xab*GTrj{N_v7%Gy1ObxOW=%D=eA+XSB0k($i-U#)+%ka#>uJsk$Lvmikj5_bZ}2
z^%h5YO)t@8+a$SRH|^_H(wYt7p(Ty89$Px-bR-$C!6{zRj*B5G=)NVkLTpA35V_2X
zy14jIyuwaxIc+G&a=j#nrjo4nCrZ7GJN9F%LjiMet5|wc<yUXK_^Z+1+TLKL)eD*4
ztzJC3#QrB&@8tAui>HwJ>8rQoJboTiISfca%oG}^;H^nhx=AFm*Psw%=<}#I=_0s;
zev|YBt23onF=1i<+9g5tKEcGuOHFw<g|&`gwg0a6`zoGNQm4kFy02S!P74y)FI4y*
znh5V3v~Vs^Qizhxcs7e~F?uA13Oz8Dj}jn+V0oxd*OX#HiVofdPe&5&wtB~+?;@0X
zVB|!)(``%IzAL3#fhmGiQ^i7vw9`K^p+0|IxA!2DujpMwpR0RcqhG;M%cLuX-i2n^
zqN}WopPX^%qe@BH`fC%w;nj;nV%q=V)xoRkAF?<s>|JwlRG|DB0oM;_zuxJYW$yr6
zSgqk*hLclRD?%)tWX|}^ML-R$UchnZs%lw{=0XGer@uPfxiWW`tb@|0QZz8v;&8QS
z)nuEv3%nt-_yb2@UeZdD-iSZ2{XGy9v$XWCGmmHU+PzsCT1eAoxmuFEqgosPXM=R7
zCP<ln*fkJ}vK{^`4Klpm>S@Zj#w^`_m)y#quFWiJccnCoY)XBsx!ul^?o<&9<$J!f
z=t)ei4iR@kmzwZ+9O97UkG^>_on`Z^pN+QOC$pS=YMYlAFFEMY)9A@G&hwjWMwS+S
z2%5LiTNCQ=IvI_!>M&)-ZsL97SWU2W`op{nWD6Ute&N8MGNXG%W^~;c3)=L92N-Mt
zdiEtq8)q`}NM_FY)aMxS6hn|>Qgr}E40eQRmN87;hGRVA@7RiP066U@(H=(U#IFH2
z*b)=5b#h86j4?j#Vu~)(z#vQuLtf3aI)m|yM09bM+ls8R6VY;RfH<Eo{%I|~7$MGA
zI+k{xr#FcE;w&P-)|BkhxbZ(dC`N}^Sz#~WJJUQoZaN{j&;UO`z`sM#3*CVZw$3kO
z)Y&>O-GJepeSLm<^5U%70j65wduV{KEj?|NI}pK-oKw<V<x_)CU<&c`Q^CV(8JjJq
ze7O>MiM6Y@QtsM>hUqDiSF^9y_mOd%MyH+#J`*h;`$EExyPOY<lq<P3rWr!M4XjEb
zeZ8=3l!c2Of4oS?U*hE5l1syh!XYPQ%Y#=VLXnJF)hgrDc!XK1ZkNcmHoTtQTxB-m
zbP2gXUDlwir-<w{lC|57H^RwaSz{c%lq#IJI%g$prm5|73O${UlNC`^VZ)9Sj1(@?
zf6drs%#5fP5~a9X^q$<jOxRTT$*q?7<Zq(~(U+Qf80R}lMqO;K7{IeYRB;s@{1PgY
z$gX9D3TQrD3Tf{SCgtw5Pfu1fNK0O9&L>lGSyr@?4wg4Tt`o}|a1~#;CBa3mUS2Mx
z4H!&j94{9bt+6XowaRv+oYzcMmvaE^7$}&;>=>iY;JC{NzPR_<$b;>0F%64Mu_v!H
zzzyF;8xn$&gdY56qwXDw>J?v%ES+!nEgmF;SNu}5AZs20#6vwyc7$orIlXKaot<_r
z_@KXpAwAwO@mnc2_%_tc@<dg@l3H&>ak8mc-k^*{_@1x{#t%>Wiy7MD#q&AzmU~&&
z=ke$rMYi6Q6ujvKH=_^S4LY&Bytp`PNUDNpp7gIL>CX#;K{xudEYB^T!EnSVJh|Gy
z_JH&Uq>+4>jxuzxqYMRcU-E0?;-}aP<-+Bz$-q$pB<t0U4dEbw0)~~G<zf_r*=ae;
zG;{;a4KtvRZ*r4D7t;pgup}mDd==xo`10XpXt<qXPTX{2u&oJA$kRwLl_Bj5YCdFJ
zcs#gud4kzt&A3Jx$N8t+CKPU!(k!GL?w|hF5XW=;VUr~@Iy&v3D`QMSHAh4g&ohim
zKDos<b0^2G?&#~7@?%!=1(Kmf{1u>)t7Oo%$>ZhuB)h>VB=DmqLB!1g9F5{$UV{Q#
zPG!sv{jFz598Rl#rpBb5*5T!O`{Ku_d2s;@eKbhsWJ|gowddp)CQyKxfO{F-z_h3n
za);Grr&TvVjw?yqx6LOh<rd%=3>KPIfwvjWsOEDFPbbc`n1}h0z}E059R*v>{Rw-9
zmpVq>DV&OJ43VjkUgI8d4IatptP^qp*^MF({5O=;o$<l<Niy{_pJlW3D#biydj4Y}
ztYK|3K0`MN5e`?$gdFQRXEM4HFUZe6hZBLo2z6%a0L$Rb4WdVF4@1{W0(aIa2+T-;
zeM~@bDkBjv`vGR3&C0;WM#@S=&5|2DexmN@nhhNJAVYfse4WB;bl=6ZSqPY~lkZY;
zGmkbYyzSdiLc#a%Ba=3*Rxp#)SVgjXp@a}sd|R;-%m@)Sq4bg>*a8J%!8!3!aQ3fK
zw8z%1MtGdg7?GrmOJK(+sOoigGvNf^Oq20m>v3?x3FBFU{o<=YGO+jyMB+V*T$b{5
zHbn}qlpE@4DXhqJi=pRfF|ZL`kJ7r*ON>;=YAqgHGO&3h7>r!7eouWCEhL)~WCH!_
zGm>avPMl#xxx*v}Fzyv4kinyHA<?)B&0+!?IK=~FyF!JeMZS)uQQ|5Sr$xKKG-z*y
zi-*dtZv&lVbdlf3T?|eU#ZxQc5ix-{z~HJ;q^}E^tbrw&fQI{8dNycd_qEHMgoE+4
z;XF36J>{eXj|q<{b|l3yG6XU1Ew&eNcMhRu&Qe@)gyOo3P?1`T`{AW*$nwRUA5rE4
z*9!Dpx7m#`Y0x|&?-pvy<+loZZx}|nAl|0~GOkG6eXSl$XkVQjbF&QTey(wzocjbC
zF^}1xrEgM0%E^))CkSz#_4!%fE2r7&tT3^-;T~!%%C;5DdAw?|=?4^yj7ew~G9Eke
zoqlp~0;Ym99^||dr!!p|Q)9=AwdAHq!SH&V!;yv5(xlCr;$suz+XO$xieY_NFd4}4
zhykJMAA1Lp_;|v_2STd03ywFLF>H*TivW{q_-5d6UIoX|z3-p$$2@A{F+@5+SRQLA
z_9NFGaU_VzvuBfYwF^{GhMr6!^L&uR>p+KT;&jR&R!Scxv)bK`UK#Uul#(dR5^Y>(
z$R|-(8u`bPHdqKcrsdr;iOmcxR77SsK*FHhn-(YLje;`?l+hRLm#A3_6EUT4R1Tcx
zt8<6JNdtJ4_~OX4C*rGg6|;%L^>PGXb%mxT*;sM|OKfgadIlf^&(_BW6to8=yMZu_
z76BOV5qVT}A4z?;5sM`#P-CIJH|g6#su=v22kr)-duvC?FY6_Iuoc7yQrcG6g<21t
zNNEqb@tFCI-lJ~nDz}O|V2^w;<5J>R<JF|Ohc75=fOQ1{KtmrM#z3CfEG=bl`$Wul
zXY9xO7D{l)gf~xUvKaRgqN{qh^CV{$M7X1zvl<EuMf9c<VJ9cYKvex8Z@>w!4P_<>
z;{=$6$Gm`Uf<KtVZ8SvB2w)w2!^Svg-k4aem`30n=$kaZW^oCwKBf}H9NCO9-9BtG
zLY_o|q;tQJt50GBaY|_5G{>n#C-c*su9>0R;h73)Qh~JV;+;bYo{{S1gQ@Yz>d^y}
zZJ1hOK@<i6sT(9gDLy0*Y?pWHK~(dbb`yeX*}Ay~UzpTvaZYJMVq>qZA|)d};^j(Y
zO(@Nu8fa6hM{FXYMl`6KN#*F|s}#>xPPI8P-c2mjfxUSAg$Y{R#gr#q&Ug}SJq5UN
zGK3Y2Q8Ka!i*-iv`=t1qGo;{aNxx?@YOy44(R<ig^de1aT&&LdR<OF`ehO=esmmrL
zPC)sA2oxn@5DFAIgB>FOP-Hd-Ix4cqQMbwz2S&877^(H1tbQqHc_{Clq`ZrB9c131
zn-f2qa&@90>%%l-B4SKwKHU}1JrougEoY9SYy(R&;aNg4Fe_?ef60nSrkhY*e&rpG
zG8_@$m-a)WmXgxdO9fg`>ft-I{lR5H1KK71VD+G4klV-+N-LUhR$)mCD!%?LZE*Ib
ziYD9zUDAe%&R2pdwIO9N_&4kXuei4tv=f}T6%dLMZ<1Q7<~`#yxuvCltbOP{?T1U#
z3OzQkB0Ex1nAgHKEelssnrCfG%Mz(%L~=%jKT^jfv-G-l&?vc{<hUbq7a_&)eBj5o
zgWGgCN3kj_HBq{RzZ*i7V@}=aK&9dAaLQSLNkB^JUg-@sLN(?7jX6UQ=l)epFKMTU
ze|QYoW3q*Tq$);fnw4xpI6m%T`-@Vf5u1XRTeMk@ZK7WsZ23|?rt2zzaq$ws?kRpe
zbuN+Q0mSwLS2kXVn9|%0tX+Bg*G&RRyjTy4=)Z0d_j8&3bTK2;i(H$xeY7ItWQ<V6
z_#E!3!AL_iY_d#!3AUDD90Z`WZpIkGVnwy0*o$FS`7RRzZ>aj)ZCpWqB&3MrSZS6H
z_?0_1WG@Waq}`ITv$`?d;m<OvVncRR0z|u(J#aE1dkK@BLqq_~=Rj;9vPCWq0L16>
zzB-Bf#w2mTOm31I&D~#YIgk*V=HZN7x)hZ~AVSQ_I=WDpB+zP?3QNI>4xVH1AST(-
zn?ZPMXAN`#%6Sg_L1_%GQ9R8l-$P*x(blSQ2cqz3YfsAYU+w}6vKb*`C2uhtvXNP&
zK{`-2$zVg2y%^T3)LvnX)UQdk<}9m3PR%BWpl6{lF78MAFU1uo+E15uW;Lkn_~Ki-
z8fcuq{6a@rnGjNtUC*)!9{~!#Y8VmREcXU0pP$U?I{bSNxF2Q;g-=AD(obNnL3J<#
zxdxjhUIt5%Ly=d|kNnzco=IHVT;*7nyLIfHcs{Oak3ZjD(#K$7C5D&=!u&63gAh+7
zALgh9PyDDr?6=!XSX~k2@h}<PHllPJ=C3(G>E_RF@Ip!6CnM8Q4mVFup}2txh*9~8
z*Ls;D)?m5V&TCYY|2IwJzh(9~(H+X4U7Bt>9w&n|p3|5_Y{D{xWVjfy&fS|Qtc*`k
z<k2qfgl-owCN*66D>O*qO|wJ*{*=3UQX&J+8DvT_dYp+z@}t}&n@kKz%ZHfdw?GxZ
z0+VzH1%^YE_Z073FKKsyMSl`?+JD2__pe*E-JQL!H^2S5UiWw&w=`mDJTPTe$bz9W
zOxw(IYREIq#^ie@H1>)Fgod)wj=aUwPe}XiqpyG!K?S1P5RUyT05sga#mLwZ^5#c;
z6j2cfjrOy#<VOzBQIt?L+)XLIcknK91A>2^ImsM8|M1=IWi3&$h(L`JR34(<QS6NA
zIH7-om`E<vyN%!>YMxu~Q^q5;x+g6fjsUGh#8c%Z+?<nu9?ikIH_8N{sa!M1qy~L#
zME}C#R^nI$TfiVXFE1~SPG6tU^2GoW`Fsml5==@erXVctXBj__hMLDXW}1gKx8i&n
zH3^V%_tfMyeCuWkH+jMJflVE59{D*8xN|3k0lQ0tvKM%QVL???eR;xyl&=D~hWknS
zKI!u0@JItHdl~1i@%Kw&9A-6YPqExO;a0UqQ6SSgIYQ?piq=_h6aqS!O+ZvNgB!uz
zj+p$=og+Ig@(hHcI2tB5c1WAVVdsyXC+^GLZQ`QPq)3Blvl<GW5R#PQD`5w$@ng<u
z#%4aFkxL&D(>c-PwZ=bQ?wW|B(qH2~==gbw9~1at|An^9Xi_7010wI12)|yU_onO@
zErv02DzrpdlMS(lR}Nr^K{8C>zJ5<y>Z@5iM%1xgu}XVP3js`bv&kr(B=Dz;Mo3D-
z%x9?dyT~HU+XT>gi?_MmzruiYH!F6~C?p%vbd;cc<O<&U?2T!QMqmPl;IFDlJlc*<
zd+$>woRq7glOYZ#rzgklla^cE_gNMo#*wnH1MXK61a&(X&5Kr->lcFp1x{6=#FtLP
z-SQe2+auV5BYDPfbk3=(d3271)W3VE=Zj3PA1WL2WfHu7Mnt8`fUOqPvXq8@s=<bh
zfrnuv%63T<`xm*8O=F2?EG|{clCb2fq-aU$prGRMh63TH6y?>*#wCL|p=7adgA*U8
zBT{|q)j*InLhC)ulYy3Q+mt~Ah1X28tJi>Yh)6ZW&C@Lu_tQ}t&kNLbJWA)cbg!7Z
z#T`6dGU&H7n~=S&UU{qmJ7imDa~ff77V!uhGE*RX)dA`NQ?xl@D*$Za@c5Dx3D2AD
z<I^8n=Rp-oJi3W*bM^nXaXSrCQ^UKM!wlnjBLtA-OrN(WoaZB!6NsZ6prN1|iFxY&
zbi5doG!X3@2tkvUjWIQ?CxSwu8fyKZKOhfb%y9e!TzEkCKJ~&NyV0~8{Hja!I5~|a
zzv<!A0v~S6m(5YjWg<>_<C$|4+Yi$Uw+wH@<aK%LS`K<JQNe$8ML!JpeA!qdRyN|C
zX;Kmu@W8p0uu3G4Wy8%(%`~@Fl%&OR`N?vWz?m_aV<O7fIwrP5t1xg(<0~jztNT(T
zo?bfXVt=b94#l8vV15`%4=mZp2<MU`#ap!#Oo%4S>Lffas4*i;ZoH=qkQ7497fCHk
zS?Lpx_%gg4|NNqA_@Q9tCJXI~joz`cy-Uu*K=v%2-J#g(CbuM?H8XWYD`lFHIvPlp
znG$Wderl`!a>CHh98vUMRURAff6HdGn3)GiTRDu88!~QCIIHLjws6y}qbq0NZJ>&M
zsy5`y(2j_`p0DB%V<_2f1~oKmRzV()ap8j?*?LmEV<?Drp?PM_90IeQ$bIF_n3xxL
z)<tCl&01p0HzxyL&h{{{7$jOKEmv71>ag)k0rQEjD`Qp{BEo4KJPxlsko}-xh<LBK
zSD?%2sc#0+?98_1VOIzSYR#JhtC%s(j&vK{wzI{QLmXz)gl{X$`w>>n`KFgtPP%o*
zR&(q4w291!crtQ-qbweXjR!VHR0ZB-F~wJ%%>e@=*+ZBY=CC011eMUGA7imvkS<sU
zqxN$EPsnRtI|hEZRC$4eUAbP{QHQCrKG7RDLdNhc)pE{h?`vAnJQ9;Q{CkraJ_7Cs
zfMnRPD-Q0>bk<l~K>3+LP7QBtS2Uj+6tkKc$3TTl=MA#wX^@i)-fWU_8CDWd{G{(H
z4GAWV{5DA8xVA>~4A?No;z%IKN1seg@S_$Lc#WGY*>n6uMh5f(Kgj)lO|rX==pW1&
z=Gk-$ujfR9>KX*k>QJ=j=!<9`ffuf<ej=gM)pwITdidscl&GUPcP?KXiF8P30GHLh
zAxZ8-EGm$S084C%0RU@-iQM)f4F>T{ZO1W16LGV|j3S(Eu2@}5|KQbz*~~b(AYBM0
zb-cYrej6PxVsY=v>kZc3kiWtx>%mSDd&VMQA~GEjxNB0vK2OAKtA!O=giYbdIW|IS
zNp_7dF`E6u(`{`6x9oa8pXQGrKD>f;TlBVJ!yb~ir~I4d`69_5e*5o#`3tQi(WU4T
zVHWSqtVS7bEDa;~t%aMdEf<^GpbLaD*xpfaFRyXez-yP<>dI>G2ik}Mh4aQ7!1ps3
zsukZSBVW$fY;~Wvk6Yc=4{%j>eu1Ayr*LP!ZniIeDHc3z9v^p~wVt1zqm4tWb@q!s
z<Yaa9%%Khhh^(*P%1JTzMO@NV;t2-C8d|s=b$WC!kOC$XX^fwOW4%E<IIt@jT4uAx
z>ovD!_STW8;f2lh>QN6s^qoiV-#D;z2)9K|&*ciBGqTl#&-P&yYY!3r{(P+ye*CvV
zGE65))IRNAygY9;k2<Ks=$>4@igx$@5_)}l*2OQ;PQ^>k@U#2H7gIj}z#67mm%rz4
z%Kg0EHzmiw9ewc1^P_MrLKe+=HctBmqYkIO$n?T3(5+(2X48FhctUdmR8(FEzGfa;
zVK&_s=;PzyLy8H{-S9Ev>r|q8+6}f!v;lF6`82+nxI=^+b!%6u<PEvM(Be`$CK(RD
zCOUbZC!-+^k%qMCG=&es%c3rXDM`Dcl8tQpR3uz%NKLC4Hi%`13ZpcRX|rA=WYOF~
z6;fcQQVbq~^$I4j_=t{}KRWTJ4GyXi8jg;X2h&-9Fwix}^J|~-p?n34UE@dNTT82m
zVL<yxH$^sHsG%C^Lw5{O1+04JZEu~;xKvuaX(UxnTTq#V$K!aCP8Xxtb$ZDcy)EM`
zQq*Be)=!L8<E>2{XCS;cn(xi82WSZRX7}5-g8uT!6o`uXuqLk>YRW9XVb~kAf`jf?
zqrpZaGWj9tpmt%8x{49f`6w~<oI<c0htoxK2xujp-`c1L_@~>4i2}?@d9=vqZNMzT
z7|6gNYSzK*7UEvMj#C!4(~VG>97?>Sc6aC#P7cK}mWmKJ(7evho#NapGK?1_So4o6
z($&{QxUup5lqEs@vXtZ^+;zzC$H%L9Q`PR3aBDhvThMv>)fSVrE0$A3J9GE6=S!Ba
zkk*SYU9>w?YNoh&git5s)HKhKctt9I<Yi9URCyeV(`K~3R^7u$3QZkK3Clg1ls@!D
zSNc?BKt%)#ixf(5zEVR-%c(-J^-`L9HyOf1;0_C!H2E5ceklT+6AEcX7x*RA1J?M@
zMKZg^aAew#s40Ve1?;W}dd>jd^=ljcFvu{KZ8(rcF2(!`1&zezY?1LpV8c8&oHCp?
zqMd@Utqs^JjYsJ7K~i~=Mo=2v1!htaE}B&f4ohTsV8nJx=e18g#@AdCW|T3@=G6x6
zbs`8&czY_uVcMvm#|9r|oOl7L3Ua;S6C~0&3Z=y{h)`Ij_X!tzthdokav#ncllVll
zaF9kca}=v2_jCqD(;hv8V6<yP1gt3hG(f4Yj%4v1c4YL}hU36t>rw#}4%4dzdZ(|-
zF}88xC|Be<2e|ucunpH;U|bfCk`L*;wrjvf_oE{_!64v(kTXEDg65h^dGk{%D)bi#
zUip_6Q>T-woYe`e5)=WHE(1`KqlL=Uf;&hXQ#>ti1ved%)Wpps>$=35i-CtiK(`a1
zSuL=JhD{N|RY4aI1}SU(N(+S_%Y4k;9OwSkhKnA$*xoiA$GQqMV6i~C-Kq-{FpIMQ
zYN3c1{xm7y^V%j0q-yu(lE=H@(w_~&7Mt}N5piifm?CoNp*SQvLkIra3VNkbdL9%r
zB$ok$VZyBXuZC`Z2lLgT=OyW0GMhEjb-w7TUIFFBSd88UMNtS2%*G%eRIAqmBucs3
zy?drwAE~mD|2|A>k^2-(BC>t{lmUO>Rb{veZ&Kw(1#!}b*`*pR_2aKbi#nOYiV+HS
zoeUmFU*(myWl@m>@JEUl7)ji5QpI4jE3WBJoq&nr1nk4I!L7L9Ey&T$xb$WfdbIkQ
zJuv6oV-t2)LS_YSs3fP&w3b}?yZg@6vT4Q4m?}V%Br<Da({xX-qNFdQei1`B>LDZP
zRw3VGz3@rvE5tM*F1;~|NSMouE(%#}V-*9XE|IiQOc03ouyj9mKkI({hTYf+tJXX(
zE)zEa4J62s)36<~A;QY1!&}l1#qV@QT_T11l&BE#oK1AR0yA@wK+k00V;rNE5PY2&
zJA<OJ8wV~MCo!ix9J<O@$Ld{x0Id(=83M+r5nW3_34h3vxI?3|VmqvAkSkn9jaNGW
zC#=;?!qAE|+9;jRM@ey|mMWcgl!*0*kY8tu(ZGb}v{w1BF&uUy(S4C^HL^7u8+6z8
zOf%s?oYiN0D(Offf!vzysKLmLaSwG;=jC>N?NkNrAM5t;gm{P2ZK+Gc#Fu!2dunAP
z!(!VuN4X^ad}Ln@Lu>m$q&o%#xJ&-S1B%^vM|$3iS*?S9Qc-hruU@>*t4?3Ni2uq4
z&}zt1ysCV4{IBXdT!pX5zSc)rrOi;~!=1LntctBoRDtK5P}nOk5Q{6?)4gpEOIX2d
zC@Rn8kfD;=!9O(81{)eVLPxhLj!KDe-^*rnvaGucz<wcuY&Bq@*Fy!2dz&w-uzXi)
zWrm7aVZ+l5h4=O&5HABNpI&fI%~6VWaj*!k8w?_53PpJ0<h4T($UXa@C3fZd#5W-d
z!i*zF5_R~vn+~jW{cfh`D}+kcGvy%qzagveV)lq}_TH|Fkp!qBq;T7i-oh2n8566k
zOk$AujvyuGXu0Q%PnhB$j*=11bol~DCAr#Ci6-s>0L)b~=Y7x}`Kp2p@uW}9!2kzz
z5vQY)49Yb6w&5iP;`TKlxP^KnQ)WpJIuWK~4#76^aXPmOc|6Ov$kNV@1r2XPu{LW+
zqWAI4o*!QT7!oml5^+`tsjqq?2b&hx=%?jkx}SU{k`uw4yyNq-4BoTi$wz5F3F=R(
zMZG(3KiLmt#bK<H(Ee(M6qaS~ymb(m(SNAqClenE#+4Fd3!bHLPh_)qX37C|imz6)
z#E6rt>Qkw6{Ahz55vsVe1sRj+y{LP!dw#x{1l6(}xpbbX+epBn<c29lJ|Kn5<nDO;
zvp|K5ciWW%_o#&e`o);i1-};G>a~n+D|{RJ^-!v16zrp7)pbo0d4Gc(OepS=0yN1}
znk`C!V4CtV_%hGKUxP<sO<Gv&!YmEOm?u-?R^Rn=8&%I;0AF55YjuK<YJN!TLcutX
zUCUf{e!WSI7nS9&osb#>a%r1|?WwHEfp3U|g^=Pipdfo&aK396SP(iG&=B|JGPJ(q
z6gvFbNVKjb!8d`k{#9sEW*8h`kLJ^CBHM}5fN<QTO1|5Hw{n?5)@5|&l=^b1;f`C-
zr7CJ(w5DI&Xh^>l=pnrS^x3oH)5GsuM|hyW@ZmU+Pt$E6NFBVy<*5K=oTo<~+@0@v
zC|=(M6BITA)0~?sa95W40rLI?j|e;s1%wjRk$9Vo6cA$kFeYp#9E&G`gONFqz23t$
z#LEa+6d+^vUg(u^<oVjyw~ImV;Cj+%a@>QSp8`vRaH@S#yRO+RhT$HQX@$0>iV|jn
z*oV{!xr56h=BN}T!^Hi54>TSw4KLFK+D|!4cIurit1&c(Wql!9$s)b-`~U+Mc&P`c
z<aK^${uY~AhrRvh;H>Br{UaHxKbVGq(ZC-(!)J%H)ixJ@a1Wn}dvLB0a<|l|D*h6z
zi8(zBb%g|qy0iwuy#stK6Y!Mjkrm<-!lFKN;;C~&p(72YRM-$+OtWe1YDq3wxrSRq
zwxcSeoCflBNmd*BnNre_`vbW$_?*k8>t*4zKs5Mv)XA_OQ8ZUsv8EtR%o<pVy0lb?
zBwe;ACN4#-UoS;mFv>hjZxaKCOBO3O3LW`6b}(4<{fG!!8_5%mS*1L1Two+?sl+0x
zS3BT`_ScUgLHV~UnaDz%d5Kg*<MElu5^DZL29EK^o%y#v{qgzV@gZyDEr13f%OB>m
z{=-2soW)n${m<A3+7EyG?brBs_s`$#xPRf>qn*9IZ~nCV_3qxc-+c4uy+=@P_nW<M
zAN?uX`HW+z{49`ei=sa*dT?A8OUkWy|1bJ^$U!2S%o2?$$Y;bbfWCvV<_^1Hcg-Qt
zZqd8sHhL)5rjm4loDoSO@8rRpC0iyZgXJi{;7bAk50G&L*966(h`b&-4jb9JQKLw4
z1L~dVeFP)Or<meIeGJL3gmQ5vM!DC}v{LM9N?Pumb^bD}jHH9(?7gs|#EMg@nZaO2
z8QG9^zfML|9d2oq6iPdr-p<mi>v@Ft@!rnfj;3Tgj(fl_v?mk{1QYjAG1Q?G8aAmj
zs5J9_#5znU(JPB57c-e>FP+3QG8!1?lF2SJ@kFqdaW)_)TWq5t;?CJPol8DoPV{0d
z$4yLf%d<!@?PUH~#ub&uMiJ0uP^j(XRHU5JftR*N`Y*F2aH9e@(9oE-Bv3O1q|>n&
z6WCE<`n*w`jycSDa468FvnV<gx#vTp(NV~tK4~<L%nv_<tiLc2ffXMbm)9|pOKCjH
z?dlu9V|OBEekV>iC(5<}qhdhPuuYUY5g%iWdWtEAZDg~Y2qUrXFl$Y`NQT0gjH0%T
zGo}z=dFGhXX$EJ0pgKx)a?OVG8w3FdsEB3|_id<~BFN1UrX~zsdG4Hqi<j+A)H!{A
z@w$25is1X%`RNbsqt;RM>_>RniVjcDemrl#czF@MJUu>Yop++<$q_s~xj1h>ySzAs
z2OG@})TF$N_^x^KW7PWV*?FteiB8X>_Nz0Xs*WP);JkTq(Qb9%e4QK~Um}Ush@g$=
z<n$ssZodLz>nOT7ZD7CTy<Vyroj#9VwayP;!q4Wj_Aw>)gD#)9FHW$#=g?m>I%}R^
zv=1+jo9EHl<@woZhg!q=9kn}$$IbSu*3mYM0s4)|fi>#9Y#tvMrhEGOq;-xH@aFoA
z+B$AGpB=ZjJDBZJ`@D5{fzz_z4q*{tkjIUvbJjX+<CoT7TQH;M`Hu}~meA1YNvHLn
zmrxGgM@P+9%@;7o+KSbI9Xh-`Z@t2SpFYQSI+xEn7wwD7i&pgF^z?|9z0*4Xp?%ou
z>_^9^9a^}{POAZ(Tr{zJYz0;gUc>iimz_4QA1(UH1+XTUXBU`o7WVu#tPrdL2E#a_
zwLU$eIm2R|p8tsL;$qNNG@{opTkstA{6waAao)t`=)eLVUbrQpS6I&rXR^^r>&0>V
zMeF3Sg>O%>q1WwBtInI(?qHcVcmBEwJzwJVY13eA{MCWw25oKBejYWCerV(1xiGc{
zAkk?H_`uW7<>5<Nea?^Y#lNvhc@jy!-|g!S`|Jri&Tn5ob)Im98~<58AHc1Q&*0$@
zzD6%Gtk+TN`FZmN39#t|1Ma@g1{4GV?l8WIe@ZwrnkUqyOKpL!BAAPGPB}j@%PC2n
z`5xul;07Z=umibVl%_1cN0Vuh(f*WlQSQdXL-!gUu}OBs30-iE8h&Ar05TO{boKq<
zdPiv=xWE28;BdvgS{w@j^}I)ak_Mp8{=7w*AU8LARCJaMp#$@LQxlkVFf8i`*d}cC
z`{ed)K5JsynIqE`m9JsVXcMzK4sy)+1LOsN2U>u>FJLm?e%+-=E7uJc*KG2DF-$8@
zj$5UbmH1hd&l1q4LnJAtRC7JFgT{@q*{w`j+(leoG$<iTf$dY%xv3me5c&xQ^&o1D
zV_{)>E<*~%xs%9}Le-h{SYi^02%*P;FuZ^in_{EK(`r(lCD{ttPqiIRKVrx${KE_>
zmw<JHLMr>NeHj1^Y$OnqiTG0PSc~HwljLsp_dpT>;eyHdX08!cG$5NH>&!C~g~8@C
zLe_t7rJEv3pdcCB<tS7zov5cKq?m?W8#IUKCeaut6i8RuZ_bA!$qFflP0c1e;&pT0
zPqOZuhCpcz)#Ec6_ouftF5HOdALlhC&2wtn=4IV<cS!M7hFS#toFe1q{}RBO8?#`Z
zOJ|VRXbywifmDNvFl53YCwK;YP?J*oP9d`k<pW@gN&+vZ2j@Iw!y!f$Igl|#TM=bn
z*{qvWL52C{fxeV}A4v5QymNUM;=P0LYXugf3~WM}^1eD*KL7c*S5j}f8!Va8IL{kQ
zri_uj<a0CH3X3f$6Iu_WSq@1^_T|BDDM%HUR<t4qncL@9YvhE5hLz}HIEh-XfNDDD
zNP#uUUjcIg_Q5w5#*VSjmj|cM{-cYe3=kr}{1V~wWCAP|OpV_G?Q%+jLvFfg5nSVG
zm0>jNl|5*)9u%FqFomC*vtllORZEia^gS2~O$|lTc5?o>YwkP`{CS=?UzZ%V_!7oH
z2c<)fXSa^+`5EJ!)0u~J7f2mWod;$1OC_pS#;y*1vkt*ard8fPSyr^)$C<%xm5h4{
z(QCp*%i`Jt*g%t%J_k7PLd@c4QxQ%fR+FAQX|!+!7NzrahO!~9G-{k+fx2^DUc_L|
zv+`o!2^#SO<#iL(bI<mGjUgJ$>z{dR3MUKLldy}R_*Y-DBejCOwz5%SbtSli&RG>U
zRw@;>4lE`khYSu>MQ?3<FSr=kpowL0B;?BH$+W(0!WzaDCKDwB*VzsG^g0yCED?-N
zflo5&0Br?$V3z!CQ=gbs8GH94cof6Os#i)6u>T;P&2Me=uyI03@{E*2qs*EJ9%6w-
z(<E<S%wd{J-;QZL5Y9u6Mn+^8f29<PaBbXbYfP@O<;g7hd6BX|083vmki=DD%v7*T
zKlq0MBdc-6Lf3%Pt_4wIfOu<;hB__DL0@wN)@GALLX}jWJsq*ed8AhSq?u57>nV0Y
zo8p3{!|=cn9wfnYR;=$U6RBPi)Xf4Ek5Qp5#*>32REQ?RWy{6fvjI!#TK1X9%4#IU
z>nfXtY*xg)o%N%`4(@TUgRQ66^EdpRR2NQC*6X=EllLibxF5&`)*109E^o5#(mKV%
zt5-G3P}$%<1@Mk3w;cPh;f5=?X9k$ft{9MM1897CeVb`SioS@)Um;sGy;zrtIE)6J
z_EYq<<AZ=lTb(MoAO&lrek3FlQH6q|ehW_Hsb0{CYdj=F1-b$QSYDde{!%>P11kfl
zT@r;zZ7T>c45B-4x2cHFH1MM@0{h#D{CW%!&WQbyah{~W(6A$JX;(+!K<F9+-}MJx
zJ@|?V>{d-+ImEUnstzh9<oKA61e{f11W#D$O$Hes^LOc#V|&4iMr3}oAsjFwlMJmi
z3(sM2!RMO{!Cu%+*Eq{Yo`BxAo>JDKQn(3RF>dEg`c?|Tw`~=J0Zx)}`Rlo~P9#Hi
zm(#N`p#fc^9qa7N18v`fKYXH1@0g~`(imy5vc}d^6oKHkgF;6FWvi-{W>d7)El+G7
zr=w7B=4E+>s*qux%}_O_S=uk{<xL!(;GBl?J#^p{$OMTo<w3Bl6n5UvW@6z=)|!2G
zIM&1%%-iC=CnHNG)W|RTy<kdxO6jMOCs4y%?H<VuMy?J|P3f_=qm$$YTNZr~GUOBm
zmnF7z?{WZM;$Kx;8<-+fV>m8{s&UrE=E|Bmc`@0_XtG7|IU*(D5?&R%Buv(k!VW25
z>VO0F*}DSooNUH;evmB)yBRD{I`2|~`Z0oBSO_D?O)L&9oOL;Ff9rhTK09uA(A52}
z$E_b)$8Q_a=7$C$i4XflJb=w6is0bOck=hKbZn&uq%`-S2ceS}V<ujH4%5eiM!gmr
zN;<N6^~hd@MRmKZBD+&yXrhEDQWe{m24E<w4=8Z7NTYz}EPmVCMU3~9F`pkoRwB%P
z2q3J2TTGw`5K1G8l`e<k-aQiK7A3QCa!TCqx*yEw_mic|DRTNap7*bl{L>ng;TG8F
z&?0O-W%z$0=OB=gXjwJ5C-_Ui#R$L<lNDDjYlFc4NwiZh*p}g@2P#>FYAzuxShO}<
zgmI;tU=Lx9b?eSKF7>=q=-ET~9}pDG5`56*fQKJwa&!+QMd~VX$rCPU4r!H0&pRAE
zUL{a1vG*ZJFMaTP|KJ{rB8dWc3h)V*YRD3n-B#}5YnkeuWxa(fO$wL@W`tImD?uY3
zj$Vm~1v;B0`7~pj%Hl1jgtj~Rzd;`?KKO`|CqTlUX3nxiR)i-!HX&+~vO9CEqQpgz
z&wGgNzerG%SMx}kTBV4PtGcl7)2cw7;6nI<Kphz)KXcz~J*5rYtjP@OGMpdc5e}yz
z<7`M<K3GtLMXs~Mm9c63iQ{RQ-W|v&F@Q^mXpKe8n&EEesM9@aA6|4%PP;!ekDXw}
z#RBlQ+wS1+Xm@3yi}TZG(caQxKb*FYx@Q;X(IXdDV}?PJ5aE{L>LUPVQ;A{5R76cI
zVOY0?m$~RMSQ1wcf+TD>>U5R;<LsBvo|jg~7j_L&EBG;xyBs11sf9#ssHS%3;<+$T
zXeG~uK}BAZC9vHnNv7`#=L|PKcsIhL1lS!14e|yQ?3#5I5f4`bPC$C^O-@cqKze+~
ziRt9tZ*#EvrPFgn!Rt%|LAy8+)+6y10vKTZNhKvF+bFN7se4wIy?TntDEXvW=}9ck
z%GK33NUgu-td?m<S5Jd_TO!lqDthi798}1xJ?9-Pa?UzMdnQv~?Oi1vi*0a@Ft*_%
zkq2?kF;uNF8!`$boGLuxI_WWwq0V|ldb7(5)8zXRyb>pv2@6|G+CZuw+?CO!tbvhR
z30s@alK163b6&dAT{qY-eh>yrb!F7y8cxqNkE)*WCHH@~o~;O=Sc8@)@O%X*{wDNi
zFq1)rI5&c)&w~X`bN^FVaK(In8v-oM?jM2xS4`-RxUVpSRk&|0dA>zh2rYt~NIc*W
zS8A7}R8|;$0dOG(Yfc74IT=J|EaDKO;g9aRXsrzNtI*xr6q#KC<ArE+h|Ws5QG)-#
zqW>gVbQ%6z6Ze%3C`kG!9kXSsg@cA0uF(-!5M(1!ToBuMCZ3iKdI`U3g91-y=Ikhz
z2FWZLO1<alWI)f)li@S5I@N}hNyKgf<P|kj-p(4gUk|aXc4vxL!5!3yfdfV>C1<Ke
z7=)B>DsC1Vr@AiW=i`fL9bBCA8Lr)b77k?XdHqwfA)jfU|1UEpOE3D%d5Srl-N-}n
zT&>#it|!AvL<I#CFYFHGD1efP3W&d;Xk9l(X%jU~xcJd+!!c4G_y@mb%`sx807#&C
zO2+ZgI3eW{&>MI|=@=YCPKmy)hMZ9iIzp4_n4{VxTgIAAwAX}Z>ZHA*4y^V{<Jr2i
zWouOSd2>t$tO|-PxV@<ifg)I7YG$Ad*wU44H|Z%&?&S2M^_Z>4)!JxrHM%7~H`a!w
z^JtVHxv|J41t1x-WMiBCo0EzUD0*W|UW*a=g|ShRu|oQvb5;l#MXY;wX>ZQmW$&!8
zMGawm?qEOkzS`nu5U@Q6*)W;*!^ShqZCstUVP;FDXYi#YsUIwr&zETJ|6HW~cgI2o
z*M7!dOmF`T1h@Gq<_D;t>pII?cyG)Ws30zZR#+~)G!aKAw-q+?apcR<rM>cgkiNYX
zm)I!z%LK6Z$|ZlTZXQ1+67*+}^7RXQU6v_d@0CmUuF+-4b^t$SW$`61PN__VfL_=1
z<EU~)x1N3+RjMbn0C%Z76}&W-LtE~HTNP08>~#H?Ly~BG2`b#9@7|9~pdUc~UeR7e
z7T0XxN?pgpO>14osQ;RB2G7Yw7H(a1%*`8t=z^&PGod?+%rYoYnx=0x;f<X86jAxM
zxg8{xk)Qfl0t-UJlRgEp&!_3TMDhxlWU(WRPetLV^2m37JH{c^C?vyC53pL#Q>nf4
zb!v>7;M-s^tvT8QELOKXw;L&I(A#<{PE|Df1~y{yVtWzfCmCm(#Slg`S+!Q~CCGDS
z6Hy#e^hV14i+QJ}^vqT?3uTS<a2aWyBspb@7CkupSV)`w#VkjQU?<_}WPts+kIJ{2
z2j;LmV!pm#1?~=vds&s8pl`h_dpC|}@47=+LiYrCE)QR_%LAH^6umk0ov}Lq&&&4V
z_gFHN8r?K4OHj(O@{qE=%S%|`9Zq6Q(Z`U|v)1DdhZ{WFC2K1!rR(%erj9fL9oda;
z^Jt@REq_@=0d|laC7s(KixyPY&nYc8+KR^$N$f3&s4+C>WKi-;Fbm<v#qt+TpZvNS
znb03yTtg95U^AC^xI03tc4?$w7CwuCOZnh|1B6d8?=0Fnd|80NkQ55@W{i_s9csxr
z3He;mc9nKlGFII)8_X9^&}#!f<pZ(1Un*Fc7zaPr|K{frMfW#ALMfgQc1@foFNg>S
zvNT8hVX$>S{HHglFRFiqj=x`O>HSn%)guD+(y1u{vy8T|sNY4qk0q@Nq89)gwZ-5S
zRhx^@9SyZCmPIp-qj(<gYqlKsMWu^%AC_V6-aXwx5?~x?J!+Pfsdp8lmimXn_%BA6
z;!Z@$3*Yok3J?v}$b<`$k%=C$wT_pPM&5u{T{~|4&?1KaTc@=e!>c7>2*JDChs%fG
zH|yR-B`hA<pRj32)vC&({v8))=hq^Lk&Ow|LEg>Ws6hx&xkuUk9)&~DNkNqgPquwp
z%!jVd?+ILmyT1ffYui=aRq*HYl2ztIp9Ytm^}(`=BoBe>I?(#E5>723dhod}gmu;h
zFte&lI2<3qP$cpHE`%+UYJZL{eW~_u0c#Q+{SI*bve|k0KL^+@^!;|ocIN$`N=B^1
z1?sZ;fbh;hLe+X!FiEVH{dweWw;19UJ-dm`0n*f4{ewz2#|O-x!_ttStK}dry~t4c
zvm>?one5XiK>7-Z7Q%<b9|%Ib!!#KU@?savbK@f0h4bV?>q#_n9RGTIjQ4IwENp+z
zZC*iS@N1MS<@&&QRM69rdsI-eYUq%FZeFO<vUip1Q?L}Kh_G4(Q--keLF!`>)iFqY
z%+~-Zs_QI+Z8Hp~VhCK>vb@(u3*uE?j%5w28^)>*v>bQjF0<<2Iv89=DaiU~J|6{f
zziYq|&;y%MSjOs3D&eIE(KSVP_yhd>>J75eLNMf_?D)jGUX?XD36)z&(_FT9QrkOG
zz6masVDDR_T`%e#xm$5~EiCUU48)i6YRprGSyo{rqoN|TvBue_+kDm8f2pUwbZvV8
zKlt2`zWOFGhUblCW(xav1hOE6X}FWsc+D>TZv-ws!pbVxB0lDy2(;F@RsJO*iyb=t
zH$#;*N9qej&GD?_LHZ$@V^B34IYa`bm{`E19sPpSclv4?XV6$E_oDM@EJH4I9)BR=
z?u`G6TGr9ZnitCyr>2qxDJkyWa9S#)UMwUua#w8UAEv#bq`Zc+hvkpQNc>J=Tk_AY
z$3ZSL?HAP5qd1?x!3b;Fu$I#R+DCPX`~f>*NRXMP!Kqa1gajoQ=dI?e)sj6b=51U^
zJyFatr8F{(IoiyNSOx}9`C4oDW@!Via`^24%V$*t`G9?oJ7ZGPA)6jzsBBz%j^d*W
zOCWB}q9i}(I1~wRyBZ|X^Uy_??sT5UBROqUf?`vfoCB1W-3Hn~%_x=VXMkzpy)*n-
zx=rf%K3x#*T%5Is)r9fTVs8AOjRv`*n@o{K;<dPn=)C?hnPt3~(2ja%3rOBaD7;_F
z``~r@bfZDQ%3&D+TJcBOg0)()h47F~v9W@o+cK5cTALOR=MrH0Gwj(UyU`f1pRiXe
zba9AVDeuoL^;XUp2a4>wjBuf2M`W#ABsJ=#m1a?TO@`Zur22tYXjIw|eFg>Jrz`V3
zst3mWF1hWFlF7k=2Xkd5m_!dH_~dF0TRTv`8W`zqP}z1D)!MHX1$w<yY0AuvXIw@N
zaC0OzzTb%ofL7HEghOm_JY@}sps$P(C3$?4MYC$%7}^jR8N!~6MP|L`-Z-0Z>Z76*
zIvgcfhUXG7Iwp*|PZ{H3)J(nMgFSvgClP-?;@|AWO=rM_q7>kxhZxSC!?r`$SnumP
zEmRcS^+K<4Sp!YqH-aP00lK6NrD~vsk6lAjlMPYV&;(<WgAUWXfZ5?P0o?@u0&OGi
zBzBaIsI;(T){HFz-q1C*PpH;P9wI;sz_U&K$C1Y1$b$4554MsRmiJKCw8u@!i@=?3
zFZ5MNv2Z^ZFXyFq+Z_?74T!2sV%NE3Rws3A2^vCF*qMODTibSF6O9^z==dLs)hmql
z%9tp~oCMYKOyM2A0OWPG?>+(Cx4_&Hn|;*IOWG&mis99qYzZXjws6s2HMjiT@s5n`
z@&tqK*NXcS7z>PY{-Lb%q9L6$55ET>Ld*d0pKd+nK8XQ>hg=lDQHDL9^g#se!S8)1
zatO8HM3OUwZMY5TBw#lQFAB^QKJke<>BqEtHOqj(Da5X$E*z3Ymoj<pk(2ESU9voj
zD<IsHQG+H=*3j|=ug`{#8x8^)#1?4<xvufu!GSXm88lo`$zvO29BzggW7qp;+wK!J
zc0VUBPBR@7_iNV9V-U^8{JIRnJ{hV?@a=%be(6k<fXd*cesHJz{x<gud;EEp3qO5k
zyZbI8SQ>k{zx5QOrxb#GxT2q;UR7!ow5pU-oFK}bTj)?ikuIOhzxS`8xnC{hIGXAQ
z2c;YMUSA+~r?C>dAl!04o@Cs@5+7neVmPo*WZj1ZmK_PK?oyC@fd}%p!kt2u4|0O)
zv=L{M@boH5aQ14|0=l&-*Ae#Qs?Zf~>s>n0ZQ|%@qy+J<Am6#b9mMY`b6qZ9Wx2^p
z#U0B{T$JDmLih^FZG0w2oJp40VR2?y@3)THPqcoyV{wZ&KgxMU0<*5L*G(;s#4fa2
zMOu2Y9S3pXLyv;-2F<m2yoThor9#r>Uzf<2OOVIyH=^AF;F*QV@!G@VT9RxpX;NxX
zvz6yR1msmh;20B}Ek@)CCYjDLaykbJBJ`e)$8ZYJkLnh^ymB-vh6)r|5cw6!U#f9t
z=V+EcS&Vy7AESS0U_CPc&fnu4n^!b|yD05{TJuo-<e#cnr$?8^ttAS6vo~MzqVO7V
zdfS3C07CswzK`b$2wJ)uM#PSGNhl*j7dLS~G(HoOTFv+`QX;*0K2OHexfQ}w_6L#u
zy^m*Uw#e-+q~yT1epFz`8_?f0T!*S1E4ftgZ669WW}I(P%Dt&E@T(oFRtHG1$nK)#
zgQ?-!wjF{vOo{NImk=TzE(sfy`D!l2;~%E!EXjS5C8emxc<<;C`Pji%n^BuH;{sI2
zGXM>Q0^5qn3S#!VX9;8)NCo1w=S5HlK*&Y|j(19g9(tByuuohv70%8$li_%Za!QA?
zTk6-}vw_!WS-fa`ck{}$(`^VGsU=`T95G9*@vjy8uL)bChmlR$LjFw#8j6>7$@-59
z1RcH+d_8|}&wI<W{c{sNP=n61Uo8q+o%e%M$9rJ|5JW=5GcznCa41@z75xy`v_xBG
zQo=v11s<Ua&zK~fQ=-(}-^4~KAlhBx4H(eD22Zf3i&bRf4A1X0n9hQXyp|-hs9yR`
z>uxLma-AhdlYviO?Dok;VNf)%$z09bQaFH{X-Vf++?6y;N~ZbUHYCkIWkYbRpR^x;
zyX%Jh&%)-);TikB)llP^QC5M^I%{u2rheKMpzYHCrY%_O$jbHk$%{^x@uy*+k^(-2
zQJ5$82Dqe6p|+Q|DYSp6O<ONGS&i!rJ#K`=Dpd>*QP!U6i>0x9j%%_>*{HLJdh7c}
zERhdb`dJC+&AM&L^_*D4DeD?j7Ms<i*)rHWBI&|9hMGZ1D>kJ<dymguUd>M=xvoFM
zvi%@F$jQFJDQi~R9of|{+8%w5OsKxR-wMHy3Ufl7csZR$d1f+g^fC+_;~=2J+y01C
zkb4dgjVPJ-w?+1fX*0DeCE?h@w>&aBV8sw2rj(fW1>%EM2MQ^hR+#3ZimXKVaSPpZ
z2kQHGR>kDWD5MP;uFRaY@DVAyIjy$l-lh05ZOVqwpQZB@pvZ79oZp^V7fP&$+T80T
zp2AU|itz;|5~M@{*p4>JI$Mgfo=p-CdSjCPzDp9Q9HSN(IHK*SLpi!`5=n5Hk}f$k
zZXag*7|tCwAXfN|dGZqH2RN~L{4Svc6=Z9IisWb*BUT(F^MniYxzWt3+z@ulo!rFv
z9AgQMGUDzJ&n_vyB&Q%3PB72Y9xp$XfK{J!xHse;^TlY+hi5p-V#>_g<WrT+p1bp_
zNpj9jXtqlSy>~lLjQmdCLW3}6Qiv0zHS~-s!qU{Nn9w%Xj=Je&nAPr?qQGKl^?TZ)
zU`QS%^*<#;@LG)?)wu#NeWsQA=I+i;v=za>`|cR+;LU-6QiXAHKeIe9bfd#rrz5Pb
z{g`^Co-nJUzob^??Z1F#><<?WA7@v!<Kym8>)GXthN-<_Iy(63<3e|Yzw2=L7q)uv
z)%MQttFNM({Dr~S8%}>%5?;bT_-4a)<LsJlnuP-0sD>`3+hoJ8kT1j3T6%+M0vJEt
z3de-H8f85=FbzD!Q9dRc4V!os&kl+|@K`PED>Q9bObD$2>W)WvSgx+Qy5?QU$w(_5
zPl3Xf@F(^X%9Dba>=Xy{g2z%@rZP~W1?Rs*aSI9K$ZpgoCoz51lI^SQs6R>(cH-I9
zdzk2AK3xz1!fEa;hC@=T;BCTtvPr?V09VC1ii)A>T*I>D+#{f$*&O&-Opt;FL&<EM
zyH%T&FlwSuAbUQ%#$%o*8N!B)mqQlWLOzTZG0+RMbc%6imd5hiU)io3iB+0MDU`HN
z$(*~xbeJ`ws<$l6T52io4ZxKho2_3ijJI~i)=(Hh8<tU19Q6_nj|0<4j76mwS=Jkx
z^!KjT$BwYNJx|6pkA_&^^4Rt6_ieDlim*~3vQ_dZXZieSHz<13VHq>%d&^1YYLUni
zxr{}u%P4Wr_uP(cy&j8_hdXvjVHob(XOY#uW1qyd-nGv%zZu%zqCNcYx6@@_)fo?;
zXB-iq>6)*|Xhff9Tm@R&G1SC+!C`l87#GgQI*?Scq&8yZ9Ntw%H|GlOJxPG=v7$HA
z5qmgroFSuQ2pPs0J5sp_PyxmME4Un~x%Xs$lc|^~0qMD5t=EKOJfc#Ah<yr=OD6c)
zbc%Qg2wTE$oTi?;K_!kXE={>BDPg;;m0=Bk(fz@>hHWil9QzM*|0pbouT`tWvt|~Q
zJS|`g>`#;aK?A9-OLr^>(dF$3KfkmUDdVW_=pPgtI9DLwpjpX%;3l~*dCCMpoamnf
z8WgY`!GTP05!|zE+7M?AHmpVJujo|}*z)4Zx6alQGZ7y=M@NcMxHr}8I%9v8y+`5+
z!Gq#61_EO{#+xO8U1^tI4e1BS;tnKYb-=J3r*V{w$PBg|x31u?qMynmvZ`R|1iFQP
zEiD_KaNc(>dKv97>|-f}**aTOT=Oq!j-`<oBE@-wvcMGB$0bvCc4B{Nozi+bOY=|?
zloLL=!BB4OY2ujy*pTc)Aos70s@ohA@*|9|kU+;A+v!}mnB)VjU0!!5RTLp<^jc4?
zTLHIr2Hpu@6VXubSy6ru*zM;<Ixhp9JwXobYNKv@%WJOXfSg}i-=%xcqHSV;2I&CB
zaKm(x=GVrkg77#jSrJrDDPQ{}+Wl6{Hw;#8MBnW08Pz)gw`HOza`LxdM{M@wk8YE8
z>n7nl*rc6PaHc`KwPV}1Z5wZ_nb@{%+qUgwCbpA_ZQHhYzOVk1zxLs->gS;Q<mrR%
z>aM=my4F9(YUYvPo2;beEX^$P7cf*$_Q=b=g0mjjZ05{oD*UqhIqD*PqE<l9$1m5W
zSB_-o+0SYsvX)4<x!;-<3bx9OCG_91o-nj{(VfTgw)~L9wJP_(ALA-Wx)2?UPSj%u
zQF;2Q5s#UVCQn1t?FC=v)HI#(5BE}J5)}cw^EijV-!y^uGl$nKg*`TA*Ueca_?_dm
zr@^l0x}p6)2i*C`#Y3ydY^9I67@_NKPZz)$*3a(wOo_g7^J=LGQmN*tpj+j=9(Dv|
zMizd{W;e_80ZH%jw4>ePrS<baVj>%{eP@vGd}>PND#41r>o>QT2WEbE%>lP<188^q
zs7jTmnO_AhP>FEFbn?H_=Lx>J`8uK#cagxAoY1m*6lOfo6Dnp8@)iA<-4>}-8&wkz
zRl~!o4p*P?BF?*|57!vjEv>6D2CHvgl+x@;k?+i;V*7_6w(2knP+pN6eNsZbecUFa
zpQKg{mmcOra(6X>(T@HF)6xJ_BUVc)<wp|=Jc{F1icV4q{f>gXO+MJO=gPmw>z1dw
zewvvTPJiuR+{|Mz?$c>yo7+aZVaz$mv840Y(=G!L3YSOece!d9*;-TnI~Mi*p6UY7
zeVC4jIL?GSx%ALkPwF!_Sfd_m5p5PaNAg|i2RM)811)ytxd78lw4*mxcq<j@&AtV2
zwChnZzD56dW~SwN>HRi2{xLGK->!jU@sk6T>}Gpo5xQ}_9~VQn(^V8&HKDOnm^t)?
zM>JSKt=XG>S#JL+4gYBmpaO`-+#4g9VO!z+JHnAc5)RV{89AjIcE)ST&c`jAC!v)T
zafNS!ol26L;@*~O3Pa%CqAFi*6&weGix+iG-X#}jv*?3$AUOeo^$--gy-bY<6Bd?E
zNJtQgWg9R8J#0dUK`L4_p-Q<{EG7zi!9;VN(Z&%oKn<{QM`qxnsBEwT*|^5tuvpDS
zFJsBb54KTcOVfO=MD`9mGk-p?H@{^oYu@!Fv=-JuuSKFmM4tT{Jn(N{wUEW@pXi5n
zoh%ip*EWvAaZA<8JFgVsQlbS|z_tf=wX(kx0R4^Lesr%hK+kH91|LL<lWX4{i9Jjs
z#giiq%fu9yav#nKB_WK38sWM~{2OVS{}tk+QK+hz4rg%xC6ZH;(bZ5Dc$MrEZvGi-
zxZc`5AO^@S^L}Z4JQ%WNl&8{-T0F!+xU4G>PPVt%ZT2M}R?RUJ-m-(2S9c|aNbXqE
zrKU7jI;#5jC7Bd<RH8ec55YvASfuhr`D8uz+D|t9KhnP{2#RfSd6OohUQ~>Af&y&K
zKwO0DQ>c+5`%Sc=>d~}Fw=;?aD<XmBST-}4&oo)ZSOE&Ti{H0}i}h^ipITzUENwA>
zQTtd2ImavLTiVz1-oAt#&i!aM@H6>nsM47XS16aOO<JiLC3{;i0bqi!d2xZER8Jv~
zu6@%J49tSe6~+pGgjY~?2X`|z{MEs!nDP$8bCX+hrOIf4K^GTh&45lw86MYApS{B5
zCdY{!#{NwEst~TVQQxX6Qsf32<IIw15^mFq*gu*=BIlvFE&*m7`P+}SJebhw&ku^D
z>2oV`^vb-LQn!@9gqvh<mP~;2)WJW!*mNa|oc)u_{sQI8maQB=z%pe&N%JP+Yqha0
zx(pRNFpI63rIo80D5ef-#`!s`-!RJONMp-oJs;yI5snIdR^p@hQiLP@nzXU{WRPL*
zsk%C#&7vZFKx0+rbjkRaM4l{xLzED-;BG1jq8>-lrZi+)FU*lP9Z!&uyy#}Fq>>vW
zPk0ov3DVGdGZ3v>JqMCF_3cHSb^iBIXjj<955rTJmzKXKEUJo?dpD@O=dnT>gokM)
zBye#hUbbZFu*!BXO)w|5b+zFgSm_l?ny>vH$<f2_ZIc0&;ncYEjIfUgaKako&r+VL
zHnR;o6mPW7ZuC(~f4wVXOVkfnLEukn_pp)jxB*%e=XPl;fek|1ewnc3rPTAD(Ca`+
zpyq#cM1h4KabstYTLW<a2|v^oF+0L`4Q{BuP_|woR6O^n(jH9M`3%K#H}tgt)5Yd}
zgG-}p&_)Y|$moB#ztjjgy{0S~D;}w4KTr1MqsEmL74!2IShY3xk*@D0*dXiMvRRuf
z1kA8QVeOgRhpDE)b3`2Lh#rO5;$e*;ypz$s2|H)i%PP+oTc>uB4Z0Z%(7uJC8Qo-J
zky^uJKM*(X>ZU<vjd{+wir-WirhSJNn1||poW@NHo{5S~*JN*`5&S3_MW3=ayT77+
z@)vg3?RtiLI{dy&M?RzS>UumH-^(`Z+@8BXkFo@>`2!t0w)x)P)&<3R^Bmw(^1!!r
zlpe~&?U*wdQ<JrBzw{pN?NP~pGCLnqHNrJ}2re%#KHitMrml2Jd1O$F73BX~bF}LA
zl7AVm<)ssz*su;awt=EdN9QrvRH4RgkrHP0wv002m&{vW@J9p$W|0#P*Z`jyE>TFt
z!3}<*C4uYZknVs8oYBL{g%5(`Jefsl<b5uBQkU3@*Fer8q$A_U_q1X-^dj|gCboC<
z5!)tV&+vyUmo;4Y@DL?ZVZgA7vSUDIrrYB@X5$kjz8YbxDdXT$<C`dAaR*gk3i<po
zm)Ij1lX)}U^k0>E$Lqoql$9>I0NHir!$t#ucRfikZ@e{JRu%}QO%<Lf>Q@$P!bSrm
zh=bmWXTxzMvv7<*L(tbmhQjKpCw5{JP9+288h(;5hD!}x|06_1`3@_31zv?ID&!vU
zzx=%hQoI~*kk7$Fltw=KL2?Ww+_;2|B7egoEEK>T-M}5fA9|Qkw0i}oBcEI)LYQUE
z)gz2#?++u0;?)!<p8(~^8e9P_s+KzrCt3FNcQb;gY?@J*b6N}8TkwY~U*NOA6Pf!7
z#i%vAd%7BTe2K}(SeRBeB2jZMzre>GSVoC?d})@3S$3mev>K3!>uk8AbAK>W{<z$5
zuUdwhlPhtlW;SADj>yAhm#f{Vl>=B1;O6TVbGrtB+2m_cS%nm=3|WA_lZOrcnml>%
zc&K#oeL?Z%$ZLvQ#}xdPHocBXxw7eWQiq+xKFzommNqhZe{ym6anUGRv-=UdmNT$#
z`mS<rjynwW3HZ?=P+}?_o7}&&GHuQ;Q`R_T`*SXvEi5^7yk4{pZT4BmtsU14z-Fg@
zx<W-k1@S=){x2<}{o?;oi^xS3fHN~Hj@mJzs=v6y?(OHgYO((|TUhkk_j<T0{{B#m
z;Pr*03bm9U0ftudcnUp<jdA|)Az_V)8Pr^e+~vC(cwB!>$<h^dPr(2gYRuhfFC$V{
zpNlzVT$HpFwf_{gG-?35oogssx1OV#!&$f4$6|B!;ezVfJ$O1_+PCsj1v(DDwpRYh
zXG!omGu-E7U=1%+IFE4?P?j@3koNZt&+$CUPbLhN2&1TW@cE>hZHfPi6d@;DOyTYo
z2rBLJysV_R8U<QRc6N8UsH-;Sq5fKsfIO+{wMohPt7Kdga)RXRh#p{jxa2Q914R1q
z{DX8u@#(n%Ne{~ONc{a_1OpIjZiYX@;$5A<^ieKOIm@HOnzPhEE%$S&w2IOWnlPZH
zb+UWV@&wh+j>&;3fzTs!s^f2PoS(4p`JKgC*EZ$AQsM9cTnCFBecxc#duqg82Sz=A
z+J|^cHPl;cvywt9RM|48PmF*WE0;MWh~v(aLE;428v^9G1!BF>W$wa|{lu7<Z5o~%
z`T0W(){U~;awK&iRF}j8Vk6s#{D>hCa5lL2%dFSB|6TZPb{jS={qb#q{@K&=e7VI5
z{`P(TBeE9${uUKL3=oSJ6w}hOx9MO$RcS?<#@8&7T)Y0lmU{2`5MKNK|685HS{~>3
znd0LIt?cYRKDaxaEwnftHbk*QZ57w^;BKW~U{?5y=7cdHkx8Vd5oqYq>@d?f2hKwo
z<}?S?@-AYp3a<R$;$#*e$>nltQr;zNj+IzlBQ%3a3JIt*h|DN6rUfxO5ITKG*-9lb
zJoCwDxyQs;__rgH6seOtib+)H{Q@Y!_`(@PU$|+^{;~YrELAgTe#&39wEGJ9^Vwm*
zsRP=l+KvW&Q2&79sl7){LP(XeiYIHBpQoLNU?4d`s?|KeMy#oL3V+09>z^VhA}Hui
zOeln@3-4P78%mm%$I0iMD_m=*$GO634KVF$NZP909l@rW2Km{n`V*xHLULieqET?`
zDIb0r;gG<)rU*XlcvvZKcJVonFJr00jae|kGc_P4;N1$;M#eO`#R}9TeZrrXV^AvY
z25Jb$3Zu?X-+S*X8?-@@hCGD!3XJ_yi!^;QoR>wIp9%%m!f8HYH0OvAzR6I(ivKbk
z)<K&_l(@BQ1oYyvJc*kv<~wm}(2!$yoX`x953*4T%-(L`I6$Dso5NkjeiKNa*uTnV
z@TCUDRL9>52L?o&ypg%yLx?SQTdK7l1a4SJIMRf!e}d{&Xko=kHU?7LRrUx@w9gvX
zIIKbVb{_&%yu(xi&luB)6t}VG)j9dsLoGa3;t{1YeI}Iv7>6ir)Y~?3qo^1m^^g5u
zKM9a#(AjR?iuN(f)NAO_U%k$-Mpj;Od&f_b%pid-Gg>~4-)I2~I^8qk4_Ll+&Xjcw
zsDr_(6l-l9DL8Ios~qk?B*lE~rLZQV+SOf1)7Jx)(Oql<6|XYjfhpWo2)HPRX)S8n
z?HKssV8Bz$3k!y?k|K#~p$RdZ8iPk8MfTQvLuYaW*rky~AH#zRXTmvLwD(HI*wn+U
zUAXFza|!>*|1sw*3{MF5lsjID)jmM%xjD&CnlDm)M)y8#{9cN*Y}%w$c>3z<Zqi~L
z<6!@^7H-WrV#*%rc<&s`npFaTma?)*CZp~B{>ags;A*0bnw6|H+PUJJext5|k9f5I
zLv<}9XXA&YQ+)sCnoq3>VjDGq0X4u2`@1%1uYJVp+ZMvl@Q!uHc9LlnC7;yH=5P*&
z9CaQ?9tTt@c26ssIQ<uqn5mu<v~~}*-;BX8TY^6<obXizi#~YspOW5HNG0hjc{~(0
z6C0-1XLRf?c?*hFecR#W>@`$E_M(*kvUROk1e_$sh%6@I`xk}d$FuMDH)L5_r5Dz)
z_k}=Ql(N5ZqrZgY<`)oMx4I*|d|u3~c=Eb@=Jy4C-hPup_10}K!cG>uV&{-oOI117
z^;T`Rmq6AUD7a4UOirw$7OWUWV4gDcOo=~fFZYeUBTqLGORb%ydyz^W;3fUt#nbhE
zxhLt1f*j%wt)B~h86@RT0<%ko=mXU%)wq+GSTzvs1h!CsO8R^yA&9ZPRAe$no-@e)
zi$EMM97<yPV7nPQIJlr=jp<+M>h^q@h1f#4-Tm5XDVS$~re5ZNC%fx?)1I$W)RF41
z+z6j|J&56FZ#X6ufGzU+<2oW@m$Kj)#WjxwNs;2aYc9~u*7rIQMT;IjMLtc&*&P4{
z;?EAsCK}XV6N^#W0$wZnEsxdFGn6#0S3Mra{~VcB{|ziNwU?kTn=}eyqSq<UjzzOW
zq1na9e0j3>azOX{haWX?u?!Km%QQ}`zAzuS<JhofSxQX-$|=d5!VMCw5|toe_7`hl
zQ`1+Hm*mn3t8xmDkw?IMVZbmoy|-WSjH|-~KW=OB%r<>BRO*nY-`Ud`6%d?(3}88%
zt4f3Rliv$n$le+S?JghUat)$IeiXJ6FJsFaCaVe|<r1aUZrzZR)h=&(iI4q-R&d0Y
zfIEg{9HigY;(T1_@xuS*H7jt@%&1w%Gh5Wv`*xRjL(+h}MZqp_I%Nih%|`yja{0Fi
zX1F-p9!`JXAGmshuDj_=w~%e%4(-6d`|@3lqJ;vp8*k4el%S;%;mXHD>UL7!&{X$^
zQ6WmJ&pw;Ym(0*u(b6r3R0T=Zfqz_a)h#ttmq}&n7|7fdtdr%6q!XI)PV3w?(`4Ug
zD)%o@vvGUAI?LFe<1<zTuly`CTFdvt1A1W=AMSXCaf4KY0^Cs9?nM8Jf9c{Bc`^v}
zH1h}pL&zw%>`Ru1!X)PeQRL0(ZJ#8UEiDS`rUe@(P@x#P>QPDP9IN?sewxUUof8P|
z*a}ksO&x3}A@=(GYC&>O@+ZaJ-3=OY3)AvXj^M)zMRO$Hr;}grLM|{itF=3yNu0BF
zI2i$%W|#|SH8I6(0En~9-kOy5>{bn5tp6uYi6z%{<dE$3NmTqjJk6$q9#*`6T{hOR
zUshRY>y6n-b>VGae#}w%g2<>uQ!ZFlt_ikLB@c2XLhis42yDVVhz5NO{MUI$%hHj+
z{@56j8914QKkIv9x#B+v+4#_8>F#uS?r(AFCcC}WUiPyk<9=OvYd)`Ja%@JpNB{ib
z74IPHy=tatp1e{gi5hcZR5hTs6Dh&mBeWKy9X#!C2<lzkUa;dx^jIy*bjhxdFF^)g
z%uV^KN1t;l5dzCH`CBDts1r7MX9(?{Yos2hLS~(U5{Qo}iF-XOPY73e7MXBLyUo(K
zBC=Ef;8w+bu4ew2En~BN=W@xIC|#EaO(Hgu-Acet>9dPR?RrqOgC3s0`|0D4!3Pd&
zJg}_(#tA72ayd2HSTii&lOY@Lty|En!`2>{Pz9RV{imUzfY7ErmwDMe5qTrD`I3Dy
zCc@){x7aR5p;+ONd_<lzl}w1TG~i@=G!f2yyT+FapG0^}6;PmQALG@e+eab^A9pfh
zhR3-+2w9iT-AvO$GyN#H^U=BaEG5L(^R8t6GH57P7S4mTQ@{u-NS2~P=~?0xyx@?z
zcYGwGvlJYqM<SIa&)MCUuaQqI-W*_++CgH5$XR@M310^^VqRfki+dh2Bw~bvxy3PH
z&5X_TDp~_X5<D)SA3V(I7c1V{w*)C%GTFd^ZiWN^JJSr~hAwFmDuSwA@{CB7)~a8)
z&Z^&UZi`yIG_zH@n7UfZW-~|)tDau65~(tvmnEuff|=F>6}9+Vu##FKY2yS%-hOmc
zM7~|kOCQf!k>`LFlnqt-C+WI3M3G_G)s)ZG*@{+{Qdp&klh^{jZraf5>2j6ML+>*c
z{x00;#}hxfel*I~!j8ZVYWRoCgi==kc+BL=h{^8quf-$Rt}09?n@e2-uA2lrYz4I2
zrkk!hZt$h`Y)^Az2xqCWZ}J0%THPHj%j!7As$xWJ^Gu01mY#+a(j@Se0RrQxl<Xa$
z=*Y3`QDR5QuV~I&`aiKHVmuLh{#e+hv;T&f6L0$?oGA7Q#Qw^DguM%<TzoTafEVsg
zn}fFYf18=P9V^X#A7^dWeb;}#OL)VDNDkKvHcs(g&L^4guU~du+HrP6bzlCMIU%r9
zdUbK>{a$By`ZhxOK%L{4Xl%$)boq6BX7u{H{b~AR1H_p6Zn=4hyZ?@R3I6<c?fD!i
zeMZdM614XGu0Q>M9T#iQAudzVeMnob(#|O8{6OJ<+}GFO!0AU|2arDStL#%qIWfqS
zo6eZ?0do9Y|1hWm!cY|)@W|(w6Pav?3>cWek>^+%n2GBcT&HPBy@Mo&yN#KV7fY;T
zbx=Sf1)x&;KWt^36Usv}fN0gn?jr+H>vVc&s&VqYZca2Fm@NBgj;y2E4v{iB6j5=5
z!V`b<RKerJ@~J=#?OQV=cM6DmbgQGuRLkM1Z`S8w%kC;JAJXN#5sNcLPoNQwJ#kn0
z$DOCwnpm}5L7MU9h>co@y7hrj_$DQ^vF~WhONL>sQ$Qb*5s;*;uep#QXK4GO-BIRl
z7{WDtQH`VewYo6FUyPVLJ9nkOz7mSCvo%LSb7LqZzDjX;aE!fOTT<a#2Oqzi9^2p>
z6|yU6Vs6e~cb()_y-|zDx~}C;a3M~_5~jT(tsh*5K1sd_%w{!q+PTpFhJq_?tx7>1
ze6_i3Pl%+6y!wd@(6>J8Z1<sDTboPlupK>{ecOGl3~R5{9>Q=&fs>6GQ<&o`sEwD;
z)j7wLPA~BV#$}UvZ(=DWM%y2or2?de6)#jdM;1@vc!f0V?H`9kp)Yzuai)rB;YMW9
zFI*b^nlu!S^2lKd0nh#?<Bas_bF9{1lDv*gA7gjCoNU}n(^X~;Gce4;-I#}HH%oG4
znc8p3i|jiZ5_rK4QRqEf3{!d08;fgumjC)lmo<&Ntnd0baN#oen}k-73o!fz<wEN3
zExDQHEySw>^WbHG!uY#kpKNMYc1TQMz}?B3coI8zwt{5Xqm=@I!Y?O+molUtLknDn
zMHXf|4Bn2Q+nSKj<tKf3z%M82%Bl4{p?()o#(XqUpAa`W?5M4T^^ev&QEu+5<j3iu
zZ`6x0P3<--;NiR0^>SOi2tIa<2Sw<)NASd`WABjblrR5$IFB-84R9rqNW&C#MfCe&
zC8ykg!mm%JM!)v`Nf74A+FojQ)j`_@wsWub<qpwnIl_>5Wh<ecFm^?i$ByVz%4y<N
z?{<AW>G&7=D~4bnk%%q85N?D&rZA@NZUosB*Y^?b+Wc7c$a#Byy~g^lxSFf@#R3%x
z+HC&Mu3vO@d+H7y8WD8i{3)KWP=xPT+hR%)s8g`c`e;QLiV<)*WAY#Rur{U%I5n5a
zh8SRr+bQ-Y8bxb?Rc++s-22<ha#UALXmLiW7UDn}w$uGmGoW?my~m6r;~s?qm$H16
zg-Q-ZmHS)fF<L_*BvMrhYK3Ux*ga22+W+1d{3Ngg&crFQLu2ojzpK9lKr&<OVcoDQ
z?Chu#Y7t9P{NRKC6&W;hvEjohZL6|N9<QhZU#A*vpXU~`RdR-L=WGiRo_=t%ws%mv
zNt8WXsv%;RLk@zI&4h)ssz$Gr4L>mMG}7&VrnkCmJ@ZcI;}E!#vN>uQ>V<YAD4|(l
z=by*ui>rizKmqMKSKtmi8RAWXGtQOyr$B_Xzt9>uTMN{cs-Xh>MpI?HMaOcrRfHoM
zH?yc;SE~T3g(PJjV7r$LcfLR{qCM&R&P!22-Ce~qoRxCyJ}>w$t01ZKl;Ci3P9t@K
z%a|yN^vL;4IwHaYaspuq!^GdPm~yU(W-K)vaRQErdhWIW+KxdE^OXC_(hs`!2*o9<
zd?#GahMDV&D!2XAokq%5d_~5>(FnSD`bL30Y1aQe$Ncn-U!x9E<??<gpkQ#|8b2`d
z-52K)Y)al@1rfo$ddOM1ZpdRW8}1ly)1>VJO1c+ne4v3r=LMs}_RfXjknf@Ubl*{{
zIC_pVL^+;CU~9{n=`Y$1GOO>0tPi>Fsww;9t%9JGc;+4vp(dR~!&J!ywr(CI!kvm0
zY@W1Zl|lkwm6ZKAIB0AvJDIF6S9}udcAzz^BZaknxG93si2`bweo(eW$q{Lbmx;4$
z+|3F<qR*yLr^_@E9VSeavqGDc<*ZfwI_u=B+*jU`@8>P`h+jV>vx(i8HU|;yeoyLS
zkKT8|_veT=l}l&CJ{I(uc__3d#Tgh8Gjt=+E}{P6s9lK8#mulD#&gW@%sbRCBl>Ns
zj=RYRDO2mi!9rH7az7}?DcrTk&`?mUk}eIt0WpPsc`Yk<oSc%1RvKQEgN$_=%#jR*
zGAY@uU`g!+&+^a0*Ncab!rj7EU>bjkHsgBc->#%+y$9w3Jbg9OFRvtc0anNBf`R8>
z1vTHITHj&KUx+rJglliSkjo|=Q>Kuq_l56&*IfcHQgykdeYs8s9$->FN<s7*n{0o@
zSr$F$u(a3g#=W^s#9WHS6=|kn|DnMAY_Xj?as4kQiou&Zl>f~29KI0H9tGXTOst|g
z(7CZT$(CFEx%Twr%AdG2bs|+k{BkGSu+HZ<TVbxuV)9~y^4nJ^q_TJ)$&e}mOZeN;
z`|9y>ZSj4`C+pq8cQM@l<eM~f3q23z(=Ww1UGU^y!>=~_`|V_UJNcrg=gajN@$H-N
zwxa&qJJ|SeIp%~T=OcTock@lG=hIJ2(pJsHt5>>i?-g&e6G*3cz~BMwB=+^&Ek(9A
zG5gF0lGeAODRi@9{{5+k2L3%mYDJ+;Uyu;^{q<yd8qn=)d-mvrT<14a+k<!+3D0l!
zDctd8HCGFFQ<KtIRU(`sFHG{VO99Cj&HV*wnkL5f5E~Rvv=<XQ_e@h7uuQ7N?@Moi
za(_w16YDh^PRgqoU4}<0tn>TuFIiab7YPc(kBMzQXPAM1^ROrH&nCWwo0&xiVvXJb
zmGC6m>yeQ@gGc}&lvI_Lkzw9%vRsWqM?N^O@B&7>33+ko+fB;~Yk!_ZIhz!_MCZi9
zH&?N8^m&QBA?}DL4o<>LarXQ#0w1ko_oSJneX91{>9W`TFvL33+XtS@<MLL3&44~H
zHXXs&HeWz<(yHjm7tdACcuU>!{%p@Gw1Ah3$UH`k8IN${MrMCW=}wE@vg}J6V$sB?
zr33Gn@^eA^?<tOg7(TE2RJvUO@82)^4i=5~yGpx3akSPx+0#>DImch$#ceq`$J3kN
zOSZO<GDi4cu#di*h_W&{b_oHeHw&(~v$~`pl~+G0AJ6N0;(8_+JD|w{?6iZS?IC3?
zFUbT(8EcS0N-xKwsOB%{Esvhgh#1#a5q$oKRxRp#9Ev0x|48ZY$}5rU#99;h>Hn%N
zhO7OI)ncsHSPs%6+ZszmT`05frR0+ovVZEsTspc+p_~<wGLrJao?6<-mtrvt1xmon
z<3KknRs3l9{FR>u@-Tbh_oe(^9(%4o-nUxfQt>N<fAJ`X6mh(4duHR@sS|GACSUgM
zYWmD%yTIXb9osxSP*<+W#6!fX32C<d%%g-!kKyOnr>C@OP@I3!5R+wsaWx_n#>o3)
zyo<!UEB-Sxf&RFs7r3Nssqk#f(GR2~hFqhay0s`WQRy&Wu`Ddg0^Wh^nDQHln6aBG
zBYS6uoC9kovHEZdNKdzxDIP|G@As*xo@;?fg1b5izpru5o6pAkLYKFf^Ua(b9ZLNT
ztH&XKVU%?mJ|-r$`}45g=_zKhrGJ@ZD+#vz_#>^JGuF>94+r279h;14Qk1$GPZ6UX
zxaOrEyN!Fv^)dR;*84w|y%MYSep&qpsN2dkju+hyXkz$3;C&o(uOI^+XQ)EpA40#a
z44~o^QRmiK$?7;9s;2-1zs|07vwu5xRe{r5++#`7;l@G5=uu(6^Z|!md>&$+(Rsq?
zoBH;S<1d5ZakXRCG`Jqy)!ff#f{H0_`I)4a>AJzWI|rl4)2cEON0xBqZASXo!Zfaj
zLFEtrMB>r05R8_>7H%a^WcKrEBlRP%xhe3?I8c`J<}YG9mp6BN>;=kNxVDyRDMVbb
zBcOdmV<s;xGTXRj()*XLAJ3B*cZj-{s_>C+Rp(*EY4}8>q*yfu`<M+7x0~aq!?+%3
zg(NJ`5_K_c{lcE6i5x~h>4WpB;$poj@@F3_q5B8i3v?+WU^?(1N;2zon{4k5;863&
z7a6AyO1&851lGCU;|Au7K0HJCrKvj@1QiGMcan1>^aE_A!=O4C!>Fl)B+;^Q*Psqt
zyF$|A<L7Qj{3|eRvI{#yqn~iUoZRT?woI#b7hx$jQ9=R~M&bD}YD%xW``)_>s(H)=
zDke|$t+q%&y0SJFopWR^YM@SNU}S2do5M^hni@K3rOCm2^`aB4bHWL{T8N6Uo;Q_!
zg*SNFXMs@Un${lbss1s!4hN@(T)`#pV2Gm#;3G3gD{y_JT-+<H2+ybDa>tg0umz;+
z`wqeUuC-5psQ;&vFz!d+ChO4QpWO^>m8_IhVS3c1Gsvku3zuuOA=;23i$GcM=SsiT
zoQF-sh&n>}O5V0NiCTOjY-(dE-rBoSB5AsAo>)t}N)IRG-`sE$_fW_WH|Eh+sXH*r
z7Ni;!o@+P$kXNe%$i{wYwi8dtC0dHH6swm{ypO963dVjf0NRim@aca0k4c?A-mD0G
ztupgyB4x6-fYLIHishN1*$S6G+_Ez_Yxe31;gydbKpJFqezS3L<6G}Q233WdwnV6p
z_txQB@UMUi7?H;vqBTq=lXFIOwp%dl*ZW*wr4&~eU6&<R6f#IB>(Q%@Et+tZcJwtW
z0mLI7fq)*q8-ZWBk!C~+zM&T8Dl^@k1K%@m^JaRL)%`$CRCUi_o&d?G{kZN_6H+5T
zR3FqY39luK0Nfksy>^S{35!)8fdahBqHN60RTs!pf>X$VB6WhjE3Lef+AIzk+3Xr6
zqG1_!XLnj6Z8t0G@-)tgO_g>jex$U^!Sly)8m4v$d*!-T5mBZS(PjQna;&+?40=KE
z!wT@eZ7qu03jQdpadbIn<_+;@(Hb!ucD8`#<4ECHdfuTDsL^)3$T!`_dtwG}|3>KW
zUYHb+UxS8fgn}fnm^2Y;c9-jQ0YLWZ9h2tMj~etI&<R|432cq;L~AuL@O?wR0b9?o
z)6J18Dof6Yu{!qHG$YuCa+11DmYjCqi*EM}RgHRG8O1~DT^ZUF+p@l@Te7|*ULKg~
zT1{zJ6uD%li!O{=hrqJ+r#j)K#*N&wb?rb$eM|FX6bkQhGAq1{c8TPSQW)y5sV2cP
z+pcL(lj5pz`X02}gLXsYdT2wNv~*Gf7goCu$*@-oYMc?E=3-h_jicnt7D*W4QMKm3
zrGGtFX_kO%RjE+7xfX3cV)oJZ_`X|RYyElAr0w#(x4msz+6a8}9RE$Dw`;BT_j|%q
zko@!YnC)BJ_PgzUvc=0w{JYMM;PUFz;QKZ1g->~;;`iFK$S<rWaoRTg&v!yw3BOkS
z&t2Dtu+yWT&Uamwt#2t&fj@aIvsk&$+=x908vDcc9Pv9X{@2T%%lqK%Z;%V-X+V(X
z#>rw4&MBSPlv0^mkS2XCrzQU#v0)x=V=NDpPobzRa5d&MTkc^ZY>reRpL&!jM-a*^
zg&ES3SMr^bJr~&24O7l^^g@WV83&i9Tw%4f>DaM}mI8TiSj-XdG|Ga?ZazZcyxI3`
zhz|dd+|>`BA&X@O834$fo=DPQx%gc?18RgShK%_7#VgRmhK)|Xvt{0VViZ16&LK|;
z8x0SJ$sYM^U_(`rVTrPbOum{9`juQ=HZsjfdM5i<fZC3pS0Gl<9<T9=4Y$N+C%8y$
zvZvd!3#9y7K+v}PL<E!p7GWT4mZ$-iQJ3r<w$*bjNsX^s^K&$*XCVMO)NS+WKM8H3
z_pO0aobY|#9bqG7VcW}mrP^W!tKHC0QXU56qVXCc>~<!G&_!Lt*HrpD0AF~{Vf~<s
z5a3|5<I$V=N+KqBl=pnqV@YEtV=lS=W<v!%$#h|w$O6}+bjYDo?Ym2ZM&+rdkX5_v
z2Xa0Fm_o9hsH2G=zlWlP^cn5MpyV?FUbKNomSE3Oys+c5ftV^urGB5_$>)-op)DMw
z3C{F!b)4Z&nr@R!NgmeTNXuVq$VN+VMIPmXqa6H)gn`N3g_U1z>Z0-qe<+<dU-<F`
znLg6}FmAy5&|S88&T?CF33GLGwJ#urcjL=2tmX_dz-O6`#4x6ff~aLDrZMFL3=4xx
zLm;SjlJHh5q`+`UEm(%aor5+e6^=+U?q5np?Tm-CIR~hD7<nSXy*27uW*WilqjpN5
zy5vycxRnPW>J2~VG4mf`uBMzCAmApxI!7@ECT3*9;KVUeOZO7!Q%DxVr9x>SnI-P(
z{kqaSlUDN9ppimH&DAwqms-={{6V_z&s27;y_Nik1j#DdWzRjC-eo?4*=~daru{H&
z5-GGCl^6d)0wDC2dNy-XFoEjab`k#75niZjgM6cyXQW-?NGnpYOq81u%o3mx{(2H}
zU*SHpr|Rrk$(T#LsY?2dmz<)RB<aHJ4Qf-MdHUsdxpC}Cagpofu@AXaDcDsb)fJkX
z_PI!(dW0x<IJ&{sG;c3V;mu0V8v_UVq*y8{H^^0LJ$hgt07(tRk49fF!{#smv9-TK
zKe;TQ<(!?+_cuTrZ;cpS9yg-2uBX(wXjvmyR(6HPm9DM5ziJv+fWs+irL*5Y-Gspz
z*zx7YfTu+Xyyr8MrJuA)AmYzJ9*RJQ?%w#}eXy|S%5JTCfc5(fH-|f3PONl$5BbVJ
zNXp<e`@=na{c~vWpmOA;TPEdpVvF?({=cY!ZLJYz)JrkKx%aC!^%*W0Qt^Bw#lRn3
z^cyU(IP4=vN6{93T~Ss7w3BU}Ie9$0e#r6V8~G&4%KC^TAV$qpg??1C9~=@#91*eX
z?xwPXa7msb64Ii{cU;5h!ZEPbt=$w4!m8;Me80T@b?pQuS(}Lz4011&NmWX4k2sxX
zitun3*EDX0drAo|kzGjxAIz#y3=e0%BMJqzKLq{ik_jI?T)5G#1ZUO^P3%?5LtTs#
zYb#E!wR(HW!eS!aa7En37)ULT+Zc<gmvW?AF#e+=35mZg`HAptP%AU#l(`J^-j7V-
zd<(-CS(MA5drkiPnsK=dNM1fg6JRhLwd7Hz8~yTW{~I-9ouGs}wf6{K{(%WOn4$Mv
z^q1{gPzssdzyc(iY~<CUFB2mojA=wGMCZ1G!`}1N=#`*DgkMgqha5frOQn8VQPr(`
zi%X|nd1}@$5$PGNa(N)!4TPoa(xv<357=czb4`WZQjG5yE^15-HNnQjKl`t&6itS-
zy?PmQ+wDkHg9bZ8D<smkzR?TeG#}azFV{Zw!-Ido--eav_c>uc&yJ^liqcvXrTPl=
zc+0TBaU^b`y4@wH7GH_*lvPgO9rkv`_Yw7eGrCf#Nk2v8U#><fm`>&a5Qq!3?iz#J
zJn>2z&A5c7$9ihh5(=`hf>i9bQnGx)Qne^-GdszxG9RlXg+M)m;WgM#zN}CGPv0Z(
z?XGe1QITOAG52Lypo(2OISNpH-B*hB{;X)*a&9y^N0i+i@DON2N+GJE>M+o<zo{mv
zvB(X;=z;i#HnL`YXsm3qkwxbh6vX#>Xde@a-prXvcV=Mmk!Uy05YO<Z#D%{_dql(5
z5;{BzS4T1KPXkXLy+xSu!+<!c5!1Ns^Co((<(_<#<=F3Qq)uWu4;u*c2=h1?%d^s^
zf|{CN!c&)04%=IDIe|7ENJiuLLEuI?q9n@FrkP-Pc3xujbt1<Gs}J<!+%Q13IIW}4
zJ%f1f-d-4Z1VknleLP+(J?_-~*cln+&w*hUi@NJQ(%yJ9Wq-(zKw9usC>@%Etof9R
z>1A|DQnI!gC0598@j!$6&M5&CbF`5#7m8Y#x|MtGV98OZQvId~#?FB(+RO#>PVm&7
z{iFG3<zZ33$q=R9(+>dnP&+E-aSw=tYtXu;_D6i<qAw1Y>@hd&$Z$IM;$95Sj-*qq
z#SYqZzhx2?FL~;rP!VTd!J&)L7O7^zJ&FMPEz8+3&W<aqUoMkv?(hpB2z1a0gmojA
zx0}&w)GWV0Wa?%dJ0^UT+3=0Iua*Sj5t?uN@Ff%bG7tU<Ng)%A`Z`c#hLd3r0|C3z
z*=9G#EVGJHuWdhtvc?ibKj+NF_PpWb{MXrEj-Phgx;x~z<TiT*1u*lygD?C`N6SxF
zGw#sgG>fGH?6PS2acuH_<3)!TuhbFrsl`)+Wl6mGE`fI~!Qhj)QO&y$XBGWuciF%W
zSd$Vd!Xt91k01)(Hpag0%is^pGf&*GCo&(^=dFnv)_+vgtHm+#VwnyCl{*!0%!nKz
z{7|>Ub}+W+_B03jR&*Y^nTfoAUa@kfv=Ym+Yxu^{9gJ%XCcO7&crem^4x>JKFzS9x
z_8$z3k3%O491=WY`}RJ_8`~ND4qd-@h`BuV?s*#Y8(|$C`1Ce&MDQC92snBmS(_Mb
z!|thrzWA?0c9`c}id-%F8lAi*;fXs4{@4P0T4nai0Yp1E9h~Z30LXOz8Rq8$+_U7a
zOHAzIF+sO$lZ<A#;mi~_jRI<_-Tq*d!yJ5csZduvb<vUi<Drbu{Wle3;>p{b?>f>w
zfxrJ`UfXyN7UDTnJ0Qh)*x!}inWY~o&`u=R()tg#uV9_FpnQ`Y=Vy0@d!Ejb_@g-Q
zuz&o~i0gz#WB4Yr05zLve)-e+6~d8<O59En{<@@&0_lLUB<67ZwW%iQkj7fYC#2OD
zRc5}N!9uif+=>xsxXCH%+kJ)eUBi|=-SiJlp<nC#hK2X}L=f@h({@~>yI**RmhG4^
zG0X>cTzR;WfsNXB(^Hz2$z6rf!b5X7>xqNr!EAf|ai%@Do+BC*p7USf&hh2_l(?ET
zOboZA@P3U80iQa_5Pf<sShQ>;%7)=u{|L>tQc@A0^vFKA#)+4q9VMf7`Et~e_<Q|d
zHADvAiJxN5+(nh~p!FsD7yuKCd?F-W54LwNgSTb{$Z&5HcCdaNib?m(gr8_aMu1_v
zM#E=2M7Itlr+5#%ts2Dev%jXX`ej?z1JZ=C%Af3MpX5$MHDEMq<glpK8AD8!pCPYI
zh+Le&pt#@;YZzmwy$2&f89hLe$G_O(*3-F<GO|vwlr63khT#Ss_v7#00=G$XGv33K
zqOsBSz6Op0nPQMxty@ZdHoDV}WIp*EDM)@pc2-E<z>s9|o^d#*{LwOY4%V2~@RDFu
zM&ue3E;B*RNq3*?=0xIV*5muiigW5DYoQc-R>6F;oc|HRGo-tsk@N~4w;fN03(1uc
z9Q9KuK?zsQq_1d%2S#(d#0~M<=bxi&u{W$1=tBpr9Sgpk?ZlUD=GO^Dzmmj1jEIGM
z4zZ9y_r^T!HU`dA=$-6hHm*U1IMoRg8(FpS;!`EVZWE1jovi<+W57^mOj$X3aQ*_!
zxgxJ7XQ65f1JC?Rvb>6v=+%(bb?qcauL}pRPM>FuUgmiO-P#YOlpn1znk((pio@5S
zrRxA1XAOXq;8|{<6l0(DkuT$d-cQHx@*UD4-4uKHGA)P9lEFE0OeK=%Q$jxF-e_hF
z)PC3Fa-(Wsn_ne?`PkQ#`ckIpV3Cgg4gC=@z*v`)quogU&ax3L%!3zKQ)=$Drw{d+
z+m)&}A<lL-Y(wp-_wL8ToxKRiQ_M>txB6ljMlHclS?+I=o%qL2-HQ$8vcnz8+TMHV
zIS1AHMY?QmtvQYSyX6FqcI`hDWj2?*Ub+4X=eE%opX}J=;K*D+cklD=mAulZ-6X8T
z$m~5*hCc#>r9Z9s0Z)esCLRKc`ii1@tTl%|uAwXn-TFSx-c7O=OW9s>&6@%iG2agO
z-F)V$`unq*c`LogwuYR>uhDoKlfcwV_Xk_CX_98nELnJNY4q84rPJ&bAHxTdW~5R3
z^e5z5OW5vAuwLuFwsEeYDk(*JQ_41%DJRF--%Fm($xKqZg1|8+g`M&<iBK!04uu$}
z_0FK<v@?!7Cdm;>ZAV)3yF|f#R?A4p=wq#uja;1d>mC&x>p@(wR;r<Dz_ImB2)UDc
zKX=%ms(wVc7jkQXk$W60nzAd&B<IY_S07b}qgy5i{|5ao-50q~+OENqIgk4Cgf5dL
zQ{p&Iutw-a&gy%dIhd2&P<PPCU$$M@H3d17ohIVm9BNc6N6LSb=P|e9JP;QWsoj#V
z7Ya;}BZFt>%{d#f@T5>+qAX%HJRM|rScTVod8`WiSa*x%XR_pz66bX93L=l6#A5s%
zQO@Vh?ZVvT7bXrH{9*LYu4W0iKMG1HwS0f|P}mYuQZ22oZiN{7wn#t-dL|8sBTVBy
z4=xS1Xp(5#(c?kkTrk-$tw#>usAEQpH`5!bXv0sTDfo(klTrdcmgL7yj%<E=o+1UG
z-pq)Q9@9-<qu!xQZto8Tnd1G2NdZ?O*=*k2<nEj@34|a0hXwF23^*1*AQ}<XvStb=
z*fVQ8@k1iqUo{8c0=sOg1}>RiO)b}XKHR)${TVF}nQXg3WeaRCvR4xnCa!yLi$YFI
zeuit?cxPc+p77fr$EKkipb})uE8*RH=qO!OnEi?#R!<bi(iU_cm1GZ58;-d|it+Jc
zF~?Ho+aGT+|K;bD143Q4P|`LB&tt8i?7N>K#Koa(>9s%85zY~lK2*fWhl$xLeW3WZ
zfYQ7Y_l}l|c=ajLxY1Odpp%&kRc*YH#4CcUX?8!31a^rvq&PFzyIZe4;7^mDKw$3v
zC7<QL;F!hR?YQ2~-`*@CYZf;njqRF=?P1iCO>ZKjJ!Zv!HE1R`@#PB=R+uepz{B(y
z(5j9FW0M-az?xL6H_#fNfaJWDHI($##EMfH$%d(;yg_L_feuio$}OZ_Q*@!)rAQ4*
z2Og6)rKn0Plz3l~-Fu<BM57ngiyuECGRVZ8CoI359n8$T2P{U5qi^0M9RRlMzmWT|
zQ%S-lPS8AXC-<`GZO$m=EkNS=O%0(h<3cY!&sH#W$ej?XOUW!&s;N#pT-S+NmUee2
z$EN{DkrD?7siVHg)77*bOcbthvQ)kw(STa&&7v-dC=_WmOxc<IfW!#AMt>+E`kS$a
zf|7#Q>JqE!r3&JjteCQJt7Fa#Kj(l<`3TL+xUwc5N2V8k+?bsaBBd+5PqCSiX#c@q
zo*1gKAJ7G;XzI<kn)=^b05Hx7E+uYQ^=1FcP-})CdEiYHc>b)0EvV+mr<>*c>N0fZ
zKqlyuuxl6@l4!53blCH5f1kWGkfrR|no;yfEQ?b9eA0;QUq{`Ufq6AEp%|CECWXvn
zL7ew#b&v#WWTT-VDW~SU6qa>7SfP)Gz?wzZJigTmwPfxeJZ>pUhf9LtU9wL8Si-eW
zEH8N(y=t3j++k*8RMnxa18FS}cNaMbH$Tm7)@D~vr_IiCuJ>j%b<2q<BjY~`!vpz3
zf=^y~O4T3IJLj;i=TLlsuq?7yI*I8>RV&eQ6#o|WRMq0^uQ}esKSs<^edy}0SeOc(
z4>2K;FXe1!xtwRY3v|)#$1&|K#tU7&<z7?eUZx9Oi42R;?P_@J9cf#zy+%X=&4q|-
z*Cs~fNCXP_$z$sZ2C5ORMW^{I8NLFgd9kHt(GCr><mgOkr!{>sXbWV@sSorl($)^+
zb_y1^w+j+Exv2efq-vP4YKABpbV3q6Xa7>=EoU?REb<(RmZ5eN>k)@E2SzUUiPT+J
zUJjn|IRcUp+8^&p2+$d676Yh4LftaDS<4AMAfU~~IN>Qp{9zA#A{(b>wwPVLwClEW
zs1|dPOtLy+J5Bjy96xGXVEidhlk0V~Pc-$P@G8akLN$pccqn&Kt&xZ7NubG;Mnt0C
zc@uW}t6LC*1=EtaYi9~t0!i);078^c`jd1f{H&aQ2MG~ADSvLevM0Tz5XTp*g?lJd
zW{YU}I^!^_&{+CVO;xwJR~<hO<ok?zYh?<pHdNS~0@GEzPfzhv6&MJCM46`D+$@0&
z@6~WgJf?EVsKgXM3$0e{NJ*v>1T%46D)ycBwEHtmXB{N!mI8RuNxv3Cw481mSJFt1
z@XG(z)aS-Xg6FCH#hf)cn`bu>xcqAnQ5)XzQz<ewn5PFQh&Rx08NSzD=*$QuJ*F=1
z*z=HrJ1f3l1_7uOys%WAc}4QmGWdl|xDaZ}lS52zRged7_D{#GJ|V~}x2yMsRI6?N
z9EG}H{P_yPdztytPae9zLkZj6zk;>vYR?A0ecatGQojR!$K;JG5=1!A*)?1(fD@8F
z9EJ0by^=>4`|9x(lN!@?5n9zJx98IV|L7UqZ5-worsP~ie#@TgIdd39J}dp?a98(W
z(t*<OrHkUgohqQ~-4Q%aXf%+UK?(dUqZXgO_7b?R$8_5YJ$%=H10_&$D@IoGGSwPu
zXjG!l6_Y0bs60a$X?`GDp9-3SQoqjPyE$abKWKdzOy;;e)mwfyhPXT_l)aE8Dkr_|
zSSU*}yvD7z9ixrqJAUJUXrqC4q)pf*8l(8I<HXzJec7_PD>+=at)528@sHo3xmf4D
zI*<K=SUEuV7hCU`XQCY6K0nlcq~z3TLj4PgB^iQYLE2l;LV5qV1V3IEvH<d8eb~5@
z3D_Xhv$qvSQv)VHF9IQ8-q;vUPYBikZy~w$S7+4pfBM55WykSE3sdOTO%0`^is5~l
zEJ{htGF(Y#^8s!{zE7{NA(fLUi+<~-!{P2&V?Ufnxi}PKmsJtpqcs~OCc%WB$Q(IS
z<%N_6GcVAlBI&R%T40AMTW9k!_n;4C8A0_aP1jFxuMrAJCo`>Kh&^N59~3eTopoU$
z(P$Ynx3NxuTRa({8a+Nu2lY{GWjITy&YL|87#wJDkM|8fVvP|kq!DQ3+YLs%K-mx&
zQ_*u5(G*cOWMBeemSQd8pNn0`2#E(ldGf)DBa6m4Wh$H3cmf_7CNXee?G3o{l>sKC
zo`Zi?&fk4>K|z#tXSW8*L9#@vzbxNU{GA28Ma-k2nrBGM-`t2t=0Tbni@`0GLk&o5
z=2IuL43^PJjC|z5monW2yHv2)ye~$?B`^TWwICVZR$3BOplQ};cXW^*@u%2V+ls6=
z&5rEnbR-uh<=20MXyZgornKS>hBS)6jb4#Z8K9{&gMOpK+4b!$lm@f75T=j7;Eo;y
zb5$kP@+&ZpF-I~tspPT6WnDA>XK|}epCcb1BYFagB@e+8BF^wiHK)YWLoXT%I2;=;
ze;tlShBkFHjiR8fg6QQP;lVtC5x;L8v{*2`4KsH#Jw>Sj_IsKH?VVLLKBt~w6c!dS
zE_xQ}0OFLNg>0r{45WsSQ`m_>101IVpY?EGH$n;-&J!{UFd;#ouwf;dmfvn}H6N{y
zcaYaQ+$ZGm#vhNQA8H%2WzL7K3ZHBcHTEXQXmDQ~`cM+=dEBe?*7jkIrOV`^;oJ^#
zS0<a0BYQc(1(>h|A>D~NJG!vT)I#-IK(C1Dg6J15&H@OEY`icfI)TApRu}9yPBi+%
zB=jYx5W-N5*oJxPJUApwu-OzNfuhEm#-lKBN%5O<-FPQ|JWe(85Ae1d$VC_7VftD~
zI|iFLnz3|8QjobCec^#=_#L<pXr{Bheq^AfVjO=2*MPv%c_9f(K^*Z&arBxg%>7%r
z?RPM0z`%Un$_?IwB#2f|YLF<XSZ^htI;0t$fjEqWg(w`=vef2Jh`w>d%<@ezJSKt^
zu4%0k&zz6LeF!e-&rceljQKJWI#`F&Ve`<+fd%Ec3iBj@<9zGj3hT^KZ(#upI5zy^
z(M>&uKWC*ZEx720Fa{Hls=AN9<{iY(YcJbQ!_UIGB#pH=KOIpju+j7kb$;w?UUvrl
z#};A9o`J~8EF~~;egHuPc@W{IE}9g=EDiJ44)<Q5yfw&vXHCA83<5LS@kWQfTwpBT
zBEaTJ%y|V8C1kY?j;5Dd%3ki@AxuN;rAr3!xCqh54+V?|p68zLpcR?!*w7uZ&0A!h
zD_Rty3e9234gyE#3Zf4TzjRJhT@I1J#I~N{owu<BAugHt3p|}MwvB+Fs*tbT88V%b
zt`3^hK#h~WT`>P8ORK6b)J;<fZ;2?_LruCHHeT$rL%2ai=vUXbqC|5KZ(Uj2r6;Oi
zea0PS!KIKjQb+sZ@qwKiAJsW&fF>5~h7V#gIzrBjCj9=0b>$@(q}%QDUJ=XGkBJzq
z5;Tss@@Df+DV{lbf1NyISG7w4VCTAJ3%c%#I=$5GP;Yk}=B(U{Ske%b=aK+uZ5E3r
zaaMFPMHyt~+gBK*fzW%A+$G&MG1#al$h<vf8V$s%0-2n_IRV@$rrPb+^`MSv95bnn
zy#M)mg`USs+|T=v{dU+^-EQ$}UO~Jye{9n3_6p*>+bYBF@Qd;CjuAZ+k7`GymJ0mE
z*cyilsE2BhsrBWIPtUkSVMam%WBqlLu8C%R3gP28YKJkv2Dbu>sBp-3)k7+k>mGc{
zI%fgLJaSBywGy&M_PRioL755Ek1E#6GHt*U^dxW1NH*@2HCK&JgNk;#T-g4nW|Mpp
ze)c!a=YWYP*_jh=0W=BDbBydhBH)L*^SpVS<H7d>#-E%E)lhx5N$f02!~Hf3+Oy?w
z%?817H_#-moN<h13d90d0v}sL3K0?{kBSw6nnczdn4YsiV|_IPKmf<HW(tS~sN1m7
z<5l$nH~kL)n?Pj0hm+16t$-07J~@cYDGXf!)Rz@LQhQZ?!loe^=R?!>ek7ht3KIe<
z-UbFb#aP|`fKB3X{m`)>pK^jbwNlPuQ_)?iFX;d%^u=5w&$Hhk$?bd;w<#9RGmZlg
zN5kaC$nw;k)yjHH<M+Vn{}%u!DP&-wf`8Zj6)*@ZdJ(X*sWju_i9;5X&Z4VXwwUG|
zDqXzoF-MIkEmVGPM7=t9_cT%->3DLhve%hLfq+Ncd?NxpazAIcLF<7^@>AQ6=|m2(
zI;16-`PjyQ&=Hd(m~`kibJjY}OCJ9KB7Lq{1mfc1*J7m&S&jto!v}oXImQp8^urg?
zX8)?{7<)Ud7exOmaNVwRQ}nOk7D_^breYrw^|pEVeH}Fnbf4PVrRo4k&o%3h?geK!
z%k6<vB;A9~`Xm`Ib0C{;>@am5hmG|0H^rkQ8)I;K-$m-~&hh@j>jqB7KuyR=U-!Ac
zY@_j0*zA7AZsSLGTo-85EEW2SR&9T1drZy1c>MA#_0{5l8sl+@Q1mM;fgsaR7>@9R
zN`?$Q)A^Jm5ak@$u3<yINPrO4)dm|P(!)hh2noT>|24eZi1GR*%=v5i*c;U7m#HT9
zI69%1CUI#<P+LMHIHMbz#0lN^Fw}Uy^%S7JOQ2q9UnC@kSGW{u)R{xL`cB1+9U69Z
zaKtZcb@kryRdht&ixyjz#I*5O$((`fR51P#l&RHiB(R|YKd*#vA2SRz1h4fSEbFz2
z7tBFcueY8KdVbv1>$<Nzj5J<hxxHaJ8tGUI7a)gV<5V-K_B9D%5MgmdnCSF}*7?g;
z^N0{x`{enl#<tp){2i=p{KCb0sxO5Dk}XC9)I8&`2gZT9Vo7+>Di<ca(uD~B(NCWG
z4dIH_j0RBbo6<8Cy3j%#ct5+mb{ar^$?jprej#M}bzN^9+)Wx#*9K|zd)hbUazyou
zsaH~>_@t8*6B5a&_~_V*(<FWuss#<syY!Ol?H7hL1R^y$Fz2R57VLGY+@EEWu1ck#
zp?rHf%P?_ucb4bT!>F=YcyhMKE-Ska3g>l2hg)~;P}U=x-F2F_V%$foxMg#7%Ifl0
zjbQz0mj<w8?rRPJSMXC-07#m2fCeP%tpN?UqW@2szv+Ix6)1F%odSI`i$6b%mxmbW
z_Ok<es8{aRpuGnxP=*$_xX?*MIZLLaZZGb?8)aA4mJ&-pIPfLZp$g6lIFH%&eZM?R
zdP<KC^Xyx@@%^L`7Rll?k8bpaIjx=4aqNR^V&e6vwF=zU6q64nH`!vQari`PGq5pX
zND$Mz)%w!OAuRmG42FNmzX9PhC0RFw9L`cock>ajo_PW5>Pw_IWDDLL9=BU37o7OI
zbKLx)^>)A1*aUCq(H$Fm)$Clf&fkW$BQE5v)!NzRv(DwS&(+$=>G`YX@!Jppl-6)X
zAzqsmFdSz?IxR$oHcy{-PoF<8qy`U&mYvEN<7U5D9A2C!H?wq}JX@em9aZwkNWynq
zeMsC<8R{P#SeWPGOShv%+|7aLpTZ>FYS^<84VTN-t<jmQOEP1(^8fYfZq}FfOsATw
zQz)}8DIo4ThP7MK(NKi6G)JfRtNC?hGsAS4VR+n~z-F&qebZ<njpa+^pMwJ2Xferl
z3BR7B2zYrn^?C_%aA&AQz7ldMYy)S~jebH&EO#~NO%`K#^5B8*lmG<lQ7_sY^engy
zdJlfG5N;if&~#Kn{@cwT^h#+(a7Rqpg9BJ`Oe~mAj8(tRifKNwNQGT6Rrb9?G_sE<
z1xFH^pJ*f){`F?(ZGDrz!xX!NUjAU$)n`c|=lxrlVv2O|Pws%|#Fgi@0)UHPysX}4
zMa7E#&`NQ|Jd}0oUeAFPNGC3IR6<C_Y?BYube62d8led<sk(WG8AvnhPr})9P3d9T
zD$}wue5M_Hts(=TlhcRC>urU~5~DOtW*7!d$V9i&=I+kU!!oz!#H&u`v$XG!8S#*q
z;zbW=!M-7Ggv(PR2V=k}{b7w{`K4!a+{Mtca}lu|XoP({i{8|phFM8V&bf^g7bR4)
zw3vl8a^BDqnf7f(qJyy-;)3X)h#S6(YIaZ$3vcVuV`DNaqMGrwN<&_X8wH@m4G~}%
z8hMLo=8cBQD<6|Q0?AS%^!O>^1z>Ro6qj_nR+^Je;OAjH?+kKD+Q2DHeHSN;9wk`!
z;ik!ynmZw}$@e+h<b?FIWUG%lgmlg%tL`$EpiIvPTAZ8WmDE@81}0depN%Nj#5%^o
zL_?70D$_YSJ-j$Q-;SCS&drM|M~R+1iAT3N=}>7sC=52aB`|Qp90#e1>w`lwLYbqi
z4~u-BU;w(3P=?b@&=qAq7>$RVA^K#b&P6a&?P#3kQpJWvg+_Ym6$vlgcIcRK+IoDG
zO4K|zdNpk~jNfbPI=#9UIe=*l;RhZ^_;{=#{K~cXgqXTo%fQ*H`pDZc|4lt>ePQ_`
ze507Gs&i9YD_2&+H6vOY=}_Ba2OmXDno10+EW^U3%1mq9+Q^%+v)`)Ps4`RPQdb$f
zrY92omU1FvvISJHNm;KE#P&0SDM$ajT=-TYkaeu=Lo&E0QEhi;@9Rza=NnJ^p}@Oq
zZzyM2mAR#0u4e+1Pov#$I9hCfF(dyQ1xgs^ccp;d4k9f`@?2zSQ8~81{Y_E4?i?3q
z<Q1cLu2LEMa~Fzn5(s~Krgpc#CV}wo&Z}q9cZKm6<cUwI^u2pwsUN)EdGcg$r#O1|
zfPTvGTOZ)A#SpZ^<@4Az^C;~@Kxp`sYRFuI;=HBv@leO7%&KXS44(KUlZjT$2CG+0
z#){_Fm<wZ~PnpU|Hre`()3NeAZz@H3+tO(`*!WXsArc`8Kxl(Q@9pfoV^y-4es~ig
z?h4vBlA<z0%C8(+TI;CbD^y9|)wfLB`=v!I2$mkYZ9Www2%|6Qe@mCarz}^8CtO^u
z-JJ;b7?-QG&vuobQm%oJr0rqkmU8g;Zg?8*h4?A6xG3CM?D2*d+MqQ4rQ#Zd%$*Wk
z7B0?pN9c@`GU`}<z`H~be2GZT1mq;SshMXRFVm<Kj~h{2!m|%kbmM~wo75LMdm!GT
zG&L0}ZadnrO;A-ye9~tj0utFb6!5$c*Puj0M(ZSC6}JCtVzjVUVJ$arG2h^_A#-Y=
z5M7xn+);84iT2JDYPcgG%lz_akj#@l*<#Qt^b)?d*>opQEH#{aQ$HhJF`5Y>k%hCS
zWx_!J6cc(9wSc9%Cgg_NStR>OJxd`pk#+K#Lp3XgJBR795*7+Wr5+lg0PBMJte|zk
zV^_0yJeJHad6uCH8wxuu!8WEj04Y#Ty(~ipw7l%WW!?~I;02+m(P$_p%cNPAIA@Mo
zdxaHXKhWX%@qbNhX9}50qm*)8TDB%{Y(zpyaf^>RVM7v4+3d>glgTQJSCHy*6bR}T
zFI3p*mLY;w*_MDOUw6cgP=KNbA!|gL0@w;bT4Q!TCeDM{IM`-_dPx<Ce)ma25w@=i
zWXKHvG@|S522;h@d{)XH0uwnV4{%9(LFdTvOdeaFM=}~Z{F+^kb5)mh68I0zC2HrL
zPTgMu7@gsjc;sk6==7rCrhK!)7EYJoH_$Vi8{kGTJWG6jXWZ;>kMja_5aY>+ImZV!
zdxIg&aju*=W0v$saXL1qb;|po2|t9bJ-a-A(NgmSH#Dxv3dRYoFg`7lg1AH1i}?WU
zL9lD!u2I^d-tdgoig4@Oml`^?8ic1a;ADmZ$i%L(Ob52&v9Rd6Y}X`~Fp?k_WN>^?
z!x|R4`5cJEt`QiGlX#L_Z}2h*xU9Y5Izx;z38xlgV}_hvrG4BZCl{VH!Xbcx6Oq^o
z&?+36F{50DXawFQ<!oyirf8xB7gKwzqnaCXm(u~pUV(%htm7W6fH6&_TaBXsV~7J0
zv``r3*hFLC#h{?Y63f7xbQp@RvN_c-(YXOwXC{F$H#o$D8Sf-xoG5wa5cn`~k*2Lf
z$VO6uuOV#yKSbW-3<>v{B5hy<3-NOwrM-T{CATGJ2VyK2jp5OB5!ioie3k##1_N&+
z`rE7K@$u<l_qhFRIV4*S<u34CA^QkI_rxikgqgGgWbgj(fvO+nhL}^waIYXB+-Exl
z*lehDAE}BVTo{a{*1<l86Z^C+bCF8Lj$x6K@pN9=r#oUG4_+&=&yBX@91(L(W}`vA
z0_l8yxM-M*e%S@&-dpK>oqbeR^e)?|_<PkRPJr9?xBT<(=Xy5^_U&(Ha2GXV4e#Lb
zA~wtx)Zkp&`HDsLSiO}L=ChQtw~XM9Q_<#QF>&OFtO+n;Po;XzG9za9R}cjk8tKS1
zQ^UKQWdb_qQTh&ZKKbj+Fi9+dRyAEI9gBj{tE&+wp6Ms)d;Eq3S3|L)6RbaFQENWR
zZg36t4F(HJ=7`lePZW~$+ffsbgK9Q722P5OJ`yTu%=rWSCE1S79J&myLWGiZc*{rF
zOo9VR`QwE{16NreuQEJ3H`lioSE{=e8J|jzZVp;L$aA|>$heK-TWfpI<|h$4e!8dA
zRxE5ShTC$sYz;88f|0f0tnW$C<uVr;%$>n(Z)fLwB*C=R0Du*5F&hVp@2>`dV05<V
zJ?t!cW+?fhhlj4GzDDt60z4unPzY@y=9B=enJuoai5nsyErU*hQSheQK)^J;i^q(~
zrAs^oV{+P=gm3|K^PDa%`FW8{`W$e~rr>pw@=eoe!q#8{stQ~o5OIMloxDen!7KF`
z6bZ<XvtSSnAebvJ$wg>Zn22-&jo~A-SDWMh0h~wuWQOMCX4;lOWX3TblkmhO5?ld|
zuJC9jEWUDtSOkUW)Q}{UaI~j>P$btf*tZ0aHCK$cv*UssiYNrjxRSD~WP&~}5*_Nl
zTR$|9|C=)o15#m+sa}E$FpX!hX|PZ!W;CwR{(s;4u|xHm=P!PMtN6b=hv)4x*tyf@
z(SN&5c3w9B8xx^iPKc4#a?g)1J1_s6IN+EJ<Kg6_*#J445!3TJ*87nd;AjTm#Z+85
zSa_M!rm$#d)z0`U-@ZR)JufWtyCj(sJ%RbR8Ytx1MhTDbzZez}-@0-d`nSS@o*V=4
zy@nZ6O)%coPJ+DS^UH_F&oBK%X%z`#Da05#+71`M86-c$CSDn#1j<C-<7ff+B%v(4
zDrA&}u52r_MK>LcI0YvD=mQ<_4%=ktsAyI4krf+0=Z0H++u^mAncRnlh<LKoV7MiM
z9eFZ9U)P#kG?|+uHM}~oR?zP03`Q-1!`@@WLu(hM3*kMJX*CLVGv?zLrAc#)RQx#x
z)QsT<5@R;tSTL^6*b5^q20<{J^|T=HC2(}Yw%d}Jf%%(n3XVoF^{uBcL^MHwZeAqw
zi*%f{C$G}U0zEeCPoDgx9{pn0#ILQHkCr$k8F(lT6!oXG?0t$Uc`#Qp6`Dim5uqOp
z;Ftk^-;O$Pc6}etK9Ca}J(9&`Se?NPZozD{ko>MHvvliP30BOOJE`%WsTrXlBD!dt
z%Qffq-Aj<ZB7;-n|44Y2e3%N&p|eHHn4O3CkLL?!7URH{^x@+n%%yt>y!`jw^H%5d
z`0}ECdQvprgBo!!mqvKvTc$zM;WvA<4hgOmMgB|+IgD%`UYn<yF0diYFGsUTTqN2T
zwrq)RFkhERbI+?meb*VS_TU25jOBw&#BWpHVZ)*^{ZPz=t@Q47JQ{A@#2T+K>Zh~*
zXaO~y9loJU{V{JZl=a(59HVaoPi*~T6N=NG!4}?<ijZFayh!KXJ`-VHS~Ue|T>U4M
zFU$GZZK;`kc~G<a35WXOUcDZD6?xC><~nCl+OqHbljeD{?d&fPVM}QF^x1#34lf8P
z3pZ;BsHzaQZUoy>09&=Fl6H;L*z3gj(vGt19o(sC)J4Hl;f!H8YSJ^ojXX^ICW$6)
zF9z->EN{qy+)3JMVm@Lw$JBB;Dm8RfNcP5K_&&Kkhbz=(dFzwWDHLxUpPqhydDcBS
zy*Rx*eEEy{2@l%OC0SkN2r9#4W6SatNm)B8ZV4SPL-WBAIabhLW_7sOCv)oLbON(@
z1#~G!$mT{pQotnL<#5`D%0)i>CTAKqXT8NW=R`xvT+X3|nP}&lbm5Z!!(-juC$nTo
zI=){t=*Ta4y6|}Xf|tV6=n0JcsWGDSCTCZtunLaF4(tb@hd!zT_fQFp*?RCM#|(=6
z?){tHx11Yf13_`aQ~bK7dHD9tTUg=0f3cx4dU$vnjW0H^w3EpAUCOzfbvcUpT~!}w
z_yi8Lj8)0UM4OEBJnN@K^U_rkbC28j{`q<9KPv|y=ouFgSsTQBgXDusT(}X>5!2+k
zNONrta4gELSi>SW;wZa{XD|{Y-A85)!x<F&lh@D@4YqxB+`4GLYE=%{VpVsH4THjI
zQZ{7tz{V`r#^hcH3L&22^72h%0-@-Im3iYjZ#_Rey#x-fYFsunGQcYGzQQJ&tt#yi
zu>u$&7cRenwrI8u9hxmsWAU)2K0r%UJc$TyWySVV_|?O-L2)o0(0^1U@@f^B!p6$i
z#`oSf*js&jvKWot^wB3PpS}$wvocwL7^2EE(_ACadWOyLVDC6b8=UB$a*odyqj!g#
ziV-?+!~Z*xzUp_Jv!cX*vN``2PQzU@lcuFPiIBH6jX8W_4tyQ!mo1*)u<|j6i#B4J
ziHT@U8LT<K0%fR`1R>NUN`O$Z2;heeA(4PL8ZovgcOp7&PU<(M);NX-2E^XpsE2r!
z5ceK{d<`GPS7I9`gKSYPs}oIsN5DXA`%efIU)~KYehXY63|QDGT|)o-AOdt1w0V^D
zXU)k#t{ofwfJIF{n`t7g%QYry8Z<M)tO2wH5{@Bewhjl^a2rwK8nQgofr=&_j;;{#
zX_J>qJEVNUC~upQ76`o==gGw5X9AF4oF=AhtFR!_+MPvDsLjqTP);8NBHZLM4_P>5
z+zgmDW#;)k5GJh8>mj44k=&Rl8^(QQ;1b7C!B54}kEfi!AmvM+$XU&xAf&8tJ?wPi
zldIfjCAqrtd^15>INy8g5UA{_Q6OjZ^r*a9O#6rqVm<#>=c0Mh+3;!^5*B3>DWI>u
z)--9Sjj~!*bJQehHFXG00Fm*OWRuecGVFtNHixmmqUE#=r1F$_BI2s;H^)P36vk$Q
zki<P?0zI#9+z~k_f|0QPWvBT<=+NkmrU!UJ#K_aP;UzPP71WcQYm=~lE{PSkqZ2^x
znm&PKl7=#+=x!tkhWSfZbkOpsX41%fQ~#amLs}3Yo}L!&i$FdC{8$;Jjp?^6+k&l0
zPNo!I1*$w^M^ov%<YT(*O#GyikO9y%O4rg)4|Z+){;l=*QsFgH;F;bZ?7nT>lddTm
zR{2V#&%ptwiYi}>Zm%}_VM)ST+-^d7n$lWt=bW%%GOLP!Rn>PnQj|Lyw(zwZe60Du
z$_>HBku(rPGpkt~EYt!em!%k0!5~b(X^x@!{TjGjiTW|2X`iQvgi%1l4zv#0BO!W2
znM~b*o&Z&3uAi#GILaG#wp1U<a&{3vf^9?NLfW>tYB|b)A0anbq3D>qlpmvNcf=;_
z6}j|w`Yrxe?nqz7Q;ekCZ|r^Zz;Wdb74;dg4K&QrXeYpoFJFbS-_#mCkV)p9x+r>K
zt?olyY46la*>QJuKVr8)_G1!tWsRN+v0GMkBKm4^R9T~a-)Z9xJ+Rv44n1&%HF}7%
z;Wk?ytkJp+=CMZ0qeZ;U>f<$9w!t3Umg&kB+~b6Ia1KuJ<|QI>(8CysZyxQv^^sgY
z5fd^lpkWpGSG}<@=xu-Xaj?-4$Nir;a6&O^YjDcaM!2Xw`Nhba73*i5SxrvEZ47r%
zWXLKOl!so7mGJ3ZOPqpF?p?zr1RaW24TJE^8c^hiKUf1sQSq`ZlEyW$9Xa5y*)mbu
zThnB=1wYs5!3zqoMkf+ufcsgaeJOv3mNBjYiu(N|!&-@x(ff^4D1>$IvpY0zLQ$-P
z)C{||?mcstU~+dGK;O+G`x|<vcJ9=*21NVqooh>X>3++P0YL6PD>vEqC;koHt$QLu
z4$ODzc9!RNo*NoC-?fjsPslhiuR|{7`If=9>rKbF7~i$|b!SrWVP2yf4+NkG<m=S0
z%*K&%?Znais6Sc^I3la-fDw=YdegUF{M-+lfV@kl62AmV7o;RH(+peDK)aGa6fFnt
zGL^NLtQcCrqor1u%dN{SF^bq)!ZZCFh9IOomV?@5r`7$B7K`MppdlxlRE^w1?x{6r
zc0VN^BI**sR&&D6G@^SP>4jL_^0NGp%zChLV^|g{C*ia4J5YG@4<1T{mlRQ$-tK?#
zZ@3Jrwx>gZaY$spm`*u=kD7aEd<%0DH>lOgARXRmp$8OAW(8Y1FcQpzia0dOmxn9s
z0;zXL)e_13y8#RdNtaIp+t9c}T`FIzvk)gpY@*OmWGmS_XPDm3xfN9Z5^c~olG~Ee
zww2sg`T(yl!T-}ApMTJY#4w1003SchXZ?r3wDmu8A3N~*_S>)V@9v+!*>V5w?CkCC
zJ=*#6pLW0A-TU^NZ~naZ2+Hk#{q^47pQ4@5JdWUJfijUO`qQEZtjl6axfSpKML!Qo
zYjv1SZ)fS%^*n-Oh&~|yzO}cryN4F!qxUhVdygkWxN`wTM^EC(95~RAs0+OUUU(D@
zGBN>sN;$+wqlnr<d`cAYK$T;pDFe*kTNo!~awo#XZHrl-t+;#XBu0PbY=$<mWIThR
z9@w6blbTy|z6M!&11~d1b>l!SKnK>rY?z@*8oPdIfCbLWlFT2=xT4b7NU<k_>SOM^
zF=oA<CFEQ|YAAB$>zj3h3oPxULUof+-JCtK*s9;{Se%ILsGwJJ>jS=_YAC2^vWuca
zfvFA_V#`z*jgCSF^+}^~vUuYMuF!?&KK{^HP@?6+EJf=+v--y5$(@Lq--$Zeq9s+#
z#$9X^ILYi&+5%LhVfasKBbymd5LCIDwa(C?0$x(8dl<tQmHE6pb9CRDp+BtZCCLqL
zIKM#<aDa;LX134jL){cXj#bzUT@-CY;rQZZyAyRzpI^Lgp0^_Ses+HPL;I+86g~S9
zUbdpc)3YDX+b>>TL@!T|k6P!QsCjY(Pfsq++s`g9PT|2uvja6Z=)}Og=E;vy>#t|$
zEg-2+&!hIMv*R|j2OXR@PcGW6P9tic93Eeyfng(pHlmYL^e}qWzJOvErw!~E8!Ok0
zPM=4wTIYu^;b-$%`?!7aBX#+_eQ|=_J%|39(OL8SqJ4OI+&o9m)3ehKwTAOMYIhEg
zo9$Pvqiq-i^c%H)K=-E3OQ1yy(>;BC(mKZpcyoP5Z5_9p&yHK%9nAKqecn2}z-ifU
zhp>n+$YVe}XRX6Ferf%+1v6@%|JZ<L30Iw-bXxy;3FY8@bkuy+d;xQ;tymq{p~K7b
z)+-$N>2qwSbNQ@u(Z0C6XhknhPmgHXJFW8{+J~*qesp}=p@jpgy8)eCG_iYZ1y&7S
z!}n*Goi?r?E&9nt>-_xk49(~3u;;H~g<uVuQ2U71`t*e642wl+FrL$5&{i~}*DqV}
z9QOP~rgw4P#O1(z?S~g`N$3^U^TL^Ibkcfp+<wtIIc(wEQ*7vUyVI)k=CwOmrp=wd
zZbHwOIDOhQ7#n|eV7WnC8?~QD&7&XMICw6MtpP}M+5$fCv~zj*QdS?21@K}2#tdK*
zZHOG?dc%1Jf6&X*e+XC0IPJfW3y(*DQ6~Lcd}yCO!8~vAX#4u9^Q@17!SNB=d>|Kw
z;eUu*Tuj~kAA{aAdS>jkP2l2qHj5>7#Vr01ZRQx3wmZ*AI?2x$z%zaOb$1@|JABb4
zN#`5b1&oc}?Hr$8bl&cN@#{VgWb1Q&2qv~D<7#yDENY&$;mPOh0Jjcx@i47+-XhuZ
zpyn))Ywk|di!Rwb2+f|z1SmH7Zz$>v+ZqwJr*PHi2{%Y2Ccb!0EGVOk#F=qkibKvU
zAwNNN^O{%-V|J~xG4|c|ICxFic*(|G<@cUDmNHN#mmpa+=qL|L##puYv8H<R3LR%x
zZ5UWh9!imQot~tYTGk(DHxX|;npcT?18jeTqX=o#0&zS9{);`H>6%k-3-WW*h^-Q3
zg(xGjCQ~QL8G4Lo1qX&&oyZyU>@^0c2X2yF?ZTc8b;pOo6sZ6v_E#HXJzam#(8N{H
z8|^&QW3{~XTNrprW6hoha>1HH7KV!^ZYp^IK9-zjM^_nv-L_?hHJ2B99g$0+CKZjN
zJSGR`{&hM+!^2$MhR7;#MuCysW?~}PaM>yJKae(q2@Is<0`%o|oHt2keTWU8aY%$3
zi2=T>(E>*IBHy*7UN2kF{1&rZIvwWVSn$_Rr8$QK{KgNdR;(N_lMp|X_ZmXG)PWR0
zv6XN6$9Al+x_E5Zhz!jVr^$>D069=QwG|7A5hEV1A)G|XXXP920|r(akYXC3EI&$y
zL&SYZTF0D`ind*ymypSbcDI4V!XB;?AW2z+HxQ3+L3Z%<ejZ(1923^tV@C`+`mUpb
zAV}T|Mv#xV=+!9e#e^&{^5r~#h(v3WOXO*C1m{YT2%p&51Op+|shzJWP7&6hq8TJI
z56Wh7eTp$dCbbbN<*@w?uNaPOh%+;UGA;z*EX6l$k;(>hbalYlVc@qO7!nDM^P-Ul
z;HK+r3=8~@J-(!TBLdcd9ewR?Q+zJ7<vJWfQWSdNDiJS2IJrpclR;pbE8;Yaq4m&e
zMKvh*F_~rc#~7N4U;={;QJcht#^&BDoW{qPN9I1tG3Ubel=jr|jFG-MGLr{NoIR3Z
zHxB`?MAd@H3y5JuxIFosJx9@0b8^)%7Q-f1TttQx4dWjp`({1c+4y%ebfUJS)_d4X
zXDHM=jfi7=Yz>eHn>55@^9#yjs4+T3>Kf}L^mL#TIfvm)oaQB12u?P>x)S)HD&%;+
zm{BwD(>OY69oww4)`*25D0ENxSJ~Q^mbq~p4>O)Zdw4<#bZhMWS1-k$WVhHG4#S~d
zsKD(eALi^S$CGVDh4$(O26o*GrD%^m$%v3iC`C~^&}7wpiqUTIU$fIZD`$n(%K`^*
zjo}H@49-K{R~bbeAY9;IurDPVVY+mJ0(GVN;hpJDjU$8*WJ^34u40iuI#*|ZUKz&<
z*t>L%LGXqgmJPy?i`+Sak1Y_3Uq2h^7QC|+6djK}Aq3C@8;%;%r|;9`hT?5dVZiX@
zDS!q6PE&5HvTzLrcr{<Ab2!s0${q!#dNH)tfaN-|w{jQ>Vou?JFlt=GYcid@&k&iW
z9G@p1Y|#>$poe-|{npGPGx(s6j>ll#uPKU$vj~c3-KH=Ij7BLTL`VsZ<?M^ObUN_{
zHjMLY68a$x>p?#GSjV^a4xu1b2H{n$HQ-pd(ry*^zsDFkFIpG5c!4nX;TS4>=j0e2
zfJPKZq%7KhR$56EpQ1r>xX_mek$2$Ms<rjBKOU@Ka_gy*iifX`y63It(do(YkM=nK
zeaXSrry3U+|79B6Qu*TI%(&5#=TxkSI?AoPNxzf?=^`1UVToOW@C&K>*z^*hgT<%X
z#kWMO+<q_3<E1sPak1|AtslFu+MQ0rk~R%SEXaEptF>RN2g~GEVYp153So*-k*XLc
zreX$J!p9rM;^?}Lvua>M<^Hv(-udnvk2Ai(t1hxC4t_0%^`f`>NvpnJMO`!b=91Tn
zj$G=Pu-Qb?$%_G-5_WW3v8WfQ-vay3Y6C{;L^v_|$4<5?b#Ms}IPet7sX!fJJ7#sM
zRFJq2tR}I&pFkIcX@LFU@)r+}2?J1IzVEiFg^^<&8ftN0Nh}g_{VxU@;6MO>cg}!B
zeaQzo`LrejvDoL5GFwrtV@7v;>?DCEv}qLP6v7<2TKN8E=Pja*`&;)NPB!ct;Ke7X
zR64VU-j;)T2ae5eh_T=wKaTkj{pJu0Au#wHgJgL6T%*JoFp|q2PoXepc%ItG)EeqZ
zi5Q9x;Y#p~8$F{pmZ^CT^#*@f-ZIfR<wU^rgr&8}ARggGtw_O200%u7Y~?{NNd<GV
zI-1_HiOpa!trewE6H*OYp%XT5L{?O{5xuuowC>Tt<JksMwTAeLaDcXS5FND-FS@7S
z>nS4fH|$0;M+m#M=b2<IC<u2p(d2L-se4yg_d1ENFEVTe#^}uB*FppqWp9xrlCUYf
zY;_ZSfoLM4%Whai8xMpXBN>G813W)^hLOFAnKir#Gs_W2gzX%4&@F^TC)7B$!rE4w
zq}6c2HH~V_dB8P?D}h#B!Q&N>pqUAWZt4=H$YI!#>GauW1(@C<$LMVtwsVCkl9isF
z&$5vZ$_>(4GW|&#<dUG&8fE_?u9^+o<a!@2Mkf57utY9on*ke6&mHRxllxW<G7!~A
z1Kp2h7qXiPY~D3GV{uKp%x*mM9lmin;73Da#5)YnrgLg>#S3kjcxMD3u-V61k^I0D
z6h2!kj*f!21K3jfOM5(=$V7LAejk_ZnxHn~z>GAQ;URe8Io=9pP!Rvlw&F33!d*sX
zy8fn?x4^Qx+eThyw%*VyWbwdIu57O(Gja#GK61Pf2XTdYiA3XKNwW;=<H|cp@Yg_w
z14^{(*e2Qz;>8D!s(fJGQstr>4Fb~t0&Lt_4DLv>p#%Er@&uGm3C#(vu8ZPi5nK!s
zbTl7W#Apxg4T8;8JR3yRR%YQ3sNNe41e8okK(WB|)9)U@*;i=}OZGGh7Qzy>%>}tR
zlbBEdW=sK(ZMJFpd7`}0CDp{!(SUh6%ifX2G^cZrc-NY<xTE;vEuxApe(CbVF3jIu
zPkawFTr<C&^b5UJ_IOV>-LqE}_ZNaSXtbh=x#TF+HEY%|kfmW=whPA(<z!Bl78{i*
zA&Zfiu@i<PW<l4S&XhTga4o>*H#lTC9{tP&ydsT2T_P<FeI(&?Ho2vfM6|qDH)505
z&5OgAWN$56s{sZQnXr@-;g4nWswUtL0|>-~Z@^rpHRs7V9*}XBh;iy_-n8H-sP{44
z=zKo9Pps(-u%YTk1PF1~L<<P3r2y{+v!LL^0}|LuC|HTZU}Ag<nR~x~-?$U284wN_
z*4O3r%yvd@E(uZQ#76pf!y!|hTnqhC5}UBcQc-cb10#waDei3A@36zIONy_;mCP&3
z+VKx29o!HQ1w!4CAQyd+nJg0q(%zLNM##nI<<fE+_kpz-9wI!}{A>41886<pW57>r
zDByFogaBkF{Pz`^>LmkOqJ}BV=kU-<F$jYF6|LJXQn3KzQYH%RM&x(j0bRbr9yaW<
zG<F)hW}p)GA&zE190BeYexI%JoQQVzfJ?N?84JEAB<so>0;iVR3KD#n;Uni1A9Gdq
z@F{YyYY~(>0*gWKoQ7A>xCd`$%eTNa2vi)o_V4cO*ynI%yw64e^CP{+3wfpwD)K+e
zWpHy1HEX*?3wxM{Me$~9;IE@RFoXl#-p}K7W~Wt=EgUQOp@&57W=g%I#K69T{J#4Z
zM{*#@h<y`8ynuTx5(<RfV$UvlBP&2K9*SV$F6q5{QCY(R54X1Lh6F<G3ZWsfRDrKz
zmE|-utXRexTp?5^itgc%1Y!x3uT7s&@pU|%CKA<HX$Wcv0a$^~s24*`8Kt&})kL3|
z`Meuks^sf2&!!r2sJbynA%qumJmP4}Gmeu!S=owgxCJ1qIHRLjvuBj%YR+4IJJj3-
zMwq1lLL8iMf+^7EB-5QDDK^L??i21G3v@LjNT|73u$yC$OYxZ|e#;FvX3<TsrI{iq
zy7bYamiAFD$q>pYwqel>okjQ6uO&bZN;Waud<b08xXaurQf|Lg3a{mKvfyySIb6j3
zYgr7oF-F#g$+N0iEHNT+XQfsmM?{P(5l2LqO0G@dM(T=b3Fb6l^6><U8wwsypkaPH
zK*w^cE5x+gI~f>h)22zyVvn$Er4@$nMkJcC_mdT$Hwu|K*rUf<VWYn~HHg|lC-J+N
zQqo1@m>#oEHDpEw{N_r(LM)%~5TD0vOUs~qDjAJ(hljCd{_iB_8O1we<|o8zd0<n`
z`1l4+%2-@Vvou>fId70_NgrTQi!ww9Tz4x7IA6^1Ye{5BA+sqDM3y_IEgY4<kTC=K
zG6E_VQecj#g;Kb@<+)i_WYDf>*(6)!BhIPrJ#pkeYk|Ke6IjkEM&BV}o7*#`6!7CR
z0$ld-&SilBJ)0#{MZzL}6uyfB?+(zv1$dm>`<lT*s9EB((5yHG9+KpHD9=_iOB?E%
z(x7x&7th)kxNOa{v)0Lx;gMXUSxqs;h`P|5a9i2LFl;Ciu(!q+dY1qP_SokxrHA|3
zeFrVnG|DQfTj~wIxzIdG^F+j?vJ+m9@h{+(S+4x2)3Qb{Rq}k}y!m=Vrzm8KohI4U
z5if1$qOL3E4y;Mug}MlK$>>PP2Sm|mrOOj}h+S?atauV*%3)wPDYsE3)=*|oOX|P-
zgWi27*Pc6eTEKapjD}V=?NRU)KJKwY&igBG(vFEFRj*_=a$^}ba(p=G#gqpqEGv$R
ztu{D}(=^6pFRbMg5JSFM`wl31ERVLy;jb}M(Z%f){jakIMr=b*gOe9^Cq5ZBH0WLO
zS~E%f1KyI#J7&}%L9*mcoo4C8o27(=B!G5An7lL%PG<Fi!dqc8lBQ;&sZHu4%*rAn
zO$RoiEm?5FMa)?@5KFQLg7QIuK`&<sGo$Kpm6{nVRge&O7RlaVPP}3iQtn2-{1Q0<
zeeoIA)3D%OI2z?E56B~eUh+9UN?aXk=3EV#;ZDxu8;?Pe2G~P55>~~1=<+NcF(!rF
z*JTkw<_QRjO22cG1rWpF>wNUStpP2;xDxnTwo?_C3nR<<f-I?S)i!i);xaPXa`X&P
zLSMy2vG{h>UDkQfn=HmEuG=C-iLx+Q+X|b|Jw8Pxhsev!*~gZUo1$>&Y_X=uP%=JK
z>S@&DT#X!RqEcH!(k~MvoYscrCIOnHmb2Nsji*R`9`!o9a4z`L;<40-=FMN}O0LWn
zgCCTY)Kn5&ui?+ldi@KAN87cI@*r}A0Teb2PYxWzLC+EQ^2);j+44DkE^iyb57mu~
zp%Yczs-ksl3tElJd-7f{ilkJas8&*`6wpfN_P`Te(1KEMs<LE(mbJ*$$nLP<`krmT
z4agKShbKar0yGplZJ2G@UtK||@IW0efbcWn2+Y|;4X(;xkzA0~Xo%cblDtLp`N$)Z
zov!2eS6z7RZ)<sIUChUx&1^B*FF_vC?@|<^$5#g|mVivV3IGX(VU!z~auSV<eR+d5
zVCHitA(`bb>t;o5i@~3>**i%HMA|cS$M_UPGX&EAdI_Qt)Zk+ps#L%<JY%zOT+cUW
z$GwCuTd&S8emr{CJvk-qRfh~FLT2ig;6Z!LO;fSi`SIk?8`8B+bxss1tJ`TOY|g*=
zHQw<=S*bU%uDumsl8Ld5`V?;Xg;>6SBI+b#E*E=Rq78S&3Rnw7USEyglfphwqC`sP
zfUW^72uNl#%D}8jhF1IJhvsn@Q`ZXUm{z+{fpZ<zH{lob3sdVwZ!_d*6AW;Y(&q>w
zs3HAfHyWlG)%m=2)b6}GJ-R$@btxMi`g3%DXq|W3rzeds`Cg!rN!Z{DR9`^pPjDfD
zp5b3leXQ*wL|&x>S)CFuYY_YwD*AY?R@(&bfZCZ0XCwc4K`DuaJJd59Yr3-~CuE-U
z(X(Y&pIfPO`OK>aR9*A@Vp;8b!&GJ34>8A~rr*XXkOB@?&<aY4bFwxm)XS#f2)9*k
zb7I5ICuQBOHC90(x-W_)b+04-nOTtrBeLg=dH^N`9{CQlQ=l7#btH~L&eCYonuU%M
zHDX|)5xIRdBIiyr+f7J~9A`N};Vr5arwD2+7l}knqSoeu1``S~p%X3FH)>agP?LWa
zv8MzQA};gjnYKY$F{vvAuEZ09t(4f%G-}>bmgpZEcn8JaP$5TK23C?Cr}@0*EJ+ic
zc!qimkh2lcw@^X+6ib>(1W2Xh5vGYW(;1Ip3t<sP>M_NPFOWe}Qxu}So+u%5#5Vu%
zbJjXJTJw~J$%GCCAyM*Q`FsPvNDGcAi|ry;Zv@KzW$5>W`Dv3BG-X_49K$!cWjHs8
zrj6FD@EVT8M-Hx3Gto}DMBUk8siXXhS!`|tZ7!JwDm5l_etpwJxBEW1n;z`!N9hx{
z2>kX*-9k@q(zh<<4L>cWcApYCDk9iJVmFb%J%V2-FK85Egn2bpZe6U*XCM!?@oRCx
z^n9*?F4j7}<@NBq`|XlQ&BA*-Qy_!-)7zTg$~zMWpi$9|Q^JFN+3i)8>gBZ#4-_q{
z;}0jvjq6zpV+P7)Whaej=Qj;bHgR1%a^5;S?mlZCet&s(XI$dc?H-=Dnis8QO$ea5
zIED95QOZ%8_tE4kCaqq|;%&7@;i3{cM<{+ub`D2%oMMtl08c`0O>%4jv@Y@txu<O@
zl6g%yo{ik42r!mpXL8Z8yyJl#31+D|NNB;M`m8jj9>Vj4bKw}Vi=aGn)JlW^5657c
z23&(7S^(?b340+1k<k?UP$X4Q&nzkJhfDsoG~F_?k$Ha_&Os)rgH00MkiUwjW>DUl
zEfZ!sATDk?`$+Ku3lo#sxbL*3fAmSj@IcM;rMJ5rMP>MHTEohNhk8jm1Sm))>A85c
zk&*-*i*k{V6B*E}2h3-S8Iv3`NdrrgH5eY*0zH9^kue_&4AtychifF$aw4MIG|Tf8
zJqcNgO^OXVcSvg1?a`j`<SUQ1qa)UJDp3)4I!c~I+ep1icfQ1kEZ#Ru>ltNnp{jcx
z%N?yzt{mXpeGRCre9Fs*n-}jhAMT2EU3xiFfc<2Y6qgBZY*Z>QuY3mzAc$p3B+P1Z
zz;CCDgrO0A5~c93i|Ni=or}}+b%>5%IiwONp#zq}F;1j|J8(@s0WCa<c2L>^--@D^
zqCkZb3GtGU^A>FUJ?C@`-g+JlhuzcfX*5>qGw5AlXk%V6xS?1Vq~o#WIKs212KdRj
z%AFh%KK?1l+_@Q7;%-Ol%iKK;6IGKN<8ubPqHtO-Np*_TAoB)_cEUkHjI<X(3B{f$
zC6>4p1q)`hj#dS|E3>f@W!Lt#ZspLy9@vskq{hAs$dT#*AQc+=oGT+qxLqMc5;VFl
z#vQ?n(yRr`QQ1D;i}b)pz%kn`8wjtm;8nPqXN&&z>v)bn!rvR`Spg%;><D*odqP1k
zfTm#EUSs&-^loKkEWb?$jyBDup^FMIJ-S%sAEo|E2ft1GMXS~vjqJkZ?Fmf%o_ioe
zeigwL%}*!3OzihLswgsu;;Tu9DF&@&jo9O(iHD7NLI?TxITTLnXVeA&Kr=H1gvBDa
zQNvUlAf^lWSXo3>kcd3Y6$ukMz*T%K7$7g88j7&T)MPxFi0Ug|StBl1nPifd?Qt}~
zjQ8Vol5o3f)P<2aGA6o(aTRxzVWfsyTli%Q?SZza?|@ndZyiqyV>Cln3B?9hFwjlm
zV~s;1Hb%ExxCw(7$*2tld=!UVed#Qg!LxCd%n3>*+a~+L7cS#X&ubse!s3})|4b#%
zIqSywr$;E>DV02~u%Akv`$qLiL3`)ng*$f?uhA1tX<0YB!RkS?J%olX%bC9`=o23=
zpPKFA&UydJ1ktZS(npmLa!78jvyrhdF|l~ewM4T3EQzs1Dc&QzJwJL@D}{GZtVwb2
z9~do3ZEKgKIJkmNm!-fEeqFUII(*qaKI&flc-HDdC-vxEIvT+jit|@1SI*=2Xt5ZN
z(a48wbnODt-HoZrkVPK!I#5;uDT#)khRSB?1(QEyn|&*F#4nDIuwpT5kleE|wUPnZ
z<fFVDR*BDH^YpnN9|tc{7}2213wGeGpR=hva8z+dvpj7?oA9p*7eOWHH%dGQy|Zk(
zK&ii0sojIO^-^oPeDJf2j_8!EjN1wDm^wZ?+9Lb%n!`pjl|*?}cx@j%Xs|0h+}Pxy
zt%mmq8V!FDRgH7UwR8uGp=OpR2!XL`E{NzGawo<;p9%NHX?DqWLV7ywm>6QS<UV=D
z!Q_U+v~M(*tZ1QJy=t4$Fsj@hbR?8D@euLk_6Eg*Il4gh(mDIl-yq~^dvLzTg51$g
zQbIT}E@3SW_C;XVON=RU;%Kn^@IStA)3Q&+oERpLh+qi0mfujlx5mK2;teZ*>a>nq
zhZnF@Y@8ucV=VR<^s19PD;9Bdh~Yb`aZj*KIC*Rp_K{4cK**MmkP`^S&G_*L1bs#b
z!qZ(1LhD>T(8W5?^P7OD>W*_mcU3@(<8xqw$f@Cbju97W$&Z_V`w_l78jWQ1f_*JZ
zlVc(b$q09vz#O3y0B}%^NPPp1++lZl#^{23634i)DWhEzKjiwvD<AEq(J7+ncTlRn
z(gVSBIat;^dBITcMH9o2_w16E@UtYg*^Aam>%4tfmRoH=_Zv==4TC-kjTf&SuVdOO
z_o*8tE|6Y}D>%$J{Hlcc0OT~PX;8mib_2Ro)7I&?_1AXiqJxa(F8;F@ZEtVmm+lGi
zQs*Wd9f$J>Sgo1hgXS1;Afn0vS>YQSl^2C?cRB^06S*JWtq4htV(e({U$?Y!BU!rZ
z2vtbjxfFe&5W_`Y?a4fpVm-1f4JIfXh*$zm>XEK5N=3^7C<>B$<d|T9Ulv?yi%G3E
z_-a>Y7DV?q%%!@PLmMR~#9b#IgvxyzDC)IXcuCjR{M<K2T$xR)fT4LLx+Uzf{tm^w
z6}w`jYtACp#9!L+C?}W+Cqu7Hgzhhn2Su0!&IslBF#2wy4p`w~sy@VNf8L&>GziYc
z<{;fSPYcfO=s2mqGY3(DWwys`ik#Jf`cX)QdIMp>>QnqY0dVX^1tZ6mM$Hk}xHXgZ
z5JLmOPEqz^)nW`%>+{%&hl$R{%}TGAG7kck`7$yMlec*vL7WGVtUH%yCw!ai{sfqn
z+90jhO;DY(d;StX`3ir1@olG({ql?WUX4-8=qzCa$JQu#(>HcXF2kSZi?74@@|~N+
zg7MrE-{dkhhP{(zhl@9#?-{+^(b>Hd9mS{F?1A#FIl2Kcm^4xU#hI=Zm>M#a0x9O$
zz*D%I-YrI|o%q+A7sRHYjYj0aC$yXE)TY*})?+wI^@tHy8dEYUN0twL9m*JL4E@tt
z`ksBYFbweAKasi@Ty%4aR;FyZvRRL`rkE>Zq|Qx&`so1RecwS_89&_h9+G31_!2vD
zAjoAaguf8*;lGtJBEmq)HI3&L|E&8+TfD_QZ?e`!;PBy}PZ$H&bj}8RTRnuA&Cbg^
zuY(j??y0?Mv4U$w071=$D`Hd@TM<39SI+QnfmQy^JALQDBY}eylO(;}tPSYPX5C-D
z#!l5u&os?hJW2bt4bq4pb#e_ydc@R8=dgKVkifQ~7``wks5uy%0OfKKr{s8^7ejth
zOq_5*c7+#Y!>%Ax5|GEzEj#;Ik7?`q`dB<pMSOzA06}Rida}<*QQ2niQw;uel?ayE
zlsYlz;!yt(BmiBH4_6LM+$U-Vii!bpbN6)vG>Z;mF6yQ-sA|?I-1jmr1*|?0U(sel
zRD{Y*F4?4ho-IbTx-m{yTYnharZ%}rZK8lf<rzQ~D~)YQV`#-h1MEv!OBE>S4j|uW
zZS}-2Lr9WM<CCSs%EV*zUP6C%cN}m?b84(stKsA}>s+=D$hVF+Jk~(M1Bi(G|Fv_U
z9&vXEQR}>U@}k8AdNs8hZKSMBl);xt>b2zhRdNUf%trK*;1geU7*ZXT8+wlUF4`QB
zlsv5`2$qy(kvvXc#`$%FL&eRazmfh=JeWP56)c=IMGA6`?7~AM;S=jD6V+Hcm#Y(U
z1P#r;kiZ^lq~>~?;=9*4Lg@<O!E|TSgyi{Roa9!GKg2v-R*|1hOdkyGv9Vo!pY-Q^
zPTB4urz}VLyL6i4mtHdDV=MYsF~T!s1)~O5lo{P-TM|E@$dGISa7A_bgFayB|1Sei
zMy&iJPMaLlhv?q`%O<3YE+{tYlO)w5r;3y9A8g`R8*2695hD0QOx)}CHDb<abCO|P
z#LWrN+W2+fvi8c=@9uaki6K+;8D3!&#m9ZYC~M9P#ZCk1ysqVEb}Zi$ZC=kUCSvqq
zpjpBmWwL|fSVZYI>&9D=uF%X4-k`Win}NdsCxT;&(s!t7*56)P>PW9tmw3n*=%Bz;
zBu(IPi4YIn?{=<uL{pVSGsrU}8u;Fpz^G!zi4H<(?%YpSB#acPLoI$6?M08HM--l@
z1BbyF9oREv;!~TX^yIdZOrzb$qEps$p}nwwS1q+-9G6=8$?&QDXe&y6!C^@Mn~MH7
z+8{{dMBzW7N!ebJ`w{Vrf5`;oFX;o4z=&yJIsXfON<tYQ_v?ppK46f=37X)$Z+`uv
zG&VjePkbe`e(tO)zWWeRr?Tg8Z_5+3+l42#ciF=8d3TrB5kNSFieiZRzCXf;6604e
zKs>sM$-otDdvZxEM$xij%CWSuxzP|@jsZ;E&t{bTyhs7PChUehNb|TyY0T2Or^CgM
zk9EGpkrhM`GISO~e4a(cBhPDUF-heD<DtXbo}!20eKb$|3-ZJutVZ6|)9DB!>}l-m
zp5RS?sty)jv0Z6!UjDE?31-9as-grB$Lu|h+Je%V@*wt}a~9JsD+;&veQ7Z~k4DlF
zYxj@o6mK<B(By*TF((O8J=z@Rp{Bsm94Ad<!;|<F19HJNjuP00CV>*)SuDlrLPwVJ
zwUG=dH597b9GSXGDz@R`p{Ou)&vUqQO5v24=y;paPm-=1DMq3eI95zLp`0Y{v?tct
z9yuuV%$aK}Z!<6^o}p9B|3)!@ZLD|XHsrDtvPf)%bbnqFqgEh+?9!MscI{IFmGX*f
z!5}IeTtn1AXU7Rmb5ICP^YWt9LFNGZav8#JY#cv~?l<umk%5Kb>hOwvC|VY_vP+ph
zGOM<n`(HJ-&iC!J<95dz;YTF#H$Ucqanj&F=I*-x*5O;>)b-p8H|~ki-t0LZo7@G3
zC7|GbADmNSK#<WJs^ZhJ=%1Y^6#Bt@)0Za~d^a!<Tga417>GsZz-e;uPdREeJXCHw
zIg$Q=U8iD{GpN&<=Tn-oW*@#}Kt%Sh#qe3v_vT(UFI0Wd`r(eD(c&y3f`6FYI9R|z
z*F;^zIyjR*;7!@w-EnRqUO43RD1;gXtiqIEP9T1ipm3rJBKYBrBww1Ba?$}xrwG?N
zq=qq46x@RL&z!@u$njBBR6m6oqeJl{q8KH^1TJ$ncpzf|+6n}oEe`2N-r@1Bw-N?k
z@KTO^4-oTi7vE*}#ULwORz_GrM*F}?0c<wpX~UEDGELYpZF@0rguIp33W>@hf5W!6
z$^~!-j+4pN{F-D@b)W}p9>Z2w4J7xsrmU4Xsm#&W$U{o;JsLUi!uk`w{$3<=m6<^0
z2M-$eMx(k<^9BWI)$%~nqK-zc2(c77XF1|6GfqW`r&%tRQjz~UU+ZmDHtLLAzobHy
z_qmGzT}fT^9w@zi{}9qY?*ofCEz)T+3|!V};~w?`|DuKi{w-z~4lZnoy02j)R<re8
zNQNr{E$R+?TPvRAiY<Ka?;(Dibtavg0!}bkQ^lrN$bU~9(XWlZ$THxf=vRruM~|cD
zDdnCmp-&W1h(LpqwbvZ4GdaIlq#U^J9job7?!jU9sHmNz%0RRn{KT@wVr19E<Fm17
zWc>cPg|V@TQIOwZPf}(|N=X?Vh9$%UmlBt~tI`!Jn^MqiHiYA8L|D_0!e^e;8_`a^
z%sAu6%zL-MkX9wsrc>El4Bs4|BK>l4-tDyi)_S{N9x$3!C6fXZh96Hj!-K3OklH5~
z0Y;j+)6r;;7o-N`X^1x<e62TXgq`jD1EX8DoY-VU-%v?hxlGP^3V;o20X)b_$$rrY
zxg^w8Ipw<aS7bSrCoE(DI6%k0SH}~vNiQk3W-%FD(ej2srBTe-?oW*H6c3U@Lo#@x
z^5+ElubI9AN^pml7IbIE-Jow3>ls|Z;_}&;@&gXaz2?dVjq)NnZSH8?F-UAU;<98M
zB<aT(3sz=c%nw%_61QGF)4saCtoKKRb(D+<U$G{vfVKYr?EPzd8`qI84Ck|dMUV1K
z1k&J9vXYp#a)Bf$VVfiv0JN-l{NiZ>O|mTjjX?tvso49szjasDI`sjh6nkd&b8TLU
zMRu=Mz0RwScZI{%(FEeGIA<1`^$)q|NLhUTkeKwq*Tf$Se`%n+@xyu3wxl<Xr!<T?
z<Z~SZ_?Anj1isG<l21wz&0!aUx-vC0Xwp8J`d_12tQC>76kRQiV1^m26tAjPx1|GA
zFM&`eZhnH}NCp`r8uJ4v6(BiLe{Sfo7)K3}D9$gAH;NjYM_xDU*9CqabGJQq9X)C-
z$$BdPRyl5k%l-M+5o?wzLZDF0D4slLl4!r+<O}~7->*;1AO~O65-4)!A;Zw9W-2PZ
zjvmiU6r6RU!dS1HhqdER!>KAZVFgjRpD^J2SweE}SgQE+zt60PEJ_;?gMwpD68UCF
z)^5Ssmk}&j|A;8Il9{UDRa58pR%N(ydZRkqcGL5#{FAYE)kGLn7|=MJz%38!zk7wd
zzqY9ro})Gx-1l+wC{E&hi2$5Wp=rH>rK(VqYqWfS7I2^4ZTo=kO)umpvuu_;sbkka
zq;!&+<I=Cq>OY4i{k0`0jL?&V=!!&*cL(JP&{4VKSafR&)4}YKPSzFuM^N_T`ocKc
zU13~u>l!iWwOeOF7n69prh*_Zd|fz>1>=DaglKd6zCtJGP0RGXjQQ3}FgxB=UHa-c
zxsF$prEA`5_HLGan3db-JMI~90$wL(t>Ui-ylYk0Qpyrs=aRiwa>)+Q>;5uct~eua
zd1Yt*KFV)b%Q1E9;gFI73aGI=z6=d4pBbcCQfBzktVO5wwUMo}414=YiNTOQ{PJzo
ze|<SP?!Gyvk?Xg<Z$H}F<bre`Nxzc%Z(#HBN36L1_-L1;6(`xEuan#GgME+>HMvWd
zjoreUv5w~a3-a~dYnZp`(sp#j(#s^f$yt+Noyb{sSRcSMyQ^IC9#Sp~0M3^oCz9f7
zx9cqU?AnrNtHmf`P9KRjOfo{&V6zOvaqLxD{!}MqozC9bjPT9qHv7PMp*CfvNt$FF
z#WG};2y&?gh(P1KYPp!d_vLTJLh?Gd=eyOHlQUG_%(_Bm8IiyOabEYOedXFGU#!}!
z2)Vh7{-)_awnuEk`Z_8G4V1R468Ccgnrr}?Rg5K5%>-CH!8~`e%B16N<SO|>)N^af
z`~*y1R@gb^fC%pDqxP4sKb!vGYmEyNb^e59UE}=3>OiB^=fs|~K=iU{moO*nTT=j3
zuM7>_|H<;BQVLlei$!cY2A75lg9rGL+|5L@R85MSP>bpY*eQEB`0Nvk+HO4}KJAGd
zG(*6AKXLk9Z)X(a(>{UdGOHlDUnW@<>Q=Xt;6D^@r0~eBXA3G%R93@>6lQmyN@LHX
z0mZ=MSQ87llP~B%-yG*l@1$Og;IQiuXv&AWJBA(vPAlC<XWj4HpB-^!E{-lI(($j3
zB|?msKvuG5KI5CV7#Rclfq4KJpU5tSPm598hliAa2R%MY%?5~};%^ipRvsSS?)kFN
zUH5VBxu{zXy(n%SM#*kxhFG&XA<k0JuikUEBFWm5oAEa1p1FyMMw}Ojs;QF}U<}Aa
za|4I>?Si>OYW(B*Px`D_Uf1xTwmZV>D5GFBYr-t>`ax%6m(1O?ts=kDnw#(6vYHFI
z=7K8E-s5gs(<zNg<s07Pfm{Yi?w(?qxgFw-dog!ZzVyFTbyI&%uQX?IK>U$+TcJ{L
zvz2%idpvyiZ#)p1@x*3R)U=MX@~W3s>P3k|@lki*qYD<s_0hLkz{=p~3A&^=rq4ny
zMxS;~))2<6>5-*oE7`}~mEJY!T}sH)_Fr--nW8^88D0e_f9yG}oLwMzJnH_iXPPJv
zyds`>Qa<iXHHRw&P|4O&+j=M4&r#_D$W-aFDj(<N+e;R2)l(Zi{_KJ1ahO`hl9Ert
znye%8&-8!KYE&ms|7-+m9s9CO?Iy)HLai6mf3{Ac<129q^;-Gz+p@p#Bk%B^#m{-|
zE$-Uw-RAyxyo)uezt+vqXI<~bHu%p9;i$!RVtzjH`uD5SBH_YE*$e?D{@Bwf22#%N
zuMlx!bxq8_V3@&jC0hj1|B}<jKmn}fwvOnWQVog8LhPe|{!8qt&r8XCxbuTKCUa(l
z(}9CR7%mb!`C|9Z9s1j<KOSJPY@BQm34h?dQ~KX}Os>0}9d9P1E2@!qn$WhXjq?>E
z|A+8!g{a8ik$aO5{cCL7w!K+sITfxHPFpqMTtxQ5(>awST6*1VKfwD*omvfz9^qv*
zjoz^3gT4Ad_#BmuTL#A~1y3`MmjQ~UJbPO3yS2;QW(NNRvyD`Pf8=T&xR+7OA28wA
zs<7ceX-|z`Ta67gwia>1kE!&Juomn(4^<K4j;#Xg&ZC;AW**l<w(~qxO^rRlG+Pp4
z^U<$+mo>-P%ZhA9#YMs!R!D4AUXL{vp!y4n<5blyq|qZh%f<V+N@;4Lor1I$MxO9?
zR#44}McPa4&tv2w9LH{StXNc(fQb7BOmmPjtX?$vB<&p-`#@mW|Ca>@L{B6WBsI4o
zqTpc1SN#w1{Mf+9H8#Fxb9L_gwhaaoN1DLvh9gIjb$THl)$EQACs&q01aa>0$J5?V
z7u^dKk_(?pr5w5`vBL(&*Ngw)@5Cn6u^iv`9P6S{A&d0pcB!XNKQZw+Q<MAl1EBK4
zFjxcQacx?g&aSi2F~D^GBwN6ec#kAwxt}N22goTv;S@1*YVc<uH<$tNlM#Fps*KNS
ztjCoR$0zS*HYtc}{p1w6U`3lu=7TD=avqL`-sVklgwiuTP(jpzuxP$9T3{R`;8Kv%
zN?NRD9JrwV`<(sLtRN2Zp2i#`fh2TEVuGw;Be1L^a<fU|P+2gv*k^oCZx^7~g)U=5
zn}j<G`Og9=M=ivf^7QzS9mTw4f`B@l#tU(RWc-AjdjzhNgp9?6d0WdGjon9lEM|6)
z<SZ(ntC{Yv(>t5?)Do~k6b2O2ODU*f;5`fAz~Ii;7*LG=(oY8uA!sZZ(P2u?0zPzz
zFl|8{iYJ3$j_sMW3)a{yc^CFv;)T6p<^@0em@2xG`{i_)Wyk_UpSWNCY5-m!mxk=r
zcy$*Anc2pc5qEo;=!97wAgt2!{o-?Q>E^`e73_j}^6fC|q~QPZq6jv*wW0Fzl;k3e
zVIZ*an!AXEkdbwtwOe4Bxyqcj#%R`5uHlpMgP*gK`X=5#3^%s#2UhVbFRL8h>YrW#
zmy?(a=$~Z@E-A53XlNX#wEVtp49&~7-<Ey9EqGaI%D&$eyf3t*^v#e=*bs(t{@`zC
z@%Xm`ZEi2RD{$TAU*iITn8*1?%_Pv~!TipRtrExC@gd@r4DN$0h8VD^DVsDIcr|rd
zCV!BqBX`P3ruGlSVlP*G&RyX^G3}vc{{yvkK2K&&gv~^NF^d7GAuZS(7oFYoO+SYv
zwYeCz`dY2`GlOt#yjI7V_{NIkHJYCQZI*gBf}dTSXRambOgXF#0jU)jE6%7P$)`B9
zl&@oN=xKK7zV!ui!(r6ThR-4B17#0vORTeUp`V-^)C>Y0^_s(KinOy!ItlYwxu7_m
zD6g?d#4Xzr*SX~ltF8>r_EpO|&}Py5u`W>rm4IH$IFGI)wf`WgeULI=tblguziD02
ziGi~Z=bUAIcvv2Qn8a~E-uL%Xt*Yj0>y^zB!}P^n8PiWp2USLrl=lCtilSF)Qq!#~
z3c@6WE`B_W=AKjYTL2!x$uPRdCy%jSKGr5mlTh)&JRz26{P-{GRR;J~uhXTAo;t@j
z?eAkrEh;a(oZQ@wD@Lr(ODVZ!83Z}GwWYthFFiJol@M$0Hvbf$+}DBgJ_Hc@JEUvT
zWUo={qVqc>V!`f~Xa|*g*QW_Ws$~<b!uJ+m7!0;AsjY+alNj*@HGNKN6Njd688ing
zvov4|JovGu)z(RB1iq!{8!$1tP!vDJ0ZyNstbm=VA)|og39ZM5afNO=^{El5f`bxe
zj4I*EG8SGf+62d)qk(^(CQBE(V-@`-AY9ztR4c7zScPbBZO!GR08B)Qb=MGe*#2+5
z+>tQKK<e=6>`N2+lE|tkfvyQA&r{sUPb1E5f!s8PNPLxNlhqPT28kUkd{K+0G}fsc
zBqEYC^B|Gh;e2Fl6O=gt5@k9@)Qf=7c@ni#q&$>_s_9u8(dG&{`yB&7jT2wNyHe91
z@SQ{hdz-igWky+t-iIT3XXWggC35hH6$T>VO0ramAL=eFX|t3(QJw0V_zrg4PnLa-
zJm?5kpP&~uc__>s0q$dwve+@qkr3U9IMW!n-)$zg1CyA8jwvZPT(H~yu9KohC|96{
z{5Mdf8_52n(+<wZvsQo5?rr$@$TR^kf=SBma<aReVZRm=Jee(mrKbF8uunLsYHN>q
zxJ*kk3|d|Uaud!JYq61T6GvfICNl-I=zTVcm+2(oI3~BKoT*^_@m5gmIA%xN^fz-_
zwEC@!;OaEN7v6-6oyL=S8|7tJI%YgHX#LdIo@>a!`d4tgTDB4d+QKr|49n95>N_CK
z3B&8d!dx+8S1!PHg?-b=<LhL3FYN!u?|I(7s$BPW0UbMcQMX#WKuJkOvB>7}4Gb0X
zCP<J#)fKoHYOLA#!W6Dq2dwCpr7+F0T8B#|I|Td&$v^5CA%FCdBJM1krBHN*<vjgz
zCA7XOlRZ7QpCG|OEDITMN?y@^eM$X%dp2I%F8zxRs(y?RDjP)lM2c^57K6&FYt+{5
zA1*q?Vl|b>_=&cy8G3`36y$<;q3T7~7dy4V`2u?DhSWd1w*jo8FUIc_Zdw-CMPc3K
z0+7mwVQx`JTHO<bb+W!qJn3WgfH!q?^WX%A5&-EsoFl!(r_m!SSM4LzjH>Oc`JhXt
zYqMJp{9G)y5lnZ4LxHZ}k0K92_s2%Wri#r_ECK(KbE?x9%-5vdNH2>k0GS=4n-#GO
zv>g+#8w^F60#eoCKCzlz6TmPNkT2O%tg2YR)IdPvYsRBRJ-wlmCf9wXglvQ?Z`|U%
z*D(#nBq#F9n%2b<g1;EJMKh5o+b(%5oTo9Z_XAg9Pmx|KT;P;om3Lg(cTl-M8D@Ce
zr(;oo=xHsBiN=aSAl*@xE=5biHdxO1GiAI5PTRe0)Bdz|utnG*qRD85i!%05QYEcc
zoWC=wDD#yd?H=G;7Rmde$(cnjhep8u)@LaSFN4iiU3sstnQgLKo1sLHhbG3ax!=6#
zbuU`4T7&kGmg+C=FPP&u9`V7tju?$(QahXFS3H|?U<8g4x}WuAv8wWSK2-jCR>R&e
ztTyw#8G_WSw%9ED;He9^(l-c;(d%^gAYfF&lgINoK4ulQS$;FcaFZb8NfwVew@PPe
zxAquk2`+%jWZqiCYlXk`6`n4Xb_A;JbQMSWXpzn(hM%TvnedqeLk$ZgR>NpCfeafZ
zX|TNNlBN|?V2?-HR3j^yS=B8>RR?1#pAq~8&atT(F`-*B$9g)3hFCaOLq@+Vn~jzi
z^tZgZyp0vPn`DO%Tz5j+%?q<-n&+z|`s3bL`(HuR`HFVy>MAr*E~bU8>W%&?9&+B|
zAmARFWS3Ktitqx;XYri)Km%-7J4>$1?hx_1Y9qZQ$swm|H68N3f_QLwHXXz^XM_G)
zK146rZ{dR~300J{>ehI~Nt;uK*HG)qYK}a)CSoX|B9ao;tS|b#v0)9qcAV|HaL8%=
zd6V}x2Xq=8vb~G$#p%Um|1|?Vq$Cc<i>3!Dw#oVqVvXo7^Gq=80==3n)A>ZYoi};y
zr8cuK=Z&2Nx@sojqa^~3K(P|_gt1R#E9PqCcFc#1%#+>gR`xjMRqSxfjrXT6itF?)
z8OyTJgP@T1GFU=#0u|QHiNYF-Nq-~>=Zxt}Gx+jyf>25<TCV7Hsu>QOR{XGhv0?RU
zzVzeu--E$tOz+0~bO8ej=8r~uvSCh==!Q)Z7GIO*v{o$jV-)pJL!(~u*%M%-`<?}o
zJzUNw-A^}}`budeWt3-Aj}KCiZ({~xeg;`Yc{TEylEmP~q^(GS6W4p?w7wAEMA?<0
zSDOVn=aFLpPuR!G)~mezK8>Bbz$P|SOk3fe^D}Fm+;ODXjx?cZwlD)|2@9ZJZlJ`y
z3z;rM?^MM&&>=npw`x%Rg&#G~b6BKsgy?*Uxl|0Famoxej!a^`13eJ)TzFv*-_gDD
zQN(N->lcQRP5E+M^JZI0P6kDm8D&st&Mfw+4?XGn+hii@!+<$+CyeFGjOmtp$Ed01
znvDgY@Cz2rZ-p6umsE2bmdBPkH*$Q#44#gv4!|uPZTAUpO2=Qafv|nL;i1V(aW<>P
z(l#-C^2Dd2z*Tltz#DCQn!IS0jki5Y-ly=ua1-KIqZ;I(qQG)oq&GKWrUVWD7Uf%r
z+PQOie%d+z&ZQ-o@uj*GEGlu5^Ot5YU&ZA~U*9c^uZ*YU(qN^mRk8*(4WRzs1I%Cn
zo@qThSkAPhY~Xs{YO$Kl6s)eqWAQR;@-D)1G_XjUGBw74?dwxYbH!)6r}FyRH`&TE
zwg<8e9Y-S;86Sw6^hlSYT;yJ&Ud}4A%8@{nisdZ61_HGBka<nai^ko)a3hJ?vkRwm
z6dy5<hw?E=Nm}==18{*&Sq~s}3(?TbtZL7$l3;!C?Ar^tSjXF}vF3utB~!)3dCJ>=
zD`@`qf*CiKaZLLh8-2{P^Dar|!8M4vgOP!AMA3C@`-$tt437_M#6l%VT>(Ppy@l_W
z@ndLOx<T&ea{pLz>Qd!FHP1~(mJf0+VH)j)Wyhx5Gery~KJQ?ChrR#3cvo4shWR3$
z0^U`*AXzYO;f9&xA)*~|r!LTz0gX9HznqU1{q9`z<8fo7YK%Q~qY6zT6Ry!B2BMmy
zC|tsCX{uvOVC$lTnS-bLJ1<RwUV6Se<!|_5$d0ToV~7kMof|e{<h>+E#FqG^@qLM)
zeody<jFME`J?}NV!k+KR7U%qBl|G7It**hcUEN3eT&@~Sehhpp!$I68?8D-8VfI8e
zDKwM~^L*e&R$gE^(XeC+r)-=F7u*w3mVtM7q^Q^I#UfB($xM<gyE@WBv`WtWO&uE@
zE*YXmIAELRbDETw-9Vjv^;LWDUHff+*lYJMPY1)!d1pW+(`Cx~y<B~8GXoNwv46(W
zZ0T@#sner(ZvWGTzKBYm82={i*?Q?W1U~_YoGs<D<(YDRePZAJKk1uAF22VHy}0W@
z?8fHyT4ORlzO-~uyc{Iqee&N*->gVr@Fsb>kR)FkUd<<4I?`cjiX2LWHzYH6Axx{#
z$Bz&&s94aDrcGN(SDPSr(&YF!wv_=Jf}oAfRnsy!fiplOU+>uP4>V4aYBwHgO>r>I
z%mxMUGfk$W`F)|Ug&}tj9vp<y!r=w+tr@*w!RVptf6PaNWB1>YhL3r2CpTc8<*DXw
zQZdW2Ny106{S${kg9T@?M92CIUCZ+g%gpH(zQhcv+H!!}4L$ytyE924H%HTPQ&>D!
zN6S`6tY<T-JPUkZtDl>kDQ8!j(v<v2GA5Vjm;LrJYbG~5WgvZR>!s;|qUHRvG{~it
zs^0MK24jxzB1{crbvT?gi(j(lQH!BlU*dPqQf;y_HKh1f6f|+;OXH-b4XQje%_(W{
z$hm@zwG9Yz-0ipAApH8Jz6NznV&UxI94E!ZK)Mmd{m3RjQ~Y`GQR8^wiFBIILr_2O
zlCfqB2zQRSb=X_FF-suVK&D)z%X{aSv0>y}W`t-R&EeWtq$TM7T$A~nyy%{OTgZvw
zf*{~mQY0t2*&?T@@)91nHp^wf$;Mbwkh_E+j+E7tMAoyJm@^ZAS;{46d2yQVY_Tj-
zgSL!&2{jzYuNERL{kfE7U|bf?jx`7hUgi8sD18&|h)3;=>K$T!YN4b9TygQ+zgngA
z6}TztNQ{%wBsKz#J*7PKZ6ljW>ler+v`~!kVxUwN!YRo9n11;sj95SWio0@$(|~nN
z3$7c+M(NgrL};iErg)s{l7a?_<Jx!FnC465rlb*}nPaj2$I6@703h$HUWys!x16pe
zQK#up))&BFVizOF3MngjZSrB}tQ7;H34^X0Ax6r1aS&ikonl+EXzBo(u05r-_SABr
z!jc&gtI`8bU;38@^P-a0CkVCl2bfbQr88sHtY(H+xuzxwZaIz(F^{&?onl0T6hwll
z4iF1bSKZk6HA_V!9gugltmeINXTqt~co)~+meFTjm-Q#WP}%74Cge3D*3wtWQX2sJ
z-={H2S0E-<NdCBfEO1w4hPm#e92w8=sM%N`LlS~V6-_9WdBm4XL~2=*b+mMYpBS_j
z6=P`emuJga<n6m;tw`g~ixQ>*d5BlH{rU)Bj)2RojaXz8`f@>=Urr*HfUh$cdi~Hs
z&X#-BJv(ciA4fj|`H)Kg6n#VccMJ7iM&HmsFQXr~x3_-^eur!HH=0}UrS7xjhUxv|
z^1RbMFB6gfaz**utFD#$gKn=KeWML|`Drxxq~R35H1gf+{OQ+`5)#L2D6qum%RCmH
zIZOiVzw(rxv29x_n{P{PDZw0-C2x63uLS)Gi0r45(1%f6kfa&O#9}dBAdjZRu`ttM
zkK{cjV9y4|SQCFpi7E5CCMST`+@>b9u&uKt(3mpP4sVmsWWZCF<1FJXPEV^TSlwlo
zieG@&w4Z#JQFsN@-EVlbZMC;sT+Dk>4_=3yQEsh8MpozC^ulF^JWzwUtaLVC$-3Xz
zE{M)Z?+E4xzrKtb3NPc0+s2NL*}o<tc&ZDIPq#A{{f)o<B{hRr*yH*9P_IyKl9dk4
zK)1$Y<`*!cj)~wLg_t6*)3l#vKjF+^&gdsIW-LswtaT6}UnrUzr2y>_4hsB}N9D^#
zx@iW_$DMPX*NQ~vr*KpPF00TrKH@N*A6GN#0bC&$$LaNTAJxtN_-*e^l_RNssJbj{
z%DrZ^-;AC$Bl<<?3vGL&R5$#;wavTS+WiOHoY1lK-`&s$2lufT9}bg#w>K~+ieU`-
z**D0Sv1RWSy@Ggg+NU0iUPx<A=Q>m2w33_;HI_5pVE@K8bWg7;F~_p+A5tj&{d6m4
zTV}qzM`Fg;8VV>`ty$?NekZeZN(YCR_?q*}gMH>~t0{7`rPud?<ne@i^TY@E;+uqe
z{QFF<$zSbX5lwN#9`ca7volx+-X*g8_#<&&aHLwSklYuS&fHp_KV+Dx5t~#^V1ph%
zBKz%eZEybFB&yLk%&VNl3%bEUUKWWN)x&#(?170h5g%s0IlnD#xxk!bg*TIJ<wL?|
zWDavt{13&|VW|d=MWZ+f4T1-Zv(rmd5y!CWclmbQgPLH!@Hv;Wlz8j+5FK@uN@S9k
zTRk^<r^VP6s6bpqpspczVM-de5D=di9+5LlJATJUf5cR{s{ed4NvG-Z3C-@WP46i!
z1bVg?JiEFtJ`$z>?ys1ywpiXu>BoNcb!E8T_T_pLP`We(rLzh(x&v*CfBtEkCq)gC
zB_um@_4#OWL4M&PrRwZoP}KP)-RSv01&kRP+)6;Zpb1ZSI|`m%`sJSXzp5P)%_?E5
z62T9zUID&(LM!5lEE~x;LTAuyC8E<L%jRXqbJHM2tRyB3(p{2^$h-*+<!0g3Vh3Jz
zAgdym%@Q^G%33zAj&NAOBv}WXIOn6fq$iVU_D`t2@+kX^3k{c^9PW~+pjkCB1#MKF
z+DTYMuThU;kf!Mkk}?0TCp#bOd<Rx(-o3*d=W@=7ee4H!MN_civw3PKK(12YLVCx)
zXK+4TExj0fv1!8%mc!l?hj|V?MiIjjYhSZTyeREwZ2A{#HoYNGzj@Ge-aBOlr{v+|
z;?Dwv{-9`io0-wT>MFfd`HC95#pND%43t*erwAL$ojqCz_|oc1D^_!`e);czU2pNK
z-R-rGJC}WyaPFe}Xc3Q7T4cm-FQXsdbOx`FJN>~=@++{$^w*<qw|7jxxB5rF9Jl*N
zKY`l1pC374u~=HDp4|SdDUsjt8U8zH*5TW;_Ss>(C+><I6d1G++@`s!HPT!p|4d5#
z{`>f$4SW=AKH-T*E<zCplQ>2d6y09bgcKUG;f+J}f;IKknoTG?1ig}lZ#SP?<DQ?b
zG3aQFunC9DIjSepyN<6Y`F)IRMrQPzj;q4YrhyAUqg`N~U=qRqW?_`=vSr`FC6=!o
zd)07U!92*dY#pLw=FaUbn;D&Q-mh)1N|+C?co;P!dxQV-OH}icySX8NqzyV)Hq13&
zJne#MDxE;7AL8%dTzX{FUDfa@V5XzLMZ3}0(Vn-QzN@f_jNtVvLK?DTGY4<I=z>_I
zX7KbY(OG;Otio%<w}0V};N#D`^_r8CeuV$p{mC&5>2*UCOCcmMm)moV#UQOWJFPh}
zPmlV1TKvej9<-o)q88nM`ICQ)Oh&)w0din}-F&2=R)5O8aVFZig{w9PV^&ZFda_Bt
z8koiL1jF*g$>-|bq{1+uG`+XmB~91fzjPom6Goqda0Kf<-`BJjwlHA9Zm!y|2=>d%
zkk!T9V70tG5wUEEYsSk$x~p*EmbSWEtLc~f;j8j8EfuI{Pi@oJuKC>udECeH3v}0J
zi+f+$6VXlF?Y)gI`>j`PH67?ak;4B4sxE%Ac9$5h568O_Z_L00MLyJK4qN5%O#$ZI
zw-3oAd(%`N_C5b){ro*{)^^Q2{m^T-j-wwBPrFCoMc??)8FWf1JM|6oQ~3K;uX}kB
zeRH$OR&$8Mbf7Jllb0S}CXlbp=?(Yzzx#aH;kWasb4(BEKk|%zIXAO=he(6pn~@T4
zq=%TP&pqbyBzfn!4SUY%h&+kp;BZj~7A4KmcM`E6fSEXwGO>|GLV%3UKE|;N{uv1d
z`y%3*5=WNzNvM?aic7>nnAVJ0LOjlgbhB3Rg#Y3ZTzM{XjAZ#}O%+?d4=tBTj8MEA
zc=fM4ba@&7Uc`B%D~LlkwEr8>pJj2?$cWD8R(&kS+2aZ7?3PJ})1HP`NA)FFbrEux
z>)f7-i3|O2Dt@t(r0H7r-*5S<hsrM$DGHyf)<nfJ;otu~+840@&$S`qzaX?@Ci#sb
z#@)sf8&i`j6u+u{ojXvlyZs-pu)+N690Pk5cnGwu%})JS)CArDed%rGt)kvw%PY7g
z4992a5BiggU5TiPaQ}A)9b*|^-77TgkpkfP=V~VDS5kKBiKA;cV!H5XcI3KBfR3Z6
zw@wmdfYW?}2vYBJ*Q?1FHrRBLppfxXGx&SvXqTW+_&lkmUgIM5egGK;%w@kyH4fZr
zFp*kt)nV6bip7<pzXll%$R)=E(=W)DAVw)ov0~OG{ECOnIZZgmUUgURY{-Vq_>7A9
z7Kn>D_L}~}=%aK~C=@I4X??Z2{_(~0pQ>JM3bG(D3D^%_+7#d(0(v7`=8OP4<b(D{
z(~O^R1X5>6(1b00YtJ!H(wr~%q5ONk5xLJ8&u>$}qEv7J;g%Y<pD$lVe<5Z%+P%BJ
z4h!;nwdMR0>I$v}zua$@hKISkae(Bwi0?Wxjv}b;{W22>T&3DH&6nKR9(GXK6)L{#
zG4kB!P!6!G8C_Th^51yEHq;?WpL*$*>=Fd<sV+Xd=E}<xL$p^_{WzICvih!vs>S%)
zVzi3K0C0mZ*HkfS!}Eam6Jrr%Fc5XFqo*-ohMuaUA2Ez3#!slGfC`}kw~K6+t@6pe
z+jkfXY>1qjm!HM+28}*(jT*_q^?VPo-~peZB?^pr)L7Jey2W=V>=Rb>Uu#e2%X^JN
zB!c3{L}LKfOo!l9hJemUn_N_aiW07iJ3-wp(Jph8A%uxuRU9`bG^V$WQcrmdQ0v>8
zt*uLN?e^C)2%d@W&XW%&_MLWHp49CccV;wq0}m(-yLhOUiOHy#Sn5wxyJ_)~G-gT$
z-QE?}tya(s)GF)S=v`Sp$1&jNNbsuVIf~V|+KN-S1~iLpJw=)kV#b5mO}#{b*CKX0
zab+}4x)OfC#N1}#Hi3N?OKEWQD-+O}@rhq~D_9{)niZ6h;dBeaCIU$57pF@4*)c`o
zMPZIzi(2#>9@x|zhAC_O35{v4U4I*{3JGOe<H^f!pV;%$+$fT-fcw3*#ZI1Bw|DxL
zfH&rY75Fjq1$2lGSFd}3e>X4pf|p2*SYVr(v-(+_8w6fD$Q0ASU~X<0dUVR0Ux#$)
zZ|w)?J&#K^*9Hgt*U#>(#ns|FrB|$K$D$Y)8s|k|QBjw)kxStE!5SJTlZTez|94iH
zET6}-LIq~xq1CCyyanm0Cxb*?pS_6iV{^}V`2u!-@*;w{kdG-9zWUji9Ui$N%V*A`
zSB#K({D9+ofB3&YpZCKGIFkS1jK7mFMmsl2wtf5Ceq)z@Uc7jYfA{|U)vo_9|Ge1$
z>JNL*_x4|W_0^yEpHaEJ=P&m5{}Ao|w#}&iSs~auivF;=qD8e@Q|^KH|A+qkF}<b(
z={gz?U$wi#*Tdl#f22QCVmRHCFaDU$XdjM~=!x#i+b1IN+ng~X<7?~_me44W?;WG0
zxoaRx8+ME%?d7pX&nI+3-}1GCv^{8^s*8#81xGB&Q8CU|SBwQWyGfTTo8CyD5+7Z9
z2qSFpARk$e9+88^Ie^X-`!PC?%gtzU<5dnSG;Wi7cHoQkSF6#xWSIxgFl73jmQ?uS
zkI8JDUjJ8~W~KeF5O&+6-|ic0_y6AR?z8><!v6p2`Ln(MyZ`?yes(Nq;Wm`8>i8Yy
zt2yFbS-)kIpm|U?>?M78iezbjir%z31LKyBtf}Ik+90uWe|Pt<Tl>3v`^~5yPu|Du
z)7Ot@*Xbms4@BR@vt_zSJ^}{gW{R99<BZ|%I1Z^rye!iKFUlv6^%iHjnOLE#mCc}x
zaQZNX^Hn+nU<3TzfcOSskGi8UqYOL6xW0nP)D*wPWHC*bh`}@-jFC;q<-0yvbs;KE
z6QmK`6bo6gZER1{Mvbzu!lx3G6DxNfUx9BQ*>MAA@hE8;dmG0k*^D#ZhZT3mwTiwv
zn#Adp&gZ(O&?mh?F-@Vaj#s0ksx_t++NjTJjm@GUq{i83<wC2e;*L$XHwE%t8c%XJ
z`qr_~?}+W+xdONN#xYT;%rf_sr@&xRFpX@H8_+tO!gj0yn=;N|5ESs)DKcis@GKFk
zwn*PQm@qiCX4lIPSOVUn;uGG)na&q*K?1JuGMUNh%5&`ji(s!i{ixqP8N6xr+7bPJ
z(d&NSIc^_Ehi~a+J38uKyzO;fy&gobyQjzPUOz&3;8FK{(CZvt4!ZQ<NvlsapYV>M
zcdhfcQTvCBUc281eo^P_;<Q8b=mWjh`JmJ8H>1w^(dp%J=loSOA{x<ocMzR+&N>4s
zHt06-T?Se!)r`6)(OJ89^qT%`9d=GTgSY(2lg{8ApF5%NwW5nwZ_qiqJZ<%&i_6|c
zx6jnjzvE8-=(N>2Yaee@8|b?cCpL-tuUn_5h3<CWoVR=EK+xAirghqB9iF!3bJW}8
zPOp75K)2j)M>L4k$WuCaF4{*O{L=oRO+9M$-ZqJ>1Y4f>+kd~La`ZkrZk@GWQ6C!*
zj1JAv(PgiFhK6@fICSOmus`SwE(h)CRkwT0!`^TAzV95h`v=i!x6cE2*>5-LBZC$`
z4=OZj^qPJ@yzF-{emv;sgLbcXc`@j8&o^k!-_Qur7_?x-=CSUcbDwFj;6y=mF&I1*
z&FIbRHa({~KiBRJdMykGoNbN<eo6Z30HHFjv(b6`)oJHd`~0Ylw_Ol=)9JT2Wb!(F
zl<COF-?Zq<m*_rE8nsP+_11Eer#9-GM6KiRJ7~NV1~pm|{f;gldfLA{daa{xw#9FV
z38fTU7aem(^L-}BTMf>k$_It!kYFzfYAph$t$&;*GGTZPDb7LtR;|JmB}MGhEBy16
zanV^vsJRW5?hsgqqeW)J@iljvZI1r!XHcON(`bC{@ybrOdmBJMc2Vy9>2i!a`)5s(
zc($6WD*#Z^KwzH<RDBXiSTpLYh2E<e9wzaONz7NvpgN-lxM(YZ&7Bo<t{Q*_JvBA@
zfC_NN3LSiL8tYGzWKP2a7l$QBGjPAJ;?cXNL9$dbepVmGG5ya~LKmJQO1UV9ro>Rt
z#o$bbl6GQK)DVIxU~xVJgvEvCfRCQSsRhjQQ*GO|01<pJy)vMv4716uyNTc{82{;Q
zMpS|gxUdv2&vmqw5-&*>rqqGiA8@Pev%@?z!;D!l%T4=!X$r}@%V}gCGOUMS5e~kO
zyikZ13C5W3$MSRwm<DSpUCSi|&jbb*n@(g`Hh(C`84t2UzvV#98+TXBpaY8JNZV}Y
zHUaFqVqG>%T${H*EV#l@xGlXDIKHT%@z3V(Abrtp6HCB*WtT9cmGb7&@N(V)uqlg;
z3)q0MMotF+ho-Zfzrn)LID?Snp}wwQ$|Vz3h+M<Rl%@~_uX|rQZ)8%|53CCE+G!8E
zr*Pne@VYSBeaJ!}UXx^?+<HdG6?^(9Suk^K41xm2Eyq^V9KNa-1ha>r%b@KR#?&oY
zKd%gPeQdED3m9Ide#3i4NA4uM2_I^nk?`R(BR)Bsr6X35uzwZkNvpJp-5HW3+B{R#
z_=K3sMUX5)ejO{gR|Oa=;}nP~laZ6KfxJJLNRF<yB7E&a{iZ8Y_Ic^9OhyVJv}v5J
zp^r8=(k>IR)#&8@#?=4>55-jBI@#Hp4Y~f6>g5QI+KiDNZq00_hBW{K$1?3Gu=Vn4
zp3S#;fw&B}+Xi&oy70MoET^$#04iLDRZc(=Ug8v|&Oh~XAPX%E2eAw~Z;dBzIM6_>
z_M41Wn1WGAmQsmh;}|^LhO=yJb3999w9f*C!;2FI9Rjn>9Q~v!XSvCn!0bON8l)`*
zsB$g@v*kgr+aR97=Gl-IA(WMS)MuyA$$hX1?M}s3mpfBpX2&A>#gj;qllN43{qThb
zSa1phT%7D96Bf5*QgyiT0b{kBUvNC3@nM3A*VZatf}LYH1DN5tRyVPN((dXVe_2#^
z==nLOViUh%QVv*fgHykqCP_74NP-SHji2OB^+Il`iPQ-BWtfgFvA(!nqJiu=WE17i
z7&?(rph4zWZJz8kJ}TTzWrBX}LF-OU$tvHSsq`LlX?(RZA1kT+lw5FED}s_H$+P#D
z0KCT|64lv~E+EsArA08a9k*sPT{vFEUjEKE!M}FAQwK*4Un3r>=$Sw;n=|586Oe0W
zMKgq}*#z8&0Qqtj3QjCjkpZkxpDeB_YLI@oMKJIhwq2px9$ESV;@XBW<k@fk@@-*)
z4$OO@@U2if@SQIT9FeiYRlglx-48+GN2c?WDNLJBFZE1Oh826s^McYA6#L-WGO^@a
z<1u#4AWkR7A}a9CrUlJt<QWaAXZjkIhrFr2WkRPk#nlwN>bw*d@8pa#8LKk`QLh@E
zAj+*~xG&o05OIf!t`xfG)FnueoRW4E;)K6WXK8-RNsG!HjNWe6=AkJ-n0d^Wbnsb7
zy_I3uh^r{Lnv1UpV`Ko70tIZYXc0h79pN1fEfqdoUTM4Uq#1o;p7QQY`F?)`a?U}s
zj#jxoVCwYehRi?XbJJn2`F*%Q!_jm+wBP?0<8J@@(xXU!7;1LCBetAz#il8QVTne7
z4`G?I^8-Gu7_FM2a!0f9ZWpWk_DC?tZSLr%*N|q#haF1N>6#(8U#ibiXTaz5P^3lk
zq-jQEXK#1c`ODQU#Y$1wmQ!ZOiN?j1=nHB_`V?Fyy#%~m=E|@Mv*u(tvl+_EK1hXD
zDO=*@M)}^=)XH`#>O_mrZi5dA20JvzL`kp>Ja;BDJy}k`dezr)r%P}{Q1vkLBR35s
zXIn3s4Lk@A!sBFuZq$CKIhlp$px!>;M*q7g-FxmHlIoA=iufC1zgUq@{GV9?{;W04
z4d||3cR8`gq@6ruvD=PXCKyF0ssmz&OpBJ2;Ivw6hfm7g>tGcORTIsp>&x&A9H=1L
zbrsy$bJ0<gEj&&%{lX}jYqL0wl!EBUng1ca-!8`9R^8<~l2wrt9p|tei#ov~<2JpU
z1dMAXXseFZg=`x=JaR_qCzi_aGu3Iw?er@WM;K=DYq6;V@KI*3nlXprg6|$49kUkL
z(NLB_HPr0ZOXl(bSC2Hi;!Ey5-6*C}GCvh-!@tqPhX1<eB9$BnNR73c_zEB9X4&S1
z@33M6q6qT1O5O<{DAaoM3zKOtV`P-|*nQFS5i_0BhZ_~D5mtxuT8Wsi;T*n5B>|>#
z!{zcxm%MNj%|<A6JuX;yXI3JsIuYB&s&xXkSaXnYXZE&DLQc1rwEa!yV~iG2wJQsk
z;w2sdhFR3L4q+(uQI6B42wNoW=VpoM)#&s3W`7#Zq`cEz&0%okh%=aI2B1u(3ej~Y
zvut&9>uq-u$dr)Lars$&${j^GpcPG@F74(sdQefBJ=2k@ktdo~dJQr|HU07o4xmjl
z;-X~s^wh!jel)^WX$Ghk@q6f)(&7YXI=_Dh5!oNeJB8a?d@7$)`)%rHca>{i8<orF
zt7WJyH)m7irJeD0;+SGI6m18Rf~b^b#kowHrG2CqGn1C1>Li2W$L>AH2zuhzz_kpU
z!6>k=61S`zW56l|t0D((FH%|pU*-!v@2fPG0$qfF5oqu^v!Nl)1j8hCVFrkb^WWa3
z!3|I$2zZySDODrZlyCG=!L48U9Ji;jK8(3UO!<ZUVmt`4v}r&@!Ex;i^W|-$iBLUu
zepV?+2Pnf<o^;aODNs>dcJHXF%s=|=2g^ussz1s>gWkj`bk)an2H9)Fi%_hh2<MT9
z==C(Y>|<#fgyYb$TNDJUBF?Qkmcx;O!tr2FO3i~lRZ#dJ+p<cjy1+~pB<czw`auz!
zk<hBcR07cVOGUSncBZqUdB8%r2PsjKW$`{2+k~8~oWZ#ndJegKKXN9B<qh`^8{ndJ
zI!(qY-LQ0vh^XNUdIo{LVKhyKjJDv$aitr9;A8V(Y05fHo+^$m8lq`vy(g|SQ`?oQ
zl8l8>OjlKcbePe}%y&r>RER5*(e2V1f%~PkxOpEeu|>dH7RUc+lEj+L4~Ls51<Dsn
z#VKvgq-GADy8Ddh&t{BZ4l@rGg<xm4L+x5o{j|09DCLwHr=LvuD)FdJLuLl{ynEg@
zZs#y5x(!*W;#zkF)`;KCP5H?(W6N?HT@-9&5u5%(Bv3Z*Av{f02J8Vgl~bSOFkRr4
zvVOD5DZu6~*VY)HD8?|-#=t`2N1XF*vDUKpKj88p4uI`Y=c~ztePBQL)-Z%lv)K*)
z-xxK$e2W~=(4viec;CIgMwHq}O-Lw|@uQ8;y;|h3s2SqAV8QjL@Op!+cPPucJ&W_)
zXqT)a$EGLEfM&&qFpJ}3r%RBGrNVPg<9A8^h0m_dGGi40Pr1$TUdbKnw%kXYIYWFs
ztcR%TpyHYPj-X=5Q7*@<rdrHQ4plJv_?WtMcpF4xK*Q~5>N7=kIbljZMsS`?;bc0>
zHS3a?-e=L4<pl*<AT+}_*?%#c%@WQ&$)8`EG=jYCY>q_UXs&c?G70AGA^jJgAVP|M
zQB4q@^pX!LQc##67-0qeG)aS?q=wacN%#=G4mn`6!%Zpr^7l|?HCR0ra7Xo8m9kRh
zLfp}Oqa9~3hb~7_Z|g;U|5OexPksw@OL~o)oGeZ!Ald^&YROW`M++pIX<A29Q^)0I
zbo3w;iC?IbWubF`;TyW)#%jj?%Y3d?7*&h(bm4|5_(m*BS!Z*zU?~l&vZ%CLcd`n5
zuts4NyfTMe8|#%$xKh0*-lC>{jO@V6AXZ6YPs&8>hGmZndu%jxyKTLU^l1ItMlr)r
zK{_eCtq{nLPP_f~uyrzM_lCXp#pzpDBUCOG!KT1oilnaFEac}mw(FGXf(s$b6TaKx
z1zbGP;F&B(8oOZVs&nOuUE-i#C|jT?NN90J4Gp}M;7M8>8(wI(a|Cfsg{c`)^Wu7u
zHKi6Cpf?v2Pb7bn2m#wp6WPf=&%${i#k8jrGi;u55NJ9tD}hQhWsTe&dlv0+I$E|l
z|Ia4N6ZrcC2hw7)^|E9VZ{n#77sO&8Cq*HLP9bf(kb9LZ=_qOh!i;8Wa0NXpfK%Yx
z;&KSO3R_#nv&tQ}QpB@Bik+Zr7T|?iaL$2s%htE{fYJ^(#Vh0h95pp~&KE0tu`J_s
zV%-_dLqLo3+AW)&4HM5fkXAFf194A@!oLCsneUbi`}#F4wL!)zkLp3-fvC}32Y>qB
zN}N*DjsiHWC9;qfFmeOGrE(QCa-QYewn$BF>g@Wu%j}?{rQ+2it6)I$bdk*)S<^LW
zqhe~gPTd49vSq?pW)&T8I+Y%s8&y*XiO~8i@?;m-|Efw@50w+ln@=(qGBmgi=hcUW
zzTt<x*3zlkH^FBv$}1t6#Pd8EYw)xyS+Qtr!ssf$H|y_K?iD6T4w9z2zR79R6mPf6
z3ZD0y@qBZpm{N`M^x?-^i8QS<+V0STM5QcvK$X?SE0P@xSF^DkrihCQEu>Wy?E(Z?
zN2cBMmtnEOucarI)_vzwxZ5-ncbPZ5Nvoh8E;>V^YQ6YNEQlDlORQKUC?#8|aH7<u
zD11DUHs|})0o5xb+bAU%wPEnOw8EPUKiCV`_h2IC@hEA-sNOj54mu}qhp*b_?Ox}o
z`DC0-o|vjlb0wx@E0*EEa%+pCn=J<jd5<S&9CF6lx#4}wntfQa3_EF<6#OWo0@hl5
zdb#9$#V#nSFSd?o|9xx{a&{yV8S#5EOMU)KKl#5L(<gIGZjUSO0{i%U93f5Yx6wzM
zIlE)lvRAMrbFKfed=}JD|6k>^EZ+kZ6gLLy!c^m%C_kmrTQ4DO<9NLKNX*JKovCX>
z1-D^-{uW_$hi9Gh=xhD8^+VX=2U&?nvJo1F{10lH@z=7K+Mmq9yC-)g{af(c!Ow4V
zG1gv+ej(lw&}A3ZBx<%&CqM&%TuO*;{O;c~;*I~R4kVWrfG&h@-JJZbe&)g-RVsz^
z9)0~e)#E#@9=2O^zE*?Q@ajWYZj-vlZYkzLar7PJyiR#h4)C~&@<omxTI6%uq)W*&
z>UM$L*VQbge7CvZyy$f=TCZAz_OR7G`NjPOJw@R=0fVExf3V1&U*x}E+u;y`f4?i7
zKk@MW{V!dn+K)}#hM6J~dt8CVeb#JSa`b<YuEh(9@K)wZNLjuhv*=pI2u6-xQd>Rv
zH8Ckf`IHgh9AgoykzZU<iQ=5$wgNNa=P?3h#j<&7mCOD^)h~yN<-*PXkaihA6*qW=
zqB+>L>o0I)BdWd;HHKr8{x!=2D^WgGkiRRIhWW7p8=E&kQ2i5;+j{AOH%bS2rx?2-
z=lN_2mLZd5)q=)dR2?&9bkoC=g>^TZXb7Z(?sm@NMGCmE5kFGtQ-$^RwJ@v}P`s=S
zS3{7BwTgIK!4|LWgs3p$i80PU(S|)K0+QDZ0VfzKn~mJinbBC3hCuTG`VN2Gf|pO|
z`(OKmOM)3zK#>4@$6=FClN=!Zia+E#)Pw?miGYdyE#2O-YK~sfQsU<Oz8B`Fu;j5g
z84G{NRjSxkLrbWiX4$*d{ODC9ue-6LqVmb3@2C9re|Bs%rp|9Ho`9U`tZD6JY#gg%
ziEX}jnZ8<W)W6mC5<j6$W4(3=KTo#KyON^7|G0L+4-_dIHY^F>dlWext)Wx$PZy0E
z=I2q&p!umjzwlG5>%fm3NIGxWVSFByNURkTEHXOrX21#W95?=yTWZbdW?Ad~>qWA`
z^!6><Q~tb`BKC_(qiB_$h$APka>J=I+gHy8YHmC$Tg=>dj!eZ(OQLF%an~UY14Lh-
zB`cTX+SSNlh0L;!Lr{4C$2FsNi3R&si_4emS9ax3<+e5rkh~+GMzDW+#J)41SnW?b
zDmAO!40`=3G~^=Hwb?qVqyDEq39-5v!jFvZh2ibZ03R`QayE0Ph>;XOt*_oseSbcm
zrkg#Md8&t`tm*yr_gCCAR&}Z>k`I~9)*9ujt1Ut6<Al07v$_E8EB;7yM@8NdW4325
z`$MH2L~{ojd?mngyjjHaxs8^kk4};;@XJ-zxqVIXKC~epjJf~>7C-Na{}W!##GB0_
zQ<su7nICgov9Ho;;w`nknu)Bhv0qVR?cHEVoyGG9KV4owruN}#@~*T)s*Z2B%R1n>
z=V_1{*#B9(&FZ&MxzTl34L2Na^*y*ExYm>4!ncoL?>}xw)|{w7CVw1(-KM#^%ua5~
zk=2a;G*2t$;`3EeRXY^ve^u^eKf({r$-{SFdU~^bTDeV-h?ymTa3E-;SJ&4p%UXV@
zs{Z?U0v<vFIT$}qO<pALf_rE9I0+4_J|0vxQMnr*#bMQjAN{5}lX7l5iQh-`Mrc>C
z;c)lr35bv-bs6iO4G&$1%!iv^#5|(i@_8n)0Z^rYHx)|}N7#sdgwdX|)q>$AA`_8=
zrWu6<LtC7cJrU(<KzN_}GFuPTM1hh#1rB0(jHk48(qB=UFol;M!j61TRX(lPs(z^J
zhxh6$|FF)-X>7W4y5Z7~e6fEGfn}BjerKs*AQb#FZGK8KWs*7_*o7Hw`XHX<0dM7y
z@J}1+jUMQf{%b8w|KrR{1-;S#42PW0xA?5J_Iz!p*{Vl5D7K`u@I$l&yHvj~PLUGd
zYt{<-UnIbeyAuBN1`0;_cq@95-K1F7MO|c(jvupYWG{uY;GF}9+ew)_dccD9DLOsl
zGhO4>7+h*ZY7^VS26xc*l>ydK6i*r5H^siDxQ-IhV@#7+Ppf$5>%8<kxlF%_J1eQ(
zutQ4UW(=Ci<ZIc{svCDVK#|Bez2-C@OM5l2>%M!uT%<QQib2GzHBJji#OPhAb0+SO
zCUIsHUZI=0A62OgJY(b`;Ir(wvZ<fr$?)QB<m`bL3?niX7Q}C5+v7u5#$&L!?^ieq
zv4OzhV(D2{rxX5-*ehw#<wG3Ex{zl@s&RoDHs={)cJJ9`+zK)_3SB_y&Mr>}ot^d%
z?IT%F9HAUXr>hvg&*>bFWI&Idv6PJH9Pw>t3|-71`|fjUAop<-nz#)lI^l(Ks|PMC
zV-18<-t<tHfO%;hJm|suH1=^IEQ+DQ+4S>|@M@>chQu}^hv^oy_ZzmNj`G-+6yzr{
z%NWlWe3oNqB$C$!O|tX37oqKAsOZ(syGD{0iMvciq&g0I8-D5>%Qp*mJAH|+bW9+f
znC{f#-4oDDIq69vmxf8+q<`cb7{qx@5gDZOad>*x{l0BD78YMI0B)qE35voe&GG_o
z+3oDI|2ksuMn)V3y&#<4=XGbmXamRhgf{%*Nz)vQP4-A)_j?{a|GO)R*N;v*CtZv7
z=YrBDVuPs7*cm>jNz2Tn7(g+QNyaylB|i7QYVz)J$BS#T7<gf#OMKrW<xgWpL9?J)
zr~@9i5l6fWvoY44WYc7ureP>~<eHpBCK>-5$p?ozy3;hDBKpAJH4bHf`8jN1?^wqL
zI1=rvW#Wv{k24xF;1y$sOU@mOkS#ZrnL}BTGZVt+hC0s0hextbGEJ6*bM2G@TZ`pG
zA~f~b!Ka&o-~K*bDD*}=GbdF%w^37e3yia70AWC$zqrD^@CQt{WBu32TYeOb@QG!J
z7q?M2N;x})Wt|kzQZfs&7;JM61-hm^cI!5D9vgv1CxVU`cLUJLm*L>N*VBQsPx8HL
zP6p&nV`3i!O%Q&&Mh5fgi1dbpdwCBnBH>FTtnS%&&p*~!SSU5$r^efYhqe05rUvLn
z_wVb8%kbvNx=XA)V8Vj41~qAvS$c1(CgrIy(_`$<0Yg72T>pXa7Xs`Qxk4tu_Elk+
z1vyq&KarRq`FOnuB3!*OR3VTVUEdiqm?S=&^QHYli2;I;6nKyN->%c7L8pr3prSqy
z^~%yf?4l{q2f&lX<%Z)1j+6QFw!{H?S_uT~Mfqx>HxTz9<deHO!xo$F&^}1-${e6e
zK!@{G?s>G#jRItj$z&v&B@T8QFk)q4Y~y>2HYvs)xIeI`PXWatYUm9I4!y*XQXe)v
zY!4tP<nIKxU)dV*lQ+UOLxz=@c5VU2lhstQMXwgl7P%6ORr<7vZ<ot?{`Jnz4Sjxf
zwM_^24!d0Gf9I>oWaq_KUp+4ye`O!>01p`(O-A1U@0lNAQICK#JO=mK*sWM5{Ytfx
z!HcL^kLp8%J;eQ{)%*s`QQ5b-#D8ZN?W#hh%LTSxnpm~&;s28Gl}h#K+PJ2S+EAeo
zwE?z;udwsx<G&I(1b^bE)Xn4*K4x8)YQ7|zAQsatdsZ=-3M~*G^X3QJ@+Mx48P-d$
zf89%H{MUk;05J~%!wg_lmR*IAeuwj>-fQY`Ft1a(-sui9sYc46SG6M$Xz+?7@av=Y
zMU|7}316e^!Qy*DnV-OIuG*VNGT)Y(<RfcLLOeFtTJeSA#GAOO{Pf<&F-!uRXVH8T
zBd?5J5R4vdTN}uO^uJr09iP>(%p!|dJDxzbqmowiAzQp-M<LD@zNyJ|;@resTl6La
znkKl!%HUqx94Z=z4H=HVA~KA^um3=+{+Mx!wv6)!eQu#S1oV??s>3BK4iVzJL&7(%
z24H;v{E!pVir#87;&kS-i0cPH@<2V>j{2F>W*}OL$7a6Mwx9Zm0zxbG;LR1D%AoPP
zwi`&L!@@`X=38Bm_CrMi9->sytE3~I50L_UbiBKkL<BK-c<}WcCt^5dl>s8>NywgF
zv2zwv2?Kj+88wU|(kU9{z)&|!$v%*v$!P&FU0;}S5xo@2Dy@mMFhl~;@tm=A!n`|j
z|1?Sp;|-gW*|E<y%a4=)q5zc0a!R?Il~`m@PdvA52wOLx5GY1m8{bJYBUBdv;*v#y
z8fFk+L4elD6K1-e2+QJu#pqV^)hbc7TE!?-(%c4!^QUAEiaws&JfUa1twN?z+e2L;
zY3hxp6&y#?SKv2&<$-P*dFyhpTCu?5W6SapS<57H*pcLWka<1C7dtgmgI&$L%VsoS
z8CaT)hz}kJK6^HJtQ@FFF$aQRp+A+pCI({!gXaggHs#Fnz(9z8=+s$_f)zqw36IR}
z2|a3Mn+m+V+nDhOaKUc2wtet2=O)QO*r20R`;<l;>-MR#&DLh~RGvB@l{c!D&?tJ@
z=FU@E0MS`3Z~TelnaeZn1A{BDyt5w|>Dq@!5P6+tK1stX8nhW4KyO$$TQEf5f0Ed4
zR*#)8qc#&Mo<`c~9z3LR2gZGpEd=|@phS3R+=UF%Y6p@(rWOWR)`ux;0$w$0VIqkK
z1Yv!iS*0S}ZqspIWA`(cGK>0Aq^W`(lD34_YQ~LkO%o2n*W3`i)!1We1=FTD?spW1
z4a4J2fAwl9JzFUVJdl@$$;K*cNM_^c=ja<VXa~rj>+{+>tSQYnI0S}Wb!@il1aS9s
zS){Bz1LifdBe3SE!bf$p;1L`!QK8H9N9g>rQA5+N<EbBYQHcaz#Vdy%(?pnN^v9on
z3bivGXJ9t!BE5)BY6EvCkvtB7({vd$o-LPDs5Ks2$R1vVl3n|!CfbjQIqn<{hTZRq
z;*79{C{(Z~mMjU5B@AX)zq1i`tTnS2yD(i(AkIH&id;UIQ)TO=-RfSCLhJ3Q%6RL(
z84Lr@NtMi&vYCHLB5wtEjnjhFo_zhn5c)1DU+#f{kR<M+EwH2?^54q0wOcw<wY_Q<
z+4P#>_KWyP&F}((KT>04DVp!QRp3o)l|$8Jjm0|@4SZn8Nz=zO;SFGNNBE%jrhh^x
zfJ13YqJx7v07)<qPd$EU7F7XmNBN4*f>_ygX1(5Kt1wN1`i1x^f60?GxfeO2h%jbZ
z^-7${01UB+8dh<D<B`q!zBx_{$NCp*CY3$8P`^(nRIuk&?`Xc@=Fog8EPY`7Gdzv}
zDp-szFLSG%l3R_#_l+|P7qI)r9!VM(WA`w}#f<3$tx~7>x!bj+P#*-VtsKwduSx&N
z>3Ql;?TuwVi<{YJohr4NW&?P^Gj)5m1~5I`hRsO@dU_~-2m2+=@zA-BJgKZKkg3p>
zvSLMoHa^7SgF2;GSa{)$5o)U$0-#Qj`#`sUwaZzR1a_^BZNQXbGMemqM$)sXf&2h*
zbS=Edyg@S{QI3TPkPCc8NTHY;&JqjcA%T`YQWJzy`6a*X!DEUV=g5l2d9+Hd{MAGX
z9ij6R*i`8#(j-@^qyqNC;XVG_NYxByI+hbB%^{24GyWa`w2g}MYjy4lB%6bBS;#k~
zvUpfgR-9i-rR8x&dEvH7<>j$I^4BpPV5M>n7t`pZbbEz@AQ0t?cfWsZ@MdJBiCmKY
zvIrGexQ(U(<eW9Z;yBmX-a*IN%?tJ$NG^WTF7e($%1by^y6sP&HX?ao;<d(h{mt{P
zViR;MrgD4oO9w$_8q=Z99uuM*fRt5^^K;q+A7N08f(p^8kl`K<{MG$hH&o{~Su{yi
z<b7jb!Q#>mENbph`ui%SyG*fjoy((<@DOHHwQ-b1F=s_d8o&Z8NHQ1%F?o}us(G3M
zbX;krxJ`yf(L>&s0u<|G8+@|AX3*60EL`@YiGU`R6KP>(ejVwcSf{Pn&v%yu$t-Ac
z3!bN(hsCJvkYR3SOy+>02lq{<-qpSOU-+~*!<w(6X<7x1svpgbC?3hi^JHP{ib2B)
zeb8(j0=x{gdAB&&lX1;leNi)ZMHb_4C}El?aQ2=!XGA%cd#dkTC*Tx)Y`;^_Xd^}%
z59!KJ7GOC_ANGv4{MCP}`)c=H5V>m*`c)OlCtc~3v!7+-c2V43OpLUxrVJ`$aSg<5
z2iEM$s6Il`Xv6W*6^QkLEqWvHPi6&GJa&q4BY%g-uP=_<oS(Wj&C!cQevnN{)?Gj4
zuV}4kmKZD+Ne2xbUb)_3RN28GGmjA}%QGjuQz-Y*YW>6i{rQ9+zGSv?zHfK(#c0Q5
zK>ZEBu}eQMUOdOYdw>3F*Z+5S_t~HSy#MECf7pAzxBud+ul~IMjLPkO_3XuqKSaB~
zVH;|HR`8pOqCc#zXc4Z~lzZU)|DiuS%*GsL^LsG~BbU+s?(Sc=_ILO8n^8ZWypK79
zX+NG_r;~I(&!TT&z*{6AVGO;Q(h)>=3L9Qt8V^vWl{1n(>{EtYVi&XJBE3?-RRAC4
zY~;wZ72s;|<SOM82qvIh(!Fr99&ru%LQLD%^48?5Zw}AcB~+!Vg&%uvnI>gA7&%Eo
zDmVHxS(@}bQK@aYV77CkI9U~kI?)9Y>(MEJP9r;RFb9qjwK_%4M#OTt_hGe8x>f->
zdJ@AWdAqJDFz&cPF-@Vaj#rxZv(OsT3T@P9wZ`*FWO*YSt!!FpRNS!^=PAq*Dcvz{
z^sO<;?}+W+xuP@sv7+LAILqAAT)clcNtn>c7P;}chjXJH>kJ8-=q0BCr8Z0<U&!zv
zAyOikE~+l!tnk;%4~*L478Tz+Cco-@fh^YWG+rVl7gkrEYY&*~f8FUv{qD)&O{>?A
z==Y0W_xsLq`#3s$OE25eQTO6)uk-5lAbQ<BJ#P2<QS1Deo}LeSox{sPmmWN6^{FPO
z?Zvy+`P-=d!$q&%??>HU)H%C2?GQcsK(BQ^=(PLIsB?aFdWk%i&4_43=iNbc+BxeC
zsMw&}#CJigTr=vPL}%^Z(QEp%b=W!W4Bql5PdbBheC~w4*NQG$y+P;b^0d{9E-rf)
z-9A%8|BgHTqtjOBtbM#qZJ_T)?eCFEtN*%ndRpji_sw~`hYkdNJ!D#^oz~%LTRum<
zJ?`|{M+0=r{dPoyNR2$DgXf}s)WI(#ZBdU}y|+yw%V$;hyx;!&C6%N1(Q)gn^@{q~
zcwlsBhK??K?K3pId&23CFAw{J&fs#;j$U=U$2{!)cJKSnQM-Q-op$>?aGWgcxHV|u
z^PobbMz87j!^?gL<Hv)3K4|xPmluOh_k4rq{0)r|je)?VW30R9+-DlBZtpGVVla3r
zn$errZF){~ey-gc^ja7W68VX*@k`QIX*>sBXQT7>tJBV__W4m8Z@VD$ro))xn7mFO
zWjgZlH!b?|CA!a(Ms1T{y|vursf{`(QS12o4jM0oL5-F~zoW~Cp7t+~UhC-FEb7-Y
z<XavNdu>`X!`EN@k^W3)iTA`ymVP~rk^3{upiX=JIxVDH&$CIqNOO1-6-v`K4Ij`|
zHBCqFW6t32o_~`s$0+(Td^Aa~iqC*k7CvLw$Kc5%rOPG{pRHze(2c`q$zm}pe3Y1E
zmh!@<^W`l#+d^CJb51(%Kbs{>8qVboNjJr^JK|bWXz4006lA#x&oEn<tk<pY+r!h&
zVgGG^&^|j3i7u1rcqbokjpJmR$v0uZzy8AJ)@CPk{*SQ=vk%oYozQi|KAIBsBI31|
zl-pHYg%xc+*g{2rmT5wsSdpF~TB9)zd4=MSr&IB@x?04d9rhN}I5(B4?(sd{G<4u|
z)-;*@JS-3KLn|Q0*y^SV#o{q*w@{E%h+CKaLOB%(QE+Ed^8%|9dj(`7cr?((L>zdo
zsa>VQ4ttx2pPVIL%g&P}Jjjg0YZB-8?3){YJ)N6oLTilx1vS)*(^8<ccGYOr=85f`
zsRrE!X9r1^brrQ6`n~V9Q@roPg2W$8Twl(J39-sXn*lOK&Dp*9;T48elke(>PUSB|
ztfjC(wJth^MKF&S?<TaBv_h+Y)agXDaOSspxisra!s*R5`j|eGjU_H{;?H>%Hir8-
z-?Dx_*AoufTmauH_~;_O^VVrE9;bKFva|+Fh7vo*NA>~nggFCh;CJ3XdKmLjEXu0k
zQJ3!bJ^!;{!$fD~=0kWhqe;T}2q{r^e8FaB!$2yfT-3JF6259~DkU6NJ@uF&Q`*E<
ziz+l&tkZa2xC(CLz3>UnqnKu4_P%hDEJiP$^DTfQf)l)8s$`UPB#wsN@2ci!*DFES
zdPRw?J#oPjBZLW*;=9XahxWhIJwNHZ8XmV#T9>DT;p=}GGJCrLRj5*N=3!?o7OS}g
zC)3fMjJ7N2opsJVT1>B0r1e9g$XC0rcX%s#IQqkjb`Qxoj=mcb7x*1Sz@S}31j_kw
zJcpEZ73an^JziEejVPZIcO;$Mf9~G*y63~=L;W83$GsQ!<+(u04&U^MZIdFxX*NJ(
z^TqQGTa*~FL3c<TXb-lL_9^j?!=p1|;`Utk*qS0Gz@NPW8;*3_l_d@@PrrM8+#8+}
z`}1tymN@NdXXvr^h3^fqzR<e8OQ)-8G+}Ea%Zz+&TcEjZZ){rK6XJuob3^+7nGV9)
zarEMOp-}61c-%QT;db}FZ=DVg-wwd!@;L16ZWPD6bvbx_(dzeYTff@dFP7<Do)0@T
zSe<{gqvvi6ddG*uHhuK0)%&jW(o}6<P!n25-|=wJvg2~vnim_vO4)nyu3|wPzUqU~
z=(PvEx3m#Xi52~dm6I{2NxM!yAf&^psnuuQDROJJ(gk(sq(ef*lO1CEb{4Cd#B6NO
z)A5tKO2j(%k#9yHOMRH7^KES5+IpAgogapMDEkMPxwEJ=PNpOclTdvUtnJs`{s4wN
zo}vA(UI;?k>;`8f2dqT5S-xb6*y}QCb}nqa=Uk2U*5Jjkb$r~T=XgxJ^Z5($?eKk>
zHAJXD4)rX-M)-j*pY3n(CA{Lqt|sp<I|j|ao@a|?ks5dFg5;8rq~F^$L`|1Vq|M49
z`H<U7OWQvzyhD(LX4)mRiBISNcvf2YcCnBMNT=I??!5ualqC5*`R6iSPLf}vf8yd!
zW?S)iyr942NZ*1h?XOSV-AQs;hn6u3>LjubkKP^;t^R5Ejkgr4ik!6igGjE7quX>c
zUU-SV*>K2F`yXuHU>LVoxhS4sWMHn{s<a@Cnc7}VxCx#zn2in>)G<)jarT`$pCVzf
zM1!MUQG-qcC{gGXf-C8Umu^{*3e+zNEGB|mXSP8SmOYnLD5+izL7XvcD{^bVg3QIa
zo#H)ysX3%aW_&EPZlQ}&zw_#{-`lGiICjp35{E_$gBKhfyhdo(zwVsEib)rH7dfW}
zbiCr|+W+b+o*>v>MO!$(-^ylN(o%NQVbzg>av;twndRwwQCdPRm4o3KBat6>!keZf
zH<9kV$kU~9K+IM-B2M2x8yRabAM|*lsmrdQZWMFN7mD3<i!f9M@_{9W%{3FY0Hc_9
zFLNX|GMa|RCwKm+`(}82Ie06p)8`-PZe*7M&HzULOQ?ZRlrE4z58NaKjBr#3E#e-|
z+R#-D`z_j5bWiQQFt@?Eb#2c%iY13OO)1vXIqIIBL2I%bmFd_drN(u?o(vys=NFf>
z_ms@x{Zg}MV-w6oW{S4g5$IkHKw;k}U^Ih{#=5>-5(o2)#}%1^vQakSne6OzsU;F0
zul%%6L^zyI_we$>a3B2R-MU2al>p^4F-_D8TVt6JCs(7ze|i3$WhP#1g4Tw)wP~Bf
zr$fn<n{p10jyVjz{v*eh@zEaN$)};Uok6(bajxjo8F(!^*NJWEz4H1*cZA1xoxkGC
zLqCNLx)<;nG7|!MEG{chCTzWgEE;_oJ^hc}r~ao!0Y!XLxBvG1sK8Ij$3gWPa&Ue>
z8>#o-v;DKfKzd@GB3=LI(7p}-e%bE5r5TDEO2!W8^XZiljyQ(E2nR+$SD69M0!u)(
zXaEW@)KZ(OmrIJ0Kw?BRW%zYENodW8s|vK@7Bm8WCVXnD8IKrLW3&G<3hv1-<@g8Z
zHD#6y-sd>QIN4{PVHAT3>T$$E+_QZNd>D_TzrHBqrMbxD?3#m=GW3*f1CakEL`CA3
zXVKpNUue+tDkhIU${YBo7d2{b`!E0cVuQ!H+dYf=BT#LP0s6=xDx*n^v$u*im8X>q
zHn7aa;T^V1=crYdsPOXe6`!L~iPOMKyWf*Ly18ZoDa(^jZ@G!oLiV}LRf@=eELMjf
zeV}c^WlKEL5>P>2XI{7ZuLn@7^S}_xd0Lb#S(`FTr+|%f)UI)L?(P124K2tJT@pb~
zh?nX1qP^`Gdw)?{D(`r-CK(;3-c|F3sE9bH1ZR8PjxN}B(t549G@3#|8sLR?OU_eX
z<tB267Yr_8VkT6(VFJYgfFyXNx@Ym#aL&(;MW&<;e|dWP%{RNA$in@4!ngbru3D@K
zX{>vG`qot5+X!mnklRAoPIc|$_W4^ZPOZEj3QJFjHQN&XUv+f_>eAZJHo|6`aVB0w
zB1$a?VX6PEW8?@?I?qe}kH^GgRX5?{^00q-XsUiyXu^~E>S`-rT~*gT@Ai*+or{5~
z{URK@S+*r-Sk1^258#IG&&4k<sO#CZx@sTd$O$oc;rIU{x8{>2eV9h9x-Ql}%qCjr
zuZ1bg-fdyc(~_(C^q}QtY;U*NYN}4>?4)L~^}i!Y?5um<!NxN*WX0)#sZw)IbqFLR
zf!gZ(eswUZldPucEvoN2zW1!q^U-9546s{q{;sz7Eb15n<#l!)=QX2#-eoO@t@~AJ
zsl==0ZOtxey)`Gc+vK8{KwV<aw@fy0Z`?~Kl|bfbCPodQ7b{3<JE{KkReSJV`)%KT
z^3SrqF7w2rk;Bna{9B>eqqDNSJ(V5}f@&u$$-iuf!fAF7#$ME=M=}xB=dF6yGIwwV
zdGr*q(aYo}TcpLykiLu|d)4i|9ik%_ts^&nf8D4qhy&4{XS+3pg7bENucj2@L`|9f
zx-ztt+sA&%XEh}`pR+0SyrvNDIa}zfx^EKe?l!{yi<)AGoxxe_!WR2;-6!8(w0pE8
zy-m6QmzuJ#+Fe_wZUQu%)?5m8QxG29&+6tNxEY?+&4RzLpVdtOt3phnx(Q%^S#NZo
z)lI^2>-<%_*S)mc>sj4A5dU=EK7#Sx7Ok6$0bMHnR#>)fF68d;oBCJbHlZHj<k$f>
z2Gwo%<RmI7^-(;9QRuo<{5;x=>Wa^brQftj^iT~l3#6trJoh2iimpO9`NdMBfWaG?
zb3y}$_?Ym|0ZGQ)KW%-FJ*y0o!LxAT)UnC@T~S%NY1H1^sIIID#4GCB3y(RZs=E0E
z;qZF-H5tFy)T*EdKYgb5thyr{S|_E9dw-dV$)pZC&o>I8Wa-0kdS!~oogTC<tv=KI
zYC|;OOTYq2%;;3JgKkF*S->hT;BjtO5G$olXQD4QBp@lv4YDT|1sayH)1IJrR?%~*
z<3Z=orD=fwwF^{dv^{7lvxQ<uKKP@Iy`?eq!ea|<IlXLgEB@kIks9O?wRu_q343b;
zE3-_>@-&u{a~mPe^Hm})a9YerCbh%e=kuN!J3G#PP#zbk8eD5Tkm`FIUOQZu0CRac
zOYb7$Y-9F|WWbQRrNpa*>Fvv&3zv<AF|v|XVi(1ST~CC{4GgCFsO>E%<^nmK1m5qw
z|C8JXIk4@vW>*U(oKH;Wxo*Xi3{I7JY_jvIr-McCn2xK~r)!wd`)b1@XV|;Pk-F%$
zhZoQT2_?fQirRBzFqT%cG0EFYEC()JMadHmmHpH8#SB__;#f&h?vBcanJZfuztVCA
znTyrcPJea9FdsFY`<@p*-55w(DAfKcqjk(ZvuP1=S5UciWZ3p+>Fn>;(%}<2Uq?!)
z)HL&#y6<k3$f@$pu$atWdc%a+Hq~Wvga&+yVHXjj!y^tV`4MH>0;7JPEDdbml6@Dd
zmjX1bU;wyD`?{!Pq_`Dk^DHw9S5ilY1-bL~4{}=U>mCH;OQ{%da)C0RRvlbkNv8FD
zqu4IalEQ~r?d3oR^6<EQcqs?zzV5x=Y8JI&KcQtgPOerrwTsf$AKGoVuPSUNz_o91
zFd2gr_3E9vgcO+tRf#aiErCgEZUqJnu2PDa<<=b#>!`Qh{$KosWJ2l%0$lJ1d9W2W
zt!7=Se8dcVfos6hG(4GT#~EsvvwANdyE6T#MnCFXbig3{SW57~S=SR|hha`?cSFv|
zF^kc;AMAX~kjB@m$>jdg+iMd#P0W$GaurV&H<m%Ru4)^cV*~La*!#&0Dn;d{jKRv+
zPCur73P9z<0@Khk{_naL4G(+W@7m|=>uTk9wJQuH9^1bU*y6vQ-ccxYF(I!{^1g1%
zSu$P7FrHWz73pO2<yJa-6e0KzJGrfj5cckal#W_Qul+exu2rAjC;84S<85&Rug*`+
zwH4q@QJd1)4*mC04Lk3icDq)he<tUPcT_rLQ8+THlh3C$Pc+wj7v&D?j8(Vyc`~`)
zE;p}pJ{)w1tey9S)@r$iO-723#QOERQ?Gl}Jsq+Y+!Jpj-%6Q?+uUu;(bi&SPb)7i
zUlwtPhUl7iOA?9hZx22G6DL@0;g6MUpo1@|9iHz6=b5v&jj9fR6<M}FrJ>4%0&>Oq
zJ}B}p%brb$EKOtyIwG#(lU6yp4;I>>u~gpr!`|_sZ@GA0BU>Axo`*mX$YMtPd-M<7
zM$E<Sv*Kb)c6v$={a+%+HNKo=-ie^Z7tk{}j)CNif=JFPTn3X2m!lt~E_xVd4=gMn
zGIdqbsw2cIMe9AlP?LY6Ra;pW>KUt+;XiPh!I*rz$Y$`Q@P?+6g0eQx<ZCXmRLoX3
zHkMUzG6j^q=UiKmKC6l`INw*MOaDNZfFwAnEPR0wmgq%PY>|v%B(JL`;PNc`b7UsK
zI&T>5fhf<4>%w4LN+5iN3&Y>l3BfbVx>vlV;93yv`$W|U%yXfuO9D8WZi9wc`36>E
z8sBY6jV%!;w$wF(>qi{iY(wHIZ<V(fQ0e#1h{4^Jl?Y!b^pouo_m+42(kQd4lp#z;
zbaQ(m2GmMgTvUa~ea9AY21l_6u;UAfkdPqhWGAM1Qcp>Bde6l4YfTPSMaAqbYj5Cr
zEI1BTrnQy;JG!Xxyx{R;5*%f0=*(H#lo@%{5v8*hxMy!i|7)cv=Zw_(C_)I+NxoK(
zwx$TYP2$|IXmssb=E(^TL6!C|bFp#TaQ*pY$gkv>;5k*eqr~`n2*NW1&_cosB4`pC
zU<J3}!yaBoZ8`bAMb;bdhnHT2Sb##)Hg}5kRh1r8x1O6SWQmi9(fU*q;6OZ|fQd{H
zDC)2}z24f|ie7^ixMlAVJ|CJA>UyPV)M)rns{F}b`=||{%L|ddNZf5k*0~siix<Kk
zRMhU1urqv3983Ro>$`T-Hn<Od@76U5pqq@Bzozr1C9q^xwuDWbbuF>|fbqJjHlD#(
z<UtCZ3tRs)DIB#fTA$Yj9#2-7g$sbkQ?zbty3XEN`rTj(xnl55T{UgNki9J|o|?77
z_Mek>uj#d{#|enAGPf7wD~U^aXnnVjn~uPdRXzlZ<JZV-@&m;O*XD6n3kE3Sh&8zK
zjxq)ZW`95^Z`o_AdcU7{hbOJhX%|7J{$7`TZY%rLwIimQ*pk>mf+tFc+CsXBxM~?g
zWH|wR)@oiNM6wCp!LK-Q*)6tuLh%UT<?GMeO`UGrN#zW-WmHWE{gLgPQPqRgg5zCu
zzc*0&Q@z5>NvxOqOSDc7X^!QcMZAQWl>ndJ6`n)pjXjj~i08CbIb(iHhKF2T;b4tZ
z4J0ev8BH8DdDJBq!YosRW9~TxrUB@*HRsusg>e4`dYUA)DJVEZPSy5AoVhS`P6Z>O
zYuRfKp7aJ02N%3?0R#qQAm(0z&4*XkqX^O%5)0_92UA-zth0}J2E42^zpW+cX5ugA
z3<*dXy>l%AoxH#DKDV_N@hlg_h$fF0XtEYm$E|RikK%cJl}@M|1qMdG#Al_5993`H
zY601`)&bi2to-6BMXTCuPzKhMZk%acHET?cx5mCPw4#lxIo!YUNZ-s=es`S+M3C45
zdq-QklvyM#J4wo^M>IR#;h=NYhVn<8<QZ+uI4?`)V6Qrarr~R7L3hJv1KQ6X?+!@>
zo{L^Fd4xz0X*t~Gtwl9pj@iSjdjS`mNW9ihvzus=yeEb>Xw0c9u6O-Mbf_G5`@SGS
z56`=U&QaTQ>!fFITD@~{56}FEz1ACJ1Z3VwthT)S5d39hCJ-pFjHh!u5vw_py-8^A
zyxgVB3*Zm*tpHo~1}@CUZRo7M#(VEIklX8p_ww>Wwz;^Yw`R+9>qEQ{ms~{UZf^&x
z?(!S}2957GqK4-0`hMdJZ?3-UT=2Zogq^m(Z=XibSm@~6JcwSL&;I}K#dC*m?|sCP
zxrlbR_rG!s!#fFAjxOku+uM0=MzO_i4I-`yjglM239}LBT|X|zK5m`9X}#@xqvu`$
zw&88ReWW5}&tsLxY5tD$varKz#dmqP9C!NPozhh(4z%<abawtes3`U3bsI5}!}i(5
z;H}rJilY5DtqVFXq;-SSz7cX;E9Bo;dThNRLWPFL5)P&`7?a}5w{3q|if_9NZ$YxG
ze7+yg=s^6KMB^2$@OgaC1LH5}7KyZ-f3%0kmuDB@hr?IlXTx_IpK88|L?+&OPzveA
z@j-{e<vIL&c8iY@Q|W(6o^p_-ejv-HTREJxx8m{7RkI8q?LNY$hpprP6?V$K>a|Z>
zhywGz71nDV_PeJ*9x>}of}rmd3IKuI%jAY{n~w4a#KTDXMZTwO#;_nXz@qVK!%aRJ
z_|GJ4EE3lr8(xs)mQ(ZcGs3J(f5B7<1+84v4m2~PJ%M)|VpLKJ&{=TSK4X`$)7Gou
zY41`mzuFQfmwK7im1v!ws+T3)gX&71cT3T}|G{i#quiul%5CrtHuv)TE++D{E!}AB
z!Xu?rw|809CRY{x6K9sn&#tLD7@S6pebii6%D72Ct0}0%r+s){(}&_Ct+kdQ_w1{h
zo_z*E)04)FDw=Bu(A>Ab@2FSbpLrYvVLc7+8afvS#8VP~bKLiKE<Zl&oYF0%@09&`
zeK|PpzBw;@%$YazWwfpDhpJ^J?xCuDU)6X{ViN}zeoi~he$sf@%reeg`6#<3a#9H}
zg;91D!{c1D`Gfne8DiurHlyTX%*gWGKXJm76ow8Oxa3{Td{w~A*yqksJvblSd&JQd
z&j$Mzz9Fqw;PH)%QOS2TC}ll|O5Uq}v8Yk~fnRDUR?s@RJU#Wum|p%;?AR|ApRXWy
z-hI<kr?bFy<HI7J+tf4ah9jA0Bn9%rKMv0L>&PUYgu@`*$261-!eem>_-<R?O0cb{
zSq^U83hN=9$i0f^JavIqf6j?{S)<&HCQvdg)NCM0b=e#UKp)n5@}=f#NaR^QmF{{k
z>h!C|Y6@!yd-$-@1*TH2JIh>Ds;WnV8tkallx-$8#8G!`rIrcivX!v&{3^dn(;4<y
zlpqi#Rm&^!+>-OwKqy(pl9)}21Xc@0Fdc=rU_kZ2(l4Yz04(_8b=1}Aalfv<N}z&X
zWtJMCvFAv)2NT7OByn@u)@)o~o8!IsPqt*blsSSx`voJ;#z4WLiDoV*z-XDT7O*FT
zM>V9tlOP<z6Wzb7E@@y&OmrCBnkq`ZYM-}zog?GttR-(MO4<Mf7xYCX|DTGI8uZ`?
zby3Ml6;1U$4I^vvijo>5;m2!H$=iyO|1d=V?3eslQBnXAj*VNdmb|MfiJM$YI+xv~
zdXyv(!UbAU$z}B%(FNb{TjyIYIgJ{E_{}D9&7GCpF@%uf6KQ?yMz>%#s^)>@Gi~&q
zn_G<{Vp)}wbn~kAS2HIZ7Z(J{kq0r#d>!iO@~1oxI1{5qpBgv4<f0WHsvv}3H41C<
zm%<YKC0J;`_>1Y6V7>ejtchQW^ZrY5dVeX*;xA$MShLa!g0)^Hp2ZH3s0>HV8PNa*
z9dwXHyOU0@KVbY220V!jP&O)}-f#rm>F94!;rWldKSf^)B)D*qxlJQ%VXg$j>^@tG
z&)sS!U>)k+Aq0;W89=QJ7ODlO;3NzrV5J$fkM;>XupDfjpklyYK!?|gjmCL45!_ty
zZ{i3MgVy{pIKrqsLwt59Uug`d`EY}Q(D~Qsn{OEi$znZ!+=zbpCHglrK-9GvV$$<}
zm+~7sjY4tyk<fPWIh-$2&0U=@<Iy|#-6f1!kJM%{<9J6_Djkc6`XRpm+HZ4ZcA4R*
zIn0{F1PUnn@83iVwM)~}7_O=C$6?YOGO*8ZNWU;{!EmF=&_Ki0Y=LZQ@TO>>A5{%#
zJp9SVzwnWZc$SVD+uPe4(a?WVB1gY`-vUfRzlJnsVe7a2!Kypv1g2n!=&#?BxKZFm
z+!IZ0+_X?J^3h0Ae`Er65-TiYv?C6$JFLl2Lf-Ze6-rl<CHwjsNvVR9%=iQKg`j+W
zyI9zH{8+5Nx}tsMYYg3_wj>{k&s<5H|F^CJpQz7m1x5n!iki+pkrV%kpCwx3r4$Co
zCMFdSq1^eoNtG`odmxIL3}Jv-jBkwRkq`c-b}UY|tJaJ6Kr&FtQ>|68mS&Ixb>(Uz
z{$zCPvIu*rt%XEG3UFH_KdOiz#eiIr=#$CyhQ+St_DNc5<S#MVCxsfLF$Sq?xTSzm
z2u)_duTDSGp*2ptKS&<gGEsH$Owx!-x@yz-ZAFCc$iZ*yIj}O>>)6R99$chL4Wze<
z;92vKzj#iU+tRNdb&kylim&xoT*S=FmPM}SS%%|W5tM@lY0f5Gb{&`ab(0-b5X^;C
zGn!9U_`=>Ue*tv3*(h)DJd3MUJ7S#5&Xnn?*)?+Azi_(|$y5uAyM4#lmH0F)qC2i*
z!WhMc(Fr9G58;w!koNfzOx1^-K>!d~SMIDuA`h$V)=}En^0X2)1skxL(0`&ot^L><
zI{nV8bD<(+{&%CXq80q&`Ea?hmgGkC^5xp*^Ee--CLB~yHq16^t?v3Hmz~hIsT<kW
z<qyNd_6h5|j}MDVoMK6hQ`CYqa$o31_4e;U#j{Sg>gjO`(7dWQN6S0=m~R=m5-N!#
z*NgauEAWy-idBDAg${nkAy}|BoJM_`EN`>1J5P+s-kc(QP<f|{cWSD)wmUFv1n(^y
zr9f(u-898uo+zL`!v$ito`_xZxbv#rA80;odpyY(IFm4o6?)E(IqlszP;_u!m(9ke
zoBdNdA29VBjj9QWHq%V9P|5DxI0#Akl*}SpM@hcV4faTZzE6o(<U`F`AW@cUm;8<)
zSl2>tr9VjbAzD3|zlS<pUY?rSt9m3#pOMvH_Z4}Iw43<1jwqnIhT#aGCDTj9GYDa%
z-djGlMJKfEq}rpuhAQoATE}5W%7gMr4Y>sJ*t-WPuAvod17t<1Cxv^6$yL2vW)HT#
zxWMH&s-0DHSVfzo<=um8$bRh$>+l~>CX5?sctk~Ewva*R&=uTY(m{2^O1Ck|t^%k8
zKL$YyThZGncE)CnSoYX6phH)w;^^SI<{W{{aWWk`!fs&CMa~i9K({T8h5L~~ix!_>
z<i~^erHb57fsLFm6~nB++@Yc_#EtSv*Vy!i)$1;gd}MD|^$r`RV>6~C<-P|z97feJ
z;NE><7&H!})O3g})pPD{IgjD>CoxT0MGdvq<y<cl9OYQZxna@tJ97CLbwmkNzr1Xi
zB^D*N?N~ZysQuT(_0d=vP7*$H!b?S8g82hWy0EW&7SN{eDt|80^(=Y3$`=Y0T0?N3
z#R8VuKmlm2iv_%+HHx$Ap<b26V*VKhVErMZ>K9A7161$RVgYlW@qJqL(w$sfWSH>Z
z#ggtcidOt<v4A;Y7;UuFN_!w+nb5Dr0^XHKoAR!5V0}goW!%`}{4r043h$cBE9lHQ
z2hWdtyFc+_`750hjJF7I;xD7w3i+jz#dJHO-LoK8=<BGp^^Yjt`WWqQ{WThHiGjkk
z<3NE$Rh|@fKaZXwujNx0@8i~?lPj7<K~tD43I8!0#Hr>it)|_FX2ZDVxKc$yi4j3<
z{v!UWuvRKIbFxuRO(EHi7^gZ~#2?tm<PIRecCH*;QI@sV9Cc~YAUk^+xWmQBnf**7
zWEo90XgITek{jH7IAyg89iMrsIu$y24Rt>;);O`Lu%IQxq-?!3nLpi3a57EFl@!SM
zn^UA3mRj@W;=mPJ3Yo2!Xk7z;nv2O4`KWI;Xr1l&uBQvhxU49~vn^`#)-)Z%Dyaug
zjG*Vqgf*qeDOx@W{YL(?uruhA=5>ju-VJ?Vm+klRr@cX0uL7&<T#ZQ>#ixrjd#b*h
z3LvIRU^>aRk)T*seA77HnBnIuaGZ&4i=_JZJU>e~ushUG(NL@VvN4+JPRxv`F@kDA
zqDnPl(`NX3;C3K}RI?)sf5wy#oJPxo%iXb`&*5S2E&=L4amZ<As%h0;n(3(6lBJ;!
zv<1A{#+liw*2yc#T+97C2tG7eK$5yHcAZ8PZh|W6nEG^k`R(*RZ{#zP^;FUEb+i{X
zvdMU3O>E|7v>!DL-iXQDB3bL^;+_`IXoi{Y#+s|suy%ahcIS%htms5yVeg#{UnR>U
zd2~YTXQ$iP2niPX!2|83C1~=k!A9hA6!T$Skh;I%pf8v?;6x5zKO@gZv~ILv+g>tf
z-VQVZPfa){j-L67orL9-_4Y+P8gaOTRYG|wZ`^Uu4z+RU!y?P5Lk;S5bu1cb_C8)T
zr_58)TBI`w2}0?g4TMhpQysy$)HW9Ew~>@O2;OK~<f$x9|BY<9Z=>Dtv8=h$<M&C$
zL!0ci^jVs8li!@4|0+m5joppH$>VbD@F}CwaEoQ+s{sO6b(G;r)vSrYB4n^}g!jtH
zF=v8TnO=7$&WbZL&dgudYZqy4z;K7jg6z@8Ts{k*FbZ8I_SR#BEMz0%QZ(_RXa+I5
zq9@D=*h!}*_Em`y_DtPR3ThdH4$In88yNAx!KX5^GR89~7lA|pwkP{>A3Tq4o5Bd#
z{TtS~^XvSOm1_K2rMtrHauA|KcUUn=1~8k7)B}luc&(2K?L%ILHG4s*n*A^x)4~eY
zKJmiDEy;`Rthw9Nl*IaAW8<Kz;9arcofIrA(ynrIMoOR=1nSDWR6?^1vo}fUa_eiB
zElefM8gMe@)gng(Fq1hEfR}KaO{2#Bl$KGx&9c{1^Eq?i=+O}vHk3t#eS=@aX%&TY
z=PX;Jr*5Agbp_9*^+w(MaIeK5T+>Q+^`KtoeBc~s+D`Rv5@*%bdu^>sVLcCYxvuIz
zIu`(>d{(R~xs+<Fop#Q@Yag@a>$$ox0!^LTh@<A~2!=SezPSlr(*maRRk;OBVa;H{
zM)sm&u=1q7nu#4iuz6T9fA_!_+h>RUK`;7?RGeNVW7N#Yxv@A}nYWI@-!D5y-|^S~
zTKKq^3=GRoJD=BgLu?{@y9GKBENtd4A_OXPI^>v=i%98RifzM7w1j7p&k4~qY|Jpl
zV7QQo?mMTJVBUSQSOuXomPW75{_1eAg(m<TMthghh=CkD&jf7Lux(z7rC$3);=4QN
z662#w{M978f~8WpmKk(TP?#?l*?qx%Rm?}NLFdR3YbZ7Cl=42DG|${U)-j<(Ok6}X
z*Qlde@txvj;xk%>YXl{~etr->G>fV9g2w!7GcyNfU|GIwaDY`Rg29ap5|tkEsBc8s
zVy%xS5jwe)o4Nr(N-V(a4Mdm!UqrKW&4HD((R$b>L0g$-1sZ!Vga{%!k&1@eyb*BQ
zbhonr<I7kq9{$R*q6>+&Mt<f_aWK=3AnW02u1*1xz!=*CxsGwVpX=aQ^C|<(qXg1M
zX>`A{|2M69Uw+%PQ4%J%iYJNWDv{kL>4N%kgHPjH=LRkk!E@oxG6S%AlPqO1K)gAp
zLM%gXZuo4pVcUFOI#7prt2XmjEqB&qvpH4-6zLZTj5FFa@j@#YCXqXrnlMY7lYvnM
zlBdK{NT?%p1Z*V=YePRQYSAW}^m+2GRyT5qGq1I}iT?PPuQ1UPBMQ@4%>D!E%)0ml
zI}YuUlzGAg$cQzD;N6EsW_`%Kx~`z;+p0Zz;1^Zq-OYFK)}H0xmhSeT9JPXq43$Us
z*&N;X$@`Rb%@<iVX;atldCwlJXA`u&D6l<pUK)&&>W!=F2%O@^vJ=9+1X);EVJw>H
zrT{{yido!VCX5XeUN(%eqRbW+jP<YiItX~auVRs<0K(qx8SEug59I6=f%bc9LTc!b
zKVeH3>mGQaO*n>-oT$J$F(0>(ge8{2GiB-SAH&Q5=QwqZP|iuCyLY1oTSPS%pQ*Qj
zD0QPYrz_5dLV$`XB`l<Emx7g~B8NOp$4?z5QLr<rMvd=+<0~C3WQ>LNZL~Zn9;5~h
z@SSmQwmj(Zp*c9EI*E4a!s%kX>KeK$B7APd1{2Y%ypkhiaEXT~ec%!L&epa7f?nLd
z+#3vdv=Pu_l)jKy6o3N>@}6Y7;sAO0a9v#XUx)4bAh5>;N^mJ`4US&7kA)7J;-VBH
zASZkG3k(@mKRe>W#uM8)HZ@$v;rRW{aJig>dZZSy9Z0}C7@RgG#*SfGXrbmMp^vHP
z6b(nKMGmDDf)n^xBZsIbzLbkb_ahCQ=f*H+Dr)^9G$e~)5KeV3Lur63hei2#xlE>W
z!Gqz7EY(~gF92=J8{!oCMA$aa6TB#87ak|02{xHs?~s(SP55NcoT&?&ij|h52x$2v
z6W|>|r;g`*7ahB+MKI@}(b-mK(5K7D9QVtJcefbsKA1!=k;%W<KkW|ss(#nh65F>`
z`)ho4D9ts$9QdIi-ue)Th6*(>&X%L;Sa&F{=4f*>UfjI*Od*S#(LqU-W@278N7FHD
zhLzI67nR=-6bjWen~!c9HUEKKYaFIS^J^f;!#EI083e|uy!{K%N^1yA$3yn)DX2?%
zVUAW)(aTw_iZ}svdt1z-5IaLtxBXBMQ9py`m6nh&n6afMPHJN41mz}Yuv`DbVMkY-
z1j}*|d<Jh9yOqw~2VLV}<SFxrw%1Mc#VC{iw+7@HJ=MdFDVR;(&9V>NRhYeQJ;M!i
ziSa|!G`7}dCi>M|E(cY70(@WPE~)^Qcc@W@H?Yp)s@q^5L)^rp%mJNT)me<qNBs4>
z<Fd;MRj0_;jP2&u@ht}B)@q^csB?`#%O5N_x40Fo`(X{vO9y9Z_|%a2IAZc(xJ)ZN
z^uA^Ye23Lp0L%;SrQ*#N+}WJ-Y?0WT5?qGKPU+<Uc&Jm}OtQHyS7bq&P=)R5N<@P*
zvhax|U^<0+SKFpezT%^%H!qKsDk2|1mz3D?!_%|w_wAyQ0(aF#mg};>kNQFpcTRkm
z+k|iUxCd%XHWwC62?ceQna_r}IxA?mGE?PO(RE~1ED(~9X1Q3nEQ7Wf?TquK@%UZe
zS8fL;(<s8J!8_alBu|wAd)#=@w9x|VVfJKY*#QjJVqvK%KYa&gYUrKxJBr&Fi5fy6
zLJEsODnZLVcO%cWUiG?{7ZJZ<rlGPTJd##ZVK>5x=1o`^)8>70ILl&Y?fu>v>`Si-
z-B6186fm6*)X%&vZYc&yJNj<B%(bCLc72`84%i9NIpl>%Q}O7w@-$E{WhE@?2vML9
zO-2fFIX{Su;366UWo?fN*rX3$kNo4@+UN0qt`ciF7QqNm6HWDaf5eY*i5IkHc;t`t
zJ_$~6r&+0Ri*PcSWYid2M^uYUXjpvSO)7Wlj&Zz$y$l`4e;bdjG-04VRX}lPW99kx
z<7w|F-b+_2PjCR{6iXu7K$ELQ7;JWr1>a#Z!J2E?I7_q`ZI};1gDCE@1R7QaOg`tJ
zW3UWFaxv$@3_46?&?zYhtte!Z9MUGTb;@DOqbAL?!2Y=doYizE%8E=2%AE3$GaF=G
z0>&#%TLzap5C9V|8i;to1~iTUS6@Dl3~M41!4fIXySS``l6g4GE`_HDNXbK>OdW0<
z;B&_lfo+djc`nn$fo_#csaklZA}sGHbFRYl=J@KsJH24bW~oL?S8`3k%9j4Y&0^bH
zQ8g2`95SbQ(=?ZzF+#UR)gY*6BBz|R%gK9)O1?iN&u`~ir;77m`&99vW|77!S2%s6
z%8*9;xD|Z|tj(HYMM_1wSv}<jg;cR#u4E15c>IrUHy#yF^MOzBhGPu$Pa$X;LejXV
zDX?6=eCCr{m)DKQ)?Rtk7&@eVE;vjsmK#4hYIgEjUaz5Gp`2WhcbNh$I8HxMLnFko
zscHpA2FwR9w;6{F*VEGe_q{0bA}t(eK5Re@vGeXlOW+$LFO=LT20H<?9azqDTF)P{
z#TagJkI(l&KjJWl;8&#}hn?ilK9PIzQ|S5Ir76cYpN7Z?o2#?c<A11UjLw>xtkUB4
z$EWD0t#$u!NT(#AVDEoIY7F`b&y@Nl@Va$=-ahSnasBI-lco;(q}~WdbWIa1R@X)A
zEdt;}(13~s1P_NKnIp6GpxbMIN=xKt(;|)Kf<IP9->z?-%YyUgjj(y<E`OKKKXnzF
zc5%P_M&Shh*ZV1~Y~j*WwftBday|LmbZDmf5Ly6zIw8co=Db&oE4XS=IC#|`xJ{pb
z22I2xrhJwlQgLYYAL?O|s%r(0<*jfk8dhkaXf_R-rU9hNs=+1L*QPM5y1FutnwB)T
zAUCw=qfOBV7%tSS!~zAM1o8Vgop2Hit!V1Y4b4PFk0NZ1^)bo;M!;P&ai*SX%QnJq
zr?4A*pb1OH*{;oi`K>EuquKORjiuMY=hTzRu(;(ZEKbRfHFx9Ai|0Qbcyo%wlGTtB
zyW14M;+SJ}?Pc9yU#)ze&3soqEnpgtLDcKK*q9Bm9?tYrv?1JT1ovf>Cvc25<YEDH
zP*>`v3J`9V-Et9cvT%R|z+WhZ3+)Y73(&N@shGkF!2r6VGixfogt{-n4B)Le^o84I
zEuw0$1%)~m%>*1ftqSzCn-vS=z_SdP8&WoB%NqAEe9V2>JJfSzvTUPIX9<rg2;l)8
z{k*t=YME`>6-MpKn}B*-dv-0oYX$;KfpHP9KkXdkAfRWiCB|4EhDkCfi{lXsT{GDW
z>bhp~<Y~EbH*4DxbboC(4Q+I_mfZh)ad~*!>A(JeA#474@zal&=l#n=B$qvG|5O|x
zI}o+x{A<5vkbdP~MMMHLhBdC<afpHQv1fO4lE$}e-W7v_Z4yV|C>0+Ao=(r!ydC)Y
zm`p{-g2r~)IUmsRbk_P|LzF2j5b~K~6d*2r4bRAZwtD0($&EJ<UxqBN{>XiHYwxl7
zbhh@J5pZwW-o@b+%iGFJSI4L#n#%ieb}1jCb2Uq$`_VXcl=Ha6P5kZ*Q8;glc1;Xn
zyMJM!on0jUksN>fSX<AW#?KR?3v@1Ah>FX9(r=%(j|Mc5$A<;2q0e7f8ZB9NE)Pt<
zJveWjwSzN`I=r~QT3r|I#NybXz@!2QZ!}6e!l-GGwwao!OaJp~80v!yx?s?}6=e39
zbrGfoL9;Y9*wAm@&Za&3TwWw>!W(hJ6X19iF~l?Dp~dB?BCyy^2FZAi6p(a!BaF{_
zyFY@MmraE668P>@-RZ*SFM!hhA!17p3BNGFIwZq+62G%b))B@706^0`QeW$h2qn;X
zQ-w(cN@KRC7CtQ+U_PW5H!I^)?y|L-t2$VLVy7*TX+5SsnvoF~N-V}?=(VS&8K$V?
z0{sFX5*}%df+@Dq|IGV?iZ*^0ah(^?98QuMF$+`UW!{$#(9@gcZSH$n<D8}n?u=$i
zH8$;Lv<Zz4tlQ#v5a)IrE0|7PgPVM}6zBDlBZCW3zsi7_lTL5m2ba51rvxlls4@fB
zH+~T0lCJ0_vv-YnOpIpHJMlkF6q4VOo+hEPM=iT^dU>WceIk6ZUacnYXd*l@%-K1(
zK!g(BbWf6NW2<n3%SMg@DJ6Hxv&_z2J|XKDFOU5s8BCDbB=+?xcGCElNIn&_a!m3F
z!{)mjwLB|<_lq^j+z&NsOuQ2`IxSp}@|kc!s!JK}AHToYH&YY!CbW!>IoB?8+hof>
zv;d43-NJZSUUBm4-0zp#vPby0FzzOWn9Wy_dX_OBfw4kKhPTpDcp%wQntFsoR+2bh
zvCk`RzS-#By6(}lomn>9vStI?oOz+K*t2|%$0PZ=dWIR-Bi7P-1;lGlST8lEhXgYm
z`+0V~9CC8AAzRT%JmEp9)EShAiC=teIKfTvQO(0k!B=Z}r!ni>oFA&M*mJ5!R4(jb
z&D#==ey^B&%jys$j>_f>@#zfbtK~35kaj}<3}NJCwm>pID@v)LvzWxt2tHyYLf>9#
z=#8(g$A#78x65QA87E?V%G_m~U0)9k4f_4y0SaRItgMYacCfy7aBYJ<Ld`iijH}6-
zx~4>>nKm8|)mE#9)OcLT&wlOejCfKC3`xoA>()w3IjDb$BIbAK8t5niAVa7%*R7fg
zYP?e_sNwmi(8AUo&f^7K#D{`$U>IHA)f^h&thLb?YKTZH=nA#Tj{q$sNWk-SE&;|S
z%{S69m76d}y2_z?s1J>~oxTrHYZ5_R5-uI{42CXEy7X8rC%_KG9*RqzcUIu_{8&1w
zv|Z(HFxe%UyEp#PWU;wChgjP0{G<Klo}d{>F2i66LD@x<B&#N56u5;$jy^!9lp%Qc
z0~Ldub1`!~U%T{Zw)_?cY5MKk6pFwa^|qJ^(WL-bK&QX46=fueSC(2j-$HROlb355
zLOz4@xSX`;Yd?VyYwSLxBz<*z&Zo<{FHZe46{A(*U};)#Rbrt;EQ2$?ccDeuyqv|=
zemnF&yP9Wn>keZH1YdUR^@D#xS_W2jfriYK4~hbZRCYx+?$O2<x!w&~oW>*t<S^7o
znZK-)o;b@QjwIK>q=wZ4Z4}gYLNL_cnZG`bpvb%=P>)MI`w`#q{MJ`Za0na?dr|av
zH9SUK6TIo-3`X`Gt|glaqk{)SIGga!;a(co6PuMaUzV#g#QC_kIyRlMgo5MlQ>n-K
zVP0ZrAdwC{8~_KClo|QwQ;j#9j*$tWl0MbYEyNT8-43ldE(IMJ8fYT!$p!s^%_1%-
zimeKDvCm?m{$tu=zCU&&!x-5{GVEHfrpHkeGs#i5NUA!d=s{9=Cxlqy<kTM&I@C1A
z16{&8dB|x`fG}+uQ!C^ctBb)Heb9q&H8U{XoK`rAXREnC7=AxJQ(9TegvCotI-haK
zPOtVRUkOjb0LOnfjVYos2|a&Rf+i9^&jf46ea!h+vxw)6B#8$?t!2H_pooWMT04X;
zVIil0I_kuCcDvhB#3^2<cZsoMINv2)59Xy&WT~Y0$UPF~G^T+(q=R|Dqu8{rNRRsQ
z{K||X97q+Tn2kerC|Dja9$rBA9-x=1DL2SdK>SW*PGw0+N+-slVgLmhcCoa{$6^68
zN5F)N-npu$jJvri<BRZNhS+WPfum+W_~<$6w8bfeKd4C-f!ydUjhb_Zqm~##8fnHY
zq7hWgUgV<6miPXCA%e|95Zg3+pIFa&y1A2UsOYI*Y+p0!D?docaqaQ~_PFrCGH^bC
z7Z?tiubQ$B&_`?z^K6D#7f}NET+8Yjnq<e3A&AXrcrH%g4v$`6o_{wyd^>3Oz1X$`
z8wCi=EMmE1lORN;XoYTft<|%eNVvLk#sIkM@5l|xL4=+`pKkfvs;HD8XvHHZ4t>d_
zl3*dQ1$u-q>IL%dY&CW7@t~6a5p%jqSGkl$LMJxK3fW>fy1w!4mo<-R)R$ou|4TFz
z$yl)@`o5!s^nJ9LTsNc5j1K+HWU;`1r}O1KbYJxQh>u7%rqK4MFU@Y~9}csVeL`<0
z(1dJqN>*q-fnxUK^PluLHc`u;Om`a3y}yWU#9u;*pKy74{ef2D4OX7CX$Is+`ITg;
zWqhZ<6Eh_`DEuvCNa)F~7g!;tswe~GF9m7V>XYn)|MKbvOVE)Lxn)fEqr6{aEF0)B
z(QO@H0drhG!)%HEZXB^4t*cdjZ~KsCQ~3q3(DaX9H#+F^@K1Xp^WQ>kH4C3orP70P
znQ<~{qAu)>N@ziH0fxo=v&wIq^3?o3!4ZVPF~5AIm(z4+ev9w?`O8N!-mu`Kg9IAM
z^%7*^yF&lovL;|Nr{j(Oxnm!A{4$!vDLsjVo^c>%Wh+EN(0h*@@tboP>T;&Rl;#o+
z7<<1rm5OKzHs^Qp@{Z}zUgiJ+`r{gj!suUkB><IDYOyL1t9hQvicjRvcS$l|E+@K>
zurU~n$9VbcND%MNT-2uG#SeKMrNJX4KA+?~DXf+o8V4h8;26nu#!4<v0Oq4dslq;p
zZE<*XcHB4n$Heje=%GWHq<yB$6f5C&yzt8)5%BBd-te@2{uAe4db0TqUnejBWAPue
zC+3LXe4wg`Q&0Y%s=7D>r$7%_@Nm+akzeJcqH2gD%1u&58KLwea8Mn7l}TKhSGYTW
zG`J)z-ne5wF`${_Y=xjRPC^;PBZf6M!To-S7vt(Or^tirMeJ15pcUmv@NFFE`04Oe
z*6vqHtSf=u0g-Ybq<w9ASNZ8%V)S5A-CV}$qzH+@;yv3uyqgLQ2tHr+>10`s!sfqS
zt2RI8N++oxAve7ksZXH_&x4Dv!U#gQ)>yUXVhO1$=&9Gef`)Z)FD)1GYi(<&-Ndib
zF05~F`Ngqp-~2~a!!ROz_we#WJe7WOQ6mCwGB2V@B+jkAYeG1@>>V@CWga8g*8qhX
z1Bm!=&79@xJslGnP5;=%X*Yw!a-vrNm4?d$x49v#sUfSrRVLo!$oeyIz9oaV0T$G%
z)?BVU_8@V-WEmV%c0BDZ_rSXR`)yMrODXK64jO<)@`1o(8i*^L+8W`v)?|BNg1ftO
z6WpzH<GI->tccB&YmgRXo&eG;17lRe9JAq2DrOuA7w7kk;i1E;ALZa>K#ny8#nXQ*
zshKNY05ew}*A0=xM0+tHG-{jK++(JRPvyUV4XRWIg0PNTKw1psDvj$IO9@>%sd4%M
zBEU~oD7kMvfd=)B_?BrUDka(3jnlE;38HU^hrk)|mKa)amjnM5hiufmV_>+|yyh)i
z3vdfevYX(AN{d5L%2&Rcp%0Vb6+o3mQVJeVR`C#WaDk8+k0G}|c!e#U+ePg6k`=7}
zV?G9vq-x0FJ$Q3X+=``vS0n#94`lJ75O)B{dGJw2Sn$qUsiQ+mQb@U8_-<X@MV{AH
zrB~&ec$grwNjQ<_sb4|g(V8EQukzqT@NRV-aXLE=iVy7!-IBx=r?a&M4BUub_8fcl
zYvs;TciYSvD^#-xtjXg;mW+4UKi_PuytuP0fTMRZ+tRTZESlK1ISnMossRmMq#;JK
zB%alT+ZiJljG5(YfK?uP6)?6792_Q$v;-?AfD6!4VZ1dqOd9JO4SY3+7Z}IR$G0)#
z{>WB~8u~9C!1CLM#KKLiwo#xj`QuRfEL^rLplHoa5;b=5qHD$YbeTA{Wj5bpM#wjB
z7SGf16%fCX4$VdKv)@53?)Bbqmd)Vu?IHUO;%+(g1}(Mu=H%<Xhe+@t9`o8yq~l>q
zrxVBV?l=HnedqL^zNN<6^@jC^J#9fRu<F&BSzRP?;iodN*kG!-p*?V}uSj@`yvZcO
zoOJ0wok8@^t-a=M^U3Zbf1WhA_I`B=B0fci0zDJlBOmpZgJ3cjj3D`X2U77os=h<K
z_Z<9I^OBAR#$u8~p|IX0b?eDE_jFFzc9M{O5!n~vllzmW7!zE$UtR5k-zAmZ;Itnp
zC~9=%=YIViGTT-0HS~S`d>}@M85po2L!4ZtWyk?JY~E)@G{-5s6F1ONBex>Ea&X8`
zU}mOEwVJ$dC4#3u3R&nq+p20}L!9?Te=-X%Z6o{C8c{*WC~wQ1hk=ovO2$$HS1(c5
zs(_V*=rcL3>sqQGsObILZWo%hmZmodwY@J?3F(b*hpa!&rHTHRVsB_Fo{!Uo|Jb-G
z=0VwXej6rpFppNL<uI@f=bRxyb5IV0YV2P?XA1RfsD_a07s-(QjB4H)h#14Q7dOQ3
zv+Wg9R9$4)ci?x}@K$BO*i|0#LaXzGm6&foVj&NQw;vf`V9dGOS0=B4ULk64v1|s%
zuzX?7rB^Gs@X&1p!k&=_VPn^vqaERo={5cuQkgIQC~s~*e(^`RyI*^88nt=9y*J>f
z_NrbWW@EqV#VOTzR`o(bH=euWk@KpvQxfh`FF}pe;!BjP9$of&98*G1nw2G}Im4sw
z8)gBjOK>vswIwu1ohbyRi{Cb9p5W!Hr*epp6i>|No)d4g#DA+9i!*>g>0OOdmN}U(
zZ`p5d$?$7K{mUm~YRjuA9T(0g-b}^A9!v3x!Fdz)RFbO#Hm0VZHrWvprAB;JPso*U
z#6mu8lc@}ge)~H}>uBq;kGiOV5N0^P51p>Y_jEF+Bic4)w-q+3VPgq;vEW>>m(eWx
zqch@$uBX!f5<Mp9oVZ^9!`LU!;(G`>Hf<Fc{@EAN!#@iBhorPmZ$BCwNzM3oZ929^
zd-D;*;A=5+m;!hN`!+3<74hKjDgrDx0vPWcwzKN5c-4tdEYu4A;FLzi(F<}}!|lRD
z4aS*8H^%a#Pm9(sU4QR}yp6)kS2LZne$PVLvP&dtsHb8@2$QGL4YBlsNfZ^C1xR;w
z5PLB!RV>v}i?vZMF2Ec30!*B=-_t@k%`zIhWa2qJa2|*vQk5)teiJr|d)8W#bT@Kp
zVpeg}Im5`Q;#3X%RWK3&gf_6V&SwVD(Col_GmM!Q6h^nJC2WAhIFIKN*8Tc&aNK=!
zu8;;%tKYf^9I~11UnIbm#|`f_z2n8NNdYGS>T)O%8Y-gYVl|ryIh-7VgDJ0E;sz}f
zH3aL<1o6Nu7sWR>a3_PO1O2lRo-TB7R&cf8?GRmPj-)UaX>>aT2uiumGme~l@jN_5
zH0J@t#h{lqGkTej3;6)cqh3l2_=p<?BfvNUadtIZBg|q3j)@UKz60+RikFJ(gCjO{
zQ&mGfoTv&+uMx2|m69sydE@o9RxvQcxBv%U7#zRHF&V5|7wx!(vo5FWk=76M+w8+|
zlHFL~H!MtghUBIhx+7UU5cH7K`dvXSb8}PF9niS~n`+fAYYA$RCYWh|-#YzUu_ley
zBWnK8J_>4DYrzn=@*<w)Cg4IYWTOnSjGZ$t%)}|va~lm7G3|OfY=$4=1vY_)WGR=?
z*O7S>0Q=E}Bozywm?CPh2V|+GhynIwDD{)H#*48;q43hc^=$iZeIoPlG!_4qc%Bx8
zz&59&VSC7e6G7&_yO+x^?CxbDD1ILm1Wy5BZ9m7*V46SN0DJOB9t-rMUl%_UF-fr(
z7Q3()e1f68QfxSO7qPOQiJUUTG(!>grQWN-%oOnD;D!I=zBr*@z$4$<s6Lp)U)T=V
z0OB$IAham2D4AG;xQ4)kLWVg>sQD=Fg>!D&%utR)WzLpw=wXq+)uY#s#Po0S)I1oL
zoy9$0@yfc|HG|V<)BvXLlM@=YC#KX=fY4NEV!i1!T)`Y`v;^Rg=Jhb`6QBO_588Kh
z;hgy+-<cm3my>*0Re48rPircU=GJ;s`$f8AwM=+=ToES)m+NXR8y{@qkS)HI=JZG<
zxX<^5Q$oW6-f(cC#g>-S0NWP)6t;}+v^&x16<B|Uew8=D{cPA-TW_8$JWSD`8sI`$
zxnM6Vt9wl6*JTHH45ZdAL|f%$3N(|~rFD%te1HPqy;<?=t^?Gu8WQC;j7nsf6J-4Y
zoqxHvo|I&8YN^~)CSgu3g(Nrrq*axN%M2Mta(CnzC<sP3%vd9LKO5Z=Z<DR^$$d2y
z6J{SoFfEJ~Mglalg)k$uWi_U*2=P%M2GRGx4><(XkYU?cF4j>ILuOteCpMX;^-jzW
z3d5u38_osNJ?{*<y}Wo3=_wVQM1I7l6jQuOy`@TV?aom;Hwv<$%G@wNxRgJ*G|jPY
zCQU2kp=ASp)Do_##ys1!&UN%M+HD#fdUg>v8B&ZnCl4Z9gZ9xrPwv9_+;9<jcl?#r
zO?!qH;Yv6?N5H3emx0Hk8mgSn#TxP?3ZxJtBatD6HSf))Fgk^`Zn3L_w$Kt9+W21+
zOUtnmz^RyxEw1M<Y>6bwP2gDhW9z&<7`A)X#mtI-#sOLK+9aAB1l5(HN^cfmF-H<|
zD@!;>Ea6$_Rj)N@NAgA&x9v(GM;bTkS#oC<=TH+ppTqc}^Wp)Kc=BDqvOuHExws30
z1gwF~<Eo`n9FQbOrA7mV8kd_4>g1v7F9Je{gTRD)af}?EAfbgwcf@rc!?0MekT)Pe
zvpZ3}FC(Vxm%v0=Ajnk3mJesEY0a(I>8i3VS4%`4iE+jUlRZs1;FaBzkQrI{5J&89
zHB{69=Y}ZvTi~{Wl>1w-`6VC4ds(1{bsKW-8pC?>O3-(##>n5`wL%+<EN@sOsDF1D
zpGR%DzSqlo4TM$@sY8M~3=KBf^I*`jeaGS`mOv1<tYyWk#CL}XUn5C4Z+?<atKLg&
zPKB49DZs3{7u+6JH`Y`gQT8!=AGQY(v4}J@=w6&-@EYlHiF3zky_#Fz+uZV1{#;`?
z)++#%xFWkh*{#|9S-Tb3A=*`11b?Xm^ut8dKibuV$Futj_u0cl<c4vz=EVo%HvKRm
z@v{y)6^w@Zdh4HVO1$g`?1NBB;bOck>6t8o0_uZjc;&2|9Bp0NYFwR8j#6R|cY3(o
zy2a!iRb=b|dQc$ay>hVF)r4fQ$3YaUBcyNT`Zw2)x*B`6F(@!^!o`Z^I{F1y#EnTB
zoTFz~bfVu|l53kIEXgRITSy6&G;lk{3ri*%-A_hnOE%B9*HIjDA{`;ieh|WbF@hA>
z5;}(#nYz&ON~rJv5pqze){mFGl`c1EYltFjqlTEt=rp`lEn`3|UvY{&xEJAgSj}@g
znh%hJyraQ$j@)&ePS~^fF{DDp?5$IR5=n;?ZGa51&akuUW;LW{TDOiG^ttSYxe^4d
z$5V&pT-zH^cX_XbmjAWK($$ui>6+%U(&Uqxt2Gabg8?QFF<D5+Y^aC2Rwl--jk3sm
zEj*HR@_D9?sB{Rx!JxW9Y<KZbG{efO_8*xpk_E1EMxBuySMQu6-#-wT)}jQiasorm
zf<aYg(W}Fq+|xoATBH7#RKabqL73M5nxUVot1ptDg$-qRyeJSw&AaF-88Md+ja+<J
zlxstR3~fPsaN>=Qx2aalf1;4CE|CW7n#a@(PDl2xutkMO1`4G@W-v6<<A{+kaS#w&
z%^oDD@@@8^s7`X%+G+RAY4??d$y{?S2^nJCmy3IAg!V`nO&u4g%&=xi;Q#oY!~mF2
z4}2<owQ|Hm)Bwkyh}u6H+vQk@Mp2qH&qE6t<<Uc~Key}BWiri`V1WY*{OdS|)PKTl
z%wzbdj*AAb5MNP6ui|~4kl-}~nvlcA5}OGtD3}4Bi4O9y<OCe0L{HJ;u&av%{e#77
zEV2)VgxDG8h?7uNj38~X#Gne;5D*_krx_iHn6wgENhRt-$Z2xXrD9T5H)LIF;YZBZ
zpc7~g)Pc(|R&o!lZSs1`;=5ir2b3znpqVK1fgTs(lY|`N538=os-aagi@Herwk@9^
zobW%5Afz+_4y^9AQJnik*Hcu>L2xwt7lTryX<-|!5>)sM3~ppzm4m!xB8=wiexB%!
z7lb5fG!lp=Qw^L)5C=3!)yL;*M!cb17Ho=V{He6WH@RX_gGPEw<-MlGLt+PSf%;6A
zqwS4|sYOa{?KM~aZZTCKaU3fo$qh(0td#hryVS&;Agbdv$E)dlsOa!RA8<bCFT>HJ
zr~#7K#Pc-a_mRVosJ)U>)oS?rFBnZe&O}7^q#c^5PB+@|ot5eaj=sRlul^IVIzQ<f
zYmQQxsH#pCr>eSZkNrYrr;4Ab>6)`sh1r|vcxPpbu@?%ygqZT_e@V8=5f`yYM|o3I
zG~>tTLtQW!m_WrUXqu}76tAyS$IO+2O<Z3YazU<0<u;Yiq}I@S11u@$8|M;{%?ZDr
zkcfqRG_3^Z(I-+_UEbwCA}w@(c-9{DI!D8P>+Ir`VH->ZNfmo%f?F_XLm8{Erip^I
zhpy)??knwx9k>GI@O?F-b(-Bshz0{+(puSu>seqFj_=a(Bq;(;+S6XGnF`d%Jcx+1
zq4^LI-n5V3mx!<uV;S|k!|&Sdi`Hr9`?fkxZviABbkPtQMrG?zSBthtxQ|I}BM6d7
z&Zdp|YB48CJ6}id`r5ONLVN)Gvllfqlzangd2hFAbLDdRDuOCxnFcz`o1A}1a4Nd?
zx4C>?k(>iP`KTem91(+bgR-gkmc}#9-VwUlyi4apPVSJerbBm->OFWYBb7&{h&gK$
z^U(tFAkT;S$j^zgq*phpAP$t&(kokvZNyNSF?0|gULhwCj-k4qICgTH&eAEhG`7I2
zp{Ldd+=(0q#5%Fq_vfmgDzqerZ`Y6ofZ$8>K&=#h?eo90n$OL5Xoo%Y9l+u+zKueW
zn>w-v>%S-ZC+dl}thrxwzH431pe@a&)pT@m={Mvd!ttF?7>)Wg!lBeuP}q>{1Rcas
zGP(w1<!%a1A`8AfS?<8|ZwJBhJ0>Td@g-$h#zSD^)X{9yVkf?E4XRBFEwDJ_EXJ|L
zZmNk`JOucAV>c5d0Ds)ZSAp54c=#3XS`VZViLL$3yrS`YpXN!0^_~dr;n;L#n$fN}
z3jsWFyP8hX`%X{eB<f#Yw0qxo`t9QoL3$h~Fh_r^h|=-xqQ+a2J-MV#==`^2hJ)_o
zWzjX#x2}roG)hKXvfx>1DGZTnd=kJws^F#d%=<_TL!p_x7LH)ZIKwRTuYn=Z4??t2
z_>=_xivGqSIjLk<blv6D5_Q)%>K0Lh!@9#p_xzXc$;mIsYC7z--}E|z_C}G$HIz2h
zG`@qQ4K@;rG&Z7nM&iYNIMz%;1CUDdbsjq`XLQC7ATr;dWzqz|6{`ejG_hi*<+qZw
zQQs@z9OSd@A~`Lhs{f!hJ*|zF5V?Oxj@b{(TS?A*hRY23GXg`NPmvDCp@Smc*$jIH
zq1_}9KNm@K4J}|rIAS{0_#48k>NJgiJBwMNWb6o9Z9uT|%-S)&$UZu<tE<Cah#=Lv
zii>Mu2`zd#)e+tu=FigbUr$!~?J%DZpHe(M&e)>C_aa^!KXtCL9W_=e5~1&TX_cCR
z%VB$21-zY^)(o5L@D)N>T}Gy&ZZVhy+QV#CHp2gF#+4JSGowZT%tV!L0_nK~YTzIk
zH#zK^R;#7GOkiF$jx?TcWO4Y$K9gB+vvSUblY5P2hAVu{zA^<k271R2C%09JgG;4*
zp;^&QB!JH5*-Q*-3Kz_-Y(^ty3rIUqse%{_Nacg3NQ@;VbJ&!rn0ezzD67-PrUA2j
zn1(lFxN(XY`6Xi7Io|`yC*f?UrS*=_UESE#N$2s(>ZXR>@347~;7wD*)ewboGKueL
zfX(piAO#;kk|EXMV7W4c|MR=yW$95$L`P3f_lhQ86pb-!2T+yPWZ=pHT_CF#%M_(s
z^+c(vDh2;mHB7_e7_Awmih9XnG4nm|zvuK}xE72WVn>=LAHbPaMG(rSC9Me`y5GNT
zV7bL1>?zqW4ejnpY3|{1h2g5enZL{h&%wOnphvf&@=BGtp?j5@E76P<crWP{_0_Hl
zY+foG{hVDrlAakuap{_650W$NOFB2f67ZhPrqk6-f}5|B<%fihxp}-W5TK%O*5k8y
zZkjfMqE0LvYS>$o1Fg!XIEIi5fl(jImnzB$HO8>d>Ps;-6k=j^-wbH2ZI~rh^+hbE
zVXj`E2!8Rs8QE=!mz$RGQb>(CROYcr^qk+D(eZ`1E!|S$w(c6>t$Iu^Ubv4#d=ZmD
zI!^qRzze#}$T~&VI9*g|lXgs~Bj5c1IWe&Qsu_D<M`|dS=TJ~056sR|U|7JaBvO!b
zSco@)G613W&*7YI+F#8v-Dg!lCy!LzDWl!+<q}(~kkuwCx=08%iP8%=WgHa`a>@n-
zrg$XNo|`WuBE58l=IoklUaR7#bf_CePKB1uoK~htsV-eeYIdfkg-KI-0+?&sUG!RF
zJ8ydZ$c4<S!UlGYGfvbjVdmb#D_-YVM!G=CU4z?tz+ZSyEdJ8-XvuP;Tf$$<m9&6l
zKV^fq)F}|NcWJ<}L^Vu{fgP&iSVBsMU5NsY#n!K3S3pC%R^+1D7%LlxO@_qP<teT$
z^=>TDc|;rxH|6Ty`s$-bK*t;EfG05Bs^bgzP*vju$&5+@-UhyNFDwqi7UZlki19Q$
z9872IVP4+YeB}87P8^bUtzdd!c-S4(Q|qt$+1WH$PkLP%4HWB}@^_p#6DGBq@lNj2
zCAZf1thqFD({192nCqBFK~8g2cJb|A+Qv;g26$@SppHD3J&^)KUv_-2Y9Q4SurQmN
zUxEFIOh;+-T)cFt%K@>WvZ_TZH)wDHadj~<6a^;Boxe;JB3khf?G$D}<GX`giIGJ3
z`ZFFh7NyEb&z1(b-1$vl=*;>-%~Idt+QqAyC4rDj#S=D0`3{1H4RgK(k2`TUBOO?S
zKt_VNXB){kwxd~c!ybu`B`D$glDqy|^L8=c>KdF!4JfYPCyV$d3GoupbLP<tJ^!70
zZ=AYgPHl*>|L+`t9gU{sTx(cm7OzgyBFIMGdTF*d+}Sw{v>0P7#|2)yP)%<XgOE)T
zaXG%n)xy{7D9(yU<&MomX_Mwz?#?ZGK1RKchCrl#R&lVTI{|c^FWeZ2O=Kq@+Bjva
zM{`ho#v?&A{Zg!i;-+61YPMznVAYsvlZTmkPN|Ui!NsQ%;~kzgldJ?{;thW+Ne~eZ
zS>*Nd`&@k1DwM)I98Do544lT_!tZKzK{+c{?n_O6S@F&5c!V@dr6h}5&Abj)#Ujpc
zYufAVd(e2qHa1RHvR2%F?50x7t;<s)(b=$;hKAc|GG#V)eUsD+Rg&8y4=36a(BW_@
z+_$ti<}pdT1zwP2&jB8b>Rdpe5c3>JW{a5fi9Hr;h4aM&*&e=m3gC#IejiV6XmgJP
zDa_j!4bAfvEQ0lE!&no0Z&kyKYLr2b(EgePWKx30i#nTf)_M+B=0=r7I(a-Sz!ugw
zM>Wu8ryD-?#YbuE=XPsJK$kqp5xQa$#a(B%H|3OQc`_-amo}5kE`VN6=}2>c+7?Q-
zx5AM!oO5Un=QJa!CC!}YsU~cjD<DFmS>pr=<Gkn}p=^tfk6Ub^zZgt}H9BkZ=!qL}
zX$XCqff?dZX^hgvXf=s#%paR3){~)eUK&HFA*1*~e3ymh&l)1|Z;2jgi&-n0-|+FG
zrQmx@{+2sI?d5R2rxTNKaG8~3HiGtLo(jhw`zMMdDs6fq*5^h3C_D%Ja9h;;yr`H{
z>AGp05eog5iHHe{q|2fTo*1q-CLY+LfNQ14w(cfjUv(I_JP%U86|+oXnrStWgl?A8
z8_i@s%S;>iwW20LKz(czx=<**H!5F^_f?v-vM{l`Wr$Wb*-5*WnTg?6W7N#EtSceI
z4Xq`_e%tYl=^_Ff=uc4jhIRBWAEtJbWn)9m11ty?NkW9h8qojd+ep7$re`FVVQ67-
z2M*`T>M01WPJ{;GO7g48{TiyCE0R!^#EcRa3aW;NlWv6iqi^>-NjOL3@VL|e?zG+S
z4^O)-I2bU<-rDXuLBWa#&hsXe=~Vo$y-ayz3Ls6gugj^zg+sg?y!JALbDCc;0a6Ls
zX*9k^X2Da+x)PNaPl2$-<E)_OH}f{js{lM+)8m=y7sJZp#fK-=z#(8(;jdF!k>|qT
zVwNio)bCGD9e24oT5ui=9WG2qoNh~f2=(mNiY%bHq^kuI8h>sm?bvjWT3euD7Ku$I
z&A})Y5Yn`|5ZG*b==F)?F&%hB)Y<7Ord)~0!+D)oxk=j>LRtl#bNP^mMg^r8H})et
z4qTfZ?qn|QvD#wL;_Y<=MX=lPQ<sC}XVY_LUz?=3YupM1lYn1t!5nIG0#~Z23jKC5
zGdx5j5bHU|+Gf9EakUx}YG<z_0j+Kw%8AF7S#rziT*N&?kmyY->G|l!{skJ0S(+V`
z^vxnsvttP6qgj;%-K{#@j~WAO^J#KGaKsOVBjZUxW-6>V;O+gbOo+MIMHa4L8M9PX
zTF~{^)l?r%8+U3(-I~ATG8$*B=jUM6O8$b;0F|`}M#g$SazFg@@dFM6)T_EbAOsEp
zU4-nb-u<Cc=HTdJc-}p3pSIrW`Gsi=I;s3UvG<FT3$<)=0TClU10bz@FBo-y39Qc3
zMhxQ_9Vzg!3CCPV%msOH3KT8s6D>E=6bk{Kh~_IO=EdVtPDY%mA=Fbrhgu+*&L1R~
z&Pz#kcdDWS)LAp-pe50~h=EUuUD%x6>3B!jY~e08)%yS+mO{=uOg`I^bOhjmJ|tlF
z0n^Hl%tvR1Jfh5AZoLfB12|<|I3}K0`+(FPbOfM@6)`JHt(dtySPB85LMrIO{+q-f
z@5PlTTurC+JUThO?7wcEo*Ew|qYU+ohsEoP&qBd*DWKoUNBO-VW^>Le|Im2d+T%>1
zMjAoVh!6O0c3p7ND$%-5uQQ+431q7X8Sz-kf*>Bii@Jy{AD6U5)?T1zLCj?$X+44k
z+xKpJPe7{ydioHvQXS3#p|#Wm{%QfNQ#faqpp_VRCRsY~0!@NbIAzQ+`a#p-+C1y8
z+Jn~7cYX)Ni?woGT*Pt7WiJ?)JO#3cM(Gq{lq>Rt1&4l#m}=leW2_MQ0avP(hvIZv
z*a8>giK^)QC0N;zg2vZ`JK%yumegdrqsw<p><t$zAnG|X<|9Ko9^(-XeQ-(v!mCAG
z09`fi73fW_S3}jd((zWhH%?D3p%;$nQn`f>k8%5w;@d?^<75=y2chx-B~zP=6=}Gc
zV(@(yY>{!$L?w%oo>BQDJU1E~<7gjvm7+lz)+yAo!+88NySN5x{}B1nf-+(%X~G#i
zyW&H4Tm$SJlICi;IcvM!Gvjh?milaUSNKw`8+A~u#uvZ1-<k#DESbz=FGQO?;tiW|
zJ6}sTq-+%3gVz_FI|%tbClhZY9~N-bs&=%&>GZZW)$}pNJ!rRBisRSObiDltdc!Np
zQT*fKY4_;6_VMui^6V!+KkjN)YQfH?3)y!-d|J@lK&+SZ{bJ315RdPN4&lU1vykJr
z{71oDc6fTxy@>uqbMFn`(VE2AL7#2vZ#Rg=F%${iq&+tP=SIxe>|KTo1LN@~la7>5
zM7Cb~dDOW^a0x*cXE&sT!J4+B|IF#paM9Sn8f2%N_<fvCcm*MM0u4g{ILb4+Aq<1V
z3OOjo1*w&@V!@N|hI37X*|4E_&~)DT&`~yp<uOFe<`zIqItU-dllg62cy@I^hs(@j
zR(Q^wo(-7zN9w0+l%3mT9g!D@C^)>F<j-MxMd8>Z<cCLG1LPPAA}ypQD;46?B}`zK
zNWc$#x{_)tA5EEcpDGn9f9iHZEDCGZ<UB5AQq#m%kXwo+{3zbAP|z5&b-ab--zsRA
z-^MU23O_R5W;E?{liL)Y4iLzgv#Rn&RdEggsW#Zw$#Dj$LQEkHIL>ioMQITKe9UI0
z&?HsynAgPgbK)&_jKQ!s3TYYQ`w3Dbhj4YiJJp2U3`{xW*B59gEC!?eQf$&w)77Wq
zurQ&q6CId4a14djqbN9+hayITIl+e+iL~OnpqPmg<0_H7u+W>MK69B*SI(s}ac4a%
zZ!i%R3`42Rf%wpjHRBOvz&zAksCtJX#?!IP@XvJXi()CRXqfLTu)4}uSE0Z$=VwEN
zYmn5N8yRaJnJ0{CZ4gmSUhdMp84%OcNr|=OC88X{*ZxWZmdN$JL%Nbsc)<mGZ>~89
zr~W>T(VLzA>S|kZ60#is7)AM=gn*oP2c46*Lxd__PvV<EN-+?-zKLEQl|!OCxp`Oe
zCGfySr7|BRz9Q6o2rrBls-P+`b^VksUd?#5%(iYg?TlcpyR<IQkrm_j{p3WJwoH>e
z(}gyw9|6H91p|K-FX%X21nn{T<0D%v(qh|H#MmojXmmEVj%ZJ*Yq*d`R##)+3&7%n
zZpN8aNDELeZv#%~ZXZ{CR-}5igOLDYg$S#Y19%YY_7F&mD-vGO$dFmt3E(dwyd9WP
zG*9A=bP%wkuy6b0$_ll|`}0QZ(z^)5<6=Zt@aH(?WVYO{?J0r-wFd`AY~$c5QI7MV
zvA7_NtSS50=BeJ@*dv(z0uAsT%oWwF=}-ZN@wzZtE=IxE*X&v1P_L^OQdv1i^f;F^
zL#=-<IS1&zBk<q<5;ZE|r~$zHbEqle4xd`?9O{c(C_fcLkKo=L$a|Aq^pSJQX+D<$
z7n`r<%&u^vy*PcOM-ClB?6@qgF~`Jp60?A@9UZan5GOQ!)K9N{-07PvU8k4*LAy6R
zIc>cfZmvCGfbs%GJ*&VEj9;2y#TeH#R^)rT^wGPsO79<@+ma>_ceC0|r~zi4&6z!J
z3hMC{f;l10c@hh2+dLHr@-XWmPQMyJ_2_gJ<KxMKCW`aHz7a5kpI5lQXL6Q74ldl@
z#^%TAoh_8P5`A(F5l0?B!9tL5d@rp6K3heJz9dFSrKB%S@H#THL<{B%XW56!3}l;<
zaeB2-h2w!$f$BwNRH>HRRN^IS!k~bfR0$P|Eg!d>Nb@JQUUJX0{2CRVN0l*%eO6kZ
zKQ)@VFQe?X#2|ox?|I_p+{b<Kd0$Jyps-mIUJxd~%w{Sz@FpH7OU^z_e~-7=sYO0h
z+oF6H&-2?%M_&J6&7*LpylIq(2*GTx@kJpbr6Fn>*tFvy2x4^^GG3<e@aA>nrJ{M@
zXiyc5s33X!+T2lS)poHhqNOyA3EH9x%>T;97++W~BbnEv4+5G!&e%{)|8YrNDncAU
zkWr(D$rNGJ<AVYz4L-Mgv?e5~Y*py0A`|TURLM;vE`d-dKq$xif{17q(%8B;gl$qB
zU~%Sm7?A85z#o0&c$Yr<E}evZ_zs7wcV<)t<)EUbsj8WoV}U9Ph5|~w5}7RXW5i&y
z@1E)QGk1+Pg!fF~3k|c<H8MW<H0dFpi80Ek#}De>OV)>)x0>N~Y|_@1OTY=|!S`Yj
zbFE%-7C=p>Q5JV6QedbB98`~=(a#i80niX{9i0{&I^)r#G7eA*!?T!pe@+B1_W(m)
zEj{#?vc6IwawY+;s3;g&Rj-<RgTz5!F%YUjsHn;VrOe1C&@W+Cr7#)^j?25H^G#y6
zj&ynZIOc;>+E2#O6YrZ()R7Ea7j2`*5rQk@hj_vG<RqV`SK_43s#&?|zxg)$ssP0`
z8LC9D_+5@0HM<03L}hlMcCZQsoE+Y2Z;7w>pNQdQH_>ddEEsz}#LLm`m?p*g0kanO
zddYTA^EQ&Vd{Yu*xf^{8t8QR?Bz|ie(drp<MUMLj6+k%`F=_79rFX|*2<a6L2sR<b
z;YjMCaCIMb`@U^na*bD;OCVMl={tDn9V_7rIJsFJy3-1lGKw?h<(=}KcK?j#s|bjG
zGcWW&eGxR<^L&Mcd{8PpvGxJ10!_~WY^R+xQ+%<4c!xmw2gzO4)%M{S9;D&`7?M)d
zwl+rM8Xs=YjR7ki6`U-rM~E`&p+?2zS=8a*w0ReG0ze@zP$*}K3pJwP9y2-&7<$D@
z<H35hjGB4tC9UE87mp|DEL2`pn#ZXC38qdvuoI+XnYqeVHp!5AfE&M-8v_1@G@|KX
zvb@gZ5~`6D=U+k`txiasG2yIWYHAE5UTmYSGeC74n3)GpyG_>w?q58+xB8`#z#9f>
z0(k$0O|lYvu}Q_GZgy_eebKKX)*>qW>w!zheb)M6_+9&Le|UI#a?<Wa`(M3~4B}8K
z<2-ft9C6-EqW3W!daE364s7|d`9;~0k_JeO4Y^F#rY3xXiiYl6@fpyB!0%Il!Xpv$
z_7`ZF$<Q4@e`;`Hezm&(vCvu@94GpvEd}Cduzvybff50m>^6z#RXF`1z8Tmj%RgY`
zl6%{Hh8k!ZpaA-SHV)z+f5z7_ucm8>?-YQa?MFzMUM)g^wQ7VmpH$0Q5Csmw#D4sW
zsiH3AJ)Y77JNd8L10Ky@yH8B{uyfuSME{Kbx%+FA8JH%rb`=-MuP%}L`z##?>12S=
z*0A2Z8wa+eIPp-ySJDtJSecJzG#xjiMRxUbw7H3e(UgmSaWiU$y?}8U|I$~g2>sLB
z-^{PM3(RY*AkKNvAM6t7UsYD;g`LFmM+}iuAyS~7GI)+nR(EhUz}sH?4*wQ^TFI$)
zLZfW>AyvPEjw|s(ji1WrHHEi-SR;xpb~{hSY(Qt31Z#_%75hSgcZjWgiNkT*7?dxK
zA9biH!ytj13!!PenTs}c>kr-NQJdaC1t>WzY_eEMgoHMD5TOEYPP@_Oebwd#>MV8;
zBXV}M#AD2Kj5Ur=;ckt6(*W-^lf4)ixnaLzB8G~<KU5O&s)5cjnY(KE%Z4j!OJ?f*
z?A7(0s63-zQ;x=F<Wfq=-vWIif4NoYWjrv;84-Tg=wv-4!EbktogSSR&Tef!TGY)|
z@Q7I{hTFTz9Z41c!&kp@kYyDih(_CVMR*R|e7R28KS4A5Qaf+pU1ir^webP#T;ebC
zJR7Badg~40kw>0If2CAWx=NQugUq2)>2ey+O*WVhULvGza|!wfhh)n8XJHm4$fs2J
zL^odlep++Vgc6=+=@LSPTW-h{;UUt!!s<|hat6|W3_T2k1H(3e_#^9o;VO-$b6fA%
zXhmO*3g1}U3Twu7_b=mxc+IlTAU<VN?|>PIzU3QeHX(8g-<vKC_4q1ZYLNYQ?d30@
zBUw&b9gHjwIZ5srCw!}Tr$VVQa@#N4=VsTEAUk@8=5^QtnaWggg8_;nHM2#rW0Fr%
zvyg}{vvv>GaIjpl6V)rbSNuY>IY|$~CbgM5e?x53{5P#}TSBgQLyF(mO#yF@e|ZM5
zBEoU!Q!C~6iK~r%#pz_AYH__Brx;%<w{Cb%qv7XM*Xr|ZsX>XZfY=c?xgMtsexFU?
zw|qr1fpHwic_hw=+tHz>@JU&nY!P(i6y0PM4p)uYe8Wl);!(uM-KO8uL&tU-7B=ul
zps>O*M#nWY{VLEqR#fCAZq<%y(Pz&^#U|Lio-c_J-h5C0Xo2!vn5VM1HpdC32jf?m
zpFgIv(PTAFq9@|0w0-+TE&2FM4A`6|gBW34BBBhV?pT(yd-%VGuUq}s;3=cM^5gGY
zr<d($A4_5DxBS68v^ilYd}=4LTJ`DiZ}}DURML_L*%nPkKmO;SP(rfL%ekEQ{b#l$
zrbf`2xD@eW7qafY$AUT5w`+>OCb{HsRcKGvzx=rNt!kIfvvHC?uGHa#m_oR;)fXRM
zt!e9RELH*;ymCRgBYVStB#W#`|6XKyXLgO>&XXJSTRbaM#?r6<E~Ik#Fk9T#HNMSC
z@ioJt#_~0t9Onq+xOXLfkF8-Cnp|AUv4?+;y|H8R^soTV@}mquXO=GYjp$4pcuBI|
zx-vj{Fy+|epI@Gm$k6~)&(eU3$IIKM2&+YzGW-B)B0t36SIH_V6DA2r*>MO$-=}fw
zqVwAcvGNU`@=f>qDW_PJULW3fjvH2zERGIJ1B;MLIc~J+WKSu__59&+)#WoF(g<3!
z48L@;ND|cmo9?p!Db<gb$lblXGj-HaT)ek2x>77q6L`d5GuDi{%4^U~#aajoAh>tj
zT`lWq2898kgapZuRvK}_u70QNxSmX8p5PWCt7X1O-{Veent1DX&^CzPUPyDUn2Pqb
zM$9L?>YSF>(O_|3e(lxm30_0>%X9Wx{7#(~x%Cahp*JIcUfG;wmLZ9#(uwg^k>U~Y
zBD!)<(g~QE@;J(zA@$;MHq$v;@OJ^FL)=Fq)UWOZGD!P7Fks%U{t@7)8V;Cho{pPp
zaY<R1qr<xxUjg4!_j_w~*I1+(L&0hB+hi7uYHKn%rm5nSOB%=$UEToEvGqzi$|k_j
zro%sL<QzeGorU9;i)_#|y6PcA3=PHVB2TqQUf35jqjJ;BwAhW8m_8EcmfFRIg=Gk+
z4dBckL&VKpsF3gGIL(ott+<x>ld`sTp?7DrKHMaFYand!rN1?UNp~Lz_Rd*+uYvS6
zrKMOW_Zw2NocyH>tEr&Oj@K6?QkOFX3pczaEx*3!6(_&Dlk0dj?=JZ6ERO{=B_4rg
z7E)U!LAQ=Mc?ok)<&V>Unj+<IN|F;~kPI#)+5keKvgL5r47CNDqtznM7EMnNk<7-T
zt8tHluZhaZYwRly3b98gZr;mfDmVv@hIp@=LZ0#}c+OKn_g0U6RbD4|G+#I+<aTWu
zOXh@kWLTIJMK%f&NwJFED5J&b#q);$r`ehX3b}W!P0UAe6ybt#N6aGOvnl8r-_#e`
zd}L2<Cg-$0I(N#rFQM=pAmfPkm$Q#(8IxJbmKkVLl7Rm(nM!=ZM-GWwc$tu8$;U%=
zPoL&DrhleINAp!nZHYl8H8|>QYg#o#NsXedt?1nT&BCunQ!Nq!t@d)W(E_pCg`~P=
zV$KH-odLg_W{oCUo($CArs~Fq3rEEnQ+U^6xcpK94sCe2c6X89&`mRG5w}$?hY(vn
z2nN{$o!N}XQj&I2vY-(^O=eZ}mgYS}8U}^T`99-YQ5GJ1aa7bki|3zRmsY}O*KIAA
zi}Y%>Og@{!#VWu3w90zNb&#4?^7E7jR?ED~=C=tQ-JE2&TuPD=8!qH?csP&DU^M@&
zD4q6yBT9&_`j<(;(c$m#o8>cc{jxW!{(Lo=RE)Rxme+fIk;5#T_-lfh!eXKClf@Ms
zHdDV~aQgZ8LxHKiTNbHtsPm&pnVK!F=?{!oU4P9N<=(9(@5;Oc{imwnQJ<}ZwJocx
zQ`{J)j!t$}Z~XeFwC(VJpMd8LH!0S6RA>6*+%E^Nxw7%=%6TV8U3vfbsQd==^P=i0
zx0^^;mak}3UD3LkswgixJ!+?x-xli}vo^}Fqxz|FX)x29^Ht66;DoB{mci>4Npe^N
z<?l&;hMJFl>e8vY_$p3)Q@niBttni-+SU}VyUW&8skpq>lzyE|=5<rOc}p)#&0k%q
zsj+`QTgG>V)m0vO*vM7VEf)jkjWRimT3R?F#`&^%W*N`IasCg<&k2~ZhS^j4mRNK-
zpkznUK7l*H8Jj0mPRYuAmYm-#2+4l6Wj4pF`9o!H3@ewP#dp#VPdE^%2LGj7-{hPJ
zN4pLwv{3shz2VyFj1$)LC!p`*$+DlnNRmaz6F2$aa<M)Mv8)X%6~tH)@2=wR>^jr4
zp2yftM^K)~wk8wpzgNd-Z`{4j&V^D?6*J!_2p23~tfEld-rinUwWY2O#mcEUIcLcS
zk)M?W$tt7Af8En^dU8rUT0W`~s)G$D(T=~r-eqB4A{To}_u!T%jVsF$P*Ik&xGbnB
z<(W^L5q5eK6;Ns+$SDEaFlZM_tq9&8-pj(Vdf4*nG74K!hE3w!-WcrU&S9as-^@^|
zB3V$mIVtJ)RFJ?186Y5;yr`}O+w%mWJlA9UwK<HRMsBlCp5v7XGUxY<8WJqi)hwv!
zeLY^7rxz$O4(0$ZCAtamQq@T<$Y=0)>s*I*e5pX9vfseYuKJ~*l!9O#EwWkg{DW74
zUz!&taNRmC^x;R7*S~Mi#{3o?5lnRL=bLnSdm$Mt-f#j7zsu`OULwS1ASvV@Qwyr=
z+Db^UB9D`Cr`x$cPm*zA{F&hEIJe~H^rYg}S+T0EMm5N%jFY9q9iwRRL&n5JB$J(>
zYJz5p5vEf2nikvo0?>xIo|_)q&_K4LsE)L3Md3xeTHf~5xF3-J;*aSy4DrL^tMkjF
z;jn^nJYg7<Iu_x2x|BnjZ?WMpHvGzP*k}j>N`s`h+48y>?Kh)m8ynT!=I`*8KPHnr
z`TP$3E6v2mX$4-hu1b|rKD1BNuxL6+XuM(Vg#vjn(3k#q?4%k8#^Eyao@R5_Z`mtr
zzDTaqJIhKFTP;t#1Gf50rhsXniLa^Fb(>P1nb8*3Dd#=WtFltwot@xjX!!S%<<Cqz
zdvprk4d_8*5#L3di{;uvqID~jG+*a?5nN$^lDQ+^4yY;iDp_){N@tl&A1=kC^iZJ-
zo{1#9@l2t^1)cPxIA7Y)p?N)nf6YyJ^73UPq+s@8(73$TB(QEld|{w>oQI29kH+t6
zu(&_UX77>gjP97gQ>SQH2<kx=SyS9vyB4S^FKpFpUaaXCE`$whrBjx1RB;^ChMK&>
zA5EXo0c)NXKg#se**Ljt)_LF+d#yH3OR?(19y7zd670=Y<(i@I8wu?Ar!-o$wi-1B
zgQj(62o9?(x@KnlmbU+M6;IX@$ci65rtw%N72ShFS#1Xc60-W1RVyOlqaqxR<JG(<
z<^`tuHv)7Cn`*^%oy}hX0VW+OgI{C<%&^!NwiTLFvJQ?b4?wS~9jJn3hCN6SK)lob
zp?$RTrZqTvt+~Io3mltAf>!lu3_d~ncZR5C1~gb_S6El-KOtanfzlw@BP&~tZr`9q
z37ke6Y{EIdB4PO|w91Nk*Oe5%p*o7xJy(=up5rS=8AvoK92D&n73s!9gjV|EL%bLd
zfL<-mloi7;iEq{xfTy>S@Hh!hS<{v+DhitvQZjmtqF+K)$u>PJ6%_En0yWE)0RB0w
zuM0@R9mF{<N&#QS`H+oAu#8VKqKo2M{5uN!#DDiaJt(R<kYc%_uG**LcZsT8*vYR{
zfGu9d>W($Q+VmASRk|8nRrPQC$(on{$k)9k!Qr;_R-Mk-R;VwXM~W)0my1HdpbLSw
z7Q9sh^`>8~7k~K7nr&jy#v~nla&<atk3Rd`w(=*}9IxgTb=;`SiP2~8K#f8oZnc$L
zJ+A7aJcohF<h^yxNpqoFS35j@O?~>u_qCwj36-{bAeUCf4fOu7!H-MJ#=#=mPC_SJ
zy{`PBfZ4{j(>2d<SC6SiLW(FTKfSuD)qP#M#}3>=`+mKkQ*b=FFHrltaoE?PP)^k^
z@(+P-tS{j9ZpF(EyWZEo_jYg9x7XIi+lO1nZs7IrMaQl0Ll;AHQuxj{w0L;3Xym0%
zE$?pDsfO}~GN-suD8Y*?Pk~eLn-lKAh3ONiP632&Ah#d)C6;MI{i8?K(<OTY_=&B0
zWQS!VJdUnzlusub9(zSX>$+Kaf>l*3eKM@L?u(x?1Qo>Aj6+9!WgjNX0nGK}j6rf?
zPiQ}2#H=Yn2lh|9Tt^``pSrSTCzHa-SX(xM9Q0tx3Un)ApH3||(HT!zPh4b3i15^>
zZuOn6oCz<XyO0OKUPDv@JV~U#Y`ru?5`FtE2cxvlkGjX5^H;-O>rM2_FVTbL+GmIT
zL2pB1m<kz&1a8`;e90~L$85xE;D&MP@Oc7Li2m^xvC`Q%2*^M${M%4Dr2+dqO2S(Q
z$zQEaNuQl0&?d3HLPFOhJ%ais17N7mbKcB)B{B9Zj|FEGS5Set;&QC6EvH4ld$#ie
z%`-s@3hetrP;rDlrM;^;)OXTMm8lOI_=Cq-FhEF73eN6gqe?an?;RU0RGSY6>$-B{
zPb7nMY;8wrJz<V*k@A&pc{GsTWNXexkD;0+A5f;M$;r~t<%vn>(tB8`DvDpua$6y6
z>ow4vUS*lCg0eHd|4|pP16|f5iixuI;c~6<SeWhGcyGh_cvcl`-vJiGFYBAPjIBr3
zhz@P20j*Nd*n&kPjX#wbnAYfBet0iwyu4|WG&Gg7G#j5MAAlGz$im?db8Kq)SBY36
z^$W%XW0P(biiL*tfGF5BoJJkVr4te?4sWs~K?wwD@t>?FlU@=ylJXJYA6H?2N9=j-
zt>aE;RAjiU;Prm^{x+Le?1G246r1qQ?(<}F9XiV<;vrQ*uu4|s=lN~+;gmCsRepbb
zWnx~8PoYNbgsz3=*P@4^jO1~(kD<`!J4}fm(ZOPrd<Fu#)^nH!*TB<=k}X*6d~*8l
zSK)SGG#~T6QFht#pU|2LzNF3<dTXgN6Tlrg+s;Rc1=nz)YK*g>(HSQx34te_)AnX`
zJ#VUOmH~&8fug}-_zpWwUiC(BnO2pagi#<3Nz*saJaXCGP?O-25ss1IYkda4Z&bG?
zn|rTaZN9)JlM6Q#nq1B949iv_>F2QB>vem>!P|@W5c%Kt)G-H;P}%J1Qe9fbW}JV`
zIpSF_C~?kpq>#RF{{d1c^9WMs-Sc*|Ye}6msyp>(O4s;@gdvy$!c5GXxm6LFA1AXk
z86V!$V7wEDE;Ab7dZ;D-+Cgh<s5FiI_U#iHbwET?VF^+2PPD6=p;+95Wo*`yeg#8U
z_=@Uj>7r`Q=X78r+b%Cn4PF{0{=rfxQy;tdXznJ?u4S_$@_~uY)A3M)yXM}3&0`sU
z|Ii}B1imY@qzmmV4TfF7u3+c}K})~<N>s-7qdjTUqXXJpf4QFc<n$8nYAT>Q7K*YH
zo|ZJcG?$6T$LaMoSlEjgz^y@hv0z*PQ$Vc0SAun87%}c`_oM}VH!{naLyZet2sbXB
z5g~pI|1+H2h06{OQnjxUMPc9SiP;#L2dv1!$A+T#)gA&!$BOL+x5mm9!F(F>N7)As
z&#NW9uJZbtL8B_j0B0_J@5aF2<6y2MxO*zXzm4T#uDhUlxsCG{<6$zX3*qn@-lQc<
zej~S@)ybZ%00=d?Z{HzI-c)CGkM{wzCLT>BuBWvEsNB-XTqdB$g>mz7rcvc==x3Z#
z8)(khJDZB0iC5aj*3qfYC$nhBm}CM{!LSunhQZWZd|gZxhu56L^mf?&F4_$q9JkLq
z?c?Fm*|CTI;JpAW#D3Ka&aC{5QEibe$>snyn5c<l$|<$LeDHPa{Jeb{Jug$RXrTt>
zSSQ!?jw2LlrZLJ0sgnZ{<0f~#fy5CwRh>(!?9EI98fE>>8XDnQLeyOJIpVwhu&?RZ
zU&3fL_$pV}oK8H^LJ7?=E{Yy0X^ZiHpg$%y$hJ7u1$*yiI=&Mlj~4FBM;h|gRj8W+
zlWC5?Y%U*xR7CZ>g~+)gFLX#sE+fH^9MKTpWQ%(swAJ*>n-@M#`3u>?@?)6yVyr&*
z48IP`45jO%u#y2!pkD&<Ba8ma`_A3~rn{2e#vdzhCP9F!wU&K>?F<=U^}Gs4A@JvG
zMs>Hmza+#)CE>Nw(1zCvc+=upYc>X=wQ>0@G?yB~ExutVh2jFC59B7OnvP%MW5q;l
zwt)A!OXmB%g<#hJDtLS33(c&SaC}J~I_G@Bd5w?-#U<M@=fXc)$H&9YxpIc3$DQ+|
zUewt8=9}FO<rzD((IQd6I0fB`;NQqul&|r1Nea5G{>%?dZEvH%&ay4vCM{*4A%mBm
zKviHe+!g8lAoTVfJwDJ1<Q_%p)qqJoE07Y=%T^V{zFG1?x-O|bZqu7vO;1y#dMZ?(
ze+E?`wFyy7ptwKR&0zO(KvQ_(O%;F2;+J7S=?{260uoeVo{$DGn~hV>y)enQE2*~5
z{VDtG5e6;#w|(p;Oz{Mj2m}6O2n_gt3>$Sdq05Wo)<8+ogcS${jbVT)UZpbTV>_Y>
zFl4Z`NcLel1-!;iVz>@uCAgt=K2JuR%91IGl_1U6frTlb$9Ao0eCHsl08Dwu&yqWa
z3Bz1Z8ElYKAK6d;P0-9fatqLagU@dEgoa{73}-yQ<$SCUH=l7LOxw-OpT+k;vIM9Z
z&}7+ZW4kfM_Q$#Z3ze1M0^G?@?l861@AJp}omg9=&5!v+&gbClr>8iV8(~3uYaak&
zi65#*TUfFgKnSY8&Lr>~l#A};M?;|aVq$BB#PkBBkEmPQqrTjX3N7bYz{(CWXV96k
z$+bk>EuCnSf2|~O8h;uEZ88l86qsmuaX50}e`In#PS{<sV#ErMHWOCr6`vM}A$iun
zOsqVw!8lfsuNsIl6@Mr{l?ZdUfEBB7Oa171J)ubG;E1=@yU|!Pi)9Cy`YaS|gHqWb
z`OqGnBphmNQom+Pd16<xne(7JP7C(@c6MpA{)-*Ns-Y2j_lT{Kc^`#o!T)5<#$n-c
zHdGv8=32AW()?}O27`<?&kj4csn{t?6DivkdEzyQHgr|-4dds*WdhGqQ&T76d-Z4U
z%!pS7+H&QoQdEwPlf*_@-iYSmAM<Qp;e4vvDq=C;TV`_<IF|B~nWjq*g@wIKiO*NQ
zTob6ivi>mDJ6+E>b|iYWOwQ6-BXkJzS3dq*sB=nn;=70I_{aTea;ImOe_s^IUmy*w
zEvkNpxYvveBHc{Y1ZvL+ORZ{$hol}lDL#W#?G@n0qj-itmQbNhkEFu`O&v<^{OK>_
z+^m@<S6dgtC)Li2-^Ri<Yv?i6^rH_}V@)FXzrY@%ZYo4U08K@YrTcbsi5L#MjW;LR
zO*--)EHgNhHj#8L#(U(r-LM{kcqieWv;)txC0j3TXtMSMh8+8KR(-Y*>1>*S1k?0R
z3mXe-g`2kbT8-#N;m<LNYrto6wmh<SSoOzwK{E@zcy$5xq!E`nj>&8Vh$dc~W)3@C
zoInjO$m?RM7;2E6A;nhAQ??7#$9#SYt;2LSrpsrcdJ+1K1F=OnqJIrlaZ{yV(1<%7
za1c=;|KZYy_ZB&$0GIJ_-R{Bw0r}q)<#s$NA(I3KF`J_7A-l*`tyQFgDoL2x#cxH~
z`k?6oBP!iF12M3w)_*{kZ(LQ7Wrn(fY%nT#-Up8VmBYrC<8`&Fi?+Ha4;AqY;T8LD
zl6|0)1@Tjw`MZK0s2}iEG1A!{1__+uPO?S+cC|#3&4%CS%4kr{Zg!f9EtSu+-!?q+
z6TV<0EA^DpdcF8VT~!Zb%oc|^$~TLxueRd2{Ic;LptU`A6}rf1CIc(o?Gh|`F0UJs
ziVgp@OCg)DV9U^H8!%vJ!SrPn!2A}MQ1J|=BCMIMDG-m5sI)szW;hmej(7|Tq(<|{
zRK&w581@x1jxH*+=FX%h2Q!^$a@glQpknSFB2oNM4(V{{B$+4sJ#uk=I5cVPhcIdd
zy%glhiXO5VN<aaR?niD6ExTbHT6>pA@Gh!+PcMf@r`@CPtY1%nG)mJZ6Fe}e7DmnO
z?LWG}yVOKLgR?(|T<GQz2bu+*FqRDniquk^+Sn!m8Gz-CP6gO^1LH7p_1!a;=33*Q
z8{Yjt3_utpRfhpa{iJ~CO@GXVEwTPPR#NiI7%x_4)i<N;stQojDg=A&{-D(x4Eycg
z_w8O$iCuX6s@FPdpIn}vzAdOpk0rT1V9E8I3$%^}GDqF>lg_JQul=Ui8MKXV6s#e?
zh|CL#$TC*xZEGeKZxmjl?l^6_oMPi-65kt@eo~0D)rdyP7NDvy%eT5|#akyZ+W^R#
zlH#`T$if{gH4^mK6)$8nunn${ob@=#s+ia^!8B|YtC%WENxL@bKSq*gi`nL6BBDAw
zAUYB%<UaU0LG;u>&W4>7s|Tq6V5kkLB9}XQMKn|v&J9}>ujsVoqq34F`&d+mHv1#}
z$WU1=9qKc%LJ>$4E>W{>IEO*MJs1vJ-?fJ)o%ZRm?z@^IlJ7wFQ@O}d_u?(>ZE3v8
z#}KwY^V=PidqhOK$7S*kHMATGiI7syRr^Iuw+mb~rBvHnQ7W7)Q@%pyhY>F3orpH=
zlLxnwDOuc06*SXA>v=cTlncjSxJ__Ks?@5iW|U6xTKuX4ij`_?-_tGk3AI?`_Z}L|
z2kUsjFz*@E4U<&SGc0joxz_isW^nXOd0<?s`(4$qN3~l%dY*g$=--3Qmi1%TB8!pi
z$l6`#9a9yfUaI&iS+YK*7(9gbaaxzcGNaqAqL6o$gfdq6v9f9vZ+;8aDvq^_)m5|;
z_36KQZ%eM-%NhMg+!O#{ra5(sLZRRl8zHKq;)UdldQ3%X2zBUIF+H@$n#|WKG38~^
z72<*kn3|;-ED~W6<_pR2$cXxpWPz4e6$4pj>%sRQhTT_%w5y&A>o>?ax1f4DG9Q}c
zy2!)wT+VXY{z?%=T_O9gbtM+wOWqe8Dz)X3DRu~C^kKdnLtSjVbpo*anB8Yo+=$;N
z7x5yV<_%@!Y{omMOY&H1C#SfIMM*)uZqb;&OJbTWI9IfnyGK&ZaRSuVMaMxv1QgT*
zlVh4{zaWU6Nzq41;Lk7xl2W$hQX5b@ix=-&xqA9J-}g`Y+D70l8%&lYF|kb;#txB_
zF)g?(A4IwF{~TY5hoD{BF}rwUw4DDUm|y{$s0XLuuZ;O}S6m7r+48^{YN~qnySc+*
zSo5u>rfmFp@AgV3H&_^J!80WLyfgFFl?|dy9@X*Omh(@On)W;LUV@5|IL@(uhUrYH
zprW(zHB=83Qgu1lIvfL7+nGXPi9393X^^fBL-j0a2zIIa*uPL8p9ct@oRXh0G~9sC
zp^#m9Y5-vp*7F4w6+WfoyyTGoo2zgFjk7e*%XLi!HiihE2<vdVi_?=!y)xg!=;DF+
zUa#nQPyRD_wpb0*F-dK8oMTvY1PzgHQ~GlX#1$Y2La$+@m(y<dyUUBBUcx>dbT5xy
z7lk5Mr#tAJyfp%moIF=7)z?g!?Wv9hm+l=OavG?hl3u1^75xI#NFUbhh>A*ThwgJe
zr^lQP-kiwUmduw+{UeMr$UmK?U4P>%5v&Vmh#eioCL2L*-GMs3dZ?879<h11Hhf%@
zq^xaj=4-RsXBUIF$A>ia!;{n2t9}@%Q}+Bb<y#1K2)#6WU=Gr$$+3vU$1~0YA1xUg
zayv|Z0;Ht-<10lKVpwfYHHC?2z-WYskqzcjHaCI`MC;pxm42@^NqB)YgZ9;v_JVmN
znUOI;(sB-1J=ccu731XzQ$<rQ3Ti4czCw7-Y94J~@xRp1V%SKwNRG8s!z;eRzjkK`
zOjK>TM-AB*szpNLC2B_zh}Z>~@FqCR#>9CGUe<#<Agsy}yUEzjsmZ%!z!HlpZ$Zxj
zx?v-D1)(aZr@lK$UXV)-B3b$2LsW~Eh_iY`75qtaO!9~3=@ym`cUnnxPIES^$7i$B
zXF<=#Nr#La1`m=xkvZb0>kud^a~F9=y5%4PyQo3Z{+yY2a4HHlN_2?lk2t58jBZ0k
zvJ6hV@H1ubOcP2=3@5A&B+9D~fC%$pKzX?^Y^md_qSk&vFST8zGq8Z@1%yp*WquaV
zD^WSi#Y~BCkxQr`@%SVk(HiIM<SrXLrwA`bx@_K<<nC<yl-z`k%1nhSv#+L{Y2D(L
zpdhEyFc$ycDlMX3wfcc%ZQHatA30Yxv>*!v)@kDU`X+s1iz+_R$65M&d?%rs{Xx2)
zI;4CUli2*b5T2$tB%VJ!7@tG?Cdn4@I9=tx3-vp&2*1ym7-y#6p7dn&+Yg2yGV>i{
zl`5LG*N+Ia=YD<*9n5Gk+Itb0#u;x#d<SO5JC9BeXqfrNlhRiHqF(|7x?FZe1QdO4
zRS>E&e3Y(G*XWU-xXhU5E532aHqHKo`1KG<o!<f`LvYPh={U#+?4}dufK!B~LNeAN
zI21hl%g|^Mi(Y{7J=Awn>e;>peh@?HY)LHf#Lf~lLFS=qk3wGt_qrI_%MURaiz*Ah
zDIgvpftFFHuO>d6F;WXnstvV+noY9XsLst$5e24Cq?D#N=tn2-t!6XN4Iy~Tag0hP
zb^Z_-QQkaTtgqQxjIW|UAwoL{_8s!eA-&X&16RQ+QUM5ojO$jB7t|O|<5awfq|d>~
zt*J_FSX0$32F95|Se1pVFi&{bsv&n}J}@Cck+pvkQ!Ziqb1$93_zJ;(2yRBMxtzhX
zgFyZ9mGPKVR|`M3ak7fViefTL2VhF8c&NHi`qhGgWn;_KF^cI*(|hN_4~dHq>PpXy
z(pz&oXl?@s*P(75n&q@Qn{Z_UR1N(Pvt87sN_ERzUebU8Q<Fbk2^+tVM1&7#Fjm$|
zQ)D~_4o+>m)~jMuvALu}#IsnA%4H8BQFBeU<sc13nAJ7dS}cBn&Cj8#Td%$J$CXEw
zhAc#D_9mbpf_coR*H7C`DQgZ}y%Av>yU22ZzLvmK1_|pNBW&4PClsg)4piNlE}Bw?
zC|yd!l|feJ*&MFSTGW<^;=Q;q4FVi)W`~JmpF0yqJT~hh)7ckOY{gpQ9V`ov7RdV2
zw-vdyO+Me?V&gZsa^<`)<^1)AewKY0PEGGc2``=Jswo35>GLt0vRo(G0ZR1Y;+R%k
z98!(Jok}Zip-C6aTgbtWQs=wmI-u#Q!AY+m>fI<*RX{!v^tjXTev>{=jYGN&waK-5
z+PjoesRkcP@ASz<mQ9?Kn6F1Yxg2)RI|KNLL|+wrDCp%YIU72&vvjudlFk@@f{L7G
zHwayBm`BD}sYL5I87*uQo(cfP_V=BmL5Suck9wEq=biIc9+-nXKWTMNqkYjONC<9Q
z`|ENN8@ns3IWSl|UX-R6Zvc>nu?#XwMvPS~T0zTC;eCIcgQ;xzDHA=Nf|Ot-8RK0V
zr#zcMvruoZ^km;1pG@mGkt0R}|9x8Ww<u;AVJcll{nxEMPOqz&XtYe}F`gFD(&Wu?
zx>(-(vud-O<cBLDl#DCt>6_3EQ*6U3^gCz}w-;B-+gcF&xeJP@fPf#}X0<O>&rti`
z`R`V~o87H@o7BIZuYY~B=Cd~s)f|Hbt$DrfohDSO9Y^-CTG!vJbZx8Gy{32UW%6Kw
zMg3e-3phAvT^rUHfGhQyp<DA3HLvd1)?M>jYICg7n%+&E)vn_8hj>1|s(rm+i_5#D
zz74qf>ZwD|THCoR+(xypCowG>x})leuX`!*qibHPD*{O%^&e38;o1VsqSPM|^ZHR+
zuvqoL>oupuWRBpF+UjfHa@~5;i}kN*uOnoB4fTrXRY!Zx%L&Pv>pnYPb9_zKZ_o)4
zmFshvu<L1E)wM@C_}SW*#L3maT)TGiG#4gtP5p<9z`j-gcHLCu*!K^SPiM;qU$ZT)
zz6>jyA9(!$iE(<pW(VW#0|eHdQ4r5-UoykJ=J4eA@udFdgsytcl3ufXXqVNWy4Ypw
z4~WUy)rSb2`ZI4GkD(~iYj^<>G}gXebD7N_ATWQB0=0hKhF&h~XNxg%>OZ}%s$yHN
zIqx|faLrw`$R_pO9w%3;dPa7-uEW#y+~~)32i(U8xR;OX4`q3Mb<fZZYf2^WA6ZaJ
zP1al!9<jB>*xFtHn(97K!hC1VC)OR#AJ^^uj}MH)^uYn0K6d1%j~OgFZKi4c5z6o5
z`ubN75x9DY!pBG4R@1fF%)Go@6}u~4f0JIVWqGdF@;p}$pVe3E4{LE+uD@cIi*;-j
zhOS<8(`8&=;C9{7a=ZR$xm|aW+^#*eZr5Hyx9fz}+jXOH``~EV9kG7g9>KVLd<1{=
z@nQDm<9ZhA<9a4dF<BmN#Ja<14f}MvRyw?WA5Yf2r8!>5Jl#H^Sh!u^GMpLfRR<C_
zP*353+wb;K(zyvEsV%XZJzQq~h$4@oBc|qc?}<q5YfezPrX%a$8+&*?kF<WB8ryg6
zL7Bf>r|yG~L^hkO6WQajkDFd`QLLu*Cw<^OUD0~huCEy!JXo_ACX;%W9lkbeU-oa~
zHBuyJ`KV=z(=}?0D-s6Q+<kx}U&lpJfwf`|G0oVcYu4jh#bU<rYU|W~^!A|=;<j^j
z{{Z_@D!E1<Y0ExbVm+00ygR*y#bMq1bz_gQStroY`#gykYqq;Bv3^(2uaQUu89>$)
zS=Z6|_4-9Nzn&(GHH`ZFdcAZ7AdlIoe&>oiO#SvsMk_=#zKIvJb;r})x<1~mmo@Gl
zlt%8>aXsulR{s_`2kJNZ9r1DLn%eQGo{hSj2e?%g1=uTo4e`}7d!Wc#UB}%zPV#Q8
zPH~b=KCJ3jT|8Q&6<RLh$xVH$d~}%d+iT4QQ&j*MKam(S#|;DYqp>KPaBp`oV~S1S
z1=VhZ;672KF-C?}V8D-^k3T?|gdS(1dqkDZY4G7ke`=GKWr#rXNzGL#A=nR(vB7U(
zrp=eD>uYN}RA{1B4uv=D<dT9xyvNM28dIwE8V~SeIO@BY_{8~ynZ5*HYJ4Jvb-+y*
z@eHXfYO9xUkLs|TA_L|WSv03-&FFazn$u@~wg%uyoP&6lycuw&d?}sY<jKu@AK8f>
zVM*Lbnv7@@{~G%>ox2N0+bE<`>c`g!K2inL=4Ys~j%v#({LbJQc9YCF|8`w<af)$;
z#kbNgju$@sQ8I%+04GErD?ZjdS)`fu6&XwZB3l9v18$ri_JOuU9}>L23L<u#Unh6R
z#KH!sSlsk6u>6BOwuNL}>I;l(ddOLq7f8P}#NUlV6vfnKD!gBs{D^ZC7OtH9-En#o
z)YW$IQ!n*)RnD-xZ1H)uxgizMT#Pv?(UsMn$Yz-6Z2%z0jKeYTe+1|%cc7<8e$(j=
zICv{`|G}H8=g6)u&*8l2Lx$l9yUY_RF<NBoQo_!aDMwP>$V?(+BDVbgDrR>|7dw&8
zqESpUfC^tkn{a$yO#mz((Ew&}a2l@?(3oT&gkTW4<{;d3*<dqA<1G5;f7swlx_KH6
zdB5?e-Mj1Sjp!S#xK01RLiXbOjp&Mc`0l_}8<uDfhu^n`t=_9XU0qu6*XYA7{9Sh?
zN$KFUUpUE^lf0A~k)9!)$ZQq(KI5s$Ya#wtM2(&-lRFJXrwL!)4MjPy;f4E&a~7t&
zVPUf(X`h^!jVH(L!^>CEzvo~7`#5?TJ&CAX^yEKgPtYlN$qtA3?X+{QzqyW9d<9|o
zjp7%!wxY9E?>qg*)>aMi4GCOJThlQ8p*es5@PB{)^&fG$&e^AHCtr+q=y=~A{kGrO
zrJolsp5x!WKYz9B|4Y9;d$#}L&wto^zPJD4tFQjN|BTA*J%91+t3O1$zil(Be^x+V
zilRTPu85ahttt1w`~O3K;JSX?KTWTq{q0>&XcZkr<NH}WO-GR=RzNVo)goTp)1ixV
z_b8j+FMxs=HAWlJKF#gc{_fsa&8Qzw-UI6=q2K7>nWXc17JU=Xmgyq-7!g-?GbO&C
zj$F=p{j!P{$aF~zj9NE~xUK**FwtpzMHh2tHbSx1WD;?)Jd&F|8E<QIxwNo|fGxpo
zh&&{8o8;MQ0bGt5v^X>BAnqkjONfNgbVcFcY_$ZHDTl=hAWf6ANf3WBO_!SN>wP+=
zUzWGAq^P;hi0S{3GJKlmI+6S;(`5Ozwks;NE$3u5(kQ5OqUj1OWU`E@u^<~?k<i3G
zJ2E5y#2EoQV3V(*<!zcvrer_KO3ob&TLo(oL{7Ta>Y75I^ajN=g}ORkQS&NVV_Kn&
z`mEMO(osWdoQ?SIkIl^O(4<I6Ir5V)kPpm_zNGmk%6>;||IU+CW6={v2}P@9ArbFj
zpYjx>w2G*~LL*z`^fAssf|O-;tTW)W(aQu2h1xL9mYiXah6lNjsB!O+;0*DeJQ8_!
zz5IYB;4Lcr0OuPk3%4Vd+yZNACaa61KFm5Eyzca)e)nYXrqydl^!r7x`+Wz=Z4Tek
z%XS2`x?bni>p}FodwSgN^`qALF%TjLz0Tp~pi2*)wE9%@3GWzs*E)Y2wSTziwfp_3
z+lxA97pEPfM<3|5&Ig@#pZ3@J(di{JtT!W~5uJAj(P`(bgG4xkZWG@Hv2x9*dlH?s
zd&v7XXdQM=JA=3U$&=3D9G^R(@3o?fR&UTbx;$<5qKnJkMYqq?(7)qO|LC;UIcpzp
zQyb{JQTzM$`2bG5r>BMPcHf-0d+0#W*F&at+G!o0w&iow+v85JeKbI~+;2xTh}6ha
zI>0X4M;-jq{-I4hYW3dIY1HFmsC(XT|NWB6(fjDQb=G=CeQZ21Iy6H^m%a8G8s0qt
zo&M!vf6y6R4%*SHZugjn9T=aTqjvuwI_>s(;4b^^CVgbk!skJSMvY$6?}wND4#tlM
z{d~~w^)4?4o$mPt&G{P|AsT}g)jsC2?w)g>X|TGzx1fu`;HhXvZ(g_QInDXGc5l#Y
zVL19UfJXzrBz={}bKrG0I&Z%^?YwHAAGPte3qo%?{q}}TUZ;;T9r^g17Jc~=-RDW8
zw#l#FT5j^xMxB$Wb^Lt?jhDipMoXgK(d9!=`@k-d(Z{yf`NHLS{RW^}+4k+r@DW{I
z#b>zF!e=8m*M*N_)^dc;CV(f-gJ(~`F5Nx}AF##;PXoD~uG!&v7ZC-~x6u>#*AwDs
z0ZBziKnf@2L=Z{F`RlPHE#>MQm|^lH(GfDbZQ#+LK!?-pp0)blnF9EMs1(_^Uws__
z%q%3ABqYo1+6avF$=mVbtBr#i8h?2-jla~=*n9D4B6}}tsXW_%G?i!jwNzd_e>9aB
z&y~urUw9>V55D-dICnf*IdHZAlk<ieWgoA)q3HZ%k|1k(k4ezn`{tXkHohn{$4%iu
zeYL;TSNqGFYBa>P_4Zz{(k^P8cF$kY>iQx2_S@*x{IO9-bTawo8yfRkvd{JpzNmWs
z;<-`L)zwm|uQcLjgvU7s{4Bn!-ZW?{!^KiJ+?bXc+TcluwxYd*`fBCjZtx^LP_1IP
z8!`)0@iD_)B3d!n4KoW$RtC;1u(ijie$1E9|C0Y)rSIbjRK>*BfE7ZDG;eCa;&>nA
zlxY&w!ZD^%ENKLRYs{;`v0`AOKv%gO<N>_r7f%rl{WO|q?E8VE9(*A`rG`9Zwykp=
zonO*zpXM%Gtk&Z^kn%0`fu0dBNb{~-;KyW<iR#V}@=jkR*JL7BoE#d@CdoAiX*ya5
zhVu$O7EeCJ_rx`>CX=ltxHKs58g%AMqwF9s!{5~68^r&C6yPZ_kN4S1Gms#eUSZ^n
zgfP9=hu@+E4Ka;O<4JrqdeVHhVH)=ql!yi^SNw6|fl!spMil3GhrF3Nr|+A>mor^P
z|FIj1%)+gkaXw8)WIKADeLxnf!how}kjK{|KA{1aY7$gHhlpbT#UnTmDNi3w(=mX~
zv?Wky-cSR<882CRr^OgpHi^fYh7x}cUGM#fFwB(Ij_ShE5ZA@M*lWz@S9SXBfz30R
z%dhsBkTEu=wo=nWpB8!>C^!DZ(h}lS(K?IV{A@ACNM-8ow#^DpCjJ-MqML9yAL+BN
zqEwQO-elQWCLxumy87cP`qQ6GPw`@R!?eA0+|ww~y~X8xUP9wLQKX=FzMk`$z`9|x
zEp2ObkXNk8Cw>LbghMhz6@6*G_hqyfy^QP#GD<zP{DuhZe%DaZ8rrwiL_1@Dvxiwe
zv=4{!;f8$SOQrqgUNicWyxEAp_Ub*hl6N!SVmNWwY?w0=f4Bmu{q48z5OHTN-bCMe
z#c_#ooqxkCS8$rZU64N2jCPw*u~piboJjHAwYibsekq0I&Gj6wLUREX+St+?NBTr%
z<d-d}yXD<STH<B#s^m4{+Gz<@6+0+0pzByp?-j3p?gB5^Un0A1zWK&gIV3U1W7qH_
zs&@P6*IM4R@G-o3ecT&<-|98~(##7~^V_YLvNyCD<=4E1>~J2`^yIS|OHA;Z*6zLd
zAJ$yrw%0WG+5Z2q<`P@KrnxVk|F<^x*Wg6KSM@{>&WX|dzQIPvblHr;yD0xr|Ne<S
z`t(0`p9bu7E)oguw?|)@W(O+?@3IZPPp8&~Pn{0u-}(c4@&S*poC&;K)L@2AScVOc
zUD}S?%uvmQm*s`vI2Gn9g<HFgL$(LpTLkXSG8xF8fp3YGDQvRGeLZRJmReclemR!|
zeqrrj>^??Z6Ig{K+j{qHA`uwkc}*C3KNwD219It@8|!b;ZuGS}(etZ~gX-277nF44
zcqM7R3aqH#x-npPxpn-Yc6cPKJpZ;~=>s>eNcudBGMgxzX3pgar@iqse~M@5oWpCN
z+U&OzG=T5!;?=DiWyr<NWxC}tLHUncdq27MA>mEPx*O(Hr6K)`mQZ#D7S~7_I^r8m
zW$rOTDKx(@Tjy5x$t3x@p>~bbnQl!uPT4AYv6Kz`f=VmbtBK@mFElj8(q@#CX*?5#
zlnonG=I1{E1a*?WOAK@EbneMrOnV_QqDF3IjK-7eEW3&qPgugB^Jd>WX*N+vkXmGt
z`I)in{`;6Mx&8`p0#qis<Ugd;@2ezwvQH(i=mAaP2hMKJY1Dzw!g3?aQ(5>q)-NtA
zXuWu1qzWVZ(4SKUGUc!EG)f*!olekNB*1mbqZcYG`isr$rN82IFS1*gFxRpO%%wtw
ziObWypr!0eV{Fy?g2b23w&oMy!&7(RKM|$Ns#A{zStE@ZX_KQ1K*Wi$kSH`5Nc)b|
z>2c0pZxJKW^E_r^t(qlwOO;pLj?86fL23cz0Es(%1L{k=mO*H?f~PRVMjk^>A(&>X
zoK|A|K2F&QBpBGyB#9S=LG=f1*WPryZsp1NwPzDx3&~Qp-BAHHkY2sRICEw>tSV79
zK<r#C5_uIPe<{C2g=Mh)AlYUHomzVyLy%=bSGp|qi%sCqH>3GvMd!vW;hd;kf%O=)
z|K<MCEpnbMldt95<1CSBl>7}$ZBtgk|DU}-e@x@b5(d!u_2sXqFrOokLDphBi5<B=
zEFqhTENO%kC!ORmB`Bn_fubqU;>7Q7e`mc*Er1-SduG1S9Sf@NdhWgFp8c#BOfXCZ
z@3C^~;!Y1>jSm>19|JMjC=56_cvs<d<YM|aumew%WOR_o8kyUiXPxD!>zvqHIcq73
z3(pvZzS`5_n5OZSfrsQDhUPNtcs)pledWs$T?bzUo~S#^=6daWd@4nzrhBT{X`Udy
zF@lh2oXjt;1Q;m)@z`&k#fx1tb4z4V8N*zA=l{y#;M_|`=3}nre{gk%0@gt`P<ndq
zGT2h$1sj0zgcdT?ICiPTyw#iLkKL2gR`c-ic+b+AQe=HM*tU#o_U*&nTnjS$ywHTJ
z)GXNdlkpl^l!?IO8Er%OO^Aw-4xPBf#oeSIRso61P4GAnTMA`0_LN{rT0Ojiv)i}E
zO6v<b_kC?E#K5l6^v)T9!F)^PFNN|JD!)Y7B5P?xBnn=VmGEZ3wOwUtWh3qGX4!8#
zhd6?+7#*tw1W&2R8@S)R5X9Lx3uPg+#qAEK;+~k|Bg;SRsF1*7p%*MM3-)Msnw<s_
z0h&%E6sW}A2m?+!<D^DdS7D=UE19Q4#|J{86zFrzUl_Ck5Y!P}y5by%5KXUYD}s<O
zKg4-iw$i&NEu#4N&ldpEK*S`z9(bViSW!a0LOVodS945}*5Qm7U+No3KMH*<<hL}S
z^c!J^AzY^@)yF%Js2V7ay^fj5u*3~f#z@~7+D120ICJbRn&wtV^ugK!G6C*q2=H-2
zR>M&E8dHGL9u)$OiA=a~BRB!6!AI!iIE!cVnQOIzOr*$N&4sSo5*&ehOLOQ@WUM*}
zET5VxzM4P%YNZNA_|3o4?A=~)D=wo8yj#<BxBLbN*e|@jSxBC_xDm^u@iC>M3vSek
zn3WXccr+g&KonW=7EJ@pRLrt^Asc3i-YA23CPqG%bH+FMJJKH71s8@6vdy#}wGs<|
zLve0_ehd-PA&e*tm?qXiNnzMu!=a8(HaZ**p!nXgB^Mvw8sd@JjOkuO<tL=Y=qIAW
zo7`zbL`wp6srnsZ?g-B3F|Nl=%yMt4!;~v>r}N8*x>f$vj>$(0e4L=$xyW$PqZ<#-
z%q#>NX_VfC!SBEG<X^aY+C|qR-HT?gJ<Q_mPreSF?Mv7>dn0DAsOldaz<<;GD04^H
z*ZB*Ae$!URY${A12%}^1vSEFUD%ql8GJ#|h9QcJojbN+BdRwDT)a1y7$3?$|1-EOC
zf|s7`@DrC`a#&1QmT-JW1s`+40;wVyCt1q`3NXsDrvhPuN|)7i$e=|lU-Ly*52@J0
ztpW(@4Wi)d&EV7#I&&ad9ix{No?v_-T1}FcQu1iIugvX3@=Twv6}Z$aXTPq~Jeg&<
zd$mfyV(Yb_x=0q+)_m`VR#4&Fm;()Rx?&N_4Q6?Yp-_*Fx%ZN(G8=0c^k8ixXbzES
z5b2*;JKjp>O3v%V7l`S6HSi$5b;qDHQMv*fA!Z0~_Z;&Ln3-e_DM|BY6reRLXi#}r
zj}x#OnF9iA5RVOxPDzxe6OC?UD8B3=rdw{3q-iXS7Gh!)ZeNBNDwqN}^4d6)Bnk)3
ze;ep&S^%bV49cGsH=d_N|MgQ`??aST(3o=!Tz*U=boo^1S#f6Cy8>FUjwN7^i(ICc
zjEoc>2lhUij@iq|k=2A_5o@}36DWqndynOFDDpui1MZHfALEt9+h3;x7(Y+;7@?{s
zQb9w}gM-#-x6}T6i;IoXUkZxipXvZ}(LUq`3(9V6Y_Q`L3z4YicR=G1_&C5c0u74E
ztQ5e=XJKh-#tP%iYZ3JrRYPy8$Je(LVEX`}9J7R<ryZt}tJ^1LbapxGgvHwL;%a7H
zY(L$@)=^a*;M|(Rp;vM0KtpVzVvg%Sq(|QcXi)V#X|Cy~Qv!uVUgoG;wLu`PWjf(`
zIQAUST-E8NwoDz)({XD2GqmMCXm)w#MlIS<{ppKc**94rIR#dNk_g1K+CypgpQCI4
zpFG)nYwA~@tUs6kepA1<*8e_Jm)PH{Ok0coDO2u8gK$2aJ(FfO$++r2ke@T2vvB84
z;vtiHHyp0R8kGrQ{<CL3z=YSUX>wy|E@%z)0vU2!h=$-LU9Q9y-yj=~(w7NSh(<v-
zMTd5yYjd?0s<b0=Bq2*pB^BZ<fj_i1f+JGhV6S73<l!Q96a*Lvk0^MIPT7^5T*5rD
z&x~@z(QIgJiMi#^^-edOC&|`#rHm_IpazPreH6t>aVwC^sjh{yQvm=r!FsB&kJ`Lx
zbcySV3L+GNiaad145t@JWXUS4q1i+3ufAEY+TMW`WShLu5WmwfCdJn;o2;HvyS!rN
zF3Y_&S$F6!9NULB$UaoaDrQWGr&yb<;f`2?M%RQ?v-(7r-Y($u&^X|Kf`ksJ(4nQP
zToakur);{iJ+;DSk}W|tMY<(|nY*OkO3OBJ-u`SKEigJN+X`jIFGlP0KXGaOb(I`r
zd8-)R1O#s}6qs3Nw-8>~G9D1+QdGlF&ldy8SUmi901^D_Ly0byWiaAx@4!fNd;kLq
z%<PB_DDwM;t}Gyn3-J)KLJLumTr>_w@@6x+%bjIe^P;m%htZ01fJ|^+F1#Q-%NhAB
zJK7(;1D-wEKj#kZifH{1t%mH}Yot~|Xz3maGae8H<`zR^XyXfG;xa?34A56SWwJaa
zr|fk!1WJJTW!Y|U81TO;M*lF9Zx)n^HA~}#V?qesUt?%&)DGiTBM8tQBC^Z#x0u3u
zQdcUUC#O%KL=O);XUxc3zZ5l%GD0Mtljk2HkaJ*7Sk#UVeX^s}I7y2$1$2+d!i|5D
z8O8S27vg6)9BxB%RTDqRrnlyNMFMb1h*%H8`R#LGGT_wkMFN(Tp?t_0VZT3g@fb&0
zSJD?x>c|)XppFh#!OYzdwbw{c(@2pZM{CFi|9Zyb=Mf>_E%X_Nd@;vsee&=jo{!D7
zht=x`Tbs_wyAB@h23wmd#pmcP*UpXWbgIoX)*KxZkm7(sT?r<TaT(K7VhW(<q#>hQ
zpP1unm0vV-&o4)+P8toa#-mGNG!qxqz*<3b>#3d9I%1#oiSqzEG;2z$_wb?pVS4af
zABRR@+lTcdvpTzz#PA4@LBSR=Y8=^q^X&dB+E(S8@SnNWKIbO-e`=TP6}h^Jb#w;Z
zYy@o*`i|zkt6)HZe~9Zdma2rq#pKi&ZP)6R2g4!TpK6vh=Q6>r4BB6W-!A5ZpM6C6
zt5t_v(wuiJX4uuvGIx^LLt}}dV*qMyRWk#=STW%PjHXNBGGe&xP_Bz6l~GK?oW@~4
z?qw*fYYT+zElIJRw7t-*wLXCx(=iHQcUqkJ*5>x(U+a`Qm@Hf6IXszphYg+$UE^2i
zuC~5y0R`{*joqDZBlPhiJp^f!=A;1#r4v=N(Iq{JD0mAW#`b{a3#tORiTHHV-Fp><
z6GyM*DTif@FRVYe%%<k<e3_|gV!2X=`l2%B^jB8BYk`yPSWk$;gw$oe5h4OWRgQoO
z&^wa|{ekf4S(^h(Q~6>MHS>fa7^v{!-*Tr98v@lFRoD>qaN^9{tRT$eIvvYSqrJfM
zs|U2lprVWH!fu4oJiUhkLTQd}OJ7i@F#ginay3;`Te#_`PzV0e>#izp_chaR4W)Ck
zx__*Dv%E!}JPfvSr5En6)%KWvP~a1f=TXtT9igG!VF#iFWK$>>&0Y95RKjOkMKEnV
z8A5DrYG#c3EW4(gLFWG4J$cK3Db3HaoN$pyz*5*|=!`sgQ#L|!aNxL~bU_IBH~nwS
zD$B@P<xUu#`3MH|EKoNL1ARsMaN+eIK0v+UgMOtR)-USe!;6}>d_2G)Lg;0#)|KjQ
z?%lp=Z%XE-X5=nRS;LB8-3Z>Y?+M2X;3=Xx5!n)<n%G{%>WRTwfTg$03=1#tpn}Rx
z81htlMJ;9pV{Ngn&b#}TTzwSQ(7*G-iF4)YeFiV-I;w^fLTIu*?Or!`Y#rM*C{hre
z`JLU*Iop6V9>v3ODlRQ%0!%2oqz*t25IahEzYw$MDGEN2vojRKAcV&5oD8jKfI^yi
zyUm92MUOafHS0)dN08lfI!tahf;Ye@qJ44DkEc;@HgvM)<~$5&EU>9DxhhV_npWEI
zXDRG05xIwG?+b&17c?y0l{T1w3m!5mW8F17>5Wl|0muXIdpute8J`qyO?%u^-DD5a
zpb_i^9m66&=)ePu;OJ2dkF17@9<|}o)5jRl-+2=uGO#2g#TOt24^^2%6<5<m56^8o
z?mKQN&)fjR<F)w!s{as8F8~0epz@&NJBYc50Jfw#0l2IA801bs&V4Xroavn&cn$UW
z1r0HNo;yZ*yPR326WvS6JoPMTNx(E)ONHbkBoiuW!g~`x>*QoZ(mP|-IJ-$GYXjpF
zU24J8GmN&6e8L)={t|ZPmM)?c?FHvkl$!R${V5ueg5f5azDGJ~g3ye6mM|)|)9`59
zS{`3mbfG{KupFWBadvmIY6V6ix#=yf>i8XF?GubK>zKQdDYI5)FC?_h#CgI9GsNBc
zz%#MHCB^!63j6D@ZiZ*pCzdA~&qwxg0V_VI0;Ytgr7~u@;&p3jTC=cQG%7P}r5PNH
z;N9IEg;=;iu1(`dJ0P(>$v^^i#cL1N{D4mcT3~al1J6K`megf#oo2C0c68i$nrWP$
zb}~<?so4~%>aYtp8*U`FWqF<}hYWv}$GD5_qi9RL4KZx}Gjot<Sq*XlSWyg}9r;4|
z4h!1+n0sP0OK}~8z!z15meDkmsK%oAF{;6b`R5rmIDQzYaUrPN1)ydVT7h7^Rx6x6
zY-n#i&|)D!8qYgwQFU`v3K}T}|6<8Q_A|`MAYcRqed+vH+ynSoc^}{>zZdZ1><1El
zlvG}}Cur~``y$_Q=}ws!?v(RoJ7r$7Q|8&V_N-j)v1iH~`X}w4xwC!df9;?A{xPOD
zs6k@8N}$Y;AG{>-GIG@qzMGHVkCU763-3NNWBfUO`0!Wq@w}ZaMvK|&r({t6$TJ0W
z#QwFVV^|+#?z08Gm)akhTk&I#3o<e-kzJFr$`DvT$BQio*q=$X{5e~5VpYl7n+%)r
z7so$FJ|RIlJ@KJzenhnBCDEcz46;EoACqzRS`XNXwYu@@@uG8h!8!gXOAne&p#R~Y
za3h5OzsAICZ<8qy*!X$&?3piBK+A0uC^W;3Kwp`d4k^cUFtHqt{n!fx`HJnK;xQ@Q
za-K=YMetQRL{<Zx3L6Tk)d_x`_!=G~PEIE*ou1CDJ|@CvC_{oL4-JE(=E0)(n4r-X
z7DB7N*|c{xt>Q?i!&(j6)&0%oq0JZAS*~=1r6Z&BP@_I94zDC0OBL!jpj|^-vL+uT
zV^9Y09Bz4HG$!{@*_UhV_t>A7wn;q3HL?;u($`y7+BMPR0EsgjbzmAHrJf72pyBz%
z#UMq^w?yd>wM@n-QKM#)Ul>WTy)Y28^|LVsWEbRZDsX;7*zOb{1ZFU0|1z4UAEU0&
z7GI%Hd*+22P}j^RQhQ2Ml2r#>tU;w}p6xY1b1d}~eUXI3QA1ES?qWZbIToz=X4!I!
zP)U7!jL4tO55zRG3T#&Nk9jz(X#uehB+;n^fuN-#$dj=~E-EJtZjEDc!a-SsPWsWU
zHCJGO;p<4kK3+t|L!^!&YJdT3Y{85}wPOh7)DtF_-N#MwPHJp3-jBwZ{TSoA+v4oX
zl2XDL>#ssSSBM?~&2sopOv_0FNHvszH%xmEDB8kX#xYEpMk#hqv73A!AJ=HbpnVP5
zVjO6W&sxudeBh7^bSQ;g81_}JPLd8Zt(^l=0MI9iT?9|!WInAs;_Dt!7!>jcrMNfY
z*tMy#!hswAly7pFnDE-fq1xR=5Qx7s&Js_uZ?uw(BVWiAOc(`dKqC>jn^UVQ$`x)R
zx)}n#8syUHr*wLe@TfNcIR?8gf{Ihjb5N0@zI%$I3Hb>V%*eVlwn!-^7@7c@Zp<i)
zBT!9cMG6j<co@jZ*YXHmuQXpmTo%4_NgL)va1ak#ZVLD=Nao>|#Q}mK>pEQ%U&H83
z@JuJe<R(I2Da=Sf;@#|F%bHla;MMABfm>n*c=h0&;5!uPRNt`y`a3pngD(#s0^<4k
z9eIgrtMD^7-uYzmN5;$5Klga0Rd>8-n1O<G6h+z*!QU-LO51#RkYO23sz&o7zL;be
zU{iersKJiejc$NV0AaDcq3^7V9liU`eYYtOrB57DbQ_YqULC?sI9?BTq4zirU59;D
zSakwaX?&}Zf{fcO*1Tf5f7s{D9e`^sB4s*Qs9lR86=AT-3GmS+X`R@DL!ATk!h-Hx
zJ0OIj6Ju`6wHr;hvuh2nhud}Z*B`3i8MXtBXmp+}XEP`XHr#d|s!*5Ppb$I=`{6d8
zOZfT>zKVo=gw&<1G>k0Wu5%>^qfi+)+Q4w@#c=y?!PYZu_dERBfbW|=^+w~BFm#h)
zOjdhh6B)toBUgOnTHqHttODkqPQyF7x!heD+bB=~R7#BLx>|g}k)aF=qN-LKy=#`d
zkH$_TO74%9<l^Md^}q>AX6|t38KHO`d))-^&bEs_r_6-W+=vwu7tfRcVXi2;duSs9
z+XR<%!{Q6m&qi>7)DK@na>-CL6wR*N=wd*-dIi3~C8U=jtL$z#F85Fzi?Mu#4qFB5
zc+S3J1*&Jn)$h3u4;P%=MS?C^4`xkdw_!(DGl3<PD8e&o8dfVh1aIE@GqtSNy0$np
z@i=WdNG~6xm+NuD;j-b&P(x?))-k5c@Wg;-7vmPE!-T#*aa2TlKW-ArmFp{5=N;vE
z&2T@MB>;V>j5SE!^+oogV>qF<H2t);PD5}`o|Z0mrSWfkE5DL+VkmFtVCvxU(Z|AD
zgq&(*P7U&^p)19<4rh9lSB)48VWZp;0Ncb!<T-`NIIAQf*nekM<l%NsQG##>I>7_I
zc}dl6yf6Kj@?LNZepD|5ygM$Z0bPU31WgV&bD>|sbma_F-+gpp$BDQ3#xS@r0}<U)
z(C-$q>Fd?>;kz3Cgcm<={>sjJint%XtK**MIyK%6SqSowepV3wYDihSGK6`1C)8RV
z6#44QA!3#@t8$WK_3j~$*nj)Zc_aB8()aPC9A0h!ViDBY-6mt$Ks!C86AJchtRXsR
z{pcRD#zCt<&9c(jv%4C+vT!n|S6}$H7<vSx4VH`A#irDf7Nm5#V?N!nbH?Bo5sDIh
zR>m9unh&VLubk%#u#4-y;RMOGtf(jWbCG+EqW|<06xC2n2#lA@U6%*VrP|PN)xpb*
z?tN^JLF;829$&=bFe=+<IDC;06nd|K$pU4GomVBTP_*Z?7f#&xUY>6QNf(F`knpGD
z1Q>A?R1)dnu=!O?>Z>x<m@Q|jaMp>QXSkyDgl>N7(qyTiWOtQc#=lH|2{+IH3Bg_Y
z<@UR)=(fSs(hEZs{5O;h`xYVyz#{qUq|gU3W8qi%rBX4v0p0?5gd3hKlW5x~d2RbI
zzc^|(epJaQ-ioZ+e);7=uTo#1EY?X#7vr^O1;a*(H4yhDb*9C2ri<##itEf4)d`F1
zgp2B26xX>ZtW&7)q0sWO;Q@$wJ!YXLVG+a&m6ydUcKcv+`?gZ|!*kS@t)ac`C%#^(
zz&X(DMc=1O31xBaB0Puof+$`<-a;L!08ucHg4nXRCJy4EoJBa=K|j6}V^_Ku(k?vg
z(nEGkF{xxUno$qs$ZMNxNOts4udw#*8j~CRCUo8m=#2{tDb#cd9jx7ZdhD4t!<m>l
zXuKMlqgb7h%4`$S?$#5XqM2WJmUMBq_|uewZGQ6x-Gu#Vlb_k=TlV>u`+VCz-*%tx
z*ylU$^T+o2WB2(J`}~Rf{HcBZ)P4T7eg3uk{2TlH8~6FQ_W8H&b3DWRt?A6roBD+*
z^3o~dL7``g>^Vg|fb>m~eW!>Ao5&PtIYm4$4NQ>(r-(qzXtezW{OE}v!ay?+CYE7U
zxxPfrmB%XKwkca}IHt)oxtxY048PPEhU3dQh9@{}og6yW+A16ahC2XOJE$PJh@CV2
zIhiC=xcUH>GdKRr?O^cB?dB$>f2G9f6-P*K<rq%Bcqg?KOlKY5^jM(~=H(~_B8sys
zjTo+}<_A8JMnZjTCo7D>>sq7`9{E+vOFx`@y5<T&<Y)tAdhe|)M2VI#_{Ti4k^rNe
zBk6%y9{TvgX&QKgG;$|d=zprw8T(4{qY3i7hqjA#PGhF|2pH2i3P+5rjYi!>s<HrR
z;HV`<EtLlI@kKa9TVV=ZPBTieN^eL?eR;sUipiWY*+HXn(Gq(E52W9ovG4}>64Gq&
zeJw8_A#k{)5N<gUec%Q$_|B!4P@WIP<fyR*TO4iN%uoDg{W|I)>$U4jAgFE23KY2F
zDF1c=5P6@vjGLHtk{&uvY5H`v+iMd)c=7vWn6!#k_#rQ1)=Gu0y751DH=hf~O<q-7
zl9K_?A#AJ)uS2D{a!R#JE3cvO4z?Y)u~yVZKN&~RhA*oiiK>EFSwahQ>o(w17!0Z}
zvB@GkCC<C^k1`V`1|eC10rAT6gvrA#k`%1n;)B9!r5}%qz^1lg(f)8FJGBC;4nO5~
zS$<SBG$zh~+x?KO@orGf5ePDa^{uD1hfC*BSbHZM4$1v^t1E<`JgZA=(ywrAg~n3)
znV`+rPKm*pP0d!c%8Lx!m^NAfv`JQY<9-U6q+AztZzDs~Bjb<pT8`i^t}-=MrmI$&
znJTkYt6Z2W7pqnYO_gwY6+@l$*ztH-`C{uq>U_aI`l?sDd-A)ZvbJcw0OjF5h4&pH
zH^aBP_f;sjRWdC<FzZH?6H+MHLR&)p(C`>3!N&d4TnD^^MQRpJrwag$=yq!<48B~v
zTVeL|v7?cYyL!RM7mqCGMVtLBTGdJUqUN4DQ^d>bldgha))wxJg}7kRJSuCIdu-1o
zqxfro{!iYY#T_lZNEq=31@`UsEeg#Ry`C<9JzM;Gv*a~?7A-A)7NGoM`JwwkI`)sW
z4aaFw<LRfiUMQvWy8on|v!vI8ja5hu<5tSyE5GO?G6Au=AC=w<o0B<GhWW9YM1EAS
zR++&9M6fPeMW*U9GvwkwQ(;sj2`v0V+E!-dMO+!psOVH-LNVlH6U{Q|F|jIyG{Lvg
zHr8lYvT)RCE34vw!Pj7O5cJ}Z23#pCApQ8o7l4+YIeeo`zDO100nb;(@GIA1g@I+2
zTl(O65zFdnuDo=1j!CM~S<rPMTAHNC4Wn{HExaOQu5Xn#)*4mB8EYuFT+0M1=q1or
zI!QQjld1lNjoQ98OV&g`DMF5egiRJv)<9l!qi}*X)2gOeuLqT@qyqnLZo$9X<cUjW
zA|?)MG#CH?X##T!tLo0Xa)tJb6&5sAHsQxsWvPV4Q4onr$8k$w2TB#{h>XL^P*exR
z`NYSV6pOMZpr%QZa#%%>nQf7~Jb*Y8VJ)%d*pZvRRUW>p2XWnap}9dSb9Qz)lZdRA
zl{*j}>u<SJ#pZdtB)>+TYr(B&EcoDk9u+S1p>Y-BS!4SDNYF}lY{h$fM!3heu$iEZ
zM&VwixT>Kk&v_e9on;pVFDIn6d%#_=chI}U!@^T|&GIRhUmDvTCwXFk6$->6SgXtk
z5?jlyk8KBoT;eZ^zi`cVk?zvGLq`T|qXDE|K{Xs;fldeCWrHDcH)!jG-%=0kPJW6k
zfKmxCnTJr;#>wpFiMyNsEU@9YJ`Hksm=t(wrLqKuZ>N~VZmI!vZ2})jM{z+ZJ~kYI
zGeVRw8%I1Gk`UaiokNgdL7PR(wr$(CZQHhOv&(juZQHhO+v@sj784V*n$1K!EZ#aJ
zUgmf1xkL8^ux@KvWR`t~z@i?xQaqEf)bxX(oj*x3?{d@Jj3q-UL$yv-`{BYG{i|hS
zZIOR%Y2bW!&Tz&g4gbhAlg<<UWijis`IVXH9?iQVQtU?R`UIhM8BvRvBC^NrlOzV^
zF^Ncf%2^sJLt}cpN6KtTW4ptB1wONB4EXAL!&MqnV-<$y%9ts4emBHgDAF9YhQQwE
zR972_dWQAZk<k4>j&4E}Zc1{fZ4NP{_q*X05{vQ`%7XzXD8A>csYG<)d$GHxv563l
z(NPGDE{XcYz%UBj;Sy+1iNstKS^&?j+iRT?7xa-88x%z=LsbAts$iPrazzecj(R|t
zu`_yWXxKAh#*+80hP$?kpub{Q$T5^Wh@!U|>JHEk%5(TM)6<{{U{CWPjZpzKS@uJV
zM4FP`;5e4gn)z~lbD1I;9%Cve_GOF+*Vi~%NW$CeI=isCZ~?=#yliTLMf+svp^ts+
zr#Ds}GT*q6+2PByo*5-lzSCrwKxzU*3>_%TOt;Ad+rK+v+(qY0d^_yHkmFE;$go{S
zpDFPqr!%RP(PCjANaEqqe7Mftg`I~42~?9+s6Yf~gpDQ($vPFwFof>G#BNjEyd|>{
z!;PNvb<bRA_UMS8RSp42xNYu7?&bqO$D9+<-qTgv;92~Piv#JI?F-bzuf7Wyzc*KY
zsf}0ZDZbTh?W7pig47(Ww|{aty*NU(K5dL{iN*OScoB0!E-v9inZNB1%3@~(2W6}!
z0DqzxpNM8W6`+s1oG>~>0OSK(Z7^$fiP4gSL3X%-O%*d<T-F?<R4mni2WfUK#0<BK
zxE&z*HrU)4QIBpbZfK8e7$e({27CDdr*ovY@4wBCJFl!O;ddLP&Mi3~2q5nZHe-71
ze==dL-0dC$>fH5PTK8_B=QeYh--S3eiuSvoSK*UmtJ7zT4|<@?D&1;=UcUyEX4>ee
z_AnsE%*M}fSASpF#yUqX?`@*%O8`i=6V2r3>S=j5AXdy^UD5_Xla9)1HA|Dzc5Jpm
zFVE-wE%bJ*Y^b|x(RS-RNH6e@3^!z{?+nYVS;s*-U>A>WDkfix;*GAbPgB`_sW4ZU
z+_FP3TBh;dUsxLJ24;EOyO6wm8FxL2R7-jPIms!~9+gITerfh{IL!vw0@Mw#?$uhK
z45@LB>voN-TH@6q?>eWIymD8-pjF#zb-lVyo0j^nPY>YEx!CD(jT@~FN4F?@wmtn0
z3Tz;jC(9Wx474)`k2>5MkAGajbEOE2qZ$UjfSA1~9?)e8_|4b|Y;uH^9vi1`8IISP
zfG8EBg``<L2EI+U<pTe5-hXJZ)>8TF5Wt(eZ4_GF@$IHhXMA?DW=mnYx`h`1s)}_t
zCM~~iQqth!RQvWH(69X^O-T4m`B-_8d)LXa7{Z~26)xs<6GcCQf%(}w{396t%5O4!
z2#^0nNA)}{kHL@Ir|-8ea<0Ecek;}^cFTykWt9@0*#4DjOUBOpg`hO7Q#PJ%L{qDr
zZ`un3iN&IlM@(p3&!}F5Dm8IO9P6Bp8jD?kub<oNQE5{%Xx9IkfAV@2=zotype@cH
zRLxG$954g8c{}`@+Nt~`okCh0ua4-hOc5(mYCC3#JFwL)OgDIwh)a3M*Y%$Z<9Z|e
zhx88z4-dclqQ??{`B?jLRMZ<O>zf$-;@ph$!Ggu3j)4Kw_Hgt1Iwz;LmEAqp@A2q<
zRiFRe>@mxW6x`=S<-xRfB$97?Dp38f@9T@;8}<6aUcHwt4fw0S>)&2BfzJ*fm$1h`
zt9%$OuAA}25L&_cK=3~k!~lGI|IfG0QvKi8-=62`!%_KOzb}u+%bZ&FUf&0k%kvdv
zoR^uT&qRb}s4s`WM5#YGXH0Fhy>VqSu_c)e`=nOt5*7F{3?a9Lo_;m=+twa|8vhV)
zgj*05?iQf`y_`<#4{zM?8TWKw4;uodnU9az-=@OlEJ<Bq!NYH@DMo{Ruk}(npm->v
z*hF*V+4=L`n<ZF<M0b9qmR>%CkDIcwv6ZRZN8C8MEa-M4rOin~DYE~X|AcL-*hWSU
z1aC~hFzJd$Z`r3tUaSs}oT9-xuHji|ibnZuvp1=$-(C_?cb`Thh_^m`pnIA%<=j0x
zktV*O({MWUUCWdn^g$O!`=n{{NmD=6V;#(k5pQTP4Z#peUj;-a=XfQdotP8VqcIdQ
zpq8qI3$#L?Kx0}B`{@6@l`-kO>AqKfmE{ZI{+o=ua0a0M`WpPWiI0l{q3jLmjqzU>
z(VS{h`r+ai8TD0NPulEg_eDnxSAl(@7%>{;ILolTz`=eR{Q?aOj1%QZ)Gs+Q*KqLv
zq)EemMI|2C*MZjPd5$UdANgI7#fa4u0sAW@v06<K$)*OgbpOoMK=%frCYQ!4&k@BG
z_r|U)hmQ<hC>m9Y`q2I)zx5O3I!7V|e3UR?h_E9KY%gQzOKxNe@*FeV@`VeHKQPq7
zqxNQrSk7!wSqnEbYfhl1g@8;6Ed*v_cc8g#(o9(OxnMflC>+0>j;z%BC4K_Y1L9xU
z;iITBKs!XrY0NQ-$@Inbx+IOIVFuG(psr?jvQ~Z=u~THw`<Wy$CpXDCDkl7siVYI-
zR2JF#Y=!sSd4JHvhQTqL0UNZAiw#=Iw1(fUUf`7}=e?1IcLa?>`#ua}J{m-2WuE7t
z)*Fa7$eA#EJl^rU+*`hU@&EGN4Uh*XGN&G$rpNx*C%K_pKj!9+j;#$yZ<<`2oc32i
zoMLp^;)!}yyK}_A;L_Nk+t%OC|0qZ6@8&*$^6^woi$3(o85$=H*x*r#fve66e%QbU
zI!-8s(uMZ!Nx(T!Urq~SCP83`qIe?IwI0LT`gg37FFErB(3fVP0t1=F%Zf$~T_%+F
zxSp{Rq)HlH)`U5B&F<~QV2<pmaf^kf=NL-vNn<QGe?ZEpo<W!b$KGx>>?7mbbu0hj
zQ5&$9pNrpNBXIEhS#I9-DD*7+KQkKXK>#SajF}~rQLZZguY=tpM}9n?dwYLhzFBju
z=R=f1rhYfiWI6A6hRIowmr=3X#^-v-yi$4m!`<rIJev;x{mqkA?fBMzu>UswK90s$
zH@Ow;F2@%~<$q|`zHEp!?lKND;Dh|L^ruD}--Dc_cYff%|KQTqddyjXOarXuT|LR}
z%|ZMbXZVL;MS(QaXkJJJH-|7|LLjX>X(0zJ3K*kE$s+Js=wMb@s5fnv^t4_io)%zm
zf{xv7@<f3%dtmw0e<eiOktTD)al|i1vL1G=4A1pzU!r9veq#$097>Wz@*#)KuiZF?
zC|k<UQ^*ZK7oD~N?sSa;C*XjgU+@ADA;_RAoX0^U-t4pRvNaY`umqSI&Nd56g|JY<
zDk>WD*)ZPZf*g&?A6UagG4ho1M}~tPXDswejK-j)B0sBOb8aYq22K*&4qFzu!f~Ep
zuVRU!p>Z}oWIYmmPV9O60i;rGjJyLfPJM-u2$+iSR@6P5QTm+-zk^=4;aVpPF;ks2
zv%>@~X4xgff_AtB6bdH{O^OyVCOCR3<gs9pGeP=&NX7#Nhjci_8z@p_LRcwSB$c9l
zkR7CQBQp0EQItfXBtk<%W1!mqbu`LbKpJ9Z>fK{QQd(8e@L`!{tCO3{rR%?%R=^!$
z5OTH!n}wmRFJ-(EggX@eBazg91=bqSSbipz;v8<pz2&65rEI*TYe~hNpY++W4aqeM
zZf>7dS`E;XmyP!`w_|?|PVXO-R&8+mc2v6fQn_m0e|b3gy<$mjfp<N)Sk$=qGWpnO
z?4e-kmTwj+2h(MZ_l?rz_gk{z%GG~wIp^o>v=;V~AG~-nui3dA_~_c??$NW$=cNjt
z4-1ophtsm#G@HM+?uh$Y+&A2w*?%v1SK`|7isi?q-vYmB&aapTe%(lXbp!BW4Msk_
z*!Z&ZZurQ;!O73dd81&>(fjRYep|Qhx45wzz$nlwcp1L(yP5Lb=HZ!=d40Q9yhI`2
zn|>y3c3rdU;jwXaXW0CHv9!L0DK+iA21GFY6CRK!r{!(?weV37%50VUPbJ(85*8QV
zRqMwS?s(6)Zr5kg2h_QWE)cG2Zs*<d5*F_34Pf&;yZ0))d3I)2tH1K_&=<(N)b&Hy
zyLQ<V4+qa3!l5r_wIHdH%q_keU}=xl$KP|ulK2baOx(PBaq%&!@#S6-cIAs!0K#BS
zL@n3A*GI$|%m6p<U&u8Pg9YV9|K=*K2b{GZ$s#wmEfEJ7Kwmd=E6Eeo9gi~^Hcqo1
zZi{|%+>6%R3kJ5==1r4Tm&Y|+s-^R(eb(F~r(7Ny?8u0IPPa~JG3*Aopz}{S8(c25
zv2`6Om+d;=U6XUqt5*K3*$F1|@V!lW&Vl>6?nlJ1%D+QRe++$-yo4<I794G1u9EmL
zfX)gO9@JIfA5ug|Ln!s-Dduz@p7WlaQx}DP<w>h68)c^nO(tVAd|Cdy1!8P5$wU3b
zH`>LW`S+|9!%A<zr*Fh;w1sVZUeVZYZ3I6z#d3IP@0iOi-VoDwHthpb=UZ=&eqo<P
zUuf;`CvsZkE1n(ChwD}D-7B7NEDrS6s&im27&hqLJ++Y7rf1Rp&077I*^blW=4tQ5
zJJ77wU6eFycbj=CFzRwcCaaGJRZs8c?d^fI=7WB|;a7&d2SW=;+-tpai{_)key?iN
zk&0WXu#V>7TgV#IU<Of_y6T1g%))4~%hoi^8c$8O9b4$lM8|X@uAShAd%Icy-QMmi
zkJhxl*YeQY{*?nFvo7%BL*EW4pFFyt+r{C#ZNIA+cW=jp<3m<a^w?E<dS<=H29qxC
z%^44OG;~cqJ!O}9kM9?zLst4pg<$C2(dcLz{M$v<y-ycJpS&6neLj2AQwwtUozy<}
zanDUnmmN2$8EggUrF$bA=rk4AplvxTi_s_4rFG6S+J2&vMD6Q*G@n=9J6YN{-o8@p
zUbNN*<vA#_q@DGf87rOp&Re$n6n&^?l6U!%e{4%XC-6(VfgjrPKLWt<1%cP2tmd3y
zN$T@gFp_C$buE-L8`an9yI;YNyC1*zzoN%o%G{rMpCu%qX<z}jfAK$iUwLz1)^ew~
z_;1gbSYX6IvRr>?yRcPit@Ukp;J{{c(6yg{cDg+7W&d5b_(CI0cJI{J0^*%Ki$g}%
zp9_{H1uFDY;HSktNbXZ?`vnC313Ux^XP#&Yr<CCcgcO62JTbA5^P`j+tCSh{5azCr
z44xZu%CGAt!w%tUEpv$TZHXK)|FKAfGc1#>{^P`9EER-?eXE614?ljN5u(vgoz$Ze
zo@AsmOAUZcN+%vU;m`nIT}UpSIU}wpxD}Z`Xa`rSxYm2<CpoWp9Du@DVrH&xoCO={
zlQc@>INxK9=Rbc1@G12wdbv#LV7a^x;;XRzI}aqN5ea2QDdTl%&#vtm5dC|Fb4M0U
zeMd-k!ElLr7UUMtiXEnWC>Fm!5hv+zO~cy3Tj(+0hm&5quF3!_iUEQkF7Fj38iasg
zL7PonV3$dL3expzg6|a9|0%2awQ|5Hx<#7Tw*Oahdw$0*)_jqhKljy(!DV1X{?1JH
zGGi_g<smD{-0@9|-ia0yRC&KNK5{$xZ3(;BP^pE*scPIJ!q9`$U%#Rrav(n{5`f{R
zFCa94gnP_Y6`oCVCmfTKy=;(mBi-7rgk&3N0T?ykf&uB8jb9=%Dl7i_k{skpoR~wq
zJmu1A3g=BYY?N#hFpn082__dg(l7!Ys#pxr=^ci%z?rTP5Ncpw)j|o$;W1lB0Bfa>
zbl{{2fH9<Ae(z{S(kYU0VSZE}JOWa}0CaE8>91Mqaejm5IJ>OkO1m%U*kl=c;UArl
z0-jyQVZ=B{Tg4R;0B-Pn2g9(L9(6>6-t-{Qa-stDhEAD>tBy-ziA+0uA|grFKM0Ie
zTxG)FOD4e-Q^NIvivwm@d5=XEa408J3pQNi*fA?}@Q&qIXPQS>5Wi!G*nTsrM@=3X
zcCVBU+hFrXUK}GdL=Xg18|27NE2NmXza8S4snuQ%NaAhfafv1yy_w7x^b~4;|4>E+
ziWIa^_M70(iR-sqPR{t%EuO(zR>B<WvB;5r0B36V=g0-~OK*5kHE`B^J)M`EHF|wu
zC@gopX*QNCuvG<<#NK14zr7obGG`Uc^5j^5uEx37k`WIeuI=fl`OC&rta&X(GZx?h
z>}RYE%*PEwP#}%)!?ML*W1IUsA>qm{DH<(8;|mmwoz;9R5hqkv_ImL_$KKw`9<G{U
z>ov|?<<tRVu*V66?j!0bhmm=$8*8v;%2`wr$FMg9B19RU3{GQ`4O0quFs73*aqrz!
zkF>f*@AAS-n(jyf$lzD8m`)AXHJbrcuH(>vFvI}%Sb5C2;(=JitSE145;o*5Ek8cQ
z)9Pp0>~#pGj}6nUFPBm0M9C^CGBIy3^+)GNA&IZe*=O>D#Rt(&#enAXrAo7!hn~j=
z3pVvgw<DslZ5xac;8^F)4GX(tqE!X2QzynH(K9+_5)F{H_3u%Opm=BX3)MZnIgK#y
z%!dY4QCXF#Vyk9&enK4PDJ7qO%6iU6+Uca(AmK&<ex6=EZ#1vecd90qRDgeRbd*Q$
zr;dW-X3+qV<s}$8X5+xzNQ#w2*qkzPVlk{p2@j$XP6xS9(7e^^K~xVncK#$5x3p7J
z?g9%G7zX3sW1FTfR8o$nceFwOgTBG}@Jz)SYWyk019ZR)LT@j@e%@Tpb=5waFd_<!
z{9Vcmbqa8*KMvGyS(X$YC%s6)6cgqgl;a)|pbb7;3OAzHM;xXUt(H6AS1N)f>7a(W
zk}Gp2^sMib*$&_xH)KsK4ne~eoOKjk0Bk0RY$9wz3yE_`4mwPFRQXR}i529dc^uGc
zJJHDT(JP0lU@CBb%BS4jraRsOG%9$c!i2Eqr7?>)j7a#h&lC^Zd!iUsGKhgSg6XYI
zMgtEu2K`qr`Xn3-4ka>(X=k$5iryl{CnQM%Vnwa$XFZuCz$>{02O|0=E0!6c9UBmF
zvW&~G<i#dO%G9!o0c_SXjzBX29C7twWIqzvW(ig^q9J)oqM14@NMvU0NRsYPrp53g
z;qhbPqfke?S?}HJN_f-uoA^bhOd1BHgIIF}an($=f+r1QPnj~{g^@d^%vP4)T-CBB
zA}A)`6;+h%;mpbs3safKq%4#Vg&YyvFFOq-kI-0yHs9?MxlIwph?Mv7Y|C&SXB^74
z7u<5pFHM3~qgIUw^XS|m9-pyX$9a8Sb*bB^hvToY#uKZrYoUP*UDqPhos?|Y@?#P(
zQT`$Y&Nn>WZ?t-(S-ve*3RlcaV8#C)6j+G?^E>&WGGtfd%G)VoK&B^c=p~^jLIzgf
z_H1sH^G?M~;yOKJ9mn?mCU~H&6Ih-zL6b=vxAhn{bFORi{ESPYd!zd3%>eUQc1xj8
zwaZw$c14bPA>$CeObymF0mAIvdfrdYOF%(>=zxY_4&}jqA1Q){D2aJ+P&<;xp>800
z+VYbCFCKt>Ev<O|-)~ttrSY^=Q$<8|k=5g+0k-DergfOzXL&F!7tKXE6jaX|0iEA%
zFm3WqebfC{=LgkhbB|wK@s|?>PcH8xne?FZKBO4a>Oe@S%oW*%M)ER@YmmpoxtT`s
z?C2<;8)(`rq4pR^^m;s$ym-4E|KvVoB|2aT8w2=}7aq<JGrjqFhelg`vGtOq4{?uE
zcj>5ZubRVC(VwBwVA5#+`b0GeA9Nu^0k0;D!ICP=NQjNw!aw~(plHr!N!ORo<b^xO
z)*T(+vZ{u0<kqRoLRs8LNlIn(M62rGZFWKxL@W?3h#xOYrO7+g%rPlh8$sjq7YZaQ
zH=NG6QqH&?QtPM!w~0Kg@=nfp8b$Q;x;1?HZL@f=ELhZYiloT_3wENYE6B?7)DR%w
zcP>*Bwzx0Hr%ND}ly+#n^=VXIOOF3zGf1!J^Ud=b)!Z>y>!8zXZ|mQ<=U{^#XYBpB
zS=*Xxv+Ycx9X}bSH0-znHBvO(qK<zrcOQ}G_vmpten>8V!+CODEo!{u)#WoMecICa
zv4ux3AU8>-G}o9j_OfDytjV*VvrP8o@eIj-@3`rg%v(hVjgucC*rq(#2bXlj>ok?k
z*2X1t6rrUr0xl2o8bYLA<)}c7=*<N~JL)9*!v^aF7vVA#F@W<48D9e;j-eQ)DiksZ
zv@GI<3ZD(~RHoU|pi*|vy%Qm(!D)C&EX1(uJDTE~u$R^{#ojk-S}5pj5AO~PE-ixv
z+Y3qeL=*t#qDzzRB5vg+BfkOytX7~fd7x=n{LEz-%k6k%T~5qpn7iGr=P>;gCb`P?
zH92gBN&#5a7JL`#h^pu8hCDHc7@PD?O72}Oqg6)C`Z)~e5bRsL_md6+86FNhI^&ve
z!+l;OnpbJcqnb}GcUUnMgsxBWuW<<xuq}p{h%M2FnA7Mrg7@+6;Z>-Jy|d#Cl&f8M
z>E59-cO~Zt6z=7(TzVAcS=dgmM}L@o=!w&8x0E&)TT_NJB$qkOrl>LHS?64h-SADe
z_OMKT*;Jf1*!4gZ6t5d}!RA%aIPX0<`RL(N*oS(M>={eJKow5i-kMDE+Q9b&9$0xi
z7$tNm8>Jh;MMN>J(G{x7tN37l81dQSYK_dDS>~N4CU_PnrvFGLP!c1l??VBUW;DXf
zIy#NYG+f=E>;-7D&SqI)W3ptpa~myUU`o#YzXdLFoNxzZP&@HS*bNs%&E7K;=Rr(l
zFy!9Z43YANy};=w$2ms~bWD$s6-58KlDc?p*hg0ICTWT>AlzW?We81c;P_TRi@5NM
zB1O+>gUB0~q5&CuV(Gh|yQ;$ONybz>+WJ&lni#FmZ(Cb*^$sl^V{;a;R=l=q@7tQf
zns;BUc__i9B=L7sXN@~C;x^&YGvMhloqF2I;nCL-H&0Zer#tel*c@;lafb#^72b&R
zXg`WPA~2YvW9UYMVo<(mt~d5Yn-{HIqN^`Mbp!gX@}l}vb7fXIzop?$y5V<&ut>ve
zyTsP_scRM8-q2*ec6^iZdOq`N<#~mY>p~v3B&h}=Xc>#s>vyB=61WM836I4{=)rW8
zOb*PZs=@rcS9CD&i>!nBpq?$Bk0a)2$<3SabV%7Lz$&8KBkl9hw9BI-K?%r)m$h<e
zjeuj!gxxUW1~#zNI)nu~%{WMt2UTYk)$*eAsZL{fGN1tyOpTy##6^8do(8wGo4~?#
zR)Lgq6XPzK?KNY)aE4_a){*_BnNxQ#O*Gs!fWh*tfa@ibuqUx%FXQSUViz1@@A+4Z
z3v=-P@Cu|N3>jm^Soc+XsB2*t;);&nMXd&bWqNBF;L%JHr%odS3x=@Jo<X(7Tc7@E
z)Ev<ZM=qLd<&5E5Ow5)kx=cwWA-|ZSn`FS+vQ}M_xzn2z3jTgFEnu~%D~>dVQK~~2
zJ5B0gi`wB1R_%v6w|5<yIbrI6C2kNXI~RO5B`~X%h-?_7yq%u0y0S_cQQODJsb6Ou
z>^2d56>nL$49pr`SblO71w#Z^CnQqb73OXoF(KBp15Vlo0J+^O=$x1Ze&ss&6XQ8K
z&VT8W8fc4X^>L`c4RZ_IlsyWX?9QI)T#0#x`H9b!2Y?&^q~>9r5S0PGlGd4-uG(6S
z)0y|WOV9L!XqepIIfyCtY19gA92U>xcq_$A5W*bC=&LOt7{Ck7YXL2mTL`FhMIp`>
zWF{qt@5}CQSD;dP!wk~3P4O$TKj5%{!vfKb5DrvglOQ9Ap?J*E7^8qYCZvwi0|rQt
zO%cH$?M|5yzee;Nu+YGtZb11WWJH8+i9kD!Tk4r=t#_`gMEP9UQ|E69;#AR@!TOU&
zD#;*ZA3A*b#a5UikbZX%(GX=S*|bq+NnB1L8jLUti%z@ff-#~tpyPssah!f$kFY8Y
zDN)@v{?tZ<2=4<W5?8!vW3HC|aPP6H;21zt)|d30z$N{35owNhbAZ-M9qg50_}c<p
zkIL(n%O6I4*UaflCV*5DT*E_Q04A~$&+vo29vM4KOeqS5J-sS{Fim+&fe;h6i3N8{
z!Cpa0ydmp)Gj><!Xr)w4WL7U0*rYl{S2uPVN#Y!l|L0bXn`4(MUOvGb6WqE*j6mD@
z8e+YfoSDX*hU{AXh3?O(s@IgAfCpF;r?vW&OqacC1aaE@m?pb=40RDg0b$e~Ees<$
zidh@0fm?)xD%F^k?iM5+E}X32Eh0A&LV2m$WF2ClvahFKUyU!3>azho7PvaCEk~;g
zM-?`@foh&LO&A_2aI9HH!>Ahy&Hhs&k(sF#Mt`mD#)jBkX8T}_EEO!ZZc{T145;0N
zM2D9v)5nr2?aR1R9EwU_g-_bo%*YX@I6FnO3L{vCdzal3lQJE5Tev3dpfRR_p8+4Y
zatG$YJjKPRg&Uvzp!CYeTBIa($7)$Iw>_;TaSW#;(?p%?gX;K=#E$K~jLxcqI-^ky
zBo8IT2F_t<|65qxV*!ps8ZG*Ki=-)7>`Tt#Kf>HSLBfJItg@(SN<<kN-GH3YqG7)I
z+(HQIzDV!dR;CfMqGhv7)!m7dCQF#V)z>+r^0|KB)2&$#fJ9H7?;cQpe~vLU9{F%X
z(UAb{hAd0y$0+xxPO2sOOwMCO0~i8X1Ze}QGl7H1A-xtEx{YuN1VPCMnxul-`$tXE
zY%HML)oe;E7)OpL)po*=19Ct(|H_PYiBqa<htfs1p%I(0eVWr?@>eURqXOY=97GHc
za*x(zeb=Xq)Zgr|++r6e4*)pB0{hU_2AxP^w@7g{g0rw(rn1tQsY?eBm7WFsNm(Kq
zkOFu%G;wDNN)7NNIoJmaOLCJU@o!d>F$ES(PTJ)7=M~}`6_fOvxfQ?7nfILCSH#tw
z8S_r*i5<``$fog+UIP6|EK6NOk-=nBOli!-&$(LFNi@tLSV`pE;6z}Lv%~iO(t`b5
zlM`V0AdxhFB730u_SovNU&~(pLWV_tcqS+{)Ft|A4%Sgmv@7=;F`dObv5icXjQ5{}
z>y@(a+34EFS|aHhIXa~!$IS)ix6Tb98{V9K+<P~>+&ng(m?(WTX8PV!2-@Z4Mt*C%
zrKFgED)Log(88v+T~BvLdf?|f85ZSGn|$!Jy-l8i#sE!EV;rK((~?X6na$WZV8XF9
zdw+6oL6h@85ByrCxukN|*8vmmzp|mHdqkPw+0oHCv8HJ>nc5Y|Ag8t&E;ZGjXD6o;
zh1NWtM!M3davhErjQ2zyHH9i7^+l^R>*mYz@I84^jvEl_xhB*l3PqS1m<6_*LI0#(
zXg9o-Dx*?qkrO(~RZwFc^Wyl`+QXVovWh`0pr16bpU*@totjJZA$x|t8?Dr#FEdyw
zFTOK8ym@DS{wBBS(P!dC%6U44@<e4`6QHJZxLWjOKnQFj4YfbQ=;g0Rbk(Dom_J6K
zaT{&tI+smlF>+(u3H9#=Yol^m_vDMFh<UVWPd{}gSSTG!rAcHG$9f|y)d0M=kdlmk
zQ+2XN0A-LWO|3wD-6z+#E;O2=l~?2=qL+NoI<-6)aE$2HkQa)<fyb}>>U4pz=L^7A
zathU9%GZoYA!mk?^YIaUc`$=|D~+tDd6YDaS(stWgB6)rG6#THD`eJ4NH{6-Favcm
z1|mQTaYltYNm1)o6yoHLtiH&+mCN$|Yl;!5-QYx9`?0*^@N%hcY*^SUoGvok8O`*@
z2$-o3jT|4@Ay(I5m^joN2%g~_>VqFWHn=#(F?w$sJRH`FEGB30ez`4ja9Q58;qj(>
zTJtcJ?hQVt6zz0)B{2z_IH@Znz!}W(Yj63vP_Gl*m~z8DX1*hoPMua|(@Yt2?QIuR
z?xL;T5e31dh}wnpcd+$t_z`(q|9)<4*jpMHsT2;fmmSykUi(#<uC$wfVmkxE+^Z^{
zp_5r{BflauWaS!X4qOrwWHFaVzB7RxEOx<|j2%A701G~D;7^2G*fg|HrQ`s9Sr`QW
zty_6qe=S^Y%=^C1F+;t>3`=3(kl`e>;L_1U&%Z#al!tVju!V%DWu{%PuDb9N5m4kA
z3fm%7C4wpLsg2cEGh4WV1XRo8ff=K^uTSS<LIQ0;bd+4&3x6m2pPGr`h1(+(P51d|
zOcF8CtMj{b`|H!%F9YPvZ%C^R>Z7E63Z)7;f3*HWBgEFOI39BUP|36zF0ad<bLx+2
zZq~(!vj9rcx14Z9Q*1AXBw@!XH$Iuv0)ap!kQ>Liv5J>R5#mCun#T58xQC)lR}daD
z0iTnQ(32QW$o{>~#}l2wsj4*?=s3f3uz*W+zLi`+vLpbn7)HrY_Px0fva8|>XUssp
zp*G%C9vyI*+nE+eUZ3Y$scM$sXtZK$9tw;dAH9J3hgl)^hs1azX1K&B6v2WAWLgl~
z8^%!sQ6LjUlkITv$p3Q5;bUqCVaXA)4@9i<1j*4d21pp`i^Jg<?y52|Jy=sKigzDk
z91g6l3^QBowIg9j)a6w2tKK8^f(Mnb0WTUIUe=!!FH)M;j7Ukamg3#gU<v|vQSbME
zu7oxNUXqfcY>MLsGNEz;7B5vUXgG?*Hf_y|Of3jYb=2vZ0yolwtLc%M>CRjRd+|C?
zjP&6kruFYWjLxwFUr$KoaC_v6K{%i(UO8ZPOM+uuSptTxI}zDP1W%uZ1eift#GY{I
ziVFB&+n!}(`BnioE|8ci8i5cqWX53as0)kM#th06bdQ?@X!pU%PXqQ==sUgq&49GJ
ze<>i&6oe_Z!m#24hB}hb82rPc`wY|Xd^;hFe!$D1HCYyk^RVY7=S3vAmN9Ev-FMPL
zdx)5#9nI@3B<w1AXvVX0c2bt8MRh<cwMQc3qRS}^3=v^Jsmv6KLawpF_cW(Qpd{+6
zM`i|>hoFq6Q>?ToY)hbLTm>ggZ?boJ__ibE?TMVmHEJ2h$=YRVafI6u#h|KuW_F$g
z^bZJB0Gq<wHt^le;}elke6aQyagL%rr|5BIbjI~Zc2`FuHg>_;#PaG)P`ly>4=FOF
zcFEoYv|_DrloBX0t5v>{x(3F*H%V_J0fr(M#^RGu>@xav*!QTwZlLLe#l|vKB(^~#
z+_H%Ykq76lq*lUGKj$zxH}+1c$X%f|&Qrt>5Jseesm=M$buKz#FxREbtU`m6ab*MS
ziNE1BI{Gc;o0g^nI4?o~PqQ*or^TUiZxfOI6N<G|ecxk=ey9qXIM`5LRo0s{WIU=}
zmFgCPTy(z%fC(fD1@i;r5z8Tm2g}VR8+|Vi=rkfh@zpg#CS~ELJu^kMVhBY>)#I7$
zS7Vh>L;j=S?>XKTR}a0};LbqhNgYLw-$XqEKMi(a@*fF2RcNjX)`u}dZobwbVN1Ha
zGbU{&{X!GISSOlu8|{tlS)DuO0n-7-Nw*t!P~D&CmV$Mr9>{8#EoN}y8Dy+rGTTp*
zFlIQP)JWk>?Y1YF=xayjdh$F~Gcsw-^N5}y>z~S62M|nSHQX#}k|ixnq!>KP=cX)D
zt46=4gYL*peF)}wI%oDCb$a1hBj4h?E|94kt^{o%`p)ZSZ&JIi#Rs0vfKRs0wbPLF
zXq#Y6cAs-3#$P=HI9}tW1r<)^c#WWPv<>-msuOjxw&F+r66;jXE>R<YD>yQTB7d9Q
zt6gz@iZ;W)Rst*Ien8*2@d2>@61stmT91945F3sl&HjKdFsTnQ6Pu$z<V93~G?UpB
z)&uh#N<6NYOPid!nSP$w{80LRNfuFRs;HW*7$W+jVqw>}m3720_88{W7rJVM3jS`_
zw7k-J1G{vtSqhs(gP3$_s1?~qbKHcNG(KTW2mXCVD)~5030Z64Q8xH}Ko_V$GSn;$
z_nodH=GV&f-V88h!`#b>&G=A{ab`l9XM+iEu}LeY+fWEv9lukILAV06sMknN63nhk
zW+9^4fXyV*Kv=8!8-?MJkcalVXoN@^VJ(lE2Sk<Jby3lKTCH5rwEZWduBJZ$lmg1C
zct2Xs)jn`oXvt9n%;SKvw@!f)SyPfb@`i^{?aXn&BeQa@aW+{IgdCD}wj|B02|p%@
zdUdgwu;9p{18A+RQKY>*!Sab;CkH`W!K~9wIWT06<#gU98Db;e^HUIDmP5bIa@$tE
zB)e@|(!|fr0?vnEB&cPDGLyXf*w85GoC5;0j;bcWH3&b@3l3PEJ-@Nj_4dp^44Cyj
z6Hk_h5gNUA$;3Tyl^*k)`x8_>TG60ypwvPD>s87S2JO+8D#d+H+s{A_z-b*TOH~2#
z3JW<f4RA=IaMOcdcTjEx9DNn;YX6=(_C2FuG7CzGMT;QjjWof@Tky9BWZD$jMo9Pn
zfff@wfaI@5P1gndjYXbEWx&Kn4-2ivk_rKlZ&Q^O)_D}OwZ_&iEM|xzAa1p{c|0m)
zw0lJyZV|(_?Wi|bH-lC>wSu3bl6EvPJm9zt`xW7d9y|2=6-ftTxyR7f+oPN-!l)i@
z{)NBKjRhl&Sv4NpErfMIt2ld>Pyx&1U!}v2jTxlmx<3oeTx7`7rGVhUb`yEN5=+iz
zl%8DyPXurr5j9!95|NFW&-D;fs~L$s8o{thog%wsdu;Ct@G%QU3lBDXP>(?m21DAK
z5%zlPs*0LiW^4_uUBHC0$`81bb{9WhBeS~>-L>sGHZFxV&rtliV$E2mk|;ss!Dd$J
zfsOH)AlQtkGH1j>&#5=Lc<`a{fG3q2Qsuxw@tQ!J8p)a}x~5q)fbT1r1ttJ0?uIcg
zoj(8>v5P3v7J#?7&l1GJ{uLuRBU}P}mebI%SY8lx>mod3M6<fZ2B-JDY0w<E^8I2?
z0ZlJ!ds|$Qkj@b|WKM+D)Fq`vtq!F5CAR6orAfQOdi(oox<R2-PV|d!Tx4+J^X^P+
zsQ~dYr~#94Qs$u|bp^#y*=u*i>#QzW3S$>B5CHreL0*l938(MFPQZo7LQ5H>Q`nEF
z@M$yw6XKt^dMwf5m2_pKgRb4rXfW#Z_QD5FacDC6CG9CBE{L8?#Wv={A7W1R`<DVH
z>w}SGYutqr=%TA>sc*M?XW6cLEA_{|lyjJ=M48+LZ;U<QcCKU*IUaCEMIs}J*?zMg
zCe^a(H88(%_FO`Mj=3?yfuQe81gLq<NIPS)_@#%)g{nyQaWcQOd?Gm;Pj^AJe5F<L
zb{)qyqD+w6x34O1pE+JzylyMS9VK!>($m{XIwYz1FDCjB)(ni?ziKT93|QXlew>=g
z8Rw+80&sL;XJ99cOkcF7&%fPtWXy}2>0D;M2X>_57+m+mv2xGVG(jrjxYkw-q+H9(
z=0#e}(s2M4tv&{t3`A)R?@HD*K<i`1Ke0?%FU>l16mD3x^SNC@3j=Lb;=Y#y)^Q?~
zCXVf{0?}fB`KEU;?g-BIw$8eCa^FKN7}q;g<en-7BTHD31x8>w4%rppOtaTdfh#fR
z20~|uDDXm?vLb^TJ>1VSHO41Nvin<B1i%w|IwI(dJ6>;5ss8SpO)vrqH$*=c<JzA$
zy=%zv@W7wm?~XHU4H|oH;m<&=QccmMK36|JXZq{K$?<PUgS8t&>no<iaav5;vnECu
zv^BY~<-7uj`Pe6HU->^5Sv=?`&(zH50fsIQ`|BsI75222#nLud6H6rp>oR&6!*q-}
zs;Ww#>ucLy*Ph)tApzAFkhrOT%DUg_!EIu369v1aSP>}es1a~xd~$endS~%2ZC1Sf
z<<vd-)A5D_(KnXn6Jj1tYbR?&O=CS1Gv!c@@W+T>nUDjUL_vpPj2Tr|0R-34%G?nA
zn0!Fz&kieR_E(H8TZ<p68aiO}S<P1>THzko5}`@U5o;Z&uLkBeavs_!kua{3Af%b$
z!<nz9OXy>)rcY)=S}MP>?*Zu8n??&R3C;+IvqQjEmQh3szc@soa;qo@hS>T>yXOAC
z>)KiWQ+Ts1S!_y7CqAjtZgEQ{m{Lcsh``<5whtQL{KfUf()jz^l~sAR?cO)fuI|QX
z`(FsGC6CYZ;rRtFc{9j9>j%xoFLfu)=Y*mX_P_YAzPMa^iq@m=pE>x3o~{Ebhg;CD
zmvx^$!RGJ`KlWZ*8+$uj^wLk*9%xFz4{(xQI&niDkPh(rn={as<)J&ZHMEJ6z?ZfY
z>0C|4weWx@`V$&L4CgC20jI>B^bkRZa+&dJhvX=9Rii|9W9k~L4mqI#NIg;JE(BJk
zz~Q1`ld<;!#l1<zzw7k=C>btef_654pPilP9;d-6=uu*1#t&_cOjV?YyUS*(K?8@v
zB{<Pi7waP$uFLXQcNk*C6A8O5DAIQ}fJDQAl&@!pt!bIDa6@4(lEjGB<Jp$wy-1QF
zT#xZGP>##G(?|B_Mj{zX<^unl&l)nyXMhwN)~p$g^v$%Qb5x;I#vV@&3NGUq@58!I
z{Dj<q5q8BGgcyuu_AommVv4OLPEyEnvV=EdZv)Mi6$MGojU7iZW-j=CgMm=q(6zh(
z%lF*A0m(TGZfu=iR0G(Rmy7qexNUt2PUG*NRI79Md04dkT)u4Fd%oZIyKF*ciGSHY
zpI^89Jbqti<SAp}R%jF=2iswd_k+^n&&_V(%GrBkvFPRGv=R261H8jEzg8>7Yl?q?
zo1H%>!xO;npTF01So2%t3pO$zb-hYcDgOV3v(POfRw(8AvM!~qF6*{^Jl76x3|c;~
z7gu&L<tF_$fe8i(-~sQmn_f2Fil2?4&6aq+%i*SxYPk3=n*KfFO!R*m^uCw8L!D^o
z0^w>DbU!YxVB@^q1BTjg`mb|Z=jG%z2dR&aeuBKnT|R}s=v6-QaPZt9?EO;jTrN&4
zLpSxP0a#sOxAe2zwjua{-)B{>US57qD|~zv{h7U>5P&e53f_7D7o5eQzPOX2jpPOD
zk;|C`8>dwZw^^$t?oI3C9Ru5K>#oJB*X0I2+0_2nI-U0?ZFt9V-oWN-d41AVYa`zm
zf#ucT;&88>p<EM?=zrj>_|XGIY??@7*XB*x(>{Ci+-@$e-Agy?yJTTs@Lj;0wv9Hg
zf-1M{xWRfvf`!@(TUpbfZ90Taj6rft_s-?rJ@(8)z|=mb?HgNm5z=+r>-K5~#`yW{
z{K<<9Ds-TQ)SjhaS&C1@@bYcp-g_D+u|D_-FhrDCqdFTD{fD78o8Zf(i#{4NFywgf
z8Hv5s?l8n%V+==F${+e^m-h@{e9Yml=xk;t+<(MIg30KJi?~OYF5{m59Px(kdyW3A
zhEG3Z<l;X?g9~l$t@EEgzBDC2d3>N=Ou|3>o?p+0y=OoEBco%E7R!MFVZw3!S22sK
zC?)rIbP{wCdgj8|M1JcZv6qr0^$Hfv=~LuhWLDryoHn`rvQNkjK*R)y>_NWBn$woT
z+GIr8;Xxf1QPkkDz3?0HdjoNHMLRmc8WO>jmQ~}XeBILK^AS^Amp$h(a~83)Z<PCq
zEqFh}1mFMrsvaPK+*Bs4;@@toa7dg;=Q%<2Pw+?7GCkLgy+J`5%S~2ONX`lFiNASC
zoClG!Olb<cbRer$<X1PJ6k8#!>5ac>agvYO-h4--6Hu-E2&@HUd=^WhYVJ#Mb0-at
zRh-?p?}A&bv?|Gq5oAE~LyfIJ3KW6tTe)0AwsNTlqb4c`rTHh!5f?sq2fz#5uz0kK
zLw^BH6N7gT)y6C^p9AqM{P|&~E_N8-enVybhqHYEqJb<b@Jw@Ur|S*a)!<0bpHH)%
z1?<sD3ccEL+rD#Dej5wU<Rat6k_EBS(vZ4ZEfOrHQbcX!n3)hN@g{8(awjFdW{>mw
zTuF<HBM&fzrIVRJF71yMm9{``+a~VF;k#|?WduS1k`GJ9i<xjTG0(&rcaH3!V^n@{
z<D-`!CMY@Kh`#(O^2D^1V&%BE6szrR(K!d!f~*a&iVAWAEn3nN=Q2aRi#6zZ-(6X5
zH=kuGtzFJbO)eN*L2x-4dn>+mS9UO)!M|rfDsu2~5IEsuM7fyoM++7&mPY1ty?z-o
zh6Hh@H>qx>>NYgqU`g5{4-#NW7vF*8#G}px7z$tq+)1>yOIWW#lGuviAd8TZ)W)*x
z<njTzpdV%Xl)QD1r&TFfQ~IsNU4y{f^<)hktPHi*`o{aebkGIV$DTF?(;@Xf<p9~s
z;5A4vVT8lxYCrB-VL;7q*be-z+|`YAOXmaCva7Tu)+u-Xb>J2t9eLTsTc>zkp)unC
z@T}9ZYM*D}Ck2(uXeji=moqgFTsM?ln&&Gs@iP69C6pYwRy`89wxn$DKf`>=OQYhC
zVKd>9(l~Jv<1l}0;*uD1;rZ~!>|=zWD2BOg591Az2s3a}8>#tGIGdIPYNI>a0LYU2
zndL~~@W@YMS$fH8a;qG5r!f+cag->WqTY!N;W!{ZiJh5&hB@PvUfa5(%yxL@;wH5j
z0>{DckHZ~Z9Dj{}AU|%D#UjlI%@0*d<kCg)(f3$J6~dTUBZqnuDoA?5wXZPhaY!5n
zXb12{Bu{EWJmrHP@NNwl!cVaK0*o(UICb2`*6<t_QEQfYf8GI9$$;nmScp8hcT!Q{
zl7JQ@Ka3ZUUNV>q1ArLc-#OPKJ@4#2u58~{f!lC^D3?u*z;gNx_q<t>FVu_CTW+OS
zuFSu`7ZAFiV~qcJ-pI8J>8jZzO7f>|>j>2<-+f(jEWHbu<63p|aukxVpS^|SG`1at
z07UJm7&-sxR$jX;y#R<PQc_20)TC76zIVZ);|Ipl{H7zSKsf|FF|ZjSQAu5k&`;u@
zrx@0BkIf#Y0oXqEETqt2zjQ#D_EP8Hv#dd*Q_uMa;g+Vy;5I?`T{b~P$tS|iGdeVW
zqiRnK*Ci4-Z=3z$DC+3&P8}IW6W&UtjxkkqvZc`2bWe0+PE>I?sFUt`FEi}kWn$^8
zd@Fidu*o3=tyTacgAcGGu&j!y^PIue;@6ZGbQ6Zo^*585&GURX=rOy@)x21$@=vWL
zRzX(~&B+>c29NX{f7;~Z*)Tj-LgjV>J&G^6F!sh>&X^<1DZ|PLVLqE+!KVVL?{*{H
zF^^d1)t=zVxwAPZERX+4i{EzsHh?q?Hl?-BG4Ob8N#|x`9Tn{f&~mR=cZ%cXB#di7
zJFT8ZOFp+U22@#jno!WosU4UGtN&%iELkFtiAy<1>><NAdERlGjo{c>it~n%jq2Ag
zvNBGsI>elAuMK41{}W$1$K8INgiE%3F_U<c?B$MQC%Xf~^2&-gOY$u}?(8MS{w6#0
z>Nd6?a0J&cdt*ZPxULn5J^i~utblW4HZJFc(aACjAu3vk&&w*MZBe}uM<Z06PA;H2
z2Dt}ppMwNXXi@R0>gG{j_9Jl}zpBMw#R*!uF*3huq29aB_mTxG_#_0j5%f9(58QHx
z2=^wzD9#N9W%?zR@vo$_W1<sO_K2Ll$q+<5$@AmEYDy8w7#i|}GQ5}gTI*uOnEuWr
zODIg}Ey@4cu1Z-_#46{63wOsSIt>cte&dP>ABt2o%H3n?S=qkyO5uK)XftNj!Iw6$
zJxNmp!SR51-U40{a;fuO+zR(*#VfKNv(+0Vc*(4g>@*@HQi~1szjq5TmbA=9DW$@L
zM|!rV=U7^22^)ACquI(2W`VYWfV3kUSC-}ofng2&5M-Lht@hgISPehV6XoBF^ht}X
zNt+ROq6!ND0yK7soXDSI>-0GPnchkyW5G}9>S<Ev;tLp_;Blb$^_zReKQnv4lQW2l
zRQ~hEDFAx%Fo&J_y~{vgvrPx-^=m`2B6^A$Y!0qAsct$Y-ekIoxZwW4?GnCp`~ia9
z;q^)H#@og|%juQ?M74l1^^VEG>?qB$({z96^zbz&Ld5jY5-{tS*{%*HjBR4Jxe}E`
z1{L&@d7b2X{(zXre$ex+Vq<)SRlha#1XYG(tyxq+q6PFsEqLV5v7ISrabwe(30&C@
zu50kXMydXAm&0z}I>?aKQD8-%g}%eu1L08^+bTN*F2GH9ICx+h(ozx=xak99pvkUC
z%UuBZd)U=>X41cghV7DNScry;&-zWwFX^ie94_PTmNN{?@g{ylc^4lBno#f%kl1Yh
zKt7_GlDR7~<6AqZY;Y9tu=#$)Oaz45D?X^1PDptZOi;$B^pa^WYPhQ5MOH^$BbU3g
zp(GrZ%*imb7(aYzKJVOL!Kh2PWrCqIEq(we`O2S!99JBqG$6w=nEFDCwsv1pyYNSt
zl&>CD-)COF`Cj)c5YpwgVn!A1rS_2JLQjM_Kc-`~D<2KC>+fm5E6*@;C=+lS8csZF
zX{1Z~7EID)O;k}ip+ykrSYVf)iZdJetS25IBYfRX@Eek37;42R3c7(Am)XM!T*f$P
z^SoYB^e5C_Y;ybxUs2m%z!S0b2E}k%6%ME=As%tKfp7zC*3Cnf8%&`}3xvKq7s?Ih
zVkH)YzSGVVPsM4+h2#98;3vB+XDhO^;ZgWc=kW?5T2wl`4r5qIw3)jE8&W11WR0n{
zrecrt#U5^J<xies7l@o0zq!1QjKk~>mJ&L$%S$3f%U^M2yL!Zo$Rap_aONoZRJNjm
zO_jpZ)^hllgbM{xuh;jh5JbL8YnDz|5dp>mSOuG`RT$uC3hZAQMPlN<6akh7g+<Gd
z{s?>EN3;!Z{B2Y==Gd@(+cdOVZpko4#}gPd_j=NN&`j<=Hrn+qs?JseLc1Z<)Yrhx
zi|Ilh9`A%nw+#fDX}L!dYW$dyG@E0~f%kd_A2C1$mh%$G`RIhQ5tIk9dr>L%Hh11c
zJw(yH;TYOQG`XWqQzXeA(XzJgNS&uOXmizny0uNKVhkncPc?W~gQWWK8)qu*Y>N>i
z*qZIFBHs*)t2nuuOW(>&<k;xR!e2`3+<aUXy--}$%%G;i8`f)%{_IiVgBlbO=-9m~
zJO%8+f1JdfUqZ2uAXd$6F2iObk$|*pbb?;60=)e^G3yn4!bD^xE<;}Q)En1Hd|%EG
z*LCcM#)~wW07o7a%{;JsW2il+v4rWxrG7CRO+tC8Y%EdLTjd)qv{&YR(Rr+MYhZX_
z(x?5{;4l|N&R#PkI?gWQ)ULFMP%kWM&c|J$F{76!r+=swfUg~8SkA+PEaDcLgs!<w
zO8F+3^w3p6HI-K^=ZHk@nHrW@!vHq&eQ@Uk$b;w`5X^Zq1B9X~2i|~-Ujqpt-nld9
zyMCCT*ozH(qzfRa#6GMty7Ovgc!`iQW{1;l4*&?K!B3iZ1nhYgOyKZg&P^^u>8f>(
zwZ?4qNu@%8{A+7uWCdU_;zCoPxoH}+fN48rZ#kD*5gJqeoHFbxjC;JbUiAcj9JT?X
zJS{QvZJA9!#=n4sU;3nThl*4?RjvbP9R?D+W*ZXqPlh5;oARrd8o1-*k$W!x0b4A4
zsP!35u8S@$7AGo`jP^peI5|mtwb}N|l>vaI8;z7sJnGB?F?m(Csm!LC?2SqeYOwWP
zlUKqxB$6!p_wTi^sRQkrCO%Pz#?seDTTX@vtAv<gX@vNo;b?uSc=XPb0Bp~_dp|!Q
z+BD~X5LEXoLPMEn+mGW`hkI^K`z9j1_I+s8gUyP6%-p(BX6@eHBtk%k{1gv0xKKKO
zx_bh0`$=)O@Hf#$jow*6Hx~DfHB;xAl4Q}NX>p+r3hfw^>6<{KJ|t&=Nw<XsDM^U%
zZ^5=qz6=w{n8P00*8#maPn@!g0<vrIkm+k4z)4_MzZ4y+jv$i-gWa3J5{_XF<s`#R
z8?#0iWS)*kPcrUmE{LTT)9Gi9hW^pu+O7*11jpvhf1f}n8qM?nut1m9Fl%^>WDb<(
z{1AqIp~vC_Z0`4QIDdm~KljFs3MCHcEKq{>du0|yPtN`Q><p9m)WaApmNWvO5xT%w
z>jjirJuP(9XrM(zZI$np!2TZqVL+b0$x3tNs_5ELI<vgI=g-+vs{^O__@m_Vb`npc
zpm*0B=7Y-?%s!&>4Juzce-cprX_rY$rAw<1T56!!yBr0qG_w1h9@Ft+cx6Ru_v$)B
z5Tc2`GNiyH*0+p-6aHIjCZJLbG~gR2s-fqYuF}6Jwkk8^#9)vfJys~Cb0(OXoMVUO
z^57Kd)rjjdHWiEcam=~vvaBSQGu*kzjXC(+AR=Bg85FVTb+WKgqpl%3sG)4>f<#im
z72GcAjMQ<MehfKv%$~tvl*x?l22<$_N5i|i3Zr1ZpwaClR_{ozOIm3dBGQbO&3A}V
z1DF?|2A5yPZz(eEjPhtu{AOPx161K9I(wpc5GSpc^eRsa$9L$AdWS|s8^H-}Cld7`
zXc%fpyaAm$BLxE`9Ybl?RYb|^$iI%k9vj^aK$i3vSO%W`V-7v#=l`3F32?Kj#7)M=
z4uQSid?fiE9g(YBRg^wIyz%fyImFs(Ej5U448T#K2V;Jg702KrWf{^{g-8vQZ{qeL
zCx(;_d^5VKy2%|K%qN%AkW*foRJlk!qXF00HgI(}f&Ct*G3naEnff@wTH_Yf^_SCt
zydIonw77*+|6@dUxbMffh1J{}*>Ei<8E9CJ)uPNYV=+2|%l+0QXeCR?AKqx+Q<z3H
zC0Eq<F))gf6`T%RO2PfuyO>Oe-s`N0=Od5JbR#PSa~HUSJ}<65EVD2f#&F5<_-r;T
z(pm28u%$b%!NlQ%u_MC_`zyPl8aR<|Bamp^hsmX!qd^psIgxeWmZpL=N2)H9Y2bg%
zmo^Aa4~E0}nsEzIka!Y&L2{{g(6Nv|ZtLhRn;wB*&&a%3@U@KHT}N)Yc-;!thq>MR
zF3(ShNi_Vj0ja85Su{x&;m}2@Xpas?D2iC!YJ`)Fj@F7l)e*ok1$PkP>WlMF0;4eb
zt79QYvuxl8I|HMhO!18NIgwQ;(PVQQd^+bC@tpCSiX{neD)L05lWkzeVU%-P8Ey5E
zOv5+M1C&FW>P2XvTs55qlu8p;2N6bVkO&8&pLC{X?m@{0#s^GNFi|2b8yg{&BwOn0
zVDphkA!CFus8br>J2_|RIi|gs^U>rS)g-A-S*rlM1rv(T2-Uz{Rq>`*2~fdtC>!4N
zNV?~OvfDM*c&o9@G<bw4o$S%EdqF3I+&++m6Y8_>8OKwXMZN9RWFJa{atHrX87DE2
zAL9t9unX9tzf=%1fV>J@d91AvZeHU!E4^VHG#asPkA|LWI8|$sqb=3=xc&|@luG%y
zpE%<d|0*0@5St`x$yAkooYe@y8IuznLy(60rg?aHytg}yFM4$srhFOvN5oDRHWe+A
zQ>b<o@1wyqytL5{WDtw5O%#kh3igqoTykJ6=Xnp(X2yxxrm#uL9S2(?qccRB)FNA8
z&|aEghV&E%0TfR}=C^b_a*%*QZ%`U5HQ=xz900fzm<S?^Mwm9j2BK9U-V71KQ8Wy3
zbHUiZ97Zn6NSBcf&eX|3gvN&b=|u~B5rbc_;7kB6ya1(tqSHMl=OzM4Iu0jro@Zp1
zjm2=i5HYeagN(Ipb}sf1q?CG|dmdRy%L`5ujLnEV1f5<7_+mIuuc8!Hb+{LSj+;g!
z^!Ou_Uu&V_%nWI^3p}8x1__c0+Y#yR<c%%ZNN7eh4@(oIe(re7Q{&VuFD)lfRI{9O
z;xRaf0xn{RPF@uF7$yyXUTN8Usmtms_y*lDaZCV;okx!Y6mBsJkmKrGG7&TsUxzM{
z99$$xI#YLX+Wu6Pj2)2gy7JC5-XK64CzEJu4zfeLU(Um62z0hud?KTT+a^Vh0LO4e
z!daniI2R&3oAv=qpc6gfCtQA<4(Es#EQ=X?8X7%BsZJ+MJkbDH9+|b6E_hsh09Y8~
zv?PNFFFULcCgNIveB2fCC4=|4kzIo}3EbivwP`X-xQB37A!R(lSmks*QE|!zn_{jV
zaf<~|>MiD8TjmC=vX{HP<$S>b9HCVv?Mu;DpK}xVj**w(jFPe8mbs2GSM)#v!iR%s
zc4z#Fu46W+k-ID!1CN=EIqw-_*PcT(xctf5IB7WJY$Rh9q^`+{m*k6~n&#0Sk<?yt
z3NW^gBZ44bP0}$qc+A_E91#a_CF8x|bpIv4sA92E!pW#KFDN%js3fxiR$Gb!Y5G@R
zsTwa#23=8f?BW2s2c4ge_PWi(x6PkAt1laIDBO;8VRI9%v9y0p6JDaP0v}lsrVxI0
zFp40cbdIDpwlbd(!7xeEG^Ul~b)<>0ZMWMqc8T(<sJFHfd@}Ow)hB)E%NcZufgBnE
zeZ^9B2hk-{c6MW9^fBE71I@96%rRY2eRVE2yCs)JRPVOBiyc$v_%nq4i>*%Y-Eqpz
zD2qUKNNP+Rb{5ttc25}E@J8so-9xl7j0N!$BDqPX@5x0FiJ-$dEMRXMPdJ*w<usX3
zf)QTm=vHcAgXjgD(<DZ%ADV}q*G*z4R$9ZW56+&3AB83k3n)3qHqST=Fy2Fp&w%s<
zl(a`e3kcWNo07LwIILSZ@oKGIeOSwI=x{v(d?c?V3{PkRm$`<KBgMYblsyUm>QiOw
z*zslEP6`eANL-Kfmik-5RvU%4LTK^Hs`=)$jOZ?a&L!I}vzQwy^P`*B?kiKzNGAB&
zl9Z=1ApD{O!tVlCCH|puk~%}cZDaP6Qh{pky9yXRZN)tZ;Ca7~SMC)$i==vH*9^$k
za3>H%(Z%0c<27}k)jY;oD`l!c{-a1CLw6|ljd-p=;71(51|v}&pSI+Z!bUpBr)PC#
zr2&=TM&pKQ3y<PUJ!{p|7FU*|T&ufmR?0Kel}DjIitI3}w_*=IXG9_4>f;*GtAv+L
ztfW_@jZCPL)laLjf5y~@FnjVuw1GuJcy>2J_jL?f6HLftT5%)M2Xc&sfZ~bE#f0Gk
zuxdt$5RV<lO&hJx<Kzgt8wsTFdt&d3H#c;bsHoBnLSmE+Mi?6Pt`ae}ei7UwD9@Uk
zQ;ZTQ0`Y>zy77#U%A;u3do=BBFmtMujoUZTH$dBn;0Hi_i85^^wWkq~`?C#l=jO_q
zeBDYkhUg_@lf>gxnF`}vpz4_=M6`oz6}!rnG>y%T=PaZ)FJVP;huqn084Kq{p2Frb
zS2&oo+<ZzGc?!!`+2fkk8YzAFd}ut#ka%Cz*oNeaJiKEMVpaFB1*Swhm7|w;zjxwU
z<U(~w@2A){vbY?#Bdzv^F>cxQUe@o{H%!*k#{tf0gq#8kb`Q0=kLdsbJ0C{lYR_>;
za=cmV=w?eV?(bR_#D1`ccSW%sJPhJGi^WTP&U6yZ=`_5f8PvCH`PYZZ_!9qv*9EQL
ztAcufI`-YZQ!H;(K<o-wXKV`ox_YYV-d$m*F@2~TOe5rW&HyJ|$lk7N8hWEEMwx?A
zD|5&XGVdphD2|mF&TblAq6lm1Ya$nILp)X~$5(Ln;=Q6Od{MH3OMFdg+L*Pu{~zWN
zz)>pF*{6g-S+w;Z7wqJh^WpnFjtB@PvJo4W>~|dGea{Hj$sd!FYHWIL4^FA+$447E
zUSaa;w0ZKnyLWup3BK7RCrp2{zKX^jxKQ6mm=AAJsDfgY>BJY1;wkF;k*iyWZ?JlN
zRZ$<<MMqw%S0|1Lh_lI6fybvwwk3fEC^CfO^ztWRTDLshSrZ_hp8J~~g9$!0p#(n#
zDWi`cM-RfeQKH)LHYcA42sU0wR>z|7BMg_kPknr!U;)Jyf%c+!Nvk!!q^<98q_rR)
zV4!fI9*|N_eH>myOfA@uHsW6vJi>P8NW(q~u7JSBzy0towS!v+Ixex!Tp~t|eEVft
z>8y8p!J_)sAzJUd;OVAs{+*6RnVpRQS$WV;D|M;p9Di#TWZK+$x_OUQN2b+BPdAr0
zyuST-^|r5U+cYS@^_83H+h(dd2KTne;t3mt4Gu#Ip;5=iJ)<)Rqga~)dT8AtDi1Kf
zF-eLZ4Cev*Hlf~^zXOw|{!C7Z8mag*zDrqWA&Op;dx&vu%H4{voic1@F*sv1)3HBE
zv=-zURvOk;u(XV8P-qG%@J}PO4UnP;_xxDukL#V2=IQr`?W0!rplt$n4W>~6vWGVO
z07lfbQg)d%1{wClBu&#|uiMDM|MX1TBJRSc;L@`AT^nvgOdQ&F#6Q@f2VFiznBm?K
zGrXo=L;J^jFd}Uz%|}ciU%oW<45N%z)@_LZ{LCtw(0h5W-IgUvd?)6lFq)Cq-f64T
zq8XaNW}GiQ69CDXrbaWvcu4e46|fvsyMW%!leUW}2QOx;HM8wCUWC)j>z}uNZM>Mw
zruE7d5Zk~BRwz>rza=^SPR+L*%<PKbI~w&17qzb*I!Q;d&7;T|0v1O}#7_aC=^6AC
z-M!0rR~ylg5u4M{QsB{cSs8S+>52enh%-Bm0+(d`IE14^6&XI_ARd>6aa;`Yeq=#@
znE<OdPH=+))A&5UyhVJ((x`BX{1%bLjPbqo&=vn7nqB~!8o_!Ay6mS0&BBd0yPdfr
z8hDEsQeNlmffp_+<EGrIZkMd8u)fZ6uEeI^b5I;lZskESrp)d!Bkn8;5K}8)=p3kv
zXjH(?zslh*@9#H9!k+#VUzAUgP;QozF9VG`DTnLJ$7iG?uneUTH&)MwVAPKxF}9h+
zkWppm3jIhk56#(d!$k^=-sMhh$&9$MPey1c>sh?X+#tPJ`sZH*Oh8cK9apJ;QNdED
z8l*6DLF<)jE^6K==)hj_&||hCy`Z%LMkh*rC{87!ff~zPQ<>%#k}~<m_=soQ$dfT{
zOL)&qG*GO_yY**ndt+ncSKA&E4aT5chzGPqSJO>zL=iWLH37vA!ufEfga`I%qN<t!
zXtf$t!|iRiMjp++h82ZfL^8iJHv%o&F~Yvi9ng@st?4wGTEym%p>RCRee&!JImd_|
z(QO86S*7(nMHPVBvxVwbqp?@5YYGo%-8F0F&<}>&)N#_d4yX`J&GIEjNlDC2?sDxx
zx`u|vxYgHdLH_;(qWWK*0PX+rPd@)QlRlp@{omsJe_wBJ?L2v$&HuOaWc#oDfB%fn
zqXkL6pZ=A@?ynqnf90_ID~H`*Iqd$*VfSe{?CdijRFhdUj(h&&9-Bb<4>hW&_wXW4
z{0An!y8Do=I<LcQ@3XCMzuoz|@$@le*0U+XC=fAb8MjHp;!EJHGSBYPM>k<S^Pd9U
zJx=^b$R$iO#d@fd&$Kt|10|fPI-P`%;&C*~ca5Pi{HKH7cvdjRg4w`RbW^~aEdOR6
zCj}43{<C2Wmus5of0$&4Wb(DI+V?C)G@t1U4W0@Lr%CU95oFxvmt}%OK8sqg39pXP
zq3VkKAt)SFGOif=KHSo(D5fIE{G#JN<BWE%hRH=Z3}DweR+A=HHkq`ADYN|{<+eEU
zFI|fEW-@1`;$$S=H~cohKoV$Hp3+?_DWKT-f?eArH5A{AFor2Qj<A~^C2vAeH-*e*
zuP@Y0PN0Ca#Fk25NN1<rzf+p7)9y)<w#Nhfb`)Lew{T4J-d*+)z@RL8SxK?cav_P4
zm>Jf@q;%Mtk#Wm&j-yRaF1Ze;ev@{N$$yr0G{oEJ)!kxS84?R~#DGbHkk)KvW>F~L
zSE>{u?$l?>_BIie9QYUQE~Bxr(9tewV@p*{D@D~$5;6}}L)1Md>6B`cGHq!yAy6ZC
zI)o#mS_U*ibQzG!@r?67s6{yYw>6H)-WkZI7rVicG?rpAyi{5fAuA=wOL3#}>^1<t
z5ztzwY2-8-1W4?ZN}BmOO$7(q#zj0Eg=kB;#||rG)X7AiHE&<zajY@0wL#3ihNh`q
zv@?7bG{<5+3u|nkC8md%&eA}DDZJ1HTvkqK9C5~aF0HA*S$TAJj%5AmY{A7<&{j0Y
zSQ`Xfq8snjH(7^6E`DfYtAN7D_BgX{Jnl!g&m>2LR$$CQ#@bLu>Y(|JTjelZRs##e
zjXI$f>A)9-m1@n%%$PvMq4v>r$!#?cw*yK&C#pbT3*Mj{juVeS^XRd9lSr0EGy7a4
z0*yMLxVrw`*ihKOojpy&OyXJa#`#4jliU(*GyuYDCW3qBppb8~?#DB#X)Q76rHQqY
zsTud5+41VBxWHr8$8!lgf}&3Z&Amgi`eyd$G64){I0M{CxTovhln708-_E}3<&Flq
z(vhzs9eEBzjozW`qJsw1+EeD#PSF&YtiU7nV&u@oX@m|9WSvgOI<4C)iqn#^IV-t|
zP`nRr@#0S0x;S@<bazIXE^Fo>+IjQABFCsGWan!^se~V-967oul;4uqi{i{GvUbGV
z-|0T(Db%zR6oEJJ=svUSlWJBnjz>cKns&JGc5M1@aVq&_<+r%CleT^{_=|(%V(Zq^
z4V!1slIK%?tDga{1mt_`P`H`{;6K9t2(D<nf-$z8>4h(F7}l5_26AoTCPz#1knx_n
zZ<|q8$*ZDHhoesHdpPaaQ8->JJc8&FhbwZ)G>HMJGa^38FjK&-g8>F<bmRc$BhCey
zOx4VQ0%+60z|E^m2e`Ju_R_F+Z^Aov%E2HEo{w;XJ#)^*jbNW(&v}I7LEtdz7CHl|
zZ*EBhv+l2EA<XL>F}>6Lp@pOGygonM2ewsPn9MI4>HLD*IGJBO>dY^)VArzaq`_WO
z&W7ZWCOBx0R4#5+W)DM=WF#Xzr5~nM(}V;@LHCI%Pa*Er72DU14_6Kx);VD2czQV`
zg8#ytFmf!(wMN<k>rKHP-asdM*Fopx_=NWGDX_W6Z@zE+gxf6F7Tyq3Z?*;^GXP>T
zoiRu{s9e=)z={KYg!ZN(`QJ-2PCAGT*1GE(k>4F$KTdr}ZUk@n(kExW@RIX=Lc>*F
zx*M{{%e19r6(#!=lA*#gs+d-=KKsq<<dXLd^y&lr1M_QgN^IAQgZxpYgt2MC0BBAF
z0O=v)%(4c;ARXdjT@mpHrCEh_G1nY@c~l@9lw9H9ATu<u7W#~!_dB43aboS9D85xR
znOU)$`Dk!)BUq%42`y9PD(AFFJQ<kGe!>T34*WVC&mMIM1m7gQ3}?QZ4K(=X_^5q$
zeCnP%77^U9CCvvb;sqrbSOn1ka+TKUM4|+QOq9nxpa7bk?@^MHr8#8(Ejo$prlY_^
zU`c=MV=u8fU`Vu9BQ)g5gBaFz4aUNm@zxAM31pk0SPsI}oSbLDadoSP*zLFq6RjTA
zY8D1~S|lC<xh~~8WA7J~yjqG24O=nBOPI<P$QigzFkBe=WsHe|bFIx&N%mBB#p1OO
zlnLBO$Yboc4mrRAMjFdC7V&*lWenartJyovnLb;*5m_1DHPFifwFPj56u)AZDn8fO
zL|0DX!b4Px8(3fji&sGW>-nL`L_sf}_U0oEBE}x!H!g9*1R8o;alMVAHe0u%N>!=F
z$@$B}cIS0n!Wo%~q<Bfe9R+t^iq~dZ$4M2n_ybB%xi-#OqXhY5t2^P6Odqhd3mQai
zI<!M)TN@+d$j04nnw^GWAjAWow{=mA7eFfn6%K?-_ejNCvx-Ys8xAe(GomrXDtW0I
zp3Y6-ffs-djtO0BQ`kdFKEQ4+k%X`$B?qv;{Nn1e>J*G4b9Mb+B?arj|3xssAMyD9
zzd*6$zvLIn-%<Ype*i~c;Ts~x;R`X!6H*-gUkaE92NwR%MWS#7Ux=uIzqrToIY0sa
z@E*Vx#I+Z`_EEqyP39@LXQ?uH=a7-u2;HAt>oPK2g*l{3umc)7yNVn-k?%UhixJ}j
znz;{2thmh;d8_3s@$+1*9j-;EIbVq$=juG>Is~PHO8gwRmIY6~ktf`UP=5u@$dSuc
ze99Gv7<>gqBgG@9I9<8AUvpjbjZH2%lXFG4RK*lke2{uE&*UsIQHU}nSX!p<JoZP^
zwT~t5B!+!SOm5J?QF?K_4oxMBd;qgI&k!fqgVWYg6WN+K$3Ix+M%p<0=>$~=Kc2Kt
zTkG}U#C$tDgPJGwFZ23Vrb;qBMab?CVll-e3LF2e0v9D*GL<_2m16bAwiu#Rc!doy
zu9-YGDNB5P)Bf*c{R?UGGJ<08k2Yr7ayB}yq@2@ClUww^e3Q{FH5%RK$0+CE{%vCP
z;5z@!4fazSedHW+v<c$WOSEIj{wWO@%`g`j^Zh(AB$2ThQpyM~Y%<g~PVB~d=(h?Q
zBi2(3=Ejacbjudr2P)9u_?Fro8%UQod|#NSypE~6j*mabuqV>;<nuSpv2iMO{`)7u
zWHuc}V*m>M{fvi(cDJ*&vj@i9u(`$>1+8%u_)4AsE<S|!YB;)u%Nre`=x@H^ECBA+
zIBW+X0%*s<-xc-+lME~34{G|-YkH?_*sC`TB}tH3sq42gXn)$kwbkx4v0Y4)<&a;!
z3jjCi!wB&7?Xw=qOVj*iS@U-6_c@9{hs>s*yHym&RqFU}$tCj#kViklw(;N3-}Z<u
z@{x0smv4=dR*R10bTUt`Ds}p^!rjH~BZ0rln1|f>@K0%+hI}hSzx{K@ek+6j6Pl05
zXg>k%^B3*lN%@If9WcoR!IDfC-wUfl0^1vYw)QS~fEV5fGjKH|E;nmgzx<}&F6luw
zpZ&fZ>8;*tQK!REat%n3|7vGX|E$g!hQmJ%hC?EQhN}=k_t^7&Bn$cPf;)Qk7K!X0
zI&}Af8*SxA<u)5Gy>(V@5%BQ{8pJ;(1HI2_OzAYH`E~!4p-m$k8T|W42j-l)+>u+r
z3>7wCv>*9&d57!1$g-f>G(_)r{C8y(PkU|!@`WIqI*`q_e81*+{;50v$E&tiH1Rlv
zSzSaxu$Zq)$>x>E>NGyewqCSf@7FwPexYUjvz$X)u}#9K>4Hm6lzR8v15n98!v0u9
z!bv|XcR?aCTtxi4s9{k*7Pnl;u5o}rbc)dS>BmYkj#c}ZkK+XSZTkCphfhuF@a>P!
zI(*a`L+kkG^9~+c)UliIpLOWG71Qk2x$o$Unueo^Yl?pso%(xj^$&!rKe)KM{JNKO
zs%nXq+DESN;tsmtFUx6)Pw9lNg%8WGh5I&2)XK$O+M_*_eNuM2e`+`I=e^epKKR_7
z43S#&e}A4XT+HyH05dF-i{v}v7TS1-_Ti*<uqh5}kd|&Vi&#GtAl5&-e+RjI$Rn3O
zyLUnPAAFQwM8z)ePJ7z4|I5NzLHwuo#P`4l?;iLw`VrpbgU6dR3Pob~J9HE_Shj@y
zVR~3VYL|CZKz4q}qNxHL^*N>!UFY!O^`F(3hpcj#>a)&9G2-=~(oYWq7DM~=cLC%3
zDK`|1RGZhYpScHxiUXj}2^-=$KCH%b+^c2Xq29hM=aKH!_DCBa`MdrzHLp~FbN7F)
zmT3jwo3;Gh?K6e?VPy*SUX246If}7){<1_ze($EkTWLC6rhdOq(-&sg7uj)_3Klcn
z+*eF%W^<99&Y#rd2bUlJa8G{xKES-9a#yZFz%niZ&81dt8jS+3Jgb1u);g(~t{gQ}
z>496h$<dz(3|5O>d3v!wK4N7AukObP-m`sjEj69cug~5SnH^lYb_a#r=F07nR^VzC
zt-$L0Sxhdje4C3uzKUp@0L|i`RfHQWw|gB9v0eQ0S=)s@91e$k`rylgwiPF>+_ai?
zT={k#e;md*60wi4-&aAWt8WjwsjpVOsaI`RkGOxrKc68HS^;4D{P**>@1c+a4D$JU
zg58*k5n)<zE&OrI25Nou$BgG1$ZZxhj5p=TyD2|Y<GkMhw^Zupt9G$fzCBCqr3#t-
zG#W-dGMB=?Idot>ZW!e1Ky%MdZo*0b0y?3;C9CV(dO7CBtMtH%D_3u|u=Q28495Sd
z)bZa{R<*R{9EFGxBhldky<a-5v${1KMZ12@phjLBt{X-mIjXq%^#G<ib@S}a&|s8(
zxJQ(31^vs&K;Ln^A;anY)}dom%KgCxqrWB4yT|mjMLZPx?bFtzplME)g_eW(_p>cE
zH-|`0zkRl*CpzTGXCCv!4tnz0N6l2tszl8vo>@`gxOeV?yZk=*rhkFK=iy$YzY8$t
zLdX<09nNQP_2a+!L1S7?c;Rr84*E2hll!#JB+GjRjPW)S=V^A}Jwf+5$-t-`h>5u-
z<Dw$!iy5YhHU?ol#5`G?Ow0y7vCXh2GJ7DR+nA)cy)c-E`~x*UrGrT(bgkjP1~gmF
zJ@TouhvV71O5kY1zq#G`Db1xJ899X4`JM3zz7H3d+#dhU&-{~`lw6l#GQfuIug@{y
z^lCoqCpUQX<lE9g7wzL!y23~p3?2QJKZ}mVL(ypwhok#p77P(pspG#(Imr89Me<(*
zDg*!ICXx{!70$(R8e3`K-$p&WlA_*%-mLfTXX#U79sur)J=>Q*bDo&T7Iq{2`#JXa
zB;TAR+&-Z_^q$0=rj@#W`_s+~CBsERS-#{u%8+CCJQvg~vH$w*bN7G*0l+?)7FduM
z8_<zuh9_+;=n&s7)c0c0Wn@tYN#Wg-+oDQU+>^;5e|zLJ=*zO*`l;JsHiH#{f0iMy
zC8SXypk~Ru2LufLS#IQiFVC9^jeGJZ4O}vdBDG6ja(#R%txLfk5;@*+&$(sGu*SU>
z)3o}hb&y~={5Q8Bi*|li&2g_2(2p+Wmnd(7Kl$DBnYKSCkVe)U|CV*LaBeH1s`&*L
zz97Rr`I_%cU6}vytmb2<L+3{xUwyVNCr*!(f5sdq-Xtggq*=}{Fc&-aM_+P>OM5D1
z#{3uwt91ztQjhSr9H8Yl&nms#gfm3d^rw*7`~!4Yna8K}DPR5>#Gk}(f#c3!7M%C{
z0&uFvM$>3z<Fn;-PvIpZJxJ7>(jN02`r&dG^}moap*-g(0p%~I-;8Te_Tnv^rL>{+
z)(-qH?;<Vp<iELna(}rBQV2*OAn5qpXKIv#q14US&(LgtKAONK2>-62KD!So!ohMY
zb^iMYq+;7e!c*RHut(@`LF?S6>BQL)RAZshAg6-EQ;dI?(+1L6AqKghIOi%F4inTm
z!k_##lb6YrW3GG3<S-r(1-Eg+EMnLX3Q%*E+)yU_Sc8VSaRNgQ<idTd8wo#4@NQ7l
z$H7UiqTYK6N;aL3$DDS7%1X@9!+E%&t>|AG7B+`pI<K2SIK;Hon15dQ77T(pz$_GQ
z1QZE+Nl}RUb!`j=n@l*SFNU-n%qXz}zf`$jbR7cSkN@WRZBI@i-TU{g6FkR49UEJ?
z-LL>Ku-t9uD*Wg5EW#Eb8u?4vRxjV+tI5WhjOD+JZvW*|TEJ+=sQJNv?<<#ENsI{~
zpHRF3$KmO|ff%+62^A<RhMxLu5wg5rqy+MP<i888tXFRoW8EViR}eG8@t?iV4J3ya
zc_jLBKcUC{@atuikWUQ%UBy@%N-hTrh9_?wpEmc~=N$>Ph$xAJQ#--zsCh@r0F6&!
zUP!Q*uVv&;>7Y!_g+e7$isELNUrykRrv>|BrP(`;U)-s&VD8bqfql<;X+Qq_^r<t?
zCx2+3Y%U{T79P~q+oV&<e?L=;eUdK8mxV^%tGAg(;k3td=dY&SuNSwwTEoKL_`gjT
z->kH07V6t4gESfrDEnyLelL-Gx&imHtrxS=141nHX9aPwSdHa7S%_rLqTbb5;+UqB
zC?q!P<Y4dk{OF7j4286gY>;e?)Wy$J4oHe0j5&`%5-;v%6jqX|yvE@iCYSJko4|nL
zUv31il?K$1uAw#GK%);#4P{en`L#LQI0iJuV5b}{w@!g$#~h#zMq-Gx!61yMb(4Tf
z=}An^6pb*w7*C%<3*uIDm9_)9Naf3-!;~R47Og~~e0VU5rsz5$Usll&+^-K<?(;E4
zGt~vwnEs9~o9ORcq;Aanjxqi&uN11z76>tJeXS0y?zdi^zshc#h!VKb?x6$-&>1ZI
zjN-S-#-Sj~lMu6NVa&j2oMso?T@n$q%9k=N)_tH=$PnJr@w;8^R`&$=987Z+BzP<C
zGPf)E%G{$-<A!s)nj6mQO_Q1M?TT^PRv&NJr?G|wZpFEA7C9VH-Gz(^mAITH^GUX+
zul+^+W4&k(^mmmbTnMJ({Ro_MjBujA_b>uobs56md))86_hszJr*3kL6G(v6Z>v}l
z-=lrHDxh`xyF|Emf2ho7iFRPVf9_6LL3`_IXcsxctiEZ;``~t|_rX2J%8_(#-AFpw
zjdK4r1VWX}Y<qJ|J@hu5j>`<C@_bufBDX*s2K_wyXLKY9<0^GOyZq<Z2M&|r%^X88
z(ck<`e7wAp5nm6s4E*z_4H>g!3@;N3@rhp+vM5=D@L?}qh=MsQJttOQprJ9VnziA+
zC;yKYgJ^7Asq43u>|d6_>Why{vz`U#vv>%5*yP7qocc_&mA$1)0*JQBG`>bkmD1o*
zmLroEj7ctz)E-l6Zy0enh&Y)X&`*~Vec$BBGFeq6XR4b%BasBGxTu`^jZ(yo6TD#4
zuIaxj(VAzYV0|{4)G3yK7k=AsAL>Zn2mN$b<7{|`$xSc>USO!Bf+2D)GT!pZG@vAG
z7xATyV9z7EiBk&t&nBI~p;T*>RVV?-M1yE*M`}u(hBsC0pL(owl077Kr@{Ity{t(P
zX?~35(z_Ifb%>?kgcFW49ULCN>Jp(`r>~r{2frO1pSAZ|{QYh7^axE<CFi@_Qx96H
zY&6#Yy~6Jf+J~)ReK3)dSmt6r`1$GMU-=0RWE$R328i9D%Fy~MI6Um0Hs98485n7I
zmUPouA7gp%%B(lw@gN>XKX1b5cZ0QGHrJl>-j{}UgU#E)fO6#ZhQMb_lzgGrfkTrX
zztaZczl$V=ja#$n=CSBt0-gGU_*)=fp2122?NIf{RIh{;odERn<zSL&5}(S{b#b^S
zKq<39bug({9;E1<aw*Mx45A_I9a|Iulfd-M1Kp#rA+Lekon1fo%A%o37uUc(p2U6F
zy6`Vd?=qUfmugMMhaY%^jU|JAcvt;uc1^gTmhTXF;gNlsKRjQ}M)leC#_YNams?!`
zg>OD2<4Au)A45#q+(ixab>wsdlf*TjO$XE(?4UYYhbII4S_3%sg9jJEgP(#2ub(}5
z^Xx%qqf&=1-GPn;tWe=0H0RcD;P1+V%^jd$@dVX)q;O7qkG3{9H=Sm1&1AHk?Jyd4
zvkQnH18Erc+K+3Jq>(Ea4&GT)Y!?^dOS7}#*TP2kxY5)7m%*c;d3+G4LrL!{9`=j+
zC~r)sGzw9ljZ_G1?zPU^v$Z#CH6A-<)d76<hKl&j7jNDEvj@H4K^oA%znJSvJ_Kjo
zaCI{nOgJ*A_kN~R`K!D4`4p1vBeY+0&d`_Mv8)Ay-Y`icE|gs}LV4Y2jOOnEU;bUq
zU_$9UpyL<t7(OyWNBM+@aBGwyg|ZFs<QpLgG1B=2lhkZ@`QU8Q#;cGr5g8kQOpvEp
z4f=AE0dBzSA*EDeX-QTO)MQicD5!wQT2nnio!&G|uk1b1wO2{WEio9)IA5A<mFuue
zR-U1Yy#X9Q;~ns(`D6F6b@Zz&1e67;VLGdZa5X|h0{d%o?w}rq(x*d*Af-}uXj@B$
zuq^#*XqMIkGmq9=isTZ#tm0eLjq=@TQayMp(F-Tx1=1ohUapk&<OUP%uyl#;SRft{
zmPi(8>P*gk99#jdG~|TzSn{o(%$7xi<}T+tPU2fm$AftnP0G9prah%}R)gR=j&2NX
zvJrH$)h`ptQ}I5QjFsZx5svS03NSXxB*<BIB1*XB&wUVul){3Vqso+G(IF}d=!gRt
z>ua9(3iJe)81z5sqBeWVPz2_@@`8Vbmv^n;at?m~J*fIUef3pfu8|0J#vh_u&7d5;
zcnOL03$F6c+5YkQSr^HbqvPP2hpW6#(M=y5cbg|Ct)u<lkGp%Pt>zj0eS3O*bof&}
z*nIl<v4e=P^WC7aRr7{49Bwlwk-ORyMLJCo7Yhy5sVw=#Q`wrfe3`(WiKf$nDwSuv
zNgJ}UgKDL|^>s<j@=?((Or*f)8doi-)VEhDiFiaB$6dHm<9PdQ6_kX3o|RrBa*Om0
z#yO=0qjPwE)c%okuL3^t(wo9*qV!<&&pahS;qlVrQbM75b>tl6Xs^H_zA*39E}j#u
zSTp2RZ5@dg_}G#UcLPh)@MGS7+}*PI4dEKF^BbkY@Qm`)v#sKr8j(-heiJQFPzQoE
z3*K8uPax$YK2nInqT6`J$dbsIX*8A;u3dbCJP;ruQiTi<_3^{H`q$FfhvAHJ%28@f
zHye=2_K0WJBsZrU_2N$N&`C%s9x>rETq=$pXn@0`RIyR&WTu99c=L=YQ(&NjOeNE&
ze^)0Lvrtq|Q>1fkbrh{lN1}RCgp7?LF5W{(5GDrb_Jr7!4DWl#KeSGpuUg%+R_BaX
zfQFz2pMUZ1Ncz!>Zte{wfB#s{$p^22fRJ3*=#Z6V!3#Nh<>Zy_3DH2nYlZGN01neT
zo&8SGzZ-{eiZm~8FpMvzA@IeVQI@heg_;}5EL@mslK84VqHJZ!uuqL@l3z+5jX^Ey
znARud8;>E}k9)Hp!ZGac@L(G8P7c;l^nkWt^?-jvFSRdtd+)dR&X5y6@3i)-T24;n
zhXFMKg=xc^4i2I3{fN(fGW}zH;5<&FA*PFkqYppUYo<dIJwSh*e)>Iy8o;fb>yB@6
zehPryvQ&BI&9;t*F7>VYaQpef;qmyk@W$__h@GqOw}xHl*thfVww>z(>H_yO+}4{h
z*z^$9C>r%flPZlFx5RcGdLx`}5e#W*5k*8}pb{|Ct<ukQ76&FpFRKlQN%DR^k*$dj
zNb*9dZ-=4HUzlqYvy@%LW7wf2ccSdo;WSQ}PM5T&xXUt20_}XhWm&im0yEfjICvj!
z4$RCRJ*ETnId-X8PQ2ZqBf7Gb)}i<b;Rm3W;iw=ErKF(fI7TNKaU_;E+$F|FIgJK;
zsN60%Spe40He}e4{`u9l1JHcd<HXOWfU<)11dj`^%zCoT-?zP8pFhy1?_{g-Vltc7
zlWqFTqn^XCpFZxIp(6&bW`^QR0%auJd9LqQ(HNUJ5XQBdaG%~e=4Z8n0l>%?4PZe(
z)%h3+RZKJu48l6%3frl9RMICNwAK67(x2A1Zj;uy_qlh9vq!4<eZA)G73bNuWxwF8
zJBJYWNHm5E9}gRx#^aa&(QO^=9q+e~P_}ypT$7ctZ7(isnJEW`vI()g?8E2AoMWF)
zG`7<@Yo4|Dx~DBR?Vz|RA<Y<hZtM_<-TeqDlRo1jprVAE=Wf@5Y)_B`2m#Hemf{0)
z@rJU~Vu&MyD{6%2nJkc`uG$PzC1W_{F`(#9Lbg0)stqF@g(SG4{ItE<K|Jo`D3a-W
zP9lj3rDt(Z8*=E7n`mgIdJ6Yx#8x?Ys};bY7SPJ(=ACRgcOt@cc{|&M?daVKI|AO{
z3z6Jw8Xl6q|LFbdI%wHmw41XhoR8YV18#7db4Z+H0f)IY_JCD$Wv!o#|FE(n&`p*c
zD5py!2HDyE)tA{rH;z0WexdNfW6XE9>%<1?K%TEMkt~wKhOqTARRc>rPJmeMRV(M?
z_v7SdEF^ZIlT>xbN1vhGqKx(PDKb{WJ39Il2nC0Q$1b{^0P(dE?Bj1_+we7+sa?%4
zNeL!4BPgOv#>7JrPjNBty$6b(4Y#N@ZYr%?6XYQ>i^Mo!L(|AGebcoRe*Oda2lx$y
zVRRkin=~1bHCU>#ozS*<k{K(Jh|}acPAT;=ObTX5B&Lj1lbs`f2gA6P$K-?Ij})6i
z2{N>OIS;2HaIDP6N}^Frq>VB{ngWdpxKC)j2!te29`Hld8V7?ADI<8>1DZ4qUN<|h
z&zdg}TP(aiZtiyvntPZ{-X&IB)K-(zb5~L7gRFisjow6~deBeiNG;=JPmv2WVnEpM
z=3(&NZh2<~C+$mw(;Ed7$qBIkURAm++mup$%inge)uSnJlUcr#sd?rm;R|bo836!f
ze;{5GLD-*<Mt3Zz1@3`hgK#;+HW=vx7CqtDRBK<~YNB2rOV!<b6UIm5GO7T%HAu%E
z6n-8N3k<`WtX3E)Z>Mk(byD|QX8t8|D`Xi0ze3+UzsHCQ>l9bPI=sQn-o{EFpIar&
z!i6A_(0r!y0X)SQ5sx6b!-VcJNsmxG&jVK~gn9T{$(p~8!pUFj?yX@)f>JLS(Pvxt
zPQ(ZbaW38l0QrsJdp*vs$VV4mbufsS{51uhvvBo<W61*fU$c51y;je*T(Ei`L!7H{
z-<8O(o-PE%dm(8WgQW^Uj-H{`?0q~Tm7yv&QQg+>$E@^Z&q#}wYu=K4_}{lCi(5Y;
zpxJ#Jq(F%Q%)TP=2rKFop8o<gyMNJmfite#D-)<)?~J(@sjx%-G3#I4XGK3{N$<C&
z_gmEapR~n@vIM!7FI|otTXpSJKRFM(Y}J?I<_fCls%O@)7BpT2`Wjy$uT+D(5E$YN
zw!8{ER8D44vZg9Y`J)%#=Uh`Ob6tA({d3lI!Es!E9ywTOnmJ=Fe)_-gsI4-Z`_Q6)
z!ch~0TE5XXoa2S3%R~oYt*`JD{^61`XITHQll2Fd@RLs#t2q(u4$DY14a*VI5gG>J
zJE19!_ZMsvk_>*}YdZBQ8m#fZ@KAm-u3S**bK^>qixAT<CSiW#_Gas+r_p41_rGwN
z{&~3bla~o*L)2|nQiCA{=HrM(w0X6^8Uz^4zO@C|2->r?)T(>cO%BbrrXl+wR9_yR
z9G}$K<u)PtVmJvfzWoGhQR5gdg_=gu8;8Y70}KK|ju@myj#E?gA|i2HmdAY0vn$+M
zMIr(L*S}<I6-f!4wpW)FEXDx7Ekr#xsL!{x_Bb{du>a7gv%%`P*cj(p-T-$Bs2q(^
zwl=mmb~YYAd%E-Wx3VuJz}FEvC-BJ7m@;#H+cN(fDX{+m*S9V;hHz6^!^JS{y~ooh
z2H3FZDXn<W-cMB$fi`Mih(CWgmim0O$Hof#GJ(;u=M8Ht(NTz0I_QaxSu6T1OYC!6
z2vQ(m%jMhTB@XVe3^n{k?)}O8<xSF`58=S4cd#O(1tP@}6$~&B2I*-WsiIKw*glCr
zxJ^M4{>pPJrMTg*wf<Arn&Tm|P(##Zw8-8HN#I2+^A`&LS1i-1L?%HP(o*$BFvUxz
z_VyUSL<Cw?s*7)H8+bOqcV(2F*Uc>}sN^7g1uB6cq?{ZY4n|beq($`%UH#pHgJ5ac
z!VUA+x&G5O3~H*cW=E*gK8;X8U8P;JPP;)?!5Y+KfjX_Xn)<;5wTKxevy^HZv-+s7
z@3djxB!x8M!3(w~e0|n!AGOcg&BJb|{r8q@PK6)Rh@&<BBdYYBs}ye^p|i<h&A1n|
z2dek);l{fpwLgs~#Zj7|MQ2EX^iUL$Z%wF~DM2NpZ9zC<8V|KmSQj(%+4PQ~h`W`f
zP$?Ok_b;qjKWg`Vh^w#7#m`vo*9`)cH4(#~i%LFUu~`v#uGX>^R)`+Yr|$eS*6U(m
zfmR?`2q`+WA>$Hg(?NJcAW9Ajk0=O}apkg2Zv-7O%7_Q9mlj%@^^xPy!sKH>Lm~SR
za#*-Y_!0TBQz{>HEg<rdt<z>~_=1JETvrV7A=^7SXGaadWf3`(lNVbuU^>=%940zp
zrclkKH^jB=%=J&?y`Hk^j$a<w;8dGJRl4z34>rZ4kt;hU&>mP%siE8sdn72_p~lv&
zJsm!6r>8oGlHKQ6hVU-I;%^-9mBM=Ut-Qt5)^kQbxZvV+nZRapz;C4h!z7t(Y#8&u
zk2;-}mDR604YS+tKNG3?r%cA$<A1cS9cHgka5Rdikf5zn7+e5%gAs<teRZS3?Z}2z
zG0I$`=_nop!Nt~3WIqYJYCLm!EI8omWMj{nn0n2~kcWIr$V<pL+0X$?(0c!lY%*Cm
zi)jEG$+*EzMpe6Esj*P8<rT_*#s~s52pc$dXOr+!C<kaNj`}r+Gt3<{W)<g?emG+c
z%+9CeV1!`C_1x%TnL;d`V$3+03{0NVw6WhX`7mLzYjji~sF9021-}p=NR(mgKg46$
zH~8`-0UGPhbJrrjH|V@ct&yYA2`^bSgK}HsGA)Q#_Ly-k(n9-j>X(B3;<}B(^-q0}
zjSgY}q{WSA94uDvs_H(%4|!kgy>1`wch7!0X?0KcUp~_vS%Dvw=cPrP#|O43{8&)*
z&~5c_VXJSB_s<Vowlx2CD)gg4I3Lbz2{D(f6k10DMHI=!F=YocSz6-&Cx-~OMxPvl
z(R~gsa`;N;$9mA=lR!lf7&6bCzjPAbjM=0h6j`P4r3Oit>;m6pUa$@gtt;^g8e7&Y
zgX7xZ+Ya2ak*V(0n=!TQfb{72sP#NwkfTyGw!BwpgxwWVz1vG}x*XDRSKWomit%aa
zFD{7mQ5VI!T?Kkc1qL3Lx<v8es;$lvbOtwtOHQa7ZleP#0kb_GBq#C296av*01$qM
zx@%oSH`UYDe!IiFvD^Bgb#&G}I6nQpOK|psFZds~Ug!K}wrY33-C9^*yi&bgjTXOz
zmDq1E4MuZxn@3aB;XK9dO{kfJ?^q;;+g*u<^v#?-?OR%>9Cyg}<ejyfK^N#OUhoFb
zP4OFsMb<6WoKx~3fCa|e?uv;aOllP2Z{(zg(JVsTO+*leE_p^qzA#rhy2!|2-y!)K
z5W=*i63q9+HYfPBU*uw|8x8gr@NVHKCDU-&T8<}tm<%u~!;B^feRhuz4s=>&ftdED
z$@rPx=uA-p0~3tO<2T{h$^EX6xhT^RA)q&xqjrIBfsh;FbP6{#5(QM)3A;3#0`br$
z=)(V_WS+i>fRFFdijU}P-Qn%@gdu4|7A;xk5AZG=H*r)}M?~`$U8u1{Lji{C+U0J3
z=0Cq~VEV%@544NTWE)8)c>FUX2^xh5X2ovEW1^s+E_rX$bNK~5&wv@-4E_d$%_Jqy
z??=D{KSLDr#gZ-s`adry68CR^4R+03%ovum4AmY!T%}a-U^hUQkWTka>+H0>*X=al
zoE)|~OY3G=g;(-k)z~j3w{!*W@S`ZCAY!40;c&LCU7*Wows_~dAv4}(mp7e{_+p^v
zNGVp|(SzV!@Le&Cf_D!eS}F}2c(}XDdcXVClW1VYM<uJE1b-x2(BL0)3RpHD44A`3
z2Z?^Vp}yN}FoD{XXe_o7NN~)Aphm;SfV0=A5U!q~pQjPUuuP>GU|eyiE#gzd;Z1m#
z8g_LPnTdD?HIV<dd<Kj6XaWY)idGlV9bdlxi8Fgi6RXN(*UgfN8wAZBCf^kq5=@;O
z6-ZXpYrN3+f@vg90!jg7kIL%I$MG#aX#`LUH>HLufLU1&x-&x)qMQIxXDku+J?_C>
z6Ny~19&FWu|IDn_i{NGZRkwNiN>two1)jsLhG8IqO2-h}8`{A3vIYc5BIfY?-+VZ|
z2u@Cq&yKrqUY;L*-_<5uSy|Pu@yLZ`7f1DQ3z*^;!8Y934q`Qcg*U>lSjGVbKopj=
z7*IG)PVizP`rObuT-pxSQL2L8_A?AM6x{^xiP-d_Ux_~%B~|ve01RqtbNli7<7^l&
zrx0(UQ&J<M{d@=ae8EP-&qrUpaEhe1NDRaGL3l}_B`}E51hv%mjWDtElmkuBi*a;o
z{3?5QJ!kc@fOl{bsan|-!Wcl|k>{vkDd(!;=#3Q#rRzbwB4Mw%TM3DE7tJ^+^<)BV
z_c8v)jG1cEreUmOiMt`_c_Zk|dsot=Hbz~K$;rux4p>fyy8~$v`0L85*b^({@QcH6
zdTD~YQwlWPAJvfj&%`yIgmZXY-n3txHqTm?vZ;{|Dhl-8N701Cm6&k}?vq9E&Imx7
zgAsle>>aj|=6=)coV7gvsMT>m5x}3hI~nl7iImA7>%;b&_E{Gr7@=?Cf1bBae|mX-
zu;JDRba0OB5RjRdGYY&(W^oidGaPIGUH=?!yC+3(Xkp0$T$(NCMd7O!w^BBfj9^~8
zH;X!fySBLPN864>BzK^*RZ0)`f?2r-e5uGS7hHxYXJf0xL340pz@EKC+#ZgQ+!3j<
z-~_=2g8dP}iFi@0CT>WMM%OvHJE9p39zG{r4at1Rx$tvU9Z1T-YHM|4iFZY!3yNKr
zAo*}yJ*ovM_5qEOXiKOpX~JIo98l&82zK)Np1y~1zBN)Y%T@4k>cB2&eh(DQo9=lB
zL*#T0kIy=+O!2~|5#;K0529kF?tx7%Ihht^W*Fl)K0PS9<Op&%3<b0ng$_1?7GW0r
z4rdnV%XE^^of{<MNb#G%U0`14^c5P2h-X8*W<R=R*$vBoFgVj$`%No&uyCddx3?(e
zbR?`Oi-O6+NKujx<QBW-7Ty=+aQY4-NZ|s}OmY2br;wbKbC+1FxCp&n;}KAlgf<D`
z{d+$e#4ziH%ks?^f*$0GIf0?PiAHS%_RouIQrOzfkI#$iAJe+6)<BjlJi~oKHsK_E
z;1`xO<Y2!<;sGO*Ar#|rmoHqx1AiZdg;Zkj5OD|GKG$8qM_r=ezxe+I-lr-hfW!O1
z%@8`$$HeLh5|O@PubR$*C*grJAeg*;Lo0laMXJ4;Lv9iZad*Ec&65j>9f-;3LYowY
zx4LtunQ6Z$Tt@}gueHUmVc^=56HUNOE8Dm%a%t<?_t3m)%nz8e`8>!W+hxpzXm4jk
z4xm|>kG>FCunG+GV`%CM=$QR*7HUA}1i^Tt_N)k690>=tpokO(x2iXR)=?FqD)w+q
zzTljMFkjYk`YKJTZB`jg+(ncnEGv1<ilkJODXh>$3{?wQd}$B_BPIXJfnVc@&ksdw
zBZN-w<L*%CW~ufgrCJgr&${|hD`L@TYs#tuC}r=KaA`0=D`Qnrp?erehS*bKYD9eV
zN+-oBzu;JV<@`hIzsnr{=Pqr?hr6&5dHGz=?GYMD5JH#BkYyI$D%l-b7qdl{&kg%Z
zt1_KywA&a)4TCUTLMxn}2#q7*;zjkIIrN^mo0o^=`(5t-XBaC#?)G36yCi<$S5)lR
zpkake3(7jEU|EmcEWiwY8wdd*MrqOH-ivT9X#ayU3M2#SOidG5NPciTvo@Toj4g2b
zTQX-9*}<RZg>;@PbP8`((4-WW$I3aD>2##MFop(uExpg22(WMjvaeC|pfMoU6(`sA
zpsgD;n!Wz;`~kmZk0A-PNbqHaT8nOF7H+w*&f!=TT^jFxh5I0`QJ2N<pD$=bt_Er(
zsnLK-3OskH^L6KXkNL&Ad+R34H034+ui#0^_?08-1+x>?ZYAk<S#7M~c!c4mg~Zbf
zfpo7Sl6M=yK{7RJ3o&Xj5sd8!-N@2$D#<2HZ^|`OSkn0nDWKkP-j{R>T8exwcp{{U
zG(H%5e~DOdoQxYEqG_Vd6-xN<29&5Q(EujJ^AojZ_Nrxd1>aVjgiS)CND8+xUU(NI
zScrQ_^qP<>eWAYnW%1KR;IQdB8;i&Y#hHNg$Gy7%T?T~{HWwKJfRx8@QYFs{jcJAf
zE-}&+RQkfE5H^fXo1{`S6}zg&LPH^AQ^wg08<_SC#+ugID}`*9BT2UOjDU!sPQ_yz
zbyqXAc!2R;&By&Iicb)$@Tx~D;Y&?d6di@N+s-uk;(!LX;K&1oX#4R3Q#<R1j9`jW
z7IswE&#H*(L<KPq>u*qU%}JB_wC4gAVVCDL_D+wF$TqHh);evTwU3WF!4t-H4qo)M
zYeWX$d7Df{faCc{YCW=(x1-m46eoeJfC0V7Jq-;Do2}|;`Nu4M^*2UMXgF@E0CCuk
z8Nx2a<dO&_rYvo}8za{$J2No`XyPU;DL-~+ivg$NbaqIBA2mFZcTR?mcxDjPZXv9M
z^wH?SS=F3^|0D}{7QGrTEVAYmnE-V_ioYO+aG%+9i?Y>>D9<k9khdKi&qaF!W57kx
zjLf4j(i95hwJ}&|X^cW%g}?@@Yyel;E`-kzS)hEksB0@)^1xViR$+1d;BUnmdZ&SB
ziy8p<o0UX`7zuxoY~f3-OOlMd{$jBR!q8t$*3&Sy7x}XgH-s{ndKEzh8v-%!5zfr^
zzKPa`CT%7s9E&bv^88UU$wtnfM&V4ecbYbg2ud?bI+9wl!iq5oD=Vf^%t7p}6wq=U
zv;#K?$z|w@c!#m95igBR60`}1si&hm@UIk3C~su%l88u+b~wDD4OcB;rOiFVQYvG8
zAVCndHMaXfX41(bDqYMtdFlvIcZ~XZjpt3q)s#4XBWP=43LPBYT`*G?Md3_QsV5=W
zur&-HXcI9_05s!SOt=oX2P>WT&Rwxkjz{whg?r3yi?EMW19<Q*hSA8(lklouE+p3?
z8I_TO0?;ce*s2K5y}^IzHjI?UH4~KsVtAjE;~yL;DIEY0H{w1<<ux48va|AVtG3eN
zC?Z*<`Cl#dTu77p#rXIVcC418YcvkA7^cziEbWw?wgfXaMBb0<D7A3n5F)FR%+$mY
zi`8+9MXn=7fOYC7l)9@-Fw$kQn3k?bxQZ8%`qkM5;g~|`*=sWT$`u(;;Z4ML-OSHL
zK|dL<k<~GsQVc<gB4$S_;wkVbrZ&yxER2U|$!i#O@hyiRoReIL2iSLc$(|HL_))m9
zD%N!hh+=(^pqB%QPz@p1NAep55I8IBA?`_>QlkDH36u|2viO@Ny@XvBB|Y(-vYCeB
z_Q8G=rfxGv)YZ=^IvuKsGlZNm>0a&C;X1F?2sy;#dGx%jT7j;8m1-rj*m~(*wQ{35
zq0)kyXphG-qOmI_I*dp0?3A1``Z%V|ToWG)`9aRXkp^qlVtUQx^Niy2AM<$16m&mf
zA)zbOgG-JHdPK(;fV5GSfcICJsx2wH?2v^xnTV>2w9X+h)e*qR0ZcnZ)G?d2v+w(b
zx$o!(rbgg`v?HdA4O2%Mnl?;DUo5e|@5ZnZNq4v3I%Fq^dFqi+YRg75>9U=>&EVt<
z2;%056I4}eS*<(Q=h5$>%DdX!J8S>Y>b8D7X`i;bdq3?R5@vqus^p3?XYmjyBNn<W
zR0~vi3atHT0JJy*>v9_Q$<Dycj)%l$ct|c8EIhnx8t!<is96jLIwW!^!(JFtiEJ#b
z5pgQ|H#q<MFA<x-)_K1X92?!Z(+ezd*mstW){Fx$8`ZXNUT?2WvYPi+veeSt*LX_~
z$jf1J0kjWUX`!YqO@zd!fUFY7-^jU<@Cz<uV)-p9g9#GZh?k1-fx<LZ_G*EXLPY&_
zfpG*kf>JzkjIcMShZs35bYKGNa;6TFg!M1%9bR4(!JRA04l*g=wrQ7KdUgXM+xK50
zIdR(EYaSl@rQiAY^FG~zq+ulS`~FMefJ921L+)O0FHAP23t%B?*`c^EGh_juW~c3}
zEt}g^PRxg&B9Al+&<Fm=o_keIF*QGQ&Z8M19jUAdkBeo@3CND@-c!-FL2Y%nkGkL8
zLU$;$2{QB1;hFkH9mvGQfzVtpeN5_wECE)o^RZ!JH=l`qQp_^0^L}C4fmt<k1iVe-
zelCD@d7mG9Ap*^g8LzGj94>BHk`*yHbfDw{r$Yf4ln%l`(Ovz*0%&*Y@8R6YzbO8t
zDE_17t0l5GRJUcZ7UHEqHrb?6!UuxW*d|*;*sEOeI-ZhLQG-RJ%H>i}HTyde_DZHc
zm96cY06Apj!J<%phAu^b;zWzngNkAAPPr>hS8|p}F~p-h%xhHjre7F4rU75vghVuA
zuFVAI*=d+fm|l@0^FmU2J7N1RZ)#l^g>7Yy)LNHdIgIIxSHO%}O~BZK&-+mi4O8&;
z^Zc$fo2XoP+|(dJOD?uO)mw0lD|Jo!Q7pCwx9H`3L`vQxmEfVwoXQ$Y2ySsq-lCBM
z6%Ph<*LYF@yt8o-Sm_Iq1JH%5$**X_SywLdH}50KO`4RVVP_m}I1d-#oVjNKujxM1
zj8!WCeiUq(<Y6MKGxDC@OkKBZI7>!xuM-)bNNd$ieb?9^L4A{JN(47FMe6d`O-%P3
zDKY{_X%drRwmW5;REqOJ8MdNyKAhPEUJ7EjhS)I}IRMb?h+@#P0rUE>oZ&{?b=eL8
zeN`|k1W6$oo2qgyjK@~uf!2y%LTbAmgowf*?oyDu(_BSpDxH}fvvMe~A149j*7XRh
zMLU7kyD&?yu5E!_&yfIFa8<vW&$3x{3lsOEhI6zr8+GHfpUxZ(h$ZjH#_ox?4-hGS
z0y#=d4d@a2we*llQtW1kWbZHx%7qCM8(a0@E2&ry-X0ylZXUe?%JNHS#N!giGfI)x
z<Al?1+Xt;5+h?u)s?@Coe+%B?BeaJ<@7TxBj3b&hb8#n0Lam9c4i1{_v|k-H51oc<
zZiTmJt<yJ9#Ju&1C@A+m>=J^Kq~b(nJbC>S(aP=cjvo$Fn+Ok+(RvaRlBw9tCWv+5
z458&|fST!xOY%;`Va(x%h-N*cPtalw6=a@x;Vn|!h|K#jzqOJAzL3b_OC|2taTve^
z&pW4EZX?zT5N0JPFGGsi<=G87t<xWn*d^zzqvO`;>G5gzv~~7F^Ds*ZInb4U{Y%|h
z^{qnMP;)R#nn=HOn=<wAQ1hSHE4uqM!xh;SU~b7|`Yd<=hqRKTD=O9r5{uLW*Vpku
zzmoT~Lo;Y>u?qi=lUiW`>l&AHwJfMW$(M7!mU+I{fk>`!20jiA?Rt4;eesIOS1bMK
zz*a<zpxI}2$?9ftGvu)|&Sjl9j}I1ie#%)W|E&Jmsjz4W96Ra&E|yQ}JKtVmsusr^
z^8w3c<ha7};;zfP=++l)5d9F|*~*SAw==#phx4ni0{47x*2n@?MFM1Ql4t3BpW-Fr
z8P4U}zhL8QPM(Q_F9LnxsV?S<=u>$cl2*D7ROd`|<OD|2*v!Wx!qEg(INZac(`-MS
zv?s^|_G1xt!drnP7pP@YySV`+r;10Ts2_*ub?UK3QyW#OgH^@;|A0ssUog2RiYT8_
z4LD08`CZU&OJNJUBfJWGm^pr&$S|H$Nj9OwrL*4T#D!y&17qmqTB|YH<pfeeJ7t=C
z<SSRzDh_Ljg;lj?B^P8OrlMhZ=eWuh7YMAOo!6w=h|b4dTxaC?<D_2&$~Pmq>WJ?v
z4E?mzu_+}LKCH9S`DuRCX*3LxY#QE)@(zs$G8Zr1;;C)k9j9{Yl-ri5#hb_~W2VUX
z8OIk-&X2+Z6i<>&3%l*j(Hud|UXlU8nBO5kdy^PFYdCY%6J&@`^8{joH_-Y`4Ht3!
zH-t9mPRV0l=KyQ~KB?yE%6tpnyi1oWyCll#Nn$Bdp$-zw3zKq?sU)XMLEzYUK@5p_
zh7yUCoDh7KCksu8yPkP)j%V!lj^RdmJK*Nvpduotf2O$~IP)!Ksy{q$Iy;C|H#}Rn
zZJAL_Iq`_SH&aBsNk-e;lX1+18BgX@gkKeT5Yn)!Ia7G)Eu_0breWePs$Z2Zku9is
zy!wl<p!uxSBJmfWtvQqy_F)12Eu&^znH`g&bc)?zWIv@5u_^%hft<FH8Z)?S<ZmO|
zd7Q%wcahk(0Y#=;N0CJ>OBa86pBZH?JD3*kC-wW`xrnQsdx)5W5Fv}>il<aP?A#3W
z(d+;b4q>Q%)JH}W>pPZ&j_}<g8R0Rqja4kfJ-Aim{ADD6VsDCxE({LGAD2BP$lzBU
zrrv$E$EhbbF+KYBV^?@i4XqAa%Pud*a1CczSryTJ)|5AW?Y_e`y!bt)_Wb^X(=&em
z@oCLPLv;6MfhrZ_g3qUP1x-2I`*c2;)t6h#QOwBKB33n?VCayB7E@>`&VijU8#!T4
z6+T^%c>!$b^lsd{g7GHvl=$Rz&%*YZ2tykIE4)N$DB;C>2@H>gK~?cVMh8|CRgKan
z0ek-8j*KK&4jM?lYL0i=2s+7Nc7v+E8zegW$)!AJvP+DC@bCb#>B+mc<APz;d~(K7
zLF8x~rOMe9eSyfg|K+Pr^M_XO$O$<V@vURHd2Gs<515!P(v*4+i@h%vwqyi`2Gc&>
zaG=vj>`_te#;@NX35?h6#)b-=$=#0D%StC?6Y%0nLdNB0lwUAL^IR)oooBOQWaZM%
z?r=QoVEd4rp_psI7{vP}?4ivC+jl?9(UDFdHbDBn1sfQE?IRhqk{gU8ITk@)7*WKZ
zL)1yGNBY$bj1u=X0XEw^pu<r?_=)o)N``HksCkbKV<NwurmP${w+)}cEijDPh$})-
zO!M&cjac~MDp2%FM~bDw&MT2~v67c<c*JgnmXP!Z5uCTnt0MaV?Ovc-GvnzXqXG<e
zhk7e3ZYOkZRR}~(+k8k^ASa36s`-IdU{6_mmW&7SWmipKDMn5>nK`_TwVxJOD~o-&
z@_cITus2X$CfZwt+6d2rvD0=oBMF#2r30JY12p4Hin^pmg+<Wp-;Kjj+=HRJlmtt?
z7nzqma_03SOQvBWP-_u)3g3_SzVDv3_r5RlthSA<?*`lcjqQvUI}7%Xj}F?eDBI}k
zzn3%nyg**zyjY_^o0-=DuEG>L@m-MF97iaepUh_*wXANRvV$={wjHxd<&{;bENR7g
zT3e+Rx7U)vxRUA8=uBSln7!jSZ<<H@b+5DeNZlNqfvwiwQ46E&o}8Z*Nj?`&eD(H^
z&(9WjkO7Ia16T`8es^SrdU$%?ec3+i1Q)TmG>8@!g>LZDRe70UE9}Tgb~Qi~5I&Ze
zBvVdTQKPCo)cq8hBr|?hJ9svZA-frBAZ6Q0Hl{_d12L$rYZH;ZKG`gb_!G1nAbx;o
z37G}G$55H!G`NF4E*(2x35IW#ZpLc`UU7U)wbIe%L_f^RwF?`CBbk$YiGt#a#{ywv
zR#z*w)JeimoM+t_BWpW2WpuVNs*D1t!7PX|?!gUoX_SY_a4sQ+W|2fTGNZ#KX5@9+
z>Kq@QqXm7yz9;sgaBX~saBbt#u@fp(-@{)js>mr$wRl~>=pif-t37vjqR3M*78_i?
zsAqzceKntvb8;VL!E8=2reJLYyfM(hGi9#N1zhr8A`TEeL;)oo<&)gkMYjibhdp(}
zG@N8@^d?gbScmfNjufkQUZ0=sAHO~79vvSXHeYpWBs=dOe_vw(^JY#olvTvYOzq@x
z+mhA<y(8}=-~^6~L11s-Ix8gE%s9DZ6GZV>Hs`dGmrZ$dw5m#r6gns)qLV``KP$IU
zj1!F}vpZ{KSpYxy?*bhN?l6%yO!J4<>C5Aer##5sJ5M(Kiw8ehYbDR%rOaBXC~!K^
zlE}9>H-Q00HkP`LOZ?6Y_3eJLLDpBPLjx$SWFvoP>uFwc4E0EDlo?QY`$_;_uk61J
z9*`)1D6CtRzFsFNvc(LxaE#~)hr@V%wo$3Ss}szqw>ko-U|7qni@Z&gw~@%X=y_(A
zx<e^GQ#8b2rO|!&jt7qY*30t(y-4N3aBc=*hg8MKqI*bd_29vWdB8zh0ayT<0;Nbf
zMcK%|VuRuWwdOsF77C6R81lZg<|ia1K##OykKBx4z&MaQ{)P^|W^JDvGTU!8W7ut)
z^G&o}c8qmIK`LBN-(}W~D=bHT0rEec+3)}Wi>U^^#}Bfu!t!JJn1TRNxZ9Pidfk{y
zPCQZ>O4kf98@EjgG?7~9V+6MY7|}}uplXi#+9Ui8L-9h7i}etoKo0<R5=DLvl#rlg
zI)Ffi{R`2dsr^bd7j~|IAy}g1%p1h$6tn70W8}$lE1~DIbAD7b*`5H&6-=9O5u6yp
z)Ei@Hkp%|4MWJU4?-LPMn1aE2I<efbt^e>{=4v6u&2=QQ0M2*8%0ea{IhYl3$waiJ
zIiYk>Srcf9T;seLOl$_@d%|!-Vjn)34{<NWgSzY1t;Qa8<E@&lE{rChBeYyO{Rz<N
zVe=>Bfv17_qahIL8J`>7lX}_3Q=kc600bwE7c%o~&JpLhsWn$a$x0X>P4fjcpaUpq
zAZx+rwjdTmXq21d@Ph^O^&&U=1I-yC8T!wcDlbvsA03~y_u$fg(ARB2*K^-SHS5p;
z+1S`9QOrAVt+SPk1E_*)eA>UjeTpYKn5J<(SciWnvuQy|dJdZ(s+=Sf(t&8z>R0f#
zymbfn3B2G%cK}$CGLv!31=W`bF<h)7LSEd@nd?H$gG<cia{;E0vfF8u>%p$1cST?-
zoCU>9cy*5aSI_{UcY0eUUb3_<-lY~ZxozMZ?jrADy|DPRAY*{$L<*iJH?u2rA1#><
z<qX26YC!`nZ1a*YY2roUm=SPG&0X}g5XC@&tLDIml7EUxCxAE(H$=iz?t=$1^h%xo
z7H!(qu5bP1NniXIw&Z`HEJcILrKn#;bwM<U$ODisws15eV;qw=1j++{&D@?6F+G+a
zxCYr|tBpH5Bi1d7#Baz9gu^6BXOjfE`oVCXUOl5&5!QSiO=KvXs>uX|rUe6}2+e3D
zKzzT@$F1-<xhqWFcFi!lWENw$H@)^jPt3DB2R_=&8$UCl+$36r1XI-DpkyfuO>&Z!
z;gF-0$xMbQ0>W8htJI!*HOjq7F%{Gn1>LcrcTxsZz*-}KGJf9)d3(5lT#(XXvA^5=
z+SP|OGStQ(xMr=xa^ZF{UH04RSj}Aqis>YDtaD+tPEY*{t86`ZryBy+KynfiuWEv4
z(jf9!m?=gobb>X+3%7|zjHoba59o2<WemI&d$>`}X=pT<Bc~8p8uEvh4c$G=60yab
zjgLDB;~}QQt&3fnLx*CT11(3HnkjH#GM!y*1lpYb1%j5DoY<ArVB?ACkjA)nB9_a}
zfjv@EvjGgfD_+tlq)M-F|7m(367BqB9{1i43pF3wv+RH`cY~wj?m@GCc>IGOo3~K%
z?~G76Gg|8`C11uR6xX(kD1cyyY2sT1#iD&)vdtwWt@Wjq2aCJzh*Uw9?gMpG#&A#i
zZba#G3j~9{NJ4+&{++s;6;H%?J~3Kz4Z5tkAu+(zEM56*Yl2U7;KsiCa9BFrMt-6l
zbuVo{Iu`$o)Kf|liWH2bhL|WSw?Xlsg)^!c_1nko!4aKa|1fgkX4Fq$b<QNtS?cU*
zR}%*^4q&STxoVu-#CMod4*;VEyb!y8l5`uM2Ls!3Rc%RvfLO{I3$kVsE%}+O4?3;0
zx@Vb*$^a9jj9Z$yX+Mlg!byyhixw}NL!r?%+C+Uq4)z#*nq`a&#T_ECFj^3ey-Vh@
z==H#thJmgQ8&Dwfcp8KTcQnkZCxNTv!nG0+b!20TSsO8gvo9`@*IJ5W$ndp`cF-F3
zg2St25S=J**<a`a0~A_pXWcqz*wY9Tg(Xw#fflpX6$K`zCuGxLcNR}tn==lHcKcj1
ztrbI~Gm463lTWdv+!^VoN`;V{QSQ$yqf=~EW^_f~b48xh!PQHdy!$YB2%LK{c4k~f
zd{80m3X~C;D~b<<ab}mi)Es%tteun18h0KVh5WD;L>OK1H#bof`Jx{lAD^JCywg5D
zQg!duhmYL(s!6I$ON-1pHy6G9DvC2k7&uFuWU7w9nhFuq<2V7y06=W7t}zOa6>$+_
zu@>v`z=+kgXg8U3#}Q?Wc=)hpw@c1KB(J^NkPwMXN79mH94oU<bGh-gFbSkPx@x0Q
zKERqYz6C?rbh^z&D;dN#Rq`|$GLdgx1^V-;CZ`jbt2hqSHMB8bV_ZyQL~=4`w)<)W
zBA?ArJC=%^9Tn((xYyX^9I!mx14AH{$xJqsNX*tu#w;x7l^m<zY#NyTfIiJJ-Lo2X
zOxomRi*`PBjdz%#E!2d1uA(|x9+H~B<T(k#Hl7Zz#kdfy>TfauI!Qf9z<-xqq!^G{
zJdNqL&seD$8rK-Bv4^m^3$0&)jR8O*mWdn=g%eK7HhVpQ3wkZhUoJ6+itoFw_dK>{
z3V)5-I=7{qi@H5FEGC;<YFsjmWt||rf#id`W=gKV;Z1nw<RCy`AP9751T1@75<0tx
zkk@7kjZ`%u(j6OqOsESsrq?JS+MWhs93|tJY`qJTdOG7xpyzQB1(QEhFEZ!aB5}q@
z0w5C<QAWb&P=3(ryy2l$<(Usz-bSQMzKIH=mXgf}na2V}m)6x{8_HRwmL&v%>SEIm
zTqjE_D0RTbAbzZgl&OD%45rc0(5S+RQ4Uk4LfN|97`tkcIm|Iff$;obwRNMlSkFhy
zk)$u^mo$rqNK<b=c@Xp_^Sa5(VqR=K8R^`$J=diiE12+jbl}VqlhE$!Ll=|a<?awH
zAck?J+u*y*E&%M{ieDFp3Bpf#sGx-?{oyVT+xIRuR=@@?8f=)wc9LbI*ty5MVJ)pe
zk%Szq28dh(O}G}+Y~xHZMUE1?5-8fx<td$)@yyrU9}!`2G!{{BsF?&S(NT$6r+5jF
zb-7+fa#5k@v4k_u-cPlH!!EUION?^lz`}i<Kf=!YX1~wgV}@O<(57n0NE+BnrEcp2
zyy2)uQ;LbJK~rHoL}sOLoeSxC!DW6K%?wK8^GDWIMiLW^U8|>c3U0u7R!%-qjX{4(
zDmM07x~t3ihEsMC4Jb|tCMp2tLz5q~ri<8;e#Ed%rY7()^F_Is*;SE@5ASLwU?xRx
zx=Aboq8yuBfbOF=IMfC?aM7rRRmH($ne7dAX30Yes%i9D6~S4u=8@7g8m4)m7o$6<
z^0v(-ghYU5suntcm^;CwRYZQ#tprE)YH_qq6p3JcvSu+1f8U-VkGha%-Qe1z1fwaM
z(9$tktlNn1O_Wz-(xU&IN5K9|`$)ZMs1msY=$yl?+nC1bd%F~tEaF|z!5y&JbY01%
z0(*3(HrUN)b??8dd+6u$3bhw6X(%L)M>@YiNi-ae>lmFYyo*r@9}ec%(6i+VO!zp_
z0b9I{Fe;2SUCahBk&c+(r%<SJT&-ETL?D;p*pS91{g4ou<pZFtsKJOPL9^35$;O_e
z8`BzwN}pr|I?hUe7NIUzh&Km3_w;dhW<uFHj4pocW4!gKAKB7x;X)I;jZ>87onvP#
zp!2*=y%uJ}R7NIMIcLi~`+JMxpz=-@oVx;dSO%j_P2Hs%qN{fmv}ay9vI(Ix{X1Ih
zjwaKnhavyOBZtDjYjeiwK-P+<s7wyO)bO9a1*+KeUP&J!B4t6U;#Jx;Ov2l}pXqDG
z<;%?J?670{L^G+4psE5kqC4bjDp1XsTfTJd4b45kGGZppIiR`2`IzGQP+(-n+jRdC
z`-&mqHS%NBiDvuBc=k4o4f_-g>)7h+(C^h1i>oQLFaMVraZieQTr}Y^GnT)*b4{LE
z-H{A3ZC42$CGS-!gA_VNqlFQtVa;fVC^Xj^1rJMrZjAd;=n~dCM3|{MW6#H#o#t|5
zHpi5mPo4xT(_p-G?j2X^K1Y(1{fIb<DJyHMBu9`-+>6r0herpdm`>UdO|Kh9t+sOH
zQb(c4dbTUPly`SIn|g-sUlz6WpxHTdJ(w7>xlsQKZ;HxltrT4uu1*!8|F+pa^QKd3
zq}jzVI4E#}3nz6<b_5&gG3G*|hxAUavEZ|Jh{-BtcFDz^5n1xxhXfLGF-Cly$ur`c
zDRSLCv<1V6qx|!A0ZwxVmPrMnr(8SWI4W)`7K$=XZXjmhOJHcq8MQ|afahAIV1%8B
zo&Lq#0L@)VC$aav8hFx<)m#dQ043_Pw5iY&LYJMrqw5$qhC`J&p-(MdVX~8sDWUQV
z@sJ;PU81<!bv7LLB%VZ=JFHI|&&CUuBqu&hsSGnQ`h@KXGFm$H3xREC8dGM#wbVeH
z>NFa2IuWL6oq6+}y8&>Hf`5PdbbH6R?C9UOkx|egx{qYQumYN_!k7k6Rl~2@W+-8c
zbLf;W&nml7w?0fRNho<I@oZCycy5GX6E_op)ynb}#bH(u%@iRh3h&T+-$hj4l|2OL
z>C4s43_QJfa`7%$#|&jZ@BHcr9_Yy?Myuyo7aKT1l-@q~i)=YXU}P|`Oo45uKso^e
zCLDHYZZQ<)d}y3n+zH`W92MsvLX{%U*Ebk9p^x}yH0)p0sqcEQlPAlHz*nGxdCL+v
z+LuUnMd+rY0&0%>sQZL${9(=FsfqHL3<jjNJUTvWnH=Am)@aRAH!NJ04TzVM>56xp
zF|45b&B^g(#C7v&j`ZVE9!S*=smpRm2>Xo3*Wobk^QIjE3gFNqiOukXwr0I}5{i+Q
z>s2LqiTsRE(T^o;ID0q*Q((S(oTEFazTCr0&$l#Ceep{z*>=YBMuy`NtE8<}8zwP&
zl91S|*=Mb8dnM#4DTq@R%bN6uoLyFO$}XjXnW-ovgUQOlzm*)(8wIiNdtM6K-4bS`
z<W9^GaT<7*u-ljs;6~75amKTtDHpHhSTTCx>6<QlXMZ2vHPcfT65)wJD3P3yjZLsL
zqQaoc{*r`pwW;ekjSX|S$2T;lRwK&0Rt!|R`H#mM$XzGN6r>{2%S0W>kfbC%3CkG8
zIz$5Ja@5&bh?0N{BmbU8c=hVt`l@}nAtW|Qrz8L<M;N8pj1&=QEZ&$xyqg2><|Hho
zYEG%g2)c5ow4WgIpe&B2c~+WaYXx6^`K8TlT9(7ki8|(7L(bKySNp9*-))|>O_)TR
zy^QiKalQ%*=7e+zoC;B#N|F8p^pd=n)(F@pdW1+Abb~lDC>q*l5J8ndkWDfeg3TVK
zJ#ZkXHJkK;uVJBKv6M>P8P)4<y5Yd>-bV0kD^?Yml<p8a(rh5O-SSVsdVE-g7(-sg
z9~jM-7RUKZFgVP{)S(;un4?tZV!pm}ZW9iLrM69MzvDPc%GKYS4l&I-H_pvgk6->r
zw{v!iE}>~Z9Y;6S$}iJj#uat#lB&u36)HYF{=TR#d2e3KhpRO4e>Sm&qE>p8hGlsR
z&o&Edb0GPpmA6VKz$u-UH?dyW{{;16D?sq%_~=zp{eR${(qE;8|2%J<xAse?L22Vx
zn8h}>@P7y#G@;^YrIWC?3S5KydJL0Q#_=o%$RXMtEeAuzl>%kX2U}j3ost{4<1aCs
zClp)WlffL7#@ka^Jd9i#7&8Ipu_z-SCX~5Kh8hVipl&FJ56QsMZm@9CRvAR4(K<aX
zsy$Ai+xyM~+CqUe1=@q^h3kGdo`tuc(lFQLB`9n;1dfT?`lQx5%Ox&ypX_*e6-=Oi
zxlyo_LM%6*C4(sn_&%j`PH!h+ny8iHC1EYzeS0`M?(ChmPtH*FOF>g9%m6jD5u6Yq
zLeVf<KQs?FiaHkU>wWt@JZ|p88>{G4-LFf##bZ$u7cMDKOrJLAm*<_IY{wV#^bXbS
zlt?c$bN@+#QBY0+lAa2nzHc8MqVQE?B>*XcW{!oxVOAfb6Wn)<Z-A+4ol^UU@%TNn
zDf|!zO|cXBQYI#vP0kv?6AhyV3B8R=MzA(c)(S_*_KNo&S-XSwofd$O;g>kDvT^D-
zoTOI?nlsr@hDL+TKC=>xaDoB%Nhl^ckoHurM^qVd>p(8WgFCZ3Xl{7!pgf6j>&7gG
z<GE^P#@zS-V3@pELQ;sZO?W{d)7+60e~Wy23XJD0nQ&&M6mu*w=o*ajlL?}OnmI2v
zjs?TWM6>8eGiuGq6{tIEq;P?z2}v>TyF#a}=Kk@~;ZM4UQE5&5wY@fo*OA<vw1Eoy
zA1C1)<#6{!Db4e<*Fh7jj%PM}9H$~H>?lb__wD8Q_>H-FX)j^&zNpUz*d%lkt?`Rs
zZ4}<}kK%KHCik!;)BE2IKeqOoFON^pfEN$PX{hObfEt=&a2(x|l(JSuxwP?0z^%a=
z?ho?Q*2!Ueuh}7)oA^YK0!W+W&^)jUictX|!B4o;5tDx3`YAXI(cO=T5ww`LuGF`1
ztewdk(FNX?Og*8R#kG!{xw#XsITOc5hL#%7heMWNV(sU-S6k(;NM^Z|U1$^%?9{-{
zDh+h~89Vif-d`|weqTNTe!tQz*2`zXt^9$h5YayhCnYm6uZt&QUavNfLLR}ivC=Fa
zY?e<0u98L5z}E|=fv^AQG_Z}8rt$yFOd}f*;^g%B?6})`-8^mWcRQ`a*4|ln@6CQE
z7Zjogy;BIE7+qJVKR<o^tK%7g24(yX14>xUfqjV4eTUmn6RyarZHJ=lBm?J3t^Upx
z)C=hrVbs;1-z}Q5sYCVpfKq1@=xsKr!ViL4wIG~~a+pu?Uj_jEe$dB14^jeOzM7p_
z-GPcO)klw{W9hXgc<2xuWDb@8^ELJ&<+#JGoeaCVLMz{3)rsHC;|vKrzd&;JVqrVq
zVqH^G8hYY4G#{_j)D|I>d9Jl@GP7H)G1|+MY+GMv+FEsJwC<Dq*uE`i*zu~$vg!S3
zSklFQ>#$Pa$--@j#CdUr^P|J|(f5`5(+p8JNhT#VPEU?cD)r1F56jCR7MDjq@v;i%
zo!6E6ll+Jl)xu#(&2KY(VP=oAzTO=F(8~37v8c*Rsgr@&2N>Td9+y=5JB;p4`>0a?
zx}a8gyQo(4$6PIvm6z0cbAEW%&dms^$C3(2ALiEQ3R#!p@~=Csvt0Rf8jVWIcTQVx
za^-K)ldWvW{P^nh`1~XX;oIIYjLUlYaqqC%ev_-ijB?q?h*!?<ebF?RZ8RWak+-bW
zvlxYKcEYmmPS^^kd6wIuQgd;=+%8atw5--?r`<Wr)hb_DTGtHjh_1sjRD;46Ue^-L
zrTX*?@)|~ivJv2`+*V;9pW+JiF1Ohyx8-Z_BZ5D8oUKq=yi(ux%SvLyqS9yWH?92e
zquKP1B9E5tr?b<aDBA#B1e<<k@+mH<cW`{Vmq%S_`4aa_s{F@!=d8V-+wkZqQCjD)
zSy-nZ4MM;|XyiO4ZmPJp6wB}3*wG32Rq$0FzeMFDgnf$x%m4zdnrE}J&HH_;b#iug
zm>U-g_{sor+}zKNiwgp_Nav_>F0Q$UhrR_kqjUbIb(*J;*lwky@~hTab1#2EXH8j3
zYOh0Y#TBD}%)?<?Qf)U^4gL#zoPGga{kR|>_-auLRjp8?U0uct5G~D|K>O&d^$L(y
zjt!6zphwyzpgf|;J>s}zKzVYV^oZ*<PNntEjo_H?qwyjd_mV#EQ*5Jkw0DfsU>vAR
zaxa+D%k#tUU+<rG4_ilNvl=12c-5bN20o**&J0AQUNp7O*w6pT^<&~NQ6i)SrCcN?
z$1G5MDTo@P9*j`9NAgU(BY^hdUl?bP6Hf9N)+No*P||!!Y^QiCVJ1*o8=?WR>}QP-
zJ&MAy<1K-TuBa#ZvPhvGkK@sNWOD*LgOT)N-g|9GilK)Pf5Q+J;WSRsYeNH1{r$9g
z^s4ppr^D8ddJATyLU#JQfileIS;aqd1~_h6eO6(wE>fAJj-A!*dn86K)t49MBfuAc
zf=*$y$>?=-y9d1+6SwJn9QW%IE8+C~sM`jfz5Vx=j?^jjbG{VrwY6V1*SIj-k2|4-
z+9tpkg@^LqY-iFByMg%kTL(=bb1@h{dnk&D0hvgm-F4kW5{X$d5A)0M)5RYKQD5xJ
z*;K_<`>>#XW5w3U9ENwSINH)~R);qe8)e1jNNJ#x?PuJpi8T4Z%6^zHuJ7MDKBx~Q
z4&nL%uGDHR+XT;!T<$zslK31@*cVcW6ub?my{j&TvByw#EMwuMg}b}KH<&8->Eqy8
zu(R#ex`@a9u-~6{l}6h1USk*!4&Vdi?kK+n&X3wZc00#=-?z>%OT-(may%KJy1l5~
z*)T1AmnH+e=QM-wLc@HM9#-qVk0)KytpG*Pb?h5+otSv0MX=Nzm#rnwyBNts9oY&B
z=?Z=TT+yFTsu`di9=|$hA7;+5W3I^7iU$X|_xZSm*}e;d_7;}n;B@SUQuLnucPSbk
zytawsxm+#?KGwL16Rw~MiYX9E>F~&jo}wG&*E(B_gO(MR<Ipf>&JrDlg0SSu_M>5V
z2dk#jDu7DS&cl@<X(UwbUvL3D({D`B1@f7Xr|C>mI;w#nY0EQbyfiXkZa|Z`Uxo_g
zH1x^GysMh&Yy&WacyQN6-&3@f>5Ac9wphle!M=yxokqEc5$Z^CamT4={ctaWc^22H
z`P-r-Jb%V<$U}}LM{Do!9M#`ld7M9H+8CSGbuq{kZ5OF0!EP|ILHFqRsO8m_$Yfm(
zY}S>)W&y{!-y@o?`jv(+!!j7667xLQoui{m6Wz`PD&3gz7~2DrS#^8gMCv2c+O1&2
z-$aUtG=-gb8*11HPJMzG0jAHR9D3{9$^?AwWEWVF^8PXngu#+d2(uc4R*L4=&%J)S
zx&Cw$IUP=zOVI)7!ruz6(6Swg!Yy@sQ)j&5rgk==q0P;FQ%{iOoX;YTYzRe6%(TS~
zKBe}k#q8L)L2b`(Q3-KBDcX=o8h-`Z>;rY@Md#afGb?*bHVV7J)19xsEqGg0Pd09O
z0e;gJBB#rK40()*B06(fp+K&SIeJ?86GH_xxMX)Wnv~%)zhDs-_DdAr+B_^k?Qjuk
z+B!qA@GyTm+G`(oQBrh#ewMFHNQiweh@nLP6bf}}5+>A1S#Hd0xNPf()@hcM6HrpK
z29BG>AwJ2`g0lS4#Uu_ynFgsPeN{GldEW)Pcg8BX&GJHV|8{W!Oe$PhV4R5Wi~*KQ
zA?Os<2c_f$nBbjo{<<R9^ZO$CTi1BO<cLVJDCmmyLbvR+WQxhL$@Jt067}MUy51Uu
zojnhbV2JS!tzSk)9Kk8nIIH~e%kzUSi5giPVPyoahh{f{hP&LVhzscXOX`lIE2jG_
z*TeUAbccYKZUeM=>GY7j;rp_5V0<i~_@W^t=p}`%b;JI<E^$&iC~6(5Q)kWoyC3Lf
z;mG!rIWjFMr<+kYf{azVhO_JboeixwH)M5AyC+H7CSAbR#^xg~ps$XiOMcZTct@tj
z{LH*E%P10ZW~CYp^c;yjCYC)O(|m4Sl}AW%V>cFZJWoCizV1*XJkcf5#{ivHI)eGP
zNY^npJ||O(C)m(7I6)@RdU;k+%-?+SLmr>u)E1B*$uz#~eqs|737WX)l*>p9fY4ST
z?@A_A`Tg>4k0q5ToE}#EYNS|OUXhArs*-MUc~vTwtC~z!shLbN6{jmzoaQTvvT}J{
zDOglJyj`(+c$=w?%EIM!u~eoa${&_j#8SD6<PyI^RV<gOJXy8&q_8@xEtl8ka@oqH
zCtaa3l`GgDD{f0uG`lrX5x&CS#9|fK`6;@XUtS_g@sUO*k*ZITyu1rUUu1&HN<=Nq
z3qHIF?`#ADmSjb6EA?zVh$<qoVPw7TO{`)`T*OV**ryD6<cmA<!;bx|eWE#*)PY27
za4usT<Bme*L^l+4Fx9*W$S!FcY+3unW;hgduCiyc^o8eSc#MIQEke#>TTBkl)9;$;
zyZCb}M<kH9bqVDo7d?4_6F*EGC=m)L&GSwxC;ag$c;ph4`9kE(@r=dKd=Xb`ZrCxh
z<yv2l#@F#Q8FP@a(}+1tH@%+3rk1-1ofQH{>c}xTu@WWtL089hC-fiLpPPEBe`e0h
zyC^BBm>cBE^;qmj!k%KJLpMD%jpQ1x8rKyMcfc1W`kb}t)`%dX1VKG%?`wD^V`hsX
zGMzyT$-I0(fv3~DH7kdme-Y1aF!avxDUA!r$t#2wrJK~KYZuW~2<>Vza_fev>BUc5
zz$KlYbvvz7pel)33cSxz!hLTPlzw&E+-n`cCH#|?-pABt!2eT(Q4yf1WP2LvfhcOr
za71rU+h;U}QwfD_CF~sct*|+4@px==M!4(OPa+Pn!VaOX#l4AN72q4B0cQ!P+_s*f
zQep$!XS;dI)4;Cr?2Jk$6D1ciDCXQT{f{o3iO)&mz7oGh6UF2vGLeCh$EP{58$5Z)
zF5LWrs{F0zd4F<yRp$cb*6Ke}!pvPHUOlxW70f2g+zUCsHuWyS$Q76v&}f_lmBlKI
z3X1RJG^HqK6qt^%a_}In)PvmU9QCC*_R=z_veDAfv{Ot18gJ$-S^H|q-pdCVccgsI
zOOfx2el1tD9&9QwsmeV8>LVwO3$GAf23q7Dqkd&Ypq*$G!R*;x1$qt^aDcN?lGZQX
zz~uLY4<AMDhA!E}4tv#kbEE@A<JpLk&czYk_M!><%?;qJ^)W~c`~ij=|4v~XdgwTJ
zFzT!&7l3A;OC`wwU;c77HPbMmrhXV<>|j@eXPDz1W{x?Vm<n=kRWSZAKuK!OmH-v+
z7`ulYkIcLR(mr7%e!-#`&4HBIFc}J6gI9{(Tk8Q_+?UgslIWy!lvo03GbO=3rK|+_
zIT}N=Q+ngsu==ik(0$c9JJ_d%Mx4Us)v(&GLrYG+ml#68k6d9qCbpJI&Y_zm8G93y
zIw!pm|5~R69^B0b3`^l+yRHP1$ukmN8)8Of`DJ)W?)^Lx%{EsT`o^Jz+cxiCko3s4
ztWWHHJ#bSqayIRVy!rYGd!u21S~K}B<u=~Zmc5;B#e|ala6<wzpfD-!1!N?E&MuC$
z#MlV@dprQDJ9v#*5Kc~y_edhs**iXMb({PDL7frtb}=7V3w*lmkbDOWGOku0A*y<m
zM#I4)PhbPM{kVHdeqK6o+A@9E;*`P0MjNC|2QWl<iL)QnRgnYVYqj77lwT|xlB8_m
zEQzU(8W!L#9Q5Jmzax=9D2!7<#F}xzV=6>K=?D^D18U9f4ln9t+Sl+B3Fkv4W0XN0
zWynp-GFaC_6OaszW5z5y`+@>sQ}%Hpa+=zE7kI-|4G91<HMXcehPr3@8Qp2(c?lcM
zc_=<t6y%;gnDji$1Ti{4cF06c8qM5I5?cuH7)&r~C(w-#7`O$!9RxQ(&2Cp!igIpm
zcXH0{$#;tP(sbr1CjREi5M`dhGxs4w#Q4)t3lfFiZ~q0bG8o0mf0`FkVpA&|7(O2M
zsKCNKFE~l`h%Iavi95YP{rdbK;6H60HZcI81uORUu%tUYLAG@)`6A%tNIXXT?!W&I
zmdq*8;1Ue%u~?2}&obsHtOu0`eY7CMipDl@MSOy>1_+<{=mb;l65ZrrklAzy%`pZc
zj8jN=9KSMzM^HH*tHUo7VP5~wgkB{|AemO--*Ms^+sSaeE0B=SQVJzg);lo&j`_g!
zLOCC&^9kw@ELZP0x(v_FI3&|FjD;;i2Lv1P7gvBtq}1X#%6Fl0bR1V@zorQUhPgQ~
z$Q>$Wrxat*DK(&!(d#Y&7N{2eP5TJ;EYX_#-GhCg8V3~K8j}pTsjdfKaApg%e~*au
zAJR993&2|OI(jtgJlvdeen4(DlmH&v70aX&vx&4I88~EszyZ$-;86EDQx2h)h>RWf
z9%e^~$bZ|)4_snTdSaxn5fqU=FqV-{d}NMZ)JOC0V^~0pCzg_`#<K;S!hE_YRJdip
z?B=_DSh5sCKXFi`DZ_>Sb?)`cXvS}<r-$t~?K33)+lQ_CSM+dYZqpvY<if~L^t$3E
zWnrohFs3<R#W|+-B;uGCo8fA9x080>;j^4&&8GM*KjHax+NFLQ3*nYe>BlRP4EsEj
zU7pbfJ%_paIT$*!9sPaAYpA))1U}rHa2o7m?UML-p3t;`GGXLsc{7~v%pS>RhLwR|
z0KXy2@4gihf_Fiesa`ANb!H@S;q;slOU7N#B*q7M#M2PgkfbR~nJuS8GI{c0u?TX=
z0wOpx+E^}QwwVc;wsRqWQWTc1YRkPa%T|;&R{+$HdZ^4L<F>7*835qNUvDT?0@6%b
z_7+=EmMMe92T|^)f}GFz$uA(Cf`U14ph}iM=yLi?xn@SXwn2+dyk3}>XaEMpxcREj
zCioG3Op)jAFpP3^6CCVQE*Lk!Y-TwX1a`T;vuja0Wm~$jYm58kKIS%Y6A_Pznys@2
zEPY9FVMs%Zq`t=fCWhQ3sIfE014)L6cr{~=2(n(rP!ZGI{IYYiThZOf`ZTj<*~(>y
z96z3w7PQy(P+krV7Hy+ErZk-|Mwb~lJ5693LLFF|ka!%;CI$d3N>5BF3yXG_W{W`>
z`0b688>AKD9xax|7+Xcnz~as*O!C;M22gQh=C#UxG$uiLawoqG7LwU(@+S(uDrkRg
zF57p!wm@E3fm`Fja5(qx2b(yX#W9-jYGYAL5=Mri5aX9S9F3tJEdnsXq!+Y>L&C71
zEW|Bveb-Obti4H(UNd|Bp4H6W&u=;W7;#JX#mAD3Ua&kGRGTSf-Ez1F{St6gI0B6X
z^JKu$f+5<^Wx^?elz&)@%iI?v#dBochlKAz<ge~C4iix_QP>(ZF(>@Yafjt($Yqty
zZQ-~b&Mb3>)mEO;o*bxxnZTjpomw&_XN^%QauHFM)&5-4!am@XRmli5OQVq&9=npJ
zFwp8;5K2iAU|`_PakO5ceq6k!=h8t8_kyXxSM@w1&j2$=+!jLk==iL?*Q!_AGP1q_
zaUt)yWZP6Fo03Y5hj)QQ62sTEPuo7LS24G4mPGKsX`IwO3ATj_Jh2JvO^hw2B#AU^
zT{M<l!m-E&bHYZ;7Xr{kSaO#>8b`B7D5`jrCb(G1cw9%)8HM-~&Py&R4z!AcI_phd
z@-RBgGo|H%;m+}!=8tf79nsu~4O<@|eLL`^HiZMJ)GJff)EFTc@=cCB>&w9;FB2YM
z+<p=wIWnX=mi$uEU$`M`k^Rsv^TJ?l(-wKbVn6%fyMhJEUdzRZL%uvCRsPxDiLs(p
zW|Z+hEVjrS%rYwqTm(NSR30a>yfNGkwYy=}sLsgic4iI;bZ_Fn1CcvTJOMfH4}8Ok
z&ksqu5}{il{XXcY!FoC<^fAoZc|x(q3v#r|>8)rj@b#ciHk~3hOOWWFM{YKNXg|Vy
z;3(GM%)qL78P)^aLOp1r%(J=Qd}-V+Xv5JQZ8={jWe3QtsvKD|MkL)01*v9P%ao>v
zO7#h?DVqO?X}0F?!lj2Ym{_Qva85Z%K+kp_n57i+B#LhXop@@LGNob3V9-xh9xuMt
z^t?&ka%A{vW+mzXBZLkHdk)rlfL$5$XIP~$VtCwV0qTK23^w7UVE8SRRA!GAS_CB$
zvOPmYo6){Q&!=}Ju7|&kM(vMo4gBO~ve{GONn?3`I8LV==ureRo?H`7D+?x#9hp%O
zt)YZsjqG+}V|<3u!l!KiVM~et%+n|P>ZObg5z9eyg9$0YM>4fdio1Kj@txOT+pTFX
zWcIa|n^|xV)LL7oJ+kI@X~&FKdND=*i1OpV93~gxFzfcoeV6y@6=omN4N9nG*%c2K
zlyndf2*!}4NWMIbUVfBy-$=@pjq9qQIU!~2)4D8=#=O8ZfcD8X%Nya#Qxgy{U1p=i
zyD6pZ<dkJ$OG!!Cnw;p?d(UQ(JZq|6_mlS|E}$Hk8(07dMJ9A3SNP4)fxgDNp0<2c
zw6xs5fZh?XUPu5@*SgLPsVXoYc;dZvcjN?Nc%1>TVn^QXXUPeiCDv8KmwK@9k}?#?
z`nmzgZWcsVb(ix`F5HuDvl<#jOK{}9-!K+OP-#4SwqE(@xTsKs7exUu>&*@NA7b4M
z_~}3>=nE4{XNJ1#YrJwZ*?yjThnD!6;d^&w_S(omp(ujidLRuOc)ZJm@#E06q(NNg
zvb(`rW6h`8v`~$j(>%fk0<&rFYFfot^|fbfwSv3lWvmBP;F%NE=xt%|LR`2Ih%um&
zpNgHIai7FMtaaLN)N29R=-eem9FjAp$DcN)KQyF5D$MH!F6yJ!S<zLEs|MY5NiJ;V
z!`{G)h~ylDRe8$>M$dvh$^wblfk__4?nq8$m3zU1^x1<xD`Rs_($p0ZxRA-*`Z#T8
z4!Z#m2m7bMr8a+PwhxgjFk3Fyhb2)Lw|I0+!7h(a&ZxlezX$$%dV6%-IX^kU0KLEe
zp6kgkkAV)(-16D>4(`!d(-vMd!%`Ye?l!c2;{{69&@5s}UUn}RGZdbB96yW5F<M}l
z#!)h+3?}69S1;JTPMcVMZ<wHwR?$9pb$jNi%~S4;$dZ4j=x>~wT$m=IALfcgJ3|x-
zw~r2v@$%v{aTuA#7IV@%lj|~7V6iaTT(-{8p>-o?n@(zV3L&DhZXs73_c7=#MU7fC
z>=Q#`qr-55BRN<k;+;>dJiv9KrljO$QDoGO2U8ydt>$<kWI|k+0+vB4EW>^?eadLR
zs6dxO$D{8^K6rvxj_j{{;iN0}a3#S-oH|{~@5dGAUbbMb>~)Mjxa9*ikq*$-Ia*fe
zDlQ0yKt=rU3age|)Tv(*hOlz0Sa$W6G0Dof41Rze-WPk?+SgO|e=T@DOJMn_P{~N9
z(K`;3A>yBcA`~73P}Xq4Yw?EeQsSRwg*X~{L8&<DQidj*f!UVJg*9;Im#Ku7<%NxN
zod5f_o~>n@&yseCfI8hbt+Uhip6j8TGvC-i$Aj)DnoZ*#&~_W1S9f_aitmzArZ?RZ
z>^M=7%X&f8%*n=&A2lRXm#d|jpdp#4A;oq4XlKPx#w#`+Pv$d@fMLN~UYxzTv*q1V
z^D!VP-r2<Eu?tw)dE|v&p<sVLn!rB3!&n{wPP{=rgvDsOBzO(qg%pOyX1EL911C)^
z9%j=U-;ry6-S|ws=M<xyy-e>m;zCglj-oMiT8p89J2dxZf509(wm_rt5bfE?V-0S@
zle5<-(&_FskM>%J7=r~!hSq+KByC5OW0|(~guCl<D-wc>y#XmVvm{|4#jg9ZHx1J(
zNycICNenm0nH0a5iF!Asb_QFJ`y-G3YG$mhBNmalZq3<>IL&OmCPt8WeF{Y5dB@bw
z$AK%qyD4*GwbOp}`uwCGz~65B)sgNw^YWy9(#pLBDrmx)7exkXQq>oL#I^U<O?Q`K
zPzRHL+aeOwAHb_j!MGodfrv-@O!S`noxUCIw+@>>>5pSf?VCBtUK@k3M|&pchS2sS
z0B~#-71hhOlT53QQyR27i$+=JOgD6v^GIWa{Y|oe2G0ruYf)r7&!eb&^}#DKp#VLX
z(G0$19NptF-<rLvc!-7eUbheTIod-$d{79bWs^~hcE=3|nRdmlKq3ScMYWLRG`qnx
zygiC;GW7@Xt<qs8xN$bBk{X2|_aMIi*;q-jL>0p9QYAfUp;^);24hi!Cf{yp33SYv
z@w}D}ON{CHPQ6bB!jdbLml!f#4Y^l1e<wq6SM$r{qSBen#DNJO#*!y=#Uo1%6F`g;
z66E7oa!a`c<csD(`Bl0?Eiav|n-_jj`Gpyjy*7OZ=S*xfN=CiPEF`p*A(^^l57^aI
zwz;d7P(+vS6b+L10d3ooUKhviyvg*Wpe6c-vW^!<N<$ze6QCV9xv{mcL|m&lbT&*m
z(#-F_2hJlmPq_a^0+Z!M0bhL;!23Nlc&>isR+`;PSTs`X>}7>Tg;JoPa$qb5t<%lf
zVP``W<t7)^2&D<}c#v$kUVffwj+)O;^I1cc@+z{5R#h}cgb}%IZ}`4DN)eub1d<sb
zf*xKH{u=ql3_-;d4JaC!I0#5nnSF#jhbq!cQd#TQlC{7-*zdH?y6vOAQ^(iAX)CY(
zUM_P}$P>6!>14C;ZUik-LP$c7XTjQobZuqR=*+q}QzyJ5XFx-PQmljhi`u#=GoFte
z$2nXu8eX9UP)*jz?MfvOMM7~p17EUxj~S__H*gBpb#G(j&`;UXcAOYh3%h<W52`Q&
zG*idyU2NbMIDIY#pfeM5qF0%X7Op#|^|Matuv0uG?Rd#~br;z7a6XQ2eXV)XlG>QC
zMK&Ou?j&E91L;u`a9}48uV|PAN_XeTDix7)7+4e^;<yTh?YUkGX;D9jZIPiy)<DG_
zLAe;dWZ@972AbUOGtbe!P#&H$cw8uPwF4}ZwB}0Km2cv<5yypTB!RyGQ$Vc0^DaD+
zjlF0KxRHIub<f@B#jgmQ<!)du2=@{<9V2QbM2`>r><xSGMry9Qe5Z>oiPhp`c1ZNL
zOF0USBfMo<F@@1YjTmtic`tD_+Hf#unQ*3mff5W1ua$|i)xRi;t(B|E)O$8WSO22L
z&+pR)`Z=VDBQDDoG~|uYjBc0k2-jex4n4xtZG@x5e;?hQBm`p$RkKo)6uAg!vp+a8
z;=A6JybP}|yPUJ43_v1e<>2H+G%J4aX(yT;Orz*cG`mXr)zUUNB|=bLuSsr%TG~(1
zhu*t{NbC(1<4KYXn{<a~V~W$>K0G}S2s{%gmt`C#^NVzT(Zwiq<7jvf5c>5e;S7()
z{p%w+jU-N<R{*A1(%j^qbK0Z~=P*qs;U&gjLU!88skx8|SymSL_bxN~nZTp`N~1I_
z;O{XgxL5de|7CYsg-JY#NM2qX(Ns%_8Yd6ET#2p(V<|6*aVr;gh6M_Phe82PYP%q|
zI70xL25O8WJQRY|mf2cdW-JW5%GZ;D#4F;En4}BLuyPcSe2&w!nKQfs$m3B|UoUhi
z-HtQW&5^?=a42z~qdWze_ZRBqxN?p`PJlrRCW*_HZ){9KB4*Q=@3oh&C@FL{&MQEf
zn<@{G?w2Wvj^2-_vpWm6oPJRNf}<qoE>@(%FqufB0C1`weU?#MiclGE&q)-%M-gsz
z9;~au;-X&229bBmVI#ts7YoacKrFd2!L64R(^L`*3lbC&YZhs87FQrae~BgxQNiMo
z;tpL>L}HY$RtkoHNoGo>5Roe+e6}Qu8;*8C*jJvhiopPz$=Yz}*UW(j%-$9G3T>ec
zm9`Wra`VMCzQQyu5G3VF)Aw+eOuO=Jr9PZmq%OTz6#y&A!gH0JbH6z807;Zq$xz@F
zRO6n4@XMIASpzUT3b+D#7th?3qURx}BQ}@tfAki^xQUopUBX<AP*;SdFqY-G&s$>M
z_4_BM7W4^4qiOW{e;*mwZjqJN4Y7j8bn~&qQ!}lJg#gnjUR(e#YMMxCFo#OcsCY~H
zsJ$tM+$DY}SYX@Cg-^n9+^b4pD=~4hf)|EUdJkse(+tyb#>f^bI5HOME)2>o&s`yj
z8hM}fCa=}nTqAvz!QdS3(;j+ll34ry&)&QDwQ(%@!@s}%D#kjW7>S6hZ;5T3#UN}p
z7+3_!$>w;qgEYXzl14`(fyr_9wLkT(s_yBYizIBH?C!JHIWf{qU#qLDtLrLeuT~(1
zQR?MhS~e53u=(Q-L*(0_9pgd!3ytxhz3>>_yQg}a%rd5TiZ@+b`s|L)9bygNRGHN;
zJ`s0tY%k6z#j|kY#9zi7u0P}uQql}#o{_<Ug%Z6f{5@}sHaNp>gKeDlJ`9ZHTy;w^
zp2;C1VF?28_(RXTd%h2XQQz=cWCZET0QznT7L-!>m6VmJsmD~|L}xkAU%>^l_X3}q
z2vWxiyeznODFk))MW45t534jl=3vo5)(Vutu9TYLaS~3^YjTzyMbb2=4-+QOFvn(q
ziyb+!T{ir!HevD*Ik8qW#<&ETFxqmZ;k+#A&(M!3SnUdi5nV}NajR{N297Gu0-k4Y
zjMyF(wlVy&@}YfECNkbW+7o<+6*b!dlnId>wXLQ+IxG>O*sMJ4<mNu44iGB6+V5CD
zCS=jaqt5p6aqDoGzHm;+=K7OIkIF@Vrq_JLlx$!{nH3)`iGhLS6<I+%F@{BjxoovK
zAD;@LV1{!KHxZlG#vT<f6LyUha`5Q&D;&hegq`i)*cQY}|FSryLxcr|dMdVIOoo||
zpHS>N?&U+ParjiwVX0x73MawCfV!5j_Ji<)vi2N(VriHdCSfTUCDh^Vl7?stAqBAm
znj-5GjhgL1qSQDghz!q0`jwC>>;NRal;T>J9Bm6g%cPRo;PM9hrR$toOy@u!^r8vd
z2(jA*!BSflNTv{_tBa?AChJ$jR#bon@ew?}q&V*2;ri3fgM;NP*^k_0xu2q7-PY`A
z4_m?8?Z3Wly*)blrE_@HY5lanbGm<Y=+QR^mL`RgH6+mouC~t6bGF$7it{0P`aFJ2
z;NXWg-Dy9$=_i+NK?ur*-P^Zf8Q{J#o4}ESZSNe|Am*bmO>dHMPxBDcUP`k(9aQj)
z?}wVO;w;5kA{A`%MGgiKp`C^?wrVE>m>fqV=IQiOoJ(iHKH(Wnm)Ih8ISS;cVSB4k
z2|R(2EvDM)D<#~uFbTp(8*{DRlr08`6A0n8GUbGr{T?w8O?=}hr{WgI5|abEzx0DP
zK`p$D@`LOq{XXsIR1mM%XTpWPS0x-45v;4pWRyNzTTAJ-(2Z_rysOFha*g`^9cD&r
z=@o9K)63QFW&A_j+uHd4;pX?&PHW#<Lmklk>t<)2$BDa!7?lh+>g^w8LYhhEw@9yJ
z=a*_VW7ehkCU2A@>5CN0r_iN3MgS&pAHA#Fbv+Kp8jeju?`q~x<G=@qEzvW6xnzP|
zq5MF73&s6P!lo{Dm#mkZG>5egZ3r5$zHUrwFCOf2G3IqpztuoZU?wj)cCFK}ItPlK
z6px@`U9`%Qb?{vGP`z#fih-n>JOj(!rmE!4gk4LvaD3TSXv4t^VOO0L<h1KeES@1d
zI3`XUc(w%;PQ{HDjV44;m!dlT<Z($f?+575QNT-KqjvOt6)L43Jmxazs9+hrK+A|=
zw4P%W9OB{D6sA#kFyesB%^Kg#YX$eF?#fG9jgNG#dAr-;*w!EMZD;$m^%``QA35i^
zcqEng0*q$HVSZ2Gs+qU(I>XZi`=ZUTB70$eXS=P#UyhF6F4%I|<IE-V8r|M~yMO2p
zzvR&_GW(t!owXP2d^9~@Azpoc_s3_i+Gnr)&g9vGJq?o;ArbTYIy`Fcoa`T;E{X=6
z5qJR{*go7{cvU7e++@7KVB1G0r=7i{lg^#SoV;JrJInkYkkOr3s>NGo_mc%ie!6|I
z=vJfEQ<K95+Wm3=xbybtaR2n^<POLo9L<8ww-1hfJ~&zwCdzoNgz5W*Aihm~EDUg%
zX3uYOZ@YaOd<?w(gJ+8a2q_R3**l%>v(q;VHaiG!S8Se^`HjEb{>20^E+Nu>UCS$g
z)kO1`$rvX7a+%7`e9rzQ>JsI#{-xkuI;C^!$)gSoVkW5LU;a!U09K)G1xx?3<XRn>
zPhIQMAx0y59ZmEY-;tr+;+%hVdq{)f#=hNXu=H)+H#Gc5p<Ne7rNgTZJ0vP>KFsOX
z$wzk6ImX>jxw9cRU%2xs^f_|ul6bQJ3;Pccr}Qt_X2Jx~uk&~q;<lNL`@ZDie%(&%
zK@n#OGI`9f@3AqB4gZ|^mAES&D;JhJ7g)n?F-ztrFp`j(;TV_gp4x!jljwJxrG!Hd
zj5tSvUdbe*j^({eQ?!-%B$%(h8=-3<=(f;UGj2LXuCY-O*u-hMXd+X}e8SK=-}ASQ
z$%f>9nGh$v(bO-Sez?|CDEj-M&1WMmD@QNO>+<!&rJA_D84@lBCawr4<;e$Yox@po
zn}kcLvd`A+uTp|pbK^>zA)~fU>!q8LO%%MHzP}5s2DwoMb_z!liQlj*B0{VR)$!(_
zFjPy9?Vi0}ne}P{(}&TGZJn+K&K7pinxWV0#TrMTClU;7LGibR%Mo3Mr^Aqwg&B2_
z0QvkjpYxD~f&-1CR+f}28~$c-_+DzmIdhOI8j{`uWGmR+-#Nt{?ZJbrAN$k_evRJ`
zYsg(RDEjY~qq;PN@wbLB99Zr}*`s}qv6>*FMXV^$i*>rR`0el_GDY$$rz4cWx%FP8
zwGN{XlX@?1l*aDDzAL{DHcXd4g?(zw4eYe?au9dN2_3zO=Ygy*Ax<bh&D=ywUrRXK
z{L4QqTuvemeQD=T6C&_<Yr(?*ij^3LA7GjFGo8pgsus0!ZFZ??N*0rx@p#eOMkxDM
z<wwc<(Q&ZN@qM<B_h*!*@<<=8bD)YxBd*4>68Ax{oP=gBNx1S-OsX<t9y}wWYb~v4
zm_jkLCbn5LU1+sgfu)09lZkHcJnmHr+sDcIZ^1H)1DaM&Am1eaZsVT9UwWkuM~c<i
zEPkh(FWa~2qo#Wj9gP~x^=x)vWOT-efu}XT%?g;8goXpqO!_x_gt=f>(4Xv~3L-?L
z;XLfh!*2FarUaW7{*s5h316U`fIFr?O4b<oSh>csiL)m1@%EgPu?Sj!SSu@8*_lAY
zCx4I|SmX>wcvnW<@kw;C151Ru0b~~E4IfDiWZrpNT74x$X*@4Q>{)xwFjA?e$7JE0
z<}rk&U*%pa#da^nW*s6fJ~j;TkOc)9+KVRLE4E)Po||$OO9r5MePn4oU1ykd_Q7FL
z*^E!bXE^6l!!8KYFE~<di&w&Vq|@c@WC;!g#4cZzOAsKLnIwJ^G^|r-K@m1X!#@vA
z9t)dnO5E!-YM9Z~7E)13GUbegAim+ApF_Edi^zhdiS3I~np)@QEQ6hB?o?nITvJEL
zbT&n%u~d4KG<2*D*5&w#OVt~0ND$^6MQ1GJXC(H{A|xJb<Z2ExZt@4{s1a0ECL%YN
z`3Q70K2lf}(6tJA7DtTi=0w#RGm*;YyJlk1u`%Jz1?4k9s9R|^0qw)Y#!<5cjRAi^
z=emY*fzBCq+iVtP*4&Z44}%W~9v4k+qKI>H2Hyt9Cr8KIuj!5_**NP%HizP|sp`cH
zNqiw1`D*C3ZY`4KDv{TK6UrG?S-v`i4yE;7KSB7@G+Z1`uWYcU^T>pwfr(m{b=Ri1
zk|wOpfJwN*x5;rh(#}$3)F$-L>JNjrX9uVIYpuVwc2<Kk4mF-mpjE<VwhLHqaAqr{
zRLyq8aRx$qA8?q}vR7u2OnP1%IoYP<tAkOc)zNDs$RMQ}-yD{Nt`^3g0ZmO~!(k-E
z3I;gKQNDB5Fiiw?X5gsxD+0rgve`<eF1cgdrwg!675q`2o3dF<4YwrXt<3Z<=V{z<
z&VGs8YosLE77Jx1O)&Hz;q<tOf6JzWYT7K$$Ce6-CJ~=yj(eopn2cAlc_ragiD9{k
zmXKa2>c`jGprFqxeHe!X&O}Dh)>YDH^BB{Njp%4LaoH9S+-3QP%`wc@*=!ecYub{{
zieMiIRdG2D$F!1BRO*~)Tny-%XMkMgU64WA$%1Zy{1*GCj+J)IVNUY~KGPw`LlSup
z??}!VNwf^dh3@Keti=b=xGBpk%)HcEi@g~feIZvjX^Q&^+b?U)kX`FwdzLfJ*8A@L
zI?+Wr%2Li&-J?Uy0mTgeiAG6yiOihm{+0=}faZ+2%_Eu_I4=l5av?by_HSWaR>#)i
zU6YrrxtURYBI<4gi#B`Iv>XT443K{n8<%70tc;T4Fjr>>lf>9P9~`lVslvMb3$w8d
zUu4;(G@~3nb8xNEWzi1Xki{i}!%{GqrcCBT!$X)@wsO5R&9b4s3cQ<4b2LRd=lU|o
z<^HZO60<1h3<+lt+W>4^#cksAD3in?#5h}FAwe~<xrZ9fHn|Xb$N@#gA>2%W+k=0}
z5}?1-R4XC$fG5{W%6OF~2)7BQC$MvbO(ds|mQV`3J~9@sB|f8I^dv@eBb!A`GTt!k
zB%g-U0^bJf=Nz?N*hUTy&rMAbfX~{WH&z3Gkl~aF5K@0i{uyI74bBc61q`+|hnjSy
z0MZ~mc3gI@dI~z3#=JB5%bh>w49Z>Ev%1}6beoBde=AY})&AK)@|+vh=c<%EX-S?G
zw_@5a@l~e*EH{=NN|3*umTLG-gW|PNRPhg;YpZ`{HE{<EG81Fij0Nb}P0;ix7P@4@
z(o`_onAMC&Zm3^QYwv~Vtz?!AVPY1?-}^ac&%K9C5^1rNbTKNM0L=xiNtn?hb+SlU
zHB>#RmR0=YS&(=KP?zsUnL?&+Z6{Qt=;`Ge^A7=EeIu?edq*cb@_JTv97)x+>8)AA
zZJxSKIi-2jdllr}cu+fhlCk{4T^q}T;1~`$y>S9mI)pLDbTfHA-ggu}l?=FD4YLF#
zvpha&{Um>nj_pKg;Vp7p!~R&XW(KQYH5_W{PQw86;10#XzArT-r^!1F4S3{@?I4i_
zVjDkuSv1_5MGt$iQ*(f9T>9X6nqFz{8zX#j_E9y3pK{DTB)n6LTr&w{t7sV+@Q5m8
zp>0USg#DnHeU!{7-mNmcCf<=bRTE^~8MxU;-tNuYFjU`7_MK~WPSzsg4_r2gsc-V_
z%asOMCf~3ob~w%%1zGRPOH+jtg9kqpA3ejPOxA18#D!{iZEa%<m#reJa`rDI{$0JB
z@tIA#L^jC<5eHEARN1RB2VNKAp3z~DYUk#a@k9wOftgNI^VkSa!2%A^U~{~j!<JbM
zI*mo4>6Oq$;}Q}D$TEo|a37ovKDl(UL4I2cf4@0Iuhb5$me7^V<+}GJDnTH}t;=!Z
zxft>elAcI`oZAx`tNajN87Z4=sZ1(_GmIT9GNMs6FqYK>?cA_50M>u!$N;W>9EyFV
z2gr~9=>7V8X9ovn99ezEgO9v`S$!Apq7QTl^q7hBh_2-^)s_tBDH|x{CRH$Tex^-s
zSW{UK2KfURuqqts#{5-*%oN3Bqtz`nj?z&g;r+|8ZH*g}92?q>5kG=E6Ejr&_AG33
z2fZW8)i%tv9u$p}E@X0Rw;cw{=1dS2&K?I8`6JT+Lcr22uzi-NOU5qt$`D7<m{4G#
z(=o8{?|x+{Zjj?p+?qlhRF~nn$Icr`abm0;C|?Y|E{-d=pM<KJ*tx+v02~31GP-HW
z#F(v>iMdl3(I*QUlP=xL&8T<sJI_v0S1QL|GdaGDvET}nd+e)Xa4sXu#Gx4^zZ0+g
ze6~n6<5x-w`n*<2fpX60xs21KCd0Wji;cIb*a8kRAZH-QVuPzcs&ixlCy$2;laL!x
zAiZVTtmoCb3h0A7s=npRf+>s3wKED#5f0NP8;IpJJf8<Tv+0&UcFgh_S&f7RyVc*E
zoZ3Y=j$VWZg?K@tFM_~>{eO$XAdh|<W+gL1+Y0`xo~Lvl3uNwN37>A2D~{Tj!Qfv_
zgDfPf_q<q}Ee*==w~kPA$J|)+0V++j2{-tJbmA{gR-`Iga@Lu6=ny`2)s>yyTwv;H
zP2q-;-&3qb%)JRQ`DNK821LMKczP(Qq?;-f1;T}}so#EEa0`<r*`KKg2le{86&moL
zs2`4q0c*pcul^w03nt{DUV7mOQ8(fYQT@t>GM;r?rlqsAUe=0J(0qMfxe_bRdSJd%
zhJ$fAVM20n*Tm9hGYE|1i$MLNGBv=@bpHWig`Z7mcIS0Cj`;#n_Yt5W@;2N<Ont#8
zQAUKYCrZt_TDgdH&Ide`DB?XYIU!@#0&4^`i_=Zqjl8Q$Ni23hME6RNALdJc-3=}B
zEtIlM6$W_hGi%uQOsCdl?8F%)VRD^AQG~@t1r68hv2_H-@NSj8)I4BIN)2`nj@m>p
z_D)+Tot>k%Z?_M3mzb{kcQogQR$0$81apZ~b(QDE3fXnpEe`_rOCCr+<Lqwzw9Skc
zi#vPP+1V(9{75vGph{^2A2ydgn1(>A%cOA6RzAnrY6@=BmAPB04>BWo@E|CH?ci+N
z(ONj<JAZ}xn7alwyqm8h-=(S3$eRw?a)fmZoJ>G%X|ad#Y{Qyo(byUsVFohB#=B84
zk1CCn9Zuy)L$i0BX8Y5yBV)^FDlFE_j<GW9SEs4@vb%Ymc#5Sv^}!N8A4S2<K2yN<
zB4Q9YDR8Pb+@J>8J&=WVVQS?)R%s{JA51-0UP4BMpQ^1RE|YZ^lk8L@-jemEE37h2
z#u*h@QJF}#57aCrX#Mqg|D@FnUbl|6cXyjXH0fqCb(WqXd94bmSXC-U@|pdPq)67|
zkpq&5SEZ%z(;>6+umAv)=3HU~KUp7>1S}q^U$N(VDth+J-Oq|{+!^xjHG=ISc74Oc
zL*G<C+havPKAl=e0y}I4b%$I#jj)-2@I#s2!~L-Hi?JlC1<!(-`JN%7_PE{awb`)1
zihR7GSfS6_#`=1WQ*gwG*<vXDYL^LE1cLrm5$+CZ!e9;<2{d6zATNaKuuS-H|7@%V
zGt|K)+wIlC(aw*p-G&o5s#=WMv`1$%a718MN*Srb-;t_hX|w}%xWcWBt!W6maDO4j
z!UAL)o`yu#(e$+=@dVK`@!ME|me7rLco~h8sZq(pg?U(X5h<!AT<5Qk)^D-lxfXr4
z43fw2S#n4ohOYrv$9Z@p*eEUX1Re^#bGQ@~H0@5jBYS1CCV43Q&%?&W@D1t{xw#wb
zw{02~Gt_3}_Rwb`2+@95{wPd9VDf<h4}fi)Gt3|miz#Q5BR=0tnMBVp{@Xl{?w76L
zBz-fv0*NrjG6h4KStHJ*hK?^;3B<jtCWmV(dCm>^=E#}-jJf9fHg>+Jj!2qw{EI{!
z!^PtYyEQf9I963~APvH~G|6bVIO<$*yq^pdYYd<=4#xn8Z$6E}kcl^_&l00H{5j+#
zcal?F)TZumd>e|UNE@>mWHN~o*_lzzvIx;iS2K9z<~5TCE1RxAzr}g2*=;dT<wDBX
z`Kdsv1W2B!(wn>stDHbiuMab{fZ&GHco6r)ano%`#P9Z=VQtI0qL)z_5uF+d;oAaW
zE=p>1Ss?Gv*pRY3#rzL>7~|4$w*|`!iSINjtn*z5RakkJ8aZZ^B9Ospo=cZpKnZub
zJnTqqWT{N-tie?>4nWVIiuMrsY?#G7x(RRD0>=hwwFXrZ=fkt=DY^sZAaXxX`7AG0
zU`pQ}?VcU9a!}5oB~_fmT6qTj+im8$E(uJ=dB^1t@B0Ua3gpEcQSn|CiTTUSI6?q%
zmbCvfB$=MWab8;NoK>IPi2;WM?kh8^U>_~o?}|2=4WQib<ceOni4S1>3CrR%8ijgt
z*^C$&a_0MreZ7!rjc!&Y!!OEpN(Hs6i~9(TJtv{ryh2(2VV-pd$&0)Qtj?zY+1Qu6
zR^_F`77=>R8f}>aX{iJVO~n(X))GvIgUnk)bz=oyXvAEtF%T6hI+pFZ()r5U!=5>Z
zM9Ob-+p9#`InalRvD3@9qN8s*M!&cb_dR8z*en-91k79N;AOB;78YP8rKzltJ2)6n
z6{QQ<a(MLf$@Xz$UR;4{^Jz=qO5z0Mv27zCEWrC&k*J{*fCZ~T^BJ>?T)9GIl`49+
zgm$^C@g#gjGgrZ4Nfv@qQ^sE2n%>9h72yL*1+S8!MyPZ-k^+u!$9!|*_YbO0aWk@#
z!}^ZR39C}xp3jlE4H~P`{5yQI<8G`jo6WIt)Rb?0<e6`dZRHF+K&Kw&l&y0aLbi}X
zr3xSOkty&gxN}x2(z1Hxq;RWDi|6Ry95(>Afll>Wpjw15aMK)I!KwqYkt;AtnL~mV
zA}8WDAYrtn1z_au<O-5v&&I*Oq!&FX7VsJ<M)zDON5dZl`MCfAv*SS0REzVL7(Xi}
z09r__`NJ+I)U-!7jK@=?J!4(eAR3(OHsto`q`8PV-w5Xgcg3Z7F?oT+nuuJUh|;Li
zMO?adHv#)>X=R}TL_)b6fhYR5J)WLy?;svfp1$9oSE2K2hohy~TK=Xot8t=m{gFVb
zO;$xRtx~@lk7ZYR=R_1SB9l+oFspFf<S;-uP2B~AF`1R(uxBFjveB;zaW1wl)1lo@
zPN5-O(h6A|<KJPcnG29#5tz^{pI7>2RoaB|82)}<1-B*7=|v+$d-@EHKL{2}oac-+
zqU+FPA~`fQG9|1{p!Q8bH=>oS68rwr!4*%`7*v!f;Rxhq9CI*sQQRiZ24~x-eGOE*
zl;&s~Qim~qQlmr&SeT>s8NS#ghK{7Q!%iS5i|kj@zth~RF<^QYEV0gYiTyS;?=$D=
z<imM#75r`dx1lwa5fGG^?20g$n=+&T!#&Nqth;VaLP{FeJirf<VGunlsX9t)N&qtj
z=OlBfkMo!_e~Cn%#zi$JW=j^LIjtF+rm)90L$@4MgKmK#mIEj<w6AP(Y2F<Y<6Q2L
zP}4g{2R>eVk}J}Vs3f$C1Kz!4O!sdW$ga!$#eg{M)zwuS;%H&0R;|l**g@naLR0&j
z!!*^yQImSh{N{sH9PsHFy(V-XPA=+M+8GpWhNG-a_>tJ(CV#gaMs7Z~VRVBanpXTN
z@rzv7zj!F&L}~peNjI_9(Lh|~l<TMB(9Y*qlm(YUNN2X7yY=kCkpcqHBtQ_c&d63T
z9fTviNbAIz*02L=^fw6T-(a(V#-E9tsdG%2s08T@Jk1$HBQ{sClrB|cUAvdM{rqA5
z41_do2>;;S{sASH4-$i*u?S>c;&En;-sCGQirtfV+Mt4n3q2mhL&<sp_aC+qOVz!f
zZDrU(ZqR!Zrf-vLurPdPR$2Y$qEUz$J~6{Kjg5+$s^m<0`CmoB&g<6ckF8(Y)_ut&
zY&14Gmq-$*($|~pO3tx|)yvoM$8I{2U^)MzXCn;mevLI+7je|@iMg<9j}3Kg7?G5(
zE?|N3D3tvp!HdVnojjx!>A#mDWy!?t>7oZrJ|1sQqm@pe#|q)w%;$^jIyL;1jDb#;
z6k~>OjcGky`D$=9aYFsV5VjEQ*XbQb1-*z6A-TnFj#r~qWl;X@Z2!~=^Xo&Z;L_sq
z>|hnaWA&2hq~Y(RS8&8;%{=C5O;F7Blg?O)Tp@mn<0$hWb>*sr`0#ZycLPY-HOHF-
z04`78MiAIob(=X=E<~*l++k<ou0^<`^Tj45cFfZZxjrx+Meu#0=ed7BpIuMqx=1mC
zgD;^KsWn98=A4WBaFg|vnV@l4a+j+SF=fxn9U+%J#2J}crT{Ne*29{^;Sx(XPNtVv
z!j&<}%&E>$lRFc8HMwh2o%6mGdNRkDiCp2Kw|{i##Jb={Zj67iRoSpFlxYO+yO+~`
zIQGVyyJ%*yJyq`g>-sz9T$;7NPvcyOQbXpU?B-<DtI2ymVA+DEY7TvMf>XNIK{qDe
zkV}l%(ub9r+wJXR@S1cW(7{dD$iCr>;Elkf!hpe8^4yGJ080Eb7}@hMv%KUGKVez6
zq^^x_m6;c91%42t9N3)G`o7_h{^6dt!Y>pv=W#7i#9WZ5cx&T%5C<=eB?4b#ducx!
z!mBoI(3_3T@2E&VZdBF};hpkLct)JXe}1#Noc?DM`~}rrK|t?@+h&taJzC%8hM8RK
zO-@#?gmrAzro;Ec<i^@j1^@XC`eDYN$8#QC#zPK6gl8pLJ8~TxWaQc<j7#pZ7aWvP
zDvM)l<q3=eCS8&L@cxzobKw{dM3K)+@FH08>iKpm<&Y8dqw6(fA@FkW0=FX-xdB=Z
zBBm!N=1=)l)mxlT)eg>N6E8?bA~S?3#kuC^UBztzhIl`aWWH3aQ`&`1NWi0$9Bgxj
z$G*z{#IZ^H{=j<C@HR;X^M<Ce+UE`KvxaB-C=QS#bvr{W*G6!l?)f9U^BCz~)G78;
z9HpB3&K;))Dqm!zpFLL7mp@u!Y&upOJ!|RbxzH~(g-=F`dA++)V-WWHL>&o;)5$TS
zi1p1U-ka9J!4ZEWt`c>8^FCq4#rw|V`-aJoBa6eDUZmT8E^jl8@)g%;<AuQCIcbmK
zF@_0uRmkaHpn&+~Q#g4xP@HNBHwa>5eKXy#3rQv0Z>x+<%q$HPvAuKP7^~q%)n%zC
z-8Y|m&m^F&1QF)GxBLBLx}nl^9%Oaglp9&4`&=uRxQ}=)dU%jrvgb2Ao^6F@)?gtm
zHyy9U_BgG367x_Ztb@kvw{|<UD9@@_!k%FT+^(%09v!z%-U=)kx>xLwiTl|gPE!dr
zmN2|a^1pFV8t3HW%Z%iKvu9z|`G?OropSG=S5Awr*Z<sUN&d~UnW@2z)p<-!1Rrzi
z*X}lzoj2QuhpmJE0n@QL&hI)UO&qnz6oQ&JxH%2Gdcty^NTVW1J_q*}rD6n?3CL>*
zgvOC-_~;gHZE=l(owaClYrD1Li)W_JMuYE`X*BE!+vht6NUGRDh>mSPn^MOV(zSwg
zs~DJ}I&qk*cPh0$*lyFMtTC^cD9#-4S2}&nZux#u0B5d84j0begP1AY0{woyGxNSL
z@hmfyC9qwk{lu{iz*A9F!R5r+YXZ1Kn7}VXF?tzI@Z;6(zfB`1xtWcaXBoE0S<jyb
zW-!eM*#L5>5r-!45-}0M5Hs}Gl~{t?H0oaztc5OS@)Kn``Cd#{!f~%mC~rQM=_jhB
z`L?2ecagE5=;jdhIstUpv=Au;2-lsdRWP50m;lEnElcdD`}NvxaI^n1qcYy<Y)6)*
zYwz~Mcwn@dnZ*>#>!6hzN<viAm}oR@CS+@)#JM3^fSTU2hn;$x(MieIW5{nM>9c9c
zN;aBIt670Fh(8#gzFhbzX-;#al>4Ni*lz2<CcZO@*D~Ugfz1hFSS9MjMx#fa<RVj!
z)|FVcw3D>Xc^fzzVrOrA-(_ClU63oy!p953rYi|Pfc8hz34sq@Ua4ANu!NGst-8!A
zr{LvU%}m>Ht|p3-uiS(u6~!wg3%vp_Yqq0is#l@ttYm2h7J|WWM(8BN4qYz^9>u$+
zH-A2^jD*|^7i&%Ng1=9rsU!ep6;nE8F%|^6lA+XvK{(L3c#65k6xZN&ii{@!jwd75
z6R(*W?PmJ`QwnzX+dJDQyG<}|d`;jH){RG-w+z;}kLK-!BTn<u=8{`Dc8aJ!JmK>~
z#`$8um@~qdahS|2s>E}_(r)sK^6QR|78@=R^JeC6C{CS`t3K~K6&RUqGFbRB<>F*p
z_nk8g*=(>gSMtRgTu+P26jFq?M@Mhn^&^Cg`x-Dn0^ovJ!HSjJY8oPIB8vB?p@|LY
zdn{z4v_X7%g=~#PgW>#Hh93SwNf#rtl635ry>4HH73=3vL0LQxHr1!mTh}}a!hg;^
zo+iw<6?SUg+R7dWVsu5NCLw%P%BZ%n6;fiAHmvo~0Z0UlQ`&R}r*%gavdgTkW`6hL
z5~o>OV-8C?PH4P?)TGbGU=V*YPT!j`T5}Nz4Ie6}YqR=#H)?Ep6%0;pM=;fsXz<$k
zE>n$Hx4YCntC?LRo_yW=NGH?&5w!T|q;vYqv2_x-ms>p<(N&UKQtr8K6=ankKjx8S
zL=&%ML`%lDRUF&N?yJT^Tlf4jrA_GXUNCB(b}f8M)cfdgFK9{n6&t1B53)WlwYC$W
z7&;Q2Y9ZnFjJw&wC<jg~8nSlnGD&(S4pErJx)uqK=FnDU?;swoNXeB+vLfv#qiRlP
z7D70|!aLM%N80U75}Eb_MTwK@AZCD5vVde2tzgck8L`ECF>gS5gseiWVWI-i)JLw*
zSv9li**t(P`gw4x!K;j^om<_xAJ1N_%(|0d!CiI6$tPTc^UJX)495v~x-b9{k(<LD
z-+(`zo@+id*Pla_pEdyh@$`JHJw3Of&;*85U>I2~Kh-*EwU0O1rF%6%CMJIH(6@hL
z9?_R0l=-%Cu2#LFBN!O=#HI(WJjdgZ!&${JUpnT`qXo)Nhj%GGx>Mo1wOz%|EkJT>
zJ0bRqv9W>J^O@|5`f-DRj6|@nTESXQ{8pp4XNT_lV;B{$i3PzLmbP_j5?~`~flbq>
zc=LJML?2BpYVxg;L!Z>B1FK?(e|IxzA8h~BQtxTHWzdDyV5%gCz$RJYy(&3pSJ>5-
z9k#@*L4A<)rYFkd;C!6CkF0HjrYxX0pF|u?AboZvg`0V+Lnq;3Yv;7JTSa~Odq;F{
zJmS2Js!Th#DD9B3_L7_7!sO#X!|Ck4`ax~$*x!<^AaXXkR~jYJAsUW0tkV0<3D{Gv
z)2rM9&djvR;?v4xAqXjfzy?3~q*AZ9jxOC=AeD-6OqLU=pR-I(oqK3@Yf*mLGzamm
z<a}^Vsu=x7@hIxY)}jFhDQbwK=08nq+~|sg<W@TBPjNtAL^metUAD!>(FHC(PHfC7
zc@U^l(nsb6o899)nM{(w%2n9EFmii$<S;EX%@{va_{>MaYnlTcFvlmsU!JaSZkA$&
zBlVdrqJ`S7^q!nAcoosoEL0LZ5$xSUh1of2p^~#M_4%?l;iS9Rw5G$w%ep5^foJjV
z8|l?_0zy&Mtb{kAW7>Z+NpL)j>-C(4&4!xx{JQ>*C2~u{rJ_>69{}&pe^&SJmkPJ2
zD$)YlAcI+$x*Th8gwR;ziQTH%;J#I|>cfl@ZxnVjWzeY!<|NrAAVf4mUG`$uZqBC?
zcgoE#Bc#DJ#Qlr-%dp^l{L#J~j3)CKG(Kxtg;K9HWcc{8c*Brqu946JHcUZH!<#~f
zzNB&%ShHIxvxQS_vE@*YGc_rOLtH3CPx2W#rn)RFaw({Q5+@sUYrRzy$6lZ((n@J<
zZv2}Jh}p$I)2cZxbmsnUxZ~|J7&k)t>ll74UQ=v2<a8}vx<+9u(BRKU$!Jy20^c*7
zfo63q8r4Vos#p$vlv@?}XL|g@%-D4W0qbnx>K$nB9D2SmWuD2!=Ku_$x_C@mdgH*Z
zXaLLQjSp)<YbK$7n_g6K-(dD8xwyz&>VyqsMCj0q)OBqJ^x-gb5DhOUS9QyphP~Sk
zwq4FQT+Ej>0o5ys1a&lI#j9^1U6N3}A{8jhiSC*Ql=W0LNe?$6Ibl5SqA4`V<EC-p
z!|kLWS(jGVRYL}`EKC+>4Bm@}y<C#vI$i7H%b`R$qSMB-Z`#cyhuV&$9!@5E$f)Ug
z&}cuooH^3JE8pS=glOs`>1<1Cd4I@;>USEXXhvPb9uXwF9YGt)OExR@u`Whi`G%Qk
zlFh2IFEj$F_BjC@&c+ld1d+iu@{K~vG!zOw9mXGmUc#rL6e7splfZ^lri1q#^CD&2
zvEQSylW&PbwjP*{+R_h<l1o~!E*DOMq>6w9@#vzrDj};S3IX?1ci&$0vaCcEtxWpq
ztY+l3+m6F3r^!VR1ZQO<R|_wS#d8)MPB^ymp><~stXndyk_E|b#(3((n71CkJV-9<
z9E9R@f2Y+XHeirk8^tp(zqST>@v3|FOON$p7o56E%xJpouVmbx!nmKB1LqHuUt3*}
zh!ZhbTrWgTH*s&<Z_ZA4kA6OMV&8I>=NzYDF1Ml0C6IYesOH7FJ7zBJ5K>Gg;LVs{
zv3^KUqUJ7nreP%3F`KXMsK(&I3=a+@5flliV|hsTdMh>ocZIv$3X4+FY$I>9z?)K{
z{|yoJaS{)szJztm!m_uC&(VmrL(MQ193J86tm{AViUw`9-45E#hwI(SV%+?fS%XfS
zIjfI$Q99Dy^UPKqK%=^*s#h~JtsEv*<-7(xZ2fur<Z%D+b+dMsvRM}==!B`NuEpxA
zMOAmtPDjXI%Fg0|9w_J8aqHx#{WdXE?O)obt+%^w_8oN}B-{q;*1n}a2EBT%eR^~Z
zQQg+Y-`If7;OLLy?IvN~A?)Zy=hMqe@u+*x{zhVvXP2bkJ4dBGe%;o$^?Z{OqnmeS
zm(abJX->q>B<#Mw9CN;CEfsS>xJzP&Qmgd;IkN~50~6xzBgdyka=jY$9Si5ZK8cGp
zP5DTj-VVE0<79}~pjx9BvsTwEWT{CT8qIj;H~R;>nZm4!NZDmS&1Ns7(~iSousZIY
zuQJ>i5|jHb&3aFdse>KVsrzOrR<6WG3vNNeP`HNmZ~01+K^sc*-DDVv3DP)Y(LnvA
z^QDxx=x{m`4_7O|mB30Y%I!rqxv+!=-~jnvxIGhFO=uB27Sb%4R7a;ouaNvxFPcuE
z^ow5IWVCY|o7fYc^DNUHkC>BN&cf|rk{8HWD&k%Y>WIFj?uCS8zF}H_9!b9%6k)8%
zm|*n#_i5aH-@o<d1aKU+{lM-xBzj)_V`;!s_7`UEqtpmV8;kLRc_WF#V96$;RlF0D
zns88ez*FrTlt2bhiKM6O^^E9FTm{5I5VkPS+%)Ipl+AexSkl4?>)fp#ruMnxoy<<$
zHeW8pzWL>}W<VU1bBesidQ67H+ncZ$`fnbXIaH=^nIVz|lf(i;G)A$;gIvO%Nz89E
zja#I>VV1;e3|q^b-Y|3Or+#K(Movi&?As$%LVHV~{qy!df?2AYQ_<A26kCGY&#I<3
z5@TwrsR9}7gVnsXG;fE3uci6;_L`+#7FsJ(R!J)7q!*~fTYNw_v!uiYI{Sx<fSRg|
z6=h<LAXb2C_$Q1EPM3Nk3)?G@D7qu(*jP9PvxBbIPcmF6FtXfhE|c;`&V-k#Sw~uP
z7M)mqEIBR#Wd=lfa<E4nFefWOI|WOO)e=*T!pGWX6s#}`?lH7&Ig9x)x(Vnk6Oyfg
zb^t_^L)OgEvPraw;1@lB*Qjx(yf188gIPxYGUp=E4(&DKf`eaU2<b2!rB{5=dBdpX
z!2M|q8$L6bw(Zli_SVc{{mt`7fL)xv5Lg|nQ$QHBe>vO{mRn>cK1R|B1>RtPc##C-
zG;RjV^zUdgcH{>98#0dGxykZps?;CQ+dTS7i&iq!JMUmMAx>yYTM}wI=U}9>I7*UH
zy1J?Y4<YsU`8YpEUV9kvg-8&s5^j+3csPynq*6mQ01}xJ&Yq$-VL30V2YFd|$t>E_
zn1c;V{zgM|krPW3rfGnjtnmUBSN0EqP#|Mw2^mW^kT;K3Ih_zu3HmXvdYa)(^#T{k
zxX_w%w3_{jE)#j$U%tIXel;22s;O0K!Xod!nn}h#591fX`b9_fw}L}X`SFscHG8oJ
z@3P0Ki73p<5(__hiqdVKZwqhhC#~K6wuVlT$gSq)&|Eh{GSic=exfEoDrL|#f}hO|
z%?^(m-?+%o^}+}-{C|&}n=dtkR_-PlF@4XFh?sWsoaig;x#$An2=u^%O@E2yd(%dT
z;)s@`2rSjDkqV@m{b67+nXhCSugq<?8QG7x-B;4Ad%fJT8I{U}fg=cJh6r22tT`*$
zA;wW(DmDnt`YRXpnS-=^$9$tH6mK+Q8eA1VAmHoyZG``Dk8kFd#TQisKLj-+6XAR#
zOhnA86b0Z5NK=hj>Y~zAWDADUCN<f`!y(5fF13F<k2ESs#%HOKZA8~@h*pJ4TeTa`
zC;Dv|1u+DWj>Hnk*h9M6%VG0>&)VQ+$iabxVbPPulc~n`KlMTrnJ9C#X~gvBo@bAM
z0kcXpGe}^*-3Hv(f+j}Lp5HFqj;B#-k~@|e@;<}5N#c99L2jD!$%UsxIm%Zj7;)_q
z`^EH`+!a_nUs{>qJfkvJA*(E*gXY*UL&)Mr5wg(*laXj_QyBM)*)MErON^7sII(;g
z80KmtxPnYmzC&SVMO`~DLCM5D71teZk-4Idjc|S_1^<Q8p?DE>{ksCtpSfmU1^*@q
zZ9H{<9w)+~YwwP3k3&SijwbGC^TnHG4|9B2S&_;~&gqpI_+~lygt;$0i5GyGul+0A
zWJVhZ9*~U=ZM@BW!s}%GJ{8w0n`ukpQspz&#GLDvN*e1`F-*0Y<1>5FVqh)p-A2yj
zh`dl9f!e_-x!fbxn4!Fct!f5uFG}4%J2Fc_=(4zVZE?hzzIlL%YgfJTubc0jE={>t
z^m0dzaLjB(6RR~J<?z!n(%Hy`3@UG?W@SkD6#Na`TH-9LmOWKk@x=y_%^B19tO3}7
zmr?gBsYJF}&6oyogjY78YHE~0IETq~#zS336E@kn=!LhM142X^xa<==9!#!{oW6&F
zKq@a1UBk+$u8bY2IA*LIGzRUx4yZL(Z)_&U@v{%2Ax&;G_X=}9ATZ-UdOf*bom_WP
z8**)Cv8j|3V(}*GkD$viN4h5N<=R=KLE=7?jm=`NGllj`?$Jv(AZb;|M$MtzRBHk+
zEG#3N8-e7aY=gC#O6Mb`X1m!q=KbLk&2=+rVVyM&zzF6gUOH>#_zd+tOS7<rn(osJ
zWz2|{huH#9@S+js0*{&I4yQ0knGx;tXEna=;kNM1i;>1bxFnNo(_}Vb@4aS#Q>ht<
z#R~3<ljt%TBkyZTj8F#)gQrzAtj*zAQKXE*nxYOW22M1tock??T4I*LU|z;c@J(B`
z(cOs19s!q!=t%%gGv98NBWe?<XoK`LgBqXHwNGoqM9!jSaP0xL_{5epkQ6nfezl+2
z4(H^fRzf5M{KPio$fHI^)AMwC{)w#|9>E*p_>=>Mhz01ULYX!ngJw+cJ{dCYqZ7`M
z)6rqoQo6Tyi1c+nYjA3xPoq;+{HG2N5xS@q_DuNHHk=HNXzG1D>S(6J&uLLpVVV{-
zjp3&vX!}P2SD3#4bZ8-oX;X5PelmJ;d@IJz4vgSGu^lhI7q#Zuh~}l?CGk}Ty+Vks
z;(1paNEMh6=H+_cSUuNt^Nr}ep_lDwqEuaJYBQ_vlH^L_ZGyinLg;beELap1n?$3s
zAt=~)?0F@?&jqeFXY`9KEY-{41tL$r%uLv{r7G627k4N76NtuPyx7wqpLoh)z35T&
z+`B5cX7oW>nAQywruB+AE<a4GYgvi6zrLg6?H~7Q^<m<K)@smgriS9`Jk&$dcw~X+
zsH!j@@c0(iJk@rN&JIs=6<NN6G!P{oIo6m#+R}?G8qo09!3zj1P4du}B~5euEVhyl
zMPKZ*Q>ejtMSp#vk5<4fyhO12cQdDGGm91H3FbM&_9Bvj%LRe~x;`^ixZ9L4VJ-&*
z6lll4XZ8s?3Rh{@i-RpL_&TykR4AVn7i+hA9hw2Ib{Kt_)O&G*)jtxgq?{@^E*9F|
zPhp?hDQXZ6_MSvYFc{fU_2MEpW?^qoi-#A9kG{DmxMfgN2(N6qgq5S^(v&y7c)1c8
zcd-fYAuY{MkUr+YYr4!r;TDyui_VxSV$H<8vKze&Q(R&;4^tNGzowz={Q<n(3LbjO
zjfy))W%%RGLWE%I2glHfgb2|{AzOj&dpg+KX9uU9ec~vddrSXYE^%J|D&xXOgs9zS
zZC{f$nEMK=^q?3lS5-M{=WN?Tp#LlYfPX@<>*w4t%?sjohoRL=0vDG>Ev5}o5rec|
zcZwi>u@k)5mR}IaWuh_*a5uZd+!^LpT2W??h`q(HEbiL3n@u~1<^w^fN(QGe=sOIx
zH27Hw8ImC&(;fR?<ano?&9+}yEw(E}PFfZPfBo&<x1Ol)kNgHhLNwWAbpw=&>%C?E
zEDzAW9Ztdz3adQZlMIQ>z%0v&NppTH3L+SY23OMoVyV*Ylq1(j3KgTXhY<v4aJUFI
z*4OFEw@I8ieWT0PqaT~ac<anYar39i8#G)O28Kwl^^<@_nfzm2LwX!HKj=B!(-0xi
z*Eb*KvoG+_U7H}2Or}};rr)2wsx^m2Qi{gvXl<FBblc<*!P0+YxW<Lt2&_))tD6@;
z)|$N;tsfjLFWkxU?4I5(-qS+ec|)u0_4OTly>r)d`ak`Y{y%LHb4GGp7>S352N4W@
zp{dWJs)^Aq*yP2~)9g@_ODIKCX$XVB-y@i@F+;2pR`y<qB?FPoxOKtW4>w5;?>5?L
z;RUjDTqGS%NW@o%+FzdiZTPow?fLAo9YoTYXq66qYR_fLZ>K3+{-#K@&}a8G4jg+9
zBMsG$o9sZLokuUYhR$2V8H$aAH69%%+JAul4e8-wn7n3Lk!}Vj$Tlxv90XUh0g`JO
zU3R+4d9-ykQq8x9P=LW?FakEk)_rM+YlziXi?Y|fbP;84Q^zpWGJ;I!ZED@z_>wFS
zm#Gtji1;1|>+#%DwLvr(osZumLljplfWN7(X@wV!6-UF8k5{M)P#FY_0Jlu{#^Vjr
z(QgA|qCvyxj&AEzl4ij}(HHdOSNes;U;5knl4n{$m28G9u30gIN}Q^+d7L$8Bb`?p
z$1KZNmJ3Lw@Vs5D2>w(<5A`DA)aic6iHJ%{B2;zMzu?>=nc@978o_8s+%X1%pV(`h
z9eo*Cquxc`WIUd77%FSVAp4P!?=l+lrL+ozA}`}-%J*#A2F0u*ob7QEpr1jM`I*8I
z3r|+uY=&&AgQtpgS!!!m&Gh@)EnI!pn~3M^KX6i;@^53^Wu@-y?&DN>?pma4R#JnW
z_5q~U95}kBswi(9&P7L`HfvO(#um5Qtv}GR8m0%gmN%QSN?8G~UN-BpO8VBT!EUIw
zu|{r&8<`SO%;8)`w_Eh%M{lO|^M2U~WX1g(x0@%8n(RzDC5|WZ(;|8=oK8|Mf`76y
zf}8_CxUwLuwOGtu?kYSV#c_?+USHIF?XPDl<N2i7iso^?rhPx59UKxb8P&>%lnuEo
z;_^b4m}kfB)9sT}LS|bGT~9~6)0~l&&TAnf&s@`~m~@skog0JX>2V5{UV8jW!^AD0
zhnnCWZZ#P#>V}g#el;bjVIv3X4B1KylFt~!G~Zjwp?^#$*qiV+%_yw!IXJ$%SMaJV
z7~*md^#>&h1UzhCFP)sdd|-F<3H#wn??|We_B*CX(|mE|^e$j71_~Q*M76)@HfMnO
zuf)GVxuR#^q?JW3W1{9);l{i&oYnQ&H*sa5^C_He;@+%=fSu*<la!tZ{Qr`-;kbL%
zIj1wUd;mr|ivZW1a1@t!A>h9b$JIqHyWI?C@hbnnq?nqZ^JMpDywA2o1yH8LN`Ote
zqYk)(@)-*PNrGnBRFscHj&dZ>qaw+$m(DBJqs>xY=IZzIfn@fgovI>)+#Sa5XWvXq
zUQ1vI(DHIXNDu6uP+lNTI^tZIcEps_48z|oY!u%4sdducKRWbZF>=0+C+#=e8})|&
zj!v;j(yyB$yVwR)2AoH8W4!?pTS;TDuo?Dy%8%um#4hlkfU2w#K^D^q{xue9x&9h(
z1m9dOW9nx%hyON=h|+A2;zJO$Mj0%&PmkX2?{v10_nY_r5?>HU5Og}P56^Zw9j~-`
z*wim?_YaRwvY*G>r#o*BT0gZ8=-Iu$6ilwxoA@8S81@kB!TG>3|H-4yqyhQVDDD+t
zZ}(5>#A*A)<!_j+{=xh8%n8!K8>?A96vOqV*b^0HWW!XvtjpWA`okyd>&uWCln(Lg
z_tM9T?fJL%q$sPC?VxPV&a-Dhtu~`C_IUWA<XL6C!iFojBxop^&tyL}vR;n=l<V*y
zBw~+vc^~LV_Y?`O52KLI;cFAmMqHqz`~xXpa1L9HAF*}ZGAel~J)Ly~<wR|$nJT2r
zvv2xk#L+OjS=`pDk~A~hRC!ArVrm?9@duHG;~}v^9q|o$_Ra5$RT2hjcCB-XAe2q5
zS9ZST;*FP=(wCeAR>D|y^r+}76mt8d5cJ4|GhZpb634CF_9P725uop6FqbGq<r_Hz
ze2&Vy7+P902dC09c`)UOPEp+5Knx*I_opEA;MXW@*|#ET_`Dq};)<Mw0d93y^yb$m
zkKW}jd!s0P->G=VW&$0#rBs!f@|A}>?I70V0>w1h$s$F^X=O2+<D{g3QYe*)b*6G7
za(`+Et|PNn@+M8CGBHf{jAuc`ogq2$9?r}{2V6hyB9{vPJmz1gMm*$nn`uchC}w@)
z#}7e0!!5x0(mE{DujawocIWjDn|d_Y8!YaogTuKVx!PgEu_LN@g~&9^gDXj&B#398
z?}n4G?%w?nh>@_wX3<H5>8QtP1SN|&WL1blkH6=)I`SRy|4fryUJ(he3eW7!2~;AK
z(ElR@9ASSVPBq>~eu(~Ua2|8S6)NwgHDsqf42)|yNo8<?!XXRc<x`V8MaFC^xed`)
zyAc1@fyk86lNa5`=C%kgi)ku6G<#{W1wuOBT~fJGMqBcQa#-ptf~RW(#y8!94nBDW
z?e1<?jjEzzVe2>Z`=Y9589``fzZa?I5{TyDYUQP*FY8`K=_1t)(J*s{D{@DHh54te
z=5|OWs~YslOEWuZEZqJa21fQ~*_APyaRn3L!i1FoW<Z(0zvY*=9OxEki~+n@gFv+f
zS`<88yh-|JOgHY;&5LionNvJbvbMk|SkN~eEl^UUi7Z}n&VU&?VUpF+Z&B5FosxRf
zo>OcbArH;4YOMKf&FECh-j<YHbjfJ{f?X_QFAL;iu@;p?EYhl_Ce<yAi43v<F_q~#
z%~vq`7E-0%JH(^9)2xuN3Kb$VyO0;-@Unww4GH7X{IX2X=HmzG;9{+!sA;rp+IVla
z+w3;IlCzp52=QbF#z$v%yT#)38XqPT$<9Kn4i^CC)+&I8^2VZ@+op>_Ke?Py+Hn4I
z&sm_L#3h?ikR48EUH!O_S+WY8V#?8>>ja~e<S;D1{q@7&Z=qH1XhedJ1kkRUiYeYJ
zl=BZZmv`~s@M&8rDw%bP`!!0LfkoIazfi_J`L{}9NbDI@d}Yy^>1FY~9x@rBFBZ`=
zqw+;b&y_$bIa%&rQ^Et>wVFA3W?h&Y`BTL&Tx3IinAmfp8UZX1>W{*?t@|8ibxR&w
z>XphH`=T{1T`93B!?+yN>AiDrl|{_(N&md}LKSC~D(tDk>#8>JD*7-PhcjMP)s^Mu
z8R%1XDHj8e%yHqQ-44t)gEMKjKkeBhuJb<L@gN}_5!&N7SUo`-DX}x+sNY+xy}AjS
z!C{Y*Vbox|qYzPMIXDqtbJ6^Q<4eXI73n4%vw`%826`U%<H>D7Q|g1P45*;Ra)Wq{
zEXk7{IqBZ2@S|jj5X)T8wc=a<IIDgyr&tLB*~80!_wR4F4-SrYItTl&%JnN{2Ubq(
zs3#B2^H`3mBRPRe1&2;)807Z+vbLz}uV5kR$w>xR1u@=n7W?HhWqD2%nViqXC)_yI
z^cKM?`TX!z=w37vIuyn7rDH<Q<`w>KD>JGgrTV(7s4v=0pq5F}%Mnl5o}aOLR;P7i
z_Bp#9Wf5pAt_2JAm>;lnVgIK_B)Pj_z(KPzMoe5#D@6JxDROedV$3SlL#|jSyo{=p
zBwExiQ5AzeV~OUBBDYi(r4dH2dle2ZBcf8s-Yp?mP`T=|hAJ9uCmveVEr%S++6Gyk
z|LmLJW)}3~_*B>+<jS%s09zDPHf?~icn$7g&VmCs)uyX_`Y0g5Ll=ORTR6q7dOEXR
z9-t{dXF@1%KyZgD3S>K|8EaA+`)E$lInY(w$XjGC@Z7@XjTd#_h8F7HufFlP8@q&Q
zs48lt{y*e-c%tgzh<5PXw3MtnbsI#7iNLNyLD4KH?(@e|LObqKspMW}LJ7jMr2LvQ
zBeZ#OA)uwrR)ba#o#%?p4)ukYpFae(<UPl~i^k)U<@S2P7SBil2l%L{kmX9s=5)Up
zuKkAsx4N=HV?pzEw)tHt?U`@4<#!%l4klhR(XK2&+1=IzA(pFJE)b+SaCPf^0nl>v
z>xDsE=)4TN`Dkr<`nDiK&5!wZ^rN36PCnJ))8=*Qq6HK5nP@R5ZhLjpN=a?&Ma_+!
zxV2}_Sr9M8lHubWOhT<oc@A6loLK&a3L5d7u5Ia|k+sTKtd98Zl%GbntU;DsoiZ-3
zFc`b;nJq|pg&rLcw-B&u;j$A9A6F{ltcwfLg)7;K84#BwMPHaMaOoaGHhRqc^rBHL
zM{iD~HHpc_f}xUf1U<c}{%dlc9$lOgZr5M!AAv}8_7IM`q>|IS2UO4Hv<$zMDahlt
z-U^EsLVVO6C7OgybHw`vl8cKD3=80~#t6Yqo0%6x^*H1d)*V?AO~2xrXKLebq?&{5
zYFFBJ?nY-m#X(m$60GE3y8ZiY+beE<!Z`ViH1Uhi*l+w(r|h<JmpS9Jw#>3ph-4-E
z22ubA_4AO(X#`778)1#(u9<WryfHO<%_V18fnX2g|0XZ(GKj>0dKrBG{p$DMHw@VL
zS8-Gl=ii_93xxS7#aVA1eGFFgr*g$(+5m`8=T7F5<qpEuF9}7!?IS}qje!HB1{cU*
zwGoKPcp%o@Xyzu;z=BzV;)+i+Os1Dta&+b3Sn4{Gjlm3cIR~P~S{|cag!p!&F%y1w
zI75rzEWgrug`M3x>o6+A^hL_MQ@um^8IlmMI6*%1574=m9CVh^%x}#MR3){_3>2$r
z-KRC+!t>Kwa3Nf5p?ER$0YU)u-p<IOfmm9fYZlF#E?*>@nej2#DG(J4?d+E7zSDTo
z_GOtxAQvA-6JsdMz{#E(OJJWO7vzu&4k-7ou~>`wY0RAC+%~J{>O5Vj6&E%YAp6s7
zxESRsEovOYayIjhuOTKYmsOe?5=+RHotBsPEGs+7C<RFpDcP(JasZ!S*ahoiW0B_H
zpO4ZiQE_hU(!;C@k_H>r+@7g^>0tP_iuhzR3yg@Y#x%v`{X)g)j$2hO`Y?*&p#=%l
zyfPg4ai$dAlw=0I8;&}fVNNVrX1Cwz-ga>x9!)y~Bz>~yPDLfCo#zbPq!I62#nmQR
zw$LCZjIAstkw#gDKO{bdip?lBLT=A-r9%c%@T97gn9fCd6ssK8Aif-Ps&BOqlT;WL
zqhs}GN5GwS*nhx6uw3x&={ILV(Jwh0lzv(2{thjp^z7EHTZBMw7JlT4(wQ(=wCrdc
zUBn-%M=>3mASoRVu`Tvl^GMc0MSIi1h%oFHoJmK+oP;xpO6fT|yKw%5tR$Ys;fp4^
zU<YoM>Taq9XT#~hA*6H4Y1}=p&}B5)cWL<BXflqwb>uH<ciy&6Pxf~@8m+V7@mazP
zl$Y?%d0(V?K`S?DEHaA27DC${pPe?=;6CwL?Hrw*Ry5?v!QHc}x|ltt<`l^ess#%o
zb9rS+JzlV-=N58Kt7W>i&o5toX3eXor<U=y?yW(KG^3K7TC->19a{?&6M8t?@+)_I
zH5Mvuj<Fef6F$R=7rY`r&ZpSyUdzw2q7xn`n))%i{W+dowRja~IpK*Mzi^N(TDA<h
z)uqj0c9-&HJ(S)|%@IV`ic`Rp!!zf#E{jy$$3gc=HIMb!n+5Btqi-IDELgbu_$#5r
z<+sbKa)mo%<sj$`o872iw&K2-UH(rp>+R1J0XTNxpKqJB@J-Sgf7t~n$pSP~n4Q9_
z_9{syHdyKpa75ssJ<!rI=US1uGpn2zU^)T|=6u<RP|`~j1*^rva2CkdC<su!L6qj-
zE$P~;B*u;Ot|%t197&-8Em3HtXxXOJ^^*qd)%}cd7uu;D{wGUorR@&TqSQRbEhNEI
zszkY32>BLg+1q$!p{b^QuXor^c$v&?pV^>!_BULi9J;eKwS^^}QMg&yR+ZX5DN>A>
zfsf4}i%xCAYUCk6B8k%$aoC54t)0`>Zkgc$k9s=dy^kE9B~oW^3?)s}+4RT^BOj{H
zpdMC=%0-Cmh*)?H>TzYGvbW0FoStkSw)a{mB{fS|tGb*mk{29Tk)F9@D%<2U^{Zta
z5GOE9p^1lPtgJ<RDs+W@0{}&)DJ*NeLQnWdagYns1AM%lmQ&1BY=%O$vEvxFc&&bP
zF<S^(T5FD$rr1k0)hP!^iG@OOIX<x}05!jAHHu|=-eS8Y_6PWsD`U9JS){;kp9w-z
zOnW>>jaa%J?^hAL;_mr0Oy)BQ^ige!=j-b5aR-`JuAst>71=EKW$g$BEr9FOCaWhG
zl}Qj}exWlFD*oz%${%--ICo0J?Nx6P!^C?-m~%A9FiK|Pl=8Z-Fpyb{@y=oe8Ar|q
zL*Hn8n_M)F{fl4_4_D;n$|PBlgu+fDUU|S?MK*fB6wf+bHqj~i9Pt9acE}mLbeSZ*
zr9zMj7kUGPqvO_yJj<miZ`xN;92nXU3syvT;TN;UFi;E7Imp2SaVm67qN1`zrRi2L
zMPcX@fo$9>9?)pz5aB$R`@`ZJq*0+SIgSBuPNJK5*z<dCKIq4}-O8z7>h(V2=5kla
z{DNYIQQ~8=6iHt3Eju{LfYKi}iYK{-a}}P&iBMfA6OVpn8R#+5(38$V>+oGuJBkrp
zn!l~QlwF5>mnD1*4GkP>@r@iq;iVHp*sI7HP^7CWeutxv(jGjHqOpykql01rYCJOW
zw5gHi0}O;?_O5IcPZ&G#1Tkl)QE|lhWRs6ai?B%PO+4vdnLz<v8SJGC8PZL$eX#vg
zOHZtyxA#vwuU@zH$;s)nyVYqO?iOqCpmgPHH(_j?MQY{qJtvy}z63k+{kEyI&a1P7
zALsOlT=pGgzx~Yqjt&p@4_k9OqoXJu-f?CnTrS9@;qN7`bv2G~;oM?#)ZfC`%P~+k
zL}p9|J}hgl6L#OLCE4e)Fx=`ly=U=g>zlNRow4;zugT-Zg9?6Eu0~tnqMJ0-t#3-z
zMdqUfw5gk>>CuZmd#ORC$2VB+c}6o10B8_MR(e@N*|f)RzpdhbT+h9Q&Uj_@km466
zh{9S{Meg9D%wtr<j`fOc&Mh-rTu>8!bCHs+|E`S?Gq>Oj3v|CAr&Qt_)?LPNMHtYJ
zhE+<(%V@HvP=}>VR35U`W$Y?~kqWS9NIt721LmmC03G*c6?Erk^0dt@SaQ!RD+RQl
zTS#GAjQe?f_PH@XN7GN2XxmCA=p2Vk3y^uCGoCgBy4g>?SfNs&esb2{evQ-RV6PcG
z(Bh35CD{Yyq;*K8yMEF6`yFvXkI#Ipm5@QOib>g!p||?Y`jb3rXN3@2Zhk3hs>6;e
zW5)gk+N>&`4W6&{4TaF^m^#5Zp$Wj7GhV|2W=1p9+09I6HPf9jl)}4N4U`R{@J=(B
zYrJH|htoGm!CZlUgV|UobqSLOcg3XQa>Hg??JlZTykym@Yvq)O43WVMa2MYB;4U^&
z2J*r?19A=^Et)hJbcW(Mu}n3u#%BgIHTgIGX$m$(*pp5ws$51xE#PE#!Mh^mHOUMS
zT7<ygoi+P%%ByBHMeE`(I%lSTPFIz*+fOIygp%+R;ku8DS##x0mJ*dyEiIT9^)6Xa
z<*qv!jF4L>mp1~k^3q8)a+y<$jvM#8bj8Htab{oo0R|CU*L{{*^WbTb;V-{N+(By6
z9q>|hzDb{P7s8lhS7zVXv=?u;Aj>Wh$u<39N=<h<TNMl%J|#)AR$fZ5e1a?-<Melf
z=%}tjgY&R*)BJ4^cgKm!PD?ad7SiG*^FshP@w%E{<*Kil!X+~5!h&$;?nF!0S%;iq
z*YAk<Vjh1&MqNV|I9=mnL}3w<$krSG3<{CahL-IjUtt`6up4|Fd(Yc&L8(6&$40Ly
z1NAGnqv$=Csr^Sy@;9uz0hpZ~Do|UF@&thz5h>X?E(pnHP=F{;0kr)FO=A^N)joM=
z+V$vsv${;X6Jp6(`-oK})F~{IIImi9V`(Z)9vc;F25xa@Z?W*pmx6u<HuD-LBZh3@
zXp?a4pPfuVvP1m|<}w`lpL@$O+qu+LMY*#%k#Z@n@(}qkx((PW@H1gzj0^wC$Ni7m
zO}<h-?X3xfaXy?5H0f=XsSn#$2G^V(*B4T83iz#p*<tVe*Wcc);%N?HuV+?JGx`!F
z=V}C4uKxv;eZBK<de6|7oQ&GB{0OfvJCjL&*3QP~x26l1X5h_4+o)98<vrDiEs-g3
zn04iaSEV=yEyvX%2-EkP8`;fq7vQ&HpPTp<noP=FldaFRgaCC*DM!JRFzB~YmX*s-
zcL#8rlzC3(>iT^b^}!UmxKF>$_pPn<T=IBcA#HLe>G!E1rwgfGC;wAEwjY@6Jv03-
z($IPnFb5FApgRuJE0Y_t#0|OlF%$Gof6b?fsc?2n_HxEAn=V^bI$Z-3FJWY`<z<|w
zN#(M`v(=7Gw`iBkW{EG)QqM=91iY(vn<@1e^;T0(Elr1+dtf{Hzhy#B>dKOwmnP4p
z)G*!s6phb`_Zd)MyrvpPfv-@_+T_E;&?9=mhm>Bf47>)(FeZMZ5@b5#i+*@Xs21!T
z?6(e2JG-sJUplW2j&^?BKYZ<{mR`=56Ta5kAV+CL-uJQw0<<0^UiJYozC{XL$mMQf
z6=742YP#%h2w!c<0~7^sj}G@wk4`+zY(D>aP}5RDoT4rwZr<qj#)twtA{lnAa=8o<
zi7$uA*me$Rg?)$_ZbgI+$`B6?kR{)uv-699W&K9Ob|zSBN_`|Q%Psd&e`xPISSSRx
zdp+nbPl+kFrkyf|wAsyJP==++dz&V9YyKyA8^*)?b4zkgV@{@d6?Nb5GrWEd$HROY
z*Bg0e@eTn2X`3}o+Er|hWo%D5a?(*hCZ71x#>A49=x8%^I6Odgoh!2sTvs`^+_GBL
zY5v4U8-<fv27DnpCZ-s_IoVM}<C-xeDAx?k^!(eaqdfb=-K9J`Ivsh?O=luHTst%@
zm(6U}r%UjMPKTk*-w{g_n<myAB%;g4zBkj^+dpX0RG^5xNJd0BYHKj>UQ2J&wd=uJ
zVjIvXy|rd-Y<2~M;e2`_$zd#<?_Z2;Lgkf>4E`6yil=od-+c0@i85P7NyA0APgl@7
zz0Get+myh`E$9M<?oKiKa3~x@Lgue{mwF%&dxlDAH3~r`1mO;n%lg4V=jZK{Ln0W>
zntlliAmdys5vLwszaP8`yYDZ@k`4s~0tr=ccMj+Y>>ZMuEG6==7lY!j2B*ZN#2+Ln
zdYq=y2%9%px*n_+d)o>&meAK)G~s3JPWqhlEYLu@NYs6v&^e4t=2Y{rC}CZa@<Ca{
zThuIe2M+@IXb?mry0{=Jy;}3mWdQW_&GCNP67HTrNIVKX*^N^?s5cge=4~?NXdJ;Q
zEZasQr;B+ry^Mn6@RB$Ybi{dInU~P(1V}Db922uR9!7l)I(!rN`^0*1`fIqZ4!gGu
z6F2#cKo?~vR{<ZuWxy|hE$Ut&uY3=g{D?2$-6MUk4F+qIZ0MaU8v2MjTGOE}Az}8I
zmZQmI!Lr7TDm;E(!*O>NaiRN|RWb&WaAIvvVb5t_qsavPS$KgvWT?x#D#H&3nr@zm
z2}B4494SX|<FwwgBt2Y+xZfq6#uD&jX$byrso^ZJOK-yQ;K?JRH}{mAW`jo>)%&=g
zNZc2VN7Lr>rNgNugAp&BzJa_5gIAvt#jps;!F62*;fS+?6HQDwoD(A-(hQB0>$n#&
z&|qoKZ1~Csl8Up`K=OxY$(&PaDTRcT2P0`NeP<yw<eonSWW>MjP{ol=<b6#mv1O@|
z-vDkBO&VVreRQa;Ico|;H|k%k@i6I5k<nQpsvb?{=Pa@b>Kpm1?fs0>nw0PyN-MZ1
zKYd(Ei^G+!bHfX%Ui+s1VTJyq@jQ^pJ(wg7|E%L$#6bIPdtl=m){89$FlYh)eZhe8
znsO@PmO~hT15`%h;?Of1&&I=ogvuZJavFTo!@z09a+g9e5~MAeqAQSJ!k(K*!xqWz
z=XJ(H=Wi%EgBR~wX^tiTw5FyEUv<>S2Ih?u9N^GV8kGu_3khE?g<0+<(>|dUtjr1F
zAw=VCfZUtll$V3v6xRX{X6_y+H2!WhX6lf3iOP)QBsF2zr$f2<Fe{b<<hs{n5NsmJ
z6rGqsJU*puh5_A#h}r%@D65<b!NtYK(~ZrG?;k&mHlJRspRYgN`0nYG&8WNaw6`Ai
z&Nm)+zrX0MpQD{gJb^R_X^v^)&w|mV<Twmk!xXWXI5KE(POZ`iMzoo6CeX%)K$;#*
zh^-sb4w>Li)u^Gx6SEhv-7{Cc01*jzL8)275uKu$Um8UNKD>w^nu#{i9BA))kWkU_
z4G}*k9hQrFOB4}d%=eP<`&ZM;9RSbgAPlV-#iQt=_v_|6!ufx|0Rsd4LvUdf_c{~&
z>kx<Kk=hM5gXO<Jw`~!~J0dEuCX-BFKsm*#oOUUl)O4!XJ8k5recfvB|9h+9l%;)S
ziaw+X+N#epsiPc)p-X60R)Ld-jvshNvvOse^n*I??#VEcIArIy3|E`7pkeP_m=Ya}
zqq@w?jH4MGpB$ZbL=*gW`?#}xcy##7+oQ8~@R5HXpX~p%ecEa=*w!7=H^MeViM?$i
zpSyE;hoH8{x(KW@52W!d_y!b}cyc}%>h$k0Y0P3V`On{JCZpinGT61jpECp;;1Sdw
z>gmRL`s7%qLh(3I?8WAzy>xQ)@#N=^Cr20}q5Cy)21Z&WL_tJS(fCqYz&W1v!{jOK
z{T3o;Y4FqA?bHHaDEPqamA^N$!8;2;5a;hdpX{Hu97v<~iv@UH55jg|&V{mz)+>(N
z;$=eZL?7Zw{&M}Zm}%>A5B4m9g+F=)^BH5;Ne&b<|7F^j#M|Lq#0Fb#{M|8&MY4;C
zFxnvqnj;ZZN4P&uM4%L69CiC)JRn+#=85YWg6(;`z57#V@1)hb_ZRvZ(}u85g74fM
z(7G1FPUV)uR+$ZbX!>pAvB(g^Yl1zeJx07gK2FRL!n2`Ml1b=vK!t8ykqXx~<UMb|
z&Z~u;*4jV(X`3!(&Z^u28+5jR3Ni>IdmhD1?#4z=ixotCZo{$5?I4u_;?`oeT5>at
z#_3f&5@wWOC(T~c*}1wXMp-Hf+Hcs`fX$4QPX}d@G@KVnHh$a&a@!Uy)a3~I%uT7c
z9JKZ27XrtiVZgz&XOy39{1G9c?vihMde`xzjW0Iv%yszwDDLI9*A5oynJ`3#SumtP
zaVkuOKXEoNUvkb@eMzSzRwYzgCt^)EK9|lojFmY$Y53kIROY+nl9CSx|MwgNexIu5
z7<&ga4rDAKlx1I`tAklo3w!o!%(J{XP<!38gNx$ruN&`(;kLz{`-eUuo*l^Gv+eWH
z;l^xz**0@A1B+ibEJPt5C&wuWC8-eTWPhTGcFn#mSr!1rOmThg6pQzx7sarob7##9
z!6WMmlFpg+tUckl@5uB=4w<4|;Y}Id4D<{;x2fEz1?Ihb0PZtO{pfx&oQ_<XwuKV3
z<G?Vv64}QdX;7RgExO?q&2;U9=@4AqDB~@2GC&IiT)Nbzj>c-`6?~dIk5z2Sf@+o+
z3i&*adwZ~na5;UwIL1AWt~-wYKBfBxqB2UJEBi(`1A0!(vN>*4m1N6|LSo|_z}+`d
zYvjFkNHyiRg5PQJd(%;U=jd>6|8-}#wYPnCaN0TE-|axM&~W%1VimKE1DY21BqA_T
zF1lpWs8^zk3&_lF!YuPuK^p82p;^0eWfB*jL(zq5fG<YP+BZF@aM>2)GGbhE5j8L5
z{lkiCdtn4M#qUw!dUerrB+PQe03&Eunaz%At9%fTtRWEb;VA~d1-j<69!59xCQUU`
ziGf=S>drudUeQ4k@nvzX7hSIn=`OU2#TT&}L}zBOJ*>W2WdM7rpIic7OOEJwDV_AF
z-K8Klvcn+<9+qG!C~aCGww6VeVAo*&9<rXw(-_w;u)$SyWJX8C;iz-6`|}C5Yr|}*
zY=H=KHmPDWXrJ!xA2P-q9=RE;ocBj(r?U&RPELvicx{lQ+b^Ko`l44@?`tGkN`~HQ
zD;m`V&Vqo!_0~7^{VJqC&%Wsek`WQl&S|B$zQGC*C4>3E2hVumq_w->?)=m`Y40B$
zW{=rM>2*A5zuDe!9U)kIU|!1MOOSl&CQ~WRrKU%K9M5#HJ_>#a9&QHDf+tRlveL*z
z+}SG(em~nJ_WUw%5_4)7N@lkaRw33{?F=QJ1*>b^p!zfizpjDEtW6Sm%zA)#!LJF+
zkW%`#@-8!2$v3IP&NaD$11;<+{>u48HR568&MjTDz;;EE;Lg>rr219VAKkg`3gkp9
zdZ&Idh%Q5xSHJw*jA67sgo9B(N}t`ex4O|6=x@Hio6`Vryff%TFMua&PaZz~p4av6
zFkqF*Q~G>HRr;>J;KcZDY(8CGr~hpP-_hrjCN;RtFqPUS`qz)HiGij9=R`z;m48O7
zvsS$w!M2#nLU(`Xr57cfHetFqzq7`8!*4hno*UUtyK%fdp4g557s<sL1+@^bXd21t
zRm~A6o=>4u(Coi;gh*W8c;aenmoW?HB&{&V6GMe9YtN^ypM~s#IuRs+iLy%Ov0KZ&
zn}ow&NVG4iInuPN<c2rMc6(=kABSE--8|#dPnec8kmEDhKHN25ai_AU?&MZp-KMBS
z|FPuEQE;sW+x;}5GlaU*4!BDgd6`y-ujodgwk&Z^U}JI}he3ur*&z&l5;fJ~rVuK|
zaBngK1Ie<KKJu~g*_l%SyG-ZC(%;sXs;kgUXr6VHA0~By0({vWOR=&p!alKhX~zz?
z;p*zMr&ag!!=uyvom>K-+KJ={<z<DNYoLy=t2x6xytih0Of-J*emyh4CjFHCS8eU8
z+gm!+jR!4{VtA9c15d;6zT)`Dr-}vOJ|^Qy($6yjVo|-Zo?{5`splDh?>INplSdr+
z>EY(*LZ!^XC@`FL9%SAMo`g5qB7UTAC)+<a#Xf?;%m0e?vbCBJV;v-Ud=(FS+r8en
zF2*<X4aP-HG0xFnu$y){^*GaG=<QmvRT*O@(R+-e>&`i~j#hrv`^>BT!`<!O-ILDS
z?Z3XuTJg$CU<yb42G$Z{(BO3EnAJF^2W_3cy#g@*+2%N$2kb3P@9GbX-O$J~rZdaY
zT5v(r^N&$9;<3faG&RzG+hxh1v$%2j$uLetgYM|I?$vAND_CJe?s>x**G@9J)$5Hv
zB<dl}BKc=cuFq-}71<^#7MrLThDXlI(-Yq|D%ZxZ@jK_@YHHF`4*^Tz5^VWB*%<;W
zjUW{hb<IfmcI56QToR#77B~6R<d`111=t-nLj+DJ$GO#9``g@hoY|<|vw@E}w&goX
zLIILyFd5&f;RDP#U~mYGx1Rrj#+Y68+{{?ela)qG##AEn9K7@TX7r-C(xr|Mir59T
z%VYXX6r6=5)%3waVMVsHM<W~nI0&$6S}jlB{COx<CICDRhjF*=iT&oSa0cW23>eeq
zOySEQ@jr1c&Z*HlIjI)nLM4Ak%q~NfY6SNWsS@=5Bd-N=@r$*(0Ue{gzH=0@)h`#8
zb7s5SjYg9<Qp!7%nnB3#PP-$0T?%~<@@K<w)P?09>jzm*EFv#}9fK3lYs+SECFXnc
zhsgL~$9T~GLSw|?J!g#h%L^T99Fn-hRwgP^X-AV|dUlFO5&_1S5et&#*d3t~ybnyg
zrKS#N4-AmZID%9djT1-2W9(d+xyzKZ8gx2!QkK>I;~(pP{E;1D{|c)-W;a~H08NT_
zrZviQ#p-yGw?r*vSkenO8r!D;D%*(+E8*UJgr9c?dqhPki9(|kMQm5umd|glPufu0
zr$N+gsY=FB&i<KEmw=^gtd<{Lga`FGO3S(RqO?1XN3hnnQtXSKx+4-Y>5x{7>?0S$
zbWM?qOhJ`BYBY)>fKS>*f*CY>HM3;dMH*kWuci}(QZ&oJ*X7vS_Nyo&z0}quxEF3w
zSrHCYwf}nm(23SXH6TMc(JW5-KG3A1e6(oCtE;O{xGKkD&$N5mI(a*@VHCJi%PP>T
zZq&2@NDRY%b9U<vvCwHE?c)Wwm|oPU1`&)9(utkPxc}`A>viA@r7?i7BctB19&P&<
zV&cfd5wgPrQ3}Ml5IF?`ig80Ds4m%xB22BMMP(*XPxkw_!A&@vC~x}rX*>zG+uO%1
z;e?0=nnZm$f|NJ4YLa9KD)-*gY8XsZSaiZP9I<y>e957|7!0M{^WHca7+muh>0gp5
zO$8kjWLeCH;S7@-kNFt)&QGENok^$BV8l8<bGL2=ZU|5#rejUf2iDWT5=-rk1BpM%
z@Pfgl`no|wnys%5<xvo(m1K~eKffyEGRC1MSAFHweO39rdkb|-m~EWO%9f064vZv|
z=*o1|=0RywzW0TCjnlA0HIM5$*ZZI0ufP`M+Z|s2y(4iJQ^gvLT*HodN3m}M{mPo6
zLNHdeJK)IJcQ#Q@j{;lDlG^x^&|q?l%kl$iX_d+j!t}jyo02Eer)9GBscCbogbF@4
zt;^`@N@U=u)SZZ;y-`wza6VV$6GlnkJ3QKL?X^yVkN9!YYPU|`Kw|pQ0j*ax10zo+
zjV`afiDW5w*`3o7dU`1APNm&?{Zq+w3*}y&wHGP2cidW}*ggyx<`>(3b&?0P><Ok2
z>W`Pn=Rq#+jMiUp;VRIs4ZDE7gAzQd0R94iUjXO}0DK;>#XkO2ZT6hw$xIHHITOAs
zvpw5qML-s+m$vf7v=5tZ*IkAazz8APe|^?I*=UNv-wjSa;bcR#hViOJ<3T(m-twO4
z<=J>bDEdu!+qCCgX3|H8Gu!#Xo5Y+8616B9v7tG$p?EFHRD$!U8%|TU8w=H5L+?bH
z`&Z`2Vi>F+<9?q_*D5%yv%|A?YnK_SOpq!%FDr$Nhm!V4rcDPd$9(IY{&L*vygk}I
zJ81n75Y_*wb@J+{-Fg;eC&2USV}ko=`m7Y-&5i@;sQf6xGc?0<s<&Gw)T_jxBlIUW
z`{;x){}gtqxs!z}{NFrY@;Fek%>>g6ThXCr$cN2lv_OTXYZRsqS!{|D4{2s<@J=`9
zWIFC5RQ9s*;!@n#I<&;Am#e`=udY{l80GfqYa@szU3M%<uh_dKy8+u)nQd}i47}ms
zIxagm^Ig%-)xj;rKJC)pgWzTjz2Z7GGImhfT0*SxIZ=yrg6WM#o5f2c24EN$!}e^5
zv7G4W7*u;=ee{p)T6bVXTXMfk>#qAkxr$YyHh6EuqM`%!UI*juT=dk4$G@TGTP&$Z
zEGp1jl9_iy$!^Y!Df>FP7EiF?8|O^TGSg{yan%g%<|?MUnl2zMmcjmWSZGdhr3vb^
z;B-kLN=W<ATgEz^^T0W;Nf3yJ*%h8h*;v4NJZ5GFCxNyFc}LSRY`gh#G-N93P_bZg
zI}(AQXrt)H!HdVj9jWL#0mtdv>12vqP3r@IOZ1Cz;Pe)D*;+pDY<Cr=+kD^RqQ`=!
z^_-(!-g6HhSZ{G1gm^fH>32@T#bPOXZ(WAG#MO`n(LUh_#}2mDO%-d2UG!fzX3u3J
zaQ{p&P;!OvlcS@z?QSxTwtK%BOGJ9qdG(qh?+NTH2((jXft^+@0X`PYEKVbzu+NQS
z>=v<U{~TDZFmPv-A4^nhlN`pFTi68c$@sRe$zSlva>V4iTnp4f!~7!`%h#_s)`eWi
zJ-b|WTHfyU+H8rme{mQ^y{K2Oq0w5iv>VRkn3D%)IFh#!yyI5LRxgjlC75p>`L@WX
zhBkCCAh1gE3tN|cS&#>VdA|XVh{%Ty$TEYT9X|W;8UG93{z|Ik>@>{SI5Lh|aZeoH
z2#`qq2B}IojzOeTw_&%B)1=4TpZLGsq%O@l*nP#Ck12#Ppq*5NxGt6yfDX#|F4%_x
z!+Yj7yuwT-hbG}85YwiUuQ!!2J2?DY>rnQBa^%NEg8MkLql=5U8(XI`)3$B07oAVp
zKt`O-X&!P?K$gQwM?N-VwTsu&QQeJs{BFCfWqF_STA8BteoP}fAyA<G?W4Vhi^rct
zYn`o_q03f|LY5X}Oe!H|`OU3&2s%%1B*{@RVMSH(>8Qt;vrq+i>2lW7ERo{uiV}6n
zW>mXtFH8p!|LdG{U$(jMkI}7W8!g?KGNE0LzzFg2ang^ww{Bq>)LuM}q`?-X^K~}3
zk;_A;^%G*#>>Zu_D4hJfC{b?R_Svg^_0FrKlf!v!R9xI0G|6rc!yaSYPIAK$vATwg
z0R`Dvi!rBZELJ%9rnyy^$|(ODvi!JPcdD$57pv4M>2r360C;Djk<LD$cd1x506Lvu
z_*&N<tlg_v^o&C2Pa$AhGY;0Nb)g<JkChoO2H_wP?^Xn&nGWc2%F&K4_?nBLIP34&
zc{q%znVK<+RMSA~Va=XbbkG|+%eP4{s%OD}WcnQU$2Btg%~fDb#`OQXcG=AL<V3Vp
zWY}=bT7F|`WiHf@N2xfJ&tO#7I6uwWiqm$!%`BRbu%~<0;~vLA54QZwUQ9=zvyjd*
zm86jnk+cpP!bD`(5tQ2vCn0XgyK(9}pD)4{8cV?BBFnHx9d?cm^Xx3T+8z;W+B>3i
zmu2BjWi~xzOx#lSSqUBT?FMT!Jv17rFH^{k>!}_i2EaF~4=<G6No!4wM_c#VvBsKm
zQ&rsHxOd(riiaH$j8mxm39cPZ--25`{j-1SNWI0`6=nfoBgF$7A^ebRTOIjiwCuEp
zBTa=ez*hXs9cR@20Zr1Tf$E)GST!Hec$zety@T!7Z34?-D+AvwpRfu5LT!=<T7fFg
zhoV=-F%^=_c$UU@f0r0lO?+zI<bbo7pU0jWSQHc5mRYD)--`=HheQ(gQ%;witF`iS
zaEqWRu!1eANPw5D4sov&ryWdTRw<n&-?_^Q5|j=TmLt$M7SHP#d^l*Iq;BSDPN@X)
z&;)wpC>(Tp=f!i2g(oW;te)yc9#}=rcr(VPW;tUT!Gd}mm9+xGKOV?pQ9T>ugK+RT
z8BK9%Fgv5LT;BBUSo2Z`eEw0W=i7B@-Vg`kP2ZwR3grD2@$t|lmuNS)HpR+oMz0C>
zGnAlv&CJb9GV}(TT~+ZnPUpa}=?Q_E#|I}riHVOQ4(xW=y&A*wOBTJXF=qFr*R&k!
z*%sTu7~gW)GsL5L%P5_{NC~76zjODzGzW6CxRALfoKUEl_EAV7t$6G3sO76yv&G3r
z=h_RwQVK~_6(b|??kjkyuCj6z0yVmm&U9C`eh>Z-|M2}Fj;52N3kk_)#LUXTX!sEV
zqL<ILe9+WPaC8w!L$)f7{F~pW0kc8(9ZH&S+LcAAC6jolh3Cnbn*l#@baoohLH@S&
z_UPmnxE$QI6JZ;6=mp~XaGPn5mY3)ZFgg*<#|j&1teD5EK|6{ZHw9E<DXWA<%Ux+R
zZ33*ixt2BZ;86WiRD(034AquU^t>iu#v1oBv6*3zY^fTL&JVe)j1jdqjBdb7`3HG<
zJ7Pq%0`t4F0M403=EskDi}_Odn-{5=ey|)KO8y$$3a1r8hl|@GZ-e?n{yA9RXF+Xw
z@fH{H0&vy#{WQAU43X|s#PQF>k6hZ$9xt*WQfUSL3zZ8}@Fnt>zV@pYcvs8KXNG4{
zz6tZX*hW@Tr@p|fM1a16lXn)<n)z{QKBnz@InQX>S89v&iWRNut_n-1HP3Bik!}ci
zRz9<<9RAJhF2kn<Kv{u&`ARJB$8VyHXT$eHn7J5&7NB2{G$EX=4<ik8X~J<wy)udk
zy`bo5dp2??Y~~O!XW5WtnAP+otRRN4nxmW%_hm`vsW$BewKe@U1MjJr*y&-#L^zeG
zwx)bNt5`{(n?YUZaYN#(IrqK$i0EDl#(Vx^5EKUWF$4g$pvK1!0r97hIJHm}W*HdW
zAvv;vYm^3z%HpS8Yg3Cs$-Utx@3Yt?8HlQ2o{g<mn+Jz==UyzqvQbL4B;4(~?UuDt
zS$KSHA$e~Nhl^&Cxh2+MnP+WeUpqZMIodhhKRsw=L)4P|CsWQNs&z+28W|8W1I-z*
zFa*Mu?PSm?Ac}AD>DaZJ>rMbsZXdyKitRxnWLCImm5RitqbwJ#*Z8n;dhtQ)z4(jW
z{A#|Cz2Kl)?h;tb(~M1|RoEF#w=XW@VN6uaMX)a2gNT<XuE);t+4kNZgaf~ru~XU5
zwxRV(#^%1_(Fp-+L%0z_Iv-!$(j6(~sIqj6NN=&Zd#hHkmi9VY%E&0;A}iX}n3d}x
z^wcria+);Nv}vbZ8+6GcAfmSuF$K+POF!Q9ZC4#w?qxuD1M$eg{;T#c?bFuVUAy-*
z6p^V_hliNggd=^^P(n^fp9-HQ1pt^*DiCwz4Za#Y3n1y(`=!%9+WE0{nk7oOZ>>Yz
zxJ55MuP-~1XA&KBY!4sn889hX?)?0Hdg7tL_5}Nb6)CvHPDk{A5zRTnS@i|1x~dn`
zem-igpte?wdS}v<CjoSqTD$7}mYj1I0pg#p>$S6E&U@VX*P~Z8ck%8!#pk-E6<FC?
z$-MG0ah#q@7Pd&0^CqZ{AdHsPf&o?q+Iv&<VKA^_kc-h6VpI@^m}Xu^;}C)AU<h}5
zbga*&!?YYi&cHUFSFURbntkfJnr)l8`b)IIvMoA)bxJpYT^UYSGMywVVykAB$_BRS
zCW8@sa2fNqethmU2v+cZtz-|FEh9U%oGjIly7{cVWjj;x!RqQN!XY3?@OssWJ<~0{
z*7lIYlG|fWASS9(jx~#j;#j|MM28QtzBtEN;w!<YPvb#EbLM<o?Wim6T;^Fa!Xp!1
z9OH?*5n)lBg+R}+CL;=Vz4x6JXC;SRZ~l>^yz9;umB0yGLHq2ub@J0b(W1`w+3C@4
z>$J6Vn!kdT?)RA@9kuSG&2?6?nGJ$?Cgb>MI0t7?+NC4P$;h@DmPh9o9$32sm+vqz
z-8n@Wli-xPp12EvkNAlcrspS0H?iSLDRgdNxv0_k_H~pCv~PCO?Dh-ZD7i9!cqe%N
zKwZr!ZAT&M1P*ZzO2zJYdms`_?_kn`S#XSMBREG{VADe6v<5RQ=|n@IBdAmnxXCgk
zGQ?@CeR>Z{Q#`V}^pvP1*y?gMq((pJb`iS^+^L)Q4pluTCtObrVQ`v81caoUndVCN
zL>gdLEd7<ENOO^Y)P9dgU^j_j(Qhd7M^oSaeHwS)>wEj%D?yzQ(W~*`>5KP{S{#HU
zX_~%x@6xMq11e)k1L&*wZaRq(bPRvI=b(Gxkhqd-dYk?5%5=xwCy#27)YD&oG-6JL
z;izHN#2ZkLrB}VwtAyNU^ca8m`Mp1$-^&5~Qf7@GuWk=%Sv(fm)vsegh~Y-Jd@UC}
zMz%1GHKW?dt-Kd60b1%TkBn)rkV__?Er#VN4ifzKZk5NDCzf^-x+OEDl0BaN>&XEA
zus13`gTi<?TjQ?tgennH@h8_A;%agpu4D{R$H}0>A;I)0D{eV6amk~F2;~U(??6G*
za6x_r<jW;B%eJ3y3u86<4`(FrDFeFE?FY4$71MO_e8R`+c*7^aZlbx$)#Z*h(Gj6`
zv4_vayaFKRVPA$#E*c3nf{kMly?D)<l9tHOK#9bd2Z#5QHOws5mdUA;e_nlTNnwYE
zTr_mL^Smr8nwwi$S?<7g?wX9c9}}MNS1I}~V3NNQe3K&ZU{JDii|rJw7fL%w-hW!-
zvzEa${*7cxNSkyC7Q3Gwf0apbX9l*VDh%^-B?DN~0bbs|K&g+rv<N;SDTrOu&@#Z3
z9Gr5s&5?86TRD(eDVLi+1?b3`BC@26IZV{DRTy7tG?%~0x?(Fho4`|E;$lF$6o-98
zlEy`X?pNb*977CirPpH7=|u@OVdz0jA+quWik*|z@xk^^>uu{$=xaKfbkL6spDnU7
zVHFpMCY)C&svqohc8(4XkbS|5Pba^_K}AfGjU7Q6Ea43JJsCzz!DT-=53{hO=CFnz
zc|r$(x~kMGG`L0%I7ZSzwozf8?>}<kV)=bCm{H;qQI6<(cF_xO>klT^O~(Wf)9+kH
zLp1W_QN3Pw0&h;PS0~pr+OA`%{jEMly6;BtA3?4w=2Zlyj@N#h&1R->;gNgfYVb;Z
zy7*yzvmw?_$;AcY0fYej3XN!mnh&;*_hG$&<S&9p%NjQY-bWMFPl#m>{e(_<6^PVJ
z#6=?t$9<0U8?qb}62l2}V`1O4HbxR%>q}<rkRcvP-8?hrQ5J*)dMvi(>&0WbWhKB&
z<K!fZEfX_Z9G?1?K3sqL^r?+6FePg9U567tUZsTlzivEvXP51Sm-ZEO;&oHN7>$_U
z2K1b}Hk!Pl$Ht_tO|P?Zu7tqX9<q^eiH)J%)ef?VDeDezI&;C=-Z|KpB{$~k^n@;>
zDiW~?wz56l6DN4%*~e~5h0l4I#$6%^lbdAB7G*5{W&3x@m?_J_cU@S_!M}x2!0tD(
zzs1PjN>Wz27n)H|`ssctqJp?c%1l<DaS&?GJZ6nJ+4zXlTaWrc9%BpR;3v}Optgqi
zf!M$yS|AnU%-=0jXlS2IytmKOq(7ZR$20(AyXmi@Re?AmEfqZ^6T>pE;kO%&ih94|
z^*ie@gd#K2I~HpH=0z@(Ck{As<UFv3vE%si3Mb1AG6$F(Q*%N-53}lwvn<l&j8ME@
zY=sDWv5`<>)1s+l+Tkow!W&M<CXJmMKjDtdfh{!=XldvLU+wPl+}IrQ(%&BWw>d8+
z_BGPn3O5<V1ZQHszpU^ET^aYz*APY)oimmD4O>g|yISm%#1og}aKJa0)!<EXgDiF4
z8&2plo*4f`kv3*1Xc{xlgf|hp3`VpkiJY2@vh)NNd6FA~R?JvBNltnnex)|Zc3O@R
zvcoM<kq#H>z+RNEVHvC89AlYr#Ef1DaPxYB1+U+Ws|zr9F)yjHnn%NuIi|h?i5#t|
z7*a7*#Ax1mPFNsT5@K4k+SU}q7NG`(5fJ?{T`Ell3Fyou$%cl`Tid!8*?dV{xvq%<
zH!m|PmNaeFjK)`gd-z=12M=uFey(f>61;nU^G-<WTG46GTPAw>u<QzB?E5*6x#5SK
zkMnmkMk+V(hxt@qO!Co=RjMw=0h$VIz_w7>zhYs>{`2WX4BFMvU^R<*Jga#PwOxp3
z?#JzZwEq1QH*|AhdK>xa-79_*H^MYa=GjL|C&k9BHd~2zqh5p%FXH39$DXn*=zvo@
z>^b9!gU56ZrV|q<U43ccqskO#5Kh=O)ak+POm>?&lTB?Cb3InOmml&QL(xf-Z!E1W
z<&i|L;e4#;8{{)6ckuH0fm{lqp4QAS6bxF6R!|j3{6_wE=DGc5M{l8ANeSn0F7%(P
z4Jx)tRBSD1zmG>6(P#{hwrFTi==_prD8i0!b;B-{fV35hQ=gE?u`Ik@ycNW^29M3r
zm&!ut|4?Q|uN;So485|%i8J-#h8r%LIU1tVFoWc880N}Gsr;%;Mpr4w(&=q$&NOjd
zGziXl#;|kLYZIy2M&i<^P9Bko5a*9#xr7l~MOG=8!cRhMFby#O<l%Sg!U|o&%Sla=
z@~x>USIt%-il9uY86QVDU?SCJA5sVJ^R0=0C;$@=kp#q<W?ej?z#zc#qp%I^Ilaiz
z75An>`$&#hW7n21;g~JyO3*rcr)@W!m{-kOId!ZouY>${^DdRdbj(Acs&gcppWPlM
zbIkWNjz;7B5MfykAQ;B{GY9O`3s?B(2zbB%dRN2(;b|5(SksIn&jFOO+|q^1Xv692
z-=@*jV<C+Fl;3m~zq7n?^OHGpZ5^a7cYDqh>02dg>v9dD6K2LqNNdg6Y_1#;^yiz%
z4AQd74JR9rVI3>XeUhW~Bl}-w$H12iChhL~nm5}jD+)F4SLTpI+-s_trY6AUXEb#-
zj^yW~SpM?0MYC<!77j>X9z*`gqu^QaaPyxTyFQnt$-fZbTv;Gs_0QoLj^EFa1IuM9
zto0}|VVPU2oBAZaTn+XeXB)#&hF&ueqkNMFCE09hP2+1?<r!Ep;vMe{5(m3nj9DDk
zZm^4jpvZNxbg(}2MzE>8{ET8n&&)f8X7!VU7~v%L^l5kWipJ4TF54RXz3#5){dw1X
z3BZMz@eqs;Il6>!Nyf9E&P6XHigyT>``rkvT=|%RvrQzg8Q3yH%W0RH%U8^@K|`pH
z$*vaEZAv%CWml|dd|E43iZik~H;Ssb%(gM-3RgW-{Sy2Fp}uB*yb9BWvwByg^j-~W
zB?82fkGYmjN0;NUXOpF}=$<JOq;E2=g5gZTqoi`0Zg_fb*vWGV`P!c~TaNBIR!gr;
zjBWFJ2P1*TSoMx9FNf%+Fn8V?yn*&FhqT!h=jyfXlebSEt?V5Ayz=Vob-6;g924a9
z&_EqG67nd^^_+*q;tQPlpK7jj31lS}#?#S=<3nf!Ql3LD6E!UmyctE_3<CHph<VB@
zT0RYObN<Aubw%36{3|E*qN!gY*gl{;RWbeqoUTh5r0typygQ@iNw>wCk1mQ%fqhHG
z^DP&=?aLXrf}c~7eo!$w%XXxo95_GIRS}KX)d#$Fa<VX1mEs78xb21r-@@`@1b+|_
z{_d-Q;CvBrj3mODA)c%YIi~{UC|A?bDsi`toS!3Nae(HeSa``&w6e?vFJ~r*HE!|9
z;VP;x2^3HGJd_OUX|00QPB=N?B8{IqLD^H@!sF`h5Y=I(PhEZ-dE>e=d&P2-mAtWB
zr7g!y)7#3K6mN@_H@VN~MdbcrZ-v#OD(%-u(KtZfZW9Dff)^_<11PokceVrgT$c>4
z$Q7532r2J>+1l{y|545@eg@qzT-AQ6*|91J$0sfS7hTj(f>fsX(v!tT0uRq&B%V&w
zQQYNZNQ3Z$ifHxdDbqD&g<eV?lEU*BK^7Wq9z$<<uV-Ms9H+I=8H~jBkkd1jNLfr4
zH{QMq>KZpm3(@;;`hE4-Zmb5|#&CQ(j%;wm8?=O{PAK#rGBRL0&fhAEzDkxa$DdB-
zS|ro;BJQnh7>+)S-a?sUM5BEzA4a<zdXWP%9VE%9P$D0s2E?u<CNTf+>!<Kh4Fq$~
zYw5VV#&#g9-7nb(%uk*?d4#_kPam(lfARI<)2C1W-^Qbj%_ol^Kizyt<u)EYeY*bt
zg7q&sh^o&NvWy`3f75e1ou@O(&3XU7^rM+MM6F-%HiAupelvI*P9{Mc^6EZuS-}fv
zbpGWs8eT?_OblMagD+oibG;dC55nK+^7C_a9<;@Qgq{5$Wapx68;Ko@z{1OT#g~c6
zI6j|><aF3$fd~{f94nKboX5j(%z+XIsRX8mCPF=U(29tvx*Fhw#oCB&J(-Ay^mWYg
zdXTijJwa@TMC3n+;8eil3JPOGh6*z%wr64E7@{|!X1%7P0)ZPXSm0CFjhfP0Ae0rf
z5AC=et5sY!D(bb{590yRwW^`SLl-D!C=yOFDjSU%g%0YIMx*JyO;f$3JGJ3~P;reG
zMf4~GSjog;Kh2<TgG9O$vGY5OM9su0cc2|eOfqu1z}cs~1W?%_^cuH;EHa2obk4_h
z&%!!^ZGHmPr$m_?;BKkWCexrtgS$2{rx+5%K2L6d0uEB~0VRiR7sjPPxiN5RDA;8(
zkTAZSzS(aF?W4U@I;&d&eLp@q`e}c+wHv(pg<iIToulJlPWE5FISt+%9qhJF+MLsM
z=jibCWdGIK=@C7sZMUgrjdu*a+dljyX#Ms0q}6T*M<>DlTVfZfJ?h|O`|xzX)oup+
zhdT#nyDYe%HsEU-9PGc{Kc!-)M@{sL#)>s1j?2l;8~VBZYX4yW^cU`OZ~ycV-R)6-
z+rjbn3EddZ4z^E%<Fk|Fqc*pO`R(qvcMi7q-?nyFX$;hFz!43D_M7d4gWPnFem*3I
zmm2iu`ik2+*x!D2(30+Gw!8Z$t({X$EBm%XK%_w)G=uhWYiA!{T7PZPjJ8jHX;QOH
zijEH3t$#bCa`Zmf-G00Mn&w!a109%`o}I8!DZvBnw9j6(PxnvHPFun2qoZ90JL0v|
zwW<9)I5=uE;LhN=wYz<~jqcG3L5*J1_g81_eZY@_en@=&$=UJgJ_6CbIr^C(L@?Nf
z$1TJ9=#b}3z&bkl1?>VDycEsg=Qk~SPHTRs(>p!c1~}RTz@1aKB=t)0Jar};9JXE`
z?7wau?zHgs2o3#A>~}*JZ@-N)`_lQ(+rOBwK3Fswn|yU}xyef#?C%BJyUfLFVYEgl
z(cV||p{MP$oi_@7W{RDh&caq))%-`ayXYjKr|LTjlgcNLIuo@<Wv=Ac@812o`S{5@
zC(qblL`F*8AN&%W5umB;PJR7D*!%urZ}Z{f?;mx)fA~23zCjFN$%k<7HO-$O)H>M)
zG93T1bFvfcogMCAvD!gdr8TsLIloqIEyDZ-?ddSsjk>|+MzHbd8U26#shprFd43y=
zZfPdL_4?{}tDDW>YBCw6&(_v%Zf;g5liQ8eVKiCeB5O)T=ssMXW0NL<l7-ut#<Xou
z+vc=w+qP}nHm7adeA~7;ZR_2+u^ap0Mr1_&f~v~Qljk{W+`}a8Lz`S1w)+}IQ!2~h
z>1lt88>qGPeHWIljdMC_=}Vei*OaNFAAkO7ATE{_3KznJB9cksa$o|qOY>;+WNSd2
zIWUq8@}GFa(27wKZ=N`{vc?cK2wfpK+DcW=z!_I!%SEoltv|+Vw>J2{br+%@uW-pG
z@AI`JOpS&R*8)P}?TNJv<XM0+zdmOj;{oJfHjwfJ=MRS=^nB|NBu<tceH4dZh1%C7
zFY`{6^N<JGlIt~lF1)dg7)U)d)`om9ciIV!dT^UxQz3|DRe{Y81oCPCd-dB>5)n1(
zuzu}uQK@AsLE^~e%EkAfDQhYNHL&dp7b%qDfs;>{M1uK4^j4CC2c6&NQe+GV=<oAC
zi~_m;W{nbs$d2A1yHa2W^b~_>=43l;^+fGI{uq)|CchF|jrf*b5`f5|z(5E)VSIw$
z-@@_5Y7oH-{~+71SnQ8rc+>1Mf9|CRH9D&wRYA%Aq(jT(kgX4=e8<H$JC3vU2<f|n
zD5-xlC^u~xX*8zYhDp9!IiQfO!5!VI76>q+MNW^DXAxqf_b6CM*oobqJx^W4=Xf|S
zGzSM~+zA+U4@eK2b8iNA0-=l>_Jd}QVk?FjsDChq4S-(}CPxM!6t#qE#PB6jEwieP
z$4%08`<!DVNN%F!96~OQ5C(THD(ijjbN!@QfiNe<b&QAyPaC}b{&#lp!^ONtagshB
zd1tNCvl=Eu&ryv>^4Xa`)S?>&6OPI?gBWfMY85V4h}N<eEu2vhm1qlh4|9}w3fm=v
ztpc-t9HKC(Lh-Ji^p*6dtu1tDBZtF*#z~|dq?V$ZE4N60Y{h8^aoNlfNxJPC)RT_C
zU2h)@*4R;cyhYh+ZPDL4r88Z?=Azs^kEp?@?fY}UEcWOLCKoQ0k41t5eBrU+z>U+G
zq#|F0lVfJHE>7ocvRnQs-pw59&yqD(Rl1g?VjN(@2)s^9)N!8nyU_ajg)M)|q?xYX
zk_f3&1>zwfS==F#nxMxF7gIneTI02=F#$>9T3Z>k!F$`|p45nl@&=h*dr-sdj~8<}
zEdxcI6F{B-L0Ci~38j%Gi~eS-o{1xQ00yJ>liuM)xi$BmXTqp&RMU!klL`}pSfHSj
zC9JI3a;QU*$CroR4K#GU_wehqU1@V_5KbeTyh@#c<wV~Y)7L^`5#gPJX*G7yci^vf
z%$qYY;%APL4fqG|%Mtg>@JsR|{^{*7cLxf?QttDR`)ttJ$93|~3vPU8JfQE=cNd`$
z^UcinP%^eQ{)5m$(qQWBT<~uaYsx_lNASkz$&h$_KJVA{hZf6gZ{p4M1gT!g>=ocy
z?FGr8Lve>ExRubEH+%!s@i~}?pj4S#CyC!V6vFyo9pX>FDbgU4HD>%l^VB!R7nWzm
zpY$R?>xy&`RbE-J2-sr-x-G}`2%m)#au@WSWpO|R-AkARXZlcmHTi~ve|}iiz&cq(
zSiAOPkWdW6>LUxDg9+@G^`8DxaPo9JZk0h*NsDD4A!29bW4xCmjxq0+G;h(n5L)9e
z-34irlcf(6wlz@()1jf0m@$QZm@SQHiK{Jinb@(U+#Bw5d2zh`ZyW`<{>xOhl~U^z
zO%O0Z3f9>aXUGE|0<H|}S4LbRFpQlpi}{BCm-Vl6x1oxEqVzdT;O$(5$a!h@F4ARK
zsNi##r9T>280YnYolYkdUxZ&d9#+M!IZ!@G02y))B<#q=00ko5rto^Pd{@A$^V|3F
z=!0^XkJtazQoDk1GiCm(oyi!^SI#|EyQ14&-qiH75^lKu!Oa_3&s`RZ)JCGKrgiov
zX}*p2B(TqzRjuc%h(BcWHT#}CLn$Bio=>U&B;Y@4jvxoxe4zXK*lpCdy_kC_=!{#2
zdhiLmyVpH6O>~(m^bnRVR-d#8RwJOfuCu#l1NFDwAHPxEjt5U~_{)P;DhM+HIktG$
zP}ND&V~dg+QZdOQrMEINsLrbB{|iWCRpebsnG{g48D6sp!1W$k%)e&4W!FW;{)gB&
zauOGSy8K2BvaWAb^jP64aJ1w1BjKv%L}#M>X)?JOJ1SEVJFQ87sD~=ylyYMQY<G6?
zxRqAe^|&+Y89-$Y`+SlMZ#RMXocfn-1#C%Vt6$~f+#n7qVK5K>@SkZ4pz^(8P=-?A
z4eAD@^+UL69{ndrvAGkDge3PO&?Ze|aeK$^^s&Nu%PQ9ev2C}LC6NQh;Fmo+SqRQ+
z@Z$9uBX;lai(!1G-bIDITZ?C-M<cQ<N7<r_bk@5l&V?1oT#01$yL$I>s4sV?X*Y%8
zb688YkJZFgBL7guKW_x_fO1T=-swINt@B7!l@DX}a;$P$bBWKnqcICD@diJqbB_C?
z2W>9gQNpMi3z8lOrx82tjDJ{MY~gh?<;hQp;Vi^0eJDz33G9$G=c;JK8S8~#c8tXO
zSnIjAg>U3;@37rvm!X(+t=i@(o3Zcvf2Y;l4j&Oqks)-APcWv~@D=Zfo*WvzeP6V^
zdlpM(v^(vj0Q%^QR^~}W+9;>8E*qarQDU24YrBMHu88hG_y%3q+{Xqcid$jnS{6nO
zjGzT~O(E9jq+0t}8&(g+J}267=Xb;2xYn#MS7$Nb(XN4CCH^d5jVJ+JFTk<Ocn;@(
zkDvLx-(El<3%_+~`fKcsLnQF~lKj8Q@0(oj^Ky|^B;TT5NivTQe<<;Ry9Dm(n$yI{
z_-4)Ml|u*v4&u!O>M;+(7`_Fg*I2lbg^@&*AcW#77DF(Gr!^NRN|8i8?W4XVI);*>
znl$KC@Q{=}2hX~mC$8UB3J=;NF7T`mXK`OlwZAM(H~V@Cu#~9}Gc=`rV1&FOeYG2r
za5lFUQpK0mJ-(bta4ny<Ac$fnZuk;)d%b6_McUKz&`f#gkl`d&iOaWSSBj46Z?TT3
zUu5Z|l2Ay&b0V>Hz?}|{qyw~CM(uFnUMMAXb0k>*1jR}2@^2zlMqxwEaA6mo0xQuG
z<qX8zzP+dVMtV{X0dlmE!+Ikl*bEx78y-#%Ovbr+&b7XnzK;q~9=UJF6`#ilG4!SD
zo(Y}b6RnThBM}Hynf{&lZ5qnhY8=z0Ag1+2<ZpKze-66)!BJN{L8AHvK!mwfMQ3jg
z`~Ir`)5r0(^Uo3CpTF?N?tYaco^7x9uP?%t>szmLuLTPD|9I&W`mJO98{&5A4Fqrp
z-1ND(;ByChH-4X00eAE7C$^XxL*08=4Ln322@l+EGzIt>cu~P?u8@DHN9X8;tcG{h
zsGHa2g2BuP<T)T8R%WkzRq@fl6L%p&96YndB^Dc}3cEgd{0T3JyP~w8Ih$Pw+nCIp
z8z247kSFDtLR2bp4-t5M+CS+!We#J(9fw7ZE@ExjULATdblBJ#n1A2zqC_y`d>jo<
zj_%zD!-?fue6Poi>>A|E)N{&Xip>IphC!WMMHK6b5JhdEHf!ksE#PuczdKH->l>2H
zrw>8-&fx1Y^o$>1aJ&PQdXzIjx*lvj12+oP{Kcxp5BFoAhvf*bxA9Q2&7k&~8p|6O
zeXQ!@hF;7nf4Ly|_``qLX?X(9$9wPF7pk;j2VjZ3NAno|^{y!6_+xD@ll7NVC-0+&
zEl)SAVs}SDVu`h6m^3Orp}~_`U1}&6Id{B*S%EvGu%<}^f?$E;7Nh`cZ~oX1C(Kmb
z9l*}O^X0Rettlofvm+_d^VeBPle0tfgE1WoEp0Cv)av3zN{Utgyujl7+z}66?}UG~
zq9G1|A4@!a9@_s#;TUUmhxi6@!~huyb;0Fq_2ZEfr!ThakSx}reAS0lYv~%%-`+ss
zDJM~(oaI_}fu2vV$|lD)tl9E}h4x}F2fgOL`J&g6?LmL|d~nzYj+!H!uH>}uqRV|0
zKB@o&b!q<bY59iowR9tIv3W`$pU1YU+k;Av2qw@9XP;6b;5J>qbhs-<`1rlqw_=$V
z7EXNS!VGlIecy~ZB0R`5lLZn6WJr8)4j!ZkJrLPmds_<>j{Em!`o`yjf{l-}*F4-<
zPk=07I;}y%E(rxf+)aJM-ON~O#t|aAp7j#mF#{}uoxV<n)Xqntj7{k&i^UnDXVXwZ
z*-#23Xi6O!!c?P06M3yYs~}oi<SVdEtOeNr`cB*Owz<1tpI<`{lvV(``W}BQyYI5=
z^}Y41z{_dX@znI?wVuJRu{GdjyswVw!b0Z`_;uw|;ACt?-A!+Chy1C|I|Na5`X~}w
zd4VOZWtB?Hd~jK7LoP-_TMcQHs8|BrX&!IsqzqkY;8vhMKslv*{{2hX%&E>`LE-A2
zIHy{pr#+Nadv0u1$L^-gn|(lW-(f5{>*yW)4*B<{8GwVfEjuG<%{Ez?ndaFfy1gak
z#M5Y))#;xVv80Pphf8Q<v~7laqc#>Sm(q`jRp=c}oa!}!_Hr{-wfjecQ<DDT=Z~jF
zGD1A;d~7m#5~-E>iW2T$fAXdXBIGs6${C;(3H`5sDChIqZh3NN!ok`;vNCfXi7J*h
zIEARXKh-c*dLGLa@00(n){5PVaSEKp$9TYYhVn6CwamupkeNl%J$~g>&OD74g;wLo
zyYhuL%Afm6>MBkTY3+wrjg)o;ep2FFF_gxXwmj4MX2aQOeN;I}5A;FoB83{k)X5@y
zRsA^7Od~ptNWVSmVA++8b{A)-2yre8DeMNv9c)+=R%94AvU)ElSRz)?>EhnrKkDT9
z)1~M4dBRO_cy<v`jP2e|p2>~CfbYW17+X$}nB>bS7i_;`Ipw6BThXTnmj~HW<5;7&
zAO(QvYR(t<T)!fU+5C|X^UV48w%%Kttu8#<zyd~K)c;23OOKCf!^vOYL(ihxMo*Kp
z!*Y2>0f+pn5RW;Gym)WF%%dfYwhMh5|Kw>*r&TGjWL#?l{mW#BdG~Q^s2}nLCm$C2
z<mQ1vdf3GxUv99M6Ly{76ZZ-)@4MOgedJGs+)6Q-bG=bYiK81O5t*}HS#X3N3|!Ux
zbVT7v_Ql1hr^4>*_eXepBgve40)?z2?yB`4!&|QqTB7BwHf>J6ja)|oESbpQWgS`2
z<QBkY@jt^w@z57OfD_rZE^P2FYlUo!lWANb`uA)^*(~WIcdSFGa^zT!9?y>vxUU>#
z6Jb5VXS%6gf5Q$rb054`RY<5pfawS|{t!Qc8`Tb<@kFa#lZ@#vDMj9l5--&I{>*Gs
z77s>AXBQ%8#mtf{;#y>nUk9&Dcr7kd)9X2*=ynKfQFwQM$qm{P7}Lq8n$7F3yx_UO
zARKutgT7p?`3mDVRDAWXr3Y<=ja&$xl5ypRGPF21v)AUNBl89}D)Crh_jwbh_>ld|
zq6d3Fxo^oi_-=6g|KS2T*y;%D?s~jy4NLo`-2(fnL5AlJK8X<Gb;*tAG}h(7Cgo2o
zuGt~H(a^=~JxDuEKV1$>FJoNa%%}XLzx5SQzjl!wUgeX40($-_FF>!x-rhIWZ=ktP
zgb8qbN_W?$I>$MpAR$eUQ~}es+ih*^@?%eyGj6eJkIn>8T(KH`?$CW;UIqSfrN71v
z4+`Fg6XweX|6zsoyv%r2Ww-_u8mgxT(gB$$<Ei*trH*pQm9T8%57@<p$88dKfM35C
z=`8=eBqbST0!uQZ0uRN5ElO@Q_k~>kDxt0gK1Y^j#*FI_%OxUaz*dQELG|(C#~d|x
zB=Yi83+|KEQ%vG>H@IiP>4>)Pm&wj`4k)G%!vN~S?&C{5(vnoS*<bgysULaUU&6r=
zDfvn4$NqU%*mY$sqzV4IY<vKBD$Dyg&Zx)zdqpc}TJ{u+s{!*ndR?wseP@N7-(O)+
zO?WnG7!)!*8@9{)%Yli`Kkp&uJu1>M874RFwx%X#>Jx^g9#9PZTwjcmWH&ocUP;Qm
z)DBjocQ%UM2d2`|@u$YOaBJfP7h+$$07%r_>3z)d*kXkr@!C!OD$6{SlKH#-rgcAC
zgMidG7}5JLmD!TC7Z-*YI=bG&>Whg@f76t|mB;mS(eIe;woeZbn&fD3&59QmQ`4CP
zjf{8r?Mx0eJtc32u*J3AcCDw-4=gDFk{B&x16V9c0$X<hNpluQ)JMn7PP_Js$5DP)
zjCuZ(R63{Z<zr&7(>qc@Uf^v}eEMLVwlNjhe19-E$Yd<l6ca91aySY@VubQ|3#9=z
ztI|xjWWSZsu`Ie_OS`boH1L8FJB}1%p9UmX^Se@ejud9c+7`&EY~>9!MWY1#>6~O!
zKsC;=1tAYt<=6I8iO|uFk%g-`eoth#{f3FwE`bnjO{Ja{Nn-BoK5LGe9{Lzp^)vcI
z2(ej%xDXj&@A~3@S&oR94t-;&usM|U?=O(!r1*Jeb8~&Kv;fRaaWAtypA9u**(+l&
z@lcyp$Wz+b|M_s5{Iv)f9$8c)V4u^(<jQdYWY9a?UJ-(;rw!ddxcwNMdJh#>ZRCqj
z_Um&R!OMJiUHh3vx#~{A4G$w3Bq7Ucm|;5c*4gB><dRt<CRE8lu#S!N7<eI8p=f1s
zT>42($MzU4d*`glMp@PlkFg~J8$oB`9IkK|K_{OWHVclgpqe)4{|>_2TpwMq-TR1M
zsnNTeXKqIAg3A+v{EHGh3dyUEXW5{`hcLP4*ZG(#J$X{=0Xahc@t(Qz9xq<Jv7}QP
z3D|z@PJ`Di(T_EFj@a(X>lcm*1SwWFlTL@AnFSsroGlGHwUD{a<Z;^x!N(KoYdy<(
z(41VP75hCiE|W;LBG`#_W2z1Z?cb-CD?Hn<o3Lf6+c+I{<UQ*<BGRjh4w*1}uW^^H
zqhb+AO}dZMyeh^QCbUO_&3%#v+9r|dqP}sg3!ayypShb3eo*DTUo&l5C_mzId+(DD
zVKMZ7hBOuRenm71GE}-E3nzvvj}rGIC{Gn``%ST@dupP}&~LND|9RTHtqmuK&vqVS
zQT@J6_$JfJj1gAEbLM=ILWU?rq_m4yaoA?L<dNJu)@cKS)RmE7F7zua{9Wx2i~JP3
zjtAjU0*~*c_B-+*9&BghwBiy-m2yi4QF?37%Wx1gMdg8&h|E*Os(7Q$^W<K|OF*iw
z)tnTE;va?Xoc>Wce_FMEvJHRzdQ^kW_dU7d^hS$N6RiA_Kox+gt8uv;a<KdjPj|FB
z>%UrF0F*ud^!mxQlwSt?H~yaw1%1El57oWz3LFYUCpI0xfOT%~tndEZI5DI?H#ksP
z%6(K{supuB%i~MGJF@aZRK3X(gVu!WFy!wX)Z@&GFakV<s!1*G*j5#@t7M%+h#NQ|
zBMI|lNjaSou&ssmp~`ieX7@sQO2%B+9#8q+YuPJ$+1n6NOct*bD>BEvtZGo{tL`+Z
z?&zbB{%;-c3&tupn!WT?c1W3Qn5b8yusd=ZO_YF^VWgAAoxo~eapFG>X-{CYBZ{kA
zCL?%2FMgAWWyCo;kv`69#1gfR*TY3ClLkm6_u6QT_2y@q|CPBXa8dhCemzQB#pfn^
z*P?inRtx(=YKia=uUrr!WGA9_oqQg8sMy60Ih^uX3;e_H4Fw9Kf4ik^Xo3+RCINyP
zH@07c2SQA1s$6__vZ$?VLMDk+lsIQeZ_bOhmlmw?q-Ocyv1<$_!_JW*l1+WWxNvD)
zY5XJY9QV{Cuxz1`%51#4%=s1j!KZ80`r+(S<)5^~=`{UT%5kIePTc77DEwM}udLag
zrFLC9xn$5ID@}=4Una*;JYeCZZBK*?#rA~H_5^ce{c$t~Ui34!$Cu>?m1I;?xz_!A
z^nNg`8)=rI7EwtRb95mONt>Xm^r0RjjT&3|+lX@UQc)cZgJr&sTrIOAgaE6BWzJVF
z9BmH=fTvl??6HwHrm#=|bA@kOYcI)=BUYXCV<96Tt^3TZ^)onE`6xODZ9m{`pziYK
z7M?yib`RR~h4wX<`%+e1X>6IlD`4ES@|NcyGEnD}?Nd-6zq}|&2a7Js_@8N_YrpkS
z#Vjy9F<Y`Uy)|D<HQp31^^auksjU7vwLI?Bbx7a#?VJ$J_eF|F8#VaDsDkcVH9U}x
zC=0pKptrN&9%EM%g0vkn)#?|u>eT`YtraJQOkc<O2p(}Z3v*)g@yw4c%kQ$}hn7mY
z$WOTJg!Ab6ICL(#BlcfH9h~&bp}Fq@p(?O!qDk42Wag|rrYCC58FE(g2yr>Yz}vt5
z!$bohncn3*E26`BloqS;r{oawwTQ}ALa^OC^I)CPF$_n)4ee@2qer$3kS#5_=Ohj}
zNu9)pBssfdF4p(wX~_$UU?9awcgc!#d}c>lo*QKCSY?L)<?OW9Z_m)A;h1!Cn1GJ(
zyS=8HK3-a!CS}LSz)2nrA|{HH^j7~CV4{unOo|C{4?0T~ZWb8N4e^`zbJEnh-#c?H
z?`cBV@7bQ#>fQe}?sD+hO)t>9ecNJLG?!$=HE3<E{lpG5^uPDoWvbab6fC=lSX@2}
zCSKC{k(PyRGYJDqiC&G-atYc7Zy<0RIoK9T8~nWy9mlBa`Adbh@A-L20gno~PJ8a(
zQBJ|*5Ev`21B3*Thc@Zl@2MD_ST@k}hktnMQ^@|h7U@Rp`|Nb>pz>BCpw>DSHf#M8
z<V_Cq49I+nv4_<<E)+BvnI6f-1l<rZh}&VO6dI;Y1>p<-nS<KJ8INwEzZyHv6u^%f
z`TIkgOaOY3QPvwDAb0Wt=boM>`;(CVw>cD>ecSfWZv?STZ%p2*B~bNdX>~H?4o;V@
zwu@F{^IL|tYtHx5cydF^@7p{y52A-cSN^?Z{HpQH^U0ODMgyf3sOXVH@1y8J@*1n*
zW$8$HNssUYR+nLHvmXq?hp59kHF!O7JytgBrpk4t$xOZzm8tPuRU=D&(eeT49r|@>
zdr6zY*SC$e`rHU=2pIY6{ljBING!4XO|8=PDETDq&K@pxud$Q~XsfyX39D<StNnT#
z2$UcV1lLaRXqJMm2y!BA`{$WW{-HyMV!q%)e{3Ec4iraeC%$0PuEP8mt9t*z{oYa_
zHPMdU?mwllts6l|@qD^WwWe`1OE^~phOWttj@zIjik66|)BRtjyPXrzF5hvdBhS`4
zhL}}!pF;DS0>E@2;QQEIr)9GP$h5}~8hw$!<mZ9TN$>~PuAJXazd%mj{Q13Jn=63c
zkE*~IbDtQPC$NV2Y8D?H7#s*I{3I)bqkq_nx%Cru*<q^0-_1fixsPsZrm-p!{U~cJ
z`>t3o<lu}n;&w*d9<c}*V5B?s4AUO)sTk8rNPf{_hOVTH=I;fCn4DNgqHCrIWIrhW
zL}rG4v^`o4hcVZF8M^CGirC$g;mp|{D3&CG6>s4+Mb#BY)?`0=Pb0X0hE>2=#~g&>
zY{mW{9ViYJ8+`IQKf)O!Qr(J1x~bKW6d}-DZdFV5U<9pfEpFVoNB=XMe}2DF_B72=
zZz4@QF_NKf3Mq~B3}ygQbHVt{2M1#r##}z~Ttv5H%%C_t8-lbU@^}9-s?!li$3jcB
z5tgvyFCG0Q8;rDl@~;OOlBhfn4j0QceRC1uUYJ3BgiqrQsjBtI#?TqKepj_tYA^-1
zjS-VA;wDrZeeZ;1W6Y%{54H%Z2m%DsWf@4{_h8gb(8*>AxaTJu>bUyf7xnO)I>cT5
zr<Z@_KDXP4H6eN3;ks&pt3RAxxx}GK^?%rZzYYF7W<`&9F6)r)eedX;Gaq4<Jg7UH
z0Vgj_p4>*Kb=e?TCxEqxok9hNBG3sB6}dWmK)%o~pG>lEK<pha{ljP@9md{b3Fd(%
zXu?Lk%oHhZt$t{9d=Go@zARBvEy%)Amo0{;&sA&y+2;^W@;Pu4Z-Tv(C<|=}cixRf
zCMX&Sg)Rg=3(3>iEJQikB8LuactcC!hvG&6PmSD1`cUq_@gO((-(GfzUyc3?Z)@q6
zeHGIAg+q}XX<z8iJ3bF-*6o6b&M(eurVIVh)kIFgfK)<Ug!#E)p<cXjaFCQIMk6-^
zJItXyDQ&$Tqp9EsF>9WOjBy$WYuqxLQ{;WvpH_HJZ?{r)2gr6<zF-$3q=exL+m31|
z{*z&QH^dqs?F9s!AaSfK=FW+%QF(!eN66J&#l;gvBv)jM=GN9692`|;YgWv?I>isH
zx};R{L*E<A$5B4oJz4PY{u6!+lc+^=f@&~7*1xENVJK%4l^}%L7xu(jhV3ZK7^M%y
zLE_T6pr8LBpQNsYfLJi;YvK-OBApv2sIw;M^5BQB;Ef)Y=f)~wGf@R1CPI!I=bChi
z)V9fM{|f*g8><;|J5`O=vRSS}mKU^vsl{C`ZF`A$FREAPmM+KLnk@>L!EvEC(D-mk
z|FN(yE22A;`4t<=9O|B+Ii%uZ{16bmJ<I0gQS#M_>>KldATp4o_a{B*W&SUMEyVWQ
z$!}ivhC5d51{3AmaV^+CESRp3jW?nli&NdbV@5YNHq|Fo?%e0Fvd5weCsPb7_s!0M
z*}t6b+@|v?1qA<eqFGC=#UR>0B0lehSFDb+@!ec(O9%N=U2U(TD7+^_-{oX|3O~7C
zz7ZcY+~|p)KYl)#UFzQCu1^%(=zWn*%b#B>PfS2GTe=ZUwa~fGL7wjEUibCuES%ls
z+Hq&{q%#)=J$kfdW`5iJq@+7=K?n@!(W>ccXb5saN%nxLCBN8BO#9b-SI!+<dB7Uo
z-xaSe+}#OD6S{M|xI7gjo;I9Ws3^>3?9HEyzP}%q%PodB<TN9;0yj2h6q$V`ZJf=^
zeK#t~5X4$3$D&cfGgbOk_GiYrhW>4U5`7zL?7dsF{pDueH*Q*8ub$+ySGQsfKlW;v
zQV_4%ueNpoVl&<bXCy!{QaumpS%Qv%Ci&e7xS63M=O?H%wIAMVS1}x$0xiv-)w28b
zkI}ZUDtib*G3v1QJ`;TXy61=mfcvh!T8Y^i&|^%3H?Vf4<+Jx(hs}Qk{;k!t+4I2_
z(8YfVz}F-_u;Nh0GEYA0j6aWuseBvI)X@s1Rk%aZn=@Q3rx^~F<kHzp<9f1BuD+Zx
z16XHxXu#q<_A2xTo{J7B|FS~oseZP#eoZJaWXmmUL}z2ReAYzM1Y5*enUgoH#u{0n
zO}LUDcWu)pCB&UwL+@M8P_U;6FqYqrAZV-s?Vh#-zLe*HaYH}x8|FWZe(Z6*?Gn}q
zOrHAtH{QKYsDIt$-vv(4Uh%32{WZXQKKMBR@xG*^@kre>w^-*@_+J&uJZvA_)bEL0
zq9}0T)jOAopL8Vj^hH~1z&_?p2(4zZ2}>y^H|f}s5%x&~Q_z^qbwBcxJeL;{1ZK!S
zfyHsqQ%s%wjYu~yCTI*sBpGg>uxW{S9jSWVRzbWQ|I1FSF0OPGegtOu<Ia=Ax_IB*
zRABwvTHJ`&Y?ARNQ?=~NE~AAu&~kJT+a2yEwNqbHfcA!bT6DzX(R$|w2$xR+oc+o9
zaWdKN{!L!gKYaou<R9$90|Fn<S6><YC(Ube8vO558-SB*{-#%b%+LDRA9XQbx?rvF
z6ysa3F2@t3Clb<N9VWB=dasGP1}==f)pB4-e7T5`-Swc6oSW8Lku)2dJ;e{ZXJ&~}
zkmJst^1k?FhBsJhqKaA9NT=QeZo8|NUC>j;Gb{}I<>_3;O(*G?;<Rq67r8e9G+xmx
zLPZEw$;n}|M`;HlJ=IAMyFthQ-sgvc$KVPaD^s~pgB>zSbzv+*&6^$#J@<r<lIlVo
z8mh3VabJ<`)>xTvOCK&W=5dNM6?)%1`=hy&wlV8u^BqUh$IS@-m<U*h>|d<|ry!p^
z?KYyqhJ-A=e<ccc9vZ`%W7wA-3>KvmDC$rKZ;28u7Lqo#2WZmAx7GEOt7Xqh=1WSr
zSlRNJEkw@)wjL%dqAWW21Q_7@fUd^A5A$88FW(>w7Wd%2pH3EP+|z}$BZ6xjp3J?e
z4&1>Jlz<nd*NJ}k__&u}`f}cxwuKu*17S#hH%XQ*Fi=8q7VKY*wQPPV>hijxjAvKf
zmVZCj*7-=R<}LFVB$2Asd&OC|0p|>3H3r6R*xZ1Kdg$yX>94hSau3d~@%bwM(ucx_
z#peM{8V?mswcfVb9jJKoHg`d?>xnCpO>=*QJOKUuv&G9*!3cR@m%BU|-kg;C>&lX0
z$r4%|-n-<PFal<*q->DIYCsgtTHOx#fa4AFU(g%(!C~9b7ORuct(ArIej3S=sSkWP
z0gpcN5ki69moaB|0xb1&h}+?2&@!h|!k@e1d=C+Bvy-YBdUv)9yr1~;bsW?3-F4K>
zmVOs=-I6O=Y<01_hx0^up2daYua}77t?XZSofE0du^qGD{IOj(J!KRSje-4<>`os)
z0M-MLU_a)cp^7(dn#k)s0Q8x@eI~^NbEr#Ru@>s}Xzdc+84_6tt<N;<|GqQX-zpV^
zYCqyi(~_zW8oa{NRFoF3)aS#OTbx)|>T*dJ*j3;G3Ru^O4U!>iB~=3rIuJ_6MAlRp
z2|C_42?}UZ6B+;F9hWYUvC39>y_Q2s2nXp>?ofnv;VEVeTwRwzQt}ZOq=lpJuDGvm
zRjF9%&mIHZP5JQHz^#OcU2;uNWpj19&rO4+=VzRk>gg6BO8|X*dn9BCC(_--Oy*rR
z$|T0a%Jarxc7DVVSj{M3ziOZv@}5X)KPV~8Ie%WbIrh7L?s;eP)T!xh6n6*X8C%}c
zYLrVFP<Jqe@O9vXeF@$knDaAdX7Ek@tPEOPuYEh`p|nel?$JCdx&X*OmO!aDJ<4_-
zJpl{`-sw5E+$<ZD9YynH7D5<0rC)R|v-K2!6t-w#3Kjw!zq_1b4<z(n_aV`SoSNGj
zP9Pw4>{y-PY%vB)S3>i4=A%~2hF*q_Mh|phe>G-nkw|fFLHr&3wRsGl?Ky)Gd|@kL
zckF-b_j$8n47SWNZ&ot?3HYrl-vUYj_(2pBSGfwdN534y4OV5)F7D<`R3aNaH6KUu
zAbGSske^Fs(S5#G^Wbq(<T2O8+Xiuqr1AG;F7`oNB>6l7Tm&V>BHgIvY!*G2f-ycF
zKF+4V6`%5AYv6lKA{*)F0Y8b8*1q~l$)V%C50%iVP*3)&;SZ-LbhGSFraL%;N^fO$
zZf-)#n|1eG3}en;wZpgshlp0oT-2h|SUwY;y_5sY-|SBZnS;N4jM7f8keEZbQ&ro~
z!Iy6HE%=g^ws=UbZF@a0+h?Fw97JQBL$W~FS?ymCA|v>Rli$Pk><JpmirIq&=nyWj
z^uu(K(cCC0ZnXYkRp^k9FF^V9WQXFCafI_FZfk1_dbYX#8#$6RD6sia_ww^4uDepR
zT-(&a-%gA;^kPY*>*>AREMUNcE4G`t4zTeMb%oz{g1#>9mb)(6s-K&4GD#Ia@~Ypf
zQsp8c`Ar*~`5Pzc#WEpGnBxqr-d#9nP(e84-iM2QW2O2nfsWvuN!mP8DlnC;FMV!#
zVZ`E>LEv8zC+NZk+J5k<lGI$8h!9D_GL*x7W|yR~KbYl{QVQa(-q1|C?7=->!5H)O
zxT@w-PkFpWHH$p)-kNBf`~eN`Ay;yH9S`TB-Uk}*wbk?x(z01U4wey=KAAfR*k0)^
z1lZnlis{G;+WD~j^`4WR=ZJ;8sL3E=Lk-PDa&Y6#`_Pvd#3=5|hYC%88kWuqM5ZCn
zUC={V9cmRDT4xtP<7z4m-5m+ah45)8>BV5dV}rmlJR`R1w^?fAx5C55C4U)CuN3H<
zgDzX>p~0}4^`Y;T`ZjRmKb@(Tf8<?fH||bCSR>+MP#Tn%z(uU|+FL;MOhMd#90kRJ
z{)!uU&ja`Tvi1FC9Vp@L&RAJ&7aJ>VJu`+7J9a3t|1hyLYh2Athz3yyql8iB4NI60
z>W17529iwd^*Ww09q`TA1O;gdOvM^{eQuaFJNOH?VMHj9)ySafP+(`sBGxfvm*^BX
zv0~OsqhS8?fX`ai(rFYc)d<%IvDK!Cuc78iDMf3*ghfMaB~M3=1Ps9~2~%L&{PNG6
zREGk)m|z*8x>ht%`F%uVuHF-r58eTqWN9<+C5d?hAC=Pc@Whl;d`!ZjDyV$%tF7iY
zQf(*&@zdA1wgjeawlBq*F=Vy~<6_7tr=zO=zo`q(#MjMtooLs}A;V!<Q0wd#j93F+
zJe|!OHM4^3O|0F&tkI^WHsogxqDR8NWal3PyS!VBRiIj9Rd?N$SNCf4iMgV0oSyiy
z0klD*ofV;9HvDD=vvhGxAxX%ORXY~B2H7m?Z4a%v`UduyXJ1VLulxu0q>O$EmZ;Qs
zc}g(OD1t~<ie=CD4kydQY2AM9IC#T1q~)H7qyjP}@Lk}WCvg2hmth+1*0%MWs~=g$
zb$0^hrO$F&K($6ek55|8H6CFHlQ?*H?Ep-`%gvd`m~N%Z?{&+25YsH&)YFOdyyfp}
zp}^XH%?N_UYB@kqyLt88ebYiRn6!uBDbLT{G6_*k=$fIGiHZD%$hhap)_*cgQvusi
zf)*!gwh!c-htyrd5G@8pDx4};*RI=TL5p+eM`elg!-eLYS#dw!RP-a*si79cg^_kN
zk@j#gcl(%)_M3H*eoD|<sZ%1aqlBzka3M1G`mX7|aE&IlUB3g)14d4vmdqjt?zM~m
z2Jl7g*Vasx`2a3p&x*XIeKq@%A-Zt+Q54+x363%w%lSeJQlq+z@?fw22jli0C&nSn
zZ+G>1OMXP>-Tjnev4WYtANAic%cuVYDlmu3>x@1hOnn%J*4b~ZAe6_)%#x#msdyN4
z^`oDOp%uHN^j9(q{vkbi)avKZQxZNY2{z>}r$erL6nHOdGU@-A!FeO@^(MiD;?1e{
z(k_So`J?k0;4P&$hsa@-#z~C7dWL^8HD+0p@18v~S{EUy-cm6An#gNF!udq6DvlC~
zz`k&J7xJ)rAGB#vHzAfO9Z1<rV$CsB%oZo7Kt$xAGoP?&PAT-2Qf9Hh6KrqW<tDm-
zI!6e3;^N}sryfk3s4wU}=Pg$381#NP7u~*-bZG$JZW%O`gS9%#7ZzcOwO`I#&-07;
zV4{7>fM}FRYRRx<OH2lHtecpui^Ds<KU7Ad!Zn#V$nM1`6?b-+z`n(_xm(P-$HY@2
zgyHww)|ee}!$8`@iOMOjvwLyBq$Or5u$<<ef^7fIl*Ghp<dRhE#XnO$7fhBN)qqpP
z?*|5%=xMnuWh2Lrng~=3xb?ko6G;6FaCc;#ql&J{MOC``X{nEV5^)at@)1Lh`q@H8
z*3M8+4^AU)S%tcJaI(d?0yz&swVw-#D$wdTF+t9sT+k_eT5{2LeACU_WA+0@`4N!p
zfMDp<bZ5~C2o42{F;Cku!?he;s-EL&oz^b}O~VdwmNkW>G06lpVItMBPp<NtYwZnI
zRUeBDlnm4)YNyc>qVezS-2X(mN%ap(AwG{nwdz$lqwtVR_>9b`h}M?HLyqic#o!+s
ze~I|((Sgp}8fKBnn@EUCw(PKAwe<(teQKjAWS6mvHs&>r3g_;hknfy0qowplv#;M(
zT6bf%(*-?mfTt_qiKd@}I+E=8VOt5oMLD{x$eprk!MjFAhENw<GBenWSzb?m!51tc
z<`PzH0WV2ySVgnt3h?+NsbLDD#s*ayh&2qDh^sKS=E_npaW55F%U_AZ{+^HD!O|_H
zk6)@l#u<S0uhZu8<(3qqey__Of2bq~@T{brU@16ou|OuBq<<3>NaT9~LwJWSp4kiH
z%;<#y@fn`}V_OBe$rW2~7sIRI#K=Ddwa&fKw321^g^=>y9<I5K&VR}8Q{Bn6$RZ55
zi&+#LFa^2B=zQrk$|m#s!C3x@<XT?auO9Tn%THN^?U2!SkbANrpV3K=Eo~C)Z9PYM
zK$h8$;l;KyXe*@coCTFuNu0u(wfCxaUSPGlUYOM981`d=apBJL=&3<JzI9xIRjxXz
zn4%121qT^l)3kOeFPKGXEECbbC|i1w%SvZt+HOiV+mx467QYz+B*s9@9RT~fh809$
zzo?|oX}IfuqHqhy(4-s9606HL7<cS9<zs82RA7HfgVf+$-dZ+n%Z~A`gp?}R#j=HP
zg{Q&DwFKWod0=_Su!<=k*WETKJx^SAM(L*pfrHH9P{22;U*vjE^fFKeA~rO*+{Y~K
z2nOqA3C)Ah54H=a4xOXOT0*Z)LO}{bCVMzwQz@!sR%W4`qGg0mv?L?IEek<&IIeMO
zNttKsRXmAv7gn+9ZdsXIdca~ZBIwO2sMUMX?3wE~?h}pPUcPsQdCOF?1qyG_7sHMw
z>pTu_z6VdVloP~<-<3FHBaDSC$`dSKx{lGCJN0mPP+TmAs%h)M1lvFT+Sh4A{)EOM
z9O>~Ix;;T!=<FR%x}a<Pn5R{}IMeMOmb+3Xdf0y~n<uAT8ksG?)*<JJiN<?gnk6>x
zPJ`FPrUYMv-|t<w$*`9}J9MXd4V@+;qb#qv#PPcdLs&yDlMrveP%_6psEngqZcc(%
z?m{$`Lt!r^N#=%>5SPv3ju7UN<gu|7sVIh$llvi8E9xCS3iMt&mxV3{P<5N)qswsp
zBlEuidzRPvy#H}1N|#%;OjeVPhWsyb;^?2!;V=(ZM!UlFM_8mB7bfRNl}|X$%?f5r
zaO@|pDN1P`Cz)&ezUVZaY3btpx(W9bXUuV=r!O0ubXkFFi8n7F!3vS)zlrgT@qUez
z5$i7ioA!X&&&k<-PH)GJebe#42aiKT0PyARaHj6g|2sv#19<cPLX&-oo2{Q4(8mqx
z?+W&P0r9yE`&xy1OCr}#kuLnPcV=#~<GXmy`3G;S{JFtX;?n6}`jqbXR!;X0EP)+>
z3bcQ&nVr3F(FbyE(Pt#n$-po27F@fM*oWq+a>9o<k*oFD%t#_QOy;LC`^wbdXLEaA
zeE<pIG+K33<KSPgHdU<ms52TAaOm}BaU8xt+~07Lu@%o-t)?9LNwfB6GC@Ki@wC3j
z@Y3XKn(KKmmZAAb)<kPCjf%LP+lswvC$RsgqewK#3j3%LE9qc80<pU>rpc=N#r8Sr
zHpHTF-5C{0<%YMO8f%td2<Q{zl~BhDA%Ve2Xss!87x7>@Q`V{xqwG_6+tb?}YtI42
zGXo;ms8SD2F1>s9^>4P|D<ho{7g7!oBONGWnPI2mwZv0R!iqB}I9H^1f7|LgFyJom
z>)=(I83?qu`yLDbnSXTnZ-f8-dZ+#koPAZf1zrvV>jV&X!Vc+~9_Pc6)X)cnTts<{
zu(~C>)PqfU-!Z?sHlp?Xm@szlUudo#9w9S7W0&{fn%?pOXVP%l<fQK=cEITS5B-=!
z{RsUXejZ=pt116)N|q66X%-D54CLKNnp(3+?4j#vOw0_U{iu1hJf;=T9;@xlx70#(
zu045U|4jb}&b?V9e@&D;$Nv10?|UyT#Mh>E{jlu&e*GZOlRr{#>+tmv{ABE8+Z>6w
zDoU^Q`Ucc1DHQ#s&e7<>Z1mA*$5a+ReENiWkhG%k9|L!f-SQlZ;2XQbMdeQ$mxsYx
zLl=o0LV}5Z;D{whPnf_t2&kdg5SIC(Ic%-Q313`%`j1fF#3Jr1gTk81&4vsch1CTo
zGQCjCb3EaQ$?RYG&blL$EJu$4Szp5mS(TiJHb^3cdm3iAW<kkWubCFOGbwC0tRIy<
z(ns;ckZSeNhKVX+jrrwqYMc@N0$Eu8643O&jhJvqdcG83Zu;+T4Wz7fWJ0OAm)F%C
zX={zR+2Gps23d~sNQIpqbQcpb`-=^Rt10J3Wc)|B<`YP@K+#n4g1*0`HwOA{@ZD>#
z$ff<w(rcABS~sD^!)pw{r)%??f*~k_2pAuMM?HkCtW|C|4D3!;u^Li{pCz8{A;%U~
zkqrotLC+Vs1JRfRxJH$@bK4E>js<doKBc9{(oo}~_SKXYu9}fhjK2s9M+CD(;Glf}
z+(cVUPn^x3$DxQ085}Y(?2eK)4+nZG4NHq6tliwj?{(+9>@LnVCM~KoiiWr-$OlCy
zuup0%1&<?QF4!KLiEbsX9+l?v)J#}MO8!3SySwf9;~D4U1^6r>LP*-N<%PY-@`@vf
zuP0{bz-_F6dbdd0tCb$dx8a=#=DUg;&=qCg<#$y18vmO@A4$wN(vn%`h7e;+K|&+=
zqI~&VYOeh#Ccw}?p~Q+8F)>e@Sf;1H&FE-cGj(0E3qXoZxj0qzZ5w>@5j&`YKI2%~
z#S+8?Zd)lta_3>|1x*O=^8C55zG;_lR$m{F)LsEb@N2*I_1=es^@2Opz}WNw_v}u&
z?^l6JK7DDT(61Tz*RRRZcMj}9w!)gCFFd1SQ}W<+297^ih4e^K-ll3ynJ}jEp8i*h
z0kvmZA2Lh#cM2|{Tbz}w!4iw6jOQQ=uywG-s{Hg~u(8iMW`$~OniH^FvI+p`mvvD5
zH7*bHStQv>@YnS@=90$9_dD`2t~2sPPIUJ`i5S#i%a^F!r%1C=n_@=%GG)1g_LDih
zTi9IN18_tkSNfojC)$10&)Y7_92sdsVpDz2Gd|A{cy<cgv{fhtvIKb2<D1pHoe4Z6
zvuC(_YLwDzJ@Uwm@x_I@k}Tz|La8UvUGfM}g?kWIk}Kt7s0Jh<ch*!@%#c5QK5s|!
zA7MqoHhD;am5IAdt_?B~B}YQUa=c=KyNYO1V=F2{#o}=ft#)izdw90%0$T!qyNUU^
zv`s!L>PI(e#b6gz($j1S-jK=>cx7zTRtO=O8t#zZt0@aH%ZxMj;VjR_hR(zH_yWl;
zoDF5GcE$k(h7huB`?u8XJ1Z=n1GSQWO22k=p{`{(lhjNLtP+F|i`ar-Gwo^zVD=$-
zsce8Q&3$kqv<)8^h=3t5GQZxaBVGy<B9B{xvue>2HluC?ytN2%I>$8=@u8r_Aej*B
zB-6~0`rdVx6r)f=BznEELz9Tf5FGXk&uNfdg9R0kn0<GO$YFR^q&qWf=pUIj?D{u%
z)!0MAAr_;YD$0C%{T`e}Jp8z5G`gjEJnJ2H9@NWmZO=dbi@f8qilt0pM@On$2^_Bw
zTILhMhwd}aQ$51#V_E5kL{#V>53*a__#yTCeVqW>BtmAWuEa5WESfxXwToAe%9rqk
zI>MaxO@UBN;oZ%Qpox64Ix;`4D8;TYad+!;8q&AmagDmkR02hpJfh(B4e-TmdWV^>
zm|8q8>k`+juL%kAxsFynH8^i`p7v9$L~hqRgJa{!B;+olrdc{$aPXKsJ?|sl^8Vw+
z10^LHmk74b+LvkGQ?PTWT)+v8TFm>QY6m7brIHzx8?8c6{#DBi6V$Qqk~B^-9<!Q;
zZ`LB5-j@8o$9x-ZQC3-j3~xfS8gn#=YaXdGAAIa*`#un_QIN_M8vj7(ivC##0^zWJ
z^XTqH={rq+yb+Y=Q{GAXaV>cPs5LS-9g@!Iob!tFU}Hiv1X8F;lB*{jEt~26CIw{X
z#e7iyI|4rK=Xrr02bv4xZMl65j^}t$4IC4DruBDUFY+Ahh_`@j#>5p^C~NCZ=K<-=
zXf9cra3z6F0bV|SzQE`3PHmt=VSba?J}o;A{-yCmTll&AEIFtHGL>Au{RXsnd9M1$
z=2EGcT$Z0WN4&=x=q|W$<?n|%*0s*{qSUs|>*j=(8`T$cLw!?~7xiA!<+r3qIdj)t
z<DiwJcV>KM`_KY<8&xdR6<gwK)V1M^wAhz^7^f9KXQ#=4vZ;yWv3Np$3{hpjooO?u
z#aPN&Y!-!N49mbMkc=7%3nn__qe@Q}`yM9Wc*xun2GFvC@2{J*cHr#0%7(vhVE4}x
z7IEOiqhjXQYH{6rzQ7^)jko3<?J4eW!O}Jt7VL;H@-PJ{_<q|2qt-lf#8e5aY&yXf
zyx=kORGFmi^eWabJScm<Z8m*yk*_P9{wdP>)9SX9-a-0ktXabfZ%^#??nkxQpCf%D
z$f>Ak4C!dW>bLpz7&KU;NjqL=Mm%Ba-)uBeE?&ct5y<{)s9|_pdz@+3$}7)+`Td>m
z%K*8!mem^NVlKDx0b!Q@IpQ#i9x9LFESXZX6Ou4_Doc}+J;)A>2sc{wTZh*?&~The
zH^58pJ*2?P<inRQ8{DTA#_KZeZI$MpdQ*R$Ss+|CBtR0(=nKIL<z6Yr?ssST7M3tA
zQ?WMso16PIZxmPJm``$6)bm*TQ-yIH%1K1AcRfJlC@{_&ao3x-s?XH;YXp4XJm1XJ
z%%|>ibpN(U^6dhLFP(rLuRL`(OC`Lgv2_W+_;8na%0N?1fvY)k4>oFPeq4%?e7|#e
zc>uz6dOX^Qwvu=dqzR1W3k=!~!YnJ@YqRfj%{8|W{TZ=~oX-<c72c+{FtM;X2L-tR
z(#wGq*)&J!=ubI8<y>gWX7V;I5@e=C`#j{5)WI%?LcZT-ryQ|2J4Eb5LbiYA?Ph>_
z7d9f`RZnRga)t1bb~))iKy!98RWy)!&7l)=d^ah!)3YY{vAT<NqlDMA<PJPr?yHQn
zW{Q*Akd7Q;`u6BaIlNfGo!Pj!uu=e)QR=kiN)(f!!NrS*J^d9cKEv0Av3KH*gYNc<
z*~LMJ4(iFS*cI<1F9f()(J;u;rrIb$WHnm0gc(%Ge1g^NR#0ulhiPKM;3;=fmIw$u
z3No!hPHXNji1|mJ9BJFBwPi<t4A@HY08lbh&*e=m*8*#8G;i;~gVBY5s{;H?SE%6V
zXhXa#Ys(IK>^~?DXqs1PZ*jS4-FPT#dUA`Kh87#=Nc>LUYnscAbcZ2hyVo*AY}XA&
z+AXCDsD;1D3zGBDL=EW8$quq6n_jhBjJro7%S5&nEPkMQ?J?zMOpcuFX)@Sl44$8a
z4IQ}2A_bihRSjg{b|PI#Wi6P=s2bOUc$xlAX0hICp5`X=ETz*NdaWw4Zz62yR6k>I
z9CjJQ<Ar-h1cbP6+5w%~l~*u`7%8l5;UisAc6iBA{&0<q8Ma|DRYgEI$LL{UG<{Wp
zjb{+SmXXKy58P#MQ*Ay@=8SDcXKiez;~`FPHcSd_8=4iPZW@qLQJ!3<Nh~oGM`m;p
zE=GS5Y{%sitj7@WSRa%7e+(=wKzEwwLt=kD|3)oIjQr<ZHt9B`xJKfSIEK$W^rId)
zl$G$-Zzvc0Z8M+bNhaT^o>&2bOfT5r2P^5H?f~qO;`}YLHni=~a(Qar>iDC8##mP#
z)14x16~+vUe%eVt2&>BT!)sdZl?L@IZ(nJG{mwgFUg=$XPb8%WS#P)~2J?7ifIpP4
zoVRs$#_Cz=Lqnn9NOU#w$V96FdF!RdxQ()1YX)>tktQ<V14jQ|8iB$~o|AAu8TOSA
zAH6@5OBM^s%R?4q(CLSE_QN}%*zaU7min(nP^s5cgyKsT>w|SBIZ9@k`s64s2VSba
zCXosex(!Z{3$+BB;mJ_y+d38Emv(AIA-?fE$V0&`_`<WUT<s6W_uq(QKMc%1d|(a)
z61m(o9^b(Dw;Su$2gb&=WXEw<gLjoG(;>4`tl5XGs%PEm+$E|PafeSQYUF-F@7plk
zBrP6gK9u~G$p!gAIh?OAJ}31M^t;#cAx|5H!Sne7YXy`+$WFvy$;r9+_=0Gvh@*VF
zBA)B`bm%XNbH4quQ7+;_0uhS>`u!S689;2>a9lEk7X6xC%S7r@-|VrRd|{hb$;_%e
zRc^LsF^M8OpNt}^+YTl%M-|X?wsl10x~hZ3Mmz4yy>Dn7M)j#%nu9w@_|JL$U2zhc
z=<E#Gt2s%i5;FO|gge2~?<K`(4;#!H38ME3?4_>FA~tkoBlf|tspe1%PD_L1G9_qZ
zhgoO6&3ubpi^4neMnM$2XS<PJb-DK4_rTj>2Zx;eW@2G+K()?->dF+xBfxJ)d_W!e
zO1>M$s}>s!49b}%t1^rk${{h(XXd9g4j9zCA;WpH-$fF%tb+onCR9HM&_Hwj4*;1!
zX21NzUpj9WG>W}b&l+eXdH<QcBR!$lx9Q`6Xf6JuzN$A}v2(xoj~@f)_rtP_<jm1s
zGGw?)HbOoH^u|Ld*d$WMU!4&781X)b^pCTL!ru@}rkL#)2dM~_`%cKuJoDq+G;?5n
zn4cGo8?f7>ts}hj(bz1Und9cW<^!ID1|Yw`#W6>6A^POZy627bB)W-*g+t~+KXx!B
zn<egdx}>{mx{IiuU8k_*r{KY?tZ)vL{!kf}!|21Lj;0F{DqZH!LJSOIf4K6JO%45P
zgBip&HaCx;`J_=^#6dl|9xPT4WM#3Ejt}abAsRL|S8_paH{bB9Y5#rJXvy8mEx7ZF
zP2#k?FuqNdJ2<TH!Ywd|>^2}QbFM!2k{ix3yX_GzG6>`VC_}U+s#e9AGs9}zGqZg=
zoP-}VJ(`Wo^JT;8{IB^G>_2D&UD8dwx0+5zU#O2c@qgBzY^>+(Kb~xEu79=v_%lAd
zQC`3VcRF;Ukab}8*<q}Bi4t$40b9C0+ewBT2aT?5&rr*n?Gguj*S0ts@}n=>+IO>C
z8%CGxohJzn)XF-Ehd9Y2iR&ixc}-1zR}j(6?`JPguWq?BJa#lC4b!(gGrxYPLtLJ8
zrhMruzW8q>K85{%9uq5`eo6DM+53Nkc0BF*oc-6shflxm|3BkHx6W7bBy***K}o;b
z{(QCl`D**~)%NGB?ax=+pU(&hRy6&Apz}-Gs&d2!NX6iM#4eK%c}CY!U)-}zXy4T@
zYb2|lMgc37g5i{{qKQ16gFZp7r>BCFX_hRilN5&qSW1_4w9o)A2TLpkSrP*Q(ecGz
zj-<@t-)Ku>C(wY{HgV)FiAO!moaI2pRU|2%<BvBsgSW2&^(VJV3|1SmJpP>S@GO+a
zEHecNGmFQ_`ogIaL~GY{#9~HNlT~4GSP7Z$l(US$-YN`39)pLQNQgapWP-PI0$z2K
z@hYOxcnC=Sy7~ACOPAN18}z?T{%^DS(Ei1L51Wq)zs+C#_o(@J?)&_2^B4a;Za(?!
z`t#oBf1AJf?@9CNe|!I*TYujB{BQFY|2=Jf_eZ9uk`1XhM%hkmcyFAc2>%~$0)>2~
zRXt~XGYTHCbk#>}d>Ey_-Ey&TdGzhKjundvG`)D|c4S<A^E(|GQoxE@LI*Q?gmlqn
zJ1jRw&z&)ff@Ev+yL<`|-a6s*!$uSTZt}km`QJzU?_>V=3IF@lk)5In^+%h|6}_Q}
z(x(qgpFS#m`ndGzlhUV8i%&(&zOqH2Dvp=`tVl|;jo{_WV533Hwf^C;ej3m7HKZiU
zJk(Dk_||D)v*Eui0E7Q%mz#6D+|({N%e&m1+vP*)@}cSS;oL4CYL^eoyL>pe%SY1X
zBh%%hxm`ZeE+3V5`DkvJkEP4Urpw23yL_x&J}&R_@!T$-NS9Acmrv$)`9!;XQr_j0
zxm`Y$E}xn%pU&;_sdo9ayvwJvyEFu<URV77Hn4d9s3FzX_vC-nW~q^YqUpDRMb|sk
ze5f@a-nr%@t@-HAH6Lru$9JyzL~A~|bIqq(^J!_##xj0w$p0F=Xph`X0QO7}b17qo
ztSq285coWB`5!tI9u-c7m6gVvlS$3X@G>)(usUm4N@i?k6kNpPln*OrX6ev`saQR}
z2$tyC5_r#zh9)!lJsKzetMx|4{!RwrNQ{=)#(Ls$zB#t{UP(e6gczEJ<B%9<IlXlr
zp{7!MN!(@Nb*_0hVvbxkOk{kR2?w&7!m=}-*sLr(faUKHu4Fne_L0gpQw3D!xHw@C
zVhjz%!7`QA;Eg8!@W2vCPZ~%kvT`RFlczGINoL>$=<?WHc&#Fkj|e6pfPmRKEbCS_
zgy+Y=)#xV2oWF`E)NjU``<aGC>&psM>c{X9ewpQdDXZRnUQ!lmSZNWOxOcG881fxO
z`M}6DAkkOCD$Kz$8bZ@qPqhwX1Gp?uvftrvnfV_tWXAO!OTrS`5eWj_(0EcoVHWLk
zCK0Gk1*>_u#`lxsec-dq_B9D&M@tA6UV9c<j>KWKf2(;|ASpru5YsFdG_61iHk3P@
zM5y5a7#iw_FJ}_e$5_%|u@$f+c)Xk@Q`?XRe<DzApwV^N-<(BPu6zuz>u?zN`x1+c
z?!fX_pn+%++L&qcFqtSu%1n4;iXaU6Xe4N}3md~Xn+D)bA#Nc)zl_FkSDV7ZMzXi#
zn#+F)>*Bs_iwx9USHj2X8n%(u*D~&yYmRR(@7V1s3sNnp889&nejwmI3(j`lY;z0=
z!J=*nVKvuL#;)w%T6#n160x^FJpBfIJj$*Mu-I5;#}FM;-k!nq<>VE_C!btB<BSVz
zvbk#Tagp#5@Lm4$!N5JY>9H=Rgx|am2raYB?tKp?m?pubo8`#4&x7?WhROhaaCG=O
z1GI%;AV(D&I9j+B%sT+Dz6Y-yD0rYQ5G){YU&vba3n*Z+*UR7Kp_@SqS>yDE#&)YU
zfU0KW@R(yl4@n@P2D#&SK^*rA`iP+=Ep^%+=V2Om*%92dgFOL98Wk(ERR59#T!hd`
z@-e3SD%RkZra?WSLUz`VCRX&sTe%-y@R`lWR5O#kXNNlNZ*$_C7D2?S$;HG;mlZ>V
zp4x56QYU1J$^wiD=r9Zm0Nof&I+e!Y5Vwf98vGpLlm$$9z<g}`=dEIC+0N}(_@!mo
zkoQev?0@mX?iGW4g&k}Qf84SMp+&n=Jaji?9<|!eiT=z$XJ1#(1US&e9Y^*Yl8^+&
zqlb=~rfEe_QeqRBSRx;m&wco;M{UDKA>d=vM=d?S2#J>_n(R;3w`35t^_n<@2^VEs
zvX~<pF=G(vF;~i2dCAOxp@@wMf-1blR%S@eiB|1K4b6EDWTQR9$rAYh5*g2_MSF?h
zWSoaM$dnnUBs+BB;z)4wTRLNvW2n7M8y?kUWR`^V?}r*6H`R!zvXj6*v5zCvouLIi
z%Y0$=-hFQ&0?vEOA*!5nyx-46%^c^=Dg5#!P7}qyvcl{wiE+Gbzshy<U*O;>Ypxe+
zI_G1842u52SI5IZ7LhFt*Ewk{bDz4J1WoVsayL{qncODYH|g-YSFG7(emj=Xw2JD)
z5lt`68ixJLgoy0bK&fhmppmfFv@XL$Tw~m<s6t*{9{fBagm?H17M&jx57w>MT9R7T
z<-{9ikTwymP0)&Y{3{f<2zJIC`%O5;1yGY_Sd;Kf7fY+Kx=bx!Ag~=%giG&9mdDWQ
z4p3(ji;h7n$VF^Si!g?2g7LC0ngNOJmNo*#W!A?#k()TTp!%a^Etn0Vhh=DPG0t@k
z%IPSzx(suorS2s$w7jrBG-{P~i2`GyITkh~iu%{q+lhvlr9DRLHIXo)P5?=?l^Re4
zj|Iu|Gex&@$=rO18B2J);Hf`Nz8#LE>zG(~L>-Jw_-ZC^5nC+K4_7&#t*8$dV}0<g
z(K2OU@c5$|%x!#J-`L>XmmjN3Yp}ne4eG}ccXeV|^Hk3ldydPYeGU#UWV=cmV^g*M
z9N8C97ab<W<i6yiA;nFHTV&L;Azh;nF>Ydf!VO?g&z#Y+z=;-y!&h?#TlUM=<+pJN
zLuIkXk>v2q%tu`QM8ee47FO_Pu}pz(NMxzOh}*5xSNo?LWfDP*dg4JO9u=y(6laNO
za;7+8_E<fy!)j(ZxCPSA15CpC$+%>%-L?=TE8m9kl`quvi~m+Rxv>x@&(KIE@J52P
zbUmq?UK$%OUf@_wS2k9DgH82)&upFHyJZmk<;&oqCr+eSEWOnC5OO_j__d|y(XaUa
zuK4N!oh%aF8??Xp{^OPzz7%ne1Zff%4AT}z0CY|X9+f#aV9IM(ul>1eH+$)(h?XEG
z=Pb-4W`ubR>~};zMMyj<h@g1iLNIg@TuaDWF++4tks_XrnmQyN$n;vgglyNBUjQ}l
zhKfz4g^W0Nz{-CbYFTtQg{X1nEFQRbX)|cq6fa)THT|R3twtf|pjM9pg1rO!&%`V1
zY~^B?k+6YE{UbxM=eAV*{12vNuC9~lng~|;-e<?5{J(}i8Jeh{_I@Tn0ev={5Xkfe
z7Tyqa4S}H?J<^dciSSAJ3S%i|BV$|}n^-i5BxA|BIso(7bUZ6B9nm5WUqan8GrUCm
zhDO?RFS@0tJ+tQ*CH-^9c7IjhX7jUwm<|clCyCh9flug8R&L@RuFkik3{YMcaSjUi
z{r8%EeVpB5Ftybwp<UTN^|rPmyFpW~7(aJ8U33EfxI7RbY;J<D7=@P-EZQ(04*0I<
z<|R@=jpCl4d5$xKk)tQ@GhAQ(f|k;TCw37|J7vcW2Pu^UhmM;@ZaaS5atlLr_Cm==
z`PM6N!ZZzs+tuK|Ccra$uWL`Sjd+gu^&A`ef<rOz6_mv<bYrwAiP+jc4`_uaY6~db
zf^YD%>ZvSJiOSE;@!4kMnC+QXAU2VVB(4!(KkWFs><+G%ZnM$2nQv`9>{d5WvjhTe
zDw8~vyS1Y(Xu5IUhxXQE`fLWCa)H|^t-!pR)X3>0T&8oF3|I0aAR=!UXq>gvXtE<Q
z(I5DuHG^fIiRwy}o6f+<Ti#eJ8^?J<U<8h4@<yv^yAcQqP$W+X2dWtQ>zS2LqX7(=
zyQyKs5o`U`-qBC3lf8qZpF8dCQ;gMzlpXLy<59u`JswO4cElm$9g@F5Iw4`V880Da
z7c^Uy!LL*_ojQPEgXegd>p?8OG%@{!JmQ-jy0m+IwR~PbpKKrJ`Z~XbHUSK^xsYX0
zr?E31u2yHYn{ha*5qr*p>`6k`*q+LEBo1-z{>UNjO)+z!<4tAUGjw+uHAJRLOR}j*
z?f}1K%|@e<gYy$yFMER}-6(spx4nN5Y;rcuG|S{e7l*z5*1@j1F64~#WB|}lv9m~?
z@*gRp)%`0$#%5x7m+_!Ma)U$2c_ph=;NTGaU`y#U;xIo#N_mG3eFm9~dnw=}hzRg=
zk0AjD(@>}>`nKY*C$<1o)m*^5wP%B>WqBwcKL&L!_mVF0bX4efZN8Bg7kP7XU&!<^
zquipF#TdFwtT%iIsObx69hc$KRtX`>8r9vw0Le92qNC9R%*d^>E*StX9ALaKp#0wm
zi}i&ev9eLZTH_w!j7_BBzG0hUWBNXr%`tf8$LxHZotKUQ8D8NoiYBv~c0yz0ob8Qs
z!?6FdtJ~#!`ct=b`Hr5sp>zAWc*k#)Z0Q)T)%6u>u;EJ3Gp5*Vddbir`&&4Xj7fm_
zSB2L0OwKgl$hr|;aK<YD3Ma=B7g-9%NS7dNzA6#e&u8NDJ()P3kL`@(ygOB*Z*vI~
z!}R`^a<Mtm#3dXHldME3A<Loe|CSB>dBjY>!xXFvpbmM<0P54fGFte*kr>k0|0Hsl
zo*NtC;$5qR9EOG%()OjVLXaFiCPy0m_FN2fgy)0wDmL=cEa!v77+XqBa*#{|gim%`
zMR{{YW$8zDNzHDk=4#5UWCplpC6QFH8;->H%kYIf3(lk%V-($f6w*}qcreO5X(F>|
zyN)bd%nMZr+-a|}`Nh5K@naf<T?j2v8Lo73@%4`$#)7JdhuxC1%Ezbdo5jO!<q1X$
zv>TmIB_3-Q0+*FgDFpAH4%%Lij7=Jy6xPcQ=KxEHz=h-PW;8e8&|%NOw4F(P&vqH7
zZoDX#(Q=$jI!e<r8CubJt=wkqH#$T`Vp$=W<hoUo$&nX<lB>q3`r$jO9fRQG&)Qb7
z>Bra55TCVgy0xarAZg)a9M4M|OLQ<VtuHyd(UksJYq;xU9{+7vvtgjVoRiXuct-)g
zM%7`o??&D6EO^c8kfy3dnz-U{_)h+Ibo|foo3hs}bkKn}T;Sf$`03FJ;Iol?`d5Cu
znR^P?z94w$HO$vEdWWb}>t!!!zJBxO#s1;W$*W(e6A?Q>9n9`!nN8|cZ-fH6V9ltM
zM&US(tWML&yiI&5zPN|X6>)ewx|m0ZLgL9t;tLfdSfZDV^`T*t(k#B0dUDCuzff0M
zU12$E7jW`2LIEY-ONg+r<VBdAjHjwkT@n(JTI$*qX_FH-l^xMo0|M0^gT#SG%85MV
z4+6m2UutaYDvHA_MX{7cOKd;cpTwhntd4US!BS>jNo#R2?c2%cFX&8az;0hgpfg9@
zFv25k>->r#02B9`ZRGc80)VmRvsQ?oS-SS6u$mV#8KVUzT2gbc!C2uq;u`w@lr`AQ
zB-h;fu>MXsCY3yeNQZ_sqIHvSq=>0A%2<7XgHyI;S{j7SmC$g1c_CwX$%;}>pga0?
z{T=w7rN1nJ9pfhGFRwP@+d1uSxDm-2)i(S6`siCN(ZtwR%#Q~OlZKk`WYpIL=Fvbr
zO@fp|F7@2nL0-kY@yB-Wx2fiuRhU||U^JL9O&wOlELE_)rKh-Q{D8NTzJ(g4YTE>L
z+I+P4V6-QS^IMbRw&8YJH(hZoNHD>DM;F#`qCJ*u%^VB(i7-<nMu;pILv8t^A2T6)
z3AF=E?Y2@9$Hot0bYe0{iebZefL;3n$MZ`TF1-X7Fjk(BT3?zj0ppkAC0{zo)*Ae^
zX)@zxb^xiB=iA)PT;a*1%m`m?S1RmP#%zO<j3;W<V`#65@r*DC8XS_TX=r0U2&Lu4
z=_Y+OTTs{)EJifd=_Lo&9E*{oy{#KUdt^H2rSix>YYCilA=L=>OkbH$<p>(D!6_}l
zT$+YD%NVYHb!k{RvGGXQ{*aS)`s=<5;V5Tt73;cw{GM=O<4G|6Zq<=2OrJb5bT6Hb
zbQL(y5x-ci<$VVFeP>sC^eJ9)i3rapvz>OXaJIs<w8FYq;j?!bZ*-R!ZZzo^)8=nC
z8bk$oJ`JIQL<DS$@`7l?hWoUx!&DPUE%cHvDW%2M{bCOb0*SlNi=icAC%YW8s7B12
zs*HBnSf#$KT-^*zD0jXz+|%nHUlaYn;-X_SVt0u!&Yl{u8MX$)%6&;qRv<ZXv6qOp
zvYQT$V>T3xjLU;0k2R@7*i$Ix1l9MfT`h_nWg0PImflCV99SI$>SheoWpW5jR(@ZL
z1>W4PE&CPLwI(R~UNWYQUWnM*^rZfdLyz(ZdcBc%j^Tw81U?PW$&b<P&wxGRO7_m1
zStv}yRp3qwaUQ4)p-$4w(gZZD87F4!?AHWXDe)yUBur-I8?fmYL<@+~`}rw)=i9wr
zVUW$FD)JwC>z$tsIbf+klEZdYH^H@-{t0h&IZkeXRCRgS)G?LZualfdU1;**ng#Y_
z<g+#!)~bByK_8g1ahybHV77M{EYYte!Ad%y#<_40l25u0f(xTV&IE1JM)w+;)tCcI
z(B_?9EU`|U&b9~!(`-sifbX>T|Gj1W4co$lYd&P*tZm9YaOUPn&i05o^&&~$;VK4A
z<RA5IbZrdeg1~WhG`HSW1oKZBy&F`=^#e5idLr8KfNL@jaEuM8<e49{ohl`8P0wWs
zkQTaWWZxV_$XhoHxv`^p<+m_5(N6uTtp?j{F^q{v1V<{s%P0heL%U<<W;j`(V7>qe
z=yTUG4LOwoooUNt5f@2`B`kKo;QwSOFym%Qlasg*KOx)lBno>+!~U)8nYv{l)ITsH
z2105ueEe|p+eAvo6Kt4b=9h-Ca4G}=afk;zBs41W(rBrC8|j)U1?S5^nBM|Mmmo+%
zB#FRimLE1kIn?!T2?<V9ngYK=1)WCgaOVgib~^iha+5L_-GG7PdzMH<6}h_g`<pVF
zIu~quTe4Ya4>KV<#Zbq|+|FGtuB>;xIF@zrkIG8xC4_He2%kzoa2}dV8Qa)Rqb&4z
zG&wIh$IN6D&nj-ui(Z>uMVousNu5)%nOT_fW!^V+ba>HZ=p1R)0t7F#vhBCI-drz<
zuIxot)^_KGY<@`XCPQZ0<}|pb(mw1BR>z%-i!s<RNXrS+SAAR`1`mS&+PLe@yvY4#
z3`Hr|(zI|9E?9Vj{McX9P|Y<=uTnZz<z{Rv4nvdKh>D2*JH$;<)OL+V9c$C98Q0*{
zT9js%#;(n>8RXfh7f!^-O&Cukxj^HYp_gF`eA`54DpfYojy-f;)@J>KRW@jus##_O
zH?kslfW76|h*6K&Ji(|k9uHvwFK(#_=bvxESiXLEbh^Lyi{Z~|vU_VT-^7hMVX{?@
z(Tm5ETVqS>M2<J`{Xr84t#;wx^UVGNt7V1YuM70Vkde!~k`X4bzdqc2H-|!$5(x9u
zpvL;2KoRO5bI!+cfg}+4J-FFT<z5iyvhCXGtj#rV)36vYpT8|BXmGiU7rBGSSEytL
z-Bk$g??<LUWrvpbRhPAE<d0hQ2^H?eKWZxmBp6gVhI^ld>8!#Cl2L~PUrrDkVA28J
zr{gaEZkR8d=F7tXL|lIy+Kqwr8CC8JIZ=~QmYvGYc;H<Po58XS1Ea`_+709>-;xpg
z1`MYIBsFu}S=RJrjys{@&^@L$Ek=8g!7kGjpO@7$p%aulENQ^uRp|n3_!qA&hxs0N
zO_S9rb8;Uxl95b96}=DQq3u_u|Ca7YcoYs2wW*XCeUc5X90p>`#0;`z;en-VY!fkh
z0Thl|*W%l1V!6Eozb+_X#AD$SWYYe#?WIOOeTNii)@a%_XO|@4KCKo{7GK%ad`C%1
zM@Q8iCF6>Ij!tHF^P!}hzgBnip|YR9&gp1a($QgcM|8qgbVTQ@(@_N*rgYV&Ur9NM
z!CcM^jCnYWC%1AGJmVm!$Sgl19#PD-jMp>vy3zUh9O8%#VXUGRK`t}{2_0pRW^s-+
zp>3$eA&RpEXA-2+2EmbSO+&D5vegqh;DeDjjUzy@w4hYtVmwoaav!wwQ>tZ&T$j!{
zJ@`Nr3aN1O_pD{pf{t1?e6Es&DajW#1FJ~4TPUBmX)pvgZ`DxX9dh!n-@bk5CjZE^
zgD}}=M@@i@p+eVWPEcrwW5IT&RLbW}PO>}7?cRM&u&sJU5R_Lr+fs*`de1p*&d|;I
z@`pP&BagFk*9$l2A<r@ki;z)Ncak%hsGPx&NB(1foS9t-tVv!3ztJCm;XJ@9{Ni`z
zSzx_vhECxsGa-C5IpH{;QbwNRqF?r08_&IScc$NyxAK?B+~V_vSsjZ6S(TjB!s3GA
z8vTM!TPmtR>6d!oH?o6Y-uR_|GpZQV%L_%ZMuuu`JvWT!fDY{_v+^)!E&H)p87t5%
zi*&(W(AY~JX*DCwkU)<6Vpt+yI<EB`TR)F!NTw4Sp|OZ6lriY(?vp(Xc@$2ro?+Kt
zP$Lr0gCk=gTP!26vD_23MeM>*EW?dumOQZQQ^+x|xKWYUsXvJZ#5#{ARzo_u@|rLq
zt!&hWRj5q2Pu_CGDg-iO@uzKF<GoGT?8I$I{ep<?dcCv5PH%DFxU+B!e-S^cfl0I?
zal;ViW{nROx2-Hig8JKxqntvML*T?R(3e}m^%IYj{N~fHzr+`C%S6oW&i29n>%-P=
zXM1OdqlY_as<@a%O!8w;EwiPqImKRV1shLhQ>Eqp=+})Wxs1#CB6%d#I8baH?^RUu
zaZY7xMYT`__HRO*A6aaH?=(!81Q)pVAcM~!8gxgu_5P?yWT9C$*X72te<0?nj*$q8
zNXq)Vrf%foV0U8(*l{m9ABRKEf(vbB&pvh*nca&<5UAJFWIVoYlqNcNnIqzW%jmfT
zN13~jWmWO92gimS9QNF=I6lk=s|ddI0nxD$oelK;`Ru|QPT`Gtg*TnToAU}kbP7M5
zRTw3{-Fj4B;*Zj&=%BL7Z%)XsJiyCq=sK<3p_)G~S5EIB$I;3EK-~Cv7u@)G7u@)G
z7u@*xe;had`acpm{^Ksl@gH|Vj{mp|a{R~tapa)O^FIMO%pz|E|D|8cXJyvcl&e}^
zv$UpM)ykSxHRY-n^?%&rlw5WG0)O%gkB$D#chwGt(FZle5sL_pQLC=RCT0|F>m!f3
z;GHYCeBty9mwbGL%Lk)|dkU>3v46icGz6z`Lf)+hpHk$q4gHsVtGKu>NJgMhWgfk7
zRmVp)4LszyIOMoEWPH+_c+$P1k(WBvz-ZiZV9!d|U#IwBD|aXII*~!w4LD%0Twbyy
z9%*hMM<+AK@$ru1_;7LY$wQ&T<(cXCKeXSfYJc1-E+^DGG@>d(QrS}VFYJ4{_~+2g
zgv!Lfi;BBkX~}OnX-TP+#HPNLe)3Y0yfh>)1u;^9HVYlq?E&(Do((vndtX#2ELWX*
z<)390N1$>gCeg&z;#wVzXTY|YD!1m;&Z}{Yp!3F1)bTneSMPi`>POa?(01Zy8Lw1K
zXXO`~(CgM=>tuhYS?fjpc{3^<IR9IctJw%x91$X`Rb(6aIhBk9fD^URxKQ!p|0*%I
z>9Ba`s_NJ$Z80sjL<>bLO*GRC#I`u6jZ<?fdFm*>J<FnZ&vSD0rf3Gle}?_h9s7lK
zb?+Mno?tkqPx|we)hIR+xnilQTGD(VplOP7_jyh=#xPuqFhQ6MvAk~Ri{zZ->W}ht
zX2Im@vQi5qSHEN1umZyJ-=XC!Mp))g77u&Ths?0X3_!3{-LU~8{VLC2;!*w#a5UaI
z&GxJ@{ZZa+Lwnj%?EaR2`asfQHF$isV1z^fbJ|>=*-**bm!^5Yvz4N!frBxdE`&5@
zm1HC+(Jhn=ZAMRCyOP3OR2p8JUr1+oJdSKm&}V^y!$Az)WMW(&i6YTf5Pu)(L6d{1
zrDo>jm_Bpy%G-by_%<8Y3P6(Nb8H8^g{D@x*>5)-nP3Uo_Y>TW1O?gbJ8f95!IJpn
zqc#(GC;^nn{|YMak@-=Q-hs$-=*2Ha=^3O$K6*Nr@wHK(`83g}F|5Dm#EZvz16g-5
z<Tui4*x2sIxKLxEIg7a<#l*BLsG5tQCN%hcMMnKT(|9qco#rQKRMC=EV*!oxe&*|u
z4{6Jx4Pjc$(r@S$ujA-OU3l48^#U0!>~^p=>gx(DZQEG*yHV98o-vKp0@t3)Hst%<
z>IjFd*0{|q`ox?QyyyzjDAV+o>>$kov9duIy7fxHnx6mX9r;iQI=>%(0t@i)Q(1tj
ze(%utqxmdCS?~C`M8XN5S{j?8?3~J0R^fkV#^e7F9Kgf>pKt&O5Gb}Eylv9lxqK64
zw8Xg6W~B>(W!2dx2#M?=p?4T;+~v%7>5C0<bB80}E8*m%as%~yhkesA_*Q`ImnMG7
zj=iRh)5)|ri=G0|AeL;lftD3YYy-u;uJBoZ6KS>$H{Xk&IzuXksoR*7L?ft+*1o4v
zwuTAyJ?h8Zn3(`}6v7s7tU3+2ZM74uM?Qf;=6IDQkfE!v4LvHcz1(&@{O~e+abTZ8
z6tWj`F3^n3Zj!N&(pVvH$$HJp-|B2yrC`b%7{^#%Z3rFB`Zsu$U%Yr&b)#`G&Wov(
z-!QUi+(Do(qPvI?q#1{tZh5h(+viRg19Mah=Bk0i$ni+37#Fo(WJ$$GpN)s7=kS#U
z<B2Ugz7(5bd5VXdWe*SWK>g3!*03QfU<0Efs>%z<3tk2$+5*=pJ`P^6T<oPJMd!#W
zg%UQXEtfJ8w}M|0$m?T!`}8A%alX5kj~&Ca?d%<FzwR6!{eSGedw&{Nl0Urv#;>BI
zePV-*WJ#9gTkQE@3E6DWWd(}k@no3>8mVIh3=Ni*arU)8^{qPBz5tSyWM+TnlUUGw
zu663vsj5?#!<v998|y_%oYbm&M~97fK~UQK{`-ycojXKjXWglBXg?aKgJ~-707U_`
zv%PwpiB1>qZ0npWOfXEK-tdBRQ<Y@)$ePG-@_a&=c^tzg#k7G&j%>`;-nv(oBb51N
zbrf6nyaN}XL|z>U&mIKcAjOx;IQ4fVLs)Nm?p1~0k*eC7%=q-vF&k{KU>i(Xt~HRH
z*?5U-7jPXUIWMNFrle*8Pma9cG9YdJL3oxpw=MaL{Y;1q=P^o@psE}>fx#BB#cGA1
zXQtv}y~MMb__l=Wu9(NrdmRm<N!)c^v^iBFhMFt$6}h6Ime|yf#+*EnJudkiHrzrM
zdsn5fu@yI#?sz`MQ4n=uxE4-*q1&KSkcp!AJcC$XwF&X!3{%50ni+9$w`AI8xBj*X
zK$1xvu%#k&2@91~?{hB~^v*HTUHgStBT>!joT*$u){QO7loOdpL`7`IvR?EYw+3x?
z$ULj^J=0j>S<k2UsZ-wC+vAm2!!jKRb|KyXVBlnn7($Tg#RRHwO1tq=uo!<yS5omB
zq>>?662(3qTKU{NvRrd@flg(GWQ`TJW!J!enTdZUU=TBQC)k$5%WD2OuY)9~gNKVd
zXfE9W&Xms8P5KZzy<|5!C|9PV%`|VJ9B_E2rJQhnxxbmVeZ}XObaJ`$AZ%k53Bp~@
z%6f%c+n4C_=IAz`gwthPrvv+%jrYTNux#sK1#+6t-cDwm5p)C_!(VXYhW%X0xnfnf
zf8(^xAwGFRw13f=W1F5g*lUYy^G25CPF*SHwQ{ZJnTNw(Iz%0bF(7@Tp&O@@I?3?b
zbAu06T)eK_<(NZvCESo!Nu)q<gV`+UfceXP-vx8C;t%9j#-XUlw`p3Ko~CnNZe(|M
z?veSu<CS?|==&PcmJBu)oVR(E{hl8fwjB6?^GHP*q2F?#X1sz@OQ404d5S4`omB49
z37Aq%Ww-6kx15ja$D{FV5Gp(U(6U0tz*o}ED5D&2Zo)_XN~^_wIrLLoB!k5&ua<-{
z^TX57gZJ|M=k+Z3^UDcG0Kp-@8GSe@jw8R2rjbe{$StJ!0zY7_TR?Fe%;%c|YMS>Q
zO$eJ_J>-N<YH%5x_f$zh5smdJ)tK_*0w;(P;J`;8P(kb2p$dsUaWbmeRCsPr@e!*q
zz=hsBOX#(IwciMM$@kK5a$DB#XL+K*|K@oti!^h$K#Ezm!|dIMD?u^gQQiuo&GAK`
z^!YdcBvGr^xzZs`CnF@F8f$G&pH45OD$;2>J6G=Nu~cTZW9EQa7*E0*YaaE>zq7c(
zg8A;<ELAn4Aq_$HhjZmn?M`Q$;8~mcdA_)o$mAF|Q9~KwCr88s)Yx|v8}k=mMOjnw
zo!4mwu+qZX%iR47^6!{r;4`<pQfZh9KAa^i44*4f@EOwLN{Dk2|7~(5Nz>Si*rUfM
z{HrR}%Y|q%uh!KmWphNS9F^9jQl2KGbVEA(Z$Cn!*SpGfl$EA~fiD@U3A|M`kZ{WS
ziGUyx<B#O27x5sR*r6v*UYd08UN%*W7CO^6!$DGc+f-7to#=>tU~XG&YvPC{Aue6z
zGYrutao8Ck79KK}vDVs*J@*vXi;S@q7<Gz9Y|!IKIm76Z|3c^(LuEp%;U&~_Dw?>(
z&$HHr(w<!JrE==2m}>_8gni4jpg+1?C$?sKMYEiT$^~YQGGXjH8S#D7p?7+FbJJ>*
z7jx5wD3BIT%$*$gCwHP2I+9D|u3C=*V^KchRKI0AB~>ZEjw~#dlH%Dyg~97Ru-z84
z6ynW=*2bR(BU#HF7-jMC0f&KgGuBBQ-6U9ngu7Bv>BA+KzO~8A4q#P9gmY59N7foA
zv)%P1zqQ%eh}rRhl*)X80cE%z{mC_>0Xzx-oXyI5&7JOlyrq`q%ISD6lIj^8&IW^0
z+B=$S`vON%TeClcN@kKt{-2|hg-O%CQp)SW>)(}Drl0)3Oe(*0yQe>Y0=e{6qH>Mp
zDz<YwlL&C>1@SE)Ve<Gi<t?O4<tMqZLQ)2l65%Bqf@G2Hy#9C^gRDkQn!l#qnlpcx
z-~a|HRazKOMTGF_M12S?a+{Y)&Y6}Hx}))x63d?|8v~B5jWDSL6>+v=qGXE+N)Uxf
zJh)0XrSA`=H3_$$8x{e7SQ0jIxc!DyEL#-}AdZsE&bx>%2(3$q*0xc3n!+)hmZ|6}
zUIufAh~{P;$0r?*<>}mTEWDJ)V}VL?H!s~JT-sEuz#j_86muvOc)8tAr839ow+sRt
zg4i*5Bb~FBR+H19NQ~yo^O&SqFZyprNF2e^6(&M!Vj}cK;$M-hhIR5mzQ#fLR-crY
zCr$XIxRdnj90HmpV2k;)VrJ@JYa;oIC^4L6GP;~oRj#`8b|QXq$Bttaw8Ls_S`CbU
zU4<LX!ZVsEw2seMRaA0pesUU|jBehf(YT`7|M-94!=`?)l<W+m2Sl455FLxci}mwc
z>|=vIJ3HI>yZQLhhWi&^A8qeE`j5@+&8?kBj~;J5q;i{&9&SJUk6_~#$58m0!6q*V
z{$tje4X3j?<rcjEH~r`^M6~B?)r0mMV?1Xb-1*OV*d5GB4qTappVrS;oCkwAnG*T<
zfTtV;oRKFWHvA%}?>&Q^@75D$6I4cT_{xr;qC_@=;36JS3+!q{+(Ud3nKT(hRQ@rG
zpcG|S9OOr@@6kDjeal(wwCyO=#!fTDkWB(MG#-bNQ`~*2a&~ly_xTX~GP@Y#D5c>e
z6M0!|ymVq)w;D!<rj!jXE)|ohGnV?EPTOPb7-2N2X21t7Bn5z3Y4l~2QN5JG;YH$F
z5S|X>PXZR2kqavuD^ypc&Ys(fO$|JOx)|Y^PKndZ9ga3o3qJ*`^p9)qr`m0?t#1#b
zB6`kwPc;9j$VO&h;v?(M>QFF&fEj5^z<8)kiDAy?H)J3+p!ICWJ!h7Gh266(=|n8E
zuOdz-4D_=w;`wyXCZpLnZT+}QT<h$D1|x5SUd&4OaB}sGEx&@bmudjJuU#05J>%O*
zr9tJDp8^>qQ-pliFp=RfQqq4NdPux+a2Z}zbP|j^95szyio*^<+E0Br-w*UY%Ve8q
zMcwmZ+~qr`WE}BLoK7xbh7_w%pDLdR!&=71Jjh!b#R-n=Qkew-N%;)hWX{GDS({B;
z-Az9s*Rx|xON~TUMBT|$kM<>p4#acGJlRuep*TSxZdVc)Y!;o^Xc6hy@aU)N-X23r
z*<{YyS9;?AbWn)IJz2XnLaW!xxL*e0UL+d~ydVsWCI$y#H?gN_g1id|Mw2TJ0jL-3
zoTR?&u24-eFOsxXc2YB{1KSwMM!|pbg%B4l3KHzMCvG!2Es2{2f)H!Ey;OT_9O;fs
z<^NKPgBT~CRVYKD%~#rKBBH0b&-dM+0Sqw(d^G35UaUVqW?FH~kIjOyg99`>Jjv1o
zIpLD1oI@*70Fkp1q(;SZKot&vo0t=;6LXVsILtNyPXp6{+`UrgiyI(XWRP<bd#HFq
zWJ>SYqGcJ3Z7A(sldNw3QVzy#qO;F)>%dAjnb)0OM5nGSnAj_*h<~O&Y))A+Rk?$Z
zZF@B6dEt2b!C?HFMEkOsapRRb2Z&&ZOtG3y&Qfu+cnM`0j&zGYNmLtBH)NW&WXnvR
zB(rGHFPJ=|c$-x~P<gjro$k9{wSHl~ZO$+JTZ$&h(cvFF#gvSWoqsMm1{(;2*^34-
z;X6El*czt$VK}-RM7=ZQf}(2TWD+~(Gx;Ai9z8y#(_zj?((EJ>DdNHlj+y_th>|3P
z$vRhODN)6J1}pbcNB)dcNA)-w<ggyc*h##}g_L0xZ4TJbJuWfiMPoZhXk)&>SEF<w
zh{WS&{v~rp&;J0k4v(t4KLn#O@UW~PNBsy_;xEdg=E6jqkm$s8k_aQs8ps*Ds5LOC
z0FqMKS;C|k#EL`{Tc)WnNk-i`bi&;vVtYmCd5Gx?{>~=Ry2pQMfO<5q>Q2Q?*QNFH
zY7shD%#JM_o7h0a6L*v;^5Equo&Op2^)A%A)yysNSnA!^va74wmbh!iF0x2BwcU&N
zyDliZ{vrYQ&+L6PY~#BJKHm8(ABcyGt_-9DGxpIs6(Bw<K$v$PyYxu>9rU(BN_clA
zmeGLmW(U*Q!&0(apH3m?L1CG;bk0>GNbugFRg|353kgPgT4r6wIb`G+44s!54qF(h
z1`KiY=*BW679Rr&&;`&3mo}^iKXCB%#S|7FXESS3M&woRXq7{0$+nC{owuK9C$Rxh
zcQN(CM=kmat<H)jTs{Wark84uPiqr$#1J24ChzS>)s5^*eR7oY=y2HpEq9|9?Nf$K
zYL6;JxN`Psc8}`butg2#Wcf?emK6;=$r%kM^IG&|7qblv8CL9k%UzS=)(Eq&vEl=V
zAGz|@1yFnL>WOH7kHa%fm_d`ZK^&4>%9gU0aH-^yT$A-OKkYWE^#hw`mfn-lDXAd_
z;m2r>sCZ26)Tw9BIggH7rj^bk#s_)$TdJzUGLR~<wu4mjNqNpzkL%LA>Qyw-QblAS
zwie_D#iG_O)&r}HYwYGaxXSb0lUlVEXt!1lb3GETdk!k+?>v^6T<hv&n(gVNwtrG<
zzTp-(-4<t(`AoNVFX5AEjqw|{lfI~Z7+sd2nJ+&V1wAeSWaUeyAieXWk1JTP+Ngw%
zrfLb28Q&UG1(lL3SB2rYUYb5CmVI7Tv32YNiLxUt@@}hWsk364a9RIK;eK-bJS%C;
zT202WhJY^%u-I8j=`2>0_*z3(gQXtWY0zto<gEJMoDR@PENw8^L4b9U`SS-%?d|h5
zSzeRr+)dmNOcgS3n0E6U(=iw3kW%Immy$S)IYT*#E=C`t8idgW6I7m{MN2Rm=hO$1
znYH(J=j)QYHoYV;l)=_9=#jUtOSa+eS;a7B9tLrGcG<nXoT2RU8-FMQT4_mPGk!>v
zE@!b#b9{t(4dO|u2*Z8wNm38OEq=C&Thnwe78{W-gU)D+iBu$X%Xj?7_lZn6W08Rl
zLm$J3-HF#=s!tkV&U>emV|{?=sWJ@coN+0LISwl6V?Y*814k{tqEj+}*;pse^#=AM
zJP@hdhSEZ?1O6nQUX?P+7qgJ~BS_JUqOsQ;$2g*ix`c9+SqpjY#u$aGR#O!!hGKOL
zc9%BBg^Ow`xf`y8?RGVk!|j|64%%_geKt#?c4n~<F*Myxc2r7xhsUi+eDUf^of1wZ
z>ufC%JOymwnD~WH1&tU0_`P1lLq!^G^*bu!^PhcbcZ;9Q{jbOpgijyWySLQG{QKXH
z#}Bu6Qun_*n>#yS?|=V@5Ak*^AIX9TYirPCLzwJx^sa<C@7XjSkl;;>v`Ng4eCCET
z=TtaQr|Il&y?8=IW^g4}Ln<4L<l2$jlI~=bpdn#9dlEF+LA~>e$Rkvd;~5Ee${IU*
zE-95l&RFIczOCvD-f$vjQQ-iNg;ylyPp2ddD`mWz!wE1y5H$dI&i7JI7h&R83`#ti
zpdUdi!ucmz$2VlND{X3}@00nen+8Vvis3_I;$R>#7_`7%rt;koH_jKMWNI|mtB`Jb
zGfC|p4L`<{(NOM5Ir@}4BndjD(=@@TkDGDUPEyvZQI7{<mu9Pb{WTs#{~-)V65$Iy
zLQ1EK@_FJJNmpybXf~aM12m`;9bFI;Ho0=#m#$>0(Ilp0?pIv%4}+7vS3y69Gm^#%
zKlvX=bb;k=X{)SnL{%gYIzQMjmkkM{u|dDJTl}adcSqwZiL_PfmV>R0&CNCXXR8u4
z!@<Xpy~LW~kmeDO$D`o;a5$yO{EDl-vx_hukVM5nLpXj>6|rK_R)SFHtoQbij&P1J
z39HKvVF@cAR0>2q>BP8#W*ucBm&6GC;anD9u#s0+B^?9EX%pb?j37?9^D#y!FnwP_
z?I5m=+`KAFXF;WlXsW|G1(~rWPP$dz85}ip5^)?i-eetOz}dW1;0A-TE~0>~DqT`6
z>NSOsreo!(W=BQ6b_XGekdyVIq42gbK+!{yZ4%{;Mvp=b>PDkc3Ju*<Z`5Tk_)xFh
z10<klJiQ>k3Mijg=o`mIcOqtfhf%CT)kI=wK%)|RG#uHdyab%geKeFdMw5g(<D~Am
zU^B30+BrhFOR7#|xEM_%O+}!{nZ&qz;aH_&WHIVbFM$FMQn9|s=t(CrP;LU88VYtL
ziJAc)0B`Eepn0_4dRslI1@!&+<mkuxUTrUU^^RWFg59IzcPI7NZ(6~dqsCtCq#0BX
z_vq<i>!kkbv~@%eR;o>^xxzb!-c=9Z1+|}!PioC(aC8#X4~`pkYL7ZNsUEiKwPpoQ
zq>a-(*d_+l2B#Hm)DP+{D%LuxpkEF$mZ=#W?FR?7lifG;v-+yusJGs6m;3eBA-dbA
z{;I)o^`uqbJ#AD^g5%SZ<D(|GhWYK)o2+80?XA-osNbOWW9_gNG~ZMkjns6H-X7LY
zFad9_uehy7z51$AlkRA?d-aprZVS`0-*yRzG{^=Kp5xkX9balc)o4c5lXn$rmTA?|
zVYBw%r&NyK2Yc0n>T8-~X#sR-g?3L*Y6lp&m}E3hUo~6x)@iF2ygoYGW3V@CCqLGA
zYt83D<EY7iJ8jk~)Jdy~?$HWCjb79DSEtSTAt$Uu2#Hqh<mB|YRX;i`)0)2}2oVgb
zRC|wMeRRlkCSV<%yhFPH1}{Y=c>AVC&uPsM)%02?Re%GAsJkt<B=t)0Y&nw+4r{L)
z_1Cq--5TB=p`o|+X00rXS8t+BT{?eTrJheQeO@#gn|yU}xxz~u)c1qx-j8(*UJ9c%
zLWyQwp$|Q6p6<R;&|jC(bk;KN`(#Q?)pY&*rG!2kot?@3TClmpcW_49(^uVcmkuZS
zV0A28)#pB-gk5#j{W|&>ox+po<K~VM#!aS<ltB3@coC3HIaQ7Zh)(gzr2Y9Mxqv>I
z{63!~>CaRrDR*Y@aO?M(!NaXvnZZNz;Gvp<Eu5O&CzGb=ljJVSo36Svz4httY~RXs
zADah{7f*M`JlM$;PJ!an`$y)%qfFrxkUzcOHV?KfAaS3uxr5M%bbc|4nkOIiqz(4o
z{itlpwPU|&;^CHQf^ft<Ni{*QikpxCjobvm-8usJP0*|SCjK+-<Lcm~MkhhLRcp3V
zJAK3(T`SQ~4?*=xpUQ!#zv<f@6^32OH?1g{mRPkgIqPcW9oyLdtW*x&?hM9odVI#;
z>EV|4LQ=h;1vO;*<YVfIZcSB9=y)Ga`|Rzo(v8CrA#bR|f0zXkuOvKD#aF&d{x)2J
zOxM3gOSCSx)DkVvGA-#C=~%h{dkULd{>;<=+?Ef(0{zdUosGvC{m<jgulk=q;=|VB
zk*j*?(!n+6%T(4mXlpO`g7&Kz{#6YBDu#a*!@r8*U&Zi$K`~tWw6)tcTGHwv&E!YN
zvn}=5ac83q-jB~b7dKas&zH8J7s#;B3xvJr^Tnd)^F^NL^TiplEaLcIIJ}kJoxZ6d
z;;FA-lz+axDG(PSb%7$86anmW+)NOu^2ONygb(tocdc6c=!B>WeB)_3T8)|lZP@@@
zgDdWLq7q5EB_$GVl+$G%ZY?gevpuhj1}B&K2<a>RPW6%dPPMJy!H2wX76u8%#j`L7
zktt(mVUS~7JPU&)b7o^OWzMV&y725IbFs1kv^RO@)6sB7Wy*Xc52vGZ`PEgqeEfVJ
zVuUGrj$t&t98Eq*00y?x<2$sWcvup_c5l9d<SJpWICEz-9Ifdv!#T+Hs{T5IS$e3c
z#nfZYT}P*m2aasrJZNRL05_HDpW8P7WC1lJ|8)m(TS7qpLHGZg+mCiOGxFb~ulN6d
z$Ol&PjXFtND&fIEk&bB654%xWM*}Ar<$ToR+vGekZEK^V80SXVNxlkSUxlx)!q->f
z>#Okf|D^C`q$$fucoJ1KnGE^D#6CKYnGf+FCcQ*#sOT|=!=SCL3f@!Zw|L7g_LBAo
zj`ib2-i3ofqGFN96ROv?QW5i*PA{r`976m{h=l6O`W~}@G#Z*1&FIE*&f4!yc^hhP
z7)7#$tp)c;0B;{1*AAP_hBJ!MI2tC&-~s*b13|wapyh(Bt!pTLk^@t4{6*w#K!7#L
z=GTmf^@OqWFcMJ^LEu;<bs8cn34`Bg*o9FXH5W+w#?CC3NFPkmTaBg;BQI+X)|M7K
z-9?GprQg%&lh{+EP_rRYb|8N$ftW5U*8t=>3I3S}D<;i2c)9`oZ11*y3RY>z?e6rG
z3F0R)131r&yz$~=nZl}mdl+4o==;a5hix(XZVQ`Ja??5#HHQy|OYN=fhw(r;4vWi;
z>S4u?=XEy1A%)od=@9ey=ur`NwZ(@xDXD%d{PO6yeR$O70SBK`PaZlWb{it0E$(00
zc9ez#DF)kJ66jQc;4fT@$Q9y$v8&ND_sMasc2bcrhfbVA4n!smc0;tr$#dNYy?BzB
z$o5-3#K9=+sUfrxkT5lCudPb9>AX;NdQEh)pWSM(OT~p(jDmeysRw&(h&Y;Dr531Y
zk^F_qjW6d-3y>%L4QB%l;5LVb*E5?taEnYJNU9l3gPXY7i1XJBD|Yv8V1^CT{H}#n
zoAzWpY{PalyChUBGmA9nl_!PM<Wd_VZ>;csPY?B&I67+chv+JQjO@383j6g&t@ZA>
zMreGnaL{9E75?_u+P*Ge<MBD%*4+UECFFS<EO-{6Qm1fuoYF%%^-7f)D_B&$rG~1g
zD$(!F_Csv#CNU~=CNPT;Ei``?^0H_e{Bo(eP>T{2=xQuE7g2M$*~p3K;0%qD&jdx{
zLEiO-d+r?#?!e~Ja22T38IH0o5ET$Hd(Yke9SA1F*Z>Ydn-azNG;Kqh+J;zzfmv!i
zjLQp#q*k0pby#2VNj-;F#H5xSrFzMSbA3oMAWfFqK`caR<qm`TnFc8@yzaySX8Q2W
z?^yJ2cqa;5HI?VyBkvdWp3~UT4@PJ9TOO06xEPhTY;;M_JMnY^-U~heBIUA~xv?UD
zOUzn)c6J5*WWoVfM`Q4HZd2X!I3k&v8X6{WVk2_qus<y58~p_bGMmC1OvlxQkO_C&
zF8fogiMK8DP})~nto<cv$>8b%LdzjuS27dZdF8sR7%DyRx>nCXG2b1Gl1QZA(d_IT
z-!S1)`GFYKmxX_2cZKAfLwmv70MUI{1J>9&lN($qE}j9*(X@j}c&X#fPR}RYM;N%Q
z-MY?=t-LMR7a<vemr~KlG%qZzlm=0Mih$aQ$7nl|gv$V$W~h|_&Y)I#T6m0!cG?}p
zJXA2AIV`8cU5cBc)S~ZgIG5g$ZO6`a;O%XOQUvs1|F@tQPDA#ENJZUUoh6*@2a%D-
zv_#fp0;$ktH?Fb=45#FV!*!UzVUXpCibYA4jaxbGch_Eys4K(@CJ88<4v=d|p0S-%
z#SGq3HObh`<6~f8H{ZpCI0us1k6va~4s1>h>)caP>Q&=t_lHy}MwZxUJhkfUYW>hp
zI&`G6;d1(NH9h2wV{risrt~MuQDrj1sv`W77i?zLpxB5v(r6N&#p3r78u&Oc(i0#E
zIp8S=FYUs*6QE)faSzvU+^7U=B~{kX<7Nn!Q<>Aen_e6Mm?Y;OiPh=i?@f5!qYAse
zBW|{JFIorvfgX#ui-r<g+8{8J#U37FP@>st!~j?!mc>lH5pa(YuI!^4x2q#JtOirr
zI1UT}KS2>kNXpJNHB~jB^n8U{U}VXxi?~Jo*+7rS5QM<)eAz_EcFr_Ok8;9p-C9eh
zNroP`F10t}n(R@<jmr+z0hc65n5gdvpGGq_o%{>dBpFp~SCah6MZ9}y%v0F}K<p86
zj93cki@MS6@D3hkL0gQPKD?JkOl#NZgT6Wyg(e#$E38Xqe5a;>z(a=em%z_>*B{K1
za|ghBF3xNb`{!cDYjn>ds6S0bOVO-QD|f<*OUOqkADMzRZsU3W(SAfk7|d8{5O=`c
z$u&i%JGmN9M`gVW;zXOKr4$n2aY~@`1xf`Xiz0_ggKY^bmz2~<!2$7WrgFJ&;|}<Y
zcFY|;cNx<R3-d1*R62A27be{}9*oXLw-*9>k^SfPR>uE#WAoA1`@cWp^B~vka^vY&
zv&*kHe_wC@zTW(Oz4`lk^S9*9pDSuJ7tsbA5xlsw5~M!u^>+Hv;?LiPD_%?O^|inM
zz1<G(-CMh6b52X#2)_J%o&ImrKk4R#FnyN<rSFml-}TD)+KH#C4X%!Vxc=Y&{<pt9
zkY+2aokMUYfue;c6Hjd0cJjxzZQHhO+qUgwV%xSov0v`H+qZmGz3EL?^`g7FPM`05
zl5kQQlzSK4?h5j@Wn1_!*dN)xsm9EWdvOE0&<wB~kVNHQuQ!WmpS>|0SFB$(-#9Zo
zJMWyN?l(-Tyrk1#>bKgm%KPCH_}{dG-g)``g7V36V|$(c6-88Ky$?6Qn*86|7ULe1
zB`mEdoX5r*^E4k@{%tlxGD18jKcj)}PrLq`fDxiv5?dD!sc)Ia%#Hc0DcafU!zr6^
z6$P61YVF44tdx1f4i(A8<$GTif-Bb#qr={NGy0yTOJ1nM-l?gn&<*qN-m8(=*4}Yn
z-$C#<qW!A96|#0tD~-%)<+`t5`MC+;Z+jUXt!jqU=}vL(iOTUo!U@3r_C4^`Bbgcp
ztByUlxI6NsIQ=YT%es!NDbKe=Xwqxr>4z5@2uE8H<oXYE5Uj`2M!gOo%PseZTvF4I
z&v#XclN@hoy8b~1V}-eEo@g5Y#O!q4Epe_Kjsrk1p}4;q?%PZgLmGj8$d@~6bQXos
z-q3jVPR<TPy}t32EkqNSE!O;9`zs49*`Bb0FBww>Q+q!!c{hM3{~pyo9ln0qd>!b5
zR~%x^8a{J<zR)99@~v?$=wRooDwj|tzsMnfz5)a~D5=h5|GI)0DxcP|7}Kp{eNBBw
zZAT5#r?Rd4W(jjJJm<7WtnR=rqR;a_It_yf8S*{dL6DD$+!|Da?d#nNo@4?#DDCvX
zqS2hsf6}{TXT<^-zg`J(N^HHTMl454ZD@2af=(34uo<XSovGr8!}f^3&!sluw?5;h
zhgq@m)*R!f-o}~8%0nutQ}^oJ?ArZQy0qY8<U97GC+4in996fJY_vyX^4XYP!k_VR
z!&Gqu(TP)%VSV~jh`}AV^68ig&-7^-!c%LOpK(QnzReP-^Ss(44tMKkNJ3CU;JCj!
zmam+`N8o~S%qqOl?1rTg?X2e$dS)Hi(bnlPnM-(<Yr;@VJfomTXi|;ou|GG;T=O-Q
z!kl=Vl&JbE1j+6#k^#lg43#Jj0~K)$2Fx8v$K#~e+fj+T>|_^?>PDL;`Ff3n-oVfz
zg}~7Y+11-ii<8+53X1HhbRKT;$kD8;>Xa%f;qbA9vN_rOvFUL*uRLUaCPW~8*_8Qo
zPbq4D5xMLBDx9({{d#xlB5{2q(W6p@dwu3_RfZN!=SkvR+!cn>JY8|&;cHd>Pu5I(
z{BW@U`F?zzxxQ^)_~gj18omwJb{P;%D;=S>0SDDt-s%!71E+b-(Upp=z^t{fL2K*Q
zw1FT9H|Ajw>)VOXnGOr+D_a5j$Km*7C(iipc-wQv8?Rh?@;I=SsCv_-N;-kxy&OIg
z*h;o^@UuK~!NeGssgEa$w2Yx?iJtv?X^_DI5fB?<AtP>~0JqZ0n8?8h9&YX*rp-9?
z@q_Y>aCbhcnSrF*BevtX7MvL)qdew-&mR<)K*<T2B`6c6wOzE}E#RJyBnF|$NVSH`
z?MXOX6Y{A0UOuh@01cyMv|#ibZsbh1i%*)l!r<p#!g^jD;xHg0hQvUN;^i-Vf7BUt
zA&1-IqcN-p^2wLg4Q&_J7B)`My+RjM5jlo|Sw%(j7Gm|e{2)p_))|?}x^1EjJ8iZp
zi$^K|G)}%HZE!$^(&fg(KHdDrV#}3@bm+*XnJ?MHivS+$p7h33-=}{z#wpLW%;$mU
zvMZp+gSgIU2xJ%xY=D!yHTKo?qDW1?93+wA!v3%%6tRcZBaz<fH{T?G_Sl~ycVr=6
z6zz9j-wo?|o91fubx%1SrpTRk_3P`c*mnh7a+#^D=9GnO|26n@EE&5$4?b|*{z05>
z{P9byy3ye#nThX7Y(Pxvz&U@4`J#hRiaI2={XsZ?ZT4g7Yqek)@0hL5Ob}93rR91M
z3>aAjl`)#mPGGhapi9F+;gJg!kBZJ+#JbX(CJnXTNEVga;M4BAtd5QhHi3vNy(ej^
zlVyE!(uS&a2JbvNMBioqjtPBl_hm;>x@L&`4U)-aGeIXPa3-PXo~g9$mHG{u5~zp0
z&THrWe0y75Z^N?4ht0PP4{tG`lH8phJ6-WUbhTj-lOJH%7)26Dw$ZNWApEy0Ubf)Q
z4}LIaE8FUJ+vjl*CVJqQhZE+`XlxJXz+>9XFQ^0LCcXJn%UTWh54(U9D^ER<+#75O
z*?jl-0WcO@QxZns!lS6WAfOzFZTrk829_7^>c)3CVv-0w^(1~XXJFPf%Br&vpCs+V
zhsi4QyyYwr9IAsw^=!5a#lU}J5)V6qyb*ev3AFsGh3kQbr~GQgH$d2l_bcgZObx!v
zw^`G=<?kzQ>v`zE=Tl@j*jP+a(Gin13&A*RcqK&Om&%g1rXOU#rypBI!&(14`a#fO
zt(#bUJ~2~}-r;nJ@jxvj1Z6I9L9pepIYX?mR^u@clmF83C$Kpk^t*5(FU{RPa6p%M
z>XGvSjMk=ORpNHA#&dH&u;u}?wh*|mX007^;80|`3S`e~LPsr_L_!eCcbgoP85@Ow
z#Q)p5@2v?_kcRh9p5n@<hLyvQ&t8t+k9DYeWIngGN%u}kFK~K4f7oqv@oIV}Wty<K
zF)Rx>2A7bma@L)5TjbX5fI`(-!GFlkSzHdw!_HncH>hhmcE^NCl&q13jwyNu-oKcP
zmvDAOC0hJ$KAr@A%YUj-=LH$n4x7ON|M&*OJuqbHGGR!;9nz_;p9}~bW~ag-9sG1&
zJ!i(<cABe4g`b$3YxQ+%(0t#l_>vniq{@gP9UX=TJI6lka?#L%GfO4lLs9`pU06q#
zh?#!;dHMS8xW&<vlbgE&qDANej_!}-{QC&hCtRJJ1ibVK_8}Xmwbg~GedeAVRxgG=
z<;Y$~N!B(L$W7uT(v!A+n;gx*8P<Ct%~CMZr4V&mINndL{S4^j(94=8sJx!sb(?@`
z@SBsJltH1nxX3kDq9OGf!twJfb-QJ#5wx<Y#oXTt79o0&w?AoQ9_?xqXxhpV(}y*+
zbq^GFYoIRmF<rkYso>SEVA8xabKK#9noX~pcV~jOGg%U10a`bHxWkJUWvWe`Wqvst
z#Z$zT3uuGs%}i9m?cVa7OYe}iG)ETjBaO7cCrMYJ;G65YJ)ci!6Ht_TW^(@15lr3a
znEh%Xl%l0q+ByB|W>TCQ_mL()$0_b`8qO*{8f+Xi1YAh1fyWX}OXD!L&tKqx`lMXA
z^IF-8kLtC6y+hMHms=g0ZlL$dG&)FXl-<bRjz<pNKrCiJK4gbE3+CH<K{!}4qy%K#
zE2BjxBj|PrF(Wk%ZEb~xfr01xDdTS15X%<VE#QJT{BQptH1?)K*`>j^VFGGlF{ICa
zHE6}G%>2VCQ>0rEzCwDSk<cZc)IfhQCGPgbq1lS{Y%|w{YyZ6WX{SyC7YTG_3nqIq
z*ri9bx`k(FMb`L8)nt&DaN}gu9(YRWgSw77!?doye1jA=geE&rAm=Vr8wU7kYyw>%
zJ7lz`8h#<aJZ+rPOBc}eD#6m<d)OZTo$ocXVqByBRnUWlyy<W;mHt#eXMRXNwR6+$
z;9L8c_u2=kx>e1-Vtqh$)8i=EJu2qrS)1|Ldkn-TI(QodwePcLjP@LyO|R~T*RJa6
z{Kf(Bc+_p);!1&bTZ`mqY-FmRk%s!bHbQ-vtLoma&0%eTaQ~$<ArI<Iwp?H?li5ke
zejps8)LsgYojAc~s(ROq3C=Z-?4ko#yUp$mkFRvFay3<uQMJBbgJsj3&M8WCV8lSN
zq0-$hsU@u<6Ol-Z_|`Z1cby|V)@OADmpyN2{s}lXvSn!dtj~U$gIow^tIC~}*mj4&
z`LcQ)s^1A-#ln)CrFk;g-1<41;DU0flbyfg<Qn$5Mi9#Smj$m1%;pd*?8VT=L~j!$
znQ5Qr#{sRxmEvOdT?MlVvu$~;9Hs<)_vz3={&l8pg$c;X-Z9?Bw`}uPR-sz62MzO@
z)I#IB?4wC#`>*m+JMn(d<ZTXY4MO#xy`Oyjf{dm03M3(LPjFG5kM5eJY6R>Nj}Hq3
zjl1?VfTtpd8#JSU=)oZCxVTXEKrPq3%2vP}Ra*w`g4g)m8X1VD(7_x>{LsS17!?%S
zX=F)tQ0v=DDX&kM3w_YSAf^Xz7!QCTnusey0f;qciE2@T7iBCS#d$i^kXK@k5S4kT
zX#(RrlNV%DbguEPm~sv6%)OIc-$f7`I;HVY{SkOpGb<*m!(SWUEH!i5H_uGu#MfGi
zE^+V7AKjMD@O}#6?|9!ck(tDlLg=#P37^oN_dj{xQOWXdT)3mPna+{(Cny`#8^(}T
z!@54d)}eVDxQfS2pgk(#uFtlAE@6G;pOZS;3f!+d(l*jFU~HAVb)t0jzI^QMJNmx8
z61wbKEHU2(8AaFj<xRv_WQ`)E;XW`HdMGx7{c%xZPNTkj&^vw#p9-~qvfG`LM4<An
z%yK^vPd}n&!0x=gT&YFN6?q=|%U*uHB-?#=sJBLZIm8qYq29gwx#4j!bv-xtV`uq?
zBU#(?dz;T>)U&{jxWM5h#$3|z`Cg~GJyLRMc}^TgQ`}b+>O&LmxYu;<aD0G2vLGNk
zJ()mZGqz;Q5g5&Y?x;qr@{F!u_HO91zaXQdXzwrl1n}ijXW)8Y<+}K^z!&c?>he11
zri|wEv6|NR?VH><?5V$sS0B_fm_H?73o7tWyWCfqzd4|^y<W}_NZ|q837|7XPt4ET
zoOYAI_XR`k(h!yx-vnJ3f@{s$bESSWk2YLqumz9IYG-1Tpp*yxxLH(Ol<xm_U}s@1
zzUTN-0g8whAvBGJAV4Jf4N5<tVF0;KI$=6napaf=`3XH_wW{+CHA?4lmm(5t<~+ym
zTZ?<u;>5jQVdi_}GeR7Vu9`iY0AC(|vpTi7!3`@ojOiGUvR4te=3Hjr&({~S*qaZn
z_wx0ID%$Rvx2Us>dsqf69OMipJxGEHT5V`%11Xx;?!gz?iqKkbdHxL{&j{YO;Iib|
zb-h<(RpK2hZ_Wk7g@O927|O=eZLeqq5(enN9Mw*Eq@AKga0B#Dov*_(1g+&nb|Ttx
zj6zWpn=>1W=n#b7omeuW7=PiWgP#v~4n{L5?|RTs@0bP;JwaNgB(|?&tP6F;eUD*{
zBWabg!+11^Bo~VwEp;ybT&|bsliji_z4R0uNQ!3F=7Ugb;6kA1g3Egx-`;)L!5*GS
z(BV;?-U>LhvO4TK6w3xw7^7Z$rKx_0IkUGwd4RSF^<J=}xXnnyylt2L4d(HHmpdPu
zMJT9r$)$YF#w|bY)6tay91_xsqnMv#HjVe}<b{&TZudKpwY39(s4W++8wkirhdXVd
zCg4}WjHh}p;!v{R%}f0{pqj<IQ(XG5lkRw=e6)c5Uv|D3Y<Sy@PURVyPR>ktJftq(
zvKE&ed?l9O`EQf+GZ>pk3*jKHPgPEP{@IspYAAk(;vQ0LS_vP4N0>r?9^Og=Y8G&g
zp5*QtYQ?X%$rI>fr2^4n^PTr^>bxkq!a_{L%9eC9NKJ+C^p*+F?X(%8_fr=R1u{B6
zNQ6_Sb#wboX(_lII`S@{jeBXOb!(oX8C+|fcE}70&JaLvY9fR|-((0?+3YVjxOe^v
zeCB%EkYncgHV~!E(PP?gP7l-Rmg(9kg(r?VhAsV|(IY_jlbB0uvZLYBlwSc8uMi1h
z>YSV2XqPxw3CO8uYg&6*Gqn8#p}HoXhJfF2oqDnZeaeVr<AaRVXwy1@7hgKLO0m%a
z{-5DY+UGpeq<b%$=q&bYNAK-8wYQcJs-esuHrta?lZ_>&X|r%wie7>2`?fKn9geb9
zA1(K9z}peL&;M}Vo)ok=<$Sq(!Ri@jyB*3@oX*BEC0(_7H}8*RR8=WKI97OJoP;+u
ztnIC36SrU<2TZO8iHvJ4-bKlpXO_ItAEFLoi4GD>%{2p@kYt{-%VOJsI=nbbnh`K`
zdluao_q_~xOwDDxHjf(?I>Sp#X}^bP{mSQz(QAk053b6EsgeizchEKcS!9L-ZzZ@C
z;>gU0@pGi4!=M>v<sTK&k{N_1-J;*1w+MCTitHE~XJxnW&BS`he4fE?EAgNe#R&&6
zbBW~tF`>`oLcrCn^PXH<%jfPX@Z)irm=y-(^G9sog}R*Uwxrdc(dD$>2RTw0tJy5j
zZJg17Bc4B(TDo55<)4k8Fk!rNLH4@EqLc+DoS9w5r}_=31J9cjOq2e|LK4^g$&~8=
ziG(D7Hf$DsB!u9b#F}%D7DLqwoVX*_ILh%R!F4PVu?(sP7|@a6Le2_gU@gGIXw?4}
zVo#L_0V7(Av*tvF3AWEti(7o#qBVVX3dK^KU*@fwVPDnsG16H+k7g6jiK5MgTW`a#
zE^0Oe{`?AFQD<$)@QSlTDY19?#t_m+q&THn`^t*1R8H%IFZ~N>C|g=ES=tG^$y^FN
z5UEZ_Y_N1P&^|Sz*72p__O=hD=$06UHIC;2&H5r-6RXOa3aXj|Q~v5|NN7NYj>;sB
zg2w6OFP3t4DtqZpuG9{W+ux#7DJ_IT`HTYgC&2Lw(~M{uRmXr^lFoPZLvq$N^K!Ne
zY9n#{O$cOxR){M)$v;{!N`B=~TyrT<4x5E9Hi|MFBFoB*U_cODkxQb<#qG4=<Si&0
z8hFv{sy0(7k><n9Ox@z(Ae(fej0wA+DBQVeUr&>?rbQbgjVN8$3T!WIFhJayK!KDh
z@XA#EqWDJg-YmB_5@4HOGP6aHc?Ro!HIL?MzUG(TpsDbz5ngIViJM?JdaO|@!((Q7
zHl{Qhg`_6yC8oS5aL=~Wvz&t&HOa(&n_ZhjEX)Wte~W$vBNH@;xh2V1+XRHAh9euM
z;A+K=7>wjK&7y^b8P7sLMK3?1{?7TFGo#%{NYs_}FWBh>FoR6@ZNM<~Ms1mTa!bB~
zv*|M~XGJTkdG(lpEPMEG?kkfmY+w~Vd(QV*V*}>$ei2WU^-b|D%kePGPAY4Gj7QBA
zs45_yk~BvrePYH;Lt;G0BH@K^fzDLyJSIbehN&$uW1#T#RDv++pWKzI>tFD>py^k^
z&`$@jzv|<wqG5x1{D-*ujw1VRx4o*UgDU&85nV^W!*JLZS`TRVCl@jTVF6|70_}vr
zLDbg-5AWCFpUM7J^W0!Jk7#Ha(*(sPIdRlG`93qsE<N{lfGDv0rVJ0>%QOaKzkk=W
ztH@MP3Q~;M#Z^S-8B0q+2sXD|fKrv1lF^&$r3};WU3nbIUp1XWvbqQ}hTi8O68z&|
zAL!V+Ww{Y$6%n*S7&Hgv3|2p;*eu&%vfzK%NuQov7hGo399Bzq!V^C67=oAyrJ)#B
z9=VY+K3wrYM9DD^dUqB{QnqmAU++yh#_X;n`gv%Z#&an{#s_mi4Abe$QG^=WB$zeo
zj>v{shYfM11%ehgr*-kx+6HdKRSIxnY=?D?0dd;A$<6j4&fLf>1msRILL;x!>Yj*9
zhtHSmFn#^F=X1p)R&|>VNhc9aM@->E)vprxZq<ywS*}}vQqd=|76kn0U6XeH9o4aW
zk!7h?)N)Fj;}mprL`8qtKP-tkDcmEDwmO?hN}M%Q1W@1${s&2oC2cmM`(8`LjN|%|
zm@IC{W>9o3!d0Ja310~N(48vto5{b*1!RU`aRQm$9kuZAomA};0)H-eDLCwh^Cbjj
zJd;>BthLiNW~OJB8*gj<p{8;&d+{ndQ35w+c@eP%@3SI@LWht~7wSkCfd){qSg@o#
zW%@li*4#8mIeL*w6)sy-O1#`>Y^x}`DP{lQ81=p2gT0=m{Gu>$$wi%E?IU!k84iAd
z*+Ol&SYXgVz;p2%7>&sABs&~qxc^=_%aY#M+CLQpmw{@e+Rt0sxiU;~)Q6u{E#IVj
ztvp$A>h=yTJX2Hlbt+v`{D3C49!>u9l{M_L@j2()8Nu+G>)Z$4E0Ql_SAq5uy;0YG
zMKG(1e8Dy3tGs6oe7w%|o;%NqEQV+?+QV7!4TG8`|IsON-+)E$NyG0#2u5o)v@$Od
zHF~umFjsSI)!x+z;}(o*qw?maGn0#m8tIvu01}!(&}}Lh5bgq1{Z%_BUsKPyK_nWn
zxzVk}m7y^pFW~Na+IiyDn|#6F<2Boog?pbA(Q3&2C0Ol39To93<arfTm20V<{gV!b
zWLu8sBJ3j}Ij^lh?i2|7iWJ&;8w=$B!{<E0wzl#?>yZ8yqd9Cj@n?7Z&Hz6pGH4<x
z8C*5fLy-fGDacUn^<LjK$A|#>JZ@@seOS(lyMc?fL-ifzMJ-O@2x}(krx%+x9qsX9
zcRCCX9$_xs%#;jQQ~Vv+YMDT2^Xk!5mRGq!Ao6Gu&zpmw;{EPTrUD*Hznqn}JAerN
zyZ_hcSAljNxNRwIr2>qOMrp|IoQIu+&{9~&Cb9T|c{;u6hp26~5srHVK_w+jXq8(%
zDZ`kalR1b_=EO;PBZ-&4D9sFE;;Ln%IrtD1?@HnF*(Dclr^_N~QIuX-b6y-XPCA2e
zRcr>7RiRgt5}LI|8R=U~0ni_L)PTKFHWttC^X!3e#|T+zC>Ft(!#^URCtq?1MmV}X
z76&iVOMrY1#ri?$)HyG*1Oz!Mj%>c+#4b78c`Xfq%5PKup&k)Z=hr4^4*t;8q0+@)
z#{kI9BFUW$Q`+l)gZD=LmJhD)GLV3o$Ntie83`*VF*Y5n*Yf&}qHbSSjRl7KW$bFF
zFGo1SMgrB+gO3kFNC_30ypRcgH`D-ZRHMmJH$USp;Q4){99=(yJ_T@P2HUvhK+EWF
z&(9-`R>~9^bLF-Qjk0T-9NgvDe~sX65uq3Mz?;X9ZT?bZtpng))wmn<xYS8j5wB}0
z`O2w#fW5zn4oN6O5M!&RZK<-BE}~lBB@|2+r@~A$oPWe<C@EA3M;eHT0$XBa6m6c<
zLD8j%NX+Uw=!`0T+n49L*lG2EpGTYipd63Yb4h3xsvR~pphUpVQ16qbT13J^lczdh
zHe=(lMIZ9H|5ns*EDeo*+k<oTKMk2CB<(*q!#TM-W494o4kY^6@8TIeM7aJ8pne>@
zyjsFc&J%?GlFRgiH(JP>#5dZm)}Uo?KdxSX3?Dz+)6Bxfz~07_&g)g_+X@@$G*Udw
zv3xW!^e+}W+Nem*fV^=U%yWuKY$fPZphC$)v17}#bRlcVh2%*lM{$)%=T#NdkM|_v
zK3opaen$Nzmi}E|XKJ@p*7`ud8g~lRZ+@f!ZoK=X=)5ARG3^?jgeQixr_L9Y2p8v-
zcLc_9dT|8LKtU!Z#Mm}Za9pTE6882Pc97#Z&$urP2-{ht{N*eN!i)f|^aKg2`Sak7
z+A%BFbNr$pVrG^>!U`-}W(yyNcj5i9VFs4DhRoS7z5~kbmfmy_wL}m>crRs4Cu{3^
z5wI#q3;RSJgB`VgqI(_v<BVKJg3K6LAN-Jf6>fT$$Dg1n^w)jl%=bH!?du`7&QruU
zs?7O`-Xl{(E%kv5#WS25!6xtTGF6FJI(K=r*w-fKrj4>UlcfMy6LyG`<^64ZjfHK!
zL~{*SILafC1(YjXdrkbAE#FCl3^NS>xn%028noPvuX$BJU5N?9@jHP>!nn_H5&@OF
zg3M8BC6TwcGY=$}mf%f!FtqRpZ;_p4lYti`G$W?<<uOh?MsE<U9)zGOh7kvR!twM?
z2tM^Hu_4D%0%$@rqo}dPnwB>okpV(5euL=rDYAP02cB+-+JG3#H=BX2Ot898{dnq4
zXS9w38|J=8+TMBb<i1d9hKm(4(Nd8LuU@D`Uf42X_>;)*x9yYf*r$f=WkkaOzC;?~
zS}|6eZ0zoPT>-286xVPZ9`3U2qVscQ1!HrP6biH12)bb^YJXV~Rm8^Q0B0r&5Q&su
zVJH78LgywYL-&@M^GknWJOanS2J<u|ki^dlzPv5oqQ=td!cV}cRo*F>Qffso6IPZP
z)|j3RdJ2PTQQkF1Ula&po<V+Q%~Km=2X|{1j-&>NUiX!|NC50diAPuhhKSXM!j>YY
zG1>+T(7>z4&|b7BijzhXfUhISr|PJ<1*s)DZzHOs&yq9^l2|--Q#m35y0Lf(jPO-f
zB?TGB^DH^he6-<OSGbc;QOuNK7nA2vuDEKGa&@-MQB9h0EPBDNAWm*=zhFC0LU^u2
zBFc45{LRjB%lGlln5-c4-~$D`cBTCs)%_Ydh>hN=_622(MjVR-f})JAycg20OePsj
zmstoN48bA`_32`rU%Bhs2xCxhVS+hoL~qF%x}a;K0uBY}1J0Az`k0kWTU+5yCRwf!
zTe)(}E&GgV?PV+<bR3|Yj)t$czqf%GXiBXyEURGGiN9Dh0F%9_!A#y;Z<}W2btPGa
z&!)*n3RLXfx)U2c=+cZtJ64-euj|C})g#_Lf*5?qGQyurj-zVCpN}Ca#OB3MS+Mh@
z4`>YFYRsjac+_i>@K`S~bBU#Cx2`xNOWQ`prRfNZ-{%>mhoXT$Q_)jfg^3!DIT-#^
ze=^RQ2I9Y+Yt{s=@l(!Q)%4ByO&nrYNoa6SvQEj$C9!xR!u7HZ&M~BGBC)o)t>+pR
zcLjHd<stpi>}l@b9>uR%R@Dr)_>g#z+(&hLyDC>Ksdqmnw&}2L90Wi5o2Rb>MXpMZ
z*be)rZ1+(v3a$B+N;&u4i0m>RvJ$WI6uyXjxp$2<|FMcGlJ@oNLror?D!a@%CJ@tg
zgf3_woe1kN2VJ%&B%Zyj3)&@O>H31)Ujuh%w@e=Ctz&#+M#k^CA=m7eq>A3YE^!K&
zFDrbgIUQvRqBmsCNyoC`62K9<rm+KeJfTzSHQBZ_E}k~LOUBOlPtm}p)YAfYL_dnI
z^}QaVpmUyW>m}nz^PaFzKquPI6lTPbJTsOO8~lLhN?+NL;p7d6V`;?;tsa~{Fjh4<
zlftLWKmm?#0fl`Ehgb!57z!Ss4gQQN=qe%phs_!RflUYG>(aW6fASY3t7KImn)F^6
z6-GEy^X2c<Y*7CZCNH6pVd*Nx(5B*Ap{AQz0-N+QIae8l(*C2E9u9AbQPcem>`SfX
z&YiduAG2-7!q{qPf!ZqCZv&`$XzB27#7^~QtrDd)GrM+~K)?EE_M_{@pz^R@?r&6k
z#VI1%K|aECnDc5(-H4Bj0CSZ@ocqt8_4fN*x%tPNkC7GGFVo+G`OQI&^t|{zm;C6>
zg?DE3YB$>&cvuf>Yiq+hQzNmgo4qd`?Vo1vysWKktuDCS9$k-d<JLUuYhDj{eZ$q!
zdef#MjV%A6{0JJDG8Jw5-hCHl0+;d-;7oIW>paY>u>19)Bg~t1R|dRqLaLng{-VGj
z%R(<)qyg8&!jfHSVP$Ql<Y&V6f_86Z9nj~+9Xz-rf8oKFIS_xKx{RNu?RSHJ00=)1
zNj519*Won<XM#Z{*VlCDPq1*ba56d0FiR2xrLSTgh=)SV9sa>|bxh?4|ML}NqSz!r
z6lzYQSouenIokeKnx7}Cl}1;<zyHDfyiigOeUpB$EU9dx{EUgE2A_!)7LX6NbQIOZ
zG#xjwZVZb$4-~t~Vn-xSd@X`vP6Gi5PHQ2u=Tt$!yecbOxyFyO&y{0FKA#7Q!2KiL
z%yuE-UN~1M7uYdpmXscDQ^9uLfK%B{;N=G>q4ws-gIhTs6xhMeyB3=KfGt!@PZiGU
z*b2GBh`C%4I?)PrM`~r**W&d8hI14KzCfT=5OK)Y-$Vf6QdGl}0&FIARD`1aE#vJ5
z`2!FOjup4#%o*fshqSXGUri>q03+Y@P_zXTi~DTxP=GppzZ;v2ee7P>xjo0}t^y6y
zBh?q$!De}~<E2Rtg3}~>R4sM-$9fiIr7(rE&G1m;@j_en=_GaH$pqlwuQ(OSUN3|V
zyRclcoRW~^-L%fye`-aP!|L0Ur_z&2j%bddJVlE(wgeM>@8iERdWQL|`tfp{SG#T=
z`E)ynT|brgTG(lEn=iS_Vl5$o%y9BpI9R6PIhghXid$M`4D);f*JD`>jsd;e79FCt
zaF%3gerzkMn<|AdN-Og?Q!ceW3LDn?8c!RvK=EK}`2CJr8`TGrSEZO!Wgh=(1g03P
z3Ac;?&my`w*x=vTr#aXt_@5p+1p|F;Y|In-<<$CE?BkZkz56V{f^k<Sv-ywnd_{q0
zlYm^|%ERZ9c_Zu#!)(4e4?DLFf}wH=i?1X+A-Yoe6Yjv<Y21m_Ux6%M3$(wx#bqG2
zJBz36)vx&(Iu}KM?3f|_{y#hDh`w~QBQ0)rp)d76KrBAP!t<E&KR!V8eX8sA-=Jo+
zM}qpfn4*JHj+jjB^rPI#rJ*ojj_c=~dphNa%2tw+e-$9&K0YUGrHl-I*i&5-kFV`&
z8A<(RA^)Ng!WR`#bSEm<O5c^k;qD1v9s>jgQtWI2=c!il4(T0x3{Qdcty*1G&MlUi
z9)BO4u8N}=Hq=~rj5*7iQ}rUs^<Ld8u(tAWS$TS&$mEq0<hj^n6$f6Yu#o+eLx{6o
zLAf%qG&hb;fb79vOs?F;udy@|7vYFog@LK7a8p+fq0Vdd%uEhvY#DFu(4}3$iP91~
zxGOARcl+%pftqzkwT`+i90KJ?B5}zO@U{JLQD{q54Pk4HLi6N^1Hr>gN5gh|%0L`%
z`$a>##=NkHxG|P__&mIo=&*gz>H{74bh;Y8Dvp0;1@Yl-YsEc#{(B~r;?Z*51$`hC
zc=fgU7#7229OVfKY=oRgp6#0vIs8*!&ZljBd|F>$(Bs>S4r5r~anp#l8vJKT$KU^&
z{x=p5Hue=HV=Y*rJ@NE#O>-9oJF!Q{Ny^+t1ehfL9Vr>U&(6(f7i^qfrLyJKK;eMK
zEn1`VZ8;7e3+C09N@4VHE_<)JmW6zw+1Bns$lpk;Pp(=?u*|{qK>rYnzxg1WgWAwg
zF1&!H2^rZ%R=8rH7p_t;0Y;RiyoIxNTvk-K?C?|`^w}6fqXqxSG86%lw`UuncNK&Z
zWb^di#HWJ3e`f2EV7{;==iH2Vn%7{(-%Enj!~VRk2<_RnFdCgBVqb3_Y1OG3IGFs*
zVuYoj0S9{!$0fX@Ku_Mk$O=obeNn-t<Y?+sBul;HkSoMwZsom}FG)3>pB8nh^;@nO
ziGppTc;~tPxI_1KL0lpC{7p)XBUH=w>0&ir2@}Nfi|!2}9%OIJV*}4v(dsuwm+fYM
z9Z^kjE_YK32gCRvA)m`_PF;w-B0jINv9YoOdA?#o-0paIKU*k00(Vm--51VWCJe)z
zo6s8=f|)!(V=?jCY!`!>(C{-!_1O~#>xG9+Yk0W-@@`#PTwZs(?jAE1VVTI+ci6#6
z&Q}USYO8crSew-`UEtQ$N_0t5RleyVsYp;t(0sgq6uCWqc*&Ron9Y}3uXuh>%m_e~
zSqr0}s>)gRn<h|vWDZbMcG#${tQl_I+aXr{6Jdv@D?kjZ)Nxa`4PJ2uZT_;--nzLP
zJM~p3@Qobb`Bp3X_I@!t*gI(Ya=pJ>R{gxeyK}!)ZhimXg9`jrb?f@ShqQC2NOLD)
zANCK*e!WQ`e=!sgdjZ;$N8FK*>dH>n60wN`7oI_2Rx_o#%PhvCW*|aQ?(z#Pbf_TV
za0OPSGvnl<rn_rbWhENvGjjK~Y0fRj9fnGs=nsI7*5m36pGz`AXLumi#(&36fQ+&?
z&gC!^i)}iG*wB7oO1h+$41#-OAF|`0yvCRK6fF^GzKxapkB7vS&ZF;KI2Cg&U>eE2
ztx=65vb+(B5>IBj;~~=HuI)o-F*{4hyG5R^+yQTAgxAz*=q(!|=c@A3Y#ejBjssx<
z;UKZrP@mDx`Xk79vLGFl{@Y;nTEd^&Njr{f=5J;*EW~(RUF8=^LEhP<)Hu<)bSk1I
zHxbSay_fn*gb>frDK7_TywgM*e5G|?&f}t10ax9~9RPDs5OOGFG;qLEaZ5>5_zqn>
z&k@H46CFT`N`Oe3kM>*^vrje{53cB(oZrFEt)hx1R!Kna%eGoPa8|cOny}-s0*1NK
zjOH(CnQ`w@FqdMw^Y#a<m}lieUWcYQ?)}R|U0)jEUx{lVW!F;zYyDy#-4lhKIxdq+
z=M1mOjVEd0G+pJ9va&`jamQ&)Ewqa2!;ZVN!&BX5h3=*{sBZ3M%$x8{8MD<j8dCF&
z$FYU*i6VgVv$uS|3EZ8{e-4_gJ4N{A(q){?Tmw8wa`q|;xql8q;?IejtM3!MUF-Ts
z){vOFA?slnE%EdRyf(>Z6MUSv1$(0=!r5>WA9e`@{>K3#g6}&qDFg5(ag5_EFx&)B
za}|f^EmRDwQ;ZtI>dOFrhScA{oRL5=vDha$;}5M?r=N;1TEr_>oWDN9AaWkb#IM1c
z^&zc)Y_()3*pQyxiDq1F75X8?Hpas7+P}dW-kF^Tc}{mVK;%7D7*qXen`bcCT1(2p
zt|L6er}y$Zc;4iu@%J_%y)^;F?T)_}w7Az62t%-G?oSe0NtA*?@8gs@MiS=$T!q$u
zu?mVpMbRsFeg%W9MgX7+RixuGTOX<oHikQJ*2k>DN0!u3lL$4M%teRGy{G<KwAIm|
zryege4rr|6Ik!E`LXRvR-adbY&(OAUa6IFGl)>@_;a)AUYQYh6u!9E{rIR=HmBhqT
zu1Ab`Uls2ON!4*KmuG4)_Hdr7p%{I2jB8C1v;1)Q>iks6oqtqcq>UGN34tM)MwHP{
zTFgUoujoLuoa3l$+q&Y;=1fEm7azcb&{lBaZUV8L7`<@NV+Uv0OCLn@QLcikD$0<g
z;xyg8R*c<}%~V9z)qn$3booE#7qfwhAg1_=A`W32O-QM29w?5>3_~>ci4+3z>*qrb
zM*MChkf+I&r$PF1(5r>=ejCKNRkbyHpl%+BZyIVtkP7+&v?k?X9&HnQ5jsfZ4-<>M
zMTWGvj8@g(R3Q=fTiejO+dv1$bUF%d-=lNuac-)&s3fhYBo3nj#nkKee=V7-yN28%
z$+HDT*e&{^dZkt=E#^^+PQ9m@gFBGkfh7D|QLLKUH#(nvF9S)s=+itc@|YyLxUvPP
z>Kjqfj!+$ikRAi)4ssI_DnZ<)_8B|HmVsf7=5^V~I{rq4i~Y$>yTtW3A>M@(dC599
ze2^bu2gmV&?o>6kxq%{AFRHqWs*jkWw>~~K$>AJo2X(<JD+|TFmPHg*{N`diwozDi
zu**V#%S`|Vi-c==H1Rq1XeD6Nz3h1pP&8`3XX2G^RmCyt(JUn~LVhE-t#j{nxXdi{
zm#OkI2!{KI)k%aQb)=7GNNs_RYw-#h3)H2e1S62mRn~lVUrtV4`r#2|FW*uJize)5
z{gXk3cjbEm5ScM1=xOort>bx?Na58e8uhfPm5ZxZ7OLsm(Tl?hKW6vS>40M);h{e$
z`WKU6cmeucaulr2OvUDl+;|m}9Su-?rO=L00%c-MbA2*SxbygAM-fr7tp$m|b`NMu
zEzE)$;Ycib2IWkRsC_5c;){wd)QFmjD+9P1xD4ogds)D;GKph@{L@kT0UHU5I3W;w
zMu<Ayr3CzpuFeF#>Le4`unl^2lV+vYR;{J<`wSN4HSx>LC5QnPX-28}<0wH}`upx0
z+2UMM`#C(fiw1{~Xw3tz)-hL#yk6Gtec?80b;#9A)y7ARi(JX2{LSjzDV~tV+Rm|p
zjsi;!o?e(vwH;#TVBCa>j0BQ{qz1u3&PQk=e=yT^<^%<y7W#Wg{V2Blbfzd%Y7yoF
zloa+|>WO((u};pg6~>`9BRAsL=J8IFzfO}`nZ_t46PbehJg!)?G!ff%puiy$&=G?Z
z^O{IOXu(&P?D>+<$8CNc=hYCK8KfG*P!jY<7nBE3{t0kHWwT;lz-cnijTRldpL8@F
z5fC)_Cu!y+MO13sZh67(3Fh>-{Do%43hy&+``bVqze{VJD`*-+K&muZN_$p`S+cW0
zXT$Oa_mW%kZrI-hNf(4_ARgGN=QANmN+(Nxl_;YNoN9(?%DJo?Zsr8`AauRc5+-ma
zPf3jeHpH`V+g{sQ%~Hz}gi<9nabewP?r?R9Dt&m;6!fG>hN^or%u}A1n6dQ%BGvM-
z^+BJH-aKmB0wP{Q&7!`{;I8?%OvMM6HdE-)bd;X))$M7Ui^H$k1@>|F)5jjit#>*R
zQc^k82&x|`8MbIEXCaYaEzJW7(>>xY=<>aW8GrE=$QVw4bD9VPBr=`}NKw}K)0YNc
ztr6&J{b|=w9JOV1)05dL9nh7)J~Ac@L#4Ng?~SSd6$Q1!3mDItg{PHAN4&2~Al~94
z45D@z`Z3?wHL%HLe!Qt5v~Zkug{s%@BH8lxVx~}S`?E{_(zSJPle{{pr)hV{!=u~x
zl(V+X3G^gK<fPftX??;={!~PxOZRj{(@Fi4NcwvaoirXIa2ZBL+VOymKc4D48{t(v
zAU0=C26KuTEo2TI!-p+xBSW+b<HdBRDM%e&gW5MkiD${E%S+G~-cyrD!sjZkava9w
zqzRKA-DZF`2RKLekEX|9OpJbTfo{|!t3OJ~j$**|S_lV78wnl9%9xxFCx2Hqcia8v
zIQ5?g^qfqPX>Bb3%G(6FX{h`$d%ftdxqz^Ox;8Fn6_u9zS&DK|!du=gjt#nvg5%LO
zP(>89y6|wl>2P5Dd|Rg0;|cX|)R}cQc1DWG`L@OSE)e{X&Svn=SPBOnqdIFY!Yq#?
z=EYA@`lR*@68D`@ZD;4?84$$6vHZf}iL4=xSB}Re`GPODxtwrcYTAMcP<g3X#?Y1D
zPtxA-M9B(;qyYvO?1dOHOdRlEpe4U2n?uNF#|_8FS1>3v8X|utt_n2bmAhLBY(z-K
z)pw0V`Ds*Yi+I`EBgpWepAEIQtyoY5wGWFdm<TD?jXHc5A~VrD3+SLF>p>hi6MqW9
zUE`KAiy1(^#gv!~u*CZ!-s)*R{nNtPs<;B|L9v*?yk?JE{T-+1iO^ViLUC^0UzaS#
zGIwm`q7~H#y4oz3k0d{WzrqW#8y&Vp6i6CJWWbO)_)4B4qchR%VAm3%8fl=ahgO^f
zUN1N*-Yfn9$<FycGpjG_aXHU>dgkb}s0E(k)BIqURZ>7rgNCBruvje83PmTcIJ6Lx
z7WK$w)KhuX=nO)&Jy)D2wZg;huds8@3j#I8txUzsIjIN}sz?~vR}i&Nt{(}<ZLs+w
zCiE!-R~gjq9^c}xa-q9WlPCsyQNopdFxTj}l!bA4<?k)o`wBbAv?v-ZoPe7Z*tgPm
zCN5KZh*bxeIo#sR1rw8;_XH&PrP<!(FCwPV9^XjEFAGSYv%w^!<W#GW6^}Regl%7S
zYrtV5JpHNfm*X|J4pPt8+04Esx@?k?qEO^^({EZn+0|5DNgR-N{FV5R))_xYrlMO%
z{sLvIh^msK_0i>5Z+dg_aUFIwJuZ2a6s5*YA+*+Nn1Zp3s%Rl8xd1kD9iWTJvJ|u)
zRH*BmA`w(T(wnc$xQNjt*Bl!jc~)X~)7{7<?)Uf+xMOi)GDk+qG{&39EM|R-w;2W_
zX$wBiF7}#^NtHjrUDcJgm_~Whaw6SoKbYWcTVHw8{Jla~Z)s5HQ1rPxUZiBZlklFn
zA@kd>uq@G>C(o<mK6A47_OV>r8!g<?L$){uF0~9d<ZGe65@aFf_2h-k$}nx)aNtU~
zcOt|iKKI9-fMHS+977?`xnF^d8{jh;@_@4(O~zR1BPC$>`Swf_eR1+|-&Gf=Qnj?Q
zU+009iy`BJaMBX!G+sl$`2`#3XkZ{)2$U?5$+kT*j>K_J(vSY_CY;Y}vd!?(aiZ4$
zJ+P*Bl4Na+*dlS&rd?+D3ht1>gEx@?Jm$CO?U5^@*NCyRvoWk}Ho9*dbZn?)y3zK=
z2WqlAlplE%kkJAR>ieOmUnZ$kM(=EkAJxqHbz2LVkS%*u4I4T1IlTmn(&Yv#2Objx
zn)fF|#Hf=Qof(son*&^$C16Ec!ooEoJQ*!Rv=@SId^~y&<+laq6Su5{sr^iAMlpdx
z-&@({NY{G;C=kLYjguakz72e2<!df*@l5Uy4|G&u5?hc8&0jWf(wUf$l)+drIR>NQ
zRcHDkKBIB&$jc-Nv+v=<3no#D=I%-EoQ8kv{l?4D>$P9^YJ9FB)UAL4z}s~Qk(l!z
z!*(_m#VzDAz#nxNEh4g$Go-lR-4cbDaLdy?G^>M~8t#U@qsRW!N8r8>Mu#EBGr+W&
zF?x?#YZg-9l+boLCSV|I<`288^CT{Zd**N{6hb>Nk9rU|4rj}@jN{zpph_@*7IxPZ
zb!PGXPAfT=nuAQK>{h!fTA6FYcp~~N$>WD(@{F&TNLwQsWHxOH%nMOijp38_kU!UR
zC81Z2xm~3@xiK8wyt6}ny+Xb&J$hb5d>^N&Kr_Jm#BAGxT*zxqJvbv?_;T=6@J;&C
z+$_aG4j47*c-r24`laxvWCxm-0uCY&(7no_uYag+G+<EoN=jNLfkgNwBhP?&mr#p$
zoN1FWu`%UtvYJE6uX(A)bO|bwBOycqA{f)%&<b$X1u6cfsS~HTe4BBR{d{}P=EeBF
z;eWY6L4V<;{yJG6ewtPx{W>YEz2p6klg(Mk@m>xW{Q@qSLbHE1OrsR_wKML+^`&h3
zO{9_>*~ls5iD|ZI5t*L$&regU=S0;G=lB7tGEmO>cXnzUEDZjJiH89dr<j8Wi8n9_
zt@q%}8S5HZL}&eEh7GQNb5b%IuP%u~PS<z)rFp(6^LBz44Y-!xf$30KyC8-+;bh`Y
zp=vR65oM+h2FMVtao#|%!dDO}=nFQ)p30F<t>X+xdpvgYWXJjX;GNUV5{)idI^wf6
zbfLaJ7RiZ~bN<T%)Lnw;y%%?ZEuod;;;f!ii4?H%*Q6KuO*u!q9oPwcRgNqhkojwT
zNE2m!GDZDsW6T)oYKfr+)XwN7J&Tr4j*0xATpODDn2JPWl?Bwtl_XnAu~|JE)g6a1
z?(rHcLC2G1Xc5AyvZG0AZ`{9`Wlr!h_XwOHLi^xcy4>U!Fj)RXIZ`V+gzMvcBO6e>
z_ShX`PLRLkktTkLMi>JPyj_cvi-dcXy(SLwX`FjQ)!JI8c$Xd})}i@YeA+lZnJlCQ
zPhAt^$|kaN8qq^-geOVJ{!w8)$ID6O_bHWu?J(Wheycb>6jU~!i0{-S(RB)AaimeZ
zTD;>Y+^tViag`Tv*;3=J5COa&#w1XhlnNMs%tmUNPp3^m<ZE+=t_gyRD0AHh>=|f#
z>e8=nJBwoJoDSSLFu(pyt#?Q?sj*473KC?&Ish=)D`sPbhj*J|qoF}T_b4C^MUzU*
z8{i-79w1ykh<rvc!m6_9pEG3SVK#?E9+vkA?%<_U;}sBQz$6QnL<wY8*mj`wH#UkB
zrx1BK!^@ILK(q=?n8QHEJqv(x=({3*2W(vYLqj1VB{OUiSLj0nac5dSP@K5#`J+d|
z6vnk1?jR>Ee`HZCh(h{sizF;rftsK!xyfPA*qhM7;oi&<(*5P60M=9>dfjjPSAyR5
z8mgokJ<xY@{~CNzMS>lu{rK;#!E{X7<NK`wV+MXTPl>NqsPtR=6Qap)IZd4Iw_2CN
zZL9YFUJRkSH@LLlj=^_M38=S$zR=4$h~f$XJxkd}9%joLa{0ISW~(?1#tJtUp`D^(
zi*r5)Faq}^_iwH*asT%DKb*_unSTHyCcaBKA7P&8CEY}K!B-Y_&sR&rTR>(G9qv@7
z#r;$+9MTy4<x{>Km4Vhj!`E`^hDsj%O)6H_H>hwQvJy~Y;dZ@&I)uh<Z2UiKzNL0a
zY4FO?bf-!c^~p2BtJzVTl?w!mjTW}d#qVmDsaHDBL=qCU&$=K@_=6?%Z~-cazD4u8
zlqju$l#LW&Q*Hx~JX;p!mOFG*1(&Q52&>nW0a^x-X7}b75c>;aV|j{Me64l!vRjgE
zz1^0fCgw4Xk?QVC2{7k880l!$HJ&Lm-10DaKH01`ViyWmUGU1S#*;G*Y2pRSt?WUR
z(nqUu^0&XiDqp6;Hc4y>!K<jCJ`mV(l}PH2{M31VTo}c4w1)}&Vy(5}+D8K`z|b>8
z%`_$c;SKJHsfq(<IsR19E7o!|)boda&dp8ky1dsp2=k(WP7~0Lb7`E-wmy=!(q|@j
zC0u}YPHQ&=ZIT&?i=n`!$k_IG-SMW`>2pw*>mgC|<&_Ivc+KgLjEtXMx8J}^M8IZK
zwIjz8r~d4jm;IG)vy5e)2I{4qi=ulXpemwXBoW?7q^bkguSU#4c(~*5m9@Y7oNAhM
z`7z<R$nTS-Zc}%g?1hXT^4=70Cj)yM!M-OgjhVV*()&yD2*?zB{F0o5gAGEc)LUCL
z`t>6a0(<mL<W%O(J6?QrN8{C$XDLGjDQ%EZJ!=m|>T355{j`KZh8i7nvz4SMD<F6)
zUZ_zRZMYJn;;d3fyMmMOMys(QrwN#N9S&$p5~hE&AVP}!sz#3?4bM43h#a+K@~$5C
zy?Fc@ka@xv9gNSu^N2){nuTvGuJ2^c8l8{FMax2EZF;8fF)vH1bFB@((|t{AfTp5y
zLkj$JR%MAD+WyJ)6=I3?&3P`SDzmL*p&Yo<=wv#O=|yL$_XdLX#mUxic{<-<>NxA9
z(09jZN8UFWT&G-WcdYA(RN193(4UH?UXQCz&NFSg`-gR$vjeHJG*a=bXJOfSdvlw`
z1gydTj+y$y8%Af)VtZ8J^0RuA<@twZ@v?hEnM6Dn7X0oOST>bzKC2zmPk7B!=1yL6
zN4Epqi%OsgSu(K7lwAp*xF;-${ou>`L9jCLej3C4zz*bK6R&`Z#X|4*=2BJ;%9hjE
zR^)FU?$Va3Dsp9(1>4~KvoJOCG`a)ys=s^8ITptdPyYaQO|IS4kO&iXE0WDcQ#jq;
z9oH&?$e<&uLpXtY9>Pw&UD*r}fLE+<<5m*u;BH!#a-<5bSrMq9)RQ1HdY6DH=odb9
z`kjC+!|1m@KvtMOh(v@+EE8Nn*iTz*vbloVFpn5pHhQJmLM;4y-N%F6*%PPvbNs^K
zV5($iSh^*5e=*DeGT9jFZ(XIJhl_i<EQ&?AsYbeI8H5^&u+xTsk#m2DSXZdKWBzYZ
z^V^4i7{jwe&8hChiL1gE7%_9+C@F9V`tv$V>fMSW?KQkYwL>wj`A$~fEayoL8Q<fi
zx#s2LQs0XuOPxJv#oP}MkFBI`6gbD25PyGUF4zsx`Ngd*t6(IQG$hFj59N5Gz%8Sq
zsyWxgHo@oukBg8j@g#h&6Bkk>#$x$3(Tgy0oR|XU^Hh!3?JR@_0_3U^@!VbttQMe`
zBO$g*O*iKGlxv@!Je&)Y{6kV0BfrI1WkAX7QmBb@8y%DXtQ5JInU}vau1-wa5IoUF
zwoe#V<LHB3ehnqjl<w+wqRZ}e69k#xB#$ialY3eA(^?L}SLI#;O&Z}!B_3iZ_@fiq
zpaP_WW|X_@{r+_3ul<#K1-h&}#WB@aYaW#b&01wOv#%{gU1^Z*(a2g)=p+i<K3_}m
zC{aT${!$5E9IKN0yg`&N)`geal)he^PC^@)BCcKU8e+{#hSrochg#9z$y08jR8ah~
zI?~CLvU5g|s&`Cj*OaL3?QDM`3>W`ZlenlbIu#)<&tTf|6kxm-ex6AsVBh2V>TM=+
zoG_A}-t#jJ>C<u9&^W23J;yBVyKS_!f!k-nVmiEiF|(?}Fs8)hDpB*s^87`f`amOj
z=%A?;a{Ibs2vT!dteo;|y8Gbm>N`tZY4{7A3flb<^<6FQ+x6nkg!KDn;A*P&iT4NF
zPg#%Ap~P_J723ZKj0@%e?2DHcH~9@K7@bW#ZefCWR+;}njfkb&DCRXqc*hbsxI&Hi
z-xK?LYDCL3*;@(l+(bdDy#Wa`u>S#ZK#sqW9@>#fwh~uVQ4WMy(7xnDf(`_sY@i%y
ziIvI2(a^-WBfhv|X;Sp58;wPQx2mf(-yJ$(VED3Ps$&U@AguW8z;9H!J#w6t`s<S_
zA(IJ7j1x#-Fq&Gfc84z>*=$zpc<-=gG8TiLk1+|@YJAhnkqOz71SMQkUc_e;YXi#;
zYC{&Vq5q6xSd%#ZPi3X(gp29<m5Kr3k$y8ofKV#|jPXcSxyP9oB<Oz-AgMLO)Gp!y
z9Wxy7QSOP&g$V#$KWev$z#TPCu}^}{4bh(^qk#!2=Qf~M`z_JoC>7>m99|*b6QFpn
z-@CUC?KJ4M2FK<3h<G4f%4jv=(lr#iPo3RUBfsZ&%QB|soDi0yOTd!D@*Xrw_f(8u
z8@kfwg!SvfpOSc(wM{qDrMgFhhTqJG*FBtYn4C+VZdZG>DJ+MP&=~@ZD6R%9UM~_E
zXCzv|M5((V2QbV^I<u(+pczjmmB182YDdR}P=Uf|&a`Q*It1au2K5OZr>zgchV!*9
zOb1K^1^a#y;ns<bNOU*qW<k8MJe`@XhETw4hHa|9%)z2^Ds8U+v2~y2)P0`QYcvSQ
z#9R1RA4fzkhy|D`t7lvkAq@yGltlWLc!|8h`*{oGD%9O;EwmxFuGJ}SPb5Oi8Ns?%
zeO;{|dOCHz7z7pWyF_b?MRk%&YgyhFO{enKC8Eh>IKm~nbd*V|n=51ELp{PELHCd{
z-++n9THf2=yzy~4&mWuq_&|Rf#@<bO7~u)#?4+oy085;?tL1aBF<27>_2Hw-y?l|z
zeA5!chrrVU=VQ{|TFlBq%Ta-6FrJ2CP)iDH4PMww(Kc(+*|~z(Js%E+%4t7kc?T}m
z80%l3s`*6CQZzPa{8FN3C!!q^ELG!_HRfh>5j6vlZiASiSKJUzxqD+mb{nKDAE{Lb
z|K4<tf%Ro%4oxgi=G5xo&pZ+*#awW&iOoxLF2+1zFLNbnD*aAG5zQA+#Oy1Lh}nvZ
zh^4A|4T7oj`2OD@m<X~47C00sLV`IGyRAa9fkGIA8I>Ab(t1!SheEP8$s>{@O`MET
zx1yCv+CW<9FR!0R2W<rFwaxXM7R2P;$yL!EO^9KKXM~AWX#BG_xSL#h*dPGh7EN^0
zh2!zsnoG8L>$w3Z&{x+%Jw{PYrI8dJ8A42VYOm!iKYM(0)``Cj@1?N`lL_!@<KFYk
zHkCo&y&J5Ss2G~(RwmSneUejGCzMWYw!96E{_o#MSghyEjf)#~194jHc46vgww8h1
z>}DdX|34469_{?0`v0xXO#bJM?T26W|9`~i!Rl>%?yLs;w9BDzeFjujI7E-DvnidU
z&lrPWO=!REj)o-flsfocZ3XxX)hve>F5hu35uVYHJ)=l|7N`i(JvIom&N>L(9VaU$
z0|=6}oXx^XNN=NL9gRTWK1g^Bbw7Hj*4w<PuF-(m^nk4>2WKOaJkBrHz0Dbzg0UB5
z9G0Dttz^7isPtB<0j(TX_OdW26?^y!xBc+RHnYI^{s{TE!I^tDXZ#tlWvLBy=v$Pf
z2VK<z^Lyuzr5)&QX4E5;RhdZUtHJqnI)3)xL6<1Q`Ve+>XQPh~#<Px&D4RU!$7A_t
z^U22Ami>nHkU-*cf3QC8^;7M)vSXKct^<<#2DqW_#TX+UUZU=z)x3=lD};(a!5iXo
zYA3;dy-{lhbK5b>%I}kDZxDCZ&tH1aa7cU4R@BxIrRLmEa8TVnIhs2F8H3V|ogB3q
zwf$BptaQpjsZ<Kf!S~<OMk|+t&jJ5@`7$Uy+*-q<a@noNT6ec1N;(zMj;&~F?!GB~
zs$5lm<yxQ0$g_gzWB(JB{#X6{)$Qn@`d>xmZE^l}m91Pm-aw&}8SSUa779DRHy@@R
zY;AcBY^EF7NjI>WZs3vAK(qcjGla+K7M_^t5C|XowKM&1W~x7Rt8Z=q*mJQY__2Dz
z_aO_=<bjT|z@ACL+oO}c;KTc!?VpJW`RAQ)Ha=}{Jqfq^PoGpaK0V%i_;`E!=_Y;c
zJnC-rJKa8gjh=QM^*Z4r`ugzcqn+;7qYiz2^t8XZx!FhAr&|yEPqxBs`WkjNyN{yY
zqY7H?J=u61hTQVz){}>iIvXgxwf%7O$)iq$HXdzsANRTs(e+j*denQ2HlA$sqRwU?
z1)g?#-Hn~_F@5cBKJD~3sQ_Azwx4!(o_5h()bB*wkDu(&*Nr|E>UDRxlZ|e;+3n(M
zFM7Jw-N8(@!^hiCw!;uzcRL#)6-L)PH2WvLkXwHG<YDw^^U)UO^5o%WcW0*uXl!ge
z+<M%_OgjBXPapTYJfxjyW24i@@OzKK$4@u6@pNOS8}2-Ogt2XIZ#~_5y7QP@-g?}5
zyb(SD7`LL$&erBbG`HQOvGw{G$D@Z2Y3iG3Zs*ZP`1s+YZ64iDxDj>$@+X_!t?tt;
z2F%vut*!18fpfUk=|@k(O&;@RNc<K`cel1XPpC_LeZ13sv>Eb1H>rUqn@{m|=jqdp
zoh@|I-`<EGKH{-$61>9=s)m*~pN8Ar%}qdbGkQp^Y+%e=1jWaXw=w32+ntS0w<EZ*
z+1==N(8+exdlH7*4Cl_%Za3Tp^mm?YMLT^07h0w!2xlV9<?)m7(au9&peNhiCy$?O
zG8S~Zk2kiszo#3WsNe6Sxp4at!8gME=-JcoVP6*F@#f<v{jEE{Juluh!T#ytF5esM
z)%NR$b$l({JIVw~NVWvshZ4PnbDbXSwtfm$yVFk<wX0seYt>jm_5SDb9okjA%fd>~
zp#qhF<SUY-`jz0U5}a3pxDxzQ38tI$KOOTI*o!pmZ)}=udT+C3Z|*z~?%zipi22*)
zJKubB@jm{UV_KlYUw#IS-r8o0El+~`!6rZ5-0`1o@zW>%!-oh$CA|mI<<2&D>2$>;
zjJ}ghz4ddMD#`c9Khswxj`Dl+k@IqMho==n1e$(Yd&!w3IQGCd9se1^aeUMDpKak;
z&wut1&m#XBVE0YmfA$E^&irQ>%s1!$v&Sj8`?Cji{Dw_L&uLCLLn2I$PQIwpubkog
z2SA7Ci`Ktk+fkfWAztFlqjQzRGk?QfpWzF})yEeMI>Hxr7@-Q&P5kPK$oLHdq=PSj
zR){YEB@Kv5Zqd)*XzU(ffgdR6K^6}?{=+SP*!3Si<cB@~;Wj^v{D+VDVc&na!w=8=
zhmZN;xeZ*QwiEI>q<0c;8?Fn)lz0>yy17m~O+7Jlre~jsKt7Fjb{=Quj+dRz&f_q8
z@+boXynIL`y#Mg=Rt6S$89v(X_a8kBGcdu+N1GebqpipN3~cc7X=mfn&XXtI42<w{
zv;X8_?`hb{z>1sgL>pbA(HWR=yrO6c`crXYl~`I7=V3Y=+%2jb;J<g50mI^lg5vHg
z=qkSXhLtehy1k$+Bu##kp`S8lU7UA@x5R`mB>dRNJ~9x_fAd=!GMsiJ3m66oq&k-*
zGZ<n`1ytjB_TWKqjC<a50`f;4?*TSXQQtZu%^-WN-^ot-`{2<|8i?`z`?91@c;qSq
za4coL`Prfy8@#W-QR<}Sn%mi)+uTxXa1mW3(bP_=f<uVLsmKgLrwYHOp7yXBJHA)b
z5dlG`)x8IhAxwbSoK2O9nC^T1PI|RHIIadyo;y_F{SNO$r-uJ_EA<wfbE<*OoFa6h
zdSy0p%4}_WWgb1vDf4j4FY_d)%=U&~=5bybf6R||a>_iym=~`kFI6)hcB4G)z<dc?
zd`MXVAq6|}nJQJ`b|=^wNtC)k<Op9d9Mt$AX>gdTX>=LQrf|W<Zd}ijA@{uH4NHeA
ze_p6<W{5px)2(gdEn=Wb8KNSv9G^a)sZyOzNTSlI>YLZ8{v=a<>pImp88hAL53f~y
zCtZE}I@Px}($ybbtNM1j`p&hgKS@`Aytw-RJ>&X+gHKNU&uKL5Uag<sULW)I{~M1V
zZSSP@|HN5+)&Ktyp9iafS@B?PP5%f~it(U&To2Bp5VnT>SRz6-;bNrfbUDHcUy8=V
zK4+P9ESz)AFK_rM@G;oj{_0-v)xF@Wd%;)tg0JocU)>9qaWCi(kw38AZd6+|qIc~#
z=8ndF=EUfcN3CYNLA`G7u)X=47&&gQw494WP^^a3xrx9=A2}_VaW+s_*5=|lG-quR
zLPC2chCTQmD@z+g`&3B@mnp|puA#ijil~Y=xm}wj;o(+$%I&g!+grFKATJ3{H#}`~
zXbzeR(d%s`*v%l%%hcGP!I;9$bbG2VZnB{!ls7cd%Bv7cQjDiavx&u<pCBShH!bA+
z`Lw8fQ;M581##~a_g$xD{iJW?IU|vPm3`H*BH5u|gi`e&{A9*tz-toi*wHZg&4aM?
zl)U$G<!1vEI@8VtVO&sXXz|q?%q0^WTr_VrshFO)nF5L7ZC<-`I#Rj6YKJ``VAl4@
z&L&}Xz(B?VM4V>95q>;-?%d9!En0W1zm2@Br<w!Ic$lhv5D%BDiDmF>hM$(K*-O_%
z0>Ds%pcj3N{m5jds%rDOt$JvT@`j_~+ON@Ml<8RQ5;|++k=wIZTU!AN$R$D|;}GxW
z;po!ffQsYHt9u}HqYkY&2m5{Qy{`6pf@>ww^{QmRXtttkF6~~Vy4V@5H^=p)Ch=Hw
zo9g*qoS5L(Wgi<A0Rsu*aFvN6VH`KneIJ^w`c}ou(qU=z%1Q7`$4J5A@?@%}T>2PJ
z%5EqbRi>?aYQwxHIUfxW06F*@F9cO_?W^gjHox-<Z15Y2TtcwV8G407i_Mg0kPg|_
zjVyEMPK7<8Mq<94ikr-|OqrVI&6xVXwfP2XcwpzI6Mia!r?XG7mzpxT<>3)AgW;{p
zfH@*j>1;M(F+_EkH*kY__5LA;g)Rx;cou)NR_hDq0z1pU8T%iB!Ap~(d=3cy<`@lS
zHiL|%T;cZ0IyHpkLBx!iokonAWa^#BsX0oOLoQWAA!)ZwtyZLN+nKI;$0pb2HTC|V
z(3JK;4jfhj{r%Zee(@)3{~1k5D(Oz4b-pDl&;|CNj~_kWOzD4i9#QeH`kz1GQ<SFt
zMjwtk?%@xSszyAVeR{ALPA;KBao^sqiYTQW+GXv~Mi9IOCmLP^RpMWVxrH7ExhkZ>
zvQuj9O{B!^V<UKTWF0y_I#<CNo1gYna2>ERbY7oD99Iwqs>DGgkODeW<*>j3+o2i}
z4%U_bQ}I%L9S3xBNl;Qckd>yYv{L4-dQmtq#;7TM0=U5GL}GYW0<lk2&c3<?$HJ6;
zI5d>#%OvM}g-2TvJs18)JU=!KP0m@xWYjA3JYkd3XqZR<Sm<Sv2$>*9<2W+$4)qvS
z+`^I4nXz9hLyUXBJXa21W=cqHKbs7xW64S1Bi3!iojMUA(Mq14P3zZMg$gqzhKaMd
zUTpO$IS(cJtFrK9g-<+`G?!{}6G@r_g(SlINg{*Hq^;hjman!^${3Qx>#aACk(Ks@
zC0)qQKhzKRDq2CqP9sJ~<0xiwG!NXTr;9=DlscxeP#42Wgu|o5`r-Zwb;Np%b)_-L
zQOHzJX&NU@QN*NGQLk!gRSc_l7_qcEMe7ps^%PVosEVx@!N+PWSUDkD8l#D*7&XNH
z$<aYYYaoue9jba*lZF6!e}SOw5Y+>#D)fl<YSjic*F=4{Jkz{eCAbf)O5^q6X}fuJ
zda_%yDh>A;b0>Fvqh%_$e*W?sNH7Q+smw;wrp-jWRH=_)n{~AGSKJ)w3v2@NjiFIP
zrICMF2Jw%EAMp)|+9&F}dnDlZ8UH?mb`?L<4I?9&j3gP3iI<=Dxe@2P7e&GvVWSTH
z7(_#^Fr9SIC+b^oHpVw)03qMH<Ew0A?473C5>GV@brN2*<KagYkGRd+;+*H~P$+Me
zCMx(=mZ?{IQ~j}qG!oDNw(6}$t<3LB>OJw3htc#^bFbYFK7S7EQ-nCnd3-dEhB=S-
zNSYrF_Xk()wzW*obRBFGs*o@>r^JRvCXG`vn@qv<BnIFG{4rIJj~g|N2W3Sw_qtJk
zwcBp{{qHtvw0{nNG+joYrgWeyNqCizDV~gA#-l8qmGb1Dcd%9@^qsLqf<%-i@PFgV
z(S+U`Y&SvT9ndgH#v#c5$1om%F_sEklmjV}<UNGj<TqgTb=EXGWlT52*?^l4yLh8q
zsyXwSZHdaDiT10}Xdo(?=Xbt=d>$bw>2s23o5!u^cdW{iezp&Yni`XG`CWpEsj>KH
zyZyfe`2LK)8+a+W#6xy^)c$?rY5O7`mUK=bV>rf<GQUwCW?oMi8MczDDO-dDFP$6)
zw=*+2BNgL-6EEx#Q#HNPhaSmGG2)F~M8s<J66!YM16ui;aDth2Fi)MNw?3MjJs8J0
zducr$sHa+H+1l86vi4uIVf0{Q`{Cxpo%QqS#o&%k6pv9FVxyBNDMa(pO3&4lriscn
z_@)5UzR@=I@_c$RX2UWh7cS8c2<$@o08*MaO2DPz8{HLC5Y(X;uxtq=R{`u>r4N{T
zN~_irTrH<r13O+>2(!#;^2E#FEhE<OV^@25l59;sB~Mu41nmQ6P0jF>_URuAVdIL%
z*>6-g65vCCq381Li$FScAfR_0*z7<TM3DYK_o+R`F-!J%B>}#9&PjQNUyc*nhN~ta
zK;kT*XhQh6c+Kh_!pS7OT1UMH3~O<X=Am|BdQ*lR!;4musg`9;6cp65s)~5Wi>?Yd
z)2kgG9n=o!y*f`+iHZV5C9q8}7;Ip2@$uydxqXljXHtlqFcYR1!RwihO1dnL;?2-t
zWgH0&GrmKR)uFu>4mko5XJ3R(<7_A%T0IR5%%dcwU!<_BEVfw|Gi45J#EeXLdiKvf
z{AQ&1O=gFT@VYuHW;8_6vuh8gp2ONSi0|K*j%8m(|G>cH?6$=!!MzvvWNUq6(|Oac
zRW2`XwlsD%vC;;RQE?+~D^!|Rzd{H=Bvj7#XJT`z8hUY$n|;9k*xVe)sUOWIk`##J
z9Pn*}T0Knd8x<2^G$|%N+@`saQ7fmCFNFQbWH?apt01w=WrTXLH3)GL6@K8&QT28J
zXY5qlWyUf0)qGV|j!~sLS(j%Rv9rvoydj1;%Wa;ZO8GhK!<){iD+trTnePNIv3u_I
z0*N#5O&(4uBKJ)OmBje>PG$_2o>;=DC|@yML>@#YjL6kpvAlpLi}HXeu+TZretJ_3
z7f}}+4Ly7LLVn%78*nS}&*d}%>*pCvb&n0jk?OL7*Xc9k8}(YB5e$|BFz`gnT91!A
z1`<R;^B~xcN8=gvpg84OKf%Znl0=P*D4#v&8(W0+Faf=iQ~_`~D)7gU173kG`WQ_l
z%n^@y<7Xhmy@{yPCt@=SWraj8h}ZyIC7}%l(3^l!1F+6!;2Ai?7^|8ffUx#ts#^x8
z!LJo}n&t*?JeweUh%@G?WNRSOClMa(2$8BGkfc?bS3%PZDTSxfHK!b`AkRw_jUClZ
zlt`R4K4Uminu)z7SI}a%PAkJ65XI=HmEQIc9?N$04rj}cR+y!%cnDk3L<(EQawp7*
zzR)mpSQ2#(y^T~18@>gJ7)j!x2DO}|l8Z$_9s3wO?~C9r+J3L(EPOAszs?XIEhupx
z5&yZ9>U4@I?Q9uC{0GCAa~Sq%Ui3#+vLf*#+#nr%!kJT2R<RRJFOlzrXBMiq*h`xb
zQRRwZ-4IvCusO3rI8<4UBpb*DEfTbBgDa&eN@Vd%xVxWS5Wjh)n2nF)vOY7@mdrOI
z2&kaHeviTDQwYrJ<qK1i+QpOa?UVaj#5Kf22y8EyQ$`j=AJg@r<OER+(^xQ>PZG}V
zIka$+g=1D9gac4z_$1hZMBbxM<3Zdd!f=%bEHs`y<JHq8prA`yDCj3<hU$R}g~Boh
z3e4$I$=K`$qE*4!$j~Xh-(|0=RHd5!fSe>#{3{_C70T(<1uD%~U)hi;(uBR_B_mg2
zC=Pk1qteDG_<+v2EnlL=*(?Sc4k!0*iAef7gxl1ivY`%@vk{CVu82lF7YSZT=p=jR
z9Y_Vbj-0l>DN>6Vfo8ept;%G{P8=PJ>WbJFo|w`z<o4{UoXUAUB~AfIafU;=qp$zz
z$h?s3ko_4l?W7I`O}8(!9f06Y0n@EG7m?SP*w`^CPN<+7pY(E`pohGAzzI-dA;{0=
zfjSZJM?JxA;qB71^5^qA43TGd3@feJ5&rp1RkW`}jiDG3KJFAV=BYHQKPg?2tJhEu
zgRMu846NnkblDA8iPOKBR)Y2Qb<4VSX8reGV{nOOBN?y<;>iVFJ(D}VfpK6H{~fVP
z^Bb-149Cwsy$v6)14Oj+*5g|ZOaDmaL@*aqA#z%CS_;RN08hczihG+?Y0}^-N(2q~
zJI^j0b74`rmgJX-JER*aZe!)UWCccxLKC!K7Y4`vYX}WSt^70a7dLRwC-}{sC@ZaG
zQc88Ir_Ziq8jIEf0~L(k)MOson?PPGu7*laB&TIP8wCSZiC1XJ7T~R1wz9e%1XqyM
z<eJIRFW<vCQm-)HeIKapC16?An~h}0^?P=*y7-G1x;##?yYv?>O5f|@Wg7`tkX^lh
zU;P%z_BUsTF5HSfyDr<&v0E@IT0=5f1#e1ZmAqP;%^TWz-fq>J*nIUvR>dJU+dOH@
z&<KZo36*DTUeS2_EO`Ij_~+o>cgelK4IO;;G25+$mCCCn%j+ViTZ?9_DwV$L=|GvR
zjN#I@8Roq)vvN=>z)VLj)70$GzW7(4jQz)?*SXc;U;nYd{^Q}JjmH`PpY5H^ov-#E
zf5hj(oXj0tUtMdyy4HMkt@-L&^VPNHt82~8GI!W#gJ1jfK#9wZzwWc)H60MFJsQNF
z3Fw<^?6LA|JiZ9Wek&4+fGEO8|9OH)#upq`&su8`VLJCC^7XsJ=^z!P?<#qKH1bK#
zV_2_ep3<24T*$sbP-OpUI2nfzNT!`;3*$Z_`*a*mFpZbWS0+xx2%mFchl4@XlTZts
zMi^EH&;Xt6y|RuYk}Z2OnT@Bep)+xHClT)9cjX<`DY2|<Ueq8Xlr}3cT_(J4w=3=T
zkJWbd<aHC)8FPn&5lAd{Vg~48N##XGs!$t7yPP{9#QT-L^TxALG@d(<A68Kufk$5<
z`)6Ym_BaML-%=|vUmSU;m<>8U8p>crI-)VD>u<;=RB#vN4(QBR9vJ$O3@BIQkSf`X
zrgIBBmM({<Fm%zi-I-%FY9XQ6QhIz=I}rSavkNUk(OeQRLJYokJDe(`OA_2lC2`4y
z0vm!&C3si~w##L!zq-Ai|EU}mtiHrtUR)$+?>9HL5T#3dZAru(w(0kk7F4#PuHNZu
zxnizCR_YqxW!++ncD$(lK2!?d4F<D{O+Fj)imrE`kp#E)GFY+Am1e^vK7$F832t51
z&IluJvOQpYYO~~5(Q{Wp&s`;sfI+`-XL29<2WK{G_^qJE+8foB(dHO;if{d~xc5Pl
zM4d0tv~4d3(ET(OuR>xW=#VfOger3BO6<@$JPVbh3xm)LYmYbpBTg(tC)cYZoO+V>
zn+4aB+)GEF;;EmYTZY*fos}Amwy7zKCd@dU@7c?`iHW)!u6ULSag}o0qc?Iiflg+M
zTZVHQ=%8p`{_f?0*>U;fND-2v(WoWCMF>X2xeJ&tCkFOIC78^Hc9cPh@1g*<La5QX
zd&q1{9@HEy35S#U=gLYYJJjD?Fw-#F+<BV{wpr`4RpGlCC(p1m^Ym6v&wI!d8zAz$
zntH`3O<A0f!v=7uFb?S{7bA*0<@I1+8MJ7?GE|vvdEm$dSYKjr?(q|p`1(o@*iABl
zv6t=Op&vt9ljX2}*~y3iBDu;cV&b8s(qSajN>N(AYh;?Hv!$%h-%WSsjH#uv0r2H1
z7g0(qgS(o7D!Zcf71a%<UD}k)!rG=%83$5bP7QSuUY1ByqLZN4sRVqMtd70db53Gl
zba?k}K;<Q^6zYsCT!^z$q~>OV{HvdQV$e|3DcuY|Mo6CR^lvCSZyNA)x_g}*$Q?G-
zxQjBCO_Mwsn~4x)1&>$s0V9i7Q8&aSGjrr`j+kXS1S@u?1bF6>%mEb3r72%SGdDuQ
zDkl?D>8F|VR5yr&WF#VJIACWEez!sg&j)=O+gls;*Lcx*<ouL`MiQUY1J0MuKHS9l
zY8yzJDrV+EOG73LGn=}e%5pLW7gU){DK31a`frwZ)fe#o%m+P=tOw<2BCgqv!hk^D
zK04k#+N-r?X2=7=e(z)GVb+7g=rTYEGOeT$#evvdiG@>PGwp+>+mbfn$|NB=A6;_%
zzo|r=SILG#T(!pHN(uWb&lwa<rrz@0sLGBDCV2uPghucS`2RX`xZbktM{QUm6L3(7
zmr?om>Xn2SXnG}$e?KD9<uBpGt;+WN6)Z_dWp2dZYzNk%-|OGY4&n@EXB&gr*@nHH
z`dJQCI+%;-ViJAa*^c|2sC1X!m6=^{P9=_zADzxn-ojnHvt4;o_7KnPKdcG%tn~&}
z*uk`KJ*ZFNZy<}Muu9$7vc8hab)s&_{!TN*H=53dY#&n5hN*&nkAf1)>K2}sD_)vI
zc0Cf&2pB`sYea_<hnJj=9`LZdDYJQ>9%Le$<3n_nz=%%yXhomKF&z{NJwanS?2LrX
zWQ<`<>^>$8e#}3THmA`Arywk;IjX#tXjlNIG9F5FN6s?`Hd)dZ^y5#~!ixR_m#Mb|
z@Z4MDvfWfM_$aO|Xs&Fn^s?x!U6HJlO3;*%5E?0+C(KKRP$1B;qzuc^kTYR5J!p8<
zfj1kUO=N@85M|l)dObq-S321b<1(&!pjVXu5|SnIJc@arjxL8x#mow=2d@+a8Fz48
zTr%4_WuchoYOz6RBE~z6E;X8&dCO8MLP?`=Un;XGO-_3wEdY$eWXcc=O&-n+DExWk
zOv2_WLheo>jo!Fr113SEadh|^x9Z-iYDD03jQtsfUMdRDb}E$|stB-UiK0tc8Q+Dd
zDr@LMLg^$~6IxkJwiIon(dSUDA`;4^#wVc$8qZx;2S9oGf+zt9+pY;1FddCqFpE^w
zfXoCm6I4JVcNOi3z1^*x{bixC2Cr&qs#&sPE>BO0B?x=M7UDyki9Hq1M(=Qhu7E8g
z$8c4sCQq6F2`2^@*>?lzB#a6*#_K~2!8*r_(`WLkc>bvShrHNvyuqX^W`F=D-Jr|T
zVCao#=<<Jh{T#;A=Wk#TvZb^Tsnn#7>@C53OPk++zf(>LL+F%FlN~^WH5bl`p>YYi
zNiXhheA?eHf5xfM-g$-F@Iy4`r>#n#WH2<?oR{m$N!_`bk>l*JH@6GMy}3Pq;ArFJ
z%O_=b^qbpx!$%zstE=a_cxGEm&TK1xW-o%%`eBP$9NKC5vwOHTcXpV}!!4Q27p{X1
zeiRKKBHsJ?lxTWMY((a@e3vUIE^LWKzQ0{8`)XXAzov|U+qW`n(bQq8vz_fFC#$IC
zGE;q$m)gwi&fo4hB3hPS)rA6z%FaZePB?=%5te~|6l#e>`?<TML~(7bEU-;*Oq)?~
zZ<QX6rxVGas?T=CDEj?MCd&>es}|@Sng}^kSr>DELu#5%D47r^6SSRfnk!mUUnvt}
zBRbI!J2rKOyCk=ExSJxoF*DKY=ehJ3#MhBRb-#u^XytJPBtcpI#YQkP$qLg#D1rIa
z)k)M(ox>IY4jEUIT1?8>%$8+OL&HsbWvA`H<Z4YH>=yU4q7hmKag;4Z#BO(^{PN|F
zZAc2d(7^t&+DOqSm26T@jnv_o$}CzmZfDadu)tbVkLclkhGx2hQU}nyQBj-TSgzlR
zJ}2^fu_sSv%Bgj@zgf5v{=iBlXK3Z`zkgExET>Xtn3@>+XF&cy?IGd~)TQ{(3y04X
zuSmr9M?aj7&fOEEaJV~j;kuI#SC<u9Fx)gdTRdE!>SvCmyemd0c2f|noDM$>A$BM-
zX?DVQJw=ifg(#I*Dy+Us>pOL7-b0o-h)$D;V6*djC&xxw5yfh>G!-hd=B*d2)Tx@B
ziH9=m>UCCZPjw)d&Cqk64a0#BC&uzpM>m3}SUy_0+6mh&lq4Wrth9*J(MX(|Ai}es
z01KRBcucU^i6A1wD<!EySD^fk<epa)(q^3<;1y9;Lq|Q_aAg*sKvN5rD&N(5TIVFU
z)5}%Va?mx@7I>~OKv!VbITI`RMC(oE5;?{lf|WCp*%-(~)Q>%U5((cjF(<#=+3SPf
zoJi{2ff4?dDw~+=@-y5TsUv&h2jsNpsh8-(_3o#&U7;3N%$Y1sV0``?Zowo!cQT)E
z_%G~<DDbJv$gG5>Wo7@wTcy5TeYzkh$(U>4`5%{|T$g9WE6XE4JvG%=e7-%Yz}0`&
zTmtdePo8_lnZ@TuQ%t^E>nyMCk81N#c3AZ6`s3Q%S#n@_DTx>Ot&wIjLw`7L=#I2Z
zBYwD<nnmXI^(UmYw6`!Jlz8Zt*xbo0vh5bx+AaXgqay0=rK11MxiLvZ8^<`jrgx{h
z-Y{x?Wm<<Id@ldP8;Y-6)-`Xb_lW|xIH)5De0Ma_+B@FygYeA8jiAl+IvPfkxQih*
zd1D^&7~nDQvbpQV2Xj@CJhlH+ai4su;mHr(rHYZ`v!^I99>6^Gg%k|#3WYqX?zN8_
z)%u}jRuckRPO0Wz)0PoP<`p9hdY;1(%NolYkCZq>UQNg0R(aFA$eU&os7i(*lQ0mv
z26X|<a>i1Y9gx{!`Q2~sxc%dJ+T0=dek^8OFs7~fV`A4O4B~T1wig)0%$QYQ<&R4a
z_2E`}sLT{D7;2g$TxO{9eT%*mc;v@J`a%0PZxR?qY7+AqGsBC4pV7y#zcs(>tyB~g
zvW%E9v6{z<0T!|)K7R(zXS|xh>9Y2;**a-A>wm5NTnSdk4lu=12x_LmmYlZi)uc>n
z=xez`KuGB!^uDy*tH%Yy?@vbcm*7_w%7eL^XBgu!x`b0GZN>KC5fVgJd_{-y4jQw_
z=)Y2+8Ry|r%DP3znjyGNBbQq36Q9`_!LDO?wm+Ku2pU+jQ!FCO(vYHHN3Z@10LA@3
zO$eMTC;|TGmdZW}m);e@wpv~ow5)7Be7d<3tgLNrZ1@SbReYqOy0~T5R2;EKeIeY5
zC_3N>+>fWi%mz;?!R8K(w3U>lNQR>HoQ~S)9HO4XA@b!#0)?0KY+0z*<Vw-+n!;Wc
zvL$it5a#hxDYi?Xqf7M&f!G7={X=LQ_?=Pc$FNVomjue%F%nC3CflsomwAP(g_7{l
zYJ12Fc0Zkt27?lf^{(z~bE9lk3-S=m#JA$?RZbnm{=Rs)RpF+~cBG0wR{g81N8AyH
zm;fT}go=;VwhD2Nm|}!*5F}d_9TiU$uX87>d105SS99gyz$zR7?N>|$Tbd{Ww$jB|
zHZ*S~cXF;ok>QkuKgJr0b&54hVO8F*{a1rgCu5l+Iqg(gZGGGZc6ef{^HF8BuXVfl
zV&Q745J!)NP|neAZrBCc!>zCGJ?ecMG$MeOkvoQ^2wOC1=<z*EF(cXd>%K*n5_-xg
zVbKB|;6`|3Z%&SN!M@F?YzB&W#tyfj8#Grf)Se5sTWiz<@Ru~|O`X^Ki^iMLLf_GK
zp1JR#GRZ|lj}I*}RPrg6#xEC5nSc@LHOH9XGd;0r^%k7-KW4bP57AJVK+8OvD91(D
z*xuaQi^|~=#zHC>k8^}V(AiFt8ySS0sB6w8X$c3z3v--GvHJ?^*z7RXke(Ns`nBKI
z!viJMv(-~}$f2#p?36tQf8}^UR6ctg8;Ql+opx)ci3S#kd$*vsgGl$2cTM5kQn+po
zNW!4#tZP`do+I?IEl{4^bB|?#d+Qu$&qy>j9{plT$h~UzgrH(<{X-=mS2<NdAgf`X
zsI%HNvFPk!E!?m?wTRgr=v6lQF`5*kWLY!!qQuH!&$)#!ZUBS*bvn6Ho1<$ek!%c$
z#nyz=xBmW1U`;xo1)iaG{_1ICBNh0Db*zKIOlZMMCD-`9>oc?3>0j?2O=qeqmJY`}
zn?ip%&C2Gpp^No|H0v&LVO(+NEi31MXpWXy$`Tq;>3O`ml|a4))BCRi<t2bTM}*Of
z&`@SPE^$feGugM+ECa|p)`r*1TMSoL?N++h95*#M9u-mQUSw#s6bHvCR=mR5l^02#
z^`Y1W<r2r0Inc2Lxa+z~6iJwBGqM6C7nK&sPL9-d$DH`Ke;=DuCy}koLGujiK^*g5
zdlbXk<XEO$Dbk3q=2#Q&!PNY$xkRJ>R;Bo2!D^)^*_=~GQ>SE*%LozJjC7?WHFImt
zVjwaR`K%3bSh5kW$<!#lmZ9nknPrmhvf7C(pR(zxU$Ym*kAC(w1SJ`Sko6o1l10eX
zGD{^8^od-*^cfDbeR7N_r15!n56;TF;IL@^n+Jikx8xcJ{+t9`8;ZMQ;cPb4){17=
zBU6c%;=;@aMyAP!c%0(>6jg-th}-GiyDYc8q+VS>_$-vqLJ&NXl#YZ0pUi=bynpE^
z%N*G7wWr?HGuAb1sHmoFOWO_MuF-MHVny&;N8h>(udIqngILUtY0e$mCl@X#@?;fH
zj!4ZQB}2Gan!=wv+({}6(8g`vAWgBojHM+h6$hw^a=~{@X*9u^7#gykv-P!ds+ttA
zi>bbftv4PTOS~c~;FAnliabRCcBrc}>E-~uz<Au*uLY-sxyBURp@~C*@G)bvnixer
zQVJPeLAF<wkaIHCWBopOxRu%@d8nrbx-5ze^II&M|23PPi+2rm+3p_}WwEsn)t$CJ
zw8WGu57`P(Y(h0j{O$ar7noDkL7L(4d`2fF9VjC!rK=)Z7oO3HT~S7}nmjru=m3}g
zsdLBCZ3C86dhMk-kO*$z8)}EUNAStVML|C5&D%gUF}_wTbKBtl3J}soptrP(>m&k}
zz(7=}CN#c+u07Q-z?7AWvj;iUFsf%X0>;{mB&9M|eo{V%BB{29#-7}l3RvRP;Z}^;
zcX)JIgIk`wE<Y3dbk&Gnz1dK&fLE8G{Y<kzMttUri#Uy96~*J|I3M<7k-}qpa7>7D
zgoSL0*_czi-;cYoB)}7|d{}eSRGc7kX*Ur6W1S7oW+CSc(u#8pd!EfOAQ?v!We*B0
zUO&^vVyNVBt&BBsPgzT^wKL`HI09qPC@#eA{uB-WkVW?xieP^PG&0-2JJ8}Lb3F|>
z{fKKPamUk96zMdssi#=tR`s?oa*Yv9N|Rv^%0bE*KBa58YfX53o?@Q%!4%Bc|1b@q
zMeUxKQsNqW&ARu(&kA2{?i9a!xMkn@Bq!&#T{x<WESy@e=lM+&8$7S!JodAo*<RES
zXM<^~wMEyY3awMOq$KgLq?lZ1Z2ncR$K218T?OswaCYx1ef@}BS1!<k=zhNCs~2B<
zxtSiMU>`2hg<K0jdejRpa`iS4r((~R*HL3+Www;Wu0JBVTV7IsJPF<aPf7CG;tS@b
zUQ@jyt%NW)ViW*c^%tC8yP2Ef^nwS^GJ|wJrU`T6=eLqVo6)}|(xfqBBwS4)QV`2H
zIf?qau){2kZnT~wheMJTR8%SVu*&+S7angke2-nyK^)TkD5mc=yCa(G^k${W-e?9z
z0}D3m!5;sTkb01{dsa?DK)9$Mf5LV16_^8k_Tlh<!WICU$rk&tEA76m>?uc@y>s<g
z*2~^+;vD@d22PnEAOZEHC)S&)2S47OWL<PK0R~%-9zK&m=jzg29&SGi?&G#aem!~?
ztf^m~Lz)0XtTrrXVgXhx4R3Be$qkPqNBA%titUDjxyHqZMr<*2P~aW*ZJe+JNR(;E
ztKl__q9mKre)$XLOeYS(Aw{-0!PnlaM*E<8*lO?9U&Da%(H0v_mW*p8Z@W*A`~HVe
z%N4VYQH7ZIjl|1E7;|J35d#z9%ZV|VO5g?dHPxS0%T;kwYR;djBW*BWZMiOLTUpOb
z+;pdr>Odl|XRA*+VG5oT>mDNqu?dQZEkG26Lt;%Lw>h=`Ku|*DZp`|$?+Hri-R;<|
zbjm6|7AbfLW9b75Tjaxt`*tTXlsH6=((g__YU>SYi$}yTQ{tEh1<w6~YsjGvpl~_T
zh0&qg62~}45(bIxNRxqc)fl-Vs3jy#XPvZobc^BrbRv4@S>m;%w=G9YV#g+J!mT51
zT+F)XbVSfX`yqYQtS^{DU)z4P@$k{pr#oAZA3omLe)@>5(n?$ZLpZp$nO80RMAcHY
zcDUA>R7*RkU>CgP?!*X~mJW@mA1`1JENz!v!(iTKK9`ZFBD%lnTC=TfR#HvaZ7C`F
zBy5-4stGtXr_q(~);AxYt)z_Q%tlxCIc@{xG)a-d_cdin9Vi*4lAPUgZtQcoF6&_y
zc3>``)+6EAq4BTsO0KeVsA)OnNH&+!t~#XFdW${U`8n@0IpqeC_KzuYM#_p%EUfU^
zpzfki+K16ueb|4VHhz$T+fKpbQBqv+q1$3OOqa??GkM-^4)c?v-vfMby<|d)yG<oX
z=b^&MuY5NkG~%P|+ZXw|!hB0{<!P>02sS8?sh&XJe8!yVq@w6lz4rLgwu*R56xupG
zN?I(@1HDzrq<n&;i3+RnE|Gu7I(4KXY>c#f#vPTNLsa7&@nsA{b#o!Wnk|*L0}4i5
zyqSQ;YWj}*BU{5Exsu{uG=dvL$9(Td0O%FZd08gH4-t^LQ_NU`;i6WN1!V{78S$H?
z!F1DWBVPQ4!z}AC4UU<8VR)U9b&N^7hb{pCcW<W=-I?L4usOLH?*T3Yw~ag{cHWfX
zI)?Ld5ZPlre?|Af%%tZd98P9EA8vi|dODtNHyO9BH)q_pwhU^%#mmq%7kD;g7WS6<
zxiVTw16_ofRCF*UR~!2}Cf`AcWJ5Pn7*kwp1n?|P)h2G_F(oXu-W}Ie`SNqWl}5eU
z^6Bzu&b`5ZpVoJOKoy^DSkyIYICWDTgU2ec%zhjW<E~Y0alB4Frj_&znzd_8pnlk*
z^4A+ZRnYbPkuU7+&Gmb_HgJ+?4s8B<E#UmMetiA4MHi;#HR03z;l@2~T^~^5t2q~5
zZ>r5Vzcakh#ZBRLU3@}c*M<`bf#-8}TkE7&J-8Otq4G=tj;p&rG}G-J9POPpYRk7L
z<<0VEILq8AIdoZ1$P*8g({{*8?aNSnqlsb*c|T3eVa4Mqn>bZrfH9@xFyi!b!cN2{
zSew54gYHI0^5>{!I&hy-I<|D&1?RZSIWgQ@BR?*p3VYzkRip|<7wD{hp#t^9>4p!T
zr2{FRM}sl3wbsj7^OOk(G#!F32Cp`nje}!wxCG%EvL;Z02Iza~xYpo%Kh~J|G4No3
zd~X<bKP308clI<I3=-e98Y%}UM#hLnrh>hld$B_jCEBsa2~=oZV8|fqokhremn7j?
z#CaF7YF<Ok%cEL-FL`EE2eTyV&jvaKpGlf`HW+nC97@l-*5IHn9><O1hqN<P=(NE=
zWlDy!Ll-kj$5Gd5l|$aw8mw`Vw6(pS8legXs-xo}ApGDX3mGO(u^J*ZpzfW=@SLKe
zeUfkx20*Psg7g>0slUJmA__04A(xj4KLxAfXdsuKymW@IS!7aoD4swZRZ9>=xqML<
z>x+z^sN*KJU!uOt%UVI{j+u{xpCEU9WdoFjpXyTtx<#D!__==8<nY>eCvgRx*~d}z
zfuFAY&kAd&E81U*^MsbD$YJz}E2e{BaaL2vCxl}ha3Z`E14lxQ&8;UKP|XRdCfZ+)
z{QbexTyd<xFcp_N>><h@QZ#>vt}-!Ba&2!W@j8{&oU#O!sP8#&^=~N{CZjRWEcc4S
z6~gTWMc!)YVR@KiXgm)Dn<iLA0gOCehk>2nYZ^x~k@jecsK55I7Y$-MHm=$TDp@qW
z`BN;Ira#r3>CPLlM(WfcIUL8IH%d1TxUpR{qz;L3o=Kv2`*y4-KH;@L92GGGd(O0A
zL&nQ*+V(osJCiZ*ZMr#DpsOI7NRHv+xxU=a2T_rMq9)Z|w~30~&6t>`^X>_@9=zd`
zk%NQib4ni*s=9<(#gXl)8ey{oA`V!aH0X*}%emyk=^~nj;z0;tvBfQeE(2j9;yE;Y
zSI^F&<TA$H*THJ{>;@#<0xTZtaK$dLmL}-kv$dC|u`eL)9uO2J%%|>t&tFXE6A#n`
zR{hPPV&0{byR!=EcGgx-5pVh9I~V@0WE=V&`1U0T@SE9#%g|&Ek+qj-V=hg;{ju+Q
zWJkM{W1}&XR-z#V1I&*T;UFWtR-;-YI{jJIHg;^GW=+D&l{B4F1amMNeVC0E6X&**
zrinsm93D<Q-I3Ed#m4C*X|^rXh_I6`SCzLy4twXV4Y<3F-*;W?%jL<nSOBDr`IH_!
z6$fx=$dq^~=-yNM?-ajVWbLcJ(00oZN|47~VyQ%a9m&Hg_VOc$Dhn?`rTL5I+f0nE
zZ9VO&B;4__<|21=tf<Q!+j2_96cYVo7I!~zo2&o8-I7?zJkKw42uq~Zq1aCTW3cw}
zJPLcx*3N^HK4VaPk%4&*n7nsF^oOZ18g9?tQ0vLAaRHH9dDZZ-p#ie296mYW0ssNs
z+3RT9__fbnRD!!`CWj@=1&-ryoN-jIpgp3`zb=GX0qoMRGgfBvhUOo1GL&Bjw?C%L
z6NO&V(U4B}A{IJ#I?F4!ZDYmT5X$0w8WG)K6TZppzFyp=jVD>K^L8HI8^&q17gI4j
zB7D<NOGv(*tpv5t71fBA+?}YyEFhYjC-$J=NrcD(kr_howj`jO&0b<;K(EZ`^}y$S
zn{}GjADCj(=q#Lmh_0xKobk=a_mXEFuv(@zwLb)XO`CM+k3cQ+Du2T*4aqss#3yG5
z6>quUGMF-V2)`|-Ggmh^>8+?dKMBSptr22@)B)j2@^iI3(k?D@aWv(gqRcq2dyu52
zv;@`2yT!0DEG8O%Ev6dwdgR)~LtkeU1Nql@3_@q1oI>G05!g%LQKcsLD<HM{Yf?ZR
ze}&(w@Gie541t8ssARAt&7+dclAKM?zlbYQN=2=QF@uW4EHJTQW5tXjnHs$>Ecv5k
z>hIvypajkGJs8c!A7RKUF=IIZxNeh;5|xh{Teq5+rRm1>c*<I%et`tdDjq6dv2dod
zggs_-KR9<)Jo9vWY6v0;Df^mE<jiNniEF~18w)}YBHftVNPKZY5(OvLfr@q<sNCIP
zGAl6g(JK0Q2(LF!3Y6B4O0<HG!_iS`Fghz8mi@eK9_k27`|FUghwxz<#sh!p`5X#L
zRAkP%Gk+W9lJxZc{B=k>#2z#1r#+09JXUV&q{y39j$sb=5sftIjwVs@P!|kr!7yZX
zs27AQy9_72FXss7TvXd8i%C3R`sR{&zS;f1P28_b-SgSr1#Ioe^?r5h-I%j2;hTZf
zzd4WFkE20v2`(39b(}#}mNu@G{X&+Qhfo+aFHmHROI@3Y{VBZh^+6zk2Nr=qeE<I~
zKyWkhU<rDgYw%)woFjp=ZA+Tg@&)es=#sdC;T4PbV_ah59_O4R*yP>G`pH}6T4*(o
zx8#fU33~_-LrGukt3@{`^tbrlBnSB3tjsN#PK9SDmVe0{CgvL2!NOHBY|yH29GVrS
z`_}3GBz+g(z_SeiE^TyYZbQ?NVz%HMZ-a%-fotAPk9uxzdjKW>RpC7kK8gb?y6nLx
z6?bSbF1oMQN9tHIdc&J^{0iSngK=te-O|;Mnf)JjrR@)NFs|s?{y9VZ%|`;$M}~WH
zLev5&wW#CZzU*3d>gt9=&Z*lWj@`QsVj+iUR!m~VKs*XWu0gE2i?BNxv2HQZnFrxV
z#<|3MV!m!$vSW!ki==W0WGOD#Jw6Q{s6fP1+6>XC-=BNOqe(@wl+alKOBYmpLneE;
zzPEJORH+^J)-RHqbiYKyN%W7K62MmG_ASv_HsVRp9mGcRWmhxpS;08rVF1VKM_emI
zQ4yc~D(_l+0TRk6{F6gnH_a~ET{TEPC-jfM1o|+r58<c3u^5a_n>T_XTk|+=q_(+t
z#`yLizMX)#Up3KoX7fB#YA*f8Xa0S?fvsZ*k$YF4w_0*fo4L6!0`?b>aRZY=I>{xz
zfEml1DBtv_c6ia`G$z5GB5$kz8FRYHm^~`;ud)yp<BUzfQj3zh-9M9i{mp;j33?`2
ze4yqNh~n8gW==fke;pL`3+MN{NGcHv`Fst~#i%zML~GjkTt`T7AjgIi2VAUv6vQLj
zuhjif)JGQ|b7T`K0poEhfNR5xk1{m>C}k5<$+#soR#ZfPlE)`OsADqlDJf>mEFY+3
z*C`R8tL2eNe0DxnLkM~^Hj_|dhR=Tt**agmRa3kCV!HM+?v?$+P!}#d@ubiCFrL<r
z2(_j-MB))ORzaJv25}l3tqX5YYcCCF*o>isedkG~*DDn-^?p!0+9$qo@*(Abj)_p`
zZ7BXrcQF`RiFBO5A}GMuLb+KS9q%6P)!Nj{JfQdt|7cyDD!qse8P}7!fZ&i4qxJ6e
zQ+i7ZK=w(pvykR;soNJ0eUo{W35sF{`xh7nJ%cAPb5LbHyyxy_vqQO&mr2@GNx9}a
z(L@{{LcV-peSyxmKtPe`B`_w_t_{9Pk{dpKcQ%<2qL82=kqwa0ZxSO4`v^e}P4arx
zwOFWu5mjEuI=s6QsS&$nJ*cbPD>L{4C|`yyODf7+k+XG3L<HKtgP95C?we34cNWID
zg~n4R<d`#4i6-c5t~oIW;aLuy<(du|pw?rMu^OZ1)<h#Y4&#Yf{{_*fF>)5bO0S~W
zcW`BjcB&|Gd49zDoiZiUaYLwbaEX*F-RX?Ie`HlRi&F4mY(GR-On8rJSQ*1J9*um3
zU#k;3Lx#@wla8+t`WsAUkPIY3(na`5oX6Ya(ID<#1$Tpk>Q4u?gQJso?fpjeb-QtL
z`rNPIzh3?Q)08bPUl>}*x>mq;)N0kTQE4;2VVY3=bX-5Fwdx18_Ca%=l;X6LXMySh
zF29lAveO|T+5By~69w#aQZCLQ5cdW$%@;wG&=(WryG}27EUDB{y8Hv8ts5H~?6h{u
z0a0Z9?2;4>N3*kYWiZeAHn7Q)MDzjc>D;!(z^w0qjaUkX`smOjybjd%i=fueK<x<u
z&CQ^Tj|mY%4edqUNp;v0!kPk}+=O>cIAL|+Og}$`oLUtzWtiqa6FNMWkh((-_xZ$S
zI}nkFeK4&4hN&XJO^si1GS|^rNaX(ff=+FTPZ?~iAw&_!2=Ze29FF+3H>UpV9>`i`
zzF`grAB~l;_A?_g3qAm<Pq(E|d(DeUv8!qAjUsV84EudPrMv+nkWDu2aWQJ_pVa<)
z3Dj6VdwUu&Qe@W42at847mxmV-i<|Ov3%Sttmaezg)OM0XRsFy!YjjJ^z|<61ts?T
zh&XIf*+X|5&>WIJu)p0yE0(qDMV;9hw>+n`pA=}*Ki!5w_4FsXoXfLnuFgK~<6R~x
z6|aISOW!%|iM-*{M!oq6>xyCe=%$fW)cNh?H3#=-PxL(eqLCIVnFb;`(bJ+9eJu*c
zFXO(oCNXg};boi5@*Hm`;h0@!aT}3ZgEBa_p6p;6`vdUWicym!bV|1@f$EsPs0c~r
zd235kp#Pi|mKzCPVUwaJ8;j3J4+T=yANGQT(~#d@oDX-3PI-<~Ct+|{a4o^*!43Jv
zG;+~Q>ceUNOuYE+nIKDkHb=|Vd`t&PFHYll4alI8k8Y$X#cB4VOYOUEw`C$LnGHmx
zy`j$#6cOQ))BGX0T|JH@6>*rpsG!46VS1m$E>k#x+~4jXy)|b_m7p!O%~u)2pCH2C
z&NhiiIxR3Ng`<9Z42?>M&00&kD~U7=&ac_79__b}aZmaR+{Cw@0B1m$znfUK*Hf@i
z^S9GYrbyv)DM71c_F$SN6^b9~ya35*{wqAIHKLX)m6O_Dy@{Zo&HB;d5;Q-JX|_24
zX{BNTcEiTHIHXr9__t(}HC?|QP>MC;zgH?Me0Cd8+QN~Sa$D8#e?#2OfXxFrOu7o-
z$E=7(wIG~*Qmf+w-J;J@fEy3iM1j86>k#mgc<m(~w&h{F*YULoOL3j~D^5Mdy_JeS
zCFytE`?ALUX^i@P;=D`;7cA_yc{1{9na+M&W@Tx6t?BKxQgJt15vq76f7(r-Swm6n
zQEw?Kft^-KY4Dun1qJ#;AcwC*%-0|0Dc#JuA2<iU(mUb&caVRc25!FgO+|<0mWnh^
zx1^H1zB+O#HRM77%$t|hB;LaU-*d*#j0CK0<DO3IX~q{aT|TWJwv-s8XNZGb8#+qL
zMmnZC@gSbkxy$#MBvm1<e}5W@i}OJ%7)DV~r*hQcc6EaibyqrB2$!s45<~nFIL+$~
z0K1JfxCNCi5Q4UvRp&ZmyNMRJSc99@-g=tb!g=OvY?sj1=4fhvb6e!m*zx7lJFBe~
zChK@Y9d{*~<LqLrZ{u-a+d<$VFJMoQsNe*#wSAYx5$;-CNs$HuD$!vySa+3ryX~VN
zih>93wreLR9MZ<VXN7`mB0vn!m{W;PjA@mAWb;j5#0jf;wERzXO<sybhkAUgnI#iv
zKu00sfk;$<esGU#-P3`HSVyWO6q%5>BYfka*iLaM92A6%FEhOzj#T&=v*~GUoFyAI
z)2!-AJW3rstI8X9Ic7D-KG#M*PZ{Cj5i|Z5;aS{$zqz5qt7;8g_d_zfPzq!@ES0}O
z)bkTO{i38gNEHyeS^Z;+IMIq}yzSYz2QIa(lzSV_NLI%%23U?+{!6ez4`>ycdaMxh
z9js8%6=%=6snB33MALCLORux`QpVEeS8TR0QlZsP`NgiPrGTI#^)kS;_`^TSl@(^8
zzuVX*?h4dJ^U@xd>ZyFBm8Yqs#$Lw8d;tc=4;mAA?H4v6EJwnO4f7NjtK}xzuWI{8
zC$%<>JFhWr4ToFl7hbR6m*9J?-R^aU1fJlR`}h5nNkkR)I)rB(s|fFP?*C#*n>bLi
zB{Z!Ae)){1vHtGq@RQvU0!`}-@6v`fj&6p1$JVu6bg9~`HEO%90QreTg}J<1PpamF
zD5nX1)cjHi(#+saY7o2a;5?<H*_ODuB*0YE4MD=c9H7W+1sMUMg0LIy&Z(O&s@|n9
zHH#r5<Gwaz)JU&c%N_Y5&<a8*Z8n5t0yXD=;k!Jsz;i%+ZKHk|=@Y?AIJwC@i+;X<
zV*LxJ21y(AyG7F%RB3Ms;^muQhq|7+R_XDQjOT^AMtXs3%^H6%A^5C+@ty*;f1##|
zS4Il-bAhgL+T_y$D}i)c!gO$U34Opr>1ruB<g1SvAGomFon6cZoCT{F_xs|KM=fxW
zJLJxekr$HfjHMw-U6pRf<dHa64xQrgM#B3L3BxdejE#(f$lP-%xO>;{Do`hjIVzR8
z@=JSo-bVvef3Lk)-`|H1Ztdj9YNP$?U8~mg<>Rc$je7*=b(FQSA<-D2efJ1@`vkmW
zhFvMO`oCqCP)<MvV9rx6yJk~erv;^OOnraio4LVNc|8qsH+zQ!kA(b(<+(^$uT$n=
zBd}(Sd7lzf26K15-A^}Wa-<6usG)3ZZS(%iTe*_qMDE|G)uXZx^V7%RV>jJ!bP3xW
zHNt!wIFwn-VP;;+&0~?J6j<q9fRnG^ci+?-d$jobM-sbp_w?kXcG%)470X6d0_KT|
z!cycgR5ZFphE|T_op&J5^%=3;B<nmz&aE7RolT^!$<Syb$(Vg*ud(WVot^_%dD=Ua
zwNYJ>^jtNsvhk?cfRlm~ER1v~@t9au!lFpWh<xURs6qV6<L0}=UB!SS_)h}MSjIF6
z-;RDlX)HLlrR=HzUMe-(oXs~?&y~X&Dn$Ol=*)WXBFzTdc(9oYRy~+y^n=Jh;lyr`
zWK6TLEfY#SBin-T5t%x6t*(8NiG@UG)Vo@6JmqNRL?1^3S*bj%pb0MvrFl^7N0oE%
z{|R_`4Su=0Pb7OTyNtB6bhi0S<|6xyqy2g9?VjxJYzJD9StsVkgfK<o7PPKkvhr!B
zlqPig()Iyj_bM)u>dS8)A-t-^v0NyviAP7EGk`K;63!h*F!D1Qh@9ofAn}M<T;U}6
zZRLrVrQR;RQdvN6Koh?-dE43Yg_RvjAcj>4glpRk;lzAgF>RB$??vaO|3pM5K0vPI
zU_oF7^0HtQ{Ne#n2}<1KoC~6{gE-Ho5JYwQeK=Q%9>Cm4F&6}7i$v>{TGX%3sQUlW
z(m(rtTjv9x4bNtXw#!+EqE9NW)yuz4{x&q)3@|)Q0Hw!R7SA+ct1+b=4(TlEnn(j`
z1U3~HGNx)q0_vD<6o1rYc^qDGuz@aT0HXt)=;u&fzsB%m=_UG}Rr12Hj&o=l<lB?J
zwoaaMzSWG@16FASgoAMMp+Esrr1D_J0SV&J3clxDlf+#eR8M};cbFo(gXTB+DyL)^
zxs%#)qrO{hSvj4U<P)0Q=;BTEX_p#KN~+~brez1i)0nwYfcz`G&MTEi1=yddP~7>F
z4XglXRw`Tb$~&4Tbji>*AmW^LTFJm$=k`a9kP&KWHq(36(g7<f`_!9#W2QzEHyYCJ
zq#?02j|#H^)m-Pw-_qbky)#)Bk4|O1j6BplYU7M|V-9UGMqH5Rg@swyX04)gw6XSB
zQCgf>rX<=i#QO#_xL`9(FUBb8WK816-OJwlgX&Mm)z+Iv?eJ$lEtMT?a5<WAkd9tF
zq5VERm$0Zjbrtv9GBEpf5_?wrV^6n;JxhbKIzeYI_{uXix(bc1vNDY>#%tg8prTu;
z1PCw0Nyf)<ucWh9b4UHrm{<v2b>(u!*?r&k$6gj(1{F<qEJ81RE7AWIJ9US5u=y};
z{!8C2d}UvfTw(y4BAOi8-z6BcYK3?x!Z|?jyQCbf_^q&!2jk2$dcETJVb;}q%2W7@
z{CO6v%*2p7RTVeHfOLuRGbdBHLP<PPd=4!YE(Aew_rWFJ#h&eJAKF|(2`W&|SFEyu
zRXprYB$M8t-A}HDT}RCtk7#>VXVX!Wo=az9ZBRXJ9f31fa_{pD7lw_><?k**lq>>>
z(*1>CpoK?@=vZOoz@(t!P{YhqfqKx46uXEuKWg4f)ZGItW%_Wjai~YXKbR%wB?4nE
zePp1Nc%4UFD8E#9FiIk6<e!1vVNO}a7^ilho(hsNkPultsDTCXb8Bgw1yje?>%^~2
zM;9u|0?4Lj43#OiF>-Kfjz0Ku45O{tml}_AJce$2SJs3!jf6`fDiSz*QZ1S2c2XO$
z#}<ad85eKgoK31H`TOtO*>DgKKWM1BaLFD#yv2%kx(CO@qgH*lR#`zNY__RaXObqR
zT1y{KrdO7S(NZP}v>YevMPN;GG9@}^ObuY2G=rs-9N(#t&pG0=gVu|`;+*{2BF7%9
zvRVZY<&8xrgxy@~nkx^=%N*@)dN30G&p2!7(kC<>ZMa&48i>9+MDILIs@-Y)F=7?b
zvGC3%n`1-`AhTBOPDF=G)E3}7*DZKiv_w#R`%7uYQPN|Bpoe>$ec}z2wu%*15PP$l
zG;73?iWtrMLpRO@+N2`^Gi=3EI)Ier7^F%W-in9ZQhawjtM)ksuCeh|bLoy}93{=$
z5Z<kS$t(*NB6Yi9Zu)_V*?iebWw$%J%+=a~$K5@8%j|7ME+BJVs-jQv6xvsAtd!~X
zFTn;;3cWQl9#y!t7nOJFy2`Fqo{Q$(t!apbUpl?<c0-fNAQoMhApA41h#zw3q->)i
z+Lql>Sy<(gExXn9{%1}_uHgZJ?*_dU$-Y`P+beUXSe6C2-{vNAXj-ZQH`i8agLuX5
zZXizPha6I@3Eyvb(vPv2v*84K@2F?<D0zMk7bK2%O%h(4!H3SO_zZ{Ix!5M&qo2+5
z*|bN;i<m1;?o}X+Oa5c1H-ocTI0;GYmf$qHtwfBR5W|m?BolkGCT*{AK4COc?+2!o
zKM=lz@rELbdset{`OaBe2rSP@nR&2Gmgx#G;OhYb^+|+Fpcb9y%$oYdQuG1nyDjyX
zk$R}!`-fXUTQ%Bi&DJp2Kz$0^z=j8sKRL7`l+4uzXqNe*fnacHvuGZrG7JFzRnn+P
z<+|f5!!ZRS0j=1#L+ADVN0oqER9)q^asSbM^_p5^LCU4(InYvYuq#xwGLmb_)dad)
zRj`eATdxYT;YJR}tngo0vFSaXWr@{tJ!`eBRqR9>iMhzQA@^|rd17C1MCA79u<`Em
z5k!DjjicQkoDF+=c-pM(mHNF!tW<`)8c?JQx>`cJ3lm0hp*#~e0a>YRXUAGq@u4D$
zvBp|e$*`*YrY@O5?HRjKYc<4#W=n{Ha%dQb6P+o6WDxD&${<&&HF20!ZHb!EWW-gq
zjZB|Zgg3?lu8JAh#g&}2+QZg0%97+>BWUk9-;&a9R*&nvXmWL+0KpbB2i6%r<Afjs
z6e&Sgz!)}&vRpu~E-;k-+$3w$MgYnr{97T%Sxdf@@wILyuXq!NoS#2?C)B+1Y*lGW
z`v<O>3VX7+Z<JW8=J4w3B<h=qaH8sY0iHk?$D_$~cQl#I##0(oDN_g^B^5#GCAZ*W
zuO<nQ1<AfsQ3Y4DIdjhCVkRu-LJ($hGVrj)cUcxsnN?x_88<UD*f^^0iCmvLhRqV9
z>!QGlH-(VWkl!3Y`1GRggqCv`x3#5FK@9FW(A%fEX98`S?81d;luhxgk_!J0m?We5
z-SKGe==7BzoP*(OGG{M<MLN9g?*t4t&-Trrk>w1<bI02m%GQ33iSwFje)CD$P5Yh7
z<zfPBX$xIBN=y`M`<ydJrabUNI!`WfwFNgBzO~Ap1+D=vHskty(^?d{Rm)nPJX#b1
zd_s=8T_~}8nWIR-QHkr~H0xyU64NdBj>-7;8NwxlTt#qa*vxjH`v;bx@+OEO8jBrg
zej2%UWRoG&*!eO|KnwoJT;i%}Zlv!4G_I#_nGD$^F{*vkdQ;Qd0SuxSMdLPubwUzz
zn=`12(#t3al8}UH*!ALKvaN6VXuCA4hxHc8v+cdpgX8wQTGJ|0u2*%pQLi1gn(1ge
zAL4PKT96@mzSyOZIi@ljeV;{BHs}gr8`(NKso`e(f-uVEJQ=^E7>FrO1Y&&wn{gF;
zPBZqypt{?D_vl2N33Y(;H9es<Jr@{#Wmr-aweZsePVo*JMqRmDX{!<3y<6~R?WHy_
z6L7T;s?ApIq@2=Ie9N6vD}~J$w2s;OCKqZN-+o&(AXKr#BCh&G0#%sRJ+8iE%tQEp
z*Ain6(((8`?WCgLIyzH26}yi#uwa{?-)UsI#2Uvi$S@kBwGtje(Os)T#|KSJCs$IV
zrefZjBi%W~@`jz0_=yKyoc5_?Vz=b5wyNny?U1iGa>t8CxD9)&O48)?is+i7gu|@l
zeEDyk_DG8>wkeYliAdIwxH_sx-W7xI^tOEwerl_T=3<4Mdtw?)b84CdNxf)1Jx>{E
z^I;}NeJV(UPFA3fG)WebHr1ucudSueb_T7al35-fvg|=2Tc<y{OTvhfW)J1cV=v-S
zsQ#ltnnCaa`Y7Wms+<>2-K^H}EIDt5@xZK=uE2o>(m~kW8PSh<ul?a=qN?TY+f4El
z#{Xtf&Xhk0{nfP?4FAq%0}?@T&T27zB36jg(MSSPtDMStVMBrWI_0uGLnGM|k{3t6
z_lM|KgoWt$-#?_``pxmf?95)e#nMP>_ciuxW=E^J*O87y#he0wK8;miR`I~lF`?NZ
zlbr#=Bpe&tT_5RJttsy$LSS%}3EnMZhrU<eZMEOPpp_1dYJ*ke+Ul`2xvKF<G~%)Z
zOyWFO%Ie|q$>Y~oj*bp6Sg+0CyTM=va{|Mb8S~z9c2{Ij|Au=#H>A2<qdH?qcA0*=
z9v$SoIu_#Wl@p6sP8@vC9BB~y&N%p3`{uzQBS?W2rvIs@yvz*p<{DCbbFb;_;@^Y3
zW|afiPI0B+y&oYin-)KWObI(FU@wfD87IwNa$>wwNg%8y4T3NJS0Jn0WmuPs?w0gN
z$8J(Qe-;w>$TkUdLau7h?i_SdxvOdy*@-g;sfrYggMps6$M$Ao>@3)K5piC1TEHnS
zebiei=n|iWi>yBcF?Mwo$jvEOh!y&ijVL-dc_PgSrntMKA#FMuV<nvcr5K(!rDJ9)
zzaKp_vs)IdOE1(-;6HEoYVEp8CzY@fzEZCnT{@rGp|aBL%2H+1TXA$neaLg#3f`A0
zq8X<Q%60L%UIrXp3oC?O=q0DAsGToFZ!sF&;&xkV1((8yxl5c{%%ZI|x1)?EY(8I!
ztbFY)60?J%w?$&t1Cy^W-;)wq>O4)oW%X#(Dl%7v5Nm3G+QK@=T`DwdNwxaLtgUHh
zN$Kvdx%`EfgD<!JWjQtE=);qWsyGk9Z-ut$e&&cNX++Nj=5<*tlVNN<D{-nZWu;D+
ziSmXk+G0+#=D*2gvK!^6#`<?)z>4>65&fL6xtFYT^8=6nYf(IBPX9);$sERe%7g=g
zF^3ydyz!bjMH%gq+>=x(E!5~ldKJo9_GqeK&L5;Dw)e9I{r#izP5+t<>YVDRq_T)s
z7~YlK=G~*)5H!uN|Eh9i%W~a78ns6^9}X&R+q|QD;j+`33`fSe0;?a~lkwiGn5zS0
zT+z7#I1p2YN}oln5@${Kz0tiqQDzyr);H%9?kiYjcS_?#rX#&t+9~N?OtjXX&UKmz
zqzXtiIC>+^Klt9LR({pG6|HX6+LDyVwMDEsbw#pE)l@GLIifWJLZ~|_je+H&Yko9e
zATj8Ckk{0mrPEU88xklRONU?42?bRoSVt8v;WcLCW)x1k=X?06EyhiuTrMR@UBEk9
zwp&+7zacK&vMes1wNe_nzbGZ1!`F+>%3f~5mM?={!r&;hK;=A?@~=lw%9jZ<GJ&13
zS=GY3kDOdSb!AcoTOi|y%%SIvtsY-(itNM2>B_WjLSswIJ)A1b3QKBkY^J0|C6SGQ
z6B#f4U0w*dE)v0F(kKLjhz_GvQf9itmuZAfR1El(X+}kl?!^hBF|o5P@k1j7=@e5#
zMK|0L@}L0i%wdwoTMSDETDpr0c--O(-4wDCu`1y8B=06TPGuIQ)8XmSq*=YC^1gyg
z78J{P{WF)CQOEL#CgG(%M{^?==p3PcFvG`a>_Xmis7<}P@qGx-P-iy1-5F~3NK%*H
z;IRGuAdqE3{BCk5BS_oEwqst1z7)>QWo*2*E4CH2U2dwF0JRq4fD!2|e}xK(YXFYR
zUxxuUQ(C6nf->pMFCHAegqPO55=Wge#}+LV-?L25CsA@fLU0w>z;@{fh<bClYMIKM
z!%X&6${ImU)Mm52Ndw<zI3;s6?2hezDs8UUP8QFub<R2qqRxY?^37v~3bqK>SLmPe
z8}z!F&)xHKF2UXFUcZ2*s0CbzsmoyeQd{gAD34Evj^z(?shtXCjifQy3OVO3KIVc$
zy~oYAL9=UQu=X&r5~y>!-Ky5pR;AbKaZbW$59>2Mrj<m6i&V78zxi6bx#xzY@fb?9
zcw!2LuOwEpB78Ce7b)jRElshc-|H2q)0rPkMs8q`1Yvk!2M%+$3+#w^I=ITRa7*HN
zzKBvV`T44P%Z%kIH1o_v{;ys|XPIDeW@cMn6--`p!ii;tom1+1-0+(lGQugP(!UZj
z{C|L(U6vh95$Jp@Pz~Pb@LlrYy`@8U(P{a6!ZioNfbL+x&~-Cc!<roGI*?@7*vQG$
zW>qQAm(d~dsq^2b_1z!RrifpS4ez9>S^gc4T>mMm)Xq5Zq;l2&ItX6mA@Nc);J8t(
zA6D)<edTPLUk85_4V$CB(xz_HaO&B6w_O|V<o^Ba@U`6VqqGJaC~2Q2R&l{xDK;Ih
zC?kA@sY_CgziK6zZc%YBeGcZbej`o11Y`eo@MV;?30HJvRAVb_-a(oHB`z)QtK<nB
zG;pkPEOH^UX;cYJMRb3;cQL9>Z1i6T#epy9Oe!01nP*gV0cOTm9gk`BY6Z-`&UBGW
zEHQG^kXi~cfX$u3+%-#)D8Jt&^zqQ~9aN8l9ErG){A#t}a#e6aD&}dyvc2%7>h*fj
zbKz5gD_9`Tqj)K5r+GD><lPFnWA7H-e6EFl&iSHx0Us(J0~OUonO*GZweo&KMh!Y~
z2ct{gDDJ_$k63*+t*qv6E6g1`;d4fw{#x~8;jk)^gSb1xOmi*;dDKT3<Ix07BbA~O
zr^M;PZ3Pat@!3p5;pUnrE1jDT<EMd!?%jsa?YbXQfa9XsD7q?N8s>>RIyz}}<8C|3
zAXsICgwPNil@94h=!V1fp!Si9OO{qAy9wV(at>W@Vsa7T8&-2xT)qF&dz<~u^ETwO
z4C!IAit9(?p8kQ36Oh%5aLh4WFK{8Oa{?PzBhEN@9;K2mt1;7bk4kj>QSHm{s=`@<
z|Bhqo?}0s?3hhI`mCmy#pIWli@wb_KwBb{9yj`%B_R^;tK0@owF3Bxplp@6ze!qtn
z$=8-@6_G}7xg%mb!3&rG68qeP=`DLH=B=Hd+>>|~lN${zx42Aht#1QO6Q`-%)y!X(
z99B>d`!Kr93mlzSE0$WcmM76=Y*Y}-)$S)aS64qKZkGAn@*GY<Qd4Gl+T6lK4l?F$
z?kE3tdEqTxZd-~WFFC;AXvM$AmEf+-@vaR1?nn9cQBq45L^5_i909{PQfNCAnOeUP
z6uRcef|>%v!m5PJa!JbcrDx<<Lb4GOL*?L@{+K%-x$l`yuHcdjbtcceKi}F{f+2GC
z&!2;NmqFQ!pggs|`^jDbfQ2uqgzyaG`+-`R;`P9%_-aWOKYPQ(o}iuhOdndM?`Gwd
zh0ws~x{7vZ9TqCn^=BEXsy|CmS2OfwEwb@hXqAo6Z^bC<k}p<+V{t9c%~hi>Y)5wO
z$7S0o80K}CQkG>dJ+&7AgTewT=o7e1upouytZFpZPN0BXsJL%@4Q6ei7TT-K+pLO8
zEx6^&#$d;%c;nvat`46??g04YTp{_)pDS8rxxe2<eW4pJR$=5bayQpw;FC)m8(@Wg
zy}m*NpMN2iFBiOymO>A*P*w3q&!<3tFlR<Sy^wvMQ)VHpNY?>~=6EStoo}}4!o6j6
z5P$T}5>K`--dNY$OyY+5Z@i6ix^-}lmhoCBCo7-7K(apAnpy?-a=zPh{-JUM54(j(
z>uSON@B@J+^w(QD6s{@t19SiV4}zR-9Sr{Kby2vGYG#eg|9wxE>|9<hvXjr>jdM)b
z5zOVLr--X#{-ZY}c+)>;Lu#q@|MZ5;7kh5HA+yrXzxSrRf%KNYF>fSc<?KrpZY)<x
zJ{?V2Td%?o=b3omlZ)%862zW!Uzn9=H2JQ#Qqem6g+p8}l1vNP6`6rPuI~Qe1rT$h
zo=oY_Mb^3?;pf4s>-ehQS-%=uka5`kkQCTNr0gDSY2Q-9M_U6pcp!7oz|xA0(&=yD
zsHO{O#22}^s>n#XzpRx5$3ULCk<#jWayK#>M(T1ImmMJo$kSf26B_ZSfF_ek(Fv!y
zXP!-=lPFJ*BZ!Gp9Q64*s}~KX;acVvO<J2ogAh^h^+g%7i|=I=^H7wcUkvaDc2`+b
z1=H9PK}NHyYv7n#*=Ga_K3wdU8BJ_*@|)QqT*InEnWn1AvA$OYr<P4p-&@|KLQR#O
zE&(aYo~xocVyRbh=~~`rh3^%S0akC;`rbTCE<OI+1y*`futlPavstWD5xT~yl*{;}
zE@uYgFSiX+{p4UPTE7vZI%H@*3HtrPpPtk2V}T_2rTM~!n!e=^2jhxf&+D><^LB|P
zd&_f$w*YS8mj-!WG0Sd*^d)0FNpQC}81Lg-wr##*lS0K9$)QjuF~RfKsOKP|GKU<(
zd;qt)%zkNK;?XcmP*!nxL=rSK($y!NG$3_KF^!T;MtRLlqJ+34Yyi7diS(a)3!J;y
zH8#w0)|!t!LAih36=nz2L>sd(n1(6fWi84~b{8DC;iuN*O8ML;YcJ_{)-p5gK%wSb
zNuNIz+JQM|@_bP7)|T-sy)*URr+KWg!-F!eL-qmS0rm0)W`WmTk?c2f0)a^nhBJiy
z!5JA(qYICv643dUG;1%_-DnXvo9zY%UC2fjILA{w78<0N?YOsov6w}6N+;1j7LP$?
zj3h49o=_5xb7_8BS!`WI(~xbieou~Cj8l@?1uY0t(2VWrnHN>4D`g~o_fq0Ts>TgP
z3~42hMt%o)=x-umcw?R`WOO~)Num|lodM;P+xQgrIwI9&3HEBbg=({U%q@&Z;~6Yq
zAzWZv%(~MVXR}E+aH;I=VFt#=a#_|+(IbLl8)><`cO-0d&v@LoB5UZjuEoLSGS{id
z^hMBS->+ujv2<%pG{bHgf?*5KqZetoEkiO2pqJVs89{9>LniC>djd|dZ})Yuss{K%
zKjJ;H`?{1=WE489x*AjEE`u=_$)us{CC#wzHoaU-%FXsw__;aY7J`0B!6MU6q0o0W
z7<K5}J+3vBS*XO%a3D|#&PSKbsj`kFs|J|{S48p*Q9`SS)!iQ~WlC(+d6iW+-N@*Y
zNQ-8Gb@z!Kkt~IZ;2YcIyli!wZcKX_g_7Ih6GHJs<Mp5^@jT#pG>BA^;tQ4XG#L#(
zW|cDNP{NEjBsW7t%?UV;1}sr6y|ZnFd1oK5d-2}J(s3h8Z0*|;T;(j(!_OXr3>HtK
znuM2e?|qsJ{yAS;P81LGWYBR%%|7#woGgsj0M&9da4BHT1y~kn_{hw8d#nz@mHQMA
zFVYG5^asV)UXmOb!|0q7`B_9epnVW05pA7b3rYR-nfznzq-oQ<&uMNst}V4lOC3u~
ztO>*8HdjSpig;iQQOxyr)=wlbR}ho~XYD0zhCE!Ypl|JOc#S(Y=Rk5uv<NNBYaH=e
z(STJtN1wX?>w!5dwjUD3*8Uur45F&dCJtP@U{V8hv=wpFiF1x1;}5rx4eV#-8eOkV
z!s*haJyq)q=(`;^TKdC@yf=}2O3#AA?Z^oRe2YYd0-zP{jCmqMT3C>s@h6-MM%-RC
zW6NsOZSlrv^kFvEl@ukaFz71H#%^I=Ic`C7hy{$M9>ChmB#MS#eA?XNfsvfkW8v^j
zKD!7(;AkYj>zd`McMTs6>MW5%^=%+{TK2nP4p!wL>*gtCHLP<ru-9TLHK><oEDL~L
zypK{;i6_1!VZ!J4*gVT{qxjsABgN;7xl*3iHQ<cT9E@kCUyZpC*7*FM5$^HHVQ7gx
z+J{ru0?w#lEPN}?4RK3{qv<}fUtc?;fT5+rGeOMja~kb<cufWhpB0fnEz9vo!94e|
zO0j1oZM_*QicJb(Zqa9-LQX{pzrg%Km`JuMWdLW=9ZGIK=-zQcCbVnv{0^lZU*wmZ
z2Jz54XxB6mlpYEk!bC8!2cW55j4vsU+#Fpu=gIL|T2XXU&K#c=vjAa+LBA=Q-cD+g
zrFnaNeuw-RKN1t!zY>gw*_MFW`d*(Qcee#rm?+{-NS~vmxmK)No>BOzK1IfKaE)=h
zd)6jw%HgHMPfbMNE!{PRDh}bx<G!gz6n$_jto+Z4WJKP`DKDoRNFm%qZLLDw%_GUW
z(mHMd=4>Q?^Ud8InD}Vy4rmT~%&{5ReeG-@mFe3o>z{SBWuGjZ?={nVNDAPh^d2ff
zu$M-_NTiY>H|{NU$#&xlN6U1mY`<|P?9_rAGpPsb&S3Qd$|d_iL>Ebz{_3i}SJHFJ
z+?Vz`I=4CknJ*12e3;FHeDi*DBgNO*ksQ){9s!F@&M<N&Iw?x_PM}Z8QK{fA7ln2r
zw>ZeWO-9E!+pZ$>F^9GZ<6)v#l&_HMxQe_dSEtVqMDZe=b~&VlD#h@=_g!*tr4r;w
ziwlr|qYenL>PJC5vSm2m@Q3J%{x~Q*jHg6Ur*YTQ9Z0c?ZxSKnt5c2o5wUwy(8qXG
zxtLZs{e;wUx5H@tBXbmUHe@;YORyO{3$|=E+=J7Jqr+&lS;2G>5uxg7D^Ufh@nrNd
zHr&+aM$n19cp%0al7^AMm`5>4gV808OUfsyHd7V~oP}^zEWa<NYcKVHN_R1Hg&21?
zH?|(8=m1T=JN=Z#KB<9I-U5)z`D-l39+_9Zv4AXc@No-<Yi#r+0bR~Rj-XOI+9%YS
zd<a4vP9~caL9ft@AhVeb^&>uRX)PR=T_ggtz&tHH?5yRrOi*DYVHvwvW9IxC>&ltB
zbP`F<I~gW1@hZKD4&~8R5zD*qB+EIDmbWkj5WdaJJ5MXJ^abf+I-;V==w~1p!n|o)
z*=TYR4|On-<#^i_G)TK@Owd&AO3+D-OvE8n96Bj01Zqj^lP6*RUtR0eal`Z>|Gc@K
z)iq~A#ineSM9G-gwixaei<fsra}|Oe?3AIj_v^u~7>$nfs>AZ=4EnW?k>q6P^<vN#
z5>~s2<+{Ga_56}pvfwydfFUmDXW^d5UtQO+Br`4<6K`;|SPoYCuZ>=#YS4*$NBj3Y
zE39J_^F$=uwS(i<yY>&YcV0u%HDMZPJqWqJlYw)CmSWY3rZfpKT^6gSgxVPMD+y(K
z2c`oO`<+%@4o=$&>dBQ1pLd+&q#^HA?3F-Fm)StG*WsM)8q;01ECE;T!&LVA7s2N9
zoab%sN~^o^$GwhCm6f}wcIRr!$&5F03$b0JDPs-jQ^jzO&k}0wBD%0`bq1sE2XH~-
zNTQ>$teKdsF&xWnqFheY%=C`onTWt_&RKvfnRWQ#bAt;SfWcj$0aD&K+ts7}_A%U%
zUJ*}ZkWkkJ!qoQaO?93$PhZu3tR1!(gW$D=+Raw=M0vw0K`6JQliG2kzFTeK-r(B(
zpmMsS>o-EE@3f&<A_8lZmx#l?mE0D*>J{CM=0X0z4T3WFK(oP?-vcQfjTKo$lfWk?
zmjw4UvBM{JOm=+U*4l@nVZTmN>1uym5d-ExH=n=PMB&H736hRQsXm^RxbCRbAD1h^
z-K3*a!Pyn+tg8^W4%O;)FpgJIjI6?Z+55r_LTw$79GEsLc653b=%7Wm32%Q8D9;ch
zm*&$S891o7$LeKi)bGQhXJltOckfd{J9*b{V;qGau%}0ptKj?K*9#IPMqRVh>1oMH
z7*SO5MSev+%Z9#sA>k=GmuwnpaYthfC)xU5CgcoBETTHKVK33HhPmtGM5~-fk`Ue1
zCrH=bY;#U|HMzgcWd!CDg4*F;Z7=IVx^(^hD(#)Ud1JIB!fw81_))J<&PirqIflrX
zOe0vx6~puQCh*6&;cd2Rhr6``A|I5_qUkv9mCE0~PzXl9Zq`GJGGB|jyX`dJ9q!(g
z%scJmk$SVwoMlXHv+J+oO~&@S><kx(H{Bg>8`s$($c8t8`Z|YjTcL|ljD&!gAapNL
zY4O0l!HbsuqAQ$*gqZ3y?S_M{*m5E!Dj$o<>>@BkQ)w3TNdVPPhlT+~YOp$~uxfg$
z^e~-Szhc}YBXf`790K6$bRTvTuu_(-WKPF$(A!ldO4L5LX=D63ZRxXz0D<*vGtwk{
zqcQntm`o?zV+nU)QrMhT_qpu{*J|=*kZtH%Eu`ZwJChP0;`0%~^zL1KBu%36pe?)+
z)HjODYt`DVlj>n}zjopW6F_lX%7H<q-E<gT4&q_d8Xa)ku9JNFn9t73DXiY`?n~a{
z8s-&F#;8}y77}T&;Wsb)*5om8j%z5yjKFPjIReGhCEz_moO|oR(NOQ+U>D&kiNzCX
zEJ7Zj)nJ5Z$(J!v-d#v;?t4c2d&KPxN6Z@HF4u|2%)~|=IvCMOJW?o*WSH)0#C#Qz
zx2Vnx6A>_t=SC;j>uBc@RGf0~Q>ye)U)oNf1m5cetF+@xw$fhbzG6672TpkZesg1M
z`)At_v#Rpb<c|?&#Wo4ENgJ``$IO6iRD$T!m<VPs=M6s@XkKMQF)Cn+U(R^@wS@${
zDBAnaZ3P6jP)iQ1@1D<wAMBKt+6>OQ>{ygw+dtJdBodTk)F%KamW+V&^k?em-rqLv
z*#?Lc>|TsZsJp_%cct=(-Q7Jq6d7D&bXICK+Hb2Thv1}E-cA5bT$+Y_V?Ui-u?j+2
zPy#uDm%vc>-iHy222!gZ{#bQXBuYuZXy_^^1P!P{I32|p>HSA#k2AsB?}JTs6NX<e
z1J{^r;Y4=%`r@3>eW0{hqsaxyBU;I>^eOc7hSSie_z%&QHDL&+(@ET!(Rx;RYjv(j
z_(EuhB<Mu_kvi|;W-3w1)zNP8crcl@;~r-?U)v;#-=DQfSow$gDcG#^5O@H$g%`m^
z!a9j^dQ+gWE{GGAX`Gz4cN<5$KNvNETp@coxM8#D1$^P#m{mej-)R!~>CZqfT}cJY
zQF{i8HFdeD5`KF~?6&zvmWn}1qAJ=+GR?d9Gg@E$({cTz)~X+5l3G!t_T@7{V4|=B
zM3@GQsHds+eZ|7CUkCxfXGK=63erZA=akRZOv5y5ZI088XcJ_jw=h;v1QGODCzr_B
zCwS|vL8@#kQyNOA=<17Lb7LbFt-AQuH$ztR$K<>)OV02Sg!abj+-lEVq4q&@?jq6q
zXTgQFBTWKCBaeB*D)?fCoTY0*XKOd>ox^L1{r>UcdeDeJL{9TWFsHc7<TC93XqsON
z^m!Jp85;5@1AG6Z_TM=$#^Yx}WB(Lc)BiCeQ6uZxkAwS38$@dw<<7?(OLtMEvRQaA
z>5oIcvW?!>jO%-iyseMN&p`G9rl)KOTxib!k4xf!vU4u+^JOzd6@$SN^_-4wZJT8;
z?y$Lz_MZi{Azw=4)W#ta>wrfwqA!ic8Mvh5RL$+TS!>jGTYIl^I@hnB1<hyx7j-rp
zl*3YG>Of|YT)V6i*vBshJzIF8p_eag6o#_lHHRdB<@qk;u@t%T>B@e!Rc$;A_V_vs
zd^_wcb$$gVG@;6|kbnENqH>z+bSI+OReZ~Za10^Xm7@9@h;&%iXl3a%`rB}&5_nV0
z-X{VH=<J_&OPu1$EjO<}w}rSTHKe4>MIim^S?~s|zu3|<5~-j`ik&h^U{oTRLFNcg
z7y%X1aXy-gr!ojxcAueG0&xi;=m?g@B!fhF(J#wMk>rFyQfNHSQa_E!nT48**(JB{
zTkio;=2bRO2s!v!QL{-$Q1DBtQB~a0r5)aH33sZeKjokeJ$)9Oi7rLu(_E83>K<i1
zI89g^6!v=Rx`lpFyBT)kJno)DP=>^J8BV~gU5vvi?z7i}`o&n%GDy%RAS751#TBO8
z!i5hG-&k#OPI^W|)p;BVf3H-^p4pJllEyXct*2T^H(DLqCIWWTz8H^i#e>apInvog
zpRv$k@|<SSS{VIs_6cEW_zN@r8HAG(7S+<eTy7T6`KT*h+@PgwQzeP2BV&{B%<ngT
zM)iB&-75&eR8_WH3igUpv(pz8@RGcVo>2?Da8U5Yv?%#Gc5rJ1@e+)xlT%i%_|DFt
zcbSS}U+1wyl$Nu+rUuc+Xn@r_JZjZ<Yq=Kj-uWcuNYp3HgYm_);=lx1KrJdqOO%&2
z!r7FFDu(#CP&v2_uR#B{CW@=IUS}oOGMO1msE+8LwU<i4hZ=1@eONni3!{LM>YVOb
z$0(sB+|GbNyGMun_1Eo_(?jAjb5kel540}htCF2a+^aaPRkAJJPoKZ~<F?U`iGFgb
z+08{(K}&;U)bCT1ORtC&7pL^;XfSYrBo^wMX%qEjhBBCi`9p9`HInWm9#5J2;<%Pe
z&cZ}v)TFq~@6U!^Y(}=zsAxUhEL1BpH`Oq&K#o0B;r)ctHL-l(n1y=GtSHm!+;8U?
zKdrnv+IuIvcJa<*=-y!2i345x2-Eq6{H~@a`T`kK7%OQT3N52STTErXVBdBju;q^y
zZ-@a4&wOi~H9^lMuoEA2juyU$04q)9<o7Bhw5ajj00tVYrznDim+74QxdA9}y}w47
zpAQYI?n5~-6k2|x&Yh$(G?*c(ilmX#g3Wj9Tm9gmQ#9?~Xh!@|*^KBxP=XSF760TJ
zV9qytQmtGcaN(%GHpXev85E$B1s?JHy6Ck5sA6C1`sHGXDy!$}(S9%u<3ZYWV)?BM
zoA5&F`Cn{=dNw5KF`LG(FlQ}Qd>g51hAoOR3~2=+bchTXt}~B`0ee3QyIGGbyV?pm
zd$m`muPZC3Lu7<I8*)rcK*}`#OnDhB$<Sm(T3=9c?QEsiykKzZv{)p%uv`+Jh4Jtj
zl8d?#&lh0${BtdBU7Kl+3N0c8j!4lifGbbNVK+((3_){75)3zj=yIJX7>}kTvc&8!
z*8#f=JPA4@;!4#e1@o?~;LZt|fz^S?y~dIRt`NJq**~xEnS>9-e2|*9h=SLu^M%3F
z=E^JXm~!prPwR)Ry#1JG=G&pwbsEg`XDb|xfB4_fo62qC%Y2P8fciG=oK@`QgbyLR
zHhPv;7n2Ng$Cq!Q4$5&YSEgbwCVcWWWe%avneUuzoLmJyIz(Ie`niY&wZ1dGQIuc;
z$!rWf!UPNbq^|=gHGRMffU5BINZMJ$bRN-J45ft{L_A$DhFKxp7<O6r^<sB0{h9C8
zRTT6>yLN45-`$q~mj2v|AD0<8I|o`E$@+0sn11lBzH48_xl1u`WyxP4s$S29P=CGv
zx323ca?5TY^YFBg(BhLH>nq=D&WG+o?>YS`@S-ao!L@zf^suk%@`cYWuK5Druce&2
zZf_k87q>KXj0uaq{6$(vtv^PKYS(2Mw_yEA^Pc$;n3mL=`_uj{Yrg@GF>SqZ!xSP`
zpW=0&yCk}MSzXtO)zt>8?$|~GeL^jLSBRQ#HX_s@Ha9^*IDmWlmA3p+snYvOAq3oG
z4+u9ax*hat)&!4ErVo`MieXddXmL3YGdH4YT)L5#5mUb##UJ5nq3!s@rg1%}t79RY
zg2C?cO_Y;=CQdbDi6ZtBCmX@cuBf3t<g-f-`>(7c_$rJBDowf#CBtx>oMYF8A862O
z!>K+mLWzaLK~nqbqHHANOa|dcSEwL?BEE<R;bfpw3h?yfMD1WDLnEPy2)c6XjFE;g
z101<ciA|0=hI#Ozx(5j{2MPTuhv*ra9BJo+L_)B7E0-WR1kQ=e(S)^yY?VV&D7OsR
zNUnM^Rz-|?`79eQv3U?Qe#RTVoTZbdGdmMv)@Aq)SPoP<v$(&s*i>ppQShHnwjVt#
zGc;%(z$gwu6vhL=B~zUfFbp~VX7<iuRZUJKDsD1q9U)Xi9Q>95H{e@PU~d<<R`C=<
zUAh@fP4q^{y@*%NfJNSb`AlvpYmj;WJ}mk+iV|byoHN0SM-BMGY#eKAPk>2jP4n|d
z=xBD?w}oWBxC%Z?$YhRS5LYj>sj+K*jnB8n`QmQA>qWYPV~zAJ?C2n8IM2R^A)p1U
zKd<6BdFM@5(UE66>*kfog<@{}27H!@;gH^X)m~58<z4C|2a2i2^*oWXoTP1RC(skC
z-d=}VAP578O6nBJ&eO33&P|)ctrgyt<ayCF8b@#2d#A^9WIH*PsHQrR`m+HOc-Dsz
zPmhgej3L2rB<s0N(Jp=q$`QlS0oOF}EF6%`!9Zh@N=S=)oKTTcWg=138dotEksRX-
z>`I};+3Pf~hTT16qKQhm5jOnN%d7}Kg?kjA<qdT3F{;;|jnf4h%N!{o6upHxFvbG&
zg#`l8aX5^-Ud%7FWx~j5qMWDHSrpw$$8U3N9UUK)JldS13;CBju+5-iav5fqsA6l+
z*P5!4$vuF3)m;L{MjvBlt;!h`ku6JA8z-knlg9ojh)hKr1y;0KT*cTaS75iALkGHG
z5sZctXC|zzWeoHm-Y83cS1cS22bq8i^6n4~T>YT90&&QIntuNsA8@t3iUdfG2rB{&
ztssLNzhyGXXf1&@$`T8%gtp`0%Gv0y;n6foyl^nxXaaF6h<axcbB9?gXmwpe<6^Sa
z?nQ&}%0E|o5iuxxcwSICZP0Ck`iU`&64O3d<96jcLJxJ=dx&lB$n!1TiHjQ<pJ#DD
zXO=kWPN0X&(VM5N+%3F4Yk23eYcns8Wuv+A;v(zR6^oUQQPU(a4t!*sC9MMj9_Pl|
z;&#~bOIYO>;s(Nxv#EWo*{sxiGS_alz)cJ%{<qo{n9gGJVot=mi|Aq!ecaiO`<<vH
zo#zFm7B`oIFs1nl03#y7+A#?~YFkG$TH-r#IE%tnq-J8>K{;~5z&cEm)FxV{VY~d8
z#C63;>1anc@+>HQHyC^>vxc+4juMdrrPO**?TjWI&V|^jc~M0C`(3%@)qP&CR^H;^
zlN*=?bKE`I6;G(Vb0+JrVnBVz|E5S7pCuWNeW90)*YwIBQl<{9)qwa|DauTo`e4vg
zj}&LApIM<PP(90=JkUGLTE2HzCC3-6C<M#zH>n#9z3dV%vxY}MSSR|^p`kgEwdn>4
z6N}*<3;%pxV!SzbPi5t-yDAZ=Sy}{7jlQ&!1K6*w6=8D&FHAm&SmzP<Q^6~2dr?Yt
z5)$d}exQS;H=9V5ix}6A0X(mR5)>=S*p@jd=5osw-JIm!o$&C5DPlQPU3y}MoE*lU
zEx6qzpegepA*(Xk`OEAEHKY!Xjt<Ov@4Z?N<Yt=cv#`N~s0fG*fv`akasv981%o0}
zM`}(piT;LF9-(kvar`iadO>}I6gE2eg%SNZgRJ!x<ygIN2DJqd2!tesz7z4DFM3@M
zQzd0-I}gpM+z}_J-pF-eGD?F3I_?1>epzc(LH$YIxRM6&uzt9I#Ga|M>3GJRg~A2C
z@5d<m@lbvtehG@!`@z*{7L3D$O(yQqVSUdDC9Lb~lZPGot3N`gji@p0`eD7LlwdZT
zG2h-Y%J<_~lukL8n`+Faue4KaNoNDqF;LQ;u=!C@bPN@>;skRlAwO(J$>)|Hm-<M3
z)yJBZOkXQ(!DW<HSwf!)-GZPkrn(agMGXR1YHtaET=p)wl>XQvrKghx65drlPvQd%
zLqRFqC;mM_XF4d76J$i%dGP|I%*S^<XF>QXoB1J3E+XG><ODj(<3TSdy?TwcExT6+
zxJ-khZ(Vy1f}U~k8(-nedpA);BN4@<;IA|)>~+GL331@Jqrj@-0FWLgdqlA~mILlK
zflIQ`oh$a2HQ6^=X`mm9rbdcqn5;ZIA^-S!m4S!@0!Do03GT81+G!)6Os^at4*t33
z{cH=b-tL@%iOaNrM3#7w6ZI-pN*ZAA{24;u$g$-dy2U_Q$}u?)5*hYq?s%;0Zkh`a
z_gMsM2oZzh%HiObU=Zf6Q0FR8Glqh}Vu~ZYNS_?S>tIBikxmWu%#HJgqXmh5Tg2S(
zR#kK5{m~xB#8GTyTdfUy#cir5)gGZa{21!}L)J5tpmklF4T*#Jur{Us*7&5VWLtn<
zp#J)_d9n$Let8~GBjo=Ddqd~)Wh9#Nkc0%zU;hDwH&k0%#dLP%$LS<KJBudTpO%k%
zSXagw^CBRV!6m{UH40w@UJ@JrXySvTf9++^#I;JI8KmhX94390-44y9nIi*&r3h7%
zTmAD$73Qd?w1{B+4)nov?NNxEaQ}IYF1@{NEJjbB$A-n^XxEOTZ(q2f&*Ts-F0C34
zBT=`45Qy?hRfz`1@ej38r43fE5>(-4SKX`PazPr&^kqu>aSd~Z;V4@2>N~H+xFKDL
zHuW&c_F~_e;9+?shO-M@Xk&hf_T_{fB5le1@pNYWe!+0?YVK%IV8Et_8=8+{eSGNB
z6YK|}DG#z}L}FFfSR%z|=Q?V|#D=;o+~~_}aTR;TG6Hr*@mx)dwr2M{i+UVyRJFtu
z41D(Pn|fnU;$!dCn?Km_PxCn^GtQi2(D69V>!x|M`$Mg@L`RD9E!kBs>W8zz^jV4|
zC=I_Gj8%>T4tcSX-<Hy(<U&w|QgtSTEL<6c;zNpg5l%+#J2&JNV`hI&Goo&_+mVp-
zc$C1JfK{Rsk>e9NiY`OhENnxim}5^<4O?OK($gY(NgU`V30p;+@$ts8eGCb;GaG!c
zRFhuyW*1`&u&j@AiL)ao;alnb6`$0lxrfqUB<j&KImRo2iis<m?}u1zCA;U;;>{47
z$1p4<tvO(;g%CGlA{k=M?<jSKRP50X#5FxT&NFm|S`Pq;yc2c9SrTarhp1PUs2)n+
znV7}~Q8+~IVCJ&y<_23tgWW}6B|Opl4KH%|Jk9KwC4FTFfaSzcWv;x!SXQbRlm^fz
zXr_$T70p-2BwhB7hJ!2aUN0<$-_rC+jF<L_+u<^podU6*kz<uXE8m00Oy3NwiZYgK
z5{$7^mC2u^&{e`X=U&u{Az_kue3ABlRg6_U><(tVC^1T`HCV_*Q*Ix(%aQXU%`*ey
zf+Wpxcxfys)YfJ#5}g-OV$etFnuJF)rkk=|WK|IeX5x6A1Fp>m)DRMx>}|E)YRguV
zFoTW-iqa8)fVD=l350qjrJ~SU;I0p`5mpDo=jKVBBhke2fR-8;6qwW44ZnrMs^3fA
zZ~e^r3OT%ZzQi(weIghmd%!zdi1RS15-<BPVh|t8+LX#^)q}=Gup`<mXgrBN#-kbY
zv>z0h(FNoK@hTDe6w3WRVa;qfg(Zwx#NH%~IeQOUi=A*oDW=NdDhkH+O5I6uw&xEO
zrQo8jnV-?uUE0FO9@1hR97x1FZM(GU5RHmbJ;J~|f?2d65fP0^)CETPNTh9=2v2a%
z>GlY<T8$=}x`6M_AoA#viUtvCdmX?O#pSM!4Tp@i*Q&;6!(Iq6l9oh!2%*FSC4f*;
z7-Awd<>;33nLUkK8$YvEB0q(8T6N%Kn^S&M%FAP?LO6^F%ZD6RPwuR9dv?NI>(v}`
z<hz_T)%K+d3M0+7Yi+Vi{G{TP^~pfj#gMWhg)r6rj2(7iA<xb5Du|hu*`<p?KbM7{
zw+tGvyQ6`L+k*Wiu0DnoD&aJ7tozK~NnZ<0M->%K0TeS1=8?ucWYavq3VK{p$=mFx
zg4OaW$YCQIo=puaE7ZDNz}|m}EP=jGqDv$-^!lpY9cZnngjg#LARaL7=44&;y6htj
z;*<ufTpcBcYcJV4HgzeC*W!|Gf?&=)YtmPzxe$F{G~xUA5m``miYNX>q8D9rIveu=
zMohx~jJTO7xf*t5z?HLTdW@fSQP>}`GkMAN0`+bpfpoH)Ed!=F0&gRh^brUBG_I<^
zpp+aAn{X~C`zBiqqfJ+vWVG)U@TeDV{5!3scb^!QdC#cB{q62-Wf~ZP2ghbBo)Ru7
z_f2TnrlU1Mm=$mHOO4&}tlCHD?x`{0P)e-scm`DRyRnLT@C_&N2;-|A?IYm443g=n
z)z@n<>Z+o#<y>0vXn!zE&bgWbU~1)6Z|)JB-(D62hdl=W?&uQCjao0<4w*%3?;gG7
z@CX&Q+gkAu#a#w?Sg0lNb&{8K$OS5FJ}4rmz>ILuiF?9(6ZUEK4ce|tw=;SfK7~-q
zp`)q0$zC)yq?Ai418X^yyx~w|=Oe`}DW=FhzGyBu*Obj49SiGfULvL7zA<Ih&L)5y
z{_tuF*SCr!syU0?t5wZN$oYv_G8m@sLCpJuw_HeMFMT3a^r2D-T+grnpS?ftYa_|h
zK;ik@pCZjn83_vvc&REc^u-|Cn#SM@xT|YC9!(-8kY!1!QA);im;1B7XN@f*CE;@Q
za$oD$T^7pB$XHICIO}uX9=<(k?>FdK7i|+Bdod}7toc+(=MTvy=y+Ro);rW?07yW$
zzj;0?>saYmK=hV%#A4>=;fa=_J6Zd~V-hH9Fjvs2N`7Dh7Hvi%+un}Er^+n72cq6Z
zM!s8dakGXbx}?>(g37IHMkf<x9{N~4TUlR4v4*1e+3Hlmsa%4yHxoe<&M_bth)dqp
zKHLuj?v^+u^|Rb*X_tE8sp+oyO-@f3Mr}S+rJ4C>@ZuOye@t`PkiBJr2#KG?rdKnj
zg(ld#JFDW;qC2Z%6wN{`);9{GQ0HVIO_BwD+}Pg@`jPF}U=$AB{`J#PwV=h^pTR@(
z%zbRXjICt2*x^9}8(G-C9w(xj)Ey_(jc6iAnh7}07r70{Z14syVRVaFTRHm+w-Ve~
zQ%El`saAq%Z0)qDdP&hlTnM2OHh8Q0O_Zk!i~oZ_p+9y#)3=-_=x6506D%w&=bkC%
z02HxT42KADr<|u3LH2iv01h%=9Cc<V?e~v?hg@@*P_GrZku#IVhU+iD<0};<(Hn<j
zGolz2G#rhminUJPSwwsz@w<9Eh)_l@l;~Hy<nj(1Ktk;_V*;KI2}Z+3!8eKzb%(b%
ze8~hcj{#W(;P_&Ues{9>s*Q=O@2zL#V*bkDzQM(u4KfGio$@cTM4OWWNpkwK{qHQh
zOh4uY8Ls8^n(ensfn2mbRmtT@IbA5s@iReLyi%T1+gR5x(5$Ha>wEf5Z+$17T=bHi
z#1l~5OIQ$-!-6eT3}5>QO1;3vXzNw57-wF#7O>*E%LNj_H2q{3Ek>f2Oh4cHO4Ry~
z*m;hxy4Ei0ua!>n99>+46O;_9P;c7h6N+D`_L-QcKJF<@3l|d_^DeIJiVe-vyvd<M
zqfHt>{eNga7L%vYF}p1>7BYygUO|{mxykG{uTqN=Ve0O(>|>?S{mPgfSHAx(R#Y1a
z#m>){a<RE{&B8`)V8IQ!n^L%1o6W|s(T-}EmP$dc@eMiGtpI{DC#*^@B6lO%GfoOG
zx)BvdXeTGk+%=ocPYR+3scSKGwG4!lLd@}_Ezn!9aP_E1=kAEsKx;Tphgb|%!(&R#
zl7`hsNdou1)3J0=7V11Zwu4PN`}YKrP=Ev|0fCh!6L~{PDro(tz)|C^p(iFo!ajm!
z?0r}#YoZ3bx}n9)za*_$Q(my4aY3a!bbJ_qo1#shz`YVm$Iw~f1F7XyWWjOX;uFKv
zY#|GM;IkyP4+p194ywDm<cb0nEIpkezWXS`LhJlX0axy#{YivbQfbIggORmN!1yRK
zX}QxLuAN|J$REs8qW%&yr6DcTX!KmA6fQb<35gQbZp;Lib;r5f(3gcbkipBG&(mZG
znsaHrj85N>kx@dmKfxdkz)g~`uUYwPz_Eabpj|N5Z*e$a<W|c%hB+RDR7Y(^%+{2g
zIV%|efVY4<3?c#vi^G_2(7;VMKo7s16eFpp-O>Wul(0#;Q<@8oU0@d*^_Ih}(U4$F
z^!)p_Cx2+JQGF#Q>11GCwG}dG*q+Xx4f<y|Ls+>aToL%0U*(#u`gtE0CmjPbrS)N*
zsK?@7DHvruG2x8(kOhU39lF*6oY}Js>j6<0D03Ex6;6H8D4k{Fw#b%7zy*^SQ)*eW
zoS^_yTf`9>l@4eq?DiwXYIaL9az2}FhM{>d4whS;YSMkgj#jx^aX3M%UL;H1K4yc9
z);UR)l(W9KfNS0{f1Y8gU+rlU^XqbBE_KZvHs8L!!%3P;4$g+C_DJPZwk@=ROPBlQ
zyj`y4Z66^6_lRVMP(6wtTSFbb#?BXL!b39fnq#%=0`L+uWK0r-*GVUnoQ?`TinSqS
zv}NHW>mU$>Stxvg9-(^ZIpcS<8amBl%fk<JZ@5a{Q_C!t^Q%^x{<qo>`&LSV1-MsE
zdiTzUX>U@L8<+LZ-1M^vpGS`#;J;hnKiqWx#m|HL_aFS*)`P9>M-Lx<zYX6vw;n$D
z{{Fuun_sUB^`99stt9!k+1YF~oz1y#!S#R9&pk>U+AGG_tdKN%&18FX^T+k=&8_WL
za*_@{rU-Tk-$t+z^YOSyo~EN|KFR)q=jX)`fmr$lg1QWMuq{N1r?yIpGs56E%}=8I
zIIi}E8(&H*<9;fO*`&uHnrAu43fEM73=Vk;e?~`(#=fs%&YMYPZ_!2_W8lUVcd3+j
zc0!}h3p}4VlS$&@OL}OSVGtwrE2;F2-1X8a3ZtXL26j~{o1d}MdS>1*zrL5XxV3~&
zMl{G{JMN1`YPG#WCNoGu_?T?ebp@R#c2cw}f-fEGjrKx1^+mlAE~icPi{8vsZNLZb
zp`C}+-XTV%<)C@k**91i?m*1=4kc-lj(C*4FvOoyCr5?-m6iaL1_&4z+bAX_!7iP#
za%bkcK-VE$%#cu^4?~ovczWP*IE7qLDJ<YvoKLTi1RSEmk10tvo}d*A1&=AnV?<qL
zDI=hSg;$-E<mBkZ=})`I?F7ERIX?PRXTQClJpUOkwv)Z1H$NYDUcNd_UL76mw~tSf
z-NStZ#y>soJb!z71V60op1_kUv}54f?%~f^b?dl&a*`Y!C!N=C4m!{tyx@5E@U+uD
zX(gS*y@R(@yg7k3u+~9x(0ScCh1*V#TKHbd0jxZk9KA?hw~zN;!JoU&I|rT9pXrq^
zI;V&Dx)<=i-Q>;g@o8u8?ZNJG^5*UFo1+tI4ac|NIoUhd?YwU9gJ6FM?@g#4ZF2Hz
z7ldzrxJN%7wvTZD-dLYgTL&GqiSz4VwELZ75Z7>6_S+szB6RWq7|)ybUI)Ll|J;TV
z?H>Q!f@X<V9UY#u|KGQ8A6!rNcVF+mgfTW2%nq#3-rM8$YwY;Z3vB1)?emk<&gt9J
zcJlJ*XrHG2q<#FS&R+ZENpf&>LKFA)q}_s-obKZ5u@#s#xD4N)zdh;T{L!Qzp0<yV
z-%=W76W07Em?4;hUG(A7Tpu0Mm|?Pxj(^5>aWZHrTFFnZ+VDH9`JoK&^mrGi;{+yf
z@6^2$-U{=1>I^nHY`;9{yu_Noc=ZSy`l)k*g{X1yIwyEfhhP5FF1-0I4xbhc`o>=!
zT5i$OCY=|_?*5-T*m=GgTLY3f=?MA2uP1N!Udim^wzzle*1zZHqkeXtbO~Lv`{MQP
z-tkfQ)vbSrAM;UG`Q2W4ezM;^IeL4%*QQny{=MJmb_e-r_Nm)#+IwFfzSVopZ~N^R
zyKfIp&F{bt^7Ejn-Oit#R)BKn-fdot*r4{;qj5IE&bl4?^U<63p){6!zqxsfkJKZO
zzOpIY+zM_%Sa5u@OuC2dQ#*798$+ARtV}NRK6#|GX%~*)Q3ARE&+@-#1L)^%+a-QU
zZI5b(SI$Px1F*E6KX>=EBU?ZI_;B;lfqhi(gKhY-jXAlM6`&uFUc5MIpLU<a4oMz8
zpjQ$-=wzbd?mVL+sUTk>4`)k}&Ig}jREv75H(I7FcWqFC>3^4~=H#huaL0C-|NTeH
zR{sj0iu{in&t*116WZ6(0T#&rkM4gT%Kwk<Kl=Wg{Qvj(+=?pzTR*l$Bs)mY%5P%*
zH?jVkSpQ9||0dS||Fc*x@;i*=@KyWZ4UoSp+()lkIc>!z9c)~#kPr9tGAr58%JPQe
z<Fr{~#c+s0S_QD2^Ye^?x@=42$P4O8HXLiYB%xvAkbQfPQ}qr`h!qaXjb2k3fOYqZ
z1Y}!h19OJqE_pem{499>WAQ<bAg4!?iY$D1lJ<go5HA`>(!(@ntfxuPqvZSmp`Tp2
z(h{?ElR-kP4w)Nz-b}_buM!&P#TcGV<1aHPL2O=6-MgeQ@-$w|(g`MI60kJ^{cVw5
zoIJtl;3~Z)fq*&;-N#n;C@!yQ-ymlQL13X*i>thI2AgKRjG?zAyAKeGQd~Z^Pju)?
z;NAsh(q6*}2VJ4mnZe+Rn?XojBU`^@Qc^p+y<Rq+a<>c$M2;XG8G}LKO*m`EFitNk
z2EUsWZupMY`STKyZaMs5KU2TM+?lqHJvyMo1&f~WQD1@+_-G|ZT?$9xkot&Ws0iPk
z_ij^s0Z@o0uQw$ht%tjVQi{^4sTv@=<s2Py>>-DCdG=ExD2-e2N8Z$&ua@J?Cp2xv
z;ldmx%n*>bYG{DaUd_zzXG_oQ`Z~?5-%u{o`zkHxHY2_c+nTP@D`6{)iK5Sj3<F6R
zqq=q5qV$+-ZJ6ye<!!)=HLYfLk^Hlbm87%YOnmdwR?+~a8<bh1z~ughLpRi>lk$w}
zZ8pK8QWTlmLcbB-^X%DXjC^Ts9I^=KrUeqc{(?1I(D94~9<^ug5_mhniD@*qUOF#P
zB#dx<o#%KV6yX^Ugf3z{clY4%ZFe=KX+I46x*e`{v+3{_=N-<PZ$^AxTeSRa0wAYl
z^k~8<{YUFw{|ujs{y!BT<VNqSy<@Ka|KR@phnt(B|L@VmZ~ni(%cn;D|Nfin@0*R_
zn~mU`jo_P&;G2zL85@DB`4Y4QD!%;<MX_`Qd-<dPy9gR$4rs%3*NUl|PqU#L2ZkJM
z3^Hs>B8FMIB=Fe~iG<FHbn=0-bb)_dqsrJP^tV32F<%Piq=tTSGh9U}S>Zq{+MV*W
zLHVCd6~#gOvqR1(v4Oy<wRc~4f$(0l#EXbk$!6kyDBRN&DWPF(%xz=8eb7cqZfre$
zy4ln=+SIe$jB6t~`H+tjLEfls>}2<K`$eaH03?s?Z8aH?(o6!?l9GTv8vKSD7hV(^
zuWmz0Y2qi@|IM)Q#&9;6=3}bQNag{P89kZ}&lt=Ku3(o5qY<7RC9B-Q&OW7rcJ{h|
z0%mY@+&yR?uF`p$k}}EY6^TThBQvgyG1f%#1NHoM`Uy=9>-KTd2z3Re*qMSbp*@CP
znx4%B`4$O_g7ZO><D@$d(i?$r&>g0qx{7pzMw!`#jySdw2c47CH@ka(?7rUpGgdC5
zvNwCXz=s}e{`iPZ3x(q1Xb;QeVp3c|`vu4X7cI){(?ELc8lIBp`Gp4J=A@RxXsD}&
zMDTK{E%=I=glHg08nC>y4GJ!2%yl<tUG8t6<=6)V1>s<M0e#UfC6|N|(4_6e(7+UJ
zj0MHA2}gAjX3t>U8R0KP5jlaAo4~|{6NHEcM5p&Ro0?NdQ%{8=UpDxUy_cZ!UVv^G
z+;9lZ$SwFaSsSHr6GEVLr*a!*oFMGOF($E5UOmW0AnZ)uv=3}%TuUi`t<<lbefR?z
zg8M^;mA>T#REA71YOAE1(>Le|<=N5YHz^1(SmCKR?d%^-BqPwiol7JZ?yC^g%odAA
z5oL7IEwlftw)+)YM6z7}Iv)}SfcOSL!~>mHtpfWPgUHi<{wbNF0Sxw@*#bn;U#Snu
z()JY33gi5xD-<Q{qnMkuXHv?pJis|~wF<MdW+8OecP1$nxJ*A`1NLX$V-A!K`~>W`
zoA)<{W%TEgYPs0odzfc6Ho4~(42G%^_A?5V$32dr)58olxnzeh=ADy5DO=N+&u|kZ
zsmW5}V_OeS%bcVZx^r0DHMEF*Xwp2PmKtWti~%qGgzv(QsJ5yGPg#rRy0O-zf7hDL
z!5Hs!j7@e1EaFN{dvaf;O_!%MJ<L;ska)~fLj&g(qk}=q2EZWw`XqcoP?d1cPi4!M
zGfHiXQIA}r9MmV?f+(42Z?Le`YTjQJfJs!81R&TR(w%+UGM#h2Q%X(3X_W(!CYl(S
z;I3!u`PC%FdK#b~Gjwl}Y_4yz4Vh$9N(FZ^unZobu#i!2(%Emg{KQQthNnD)b1L@N
zU*92WewJV%cwjuh^h2v4-h?}$?jDhcPDG$0AXK(^yW=KoP%~)l<i<ud=U-lzn9hYL
z4LTC9OiVOsl-sJ5$BQ-W<zzY&!1rnso|zN=nL`gC@bt5#C?X$4DFS^nn9^v7z)-*~
zO5cbQ0a}E=oCr4S*S=C_Y4MUX#_AWYxuvz=w)p7Rh%bKZ4fCl$+p432mzoJ>GN)W!
z3RdGH|EOR^iZV%<PLi=?Y8-<41d>`_W@s)dleZ&e<~dhGxuBzE!eV0BlprK=_7)Qg
zDpmOCm_REr9hkHz1~muG0o`SM5g6)UvPrR#9GSdNt{<zWDDx(2uz`(n(la^-fyG~?
z6QDM#x8`L9>1*s+q$l~OsYk4G!n#5cNCsU?!&W>(YT*(H4d*O^pLY^z1y|oCT5d@Q
zZCF03T<~~8g$AT2aEEr&w%{>f>9L<Jtr|`mdfJWW5Y0HM*b$pBr5Z7@&aHFPvKBt;
zD0T|c3(67S%<k~gs@f{*skU8A@(ZkDLzJi{HfpCteG+bz>N@Oqrp6}OIZ4+PCJHQX
zi}H8*cx5&;8#hG4H6jLIrV6Wk@{*lmm(-O;vA&}q2uIKVv&*`O;w3Q5cY-%*?>!_!
zWIy;+`*80F?K1NCV{hZ*n_=-7bd%>(lH3CX2nQV-KNYlX+joJ7;Sz4zvkKr#1Z`Vo
zjwjxqNI3cv^t5o~5W0jC3JgMiR=EvvbkRwWOeFox>=C$#g}UBtzki}PQ^AhLok`vj
ziMVMmW!VS5vhqJGElxx>)j33^8jMBL#%;o*L)tE;Kt6my4D?pDSI}$~&bSKEVC+iE
zMyHh=b@LSQ)F~ylieo<s)!>m^L7uR<k_O56pJ<#Ov<1C&l5e1j@x=Mn3~Dfbj^7%C
zv9pFj*KsMRA=NeXdFK%j@_Xa!2H)CB`2Tfx$uhODXIy!bl^6Nl#hk?DCS{(Q76IL<
z%*Q=!-Z4!EO~tDFX(t_+sLz(>9R0`<g5Ar^3+1}Y7>V49F|C3NeBvlfK|v^oIS`7g
zsO&HKZq<=IlJ81eRSMTDEk{MGQoFq?LiJU0(%U_<a*ZHFV0u?TX!bswJGxhXBA&GO
zl2^5rNU5%-(-N*`Wbx`g{*zr;w^nkecVSkjS*aEzd{}yR`<c>%xvjDy$(#0pm){*O
zOn00OJlb{F1~0a-NARyt;m*>~O}H?$E^etHM&0vQ2Jdb*1H>B7`UL#qneAJ!JeAvF
zD&!G&naHRW!Bo@R*LV8aAV*7jSBk+#eqHz|AFq{X>E}Qo_IQHKXv-O;%Lr7iYPQTv
zy`7Jr&;F9}4%X?76GS<W4)mTnQqb$I1Uqm3tRo70dt}EN(g=2~X|#f9RAU_!I??B9
zNyR=%voC*Dm)B`Gv{AX2n-QYYYwJ7Yt_5oBmwk}0{NLw32rE}Hebv*Co#M*LQteMY
zSAuQ=-)U4I5#rMyD+E~Wf0<<?-A$2Ss{o~DSppuV19s`t<5Eg)mON=Uc~e=PKueu;
zcMW0UCq|sawqh8Bab|?JH3TMgx4Se$dp+FhA$}`09rAo?`!>@^F@1pssMvFsQ#k}(
zPx(6C4t=>3Ik(#_!=NJM@wvKS%BTDVs$pgUlldG9EZsn0aOD$Up(A}e726$0Iu6EM
zpadgD3tLiw5p5nlNX{64HoFkODYq0V25ew)QrDiTA~Uzz;U~kbi6Wc|{sbs%;tTQe
z+3ft?!4Ydl<kS(BfDA`m2x>6c=9f3%W?c>V+H7%i-b|Pw!fXAWtTpLzXtTN0RH0)e
z?PXs+SBz{!jkrb>P~QcD#sk<Acq|T|&B*UyREbngt2}`czB?!jDfv@+?Zdw%SG_yC
z<{Pjxt83$;T#c`v40X-|20vk2f8SM=or-;lEi1L!O1NJKZ@S0rHwU|W?G_sOD$DJx
zv}@}aj9(&>zPH?n=$(#qp?Rb@vj(ostWksP92keh9#eMolG9uXqDk!fV>V$p@ihgG
zqgu}ATF6Mv9IJ#Cvy!Bf3ktEKo{t1u6Rjd#`*)m9;N+SzoQ~;k-$k-hK(Agg=~IPy
zYPqFucxcx)qDWtCC)Mde_bd$?qx#6k<N9+qqA|!s8Z@UuSDo`e;d?{!g6+VS*4C(7
zj!~G2>q$&aCxmKRFMRyYN0${-@pY@h`F3M|hsUJ(y*^B&Za0?;3(Bb*IoL-7C7LTQ
zi`hVJjuMAPG<8{AIqonlap}|x&#v`Bv0$BH$lf5cZg(a<yUEasVVDj#L)IOB+i)X!
z#c+WPGvx)d6KN_Qx(FWRkK+Ff>;`2+Hq+(yV9;prHp^NcTXzNnXOe@tH1kM?XZ!^X
zm2qtj-$8{a`NogL5WFq_kwdj51i+;uT=Hg=vWS#u)y3+~=<NLqYvX4I&E{@n3qsOf
z6@(~p6VS|?{navvk!LfmZUy@j+ojvxov2O^>Rub}IFT3E9E<FWaP7*bA71zXzpHtR
zs2L|8Ej>cwI>k2d{Z@6y48~oU9=?P{6$NjMGU~Gri4%Lt-VrhWl6Q<_o%$IbtXc_S
zO#!l*S0aT;{8K)a@?}bA*j;MW*^IJ04&tQ*8IdCC`eC@^wBKJ~BV+?hY%?h0k{?5!
zjXz34t(d!zex8^|B}!`Ui|d~THZMJQA2rSZUQ52gsLmcSYl}B}D=!f>yJ6}JB@PT5
z)db>oz{6!ED4h(v284wHVU@YJJK2zhr3WeUZ6m+rUgUBO9dFL|*F1R|8#-LLd)MQ=
z^9CCq)I}jR715>R48(YVsDrESSO(*Do_UVtYfyHcsUPgj0zJwnAG({|>BuIs%*`bU
z#83ilRlYCSuKt!ys-B(t)tn%cFP*(7?loOAcl6}mcEc0xjt*?%BE#g2pXs#WZp~)R
z7CA^|YtCCY^~JTge2O0eC~|R`Sa{GRF_D&7KcyIsv4RTR%p&kFv*FmZnH-Y$uT<J~
zTA(NhRGedb6vnXB#*~$md&%$2d{pr5E0h#ElYRD#AJMtB)%Eqd&G7~nyh2{=vssE?
zz!9QUXfq?pr$N)TO0lM^O~XqZ?%dgbEKwjTX<)>xB;588lXH5NiSO8fJ6yweaw0)4
zn-Zf8WJ=7z#%@b<<k7e|zUl6q<yf@wBou016MCYOYoC7cQp6~a^K5o;LEJ{gV3;a|
zk!8_%FrX9!l*~z{u%4y2Wd@f?UIt#%$8fe{Od>o^NMG9xoz4fv#euZ3#|>9y2IFq_
zFN}lZ(K-nlV^;$9A0sX8O}BG+`uyz+S50%b$H!WKlP&>D;bWA+QG0Wo3embh>&d(C
z`tOs~?>5%T)s+?<9nFvSUvJALV{eVe#wfxow8zR6t5KY!k?CX_l4AvIYx@V%*w1qG
zhhoUNFdl^U)Ra}B_maY5u{v)-h_!?4Q{F2sKxMqlF|YDET(~xE3=r|?w>8#BBXKUq
z|Ct%jXZCIr%fekwi_z@S1Bq&B>b0%#8pmAXMRC#LyE4_Dvt~urWyOyV3rt<|``dgh
z7)!jdp|=!=i$kZtJvMBxw2OkS#S$N*@<-)ij02SI8Cbs?7~m@WyUHm^#Aa@>OyMoW
zx-5k96=4s~#O`NbJh3uAS<A65WNO4V!4{)wafx$_%ivt&cnf=R>%E!SJvf8#Jeyt>
zHh2nTKZycd-@<bu1^MT!m2C2NI4j@}xv-O*1%Xl0q8DzGy5l@^>!PI8b7+NwNG#JL
zic#2pzUyglms7SHmugtDT#(xsjE!Uu%L{w4F?5qT%iLGsG*M5GEa!9u?|T~F=X8d$
zJE)GD+n2|*6>+YiBk3RvMdkAF4zY;7W#*A0vZET7uS`Wl73M@FP>J~AczSIW;ZV6*
z7_~q%glzzs-FAZlYC?Sc_WomGdn7M7?O7)`-4$SrOAHU5(|EPTDKexsGyfbES6Ml|
zcbQ*YW=`OoC*a7W%En@y;SWwITk_ZqYBYEAR$Fwt@3A+(dPRF;=b|51q4ajFvZqLE
zFi2z1b7IUtWLAVT#N&%9A)nGfi96=DrXMyy3{<Dq+F>fj0+eWkZtpk-0i|3UWaCT=
zGpOA@X6lgrSQ4eQVluDtYPsqqIhk|Q2;#R?;$LT*(>Tr9j%n|OLtz!}XT4xmg7+lU
z8|6u?nX|gVxxKdP1NO-r%Yyu^{a8)=a0Ya}Q^r7soF}WZGE>uxmMUn;d9A-8M#j2g
zzMC4wD!ft75Z3EcOFe0ge2j4$YT|*O_}w)%3#7*M8s4HE=K-N{jf|t-G;vM#Tpuom
zWcPPM*+T0-R}IaL9c4)7TAG@c!3hy#A<R<dn0N8;hI?zr@7o5=i?QSUawn1-ao4e^
z7zfZ=)QfX8i|LEVg!VB{&DuygM4lQr;&DDu9;0L*n=`C#3LspWcnur{{wu7W>N{Ft
zgk$;I`$w-8P@_X`7C6?$;R3J3x@LmMBett@HdLk8=$3fEaI%!71H#A1JK<)j>&Wr$
z;mdY#jEfHp*33PBIJR&N_k;D9n4RMuN=pCkZ#=Qct(AuafxK50&B|4+>;WYWS>c}4
zF8(!Us&#{4@7VCE)*YXriL4-!Gj_*cP!kF4*c>|hYPrVamd|pn<h7CPD$Wfhjagzw
zQDDe9?DDWlRYT^3{+xBrPH3`Q!^HU-MknHo4$_lqDEups#_r&F?bw^i(;(KIY2z8u
zWyN#gl^fRy+a+<ube;V#Cesf24$g#vN_lL%q3Weh0O}}&YDBd}usm<!<>tYIWWg^T
zZ(#~IVML@c_}~t58eE+sm7j5aluEXrB{7b<gtnls?9G$2y3QDAD1L35jeu^D8k|?G
zN>Zh@{Jj%hiXZ!$yU#Rq!)l42&HCB<c4{*QqsvFTdC3K=9u3jpzlac78`X;9oQWcH
z=Qk45S{Kzi#iQp2p{?AG`;ZsmYPn4`#FgHL;jPtIQq8ch7UWuqesGx2Pf}~dIj}+W
zvK-tI<nocP!;2MM2_OBv1!luu5p)x#s!jArW$!JYE~>hUprkkuxv4l}jSDSPU6jO3
z+@ZJ>giiunn+Hs4r1iHDezC4xBvM+&{m0DMZJi-XnXxbfZ=+s(Rcd0FSZKS9hD#g1
z?<PmuAO+wuPLGH_tXDfIWTaCTw1H9*CnyryoT(0zOIk>(DfryW6;9CB#%v@9m3KK;
zyS0J<AWYeagDDh^%_~NO_GK(jXb8iyUwmDjNmEzZD#!y!brBQ-sgty(jkx1RYp+dQ
zQO61%{4(p>;X<at?Mc;1QGFi0_eZCM0+W^SldZz$SE7+dphvw+sX{d6Qv&ncIjv$N
zc|H?lnAxPv+*i`$+7<~%I&}oUXX-Rj<t7rV-ANB;=(Iw6j;Vi;f5>zU*7KfyO3}If
zIB4mvWbxiL`Mh`C<X-RRd-2=uuHV(xeieV>uf|3AEAIVuS)^ZiwYpp8+ctc|95Vg;
zF!^=!*WaaY=FFxJvQ?S8_=}<d(fVVq43)3{m`R;N762Sw&k{sV+o3|xi2>Y{uo0@S
zl}<j0D}Z0D4K=hQ=u*&y6XGUZ4uZVH0%DQgup8I#2E`7Db*gbz06)-|QNmX-Z8GV=
zoZMCHiwLd3&Kj5jt7xxANDXcQwy11FD>rHzP6ixnzG^6QydpgoBl~(};?X2JMmlwO
zb;vPm7&*=BG&Q+A%@&sg5XN^do0AArRUQT?kwb<utkSZ|=v5PO2Iwvq%@1p|*Q|k_
zr@g6xi1OGLtpcs3k<twh)_E=jk*iT6jHT6&1y76mjxQ1Yv>98#mCY3&ekH@izOpjT
zRrUO?dWV`eHOVgEbeV)Ko_cnc0jFtNT9>@hln@^ItrK!=YGWWu5=Mr!BEeO_?8~0$
zK=K;0G%+|Bx|6c=sdu)%U}4}K5j$ESxS@u{RmZTMl$1;*D%GT^Di@PaF>z?(%8Bvd
zL^XMkGC(Q66Q*c2RBx$nVt(#YslJI1^^&|_p3Dcb-R)|?l?bu{7>X^e7sE<%JW$YX
z_$Y|NSal=#d5*wuTEkDJBXy7YoiHNmT}K(&c@{Jm21;9T+x+Yl)~%TWA)m0VXe>|6
z=cgYsH{#hqY!Y)c41K$&g(q~HA&cxe&npg75&W!9I=La}4`Y8~dpotuUo&<Y&dDWc
zvmfB(pH5O2vj?l}F>*yP46_D<F+Y1+yvQR{rQH+F1nC&=soa7e8!;{!Zes7{e<+y=
zW*`z3UPBK=6Sw?tYO6=b1##eKaqOrk?%s<8I~qyfdbsHmxBxXF?~X|fmiZPT-#dgH
zyRmnMh^t@XpzQG0k~hvmflf5cME4=?NHQ)qXhjW0Si&<Jah-~h+ge62V1M4--v<eT
zF@#j=?s3T&&S2>x<DtT#z}N^N2~C>QY+Sb7=E!nHkV^J-?mOIjf4X!61|{SJU-!uk
zU@^R(6oir~)(xe>ms+SPEaaK<35JyCZA4+6W9?a-SGh1zKF^xRVu4?7I@M?6_dGT4
z4mYIJr{x&ACGmke^sgGG^(Wy~KbrtH)D}mw9F5o}&YB1+DiT}7CTDN@>YCc*rv58~
z15=qGsOsnGWU0rE9n0zULYr5`;zjG*SBN^bd#!DUmaj@rVo43uNK5Qu9HJJ@GFdPq
zuigEO(Qg#<mXFY&<rm8hd0^Nflj9qv_*Pk?MpRp+5|=cm<{8beIHRaOEwb)_(Xo{4
z?yTC_E9RrWMi{BZysL4%`a#Qv%_GCDPlgWCr{$2S-tW%C7x*Npe}Vr|xw-3q)O(i_
zBHTW`rQ{Mv$u!ZHM#-y0zAhy_RJMGOfC7|qhi`4MHn-(HQVITY<K0RprZ?Eri=XpO
zwIH<DI~-Lmw>pr=i&|ov^l8>R2CAx9bQ-@Pf_UCYec@U;6q0k~MIp~JOwMOf%m9~&
z{EcN2F3ASn*Jro`tCw#O+ZKPsNh%TIyF;%E;@TWCK(n+^!9=Qg5A$-Ef~r-Ks&&#m
zPL0B5gOB<qy$h6^sN{((WjJnREoS$0Z<8}9LRb*}EJFqO@iP|hF;cf`^p5r5Hk#Z~
z2{pDpV{>3&X1@m(64MyaIc1I?GvKD-{N%O7xI7!T!?LcMH%_H-E65qV8posalVhP(
zi=#D-2pnP5@_4suvs(}Ces|aJMSjyS#`Z{q{gryOp7(#XcE?{iG-K;m3eJFkH#Rop
zw?p~u@K-f_{Q5ifPn*?{0^x*a9mM)a*1nc03(tl$TlC$vFbEUX<)DF-EvYSY2It$5
z;t-aZ^w<dMXV#s@n@-={H@OxoeVc3-<P>V$q(H(9bBFAK%3+y~C6uj<^9+pMK@#af
zkOV=zN;DTTXkq%E<dIs1#ySUc1dOxml}^<{Zx_${yvXct(ABVmlN2F6&8@~pWiuJb
z3G-O(T%626a9~CXLc>>pu*_)$6*3Bv1H!}rx^acbU`1h~i%LssuERKQ|9GyGq^U(=
zu66ftZ2P*^&NqfjJc4WQK4ZgxsW?hQ>#59Pj7@9NSXQ~Yxnfg)nztl>(f)pSD?I1F
zWGt2O++0Ok_&DcW%j2A!?D?l9Dj4hgm_RrtQ*X~%ducWC#7?P@f?T=#EV=*04LrCH
zZGAF)LXO0{z$(^}H^4Up1H`YMb#}>F^`k;NP86C%*y+iiF%BfflqiIos%6tli5+pJ
zU6-YE=_wMFC6k#Cw?U@V6N>F-F3dFD-EtS8j-d5XCu)FIS7r+)R6v6Sj3bz{>U~Ke
zL;#y(GW=R9vca`dkWUZQ%8l>R;IXESBXjOB5iJO=2@(<F*<sZ_iAMdaP7WHqB)`0j
zg_Ds^2;*8e1wA_ZEn*Y=<Y;j15;;85r6@sq@TasCznZPqM<GTlYb!Qn@(**G8x`H*
z2ksBG$n~=r<*#2bfwIxk0d00%E7a=U<j<$ao!43pEf_7nW;)4-Smy{Dy11qn;RA?d
zuzT8m`Ez%z_U10|HkkQOPngpB*(W`)n1X@CUhn?-pnZ7nb>~p0ZjxajiEF>YcGEG;
z@uw~}|3o(9mK3og)i$}hECv<tVaeGn(a)NYdOq|J1t@TKJRV@UDxAb;DIArt{P293
zPsLF5DIbDnoDOMB*6hg#Jw6Sc-E5&pjGhu4f|^cA60vO!n;4?nfXVWlb_UbbbCmhY
zitwa{YiT<_Og{~T3U|*bE>YgmLh$>K=B(FRd=fx6=Y_a@wL1l2b9u9z;%uLheY|m4
zgpNiMcHz>~WR)ISRTO+g*QGqu&l+3W?_*QDlM6T?OisMtC$1+^b5Uk!tL`$5XPYyJ
zu+Krfc-lkg2n|z&UaaqUgwITUVt}wQt~Qd_2_q|<k~=oa_LKs^iR4#hTB*q0s2HuI
zEs|oll}D5|u*%R1B^sS&S}>2pUQ*db`H)2GtMr;;wbm@3C&+6IB9`Y;D$vNuQ^PDB
zIj@r0AP@z1(Q6S9XDQKY&N#z1znJG1laARxY?EBE$OV(;sw7&OXK1;^{cN6~`ijT`
zbRMl=n17+j^kj`#!<zVm&jSl0Pqx=)Wmzss6kgMZH3GF5;I!$Zrl6-6$8N*P*@&E<
zYcZ{@CI|WmrnGS!`7fdHb`-_0bt)S)fz2lgL)vU}Gu7M6OU%}@LF6WW)<ol@vqrXd
zLuOc8z2A({AjK3+W|@h0z=`2`?dKG5!g_5sDrOg#W@aR+oB_9O916_>Zyw@{9_~6Y
z)QTU80u$+RUbOLSLK+u^uq)~@AEQphge+tFLAEP$Km+bgFQz1lO?>x=3$M~hxKF<R
zr)FO15H<69*1P1Wtf@0&v|XL%%OMvEH4)&I(V3)6fj~Kv?JSi>)t-ikB|Y-=a3sn!
zr*fQ*KO6TRjn8gB+-(v5v-3=jg2-OmxFzBIB$_jMAuDu)`76vg!N7jwuojn{yyBUx
zwH!YF5wS+{*&Vrq&WqsaH_yA0fUiE#f<1Fd>PcKKF*o_5jZF#*?tT_IS{&)tPh<ZL
zfzSUF20rW1l<rJi`2zUdCB`5pAbLFwa_m#32Vb8QduqMk#D+1qYErM=!6=;uR{PM|
zvgd^QWS@EzH5-UVBoR@NGHw{yx30ec0|AI4V2CCN@2<YRiRj~adHzs?e%PahdcrcN
zhik0##&?kiI1Dv#qmE$`{<`^@WFssZ#b;wMilr7Z^d&g&cL9Nubu;~D^H;)g{Fc7l
z7iWjOL_T2nI?9l7(s(L!Sb=uOPdssO(@z?_6M@#1SN~L5<BV!}N}yMtkTaxf%3MRx
zN`L0VBpL&pPZ>0RT?=p7op!2`R9Jwe8o2}P;FzAO566kb;&?1*=h;g2so(*Jnw}{+
z`FEJ@R&yOC#(Xr(qJuXuDX<cF5X)kuvfbqL61xeX4I-C#!7L^EqVU|@2sacz)QoNR
zL(D?5i4>$A>V|PE%2SwN#5*Yi@8Z3TJ?@~J1n3RPSO7`TiR?L$y&lhb2<=40xyE06
zf$eTZI%j<J7#8q$?wsSZUc%Yx(qILh!o1Rk%2x;InN@#bv+6H(Zqr`^z@$0v#9`JC
zaeiM(R`;CWLG*_^sjFj2!@Xjom<XCddcd6A2qsu3foC!sX+ZC}ljDGaw-oKKk&8jJ
zIk&^UCysPhWdQe4ECxX2h;hham=%7=vN4LB#rPVJ+i}w11PK}?MQf226*C8$uDvjH
ze2V!HEu=IYN>R+un-n9UejlIbR>K!Vgcs`7vt%4FaW_t|mQWY$s~Tr4jk$|4ACY$s
z%PvQxfB9=sFrXEMRwC~%v;X@VuOPpfz9W9LVs!Ij*@XJFgnUBkY9!Qw-@>KaT=x%|
z?|GzEC%!zyC<&eeh;99`=RQ|g3lE2CK<*bwT0C>b*b}p!R)s6-Nld`P56!VA^Pu8J
z${pFJ@+qdOfHtT}#F|XR($}Y|C2>s*_@w~$km-^4EZ4Qhvo{P742KfREj;low(L|2
zeSNOXCAL!y8V-+Ky?YsVOk~<*J0{Tpi6y7rwh?YB&G@vj2GJR-KS>rmsBd0-mTdDj
zvuPvj9I8APkTN4$NjvN7%>}2L2v9LBwuNUm`lTZNyYSR_T~|yv8rw3*4=1I3qj2j$
z$>ZsS#VuloW6)~`<0`kPkC2h(YogL)0eHzBI&xZx>(+KZf$SI7vcr#I5Miw|y8^(*
zqAaZX%@MMLS4U-9T@(-;?s*WOSTvz38ATNM`q;#AOIltJda{&oSTFlpITW+&y4DO*
zd;ZPqqu<KiFX`&dCGJ;fxx=(4w(5ytJ-J9HXXyo+E(QZZi&Yz(dR+u3Oh0Qj$BGa;
zhUw_qNP;>uF&WbXC6fEsBQ&G;1d|;jFS9-fpd?M+4IkV|wkWE;^0QLmc0}qtJ=#Bd
zY-TBq%#$}BUu}FFaZ`H%ZK2N^KR3!@F;DS9=0keo@~EvA5n;p(ZmiZOu}_N!Rz9fg
zQ`it3*qW(!QFvKup0(+74EBhAVVk7PxdFig`KC0bSkV!uKo%Y<QN`R%S*Qx{64-;E
zUrXgy$1WUt8e5JX*RSU4+K$mAi!!H~myOV98xzN@&cESUhS9=He>s<peVA<qe*p5_
zq^Qh!$yW%w<+NdJ+5CkU!JBf|Qr=>VcC&u|$@?>-dZWK-4SbL{-}CxA%|3bT|Gtxt
zqrthye{VSTRNkA-$Kvd#j0p^ZxJLmH>X16gvdHY5tGlwFA=n2@*I6-}2JKyf;5M+X
zty9knHE~vVT$H&B5RU0$8iLT6z=D57Pz-Wy!q&$=k~=0j5?CNYRkYQGrRFS_*0|;v
zQ^D;vB?!DC=P<6LiH<B%@4UvV!({X+?HiOy3hID?qyuyr+j$^{N2M4|EWi+mH=8!N
zolR5Zirqy{I1(?D1QPhMGl@#cE|jMrKIr6`iRBWv>Kce}S`cXawt7TM5waYEGlAA4
z)pE>Efa$}Lf4%h`cz3T7_eTZ+AQ#zG4Y_Z9s|kW?PNO(9JKPEUGIQviP;Bsko<dXH
zQUnzUk78ULJaOSxf>C{ztgfx<4_o}he{ZhFj$Oa-%Q<6Y!^x>NPbEA^orDA}r^r?M
zS(60D;Ecvk5R&iY{oV$0!&WhxAG+CEVa~eJB+)_Uu#$LzR@|xw597`vp1Ozz0TV@Z
z-^T6K=(SeL>(Mm*#M`SSK2X|MerSsZKVS|ERk=#ZH^7mAF!ZxQ78VtC7}WY!om5YK
z3f-GYMa|Z_mY+OQs78*;s<P`!myjeX8QI^GrzHFDMAb4wx}fN9<2v9Qm7@N(YJRCF
zsk-rORp%xT6(xr_=62-SvK^_up)%r&Y<d9l3jY5E2)SHt*6_xbJJl`qQnP4NL9nOK
zZ7$vIfxFgFu!s~-t983+5<^18zy~EyWqTU!gLaupQCs{hMSqoPitVtt5Vr6+jReFX
z%q7_X9`fI~!0*HbXgI(G^8U`RPeH%>|5rW`F<Tlr=>+=Pn|AgWumKXWH=Ab5FT3nt
zVejE8{tjD@q@MX(@1Edzu^4>NdEGgEjG8dwlBFC(Yht1WceTd>P*()25(*AEhb?bz
zuFcm7S`vDeVnz*SPML_WENs%mLi+Jv901nRINR*gI2*A{V|-+ei>=aVG(c-3ybWez
zR^nh&f*i{}5l)VFsF81g3J)qi?4c%u(qPV57;qLgs<FT}{w%g<zu+XJ7xO{36cyJn
zVebD;&M~5!uYHX9GJ9~Vx6hnCpptWCFN_Kev0tf}qIuX(6u$qyp!vua@=ZsAJLeoh
zsFkFQG8PMkS)N~+rT#KjrO(#QYFxSxCd(xNrb_5xd5JlD8$4(ja~PUZ?T-%%6A&M)
zV3ct#5(pLu0!*h8j-u7<(6ETiPq4r^vDfTzeYZ=-!DyT@+*bPgJ$ldi9lE)Q4J)kM
zm-e?ucn{2}#rpm0uPBP3eFli@pwm7)?RNINyGJjoSyZS?A{*~1`j<2T)J}iGL%1)f
z$2jAX@PIZqO6qWJ;*C>|7zPpg9@~cuJGml^#dU=xrSSF-2!hSoXp?Le4=T5@d_-`k
z(3w&1+N<m2#VH$stU~Dbf;w_ju|?xk4YKEO9N`6wikN>aV3BuOOxV3$5v6Ldp_pKC
z0?a9_<odUmC-S$@zlkYN2hcc+$X~>~>!J@a!wTce5tm4Y!#!#lD#4k~r&Wif<qwPJ
ztmEXnsaV0HgYFT=#U<Yh#(Y!sDbw++%qmS%sWGA?n4bIt24-i@86QNk!mk*3=*O^{
z<?)Db8Oy1cnS>8a5SR%!Pt~P7Cnn*rkhMqcA&_Dg_Omubz+>S;7P%T~9gCuy1|bpE
zHm6#magm)lrQp=uT1tJLi)?CLCt^Y;Th}D}zga%XD5AcYAS!4<r5x3EF7G3^N|O>5
z46>r6=KzVUI(1?(tYT6O*eq$v&~30#44j4`gg6z*6oe$`K%4x7>D}V%$!wwv2FLXV
zvl6&Mv&H$OS9z(W4xk$xd?uMenxkr8AQ|PxE`22B2h616O}UwNMjGa8nI<;mrKYU}
z6O;_EwV5Z8%M$f&Z)$C9Y&7}K3i?0)%rOmqGwAHy_nNuW*>Byk3EH%$*O<Jx0doz*
zBJ4%{1d(JEki13#7f-zVB!5A@fE<${SS#*rVOJ@P!|yF&5OLo09c}N9X^$qvYZFm(
zffrmMrC%2_QY84yM&MKvAcFUq=RVW7&(T#t=b-IR^GQ%w%3rQvh1belodUjhX^kk>
zD<m`$Zxhg5+)Lom9qDqDbW{!u)`F#6YWyCC5#17YYHL=EoYGkrZs{!6oPsh26rO1L
zTLAc1=Ic9j4<{hg-8IL%cPkevbC{feb<4TxmKz%N7xV@0pq}8JbNV5-aW8C{peNCr
zwqiF~D3}ukfgo1cQ&`gwRNck)myL}t2~%1~QgH~tTL{X=pl?(d38Y5(10ftLNemj9
zF0Wa6`fR0=JMOPv^%$0oT%7wW9RuWq_qC5+=<A?6l@7QWI{IYv0A23M`0@&!&{V;{
zI#KlXH%*h0)}l$0`@U?7{^N_MDEj0r`(Iu^QM4ta0Dp7pI52=7>(Zmb!1P+2O2Qc)
z6<1E}4s1Y>p-dxt;e*gp=>Y#xmou!=4gY;Yn`qybo^>*H&FS0XgI>^zZShr>dZb$3
zRsfix{U^)`^b$`comL^X&~`v6fVW)!C`k%FKb>Hub4PwKd24>;_8JvtNC&~w8vZVU
zeAcDxAJO$k2PgU2nm=py@D{q@b9)Q^Bt43=8;dbRqpB>lL%$()QerDZ;6zvyek^83
zg$@{rNx_|MDJd(5RpAuvWQZx<lvuXGMkyopW5@<7dn`n`_QAE}<(zmP-DOJEOp(MT
z9Wt$A+v;<-l`hegWs(E!UUiErn~#NH_8;b&c?%x)@F4l#2qvVGK*&+<Rf?Y1W_+0x
zGW(JibuNbN7;n3-pnBpl5^3Kr%2MGJ8X(C(+WPCsq7v+}rf8Y?x0b!MOiA`HYAs%(
z-88jC(vREhZ|X{2PEforyfdFUZ>cQ#PwI@T%f(?hrbvaCiV@$l<Un7uT%deRg&O|D
zspZwr5OK%A<Jq>v+hFuU?SSDa@$hKbk#!b}uTa_E>ErSx?#+inVN7iv2NJ7>j;aOk
zZ%R2!n=XE9p?GIvetX4ur?J}7@pUsnb>x-J%r~7mOnk1l!J841@m<h4^|A4ZI4Ua6
zx-hXVlM)u}V$Mqkj!rQZBo8fYNuPAjXa})Q)8Q@(2B?yatmkfZlV#OyG^#IXUrSdk
zi8xj0!!@C!aS?SYk26^lm_mo=YkWW5^c8;SGiGQpQhNY_)H0?Vqu?1^msuxQKH+no
ze4s|2yySZJoKq;$CCQW3WI__)zMPX?6lBILCRgdC?{F_8YdLs{{^|#SjtF_-pjw37
zzGc!pqpT35-9!*+7w^!ec$LmXOpuEJ)-K1|c(!nF@N`WyQ9lCqF*Sw3{IOO`Ocmz=
zU?eskf=0%g!sK|X*;Gbfh51`<JL=Tg2f6U1ocCONpkF=EW1X<em&A%s__w%PVf3~d
zq~Xt%U%n1U`CLi2QVEw6o#rwYO^U4(o@x_kznZWovVGkcI{S|kMgh{=Q<yzw5nj)-
z=~b3htGDTAP0Mc38KihhmFZxp8BcQvCW0+4cfay9RNg^3tH0+<ssP}jIu<~H2i8b<
zq7_BSIE~>K;lhzk0<nfDltyG>5q`tPsz<#3!er1j2fn>l09}sBdQC0Qq`pXotyiaQ
zFLs`7MwS6x=^`{?5g|6l`-R8^(9l$;3l~8Y%N9vu>Ou|IW8UFS(Rqx;j^q*;(?ji_
zLVJ=sccRR6nPkw)gVi3@^h#}?kv_p;5^V)P#_HiHmkO#-a5>1TAmo1d-LMvh0n@+n
z^JH1-ukCJ??8nndbUV;0#d{%R-l8%8iK36l0IB&V(XoDBZfD(SWuE@SsAV1vKmA58
z(J}ufdWkVNi^YfBspSIm^z*WZLTT=c!j&^d^$0kVjBUeLB^EWI^6$+#qlmlHqN}}q
zw&dCNhuZb>Kh81r*!g2^ySh$w*yXl&e=pmNb^@27%PPgQ<N?tR6-l^@Fk6HIk~7Hv
zT`Fxw*>@qd%=}M{*+ABPg#?0?n=}}=Q{u<E8l-N61VQ77F5u*~g&@cnQWi#4i|J8T
zw$fsxr8R=+WYiW^Sr**fE<g;bfHf9-&zI{g_M2<4XtV1ks33>IHIr-O9l1yLlE9+j
zWIwa>%qT&m_}k!!!gu}<PYNwy5)Q;6-RS+YA(9koou}l<Vcepa$4fwIDL@KFz@4Cg
zAr~Xq*U4qin*7bP>v+=}6*yU~6jDY9Ea~l~5duAP4>rd6-X*@#l%H-TenDf<8>acd
z3!7qZUXMz!re!%BN^_%v$Z=ZCsQRB1u!U&BL_!-ip(Z9yCgw5>B6QYhpj0&>yg~z~
zE5@-%H*3~8|3r5UY*3{dV%&pvX??@=Ms<Tm^b~EGe&A&;fbADfsylqE9JX>-U1UhS
zZ&JN!sSYj6=Xqb7`H#I%XPqAAU?=;&W#6U#aRUzK*@;8w?8g)oX!kJhTM4_9U6t&<
z=}=@nT|*QNLyJwJ@k=S=;}i@QD=I@u^F9$)PY`PO9G3!hlD;>R*TATYkLop&pKp<s
zRpJlrnbFx-?j%Dr9%Mph=cq>t>CL1D;4NdWWhUaV4ZK7dI=r`OsL?*Qc$4Ebvh8_u
zF<PApPc%T{k3;S9$|C%9MnI-wfizs>N}>}mWq64B=z{jP&H|a^3U{mKn0z5gwo$}L
zY>DFFbgVV(g$bsOEiMR3kjd5^9s{>!f|Tec;VJ3tlTBOy$w;bH#M2Zduv5iAlsZ8e
zx14g+Z)&OtxrO2{$T_1Rmnbjfquzupxms}6_!OqLf_H#VUGYvKUUxPTPp2t|^pnOs
z=$jwAIq>srf-V%&l2}Xi06lJ-rgo6d@ZKeAO*9(XeD}hknu-#&X5bJ&Fa~o3t6Gao
zOu^)M{aLbAO=@r>NZ3Cp5i7wOwCZq#T^~#(C?tmX>Y%-vz$iwraY7{gkPH|8HI}^4
z;l7@s(}X-HB&`YyHE2;tbkRkKm5hxdF~KyhyCp2+fJ<)VLsj&yS*j&pPZc!Xp??u}
zkQ1vDsgms=3oX4se!&|XqUm(6YI&7~@uJi8brx?-n>tq3>vCx-z5I#W2bMmhqDIMV
z%yrOg%gQ#z+L(=;qB{{~I1;;KO)GcYU|alPIM*}7k?VqAB?!d7t>$HFTe{;!)4Bt3
z1Efm@Pm0Dw=Pf&{(sOFHrK7eJycoku^8K_H1^p!MjgXa#bPosIMFC4q!bF<%fU44b
z#Q7vn93d6pjO0yl&H`m1^#&lC!@{a;L)8;Nj>;TF$u;vJLbYhVK+q<-`?A3~#nR2j
z>^kHc4=_8u54UV>Z!rNy1I}^cE9bM4kO8)mC^QuZ_wDg&%UNiUWFQi@9FO*v&N<#o
zqJ#w~Og5d^$VN`N%zd14GC+L-p3n?JAGsIM??_Pu4tF&A#wdc}9}K(9>#6S!l3y$D
zw<v$}iN6(x*G{#BN=Ak5%~(DKw2D~){YoZ<x1nMpm3h?Jy>@_G3wGL_az0L(D)e-Y
zGVwPspcVwkvvLX=XVZ=z*x+ip8qyaA%>Y$Es=tsWvIZDy4U3HQo45Y@Wh+5Jqx2s=
z#pX=??Yg<AKDcx5Rb#Mc2|I<}q@%poSlI)Wem0&O;ugSJ*o5B=2D4UjHp7@ws_l~Z
zS6YdU12?E_P5X}cK+O{Ia<tJmWbmZ~!;bNyirI7wF9fyj9Fb|S30@-AGPexEpCC@q
znm!1;Vbn)s=+j}jv;MTq{%=Pf0_DC`;kL{%h!#7Bzl<lvv;giYHF%EOZw~B&Ywn^!
z{I5V+`FpV>%L_cfe&Buy4C;J1#X7{<a6G+kG+Qg*y<PwA?MjP1!7Xvts)#7>dp;X{
zIO&&-UQ1fz`C=l>ru%4KnPl~SqZ`-yli#P8VGnF?6MUuDWjr_F92uk&RmajZ6iuy)
zh(twUa$HZ23fC2s!;Oo^_}#NIJD<@KaTT}m08~9TT5+8oI%lLHoey+1fwo{y=n|)f
zBXoh8wAlOz<8Ys896kR}Op@*#zHH5(v09sNFqLL{c1xoFayB513r3%P!tuer`19Vu
zZs#@H6aEZp&;HBfqqlD~!?|UuC`)}GQtqkCeccc0BuAk$sQpB_rNyX(nL>zGiAR;p
zM%WYM^nztV4BjFA$Y^{dc_6+W_fGm#hHUbUHp2J0<jHG7xp9I8{W4j*m=v?IUZX#-
z(6#=6;r)E?;qKlaleG~@0ZtZ}6Hj}QjW{L^W>UJy<_!$`=X_W!SC;o-<%%g~;-=*#
z&{A0OSRQ@~{oF~OQjc~J+KMM_2hMbaxJgbsuiL<IpmjLh;cCBJpN;ZQ>uA~D(YEAs
z+&(@2dGF}$;i+O|B`=PS_u9#SzCAewB0Siof3V$9k+udGxfd3Ow}n?tGo=-v`=tMj
z_FZT@@XP?~iR(-dO$?|oUyc!dZ~}{6`8=EUE(77rmMi3CAqa@A2NLT+e^JtyU@v^?
z4N@(o#JA!_m{8}ZZT!isw{zh>USNtoAzm$85tn{_N7rF}hsZ=K#>TE`VgNPz!0BDi
zidzX?cJ6qHcc|1uzdUlD!BurGeIM^5vKU25kv@SKl4A@dc|6=6{ou3?oM&?F1e4GW
zKi>QuT8Y)pySplcc;H^#axNk(_C~+8?Oa8v$-nBXQiQ$Up@lV-RGXez3xVc=)m#vl
zXfz%0d5Re9XABdlg);|N>2;~bR}{pRq^E)*NCo^pWxW}l3~1E@rQfrY<^q1tP=o_x
zzvXt6Y?vBZJ7p^wd5aMvfSAndw+E-4d+k5B_mZngIv!J;Waeb*E1WVXilM%XDjKy1
zQ&p7Zy8Z?-(GXevwHj@$9l|i-hNR>3X4(_>--G2oBhVFGht}4E)|=y_H@h!)Puqx$
z@vHp{MH-=ne%1p~`+N_{qamBD_R{zDmwv3jv_&oQ(Pp?ZO}vC_Q@XJnGKHQpYz9Fp
z!NTo$3<j%VD%f!v6kQ^_v~w~Vlgi-{o)HWe@tBz$7Eu?YlQBKJ$6RJAFA;56X;HYS
zaAt+{EDI_f2EwamSO1y&aMC6Q?wlFOf_8|d->N$yU*dhf1b2fY(uggVBR{NV$n;dm
zkQFH>^Y`|4m091fW7ZG8v4OuA8=!90uz`nP#swbSV9)Z7Q8ZSm`oR-sHz>=Y<lkAm
zMK{<sEL)VL=gFLeRb-7^f6FYfyiHIuL>s_aKD(BUE1Pi-UVPf#J32gh`?`IczzpJI
zl(Q`P_wTnJV5F6|cZ1s_n^@mXf7Wj2J-KU7=BQ?0S0vrCZ&=&pt8Q$bKyCVK?QmBo
zg0A;x<A&G!Z@c`TcbA`J62;+&_C~?8X3q&b#tPRgv)Wr_i!WU?yOJ+TQSDv^awzRc
ziK}PBI;|O&=TgiWu4GHnDwa9pun(?gOofFwFpG*e%S~P}Wdb92DkHB#<E!dSQExqE
zIU_(<mI{|qhNiXZOq)z+Yso5gcQv8<w^KpP@$_fH-eH&?2FQ^<yWJBJqd)7hMy}cV
zqO4U@_G2}kU1;~Jb4GI9^hxLwQ?skx8vt3&Mt4Jg*pE=UIN_)mKBgklFvzLYS95%i
zqGV(U8>ke+Z`G72jx-SLm{M#ISa?dSOqoK(CU;&6a#GRh4Gnk0U6PekdQ<5|yQZbs
z9dYi8VaC>VGvt;=Wx&Ubl}MA_=!^<A^$D9^et#p`)$({TBMLQgW(_UpCN)lzbY*h%
z?S-4vOL)HY(%f=-ciGRf%k*Q8$VVxa<r)@!-iTuyF?7N}KadYwag)R=e*DvMm(JD4
z$v#I6h(+v8`#?!XVm%~@R4R9^++Sg{oQD%+KEjhtn8rr%&g0#m+J|rsv`@^7Ddaz$
zOmG;mar-I1+t~UvcmaQnzmz_HrTh8~fZ04^E8LjVoFdUP#+)P`S_)B&db+Gel{wA9
zO42wnonOP^CQ=&>7Wy*3K%yJ~eGHO8agq1D9iF?O{J?U?`Kr27%yGb_d(I2xX-&cL
zoK9vvm=#*D^W1_i;=O3@#^**-)wl@soa*5Tx4<bvHbg`SL1PeAWROr9EE^OamlP|M
zq96CM8_1-#w_DbHrshG%KwH^Wgt-J=xX17IG&YB~@f`W^8dQGHnXM}>Sw0>kt_K2&
zic`*X8`~lfM5aa?4pk!VUYeXk7iV&uQ=Ar2gW?RMoI(){*guXJg7=BEf)gU0#EG=i
zPNbG9m(-c7hEn;p<q2L5v0>;e9T~qY&I+1ru~CA5V=2i*FQs%I(d0x=1Ex64-6b}I
zPZKl?kscZJe}ZO?@pMNePNi93A`Pz+CjsDj1#E@uns@0U>rJ@W8_6pPfYS;07&Iky
z&+Agq2ikzh8V9yWed8Qiju0@mgZ%FdgW#G0%lGPi%rr1XnRb-L-IDaO4HEzVoysU?
z6%L#<ww^xSY#LU9er1m(2T@ee!;PBu?5nBKt)|}|O@KPFsO!XbYuyl$kISJ$?p)Wa
zSDlm7qvM~cOWQimdk6rCTM1=YO9tqtADAHu@?CUoEAF+WK;fiCk`N6<T*Pi7KWMks
zthiue(OQl!*Fna+2HRQnF!rj^^bWF-1k~CDUg?HjU+9dlaqF7FIi7dROS)o0v906f
zQGp>vlFnnJjSV?kO-w<Hc%tz%DL+V7yq;PJ5p~^SFm+tVT+Lyri64=~*{S2kbFeez
z#5O?UWiiMG*K5op@~H_*EUrdO6{nn3i|Dx}N4gu@arrCqv4ZK#)xEUKC>MyTRXS2C
z#n;laxLvL@B$N@zV?(WMye5?-`F;=IkNGEJrA1~|wtyGa;8ly7&r5r)k`VzBjjzST
zdy`$OADt>ctSg$V;j<Gbhb^FKbwjI{_aGZJdUFDpIB>xZhC`O{?m2*)80AqP9^!|k
z@j58!BLo@=H<frfvtGK@O^I22Q(%Oo<jf$6$iKyL1UdbBX*xqCj}2hI*`q?G&>=nx
zuBy4QM#XkP(~OFh_l=@Ks&YT;hYhH5;)p)hCCkB6(X2A!6wN3<@qp0Xg^(DH=~dzC
zw<z12%oKJFo*GRj_kgrH1D`bx_K_0j8A&UewX!amCTSj24OM#F#oLJ(TiZ@>P&G;e
zDa(z)j5Oe6v<1<cZG};u->Enhtn--*1?w)0oC8rTSm#rR1&bSLF$S#jaidK3o>O=Y
zOb9k1k1lmTzb*C-pL#myRnfQQDh(R8;p^Ql{h<8ThzXNTw#wwCykHI3{8~l5HVwIL
zTB(~|LIOWd2=2B3-#NijW7N0U@Iut0HJgEZC7BZGD6~enRkhRpFelkQJ@ezTaVBga
zdZ2GrEicAH<+kBDp+xiANKOh#M5V%XqG@PRh!8vpQ&1?xLZx8IoNyKlmayny@|t5q
z8D&>)8)o)vIrMGeMDzB{m%&QhiQ`I4$d`b%5K?kB;vmspY(rz%JY(#}ioqVTUdNC`
zR$S1er;`+<+~UJ*OtCbpaDzrX1E+<B9ui)A1yp3wvOrfQ6-nW*YB3CLSWIFntkcHA
z3ynZXFe?Hg9IZ$<r(kl7u&l@+lk^izo<y6=0XfbFEzW1B)xp%O7QWjJFn3>~?_c^o
zHiTo*tHOnrlGFs?PSvUMFnLxd_iR=&7+CahRgW>;OV&oG5li!SlZS1<g0bn8aA(f_
zO|594SmY~3EBSdW>DKHQXV#v@OW^Q=V;%=BH$_KP^KOMYV4`0D$<0~I82*Th9zqS>
zrj~$@zCiskR+Ygdk%VD6u{DiQj;yF72wF1+Y#Ac?VKz<C02fVJ_TP*CE6)d3z154-
z!E&%AereRqWf*Z2FFuAbeti!(WmF-bKu3<u<c;@*`@DnUS0$(|WXF*WT1RSb#4s(v
zWjZ)t7mGNYHY^a!c{(m&^8f>^)Lg2fG8q3UZV8rT<7J7gM()j##0jR8i@Bi)6);yC
zR6Jy{1@Btl0jY=_v}{J8pRCuGUf8PHaGnp2?p!8=U9~Ycb)G8Y5RK7d2~wHf>A}1?
z8X)u)@2^PvPW*RGB+BBEE9;#bgU>}$ta90OgNGey+`Y&A;m7goucqL&nC?={co~e*
zqo$TbGG@eWhgWJ}6q7lbgX^uN;<FIDs<=bhfx=1d6A6|ya@3k5rl~bT0vu2(75^BS
z*~oNfEEXnF-f2oWg=64wnP7`UG&NEQon&faAx^TuzHAau2>2uwcc$@3sL)C#W|Dc=
z%x-p)mR;aeF%$8GZY0msQZjPA7t_E>Nf?q;YCi^=;;t$Y&+*#V@SVKGTx<_b<+kG_
zv6ANjxY{@qQ69Ak@zzjZC}E9U5S*iA03j6GQCFy9cV_Pq2zzpigipH$W;J&6-!f{#
zqX;7(JRnT6GP{fGkbsIW7%ZAY<Ce}^sFe07h+>k8KrzSMTCqrd1?y{_jn&DzGKSEJ
z7(#uapWcFnC2Ayp|8D5QoO{C(7}B&?iNjRR2yW(<rBudz18>wYJkN+`i(E|dmUpB(
zH&FcotX;74Y^7zpt|R5Yo1US~z_L$rO89Bq=A+`*Uv00S3O;aHLPM%T2w0V5kdige
zWRQx<EI_6-^ne8I+RK8RNd;Et+nWB_7Iz1<O1<6uyVcrsQlu6eOrxexDM(2oj%nhr
zp+Mr92+&m~jFJMBdLKr`74WW$tnZ6;u#-Yvfb9vXF(OEf(Gk}Rg>6D=pYkoPEr)V*
zMKKXKB-Q_f?`&tlz?RaFp(Eoxms-gAoS8=8r})sI18&M5N^%;y8fR7q=Dxrr=icI)
z<tl6M-gpSCl-e`<1V2%*r-;rQ#nr!wR3DS*y^@}_0@`Q0sZsiwm}K9tCF`tzoe#xr
zFlRSzc}j-E13%TX`76DQ;8?L<U{QQ<L(Q<x2=IZ`Ft{UDDoql>s#rxPSBz>_!8|kK
zIGLl+kcdfHCbrFU7qFVZmrk$8*#Vhtewu(dbHovwSxvkqJKDPZYCkr!Ks*3y=#SYo
zwbh`IJv68~#|+sc@TEWnMN7gbfjij>7}lGJ_ZP8x9Bjo8x)Iw--Y#;8%ZD7cR9(1f
zCNMh^<>_YOo`E83N7gF5w0CK~P@<*6u^g?!nVN0_8BhTid_B81vJtG^an{dmj1n%p
zP33H<hz{Em3w2GkR+j@DAaOAmLZ*?4Hky%>rt%SI{qA+!$Hy$k3(5`Qp^T(FE?pQG
zlc~vyvtpg=w83JxZY%5s!PIFE;X-5YNb9yp2IEi*158r`x#A{}u_e;23SgoRM;bPP
zY+i>r%sD!Yo{;#M3PhN}EnAh_yD+Ivl|eT+2~~-e^%a_tmAflihZaS26r*9`2G{cD
z5tV_&8;4R75*{|$8WMvEGYOAoBS!MUNFJ&u><05}wY)cq|BD)uSi6*TJzYMI7Sza~
zUKkfd;iHmOTvDKDD4Bcd_AfDTDen=<I#rG>A3z~(s=Ga`J7lU<I5W%qg2$=5)EKq5
zwtsl<<j-^NS^)weYREf@W71jQYGOs#LdVTdp^!GdCTll8)$-f02qYp~K_^Ha#FtBH
z`}I{63!NYCu9D11{j;_1&F1%eK|jMLe+3IRVB1`UU_kniSS81$?)RYjK9|!mShiOP
zPr<FdABFSaRuqP0?OomgmwaEW<ehzS>}s_KW`>vz1{vvQO4v8pFQ#m@?_Ex4Rbg(N
za|13n^(O3epa_}ddk}0|2y6MoTl&$(Hl7CL8X1-%^+t$F-X!jGeGGoNyVbgbDa&)8
zyiJ|t8FIFP+@Lc%EbR|`ueryY!due*V|#WstCfU1!VByPW0`$g>d$jwI9D_rQtciq
z&7eDQN|@XjOaMSbld&(w`9{+O4GxR`47SJan@+%R<cY={z7nLP&wC+rJa`_t(I)(_
zdGjuljmt1*V+LZLihLH@We64<KD$mE{w|xXdcABsMXx5F0P*2Q80!sK>J26Y<tu2$
z<;TCvoNQI+#7UP@Y2L^b=T;&C=7^{4U33(!YyQ4g)Q-*G3H9P1JBM3l4qu7M6?zX6
zgxLM;K2#g2+D!j%mXU@Gat3T!30{@x%<L0|xY+51=a`_Qv_mn_YB!WD7HwEei;l$5
z8x#b&W2zi)Bu6T{aX?D!^;GlwJW=^dn<uj+Miw{dylbo=UgCNFsVSuuYuBnN!mOgd
z2Jy|+ogy#1$!cR0YciPmYi}{?SX}VJ7um2S;)H^p<%BiI%+{Q|)_Nv0cw3bf?FNEU
zV|zR7V;bv0+;9)K;Ay;3pZ6l`Xw=g<B)}MsD0q>F`)2#wn74~s(}2k7m?O6D;SV{E
zoS=s9f;Z0FP?dM#gh(^Zs&GL^QRS>Oz%XJ$yF&eQmuk|V$Z<Gv>4z4x|H*O!dSH)k
zkc6{c*$dERxU;4C!OXY1+5gSbLFs0U+E90piVoU`_g;4nfiC}MP%dC6dRLw$PubiL
z6S0mfSDdeN|91$8$Hv5IN%-8gm-REQ8Jd^Vyq8d#6eWR{$vw;?2%$)1PEMgMJF=*;
z8|MaJ*@fR=I2YH|>C$9OyI|e}xT2@Wo!6+^@1C|_{@mq(yR_`OC~F}dLLj9GSe<Nt
z3c2f6Ew3-LX}f<xhVK@hRCn}7H+F7;w={S}#M&ij#`-$LL_|Y4f8O2SC;QF22G3FQ
z?r*<7dvA#5*Mx~he$D$k&E(xd=XK{ac`8w0JMZ5o?+%Y%|B($Ta2F=&19#g=-Z6qT
zslD%mzpw<llE^0zD`g0lC>&@Rmfty3*{U);!@K>y5LHRXVAk)#0858y_QyqO0&=J+
zc;;xLPg&NG+;JL!<#HJUHR6?qU<N=?mJ6D8+(ocO-1ufKXV&E|(p&CsX`N%SmPqI|
zB5^yO!E-Gl?AE>1@=JuMih(yN(8#r?{Gsg#n(2YyXkLv)FSbz?HCNZ2Yu_c?%?c`N
zMG?4~p!Q?a!;Jfu1Qet*H~c^*FVNGZO!Dr@?i=hYSvE*WOB$Q&p!T3yo=sK^{=i5(
z;t{=;gm^WwuSt-ZgSJG@10fqsPwFGMUvi%20|Z)2KavQgrc2xvZXDzqC7EI7kvE?X
z$!z5PE_cr<YT{qtKoyM3o`hFO7c<_FIWsMk;UFW9cpneZpmmn{Ii4_aizl8fuz`sf
zCLn+sDqNQyFl)O%&`z2xu;{j!wlFWg<&J$+bcY}K*=Ez4Tiu?Pj-XUSEKc7q$$Mj~
z#&Lm9^_!!xW|yxtk>;{A*0i8-eR5gW$6lYi9Zvo3WS=h6SvjrgP-~8YyfPc5;_k=5
zNpiGPs`%nnWg2&YR0hSB<U$%Ne&7LcVjHVTFvdq{HxC?ZvZ{9t$7n^E$h~drC&Wa6
zB)V<>;BjF1J$alMHzCVt!R8?8but-|nZCV$^xB8$U4HLi_6y2XR7z&Z*yOZ-=2s9|
zp`cahZKldYf)K5^K<@gW*f76iZ8xcYT7Z~^jT*pJSoMDWg1aroBk<W1`C4+B|Cn9#
zcI=-yn^Kw|71R9u8g41aX)kMkM0w)y=(O|VXK|IZR`9%DaksMpM=)MDLQv@Elj${j
z=#(PyV2tFBgnZPO=5B}5+~Lt-J9Nhg?|}zV(sIeD89Hc|86fsx?g;I~#|Ds+=-<Uw
zVwHNeZs}}dg=;+92<{h%vT=5uu#i=dllgB=a(@E@@re=31FVx6D9QS;xl<9Jt*n5+
z3+V@mtLN}$W7_vy8xamY$XFoMXQQ4ZM}jmDoFnC0e-m3%n8f``S?vzG)w5ACySU_d
z`izR&pcDi%0~1P9<HqAFa7Wk@LeKCl<a+F*F-Y?Q{$`+SqQTg8N?5Cw(C{Z<^geWX
zr9oeVX_fWuEq+slmYfqg!+8`TU&92<k{S#j5(=q|H%zdmeiJ5w3N4t^?V)wrbfw^Q
zzd_vQLgfRG0XNt(8ilE2bt|!R#00XvLD9pahQ>4L1?Qt+M>+omNA>Aw)k$ZN(y=+%
z>bvDJO5ox+O`MILI6h#b6&>#$zHHz7^Ktu6^i3<J`;L0!5?8DeJWCn>M8Ptc0#Nln
zF9vY>5?loIt7F`e=3$f)sK72FZXhJLc+xgoPP_28l|KY#!SVU5D8fo+WM|_QWI39Y
zud?NN5v83|&z{C1Ed&Hh);2N+k@b$viIi>1^P~q~V{3ggX>6}=a(l#MhA9GArladA
zh0#%L<ktEYb!%(gAB!r3)V|n5D_WsRE)Kl^QOVTtO2ZtZ*ntU5BF<QsjRuadOXRr5
zC%`kjBd|)<9}Lmle-C1b{;~bueI^_AV^3_mPuy3xBiS3_9T^rn*rdMkSI4$zlwTjc
zN3HvM_RP0iwsa^0Y>%N_^5zz3Rkxp!6|17zI<0drO;RV2?}YM4xi#CwJc&3ro+2Cx
z+Ds(8Nlm-+<(nmj$+J(e{WwIL&z38%FB~Z^ff?t1#^a<0Z#GI^r5lXVUv7McL2CJs
z!`{Iz@)lhc`JLo}+a)apnEb+p_kO`}L%tRMxO=x!za3$iEcVbdy?OnY^&pc%mH=fJ
zj89a8{^dRUzgMWkD@~)|I<4*m<^#7$ke$`yhQ|#bJa$#hYwiNKzQZxDq!dI2bF)V7
z?1pdT4Ug6wv-dZvcfwqeB}O7?-QhroDq=@%MMRHA#9H1n2Hk5oO+JAN6HDHS48hG-
z;Qt2tupe*Zp@(72qHhcGf~N3<tWG;jx^$JyA`}*9)%4`oUv2jm##X5^5^D2yO~Q<q
z`nbf(bbF0p%tmBs>qA@(V`S#RWQG_PHqdp`FWusb3LFAQj14#bJHeM8?Ys|;wOT7@
z{M2(irdAlicV#1Gr15uUAHV2z*11TwVAI|p8`U=D9l$rIsvcr#S%NZ4_3N+8(34$M
zIIsh6n$nIj=fgrf27NQFyZgzz=Lbi7fAk^5VLsn^IN|Rlkoknt#JA|b+hoVaZ-*A8
zs<RJQ;Xiy4z8pr=Cb;gGij<{IxmXWS=1oSyApan@5Ul5HDjt8e@4Vv&IjIm6giM|a
z{q^2uVWK>lZdojI69i3_?|6dPkBqg=Ot1z90=mWc$Z0e(*j4UGIAhzxv7yUdn)dd7
zcfb8&_wB)Hm*;zHb92)Wa$4^huo4^w>!DsqG8{5P5HU%Br5H3`T%$aZDrxv&RSev8
z<ufF$vODJz%X<+Zn9V1aYm@0?mRURsIn`0=H_SR(g=w1iKvOK=G3fy<ot*BTcJ{h|
zYVVyM9d}`udU+P?iDq|)KI>jbC?3Y*DLvpE>^My}Ct?}zv+mc;_YxV0egLk1&4l3<
zM)-rTP?|h7?^RL_!htC@mwg$?FCu}LjA)ZnnkQ8_Hlj`Li#B*08cR|8c7&ST6>8WE
zUzp1u-{tQe2BHk@wj=Zutra4t6$;eT7gS^_7S9y>W$&QVK0NInyxon-K=;-vKcU_}
zKvTyBtNGHve*5re-ZP!Umt0O+uul+u3X`iy!6Mb!)Dfgz6MF;D-@z=s$LOlZue*B)
z#;Kt*8X!Y)9JFn4^5K3ICO%}@m@8)&6XFPCptZAnfWD^Kn@$~c)-oHFB#|JC;hm|Q
zAx9+<-w{o~^~9(b6u*o<yOr-s!;=hhEvVXx$LGC*rl;&p^6|99;yFwJ&5+7(DvHsP
zhgFtEv^{0kG*7b4L9P`JR?Vh)d)PVczU~|xbWRW#8Ee(n%D7I<Wk9nkn$M%zngJ{$
zo9Dh{URAW_&EsN;ynbAABF`V0&#Lpgfm#zXdE>rto(u65P|We4BQNRgnuP6&n)r5f
zmJZSp!qPGy)%q~f=;H-`2mGuU=pT`QP%wlOnceTJ|FLQuf=jezPoXeN96yW6-=B<o
z&ywvYV%j68D*_k!9$}~BmF*s6x79B{ojU&FqpG<b<Hxt{`L@&&p*@Vn7gfO}b(E^%
zQGWi}^)gdy&&Q4A=VGQ2Xd+l~$=ENPb@zlddlB?x|C!*dwKr}DH|EJ*T(~7Bo}`$S
zifiRd=h+jA{t4$<WxB1(-1r0hB2~Y_#RJ7&wGKNyc-Ue3?sdcnC~U4qk6yZCapROg
z7gF-0H8MDP;!{RMWzK^N4mY@_VYT$QyQ{nrI1(uAXot9~DOeRUdMyb!-j+T0#M7G?
z-^hYbzVWgcd~_l3ut(8(XV$lq)Qjr&JY*UDFGH%J*$7jo*Ssd3FeInoh!NtWjqJT#
ztF}^=p<R->>+|sW(lwGLCnVvVul&af`Z%a|4CdsHu!0Ob5Y%mB(CJf2GduH8v&dmA
z5}Uz4^>G;(hH^4tC|)sXahJW8$dIGH2I!2Be?<Xd=zBv+AX)cjU_F=tODvj!=yK0>
z@8<X6-4!E9B^^;0b&i>X@;s!XYiPwXsH(pDWOr)n07W}shZNP|K#83h&oHl)JDDs|
z^c9{%9gS2jHI6Ih7R_)k7Ez0#d>TgUq>*v-(B4Z)rD~amSvt2dLS91)jv7Z}SU)^s
zE^%0JDjyDW^}BKv<tBqaviQW2&kFaR8o+RppwtR~UA{GDU301!x*yVD)|xN?o+|k}
zn6c`S7bh(IL<EfT9d8*^mc%`)JQ6@5!SM{_>KXWtm1gBg(r3OvT=)-(j6@bgxYMOU
zah571C`#W*WO$rhgUDdBM$&$W`LRTE9_k@VEv4m=DS6)EXAJi$mLabd#Vg#QbPfjl
zM#s0sv@w%$MOJ_%+9c-cB*jpuqrkqD*)%F2ElVu4&+DPlsuo)B;l4{|HtsHXVV#r3
zd3+;GSd86MNnorF2T3U(xlo~wJX}ZVJ98-gOC)1jd$F@xiHl1!DUK2y!8ajxCnS*n
z*3z0wwBl6X6bbIPkc=%%WKVsQ!|VoxDAH5{GfZ139bI3A80%V^sE=Cbs6Ws_8iSYy
zlSqkzk8FrC*mhxS&;`Pb^k9cLq=8<9SfSKx1SvFv5?P_qSQ=}1V|~Iaej+p)GUWQS
z8^?MBZ@kNIj79{+m-Mp}*GGtq3|8()d!SkLE+@sPn3aQTCo1PAAU@V|?1`?METD!m
zt1qU`7sYh^jtqD=e;-I^4gf@Tvga{2YmmQ~QfxoWFxf;pHIdp#;}v0*rnKwLV~~w)
zZql=g=0-gZz6Qh+33LEf7&g*|Nf?lI+;h-6CmF}0@}bIpqcXP2p7b4EaGgt*CSnnh
zRd7y?|0+z`4g$cHWC(@D4|l9TQB=u`QAtXHca%wLYRI@73>-Fwf-~Ba-GotQKXIJU
zDP>sS_F~8*(k|YIyV|>Pkt`dhg9y}RNDEuh15`ub*%=yjN+4q<7o`eCJm*dw8Y<!(
z)(8zh;hJcLDyvXyz_f$fhxwlzgdJ;;H5gSaohbW!gawqN-UG86@pu6(XpNZkv*eCS
zxbJHu4*T!{T>cXV_i#4X9cn3Z_F2B`fZxk&@fA_j`x~z_O$Bil8cOvB|Dbi^MwXxe
zSp64{E>xPpTX!omJp`+JF2KLxUNX9)8iG>HbHz2l5LQ}#tzT1T750}fX2V}*h32i!
zMg7_=wJuR8QF>wZ=?ZL61aVX!w<jfqQQZLL&RNiC>`RjcB`Geav8WhoTskEJD_mB}
z<=G`0q0WV383>lW%y<z=PBms62K)4zs??<8I()Tj&+mPPq#vUIFETNLOl=Aac$E~&
z+1WbRL6G2g3U%iL0=4L{(;gy_$$+PL<SW4<?@gs>CeU{Dv;g4)gK%+4x0^S?a>Eh;
zj__71ywHnAQ&T6eqV4D|2yr4knal069^cN5p20?bZWxyOMa5L;<GL(Zv-;wuP7d}c
zW8}+QxFb^-O$#t(iV*1cS@KuwU2#_Cy|rO|jyOMMh3?#8M?=+ZYF|}T-4=m?Hxw%P
z#skHNEu8X=AGhe40!r)+Q0qEX3D7Bq!gu`oEK)Wpe8LlO;!jFhpxAQN#{O}PA3L!(
zmzV>wzyHCQ$lgn`+7iz?=)qj^>J9>G*KfEmol5WVJVhe1Nsh69F5ga0GU0n5Y%#0D
z^Tf^mE7)P?M~GT<>mbn5<zD_Y-xzQaKa~VIr<vF3c)3RAX{gUpov2AY)9A6=95?ED
zIXdT3OVx`k(fkw-kdE_l7;4!?`drgm2>rq!qX<+YfiCOo8=0m!nV&YB6&<P?R^&wm
z%|j!s0(-`1&5{;=XrLesV!|An&oyRGa^=(^;<CGzua?*B2n~4=q#6D%sL4+McmYO*
z#KN0AFsTtuU28Gc9%jF#0*gnw0|$~kcGtnxJwTRFs2^GtOt~zsT3mXX7Mt~+OA&M@
z1UF>c;`L{%mDP#S{>!G1G`XBz7#YE-i{`B;Oy1eJ7;lhe&_tl{zkiT_AI}SxtayE_
zrOZ+L?~0wzar;a__Mu#Tv=C5)sXMv|9y@trWiO~fjk18)L`K#~l;v4CavOtlsWcU-
zDS;V9rIslXf{Rrnol4PNw>3&W%r7pdkpMy6B=xSSk&}n!;^^1j<keFTjBnoJsShhC
z++MfRm3kP99^tAH8i_#vE{H~m_pd73)po58rgR>oJuJMCI}E_ZQXvKkRu-K$%tj*k
z7^T4b-_kV}{>N2h9d=#M&Nxwn>~o3jouG`|l0P5QZF0#)%Q(Hv+$ch)j$A_=OLj9M
zcwm!RH<}xg?EF0IO||Pl{%VuQvqFmx@4o4jR0gV~6By<LBfqf}eKaF;jClSgwepR<
z!;F_vNyyw}Lw%dcU(P34*05ZZ{}w^wcfc|}FpvU%awN@zXBsMh2Vi4{me6upjGC=T
z#H5l5lC*GA#5lF;nq0dj^k%?Gr64-~#vV3m+%JcDX7V#73-^{=QILp3!_7rm)Ubc9
z2ta#*v9m=Do0vjTb$XfdGWTHt-VS0w=x2qcUj~1BekGj+C45AH91%le0>dgu-l~Lf
zP^L_hKNuY%Q!V@*H0aeHGBwcpta_IUJq#PIrr?Gt7tOW9oT^e<+Rhj&oYp1V+VSn)
zqGWlY1(>#s{YMoW7M+h$RU)XEVUs3+h@^?s(G0X&s;QBFby*CIJdtC$RQO(8b4Z6I
zVNk~;Bpjp|swPV{)SU8G!73Q7JtVu*X85F^@Xkirllln4=NZlzmx|tw0pX7of8W#y
zL~()R%<A=`vut{mWyXPTmze#5xq>8m#hJ=}d9J;34(GqfkA`#%kMN2;Nj1bu(12st
zSuIyv=p-~n{@fi-(hzo$?8qV^qGNypZ^BaTnyydP#@M1{s}@o;4Kzv7F%FD%SeH}^
z&>KGG(4wjBXd$o-m%%t8m&feA)DriIw#E_gr1z^|4*#Gcm~Kjm(t?<cdm4VGzA^VV
zs!5hzHJp=5>z&!#S`Dv?$Xb*7An$I5mCdY2&jnC-*ddOxcM)NQy$fZ8y$d4WO8@Y8
zYw3<%wFO$&)bMP}fh{?tR`0^iACz(QF6ua(mB3LvMh8~F@1mReWy770U<0FIy(b&B
zA+ynHU=xkCCjGnCZ2J7!)<TIkV5V(OGs;oC{n@h+bPo1Ze0SPS=NMdh{z|T8y{3D^
z-7?0DDS0Ot=q1jJaHmCgi-|&Wb_?*Fq@r8YZHWrje?X~A?1|-!a+0fMJLc0^qet<;
z?sfv*lIGyCLx8b$u#C%Re6lhU_}05veJs;`%PBl+t6LF=qiO-AF-Olv6t>0I**%c1
zPdTB<Pl+RN`Dv+K7S9NjUocsbqBeqdj@vJe+b6GLEjdeUkGPoi+Fd1HapsOrfqKGu
zRim&&1?H!<iqYL#;^8-^D!3iKgY!DcV3U-WkvnC8O^={r7JMbHV3)=i)FOMOke5qY
zoU)@Y3uw!?6yDY<8PU=gPLC^$Tlq$_dOM%^oTk{HjT?b-?v-<@aCD!2FEK&x1jJ^`
z2yH>xN81gg-1^Elb)+NWx8txC!f4*;6?)Vdp`G{pz7bpPDtNeP5sr*oeM6LGD}9){
zOra1>(jXO6(`rgqKn78+Wn?^tjl9L`b43(i85HGorNXcczOsUK3>NHRUxA8k8#Av_
z&d|G{!@T8e+F!kG=@LM=MZ7a%Q)Cx21o-`9Dx`V>8^A9z>R=^xq~sq81>ORMv({pz
zg35J^3hWg3QEP=1n$ktN7!+sF4Xd*0UJ2{P-K=`r|EvgtLT#lqmup1y+e%?6Th~_Q
z7%6RLE2V|IF;G06a-p%>Q99rI8F8hs_^mrRPDgISNSy9Pw6UOCw9pNc$?sss+4J_f
z$*BE3Y&KFLowiRqc?zqwBk`v=FFOb_jPcR`v6H+rn8LTh!s>G#bMD=5!}CW!SMPT2
z;ePBL9iF^>-9C;rYyw`rmJgPBg#R=!8gxr7oPirm=m?D@a#qvm17Xr$kfiqU)Jay^
zlC*Zp+nJrIrPEJk!i0IjVYPCLLH965R$jMDE(N43qzPAysXyV$V2&;g+%PvLQeQ5N
zVj2O%d_*Pc-L%8;w6(&oU#XN%jNlSI)R=7TWHn#WfM%LGIiXxQ3Bg_}Q4c@Pyg4C3
zcG)cUmlGsvZRTxc(2S5Kl>n2KSM7s0D>|)G=3a}f*_510GMWK}dgh}-)s{!I7-eDL
zYZTOAIY<`6b0cxFpKm@t9F~fXDlM}Gvv5yJ+|~@9sK?+6`%c|mF$<E`NHa<SxkQeX
zoM9A4ts7GDFqN^SM3<yAioYT+QdqyRk<#u(v&6Xi*d?rR%lo4mmA_)`n>Z`7CozKs
zWibud)cg^%Nh1yEzAaQc2}}2-vuQCz{{lwuRbu_CTf&{^JrJ<TdS`}N>Nvgl&zgiX
zQe4BFu(Bm&<A6{(aNGE4RJaBm8Y|68G;R%hQP#f96V6Eh{H3mx>C&lap}>tvWlQCb
z5gGu}4Q(lWZn+dPlQG722L0Qzg;)yNqLk(Ryd0Y}iGF^5o{>w%p@TZEza8cJ#0)*|
z%|)B|ti#&l?=WlVueVm_i50)1Ou+>I9wui6+nHk>-bjwP;s7czkM)5yvz_!8(+CbW
zEPI(x!{ZJgyMfR#zoQis8TT9?T2e$YFJLh?XwJyH++vM5wKAs#+o3s<8?20WLj#r6
z4afVSvyV-90AWrbo$fBIh=kh;3Breot3VjIvILdob7=4(fsZ+oNJKqxaM6{DZwEPH
z51j1B*jZXhgrE!kFUx+Llk~PI*UisrTbwTR;5{OXyLm!EkLDi=PPxKRdK?v3PQthx
zj2JCo%g$i2hUE`q_RH*+Wa%-&fIkt7Yp&wQt-ES@qba{?URaaixEO!klfRr93*`LJ
zlcT3$%NT+AaBSVl!}{LVAD|!IHx>$__z(`LCiD<L%K)h}79G#;5(knqwNb?Ng`gXl
zH@W`&?a9xg-6^AdX~bpU@8*?J_`Hy1s2~9x!(|v>pFh;Gf%s<qO54<|g6H#cU%!B2
z>ZoOTN-48x?$j2D(80XrkrS%2Ko2VMtChWA4LNiDG4ah7n3^mZh*Pc?0!UTo5l-4L
zzU=GlJ&6<e?VArj9Aj)0j1fmcVmOl%ZRn>BB`V`qlRDz)>`pg4Y<7KYE)#Gjlz>HV
zvbih5|D0W3n^{q3ISzNdZ#a&m7<gWR*s=C?n6fU`S76Q+F5w`r`s16whYyxpf*K!&
z>m9bfg_vW(4p>TMU!m52jnTwG@Q)V!4z0iVu>hjl{<DZjqDleHDpz&pOWOLXytSVV
zmR#+{?Dwyg&d;}@8N6iC0(gc<_}>w9T$TLElaERNE0RdRLiNPlv_Lke(pj+xm$+j0
zng>QaDnL82Kv*Gg&GHD>HF@C`*<fj*d%Jp?dvCN!)J{HZCC9Smmd54MEJof&P%pL6
za{bjQ<Ce%OBwA3`)JY1m*PYPGVr*KXxB7uh=d)2irASe#Nii&dgo_cz!eS^e(5C@9
z`<NFPUGArAn5@+>SF<ibG?pA{azjHavY!}=h~RuDgHtY$JWpfgrI_MvO0%7>MYW|C
z)|DbUud&6@$YXNc92qXgW0v7Bfz%e%OVU!4h_LNw|GfG6KNzR&u!7wl!iWvB{sme*
zgkNJ+?RZl3;4h?z4%V_sdt{kRuoh{F#7zkqO4$^S!kjcS0f~gP*?7|iWl`e&Bq|6G
z4jap9f*7xpGaz5`k!mqw8=K{wJdJ7)DS5uh`qg7<pti;Xn8~uaA)^)Keh#NB&OPln
z4-YZZHk?T~73Z_TfMS?aJ7<jYg`2fy!0d426Q+YEVrx}7MYt1F5{6hh#aN)#1rDn!
z4p|NNJ+2~en4)79hr@Et1`6GW8zM&f`H*69^QM=@fVR{^Oo4yEfMW8`U>UyN2ag|l
zCxpDV9<Z=pK#fBZlAGNW_?FeAxMC4mU?B^*!>NNPu8V|m9hDQ)6mfj+q(X3c>DpV+
zSb3H?MbkNNN?URPUK}FyD3D{1Z7>2t-A^?%`OGwxead>XDQ}H5S;43Vc;AR8dnGwf
z%S$&c!c7DJYRKq<322h91pW8ErA%}6tAIOdYqIoSy_Wm)>$NN`F8o5`Liz5O_51HV
zp`kW)hswaX3uv^On{?3Amy@&E`MYrV@56JsJwm`HIBel=+v%pC*yaQ$;#um39|FUA
zjI?Djol?tlC0N>(^eM2!<O(DfTe9X^CnjGuo!gou#93x)OyEvv4KaP_r=O@6i*u2v
zJ(kxgt_5dB<`BL%0|k+uyImWAM{LCyHtJiA88GZ~e*VYO4b%tR=*OkEP>)@d^GwfI
z^(MDTc$?;ZIa_&d%9MyIZ`z0Z2(j;rEAQTQ_7B=9rwp>4_o%}FYu>?si}8*rnf=bX
zR^Gpt6TWlq6!78<Fd&*@m`|rBe?!<W2{6TMI-X4tg5#Wgg;Xx&41QG!Bpnhzibcz5
z$tmL^hr=TW;++;COkPS*ueL*F;$}lzCXRvEBJFO>9g0n*Wt`<!O;XJyGckOeivt^@
zGDuICD6U4h^{fCSSxS^!BKa5Clu7lX7)a_|fpamvbTmfkP_0BmTyBQ=ALq6z1X&*L
zGn~0of09cpdCSEG7zYatDf}uk>e3muo8c0Jo!#>4&BgG){fczaIvaL(E?paMGrWM5
zgMOT#C`!DZoiEHN<+LgybW5QQWov9CyMwY2whvox$PScA)O!ru`o8DNdzw6QJ$XCH
zkIk4w_8T#=o%($DV957)#w^&q3T6yE(DJYZCmAA~t1!gxWSOhf67OhRCG|Owaf5i5
zN1<_2mi1E-(k@M;i~AN@;eueCR<eSR#C@0x>O&;f=7n%fOfs!#O=tI0TP4CQ><=}V
zWx$<id{?Y1GEb7)xpKg(O=Q*9>!KxFU08JF>(y?P-kxOXq<2Xi8?-QD=az2LbF{6j
zI!8{Whh~if*nUrR^69afD!*KX4}I0$?V!|0d=<mt*Vp)PyXqIYtWWQEJztSJkYS(S
zFIo4puH#=+|FS|oH?Dyh>rO4Y=Q8s^1r(Prj#)PyH!hMncPf@Blo_9h>Js4)?_1?0
z0&2Ia2hFO_A%cBXQ!vB6<b72h)#Jd?R5Vo6>M9IS7z4Sxp}iz9y|{H0my6J>#bp0Y
zSnM^2>(|F#cQDr%JFadDk{&<jYm|bI=_F4_eiXBckTGe)0Y!S?Bi)=9Xb_KB`W(xg
zOQ{j<N3%z)rq}e}@gkp;Q=7N!))CguN7{%YTDwpj=;kr<UB%BEyR$v&&%MupdoW^0
zUO5M%Uf|j;#Bx}iYc`j~8Flrp+JqM8CX><<Q-*<8vaLh1Rm=$zj}ABy868&ExicJb
zY%0Cp{>RtqEwlK=eU050Nw0Cnu;+&iRFu!y_`)?aVFzEba#85%Wso&%!L0Q&KiSEj
z@pvj{nEa$4cenaESh8WOfYsru&B2>=Z$r$<z2`HG<3%nLrdlm{GQyzz?#7<4fkO?d
zj(ri>9DaOq^jlZff`lnXo|am9kaeo1N5zMhDX2ic6+^x1acZDFoeTwhC{%2KOJH!i
z>4Y(0tEDhGZwBr78!<TRvm|fSj2IR}hT+3(Fg96=6+uR5QNfyFvuQQ>x>bWt9Ic8$
zloQ8pt>kr9H*{o&g**p8i)wsZp(Op3tZ_QCdHo-POy|dmJ-%#{zD=I!8TRcw!@U0l
zQ1gQO>rPkBLq<rE;>t@)4(Q*w0JL+lgE6?3dsRJaypzE{#=V1J=h;fjyv~e`|8^PD
z7aa`IL&03-6M=PLP@~+VfhrkhLo~w(mz8lk%r<!%k;djF%~t4F3^6gXHA{v*!LC^N
zaQW6_KvMBD$v*ltF|UfBMW6l7)p32AtM&D`<Pk{JRq+V@FcHlDXrQjWP?3I?5`Cf)
z+Mdg&YQ<jvkPV$K%R%#+4CCs<%}B>yJN3@t&`ZZ9dTt5AoAd)+>`I>vndn1H6A4)m
z<RP*J*%mhA)9Z*2a&KfLhY|lk?Myo@#*ojVF^zG7;pPH}3544_*zLRy17d7(ou{yK
z)^Y2s;~c`@o&EJK{%3o~)|yYmClyw%KkdB6Uul`}@8kCA@y~uad$*AnN5^|@xa~jR
zo}6~})ot}Mo0jZ=DKGOePA&m_PLknlFwMt<tg54m=+hR_=OAbA3<dBpcB_Ol1-Vw%
zyEL_x|IjehNQZ?4KDhOdva%@w{Om<QfFztPgXX8fX;^BO0@kKQIH%;K8hJ0o<SH64
zwsQv4In+F6^KQFF8>YMBMI)X^Z+B{nP&6HedbE5$SZ|QRofxZnkxu#qV#BdN`NTG)
z^Rg>&4}M8R8>(@Ro?q9z6w06jSqOYHobAN~#a5D$986rI0;kUCOaratZ6(GK5yX#8
zc%vhyG0Dc0tVH39LI$x{6i4d@6iDBj;u+6J>Vyn(9wh?l78MS615=!|avSYix*(ik
z#vSzG7DbsLp=>0tVb}#h`8p0)?6(A-n&m5eG6d2=Nbt3U5Srl~XV*>%E!u!UX0+va
z@+9tx>ZB6HEgXK6VxS>uNM)5J#@N9^6Aq^mLeN)-7%qk9I+D_IjHjDUVU=Muvr+&B
zaY(Wy&C(cL&WLOFv2<c<BN2X5?mRXO;-oS`4LTkei)l)dw<+Gz3}$b`G^5TLDbw!M
zq@=3VIE&}WCdDpc6sQ}<X4=4p>9s6A5he@{7WQhY`Odm*msG#!igPAS3$(oxpg;-d
zl8{2I(;$<uy^$#UT%V2dPs}asbesyrvO)BN_fYqFKam5RIi6xtTYtT2#AVnmij6{M
z>(4R<o9Q(566^~7ZrVU>TDP6%hUpv3#rbRyI2*4p{+Zsfd-TGzat_j{xUOmY%E@Fh
zb!ArWZzR=2q)H>8&?w%j#VWMilVZ*`bYt^Pd1+cf=w$+tg<CVnop07OcPK4MFVcL3
zV4o9=wYoN~$OsG@NCzCIY~R^p$ZKqlbU&#-OR-U8Ycy>c{7qy3bwV>4#PcyXeTDTy
zq`(}(y=POx1(t@=Q31WoF&J);e+XGQA<W~5ZHO!RL@107kxCi7lv^UtV49re7uC3k
zYh(tfz?y}7u)&PouGOByNdrb;n6r(66`t4QWPa0#T~n%+Y!LD}xz1^TQC4|&Q=1KL
z8sa(INM03JnKEbXjTTB11i6vpI&q@PJ??<LDG)S%#7|WMP~`a2>3O)3u+(GcM*?z*
zGGHOOUP5uMO-Dm;^*pz%N^2&uim#`I*oYkFhz~s4NDg*SC^I7OJG<(wsZCf@WH1KN
zhboOh<KrooU>bcW7L0D3VIW*>RCwJ?36knd^!O~fhkV3|Ma8Xhm2ve{3Vcg#54_&<
z@hIDrp1nZs=fG}bxl?4EM*6gC97g5gd4W+Pl_Sy?c9c1jX|M;<zI*sufq;{T+?Dq?
zt4)_!i_?IalBq%FrEW@;AjoPks42XRf}rq5D@afIe7qvb>=IJ|paV_}6TRc_5tChs
z^?AZ7V<_uZLJRDJbQq|!e|_soLb}@emJ|nf&J&XXK4mq*G-fnS<!^#<N3FSy;R$@t
zmBAv75r$(i=>=g+<ge>HR+@kMaP$)jkkI&SR;&!c39(POI1qP%v=Ag2G}2xFhWK^g
zp*!E7yU2~Z5<xpzsX&kjc-11~$3ozeh+Fpt0Wg?OtpQA?$(4>oF?fol#eS#io5bZ-
zY+OYpflGU$A$4RH@#5>04*rFb0aU$p^8mh98UXFtY8d11oe}Wx@0k&R!S)Y-Q#Jq>
zw5lWoJoFO+&fxhEx+!$<k~D_3e4rb@Ag@I(gc#{W;8&DRIMLHp@{1V0Ln33n@)}%4
z2|Z|Ibj^saMx=qyS}H@*#`ANWO)k?hNvPLKBvg%dlIB!fLwJ1km<U}B-g?_)xW8_;
zHb2|dHj+oz-r}Y|ELaGH&I6eeF5)_CoFW#JS_eY)?UTSrsg^DXf$<2p7=Yg|?*mYg
zXzDbH`PD#8J@Fi9x_JrMEDcwiF{k8`?Qqm6c{F5hDlNu}T`tLwk)U0XAOf_e%$ZFK
zEMUxM&H9;>E~B479AWFX`{QzxgaXSy#UweB)7P1#d84+1-|stiD}T-zc~uJi-N(<m
z-WQC0>EthAV+(S>oPN#;*R;~!+tDQJ6&E8o!1}7b$(*t527d%jvU%m@94V}ld94Gu
zBQ9<EyHcRnzl^#~2$>V(?Fy}JJK*i-no59akYz$Kq-jYfR+gLO8qXr!B9pm()=XKJ
zG96*QJEtn6xqZrx3^hi3{h4A#x+}MthOu9z*c8ZMmqp$~wUn}ZO?`6~>#&}BaWO-a
zkZt0$fRh??@{MR`%Ozk+99+?pTFqKRDv>)JgRJJZ<XbKK1s>2W_oWD)L9TrGNnxh*
zi4<cGSkjtA%d*9RtVuvVMIXe&9@%yag8xzpv_;z!?XBsk=eHyFeeCDNR183anXw_A
z&nWwkx>U?2$(y4;RU#q1B><ru^&{`M9bA=W<R}p83U`(%XBg_L9wixwhReVU>y1#z
z;*7*D-{4T|$B@!hZae6h@&;Zz7z^%LxP~l}^I>&^9Nh&WO@36x;-HG!C_67XmF4AU
zuJ~G!)f}%sVIr_dTo?QDMH#F&%3b{`DWL&{u^%tDBsIvUtEKQ7plp)^WAap8l3;I{
zcJxHz)H@>qD5afum91ih&541e^co0F$h6B!yt{X4Nmcy}XlEOgesN84cv)Cl^<%oR
z&~Mqtfh0iw44;p<hRSL&y2@r}AsI_B)4b13sTEStkf-5wE?;ADBzl`fCE1%>V*DYH
z5jv`a^ImELjAq00JR7KT>RcALZ%t)yB(`Zbte{BR<5s)&GMnO&>vZjoJlVQq-VXYJ
zzHV#&I5A4XwiOHBgT@`mWm>^m>4FfmTbcNKynOoYb6yx5RusO(0cFL;Dy_)=asd@7
zPdT0nE!9Hiq)=mfVH$LhrLsh}HUq3_kyf)~<532PrJP~yFkd!ZL;tjIc`jiel;j+s
zONin_H6DTo!*<*<dKu4HPfRxk{R|o;e$(Q;nU`TB8eTAAfoX&;*KFPRW|&)00<xIA
z*gRAjQ#EkGh9v|g3SoQzhCq40xDrvy32sFR{GTWsE_}EWYFc^4a*@AbQYS~`9=2nN
z`;l3?ZKF<WGB1y#$OrgmF>r8%t43Ux%Hqq29lEjv=ixaxtsuup&#)6Jwu<=UhP6~k
zB0k{iG~?$tLn3^xaG+{s&bSRhX89!04ve$cI@8bD9pJe~{h2~YcjIW+0$ObKQF*j3
zGmeW88K=%pBoZ|;GBu>yCxdBmRAsg@E!*h)^nfoS<lTPXp<<CYJkV`cUP9STKTc_>
zx#ST$FZ`i8JKGj-svj+phol=$sID?6RT^d=Tg>|Du8nT>dQgW*EdqPSdHjYq1qHr)
zp$xRu+FUL@fQ;MpAGW`DkAFJu9`F9tK0H0{v`^|LmPkxG)vP3@&6!*`GC7=eEzhh4
z;4h8++nW(K-RQk6{rV_`KC5Q%MYZTe;8Ws8YtHrO8pV!79gb-cxbtb54bH3mTLN$e
zr?2wXs&-`tNvO+2I&((30OL}S?B)jAM&fMeSJ3`KT$tUrr$;x9+ZB|UcYg5gKR(p<
z1xCiEy-N#p*W&QW(vdKiiK3M-&YD2l#Zk0w+;4p#?ffWOY-6cF+JB;m(tp9&6O<hO
zY2!~w0dd12{eTox)O?e9<ZFRDQp*CFsbOeQusO^{vfe@ggqRaRVsK%woA>@9;4ohh
z*RWJLgW-WI5zL4ihBVv&#Ny$yC>~)Kz6ibJw;^}LB2C0Z`G{ywBa{U2gec<UyGQSJ
z{WwGHmpGQiKa00{3ICnYAqjg6{dEXWveh~`I(&(MB#JV_uQ7q3JIQ8@?qV~qAJ38Y
zl^x%6yk^Uy1=T~m{9;8QL(MmcN{hYaTZCE-;>gl?B3}}m_9dZdU&+y84^d+&c*aNJ
z+Lm(RNFrsTXaMY}p(NYIUYeVDb?AYcr6w<#EWEH@Z3W}w#)-kT?x?w8NW|5XhAzbV
zI#oA_r2#Kn4%g!ZHD=7;V#2I5U&f4(fjP5M!YD|zjVIYAf%|N+3H0llKW}C+`ckv!
zZ#Q{<vAJ^@Q|Ej$=fXnEKKxuPgMqSVjArI`F>VqyPH1VfV~m&cZJ|q>HeJi(JQJ<4
zIet08{1)?KooTVUBz4BcB@B!H@-1&sthXjEv?NA_snCL0H8C!2QMAUwrEH7I(k4aE
zoLFl?t(X^`N;wh00|R#8uESy*BWu@rzocWAIS0$2D0Q2;zY_t~xS3IsUJ=?O`&kbp
z`tv>PdxP#+Xx39P$MJVcEIMzAPgC^`V(d<DHYtJlRPCb6jy(<y9ZpSl2iMBi<sFb)
zflq25y{MeIbQhOY<gZ={#R|FBon<aINo|q&8(TJ=2f}Toa+-xjS;7`7w$1(afmk))
zJ?-o>)WEh>=IHDn?x>}bkA~2mr&bhm{3*WSaitWK7%4HrptR*ExblXk{9>TlnOi#6
zwClBj!Q&j`V)ED}O_473i=fOnTe13BmuY_0Ajdw@xLFAyuIgZL5e<zjS3Ss5lV3b2
zvRAwSLXE<g$-v8ugV&bqO_&E&vp8`yFUwihGA6$%n|hN<`AxW5j9`7nC}MM#EjMFw
zHdOq82Px=}t7?Plmz(%&jzyZ3P9>keXX3`T-SB_EQV!c+y_CcDlBFC_$}m-4#&~Qy
z3+g4&$fm0ar&}-refX|Z?+kvx;2tcnq<yZK3f!YCOE@Rpm_R+fU*6zpLkkP3Zn+Mn
zWr`QUTWU)e#ZE9Bu=LDj?GbPp?f;khn_e=WJg&;{aq?#nL)7u~4%xC=5#hTsXLJIQ
z^N24gti$OfAL1gxq+bA+)}LSR{u!t}dH1(ppS?GzcK89+lpk?i3Br~nh7_1B<?^I9
zo3`fTpA%fUi(>bZzo{A9O;xV>2;75X9`9$wpP(C);!{3kJqbFEHj+iHH7EoB&%68k
zItM&qRFWxq-8lpnBeR0lsr0jGT9A#RCXDBg9Egj0BJtuuKK5$fU;SsABbpFrityPZ
z@;d~CcF=j<IZd9*;O)%O)S>@NoGuo&z;VA|&o&lyYg5vFLAT36@J5dDmeo85PlQjk
zGFwcX1WAycr?Ua=o2|{wHQDRDu-y^JbY19nS325S)Fj8Srx<YSF2#o|;}~F_fAMdo
zZnk~R=M^Cvri39thcR%F|NYzldKlJj(Jp+&k`fM{73$uRywc!^289)geiywBe1>CO
zb!m@O=M;l`k0yGzQwHFU^I!{ILFf+(t)GklKesIdFG0b*a$4v(#D|RL-3aO<6<qn?
zfHAN$*{zeNl8r;0gN*%jT-T>x6>pu>>Yqwbe3MP^)bJ?IJ^CrK*dG7f6wWpr-QIFJ
z1==FV@iONtzJB2WOOYk^tsBg;y7+9wh|&>ZA2T=1e!|@#JRxbET?;P)fd;<+t*KQY
zLOa?dTeq+{6Byw~%Dq4~Z~UIHeTOM9!;%X|Q6y`aN+G0EAcPGtL?F9t)RTzy-J=&k
z7%7Eoa0aznRPtV0u?=>Rb!4Mrc5!KAfN9&~%)m6#)VPR8nza+Qgorde3viiTFjr0m
zo4?f=3DvSf6SGUNI}zrJ&QN!qaH6^*SzO~!Aj^DO--_Z%OM|kfX=>3uR^Q&@H`SUQ
zBSNO1X%UellR1LqZxsMppnH`K#=u$5XQLk3B2nD_grLB}t?49q1z!fDU<<lDMYR06
zbNJ#&v=+<j@o8fN6H@^EWchx}@(H)h5eAJ|mu9u#&lX2X?9186URWTbtxXhvt}xAO
zv^q_=061|(njycQ0s56cTE}v7S8CB5`TlRhGxCPVQm&(^KtnyJBGWoF6hvBt8R6tO
zq^E))RT+7mF$Wr?GO-qn4Yt?27r>(5<L0GrNf68xm_g~aAl+}FUq}DAUuzbfTR2%i
za|&P>Tz|1}tFL?oySfr7p5l1DKfc=(m&gjvOV#=P)q3f!M`bRSA41(Q)DgQvYf>G@
z&BqcO505GA%YslF>fds8bL!q%Q$J^G)17K(!gZvt(=po<iRk~3JW3uX-^(~X+*!0g
z5X)L&4Q(a3$zf`y{_^~GCUD+;S_jsXt;1$6=QOCG@X#=PZ7$s`istj$<@VNhK%S#p
z7mPbCr|SZPm-W~4e%P{Cjlm`)JEp?hILkrWaGb4K2SB_toTTQ)6vfBa;~QaRok^4*
zo3PfKL2}?}K@Js8fyE7Xk1|Zz&VEIag>k=1)A#j^jAJJBC1|`H)qis@qB(LXMmzZG
zS=8|Zw;PMQT(#wis`C&`7!78f#^KJ|!ua!2q6f%g{zcBBCEZ0!MxM_j&fh+|t$*O?
zVh3$xbI|b`21~m;hG39Lpi$F7q$W-<eR8KeceOKSXNcLgOA(toZnrmkUJTJP-Kp;G
zoa@@_cCM)_u%M>E+?X`ynFy<hBs|&>ny%bcxyOXm=p7DAsxQJ~ZmuoHQYo3zHT|qF
zo$?Z7-3tni(YtHPrc}<xhhd7UEbJj-yUr;J7_2IStcPXGDz`gDR7^M7ckliwMO9**
zI&csH80&HQ9ugNZ&pJn3>{<7?>s?gNyP#VyHJ@E%ljS=#&Iaouv(<MdRzl{&6pxwT
zp__DtQYvB{apLF{+`V_v<$4^O)!Us&I1ozht;<vt!cS!bcD<4w&TZ}<#G6_=FY&wW
z9;BOVw;+CE+ptUJg|N!%ZC>bKf33{OQ>KCFX2nl5qD>yI*|YAV&8zpIpLum3{BA_*
zKlnE|Zhh@zyc|T>&-rB`oSx1v4`F&k`t@!}@jpQb7b(>#T~f2c$8>N3blp!HDG}r0
zoBd{8(_ga!h3W1MDp5Fd;j*`C#$wpv`a%w9T%YrrrOHJt|2B03#~=5%N0_pTpU;(F
z=0t^9hSCa}uG#YvaAI$Y@k?8QZFzoaDz43A-4Ve9S(L5Twgmgrdlzv)y|3lJVF4>N
zPu-Lo+9Ay4bTw7o?DI=7JtM5lV|gAUS!%N{mR>5482%7&2HEh-Z*^FJ5hobktf!?u
zx2U_$ezm>Arx$StGmmrSnK@mYE7R0;v9>hcQoX!s|7ryt{KSNvT2Ti-p}2E1VFy3q
zj*p5va-*~1N#OA&to|vp-xmr#_=#-yxuVZ9f)9RbgrE7M4}K#2^nM+6;Aa^T$aZLs
z7-VnqM4`okklX9!gdyqoazcRH{Fey=^12%d1IxX2u0TLdxP%iE3Gh=D3-Gf@H1Gw3
z`Fp~M2Jzdf9q=BiIbi*#d<i794XD*xf>6mGw0CrP^7eK6_{7h$N8cFVK>1v9)&A<4
zk>17ZNbl{<ui6K1HheGIf}Cddv)jxnlQ_wLvcn7BZT(XC4vIrT-)TD75YHY)r(oW%
z=c#g&5yRZF6>P}&XyDXOr3;tYVEpbqVjACCiBBD##5*gkTPyhJ$z@@a4al+R+_Zsr
zxzp=C<-|LMaB6tp;sx+p!#T$!JwjYPQ>U~9R=}NJRK(}1i4>iw=(WZ1*X7dLY)|zZ
zKJ}eX%e#c)IeI^7`Hk#TFB>b^9IgB%t#-eft6k2{Om&@Bk`4y^4u-A7(q>$yM1U$W
ziUXQld0Lt-?#S903i8u;x7_qy42Q9ow%=Rw3@X(VjHH5Z;)_I)Or`XgeSJyzTV@AY
z>aV2sTOSxD({bR-sDM9g9&9DSbJ^&ZNYu-IUXBrDkn@5}@VL|U+D#`Z&9Z$styyUX
zI`<&z)~VrC5lly8o($4!%P=)9Fbd-{^NqoNx@%I+ca7w@F09NzpA}qwA`Mh0mdK5j
zPmu1aId}Ryv>1*w++X<lTy>J&M3t<oN$X{T)~SgLONP(Q^Tf~Ms^4>U!-y<sUg@Q9
zMiiT>=h#9p1o#W#1RE{$ey}(<P#S-mvbe-cYm}Fps8mb51!roBS5P`^D9$Je`Sn8Q
zK@aeeTj4tQqg=;5pDQVNzuAjKo&Tb}822YFwGpF!qlLS0=}l&RLy?UYHL)x~A<Gkg
zB|mey7u1^97I;N!O>19oLtWftD=l<8Ep|ESonN}YSc33n=(ztmt~hwxtUl(hRr-Co
zshp{L5Cx!V@FF72Tud<6OJr}X<vK>wfjYq9_gN3|%r}zfAYzi}n6cPM71%fpOCMwS
zR4SR~W-)LJnnaGJTqhX<a)3C65-B%As8bU9EXkT%IOF_=P02LlKWWYwE(ssdF&#)Z
zIy$U|j{>na7`HU}7yoHVrcyR`!x!ldU93hh5wk_m3N*5YNuo~iB&us|A{QBBy+|gr
z5w~WbqEX`Imdj*%mG>0yTE%pHg235z9sI|sY#?601PNHO-TQ@v{K6%S*Y(BF!B{89
zPKwR~hRcVc@-EC&2aBeS)^UE4VbP}nQV*n4j2>Y7DxGR%1f$WXcQn1;@Ko#S%9|+P
z_E~}eF}Al9vez)$S1=Z0$~cTW_%M&g$nd888a^{_Mh3<)NuKpp<JRet$?_YF5x*KI
zE}L}D>Fo`Ct4kto553=m?%?={YHmCj?Y73$$3yM^Njp874cCkFbq4wlyFLUioK3oN
z@t>{h9LWY<BQ3>rUK1H<1ivsaCMGj_gQ=u6etCD8d%K;&^bUEQ&@%Gme1w8fB@=^g
z{%uo>sxvino8q0n>O8v}&IZ4C9VlPHwsCG;Uk}q={e5n($P^g*@|LKTK({8TrM~--
zCkN@p4GD88;`|B|=kc=K!yNhN>g_*gul)Bkc%koTNMh%-{kr?&VE1MBWcPLZMW=nR
ze^Su^>bRSJzJ#saX!Kuc24pNX?9Pm)hV9kxyRSz#`1$Pj*4wziHT0VYqvvfCQ?SSz
z*B6ZGw~xo~*kHU~aRY0Q2IDU|)R!h7yve-cwlj<F^nQI_;6M)IU9}RZ6%#+-`nP}a
z4=AU3xn52YD)(MF>D|jdjX??8=zYa^Y{KW!qX+o!*7pxL-GA}Q_WkWg|F-pDYx~i|
zhu?4Chx@i3-oO9w-;&L**oWHB41>j!<lkmzKy0%)_bs^oFZw}kYB=VUU!%>n|NN$N
z+)f&p!@}A6=lLg8s-yrHS~W~g{Q6h?NRxZT_<E9GTuzflubFIbZvMEwy}9+Mm7Ju5
zk0?uK@NIOS5AyN2NS>yoxBmsfST2TGEUizN1Vi$Z?xJFgZIy&kJ^9FK<BaM9v_GBX
zXEXN4fzFD#Ao(aMiy2l%!e7ondYupm*boFWnv7ziDW%xTkn$<H=u(TkSYwoVDM`WL
zt{J1lc`+CiS2-meju@tvU0=g&s(=DXrElc2lun@v%ei8}hf?vFF(_Wo%p2w?Q+>EK
zVqoOr8VF8?`(gn)v%P}1GN|@sqpmCPN@r5ED=^glte3@lqrH$$eNk`3HK<MXi{8wV
zEIfD*7KJ^Hi1;wc(}9Hv;8kPym>q~2-=UN-<Z?fZTTWw!4%=T##&0SK?1I`rOlrYw
z!opo<t_#fODJVU2f_)ew?jcVPJl==SIa&4SDlg8bS1ILJ8=}IGU_12S*&Io3f;2T^
z>MBba0U@2d>YOAeM=wr)+J#*U-`^Y`{i(Cx-cO$Y3>VwU-qD+%k2^14ohGl24))P?
zw|lscj=a<3&hxjYNASbS?g>1(LOTYo?H>M&T;RBUa*`Y!C!N=C4m!{tyx@5E@D!6_
zlFs4Y!Q1`L;mcM6Z6t?Br<`{Ux1Aof@Vx|bUwJY)dXc<tAMd?_KX;#Z4mzhl(<@(e
zP7m>QFW`N<$(!Bd)6U-8gWcog&D-NQM<>)8j&HwnLhxtp{SD{?yf<n8seO2woV?mS
zI0%M&^wVMc7zf~u^?93NJ9eKRwE1-~+I`@7d#5-o`)v;<5juGQjOR^zuY+IOe{REw
zc8`B<L9@iGjt)=S|L<G453VQsyRUa&!WbJ1W(QVi@9lB>HFg}!xUD58Z=au>c23`(
zwv(4fNBcDGC+*`ub@tjPPm+V96PmcUC+!xz<a8HbkFCJ0!DaaV{Ow5x=Z_}+@U(q=
z{PxXh=jgBrYyK0=5X`|YJiSkIeRN1;hRHfQ{u$fF$)KfZB|p7t!|$->hcdj=<6WE%
zP(V6+r|zBbR+!IIXRyg(`{hCBW&3cijaQGbp`SV@?Itf?=LGNR@XLSNg*U&&;nSi)
z-}tLT%Pm^kr1K)#-TzYuJI^;`Yd{hw9U&k1_2li|E17*p1-bR_`KULT0k2$<Jod{K
zv@?Ir<7%BITY)(duNXL2*3)B@MX5fzlS|#JKVi`bI#+SWr&P;;&6U^mi#}6~*7@Q_
z@~XJXFw6W(aL~xSJ<JdeF)xQ6;7T?kxCYZcLEtecmZEuFVF&arcpY0K6Snk*aLX7;
zgZhDeBZ!)>IdQl^HP`?G{|rpBO}*T^?hUd=)7-RSN?Mr52$+JbO@$22M0g0+3D#ks
zFk&8AsnZe;1eAGinc9u3{cKe|0ju0fx$4}>MMn5wK!@5{TAB(Q4h#$Si%JG^p;DP?
zh3BbYs%T4z6sOqYyHLSEsFx$HXNBuijM1ft1NN2(kIhZ*F_+d-?Um_?!TL$3UHOp+
z2BTn<mTe=5U^GrAZ~~%HZ*^2$t>T@8t~Q%cs0kOF_3Ka|fTbzMN!3!=8(`K9QHUrG
zZCaqoaCDtqWK(RZIPa&|u-@f$i2#?Saj8^@;&gJ&e>F&p**{Cx`e!XT<a<+&0$uBa
zv|$5#sc<bT&GtvsVetvjVo%7IBDySSj*Wii7#=b9U?-V+z-%y1jx~}N5L2V?`o>L!
z9R8~arR*gXtb7U*;>Z98Y@1{pvN-Yx5v^m_!dPYv7$~>uJ>cMxR<2sDm2}<ESr@9p
z?36q8HdUIOXIHe`z!+vzW^6<u>ENOO`Q&oQHB7PgN<SUrdMRPk9!2pQo7j8vHtFFK
zmQv_(!eB*sjoyXAAGYpQbX&tsMC|~nQ2m7@y|{pFTH<>wL6NMDRE3d1L)dW>+5ptE
zvukXJ=v^u)j&Pe+_T>kG_t9<8CbVUl2kLq<&9G#wsa2#qxqNKFS_z?*dQ2(F*bpoq
zY!wUbiMRF7HZXE&$e3r)qrKy!!|wj`lkS`Lad!{p8q+$?6YVD|f{8j$MqT65qpnow
z?lv5za14G8Fj@i-yDBChV9R9U4;Ox)tW2-R8A*c*2n50w&z4|d0x_(dW6Uy5#tJqF
zzmx+Ew4`5{Fz^R#hNnyz#}KCgfqD?`n~zL$Br#b$X3_W(0ry6%gG$LIdz}Ae1*Q?J
zfsT6DNkfW&BUTF#%=9ltKh@)ND!q}e@KACt@IriNMs^|em%^`7idTq8t0_?dDe4()
z<gys~EDfn1J<R#&WAT9zNp;R)=a{*oS=D8u6B+{u$9%D+M-)d;o(!^V>>hr+tX^C0
z>8I~=))pP#bW6X$f$^pw5;zBS!lM?WccpTI_EEzeXl<!vdR2H^z^H6F7BVQtw9rPM
zd+Z#JSbhVh2L#E^pW0ovFLd{Q-aBY_U+kWo`t#@x2>s3^@DQ=B1Ury+disHY&xoBX
zm|)$Dy8CaBcTp@R87l8h3OTR15WT>{f;P(-^t@Ru8evkRewYr)Fo~0*bV2p3s87^+
zB7;eGE*0Eq5L5E8OI_Om*5I1D^w<Z^MS!(y#%JcC+^2lZ64;lW<c;O#_~hW|C&7Ii
zVbtWnpU1qs<$&9^P)3yTI`5=v@<3lb6m>65(8O^Y6teEC|H4aoL99M?a0#_6Z(Xmt
zSP>rC+#W&_=A(?NZi}XG>Ab}P2g8D$%ib}v6G<*GYm?b{N;0e1Aw1k<h0$}Ra@}lh
zOBu!-atr}UaIi!|RWvri6tffI7qH?Zs9zA+p|TI$h<K5x34X<f2B6JTg*!Z+{IY1H
z^Za5);yEwUN_Gwe2*gjcMfN71RP6Eq=FAFcI3gOaLBo_|g}Q*WT!<-z<`!w5Xwci$
zszC9AM3?T5?VtH@IygFdlWcFI!vGQSh?`P{z5VCJ)ku1q*OIp@5sPw@E1ub{xv+_V
zj<z34sk7ueTz8Z;um)V2Eo^9aZ?FC46wLyNk9^R^!vvb5X5auHsAfgjU00WR@3P`m
zTH-^|IPA(ucx8EroR(2leNgtr&8?Cr6;v<*H^5s6+R-5a(BokJnF6&4g-=o%)x)pn
zLq!om`8R?+YZ;TAVwh@6q!96)+7{uY87IGqOhT^A{&a5lnd%=rP|-lTe03dONd-nw
z^v_sI+Qd=(Xd31oba5fNunD_#bUs^xNbk;DtA&r>d$7h`Y`MLl{nEv))a}niH;ebh
zC-b>|sqc~3$h;omo~F2HoT6S$mx67xM4yuF`d6ayU`&c~m$yp%rQsG^Uup;OTWtW0
zul`@+frBXQ7lYy~C0To#d0bgb^)N6ZutGz$)_8+hlgM<+#HyWm6T?+og2wGAns2v%
zX3Ec^hY^_`Zn;dL_npUc(Ua*c?ULY0PbNAdd(d9y1Za!}4Dw>e-T6b%oYh|`UX&=1
z&vH`^7nOeky0WKeGD$}kK9(TQTUK$fsjd`!c*gsSRG4Q~jpRw7M>DM9vt%Y|0WCY+
z7U-JkxJ2A6T|nv`C!MjSYMjo*4n~JD785Nmi`f8EiFD8?ni1bq?MYYh&C#F8l_2fm
zeP<cTu~Gn(urQq%P@{hFlZG9#)rYtqOn%R}UWo16W{vH|3uz?jWRLpr21j$sN(HFx
zTo0miPCxe>PEwC~n54I7^}Hhp;@zikPJxniS6JjrOFXV{NeYkMaBD{QNo1X*co4PV
zNqSZ&a?U{%8*N)C?Of&;mmA40PVtD8E|#SIE~=4_WNDQeZ98dc<r5L}3$(2o1{<m6
zOy2%rd)>L?v6hI{iy0NO$fxtUS+uaAAF9KP@wBob?<NhiOPclP#@hCRcT_hzy|I#<
zhu$bwg=GVgrct#hpyAc*{g$ZMvXrFfNp4^HSbo;4TTLN9YM7+U{pTg?T~}yZ{g`d&
zz1vMxO^6K<o#AzX;&bT^e%8?B5*2ggInbu%(vqZSyUSF<AiyeKqk=o)lK>boZelO+
z+27@&0I+1JRw5!zPwDqcGq@~q$H3#BftrDVh(7(<)eJbP`<Pec1P3lPML^t2R_C1P
ztHJgJ8P}{`&b!Jn2uT$9)H^gUu=qBWN*4cU>R3}OOEkt7YM9K<3CrcJz*lQ*JD;qA
ztgX13HW__js3n@5%+gu|hfKJcO)l6~Hxp}H97S@^bo3q;JNBEf=dI<prunB7I_kb|
z>n42JEOTv#y=_isGug@m1;>c?z20m%L;FBQrXi#HmHHIKJ_-bkJC1M8`&p`UZqth`
zw!5`^lJ`k8;z4nd_lRQ{9|4|}!18VUKY_~AGLNWIxT`h$HK&PNcY(Q&2X2)W=bCOn
zo0CW3Zcdn+w`K0!sjMX5=*Pez_JcG`b<XiLW{*#bX1$9+W))I>#?w+94+(ePVZM%o
z!QH}l8;&ISowv0Ez(l`%AFwBMCorfqE(N*mxc(s;i*V({yyPB@Vy#fW3$#Kx8kAyz
zhmU7f-e4&itN2_YpK}{BaS)D`2Q86S1_tiymrOR}^hyCTB#X$_#yAKAk#HB>;$kRL
zlbzc79r6-_r5a5>V^bc@4Yx3=XN(Ees@eLa?Y0IpiAM=}(M~;irsX&T=N|gr)U*6Y
zaZtQH*k)d;#he|3j;6gLlOe_%Z#Lni@`E>hLWEJZ&@M9#z@I!<7Hs_~>@z$>+<QpT
znCb=$8Zc*qw}?uj=k`d2v0jP+K^>}aJdQ-i@sJ!$+gJ_)k3#l_QO+EeJP@Ipt3GVT
zB60Dq^y5Vrx*dnxIRifRVIJNF&6U0wzk6@?pA55?!)YMZ#FD89#BgA3eFw`==Ow*P
z*aXcIJB<8(!`X=rByqiFBXm-=aLc2mJmG>0X-+&9+22_<MXM5>vKt$f0tsZHVT}YM
zue2f&3=ifRI9{2KqbtHQvy<$1_D;L6PP?7M4hE`pPdfkA4n<`A;0ofIdXFD`3esLv
z=RcgOQ+4GyVGp#EK;j_kLw&OkEQzgV!$O>T;n-OG(5M8&dTBBH*154k5fP9Y?=<m<
zB0PfhBm1W20`Hqh!Z<mB;jx{l4XTQ1&U+ztZ*?kP5jki;2)hV?P6xo02NYbFm2QA$
z7{lPtCr%kiR~gmf?PZgZy3>Z_D&b<97)97CW@97&A$4u^T47_z>d+{WPWppuslmx&
z8*G#7ES;1gt%fbwy1!bda6EvGQC0_{;dEHh_PWv&J}pU4ASFKKon(9=F^Q)-8W0Mm
zA_KWcgn9|-2c<hKPNt89Ex{a;69T2X$9jzG0iE_J{cx1o_Mo>UU1LGPuq{F^!s#G5
z5UM4J(0npt5|&9T0-6wotEN-Lr(DMd>DZNu!}y_N1ZzC$lsv;(Tif1@962IOIk$#;
zLsFr1%RMFH$GraF$*1lsV`qUW#>WIff*yZ;inaOZYdoI=KP0j9gHnm&Hj;IxJkF5H
zFgM#jl46`qKmM7V_dnqQW1sGFb=K->MIC{=?|8Sb?_5sbQQzKgAkQAA<%jsQUi?Z@
z+X(&h4qo&=-i#CCG9Ao8Bt*(`rAl5LBeiLa55BDyAS_tsI&3e-F6dXvwFg~#nN4kM
z1P5o4v~0Cl{t>ywMK-N%DlwU<bCJ!Q`KIa4;+>~k`G)l!C(AnaVM(SgtSD=)d)2+e
z4^r`*V5k0BD{EmaQ&Z2ry7|_|usb_(*~|T~8G;Ql7}Ep%4aM-&(*q-lU(cIv{H%$c
zk@_`v+GU>TB)<EMiFDz;d^pb=ZyY}kKf;`r2cE0`Qr-SxYyLC7z6+z2uTLU(DeuJ6
zq80rUKli-C^6u)ealq6muju9a5n9k`jM0MwgJ~pkS*3fPT2XnDtkR@wv*;&&N$scF
zn6fJwUMM%<hX{~N{8Hu1@E<imYdcpN<v9RdZhseRM;({O5MJNFk3W1DB~&)~IjRY%
zFTS!O->MYl-{!V+@8M>1?ZJ;|7j}M`n^kD+gQoZt2Be_4LTW@N^^UF5Lh+QMJBKoY
zBzPq!g*dV`q``)@c!8W+pS-Xh7u#5m3wXMU3<0`PLIv|MFSa1AHCh+con-UVxzQAH
z;93f<mr2ye)+4LN#vv=k+vGT-)*VxM_;$T}$6A@{7-hwvxD{t5F<%2&EPLs=JHhY>
zO(d^lMiGq{KcDCD8YU7pcZ=J_nq72ZbUWFA7l&*rV(BQcCJ~1`92ZcdVml;-p>j;D
zNn90Y^Ys17I-f)F5tl#t_1EgmG~^|$q4M2LtB}?BZaf#seB!9CoHR<yM=na_;_A-C
zN6=I|>Rs>l`>gbK&JU@ob3+V3>l_Z*l84YdZ7LL5mX1{&4U5v#))-x7PW_m2<77FG
zv06?oVl^BCLS`egLmygx*Dq$cwrbr&Bbj3(ch4mciPO2AxEr<7^iI2b-qUW-aa}W;
zbxYtm>fm+mb8DL$n-81I#4aHD%x@do`thOGE&Q6<4wNU-7U!}qF2{nCDvj=G+GFJa
z*07XdutSQ}Lq8t<ibg}+MB_<8HUg1D9&_#pa$xblloSMnuC(hB{DR5`Hn-nCuo(n?
zonA>Kv^6}hovahTZyJ6~<{I%3J|=^&<{3ES;*i^vgTNgN51OS*R<0y9K%9V_-$J3m
z*78Vzj?{e1=m0uSTlMzChy#t`<YUt%TLbLFCRB3dMaPu|y?Hu8prCMJ>;TB=;Tx(5
z7Yc1v<Ze*NP`-A84`D!@6T2(sdC8&GqzUZ{wkG`11fUCdz7As-Hw=ZSWd)x=k%=nA
ziZKE-8ZqJa3Y8UF62@7KXM=Qt1~m@$q_LO<PR6sTN0$V$<OkFY$LKwv;6ab7G)&u>
zHsf#_7UdM^89I7C8&I@l&txa1eL9rbUxPLdY)EJwO;qVMIW$He(6vyaErG2hS<ldO
znoNgdrjyX5Sa7$}spR310g2doiu1t+8xy{1TSl)CNgW#LYm$$0KWiEZpV`vjnzv~-
zImftmia8;}jaqooMl*opUFwmW#ZH|@nf&f=Z2wM)SD`uiQtXfDqaxFpLZEUmj1d>G
zB)aggD>Bzn0J^yDWwLF(Xe5ES_gUO26oSs{a77Ew;tL71J)&WB>E~!O11=UMOiBF9
zY`g)2&#DP<M^RDd^&EEcj2VszFQTe>w4P2SY|4t$!RzKlq&v~MDS<Iphq)WB>&zm?
zp~2do?4Ka~8`6%k+&W$Y4RG;u(3omT44Nt;2=CQL50W!XNO0oM(2!u0n$I{Z8HleO
z7nH@}<XfSS&_r|7x}nvC1Pk0nc-z)SvS&!w+$LP`ma)%cQ#p#skM7fEcJzFStilS?
zA7QD`OGe=U1;2v(I84V*zc5T792pOqmI8<i8M<{y@$q7MLX3Prxu8zUo_ch@Wj((J
z!rAf2VU!96i13lnQw<qcFj*^=W7}0X(C4^g_NY}NYqpMgXN5$$%b`?tXoQ@e`>5>Q
zM!HednHWxp6@|wM{%9}($-finw!xLQ4oCIKMebL1%a2JLO*O{@F1BE`Go2HW(+oDR
zM*jJLz-;T=a>d4qVUz7+$K)i!)VWyatP&*Ic9f!DpK&)c=yPXzzqB{L6)KCR_j%8a
zva7B>8$eoF8lZiQ;r!(^Oh)i_VnuCU<LxRWVYfPOkV?T(?1=BD5*sRY@Xj5+;i(^a
z5NNNYV#@;<ymh<A4O<uEfR9ED9FEmgDFc6dk&pVWk-a5L7OAvA6;&&-AYs>~^@y($
zKXdG){s>wULO|5ota|I>8o%vcMAiQsHG(<0z*lMMvPl!{wEx^nyOv4D%ve4#o#lpV
zfJ%jC$c+Upz`KZ)qGq+-N;n3^%}cbXGz2|EFg?mu9%d=#-9<ZPbFFj)9}tO?MQCb1
zr=41BRWnPP+?J`Sv$!bRsk4*V&H5`ShPsEFTglU>Nt|xynNaYF@J-zM&d#%X2(J_4
zuP|$(i=nek$GavQ8HvGV3r4J}o*jMo(!;}98t_#zCrR9GuV!hlvW3f+Pb;ytW}5wd
zL#Ij&Yi-$Q?7VsEzqYVXKAITwcX)?4-=5nSG+<7+zi;GHwv?)}iHgAl)s%@lKTc*F
zZd0+!`7uv){<#FfdEnCU4nma&hC1T4a&CSH0uG<8Na;h*+5``8MIT<~pmrX!dD=#O
zC7BioCL@>`pd>+a!k_>cE~<Tk#%$cx1uWdBspiR5=u2ghIr6cWfNzrCmlRaIlzI;J
z$7#TF7)gIhMP4dY*Dqgz{M<@{4@?Eg)ke_>I1s_9hY#6jk!km5;~PHpk)qQpPf0&v
z%zGTQ*7BahcS$%~&6E2XLsS=&>XUtQ?Mpg4_u-mnsoW+86N;*b1mqfV9YHNBO5>pR
zNL+5*=}+Ba+Mf-PpxhujMj(&IWXIip|7b$;Mh)+9OK#YcSqi_yrYBF6i100z$w(tg
z3A;*px7Fv=;2Klw9#>JemAztyGTc^_nG^m*(VXS=sAm;9ily3r&hd(J7-*Om!xNlc
zSM5vM9GVZN6evQP*E!Zf)$mDv-VbKa)^`ZI;#p#5%9YjiGK$?m+>J;Dlez4F(>J?+
ziCA8Lup^Z`xwWtldi*etJQhb*H6q#=%u<Ruqj?fE_KR#<Wp|9QaRXH>M4FVp<}!QR
zZCpFYCKy84p!vhlT3-O}NsDHK8YOq14`$`13veOQF+PhH0XZ;8hN0J(8y%h2*!EBb
z!-M%As0wtDOxdENf<>BK6h)uH(S1ywp=-K)oJ_Oc<w*QTD8{lL%tfRml1j7RC4_tb
zx#VEUfNt3kHL)pO6%#B6Fcn*II=V)4@+2kbJcBhiD|PSEV9HF7KWq3R!NETZ6FD_e
zg){R4TXcZtOV;e+rN)d-HT6!Vyc98;6nbAy*CiL04b{Xq>?unFJE;-`)(}{R=0c78
z7{n`>#YM{X9P<ZnW1vPd3ZM?W%l2rAx3~FCM0QS|vWOnU;YQg-O8(%}Q#haC=;4dI
zr)t%q(AQ}?9HU~$R-!S?vGO+|4$dnhFBroWumu;r8$|PiB4s<@?$HZ;ODN-TV@y)C
zq^QHEqn^oG(px(4J1#3ShdwtMfe=u8mQnv{FiP+yet#`#jEl0&&#V-WV{3AjQYtVc
zEcOrb9{i013ihC_JjU#!K?8njEia@|$;QTcK<aXS;#S}sn*Q!iE~zV6{$AE=-cmR<
z7uhJAfW&BITHh{zZV0WFywNX8dAB4`<c<EYkvtc~4W=1xk|QAu5{^cxPO<?LG_KrP
zSqy+04M+{r0@draj~OF0X#8+kfgE<Ft{b8p_6U`r9y1>0<}HckU4uRHF`eWoCbw!_
z9`}tlk{73kjo?G3cN*-doOd>2UMX*Rd)PVcp0xLl4nfQ*<nPy=gM*IzXpm8g5&LfX
z*uD-_D(qSK0hV5L`0Q%|2JAwD1W;k2vGXObXr(lz3+1KlbD<O*l5!oRe0aqHTge*r
zFenR%5BSWB^0T15PjOVUD@hIzYxH1X!f8xaHE?AR8nl4W3)sSp^kwS;@?^D=JJ?!F
z1cckqlD+QHA4AY-n~<&ivrBz=#$9>p=Cskug2dr2X_N0;dq&V2YMO;#?mjb<Xj^DB
zv{mLM-aDI^<j8ldoAuq1Tm3u3yevKjBo)aV1T2M>0#U?)&affyxWe?BDZ0-PbwxkG
zwt<bEqY8q8Fw-v$8WsnxloTC5vBU>_JNJ?b@l#hrFduP2ABT72@_$#Zw2)?c!@g8(
z3nA59B?f^23bytLlSZ?PCwQA;kw0NlI@ai9EVpJ%9oEibnI*0y*~13sm*_Of=)o~v
zSsLCe>Fkr6$~-cKTdWm$kpATwgW<dQMItAXKY$><iyDj=aGa4mUM?OZ`1H?CVy!ts
z3iW2Ugny?fr$_-RoNnoI<>rlkKAB#JIcqql2-%$7Ln(pmmF&Coj$h)22c5$|`t&pV
zv~Xf%t!ASEI;<b--+i~h_aq}!0tO5aX7{HIm2w!;b_-q;j-C#U*913BfPh$HFfvOB
zvwVL2M**;FBfwbW@aVMj;^*$m_F?<Dv)5XIo~+QkQ3I$>ISn{Or#*)aR!jIHk|1n8
zu?ji;YZ389-w}Vs*BmXcOZ|XDQi%>z)G^^@$p7_F@Q<(BlFISZt);?S%VXP5yw`yM
zK(Z$CB>!#c^rr9IjKAoOGcfPS)Ax<P#_(LhB7C(Ba#(h~agKlEK%=iTnD-?GP?Hdd
zU-YHZ>7ZT=K^9rersLVPJ2XMmR*cYGRSx}K-?FiOj%&!oEwL+}(c#RYvA!KWF|fQa
z^1T;W6Gk|sBjX$#9sTj`n=VlQ(c8UObI%i}zTx`zq7zNbQQTD!*Tj&rPF3(IH;i<D
z9k<2souwv!94A*iBI>O$T-EpwFD&N>#^&I#%H6kdYTcpnbW6--wK%QjL6B_YWtv*^
zqeOZ8?Z&2TYf;HV=Vn7Ga4z5r9)k=8|K5GLx!L4k(4Y_^P8CkKLyNVfAE8q$o@aJe
z*w*;QjcqyG^!TK6a_YB-Qde2OHERVPXKBNdS!}GVBZNw|)7o>QLOnM*GGt&Y?*57$
z9qyvno@La}nlq+CLNzT0V&CWa^cR27P#E$DT*s~C9sGA2zur$aHa76f;d@JY#jJN(
zzqVxMo}t^!ZYGnz_Y3*V3C%%@`!ZsKx6~eI3)cFV_oNgt2b1^c#6`B5+`-iPkFKin
zuk)$Y{~1oVe*E$N_v?=yY+Qb&cg(N<v-#-$qe%Uq2jA-d{5?MR$lke|?5&R{#RXbO
za0kCWRU$|l+nbvY?)`Xg`^Q97>?T=C_o$L8=;5d7huJTAa+sHw`EWK#Ntk+_eki5|
z{4*_QL-@8qGLYKsFsN}IgISEyexAI>h}+R9OHQwHGOUlwY}PLXK|qmQ6SntJJxOZv
zIb-vZIlmRgiZT%3*|k{v@oE>I$2K25Xp|YS3v7d|#Bk~Cx=WeZaE<;ZHU0xvufCXG
zHu;TCaiTpcPV}Hv87|F1I5Cva9xX?N7rsU@qU0+SBf?fpJtAh-TN}Tz9FeE2eQ5=t
z4e8BxwKrc-k?1RQ$dn|K&sV8Q#I4<DE9(5ZLySjgY|7Q5L#AgpC_YqEb;vg5R3D-(
z{o88~VKY*G=*w#lVIx8Lp)adF#O$zIeyCD=XzAiZ#5DZ+Ltj>W2pjV14}DqjA#BF4
zKlCNVhoqHC{h^x|AL6Bp)E~NG@gZ!duKv*S#fPw!MfHc~79V0}ex6OTQ7>cg#M2Gu
z6iEK}e@{``qKz%*V0ieItE;@@cK2RmY}cqv6^wM0fUc7f>=0GfNa#qSY@A7Qk`r_s
z@*l)v#<Lr=-TM!ISYN;Y@OwJ9UvGrR)JAYbCD6mLLyz&y-oC%y2gWzT-OnkX|2NAm
zl$b&BoQ-ng!;ur*9^b!xgg?Ll{}TaiL00(zMhRow<mulX!ASt8`xyqsDNxH*Hs}>Y
zcJp3Nr{l->?p<A7Z2)V&+_=mq1x`V_KHErp8^4V2{cX4oSMI$&y_XHA8<*1|Su!##
zFZej2YsvqU(6ePPuRgC@EMq{G&0AcN>U`AC&XaCe<g4zZ2i;c&kv#bM76ApSJOeC$
z`tA^PGjW!q@M83|K(O(FOBkIuBh|=n6D1>bxe)pcw~JrbS=_<a<@T<m_OZhc?>-lq
zi5k*kE%Jnwm<X63jvd>e?XDwiMf$66efK_q0ZI&wRi1GqH6E$Z8s;!1J{1D>yxVLg
z+y4XmZ|nU!<$GaZ9P}{Ku$kE|g&}be2E1a~cia!(QP=c+)ASN8Lz|N<9e52(I<IXN
z@7TIgtIZ`_-CnxY#tm9seg+yhm;t+F|BhvD&cE3Q%%`INODUYMSpayx{=fC;`$zXf
z{r}<p```5czsKiZO|{+a&2QCqzg63nroL6%{Z?)FTeaP9)pl=KZP)$=|4;xcm*7pF
z)qavaso^1FNIB<Tyj=o9_iQ>fY;l6fLiAJiSW&%7G;KB1=}uwSk{~BHag;on)Z}Sp
z?N`kWblf9wFQ!kX$bARbSSy2}xN<=N(fXRi>1^FruQDs$SX;@}R63>Lt>@eio)D=e
z;zl8u{A;JIDMfy*@0??NKyoM917>h|+I@a-wD(6?PA7#HZaNzm;|-Z+$_X|X5w|nA
z{*>NAcX*L~uQ*hnW`fE`nt>U9ssg1OLq$_~T2zMEKf*D(S=l_ve1~`Ci^`cYoj4UA
zO*8}2#b_OUr2%1Jo{%ZX*Ehxf{5lGi2;4|DToVUOc?nX@)UCo`Dv5HXg`5Fji!tHA
z;ypPjj9!skiNvLfYZgWAO5p^047j4UT||ZBuna0iXX%YM-QJ`a@q#WOHz(}H{)hmw
zbm<;Pni_&M(dVCXXqu+Sp+pVm=A;jvO1#fh^MMH*3AnUUBeYs(K1JP*(EZ85?w{He
zovMME+5jOW3)~It$YC+cNx)dp;OpHJVD;Q$wLwK*TF{8>Mrx(n$n%3YM{gE2@di$>
zx6kYP@n&{*?__pnCeUe&iWsls?#7ZVq&KtK&6YE9mZ=$Tc)sPJxM&<4bm5SD4uV2!
zWp7Zhd(E!einCEMJaXCnJC}b2LB)G~raabkA?3$+2*?04rrnxQ!qu%YX^pc?q_UGH
zF0snOa2_ZuN|IEN4lO^+sn*R#s6AJ5*l93)%dzyxV|WHAt`~tLsAqhiouDPl<(R)=
zd0PMUb57E$OmLs5c<&_bV~{%{T*EYNZT~>%0-T??Mv19~z#}1Eicyx{!F|{0RLw6?
z@Xl?fI=<)qUA-=xqqF~Bo;28m{et*VZ;+*<*;un-j!kzS8w41vgkd=`XErlT7UgQw
zH6?sW&1qT4tcjcHZjkg~g3Pa!J0`P5N=vC_f2bDll|YeR6u7NGXE3U4+dx8Lswj_?
z8Y<mfCT&Eshg8xq5Lq}{DtGGF`lU#C(4(2IJ(4MvF*l{GtlJc;)UpeldE4-+c`9!_
z#rlQ^An$EGk`2WxR|=<3?wTLWT5hPk^^yQX&F`#BnjvGD7j<Bgm3XEh5R#=fvL(Zq
zXXj4h#|ZUo863uN87pk>GMyxAaC6J1keWADBiMu*o+X#lVl;d7pdr7={uyS&-uSwK
z&E3&fFwwI(H#b)9y!%7zPEYUZHJwOA^BV>YK4{`Ia4gX?TidP8)`KQxll&J76=Tdr
z5d6ja+ql)HAP~qQ_Su<K20G#i5wfhzP7?z~%VHpDq33xv=<`WNb8m=3k4t29Ytv#p
zofxfOrcSWt<(3}YVHc&J-DFX?eY+;qn68V=Cf|b3$<*;fI;YY_kRztWB`%&^_Ew}P
zO~A5fBRy$@r*T)do6R@Ujn_}^S$?6AQo?^60=*&&gJ4x%Is$Hlsj{Em=n$kpz)IT!
zHE4Lb#c&+CeNOQ>l7<K8+q9DpjfhxW$O@3tFdktUO6xwJ6CEeP-r+nb_aV8@TVj~z
zcOk!!tf>l3;;QPF>N%Tal72d!Tz5v8vtbWTn#Hc%-zDp_OBe99NeBT96JU==BOLtt
zOgUNSuzPycrIMnNlxdkSlS#?RymZ2F8k{gp&T5mg?sNq9^K)|IP8nSc`by`AXfg_j
z0q@~;!bGpdD;1OGoB=fbRkQa#Oa2xc?mup6VOe>WZ@#8xr=Et8fT9TH;fd%XPwD|D
z?=!fLsZ&n}8>ncc;n{3d2wKW{hi#a24P)o5{W&8KLDjsK3QG{lgm$Lv8c!y<`RxSJ
zVj6cQd28<5?EP8xfo@;<pB3Ig25gv-!{8n)Rg3p{vD6_MS%K3KvV;5(9u1Rx1Eb~4
zp?b%aShe0BPWsL>wpTEQ4Hdi-pgtp~I)zluX9(ZugYqo1C+Nm{BMMbda8!}yXj#U{
z|DdPY#W0yW{f@wnD_V?c_H`RzxeH5`oFqZ~3b;-|siRz{ojftQ9OtWY|Eje}<d{<I
z959-9%f-&%z^hm!q$a20L*5ctBz)e<ZEYo&f(6WJ>yuK-JsQK6S8-gWk5$afT;<J)
znVne2SKf`vvYP;0fwL78Oy#uH%BF^$ll+1T%*Q;tqIy4Tni^duyKg$I#xa=L$f(Ip
z2YAoaf^#QT&^}G>CcXrOH6fr#POr6-a84z!n`1RuGeT>au<X=nfgU+I$>PdB=bsJt
ziD&uxDHM``yiYB}Qjn#8cc^hc#A3ynbrNTi^FaY?f-WB}OE|$AP%Dv?WukCaN%y+#
z<72xu@HGhCZ7bm>4SF|BG@6Sx%r*%Pc}wI|>tL1`%gDf|e(`XeBwHH5Qy)#yOD~4b
zd0mjq=as4*WX=nM$}RNU-SGJMEE2Sl0UW9^uQ>W6@*L0qTk-#wm+975i~Q%$g82Wf
zt<494|Np_GM-RXG|NkBzjY&IswY%lSqRF2TUroXUQvIERziz>Um=_4tcI)|dax#T;
z1H^H}C@t~(|C9BHSJ~MH#S6g3{|>E{gS?mQ7l?jEVRBe<7rVq5WkUHVp4{JNwApF)
z?&13<{?An4z+gI5WL=Qt-#vN&S3mR6_D=r{n}Z}j{F?$0@hodp-qRvj{Aq2Iu>VXm
z9bnB3ZGTNMXWTou+C%l8=v&qZRi<SJIiM73)7T3<@dK^ApI>ApOvEO1Jk}EoLd3~E
zZtr(ax~J`vQ##ymQBUDPO5MU_t(GYHYnY40hZY?2Si~5GO$np=7ESdp|Eci*@$9Ue
zoqf&luLb=7!RDjwkpDltfB(@p{{Q#*+#|_58UnVp{VfFSTL{><5U_6{VBbQ(zJ-8&
zSqPXDUUCA0MQ@T*#i)`IRIQ2p$?t+j_=aQ|HDF@UQJ#@m==XsoJmL5-mZ0E#DNC%z
zhJbyDWW6Fktf*^<yS2fVFDdo4IxH_%IYpW|q8I>?2g1=~FiW|-%v592$P6y++tOVc
z$iy`osb&(lpO%6WolgzKuoj{*Z8AGd2WB7*PWoZAOf;qJQYsJ*u4$93<;+ks$XcUG
zcDVC&m=CT!{}x^6C3?-TsM^u6-uNgR=%3L0!0(0C5zrd8-K<z(EC$B#Y&Q6C*`K_-
zuTUT!5WVe7d3lhH;JN!vA7{d8ihGI;2KPLNpAdV5d+d0?sMEn+_?y~)7m&@khHj+#
z(79w9nnFDUKWU#K5cO;TN8p45TjDd{<oqrUun?mucjTNP^0;D_?C?@7!C22~#G)45
zVq!83A;uT`O**YzZ)o#(TKWe|F8zbrr5`U`d+7Z#M6rk#XmXhvN{4AOZjA`OAu+_K
zT6peR*00@K|KR;pY7dv)Q4#2u`tzk(JF&CTvQtZkGIv4!7|1*y^DbdfS1e~|ph0D(
zk&7Z9AEsr=xT|KY23Zz?FQ=wz@2E&*tR;Io?E@&hK9(A3<rG=AFlo2rbyV=yHuO(R
z2hLy}N?;^Q?q8+ZD0xIXa5x(bObp#uA|T~{zj22GGn}_c<t_i<#ThTLOSPxJ%Ou}y
zx4x05e#>qhFST9G5%?8%EA)Q;hW#g@iTWL@9jx22KB@d(JN9b|_^vjA@WTU;uLr-M
zA`z`rVUC8oN_M4<K1HjBAsHaYAhdt3?xn!lK}`yvDc*%$eY0O?8SP02ly2|bsy(wi
z+H4BbS1z!^ZQAsUEmc>X6p~r5M-kGkgwq^0Be@xh$?pwcq7L*OG8bcCCXz#a;fd&#
zo)P~%+S1lE7|^YgkdvY*?(R(s{i#uj(zegFlJy<Cytc51SFVNY-9%PJ4?vDaK^Cyz
z**ir?wx15eU2=+;fiOQg&d!A#yi+vnv{^WJ2+(O`Q<Ryg_MIlss|_f|ftpbSVMG0B
zktqDw$;VDeVW9wXQ73KwD}|Yq!NUutCyLu>J0<09DrF{Z!8z<UbnXxXsnT4@urv{N
z4xl)~Rk{lyb6YR#2eT<#n~6YorgO;Hy~%M$UvGC}&_%d2z0lm~7InI|Xp^#Qk`X<Z
z-LL>}K#;%oC!G9bZ7`a@cinJOp?wp8wA==ck`gwp?TJ}iYQ$(%woVt>$jK1oQCs-A
z!m2<YP4JxUN4b%_nG}SlpHC6yGhi$ha=mU>-hi#lkH2-8hi(>Ho3F|_YH;Go=GD&(
zs%RMEIB(w$M#5=MvUJkBB%Ik`!!CL=G*NvsHVM;@glHNZi~=s`9<{=&B)rsTKbQf8
z5$qaxP7WRrXp3G>Rf=hnx%?RePMeh3tF-h<i(~jOSEy7Wg7OfxhPs*!rK$}VPd}Rl
z<sH?Tm2k!y*IGj>A%*{mn@tz8QZCdj4!P{oe_oPzawSLR8uPT};1&I>ZYOgzIR#-3
zKpIKUGcLSF#h37^U%SWW#dT7Wh*Qh+;hTy`<^^#PNi?a2I>>SyH_Bg?zMXwlktU7C
z5EBMsJg9QE);C!r4^=PM%0sFIeieCWUjKe4c_@74GV)NhcmH(qP+(aJCiGueBwDm7
ze|M26P6@a)DrL~LkiddygCyD*LFP)!S-Pya5j$V&H?4yVzL*i1<F(q}AlTq@1Q%zQ
z|3<-O&KCbBxcnZ1%kqN7oTd5gf<?u!7re!jEpEuIm`O<{jTNZo8<NCT>+q(y4XMI`
zb_WB|%gV4WiqCe)0)^wT1p>Sx*AW|2819bun#8EJer`$q1Y|6|5^L#+*M`IW%<r5L
z)i9ft5~KQgoW0OGxT>e^32v&sSEZcxCJp@VvpGtwF+s?*#m+^ihNl^AKMxPZpOCR)
zy?F0r5v-d(BqwBrCfJpTU&5zb!hhjKqpdnuJa)K(5Gg&nkVbW<)zGN1aL%PsY;i7?
z%2Bz1N~^~n{(_SYU!KGW+1zxTT_J;y94&VSx<*80?h(iNcY_)_^UiX7Vzj<PsY(uc
z)svPH4vaMCk=ExMt#y@SEm&>}<}WeHQlkgF#gWVE{g3<k`J&4~q&D%Sv|J=2&xDMk
zPNebHR<{p3o(k`1&qkWC?^=^}zkGpdf(3YYtyu=6|IRtVD?^A6BcMtA>QLbqP$E&9
zZXBNy-CJrxc?@sU74@Goi|Q4_@tIovs=$vFaYAvudY<XZIA?_6nDKMoU6|Y*x@GYf
z8Hfr5#=vQ35mWFN9wT;(hsTI}Z|G{MqY@p*ZH^72*%@S`MuRd*n({I#;a&r&?0m|8
ziO;$ZH5Wf6uaXJ6*{j@#nypQkI}CZtM;_bL`B1JaVy92!`1t}t$B#$svg`hY1mEx^
zTm96BHCa`9?jFETbRXd7^R4Q)xcTWOqJohm<*mQ7v()6``em7ar})da&rkM_JI~u@
z`@YjJ8yg$8td*6+=9RYk#qx#-Xv2Q{@Mi|5>Kwl0V!1KEu(t=NouC@-nqB3!WY^e|
z@QA@eda?EsY&I#pQn=ZtF=d8}P&bB?K*JO$TfCs~2d*$kh0^V?H=K6dCJ!lHfV-l;
z1RDlAMUxT%*b&$n0{eho&(*Rq@!Gb7u=`iVq)#YPu-<3+AfH}4chnT)r82yB5%Ut^
zqNr%FpmSiE_rsqPGc8rHu}C#ssz|o58d;rh*eyrK%|;+d*t%_G-a|WvcTq~Tr04`u
z%&nm(okl6mD^56HHEY$@DHH-Xe=j#l(Kp7X%D&i+pgv+lWX~9~gFmxx?8NHf`A)xh
zJAC|Yi~kdE@i+e*d)%r@H{auLyiFb@Mu!@Ik6mt6+rP^$k4@I^waec=Kj@siN}dYK
z+)18___X6pDQS{(cekrHM)gm>v?qPtb}P-+z&tv}SGw?KQjF7!bec)?bKCWz-C#X>
zN)g%$Oc_k_o8zN5yDxW7+uh^#8`ZcYad2jgO=tGV(<+R@1q6jjnH0F!{qRGcn`H@e
zn;0P|89k6Pd&99aT9)`%F0;XS#p8&a+s+B)c=g?TSdzcqTEUdG!}h^R^6shZoSpY8
zty?SjjAIrOWZeOQ*XAFsfz#@MX<}MH9s4{5-t{<HU0ZE#V1tKmU%%Ns4Vt#rCO5d0
zLa&W=N*=};eP`(rw|AtUl?Km{_|7G#vEtz=Tfnz5p8^J;t;M2>OFJMZLYxMMii}kg
zo>X}5E0}C#xj5-QlTcN$b`|wKD@_-z*QbPEe@&df?^p0*Ejh+k+C3yd3&gP_M2!1}
zX7UG8){@7G-AU9zU+IY(h-;Mp#Rg*inb2y6u<1wE@`NASHfwY$!!?J&>Q8XHF2O#Q
z0-I!gil_bUMuQ&ycfQ2{=hE6Q@Bx{zs;vO092PM!8Bh|AH32N4`OC+c@_eP9^m(t1
zs_GpE^+T^C$}+9RQi}3CO_(ML%{sg?l*Y#4&bodrdeIGc3~YZOFWN6=TkH@K$99Br
z6%n7iTU38p|2p(`M|h6wWH~+8ZL_}JTyqP$n<IZaa^wf=Al68=Yi2+WZ2hRSZn|Pq
z)Fh~@8Om4Tea?wCfGzL14F^rw`<u>VpKrP*K*9c+Je#*Ba7@I6SEqx<c~xUltP{qx
zDL9Gca6Y*nP18>z7aLLP^WPOurGo#F_Hp*VDgxA^`p@4#{Qg`0=YP=W9;WK@iYM!!
zt5VIiyvN{k*RT^u2#rddp<=>|B8NQsh8*$@IpiC1$T#GWZ^$9vkVBS64$;E6yZZ;7
zlhf|2Zr3S`>->0&La+M3nGVpsO?=2Ge<{P*CdCL&E`-h#2*DYgCR`@nSQ5CBL4Y)9
z9PKQ$g}<(iC)vj*@k=An-uM#hhT<mwY;JiHeH%IO!ypvf7RvoxI0RUTwuaBdTdTBm
znWg<O3<A!ff!ou@T7NcfHuw*VwoiXI*06X>^&<AGu}1o$bFn2Ye#kW1B&emEnK5vE
z*B1i)?RW<Ts5tFS3i9VG5%?NG1OBtVgBqH5!;5@UPVIFZy??_&>R!j0@UOpt1*U+;
z5#BR`dvMA9dr(jJ@4@v7?lFF2a}yCn^Okqp3Fx4+@#_qZl73^*8fwR2LC_E~Y&OH&
zF-Wp{KQ2<u1Fvz7s!!0;=_B4VFTFlFJ!*!xxqWeaQn}IVgV%#5TP!EVv_NvE6}KTV
z62mT~dx^H#`A=$n!`|p#Z4bxOYyX=4L&D2n0bw||wA?)#yPv|*m${#-91wN5x7*EE
z4Eo&>u`j0yLDxKoeeI4!gKOh0VJq@(Vj^oY*~Z%8KIZWec}gORG&aIEln4C?%_x;S
z?VEsd<h=z*la&|Q2;}NyGSl$y@4%t($sa%028W;h9-4qBccOG&s<&1awD$G_QDE`*
z(;}dn>TP(#X%V#T-u9nGKGI7qv9=UV=7syZJZvz|Wwt#gxO>n&IR#;>`>MUWpKMlt
zKi%ydBwJeL8Vwun;fYOE^uLP!|Cf9`Ovisu{LhE?x3|CHfBu6$7&gOTV(UBl?R7d1
z#HXYfWBrrAh>sR4dPv;?%6S`P_5?>zg5Y7Gr!lt6W@d7*u>L1M5Zb;zPu`qSa)d|c
zpeR1fDt+l^B2_>;pwLk*u3<JTCf8I7@f`Fpg#yvq2&^N%qErn8!~$WkWQ{Ip8%Kx9
z23Yk<OQ3-=3AZ3V8#ZU1Jedr*MVM)z5n}N$%-VBOLJERPOD?FilX;Z-snbQ}L8+jb
z_LvJn39Q!WTIxaCF=T9pAc>Z84993L!8!;Op=i5~jX_7xvn#0))iN+BDbE|0aRZJ>
zDmy5vq&ZW&JfYg7uNSISXEq|h*>5$+znP7`nT@`gjlP+UzL|}dFdKpF@|upRWRPA<
zF_$!90k&o0F5r)3<-90Xl4m=~%2_&DX(bq=GLT=cipikAqMZ5ZUxtHhwDT1ILr>AS
zr>NNO(8GL%pLefuGkz<0&~9-()BzbUBnGg+a*a-83kg(&_zAy>0FKT4q#$Mdn>GTi
zUXX4~nJHKsEy?~5i#h{i+J5*z*e~gpBwBIKF&*p5fTh7vmi0@Kqo$J-1BqCs0KKA5
z^>HYfl3uI4=&6p(Uec~xwk`m*4Xm&T-D6dG!#>W>@wuqAE~(%(V#p4(HWT5^!jBK7
z5Gnmit#sstXz}3*<|i5mcQCSsC$4JCug5;0Wz(w+CUp~M0vp<XcpqVKS4;Emb!WY(
z@;f6tz{KJ!u{-B*OiPdSMKsS+S%_z$Od5*AQfMEkh#kD7xdHr7hIkGwKNMiPzLd|x
zHdD@%!weXiT@)+LA`sE(Dp;A6OhK~|wZ%OoyMhB6+_F_!u^~F7TmgrQX<^q&HvyOA
zT3E~tDlu$8fI-QmO(JAgW(0~Ln+$1fKvc@xPa#9}uFHJIA`o*VD)$J6K+}b&dhF!4
z<+`{o*=T^pQ<D^{nDaXb{31iSnd|GCdVyGdm%4tB8yKhggsX7^^-Rm^gi6`8Di!f8
zw@gGVG{Tdc(i>+~+QmTwut<T!f-KW15f2LEIz$r4&2E$l!p2~G0}=If?uY3I4DOZs
zZ&bXE6cYTR2rRC?GenZ3(A?hC>IY_htpqo{Dy$|#dJDErCE^Fy$`e=q`_tw&{Qo{I
zBmM*b--IQGe;yJa#4q?8vB3ZSbbhXE&=z#lIiqshNEk|DC`?bX^ZXN9iJ6(Kh#Ip(
z!Yy$b)&psNrZ^Qx4LJ3<Zrx#Z6X<|=Q@S&ZZ(ajtxE4IYTV+Jp4ZcbhaAZ<=F<5yb
z47{MNFclpQ{{(q-0=nOIh>HHSoc8l#<8sIQ3Ad#8+sa>twDgFcZhz!b+tB<+LRDAG
z&wq8^yxx7&ecpMAm7IY^g;&}j3IKnRa+{vuP4|^@M1In`gK}ufb|9@06>dqmwIVu(
zu&}m|bkq`DAfab$&rU8JETG51D|wcQqcbOWja$;;KkXj8ZFgVq{<-_&xZO@3M0!r%
z0f_<+mp)ubK3kllia3l6QW-W6y*qG5A*VLpsYlh*V7BD|(X)wS*Cn}`)f9O!HcEKD
z`~2tA_DQ2l7IFF~cmc*fZY7TsDW7VX5%juwcZ*HuY$8WsQQ#^Wn!c4-@ufk%X1;Qm
zU3mpf!<&Z5vqVU+v8{1ke;K~pd`~fuXjEiJjD|_UwJp46DbC9e{>xA!lR1r2PBlLA
zWydq#8KIM}j#sf^tiA<$kvnJ^8Mh+7prG^P%AoK$j>lXZyMRORQ)RlP!{nyI8>Qg%
z9gGJY-`#4(7NTixon#;HZ|CP{89m_VNVDhb)|^qj%%*Lg6CN1_nAMF=T5YV2qcrn4
zd8kv~4#_`R9jua`NhLh7mMG3Ri8*6rq!ermzyBiE2i#)Hh0`G=ikn?F0iiRWc>AoJ
z^)UHcg{Qd-$$hI?$W~<u-Ej1A4Gt8}N@a&t0y&-hh&od6<08jQ{Dv@sH#%@LQ4l0~
z+<S%JkWd;D8Bv>18uq+dxziFF++Rtm<{sU3TBv4ME7mf4V<hLs1kz)LTWN;l>H{o7
z24TtRnA5XBS&kwjF%hwtK_%8%0RgdjWGr()aC}=SZ$r=|(oTvgE{Qy2%2ZhCQhEWD
z$D(qmIa!#xsT9AUG=42J?bf>xaoY-8%)KZ11=Z3Op+V)ZNdclVB}Nq!o`^gvqeSlV
z+XIqaj?=4<#{V*Gg-_7rdxZZ1$-)0=jc2Hae~*cM10g|c9x$!HpIQSOxXzL2@Z@cm
ziF>u7y?3B!;Kci)7EbPDbPRmR$7b1`Fj|Z$j<D~sL!1L<(-Gdl7(@ZG5WYYH<uSJR
zgK`A?V}O6)%u%WeZm!`NHVeL?g;P9ehC3X_aD+i4vVROXIEbv1q+eu|rPfO)6?8)t
zC16c}V0>-ZIf>nesIDs$`J7aAT)c4*=N@A&&aMw{kA%gK5i<nm;qKsxyMQOUZY&Cc
zR&fP_{S8-;8eeApBwhjeV(|3f?$%u*FYMIaEpn`A*Q{PB-LhF{;dIIt!2k#Ev~G;o
z|1t#O$vd1sM2}|jH1lAN<(vzTs+#@zF}68r(<yFD!qj;e@4S28=9>}8?mP<*BdYfM
zz~1(8@og%1s2t!VDKVwWSuS=0R*;iMAeJG}`1PPjK~|i5k^^)5V|INbk!(ISspwcs
zOVG6&jLlfWssj{r6ASxDV1lf({KzTJ=PQogyBEhGR71mAyuau+1O|GC-`>MWws^9f
zdF57l_TU^wk(*BW(wKR~glG;;SK0C=nSGgJ3lrNR7pkWQSXyZCKhKEB?z(0rW;b_@
zifHUV<v3;YQaZYBE)XPP5h!=-%ND^S-hcpMOT`x&4wI(KHuBK`wY#VQaGaG9Vct9a
z0}+>XFp)|cc&C-)K-+>p)|b<`PC#P9Ifq4&NFxKlYh*LBgy9j#1=0m7Hv5Dr0V1fa
zvT1A87s}Se;AJJVEm!Ef;-X~QAlXx<Emn=M@{+83oAqicbp2}xOne*Gg|9Mcj*F6E
zM5%<V_|WI`bLe|ydm^dQ9iR%i;!AL1P@g{9HT2pbt-Y0eq<@3!LcziT<ZbX4ew{rL
zbO^d6CRuT8x@5&rm`0p7>eL+?p_B3))vSP$V2fB8{;@H@IsyU{txNH^Uex|w?yn~*
zkd#VS*B$+dexPgiF<;c|jF5!O&?V9^aSdny#wfg|mp}(YV;e?A)uW#^rLZDm$<SGK
zNjjw%b+b`1ySNlCr7|GeU}&5D!F@GaX^P=^Cd!2?C_WCmSY5|0UuyD*%x8P!KtR^p
zp9-}^MBWo&)R|B?3$8GUw10Di4)nZKR=*0x;C!mZb|$p;eX33e8^ge<Vz4cvMx>K|
z$tqf2f$k*ZJeuVbRo~>*<D$$>*1G$Q^c)Vnb>w^Qr8yM2F0)gmOouvk+lSMJ*2ueC
zYFQ3#kL*mtarcoP$?Q#X2r0|{aI;Z=y*OVNQpV>u$Y%bST3%B{bWQe!IEgBA02&Uy
z4^AZ>PAeJTHLQup+u*_I&v&;%!-BW-g6Z+^jI$y9sD0s<Ow><UBk9V3jLdS5i8_N*
z?SokF<+Kpr49f|<R8UaXa3&=vVnbYh6FP9F1?c2xYqG*ZKx^89r;CaE#Vi!76~&10
zX3NV-KKkHV60{N0hu}mrdq9_&VyKu4*tj!Y9=69m(+OJ-xi(+7g1m3~4j3@Swuk%a
zDK)VZ8BmLTmAo76@~yd(!9(!dAg@w3@kp#@i~UxrV~SgUmN+Nhf^AzpLENJmKOc3{
zH)|NWxxsm>rP%*OvnNuVp-hkfMJEOdxng%-zZhj^hWLaqth`PM9@Bwq&BbKzGY4_=
ziGBEkArfesgw7=zcchE8@!h*HK3AYH??XYzxwRrNI{4QXu7cdYC<gWkGP&=`fpo9h
z@71A_ljtW>;btHeS~;R+gvOkqUFlbvX?az>e7K(teuI2Sf}gx&p5!Nl8yCxNEL*u-
z`Ua=D*=VsHCMJ!V9k%cQZ2Hm_XrwXe>IRb3`nuC11D?t(>wH_OCTfq5-LIQDPPBU|
zS#-|}a*vbuofMo2$!NyA{V~_rAWC>>){>T_6I7@xaKE6HRl9KNY0Ea4L;91M-l&IA
z=2tt%n%2mPY3b>m{3l4;6b-4)?!YQ9&4IG-wuFgE)DRqBXb-oeHwwLW6*r&vB5J4o
zDaEjCjROc~BzLHbW^8!f<-d^z*A(Hz-bVADx9;E;xx;&e)zUk}lYHcpHD>d0Bu~#9
zE8l523o;QH%72Xid$iJ$-7E=bHBSipHqWr?r^!3;)aP4soTZ<ZQ9~nqW-Y3SYQm3y
zt7|c|`|Fu+jTfqOD$TJK++`}*4>}j0I6t{u#<Ms9ML+Q$z5A@{K3j9nr_XAhxEr;e
zm<Gv8$uU<>=XfEW$;PoiFWEt{6~(&vaX}Yd(~W5~Vl5$u7~4Ye5P~}<c_!zf?l_8S
z%4`@-V9au()5Q11ryA|$(4MyC8bme?l)3Q<e?1e(V#=$rIuJPGqO*>6ty7&x=62H&
zYvx$n=8%BBMTiHPTnzyr`}3A|D=-mz_9?P(mEQcj&d6Xb+I069FGqNEESgH?gb^FJ
z6XwJoNOi{Q>E<yrI|7){`Xen8FX5DHs5$TL)>hTgICLr}d#&swM~Ao7<=`0m2gjI;
zk@){{4~+psL%H(IakkFZXc1&!G#oc42An{!8N^}%H1@^Ffu0yLkkAf)ktXRCd!{jy
zf=(eXG+7<gR~ea2O3G#+Ma@&t3arLjen=V|+BmtsQvH_$oSGb_q2V0#Vj*8Ly$10b
z!m;+?jGv^SwocOtXIr^ZZp!D_<_>-8Dgiwo6lcp55qsdoW?dzBTENZL9r0y*+g2at
zSq0vm_tiB|3I+`KS_k8&Z*8#H0jv1G{VW^*FHY5Fi}3)Wk7J5B=_|;*={5aW8^ESv
zsY+Zc70Yz<fhvf`9n}c!e$#$;^qn#0Arp-MNR}?V66aIn#g5*dc8^|kk9QAWwo!p-
zB>!zF7XN-qM;$})`B!%M3Q^&Dvek_2b9jF%$!rmX-euPN;8CVVf?|k7-<>feNk=;I
zs)*1lpSp#p?Qx*5qKKqa<Dx0SNNPl38d^TW6fmz**oD|GIzId`g}RpzG#E{1c*mA{
z)ZEDks?<cID(Ha0-W#7ZKPBB<97l0)%}ykTR#G;SFeh?O(niJ<MHd{=Fv4h<n5!$o
z8*Hqwjn|PkXe7fV!*Gq+RD*butbY+i(S)qgC&asD0O%J?{^G%YL1;ng&%OF`xosjk
zr%?_k@Sos2F(`MzbbYmXy4ftTjPw6}YVgMS^$3BRMM7}e%qa8|<bpWuSYLBP;{Kg%
z6z1*ZkO>LvZss>=ZG=vf&QruFLh0lmLwfkv=NQj-S{4HznGiiT?A8jZa`m7wzFD(i
z%u(AbCWv(qaQ97@u}g^cojZxSLXFjOd&}DYeMV41?qr}O@$dOL{(Rit@0@f&XE;^Y
zJ)twGEIOVn89pGdRb#_nv9Vd1d^h{N(n4}`OFuO{EN`*|M)dn2W>g!_M*Yt#fv@Ha
zcG8ChL8tyODn(Ql?=-I$s4&sk1{GJ?k}+R8^Z~BrCa&x`+1Wv?AGEew<+KmPt{CCt
zj4&}*_?B?^!rFh^h<L;P_Awd$^81bSZdPqPi^UA;;NFGp;D<>uTVHRQ`!-_t>BaZq
z#W0@mv$q5Od$ht4F)F#fJ;Yqp#wU<jDcu0RInwcIR!$oPdo#J{wPddmbnAP8!|C;A
zlUQ7a3eU3s@)~SL`fGpr82qA5nxqCt!Mtije#Rga5Yv60u+~ggP?A|`J!mD>OPK1`
zy6+ZBTc$xc1-Q-czh0Z^MTSo;*Pdm7q>3;75>A9|J&e7E^1*Jev>x5G=hDAOlayI_
z<C&;$4|=yXZytX88@9IZKX`}}^cCJR%C2hO^6Aq`Yx}0tGAe)z)~wwMXy?oK7`<`x
zdc26zEEhp5K{6XB9A5<I&ST~*cvqb{>1=lX?%~$96HHu<|8k4g#UjC+I2%OF&N<mB
z2R#;AhA)Vgjql0P6ttSII>%3Ss^P{KJQkS`3@b*)5fsxU8ORuYofZNINnA)slBX1|
z470@<tX|$O3SYi6<Z<%d##)KakP7z~=ZNnj3D|zHVsEkup@gIYF(%oXORU?%bqQRF
z-VD|5!6l~*?*2Q>l|NOTz#FLUzh&mC;%)OxrZFq@-0A&bI$y1a`-L96=rn)Ve~c4|
zNDK1Sb=;}@uC?@J{sr}`iW6rOMGr<j`@5p2|LcD$_;15(h^4c?CIH-g{I~nt_qQK~
z_-_xlzTv<BT|W2bz;S&;asLL#^$m{e8ywd+IIeGST#Mnje4vxjG(<Y-5Aw6hZ%Y88
zJOvRwn*_}b@*#rvc)w+n$tY-!oQXwnUwK{L%ZuK0z(1c06iUC*?Uply6nA@5jO8^f
zTv|jH;7aHD1*5T`a`N`z=<p>*Z=+@J!S;_2eth)(_Ky$W9#}l=*X`G6dG6lde%?8S
z76+B*wtjf<;L-OF9&CPp|NG4!K?-`b^$^ADN)wMBNE2lS|3w>OvSM3e<0e}0%NZQl
z6Lf2@=n&Kt9`r`dcGSqxVf(+@$4ANLr&K;~4}x3pI@|`gJd_XK!W~-B)(zV9+UD+y
z-Cl6-uQ2-MFTl#nCmOB*oc{tOkFrZzNY*D$%^Uts`VpO|We*gI(fSqoSM-VGEcF5(
zOiSmp0s9hP6<3VO%I(0>BhlgrnI@qDmDU&mS_JE^X_Nvm8mzEQ^XWiB0LDP?L6KTt
zjr_EA_U;w^cl$p<ZNzIB1v{IR2wqzZG0ks~L90AOH&Xot_K^-}kl0Fd#S{tK<RW2L
z<;GRn?G=Ny27jFtSL@qNDH>KWAL|cq2q+x%xoj-1d=yk>BSMlWF@hx>B*T0(L+u)?
z*}i;^XS_hoS{+#1+Z|wuTk<JgPN(C?_wHR?U2Vub{_to6B+h#z!^l;Tev0v|+~}qE
z^oUn=CY#&~TX*O2k1~(^iO;5{B4MWIhN*CC!cEKM-FN->q}<A4(n4C|<DWO|gFcly
zNqa8UVGcV}V>7xc_hnS)=Yv^!*%0pnS>oeV2fN6_|M^X1Rr?m0@v-!qCN2ndA)+@G
zM)f}0QZQa?+Tpqp@Si3&vgXZ9^B%XQ`y(V`YHq#C3_KeCuD8<aHJ{Y22(?i=!5H|B
zBu=_U+VA7TgsX$W)JP<4$`2xF5s3>Q1Az|6+C;k$#oOYF;N#?Z20=N;w6DQ6<`+>8
z#s){2(}u!eC2aPb!e?ev5{diSH0zNdyL+<xhG3mRWJQEEBZ~7jqspS!uslN(ucV7-
zM-VIkqSeb9320qTeqFR?Q9;&<lZGC{`p~$Z^vt~wJ&9KJN#wC#S~mDpS(eFvd8VoC
z6_$lBt5h|lz@6Zo4orsUx1&JUUy?g;`kcduJ#^^4a|h~Kx#Cp+ON;ulw%uCYUG<`p
zm0rGdG}uE9FA9eg+TZZb$ojY+Yn5DETSH+01=HRAebhiuXasro==gE+-I(+*P<zYd
zyTL4K2*nTalr`8`xOx${V)iMYHbS_f&)#1VIHlitrS8%^*RGdqT)bsYPoipke#`(#
z0wFO@FDT1^0ySAGpg_+n0tuYLsi$y5(}Ga4R9b-NN)3|W^gB$$FtM8mEC@XTT~=Z|
zZ!ySyM#CJToPkO`0>}&V7^WWt-3z!^-=rrWosflll8(yrY;udTZ7(Q-kzakq5Qipz
zMEMPe0<KC*$^>gfH*wHndSGUvdO2cFV%E;!niEC@WeIvR>JP9Y%-JNR6wd*cKj!J7
z{7?d2gp-C+#t>gs*y5XGphaS^6vauv{m4)U7{7}7vOkeA0Q0^-6_fHZKcDhL9_*f8
zdh`H=uI`8vfci!9S0`$6Qf9EB{^yx|+1W|Z^HY2M>C<HU;hgL6{Py?Wb;Q%vt82+y
zP#PaS=<YSPAN}y~hwZIL55NEZ{-gW%fB1gu`zAj3S?uwf&ES+pNwbR!Q4GHhr$%aq
zo;}$7@zL^pdI|P^Z#(v2u20gx_weOUh&l4_C>Tl_7m%j#O238T{JfQ10jC)t&ecHQ
z0^@`UoyrV9vopN;slRo9>;C<I_G5b9KYRG-5zA$i?wKY$l?gs&#53C%ubKuLu`=3d
zu#4yp&e=l==5Sa!bdZ@jetDYk5aGMe&j(w00$>iS<!ys){B4UlQ{a@m;x@0K#avE^
zt7;YBD6RW^ca7e>M(+xijK=HV4L4)Z9ge~OeLMa;vFEFsu;+RfeRY>dx`s>6+<NtR
zHR2m$4t<b+$fDb%Ns^M3{b1Nzo8T%~w4%e2iJ4@j7GafQ%r{o{WvLC=T;t=`uOGL6
z<^OJMY*2V$b%Ro?3-_mg{o_`Bt?l5>ZIPnO>tS`5-}?XJE^j3t|FN6!BW@RL>`t<U
zNShzGlgF@ROYhRC;iYz8h8vT5&`f@<C6Gq!5qJU)sx4r6Vx0MVz3<B&yuba04?g&T
zMo1<i_mO`x<^{Vo&b(YjjDWi*i+RV_(!$~!*gIdB+jhK{<a>1wh1(;3hLM&7E!`%{
z{92j~sWZub`?S4x+TJI<23`RFZGcvjd?e+jxk$Ug>Cms+c6z?Px`R}E*W*VO{pUtB
zT0@_DqCT6W_e2P@OJL_Ac@AUbi8e6)M$gorZb{u4CMHn*O1AFO5y(Q-ncfpsojtOt
zvBs|K@eo&9Y`rrL$a{fjgu8Uu;_<r8Ke@q+(I6L_etu(MXmW8m#BNG>L?H^1W>gKa
z(!+Q_E>=AFH9gts5<v<~W|_5Jr$fn(W#dsQeIezNHdo1proB!lfk`9Dsk|(%j0Fv0
zaXTZRv9!;rbiwO3TY?yMi!pu_f&kvM`=&$MVM{ZxIZqnrQ4CnJ5?2|OYs1v)g0xx1
z89~1;{%2I^t!x}~a(Z<Q@IOnF@f?n;w>W9DF;XRUE@{x6z<jt-mrC&$FG*x+vfZ`T
zN4&lS`8w9VuSCH&@AWY&UMMbCdK{DDzv5P#yQhW0>FbDzJqX@<^U<CZgS@}QU|Dg{
zmv6R$(|UcYwR*DpFFFT%=*`I{X9ZcNZa5X5Ke6Sx3|p&v{~S}YfQ|2>?Y@*UEFK$b
zO2|@%d{<Z<x+y7LeVk{#OzWAL(l*d}gWxAmps5j^RA`6<5kw7oM<ZhGXM=2LEN<c$
zz!=yuTuXbGEk>6y$mzXH$pS`^M}gAyO=+)}F;f&|EH)C7$q?NSz029?Luvhcl4ef8
zP#E)rb7^boTxFEgPMBnA4~xCPy+dQ0oWgI2@t7ro)Xpp)jgIK$rXz&wZBDQ$F-9u(
zC~NUjAk0n_M?rB_s*{2ta;^~FixK7$Ovhu3X?f|)2+bSxd4Q(ZU^4hT;}TPxaf&s1
zV19&xlHPT1kohG+R2_W2yZ6VpZ@NDn9q*qcjjhe?2W#|SmDy?YH=Besz<g8Rio?=Y
z_S<{Ad#~Evlg@v&H8u{T#_)ih>SRu)TD`<6FEz<7kS?|RHC^`zkfugK3utztBlG&i
zBm1H09mHdf6okX*re|_o>0ugr7n|DmF<poJM8oJ6oT1Q4w$}7iQ4T;KHt(`#v>qF`
z;&RD22HE*km9jY!1M)6k+cL5_IcM#b!<slij}JbuBjOANqtp~A@Y{MyqTt&0oYq{g
z#)e6mW_vXDJ;-VYiPACT`%RE9lNxFz7redw_N`8^79wL%OK7YkS4GQlJ5W$&ui9g`
zF`kJTaYGDEpr$s$v{_yXwu^=8Bwf49*L+=WjL3zHOlf==*tb>0M2{i}ub$qxqeXw1
zj+<y~@_$JlQ{Vi2;$6;Q=J^<LH8iUj&=f{SKe~s*NWM$92|`83<uonuf&A*$xJ8H^
z_`>J(i`OQTNWF+lb0=c1``cUrm0sD}4AkkEgc!fmlK#%KC|8P^5$X>A*z+t4Y*k)d
z-wv>q8@2R#!EE`h^E8NnGI!os!jfsL5jDR}=NC=qB60QGwAM}Q=aBV`Tf%${>p5oG
z*W*3JJJ*9kO`JmwTy74Zo+GfE>^9$s!912_QN>=emKn=*huK9+Yr0W!64BFLU|THm
z$T46ZhzU8a5QGAY-n&LJ75*nG!eD-)RCJ@;n~robi~+u%iwU)yf}l5Pt-LjUd{Zdt
zyT8or`yVIYm4W5d8AmytaF#m-=(+%<o|Tjr!PALcO$+|fJ1GThSPgPpIENUhd)r3)
zzS`~l@ol%;G?PJ5!Hum}a@slCd-+r6@Z`T*$(^f`EUfDujDrcrgSq{|In7OE9{j#-
z&^D~=CH7qSjN`_rAr?DA8C($BIQkhwC`37-TlzMlBNAyTk()3F*Tsy~hH{GXKM4E%
zVs=KJ(;!m>rLt*J4BX^JZEnjb**`pbTpznxeQ?`6m`xrp7uIPTA!^zrviL`5RsHLH
zD*1ndVsJH^KK%RT|7|^bc>jKw|M%eG{crhye~(W*|8MJuZ>fLZQvbfC{(VdR`<D9m
zE%k3f>L1>*{uMu_jy>g3fZmZ~OfiG_BZoLRI`|33f)&Wq5my@0KhO<5!;0kv>~!Gr
zms(S9#zzjRa3D9r&#lC{p9&X^2Wc;pl7U#u$-Gt=A2Ew8?Ok%EC+o){1{RikU!n7F
z;+Jt};mZ5%De%xs%rGP`KSpN{xTN>Rq?nDd`5%&T{s|O_q_O?!0lpVFdpbabz-fvm
z&!!@m5U^f3Mkde0KEtwlFo9^G2E`RoeQ~k~b5%xepV3z2We5^Hx*)$i*G$KA0#9Y~
zuy1N10=BE7x=9D~2%SGup4;!)F;)22sb9Hs{%$7s`O8-FfWK@f5BbZZ<a<L5!SIsV
z^!x_{)@TN()#zZMc{I~YEgMS1a4U@i`ybDytFi1=N+TuJa&TqV<PA;COI#L$F2hC@
zx{TX$;{ix?c$RE_+Wuj4Gr3E5vz|f~!A7`_IOVfZj<-sNPi|5H-fqHk>u+DcC!v+l
zaCz~QvBn7mImGJ7n3ncIiY`(EX4H@M#;vWb%}?-2_#fwsF{1D&q}2PT_U8YOy+2)V
z<46*Q(fK>NiW2*k2v8u!MWStO{X!%paZHgMg0k#(``{@81+pvvg+>)bQDdFwT*SG;
z?@GSda;+=?q$n@bLbpYrD%Z%!$cV^TqTev$Bg}(r;XM~QY;Tp?acggI?Qf~JuD)F-
zd!?-xb+!VPx~1Bic5SL`s#$&8wIzCg_dJ6$dqSCyq&3_<LM=3(@sMsgW4hLwBF3Ce
z;_*40{CF!y_pFE~XUT{{^$@1KOtQ%tur9_=V|yJfT=0%{JOB<kmkYE3QHuOL9jj|J
zY^xh*%x}@X*_wsXIv)U~Wt3)Mle~{}WPg%DzX3eVIAM&J%g}B%m=2MHdk>o%#WuMX
zwx$j91Y&lnnLMM9%KtTuC*pmH3I{Ujf$!WX-|_xyijuX;Sw_}45)XWEvBQH~8C>j6
z;tK`y8YBED&jtzVHbn6vopqoC)NYg?LQ%D4IFC!0oa1aTpi0MFVT}rT-nmG7z-K;n
zdR^HxS83z8M?ib(R(KXYi2fd--LB|f`hzT1gX&PQ)u&O79@cAi%~fd-Z_V!eGkffh
z?mQvM;HlH_ia&QsGb^o%(WC~jO#dl9BIMu~&X^i*cMY<`G)8ea9!`Y?f1dcA!$a3Z
zPS^Rsbv}4?aGueJvcCZ>D%Sa+XUOxtXaBmtX=eMlTp!1IdA<6m49*HVGZEeO3CcG@
zgG<TYc9sEGaDma~BRI&=0m}ZY;BIhl#|(DRDeGR^(ZKsr?Gi9*Bczw-nv)HKPU1Or
zU;U1NN8crP{re@vScxtlS2ekL^G$BuV3P<HX@ss62?VQ?jRi_>QpwE)N^Vift#V1V
zRH6O=N$<g%%@rH10&V1!2xqc2tDJk$A=HqH%MNYi9~${(!)l^IV{2@b?m0d=A&j}Y
z&TYkvf^#yU8h#YDL2Th@8Ke+M@?@lMBHo<5_}1`5x%eH9*$X|h!|V?ndyedslpL`-
z6N$@|w&S$ORMs18ZIGQ&0Ui`HmYgm?C!tW|yFgX)gmdCT<GO27)NrmiqGzzjIqW0(
z^b<|H{~#*jfji3cY{19b1$;y40I&Hic|HS(^+l<Xk-IwZuEg=P`2ex-&*O>98Y5Q#
z{I#8HI`5$#YXsd2@%72GzL)8tX8i*Z{9aB`vz0+vh!S(<)n`0Ke1;|l^JuZEMWDh*
zP^n}dFIhLml!|ymk|S~!Bu*){Y8N<Z4lR%AzLo03Cx{{dP%^Nn4eVqED_p114k`QE
zsGpT+sA84F1axrmGAXDzwQ)W)F6(u!@f(n(jVDh+7p1{^nEuYG>097e*WC1K`bPZ~
zHScYdM!U6m&C+-uT%oQ%;)e^*b<3-{eT82Ay5D$pNgNWH=I5<n9(!~$h(RPsNgb~_
zv#Yu>W`(KY168)M6}&U%bNTjDZ=d1)UAQ?6UftLT-38-oljF}<Jt!Ggp8l)}o3QA=
zL_f=sxe7<-DsULy6DaqKwDBBcIP~M`K!wg{eFk|fZf~m=8?c8x7QO+JnR-T4UUTy-
z*s>JMmpVJ#YOOoKM72Q06#1ZgVq~EKINM_B#6E*A1BjQF6>s@Ub7Rv)Za9i3a%-54
zQOW_psO*9{E>b-5ato|J!!X{+QAKy}>g7C3ihbzp#UvXZp8lG2i^IurG9Fykx(%-J
z9z@Q@T@pKV@~oZC;rD*B0PEJ<bhUZKt~Q}7U#_`&uUl8_b<67&Cc99t<PuAfvhY}-
z1jd4_ocvdEUSQ784Da|QstB2Vo+q3mIQfutK~Pp|1j}cC7=K8I)1f6^YBZgYu84$Q
z7D>^$e=v1Ycym690oo(N))ed$zD>UaWLRHcH?QG`DdA%$HB?5~jp`cDFxX|N&Sq6V
zi07q#1o^9L1p47R)Q?)Lm!fqb<)zV3h`lbUD9x4$%8HIuPFuo9R$u;ptT`BFb;xtx
z;d+GEc`Src7h)<}Q%{Wj2hdYXWwHt!m{QG*2lNG18RK}2Pd2{W{&r1NGpH_&mgaZF
zNj!dN9k)^EUQryWyRP9-cn~6KfBle5PJz!G!amalp{`xA-dHL=6iWt3WO}0CDxv)a
zJoSO~7coL8-T(K}Zn1WLqkYV||NmxdbKSfDfAG!r*Zcq9<%2Qp(7)jX5g?EDoI4Mr
zs|;Mlq@z_aFghm(32uPHT8+?A_<k=L+?Q*W`~7s(yU&`{VwF`hs}lYk*aL|J0LRoT
zr!90rm=@V8=dnl1%9#(z=YR{LWi#q?NHo33$f5wt;w3L$6*utc7^Jzr{O3?KsNN*y
z>^Vrh7;=(C95UmxuKpd#W-?@;tgS_l>H?Wk;N<PEfs?;lPkgnW_-Z}z)q3Kq^~7R<
zlhG`ha@KV^yD;v~EA2q1A6O;?!(!vR@3y{K-G1Pj5riTl&kn?_yP-}FzmL}4C$KQl
z2B|*YjMzh8OYiD>6zJI~yCfZNJi%i$$J5br0i=cir6>W{59l_>u}6QX-@1i~Epgfs
z$rl;V7Ue)>odhW^Fq4V0X-E2Lw4MC=eLOHKARV)7y8XcN|CNWi{Sd91ft~4z&Icn4
z5h3%3vNB=~ka_etIPeop(kY&Zs>9j}GDa`tj<;UJtIEPmOQZ+>UBf54({a7Vzk!gx
z$K1w^Xm%}_|J+*H>92KjLrFbJl#98&ZIqsD+5_NGCk%&dQf@9dY##O8TK=$;4`Vnz
zn|R=Y=%sD_fyH{A3>#`i5mArvtgWk6!=-sF8a%eJK-+l3vs&q+C15MoLVXppw!~G^
zy$7WWiZ1xVT`|Hiy6%KoX1wIUcImD`g<Yh}3chnevmxq|wnzYrfE{8SvJh~EYJ~hc
z5CT=thjIQc^bWzJ0CQf1aoHLJq4i2Z5Hx6~R_d`X2LnGx+YL)MD4^(lc+9z91u*2V
z4IGjVk_|k)F3N5e)@}dBHb&t_4{<K@Se#9tty?W(SlyTiRPD(+)aoINn;`o`mmK7K
zLNVHS+Kda(NFMhSWiJFPv?10rXdJ??C_Gt479}xymBgsoLI(+SO+~W^L<DTI*#j{H
zzr29nMeRk5nlkW!HqS7GY9YLx#xL^GB%et_Dh`N-(#Rp!zethEFL+ENAb;Mts3Q!E
zi7isDCOW>1Q5)HA^d#_z)p{8H_M~A80iu<jwWct;<b&ChgqaN*)MFoQDVuGB>8H?5
zQE~x7+Ot6a;Im}Hmy;xKr8&wr9JIyO7wTZpb`^!pYU~zDGqJ&!ZCEfvhr=|_8av%W
zgj;z&?Y>Kj>bC5SdrD;|Nx$xrpMo;cgCv1LOi@$?;=)m5Eu!R~p|4Ildk1^Sxv?8P
zejZS>bF3+&*W?<$kcFnzDPi*@Nq&e2H9%=v&bkCMrTA05`sy=;(dsjon%imUE6Q+X
z1GE~q4yD$hT>X|ah;~xgV`xO^W7%<nw+6<8F4EROoDR^~!7uF(i91ozTPeTptmaH{
zJ7}vnjW*HYy-|?>^5UG_332;0Evp0ITA%|e@;I8&_!}YfS8RT|VDr0lx-QykZ+@GI
zTi+*_^Ki@MFT%Lxl&QomWI{^QvPS@Of-*BPOL(*pDqx1>r~aq{ctu^z!z*db6t04z
z@NqDW9OuCt8*ypUY|R_KV*H}NSHe<?_#?O5eq>k17vvyWqnF+YQJ*JJ#uc#pvbp0L
zEstICC9lqTf<goQD=X*~L5#GD2m$d5l{TJJ19n)cMqoENb*6zjW{WsQdv3w@AS+<4
z>VjA2Xl=WOr@%e+dxL*_)!>O=3t1k!7XEf??d8XcOEQ%Ww{@GGTAdn4$Vj=B2n`Gi
zcJH23;W)`bCY)Jgbyaa($auT_C}IM!Qyj@Cj({GW0>{HwiVY6!tsa`N-mouCwwq^9
zB@m+h(Su}N^BcTjt<}p>PC=5z5+JaV*j5Alb(7e*^;I}wos9;=ZXE65poCq*T}cL;
zHJ5>ISj_V-?5Lw+0(=27J;XDRa8r{u{II};52o<R<nl`8fju=PwMf=5A~ck>*&nWQ
z9A5-$*(?r)2~5e4zTCj!1li$08`jW{`FddP@KpKT1f$EF;$`XB8^@c`ARWDv3TPu+
zu0h|`nZ)Ij9yMY5v06P(>^jE@xlXH+?f|q*Fl)g4ok}J}_xuNnATgu70bNc+!Rc7D
z@GC-<)Ps5D+Q5@nl(nEqGKO0p`S<`poVH4(y=I|*4rxUvMOEie>P4JRLM5HlwrWP%
zP!7hxA_9+Z2j6D<_35avXM$}MF;HuE@xYYKIs(JA&&g-3At<#ER~@~wPd9HB*%F>&
zS(NJS0Pq5Jy#&8B7}JOzbBk;bo!wMJArQl7)FpJSQ=TF_2r7|k&U(3<=H<5r{gAes
zuJHM&^!{~<cW((^o#bxWVQzN?yqG=dc9QgJ2$^pIFe@0CUm!)lWpPRsWP~m)RFYd2
zt$g3mMO0(aN`GXYx*}gBVjY%ng}?Gz(g+u%RV#{A(C_1<|NIh8h~}tQ-9|R(jSD;@
zRj&weku}XVDjl&o9#F7%lgY^Fb<~$vNjz?or7qrPevb;*`9<?Z3Q2oEa2{$E|D4S?
zFs6(-(J-h5{y_UE<x@qLProp>#NF-`70xEexBNwof>M*?B>(99^uOAtWdHH6Y1(~<
zSDrT)0b-{8$JXZNgUwCP{$qRn!NafiAHT;3wvV;q(Q4FWP5NcTe2~8V{+N#OYhGda
zu<@V~y^f0_f+KU(9i*6YVF<tfFEH2`ckbW7$bkcEE^6bTq5kJFbhyrtzFIqcwRZSw
z?eNvw;VRY+rDV^@#L?9cMf-Ey@t4f$<U~^V$N}x#hbAYpRglju_aP9P0X$Lt4hEaz
zs^)Y(_}F)=5woPyQA^@y6;94@we{$?-vW=(VEOqW!n_=7Kn;ZBphdM_aymWZU#MLH
zxpSmm!FdW}rTa`Pq4UTv*6ouf>`<-0vL8n5*k&uQ4#!10Og}Qc9whHE^aG9rMZVS3
z7;jZEuqCb&uI@ob?%8sBlD8fl7vl`*-YMnx8}fDK#`ZgkS3vih044Idn<VIX24cxO
zc2)TmkEv{wNF;@{kf?JP8HV*$ZhX|!#x`jHNk)eOC4-*rsK-)~$mW?fqYlmJXN)QE
zKN!@u5q-Py-DU%t+xiw5maWZiw!dvez;|wKe`3MuwfHo!z3E6|EoS7c!r3&m*{Z@U
zB3cNEiOM8KhN}Zgc0s3OO6d#%E*a;3RlL-iHm-&L(+xJ==B5};d3hq>WKVp79RXmC
zlWO>7=<1iW5)^ksCZd<*G(9^*l_~~AW;o+LEDhn?cYMW+oeYO)-QJ7tYkwpH1vg_|
z5aKOlr`>$fI{B$X6qG>AFic0(wM^54C1MvahUg{9eAjSHaen2dR|gN@JLv2jzNVwD
z^ZX~+LD7S6o#v@o%8bd`byWwLjfAwxs%e;wrXmN(uA#VYU>{?eX(;%fOq-@TvjEtH
zH$F))Vn5=D2|0j?v`7HM0b>FU4mOI!WdNp&Jj1Bx%4x!(3>-o$`c^5-(OBX=rc1~<
z<S1E|Op+n;a_AQ8(g~#-AGuPtB0T0oxrSNmJUur*j6U~cT?pRH$J{iTRNIg6|Gh{5
zES4G|{J+@SZ*@BO4b3h1+diDRosJ!`q`JXQ=Z9vedHk|nQQ_(%q?nY~Xvt~tlgbyf
z?%Xy!&$4&Jc=C=m(gmi`=q135ivhijTK~O|*CU<hucKOR19POogXgb1&w(?k<GqjG
z6ROE*rBix_Dyip}2f%38jCio}uYpoUv8o0c@%rN{wFvvrZ_(YPD<gIXC1qE+8Mz6l
zYQl`*bSOHpHrZ@Z3P&IjXGorPan{1|C33DQpC;!hWscaK#@W4S#=$oQ$>(gHFSu!H
zcnkS4#p`6ckHi^89P#%m80s~Mno~A?Sl!s%dhl@jn{U6n8p3-Gnq|ED*n$m?IQ-J}
z+6pz8_4{ZjhAytxnsBMX{3HAJU;k646BIInZXYFvnc<%Cq{0g>#%BFo-CxxSukGEW
zzRGPT+wK03Z6+HkEzXSgdJ3yvlK|YNtO^CKAE2vtjK(9@lLFmjWFh_1oHJp)^qkqm
z@Ebn5gD)xN383_5>CLH7laAN2xQSb{|76S`^s$bY)P@A(V?%_Ay6O7ugiJbcguBVO
zIIo33+>q-kE~jITk;kme?wQlM9VEg6fL%n{L6b#_)6|n_y`sL3Ze0yy_0@q3oY(s{
zOlklWdWJv&n1tbi$=7Fq1J}+51+C>X-Io(wgO^#oDovf<KZ#Z!1}d#SteCXC$3G@6
zxjp_v@`2CiOo6}kaP3v^)j(+QtRI((Rp3xV8rH#Of|P;@1bHB<b8rmo#W2B8GL=-~
zAi1cylkgEVRLkD#LT3WgDS@sb-RLf6>_$ia^*9W#Z{kU8Iu~F_xF<PXe9A@~OWhQK
zlh>tP{LmvJ{7{Yq>&b|NRqzj#PXbL*07Q;+_TO*zcD~==Yoou#ZmZKe*f~ViPv^M#
z*6kc)`HVnBDOEw8QWF^G<IX?!j_|Qvk7Pq{>kGgcE{s#hDvD9}+!nh;atGvbZ(q#{
z;Cs32c6d5i3%#%df!*VXJEQX~A)iX?q|;F^N{3ts1;YuXbP5R%1-jG81UhUe#}Fzb
z58ZPMPcku`rc=s2wj}UBAKdVJb=4*|vhva{V}g~B=OcNc>$e{j2?(Bot5!P<yo!eG
ze17g=S65B@X0AM_05Q}O$__w%Vt_8A<WB9UD%6#r7YfWubpRsuGNRWqUk8nQNU${0
z_t33$z-p9ZJ5{KvZfOAWDP>FRPX~ibrvl{-wWa(%w27*iiQQ6>Ws-{zWCvB6P|YDQ
zNccJ(3#+-HEA3d~jmZjb-HMw{Cwh{k*ReL=hPeaBk^s70Qkb3cJ&T?S8iLV?MU1h+
zZfKJ8B%o*UV~OZ&WO@So|9BCt3_kV)BoLm~qkEdB)lG1Vop{tu1|eYQ2<u*!<TwjG
zQ676T%BE-M_SkDR=tJlweAAGrDT>?By*DB%YOr8d{$aKE)W{{Xb@ZFbN3J@)7gpOm
zdunRC`O)lg;#J(F$nQ@QjP;WH3MQ7&Mwx+x_84-vEkgQnV5!WGloi6PjkrYcvk`gg
zBr|fhrh;SnAgg&+NOh=w#nT8-XTeitqeK`;IXWF#n;IK&vnhtRUWYf^;-4=lkrNKf
zfbQOn<f{$5nP+)jhV)Mdm8)ouw7!To$~5@tCa3I+r*HK7eKw&-hbT?eQ4NMM!GN9%
zS(#2KWf4E0OR9G@Cf+EqUU!ML7<(ob4jUS35lt)`BDXd7VO?!b6L|<pjcLE;6F{}&
z8<9PThDErT>N(^KO({|TWnu%H%6y@q^S_!GYZ2ZSMQ2&o3s5h+_c>(DCwCS>vRk<>
zTkMk?g9uD;79%$v`dpFV{7K0T;MiPp<4t^Fg7Z6(n->`x>5#kzv_O&tr^8{=OM$`+
z@M3LMCgA(sRZJ0De3M^ch5rC*K$X9(*A_o|Sk7U;aXt0(7e$uVhXRAaay0k&B0?IA
zH+Gg$kaI53d2~c61t>DDE>E7~!YaY@<rRFoY#m?1=IJB~qcgl>=-b3bHO3d+e7CK8
zf0-2fAN#(%Y|biWoJ<{;)ENsOC{&&KZ2J^(2&Wt<j*3q=O78mkj$v_Y9Te$n^v6;a
z-o``6+OW&Ig=GZbFi8rBQ9hfdy<`AgvHSL^A=9kmT2mqRiG-^wpJ_aaVXYF*1A@j|
zMA0!Ol?{1L|IH4{WZ8zHk*AYrNmX0&dc#E=MGjv>B0Q0u3rc}ZR*rb3>(#{gLVRPa
zFN;N?!HTYnM8Vl2T4iR2FUiVGU_hgym1y&2p~%4+mlMKQd`T_Xi!<TbQ?m7mKhqj*
zA{0_142PZ9WdJLNc`zc<=#p}`II$vc&%i26ony&s-c`X9OMro;tk)c6iFCaZp%0^K
zK}XX>Q=fG;X)&5XIVjG>q=Cg%o+{~C9DzHi9)IeFj`sk4Ue+fyq7_feglus@`Qs7p
z^N@nbD^plyaKz`hCkcV!WGU2-x`Q-fnPcRJ@l_yXf~&Rc6%g6HGDOZ%yLQe>GWtos
zM@nl}(N+MC2wltrU$C~7e$wwTKe!n<pO3D%7?owlvsMhC5?Vj{G1jZ;MGs$SJ>5Xd
z2ySStSga{1UD*->8(KPFtR*NNY{|hkUr)w<Xh{USGaWE#MY}YQP~mPiWJ*Hb6FFXs
z70E(7xJSTBcG1lhTLS)0=wSCe>AuS&F_Bv-vhj)zAEV-dXwt_Y$#$Q=OUIN_Chd|7
zEYK5a>@)#_C*f&`Fh=BgX%bd=*sV-MDm2nwX*7L8v*-%SqHm;(iYBGFHy!V(FjMsO
z-aR0<fju7F-X3Pl=oi=nGICpWO*eRI`hxVo{TAsthUl0zl?|&Y4yG^Zb19>ghbgeE
z*?64gDTeIDlqG^Idbp++3Y?7k*<=~**L8^g(ve5{4?zgbXzR$%-sIGzV1Dvc-5Tk4
z?nIs7(D*Tk;xu4WZ-pE3&8CH)Ol<4h3WoLaqJ^l5+LFzJcLpWqYUuHBxMS`bP4H3s
zKudX=Tw<;=hQE*eJJnbeE@SW~#Jp-Is)MFQSJff@K60NeRbABt>7NVG*()dz?FQ+X
z|NPHfB_|6KjcCzfhULCJG`J-b&@`LosAP6*MuYM{bowj1**LdBB_ul5?+-x~xhg9C
z+aghEi72FSv^+{KI-)1;qtv~e4SMnbCbUcsm&pR11+G%H)1;5K!IkyawVnGTyBfS%
z;b{3Q&J_e%xs$=RNc?EV&iQuuLl#ZwuS6Usa|)=2QU`!(ED~ZrQ?TO+m8>VPD%6#D
z00oX~H=sZz{<;WH+aAYxfFD&}n>MHsxJ<2j>T`vrx?Gm4g8l*KH^lGjrD?kF^{7-o
zZi8;&U@@1uEg7_#0au7r+Vah9S|q3t96dl>6^`CA_%cr!j`)5S9P#}O0F?`04UTLo
zxBwi*rqF|<rNEG^nM5h<OpK&EQr;f0&HM4Bp(3}Tc|SIMA6IFuLewYA5AQl<5o1Sx
zsA{Zl_*x8`?WYq|59Ji_Ja8}~rFl2XE`W!Oy9K)QLM5MHq7mM^XQe191G9YOT4q?f
zxVk)fJBi0*OgYvU<(j~i7~4rU1=dZ)jG@<61TR4Eo)h8zOseNj>AIvZ)QVa&wbpZJ
zwt-zEGNg08Ubb1Q1V|G}>J7l-M!@kUps^8v1{^N8I!<R88tZkE6uIrncFfu4aOc(>
z@38#i6_+^@M~7-7Q&L^4!k)>D@<~(1<F!?8W7SR;BX6HX%8I7!!bV9)#dIU^wr*1x
z%0Kfldh#^n3deo@;vWO%5>!1Y9W?Ijbg}TM<lp03;#IEJ3quYSmz1BVh8NE@`WJ>>
zaxJTuksxxBfHcC4Su-w0uCns(sw;OFjYT#ZOh=e}8JPRq%;r`hLu#A`JLuhL6f*Z$
zbR<wEg(#e{P8PD)+I;xHbl|sUk`R$^*NkEhjR>xKR<d_R$J?{|z2|hyh6oH3s!RTs
z_1X0|7a90HXXHpKpnZIc&T&IJxsjdEKQ2pdaFs4I<w$-Ua89P?gnyE@j0qR!pT&Q|
zD`w5`isXnp65H)EvTSIK5GPOlLSi_mgWY)HDi6=tcGawb{M0?C^qTltA#YD$7!pn{
zN4}24o8jeFiB6CLro0ao<n$un4(?{2VsIlkwb5c+ZXDTI^$A0z0wxY>m?i^9M2I@P
zP9|qbm^j2&p$x$mPOsiV=s>w0qb~3EX(b5(v;YQcl6@d#kA^s>p6h5^gR^A=S5^E(
zQFSH-6e=JZCzJcd1T9@B_27P>rg=xivK>z8FE;<Vdq6e*zj_y_NiMh#YO&e{1ZfUO
zhsWXdwnRx0g$u(1MEhgyin`1%>!K(+D8e<t)aQfjbUzu@)H}3BU8q4{Z`ADd$i0O^
z>r(b$JVr<|fg{g24d@s|mQgrq0kyb-70Z_9*furEf+L%{;r`K0A5HV~S5TtD^G8Ry
zoF<Jjd*Soulk}`p78}j6#K9@}(0#LaaI&>Y-cJ-a|KxD@@DXOei}LAsoJ}~~x)~MQ
zLePdnl{=;c<TJE~OGK>8IO)}G#z1zztEH`E%u08+)&pj;aI?%1mf7mh=}qtjf$X=>
zw%`h~Kx@RSrSq!Q+znkWIXlE_Ol61l8QlPzS$1k7VaMuG8QB<or}4{obfv1#8u*-%
zd-t`A$kGiT(rggwq{MYD^ME#?-XOR}&Rd~LHG{dgOQ@^02c^wQ`jG2vR?^A@H!C$c
zbF-d6i5uIjqR|Onto~ItE32-rvRSdl;+s{K4&wYtb8r7Dn-v@TQ*2fl_~&m{PtViv
z0e!u_%0RE)tAx0>OPK3BkK&dhI3iOkn-8Pqpd7o3!RQQoO8fB*MHIrAOIb`Ns>i#}
zb7b-++VD+9$KfQyr%58w!FytgcS_9QBuy|}8wS*w1YG`_fc~T2Ke(xi-Rya@d>mA4
z<k@&~%SV!d>u$-uo-!%qX;fLqoIS++P?1|Vf)+kPpdf7xP!nK+T4XtmnaGdP^2fn4
zrPq0%_NGwel5HX^Q%xsdXiP?W7*B^}5e~_N*^pqx%^Fh^j{h-*hGHLNG^qob-4<_h
zV<(x%hyYe={<&Zqk*eHfYveSVi&e*JI&!C1;oZz|p*XfV=INe^S69+6R^p)d;yuUE
zb>85~g@(8I&?Lu^*c|+rD&v#9nEbr8NrAA|KM7WOU5pI|?qQ;z8dBu-x?|fT?_VZG
zZQO|N3fa4hbnmWoT+&6}rc%DfkuD3;f}>Nacp@>0Zybt^6OE%83{Vn02-Ctgg~1Q|
z0IJ|^HJPV&a+BXcp4HIY+b0zarR>(m6+@R$GdKn76tFt7pi0rx5vXH_ShIhNrUyYU
zc9-DR##w>Hk~Sd+C1Zik;3FB^q9{B%gLTt<QN>PiLxn^$_sE<;A@=qN2LxDjgH&z}
zA3}3?CmzyX#DGThaZq9Q!;yvd`W#Cg?KMV!BD0@ST^}lZv-lYe;>U6K7_hkpo79XJ
zG}!RnJpfvt6?o_Oarc;MWuYMP8T38CLs(|>a+8a+PsNtO<;5U_{w1v)$qMr-m0pAb
zYB`5L;?3#MCcvjd9U&=XGXVpXP<MK87jdrA7!G2QKhTE|w@MVSQoOCYaIfX($MI@J
z6tIid%iK$cEH^^d8lK^Tsp=XlgbWlcI5>52pZQF1wbT<B#HX3<kpMi?KEPk0FKiE>
zqCJ#Y##N7HRHI<)IYxyZB`WN3l&Li22hyMfn)q3Xa6H81`#zRr9Yu0HvHP~0r^d99
zHK2t>NPrak9Q12959`MDlh7G8=B$FCQ<U~UhKpmilcuM#dvY;U6US`AnoLAWF>g~-
zPo2ALUS^XU=D6x;j7@5C&&*7~q72S2v#GH#iwAJ<_Aq-O8I++j6Yz4(0F275P-q_#
zxO^^PL+yGI#CRd&T&-<`H7(o-MGzG$bPntexW|6m$kpG^rV=+OS{^T(NZ+*E<c3iI
zqj-{_hjtl8VOj3F*S#K-u`<@zF(dR{9wltvUJ~+n%tE}>3&Yu28%6CWLyMf_TMtq?
zv##K09Z0UwKU2{W(lvzD1Zt?IO|9^^;YKrM10S+yN0ylb;G%}?zRjo6#QqN0^+>KJ
zyqzWnRv527$>AFZyj`Zvvn(hozgQ8FtEeEuq=?Bwk=*>LMI7IFl8s?3WSGy9VQEiN
z<kra~>FQf}g@Nj^t6mFe6=2vL?$OBOXoN~>jVv6rbD&n}6y(67B79KVM@Gq-hK?ww
zusILdKZ6#k<Etw4uCcdGT^hQM$ZCxNL_YcTF|{oE*)Ep{)Q}C%NOA!~WdxxZz`*PD
zr<iv+n&$DD32}nJl$ezq?#jYR6@Exzo~BF}l7vAbN9gRbRFLxI63uZe^=zQ|LMsoV
zmrghdE$&uKy?W9-7B##l&T{!sbR@Tgwgj?mXv|IEtZqr6IH%iy&8FM!s%_$9kpcj(
zxz2O|gOmoTBc}17bD1)B;D<an)#-zKw=io*x3mqNIzkJe_Ha}yD)bMBHO55A>Y#h1
zibT<B^z%j|+H6EyzeG=;sqHTF+Q3Kne(RS<e8gz8O**Gku?3r3r{*^2HMg#tOH0&}
zm}FHerXvq(91uWYC+M2S^_#3vHDSu5gVl|OIWjTyEGf%$O-s7P#Lpab{MYGlY|@Q?
zun3t7&qn$7EJ`OFj6Rf?DarFPkzn##=d)YJiIz1%wqYU-pQHWfC~<E}*X<G#UW);t
z5lh!AUCGFho5if--=wEjmo${MbS7P6^;wBNGx1JL&T8xK#8SgLV`-?qnIgLPB6f-$
zs;3g5<YE5IlBB4$wKCtK(k8m^C6Vpg$Fvb~(pE<k6=n)d6QQCZ&N^7bHA`5;9uUCt
zl9}p@jM-a2cfR%`%LxgbZ^z2ly5;j^FecS9UUiWK5nCut2)h+|ar)6R3>!d^gbX+P
zF(wQq4I?07Z-6IA_dGgJ&oGP{=R$B9_GQ=&bjqA2YLo4^UYy|WT|U+Of)w+#VM&5<
z{65*S6x%`khe~#`cDzC9C34X*9Ze<j7sWA{*kL0~I11IU9+t{@gURN}^8`2E>NIE1
z!po9}A~6{0Xgn>niahr>I43N}B7~n~sLH-8yiO{$J-`yrYXLL9!%k6tz*SN?BFb#O
z$LtuUSM+#nxb^v}_Ru!CqU~2zBd2P=@79)%b&w<mPc3f1>)M@ZBf2xKFEt`%=hHA|
zK7N2b&&@UVZ*jc$r<S5espuJMcVi|DcTY+3_36@E--Il`4XA#hOviBH5fA+Y3XZnN
z1I4=}84KrzQ8F{@x9gE|n}$~MM^P1GmyMC9r$Mgi_UX)~PJ>OwJ|m>w1uyORML5)^
zLr<}weeKJmC<T4R&pi1~nkw}dBFbJ_As6_xf+7pUC&@wxQ@Ii>Hf>`*pxGyxPiZ%f
zmvmtkR#EjP$3Zg$LK9$73Tc9mk=i85mvWz8?xF-Z(Zm!mH1^tibW1q68kbdyJPz7m
zKdYBYa*zo7m)0r<+EgX|w{8pdTl1V)XfNXWR)l|ElmdBMO$KKvEF=oGXQ~mDDJ8@O
z{^`hfiJ*ahI`X~1*fb)@h{&pIh?FCLI`W-sxUw4s6t~yK!b54ve(lnU@*=w`WqUm3
zvLzL)vvPr$yVmRQI2@$0J~j}_WqsA{iOuPlDd47~FP4~EY0J#ZX00F_(^`|7ca}P}
z3AB%$h3Qypt}k`&lP(1#E+OMW+!vk}l-HNUd%4*dYI0FAZ2}gN84bEcrp>5nVd*ud
z?X_W>`;<}ohNsQQVKfuk<HP3uXF|ZILKUm8x8i(w1gV|@iVWETg*>r<L54b7A7jD9
zx*e)Mg;0D>d!z**AfbMmLrcmmQ1g(>eE=(wBq)k?B<TtB=t|cmc_PW0DAXFyK$tX4
zQz>fAx>+icBwRUq?&9zu8ZsDl<Xi(sLk-p4qqYq-3l%t(Olk0J9mkUbgee`hpCVPE
zJkKJ&$R6zSZp5lYd%-I~fKzH_1GLXVD|+_?fidNpWl+)0q=~0bHyVbWAiO>YIY1<`
zT>I|xc-G8ahW=Rc1~M^L-6<(JR9(b0Os0oiiqoDwnDv>1aT~naVBCpR4F;P$q*SRK
zqWdD7^zuh@K}H%K+FMruoDmjhH1qS}ix=(I$vx<@b+G$ORXf%5{uw~ZZTvDH+B5*-
zx;>bmQtL(45?*U&dSI&?*O?dBHDFPDqf~{0ldEbt2~2B<Dd;$Qq&?1nwGGCVWgBEM
zZ`QJNl+&KRrpQbL!IdPe3o+sm8NyeWdP`v)#Qyo?!1bH+Wm$EFaZ$RQDBIhbXaub7
zlEBE+g&j&h8(*4RC~Y374aOLR#$Jr`iq`DbRm5Zb<~M)LDoH+TiU|c?d=#y2(4hp4
z#ju8$YqUs5Q_=b&?s8Ny6)Oyr4d+Yx#6ZBKSuH1tekvRJ?@H@>PhF2Wg@NF+T3?l3
z#Zp|w6eVvvui5pAa-|lX{#RA>tKHfXYq9S1qS~Ea{c$uQm^_Mpz5|E*o!&1E{S7r5
zePTxhv#g0KEVE|QFyn1lLkbzv+IOt9Ce}r()rZ}B`TBLH?d{Ba(jZ0##^hpE#pK+!
zLL;-9nLRq?TJNtFV?8VCVWki%w0I4+8H8_34I45Ie?YDQq6tFr$&SDiTOJw`O9wCW
zXaxF}hhNL3ts;MLMo=+2>G*=;!o<PlI1zX;z(*X{ZSaYCk>-iI!wuI`VSS{_#llL=
zvn8<aaTg+(j(><BcOVcL2SxTNiR^G}#f9<~;U8lD13$2g5=PWd5y>o)aRuRDD6w^!
zTXFBKiMCPm{7zmgn$f=PU(epBdq+C<M`&5z2dX^kDg%Wa12GoMxty;Y#D%YmM}|0C
zLIdod1J*~ek<aZVM;ct@*s3NJSMuvpP0bCK!OB$=D1(tIG#1Cd!&%|LJ2!TwIt`Dq
z@pM3W!n#xg_ji8~pK*+rB+k<W<7H+8I2TpCO7hBZV)s@%8u1j2OOdtGurxc~g+FZ<
z63du|!U09UOlkt!26qP2C40v@WY5Z)h9B918_vXa%qj}3E*nMNqC19g{)n4Jgm&R1
zV#?qJ0c^xFo87vQUjS0JJXwO5LT4R&S^=!cvNgMRHEl&y0!9I5>1KdoJurFnb@gWI
zhNf6}rbew%HPa&`f{V>m=w;PR@2}9sM-S!YA)14;OA<=T=jdjhsQ^*x2vWC;Hj>i_
z08pi1XGCL|);H{kNPJT$SfcEeobgv&`A85#?-JHCW|PIWy$`&rVlmyZS4G7SCHu+J
zjY^QdnMUXP?*+rkl-qUifcdHq6%H2W@@5{%t1^aj3VHDwXByl&i++32RToy}=9YZ{
z@afeK!|)G*oZc-$3gN4va0F39qC%TWTPXr7@rdFrv)3DzM+Fbs_X1NKcf}6L+jox)
z3i9QSY;bK5b1wJiW&NKl?hBj%SvXP0q|LyxDOoe&;2&F^nv4MF9)+}+4BxhI0bDTR
zfZtwdt2)BUd{$%;PNGUWxe9`~wZce3>!Fc^=($D`{cAp!uzR~!y3fWG-m7y_rH}*P
zQRP>n3y%QNg@$d=#ikNteY9cYGtp(C;PhVxT|Dakr$Lumt&*yQh>Ddn!vEANF)xI8
zzJY~>dc447iaMRp^4=F}A+IorND0%ro|`qf8WaVFtp}dOl3yKE`)5HWW|$g-Ne|av
zTU-0Xg`1l|k+}jA%M@V&$-|a<=r+ogHWD4IS1A^qt&O)~7#u8T<1S|EaGiv6<{TmZ
z0#Q>Y4(8ft9RFq+LyBOAfWx}ak{B1J0gLEEl$O!Ph3L_jq#mDz8q~l{s|_#Kf~z#K
z#$Cz)&V!j1!}J<zr&;PI9eJ}-=OswtY+4CG8XEhIaHCfr`pu7g!}sEfS!a#Mvc9Jg
z!$~_^v?wQakzss^tiULWyOS)>*}Zx^@JuH2246Q|RnkQ9WkDAxJ?5f}PtpAelZm|}
z8%UBRFVJfW)$~Xk63z%!vZKa{r3t$0O_Gw|6&qt&9$95;X_!2#rNaxwpeAc+M?vp@
zta1{F?0>YFE1~*kg*|nXY3oY|N!|@>#7jd8-0onSr|)T<7(Ci<$JPS!D~z>@r>(U3
z%u6FgUW(j`e-M)aI;n^_pD3Zo5alqv@)THtRM-uP9tVrcH%ow;4$0Rus_MRU)bRM9
z_``PqRj;iE$IfRGx(B0xaTXU0E~ex>(qa68!`?}(4TL74cW~6)4cl?7_1B{P<JRkF
zb@RJu^Sj5K)j$BmS6Yaxo=wYaYx&#O&h_l%<!(gT$yXr|9FhO65m*Kz>&Mx)2%L8Y
zy@t{Q;#Z#FBmA+{a1mTof6jf(45j!Q>%^66NOHkZq){Wt<qAF~El=uhO{^|H=hE|x
zXhao$$mRV6Jy<#$?funZw@t+hScay!COj=mb!Q`@tI#Y*>d<Vgx$UIAqhqn~A}B8w
zK3Ojkm$<CZ-K>pXC12CDI7h;%ZghunaqeI+eu9&=)Ou1T^1PMRD{D_WAn{1cy~uw%
z7eX#*7(ti;BA{d=JnG^>m$m5vg437`_FXt(Vq*!)YdgG!K;cdk$d5hj`LllF`k<Q0
zC>PyaQ=EoE0l7yZkMn3U9qDBsWZBrCiexi#P{&$!ItTnZ#=U{Jxr_x!TSAU}LfN8r
ziq}5a+JTI*1V}v#Qrk|4r?46}LtyUgl?bn{h#G!dgt+K@4dj*`^aht0um&se)Upxp
zgNk)pb(bapbaGy$(@zt49Qzr`WLAdANivMnQL2yD(pWF#-pkr&r8;c1VwOT2B)z8G
ziHO%EoLoZAO6&tqmEX?M`r5XC4t|(4lI%K28`7mMdFD?US4N7e)u~vA(%{Tez_If)
z93H<sf`xr2@duz1ohaJ*o&g2VdXJ-8>)>SXxD{b;U3>x}@RHT#5|JlD3V7>YNvUOk
z_8ZQwZ3IZ1b8+vdJ1ZCW_w>S^<dutcC5aS2Woa^O$WfZP*UmyZXw#t%RpA_xPD2Y7
z@`3<W0!ys{JudBrtLerG_-1JZo7FHKWxe(=Hl>~O-OZrxr#L@~^Sn5pkPkgzxU3Jl
zmB2o%)k{K!dgBKS+bG4*8*j3i!+5hZNJd`3Ca)i?j^(B7W9_2K;*jmpr`@@iQ!-i=
zA3JtTlYA@`x0!jdTf}S7ZD80<RtBWKWYuM!?;YpHx?*2{{qto~?8&%hrP*Z;O?h;e
z+)YgY0p%>gme$JlO=W#ZNxf(}R4nG3?mLKEyTC*ZHU&%gWB7)}oYH6X=jN)d@Js(>
zfZ+JS8wftO3K)P}Jw3LY@WTkGWXc3@W!R)M`otrHYG|Vp<>REA_S3HMj_!S6`{`l)
zjt^E<0g+CbP7&`1eA2QW^|G13qDa*&_Ie*~Ac1paN1WHAxN>b1VGv+2+iP0mXtf*&
zZ5SyqBor}RkUh57*4}egYi4^H1jDM%`nxX-irNC7TSjANn5mZ4#<I?C`5(VT*+=de
zC{COk<WWY{7b>!jI5o4UgDnK`JpnrPvgK4+LU5IL(o-2~hVa<R9cTZ}$^zwWz=pf?
z-N;KRt60V9J1JbEn~oeX7<cQRvMKvD9~_>jD>rs>P-a{#TXSuSJd5&q%8_QV_R286
zTv1%GR{jO6vWqml#=15eK$r~&hjO)6OLYnD`-3vu)N8&$#o5=J3B{`1?ARnk#KlXz
zAc}jvRCPxV-Fz&}*$GedPI!h}VWmn@v!c`z?(xWRZ0v2h5-H5!J;1R%9lQFUe`e;}
zyl0avevp5Re)&a}=X3>CbyXBlF8@g;uI$fp9R!G4m-w_Chzk{o3~E^)6M2I2N9dO*
zP9Z18(LN?PG4sx`xtCRT{O&P5WJB~Fqk;rTbXk>Q#U%9?yl2;LmAEK^aA5n*2^@qB
z4&xv{w#e&kd-vjp+|O~qe0R<A$|$2bI(ChIJO=uccwvD6-Mn4?*e)l0sI%|=!5M-u
zZ<KyyAEcQ}RhctB1q0aDNQd@fRQDOx5}R6g4h7>C(UI^$CgztllaFcna`!e`)Y!wP
zI3QvF_@LzEQ%zON;$EDXyiR$RplnX6Dj=AawOLF~O)ws!J95w=UxN;G=5iW?HzZvc
zay)Ux>FdNu;?;32(p*W(Uxji$vg-s%^7}n11xfPzEk{Z6)`Xj^UJci*&SrJ*J#~8v
z?Lg{6HRS9$&5_t`TBurqsoI9uiXY;~1a|ISR9!3Hvt>f2;(n>{&+?O^K+E@X#N{~=
zVmKPbB*vJLg&lTWZp19b6wC*<l+nXCRMan}MNk|PDkmjWd^`wm%EkGa&%u0{+zZLB
zR!m~F6@X*TQ%(U@{IBV7ELta}`82city+Ca%frRrDF7MqvYe-V!I_B;*D;m4;@qwg
z<;)ZcNCbXBX^R(9XD+uS7tB+@%&ubIoU7#Ma1`a!E>cY3-n-<d)^~#@T3QX)e^$8~
z21=4)NoJZx!~4ku`4^<m$n*}g9>}Rl=~9_}4M~+i-i8&b4NI(q+1Z!JIGU2Q7p>sb
zgznHRpW4v7pcE1+PY8e4k+-E5GH$+;qFHdRLmG-mvle=_O*seMXI-w%G;?zHwr-N-
zD@0n@1ONSIZ|8fmSwT&2r**J%xVv}ova|n>7ygdWeZaeDW$>{N{np%vb?d}%@mP!?
zpcXq-D(w$Es7LqkIlEZeb!<(mD2=$jx2cpDq*lE;=T@nTMHH?ClH=yvS$5+xLfzyQ
zhZ(N-$<>Y;2RmKdy9Gp?txARAwnWQd_3FPjAc;y~vM{SUg9i?!Ap;7ebD=+EVrE86
zLUHo1DbNVDx$rSrnYgi6d7FyXS1|#O97R_wCQczG)?lR<Mukcy*(zO8GGohvBX+Z{
zF4fqWbwmABO{t`M`1+RI1Lj$T+Anokr*d-UBsopF6PQpBHM<$#n%pwifr*$|uj;<+
z7>n?Hlkd-x5nAkEdPJ{ZxnQG-U=zY;uqn!Vh#I?=IWn_8X0a|sH`Mdaq(n*lWBz@X
zqBx*u3u@_Rii<wsd+bU|ruDenoem8j5GX;AG9r@75Bn4cMy4$6XS_j%B=~#v8Gw+O
zfkw1`4}YpU+LWgx%;M94;91h<lB)%`=IEPgH8HU=X(d-}kzrJ&e=aefsugIXvbs^1
zTh38j@mbjrsM4}U^ez%ma#YHeQsZ^G7mc*B!80D8PgPIh40|`{+74K+_PcaE*2=Nk
zopC+7GbQadb#!My#xgaw$g7VUx?>;rsJut4Ww1|mCGThg5GoY-JC-4`@Cd)TJY3o9
zY&6R@=mqUCq?3=LJ7Z@uQ_?NVw|shf&wO2_ug+v|S<}!#Jb6)9)l)z%20tJdtcwCe
zKoz3yCeXCFjH<9n%oZAD6F3QpJgyems#qU5A&RZ`jo4=oty+?jT}Xl|hL~`T##m{F
z`M;oNrr#L5ebloq)mOx5Kt;=OSXhJkWIsZ&erFCl1j4WlZBR*KLD{7kW&Ma%)bV_B
z)FXsopDo%N1QnO)b#a15btFd>#hA7cnT1Ry)3GsZqLa6eH%Qc`XEt)5<$x|{zoH9E
zvOAbgWI@FEH0ovOIfA-mm104{`tu4}jc^(zT`Zf}rXlQDpo2SmEQG!_KF$i{9xSQk
z5+h(KiylH@bqtC=oN}fH?j)$Cpoyw|7g4&gfATci@X3NP(tE)vFi?SI#=|G1m*2P|
z-<5Y(F#fD=)E|dx3xcc^Ly53hk%23it*a_67rygSY(e{ef-NT^x@dHWAd1>l6d<Od
zXe_K>PiNXv@nLQERp`o(5BfP7x;`U2*J7EuED6P0I!tWx6cNRp3dM{$o%Z__Y*Gxz
zCW%BaJH^X3kUTQL7Ca{h@tAK8FvOcp717A1ki;N_VJf9?s*=(T-HaCgl=Qv6Ex(A&
zBREA%uHTpFyJ|^eo)Ho-fvSb~YHT$U7=#>&`zaMO=Bjl)SPjZ@;$qi%)IvhDlhK`y
zOwTa2gTAliVOYV<W6Typmu+&`;Aqr)<k@xSbvwo!a6DR*f#guqn@PonYK_B{T~Ix`
zrx%Z_Rju>HoFpc~vb723Akr0ShFO_oiKwd=rws3MhLb=}$Gc<e3}Z~V?e7!4P0*fI
zm%-g_^tyB}%a?hIz5|h9yf&+eD<Q{#umWV%Kw;s>#bhmtDC-*Cg3(jDsm!eqSkgZh
zz<iC9WfQVm^5v+cGnB{!DcIo&2ALsSO)GSad%ddfj*%Q`qAP^2)Vn3xNivY-9Nu`5
z?9EWuCCJk#vm&p(2l&V8X3(#(AvGxeg@O=;*`tn#<Ki1j9WIT_pph%8tnq+%s(oAr
z=pL%zH&TE{UCvsZjdx&&XTu7w4=jAa5f%M>H#5WJJ7?Dlo<Zi2TfwnZ)?@~|wnA%O
zx{u@F^xny+B_aQq4j;ez6mXh(51ZCMj^E?IMvNV2Ii4)6#&Gmlthr~QR)@k0G9piB
zIlqvx6wJ^Rpb5KIj_4Bd(JDcQ<+}9}4@B!Vp1r8o-rRcdaQmBYzpIF{rj1yzjfyEE
zRq*6mClIcuDs?1ZbK(XX$NK@VaX(vHx$zlNdGOA+M1c*f4=ZaCM?Y05@g8>(LFf<q
z+xW6KmMLXeDXpfzs)XY;ZvQ=7GWreJOYJVXLD(P&78`+ko1r^(P{?%4sATO5hOYWH
z^E~1c{ca%CxVGQ3o~^q!oycO*`MuoJS0gk7PBe;VOE7Gg9p8{(y%0I6$fK+2h6bz6
zTH&ENhexAz4y4ymCyrrHZBXzMDF?-VjAtnwxN;hL8b=K$>%!Ke?PdCZW0Ze3&8KZM
z53*OH$X6k+RDn{3IV!@y@z+qZ4(<B|Odmart9vL@qU<hOF_<jsO|yRL&%1m87+`6x
zOXvT6J3;=PRO6IdTZict1$};z7Tt3;sVOcn7&8+4`$Uux(@Ih}d3T4=W@a3_5cD*j
z+46hk5gWLsn<s40hMIf&R5m>?Q}ZV`$ue+jVp0%W`B|;_aUx-$Y6g?8P}yE7@e*A?
zOaU?DBJEPL<_pE2qIjf3*Y!A<vho~suO6&x-x}ErBJWIw0T*U$Xu|_|I*}|2%8`}S
zzN4h>*~CEun1u;buhpPMU|Kn8)iC~$4yQvEybm>p+GR?0m2+djrMDgtQ<|S+oWDFp
zqq=AW;xGF~Q;<JV6m;3*pZZN%PeE&8wWMdFr-+W&s8<ky&lLcq3l*1Fr`}W_tjtL(
zIG_s#1T2g?41}36X4^SU2L*}AQ<INZuS&p#PbIBoG_g0&%D)C3sHt{~1mFT_1XEK6
zF4X^phqAO{kw%ax6=*t49G?Nw?_<ct&hyt*M6xvCdC7xepq%L%zF5R=X4c@@EC9{t
zqX_KOw&;B<Ro}hP1n+^sy;3Ty##@)s38e5CP$4d@mhzv=?f$Y>8v6oOP@Mzw07ULh
z$2AK)fq~z1NVnFTB8WZll}2K1|I<qpd7<&1-Uzfe-YRmTo~n4!Msefikj^WKQA1sa
zlDr+O9bsj2_FGat)L^gCzMTjKq1bS)0SV)F5WSo;W>DTCrOoh}NP8Qxwq$v)jP-{q
z-l-QXA^`n~eZlKw!q&IE9MFgEhi&SO_UlXm9hi!OF_i`;csFxN;aHd`zDve@IivGp
zCS_s2DslGj2iyvxQ=Qv;U?uf-c1K`Tvj?=;WDNt#eUhzF`gHwqls+l%TX=f!o-YdC
zh8^D>j%zN7NSPuCRD4lUrgqn_Q@-Z3N^8O3DzM0UC0NWjWo`f*WiVu%$vot3`gw5h
zA~nxO_aIu^;g!|RJ|O$5OYh~jg%qJg6=u<Pl^Gd!FzRuk0-`kLPY4~+t8!tlk1-sS
zw0&Q3Ja6&-jtD`14qVbZV#V;Vtb2zAP>868Tt7huSeI-R!>OUQ-4y-<gK=}FKfL52
zckx=Rogk%UDtB;rR96{6U4cNsFy9#@u^Z|~D{++DNNLi(ZrNS@)zzxg^*UgY008LF
z&c^rXN~JtO6j-#L83^mIoE?!aJ|^T4rEV>Sy;N>_d?;|HiQG7y_sN+D4orN=@w_PR
zBmTr(l*uHg>VHf7Jzz>$g>lkqpTHB!ZIMJz@}dU_xpw}{es-DPFVbOxPjCGVs$%5X
z%VaR9k<_}jwpNeE0EMDoTWTF2A0FS1mXN8Ami{^V=V+-Bbvi#ZJI&*l?M|m|TA-rQ
zXMg@lpoG=<pU-d0Y7jqaQvWP?S}>XV<IiajWFO$aZfJy`6q>KQK&^d{HTmowz9>-d
z<d5+Gy+{8n2t{7(?YBA|{DymizwPfGz_TFC%MEJO`+$h&q1}9-|DLOan~vFZJ$l-u
z|Ih#L{~z7SY4AdI>>8cjR(q$$N4vA>bloMY7Mi~48^khd?1$Fz^TT#4S~suW9K30_
zc55H%Y<pCPZ@2OS)dH+*0cj>3^|La~1&ZRgd&^#$oorM98Ki`@nD_xhRZMA+NN|ld
zx?CQQCbzVm1VSD9bUP5(wzZEGp$1=5+zV>NN@t<!a@tY1O}Z4QZWCWuwy7>z>)yPG
zfZX~UI~c-80RFE5JstJZzN?Bx+W+QY@5czqFRFHiDaLzCfTiqFutr%OqqKx01d8(V
zsSG&9WZEsL2~?^V?|nt*RNF6}B?T7C`n~wFcDH!XLHw0z37I_BYPw>*c)wP>@4#?S
z7T#E=k12caX~YHK@asBkHFY>|q5}ZvjEN4NiCQh=(|UBD#`8E5=XpCa7OI^%n2hTb
zafFLxlxKhk%d~FGbieLf+m6pKb5xg^pi(A&ADOv;wCuV3s;1Yh31OF=w3tv&6Q6OU
zn?QWiux(psL}!SemNkox4=yxnOdTC>py-k3L*prFT-V%47*{vB$JqSzIDI=eqr;-j
z@$8k4aqT6R{x&Cj47mC1&}z7Gl(aGfvn6G|-_O{N;K`enh8l9X|KtpaR>mKL+Uh^w
z*}|+uo4xukn2%^}CI1C}4hBLn(nd6HXy@agwz?+PM3&2P!}UQ9#+Ogkd_KAB;JetT
zCZebcH-Ved!pr$+>4i?Q5gBhf8FMA(WvJl}fco<qmr$VU1cMU_c3RrMti>Sufb89f
zFyh`-d7&@J{s41<l(Az*T8rx-pq=7BUHk{bGu1$DpUHs)m<z!EAE-q}_+e7Sbni2a
zi|%=1Q7n3`e8Wq`$PCO|m?^y8+U!vBChJ$w3R``2DLiF665dch#ACAKM(%_Wkk43d
zc{gjeV_+T8X!mscspcQ7T}YD2k{LX+9MQ!DHqE0b`7lnps4v9CU}ssuNmzJJE;Ayl
z1!FNgN_WpxUj|SLx91OmOV1vG0LN!>sz)&@D3;xXJP+-yv2KHjN}%x-?x@8E%U3Nt
zW)yJ=fuguuOx1B`PXf)>aTZH13M}2}EqPd>dvEZ-7n$LtG)1NvRnz41v!;i(f52#w
zR@=CXbmiP2Gf_56r$@J=(!^dkRY2axb#yB6!!>{YG_-~q;sQt}_^1P6-sY0_?1VV-
zi(msPEWFu)3T>J5<wtk#>L%TSmE7_y5M!6sIPU`#u}6^ZPA_^7BuQ|sj6yaU@uo1B
zv7ZZS6^Y-FB?T$w=Sz@s3s%YiGayA>UJp{!*^n}0Yxq-`E3V9jlo~vxLdunEdYWNd
z;V4P2ck93p>g8BsK%1ROd=V+i%B@!vK2Oiit<tzxR=s+<BI%Qz+A%wr<KHK$KK{CQ
zuMt_daAmh$1qv#Jc^s$(HS*tn!xo=C)uSt^;O+XBZ|3bQxvRP;wKqcV4ZxhJYZl}Y
zPvZ_<+bjiZGhV4WnAi~G-j3nC#H5<FJ3!p;Oo0_CvI5X-RvW}%lc@e!N$v2>xO0%O
z>|?3@iS_Bn6&ebn4Gl?sL^rhG>x>4uh#7%r@}@p6rrV!S&Xb_o8-A{~l;~S+(GdG{
zn_G#CA{mZ>26Xhu7hL;MHd?J(f3#TsGvEO3Fqz*Uj}od<0OX&EETvl{Tb5DBwTd-1
zV)X<X%V=Yi5!#cCSbZQq$RKXVXK_k~PF!pm#@bImEL%)GOO0m<l$wYL$%R<7N{w2`
z6lb&fpSK@4K0f(Kgjwy+#rH(~6NAX!$?@Qcbo;J6$>r26=^g|%m7G)vFMZHZovj8r
z<2YVm<fW_R6R1-odObM<d5)(9-{1fIi)1V9cBcqGH8atwVR0FddGg+SqN@5S0YngS
z)f?HkNQY=)CW(yo8m|&}t)gH`F}knm41h5lpgu}nvIX9%-j(j4jm?wV$SSMDA5l<W
zQX;tH(J{AVq}eF{nb#9!@J6)Rh_)KhgGThQ5pBa0waO|fs}x>^*Q-!!bqk%<(Mtq4
z?ck1*HsQZ*Y;W`1M)cix-znT-Lp&ZwM+G{t00g7+p@NUxG3km9d}*|HWqwfi^_mlm
zn>|c^wg>Tx9oU1FZ_EV1-zVIST^ygg_snXIP9#Z##sA1`?bX3G=%l|`#Ka6wWy2Ot
zrXAsf?gy46_8#tmrONmnVw2^>HNkZY_fA!ffR9p?{(n_SV^JI#@!O(jX0Yg4hsHb-
zpd6{`<;@ShY%K{>SUQJeFawBhd&Pn3Y|u)RK*BaK%Bxt1blXt8p5*_em!6K$1=)uF
z|BZl5W$^nQK*qMKe_4?61(<_s4?iHcqFsjRII@A^0a9=KKJWTIY<fdz;J3Tk7lJ<%
z&;Bp7R>A38C=L>whiu0ZWHrLbE(g0_z_gAuIMAJvYPEd&Fx(AYn}(~anV|v#`UsEG
zU+0JX|G<c5uQh%?Ew=K6cK<FbulMZNl~;Ryef=-K_INXS1N(ma!9uIQzW#fxKk$Ii
z6ElRHJ~QFW>t?q9zY!AL1PS<kkzjMZVql+v1hu6J$Mzsb>5K44D&$8gy~h_}nPocY
zWP^qoAn_-qS^be%dqvi9AxPo}4KmI~lwI5so*2NI$24IW%6PXz_xSlx>_$~9rA#{I
zrK{va=Pw^Gq4^dfP_m-11!zU#?>bqu<bN4TRk7yZt*^tFw-&GP%{tWx9Z(fDRyQ`O
z%1r*jt@2<K%7>`Tm!!ABL$`EAy})SJOE&Bax9E&`)>ivedg2rIjYa7C!}SO9PsP?T
z$%?I}7dkRFA8tz1o8h$#Hhq=j=z;JgGjZ`c#}WFgez~)V+@)a>u3KtDVken@f0v^Q
zr@En(&ZM#3xXDS2np%bad|KLgTU(Wi182jkCIZ|?z#YG$fE@!%eXO`y?@Is=Z`8Rf
zd6)h3C2ZDvueyY5BNLw6PeV&BCD14PX?eb!&z0PR3{;d&8Tp5ow-8#7FTrrNOMeXw
z*XmI(?O_Zz6U>zY?5QGoeW^OvHqTLwz#AhwVbEZHFDxeEVMAF5-aIN-990h=KHS&}
zoNj+*tb95PD+llKJx%-fU0Y<nXj$RQO)l)!c#6-E-zt}G<_H38#9Z8R3We|sKh-#f
zpKzdyYakYW1a&5y`!~dA%qNOgsS3hK!#2dxUy}#leTS}b^|{0nKi4Oi!RGLT;9*Er
zjVv&qN<#YSciwt`@x6CtR{bxx$0#Z;&#FrFn7<9JQggPVRdU95R0F$-Es3A&Y|9yT
zE$~^Ivup8lt(}XX%H4~fO0y&UxJwn%x>lK`;OEPb1C@qenbwl;3!chf>}s=}6fZzH
zq**MwrN6+r9dgI1cEfQ~@l-Tba=K9;H6g$(F&%f4<>2RPE;j1JJM26lgr&0&(xAV}
z`K*JJH{Q>8@?X@>WK(l`5?i^R%I2-s$L+6Tn94QYnW-HQMSa{I;+Xmeb?7vaT^@aE
zyO|{)VoJV_n6F*KYGm+M8sb&7=!-b?RFz$D=PG0NuRC}4&b8d+N=?n(xnDPH<z}6~
zC)0nA{m6-1B_sre<2PgfBKxrtYt0tnV4KV@+_m$g1d8JDpVR261{ZHcOYvzpa5?a0
ztgHlxoV4~Y3PaAp^ydKKhJxN7Xr=b&g!N|d4&$@-{8wOqL14?Jtw0>F-!bxlJ{$bp
z+x``9;Eek#T<RLLS%&n?OI@2kn|WpKw%kkl+_Iz-!aNq3yC?nER1&#_Zt6pw_80H;
zG&>D+3d<$Agzjz4?A2|opJj_&c$*3zb%ioN6ZFotKQLgy!ll!AvZQuDO(~o{9tRM%
zceptz)M>7A^W*1w%qzi0qS%cpnNq#3RZR#0_vDbGI9Rw<HZb~XT15F6w+Zsy8F|<s
z{slo-24N)wgR2xq5B1@^XE-q7mM;<**aunXRf5>6Uev!=ji-EpAGp#l;a3R3#J+}|
za`M@zGnb50w=7M}SUE*tW=IvBnPc4%DH=NO&sm1fE^90K(wtZs^szdhg~?`i8=o~h
zMdaqrZsU)c-R5V_PGR`m*=_zYv)lT-*(sVbZ+2UM%<LX~*6h^bHFtIo{+QW4{H)o1
zTy%C1f6v)1ApM8RU){z~7=@piNBAY$e7H`>8U@Yj^#&AL-BEJ<bs5($X*?gihzfNG
z0G@5Bw-Aful(dNS!&yhHSE+&<QM2RYwsLOsZ2=dvs@sI^`_02IYw53$oKy~9alE42
z>-h%!`Ek6g6<8R>gE;PZLICQ{I63xH$s$6Lj|k1tTODXRI;h{FEW~z*rkmPR+p?#=
zjN?RaIv%85?K|;@yA($&lv&B@V|O~9<#xg8=dXD~9V~$@&eFpfkkNoCd*1J+iz}JG
zR@jMMN!NQ#pkGsod_zFLVMC%n+r{IYd#0OR$SYlAeb#DT<2-c^e~gB|(b%-C$rvGG
z4hw;CX-W<?{VEoI#<}l-^-svCM)zRf%{vli9?I9#dsK^GG_+0Fl((JyXZFX)U?681
zDeEe_i}eLGPxHpOzVSsyIpYAHjnS(cjn&P?F}ebs!zlR`vHvyTU^SnKHGJTFN!(st
zKruIGkPp85?$3tWSE1EkG5Z>reFGHn!JmyHq8smNdKTT=P{{LF#+^R{>NpWPEsd)|
zo*7F|<t2PQz#UeD>}6zCzL?JRYN9NsLYq+5#4j8&X*U@hV?Ro1T~c;^83Sr(iWnG*
zvlVbky^$7;Fm3=o`_hgUTbo~8@L^pd|F_U$1SOc?eKBZv;B|Z-Gu@JGbE76@f1%ab
z*!=eQTn^C!BiA9C;4el5zLcim>Zia}0`7ztio_}a+U$lOG@=Ld8@|$d4e<D;=<0N?
zqe?Z#Og1^^<@maAa~5u!)@^RH55BwEWg8`Dagn}969$L5|GHjt)@wDSFAXf$ciig6
zcVBe5zW71)zjqDi9BW^86@8idfBTYEEW<*F)|Pc>ZB&{tUuhwrXK}52=!mC(mSy-o
zHqIu?js(@xR;XI9a+r%!qYoZRqowE&S6eEM<B@|fG?2VU6JULRhnT|~@Cn(ehf8n5
zXYtZo@L9a{1NbarG5>)7U)AVMSofPWZIYo3l}!k#3O}ubtf1G82s5KCRi`(r7)O=5
zH#iPlgBjz%*Vi3Kl}0x>4qV+C<G|O~9Y>W>WN;jaH#5e8uNN9eh05u{42_eeZ5qe0
zDU}(|qifE)QtyA=iDN!z@`0^icPT2h{MW^a8yM1+&|`t^asxxEGIYHzCAs2|DsXr8
z;Wd!=y3n}VK{tpeXX5|y<&L_U%n02tz;J%v+Wf_RW5Srg>-=X7oZ^+Za(oqPD8<Ya
zs}DCGezUdl?dHb%w-2^AAAY;>%{K5bX+Q@~QC6VJV6e#{>uS)9PG17wVTGjOS?X!$
znB^8eRw}BiYc72Ve3oX3A(cn*mBAOl?R3sHQfb#INR>+Chc?5{cY41>xC2!!M1R+A
zj<!Rp!9MTmAiQNt?-2?gdaw&llcc}U%Gg&Tl{aehZP2Tiw1Qr=Idme9S*KK-d&%ap
za1XzsQHy@|Glk76dJ;YV9hm3uz6%6ytt$KN;$^SA)4Z;>uQ05Kv&tSP<3Zd_nl7(e
z;Z-=R7IHQf-ey-?aJhCJOp+lbVfxDiB<AgRkxhD%ph#?h1(pIE`pIAATQVyOh5jsk
zjK`*xC4`J>`%~3eBw1EqFxMT09>x{=f9?!`TM>|`K`hX*Jx+HNf$l@6&v#e8^ya06
zBLKt64w6w#J<w^e?9cs`h;Vj2I>ovFN&H<aVz}Vv^ITzdHB2i7%Oa=oM>siaUZ}ac
zanYOM7;EcjXiDx_%HzjR*;9nZH$Us0(_@84RA`C2=SlaSxTaFZ_L)omxodpmD+e<;
z=CKc_ImT{y6v4J^z=p}_ADD;woAeqHY_kSu!V51Odasw#)a${|<4uG-;RaKN8Z$9O
z#3z;I*$Lz$`Ki}da_u|^tAkw2OxluKHX>1YaDNKSt2o;G)vo-C9HAX&c#S?McofwS
zBPUXvUV^9S<{wIPv}@^2(;WQ31VeG!@Kb>p7(D=LRY!tkH~c>ZJ*&nUs8PE}mM2M+
zVqOds6hLf>mN%E9G3E%wG;Dc+7w2>{LBUAi2eek6*ow-a5qfozu%i4texF3eMTSk(
ze@85qtdIbh=O!DZ@H2KoNA>7`Igx(;GeKfC+Q8_bGlXLG`LhyqZz4BA+^@V3=as*P
z6RH;u@m?esgMSs-sp5QFAns2^IG;r;oTtBDt-`PG23M<)W#g(d`l>e8pB?iNKYtF1
zK*9YlE)kdrk292xUW~_woM@?`9`w+7oF1)7fXC3WyJH>Hxdgc5GnNuAGbaCzG6*ju
z&{j{`!8=g42_b(#KL5-pOjp4)8sQ=*mif%aN-Jy!P*+$wC&uWVoH8oINTlOG0!`<Y
zzwQA82Lw!693uX5s=44r5Ps%g207!mbV}cB&kja#ojW1?eCEB71Gfe4hVV0skGcBs
zG<!%E32GL5y$@wN)QBEzeKX_mg10wKRjziMgdd^=tq<d*OGJDy=y3=JVq62)s<Ua(
z?B)E^QicJbrzq;1|Mv7ixjg)DAP1#ETsPTrrHclBP)$V`wD~Z4xE0mjCCNDYdGlcd
zRtDzX9ZYjHFnt<*1H8{LPDe2LpdKJ>;)gK=W~OQMOV11vG?NYn&xgfA)hu@9trj6n
zr~rQVqPf&+m&8I$?*etx9y<%&hL<)K(?o1eq7kNXGt0R2&mHL(MY?bJ|6iKqJ^wvO
z9_*197$kPJm*(;5z)eQ0ve0JJNwl>U<;lOM==c>6LRvNGJ2}I<^j?N6s~$M2?NE=$
z+Q4{l5ntv}AE-n{rrO15uu1uIaJX~$`sldTZvURdcxypo{J)RtBDLKTv*lSt_hGcL
zt!VDU#>TcwayK@wOLG?|xvS`xP_lx*{>;e}Lj8AbT7CsXVl~tfRi330Xg<;gNN8j8
zkom?1Oz|oPH#eF@*+6l7#_*osCh{+O*M&@7oq?62U1uD{bS62zT5OEj5mR-4GbV`x
z1Ui`HMtGN+sF_*L9o_TXJRzRCIWX`LiQ1UWFWxAF@R#8auD~AL=vlt=ReV|W#Qe7r
zUlu(`w<0aOY&EvLWAwVG=*&w7_Y~dyZV?6NgLU*x!%+|8cS)2_CmcL-kY!^;2)sQC
zs*taJ6j!EU|NYM40Imic81MrW@bLHx3k<toiOg3bb2TDU#W-(<DMTrZ?AELpN^&<P
z*TpLHSaCi{674Pm=l>2hmXh1kbjF!(2b`^($F=uScaq=*nn7>!b^Vx*>BsM|vAoNr
zkGQ#{d)!)qNqhTb`$1rr=$#gP``6k-2$D+d5K!Uvs(l;;F6(5kHKKp)9g*Uo;tspK
z^R59Ud-bY^6bMVRz)1@q+|E~?MkVFmA=G~X`2G(bahQ%bU{(vr(gEKz>fIqr+uQtK
z#R*Qiey>OHwz%P~Kw7NImbWVe))LR5hP@q9Dgb{#fWKUm2AN%)7r-h#jfOd1*xMU^
z0(1i&;Ub{H7#3TFKk=mCGSV8_c1=f7OsxU8MNC1~cT{@4WQ;*DrbV9iD3a3{*oPRn
zBr1%|n%2r8#^ZE4xJBhAo`RTfKHQKv65nCahYdKN<sROi3!3ctlhIA8T)lC(J0-(~
zztaw@*MuCHer<y|>uEiD6m4*$dV3OX(+;I?Ppq!^k-J|l;xAc&au7t*e%f^)1~5X^
z<|Kt~C`=E>5xLXjUV;af1vdP8Q%8iZ#;XW>?Xi4)0{pjpuO>=>ANjj<%&D`6@d(o(
z^`@g<3@y^~cL8gIIguRnp3V5t7%B*Oh>-fAnn_ljaa0F(h>#{)(H*vZcmK-v!V$wF
zyf$8>y}(7cGw-}e#yoZU_9WWmZ?k6%>qg51q8=<=W#%~bVJ#MRgv5A8yUx&NED7wu
z*}5eA<DGGs&b=D;>SNX*8x#1AdY^CX?{Y@@gE#y8{O^nfRiByp<gYLSM5Zr1g0RKT
z>^Elr5k3%BJS8Ui9FVxWKfORiGP8@$B)*V}itH^|`8+*4w`vcP5gbcyJCzL)-Z`zs
zLc3$6+|u4`sKr3g8<9*L|ExY6B_E1;Sc?0DI#HAV?KkZ7*;75CMerP3;Xad5H|wD_
zI><xzwbX8_(>mBW+}%5P**R{$U8GU`h+};>n@o~!VIM`0c&>2rr1>2EsQp<|O(Yc0
zln)GOq*l8#ZA5pb^~X_>74hIIP0~R~0^4IcogZO4i}~8oCobfqXsA_aXy`Z8>M!0L
zFGNs~_CM7dirzAVc+<<j|Bn~fT>eouTCGBXgTs?QAsXNgE-)l*g10-pKLJ)W<eMH>
zM}gw=@#TtyyMjTOFFKT)w1o-t?+j^z-cyRqer@TWqoumVK8s6=#RRb6rx;SlyH&Mu
zf=tOi>UZy~Z{lLFuWk0DJn3emUcN@Qs!Dte7|GW9gDfuUO14Rn&DdDi0nSt>I|ljl
zU>DL(%@&L5;kJ0v^oZU6PqXYDNI&m@-7BK$xJMS#lpys3*;EgmC;&4#;0@Qlr{ca6
zgJo^ZFSfZ@v8~05Jy@*RL$6qzV-~8KY`dpV?TdF{N#kCRoTn5F^9IFY9%le+^4-eF
z?1Si)Wb(z|gV;;itGZExdM@p;R-$&7#@6Xghr>(BI)(g=9QA?W&TdD1%dwdPX1@9i
zkn4Tjof$FP#d%!NfHjUxl43d;<@9g@RH>l3HI#lc6%Vx}3DhO1<O(JTgAyBGHU1ar
zNK%vY;OofOd*iQ$f_IgJE4%>AX7=d<OJ?s(t1$x-7jZ6idNa`=5J>d81NXRfXN5D0
z%%X8PiYE!`tmA&4@1(D`K#ZjtS{9;SY3Rcg=-ucnIC_6qZiP0sYBS$~<77goiKGJu
zeiEer`0T2vXU)tTQ1#jMDM)Gu=`eMJN0Rs%Xz;3JRtxVXGRso#Q#{(9{P%w6b@Rv0
z^Vflx4U5nar5RXiU=(q+%pM83I0s<}y;B{`il#X_Rnk=hs+PzKF0c@{7bjwYzGX)u
zF?P1$MG|%65p2+lNG?0#5u^VCsKCY>4Bhpm&!W3m7&4Js+^hL?@*Z!zuQ*a60%c6t
zxGpB>En%a9v*F#DnagmTix57XC?f>=yCj&4cNCgi84t{k3@*Z~3T0T#-MQotl}sjO
z)~~t0Py4zZ9W~qS*6wY?Poe;&%X8ExkYz3#WDS5@0>_bK&^Xu(x1(qe_dyppfAmzN
zSGX<UbU>@HiS~@+(-)sSzV+$W-;z-;?ce&3f2+?V>81H9Fu13K<bFQs-j9>D^Be91
znCA8E?FaaG<C}-;_Fw$E`Ecvue{4M1*xY{j@SDvoD7W$8!PfeJMC&&^j^JmC%zYI7
z$Mh70hUtuQbKd_&KR`~JAZ8E8gCt7cC!=DuHvytJf?b)NP2%AY+3rDlI*BKjYtbR_
zsObnc+-0;ET}(1!($X9lfFA5mW(JTZ{Z~3%&ZRvv)~Uf0R4>HQNq4|^AHZayj}IB=
z4Px}dDkkwL$FDtXD@B7&Y;lO!C9xU=^#POxFB;(JTZ5uldM6uSG6P-f)-fBy_Uh(3
znjEy_!F%*5O5oe5pAORTIE$XdlxyT8DlN{2Y*<NZv1iy;69@{mmE%E?Ox^?GkZz7~
zyA+cY291X;9xQ0g4g<}z>7>g?%_)G02RZ}+h9ksJ=x;VHu$5uf!z&>=up30P$H@dZ
z7$oBW_xEWJMMia4^|QesyTElo36<gvFrgnN#UmM4R2o~3P?JI7@^EYhfO!mq#b)DE
zRQz`}+<=s(-K4>-MZB)WG0|<G=~ztf&8VQ)?jQzvd$LwF6zI|diW&+`wKwf1q0y*O
z$e^w@nusT=n(AfUDVm4GYUS?3qA;&AMD$Bz;F~n`Y1Qa>wI-tHcaWr1k%ZBBNSB^8
zXBe<~N=uLyxIISPMmEWzvrCX&iEY!c&LTK_GK_=()nN=n+*u5s0!16#l0CK_AxPv|
zzqmjYu#gHr`m%9MSBn=D#HkTu7pXfG9-qA0Ye((F7bkC<$E^sy9~~e5u(#XVjh_Dm
zFI&;h;n7dWdoN#|M6V9_cU#BpsClppPY+Ix_nyBwIfMsG%{J6rq8$V8ng>5ctslv0
zB04;d_Ff<D??HRe!Ey88WUtk3M0*E2`)^Qr*@&PG(lzeyz1};4Vkd_U>=zp=*NhHd
zM6X-NJFnnp^ZDNX-pNnY<%_+O1MKbv^w$Kg;rL{4=gofeI68WBe012R)^L8id+nY5
z=HBbp?i!2%`i)vYv<^<9_ABB!oar9EJ!l={1f01(r?&R@n$P!J+#Sqzckj5hbAr<{
z-*y0qFvxu%JV&jaJ^a%8u>~_~9{<#UW{FlE9<*Ek{RYax`)IfMy7?03SepYKSfQOa
z$F0{m@WU6_PW#RC_Q~GKo0C@b^6+q%z}{{h|FE~yYCn$l58DK|H|<sfIyq@#_t*+R
z4PL|d=Wp732tNY)!3pqHZ;np(4iD<E=5GN)0D~sf-X&Nc9?+ZtSck_yVY>(nT8c*W
z_Eig>!<rw+^iGbO2#z)YaOcD>3B3Y5PprvC2d$U;doNoDJ1u;Bhz-5nYq#pWczbOu
zv&WskZ9>m)aQd`pFgE^b;c|nPHrjg;HFtm5!@+Z5Yz<JNy(j1cPup*HUJ3MZTim~O
z>u+fvc;|l9=`>rNSDntSzrn8**l7I#ilC(|kkh4M2E-{FrQNmjrCYirlso)BTDN}#
zT%*+ur^vzKK`UA}9Q{GYhb103XFzb0iD)vcI>)W%E}`EB*Li`-vPdTEC3$y}j?vvc
z%_-C<a&vzDx5s-YRDW}JeIy#8`p;oI?!h8IkTJhS3aJ_ePMnN!`>9AJG#zC2i2_%D
z^sKl-Jiy^!Qae2%;8Bhgmfp{5iTDim`$s|-y~&gQbigyb%%;%=nIvRL408bStfqj*
zj?PH41|<ER(lq8MAHWF%2iG9Qco=y2V5>8mf;KWf%TqL?Ih$nDF-Rl%ISrDq&cOJ^
z-ag<9(k7q>8&96B*X_3_K*8*{8_ruGW%{Mt)NgKGr`9fP*3R4J-U+q1>Ac&)CZD%}
z+_gIG{Z{LU%50U(G+zMmu!=mWd)WROn!r6^cih@<0cqngb@p~?ivU`^rtDQ7?g1@C
zLR9;q9@T2^v$R)_et<sUWQGGWijx*12i_VyrZ!G4#|iTWcuyX2F_4$3*#chTCdX!=
z>I;wyk0x2SR&Fd>Nz~T{DU|xX23K3@0tSqVUAn%<H^Vr82U4YKo9>>I6W~G?Y1-Vc
zq=62sW@X6K$_wPf(~rqyksju^`J8aPJxG%A{08d`W(1w=TMc3x!nzGCNbQJ%PC<+m
zh^VFjJ_%O2rij6Bimd!5L`VA}nDvTQCVlz(xb*76edSLdq<wo-f;8!HvDsijdp7p+
z(Toby67Z5BY4lUzjnx$B+`tk@nbgn~szfV=d{b}Aiyf`>?VnXs#HWEVub^_j`YkG!
zja}U&>C0suOiTSBB0Ayu6~t)E*+u;6X#zA78u-uuj3|`bBw<26NxIVsd6-z>>4GT9
zF1w%XVeo=9<rLteVZ4I(K4SHIk6k2_#a2bR@pggAN)#+d(!pt*v-pK#Z?HSF6>K#A
z03AkjBI30&Di#s>>_ZhMK7pEpOY3yE4I=ZTz`Ig$bomf*0C60g*HVrma`&C7ZBVaJ
zu)`oCdp&zg$jb5}J?3bAdKj{F*7njMT_Ny4R=h&Ftc5nZ`&Zgdh;7r5BpdvU$0-?a
zVVfr?$iV+m5F(*|3^E*^ug#-9BghZ|*FAbvDq7*AImZW&tIAO9DXRz}$sj(<88f`I
z1L_o6K?ewQ>(IYAVg0jyRI^qOXrho(Ru-E=l{8e!w~JYY_$U!`YPFgb#my<Dkl);p
z+vE|Dyc;|eoEcobH$B{!l;whJ<#Vb-C4<IlrW&;>E1NpQ6!1o_@9p^-ni`(3U3M;&
z)l*~GTxEP|Pglm4l007oE{LGI-rG1WYNfTUfPq=Z*Ks<k#w<3bq{V8E(*t0#nYA*A
znG`--P&MS)ThnQ>iQDm7Et-vNBN{Z>hE<xkgN_s2rLzk+qTq&xO1s&pphcKfag<>Z
zWRCtiR|zHke|{csKHR?1JAm2x|Mkty4PXENaQ(r<uloPr<8y!ICO)@V7(k`xBV;TE
zhv0E@TAXK-M?_|yPvTy*13M{+YNz<Uc@p7YRF5WW-E3IDWhwF>!H-?7%zecC0%@{S
z)YB#)j-$SODMl`0NohhObU`?q#uJdslO$imMo{NH$Y~6_BvP`y4e}Z4!h%dA^Kr%!
ze*0B(BceMItuTg$ZsKDpnV=H@Qs<SHbM=E;vlfN?23p4v%J=PPW>;EQ^&~HP(8=2Q
zGxr$~Eqpe!KkV{#bLaSQW@p@=JCW!6hdbYQ+I#<KMO&M;PUQZ5DS|#j<0*y*#S*8N
z1*+T6fQ6njBvNNaCqEs{hJeMxPhqOxc8civPbaO%JcMsoPt$@rbxLh*Lb11p$GeZI
z)Yc{y!%P~te2L(HZv7{=M?5O~LjEUKq~By{{-4?y-JI0W8o#5WIf@}afBOrvq5`&^
zlOG>f&p&$c=3obvw9#&BXTN#e#P3y5xX&jTZ^uqLg7eFC0<2K+K^<~Zgv}NGLJhpY
z$QgJ%*<Tte;5f|1YlGOPauZbfJkHO5{>7Y-HZlO>|Ix(o-|$nu{~smATK7i#n0@{~
zc(}2(;otv%v%U58{Qo^ZXmm>}9<8oM&*L0K?vtIPD9^g@5|rPk{XPgAa9+enxnR5J
zd2~vN6uw@(f4zABdh!1C;{EHz``3&2&%bzAx9a^N-T(2Ox{*~b^ZTTe^+XtW%qLag
zInbN()9I-E40YG;(-CF@N{ajGDEz$Wj@=jWWE|heSMKBK2xwT(eb(=eih(bQ;dxr>
zs(0!>N+y$0R+8c3$yr&hqhc0R>4-;=B2<7%v0`gP%CpvFl1(HsA#|abeSXj%7L90a
zZLNNbuRPwz9gbZye(ag^iZShDRg8S5YMAN=+7L6|_xVVSeW|17LF)vqBRc!711bhb
z^0=;B0LomW-=A)=4v)wCd;lwMkJr|Vj<Qkb6bsbt8zENq({H@`N%(jd9*2tK0ak;#
z==!K+_?S$xdPE@_MysmW8f%TwW}^^`a$3^bW}UPNFFG$<ColHtfPB$u)Aw$S{vW4_
zs!H~clPS6lf&dDv6-tTmz(mOapw?*A(Nk$1Cn!y`Y51z+hVQH;L1l^SsXCGo7f>xx
zWk#88xGlEOYEAqgAe_#F>^T53I5rgKU`}w#<p4#PIS9K6EMbb=Pa{%uEzte~&ur4$
zjL;8`{o%TlXbT64zo6=UYJhy6&VW~PpmF=Qz~gRoh}JWtTOc^xzHQb#IGMxmEmRGZ
z<#vC2YBd}%I+xy`M*m;Cm~PizBwF)^Xz;JJR9w@V;B{9m1Osaq9b}`5U8Dvom7Ohz
z#bAaT?vA{EL+jiSAXjTdVWM$UzS!;T>>t9(y%S~3E}xM(a-VP}Cc*{Z2TA-cUyF#N
zB7~fdy2M`Qz?EUdPZSN_XYb@{vEN(Hu|314VK(5L>R%9ULaBGry(syRbb%d)W1&cf
zd_7GZKYkOFEH&|+L58Jk?tJOiymZfai}_#+3nqb`t+LsCQkfwpj6KoayAiEC{%irm
za9p=gPZj#@H~fCrf?&P0Atq8!(UwW{n^k_1aUzQDHuUw>)rM<E!RwBc7^O`LL>Ujz
zIDnmd$!sbq&{-XGkOLo`OklZB&J(7c7%GuVlBIagx%c!<@_ss+eu#iPT_oZnh4h`C
zu4)u$9_{5qd2TVCLdO4;?Y!tdy`ei}TQ9PHaB$#z7<d!MU3DI*2Gse9&p5mKhP8xv
z;{+Q6W<*eKAMSVBu>D)e$sKmSZ?%q^`+GkCi*=XABB6`0Sw&x{shKp!^x?F5?Q`L8
zX`f9c2ME?qM;#QqNk7I^fY4t-R&*pVqZ$AfhSUdV@#Hi<OBzPh!}aIoN3g4t0}lgO
zpKmtT*YT9>NyC60w32JlYn0|MO;1I}u2CeHCNUcDsJ7y6F(tQ!DOm-w;hl`QjqBY{
zC&1P)0&ub_wRHL%;&oGxA6Kp3-Vw0+Cx;zC>;_^t!Fq3ZKfHWTqV+k4gSBvWYmZdw
zrfVPRG;i`sr)jGsUBnvkCgCV50tLhGTqL|U=Ni1dWB|f7-o&Wgc^`wO@ebtuL=hUL
zBQdDt9nR)Lyh`MYMX>`CUPc<81p%bP^@<g_zh%~h-aJLv>fLsw<vKX|VgCl#3!D4=
z1=|6}Jng9^V(v9nAfuZEy@UvC7xc}Y?-iJ371WK{8SfupL(#JJ(u3~S)gZTXaB_2S
zgT}58wZCcpO__{pVodf&P2we{BRVzS1NFX$Cm8dXPLPqJGQtY5k(ylVSFu+jTv@Wp
zNq2mZ?c(OBIw0(`VF3_h2$=omPd9ZESWSK*R+Cw~S#VI(cR59?29-r<c%0`hXBWAd
zwhc4tiHDjSz^zh)qqBXmi^kN4ssQsLbrpv}lTKtRj3u9Aq=ZMI%8imLEBR=7m@mU=
zc}B`oC4V~X22$)39!dzGEOVe-Z8o{8#0lVjF5U~<QM_L(-gjU?6wc*71~z$Yy_oWw
z+AzOEF;7-Zf%y!Jf)HS7@m?co@qR(U)#X%FV>gVS<%OOk-9)h<YORlVe)yx-`WOU}
zzrb262;In9tHy4At&fvD8@y+p;ylX>x;t3HZ%Yy#KyZOnadbsO1}3peS1R`zdq)_f
zhC(*ON-!3jPW%02!r@q0p|g~Z;o*|f`S0~b;KB<8W@>48dq<tagZ-bFUsVDuNiq{2
zZm!3gvxoxB7qZiun^o>Idq?jdAfmzFZ8gAz1SaUxM3_;X++rOR$kP#}&4}szzmIn)
zLo|7$Q&7r!NJ-;zw1xB)$Em*4<h6kS{p!q$v1QC1Z#j63^GHYiEIP+HHw|bQept5Y
z3cZJLJSRo%E*D#G2oBOug*2q25e1SB`#Lwi7N;F06F2ud2X9`tj`wz69kx%nx+xUH
z=Dx&IFFJ1y@TS2lfY^+hYADhs^Ouw3R`c~^4wOpd;xf`@v__*h9p_pkA?@GfJ+uIv
znF2zMA<Us7WvbC#d;>e}_S3oC6>X?99H81%llKemD9RZO9j!jI06-AfgVJ`tvT!&*
z9Crtp)0I3%+7fzG*Nx&MGZfULcSdLwEnUDwYk9o-45WA}T5m*xV;Z@%D#8o3SMGPa
zdPv(>7}K^jsO@>95~T~U;d(h~<sL82NgkuKdlPC`tJ?6_Ws)0dhrFp&s1P`fMhWfc
zRislRcEw;vw?QgWGg*UxcsA;uW1tTuFkGY<bq4Q>2ZXfUL6#@?voY#^>0m?)u8(-?
z39-cF(6;(^&Kc5r({43)caH(4m*`k0JNS}fGGF5uQSIIEIpVDfTdKDS0RF1<GR&Z2
zuS{+TQ4QCK0axRK4VzdXGrHKcIp`0@<)g+vSI7S+L6#E6<78Qru10Rdh1##>S6bDa
z)>AteV!@rmgM-%2iMZxgz9YSSv=M&)yw!P*chUzhqfG?pbMyvE`XEpiXoi8drF5Kn
zhy?P;%Vd;H((Vq!z3Mg&sR!fN7@AxlXr*15O;S3h4d=`y6pajo8+5)>8(16r1HAfq
z`xiONiV4uS+S2yJhg%Pq>KMcNv0B5b;~Ncn@Bw^1wZ4z>w;bjAeo*>TXSw{WH<mC_
z2L6)eUgYfm?8AH3u}t7pqm^OYRkQozM>9p9!ib!z$H&nayF@ktzdnt|beQ=ejM4oH
z<MU@KYL_Jkk!4S&NC3zzYX;AVm%T_Rnv(X;W<pjc-5iNKu&<?d4GzT%q!gGl3H42O
zQ(C`ADUisNOJ?B&@$)I>*y2MP{6npq{2ZeTS2y!?BG#S&nmJ7#J3TB!bj~s~7{VoT
zD?6NJiCEmd>t4D^%eSAZ!^It6RVUW|_2d5H<~_}(uy7b^)p-Rg{f2HoEToO{7-fs8
zcx>j$pudW`*vXKRez7$1K4)pd3ko0J1rBZTc+^vWH#qJ6Pl<?KV~5NF9e&&(x3p<a
zVFssW*PNPNLvMn+#)bis^IG0G)x4th6*)i3<W(6dUoF-~c@Fd%Hs!nWtEyPNG%1_8
zG$4OmTD;rTcW7V%z~e0Eauw<`ANrphgjO^nmu<_W)P-V+3&PKRB15(kJa<eq8l-5+
zqwJkTrxaQQWX&D)ict*WMdi`);Y+fjV~slA3zyOfQ_42$a#PoVT|Scxl(WGwyhdJF
z{W3d)ANy#2JcpcF@u2T3f(_kZi0+XIkReJ9f)ItyP}c!8c{HE3;&!Y==Rh)mZxdKT
zTVi(=?I)OfRNyEY5xOm(IIwdkYXr-&j{bQQjP5P^{m952n##^)8p{v{IKqG*m1Q?;
zcPZBS6`Yy_j7eN#_#WXvV)aXFk1%8{NAAS<XN0ecfyS7I<1Eip#Xw77O__Wn!qbvW
zWQ^03-@ao!liQ~lBC18M@n`t_GR$n<hMc8JFY~RqTACwj&_Uo@3V7nVVaFNZmUf?%
z^n7Aoi7O7M{1+N$c+)<v7!q>!En4U20Qj3`+pWDFV&AVZMf-qu`VUU~w<<(%!0~33
zeppOy8OIoYKP+=Rwq*vbjF|#b#5UuN+p{EeV@JTt!;qU|6{q)lHTTT@#cTO=<VXb6
ziXP3VJHD(*DH=ZgBjSbiyuP|orD7~0lO3K|Sk4(tp?Bzo&xN3Dz<bI3>mIhg;%lXT
zH;>KCLaK)uhn~xXEPeo*oj;TA^Qh;tAlKIcc%t||#>E)<+MK-MBPc2n8}tj<6n2B-
zqNg!D%FeXr$FPb}A<WWTm+xA5(t0EVo*hg_4|9>xaJ4V82s6}cKWrb42BkaQyi(ig
z=^68ex;)=I`eD0)|8$_qgZ-Zxq-6XI9pjf%D|UpIx6${hr0OL~E+iE(#GET}-^D&p
zse_^J9d%9zo2pdiEUw2H`+6H{xUqdhdYZVupn}G&ZZ2{#ko4XU<ngP*>`@SYL>2`>
zCHdJLlYR%>(QSZ3cQ~#st-zYA7nW(IE-M10(PQ?lYm#kjD%k9!M~gN*Lk*?TffwK}
zqlo%)${qKpEiHvbVXmU-`7AY&b-+-yO1ZaTlV{UzSO}aiS<PPc=}2kn5s9>rK}78l
zCnjbB=XYr)_$e%SAxU))1$PE>r7H{Ra-S2wDv9(+qcrOgTxy5gFtzn9q-w$+%J%O*
zmhFncAWL2zjLn1(vmV~cqhn(Ak@3gy<m!w7MrqyVM<0Jlj=i)e=ds7(y*Zmk(sl%h
zn_}H_SO{mdv?L*%_t+wlxSHK=GA>;^&Sz9thzB)mt)k_T34hJuf%-j8rkfBqCG4xG
z`0j-@biTlFa$Ht_l@(X`sYsO<pj$k$g|(BFk`jJGDoRTU>#%MJF?au0u7$FPv5a9l
zT2fdc_9(Cv{=UnLjFRi*DyXAg%pAjv;NhvU)4F8l<tt&#EG)lE4VF*V@O~va4;Y+Z
z!ziTECgg4&yC{~9>j8@pvgn1<wcIuf0Z221Jv3!V6TmU6XOW%fs-nfCE@(VbZ9B5q
z*th+`Z(n=#+s^Q3ASs>;6<E3m1`6f>Ga+Aio-cYQS({AwbhNzrdr;ZYbczf)-wraH
zo=N33_oC4YIgR5CU+i{3G(Bpyjyng<*DaqX2HqZhp3wA<EM|O=F}5`#0h*%1CC1E0
zX=xjq`Rum!>=>frZ($ev-%KWEOly1gy#CZgWai}F9PIt*V=4|$i~qRI)c#t!KLx78
z;>6O-(X3Y>YZ&8X=dYJ<dvGZJ;0QCHJ&iU?EXw%j^<SX#<-adK_Frt!i+`?LZ!EwV
zbT9Kgs!_MDFPVjAFVkAxP$tVS&=?oVTC{gWs+4FPrxUi@&9h-b=2)Bw2Lm$4lRR0&
z+rGUcy!*tvdo=T{K^xukBqs@d>CsZXK{s^in2eF90Kh3-4W3>`KmW2u_RSy!Qg>)+
z{OdF)@5nrX4q`EH2I)H+Y3pLLnubd8q$d&c$K(vAtdQxF3N|f;X>qKHd4`rzqir{=
ztcEQDuCI7p-(rn@SY1~`^~(7KF>?9Qay|OHy-rI%-^qV@1fp&92(=!MNXW$=WGC<f
z?4zNZH%?AhlzhNA%y^U-Xi1D1btk=?lhf*bMQH;Qf6=2R-GeF!g6i{$Dgo9JP3WM_
zWBcTIzjg4-V|}RO=!6t|M<nzLla>PuHc#U&9fw{|4tjdvpwXIP+7SGs16zIlEc7YG
zf19M)4Tpc56aQ^%`{6gG_;1@=U*o_2E+35Rk1Ni}*(4DhO4IRhHJhXyV|DNTVHBU{
zMD)lzA01I7VpmR9CFoh%kGtd}1BU>{zmn)@R2FlD;)U>ZnA}&v$0)Kpd*=62^q`@H
z0NJQJq0GmlF-O-z0?T1Sqh9hp?V?-D3(QnA!c#|rm{Eq9N$(WqL7j55oK!iZR;<zE
zU?dJ0juky<IF$<x8Y>;|KBstTFmi4w9jy+NVK%wMw%Fe%M@vVH&z~zdpC)z|Wv9R5
z1%rl;8zc>n?W~tSqPSt$^CRw`4e<!<9P5k*^GJ;;bKVunVDO02i<7YpXBUXFem_qN
z?Q=vHQ1Kwo99t4}KZ>K}E=F^K)mWARNrD;)#t%ol;KT?f*-Iv}s+i$^N|q?9zA_@B
zwNydR04_KuG6jWN|C%OfYRYRN;IVTBs`0Bf)eKf|@KY75@H>fBc$A{~V|0+gbkC;%
zhbQCiNdE}NDy(elYuv-HaSy4fuW=8*#y$KR_wZ}n!x?c8!+{THM+VgK{bt4)T*4FF
zZfgk$%D{cnopiS!c#kqTvd-LRbRbPAeBk{V$8z+X{h*OqbYtgN)gcg&b2hsuZy+&R
zC&nP3b}>=PeRMRLiW#<Cgo$tr^WzTRB8yZ*-eN_Y9dfD{Tb8!2y(X*A05;6Ut&Iz`
zugH5j9FAxN<G*Z>YGS31Z5geaTPn+=drzZ*%H}1a@`mv}|D5R^11qIxH*;R3wCm-e
zS=3icBYr|veJ%Ssg+@UO<Ybgh&(4)|JMqa>0##oaG~bvQ180m^uQ)2d-+O+yp9@1|
zEblW@3{~h%rn8<~vA_u2unol%V3`Gqp7zKehE~4~rujKZH<uO=KvqP)n<Wvl>>iH?
zz*tefOlzS>YKfHyvyRVXxpUtMP!E$j^~U+;fKne$>K<g+poz7Blw}ea?&(A%2GrZ(
z*x;1Ul~uk4By+9I`vrT{gV;NS9U(BXv9RGjqJ8H*Loj=fXiEHy9fQmVCcp^?I$E9(
zlv=loaY<iHm{F7sz^dO9`m)?*@hsKlEu`z7Pe<=)@2T?t1OMZRtw*2We>kZTq9yM0
zG&Aw$-p3Of)ThU{I9~#QXm6Ajm`9aCrMEfkVskOKf&|K1oY3xJB37}lNX7iAns`TT
zJW)8;90#$OEI`0Nmw02om@AWRRXr&v0-M?p9I2{LOH>m|-PjOng!5YKj~%K*&lp6&
z<|@LYsi;*b1|B-U9Cd9|=TIBZo<@OMel(_jpEr15V7hPQ>N|a`UBeQi%qy-h<jh6L
ztbv*96^H5x1V8VD!Zlp{d{S4oxSeLK(n18EiigNO4yl^h_fd7?1N0A~_&CxKy_ccZ
zg191=tbd0dAIY{35przXCF5$T8ukO1ge%ZF55AJ`1;{r7O78(o%oMHk$3Fe$H7QY{
zJ{rgN$JNxy+z<w+(rnru?dUiT3s7`K+_$7BV444Tuf)hxGHrw>xtfhwQA#;V(+Tu5
zxFnT<3a4tKNGKMBm8jACG)8UheirwR)2v2!lGB`fb$i67C?b-6oa_EcI}tm*uokl+
zfs6*1q+DWNNINXzxmBWM2&gNcMjmG-KcTSuz+!oACYx;8MA4*(OqS%td|zVVx#^fL
z77=q*;E2y7*Eq?=$+bL*-=nsYL?k0wAj}a%m0Ur;iFv*yn@${bg^uDBvn<Mo6!Tj&
zRtc#@0Vw~PCV4@Ma3IcI*L5-2Yjh8XLnAA_^5q)mHO~X%oE&G_@C919JMSAL-mF$k
zwqBavB*Ew{h>Q|P(##i^ae&JzlGGza{vqld^Gt<N<x#HCjRes%ZZj_&7?1^ntOGi4
z&YU?6p58hpD7}0VkIs_PWZlJUMA|aegPi6f@%bkk2p6#RGYoF8B9XD5Fs!n^7Eoa#
zFcuz7l7a!t{3LQTPqAXLSG}P)Q`0x)idZh#$YZ|=3`>u*WEiRjO)=VcFnUqMUcd@2
z=MiZ+(c>I&TD*-8pTBv*84YLyq-SRo70}opFmWs{+%Ok147@mqaUMLLCw{AN^m|Vp
zaZ#6xlxCh)VoTlhR8_>|OU+BH*BPY4v>>k%-wV($nP;7TJb^uH816`qFW9WvzOH$V
z6QjsDn#1YSLmU)JqA&Hvan2VS)aaViRHXLsrK)|AEMwpzVf<1-VXE4Yu#Hr<!6p6H
zOe6uaN(u%J2*Xf|4grukv`l^U%7xoot!gfW*7&KgxfTQNsCD>5>-fd~;oC~1YA@zU
zFyO<eFp^qVA4F!L_|GiYXwk!Y^!#4MexKD6gRdlZ(b%4NUQ+6{F=l^z_-21s{CPEm
zFly!Q;hPf|4rS<kvT5?(s5{v&4ZR^?a%0C?I<`tk_|)82wUyD!R=By;KA?-E-=8O(
zAp<f`6X%ce50cJss3GYLMshfvL?oL<HoMCA=14LaAbhdj;G-Ux<Lqn%6duN}4t<$~
z1Oz1yM7jfvInMxI<zY}*45A)Oe?s6iZBc-8_*V{RAn}Yt!XcJ*g+s*{HtYwkaHy8f
zdGJ*@3<!r9s9hp<j7WxJsl>=Hu{j8h?MIBZ?6)EwkPvbmA2=_vaW1ux*}RaPI#{@S
zu1sC{l#5i>S4%#{wXy{pB`>WI(KT8%eg1l)D`QNFP~bm8&4Wb5lU)6C>Z#S^Oga^6
zM>F%I<O1nGFO$a_Dc7-H-W?>d&+J>eCU~2R=?^TJ*xE#g6z!P;?M@OCMRz))Wz&m@
zT&^UN;Z<qxwzVR4S&InEl(#z0bIBv47U{(#Nt^{j?eB`NX5a1@aRZ~a@UqoCpg*Y+
zUOdxiui7&__pT=>n6bJn3Dm4|tm)<G@;Qg$G!SrlFizH=!brgds+A%yNMVuW-AOtw
zvITVAI?IrpHp)&)8@g$mv6QW>#_1T-n<#u30v`&fplzuMy>cTViE;$9FTl}d5;N$i
zN1|!TMytIve+L7O&&bN8hCeB%iqz%6P8_6sP0YZ2^$87`kGuty31Y(W7UzQ?hWXQR
zh36=WOYnQW;YP6@Clj(p(nnV|mbg<Cd%ABjf}tsUg!fc9QQlJx7Lo0=PRf>z;O?2F
z>ABHv>hY;vuh3Zcu72m>T{_@1o!47jYtfy<dA5Rv;(cR;-OCsZP>zsPLJq(-)}Av)
zxq#-4tSaHP;uwlC$(@uc$(F4FA`>`>;%=g$hwDP!DOMvDEFg@8A7_*70x;k_yGY(c
zn-l^JQF~%{IG!ZJWI1gi{{^pBlMiWL*lXsRPy$(oJ}t$dLTb_S<fgrzQVXInmeO=7
zD!`fnpRT*1EMH*mo`xV=#rT9ymm*6##IoNjkxEUCEZk8c4%bB;zkpcu$sX@p2TC}s
z2CXZOc6q!^AX$b{EgPo-GKbZJ54v?(D67X|%_?B!z%LrEX~R6=1XiOoe}nBC<wkGI
z+e)x)RDcaPw&HcXMMWmsg<Rb20*!#JXC<`3PjIW+6EvNRKVJX_j%cRzM~c_f+zPu?
z>*u$hM&1%>d6+LQbr=0!V|-85!=+hOKNc5S5zSDV(Ah213{RxAOHvE_sSHTjKVc(Y
z6@N~B$Szz?yoN3IVtrmI03eZ-)1({Yt%0rN;wFe2s!EwcWF81j0X#=OP*G?}d*Zi4
zPESZqNO!2DDT-SmLKjXXtaA|{mow8{N0LXlmi0RZP4#Nud+Hn*f-8E7eHq(hQ5`(H
zDSM(9y~UOPU+!u{U2DiKPT*SO%2&R<c{&9K_#bu8+xrXY5zHAkPmA!P=Up)O-0S6@
zce&hiua<jXbq9-FESv4>=6cYV%02H&8BY(qQ0_f06CD30+2RY5;kdZ0X^D7ZNyIn+
zB@ugKs~(=_l^wxOQ?VJwM@lG@I02gD&u14G;l<7UDvmwm8HDLtqtgub0gw*iFNrTs
zwSQC2{IEhC+|TUc5-X7dFIGHhUB>x_@N-A1UeWrL@$_j#_O~_lz~aN){8TvP)zcUy
zAIrfAbH_}JY?Um9BIM&Qqh-S2WuBzqFNuNAP5Ml}WY>v^h%^vw876QHV}fREc1RnZ
zfrag-MD9eYGu|l-e@?Y2VsU>;k>P>V0B?(a2+0Q!I)QNms!H&tc<{hA0EiFUOyq2@
zDspY6ln^*~D4||l#Fuo5Je+pVQAwV|Y}hx89|JkZc1S`-8)S4P!^raFwG4#_LIZ%w
zfOCAUu|SK_?0JfOdGi6OeoBHm_K3)&Zf3Dn%nOyvY>64s?iv_h87;VTY288^Sji>;
zwT(7i3RU>{q6IT59z+HvD7P(}ku`ecW>^m!gHUq|?6>GudWO>E0PtpDy!U2Q(F<<7
zzMR{wn4OEfAe7K=*qO|{2edm+24igR47U?2IY@~@E-fm=o3<2ak|Aq^(b`CRqm>sd
zNevMb08a+*<j9jNXLjLx6fLbhq36&3Ir-;kiH~T_6;Tt<q3#YAF*}*EUVsRkevo8q
z)P&=A-38SAd1Lci%h|eX3<>EiMFZewxKNj+ij8}N!6sYx*RbHd4dsX3C9{f+26y+^
zG=(+q-Q(y2ljVvRBY7brt2)fFT%)U^d93@kgYv6uUGXqv*@tR1kNY|`nh)FmW5M>x
zIKCWYac?%D#rxc)nPu<yvMGvUuI(6Pme>_o%*OKnS#Id4GNpMN1p{7UM;5>oEv~F)
zm0hCQHa2I%R*mx>F4m?C<=D#R2NJ`S-1|NQ!28e;{-;4~njbg_JV5l>+Wf^+Y9S&I
z3?dI0Wevh&HHEGNx@{e}Qb1_68&qpxA8=~+y=;n-oSyoE_*F6cU209wT^jE>6Yse@
z*O__G%)BQm02N@OXHC3E6JNTsw(-r`Qlqy30H}6P0pO2z{FYD2|34qclXru3l&qcK
zR3Eeb|JNTpc<B58Z?A7{eD(kTJwB9{P_H;J08z8Ov$q$u)x#Xl>KKzwBd>AuuGzk4
zc5MfpsW&#znfk$OU+Vu$j?`;kov6P$QO|Xv{_2AK)dl&h3v$Q>`EO}|)JytNr_%;x
z`hFjv(|M)S8@f-CX=_F~Y7bGIr;7kdl#F))eG<Z>r94JuX3h+n1i7O}!h+fS-ebd*
ztqkJR1bvbo-_q4oSO23WEa0EcigP1zQ6(>8F?Y5i<9KX$I>cm~!}tStqo!#ld2rZy
zvEO{zwo*WvmoN5U>uhNK-wS0V3S>QwFpipzX!4$A)N&L1hc7$rohIz4P0r1RqVib`
z%;NbFwe{UtiMKuoRyYrkKA79`f&u{oOG(Ox+<)8b_1Xl6TB$ww)^OIMVXuQ~5%qcH
zK0}Q`4RTymg^w}m)Z~~9O7I0o@i7sK-GPv{JiEyG8way#s1>)9#{_#>u!C+km<~s|
z-<xXq*5A+$p^ppWAU>|gAI+$Jp-+kbkF);o8vko^YvY^k?Na=&jR#-(|KH<te|BJ`
zufdGI^5Hkhheuz78GV%`zDg4ROC^bN#31wR)Q?9b0gCL%M(Noo9=M^6`rT3CJ<2ch
z`)H9+ev0vG^T1=gk1IWe!-?p7`OQU~1{%iz$U}V0d@=AzatX`^2<`Nv%ZfvR9ZY_6
zl)|9Yn|b%(*HE8DO<0Xd!q<k%|I{&QHn+9zaR@UrwzE3;r!?VM+R|-v7fygF+G){E
z`8o3Sxj1l=NnYH2cShl)k@lj63=4?jzswhTFjTs;R3^m<Tae*JJM}>qeVh}u8>3eq
zId3DAAa<k5wuN15$-0ehkHrLS`FwhoENdfEI_S~rC>~tImw9wfX<B<|3xn2V-E2DO
z;gzq1q^yx+dNPDz;E3V;8OJzDU?mRQe3{7spoerb{5~7VsY^#ES|ZB4UeGy4(~t9v
zE}3z3u|9-p;K1JSy*>SsJ9Yq3=lE?0Z7az(t<&E7M@u3u-Kg%B_pAu0;a+PS>zfZ&
z<e$1oy&LP%>*shV%CNB++<2%&P$}cG{^Ww+{*QaXLYGjS_Z9_9OZvwfncygX0a4v*
z@o~WL1DhiJ%3wJ|+o3O}9BieWjsPR$0c=>Z;lk?qxw2SZLz{U3cEKUjg_J@69ci=!
zjdpnbB9JiSfik-y+y2Z6FRL!F`)HwT`V}S$c26=G7)t@@<e2+VL6<Ne5>XC2#Mi75
z8KYXnG;wU1Q$^+Qn>o{`)F3-H)#S1ZpR|(#ErDK>mD=o%8Xs|;ya+E&2w1Y8l900H
zWh6kknB+su5Mcor4)Fj9-O6BO2EB*w7=!e205@p}WGHpZK=Fbyc+Q;L-9cKn&3<cx
zk-+RA`B2pGwPROqZIKoJ^HdM^2UNyD19o<59M-+3yyaG(A#w$x`d}#q-qw4BC=<Mi
z_E*W#j>2|2>B49Y!R}=irDkt5n&}!+YN|U<lP<I77;Fp|Nd<4l$I2Elv*a(3Tn1!K
zLrbZhVz^^?o02gmJHSX8)T_Z3A|D86d+cB(x>?<YUUy+0wK$=f?qdq`m1Lj{<&=FZ
zu=4NO!XBRw<NRGUYLwRGvEu+@%n$IXSimL&*CMvxbAPM;-KR7TL9syQEsZ<m*)Vte
zs%jdKM$zBlpVeo4qyETpnF<gQbS~`V?10n3#f*OYExJu@`9|e&vI`WYNYDm{psv~h
zxLYlv`%{O<iBrdH0<_xmGG8}aowvt(CnzNZ(;SEV0w`Oj*%a)@=8oDj5n)67&mXGv
zNZu2s^MD71?)!;l8sZj{upqT^n`jrL-2kk9Lhb<8s0a?LPd$9~3ek~yFI1=+wrt*l
zcnN5LTW1bU)D-NK&?K?rvguEm%r_$9-PkA$4`n%l^dVk-U~>C4&pQj)ESJVxmPIxZ
zkUh5_FSzA`Bs{$Jtc~vZfaowPDuBuva;vEH#^4peN(eB}niczKL<L&1j>TinEbWS^
z#V&P7sM&EMElO@r!R_rr3HevHf2r9x!|`=smiEI(#*@MBMVf$qXrd?9QLk8D;m&#P
z{i)D<f4`~l2WDSbc-g>Id#bB)j0zir0pX=!WjUJ9>Wp&v%vLCTOvQUUE{3xj0wd+h
zCcr^?NEV;s%aD*1k67tOMam8@0NK%W$Y^Tiz}54E)%-Z5R%>F%#Hj0MOtgXVG%Oud
z)1Ie(KoHzk&0Y^T+6e}lnN2o$K;GyvA5V5B@)8R4xM$ehmdtQLDgh8}tgma)3YdD7
z>rxQfF5P8XVP6Q=j*@aYo{VhAL-o<1RHT9K9v423)$-PAx}ke;&fkePl;>a|>I&a@
zq1o)yC{R&q!v5Re@4RguAE1Kg(VT;I#s^wCI6T?gX$26SrU_85(Rdn5&y9qSWLq(N
zfJcv_JA)~Rg-hXcGsvdb?;G*bM?XJ;j1_Z=jr&n*L&ZZvTyBW5Rfh`mnU=>fH_btg
zQ3)W#$MHJ7J(EAO;vL1wOAvq*JCt9IAF|y?Ey*BZDJ#TeMOS8BES{<n=AhY|)jO$;
zi>j=0O|pnwl8;1|%Y8puUX#*@ai7l{@-AduI&10sJ<3cLNBOymXh-`Ftp%8zkxv~+
zD|oKu=&5Hp8PcT+6}w2qCk3|!J1(-%j^eVcT5KGvg4lTo$fmolOU(kJqH2z<%>RT^
zV%ShxVYSVw&f}3mg1S1BdmFPFN?3{+ot5e_Ez~}k%B9KvSn2V?gaSXjE;G1VM_Q)R
zi#R7;^`n%sM4`&@EN`qIH-rN)hEsN296|4W<<*iamJ7D7;<M5bO8jRN($S70ieB=Z
zBGuq~ld3N3zraTJMn_WG(X9v=Pt)v(spEfTr}<(3<Z_(UptTNi4KLb19qiO8Oq_OW
zD&h%8!7;~40rD`b40PZKj(}W`;<FfiZ~{cd3*%8E1>ne0AYqw0d-h~<<)~+<B#4d~
zhlE{r=>p782r|BeIkJq;lleX!4049}i{rPRHU-v#q7dY|yLV8Wg%tE<AzJL}_bAv;
zT)^IWtWLax%x?Ve0(Lh_CKDYhz!_!%;5)DO_IEocKOMDjC0yB4Ms7FUi16BjG?qLI
z7`l-g3@@M=hQ<;$fkN73I-=Mtwk$_&AY0J0c!C-V7WK#(?l@H>1!sZ)s`>95?Y)<8
z+Q%D&M{crlCZjlVC|6tEz^t_lKMKzP<tsY-q~JhGR{NyW_Z)OdQo80~;N<apD+5AU
zacjiH;{+xAlVmuiNWm3DLTibFa00f7(Xs|k6y$$9Xt#ogkRpi~cM9*DDEdrp^v`=o
zJJD%UTqL4+D=spHq3#r{+bWIUJM2iQwRRLQAiqc@rzl>jFR?I6_c)hm^#>e){cM!c
zB{zC61HDDg-Gp)2IXrl=_Yzr(VLY<7CGuQmpEz5D!O?`lPYPF!6|>tMlAXgBF9dqz
z@NAlT!MZlfkH-qPZnf6$)ytXfolPLTcVp=V8o*$b6r#5_<>B1);neiym`GOV*iwg0
z;G(DY8zJQ#R`dp{4nY3r`lceL;YGOHh~LGv_9k4u2Ow8sg<m$TlL1IpNw3p8ttdc?
zq1U1kk#j(!-gIEgj3E+f;&_pFvDJ`?NZ>vUdNp4WnE`QqTt@u93Ni~lpA;3y%x;7i
zy`Nt<e>`fQyrRslw39_ma*<8mv0ct28pp*s?Pz9}hp>V1cG8>#DEucE==x2+={o=-
zgRY&W#;gMIFliiuXmEJ2|I=@9Rv#U;4tC+o&T*@G(pcYq@W6p<)qZ>G?>FM>xMP3&
zur>~6i!oTvk^;Wf;J=2MyDjtwH=D!lEs4z#1<EBOAPNYgcA&XKMgY*`CAU5=EZ;yA
zH*qJAYG{l`T}P7)Bt!)KoxILl*{L3asLPGwO#jY*9z{#j(YsN0G4fjpQU^W`h`rk3
zr1xg)B81Q5yh*AJ+8;+u&4F3M@X(9!0ztA9+LRkUmGP+`Li!@k1^7LJx{mFo_)V>}
zG8~_d2euY9N4#F<B{pbALD?_ytfP&qvRSSzRZ&tMo?8Z?ql;Pm2}QV4RtHQ1C`wiz
z+2@|ERpqW@bv^t@-!qc|K|De=!YQg7IR3ZTA*6-qHXQ}6%~=>U)pwh!WSFIUI%^p}
zdx0$Ah?lQfk2T=gGd77hbyYxkn@#|tD0Q0o13X__@&v^hblu>#n!PmSp4&$KRHMV0
zc7_iGKG=u?c>@T8XHgnbOgNBt?1Mnf*+OUv3t`!14ze>gCLm2^I_hWmg4aQ!3Hi_}
zZ+-(L&APrt<CBTRSCexL@e;>{IS?)kOK)q$V49~1sd4ZwPpQKkQy=S|2Aac=3Z5iT
zI_2Ls_f9&;Ez~u&N(b_MuEb|L>~oCwGci>h>w=CyGK$TjU$ax%%VZ~%o{b2?1&1cg
zc$blm&^aZENk}tcv~U_z@e+xPY?yXmCeBgk7i|O^unxe`>mbH1aL6%^;SttwCaD?C
zAWUq0;yJbF%xR}{_`Mt0%)lM#M=F8MNj^=k2y^$wnb1Mbnk&L)COEL&z<!$DbA%HQ
z*i!K0PsZAaj*^QB?v063GV_MYFVSsh;A|miWkNAdER`qOcV!b%M(b+83gsMwV=^5V
zsJYxL#58S?W$%zhKp`}eq!HXSCq{8vkIsN080lhU;H+%#G9+B2K;!^dk93L@7>&x;
z!d6N=m7JSy*ykwFgw?Ds!6vmCxkT&4<Mabr(UGnBI}GuHQW3i7Mz18&BmgfKT@;4p
z$pBa*ghP=GRr(hSL4$e%iSIc<za+NWl4v0VL^gy>&KMvu;qr8l%4GlpUoQ|UpJk3R
zl@Xl91)6R#O6$2u5&#PFO4qPzUU=*3Ym{vz@?v2u0-*u{z**sh4z$$6-d%A>NgJuG
zC3R2PYb+1uMYP{LIDw6aR`%&=ngq`wYm9%le>`#&vevDpT!WVNuoS93^ulVj^j<~J
z^9S>|bX!qk=|!odPBF31Y;!mw-Xs_eEuHxBeCha4`ixuS!KG{?QUMX7HB<mN);nT|
z)A-VQuYw(-J>VIoUFXJA<i!d%khj`_e4PcjJthKcOm1~b6(YyH-6_hFpO)SV!%9(K
zIUbS{Qf;G2+B-5sHK6i1SpTZv*3@jvGSurP%Q{B6a;15zglj&R#@Qh4URv>{mgxpJ
zPrA!ELA0aoB?Ez*1j7^FT}VkzsW>n^x+sLt$VQE00(y4Gtle!$v?&U-hS!DgL&)Vm
zVE6~wJezfGXhxLL1m3e+<XOa{OIX`AYkq02FRO?m!!n$bdO5bZYqG<L@sdhM89b$t
z&_toXX1jSLfpf`~baKg=Jh>f}IERj}ok=!=$*a{<3!(@s0F4&Jg7k(EGe(9<au!c|
z6f0Wv<7SpLB%G+@vr1eYvUB9K3WxLIap$;s(u%g$BZ^LjR5RDAMWUoRG5}}lDxLjD
z0}42znK;}k%4pnsiA70A9erP+6-C3G)S&1A3^lr!R#YH~+3M+uN>}cvXCYQS?c3sD
zPwDcK_kzpT8shFnt&+v18SC@$1P<41n)C6d?>{=|4f0dFwL>RfL*LBUO>|i|Wx_PO
zeNskV>K9L27%%FsoCZ*3Dr+qos9f!C?oWC^CS`<Jh0Ev6!j3A9cJEN5dv43P3T+WF
zRfseDNbyyeN;~8M!AloZrTDyEsrjsEK}i&t^(ZKNc-3y#0>~A(^QxBuLZ4-L5=<_+
zUF!f0rP2x8E`GAGbs?}B%kBk7{rIXqp!Vptvn^$lyk&1bWSsbTb!a=K04vc<qyaW^
zNy0RJDamBrzKFaaRMSKdPX!-48NHFNQ*cu>JU};1rbK0Q^xzcYf^5hjc6Y{EUW{Rb
z^wj-Ig_#at%&83@>2S4JnG%AzX9BYtrB*PeqON0|fp{c%_k8we{;0!J_AIm{q-6ZH
z0HgQR>ikZhM4J_mdW*c)#Mn5ZT7oh-!b-}uNhYS??E6Cz=_$r;8DId<5nW=*x@)<C
zQ7U`479GjRgn0>pFgShZ7e?sSMkjsZzb2T-j}PoK#Vh8Dm1I2;PR;EM7!N$5tr3?7
zWPz6OK9QT~d-rCju+%MV6HA^0dw_UoGy)WQ`5kkuEKqT}2z+rm%`g96Un9P`tc%p4
z`h&})^hV-Ui~x2(iN73NKFBVB23(BTi`Nmp%POmjn1wXC=_kjt(b+)DY9wrf@QLy-
z96D#y7{uR#Y#&LHp%hly+*QPBWcOK=^rc@CUeP5i8lPY0DIA34=%X5XD|fqT&TJUo
z?ZWx$S|0F~z-fZ*p(+!GvnQz!F$McO)tF}fFifd%6Gqv0agIUPrLkNoRS~{pikAtb
z>U03Iuxbq{9m>*V>4A@eGz*xWWGty61ALFYDW_Dnq6t_1BWx9!YrF;mRb-QzJd=W!
zJgUWEN0HZXN7ASm-($PK)~FZm&BdN>Jf@(t%KM~XnT7SNvWY}cdZeJKFaB8M&<s3#
z6slVS!t{oUIe_RHzh_f`bkNhtN4GD+yQ^kd+lw3B4>iD9A`QkRI-3dUB6?gH^${d^
zkyAWgOsHg<63Ipf@K+5<yj`60*(4rQDyaLwWfJ`G$9OtHW4+u}#mzVv1?D<z%wGS1
zjP7eouw1JI&{csHhaO&PxXWanAr-e&SM82ry-M(}=<SLP0yRuZE!|qMx?RyiOdT89
zRt#or)IpE*aVcj!Moj`aYoMYqhcxU}r~A6a+y$-g=2HTR>8@octr#Uiu7iqP$BvuA
z=forP!sZb7DWR9heweBzVF?ri^pLA)r7&5=yagDL&=@ftNmbjWt06sl&xo*M@|7&q
zCwK0dIY4>YS*gf89A+Ug_dMiuU7D+H2kBm!s}eHw5PKC?lT!u;Tm4(MODXeK(X8ue
zw?AK-u535yZ>24FNIbgM^xBpkF`H&tQ(X$qEbv)!fuh&p>74=E!!6zpdypqRs#vc8
zZQxVWfqCoN&+8g>XCABS^XXOz?EPXg9ie-PcWPJ3-2sy*ySW*wh@ap}MoT-y=%I#T
zl5l!#Yi;K&!II98#DeLn*88qS5>W>E(+M1s`TWKTWRoS-J7R^={UiNJ#gYd|)%;;8
z!17L8U{|@KM{uLy$7CKiYggxlBnidcVHp~a98FY;EF?v(ZiwWf8CHGm5{>afAD9tQ
z1{vxRl%y;!aJF^!Y|7C(IBXy7R1w)%<i{MMvsctYHTT~(e`<%aB`FCGY4&@{@Li$F
z<|YjI_<q0_`qZtvTn1Ri7NXbXXmvWhL5-4Ch-%-lLE-kWZeDNb8wX{XDy!2wmEof;
zO2*kQV)PJGR~>$PoT#0HD*=aPLN<|A94Rd@MnM;imY}t>gp#6UrySACZ%vI`6yE?a
zwnRXQlddu-Xq979?4pHF;dh+1pndKiuzG=v&}$ZHnInEIuSKm7bTX{1m5eNKI5j(y
zWpLk-jj%NgywOy$1xldrRqzk9Rg_JSXy<)k;r3K{!r8hB?^$3EkLd_gu*@aKL2md5
zza?{VDLP_GA|=i*WgySE11CEZf8HmPl*ubbS2VFSm}Fd#6P=<JVpS#B>8rX{s5I<z
zPU3;FGSMxSk<O5^&3Z6}m!>cQ=WcIuj+!`l&!{V@T&JFlst;l($0=b)NUh7HV_9x*
zNM(R{ug?zDx&!K!vxSAs*4ms|3Pn0~N3}M~1_OkPLX015Rq5gPTwsPph63%CtuhR}
zXIZV_XUX5Md}W_w&>Y|~_;|+Cip#L7&flU7+iqBZ^@XTvoKWK1ak7dGf~^9ROqoc`
zC=+KgLfzjQ`7jUT59x3^L{*rw8`dkZf;4ax>rf^S-eJhusaysk6~S=om<5y?H*Rh5
z<TM3JJh`kpvU<f`);)L}zxRA;S;Tu1Jy>6N_K8j|7c`u%%+4Du?ZLKeYRyY<OW%$>
zQb67%Wtk`^`#=m<nQ5aZz`3m|`!sWfd70#fq8J7G3hQD3&JwT$6Z4dAgR88MM#}Ih
z8!3}l)SXo+EA*_D##qhgNc5N1wT2U+Akg(f{0ODr(oP8o4Ze`2s8xMDXyhUsISjtg
zc5L_X*43s4q(eX`4U-}+<v^XU<&!b(C&hBEZfDLCNhGCA1SQrZ@Ea$YQQ7iq${vFo
z${y9cbDNk3(E{T+O*h<p@+w~oyE$wMAkBB5q(URcosVNV=cBk^s1&zKMn{cZy+jqS
z;uK;wM3{vc19OK#zi6^rk?wIYzCf`w3p6NHIBd;40i(?4_{(3ZbhXM<=)`#Y^3Z&p
znnx_YtY3@KJ6`i5+Uj!NRdOkt`t5m_jX_64-~T2slIy_j(={PTsUCZHC|mw2lJIVa
zZ3-yPb}yI6-0|eB3tUKc`fIeZ0zck6el1RNAsxv3SN_eFG9jlrRo3!~B(N%{$#Sw}
zNs=rafWQr#2xQ3e9;^IVFa;+eGET|l-=iY9S!=(Nt~2@-PF3s+zTLZLFKx!IEV~IR
z_Iihuny-eC`1#jg?8r=de*b6L+E@$CQ5b-1_1U<X)V)RnGoCT)`7@tYibqgAo=_c~
z8_Oz|bSKA2pEGo2j`m#){Gg(C*&@$dEraNE1Cr?;V+tI#emvSkuO(&o(qMBpv}#%w
z_3|=FQ7PZ54AS?^8ZUQ;y=4(cfJzs9nG+YPA&OeYSBWY|G5bc4Ij!#3Nros@B^ja{
zLDM8U=BhLZX+|6Ekl7pdP@0zxtHw6KF&R%J-84^)F`Q-psC=Z2%7FD)xeA6Ep8_vF
z6)}Moa5zIrT~Hzftq<dLk~9mO60o5w2YsYNQ(i_Z09r*E-X)jnt1O2OxuEls;Ynx{
z2HHYfzZh=ob^H!c0B`(6$At_#^ju`Xoa>7dHV6o8N!2m;LFevMRb9Pg^roDx8|&uM
zaVHxAtt_;qBd^X7eV<i_NGf=>8d1A-()zIx>BX}+L4XPL0h}eCM+t#b!Rxo*BIhko
z`s9OosW(rciCC?OA4r5|x$+c)#;n`B%$gIUvcdzx4|^_0-lUG`?=`11_Fso5<;~n{
z!+sl_FUWUn7+7;Ci$in_GSEB1HKNY>IVn%Z3b2pO`we^#m~1`T{DpG3Qc?~g-;8T7
zKpxZ?_;5_-fWq=K&Q{t@TMcSmDmmkpUfoo4l(PPl1SReRW9HdfR_{(qc9(+8({s*n
zbF^DoeWS3TCqcb-pR+We2o>roIG?tdUm$fM8jcs+qR=954NYnB!_=0Bk1`ZU5^0`K
zQA^ow?YDMLY~mUaw0JI_-Js>FT=GSQcfHe}w;%jsyPc|BfAmrv#q<NS{q>d_+>Lt<
z>vK;k<4P{AY~tbff41>oo&f#6GnnGvJ2@YX4%1h2La^0g?O67w-uX|EJ$4<kd4!HJ
z$CufwJ^^y2*c0!#yD#MAzNU@dIcG^>fz9HdKa|oG@L0BI!`&U0IN*~PH7gMM5zB$c
z-?B%}TVebG-oX&u(3$te037I`KH*7++4}MR(U0bcfL`3ajg~#*_$)3s)aj6GK^5y9
z(bXNp$#!PlG^h=rO6KCgu&OV6P*c)SXC&oWCf$jM=qc>156Ct_&uq)IRT6%01J-q8
z7}9WDlVg}q#%O8$VX0&bs{lnsAN&%MLhf@wY|;mk;}D%a2ty#KlJ-;a9>S!I+yfTS
z#4YZgS*fF1uxfISXR?rI@LB3|4wq9<fS#0=1+P3N=@|yBrS8sSG@(YQA||tShoi&b
zQ2{JzHSMLOVHtGD#7Y+FpfWSR$R?;UCfhI&#0pxdHE%Hpx<1GmL+$PY91qv@3>_SP
z%i@5nwnAKx`jk&t=e2WKSxx%oc>JT}0!Ens{O}jI6ZM=<WI3C|B{p=4jfxVRy2NHh
zi7orw|DcY1ztn@P9rfz7*pdIRA>DYj9dMeF%)75ztWy%*Ek=Wy3+sdLb50++vm`fu
z?O(w5kBrbtKti!hVpV$A5_I_6<<x~JyH1N^fkoxs1BmTAuNBLc8MCx=D`^3zUw>`R
z>9GI^jN7ZkskO{z)Q#SWwi31cA(WSu<x!;=8X&bmowdK0@8gwc%16VxDyHViV@$O&
z&hnIqBi%Gx_N3bB+?bzL>7Lzq9S4>>K|q@?61;acW|?q`fr$bb1^2UD07`CnR%C(P
zxB3^8PBmG}>5a9@R(NqMj1k9S0?t!kh)c+nY-Ibi$2zL8mY&@R<SJMfL7i?TbBem6
zugq8ID3uxcBPx{Z>qTkKb0Tz=!#U^`sR(QA#x-84S1gCRzTrEYFBjboZDmBwa${|)
zh<1A;bw8*`O-$|sq_;>uB;Bb)E?|3oC|DaLzM14DHDZ5j(Y|Qgo)U6ezF$n^F}f(~
z8@RDGE03jYQOU&!VA!DtZiFhYXdvcp*Q^$C?z^Y8ZbO~6-PLC)9_c&#d#!_$&fYF!
z2VFD+FF4FFC<<Skrad$v?Oy`UF6Ww5S%a3=06-&$m4#<yV(dNp*EE@2h6O$AZD*Xs
z?~H9Iydf^yd+^?GTya*NQfd25sTw}(0E&0=>CmYKBLT8#nWADQJKnD+4kXkq60?Dp
zw<qi;vaKJ2AgYWsR-B^+0hf@!Wqr*w&fX@<=Z{*mohYQ&A*F?*GOB71PCN3!uW5(D
ztiUBCKm1Wfj(J3frXz`uU6_uWgFI^}X9uez--(q@p?;<(RL;vIqg8JGXi3yfwC}2>
zdU6W$cH?usN8Taa-}^K}BHdF1)aXXpG!6dlwhn&cu+e)5FJ-N8{g?_y^rp4jIXFCM
z*@phgY}(q09JU#_hxdu&o5H~q*a=3GtEfpRqR-TXhEBQ&zQ&}W!L;Ctlq1P0?H??m
zVx6@2n?JNV?UUw7i({TVf7zBN$0v{N8kfPGDe7g11J^qH05=!rrt1vQoVo+`FrW)X
z`*R9j#1!eJ1L9CPF$<I#C%|#^{N02u>7kvEv9jUWrhY(1V0NK$t`{|v2A(!d29NPK
z#ieyK#OzMTex=@YTu}$J<nXK47+siSA$DD*SJzT`LGLdBN4QE8$VJU3z;<-aUn_2R
zgpBb8Px!7vsFAtZp?o&#aeW5K3XipNoazL(h^_@smDERpGW^QM5futiuTuc9=H;P~
zV*+K@ovM|*XRN&T<v2w<BW8OJM{JP_OcmPaxIvlW<p?u2#RX@D;fwHE@LYz9=oqoe
zDWB_XjN~^**BscIHoJG@<54)0?CgwU=Q9I9%x655;H)}OA2JA@@|44QsPJwT2Yg?z
zD8uT--hK<7;)d!|>^&VGZfT<In{2HtvF1^JYA#AMU=r;BOFkPfE6&n<Hnzw}*6();
z)RCmU&UD-<GRAQ9W#sE)V3Lq(=LO}SS{0WSMe7j+mIz_D#&SxBB7XagiVXAm&Hl+=
zs4dL~BT$&CED~2!FX|&dke`Qhw3|_ugcD&_&`ta}#t=s269ePe#yAtinGYU}J`6)b
z<rqb+BMwOy(n1H8C74MJ5kBf;RbIURNM(ctRA4qboS3iFq7aQnQl865#0-5pZiqO8
z)i7rraKpsTaO{XaSzDqEp+!+GE7A_?CYTk~5mNf(M5v5k0MQt8Gk8&N+|5rV{w{eM
zp04F$QRjO|S6SXU-b9~a-O%R{Z~d{gsG(Si`ho($o=xIO3S<RlM)BP!Kw826+qj2Y
zKel$nx)%fi4rWK#tbnJY+T+<NGQ;vDQIdET>8R4)<Vt~1nb>NIq18%8l+Y9cR(YRg
zETTnySaD5BqT}7?l&7AeY#$xBny)!)lA5&+Y(YGYMr2fJ0wzLjoO?XPK#C}B5z-)H
zTf&f<yB3_V79%0<J<R&6qXsEy&^S*}+$Y6D(QQk5hPpl++|qGtcdxzV;2uH{<fF63
zM&n@v78h~tAzn;i?w8@1UP-;iLyjo!-8UR$&b-i#C3#2eFYcOk$thpbclWUvLU+B<
zZneJev|A_I%!>j&;K+cCR9H*mVdy~fD9&>S90WFr+u}O9O;TvRcUl$oRC#zGGi7u7
zF(&bJ=(@)3SD%)QW)FBTjP^hXcNd1%aJCuQ#`R7SE05ER3j`6d!6g1RTj(xkF2^ow
zLd7-U^nAUj?hRW9f%|X*qKI!j9G+)TYdRC~ta3yWtHOv9dangN-PI1n%6wRHs4+8g
zpw!2$qkYQe9TyFKVxC?)!Gp1#Kyo-^c=fC4yp-U|T2^zlYaVI?t&PoZEzNjNnwB&8
zV?C?5Kz2Pq+Xz2Pi>d6Q#pZ_o`WH<#VqWgu<HR=WrK=@bT^-V-UjWNOr;)eLBG+;b
z7INo*&cbjlT<|q1QTE;DIoFD7Ch6`d4Ae)OW6MB`NL7HR(Uq_uj@WsFpHo20ckb{I
zFH7Yrkk}cT*q7ZV13KB?{bAwMQ04H}1dYPhm#YYYXlUXhOW7jLBLVdONwnd0WTV5r
zIy2Y_LfzXNe;v%gJDu3ly_xt5UD-I4QdC2p9t}}@rM_ZW0piD;u39xkqFq&i_i{&M
z&0rzhKbh)LJdvz4`o0hLU&)b$MG1uUgyjB8Y<gV6Azg{l3=c(X!T-;4$R{QMgkS0G
zMF~Edj&W1|y1Ehc=nII{rn!LgVqlDAbjME^-P9+D{kocu&iHXXat79wrdU#%YfOLD
zh&rdr0xDwr%P6C3y%JEEB(hp`lw6?3y}jFpV`A@M@5Hm5Q~<%z0He%&4L5)#fxQum
z5q4z~(Vr^>VEucpYxQz{^1*{z5zWiW4fNsj|LR~4dpO+nbo^!5P4jL%=|wxo`(^J^
z!x!Q<*_;Eq5M=Iclwk9_LB@4p-O*BU_6|m3jRB5QRN~Qdbv-H9-fUv)65rcU{+bS1
zZ#V+ICdbQn@@0qN@-;94Pxcz$Jyi@4KLKw8X96@|E$5LwLE8@nRSlLl!#!k<r|x}m
z=sw6+A6r1Tk%bq)euAcH{FL|{d-QfOR&?K0if&eacuoagM`DO{`zfi_9YaR^xXb#l
zX);Y-TL20pWsslMeO1(P0D0o++0~6nRwy@NR%lxQbkaiDlT`OIn4~b^U_l=%m!e&j
z)tS7(A1^dOy3)a`a&`GpHNsizCN~hlj&}wL+8U47^ae&78;UAGkYO)uGRS&=pQsMo
z`b_hZSEeZ<qKxtkALRueM)DLBehvWVCn;(wTzPR(GF8UznHivw&+aHET)hjG`p|IQ
z!3N$Xm)rmaRdUb$UUE7;+r{S<rAxXRR91{Li8aH7h>|PNO$cAzw}5*j4VFBUU}YSC
zRNt2ExiHQZaTun(9!ry=;kl2xpN1q#r>M_4c_zm?$dXE1$gyQ9C@AVxlJ5BkV~Gte
zl~TFLx*3JemZ<!Xly!rpMUo&F<Y+%qX_$H>PezPhtWa?kb90E!6+_A&Cu01qV!2t6
zU;~|)Lj-dWQ$7l;)pzluOtVc%Iwz+efW6f#&1&IJ_U;j#|IbBF+#uKW5gd&s_90&%
zsG!RjzSKl}@U?*6)k<kw1axwamR%{`vayJT`Ury}Z^k_+A~|_Dd1<Lto$WEs6Q%H+
zsmr{k3e*Wte@l3fN1COTm>7WmO7c{;jtvQ7cur9a+3iIIuE9;^CP3A4tLNxu0d^M5
zaXjRSis*3$yme0{*>&hyK$RO-4!s#kC<s#DCM8vo&$-MEyy9O25RwuY-x#Q{dY(vg
zl|@g8e$KnuxPAL}^p>IV$f7M0$;j8FlExLPlv5gn+CAZ6*bT&ms6L}RgTa)Vnq_s)
zrswu1_XxkU{pmsg1X3NtL93|k2C5@ll^R<-2oxr2mx~s~0m?jy+|wIhBUl+(XO>Q~
zD8ux#!f4Hjh~;=YIapw2yQD)>+n))NIvfXnBugecK9dWWEEC722nk$nCKi3+Gaz-c
z8z)LM%dLam8Ihr8`9_n1-W~r9K=(>Z9PD68>6Yoz7-PSiYrL$#if>l+e&>Mxbcg3-
z8-C~r)Q4WRuxS3hQ8Me3*edd>X`V&zW>VO-=%;LoT-qa41QNos2`C)lQ2!FOdq(A5
zAm@hgTf0w+<kc?TPpx8*^VQXU`XPFv=*F`(3?tke0LG4D&fboV>9|%nmgVv)EF<UC
zPtT@u$C-`kj}=4$gQZ~fL=(<ctMBz;aErA}kHlqR7#CiUsXt(Cp2NwYF1c|)vyZ*u
z%`HR;I$zF~RG6nPVoM70M}m$wIz%7}7Nnt42|xJ0_jEdVr}cmn{;AKywOf|yAIin!
zLEL2%)JdAHb+wNUEKuC*<u;a`1KlQ{wo&&|8=F9_w`}1%cqjTYybWBLC|^AIN0C#s
zNGC+%G#<XI2TtQW8H`~Ej4v^e3P-r8iR*F(#9!OPkwvs;_^dNp=+qz-m<MBsxv^+q
zNUP6a78&6mP<+(zwGMU;cL7m5dj}_u8x`}Z_B^$##H7KQfT=;FL9)Y-_wv@rc4t9w
z%xRuIGoW$Rtaepb-Bd=rp@lk%L7uB=Et#N#ny*ebDBGZg5l=1clX6L9A@6jGAdX4X
zp|r}k#57fdndgw>)wCEbHKGm5>cr+#23dG}>_cNgT(LZ?v$Ais&Q{+5!4?xOvB@Cj
z=@unSR=48GW;53Kzu)Zbe80cfc2@dd)3p1JCb~lZf@DSDeq1iGhkOW>f-?Hq%Y+`s
z6nrGb&=SpkHmB^oYBhK3fo57GG~i6|UrSxX>~l?*I!Hbg&|>2*6)fE@k}i@#Q=w5N
zHN>#jQBbS#7mhe9x$Zjf-|KegsCC@gc@2Ef--8TAWrgSwuSxh)<+hF9Y=k&zEUzp#
zHt*?i)ot%g`*S<EH<pf%-n3tl3B@Ay6uLD4#Q=h(3T2?-M=yaGBwFhm;E?bm+j+hG
z){Bf;j$%ryyGCw-Rgp=<pb%BIRlmXC^N%HD`5k6f#kQ6vV3AQCFYa;}{~s~v(rVnh
zr}xy1U7|^ncW;IWy}BB@<(@x>#i%+_s4`8rCcW|aN)(=qDsPCux04&9?=UDN@1&|)
zn7G3MPDVnmsY#la;(%{Iz=+`kKslfKVrD1ueJ&(EOe0P2-D}*X!hd!O{JW9hc5`=k
zsqx@TQsC=v;3`t1mN4A%m)iOkOE?R4UpZ)t@edSzh*o;3gha3zjm*Ef!~)D#tn`u+
zTGx7sG(t>8FRhbtTgd1K4F!NinLfWyE}?qBLf|Xv&#87j)JL%UheYq@54!LKp<g9+
zz}Ir-uqzEv56(RLgHGR>LtapvN^bbvC5z9SJ$|Xl8#{zQ!q~1VVEtq7$QQ31uit3p
z;~*eld1Vp`*Rhh%D)T-MzC>`mckD;a9N!NH7QxJ>coma(vx!YFv1^=rIwpA!<Bill
z4jSvF%L}=fr}B!FT4kJOi0DEqiA%GchH|$dUn+F^37XGHJJKbxFa*ZC2q^d$ZMWdx
zfv;{R0N_wR4xmmOf6-WcW2gTu6n|y&sx<!}e;IaXmv9<7r$wE~>>yTD;Zv|}U+g5b
zLaeIn=2{XVVQ5u@&M!b%wXg0nrsrj2u0NQsYkyy+he%d|4CVncxB%n#F<*U#&;B^p
zPYCCVA{<iohj_qczfz6gi)#E4oT4T%y#B%IEy!9r^=^XA{0lRe%nW{9oXO;r@kvSn
zjgZ;I*kTe(fJ2NaD?PTr8C*sx$R5pwEy&K}{9N;$%jc=dhaQb%;3teLC<h?G@>rcF
zX)0pS*=4$*>#>(<9|IDgk(tUe8msZeDgYYVip3*IC@%9r+WD&4e%1ND^%EA>zkg`%
zziF8`wR3pnQ8rp7$5W40mXvY!_0=nwkXp2z=>*n6bImwcR6-eoe4cV_Nt~|s$;Ui_
z>1T1obQJq0jwOZ`O1#-agSqC96}&B!*xx^dE~$tvqvj#zUl{Z2AIu}xa6&klM#NlV
z#B5?je4=MG1Ml4(JL?83vY7-LzHPeX`$^2cYKzQZ?A(mAVD73@@K|G{dl~`;qQD87
zKWK229dpBzWSzUpTFM%H*CaH!*=ZB`yW9}5s|b<Q)J=(x2#AFx$I$M0JYS|%)qJ_~
zJhfh;7pKv534lZnQe}vlIZwq$(@XL)o9nn4j^nD_#%FRG6<o%v*X`Cx)os|qEJpe8
zRbckdwe#y7z@7ue?ODVZ=q~I+`yePy?JD)@;HXzQC@eh7fF>)lrf1LY+FXXiVF<`(
z4lu|Uyh;X`uapByuvVx*7i3xfI-7W$VKhMs=IYvws0?7nu0`V2D}$ZA-Do-OEeFj&
zxTC#YMLlx)9j%zyVoYudbM+!o@duX_?1w}5^@l~x1n_Ds-FdTm=gm?h?X5l==JY2|
z{$=PUGzL|J`$Jk*e5d?WL|QqksmBf_R-;@DtdF8Z5$qp#_M3aJ6}h(J=Oa+#9=nyQ
z;4W+td76;(^zta~zFS7e3<Yig%JL+>0EjnCb~Z_0jLorm1~Yn!@gf`i9GJMtn#8>{
z-UF6vky8cRLI#a8!%s5w7x5ODr+dU*le8H+B(Uc~*cxhwgFSFk-$*~{5SPLDu_J?x
zR@AT?K7&LMP~{JrJKsku2q{h1VSNPXPhb?!q9@c5{8cSJgER0++ItqA?7eP9PwddV
ztC&M%72Ug^`E>2Lb#naE&f%Mb6Ko0g>$B*;-n35up<f&x@3c&~429<^W;H)x8z<Zj
zH2k|7!N}dT;vm@AR1ShJQT6MX6M$#F)Yx9EqH_#ftt+#j&O%<X6}2WD!cXl?_i6pA
zKv-XDY%E+yh!m~J75hQ_A)$VeY8DTR=(_r>mtg9S$t6WZyK2`48<)@{_%la9_<YqN
zF!nEuYNjIX7vfSv^{#q^*|hfM@!^}JXa~cuw{{K>+HYRBjw!$VN`L^X=$H!GBxbh6
zwPsJj(WRoVWS<3cEHT!L64HgJXbTTEMfbiK8MUl0!(gf;mX^t66`iVB${A#ehHwqs
zaR&{!zu@lsD-*hF-Y60x+}v%Vz3Ju)gwp$puh*8-QHhCp8hT9W`)YUdw2^bn1Nui@
zx|I%CWy3R?4q?*`dbxEwnXf)m@%9X}FF9~W5(|d5ERUBm{IOl~kImg(4PnQ(gf;2z
zkWneWOGCbkr@J0X>B?NKUmO(|8S2+n;)6+iNkk4EL5ch4?412{k{3k7?9Ym@-wm<M
zrm*=b1;gT&$manDu*#~AaSY9v;C23Bh<M_Bg$N*Xw6?a!Q^0($ejp$9nJLC@-P2%T
zF}AG9u8?DYoS`kR7GoC?l<m`guGs5iWj4kYzNXHZu|`8=bv1PT;jy|@v=Ob)B9^;V
zh)>0s{8P!!AebW9N7xrwjd7Mcy2~o8yQaOny1j}(DKjqxxmDfT74J-x(vZev#<B2y
z$il0KpO8o|pM`HosuK>pk&rsH$6hyo+;1HK;f0BI-*Ns?mcOm2icF5uzUgX3>-EJG
zB2Ol1JV-xE7<#)dJVM=Nij)LB(DOV!9XRg$D$p=*i3p<?yP@QIYeNpiiC;m$hVL7X
z4J>AE{BNq2G>h%?#rJqc!wh5MFBYr7BEy`rj;OF$yB`*5SIS;u*(&AKLfGtLv5%O3
zLWm#REfinbof4O#!Twg{sfj^D(w^o1FTRE3bVH#P;fVQhx3w=NU4QG!Bf)`16;{x=
z{KZ=gCn}dL=Qt=GL-(yKfqAesa8;00pp=Y`v1AmHeXH0yX3lfh(|Yw;mmfP0K=B97
z6iuv<1Mpn9p$Tw9rm9;4omsKK(*I}4<(2Tm2M-h@B{>u;@gyQMycF?*)MsnR3c1+j
za0|8!5t6E~kdb=qW@aMD0;=nv6tQ?E9`Zt!uFPFH2N%E)Ib;4)dHz)*ECH{CwCYnn
z@(5E9b0?uQ?z34L9}`}xGmAA&x#3+k@{>4yPEMV<4#28DD=cCA(se}AuqBgUP-vXf
zL?4nIBgJnlDASfu&)sDm?B%gvKyNpC-H>I_1M(@Z*?n9-xCQZ3+J;m<Xi{4x!_&s3
zYJuG;>%x&@IKMmwP4)oX;DidKG70Me0`bI1sD+85|AmoQ$H|~Ne3`B`OVxq<%G)i$
zhUR_D7Hb%F2aPP)TzIt9kl91LI$>tfD>|dpm3UBUw$d&KKc9k6Rgj%|wmkTe<aKt2
zA){z#Qx0>Q9l_}?cvJ3};{W*994c&3Ff5(7`v89e<j3BCP@>`DTeyPSfLOkA|KX>+
z2eHvA{Pk}bc>6((irt5wGS0h~BsYZe0gS(9J2W302H&B4?yd<hQmEu#V}F&O%$}`V
ze#U%F!SYO%xyY=^`AWeZwP`t}5=nIA_D&JQZ3aygdQr^UE-ZM9q|2B>%_JYjY<_ln
z2}Ptem8O;y;}}|uUb7XLWUTva4I_s!URc9OopYVN!zj%dEIeLHz!I$t-+S6eev4P=
z@DeZFhwoRPApq>xWN&h~!z%q+nl*++gIPc+g%LSTh^*ROD1rmTw%*&BUw{-~FooiS
zO<=eW4B=^dpfUzEI6H~+*s=P9HykqR?*Q9J1_e&SQ4esXOoBL*y3UEkBLP5fiJHMA
zg|iaa^&|*3UOLAUojcs*q!SdnMd_9(kjaRuaV91^ERMjA?eOFxgYv}1y<O-U4Y7`>
z3nvws4)eYJ@Zr`r2jAaK`tfv7MB@||l?OsMBZz3j3|O6gI2u1h`DKm<73P*!IvsHs
zydo>eY(Qn-67!-Oy^fxGLN<o>H=%>DXUuNY>)?LsAdET;pN1C?8BUsK)!8K|nH~bZ
zDruo9K@HQ`EVSV{+<VG%3g8VDAY`$2otq*C<KWZQgZ|Vw17_&PIMK5<r#UfXO*BAl
z*CH8<@GDt_;SuJUz8G_{DMhKX^F>hsKbEz?r*}G<4ofkuRbFhMDBWT2XN>7vk;i(;
z7WRR#?4H7ePEGW>-swFnK0VGF-lMtuDI4Is=8^b>xMh8%T;|bid;WIZw~U3opq-K}
zTqS1QeeOq|SNui|7OkOYYbE>U2lZ8bDNa$GE=uv#gO|nF=&yl__7L}kailv@7@#6C
z7@1KbTa+(QuIP$@sh<ijJTV;!bU3VJ?i+(goYfn#$TPv?2IsgpWC523`#q-jYLg+c
zok_QbW8(IG7YH+)h|(N$9`IW4v~ib@7+=tC#}Z&u-6h9)o^?|qtbDl>(63~CtSM7i
zj$0k#bIo-W=6+Uz=K{<-Z6(@7PnTA<XbWxe7V`IxJq`yoEu@@_j@J0Tmw5*#>vv?S
zZLrI`)^+cUUS_nA&8hCX{@6hG?Yy1NN+EF6Xg{MvFWf<(KjRE~1Ks^&f&M%f)Enp(
z?KtQ3YFRGd1XNEj3(UNU+PC93(CO>L-8cKKIh{HT^Hn<yXq`gV=_<4sjI9)WvXW9U
zjVonIQNy=L;O(k7ive=;9sYaN`tfKF6;@x8=-fO(aZXb+|9MO0LzrUX=Gl-L^b$L+
zVxX0B)dY3$7<KTO=F%jC=QG2%-D890=5A+q@5Kv@r_wt9p}F6A{?kdT9a=M+;|n!j
z22+^jFX5RF1`c2hXKz0f7Gp!%K-A(f^!gzkLV>}hN;j)MD~=${;S5noLSAK<Bcy6|
zl2*kAgQG7tDDZVU82F7*ut6;^siCZIJ|NyA1oN6^dGFne?qb=kY8|TKVPGqwuqq=A
zqZ^i4b-CtePdO7&m3|8t{~eSm_5hGIPT#$E@Zykjc<;P9KBk1t@T6f_^#+F%6%rH*
z5sDv=d55vhQ%?HV==hoI^XCa8j<h2orEyn1((*Xep53aOde3&Q!`MjwnvzHiLafQ;
zeag~ve~O{gmH8Fn1W1DvzIVjN-b*SJ<<c4&1b|$g73ZWzVW$8JZVV{={H1xIoZR*-
zv>gJ^IYbGUB!cPi6dv0nGM0`;(x#Y+E0kf9l{QoK=A*Fu01i`^q9-bQfd*=7&M|^K
zMOkY^81973)?t+B(7G1A$}T8r0Z916_`?h@7<Q^bLrz2qY6KHDk1$9<qC!E&7<ck)
zkT~W>m9lC@I#U#1V-=y@N?vMZ2*!HFaEvv7-h8<Ii}e@@l}S5zkQEXI^CIE<DvUFp
zlkQA3Byct+!*N7ui0R%1qtL_LdXe&-z|RUL!=C1>jR{WYxlU{iG)QT2jJ{$t2Jxck
z*JRuc7<Xd{yIz&nkmBCyp`u`^5n<%2I*J$L6q-{(<xLJ()ymSvlBKP>jq%le<%Ac&
zHCj4^29*AY=B{&=T7-c@i3V4#J~x<oW%|n*+7c(ddnxrFp1Ks5R!=n$>OLKHCuEHm
z4>*Lq(St*Sz{EDEMb?Jr+#V%w>@?q;9JYTt*pX9Fxv}6CMw=WrYBN(?dP4yO=}da3
z9hD}~k6uOq^JMnkDe_&Ez>pXe*0j#bWB4@SBZnVa2mq(o3w{C&N`<wP#h;c{OLs}F
zWcv4-H5Mwn8QL?UaE&Qy^8uV~v?RR6SUYFyA#(sZW{%C3GYoG!B*6{m%qIgEoyo0_
znW3fSew-JH7aF-gnC9m-Nz>Fid{G)PmBQ*)Zdo@krKK!U3|xE`Q{dWuazWHEXB#je
zp%_Ael=2>Dr}KckO(b_P=_N5o1ybLd3C~NpTqGT?)s$p0RL$^Qk+O{_YnVC4D2F`X
z3uH!XTyIDs7|Arxs$y=7*ikcbni*z7#B(FhfSHPOxsj$+!e?1V){S_M>RPHTP8ysc
z!@AeUkzpRGoD%_y)!PMH8zJ>c(FXn^;bfTzf>cjW*&MKC)8;yGPCBs)s?e}YD;6*y
z&?uw9Yc(XZS{=zwT;jc0fu)|Ua-k>0Y+-bHY3&Jg?fap|$=f(B7E~Wc%@#4>P29T}
zm;8xyJLm3R?)2V0cjK1zj)uLmCQafS&4QRb1Tf(Z`ppxRF_j2%#s_4LP^4$mY?`kG
zc|Z6dTmaav+4M|i-!e|inWY{Ij%M7q>})!BU4tsVh4CTEG#$>=PLU~iF5M<;JP<lJ
zf;%}LCB;EDqHLQrx<n4H6E<os6E)a8Xq{kgSUp>>`TMkYCn||5-YM%nE<0E8Ko3Qh
z$rTvafDf5qs>n-);Hl0T#hI*{?dDM<ItBD5>keh1cY*0QP{B}$S7k%nj!q|<Gck8V
zwEZZB^pp|-Ax(lc0EQEpdDn^!Xx?$<MTiHX#$9BqFcmUMBM5)n6bfHb?#J89rDX{w
zvSri(Iy&Lh&Or=$fwY~iW08^O?6wXaF37wdPXOX0U|R9$QqQsyUG;hrpTj&hryu8b
zgm5}3RzlOz^IzK0mt{EGJ8PT$==F2t>5-wLHgyk#G;%0d`6Ox_hNrHg4+J@-dUQXk
zp?JE2|J3U?pL;<vuAUM4_)hqGQ0~+&5^oUZbW(`)K8^V)Ud8pM6U8JB(!RtWNy$v?
z9iy8*)H1qe6s$)SUB;_yiTsagWl7+mlS$;tXy@=Pi~q_AmN7y>n{S{<>44jx=k;_p
za6|~Oe63*SUiu<k+P|#oW)~e#=5<dDQ`Eln>Ybk8og8Hwo_wENvL&P&;=rAS=f?8Z
zUNmd9kOG`fNAD2q-vTb>nHFO(%!*N5&|p&xyi!~w6gfW`I%($^l+>8Y1LeW>NmTpx
z$rC*4{_ekeq+UICeg3tEj#yT_%rqT@Y*0eiPF`25Ppv_k(+=10p8Lv%pJ<XaI$1NH
zuYECEm(ucAXkNa6#wCDxj<&_O{WiIH=<p|!k7ga55FC$qM2o}rGG;U`#&D!CO66h3
zcrlJRTuSE)0Wd{IMz_k!=q>qOO#?kD09eh}EzQ;I1Vfmh9=8r!K&XU<MK+Y|c9>m6
zpQCJzp#3kbn%O(&yql1YLCeiX=}^iPG%NMeFk@eSl$!lyCkpg(A|=S?lKOG3ygVHZ
z($PCLHansu9E&1_uFsLLOCwijEef~gu_`HloJ=r}i^&yab-CfI)I5D$7*G<)iom6=
zkwc*BrTM#=kRcQU$<0qo6NFX(QXx&?jb(FLEhUSgQ<JTz_l|aMG<A&59YY2}#NUY(
z*Tk|ClEf*AH7JBVbB0K`P-z&&I5N@F0ly}?G~mF}GeldI6qqq}STZ@4gflzgh$3=k
zbJH=k2BP9cf`>nd|6RO*f`Oee7e%^yI4y{L9;FxrCGJt2rZ}No_xmVwt|S8v%GC!(
zf~u^HC+T~o2S6=l{?0Wgx>VT`-yFPYw{~mVq)&dU`tDO|$5P^uQ4n-0oG#G?$}~pI
z?NecHE2xCpYc@JC+@Y7eg262((35nK*|;Mmm40l)J+l@Nn5cJGUUE+|wlu#`>Ih=a
zD1}q^U4xF&33G_k91X)zGU;Vl5ETfd|8Pae70EaxO6!c`zvXE!G13Vj3!hf3e-+tC
zNVwnHyJRv-1~NFoKFl0NlWauUq~SFjmmO@&g3oLczhfYQ;vK9St|xU-k^QZjq}vJ9
zNL<lrR@KH;8JcJVBmbuMF;Pj>HWN1>Y`E62*oJrbBu+4)RFR;Dj<%7)3)o1rMLR|j
zOGBYkYV8;gASP<0_eRPlTYlBc*#rbn4OETq7Aw0XUo){PBvw#UN>7FGwY0XpF&xEJ
zLtR&(vo&LtH6+_G60yM0v6OU!X@0KVO;&8XMdYVPnWgm-qIb&dc!8d{WU4dbKE>P8
zqIxcc!~UkD9&lL&s>f(mQBj2gQL66&kbWTrB=8~$%pL1UCVTnM+i2$YKdT#!sQlk2
z#}H3bFN6tDuiRB#vK|=mPp#WC11p@i!y&0Q?rm1JqU%CC(jveh+{l9~48?8)N*sj;
z%l6A7&aDlo=JZ?E{2(OPe{pm>_E6^3+*qV$!YditdbE(6zjzwJ(DB!Zv{E0+8m+o?
z=HHuGq@L7`iq_-J5RLnButrcnDRtH>>I5`!Qe$gYFD`+R8k>vsVOMy#P#4aq9+azu
z4%77zS4+^I#nv+apUKtP{X8iO(M)NYf>e-*lXqH#PYK@+c3X^J(?0H>pMU*D+13dA
zOV6rUTg_Zy*)nCh*+b&0Ee5a^Tf|#tt3{sX0(EDW590X(JvdlCzXumSi?_ev1bhYc
zmlR)4^|kdEO?#=5Ri0-TmT)581SR<p6<TIo7un=p{zxn-U`Lz?UrHQP?$}#k2{^yl
zMuJ~Exg^EM0hO3}t&VNtQf$Wcl7~f7IkMQ?ny;w_PV2TB)3{vZmL~>9n+m09pR)7K
zRy}&FWH=s)W?_~$<7G^Inim|u>Hz~mx+AW-n8af--b?Wos0SxYig$3!d35-FgA2)Y
zgq4909jvy82zi8r2WdhU>iH9wBu$at1HeQbiMnO8?pYa#d=Pi>hJqhqK?O&gl(Lgo
zikwM;R2OwXxqes9{(CgZ`e||d)=Y~N%S6K_kK?pQDpCOX7-JIY6aGBTn_W!$%cnMT
zyET*0z|z2oL7vUqNibVvAHwBps!McCM2vj_XenAnQYZpK*URQ*0rMAIB}!wpB_3+J
zofJ6!le7Sddx>-HqQyx-E2+xwjHk^$qF`|uGPmfCrx>r&mSPvOaXCGkW9Fj36E;6l
zdLOnzK;TxWXm_%Upq3U5Ds~RvcG`RYXw6p5;!eV=BWljkzy)n^-QpW%X)q92=E%AC
zP%}4p5i+k`EOEGqv)Wm3CW(DS6!FSZE`D6DBOK4f!g~Xb(p3CwHJXLlvQ<h<JV)pP
zp9Mk$+nqsgNpkw?Z5`IOC}hsNKxU@{+u5n2B-s@xs{*=F@KgNowGLVi@`&?f&^twe
zadpEnWdV?PEnAju%!)Hd8?qAhlceWcU}3Q|&oS=4@-7mKy9VDB*$#lY-I`76MS8Yf
z0V@bUk#w4~-4@E#W&jwCpX7M<HI-8d1nNBQlV!><nVh+X%r>Jg$qYK=v$eWmQ={=9
z?UEwB-JPW4Vkd^RdO`OWA)Pp~^9IT6$G9+4^sU3S#&Iad`Si??ryYi4jSX(1m9Cu`
zKnBd$h|1jGqu17EjeEUgytOCUq1J6Ih|KW-nZQfLmGLBlvE{i=9$`hyuR5E29c3k+
zTR>JLMNg<{zW7jebAbWQH<Aoc@M{l*34k|@8B4*`G5L^mryRE{$P1I2VW~tBHFY{7
zD`e|BR!l(#*%@C2kcNrXsf5C7PTp=Mwy}Ef1P)5t-!4DmXuAW){&i1Xk1(E|bxJoY
zS7`t0jk8E27r0h_db+6R&=!1QP4VZ@Ck5z0ikVN?&;|((FqpSEkcG7b<UHKBY&ewc
z0Ww2>IuNU}SRaj;#snXcsu7+NE@9dcw%IX_ViRJ&KxR6CRLVqxTjEHSG9o)f2fxq`
z*3l5{vMqx}g$N7{$!0+gs5YM};Vy|k!y~AO@>9>;4JrGmtJ09mFER{!odF|<35xld
z9lV;_>k~Y!HNeY|{B+?9(l;Yzf|#8aacZujXs0p&)@acJY(|*Hs7SU`#*n7~h_$@1
zOb0&M^KXrM;n~ZtX0O+dhvPxA*FPZJ``QwsG(lvkVX833Hf=I7gCx~#xwLLwN02!e
z%Csc)yrTO6l2Q#Sm>!N9Nq4hR!X+m)G9(6GQ)Ijm8p^QR+divqtA}`rrHYqi39_9`
zF7UQ38}#};b0kz4*%R12%Zh2qvZ4YXOV~4y<+Igm766I!kSG*O9_vM%fzJZX;Csp(
zm-e_IyEDh6WbS^t7D0BVPxRAaG+gGDRtv*o*lqxaowvt_2m3$$cGzhi9kmX2eJdBP
z^cm8GwY|rpqre$ulX!AT%LJ@SZ`$=PW#*bb;D^-RT{uZc)3GfiI5VJA@`By*a9P>>
zh~^a_QCFB4D|U;?C6RLA$~FE7g4i~J4r(kkIo9&=I2W6?`ZkYvS!F5+m|)u~&R~@#
z+=ktT17Mr-lRdp;Jb6Lh5v?Cu$3L}OJ3f%HxFJ?tvou?aDV*I)bN_Agr;=;pV!KYw
zL!D-3AYt@a97V!tLZiPiG?|Sm)#&1)%%W&xm79k;aPF+qTwT;rJzs&WA18U*L#>|;
zFd^dXd`DYPJ6^d^jA~+5TSp#KS<CuVfmo&rGg<uH=MYD9T(iL(GjOt~Jrt|iKZ5+h
zTq-AVcI=}<atHL&vnhIvQ3<kjg%hfKu31pY3p2(5Eb0QhN9F~NJdN`JCg5!%wiXvL
zMt38u*sMpCKS60#MYWyrZK!{Oi4>BJ@K9GH7$hWsSmo?0CpzXJ-n1(ZLJ;tv%SoE$
zk1FcHzM@<FJlfrB<8{t1U)LkceG#KwkTzw|rVA%FSRGvlj#TLlc(NKBJTR{*T{$ZE
z3G6I2+s(1UykRRNSPDscD!MXy+h`Cf{<31Kn|i9P1AC@Ercz(&5XPR86LVQ}!iLz0
zbZX6;{X!BydiX{Pa2pVIJ048fCMKJtXJmq?nQsgG6dVYvdiG4CwlPRirO5ajq!bu}
ziY8TvAu{)e%~1GiXL{Y3yi>`12#q2JL^M^Hs(GtWM&wGIMPJ$?JyQatvJ8k4paor>
z&4YVGzJ=YvqZ;R@EDc$FJJlY;+ZsXtXajAI@U`BK_S?-mTD{xtv5k`@C=}=HJCd<s
zd>40`nAD@I!z3^KCfFuc4<Jf=Xw(lIpUhlz*Ep!m_UMc!==Oooc8Ck^mb6fpNPLIp
z118p3XrRECOXtbRZtXNtsuMKn&qmq_UxNpgA1LP-+*^xU=wGjht=-(&G@byhOA@j3
zO^Zu0xk1N3rlsddOhhxr{$ZNe#H=Y!dl!m=5|}XuB=3xAfxc<DlD(-+nbsf{GHXC#
zx0V74fzC<bkvk}VThT5hU66POuK6l`N3afaB==XuUnECXyBA9Kuxn<ODu0YP9psN#
zdea+sb%SWrg)%pzIhJB69F8!;Y(b2@iU<xhRg}71nOB=bB=ZA_u8{3HAyvuBj)x?Y
ziamd^y#}e}cvqyBgTsU8`-eN<&%0w07$qYOqEL^k8;@BFzf3Nr1w+cy$tdy&%Sg=7
z#F@Y+hiN#j;s->zq^<B}OL-g7%LAadVFT8RC=Yw*C>l%W6-c;CG@qqwh@b(B_rL<&
ztl$*nne-WSC+8c6JHB;{`lxYMFzGJllnY%`2&2$Fgf)(}4L$k;<TZ*eVKLgDNkSTi
z5{{IoT~fH3IYY(#olW~i3>o>jXCGp6KoY;i(xwlCdV#&%pqrjpZp4V>h@wYb`U4|b
zNn;$?JPx3<1{*6-DvOjZqFkRFx$Gi(ze-ndB_b45<JK!X)c0&afVDO=tmmwr7Yb;d
ztl!7gy?S*DQ7_`SdX9M%12Ol|z5uoWiXvyzK|Ha2*2Dt5$T^)FW<^2?fK=s*KQ2d+
zSF1}1sr(YlMoH31*_2z7ep=JPNS&2)6`w#a-~{2QFU)G#==(uZx=%5!ikJ<$6<q1J
zQjw{xdTim>wml#t4)lBCOH~HT+veVhip_#s^Y8$Pg2alcW;VD5(X!ZW)GK!Y*PsfA
z2d?nkL?k(%WTR}F4}=-!{R*|Kw5BB*dzxl!Cqsq<|COC;dK(7l53S?phwTN`#G>?8
zX7)vvy^HP)2E8dNVU(tNb(CF{Z!E(q^V?4=L%vob2bnvBClfqS7u9*w8CQA9i7^27
zUcPA`Zy<pJ(F&wbU^9}QqTFJQe-Tp<h<9WWrd`J=yn>_L073FBVfO<G0PPvH+bgVL
z2k??nRHE4L2{#ZCWMFrCfC2idMBNkJk|UiJ96@UqU(0ly0G)MSI@h-q%KIu?5)!a&
zQ<Bx0RwuI?Q-&$Zf&x)O?&x8uk<RM)K7A9BgD<RDWFscQsIL&JhX-!xfGbg#`9=tz
zZvBV;uwhzGGRggX(!I|rj<xguxVg_de73hA;NOjJ9<JMe;j_8ExxM`#8xJ-%w;w+I
zW^)V5Z9LrCSpSb`{RYQS`I+JhM$vyvPp6||I-}g2_kYpPeX{Z0$;OvJe9nug)~!dI
z>+9dGZmw@^HllVsc#rYkfDwxUF9zv&oJCJ!3U=@jgP5HSK^z8_7cF3i&s3^cY71F5
zLdKp7%0^bgK;=%Sto^|F1UXs8<=GT%v+&6&(2)tLBZhf{sW9o$gj}v*K=`yT7D^4;
zP-CP%1rnd}BzvDyW>2Mq=x2jLc0sBVMM`t3G)xL*;vAL6mZNAcgQ7!eI3=x|zG#n6
z(Z8&#;Rdp3+D#f_R?B?6$}VnqEDB6BD(JO4h|?iy-NHjb%RvJaH59r33ynsNLI!oM
z(TL@+YO0rYr{pxIR_;D}XOOQJMvlb9dbxqV79;G5==mM6I*>V06k%ahY(PHB%u`wd
z#oSUG*(7JpC404LSZ5e0A6}B83C1wQAao2KQix6L7#yhJ%KF6x5n_W>L^(MNaTn^Q
z;!KU~6=7GN%M2)M!>he^)INN10%v3^g6~Jihd=D?wsxcEKf%jZv~zg$)A8QRS0~Y{
z!~NaXaXV@r?84K7ljFVTZ%z*3!BVpgHJ50|z`N$bPf_c~qvKY)9UUG=d#{i7_n<xK
z;JA5kve#-iqP>Hi{WrT5QV!aPfa{I+_g(|--;GWV8`v)eJ}lLY;6!=dI^KB&Kbz0@
z_V-SHqAp+Tog83yFQC6>bksZsF8a-W^Ef(sb9@Bs9}NxWx4YM-Ts5uTH5dc*8?}CD
z9h^k%SIzx>Z@PzX4_e1K0cWnysjdAzRN`}YFx%a|W034{TISmh01*bc4}|BawX=s`
zT0gd6M$O}&8qh4!s>6eJ>%ZSXId~uKHeWYi!W?UJpaUzk^X9nq8VAl^3+*@0+b4S`
zZ-Bdhd3d->U~jjMe*jUU{W#h`Y!l$#02>UQoHVg}Yz3eOui^XiH|;%y9|0Xhy&k_g
zI@vossKc7S#p~N>r-`1=1Zxl;aLxd%!{eW@T?7U#MI(Cqss+zs%@1UHC&x_$2gV@Z
zIk8JZuK>>zYqHTn>*fC5%hth83*R1MLvQ!mtvWB>UK`8oap!NF(DNIdJ}nxIjlWvB
z+@Ph6_FhEI-5>UF@LU*M1C(g*3Hrd(_M4qo0{t~|0=V_Jv_I-4{ixG{IlS0=*?D#A
zZ}2-ECH5mM#-*A^NBgZ#2Of;NgDKG1C(ZY8n8c@W%oLZe<L)HO*Uq2a`Ww2F^{t8n
zOi<xe?1OMKh0}(Lo2T7TF|b?U>=!s7%LI!rm+=ei06{>$zj^wy{h(II89|2;PoP)R
z!>yyNa$7xq-2}n3-T4tkrZy~oXJfsyUDxxryOE~7cWhNAZ&19bu3J^pp59547wkAZ
z$-1OO;yfNQ9S?re-mB&htqyLGPWz;J5^V%tylx(~gD=|EZw_BKe}rW}2);c$eBEj9
z93Hni&E5aP5`j4sasIA@ww$w;!)^Pd+5R3q4=P$jHAgXtyUEN2{_VG@W*!T)Xx+_I
z*mci$;3<{<Co$jVB_^wR-riMhS&d;RQ1iw-KS&CG>~sTLwDY{V^F0!TR=p10IF)uM
z@mV%{F}N%b`pu4v&mFZqe${N7cCk|zi29Wa#n<hZor6OVH4mEmYx5DxE?%)5<BTt{
znn!!{+iM*i?%NIhjlvTLx99BL>4Dx|tT{^+*=yyF?|V3t-n85S@^td)$f8QHA@2*l
z>J$my4HD7fvb($_GF}e=KO7<P_jgm<#rJAjNA@#7>nO}JTI<lADrfsaPOvWzab;9)
zEHuuYxiog;y5$N=MrGu^Swq-M2X6pXF$9!P9mRWqF3dU|j1&!mv;8#KlU<8~T~_wD
zrE6lu%)w>tL*42p`7p*P_P1}tV~i%L3*)8JyyEM1Z)~Ot{1<GBo|l)ecPjek38^Si
zU4Xxkxbq_p!A=X=V4nOU<tr{=lT{#w@c=~^wZ?dTtoHCcVn>!@7#F$&4CTufs~w)V
zfRAfgl*1b)hIYyNoXn|S8nE@UF{An4O7B?J;Vt^Co+YwY&w=a?*{-K59197dc~an+
zS&+Y8on#f*<thypYx45x7*oB8;)X7JMC761yLiE5WTbvZ2JU8mW%-8^$Rk5eY${_>
zCHJu*N_zTuNVHogc&Y+ByWet<-K^}Z=HB;j?0T*CA&_~X&~J{2uB-<stJ?DJFiMAS
zc@Xkq?*LZQe$zQ_0Xx4#oH*NF=i{P-PLE_~9Z$}>4GAX*-{1d?F8Ex`ULZT_V1Ecp
zv9`7b1+6uHeo3ANJ=Ul8k|N<OZ?ph5Ek?H@q`{GLnx?yD-jy=t2xC=u4v%*^+pFeu
z&0~fcA`Awy`|i7q^(_ESq&pe{J%Wbr<M`qc^Q45s)*2C<y+cUtN4u?38(jQ9fip+=
zwm_b09{lIV=GKG%gejqsM6rrGSW=pdILafih7$l_?R^X+W87tKNZNT0e7ZF9U~6*&
z8^OGAm2K=jf8B^iN#Qhdw0oo)*?O?CiH+>HpGy@WL>I6$4PYtWnnz^sQ5*Nhb%C)3
zhji=P?a~ST0iJC?C_RpcJ^hq8GxZ84>l7X3TbmSf(0T@EHFQ<3`+D!F-P(713Osub
z*#3{!@nHv;4U&k<Ex`Z><MX&YY<y~Vl!bEean?4t!*fh7Y&AH(oH)OS-R*BnlO4yC
zZh(VL^X+fnIVFquJWHG>>FIENYtw(U_04*qJp$D80PwtLfJw)0le;h9{D=?S_F`ll
zGY@`165b~te6a2uH-8H9=;z~c?6q({{!T%tTpC~HTOI)Qi*G{pA_pDzTQ5%B74d-#
zoFXkq00*p1=`wmqwU|KT=F^Xm61fjt3WnDd*)ZW?>THF^^hGY84%@3*8+M+=J(ZlC
z2bL?%Ad{jIhNQaSbd{v}>vXK{Fq9cu>d+hOxpK`yYca*7NEiuJxS~bl8m94(h+R4Q
zG+}H7flXp;+f<}-85GBb>Sm}9kn=V`t(l$mD7aY(XTy0?lv#_qZrt0TGDzoX<h807
zQjO1AVub+uQDk>()kJ~B0_xMJelJ0a;*Y~-r>tUCNaxEMI1a56G4-t-VLiqBN^4#K
zS@)ecdOSHUvngx6@fgR8M$5(!)_H=qr>AKlp57cY`PP3%RB=N2MN+()UNyeo18f7s
z>toIYG@Ss}ARh3YE7fE>Sz-m)ZQO2(4Z*YFX@sHQ2Q<EZ`hhAMb^MSuSojooB3<V$
zy%{OufIQ^reLMix#sFZ+Wy1L2Lomv*#$U(TMKT$8g-=%kjb1_eDIz4cA@a@&Mc7@B
z?x`BD_YMw^)eH0ZsClyUYQObEYo8boXIpd!z+#s~-{#5T>%AQZE6bXakpAT8xOLq6
z?>hHVbH<I*;Q9uq2XKqmHXG5lue0!mP?Cj>MUn9Qg;GK^k6*LN40*Jwds%?@WZ3C6
z#K<OB#1aV%y+iC#ONk^-DoE1jwX%8%Uc0(OsbMA}4{SJEYKIt(hI3|YO0Cdiw;g=6
z7y#Nw&EuUQ2<SNKbOMtR&cPjs6t@Q=k1AvmRl#F~T&SRE(cIsAdC=PJG<SAT<6ah$
z`{b-aYSE<Vu<dt;M1=*k7k-r*+iH&G8N9{^ozb{v9u4|65b~*@#mZY!(*gpV=IB+k
zqcL&yR~%et?&vH;GV*4*|Lb&K)%OzlV1-8@qNp_hjy`(-u)XjQ*mP6g)S!G%eP5rw
zE+V?lQxkpz1P0~Nz*KG7lRA2Qv!HYazd#$+M6W{6(H&1?6=$d(Qb`0P{wrxIY{j&%
zBG@^4(|qv))dD|hx!xX-4P6uQNYfAg`$t<%{O|dc?0@oJ9)obzy+I40+4eu{4<0_;
z^6h`NAAYs}`CUFJ2=2D`)6-~kZ9Q6DjhfL;)Vl=20+L@&8M@JQ<di)J!^T3}Xe{*b
zTE;?tTi6T>f&1}k-T?Wp`_-oCt4+~Yo1(8aMPF@-{ta!4_;`wlBf+C3Vs{~X-)M*Q
zRD#soA^$j?4efuoow!iS9M1QRP5l?En21~TNSIQ4W~_KZg%1S_;Ow?*a6si5hNn`B
zOeGHhxgo_-JOFxz_VLybj5kRQ^`j;WF^yh=T1~~@14a-}2dKC@?V2{2d$%mFV3Hs#
z?;q}TURh$U|J=wcOCN{A?Jeojd551x^3Hkzq6fc`FV?GKa;d86ukLGI*?hMOpi@!w
z5&ta>q%$S&IyD~oSss=y=l%{2QWy1~1cz*wu525Jt_xZ}{@g-KiT^)KvbFBb_A!(H
z-`LoA@Zf>R|3BDX|K=<I|9gDG_Wv6X8qw>xC@{q-Pznqj^8{G3;{To{Ku+^DWZ&1q
z{5#45+jC@r|4V{^Y2_<>|CPP}%HDrv@4vG5|7PsH;X{$_Kpxb7a31I9o%3V>yUBgm
zOHQX}biL|6AO9=QCIvo|3>c`qN<N^?p5D!!k9kt8btQr*>{()X8rqqj0+OkaWf_Mp
zq9jU%p*eI?Op<?1;V{d^DI1%`yW~lRG(mgpPDf}qmGnfT{qf^~Vh`<&j>%The?4db
z_lj?@k!Xd!)*sVN#K(N_Lp+!!`$h6P{vZ+AqWAd7t%U!gYd3)4=?#25AxjxK=B1;O
z;&|ugfLuk;f=mQo@ZW9*at-+ibEIY(IZ|RM1+cT~OyXWT&Eb2V;GJhAzcCn;)dn0k
z6*W&Uhsp4iF8sX~C|*#eDn?RloaHIUAi5cdDarLF+QKoxXq%G>oMNtp=}iw;ve2>D
za!efp#zW^v8Q>q=(&(YAsBc`$37c#cile7WY^$L`Zq~2CLlrItb0QX)jUrbfEiVt7
z1gd5@pt)_dOr6B5&v=k3)2(`XI_<v0CUs%~d`OxBKNr<mtYZuVg7U-xx|ng10%34i
zCTMDm5Wt8Vnc)&Cd*Fob)yCPFLfzitSVP3h=yY!ifCgkTAsb9~AYn7yr}lj8kO=NH
zYtB!Kp78hR+vt&9Y-RJYQ(J*f$;vhTup#TD#$8{r2VqBhwq}O;hII?~)C^qk-@E4m
zf2@GNn*hg`0niQRbP213EA&vUZo)RJH+T;jgr{WVPOTJRDW?ESqbGV~@C!46sn8~R
zB0s0UtTBy{d4F`@drx)5>YLb=6snrezWgRPIxbf)LHXn*AF%2mIZZJ<mi$=xaH${&
z#a=<N=eP~9{Qt||zc;jzBMam3`S<mw&^Q-tVjCMmvLS&v1W3YJ0y&sWb~cm8Y3v4i
zV!OTWHkX;n@3X&k)2+L0Ou}R@C*GZ4cT1&`R4SE9b-`4Ls)41E@+JW9(Zfz!<?4+j
z4UrUH?i_U5M>}siuQ&guKKs+o&2AG8NAX@fJlzY@cQ4z2d59?%&T8t?hW_3iVm|H7
z@hKf7WIV7NxV>|}d%ZLz*cdFsC`Dl)7*lw@q0yj`-4{MZDnMIfDn}=bgCTD4iO!--
zVKF%55TcCXJgip*2BI;^B?06(=%&(%gE6H%u&FF+Y8)T`suszTy=ZU|#uVCI7NT@Q
zha+zY(`|x+d2bGme+5ayw2BAY({rF%976R#MLN^r59?kGkD??#v+~A#Hk|45>V5MA
z;D*z?cd-8wEy(cZpPz3y&tcmC_`|?~_bpRz^N6ZRy_Ttm&o}=zHJ!%`%IE;S^y87#
zX{yAI&dh4fkijU3#_HZl?cT{R<6nm58lhUFhUZA|?Ik(6o+O#5kp`E@n4KiffJH;*
zBMWepM9b6$>oyR2Lf~=Rv*C$&iGo<=Q(lHF4H@>C{*WeKQ!^E&yWiknO@rKi5fRE0
z!i%>^GvSDN8=qGg6a%Smj8cGfpK3@}5z3=koOSC5pWjd|TIEF*3PyZOGEK<7I~hi_
zj(PlnCc0;M@E@8S6qqD-NX3$xvymrSH&2G*<Ai*4VDZLdPL=~qBvBRA?Ca2Ny@*_U
z<dqJyZfYYu3xJ>N@b;|EA|$F>1+aT!@n<VRMPysE(SB%h<+!4wClWJ}?6@p6Bd|W&
zT*H_Q)o<ZA&QXQTsqm+_(BxF+L^!%BPZlSbVgR1fJUi6z18mdX!KgB+sq&!gWxkPV
zYvn^cIdwiwsnl#XXVyDO3+pu-E6s<0nOSoX6}R}P`J}P(aL&{<KEr_%8+(CaBvzbC
zt-)%j5htg?4QEhOpWwd}m^j2C$7yu9pwF|o3NeWto<gG<3-Fj~;<kzYDdc?3dQ~JG
z0hw(1Q?-EG!U9u2x{RC5%c7S=4dI%4Hk{zv-cZl5R~zoi5eB6<#z7bW(-LMyPV+(3
zpNxqt7wz((3@}<UcJzDQI6OItx>0DZ&-@!ZSx2(!WECJz4S&<!mch7Y*Y(5S<vyAn
zTD&cb<WpmYP3k$Y{B4ds8MYjCU)Q`2C8jfCLNF)cIO@vzwd^D~%+a*BcNyFa#XR$4
zs^!u%$q5-wGsu^YQCvC=FxyoD@#eNkihe4CC8Gu`#Ez6Zerep1sa-E*Pc<4avpXYb
zTP4$rnO(OtT6L!vBY$alQ@5P!m*ZJT44#7iMm-?yq9u8Tcbd1eDF5A7=kxe-UUAr2
zdec{iE=+@M>+&>YmMFZxu+%g6`n;%RRvoqFE;>h~od;?Qp`K--GRh9vxheV#=^y3h
zi|dxNDhqwmH5iiTmoIER#4^^fe$MRR67Z@_3%t7clEuFK&t2?Cj(LS1$Zeq{3_l*n
zoIVUw8bJ@P8VWN;@Ub!?sgk`95O73^n)ss8Fu<gt%Bzj#*27i3Zi0*8s!T#))D=??
z6y><o!zWLc|I+$PtK}7Ml(ALqZvGH}pW+$ZMv(8tqzQFZR9YkyT`PI4bYU&_ucR|6
z`OytISiK{hYEk)9)Q<@VCuy2DLV6Q+7rEXjJ)yF9JUMyaTK<b<wIVe{Kg0<#*_*IP
zO^Nmie~=qN;~^%w(=i=&>(3|sPg@)u63LybB0!@$kb{}dL#<W)FT<48nOXy1T~ntK
zjzORjmg?}dMu!v}1-vv36Lb(mzRlVOEsVp7rhOKSFex+V9p$@1(I6(Q&!W~yF{qO{
z+YQ2Ktmv{qg1=J}<QN&Ddm~q2HFhu#1AUqpyNAbYRk;!AQ4)p2o!#v=pB+!+f+L=!
z36POFKq4a4h24{P)GGDM)2P)<chzFTy><_dHPoKT`EZKFgl9`U_rZF14;4kH!~Efp
zV)Rl9NiJ{n!0>!OPC4MdRxZILYr@<;!HGtRgjGycN(YfRyK*GC2XIJ{ZAjFBHLFcv
zeRR$0mi*}T6rvMHq`qNNl<pqVy(ncV&FXM|xE@OZ$I1$2f3--rLl61aJffug(Remk
zN?VlQuJmi<)WY+*n_9~6GhWDU?!VmIxlyNK+k|C^L0k=H4c<%^RUWyUb=LtYd)KYO
zynbffalA&=Ci@s(Lzr~&d>6sDJ@(Ecqj1mMCj`PIPe=6)OT6ohm-9-K@j9bw-yp`G
z;I3cDMcKM6aQi|ljp*;x9rk}GA#y~yJ$2YD+F^)5ts@SF`g-v=OfN#<%L{{OxS-SC
zFARdq1<h|I1Ixg&*4(X?r0~SpaBAUnMDG_Ge5D!cJ4?e$Y1~QBMi>SY*mSHuhCpa0
zyrYY-yD%DvoCFjziT3jaUS$hKhl7Pn>XcfzqEmo-vx#6(SkqkGn!2Ld4n@b)sch{2
z2Ixs{O#C+Fgcp>yHKdzs+8Ywt+apXDk)i=BZHsZ-Lz5LsnoHRmb(V~O;KU&i%+tf?
zIy^RTQ8uUH+^_=>o}y8oYeb<r8Q8g&T&x$uJ#BsjjL!sc&Z9u_^}T9GgQy>jVN1LS
zO}S(2J0~<6hbV399?4$j?31)TGPby5s?GN18}AgOFB@qBMx4o+GY1Pynmsnib@#}e
z@ZhRhWw!%rwcjziN^aZqcU5Bnz)3!#>*hFvfmfnocnL!Py0IvRC)gLd?|+Id!21@7
z*YZBNH1C}~@(2chAz7p9&(={O1o;}vN)g9^fUD9q50+l%E;X?5I(MnTXwiP&U=-E?
z3AyNzJ2y^?)r}{^R4xbYm7tXsTxBy1V|^nWvgRANl!NF0)7jbIIzY3P&fj<6?CrLX
z+>Iq?J%JaR1celrQ;LP8y<SXal{p8#;ax0yWsn@sS$cJH*V`<u=k%}la*C2&_q~Eh
zA@&*j5Htw6&sHF$Xy*%^Tv`v1fG83MXSwkd4QPEn!2C#12(2q&p(eSc4qBsHoSZ>W
zgY^y2_km#(T8Oc8gai%<{iA;5^4mzKp>r?weL}*uvmMzbU)7TkHUo_40ep)(UsK1h
zkU!<{CdndW7$f4S9<|)|PLT2~zvGJocMmeTyQJ$cL!+n(`fwx@HA_Ati7j7YV!My@
zgn#;&JL^8tM<!*4*<ve9dwQ;a<ZJ18fOYV{3fER^xt<k&pgPDB&@ch6o%10nJBrgz
z06~qp7LTgP_qmqs6_CC|_pZ&ohO~9V{rk-A@QZo4v94L5Op`aPzx56E-Isw)d@B5$
z6;iKZD(%1Kxe8s^E&i4iGn3zvPdvL=gcwdz-+*rgCHC<$aIrtkuJ!(qs%2Js@-MK|
zWfAv>xg`t?8&(D2-5<hm_A|L{P;|vWi&l{^#J<xl7qLV(4yNACwTQ8mFImWpBVgN`
zj4C0ez0Wpv9i`i*vHl#SKBbv2r*onYM57M}(mu%U4G_03f^jcL=dQqQVAtKP*Ic5;
zgV99NHfHr42}uPNk}#6!JgnA8GN_P9K@X5AGv`CuiljnMpaK*?>N^kfQhYSD!kLkM
zQ7R*89#4b|lArV<*4Uu@YgAX1A<`sj8>&Ub73H=?z|pFuxaz@)Hdl!+D_P5xnzm(m
z5nZk>)8j=FZ3-S^q&Oply$g-AS9j(xvV=?7NJUzc@z5HE*~20_5E&MotCR9Dq80n_
zN`oQm8+c}`9$!%x+5ToxElcXbMO~vEBT>>@%&v%1e|Sk5(Q0a?W~}<Dc~KT>4+0GW
z7IUkK|I@az$ZmLRhgYl1jMasV6@}+A8!7d~0c3!$3CtgF^3j0aQ3~B3$pjCM2TfFV
zwX!`wLIYD)hYl!(Xv`sSDBg{>4Z_e95hXD){qKh-sfLl9MJG7b;V_<@p0Uj;gXC^=
zm4@1*lg$OW|Bbol&g4I$q9dSY7=cO>hGxjgoa(^?&OU|JsyrpS71+Nu5UPGD!`9L?
zf{A7NAe(Y7Ohi!6hl48+bu^d^G$ih3g#n=2k`E9)=denrscHkM2U<WlHtL$8MLDLY
zvWBfiuq=v-QK7PTBTsyFEi+F{2RHi&&jO^Y8Vu<P9EdjrDNGL`YC_`8YLSmZqQ%<8
z!DePbMr*?Vow<A}wdl|^y%sa)gJW_MLT15oQ{oLPG`)m?^qF74sbfsTM5pukl5`qx
z<UY@}q=ZT@wFxhoP)p+2LS49HmXuM3$icWk6{63_g1N_n-Scst9bcnfo^dkHactt_
zFh(K{6zm4n<b5o6AGv$hCNVb_V(=tzMb!s51E!3Mp1ii`=3(+!$vDJ6$LM+V0Ns^O
zocX%U4c2BKWLha-G+e9|R>QB+Be)}PkbD0`6o1~SHmWIoVsF+c6?I4SBd+;08<C<9
zMsn&LW-aXI2h97}z+OMiylU|)^Pn+=Z8TSEIa?}$<6y4TO12cny3H1Pm@RY><_oPB
zV$~^v_o%pN5!A<py(onGm*S!fRSP07aN7=m*mN;fSp<f+NLw))z2SfZl~rrRthF#k
zHgXQj);xx8v3fn$p~{*b#S{$@_Ch{DkPn~{*|SEfa#?4vuBs*dY|%a}v}Ap?*?zU#
z#^9*7`upfZHGA^l$W%;gRkd9y+tT-XA8_MB1GsW6%BG-=@y>1%7M^p+Ruf>JQZDu3
zNu0~BXPflVG0PHlWVqBiqM!i2%U^vo?6t=hYIvEq+;=M8Hx)A-kd`)4gE_b&MdrHt
z{rBeQ&xI|p?P;YDrJ8bw7>-m7uR#B@JsFG?UJ;|S!#^faDtBDVPQe<Q)n-Q@3ejby
zwX+6Jx~A@(U}5Qw|MGeO!Q~79hNb5K$Zba<0?xZ@s~0ryyvtXIlEukRmq>EO3+J;5
z5Rq{Bid^-sq7?FJAX->hZv!&2mEac6Z57Bmy<Y>ID`&?MQJADR%-f9Nzk8A|8ji&M
zh<t2ZAo@rGQr@R%Byu}9ZbU;3PG@6}hhD0CyF-AWcOFry(%gc|>?QZ_d*kKOr#Kg^
zI}iQJQeqYe_CuHj0!!G_{S2Oy(*VHS;!urnSOp+{1tIAkCjOLh(nC?SI*NFc+x8dg
z4tVE&uwE#Nu~gyn0hAj=n9wqfhLzj;qXN5lPs7kg{STgxgK<E9*SJ~GjSeT<!NX0|
zCD{QVc1}l~An8iHKRUxN1}J^lpU1|6gdXx$o_7g~ED<WfH%uOV{M0$IciC6~qq3l~
zuC9*hufEv=GQJ{311she_u#;GaJnPrc93HQd)NMef!vyID8PZgTZ-|mqK!_{)<O@j
zsnwdcTJ}|)vUnB^DP|X+YfLpHcP^mp@vS>CZHZ&(ZM!SJ+&S3X-d3Mr9^Y@h`k>zL
z|Lu>z{q2Luzd_1z0^Z}#W&FKN50)`g1eMvxhx_z!|AXsM1|pH*Y^|DHhn-8g`5MY!
z+J$=fW7&$wk(JuskZVyqq5ujFwaKS(ys2G~std?u<vyGbR$_Q+JyV%7#lyi~?#lyq
zn9Q0BXl<_G_e^!sZ|$_}$~1i41;_#V{QCU8RQQn5d>iBXAPLdH9xBz!!%MWVr=e)s
zqP{V{TmF*DU(Q{=dqx)gpZ%g4#wQ5tQ@3LmSdlKn`j<jgbx*BOwk$vb*y`}o6FE`C
zjyF26*yCQ$IRHBbLv%-V8mDptAB>TtvPtP(i%d2Tt#nbtJPvz}<Z74(m*IGvGr`On
zgtUPuCL@~T^N?IkkgMu5{NG^#Sbj82t$uM`74>{ctyl`Bm+NNibk)UWvbFkq;o4&D
z87kSGE;~lOc(2iAe^La$C}#mIv8bJX#o!j{jr=(egNruBnUql~{{~}Mu053E=E%|F
zBZuIdJ5z}7n?uIY2Zwft-SJ^~vV|K~Mc!7kgDnow-U^gaN7XMLr)XF_Qv!4x?)TlT
zgD($Qy@u{*#ux%4285U%oUWKqcZd2*qe2b3=>$L-g)16y;Jp>vZ;Cl9&>=9b8jiu#
zGnt;q+z81Pv}=H;m&p`A#+s(0^9P!S9#o>ml`0zOIX5A`^pr&iDS?s6iBj0Mo((kY
zn>I)K!=ASIF7v`&J<g=c#2#sVmLESr+o;e42q(?*Q2b;ySGE~Bd+pFPvFV;~1m-%z
zqA|GD6*_>e8cW=2XKNYln$s8SypUx5;Qc1X0l}~)*{frOU(JC*V~`y8M+Z_M!WH<t
z>?|a=$b)E+^fZp~SFT7)7lKBnEXQ*<IlRo+3z#HW3eKXlcPl-fwu^ZDiD+$NFFD6R
zw{RrdqHS9?@t<e~v#mKBoNKpjccW*qM@MsO9~>Ta_7C=VFe{e(Y_q-PB;cb*+dJ@V
z+15SW+}?fL?ra?#9B#K&rS<GtvnsvPs=_fUZe3z*IH{8~fY&>(pYI$JfL1X87W0eh
z?jN*|4i0yy@^Y2yZpUO)7IeEI?Dq72iT>T*Z6Aqv;=uyiZSQOzZoMKfD^+Jf*;m?x
z?mQSrc<)o`MJIGym%5HG+GDO-2;buRu$qC-ujsDEMchHz5eK>Rv};`|W3Wah?eE|1
z9=*a^ANVV3pX4h|6nuxN{R8LngO2Sq{quh7;O+jAoVVU@?*IG&>NBd)xc*K^;%@|K
z(0l%~Oe~@)MjtMwxUq_?h~K5Ij5ck^FAfi03k<IRfuHRi?C)(J8Tl8UKL1&U#A%?Q
zdr<EA!QaGDL@Z^gs6RlNA><J(8VPSCGgArYleB}~NXFgHKdC!k*c)eBxmD-Pz!<#@
zhv?$tIz!OeY~1~8c(pt1g_r!`q#v9bzd~W<7%LCQ!!<f%1J;;gG^V_v0;M-OYX{;|
zQ!V=g5#xBEvP$>j_>-0%ec8ho-B2|^l3@I4G6GBwF^vLj2fgE(*%h2VxZXOHFy!cJ
z6r!-eDhAwt{@&g>GUnq?U9Qge6HEQTxR;Uh3{NO#=#4M6w}Xk+6Adxa(v>1hb4S|6
z0v*6kTzkv~38^$tS=#(;F{LqA_kH%9k^C(W0Zhz~&f$S84VYG;g-3QvqedHS4DZ|j
z`zNTWqLz#_?zf_qY4}oBR>pCl<$PfcxCaK^`ZAhJ5nRvQUl4C-2TtSd=AB6F5iL8C
zymmPk3{pU5Oy8l31ywPWK{L=15`olflsCsQ@g;SWc1F~@ho@+SlQacINa#YE?Dbel
zi5vfwrl?-1t;1s$`<V40-i>K9xti<elx`LijN$4o;pm4m2x#?Y1muQta6~p&KqFmi
zE*^v%zM+`9d>KCPP}n8AN0cDg0Vm5*7<Tzux%{6@y?R#7wv?Yy*=u<w-Mwqd94`BV
zpKF0CX9w5?u;P!IvlZwGZhgoO;k8i<Fx41G!mtt5gs~!x<-I?%A~?)SH->>`BY9(4
zfR?!<NtcEiQg%`Fv=F#{^^V2iSS4_f{35~EiO)q_BG9U#YbeLZmM;G|zA{eb^b0o$
zuQn<%;fWF39WBT3%50qQeZ3_P(gAC{$$kq5rG~>kBBQDpqm?Gw*hlOrf#0BW2g=>1
zuh!t(+?hY6p?e)%I+`O5f$ijAq#Lk>GZvWrnXvG*%35=?VX4HsJso23!9fs_x2Yx)
zRP<yvMEvk!92JuGKyE7MR0Q}jxpy7<v(yTw!mM6UqwVVMpe#_JCWLbCRu?}GnY4Up
z*=Qa)ph!>CfeN+V6eyA9bf|`EZvq!ct{5WI<&8ik-C|HK@q@5>1CV%Ga6L>Ees2Jj
z)<T)&flBlMj;;>D6*VOxG)N$V{|epdb9DFsAm7~kQK|ccoehjtuvuhr<F);4-S<X!
zKe=EUe2k!=%f}%s<7ReS)SqeXe$Hc}mD{GstT~`9gyvw{5ap(3M%f>-vXH13X2JiV
zV5jx<e+5LB-}w9q&kvM;I=YQfV}A92YvfwrXyginubY(Sp_^+gzF=Rm63DDh++g-|
z_)jnTgNQrV^^N>LydzZMnMog%+$b?7#u&M1z>zF(*@GYLGc(Nt#dOY<*9z!|U}b4Y
zfAaPZ`t!L|h|#nI&6Is%jsuSV+}1%yf9B`t*Nx!KR-mZ)K}Nrhc`eV&ylz0hOu$9n
zVa5CXbxM#2-h|Gl4spkoPYy+cismuPHyBra^!VqDDjjuhFrf3Cq<KVda+bakq0ghn
z&>!bqcRO<hqjlXxt^7$7C4)BqT)7dlzHFK}P{wpA*eR)lI9)68dei5J^eCD?K8a78
zyp_VqD>w|@)L24)ih5x=t#*>r8jYiIFfw;5!&t1<(g<(GY5!z34{n;iLS4_C5wq}Y
zV~(#FkV~IB<vX7hy_41KsFK{W+-OBZM-v?tqgwXs>)VW)(zjdG4Rd|d*8RRl@8c<W
zJuwaCQoCb8Kefnm(}=y{B@jR6R^W)O&h-xnC(gx>n6g?QH&kU{R%s7hh1C^REeSMP
zJMk60G)xKl$o%&!duXn$a7OrU>QC+)Di^RXbacHQdsRjyIp+H?0;EZ9!ADvB{CcgS
zI1f?C4U#mIahI+wdvVB=OpeRmvYIAux=XIW6PjKTY*`~%zoszw7Fs)p{V=739*z*)
zEOb8Z9dA=%edlG`EYyrdr^BHCni5Kdy}yQ<dwUi0oC@<Qom@fjWE6D6opTt>%KpL8
z?u(y0FL(BL4tKXmAJZ>eC<3;=5%mfHQktxBqZf_StDL0h{nC?;hzd{bqR)hDonFM5
z(J{>gpS}p)gT!EzUODbx*R)2(-GKQ%j>Uw;geU2i*xrh=O=&V3VEA{6%a?@11RWX8
zMG`|^WF=O{P1#riVbT_0-uo1;EeexrO;>}p2&XHw^f0Xgl?Xn**X;zecu_l83SMd$
z=FHG=qLY!ipwOyhd&G5*3(qmX&{WBKC)lu?xRzNV=cu@8fx|+t=JkJi2w#d1knt9B
z9ML2R3px(@mji-<?|x>l5R7rsR?zR#l>j=ZB+swt>Xl8PSnjAkb*vcq-r-Er<Y3F>
z>?n>&+Plz(xpMP|WYa$|r4)P6@v+dLtEDA2bw{@Nqv-0_RMSCl_XOwBpd%Xl8iz!L
zl_oh#H09H6qi+cA<m}-2G8&mYUvrkotQF!Xw+LplUb=>0ygU7HcuLVY{h&Kig#GF}
zQ5p`|PL%I1);YAO58|1UE#$|kLZ-@8S<_wtrb(u4i&fJxjh5I;@AZ|^2j{e{mz67k
zA*ui1tb**lNM%vmv!mtManSu#y~Y|o8|23{vu>AEE*eIr4YYx?X7o9>ngfX%^&7xM
zHNDF?JzTRBy6(?Mwi$NFu*qKh(kA?-N&ZsHA$HxiG5Y!@@<*CxE!We!YE^Uli6aEf
zT7j%bOF^swZbVzHYz@v`9j<$8P9wDr(9v>aGeV+&ZynWHaGb;#zf8Fl4efZ+|3sVu
zHW#s2u-#hZke}M}0S|<q)LDE%VIJ5P6_bhyJb_|2;hcAsK8*P1PjBU+kdUh*2bCMv
zB4gA!>qvlIj?9NKvoMqhIzLdz0Tz@!0^x8V;(Zz=?wCmuNZdLSG8w0Yk7OO_sOAzV
z8jlw#pOc-AI?jg+j7>&l?j)3;3r3ny9grV8#+Md&cf_p9n@k}IvtNWm3|7bcJ8k>I
z*1U<+`v7tIy>N&klTYMTe;~D0ERCNgRbm!8Sp?^#a*4xcn88ohHrsEm@IH8ImZ!)U
zI!yq{rFE6nT0CX!FVTpTj9$qhk-~<1D@^*yQNYMxNRKRvaW0LS6-)lm$>g}s<Kc6T
zMGnK8ql1Q`j9)FX;P3Jd$U&Tm>LkmC4=GA<u@@d7Jk0XyvZ8tRH^m3Q%QDWmZlvRO
zFM&EX5N9<%@<x-)yIBs!Vg}(hlnv-yGc%e+Z8{rp;pq!q4T-bGOaUc)Xohac9lYg&
z^N=q0Y62`2+vWb~){V>57gQBD-|DnO))b2z%28!^n66H*=fn*%VfTxoby?#~+pvyJ
z_H^0;m*9&Sl(8R5h(eHK;S6GaKAj~%WT!xELmBzML+hfR%Q|LEiI(OFD__8RGLh7N
z!=PeMzcq7m!DOO1+N;JNZ3}Cb+B0@tJT+z_l3s#Q`MhPFTO4*GpGnQCH@W=9Z^+K}
zgW>`-kQ{?<7tYQgtw|6&3G+9V)3DNEGod=YsG9;8rMmdtsaCsBP3T3BBG~rs))8u+
zuVq~Yq%#MZCKzCWa#I||e`liEJ=v#2HXjPjpw-Oq<T{tKI)}A6Mh!zot$tC@RjJ_p
z3~djZM%VIp3qMlETRwxc^#%}9*&Jl~k;Q4oag0CHR7bAb2+1R}3X6^|8THsy?O2g!
zEK_CfQPMgwR*9Kz&(kYc8D@EO(XNz}wQQCA+52<G%j9B=;g)TJfkxgPV5%2!-eI7o
zTD6R6dag-hV?0OGItA_*q9Df3ITX;6d5+e{@mF>IkBqU*)RCAI9X%Ldj25?6h?Z`N
zSME*W+q;JXU_|vdg1GEJ{3ByF;|wBQ58=remURpNVW)WbvM-Uwb!Ng~C<iw-FBz&<
zi|j+;*oNmUtxq%&-Z<|GyHZlxZ1G>$-j!B$YQv5=(?xp4X&vUv5cJRQkIsVQFkM&W
zW@~xn;p(Hue|d7;?S&_&XTN?L3`hSMC+Xz;;_~XZGOuYA5Pp67r})LRzT6u|hkG<m
z+jw7O^SMys$C|`fhcnCsPM}7oK&i{MvUw131QKsdU8d*A&SETF*CI4YWxtXYyZY6J
z2!J1j&chk8hC{dFF#Yj|$|j4{L-gy1sR<+f4Md~64_zgX%*<w#yPi0r(2X!)XpBzL
z>&c%)dldn#NZ4QWuBPaV#yc^4x}%8iM51u~=>_ASj&dpRg2V)gH2D)KN=_C~{V%IE
z_`d{S;83`LSYOjO&1U~J9>a<nAm~KZpEPSvnvE<Zj=D&vV7kvDV<c4An^na(TXpsl
z7fLY!CoLe|B}O>$u0-NVimA>5PDN=}H0wSJ59b_csvzWn?_ch|nVsil`k60B2>MfO
zK=wI@>!BH(46a@nuW=6H=^o$s8DmIZjt5z9{iRv-lEOX~yla_?PYT~rz3eN`%e-<Q
zTd3W~@@_WU+VZ2C_AmEp6W`?QOWA4hkB<1s9@1K^!h@Nq-McI>{Wu{I(Eq6x)9e>U
zq)pm8iB`%UVRRY&W|!h!SrRRlco$_;I=(`eei^6+1<KPF6PzytBcvwDWDrh+gEyju
z7LnAYp5t)hex{nV*jg166;y3(sLJYcy+TH$i>p;2{`;zV**clWUJ$2{;#)Xd;Cl?y
zGVAV_=AA+=F8tD5@Jklw(!xwytyY0z-G~ow4%#=A9&q=+i0iDkr$>pOSPQ58vUcUk
z3#iyD*#KpZ>>!cSjDI=LcXk(~<76%|t`;?*rI|r~{`JI#LrM(%U0TSJFK!Zq@?0Xr
zH{QMSi0RL?EvyKVGb35m=XBjA?F~06?PWyIt$H2Jz*+Y1wF7=8YOqOki!0S;&z2mE
zZc1}c<5os+XaZ$}N{d|pHHpFwHrv4K0Wz)P*oaP^rg3Pf8yA0xgN+xif5dSr1IT2r
zWD7^V4mlk;XWZk!JtlFYO=snGlJ*^yb(C}*{eZ+*T}pBqF3g&#*UCe8#@ytYoI7)h
z3#@f7TrILn_{xY?H{_O1umd#8E8?LAeqdtbkC-8+dk@cHGZ}qwoI~W+7g^0sk7cP1
z3k37^PV9<~VMd)<E!<rk;-Ttjx{iOBF(42uv4<aQU#Bs^WuF1IEC+P+&rYko;@4hw
z_$SrP&v#D9p5hM7=a2hd3Ix5<J*qC^m8}}~A2aBxqSwpx`oXd@e}(9Iu@I+TTonn=
zPTs)^O$Eu#EIHHPW%;}E0pq0Ug+ywT|N0O9(EUXn1_p+3DH(T{_`xw8o6ZKo_*0|%
z^=)8a{YQ@;;@{Te)u#Km*<4;;ZMGi%SL<PG`O)g?<K-17*LvK1y!>CP`Snd-|CwM0
z9i{$jay%KPlNsf%dH-+vA;A)}GMX7zla!83I_uz8Jh~cF5FJ>CYPs2bQeSSifTOj8
z{&_$)xb0wg0(C~CSUn3stQm*DVLqbMK@efMF0x+VKv<g~l@cuEo20Zi$qfmMbR5A6
zP^&g1`M9{d;S<gsL8_jFV+nAEYcdi=C<D5E;QY%q5(q}&co3y21t+H5$vvAN+2*PM
zX^ibUM2ZO0HNi{ea3iA=L5g@HIr;+E4D`X|I6lW$dff1y1Ee7xsfg@BD1#KhaT}H-
zEEX$hwc8J(f#jYqLd7K1ph3~7Kv#Q{Zdink#zK(#B5dRYra|@ME*-=IJ#$NFSxTll
z1I&mL1^vX1zPa;uJ7W5`FE&1;IKu$0fE5$yFt$%=3h+dYQZ&K9fWregY95oiu4l$N
z#z3nvXZ1xK2561T!;@k<>~VB%Q=U+A(v$Q8Nx&g0{K)CE3w0wTxiQkzkf|$4qz9Cw
z^VM!!wGUn#z1uw8QSklE;lWS4+dJFp`OoljM{OOv`T217<*Ot0>R@ks=di6d_qXBc
z{?Xy?^S4I_@SwcehMHwsG4Kuzgm?b-=5VLoRtJY__w}2-U4RD-9B%F(?e4T|YIlEY
z@9j3l`~w(j|KLdN?Y`bUf?`JpHEb7w<!h>g7wYxS;npkox%qr|Z};eDYVyVI(LOf!
z0@~YDZ#EB)cFB=Ty?J{G=YN8R{ex4%*52ms>z!>7%lDyOwe!=?{*h|G+63{)@9x37
z{hdSXfY;aO1Z!`1^ZDKmHwV4l-bL3V?3Vqu1%n7k?g8U@v$M5}Uv~bs13lV2{22tg
zL*i8j`|X|oeGBE_z1rS<z4;RQSh;3&V1~Bd9`3wG#1CE|oc7!2?W5hJw?{kb<-x%=
z4SRd%@Tc9ao%U0;chIJRd)wZrK_f?-*gQgkQG?g;{rTJWE{-1!`u-6}UvJ+W?H=q`
zVb0&d2*DU^LhWrD>w|sjGYr<j;m-&c2ZN@frry2Uf#)#i`_jFm!%Z9x4Dh&h<d%e1
zVLXqV&Z_;LmwUS}clNh-@a+Ktdbiu&sq*CQwz14EH~wxDT7HY&r%40c_^U(9HJVzr
z`$BDQ|Fnz9b74w610%94<O5IJZ?|5_=;N|jDwXc&gjnU1LC_t?N#m^SJQPa|d}yCO
zOVVBxH_kS^N2Hg|JnQwNWB(Z($KbL53{Ee@47e1ySq9iuvQ+StuD1PW0a-!#&w$;X
z`A<ga*%;0+_|S#dOISS#&r!I33;gLUBGGGsa_#Y3bp}<583t(5GfMbf(C_P*ve6jo
zb#(MavY_``$-_qw4X<1|2))^OCMCHeCva>>dgvUy+1YQm_ndO^C>$n9e+mBcJFQ>9
zi2E-Da!1#|FkL4uCOt|w;?V}0miSM88&HU0{~<^sgQyDw;Xm$<yRAo^q#vgw;`%So
zdgBf-{WLxu2ZKz#e$>I(mQ0lP`5<jQd9w1j{^%hStHiQ=yN}Dc@>3Pgu&83Fs-LP(
zP|p4BH%Et^-ThtUOP%)a-*?ns%<Ju)7n^VQjyijrN3d3Z?f|3Tg2f4JVa1erz4^C-
z_Yb}IN3RZdHi1{IHf_*SU<GYpKb`j8!BJba9<BVv)&XwvV)vy13v2!8;N{`w>(1-l
z{mxIDdvAACtGQ=SQb0!=sMN;|wwt(-Jf}kfv>4I~=hyPVJzIz83ZYddlrf<jAseX9
z1$%eDeFVE!aT@}B3T$V1c7f@4UhW)qXy4j9ICz6n?k{wNL`?}V-%dnn7n<Zg0<!LD
zgP$kw-69__GbTAeP?4}-#Ss0Jw7^K$M^yN!evSziK|<Om!!~(FOJs{+JT)=?b$NO$
zr}%(vX7=KEq!vR7ugmTYd|7@LCuuaYci{LNmB_^<leqgSOl|43FZMtN*9g|XU;rz)
zD=6yn!^wa(X;O{)u}RC4-uFS&@(M)aXc#8bs_3^Jkg+D(k7a5hn9?XYn^sIG<mgN(
zPbhNM3%pbAb?8pX@nfNX3>27@PqyNx@CwcQ?1NsA2L6*V2*&XM3l=@YSg2$MWsLP0
zY&Z&V-0Y)KGz$AbyII625p4Eh8mH)@HSAvHr#y{PoyL{Z+2-cvACt(Xhi-E2j1&-^
z{T224;lLPYQvZ*E9E5ye&!V4+whR>n?7U0NF_YrU#S`u6o$l*}?9p9EmZL|nnKh>t
z7rj!{C0>3VA9wu}O&B|lH&cGi0!+8C-@dbs)gteE?vjyG-X655WV-C5S%tfkG1@Y8
zfXj8JRLrgdK;k51H#gc9rz|`uHW>j8UsH@;b!gR4ac2<O1ENEoEf{K!UWhc*8BEgf
zvg5G?epXy8hm9`$S?LiiVaNg$Rb-?(qSXK0;tf*)m5|W+i>1!^cyi(r;v%j~v}1NR
zE3z{VIhy|(7FaV*C{8w49S<8IYMrRq{bChd+%C+0KffYEhod#4Uf&Qb3gBQE{HKL*
zCPTV5p97q975K*KtghmClMO_QCaV=8cT}{5<ik|Wpoj2o)=j~n0L~Y6vlyHl*gdqK
zlhFV`TR;L>P(dH5?#dkQb73Bt$2t(&_(0)#fl`F%ttekpb752SP)f=RH+-f9ueGS=
z22rBh>Wz$2tdfHmWhfrvbyL-YNJ(Qm9$@YDI;^ARL(NU~Dd4%5rf4`c*i1gNKM8te
zqvOqlj0Vxwp&xcrR>u)gn?qD@XVCC<V6BEyqeQ?_EftJWvt)0>IUf$XNj380;87>d
zB9I6v(lk8~V#TB2f-{2O^zFgj9V~AwV4I)y{`-_JTzSjlgIbogW%o5}v=Cu<Zl8r}
zET0xjjGyz8DP;?1w5j<_>u&d4!%SDsv@#}gS5(;9cVzl*UlQeFQaT+umAK39Hr^!Z
z9P$AS7@7(>L%-;3N_Iq@y_)uMy*<Lqjx#m{fCs)OyPHc6Zxc?a%_U?g+E|P?^T{~S
zi3c<^5163w<<MkIy#C-=Ee@j7G3|onva;!z*WhbTClj7y&<)v`$VC;~qLmW&dc|vO
z(W^kZS>P*}ngTJSY1rMiSJ#9~G#Ige_MeW6sM>RAP##@9B6`sA2AX~9WF4Clf?&ly
zAZ!+wJyvPDH5H&Kp#j<lS%B9If}i~pV0N*&HGel_p9K0qfWOfE9ZnIj6(czR@W?Lq
za0&ph#JYH`QlXbo+J3d!Vs*vS%$sfWq|mSA2uh|CxHpEcNR$~@GVDZ>8}w@8T@MGT
zb36y}^Ffe&$^c`pve#^~!AV;ZZH>{jWpjc&*L&_it{4uOX$7T-Y}p)0=91UfOe&c&
zi{WM1&4QQyQ>-2->~9Oyfi3%}qM2yTFi>07qo30-J+!|o?n%k5Jy&epVhupPVHTU6
zmhr*YHGO^KW(M5udPC7YIkm-!^zdXemBkiN7PWB=XT}MqE#@q~fa%4c;G;=ekrnDM
z0sXb+h<;J8a6p(u7^Q7kBvnV(({rw4e`3|RXca9J(9VnWK<5V|r$X3GNriDzfgcoE
zq*AS^GKQB@6x6Kq)6OC451jxg=nZ`u(M9b*LMCB;C9=$dDL~0Log^I5DL4<JJ|6D;
z&}ic{?)NJmYpK>KBvb2=XD2rWSrg!{tSW%Y8sY1M%UC;Q+hnGt8*OGH#a`QNo!rOV
z5LekMPT{I9=Osinlfq_m+Yt&(64WAblAunY=|>Mc=#S7%+r0#h&Am7!>@4SywiNtp
zc(p~DNyAE($7ZUxYK|twJVo<C#B6skVyihLd`MfCZecmVxyGkErg?mhIm6QPtiEYt
zvXuj~z+&-9FSx4QPtPUfHdmNXaNY`qb*-l7jr1H<7}doVD{yV02kVMoqssZIJJQsW
zO@V4r7<>WRgZa=NIB2UP+-)%r@g@6Cupju?&qWS?-c~I6G8|I+IPrX|R3<~br~-Kt
zx$0t-+|I?zxMChvtJ&PKUrJkr^i{IQk$$Vzm-wCJ{kwl~M7JawuI4}emi2~4o`qOy
z3-tbS{++ggrO3c7j0e<T)^>a<Gtl7x<AV~;sH9y6&de5dO}$7vu2VCG=i<;@Xt9dx
zR~wCb<-E-gWaV+q+s{s-epnNw_b}8`ccR&H+6%`}qm0>XH{0!<L%bVSFE)4gcD6A`
zuI4QT6*knpWbIy0E!;~MbSyC-@335>HnF)H;v*0i^~Be)*J|N%!JYhn#{OO^)X1fm
zo-HW7CF4F6N%7CR%9x5;kS4&7B}xLPn;4=cD|SGnDlFj{66TA)9Y&WGPbksNQd!5e
zG`*~EpjoW5zh!2vyk!DPcNseBKG>!uNR_+a2sw?%6qgHH`axRy(KG~8i;m&t%vLyS
zG>UK{B3c7lqV(jW8qKS3-s=s~6c_@)ww{4;8ly(49|pt8$lWeEz8znr^^^7WmY0&)
zU0UOOU;wJzkJ=%e??ag|67SN>n!bB8*HblhpQdMhU1T4$qrHD$W#+7)f6AG-VF*2m
zIDE&^URzHjw5o?d<pb2_J8uUdHw>gJ%T1lmvz}f)%~qf=Lj@Ihu?R7XeLD<HdGqbj
zD+)2HoED2#!?hqhD2PT8NDkS6kbWo*>`5={8ysm^PtM`ao4ucLiVkw_9`jIn;VjaL
zi<u^?NyP+>qT#RoGL-q#45Fq4vn0(<Xl_N!YHwy^&VrfV9G`vQr5NK=!CZbVm?R2P
z05g<D_cBT=c~7o+KxgUhbMbaW6SbyJ;5@(@T{?himm{>PD_7^^*g4QNVcx_P(P}}p
z%=n^agO}i1>AId54W^6)b0F9`b9?8vI+SPjO??1%GHy#;JvtUU!~O&Q_WR)ik`4IU
z?U#e=E+&)Xj{8Wi&B!g$7a#0`D&9zo;__vW`+UOBP^E45v&D9kv|xr^A@?T35%qHC
zh#6KH)n;XPs^_R<m1~BQO)f1yd6VSpZ&KtX$Nsa+Irmvs@FtqUzQj=z@0R=H%&yMF
zImc?%96PbB^x&@`HB>6@R00)LL3qgTrdaU@ry_c3KvCMjaB&x4bpy^ljcv$Uoyz|T
zn*Tf%kso|S(7^R)j%P|`jE@*hNnyuay7udM$@h3!a&Gr^TZz#3N9hMDR8_icx$HCs
zdjjyuO5}+>K@zIwngW^!aCqNA2cKbhQDIO|)$uqCK0Wnow4{cm)NAXxBFLQl(C3EG
z;L{S0-`b7#1zBD5Yz#Nt5a!zm^zsXiG2SSepEy|rjl2TF;dK=5W`dwR6hk~@T1u#u
z_YY85D%V!4uG5w(Ec@>8VE^SCI0u$%Pv$7TfAD7K@HK*Vy`|hPNjip`P3?5nOA+M_
z{HiZkWcJ4!>2CGSCGG~A=&PKw9uYH-p8CZsrDqB|FSyEY`kklpFv#(ZgH;O`o7G_&
zlVUSL(NLK9bp4^eW#xcbFM#|xs#VxWpG~nlsc)S0YMVQqcZa)2X!TybQ7yFbbZUu1
zr*Ed1-)}M&Z+<WXHl2l?NS`fo<!gBmxveVO1R#<Dm-FBb+i5(4ZWj0*XNc4cL)Bb-
zoyZHc-SFqzn7U*ii)o1e*d0j5*D)xoW^9o_&iYijuM6hPm$clKe_yW)wV*Z`Nrq#h
zQ<O9=ECp*CA+|5CKm~n*vh)U&!na0#)&B5CotX^h=uW}9+3ffAWu2>Lbr*s%ldt=~
zfwt@*Kn}_BiYicu9O$4+7x)@SXjtDE8XGOmpJc(}OWE4YYiiQg_?*QX-ObY5S@7R-
zc?Tg!y`QtKntMHKC<)4IlP0t7;hDB@F;ittOS6MVW~y+!-~l9}&5WU#Sw%9n**G$?
zCdu?BBM`GlHR9BTvT)x=A0D)vtU}uK&F5PVl@}Y*QuYL2MSvi<aHXp5shQPt?f?2T
z6VCKk?jeT4Xf5ZWVBm*3w$NO7FuvEyM*LY?&psMyHo-JpNXbOUbXN)UfcpQV;51Lt
zqNUF53^M!fWwZnXMXJhKD+wHYP|ZDo3ONfK7zv5|X-#3=lT+4`)6Qsa7s{2b<*N&5
zHfEfiQ+Fjmn?_?h={P6s*tTukHco8Yw(WH6j%{{q+fGl<-ORVv+{_=St6H_{t$Lol
zyJm*SrBmvr!+zSv3JaZkE@7Ru+5-g116G*s6~RVHYeAhJ85;$K)T3M*$e`dn!rLk^
z1EXO~T0+(%U>E?hDD`52()5Dx0k#~uiZHiIoZ{gMTR-Y1VQJ=wj7XGRSW_;%Tu_m*
zl;L}@Od4Y_YD0b^Wr<PHHo7qzfpyTVC!w{`F|Z5zft_^ttuBeQR$R~r_T-C)6HbZS
zB5s54yN(c7hya9c?k=D=pt9?g9e0@i+4~&moUt)ELI-gcSGDlvO;Hez9{c2S*u8d!
z80Bs;d)wowyj1?R=-9duPP}L#XIGa7PC~16Jl5#C;{c4h9%~FaCe+5^D9D5OG#%mr
zpSXK>G7u6Pj<aJ00*7J%-f1m&d^)Ff3az7s6dAaK@IB-GNDME-CZlkBwHl15JQD4N
z4dLjj%;hbQ4wZ(dmx}Dk1eW7EK}C2k1ABuqIpxr>Kv`E}1-*0?!>GS`g)ncv3lIL$
zh}qlDvPfhmBXaNQ$$wge$)DxYgfiB^S_6f!6{}#7gbknJJN4Le&`FD>5D11+5rDEm
zG!r+`9n-kyv8L~_h4-0FUt`O+FjtGij!KRtx@3C6o+-==Opvz1P1Cj!BwHL&REMAX
ztK=lho%nSl<Z2-Gww%3Ax?BWsa)kT3b_X@pDpCKa_n~!vCOHbP?Mkat#%hK6tu!;+
zPJvX#acr^6*U`9ca5Dz+-bRFvC(fWnDs{{Ep@z@}r0d2{+H_aV_T8Z(%aoTzh68WK
zu)x>^F^x-c@OO>5%u0d@cQ}FV)Zmr=V;bdE`vUJ3!ijGwPf)E*l=<q5Xjh8H_4Z<=
zU&Vt(UcR@BGtUd=AN4Z(`dz-a_B#+$0pOyL!&yTSz;#bUI8G^{;M8VCNhFSTCyuhE
zwWFW4sAen)9vCkNi`AVjPWaDKd9t&V7c&@=^M)WI$dJEw((#9AcZ>Z3qAMs_#N5Q0
zC7{<`VmVpuq$?WP*PFuwabfavqlu)|jQZr-w5kC=mMP_8DD~8?>0~uKT9xVKEoub#
z*;UZ84@M_NE?W*z#BfBcW^h416OutDw{kKQ_-f{OLyG76@m&&s%fR72J7>b8B@=cu
zOSuTg7&MxY`zBaYM(Lv&&!yWG5QI};pGX`s`JQ5jVSU48Nt1B^^gcDY+sg_ZX^-1|
zdWgCznVf~l*><j~6(*iyEg#LEj(cwiu(o_V@_Cz<2q$LxidB!O=nh-$o!p@qgAZNF
z7guT1EAjJC@_*oKkfz|YUtmt+JM*oo`p@(F?~xe@4Du?fe3;)z*9WtD^TR#wbz`%H
zFT?tcNyR>7LW#KEY9x6z%>Y$+LGk`=7R!EjHB~%oYlJghqZj-XI?gVLOzUJUqdI6J
zOiLzyoZ&$-+5x_B0fOc7;yA);<s9vzbj3b5-*F`s`p>MYS?vpaBRsd;Klr!}28U~>
z9xuQl@B6kaIO};nPi(bYS^a#qxXyC})ub6+<~ZEfRphGPYgcdccmvssLK@|t9HN_+
zuE#>UHtzO8?GkJ%p?Ujy1)NciPH$ZHU{9lzuKyhhl*8a*Qxi=Y_R6#1Vw+{-5!3H#
z>gD%N+=DhDF92ct_w=w(!R(DB7MmDbrU(wEqg?-}K$jY8*Ly}q=mu;UJ+`=T7M*-!
z(vYj2Ml~ycPigp!l$A#aYZKsRIgs~>PMjG1?pTXBI^S_TtV^|x3Tqv#KIi#|-68U&
z802dIwmp-Op?jzHfD&-6hbe;r;P5mVmz34z2CaACXKUHrX>^hrl+%ARx7^ZGzztNO
zaTCFC$s?I`Dyd)*p-zVSsIOXIpRu5WD!PXe<+$8EBQECt12Pc9nzGx6Z;O8&&b?7;
ztHk)jwRzPkO$Jq%$w8HAflEcNZh&>HGVm_i?;wjP$BUX9uGSDq|7tsQOaw+?0-q+2
z#%8vjG~f~OnDv;<Y1x%i>UWHVe!r^sYBSE@8q>qTjK6f0UvI@yt`SUky(~~4U(mgf
zL^BAXb2;@%4NMB0XDhy$S$SS5S=Fhxv0B&P%2rM#j(YSzOjESp6X_5N)Z{vtNr5fa
z#usGw4HVN?k7{~~U0LN~K)#gY8&Ckx7RqmbY&o$?AH-zET#HT7aSRj|Bv`YExu1kI
zh8qoR=T4_*cYSn_#tCqW*r<Xd91@U(ZcAP-gNpC37ANmzaymi{AYYhQlv6#1BiU56
z4TV}^o2ZSr;qHt~w4P>faquiEFnP-8D~lN}CY1!osq`v?&BT`&9I98TJcm)ev|dw8
zf<Ic!d>u?)Hu}IgYw1|w)n++sXwjUjDuu(fv3AQW{j)DKO0ep(6`LHPbN=*q7m1CX
zBP$QLP7A#*XcJT?jJ5_<zW@toWiG7Dl}6R~i<uL!%5OI-YN8(3r}W&5JA0Q`J8eyB
z)H^+0@23jmkx=}c9+tiF0`#cbwWfckN@+TDil33VGE(Xq;a<os89|67`_=a}wKcgO
zx<Sa#QuaBTQ<`M3!0>|>L_#Do{hD=h77!owL<p5xr`()jTu15nVkfICSWRQMaT1m@
zD!KL0+(&r0He=W(oELN*9D{Z6$Jl__Wge>8y@(5L_8v*&fq%6Ws%F3z!4+#QUgPVR
zbf((6Pf|W6!CttaH5~_IJH)=cXA~@<d^6&pwT^pmRqiF=<I+WCnC1j8szh!_5bGG#
zhtV(bnCN0T^ocR1Pu(|_OmSUg99#{24*c5%A??y9r{ef(=0}j9)0dG!sh5jnzemv5
zx%ewG0B-*-(WDs<7r@3x9-M&+0Y(r5kRgUQ9Iu5J_Vtsr;j$wRqlFW{e6f(45Z9Os
zDhu&9vX@*DY5>}3Q%J7!g-crdHUE;$V*dJ33>TR|;<{Qc&7cwk7K=fPn${wdNvQIx
zN=$EOdRpO_6yT88U+FH9A@@a^aqKH}OV6;{R>N_I%p#*$naJkida!>UZ+MZ?pfpux
z&x7HIQ5=Fv4wF;V%<NU~lQaK0b168h^G6eW#fn(wUoYErInWN)*gheYz2vRRwrF*n
zg4zW^iUsp}JH>M*MXi*<299D@f5KF8dOokkv9!ar)N<{T1r_x9Uy`EH1<m5kDvewP
z)KC%>oJ`_UpApBG?if2}Q{E?#LDOQJbLNMbVQc2hrw}ACVtWXLa#G!%X(Ax?`fq9w
zqO8;Nca3Mg-tLUCe-#_%)i_MkKXHpxz^g1zp}H2DtmV!SYs)yLOHy8k3QJiD<P#!g
zsFGtO-FaA^LQyXRDYLE{SqR^YKgAvyMCQ^EI~@uxAJea}NWCP>03eqAVqPiG1IMs{
zw5P>Mhkk*{#1h;rlh|`m#~YyLc3Q3plXO0kE{UE*E(LeGaHdQOu`h%6-Z=31r}Vuu
zF^2unlBQ?QO)8oswhI`inM{f!MUIa-yTxx&r^$yU$&n!PZxS4(ZjucntH-#{*hl&C
zY6J=K;hvaLk=t;y$agYj_#@QTR6YR0x$Jq>r!LYVu{hs8fqNZe$`s-6V~>fzTeg;(
z%$|#-&E{<BWsWJB^^T>Nc^o1S57iXygN7_Dy7#lsPC@cz4{F8LiFUTtLbJ2JTa4mm
z{;KHhi0x@3_fwW578N~$zthT}Yj*zv7Mj@xWQ6k?L`SAppdgf@PZf=B>I`s6klA9{
zW~Gc}4TB+nGkr|jqRb^bmv~L<kt`J}-5=*KbN2_#U$c<Ymma`(Afj0gOGdw9mRc>q
z1!aJsEzOs4mDju8qJoeKgV^)VD<=JFyW45NdA>%-aeQgVqp;|d<gL1;;&uYotJR|=
zk4iueVrmV=wEN;d45BGvG`Mh4QwsSgmiHZSST?dWue8_W2pG{F1g|HpwumAhF&kMs
zH4v>x$j9G6dCMtVSD~5LUP}AfKpw;0tI<rZJKW>{K8Yq$hs^7|4pCZx-&p$zJM)jP
zS(tH9MYrz8jJCEw@^kCJzG;P|TyZ7|j;_1rmuz6wB1a<Ay6cmmnytp0-B#hQFiqX`
zc0IPW5)Yl`3XRf6=<+ia46txHK7JZ}=UQx8&3sFCIUF;$fp3RuW|7f1E80S#td$ae
zF@1(TXex$W&$vR`Y^cuU_U}Z6y4#b=k@XXIwJ-94misS2*+GI*i-OIfr3+KGK(}QL
zpoV9VJKii&1f+F87+Ny3*vGfLvWVskwe_EyQ!u;MZ2fr+eHL%ZIu7k2%Jnnd44%OT
zQqWWjuI-L-+O&PH)kF+`Os#l&Jebz`P_3YLJZeJjNGR=2zEs-I*58|VtjU|^SSYSV
z2Nb!{;Wr{Ou;J~PcWeW^T;WQW*K%epFB|#`DO6x~)Q7gJDKkE}Xwc{IEC-tQ-GfiW
z0GlPHi8EE`p}$kbL|(phd`LZKxY9*Mg=?9bsY)$fVLV`VyzqXW!e_XBc{2eVkjjWu
zqf0B&q!P5T;l=HlJFR;HsErMS5iyjTFFy-0kfkiUuMMg0<0Q%M0Z^yK2UQ5L@x$S$
zwyV?plT@r1`ju{l#(AVhM>6ra2Re%#FhV+sOkLbf6Zap_O^)0;{qS%dB{m17>$P3i
z=!EE!vuQ(IoBa?2wO#3C^TvBxYFb(g9tY=-0G<7~qpFMYmz~otCPXB05swaUfGtKH
z{*i)5riGUajXW21I6p{xliA=tNgW0~dmD<dn2X7FK->Gr<RfDc<!OoB1(DE163=HL
z9-KKHHxLA6UraL;pjNIW$e{KK#=Zj>{<LTHZNd!`uqH9Al!QtM9?NNRc8giAf>Hyq
z`XNLNVaEeI+U0~rK2h4#ZFWc<pwhI<uk}UJuAp8Y{BbzB%ijS--#s2{<@hFMf}4{M
z7k66DM-UQf=usReAn1uM<xs4p0lY?Qetzg^%lKq&<(~1mmzoMytm79;o^z~_!x>3J
zk5qkhsm}%PmM2_tzvt*=nIns`BHYSARhFQFOQ6wqpAv{^Wi?fHs{iFf;ujPNPwnt^
zW0Po37i)zb6T~!z-T({h4BT+eI7nH~>9@hq6`JI0tCAnp(nKxhp@h3>D7*Gtw%rUD
z4&%Av-3@j}CbT(+L#Y9&0-tb6RW0|dmitXQqnlJjSACzKC@El==*M``i=(fAdJRwS
z9_`=`ooS=@i2+f0RK4bdDO*p2zc&jNm~*{lERmkz?O*@W?=Ge{=tNKfhO?lqmLg?U
zHd&yqynY)Zzzxd1s_OaI(7$}_Ys+qU<R>eZ$M7B8(@EAtL^ZlIRI??34%Z_->(2de
zsPO)`a_@{)V*wol^8q4mv)=cB`3X)_&`<u1$Hj^n;pof|l7kpRH5_$IoN_np^d=mO
zI`n4S;Ct>##m%g^-I9y9LX1b1L><PgfGzsFYZ3y9QFOU0c`*tdThTC6t5eZ(I!W`*
zTm(j37)EZ`lf%i3ZUHZ=(BNJwF1zR&2hJl}#@N)RC-=GSIv`>GN?Fi@-Xyc0OF*FP
z*|(+!L|bCafV~TvYjW7b%0O~)Q($-@1P<vaICn8-fzsJ9`s2c?kzZwP)9E7u`v}ry
zJZiTf;SayxCA=NQC`l~C7c=n?%OCF&O0GP7kWEsSX89KENy!rkL9a%9$e0fXhgsS$
z6~%p}vyuWdv8l=4FN_Kwe6M9tN`&%$v}S$MECD}6I#+LAESp?LN=63tCkvTa!X{{|
z^7%zQ>y*1S+i3T%;lyO%$j>NcR~pq$bi%?ol}_PD9_nxv{=8!qJk<YOI;$>K-YZ|G
z4fy#rP$(z8wltP``9-J&QQ^WyPBH1%wH{9vyNnaXwV>_@cgc$LRJ?RELsBXYcFhg*
zZtO3-zFDvuYywBUYBF_%`?HXJcTcA;#}5I@pIytY!i<;uFr1}}IZ3g~g}gx=ZIj@i
zp^cR!`DtO|0=4&NvZVr4u%S=t0eIXaktdWIiP#&4Ig;fm_{hUgp+_+bB^Y^yioT#G
z(6pR&Zv4_bGO@o(DrTI-2l+yxzs0NN-XBa;|MC{P_aC{;NuIF$Ej2IrQE+dLn2OJ~
zB)Kb~VC}N<;;_91u5~B$frS8VP}fh0E%Md~Tx94FX=XX+5PHEo2OY}*!mXi{T}-*`
zj$dvI&0F2QJEBjVNV+B~>!`KX`_;)$*GC<FHO`nx2F~?X+@LaN-H6fsJ_&L?e#%`d
z$Yn`69bU6|5W;N9;(Iq#Jy(HB+<ZUA8P++I{3am+BHeK+agUI?w*Y@9S;H?_%Q5$3
zl=ReAHfI^laIvgnWlLmx+nk3=Ard2H$87ZI2dnUI4t2V2GyR$r@p`ebeX4UKb5W2x
zADz<8yu+A9)S`>S3&-9v>xr&i4bd`{#ClyNef#G+TU@g5Kr?^n?6u5W`$N)PT@+&_
zZtn#Xu;u$~Xwmkus%XcE(_qRhVR!YHz9o1vXuZ{8D<ZkUc+L0VJEoH1E+Cv==~Bg9
zWPLNgYQ!x3gJa(b^0C4<X1MP$J64DuvoD_ylcktq3O}7z;00_0^9EX5Ca+_RdiMyg
zs?smy@5<DCxs6BNbB1v;=gh-}zNpff6{@3N)vEmx_-w3~G=dQV-Y0iM&44I)!Icl(
z#WM#}@rT=bO;<aN*P9M?PvDysR+T|(d1unX)EY(O&GP|SPQ4G(CofTSUj$2ytr|tr
zT3W1nFDF6w?cN!W*T{@8MX-BkX|(mU3;mDGUZxYG*Ne@@zftxpPlz2I5B1GilgN9N
zRrS?JU#N31I|Uo(E$Y(>!ZS2|cR6Uy%{591U8FqHDp14I(<Z1DxP&&*y$@+lyUo;K
z<^X)=ptvpn9A0Y!iiT-SH<$S6uu&Iqcz?I|bS*a(Q}tx_If9^Ju=z@3<Da?;wQpR5
zj{7EZ0z*~6rle_;2*3%D!4>oQPE)b_Pj@uYbm(-kH2-K}s@FY-<eIBED52i*Br1_}
zv<%PJUMFrx{Lsy;*XP}V5#ud^?Ax6bA>t>3=NSzZa7ikfdaP?G=d&k^JErnF6+-u_
z`2{I%{aF_6*QjloKGRr`4{j!!{&gr=N;HtgR1o3c2P{SZm_|GlXWH<MY>#n6nf0B`
z3$Dc5IJs5p8fg=wOuC4@R#6skuG!R3C4_6X5fTy6RAvKfjoJ+bzUI7<B5B|b9qO3F
zasnhB7{~Mb$B*$hZu4?S`zdA>jfhMt76KNPp+Vbm(P}`{6CGqV`3n*(g`mR_n?+Ix
zz9RAI)7Vc`I*yJGu^s>HAO%hZ&Na)b<Z4G7(&kG@b6g}g1nnB``6#?^x5=JrQ{;SA
zM8#xJe6*kM`mkYCTfgJml(0e9MU$RTYk`2G%YZnz(>X0t^XEp-$9uD$+*Kpyj+5b!
zUrht{4Om!O=%(oT9+R$F{vK`u0CndJKTcohXT!IThL<Wsj^{ZY2(RqyWz#zT2N5IZ
zF4_L!^=ZuR{Mn#1JmwEsKMp$l!q01MPAV1ek&(s~e|<bjOc1Bhbx|({ZCk+n&t!Y7
z)gIW7+;P<$ee>3MpE~0<XI0+p>_0krExhPXfJ1aF(ji_8x?6!4$%q{Im!Go2@^MwC
zuTcEv&hvp1X!;Vm#*A0s3vLlcc()5n7emo1%6&8hoBCITwl~c!aXSN(WaW<Q>C9@s
zdj`&jseHM9i=Yne@I5DHcNMJ-C~QL-K<w}7;vB%A{Hsk;%ev`W9y$}a83eCSEj>IV
z(FmvruZmWC9Q0Y$$k}Ui_AR|aVlmuG6ll-kb$e4kO74bu{$|CZ6+gWAE$@%^m#S6Z
z{=t$7I0Fm9D6BN_y)X*$HXi0t6F<SDz@uX*6yIsFS)8S<2*1cj3-@lSBzK^&r`UP&
zJKfKMJAzQ2NU#5D#X*W9G3^`uQuo_JrJ<$F)UuAMy}RtOLQe%~Cf5PZ-Q&VvFBby;
z#GpnMb1oq*sVJB+HHT7Yv-)^_%X<n=4cIZxf|S*g8S|wXGdZ}Ix)Jj;Ger?Co}!Un
z0hN`L%-8OpRPs`)!xZgF<dg?qQdVR?QbqREots6^_))u&xHzGxO^Zx%K+j^G!)wuS
zL<=Rtl9vXPS7j#G&agqk+_75}NPg|sUk|jad7*v&QEPpbT#2sn{e-mfw<Bf=(zT`L
zKq2ys6a2HQ^Y>TEi5Hi7A2hA<5^``acb=j$)Gv2<Zy*^-a?Ca-Kxw@p=Lqt?d7$^J
zZFJRqmtF+3#7Wc@z74}R;!J>tnpr|z)-&q_nKV7lS%Ths=AEyN93K)5e;{m6Y&fU)
zei$fS>cau&e!0iGH^YARvu-wiN|CoJs^WOk6BTUas!z74oDBUCzb696VQ-WlfUoF*
zA}X?i7P+WH4#VhYTHhR6ZaPG{Df5slaxoD%BiSmeiCh-y^K-+)m!Ntzl_-m5{31JU
zy63jUQD9^?rB;{Jay|Q)m&;dSwovyFNEuRIcnI&v;gxYgGP$bD>ncEXM(J|;HNYC;
zD#amZikU^Tdv@RVdV%MPau3325FWK|eICYUV)+!#ORrJ(J6-10FUDK?1Y6{&;In=l
zzI|vQoMauylU%7s7sP=#3Bj`CSf#C{=cQ=Q8k_1BsZt&xbf)l27<0tj^P1b*_jqsN
zl!AG=P9VwL#)a7n?o{7ZJ7E`$cLyuDnnu=@2OS6hvEHG~RgZ<yYPi<NEon$jhj`XB
zl$P$w`snQCiK%Cy-8=ayu_rOZ!nYlZD3i@le_9`WZNWhNulklg!gbo|-*@x6QvZw;
zsz(94mm)}FofO49J#-g9=8q~6fp#>Mz7#quN>30*c2C^~sr{3z<q|qk$()`r-e0JC
zDeTWwN1{Z=bF(Xz+pcR&Pu%_7i>-#AoZ5e1I&8#O*5u2>Gg;WcI;Ii&nz0`+7d@da
zqZ6k^gYt>RE$X!3XCT)lpSO<pzOTP!YTF!J{5@P*V>(_0W%7&W$4a{COu?R6jpNZW
znZ^h!SiEAV_#kYa91a+7JIEL~|CF6JR-@r0)T!>CY{IQfwFrNcjQ?|Mr3@`+!a^M}
z3*oMW!G&|@@QQC7-~kU*by7xOUf~{eUJ@g1a>2L8Rhr!pG!=-6DIr5jCYGi4(IN+N
zEHUKCeOFZH5<MsM#Fe(EWQky;Fp8%iSYGhiRNqlV54+{5btwR$xi*n#^s8GBLv3T>
zEpvDJjb_U%^$moE3<h3XbarQQW%IMb$}UPK$dsX0mcU|VM#U96MOBUOi>hD*e33Y$
zR^%1RoE`{Z`9-_HcY-Od0C#)yRl<xV>!?_(ISP4%!Jx|0n5AWkFb5z^AM>h?Fw-NU
zfL6H`bCLO(MO{z}CUm?7%XN{oTk*_k-PS_+POU55us2IPEVaM0I3{wPc1#WD*KzkP
z_%eT}MimFnw80+lsRa#;u|Hyc>wZ5ab~sxbSnJ%;35O_+>F;?DACb$l6`H!RCq<X;
zzBf1qi80rbeTzIi$^xnIoK=el^yeAJB2JBbYY$H4cQo)0sPApGCf}^vtZLId-}I~&
zq)Nu>O24~Qe_lT7ZtshmkRS>=J$<I@)Z1n)l?hWf{fS?-CN${UpyGjpA;K89v5l4)
zr)O_VO2h8GOM3(G$0R}pX=0ipe*;_hx=q<!(?=EV<P|X3RcP-K#~vxYKy-P~>f3`q
zTvsgrEoV1)8;lYCAv}k8G(l3y#V!4<ulB7Eyn<xAdNs4KN#JJx)8oC`t?#mWDJ!+7
zs#!RK*XtwsVGssTkLtT%gqYg533dOqXm1$0WbtVDaO?PRLba`+ELScwUTfq~-pbLf
z+-rFhS1&QZV5i(-TT`7n1&LkGD|MiKj3RhuvXWZ+)%ymDShsk)gy;Z5di=xs#}8l^
z=MaA<TN=FPV$Hu8+mNGpIX-qPY}Pp#eV7-L(lp+dPp|Q^0YA^sIA&(y9UuVIBljpp
z<3?r=Z=3zl{$*~o!3KzxWBA8lzuq*hp({2GZhkJ}>L{}+q>*Bn)ujqt7qA96)i<@}
zeF&}V0%R(;SP~8zLBc+j7t98y<ID-CX$~1gd!9IKc}_=I0UYHf6Y;P{RQUY`25H>C
z^AMT!=FUGV@wxwHqVM*D78Upc^4*7We3vHkxjiXBU?SIGn{|fpNj#m8iGfYGbK&>y
zfgo3T&ttOp>v@y!^L3%Yuo0jH6HmY$V_8Ln5nW4h=&$`5p%ZQYIRP2PF8LVBb{gH7
z4?em5IOAh0P`mfxZp<=F4zOWWW%?@a$r-<A>S=?@X{w{$a7Y?HB9%?8lfsZP3AXFR
zj@?IxxGI31e3-K`1w(%N9wYui)gI+#ig<iQ{KGJIdP<mecwy&5`_rM4J!)>4$iXvE
z(y$d&TFgM}e5xD2TUb)+Tw!;30vP_-S>kR<SI_IB9^BY}A~q?lc<!nYk=*&?z44DV
zn})hh^(3+eAyKoMy8@)?w!{<!Ru()mwXT^-@l%D@-^A?=0lY5^=A0p^;b@81agag1
zxEdM6wN!`$GTz<r!$Qm$g)X+6vEMN9vKZj2^`Jdb;HnV$>(G|2>q494#*7!vp_tB)
zwq&Cq5SVe$TaOwIsy$|nU1v|<!J67c+I<MtM_z3?Dw4)Rpp=+-s5)PVDfxax0w#<>
zeT2NXy72e}E`aa{;19FcOL(=q)mftr!Jm@)HgH9$-63v><KIK^)HwY@gtL)-7wk0U
z5Xk6)THZes$)k3XVjZ2g=`kO7%?E9Z_<hcZ{NJ?^WIu-(#P=?3lu!&%JFU*;#5qO{
zUGT6yMwB>)i8>Gwn&}>~;zdAct}o{L9;FNd1qqy)e6JK8<*ChZ^P8@=S6i#W6J|)j
z5ZQE&aE`^Nd37E13>-uv9e#Z#g9q`1Xc*7Tdpxuh8!@*}3*eSbuyjsN^16nbke?ff
z37W?PfPNCeZn5>rcTT<F|LA>TFY96>4r1w@$`?2jfc8nceS*t@<WQ|sUwT}NY-WjC
zi>qm%829Te<!M;XSO7VcH><CF*^=*ZSV(?b$8iq&Yy2k!oF!7%<&!hJz!~|8N??B%
zUck9R=wkdhyP>{dmkQ`w#D_CD{6imbRqaX9RP}(O(u;WHNB^R1v8I8FU-)(^7By}_
z1Rf+6ex*`l|DWr_@F42;fF5}8A$xrCWWOx7hWtpc_u)y5Lnpx-*24?qsh@%!MN&vX
z+y~<*YJUUwhg7*4evnr`cXdWETEl*>5+2m*)y`Wkp~za~14EFRKsmzOiy!S7-9X5O
z;E!pEvNz`0wKK|i`$8!CGn#R=h$t7+VL_Fn(z)jJ=YGQ&I+?hGgQU96x@dQ%pq2mB
zVoZ7?w*ajZ!HVdn%o+vK*(BsMK&L1><*$%skFw_RLx=b@DN@IN+=+2MOV7}8E4Fsl
zZx2#Y?Xc;j>97}KP`QvtKx5yb{e56QpWXsRKR>B%(?>id_pYyenA-9tklf&5VBfhW
z$ZQvPKyq(&+vtM+aPHew#D1XEXllqENP37X96B0{-|ZIB#Hc^bQp!Q2kmB}zJa@Ek
z?&6~Xw(Tuh#Y`D{l#0l#a+X8gqa$M6romW?+2RS<7khRTH+ajZ%EtP9iU~}2{QN<<
z->u`Thmp9*VZ~AVg~;w_9^{%U?MnSAJF%S28YrZ8@966)mw2^81}je>lf^R+>qXja
zcjJPzeR<io;r+1S^*dmO?c$Px<4l@4rZ?>@17Qsj<e5#PkA5urpc%{eiEGZ-RM3x4
zzb$rY)er*_U0RPn6)uPC4I`HOkNycSz66B^M^d3f+lIlK6{qqhfZ3Aq@ke_fb+vo(
zycXxT^;ay5Ac7;i{s3#-^Lp)!^htTH$R?RX9NV#7r|%N%IoqpA)Oxa&0KD(bZ4iS{
zD$jUt$zlH^pXn+K?&t}s_9w!V(uweBgwPj9ruxaDX=g9e*jP6xbQGlQ3IKW7_7==U
zt5{A0D9*8CsW1j=H|Giu@v#X@<dodpgnIt!GOz;X63vW*<Vk_N)s+IqA(u&W)vlIb
ziIGq}N9n()dT)?k!o9O$y(Z#)J<;HVZN}Mo3f+mk9{qyFtcs3s2MBayK{l`aOv|gR
z(f;!NlI0T-I~sw0<yW3nG?U)xI?vq1oKrv%ZZXdG^H-jYJHW2b<={sFD{Wk8xUFdJ
zCvXTqa7J(=S5SjYlLQ%6Ue@;8v>f=WtyWpR(K<-!DivvS&Zq79DXIZ#75-F>mq}gZ
zT03-Wf?rrmRVpR~Mg-4RNhp{sl%(5NsYukFm@i6Ts$IrTah91vp;qA)_E#Efha62F
z%h|%g{t8sf;7O!KF!IKgD>Rmtb;%Dqh)5k77i<Q{NN6VvtpzsopC-zo?vkj6-4$!o
z$_QHm8*HZogJl)f?KC@OR*vY=5T$rW*kbd}E8&u`!OQ!^^6Y3P(Ud46Ea`F_L}%Xd
zwV^!kDUOX&YEYiS@d~rnYZR9Qe4s#?LzotWn39JK&dbx3vM?DSOjoUaSQ?i7HI6X@
zQy@t%;*zklwI-k}5uUB%51B~#L{+3p1PFzsb3jo<dXnj?b<LiYW?LOCY_(|~tm}d$
zJEYu00l}4;KxD8&Onf)pO?P`~L$Z0Nn-1#U+1##U8VZU}Aq?SMf_0vze~i5NCODVY
zD6l&Y5Ii3+;I$uvLuM*-O`)<^Hw=VmjA!&2Ec|!IrKvG+$0|E((YzDNV3u5>a+*4=
z44EAvsPu@v6Uy5IO3_Cfd6bB2oH+}{8dkujui2Dgho|xq^zC%Yf?9~W{Y6~@c%qdZ
zps<Ak6NOaJ`|*lYG!4wJx|!C2U&8hL8*cD+Tq!FB8f*>zhh?|^O25_>{|2K%FoINq
zNgh=HoJtroEf`<VTXMD)y%(Wmekh3plL;o&_#;GsuhBS&RU@G~>Xi>p50~1uE|B<6
zFInm+unLNxx~>?WTsR+t`m|>%m8;4pL$DHxi149NLdS~7ajR|`hRrpjLc`3pyIL6y
zlF2alt;s8w@FQ9h#RLT}LD4IjzArR92~Xs9eL8UciWpDWd;lFSUNCJ<qXO`($y%2b
zO=K(yIV!mibVPaN=jpSID|BvGeSHm3E&*S4WaJ&abE8u;8!WbiG9`-1iU<ja#uwCN
zABWDipis)^`dTSl52C=R<rag#;xC0wOopM~kk#X@<O}vMcy@z;NFQm~r>7(o<`&oA
z5XsPkPlo0X1RB*dxkkAuEHTFXp$c)rA9<%?mtySBz?B|zp_ZI+(*7-|U!sIJ>Lfj8
z<}0F^%Ok8ox@F)S!UDoEUfRd|Tn@FB*Bp)8QXuI8-)%LCz>n~olbTB<VEqGj1VQSp
zjRV?)5_nO~ad3(+vj@-Txme9J3jc(lF%N|zpXJf{jyf88Nu}2SM!@I5mKIqSFM=I>
zzQn{)<q8i2E{jHy-pw3AT$PlVo%th{-^7Vf{MWsV=T$n;mAkOO7yS-mq;4UIRQ?B>
zGiicN<TiA>nS_YBG#LfqVAXM{Kbvf@j4^>l4ihc`T<*^-u4c257-WS9B>eQWd7Zae
z+@>=yXesQZ%YUO*DC8ct2kGG8Ot{Qj@L+5f4|0Jm+Y)Eb5T;_XMTIur53}mi6M4w0
zMrRyDFSRM~5u(SHLpUCydQMsLLAoFnPD}EcJu}33Qk#F0aPxSLPU4iCwCoPrYBt=G
zfF|`l$zap(@dyOAjm_jE@r!u_TslifYaNewAl!Z+T;d=p82qQluBN?piayc7!w2yK
zu99H1vx-o@6#l?eJQ2fL6Z2SE^TW&lloWeQEr-%|YQ0==D3k0|(EzwJn!crzyu<3D
zK3pTT!=ENp!8}>_$Z~pe+SNlQ7=$m}SWs!prmO@2&L5(P0a5xf(EKP4N47p`F<rx7
z^pyTkVCJN(_XxrzidV~y#m67TurR2>G(l%FrwGS}W7@bh^PPHf-Q1Mi@oPdA<&d62
z^7uU1WxlS`6yjXPWOKoFw=^Z0oht@&@54vbofOQo&Z>{LpVGaZ`hUKn$np_vv3**w
z&+FMJ`t=}^z$DyGLc^ffV`LgCDI~{Cl4pgzkv87rxGIu|wsa{R1Ij8r4aVSH<31Vf
z)A-rb!oEI}CyuAaItY0<mvte^Q)ej>XG{cYuOI!E%pa8s?ko$K7YW2p1v(!Np^u?W
z0QEbbPAx3_21J!s+fmR2i3@_?wyX*D^G5t8$Vw=JZWGhm#C~`zcklylxbeWDFv305
zf2rE9;8o~w9u<^=C2M6jPc`&pUxzD|m3iH1_S)1)X8aV?)oHghQdHd8WPU~ze0jtA
z+t0u0c3LEf+>smJ9?nEuqcrr>UXki9+t1}4?*~f8pob&wmFdUTyLs3Fj?4&&b9G{U
z31s{^aS_PNBGpNQ)%?LT>5Z?Mt-wD858=VTy0+JyYul`<W7cBx^(W*Mptp2>uUh6d
zL}9p5PHC=kR~ifVAd#0HV7Ojyq$XF%2qyW{a9Fd6{WV<2>4wW-NQ{-8km}ujY>bPq
z+*yo0lWMj7vr;McD0sF*zeNf>VEo0xqTrQxnFYiYpr`2;F?#y(iA(13vfIhA3(LMV
zBIYr1^DA;*Z1=K3ow2%nJ1nk{gVWLu@dg<LLAI<ows5f}EXbM)BWunf$;~bWqiQ5P
zD5jyPq<B)pcFZ8z2O=L|L4KQ|p8tLKGJRr*2E+X~Ef#upiEI{O2clSj91ylr>R+#y
z^E9rG`gUKaTHH;Gdj~G<O2E>y^lj}Pn&CF#S^eOTVIB@f3P)l>3}q09EXO0h6M-$K
z$d)lKr#u-WfSWHZzlz?7s#+M2KYr}5h)$EzQgw#pgGfTU{2(!=?_&cq>KTy%igOa=
zm$di4R&JYvHQcwGo5A&oe(#!Z(?Rd@LCjEHZt7I2F=B8@M6l^|u6^6siD}DOk2C&H
zP3D(vOlhrk;loKFcjo$PxeN7e$t?>!=g1}ve{h@liXY-EbvxIQ+AmN0k);*?3HGMU
zev=Q4zlA1~S%HROILJt7BLjpm2eV4-&@I5afOef-Q2Lh{PT@mlBFp5VO?bQ46H=OM
zgpLJ{hUjcFKxyIxS@OO3B#Zw9k{Lb4a1BW)qU`iq@yRbrYo*qZ8}$qtB@9){rV*gJ
z=K3<STqJKi_kQFMq}frwL(C^`X8s8_BxBNhA7o-efL|2r;aY9sjntB0m7Vh7wXvHd
zX=^kI6$KxU%8{^^wy=$vvbCrP<x<nHir1<`+UsKTYj?pX7BH83^fT$mD^Enhvjto=
zN}f8OhQ!}}9n2`aq0038<H$`(t_25rsE9u@qdpUKyu?=G-gtkJZ_baq)M$xu@sxr1
zO<>GS%Q^A>6cQOBZ=72?%r3|tUY-;-o_p|<8&8bRr&8Joq2ryz{{zQUAtzMApSM5u
z(2=BCj+Y~E*EGh^i0$gD&NzN9xEWHGtLa-LRy)0{EhHVzFkvg&^MQu!#YZ53z>;IQ
zop^GJ>mHKR6qy7su}G-ou4?eWxP4Ju31+ymk#A<>Z9lj$lU*L#cU6>4N^2|xM$1sO
z5Gm!uW}#S060rCWKqXEvUDwk`-dtmK$rW19yp`RVcXH~cR70NJvaNz#7`g$0ba;xS
zu!<{XxnLem2kuBHoRH3j07hbuQPa95Rtr1qtj52h7AV`8_jF2)p<Bj4xQ*Ym*{nEm
zn>CKoXM4<-ZPaOR<BT$#1Ce-J%aJTP^83t7OrM;nm#`qPQGSO(v0B<R4F71hil44K
z82Zpz-quN;AQPsF>jgpw11jA#DXTMz;$PPRL7;w#F$57ve3>^~1<7X+gtb+ANUen%
zcBahA?cbi_CXxGC#DWw^j}^giBQ`kxQ!k&6ELlH><9w^R{u~R0&QA0dS=AaL>6;s{
z*}ia5P>r;H?vR)LBkK<Y+%Pr5Y#(?>$*iy2{=G=SEVWo}IXGNYNdu`ITVDYLi>+-D
zwa!`lU&Clb#reGE^K0Gbh^)0=n<;Bg>WDlCv|UyyM~l5G6fzg|uQ3V(&9>Y8iHpYS
znY3F+z}ifi`B>W+T7ocEfTJ>8qA6J9>2X6*rDu1!o3%N){U^#tX3`{{fDAq$?RGGe
z)Y>>T18JLbX^(pN!SqfhGbV7N#bDw<N!VX0yYdML?#CJtwkA=$Y<@kTy!=^A!KK+>
z`ZD&@@(f3x$)Ya3B}m?OH|B}ipe1}obZyc*(t?_y3XU64h_up)m;~v#$aa=TLjpTr
z6uN|{ytEYQ*A~Mpp<b1#z5XO5`eHl(ZnbC{A2h9D$jHxJ^S&#oW|~1%2*m*^d&F<O
zFcsLOP88O+M}MlcP0%^E>V>;2{+f+ccf8(Y>F&zPQ&Qv{ol%(rAZ1ph3<jl`z<=EQ
z1_t0a)!&-UwQL+N*_J?tKBUXY#dpE6Sx-XAq?)E1MZ^jttUXR-3V9Y-^=G$G5r=8M
zWCkY0z9f6vEjMrP9yZUq6e4ZVRjqSU$~h$hTe!`jCLIi+uP(1|uC8xVY#uMLx)<vB
zCT6BmMxaNNzsqgb^OBo0Yhc4`knJ(|R%dsvzgm32C%Wnwh~~Gkl~_UEF!Tc%ueA_1
zWhPo!IcuLTLp_B!3hwRp{of&9f71@-C*;SyOl}PG;JW?mrq>DK*Y>}apvF0b@vU^r
zJ&vy&j=bLVcy9Rp#H4mC$c;CwSg_mY|0dZ){tfXmxG~Zr5CyNRTTk#D%mMXa0|Pm^
zeQoFuIuOnw_<Ea$Dj%dTv|G3abJC1z_BdN$n<7bLJnfqN6!qlLq+wyuck<BV6`JGk
z7|L{B?qW0JdUu}Y9(X8IQ8TS7?(DMVvdNtIr7mfjgoMoJddpv^HDmJ!s1c@SHsO8v
z^jJ;)ek0rao9SzYWDl23!1wUmZ!+W)Z;CZ%-=25PKOD!Wr^|ucbvi`mPRDG^lvE0>
z*gr2zxpC2&-9gdoNW4_TLG>Lqtu^V9WBox5a#_P?&}5dzJ3RY?!M)0VVM><;k7LUN
zR%7F>%<KNJ^DDi|(57l26aBWj75e*mOTQ!4o?&+5=EufOs=xJb4TsVl<ddtHs;ifC
zftH<k`_i52hv$#PtCwPd>YZTWwNbWxumFO85X&~^)v#m4wSrWG;?4bZK{b5aA%az)
zAkFBbZy3ZgwT8{n+f1(3@)q;gux^wXmKD@EOyU$#^6%>A;Wc$6t-G4&$qP2%WNj9d
zc1f~x83DASnzkH}wqu-jQgJa`7P)+J06A`=eK*P>OgpYPj3;}E?(7sMO>NGX{%iGR
z_HPGr*L}i<Lwib0my8fHmqoF6v|WMNQLzN_ox{bQ_2L(N{?W4e#h!l)pf!!KwvJz4
zKM+{EoVs%FUwKTo&-ldBZ$tVY2$FsthD;|ljqD0R<k1XP`n=szI{{q3h3{+BciR0l
z$r0I~EfL~dI(Mhm__=wdeMwc;IOLtZo3?B=RRoW-;Ex?)4t<XA^OhLZ7X6H|BYO_i
zlFMgA5$|(II8hEnv@Ti1ny1%d92Y%dtRkDV{{lJq_Mi^6x8fYQRb+WFUHGvloVZXX
z_b>QlY`yzIJ@9`=k}(Pq_5nOx;4!#sIq?H`MAGx8x<wFAoCp-75Mu5&_hoV6J(BjW
zg$qQos}KySgLM5HEJAQi@KvDtAfVZZhgo!-akF=+fHtEX@vVlDIgGAM>v;V(qew5K
zU&6nO{7?`FoJ?@3v40LDMTv_IAYvF5|3WG0g~97kSSs*xayPDkqM<heAqF;wf8j;Y
zol>|x*6vg<qAvdSy_;L*hl%(BJt}13`;}5gWQ^<`h8mA<c?sv{PnMmBbD<eJ2<S#g
zR0IhZ$_d-wj*Qa@z@H<^zWR0J<ddXN1j{KZwh-{V8WKw&Wgo-JW_m7-b_R;c@71!Q
zeie)*al?-6j^X3)>~Xtz{XEm^_07_~siXt#;K#q|`*tqb!~JJto6EL(`pd4Ffs1?7
z_xt%21dzh9q1Yr#1GQ~;{kO*LKWQZ|NGd8<|ASWYeEmI{1@`~sm9%YN+X1RL9FTYL
zn_+RE9lYCmTG~23yezsvIR(3{Pbgv>7yVi~+S1SdFJcMb<{I~a{hEUgV?@9qfH9AQ
zN2lx6?8Jd*u6TMd-v%VjW4YhY`^0}on9HNSmBYZHH-ulk4u>G4u(mCnrylh#7z?KS
z>)G?e^5yhuKF-V2u|aO|A0qbC%H5{?OZAGN*=l#Y)!lk-Y@VDwUeR!Am(9ojyR|3!
zKq9!;|DQ+r^?4dqjMvxo7D*gt#1K7~->L@rxpJ0K6FOXgR2Ls1D=N$D#Tq(qFy}_*
zh0z5CK>`oT@nVb)wsyb+z?G}^!Nc(K?`C@GaJ9Pu4)JK;)}wMXzF}vQsb~MWMc(|0
z*`<&S)qbZDo@T?^V*L`jzWHs1m3T4$gD6?l^S_BDg-<Qm0s=D1e`4eCEbyMSwAd?}
z8XsisL+^;+DSuT5z)=>Wr<N7a+KQ5VXmAL^!=S}w&Jx+bikIh9tzg{3=?-Gd2Z76h
z(iowmFxQfjk}rTV<s>=CmLISgO)$AQP6$G;ILd~3n_^&~z--FR7(3-IV7ClnsF?JW
zX=J(MOM2L~t{InGVr(<z%>}~BNR&ZlEF@j!xg^m5(6McCqr^sgz`l~JfAWt<nl#ZJ
zcu1<9R`$eWwc$~#hmzXSFK6P@)vSV~)i~r74)1q<N-9BV&Zge^$iJeJM@(atpiT)K
zOa8fb77F_)`C5l+f3cEaP3}?n<7-K<&x8b88W3CG?2jiSN|ke|V5vDiiAQ*iAbzGc
z99IBXA4l=cNx&TcrM=;7h}ueoiPej1fi;JumBit&g~MAZDPkHHO?Z!k7Od(S8BeAc
z2vY6v>IwG;T07o+8D}l3Qpl#CYxDcK*DX)S#||(5x68d}mLu_8f<Yf@HuUyoSvy5G
z#Bf6|ma;3D;1|w3Jfi@`w~rJ@yUo2Ia8xP7T~~Yv!c@yB5jXTQNIuaOcETe|(AF>*
z61N*tRFh$f$mkmQwLmUqgKd&Q;Y1RUeoJt~<&qkMYa}A0vn15IFCDNQ<QFw>ScPaM
zbmAg<iP>-&)E|z(7ECs;$6|8MgcI-GmqE1E8`R4~T0Ka>*uyz!TYIRNMxy?pl{Ub2
zb7Dkgt2v$Hl{>n0E{PAE(5#oI5FeSN#c$mJgr7)TWF)tkDvf2bd8bA(@54o0Mm?iG
zWYJOY_Pk%#6XvRx1YGEeOmZUp)v$VldH>E$D_?Ac<PR<KHEtW03nbB=A?Bf=+lX8z
zF!s~S`Qh+<sXF`x@FewMnHYzn;s^)K_^%v#NgjsjnFyH8Jzbn_aK|^$Wp*iN%CqKM
zB#J==Qk9tB4MK~(GF|D18^oP(y=Er5Xw#2LS?^#fnqtEI$bf^`!E88vdux!)=lA}}
z%yM7uTNesw$)*S4!MEBD3r9$MP-sp`;pv%!1vwDgmb6?)`e4Dtm`-vO_5V}7ir6Ys
zCaJdQ&fZocK({6iOx|1279vHe?D}Z|Gca@iG$e`}5p%0uFEC98h4|<M`ohNvLBHD;
z8n(_F88|mf0{1@e(9N(AiB1tMpNQ>^91if(s%-QQLcz$tHncsuEjsbGC(issK_aB`
z$y`DhQOt2SM(K@VgYK-&%|om)yxl&9=8wfF<8#S8$(ua1UPeIM*0E|uXa@ke>R;K~
zZ)izKsti*)^ukN8e?=Q`Bd*JPO{RU6m!}}1^ICcFLpP+YNs)P<-i9s4r5#hqiav^R
z6tLll!0Tg-vXXjvW~cj@jye|jJz!=0<?Hf#Qr$pwIA`3aakuQQBr;`*Jt`^hz-?|~
zYUwYY-s&mO)MSNpxrxazOTFZd_WVuTmC8aL_OcvQ33Wha#0rnmg2Mf!C0Nt9!VTWF
zg74{UtL`sPsM2kGh6GZUa%Aom2Rl46_M1zv%)Y)1Z4Km|=&VSDk|K_{gIBVU4#WNF
zXK2l6(GPuZ^DrOqw?9Sl`87WQgB~7FUU)?-H*F?MM*U+w(F;vc+dut;&Bqavi2X5L
zLauJ*jdv|DCFM6;vmm?5wqE(}I}Ha%Ry#`hQ`-*PM=)w5N6pJL8oMSf(o4s@<yJP5
zl?;Mz-lLFsFAAPvD?~G7<zLddP$6A1i^r(}66L5ld8Xj^)mBk@0moR)0JN>BGc@tX
zgxk2~godYf2`b<CpelJ=#b_KL_LL<V)nSW1ls0SOIen4{taV_+bceD#r1m^XQgrvu
z-~l$n*QI3vIAJN-5Df{C>yW2!6BVVCY6>2-^ANfO`pf(L#<Tn9D@GO{%Ur{2qU|vk
zl_6X0wW#iC*N3!A-Y1fOJ44HH^3DQ7bonLRYhBs(WNR>kmP3Zl!wWoSk55jp>WsJS
z?QGQD`>hEahNK!j5tYD})sEUV@m!E5Ovn5(;piRz?-aH&B)>Q3=xWx!6&u}JZo~td
z2D+g~XV4QOW7F38GSftL&RxwG)@arTpGimD+;9xOw!+mIvM85S26o^ESkLlj09c!u
z=70@tL8fppN%<(`@@+4xESGBMX)FT#t%F*TC|Nx}e9xUBM$FdaE@a=fsvCw}9c~2O
zi|lXM2KyN!AI+u#E%u*J@erL*<D)Jk;b{88ztL+letV4Dne$To3tPakO3g**Jo+F~
zjKeq^blF~^hIeXaY>fB1VOb(lQRZ{aqm}tHGH9DX#wx|pITZR@!M~*%4;;S%i!r;0
zCI$hG{_vwtUz~kC&|3uzTDZcfHIdG7p<0VO3j%DE>yJkyAT~-c_nJnUrC+xgaV{r?
zajH|8Wa#!oVH89X+%?une`_LYvs)R3)9g|57#@rS@QsCWn~TSqySzzGq)%ajP>6#}
zNN0scx-{ppPN)i)_~{kXxjq0KZ&Mn|_k*r#l`J8h$%gitj@S)Laz_`g2wprj%4>xb
zYDcOnDy$bQ1!nbCtQ|P}kt%dqRxK_*b!$J*&@3SvY51y0s74*ChJA-fok_(&oK85S
zSg<I`eTr*_dK^8dg<aK1*qFQ&Vi}&?GN7=5(qx9hlDZXF2$2({{-?l4;+m=!6P<#-
zmJM{)Ph4c-xmlt@{?1tQYew7PRz&2iRmpG4bIUO7C46*|BMW)itl!jR0h~W2oQ`?D
z7bAa(+*BUh)!(yd@J1-6jxHow^}{G+XV9{l9xoP|Y}^)j#!i(0ppJBz&2E-+lk2o2
zuvo!IrZhe$Ha}<|vHtjpOzbNe_isXldYH&a0JCG_XWqVbzmYG$yuPhT#z(JdN3MON
zINY7g9X~o3)4*OMe;j;d2F8|GmAsp4%Vj2k2j=sbOlk5LjIt}!NcmIYqiLcBQcZ_5
zGy6EEaK&$}0I{xrxo>>Wwu*gyzdh&Ye7Or;Ls2S+v{``hZ+v&PEa*<J`wLjJ6Z*CN
z{l?5M6{fjfG3do}^yk?9w(tAe3i#*(eQ^iBzCdiR{bH9wvcPkJE66^9sV7U?C1YKi
zGql4a2ES>VCE*4CHH>o)>hlrFr7Eh;Vd$HG`)q{YZ+v6Gh5<ECVLp$e5WJ2U=3zwf
z8H8eZL~_e+%!$~-6%&f(#BN~D;Bf#@IwwUQ=6BuzbpSI_dL%N3Jr{gQKwa<N*Q*fZ
zL9?PjHQfg-@v+WviG4_O5$T_{40*q!a-`|dT%=GpPra=Q8|4{lhtAmbs6Ep$-h@2`
zC>g&#d6^6a3cp>1N4Qzu6|3O%Ig+vfOn3#A)nB3zVHb8)#?*c({5G<G41H{a<c^fw
z?8{m+!}PK&bYDQ0H<PAFs_XQ|6z*~?I)~KoU6)G^P`J$y##(PmZ<+gjdq{R^z39j6
z%f#oZlw5Op$7HuQ4&k~bZ!W|)NF}}#F#gBZq1UOESGr+u(-kxgZ2ZF32N>k#R9vq!
z=YY9nCBTpL4s*d9u!TxyBe)i9>~*oLHfR)~{CiO-Jtdqe%s1_0kC+^NIE62VA>#`H
ze?5r&zW{kahQFi>)G?Tki?HA4xj3bm!9r_xM6A+r(20^B-Xug}UmwfiskJg_s8{g?
zQHa|Qy2-;CLz3h?FPa`tCS;s|q)r+{o#|ePFVuJ0$SN#KbnU>?NR)U2M2uOkf|Pj)
zHfC<!_hV851!;y3dU2T0wfzOqJ7LhHbg<7<YYG1M<Z-hm1D?cvVGq4f%=BSssT#>M
z7X;j9LBVda#z1I11~MB_)(Kjoq{)a+PqCvih}1N;x4<|73&AMPlqGu957DH<^RJ{6
zJm#STp@gEACmmRhqs~<rj42^YCsp{})o9>vbx%DsrZvr{TI)dZqp1S5-iywoB*OgU
z$5-kh-HyhX2qqXA%>n6E9jL8l(@BU!0C!Ii5QAXbUJen0BMOs_{-d)XK6D^9vk(!^
zA^=?^sMrJpF2>WrEBnboMN9>l0i?}YhB0kE9lM~!B?i{OVmcVrlni}pzx^f#QdURE
z@f_rR5_Xf$AVMw6BQM*R`yNOgO*B>>HK!JVwI(GNmmlf`7MR>3{jH$aUjH{a3MsAt
z&85unrKnmWsL+8afP4^!dC^{P;4rH25@QmlYRO>j(cm_|m&{H{glT5OQQSStf=MuI
zeUBmC%R*x7NwH6tk_3Pu3`X@0!^qZgUY>d{WUO@)OLhkQay(}hUGAPOSJjoEh+hYD
zqED-H&#9wzc$yJW8m#~}w#hhwj@Fo+MZhp{+8<gD{pR4OBDT!hMSWkDOomJ?O=hmN
zOLQlFtt`iv0^}kLfyagFEI8-X%{^Eg8XB=S*ymaFfkRb4#zpkl&X#ohf}5-0>_2!|
zz4zGmaLa31tGbZ`<e(5+SXVe6?)|2hoB|;3!J;Jq31f{rBDRkfQeHHBha@|=Gw23Z
z9<8be8HVbhkcly!slGw*s_GaR_$OPE=)S(5Y0SQN8_-t4pZ(tR7$N}Xh5H=UKR$8i
zD>s08oZngJL_66)!7N@6K)gPq`E+3M!wWJoBMGG!>zN0txv&5+tvL5E=ypLu6^ZmL
zzQ7#LSNzIatD&S8bk8&_YKHg8z+prvbn2O8a>v{rIGJSXhIj&?7vb@E5{$2G2x`oM
zh7G=NQ6{zDS6Vf-{Fj=-zbnnm-`um$JoEzL17!o6K?puWh#jv)rcLVk#=5|B3Vv{j
zRuf0QRGvWKsihCUc}pM<WCO-~mX`2Q<Z27}ashWXdzoFl%<8z#nj|0KRl;OE8b@dX
z0(-VD0#NX89n0xWQqm;t9c*px9qqo}=^X8}k2<e6;Q;IT@J2Bm0!_j?ax#?>f%XnW
z6xPDD5T=!hEz&HcQ{ec0pf?e-2S&^$GnRNn^xn&EBgp@)*v6ykZ0NxR@1*Tse_#6m
z(ta-ZbVLSUS5VyUEILJ=ftC(r=hnFgF$vrUDVCQj?x%xVTGJy?%d}>3J)zP7uO@cX
zm=&;AzSmRtj@7+aYxiES-D{U?08Z-Y*h23$Y|PaI`v~UF?0ry@TL@DKR!!^tGlK(~
zy`GR=vLv<oXX~oJe{TQd-T$C6Z+HLYZMQM|{-?S8xb--5|MRf5^7#Ax&$sv##_w64
z62GTZc)?Tp`n#Q5z1S(S*l|0zI$wI7Q;5QiZ*y+r8t0boZ`3Vb-+cYO%{&)2rCYqK
zxxI^;TfC*YwJVz2xSzR|%b8odnYpcNncKRPxy1{anYS@F=KtRQf4H-`{d%V{=-uuf
zGkgDEU2Z<k?f)x}zVH9v<U^M_JnwjtqT_j>PSDtR@gEbsW*{T^MYD@E)X(vRVkw<O
zu=(&=9k)@;f1259QuUtbs}aQ?DradrO4gQ^^ph%Z=y$B;;yvWYQr-KAU_sW)C&=8#
z;Ym0i^Y%gNGRkRgm0-!D<l}3ocjh)=5C+49ji>|B&g;#N)EOa1iWp3238)N2bshzH
ze;LZgOTlJQej%+2XRX(MgNP8fU*|M#WUmtTc}qRodZRcgA@AA%lobAmOd5CNenYim
z*mO^zj|kG-kI-2EV}i~S0S!2mxw1}GS%hKJhu>%HKM`EPAa7?&=z9jTL5IHcppY&N
zrarvj%@vN;fWru_X2S%eDiLP@9Rz|}A(9ROkpX&K!K+U-bm|z2>*5s+Ptd<W<p;}(
zwgZuFoBF{?6xqS8!S{?jZO)wG#ZG{B=xF%K+EF4M5MD6t<*<Gp_kryCVWY%OF8*~2
ztI_;{2nVAxO7)az=eqC&M2ZO0sFC6{Keh>wjUYsqrTyp=UUQ(h+eb<gIL3oT_b@+G
zOdEaUdK0KKkof9-7(p8N({V5u&_#4GJe>rm)Guy1MjAo-9~uqeNf<DSG&1BeiVp&E
z9;by$bb%<KQm96VQ_?*nbf*(aC9Mbp65)CP;20$T6h=dmdICbM$wOpSa1P5}iU6VM
z3-!}D?y2xHAo7kR5KA=tWTiz~y~H~B_UqEU#)mQN2Hi7EAj#@%@)6WAV-j(QO_^7<
zcaC^Hy@W4J98OUh4SS8J8>5*>uSQ|Q<FJSRJvB6_O=^4tkG#yE{F?Tz0MR`?gWm3*
zP^g)UU`Ph#pN6Ong)WJ(9vQcPJa|X|aAu}-{fVAQysUOXNG8EoZku_CERGG8Wt~fD
zJc_!>5|*h`nR<jkkn(~01b}!{X{x<K1>x~HzM!P92ofNsu;4V*lJ;Mgz;$-IG~X-0
zM8D$7W18>5gfz~i38toL0%>UhK?-*6PEi2YdtWL&pG199JM;Bw@kSv5{&1FQH<E*B
z57`rC5(Sa1{Wth$6b_%aw`*{mN$D?!7=tg3(!0>y;~qz+ct(i=KF|V*W2!;@WZXTA
z($J+0@;qHxhI(lUe?NMNUom588V(Yq7dF@s>=36maIA4;k2_LURb0Ce)gA!J9JH%U
z+mmrgW5`-`+|GdU(SZ`aFCK^JCv<{T$`?3>ed3w{PBI39WxalhR)!b|;NQp}C#?O;
zA`J{;&+Arptss$u_C4s;rw|TXF(8OmFTC6Bwe?6+8rTIgEP+;W?Az@<=reGcctq|~
z{pffM0|BeC5;jg7CHS2r{W=uEQQ8iVVaS)>lKfRAq{fq>*E)#(yL;OmXmtH5OtQG}
zu=a}a(J!aqL&hVe0QtnR6fMLHkFm~sVBt_=3xMIo6`~9xf2aL(`)KF&wm~`=jY1X;
zCa_vAEi;h)fKS(y|J4TuN1&IT_S+XPcK^0st_S_JTq<cXjYlF7+7y7IhM=v-2eq<{
z6kOuaB*)&e)7BCJb9h+U0rB>bVw)5J!&k&9ksh#FfCm$xZ9wQ26BF=Sq6uje>ZuCx
z)<{p&$F$q8r~Tw(iPi<~n^n_PV`%~#f3kEM4(kZ6-UXp0X(VUn{TS2K0hV=yQ7V;Q
zM3>k;4-IB0?&G>6Bzhsv0f+!N|1hh(6-m)}MEgo9$9nMU3az#L>Q+jWyAhLX^&^x^
zJ_?UUsi*W22kfJ@SqZ#k-{X)G@W5+f%bJNr!xD)bj-Ctmako<U3|#;d627524l`wj
z7C(KbCJo2OQ<&KiYzZGpU58cZrRD4;4}6Nw>9_}2DNo@QAxj1qc(qNGf%YLfFSDn>
zDmhtcjWL`U%XIr;Ai;6CzqGPsXh>O<bjRqpDx^Uzp&pAW!V){vavMEZQ@@5BqXy)m
zNl*i!X3TVsxjct)l!PeNpnw_iW)EByM+e9Y)rKBTup~jNN5Lk4ik{EISZ!&BKQ3Xx
zfkgNbCf@_x*-B_M8INL+_N&ZxdANYrf_x>*kPWP)wHnNGoS2_PV?wFu;&_7bgh((Q
z!pb1jqa>N2eE-oOl#hD68)j9Q^<Y-NunuAxFv%|Y!`coCSOpW0VLCh@gonOU*3$;e
zM#{>LsRvIKiiU8YkMU$ES;aLJabQ<LDcdiT)i{n*yUz60w-%9H6=!J|Z37cpGK?FA
zj!49;b9^P&-Wi4}tW*n2H7r^3b+WK8jI^vr+>4!egYGAg>v3!8KEhq29<BW4k*d&%
z27sv32M_84^zVfd)rJUn)=}Tpg7cC=vL(R*?O6e#kCvl<T!R(CzqelOZN6;7J~4nE
z)CVZbtPjaaxvciKotNd0Nd0(a2}9>jdYi;qKDFS{OK0+x(@&u5@W^E-gM`0f=tM%M
z(fas$b8qip>m%#{=g~MG(oSscCrw>Xx|8$-WKNsV#@#LPibn8)R?X_P!^>_s(#Ju)
z_(5jWL#jKX1;&yV-}q3fU!$=O2;kWCao7!zhZ$hF6QF(}Bw3yg)o`SS<$p2`PVI5j
zEHXHv3<+^15v@rQ5Jp3NrEzw8s5H;Yi2*!>>og1qMa!DHwm}jQcpY>>%2R*SQs;DV
zx>l+5I)<Go9!6c@pK<q7MhpkSc<v0kb4unFV=4E|L3{Ua45M?3G%#?&CIw_lQX2Se
z$<EYJ81`WhCv;_mVU7&??Cy@Ck63eo+7sNr2~#;5=*tI?VR4Ey`#?DxAa4b7PopD+
zBfn92s##O)49kb6xF6vb1p8=X7^X|h&DQEt^U2aEN>9+zyB?p^kJ?*xipaE-lSV!1
zJ+zoEBo=*~t+AX4sRISGW0vtYijt^D-)XlG4m(>gXMY9x@27Blj9Ub?UCK;UZgPYN
zV-WMYHna!&>Br;fH#|X2($OS!7F8pA{!PMApXtw~Wv*1q@9};|ep+t<LLw3tobPA^
zL4tF47I(37LZiu8^cb9Q9S+5&l`e?+<E|A3S>;Vir`$1KRD*n4=F=#`=Uqn|$ssb4
z(fSS1XpZjVf_`ZP=PQuLV9Tm7kH>pX9l*%JQ=P!Vtj>d?T0$Uj<X^Jr=<^te3~a@V
z8qvNECa4eXZgVhmXmv^ZyGGH8x`LKhB1+h0>TW9ywZjUX#1XqaH0yPu>nHGm@1k0Q
zuD6ySH=6LjmU^`E_{o$mhH00dEMXz)BLL~gr>qYnIf*tSQ3jd&R68c3ZcL0RHph^f
z+N~0HOZJBFG9Xon(beHWtC68fb4XdsGCm^GHyjuc4R?_$5!8Dq+!*veRQPX|CY@Hk
zXh*CGempFpIh{zvetQiB9+3D!kBW34jDtS&O~@n~2e{jhh^(Q$Q@NqqsEC3E>rI2!
zIiPfjM++3)#YYD3Rgp8HTvEK23rQH7myjCpYeS7FydHes9PGbzUyv(B42&`u)8m7`
zx^GYUEj=njk+S;|vzM#Em82r4Hx&uCQdO<FOD;Pl?Ld<1)I=@7D1$<RqWbI`a!T;J
zW2$<Lq)QV0rYW&lns&}Sa?o`T>=Egp;oZ_C8MCMM(s87DUT%jF2tHYS6otVK>I#<d
z=(t2vykuo$srONzdM={mOjBl1vR4$C5+ND}B0ax$n&h2@u+mSQ4lr}&jhj`re9(_A
zFAqz2g2CflG?ELGJo`+vj312frUFDoG$O!cd=2A!20%-ax>b5ZSQ&PY>mndI-mVVD
zNs9C7T~A#pO7*Til4A)6-5OaHuI`w&st%+Ztc|7vKC10XSW&b`*gw`MX?ez7R;1l9
z3rmpc$W>QzRw{MS1E#a4KIYziv_nhEJ|p=3?WrhpNF_s^Ac+@B^ih|OnqWbjAOy)L
z9uB%7`o{#PUK^lLfrO$_IA?QxOe>}C?#%;-jxVT3I))?ADIM!nF9^}TmNoVSkU12J
zuE-sET=3Wk2Rd9&KeHC^7>#Cl2Tam<#9Df)$_-k+FWo`b-Yb2iEeDCL(c|UXd4`(?
zU#V<-^quomL2=xuJ^~(Fs17lfF1~umu56s4HTC?;DM<%68-m}A&#$lywb}$Xh?;1R
z*xO-<e@g-BWMDLCCg_&(CD8BWxJDjD6h)ek8)RTZ@!qhI4j&tm?>?OBMw8<{rhAK$
z?u6`S6wb#eVSy(&rLfYm_66jXOYmXNMBKo=At{NF^Sr$cys{e(6LHD9ayhB2*Y{#*
z_yH}jX-~}R$CyKkHY#&WmyI@&fY<MhF$+OlHW0PtP!5LKflI#oof&1m&qiZ(vZ~g8
zl2|PXyOVK5@n=qxrSnOD7|JDCL`pU2(VE!?PH9R&IvI#?!~Y)l<Kv~t&^Nj)0p>TZ
zX*+H%%jF1>l-AeRjdY7l41HF4DcBo-{Z6hiBXR|laJoWJKs={mDIQzi2^=fnYxqJ%
z3Mz15VfXtD1=|^2i;&a>bC#5JgU3N4noU#%pngOJ#7s@>bE}A?t5~{Qy1)}WuxwFt
za@(%T61aJcCyooTD-cfvrU>FVl;03fSiLZ)$w8BI8^YqpO+lYS6X7J;%U`Eq7MlEP
z!FQqh6k=~gPH+|$Ud-~nDGRkGvrxn;Kyx21<X2+5ewr_R9R^%nd?L>#r=b%7iIj$V
zZ61>#%8K3+G92LS@g(VA@y_Otg5zf?ihci*5-*Bqu_G(&iI>f5_&4Tos!3`OI2_CI
zEDX*gIzA4>%m6FGqP@bsfF(y*D(&3FmH4!0MmVFpBkD7b;tn12;U5JMnrKqHm)Pr?
zRDdCL)x34)@goSVjuM{jGKTu<x|ESPU=7IaH56-yII3YkV-6$s6K5faU0QfCSMs^2
zf8ix?lhmOptu@)=+jeY8*0pXARv(HWAzfHI_Y0m)hwUI0{8)1C8Bh+@uW5XPaprXH
zECyXqTY%7jt+{icr^>gss2PJy=<XJ(E(McJUAHrS7t~R=Pxa`c#HnU4=k)%LH{?53
z?ht7&wdyaUJ2WF>uE$|Wp1R^F(-?wCTy4NdRH=Q$y;W3KXy1|2$(tDNNg!6vfurzm
zpks1?Sybh=$MnI*X#S{`YajJ&O1MX@+_1V-a~sb)FG*_+$M=~ZOH<Yvi?zu(GWtG>
zmbYu^>q#EWB2Gwo8%c0kih2Mi`Z$UBfWTK&ADyk~Bg>4sQCbFU8)ivJOn1aG2q91i
zScmswHz#O7f*Tk@Yp8c2N_i*1{}N(0v}G_My7nPORLJUL8uPGME8*4=kLeUGhU9Fn
zAXH&CiiX6M?y(6q4+Eb!0B-~n(?ZsP6HY1qI{D>m?&hs>vdBh#m_0cGy90h&Vv{m7
zNkNGMkEe`$pG0sL8PTt)uWdR|@jM2~zySpm{xOLt=^-3n8tR2spt1=zQX?W=;-7R9
zIS%pqj`oEf?W(vPqfvq!bG6N!Z^j1=qPm~evLChd@lnA#9BM-k>L7;Zc;QIRH4|(@
ztu&g#artD@{YXX<`X`)Icz`d$F)LqsLS0ajx+1^MKKcO&a1X*Gt~INYX+bScL;V%E
zVho62`lt70On~Lw`SW<8OkEP0I&t<z8zxz6(y1@mp@2El{job4+e^@q^NJ49b}L1N
zPhjr$@qCtuxs+3gZdkK+XsNKhHo9ppn8T8ho@l{h+&>s5+VtX+l58-B%h<7RSk0Qq
zH2%&fx3OAi&_gIjh6%;s1ZkbF9p%PXJLlPXp?Do;#$oNE&~P<El3*7)n&39SZIm{N
zgE*`K15zYbsyA=}2icmqJH6wNWTSvaI^)3J%Ng6ZM6(SVRf2_!so}uTTAPoWnzSaA
zrrRq?hMrt7P;RztT-*E-M{~&LU!K9E3uh4EelK9O`6bt{$&6xwn%Gv_gDF)IWvj=6
zQ}KCW{T&Y<%58}m%Ye=AWXsK%i?JPn8D+Ur<^!0v^Ru(#n5^YiBDrT%b-FL)PBl=~
z#R_sZ9zo8gNrWh2i^_e(OY{rgl|ORTkIbK~>pR}KksC7itESHi3t9!0kY-gc3&012
znU5boc7<yQN;-}P5}U;BOkkAA^7eRgVjV++@o87`!^FqGs>MZkaQ@V)54VriV(-|N
z$FMhv4VbDHak{QD&Z2J)4~`BxhdXcfe(r3&db|JE&hwv-cG}_~ytJemjRyD9oltyQ
z`iz|+ULzgJOj}5%(v}FtIGI)r*7|tT`zQflG`R~LGFN5>(hFIfjhSq541_Ub??1B3
zmUhFnqJ>#F7AmyCaxdAEl5i5Z$1bynyV2`CJ46z<DP|KX|0LQ_LWt?<`iQpOlL6tQ
zPXWT$4VTpG%ZkyXV2oS4Wc2lqd9LTXCpD4vHXm_Vo+kh%%23V}IkD#@(Hu`19qJGf
ziwrgQ3+MF;_Q<HKm0cJk2HufXFz<4v@6vVP4>AnW9aJQl6p6AXks9d2Q0$A@Zpq3d
zMyS_pjOl|+pUlN=mRzt$STAJOS=vmDN(ePLI%-vxa>)^{W+#_-6@7I>V?a$D^DWOu
zT#6r^J(8J(bEXmGP;178t<0b)z*#L~Xnl+l@uKKrakoO}cXz)!pc0O&ze)2;H;@mX
z=3j(EIPv1eNzu#xc(S&4__p($9GaFE@c|qDRK{VSBgxZcEA1Nal5U5qZqy58IUusp
zEr)G^6A+Bju@0M#WAL<8dTtaknSGVl*a+P`hgNJNy-m(Sne<0Eo_NaOSj!mJDda>&
zbl6C=--A(=u#rBVp6D9kREY^2lQ1gU&q!nQ5t|SOW%)&vyZ<BuY?ka%tPsvo;yFZE
z5`qGk6pzkF3(j2pNpZ0NAdeH6u&`G`DH3gQ$YlfX7!sqvku#bE7dNFiMwNPj_hxdp
z_z@=HV~Ke!TY&4e1S0(;=-UxDP7Ab!9`ngeVtJ5f=y@={Dv<@Cwj?0@vF|mp_@n4k
zVsEIa?jva-w9~FYc9If=m$1MS7&%r4I!7z5SgfJk8uE1^A97Hu6A*!Ek^D>ykU;Dv
zu|gbeQ1*hKCY~GZXFQmti_qL+DN^wnCMR^oml$KTku^GwK)Kzp@^@Fu-%(<6H4O3U
zk~LbM5g1o-&ypWGe%eQ~DV5mvC!$mdK3~z=lZ+OTEWW%`AW7(xQ7PMSgM?QUu2}Zn
zBGDULrzL~A9vyW6rN}TFh!&=u@N7OX1S8Zb>_2;yu-X!Kn+R)ilcO&^LyodUtUl`l
zfr3EzS_Vs!snA%T(;+vGM?$g;h&AYV@)BVLH$z`&y@-wUYb64a3jx0fXqdT`Y|*wQ
zVA8FI9+9naOgKfwl`Gz6ZVp1feZ(}HASDdDS7L`LCqIm%pL~+dmE5+yQz1(f$fa>L
z!(Z{Qq3DL#ijKTRhBW$I&?qef!p9-J4BLG;srndmejJACkLd}Tsn%R7(uzkd<J2U2
zro=@fTju~n25J?vg=RH^dhPgEHhe|J;dzEVJfpJ!dLE@{4#0|~f(6BgGVF_VE1&ZO
zHx(`5Iaa@7E0ba%eY%K{5^``rqNDgEJC`FEh^?z`Kg1?9df|E0)y(r#cx6mc_57gm
z7TFu%eHg8xoxi==J>2=Ij3q2IA(Oi!z!HCM$gYvIXp?MX&@a*%pw`QJGJ46}azZ7r
zo=bkG_0oW?_GptcwKj^>2PJO$h&2&LhLH{1ci^ds-~5%9OtllgBaYTYP|~U1TyZ>C
z%zB_%NezjRDb!jrTTent{X|(WjNS1tOi}rP60gg+MUeFSv%7TQa0d43;^kD6GjbwU
z;dCTUN)=If=raVe89o(yr|hIE1WTFP`0(j-Po_>u(@IhzaWX@dG<`v@cZdS}B5fbA
zef3EL;an=|jrRD;(tPH4;4Ttz31L~wmDZIbzS>LkV+;-&3=;{R;nxVXu0R_t_)AZp
zUWopQtdC+l5E`trjc6G|)~vP>)CUp2ZRSU^euR53Vk<<-%#U~pk4Y^u<biZhkmFF$
z`(Hfcy#StTv6D@H5nmSpB+1V?5EA}$gv^`<EsJEATkZ|B1il8|9YQak(_^P)SG;iN
zk4}^>d>8C>he}NU*mW(8<QkV0iO0rv6qj0*N|<4drmzJ>(Wv~ahK?A%RmS=xN1`YY
ziF-Ze@<z-#XotQRnl(}*T{rLTdKqH2)Wp&Il!ExA!6(;o?^rK*=Tvw)p}TfHE#mT&
z($Q3`e)M|bA=`dV&^8ZVlt$=9ilRn0wD)z|cpO!xsBd-3uzxn^{L+##N1Ohr4Nhp6
z^0qBW(5obFw9$2t{9R$KXjM2o-M%_$UP%MR=x}whRN{b<0U6g3)ZSz;(z-{2pbac!
z=Max;Yv`nz%10X2j}E4U+b|fx-jpUKsmMNyP@Ja2CjjkKffZp?VG?<h)8Va4!j#Zd
zh`ID>NGF*Xy(YzYD0>wnBqz<$(au=Sy4oL$N6F4Jkj3VkU8BK|FA_(2VwfaLmh#xF
zW26gx|F1Q&4rLDnUn8p6@WInp3xz)#0lswjJRvtRwhwdnPLUUpJz{WLV$eL2p7zJZ
z6p*otVoUst{5@O?>XhbGN5QdY@u$4wGP4kseWRp}caaY1A==fuY~|zj&YozQL>!`%
z&XwC5N>e2r=a-jDG}cEFjS5{}DZWp@ORu8VO4*?$l0_RrZC1cfED<G|1d8ZX`(s(h
z?^5g@U2$-94ofz;5LGvyN{yCITi<8SNJ1b}?L@pzILbsV@X{$)Yp$|;eeU+1#SoCp
zKTSq|4X+L{JzQ00#yow8R78)9%nHz4HkWjobD9PToaCZFWCJHRDEV7`#4w2;^&JD|
zW;E`IlmnA5<c~Ld1|^gS(4+<0VWSo?t{vfZ6s(vO6JbJG!!&V?B4ASI`4=++eLKWx
z*jUMK9#}&+=X8Nn4P!ORe6@Y-)f(ca9AStKjB6R1cCe?$JV##&ne#nQHtM8Iw0yD}
zv6P6<a#XEvg?)``Nz_kPt_^dlN_#ott7Ir5aG$q(qw7SQD!QKer~&(T{e4xyfb<f!
z7OqzBla>Ne>e2kk!PNl}8xff1PAb+!v=a5QXvs=6``R(nYWmm?BFwLuRLl8mq6O)W
z55to!gkp%k7iJz7k-X7UEApz;KY#{Ap=WSp3dIO9AvtmM;ABGGY&xnoiZ&v8JCt@<
z?qMQkm2c*3;EYW}9r?x=a?l_@n&N?F4VRgeGfsgJSoSV5fXt2{(xzIB4obs&@$eM?
z(<7(7M@^dz_h3b+WvKe&!Snyw**bDg!X+m}NLH)HSrDxDOGnqxrr9=Digp|awoCVo
ztZ^!l*)|>pqm*R{_9Q)JuRt-&rbAQ|jIEsIu1#a^CKrmjcd0h+$X~yZd#AQa<Rhbd
zVpQX}AC~m3F^s@LrkgXi0NXy^uRBBc0!XOc4}dMvQHqXh$ijUw#xjn?DuQt&G-~?R
z*SS(g-7A{R==)(;p{>urELL;s2i>ltp15)wUMo>2$XJ24cis#`IbU)PMwMI*yJzEg
zNHlFGCLWsm97bm*!I?Su*#3EcOBVYZ{_fn2vF%(bx8hwPl~X@kq{QVZOfS&j#Ze1r
za!%O2I96gD8M@=eHV;IKfpehYyKhQsueO-Tc|D+UTL%Q%vj&<Z!FNi)DBoe^%vV~k
z`qyv#hPzEK!(f09JOjBr>H1=gju1nlnw6JnY_-rF>o8Y(yEheWf)+WPPSZ%p6+;rb
zjk5YTBc@sOtcp>xULYCuPpn0jnDSlO^QpuZVTXT--(oCb*j%EQhyd>B8<~3ww3_6U
z5noNmkXlmLE#a+xkq;JkXvotd_8g3$_`b01pVd}LtSv&CeL=EupT@z3V<4zy1X*#P
zK-vt&$T8}gR)+<X&TiJnc-M#RBC)Y8ij3Vj#7D$+JsUC{F}jCk!gD8TZ=(HD@SS3R
zLY<4Ge?@auw{yk%o0zZn&Eec-#f27lqV|!A4TtgM^ekiG<oMa-c|BqYM9kYS8^ul~
zI5C=Ss5c;Ck=>=(GZQg68w~q<lX`vj?xGJ~dXG^VXHf#|;^l?5Fcu2$eWPA;Qo<4X
z@P6e3x(%#2#{b59Ou{@#19hy3);B>K53ZOjyrZG0QVKP{Y&Kvmw7fG1(ym-`(>2~n
z3<EgU8YJNji(NOQy^b<|FDci$^$j!vdEfd_-x#H14%WUMJ8?<O=xQyom#0B1O)K3R
zYfl>SCk8@~^J%cOy@J5_%!0LHUPKf_=km5#;pH5{c`?Zl{9fk%muucQ)Rt@Iar&ZM
zYu50X1b^gzpKB#;&BWn*b?CE?%Z5`G>B;@}KZQxH#EHf}Qac~b*-#fEL!uh$F|>hZ
z*emQv2_2!tv@75DhK}yz){`>=DPSm&4TWlnQn^90nqzMYYOpV}u8`fVjQ$(N98xi7
zh0vT<#Z~@)EVN*ot|reqWLSrS5(y4$WHLS{-B0MKK;*XFs$hK3a5?}fiT$kbS}l#Q
zY*{f42y~dcaNI=)3^{k_8HyvKx)#zX4SDuleK~1cyA~`gzKE%)`1%~K5)N9ZC9&Ri
zXeaG^HlBt3k$7(kA|fT>&2*!LDfC3mE8(!{wvSBVFM_N5;9AF$wR*Kw+8O>DU;Xes
zCBVP?NBqCpq3rqFm+e2Hjceln!^@RS{NEM$_C5aZxA^F&1x99`;eALUq>}Gz{y*vC
zt^Wp3{L(GAflK`H<JIZwzuC;j|9-f#`d@1GmhmY3{2yQch4a7LZokFUP8i+)Xy>cR
z;pX%I=+ScX`}}{4&ph+5qdk0SVt{M*|JEa*4R8LJTg~O=@B9C^_@K%FO)S>b|H>?v
z;1D}W*VJb6$yGM8uN-<UrcnxKWwr4Bf8Xx3F~7!#g;GB_4*Ll_Tqt3bsncN?@~@H`
z8|hQd9Zy1KV`$2B9CSaSdc>H}k<J%2b?AD^9_bi$K~lz`H!3?TV<<N{QoB|(#=iC?
z--4t2yA!wsdnw0ODQ_C)3u3Frdyj`d^i{sfr!iPE@7RLuy_k7$67eWWZ558J(SUQ~
zX+I?C3OY9#EZzBm|MFVw9al9NHt_ohhx${D9?(u<gbtujC;j+>!2;9-pT_c(pqfrD
zLB-Qh0+tZer7{0d$>bQm^rF<jxwyD!@FN!doLZ!b9(T!g6n)U|&?{RrJcc)E18>TP
za7?7Act1+vWS!wC$}`OcOgL#g1X~+^2^TUpv*g`@2FWLLCdO(^Qa!xI=0p`Np2D<a
zL`%hXwb)Ozg`*?#UV!eyHPJXa%|x0U<VuU^VF9L{??j3wU5o~6#)Vcc6N0YvflDm7
zD~D(q&*h{Epj6gTucmu)62i!yn0PB>7B4rtkytwVSg%!YVg1j;|6$Q}cnN;l4shN1
z@6k#t%l}te-}(PH`B?t{d~zy`R__3>P=z!}OtegiM0Vxy;{Z9b-4UL@eR=(6u(-G_
zDlTHK0AO*kRN6%TJ5G(~m~-6)CD2P^@hG<0(y&UKoGeo3DHjj%0zDq<RA&M1H_?Ff
zeLXVM8<8j4;^NNbi21y(!iZ#0xX@vYLS38!yQ0k*LD{r+Y|d>Gff`=9R&H**KgsV*
zftAihWrxU1T-Yzj<n(2qdDee-93*F7!2zyY|EsGHv+MuS!`Aop|1Cat{cqtcXE;Ec
zc2Bh4bzhq0zIC|Sel^d6cVXkgc!O8+`u>4#9HoVRd}{9P*$6wvO9=oEvW*fkQYRW_
z<$Ry~1I(2qLKvZwS<g5uIE}kOUFe!a98F*$qZ2j$M=N^Df^Ic1W^yl^?NXB0pg&Im
zPpW{t5e%=Y|B{NcdDg!q7wU+2(T!Qab?3j<Y9{~N^76{+_x1lxK6d@T;91r_WR?ZM
z5rUJ#NdaS6ZyCY<&bxWoz>(eHmf&z#r)c{&tE<3=9dk_1qJ_J$vq|Qwa^T3gkFMk5
z6>Hid3EIXq@~X&Tvtfl3uRSR{TRJcoZ;oWpCyQeA;UfQrg>#M%98rcTBO%yQh`UZ#
zJGM!^a#h`6h31+&;gDhxdsD-SgP9YB=INRKnlK1Dl!}e(bo<gwrqORE)qMZV`<aLT
z(+zbeNhc>KUvvPxPX24HKFZ2}4<A4L&i}u~$MS!&Y}8zTD;O@MHu^OuqZU2g)hPT?
zy-md2H6DgPn2q4NJ>Z|++wY(3r*QqFK@MsYliRro{DS+RhmV)P-~W7z&o%Sk3!?s2
z<7&|Vnl@(h|7Do?EdOt=EI<0r|G&kDdH*&}bEy;$F-sIiLDXlxHL{50@P-&RjSV*M
zP;BxyhwMY9V}t7;h+L))$AV`4$%h90y8urUOiwmJGfRHo9YcF+p{bf`5&s8!#INx&
zN4}>temvxL9U_(MjVHsTjuquC`E#cnZ0%%CiRp?HtaN={EjU&z3mnTS8icUX)d$gV
zlHv~4dib!}<e+bytc!6(pW!t$7o_VHvXX&n|9!qJ?|Jwr115JH^E|Q{@Zrw(Zo4B{
zdKT*MD4Ce5Z}an`o%Yd!2gGzkfc#<XW0MKqa*WbC8W`$)3Te0hm&PMg#?5hvj_%~}
zRj=z*JoP#{6k|e_#K%0w83Eu?u6+Zs&V{gy0q6lqbZlaZ<Xa3wm+>l!Ve_ndQpBr<
zw{3ZBlX2HiDnp||`7eBW!dSlbe@l{b^Lu?Koq0(oGyTI@CLa@Y!LC=w4B-F1grM_)
z)wlN#I{duzw!Qg$Z>Q7V{rk>$I{8vMp|pwrK6Ei<E+x0?{rkmJ?B|{|AZ*^qfBS9h
z55H6OEhdE}u98SE?{Jh1&JaVl4dnWchhWa(Gc=AHl-P%3fKleWK`>-H`anm$!->xK
z=wE`y-D+RCji&wN-*I&m<O~05@>P<Z+L`oO8L8(YbO4tl_dk1u%%oLGo_(8iUDUEE
zJ*~N$ErFsYbm3_&OxX~kxX!_O{%z_0PoZ>6jvO^!*>O@2i=Nhdah+eo;+snT0Y>~}
z->|7f{e`psC3qTQI1l=#<7n9X_n`secpB|LYd>c>V=fXhsMN0t$;iHU=t0LtXldGj
zp&p-xbqR-cd%~w}91aRNox|=`F(%h;rgo?tsAT3^kH^s|49hyN08ChlSDrYn>%0Z)
z8Vz`dCC=gtB*yL;9$D6hv3@4jlULC7B<1JOl}~jdj&%xmO?g!7=wP@Glif%!)0x}6
z#yL7sr$D%>{twl>R8sRPyViDt)IP!NC93sQokY1s@*i>7GLvUBE*BoP%HP+`eCtM2
z2?m0WlgEFGf=@>-7{e|>&8$8CrrYh+WB~JIrtq}ebqn8UJI;U-6NYZTkO=;h59XR)
zZu#W#FGebiLtV7$^`zTZ;VA6u2h*y-89t5UeiEkj$7KAGB>g(sp6g$h$soufg%9y+
zmGft#d3jm}8K6%5@B5MHKlMm72)aO{yxuZv(S7x=x0}yN&)1Tax5@p7@K<y`IZm=C
zn}418bViXYoDXyrLA`!H`0w*(qt$pQ<<RJF&CDv+Is-W4i6e1c4ZCY<jDO5C5XLc#
z)0!H6IyF2E*xNB05}y*6><7csB^1o8?vh4#!~9fI^8S72(aq>;w!r2?e!cnEopo+;
zHqR=?$1<5I@3X`b^hZ$q&z9Y|l{E*>t!}*vR_7-)YGhq*{n*`L)r@=GdC$liJZ^{>
zn0xeR?pptvTtx`wPr7yecc2yZw!PE&pB=fhgEP9hvcnf&d}sH6n701eRx|%OpKI*D
zy3yAffBo0B_P@)k%US!s$B&xd<Nth<kNAG=lJS>%Kbj<GHO~U<!xXEmLfJph%D;{U
z-%&4us4o|-9F|<-r(Fb;)+jLrxePgZz}b~!p;2Id%ErxZ3KTUhIGxj0YvH!92@BbC
z5exldJ`5#!bCQXO`%~^IT8|pdhqrmInkFV0jBavb{8l*4XX5cMX`C^IVyQ>AgEtYn
z{@g+LY}X8aH`V}8)75=*-R(5m`e*a=n|{3gpEY#1-o_Wi|62YY|Lfa)3g(|~C}D5y
zbmM+MqD#p}_iNg?M*e%avXb@xZ9at8-{rq=@L5_k8KeT0AQ#57<mosV<dbYTLA%*?
zAISs6sxjSQE~4q%*5THphpMvMKG06_RrOO_V%#R_I3AwD7YtTTX))cjPbSyZWh%gQ
zG0Nhov)pnJlCmb!vhgw1ajGe9Z8zv*RRn}?Xh~|ruJe6&wE^$&wfH1ckApPDL^27x
z@g`?Z{z#1S1YM<UWHx^GcmQ|`Ak-S3M3-yNBn8ffJl~`wniC!Ic^oE~AQ-x($1jmI
zO-?lD<%gL2f<hH@Ry_nHsao|w=n*gj5Dm|Re$*3>T)N(=v>vHJ1kGS84=71p6ed-{
zY>PzWP%BBf7qHpY50*jBEMx<!!KMS<are<f`!hKUT8%E%Z!86km=MOF^;`QGoJUve
zjab>Ls^w<uiE0P^^B~1wPwilM67{3eDCU{fVT;8xnbN!w5z_!ZZ*Qw*)$Iou+rJ-y
zJb^KqF{pUyjt(*LEJ=GHvNX;%{AbZH%|4^#4!Lr%_o(a*-&r~ThDH)zl<sh#Y;|PR
zLNJ@po-IGDmN3U4rTctuUw(L6Dox<UqlcYT5%^a?z?JS9Ft<g@?}U~Y@U9;YbsTpN
z?aiet&057|A;(&aRjh@jpO!v5uo1!QLAPIRwmMr!e^cG`k~5Bbz-e{8Uv47Sy7=xe
zN-OuFeD$e$_Lc->dO8C=U79j&R}gf~fnzYo7mp<A`XC&1M^}~m{H#WGuov-3g&$R=
zwv3Uk3nPIX6OV34LRm(pV~bEudQ62zS$8?R48g(ddAO8KIC#6bU||DoQc!!F4nD>h
zCeYd|Zs>)yQ!$;YEFun7nGHP^RXq<rB&V@;)ifiKglUE7sn*nkKtJ^uFl=UTVe<Y1
zRQ|op$%@J~RR)fjz@Zwy!b%#$UyP6cnd>6As!&o)YEl^}(FgUzI+c8?q6ZJ$+ybV~
zuUzL>^~_lYOUv-YuV9b_nm`WyzP0?94^O?<LZVOrXa>M0L&;zuRdmPYXSG(om#p3E
zm1`c9sUN3XwO^}#(`K%YCzwPV8pkO!4Kqqrb<gRe4<I^GJR$EH!iQ|%ssCnfA3X4@
ze^y~1I9$Gp2NTe0W$KmuZ=XG;VVa{wfwM(f(=mU9Mo;I6z_qE?)V==XmmyF`5j|_J
zqDf9yC3#|YRm1EuOSXxK{j<fZfB8>={Erb$qNEq&ewLiwLL1kd|MLF7t;en9@9}@W
z$>)ybpJmUNNCIg|V9!yE5nhG~>}qH}I&Q?{)1}g#(jB#baI~|Axd>D7d6`HWO#_P~
zV@gcbN#dlEfa>k|B)vd2?z<rEp7r9>nwYi8{+SeH4guLVz2a;bLjVzQ{w9#?I2rnq
z0{PCQYPtxn8ieSU7uY_VSw~;B7pH?N-T7hZI2tbDwSQ^IaRZa}Rw?O+;RsC|)|;hK
z)LXw>83DqR%Zm&32iwdpydQsXjB6L*d2sPbE&NV=P2FAoyihHbu+>Wx`R`Ve@E@wB
z?&?NBLRY<*xY=p%Sk=QzRmL1_qu?|evVh+#^JB>u9E>nI3m)H&Q+RWX<ErW-br%q1
z4H+V>?i$>w1&}ZQP`{K2H+b-T=jHCc`dy)TP%b}(odX^&9Z?HQ@SL$vo@NUCzhCa)
zTim7++|<iuRTU_3Qmd8K-G_P)qK9`MLPe^&v%hV@s?Q6AO@eXS{y>ZBf2evFzR`pF
zSk;HB{z<iJt?z98);<ONAEguieM@b8LHv)_<L~j`zsYCj{Bv44O3m~&ZCs=Od-QlU
z8~?Yt(pvq#|9^{*RY36G=;<UVEg>o+C@WltN^B;ur=@b<ysXLL5Tj~iw#TgKzu9i@
z93FuHpV0q%D8*ma;NUK@I{J=OTB2gmXH|rRP5(8#Vod{_GE&Y=hx&$5@!=M8M6aug
z_Yjo?BW{UbBiNVW5W$)Q#C_Bx*yEo*Mqq^p>+1i*XX@EA)mn94{J(Xj=*7l{YBl{D
zO4nGKQsL3G7FyF<c;p{#;ITP%$v|y!=E(|=5)A)2X6me|%-FSZPnM^QW~*>8TThG1
zE*F+v_Hk~Z0oSKxLL8Akx*CN_e<6*^x?tkWeJy)th0oF=D`$<;MbZFLR=$Grwi;zL
zpN!_OaE{sFZ3Ta<b5*4UNdkI9v_eh@4kF>ruq&)Ly&BfTtJVt+7CA!Q6jc2DR2Dfp
zl|3hoKvKc(o~0l>YZ5^T?<{SwZh4)xH$_Py@j0w?A=;e&fmAzI*FfqXN7Vx@;A$+?
z@|d)f-EvK7RNnvkLH(!}S_=xp2`xD4m(MxW9JG)SO`oZ=YSHK}92~LNz50f1hP_J^
zaqF$3evk3>nkrYPcg_XGJuK{B!-b(A{^26;zBo(YH$T{Ry*aFJ(A$h&1)jBL)@WsG
zaNELkP$GX5Q)b)5W6v3mb6m_^`cSNYEV|!*fZT(ahN>)9Xd-ro>G*1Ku^MP*+&`XP
z=s2VJ=?8TLZe}+{*UFb6uG~aVGjCUT4odjzBIc70yJ=@U8Ojq%PkxCHGDKl`0b!sP
z7xBQlu6|=1hKg(@7RBl!es9C$N>AgOr3*qONAlR9*kQrgt*bHSV?|YA#ew*s<<JV(
zz;U1oyx*nmco1^;YsfKb7HFm_GCNWYo2UQ4xvpR(4Yro=V9g~67bGklgAMFs+2u@%
zVPEUW%3mIs2nI%1ueWk~Vz-qZtCWE$(YFUczu1|aF4SQS87$2xuiF8<f1gJLu*o)D
zaVe(iwo|BYt+?cr#Y(TSLybhupin~uC@Xo`12L+{|3@(@Hw@z`wR8NC|NRYpCUD$%
zS?l|z*PDN9sn&ASeXtBNPP198<dp>_w6--4>B7d{*C}1DzKrqsfJ}WtWQ{AJLPe`W
zepymL)N(|CEp7ICK-q-WVl{HxBk;uD3mGS_pfwp!x^k%cEA?h*Y=;=h-oeB{0^c8o
z2}7QV8<(WpN_xW&=NMnVXT<eLVUCKq3?Hx?3C^iQ$k@x8vZU%TgMwjL{*u}7*>Mdh
zt9IXIzW1GlqQ~WC2z<#rd@)vf!2J=f;X0N2WY0zq7)CUptA2dytz&No@|v4Y7rJ$f
z+o0ayX>0ojJGpb*gv>nuAMR{!zux)kGv>AVe_9W-`v2zl`2XMLgNH0J7V(o{qh_7x
z6p12AqcCZdN{&K^WBUITN&atSWOBi2>|@dkF{2^)iAn5Xpd<~oi7CK%^_9pX`ZP=r
zVLONiv=XZstZE!;9usbH4sU202pB`|<5j^p9+Y%0a4h^Pz6j67+~b^3jegUn;My*P
z15+T*!|;L<%)v%?j(qb}-vjuDGJGfARrOsoe-XP4<qVDUSY$%)8EI9ZdTi@-$iVfV
zG5-bYUz}_@CqdNj;I7<AyMJQ*-{$he<-Gmh!|(Qg-{hn3|7e*x*MK?WKU@&FanV`|
z*pEWJd9k^>SKq*YOLt%y<NE|wN%u?zC+N!+D5Rpv81rr61=iXcT|g08flx{N-cxl4
z7pfXeFs?-`H&vKHVjP{KxgfRDkorWGl*(rXQ-@0ZeO%6%+lQ_P8HBFE=?ip~X3MWZ
zSCg?C#6$ElWV^n8a4OvZw9&N=I((|mLsGM_tbw4D$v`z5O)Z>YbRKo7?t10ivhTyo
z5j?*O-yht){QSWY`s|yf_x*l2JWbCupbw;|AQ*f(sDA%kx;R6A)RIQR%do3>C3pJ~
zUHiEM)eC{E=?g$_1~$}EFFaowVwj-&%-HUzcR|FiGYH{Fit$YBl_NX*E$i;Fl_K`A
z025~dw2vQVflNNQC$Qh&vk4vWb|jzQ7qRtUeq8*l?lSNXpVcvp@h4M>DXb;_<XRk?
z!2VN4g88v*CkmE$is>BV?kBc~Ou}wF>;VQ-`)qcVKe^jK+;+chw}-H(3OlU}zz#pc
zb*>2$D%9`NU<q*&)Voqlv^ALBre|o;ymYYG{OM)IQn8f$P+e2+aT%Eh<=o&?o>BC=
z7<Oq<9wVoL;h+sVIEABUV;*`Rq2+H8Y%Id7n}K&hnjT}?A3Lnec+mYnWH(f>|7&aH
zI@&ygC|0MGrQ_o-ZsVH!--j!!+5FGV$1C6W|8MfS^TX048IzeyI6Q|#>G4&m^z!iF
z?VC27wBN(ZC=)$IT{@|jnOX67%x)}CL;VHTU)bxI-zeYmx6$M{nH=-?bQ}y5@z3HX
zz?g<1J<tHrZbrUyx-H%6*%cg=`|&CKU+OY*<sYYEY!D5DLAmsS(h~m`>Rxr8|J>Q%
ze7ys`!?Vx(MJUW~8n}UXP{!{>!(MpV7z88CFZ{=_7O`{Kd-#To5g1?t*hrd&LkE5@
zJTXCn@k@yqeEAp|a2a)o@a%mV)8~|#yQ2B0lE+-?gJ}~@^{=!`nt@7BnFRt0zs4Zy
zloc|3)Hvo~;&%WUC7s~M%I0_+TvgSN-YbMq0SHyK=049s3Wt+{6j$Xx%G57<c3roG
zg_J+22dY9ZengDn7yVdMWoSD($rR=x=JBI919X{yO~Y@YeCK!k_F28xUmA_ZhjOlV
zJYxH?Ol@7use!*s_|==tL<wdkqf#l?%W5+0ql!)5y)T>M)K1Z3GrRDN=Qcwx-mDrt
z1XN<1|8M;W`)GcYN~{Eq#(13%EBQ1WPy{dY5EFBwEnMM4zv!<CtVQ?1WE|0sJsJ05
z^xhusHb%i1gy*s`t_v<CfB>3-lPk|qa*5lh9ra$^T^eBe&+(GRyP?|>51w_kAEs+-
zua1u1H1JFgEjG^LB(2dmN<pg2HlV3ak|0JB)n^<gBVa2y!%~DiZLwmIo-tMEGO{#G
zYwbz53scHha(0Z@)&H~)_PM(iQ};OTT~*zsXWo!2=nq0vW)}6f+Tk?tmhBie!z5Au
z1?l?pFXggB5S4Q6mm$5aJ}m(0P>31SH0}fqGMz)<mo?!gm+zY&)U)*sbp>Cf1&skY
za|i$~O}N4U_`LJIA#QqK{=f^1B8I~6#t>v^VO{N`?VZEJ1`CFgzg66xc^rW9fidBs
z?auF=&Wqi>olfU-S!$1i2r2CC@DqrpL&4_G@7d<1JdF#_1QOA+XZ7}*ovqUE$S9y|
zpGDUSzs#Df2&k&_(m;pP*dQ2RA$)#$=XYxGb3xGvL{=;)=Q(OvP-)<vIVzq^o=Xr@
z$5BcmZ<6-Vdy2*jI`C>|?@i|w`kZV|(ija>yQK579%IK>?!eV>9)~gP6ul^Ih%eL0
z5Q(MJVV7kAsjqi3k4t!nkGf*kBmH|xGsTV{dLVpi{!A7GY>J>Mh|-5+d4`3&^{M#<
zizyf+_P2~RKENvpg6h1*;eA^A?1C;vN0UDzbO(kvIw|SC{j-Iwf5A_I{7;WS1d7rQ
zi(X&b#x?T)@@gv||K;)b{9oVXBPQ<28ClD>Sq;c4bfkbrPwNC>KktUoIdB}{QWTXv
z9;&@)IJs2G6>R4NwCfL`R!W&ONUtX8bC*bkh8_f55-scR+!1T@-TmDo_~*p|RDUDZ
z|7*<ri4GsFJbnVNw!@PEgur?mwG(Sv6|$^W)I+uEy^lxcwQ8!CdW8KtgMF~>WcH;Z
z+)cETQ_Q*0i<VCw1ko?epBZ%;svU+oR|D!Q+PT|~mWboNIXFC8r{3-SZD(tpj$v>J
z2>LW3Zfx$-*52;)G9cxYN^f?zaR*pmIuFJeAx0MQ-QP`9pBv~2uywHiV!gZ+rV{;o
z$t!^&@Il6-bjjtrtulIAkgf;^-5M&vKL1|TPt;v$RauP|Mh7pc%qQ%g#Q;y2rWD0V
zjbfIe0FAEaeRMIn!aLC+B`+Rx*7mShHqeZml?P2kf%W9>ho_^_DCf%G#c@=3aTv_I
zlgNC1Dh3HaM49gX@D&}V^+204_T1|@K9x>i(^CMpez$^w*EQVg)X|7Xr~*^PBOt^?
zS~D~EDmj~g<Z+Sj3oAZhzAt$l1I0l5pPeDlA8}YIMhf+C<SDC@hm)`)jTU2yA68no
z3fdY@BL<-X90Zqq^0T~X2as!O@f7}Jjd46CILOvcqH&U%<67B;6(&LV-&V9J*#G<E
z$?e8~xw-$xYIEiBcmI!X@tHFJ{gX*Oi3Sr6oc49@AJ^Rfww9M4<@`TdtKa=UzR71+
zw2EhR`9DYK3mqbZ9TLLsxPw*~SL{-b&oGY4DCmYAG`zycJoQgY*a8NXpv%?{U%{-a
zmF82lQ*X;nGAU)$2=%Swq1@B#E4j_$L#~`WNk1w8cR+~0he81GA`1IGwirP<bnnGm
zE!z5~E*DY1&w1V|7a@IN{=Vo2VoBpP=qu`mHgMq>2=xtEF|a{ETh)fP!bhk7zhEd1
z4hHj7Fxrbx132oR4e*G~ue>U)M;#tP9GIt6r2;5Vx*&It#$h+&kUDgE3pn+Igo{&W
zcqrVyV|w=f74B#!lRoXeo)wJOG{?w*&OYUx4Pfk>Fcl!4^<^T$#8i{n>k6{E+F#KL
z0u2=@5Dn6hb}`UOhcxcA9>KtNBrtg8vZ^YT%cV!ns=BX$53H<KP2sJBxBEvshaD84
zJ3npifxM3j5j4t~h&=)v@=wBXIOM4jpvK+^?T}iJa3aksGPkBML&p?PP9jI<@PY|#
zM|2x`hMfw4R>lDc1Y?ZV0g@qtxWF_DDH{3_O#tO%>{NUV1BP=<0}qV{iNvtfQ%}G~
zc(b}l4$s3=5Vg#J8F~<8I@rsKc{+?QYL;ezIL=)+4ZQo^SeM75HOA{*eBc=e(qPl$
z2k>4;IN2QvO#xnjEaKW{(jBk{YK{7FO6I5uS&ZN^IS=}iu%@G&kb1lyeF}jDQQ*_-
zQ1_n9uSlI0>E`G%mV+`4f=k$d1`JalC7r4XMm-`G7=T?~T{UBd%MOt3Aka!?9lArL
zVXd!Ybu&tO#g<skoZ#IvGNlTCud)sP(&6U*cIWlx-@I}d6B@m8)-{xRmUyj8i7xvL
zZOd)NrU$Se4I<QKwi?YPU1PD;G$#LKx(*<yTvfNK?aQ-0;<;_}zRpQ4nYW^i$B?-v
z4I?>D@VgE@t#}M}G1TK2);G*B+CjHZwVPjk133%g#W)<Aa5w@Ic{9&6dL#uL004HE
z@Ptfg4Uf~b#kIJGEGnlAvd4>n$P1H>d!&)TDxTdb98_=3<=BE_t6qb?X@+eN6dUW#
zKFE(9uMU9k3{lo6!h5SWa{O;`xyT8^sj>tFJ!c3QTdQ859sNa0>#pL3%ZyQR4cdhY
zZBv>E-jLtFr2!1SV95_HN@bqNSzr_=H8o|%SWBD+r+BY7#0U<3LAfl3(m1LB0Vk%_
zM86LF@eF=Egxyr?g%`jgh3v~ubJbSeYEQgsvNQHnzM3!k)K{q<REt3}aa*H$#=WiI
z`=FlPOE%OAd36lCS8MlrMlitd@9*^|v|VFtiBot4@IWN`;G2}=m_d6rXY_0CG}f|y
zo3c`U?-Dz)s!ouI*rx~n(NY~9qSu}3Pu<rra6G>qAt);E6#-do)DMaZWC(!++d&cE
z2TQ-GE_&0Toyw4`v_BVZdQlpoa1<H|C+nu=fyudRNo((a{m`&nv3Li_6rZ)MSo>C3
zjppC%8CeuGz|8QA#TY4eDxOQ0o*0lF^3}|Uq35D?p27_U<)VFZPKyT`167gpW5{t2
z!}Ex}bvXbZ?CzY=#EQ&C<GoVo1?sSHY3)IUx8-~OJbSKBF3Ov{?*%T>Ak(1gCxBIR
z0sOEZTx5?P6EsV;m@KLV_u#T%k0eKDWabXcKgGQjZACJ$yk3jIR_6ut%sUQc`;L4Q
z@dMfa!UIBpdYAb)UOdqi<2$$vbN&O2FtRhOkfG`-JzUJ~A&4Zt*(fTW;d4(5urlov
z{g`Pf+L`e90z)>Xdj`;yCjFV-CkFr-d`+ABWI(w^kSJkKK)Iv!5Vn|@Bvp5sL6q0T
ztS~wj91+n9lH?|2{~9bwxaj&l#712RW`p>t?bYC@M_9#_h%8!(3!=4JZ#`)^Pu!Q}
zMlp1|N=L(0CT!CwCC6I{Y>JJ0SZdUPcIf~I=u}{%s@7<9T=*hXxx`UnVuGRk;}6A@
zg1akFS*3u?U?=ny*q*qlmo-$ZW|)nh2(m-(^?3f^c;F5z^wf-@o@{R{WxAi#EDOM3
zNUXMix2|%*?PF%o0!aYYZBByYRoFC4$wY|IAI+tq<a}F2uF{R<utEs=y(5p=lpREW
zayvK-#)DRK+EQ$zj}Y16k}`d{Y3EBq3KP-V=egnc<bfXw2VaX&>$5)AMJ`)yYcd|=
z5yDjz_#UFU;YK8;K$C4|5T<7_y6+~1j=M8>|BtF{cB3+y%i&g1c9#Txvb*MTvmmqp
zejJ(l*P32qzfJ|`FWBYjGSK`DxrH*)9jPBI<=B5+H^zV4i<W=U&lLSXWf*}kUt{)d
zKG*60A7$e|wH~*=$AAAeA8p>bpzTE$O7;<_Su5Q|S7o#Y|A3BDham{=$Kq7U+2bj_
z7;M4h0fk=U$U(G^*l03_y%^m`@5X4c^_euqchtd%w`Y!PIHvfK#x9TT8_9b;t)S%y
z1?6RK06<8KkG7%wgbWv=(@MF$b5yRC&DjFJFEf#qtNL7iH-5jCrhR*TJ+*dy6!)Vp
z0y&TI9;_eMp`t+Y?&#+L0moA0o4BSlgkf(s_H}WTDc4r3nUaS)P_})vc~sVKPWqGN
z4AZyM@3VB!rx1<y*RyBv|D6Lidw7PAI925{v}2X8NqW@}`FrCyzI1lhi>Q~Lt*wq6
z$^9(EFzo)blYSheYyI#fwa*4HsnKvvwRAxd3L2;Zu`L{vry&(n$9)W&oxs@j{3<Bp
z6<0YOqdZ?wg}ktO$5W~Si5FE0-M(WC?^9Cv*Sm2)hMIRCJ$mG7xSlOJBlm1HhHp61
zB_{M2c)Ns)W&1gwARQS<pNd(ohY^trvT>t#j9-~*G5SN(9@_l`rttQ`x?>`79G*tL
z8OOMR5x%2dt$Y&4WxH9A!=yX$%_w|NGfkrSfuS$L%~Zm*Wy-9ZuG~?Z6yFN9vDDeH
z_oG4!6?>Agy_WiBd2sKC7;uim-?%N)0HUW!2Ubjn#z;b)YI-l<`CZre%qJcVs{wMD
zo*t3W=zT)UHdF%jokJ7f_F)Q2J8>hF*67~wI7IJFV3<7tXoXok={qHdaayB0p>dCb
z<;EsL#NOfChS5{zIFx5Y-KGRlcse7F$xX8&+*+knT8&0_e5&N%^7|iA?~e?1FbpIR
zyqASDmoLxh=251l$W)>VfD<@u(^ZO&labpz?&zUEZM44>_fw*5A7M5cYBoT&`09?x
z3UK<M>1LN`iNgl3Hd!0dQ16Hu_%cwgyO3!~A`u{hF&wh{S9z*Q^fhBN=3|h)nnB^1
zZptv>l@2b~(`<y;Tf&R!j)2;a>3Gb?eI|K_a$$}c9l26N^b#T}0J;6VMIM-8pz(rI
z+s~Vx1_9N5sCLEUTz4ENNgX(w(eI&cs2~Iz(g`k0S#?Xx{_>O&42SXLRC2ALqd5ZN
zs)!zsT<9-d1cRwhal)8$GMDerDXPN<@Tm8o<-LT-bY3;5a#V!uvD7S!1+sxh8|wwl
zl1>fv0+~j047m?9QfXCl&x;tfSEuQitz``brvY#ox#8C1241+lUl6w3!I570fPNzp
z_6=vi=fn<Qg(3QEv@b!QX9<2g^D~PJ14+3on1gf!N`eX(Lw_1!j#BO&WeCE1!7)po
z60W?3bhFQCd|=H)=eWXXVFJxW@g%_uMY_R1k5H5g1s)Y4J(91RWxS*X%@oLP#lGkO
z@9uC=QMP7jG?%h$%PazVCYxNgkgN*$0dP%g$OS9;qSYc!_-BzL8|u=&%U^Sxb}piv
z4aOx+?#Q!gL!>_#WuC{%pNU0Psd%GZ$DIS{`DDp^?Ds(i9u~O3^^s>Huy2V>sT*#O
z%@lkE>QS%mqxol`{zDdb8UD{c$@7;*pzI}Xq?FwTRheS8o<ze4?X=l`=Fab2@$)@~
z@Pm5EjyWi*ygGWlhfV|R;?yYTm`bK@j*&cDLeZKZ@|hH#awW}4q`6S6Q-aYMnyUaS
zftrc7_c9BtSg^RGUI*h(vRmTLNEQjm+f;;p4#>X(V{(*ot^r-Si^ncFJC$#3b#|%m
zx=1-sb<grtR|ud#%a~pYfiO_^Xu}zmP1qK@AetlvOW@z01vwK)0})=93%Y4Zu@{|#
zXqNWFb#&K^dY^wO^Wf0$F8thhwgiQQTtAzwu8#@WX(@~_6R}6(&H;VNIhHT+Y26$t
zQKo`JW!Q*E;m~MDYUK;r@lP5T=uTL{YWhhR+qIsfBm;MX^HUb3&e4*gLTjoqCUZme
z`yWB=_zx94IR0E!OT6A19Mgm9Fb}x%yZhp^gu2`O=_QJ+ASRrjeilb&7|hMXmp@5K
zyeG<Yl((2iYK?*rC`SXy>WVstL#gZjZm9S5I&%TKLD~3#5Afhr&O;Vu(^|nRrF<}0
zVCORIYTH7xZ`1F{Zm=;03bgGKox-D<%^>I;+K!I)_{5eJLdt*G27vr0NZtW)Ltjx<
z-6&0Sf=hM&GNaf+3s%-uN#`&yJ4_KxogQ(Z5u8Hw8^$y0a5BJgqs&q0!>Sc}qRcBr
z^n&GUjMwN)zdq^`I1byoz_YMm)>@_sF8ZLw0;**^Mlff7=tG1V@c|-vSYPp32UYEJ
z%)tYImId->hd=Td(O20<866rm7yky)jkb;{(rTIosWkwm>pvjGKP@876#f4#MSkSZ
zHSynC51T7l|BuJt^FMr>&yjFA&1!WjR6OG!hxssYlues>$8mTTz;S9UdIX8P=!H0i
zlbZ_qr!iT)a{wn{Jfu$x$(vmV(Lyk|EWJu_6x($(&`KUDjU}d-!nCOPZX9+cOr!P!
zOjFKDg{GlsNzQ(k9cZAlwRf=f*UsTi`(W?w(eA-M0%+CHnI0YIbv0a~+MDpKQKCqB
z6g;0570xE15hBs>1l2bn6<VDRoKOdJppE+zl0c(Gt3BwdL=?pAPax@M&qGhjl;Wfg
z0+Jn!RBwWzcuIPYf}wJA*<uTfV2^CD=@1~nD{~v{QaTvnx^Lh{TPpnw!-@o;1E*ko
zPdJK4Cs%-y&0Wb%4Tl~h)@lWjGaMz-c**?AeGuuLY`0io0CZ59fHy!xSFND$gBqn5
zXhN?;gSiBW*G*=dZZ!odAe6cK3N`+3-zXRGe|FOD)!Btuhu-P%I!OMzfnTC-IDZ@0
z#{XQ&<o{cKxZHgBo&SG}&mG_r0muI2X;+v6n+&XEo-q+y%B+ym<Ow|}*F!y_=mDB-
zFqg($f>?=c`Hw-^<uq>y1K9Rh;`bIe2f(my4TT}(@t9a(*wf41pnzezFd88-5(gc_
zDH6^Vh`~ns{je`t3Z<tDm_}T;ZaSHmjN%Qo%dPifPG*SQ44_>E!<4teI3|11<B%?T
z&^?31WYa}&1c42W@x95Dh^-+wv=!~fqbqz7rJS}<T#?h@6E@I~<4?-6R?aY7_SdOw
zQ_^HvPb-FH&CX*Du#e5yN;k~zsyA`G%coGwLrgk&3V;fy-WlujD9~dIo6-BX(B6lV
z6GmZuM(_kxx9t61RN9Wa6XTz^o=e}@b6=MvhOIxBa1@{5PCygkA<UQP=sSdhJq}1E
zsR9rffqsO$ZmOIB3GV22p6%|pk2d$Wb|?(e2HnS(I3w1ZAU)e5ZNd7q+V>)^aOZi5
z;bPYjwGJk3#Pkk$39M%-7;@}TnZu$or91g%G4?}0I_5@U0@_^kLkW+w6eD3)l!>XG
z)@bjckJ0`C#hHK;=*n_wKi&^7-i)Jj7(>|E*RMig1P2GN+g<41X75+vt?TtC&1UHi
z7J{ic8jPqArY=~APJ%>HI)V)wL<GXG9d_5FA?g%U=S4j7p1*w^B%jvNrMz_KE#SD$
z{k=m`iu8|n@fefWZ%1PaqI;De9ZX&dT;W6MU4VXP&#%^rzUvsgtO3ZJhX0(1+~4+7
z82^Wu5AX>1aT{%XLH@_bAQF7{|NjP`>*l}N>aZnv2Zrew*2@>9guZV6S6f;C|K-({
z@A03$$;ZZjqA)ji?@$8YR#|;0nb0;I9YvJ0jd`g=Jww3|wk&vdy5VURPa-(0ZoXW<
z+k!ubxRtJR`pNp;-{JXZWWVJSH|ty=(a8-<P?gW+(kbrq<L(*m+IOL%s-q+GNpz`P
zXiFI8oT^Gq^iR<GO>QIlE#i<lbQ#PL%cb!EgZ_9`8>hdOPNA@>Kk;AuyKWWNuK(rE
zWYmv?-k-PrTaTL$bL;=ncm3Zt`M4?0zlsAC(8)C%K!8#$%$tHSppx#0*OgwtEn)_+
z>=aMHe`6rnhCT?akyLkaaj}G9q!5tCDp@k{d(1s9!ef<0X$b8o&0OS|WtEy7zgBT<
zYEl~|CVIR;ZkWoHVJjG3k%1%LfKnU;JljyfdMRJSFj8CTxc^{_{Oph8aSFTzleS-$
z5*VeTj;V6Dr*fV1-6#AHGOO{4%8lEsIu{rk7Y|o(w$g1F6zoXe2qvzk%k$rEh>3?i
zkKe4~gL4P`+_ez3u0@S2X!4pD$d`<Bau#6zk9wehu@$zyQS`LYezge|+HYUa0$%>A
zt>;?)|F9#!I~dFT3%LLF^55f?l`Q{XUj8oseUs0v@&6p1T*Li=wlSU|MiZ|mU&4gc
zADMOahw4sJl-OFT-dj)$)zZ%X(c#bQl!PF^V6iq<y9=0nN&B)5+@(e^OLwCog|I!S
z!FQ;In+0kQ<G~<GYqT@e?aokb$liczk_v1B8K_Tji;~LN@%liOi3!rEm-+Q*lAKlN
zV++@={}swjrYHB$SpO|J0p`~K>hkyX|1CcD{D+oq_3-PMK#o|x@(@VNZ2REd{@%gn
z_S?g~_44%#)jc4};@gf%?H{1}kS_}3q1gTM9R!Q482YwH;%7;AdABzmc;4wn<I><0
z{9F90+be#~CrNWw%*YVf+Y-rQcb&eLj3j010eG*@AovuP8W``F@&}r4bu@L1hGE}%
zBw13NCxf^*0W?R^zw6oc`{(OF*YW@ESui{e`|;^lB!Rpx{`>N3R{m?Pe2@SBZ9bX&
zPcX@_6_h9+pUL31wib*}&&d*P8O?bM->iHV^ES_vQ%W?|v*U3v?4E6y4Pit5^8VRy
zGN`jGlWhF*!P_1r=OI^vCMhM8hNqez=q+AbWnZ;EOhJF$K@ux-Y(`yuZS5{qU;a??
zV$#@>Ey@f>?V78`-%B&&Onkvd?5OTR*Y45zPI5kD+IML2-t9M7dOJED2fa{D#-|u*
zOg(#h_;P1|>*tL%^=x~my>+<z25qD^a=q873*p~^x~m_5C`pb$Q?C5W5RLh<E@gg^
zq=Y9JsLkYM)Y%C?6t{snYTjeUF&Ub>IQKjx>Ms8I;9`(Nfm1Z1a16Xm-DR@+|L)Sv
zHX8C<mFsmzYMuYA-3x|jZ6xycy|cA@Lv=4Ht9m`blmeJ61sc0^(C=YjHS#9{ypHig
zUFe+d^XJ26r8xtW2ld<i+#CJ@J;8sUUn%Hj4gQJl4R5;{Xh+}Pvu-V$5Ne6XcIn=$
zdqeo&F^w$`D`%h7gZ5oY`7=J(+JE_WC12FWHTGXC%~sa_YZ*#>-~YeGCvX2%Z1&~l
zBS8zLyjgCPu&tNja#)YemB_M_VHo(pR?z?kK!M;9jpHF2^wd;G?3^eP7w&v%N8vd~
zC1@;!YLZ?sN<|@$@H}%KF&xVnjZs*?ge-+IqL~K{H=A-Y86j4<%gQj6Ip!Ig1#$A_
zVW={;D&!gFo2g)j0ahxpX%ihP97l5jQ{<G5Sxy<ZJicd$0qc}al@Q5<jlkORAk^@p
z5Tl=BhHU5vS-nu>Z1Ym1$ZcoQ=~@3u^}-|?(**>_`yS&Fw||A%dHQ{LJL<<*oYgRv
zBWO(>Pg1np!)zqSj)@srGY{Z7MSBU598$7?#z`YDcWTF(zofxfvrTy7qR%GH$6?6Z
zDFu5*+h8`)Bl0n%n73F%3~^GOj)JTL0|sJdPtOrFIlu^wcM6A7E_=q|2~({$Rl`;)
zt1#dCfizFgaFF$L+_d2#j%!JrhtY!?w`bbuZ)oy%LnF6uVl;-fP|5l*Owo(K9uGk{
z4z)4VCWa)N^6tjQX0XZU)*L+S1tDf)|1DHQ%$%e)`{<Ajoj{lF8k3L*2bDk+qdaTV
zw^q6{r`a3kg<MMGB^+59{qOc}-#`C1K1K2$My=!+U$>J7=nL%sR^iWg`@e7Sxn}<P
z4y!TfeN7wJ`Tw;ZHM9AD;Nf@q|66>}Welf1A`y**Rg_osHljdUOeMt%Dq@Z&I^1p>
z6JWgFdHsCn5JfIbOff;BAA<s&1ksqSVL&L-NfAM`L6Pw6q;FLK7_xv3Y_ignzM+B5
zFzT}K*~g$nD7T>$91YLWjrLS;_?OTU1|3B-(aWn|rx>J3A@1bcrvvM&kW&FABwKQ<
zQA$JNe{i5KRd5+4oXaH4Il>t@7oh`)j}ci*6sUe>fZ>o0@M^di0=ti6ud`rGAEfj6
zJJ)%qqv+BhZAf~IxjU<?ai<F_TzM6EOrmT<|7?2y{_#K8@PB7XeR&(#^8eiZfAjJ3
z_xt~E^2r5z^~0;0=qgXD@VyuIE9JozFl`J$4ex?pPd}(tnvKSjCr>D9QBW-*+o5o;
zB{(~I@ejr!M`9U8qp(l8w`{CUjBMc*)*oohlBGey6!F7FClb{MP`6=y5TW<*1miz6
z(OlDcu&#ztzo4WEF7X-fKJKWkct|-NC{~_jtnU6&!XMmmV#g9+2+p@Px@=&Cu+V$@
zZP4)^S%loj4>%M=X#o55I=yL7)Is=N8U&aAv*5CXS&SO^O@}$U<ktB<i%Y-1{NOz!
zT;zwvLPvYK{H*F5>dx=w#quH*`dt3=VpDwo{P~|b_`gUMU*5(w{J;5VH7EZ+Uj82c
z`<r~e0smk9&*A?zW7!O;`ihc{#x~7&$`btP5IrQ)S=)kUv-tcou-QMK#TKl8_T<tA
zW4E9Jy1D-6aclK^{^xJ<xqki|rxBd9hj2ds(l)N+|ILRv`>)o+@9{sr$%ija8p&B{
zu`%u)!@og%0{_wt$YP@(pMIC_{*yn~uYdpNm$Y#W|6g6nt^eib%J=pEO+K#w51Jfs
z(6prVe0RU|X7lLPdb!b9g8wJu?ozq5wfDA-3Cdm_w2#(X%a0pP_+P8^=HT#XeFf*T
zbhP_==iu$pI_6y|?H_FKwAUY%4tL({?QU(h*P-a)!O_mv(av_~HN2$D(ar7cU9>OU
z-0K{Wp<#QyTrNpGp+RtE0`6cGF|yh}j?Y86@}<~5gAgb);ZwO`Xl|4+0ET(F$Cy!A
z;=u)ze#((K(FS1<_o9<46Pkzb?;9odhNuS)RL3DAi6`T3sLJMLnVcH#=+xvrbsmh9
z($4-i4ba_61^+&vQK?o1c=>Lti~?wxLVS7-7aThCy^@ORnG#S{O5j*-Lg}ZfXERcI
z&9t2Sdh7<#)<Hz?VgVb+@~)oj>=pee9;aMbk!yX7S<b^AdJcr}+?z@$AS|LD4w0LX
z3zPGdM~T9>sv!VCF9rntnf4l|Aik`pd>O9p3PHhpHln12_6(UHnCPVTy@3pS85$KF
zn=-x0U}WB6T9|qrwm8B`KShg7*AM~Qy8C;cNcpe<?S<BCxk&`z&nxp!Z(?!z5Ru>R
zEDPAX^jF<=7weic<pyQwNN4l#rA9>1US_oGC)BRN*{fhD>q^J4J>i(FSz7A$BRjQ<
z$3h8)7RopzTNM~+%_`JgX>9i3CTTqSlh;hlks+>GGt|$KESBVKlA?za(0LM^hjS9j
zMUZySyv`KjrhC}Rbfnu40~-Lor?VVfi>#g-T9fJzb%x%D^%a{5h103D=IlipM18Ll
zI%L-R-Q|3z^h@a*Rwhp=yB4o+4L!Hq1~rhy>#KLOb#IS+W{&yYWp#H&-F>L;uBy9_
z)ZNGG?qAg1C-ZU?nCYR1wm6j89?JvE5?QWyULhxBk>7bpG$6wN^(Y|gOlITZ0Px%g
z?>5n}AGV`Em?ivy3;7RP0e|59{Xq@<f%Ef0$6MeGnf$5O)m|_`LwPo^+Y%x+!RSns
z24Okx>n9(u))xN^4B2x?!0F7YVVjRf$~KRT;o8QjLrxvM=@quDNDR=yQ90FzT4^fO
zh$U6LRpv)HB?cam_OqzB!SD_-_Nh=iR4@Vbf|P<0D%!svsNHQ30GffSJODQkE$)F7
z3=u)a0MZU8&Wr8QA?%VEG7sw6IDlyFSVI^|O$4XJuTO;I)<?@Z2LQgdH4yl-?f^TD
z6No<pG9g9V%nD~zdu&q&R?&1IpmbY3nu>q6i2X19x&Hk3^`XG8(f=$zTFKr2HXnYE
z|MN{g{$xx1ngK2!J_B(CaEx{xBoW4eCMF!HV>o(Q0~q3iCA)yNIc{iTwxSc2w1KCG
zhT4VG*C2q$r*Y6Hqmh_nYojU5B<PnYOg@H09kP9|Wcuce=};bx)d8t1j{VKH&LL~s
zk%cj9)?UwKNlxK>YQ*TYr8xy(#Q>|R%Rm#!gdX-X(a+Oybb1Ql0(BalL(SvKsf67|
zZ&?a{8(=1O9XXx&njO5Z-hAxHxshsBP|9v7wrRAtA4hb_fTN$<p0f2c;PJM-`EsXJ
zuh#*k*fu6(fE}mtWy5@UG{Sh`t%lm^VMqy|5RkXB?=QDO)4qgx4ro`YDUQ606U3HU
zrJ_Dj)Lb1dm$%c>as&MrRJoC1G)fM@MZvx8&RSZTR$ZU7{6XUo?bEk+6SusCbI0KT
zJkl{q9=Uw4p(-2}cwwybhT$Mcyx$bIBMgI!B!#i<fo@@c9pdPRLv}gQG1A@R89R$0
zRr8qBvLTQRX7^3C^su4!VfM5W1O^Eq+Q$^ymKX%<hT1%Mp|^0DGum*8@B=cQbLm_<
zrae`<k^$Y=0A^zFlN@BIiYaK?gyP}MR1w+2&ZQ!c0_qW#7==B*0EZ`*fYMXxg_b|l
zC;5Mvu*O8ZG>C&}*qcFkB2N<_BhDZuIEG7(Fyu5v10HZy*8v8Xp(H8LB1*o&v#`$t
za~jHR;sjbG=T?;aIQ(?-O^oFV{r_pP#G|WQ$^L!){=f2gHEaL<=;7n<`~SE2+)>_i
zD-f{Z+Za<jtIAeYfhhK*zT9jzRXgaP2PvBAwgcGR`_X8Gde!IcZJ^vPa5vzkXzNS7
z?cmMNyZbMlsPQ>xsXL@69dS<Gi?bLC;<*9cxG2XFoPvcBn_~@12<+s9ZwbP?&BJ|Y
zXpPmjY{-0te6)ud-@3%t$b}14n&O|>4^M;c75fpQGovye9qA9Tt&ihl+`aAaz-q-^
z)>up=u#Ec`z!%YM0+VV{QS4JC9;M0p@1Ic{kc=rM+@0U?+50v4iGlt;d|q>&;Eu|P
zg?eN=W=g})Olf#xOMi5byYo8$Y7kCg(hWu-+7Cc!@6pE+=X_Q><MA+FTie+`*x5e<
zNOzMI*!!4sA1xfYgDL$@tji@g$a^dDjfGm)9C(4IFjE1B4`l`8=Ozi~8}azG00Kxb
z5qm5t43mYDz(<6jA6md48<^wCO<3jirhGJ&G<ZWOKvPoS!r?KKw(N&>^)Mgh!e2tq
zWR5rJ8_pJdlbPgi^emTWi$NNSMt@Ps7moWG{CNQq!>jG*a)W`=F<ZYQV31HwV)kf7
znIjrbU^$MwpkpNKlGp(KY9DRy?ql}kq$KD%*}Vj9{iOAwB<SlW%k;!8v+_ak-;zuQ
zM2}bpX;%P#<|`VaOZ`gVe8#Y6dikswls1%nt*JGG6+OhSlnTrxoi&5!hLW!}wPsMI
zho<735z_v%KLz{$X*jHN$f$6fCSMfs&Hr3;|GV;VIlKQqe)!$~<J){P_rE58YJy(e
z6e<m=AUdJbbt0#4JT=hy_V`M;C+A(3khv<EL@7Gp(%wp^?xhqJOF`rJE}R{K8GW{E
zwjK6QR1%${A>h`g+gu}4pM7()AiOFpmk(oNcoXE#OPtn_1ottgC{MD0;b4fOdj_%(
zSl0(EQA}vJ_Y_y-X0jk9Y{uLm$1#DFtJgx1-2L8}@;=+I)Em44=X^3CpPb4RcCe{R
zRqQDF9Eo?J7;w)%=?>TN%FlU1vP=2yisa|zhtLHCzizR)`#S>rjK=0JIB0W9K^O^!
z_?~Wf1fu$Y(bzGOX_E9|?;VblK-KBySC?3BKKu(+)TPj}^cTbR>zKg4F2OvV$I0aQ
zS5;m*5Ep#RR=l*ezkat1M?I$)5{hZ+59f_;?Q*sG#Cc4W5QBV^^a@DWqj>0cz6iwt
zbxYxcTq#UmP8pJ%g6U-eI6huV@yy#^aFwW)N2{6VcX67tWog*;6q2I>g*vQ{EDj}_
zy&UdSXE9guVe`qOQhp}uG|W7gd=u%9Z+*s)nLal41DgAV+}v+Di*IuR;=ve1!UbI^
zhb~bp6jmF~b3wh)9iFIX&pJE%+Z`AaNtJ_Rr#_SbHIfX;#o{yqd9@AvjZXD7TuM8`
zZZv{p3@Qvt!vxX72mw%BB0~T~W-eb3k>QjWQJ*<zZc}d4UkvGRRaWJCcu52>rPKHt
zeo?Adr`zQWY+;V&E&BTfu$=+O!sfs)oEjqP*11TQG7Y=*XtQ@l21D7|Hie1V{IfUZ
zZ}=&a|1fR(?PUJp&&}<>S67!?|9|$bzAKGn>HjUCqBG2{niT{zW*0Skh+yPA2wuQs
z_bAtl%%~HQVP`<&x_tMis`_<ae2I5A&pqdnb7EkoU#qLDtGlay^<w}1JwEr3zrbZI
zpy3>uV?CQAzIpsB<#Op|{J+cRTgLynU=WY_|5o0n;=inIyzKwJ%ZCof`a^Zy>*F2|
zRGwx!^s`)pd7u<z5<Hm7;RVf^KX%bnMBqF)<EbBde-h3EXmru)FF)gj?;-*LP&DB`
zX8!P!{fKu=(_4<4nRD1Q3~rc%fs<tr<LL$7%8hTQ7kH$EsH_|b4Bnpt$KIl&>d3|0
zxzMBb24Rj&d3}AKbv7f+Ewd-rel&ANXxzz9lOzAi9|0E-Oc$ELjB_&#8-o_S9K}<j
zMnq&p3dzK^FKyK5_8L*4oRJ7RT*N~Zj4zC+$)G-RD<2VE8S_b6x@@n%-@*d^z&$fN
z4TDR%SDv!-AaGUG=Ku+Qig)v%>w_k9L4IW7j1@B7Aczy&^}G>!rqMB=e}y=19^r8C
zE3tEg^1%4ftAvdg@}SY}U~1e-4$-t1G&FcE<6%u5G~~fkbo_PUgf1p>B{VPY?pBx^
zcu@|o<Oy7lNJR{_f@kgo1p?m?ERGKGozd-|@$lB6Hwhx2UpMXrH{P|!kK*|?p2F_K
zlLtZS7c7at<MS=@-{9$Qs^gLMe|_Wa+l2gItGvkn@AJvV|IV`(;_3+&V6a9I7!XWl
z3wGsY1ZMn-EMXOM93Pvfi^Cev#v%~b9fjqaPH(rZANJS}&eWQ7kmu03!MG4+M))~U
z^~-yBN<$(F=f87`d$)Lyt*Ds8>kl+;fW*vJCErQY_B#zEjW(IruLaXH8>^ff?#6^9
z35CcEAsG^2GFC<dn8MqEN-H3WopZzgm?{gsbMNbf-TnKhRQP4^Q!)0RJx|v<k{Hq0
zYNJH*JKmL+8}NKZTlPqc0gHSa)S$#kVUR)e4DVr+5Y(8oFoq6VYOszidJ5xpY*~YJ
z0deqe@$?SI*6h#7IfZpwB}nu~M#0e$*qkfEo(RtPQY7tR$R0`b8&rZYbP&<>%F$sP
z1x7boX~n>q$e@-vu+ZR1tLBp-vnAhZ>LBv8K^lZVV1+_3CP#Jn2F3Cu5_EpZN&`(B
zOa)0;Nj;JEibt|?D()znjGz*mO0<s0*1+Hge>@CjdHNx+mMtsU-iG1&>n|2(?ANY0
ziB?}TN(LMzZv$gx91SV$ox;e+#B(GXXig(Hx-XxtQef?+j8vlF*tsHgMG-=gj%ZLC
zJUMAuCpF#uwE#Ln<N=X)DK<jO%$6@yU;&EHg4&QwsdEUn0QMbVtu)EwnDw^GK8RhL
zI6^VLLOgw7KGN>$&5t0TsFb@cTtVOEwxa3n$a|M7o(5lK+yvBrK-H`|r%^DPO+^&C
z8{eH?RLiBwSN{9LL)(n%8~OW`wAyNU@|B&A9K_KNM!tv?cnZJILzqu)VHk{pu$o_A
zcbv7gO>vy=4E^bCm6eL6^-Z8lk>={d%}E#O(q~h!_jp=3b3mKEtzLMeYj5fg9phC5
zI(M~Pk!_ziE?N*))dNxF#>Pgfb9u*cVtu1mh0t;RSyW|2k9jT+O9M>%L>FL@APCtQ
zMc<T4af-^{_f$I1ZLNw?+j9MD=DXV#)n;K}gomZdg%g(;T9~4+nLvY0ek~6Qn!lD;
zm)15)rPr19*Ole@AT3yU0d~d|u%X^%LpXV7z_?TOoA+Bb09Jt|HA$9VS4yHTeydMC
z9*&$Sf@J}C_Sj-X3;2b_R&D&d38b4&gR5$3QxetY{~ufLwpO8tcb1xdl#=|6luU$q
z&KC<!Ia=7X7<hzqqo<M1Bm|eJ_+Tp~&qx@_hE_^4J!B9MK?W8oWyp3H@6!A}%2EFw
zrkyAoC}v~lHQ9vxpx;}oBu4%QSda|;Us%{E<o|#8{=c%8w*Py(vHpVp_FX<Y{+qDJ
z<EDR=Qn}3P*M7)82BS;1<-*tK5|4P!uh3t}4QSDQS7bG`#lk#zxI--Ca^pU_deg9*
zsKB8euRoT4)A$7Hc3@+Ht7^2uFYkj;dSw&Hy2~%@pa_m~Kk-74b13)}Ouah1;0Erf
z3n_mAZsL69O{F<PxtM4f;oyrVk;-|+&Hm7CJLYaKX@fZ4LvMxO&g1c!RKv|m#c7Fd
z5mX6M0Hjh_6fLQwTLLv26p<}~j=Hm<m(>_5NHpkKjS;70R89<V9&@e2Snv}v(0S-~
zInq>DCg)}sc;EVa%^vG@cKe@d-3Ej22i?xcX1!5opFh`n@L+L~)!KFV_d9F+cF=9~
zdaToB&HaN`vr*?}o!wfy-)!_&ShKy;I;=O_A6D4=!#-<w`mEL5Z}y?IerE;hYRHU6
zHrCmNV)h%|ojrI^d*5s|`@d72yUl(Z>)VA2YwV!b?KgK0TeU7bIP4yDdJTq6t~Yx-
zty*)xQ7=OMP$v}D_}FOoS#Ph_Y8f*FO4;eO``sqAt<&wX_YG)W?R~4kD}WBxo887v
zANwJ`VepLh4v+&H)>>h`gT_u1zchYpKtF2T-&aJby~e)|ArZV}_1b>z19WRCO%2>E
z8}tBD?;Lg;``FmdF6$k>@AaGg!+wK(=yd8t=U$`xvANUeZL(GeDZk4OdyN&SqhG_u
zK?*1Y=mZJi`}@OQlPK0~_Z!{rA$h+qv%StIpa`_H2AS(b+D@A~3?tI%{?11LX+gAK
zVW0LI@TQCOB#PCLC_SLuPTx!hHTKa(R`(Q&X*WK!ni!L+f$uw5&ZlOtu?&ON?4hA?
zlUMzz2K63N$B{3fW&Eqbjw@m)S#y`w>K~ifc##~2zt<G3LZsW-6ND$W{+mBM#D@xo
zLTfI}G!<+`T&|PpYs3$1F)TR-LO{DK0bwB~oOG2@*cBiY#)WvMCGzl`fpS3;e3fQ0
z9&V#Vn9M>@m%V5i>2u}@SBz^1CjIHi6WAL1SQq5}_?BJy-1$W(lg=_w_SFQ0^eb$f
zKdG{Yc9AfWle1Jbn~-^?^p}Wcr_t1(@?~Qw@;ugUz=S-3`LT1@$GNpkoo;X+E-u)k
znHz|7<dR(mMS>l}i-iU87?^Ii`Qe1ZIjnlqp$I>P2{{5qEOo0RlTsXo;9LM!Q*t~p
ziKWJ=a{|*l5p`iT-3r}_?a#8q1sTnpkN9U5Ts5VM@xjJXmKO+-imM~=P{_IhOLfMK
zx`{y~impD6AG?y<$fWy<bI|ImV_vXepXfr}tN>#ngmVx~DJ6)UMm3g}1|84-F)#?4
zc<(zy*6ICLRJQfasT}2q)xA^S;rhTK=~S!*8u!<KWQyfn-(zG0x4@l=L4b9-Rc3=0
zP{VM`z`d_5c&TCz=JGYM-(?sVgdZoVuI6|!yls04?WkefaY?pprR7vMgFNKIAaW9<
zj=kjiA?<8z{&X3tZNf02`IdyH$(<P7ys`H7m)yyIt$kQ)2^In&ynP1q$CIA*pS;nK
zj5Y%!I8v09FVd?zHGb%mM7KoJ(GzwwGj#NV@gFM}c_EZ|DbQ+uZbvc;_yZNZP$C5^
z`M}w;WebhEScwgo022`-LEt{5-y{T=;57^+6o$9P=n%HfDQchonaDw&k4RvcM-&JM
z1fvKhlRKIC?n(K?`|535@$o{*H(V{R!mDLVHup}a&*xvS&MmaY5^-q+!oh+`I(mil
zz`r8KlnfMP$)qCW&=l{)&?PV+6&i;}sZsaFJjy`h=d+gwz%u4BpT=4Af|Ub?QTL2s
z9A0r~6I=5a`-`Ck?}QcpV2k3!+Fn!xmS((Z2wUWZd>5fYG_&FS&Mi>%a<mzgz2^v`
ziFCr(#&GYcvLoBz`2n*Gd7fK%PQ%40^r!)(_wvaF0>G#VD7IkCHS<+&0f?y3FA9GG
zpQIKO%V6z$DHX;kWyosClwO}KV}UZdOY4*+Nc<3m&9#6Zq1fqKG=+_aMChk<bs^pA
zj5-oy0Q@e7fE8Fq`S;RWF2~Oyw)Ed5$*jn&7I-VM!khGlr%xfbsv%BmS%oIFe3GVe
zRtFanElrmD1mdb<@1?9%U7kc)>8~2<sAftyDatBk$VzBKc5Kc)K-GA`X;Gm`EbG!F
zmQT_o&g$txqRGi}pFm<&Y@EceSmCRxT5EmJAhUL~i*xW(RLLhWZ=!fjTV1}Uu6`!y
z`-E;Tq?((qAqUBxT%H(`{VVtsi$#X^C43zo`IkKQqZ^DDr#xJolj>)Y)j>DGWT<<P
z!HQf-Z@uZS7FEI5&;=Y*Ij(tqODVZP@79JRKey9rQkyfz173eN=AKMx_Dknh>S2-$
zpDm3hWf`bSiaWXBuUhiOL7*U$@Ka^6ImpxO7>k9OCMKA9(pI3;nMt*n;pysP0w>ey
zxgykY&3mzQ#=y%)j(ldMt};zRns9b%GU4ew&L>4*H4~Z<7bn5xuNb&yEc_%Jc)mfV
zRsn8eU}Sfu;i#}fCQG<kC|c~~u#LwZCq#SY9iav+Yt8(OceJ<<0Yc-J3O7pPCOfuR
zD|u%<P_QEOqov}S1i6jE(sJ;TBI05gAvr^D><Ysy8Ra#~_4g0tN;<uotlD>)#pXg|
zsW*0OhpoP#3+Ur_dOI{ncu^g8(aJU3&HhRMpd|{8r{!xj?rBfNNyKzA5_x#KlX|1q
z7aA1b`^tsgY?zfhXx5GOA0$CmvLdL?mX_#eK*V@oG)Q7nDw$$J3^8t0_>qYgLD7wm
zH|Ap3M*DtE^IsFYA9c@cDtO8cFi{&n35e84q5N{j=Nz(SbSrROW@l&Y#zQa@y!#4+
z(FhZWGWEuncP_85x@oVKI-p?ryv5!zTk-_D%j2vI8O|C!>t$P8g+^yL7v=v=`+(x{
zPkD|rYSKNw$&N9J1n0z58mKcq7gS>8b4-Z;%S4jdRU#NrRigZE-w9^WMHz8O^D!*Y
z{AP}t4+OAm*(r-9*n+)_5h0IWM7HE<*tKw+L81-XHXx)R!w_oBB0?WqWb$xqS+RmP
zIXK{Oq90`l>x^lA6Z%PU!#kcK=?yN6#MYE=%sEe};Lf;rLA<}SSVwQTg($yC;bu7m
z0LLyo5x)640M3V5F!LgDhae@1M9U#t-|;m^&&^-@V;A<$C<W0h7SEWXS2^Brn)Z8*
zTD{TTKF(R{GV6Gp%kP*WVNrMd!k5St+p<${6x_g+Egp{{BQ3$HbqHR-g2Ug*l?R?l
zAp!#?z8+hc6bOpXQsl+A@SdL2Zc`<~U*c`z6bqlhu!yqu{znwoZ0~lc)2N#5)%t9B
zaVf?YAw0d1m!%(9L1%sQGkd#Ek6j(4SO6HrC7+DrCYJ)70!7|9_P+6<*=9(5hOMCT
z4)}paBn!hMD|*r8_z`Y_;D@X1*cKs#;Tt)Po}5MS6`^;g9(+$`3MNm?Q|IDO)>C0?
zY@NMHyu#8-tjsp(d5=yxb<3jLh|YHD>fMbe;qAyy5l#zrlb!-44G*&s`Y40EqFF|s
zu0d!)=SI73QkmF*qBAMwQjht&RoA;-9nVH1xgO<xDcK!{W=1sGbOumy5Jk*W0A2og
zIGVW}riBz+l~%58c52pHTIGo`W^55)KmN!_0LE7Km}I+GX5k7h1rW4RWdOYp&psFO
zK#Wtg4kO!i;(K-9sbtlX0*&JcU$FQ&Wa{S+p`*Y;;qpUW{KvaOYdhWuv8RjPJj~{H
zKz8v2`axS0-cNBX3PX!`-!N?{JR?<4V@sf4JOq0rg52ZfFEy2}jL;^ZvkP~FI0=VE
z8KoOxyIg*=jD)O;Gk$)Q4?IYR`}%&090Ry&iHFm19^}p(l!6un=7`d6oRC%l|IBE%
z!2ENr5ySM9eBHTou6-v-IS1{cfmfo+s^K}yK<=J3AiV-8`7fnEm;71V07K?mu}xU&
zT9EZ_qmK;l1K^KBOv;qx&z0j@QanS3#|nCeDF1drey<qM7UGYJ@W%xBbH(>V!aFUx
zfuVpYNp9T51jn2thh|^Y6bTb6Fz@aX3SV-sgEHwjw=lf83S9Qn*Ng-i`#h{A6!2Ox
zv6RlP&j}{zR;63A{VpppUS+9k33;s{iV$ybYKs>z-K;09X{_?@$Ff@3<c3Adktkpz
z3?=NiLK?~<uuKG4_Q!bGGxDyz5nEe-gXEG)3I)uSHFbcn;(TRBK#vI1hrnU37q0~`
zUCi=SHJPQt!uv?UvZWE0@d}r^IEA=WE|65dk49?oCz)wb1XTeCq%BHgt{n)sEWE)o
zO3p2q)ns)<MbSuh=apQY`O~(#<0r2?GSUx5u=38vcvpt2U&e0TxaHyVQF8Gv$bZk}
z50jjf%TFEGiE|q_XNnZ1v2`4l{Quhc?!Vx3AO2(Vh~+=2;}QR_N~x0c|0=D&eZhbH
zE+1Hx5EB(~{e2PD2IrNIW5Ca>VUsU39HzZ6VzEK+BUEUa5@s0zE~`L@Xz;^vYo$>E
z?lM9ry6{{bT7yJKx>yyxrfV1?(4;rh+NhQ>8#OQWT!bdU&*rA+V=zf{@zpassq|aw
zZLG8SRCM%#-a$dz_7W)vqRi#Y-itUS=^hKMl%h*0B~!&9iKUg{Eec<S5d@ul%~{+D
z#|Uo`Z^S3ZrxC!-As+<<_m#m;QY|A&8^J?#`Qxks7URm1fUO5d&za65O{Iq@s4tc7
z>2UV=E(++;*dQ)G#-b{dWbY+x(DFll5qQEz+>jEHApRRtBs0EFMye6_dt`@#8CIyA
z6@^$Fgo1E*Cd^|?$e0P1S-2ND!<Uuu|H~&U{`16x{hG$~`(}Ud<mZv~|Ls~i8UL?T
zscgKg|KH=2<^TP2@lDJbgyTS$%lAP*cexL?%Vz3!&_IRem-0e1P9tx0mdgoui(+w=
zLvV@hfw%^QMv#wKwMrL5<x07-CLU071~R<;VWrpTuY7=i&Gt@rrFC%F+k?NIgOy&b
zUSH|qw^p~-{?IrnmrC;M27KLzjB`;QK~Ce%PI*H-p}5XiNtu{4m&0WP1$u$k%~3Br
z(@BjCwC}VxDo=9aC!KyznVraupP|cme8sp^x%J+Ilvhr8Nzunn4GjXllM6f~F9$j%
zUu8N0Bm}=x*a<SVEqo{+**<U#`^+r7CFqxVHSuxV9$Vw@D==16+<#b;hWii49ffsu
z@^qqbDyhKFKozC{o{&thCMlgGqfNsJ6Bo=zX_z_fd90cjdzEr>p6g!aSx<%@h$*Hi
z5~}U0JQX43Rrs3A_Q}YL*8|-v<fw`7N{|G;*z+4xK0%Jhqu`t$If!%9<FUp5N)^hC
zVTp|q`*DzJF4kCOHvXrZ;!wN>oEWL}QsW^!8cAg<7wbjHj`)$2iX1AtFo>n|*^wR6
znQyvXyZ}5@Bj@}`0`ye18@KSP_Xn(GkkQ6C4*{A>n^lSMTb#6HzK~>;!WbK=q(Xtn
z&P74N#qUal6bi%WnzZm_rz92v2@05=Hm^3-xl3Q4jV1Or!mpm%iOE>u7ws2I>`@xb
zzae$mNS(p@bD^A0XCd?-+l|KYBnr>HDJTaKp2Xs5eu3;$?gSwT>Q&6@OsoTuE{S%4
z{;@D=RWizBtw0)t`K0J5v2nwv3V<RQ1vkK#3A_$W!tpxFgE)WjU@M8_{GrScms(hq
z_eZKiIzk>Kg_tB-ywUSCS*`J^W5viysM}a*BpEaA39VL{|4PzIF6S+^B`|QDmFT7F
zw79$z`~=+-U*;xY3C*>m1bq}Y%dD~`3i||ssBNJy#Ag~k)q66L;ZERLaWc+z$r)?Z
zk${1)ekfE*5&I#s5>UGM5sMvfdTPeV;iAS2lF$~araQ?vl4KM!>rN6V&k(+=%H2C@
zPbVrx^ENc{$v|;4j6b!U6Q!9(l6|6`@VUhfn}@E-=qU2g(^OPjOz1!{MJE~|OxcuG
zij`ss{;tDcwVsQY2FK8fA%@^c>t9NRGT{mEW?cWuQ`2SUDw7g=+mzN)qHi10-6-TJ
z$(oWK1`5GOc;uqbiy5mbc4Z5{7im|uXvR}Qq4Mg8EO7W48Oz#pDapcnCHD8EVev>(
zyw0qw;-JSLM;P&%@9T;tiKOowYM=CW6V!#Ql44ORsOS5-0c6u7uVux_o+D9(Nh1Kc
z6O36xjrXGy$Z;Z71_?&<h>9>DaJt#?>~SKI56lV~)=A@EQHyAmY>g;2-MxtuMxKr)
ziRcu(X<tZRwZE_}5Izz&2hv^RIMEXN#S~k?#6StcWX%3zpm&7liMImA<I7J{kkQJ6
zrNGK_SK!<~PvTTbRRqh3ujgO*RHCD*L{V}MWR#|+$2S!y=TAm~N^yF)z@&(_K7|1c
znjD5I;gy>^4;nBf8Br*{oLN2Rb8q}F#CiKZ@xRvA)+@>QUvDZe_<!H!BjbOG;m(Zz
z^-qNUI^Ze=w@vBo)ylA>TuGEw6%Gt!NKtw`V-TmvJDZK@(qRHi&gtx&oFpf>1&pR1
zdIk~HlPBy?$q+2iOD0--jGSu`6LH_cV0>J|fl_+Ew|98kczj1#K*-sHOlIB0!W-cl
z0vc{4qKknf9C^Z^N_ZDIR39if{N7u>FR~7<n>W6QJcZr9a&83_DmRb<nTejjJRF)C
za!kg|S~MQv@EN~d{~V(o;CPy0$$IeH3`@okl&ZXKahV$aFMHS8oi@^>zw1}@OJ+9U
z2>B8xv+Klp4+au5gY7Kf@#Z)_wh#gogTzP>CzJTUZ#`Arx?oS7+jwSYtq+OOrMjvw
zb?fRXwJqKYC-g7)HF+mSm4&2yf8~C~0UZuB<qsdvKc<}c?Oe(X#18)Wclo@q^`f6{
zqk48+*apKzLX^HN?hSEz$!*nODz>&TGn}#iPN*v5>4WpimwpkW&=sMU+cKFX1@w?L
z<vQeI2co{b)Fge1$N$<^YlZt?N5E$j0VGe^1S_B0Yj$<L;=GB1uv~imZf(6(S=u%X
z2Y*N{&8q8(O*}Uq{7tAOBu}S4vN$G$5h`}MG6z$dH@<}C-~W*4-~UEL|Nd3OoBR8o
zv4K9EUm`&3-UmRwEL|b!GGzi%Gp|?z4#761R0l6v#d2``6an5PYtYYX!tw33k}d?N
zIXrZ4=I^FVw9&-xec%#s^uLsbYwT>HGF<<X0LTe4uvL7D`xz74G6mjrbvIMmEh`A8
zwt&?$HRx9^@5;Y_`npE{8`F}B;Zlx9-=_%3m)HMz{OG5(yZR5eaosTf&M276X396T
zafAMkr_1}lj~?CW|F?3jprY6vkNkgo-LU@0lSy?HE@qQxUggZjU*i(EVf{Z^`)Pf-
z{>$cF{{P##?kNm0iX~rb{I75R8OA@`^QOiNG(yxqVN+diija*Sqp%8$>#6%Ln39o9
zI7Ts&brOJVw|y6rwH=L+nIM2mJ4;|mHoa@|b)y9nH!veh6p1sX&V^cV3OhZ?zscCn
z=K<FMJwU?0IqISH9>cx}LKpR?ZIg=nl*u_!GdI8?S5vHJjmCfomW?($%dwfvd{3&{
zBy)czy?8&qZw~iJUqpSJZIUe?&?yQyzwq0_j{~0zpWaV=e{f%NZ}t6L2^Q2`c`pTG
z;Qruafv)VMr5ix>J>!%w-2xv4pD-IPLawi>Mhlk+nESr2+Ca94ZdLF_zCNxR<G*vg
zxjBk%O6$lL0h1vKuefkE*O19tMVdlFE}HXczC~#KJ{ek^y&wlmm33NKE{KiO6nv;k
z`(@aV#JLhZzv77BWD%bF?}+pOFO*{&B-k`MHpaj>NCy6-e4p0PeYp`RV_?Y%zJz`s
zYrj8z1%C&zJoE_ve3nI1=q(%dlqWzg1~>IArH~9X2ZOb|K}oOwv6&gbLP{Qh68@{Q
z{He6`^eO%>8pP^B-dB@tQ^wA0=ne+b3AO=|0d{A!(%-SAJsWx`?vU><ZZ?MhN#3hw
z5wbL-r}BvU2-pr+=;vzog6Uzx_BgQh>(WEUB-XEpiHkv%(nhEHei`)~{CSd&sx8ke
zSG{6<$4t*{voBj-a~wwlsc7$5ka@@S`^Uiv=wF^s!O~>H)$KK!osO<t-=(JReF!c~
zIg8zZTsz_BPBE!Zc_Zn=N9uf=|I9E549ReUY*BlKK?P^prmv2d$}mtr^6m8#$L%MD
zN9FZTQd}I<jQ(TB>jcgNLJ3cwUi-8F=(6z3I5vPZ+y(^XvJh8aq}6>p`dnJovX|$E
zVa<Q~;Cd=QK?lBC-Bud>H<8#+{#q)p%#J^e(p*sD7oZO4_8&~eD=&W<r6P4#4gkb1
z9Qvih@I1s>2#xx^5AsKzw9rIYF;5~g;XQNohVs9*)n;xxn`{1VsViEzda4=NGxe0#
zH2n)M@=TTK$48nHA7y5Iq;9Jewz$#e5)0HGKXILD2Vd^TM*hb`{*k<&R_;v3f5!D0
z_MaFB-_XWQ^*`5_>pyI)Z9cw>|G$;%FR}mXoUDQ^ATE-Wv*GkPfubb`NCkUCAx0(n
zCS$Fr+!geA(cwiO=L~XM8D}+gN#nj=IfqjJwaWRQtdh%HpH|9AdT7nNY_#%9D(bIM
z%k}$OH8*lJxKwWw5`hBZQg(6p+shwIEQ$W=$$xiU$N&3_U^1vmdYmfB`hGM?zUd6u
zjr@OO+5fkWErC1!e+w5eatt@ZHhH9#xXFh4v}oYz`&=bQXK5r3ewaq$jHGHJLS<st
zL*#l$9C{?le^QT&8u<OiXoMogkQEuAPY4Mkiar^JWM6;i%#kW%!+|=EW`1ZIl(M5l
z5m(6}8(x_F2ZU%R>W86Z<2!*GUR^iAjKzAMx>p_?*Q&pBzVTzVa`K>Tey&trmoIgY
zeHATTTjbMV@B{skMlt45JDzZaQFRdpzmWj?LEqQ42uo&YNIH3QA?~?$zIESE0VU~S
z9A6*5hUei!RuYsRrO*nIvmaiUaQ}75E-ykH81ShxqHt8f-Ag;IKvw#&f7ou@YnNu9
z|ME%6viN8XI`EFC|KGZ<;s0I~$BWtgG#>OF?|Zay1OMM30kFLP|I@}@{kL1WR##My
z>#3*vF-UAAGXT37oyLx6^Z7F*SsrXW=3katNg?$8vHLcNBoUv_B_)Hme&{Epv8xrl
zdBx0ld@Xaw>$=iRG@M_!a@rs^$Bp%#$-}BQagp{Q&;QlRs%70XDGi?{^Fa_f<7c^B
zLob|9ino&Y$tqau(%t!B67-Arh%eLa;yvj5xMKxmq#z=_j6d9X<e|PXO|q30MEY0E
zApv3DT>KaRNLmMcG91tc@4bniJh6-fDgzGW(!)wlo(y>}Ygm?(uD0<PJ;jLOl+iQw
zQ~*7D9hNFj3i0#hb$vshW=&!mt}=)ygTq(!Q^DK-grA;hI9@-|PZ>Jy&ZD5rk2X&9
zmn2QM6{K(3d~F|`b{a<={Tx&c`5<t0Jx|n(4a0H?pMC;qZUP-gK<xj(9~IqQEY!<_
zTD6)7ok}*Qs=pW>KioKZa`iC;A1ORT@%3}ZRDR@{k<3qFduHEYz&O97j%IzJ-+s7W
zeCN%R?Bpqwp7I-5nNJkXlbG-6*MkQY#_J8_b{S|^1YibjlKB2Ph!zCxZnOEzX}8(S
zy`rZ@=_r<jEk7dPAs3698?t_!END*HY1_7bkb}aH&=4VHoA(O+uTS-@p*rqg&B^Yr
zuel2HpG${-|2Don{%>>b;a&XStz1{fztgNW_L|Og@ZH+@wEnlgw)xXi{+IPf57+PF
ze{SXK6$*@*4D3kMHZe&}eVD9%=mma)hz-x5nd)80?b7!+#>2`A2BxLW`V!bdava%r
zaR!q!2$OBTLb}k;{*)Styp<I`th|WT)Sm(ez6({*mbeWRg!5+;*ONdEG|kP*=kPah
z0l|DxOcWd((|4mN8kpb}6b_Q(I-mi^I&etW9c6B2qqjPub0X<U6mo1xq82k!Z9$Zr
z>kV|FJ*a$4%{btdB*ZY)!(rf|pkE!OVE~1Yj&*5Y?Rf^8COV~WGM>=e_Lbx(KwE~R
z>mwP7KQSNAIJeg@9|mMv_Pt1_f<~HU9?G}=goXoMF!y6l;G7*)manO+qa=`Ob4i3G
z(r*wcr0GW(4)rUtPNU8<D2J;fjDo}$+Fhkf?fLmpGuUPr^m9=^?qWWc*e;EP#@AH!
za}z#ROr*NH@G}QGaY<>;Q98JS)WQ{X+6z}ba@HkkX&Qu_)*QiAiTJpDZ$XO9dtF%1
z<h9mg#Sv51Zgj!vQFRYwRhaWD!`j~7wk$KJt!lNJ{bEwMkhLkBY*66nD7<q)lYn!u
zn~jfbL@X)bin(2wt&?aJc#b0M5V$30&W64_#|gExBlY2IB#w2tNLMzIFjgk>D_m$O
ztu>I+ioQxw*XdPs_?6@V@&}eX0++~D^-LDtSO8abteRIS-kqR6p|;p~ZUubE&T@5z
zTFyJ}C-cm#yPj-0+wHlbnO!NW7SGeH#x=p<RCpxQwk(UweorxKfc?ghmphcdK^U6K
zvpmn!;JeVj$iC32tLCv!EB~RRnu9<F3+Lk5QfBUz(IIhdDTj4+#2!moCI$xuS(kPP
zgtvse$pqmytCBP#9f+_vK%UNTZW0dwR5X)h=P3o|W8Iv@JUZ#QO1(t}?(MN99hoDF
zfOe%RolrNeZrYEdb6+aD7E8f~>43T+g9JF_s>+y*tS_Fy^olPl;=(r_khV>h2}DSu
z;Hm&gXDQ)l1{Iq1>H8AZ$uH^-oQ$f!EnJe}(=**cwt=cRC9$q}j5II==^>|wM}Zdl
zvFW5StDGPmt5rA(92R_F-b0=hv!we3mncHiX^yo@L?WC0gf<D&LS7E!_0ST~XAVw`
z1>K`hqnauWh7F~ZiVK@7DGPcmX?0Cy;&Fe#Ke%<n@eK9C*Lclvqo%rm7NJ(LihPb=
znq~Hg7=4)GhE-yV|L9EnNmk8DO8+>Wx?UV5&e#dUGdp)$mnI7e#ta7P>>gnck@9nM
zuhwoK)K8yxYA;TATl>8;$9hbS7Wifwh<f(MKOOn=Q=$EIOkAd1IWu`N&XPF8!tu@=
z^@=zWyc#a{Fnl#8zATI{<;&T+Cc(km(LZ0q8B{V3ki`_hc%JYCkfj~_x*P;?e$R{I
zfh5{VIZY-tLXpvlt+_Ji(~*TSu(LHP9FeszW`UAH9x4dkS&oSw=2?!+CA7~UqO)l-
zPlE|*#D-<$78Ta2s5v6v^bhDS`W$zot8}Iyt?byc9!#)t$`1{6ot}n=BcCFW<eCN^
z=qlkHob17$;kgr*-I*q|8zjU_@PPCgqXf-;4W8aTr~h=5tYwT1aD<3oAWU1-S?*Jw
z!s)uqDLz1D@HWul)oD>*W;`BssfZZ~Zs1Wz%mTXHG*^4sGUKNMn-Ls6ozV&fd>KQ|
zTSAD5iU_fk&$yz?2cxHrKB>FUbeJv-ob{+K_c5axz*RFyXw^888)vT(^6WHyO;O9_
z@NdW3G-Qz?A@x%jlT=~V6T7IhvO3Kb$Po34q8r3;102%lB2jN4_;q$C3}?OF;#4#=
z!YBnLt7`%d*ftubOuO_ai!P!L0pLbG&-6eJNjIaH%gQ`wclSh4u{zldb_t&_Q`B+`
zAXRZ$CC*I>UN!?>yH?5<uV@?T=bx``WS<oD4U5!S>4YQ6^lQ{x^naL}tR$)?ZpfZa
z(~-H(m+F{CqV!4gI0s}cM`bvG1@38;GTBP`9+`+_K4dy({!4U(=g!=|8Ap1H@nfY!
zrVh(Ynm?f;5*MSft@BYyej|)&L^CakCc(gFef5Hc7ZTEAsINhuIh{s<I;k7wI2$1V
z1lfc$Y*z3#W&~XIFnT!`1U6?=OV+hyzRUC(EDEWxV8FPXoKp@%K<HoizI0L+tz_5^
z;Z-+7kuCsQL!eqqtyHj@uVJtnsHs(_hn#x`R<lWf$g?h0Lh~jE_&VDd`BNKOm5*g4
zUexP6C66>>z-LKx=!uA27$V4IG7~jiS6z2)MuagjGh1p)osnI3>b*&#(1}RY^G{KT
zvfth`84*W3r#svX-|Po?gLzlaWSw#|>ungk!}L6x3?h=_w&caz{ICDqVkVFksXuEU
z)=s;v7yGr|VW)Y#c5)`_FP3UCO`4Rc6B5~X&N)CNJsO87SpN)%_f`Mjco37KL;@9i
zdEdnw{1xZFA3xr>^Z(w)b<_B_TlMCCw~152U){zH`~REkkC)@Wa3=K5|9cx3^T&v*
z{)r1IGtK4x1!+{+Mua*|BJV{oQ9VB-5wI7KDoYyT4(WP+ERuT9ozK;g3o&Pm9lckt
z#lvjTp9CJsa0p#n>xL5uUsB!X)_6XjZLO|y6=Jek<&a+DMDb`<zLXDFfA`~Pb=_H8
zwXEmF){%lS5htk0)^stBNTW)|63!5Exg%1tvS6{&PPb7q;R06dLh~0{n7vcLmJ34H
z*Q88t&|iq%3{40!l77G~2K(98YSO@$5=SY(f~TE+tiZ5Y$^7MM!<jCbCQ&a-UrgX7
zCJ7#Ev7V%XZyVLRL_xIWi;B1`ECV2|Q!?-osFzDnX^eh$S{XG=dzAImm`B!iqX%UP
zS^|(l4Q*Xeu;@sY=0|)W6j~EQs<FqHq-gbfUe?Nr+VMw$t}Qd<LB7&6B_1_Lt*ls9
zJ`%;_NR$m5|30)O_}xtRYhK)3S^?L;k}U{J)g}|g&#}rl3(kOgK(x_pO0icv;RUHx
zF5Kw{q24=~Ci+}(6r1=;tKe$2P0rRSR_!30U#az&O)unb4a8Z9kEZ^d^hm|#OCBj+
zTsZ|$4EorI+MJt1UfKaP(WtX+4ieyr&+&$^lXDH~GM#z7H}QxWOnuA@wQ&^-YAx3h
z1`8r^u<-mp1rcNQ3?grl>cSEv9}ZS=et{Xslon4++If=oc52V%NdR5F-Bwq151#jq
zYMrK{zh8C^er+|H4Yl)%9ya+DMW^**x2JXw+KpzXt7`iVy1U=&v~~`A2Xv!U>(ZAc
zi=Wi?Unx|fZg#usprcxQFWW7GM&LWO{a&ltwN-1s-ac%gYJwsNYX6|8+O54-k6!B?
z*l5+d<~w!pT<tYG^<DZ|+iA61y;t1e^Hy&kjXkH<YU*XJ(`(fa+qI5*dDwY*&?Q))
ztkLS$+qKqSv*A$t)TV0w+T8CUrBl0oEup}^K;{mCYPV2(Q`#az8?8>W-UCJ1Uv=s|
z!mw?t?#pJqg+H4A(<E|gomVyiwE(r-{O?10i=L`RZLju%$SdE_Ei^E7vJ>`z^}%yX
zbq{yCy;kqA*HkYK4jSCs-Dc-k(viAPRQsUIJ$Be_+6r~Y(KKLCchO_|d*`s*LdQ{G
z@AsOW&f&{m>tMe^)E`mT5bZVkw!vL|u+P*|FCBDV0V=wIN5ED`yG^=J1HErach%4h
zUFx=aFaI93*h49(j7+uPe9>;bXztgWczOUZN3AaECDl5uF5YNK!$&o0^$=w9ND*H0
zXKw1+Jf5ocT-6%CwtzVL2yfFI=(hBHp|84!^<CZP&OgIy`sZ9X>Hps&8sw(@Pd`20
zSl0j7H}B4W+{(2(h<D9kpL*);nzK%N^_S{pmL=O`*mBB3NK~@ub1H1nCGXeo=bfs%
zB%f8|edta}rR?x-UwOCDsi+j6tkg3cWyd2DsEfWsituV4>(wF&CuJBB30V=J_kIPg
zoYV@^S}cM}&I${G-AYTh#%H1f^KEw?5h3*2-`rwyisOIN`qw8q|3v$L{n6v~wJY}j
z!@Ko=D_31l95P;b=BTzmLeLT|2FrrEOLImYh5;6?tE)NHNhtJMze0c8+atw_{wKAs
zQ-d-CeHLm|O|@%Bq$qawSe<DcH08e5bs0{(`GS-&qd+-O7)A919HVVCNCjgBECs>M
zHwi2Qsr5+5*>Aq8q6{Xz)@imGk?wBmrE?Wk-F}yWGXT^Q>g);ftaU-Tu99-Cc52;L
z_Zk>`wO<&OoTki>Iz&&0)vRTeDJ23b89ghs*-=LaonHh*Y6_5I);!!No!FNC)4Fsw
z)9+X#HkvHy{)g=zntt9n*ke#%gG1UrLr8JJo(kLpyunVa`{g2@aVaJ6&53)#=HV1+
zS>G(;AQ=Rn7*_Lfj13-~0OYjZQH+y@3*waST<_K*ii2!t|D88kBr*?;=_a8{lGdps
zW^-A>0I)ejmRdzEW|7{M!Zb##16&f2I=?L#*Nf1P%SlC*`S2SDc}*r@w5r6<N)@2)
z!nqTSkfTciSE8Y%W75XK%vgFZ2XOS^9bs?;MwO1}^%7)A-H+KCX0S=>dx9D6hO+BJ
ztUU;STkw-H&dX_M0Pnj45Ql3B)8`J>cB-}>B}~B8sjIlp4coVsx0uWqG2u_hS_y(j
z<{X0sa;V=*dU+GQsTV*?7Kx>r1SA38>lhw6v^n(M*uw57Y+J?lFgF^6Lu~QOY~aJf
zJPx)vArRUXdJ*BziO|p^9QnhDAg~d>jdZ(MNaIc7VeDgj&xIP1B-pB!z#(nxW3N1k
z5GcfhJmlj=?@do}Fb(2M&`XAZNiYrc<`w$Pk9q&heBogBqK{?3kb^z#Yu`v;!xcGg
zTr`ykB|>cA6C}(WM%$9!_cKqzB4)RMcqZmr<GFscR5n_slcFplDE4OyO#|H>0fHYF
zTnZ)@H;82p1)(*QigdjAOpO|I7>lFz2pJv~>`FeD&*hEGqhY#9a_~ijx5V+;g*ie)
zV9D;jYpBdQ|KNC~u8LFqvFYfCiFQ-*BqSuF&~lR`qS4_=4ymJ)%rQY_cGuR1!yukw
z#oA_Yu*1j^KQy5cyb-Hp>{}cHA)^X(KFLqCa|g}X>TNV35%0#qglL)&NwP9$@NWVq
z-74b*Sh9YwBc09T^ab(d2J^(C@k(8GNDegd2P0pCP!iyb&i)J}t+ZXVG4);caZ0eq
z9AT&fHDS>$2kw}3LYnzw#%ml2QTar34vB7VYKlODOam8!01_*u@1q*koTECR<az~&
zCK(@x5zyU!B-O(-6E79ow~Fl(Grg%hIF8KbAYmOoYVlHMrP(gJ^5D)?fg>RX3=(CN
zjLVQF^T3_W?c5OBW{aP1lBWG$oQKRp79o7BdjESKyJ0fnY>(VyPb?KsOVbDoJN5I<
zMO8Pk@J7stc!6lrtIh-#;NBA}03?}U|I6N&z`0eGix*swsLu_-hbXt{GRZW_EN!QB
zrZYI5N!x+xOqrzxN=fe|H#2FI+>o1eI?#gq0uMn&eTw_OfhdB@dxGd+5q*M)@^C>>
zTp#)rS5T1u_kCx%=iDX9w1CSaKj<X)p5;5=Ip;gyeuQ^&r3zaxyC7Pwu=7Tq3Tz{_
zp{p8Z&b0Xrlz90nMqZ+`av>|cF(thFQnEcZowTU9b8o$zHw%2z)(Rr0W))UhHK&|f
z96xaEk~;<8CNA-1cXXIllcla&6Ek58(*cg5WPuRy-A(xzky5}+I93S|$9}p;NSz&$
zcrZtJsGU2yeSkxGWQ)Z|j>=>=vFV<t0y&DZ)jdqs8RSCN_jIi9NDpz*l{KBNSM3U3
zmAcKW!f{E*A30&<`B70XXA5*HbajDTSA~AM*01j|IEzBNGs463*hm?{6d-ca%0R)h
zjSUwTi|&cR+CU<0*?INc!#W67j%_^{Df&FwnlB#?pEZyZgN^smHr$6xj?sSZ1DL>z
zNMO-Xs02}O5L2BBD$d>Atn+xRX~yWykQj>=4IrVgZ;*-rvq+~Ko?{Dayy{5#9BRXL
z#882Dp@)izvPjC9V#|!3h_G1sVc?oQW)>KUVBY2IY&Z8YQ(XiRr-KE2Ha}sIB3rOu
zZRm&mrt<Y7{!v)DM5F+y*k@-Y(*$!b3<|{8&LfyOqciYU9-9t%0OiQjsEA7?B07bQ
z+mPxJruZR=UR{hEBUf>>Z8^xOiQO_kXVEmmVPmj#bZ8^xndxHgdZD}LXyE|AY5_c^
z6Uo<!k@2-}$oAt2_1J{=;<V|C=qp&QqU9LFA!rHA7m!ZJ3Q$A@42f*MIpIdGMhp2C
zN`x&G6=)71Mc~k!lXq2|y5XQ;dROk83%#-mkrJ?*(67onmg{)C2xGD<1+o8Pg?(`^
zd#P}rF!il5ns~P03StDtu5t#Ft#ip;G3JIXYCQVnB1AW6X5D2kB?f1Jp63g6z@ror
zVRxhmD#V$3bSyKgv+@cgvO`%lmU<M+D(eneM~BG`f?_y)(R1E{kz`7v3`C8?<II`d
z*MG)Rh<}9b3$_x0Tx1J$mtX?r3=F#xydUmULC-m|8S!CU49q<eAC`@VEj%0t90Zh^
zphh{33wZBRd5^syMkQAzKW-T|fV*T~i$GUQ&af!s$BXyygbWgKf#$4E!4E<zw;vmu
zVBj<8p=L}nS3z1SN*tClWB3ZzF!H!F=r5X^6^t5T7l><th&3<?B2j`k0X*cXHfM20
zP{scY*IA-5SxmIdnC&Hr++UIG`RIEN>~715K&NQI+6xXmA~|q5X3Etd#_6S~<OD#R
z0~5z-#8xiCcoz&Evlq-_Z6TSbxB+y>B_=BmA_U-pJ#lC<P>PU`r1n6i%a)%mOK${(
zU_WkC_#Q@qBjK__2+=b_h+brIM9&B#dXdEvJtLIpMHWf){L*z~(L~SCh+ZTr+%e+J
zRa@*Xxvq1Tg?_f~zAzoJ!7%2J$%$}e5d!sHt;%YlyHs?@haF+t)Huv-N(>fugSrM@
z6Ipn@GO^??1?A;TE<si;)Y<3QG%27axV*>caMn~-uh?QH{dT-Uv5d>Yl`EG%5nW9X
zWj&J=9>k4A0`>ytvcN@%;ZIeTT)h#aLb^3Z&q*Xkj#3dDm?#eITLn4|XpoF|!{qd~
zvRxxh2=|&4;LR065QJgr*MX9-VWx~R8%a#gqKE}tuO?A6&fLyfMSWeNyh*HGPO^6J
zmE}(nydA#dgof6P8>k})9y^}U9gKUGq$0+Qa`xNkr0po$1}Dh_I~Z3`wq1uSJ~}S%
z&Eu^DW#M^`a{&||Z$pH$w^|mW6+<#dUxN7Uf*c04SSJrP74#<RHLY9bYg4Epbw;u<
z2X9zF0P@m>8m)cWbhI4{**eA>apFJ(ooB*v)r<)dpkvNBbj>4IOEO}|_=cQ?$VGaV
z1wsgtazY@5I00eUtEz3VJ0)C>*{(7dIansh{j(E>sJty(3Y0jw!ZL^?z}#k)xfQNO
z<O5bg1sOvPVI*6$OjT7P^mJUhcQ_CjQDrW0)s(81;sm_zSV8ik^cEw%fSf#{i$Z(Q
zs=AEb^u3AcITI}o&z=z~3p$A`WHw=2vrIxz7X1ek5}|Baa|B3z3XfFHD??R;bPifh
zLAV>-%%!NT)WUHx>9c`}E3H|2JXoU~%gT<WrZB|-?8RK2(RUjdlUXx}w7KqQq?4;E
zU~`cFR`$PU_Fs?1`;hu*Z2w);wWfQWH~(kPy0wqle;<ucM>{2C^Gq{7Qd}5x$AuQ$
z6tKR>Q^8ogZ#T;ohrA(oJryFb1}zI3WC476Yu*@Izn+K*g%trg5$On!mBaRgJp`3u
zHK2>N4)`-;+eOY?QS8t@Aj3q!a~6=ZDo;zwlgj1Gc$3JM;fc(ak;$p?%@c!LGg~4e
zMA`G)=<?>FEBo`yVfVg=EMZ-Q=ZVwC963)Ui|bjFfs@#thXW~t`qI4!b%vtY`?NB1
zKtLN6THT#Njc=irDVekI2cXd3VQMtOW4V@Lf%lH5Kz$}NQ_t?TY8hZ`^BIyaLt6_f
ztV666DVfgR(E55+dK>tL8Z8ydLD&HaEeIcF%o|fIoC`-5yJIE8lBBUxIlGQa1Qr`t
zux4nX=uHp|P6o5PX+6@_MF9}D^BR4TgMGBvaIIxB*$POw_<w}O)fv&DsBvCo8ER+p
zkqF<$gDiE9#cf0^oer()0?H%e&S`zO^L;j4msU?oXuyvrcc0Bzf`5dm$Lzl36JD~o
zegjpZ*bc}tb`iA^B@><08Ou;8<F#IB1SnZG#@k}L5)r4*f~#xQLUu15wJf19PXuJ8
z1Q~E)abq+kA)+G}M@G45`Ji4vU50EBMp`hoo$k02R%iAOV@r{&QEC#V?La!IVokIj
zvb7B69Z{V<yw(Hu9cvj=>EIjyYYWnxYY7HS%7%dbOIghN#RY$8*v6|>SVLqk0UB2T
zEC_ulOTkfKLbwc$1(wQ4r)E=7UdfR`#n2cjC@WhUjvHO#&Y5VE@#i&53CIOjje=k?
zbwaK%TR=0Uu@#PHY!<8VK1DDr3wU13RV1kSiK{5%>vNo4CMQ=N#R8cXW~ncVG%X&a
zi<E|x$C~Lw6GnPuZ2RCS-Ju-3k^tu$04lEUfp+|}X2_DjgHw1u-(eJ+i=j8{&bRc~
z_}27R?2G5Mf!6XSX5C>25GIqvWsZ9~*1|E6Xyq7?g@Trw5Dfk2P<uPaHKyL=G-y-R
z^3flb9y*lth<)VQ<Z9XzYJnkuB6H<Nj|IYI%qb8Z5>+&0b{sNBDuysj_D}>aVOB6s
zG!tEkP}~OM)I}V}K@KH)wj_}~5e@5;PAekTY%)V9viT$moK0Bhxoax30h55NnUOTC
zQUwK`y8fPVg-Hdeg&H55Cxs1^VisK20;LcvwAoduce;=e=o!49p#<{`f&|exI%?SD
zRBiN*VwtSiB583^v2IWqj3eR|l?6ucTUcP5t(v;FwBxhkdXM57i^AbRxn5NIgFu@l
z($J%C9cx%5iu3cp7#M{KUI~8eKf?gV<TtD`rLApYEE5*yq;Vw4<uboAK}5%^6xm3J
zjXVyRAA&rMOwzWnR7mW2FnLBSKW%jHw=`=m_fAG1O0m}*Z|oI=WxF_IF?SF@VqD%?
z!E)X#;yPthCFwJr*;N<bu=AZMH8C3n@gaye(xSDqTVtg1jBQ~OG1#iYlB|ue2}wwT
zO~w8}=4S`>OaQ7~GuL>NjOcSRT^+^f7A-d+me6TgW|dqB%MOeQC@!{4SAb%MG*V@{
zc{Esz9VPcb?Kx2GVVj(UONISJrX8ud0Ty7+7Wwz^4UO4GePfbA$QyC~d6yfHQaJQg
z$83i5)>-V*V=3Z;R^Op5JsSBVLLFFXHr6reB+y3H+nhzsH0mh-7BlU%ILGc!8ty;X
zls`sr{)t!c;)qqVg&cZdvhaEUKTq<hbXqIRv}G(4AJi7}^!ITF>qoFFuc!)7Vi`$-
zw5xm`D60h8&aw+oX{5<vByf-sIB@+?pjF<E(lSptJjb)XRWXYtnt|;k6<}_`+`J=T
z<{Jg^FTI_iaZYlWI>JqjXQTQ6<#v;~Li6m(ZthERwzSP0_f0|-HV937S+a$Pf0Ow!
zG)2x<MRJp7`U)36Y*4Ado%T223dp6CpkE9->i)#R@7G5E*v5No<M}t<W5@OXF-mf%
zhxcI-lr}p0+h|{+26>P?!<dqY(#~=qX(wX(bZ)0?3m-?@-xY86&$mtvQBKhp%-`dB
zd5qRQw)|UI{)Z*xw6+Tdb2$-i;*OYG=-Tk#HpF%tE{rzC8fJ(kOgQ7Lfg3WRG70Dv
znXB5E@tmzr3<sne2H1LVr0tKFBIP~HX%3Z%TT_f;bEyz38+v7<%_S8wH?1#L8oZlm
zgpveS7F5(|D`raCPnDquj#yZ0n0*E<Ho08*<dSY9*eF9lJT{AeKeL#jixx8Ok&pq_
z9)3#pIwRQYSh&3uCp~<+TiefQZ7LPY6j8u1>NmD~=Dqvup4G`NLGm=B3Y1T^el@_l
zjuC($)@b>9?PDSaqD6>1A6{V1{fh$DJs5CbNWl(WQ?nRBSZuaPRc{2h60JbxC%-=1
z?G5ukcwrapbjGdNcq|FwnB-Q_hsPNlbcr>AJIPu53Z|M#AWYf2Nb{w?0~#9#4xx5x
zIe532nQ^$C)qJ>t<vuJLc=)Vk;D#+0(#9Bzd0W7RR8{dFkXa#RGi~H5Z5Qjp$I#e8
z8P20_ttf%V$uwIjz@Ap{=2gLfNQY?X8rx91Q~)8aLBxPF4@~BW#@@6}c}?!Jvrn*l
zbiqW`Qi{xAdUhMmgupT!^=-&AwIRw58C?pGC0MGem2ul>wpqkpGu^K<0px%kW@0dO
zafhQq${E&K4DR8j5P0vh{D++FebSvx8J>3sJyHnLsUhbn+;+L*vc*aE+BL=OW`(DP
z#IV4lM*ro&V>LSvdIfgFR4F@o>%|WR<?>{}o1U_BJQWRw4;swjjsr|X@J@;{-3rem
z>-fM|#>D!q@_Wc=I<fWhUQjFmsL<*_|3N<KX*nCjD8@Dv2B`Lij=}&XxKL_sfLfgK
zYgo-U^UR&tJk$vfY>Iq(TWE?rd8x3sDS0{{T2o3%#E){uJKV>ch?@g4ZKh~CwIC<u
zS|PjF!J5pI8dI5IsI}&!?6#Y!+0+$qtnf9Y5OY5E0w<P@$NQXP6OM9ZS2HMq@E*`5
z8gB**ZVnyo&8nv{hEMcEXG3D1+<lAgP%U4!_H)E#FuQ$~n0MNct(NnXosc2fvwS=p
zrSKqwmW{vH0dO*iqyoSM3dg{}J5Z%r!vrR^Y*pc<R8Mh>iE{s=BAM0}DlGg^4hb5Y
zc6cQV)mk8PRSPUVnD7>?s@!nSaxlt^Sbo`vpq)e+JecQLZ@B#!t~$`&(VS;nP<mf;
zr+WkA7#Fbp02h9$;Wpxw&5AQ;%Wz^q>MSO$Vk2NT#G>arM<`vNNuh%|rTySg0BoL-
zUwOw42}}$+!T5@BZxuXm)1F2h5Wp}l)SWCoZsv;3oMJ_|pnERTnCQB+pf2jAdXYkU
zyhE5$fMmmwM!rTc>m*KdboCzleL?=ujSFE&yjgBii0vUxCUY4?e!~JtNa;NgE*`$h
z7NkcJ;HB{j$>qT`K^5e2Exv>oWi-`be;O3CNukXO9F+Wx!$(19PORO?5JAaT;xSJH
zY+K?1rVx=4*vlr1#H#t}iO%^HYE`3cigZ<e-pA{*i}&I(OjAyth~}e9;~@|1Ko}eA
z*i->-ME3@l`!>(RHAxgv<|`EdhjPpwGDwML2m4}S_OP@;aEl_39wPZd4F`!8P@)`y
zp=wU{69F67%U>waPgi6b1_?PMUQ`KJ01qz<2imd3G3@Oq47V+V*BWx|S+fdXN<w6D
zf?&00A5rX*f`AVo5yTUzqvG3JUW2;7rpP_&K&9sd#_&+`KX#v>9Hx@8&^7n?!vaDG
zkWfpIiKvb1Al<H{{3Nnu$cQVI&M6uR!ZZ#ioPr{|gfV_rxh~>5heih{Cr5@D)`ljx
zM-EaBRFE>Tu#2{BRSfiCff$Nfk)5&{{Un87ohM3hFu@EeT*t(X%ZxQc4h2~QnJgp^
zh-2!PO(Ub}1RtpbtWLhBL~r5sOFqdql)AItiNs^8*a*827n`zK$X3l(Duj?hk2+uS
ziTwIv+^1MRDa%7gU7ejPyh3)yfk9iwB>k(vz~@?|>R`bbs`0^{5n~g5=K&}Q!@@W@
zn70NIWt4e><(x;wD=b-Ht1-lGWSlu&@)G29;}C{;#E}c49vY+^O_>TVj3#CXM1DJ;
zjizUgwt*G2B{Vd!?_ysgvEo-i@@PAp9cFrV5;B+tA<NAa)hHRAzn3rEfM2}%`w@tN
zra~bx&@3eRA3X-z7m|FC=`)yG#4KVimYSs_`fnX%s6*3kWb?DQ#N5*iC#(X?ScG(j
z+glgWysG4(fGRuh6B;t49Xl*l6mi&P+b@tDR;wXG&Y@~ar+K0W7B9!t%9t{cZjmmO
zxTb;KZ!d0$7K!G(4w`BV8*l=%>=v>dX$L5qYK_u9)u95M6?CaqfhCLv2<)PlS0s>_
zm9#8`Xn?Izpj$vp{XrQ>&;S0d({em&pJw@A#D&6#(?_%We^#&S@!tQjdUfYx`ClH5
z&*ao_e`Lqt#8|(P+yVPGGQMpJzK%PQ$V6sn)9B#l$$n#b42s3!4;I9~Pze7Fr#DV-
z#xJa39IA{C%R2mPJVM2w(OGJ9s2|D?VJ*=CtEW7cH6wcXtljHPRO9)bH6oEz7Rp7A
zrsko&WY#d2Z-D2RTdNE&swE?tH`-J7Kg$))hxJ)p{-^9A_0e$ucft1WT<gpK)brT=
zKaa{MF#i+zx&A%mf9mk$PAV2=TF9M*iDyExDXEVz(VoAUH#-xEVP#KMC_^?5O3x%8
zM?It|>UqU42!rRqRvE@J`WWKNGW<fiTKL1h(HHk6`wJ+6+DZW<;2Ue!@c*mUHvBz`
zE`w?tMr*Y-_zfc%^6=Wcf2CJH<e}qcy@ifD0Owxphd~~}w3w*Q_9TX~4#n>4O0Ifa
zIn~4@-kP~RK%yw+V87AH-{p<iTyh{RJC)H7CF33|1lK|+Jsf1pesA~C4f~rk8uY;}
z1qg|+ferrNwNXH`-mF*$>0gWcW&4{P@YHJ9eloCwh=K)Q`>T`|Kqyw{+qI)Plum=0
z<PK@ZdG8Xuo%D8BlMXqsKx_}EQ~wC&624_jZD8HF3KI!i(qflY0cxyb(%|umm%+Qh
zQI=sSbZkmpG<xgqGFJ7gW<)5d*jSa9t&CB4=>M&T%0?g$5OPJ%Tea+5re{rTWdkH6
zq#WO@1qC^7B@b>`JP5k|k~eLOIs`s)=tCyngVDy=mks*!l`FZ<e<_kL<7ED;S1Tna
zRA%gR+Z)iHds}cb{52feB2#2|ePNinI}?&-P`=jF4d!eQIrBAxRMVY646+n+CyR)s
zBFJ(l9s{iMfdc_8Zs-?75VhR?@iPOA+FsX$d{Cj&<Oy%YmMS1|-_DG+AM-uWT0Za+
z#!4RyVzCL(!||X@b{HPyynFB<N9$|s5gxhdMjg5POpg2@CEfCHV8nRve>fQOk@DEf
z(s|eym5b6!$ajZUTQF&dSet+O+t*h3K(`Iw3<TEpp4Sz7-m1#PY-oYgf;qf&f@dh~
zH@f=Vbrqw6_)}%us9<|Pwb_SlC6g-8#E*AYj#kq$SoQp#%vfgY<WOdNdLkY{z||K!
zM#g&9u*dkRRL$9viSU6~<N*E4Y%J6!vu1e$LlhlLltmV;<x0E?X;g)R)x$_L0}05I
z=yH@n+0VfZ<Rh}dgF+zcqA9fz#w#xi7%*1xjV-oPt?ZtG%V@Y-FKF8^1YsQ*FjjX<
zp4{+`-`gzKjeBQU0~=Tq(V)u`dn&jCw&x`zD~-<mLZ7;ce_RsQ1TMTwRdmYdNm*Jw
zt3eb{EA$z#ca*%T^UMO<Ew28SVVAg3Tom%=G8w!xv<7EDws>x_7~{BJT$=>rLEmaZ
z?v|T#T9wPf*)#y6J8Km%(<7j{XANK>WVP~B7TFAs!ESNmQm~|UPJ)<jmV{?9y|*B9
zBZxI!@xBl|DRmjH{E?=r9nocM12RQ>WQ`av6_3en5>uN2xIFa(p;Vm&TNQnRq4kbc
zzzcITB#fTS&4j=cPA4qJ1rF}&f^d~*t@Mi7f(Byfham5p3{Dst^A5i&ZlE{j%tm^=
z1?FyuvKATfUd0_!9TAd$DJ}#ww_$_Pd_nXDkD99uf`=&JV1>|MnH2yqyl7=BwSif?
zgE@sZ#g?yOXgLU5t2nS50XZY2+3;*5Kk`=j1`;HGGxIL`eY%@t5$mhfeIoW;+`mF`
zLYr(F0z7E5U}WlHkv<*w@agxH);V3i3_}I4>Z3NC%IH}0(K*4)>q-m>fL_~&LxG^h
zM{5}E&9ru&F~+!_YM_N(7>Cu|)f8*I#g*ZN9-E2dCJ5hjQc0&Z9-yG}Z{_|bdl^3-
zkUN8PZN9D4c+!Fw!NEt)A>;3O>8p)1{iKx>)E8HXufqZFq_JFh#>qh^Mz01zpE_qF
zV^e^kp%^<?Vt)2xl@}iG0p7?V|DS4p9>G<9D8500aQP9)0S%iIi8G`p&9~TGkfN|z
zxW*w(yil4qM2HJLk=BEU>kjp>pfR=>JmS&eW7b(z7YrChjTTZah`j;?pKal-gQue!
zP}36z8-`^0AR69av>p}Y!N{TeX1P0^u4$3u7MnHc9-4GvOTcqNm_5VpL(Qm4f7f^h
zKMMS0%+uwC^v)<SeY9dYG776!d9mdQ;giHuQ#r=;x6po|^`!uZ_kcKx^=|MJIE+>O
zzOL0eDq0HqD+DYEt%yI=y%(6?U8|!5L>&Z8jHjoAKGmsQl?r^=uNS)>y}slp@ZSJU
zh>Yp-sE0jl9-vzG8}AG2ER<;R>gtK2jwl4BK|@ot`M&KIGDJ_ckkR>I(Bbshzxo50
zR*(eFjw}ZVua%?H8M+sdBPK*);AKCW2}9D?nQKWh^|Ci*P=AQ1#Mv9*Q5xM`rH{g+
zbOkOdykFf$a-O!y8&n%`r`PB(y2CcOCZkI5RtfO*t<(t04gG2zy}ebdf(W`^hNeEu
z1|c4)t`a_{389S_E*PrSLVx6KQ@2BeTRnp7`z#U5ga?ZB?{FXa1}9tbSreMNsVJt9
zL#uBz>AxZVm71<aq9r$e{IufAua;}*&d&>myY%CyRlj==ukYRIVPP5kk}XadF$6Ay
z_fHpDC|btN$)O0uA<4<`7N-LTv~3!60T(M~tc5Q@uRSe<^wn;3qs=-PyCG~EyNOEM
z(tx<+Ku8z;4dY^{W)S@S;gK#>CoDH&e|U%uRc?8rprvlW53{Oubp~Fc#Lu|!MZ%OQ
zOcQOOG94y;HWp)1O!1asi31JCirw+Jinb=I_kLZC>3xmNK8WQFO7vn0l4jgaJyN(j
zzI@TPtNH)~XI>jk;BXj|Kp(XOn2T6<!icprdQ>np#TN3#fqlc78C(}lDux8jWeI|t
zNpih-0O}M%5QNxOt<CX((c|Oun(R{z!2Tu-R_Og+f#XfMlNB%~bv9fX2hr$<i`yrB
zQ!Qu5qn7Q|<-SKCAj|b53L$jz)8B|5O7EdC0_JI@VZfkYE9U$3H=GjLOb`if)J!OG
zZowqz-*e%HqEN-N58Vy)#D1e_0Gfg}dQf$5_aW8w?p*;Y_~VntG|4cmPNysz>W3Rp
z)_Ym3zum5sTe{Jxm5~RITG`|wBk<6IKwrtwu^)^C+(e0=zYp%xz0^>bGTrNS!)of}
z2ayzBR=KiOoG1Wnl?&=&jCcrU7I}Z<N*1U}ox(9z4LOLa`WeL1{V;+;_=r=?znukc
zg{}>x!!+ftiUeI}Xy@f&tMs{)6$?88=^|5I5h3-fXuSwRs061=b{tergTj640VH3w
ztQd!}Z!zGBZ6P&xiW{!~bW@^Rl}TxrK3?865`1blzRgt8?9Rnuh)2`d<Ti&s`4g%6
zQ8wr!duym)Pk)#fqB3PfHS7k`REu|X8toEo9;(*QDQpv^T!=anZ{x&1CGryn2q-bn
zHo>4OEn<P|_7`_Ir!oeP-$t8)nSvF<-|pSK4KzJowTN_w)LkN_Y9&PF;nUA}G$kI*
z$TGhNYp9|q(AzUCKFI@f5NwLer~WNen-kFZGH-K+Qns~*0w4;;kxvDr&QSQ!JhK)#
zysJq4+g-nRP*}7Q!kqPR+(g-=Q_)&$eIM%Gh#u{fo)%D&XQ4+5i@>7PLIH=e*H+|u
z@+h`eS87%3Kxe3p()a!by`{xNqXqiVWd&|)33<yNR`JA!c;OY74^(;Z#UpXu-~Zvc
zQ5JuzQ{>$*t<KcLab28#twHF<_T3Yt?CnJ0{RqwBJ)BFa4iW4C%5<pEKLS@Jc`R^r
ze+3A!s>+se*bS&WTV*XTVQkNTgAZ&7+9uNM765Bt2W+V-?Q3I@?(s=~gRB;L0Q7lk
z4FvS>Et6~k#&FzeZRt4Fn+V1w8?Q3zMQ+?j?%JV4UQzyy^4P*!<ib)=_(-oW)w}BO
zZaCr##*-eA()sB|K5<cxt4#~eUb>QH)D+hzVM%W2*Ap^QIp6Zq);+qm;AJj~(pN1b
zl=xIeb+~Q3_gk71F<Rm8(|BHZ>7c1u?6pOn$#^)fF8aSR#SK^%PB;CydHCl)5)c;|
zC@{Aq)%zVD!o3^<1YWml^Xf(mIt4%Qe1Hn@YM&lAioo9G3trtj;wII-GP)PvK{}RD
z$z1bVZF*^yq7>{DZk~E@v+r07bkT3*`sN9(_IlPX#wE2AJuGv+>o=g2&ah)X5M0e6
zcCJB`$Kl+V)iTjySFA{q#apTZE-mtpR}%B~t66$CU^d!Rr*X3Su$Mj5dyx22o06Dv
zHIA`ZEU?=SY?Lb`6)h;L3p-P5g<&|Tlfb6~Mi&4b^rlyOD@Z!5((AcHAl3}Ks~S*X
zR$?F!)-dWC7UmUl8nn1oysgC>6K$sdU)+6Thq5Xk-U(qFd8s-fVOS2BJDzGR%po5I
z4~hRK=;IULjs{b7YS9<B7q=~4HK*U*LbuHIyE7w9EBy7WWtXg4wUEs~!x@S1l)!lS
z9Q`fkf&&epqUo*mIS}|w5<2uP5rhGl?HG2_j$Ot1{Vk~$SQzJ=YAqJjqIYIJx)LG!
z9R8heEeCj*aXf4r6qxa!Ne^czRI4E<J|HB8JnX)M(^Gjgkh+4j0XT=AL#-J&N*t)>
zU>x!VKVHjM5YHCKafTVDG%ng(DuBsV%{@(;^{}Z8n>E6q)rJ&mNOBuH1SDu3gfy#G
zY844BK&uy1L=?S(E+;GtG|L%57}D5x9zMZ{lj(534=3dE2Yn6WBWWZMwgdLilh5v;
zzoQ0MOa%7gxwA?36cP_Y{giAd-n=9KI4}f3(flcR2|U%pHGFQ%dPtSB=Q+X>0bmH1
zkzfpPHicK|Q+t%Y&Hmt<R=W#h8ym$PdD>QaBK9QY05HPOrlw7XFa?qg3T7EXnhn$(
zdh;e(*4~VAZ=DiB+sblY+?4q8q0qWkdY`2W+Nzn_91PQYg<icvH}XJx{=A38;kD~`
z`824nO2q+S4)h0Y{Fe8LNFfuBTEZj<at%QAp^5JE3ct{Xjb0ttQc0LtcLxpxP03-7
z)g?;eKAi@OPEGeG?{4$k)`Bi(DqHg$jk03R)=8e{HQm_PAN)>SyczNm6G8^{=bIC=
zSQHF!vzvz0>qMnzS}^v=osj!>>C+H`JB}(JP0`n*lA`S4y1h-qKc?lH>+>BIuJK;R
z344z^mXp?Z4WoYEbT&LbJnse7>}>H6@K^RNq(((*wj%1Y65{SYcoDQpbRnw6#iQ{M
zq64vX4oVK&!z~AJj2?c=%ZsaQo?c}Uk#?SD3_o+|tJ^@4-CP6Ap<P5bh8p*%kJ8VL
zYwvW{*58fG-3B1d2Z+vlYhQFWIb<~QXX9>kHrxxsq0Wtps{pp#ztWU{z3a}m(llbL
zUhdf1ev!&Jt5iuC`h{9*bM7%r*KY+Ykkkvl+SQ9FVTZ3|TT<TRnbPhR4Lgy8)JaN3
zXivX(da?Fn`L$7_0KIE!_Z8NZ(Ofm|WeR+j`Vg*4W;$5vWn~s8hWN77a^0Fp@~Xic
zV@m#ZLqz3;93ZH{lzfoyBnlW6Wov-ZXfx3OfBL=OYChcN>hgxi{^H~pH9K$P*=}hZ
zx<V57nG)L&r*KG^0KhGuhoonPhqW7zD{+!~NIrh_iwKn-Wt60tZ3HRa7cyk;#`lgo
z?B>IEBjBd@#m)aJzMWu{O$kxxeq)=${g<n*gSS@*YyP*mKsS_a)LBxGV!i>5O?io$
z{Pe2?q)`iDbB**d_*L^ZLua4cDO#`Zp)snR!^dt0os&K(j9(jx7v^TzRV=aWoLQv{
zDOuzXW%MmKh)M~#c``In@G|zuaLRNwX5Pq%Z;@p@i}Ac!#cZsxO5Fj$!uu4EjsYya
z#+vo(d*W)AT(%Y&@Ejx<1K=UL!da19;Y7u8K3}M1=Zu&DRVTAq)3NZ%&|YoF2_R#H
z6+(yGMFM(AMMHvVqWQ!M_%D}Ok?PK$RgQXSkSE1C>z&;?yGRJSx*Nb?z-#&^hySz!
z3CxoTQsSco#KExTQZM5bf#GY!uEdor#36!@kDK?u3lo%@h#w)E>W1P<Q;{Y>wrRP|
zfDs3@=@Dt<vrsr2NG1wQo(7tYJwUn$7^fG`R`A(q-or}y=3N&$T*tT8M2?0>Z~(vW
z<tPt{1q@L8%04{Dix^Le8~<|5sV{?fEc4beHX846Har@6wb_QOh{|X1)7QsnJPbG9
zi<|_D;TaY;{LmxTzbZU|eNwvhtvW^4Rs>z2*e-XaBIRrQEmYu_3toTh*-*hX<$pe^
z&<t8_z{==Uki%*ko|@WVgUDP6Zi9%XZ$s0JA=_iNvYov;09LWxV1I)ofA&V?+o2zP
z2erJ~Fvi%cx|f^mkgX-+!*+;(Oli*Bg3pNMBVb$-*B^=@sEXKu{zL0fYgF$7KMjdu
z^A5eVQk}8zS}3}SQmg=G6=Cv$NNB$JR{eulTnx3Qnwb_4ZQOwb9X|&nzL{O>F<Ug7
zrdHct#BT9gi`^E*H+~Rfr-9ZG_h9mzOq@0xp7^VHH+omcA)Q+csFqKy22BJ5CE{s9
z)^bQ&4K~Tc++NW3XzGCFM}63N?mZL&7#98(GwKF6-pqp8cr`p+v*qDJTn^Yh)QtcZ
zMCXHpr4N;}ZgQEZ&ebbCyYkh;T?nY$QhqKaKpqHWZW?ss4nz?`8h7JENdSAKAX9Kq
z#v;3sOq7>x3LlL&-o<qjFkg%5X4$e3(NkM#;p?bTH@=mo@oz<YwpAwxAM<9<wqt#>
zTByyHpur&a&7Kv!n_KYjl7Umfd-S-tL+<skSh?1E4dmxqtBM!ANh5+*2iF^2{dTBL
zFY4%Wxwu0g^4|q3x5&-&aPo7Wa~tV}mLM(ooOX4w4VgPvc@uD~(|uL^C{8H*i_DW^
zAvNRwsBu44Iy~MF>Wltq^{Hz*sBp`iojT-0Y3^_sJGJjn)=oPw1b?&*)yjDNyn4I@
z7!u|zGbhX=!R8KHP={by;Hx&e!byn#&MHTnSp)*L^RlU~ZpYC7IjbxiJ*ZfK+>wed
zGMmQ7r_vKUcX6pRx@_lG48JkZ)`VL7)%k=mS<4Mu`wFz+loz|84_V0+m%@ljQxrrZ
zlNr*BsIhHgq~5c}h^lqj?P3lql7sHVg=3D}WNsG?NM=@3tYsOp6|@jUy=i1LO?EEJ
zEH$-N`nEA!fKC?HWta(!<`0oe);0EgXZPA&BGAuWX0*Oo0U17KRI~0z4i92#;GJS<
z?kVn78(xE-0$#%CUYiI>g(`+AF0yuEM(b+WMu~e(x?a<=h`UOJnu!&5D$fm2x><@(
zp#o7tD-hj|lNC)E(QUGG{6%YW2$v-O>gtGfCEWt?Xgn}O5zb0_WZd1Nvv$okvPIY?
z^@?^P1^5P~LR^Ee_#y(%_!=}kMy#Dvb0ti)hT~+%*|BZgwr$%szu2~I+nI^8V_Q3R
zCY~fSlR0zl&JQ?Mece@k)78D!^RCC`n`mu?8toLS_to1+K5{#Ej6hgxs*d^SInriQ
z;L9ls_M<yV4xuPA?A-iy!gi8(RW3Z>BZcmO<Dj4#8aJ+AtrPZpiZz_ut|H!!@Gayp
z9g<{84j2|VD7Ph{o{bc~FwOQU2U|knpj25VD?R#S(sR~=)t{OqmLJzuqi&qe|2uM2
zP4ZwCPRxIQTIKP$3SnYWT>RzVudna*0IoU*QV&s%DdR$qJwpte`tuZuZKq43+DIT{
zAOZ<^kkVGW5cO`j+?1(F$>Cn@*RWt*V890Wu-V&DaQ*wceou8rp!{Zj^L=rb<ED2@
zw8y@&vEv3ay8xP{5%Yi7Y;X1EOm&OH<LiW(j!$2tFRRN3BuC=g7Wt1qQPGPXbhdN#
z*}6v_)oSrh);~rY&9gmQU(Cn_bWoq$j?bE~w_1kR&TiB7>1bQKugv}d$Z;mva73$~
zT?SP>6_g3raAe>02ehDQsH}Bu1@)|TdZ04|ydd)KV$n?p8&hd{6Pd>_^G50(n_4}4
ztT<M3rk?q3k3Id27I4^KKj5}5#mF=~p=Uavj7^$FBRpzvMq=_;HQ@N*D~||9#lk~R
zzFTN2<ltpHP9-p2(t23R+R}uIZrSNH!1|@c1$-PhUql6cQ&-q+MQPBHI{`54-%nnU
z6ph$-tTjuKN;n`Qj-*#SB~K5<5W}R0Ymc{5SB&`8Cc1Ko&v%%A?4ZT+qY_|d8Q;b>
z{uzGCwyoO?=6QmYp0(Qv-a>ggW_iYta#@C3DN%ezEe$@%cZ+pv5%c8?$YiitAE#q{
zWq+!I?VuyBfR)*9yUe<gA_N`QVry5+xvIkY#?~8>tI_VAS9L@GJsT|F{i&gPLBgww
zW+sl?6SIIv(=ua7woUStNxX0N?O*%-M<#v)GT=dUWv%b7IRK_ceInUbKwgrBE2ojx
zQGKA*xO&#Zmfw~i)=XarQvR--?5Ty>JiaHxt)U%(CfC*bBlg*vBiO*k&I1t*GvqyT
z`R^ZhyzigoM7t$yzfoX2D^@>)EJ{|e0(B>An7e7{-p!#S<ph=V*7O%?5fu!dP<V9h
z+W3>$E(v*07*EI@nZ40F4g5Lp)3Fqn?^bo2hzuA<UM52P!pUBmX8zE=LdfMQX`a)B
zrX2-lw4pY6vbS#QVXxUUG|nzpYjT{bBuiJwxVpArSo_~qAo{8;qd5S^$vp*o{|XnK
zRR7?F_|<WN$0&d~8P5VS727O8JEJK&h566`^L-pbN+$$`i8;aoGek}l25a<?!vc|+
zvKl+&>Y;U1=AZHzHK{`5k@_UHkD>+xYz*PY3wdCgH1mEcmEm4n-cA^@=VccI3aBkK
zpVX)8hz19tkV%WnWk2?&+}6>P?5>YGl`#P~>Om>^L?7E4Q77LGSqeiq2{5(!XJ98E
zU-_4FFVReVMg{%HuQ4fhh9wQNF>2V{j2~(Yx*BA>`V)5mSiGJ%x7)z-cymxI;~vDB
z+UP#)fC;zQLt`0`kpKf3@voy-XJDiZ7U$m$;QQg*$>v|M0@E(+)U{vlCmHoW@Xq{`
z^!MdwNptZ+bC+Ub7aA@^lE~kwSJ9+%QEnuozfSnc#bY-WabGPRp7RDNUuY%5)qexI
zL_E5WQrQ)=%CYTL&uA962*|PByven9O@E21Q2ebEO?vyQ<H;IJG%>dKXa48keD4O~
zm;d(ji<_t3{#HExudyoS7OxQRhBsYs&Vv2_r>*6|UVUpa_J_SDXpx}`219dp2kyVz
zc1qcfjT4y_p6u_#dLcek=`#|mx3E4Xa|E-zQWRE>5mW2wX>)|%-jaOmZe4}F(PnFw
zzi|C#No+`!-~R5XY~2?BIb2<T-un8FOQin`^j4P=ABF#e)2n^CSUM{SAN!GsZUBcF
zYu+M$K=+rDaEaT`)l{Zayt@gfJ-3c2@sXmU0W}_{0>=c#8BcwGwj9r!srYRvuLTAi
zXYS!aef>^T9cEqvA}dw6b0QEZnbgfI#bI$rdSK@J;uhU&zZxs-OX&>}Xr2!WkS+kR
z5xVT!XmTT=z)bI})NkRjwq>rH&{tdk{i0>ET2}T<dC*Q=`cJC4j%^13)m!lQ7OjA7
z3Oa4@%nt?cZl~;}$xv&^3!~Q*mw21?HnGWSfCAog)J|cVQug(PLD&oSbGAAAc409_
zKMEP$N|*W$fdvBAz{`O&jEEx5ueHNpY`V3bVF-~>9QI^!wJQV3TF%|HO*=YFJcwu(
z#s@EqbMjOQ)afuD(+hEFry2qA;Sq4x6yf6Aj?7kN)vFLdj~AhJ1H4fWb~LJuFA3(2
zs~<|PjI5rdr;Q9Yg1J6(`g}(^e3L4$!~+jGp$J1*m~bWAr6$^yb}BS%H=)AqHv@vX
z_oqed9f6vYSRmL|^mu8@$?_?kh1NIyb=V4>P-&P~y@5NK{kHn|6v-s#P)wU)i1*We
zHQU+!0?EOe++9I<ZRYQ=JvB@U1>E;6yXw1h_(maRiWbPH78pLW!AcBVQ(Mq4hioVw
zI&2ObUj#!KmbtP|5RA}vB#C2@Ka!(xIJvmznat8<B4-{`?2&HZ$m683)e*C^BU`IO
zEz75R^qbZhPd|p?IcydQFKv@TE$sJ>WtO`cql;?byP^~zX-4jN`6Y|-ZK^aPabt%v
z@sN^9Xpvv-+Jl%DXffA=FMHHGXFJ|;4QueF4mGCS*jNR@{yLq}GGhws9&RDbYn2Hh
zYxk`#3ud%%$zf^Ck!Y!aiZaKzljuQteXJsV^d>nmOo(tKt?hOXRMg0Op~*r64@9hd
zNz`hY?;Hj)$?(W~ZHm9*Lh221)kK^IEUjVC1kYlMFQG-{Fk1g9y-Vx5I|O#wdU8K&
zE9Mn(VeZ=6J%<;&o7{HnDlDiMSzeo|_=YVS@gxA>BY!6888JACqbTM7YAmgaUF@nt
z*d^8*9Wsa@VbGJ|h$W^fCmu9d4iEG4{-865Hv|~)S29r>iFLl@Iv7GjB7RIp&=Q&y
zZKu>9LcM;gpH<uqj);yJ-V=2gNpsB_tLqmef#|dn2sBsOh{k+vQnO%8-R3I7Ys1-X
z%JHAQ$?p-GYe$LVV&2gEZ;YGAc#;X@Y_v~Dg^UO-sTB4?rf(@k<G|ro=ED4wK;-S?
z*DtR0zcecmV}`4B>H7Nx9T&4Pd$N`vErH6a7X&R|zRo`_KM!TkI_B`OpNZp;392Oe
zATB&c#dPPWQd5G=dCZ*(iQv-Hx@J%fup6@TDl)npAa^sn6!5sTWxJt!GXO@aaUdNt
z%G;wPz%eG=Y#&2xWStyLG9jOA*z@RANM0EG@zYw9pf}h#)RxNz@r-B?UIrmg;uamx
z+b$`?A37Nw#vZ4nZ;*-+a<B};^SYxWdkjW7qpfFs^wvn3O#>SYWaK_o#JLrCWOi>9
z=Cj;%l+lIqlmphpoMAgbw5YY%q-ihc>xB#&8JP*S*z>*OPnDx~tC|PTPUnLZCg7%M
zWHmBul{gL?4IrPTpj@(<Iiu$|wAR?5o_yCMF`#<(_xm<sp#p{Yf%w|9z~j`wuy2fb
zXEHqM?zK4Rbh!f*p$K-7n>2HV2OMGDnlGtB*?>@ic<e4Hjvh)f*s(&(9ycJwY#ftC
zo0TAP8mdByN>lM7;W?8>?H1fGo!TyUoB^%Hg%L7`%LK&2S);IZ*pSUeov`@{0X|eK
z(ZVQ?`90UvSKM)x(8kb>W1<EFNuO=Ec)nn^Oe6A=9=4P^2vKXNNPcM4t??Q)D0S;o
zGcb#ytc+EM+&{1d&jRTJ2j|7avVq?a^wy6=tkCpEL5jAFAC7kp>jvXoCK++HwPJvB
z_LBg$y^n>*{=pmUyET4{If^D!+@%IQ5>zXY@RlB~RNWZ{=W}<9#`k_QV(TR#RBMYR
z$+*G{waSXCRAnV4|3)R`-(BWAQt39R9o{gDL)q5Q+|VFzLHX{q8M`klR8bna`VFF?
zTxvDKm48sHCpr*0<_?Q3s%mHH+_@q>6VIuQooTXFdCx!}U7Sss<p#^=^nim%#7X^*
z6G?is`O2<olEy3`$$u>a!I^b;`vDalf?Hu|QmgxNZbSuoP3gFD*drY@(tM4|>_nP8
zIJWvQ4o^Uc^`}(BYGIDu3zJ*PCIL2oQX&sN8xk4gG`{aI(%oFVG1G?p7Tj>yL0eZ?
z6B%IT^R%_njye%f1=hC83VOI#M~sHk;kk7tlxyT=$4RaC5s7;X*%OD!ZG(MYJI@?o
zvJr2g&GJH_#72LYXwsQ6Y^}brzy<}2#Fr|AA91e&BW2Of=QL;`h&neoa4#PtRuDxj
z;z1x6uRPq%ddrwgHDo}o$5C$S7ZEtpmhh{$K1@|=Ms$|Sb;$>_UXdt}!pj5W`FCh;
z+s~S<WQ`rhJgK_~wpdMZVT@7gGxyEx_7Q<`lHn*Yi#uYM8=n!IlfRm!u^6==XEhA7
zWD*tldjn=MBi}`2{*9fVxxiVw+YZ}GSko%sZDHJLB&IY(LF_k$c)GSypK^TE1Af3P
zfeNBQN-Y!lqZf(rPy3;{hk0o{a=A61cl=W}l%xS3SOyH44uwk0?spR&oa%h_fH6oc
zhr|<zc=0jJiCMo!n8JUjOa*t=JIQvddi(kkP?)U{lU)6Go#?_0_JNk79EMWL6)x5w
zTwdUVPjV+?fmG4_$z;iPGS0qORX;Q}vw@c%-#w)Jz;L&MwYtEqTL{Pb22H8c5S1se
zOYcPf_$OT>Cut0UsmLUm85dH5-E!<YQb!#k()VLWC>h5+ZmM2;{`dfMabjjHLB`&=
zMuXnx6l>=7k5ZCN&ebLJ*koto)>GZfxK4F^-H((3X;osCfdq|ZgFf!J6UQpJKdAo=
zwVBXC^#HI8akh2GZdBVqI-HJ)ssuHJQFW;@RsfPKmL6TiP^5Y`)Lr<rewr>En@WdG
z+Y1QCrO7LD?IWeO%a8&eOREzdOSe<63flE3QQi?GCkC%b3&@k7Uej{|e7u#PvZ%5;
zpmjygM>#7(X?sYYw7vB;Wy<p+b-bOOT3KU-4gm-9#c26deEkSzG|l3OoZUGBbk0%~
zxAtLvLCH)XQ}QXizXZGemlH9L`^MhGoDfy4OIHzCk#<2aW)+;!n0GpldUNhH0vz@u
zKZOc;5ip$tz?w+fH%5EN9n@qg5VY#?BhHkG(Al#EatTfZUC~a7HpzB$YZ!ZBoVumI
zx}sV!Fa~l{P|>KzG1+RDu#k~vP*qS}6!8twqr9we&3BLVAW>Hu1u$-%QM0-Wix)=N
zu^zWfa%nWUnc0t^v9~l$tXl*HZcA}#fe?kdFCEpX#&%TKj}xUwd!lL%o-!UUn$4hy
z2&>LyI=l+kWT$M>7P?hz2aQKn0UBPYR=cw^aR3$i0@Fs+F#Rg2c?GBU=?107IHg}2
z$u6p9U4lD?Y22rN<sOb;OzhK$rQU?KO<w|7D06~;KByt>k_<}iE8%vyyjs0s8N3vn
zIVxoV4Bis!o_x1s*%@APYNP}KV?9yx$tj$4-f$IOfk(N?_5|X~42u+hyb|{-C@rtr
z9@D11Y;M3;_`kaZt<mvdS!9kJDzMRZ5lM8exu<U_N&#yo5v^3c0Tcb<o>7Q|gVrR7
z8CBtCXG8$<d0|Zm&egNgkP3}jJtZW0xeCw5#AEq7HP3e<nRoPerj=T|^E9<NJq_>0
zMWMRsns65B;ghj_tx1>al0#?EBS&4BjweI=MDf%zdy*h>s^0=r7d0LxjCf%ZpA@<A
zfQ6|`nNv36HbM^t_=sFzG6Y0k0%toouk+KT4=L^VUIr#}ZitRcmstfdSL+BLdAe^9
z_w?Lca9F0SR3{F1INR8U2A^wn?W3Lt`@ub~Z`a_KZu3%&={8C~DtMQWpU5y;4Y~yK
zq@-nsn^Ebb!CbP9J<$_xLmNPOD9^QA)>L$cLsVBUDhH3S`G7vSOAFm8lm?oFb^k_#
zrL{CCpx|tBKrK%9v*TwiN9(K;<8l}ShCVGZwtRvJBMyf%z=lr}C#qh|yCBiRZ-yU(
z!rDR_f>a$yqY9=XPKNMhA4MX(19vuI<pb+-+zAqp2nd}xDFDV}G80XFDPwPxbR&e7
zyqD?I(U;&_V-_y*ZW_nDQ_<2&f2~^x^KjTYkNh&90C%;KZR8C86xDJ6jT;&aRGtRe
z1#ltEcVft&Foxg(LElw+jiRQC?qv2vBg2~FZKcjo?a4)Ym-7=RR&!2U!$g6Fw5k~!
z0XoLxb?#|qg<S+3q=&Kep@|&+G8uFQTG{KY)OZ0hOREdMu~aJmIVOsm*3irX4fozg
zAr*?lC!nj7gO*^n6*3>qbTqcvmS!HLwJ#jDFSEfO*+wl>{_nN!$6+-gsPOC534ux#
zD+0DYK{JSfp_nzHdYnhAnUUMlyuH@k9iCDC=zPa998f&{Z`dZ;x#lw#=x%-H9j7w{
zL+g4t4DDJ=vGc8Kb?g!&Cna<%3k?2BFK`S=wvJfb_!a<ppnwa56S2?3X}cLBoAs-Z
zEQNnyPiG93Lh6kXLdc<$kDNR@qL2`Afk?|k_IRwZ@Mb?PXsGavDQUo8P3>YXl%ZTQ
z29=8}KkL)f!g0nUwOKXNZVvzfxzttg7Wo6aIddOxckU%8^fj{$qe`xa--TDn2Ln@f
zL}*KkmfrtHKedin27l>ZUIV$l6U!u&z4Ak#F8HA}PgkyAS!=&GHyQf5z%%uOyq&<E
zi7XeilWG&oPAezAWu+Z|4n?#zNrNS$#(akr3TcIoE1X#eCp3h?40tGSl-EreS0+n*
zj`{;NSgGy3Rw3q=m3Xng|ILs-r*zCjPL%}`$D}dQfr(e6SzV?7>V$9svb0gdV9Sxc
z1#oXjM%rB`J>B0VVuwqbllxo&Wvj5{9S33E*AFi5R#y>#&kuqaV>*9NUo8cDjDF1{
zr8`UId;h+WomVf+g84f)L6?zGoNE%3<*s^-aPm#QICMT1DHewEd_yA8V{8pP8Mc4g
zTS;2$S6^FnydcX=FIZ+{o|5W@1D2YAl-j0V3X5+df`pABvn~uvjIoPg7XS8rE;dyv
zY?<!S+EqvUok;$qH(sH)({F(-0-zO-YMdy2IT<_#00Z;;JlS=&o$DhF<M{B~65p3%
zvxcRI?a&+TtG#@4_h14&djfUtd?cf~u!pVjlXa=`_gDcsP5RU(7=(x(3j5AmoRw+M
zJxs9H3&#-66fT7M->+QeL!xZU1=xp;usjOG5qJkcrGoHWtK-QyFgdy~I@0^LF(;0S
ziDH!h89I9yKJ+<P4c`0S2;_&tv|(V6&B;x7m4_K3^bndQuPMh07@$e)M<~)BU)u@|
zSZs8^;^*q48##i0A8jl;CZgD{3#p_VCCz)dl-5hE^SZ}{l|b<o4PeT2nb7=8r&|tO
z_zakMd+d5n_94TkU7Ye(-DPWHoOkZsv#6Id{QgZv08bf9wy)u3Gc%gm?QIu8G31=t
z=)g}ogjT8lWXUZfUY$fq9oGxREXi1ShAk7d40FTQUHAieAzqQZ5MYm>RYp_>y{o;=
z7f$wAme$TVA}zdcwTPt*_?{c1tC9V2MLJ?)9Wx4xb?9*<{{+4AyM`b$VU8hrGPBUk
zcw6%?U=fG(O8bLuxr%TyA}Cr9j-mDR;Yv=##@8#G2}EsW5hf?)>zU#R$C|%FIp;9h
zI2)TUHjZElcck1G2>tW}dNMkoOO8=Nnk~bzNTN=St3k;`J5Q#sy2@QEy_Wv0P%{pf
zK+HS{a!Mk0^FGs{PtCK@qIfQ)xdGlX1FHyBCU}M9apAf4lkD)K0{5~@mGyV=ulPly
zHMKTUl&8Mc!ViAzHMe7aEaC}jZA<sAv$^#ejCSl5f|dD%a8femSfh+)$b<zs^EAtu
zZwNm$73|j~>c&;XT}T)7u@i*6$48kq6*=ktmOeJ<v1VZ-Pz)kyx{$?bBacawUt#`7
z33nra2)%zCAWAlk1XyW1YS!${iXBx}yM|CNV0D{@hHTWY)&QIun;(_iD47oCuP6mt
zcP4NvS94v<UhMROQ@arNo^?*`BtONo_CAt&dz0)zMJMG;MrG%{cZ>-2Wnw~?a+YZE
z3r0(+<93q=F*HD{ax>>2lgKZ7pW|_bYGImc;zFbL)m*>UoWP)SIX-v+*gLRJsAl72
zW18J<<@%I?q$yznGNO)@TUk52Uh;+$HY=f<;z?#Kja|lcw6tMbyRpg&qrv3qox0hA
zc^bLOkmsDoE+f$3$i#SGTGU3~6G3#~>LOekNb}o7`Ma&&b<?`zrS5bgY^-uQL?Qxn
zu2!FHt-YgG0C9#cO`d^<Uv*u0lbSq|P53*%H7naMBwtkVUju6>l-H-?Ih1*!SBFkE
zjRpFpU0~ehaTNrkBgrk%2;Hn+nnns{YL_gZrC`^ZS%F071MIQ!WEEFgc=W}-PbI|U
z8Pqvi9>)tCqcm>);v~)peUkadeD_p$w5W7SK1&O?`8|=BjA{8r2p<R~RcD1_DyeUg
zZ53(@WkA(S5w~A#KBL}rxiT0IcIyoGL170m=->I3zFc%;_vxX=y>s_7d4?-FO+lOC
zQ+f-`a}e;giD`&aQ5i)-14>8B6?VV<9hA2mGxX?RdA;jgPX97~Cl0vQ{p3pcYqWbe
z|95A*>#gl~OUg`*WL%rPxmQV>urND6hlq_=l>j9ib<Dm|PrWu@pM=nNxjzdN<a{_v
z-|B*++UW6nCBIq3sjLgz#0EmNs?ahkqCC-rM8!&${ri4*Y|$_j1m%hh_K^>?5A$8)
z#ZF&pWJUhBL6s=q(TnE%A5IYC1v|6L1P_njK4vIE2IsYypJ4;$WH;0~2gjsS>i6?&
zF<u_6cIywyT4oPO@g_8$m>F$8gtsI0DU-C8GB0S0XjGabcUJNsiR7r$7<C|Ik&m_?
zz6B$-pzPJpJPo9YGenYQ?hy0`Pg6X*J?P0Sa4WFO>PQ#^hTy9v;-b}4SwNK&8~q`0
zG+lBKFnGLGp##?Jc8p@$egK^$Pyci{JS&7}yW}>E#Ehm`lPC)_!CphKGaK#`*t{2k
zf^ZK};>zmi@cua$8c!@yhO!6s)Op#;bRm{swH_8ruHuZJ$3-*6t9*x7C`b4ZygUB>
zmUi^g+V+U-m&X%5*;B;M-tIq}*=8N&h37NK&c}nSI#o?0!=s{_q?($c?&St#kiFUm
zZ{f>)zBprEP0L#bjpA+hJA1+GM4-~ZO;yXRWB@F!ob0>;{H&ZjM?-lM+aBqkW(l?h
zIAE!3CNbB#zE`t<o8HPV#@m4sh38F9OjarqH+CV&BN)5qNm5<f;q69IQA$EqPC-?{
z+pVVUPExH#Av$~joi1I1K^re@ZV8r4EoleEBn2EaJ;=$)*JBetTe0rw*M3P!_7L7~
zCw2tCDvnT7lqzGY-Hh&g$cHJ!_!az{X?v<-{!IcSqd}=4DCDCYDJW7Z;XyeASFsEA
zdb@EVb8HX^vnfihVqP^N2!X9U0!~iXKx;2rJ6l2`B1(QGN~%tz_zJ3T_!TD^k$qRw
zT#%eXeB5&Tl8mAJbdZO<DyqrosIrsQE0~z8yVaqcQ;@KN5YiA=WNRceR?rhM>>U#s
zBqe;%1u{WPUJxB!)F_Lz=-(r|{v~y(%v|jhnBk276@1O^{gT>V&X?2XuiDDEaPX$0
zeG-+bPuKz}GxW?N1!AZn_f=N6+&3V2Jlb|ETP|RfTiDyD@rVvY!XKWWTFGc+-#^J;
zP@IppRIdONocNoHwh8|-xuO%JjZWPfje_t0jY}LMSbhEru@}!V%Qo_v;4HF80oHoT
z8Aj*}9j!rD2^u13i;MRiY!UyNHHq{%pUzl9T1PJ7Z+4QIE0}_Bq$9lkB<z;cj06xO
zZPdI(L0n+Qo=|D3{SX-u7*<;{%N%izL^uyA`~5HxFa(?8B8Yx=+^iF=h}CG|0kbAZ
zF+~(TuF!<of_o&pRF5`d@dqB~MsP{%_+>u%#zBImS=tm|xJSZ_bHrx~$2s}y&wp%W
zWtB4AUyo1n-86rRP2ftSpG<XiRWJIzMLt^oO<?}`vHWiLWQue4eOog9jY3F2!XN}=
zrC81C45`pmW*yTcqBa(xno%{DP@1a<S>F7<{LDJW`3YAWYgzl*2rv3%O_8Y$g)oc|
zAenzBAg^+>S+g-_3rpZz#tefj&1V_lbn3-{ygt1@Mm2F(!I1POM3W@)f7X|zLPg53
zIJ<e;;XnK#pw8P}4rk^UqLqd+P9X&xD5uE)KJP=Iy{p`^=p^=gU7tZ+?Rrs3iE2|Z
zFK+yKqU4m5|2NC2WMbk(ob|%wkI_CcQ-Qbj{sBR0?|dFXTTIyFRwo9m$I!es+nZ!|
ztp*%jXEA(ph!o69@4b(RnR~iSU0<XQR99EaWgclmiW}&kTQs}q-11yXQtQQYj>#Sz
zmq|KVBlr{wh0;rN6%~BXAWI%zu1yQU!g2MWO2Wtbei#irc(~vB*iO|_ZJodLoZ!1t
zS#jC}^Jt5*7Ar2&)7!#=4Ewk<`R7_e3^7L1QZeC37zbZM$=Z#zFSQtoy2|&*m>2()
ze4F>&D;biLDiuzJGl!LcL=!|hnO$w#;_p@AC#j-H9f}%I+~-bXPykSDG#;vbrD6lW
z<vh;JDQL<uZ6YHdsqT>Z+Hia(wmJ5{yaTK8=xRW=G7}qnP^x6{+he`EY+_^#w*<RU
zbh6Wb6;A(A%Kb?a#B*62L2kLf8o6-Rzu>)^e`*X|p%5_znak;$_zB0?*)E=iAyIkR
zJtwENO>-uNqx{+eL08ZO5Ed7*S@_v<w4!9VWsV&bl!h+0iofDnFP7?s)>eEZ+uZPt
z#@}J#d4lCKU+}3dC0fyckA>^cj1p^F{i2J5pW}>_R7&$u$VB8PwzNRXE=qf=K{%68
z)#jY?BNW5i1#iV}vCvCO<-(2+VG(V59=<-PPG_;9For3gc~J+UAoCbNdn0;)k%pc9
z^}2<e7IVgS54LKZ<82;$RNj%+I#S*9`w(eB*1ItRMROoK-*wrgAN8Rm2^QqNF8*FO
zl(d1zT?wJiK*(cbJYY9Wx!4uFa2q3@g?N~u{(wPueK;N}k_Bj}d{p3yN9FM!LE{;M
zda}7~rawS@U8UG*=q#(6X2?30mf=X9)y#Ur5_@263N$et-5=g)uT6QyGISGoh{pe`
z>5=&&N`tuK#a0~jZ}8py^+@z;0bGr24aYDo<X>;Ngh*JLx`qzU($3fn?hUWzA8ESd
z8BlE|=SHDfvt;#;A$})=bTYlNnCe>GJ}ptKIB;XKn3q3%T2(uj)Y1xHMQ<)h{0^>3
zxE~7NI2$!WzxaLxQZXd#?1c|+V(q779Es9VXr6J49ndV3zTwk&DUY;!wP;oPp_CV1
zX3Oc5ESoa@8~;qAEo=_5&xaia(GkR-YvtGHKN~0(*m-IKw|mdcrZ{HR3^3sg#Cx0l
z%^3Ud%p(lFElN0|{ja0KaZs+K5=K%nQ2*0Wk>De*V68=X?zt&{Ky;<to5%i<v(S2)
zu8iw$surx%)1hiQbT^uyqr$ZqeO2G*c$oq^CmwQF2h~t1j!t2kUR-Ot+7MV|`nGP-
zPJVAM=cY!V@-D3^6sIVPLl~6~$;9QBHh_>wcA2n1p9!om3-JuTK1!xc4}0>1CQevc
z)MxSq+CYJqM_}XA?DPmv-pA?{;SWWc0tlihN0;<HAoU{%_rUZ!djxBx=`OM&5y(yT
z&T|a}!t&ep$9FZyZx(deda-3KY%cay52>e(otDdn^DO6k`D^eGK0d_ju3{#IeKxP!
z=<6=bu(Tr(&>82o6@<_HZyH}##gF5f_}#eCyKiwbhW@}Pj^8QdGM5vwjc`cQ>=rKZ
z?o<GGZ$KQgF5N}rpJ0xWM#3|MlsNfDgLvMK{7j<c*w`rJl6(<LPQFNi*k=ma6SNs#
z$X|T!op{tDp$xKU%F2m0a7V-lybNDz*IfHR!ZN9z7AcQOX7)&y@-Lu%&p2DA-U(}(
zr($K<xWRvbS>`r?!ppnj=|0f#pZ5F<=&5DlfDYe&5Io;gUx$3EB^8~35|%jR0+6!S
z{kKz^LZv!%B&?TJ<urx?4|_EAhF^hP_C9d8RVt-LYJ!<P%5&w4QQcEf$rA8a?b;=d
zSkI!XWn74GhDycZrvSDwAJ(L%Wn5B(WQ~doA<<|YbY|lTwc4l`1D?o?ZdHJDx1&vS
z)nn_K&9roG$od9fFqx+VTb!#bG$V=H*oIQDPj<U|{&u~xA>0qG`$Q)Kd}T@gEps)B
zj24im@`KlJZKf=RiKGs@*>k58p)YLF%x`-3V&_e2Gho>pDpy^xkT{<;g)G#saG)M-
zISozQhGV?fhYJ!wHSTf&n?K@f*IFy!NHv@e{V!Z)Mlf{w#5aiLvqSpe=mR{0nv;oB
z2(|ghcT{E2k3<XF2RAu0R=_P;BZdksrW$>OY3B&B);D+*pjZMy-rU>B9C-YET1lp%
za1r-rp-{u*n=l<q#C_s(Ans5{9_u;~PNl9hWQ^eo?F+AB*cNBGXGhx#0rx#sfJ%LN
zqox;&dduK+zRn&IBI>`au>Y7g5*XzM&Gku|;$w%wQ+%*pI_#cV$|KlY@s3Pf^tt2P
zj1paGQ7$R{Wxs_|nOi)TnkfZVr8|KMsC;(!eZ$*qQGGwkcSYS+1E9MIx$5`@-gj@Y
zoR5XkTTT5NIaQzKXJlEY?r#`C!ICdjTYojwy|_k3gL0R-TNZJRl{MU?F5_G6`|yp9
zYNuezMi*r5GyUFE(+v}=2w!NK)+WNjIqwh)LAefm7UNl?mY?eMwpl+X%5y!L>rYp=
z##+k6B&OmKffqFDH7J1h#5;421l5`Sj)ujp4hL-^E(;VzYN+}NYhL3W?FJ7O+ByIH
z4wDMUU{%`5&eA>psUNCpY9rl*SX0=Nnz=c#51=|Sa)t;K#D)eP!(qZPnMn>mtHdN|
zy$+rk8XM(39!2S3jzS+nWK0g>i&7v55f!9Qo&AkHYCD@I9xvAH1&~oYO(0n_<90>d
zQjU`yK@Ru(;~<SAm!dk&kLIe0xou6l(OL|VNKKfr?E36J-mt@H8aMgmq?MF-{j6!d
zD@X=^hR#u-Q_$UQoqm%yUnWzP$yoMLZi}{a&Ip{E=C%^KDVJ?h)}P6bwj|7&<V0nB
z_{6lbxHk3Qg5A!STE7#{+nnFeULM(#r6F>A6wwLg^B&5=`6b0aN3e+H`n&F(dIlby
zPck%J9EpUsiEQ-wr*rAq7RHwgrZqU>Ka;kWPUT$)@kY+OQ;RzC?#N2i(jAu<ISy{&
z22z2mh;_P>rsmn<o3%Gv+qN_dB=I+7So>*}G2MxnJ8)BzQxA%tFLhkOc|_Z{q~wm7
zNvW<J_O?GJs1|0(IXcujdhd!1zwl$phBXoNvf4+d-DI;-!W%?dT_ma@CqI3L&hx&U
zd@kOaC@lx<{xB|9%XC-!%6G}(x+0-Vn$_aYFJUmqvFt4I<+05PJ)MjT(anZBGfnO5
zX-Z~96v))j_E70atoOE!T)w#a>t>u%s$ei|%s%CmB4Qyz?&szUNHXT#YOu~%Q^v4v
znMp|h>@(vaQGlGq(&ENnnz=u!wgTopwcG5TdS`0L(wmv|tsoG#s%T~dmEA1^vG4F{
zM^=T1v9F2)XAUF*xKKe290Hv1O(jT*s5xycI~nmNHiD&uZj;jKMOHZhyDAd$J!2=z
zecy`P)V9(=JGG=xVgh-^A%ra$Ck&;LOXqgBl+~$v`$MzB$m;gPxsGqhDok7HRvMu;
zcpBqU>;sv2RZ3?ybFgRX3ENwNFO7eUIYWiO{+s9vo8#-;$KBH{`WClEl-ysH?w6GB
ziGaIu4)BEeYx%+Gf~A?C(DoS$@zfoGB-QYZc9aw@B*b4})21t{WFnTHMp7Kle*pJw
ze8FZZ^L|B8AfUiwEG@kWT3`~Am`^NgV5>_~aF@#}mI1Y~gCoga+n1uBVzY+=H|j3_
zX;MK72Bl(GR~y(<PO0;NrC3kRl>LSGLqeYux8KHjjkw~Z$ht6c#2Nv&5XGtu*&wj7
zZ%KOUBh`Pd)PrS7L)Kgpl#T&icF>hVlbH2<ye6ADFIeYK3(a;?p|U8f))-P~R>9}T
zW8-Vvf11vLbLlIY_2F#-NapQ2o6iR6K^Y=m&+cDtf#%9_E7wXlV=1(|ChN>6!vc6|
z!3fJ0E#f97C*E#KB(+WgVIbaCD;-;Z2jN1?5{~8X<l7-e-$VYWaV<+C)lIGD)XEw*
zdxP~KX<Aj?yrQ5KnvmJ%{GSET&!CQPG+5#;+k5>N1!&v)3(!2IUHI~c;W8Tehmw<V
z8W9q(tp0PNWZ_pKh7yS<$5dq)>;NqMhu$-UYt{##4638tqNvb4AcXM;^ley21EN7D
z-YF$ii?!q_c{xyZakAv*Bsz6#r`+zhy7!Y-evo};K>_hda6~nRmxuS7<#FD_g73VP
z2;QDTfRF_h5E7@-b>Kmzkh%hn22XTSwzfQ57svNKDXMGtXZYvwfpYgeG9@bfNu_n8
zhR{U10F-%6IOAeGpl55Q_Dq!}wD{5zcwqLi@y|`<3rL&mR@-P!Dz;eqQpIT3CL_JM
z7*;t$;mHA(^|oAfOC~Eo-N+pecnAE6LNH&TaH%LKlvv;!UjT;~&o{>h1&s!_$kuWQ
z_LJ$~!%~z+YGHFiT$t$%?2oJAz;<z?j?>LcXiLm{SPB!{;h0Ebgb_AKc!-xMjdJ<M
z(-!LHOm}7No(BqK@$La|KNBqq923wQO&QvxY8yr6>ZdgHV=ZEXvF78)YT`Hq`{SfM
zNY+{G%PQm2JV;BuohRpa@4r#6mnceQJ?kNtl_73pbP)3WnqV^ck+cBQ(Lm&dKf&Qb
zi>~bF0&^Cy(>O}~ne@g^HU^#h&DNT|fjJsW-%2=B>M-XKJ$@ROMt<K8X$4RFcWdOF
zVw>2obBvX}F0b~wHjbNT#ZQ|tAxi=LHSrorwtiwy(kr1IZd6IsjWXg$`U+wV`ICL<
zTc+^j7nIW`csC1S{W(*GE?TUjR2#jYFgEpcHtUA5k}^?C-P;gkIta?cpCfo)jxL&H
zXxDTV*a*Sso+-u@qU{_74+m^<851)Bi}a6=KnY*_>sEUs9|SE_gs<&BJ)T<9HCTe1
zK==9eT=NCPaBvj+1Y$$zl^*%q1jCQqwKi<G&DbowUh_fH6t#-5&7ov)M<qQ|E#xsc
zovBFwq^KPF`aZY10YfxM(wEr*Ymc#&7y02z0kww$UN>#ZFmg|{>6p@vyg6_r7SUnq
zZ@Dsk|7aWyfs5TEfC52a<TV6UM9A-jqd6!k<_G4;x`!*tr#csLGhN1&=d{BN3WCcw
zZPOL5^W1q=mze;Y1uA1GVy7WJCo>O|1?y5<{cn30@L3wZuo3htzvlaJxgK^!9Ky8`
z<UVkPGB=JZ_96X<_n^#mN3!W>^~xpuxnaJ~OI8|Mp#U$NCrwNYfXL25esT#&dp<EZ
zr{Nc<DS8t8t>FY@=!J=@$r61%k?!v1+a~-8cX%C9!HH3)IM8YOtg&r#?A097^zNCz
zo$DHLIwtRJG+l?wbc_gdYtLov8Pjej8cAkR(F67TL-suVbD-AkCDq)KwG}~;@If_N
zOWet((9I-DN;XqH{f~)5%=%SM)?tXHUPWq-=?F`U&3)rC{JSM!L}7(Mbk`L3N2vNb
zVGZNI$^=wmX0C|t+DGPE%7|ot;0P-|-D)n~u&;l%HsPEK#vi3B{m1#JGUF@AhwD16
z_zJ>Uiq!~pOfJz@&$-I^>BwddYD{(54x|-)KE6O?IMAAZ(;v<1QWfXCy+;}}gT`&<
zg@Nx<x;~PpV8dYs)YGygk4*M9#WT1+%VpmqW%fguMkbxF*-;SI?ReN`2BJTpzkGso
zIVs7IC)Td-&J*<r-4c=K<Vf)zrTW83Ub?yE<et0Fx3vL~NiN=#j97ct%EGjMt_^xn
z@O_DOb`inQKXf1K0klU4WaQD%KVFv`uP?S9QDdJpBFSQSP`K%(@0pbrstb?DTiOaN
zVjUAa58{dknxWm#sK&8CwFzxw90&c8%AIJ~aeKeqNoa;SUUUcFW&fBh<{Ps#Eul?k
zG1kp6oWn=n5<3O%W<^g>VA5M<7z4&ixHps?kQOgqPLdS+n2=@_ibJJ&<{_WjGv<uj
zjaCsjv2T%>bUA){!li|kB+^$PrbbBZLMz<$u2lS5GtEIE-I9|cnL^S`o)H?j`Q5cO
zP$dzen#3f{KgY_^Ftc0C9e1f;)S&x=szLTJ|Fy~v>V~FPco77GpV=g03RT(UsrZ&o
zNVt)udqijgbk6|SB8oZRKx-3PN8Cm(H$8UBe_E?VN&55tOm88>j!N;5|Mfxt;~I!8
z>Px3_@57)V%Kka++gKnRN=y`w9VhsR$Z9<(Srz|f;IiNll3W@^GDB<BQO$+?Fe@JX
z#$f0x@N~uV=Y?S{h9lE~&g3|r1`dWj?K$Q_>D;j!dRf;*xFJ_18X;_>e6QW3q)+7h
zHcG3Z)@rHnYV{tsqRB)Y^G)nO^gj{<M-09;WnLUtUy<?07veqI5t!)Z7?92kNp5AS
zCB2OE_?u@Iaxwwxi8)yXS@ke~Sz2Vy+$Vod%q#`R&7~XJP&f)Krjj}3e3k?MI3&%=
zE4|xjAF&vt33A{J$boYyjK*KHEAG_mLZ9sWI@2q$Q!`IX@eV4nC?H`vZYP=ERpbZ|
z`s(^Y<|CdfOnC90TnApo{e0uDRll)4Y^si@Nc+Gg7A`S_@ie&?PRI;R6ibHiBiwRl
zp2PB0sYMnH_~sRYmz*<gp*Avkpk<1)X87Z%t#<2i6@cTXY^65~TDPADtzPY<S8@>B
zCrZ|o9yMM{vmg9l1pzW%F&Ipv0YS|K=6a3*+Fi@y&2sr6@#F>uo8C#L+oiCUCYKHF
z?wP^T@xeOS<?@-mQHTM=`^SUU)5I$}TY7$0w<#By9BDlz^efd;T6?;AAMTVv6vW~h
zGr|2}fGLXKpV<?I3p(ws6;G)72(P<*%?<_%WSs{TCU49FIHc#Uh=&+BeJ>+36*$gY
zI0n7M4j$gRb|V!PWy!Xb8OlZ|UU`X+&?&F6;N^-Ao`fKo3v9`T@>b#zDhFv7%LoDH
zrNjuJyk%>J`r+t5<xF`|86vA^-bAbwzt;MqFPa=&`!AOBV?r(&2S@E8pfg`3L(RZT
zjU!t?t)+N|u%>jGg>JOLCpl0!GGgTz<H6VK{hGv{1upo_Zh|Pd)|LzRn9F^pC|Xje
zUivj{5Fy}Xx;2-gmFa})l)En1D#6%XVN+0&Im9_{Yd{Ck@=Zz@LNJ(3H)2S&fbLt{
zHg?jj)$%2(rGR*+CoV59KZ1&O@Kizv<(?inpR~>QDh<d2E9e+kGOr_9cB7hxM-qe6
z=CY5_{RWTGgvyT3#=tGINxKg}GJ)i^j;7_2>d7=X5;tH}qkehii?+T>fph-{QH1q*
znk9ROr_rmCIj`L>Gb}r~cAc>+Um$@^@XQKx>itM7VnVq$-pa9l^XcCy_68WYw4uzu
zUi%HFY(yLAgmRk<@AY-f36C-fDo3XK@%cMPOJ@YcN?VYF`Bt%5X%EZhk?Op|L6&S+
zv9m}Gn~|UEVN8N*p%Q8wV;Yi9*xTuuZE^{yL0W}tdVcB0!*@|+Zr^@W(*1*&m(E7^
zVw7@OcH5ohYCm|e2Q~`mr3Jhw>$Aue4>e0Fe3kbY_T_Vz%B7dH;vg~O<6wOI)!EA#
zxbv2`Z_wuzUlOv;282@??yXp-AyzJeQ(&C4e$eYH1*!TQK5*!f$B<2AKk;?^yAD6d
z?wGzA)?eud=Y+VovxBe>TCKuJHt<j8Q?vyrqM&nrt|seR-AU4#zC=IRuRln>%XFJQ
z(f#?;dZog%v$LCM!dgB4uoZolJ~~76S^B(BaIU+Oo|3pIU2XoFt}XE`l(A-_Z7pjl
z#M6g%T32SvDw-t`OpQKhl+T>l+J?wX%~%0HR|n6v=oV>E3qi@?!pbC!*kVY*T}b^@
zocW@)-UJ&K%tj=1OinP&8}<Vi8muwW@iC%BTc*usJZ92WeP0eo=Gvy%r0$A)3{iN!
zku4qG;I^V1syx8+ZEU<*wrLmndipa_lX2}D#ao`k)d-(espG2HJX=C)4=EWa))$>u
zOq|9YO>eT}5#>Or2oIh;qDntatWquE2u~M^gW9E8*-dJOSbH>rvxLxzI02w>K}b&g
zGq2f-<=h)_$1!NfYmqx;DrJ#RkpAu@1f8<IRjWOhH#TB=aCkk@_|~^lC9%Ad(y0A=
zaRk^gm*Z$w{c`}SIA`fZ-h#*qFUB;;UU;J6_VLItQWC*{(dQZ@71CF%BSjro`-nr>
z6<wNB8>Oh<?PJuf5n&<RQyNIY^i@N)r7fm8`_0<3b_5r|Pl|KuBM#|chS3l8aTDr+
z-xuoY0w?}Oo<q;OcC%=PD-C;R%zaQ~;C3T?SqGetq=S1wX3dhLgHfZCFXCsHbg!v>
zpgNp5mhgeClag;7ZxuYItWKx)4yfC+#taN0O$dcxO@>zPNtQ_I?w@L<yC;ZpZND3t
zV#h`3B7*zp>pOZ7=s4jNhfjeoJl}$Hn?d&cLWo4?md;VTm_L^lnzIQ)Kj!Z%Ed55?
z44s=Ge42aXu3MG4M<cOXEq%cLsX-n@0exUxk3<99YAC>6Uw`Kzl(2%CBz%8kM{lPU
z1qSep<<^=(u!X`4*FvEK^_RZr^8Hxh?O7du-YIsLYWBileS-36G@G08T&XNJ56zFo
zEL#d_>s>kN{m%iAz1ZdMtA}9=3#FqqUMahLAV%V-^eefI$IG@q%hEo7`)qs##oNup
zjWD5^*R!pcz-Y`xuj<xsZVKgDEF%IR%N1IxOFl+vlMr)Jw;>;lh!~(c;>KU>F*yWf
zuJGEW*5YD=zk#*VNH;KK&Kp1mL}Hr9p25dJoozo~Ry{*>Vty^UH=oQp!T9z9-6NwO
zCvrYw=E1W~T`javwlF#<CyAFGsCJn(M2`UdjJEQrhz$bL$js<k&)}$T$4*$D<CE`G
zTtW&O`d^EF<=!;^>H`{zY%pcz=K=dO1v)Zm#IZD27E}Ic9UJ(swF{~OEw&pQu(DBL
z*pw|$d7hY}Zol~<feqE%CL~9+HJH>OGQ+EOcab=wkBm7kmzfp{kU)ng_SDT#teXj$
z?K1Mn>}Mtu<sI`bgmy|xn{MGXmKLiECxr=GF%rD<9E323KKFW1Px;an?j_~vIuhZ8
zY+EqVSE9L|2{c%2C^@5B@$VfXLkJTvKQt&BUeL?5#6nYf`C_3pt(H|8rbJBOf^uK;
znJJ;EtI~?kZ<BAZ(q+VjLl3LN>l;VUy$+~;8dtMOq1#22<@2D`oc69Er3*!Dc0Uv<
z*6-9Cn^Oq?oatyiB#IOJdT@~X3OEN{Acg2%`_|H6Wsr6PHF{SXf;}unokUos8pJG%
zTpucSHj}5tbm8RQ?~z^7U{TAr+tiv3>&L<I$dGCJSWi-MD1rV{*>bkEZ)Ndx^28f#
z<|~Ao6?XLz*ytiopM^S-T15p;{e`kLSlB@5gkv&NCeM<E3D_&)ytAd{6qUiO;$Iqa
z&laT`TwFgrHg525bW`9iY~Qjqw(&`u!}If=YiVA$=)QgCj>wsYchc!yFPem%HY$D8
z@laqMBD;_f;UlFRbB7fYWam)_>d$gID9AUR$_M=LJUEb)!X)(&f;72*h<-(7%PE)k
zu`I6^Q?3-7c@La{(*VIcE(nLJgE&d>0b^3Oc*vm()OSI^4p{hrhIZ%xGCnCzIi^<>
zE-mW=v%kkR>%xg8OLS_lx^$B@FnQ#Wo1x3Oyo||?&_4FW@i!I&(WQ!6k{U*Ps0r$o
zzjt5%B#!OKPly{mqNxTq;J9dEAxZ3x_@Kez*DGmO>c(;E4Ru3A@4yKTO2fFW<#e)w
zc=UcAer9i1_LR8ph^+4S9E|WdM`;msw=kIL;$WKBkKhE7tOmSIjIp%aYBBaKc?NjM
z6%Q6S8Wex6pQ?@Hl{)92*=O)?MG1_qYAKjH2$kV#EpkZq%%znZUr{!8maEr-onxvp
zIrExFEb=lCsTuvo7?kJ)Aba74Lm`a*`_MN2A~5;gs-z##tmN82!4z&=gjk9-h<^JQ
zl5TA~`Xx#ff~3zm*o+x640JzbLpE~!UzVey+b9%%Y^u61?_>t<r3+8{v!wYrnk~$B
zE&+BW_D*+y62);JhZ3FQ*fqGOYHa40J)6L97+IfRCDFxU@AmemPHPcPYpWuNl_97l
z1a&2FcxG(Qr<`F2m1v||keLqZYAEcrG+HUYs?E6h2yoUv*lvha+oWHKgKnAYZ<re$
zJ6~Ap9XU`)O*RYkHpzIHt53w}8zw@adGcd~0Th!bD6wswrSw?-La8p?`(4b7Qxq5F
z>cy$&o~?YpV_wcCJR%sv;zVO%QQT^vG*XjdJ`W<F<W`67jiCXT>N~PqRhnVP?xEeP
z<#g0qS@|v+K?EG*Wo*UQqrJMLbj>hULh(MdW@N+ZZD>&W1>%3E|3gIqi{qMQ6h4mq
zR?g?x9hv3tJn?EV^VQXNm?BwBtKNrWxm_}m-8V@%K9IV<Cf-Q%q2C(|dm?5*e)dSR
z<M|dH@uqi^|4ImMn$Tv6SB`f=p%Cs#pBd{itCbf3ZEp<!uFX`4IG$rCryZlLpYnXt
zNJM@Aw#cxP1@w2?SSHP5fvQ4AT)7`fR2O28z2zSBbc?-_fn*^^r^*;c*7zYLFBj_U
zNjU0X-^CU=@w@M8u@2Wka1$Ym`zKj)@(g)JRpKicHKx#JkwKO_QMRW{7-cp?=meZq
z1LUW-M4UHs-Xi30%Rhq!YQ+M<##YUn>_8>qjKORi6Wtxfu`0`Ti>-k2dAp3XxrEiz
zS=;;-le@vZ`-7H0*fiQuD1Ra8<1esBOmpdT=a?6a$XPl2A8NIem{x?YxbvPXj{1=r
z6o|gtmLPIfd(&y-X{rC_try3>*l}vfq|KJyjdv<&EAI&Wj$sHnOaG6UX{4{_Og6{*
zWWQ9i)(R<cvPv?kxI5(`iO<9S4|^`Y7!*?kkK3CzNZny1d!r^X-a>aZ<t@vYN4naK
z1WjB4RZIll0U~v4*;c9c+mvSi7`h_0FNjwvUHkU4m_q^P2dpqC8A)vt$NHbd&vbU@
z)kB#*1|V58wXe>QE<4$c#xUcG_MZn^`@1j$BPN}ni(~EzPi|RF0Jq(sMQMIf*CULB
zqg*;p-e<NN@Hn~j{3bKCp0}*OSjnLrKRaVuaLlVquF1ycLNA(S^<UYW(pqVU2`g38
zhdU}m<t(d1)(4HTTBEi#vI8M*I-qGZzEML9TGc<?-5g57-T6c=kKgu4TxlSN1rwZ%
z`5O^yeQuLwG{yFxO-e7nIW#i5PgG)V2v+xY!lF#7xngN0f5>1#_h&Ud!AdSlFG4SK
zRDf0zo54!BO24(dM}xUn@s>;Xf^<5Dv6DG@$glk&GQ+#;Wq-g|`Ox9zhAErdorOz@
z{^{(_SZ#Y6XinpSbENFiaaZriY_^7O?9)P?Ydl2_DeN#FI}<hE4(6Pzpvyu3JQU1-
z1nSNsIgFH-z6{*ew=T)8#g+;bgGj<4%{J~4!%gl&4a_wF5boe#e{bo$Dk-5EL3Efs
zpo1137hBXHy~immdWK=1&eZoJO$Y4yx$VZzoOdLdFwJSrUrWUILEF=!o5&o!Hw*p`
z0HHu$znU{0epiunmMT~dPkBvs#NC~g?QN!LX7`Fr&Q7gf0d7%hoLL3{N+54o1@r*$
zoO|Tz?LGSN+G+<`#CoZ;Kr6`sf+<|C7VNt8uo5%|IR?rx4Du37rA^mu@Z7>Byh#SA
zXvL~3VKefs6sF4XP?K2rF(@yZ@ZTS-T|A*5lp&WAxl4p%x-se%O7${5GjpCmYTQ9I
z+9kLoQ~-s{(cL0Mb%6(V*Hk;Bn=<?zi2>5RgiP@d2-I^Za+3k#SYvvW<*v|KJ=~ab
ziu!J@(uSv8|LNxdF@vaf9OEa5+Y;Dhivo{x|0E<B)$v_>r4s?o<w|#VX7ry$2(x=G
zga<VvR^qY?^=Y-u7r7N+oaMFrw8fWCpS#+-fcZ#@kNrWmE(9Y!+_D%^YCz+ybR31k
z;>lpnT&j%us!8{tOOK0^xga?LT5+nxTM{l|f~j?BmYctmxt$@^s#+SWgm<#>1c7M7
z$2~wYGsw%7G7wABl>wL$P&zgdnG`G$$>c~YFq<H{os}t2SxG&}qe^uNn4(MRQG3Nr
zKuL#CrPgZJe8Bn^aWnIxvgX&^i)N9N1-fQibb$c6k|O_4m+%x9n7V-mK99ar`z)Rg
zkzboF^A&>ZhENniG;@gIs#<Idqvik@f?3$2IRpKw0`u+jQTT3J;4pgA&+Sn*zc(+1
z;;7)cdrl%)_%!TMJsH$Do&`F{t|kW*v|$Djc7aO1uwOs%IFS^$p?D64rZ=MUAvTvF
zRD8v~w*Vjnc!1MB;aOWvC7MRwJ}5Q`AF*&<rV|r+_x&(+X0>XPhclg3EGK`JUjT`7
zO!@&R7vl<rTwHn*D+>%+Rl%84j4zWr3fdj;GA{%0k1Y2r58c9?4Y<XtHXdTazZ1q|
zm)SAIF4e@P3xZ1)qr@DL`RPc<;&b&`+KUVrVnJ}d)6qX~SNFoC7K@w-$wRYq^>Pj~
z;lij90`%tPUeMEQmmAqaHCr#T!<&;8r({;iml~Tk>6*9_`i?Wd!2RyI=#OP?bn~rG
z0Acx7y}QG`^j-DURNQVy*pe)q%Wk5=n;}@f3s@vt+5>sbyPx5AZ-D1%ZuLa89#DKa
z9X;*pS4iTAYs&;t>P$50z?Tt$-H(Rr9Zs2Ifu($<Og}+G%<yxW?xHMJg4~?oP)<+-
z@gSTI;>KcGW|b7Pl<U_YP_67T{D>qcVk@vSMQoCUZ##H$+3<y+MAErZ3-O4egcr}=
z@%Ot?W&*9=Y{3FAohqpm`a>~U{I9D;6xoSAttY$G^dkY@XN-RdayjE13flml+Ct`W
zFAR0BedVa7OWHXN5=2DIiBF?eR`Qpl0Ko6}Qe4jYojGVyl&7eckdnwt$@Nwz{RMCh
z*c7|;$8|?<1Gw6NEhBBa6r_;EiEYCHXSe(@as$9s8OOs@9+@TL!$=VVTS*BxaSAz0
zA8-f_!n<zG{i7DU9Ixoj+}lq1bmc-~83?)>tTFGYjXvVEY}F%LQE*dc;6Uo)rzior
zfwikmWFny~rTd_cDawZAx`dl9RN|c-?s$&WJsA$%(XtT)WvAWaaXa#IC9GyrG9?Wd
z5&TG0X&$%-z0?x00F<&3uH00~a+j(kAjwCRF!V<F<A&UkvJ2H@%i11xk0y5{{!nKx
z5egy^hL2W-Y<l6;EkF}D1IYkz=4m_b-Xz(nrXC@SnG7<}(~^Ym9OzU#zOfIy@LAp!
z4ZIu=%&XJQ*8K+kjZJ1oPM@BfH~@bqcAUPM{}rqryQe;1arFUWohjGJi@p-kd7)Bf
zZOh)2vq8P8-m3_o11R0r5E2gA4)`mW&z8AuaYI<Xf>(Q>>BYC&^Vy>9STVfAU7bsr
zvSQTcj*Vh2Ns|#Yn<IIi#tRkQLX-iX-J!eGF^8c#k1V02ZP=vB;Tm@M4udPXQEzIS
z)RZIBy15l;4PmxIeHAGQY`6(F=swfX^@Ia&xSqtq2v`I%zfxlbQ?nJ}s<4}=NnrMZ
zLSwkfOV!dah9x^!rKU*Pp%e9`(3G!K*;@(<wO9OM=m8A1s%mJq-j+P}`N#gCrHQVx
z1j(->XH}dIj26Uw@$mK037?*xHTbt{-P%s|FMigpS-oya*P5>Gp0#V&b+3kUU2E5N
zb}cbFA3hMmKXr5rGK?kl8DIqK4azln{}1|EW=!A;FktG@*SeftFvJ3gMCwQzGn2jj
z#`2gmhZ4UtXC$*m8@(`+j?p~;i)LR(853h2IAB=WIU5g=ws<5mG&D3mIzG|QlG3kU
zQ;J4_@|~(b?CXNZlM{N;)$nZN$e8wQ9hKZVcxqaE+)a<uW5epxPIwfN4tz(yfS`(|
z_oIA^YI(CdOSiV4Q!l{shq9?{TgJ!E=oQw_NMxC@t!hyLr+_g5tV$$>vPrU{zQXov
zc0D_1EPnykW7$+)o|)-&hBl23Zl1(LO#1dm3i+~ijuG=<cBhfd8?2u!UQX{AyC|^I
ztm#i(WS6ZrU__V4SRe6tL@n2gnz0(Xg_R>mCu0l~vTPK%NVRl4aD-Zs2&|GqK76F3
z!-q1|VlHs3;<10Qyc;=MUNU63qO?0+UcTXgc^NTc*>W#7oy`GzMZ^<9ULM1h87Kcc
zkpBh@ZCBK)b&J<=HHeF<RW}z^evifEL99er7F(JjShOQY)TphwTs1?CB&qFNhN4<>
zXSY4BY%w`MuqxQ1*f>2hI-Hpros1_IEQhheTSg|*!y}U!>?*@nRKGC|4AkW0Xn&WO
z5<UZB!n9e0eaTp9qiw~Ev0?^IM+|f#6><EwJSHed9Nr0%6JP!U<wfM^;Hl=C>E$s$
zsLF78#YjX>{38!+&>C|gl5YWh>eN08NDNs?3bxb|?gHV*P&_eNFOLIuk6y-78UT#t
zJf;NQXBLXcz(kH7ogU0E;?{2@hclU>_3JmK2dAbd(vz8tyKvlMtDxL?w~^d|n*Zc5
zz8D;v9D%RtvB8a_>CDh6ljCEV&7<QR2S?#4o9oG`!Ksm<{<bz=1y|<QQzxg=TerEC
zn0n!)XH~yKw19ZRj&5_@ZOPK5ImRFyVZe=4v-M~K#fU8F{_EwsQ#XqVsn&N4t}2I?
zKw>DOrb}F5U9}yDt~bPXk#NM=%}THe<0%9E863Ai(zQWbmgy9%Dzruxni?z4@}Q^<
zGU3fC?<-X8GU<N=l(mHl&liPuu)&E`1cqW(;a@fx)huj*y7?$9{<_)WRI}<%#hK-6
z0?z_D^>7?)J%i7Qc;lWFI2FrdgVY}%MO<MOpr1(Ol=RlY(b4fCcgZ=mT>osjzJ9$}
zQRLl~oLvp84F1p8%T>ErOcrgs;wURcHYC7NS4%{Y^G6<g>cNrf08u($m_<!&GKnVL
zB%JjQtbqQtsjgIKvNJi`Dc%%kljqb;V314wtHm?X7{Z$`?C;-WWt4gF;0`dZOobO8
zfO#)?Vs;O?MRd;Tfd56KDbt-@@$8>pzV*w0xPu<vK2XS8w{C5i{D&Wp{I{m33*^7G
z4=)(Opa0|XU-10r?Cit11{Od6Yge!Bd2Ie4jZgUeGspZ?)^QHEk0$z`&b8fZJ@dbA
z^_q2$>3<%L&)jNud+>RYqw{vTmdu-_LUExNc)vNT3Y=gce~yMO_36P#q=Hw+YL!``
zuI>si;Z)3W%B&O$RHA5`wO*bDrmtCdwS^)yRko{e5PN_iJ1#z>OA>pHS#-By5UrZ)
zN*MJb{J|b8m@1$=o2=QDUZXR$#wuYg@pQ(n)$CHh3ye+aHCA_4_T$r%Sq0vjKTL|J
zm}h6UYS+uTB!^;Ix-;FmX_N5}rWFt0|8&zss#2ak>^_?8|DM%ryS)3qyYsRA|EPRk
zwQX$kQzOUYl6~sPmf;Ebn}+|-e$tWf@1OrVwi5n4es*x{;F2XDyX46am`{M;C)LuY
z*Cy?JZQiU}OHSWzY-e(Tu{zb&X&T0awGXL4NB8=U^=ph6^k7uX8c2y<sqXll&rXdj
zS@M*Tk>SCq{criz<)>CoxN+ge3+`Nf_0>;HT(v)Y#M76*;L>A8PV4x}GyV{H_l3v2
z{={dm|6uhaulwpzH~!>9Cmi_t*4w|eIa9lLMaTV@eroE2Q_&kgSY7_b3+LY4e$g=_
z_Z~5^{D@~RU-IH5$KCP8>t^5g-J^avbL{7iyyFSSMc?)L>noqT`S-O89=iX}_x$y`
zk6!<b2kwqvxAD@a?R?=Av#+@2k6-$ixBu$m=M8-KxvTEqGWW5k{C?;e`O-<LH=XdN
z6VgZRI`-y2{N_KO{jMv2eA_cS&%f&W5BKGse^2q;_1}Ns!5_Z*U%vam#PHe2O<tYI
z-E`bJ-}}bvYp;Itf4^z`qjR5{*nY&pAAauYUAO-1Ki-u*;@y3@i<diBuTDMf8E0O7
z>3iRM^gC9(_~}a~uIhXBl8=4lSEmfz^sc{*ANT8Hez^TJm&QM1#y@IZ^nz>t^#kYh
zKjl>)zUtp5ZhTkmsGlsg3coz+rQi6}^Kb3E^2R%k`ND%w8a(Nh6W4v__8;ACJ^8qs
zGw<K_o~vI!`ur>AUTr-7%2yQbI`{F9i(P#8H}3q>drv#J@6+eLuK%-l91(d!)Es@u
z)XUF$(PtmLWBaoEVlV&mT;z!FjsGY<n!V!M4;P2_eq!b8m%e`Rlnq}jKJ%;ZxNBSG
zj%UrzynM?m??2{+rE?0$+_t-R<a>Yqs~_L|lsAm5e8oLo-~8_--4{i--h5Ttt3Q0o
zMK_#v;q5>D&_%bm5A1v4gOB^=t6w+ztZN4^{pxMcT=AwaT{{<f#zpU1TRN?GXTg5w
ze>`uf`|V%4_Lb>Zt^MKt{TIIQRo{BY%l=>YtL7_z8ko5?|M-a`?>P2F-}>YA+yC<&
zZ@i}c!DBvrWyjiMzxwt)Fa2Th$Z!4hyL*2A?1x@?;g`PpgbTK;dBat&9lztUS7c2i
zcghu~o%#L~ZaM8UU+bBC^>LTJ>jSlK+}m4PZCE$|Zo}4_C)XVtdD_r@?Wf;#<7+>@
z?t~|8xpmLwe|mEHU3cw!&cwzKm%envF>_x&??ZQ98#(2@7oI)%i<?GIOYIqZ_a`qu
z{}Z>r?%OjPig%74_kv$v`1nNpvX#F&cVWkhvp#xf&uy>%?I)h~<mbHY_UB!@{*K(q
zw?2R0WpDe+`s*)0`;KSs82Li`-AVJo2fz8P<8S!ve_no0{}F}F>(6}L8=gMVx#Rc0
zJ>{0;zBhcsJ&`vZ`M<dfU;T}1m+rdawpV{LeSYTuU3Tr#;g|jL_|L{lUpeibdyl^S
zxA$N9ffs(Pc7E*mBa_c~!h1jZU$aNO`-V@y>$y+<_v|ko`0{~0y+51!*M(I-z5IRs
zbJw2!@|U0fxf8~Z`_k%{U9;hm*WYu^3$Kbl;om3bF5a~2;%~&RC=I20VzJjde|Y03
zFDv}Wyt?g}ufO@K__Lnyr&GE=dF<P#|M<9n-7#Hy^NzPYboW<3ao!D6x4-o(+ds8u
z?|;1PyT-8}c*5H2ulwk^2mbuf^ZE{4yKdioMf;b(`S$nk_~F%`{n!`YpZfVvKK+U-
z#xJtpd-8|YetW~Kj+yxScW?Ua<L|z0&F1I)@8+*ey!hiEdjCh(-XDF_2^*h&w7K(|
zpPljCuWjCY!W)0__}3U$eC^-1R!<(e;JD*o+*7*swHN;O3EzL{aYtM<d&y<byzSIW
zjyvJ}3*L6gEw9~jMD3b;zj4}i`(F8itslJon%~)%?>=(>g-<*Ai<h2o@TI4J^ThN=
z_Wbfw%WqrrvZGHw&^7j-Z+*kc3scuWaN^ioh8E7>bjzCiF3KMG%Sk`|lKq3bt~qhd
z3;*q&a~|wD<<?{J#?6(J-)U^T?4j+~9Czdwj1xY;X7F`q-SwyAUYY*%xfeb3z{!_=
z=#~2)f66)cq=p`>U0Xis-s8J|aM_Q3yl}!Bcis7<kM$n)AKjlkb7}hvFMZ0dXXa0M
z@BTj>++a`Nw=&jyp!%AZyyQ7Mzq0wB*Pe0m!AmdQb;_z8-~Yog_eXz``1XeTk38a{
z%BAn?TzcNOXN<=manV^X`pZpgv$wu!{birOWB1_sO9sw#oY&qua(3@2%RlkUH%u&_
zIO~L;e7?T&eP?|6ho6aEyyUj!CoKQ|&F@_L{O7*!Kc4#T(a|T3zB_u{bsN92_Si4H
z{N9nD-S^A(jtffP?mVTd|3>@dpZxwwH`QMM_)qR!o>~5yAAjRH*ALwE!=-00y!?if
zUOxD_oPF}$^B;cd$~#WJ>Ydd)ethm#pStXfm0x)9r9&$QE;{vBn`iI);zvKd;gsvX
z{6DvS?v(qN+-Uvw`S0Jn<!Ar;^Bex<>$iXY(;Z(vZu`I;cYfsu|M~Iiv1|Tq{MH|S
z{;8k&?#D*oKHB}Y>mPXepH5zSdFG8bJ@XB({@|`nZJ#>l6*mn0x%U^pxa&)g|Mr3P
zH?4Z*{BJ&McYporwZGfC_vW*1So4}^zkj6@|LYI?H<gdPrt>uu|NH$rAN=OzdCOjN
z*RQ^N_3SO*|M%;AZocKAi?4rh6^#4(i*C8Ha!+ca^Nt%|choD_e(UGa;)UbROCNmP
zUzfb;gzNA7b@!Vte#WaF|AYN^fAoUizZ>|xPi%>waN}q9-+TMz_FsQ@)QNAo?Sh9+
zeBjRcpBH}i`q^#AFFpOsmwx5xd%yFk%sa{#)NZ}*X-~U<_ElHj_|dV-56`{$dCz(I
z12>JIeZf6f{P*4W_I$PbDML?u$&22-`4vA{_}Rrjdt2X^fBck({`}nP6JGkcOSime
z>HR-G@{4;u{o5!0=1rNqzIWUU?VdMozW=`B*Is?~z=8dDz2f8tKJ)4CInUVm``>@!
zx<A~0&$Xp<7B0Kw=68H${m-_%^5Em%<E;IcZBIM#icfFYwEX9po1T5&w~mf{@jHLn
z|BLtDc;?Q_w}1D=Pyf-+Z#{VL{^y?ZyBkjY)VfdBUUK7~ZoU1i>_hecX*)Lg*3QSB
z>D>Fob#3>Ya`T^l|A{NDJKlNe^Dauip!53Ay~?@n!k6yOzj}0Q`-fg}$<t3b{`aRY
zKkJg${p{Wkow(^EFMHLi{&LFn+u!=8(Sg^*{`>B?TsPXg^Us+t)Ly*z?rZ+*f8Kom
z+`qqN#p~mRp`qv(=MH}5h=B)w^T30D`QW!+@$)n9nSB4I|NZ{fCB~NJ|N7S7+kdKm
z{L(8{TzAE;liz&mx-ai|OZEqEiSGRHo8GYW%CkTFyFY&S*Uyf8@sv}}yyv^0oIU@~
zw`GpK=qE$ZA3x_0$A0KQ`S`s*z2h}!KJfz!58b-^_~B(giJj`~{m_NyUHgp7CQkm#
zx37QyZJ$2zq5H16?z(+(Yap}X;Ge&9xqY4U=imRq`s~F&_~P#_&A;lkKQoJG-8HrP
z#3MQeUUXXO@!xp!n?7AX@${?Tec-zLpy$v2<$quGg;yLEea&6}Z+Iq`+wi)ZIxblI
z;`^U)!Yx1e`Pli_ZTRUGuRizpcYo@u_vO~@8d~~^{GL7KJ?$T>z4yYm{VsjhQN@QY
zy!*;$k0#!k|I0aN{q;|uxc=pPb|o+U$Z<3Mw@m-y!ac?fuQA{J`RD%e^sCQ*kC7QJ
z{M&Dr9N~QJjt?*GeCo+}ee2CPKc~3i%&+~qYxynDzjs;t(!!PB+Wfs^*1YB&_J-qA
z7f*ceQ@^}AKQQskU;pNf#~pp|AGf~pjH7yY9vpbv%#ZVb_|8Xv@`2ftpZE4Z-r4^6
zmmIw3oBcgYh7O+p%IVsk#M3`=;}6al{rE3_`~3g@?~%l3rq>txKDX?=1J1{ifBoeL
z#_iHKzwrL|KlQ7>|H&mUU*CP!+b_Fj<La*u*{`^Me&~aV`DNeyugxzw>C3mhqW$A9
zdhu~@Gmbgy*B|`a;3;Px`26_keW~mFC*OVd&i7yNtIvGz(>vZ)eete4Hypg`*2%He
zcYO7AM;$1Q{@3m=pZVJ9;!hv=+3PMkKQ^=Fx_dV~?~04x{hp)0^Pl_PQhC{TF5kG}
z!7Ufxe`)Xir?0%^U%Gbvaq^|_`0(q0{lNNt@3`*#+mG4&+yCkMm;b$YXwxn4Ubg)&
zXYXh`ap_4{U4Fy&C%%3Ek6!=&fBDTDFF14TTLVj8de{9oF8tx&f4$<^3lIF}7yt9F
zzt*=sbl`Q*eCl!begAQd`J3Oq{Wrh5`;HfVZQ>hSZhG=1zq@nCf$6<p`*z3A=RWx1
z)WOO7Pdnn1zwYX};RW-BndiLrhJnv~_c@m@f8$4Q``~RaeaV4)(r5RLbzb#fV;g(U
z`_Xlu+4H%d-uI->d?$8HVeh@WHpPGOs~>;)?Cyp9&-VWAy0tIA;YD{I`1R!*eiwVu
zg}=PF_)O#2T?<dV`kix^pKPDC=AFYA-k!gpYuAQn9RJq4?!M(y8@{yh+7o7`&Od(1
z#-~R<{>e*@d;5=n^Y!j)=Dzl;!q~36?z!dG6F#`(14o_I@r)zid;bH+zwf52H=lC#
zSx-v5?!m`B<xi{Mo-e-mo@agUt=7_^8*b=+)k}X~&VJyMcMkN<d~3Yky>NE_rrO<e
z@4s-{)6RYVFF*Bf-^+dAqnFK|we&4dyyCRT_&bl8nA!54;g6I*c+*cm-T$@gUi8|x
zU;9D(ozMT&+dkjD{^M`la_R7et9N|)r*ByJ!;$a#+?uPB8+)#OS;0s@`;2GB|9a2-
z{tpe;uRd|#+IJ1)&be>yIq~~`p15+y#Ft<G!wYZERloP<&;M>N^1CaJJ88}7zdrJ+
zBQO5&`=50BhJ_{L=9Zrxd(y(&zCZT-J5T*w;<JB95B5+0`KR3{<f?C&eEaG<HeYbu
zwcon*lG~2oF@D<7?>+s?-K%f8GWC>~TypcJqs{~I@0@wx@4M&U_wDcAlKsoqBU_Va
zT=Sietv&F8kF5Xt{^wu$`R>=eYiiZUPS4$X(($L>@$qxt^Oeq<);xI5|9tzG>t6KM
zKYx<(=PL7Y--qtKf7#`q_^($ccAxVX5KNA$jciRHb^DW^{j7EWdd-tQvJ3^Bk@VQ`
zl^b`z_-`d({hfar$^Ufgu9KRpm5PVeM`QVa?do;i-MakW-PzUE{h0j!XnZy-9UdQ=
zI%8Yf*fO<s)Yvw?adc$Jh$cHacB~%i=op?FW-r#HI=hUis#$h;^39Hp^jLHtvH{=X
zpY-4`{Fxe=8ch$3)=gt=s>_(L$N?y88Cyx2Y$U~9&d!DoRy48!ox+TX^k{#Slzz^f
zW!0hvg47?aS^H}pS;vVQTPD(*`lGNmQ6Y`}ZcR@O0%%j)lIhc?N4EDzdCN%*M~@mq
z<6~3lu_@jJF5y0wVAZPi*K7IYN!Z5Z)ET2`Z&w46dJ(mU7*@~pkkn)^c^{E_Z$k%F
zga$g;up=8bjt`%Kf458^F1p~K|Igl+z&BNF|0f|WZ77fykh0&Vg%)hneTUk;4Hg>O
zvMET@<faWIxoK|F1wp#9saW8lq5>_83ZjCF%2Tv}%A)eX6&K#Ch$!gufr?Mz{qZ-;
z-BJpfKK=WC@BcTSewvxde9z3BIdf*_+?jK;xGGn<T#mHp=-S#^Ev!A`tc=!VOw>&&
zph`<}K#Q14Mq6nyYpARuP+JX^U0jlzS28IkV`6kxhU$8pghj`~0`(ax{3;XvcWk!j
zFEuh|vjsWALQniH_#zuVp$$n}4faa6p_10B^3hd3;cWyKyUWR#+`|2In3=n}YeP3d
zSneW71;Z@3VPk<R!73!wVX<m5^db>>#{kfU?bPxufw$|01{ka?BOdO6UcU{fyfnb?
zqT-xer%f*|%j=od2Ag3aW7mTAMALP&F`B8cm>4!Xt5i2NIwdhRCO$beB|aYNx+wI*
z4P0ncTnrQop>qTisL(q|XeVhZ+}x@9EL4urYq21ou3#$YR@w}NxDdH!pA;JhMFsTc
z#O&)1jfv6O@b{98ih8O<OX+B*n>AQ1Hr7~GA4wHysX{I2Ln_}=>89bCA|{fWsiksg
zFkld@2(vqq%5qo2n^JK=<)R;SrP))dl*B09=BW6nc$iG(6y>4ACRQtKakP}5s4ISB
zre*_%8PI(q#0VsUpod{^!c#3?B*<>SH-e!UX)>y4s{^?u!~PBsL0+JNjLxTxE^W6)
zaL=+Z9(e*psBt!n$;7zQ#f+i6e$r%!nyTlVsEL{k^mUy)Jv0W_1gHRX(}ChnRNz9e
z_9%r16*5#gfLHig$vAX<5B2CcyUD;-rGxn~juLuYKRqX^#KM3v?4)V<S`lHyxa}s+
zBLKW^&GIkNx>5bC79(wEX^vG$N8l7ZOo8gd)dQ7{%K(I?W=+WxbT8mqj)ZGKM?uM-
zUPK`^I!VJlVM(LVFe}n!^xQ$Q6xU8lCs9L~Mf&RlL*q0VaRL--#Uf6<Vd(Ut8)3Dv
z0Id~^E~4w;i6#m(s0KO%7dq+s6kz#Uu?92X#Y24i1$xY5iE6>sLt2v@hISeS21I)y
z5D($;l1ex&P!_yaJ^|tq1RQ!1lueL-Z`Dq~)lQIByUJ}};JsMPwFC*@vaO7f1Q?Hj
zVq3FV)>4VirFjSA=1Lk21=q<~LBru2vD{7qj%gDykwk$AoJ9rBdB-PVe3FRgZ^Gi2
zrh^%;dq3QWTrwt?EXptgB{-KhS`GN(6-y>Vs9j>K^6Jq0)kM5EI2MLPi7;e2Ev_mX
z4NuG#qg!B%(`$ngv1lYpM5BbpXAnWFdO;>0lZlt`r4o(pUeHLuG(6-5US7vjlXpC3
zsf4LWKj9n7d^NmNNy1b_fzdl@BMq-@(B8qx7%YlM8JZ+=;DtFT^F(||!9-H7BeLEJ
zq+$Z8*AmDTmZ*ecint;2VuppaaIY6EaT91f#1D}hdFZNPA#^wa<|uDq#0QZJQ)n<w
ziS#ULzu5Xb$zfV=(AXF>Ma2l<0)w*xOmCnItyWqxNqU><Vz|jJMlwP<T2Ue`)F|lE
zi!l*Y4G&iMEs&f^8x~+8Bka&vTrKI;=VaV2cvM+R;6`fzFxKNe##ojEyS0D~;x->}
zSwTC^1|!MBARh86Ucx9y6li7Rf*bQB9x^0e!VQF>N-Yb$4Apq3ui_=zO3%`66BDJg
zo4`uUOHaf@MHMeqQ&f(XVZBdh@lZp>OY~C-T?sb8&U$aKBnV5o&M1Ogyc};7k|BlU
zYxKc2E2ryINP!emJbEY>dN}Uh(cZ-ea4*4AeB5<Fr5K#`R1x;&M<6n2F(h3IUAIZz
zD+GEaQ7S^%11PSGg=kHQW@G7GjNa`m*6GH~MU${}3KoVW+_+lM%R#+PfM^PqPQX*Z
zqTZ{nM3Zi!$C?zmRKB)cFYQmj9FX>i-r#~h$B6V2n!G)xZZvQ9ruj*bfH+8|7{E5n
z2Ja7nMF??6Bts(NIME>|wNRjn-7Xl+HyAm8k=`h!KuY3x!Rrsm+R}O!tTuZ=DHT#m
z?P273j27==4j3e|2kttNs7D#BjGgwr@dKQZ@&#J4Kzn%anWE!5J@1pAJFr9`J;_jZ
zl0CLHU{eWi;9v(Co?Fc8Q;CCA;;u`@b39+4OgtnLe?2l;dL1dlfe3gi%pBhIS6Xj(
z8S0>|fHTf<<UDu$ob^M;TR*tHei^(oMa|UZmK9FY#Ky#og&X~{5^4r#7jrQVlmczV
zh4CUe;myI==3thN2|zl&XIoCF!(@({SD?w5SAa5Rm)t1djJ%RkUGY?qn+u5;J#60f
zfCd(NWY=WiZ|?;e@d~OEFQ}j)NgDT#H!<)|m?i^%d(V%2WN0$bm-pP2w98D}Ycv^L
zfCypZm$wKe#JpoI4ui!BIu(C=&u?W6CQSzXPnH*RiVu-tuxEaZ!eQ??8=9~*8Ti|K
ze)vu~O$Pk$Juk;1LJm2M$YzVa2y(-#VIVjB@}ApisHLkxiY9{(5n+HxAO!d(%FlB7
zS)%;-nmz#FfOiB-!{MgMz~3bKxe>vVjtJIcM6kUY5iZ8=wpGwz!15sy3@@{MhyVj0
zgJr<~-t)Tc4zM@TWZ-Y_`Rh0#tm`I)H&mlWe&MLaZepQg^h_a9tvmv3Xxugr8aSm_
zG~9MO;_5X?y`cgxg1cEM5uDN+8qj&Klmd+R248QXttKe}lt9=q=w&ck^dC$*VuWC(
zLYajb#Ut7abQQxakf33-7if#!%t+8M+6y#vL1~r1QM?y;i5|E%trv8h+;&?+#wpo>
z6H;+Ikhen#5iW(42J6|E#2Qh^F6~RUcYVor>kYP-y}|a-8@<!b0;U@u*<SO}<un-S
z3ZzuKB?uJ2vKlRe`L*ykdj;!A_p;c9tDH3Ck4uvwhP~Gc<wY*tIUEWT;*dL74rk?!
zaRfN%N|S@ZAR&sS=>;4L28mIwnhLjB0HPQnw$^EJ@%%(#Ld9uev|Ly4A%X=lqvg7R
z4-sL|D_;->g@`a*xA7q&4D^bJATU6NK*k4*K|vyvLnz2WToM*1E<l7}T_&(ALKqw*
zMOo}T$U;^({GJ3J#1L}9Wpm&Sj2I@vp|u?sAVP2=&W8vE+-7i9X$=)Xi1-k}P6_2S
zG6Dz$Nl`51yAUKrxeNjd1bcyslfdE#aYh=RViJO+D1ja1+yFVNL=b_RKv_+6B?kf_
zLJVE!;4mOWh%s9kXmk+6q&TpH=3yX6igJo|L}5Z4bYsuKV2}`HHHoF6Fe#4Vc@IM5
z82DIE3=`sPhB^)fLZldBc-e?Y7w9814+23#l*7Vd92QapQ_Dk`T0)G|z>AWTWJ2I_
z+D(j2fWb(wkYGt-@<77`LJFdKBiC*qXO##d)dFlaG*}8jLX@aT$@M76StWw12qzYX
zh3h4_I_5*(ivu}L$ZWs`$PgB@8NQnoqqqnW5}t5$bH#CCLY&3Lfh+`!2N}UG4Q;uE
zAQ1|`?Es;0kProZsc|S6Btr2!F$@%9L|B3Q#GD5!A)%67m{6>s^$MP5HadVjLW`;-
zN@9n_*`Zw+4sy?UFY(x->ygkq3RX*nCk2o|PQjA_y=%Y2Nn<m7w*+zuKqq1&wMU$=
z6S09)TTu@OpCm$Hmc^OjF@FIGBg9CP+vX6EFhYzpTkIwQ2_xi4=;FjBVo{VBU1@`k
z6$CVnlA~F7g@^?aVx$%B-o!9Dj;W=^&OtF^tY=eu*HR}fb}R_@0tZiM(-JI-6XT@}
z?hSw4@Lg^K62%CI4>EOu9Roa_sL7DV2%Z_B+!i~2-YJcdV!>k6&Ld%%6vxkI(ikb0
zWyIRDjHIsJEo?dX0r_<eY*x2nUKVuwr^yh4H?9QCmct+5z$hW=9hr+w?n2Nzq7YeE
z`H=Vg@cdIH6eLN+J8CNTfJzK|$CS`;j>8xn_Krbkn=u3hy(4Bq;{{g=4ik(DnAzZR
z80;3VW4Va;;_y>0K17foz0}o(%)Xv+0xY&93PAz{H^#*<0mdO|6TvfNln*_e<IL*a
z61=1FoXUs1=jR?k3qb+|KK~#Dy(20)L8v5<0k9-Tu0YKkgpU#-@v{_3gbanB=1F5j
zxJoNi!Shat5+SPuy+ZW-O_CA4$J7IgQi$>JMLQmFm_UTa&;2A3A{6(8Ng5-<NuDfq
zPa(ofv;rR^!g-cSULHDVC5DMG!c#BLxOXhSVi3aw7`B38pd)w=#z#qzMzhD1D@h<h
zcL(<dYlS!R;OliwpznDC9*HDW>=rAJwR^K6bJ-X>EkL+4kt7(#DJ_dnAVNzP0ep-E
zC!DU5#7J-wLFXbws4DzaNE#!-b?-v*-m}u6QB}Oy@-YG&!`IXMUK-}I)3vO)KH_6U
zI0-BH7#U8&Od(2y^kk<bfdpOW;$hxS%fVbs#eB5+6vN&zl0^^Un#aMbPX~$abhz0n
z4{at%AVV9C_?CtU=Tivro=VLliHw3-I&dWkWN3?YqajHkL-(LnuSq7Q1oi~{1TRS-
zM0e+bwKqHvG%Xh)L`n3l7$?JauWoN@D;?}&oD3^jCJ0eN<TYYeLo8?F=~QWq2!~Fn
zieXZWMGErrB#X<)N=ov2zE#X;k%CA{LTAHxx#43ZIBaJT!z37o)nF7rC_;k52Q<a7
zcMR*f*J8={TC8-hMRaP7&nWJ-SmM1F>$%rr$@f~UbgxBpK90*M*|(6Li{o;3+qaOP
zhvRa4Vtaw(Cs3Af|G{?Ke~_NJLwUI)xMJ8l#>IHd*g}*9*=@F!B#@vz=1L(-g7lc5
zgeVD8I?IrqJI6U4sCojBi;^Hct4dx|>Ab|pNN}FZ2Qf~7MW?Cw5LtfwfKnRsj^o6c
zyE)Z8#XG)ERNZxCn!8?9Zk`9iyIaN$!Yx-Te{b(bR`Q~G*>3o5KSY|3c&$#+yb`*S
zgOo@QC*8<$TQtvLGT|qB(ilNuAg6S^NE67=@NEMkl;tjN6X3cP+M6;(1t>;Ikj_eE
zYvz$$lng1_PsJz!vI6uv^w+>4`6vMrZo%Lz#3A`82@<x-V6W$qT$B`PvAd*5uXmz6
zvI;ueGl`Ufl@Vk@h!bNyL`s@ON<pIkJyJ;Vj6<02JW@#UqWQC^H%~=`%-x&cyVeUD
zUJ@t8x`jzanm~Z&uW?EuL@1BOnn-8PqIuF`Oge@+Gq$)0_DmwDATAS&dS@F4+0ip{
zAxMCL2DA$41SBR9q9r{;c6U_B>d`x-H%L)tJ6+qIQ_>_d3ZhA{h}<SvG!LG!2Qxd%
zA^9i~(j{t593e(YG^Ut9hL&hcE=Gv+=pQkG4DF#Mg*X|ud%?uzI>46NLz=||611DG
zg4=5=-$!Bs0oqBMIT#2L<(HTpipcE_MV^c1BJx!;&MHxDe3Ss`wu|jUVFFBT7476J
ziNe>cnWM`}(0}OZfM2|djvJ|*qO8)=Ng6Z5AU>&z46KWCJK%}cG}RQwPUX`TRBSvI
zo066opB5iSWtWteQP88K=v;APNK_OC8j*vCGzvPdU}+O&W}L`927Ci&qADs1RSP?x
z1xt41inn+Ef3NTV8GIwY{CXe5Uf%zdoS2y0{ryid3GsjUfBro_P}Ha}oe90sRttth
zWDOMyU2s8nqtP+3(J@I>Y*Jbb5Y+_AT4jdL0I4tvN?y;dpQmR*55ANGxw`n3KAt_?
zD^uA8=uNegG@<$Eqv3p#Ko26={Rn_kQD}T1GX+qj;6KV!I(urdzEoGrxhctp101>B
zy<Ig?mx0%^U^>)gsOI7%*66f2Tqp&_!N!RHeJ-Myn^&4sqSKclKO)_Ta?Y1o(T7d<
zN@-O(7loD&$b%1ez?_x(S!N?uv;{edh2C8NlYpY4SjO!%(ohZ9D8{J*zW{pN+n!BS
zg~bl{@bFiyDnj4=7w8Me;G`*hPmijo=jv>Pm5vmA=yD*ZcD%GrM$oAhH06d`2zz2i
zuk@0%3AF_IY(|L&qsvl5TkExglj=$kw|D1v1oR|bL0g&H@hVt3juj?E4OGc4_3ewi
zw}D2(1zWdX0zAhDwWSO-X*~-TdJ&c+`pI=M-H3q(;`tl7)-h1nyh|Z1Nx^x`1X%;9
zLDqo2M1FNyK+;+1My~vjpK}AivJQh0upOvv?C=*FF92s~Cn&)|BiGz621`p7ZMC9a
zK+b&XK?38pnjq7w-C!~?sUj*suh~Hm{BCd|5c&mrII>z{Mr_gtn0k@qc+3N_Y8Jbs
z@+#yFnF8cuB31ZZ-dxpr8HQ|7g?sQP9Fs(LE8d;B6;4-tA<%m_>tev<B9^ALV`h0)
z26YYZzX(X44fY<quL_!DhHp6cC^!;GywU15p_iRk;jZ8-Ad$q#Zv6|$+v!RJlt)-;
z=tj?z3s^?8Fi&e}FoqCYB2~B&6b&m`#XGg@Ue!qHI1z?2&V{`p^L3QGI-RQFJo6&2
z;M23_>89$+@IbVf;XBy@3-N2(O}v0n$Q%S{b%#LV=SqNMUlpDSxCX}vUSfd`!*ZqS
zmJD&?NGXN_S__sLk&>QAe%M*~_{IbU708$Y4MvvtON)k^2OY@DVm!hz8<7JpSm*Gl
za8zBSD4g&$^ss9ypuj=}pjFLg+!RzaK+E9#8~}Rzwp2p5ub7J_*j!GF-~s`M?2JUN
zAbBKPe9N;lG*LBFltsfcjBiyfH{h_khTiqi6>HRR<To3rPHVb~5x9eCb*IBs!!A{R
zl#MZYN(azkHn2B9<v|N|qzc-%StLd*b}4^tRU%a$a|HAq2URdq60n_+1d<U09yulk
z<N|s^P(l*N{zAWTng;YFm?dCg^%Slg5<Cm*uo~*IGF9Qq@g-4U9b~cgNE1S#00JDC
zoB(O;N(`;n@o#QBsA(w^Nx?a>)=&>+3Ng&-cHq$mi-2+mI@kc2*<&eCAV5JzD2>uW
z(p1>PIAuWMla8f_(=O0GyA`PmgJ+dN6u#shRtNkD=^_#ylvNRQosovzv9lHvAO<#A
z7Q}6SqJVt_wE`5sbZ$PdL09}>%%Bs!unVCtQj5!4KVI5jXppetD47&4OvrYr@Nm7t
zin;&|d-yh7G%Q3n&AdVd^MS#FoWOIg-(h)L<nK+Io3AEIJD{UzJb@q$$6|f$a9V7h
z5+YScD8fyVQmr;mUs60pFDf<U@*jgR*AeHWLkm#?TF(HuD=7>vI)K<%Y(Sqot@WIK
z>OpRMQL8wt_kk=zVZ!??1mT8gq>80ooDz2ePB}nfP%L;-P;&Vuz|!i$$_$WUz~mz8
zF%yHQYJ(ZBkD#HOpFgAvRJb^}b^^rHJ?co%GNS>A6DR}BLNzp}iH%@Ln%!3H-w>|^
zFq`>C@YNG$bOT<Gq*DUR5lx!`cDLOO_$;m)!1Ax`n%=-_Kr^n=l}>4p$fGchYth2E
z7_Eu<m9`!&jH8hJ!u6SSb=H&CMN3OKM?vv7z)p=+K~?6lqy#HtI3W{hZmm!Unu4`}
z>j{?uFZ1|%2--j;`4#t~oyHR%VlV$Qg(pumO$)rmE4@grBO+C#OFprJ7QBFfExl$I
z!6J0+n%8sMg;cD3Glf|m${qYk@Sv8R5fLuQ5I$a5=OAiu!RJvBPy+Q1=&aOQk2e6I
z{-`spyx&T(_!_*btYT{Ums?Qqa5lWv2EtfGO7rrltfJCl>Bb3dLLy?vt2_-fJ-$At
zheT+m!TT~@R>9Qb(lT8RCxX}`u?^@t19X)suButuYDOyAV29q<>v7$(rk52KmvGo?
z-o&En=}jzfdRB>VV}U#ByyASkNB&jDncv}aWBX6+Z&HRg`wuksc-nuG;^Gqju>brX
zAMG4X@6A6dZCN1&Ej_W6CM*|PHhat;rcr523z3IcWSW_Ct!)PW&f8{G+H6=0)$J;+
zj$hm(a}0=LU4+AM6OYU=5G*mn@c924>x(wK1XkEc^=NzHTJtOHF4`i!#QY&)>c4Mu
z5xc^>y@l_pYiund5du34WD+1l{TEtUKo5dAp@l_TqNBn&zEHh1uy8!m+NoZfSG2kk
zzR=&+xFYr&6vKbtw89O8-kVim1$ZL~MPgI|CGq*Y8&pu|WKz8CgyQWfK$7{i|2wu6
z$h#hFDWIz1bE3k@3@IS92IP(k*Lbm`z{0%QQ6RB7Q8hr9TQtAUih?O=JWMF420fWj
zI4StUeDZslPoRXQhg1Jmwi7tw!zYDPqNqZd`LD8?z$S183hIB0%|ueCIO-3J$-ieY
z$>7Z;85z(}0++6wp#&_Z^-xylME$1>B)9@PPy<j=G`uxEm`2b_0UAGgGK|0_9sKRL
zGl~dYvE0}q;;|x?Oq@cSte{Qk<O#Nez(mdv5)qEqI6c`vB<ms)>xWR=nj4rtV5e(%
z+lNM6{zI#Ww!*3E!K{JzIHF0TH`WXY<*XV1mLUUf4fBfg|M%G}{`mZMpBvbJxHnV(
z`Z8{8|A~!>i;d}S|4B|x{=@$BdwdFX`6<bU23dpbpD^l_$!cV>g)-UVzJ2fV_g}&=
zOm%g2O-;?hg$tJ~St6G=D3y(Ve$D;*wG0^0G;m<+fB{Pb16yypX<1<4@*zW34jZ;|
z`0#s1jk<f(sCz>~R*fBdpGMO*cI@i$<JUw+u1!pQAU1YgV&eMP*ay?n9!g7l<d$1D
zWM^;6&E1%t-JX}%F?sTq!osaZMO&s!*{0V&R#x`tv}upeocYA;**k8#ZReahPuy|G
zljY@48;!dwD|cHg&(5F!EW^BDwLVu}{X$L6OD@;m`udmdymQ}@C9mFf*S@Bvrq<Th
z<;$0^TD7XJt!>@9bq_!M@P-W=8X8{h=;+wCZQJ(k+n;>$$!DK^_JtQ-*t>V{zJ2?e
zoA)nUc3{PdgLmKk`l?lLw6z^tv*z%+bw}5)e{=o%w>EA1OGn3FHg7($ZQDEBx4*l6
z`+HA5`N7jqf4F-$_&d30&&Mylbn4}oPaQmX@X(<{M~@zT>#essJOB31JMX;z{`)6S
zo;-Ex)c*ZlhYo#y=+K!XN6s8Q`o*zhXOAEM^4)jOz5o9ClPACa_~UO*o%;5(&p!L&
zi!Zvm{&D{N`ES4d_VnosXU~5B)mPu2JNLu4-~M><;>8OW{(0%rrSHH0`Jey1^7GF>
zU%B#se);8>|Fj_ezwn8K|KM1V`CXNT`;RQ#)xN*kZ_tD}hj(=xT&514{7B*M&9C1b
z96$fl!@IW}x{u0PIa2q`)+1{pN_WgT^31k3ABZs?eMC2?W9!3f9UnXwykc5M+ETya
z!(WRinXF46F?>{EL1U@1)Gt3vzxD9ytkHq%L!3Fj18$x_+&}lB=h{QlO4m@c(^dqI
z%xVqTZM#xBbx3}nQL*bwDz&doilhAeG9TR4ph{P)OFXR13L4L9)7CV-Hh$gmwweIH
zm~wgZUp5W3+8x_=h62HNn%?srkeeH-s2hEJ{qtWP3rKpkAt65Kk<g;D{Q9-})yrgi
z^KO26?k8-+khoL9)6_l-jz;+3^Ww$y?LOc6ym|2IvPyMl!LbMQn;$VBsZupX`0S&Y
zslPn${6cXua;l|pPiMjKn4x#DZ+<kc(|<y0T<enbkReO0eFn^$XRB?`EtuZ=P4ba`
ziriV7TF&@akJgopRQuE>=55YeHu|RE&l<<2Zf+Sl^xW3tQ%qBG3;R4bCE~Bk6jg1;
z**OEkj)X2B8FV;g`NWblvjQ&}Ml@#Jm6GXmpIX-zc2`?SOF)=I-`J=BqO+MkBipEE
zwehFeGi&{Rjy0?sT`{a=$WyvMeI8PNSY2*V_#OYey>Y-Bvwh<lst+%iIMsjj28HVQ
z{tdqB<P)0mt;c1C=UaU@-rd!j)X)*I^+KyAf5Ln6yA|1&x67^`U!428JRu|Z{xRu#
zbwm5cnzN@LIl4G$zAWggu0!{(JsI=2#cdzt-(hjwmU~FPI`7P~0Hx!{s{1~PyV=lk
zpL1N!7*)sq9gAJs0@>ctc@?K}R-S45yDVVQ$B{3xr<2ahQmHk1zb~JUpz32@&i!C$
zkYmQvTh1xIK5tgL<YTkUer+QUDu#AyZ!H|Px#>XgEs?vH9kbuxRFSG#cW}{w=z@(m
zjoQ8RbXMW|)fWzEzWns`;*I`P*09i3dk)lodO6J@ORrP5D!xt(Yia*+)lPO@-q5Jd
zfxbFT^MU&|r{6A{RjWKCcc*MkJP~s1lg~G7Y@G4*;xn&z-kvo#?9=U!H`9)#R|{Gx
z$LyT@9?AUS<Cb^7Twq_SNE=~0v!0r<W96(9`^^n;RQAx>3v-tZiXZxepMT^~?LxLW
zRi8Z|ch1G;fRR>nLcJz3n;l~`Rkz+`j!3#Vx$VJS-+Z<C?wd0E&iU!~wy=d~j%O}=
z(I+$e?Dmg;Skv##M<*p7*&NuGcQhqPS*XfgJ9NPZDfxE>l}rk_Yw@uS{^jz~FI7ez
zANWk{=!OB2!%BY4E^G|Ee7R-N+sak+D^XLL{4TMpUQ_+FI$~r;$emr&-jfyXvGp(S
zpJntbG0Qr>IoA==ba+sHz-n3GxZEJBeDsCfnoZxCj)$z=B|DcLlid2UTpqAv`QXvZ
zBb9epTd$tnQsSfE_L#1!<E|f6nd;$A<@oZjAXQbLoF6kAvg9WU`e^Q}51#diD%d7h
z{?wKIX=lPcew!`+v-j_f2+qCY*EwLwM_vC=wkwvVZ1x)$uww7aZ{*(``-I}Yhy6<a
ztp2l)pRB6i>RWY%ottk~-IKX=aARKE0pGJfPnJ<_y4OdZn=o|0DzxO8nO6>9IB;)n
z_JFEfKUL(BBT3IQi-!1bvvr2b1})E3`_&E2{^9tJ8JACFuDR#)uy5KA%vQB$_p8rY
z8kX%ddP3OZeqY}<=GDAS{W70ke)WnWh}BPS8vGd(I8Cu=@OORz!N(rBCHq5J+w4I4
zi=~rqYTJ;#wOzR)MIqmFb#meG$e&-gZ2aCm`I~WFZ>8@4alIkL84;ShsCnqQCnHlA
z<%U1*+a|BiSB{_8pgwq*?bG<YkKA=(dDujKk)@(~afT{$(8Pz@3ass0Ux_pI4Nh6M
z)R{XuU`tS9bLF;}XMU(#dpt|=OKQWUk#tb`tS!2WiD|d^TBgmJIB;nB(a7)WK6`9r
z)=K@J?e8x6?uVI6Kb29Z`<8{4tV{jmwevXvjV&XGzoy)o@X%)qQ};Y|x<FBJvgBvq
z&C7=+e7ALJm^>$~R-G2s`Dow9T;GbLNjZ1O1D71{qg?sp^sjx|mFCAovJ_b@EvFuB
z+Pu5L-2b#+Sj&4Mju?eu;E9L=pPOan>Z^w}5y$^>;3N0_0e*k-smN@JZZPzl6d|vl
zbu!fVD{V;LuCkmRU2n~Gem(Qdiob`M-^|~2^!=(<`QUvY<fqkWl>XD}3P&_;X-kaQ
zlX_xZlx^Gi#LjmT%j|c4aw%Z@($<OQj_^lvhb?_5@8pi!SE8PXy6sBg#+M%&sOs8z
zB5d^FDF?UJ{`u?v<+=4qSwml+`O5szzYKkEW#BzCo__V6ZBN;9lDeK77WdN9-R+%+
zpY2>z_tS>Jg}au2=qp$0+xPTY*>LaQhHaNG>hhg&QZe+Q^5*Fq+!N(h)%i=;%!^(0
zU`E^>Ot?>j?_ZBUz5j(1Irmq!XUJd7yywuf&3>!CiTovhPsp^w16Q+?bZ<xW`zh~o
zYS-Gl@B21>+Liv?Yl@sX7d~WsWL0OMI2bn~+b8knumNR@ZOga)t1#z{kCp|d&3NYi
zA+iyV6a>u=Rt#)7?(?T9r`2mmt(V0-t`18%5n`+QHp}s``IqdU_FX!1UnXUHF|GLY
zv586NU5g($C3k!_F*Z|k#I->kRv5U)pW3O({`+lLq8@5}=Kg1s&RHurS2ska$ubx9
z)yq!#8;<2SH(XQ)`G=mF7Sh_LFof^k(X{f7x4*eG?K#Wb_T7KIoUTyI!){u=T(<cB
zJHDSWuTJT(wFWEXS3dFEwC~Zce%bN%iD!LZc(VHKlo7X<-*3A;Q`Qw>D?d>kqRQUc
zboJH#pGP0K-6lWetQ>d8zSHlFt9FI;+t(40G@w#B{)+X|vtu@X=l{`&59g*|T$g`A
zG1{?zKw;L(fx9Cbns>D9`P06)kIY@?^xr-5ji!pm;LGLH`V7eG%3sh~ogBA(P?Yki
zTc?~p_SnCwR`gT$tsAhWw(m2`C(UXc7`UnCit_8gtdW@yWZDia8*%mg@;Cnc_gOdH
zyYJMn+lr$P1l&@$-|uBV*=x-a?PqUp8I=21_1_~+15+2j@I>BQHI057pXfj9y?tM=
zJEIGx`vt`ee$Q9^<<no!O{fpvqWEC3I=pRW$oQ6TzZy1|dM<lW&|_oTe9z`r@9viy
zAnSblu~oOQ|7vLnd1ce#5%*ke*cqC?_Cox|SALo|<jZ%rB+KGc20rCK^`?x^-^$$k
zkCZi+tgjRf-rs*vb;|%dK*Yc8{hOBG{lerob|*(Ds`5@G`9`w3%Z-D-P9Cr5$d5TY
za(&C-8IFccmt-xw)Xn9}<{txZA3HPd4SAy3s7YxWER#QX#-)8ftB*`(*wXNQh&=Z_
zA6cgClOWmXE{oq8*}SdQqv(Rr6Md(bC7f#=e7C+Ozpf=O*uSPN_pD*?U6kTViTqVx
z|3CL}DcXF$yx3==CSs^s`CZFk-{6_gWm%&>YYM*q_T6stGhuT5SoK}Id~4fMXJ#rD
z`|A{)wS}wwYC3)IY)h?`RjpO`opB+lD^QlG54zggKF9xJ-+MJ~^I7%I`<YymI_~kx
zCqB$bQb!qMWD&b&Pkdh1e^;y~wr}5Ejo%GY7XK)p;82V|zVfM`RzCH(Lce^>O>I66
zog>yX_|0!uG`%CA(5{GkFHvzpzEa`8M&{oV<2#m$=#!~jf6#YR_Gm-1y|nYrfJWu#
zxl^OZPHuhY-oO5IZ$R_NVO{c3RPfHAh~W6({_XNHo$`k(VxJ3>k7<|BdQ3idnYu);
z9Cp!n+3V`mFK;^$JV7!3t~dTU^{bOnn|}yxb<W+~xayT4+0@6>_q5AaRs|L~to=?j
z-r<uuB!Bk4gvDbjqR;G~5)k6EV_V?L*VJvYm~W;pnnF)HXS$jf_HM=)#}xn7%HS12
zcU_P<-=F;a7g6KJ4Ih}Poio_~gOh<N$#=f8HNJdo%rX;ub8KPN_iNvOKW@{dIQ_Z6
zTN{@AE8c%*%(~aydEdT2enRW?@#Amy-?bz&u`&3^n0MdH?+B8)4(AP8Up!{D^48<(
z!VVw(pv=W*?&!bXXZ{{#VNB5CwQGN#?yD@1jqzWw?u#{h^JK>M8PnTt4a@4=@W8x<
z?eg+NWrJJtj;)pt37S6W$hw5Ami-^BmHSQ%Dj6Z~QatW7uhsh%90~H<(zJ1J_NDy`
z)w>MCHR?)J(%J^UICX^I-iHkJI)%EA?Wc$HyOhss)YZH08Fj$;>JMu#1x0ACsw>r5
zKI`j)nj2*Lm_SSBhEM3c(sv$QwPwUiO|u6D`Yib}sHsg>EDKDn=$jyuzoc0_>LX3v
zAelO|&&cpVeS@q?HpuOmKe)rM9CZHfO)mxxzZBQ8IWAHmlTWzd^ZB^IZ>!s1{b-${
z!_O>Jj_t}@@$AiwYvwj(%g4%;=9m@F%vQHv*f3^t{Kj|tn%jMDY3LK%rHJfQL_7N2
z(vZG*){Ml<>S+xR4jo$<dz(68@*tZ-R;+(GdGjFCiAlvjC{>;H=^=jau6EGXA^EaL
zuLSz*^-*-=t>)UTub$Id7pfiQ4@Cv~&;R++J|}$r%9Tv!wnvqH^Yq0v6IPeB$rdhM
z8Z=$6R8c<e;g9#(@Ap`1P-&*m_SYUC5aOfj@-3ba*sAyWEN^>oR^Q@srN2Wt=dyaW
zdWQ-?&TkKn^}91o-Q1uoQu~xPJi1ojcY3DJv|Y;4=NFb7_g#N<M`(hNzEfGyR=#ZI
z15?#I4}84y*yWwahd=qw`9Qf`mi`~!`Tc+UxxW2Ray9Z-mT^P-Uvg4xLVRrZ`+te?
zf1LmNT|N^-a*K1|MLY@~P^9$Jvx{^&lqM=VdS-l1baZZ6F8(1w8xu>FISqE!0v~1=
ztkKbVQ{f#wC?D`5UKMRHfvC&kveFsc6;-N)Hq%bpZltLxNSY=_<KI;itrq(N%1K*2
zZv?{2z0w<jRZiOMaU-xdFiwCu<dnR!EYOrPeN^7G>AD${G~6K){Gwbcr+8{v-qbRV
z3T#w5dPc?4u1OY_iAqUHOpS^~mlAPHRTC>1Q$1?A6S5%|{4;PR_jqV^qQzE8u}&js
z4`*4|PzI}Ol14*SFisQgoTP~XxuOjjs_U^277of$Rn$`@Oa<+9G2Nc(P(^ObLaLCq
zJ1y02y4%woYNo+zqHRFhxr3?>P-WI;u!8=}VI1{N=x&i3X9U4?be@lUJv_Xd49}^+
zc0>XR$%!hlFj`f<lcufpl7m2Q^vE1O!h??%`2#dJ<cif|r0pz?lnj3JJC_34pasq4
zs)u>(fZXP(@n?YW-EBSw-+_xm=s@r|cy57lrC$%m`C<|rFi8M6IDm`=3v?-dl*v8o
z!zJS5zmtBG4?aQc;EAGRnw(HGW^_<9AypfzjYGG`;o-~Jco0mBi%*M7qMV$7i1&5j
z2g+$I6-5Dlz(=2xG(e<vc9)YexjFx3h73-~V8Q6zBs`u$fl&ea1wPW`js)7^V{)s(
zUg<Veq60{lN;`fw%DNp6#_3X3(st;269SC1$;|}?EP4hHeW`G#m(VFBmDymlSb>Ux
z4^?$8e5{dyz7SZdl3`3dadZ)$shCe2T~UnF0-q3@q|_r-yhk?AQX|phby#YY$%)R!
zNq*Gw?S+q;?Iz)rmU#Bk0bf{Rc3UGU<eN0AmWE#{uKH4j!210Ud4J#D#&P8d!~5^_
zr|4zI5nzL`NLfxIMw(le<yhCsvM-5FHmhiKH-RSE5r9U}4N{El{p?Sj*E&^Q4S*Eo
z$vn4rCpH`1^?K^mdHtPYaisy2=&J{xc>}RKz9)#znbYvG2gctT<xr=wrP#ecmh(pw
z!lrZol|RV_;`z6ceQs--^$CPvxP$lj#j9sjQ1%JV_{nFV4aXU6>Q^O(=-54#VUI8#
z?Yw~aCkTOp-!SH94<cgrWHt}7%Js5vr~k5Ey=!oQ<@}_aVx1%yBSuY~*MML!t1w&&
z{O2V`mzvjMAlxQ>=T@zOHM!Ckp%MHIVrtxqVWYCD6O3`XsNcB-=lyPA(<FMq?O0V#
zFtUZBYax~lKEf)PxH1@%1wTrdN<;Bt@Rs0P<WFcVgFY~v1n1<~v9u0@T-EEda|uy{
zuH&z1l{v7tSfBC!Lr_h<EGd?$aQ|}bdxb$Zt_`SN26sW5PixqV2EsqqO^&q~Fk;0C
zGWERrXLt^DXCYLeSee)?HxxJg{M5Zz!Y)$C5)5n#Ri~?ybxQ#Z5E5EqAWQ+o8gBru
zz#n1ml&6OOC4sJP0Vu$TSUZw7%o9(viGdq!j@AyC(W$$4@}@p*FN;-4d*z<G0bNv6
zIz{USg0+#qI5KwAcdOWzxUmfdv_K$CUbT%}Hymy&hY{m7Oi-nS6cO`9jwrWY<_@A8
z*d4g;PAiOKxhzi{5yPZtS<KbJ%cC=@-j&ED=ptF^bx$3^7DF^)J<*uosarn?I|mF_
z$05G~E(06pcE91nO5tFWih|Tm%JYhXx|v7wS%6@zk}vDY`2uNSSuBCi`Ws#6CR5TL
z%eKJC_R8EHu(6i(+&Hx(7FS$TCw2X9geUul&b#^G6$Yr~Pp2ql4*B5o#dT;euEV`Y
zNU%)b(Zz+VqA4fAMiME`%J;xIG1Lfy6h{*F?mln}@6JWTi!_E{RN5PNM5YaINT*$<
z_SW&C1;u+^IFW2R${-X7<4pOmJ9<BX;A0}&OO7wER{TRj%w_Iay^zQ;Mt<|9;?~9;
zO}E-U79Asgph-vd5-CUYkK7$j#8)rA0bY)cLyUKhqs@MTJt%O6e<211{WkQUcYzbn
zAtcJbb*I6V%3k|NZ_I~qqfjWZ>)gLG&R*1ueF-+B)qxNxcj*B2FU*gl>|J?<3mw1p
z$CF3z;D<kce)5Rcj&?=9bUQgesk^QJzwX0_@X>DzxDSr#ocowq3R0EZf%XWaZ1LI^
znejKj-+T01*z}{{qj=6)0USPUI0IAa;iJQGAY{2eopkHy4o=yVdg0^_2Eag~J!GPV
zMSI~sXmH`O0SZ6DVciqQ-`sbn71k1Te-AT0Hgc6Lu1t8Pn<0ePjk0NV=2#t3Im+nG
z#BD5x4W76wZn02#448>~oA265?bv@cEh)ZM0!;zsk$DYF55s2Xa4G0rGtLIbop)(G
z?%~ocT%+-u>lNN=R8jIl26NEZKqPqAKcqPnv*melQo7SAc^BcQL81(ZACAH6dX0zK
zGrxF9B@)Sp5rBI46DvUGhX{C$J%^|DY*t^wTET7zt&-qE;oVKSx+te2KhXNB_=t=3
z0NYzR6*z}~;7$7H#9id?@V}-tKg!FQ6Cm`zs#E%=)Nf7;c>%;te#TNpp3D1gG58-`
zDg3WRHRES6NcyK<(fcd6Lq$vf)vj0gH3qxmKaT(Km?)4P{&5Tia;rbbc?F6CM&a%^
zC7KN`JS%&U(cM@;r9}KMdR>+f`Ryo&cwTz(v40WPj32)Enjd0LN_$y*IcY>Zm{xt9
zJ;uT4(Hk-8V)(eH{)IUpyxl0@Wmtg^BZ~Q0<%4GJSiaj<&nBQG-P=DuefjFy_b;3#
zj{}pxd7N<KDd$RO3R{QL4)C!k_L{=DS-?z_qJ+>p@`jux=8Jd}JqSqcGyLCu{NGRU
ze?Q0n{RIE_Kk<KmL$5m3)BW>*@qd3iYmewZ&g4JblU$zA`}ElW|96Q0`xE}}FZjQ&
z@qgdYOZ3G9{NEA&@0k8~O#eF$=m-wlb1LB=GbQH8r+r$^s(Hn+_gE4V*Tnq~WGgss
zQ?KDHOZc$}_LAAr221&5A1@7et2;r+-SYofgD~cn@eb|f-$cB<lMhZH=WC?DoS0vV
z$vX^tHb0;GpD}sx)G31I=Y{`yQC>nQyZLeDf1DI6M;B)$A58O7>t8x|`tUztewasR
z-nsDaTsUD2FQf2{zeTf{70tQ%dC&h03rbS*yjZ=<U)yzlGo*!<&+hooiY4Hg)=RhS
zuX&UBlX3Q)J9D)g*a&kRxp#XAkv+IE^Acr*a>$v3{7@8PE}WS?HkS#$C-MD`2=ID^
z$Z3c_cibNP0Ht8z#O)O>59UQ=Ub2cvgW1sEfJ&!RQhkjERI>OaKXC?!eC+PT^^&6A
zL8SqieeU|C>)KtRFEj_S0u|hkibqk28XB$<em?>YT@q9{X+>qk^1WLSRI#yN>Tj66
z@|l<-RA>g2yOn>xe^RxyBBR`A3X0yJ|Fc}xjb=E~@$^gU7^Tp|U7-iB1_cK^*c{H*
z<B>ZhvUdNXnEK4EBIO3TdBZy6Z%)UYyer#=h0ni86TsZzCBQyK#n`+|;>krxa_fTk
z5wCR?Yw??``NtYqw|r&S-G7*4SrW{%Yr?HrAal-S1Yv8G*X27)4^X6YxA$Tof-4Bu
z^Yv?`z1^BQNH_D)wlmGa0JngXL}sYEiCb0Lmc42u>F6k<%MFzKNeKr#^?fv|FOs8r
z0|wDIsy{!b7Wg!qB(O~@2vkhl3~CHYp)AUuRx31Br3Z%$1;j-Bcr5hVs9k{HrOTYG
zQmgd>Z}tWX20L=VBtR#Nqgl;cH*iexg~LXTvjs>Y0a42==$7Z<9E*Z!PHTHk2OZPy
z{IW-ra@zXRw?l^!6nv7CDi{p%G2*GoWknn2yqs1=3*LZ`6){t$^mgUY4KD#2mZlw!
z&E{q_HjS8RUo~wxXCCnQ)stt>vVrKa!dCp<jEW1Hf{3F2@H?mL_};@G5AKp?#LXP^
zH}l0GhBT8?lw>2Og^9N!g(=0*uc07T<PY;Z#jO6@;^6S!-W~sNPaghlZ_m8?w?F*O
zJwLenx4U2bA^hO=Yxf2H2~E9uV}5%0@HPJxyy6Z~AYjq4_IC@K7>WfSYG&hd8vOxd
zHDB(mr8|F=jGXw<T|f20iQQ!MM#f%DfH29>e&#6f-0io#E+cTq-~{aFj;Xxo`*%(w
zpq;w=Ub(?jq82<JEcJILgj!#)5BK2z#&_|55573~68_`hi}Asi<^G}j@4MrB@bu{c
z{P+9QQ~cNcFB7ZBnX9y90WT8y^ZaTFr)WSU-{0qv4?*1}IiX&+m>XN@LE!Xs@J9wm
zj4~smmgH3Ra6h739w&(*F!1IaTq$<=a(_Ga)v$sWm^w;iWI=v=Wg5gjcW5t65KZx2
zM=Yi-QrS;e$RS&khc~SnRMue;+)~Y#HDu%g_(kSzF`?aXe7N`M&y)rX6nlKNEMr5A
zYOg50UAYfA{SSP_Q&nQETY^krAgyIyd1G!*38>J|5qV8G3wc^2^9D496<EUX9b+}o
zgk<T^amU$Az6NFBip_^$@PdzpiJRA0nk!fq#hY$_;$&-1D{j)W!2D?KiG(@9o3O5u
zWzmRtOfdt%z>gP{@pzD{1+*4=n}v6y)ABN)N6je!O*Nr4;~6|aT@cIa0bSu_v}BV$
z5yW;RJtT34Vb?c&r6zskO9km?Qg;a7L4yN4B%FR+F0|G0U?htgx39LS5`R3Q5ue~e
zs3EJpK-3txciSs3!h81)f*ANa9@{wrX&$Y*j(AojNb|JNfc0_Gh&EBcv4Heu{D{W*
zm06<RaW*heG$z4NX}%|qz|sSMkF&38;JP{&dBJ}%FTjxjyp|02WSKh3qIuwZ4R8!-
zn-|gVn4KDGdIMsg`+%~8{*3%|R-?OXA1hG}bJ}mvmYyLSDvJgkOegDVHjN!gOxfs_
zLrGlCF4{3$;6ZZZrbn3=dPrf72Lo0HWL$igHAm?1fDCQ#7K2pr@wwbrL!9_4PnmY&
z?o<O<f!iLRBJEBIvm{c&&>8$7v-(n3Q`65au1lz`<%5n+Hp~$m$Q!lLc1_lA_n&CL
zvJN@y8+gS4h+<wWs^xm-E~=q%$QoBRvLYvZCx3jBb^5+P{=M(r{SowkEVSG?#DPZ;
zU<W`dbxZ5k1znKrk;UkPw$1|P7WjghFJdqL(rO6G;AB=$-oZ|-ic7~j=k@9eg&_8y
zyDi-pl?cvzp*$VkVj`S3pecIv7c^5l*3g!Xy9B>=!Zg}MPOez|g}G|ckcL?n3-jns
zL)e6cXuYOmAZl49KKI=PH_I)H{bTrzv23IB8PQ50BcBv~nI2wrt#O9)nm_*G8851L
z%qqUa*$So(?r!MM-D)0X$-14B1YlUUJx>tZ10DxhV0r})7iap{3(~a|G6NA+#19Nx
zUIQLL*(8pIJr{B?zODs12B9H<mZVdZ2zfgk17n?re<j(NgIgNgZ@s{)m|kxf*rCO{
z1i2Z@7!ntw?WI;o?=L?^1mCGA72!7#^YO?M!j15676UL?$}JT1N--elXcuk?CVSQs
zSkTD@{>9%QfR;rf5;uyG9>Ak(h#IQbMA%1uAZ@JVMo2CwDQxNp9R#43x%-gFi(IK|
zv>?n&z%!|uInyun?A^9P7)n--;-`f6CM!k`NOB#y;Wj0B+yDX&+{U>h+T}USVg+Fc
zdD%|fxNLj+CXj(fO`r>kJXB<e!nGfVPGKb)G)06r8MrQp4<hRzMR`oPpX^L&d^m_}
z>a18HpWs(t?;&!Ax4U>bO$-}qD`)`(2stCM1zrnY&=hO`on`I63$GS1#50;0u{VXN
zDXf1^c8KjFNa{%{c(y<#wVJrwX$9b8lL8K?zlTu4=m^KIZ{rLM2v9$TRarMOT{T{k
ze9r9pycS1cVjccq*WnN0702{sBxye3B$f`GxHlWdY+a>&ijbq8A9NKHx9cQRk`{~e
zqEQkAldJ(Ab9hH1RCqE3*)j*Kjoe}*SZ7BxprnFwph0))m?Slz$%+{gjF%aF08B%1
zgih|FA>eUrg4;|iX&5X9d;hK?B^BaVgXjqkJJS9`haJ_1BYLO0aO$X&k$SfQM|_Ao
z0N&4#BnfAa<!)3w?}6eOhXJ54^`tIW6CZ1N&nTTNv$!7DZ4Iz76FOf6CUa7@mu0zN
zxephW*sgASi+0DhnuDsi0Pf^C@f@Azx^#K5T+S+%i)3Og!c$@d8g$okpbP(4ll$QW
z1QG8p^PwhYjH@+DO;6|vKoKDd5ikpFMDJQMedr(%z-Q?Q76N3@WT>z6u)<NZb<iD$
zre4r7MaRIHjhGze0ffDBycwKJIYi{}U4^G4XqW}+Q6{iXL>APla7?8m12>1mXF`iP
z9S|AYbf_Vrw&0=l53}(?%oq1U8oCGO3qHt^-Qv$ajKNKfg2d?VM)8)(#5M2PIQf9!
z?6CDrS`e)}_DGL7ioiVRi<x*Vj##|GNGL_~Xc7ClbBrnr8_ov!P?q}+VdIgpk@$-k
zm(Wz>xw~?Lu)U#LVgJoN${##<m_x7)+w)+&@Fx$kF~K7+L+{)O0)x8Bk<J~ZAD&$Y
z_mQW+UbyvZ4745COx+A1grw00>D(A!*qieUy*ZzU`=Xb?i~^5b>kY)0PWd*7wo${M
zIIMp%A(!Ea=bTOE7XgixWPHL_yQBQlkMYakPWy_mw!GiPs6cqSWlSUV#wz%ozt5$m
zSAhpDjO!unR2CMxTTganxAGVx_S(dV<?`^2d1$Bv?i8?-3CbcZ6f)0F^hOpR4GjcD
z^t@?)Q5Ct@=74E)gSZk46}FX>_@a7Uy)l+wfHQN;L<^V|q>$5_XI!-XE$9vHpdD31
z73K!7wkUrT#qK$&3Dno@jzljpr(}Ik87JGSRW~M_KLL})NSD7*@U+v*$U442-_ptg
zoaM{)YU$J<a9#V`o<sU*SZ>wEFO0D3I{rKO#1j&4reD0?dtqhXZKN}{q+=M0H^g?R
zVuq?#BP8MGtm*_RjBHvpk$)E8)+qiyTt185>Jv7Ns40Tx)55V(-5ao7z^Ma^vX4h5
zVl?eLg-3uIQ!^CDs5F~lxGJ_sG9wUeJSVs71gUBXg-r|?&rmHKF;r~#w4duutY4DC
z%H|1-XLP5tY&&1l*+dZzmR`OeWmkwt3CAe7$Xy$!?t8hy`A>6si(UtJZw_%7Jq<Ns
zLrtQgfnZ`H^&2rco<t(WAhVX2X?e0%@#H8b3Zs9h_A%63%(A1-txaPWKU@}bBL4lY
z8|(PJiHpHI+wBp=7IwIo_0UDk3mO{bd++y#h8=U5jrL^DdSaar-gQj@ubw^q3p2t9
zz_mM1D`eQlB2J3l(;a!KN}gYYlIItDk6sBJXv$@#mIzdVF(lYWT!O2dA`cW&6wD?x
zJz@%A({jW9p=dxdaU*;(mOy@u7jSB$N()Xf6WLyDIaXK3#pGZLT_qB*3Rc`zQ~M&;
z)V@GX?R>p>*F<_6+%oG$)dp5Xi6KYaS!CPfJe)ua>@tE_H1`)mx3k(B1cTXip+gd2
z^V6$s1(F<dZI8q(W)SwhcOo&Ga$Zg9S-tSr84U(5w4V^V^)=jPN9Hzr^Ghi8ct2%1
zU$$3fyqrL>))=p&BO68mWH~F(ikWpBAmlsd712NlkvoT^S_ZE!7WLw4Ua!r8$=I!~
z+sPUtd?4<}l%*+YVR_u3iD5(oXsp#dR&labIVs6N%Dq^Rrq`=j?V%ZU+@^%vo7Z6|
zqL-y38~3rzW5Xs#xN;;kgLi?eMKCBn5!V7`UpfzJ_IE2*t+0f}ynql{&YQxhZb!)x
zxIR~{fDOzf<ipmRfELjt7q%($f8v)@qWH{Ur!+)UEQ1_ol2PV;X39Mwju#V-+!Axr
z5Q-RFj)TF&sc~qK6agGD$=R@pM-+V`b`?A$u2nFPu_`iSQ#r=5z+-pyp<s5V@dU~(
z4r6X{xcBHQa0hvAL8L%FqKZ;Gn~49pnfp{cVDW{2UqgrrJtO|?(pzwL@rNiTg??r7
z3zSO<mZnUt>6#GWNlDjX`EHOeKrfCnOl$P?QrqtDa)H@6hDAK(p6DIb#!lC>j0{W2
zsc~MYF&cA2#FkSnAt^OA7_;W3`f32M9$4+kBRYyWMzCL>Ji>$u{M!K5TQqyL+)+#>
zPb;Bme_=K4FRXb+Na0>g3itLNd2?vO$cN6zhEVV!q0(GvY+wid*k-8F8P?ZW4YxGq
zMQ_flnU$wb&vA@}!m{*53t-Q$Qr<tjOP+;NJVS1^PQddI-*ReI7wSGiEp9N_U7USI
zwAi$$O5q#)cK#E*I<l|2r@v(X#vkB&pm25Hb5DN>X;7z!g)t~KvTL`wZ*Bx@w=u>E
zzu;tz^lMFlHI(;UOhKiTyl2KRcf#x$c>7MH57nzo!Cic#&b@686qg0&iHi*soEhql
z5R)BfXT@c46*Y8PUV3A2rzIQ)+E_U;ka#;<;IDFHUb)j?x)Oe>acC(5!Vp@%k^`wr
zs$=*VB8~k)cP@Gp-H(Lq-d$X+4ukuED~yCMt{sg@#a2+6<WTSm{XFhn@E0^kc}EtA
z_B{wDFor14Gw8Z4VPFN^k=SF~*oB~sL~?k;v^xaU<jZnJr9H%3bWTBQfxc7a5A%Ec
zpYAevUA=J+s?QEa`Qcqd<ltOX58XXA1UcF}ygS1EsG(56=_%x?dcWW6FXUBqe|eRn
zQoU)R?}s)fUVv#na2?%K$b1g}YY6{=BV{{!3npyXslFfOS8j6d=l5o2ZhP^<j*E4K
zil)f`yRxC`oeoC%KdFy@hTTlACNmZR+`i0J^y%wx6!&IE@XsixJ2np*8c0|OZ)6}0
z&7~WSggNlnS+A*3jSrEHaO7V37<R(uU&2n<UBf=hMzDNc`$l-kGi&Y$zPy&vqv<hv
zU_#@qTRx6I#Hg_QvKx6RHY$LK^@N4PSE|MbV)XHOnb7nzcVktj7+eXL7bc<7UmTxE
ziL59BQV6a(EaiY=C|cn-Rpo>blC>VtV7mgawvUp?28lTM%8Wr@#5ibaDSVygBR#-v
zVm|!|I>AKX{+E8qU-Mi3*_*VyuF?4CsA51sXT1sqW&)VGtn<@ZaZ#@lQBYsl8}*CC
zo$6yk{e_8)G3)FoW3J#4(dZ!`ecB07)o@hu<4UGDz88c_N71#LB3YxhAWju?O-%4e
zZd}uM6+1#~BIKGEg$2IX<#<LiOF$Kju@z9otge?NvQ>+PDkoZ&41)1FZz=eU6VfRJ
z3y&nF3bb|?D9tQ*#LLdM`N;H<iAU1fDPVv!D!bF65*Abm^8r-GUXoF$v*-78iJ%!{
zpq^cH*!Y)VF~9LaJD~b|a|1U&C&>{l=X|MaDqEyfwHwEs<OAm2*Q}p}DK)$nN&V9=
z1w&VeIo}!*i!5Yk0l|z|y_K^{#L~R0mP?M+pk%A}R)+P20IxqtGdLZv;SrC+nV`V0
zgozejlDsK>qh9vY1D`bCi7_9llf&d1u{{tS*hS-$Yj{TJvSAW@CZ!!AXxz23C_!an
zsG-fK0Wt_=w!9rSDhkX(?I*!mG;x6lD#Uh$YFgFvhUI{%l6#rLE^t2+<b(g!hovp*
z%Pq^NN(Pn%HEUU6@z!dU4{*RkwxL8ui~I2<?6^1t&8U4pvRlZ8c5Vo~Jn)79!`p)l
zP8=s+<)jsrIRe2|6H6QNN<_$vJ<-_UYE13H(_rol6;Lp-NSs|@ar6;SXi=mK2eIVN
znWPMMg53Ct(;&mbppcX$BTv~P$ci36eY2YZ?U?BuU(q;rS`r3|z#JF!Xlt$+-Z!mD
zI$^5=>8<D&e!t{Q7RtbK#EfY>Y-A+JCHo>M=}lWM6~nPTuU6qJl&_ytGDJzX%OrgO
zq(UIy!Za?Nc#N$bm^7U7(Ef3cM&gc1v?Olb%$g--av+&7=W@z9kb;2%Z8{n<9inN}
z{0;M`4j;N^>AD}7F%L)4<HPjhdkodX-B+i0hY#!kG{MM^K_BTbhGbj7f|`RNt^zkn
zXJZf!8nHR<YBSmu!Fhz84S_Aj-{X6!2F_9q`1O?)mMxYK{qNy^hR?N|@Z<cma53Z~
zU4@V+UPunE9(ACGHR9CHDvHXWz&GJ1Wn?$>)(*UvYRrT-HYsFQl<LU|*a)^zV3Y%7
zwqaRhNlyCX=g=$lP2As3E;2HNOPjDb1S_Ez3wk^*s-^<2804>%f^~zqSl(FJqp#tN
z!!b)LDsllM#t$g^v0M((1_YUCrZBF1?)Zm+8laM-wqaAIIK15u!?9{Zra}US{r*_C
zB2wI~E==SohFSOW5yxa;77MAd5@qJ)B-1UyRbd$F$qImVP~y1K8kkz4b;Q1DOmM5!
zx1eKV`oUSEd1!@`lvvtudY==y^0mNMXqv?m2q%WO`Z#eLK7^_2Zj&X~^Lxifz<*57
z5e^B(7k(`az+v1@>oHoCmonp~tx51?lPnkv<kvW8uV*5-fj7IHfw0kX465@&v|@SE
ztDx&=5(JuXEWqPmVo7+%>y1zMTe;l?RXG0lNZ*tM&4paDFuad`1D@LZ&ir@8h3#;{
zO9#Qgy1f6!^M7cDHRv1FaNCu^{rcD3r5nEa5CPDTQK=BV?Si`DUE_JSUB;wgU9TDt
zS2abNj0ub2Ak#E_v>K=L166WHAcHYrCb<9^smAL?Lp}1sq$IsLd1IaS-B-<~yDGZp
zcDbtH6}+gfaY^0!UDAYecw2R5vHfZxRZN_BeYZ<|q1fCTx=ra`!5}WpuJ_}-!Np>9
z!7pQ7@Jpu)$_?-YVyHkF??isFX;zYJ-L}w%f|Y2$MCViEVYn$6%LgTJP?G@iV#5hu
zFP~%SW`F3OnHt|Cmb%!#*ykwyCL9QbRta`$>>N&H9Y+fE@8U)K-QFV#!2jBWG6YK%
z$LA}A9UIsb3xq9gYTr0M4+10@^%}$B>>2l-i1ek2)EZu!ulro|Z|q{9=A2VFN_VH1
zH$mPAh%RMDCBht1R^)ruihPf)$OdJET*)@IfyaS}*8~gG$qz6QcLY1rALnsk`=@MP
zwHfwgN*K$i+AS5v1z??mC>GjAjeNo6wzy&P%=ZAVU<cNQf*cgU@~<fC3Ylfx<VHG=
zQ#7K)qsT~ffA5hAuZZG5VL$}hVO1#uKGL}&i9o?-5(L%zN5)M5b7-Xh*}_x!4+u)a
z|4j%B{%?&&*C*&`Q&i>Je2by|V;kJ>e}jLYR10@i1mj)n6Q3a<0WLoWoXq_R?GI8G
zrC~SggjV>4WUVcx9q_4*yBwz|9c4R`hdGn?=tJe^7NlkiEA7T!9>ur9wVCk|r{$Wh
z+uBMu+jtBKbH(b+lI$p>1TYR%L4d@%^+*{=6AYCx3Jlkh(YVN_)v82*MP=j{)Q?P?
zv&*l&a2ljU!IPBI2~!8p`^xdjZo+5MX?Ne!#C>IVt8!LwsP@K>5ADZ?^s!?+XNb48
z@ymPm%X@~)vO{X(L;*rU*LG6Pd|{iBpu8XZ)&$+Y_~X1<tao1y{~d6mnw+@TofJ2K
zX?PS9wzMLAqB$F(6!}xp6B?f#if)g{nB8GwiPB40B9)(=vTs97IpUcrDBGDuvTT6V
zt+L&zH4ae!iM#YmdzVt~-;f2_s+CYM4M&pzIuL9Dl}6(axxxj6@D&(_n-cUkPemOh
z1J-<CIz#D!1e8Qz8xM9-o7l4)QQoIzHsGwy9m3BDcL3fYi5-g%y@#3Mt%z+?L%dZu
z77*|k8ion@?ZE=DfXk6^UY)Cb1opQI(ooM!!BULipic+GJo;yUKiG`BqJeTU&cJ;#
z%HI!z51^T76A$=1`Rx4&-U>fEgWR4bf1fXB>&BQ(8}iV*_Zhr!bTXPa&7Qj6q0@XY
zp{AYa;M;I5j0s@c&y-&C>&J)4XBX!u_=>j+beGHcPX-t&i|9t~LpXkrZw6+DibFIv
zHH2|C5iDLjAf8URFtoTE7UnSAMYEurcky2M9UodtHSRkFNa)=_{?4v`=Q~WTn0DqH
z_WXWyH8L}m7AVXQtsT8%_{sg(FP$Z)>_82orZCq2Hrxz$Z=+`_KOq@An)t;wvgrr~
zf&HXY2%GESIXS~>7<6p5E0q#Z0|BTbHtV=U4J-T4;n0|*xCu=SU|TOj4^<KzDVXNE
z6@myOj2UCg6t-nUclHdz+cs7>>?<Sxy{HA<v1pJ?97e=pXr#X1kF&i{0(k6Yr|*|)
zFt-Z4&2jU=WGR{J0ZI>?<U(WoOvX4Urd-}eHbGH52hIAV1=KeDl|TGcf8}f3$yveY
zpX&?L>H?wZ^xIGTxAk;AtB2M&_n-QsK(toW@KHv!Lj2(U2p8p9!GSpJ7Q#s{xM+*u
zKw)Y!YbO>x%HnNg0>sggAp)i4&`M-{oq8OYbYvgqkeDg4k3_1nc}UuC0)T1``~1(r
z{@w9?B~g$hHAc81U=ziKCJ2I6UANu1VQ`Yes#|dEq6x0yBLBo)7Y`r0|Ja8D2Iu3`
zSzWIN#pfr(Pfvp204e#_%9&Y}fF?QR{I^^-pVoT?Wo#NGLx9+?$T@IXKy@9GgR2GV
za94q4>wcWtgyQ~7uNkC|#xV{jp+0yEKrrpN!UR6ldJ<vHi7-M!QGih8v%C&9C~GDl
zX5nEhiH$x5cy=(FFdFZ}hl0i{FyL;x-FQQ+Ow5UALigCbh&o1jCR%o+mD~gwRfw(`
zShd2S^Uh)7kxa*d@^6)Xc|#(QxbztqJijOGr+groWC9WuK}e~~km{0XizgA}6T^l;
ztPjIV#leyUe2=#c$vjtT`9UXv#;wrz?u@#lbcJw5X#Hl~F!C?bJK2Eo5W2%h7NcQ-
zT$;;&iD#~hs_H1|qN>-;448nsv(a46!y)<*KLSPI<LKRb(xIX<e?lI<Vvyo*Ws1`X
z-|dzE*u&_3LICUXxdhr`5IGy5Dj|Q_!Xyy~f}pWDj%10&6l>ZXAbT2r)hKeAu)V#z
zdk-H95U5Fbp&&XXVA5?R#o+FnZfINk+BK!m8S_W?B6I(TXj5o5W#k7xYt{Ryt^fPb
zy2`Y01w=TW6%sI6_8#e=<rT6@Wgc)PAPfguCFxX?5U)ta!Hp&d`zkzn1*H*(nApjd
z6kbYNGOnSZMaer=Z*EZOD(DFTLlnFVp%8)aX6;_iD(~K`+{>;>gpUoCNIDR)=MyWp
zK{@DI!7?koc0%l2(D)6l6dXFVTMG}hiRgN|7hg~J!0|%1r~bRCYn?I|lcVl}LIW_?
zmK<}MMZlJyF<}z6$y9_LGe_OgaU0Yfi||k)nvJ3E4TZO}e^=@}Kp8MFcdXXIS@LH@
z50$rM>D@`v`^KA-+0oxMQroo0OQ#LNP06@UO#NAPYNBM~3o#F5`lGD&#NE?6YuwU2
zJIJagIXrf=UT1W>rwhcRO?1{7tfVu@%(zYd6r9Eg%fCNaYt|u~j7b2@jM0Img+v$u
z#2HE$^mr$O&;izbJiHsKxOnIf?%G!*1Tpyv7(CoNd&OR-75B`)1EW5;+j+<R#O5h1
zZ3l1p?)V)#0MT2%pk3cv0O_qSb^1G?P{&~U{7#U2Id~S-f>jL;U-dbZQ_#`Mz_zC~
zSKPJ`7Psp1VT#oKI7R9{r$~A0c!$49S*x@Ooq1i=1kMepmKVA<)U)C5!ayDs$<v^t
zcWy<a-l?D(-)AJw%n2B#>-tCuHXX5fkLDW4S3X>AH%ZGZdF<;1GdwKpbF$ihuU7jG
z7EEN<Ctc6Dki-WN2{ym6n7Te;JV3+bVq}bPa&pxIVz-4vj?&o>T!OGDsXYwJgHXTB
zltIG^<k(su9@!zZHjUKW*P_G{ilMuIGO6G~aC`KHl(Qq`d>pR`h6|fg40f8BxypN=
z9oRSR{V>-$accf)U-!H{ibf<>2=FsVE#p;rhNzK<<UEqH(Tjax7A&3NHE_V0qKNbw
zHVf!vjVxdwr|Q)Gt7Jrg)nc_09TaSuW5p83f?*YV=e0X4duH3sit+Fm7nYq2;n>A$
z!bI0b3xNe1PT8=5Xv;Wg@4_T@RdRx0(6KE;-#UJH<>eTxL<^fAe<MyAifhPpuETL2
zp2sia^Z4c7qaSE2sEZo@CudW}3UEry@mRDcWu0Si-GdROo&i1*=DeL(XRvb1RaFB3
zeRwZQS=2(}|F+pHyk+Ad7secqgA$zdM^J;4FGj4z`Wt#HA0Xdg`}2R=P*g5)F5q$$
z^JZ<ppbL2Q)vpT|5VKd0$ad!5NL&bX6Ne@>dF?;-t;|?vRst+y@Z~8flMz>9A2tTm
z0cuI`K|mD0i;3cQj!EOTJ~4p+;pNyHC!nrUgB6%dn!T}16!z;t(i*X;qLox>1{@^)
z$$t}}$cvd{!8xP&Ias#MZ`>xzb{gkI(i?LPf!fueYOI2-iH*UGO(tU;@uI;lKiOcE
z*VsA+g5i(91aUC>BSqC94*O3uo^nZl|H4hU2XFWT?P)96YC7HO=MAY?KU3U|jzPK#
zBDyK)#v+^r?iIqp#E~*b#A1G26w$SR0B8#C--l}Pm{KJWGDlqMo&l`M>WZMV-j!lP
zhZd}@gewHeZ-*)mJnkI@;wa-7wjeqPZh!EyyYQ+7;Y=~sM7IaiG#-;w+f~@?D7Qca
zmHiy(4D(tqN>h<d3gtlZfUUlK00R_6RJ4U6qab{2k6DkAr5yfQL!=y7`@g}ESE?D<
zDYo~MBgVnO5QcqrL{JKQS9?b}fHWL{|MdNEl)t`r7hX8Lca(o|KmTPzfc?g>`WE{8
zMV__3WB&;0$c@728TkQZ(mE2>mk#lztKg+W;=%e7qD&kZg#}&GuU*sd@qusb-W&Az
zzPB#ld#kW9oxgwb1w3$zVVnQLZIt;8mbZ<=;yK&>)Q4XXK}$6=;2b{RBSCu_JrhQC
zL?A<yFW!lL*@it-HK7+ZKp-*{JL@31_m(4qAn1#_qFkVn)TO2Q#Umz@e>CPS^5J$n
z-UM4jt4rfA7UU7Lg&5maQOz)=hTyyE)rj!LO`T7?G#JQlpYD^EF#w}W`1kQ8{QEdu
zJc7Urmw+X+?fE`Iz+{NK>=v&Hqrp4)QwowOpO6hE%I;HvTiw+D3ml=8&Izl=i2*kP
zt0CQ!_&zjBs)E{pJ1VU2YY#q6tFoia?I*_mh~diD*GP}tP2OOCA|rK@7_ffYfelER
z8~qV*RCn1OxMd&2sZ{Zv#WE2zv&V%}_E3QG80HrbfY>k}2wI^eAOp(NU%=)9YuyYk
zM#*or2A9#(Z02AxGlyd_)UdDq=YC2?x)YHk2>Mk3iEikx|Ee3LtUqytvr!Gq{%%NW
zHJPli&br=Rf#CEfsu~IRGA`aPeu1+7g+Cp1zLQlCi#qwyYCND;jS!J))9~&@MINQt
zJXVk3clM%pq>g>=UwQpHdgqN86o#8A>~zo>!L=tEMsq8PaUo=&Q1t4Ppb7OE_DLoZ
zd7rR{M>h9p2>@`2y2c4^X2)4=8+eG`4*z5%E=N6XNc0#lxQ0}aVt!Jct({s@CQ6iY
zDih#%lpRs*l>T#YHXOen6c)`2E``f_J)0tAA3@8TH8PMy;!XmQhTBmI7r<>Q9zX%o
z+GTBVmGKA4)JEJ;fJNR%Tx2z(v{=uGC!qzBsIl5|rBmf1+UTmB*USyNOV6u*<_D`u
zDrwpl^bev{dket_iVwlJPQfMKD&q2-$A@NLU+WEC;iBLACLK>YFVW8{Ckmkhn%L%p
zj9s?;C07+Di>oQ`r1i_(%1_>rHl$fB?(GnQ>^ML?T`}fZjw$d0QR<DLi;`mGbo6Ae
zDil9>f`<mv%S`!1GwR%(HH?#6Tro0!wV?BaWPSqJiLTGAJ5o;d1j;nc;oWdvESKd%
z!7xoR8aksRMr&)&V_X~%Gr%6pbRG&zrmXG}mt>+NPlZ%d3#y<qWP{Ae13~^Mvj=9!
z=+rD=5K4q{m5Hl}0y%WiLkk)A2(f)bt72#ZtBq_7J~_-kMZF}7^t8GP1|?IxT%p04
z62km`cqCsX`sKjsavC;|aU;?}?=VG`F_P~eV#)UpM)LjIXT&6&1jaIx$f2<Y8vR*P
z-Bt2Dp^RTZNT=5jD?Ke&ED2z@D_8X4&sZ@pkYmiPhp6>X5~)c|B9*?G8b2B_{6x|j
zit&dp!jH6_FoC~Qi{%%}aO_B<Z^D=|lkgCP$ZMsqd@$sK)6=U|4!*`QG_if)H1~OD
z+gjOSB<;8upNuEt4;Ybe;x<M`R*&0QDQ@ZLT1$p_ND}LmZtxnd4N&Ugax3r9=^?QI
zlhT6@ON|1n-)CGtv5ATphO&Z(AnjoTx!zuAOSD!Esvl13UcYY2MRcf`ps5g`6$Avn
zSo?Rgsib0@h3Ri=Do?*K75t#tpjbd+79<r|y%>Q8Fvb>K2LhEX0tZF0lZ4ShfaS>C
z;N|tIWE=>M9bYKK0dI?SaD1)d9MYWLgpIHj+Cqzi=z~BoEf>p#$JmGnKPVO#|3SA}
zlgN5MXhHypmT<kt`MM-ttjesD-W=!<WZCi@cWD6C!|d)+Y*-JoTHml)Jj!+TXChUT
zi47BKHM8Y6qErTYNnOkK6Q3P1%1lm`?TIUWOd+&hVO4A<CEH^JEi#kHi(S$;1vQOx
ztl?02(+Ug{^v<Y1pI|_9#IFL)?kEE)!}wGv!tO3p3Y7)H^S$GKHYN~)dDmEt6Q@4U
zM91@GtQgqN&fU{?G<!;N4*(Qp0mx5ej!0+)4eC>%;E9S)JmR2UkD&>qPt7r8d5SXg
zy0%Wu&y(y}hDkEkPzqUrm9W5!{fT;8vI<Q$of`bM<O}la+dAHsA?PTKnhSdC&lU_d
ze{yGduX-q&rzEdPY#9`z{KR0z=`Uya%Lvl4Qa?ku6|d*P=x}teD-FP<P^N5O^Mc@@
zDBxO29pIx3?{m#DsdvaDoXeBP&!1Zd#}AKRKK}0M@za;DY%<*G;9i)_SUkMv=J(J?
zlMUS8Ukp1hd|`hc<@bj@Kd&Hf>)@{c`2c>Fm^b|04uF3@v|~K$A0zIAM4ROUI1g?K
zhx%Q5=%YN}{+*lCDF6L%(|7mt{P*&Sd)ZE<cz7S@8Gmw^=l24=;iZ8pQg4fogYQGw
z-L>Azvr~<^T|qQcX@f`%Bg&-qfjeQ~8Y~Hnxvzg8h}|hpEnz^OnHgMLkVC*`#2}og
z+GWB;s9F&mO{lz3hSk4E-X!QNkK-e8+MtRx!J16Kdi{kY0QxhPB{_J%-C1jRa7rkT
z*eILAH_F3l%jXW-1PqfvyLRd;Kplx9f4<y%^k)xr@^am+dYp0LHOHu<O1H);i5g5?
zb_hbJ&Ol}_Y$CO%PxKl9XcL*pT8!AYNIZzeQ9u%R60*gkB$L*SrYb39hi{n1uxNIQ
z(ep(RGDdX$2C=&E4`fz{l?=p79lyzMgN+@>7J9Lv_4o06ci!LO@Hmnqg#G0ZIJIa8
z?}uUIL0mA6`2A<<l}-%_Y(2IhQ;aLeO~miIf%!MPW08>@c97gQkNhAD-%h=2=9v>5
zCa=GfIffy8OYII3nGd;cxg{ik5tPzreyTytAZ$TY2j!$BK|pYbNHT@WXh`W-WgFt2
zGtzI^2x>eU$07hmLO;GP5+PHI3{NKwJAyG_MDOU9Yf6Ls9kxg;7AhJp7>_&Qe`Tz^
z^%BXH0R&ln=uzdEIU9)kuyt7lvx$VD8RE8wHZ0GSrCt|oVYEcoJN1Q$F7b47C~^qM
z&F;2#v>1n_K&>4;iCkF7T1BoNUVV0;w$%5ZUG>2oVx%yj<Vor~s2Z%52f@kZqN{Fq
zD>_R3VS2&Qmo$~56QM9#by$MO7YWZ88(e)T^Sn8iyhBv*<D^`3*+dbAzuSBC6w(dy
zZ=pIRdh~*;Moxj;I1s{jQcj_m7GigygfEv4*;+8kh;Mp~cOuc43--c@MAxy^AJzL{
zv@ET13{7%1-&lm2t&6uy3?_J_g%s(5DJ?uCBN1A33Wk)<>k0UJ^6467CP{RxW`&ey
zP*NXdUKk@`$?=XSqK3keZwtrGoFcHQ9nXY##(7yVfnZdy)3lJ8QVA9wz#NiQ&U{Qd
z4PjccM@Op|N^pw*5^B-$a)IL}EVPWT$ZFspW+lu44-go^(bvN9hW8~`EDX0rxi;u2
zSoe6%16HEs7sb;2e(%wDTI(qyJ&H)>93?XF`CuOrH0e_|1fnUe`vVhhx8yj<royYx
z&{;z4NxjnKWQil8`0q95o=?gZ7(Vl6Sx&0L=H`#%Tv|bhDB#^z*@AQfcswSv9|4UE
zo-!cPmn~8Zc690_QeQtE3;;UIIH~`VELa#9&t(TR)vG<%lxwLv%g!dk=yAHnL~sMF
zS(3#?h`ZwC*|%@qml|2n9TOF)aBDk7e;+r`9!zWV1XY=e#Szb(O5qlwgTItM&GTJ(
z#c8zK5#4eZrIdizP&$r<6MC>($yh4WNOH8dJ)l5)!Nv`qshy`bABHYPMl45GJf$W%
zCn1x6tTF1EoAb5V1;it$YThZ#uHTsI?1uEyN6~gKW!pOgpaZ#~_a@PMlkPq9z5mt6
zYnW*Lpl1?r31<NLzoQzhf*9nQ2Swh8M?NS)m=)hRkAHZ^IKYLbydV2a_S3baElp=f
z?gBQ|i)u=VM#7!4K`{ee`^*^rQVH>}u6i9;E7QUd;P(Xjz++_5T<H_z7x$~O<d?$m
z8j2f8et?J9wJ#}aSffN9N=|lOwi6$b;Xmf9u5q{XC9+Kd7eJQ9IqWg~3)u%L+uS7E
zkHRdAQJ6S}Pbl1f>SSvO1G2+F%dRO<T?G8%M1A_q>ty*sgLhi{iMv<D6b(U-7%d%$
zU54$Vz``jQD1s@!b?in^<ypq&GJcWYNshXYC<uG7j2%*^gv+|Y6AAciTq;fG*FilY
zAygKQ19@yy8&nNH5A~rqih+>)LCCX)S+LI-i&Q!4u#8wIAY|gN>Y%u>nJ5^JUDr^I
zN#tDl5!3sokWAxl5mag5z6fUpVgXq$V92MsX|@eb7sUBt!XSve9E}MLBVq?$)lR8e
z0T2lLLf*a=SIALz8r+zz>C*RxjGwtX=XNG9KQ^`q3~-VJD$H7I%asAZ#6tC$wI${}
zsv~&<9l^GcUgqnN2cF2z_8gxR48E;<p^31ZBt4rs4!Ocqqa%)#aa>Nto(jS{R}=-U
z;p=7uc>56^&m81hEId}8y0b!XJ5Yj*qIN3BBzbfYqUnu)><Qr&GKDi8hYjzTRdMMq
zG`U^qFLSSqqAN+N(8ve!ckl@?J%WAVrH+$v4K(I`NyL2?Rl~zNSF5VLC}T+gbz+Kw
zCcf#Egi<dg<M6RMt{(P*`)2qWk9HWZQDH3;2o*fR9qWK9(c%p3{f~`-8uQaHBVrde
z_|T&(p?HFJ3i5H8*{JKUT3pocBt69lQy%rxw;)hCVo&z>pKtH9sAk!qYAL|x%0jpK
z{7Fh!_Jsx9FL)p^wgqW7f*A`Agpcl#YePjOcf8I)+f~w_97$CKgdtAO>zZ_Oemx_p
zI7sBf?!EytY5+~5wpEt3Ssdmd23-if+_(oVSm5tSGTDbshhPZfv<*C%X+Efz2P5~z
zp%MezMx=zGr<>)05Mf@gf*%f*IunMHue@+(q<b>u#d;O(h3hH*48~+4tdmo5+fKz{
z{WON5xu=GwhqiJROk-sKJhUaL>H{j)c9`Sxf^oH*{m;tNe|TFfFIJ7?J|v^;ozL#%
zB94(x0fC&50d~iYTMe}cS%OB~)(Jud;g@zmu-Kx>J;&zYbI7Z*+iG@|uOw3|#7z@L
zhlR!A1Pn*fri3=|s0P!wUr4ayxnFzJiB4-#YkS3oJKsPu4}ic6z=BYX*ECEx7k#Bt
zY#-iy-D9LPWi5bBH0zTNo7hjWiLZn%jhi1np_|{l8Fk<;w@wG2-ew0*0qJz``K`{N
z?sC#kKA?k<&jQkCoIhCu_9TJ))d!!~hr>^6pHUj0nf?(k>&woFdjTCka0=0-;kwq2
z)F{d7B|sRe7MfjSKI_HY%qNLG8HspZ#^~Dcj4@`3AvX-TpXYi8P^XvO?bpQU_Inwf
z8%LMXSyNNU*T%jJ_uetpEd}&oa}mlia|<a}Xs@Q>`0ZOaikou3WKSXQ`<Lf>j1Lo^
z5e)##2Z265+)iHfe(%-mmUsa24BoYXaJffH5+Sh#Kd@*%%)<qi&ky@PKa4&PH&m`;
zCr6COFf`l~PnRi>AWNp#ykB{Nw_UN@FU((u9%cYHK*+!4qC*V7*_pMtuM?~Vpu=cq
z!W~QQi~G^Fg73;dsqG=NklmNK7cw)ZJNZq$%%gvTPRNYX?PC{)GPC{te}JL9+MzZB
zy9SKn?p@>&o>J$^EC10UNJXv;C^D_Mfo(C;-1>Dkucl@M52EmniohZkM^WC<LIMDG
zWHuz*BFV+1)MgZaptzM94v1b?AX!z2@rh|%6gzF)PPa#WGxP1&-~3r|toHvtG>jAP
zcqTZ&M>6|QBtM@YL_~iODtP|I!|27s_(eAiZ0;exY`ccXNZzTTbbajzA*&u34<aql
zMm?dQ<v%uEQ=3)@PMvqUqcy%O0uiEK^sZ1v_k4kjwZzqcONqJ(*%BhScKgBlk|dZJ
z$YFdr(G3V$Q02vwda!MLof$F;?=!d3c9CN4w&@-VIjCKvZFdysvi{!?7d0&C$>1+g
zHoAaCJn<={@g3KdcL1Ae_gikGbd!`}&~T6xPx_@3M9@O{1bI9=Wj#+yUw)BL)$MoV
z?c41aW0)Y?VtL-%dyh!eOGC4NWqF8ct%Kv6qP7Ufw@YbdlG2jbSC2sTtC8Bn|0-I0
z_>qaNyk%m$9(DJ0shtADf_@L7frH?~xZ`Wkc|hscCHw7Mwu?TkS>Ge^0AZo?31_9i
zNibIq#dUbwG_d3m_#xMGG6pNsNWnds5oNu6Uyfrh=SR0OAIanMQr*bnieM)Y$Sbek
zl~-@HonCPZ-<31U82s+b$gFZ6A6k5KgPy|ikB-vVOOt3CTf2ZuQOh(lO<jb$A8IMo
zwNq4Z^3ln7*ljG50z;y_S<|=1y8VKl(_+fj^spRv!p%ZzZhNea1y(8k^c)Go3>?I*
z6-2|7MQi-O;BaoQr*kjL%YMT2^<ZP-%pc|)yStG{n_eOv(f9vVv|3y?!OJon4Y1vX
zh-K|I(eZUU+KIfkclzs7xTWk7%`YU@jYNJPP*k3WpWYIkW8^2%xDCYdA%2Ab{Ptw(
z@qY*<!{3yh7q1okvJ*pqp9h%V7pYoUN;^ptDa#M`=Lo}owOQ6UPmKOovGbY2<`7#O
zp>_OW@6l7AmmNpfepNyYz6scb2rgDR>r)O&le#nN%nd@_GEU**Fg6O?>ck(F^O2AU
z1;k+(l^>Yk_CP*}8H~*-moz(qt@c58nFiv?$b;ZJvcZ^ke4q?g10uvuLa@cJB(l(^
zvkQU@yhgvnx8v+biT8sQVONk3a@nEfEN(e!1mv*AKBNEGAfYB3NYhZUD2RcX)y4F*
z@*$b>_lB?;c!gzq^O3-N`502jC+U1>Ke6%l*@rCci^QCF+^Z~T(6*q(umZA*s5J}&
z#o!gfnFs5gYi*o8Yc-ZCLX&iTu2&Rh$tewU&N9+o6y><BGas_J)5uy&vXu1$=ZJH!
z%HW)HEIbz|u$kUsMz)JahDmPSovB3+)#Zlhpe_1F5h0*Fyg;biv?rVP5v6Y2^M!=(
zaT#G7%4P={FGmrdmUs-=hm3(Xd6$JF))ycDEDQ(^*X>#a**yb-AGs=<dUjD}gk6Ah
zMPiGxAt?^4igJECX~=Qm^WilKD9NU_OgvF`EaDDfa3o{NW~=pL;n{`Fh3SN-pSlK3
zbUOTLxRlS<0N3-b{pVr-S#SSmVgF}|{*P;@s!}Z>R5G~&L|<ZO9{7rIG0BZ2n4C`X
zP;vjVZZv$5kaKW1lo}51?mhYw2T(tu0P0H1uZZvv1U(n)wgxP@iQ|^@8qCqf!hJ1;
ziXc?faZ!e?gJF@^q=s^2?(Icc;m8Sx&aGrUA@0qs5qVweA}nfo7m_ToZb<8qimcTf
zF!kyM)arm7CkO+FantA;X<kQ<S=4Sbd3zaNFp4FYD&`cO0ATqLO5*+v=nni2M%iOk
zIv`IT5JL`X0Kbe=&~MCO=`>UIaZZ33QV=Z<SyDndu(w%Lgg)Ffek*hj9%S8eh=y#m
zGGZz(AOcgw98`Cz;V<wC6{~mqj@9iqmu0#1ON0!RAQ3NXNkYIBGY%SuI7nXD{fW|8
zKDnA;jV3g(`nBKJhVv!lB668OK-B1c(Q%`tq-j)~&CZ3WuyRDXn!p^~#xCoM7;nB_
zREQ8<^QL(4n1j1_nTBx%IHA`699&yHqYmTkVXHZ+U*5VbU|ASCQ*q*{-U6<SBi~{L
z1j30;0N53^fgmi!*%?L|Loo@?H)-Y|GOQ>*TV@mY58?k{dV_&bF(b&`3<mJnPx?^T
z1Xn9H7jb#EHBt)^Z-vQ(a9pPKn(C8mn6beV40qHoC$eNL#0n7wOUPyv!BWSgzq@J4
zxo1WL_tDmM#V~ijuK5XaDn}`J9155Z3=t|;0BR28EZBnrW8bhB-TvCT&YKzL-%J^#
zOX|IbFH%Y?U~e?%w0OL5$NsV&!CsB}H_I_R#DmytFRMwpM^lk?OsrPl?cHeQ$n>2I
ziMeMJo2Gj<u?mKp+>@-MW$-xpRLR%j)2I~`)c?ZTXHyyhO43;=xrn(@7A}WMv4e7a
zHU_>}6PP++1H*}^T8>Odkj#U-acOOMqIc-NzeDryY!+ewnE9h7wfS4xC*L~BCBaop
z7(Sjfl{a_6I6uaPu}#1o#5q@}s}q>@0`b^ZqEvjN50D}*aY2!>Q*v#KsoHlsDOiG3
z<ALQsd|f*xY%VIFDh(;|sC89%Z!O9eE0@CNfO(*3FiUMwPBimOWdS!JCof$tm~fRd
zi%6rZ#A<}iXnpGml22NYzQ@;en`vH|yBp`_6vTBB9a_)+gWFKx(NJt!Qz`X1rLi*V
z+Nprs`voJv3T6tRVCWqs9n4xyAJU8|oo2<^sL)SO<iy!TjBsoCBsL)j#xZ(h3@f!E
zaNs;@DPhLqyu$#G4oBW67cj`8C%}N_y;_VpBv{26tCo}8#f5NBc~8ke083oV=_0Nh
zlP;)>ro7ao%1~B^jw4J)l>F+2HH7)7;*Ls)P-&H<BBRlOShwH57LbLYVW4n{QDTf}
zcba<FE2v@NSkhsKNgeJz`U{|SAKT=6;Yg2h5ijBQD3P8`7zEB)s%QvRW#tPG2+Dlp
zaUMR$T);CY$$RZEd2U##ai<@0jVjKSSYXDG#T@l%sz3<Q7!2rDrxTKTL~zH%m9RE8
zkDOCu1%3dZK`#1;{*xpJ#9V=JF_^H)-qg2=X*SV87br$-F9Xp6veF4eF8Lz$7IlJQ
zYNjW5q|DHId(QAX{Y09E0wW8!#JRRJ>u4>fNorLW1{KhwL#Ol-O87akx59)%!ib;x
zh;EJz1UiQyE<k8CMHnm1E}bcPWWu56?q9;AwP;iqc)-VKq&~4(q>N%K_persq<feX
zN8d@_D9uk$2y`+^cG!8UV+G5-6IR{e7I~L?+GJA1O9F0OP+_!ST97VGLIdXtMrrmc
zy2EnyE>5Rr%OxTDhxuD!7O?J9)nq<%8BAykj^AT$q(+BWWIBLyuPdk2LojE;*Z`oR
z^@{R^`7HpO3B?tl!s4W+>{ikhNV}Cn6;!5<8<5o4RS8L%Uca4|OLrepHY*yK5C@Zy
zV8+>xiy2kLCX1<S#B`K5SMI8xJ5F%UIQ&^*dPL6EtQ+WnYMpvCCAWSC@`a^m_w^N0
zY|?fnmGgWDEYy&Du<l6G{Mwkl^s;pLJg`tbgM!ZW%mDEQWvK*_0EuD_peWv2CQ6vJ
zPEdl>rR~Uk0_!6%ORNX#+&~o)_#H_Tfk{>nB&htKT~|~Z0{4WF_>Lg!Uehi~kPn7u
z_n2`<;MRcSL{~l)!suC1(9h<H6{Y9a`;sjo41lT|B}#J_LUp!;*9Y$-*R9aG;`}2D
zbfjuA0kNEi@K(FA<LqgK>I*aCdiEc>JOs*3?E!Vw(I!PBv2t@XH#XxT+5&30gjWcr
zjdC?dU8NC>v@2h<$J8j%77^e{K8lVlaO}%Ehr;p?z%)6ha)Xxw(i@%$reDA_(W4Go
z_jCDclovWB77nQh66EU~p<kgm@!gO_L>XCt(zI|wWJ@wEx|<c}Mo1W|wtw&@$ua!n
z$s>qY#=67Va<*<fa7|o;Zo?)%Tj0Qu&m#KNEe}y^*UJz?_^s5A6G8O57JSe6W_LjN
zIAElVDjxTtC)1!{+}`YsemcrPreuoYTSaQPFbW_$ae{&@7U7Pe7CWq-gx0X8l3Gy^
zW<&qt+nPxtXl1CxD%8N2-))csiV8cC?RI9i^Ohfrj)sl`xJhVWJ~lzWCQz6f0OC*%
z40wzR&S<OV;-l_;>=9&cj}f!w;@@%Tyix>KcSXRw*+=2`>S#bT(A&A@`kJ|170YfT
z@H7RL#l|odM$A?bwWCc3$kZ=Z$mU3Orwd5smH;D+?+LChz|_&iV$<WrRr0b8U>347
zh%@K_?%&QHeb|cX<T++7aX;LGSfzyx6?nsK0fHW#)J}d?t`DCKRgAxdjz4U1R3x?V
zi*V6j@pvmhj;xo(S<%Y2v$<)NM$gZB(DR|sKG^)a&IjIHN3g$p?kNOv$3P(w+ZY^v
zDzB)SkN$T83Fz@@9rzf8VssKjxpTLZdLIz8p=-eMw{MU|as^1Pbv-CPJJ|gFD)sRw
zZ-QabB#O^YTz~sp1_U1u69Itk+dVh=Jza+2C0-704eq?XQ67`jU{a5uH1ok-Nmtn6
z{k_%Rb>8MO&^P-es*i%V*&1YAtoq?dbh@4h@Qu=(YjL@b?9RNLTE<yx3e<#;9n=s&
z3BmotX>s`%VH>OTTL;|s{vX2E1>pOt=QBnZS2~s#B>9h_3;7mD_r5M$SU&CG(LHP7
zxVQHRgn`FU`GnkP`43#Z?-{t0Pm4*(R*wV0cqi1SQi=@`SXC1_i6k&>l#7%`?z<8-
z;ci%>WE2Y{u?W26$eGXA3oIy;NdOYX9$;s_A@qmMh$msFD8_-+RP(4|fGt7kX0%_o
zUg)fxm40O~kkIvUZv2Ad^Mr)(6r@+YE)Ad-Xk{iYc!Ye@Eha(dbH6b1d2t11dN<RH
zYD(cu5D79_)pC>5EYSmn&oTbXVg^<#bFXr(L9CFg=#=8`4pn-%<h5E2=!qOwgkaf2
zg)8S`?*{AlDnGBLQ#WDY=KCd9fo}}Y2h$U5AMY|jkW_5%#xBA=;~o%turnbTyStdH
zDJ&dblkO663$vJ9nWB<cvC|h(?btL3+7bdNbLeFzr6H-lrm6ZR3q>0c(?a#OSXMYn
zLlgdCaQTA%fb=BqxpAK={fx!pcrWzP-UA0M9LQHtt}|h7WGHSdK~$}<Fi=CUQq?t-
z!bFfk{{x%1pD^m7RMV*h4iD>sT2mu#5MjIyJm%SmUFZ^y!+>?xB&B7^D9--L$V&u9
zcRMRvF`;4Kre=~gaZ(j+g22W1=peht{8xRNb-0MeEH!OKm6I^m<k(M?OL>99CwA{5
zkYbtrL`@rXL0>#H4)k2En{!r?q&6n`;8dUtgrpQ+_>*shW0+tBeHh|~)53p4M?#`~
zM;V?xLhrR8kDlZ3X`{Q4-3^nL*9Yo!LL3W-_v#&PA>cBo$c9p&r6even<)-1qmp6<
z3lisp?6Ff58%lh@$B}^>D}0<Z^=#d;Q;&v3AGtjk_(+_Vmi_=NPmYw%ijA$-r>9NH
zg$Yf-4Tk_NwE`V<H_pDppdSWWwbm>i58$9;twS!I!j49%e+6UU(b=JR_RAkwfc|s!
zR}u+d0xCOD6WAJgpwu}wF$8kVOiyMwQJ1!Y){*^W|3FL+z3=yokc_d^N(%ri3YCk?
zvY#GEF!wP)XE((aA6Q;BsZWU9p4{UVB6VX?HZBS+ORH!WxGZiQX0(-fx*+wpJc1<A
z0roJYzuntXQGA@`-u-hg^hMtTM>I0x{8jbOGUCQ6Y+~3Qln~UoXpNDf<Pb2QanvM4
zK`ffJ`1kxp76N&q!@92lacv>~I*txNd{1Y91cr9vzedpb9<C(dHH7pF4OnL5pIV@7
z2;W{Y>?`#NA!QqxKUf!Vu3AY^&;^5Q_4$vF-+uS(#jE4TPyUyT!#=YrX~+*aGDrl+
zan}2B1lMtRca%vi<+`Dw;;`7v7{ef73h3oIFP$_j^${_i2Lt!dv36v=q%(^c$P#=I
zo?b;O_AJ^6t`ij13cLoZNoj0<rXEY?1!XfPFJ$Y->!onGdGWrQujgjpe5`YW;pGIS
zeq-twXRp>6SIEQm5iiKnabDzir8k&Nk<Xrb$3&@^ql?6ce2Zj#a4U4cDK-0U{@Y@{
zJi`A84?iS%1JBBT{yF^YEdI<l_mCwHSZJ$l`V!=K5kyXEc*Nr#TLu#<Uy$AKLsPD&
z_5L$in}EsuNVHaq;~NMR?5e0u1fc%ZYeS;4?uCXF8d!42rI5cYsbjk-B8w^ScJlwc
z^a7!guuLpClpOJSENFzJW;iS@kPyb%4?({{>WE<VY7&plI*5wdc79ovXO5k&t~~TF
zmmT65j#yml<lB7V^KHHeWUS-lc=7>>f}OmUnG-LD03je+l~ZJO&Tvb{{O?cCzyIp-
z^H<MaeEsx)TOMeickK6xd^O4ch-az_Ubb~8Phb4`*~{-=bcSM|Cv@Or-8<B_6QLdP
zDuoqXf(*(oK7Fv;5~UMX773|GyDj35M^KL`C`}FFzGaIcCWGgrJYIOn<6glc4Ua-g
z3LNJz!sF~H=t=&B%O<7dg)S9Vn!biNCKy#~f3AFj9v(y{XU3NYvR^kosgTq{If|w_
zGvcW?`gz2l<&<dl0*1_m=Q}ugT7sI!%SnH!>PPN6obW(`B1q<WN~iG^k&?^BC67VR
z(i0AI!a#7i;#*%QA!KqAUcBtGAhr`458z}~XS%mAZ0?Lu6wGw&^Ug6Pxi?(`AuQz#
zXH!(2bmM~q!5pD<=LYKOvKvNG&U-%fDuT9=5&tsE1C*#hV&o(MjO9eNAI_3xryz<<
z)++=X^BfgeKiZ0HBZv3D9F8)z!-hBHfLvC1YYh|k<^Ax0-QRoklG%JJ@r#UTVjx-R
zn|QTR6?TyWIo%b5X(>U|*Ru=rGBM!<WR*+zvWmGZn6;R}g$s`_v9Uqp%=ij0q-ptY
z*5SV|pZ@9DtK*k{?J(frhk(i+`|(O8GK|f~F>|Q3IORAL4;Q_aXgn+tHo?^Nnqdkl
zkkI4Fv7;A$fn@?Up8{aLZ4cSiMO{rX=CZ=l%x*QVmZC(P_&*F2#JJLAxFd?zG8b5%
z41pbI)!BI)#mNJO7SriUBQ<#?IOwWccsbqP=Ag4dVvUWL6mszr39|wp96T@KYO9*L
z<35sn=HDyU@2gn_W9G4|B(ma6A|L%I^yX7_m+RFM03rkO|1u>1FXNhcn3@uuglC)v
z25YV+L$p_ERm;WM-{+zNd#iLS0H5sa8)t*R25Bio8tyeTK%;4yj7z5){Q2aw&yF&<
z2{su&hrU1!_!mgi!9IPaMJK&SLvS#PPX3^Zzw#%p_X^^v=JLuAZdK$4g_EE4lA~Wu
z-69FXD<}i*@9X(;%(3PsbSVOdptaR3UcacIFgJ)Ay(%Xt!(fDjb)P~HYHmcMoqHAS
zD`>S0KMXWSuQM8}9)^OQuc$H-_Am-6$>h^@DP=U0E6bT#^#l!}g_^_B(O}B0P0<IV
z6@oB4MEe%P5lW=0@|{~;M89yr{mEHD;Xr*5$)S2^eit5^-|ap6CU6fOgIg#%G~bpO
z(@gc{i=Zrw0M0de46qLCUM-xMzdSEaO3c*FF`<KP?K)p9ourEg>5vquTRA26k4~|K
zvYk#ic(_+At7`Aj>-~C^f3~Em&7}9f`QzvC-XmK+g!4Tp5DAx})~mguY|gnc)JCP?
zmSC{Z8L@75e6A%tf`*sZX_(C5vFT&**y^l&FLq7l9A@Z7x1<c}#vA7y<9IBA@*F(~
z6`{DM=+9b@R1ykH8!<)$%Lg?!KFp%hyS0?{)>gb>m%I|_HfBw>YS(x|;6RfBa8;kt
znStD6iKYJ!iKVxR=9i_oYu_#0O75^tpVKnItvjphcQg<{vuMNh$v80(?e*YTq=Dxs
zvlomH;`fBI?SKqd(RQ0^$0b<vd^IpLvN_ss{i%PD-3f~X+(~T&3HJD%;rmDO?R?X>
zzDHph8Lk7fHdxYfL3Qwu$7!qOZmrTq{Eq5Eo@&TToEWj&&~iKqc&D?sZ}kXro&uHP
zF)(4v*zkd2Y?Szf>MHOcC%xt<V||(rKGpY!`G6j-om!M{`iEXywyQ1gftB!Wo7eE~
z-CkY5zlTRQhYpGBYN@4UXjAsh#pA0*7~lYOKa;8^msD+vOJgBLmh|&NOE?xN!k97|
zT$`&b%!-oai*&+natU~(d;;$V#H=y=W<51JS6(lRf2=v)5!h5B;1ITDQC{LS?AFRN
zv%5#!huaX}i8jvslj_wIzBjK&IsKd`hX0KTc+wW`nYIQEXsK991J_pNn?>gvbkD}G
zk2}NlrAS}=`24v(JSAT(W(0~a#*Pa<`)9eTIrz9c2zh~vfGHK==5uUQr{ANjw=>vs
zY%lX_53HJ5U|MzD%M&Sg;wQRsq}qBkS`F)sN18<|L^2e5Wh;(FT$PT_AOm-YezC3o
zRVMSOAC?wuLl=N4cR#mhrN8H%-o)CQ>QZWSn$E(LNeC#2%_>&rum#2wC@Q*+7M9u>
zPu31nM9^;~2Z0K@l^!(2OSo;4(F9;if;Jm#cwvaBJLS()NB?>1?1$j`@GBHUM*ci|
zi^DNo-7xO!@aApoI{!(&$F7F!>5=>=Ht+uW{8QXiT!l|RH>uSFYy#j9@0xaUJXQlY
z(BV-B2N6zyKK&&Pe8{gdbqsLEe79u$T~vP%jWkR-nF001fk2mH@Io<sQRft}#2#cP
zkOlOJU(g~C%{fY;0n>3A*jJs(_~O+w(hi=e`x7%+B^t>q_z8KSXq}K>1rh;2ie&;s
zTTH1Acb)2RmsE%SP<23Z3j#`V(?LFfKVAWq=AXJ12w%ikPQ&~Cm5=117QA%7m@4zb
z8wj#t7ixidcIu@h$@Hk#Eh&pmBupyYwn{hI_rgwt65E_2!W&h-uiC-W|NZRv?Kh8~
zJ^%6LQ*Q!A3p)HRQSumfSom;Abf>T438GB|&m@}FpaCfFN=(X!-LpJCt;syEmW9Bx
zlxo_0GJ=dCj=e|(t@M)=;-Oj>uKRmuVj3)*NYvz?<xsKkvjyvDL|tWqx^PLPmzbg;
zMFiX9|K!#}qI$v`9OsoDQ$nq^nRm)+`|w_%pn6iz9%QFf05cHQV`PM6s0}(z7JQ}0
z;bETA!F7P2L&P6t6Oj!dtce|kUYcI<2L>?VK!hlvbBA42K@OJJu&vO5Z>9l5gRYWO
zr-)M{46{E~XU*;mn7h-{Z3aC>fhp)&*KacpE9j`!uj?2`JayY*&cbO-Iy)`Z>ROxr
zeciAy#|y*1>cQtIj^wW>)pmkZetdrX^67C9qe73uv}BH}<cvm$V}PBah$tGME>?ny
zNDcyve8VPr5rs5}kex86;C&013PTjGy}%LOW&=;I0`3$N>(GbK_?%D$e#Qtg{~;S3
zQXC7Tg?&1S#<+AsM#D^#_42Y<O`B}MKD3lkJ7BP$EpR3ZmZ5I6j&%@fj)mQEd7=sc
zxT|;t)p5E?0eK&TJ=flzJM824qx|3t8!7TFr^R82D+>n?uIYr{JKY-|fi#xpVj`M}
zdzG9j&=d~KecJPnYw^G`Cfm@K5w+B;YeBGMVL<5EibiA`+CRYT4L>6HJzD0NW`Ih@
z@AJVSI-<{pK|_Stfz2GI=H%L<SModUoro)S)`*=z(3;z?-W9@D@2#fkHG=hr7Vf!5
zxDEF@o`yT8cgRU~FXE*KGFRJBvw5+LaK#XLiy|BD6nCJZRA3SwCKQiPU`-tT?YS?&
z9WdQ{kg@r&Tu_LwumdNrQb;BKs>TCw;Z$d9sU(A<HvytxPM6#9v$~!t!Z6*!;LDhl
zo5YiyBc2nMFpwh145l9pL!l!wNP#g5G`=`++&e6Y2Sy1eoG9RKX9@8HZ*uI^*dmHZ
zY?ai7gSRe=D+v1ps53+^BP=)1uhF{nAki1NimD5?oSR$;M&$&a4!_WC95MKOuw5Q;
z{PR^kO5DAKVK6cQ3Q(S;UJksLWd;9~?7?GCpzj`c$2CAp$<>epBq(a>fWz?{x@-af
z5P7G6fCz3YHB2;70#lW`3;lPrHj<a31#GnN@*Hhi+}_(WR*yO|3_11594!%`=7>^J
zcoGVTS`aMi#1m=;as2L<RI4h(*oU~msR{c$cv80(HbXr_M}-bDmE;*wf0tql4aMSl
z1Kd2<f+}LE)2tFC1v%{swIGOnS<fG&EGQM?KGzW&@CFLhJluU9P{t8+)fBmUqX&HQ
zg5GewyEg6~*;Xt43s}scaxWYl<rT+}F5G{9_E}&l0VB%)ghs1|YaxS@Gz{KJ-ssf=
zVHqZ#^!Kc_g}$Mx4$timzxe-z34BJYpp}@h_pW_L2H@XvAAi0GuA_k9!xig%YHnJ*
z$k5x^`IHanVd`2Ac1n(beELfmrI*r(cMome+0-&mD8oP$Vaq9v7!%{ed+MnTo5%1G
z3c1w)dbVn~4>gDbjM=OO%<8tu!<gG=KGUC4MgyaB6x!dia8Dur$2OUt&9Ke6qs4cP
zRhEMk84P@ac-bq*p%KB>hm)~mL82XJ<*B<h7Zfr&-Dt>|)lJ|~!3Vcx7xR`2Xmyhm
z@pb8rVojKNik8jGeO6s?U<;aivw_4jkR)cYR1)xr2K985^Tn4@246`?dHM9pEr<s+
z_hCwu;nunh`yOyvfm6=%<*aBC3Z0^_z)6X<&P!5_S!Xl*JIYSVNrB;6GY^Hz0HaVw
z0&Ntl66jDW>vU8oz!1Y>py>}UF^DS~q5W%Lf|U7fCre1kPmxaxH!Xy-FY?Rs#LZ)c
zP-SzB{E}gF_v|QyFPj>a=!P8M;)ft;^--pAX+Y+<7w&pMvfM~*R8iZK8$Q{Y-rVi_
z*}*QBGHf<!D~l{+S}UBTN48xE3y?_Iw25$(VZaB-FcduM*6^Zij1*zMG+=?!Jc$Wa
z!}(Vu`ym^eAn$LcvDY>$Fia%#P&^DV0XZ{6<GouLJIviwPvv|G&R)C`$7W%~SU?2;
zFuYC#5%>&~eH>9aDaMHk=;McM;0`SDeV+<|e`s)WFR?5;_POP??5x0?26ul3D{CKv
z(%WR2vaN>JdaC*)-lLR()kHD*^e}RpxIYcnu(!nnAftGI?Mn=6hN=-dGy&hlB!{XZ
z0!mX9!)by(BX4^OeJhJ>qT5$J5VNW1l47kO=ZFH<;|AmQ7?sHz<^|j@ZRI-3G;;?d
z3}rOrEQV9)QC57;gt5V<5NSFafRF|v?{6ei49lkSdUn<P<7*M@LBHtZxtnjh#~rXz
zZ@?rX)BtXgjyxlax`orov5xKfn57JQ7kqwb7scprjhVpMNVS=-{8Fw86N%+L-7q|P
z3F;7qFS3+mdSFiE2>o<Dqk9r=V2t>Z*pp7=7dp)aIoItz_{<IJX@0d^VyByYXOHDs
zDrPc4Dbw|QX+MX*Z(A&eHdAcuFRKcS%9r>r;bMr|9g1NXKWp4UC_$W53k-liUoRXf
zy!1-v^PpZ%`naO3<r5Wx#!w_iq-Uro2BG|Cj&Y4L^*RI~bFt}|khfvRa6%t90W!@J
z`KO?gLT53j+p-<(?2H&WEuau>B0Yx|+P3=_`w5jx(<plqZRuUu4HM~%J)vk}&F&-z
zDC?>$+eD*ejKc`VoJ@e?&^(62Im+(RMMYtE;J^=}j6(%Q8LAU^u#sTn<9OHp6M%*7
zgOFo*aFa8TlK$ijV52F<h(@df^WTRd^}pns<Up_q0PE9ZHFuM4dFQBI6UmdA=ZE%2
z!J$D6xs{*-*-2KHT6h@M8?RSJ>;ugMch;ylL(AIuW~7b23zwgVMdXL95lPQ7FN}j)
zP~Pjt4c!()zIj6r{Dxj^+E66#4cg<M7)D2Ul8L<!UHt<x7gIPuOIhkCV!`wIjc!4}
z96rp@{CpA$-XzN>4v2|Gh?7)o3<IQqboj>e&Qd<_tmQ^&c|)m{TRBu`omdtEr=+ss
zZQi|0p4gH-3B3OlqtPm3qHMQC^A1u_CKD_<awc3%_o~HU54QFTlRj6K63m%cHkB*c
znmphqua3X}L0&_^Sg8HdJKV4$u5IV#(^tojUmgcdarKxRwD#ot=g*%$30w2U*W6OM
z1K(c-VpF?6zKF-@#dt|OEavr^a-Z24GH{IVf1O;pvo+*mPHOz#($`nLovliMTH_iW
z)9Rv{sx_xG4D1?kiGqSsVoG=aI=FlI#ip^mI)3^?&tiu4&9LMYBvp5c*^GTjsy#5X
z?RAS5bg%HiEG#nxn3QuWeN`@LF$<J>Ijt5fKgAUq2|y&hEJ)0evPG?oK(Qu}H<j<*
zbSjzwL|(5KQHpqHV4YBg=+47VsKgWqWZ6w<?bXxcA0Ges>S=hoN-acSh9jjWLAfA&
zEQubaXf&+=*QxT=u`oa_LoqNM-1Vi8x|2nwAwXCWD_J+&rUn%C-H*?2GP&GNE>*Qo
zi`stNX+~X-Q#GbjmrU8BDs~#&HS+K_qbV^3BM+L7?;p}(I;NPHX7U@7BM8O-#cww8
zs&!7yB@zza2{j+FHM(ArWJoW3>OX`?m)p&1*m(DcrAN)9o0uLp8uGc_Ug<jAiyu;1
zYoxKn&=W%V90k`J^(ahW@0q`ay0*`5vH}}T%hGV~5{w8K6Kl)lpT665MQGwQf%f&g
zH!+|9{SbvACRR(aYGBO>H}W|lhFU=jQ>#|h8CD=Q3WRdsJwjy2xmMT?Mdmi{4~5l4
z8$=I3#tv~5PqamLUkH5UI$Oi6lbaSZ*W4#ZP-=t0#A3|R(53zx24o6GI(R;EBEb&v
zVa;%>C)PEfRe7QX*XJL@hHl&cVE*7+;$`nrde+5+dZt<|0p9`h#`Azh11sB-nlvz9
zC#b2^Chk&EmyMN_eJp`)xaAb2_T+l|aj^RtxSfso2y7|y7T|ZAKI{u`jZ{X_*#P(=
z3Yi`(*R3WYkWmr-(&!)XqAX_sLG~}iD&4eW5~*)wC*E>cVR<*$RID6D2TF>8x$jai
zrQ_@?c5{mriAxF#t|*+Wsxe+iGSo52`QQ`v6a*ls0|w^_?3NHC#coT=z3yMxYSEOd
z!1qi~ZgTWCib&M#jtB3%TKvV~vht#I&dw-n&Z|?T;x(CKy<Y{xQE`cBzg!#j669No
zV1Gh!DIsVbWX2lo922S#Vwy2CRl8XP8@XxWpHW1xU3q@AIS_T(t^h0NEfFk#lFo&;
zz%tJn3A;5gtOQN7k}BS6<^JkQswQ(Jx!7H`Z^P~wPg%e%$++%R{04%0&d?e!z2Knm
z8Y?E}aM=?COq1<R>bYYZz?!f2Hd1TDbu0pcm4~;@4Yc7MskUP%PcZ!Wc1EWmE)4fY
zHc~#$>eAi3C=&&L50*tA-~PgA(;stbkn*C)ftxH(dUZbD;{0lBqmbbPE=~F*r%DJz
z^7vnGnJ`{L!X?7B3Vyo%1q+)0=&KgSh1`Uo7S$|V9|W$y?NxD&e&n?<koz}Tg?dp&
z%ix}Tgmu6oMmJlC{<*6XWWl^!0$`JJ$|873!mzc)lW29*b*ooh8j{B!X9cn8f7NB|
z=%GbxMYazoRg|Km^~Pr(VX;YK|JYni5*k(ktl@=|u@%r&%4pnR!KlS>!RXoTFBp&h
zV=owWLklK*6c?rGtRQ`KqhsE&YVf1mU%=~_G;Y3rYzDf)LLi)Vv=UsE_|}(#ptC>v
zT3|OfS&X!N_3=cjUrnl#j#L&!mptMRI&td;0x9IoLn?<|DS39=VI0!#t%OJEl64j;
z6&D4`6mu-nlWF40PAwd&625cX6r_j!Ye!B&z+<rC^)<P~22+%7cHQ9+5wsEf_L2&<
zt?*y*3qDXZ{>3^|Fut<uQF-qAmyj$D9(^VytSO<SCkTDZ;+Wh~u0d8#IiR%Q{<0t}
zwPQ%uou+bz)Lgez^zpfnf`oBEM8&m+>gE~8Al=1~0YCerDB7S?KH%lcSATtR{5Y%~
zAP-Gv9ExDjd-Exk#epDdS}8)<?DS}AnsV#kJ^e1~&pqjM)`xo=#uId{_L$Q!WBS0Y
zJIVwt7>h1qu}QJhU31CTZ9Okqg2>LNWsAvV7H*Sh1$+)ruNk1!FesU>IT}@kJc)wN
zTq|hRms~9ETB7U%WQ^+#)}l4a?Xusj0V}B#F9{t@%}Nwo2wFIcshLqC9+^(J9l=Z6
znh76CM6cK!aD{0ko^1;gm&`o6_(IyOa)?gbXB<loKWZ&Eiq|$aS4Q;?&L^c3K(2Us
zvIf*{tb3C#L-KoHhGe@FX2+0>4-Rr+u56npc1_VQr@h%mHi-kP6KRD%j%AUnIte4m
z396JuB3u#jDjD*1hUKp$0+6Xg_lr|yBF9}9>hB0acPKCxZ`znqko!zhEOV)t6gb}k
z@MK?NGm6t0g#@ZlpK#s7U4STsS46UkHswd`C<vlWNhH`p7rW$u+)k2@G`z`2chhX1
zXX1YA!0$m{CcOxP5Zr+8dYFgJtJ6_{^x<u-PxsuUG@(t)#41g&JbrOPAc+7swuo5k
ztC&Z;iWme@U{JFUYg)+|d|DM9fiQQ&UYCs%v!q514ArC0;>m>r#&Ic<JFS@ixR1?{
zP<lOPx^j&2eK}bR42gBJGsq{1DenQfuQEkRATSkEx@%mSDP?b~z6cY8e^ZWgv!;AL
zsCU<itsP|uUkZ{m@CzFL7BWkzmge!T9>q_i#$&~ap+8eV&2|GNM^1>4;BkGJb(9fA
z$^1#scWwZc&TiQbYL|<5#Goh$;)cJ-F8?SEcvmUAp?uoQbF2xCs}ywFsYqGGvl2!F
zteHq)K$}fOIeg&bnE5i|`r?qEfpIwqmUOwW(K#?B$=M^>jxqtsflG+aOkS847OfPb
zr@6~OV-H*x<?J*ctT7;cRb0|fReKebPGXcYY**v(!}S;CQ<E=@dTD_+CBBJ%K~@d;
z_Vj}`2{rlPh&xJ{GHfvJpq+`%lM?5kfdzI%*aonAAwGia%ckS?z75aS`|E{B3=V(3
zJKS!FfOdBcPO32{u^Zn*#30%mys$6AX|?k2@{QODDJ4+8J)ALp;*t00HP_;>tFvMh
ze;lOZW5>FgqZ?OL&*$BI(2Xur8hi}Ca|H8gR{+`5xc`E>1&u9xVdD%HL9Pk|X*`+}
zpt;5HZHsC~&^?Mj1IsRNIe}aR5|{-@2kkKbpCMYY`x14TJMPOnZcftO{^1a5{SNL?
z@XNu_fYdCV#@e0^_C9Iy{rr>WZ&2vHYqfw#0-)LfC%D4j3}H9C*82y;p~vS@sJljn
zdE^$LT*_=t5j6Wfgo|)By%?AWppOu>E(XpaMgr@{8%XfAOgB=ky$e#>*0ZjULLXW}
zBFHSn3ZT<4GG$dMOIiW!U{`@NOA?$o05H9m5KM~p#v_5lPr3J08)#!>_YsAK0TiBA
zRl+rvtkr8Br%k-=MaMbzBIz0n<B+EH8jg{Fy|*3%Ia~at>BEagd_7THqa0*0TPBT>
zdVDUyEK%E@x)Uv_48a4bHk4e9)E>c})@%VS`IcG`dQ2<0eKKmsRX&~71=>U)nQ^0<
z?Cx}@JlN%=C%2^{vuNcTzNTp(xx4%9tUcfB4<qiFo*!UfClPhS!Jq=hLJmA?^N0dK
zsqkj-ngQK}ATfMf&CvOPOP~CP*XhoXTGBX;u*<k!gb^A;-~}r^P>TlZu3-vPi+2CE
zZpG`k4!ZR~P=I#|Ay1;P^dMX_(AR1OGWKS;>lEY)2LJ+yd;;Y;z^DjNjH!_IIRl?S
z6e{xZ1~3b+g)ZG^3m20uo^ba`Y#ZOYJz5t+ATg*u#P!DZZG8zgkrBIkxZZ={3SWOr
zj!Y+{ZL3;S^kW+l;A3Fyix3{wRzJbre17dIUVjSgIT!h$HCX}*of)Bqc0$)R$BgMV
zz+@ufu`_dT76{;<swSwnqZWb4g<(7$eLeeS*EsKDfz_;~ng9f^ddnV{8Xr7c1OYB#
z5fI^G*y2P(kHfIy@z4Sig*65_THF`NWi(D3yxdtU-3aTo(N9V7+OVjd$|Kv!LN8`t
zlhcnXUOBa8gEeV7B~1dY*O|3mv$`M53{V~g(T%e+R>h<|LE_?4@xBGW;AaIM->K1U
zcx^hatQ~-w+=-o(9BFOW4eUzm#bxc3=zdqo_9NEGV7&{hTj;|r090_uund@9iUx?>
zqfli7NyD-dl}b~?4lF>z=l1f)7m)+ZJ?S{WijZtOsl$neKg_d+CAyIoq+F-k*;Rw+
zr@&pt=l*{*KKK7S<D>RTBNX_-UHaXeVZ02JUzXR%d|B*>MY)XgUXs9oXmp5>^Hk^G
z9q|V4x<n+ud3@_Bx~A>aJWrCDUxh^FE6a53)#iSkXgEdWOV~X3Yg8)V8ToOe+r&1$
z1<!Ah-gsFMu(F1A-xG6J^WaA=LLUvJ<KO(k`!@+$F;Si#dG>Wn&?B(7AFLf`B4vS0
zMnTV77%g2XBO3_bDGS1kN>Hlaf@3rV-@B;l$6ce_HEA!?`J!usjL~9^!x6;08$*`+
z!r7stRG9}9{e-<#fVy~nvbd7H-JEeOu3m3`gf}j!l74g2QtB~gF1@ej>$!ogi00!~
z?C}2mt>-_Lk`nxI>yFc)^(`!*=jd<V>=^vXps)wt!Y84A(C5v0ZlR~pD&x^8%>w0w
zm3Jw1xExz??CYX_r-4w`&>zjfR)&dcolu2#6cNd8g$@}Gweu}cS}nRjsdYGK%AnO^
z3r0l?$`2>vQg$v;p%(DX^mE<R`=E`%^U>)r@7y2ocyxDr#yxy<+BJ=u$G1h~Hs~(u
zViVZG>AW4~<MDWxr0*gpH3HZWN0Rq?#5sI}49Dc_GsR+4Y?D@}AsfHOb&6{muR^Cs
zLWU$@idCnljxe3d(F6iJRFBKqVovs$T5VyBODYC2qQD24G0RmFlE~`@vwI%ahw7Nv
zF!c<fWlR5Lq%kX9xArg)w2`Ay$bEyJc7}Xf(Z&3ab%ox47!Y|akF8zkbXI`z>#~}*
z=kDK7Yug>as-Yq){Y`@*7=4}YZeg3_C!dJX5rDlQPZ<_Ne$?O8U&J{9@<NmP8gO^_
z9YM^iMd68NM0c1QK3XtkaxiAo;AyJCkWuVlv^NbdQw<8mB40Q!-xpK2M)P7u6*7vM
z`F@)Cexbq0;%J~CZ~bVp(?`@j9LU0L@@lxVO6035#oVPz=TYB^3c+osE>O<J?w6b?
z>7=7WEN-Sl^rmZee*7p4u`y?pOUU*tL<G#8Rv)ezgAulw2*O}$*We4@0tvmK&EeP!
zaXSXl7hKU5BHAyiDTGNx;TNPI;D;K3FeosT>Jq+1C4zMyK-P%Y!9qXmIZ=2oi(XLi
z7me(^8YXmQGqr$gcGjg6eEd<QO>TSB4csJxgHS?A1mblB{e;`qJPr(WaFeo65e<#V
z|1W*bX<LmE=#vJnSNMX}12DOf%P0({<`VG<Z`jst*>w)LxGmcSqecU`+$@rZ*i1B4
z%v{$KNfxg<o}l_cv-sGfjE%y^0PC59*Lz4|d2TzXEZkBPO9Z11FIB1$S*mo>#>3#f
z$Kv(5wC+yqd|pmLwFFl`7=n`^M}l)nIhL^aR7oH&9m|*kJ~!O;TTft=@XL=r3UBUY
z`u5#O)lA(?*SUJS>9qdo$C*$vr`Ah7zt)|bKCK_|u<meHd(UTD0^N9C|N9<Fx^`3N
z@`%lhRJI-GT|(G=YfNbH;<ml-MsfS6x1FNqTi)RuW1JnmtP+of-+kUk>rv(+`aH22
z_I}POcoHAgr&3&{-I%orBgcalFBCrfD9k|wxt)S0g)vyN6?}qTWVY)uiHjbi$HlK;
z^|(lzJ)+3J_@CG)vgP%Q;_a-WVwjPL|8$GUwzD~Cl$Y-z{)ocC5Kuy`iS#WGLKv6R
zFk7b6PSwYt$l|8mTNRg`S`6~+wo|jE-G9xB49itDuUfa@5)*FHgyAx+*W^>B=;_<e
z7A6bN4(Y;f5zopt+AjCx*3s*z*&Uh8D{t%zkHC&tmlO!e#S<X(p1f1ppc<EBzy9I6
zZ(F3QyGqrqvtw>|0|;=xYjG>e=Hhn1e?e}b1%)r%h`}f5k!v($fV>EHmA5Q%)1k!X
z8kBgrxss7x;^xCCu}M&3vkN6Q0O|*f^aH4|=~82J9cnzd)>2)Q8o#btq%!6QEf@eq
zm_N)fZh;UD-0Q`r53dRL%8tp%fr&J)TX&muze6H*B6!>i99&kNJ{w+7aAA3*7mXqP
z58F0AO=YKblC~8^^I8e)<LoKs&SD5uMFm0|4KiO=PMX<Rg=<@Wyib`DfC@<CMZXPJ
z+o_Uu7t|#=wll>{Gj>l#zS=0XI^zHbhym%&0Vx`I6YF_yb=65*n@DY`^(%jK#SV}t
zA!cl5rWJ$;awG!gbYc7j&~w3IU5jb7o^5)9-PCW08|xc1>4hn(0IU>l5?7*;3Q1_}
zIzuZjmm=P#T#BnXV2S+fwt#LtPvnMoIA<{~eDbA@kpr(vF7@Mm{&AvwrxXa3nz=<R
zd71Cv`Dg*&?7sz*7^HmOZWd%)Y77p&yC$}KyeSAe+(&qFlbda`oQ2KqocQ5Gv$v_b
z21t1d8K&l&G?emb#etP)#qz%nOnFrzUU|6k_~;`nJ+^zBK-Mxt&UA#UylRIOJO!ea
zZiy-2iCLOlMvaCfk){c;Lps<jn3Z533zra{?7V{i;a2cJc2In=)xLC=h=EYGFp9K*
z&&YJMa;pLd9E(NK6eYu+@9|nt*8SU5mz?Z<63S*!2NKoicE@g@xI(JCim`F1%xE=Y
zZ%y+88`SoN{Zzw*X(EyDxWn#nw4Kk}5gtp~-^gZD_7IdLCsc%;><U_I-7j^sZU7pg
zf$NgXU{NNu0wr)Zwl6(AGTI!QW(o9!EfsyGf3D)9HCIu^8Z28;q)Qf~m{Cu!dP4+v
zSV)<G`BLJ*|N89d^RI0fI6ko7R;SU*;pm%DcDMUedLi}POU4Jx)+YAY=zq?RN)YeX
zyn<n}?zKsKA%4sW3~0}fs{#|m5a7z!6d{|cE{WIzJ-W<sopVjV?onN?5rf2^BJ|oS
ziv!4->_j1#3LjU8+7Hd!l8#oNT-@-0ZQ`Cyss>nd+cm)S7Hay+f5BhdaFQqmnZj~A
z07ab=U>*fWra^oL!V<8)Ww)IA#$}3Yay8ei$+hL8mTRWDUP&$jQy`;hs6FSb))4p^
z70yOnAycbM;_CX#bUo`$v=!keTQG2@$<SONS}nU^=ns!u-m&OxUs<0)WDT{ZTKvJb
z&5L<+bKQbs2RkY%%?A|}OIdN0j-g=Be@83M2h`$m1bd6+c$!q@vgX>A%dSBRH>zAl
zXF9c(==<<z`s1pgO;pY-AnzO3Gi!S4nKd`5XSO>}y>>0L&5Sj*3BHSdwwkDNwsEO;
zF?R24pWjBT*IA!mi&2fT8*r)7)|zC0r%K?G6M;3rdpX-l&GCx>v%<32e*;z*RUT`u
zS9xrURvgexIt4R9HII?{S%HjB0))b|dv%nl>|z{it`|vC2!#_=hTX632d>hrh}88A
zf+kCojE^FaT8367T7tyl<Eu580<zedry?06N#r1q)A)i$$<VdY2fP(;FyVh_+SPhO
zJdM^`|0`JL?+H1R-d<y_V9_%25v;-Gc|Bv8P!gLVTnf$St_?M_!^2s1vMN>xE(8#1
zU^{kmTosG<LFQwN`PPx}g$8`)vmk@LI0415;67bz?;uE`T4>G*4b;P9b<<Md!#N#W
zqdWOnD9zM!>J<TiTEGx^k0;|}G;UbDSD<Vs3PkyQEmK2=&`eeUkg@T6y0_O&a6a+L
zZHH@6tGiYP<hP|XAj$7xG?vXO<kvYM?k?VYPz8N8NB4%*8VF1PLDO28JTN2(vXP*Z
zK(=C>*uJwt!-s~kDQNSlZ0kgRw?4e>-O+}3<eyKd&IfJQbIml|T;_nX7m00gcNxc?
zNnHbGyaz+ZUP07>vT5};i<GvVSIHElN8(^yP$~^C31KZ;K29E;7BeUif5MPG%8idQ
zExlm1zPl*a7A8K&5ur(`6f^#!UhD_46a&ZH!Blfukk~?NMur+T;s*)z%_sxYQMd>@
z7xhCXR#GN4wReYV=Z%LODKVLCYaZVgHHN;hsFUkb=JjdPqC*#w7A~B=^Ohlnk?wlO
zJG%LZC-SfK;cYIeWL5<oe8i)kNhDILfMrO$JC*VDazMN(Vvyfn#VPhr9F7mi2VRnO
zf3PFMY-`MHcHFN{<es8586Sf8)^P&@=ip?J1;VcZ&%@MJU>lNv>3B)85ovX2IK`c*
zYM0nq?O=nsNy0`tIWZr6n`okuh{`@qM%KA=GI6<)Wutsgzkg~z^x0xzLQ)?o@@u9(
zRzOQ_A_zalF9JiSsZ^E(f!!TD6K0wj08O%9(-otItF4lwGZI`ba&zI=9#!*NAew|S
zaMKyUT5$aeH#(;RE2f>8M-;*q@3U@&kKOz7Y3ZbGxH}s;8EXTXSsu4;T9i-4Z*~ew
zDmX#BAxb(%vnW{O-|k9|?=T}IEf7H6No;*aFXcckh|-@7eKMY;YfwxS=4#|zeH=V^
zzHl}S3p!81q_+l;{cK%;Mpd$&1~U@%$GQk_xTu-nrI7^Wfx|+G2_<}1U9W+P)Yjd^
zDtUIB*D2>r+2((R%anOt;tt&*mp$d++$9D6U*+cAX=4-jZa=9oWrt1j!`mVjx+Oi}
zzjkmFa@qM(JS!LFs+wd>Fxn*>Fx_ZA6~F=7UTT@OXX7DL9BE&%kM=t$1IJso;{tEG
z3%^#yOzKY{4}r<&UTNbt8^O0AW_AgN&RS?PU}h(L!(kZ!0l36P=)f*U)>8pmL<J2L
z$xe-+%|w^tlpk9#yH<J7O$kW5U!Nw9#t2lJoPSL%sT)Eh&u){co9Zvp{6{^dz*8l1
z%BCF_auT%f;Iujlj5#s2awB1L)3T?aG5ph8jmY>kY<tIb?+*#+tM+bcYm72k7L=E4
zeUp?79@jj#A1gA30mZ%9n!Bq#SZ(+Bty}s)e7HW~xnR+oWm#-kaI%%EP4xK1_b;9b
z8xZ4cU<xzoamB(MlSRIV^{4itU{=1lU|7v2;dJwgqKgFn($F^#`-+UzNyAOH5%cvy
zW~cegYnS%%kKcXu^kwRoufG5O`P0WQQa`;qe);UhpHjaZKmO|Z)6@^&{P^O@@w4xf
z&Hec5>C3MlA3shu`0dN5kH6Mmd|o5|`uy3SzKuWMM#b<~yzV9n;Fbg{bIWo2d5W~#
zWj|fxN8)Ax8ZQ?CJp>taOI;%Jy9f&g*kBV@cVlwgw5oquRgo}7Pd5AMVEU9EL~maw
zJ;)2MpXSSrZ%VPMe{Ot>T8e||jw9xBiR0XsJv3d<1D`Vdy&-#OxvHmYOpJ{ah?2=e
zTUs~CLp0hrc?e@@*C3uU7$UsZLZJz2QyLqB4XUAx7yhaFr~gen{2TI+axLlEk=C{@
zkzapa^CSrVgN%JMP?MlB)nzlxJ8rcUL{2a0$LKk45$^a}iwo+0CaKYeA~<cS|Af4c
zb4T7^D|KYoID_|{%n=yz$oRrPZR=!a<kR<TJ!3v`Qnr_+qYAIdv|Qef&jO64L9PjC
zT<qLd1c{y?5e~T$Qb{7RN<6B27{vDa0?6|?otRl*y~72tHU9io(jWj@K&8L1(Imf@
z+8W{N{}sc?ZIpC+5g9m_5e_wJ4p)W6KB!y>f}%$I#(>3GWep{XsCpKE@5hgsQ951@
zTHApBOswac@%|*M6#%1l#fg24te(hE2t44P38kwh?UD?DJ!6PEuqmp^B)tY;G@h$5
z4M#OnIB?46U?gdql5!D)p%d7Clkqd91FauEx;OrPzVCwoumCU&{cAJ>fa7X)ib+#Q
z<cCtQob9iUd7iARS-UUAh0kCQ+y~Xn3AGTe@{CY8Frl~xu7GtJ!1YtiC@=<^&)j`T
z+}16EkOpP>z^OTh`fY5rKc*-p{t&~}F9q0lLE$b;#ma@Uch!P;5RI{fVgT+2g-TE>
zl+UNk_uJYj|FqtapPTQoDcqPt_WbSyaXo#!0~gZn2R_(27>V`)YQ|v|ABbOrifM72
z>yZ&lKL0cyEVxiy{NAOT+R>Kx>^t(_tHgUvy<SaB&-OhSEY~}6*IqC@d~asnTdbE&
z@Pc`7Jv66dz2x(upF-QL%yhc2LjnIo>fK;!Fe%3?SMA$oHF*u1!n3bmJ^MdT-y8++
zx&L0Sste%HOUP2ehd`x7LKwr#)!csZTNnoGnE)~=b22GbPQEiXK*=G_6473m5D7NJ
zzMQ7BvPIqz;fmn1KsKp>`)V4Eomf_%Mloa~)O2T<$LxlUxjLHdX=mRpnX>g1<dQ*h
zx(?#oMp+^=2M|TvE79cOQI9-$^I>TjE3Zd$Evrsx6cTswP>3px1wh#L;>!mVK3W{}
z6$KuxHSm+R8M-I%&QY)M<`#joZD_BdBub9qVb9(FBaS<ssxcuz=@Q@`ouVkzww#$@
z)<wRD;MEvroeS!+;${Q`8nISEXm5+CdVRWAbDV>IDI9U3w<-llx0sp+L2+_B1Pe$D
z($i7MJ3hQK5K7Wr0q5<s&(>~wW6#~ZdrB5j!wT5#>rC)hPwY1ge%CEZ!7oEvYWIEU
z2@_V4>7kIws-}+!-)oC%7JYhI1Qq6xj;G))&EaJ(CC?SIW`L%?!UV*Tl`)97borp2
zeR@UB9n@J^smFyI=y#6ne|Aw>c!ZOOLaZCnjFOH0fM7*0+=K}Hx36;ymMqZ|v44;r
zu`w!X;iR%?>IK1<fptd$+ryE1@3<GBxKIHFW3QTaA2kz=ymO6Q1^Dp5Io`W72;Dr$
zFjU7k#_lw4L;@5LDMAtlDx*bd#@B*=>(u9!IGd1BaaISgXA+tFIJ)1E$$2?>*I;>&
zm<eXSG>JQXKx56iYIWg|aZ=T6m@&UXKo*8qnjJ9vm9TsFZC~dYLtS{xb@s*&+liUJ
zE^M+jUPd{noN=X0lpjO>X7?#2Md)K`gVOinms!&C&(-+7r^lO04}vM%<KGt(rwL)u
zgIlrG4r#HR0nnwEv9--mn5mxndPy9*Ea#~1K*Y?|c$i*%CrNgWc|v}SIP$Il^JlPx
zbu3fCquX@bee2rGP20Ohm<v0@Z)`o2Ez_CQ>qVQG6F$FfXN_(9Miav?cbL_@Xi^&m
zk3Z6!py?Y;2|nC1qwUh}mRhrSf2Jz4?%zKj4*Q+$W=_z-ru0hSOCzJBep;;36HaEU
zQ1Iu(B$-=ir^N-A4l(c@fVP-wD)AMWgktMUA+81EY39f+P^Jp0QRFz77?+xibC^z`
z^0%AXMOCkx9@EjTI#<2Q*vHt|)EX$cfyccY*Ys_~b-oQ*&hR>`q<|z~kO?b{k%7D5
z*piM&s{C2PNPR#bs}R3EYmY>Wkh-T>ySq`DC~>oEj&qz<)Jc&ZVok>i-I$XSwFa!#
zUO`PZ@L!==W+uy4VGV%wdeSHp<O;OLcU-05C$M%-Pv^zz$Ui#Un6$fhx;H#Rives4
zi%54)?~u*FHvy{wE$qPpzS<k*zb)p=BREg=8dU)r?0qu*+rs@?tj0zmQ6nqc<O|53
z(wzw^)O7bWYswjhA(5=7YBGPrHj4QCkhaE0!;!PZ($RA*U*~r&)|KysHvKzzTeC5O
zM@*^yU17;ooDPMfqevv+K3)ZVWZgcRv__iNZIz5W3ZZ<FRu@NR+}p=I+i_jG3Pw+Z
z>s=Sx3s5~RorcSquGJPCW)6eM#6lm$wam(ka@Nz;^If_U72@)|ZbG<V@NSUorxXnf
z#ikT^gP1?lsh5}rR6mA(rL_fb6-Ui1xaKDw7*mN5hC1^2nT1s=h1D#P6`weL?j6P0
zjI$RSH9~`{7L(a}DiSe01Jaq)a{^}?M#5^>-{TXuq!w;AI1TtF2Bh%pm%?#7#JMpG
z+Hoz?Gs4RbpIuA9V$o#RxCrSZg>s{ENYYvPC&U#<T#eM8B7_^Xn~q$NcI*8AvtV(2
zE)i#u8&)n3zIekmgizE4$arlwI1uX*B@_F_1D85kvBR&4S2j)obb_46|HK@E<Ojoq
z^?MiMG~Qut>yAVtCS)TUB1iTFqO3nFxO@S4bSOfppv25<pw`tvy)4m+=5_~a2sOjZ
z7qrqM8fr+%2D949L691;s;z+~Z%Zfu=>9I*hZVb4alVa8hcEjg_!wo776al*K$*`J
z@=XH{Erw~NS||5qBTVp)M15Nt8r>EN-#Xqv8}*n!B}MAU0jSl@H-P!jwYx;yJ93%p
zIwQP92BZb~-__Jn4JcBDH8sO}bXX6$q&miEv2DV=T-aNAoIQtsDK3Agxyo(st;cxP
zInIM0;}8~~9q85B6$#GO8e~6VFYjN%TE`ls69?t*${ICU`Y20eF;o8mM6Z`Hrsc9d
z$J{!T9KDgQ#d;QwiJyMt%aMCYQ93MtKgxOU^~g0|9b@FSorDBxm~}Kj7PlDJSoU(1
z#jGr13O*IfhQu`zn8C6cOs)LK8l>AR5sIdg48}tOStzE4UDqBovc|Bt=ypTsW|{CP
zGZzIv>$xXJJr@NF&$0tv^{o~Z#ervwi<aBGMYq^L%F3dN-W>(tAk}0IF#hgbL$n?R
z^IYM|F)Nmms~B*Gs3cy(eN~VA`^3cAbLjs6>ZEEBnFQO`#KT*?J)*D|p`9`6_t7=h
z#DG6(t8rwW&d}|o?h=rzd@uc{cZ)!jh}FO_I*Lezm*aTUO&7~CM2Tw7%^4LvH^$pW
zu93e;!FiVC6#9H*VBNhGs<PjCK{SXe9@8L(ka!`k72;Ei9APBUAthL)k^-inYpVYx
zw@xWl((#+dRAcW3oj=GrNF(2V|NZ}Z^7#343pOIp%%YFF7$xx5%csZjhwhR6F5Tnt
z<7dwk-}2+_{XT#8;%WRbJPUe8Z9h5R?|*#J=^Gygp$p&Ds}cZIIphLVNm}F44n_b}
zRXGoQEJne=ZRaChsU=nal!(ZLO7>|`YHl8d@l7p(xH^RdC9;FCZ$D``jDJH+IS&#t
zx?7m^Dia<PR^N8~ljI&59meTyaaA8>f~-W%k#Bqr%23l#7|(}AtNaDMraVeDnczlH
zQI4viTa>ns1Gj5@LGlFw0(^vpl-Os2FJX=#Gz{hLQ0fazrI^E_l@clo8dOgljWt@=
z1&Al^cOzU{>@;g`*J)<32)q6=V!-HAJ0-aX+%5E9=u7IUPte1X6-G-~Y-C|(NjLh2
zUNXKXtv-%G$fQCu57o~lxtuut1IE$-`Ap0P?xIHAo_eK~E;Plb!+gGb{Hnuj<=JMY
z32#LVlOJvWE@qbUY&)~WvBk_%9|kAK#|>DYrN0I%j&S3^Er>8v@dP#{WBIbl`+Fij
zRu-~RBfn9m5DA<bboIj)0S01h_&%1vWB8JcvHo)-GkLv|PFi88>A2f5f-VyN0G#j=
zvxiB@Dld(Wc0%O=0^$3N@HQI@03X_8p+n}8I}ck#U<{VsW%N8W82+p*q(*}O?yvP)
z1z;}L#gdC+f5T~sk>C5mgN`L~Yv&nNjcERL=DlQwOP+G|0BjaAanK@Muc$e9eE+_l
zFPRTlf~G%ps#=NV3RnySi4|HH3P1_TV@SZ~#d2998o#+Dj0PX*WStlZq&;-Jr{?U@
zE9|8CqQFtCuCl}_t9;OPbBjav#_h*SE`0al-U2wL7yB)1)gnC`@1%}>u(_`BT72r)
zNa|~DY`oTc$%}B;vs?clX4ize;5}-db%JjL#lo8yR#TNTcKozs%iVFWxR}`v5Vo1J
z4PLmk#xC%8TM)Q+Q;wmHU(2xCB#j`=^$k!rBk&s=pi(5Busy-PTz9KwOdqt<ofFit
z=4?DjXqUaIwW{Yp?fUu7E`V#$X|D-KlZy@>ePL6JzM#aS$LsgitOEPea{`TJLOftH
zAZZQ^*!tp3UIbh6a#decAgeWSC1JVoh2wcu$pnTMQHBmE$q{-&h6#7mj9I^ev7Z!8
zHNi?H+9XB|Nu660`6?Eq4BIUDsbo7o!Hs_oSf0>8XWYL1^Xkm$XZvJs4x0yeat2Ob
zP(0mjrnVoz`!%l$QFeOCfYeM9z&V$vgXv0S!uq{?Srh#cZJon@-7!3^#0u)@==ocd
z7TFyJ({p#KFbK>DbGLtHj-xI%15npwf8>=Bnv-xLDH%4c#oLY=sry`p^NKfr$02c&
zO@^_<9Y0x6`KYW`?8n2iOF(C4U9brOF!44B{H<QLpX$27iqY(YkZiEaUizeBsQ`on
zV`RU^UEK{JBl?hT6gA@-I%KPd-~%L3nMF1z$7kbFzDFZFDW+Z(`i<0j-WyT`6eovb
zSs&`Bi7B5f4de_lha9p8zZf3`M;uVFzR{0ir@_YAMA?Jif?MYj#9Yu?0>VNc0777F
zpmZ=)&z9$fJAi;`#D?m=3-S5eVmgH@%CJd&b`u-KrV6v#Fy4R9-+o0&^Phe-qFZtj
zp|($_O%zJUBDRrc@%&Ib^y61z<L=%H(qk}JdKBLWo0h8!i)0^vltr^>o8h|Iltabb
zob@auw?YUum<a$-3pid)yG4#d;FofG{c>j?Wx0?2(4by{03DX@`kaDe3$YHj?Fvji
z-V#%u^mg}yFdX8|;MHHGR(}JfCSp%^T)ND|ke-HnrZSd9&&*(5mkb>N(O*0i$H$B0
z0NjVmlkOn=<Lexm^ojY12WF@9(sN3H-1Z%}nO6%8Ufbc+WFLzYMMnc}qMIF$SQhpV
zcV7P;>xlc7<K^#J@13-iTVL590)-}sNntxRq5i20U?CepLuphVBlQ3rLBlLA<q9z*
z?W)jHrZ(<ZaD{>jF=VJKaASk1Z{Fb5845|^2J^$49I%Vc8_X^50xv|q1Sp8u_bb%i
zO#f<6E3V_bi7K8xp?o)|jiDSSCb)%!7Bj*&Ww*K0Gs;&*)szOfCgGN4DKe}d1cYE3
zb(-?3Dg(gUi56uEqvJyv^S8712xbh??6AY|H?)m^58yAEDLmO)*a|lTXA<u{KD@2H
zXE%~>xUV4XXopRE`QLO4x<P9ccpwE_5vrLJh#~r{f>G6|I#gJ7CJx@n6#da7#rP#2
zprXGzBfNy6(K&l*VHe)F5mH0BwfXOKSVlp3MV2LUc$$H6@V^Nb2`>TK_FDo-nKF<z
zyxkDA!@MjY@fpw-(Laq21YE}^0^3pl(Ki@C3tHQ>bhN#qIAgYAva)9an7X*iyRF{X
zxDAe_05K-B7c&qFA*q|<=E&LYn}T(K7a^AgQ&>)POHG@ZHtOyG6+H;<BD@L(Gz-HO
zPEj%sZ+F$hO~{Px>91Jd87kp`KqJjrS#RB(6PC^(8n7vXZ2eJ)tSb^}Uk%%?6XR>b
zbw{Hk1u@jia>dDNMMOs!;AFPeTiHknZ)P>vDj<rB+$w8=YUA%ml5c?37#ggtjTbpQ
z#(XK{I9Y1!j{3;eW^4M=FJkU$*64i$3z<d%@W6FWc<d25u3#a8Df^_DK?=h3NHZnK
z%&0Z4i%wfn0b&-S$WI1_w2VOps`<Q}LM{fN+p9B6L+j&a(O1P15LK<hm=7+BwOY?`
zywUO5RmvO>v&W~cq2O5aP_hd(4}EMs8^QDq(sM?3L^ad$3~?>=v^t>#3yY_Sx5CiF
z<wkZZM>-g%JiM(44li~|%Lxxzuax~vC);@P38m<9bg512l8cp4wc`?5j2qFUJhBD=
z$>(5x%hf&QV16X~3(yRdF$~&}hc^u$PF1K>iANewNj&w*-y?x15>Gik!53bPs>2Y_
zIh<P?Y3rT}@1`mezQ!lT0as1tAJHo|>P-{%vM@MQkSr^Xdc@WcH?0XqLk=J+OT|(X
z2aIuSR}^&Wt8JNRSBd@2eA*kSIB^sLqnw;_NIT)V`{_AZga4)#j3?zYx&{)21tXBF
zQ38=Yr`SSZpi#IFLjvQ6x35Y`%YE|nMs+6$RY5ZF_WFz?83_TJf_RYGYIU<Akewhb
zYuf1QY!^Wjhg~h&?kZI`!$sJrbV$P=zDPwFnr5bJi|+(+>PT%YWlSK=ih!!A0YBTF
zmMbbJ75;Er%LZ#?N`Qr({Oc^?%_@U!TV#-{x+@G%Z*6%&atoXOS6Wn>xu5S2OO~+C
z+8=If;i7nmu#<j!g4Pkcz15^HyQ@jhkFx4Cc761f72~uudj6@ro<+sP?lf9XEM-MV
zl-An4_(sdH7Omi(j<Tjk$05~1Y1DN%af({ea=v%bn&kr2pd2pW?Zncl%o9AnO%~?M
zE(KluSD&@*OGH`Y-6f*uALnx9O!b}M-Z$G^L#ykwJl*9r`fo>_uixDEDdn>F#cBdV
zC84|dT5A&6uv!)3lX0U^_dp2T59ii6cAOk&VTU-7$2RD3?*!cijZf=^6XRneCdVq+
zxN6j)e4)UsI<;;2NDgjM6$6@wTl#I>hqV8QkHjCNcHsUl9B*K07_{P`6x@cbkf~Ko
zFgIJWJanBD0#xc#dm%EzF&UV(nE4#rVpCx0&Q-$(hjp{ope2D`c&_!pAtRu|@Fg&q
zNJ|xgC<9v)M2oiO417j#Xf{>6<r5TV%G$>tN$l@UyKep&YLy)e`kz*U>&!+kFg+>`
zAK0xv%eA(EmWUr^;QXL76;ds=!W4N1F*vBZ0jjENS#va+;D9c`M2X4+)Ojl3qXcq>
zv1N5PCTBa}>=Q$N4Jl-^5b|qD9{>HtgQ(<*dHRvgP+x%~k{z)g%&qJmXxHR3pd+Tz
z^{Y<o>9#6Ff>4UJXE=C+!@4wLZg;J69Tn}ek8gF&KaCpS%>&rNcyI6gNJ%b%YOq^k
zfv{4>$3=OmR;6IU><>E|BBzLuAGAY{uC?g@u@!Aln%#sp2)}pN`FRb+MUd63S;k>d
zT=zOgc2^!5yJ%t$Y%y8Yp%<0HIcBa|XaW3K+HwB#&zPvO1Y;ija+e_AzWed{@yn;j
z?(d=aQBlY-coBRD#b6eY8*~8oKiV7JcGKf6dy=?ArZ*|MxZA#@Z;c?vs9o*2DGFcy
z0oy`t!16=C{~CMJjZOGCfeFc|gy4|O+fhCqk2l65P{dUjOiYo)7~+pRrO{umMbR|S
zjRfXa3ir`)<5A|fPCawrKTF{4gVp-9d##(tfh9~bGa%Yc9DgU}Sw&gV%pYYA<lz#G
zY*4A%^FDNTnmy(<ufRnn;(s5acUo%sD4`KIjf-$15ODa@sB}*F!%e+M8<~Xd;3giV
zANnx_6Am9A38NR9+?3lqP2<QVrCvZzg3tyrYqL5Hdx>86E+$_)^KRaSLfK{0y7#sH
z;aZz^u#1<~w!Vp<BqW>u%`y%=kBW#^LOhUN2_|Dh#LAs$clfV<1&QXYS)YXK>>k`?
zeRn8SOpWhYo-hn@-{r0T0*3aj=xTm~30zb&Y<WcyB?di5Bjg?bUzN*QF(FOvN?7G$
zQu=Ta^P$wci><=K-}C_f;DMA#SMvswz=0X1>TTRq5DOAv-2U-xZLo4Y-}Fw~Yc~Ww
z>v?Tk(aE@$Q&Q^ESTv~xf{-3@{6j+DhB?_g8UBv6Y<R@kDy~hoBTAHgDs~)x3X(3+
zh{Lq@PjjpFgP3}Wf-9aC*BrQ5cA}~dei~H&0W-vs_0N$M<BBv}$g!h0$-|FAiXWsq
zk<9d~kqdU0!D!@Sm(kfvI{6FQWRvz`L{~uVAjsNXOp6udLN3?sn9D#x043LM@d6_V
zerF4;OhPql!um+m=Wl);a#b;sV;wlQUaOaOfl{8neEH3@=K;zJKe7qLm92aN2&A85
zJ$P9I4QajZaHB9845*=<(49Ym2t5^^oKCn4Lr-YA{_#gSMLTG^=>sHAoL}PzWgD`0
z!aMw<vsK9p2L0?`foiTRDc%m{*v79ZO0zPe;%_m7BY8!3Sog!b@+u)U8*O8peGe84
zz<?TM6BX?MgQgW2W~r(c#n{13Cx*sRhWd4-P=GojWPp9cuoBvVy7m_NiPL+~deX#U
za)D;I5Fj_BE|B<`uysb7!Ztd<io!7s;KSRBST!3Rw4V<^%jy%lVP~FWA^=uAe%2<d
z-zFxI8o#7pWgNrmcJ!oZg2D@U0g~0>iJBVl^*C-`s^UVSCEy0Ro2sqOlE9xRT71Wj
zk{?-hj2takz@o{DsI*`1>4NTRw#%$rK*~2pxKl@_v&@^~;(9u;u(&>`xpzZYDie7L
z$6#LLd7E*)7%_}(pendBXVpm)P?bEq{rpa8c~e25?-5vu(}8IHB1f{EJ2Ag<o$U>i
zY~z4OdUWfiOlo$sS8JMNm)DGO@$7QvAjfBkSb*XL;o0j|7#QGN=a>X-#B=629dCyn
z=)_R^#~&?%(s!|=$%6jb7HPx(*zSIfeZ5)a<$v+ccLF>4+3kmQa>M=S4}bl2Hj1We
zqdEVpw;`c>_{SeDNW*vWF%Do5@wVmNo^aIb?!S~ZPDX+J3VR%cnr#hp9dT(WOd1O_
z1~ll^r}47d6hyslqNzkosXqN!5vAI}hGXtO`FMx@zx+U_&-2GW&euQ9yB+4>EdTdD
zqrKa99c-2l(&WsR`NlWHdWhyh;ejiLqAe(Y5S=P$=8g<?uDKt-`R3`%SI_>BHP+e3
z)?gP_4nud1nwla6javr};oMc%r#kf|7FiNxX|6Clg@@1n*h!Y%0kO#QR9v;ty9CQR
zY1gjtD@+#8ypduD$dKz~*>0wx|JZB|@_L(Zdou}rgGuR9QiPP;G;$IopUW;p3B1V+
z?u{$rb|+YhmBvtiFgA{=cCO9Tg%igpic!Q^kqB?WeP5!d5jz=)mzZ74p>MzSmp4Zo
z`WS%J;ux4q|FWWEKF+mo4#itk|5y_sGAJ(Z%BwM0$R)8Ikr=3Y`n*_pDmCwm5^f+G
z{FtNjvUziIr|hp+LNPe71#ljo9$4voi6WoFF9;&Qtaxp3k}FD1^%D*~wOI--;q9up
zgvtdFXaz7cJ}yNt|6+c#Uc{5aCqby_szlqE9|>#`;*t9>0vdU5VsUb-qx<Q4i*4=X
z0;=D2y}W$-&5LINqCPzdl*;3cO}zNtePUa{2X-hBl(jBa?(34-eVI?IQ(Ub!BYgFR
z-AS8#e63k;WF0TdP=a!Q$E>3tamBry|CDuI*ihdV2<wRw5J)aZ*)RH84>Aknt|09j
zU`@t<2NQ8g<lWtL`Y~Dqdbpd<*av@clvx_Mr(l2hN)QD-4*lcB73bc>;c?p*nXcM$
z;gPpM7ONKJ3=sbb7?aY0&<5X~LwdM{q7NB$Xv;OS+dA%sFTK;nDy{D#O$V}gbwUpQ
z{uh-(V}+Lutb#jgt1$%-XuJs2lV+s+1M++{VI|Ns!Npw7A>}}()kHX`eCZ)VYN)^_
z<+{yuGxU~V#vAAZuIZVe+x&X5zgT;;pJ1-0ws(gN@|0gHz6cvCK_Q{Q3IL9_YpR+Z
z;T**S=xc$)licJWKL=cl<@7aw{3dc`$xa|L%Fg={!a7JfVlAk&xogy;7TK1`tx7I=
z20VzH*Mu-!UxNRE1+EvR@x@W8o+hgJVepJNezKn)dU*h_dH6G+J9&6(%2}*cO9v?l
z69vPxriMNu_{`>1@P7x`jN~c7mbT8m6ZI_*Z{1rW4c|B)<xfslT(P`u5$Ou`#LcRA
zWf+GaM&QF3#a)I&eGnqfVewA1E&xco<2HBT30*VpKknoh(#%d>c%^&~<$<Au-C0ea
zuUd+BHUaw<8m}_~bKNdi^>jT+iagjvuub?R2)Xec=zybZ-x80MK=oyH{Jm=C5w(CM
zXPY6#)}YU9Ah+#u^ey2pVY5l~jsE3+jZc{4CcvFKnuJf!)tIb}I$ZK%+bpm$dMpY*
z1eZ9k1F%Gn=59FClPtHa{jmDLh36)Y?2#U+$qloqxVRoDF4G{y;;g6^9m8|@rJvsJ
z3IKStJD=^KdUSN29kekCxY-)HzWrEzP<)N2NMZr0!p#@6T|(2<XvRe=)ubiISd9IW
zMIe>7i&p9q(;P3n3xSI_DH7)xG!uZLpIuoCsz&no1R07d?Xp%3c~a*103X@9j_}a%
z#Z+bHZbjyqf9s&5zc92f3VG?z%XX3uBC8rHsKDTsT0a7Gvt+1jhV?-1+hPIt_a42{
zxCMz>h>C$6+u)EexIs!sM49+arX_?y!p5v{H`Hmha;F=&$Ct(Bgd8j@@v2tN927v1
zZrpT$e8Buxt}ZHrRXHmbPCq{@rR+j@R&AzioF&V3@66k&e2|`0kl|5=g&F)1eO0u*
zdfhhe(VibH5ANCL-@6Z?WBz!8<sVMM)nZ73s%^^IDMh5hg8pM&wYuPLk1-EsvZ|;G
zgA-AZy2%9L-d#~jK2lmXEnz5VhSHu2!9RGCr`HZsubO(L_FMlXPWg};C7wWH60kd8
zpPp6|*i26XxG3-qFDHh~HRZAZxk=ueJ23;xFFoPIc|{dPy9ZsVRtFS7xl%n8RxC%X
zwQCtdVnc4Ypxo!p`edKqJTl;>tXbrVpA=4gQ7y5|X}z#N(>2`ptK(1SC4|0Dg8C|h
zrdmK;fD<->F%0b|7-Eg&Orcx$HwN5<CAo4+%RE0VCe_T*Oxf7iDD2+<Hnte5u(?kW
zqf;}>X#ok`&#prSmBg`3W2gEKuxqS_?5mA%23Nzy(@521od|O%2#*hcN4!9k88ig#
zxaQO`TaT~_hGO{4dEG!HTz$4G=2CYB?+|z=x~g{#H#6*-XsGT6h3ROZCJokPhw?^_
zbTf(w$8TT|bCAm_w^(G#_9o!4wx=5leDM~d4bAxUnH}CB+%Mjf;V9iAZ)MylKTftA
zor1oWJ1$`JG}$g6p)JkE!N&e!vQavCTiS&47dHvdk}U>@bxXrl9XDIm$wu8Jv8}DT
ziQB51WLw|s@qb0f-#6ST`zlQ#FNoX6hsiF8bx6A?zXw-16~<x!S1M^3^ocdGOn0_M
z7P?}wVwJCx<O?8(RPi7S9HDfUP^0#Rw&9wHGJqYU!duTBG(vC=gVvxa8?gp|$JTl%
z!gN0@!gL>sFnxu`O-nIF1(=TG18J(NfgCh}O00op{W;W5b2^Q2dGT#U0<W}FA(Zn9
z0adCA<2Rc+Q&dx7;<m!c5VI>q$beTCtWSwNlZAqUuahR+*xVM(kUP2xY%zepdJ%&D
z$_E$u>yb#QZ-%knl09phHJMAqUc!J<-nM9K=CYD-VN|_SrzHX`>9_>JMm<re&Ye8M
zUlF2|<v0$J5LYPQRkkKCw#*~8%4if+eME@b6sSQp!wDISL_?ZCx>}0L5%K@rBk{a%
z^;j`JD^@3lHHT00!Ry-H&2B;6c;6&evqy_?S1uT)93A>%eG;<FEptZ@E%K}t8ME;Y
zFni7?Q0kP!29Q25-Ak5G%Fery^7!K7%zNC~9@fUqv@<AB>-K|(BrAew!&ei?ow6lW
z1cr=Yx#F_Jdrey}xqbN0rf;&*XR8u(()dgMYuAslUax-YEuwARx?6*z;VZ&>cf1HV
z)xiDvzfP{&vKc0(P%gVmlvo{jQR@4Y%X|-`L9pa7sn}e~m(Qg}CS`*e)`yV7&QP{H
zp94#RW*YEjut!3ws893D;!63`B{*6g35X)!$^f8$&#A!xxvG%8px(Y-lquhVMGMyQ
znJ15+;tEwzKJ^_?sR2+O@-C6Yt5~*6DD5Z201k|}M{#F>VV{eV@|_0;0{onesazaE
zNg&SGI2<3`-Fx)g#{GB%|IKQXHIFM$zV9gPBsBw=^?W_M`5bWB=8y;O?h7uj@eyYO
z-9?k38Vws5V2FYwNJXzDIW@uU$ZsfS<0)s@LKd-9(+2JY<ca!moH!V}-|BU1(N^p@
z)Y&KvivbH8_P!jG37Zc%Pq1~YlD{{L2Nw^YyAFss4ewcujU$XT9Fn`mm&I8jgThxc
zX3RJ_x2;kGBH2Kg`?r7wTeQ$RUN9{g=b?Ak0`CkvPsG>Z?kO~lCARKZvML+4?U2gG
z9S11$<upivOJ2`~nY>2{^wBbYbn-=jDI;Rdj}2;MqtpkOyN6Oykh4ye>a}k*a&AG<
zA$H9&C#;bV5@10`cy5!Q6NVyS?{zzJWK2~SjR|sK?#JOM@e$k&3euA$CaW6&D5bOs
zV`~gOq_7LS>TZM{_eay+to1X|k8l1c=X$j;r5~X3G`d=6)&N_8wVL`AxJW%6W^R6a
zq~cqE8`(?BZ~r88{Ps^Bf_>a^kPirxRi;WAc-eV9<010<<>I1R)eGFy_#nRh)A;S5
z@`t(h=T4h92>O$`mNE&_`B64GFBWG~>V}xFFSg-iHVD`P3@P9HC|kH?0xRV{fHgWj
zWAI~BMy5b_wVb+dWFh!Zs}9124}F)mZ9zrtUE8y;UH%i;dxAOG3r4&Lb{V}06-NAU
z$c;uskjII5zR!VPd0b|KCDnr#*zNHE7cF}?kPaW%Bha<<hjDyo!O|%t62s;h;hf0G
zj!|HdqWQRY@5;3lwjPAhb?J_njR?#h8Pc|Vu;p-UvzX@t4)W~LNz_kAuXQe;4m6Z!
z_y!)><Y8AfIPp%C$3;x2x4pM-{jin0g=kX9Pkam{7jd-l^yWoVOvG-e51ibvhSjog
znv$#@{pEN<-;()buqs(xZXTdvABv-cyru+WtX@&f53<#}p=%a{7$9g6Sfurk0cljD
z3pijjIyX2lLx4zkQct-ue7Ts~(18k7XbgME>kBCdMRTLU9E{r62NH_oE+l?@=pG-M
z$G@Fd(`nrv#s3~<>!qlxq-vVLUrCe*UC~=MB7jW*=!XHUB*-i3AM91G1&xA`BFLU}
z8VVXV=+A)WQt7pE_7tq<WWTBtU!c;&NOe9F0q@az0X39RY@!r?6~8%8YK*bf_$k(G
z$;<h&y^`z`8>h>)aOmb}s<TDGIav_)C>~l8L~Sr|4C6S;voM5rz64_juMSlc;>AhY
zUyQv*%V$MW97P^@?q3U>153@8m-g{LrUf#oco(p8KY?!0SyKc_*UgHeXa~B8bqO{F
zWw9xU`h7S6QWLV;+kr#_bR)$d+N2RtgRiQ2<y3nlui$o%={^Wz0Po{j+1f?GLxsIE
znT9|?a832#03m;NRN{dm1@m%;c}GqJgBipB-szy;?kadzAK_~=cnrg^f`P`oHPYIC
zh*KFbTQU$14A^Qj91g+~p#fR-kgp}R)F?MB_M&{R_FDLFcNyUw@_Iy(L%nPJm@04<
z>Slw!R|UwGB}H@^cOP@)XB|tS4dj$$gr<a&yT0@kqkQ^;3KE;CvEy#sDKQA=L*Gd-
zBKjK>Sr2^UcjJvcbK*K?(db4S#(<;7f_XHG>vXItF@A~SU_2nO%?W$w=&Sy*SP_cl
z&}b$;<q&0w1p}<2x!93oOYAXdXW=gSRa;Hg?vRo1L26n0fq3DD^agNBh$})vcpI9A
zkAZ<gZPOAWcG+Q%2WT<H01LQ&pw0sd98(dX)k5i(0jlt!kPTNHyoh#h{F-f2gJVms
zK9pGA#_kcTj&uch==KrZ381@@b0PF5_sMrDA2KRS>K`hd=v&n*Zwa+K2%&6l$m<28
zIFkfcosP2UdL<E7Je6Wb+W^Y**}_z;!=y>D<CgCs^ctik1bnp_UzEuNh2hWZOSFy5
z>uGfgD8%j?6msxL#~V+niSDz>taQw_^Y%vm6Rg+G#NqBP#7r&e#or<@+k~c_CFge}
zIp17x2FB?`+TXf+v^hVby`xnD4we|K92qDa;APO=SA(h8lxv_(hfoB+KvQ2+S1E1V
z##)~${^3My^jaPC%lUm9Pn9oY8Cy+AjxlEb-ctiEdZ59u9+)$k0iYuZ{2g317fmHp
z#bf~iU8Lf7wPav5YH*z%Wt<-%_MD}09lKR+C+C4xHq5~Un4oooV1xE@<gC_8YqH2o
z`Jl*8>e?N%#ZaP9Dk@1Y&Jl`~gu21yv{9S3z&Sm`n!<z`mK-sL+gi`4fYt>?(MOq7
z{jI_=2PSJ>(PU5NVp0cfuL7`{(pCmZ3IE6kyA#+;r;$|`CE>06^3TQ#fRRrtv2|AJ
zEK}93X{T<HHHU;0!Y)^8qj~~ux0Ha18LhdbN=qRQP=ts|6p7S>Ly8C!F6+gV;Z;dD
z!JJME6(h-(>aYU!{bOChUF;Y)G!7=_f~GdgT8*()oYpgxCBI3vOE-RKL?qdhUR6_~
zeb`Bc?A_m0afumT(v19_4=x-lxj5|ZX;c%00|pMvVnr!q7l*oga%8H-Mg307zS@er
z>b{YqxPACen=pe1W59qdT$D)DnZTb!{QwNP*iDL`z9#8>_hFlF12e;kia$sE4z{fC
zIPy3ty(F=HvQ04ACZ6nw+Ud^u)ivjAcF&Xqzm=63rB=cVQzjw;xT2L5e0qu<6n+cl
zU0uR{xX|wCwk$c-CiCWctW-AOwZ85}t2WwT>PgrcEFrH~EnNtzOE4qtwiQ@aQ}o6=
zVFCl$jQg8C-D1DWG~JZ)M-dmEp+}`OD1#qa|8(mDryL?E&EPimS|5a<t?9}nv9R+Z
zbO-#4xiFf@g^_w1x*nq0DAsX7Lxh5SD12b#RKmTH?3n#cO%^YwSOPht0u+N{8det{
zrCXFiiv@I>qS7S1A5Gx>U@oUmw$eq25$jivwXp#MOTfj>{<e<$fdU@6-WM<<M<pY=
z<Ka&RBz4-R9_%>5p$jeqiCr5#9b(O4_sgm}L$H(^xL?vpVz<N?+d6~-lfUx;nztZ+
zIu(|H84X7K3StjQkG5D_VUbP&7A}<Yth@!ETdcqaWg230OE}2x*;0_Nz>4mHND@Uf
zA1^pI&LlrZoZ<vimTPb3A<G#WS7u`gUoEX1Ag-5_vb`+bzz<PhzW3#b;#3<)BX|N&
zFj=uUapc6z<}NASv$BQD;ttLDF;DdlM#7a9QuKPcq{W-nmxN(h4jpN_0fK?5@$GRV
zUuh$qmkve}SKv-rdrks^eD{C4-@#7ZyRS3I5ALR-DHL3BA%4rLTh=)w=M*a^YP%C~
zS;7s8<gL3<zF*c0Oob~TGPV<JWn!&3)XEKm4mmC-pY8Pm>^r66-;hlVawC@Q*88ka
z4{_&Wqk7~?h?P6cvxVwUOxOZ!?ehQ^h&EF+Ztl$Hoa9eh1o(*@A^0Rf*C^;9Qgsz3
z#O;Df?-o=HgJ%;kHV#UW6BjWrU9E_B1!p!;<QQq1j72L)RBp>LRu=CW3%qTEm%Kq4
zsFhI&1pQFmaRrf-FTlBNucMqer!#F1wvcpvOu<1_QDb`HD@HdL*8;GIW!*Hu($rK?
zGnSn}#w#=SfFXmTr3GV#xJclN^8ulrkqt-sq2-Eu`Z!p4|Clwi&U1Tv_@^?^?&~N{
z_{Xp_{F5NM@94{0FP5etF#VMe5aR+oE$}~oPepUvt&zgJu{VmZ<4(voBnG+#rE4oN
zRZ0;w*Zu42&4~Zwvx7GqJn;0=-`^PXWl4ErY8pjWPlhU%S}#|XWA$8h0MUfp@p<p4
zh(%YB%XwDg?5iu`v8ow(8AZfZFZ%!82rzW306M6g6c{aXVX1w{(zd*{<oJmW3%)<T
z@0qas!&JKJ4;%Y4fC_&9LW9Tn?+*+ivw}lgREs#B+Ph{}ITzn$3@m;j3{N$|W3XmS
z$e>o-A0O;U$L|BP?t5?7bpqVZxd=_4TefR64ji+V-o)7i_634tA(Nq#lc%$C75e+%
zM^@QQ#^g@;s~Ge&b}<=os{KBW?8pfnXNw6r9&Kbp9%cT1>5R!oZHg07#d8My$0()I
zzkngSqoBS26)e$7g4k?|=0zY=Pqf}9<sOp54#VWI!@WmOG`09UlLMT{5#!ulNUm9x
zvx3WeX=ZYR^3tk8ccjTumH_@R#S9B@Q=BrApz(Bt`9|EjPc`BPf#mcm7E-O0dZ2D3
z&M<P6HZ7aUs#;2LuAjul+%bJ^OgL7ZLGg3PZhGBB0RWbMIHJ=4UbyHqcC0Pl5NORU
zHsJxzZ_s$=;U4MG`6AMLBtYy1)Uv|@0Ljf03qa5F!K4O(!QJf}TxtD5F_h1QA~<L}
zYhf;!*bwhoE@RL+9BT|-Tg?fVmd91tRq?gG#5e;YCF}t;!A=x4mdXv(KO=$+fS8$S
z#=O^?^8~6E_SkRRGr<{=*?@3=1p+*V31Ejbc+U%X)Kz=ra}YmtoE_eUV~CUzKT0g-
ztobOyyqdldcQd85fH04qM&m8!SEfR3HmKtM@#kiU#tYv_oTL)0b)pq5n+1t&0diZ+
zj(aEcfu2Ega)<^KM~aDaus!C$n;8w6Q;MmC<XoCC9$uw+fiV_jm)vo*bklYR%Qvt)
z|GSKq-`;eZM^>GCz`L<0i>3DV&em4`RQrU6DoXR9{w26qyi0q{x>=%=Qrpi{?dxk~
zMF@jsE&WQUJQwoAP#`$M<y6ObRkqsw0!#xl)#g)O7ZX5j$iZ96Nm0;B7R(g7BC>_R
zKeEthBaHjPJx<LP(CzOWkuf-#QCMUr4}g1wJl19DK}ij``wnDvxhj@jqJpRYrFW`v
zYv2mgvc}LX2sDB>4#lNON)lnb$~E8_UEtKf2&<AM_AGV<DOm-4D9m!i3VsPjnE22r
zDsoe*r#Q~&8zqzXcHYq|TY@}#e4QW&mJH~~CBy*{w*%%Uc+0Xw?5a5Nd@=#UP#9P2
zh%OjSW{5X4dECwI3j0ZWDfesNP6kr?y--TOxA*8f!Wv45<q_tI2X8=uJM*vzC;~$u
zFL|7&1lNVoK-4%RJz;J=Sb;I8{IXVn1<kEj{49>m>jtww$U?Q5A)wUjPJi04k}mue
zjY>YDzXGZM=|#D^LU6jg1at*3DB-Y$BPSG!2vnvECbLliNDV0;VC4Ag8_2nyaZyv(
zLyrwnYb_ouyT-Up<IN5$-&usCC}z(q=VZVm)Z`ud*a6`e?eRN+{IXRwM63=$H@2=z
zY;#1Fog<#Bf2z>jj^Dm`{N2-ylh-%D>%1m}5Y3YkB!@N_z<vJ1<0t>?@t?YV$vKAJ
zvH{%<PN3knk;a^?>ZB!%xdvSu-84rzm<LbFS$*kb*l)m&;&X$8LzA0~e7_eyAKx5b
zML&$dO>-^`Y4Z1X*##e-dR?v%c~+x{QuP=|i82K(&)N-ER+Ggdw`8>9x_%zk4KGV~
zUYnt8cDQ^(*@GHVve)S9q66itwPIxPFhjB@hKoXh_C}7S3i1CZbRd&6pohiyWIQn^
zT-`a*zPgL4wCB+?4ho^>%U9m7Pc!@c#6J&@UJ)&Kc$BD~1iIe5^AKWL=?{uxr=Xk6
z42=#GC1K;*(Cf5qHntGNF~ALiAU;Xh6LzyXz$-~r`M`aQSjauh__<abrc*C{9a|}l
zHSZHBP)wm)3Z@>}iG$M+T{ryH5;~=QxTdBhDWzo;8_1)#RL(R<jp5x<5tSQC3C~mz
z2g6x)Ks-}G0!SWX?$+~Ddz(1<Q9==%elX>dE%+sacPKKMZXBm0@%!|ySF(e_Vyz1V
zUt~pf!xGyF{orvRV?dz=^x|k@I+wI^&mB>cQ-}juz|)%?7VLb(_QZfl6z<VUA+usp
z2wew-cqPGkQZG)cvo%>%v0%*y&Q2Eh8x-f0Bmc*`#Qh4JTCPfHt-ICFRH^e(x8$M$
z!WocFouRx?dGanIad_b<t$2_eS5p=%^dQipBD5=hnQNeOwk#aiCSqmSw!~sB4O*Uk
z7AzCWSP)K+xXnd1BXv0%1gix%8^<IykjXA1$@EYalo{Zz^ZjbEUo-BnEKKASyb;AH
zRO<IwXh)g`CJ%RK&#CmT9e$s&<6(tnWgY`;g?vlxo&2rOL%R|ZOLj`xLSm_8-B$C4
zcH>;>o;AG~giEo`P<LoIxw>9A!8P4832O$G3TlX2KDJdFMq4>}X6vT+$zh#kh!Ul(
zu~W4}kZ?3!QMk7;^spXHOnh-AYZ`L<O-muU+-e}ox8-16<6woJU68CDfl55<btO<p
zJV4Hn;tR5x2!~>{3Rnbw5j+0?E+INLT6ZpsD_{_DSJ3^2es<uBHYLOculiafajB{&
zKRiDE)*{a11Jfj8=IV8a!;?S<)o5qy0`5Tt*z}U!W-{1OstS^USt$MhI*>3hy!bLP
znqXL4B#L3KEV-RX_!LPYEzAMy+2!zxXC8eHqidU3w8~Ig1|){CH5u}nm&`}n1BRQz
ztaioWrd|-af~!E-Tx?P?5crL*dJj#)33s?{BG_92@A_*^w<IYzf+H{8qM@y5Cgp;e
zEsDUgHGvA-1kt-3OclqZY#q&z1M-|2J_B~R0_!GluRyoq0)dF=!R`Y6ZD0l#$@s&}
z1`wm@OL0J#=U9YrS`kn#UKS|sP&?TmbW8>Qk#h#_Y>F#En+kZI?kTR?DS*tXdD5n6
zlWkk~n@@n1;6>;`E}Qi*P?C^4Jd_@H)Hpi;&S2LOB)V3_KLLO@yx2;c9rMYxq~6EW
z7S;JJp<X0ar^P}%rCS!TZIFl=7(|+KUQOy5uIo2q&yWuY(Of5o$-;uWRUn3a3)lM@
zDLM0E^-j~dxdrc_h+sQx%uaMDaL=**Dfqrh*AQ3xDY8AXO#_B0PorM#IcXVEN(+rB
z`&=VD-Ee+fRPTpJB&<{|O#+yQBR|1HXX`zsjPo#{O2ml3h^#p$xQ{g~3C>0k-?%sa
z{6EI-`a8mZPmVrcH>=N~pwaB}|M(ne9e&(1k&J$!jh2Lifj@)W<+K*(X_lM}eAV!U
zGydGY4SlJnGkC7nCv!)cp}Kc;u-;Y5PBP?c_AIz#yV~I>h=kR18i)z9MZn4@H`l`g
zo1D0kt^BrSADbGtaXOnN_OYqc+sN|r^>;4Vp{7o5+*Cuyto1pybEbi4<4`NCh;gU(
zg=*XAT#(aZP`H!&uG|U1XfHsfArBPJ1RnsSHIU#2O+-p79`jj@%}bH5&IXT(`>U-p
zEx{BTA%FyZ$t^ebPHT3Tg;faRyl{-n;9F@yL@dZH*qN47c{8VDRT&ngGTdsB17yak
z0fhB&_MQ7*uyiULu`Q7m=KN~uRtAg&jTG4-)G@4NOc?BL>_g+%rB6&ftb_?V?#vjV
zFAnx28+26k6zTM&%)`|>c{_;|PO^}#S8$&R&GZ;LawA=!Gg3`6@wsH?!CQY?lcjl8
z*KJT-Ei~wc)5mxi5}AAmZD@FxOChNT`o23>bEjjIAq7a8xE)%HD}pzaS{u5aGX7?L
zLSu!v+Z<$@@_hlRC?h(bmtt`X*SrW;{V#N=Dh0;B8UYd#JDEV%!vOyVP*i;B8|}Ku
zaHy~wY}nCr@2_8dJAYS}O9`OUaNb~c*U&3mPbs~^J%)S)s^E(4ZZhY8O)Llz0)Xof
z@dQ;@l<!1)$;%ql-2~GN^BP~^U=-Y834A>ZLuSL7qvVsO%i6}-0K|)AQxvX3=4QGV
zS9M!EAuYBF2E~+Z@d$lrm4sp7=RrZyb+Aum&rHB#tBFxq76t<yn!tq#Q)R-SGC$+&
z#|2ivxTfMlD0PCq$@ubUaU#JO4<v^(WFA>|-PT+Mg=(;43`V(VNIOVvZ;;fjd0!qE
zu0Bl=3RI(Kjtg9L0l<k31~=322;`eP)|jKzUUJ9om`|8<X&?g&I$_Tl8{Z-2aat}B
z4RK-LV~E2QjseIYZP?{>nD*rfKGk~Zdwu-k)wBEwmbeG$dBj0YlyP-YR5K|ajBwK+
z%p>@JHu#IXtLw{Vls~T)>-VGlyJC`m|0@6Aqx@ApbMl(|<*Qd;k1~vxBs~*Ea3&ST
zy5XUa+Xq)_Iy;>Ry(*61wzQXPs7N2xYUo`Wn)u2wfcxtuRSoMXxGLK!cu)`}v74DL
zw$epLI>)RtmSL`EsZ%jIISi&JZiRxTSe`mMvbxt!vx?;=>qdjo?n(o@YVj$P6@uG9
z)d{w6QTZ9lQ=W(gDlS^On{j5x;k%}7>QV3%o!jdz`TRwc&7TS-KvJtTOyup`0QrKV
z2B>B#8)(wuUlxxHFs$e<s21+5D-w8<`6R&<7_=#+Y7&%D8AyYOZH*TTLhQZ>L+rkQ
z`ja@Rjae|JxRJ)$N!1!3ABVKjt-9w{h0PG4&PWs<h6hflCf@pl5tK$;%nq{97f{!0
zLN!>?LWz4q!HYhN8BrCy*bl{@U905ID|}s3PEyP$sjp?wdJM9L(u<hQ?I8>c5HYl_
z?V>!xVsW_?M~r|MbzCQoI4>P{Zbp8O4PviP&0RN~ZeMH|a=!2L<2_!-@p)X9ZBuQ(
zILj!kV-_ZxcOb7&=0P8AlR8JdWtlH5u;K7XMS|MA7^Y@xuB>a#HD8W$i&|+E)Sw<c
zrT6SR*_-NHHtkhc*RkD=p`OnGT;IYpvM3|A5H8R>z<2e<4O`%3K@5y`dc!_^WHz;2
zxQ_`PY!ilwA6%3$kIfC5-II}#Iv0en!`PVcwpK#Xq3JwdSKf`Qk3LgS@J*@5^7`Lx
z<e|T&OyL>)wVO6fsXTq}|2=*`Y(|#!MctOfcjGw|9(JojYUQLj5U>c=cCxCQ#>;Tq
zaAs&jVEv*!!jkhhLALv6xvF!thA~?K#0VRI&vbT4WkfJRS^?59ATb4tr_ihvgr}q^
z1zLM3gj&|}Gyy<@Eztg}ulRI5Uq&kqj|dnZ18;in|IRv^bnPNPaoYOo%EOBkHl{vA
zOY#@HlV=N9%PwklA24<xcCurRhr@bt7FyCefK#E;+LN`RS!wI#Zm3C&$KjZD4AB8b
zM_`e14<q7qg?I?)<w|j&=V}q~moeVo5OyiD8#bp$dSSUbk01)d5*sYG6a@IeFRAE0
zK_aeCEyIv@^|AtuZbD(clTyMPQ7myC?gHcUn9TYk9|P(SLR1eC)=m{Tf%uV;)YN(I
z4dh2Ch=v?7L|NbqOXLz5j1Pt}K{kZ&kH*JQ0&a+R1$I=Hhvr$Io{HZgki$%^Nj?z9
zDvD-^f(RtvLmE=KZqFxCvmI?w+k41_`UfO(Qu3h%DF%Fjd-LL~n(U1Y|ItulI}ru6
z4`{}2gd8FUrX@_EDD6|`e~yKamTqylnDK)0EHH<@X`m1|E)f-MqZg-=l0@>PX3Rr&
zt0cykm}bHhyW?@~$JD`Eu<qZ2+;W}kNYlL(K$KA{Bnd`U+{A^G`3O+D%YBYHtu9n7
z>Eg?aEl0T-4SXn3r8p;%`D((n*NC7M#h_TM1w>ud)V9-N4mXcuK3e-AGBq~T5gK*`
zH&PS;1y13h?#~f=xpHg5yzJA+{WOdIejfe3i2hzC+*D#?&?{8!QduD}1SWWm6Rc>2
z((XS3F)Vy0sw9(11O|mB#%5iq-hTp1eOhAVOfk(sxe+S_*=-c!<UwW_IaDuWNm^jY
zru7=y{KwiIT1M>!RV923xfL^jA{gbRBe5yOKZAJ0A3*nw)0fUEU(2{9365&TsacNr
z3e3ZVQ_2I0^#MAjvsvKL49?Qv&L{u4Gs^FT0@xl6bq|^F-vC}fp}!WG4FW^HGmMeL
zok})cPpsPVAatLG4gZZ>{u?(<FKPRGLD`98PnJ=JgO(7C{(c($T}FSODlyXEXVLF}
zivF&mzhhtQI{N#6TW`8RiYT$WeSj*Ylh#A?1)y7aQL0j=#B7j8<&icMRRIZXzTRAp
zm~65SY@0CxVoZgcI%>ui>9f%}+l`^0;mr{-bb4rIunkN*QF01-g&T1)F*mHOg_Stu
za<fn>(N&DODE+cp@*9t52-kghfkNMx=Ma}gbFCUVG-!P-r3{nBDP35HpiMlO)%7ww
z%=yE7@7&$!b$(f|W>ZDr-18LyE}@@b!C}4kJ}ExigYp1;1_@t$a5<#Ecc~J9Q>#}~
zUe4sAjWTQ(<KPx0xOniSv$r1hgr_P6V9B~e1qZ09cjeW?0LoZwPMIw-L#|iOsSKG=
z>lW#!U(A9*0}pY%+yd7R!{vH6$}iF@Hu&W7v*APh-(cn1*YDoAW-sEE<9v-;uz|Gf
zLm}9Y|H)Ijlk+u9GBOsd5ur@Zapng6j%}rmy`MwocEPR$@)$!ME`(YG^`K=rbjQ=_
zMA-Ojx<~e8j?hLAy3t~TVa98CkwT)nI-0Ws^(mGdoTQ68JIuW5qE?;c0mRh$6L$q?
zLHvby6$o^c$i!EXHmUPVA5BApRLElyG6j}94_v{bxx!j`KJQVZMp4Ng&9do&L(dgt
z3nFxA-WHyvGgJ=s<MDBHTcdgunbuD+mr)mi^W{Y$v6|y2>LPGt)-auskl{agkb!Sj
z!waiLVpyWwgP0{vm-9yygX@<WAt?2^icqBZ{b5AXtXH%HCzAheA5uL<5m7aa{N$1|
zOJSNkWFFDoz|rWtF`PR6;U|d?B{wFuoZEMh=}IpPjb)~6F4{wg;<#e#fC-pmUjQwD
zXbFyA9*Or(n8-D6C>vhon%h2!prp+rihs}>nWup_b&;{v1W3JMEDzuf-R*1)*g|Oi
z!$`Idovdj*#{lZs2FO}6kzfo#MB4>>bp^a3DhEsAw>ha6HhrWqsnL>m*;Z(&;Y837
zo+ya6_Oo5Fx7Idl5~fl2Q}}FIl6N2g2HJ-P7JMt!7cne=FYhM2aNoPz(A**eE1~Sk
zMGF7%$wB_f!5)ho`}@B=Ymf5x5BYT~*3hT)-fn%kF7RJ>^H1)&|2Wv*$<EDtAxq}+
zN%N_n(_wN>^d+@|=1kYdmL6e&ALjr5?f2h3#R4ZQ`0K}4PhVm;|1Le&&G^h|r;Cg3
z6sd*J;oqOHYDaQytu682o5%3QXZN8~P8)E4{X6$P-XDGf|LrpfnxV);7T?v@6&#p1
zoRriVE_L>YU_=<rN)j9iEi+tpw%UMa_h9drp27b+e6j!Uf=lW|tMS=C!?kNWgK+Kd
zyGG@073H?eP_uFoiBRqdtV_RJM7e?u9)nw)Tp(O_)KpIuK&L$~`N+%p-EsCbP~{lF
zdc8pS>P8YA_lm#Wy?gg$0{@$8=l*UYBf_G`6Go`?>rdJG1-#clu7nJs*b%gdaN8SB
zLYPvD&?WsihJuhBaAa(*un4pAw9Or*(pT!b!;l=Z{asQ4t~~AvxFJPgH4=g)pczP-
z+w!S+VN%L(NB0%~!;W4Dkb<xclAu1^{ZKE;z>Lg|2fhbu`ZZvJ+^4yw`uqvEq(jR!
z{4eI9*o79{MI2FrdxCVZ$@&r0V6Ft3OhVO}ibG8b4poJkQ?`Kub{jHQsq74!YFDPu
z`-X8RN0M`MTWjG^=Us(W^i_@?*c?3Ib%l<qibKuBRi?BfzcRF~;Fdb>S_z<vc=5H2
zRo8~6j{Xkm=)th4;)!ag6oMf!JL)9gKail&%D4}TV8MyO4?AU3#ZH{Z>*<#BVD$H4
z!~?M6E+!{*)qLx~52q8<OtL-X`&FWcW_`MA57o738997JI#lc9*6%I7no{?c-ZZyx
zZ{=}MyIotbMEA#Ej1Qt%IVb}11F`2O2sJqW;?Wb0vUoCcr1-%7_QfNLq=XB}2VqR$
zXRZ{>>P=hwAOuWPL{pcabBwbxspk;8KrR3qujcMF^1hu=ghSLTXd~+x*xzQ=BX{}0
zz~19f9>6682L)KZe=Gs5V4^fO26V!j@!`9Cw*T|r2g6Usuit$7+5Uep)!6bdVFXgp
z6{3cXonYw(=Z8oX%q`(C0pWaFw?k7;h7@GKUa2-dDS}3#kC_nDUrsiCDVf>Zx}R=p
zWa>1{w&%my#&O3-Dc#0$QyWXrRn~M_Zkt83si9`+6zQ!^tT#2$5oyzHTyAQkm@OS+
z;A+v^M)Q7COXp6Hm*PR2w&<UIjfB*W3@{2ex|?p%AB>RnQzsP5qt=W4^t^XEePd02
zVQV{i%(((7n>*pB_~=uNdy<0k0T%j3CsVzkFNYFrxdaHcso10MgvP-;8G3KKypebW
z`Kwt@PBV<x1b5Kl<lfjN?5qYb#ypS^)(gHw;I4|IR7|rVVy`ggJ7Cr#!B~TO#yQzy
zpM;=b^M#bk!^Su*ftO@omV|CY9Id9p%6b`cVD=9-Gb;H~F!-YnD$fiCV0TKXD>r(}
zY>0bv?zZHjlq`Ai&+#^Va`{$4JO&!o`TFfAmv2&+!-muAVa9##sQ9a2-`)S+8!sva
z`&&<1J-k-bf^R;VeX_sHci1;dgI&o*hZS#_AG?hk#;A!xppVJ6kNZy1XR^O>B8iEL
zX1a%f{CB0UbFu$Vorz!PV*is*<Z*`1Ag4q^Wo`71ClAhl?tXGGT}-Nu+0O*$Fd&+$
ziR0#xLj5p4ccO_n1`9*$+ARY!a9Sp>{~)^Eh4eo0K@nv;84p>S4}w}dMvaX#RBn+D
zFaP9Kf|6h!z?wTZqag_|xFRQ@p^WG<rHF~>K;~zwdcAD2Fas`@V?$lW@H(XpPce{B
z#{khmX{tODLB^6v@`cF3`Lnj1$HK1IZ7TO0Z9eftD}H8*oE8bG;%XGfA9~i}H`#cD
z9~@ai?roOEXQH7yVG!4yxX-&9lkN7hZ2jhhOwmxpF(Tdgw{h+b<xdwgcaJt~qaiK=
z2fp?7*~FW6^QnB+H<g3`c2n7pr-Jv_&9{bAaJzfnUT31n%g!MhuVIFEi&OrOjf8k$
zLzOWGVwZ!^>tm+$ie4A<5oK$^TKF?)>_S2ML7&H&BJ+&9IXSiy6kM*t(RCzTytCbZ
zT=AbP3Y(o)jgzM)CV#3)4P9KNQfqldwSd?st-Xv;CJTSL;>!#MV3M3Rjtu@hDQ0jn
zOs!-Mmo5zg{gj|kLsVs8hC-_`nl?b_t<KKdQHE{`Gzz-5K0EN}vWy-Pjbz`xk=seI
z*eOk2>7^VR&iT2YE)D?3O7xftrNs4?E!Ao*x&!5VxDGK1o$@SYec*m__Y9oECKLnW
zTc+oN@fuJ7?PRYXP*8fKicZS2iqIZ|$Rdg&V*Dj!0Q7zqywBEBtS%+-hT7G?$6aw6
z;0~SGgu%G^mPG+c5p<VjcW&<c&L~9olS1Dt1G3RBCC%#=JYk=M-2<5f!Uj{sB$hr?
z+0<>ttZv96Wp){py{=SAA<G!IZ?Wh&;X{kmjY8XWlU^Vyw@zQGD+XQi1SB>v-O=G3
z;z2oGW0=SqOpZ_NcNC5Q!s^5cj(B#6?^P>0rvU*+@G^@a_JUoEgW}V{c=*ZX;FIRl
z;n0`yp;uQbXKEHLCtiq$(tPdf)-;(QrP<Rg(JuqWt|$G0faY*s?64sSFmt77r+cCC
zZI1$0n8i~ThiT|=lnF{c&LnQejaeIt2XSvhHTqUvy)q+e&odg?>&%M5yn>ocJCNv-
zVFC!~k}%h=l3O+`ih*BklD4zZ?R+{biel-jCQ*EeKm@^UC1ZS$-=itJwW9yHuXDG@
z3M<R=$qECJ$9evv0!pjpDd$R+n(gf~zVC-t?E8C<jxjbTnectxbZ-jtvDx03HGGYf
z<Pf`oiqT71WK$E^LVbS+Xf{C_ux~BQ$n}XFl>Tg0vjyRw=ZvM)aFGI%3bl1cO1gv=
zX74~}T~mX5<ZIa@woc7omdIH-Sjm=$j*8oE%mt=QXmVl(OTo|b0ZsMw2(bQaVsOH_
z_b1A4lF8D=4!fc?i-|)rUtLL+ZyzOY2JpIiGakD>$7BBUvx7JN#rDjLJEjM_FN~AV
zpL~wy3{r)YNyYhr=R(~VH`gWR1a$Q`+GfwN1_lsEv55V5LHeN`@3sQq*q=KN<to}{
zddAy4%3nJsHhM#g)tBk|3_odPS9y#<c({cY;826Q@$4h-p1D!hoL8qUnMzpnP_hwx
zKDJX>AfU~gY<m^zT70I(8^v}+&$sW`j&-7K2Cwny+65o9qxVC@PjNxxY!wyfuvSc>
z%+F4{J}=%c!aav4yyLr65S$e&(Yq_ertrZXh`tb}F%uyHU@az`S9bXbdA6q^N=zIa
zJ9Ue)!v9{ML{Y4q_X*hxP&j&3K(qp&piy)M#i!65hg;Cj=`F(R3s;Ap8OG;^+go1h
zCB7UavskL84dipO=};K*pVpU)!~sAdmjt%dDR|jIoEA$zK@v(^H#jdhJuMrL0S#-=
zny>>}NuoGMZam-*qWz|h`5inldkbdQ#OA)D!fg1KZUVZ3h{y>~8g+_lv5!H$toz1<
z@LHiQyp5B7SiHIE!kUW%#&7Qq%tO|gW}ojG*H+|+3J@2=S%x*iA-$U%WM0?@fz44J
z-A@#$1&I~eKnqaOJZb{58x(kTkKDg>p}n{YrNVuRGHlMUe|FHMonhcVgn(WVdHD0+
z&e|jM`I?kOm0cBI1xTWpoz*L+XUr9-4cFx;(=ctN1Ct|81}Y9XH>8n)l^Ydd(%`U|
zH*h@FrZo(OKZZd>@JU~W!t|GWkG?BFZ6?^gT<`_E1q+QxP1(EX3^@h20Nc{yJmon6
zk|{LohX~bkg90~?L4Y@v{R5D(;-s<P!r%Ge{VsQud$XRc+fLoO_q%Zm>TOa--Ma_7
z_P?4qx@f9JqVIfAf#Ypj6^mvY5*hXD+6f2Z9$aG}w>1n$B;hdJgKG?<1p;S}-G`6l
zurrjyd~h|&Z$6x>&yxchWl-{WEr6R;PsV+8;_hS*?C&9yK}C0LV7e;2?~W8QC(Q_|
zl{@THKoRiC<7hzOBCyf&5EKQ7PvhYZtK)e2ELa?Pu;V^8bI1w;u1<hJB<!*B0Zw+Y
zz+eA3#iwca!_<F}!obUGQju%+JRZ^cjzc=Xa#zbqJ*)bU`7T44mS@2T+~2z%DD>~d
z>!FwzvJMoM=Tyk8ARpL&`F<IU$NjzIc!<w}095|5SubHs@GrKkZtwYYR@bYbZ+x<2
z@1l|j)e;%s3fZ2{>uESH_rMKnlwa*s9KM87?^8-BMbkiaQ8htqxIgET{dy&F6C|Ah
zpf$AyPz@FN#}Vw0n8GfzSjAh5Pj*;d{-hf=?F&n-(N9^B7Y9;)=7&fFrJ(_dmkFvV
zE_B1haME{g&;4f^+uSH*3A%iJcYGhx$tV_dAgbo2Pn&pedWGM1;t%I*U$j^s^sLsg
zKLYssw?F>r>Dxa)Rw$N?%lY;4QwTL6CC@9t_{A<GolWE2#V7e-?!?rs8w^pk-3^oI
z7QfBD>Y(o1PU|?ULni0`-tky33isayM4FxzB#hsP%ev1G?#4qnxVz&Zpp@jkd;0?i
zF)!W+LvVj17rAaZb~`lJMm1m0rJCNnW;l4w$lYmRk#IRj+42JiRxNH}VD<Dg9GQEt
z%ceOcRxQab2fm#F9f_MOHmou8IpyfM-Zys{^|A`aysWlz431!fH+Q@&m-S`XNqxE7
zjYMvHIOA8r{XF<9<DH^#Dxjy{doJtnpK>!%U9kCb-7=yb@v2?K(^V1Pr|$3Dk$G6o
z85;R#m&J7V$h4kELxM;7;PsraHG0i`9Z2`2at#%*%52$`>uJ5uZKF#o1kRxW!0$3Q
z*18oNo|N+^ZogjC`PsSv6{9RQ?3ZyP!NUmn77*p#kZr&<<m6QV&%-T(p`){#F#rU<
z(PZ-bbei>|Lg0vS{Hs!-GEx`vh;QR@o_Bh(_dbJdgqOV50{462t%8DDnI4w3+a1!u
zD4)Nvj($5L!ossd+93EWb{=Nm>Sg`IoCCe>%m}EtrYz$lC670ptXE~i#Xtvb4_nM6
zx3!0IA7muGz{`rDl*==Ui9t=7S9F&N#g>lU4ILjvMRbjx$K$zyig<GcvH6ELSnGpb
zSH$haic9k(I^UV+-vu|;hjRVccC@?cXoK14gZ9?7dmazz27B8(yvTa{yU=?3yS+!x
z7E9o{j<0;bZs9+_QHaxy3AfCjeg1tnFoJ>+2|uzW0CI|rz%nXfXvDEv>>&aW?OAX!
zRTE4$pLy`ides;+H^q|xAt{b(L$x+qQ^BIbxnMI0v6#sZHBAkE@#u^A_UHVQX%>6A
zC?ya=z33H|8a-Cu0?m}>0M##(a~Ru;j_`SU=j(<xo5dpm2+SFyQY9?gRV~z0)rMro
zw!_}RkzlGFMv%@`JqG`_Zy*0OotO(IYFR=M7Wt+b6%ZBb?)<5SvqjAWH3W^fO{Yp+
zLkQ8$#))2#StV6W;t6ZzrwXd#tbH6H`%0fY$fDI9H|?~tYk+^7MHt2V0dF{>3O{iV
zf^YC1?|xUVR^fN<L9naw8C*bWJb7Uo3EZhnN!%Y7=oRze3m}gn0<YT_Xvlj|7?{Nr
zW(B0wqMEH&Wj4SpA1T`HR;_8U-V;Th;%VS;A1KIFa7mwiO3(nVK;OYk=p!l#N#6`J
zD)KNFUBojJa$E*OV$9)<ejB%VxF%*X$x}Ue4a?IjNk2{Ge!vG0@M{gYqatf4tD2WI
z9L8@)o?t**ZUr~gQ@7UVX6X2LKDhRv@jDIMV~%#SAtA3cLn2PQWi`7Zw=b-Pu;Rc^
z#Ktn0;|gAn7VsaPqFoM&U1RwTP$$S^ArfMj?<b^c?v%d7x?)@m7#pQf4*$Y+ng#;!
zt`}_DMnXv-W~wQPSyE>Uo{zXb+^VRAknneaHbX}-d_i4N46`|2+xHSNhRt5$-@KPt
zbi8jrzt`<z9Z##IfzVS@LGChe)qemsYoX}B9!-W8@7U)8l4Hg#%4&^mXBKS?L=gNQ
z;J1061DPe@bW*ZHJ>{7HU7$^AvCMVFWYM0NiJ49vWlT7ij>FnX21#Pz<OA~FRgI(;
z)ypACGC^TG!(S{l9iIna9Xex;Zx{&hyl&hO7TzbkWy(L~h!2Jj!bXft2HQr<(|GO@
ztWS#apD_p^622|+=R=8bcpBdUtAIrbwo`UOT*-CA!H5F%xuY3{cvB(!MPq^QO<r>f
zK?z>bYvNg(hvXcvA^>WwViqv61d+UT?S6Oq)H)xGQ@Zd)H3U6FKrlG%b#JvNS^Io~
zspvaz-tdU>QsnJRejAX*X+feF3VxwjVsd8Ujn!xT%6d61xRDV7F|5jqs&;dB&kI6C
zb|TH{qMXK~*u4oyp-t!e;<Ip+K{NfM7&*oQ6K9xrDv8L+Y+;@Y5<B-PdA(aVjGgjO
zXiG9!1U=T~(U=P9ixM#eDlW#Tl@z1W(eMHndzs@Macod&V2z;u<m`$-V|-8&2l`V~
z4x9Zt)lQ94u)_&Op~Ie0l0vpf60fRxHG|;Fx~rokMUz0-K2iP7a;h82LCc86EQ!ZJ
zVcD(x<rM)(NfBC(ZFGN`5adFN*F$pHss=&V;tFMfFhlOnph#Fvrx*#BZ_P@(%m!L2
z#1f#!R60(eGOXnQ5H{;trW21%qfPl54PQ#b{bfjrbaSsUU}0+ps+X#xSxp+{uH}>5
z4#9eu4a4QRMxm;H5!+mm(CE%bpq(#a56zhPNxy{eG1GYCDZA0F*RrM})GQZ?EDOBJ
zts@;`!`o0cW3;e9q>y-Ay>*33ce{Aot7R}D_h&w+PyXIFp(p3%<Q;&Hl;~`x58eCL
zEf2b2HMR5}#uG;gNU)^(`DwaIsk?12Vg8=8^>%6|H!qvZ++N&0pCU1bQ`)w)c<RjB
z(kZ+x3MS^~NEn;ljfTBKEW`3o`f2zH39TJ<*;X<_(*@yqbp>7`&WwyV61fKNo)xPT
zENxD80^pWD!4xI9F^hLpXnwr_vrskRDr|F1>IKON6p$8fT@VCznR%d{`zQS~e^p#C
zii4De5gwXYjP3mg>YIPE1NZn>(Z&3r2e+q%4U&b%`_$b)K1if<bQO{;p^$8GIp93)
z{i6@Ae|}$Tt~_#&uGJ}vQ*^x}7HS=h7~zSO7nbx`Twvs)f{IqpfgrFWHABRZodbha
zK2)2k1)zXt6FjkMCAHIwDf+qBt7sHygNw`uRA@B47dFprUbK=-AnWB=UbW(qBCz*a
zPy@iLQogjgmWNsefGwame7e{ZD4+uC^3fuIR_xKkP%Q`tqsNFm&Bl!5YxRU^M0=kW
zL07G&5}`&)NDgTIX#;DM#PW}`?-zm1A&<;cVWM8#`K;5qE?_=r-c`$`h4KQ_9{0;o
zI0jzKfz{TkMFG@WxOp8+CV<z#H8UuUvi25LbG=ld)R)fi1i9nDo}KCrQHUN}YM?(y
zwdWm}&qb7<8B%=Qe2nn0nR7TYeHU;Jc;GZ8U__Jh4d@&7>1k7@V4;n39macBwuX5K
ziHx#&Su~i;u3Wu?@IdwtW+|E}M!ZEsMQI!wFoISK3|Y&9swy3^ji#bXM<LiSO>CoZ
zt+T>@f_9_E59Mw?NDewST(|=gH4z_~=mWQP(FbNTk0RaPm~z=cF^V;1*uFS4g9Zz+
zUVS?Qn)_92A+?jU9aAw1dy#?frs*l)Im&pGcsmSes#=>Ph^}O6Ua)~i;e*BYH`8Kj
zJ_%{1LP(WZittuUC46tjOxW17aP{=Ez;q_GakNJ<n6YmesY{!0<g6%#5%G7yPe^IA
z{NV2JNVBigT>(*T@5(@+5buu505sJ<x9JYtX?t<9K8@H2KFbGa>w_G6*Vtwrf@HS_
zryPQEz;_J66If4<)k{yFSbwF$Cmr<Ny+zHp%%b+qADLVgydc4Z89C|EY*zr#)qL)x
zdM6vst~z(v>3Sx&82qR0q0=5PlyU`kP&vi>+lzbjS&k=*D^%fcV0RJE`b-#M;Br&Z
zF-p+h<mNNGFdTNKgtZW9N_Z1@r{so758XTnfxM8ql4upcw=xQ;k~*4KVxY%jZD>bi
z01{Nl-0&f`p4_(OYL4t`T3%F>a+n4$q-2PuW#EqnN?I}xbfhL}1s>R+BB%bT*}*h}
zk@CJUJ(x6kM**vPxq`jl`7{K&w10AaY5XtnS(Mg{@-r8Uwe=B^?<6!mlsWZ1Ns8^_
zP`Ee6_C}%kRHzZEJ;g-T)?o>5`P;^9)N$qR?R9nS=O+ZB!`#1PG|)h!--m%lzu$ZG
zJsmd3KVFfkZ$qF_m@8Td2qgqrov-Tk*?B4y#%FfbR=?XAC{Q;L7%+L~zofr+(x#CF
z-&gaXY&x43z#@-v5vZm<`Qb-YuQN2Pvn0eOwk?F~Mg-<NGeETF4PLW?;rKVS+#em>
zDY!tkLtH;o>=RqXyUVpU%6uK<9=$S<;{rN~s$(%Jx>hx4M~ZKVYh{5Nr`HL@D03pZ
z7*qg8CW;LP<m(m$UN`Gwx<Zom0uj#KR%aG`enJ*;DwD*?Xd&4`30&1et8GDFog!$#
zYDj5y)Kb`~^FPI@V^YR({j0_lpmrqmq{gL3cfgN}ih(7LvD3$#ppLd)P8d*yXOvax
z(S(II7@6u*`FW2A)SbLnVTp27Yxki1j+M`*?vm&1F?T<!;~7e@GnDXfq@IF>CSvD<
zgZ=%3!=YdHEBnj6gP|B|oml6ay}Q4Ec+WTJi=V?U_y3^3xRYpq`O-IcX?wbK5}Nya
zl)qXp+`oNE7k&N8z7DVOp@+#1Ex2;kOq<reIRiAqyeTelrDg?Ijy$QIK3^<`TPTPP
z$JgI1rK`eJgxqwryOqVGlHs{t52xms1woGe(fpgJ3JM%M5(d%=I8lrikM<N_zydGV
zb3nsl|54G02W(2)1)S9D6+tM3H_ys@d!I~Ha^Du(3*S_yrx9b4NBN*VbX@yjr{ps=
zX2^9ydLT5zoK=8>a1+h*Lm!5)$bb0$)wBOS%KuU=rcS*kg#txAk}246%xqXog^FJ|
zY7v1p3A8jE!uDk;-<OkhaGmiJccV?}`P_|b_dJ(yyEc$3&dx?<EG>#W_iL6BV4!JO
zgwMYaRRQY65}`Fvu`i17fZ)n?gJD=BkEkEVLWWQxw&z4$A8CA1F9f-$puX{Kb&SG(
z;tLw;xyxQuZLkqli@UJFhyBDI?oEsV+EBe;(rom4l1Wd!)f)DVbc&X4cRb808f~&Y
zn0EA9Bh$++fpA(J(X0SH$Ojk23ZtWTIG+Kkk$CJ~Bh{*2pp4_%s!ZrIH?8yUn8>M7
z{w7Aj-!`KVIZ7Y+AgI16eO=DV*2I*7kT|UX6ry%AxL)=o`awhE>}&oR6gbgd$QVio
zh+WDb$uPBT9pKMk9WVrJP|v0med=`L&07q=Hi@;MNL6l_S~HA;o^#`#;r#k5(3CCR
zdu9>zSw7%@1J;x~cxP^6+YLbBeQIc)jw*FSKL+0NpuYAM)n%gBq#T-zA@<cX+vqNY
z)Z(VkFd+zmi$wU`b8O1TvWQL6Nvfbpb)IANf}Tiz>crF1N$yvj*EuuZKUapdhxfe+
zl=Qqyhw4qFW{8{?6Z_j*4vdziMjtFLTo2z^LB3m~KDHC!ri(gNF1)i%u}5f>CAJ(c
zv$7?i0I!v!V74zQ7Yl-v(jp8Sdkoc(CxKww-#L9LSW%{KSu*I{EK>jvEP^S^JU;Mq
zf$=cuEr?`F$xS4_D4V?fbS5-bck`lVwN;Og)lafU_DkKQ?gyf@@RCr{?zn0UbRzrg
z80;3fJ%%Zg$|rasUgJyYcq5a%>eVPxniQBUXwc|-T^+Bh+u07R{*?`S6o1N=feryj
zw#T@TFutUW3xO+HOM$B(t(CpOhuf42KW<9#U4f2Fvf_0l_Q2<fSoKzM$c*C9Q~(c;
zO^68x%bJo#;y&3cm-Xa)kIF!Hdhvr6EIOeVk2uT2u%*zu<{u7CMpGC?&@vV=TZP&>
zp(z^LVJ&KBm7|?6BWZx2>=JMnRBkjG52#GKnPf7PzK}eYr&L1n9s`chV~Z-7ja@^y
zl;))%FmF*)xsese{R+)}ABF!8kamVKXT$K~2?F_Q&K`?)ZZaqrfjnMZ)D@)MI3`oM
z`(RZy?*IbzmFod=Hp>~%FPbx`Efcd3ja{w)XJZLMJ=Hvr;CUo8skPxmZDm8apji9~
z+LNcafWr*(gPRtjfC#xTj%;ozYq)BO2y0$3kgcfvn!6jpRWq%TXzATya9c<nlTijQ
z0xyCprsYc7?s#r`LpW_%k<@NU#910Sdqcpb+S30J+S329_Xx=9>+)oMmOm#m`6dgx
zNsshGMlplE)jSPoDu9dt;7T5n8xC#)A@4Z7cm<Td;;~bTX=^$RrJ2U#N1(^a1Nh*v
zDc?_=wCmUrh0M@Uz-3E$UlR9SI2s(~;)ilAy2Zn|l^<qhfi-NJs$raS5Mv7QrgBF4
z9GOf;IiEbQIT^m{*#j!dz<lYVbZgek>dSHVojaHia|YLg`xj#R%Do}e%Py*VhEAv&
z%j!1k`I2*85h)!O5{M!jl;gAUh|ZcQc#V{?uMHY%=Eb)H)me$paLpmeWxb*#95=TW
zhEUC&q}oz@{#yg(DPtH4qvlcwRJ~&E)?*I2p(aZd4u7d?G>{b3#fuQ<4UGXg$UbKV
zi!<QGxVLg>@DF>FvYZk2gY)FreGdOa-*PdfYHn6d2*tXfqG3kgF!#{Lx_(6}dK8FQ
z=PQHEn!IChD&y|#=+TD6%>~u-UHGDS7o20H8aM3mC|j*5@Bn>`wr;k(0#R=0EBq0U
zBZ0l-Y+h<i4K*6lsk+`s)W#+zI1sqi+x%=+pFo*(_Z?BFQtT)r!h)_Vbw=hT{0FS7
zDRv_=OAgU!k12M{c%1O=hu$yi)l_Xd3pIOFCR`aMMSA>Z39>-BN2+eaHA<#CjDe$t
z_7TRqBHoN-w#qxGO1vy)<$LDa3#V2&%7$%$ERDsLACF8@D$J0nfR8RvT(p2&1Qr^O
zyB<%CZ7O(}59-Y&%&qy!F|3+O#IW?Uo7kisp4aue&M4p^=qq?MuBEWxmkr(h8o*2K
zj7U9$xDg_%2U+J!zv!Kx=I)B{f@ts)O2yfrAO(_@oA6SnsWqwj^21)Cf0tFP7N>P*
z72%<-;^>W+(_W7-Ja-3=uJOe|Yb$m|)6L^=6uQ9Se1qVhTRDKqb#{e{;+1_(qg9K@
z)X6?7Zo!*-sc;+D`Lgy5=3WJyD0kDR8&DM+3n{n7<Xsj*_~SY~$gl}AKHn8Pf^4^T
z$*_UE%4&7M>bb)s+s1*G01Lp#S)WcdbCemj_N-?)tkM_2Erw1V=J~$ZigoElqwksu
zlR77R_Dx|bSWpr;QMnGZGd%^4d%uk+)jSFXTaDNbV>!LYvSX^_t}(wEp;yAI*9H`Z
zzUmq@1%_)e1TKD$QRW25a%n2uz^YQ_5C;0=4w)c>lH~<)#h;2RJ}ahE(u&+j11m3V
zjtt4Wz10oHRogdr^L%?ZL<%-L!S^OJ%YvEF=6B1{b<mRnmNPgQ?Jb;=Z!On8z0hzJ
z;$*qlxZ*R0AqIit7GGy6`V`<|JwM(uq@|-HExM2;V-2t}vc?k{V#s_&qL8O!qe9F0
zM~a8<%EIv$@9=QC+YJ*(&N8Aqe>Xp7$J8im7Pyu|AtGaz4|PtAc{SpsUhxkZFaCG*
zE;3vwbfWfAMYaF~ci26aOu^onhZ;$5lu_7WD=~n~;=&f3VxKg5cWl}#c7oCOnT{ZG
zN#S6)N(6ysXx4me9#zbia2eJpD<KA+K_#Og-h`;I=~5508gNaNlXsfyi0guzL5}un
zs$htJmdTOtNi#fb=+HnIiIW1s4q^)MnL^^EP%Nz2nGG;+3GRedZRL5jS%Efy`xv`+
zap||hnduU!HriPn{RNXlo!GGximQGUhyyInVl%=xQu#)j&c%84+T5<wS(Rs%yXdYu
zvymURn-R%3!*3^RHr?|To9=PFrd`LkULvFD43D4Z1K7t=zFyuYJL1N>d}zJwV?v$F
zw8!h!&jMsdsk6V+YBedXs!^>9X=#*iEJ3B-&`8PJNSI;dBwNHyL8ftpa~^!W>&$vJ
z7kfRy-y_tOsLqh%)!QAvoJgp*2_~Yuh8PSlKtFLUTa&$!c16KoFJdv#<W}N%r4A1<
z?VuMNxh-R3;ty@MS41N0xrnlg#Q!U9SW5QMVQ3y~UZPD9?bm2Z!yp*1UWIu>-0JGO
ztqT34sc%c;v+FiqvZ=}E@j`kWnD?SQroY%5GTf{Xl#R0E5<OGlB<erWOyv`Vn_c4u
zKR{KdHLXuib&-NjyW<~GVWCI_GJy<P9FTEAX2POHvB<r1c82K}&<?bzK?##oR03_g
zVh#*UG=UR#^YG^pos_1UBcLXRQZQ~GlMQ|Z9cj!eC5<F}q<gq8J_g|%Nzuj`HD+_s
zailqfN<!W|fGJ4?1E^~TUPQD56SE-aikGQU8ZMq%qnjU!{)gr6I~EQcpcog_dOk=Q
z2$J1-O$P0p37bG*bQ*$a%SFay+kH4kVz)xDs}UYVK@Bon*sAu<*rc>V8coz$q?vT&
zmV^{S@B-|5Pb3tXW{V;-+FW`w6d;O*iW7O6K_cHwDNeo+e<iKvzmcku+VS0V2$Q=I
zWqR8HmPifTk!E^C`X(XL?<zm}55pju8;DQYK;psB^x!vkHyOI=k)fM}4E@ng!hfYe
z9ZO3rQ13=i+{R8T-8%WKJSis8wXKgW|9LGKvrbM$TE9ky6Q4cbZpXAd&K`H-lDR`!
zZjX*e7;)t^W2aLm5m-A)H5;6LzB1bqB}j2n;wun(!4WyO$!uW!lLw=a1Ykm5_||X2
zECq}sICvBkZv1lZ5!^<vAc}6knAMAt7xmzgxO+hiJ3Gfq3*?#;h}v+XkE3XUZU(OR
zzAYDM)SEeGwswn$0VEg*%oW=a(+p#}*{Z<KcLY{IkE;_cPBCzC0r4&v6u{{!IyP+{
z*B5OY%N5FHz&l`sy<dzn=En^Bs+Mh)s45eoU@Y4lUN{A%y*gQY^m5ya9ZI#B%+?TQ
z!9+&ilY<;hEA)cK-k~GbRJVliAE5UN^Q1j;jvH(KnrNzV$AV(m^4Cs2Zr;2xNIA!9
zbVlToq^`41^&KEjfzmgu7Qq=0iVGOLnNmacXH>SSo^~7CgDtIAWwRH&lWe96he4`J
z$0bgBg@}7NI9!VUb}xc<(E{8+cn4CfktUNL?*|_@ZM|glVLbP=&dCqcYs$fj20WZ-
zR>A7iJ;dr6CH?7JAb0bdqYi1qT3H1?TC!0FNidxJRkhKJKwgB$R4751x=A}_dYPe|
zl;?zk)%aoN`xm+Hy*B~q(P50~?#c~G9g|#imYRc>_0DWfHViD_R}}f8F3H7J5C|L|
z=?THqG1NgitHa)M&wqUU_SuVP$8x>N-{#&zM-gh6l)kG9#Qy`UE@>L}JOwU6v!qH|
ztpv+;(^vamm%EL9S3bhWFc8LALl(}JrP<dO9ouo_g2FJ83nyoi@wj?d2K?;bk)!RG
zcZ!Dxcig}8J9sh&#qdr}<T-XP#1LSlkc0o8y=6vzI^c9EY$xTa)|Uqw6vXCqNnE?b
z*_(*P0&#k46Jp2|sACJ%RVPN7b20eV*UbL+IM^MtwjkKbHIx4p!hPuvG-#a|*n9N|
zFtw^D0Kyx2WHg+_QDYc9Dw6C01~>?l17HXVi)x2csE@dfjoaIO97vXY^$_AWa0N&$
z04av#)w>KE7KUM&I@;#*GqB17-@z{rM%JbN*qq5m!egTbOg3kHXt8}vq493mW|*DT
z(BGmwqx=NdaWw%aYDl}XN^TiaL^~_;6QF>+J;>WbL!<E^Xc3eF8!{@!R`@`=^&z>q
z2|>qhA@Ya$Px<Tp!#D0f_T0yNBlp(<{^bU=H=-BipVxQs7aV5iH~OkQfF`KD_HZx%
z#Y`kR1fAiZnBfOh;SGS4bs-ewOU;kW!$beD4|^jk435T8M$mC2FG_3`Mq+wWQR&Tb
zXIMAmbmrqe9*^a~8w~zf)IiTRSgQzi1Nj+*NkWPo70^gu7ncPyb~63Z7hsY)fxMq)
zP4+r(M`czJ!X@x=OkXf>e|Y)*cR%R;!hc$OC&zr)eD9W0NljX>2-(n|41yt+XICT1
zCfa2rhtW_Dw~VEC7-T)<aAh~3Yyd0fexI)Cs!HqtxFnA~auk)q#;>&)odm&3l#}L$
zTQ-Os07U^C^^A$XsKGPmO|7|GH%=Tuc)ap`0fT&yyzut;(}#EFS2WDup0!8$ojoT7
znG=XEcqdOef?5_8MhQW|-LheH2!EFd1uo=Oe!<Pc-5?zFh{2uyD%4vWW`v@4hy0H+
zm71sr2~EGm$nC#FCPRtA*)!DHvK1x+ct%gFHV?As<7H!eNlozScATQlWx`kj9SdME
z-rIEbeuWHB3LA4JiQA)aRIy&XWB;&)=b)kf#<DjdE*KRJNNH<cOtHh7Wh*=+LOpQi
zDKwsaAm>o9`Lnp%C+Wo8ufT$!Y&gm=#v-7k-~7+d*Ujp4wBdbzQY}6Y1*O6F;L};J
zWZz~YgRz+c?ayX`VzC337qgJ&#pK*Amd)Pt@<r9?d-U56kB`3%FSOL4VYuLC4Tp?^
zJX-gc^@>&yOD}`AJ<P>)5mYV1nq|NY+}ut$irKUN9|XJq&!p!?W(^e2E}={XXA4xF
zrW8~imd9O%oO?5`FNl8&<~cfC+>+83-XGuPv<dn9z(-wDM$H_oAiNdbZsBjtX~1oQ
z`D7O2N(6I^8!-2=TTaI~PsfsF=UC#m^(A=UsKyiBk+!odZA<*Dl4Hce4{|b5lj%T?
zB^l*+<AY!?#s_<ko*<7^3G+EyUVKW52Yusuvv@l*j)HJ#g*W6nk19aMvM5{kvIvL9
z4SH1sz*}ii05X}%l9#*OM-M5->UpK@iQ`p|kKg|J@yo|A|KvTFJ!|fmt-)zy6ue6^
zNv%)XnOs9!FJw|L)qX0~;4+^R!oU3S1aM&3{J>XUE?A2E!m3=BV4<<^jN{Q@(imUC
zpW}bS^@p|kuG|g%UUcl&ugT;?kYVmW--whp%ruOK_%+1CWB$!wZS?_m4o0m$>@@pO
z+vOzz5(SvJ>uk>RSH~}}vo!*`%5;1f((z%Jj>U49B;;>8fH<%mXTUF%P78>&<q*#l
z<l5Q1XeWvQ7(5It2D`7xpT2qa;_K_uE823>19apY56?ZaGF~M17eSballC$y^yY0W
zz)Z^vL9W{5te|MFQz!A466F99ZnI)SN5LEDVY>($85b`olZCvY59&DHMhXmT%64Hl
zaSCB|klYPO*{KiC%m<Tt<v7g}GHwMm7aiv1;>@iNWgoej4MJICc$CQr(pREM_<+@G
z(8JT?7uO|+Xoj=8n9iz`?L@sSChx#R&mU;uZTR?xg#G;c$6r5x_SFZ@Me4V2pA5cv
z>Rt_Mv!42IuRDS7zQ6Xll)*Ovt${dND1$KJ9Kp{j<%1#5(y!&$1)=goSf~+yL6gu3
zbd5%-g2zmnotp-QD=hJO0#bQf5hk6mRqwhC7MooKvef*i<ucQCDM*@dnA|q3XQd{~
zi@>9Y4Xw>pjS3M+T~I=TB_Jy@)H5y>k?PmSySVSpxe#TN;Nka}+TmHiCTYPSqlH>h
z`Y_USA8QJFW%C{vy^wyxr?zMC-FXS$m@1>QaW)AuWh~bt-jwQSz%fL_Uc!iO-FxA!
zd#`irKK|iZui&Vs1|px|ej11IG*~|mqoUR8HZ;k!d{6m=C#)9%0aRyeNHTt6SnM$*
z1WV37e<;wSP9D~8L00!)ZDOPA;;pHa#jFP}vqU0}BVrWiY$lF83!}@kK!0BOn#gk}
z)UU4g;b+zYyV+o2a=Yu~d8+5<$*xsik6fLA#*;BH03o7jI*GoS7*sX@kafiFlhcTA
zd9`K}Ys697TiCNj{K?$t*+55Ltlv9@2!_l<A9mQ~kMRn<txx_w^CiIilf-HFR+o5u
zXl9jy0_nHSkhc-mbEK@!CEY_@&)-rgdbtYrSRMxV+qQnuLAHkIGYxP+VqDdiaafdh
zFH+2jRzuP(b`jRzFR_YG4zNt_ihZ^SwQP+=Q9s3tAD=((UZIBb96So(h<{H23QxqK
z_=@xuQgu@X1IaQ}3#9!3I2Q&&Kmfs4FTQ~xo3sOoarSZ@P**tx+<ad_2COC7zmZ+)
z!GnkSPjGPZ*Z;2*fR8}<{cQoxyQ4S1<gX#Arsvl;u8k9fFNQX-HTMKxh6kVwqu~QS
zd}ux-z!CSu&w2K5|E6aW!)54^`(RpAEd*@e{au2l;~wY>m*<FpfnM+BPG1=9RbRsF
zA#Fuptxj#rU}Z9&{RE9WHDS|BZsqtb|Lje2RHAgh07p`4sqo<_e)u}|^vzD|AUy(k
z;y%EH7cv)lvb`BiK|P^ck@EN4e?WC5{~kwGx|iaQUTph7NBFvrhTi0k<djB%>~N#u
zz+wxp^}V0rmlMb5-yxuV_HR05_zH*e6ZA5+y};vNsP_l)b0B{qacIK*H?<J#ihKGC
zy-0@wJNg+RU#j=AyRTDQ{>DCxzvzq-)<KsmoYAN=BloWCG#>vHmHh$(p%-c7Mpynh
zRF(11cD0tjUQpQC&-p9TnSZ7skH_JRR6eJj_Y?e?Jd;}8tA@7Vhm&dn#jx;|wfv_W
zqyJPk;^&yHzz7DZWgeP`OcnYW&f7N*Q7WCC=+Fhd=9<EPV-uauJz2&>NKc*@(u_}N
zy>klTEb)7Itl+(F|4Sm=ME~)DhvhX?9v;bnw7Q%8Cb{*l#m*FEls^Td#I$8U&R?Rf
zl3(#_N^$;)QoqY3{rwBK;U2t^FSM`ir!L8kf8M~Vf96A@qmaHv;TFetDcqz;+w%Tr
z-S_vqk3Q`_`n>z-Kf8}U={|~2Cmcz5{@Yo5)O{PCK1@75OTK)TeEDJG+5dgm9ff;b
z=;h=7pzF&m+1jpHv^>DA>Xtu(-+vP<H~EA}=#r?_Z(lkc@YQ#ZpFhu^Jb(P^)x*8h
zx<<h@dk(3^RN3@F_MJO@-;^i$!M*(8_YdxW@!;SO`ByJr9p{I44<Jedn{ZA2&;5P+
zkkLYOa25%88;Ek?wYi_|@1y((hZRJ@b`FB%|M>sLKTssI*>8{?eC{-%27HX4PwNT%
zdpv2HTj=Ai`{&Cqzkq)q{O<l;`)~N?@QZtg|Ks3`gTpWH-~Zj=J@?+hmtWpL{2%$<
zTj+c1KWlIZ=lTCwpEyZ$z2UtrzyCM=2XCmKoGMb!>eYk%H?$@Bkz<F&<lWf{U>)}5
z$8Yc-`0=z}wEL&UyqaA-$iFRT7bPIxjq=B<3ety~V&RCYTvey=a_iKk{bE*~EgoPr
z0o0>(kLT`st`_?kP4FPUcX#>TJe`%N{-G0>&JRZU`Jwy2d+z_ffDs2n_%rB~3pap2
zfw!TEM}Y5MmekV%A~9$BxM{Cujx|)R8{vdIJA@9F#T25q_uG2;Aiq2QqMXAw^7N!`
z+j^e(AsD$n-89R6d74=Ar+1&;#U+Pf-Lu1@Z|{!pQ}-trv&m1J8nVRX;{$xdH9#)Z
zWHUSf+sFa}EbzMms<*z2$>jGvWKu28-MY8B^HV2hP}!}pO~;BW(EES-kVar&56%g+
zPn)C%yN)+lV{VbcV{DTgFk{;M<{LgLur=5lEuULW=;)lu?SPh6zAEm*|LYlv{^*)~
z&;p83n_iyZeDizwe}=*y<iEFjs5HP$9?C%))0Ju_a<(e2{AsBE=?+6P2jLsv$EfVr
zV4Hae8}Y`@Gu4IA(5jeL>*hgzNaVRcum6ASy=y}oN0u<WU+rJfW_OGP0wXz>S!2kH
zLAF_A@B+>xlXzvJ3n&(9jatHH67O$+&$a4Qb+-_<C$sx(G!r9r*S$`iI`{MUwc=N1
zc7w|{UemM5u(C|wvj<tPJ?UJmk4NXr)u=R!6A&KcYxr7|>^(}pf{}ID_$hZ#8v^>e
zT@5`f|7^_s`+Vl!|DE;vm+0e$`~TaGuj=vr|L~h{{<!~tkI(wgOUb|OcONCR-IwiA
z?JB9SH~tLgV&j_!8}$bp-z4>K9&J2)^zf@>c+pRqz-0Z~-SyMw$-(QL-K3r@{o5WA
z<%JdgZRzg%$@AoJ=VkLQc98tMCc#Nbg*u_PCqEt@y*k-Hxx4;^MsfG2yX*UEv~>4P
zLO<100v=GMz2?d8@&2pR{i8!yPsFyi14`I3od7W~B$I1r?5U~Q)%e33f>M}Rbtk(^
z_I|(_YKUjC7ZZ~}Y!o%BZIlIbBxlYdvwnB|;1wycE-4~g_o_XbB0fVQG75y9^%qHP
z#e=Kg&a^$Uo`n%jdmYX~lg=g`j?gNu|DDbNv&#S_!_hohuSS;jchi1<jm#fKa!qo3
zGKRomy_)pa`~aNfnjPk33@)bT-Lqb&O;MCbys~b*8a-9ky34kan7|Q7=`8urdKAgj
zFO2M#IOvf+3s)7xr2ES3R+zP~)TfYa;7EVn4#pQx3Cf!x;=D#Zv>tCy2Iz)=$pJ)N
zXg+Vg;a7RxZ`^s>#z=IyWoF6HkR{kEzuf_-uv!dNGH%vwYx>C1&@WT+wd!09aI<F<
zYu-o+x+q>M<;z46!!=?D9qv_I24LyVI^<S>cBsRi&DCn-u#!uwE;OYyAP+_cFdjH5
zZr1NUxz>n%664M^i258fq=5d98F`>j80*(v<Ohu$JMdG&@&3G)-sSVnQ`pZNY5VXI
zmxB*?k@C<r^%Ef*T^=?9eYo_#m^*F`G<-&K0POyZVlP0EGdeL6`8i*!c9-Id)9LdX
z_6kneTN_l9F#sqU^kT~T5e0gd?Z~yrlQ+s)T$`okpVyX`?y|4Upri5DBQH5NHuPIY
zr(SAHb+pND4<&XHX&V)#I$s*H7@hPkWudHR1zU<v1%TU`EUQLXpQ65;y_d;!6@h?9
zo>cu|a8b#``AyTk+Km#h4Gswfntq2N!d<2pRw{Blo6uGjw{g;=u;74QPSV=lOk)KF
zFpZYrFss1i-`W29y^%u&SIiOJE+==7#C+DJZ0%vplPQ)weZ}BB)YFHlZU$s3>3q<2
z%k{{q@M$?qt_G7S1}Jy-*9TJ9<G}z%VUm-Pk27A>0%o*NWyXkW=p?hhoLgQ*TABXB
zW6SYSpzlmPSzzDDW`rlWj|VncqE?sg3KE#6a4jD*F31_+3DyX4gNc0+!a6R9gKuu0
z@d#pX*k^a55)BVNip$eIjz|I>8YI}D#a3ea9-Ns(ZZ<jve#PWAH-2al+7r?N&|{C{
z;^XGvNYNMtK$D$_5TM8|of<ZvGN$F1{&13#sNlRe;y~pl|22DgzD9{9o>2*zAKmHR
zM3`-K3ozHCyLipb#(0#uV>;jfvuAJ*UHiUCf1mML<8=U-ME?xF=_O@0d9GcgY#oDV
z{G1X;VE?pT1^D)f0zd7bWaFcIfoct$`xGAftldYSEHR$$jWVe=nDV&Ez6bS)u`i&p
zg`b+R7eL7Y1vu?VGn7?;21BF|tT)?bU{3=Il2SQD34_pha)Oi$!Y(h`Ls{t*%3snU
z9RV|ZC7~`q{Se}6#E0-OO(awWw+0LwoQP{Aj7(m7x2C;lOAPE~chM$x?D9YO_(}rp
z2)jxmM48^v0hC<2C1E(`jesqpuwNAK*xix{)G#uErL@zTiAjia!Y0$)@mS%*WW{9z
z5;t8uwz%6G*_iEOqu{`F7g44MfSqm{xp>|+p{qDBK1bUGOce!cm(w4t*wx+aB7I*J
zL|~onh^PAp%@Zu1)V~fkQ-gSzRip|_C(UNEb8vFBq{uO;)T?*b&n9;-rql7G2M^xA
ze~&(w>*?hD0kb;$JI@Y}PEPlCPwqCu_3_Cy(6O6T^6e2Com}(qc3z)8KRQ0Sd$687
zUx#f^o(|4uy#X-&a7`YsC;Pq0ENc%3ms#iHnuw^stS7rY3?GV&Ve{ze{}D0B|JhHu
z{0HOmT=v#c9rl@h+#vs{f4vdwf4=?d+i(An|NI`G$Ink+qN?<Hb7v3!obI0<G$~XN
zfWXXU`+NL=U)+6suz&a>Ic^?oEs@?NyXf_%OUdbvubNv+NPs=)WZ6>k{J8maYe_VS
zOBm0D+rRtx$<f}A+p6k)UWb2nq;vuLTiSlS|MFRKa=Z(TrRVAT`Jlf9*z<I235K|o
zJUKevYaVZHY(IXmvwe5Zju^W{n?7aqh$^)OG=7hBgA>Zo1^`kHgVe<9FzVL_v;^C3
z(C(JTW3se;+#{~Ag9PVjhBj0?Q3aeDmqpYMrQqU51MY%y9bd3Br{wzjgJW3SmrW`u
z-wTWNrk$Xu|6N!diHD%PdB7DO;CkF8PUMDtO#A&o2fYK{_s$Yjs89pWVVo8F-EfD1
z-=>svbg!f2U|tuz-Vb1>ptniEHmu)${AxR}F^G%`o=yg2RFFJOHvaw5S6@B)s!?QA
z0N)sf0l?_!{IgH+=Y4LF|9=7Of3y7mt8X`A{NLEv_yhm{9v`%k`2+<(f;Kb7cL!<(
zJhu9h_eS#M+3wN7(ec)jSRyRZfo^Q0egTR$wpqy#=@_tt>KM4x<0phv;UsV0{ps%G
z{cVwqJ$|siO$rBi<P;A4kXkWHhkQf-qqGl*>;4C7A8=T&09rt$zij`%xAMVm*cVek
z1he{w=^y5*A9TOV)DL#vUseTyJ=@m*S!xIw12W$@js+AEP-88nF{>^D=kib2MJULB
zNkxQ4$6+0Z9F}>C30w&)tcA5&UR$Qc`V`FsRrmFOSJi|cdextk+iE5vME_6JPSAOS
zyGOJWd=HhYDCBsq4ejClAFZXZOU**k=xCQ}D|D`Dg2m(xr|aA6EX>nVtwq#dq_;3f
z;s1i-LKk)HHslZ8#s5{^#bQVEAELuhFwB^A`$LVfh#Er|?TQzzRFi@C328EftMMeA
z+t?y~1~FEm&anItRzRi3<0r>A$@dB#vS<mpEwA_B)^DNw!1|*6;JTln0U_47dGwTd
z-T$YgKK@fI|H&qu2Vbra67qceb(#DJKau?B>#tD$^Yxb-Liy+axcsMl|A*(D_0AXR
zW4`?Ft8eR#uXFaljX(T<ewWXKmAfk|A^^k<uU#dL^@o36udg>y@Lhkf@$f<Y&*)~i
z@%5vJe@=jE=uLoNWHVr>`ivvPB)c3aCY|6z43o5*j;}dV=wUh?@HI=?kGm@m?%w@Z
zQNJXQB}~`FHavt|2Cq37Nvq?2aa5(_rm4hgl%?Pa=N5s7_E{P|K&Ra3(RuvfvUeFh
z;p{ZgLke}0d&YAK9&(_j=oxk4XZ&pU<h1$fWdE<tJN1pmS2O$KFU{twmpeb)`D!D6
zx(l}>lsAu`?jP<PKr8ZQ!*qeE^e)?zciEjzJDawUd8_<)<!ms;7nLUmJG(EQ?4MSD
z`^)qF(<Xd7sa9>}cfI#09jctyK2-1gjG;a&l@Ham?eosXIyMVb&{pDG&b_?v2T)CZ
zLrB<dNsCq66FqC7PYSef2h*EQ8!*T$Zm^cnKsR8d^0kh`ckP@F+nsk|JJ3wN6*qA|
z1l~m~P|3m}WKemUUEMGQ-_jtX*xG}?_qvr?_0AonWoZ;MXh<8;J=+V$k8gv@!<J5=
zyt424Mf1nMG<ROOP~f`H@;vD3`<;W=O;cLSy64h%FgA+n0??3FlV6#iLvL~nDKqL^
zSJLWcf<OWUbY+l95Ggzd@Fux`9~MUTzQgUL00Rky0J_G;`M^Qz=KW^!F&u#_G{qrs
zPuwcJX`FY`$`o7u`R<)N1uZA05H;<$zc<CKL_l5+y8xU3=;v$O&vxB2fOC9;94ipe
zy$5j2s>w=nj&L<bJ`2|hvBRK~P#{>2w+f69=8io?=51vJL%vJ7URucWOs19TbdZe(
z!^$~KxH5u)Zx$}!`McgVy{2HhI8=1a(#JJImZy8oojurSm{;;(1&ChY+2Q@B3<P;m
zK*1k#qYT#wCP@LoTPGCLX$6+-+3pd)T1j)`cWY1kdvB0ox3tbY6?3jrdXT*zOo5rL
zq<kKyQ*JV$$e=urlhfn<!)K4=c_MLuHtE;LsO;;L=JDRn>5eabN&@bc%PDLaY;<D=
z9mB!VJY<_v42RSpY(Y?qD@GBHSbk5TE6GC+mW(Ulrd+~kLvVs8+G6;^cikIZxiWL7
z@(NC#pU3O*_rTw+%&v4ESF(cImmbArcD1(cyTEbMlVocvxsTsw>zvJuCfNZVvDf|1
z&#Q1LNM<EDzcRBVRLa+#H=U=i4|h>k>1Twq=nQF1I_u{hiXgE?2M7k>_Jx1Ki&P(x
z;H0>d)14;=&9H|H>fj4C{~YZe!uF?MvV&L0N2f<&`{U1UUYPbr_MC1Ie0<Cue*~oI
z<t%sV`BeIoKjWc5Q9LAyq-J_}yQ!N4mYnh7#t_pUVm&F5%mmCt%&E5;G>P7stl}7J
zi0@~+7U1$2eI}s)F`>{@FskI99juu-c8RF)En=x<Iq)Q58})jU5o7Ro5zM3<KK!jT
zvy7uaU07?%WQ<DNxs?howyfR(W*DIu%Dg_&+QI@os~j*k<o3E`bax3aHa3H0Um3%*
z`{#J^LyMF&Z*5zb)fel`CKJK7xBwOW4HZ|$Ra^=ToTeLvyLQiEZ7c_5*>5~l_-iQ_
z#$Z%L?wur|;ou{)!F=1Kqva{(X21*?qHDX<jl+0c)HNzFr<auj#gEjw!Opeh^kwVW
zZWVEt9d;5CMs{p=0Qqfnpi?w-b7*LYzcN&!I)&m8p)~WngGnqe(ynhxw`+BaHjn@y
z9Ma8$mJ+nVMWdpTkpKN#e7&4VRzlI7d8i~H4Q?q9`hFR?HI`dboaFEZFg2pl$OB$v
zpTedym~<$dX4pNiqH8zTl<z1%-=y%Z_Fq0$ef81pCjKX>b7iYGE#jl}QIj^xM0=9d
zG)MCY6>-4;h&2YA^5s3CTcE4-u<9eucOnld#8PtlJw03DbQ`=m7Y5q-RE5|qc#oAR
zD;}(z9G$2L9hjF#dre0;QhA`okg{Z!h8|U`0^Mw|f~FKSY--;DgP&Uk>UJ(Bm5j*@
zYND1bzgzYwWz$vBxtCPB%2mRFYF~hMTpMPPjOyu?fz=D;fs*@M$$u+f1DvJfS_B_-
zP#=jrO;%L-w}5HYkvx8!7)B}iEljHve=2_FP%+?|-0{8$Z*r`$>2VC|=5d%Vo%*xg
zTC%>r?nf+j@VXbi<wE9%#j-R}T_VOgHF+fLsnio;*Bs!(tht<(x`NO>yC1w?Fanqh
zV!QUlkt1^54A$24ehBE&`%r^Q|1@|bmoT@4&5Qsxa58s;W~4jemT=Ly99*cfrUCC{
zcp!o>%LXA_6>?WR$J{GNVK}Z09`jlY1I6*>@fBwBuveR6JTtg^t^;M=EP;McHliA?
zn3l~ImCXnX%g8r_U6#EpI$WDV1EHu6vjCD*hKPGi$~2I4wyHI3BjJSv+65)Xm0dy$
z8mNv&Vks^^XNY6t46-a^`wSHJSu#`6E!8VPx3B2=N<T)oNHPG}krKRWB{cpimP1`~
zWw5oenG7EH8BF1v4OUmHLS|0h!I8lHM?<%9A*e#FcM7Hjttl%cjsEJJ)!fmnmy@<-
z+*%78mK_bJU<>F0Dd>Hi?-nz20NSASjJqA1{=&;eU(V@kn0Bt(lY)tozH!Z^2`ief
z)P){^<D6iL;%OI@^E7%P+#uIFn-pEtyYgnGBgA$%<IWJ7O=ZDxocv^v?K<41&=#%-
zmm5Vp@0J5E7RMkvd>sN6HzB3$x*McndN<euYYu(qNXPM`F_8bWaVCd8KUXMGEuPEp
zQ|1ykPNfXE#_S}gQpMEU2uoSa6`f4q?IX|m!JqTaphXGd<U+<2p$D*P12pGd+s0_&
zt<FI3u%y*S^0zZs#(NJD6%81h%5p71Puva-Nm?1BjTp2+&%#CkJP!C6K&Qzz-Y5I5
zmpeb~?i?JP@Phf&y#Sc~Vfx+?Cn5|HZbVFM&~QV{<uJ#r>*lK!o%rL#bP4xzW97-t
z$^LF@cfW;-f#7{r;bgBRfzx;Qk(u%(9yDZ@f|Lj6aABd<iz6!#*I%?JT^bP?ZB+6N
z>flzBx)(`)wUXH(>n_8f1!5X26(0M^>CWy88vbhYhtuO7eo&1n=4V5%bV6F}v!~=*
z<>BLmVz^a2!!VJ@G6swV%`hmZ@M>_03$zPe?T`9!iFN2WhgbEqGURoH(g2`vmZs_0
z-8G#7KND!*gyl~j(-Zzdm^g<b2GocYq=C0EAhV%yu(QXB6s$_$@-w&s(!@8inWRuj
zMwq0~cmBFe{XI#=w`di7VT@`&7^)1P7@`m{RED&0RZEiS9wcbVL_#jcKD7kT6(=$#
z`)rg!u49d3$tLvnZ!^q7GQD1Qjda%y2{LRUw~o|t`y8`pA<nx=;FX55w?O1A;%u5&
zC_KHpkbpaqS}Lz8g5C=w=k?+~$4OY)FyLZ|HLNn0Vzw5I|3daDu?jL3_P*=&#<;ej
zyjuuK+^)1=p)pngAL#GznIc^Y*n(trKFcJPk-W#M5g)LK4B1@wvRoul&aW5Wz2TBY
z)C6B^k!(I75Wb@!?rQmnB&a5j=1mu?9@whp1}>RzEN?bwXR6>aEryS24nU?Cc`-7;
z|6mkVre}dbIRKGp?HHM!qiJBga<aQ_(1qZFqw-hB4e(-MM)9j_gYUbA#OlIbjAaGK
zg$p>&t)JytaK_`32~+cCvilNV8~7<4?U)Bk=9`P14;iniJYKM-UuUWK4u-W*O(2&{
zH8eX!TfqgpJxDv>w<oqfQ}~OHTEeW`89Q3lY;cKUL$_liN0W+p-C=%|=@uh?Dd|M;
zB9jpC0L~kQy}=DqIVW(CzAx=fcB<($UC{VxZ#X0)Ws;A#Q7?;0x0rQQHw_U5q4on?
z5&0b3ktB!dXw7JZ<!-dPInD1$+7qlwmns>Du1g^MjB{pT?%w1rukUgV#Yp*9rfIs4
zH#|1NQhn+15#Br^oRa~e?nV+Y(OrU~|4kwfH0ukt!U6&(4zKyLNQA?RWVJ-C=m(NN
zCNsA<aY~u4QY93zrZss_LX}@tkQEytR0CL1Igp4+@in6i!>&%+@28ouMqome7ZX>l
zWEpAe0>(hW)BP?mhDd&6nInx#*G_cnI2jS$1@<N0k|Lm{SpMlY$ce2SbTDMZf*PtO
zLUB(F3C$~qVyMfMBV6<{rL8Cw8Cvn3SjAj;vz9=Js*7Ph1yzi|)=KwoXxr<R^1?@&
znSvE6jf@!6t0BZjgQ2kk;I|>97oTa&&Eyt8Ai#3eu@y0LWmo#6L4E~-)8f(35uVDa
zh-IG$Q^a2bj`2dy>uA_!x&VibDOaumhsc^keR-}gHmX&-rgqv+cA1}iApf2(k0sL@
z&hy2PShQ}#n0U@hE&7vQ53pM-t;pHEEI`@|<pB*nZDF%aJczz?%qYYt?2AZUS669A
zsZE4#S#>cUadqkXbb8jSIW>hDftt^$rdGO`SEqnZl~e6VRFcOdWCc%9@olx)4ltpK
zCiTzHbrjPJWwh`!$C4s88sd%sQ%`~F&U$NWrlXhC5%7fA3mjcyN%;<-J~Kk63v`;d
zJ}PP5s)*;deUt5mH&=TPz(v_`5w4-DarF*8)1S4MJ3q7zUcYR<G=^!$vcMHC2m6&V
zN<N5rrUZ~NkF46)a{C6n2uKCn&Pa)cgoK)Z8ZxWEU;!bAI$c{!wgHtG`vtF6o=#CR
zYCw`vFikD8VM_Z6W=u^OygaJNtz&Xu;7)84uo-H_TrXw_qEP&=#2e5i_uZUTg3c-8
z+V&=}x*~5j=PWYx28(+_+s_}^?$ekV7~2|ZLCtI4k=Y-;ODaf^5n0-~?jSS&siqOV
z2_673ODLL8!E`(jY&k>Ill)BPm_z8!V+%l*PttUH-l-auHjtJR9Nm!fMvHeR?rLo7
zz;*LIQDf~cCaaLfTs^rWNH$6f?AFInbmP2Wk>p+{d0F^PhC!&o#;WXnPts~)kuKWV
zg_k0q8w`h%zBWKG99TGY4;!^a-;xmZtE!jN+81!RUhW?P_Jn%?1-2^<Czd^FO?p^_
zaItMm1+q@c1k3`-Wocl!p`XprS>2Bsn*M7GU-F9z+Bf0XDofm3FrFu`pFV9K!&n6F
zqzUQA?Wb^Un79=C+DgisevmXA1^QQ+m=vNj&*f^`R*8P&+3xAf+ihe{qL{aTp&4S%
zhY)~ij<3nkWku~>fE&?Egruqg4>Y|L$PxO8D-nGZ7_sp#q;indN{&s0+I|3Tl>>_#
z#Ld_ZB8BK}V6-DoW>@YIhfjDha%OEZerAwJ-1`<!t2J{fsHW1Z01@&MO_8PdW@mm7
zIh!-b5njedb8w_M_QkN<MrP*#7y=9*a*?L*6sYKygaR@#V>r$wY#kCZ2q&4ULo2?>
zlJ1O-`LkU(T<4MDS<W84v4V@APTNBqUMBcU02SKqjh#9Vh;OtY$wavV-PT}f1dYK<
zVI$q!)w--z)eRqqy1HeK(OwIU<b0iEEomUtUpQe}JKbKGHgL*3<Fd)&T88EQTdMQX
zaJwiSq(}<E!Vz~%%RvU4INGuUEQAPCjd~<#U|56BGWO;h!wZ4LNw+};PT32y#cKpk
z8Q;xYo_t7tE4U!_K8FjGf|e6wNfVaCD(hH8&A7YL+cq!&4&chLc-^RladsS-g|8is
zyP&XC*a<a**Ar`piwun~^WFuK!G~2^AHIIsI^B78!oza37asp9_7NN0>+?-#>Wg|F
zoIB;pjszX}lHT2F1HHId@n9rGH;=_|OP}ON8!|ykuW{#cw^GCt(P*igJ4Fa$MI~)W
ztZ59JuI7}HoB|ry=>z}raw-HlxwCLO?=AE<b0W|Dj!sAn$`%17`|5lc+}^S~10vuH
zOdvm7AIcpFFYd9aGryuITM7FwaG?SvsC~`f&}<xUHmD68guch8z9hdl^t`I{#KsQZ
zRSPZJyr)H;G-yxLOZa{(a1#1u*5%_zG!>$AM>@Hz*&LV3iTxa<#hZX}3fdXlZ&{9~
za@oE<14^HKffyj<6x+>{t$$!uup(XVv}Y*sIJ-_bOvqV#G8v!*o5DdQ%eEPzEv&HJ
zw=CoI679@g=5nCaJhJfcgv?Ut?iIm%HGkL+9R5UvAaNWlBj}HSFLwqDN~Yg!8E=Ko
zcy)nU(u^1*<R=-Z;YzSaLF)`7OyWkq2Z(_;R5UFwZh#zd`v_<Jc8pGsldB%OMrd^^
zE}dHyh>XlkyM|r4_rA4JFH_j?(&dWmaVXLA;%WszC$0{l25+e0V4TPuDh#f!b#$|O
zL*GFBpy-ZnGr)($5N_Cq^u*tvMd(p013<}Z^$!$c-w|g(9NA+oq`npo9rM^;fx~nm
z6?a?K5la&b2F;{|=r@HrVELt=MIgXLbdRQ=UYezsWaYqVKG1lIBVNg71x^-L)e(rx
z>{a61m;0PlY>q)!X1YMx7D*#UX>y4-;#+KB*};rq_8BR=;ln8y0RK$TKE7yYJzF*$
zdniQKIhg&nGCw8$<4xD5Zlah1FkD@I6Nu|W7~S3qXtt_~mna?(tp-L~!}77zBM-Q|
zDCki_Ki7oVi&n<qUYz1~G)JpScksMM^gF<O;d01I8+Z01c%d=fW|f0;Yh|J4P0hI0
z2dlhdYdiLD!PWIrp2~r1HNWVJgrjwj7yRSzwD7P5D>v+cjyQK@oz%eVcO0Xn52UCY
z+jbPGz#sYC9KwQ|@fj_C{V~80rMo~l&Tl~x8k0)h-gv5)LePI9j#%6}!E=$f$L@SL
zuqj`~$Bziy(XrLb*-!-<R2Zfqf<3P4v;%AP>Vw9n;!}7#@NyPeg4O(8mKSk27f|eA
zZOdF=73=k5cf)Uof`ZeBIA>05ZCiv2QT=<SzEKbOaX&TzHmd%xgmQ*(W~-(OFUlHD
z=s~cqMXn#dR{~$x#zNhO(qz+a6qKL{gfODm`7Qa5Xdxemte!3=i(Y_rW-P_-B8vY)
z;X{RiT%xaCVkx4tsz$t%C$#30TBd)tKj~<wnNS*$XUR*+>LSkKMw;$p$bJ;VAL%)B
zZ`^_kdm!WohD#jxB=m250T{!hpfSb71x#@6NSPU+?xpy>%KqYG`tfc^_stnoaP$fr
z%E504yTVTP=V;#TkE<Jzqt!vFQLYU<autWE$UP8k^Sm9`ttj4fT9c>=_Efvib_3p1
zja2VW_=8#}HpLy0myMIa7o$xFTzC0m$~(qiRYUoyYnPiPG~->TF9#zhX^!RSo=0qF
z!fcU}48sZ2Zt@A0?aY*&$!+u*S=WbqEk;Ds+bL3f7?-*G{twyM0uySI+_A`xkWnBj
zn9i}o&D-FH3r8N{^G=8ACZ;zoU>bX32W+j=iKeEki|`c0Z88N=0S{dljhci)@z9+>
z@Y8l%gmz^!@jmnFl}8b;-}387hZIiON&(4LdJe%7-;;$AR5;Fxm&Q?K0u`TG-pU;g
zQcqol;aqYGcynJok{>{?Rg8xOO*y=L3l(GKm&mOSgOV-(XHuvCKk=Cp{}Dif&DTFS
z4CMUykBx60K8*9ffBWsjKk~o-E+5vK{<`%^AFO&XIGa$+d?3fiZHnssU^bF(2?G!&
zlvsChCKaeC(ag6PW%ADtHoksPuP2Shqm8c~J*?-WOcn-|3<IH1L~e>p4COy<K3k|J
z<`se4Y0#DI0NEpavJDI%yBv0bbiyZ(i6xv)hduM~-cO_1<r{bd4V;gVDZ;1deLALG
z9b^Fi;0gT3EC{_WEEa#EaQgW6;=%KRw?H{hsHx$DgM!z?l$$;UJiI3AB>X*ius<p&
zPT{pRKo5!Zmq*J<MWZ~UFTW_B&>e)#$f=p$-)59o3tnJ_&IS5*R8ThmfHO)EuK_n7
zMamW^s3oJVt&QZe*B)g~fPy<mf>5a=RUGKpN{I$9*HBPK4AbtaH*h->2U}KD_eST_
z3miF0DgNG@q-)dO1ZZ2z8o`C|Z6DtDhiRKu3*}|qbauu-v<&}SOJKo(W~M*}Hf$;1
zmKe6wKkFcMA3h>6N)|rLrd?R*_?e4>nh$eo9<*m4hJ!N+9!hS?z(0K7JU-b!I&2-j
zeu=`tuQwVdnkBSx&|+0Dkrty`zj}urj(YE*EqK(&;t0Zh)|a!!OJRhfJHYI*yL;Sd
zw{miN{CfAawSQ>hNcv}Y2pqLZYygUw_sRZ<IH67IF3f@BU{phuL)Y4ZduN(@J#cNY
zuK&Z}a(2n^TLD^{MWlqEIH)}8)S)~vCpz?(J3l~M6o2($gW7>3u>4^eKzf|MXIJya
zcechL8#ger=p76xih?O}&A{*SXAM23McjrBc4wED*B&7v%Y>$04ov_o|7|vycq0xj
znsoMvy2PWFbXdNI0Gf1x*4{LBz^``p_Vy2-!GOe>%GIw5Mu2Brw_3Fm-#OTSc9<l0
zD$)W>#=3%ir!6Os?DHxwHzPjH-(nZ&$^NrDJ~ZvY{^{vK^G@CCwq_&TTs8Wj)!Ec}
za;q>wF>HfFJGerr%&&Etv%-T+@i|}t*duLAYbO$X4Hg)i;!>Mo_$Sx`Kp!!8!oAW^
zR#y6#Q}!w9YE%+-DC!Q*2h$3@ud4P%a8VQr0BQ#IY>H-$lSdQ?qU|MPCZZm8+=lI`
z0IXs(g5*I`-{7!q$qIb6uhtSC8hlyaSoUTN2_po`P=Jiak~<WP@g<nSl4A{UDD4$!
zd^K6ARA{zn97N3u-S50l!Zq2nOVIWrON9wp27#T*MHSA{1;xoEnA(zUU+3SogkI8i
z!n=Caga{Gy322FreYBgnkMJ(PuaP&$IP~LKezN>XzMa9h(AN_ikr{H4=dSQYt}tER
zLFofmdYCJX$TKK>ns1OM92Dw9p{NwyYeAuIzL1~<Tk3=FuWp}r{Bu4x2taf^>OuX1
zo811gQ5a!lj=v+H9@e!;#VX>U?6yJ73j*+;x`?_dm4~ERV@(Di@IQ5zYDUu(e6qjS
zY+sR{Ec?6V!kvD{DRekgDhsFEn8HNDeh{zkF?`NiQ5x{!Oj!4T)yVUb>n1P>W6aLv
z8veUX-l0=x{V+~53f=@j)f+8G9+R-@)0Eq*X!J_V>>|i><${qMofCPVIWaTs2brA!
zUP6SEj>&imKqBu+Dc0l)q!)5%B_aeHujoT3m>i>w2QKgRc)ipcpDF@YgF)jJD?jV#
zT4sM**GIjT$Wn4Nouos#8+sY%P%$)m<o(FSwSj_|o`v|N6uju;R(d|#LAq06i<gH<
zP?5J%&Kjrm;A6H86)p_ogu7SOjrLqVj*9W6TvYO2bZ*=EW2=-y=ut>yQM>%M@teyB
z6;Fw!v6gB{+qHP%(S18Sk%h-m2W)rcGCOCfWotakF8bo!#c1Qo@OT0%$?~5%%P<Dq
z6C)ctXc0b<Nz`izG#d-O0{9uvrb<3XutTjq5l4tKi4QwDuNlgv9Eu2qx<iQ#A2R9~
z@gxt}+K2H84i#FaaVn9VNc=aUv(VGwCy(~t=m{PHZ!2127tv9hs8)n{uhK3!^Z$Io
zkv69Qrw~^faLbz`8#83xRvPT!4R*nO-A^_?^!sj~_~AA%Kz}Y(qZak3r~^CR<^fnQ
z+E4D5;ilV_tPqv6TEd<s;#QLL5JEPnGvzCw!r&_af;B9Jc%&>#doLoEf))0(q|#|9
zx>)moM280ZoAxfz@9NArIK%hV)i?AIE12i>6Q%x8spKqR_h+qfPTAw&*Bym3f=P35
z`xLj`!?ZuSOlt@-y>Mjy1P?m-B*^VWT6MW@X#NqsdH=%cfe<&KA9P?JiVAKuqV)ME
z$qrFu4A!5CMv4yxqX8RsomrJB%?EaA`DY-;&F0WOO0!*ERXwb`dr>FBBrSQ6;*E2^
z?*h$J^x9Mrq`%%PZsHhuv*vGfspr>abxRuvz(by?zoo)4?n~u9KqSpU2AjXb5<@b_
zWb}pm2Gnv;dg$JG%J|fMiwH`-6peTyF!l4em$!ki;Oc5Exp16>Sq*|^?|kcxhde3#
zt1CEfDQ;+}A2dXidD2Iu!bExr@&^3pTek?JA_$^-Ul59)o~aR|ARKaBak1fdgW;<P
zqWsobVBp<P9eDRP1MfJ{$$}{;32aB{u}>DvZ0M1XfYSY;={+Eht9o*W@oXmN)EKrh
z#EVAhV_pQJ0hR=@pnD_nj7vAHNtRm*^5_%dJX^MAd8Obh-mYDel3J;H7_0*NQ5<EL
zxn%VnRTh%c0U|^E6zDet)I=nJy-N{G1E&D3Rs^|vCe<2Ed$I_Sq9eoX_VPWvD8)6%
zSn61d=r2c94HFXre2}MlfE?G2Sb)wMCXXLGVgi5u7EoVK21*hLp-xH(o<*sg&+k;o
ze=euCD9pO~9jOjC?}ln@ZdQnJ0XVm?5-q?C<i9Ka2L@Vs{Fu+t%AbY%(=#xXj8h_+
z>z%U*k*GE6e2){wa+_{AZQv3=OfjLVw*)Pii6euDUa}RCJ*>(oB77|EavPdQaaK33
zC@#5$7^{KUs%z_yQ-|L0RQkK}p>~u*SXc#!0V=YT_WNjzr;*F+7{KbB!aYwIUqR`$
zwM|^l1I&Ou>h?ZJ@|gM>hPLc-d?yM%{~kl+z<O=)8v@u}a~xNoHA<5UyEMI6_d#Aq
z-g(x`PZ&K2IZ#aR8G`H!5n{MFs{sWDPl{=;+`>}p7&fzu`U7l<f3U>95HG=oF42aU
zT^8(~fqwUt-j*~UQ_NDqK_8ryNMPH-o5V-OF0k24v`~~aUHbh=zQt)ii>6_-2H6lL
z3Kh%72mJB`Ln)i<p@Iv#O55hCM348QJJzubj^df16@D_Z_v6Au<!y;Z-^FF`vNOJ}
zASLI=AB}Y`(TFnQY8e3*O|gHA2^Ld}`GI$DJ@Bp@cz4l(cW*K9PB8F@u(PBTOG#83
zdJlUYWWLX}dbJvy-AD{3_uX=5W0|DAm`TOuIl?Y2;pc>=*vm8xda<Qw>gibSi)7?O
z9k~&FChF18jVQ>jtltxJE5+Ns@D7DkyuAcT_+%ec5zH>^*+zP|#&d+<5!Kvt?mqFV
z`F)#>*mT>O5MY2pY~M~?cB?|-YVEv=aY5^OI4xZhre_vdmrtU!<<5#|Y#Nav2&fbd
zgNdlz?V$<`o?DIt%4_4k2m!<d%p94{KlP4}IIz2JzjIRLB^5en%NWlG^~e3e2ZSwy
z0bI%~uX4fj>haPd9Uz`5?LjE__7KJUcx7sniviTapp<9X0H{8Gnx$4k<~Ry%3`1fK
zKnro)J12{<;o$5i6jCA({JMk$`BF_pk{@gIjLCF*%3tL<tx!#Xn4ckXs1b_z$hH>;
zuXhgipR{&f?Gt=K&ln_3%qAni-@ILMFCjIyJ0u{0vP(6cTmc*WVC9Q`?yeZiyUK1A
z4fZzH&}t8<`}Gv%7O!6Kt{o53^@P&NP|++=AM*9P*v2a~zRHNF8e~NJpIxK5^oWAS
zQkW5--w_R*_sD^qons~$R7lUJ?ZJo)wlL!ujK&%KWodu<9ytqA=Ve*i8IXZjH|>zX
zmUF+MSzwk_C}&NwbRu<@s?<@p2OOWIPSRIo7?;kb<T5cCkXInG|7eEA<In=6U6w?F
z(16Sxnw@368jZDvnY9Le{M)0+je#73JER7!bTI(O0GJ_ooZ;gR@SP|P8g(B4*`D=a
zIiZaKM{%$tq%zPCG&07eoyuZm>~e*nFztNMHWE$4>FUBs!-btvpJZH5?NI2n6hrk;
z0v}BUgyxTTIhJwzjGglp97bY@i6g<?82e3@SJ_3IQUcvwk<}yPL-HBZc};K>aF9pS
z0c^w=s0h-zM)PGTI(^<uPL7_Q{$=O5ne3k=ua1wt-`{KQB}+Re@Egv>U-nO*AH6<J
zpv3Xc;pvab(bHt-@W<rE{^1_3c=Lx>$IX+I<mforfBEWQzqwaS_78UtUXzK_6R3H3
zbebIOzuZ5CW>1f(OKEJs3H6>rBQKlByU*dl&XfIv{nH;Y6yNC~w)zyB-AP{U9G~v*
zzCPGFhLdsp>gc2iL)e3c5BCqBVsy&p%jV%J%m{jhr%CgB_?etM-#Iv-?si_o9FA#>
zyGO5nJl=oy{4{xfbg<WihfkU?I`kLf&JKUX1A4Ht|FV|s?Y!K1)}(qz(9SUxlo9^r
zd6OPNk2~;x3NeanvwL)SdJI2tZBCDlPhI7|?4LAi$<Fcq2`<dj<0I$*7Z&OqQ8Q5U
zu*vP<qT|S+4YxZ`2<P(pr0K`A*8~K3`0NC$+pR?7;4k@k@P`k=f}c6|{}`wKb4~y0
zGvEII>w4pxMr8jFr8oYt|NlKcY$!u^`Lf})tE92s_<Fs*{xx3p^#>dE2M_B>{i{b`
zKYUdGCU2X+i(#hEd!yc@jXt?3ZUVyKZkg3SV1F`ejt#1_X_qXUw~gsCj;Ph~Mx?KI
zTDwQb%>ol?`-J8ZnoUz=z4%!gJvi?~4~D%D(G%b(qbKZT89yB37_#W;xIF=iD0;|I
z{n?&drU``lFSE;WR_UQdWDn!eq3W2v^{XL|MM4KmXIJTc7(<sG;DecVRFQRWZJUCv
ze*Xf^!+~??VSC8x9<~1C^~+cCsBa!c?zt~oqrot#Je`d?LZ0?B)`g%loWF_1fysE0
ztf)Xk6(ap?ZF}5FwiEn<0VbzN>`i@ijfAF6=30?Oo0Hg^c0?${4%M1pf#T8_`976L
zmHqY>bvtTzrdRDr9Arikf=O>It8Nd`yWpB)6**z4^}~}koZMy$I3wtyzqXCL{}T^$
zt?o=Fa4gT7r>&z`yGMJ?id!GD5<hy?Iyl<dJKR68f+k$rF^zvKfvP*l&ssaC;$~QI
zn)+f-ii^PzxV^_)Y{~$;ufL)GYF$?pb5Q^ZI6~?WvpGjG;B{SBM{9N1QK%ZqyH0YW
zs3lrH5L#J#E-TdtllT%8;;QaE*{vY-`Q@q!6l&`}1QzWQKo#<@mnID~!nW{VFIot4
z5p4TVguft|5!}Ex(GX$Q4DufZ0@cAQsWO~u;uoBb)Joi`!iT@GcthrrJ^7%M`Hz>c
zYN%iFC(uoL)M-zt*!^E>I3k;@iDE3ktb8y`IrhKAM;M+LA7P9?C1-fjn>xNTx7^3g
z)7Qs`HLZY!S9!5xxesy<1<MMpjOnhxkfT^`hyOg`Kf5JeV`(S}rFJc|>oyMx6&O?X
z2OkQDK<A_*_WZ!x6`-wO$ObAn%Hz%(Rqu-OYl~{HRmPoFr!rFyT6{y1W6fTY>Hb+(
z;p$bkY{nA;FyP`W|Io^=fo1)`A{@e!Fytk*UA4X=DS3Rc1V_#qLK6<YCSwdtVJDIy
zO%dzcac7zMHV)<i>|+~c(6nZZmeCGKociBS#JkL%q>P=%Q1sI4%t*O9@XMHK_7-x<
zYG3xmspxE&cHUJfC!0Hh(Altk){Czg-kR{PkkdHs7)a0uA9J1^b0EN<akrt*{4z#+
z?{-kj`n{EVgKe=ee`arpT1X0chvs79oM_W9%dizIxcEasF=tk(*Ej*%Di1&cMB;N9
z5&3!pe5Jz~%+tzf&8h@YF3Y2^HE)%|OMOswIPhwruw-@0Iu3{6^d+Vpu~%MYJV4b*
zHLwrBXPX6c9uI;%HWW%+GbhnXp+pnKL=3eT?Wx+`k0)t&hJp#!_ha=6`lssS5r)8k
zql#W;lqV~)l}D9Kiw!%A76v;P=;X|YG#Y>6<-wN1AmK5pq<6brQe4nzJA4H%p*71m
zpvWPBlTVu`r*Qhi#N8$iz3RtdN&4xGEqbD3GHy>h7r0rI-g)6<F?9@ogAxS*G4S)W
zqsMCQ+*lCE4c>0K3|MkV(b&YVBET&!8VU}Y*ZsKp48cwwcp_*Zuy*38rvXL2tvW*#
zp*>a1O2I2<>YSBM{0k)rFT~R{$k9XVuzTFxIc>J^>XHf8f}zkAFAsKUY@2s;^4lo1
zZhF;|$Pr%{6qS560N~!%WJwEdRw|EW+OrR(L*j2&jI<r}%+o2-h3pstufvJvW7Rnt
z_9LE|KQkqB!|m7U3!z}%%BYR{rL?FHn4y-@Q0m<K<jPVr3*H9}f}i&p=ngU#e<Rgc
zbQRi_r$GpbS(7VJH%)(6OUTfWFm$cnu$gvmC_27e$a*6?Dn^=|rbrZryJGkz8x)CK
zdTfVXFk2pqf|O3xY}Uu3nei}gI6DCu!USaj`R$fl<`eeDB?~)R8P=u8hF`y7BcLNZ
zALJB%P|X%$G=tBeooF?6I(U@~Ma!&5gnwy*ow7qy4Gx(EDeDG#AdJ;q2+KuB1EyNE
zC*IDe__FbI8Rp-hatvUoAwuN7nmD%-SAr!9eGLEnA#+KkO(Z~HatrBhPD1VVrX_T@
z6Dj~^?R`L!jx-xce0S2z@v!$nHK+yM2l0lr|H35^JsC`{7{!k)W8}@W=#q6u+%3-*
zu1`^3v$Ff$-Rh(U-amO!p(k>eMq(4SD)l|8k%>9aSZ^!XwQ4cO!?&=oxnaekEV9l}
zG1lSH;c@feXqWd-I-u3)VPN-c9n+QOnbLN*n+G{fnDWklz4E?Qs*4o}q$q(}Y|#C{
zto-v9(BEVq1w}4u3GcBaZtW}ZI_`0((YyPSmQ{h7Qt`26547zFMYF8%^{6#zzwiBR
z)*c?6{ZdgX{M}D3&;5ua)Kd#@Fz{RGgk4xpX+~p}OZxQoXzD4)&7?yXo)YqzGw%76
zBEG#EcY>w_1UT<>2t!PWc0NhpUs3EvS~3_rFWl%|&8>*;MKQG?Z1a;3%oy`9B@=4o
zyDlhC*Zi^Tp&FzhyiZFgrF_g~PLx6}BvgQhNsH<x6ol;R`&WiD9lc{)laHa;i7i`R
z<RMZs;L4pZ@J6A@U__FDl)w=Nh8kQe6hR>8yDG*1<P^A08NTwJTEob~Ze@G1)yd8M
zSrec%9p?L^H-#OY`Hs$R)e-Dw+)vN}K-HB_#%(-rm*+Py%nXXUfxds&yWS+80|U%Z
z_!&-d#SH#5^*lb+;Hc`rnuhx$(0x%n6?jWS2(JTZMTIrxc+m;$$TYVAOYZLYu+`@7
z8X&{W3Gv+RhS_kOboWG=6Ce<fyJy5&t+~EL+~p8P(Cha*$52~wmy-eC(3WA&;*#+l
zlH{&TDq1hRSn&jpdPRcIxfjf*E*&@EFQ`p@s+W?L;fE9b{3UHvH-kaY2+&HvG1LHm
z!?c4-06?5%10-O?w%Z0K@XP1;5lY~F(-Nv#I1V6iXa61ta^Q_Ni<hY^yXN<j&(zd5
z%UL9+h9#yt#A}=4J|R`nD$O6nvxB223ytD~83k90hw;f{*gxEB{?IhJRtrcUV3l0^
z<&@DaR+0kK=2x<yyW38O;rfwzg6A&CpK4C9z<Ft#&IXp>uzZvlKRC9~gve^zSM9-&
zb6RKVW$!(fs9NX`v>4r9t4J;#C@;i88=0RnR#FC&W|4sWvVD#2Ge+c|1uC2}o!672
zqXSZjK;P7Fp5Avyw^2m($JdDC0P@G)tb6$ZKirS^4SlJxCdz!0dil0-{iizzCr$PC
z`2O_xbu((NbP=e1hbpnAJ>@0cy(nz`gKhnVZ#s8w%33{q{c`b!Eji{-D3Vz>r5pAK
z%=Z=w=sALVa6f31UI>a}41cMXcBV)=O#2{0R=YZmRxjGHmq*_>^D8=ct8zg-3?t<4
z#-sf`biZ&9{zJ5F__2z8P253-k0!6UbC?WpAq;f$ZqY?me$3jV>-i@wqBHJUM%J@>
zWt2@4o@n0HfI3>UB#<2=4B>W2ps*(em4Gz)4;4z~BxPt~5}h7al+C7WC`w3gFiPGA
z2|clOWBg)ey%dBvw9-i0eU!>`5J^L*sig=iH(Gro_zY{OeTu7e1tdK1(+Qr=q~9L;
z{43nR^i~bPG3;4W6|YFrQ$D45ZTaVYH(i<VFXTdE*E;#m+3Y-u_1|2P=j(4SkAycY
z9_CpU6|37rSt!fx{}T9-(7q`B5KB-Cgt$1<8rPC8Va#(1PvgQ<Pb-trl9)4DBa2&{
zW>4+nIYD{mBFA{{Jt;yh^JLD!meW~qpiM9<$G>Cg1u@OsAr{NijJ)(-a0-PUG0VEC
z%n@-#q83B5Zm%pehrsSfPM#?7zs}cvG$>?KhQ{6~TBKsMBI-Iy793|Gvm+1ie!TO#
zMw|^n)Hs$V3tGwp5Cytl;100M>oKU`Ub9zD|1@Vub3k&Om$?)Ih>Uq5Dvt;p^PA|j
z92Hka7OLIe=p9;`QOGG^XO3S~V~Jy*BG)G{17Ni$?NK){JPVJu0b(?p1N?|$AjCe&
zBUdH-gyxWlQs<CjrLE*YB<P~*z6V?(PtJK1^uj+9usVLRbMm6nE1))mR8}_=wDEC^
z*1Bk=0h)G$HNJ67#bb$BFgamjebDyZ4veEr0vmkZdqf9VMiXHW%L^5pk4WHy*-hYN
zlmkD!v`67XD7%2SH%Tu7>~6SUi=sZ%5^5>8aQWDEg)$C`OQLsbJn0YN^&C;!Cr<d$
ziw3a(V-!m{Za<C>W*jR1hzD}hC~|U++%S$`EVvXRy@=Mq{RA>&F`+^M527}v8buJH
z?%jYqvJy_R<4#o6?#Gx$_)s7M9`@%F?C$%!-nG}5qFB<=8-<rio;JZcp@y}TVrf{d
zc(l|9Pixdv#NfqShQrMb1Rv(fHl57PTo{{j725j6mtLMxF0fpRQJ%F_C^TvtcdDc>
zjh=;OPEcUs%LG2<ZCR5~VdU>sjBR*_G9O36ESw|oXDI;aO^hHGDv*jhu|uH=TaTAA
zCvu1l*LrH}et2~1`5m#8Ukg$IJF|K&og?bh%2<IgvbGxZ*xKqI&Bq>VwG2N`G4*pg
zJHJo~V3OnL=boK81A+bVCMv;^kl};}{yZJ@iFLe@cqFq-p?W)HGKvNo1pFF?@KZ#1
zFCGPAtRhKVU_-<q!-ntM*BSA=n__uMQkF8zr=0;WYq7hY-bhwO{pBe4MbI?W^boIn
zL+Slz91H>x1~975+I}!X1YlMhg%^D*yeQ<BiQyMC7I3LC5_4d{B8Yz$91zVONM&!_
zej4zn@BbIy=2CHU*)~sa+UDsZ+uYY}?$6t1M36`ie-``xDch&lD4yw?<>NQu0&R^t
zxuLnmPWz3*Zad4IP<js9#!nt~%Oq}4fWfu%WweNkP?BPUaM2#4ig_OOD1ophFlFGL
zSmubX9E>_lPSju7aFc`jB4}<}q1mP)B?{mxX5-%6I0WpXH+dUK4)r#N#+X{#m0@@4
zi17j%pRK8;ve3dB6geDa(|$Un{4o{dW#o@l-Tr9g;%8sM`>RGRnW%W|o^h<KlgQRS
zX;j0g_g83?*{iGIfF3pQQNup+k<)@x3xKw>2mH>2=RZJUM7!Iq@R$HP3<zk2lh;qe
z3fb&zZiSbx55fwUv*Fwdd;8z3^aI!9sv-WCp`pI`TePPLL*xR}9b64y_0O)84MVb-
zj-kN(ksj^+V>-S}=dbCjqrZepG)~{ot?>HrWmsW0x`YbFg%6sCal(jEYJ@QYy=cWx
z*&B2YrOCuO{9zz$8F2nw8Vf*cdsLZJZ(ca{iaBf_itmvFWE7tpO1Hp40WoHKf{tKw
zoc-n>Lmag|!4;~4B^!aCkV->sKqow8P+r(0*bwBy+;3QOC*iY#1L*jXhD4`k>P6xO
z8%;DtC)c!5EtUh-i*K4nz;*;a!-eHaT9xYc`PUUL8eCN=tXt}gf$Bv!R9;7j?Vv^T
zO%9t#W`(<X8<sZu<l*3kop2jou%9^wt>97J={|@Lrr3QJTAKf96^?u<vYJCKS|Bho
zG5s52U`;?ZZyztCb@<!ITkgQhb(_{Vc{XWdlZWkFgy)a9wh*9P8V?$g_uq<kJ76(!
zH+Uz^X1lHaj{*;mNv}W1`|7+N9gQc^`Q#PQ-#vCSXsl1^E?W<jsqmYn*+3=IFNZQV
z=3aKkt(W_UuTMgmwY^-ckugDDl4a>7(h^Kb^D|0EYt)KH1Z$6`CQ7J7RZ89gx*(3>
zzBz%#bSRD*h`~onzq^6t5&bb^dPC^lVg`$h8k)a()FrouJN=eqD}s$DgFJ9t#c6AD
z8@qG37tLG+8#MT<1y=d!xS$0hY!_}~_vmnU=d@r8tddVtqKlHr1v8c~UT?|AV)-Uk
zmL`p~oBKtCnTPb(2j-U}sr>sRTbBrsl2dV2t>*CFoW&?&I2Nm$bD~PKMFFJncE1I<
zIQyP@7@?%9`Mfh9bXu}%+x*#u46{EYdDg!{A|C9`XLEr`pbr&ezFUE+9ew}z8U2(;
zKmC-^m!1-*5B8mtAh?l}1V=LOK>pjPs-%}YvO!Iv#q#%@@!O3X3!;XU5MO2H(T!>?
zxKOQ1HcuhNcQ5mBp>QhD$_5iFFehltM>Weaswu$vyoQb{j)!p*a*CUSr@pPiJB-m-
zTo0b!P>&H_To0b!P!CaKz8*ZislTJ5`N7j0>Jh5V)q|%u)NB6dBS$T3t>%A{-PGKA
zht1-88#mNDIL+5PIK8>QgM$806?#*>XC?jJG|p!w{gu>PoIHWMXNWPeiv4#-Js%{b
zzqXAJ@R&;IB{ZSJ*su6FCo^&kRIceju@(1J<k)8&x4p$TMOb-1z(AMGKF|RdYbErd
z8`yqEw0yu~Oxo8@&>Z;7iBFM4-S9r&;?%|u&De{0vzI$RV9sQ6orB&AGQNhvt8n!O
zn|FQSqcBx7?F=qB1~Yf2m*oT3{mBj9zkt>L<bg-q@3%e*6@w0WfytEc(WUIKWa$em
z{yScVC;$w1&e52Z!ztZ;186c<AVZlaS_HYy@y_J@5T%P}Eal1<-z_ZO@x^0r0Xlvr
z5Cx3BO}+vh@uwO}L>&U^!j;IAd%2acndFnRg%;xj4m|%H10c<r_Lfe2fysW*$<CQ-
z;2u^Q_5gE{h>smQzsu8UN~RrNT!9)WH1fqFWU%?*;OTzzVDF^$s(IXcdhq(>xki1b
zR#93djZikk*E@JOo*rWem+z8|<dJp}Er`~+r<+bv46*Jaf4#sEJGO&4*hkek&xrsb
z5~VFxO%)&E;-j~3#iE@uI1|ekW8u0*ZPNmAzyS;bt>#}6UW#@|;-7Hvntyi0%>TDO
zbK<|Y$Ak5YFVV;R_^%rqUu}F7$AA6m+i(7e|N47;Z2VW+a1Q^vUSF>#jg5_OAJiKU
z8s8@MhmSTIj~ZX+qrdLVJ`9F~_T<`m#Y&FMgIPP-d9}Y-9N2#y^hZDx(imD7J^(EL
zyjvV_l>+MTx1PQ}+;v72JCt{T%jELFQ<eaY;DBu4-G9aWG5!C;IAzZH=g72QAOQ6I
z^Z)SMZ#KS-&i}U?jj#SV|G&q_o`2bJ!T=8u1vESg_;XVK`q4u`0T1&i08cvA&B(Li
zqPk%0XYP9+9npQN1`PWzZMEOEnIS@@2c2mAGQs$37g7i#Nv<TPT!A8@qI0{%E6T{$
z{C%2?+mmVb2)(tKzrx>~FoN5{-_+0{Y7jJ4pe7r8*Spq$z(bVTcL&`zrf7yGIP1aN
zv9oEX*0CLGkTWK9$T^G|mcB2A-Y)oKh<qbprMIKyB%5_EIE-O?imeQLZ3=QY<a*gK
zg(;o&rtf>b5fF<wfe{T1x}Rk|n!$6N5B$Jjo|l6Ul2c=VlzP@drSC){SrB#g1Y?0N
zXK1}Vpyj7Fc9Kh|L8i^{m_lUY05k|j#$#_|TrhTllkiaNz=JJd?P<o%IDfgyV7<4_
z()ARe0=>GH{aczhR-zp_hYiTEB?_vEc{(n7yvCh$I2;i7X}XpE()XjVPhOJV2tW`0
z^e}oPw=zuIXfK2ODNvm44$Lm8Z*2UjhAAwFpT#<p9=4Vx=V{tqmwQUXl~Xpti|rtQ
zIYw>?1DMl--9Cc(r-dtDFgQ61LE`x6CJH&9%FFf#2ejtUz*;x{3wVwv`==+kAaHLd
zbP3}FV9=B8r16cLtrWa-2cMB6Q|?X0)?RB=^+vWOcQ7~ook|^(eM-e@7%u%{oW5^V
zrnOO(#RZjf3_n@HFl1=;Q5jV^LlZxh_@hAsuz64%{)HAygGmJ+t!+=Ut93?gwh}u1
z^x7jRH?FFr!d4zv-Fl*32ZkKr)P*(jcA>*85hpp&E(~@yoMot49%BMST>S>Hw0smU
zde_Oc$36xZD2<`?j17U~j3Cqw52uc6a>p+RE=BSu_+wUMtzP|&W3t9;N>*kxyF0$U
zWPdb$g|8~(s-K@v!8u^Wo1rmI+t^sy(V=|`6uWcB1*DRse!h71fjok@)Q_v&on2mD
z<JbXu?z<nYYLpG?5Cs<gwdR1LBu*b|bP`Vw_wg(8o+g&(uemak^Xa3+-6jDY<$vP2
z6UM>~_M^{CKv^2d3KoKCYlb?yvdA9JSfNRzw?MYi{z(?gMW7z206<NBdVi~okUeMr
zE{3Er+|neKAUwb3Ork`9;sAn~ddbJwt|j+JF2Q13Ts1U<aGf(2%Wx!Var>u@HyCuT
zE%|_@eFH97LS!#dENZ$65W_C#oT?SIqeB?qR~5b>GP(*9GBl)!)O~+x<U;xK%3}}y
z5{j2UWD1-=jjAmv#czfDR;>DxA>;MSC(UCuRx>ll;Aa>jogKWL(~GTpa*BC?3hFW<
zN+#|18tkjEKE}Uj?i?00;E_^tHm89DOe*yHq<OrzbGlQ|j6eO!IM<BI@8?!K??m-J
z7Q`cWn@Mo?7RoLoY|9r4xzrv5FprTy>Cxc>>^EfkOt7N8poGREn85^@96k8`fXJgD
z#xqsot}7)#5XI%QP+(6jM#A({^=4)7oV-l@OB;yk-f7sz+#z;>^WI^MEN2EItLv=%
z<oB9L&3LJRC?&hTOA47xH;qf+rBR>DRvyosG=rPK=WRNH8)lNVhuM1a6hr<46@*mf
zaEOfr6n3x!LaN0DJe`eXF*b450}>FEx^e%mKiqXr!#xBP2shzcJ>EKuOe#AUa`^sO
zpG@EFcay+9&f!hk(!o&nGg?kcZ-DudCq|`#=+DE8+h%NR15n}sHQ@sk$4*(FL1h^o
z!)yeY<w|rb^<9LM2Rel79$;5QcguE{Dv}VF^SA9*eVlj!Nyc^vjTYnKN%UaZP1WBz
zh^Fq2n~RF1`$o)z*G<d)C!veF7#vUB|2d^MlQro(Nq{F#y>C$;ZZzBi_hB?kXtyy%
z;{zntXybnSEzkrBE<T5MP^PK^^wYiO&fbgWkF*CFvInq82nV!HIk!8-O17B*Qw8Z)
zG>R+5%uLqoz3I|$T+0RxMus!B>ih>nBDgbwJR4&K*i4RM!eEh(!nD>38Odq@S%qc@
zxbf$>&=o~5A2kBz$V={@wI;KX&u6RdtAbaTXhr|?pt6JwE!jB+G33qI#H`roifB*p
zP-ix(mZ+DWw<!4Vt<Eg!S@pEzh!vWBgkt3-!zjf7cR+~0Otq}8GR+b!9uqEn3^0l*
zpLlbJn9vpX6j$7bCa4I|IaRIQW|PCgkVy~YMek!~!e~uM)WK@qM+D#qqYX-|3dJy+
zO3=+_cmdR{k(Q&&*0$o=!F&yMA5IrhvqQy&6FtWx=)inXtu8iOI}!Sa&vMYvoO$Pa
zoj>`UA^jz)$J_x6F1%kqEyJvQu!Z9ut{Hy&tfsbD>=ih!T#jec9&T5bR7l-8yUc!i
zBVofwa*u>J7%C#)r_*%6lW+Xjz-Jz6vsVBuisQ)KvSgQdsZQ{28HM#m^DDyXMsL|P
zcS@+PuS)r0RNRFC8kcv>#70df!Hflef6xHfm01(qx<V^ki8H>ZxJtN8gEz^x&CA}V
z=-2$lny$5>n0BDROz=YMK=L&=Qwi!C1jN7z+7%CGS(&1V$0&VY4XWUJw$)E^Sh58p
zwht*@T94pA-t{xV%*P5ACe~rlhf7=r=z6MVhS-SIOtv_Nx=}F88{B{`96a2m@b6>a
znc?k5?E(iZ=n22%DQN{|*cK1S@8;7}@34Oj6hqP<-8M%}MSOwCRIxR;bp#2W9;|SB
z-T<2V4c-PE0cAF#d`Bd34X-nAfgdHK*~o_+o?QZo!#(HN%7RG`&)xBz!go2m!*g?b
zkz{g*DVtqhI+^%eY-`yUm2=~#0}v!6Gz+SETqL{pCvSMZg$ED1--61+^T%5vPs1N{
z+~C#9mOCX_38kY+hM9?NV6<V!50v3-61*N@#yXm(=XBuNc0?gN>r*ZtTx0~--CxjJ
zayA}Q&Yw#g+zHzpK#TC$dkmN}k-HTzuOO{ekju}lpk-MoE=^Kt{1+_QS{>u-!bZK(
zijr!DD1PW&uUIp#BD!I%{>HjCbTkM3M-Q#o2jH+_hu;u9xZmd9!xts+NVj`AILg=Y
zsO@tkuxZN_j;sYgdQx;5d@8tFqU5fN&OTUMtL7LOTs17}5P6<N8CgnQ7fSI^$V|{N
z)C)l;YFD3dqbvytvuJtUYHO9e_Zv_$w7G2QR!-UC5`^nL5Cr_P1po^es^g>LE5y`-
z^T1*`jg4<4b6XMl_ZWXLNZxg{s0(=>)0eig>`~z~aW`&1%OSVN`^Sk7Owvv`p!RG!
zy3}ECfdXN|DhwYrFVqz_05=~fsY?L8x9*)|H;0mNVZ&l}<LEWm42ro6gJxo|7ro#1
z3J5vIIhLw87lE`+WCXV*FZ>({8b&>nAAxuLP%~+{9p4DI*&PFafD9?EfUmqE`f$BI
zI55PxgAV113*X713s21y&AjAXCpP1WpW>9Qz{t4E42<79;w4PIN`=E*Ws(kyX|8z?
z$j4Z|Ulg1=$-~jsEr}Rwd41tuyBXqZS!2w%xuu(DGK1oC0%R9umdMq%K#%q-qIysA
zky8K~%{t%@af|T2g0{sZS5k7IF|lXrNZ@a2BkEcc6!>$jEnetOgkybd#`<gFXtRsS
zVD!!&R*OlvnN7W7C%rX^t>KP5SqWXWM}v%_h6E&r0J<~+(5{17@UFEtEwh``24!g(
zO2!ss#(4pdB`;*W9eKbLwYJ$eqi!8<&B3EV+!Dm0Y)v8t-SJF}JQOyoXmE-|$TnTU
zxqFl$6ajU0P<DyJ%c@(c!gca87rsxahVbk3UFSofgMHrHG6>qQ6&`6?8*C8^*5dgn
zrt`L-*qmE+YrOls#h5^d@0-zqNh>Aiy5bP89j{p7Mx+XN797DEH&o4EmJ=bt$_5p3
zNWFJvXbxf&4-ru)H_mGPjpNUW_uVqY8PWM_8Uj=+X4xbIk$}th@&iZFgm;Q(2k4af
zo;EZz7bY7eDog0Vk)lz<4Uz7PXf8ut(+CHn9GhzhPd)8=CvePsXMPjd<Ailrw+!{G
z-J>$IZLXPc9MK{3T)+olqg2W3=4WY3%uwV=%8;C-R!F2nNV!xDLgE1{{Ha6(Rs=yU
zIE5BcN!YH`>?SNYl0caSFzOa)4IYI`*pFX8k|jVbqTTl~%ri_gKIGdNEhsoEj~oX>
z_Ehwgs5iiFYY1o;AEUJJypvYY5Qs$n6xdOzi%YmDd3ii#1CRT|_IVc2B>%mk3yZG!
z=>&~dHMJ(0aiyc-H6k)npIs7ePx|e_FcaC1qW7>Pd+Ti|#bbyfeRcyWd$;t;cLJE=
z`x_V4ax0q=sw7lef{u)yQwF#Q`j)bRO^u;b3o8_|H0Dlpm8g7(S9!J0dqhM6rI=L0
z@e3<yD9yDs7Bw(Z_i{sb`yr)k%2#7;t9cjk-n8?IFovvkB}GJ=FD;G@As3b$HooRF
zNuI_kBNX`=h0&%aRu46EDC`nLIx;L&JBC3<y{#wveH=kt&0ERQrg{^(d`p0ypn*rY
zJOj1it0feIF=_=zJW4QZ%(cuCZy0J!T-tbMdE38DuZBn2#G+$E-d$QH<#R9qHStS~
za#(LwsD+glyn~&_N$f?&b5y8#8tQUfrT9=-Eg&TVVhpD*k$(-B<{-MFIb<;rY79sU
zyd&}|f9<nVNdSo)^cm?jQzJRe8FCu2qSE_TMU-E4Ga^?V0An+wu$_;JGgP!Z3Q-EL
z0k22#Iy0e(%j(HiDGx1Co*k71N1&9>rfLurfS*|pRj(JpH%*CG(IimkdV*q@iRRH%
zbvSM^!CRxEbfHXLb74CukC!Fxrbg{ftQ=Yf<6H<DP_%YAHmY=jqZJJ-(@DqIb7!@l
zz`_DrL_KVKn5A^Cs`0pRQd<VmjR07vTfsV^o->dT_-(UMk7RHq=RRk)8*CS10IHz6
zl6l)?gdA=vvNW`!*jQODp7ltDAA|->ux|X1t_>)+w$1i}TL`c6W7E8yPW9Dv>Zln>
z6&W0?yP=z3j92Wvt`9ejY7+_W&V|oMhqR`U$z*{T;yF6m=fwN^8<a^ihXP@x(9o7f
zPg)rGle24aat)$othpjh3we*nNx{3Il_2lCXTPaFNqwVa(Q0k=PH8%_lya6W9;;dl
zymw#7?j^DWbH*dELe>g16r)l9UJhaRQPG1~`B=5aqQ)E^T_0h-EjIOz&FqQ*gzePl
zzy}nt@ZnODM)#zywOB0bR(#%4>q7G&gM~IGk=A$z`@MUM6)s%gXmv~0_M<V6hapFc
zTfU%nH9yDR6r;PAZhL`sX>g_U#x7!8Dt4_w0RDH17H=|qoM-QNgT-TDghfG4$*c<R
ziD^-W3WLuG0F62z8}~Yc_7IRwH$k0fe5n)$051)mw1{Qh=i`_~?czK}Ss163VwD2C
zG6%ER2vGryqg3d&#CG_2oNT%Mv<qt(`3<GNDPUhXy5KUQn@1Z)FO29m$=iUIX>l9`
zLQ&P^xD>6CWw5;qIQV7&(Ef1D@9D68xD;Y|W@aL)p?DMMW}hbwU10U~G#Q5Ha~E85
zFpDb8=aYU{3$OAy6Tkm%&b;ZyDw}uy{wkk*beH`@CNHR0@<V$Ja^tLxu75T<LtD(2
zTtVi337kiMDR3x3O~Nk{?HmE_@4ZQiLV&i~J_#%m^7zHcHHndVJ6I;3|Lrf<TalX4
z%J}*h&E-XH2!3%~a|CF=ctt)BjlTXuCSRTb{3Y2gq9`RUjI&WxwQI=niN|9*OU`D4
zp{U5t+Q692CV<U*8QzpxI+?O>!3Y*rFLzG?YIsik+%P4yUqlIdgir^hu?ZLoVXnF;
z3pyK&P$DTEt1urfipyXfe}Pue?4_=&7VIvX(NqSjzf>QX#VZ-+B@PqQ3|?ByroWBI
zYhX#A(+Qahi_n3<5QjZbIl$ZL@_Mq9ywx}A#-ZYS=epwoXo^Y(0vWb1MHqr-tMxa6
zdy@)2+Q7+7e{xT&<QL$Ki*aJHWH3ApMcQ70EeZvjS0w&IF{B)TJ}_B@qqzr85RZ}y
z?`G8ziO89`8##9%B^Ytp7T>hV;Wqo>U+VD9F30<<RFB_l2bxrnbiD<;9Vt-!wOFWE
zb4Kv$MoLn=*ahMjPr*=`c6ROb=+uFf3(+5A5z%g-M=CoCcG0)Awby*|`dRhvU8dm(
zP(H~aOnNRR06!WV_d!O}PDI9!K79_g2aAFs_y6euDCWd}NZZ}v;Oq+ofS4cu;j6E|
zYHY;uAL?I!`$znT-{WKBKj?<nu9Eut*BAieD+~bf?+@tz7z3vM?W6iP`2Y}m*Q53&
zP$p2Dlxo-#V0y%P2ebA9(IEI@!NkDi0ZqPZQ*yn>iz62xLPkm*ydDicB-wQ~?OlqO
zbbHF)(cNLcGpZG|fYtWellRbn<z>5*9GxUTRIwnbYVu|O0?03YpVcH}L^hpq*Cf8x
zzBxWX5DtJ=vn)h_j}gF=iGl<i>_537MnHS^f!bdRi^(&*trH3SO=HERB0fS7Onq0j
zYrq<0+xe@br+4mPV_2)TL~Ug~z}#)L|GRZ_M^8_hukI{iL;m^xlUK*hr~5zLS;EB0
z@bgi!<X_VWWGJ>y>*>z^!JQ@SUgk)Q6a`Pr*av&q!WE^wc4i#S<723P=T6-|!N@^(
z?lgS2K%I{#>3MemtXcKWok|6@sMU>XoUCcsnvE0)sSMmKgEP1YY^fC)N^uw>j2H>L
zM|*nVt6{m_rz)$1>e+RUpL4y14M9naXH;<i9l-yOUNsM^U&I|IumO-WJGkMPVwAV8
zhP$OxNyOl!-|leGlGFTiYV@i-7z%fs91KR7uJL3xIy!+r=@38-gLNM7|4>VwPI|p3
zCwn!D;nJJp*JNk^hvcjEMlE^%>h%vvz0Sv%9OI$QYrr(HczlEjhxCW-t8{{=e9Dnm
zu(5W=8pqj?XEkhJqrnZ@1dnlwBMuegPQv=<I|&6V9E2R9B_iap2rzOo_aTLvt}t}Q
zrb-J#D7EF92FkHJ#3NY2m$l^h^kA=bc=Q*?GE*5<RbtZ^lS?GJ(0q5u(vLvB0d;}_
ze&$(l@hE*87_+q!JgRnwP_{x1@BxxU#kU@PpT_>+lg(-px;!vQO40E>_`+v*;gf4_
zzhst?>h2#1@DaGb=Z@vJoKbu@kDzlF>he5<5s~*GSe(uJeYB-(z1lgYsGOu^Vu%@@
z;rG4293AgD13`&`fz@0r5-eRcMWNWU-t;BWEKh-TJ8WO}b}9%tHR{h>2^tOl23iZy
zH|`34Rfc$|0LFlunN+yu^3Ojnvxb8pQT1R4EiXEpjnpa(l?>r9mSQ>73iYx4^TzU~
zZ|fZMMzOhP3xkX*kdw~~!e8@;=I-A9F;B<45w|!W7!_?e`v6j^JAd3v#BSaX*zOn}
zD!#i5HjGmK(o0(41Hi^jK6IOQJA0F#>Wx3Y(bauQafn~`vaEd$+wk=0_~p)N>t*xg
zWanA4wg2q!=otPSo-~h7Pm<q~=>5~<qnE9dA5Tu3FEs)&ZzK(bLRoX4H47TONtL6+
z_(bjzzK~M78$qeQFSf*Vq)huy-JeHG(lsOQg;74<g$GQCS1Qk8x~DsbyUpsCxB*;i
z3Eu(-P*b|vsR$`ka09rl2BPYpjqw4RUQN=@PPaP&IEfah^cE<Y!9Nu1|9G(X4?z2e
zjK7ubNggOC6o%pZ$6@u$cIRR(ebBugb{Vt7^5JMG?O_+iYHwT1$yu+Du6w&)a}6A(
za29+MSjGUk1z<0fcexFwu}}nsT5upY3m*3YtK##+6QD!iHM;}GM;V^bO^>ipkx@{r
zav$Dd&JHdi->^;jib2NI79_+T{;fGF(dg0%x(#qF`@@qXQc>VFuzv}7@R&fAqIUz-
zhRSC5K(xQP%KIbZNP<tJh(Aj>2Nm|W0o9FwI$GMC)8Y=?aB(9lHW)Am_kNPXwXyr^
zHN{Gs+Ztp1xIL8Yb4>dAL+Nw?1;mxbrmjsd6P(}t5de!ao5;Ephea~iG@)9V?ov*%
zb2Dx~Jb67r$l|NM0=v!M7<s|l!-M_97cY<YULQ1DN3Txzj}BYM&6DP7>tN@vKf>3i
z&EqB@yOYnp3UUhpROI<)(TflOMVmB5>hnF>&z@nJxCt8gcR14cY)S@m<PX!CwAnj|
zty4KUs=A=|EB9K6M_QtLssz!Q@Ei>(j?a+pS1d_zDy1VWs~U8R+5_$1PIk$^D&BE8
zYxqN$pZhRxcV$q;t^69C%m|#EO{i=eO1r2dv!~EpE#ao&d2Tmf9q)g?bJ|S8&^YE(
zROz^R`ug~=1>c&-$4AF%F?F)n1JsgUM}w{CjCf8o#<Gjh%f-{Ku3jM$^EisIj=e>B
z<-af?aCmZZeR-A+fyT~wiPQAmY|Ib$N5u!o-u_h2ncL2x+Nc)^oO1$ST%epK-(VS(
z;iHH^IXn^C<fzYs#gSCM7@+|K=x5OsSoLXpI6P~2-sOd$pFuV-nZS3u3i=8pf9*3m
zyGD|@ckuG$*&R6ERtAkyNZg1Xq2BJM*yLQNGZIOoLH-nGLA1`&Z7?uP1d((t4}0`^
zn3a3L-*Y1?6`(j;iGTRXGAqDe;mwyD>F2??29J%_A2&erO58@)wK66irTFCkDf?3f
zN8Aar8EZQ-4mfg-LUzE6^l|gq{>ka_kCemO*(4)SI`U^E$uB0V7bRx{Y>f4~%$K{c
za;%9)@#M%?Ns=-1W&*e?Rc7sHS#Q#9PutRnmkl^id~77Sh8tSliqnxZ^rrczW2~&{
z){43r_1@clRA@pg%;nU=XGN-ePjnVX^rp_6ix#;h%7G;#ddQ+eYYp@A7Q5stID?#^
zscilZhFE;;xLHQ8t=4%bnYPap80tmZ#Vn7*VWxY%oF#89npyUI4%wzqi0Z)^2bV>f
zItqYz-kDw&aWe|;xve>95v<L0YwEeRMOb4rX9rdhy+)#fU+)xf*`9dVZD&DF!_t^J
zRy%XUK`cQ(GAYg<W6m|sDiA?%5xv2E1?+!*VS8b--bf5f3+eb=9LBs1f)Ootiv3u!
zAe1wNe1j;c;=aig!-0!Epa97oeSw|zL)ydn@UrY8Xd!1{CJRMZ;C!wb*O4vg1jzj9
zV_abi4@QG&Nnt*E6hj31@_U5?)%`*v#=+F>8W*I9B8tU`E04`e>cPx4{(CQ8MuQNk
zolOzOU9v=xB3q6UO4msGpJ?p~MH~FV&QgUK%Fo)(fdLI2&>gjtJi-8tgP2o!7|aHG
zt%c)cMHgEdo6Y@vx^H>X``c_V=`9<R_s^sEEW}~VGLH0Y0R|ax6#a;7bN`?z$@fVA
zq;CP6O_tRBneEe9Lp@N(v`C;A9tkcBoV?<%K5NbTmPDzSiePB-dmpCgRXoIFvJi=3
zpANAfG5(SR1@sJwvvy9OpEO@p3H&vHS@v!)_6qsT&(PIHF@H56u7Z$QI#Q+3Sowgu
z2R>y%*T#{J{KmW`fa`Z?6lTyCjbas>9Ey@KkZuh<_;Yu|WKGbq^UkJqw0Fs{bop^)
zw9#{xoq(i_WiI*zd*%T!-b$PnzEzy2`V;}m^(7`9_V$lyB|UA}AM}P@r7W6<-|rtE
z9TH&yYeL;&S&v#{<&0uL-S09Lk%n^}1I_}}unxpf6?jxlLE9E3&64f4NO+=$ixEw`
z)0vS<Twy>!SB8_s2f|&q<T7bl>Y}60$WDL7D_g3mLU3)p+&O;1tG|%0ipCp)n+kFm
z8959iWOo<ckO|m&A22f=Vp_Nsw0Pin%h#+<D!hT(Q*MQ37~Lb5eEoU!^K_JQS(P!=
zT%!xkv9KS>B+b{ZMB3{L4*<w>oMzboadCJ7x<HZzh{Z$)&WSY194se*uNCgT)8kl0
zC)dVyP!=dQVn*gdVRM2-N|qks+9C0uJN7XMAq4rGqyWIGc{-M+)Iw3h4dju9>KG%<
zC7a9vPz+}<3qr0Z+<n>Tf~#xtaVAy$Hj&9Pn(gBW@OT_YLqwPK=68isPcr=Ib_NB4
zn=<HBXswK8p#9l!cpX8BU6;#uNL<il=0FR8KrvF*%JFg&x8iO&sV*1Y{xd`yZZWZF
zHIX9Z^95BUi>Dh~gq2)_4&{^4TQy%NKH{&Ao-PrKs>K`*E<e)C*zGd<EX;<};Fk2$
zF9z7%8^N_?{cZ%;BA71*-OiVXU9-d<ezZ%klnxmRf8^cL|3jhNZo?!^r=PkNpNvrg
z;>8~ZUW4WJ<$wWm6h;}*jMrYOK0XDc9XC6s&_l9vC2&!ArQa4zXe?2X`o+MaQp|4_
zfQP_`aU-Ov_qLQ*ua<$0oL-DlPgmK^SAPDI8;l}4pp2fCQHMlAxLRJV9<JEOyCwXN
z0p9VXmzQSe!S_aRyqOYSlCC@yh&0s8{_535$X?e@K>JcFONC=utH-#bPzvi-@4JPF
zIA}bHhV;|&pR(mQOQyFu>?WPf9!4SS4O{Fr<Sm!^vDhppE7kk1WHl$+5k~&Ax6nqi
zC3&fn5!3RJgt58jG7b)hwD9U-*zmX`hJ!%Xs<O)FUh!r%3ifK6Y91urFBddsFlEvC
zcb4EUl#(N^(N(NkiG7-mO)!^;SjD&KQ0bz+%%xrfZY4aV0xD#sDIwkEmT_k_aMGev
zIhbxr_8JaCYpkgG{AT5=9-TfZ|JkR{wKMPZ&F46k1Iclo61@;sEQkzB^i%siOmM&i
z6h*={5thV7C4zw9gct8_9xpp2@Tid6@EAFF&o!!sgA3(?5qpQ)1CiV7;lfA8rO;2o
zihv!a!u(JJ@#Etu7+%!`O_%AFP%~KAIr?#LA)~}35w9%+Gqe(H;djBgDPlx*i+fSf
z4pS@8MSTn)==@?D=%DoY8Z4DZ92Q&sgpV-hrB)3ooOp}mq-GiO*yu1YIiFD?nyI_R
zT?+;KIGK%fxozn=x<7T3<pmC|p2cV9cE@BsTnw?!MUsGJ4H#)wvW(7Lm^MZi)Zpp5
ziQqAv%xE<&lT)Oz(>fftlLBCIVqQ1FPg)-8zL+HXY%`3{7sT`Oela<GlH{!E`@PXs
z5qW@5_AomwfVl+=ik$%XUV!_4ds0<fcXMtLACLMeA=3U*Sj-`3JR^8f#yT$1s$`uQ
z!OgjXc%kU#K{)JiQaKVAwaE}f+X^qDSRt&i1B((pHJB(Cdv#Mx6oc+@MR8H1pyV#d
zb3^h<jB@u`Ffe<YaW|M9MrTtkKQD@AEw0Jorj2~m3C&MS8oW=D%yiRf@e<byaWh`o
zORbkn!Eo1GFOipvkZOpQbpYj!9`3ws@_xgZjNgS5;t($^S6RwtP8bZ7iVsHGzn7`v
zA)uy|HRX1tJ!fkHPhB_-#E7j|JG(D-o;4B8DXqtXFT8MrZY~ESAS7uJ=s;gB<+|M*
za0qJ)EQX9>sX)d#Y{?LAU=zHkY(A$Tx7?PqkHNE3CDB^q<2|MQh;R5ZOagaqz{4FM
zMg8*TP44~;=v`+qQ^@&+{EuoGlo1H;GSO9@57V>ukW;Xe`V(~u#sr5gUrF&m7Hz0^
zs76%ZK?@1Hz*^<m!O@eQgA-XB2Nrd&f)S+Zqdi$Nmo^kOxj!6qrgQ>we2ayx@^hVs
zyW*Y5?ZOrXYcwDr{7x8Mi{C4Ibb;hoLI+&f?Ly#LtA}Xd20JV6VnntF8dNNzp>srO
zU|h9nsv4rUz^Y0RY>dY~&Ow~+UJ{HZmyTa)i~(XL3x!rWSr2m=l-&4orYSTXUl36g
zZnuE30araR$!4f_FE{w4JO~n5_-NkqNInZ#QHQ1L6`zVZNU=qz$lX2Db$J3n*?LxF
z;`9Y*!lXU>Fc=O{mP{IliU#wXpfeqi#8vChzVrGAR9f7*v-ER)Denu3lJU99Hkd9W
zgus_%bhWUeJh<9>{ZhLifCz+6X}VZ(?QIaR29tC|%#-579KT>ZaiLq!Fo^R-&K!&I
zFh|c_+T2{ijKWKsvV8E9Vhv$hOnHRwwJEP)u)27!^<nD;V=H05-?WOhn)V%-U3juK
z>`w~I{Jpp%P#4J|2m%_E!MlToA}=Evz;W+98NX{Gd71r$s2P{`*CnwK147=Li+!xo
zE5;}MhQIR*cB#aFfx6r*?F?$goe3#l^K^-HCBjU8BR>}G%o;<pkP17*s-djAW)!~e
z`)(~z=SWA`4QwOYaP7R>Pb4f51=3I&uf*YXAf%x|hKO+!wbOKW*#R2b&a;!%qY`jR
zXfrww<(+r9vLC@)8SrvMh#dq*mlUmpd&e8K<^Tm+i-S?@9=!zc*5cKq>~2=TDjaW~
zy0PWO1bjZDAqb&J?isIvz(u?U@m(gi&QjVrj4M=ayrFbG%2|;;6^rl4-WR}ZP1Y%t
z()#2q+S1^S5^#kKVzA}Dj>Qx0_n8%ou7+1;4l=wHm_=QZ<$ELqmS3P1Nil_3ihz<7
zcpg6*Go8KW)1B7`r_v<yLedykDQKx<n%ebk?M97-ZFNjz_-2ZhZ%EP(&J&bEOfF4^
z_W}{LH{3!M&QgG|g9l`FM30J5zVV~?6^+qB;j;5U-H|l&VybT09LF5-U&a}!m2LS(
zcZ+%yEa<yL1SB1nw-+ey7N*8R<iZ$SZ-c5a*F?)?&OyNZQ*=B7y1LK|csY;V;PU%t
z$K(3FKXc;0NwBJabo{rCZ#KUACXWAxfBuO7_B(uR{5Re3+Evn6|MPl%y^i7EzI{+{
zJZOB2;omkIj~ZX+!@o&<T|P#YcRhe2%HJh{=Ea4ji<C9cPt^tD!Nrl(T+}odG>xA{
zLDP1Rj+-|`O}p$}Mj_KUq;K>P3B_LS84m;f1zmcjlU8v~N|N#R-uv8h&vx0(Hd(>!
zG#Cn#n0IPZ5YY52(5WMv^b8Q}+V**e#)JIQv)z;IJ+3fSw5}?u6(sj{8B}*hJM(PU
z=Y}Q>DI+LMIx3^CnGq8boud2CeI5|>KHa<<=8ltknmUeq;Oueg<weMsI*y2&!Q<%}
z2WAb38b1OwSHdFFCQ~zFb?g$txNOyu_e9*NG7|{hw@9Y!Tgez#_hKD?nJk|4(p3s#
zuM$t&NgLCwf|)*aBk@D8>$s@EpHwc~Qp&YeoO=YpM$&&!C~ORwfAJ>=I$QbHs@k6!
zJ4?%GbuKhdAcvQ?Vc<;>oVsg=YJUhqyeAA9VHPjh0RARfEj75dzz9F*;b;O-t>*_B
z@R_a&csVSH<Q=$yO(pzJ3)rfK4f?|klniv*>ohAnh$vfKttZ<_1;a*R8v0Wp;)Sx8
z`qeNtl*yPjP1Cc%xe!QG%|usm{noe`r<ud$#m=fLwzbu`FKKISdzxLX4|^DYYG@zH
zDqq-VC`?kR`)&))%(O>nC1{Hh)|k{0_8o>xm|Rg46s8zZXlHy~nP#iN&(MYpgHcn%
zl?rcImC9ACKMmh#^eI-?j>s5hgMqUMw_KQmq;M6CS>WEGg^K|0@wBl$yY%2nK^>P+
zFmqr#a!DL1h_O7;sN=&K9?XXgGZYFKt?>SMOGA-AXgC<qyFt$meqT}j8-NG!nCbg&
z<THujNFnYOPN<>V9*y|UNpWI1JXR1;edu^H9hWo-6#1CKDQ$0mU0qd;O<$vYp`1KL
z$H>t+>Yhf+Qx5mcMk*PNF$)?T*4+&<tZxm0!>w;`VK4Y?jlPM^m1NZP7Y75!Me<(&
zW*3hi!+0te+uM!mYB(Y6lOXgbXb{6-yAD%~E9Rh$j?GUBYvwua^BYBzN$NOn{{&#k
zV`06w3~oV7i}riDFjC|78JuE(bOfgg9<9r9g|<?&5oA@|6?Sv<@xY0prA{u}*J$q0
z?X|le(_;^V44=_iuO%teh4mPn_ZS1D?iMj{XVJgUMu31vA`Uw0wM5;tay}og(JI6P
zEIAv;5UbGS5;O>TBz0$c05eXt9%Ef9R*Ge33e(bB4#j5Zl@_$b_13m$^AM$Kf+X3V
zsDNm(xvEE>uTPrCdpoB)zF9`ondzq>Un##qn~SZarxGZ=zkyufwIo`m((Ypz1Ij=&
zy+FNJ)ec3lB1172;xe4`4O=dLW02y^^31c%|BGDl|DDeq{=a+nWx~JT!2dTMe*N`V
zG5^1@@%114|L^g!{J(5Cg@3Pad}ZRl|M|hjS4sWPkG|e`RR42c0I=_(Hj`x)+Eu}8
zy!N|fDz@`#{}Y)0?jVh$r_YV3?qmZrk1rli-73txXQ;E#Xf0)SayfZtK7vT8uLbwu
zuZp>f`S$4ASlTS6i#HJqoNIWfdY|hH0^`eW7#}5?SNCNx9cXwlZ+mi1gD2`3$s5ga
zhqi$J0T~&fwPqo+w}f`EshWZGK8%6d?R5jak@zGu0x`5PIxV&$SY&tR*hm&_jB2{X
zh_HTR7xT?9BcqH)&M2d3{%Wq7*>Ny!sgO}%MJc71ss($nq#`G#E(0BY+E300S3v);
zjBTlW#%j0#JCNn<C4&GW;m@n^w0YZrt5Uthpukj9dLG=+Gww^&qhvL@RhOm@w1Oil
ztVn*i0!PFrXct>FDjgnYEa$URd3!D(j%{((^4XZsTyrC+DFN!@HJYNrlWcs|-ZUJs
z{Z)_5O}s@Y&g6g&cfHiMH3*kt%o-jBQ*b3dZ~?SRvPUgv<&d{<@JAW-feV>CV}`TI
zx%T1a%Z4s~weREBVJW)|Y7Q(`B=FP2E0kYFrCEPCI+-m6XVqmHlwyA4EvgsmYgmN}
z3{s+g8R+DiY;x_{$fBEI*t_ZtHJA2;4s{&WAj)DExrA61bU0w`&U(jfllQZ%jck0d
zQbn;Z3ZRC2+Kj;hprRf_e{@dhE^<hZ+QFSr%Mi5wr6mck7rXdu)LwVfkY&EHAKdW)
zCPRet#Z~>)l{c32C|o>uU2n@L%WjPoi_+p|>1@(L)0p;ToxjTpg{3ai$+QJTzZBG;
zVOcU6Si<ypVyeKU&4a@7z>nwagb$0x^!}nf<-+*QZC~N+hs(0oLC>ApWCFJk_QMUC
z2jwd{D{N~t8)w`Iek-p%D%l6bJyPGB%;rk?IqR?a^FGkA#<*F*eyQETaNjs%<Hnb3
zr+;HRco?GVI|yjvHR#w(0fHT-opzyl>8&wpjFMxA)%a|B#OR48RI=o7BAFH#tQSWS
zE5#Ifgvm=~f<EX9&^Yd+Sh8?1;t)vjXWf-qddn@~H&}eH%7hvP6hU+$*y8mZUEt}|
zf86%|&)CWwNskpC7LeKD^MX4lzh%<Eg77h)YXBy8HfE2$0)p~f<GmN28Pr$@J{;0<
zBU*vj3>*U=V3_HMXbCLQkOT<BM+nz2O)(4TZX%=3yaa(2)qI4|P2)Q~NK#aWFsdex
zbP3}(_AC{Iu_)Y)z+J|K@T)-2t07;AqgpNH4h#1o$R+7FO9}MCvo)uo99TZI;|ts0
zkoF6L?!0LJ*m{0+^a3?>7t5Ow;eU~)@A^g5J|EK+^x?z76a@3(@7MsPZxG{JG}`U3
zb?_1obx8<|B{F=Qjqny+nzo&f>(WQNSve<P7xF+S;tf5?2fSSVQrhG}K@)3@2*h)q
z)*%k{K;>6}i1YSjZJPqzt6e5Gi4P5hl59JsypY?Bic3R;$%}BfF*68gR$TZKqB*QD
zy1D{33S9vy1#SCX@3Nh}3!^n=_=s^0ZKJ;fsI1B1E;NW#SneR*L}h+sxzEd;lNY-?
ztQ;vQKPf7I+&nEQJ}fGJuz%Rp@-$jZ16(kQqt}P0=2YSP&`zGFJ{$QZ(Fxb=vKT{e
zyAV|4elX{1LKS`*tge#Myt7<V7$zK-os^Zu*~W#3R9K!l{k)%QmYXXbv~vt;oW7eU
znEcY`wA>rdpSaMIs+fg}38w{zc%zVlY^uwLUqUtED$XIAY6?UMoVrra$s-jI&*CJN
z5hSFeUOEvUw>)bek}<kg6s%cI&fPiYQSn!@XFz~S`+dT7nU^3N+A@bJN<2oH(s8RB
zksU&+<w=jk4N1i-hH`qSn9R+Gt~ECyJ-muC7=0;$Y$4v5JQv>_A)Qwsp9moa#ahnb
z8m(3cDhdpltxGADiA<gapooOTIR@Zk`Y;<*>Ji8!%nk5)3n`dO!1whVr8PYOXjioU
zX88!zX$(OzErMW8Z^bGDEhzLiZEjTqL$C`SKFfKN*^o0q$z1-t0vNa%3W`XG#Cab3
zoi1|Wnz!G@c~<-#RN<|sq<sN68VbTJDS-&Ct0f;F7C{9o^a@~t>}obQU0_#}qp$Jx
zh8WTG$FpfxLA4q;w4Gp*lqp6`Gn7ytS-nbGvOQD`j^f}FWWa}}Gg=G%C#FA-maK9k
z2}u7a;w4wab#WbY_+r=b(pH6M-$^eo+oNt38aD%=6;{G&ga2<NtvvMtab~mtZjmSf
zVDRc=0ixar;e@ElSzGC5hlfAf)XUB9n+GTLJN3pL#0Y4<2Fxzn%Jv5n2{52fIM})I
zJLSraJN1pYa@K<-?-tjNfQa(}6-JgPe>r5r6;05XsL?GII%QLiBt|LX+>GC@udj=T
z$`=tj6p7v&{<<VV!PXpMdl2(Ij#uOr7}}0gihP&Ufur59viJ=(@}jVp>H9c(zX`%3
zF%_UKoLecXGuX|LR^b(Fcy?KM69}IZzS$I?0qbG=`gv3y<x7I;PuiUxW)ynFCB?8i
zFZIFISX~X37&LiWrfmgnya^oK1U7Rn0QyCHl)M#SUgl@iNcLT5L{}hsqCrSiE9iII
zxwgj3g`N<}dFockF=)SrNF%piKTiRcmyDq(pqpzMpKt1>bqa^*gSb-^k$hu`F0bOD
zkBX1X3Ea?^h+YSySue&+MU%0~TdcBV>0~sNAVA@58YXagRIHU?o_RfBne!ZT&{X$P
zu_8c%=Nq{@(hwX&KTNhm;-T;CvK4hi-jRAjeZY)R`X4}o_D_9d{QgVn8twEJ>W}OJ
zI~TLjyCrv%xbqz}y}OJS7Qv(Ga&<09Cf_MEnv9%eb}<-oAi4m+7hjymu)TlkZkL43
zlaJl}5|xt&Kp#*p#E5H&B73EsZZ0_|6z5Pq)yde%xTzC~0AQxHk~pc0;RnBvAN~~)
zoHavr`&W2c+$;RyUy;Pvy`x|Lr5Y!>_xivWaV9UWjC<k>i3HIVk>AeE-%KkDrj^-g
zWx=$vVC-2q_AEEBEI+U;8dw$&%v~w`UMP-|umC0g`lYn)u*e5~?}_t(Cz!}X&_CPO
zujn(+{u8Iae)0Kz+~EJ&*!b$}oc(A05C6~K<rCO{@`jW9=flO_KX+W*8b#}(#bJut
z8;5e#j>RlN|8>x(RFFKV)`hX|lm~YU{WU$CGwvMshLthg7~|?4@~x|ohYLJH98cbR
zn2(eKGgN&&M5XYz(yu|mJC#bM4+ZfFB3~rWg9ks2J8zI&Hw~b_l;x_Sk%P5u_W(Tw
z*0#^uS<gMHG7j2rp*$;5*V1QXH9047#_9JQx--31W}Db1Nl22S{`rP19Kp%--99jT
zb@#1N(nfnSm=>kqjwb<4-EJ0f{cr$+$Dg&*32@N=i2mnx@8>_6jc(3;atUw=B!5X0
zRR1!IucE@~lBkqZfpZV9CMg`&mGN{=dA#k?aZ=fb3X>UAW@xjh!Bqa)Na~NzKkPH_
z{!hPz^T)s3bpJp6dZYd@y8pj<*!biA|6M-8{hvzghlhU_-w(L@H|h`Se@^h~|MpRR
zqbT?TN^mfW+OEWW00c6dkXZ0w*1o;pM{oMe<@ggFKhoO=gb<=9@cMv-2p=F}6FoYQ
zA1oMIA{`@k&Z4K|_9W{~ZWV;WJfzbbKZ{2*8+B*6u))KtxYXYVskpm*ewgYe-dk&v
zUI+6K80zq|vqn1SNOFh-Kts3V<QJHp2=7U-#h^&cJ-!F15;K+D;}wn2Dq_k(3!Xwt
z3B>`pN-<CPu;)_aKsl3|fG%4!ecUu*LH3X%rS|{?MW$Hr4l648ln%SobS!o>?+4S)
zMN*L>PNM=8BZrbYK7QGJ`N+wRpr?#j-v(Kda#JMKV83xM$AM~C`Q(|8A;F>ljSR(h
z1ONY&ZX{hB><@pT_%E1caKUa*emp$g`QcIS`SI(+U^uX}SvVLVtT8d`np2mC*&~3g
z5z(K`-<lf@{wFPMNz*wyFWP9J^f9PdizKhD;ove3jqU9r#P;R@J<F*u3Srk0{Y}Du
z`A$lewWRsO>G4kM<aB5Eg^S=y-V+>1pw$_mz#A#Lmpeb8*~p2;L19_tdyIuUq8uRo
zVfx-@J3$K+ifzEo(iCw78in@Olrw?GjbM~Z!wMvi;||4=FL?{tC0)*UmhfS~%tynt
zv%4?C64OM^JVIAi1lmQ1hYukyE{}Z6jC_-y;xB&Q8SpPT-A`Mb-SwcR#WbS^KK2Tw
zvBapr$8e$fyeYxq#%6dtra2zLXqS_IyTS2qd5bIZUbNeFmKEioN%YK68oCp^g$@5C
zo&3k;*m;qE4DiqNVv@d}gL#ZQj&DnGjd?^s3A01Tbgs#OLA!YR{P^fEvXHI~tK;(R
zxmF0~&aS6Dhu}P<v2XggJsNbp+Q!2I_7qm)!-eU}@vVDk+Hp@A&-6aPsy2VvKcx)I
zuaBDs0EH>qLw!B4ZDZh^$loJg#aFZw{hH(=pLMHc7t8P$g1KMT-Rw8yfr|;gW!Ekj
zz{KNEO;!``{C)0$H{<w6Qfdx=VNSNP(yx+L01L^hdAKp-P%Sb?Nd%-<)VEqs>wLaQ
zIt+X4J1Jo2PVvEa(vD%5-t(d((YcS#TPu9<eaMs9c+=wXin|+p1FH__Vo|bSn2mWy
zkR>LG@@4{$T*OU!Ju`uqSZ{*yJ!V%>8K4eBI8?$1H}o0fucSj6AP95e4<8T<F_}z9
zzm~Vn#RUyk-1nO*2%4$5@8uOf2AH;Ta6=Cvf|5I-6v+qC)8frfwt|63{_tTKdy1~C
zReO=D8v4uJ#zPD)BGd5k)3jnOXrkuEr;x1Y(f6|D%Gg&tI6t6O6Isii7omfA-AfjG
zcmKwf_6G_YE4W!pCoN@o+DxFBU~<~5o3)TIL7*_b%N;pFLl7VeZ+EzxThZtQ)}-Mz
zCD{BToWqS+4sQNJ9Lec(JEOUuXJ~&#TQ$g%-YA`&Us!{(5T?m~dL?K^Z7#|y1n{s*
zE)0e=@_U0*i8nL2(Mw50a*Yu(O$-Q>KF^bHo{~^47jp%%ZCswn<C*gy%mqJZWd1()
zLQ`WSqGMZf^o86;tE-GCqs>NAD{sFjBoLB#{FQ6~9F=Y@4n<}kSQ_5HA5d<JmdDdc
zchK**n622N7=m_7k+s{5N_GaV;=+R1jY)*HOd@SKjUNdz{Og`tONcF+m|u6P!B*{P
z)_e-o51Nn5szdbwpC>ivRn7h;+RU&f)CNs%pQRiKI-j7;w{<gn!CS@Vzq$lyu)cpt
zs8+eS5fb2-1ZQwLyA-oBIwI1$UpC%2=GbgYel<Pr*DB_;6S9@DMKpTow?sw{Y)Ly9
zWrHr-hQ#Ka5m{PUA(#=vGqb-zDKo@-0jw1cs=k?@zYuY5K^f9~{o+zuB;dtZIMMF@
zGJ}o0YERme^IUWWRWR^*YIl%#ih|k`e(euFP<4vAIhtLLp}9+9h9nZ$#k759LSk{>
z2rihR;6tzL=%r2R1=vw-braBlbbVK(1EaxEY_Dm`Ktz?sqyK*Ac<1<8RZcn#Z;;7s
zlluw3Y#lb6dnZ^5m~073*PgC(_;$Fa*0Sj}OoD3#y!Hs5!L($^Yi7t~kVf`}D8u3e
zcA7jevw$S<P&}~bJ2Wf@J-d9Kp6yzYiVxWsBY=GfZ>A)X9f0!BQKUoea98Mz=yFa<
zP<$9b5D-6#1PgT}j;ltDk0(cwy9=68xlThvvph#$8y1PYsGukZtT&P#THe(}5sC@)
zK10Q`2~<B?)?Tnlh7IjOLfml=MIx=yQWbh7godNRUaN9mT*d)PQ+Cy3XiW&dQBHu7
z5jkvJ6#kXVZTYz{j7WxNvc=^hE~6w>^MVbirG<mm0h+jaSTWcm2Ze^c2xMw{Y~=K<
z>I&PVW#348rgpb08|xOp8>!;@n$ApgB-a@g$)UnQCSeODMje%^#-soXd2;w`I=Mzh
z=JaK;5*y!Hw^-#hrk8vcPRTax^6XlqJ?vX?`m#m7S{_vqzv(Y{EH;Vncj`+?ihI+k
z@gbaE`nZNh_3wLRpGm3>>wJVk@bS(e!8F}K-sHMHP2OUqWwY^P12bcwzQ~6N5W!kC
z-1jkJ2Tj`6nY7p{j*u^NhVjio6V>bxD%PO;5v`UbERZt=cPBjaGsDCrLUo*D6sn7~
zD>j!T1##AboY+&6I9iDW`$Lg;tEzus>_BFqJ>SoFF&wS%7F(WqKwA!`qp{Q@Do0xL
z?nQgTeAE<XNk;pz2-DNHfE9!StyZlJ309($%cx~RPS_6438%u$U6wT_E1h8hG!+95
z!BiEOPxjoIXKN96AIT271K~l^q*lXaf2&oO?Vd0&&4ud@8nfT;D1N}lYuiJ|+`+m*
zweGkh3@!g~^Xd%oirZB|_QA}~0ag@HN{_?I8k^Ht1f=IN0}@}wzKJ7KkSv8>#*1E!
zaJN``CG;UHISP*KzGts&pE^*;1Z!(9NS)eURkF_UOn5zPbD3y3QqB-|1*HN3s838M
zltezyDgmYtYnF!RTZ-}JnjfT$JtPwal~6O@wdFG~NZ?T7=R=H!JM0?E?tSvMhu8md
zh(M&K5p$_0r4?iuv6+XTfWPo-Y(XV=Yu(IX_|q_EYc%z6X-}rek&n~CXljRze3@z$
zHvGsGji5Y5zHWNDOyx&}`{Bo9oelni>)(@J?q;`x<Y{Xa%gd|RUe1A8W%quHtE)UU
z=9yrDfG|mx$BeEte<NNvJtSCq-AIF^?7VV_$ire+CL)yWO<gcVK*k*fa3eRztKDO0
zE>u})XloppF?g@VDcAFehYrpc<!nC_yyqdPLV$O59TK`NV|@eA&xO_-!0MI&QNV*^
zfRoA!N=hiB5UGhe>!>G@we6;aXoOp{*G!I67f~U`48WS#$YsEpHAvmV*pK_ogS}0I
zfbCR(ZdboS&(=7g_Koa%JYK-1V-piLJk9awLUkZda7^pXC)AJ^`5WC7*8CM8rt|2!
z(rr0zp1NHj|IXGRgR8wFR8!$)FKZ|sP9;D=@ef!g7vM&uX{`(^TL77eK+Fx)uobyO
zG!e0^C-!&;7hHCJ3=OJm<b4}4UX6t%F;*!*6Hb0-dY~KI143>m?+QxcC0pC1S!U+o
zJ4GPU%6Y!Bo=t-^#yoVXZx8c<RXvf)M3nG>qLGTIUejNOzKT+aK`kw)sojX{R-6J<
zo??B@`e}GyXqpF%N!IV72eEnz%IZCK*CZ^C6D4`(2s&Yo*i|99k^@wz<-O4CeM%Ko
z`QapRn;yt2vXX1Oy{`{WaeH~*8vq1-x71s<gvQ=yV=Xel^T#Nu?4p+zoUH14a*7VV
zg`5=LbFiIc<c6(aNiV8Fk~<xF@(UJ$?D#kg{nWHdmH&ddRK@$aM(H20h;B~4F-Pja
z5b$vdts~T7TW+`tfzZQ)Bogx9$YC8@4hv5c@oQ?FvAyN>5NbtZ?;>Z!kt^phN~EyZ
zO^Q?&#vL#0z7n<z_iOZId;4Lv8eD#bDj8$&<n=nZvOF4o<Dv(M&#+@uJvZ(b4Cc)A
zk#mD=7o%xt==)ahL$5QNYAh=emK%b}&zkX0PF7i91cXFlw7;Rzg+Z}96w8(zJ?N>k
ze6Sc*QJ=xAYMX&^0^}|tphPs1&Hy&U9K?>y5n+OA9~G0}Ft!6zppwPb!fP5yO%FX{
zCRz7@1}LCXX^C);$>GNFPS-y7d4a-PW{X`CU1Hdgz)VGWSiP>zUHukAAfRx7Ix-Xw
z%OVHa1!u0F%*Kea7&7Drd3*GVBxlRPrK}@-);w(;z1lt6YgSe&NK2YafUX3BN@>D|
zUvQs=TfiINiSWW*@&uXgQq||88TO_qgjio+w|=<?hDvta6$wN~&aQ>jgU|~~XD;E0
z4WKQD8UyZxw%AdXl$^&XnI0v`X*(Zml8E><c7rN4f)fwe;K<I?)m3wmK=^33ZuD%q
z%+8&eUa&kml*p=-i+K?|KEpPO#F07jUgK9gYf&CH{x+_itzxv|WFB63rAAIU+CM}b
z_smhEEIz?23{oP74fnQ!MGfhDyP|Z9_)LB{+EF@M%VrtcB=))<GcDQilwWCg=XF$k
zU6C0yMzkR-bgo1SAt%rY@rpB0+>$^`2iE2hHs0R4wDXE<icIc=)|z34de0NNt~tb;
zTVh2^G$)6Rij5A%c2ojdv?uQ*iB8halDC*JY1!b-d6u4mPBmtdLsVUWhAmlP7fO{Z
zI&e1$ZE<ZaT*k6fU@Y`<CxEYqq5}{}qeBq5)?n(cQ2EJlkQhx)7a}5<+S6(8a*XIv
zZmxD`l4cntq+rqWgWWZvCC)J4RC{v0WI@cT&>RaQ!bE~6m8%R>K$K@aw0v<qhg)bp
z!t)k&tsXOeMHHymhY~R*)JopB(DUBuu-hV}=O6X@MOersHlt_=STC?JHb4<JPE-%x
zfSrM}F_F!qGeL!%Re`kTe&^fsw#fe6%Xauzz5YUnoL6Z!?^L(dk09-kiHoN<tnWmD
zuuB%!OM{H%w>Vtf!ti@OLeTaUA^4r~+hnkXA1&_*Z&OY%7hRSSmmF$TTmfqz67KA#
z+yiBH<{#rtG`n4bT7>azG9dx<iMN^-pQgLs73bs?J(7K;lxAoK&~I^3!MuOnKT1~q
zj{Uu4Zys{$;hmBP%)SC@qNKvaP2zQ_s^)xnV|323tc7+tpSf@bETTM`5==)rx@c~!
zVL~P(e&P5L=<=_CG}CwO3k*axUfce=K97wzrhSx#z>6Pcz*SLE{r$Gy($VKWw1JCB
zjk%~aq`jkq0<_nGz&}|B^--NP20#~`{W-!+RVuA*57#L}FRhOgwV<Iv^4QfiCLzEg
zOb3)k&!0LM0a~Tl)GR&CI6A2gjGoB?!Esb&qahzV!#u$l;%$Y}VlZG3tmObHF!a}r
z9jh46W9sqx-(kFe--Is`!CIqi)86CseZ0B*<8_MDm&cbboScFy7OoYV7uL+d^+1N{
zdy6|NILiNQSJXc~|AfyR|L;NiyX60S*l0X#<l?_HHvaJc{yjd{|64YkT)@A5s4n0e
z4>rDjQ2#2afBop;!$)7&3thmGDDNiw4~~)w$~&^_3@G|4G<h}wYW>zu;DE?R`Q(3}
znh%iX_2u&cYIFNXt^LDSuTSsP?W3dDr}(T<7;s+#<M&-u{N&fA!Du|Axc9)><F}8S
zp~wZ}sEOvKfOCuTqV)&Eo=LieHt!?$;2Wi0G)u}76zC#z7?@fNvV@ZkIMcmB9Npfe
z&{KtLm?-4NydtCv)PWjNU_l7Lgpx#QVT#Sl>|<}FPQ}Ioy||I3!fIO9MDOg4!udSp
z`NZOB98IAB%!ThR-;rBS6F1I9^3CNg;ShFFU|FGg6eg!BwmYVHM3txe2hC(<r8;!s
zwPzZ+ScK77;`z?u-a(V>+6*8LQnF4gaz0V=*^M)w1#u=BmSMCuUUHZsQAG{8XzIDK
zDc?BjYJv}xx0U3-bgzIB?fq@WroEUO4p*xPOkJMqHf@RtbV^Yb{W>DYpb18ThO7-S
zv6&1vKK^QHX<w``3?cW-n_9FLGBV^J{LbrY;p1quChen@$DrqTJIRe)hP2WTxIohV
zk&QU1B%E(ik2Hbr+t-;`kfS2$EjPMs%V8rD*B2cyu@z&Dfdw~{EUn=j*vXw#QkT8U
zbaKr?f*QUc-62J6U`xnhuRo;*dtG5i%@VEvM{&a<j)@C1XNI^C1HBTXnoIC8<x1=|
z%4!ieOB|Lu>s<SFP$P<i9OM?j{BV}fS}G|CWN*f@H@r1g^IL&6sfy4;G_ibt;}|mz
zuuY+-;U=n){({3$o23&xFiN?VIY}Tq!Y@1$;!Q)X1mg(ctWh=<uDCqL&1Fc+@}nG=
z4pR33gFt-0H-AVld#T2qA3Leh%2@W+_^Ie}yX%?cIqx{YWOe?)C%yC85N?N(f%iXS
z;1#Z1fgyXD{H+IW#sl<FYwm96a@)q(d<|p%wz!dCdnGJ-kTD8Ta;z1WWhos+nCOBB
z;?Xfj;U74)`Qi8b$47^9tvHH}#V)j_?gqf9`U%N=oI?d69)BnJj7utFEFAfHr+hOJ
zU95zgiIS4@5qYzC1e|%AtgnvgJjt;4IoTcX1{Yf4R^#D5Z@lLioAQvWB{!WVe7O9d
z##N+!%5OXwIUe<*Q5O+gNpXS^2G2lGi9vjd^0H!v&I!-KUIub!$hz>eK8~#7iMLA)
zQ=w2!#WV}qchSMy@N^$KBh)S8AbQ+kj|&X!l4NKM-zM$4&$wJe%a6{5__$?y7pnSM
z&K^nVZo--WW0!fz@$`EmR?mOQ)sBwH<#-XgplFOzwQ{Qg@r!sc+!Z3O0#dIgDH2BA
z-iP4qD*By^^Q0chZ1J!M6i!H<TkFlaq@%mT|CBirj4{DdP5E8!7i}@#*ahn6HsQQA
zXVSGCWcf?rp1%cLx+9<Js2qd?7D~C=fK7FlyX7E&pBpfOHfuq`$@3jwDcqRrn`>G(
z4yhAeSL(*oMhER>L>8Q3*pi@u?M;xUs2=nqK$MjOk#+u)ozx&(Muc!PFy4sxNkB3u
zouWbuwy!c7MJol@2uWEMZ;q)0OiWzd9@-F)>wO%gH53})9Zl(Y3xzn{5Bz1ybahBc
zyB&gJ0YPmfF<Q~+H6M5an*iWFGHGn2rCt`=P{(L|%#=6<Xf)-1(KL9#p9+p{Z3OT)
zZUl+aA(W&%t2+y}QR+=xojw_!zaNmrVh^uYvWUUEw2eYH20xpv=>~d|05Fs!^>u#k
z(3GS{Tj*w;kA#X*klwPT_~!=f6YSB@=1nLQ19~#%GeSuoH+S|vJ8WcNzt--y#P>cr
zh;oDavv<hFy6yr*U30(E=WRcH{qjlkxOK9-b6896vlyrz%SwF~p>E+C%@dUpSS~T8
zuq2vq&i3RiJj2YoWX;rX4~9YZCo_5UYHjt>Tu#?u=9I%Tp@d1D3M1#)h<<bwSv%U_
z116_d2o7$ggIr4U=xLD^A?!jPY3BFfp!Gy70i0wJHJPYKCB-Itj7KTR$U}FU40*x%
zT#fZWp);vyM(>~5i=J|ijcIS8*Vj*<HjhvC|JuYkd+JTh&C-4t=<uLrh&pW6SeJ<9
zLhKtv6Hm{68TORxCI117IRRm#u#5LKOVJ?8q!f~C8ZCS{U)k8qW~gb>lJQT&wfY-Q
zYcpD|+A+7gU0f;{Fq~*>s{U(fDHCC{o05o4RU~hF>2UdT7o~0hxsBpGjDUqvCT-(6
zHz)^DxYfD)RY0nyU?K6I<QJ}-`X|0mE-@!HoHQB$`>ac)NgTC<`(gp*@Y>W^7;3R=
zwm-A*CjRh~Yc~$MKxt&XHV$uaDc2_Kz^}Ifaq4gz7eKlm1(9v2GoK`@oxSsjW`u5H
zeM+A;c2ZC57O+1yrkJ4sW=86EI7-&G+(L3Hw~O{w&&?C#bnvP&_EOgx95ear;2^fB
zJAtLy2wDL)xJw&CITipDAcFHdu^0^Mp&Yq$Q*u1>oC=M-4CY)SJC9q{zdE=>)vKDU
zNoJi+FLOR(Wc}ZPqktMALCBojoZ2z=a)qRgv_^Jkf^><0cAK)r16-|Z)-iV&1Ani`
z|3Lg##lCWk?pBC}(J0cn{J_4@Gt#F5{TCj3OWue{3r%U&I+<cNa7}~e=B9*<pPG2A
z(mmj2w8`zQts(5_q9!9B^~6()nqrpIOHzhezTSONf32X5mA~in|9S6CJ3K+h$o%US
z%zFS#zeim3$YWxkhb>ASXUWBJ0sCslpgKcZXR;u}#Tfsz@rKfWtt>-vSmVKnDRWGn
zn~s+3BqS#F_$T1m%^)N|^YUo<kwuI_TDctXd1|O{y1<VK#B5t1O6x=_%x^me>>FBc
zOUqu8>p!_I`R|Hu_(rvAuBewgKeP~Mw@xkMDjFgjE;MLmRhT}GO6Nu@49KHsa2$#?
zRtDQ`<Y;Yn8$SjhrLnGw?%@{t)xcMvSVpC&=bp@<I19H;OG+UuEgC7Na`ATp5766X
z>TXiwi95pZ6LhFcIPkgryr%th!Za%>5dI~{<u2T+<9Z9(<#Gu@EOMVCg~KOeCP^Z+
zN?jde=(^C`A`sGf@HTN4SR(gbfP=jZuedbB5qDF3+REW5>L9Yk@U{(P0X}1xvK*4R
zae$F<(bW`fr$z#jTcbwRG5zPg5i<4|w4c<_EQ1JX_%OGwc^-&h%60-jff~jT8a{AD
z5P@RDvB_U3k}}gH?<a$48DHg0RBl6#sAX#1vs!wyZc@HjccI4DDRoqKp<*~vxNa^7
zf2Y8bkC1>Hc9F^Lrf^nzAAq(7!n&PNpM1R;oau%oU+&*GXtF<s($kn#fBN!N?PY@O
zzEz^_N`<T;I~irO59Bn4A12$J`~EJ^4;PLMZB-?U3F@KpoLXJ+bs=(AM}%VKEufzQ
zfQT>|kD~xVie|I~L*Am{`8cu<XRlY7a6Yi0qvY{vx5svKC(Y)I)(Hk~pl`dckL6qQ
zaPQ-0T-RFPVH?%}4-P(>-*sja`~&R7k|c@rS}AW$W7X~BVE37LQl%ER=DK3J31%xv
z`+expD8uk6)_SOjhuZDqk{|$cd2Z^bbo|EQ%XGZRm2I5Ey%AF=Z!+|2f7%-kD}BXj
zd4XQEYtt*tmU6p|YwaH$K6zS8;O|rUd+_Ax?Y3-$sZp2uvmvGuUBcVw3+x%ou%a!4
zneFrXB-!81u9-!9m=hYg?l{DTtP}30?*sP|PVe6X)16=sB^Jj<aJFMhks*>!<!3N#
zu}{S-CC9v)?=9HwPwLC<KzZv?VqLP@HHmfEY^3H4KqS#CHP4Uft2|a~TGboLV-j8S
zWBMwOQAo~D@tZzmJKUPr7RigTFFrQqks?}hiWAL4%bH+*E<f}YT#xb`zR5#EmHd>x
zmSn6gUb6nJR;(W^n66AeSQwd8-%bfJ5<SB&J|8cFwmhcq(S-VTK1;3Ed51@K-f@qV
zdzD3zU-MUh(?$?AhqiE~*?LF4_j66^Y<OE&kVp<|#u%#095uLBw+xK0?n-CY3aUX?
zP((IrR&7^hU0%Q*=9>v~4)coiDbuhg^4VQB)37l4Rm!H_B9(eT8NQ25m%ZkD#cP@H
za?(5K9ZAKa`y^N%_hzm#`JK~?<r`_}CZ*$RYx5GWvKXMb(s;)XrX@S^P)rg+JVc9y
z^MtnIWx`*(Pt_8qGxVO)EnZ#+U>nv7j+Cp`x~((x_eue9I1{;#<=LqRX`y+JI||;0
zOu)JV)bJI2sRpZ8p$OJAfXt}PjmBGsQ{_dJg%K5TU)0Sql}V36E){LA4u<TC#4n@-
zvau=<1DZ{nE`oS2WR=>RR-Jm*n8t-e9OYHw-j)gvctH!nQDN$uY+{XB0X<=!xTrLl
z&RVkpepX%qXfpzuCH}tTVJDQRz|Ua+N@h@Kd&w6UwH&U|I9MWH;<ytv7`ySf(YYzC
zQ81OD%>Vdo>HqJ2=J@|%D#$OA0QQFb?+@z_zl!s}e%)yN;s5u0e60T;ZFub}sjok*
zFP{Fr&0;lT570se<$CQ)j{k&d-*2A*w!nq&?}JZB?Mk5y;!LagG_4ffq$~}p+_-;j
z^-)n-VaM=5b*zzp?Olw{-)q}sWp4>7ieqrMAiM~^;5tZW^DPKJQ0`kx?z;>PST72;
z!Zp3;6DN`)Et6o==FwlVFf@lMF-d1tmq!#ZT1KVDdoa`n27+3tV1d<DbtH33;X)UL
z>w&}JUbZ|jD6&9azslc<`-2fh!H;B&k;Dxf)3CvQ57hRBGaO+2l1)l6afT{LFJtBD
zaiqDN=*-U%3suA1LF}Jj77_rT9@8czyjL1D0ym3ija!czeOY5JCL;6RM4nRgi!BO*
zVYX+(?2FIp2=ib2ybmj?@C#acizE}LIx*X*GdYWmBvb<*S=L-`hFk1IT9obcNVP)z
z%UMxe4zdhwT5va=a2L}ra4s%f9MqbQl1KDin5MyKJvr-5-}ic`8A6JXR#B_>E<5Av
z${C%caV@zNCWOkYZRzM~u~*&CGm1V+r?q;Ptm<Q5!$8r7=0E(*&GEYgL+8F}J&`hE
zoq7a|8W&}SBY1?H#bJrJ=~#1&51-u42Q3!uI?Jl6iCCccM~-1b5Wxm~7zyrlRE<`{
z_lGe4M?i`H9iKV$-(`Dx@kJs)%%}hA4<BxP8^?cm_|;c`(0{+j$I^dp!-)p`=G(<-
zKo<c5o9JPRxK4Zc$<ZH*;yPf%AxS8s{o-*Q{&hBj_L5iouH9GrN#)@>K<L;14lw%g
z>p%bdxBvdI@$k=IeN%O1j(7I<cMeZlubRiLz2>vyW;3b0+J8|0^Tzr{HImok$Xo5R
zLc{gE#c&@=R=ldhzo<+6rGRUWyMb$Uv2LK?XZ2F35h(2D;?w)-qzf(@6#T4S7Mu;1
z{Pcd{&@9#s6#T4S7Mu;1{Pcd>3xitwvtX^gFc7pq3kuo`Z%_NP_6KV>7VoH0(o-!d
zdfr$F-g|@Lg76L{KYgZsU=St?B0Vhn89iO5g+^Ni9YM)2zoO7+p*mbr2oES^oc!n`
zuZI;%hjD)}4m1h=ZRv~t*bcH$jI{qYDfE9UK-y69(>G(BzF({xDEQ^KVwe{CxaWI^
zf}cJ|s9fJzxS#sQr}xwYnroqcpx~$X((Ns}YK1*K$df}i_c<vxv|O~$l~3ujKPg#H
z3Yk@MwkG9E3x~B=4bG&ED|Pdk9CjDpUn;u5d7+r@C5NQ|a}{6WWFi=w2gbfIQSREI
z@twnFw@NlnjbsM+MRJrjFh}XuD9BD~+be0zrW)@ikEvf3LCF}pv4+|B=3(jl8s(O#
z{ox<7MC}j1{}OFezkZ2m40D&L{b7M6ngBbPUKXtqx|U#m$v-V8ZIm{0md^_CiM=Y@
z<ijdWwzldVcnAYH^?DfczCFy)^|8~&h*ar_M~vQZ5^NA?!jswP=;U5Cd5hgws>>A8
zP9w93Gy0H><=M6Ac;|2rgXHJ-Vj@9z<#)Bh4gN_hRFen6dwou}YvL&pfPoqyvqN7g
zIEYum#-jpHp1jAt-xbZBD8pBo=msre-6Waxt_2@`cXjP99SyIO*?0_1km@8%2ssM?
zO0bI0y*G?qOzMxfX5>M<M5-WIe%wurD|WqPYZX#{la*O@RrSQ!yUwXjb9y^lzG+qs
zoz*aX4->*#W@=eDx8eM`l}^7=KK&t0zwxQlugunlumIK7VZkE29WF1h4C*&hVub&G
zf@Y`%u(%XUcIO`Q431}^<tLq)f<?9HBMeOxS+j|N#~8G=&(K0GaRL;v978@2pF8$Y
zp97!ipTiG*j%*ZK<vRAuyzmv^hdf8N$34d%`aC5=y2OhO{EOhZJO--DKZYOj818ZZ
z7=AcAJpctACjHPCz%BR+_)A|*xG7KCsBvG{yr3WY0*O)g0)O}yz6<yvj{*Jr$M8cR
z^FlikLLUQHW1hn=XF>ViKZhS`ZP+&RnmB_)1~ht;SkMbzBOK~P{1Y`#9E{9H;V=Ip
zc&?9u;c**|Kh$KiZQH?L{zdS-#AuPFt(3YOOL__EgEA{GDpqFH7#mH!+&O*j%%<e{
zlrV^|_RH<h#)GAjTF+lUYqq}MIVi7tF*_&2wSNWrf<>d<3ajg1zS=o$y*%2h-Yv0C
zBCsxRS>FCDCTHl!$myRgM*m;?nWO)a{0$eM-Ny~~KVLm;d>!k58t~{3{m<|4vHBm~
za8mz#eGB!^!K|HdGK9r+J%AiY$09wpF1%L9J-N}4Cq4V6*O`{t?Pyw(@uZh!XzAJQ
zWu3`jJWVN#>0LCr$076pxe-GB{`;f-z1khk&+Y<OeSf%rfXMv&)8p4o`to$=;Do=u
zsNK0kq**^rFiSHUZc_*Xpkvy|t^uj`PDr%xUmU)E$?YR8xP_D#T1~-s+uOm>?#@BY
zv^q?&h+=vv_4*YcVZINAI1EQ1u8A}N&8wl~cy@5~B<#XfBP_6q4vhBcIV?2{fx;05
zGa|d*=ALbe4c2wEVN-4n6<}bY6)`CO{y$#6iq?@6Y*6A)N%H#raT8bO$w9MrQ^~`l
zLn>?witBN-io2LD`ljZ--#Oknem1w%N0hYzfeU=IgDc4q0xuBo2*RXLLPYv(g!RRo
zhRgoSEI#y7!*$zCJ|>wn!%)@~frrTRWTrxasaVstk?$PB1S!j6?*lM!6zdCG@5z>t
z1J4b``@m^)`Hwn$BweD35mdRUX(Fk2o8|}31TJS^l-)L{`V%x`+a1Z!g-{?QAxNmh
zF0Gu46B-jK0AL+);_bmP>q@kV<a}_2BR6@_qv4{-J`+$lTuJ96E1}Wqe1J_h*rF9X
zWe<!CiHbqLpe}|mWFz!RZ-%z<y<v~pbbCT_ov&bqPR;y|HrEs<J4oLybq;zTq{>io
znGIo!5Ebxx*s_*7G(Hk31<5AloUfxBkgS{yHP}#lKnXf^J<hO5<^e~uFjF3ImlK-O
zEyG4sdViY@V555!zAkw?!l!!1iK1<1(<w?{aMLM?=(w|t{ZVj$x4+CT#|ghT!1{}J
zs(`Awxv)5;FQ8UDa8G(YIOXaPgBF7LC_4Ehs(Tm9<_fovijL<N9qVpWRyH*2yaE`W
zTSdw^(|A5GqjqNsk8?6ZfDVkIkn&wI86XhKzW8IPX#OWn{YZDj>*mQD36c|}SBg@}
zamTJI;5@C??RAE2AQIQKW1sQ;qX+Cwc2n7JJ$-$+tH*2TvsRTEQ-+3YBFI?mlS|En
zV-V)xpG{Q#FZ$d}|9`#<z+C#jzVYqX4>$7k{~z}Mzssk9{^tZhUo|uVQ2jxD<3XdI
z)c^g_!}_DI8lO-9-(c)7Jix8({qe?$_<?TkY<3<$OQQ#r_&$6Dm+g&y1BDDoI>u4N
zyoz#GH~Jmuas&_AGc-&(bkWW*gY={~t-Pz=xl@6E(d3$FTJ!_Z-%P$%eMPum`Sz*w
zGt>q_)qYl8+wQMz%dPYiKae|N@aB!FO*ox{Tu|OfXyd9jtX)>`pgyT`Ro$)(t5ps(
z;7Z_o$C8b3d5CNy`hqX^ieB$>*D>i)y_+ZG9NqG35iO$$&@Dydu5l8OV@DxH!IVTg
zn=-*P$l#_;$8&Dxe+_PAs!F-Jk=UX><eJ2>QJzTK5?#X@+;2vCWJrnSu2&c_HAIVp
zL3l=vn+qBmWUjBUxwlkxnKKmVR6cr&+ox;6B#0@lFYm{s2b5oi6T@WFKrCGjMwoR)
z$Wt36p8bh0W}|mW#Zszp3EL9DK1{*_HOCRHTvc<ikw+b%Mq1PK9fqC{+Vw$wv$gH%
zIu`->K7G+bX(vVM%e^@{J>EZjrn=G76Ha)rGNouOR66TjBA2p0^^DdJ=qfG&TyVS?
z4|F=IOtWe&nPR2vYJJ#K>-X4gm;fJT_?!YYnmdPfh5<Sm?hmc(dNgf+V6_aC@rt3N
zAWs60SERiEd6Fz8+Qm|ho1tbKI8yA0JBjkP`vJ0cuVVO;zKo9Egx=rpFWS?5=>N;?
zoRW-Wj5&~f6DCeV+}$mlMxUp#bcrW3$Y|grPX4LOX|QB0-2bEb?YX8fTqq(cXr!>!
zxin^eHsL5Xb<^N_kT_RR0~Z{YqgE6b61{whUn+ovPAOD(j6NUX@x!#@GJ_We4lY!u
z$st9J^WweV!``W*5R?h5I#p}5;@iJrhO86S26D5qNy?~b3jnQ4+$C1()L?O|cYfuN
zbCnKUFGU9jx1hS2Sfds{KvbikQa(RK+*kdU>X+Wc<`U37q+SRPtTPRjrYKDrLk=@;
zYEn_KiVl?WVRrMgDnSGx80WA;QgJDUmi$|PHmbRUP=G{eoQ3EGma1BlbqZor8R&E9
z7AlDi3JMSl(7Hj)n*p>4a;F|jk#_Eg$XS?X`NM#IeQZGIZlPYy%jF~pKaZ*hr~or2
zLXYT+chvfi*Dqgf@(awb^iICd*0Xh$3>F+eq;@3HPRTt8Bk*gbrbIl>3cUON1#Q8L
z7B};P007Z-R)pT&LYMZYs9eWIE6u3}{WjrR=8>5SQHbsVf+e1kn+Ck|Awz;&MmDie
zTc=_;3UdVyRiK#;yX?lA05ZmJDpKL?e%U&or0=f)(CLiO1>mXI8nrd@zk();@c%*D
z`My1=B`431Pf_||gUv=l7gkS-JERWtanwiEjOHgPw7U9cT~@_p;4<axplwn4CR5+V
zSj1=T$z;&;Q?F?u3;wpf)zuKm0)f-gJ=DBSLnP#ZF8TRx61-O=6q7|uOUYG@1K_58
zp!*-#*mc!4G(j9yBjB{{mckCFDIl@iP4H8|jPSgfT3;QlaxP0J)4~{GMH`Bhgxv}1
zqvZ*uau3C2wcJUdC7~@SIFs$}FSBf_MYEz?XvA<cf4XL9GA`l-D)#xRH0A6BH~E45
zSzFVqD`W$06Km4MItoUn<Bpupai^H#Wq0hdiA~dC@2WSvX=-w!>@c=n-GcG1t(l_L
z_1>r(j57{?i0UV0qGGBy0zAW>IIGUVt&o)pT8*jZ2AXQZ>(OkS1@@YpP693w72Xcs
ztiMBI;tDUB`}dRhCEqmkUN4@iB_LYuEbC3+C<N88hRNaKki@{=-6Gq6pQIzlY8IR?
zo&^A!Ia?}fhV!MpIzx^CTlXEd)^e`JTD*QmsM>8-je;)kA7W&k`AAuttJ+=-S`N{%
zD<Gr7*Jb#(@9?i%TeAbSgD8O^jV>~%?g=fILp-@I5dzHd#%gm43+)k<cc5V}1g@ZW
zfjJ&ouRZBp5Kb;V8_{79xHgAytqy>lY-0q2WZ=;ZyPI!q<-|^U#Z?O+(wH8u)qM`$
zemWa<ivpWnwkPjsVTxH=kASSwOV07x&;SoSg)?_Hv{*>0Qw4nEL`=dSoY70!84iyd
zuP-d&5HTbw!^@Z0;vOVNNMzN{3@6gh;tV9ClsQ})q!0G*=tpWuHU3D%9ygy=oz9ih
z8fB{BcOs}TtBh0+_)XbdOz}l=Ed_vRZ#63eMuSLZW8^wiqe#QF(VMRbVoV_ZaNukV
zkz9F0T;#`SQ5<q`n@^ozxz6#Lr({lNJxpTU#R$SGOUor3;hwDVtcf`7VK1J_CMD=#
zv*Of-rl&a8X4?r@AmmVhcADG<%V&9U{dDq+jvqW=0jFVZG+uOSRl~gE*x$o^8TG(f
zC5+>TN6jIYVN?_-2w4D$Qc$~DeqdaqnCGL@=;mE6`Gb*$oS&z6b8N`wT*9GXp&dCa
z3ti7IbiAAae`Q*5rq@tvjQJf%<819=3a}BAdw2~1$yiG4$yZpD0`6?ie9<lG!*qh7
zW2hY@*RT;?45Jr7M%9TbsFDWL5!FHlw+3Z9%X-7UJ(k?VV}w!dY{LmiU!Z9wLqkT3
zMN|`%(xZp!d>GO?%9pPOT~0%qbO)&E?TtFUd{5iBN!0YD2bbp+s_><4d@u1MW9);~
z5sdF`vGJBP0bMsx9sq4{6G7xZ9i5tm6^tdoN5u6i%_qhMp4=)Ka5X4`84mCjlnLJ#
zpPwGO3-IA9k%6zS66*)I)Glsd24hxAY!~%EC)K-mLNO(AY%H%wsi<RbS=uDm$C8&|
zI(1L44R7!*9>qHq{MYsj7k$y_S$Pp(b@ukH73nc}hIpAeRZS>*!B?g{B0{4DkpiAY
zGUSQA)LVK(ALw-+kOTaUF8qk9Ghl#N#d0Be#*bF7Xf1A_Mojl1z2SK+CwMk9_A$Y9
zqE&xpQQ))lWS0Q(=v8a?;OL|o)TZE*8yaS_EefdKfKrcj($RF10;FY~blk%mg_a#y
zzEKZzB%Y<yi>h~{lEu0g?-vlk_x#|Zr49BjUfLuHRzBETw)L@AKHj_TMT_j*rYXuQ
zY4QPh6>J)XYUMPTG4i&12w(He;ujEgjrGl7zO-vBO#9gJP4G>6DdL;}H|!igYd!gZ
zh(PUA*_;itT=s|Q`}us-m>8&WDd#k1(aD%!;QGik%f(hwNW2@B@~c^6PYb*sEbzWQ
zZgLi9>U2%qiUNL{TQA_ckH))bv6hkoi%RAAZzc#a<{0$%^62|!@(8~@Yn~eVCwH(?
z9#XDJw&~m`(HWAT2UeN~Zzj;Nno$XW9YpX2MV_Ltj<mZK&u8{EV6)Pq9zZp@5@vc+
zwKxulEEME0F~Xrb+K3Bs$ITFIyAC>vWvQaG{e!1#b$$E`l`;rEJmjwW=w0w@9Q+a?
zXYkBj0qzmuQv<G9I-7KQvIP7?-dwgnkcpd|%Z7%mQ`EBYpq{h=IY<^KPPOEg=z@3P
zIqrajf%Zt1^xJysyq!4bNORhFQr?hrEbuN!9(U5=kkmSYVuAkRxY!NKOa<5RG!=Ys
zA&04hYV@(}K9nC%iz?&`=ky6kG!+2nd}zEK9yGTaLj8tb3`ktD(1{mOY&u6|4o}R8
zV)>UC#&C#$z-W?DB%Vx%9pwi>W-ZzGHr!PO2q_eZJ4@R}JsO{CmHqn%(gz@M+qM>1
zto?Vc;dg@L;P2`8xQDjUcX}1Ro7-A&N$9m9TVb0UYjflIlP}S&M4A`Ys|0J{j;bv=
zx354>7>EbG;Lx#=wl8Pzx}^mpdIP>bV^$NlU6Y+ewBFg!iCiK?$2e3@HgOfKK&OD3
z?@8Ezr=6|Zft*GI1!wWFnOx2&BbuND^|fXxPc^WFQ6`vAEykgAD2Z~bF**q`NPm)E
z64&L8b>U!ts$Fj0*4A2IIkW)WM#jd#1(xsbI-zBhlIs%p*2KmA0l7;GB#Z!XUrW{!
z4!wG!cvY1xiN8K8ru2Q+AH#(HTJIx8+CpK$1g{u2k8ACp@D~Xzs>UhnoCQtrJXKMY
zBRXf-rOgM(cIONZ98MlNFI)Dms=3XOPhYf}M<@KwVcn>bg-$mmzRN9?7L`)LJ(=gk
zM?v?)NEof?*f%0kLmsSrVj^z(z?#5PJv-ic`EuttIevZ6JW1%;XEqvMUF1DF$NEge
zQE<7n?c}HB_2uNZWcktZn}m$YXz$AJGHvT!@7mp1D0~3MT4fJc1@<l+C;#1G%wmz0
zlGVZ$pE_Xi(k}pHXx(3kB=_rexo!6{zO=8|-|FV6b2*s$@=wcbthfATIR^3kn6We`
zk%B5T%ByOy0#~F^W;2B=5ADu~270M#WaH0B3?F|eQT%Ku=8U_kT=MB8`;64_`A!~q
zHzw?3mw97#@uD@pGNLdds0Y*DrAZF$_F`)NioA=W@jX$`qjZWgN9Ppsb^_GOq`U0>
zN_>@eaTVad+Sdi;G0_fORQXUfL2-4w;RN(lgOxF{6(<a=@aPpR*-EG5V9`|raICOR
zXY%%^Wmu{DTL2d{#euIkok=gS<7a`;&Ky`2@eW;ucXEWw4NQ$eUQQ+20d8+}VKtHi
zibpfRs52c8g&Ovw<bXTzCP7X(3U}fXIox4Y9s#QMawlzTnK3y|Q6=4YM2}g}?V4~$
z`Mwd&<itiN&C^rn%dyL;7oyj=hg!Y^Y_33n<DIl}f}27f1W%EGRU}rN2UobEIMOTO
z>RC+8*V?8ABbrdM(@|<psuv%{(&YQpoLhBjnA_bn{mGG{q?b?kn+JOwmF(%k>yzgO
zlt`40y*fAwmXx-&Eibr5<$@>$o5l>X9isl#Y6ck;_3%nQ-JGBj@YLrmu$i#SJW!yL
zkR_|eYoPC=6~4_PQT&V72dBr)Q$1(&2D6irzB4679;b(owEz{M&qnF{QGvf+HO_l}
zSM>$D|4#pK*9iURz|ALbeevG;eOnyg`qS=*6{9x2z;!5#p*JoqsK^gKGCL64NLRO%
zR++l{!Ip+A;=At_xeCbKH8#!Fmn3{D!g7brzX+DwFan%{_3U(bn(HG}k>TG9{%emT
zmq5YSG!S%7LqX@b6UsqhXVy^`N?{3{_`}5}s9a<6t71H*J2!PQlMl#Ywx_}lA{$vj
z66w5CwKS)@G=Akv1CES4rphYds0=bik-nMlw#%7ZaFs59glpVHsS5GBo)W3gVbp9B
zUMolOz2sunC|?-r4d@crT$Zp$i~MkEY&GC_sVbady&biC?XBYRCS~oqLmS`OW)t7H
zo-ETaq7GA32UburNdNxP&KQUQovk?xExNGaL^uM<4C=Q1xR7D_ZpQ7&6ua^G#;)m{
zsTXuaici%v1m^Y2HCSbUsqo?Ea@BJYY|GCtJ}wiq*65%!7PD7b08>D_kOoA3R`AgO
zH150+8+*VAjs97M4m0%TatFeB8~_>3)G*0}Y2MP>?#-=TRBb9kX^shgZSJ#jf5#sV
zoDk}?(9SoT7Kv~v5(K|R78rlDFJb%N)|Tb_$K=gTsJ2YIHKG>0Xg-v^Y!s2)c+#rN
zYTpEO*;^UjGF{&kKhK>zhoDT@#Ug}Jj52t7Fl*23>nCRcoij_R>Eu>d4Xj7d?hlq9
z!QRp7Np1vh*VosVBWx1-HI&5DQuj_@4=s71r?;@i%V_hYc3x_(Qanjx2A(WI)upoe
z70b__@0`FN;MnB%VY9i1PfWP3!UlfJOW+n+ONXWkU1pXZ<6O7#0ubkygUS*t@KV+K
z%~d0mr0D2gFu?owlN^3>+*)MV%|_t7YAT5aio>0OVvFsyq!RWRu4&ctVzH@7pdl9?
zno9U+7kJ52|GhHi>MZSE&vQ*-E2Ul+O@wNWrgFH0ssjKgZ!60Vk-V)gi*so6a4*Ik
z2z87#yx^8D4Sqq><*)0pV<B~2z~feyo#}%PRnLAYjANmtnj=?=w$fW2$;6aah`O&X
z%TpBc4s$c03n`dIjv9^cwNuJoPk%9>#_9gip}FFWbXa;bHVbwwIpTC=jS8EKbEz*N
z9&|-vgGoBb*8+Y0Xyi>~^~xGfG>k;v3aueyE2~IaSa$sfykQYpt6Wsn9xOVu9mafk
zl;=8d-Qb+%ycOL1`#0HgXi02EZ#uL|b%*~(?qkkn#gtyfQF?B;cuT+;`^oRh8#-u#
z%_;SGPr4Mq^Or*rwp?moo(;}tXaOb0U=`;}OV)uO$R~ir|HuzlgW$EXb80c&Ulqz3
z(HqNHvgjhGBM7q$r75(@)<ZIJlV>o;D&}@7lqLja96cQqlGSCxBj%Jv7m$f83<PJ<
z?pOxZP0Kti7;<s@&U3w}7k*<q2psvS{aVgZvSiPgb3#odkqlCP85pTPa&vF7;6f3G
zf3?l$?qlzq?Sfh7uVF7U@(wAXLkn}A8s3d6;;~}|uZm81PV_vu1qqg&j@5{y80@Ni
zN<6`8#7UbzZ?$hFk_8FyE+z_M7>JEhb#ZjP{aCEz6vzdf+^WBvoWua`XAWssZ1G2L
z0z8H8aScOY^amdh{HcaJ2cg)O`<Ah{T{ced%8z<zzs>lItROQ(*5yBy*=Pti1!|Z_
z=V<1F*N4RH6Po28pei!KAyFF+N9Z4*CNfOe1So(H<b8bO&Fjl5d-5BiC(+R<)?e%z
zQN%p&LMlb)xjS}Y+({7C9b{-VaIV%p;RT*Q^f^XNxjQxSkH(U(zaUDQjhw4|c71u4
z4(B1FoQddUaM_+*FS?bk@Y=RJ1%88prUKT_E4;9c<n0^OM8AC`FWd$2oB#UpCZ^nV
zVb+XYLN{F=*Lh4cgV4Ia>tdmg7x-M6OL!sqmCUnF6E#gnD)k77<`nDvDbk3Un#DTv
z1%~^`4>z|F3ye8`m`YWDX0*tclnhlnzs-^(28fA@QX(c4lIAb2t4|(Gl!{>9;mQV=
z<6&>Hv*pVontc88N%I(vh>%FXC5QV5@Gr$h`i;Yy!r%4v_2jpL+sKk{za`3cF@yV?
zJ;e*5Uc_KD9*cmDg);>McHC#e{=5<xI3(U2e!iJlEG7xB=8%J>ZNk!(j2y!un}L_M
zfZ>u$nxII^i?l(JmP;DpD9nqrVkK_YiVHvG=#yH=N2AdgK~7*(7Ex%a(;lJ3a^_>O
z7%`N_3~TF%lz{U0P~1^+e=GU#SiUBz&CxPTX_93U`<dJ(X2rN}F?Fc#HYj7uMs;x(
zXd$*|ksDu+Ty%BENE8pG!u3Wij=FOT!oVNt8-^&HNF1_Akk;$b5zu7kP-m24v@`PR
z7>k9ZU<v(g&ezeY%gb`~>KK1-n&n+v4&J`pKYV>+-~Vg){-Ald8BQ{2`t>3F-HfsA
zlYx%>Y_Raqmsi7{clP$?jQiyE6Z>{0n$_zA`}RTjc5nZC`}R*!-J_u2{|eu}I{M3I
zu-v;xhr2uBiu0qe*kLnVxn}sf`Jch-=6~8DJdU;`YWkoV?U=2*9oBso)qNJ$eHIOC
z=Ws9Flf%8Rz|nE={^)ofusqo>gcddd)=1@deH_AJude|W;TxW+bTXJ;6RFv20|)_h
z!7)SrdD3=BLTgiuP*S#Wv`|-_VixKzP60%n93Ah$B@ZJMWb^Acwd9+RHUIb9TJmkd
zUn1jHmy@?^@ZW=FN<bzp)B%nBI~M)AmVEV5qw4z)67epF6s$w1JxwY++;*0wok1I;
zK~}Z7hqdG(wkCgzn(O@y^G(AnDaF~y{VZ-F*CI+ICN4sG@@oUwczh3-yZ$lXA^XFh
zQ}A#MS^glMRMm1%9X($k?i~NvdUd>ibi9B1<DEY%>*Duv7VKiC;n|U8&Sq!Cn4;yL
zC&_+G5F_eK)aVhOaiu?ERgRwamfmp4%F%TWVgMCgz)k6fa{+6wIo#fovC6WEO(}Ry
zyD6n2Yd#3Ji+m`KncPB3UJ#7mXZ*wa=IWIMFOn^X{sVfD#K8Tef<^9aSzJ6Pyq^qP
zZ@6$@toabLcaEo?p+nDAXh`Vx!d!4H)<?Kw`MclHi}qDd*Lcv&idLBcPG`*5MsCXL
zKxih-I0cny?nI~KH|vBjw(ZIr3)%+HRrUfGiMOC|)r8Tr3*y(q8|K5}t{JTa!IezY
zA|9;59b!NNvmy7d;HU*tAT$tcOPb|IK^3JCwdrR=v_;@#jZXz3r(;#?u^B$O70gD!
zkF`;7VKHjXiF|(KRledwP!r$pFJ*`zW(fa41Md^nN&F+syPdv_{GeO?bU4H`#!&=U
zrIHF6z$P&-_SgPX^BZpMp!n;<Q)If_`=gUb0YS<kKl9i2M((a=#V-4u7g~JqJJeZ_
zmi7iglJiq%?{x3s&(dsk=HJL`Km*V2b>q<Q96q_2^O3Lgm9myw#RX8tSe6vZ83oQh
z0fIzIMl7;+ff$WADzsc5VSNt3f$+hX13N1{Khek>w12s$E9%u1new~fI28{6QR5IZ
zH4U3mLvsTWHM!eWX2LO8;i^Mp;~E)Gj?D0Ie(fmIV2!61Jj14ZK2$QlbkPe;Yveu3
z21eEOWFO;8*OCm8JD{y|bf3hAv}uX>(uNX!K>x#bhkePAZKW_U^qlgE$a-s^;To^!
zqeBbt+#e1)x#+M33qQQLjYGW+gksJ7`G&iK5dlpVWGSH~2v^kWu-!P-REcBf4KMIN
z?D&HH{cKz-e5SULk_yR04siv1oS8UmoAS@pbD#?~!>JnqVbmTkz@};pa*#mbk8mUX
z9=bk07LJqBHGR2Za`vas9;GtjWOOZE237)*Fa!PdYZfYMc1GTq_Oksh?6A<xMm24@
zI6vmdEd<<AphtyuZ_yG-nj~`E<E=y?4G1Xx`q%?qsRT+C`lR+)a^z@{!3C@5{e;li
z01W`W)YH6_#mdiebj3h0x?0!x0vG%wlC|825=xtq)y|bOD(1KgvHXp;oI{abgw@Ne
z)+NYN7#Am5OTx%G#Y?vo+%bOUDx339bT-o8Y8<GjXkE9Ky$Oel*EaQ0oXT8y5-!4y
zP{s(NXBU!6+}pBnMkBT{sn|}9*GB?S-S>Js-^{kO;tzJ{QiZO_Tyjl=j2gFOM$R_p
zP#9Xx%lOD<BOUcn8?W1Uf1#*NS{-fASve@R>68T1vOYf?TR{yY&Da8U`h5((?2^gF
zlV7VxarEK?vcSk9%Pc(oB?KG2Vk@lBflx^m<xi{|vco3c?m<u4;r>B25#J>eq;s{m
zq$J6fCBDUw1r-VL=zdb?>7b8F6+fvf%e7pomvBIhQn;XLyU+%C0n#%Lkwh7}Z7ioC
zf@2(bNDl(n_-)IFf@1I}47Q{<4m9TCC>3au(QgcsY@lBx_U94p=Y(LA3Mgw*D%*rD
z5*a>bE<vifzy+9=Bfs7S7M#8$z}H`%?;kW7+V+lwO(?M8EF#9J9Xvex09(PVf(0x@
znR79BPo25u)JF#ch_=sq!;095YV&AVn~t0xM-g{YFR<Dqy%5_FQDM)uNXRJXn-wf|
z%@3^5Bf(g1(qyb>Ld5Bm#HZ4EsqYS{E!|PhFaXLRyAbw3lDp(QaL2v&bfMihMPd7o
zo3ENXr?T(Fk1{M+GTH6vO-{JjaBJQU8lb4-IcOB`U!68kLyC@Nbc_Xag&Ur_<4|R$
zbQ#pitWBf_Yv&toE-eau<671%w*VlEka1-&B1YAWuj(;0V4KD|V-6qVRb!br;yZ#R
zjf{hU!OdEN)`PQi>64+>>^21#t_80gLDNZ5t_T~S^)A~Z0J}^QjnYMdcSo3PF!AW$
zugair)?|v+sZf68ayH_zn^>o)(qC|4Y|-MiiH>`IfjH?WKJ|+;r`v)<DrVUAqPsBQ
z3b5e2@P=nt!;8DO{>~whA~WgxK|X+Y1(wk1q{#Z;n=>o6$b~H(WTV-o51=9K00MEB
z2CYnl_2(lDxO&GmIMH2b4xbfS<Udpx75~etFd1eUhR3EURwU+n{?1&+nU5*=^yv5%
z9BH+XR1sD3C<KT(0x*MgP<o(=Gvh%PI*quP{e>K;e;wXc1waSuhZ3-xhf#R<;6lk1
zaT_o`o@{mbsvR616|7n@OIkz*okneJ<d!3Ema4LZDNc8K0VnY-4`vw+)hE*|!e0fq
zdPSi@rW);Yl@|lU+!s(+Pys97kp86Lx|ND*)X6a|YWUAj^zR#Ym=>V8)c83Ja#8B>
zLLR>)p{zQ`m-&TRF|(uu)cnHP6kulw4T|HktYFYJd06B^BP=d1fw>{XSJEWEi>lR%
zs&R5NccJFR9n6FVb<#0jLzG;(ryQ2Q@07)(ms?3axIv=Wlm|yUdoLp46Gs6i1C<vd
zQnD(eGJ#W~z(7Oi)4}MNNunaK%)5CSxTMYZ@w*rv)%BAA^4A*v`Izh<dKtxn5ShEU
zMm8#=o`m_Zi>RHHTV)u2J_t%?@N|N3$O4(wg&-HhYu&1f3@@(a$6tnabLYbCN!U`U
zbCd{z7I05Bt>rGp{X<5tW%l5CdC|jKPVD4J3_b_g2gMg4Al9pz#X#8@^$MuRL8*e<
zCkdNb0_7Ut{9!J$o<jRVERL1~7>65z0v{j_{!M|ux(J6G<MsvhV)YzZK$nsjk`zIB
z8I$rBDvSPoUa)+jJW)~XlpNmk_eO_-t>s5@M}<gRu3a0vfy&p6dGY??BVAHkIjlC{
zb62e-x7bF~`tJ@#1@5~a=X2n&-R1nZXDE4dDsO3+%RaL_slO=ff3<*s$D`RozNIx!
z(;AmTAN&2M0DP<te#89r>GS5HC7fecy9_9xC0HbGN-oG^sYnh1V2=?+$r3;uD|zzD
z6)Nn5A5AW&UVoueD8*p@Fw}U`zseM%=O2@w@CE;Pv#21dPbq%o2i!>QaW5Z9zAulW
z{qYM?FiJ0%DvA=uQ;5`3UVi5Xk{8|;^1I~WEiuZmz>Om=UPI5L76&)OTK~8~mjNzq
zYo*;s?>wqsV<)|IGJ)gG_Y!L#Re%tIDN<(^OjSa0^E~|U3P<mY-X!1Kf9jA+E+!M+
z&1FH8o#-BJyZLPKBG)|A@m^_h<<sUE;;NjtWMZ@2{oUQn_s`1gtwT)*D+I8-l0=k)
zowjoV3(1C8Kn0|u;dPSrSk~k&D~1V=dhhZ6&P!KUFG^KcxFux@2n0*PPONifVi;AR
zOb`ELwRUfe>w8S&IxSv64!bxdw<X-lgXEN`bGJN+SgtEH3b<bEajo?>^nP7XbvRF~
z5#5}4F!H%zi(|8DQOBT=(;04vxMbPQkk}78`XZ;nV)VVdzRar@yR;Q~vp-t)!6jUW
zV*U`<x1k86aB)O}#VA=Vh@`AKD7hu_OqyK`3yX?z%CNF)Q&<%@JMF_M8DqrYBZPQz
zt62Z(F+(8Rane^W-yzFn77xF@XphIeQMRl$NKE0<HBn;xxWG{-1pQl1aa)d$^A-<R
zEM5$a8`L;~6|SmsMFWItzJIyjTsSE}bR3RcTk=c<@lGxf1DecG)Jpb~&T>)<?Iv%z
z;mk8MA41-w;i}y31>kvs#XWAGzCLzRgj)*_XoCT+ptCst0$J_yp(6g;>lw-wJTw+3
z60#<pAusgXZ@I{;n+`Qhi2lMM`7oP$xYJ-D2Ej`492ySAPO3T&lqPXHFB3PjB-TY}
z#nCg6hgxwS$`<C@VhEYG2Sb9Yz^DsAv32xn_h_$afsy!q6xZ(T9}p;Sx(de9^BIHj
zPE@m6l+Z_wF6`n)8Jo-k=HfBPlCeqX4Mrwp)8c1OOOMnCh8f^ng4+nzLB~|&er#4c
z3Q$rU@j*9SMoJ+!&QoSGG4KY8O_qx~&*eEX(|!xj2UkD_hx3oNMCTm_k)ZaYZ7{xW
zKJ|t<i20k`Bcq~BWu*ZJY`{jbW+iVSlmjG}y)0{=>vR_Ivqhuo5aS82X(Ho@>M;sY
zU=65aZ$#4G#|?X13D>rJbi3yFj^eiS_7<{{g(wY5`>-rlDMX!=Gc9{Zw;1G8bQ}vu
zslqhZxjeYt>{)jnw{2_@T=V|f?Rv;NlPd9K+R5F<ao^?b6PplE!1EY4?jN%mLF}f0
zkT+APRz*~WmdolU9AGNPZdxD+B96L|*%I@22(Qfi4&}CITGDFW1Q$9J13r%~0#vPi
zJ~?jgyokH>hGRFbDb<gn6@C8ba(=@~T^24S->aIw>3w@Lg6k!?n(_n{J7JU<{?R*F
zhhKR`etNsP{Kf`f8)P(iVR`cYX&Ti~%CT`=3HjrU+qF%%Bz~^Bz^qQt<C2M}p=6Xw
zYdaT{A4cOKQ~@<AVJd~RLtHRdt~@PZk<Zl^kHGpb|4TlTUU!hKW#lgMpxYZ~4`3@F
zWRnj5UGIF6J~rU<%{O1+-}<*-Z`i-^X*~Sqn}`2W|Ek{j=IgJ&Z9If>^=}?N{Ptgx
zjW5#s4WAjxj*{eGW@od}bT+5l4e$S#e%M3l-}bwtl3DN6u9EtC{hN*T`g$X2Y;1h{
zpx$`U_;XVK`q9J2qsGHzk^%__7_RwYoctTsJ(#r-QH;84?O{rCTR3WDoH4=ICvX6F
z)A2PsOdqCz_Q>N1d%Iw7yML8@#K~i1Lfgaji*5UC+8w01N5jEc{0tRz_{?Xo1*Ft5
z%`Z`(OTm-&>;pBm6c&?b9#ao}o-B3%J8=AS=pxTqvc{A2T$FUkxx6|)dWO=f%{VeM
zT*?@XeHdin!e4tNG+oh5*%d5ZRjf7}aYpmW`MTqLkr}*5(|4F03&#~26Cbo#%XWa_
z`*DLNv+=aoy|+{(y>55ZP!aAIadf1OsSIk#$^Ns}-qQn)kUc<WyOdJI!t?#Z(?ldS
z8bXlfSLUFi9~jQ%V1%=WW$R!dxQer?=Nx_cS;{8VqzC2?cTQdqv-_L-33QD4wR`j$
z6BrcPPK*J1rmY#W9<tap?>;^6R{-K*&2S=1ROV6gr!4u2`S<Ki@)IZSNq)kRNN?V(
z|2$g4qB~c>VRN=eE{VpGkK|>Nto8U(2a=-KnV~%;E1A946JMj=(^rwa<8Y__Z8pFK
z9-K|kS>D&d_hFrZtTRyud_I|VOfE6uA&cC33{m$qtFW;vX)L=)-zQgasUoNt;l3}q
zrX>-?(Lr;Ft;<UIVhRO*5xN78BRHpGjpS~8#t6pyloCbusR*cB!dQ|EnLnqj-?on~
zvvZ%@WX$F=5f~&(f65*uOSNR|`_Gqvk=7Dy?S}D*xpX?2#)v?9?3qda&A*9|!@`3M
z(~Cn{Oo6MMaX1^6VYDzu0|kZR!kbRUL`5X)Tf*g+D$I<hXTP96j?&{y(MgnAs4fW&
zrfXW!t?={Z(>lhqqSm5G2xXo`ZWX2gm%TGgQ4uVJpS(=jPoyr~(XxzWIT)zpl0vfo
zU9UIBgc#5zoCA+r&U=zJ;DGVTvxB22I|nD^W(PY;dMxkWA!8xRDcXSC)I%Tcj|Kg$
z)u9JB|6DK1_my|ln9~u)hbAGBjEL<gfnE<~E`BAj0^*7D-bC8=Y!>O}f_R^P+gt-E
zRiv7c_?p&mJ*wb`9Kl03rAh^-VuX>m*iHgS`H7b}DP#p^X0q6v<QBcvp!TLysZ1Gz
zVJf^}0XlZk-H>(lFaeXFhik{RFc=XxBr#WAEle;4_cumwVct#xrmDP)?^(V~YkCz|
zS^Gc-pJy}H1?GjQ&?+R~B^$}3AQO`Io^RUS<1$`$+l$7lDMm}?$<|fqG46c=&fAkS
zge6H@%xlX$K4w)yc+=c-9-G~xv{AH89e4V6caIJZn!Be;#+2g@bA#)RWbSZ}rkF0m
z#*do^&7G4bUO;@^?H;}Q@p%8)^V2+T2FT%n;UO3@egz8c{7PWbLm>f}a_IU6p1Gvh
z!j@xYq!~JIs`PqwRSn!{6c->);HPnQSwY7s7^vB`q%vY-W%d~<s3XE=p;Q!353J#y
zz!Nm|5V293CYKnGCul=y0=m>V-TDY40uPeMG!)LX?y(b`6OXQGzJoUo=-67)p-={9
znTT(HBW~SdztZ*vtlRG~p)BD|Kt=;R{W;Yv?N$!=^jTFLZhB!RT#tD8cpkKdX}gQ{
zU8-7CEipQitl)JE(|rBo8@cWah9kt`oB?IG8z1NRrB2BZVb~j0$N=HXj8`esg;r27
zG*k7&r3it$<X|P-X-9bFM&w6b7fb707&Go2`fCB<ayc%fyGZfj)$ak(xOsOGg2A-_
zczFp~z?ZL1mjFNO_Xf{xTuz@61?p)tELpLw3Tp{%3EG#2{hB!<#G-Rv<>2le=Qa?y
zVMXbSQ>9zX?lzB)PkuZ+-TA=<8Xo+;*P13npbj_ZlBh$w2IwyB=}B8<ic5j@R;f)y
zf7nIZuPE#C7=COoRjXtl<Y`@K9{!IcueUaJMPc;QaiC(2skk^6&&LpvY~*~>qD4g*
zroCGL;BcaRM1Nxb^@sh#SFcasZ0gIEGfAB-NhM^BH)Cj>TuwP)mq0sZR(G8_GZ&%(
z+FdfoKq>$|U@oUsPU&b#OP^tq@^s5p!sf_`L(Y7gm=F$Gm9w9QYxOszPycx&*&t{g
zdZVsr^hdq-_{5RyS_NusEC=8lBujUvfqL2CJ~UOEF%!wyFNnHAV=nJXDX69IA#X`0
z`lk#SxU*G9z*2O2>>jScw_HXOAsf@f2vIp>mln#R-RfH0l_z`=J?G)1h{_e2$duu9
z!}ARaYQiPi4P2`i?VyhhZajlA+}Hpu_A!{hC-T(thS~e_izUWu^(sFTNRcN?Tg3A(
znR9y2qaSn2X!=0mCn&z|6s{OlxOBTTD(@qkTZIkb6<umnoV!t^`PB)wQoTPAFn-2C
zvKJ`y*QV4c*nH?#YH0s8Wu2hJS#SEj$8NI8^nJ?1wbjIA^}u^i{F1W4)1}c|;PRpJ
z!tHIIf{*aM->n-+=x#clUf&FJ7Q3Xwu90=>*G(gyF?L2m^;SH{q>6B0Z-5C{tJ?re
z{!#(vz|{$;k`2f8<_MC4Rw#f@zzbr+N)6Kjl&<8Q0C*y9!T?7AXF!<0o<N}zK{gz-
z@BYG2-0C>CU;uc@(KMI^x~sylBGF17Q@P?LpCxARvFA{*Cu4^vl|N<Gr5hV6pik5W
z+~#Tt5RrJ3BVS6~g<u&tb6I7HWMgpZ)7dl<kLeQwJ_g2en3BYUy_Rq_w_wqV!MU%{
zt6Uu4oD}I^_=_4c5W=MqiyQN0vJwVVFrgk#Q)Wbb%IJ+EYgpJ08rJhZFRd+A9k|LX
zt^gMzzQ*^=G1Ct8?I{!GIf_tOpis(|^c@Kup{xqdd$sOOjO{rLQNBNm%(`tj`{GzU
zh3|3M@N**{@jzqdk#Da{jC0W@gGY8L!~JS^NUIBF5U2JyQiW=N;BsgWhLsQ1JHO&2
z;LA^qH<Vuz2#Tt~_PH=Tw5!bW=OAchJkT%hiQ%#ao^9o<Xu^?Vzq~(&f0e{R_#P=2
z9NOBl-ceHw638;|z}Q2^J>b))_EFkQ{f(kCuIg*L0Nt)7S)h<-HeJY@)w&x!P)+a?
zcnu$QpPPjheN-|+Eizc7XINdIOb!j?E+*;h{34#k)naX3g>mVE%oN;E&ol)4xJcha
zQ^jszL&)2WWzRuS8BR)9P{lKL5#^z1wP4tB@J}V>2ADfy(2aII$DZWW4j9$>cA~8u
zgrjI?R0h|6j_B_=7|nV)dl7R2w)g~m8ff=SvZD~Gv!Hd$oyFCpu^H^4meBnRDy*&!
z-uU8X;9N?MMm21)Yc5MFhg5C_NZLzEiG_^UQhevf%w=x#KgNJqGGD~-_M$1AvM;2w
zj;obU+!ZXFyNG_6(d4q#!g<PVm5#9@$=mvHm;+PR`T1m`^b~V}T}TC(2t_3-Aam^^
zO5~z*3^H*=Vuk&~{Zn@*^6TgTZ+MeJxE_yQ7;A8?qhS93Ee9+aOB*XB3K&c!j-b0o
zT_F!tSPWr`X*wAiPnet(PA)NEt{z$vojSPz9c(3X951jLi7Kdpf<+2CSV1bF5<aRj
zwKxM<>9(hBPY#>jQChIJ9gKr0IQ<1zeGBmm(8l=n%75*t2;G}u9O$MH*unw>-6UV(
z|5Zy$%3~+MGunoeQw&1l0=Xbi3MqhLRAwZ6m5>yJzqbQr&p`{b0|L|ok?2hOfz#u2
zFfjfJL667Hlhd7Jr{91DafDR}tCa&!i@8Ef0a_zYA%eFo2~%MtexDXp{_1Zp{E?cE
zJvXEm3bx_s4`U=zQ7ml+T@N&n&Vx++7+P1=P)AeA&04M_PigDGh)w%WC-_KUr?b$i
z`1w_HBM!I+->np1v~^lrZk#x1*)DhPbzg*}zsF##-@=%}Bpd<iy*0>M*pzYkC|JC>
z%fS1=;}k~H5|4qbEHX8-K(P)XUMFA(@h2We#srE-0`j1Up9-*n6H+M>5m7ImkBah9
z95W;15-Qp|@aR?4J&q@qQ(SXNmTU`;I8pqFh_}n$WjeW5E?uV9{9*sJ^>k<d;Pr7+
zfizne^_-$gdT=EuV>9BUS{=vE-zP)~e>HS}fgplvU|coXCMB??$=`m1-c+LgT`)X=
zb^3YodUv;ZazcCZMeYCQ*neJK{x0^PUw{3u-pJX1!s|cmKYxdhwg1EouU#dL^=}@o
z*Vn&J8XNWcgN;8wsDBGzAAR-kQN3Pl{&_W+P`LHWcIN^}+uNIce!7Y0)n%*Wez79|
zxOs!kCmW%JCZF9jdVrP=(WCSD0h>p~566^%FM3L-Dff)$6Fj7o7(cs=9$a0Db*hVZ
zg&Y}Gg@4c2F40P|%UKgL&Ill0@aZ_KS}DoPogYqjo?!sCJN1nXXpw2))9*Rx7OdX)
zK+B0eK_z?%)33Q7Bd^Fk<kC<{Z^-GC!mYv63RJ4PD-?d%B0}C`5fRlMp{k(Ktz>Mz
zgl{n5_UzK#i&<|v;+KGg@kM~@M~dHLTAD@Ddc(;yi&g9=(|7ybga)PR&U^8Ma)gg@
z3#98Z`$<EQb6&{C$?5SM&kO64B^0__r|RExUk%h<W;L;3pt<wHG>B%R{eaRZtx@ki
zT|w1wHN+?^7W<QV4-y8&y83;|<wq3nxTE{b3A`@b8FI=8Yujj+i@&@`HK>R}+zyvS
z^+k6~x2*q#+JlY)Lxq~X9~$lwOh`v;Aj6u0UuBA78ceSoJp>clBWpCZjm9RQA04SJ
z@R~`ajkb_szX$t=E;`DqNebs^1vSr|L5tk2U@)CQb!~gNE~$w~Rw8pb?hPwrpq9o}
z^Ny9A%vX})V~p9jJ5ofg<nRrSm&2;E*)A)a)c&f*uP`1<A_kLiw5v{#k6E+gx>jjN
z9<ex3q)CDPfUl2P(B8qHI?j8+KzUA72&YvwS<Z{s7?-c6jg`2QW4+UtuzSVF4qhl6
zDyHd|t1H5S<9b|m+~D0DPbb|$zu%gw#%GJtgE%WFc*@L4ZwiNsPZw-9S(^8)1z>0o
zmoJVf*2k)jtLL)37gWFuQ>rv<m}KgXh1`oQwm6_7*G^Wql82jj&6fC<Ig*;1@esS!
zqxcMV*02_)xwSRF2pNx(_JiMwz@cC_i}8rxzx+NG?r6Msxq1&pBJn?MmkKJt(vMZE
z`w-LF-L$P=McevS`L=%L1LW~7kGC1B7&&3lyuFzE3;bR0S`QsZpBBar5sQ=gQouBd
zen8(I8~TACc`0zz(WTeO;^oOUe^Zxy<n5Hx|1l9`G#;m%s0Wkqhz+y%TMxTnpoZB#
z$H`YNY6<1frdT2==MMx*3Edvxb?AG`_xWI0!Gn(okhSN88p!xPftP_ACV^>OqJw@r
zn@%rrJ1*9?f$VBeIepXV%NCh|v00I@u_PFpU~{K0gVrp-TwzuzML_(q8EL%`R4k1+
zni82oToCn_2=$kbhu}ytm?@1O7VDHC<?`$r20(_+cI*bjKWj~|$35poG$lu(ZtsJ&
z+Q7D*(e(7v$Sxd~cQc$`QX@9Sc|K_`1w6a-R#j@1!e%_vOEkYp?m7kZv({ub@{Udf
zqQG<LQCP|ylI%+#5-B(BUH(r!Gmdy4b|u|79vD~%g5mNrla-zsZt061o5SW`ZhvxU
z^gIxPFLQXHgZ{96?t)r5h~90TwI`E-sJ$=ZdcXgn^E3a#=Z-46^A=7tf9U3%HRU>F
z*!L06v1v7mVnck4+s4vzN^~G63<G{ldKc~N!bSDN<9%Px%KS5&MQ7M5>|u_rv%%;l
zx}%63EF~ok^?Ca8gfq%nC6Pa)#XE|faV3cf0HDI=h?KU|CDjOkL-xJ2%|^b>tVaPK
z=QbKJrU53V`5|QBaL0{uqr`C1XiJLbdHEF=%yT)doA2eTY(6)vay>vA)V?f5LE(lI
zDqy`xN$1UE&=3$%k3G4>15T+DjN8?Lc0?_NY9xoR0H<vGN8FC+dSDRIh#PjqJh;Z~
z2S+lIN&7uzW;z16fT7_QHpI9w9!=~5hcmfbAO(rf6D64bq9<yhEuMdp=5DnE_<Ge^
zROA=)JG(>kkC}>lZd!F@CVLYk=jSXvn|B1~Pq`IpE`J8^4bk-vGXPZrmdjcSx7b3=
z$>uar_0aRp`baavSvB{NWf3S?k{BOqM?RF88q@4*eb^gqMinQ%;v}qyZzf?yZ(Hm{
zA&B<bW*oJZ6{LCXjfQUnZJS;bQH;9@#aF?cGn}hzHs*AyZ-3q}0kw2!7}HJ7)Q2w3
z0DAtVeL>Gu5iXpw6s|pOKOlUD92ssn;k}<Asl&-$dfg&ZEmvV!6%RdU;Nb`aQ-o~e
zZ)#Hkn+j%^08^T(8y5Pk*J)!y&51hhYD-n$64VW5I7~<9KHGP1w7iKnQ0a(lzS}Go
z)!3{(S|rmLl=oInL*!O*-w}k?<m<#goajSGa(oQsuz*)H8pmARGmIY?Cr~(D9xVX%
z1bdCZ#NQ{Ow3bK?!gh}6aIhHCZ!GQ|=Bf`+Iy;<JL~uLg7_RtrQq4CbGVZt;ImQ)0
zG9uHZhRjcB3>EZ2gB9j^EymUf5Jh=#>g=j*Z?Zl&u0V`yU}N}{{jb`Y-tV$ATesbs
zrZ;)_zA8x4!SP#;t`1qYn;M@``{BNOdY;>!#%<rb4K%nzN^o#>6DUk`1j4jYeEF-I
zTujUuAf|P8%Hkgl-ZPhTU5f+(0a5gPdWebCLt{GglJqZ+Vle6bO~GVZ_i&<}+6JB+
z9UU}x4qXdpt{M*Z%vDq(9VV!O#_Gwvd%FC-!2|R=etptB-rG6dam|i{X2-tSsJ5@D
zOdlnm3~JB(Y;s11#BF$r9yi=q4w!S_ihVqf-fK1g(=nRHb;mK!Kw#!W!O^Tvcb-uE
zMKh&~U`iLao6<$`lr9RV^a&%64Rg;s!D!vjMxbuOffm~kT1iI<$q4@;5!$fv6?9lP
z5RhI1#y&?y{)ps#E>Wo4nb7Pmk~#CoQ<7{!(-df7l>_Om>PC>p3*I+kr}W;i$Nmy*
zf7Ru%&KU9?V^UPwc-3G_4M$@T6>hOKY9|^bb22voKcuJkth)+6uN$cdwdTbJTBIQ*
z-7f%x-J`?Zol|4IO8Aji%?o8rWwpaHcZ*yT{CaI$XuS<#*pz`sVhw2A>9wKvIEq0u
zm1NBY<nXdKl`X*PWg4bM+X+I{qL@b47roF#=gl!>H%T-OEwJA|#^BGg!I_$e;YUd6
zDY6FzGjpPO_E2@+sR|FyE5P{AaGV3Ed_Fbi_QW%c*v5PWln<A>e?N(Lc0{?DM_!6*
zh8d4?6pzz6s&1iJwso@q*XAiK@N`%$5Jt&b$w<?y-lRWF-!B=V;gqT0SZc`Y!0hH<
z$@YyhB9RR38M=XOV~HAe>u}i63M@6!!e%nq#&8I0YgLzwlMXP)29LOv(q$OLi*VVy
z?2NA~JkHfAoco|O&;U12GO|XX<@WXnXzfCtuha!iH85G^?ZuShYt9D)xUtc)n-->z
zVmrS&>9f^y5+PaY-L)wbsKIUH3~3x%Dg1L?&(E;epGMx=gduk(DElndOSf}W?pfhg
z7!~TUJTVnNbE7XftI?lMUdjP)R=jD%8H15G%c(%mEJi(Js*hZCTx`usCtsl>6*|6x
z4XUBmC}-Xr<qT<}j{mJD3rdZpV=HvVfUYlFJ9~SNjC~F+nNnNrZnrYR!~rmZ%>vIH
zsD1MKNm=b|c6L+km#+`XYG2NVH`U(T|GuntcW`xM-$$kMzD#eN_p777l+_-m?{BL8
z`tW60?b+xOYUgU&lw3-FZ-j-^wZdI#(dCH%h%kk{0U)^OFV9+SJV6eDayhjdVAI1a
zMS*3zGf6Ya0R)Q#<Ul)nmmyv7me~z9TV5v1LA70*;90)xvErOOZK`*E6;h$&oy9-;
z8pk`8LG?}rsg+e1t9}3j=BT|up>tqGPE4eCAG@zYV?&IitcC=x%_rC<$K1vo5O9M&
zd5N*_pZP%g16F1ojdv#J#~fiv`+q|HyT*2NjqTo|vE8t-7q=YRi(2yY-8=gyFDiC$
z$#==SRZ>hv&mYa3$ctOfB-i(DN#DB#eTVaY@#Mp;=l#x2;{&zjVWyi>)~kcsxKo2x
zf32Vi+$yHVg+oGTYkGl!Gp;!jOqKjewK5uw0f|Fis5xV|<kt_IA2&5fnNZOLudY6w
zA0QY2zt*Ohav2s$Zx(;?KyBXZ&7#*Gdc7OHj)W(ZGcvEUPde4GztX#55?>B@#)FC>
zLW1ddEar=SG~Wr+*cNml=}IPC()M@<m0Z3hLN1=e(YTUDQRMI)qB0STAM6g(Y&L-c
z9indds;6D?clAn{g(F?vlO8ZOlj}z;cEPW#5A_~Ef?@~R!K^J7gzWI1w~p)}-FCk-
zl-PY(c5NFKy-2=cfe3W&a%S+(aBX|MwoT)tObcjtje1mIy-al8IPAw=Pp;T`p&J&=
zO$EG4{&-n^#Tb7k_mhe>o{WR9R;xDXcV%rYXU~buTi9S=jOnQiXSGT?n~tMT$#=y2
z_;5s`ANQLFdrC5Q0W`?Gl8$U3UXP9_Mi08lA|Ss9Mv*QN;P2goBXEUbM2Jn#5>|%O
zg~CzU=!!uNt~g#Hn7*B~y|Av0rx-7*O-H5)B=G<|8_rg;<|#sr3j>(1`gluC$+#wd
z<7YgoRreLSiF_kc#rK83Fp~~(%7}!K;ekUxs76F%gpLFH@#q!MQQtSMk85a%2<M-!
zUc;D#KE{#5tR`p9x9A(>o8y)(qC7Ba^vokWdpm|qXK<g5UF<&!vWX$~(SE|6!V1*b
zty)lBWN0J^^&<;!j3*A5@Z%&qZW5!xQ1Lsko4%yuu%H=Wn<wpCtQXAr^{el9f>BYR
zP8g6`sm;<ILfke(VQBW#*_*ZPtK0R>0on?d<b1Pukr*I?;rK|Z_s@Aey^$S8AjNj_
zs>zw%e!a~COHFN(ZngGppb%yj$xG*SLHk}4ir}_Aoh-J7pS(<R0Lzvti<XLuf5Iek
zK=^w6J%+@aUCI3^FlJ!#O$?MQDF+y=g=fH;mT{Td?GDMwP1|Xgf$-o9yQjBVio@n#
za$U_mk7OX?U+$Kl4q-i?t1}AOQ1s6l&;m&l?C(z5mhbWf@@y9)MBQcu51!g73DHu3
z_M$rlEx{*ei=0$ErJr_&NG#&V=16=a8>xx-<Tg`Aamk!kv)Nfq#45LFmBc7>TD_dH
z!V${dqE!;F%xSedxT=X5<~CzJn!m1>DX%M(yG5%cj+xWyIDKCevCS=7B{9un7jvFb
z3j@rQGi95m)D0pbf4PS&nC+;X1!Ks9ITg2bBN93~jq#7z@;mL7P<pIKLfXh=wM1H4
zVl$Ew>5A7fun{%{S!h~+BNf#=%!gT-w_TxnI=5S;8qT6^g2GeWriwZ>j8qAV?N);g
zjv}RmJ7D`gIX&J#e70c6&cxx2H3qlp)2GgI=BlwtqyH#$1rG~VbqH>Bc>saR9=HsO
zWK?k&1e)Pb-ijKVSVC2os&e{E(Zs5Sb6OmxS#S7duGQcU@<AdyYiD>}byy5la#IHP
z8}W}KF+97)A^4A%uk1{mL@Yr^KpAp&Th^)hpXC_vMYuXeqO9ENm<^-sr)Z!eRGP@0
zkwp!pzIMY)CxtGrraNED%S0BL?!jphITsB&uz#Z+3n{yQ?hFbE(s%}HBlbUS^ry{}
z@HpaN-TeX-94f*Baq{iQcKZ<lsec<fzzp~-H{h6m4`n40J+SDMK7QilFb~tMu-{1Y
zSO=2|1#pzSS<He}>V!o5neh<A)YgM^mIcxibY8;J<&wVq1x~(}(3-ki;v(uGi!Sw7
zyT@?9#`mfhF^6#g6I5@fDlT@`92liK6kDT}0jaw&&_?LUn%^Tol-+nBXz4sn-c!Jz
zUEfgUtxR#5B$H^1gYG5m?k{Mv7UUN9AIYc8@3zD3@G`)NQYa9UmH|^dsay_D{)jx5
z=0>92vSs;Lb^;}t_2Pi~djO!3j6^3vrP-R@Wig<&H5P{32PQrEBg$Jt;Rhz@UNRUZ
z<6*l)30>T5(@`%5lU=C0KkBE+N@t*uK?j;Wv$ZBS8iN={o0@$H;e^?Egk1{4z`Bs4
zB4a62=?qrU;D^dZy%uEtG2OEg0R`722_kEtry9hmmP8_Tv!?>*TEGl6SxqWBAbPdN
z<BZxMg$zucT}G+ID*k*d5Vwizg2qmy+rjwWynx;G{V1MBbPs4-HQ#L1xr*<%Ja}tK
zjd?tou+7#u?yO8DAhv<3#!~&&`Z!DwTQCxTK0>`%G+uyH#jqTEZ`9)m?;K1c&8G2C
z8A+`LQPMqpM}-4Ky#U(19j=Xg`=5v>T{h^?#FA^#T|V!GMW?G2TZ%apV7)Z+ST7pQ
z+M2(IjqN4wP#z&nW+T+uC2uc!liqUVzHHZWlsa=?Q^vR_UH7s_Zqs11GtIIX-{7=j
zH(sLiw8sTyjCO6M;$qe4Dy~uPJhXsdVl8N;805>q<LS{cI<s5&FhZ$p+8Z0ORC~2i
z-7G3M=zid>^af&DrCOs_B<JX;GvPelIm~TZ<EU7++j>k(d(WK>X+QbSdX2z<YTQm<
zq!51|*@{%Bh7*eJ+qsN0Cwy=LeFFFhr8C&DB!V52qL`HWqxO(j#3ZB0*Tz63zCIL1
zopbMlt#2zYF7N;#cy-)-RW2-(fVyfqkS{RSJ;Ti^EhONCa8!;Ryqpk=v$`GQdA|=5
z(0N$6=S(9xt}Y7n!$TEX0&5-xxT`6Pg2aUt(W82Mw8iAz%9gwdo$GQe@Io+pt8RJ0
zZrdF$3H8>vU2nAV^E#VjtZ7cNe5YXqGR!X{Ryr-fMobiT&IoQWyPffvp!+r#P(lc%
z&KXAfiEvh2qApukS|YlT9F~W=4}BWSbqvzYsURyH3YE=4;6w&Qf{_OLSU}i`l?4=a
zS9Gb+nvht~FN?boX?+6ex*DqFj*mEBch0KDE}gGEv^@GQhmh?0pvMK&R1f>B9#x*C
zc%CMMcHn+67f@JsQI1GIRhV(oJU!Sy$w_lZpCrvyhZ-Z^lyEKK{iIGJ_5vA^(_c1i
zq0-dFe?s9^ASbzD(?16Nbflk-ZJP|fY%rAA)YiwN36-BF=1iy*M=Sj;WPsM{)s=&%
zXpeQ$deuB`Jw14R@*Kf0_Q}8++ZetDxr6p((!Q457`<LMV*;PNC?en@UCE^9DoJn`
z@?mlSzQ(3kfIZt&;1@apgt18+EcP~XU?cLiFdgVs#Nl(`=#MsYu+0H!G_($CQv4{O
zy*Sp)|IgmPH>Pnc3FGkluk<M<oJ|B0V1eXIB+EG%VMkBUWhIo$I$k`$AWaMmhXG4E
zS?_0m>(;lqAY?l^yZZ|#$AX#e>gww5>gwvctP+pr0e27W(~DL@8nYzp2iYPZtjqJ1
z<~Ncoi2TuJlav0)o#-Ijm%ZOC4XH6toND8WTi3b*>fkP3c>!Ny>v3PA6}>`>f_9(V
z#12s-X$zAHK7wN=0^4^7_czQb`rC7;2!FP=%ES*6c{_%VeHsP6WNBI1Fu78pv?g{V
zzrD?|BSAQC?SW5Sv*yb11_LyVOB|OonkP~XVFRIu>P!U-%|XV2lXcSt^H*D-iWanQ
z&&$uZ*7&h;4*1-2yi90<p@225vNTPJiD+{-t(>W7<qX1?iHVo`{>&f8S<2^x1}^i0
zJR_Q4;^Ne@=KO>$mk+%T*RhV-E+_q%nE0$!`ptXp^=Rs+Cq2HKloC@iah(8d{AQG3
zm{S*@<V>Z^IqujO`b%ox$M$ppiGOt@?f;#hCGp?=Y4~LVz~2-9eYXzp67k<3Z}0vU
z|NYPS*zw<Kz$pOy<Hr&Je*4*@?Wd2ncfH!Pz1`Yg?OApJ_{Q1MgM+^F4(CRAAN%v`
zR2+CX65SsM9&mqnAb9L>A`JYO3JpIFk}=yegT;T@u<#4m>&Mf)Sn*c$CX_J3K`@!W
z0YL#6XyM;r6!#=S<aw*zYFxD7S3wAQ_RBejsDR)9_UoiT<r|Cnbu^1royKM7`_uCa
zyTs*rd(XSMxv3)IquCX`!6ZY*xe3P%x5)_x1c-T`T+>hScX2|YRm@pO^y28Dl>$SK
z6Let4s$mjTNH^xL<xm0)>K40_8r1WCcj_z82<u1%ySIe*-P*T9Asdw!;8OPovn=N$
z)WYe2@~HfLVNQEGNT(BBfl8Tt)(&>~>bc{AVQ9t0v6%>OYb6qdQeC4|R8$QnEvuxi
z#DnCR{rl?)Z%{^_r_O6QC!hbqVJxLHDLlWDL^u_LbQZ$Wo(h4CRh_2QohK8L<)}DV
z45A9q9XOBH@@d;Q2R*I3p9NQNmYta#I=X!8<j14)(-SGK1Q>nVQ5TVm*-YZWYZ=Bh
zfN#^$gzw*AfU5R6MUap(`&y>4(6H0Wn*bvw#(nDAXB7-t-JS#wgCJzKa4X6<DfIcm
zW)Z|`z4&+DH>#8rdIOa!wYRB~dn-*m6CO-0E!LG>!Jz~?1r*CnSIl=ycoxv>r`r#8
z`sZMRr$@ZwQI|f+SbZ{hL}aCFhtc4iV-nHSj{(q!a28EWAa6_3y?+p-Eo)Zn>+UN5
z#RjGPWtuFHwG`zCLyxGz1cPHQY+~MLN1g<BvW_iTJd5sW?O<M>Wc|XTqX?HcHAPvk
zpe(ZmN_)|~=ro!?pkG*unZw#<z{%1o5EsYpRk`&5H5Gazkzh}n+_qvFBoAWNO|zaQ
z7Gq~lLxp6<S|twL5{emN-xm|B_jb@Oo5pHPySH@VY}0o*i^gR;Pu4uj&b&!U@1Zco
z#fnOnPof@zxfyPIcjYD~?mKz<n*OqZ9@ft+G>`1f1%Kf;*iaZI7Lu28IMrD~x3jW@
z>WPY76=<l6F>rw8mokV<{mY~)fE)!Mg3*1XWfZW@NmK5GrCIsy!pFMJSL%A0v@`Rm
zKM7O$Qrv=6WN6ajm^aaAkg;gsDXKgu91PXPht^NjV-d*xC6kUoCy^Hn@#`eGVR!W`
zzG*+nTGj~_4?b#3)Yg`PEN{?B$?SoO6}4;GyeOkbbb*9fBuPkCur&xJ9@Lz062MP@
zQp_dBK&|OwL=hYK^pWItoQFM&6qa!0D%*{Wk~alY5EJrV2CpOu%F_1dh<4PiE(g3x
z2utFUX$z^sTCrUtm1w1l5?rOeePLiKI`UQqY8AwMtClCDJD|4?JSxn5{9U~0p$9jH
zu%}DsBLBgNrNNbtA?HgbCt+f4WKv$tc$QIKjKeZ!HuhXg>q2yw3A%?1PU<5>-`X;}
zN6A%{Q8Y0wY^PLNr9YgJebxT(*MEGmt`YD4hu-q`y??yGfAB8E>EJ)$KM8u~cHGJm
zv+DS<QQ`d^jxu^lsV%3YupeS*;g}Pm0f)ipwR4K%f?3&29BmSR4^mRTxWK0*M<q@q
z0)l}oiTedgl9nh~$lQP1D)~<IzyXOIHj#mJX=RDiS-j>7Pp{k>3cFO&5=zaDo>gvN
zQN(d|#adQk8k1YgVj#wOHcAyW-F%)pnw0cSIqjixys$3+lE~QI&qV5>D-tDfw(xiW
zd(V=`Q=`A)o@niJejg6F#%PUg24K&tyzrW(?9C26pjKI3dDBy!1|y18?Vi@);K#vL
zPfsvsDLcO<<uoVmxFAG%nX{r#GD?>xmlv(WMB3E3S_IS_wv7vsMy9})SRD;JelvfY
zebNczzOl^wY^qq$QvEh9syvEInv>(46>r^E1}#HDTlhqnA~6?->?DV-MhXXj<vJo{
z)+{iCzz&5Jiqi}X1=-ETLFEQtip9fvPd>6b=Xj(;gN{%aZ9UJyNd@=M#0Z<MS>Nl<
z%&4U>qw*!QEl2gtB6W9J)za$<I}z2h*W0#HsqFD<J3&DN_(t`d&VF)F5$3*q9JQI9
z1RJ{JOUz_WoTX%1N+3KzKAbv06x#(*(<A@r6lN1EFC6{<F?y}rbIEl=T%C5#sZ&|v
zA`^-J7|ut&@h;nQg14(&s#G|c0(LunP(GT>gDZ`5D8K#$q^;na3I_?xo=mB0Y?>n@
zgsJ?nf^m`Z`lOQK3dF2*xZBxtA4HcZ8U;C%|I-+?6_fg20U;VK-L1+hzU?NurmwPF
zYimW7YS<yYvobmGqzX2?!7G*H&vHIhLCua(?Nnje-Li-L5X@qfHikYN8|}DbDg%fP
z#k$FvN_6<&)UvaNj&t}ZWqGEOChyFVV|$__U1r#yq%cvT%(L)U(E}nAZdj0x%@npL
zfC^U(jR0#xAfF+bxse#mNT)*~C;=*sZg!x3DZf}+T;e;JGy`q~hbWy`KxHQQU8!q?
z8ul#soGI#29Oz=kB!vwi(RtVhwo9u_zmYxnl2P!td4?=krp}`;DTo)paz%0M8wEt(
z(;jHp#eQ{|amo{}vyyoF*|RS-pD@LUo>Le`KQ%*^W{ObzL2?ijgGi5qr5Bz@S!&@=
z90AfSu)fwAfcbUyvS+?;j{wEYyl3nE>;Z6B=(S5lQ|#5{NwafwY7%~!d6Zi7-=DV{
zhlZi#!qj89bbu2p&6%5aSMM8h(HS_okYlgdL~Q|a_k_m4(RhHEn0Hs;syPy><p=0A
zvfIs+7;RxF7ZDo``^xJRG0BkwZDDOyTy$Wa$wPELnONnBMz#zUm#xfanHXjW3yCoP
z3iDASjz7TG@qj*~7b|qa-08<UTZ)!NWQIzsTC7bFNf4IIZ*fuykd!+~(Koywwc&Wa
zN@`2|d;qeCoLPLD&cX+)HbbYKF*s1rljEC>B<WrO83w=Xphhj-*Y_2>j_!lGeX%>d
zTHl}s#lI+G73$B!x(xM$$)Naf5;zmGFOCJv?{<e1=XyR7H~Rj*W}3dy8PaxgXxdH=
zWzQJBDEoS}SO-Z4udhk|Y`YimazBM0EHq6;7fpxyZ@8|q(wV%~sp=<+4OnLXntzQn
zX|*RZv@(Z14gg>Eqau{}Y^Jc}(Amplv^|&6DhG6tl!FP4&-~h-b4IQ(_G&B_e+~<_
zb&E-CS)7^X;X8Hl{gmxeozfAN<(K+y(^=Q@D>iS0JT^?g*y7SOs(#%&3JkDji5u;O
zf3LuCm6MP?L-5PunDYl-t<6;*-PoRU`?@G~b+pRt0BA#sw2-H`usP=YRJTNz@;<ox
zVx836IxT)m1Fp7oeDc1OOA0Rh`9d9>Zg58YQ6uYKY0gVIw{JY8>Nu{G%DFd$5A0Kz
zJIvM|k$-o6|AnyIw<xb~re7#x>cfY2Kl;RhW0gYgx}1=kWm!e>>OVlxOf#a96){)=
zCZM0eAAue^w_jEVfQsT~ZDbj(&Fqnzna*YI9q6-_mCrOepuOLcL#o@zIGXl;%RQWm
zbV=>1@r2@5vO=Yfu_AHi9Ww>aVpTZmP-#~dwm*MkaDSVss&s<mxht?MOV0JAK|p#Q
zjFkm&#*iyOHPu$Wq?c!biTpWbJiM~8$){Ox+^>+(ng$_gCS_bLmTgMD(iF&qX=yU=
z1t>ZW11`mc&^FzuK1x~O5>qQjdytw`tF3=YEagfc+B^cpkUZ%l{yga;L#VHRu2>T1
zh$Z!uSYl*<$+tPhoRVZzhk+!lsK~4E{P+(PU~(;^{&2}A&X;TwbX38?kcbZ?9moXn
zC(AjXF^853Ku$OU3NMh9dn$GFRm-`FkOZkZ>6!N+8hxhR^cfa*%LJ;-&<(aMwIZFO
zY&zX*Z>GeS_(5Vzp1|@Ty4@qU<ZW*~cHY*J>QNtO3DfIZdQhTMo;`7nNumLeZHV~s
zK{A!TU&|J#pp~%>&cafRll`}eSCd)84PY#}#Y-ko%)a_jxMT}u55a{!^KTZbVw3V3
z%M$Gz1Tr#0E}7C=3ajN#?}vzB%N>rsu(9omlk(vbT}pUcVqCkTK<CPC4~LhM=Ztvh
z%5mik$ScTpme8M)=Wt46K8CEhtWu^&`3<i!`}7%rrNVck$RBKwMD&hBaauCsY%w8s
zb~F_i8Bu!&Q$S>ic?{@H2yIR|_`42>oCptMB~*K1`{tIiyvp3fk2L$N=6q;TwdYRH
zBECqpD_(YvE3jZe#Vhc~2g!VWE$g_Cb|Bg3{Hs_W^EnQ-wMtbi-uqW30g`}eiGHd^
zbOTsM%-Qwm7i|C|I}94zpF5S41LwZY*oI}Iv?Ttv?@c+ZOE4e{nJUf;4(v=}XD(Dy
zK~w?HBk$d?%kzrlMVB-->7cRwM7rr=Ch1v^ycmdkr`__VirH0kAH#uekS0!_Bi+y!
ziwKV0o>nP8U=r}JU^e48Iw>r5*EuC4{+iBbgK#+P&i}w!LrEYQDUNVPYe(i%QU{S^
zOQ1SsR1vvbh6arR?6kXSq~()-HGdkro(-IcSRw?|Eb3RS==f#=d7esg$pbyr%Yeol
z?|8~CI*de#7s|tzhcVxhk^H!Hxir%YCTGPottFGVXp{M&Rzc>nX|BF*@)k~V<s@$O
za<ApKmtV{EO^ovV3pGAy+Qu2VH&f}0BWM9pHZUl)J<P0y@k-BDn;6buYZbP0P9yzH
zmXIE-<%G}R1&Nif*NLKAzq&xb*u`M!gm31|c+n=6#hPuE37s+kkJ4sQ`0G6I2V|#<
ze^j?|Qs>zO*ea9$^<wfK9aNY~|8aEc{qtVha55xQQ-1}56uv7+jsNIkI9gJM{Ijgl
zL&QoMBvh+)>d#^pys(yO<Ws4Jk!Z50_R}mx!>$|pV^htzo|yjYL+wLFej_O=x`lDu
zwhE*nvPp4C7!#AUWb{!LmYBko##SbhwlvW&YM(+WJ_#|1d@tm-N@r|y+}HlB=U)Yt
zegqqZS%2EuIduz?a#zPUH`o50zqw;zN$ni;Le;y<7>X;o7_iSo2sm{fdfmL}*r9o^
zDlc9)@%}izX7Bgo#?RgM<#Fry{zLTZ=6UO)(>U)e0e6MdVD684ck>`#1!VKI-EK84
zkaRE^E=Hp(J9x@+5SJ$w0AS0no2){Nfh`B<raHqUNf_JL`++dq^ZrJEAJzY}wr#9+
zc?`4*y3-l&#S5>ty*ffxa>%7%zwx$jcZS220AF<Mc;BN%cN~m8jBHq>t(6}L=kcCD
zxADal>7&=U)4I`ZEFVc&*E)*0UWl31^s!S+VG;#W2)IF0n_Uc2ZH+r44ppxD9HJQm
zW;8FR{vr;Pp??5J%V_BJ@A{);Xj-Me;7BIn6@^?+B&SGZ)Jw+PUpgMG&ROHq4*kjv
z6263^f@_|@YaE}IhP&0l5qDC8S`8qn#*2~Dggm>i5zBfN!BvDpk_z36rbZ@O>AFui
z<T#A`!D!@90z1D$ob4S;PTecm&*W}9BlHd@DC79*9_twiW&^^nPaB}5iKmEFS(_<^
zvS0B+0iR=V<P1LjiFXJTYWYB2&EIC<1!zSRsVSj`9m^sid}@zyiN{0@AUQ!|)ls|5
ztwPPo)AByJ%e;%x#O2OsTQX4c#LRQ;s)Iezot&ULrEd8TrQL2uZpOw*c}YMKOH*gM
zUYt}CPV`P_a3l2x<LUe^;qS4cC2yfnCPTSpqotBtQOhtMlW2a8Ex`;PME72e;j0D(
z+?Km{@-G@@pV;)t!PFXN%w?nlmfT#Js5yK_80z0c@nl-I6tmnwL_M92rG-}Vtdl@d
zA*D|*E>?KP$<aZjol;=D@(c~d#M{K?x};K@iwvq|%+dufZJH7b<ynBhvQD-@l||Zm
zK(Cb*jRzO#+#;-69p&xAk-xa@ieai(6ct)1>$I#71sH%mVSYQ*rzB)zTHYUGcEp5d
z1f9-RN~%y#sUe=+!?>xIH32KuP*RwnI(I^W@Z2bPDcGJ04*$*2v9Ybx#8yVi7YfeO
z<`z|Wb&uMC1IT_pB2x~IzXB#hD>^vhQF-yfK?Q~y*}+sImIE*<CJbPi!8p{^W0mHs
zI0m%kIBeF2fu~IStOuYnCa#=vt(j4Db~4>giP-EnDt11xOMT4FwpaO}<Lu{fzr1<O
zs4pW<{KpVSt%(dm4a4LnZ%DILe#xLPF1lsJwC`W+z%EeUF&NE=&0<!bQ*tG0|Epsr
z|6lqniT_Puj=w|z@a6HpYqjlKJsJP|$?lWC;(z}cA3Odx4>$z?ufc!SItBoL`lwca
zRDb5xcK04X+uPkq2LNv@Zo^UN&+e?NRCuqW?*()v5aAtpOc$@BK93(9GCZCS;Hc;Z
z{>C;R9{Kx^2;mJMEr=wq3Nnuz#DL4nR3}Kf5~(W+{e)!C<L;QGM<u1{%LoQnDj7L%
z6i(iYeGa?kl*+DE0xR4_;!!G0E9_UGe`{e!X^v1`qMEdLbf34w6dl@sI33zwfDR*}
z!?ynI(qVKz9hA!zJ;7*seOvINr*ADoD3@%PQ`qJW(Wq9IN<zvlKCtM1tV|v0d49ha
zA5_OVe+^0hA3zdBNfo~=s?<3V^tDAUm2u?v4{3aLqM76nv#dgKSsD9;KH1V8ziys#
zpqkCiDayYX6k8_<-8UVd?%PDL$d1({2nEW>MM^vgU7tsb5BRcF!rsEM-9pFlW}D)B
zfbh*!Q=??$Z+d%RYV*Bqv;dywb7tIl8chaxFiwZ3<4cGEI>ld^F~Jmgtn7+W6^O4L
zr6K2mab4`D%Bv0a$O}rxYikizQ~+DU#^l80Ho@&&30iscN7OQN?%JLkQbOl>##u2(
zjgpyBYC?_u+52F?z?)r0{>qtdL_x{IM<>j=SlN!k4*{mmPDUQVilhZQfZ?A?&1)YD
zhI3UMwwY-#^QKW88igUxBx?yMG!|7jTg?KR{8#Yv!!^*J0S}@DvLakR0{$Jp-tfq$
zRbzxO1S<`qsvhnq3OP;kv`tsiudGR#2Ly}aG`D+W<Am?CmaTnx4uUrHQWmaWQbwKe
zrBGNx2=mj?^HG%RC3H_V<utMH1W^a>Gz)@E?v&^<X_Y=GCSdVIdyyhb(u>q0AkD5+
z7qGO2KCL%I2N#^KfDaVUP)cBfJ*95Dm#;buF`vnrNWq%5Iy{rOf@Yd_v25;Xn0Az2
zXwD@1DvWz0yqAwkYR;tTtTmtpy92%YGbRWYv!_Rj(ds0p?nGEhek|@JtxArvJT^yO
zyANg0?3h$JYmXHsdy~okF!OXGu&HU^Mx0obLL7vt$a{CypGDE!C5cI+AlfA*VvuB>
zC1OaqVPc1%$N3V*Pze}k=ck=h)<;xcytf3NA#1GOD=7<pPt&ib)@zE}n<^nsx2;Ej
zOb}ucIQOw7v8l(HSkU@um9SbdY2ZxBFz$YUXR|BonVrMldTe2nKpliu0AhnRPpqN{
zfDbhTyC?{q*>B=#G3(ouauwVzFU%PCvL18I{h3keESfSHWqS<D-qD0jd|<~_6C+)3
zsw+)(JNc#G>(cL)x;MYDB6K-959oBUq#hH!oEVm}vRG<I{U7~Vetk7-%E^faC|}4u
zj9Z&3ma>K;=X7MwK$dX~PqSiQE2_V9&w+^)EuON&&iXh9C-;Ekq7G+aQrqbS8paN#
z9Yyac+V-R}zxFV0oRzoNpCgM3ym$C7hI%(9Ztw8hMioJv(@c$d4+8eBWlyplOz2c!
zp~jh-;n>0aTFqTPQqpS)ipWo<770mh>LjOlo>-c&JDC~sCVX3^z$DW?>D>EH8VfoX
zz>7qMU^1X4mDpe?(#P2LcGzkQSEWjokb2e|%Y-$pwRf9_zuI!kcxu=e1FnEC^2Wbf
z6ZO~UU-4O@|HWuYVeboQfbYrw_+-0QOXz=}*6a1Z^uK?`$JYO<0WW{>YSr3KU2;Iy
zwjXUjepK7_YLEAJcK2%Erd7bOWlaYD40g1zHzQ3ja91%#z%#keT47ZFPW|~jm`y5U
zf8IwEf(I*s`>04xC5aThu=6a8Qjf5I_vVshIwX|J?W33XWs_Xo5_mTyqc6{JyY$9B
z2<K$;zL=o>*9Pj1U}J+#0a!eARJFLkr^S9r@%v(tE1(k!yeYw}l685`R<pBiDq^bG
zU|WGi;cc5Q0Ik?)H8{YS$WB(wJ934!bqF;_g<$+Rrcpc#Mrd2(JWB_lqx0K{61=Dx
zq7*iJI`xY;4t$s|JyieDF)x@5OzsXS5Bu$Q2`ge+8PjA539!X_Y!#>o3vq6p@2J9_
z3U-{JUA*YsM>{7h9iNPr(b7<Y#0RLLs8lpHEkdIQcCsdRJXsIz;Y_WavRA3;niM9F
zT6^x*O1fcf295AuI20>M8}_pVqysGC#@w?5>upgn%ya|AD)dAAbm$DNtDqG%pI-}w
z{5hq@V-{e%<Y1-w{BkiI!UF1j!XVM>9@N)H^F3QlGD00bmGK7yT9n`Ppv!MYZ%u9N
z9DB_arSj5_jiQ@mFv)bc<a_u>c9BKk0}_BoEYzwocDp-|2<IYmB@{Bv^~!_0znD({
z*L9z8{<Q9=W_4z|u`fBJLrHh<@E8+F;+_dVsZ=P1qC*PR4$XbVYCdJ~@w)5}<FdGq
z+`}yEXzh~bveSqxq3>a{2;VSTHbx5-tE9%CAIP>8+B~<&y(>{GFQC3^Z{$>dL65Zw
zm)HoiVJAgH#!E153==7z0@@aFyo;#rC=%$3$4G2hHo5YE?Z&7f1g|n_>H{ft-DJ3u
zEjk{dNH&imIId2v3TFJ>?3$D1HS85PaaUYY=um47vEB;N63sCM%A8y@WwO%2ngt;l
z|8xX(Ib26W?J*|=wKI0OtMMLoQp3(2xT!7?SU+n;hDJ#a>uh$VZLqcc2gm+Clmogd
zYj_&=f>Y7rRjQ(GP4%Ev%Fa&Np<hvHwdwU7lhd+1eaW3I;;&L$6Ut&9MT?Z1CGTZf
z>27$bmwHxqRyQq0Vw}^iWm;pIF;qlTmBpx*b@MNVdNeOAYkp^xg>0di11n!K<r)UB
zIo@d28d^+9^Mkh1i1`%=xJD0FSe=)O!tM8iPx@fhvqq=WIzRD_8=dC&M<=iG*{4A}
zaKj@s8)x0ilUGM4M;G6>4%dnxkvi|rPA`s--teXl2NxU;c&k*c$9NXxvHU%`0nGa3
z&Zs;>@cIqvv98-TcTZLVQFLGX;}qZhy1h}#scBCn#o4X<Y4Q%T7)9To&e3|wE8^UU
zui;1rD}OOjza(v?bd4E+jU4rco|^qf(now$z~4|XhsMu9y3XZ!>jG1lSybA$DBte3
zE}Cm=8((keM;B+U=24@4u~zucf7{&pu3CKab*11gBU%()Y0WEI1F$(3hkm)>8=)J*
zMr}jSemr_%fQb>Fs>U&9i@=n-@C1LT4vgMbDF?_wVrn?)d8~DUb=ww~Q>c;Qs&iTx
zrFepr?am{0Q|k7|>;jCcg|=qg^b3Q2(U%vvN6Dj-R`WXj!<Tt|)TpW^?(eUtMO0r3
zC8w8;=kN%xQ*lx!N6juJafg*R=H}GwM(oms)5iF5VfWDF9EKWKiq<n{U_ACmK(TRP
zaK=Mr>_JP{UV+%_zqgBpufHyoyh2HBRK_f2t7a6_g3QL7jZ9Sj6V@yst{@B|(Wj5p
zm4olSd%Izq%jETA)t-#QnDWA#e!NX|L)s`3K{4zK5)v;AHp%oT*({>Z?tbsXsTagB
zzQ{U)>Q&Wy_x0P2lEMC?v0@@f@NzlrQW2cemOmepYlYNqU7ABAFp_kEe@2e)@4hv6
z)aef+d)rfJ!{6|f%U&4!qv^E|g2#R;%FssNF4v#TXQS+L1H0THyn>B4v)sroC%9#m
zo7&~3xZh@%i|ump)b9t`<ra21J`!e@yK(7)A>=a4-P+}Dmvs1_reINmne1mpT+%u(
z3|9eyqZR_yb4{)hYQqrXp7+%(h)XG+O7o;Q1Gyf<R@k$};WF;ez`3Wqvd=)cU}`13
zs(Bi58S&9|R|?v5z5CA%<Mip|T2>9&3!WCDap1N12Jvn)?~8pUCU2tkonEZURX@D4
z7nydtv%65)D6xIvR-Li2+dZh;4NFT!46sOfvin$*ZW0X=tKy(*@bD&zTO<7yJxa>X
zz}ZFtQDUXhOzk1=@~>{}839$28A3ra^1c%ok5W61a?;Ek52CP>7>l+ByN*34u_hoL
zr~r%BO3+h2L9+cMQ?z?5q*=DFrncGrC7^o#$e;8x<SQ4VwO!<XGWK>e^+_Hx(=&Yv
zQ9IsZA}HxCub_`Ln=$S>2t46KW*I_J1_m<0+}FQRk-=@7XMnBNI$KK@)%J*r$mb<@
z&!^~VfqBS}D-{MtniVzQ)jnwa;`I_?FmN2hYKjNsUV_UxfCQLmL1zm!XkvwzIkvam
z;CAZYCxfjrvMa1Vb4(C(1x_cpKwSl(5{?&RPtc*H=ks993s2}?jJLwlbBpfCfGl31
zSrnEl$%+!56fy;&!S_KhjlKEoPTYQZt&q@%yjmeL3#P$5<m)~gi4a8UQpRbBcQwWX
z=|@N)0%ks`7=dmUOL(DT^wQW5!og%i_AS(s4HhtlH47g^8qoLrE3_Kc`-(H!^9DSe
z{Fwtz2a^5$Rmc@*kxJ)bbj3nVIK5Wl6=p@8m=UlasErz_NfQ8V!pVo<qPA^CnVFO<
zgU)nylz%FHIM+;4TSdId%32gVXaD3OkyBjaix(1V(VWgpS*#W{pJUnxMPI<2HscIQ
zN{s_A&UwwLG!bi6Kp{wfw~U$@8aZ&L28@{wz;8C_Wd2bNQmv=O1WsCN6sS-#z(&T{
z!3_F>BbT+^;n0xVjeFWJiswznXl5xSJd7TbcwrPwtUqx2u1K3)cdHXOg@UUt_za?p
z6tx=JZLN;El_%{ZlGWA-Q6J@&hcHfeBYC+|v{*?6xHXxHqo=xz_Ba^#$J1g4<#jGO
zOLoy4y|k2OBVSO2lj#+L*oXr`3V^F<9&L~xBVGfI(dcpxBMUh67o5eHwR}0UaS;_7
zB4OYax-+nfRa*y&(nd+b&5Q4fRB(KOOe`_OCG~9Fs+S#2tJWPj0g{%3sFjnNthB18
zq<e;YMyg-ZfW-|g@M&-fHIybN9|SB>kQ?vm#<d*F5?mtCl3uJ*%%YN|$Vny@Ob1Wk
z4;<-s_i09WhEv!x(&Y<VyKp+U(D|6?#87u)I0G3q3}y-JU728?zo|6M4q|BiQcreB
z)JJa|Jyf;=ET!#wgW4|7AL12I;XXcXRDDCL24a<Ss!$&?=T~Y=BGXg_ti&|0w90UQ
zLpxdW<#DK?^HU$lSSdz>V}WW6RJnP3a0ZDhwbbaQ&x|bBD5xcKf`mhq+vBhDDsS4=
z@~6!K4&JKMCYa{Unv|MP^-U?s+{3d@I4(<5MUE|gy<PeG+frh#S!*S^V6)ETcJucy
z9MOh6VCmFLE_xrW?*wHq9I34u7n9H?i*O%PtPAGJo*Sf1>3x&zE4K6*UcBh{gJ7V7
z@wzboEvdOSJe{tb#QdAoS^u^{f6;}5*R)wMS$y7|?Q~xL&O?ozIlj`StvZuT_Dy6q
zM6*!WGYVfQl7zJWd`%N`j-=i?Jn2){Gier427A!KLrp2YI|S48*6^JkTMie8u5fuw
zbr!@aK0*4tqzH{WV!&IGI#an!HF>m>S$}|)9<uf+3iOgaV^jBT8*dvEhppJ{s%}E5
zDfIes$eC_sOSe*6xfP(?cd4e3Zrqqm*CmZs?&(?)PT#0nC}nq2AI<OYWG*B9YMjf$
z=&<_`PR>&%do&G8lDym*0xX7|Kwo;-I3lhYOWNAK2Pmgz-PEib#o?%)P^r~yb0cOY
z60h__FuS`k9*J6e03cofHZJK12n98a$zfdVdEbp{8&>t4TX7W>F%JA09;Nt(54wP!
zLvc6&IB`wi_l@f6z*<vaZo<)sf~O;21cu$a^WNdX<9cRl)$rt8tBfQ|);omW_b2EM
z12x5)p9CPv7Aw`1IcN=y<A_(tvE8*{;l_$MTtxYi%{t6R0aZzf;vkRQcZA`Z?==3-
zaY0T{a%8IGM8grybPU2mm70A7P*MR#Dd^96Kqw0aQZ%g^;}3MVa=^ginpqZc&Eu#0
zsfm4`qftWpLvC<r_tK3f!BTUC@RRgE%T`8URzv96GT3)Zp)3;;2aN9J00Y0HipO@+
zbqu3L#zyY$RlHa>NPjSZsT7R@ku5AOnSt{Fn}|g0ILo3WacB?qp<S7AWSA{v-WX^r
z7t1su1x24a6Vy-^eF83l5iOyLBhYJ;#UxR(h?@aUsV!0$-!#dL?al)f1cA{%g-S;_
zp?N@O5_eXRFoS|x4R$_9gP1gzls*Wge2t;wsOUXc6)f|~#QLFqDCDW<7)`2*uHmEN
z^#~<U&VWgiJKT}F{^B+>ie0F#a?B0|oGGc3TW-o*OX={YdFAU^zMin)6>fZw1uxnD
z)=ExXc&td?Bm%;u265C|eA?s<PqBW>V?x8Dy&LxjB-A{TROZ<JE}k%Xlf9je!hVRB
z7XMfT@!XRBp_|j*?0pfW7-hy~)QswAht9UJOHPA+2x6{wAc{2{ieZAX{0JEUZ9tO0
zx@@QFGS(3ekjNr&;MEJSpjw5$OlgNP%RR1}JuJg!H?CLWEpr6VD={)U7@3)M_m<9L
zXx1_vt7{*aa{i=$4MaF_EQP+q`}i#!WcKk%b+&fEJ>*y8xZ1|(HTsukL86P-57|Ek
z5SJ|w?T|8#Mb;qzDk>$tjzFGJ(SJkIVvY64DG9;MrII79X3?}(F-c@t+vo_&8C3v_
z3hhYhD4Zo(I}DT2MI13!FfeIL>tqCMN7c9t5cYc}KIR65Hh_w2TU&HhT(ypfU-6(j
zVImPUWgAQeEpjyI*{%pIWT&l&wTjemJ!KZ00Y&u9D}&iigSleuONzTPoYV?XOg7G8
zu)uUIW{D5PrJoZPAq)Iwl)f^V>e@>x*Gs8-FhYFQVpdbeT1u{@Snq7`m@Z|uJjH4m
z3)=xPiN=nlj>7uS53C04H<r<(y`k&Xomix_L<4=%!&7zE&sn30))8Zgk+GDkT~LYb
zB~Lj507yxfQP-z@)S{-ogTp1oN(fLlgx9HV5UZSZtROlp7tYQjG-11ka7z{^_Bbbe
zz;<@*fb?|Ewa*s`NN@frR}#I=XV~VOX9-GdJ1_cHf+n-NKmu6q`fx=HbrPXvdj5)b
zjr)}jT>OX$1S!LB{1|FrAcg@RuX2^?NdSayp;StT>VmUFH$!r@y&g7uU*eRMA^a+)
zBMwhah+>$8Db6Fp?T+@+N=mV#R1gh>15!M$GdAV34@AnvrN@&VUGOYh27Rt}ObF2~
z*Ev9c<toe-pi;uzIkzo40>2=OvPXuUvE}vBv(JFed0bb@lHXMW6|}v#WO=s{j?dV$
z4wveTh^Zy|{l%C9uny!Bz_K+?XrhwyOhQ)w@pCO_zS*l!PO`MMC>1cxHu34%$;i8U
za(Vo+b-tH)deJ#QI(cpMf3%{A+`R;ed9A0fE1jIKmOf|hO_E}-4wJv5q2f)t%W#zf
z*x}$RtJ$QSox3%OP$I2y)^ys=Xy(dFhQ5>6j>^*dRq8lHS6_S{0TB$(BtswOwe3jQ
zo!Tx{+0Nsxegv(|02HiJRN&9`<$;s_f^Z3A1EivoOeY+#l;T9T#IXspR`k8E<5EFp
zG|nXC)C$(Vx4vwR$zrmXSTxHyIA1LfD*$_K+UIrFUv^Z+D)$_glba}I8k^4)m)7e>
zy+ifAKA!WTnGUQZ3ykDQ_keSka=4@)DFHUyP0#jzoX=E3TUp3>aJC-uI!@i!^2aKt
zR%)U;try&!au}BE#gCMW-XqS%4X1X>lxKPDWw?PZ5rnm*Y>C1kqpCTe9I)}^g9Gv)
z(KTCYHDax0S35D5@tW0hEpqQpN`Fd>g(Fz-f&^I-04J{eY7`hWdjo49HnC}q;UNm`
z79}$Gdc<avg?MYPxA+q!5#vLln^rp0Z5{h%TC8AC^f;zHFSDfWl+Q4%?RXx}7uM~V
z(P(_6h%X;M&AZYg?@GFYX1iJn`vy%0K3|NC@s@VLm$bzfXg*csr^Su0zx}rQ?YF}X
z<YmFm_A@jIutLjVioK&w>v-*Pt&S})iyV&pD~h}83v^a54a2^#jv)%bt9Ik{#af}V
z<^65Dpi*t+qnQ9yj6wSHKses`y0T4}4nTea5XG(9HZoK;Y({yJJ96tyM+>xcp24O-
zu#vx0dTzT*uTIa88=W;eL`K6RA&H6#`Hc(z=%n-N{J7mZ!RNK@Qd;i$$09<irZfIH
zQV(&$+0`dTE`XYDXbMZ-+$e0Mf{*aB)py@kjyk?SEo|&5`-Wf5*U5%`&6#Qkie`wD
z>h)%9y>t@NeRP`sb(YzRCHfYA{dHDQ+tB^+wpW0+y}eyPW$HZ;GcJ1{+D-m9W_I~8
zcep-g+cNk4i7bFjUwUQnJR8o&^RoQJ3TfM9+}x$0H93sGA>BF5XL#{Q)4ohbjapyf
zI#%&QH<qnRzm2KLq!BXSbk@;Q=}PqyFYW2DK~0p5XGy|Ni9(*cNZo{k`L#i6X@z3l
zqqi|COvX_>FPVxWl~lEdnf3x(4Ug#zSXFGPT|OC`kNI6$g_cZ^Xl7xgLTLzLH;Lbq
z6DqJ$a?gh0oAjr5^rGzPsb!6<zFos2XgrvBM}X-a&n!z_GR;&-04t=JW69~OxFXM7
zwL7ucibZixfOq)t%?Ph!-bx1){(ucVXAO(t+zNT9mB-sFUL8{`U=u5quD#X0%~BI*
ztYLE@h-vzgfkl+8Jkt)4O4uK!cL|~W(!B!erPZ!nQHhcKYfD;KIcAB{w+j}}JqxVk
zVW~<iRnD-$Ca5?<8^PGx(!G5M6k29qf9;0l=EMs$G6_31qz(<a5enWK!;(2#7oicJ
z8rFATSF2Uq3!4BSsop3-DZjdwz#KKx))o%^3!EEC&C={jFL@f;f(qkf3}(%YFgpkx
zl+|+93yDf=u|N|nWf|Asa4nwVDNL{Vu!x;xaAl4iWTqgCxPqo@`<auU*7$Jmsjp$8
zUCl0vP8V`fG7Gia`69SQ2DgRzdTYM^{FxZ*7>!>X^}rz6(n8*FV=qzcO22!(%Aj+e
zi!XxUKhmUQVVb!O1GM3xduBLU*at;iSQ}6g+2scAr}!XoJ(+AbPWICh$E~IwCYGxY
zDVs#HVv><)0pb?9fz`IR-P>7}&(>_(XkjIGxo8C}TR8HPp2bA=9T@O&)nG}(UjC%?
zj7bV7RanCF?;V17_Y8q+m7UOK(->sTwK&msVmjF{vkW#__cn^rP7Q=i8vNLMH=VRc
z*BhDF*Es@~<dU}IlziQ%3!7z^H0q-&@yHcQW%N1_hK=caGt5ra-z=R36G#Lk{Gk9S
z&Fe#gckwKz8t1{4$3bl0plpMq^Lqh9?-j~A3g5>vJ;hZaPw}ff#W+>+6u-(-y4x!2
zD{b|ZX;HSMC3$lt6|8$T^@eY`)a{&l8ZUYR2fxZwpp86)Z|WIFu~1L(yF6E5_07CI
zhogx+g>U*9#TV7j>6g4Sh!{L5;D<b=@BEx?BJkgj>mT<M5;A8_8VB%*RERn0#krVP
z#&46xoXs^k^^$>L0xQQRdR0brRki_IjK^+L=oHhaIM=MY9rcPiLoioB3?c@c*71uA
zz;xAiZ4Z1291X&lsQ~Q`!(cSv^3bntSD8LiRVXa374m}6ga2PggQfU6y)c;!PBBxD
ziw|m<V9~daUfTKCG3QKI3g+E&&w{Hko(KAp_@Z+TP)-`ht+K35ApGB8hmlMkMb2D!
zeAei6U%xs!p-5SBurO4B^N?CR_PDuZl1pd+51cz3;>p3Chi+cg+Fwak|G)cL68|5w
z(tnWz0L$b5@7C(|$I1BrJMieQ`2T;x$BzH62b>cCd<*}tKEWKY&mL{pDFMKfz1=5!
z^?Eu1z)L@dJx?>ul|uU88`J+&<M&HHzIXtCwND%ky}M`u`|w?ihyOtYq9|HKVN9@S
zHuv5EqS0c$QO08ETjKo&vrMHen_t7GrLGpM2A($wf`O?bm{UX1%>-m!6sk9LO%$w0
zAp1}_763`NFd$-$K&qT`+DLr$Za7`cWAgBTFOpSJoO|YIAuKr)@qV0cVSExK(L(`1
z52727oNz|bl{XAWL779$fTW3T)g{W$V=2slS}(hV=pPY>7b|gIyCO%};GQ_Kg|ou%
zI_E#v62ZtLN<Pr}iTI3$wiw0{Csi#}R<vwZfK;a5TjiBCN6pwl7<(zlhJg`)PA1HC
zTxZ+$CC40fJ~5<$gUy&H9~JkNd~@GvM?s?Q6x6wdG}<p}C68uRvG6O){W#mD1iy$A
zPjlojyPJ62QBWr?)ZAdeG~MQrOrD$>huk1-+kk<<xAhGLm%$T#$%Jj-j3zL7@MK`!
z2^jT(Ke@BbTU2o1FgAJ=JBop}Sk`ZO5;&#z-SMrt2f`fhIdaI#H?Q=xxj+BXdMZ*z
zO!iH;Y%7d9+SL+ezWIj#!tb3YM7sk0mWWw1Oi`;em=jh<&!feN+~B@JH#jV9`w`So
zkxbqMe6Y7IU-_I)w<eZZfeIrf@fnlpP@rpgEfd$>Ac8YL98oZGtQ5OyT5^6+ZrZ;q
z)s4~<=&Bjs71?7+Lw`a)OA|{G;0~l~dY5g*PJ@gaim&+Ma%*;42E+sM)_{%}lwJfG
zR<<T)eA3XW#>y{_gXHPOf<{rnEs)F$MPm)i#f>OW4x}{Y$-^#(3)_ZbFu(i0mAAmM
zLdMs^^U~(@M2#!!EW6wk*;&Kdy6h@(7B<T`F<|S?5UW{~I3{aVj)2w2wHh62b?HP_
z6iJpdr`&i!2z&R;vr2me2G+z76^=3NnI&?dP9AQPw2AMb4c%)cY{jh95t;GS$)w6M
zX|RpCj4jtun=G-ChFJA%L#%?B6=qpq$>dytqM6sN;_pjRQovHsoS=J&v2YhgzOJN}
zua_f55FX+|u*h<sgXL(sWz&LFGKiXaIqSsQ46wvu&|6%A{3LwVTK3R{_g!-F*TiDa
z461rj%GnTf{IhMQGyf*>qK6D?Qc?cig~X0Xc?x|C3hWEOwjJN))D2n9Qrl7`E9n73
zL|#LqIV>=^)Gi#39P7~3G=P<=#l2wiA)G}MvJoB9tb^HyvK#MC*we2Eh3uJXcv{Ns
zRB@vrz|UH2GBL8)Zr`2;WNj<KM0~HQ@%}DXG{qJ6x_$bx(Y`o3Ic)u0viS)e1m@T1
zZN3ppvS=hh)i~+fq(<zOkb3V<6zBIg%|PlY24Ydf_3F?)t0xF$%TKgFrKBox;^wu&
znd5Qc+hdNA{UsAK(<Mn*eyVvsH9euc)<%tL6mp7Sb$5%{Ry&!AqL4Axb@CKVgUSx>
z+O{X9b|>MAbO3O<U82*RjUu8H-uGnXqS2lCH^Dy^$wcZ)ch%Hm*Nw-rDaS{u0bv34
z(rQTIv1z3lm$PMM<Cn$zxv?CspMhEYM_}eY-pN3C$3{5LML5l@`joah=c*!^8&FQ=
zY_<uDV}%C#5ge)e^DBSW^RKeAL1kn;pzpAI#eAhzh@qRn_X{BTpbH#+6~Mxz3xraE
zG7{1C53Y%+zo080{Em;ui%~&tZ}yW7%jS&ih1(>K+PvtTo(Xqtp0_SKjq{HB**tBx
zTg?u)uO3~V==T?$macly>YOz$FIv`be0_Y$m{8-+p^k4Z)yAm%N+@chqu@4E%HP%n
zIFKa`8?ji`!RT!nDpN6KQ(|7F{A;9Nt_Mud0c;g}sSwCMI3Y?~UeP{3^&Zu>>$}Si
z!wxb?xV_Xd+u|#>uW=Tvl(A?gmP^m(nW_m`*bn2A)TrZt>w2fuR#{*abL-PNj?47y
zYe?U#V{jbN(Bbwqr?^0{1#j@-U0Y%z9K=JAw)en#hU}VqqROT1)DLIz=k(GMDMo2G
zX;)sl3MQDwHky@lE;KC<{CSWlWFPL)A_T4QLQ0d4N<;f_zmpo#kUE;<98Lx9N%eOR
zDYVZd%^C}%3~nDL_P|g;hW4aP3*T_|*oK2fJ$tr>|C>hAbvgc|0UbqtZYUKjwusGf
zkbheth)#dd0>8aP?paM~S(R0=3p}_D(Wa5LN8=!laZ7evs5|7tLpeEQWK_vsso3HC
z%kt02{OHIB*Ne$}<dW9@=Y))j?K!H(K=W99&?AFcvb8Lur?Uo`aK?5zHVm_sC^l}x
zT)b*!6CH0EYS;=s7~1IYWz;zwN&+%@<(Ul#zQZc!rf3fy0Dk;%fp$~CwXrH4$>l-^
zLq3wJ8Ji?UbU>UjZ1?=&REB+`>K#E>p=237y*Nz(+QYMQpR})H05|b`tckj+*#`{W
zJBsEiup3`Y0Z98w$tI$7t}8et77r;|HWvdO>u!@$3DQt-O2WlJoAFY3I`77xO&l|t
zWHQUT9g}GSVkWva2u<TcHuteFakOeda}aeEWE=RPhCzAAWvVV@T~mjQzh5e(e(Ff+
zy2o1F!3q$uqgb79vT>6Sm>DA)W*RA%EAS!PT9-Rk`bLdTLg6BVrzw+lHRT*aO%%Dz
zam!nkd3z=E(-iMm#y1KFMTA&N<~)5sM#-JT)nXZADo*Bjh{l%7%ui8#a+ikW5#%kv
zQ)?I@x{E;t=AnM%@e<iuvN_ox`f_|M`<8dz(%Ggt8t2YT==D=;hSDxvwmavoj?+uK
zA+M5=9G3cs;c931$i>;00gl^yLYPfV@ULU#Q=Xbf+&<2FP7&}`p_JQ;>>ey8Q(TOB
zav)5rGGFGcB=;@34zdSX??Xzwq?JAr-Mb=*q8DZ{&PicRw}d8JF?#(|g5snBKrjmI
z`~M+%L`#k%8jeKDVbP09p)m{-#w`u!*HxX|IL*53G1EL=Mal+N!=x_c%ex{##n*To
z!ayBG;!emwb*s}^)Pv5%B{vfe#kP|4%LW3HqFSv6Z*9Hf5-~exmd63A1y;Aduy!3i
zS4v4od(3V)O4ut%kn6u~BrnEnk7*r{-968xa!O^MVeD)5P(t)Uxd~7z<TrZ9!)Z5>
z*EyFLHJl%zx>Z19(X88RMO>VmOU|COYu~%a<nR@TqfZroOLDQA!|#&1aEl>1hXh^7
zi2JpCE@R8}0%gm?uBnxfv&G(iDgl-&Rvn!635CxYT4Y#E90?+ArIStG?F2b%4<n}~
zGyMVdRO{-2n-jkR_;?j*E<cU&j~#w~hUy!ARhm9UauOO`Pk^U&j?Id=Q@bbPPL3)o
z!9TP*Et&7qj@6TZm$DSdsr~ZwwB2f)<fD@g&sjq~MPWW$1O;!;D^M_-!aYcy9JP~8
z*mn3J#TT*wD0O3^>d>GEg2bNp^)xF$4aG1e<SE*I%5cbugmIsu@CNp%+q*nve@0St
ztOK)THt>1MZMzym2Im}Rl0;4=`N=h#NE~QfA<Wu!03~hK?y4){jRo}Gc*D~U2Fq*!
zu@I_t#{TR*)$;Mum2aXGIA-z?+l<9rzT|7BZeYX+=9@8IG~gUeggr7_C1Js2*2w^Y
z334U~AeIG78z?MF6sgR>b#CT!3|*3!U76@hNe8Lapj&BKh*+*6pqRy4EJtbOQ+v2+
zhIyT|!G7}CxN9V$udkD)8XV1A4`diK<b67}hn7L2ECQ!~JzoQ#aKS>Ww=V8fvE_!v
z#{gc~>QJJ5v7C!BRm6R&9JJ`bri$<{c}4rBdP6^ydlg;msW<#fy^`Bv^^Sj<m&Pi_
zl+e$#PZpo*R1x*tdTqb59?N!Rz2qlS1QpZjC4QI3w6&|}^h3QMlU4Nse<+VHxmi~4
z)Nk_|x@EnDU*=Wpyo&WJ7P!?b{-s|zRE-^~#u-$N(^OS<462CwtzWyuQ@_<~*f;bm
z_^w>p_;gdYkCpQ3)*<VyMc0(08|xo`|Fi%{ShX3=Kn5q1ed9RrY2XgXr9hecH&46g
zmnUo6Ysg*}lZm*YS+6fHFV<@KI$p%EwMudytH8<W`C1(dY)sIgakK%447SV0fS&#&
zB5S<9>Om<{{jk+IT-(VE48z~?1@7p?8i-fHEMrvZdRn1XATuSz0KW|aSVTyCYbWnV
zB5J0i7O7wT$XqG3DGzd_&*)4m``(wB9)T=Exs;^$%TcR+s6-b71So1rN89dIs%x5-
zVHehqNJJ;2uovpGgB&Y>>er~99L|thS$UFpwDzqeM%I{fNk@_pc^zrs=FYGo;sEYj
zwKE#U9&@8|`x7&@?JdmYqsF-wjnz#{)bB55c7l&|%h^ZI?9omI&Fn{dBUW}xjx~<G
zt0L{$q(CjlRHVCv@N6cpLWkj$-Y&nL_7}Ijf|kxzz6zV@2wUb%iD{?Y1|2<}r5Hje
z1R>M>Q)_&Tvk8b$jGD18l{UXRkikwWI&5)Wu1KVJU&n?s6l`)a$hWStp`udn@IiOv
zU%3LvEy_n~peD-8Uqll!J+z47oPHUdqEjz%t%zDR^HZ<yk|l9YESnL%bc|{yODD%B
z9l3UwSsFK+`gXq&c>$>eHxw7|@DvLRh{VP?ahjb-DE@@_oB~?2AuhWD%^#xdHJUZc
zAF@WtQs<KvD+cG(%S=^B>6Y|Nn6X~Xo!FM>zHN<1hP7kn4KbaZVfZsIh%@i1bB<0{
zgMjFkIpnIWYes#ntXlDev*o?x?r&)0`6Yt|#JZXJ(@z<zyb}?P-o4|HJqG#rch&@C
zYfUx<PUSxxIqnu}in}fvZdCb<fz5WounuPCo`w~5vuNsHA*mQcJ=$uh@=O8csJ@)~
zCvBlVp7d=q+|=@5(z*8Ylstl8^xZeOl&C|6_QJPJ!85nN)EzHz4O<b3!NBxgujbk(
zxmAX<XzaDICUkHG7oUE#WTqNoT9;?ZVEFcoU(Fiyj(tqhO<D@jJLP<loZmUjQKYjh
z^|8!;$KJZ+@Cw_OYK+-!#9BLy#bwHH#(a_{4(k0Vbxdbcnlm{6)}cdauhK91w|c3i
zc(=dm+((<OdCR}$C60@Eg}>wlkyyQ<AK8bp&y6^1`>en`!9W+w!dKGuwIx4WAFR}T
zrKfs1@nGSa6gvxZkvo5f35PW&?uFcbCtYty3zO~$w=dC6!~vrFI>#g|?Mq>Buso8x
zubE{~5>jXoj<q=PBL&}$oZ`j^!OCSzW#rJnQYs@VKeo;<5~c<=7V=t!NwGU9uNVi+
ze#q8$k_u41qa!+wemDx@P;P8qPz@^koouNxMW|VZq~<99DjV}fLe?(t6qnLk$D_#j
zPN}FFE8Ot3g406BGO@`GrGvU)(F5OX<VB@Xg|UcACW#j!=z*UR`z9-7PWG@B-hWsU
zv8CHZ*Zo3LGg-VTRrwY0C4}Ijo#O0@Scz3)%?(u|V{TZamTRh<z&GUjo3WPkLbEsL
zWEh<0sg8o9xURhm)&Gh`^XGn+#DAHOtJhzojpgxQ;QP~hBL2&hoyWU>#eexTK6d;U
z9Psi7uU>sptyOCn_~q%NTK!S|saM<C+ph1`AEyJqbbJa5b{!4k)xy5~EgViT!4kCA
zy*4ph=$8|Xg%3F#c?GfberlYbQ2LgT<E0pTR4<wh*m#J7s{|8}#%AP%UWR&Cvta5K
zPR|cp=U(TyfLNd|9Ff41#Jf7jUE0{o{Qac$ll}8`Q@$LZ9=7Cb>)*@7K`ER2TvGvd
zjrq0rZU|2|Fq%D_ewk@QmB!(rRKB=;sUTjq<=f%WkERv*c6R!ce7ih3mT&FWiTc*j
zkK{}9^rYEPPn(Ulf_<{KmThAdP9(zPf`Zt7gu)m56q`o|<_dc<9~ZC6!Mq%lFhAN{
zC#3Yg<3D@euh0&?s=VL;<KKA2+T!{1Vo)Oce<=pjphG8wF_a~Hwc-_2nU7I+dlS3`
zSzos-4Uf3tHHFCQ;t0-dRJ%l5)KT}a(P?C;*r_pfa}Kio{<@S$Q%xz~`H{s3gP2$B
z@E%V#njn(^Mc7^wzFtU3yFg^k`@!|@U>;|S(5i6s$%&IRY7QzS^%4e@c*NbQfd~>6
zj@SPZ{*RmU7uf;s;s5p8ZZiJYlP6E=fARl6<74xG9&p+Lc30m48W{(LIq7%9DP<p{
z=n4@o#F&m5BDFqrzd-2rjv>Eu_Y74KjnbP+Ql6C7ihW=tMKWZSi15uOzb#>2kYDo`
zW2z#r;L>Ih;G&YQ<hI&g+G_jrTJ<)acCGb)hU6w5^h!<y^Q1ek%`OBDQ$Z0c%Ry;^
zI|njF;gQQBwLcZo<rMm8;Ls^=Nf+$m82d7#eA&C0zdsu2Pz`Bz`KpW9rf|K#+He*G
z8AL9tffz2SmqQ>;$^MeMnY|QJEIwrHPP{o%eb}2uQQsetMSqcBD|BI9mBmvHN_1Ij
zc)%WoRi}t}VypS<^FQ#jWd9$9<8U5-0SVxq{eO4&aVq|2edozv`~RQuvG;#9;1vGz
z$+xSE0Bx#B+RL!-(N16H(D!KZz@{?qC}`wpM8~oU%rrD_!GM;uVN$N+he`yDuPqbk
zCw6dA)vZJ*QK&;<Lo;H6>hmFS(95Hf&Q2W=0C{@8Q{PX%K5iZ3%W*JHzM?nsf^_r9
zfn&6?9-#6v9;0pe#Gfx_{wVf}<aO!Ky?0n_gA7@eKNvb`nn-kHZKPUqBH<w-7~Or}
z5`Zv|$;Husv^r}h+tYumZ`-9xz2uf{V~^G_9s{C|W#yZcbu-DGbi5+`(}f=xp~kav
z*0E|9V|q?#Qz%yI9KYNj2J<`Wgcy-oK^CF7*fpaRDb6HVhK}|jXNJ4>(a+?{izcJH
zeI0~=Q!kLujl?Ff>x+rTbu=2#tD9>Ka;n-QT<x54N0a#(zAH{kc(m12#zZNaG*c42
zaAYae10WnsXyaBS@JCRKf+biZ#?$7ab>3~Xk6xb~w}5;duid?bT2z6p>r{A5B%t?h
z5u?ALj=f+gwm}X@r0YG=(E{D38cj)~IqEL_K9`a<wCAsOPm9GPxN;q#JHP-<x2}{0
zT{xtb2W@eAGa2X#wj10|i+wz<uN6(9VjoWIs0q-8{b|T1BY3=r!d6*4)&GqwuFSHw
zApvA|=-n>mw;g0OMXiKg_)R~xaAFwB<p~VRp{~h4i?=1!B77~a<+-A!prPDuFhn69
zbr!c%1P4<Hzm;??yBsaxVpv+EO0u9aMUO>5DhHC8RZI<kR!N-4sw5pHsED@Vq{)k;
z{vn*9TWV$O_ph-s^6c57ubH!o_2y3u+aZNlQHAg<dAlCsi|j1G*@JP^NY6Biru}FT
z03$BhDmcYf$%|atQtVP^mDG;vzUSQ3yEz~)I*sNJYxT$5sygf|Iw>W^bkos~<tC`8
zIyA*361dXpC7I_mhQ~)I7oGD?<0bM>)0F*mZKrO=KC4k_uqXK=4RG>DIy!lI`RY~c
z+zC~!pE|(xzPCU}V3@)7`oITh+=CyPu4q)^lvzwnDO1MGK?6VR@~t}EG}|zo7plGA
z9pL*mKKmbS;&7(W{wyMog=jLLMI(=PU&Z=KV7SJ(yD)|D-fbd-4~>rSJc7dx)5p`;
ze&0Ahq=E0WE;<)x+DDTC!lBv(%Ua0PX=E|WOWzvO{GUC?<jeoZ{`&y!_dmal<??@R
zcl&8d{@>nx`j`CwXMFw!3zEl~m{o5Pj>w4_*zEe>JY?b3>LcWLjdt6_eit#`-5+#u
zHFM|)0MiLp7l_(ad$^df;XIH%8i)Vn^$b-H4!q{~jg!|cuk(G&yJ&SfM<=f@yqB%^
z=}%tg)VsJm>Uh7LUY>iclOK=HPf2RZa~42=zhL0}Dd33#iK}$1IBPdL7lg(%isKMB
z05)c*uH&l%3}FglN3;3efp^vKuQw_A>48@{t$UT9P*(r9;_)y1w6xwhKLByeoAnp#
z=Z%y0(aQsLB_4&n_48x+I`%5Vb$E*PM`NmqzhKu@AP(SL`_O#FvO<d1$)R`p%0n4Z
z)1vB~oO&m%)*+HZXw^9RrSm;{XbYXbKf3VRM<*@MA_estPz`TkJmS#n#c-UM1p)q5
z5o1Q-WO0kEIf`#_2fMmK5<!hP8u_y@CiP;saj*v6!$Xq4-aI{Tbx+{|$WztG8{yWD
ze@R@VFA@E_7*Fvpsg~jI75zI3Zt)L@(D3Ki^);opjf{{0U#D<Z3TF6?4D0y|WqW{c
z#IWcK!XO}viE8ZwJ{$crL=>P3Y`yShI7OMc8sVTY=A7;!GKnt`;hua6Bl$A+=hyNz
ziscKoPT#Oy&gMh!{eh|tCtCcA7Ae2Q(L}!UYEdu7@fCXB2pD+M!%9r+&H+B5uc!1?
zUNq%RpMUT>Bq}*NVIf$k@E9f>4^aueQIF{hf|D;$xkQCK2lA$&iga|54i{;dBJ1ng
zr{Uj<IJe*lERDUje=8C&_!+4mr}$3&z^V$!UIu#WSneEt|2^a7+TXlGU_fF61S?TY
zV3EzlSd*6^)>f@_s1>`%hyoOCHcMV5;&${3Oj1XP!7El1W6zLoWsuEmn0>T(-XqkH
z@i7z6GlXLm36%Id!-szbY~}da8*NtmGUomD^`L(pVM+Y!6>wC%12sGa{k++vrvS`)
zMlks~gE#LQ=ky!~#XMs=({mxY_3oITA6w59v!gefdD`!VT2esK&M5&DQ?HSDn6-ru
zz>_eT^x@o%VWTB!{4~N_C&T)IcOhH1sDtMeJTpe9?e}%TJ<}w}v`jo|3pgi@({ba6
zR*5EGvw2Xs9rX*IF!BQJ5QjL#z_Pn%rx!;*TfYz6r)RB`f+sw_P#FzI^y^Sn@6F~T
zuhN4vAv)hdlfbAGZR%Zv;Wkb#j@H+KhvyY5JOH1cM&(Kinw4!~1(2}GT>hMd02>{i
z4Mynovc4{ROCGTGb=q{6_fj{NZfP*GnuD*`A!g^jgKv}m0yd5qP~Z*i!A)4b_#1^p
zAk`CyJI8+CJH7CJ_G;VJoyz*(?t^>WXr5mD40zy<YN1i!-4r<Y<63n9BhF7c_@o-#
z1_j&@VEG*gXNlo#0w?WCR8R}>0C&QvSE<n7%3^|?F&J>g1ST&pkJ^Xb#s!RfyP($7
zLBU#k2bH+sN!u=#O-8EESgCL8>m(iAPgt6H>+2##e2J-wO9z+#C?vBRUiYLm9YkaR
zE)E5>F?dDHg+ylI&>jl9F~<*yF}sUbJ^TLj<d@Pq|K0Og!sB(XJomf^P0Gp3oEfr5
zEP^FP*pxsdJMDOft#+%^f+<bX(4I$s`>eCJBw%_Bf7CU#QMoI@>6&hWMc}z+lPs2G
zu328XCdukrUDlICb*%-XYb6*791)4GNhG>n*CG#M$X~ONlr&iDMlQ0GgXLGiXHt{J
z!99@+GwRUuYZe8wDMB4^d#*J|S~#=_mn0gKiO55sgfQz$#M@KC-fBG(!FEqI_^{EH
z?h+!><<IRJ!BVrpj6cr@H49|iQ5fH&dKqY^TgmDHwVW{~S+g;-Ga5yEG}2R)W%xZg
zI%J@mg`7*D3@lYE>v9rN)-D<FRadgw;qEca+=aSMr<^@1{il#SwfNWN{IMqokqj(k
zUfZi(PCR?+?6casptIZ_&+4q+MxQ)pvQ9E)kUPoO%@J+S9M@LEo{pe<+~lW@70>4!
zM!l{Ng?svZxEgBeOuVNX{Uq|{Vwa>QFF$?$-ZRU%@2qIkgp16&Iv($-gYs(qRLA^1
zJ=FiY?P3+4x~|j_dkV%MGI5fNTza0d)|FCZPruDTNUbS7cm|*Rnc`AlU28hHrPYU6
zlr?(_=|6~IiD6Ponmw(rSrJ=i3G+;ja6cy#)Ckv{rKV9twGLTDuZS9{diGcjUs@xV
zFWfI)>iy5Go&^4mXt}QSZhQLS!^W3|B6sIox*(F|G^l*wq5JUZ%=}a3oU{Ng43)Hy
zdkifDDbui?D=Fj>D6NaCZ%^revbwgyyv<!rR<|^1;jB}{(@!+?lzPAPfAK!-|7)Km
z_J1roet|ab^Z(jO-Tys#^0fBX{okMQvF-nOz&ZK%0~`R3IQ)@Z<{^jRa9&}+8d=)j
zR?G>mO$`v22Pg2>xw<oxdgponb2Z!fpS_Z`vn#vW6AGt|L+!t+ir^iNj?71TyvEB^
zAuFaE7CAail?WsA`t&08I*QHfi_UrKy&d<BY)BfN?^A{FaAb-crqQI0Bq!dR<qoV2
z(c9$ji`2`H9k1!UiSF<Rirnb*OF6suak^Aq;Lb{4P2TQNR&W4a*a{Srh%}2ObSQi`
zihNClwE6g#pD}%w@PE0G{QMo@9{Z2_<66r8qxR%4`;R~6!~7qO>RyKPQ@l~|d=G{l
z16Z&NZLFd*(sIR;kE^vukE``6*1Vq2r+becL5*lyg(>qJ>YZj+kKi4LcvS4Z*ev08
z@~l#a5%-S6_kni?i?Zr9Fg`XGG3L%yseKmA#$imhVPWi{m2dCPyPElvc`zuG5d)>|
zyvA#QGMQyg?mWOd#%-uK_d~SKL_io7W_qU`gyU#9zwu{mpyJ1I)DL~k?lOq_WL?V}
znOq@AzMH~@R4SCHsX^e6l>4lDMYfO_RvwcQ&O%A{!F!QlqDqhy&h1d99VP%~9*Bc7
zVO#db(I6b+-+=lzUBDqWzAhseShUbUZ-IuPF+T4H6RZdwdW1HI0T2~{;1(PW9UR#(
ze;y%}DbjZ?6r<K}uA{NrCA7F+%qGxqFra=%Kt5`eF5npu))+>kQFKEo)1%3N4f^+F
zAUp8h?_uzxzMc>h-v0?39F(aUY<U%5`xJo#A;^Y4p!76W=VpirUguB*#%Uxb%!y8`
z2}QO=r>{CcHO^b!(S>(*e){9lVe8N<G%nyb?E60*b-q8n?4YyxdE=z>3!33HPJZ!z
zI665b%C~+#J8xZFc&F#y(eYXPsC8KOj!v5G%R{omfvR{R)IK^s>aeK}wkgn#T2Sv5
zLOE`oqX`d43P<gu&M#%})lugJ!M*~x4ezXR-Z^Sswj1Z(+2#4!=>?kl90KH%qmx${
z7rlk%PqYA!PS7r>^&^@?U3`yLTG(LY61s6tST;}3emOsS{e8##{<MAAI!B`_zz-9F
zaBC;O&`NDLj*iRTVdJ>*x<wUF0nj;>6dZs0zD19q$p-vK>28od&C`?4c?0uaB8gAW
zJG%ByN0{KUaej1x#Cdgo3N0XYq0%YAfvP7h285JH+(}YYV+5tJJC_$NgVA9N<PbCt
zgZlP>szH9^0qs3m5_^h6-Q3(%QCNwi#jGC?kCGzsBUl6#`B9x-PrbKJG+DYsJ?fmE
zspvUtg<5sHS}&}p#M6{?nk|Tm8GZNoqKPokZ20)%$0n||c)q|m-pmy!wm=_K1p)WP
zg@O@LG1VePL~VZi?FLpDpc3G^YMcFc#ipA6?auep&LXPB;+`T;cB#mdT`VF-v$huv
zwf#aH$|@iN)w_UQCAMIz=a>B4Y82PKiU=is43m9DDWosEFmw-3FJb0FL4}srQ;2yC
zmLCv4A8}U$XdD@<Nj?*E<3xeUBY^)Q5=1^Z9|#mEmf^P=4sJ{9h$ut$dX#X)G#n1?
z5KV}+_uPBDUB>`9lj=l=5j2@a5u)jWDI{qh(gmq&*bvXYK`}+1k^;1K;5~Wz`0>uS
z-|p_#wn4ty-K|Q{`1*f7u5ZCVHOsN%;-|*hS?kac83pztb*@wdfIaWU3vZ`xqiYJ_
zdxKsu%0}?$q(j-QGhVe%PhQhI<qe%vMwiQZzZxJaBr)g2vzq&X2AJ}|Oh$=9hu!6V
zT48~0B3&p_O!o6>@Cwe69kfBGSc!#(w=o<={(Qrp{N$5?9#4~gG@in|L~~X0wV>Tn
zWU_)<lLG2;@_vG`swM_VS#kqd?QhDdo0WqFdrIZaU8GWvBgUF=itg03j%}Q=LdAQ9
zml%4A<Cx3oOPbVypL!Jd=@I5L<lpwXRBZO;d8<?Gm8@WZ8UcH#WDuZaY2S+fXNMvL
z@R*|@oF|X1(gv=5$%gPTS+57;Np`jWcIz3uk2>Acvm$#|N7Gq}CZ+|J65c0461Uk`
ztOX~YhQ2Q|n-0)nDyfr)`H*Vxr&1|FO=wZq#ne@bj33tpG3piUFJ<qWgOc+Qv!wo4
z;@K@e{Lcf+Yp@qzkBU9a#pU5FdHx)}*)M0-%NH-)m%e$a7EiLwEHcm)c<;XiSaGLb
znUqRS@mZp{l+kr2R&ngv#rHBc!^vtx!_?0n8Gbskp4Lm=H{MQ72tS-Kc8dPcIFfY~
zUx&kanP^$EU(C#lne)OoZ+!O+5UfmOOFW&?Qz)C7((#Qyb$dyBTxJgy*C$fecZsb0
z;~92z`*t|o-d0b|Zy1MXG6e7y>LDPRin#VutMfXzeE>=qn(V@xqKTyI@V@h&d3&Ck
zU3yUV*WL7n(B2@tLMR7b0S>7<yN{ndefF*2>%&wjP-!gJTMXYkd#mF7hAN8hM56c-
z3YE#emjkZxvU%8gRoJKKxLlD4ht-~Gr5LVh^wcW>ph^XnGv#_g@YsBas!9$24N|%G
z`0c)jgK*&O?(5Lu6ok-d#-MK5Q=Y$*bo5t8Kgzc1Mtz5al8BOuk-Xt?p}eN~smIDg
zuYg=qUf@^r9QcfSjv}poj!8?_gz1>4x90J!^_*9Wyx|}E-OPSBbKm*SOF!`zR*b3^
zjjX3L{nWw?myALUzw0+Nb2UxiyLw|Zs-BM4dcm?b9f>Q14Q4Ndoqs&#7+uO=o`eWI
zBzw(g-#!A_pH6=-7jrr(3@~0+e~#`BKveXfBlQNRK^zA-rcMK>bhwE&Vs^b&EqTqe
z%eV?>br3Il0UR+xbfF<H^nWZuG(bfS3?~N;V1kf0(7b9pO}}g$b}t&|YimVf?3HJ<
z{=Pa;i;w)r^TJ9dH)DIb+fg;MH~re~&eMAB>66Eg+nPnGwO%m+&wGRo3u{&t6cz<}
z6>9q|n4wuXhS;XTK&8sCf<4z6q-^dnj<0Z`BRMg<CyQ#1@MZ+ACFdG-H2mr4WT#Gz
zXvs@q{iL@2q*i~r^Q5i9>r2~cs(iR}*gS7FI<4-jv&$~3Dq811wiug37{vbk=fb{`
zzB0fA=%>3oyU(5_!IO2Z(>?dNkcO)$>cYvMmAEs#4<-ezv$qolAY)NlNIeXaN7XBS
z9hVAagsx=EC35U26?c~ynBi{L*@ntaf*WX=xTjOZ6<=%rTjQ24)Bnre|7W*x-~I37
zRQ%7U_1(YXzx^p6`~FuAINbp6JYD?;m{M*}fw?H|fVTww>&4{#LqobS3U){r{Ukfi
zoAr>4SPHbO5<(G0h5#h?InutdPJ$*A;nFq{naeJhu<kN9F-^#S9Gz}@|55gi*@u6V
zeEID_=$k6`I0r3wAHYtDiMf|ItS(V6yVsJ_o?%@JAVMY8i7ZI6jb3)Mu(yJHZK^oz
zKg}>QwRck{B%mpO?w2Le&Mcf#lt>-wqu=eXQ;G+CpTtL*Am#LoD;1MC@WE;{GMp4!
zpvW#vif9Pzc0!j<bPH3d==d*k17+(4$WcWpXV<oGAJ-lLkK)G;hhZNt5OBx$=PB5)
zPS1}U9RN*mDYOGX%z>S({C%r|YIlqku~w`94+|!+JpS{Su>QH1|L@eEq~kyT#sB}D
zPa^(vpQ3+0`vc=YJJ$znGx@@@`<aguRzK(oe2>{r=58RCkcns9pz~1dHQi@pHW*sJ
zKdP{tg(=ssNlA)dRhry_QGVh%u%I(G7F6=bf--PPR^wnRT#Z6ZQUQ$nSYVr+rLleq
zG3QL5>Ig*-rr^ue5jyy&NZIO?Q^1R$0Ul}bE6Bt0OTE167fcER`WF1dy!8hIei$!$
zQf@KgFN5%du4yVvqZ@v@n2h<$D458Xxq4uVbB-c@PN^&L2;gXESfO&Tz3+w3F%~xb
zH8w`Ci)|Btn)E6_mkaErWL2<f6uvbkMHk&+cw0<V*Qq8xP;y90+=?3v9L#9C*omlk
z<s}lCQ)oCkTXCG60!O_r?0M029*$w-;aG5fFDB3DXh_%Z_9A?={slr?TlQND4%8>&
ze9u`MXGH}i(6&}1D~uPu^qwDZsC0e&p3lP=Gx*HMI;GVlvhde=tQfe8CjMUsR%9%U
zD=ty5Ioq?}zZM@|)PW>Yx1qYl$pxoUg^f8?%x4AewjywI7<s1ecy8y@oKxELj7*vx
zG!$&9RGQ;CD)l%ONd%KhX93AbAZ|clh!Bi_?m$_r1|^Y(oT~DK9?#z>tluV5i5H>R
zcg{Q*!}M|10TJYFiQ~PWc454kLzn)y9+LkLf0oF9S6?Rj`@QlXDzj4ZU;VHAAAicn
zmjA9)^!M81)dj%UoR=J=KHBY~*#l4fS58p(tEC~`8QC)xyop3SZR?eRh&hP8ZeC1%
z*j(WRXFpO|3)gD)<M<|kg+Tk^T0Qk*ZO48Df6??kSliY3Q4Bkj;^2hK_t>+r|30?S
zK|{wmyo!sr<uQh(yDfR&@E&IZKK^%cY~O39Yrw9EMRW;NiY9@&CE)GYkKY%2@VfT=
zIo^=l@9O-rR_@iIfG%9aYdig`Zq*re87pWJKpG6KhDxbUb77kVnZ>0yT-xedW?_I;
zm-m9c1-)o@&BG2PkV;f_P+L|Ru}ajn5zVTqXGz<?Lpx9kx(0Iub@#A9-i`g)`(Uu)
zQGPHqpQN|jUd2lKd2=0N%1p8l*)FLvwcIi_U8e4o>5csUd-ZAuULi8-__2pUc0nW!
z&=8jA_#j!9c8!=zVp=xueQ+16Lc4i|IOduv_SiuQWNOst$JfzfG@!^Gy+8@l!9e%p
ziBqW%FQ#y~Qk5|%FmVJcJ!HvsFZt>FqfTr4<x$7t2lT9l&kQqo*={s{z(<A+ygE8*
zw2%Iyb%>7*EBK-H%TKMw5AMSs8|}-Mdc13a_?fFe){idqvnMV>@aSSq&m)a@*`RAj
zWDa8*cU<}OF%uLXRbE{6ud6)4%3d}o1BfPv0|*ym3XGzVUG-|_-%+&9uPiWVHDu7U
zj7KOuI6uFFI#-n!{l#ns5+qOI|1@;4+ZbSO(5vzXis|X#1U%0H3BN4}R?J|`9;NVE
zOZLqB&x5Rnv1@hJr!~#~mXJkPg=ug4zg7%mnbwr(j|rsSU-emlzjacIz~<TPYC<J~
z17jK`hi-1KT_9u-_PSZrwk#R(PodypSE8=!#NO@73;IqP(2CdkxpR)*NYGcxDlK+N
zc+isrK{WSA91i$}I$OMM;*yLp4tGfc-!;4OJYdVEk4ap6{%jV~RoxUu8_l8sx<$(m
zLOC83U<&oCeuRO!OP+=<Fopoc6eueye<*RgS<Pbd<M{*HooBV%W9rQ_nt^(D2P3Y`
zjj5ItY&=2cbrmWt>#7A}84lcAMgrsdJ_HTwd48|W<p7(XaM3uJ`ZJKf7P#YNWr^`e
z*;!Ybr0aRz>>Mvi3u6kSs|b1xtWp-I;%Yz_Bal~DDmn@$?~~no-8|(TY?CsB(?a&<
z*{Qr3!UGb%n2KsbEN$NWxCaalY7&wtJ?4L9eEDDaS#tiTXaHZLjr;PyJ*_`Up8p@$
z{<{D9Q$F_jp9Y*S|7#C%|DFST@%xni;y4&%5XNJF;!E0%2dDy|eOnj6Kivx>owdc%
z5U79_g{)g56|%o|+&Vu$zIeSxW=z2(T3lUwW5TxJiX6vE>iGb>SFapR$`ed{2|H|&
zleqB)1~S*Av;{}w=LaUk$|KBj;eAJH>8)C3q6oEB>t?!S$=1UZ8PTM)2@nYMCV|>B
z#phAf3$H*(Dkadx%?)}&CQ4;5F6BXwOJ&bWnxX4b#Zn$p;t8>d$L;L;urq+X&#h0&
z-n_&YBn}-J)`Svr3&eS<BV#H~GD8{}HlBp)RMDx&mo-p{g<{yn$_ap0o9VhANLvJ@
zCIExzod9F^L!&Wqfx1wyW|0B=p)9%Xusq0DG+%j2SxM7igD!G8m{r~jHq$M+g(z)9
z=^%j~Hs&vGyVTS-T(7Kg)6J!jRNYc|dLPOllTQ>Ga$2*A@uBQdjRY~=bcD13Hl6WI
zN)TM6hdCq4N<IX@L@%fN5BmrtB1lTA*|ZkbeKOppL+7Q~qtLp!65<wiT^x7GxksaQ
zUtRk)m#ie&_)#0vtj_=Q_kRhT{sl}x?(zTMc?$26`5&JArT_m^K4{KF0}TiG3nx>}
zELzNgSH$byCj4i6^7qk`zqZYu{IJ*0-g{?@(J-0~yyvI@`TP63Nl@)a<Ep=SA=ST(
zE5G;ouKeDYapm{Ej4QwQMO^v4FXhVbEpz4Pf&5HYe(&>L`2~;9bmjNHh%3MM#a#Kl
zFXYPaeIZwV?@PGyd!Ove@A1jN_B4-DDICe4KJg3~Nb;GnGSlY++1&7mAO=#jix0w}
zXz#5<v~8$XtL%&7c^~{P1s;b+V7HYgxPi=z@Cf+WcrF$~ABJT5IxGT8utU?UGS*Y?
z{Vwd)Me`t8zVPb=eP!7g<~E!c$%*Bon0zt*Wb{>(?<jYO3=vEe!er755{3XmDHGn}
znPt1Ag$&Z>9(Wg>^Ou*ex`(Y-jmvh24m6CKc67E1Ba|)lF;ySfNPgY+=D6}FJ_wXF
zfK;LK0=Jg~ZHYsV1PtRQ&j9At{MtiTH}wbxY{t$>Dg0oip3~aVg$H*Ne+)xu15g@l
z=OIP8;wLVOa$pdNQBmwGes2hd)1+{^pwx_VhEzi(gTZMayOYIeRE$gFT&IVLzu~bZ
zF<e#|1<%DQ8tUOLIT$_!Ii59TYFOUD=p736L>w^b*1SiwL+YPmU*!<ICUC?^C{E4P
zIKV7~GMMQpt6wQfJVM2S8v7UC_MYdpK^kHIOB7E~8i&b(+GFmzUE#S`sqLYPBANue
zouq52evppaOf&Rw|F8e@oF}mKT=KrWe7y(F;dQ`3CHT`d47uI;tH19%?yi)-g1HY)
zOJpbW*rt$P%NVFYCa<z3%j6tfxA^twwxsgr#e3e@0~&EyVf-DZ6Mh3elRj@0N73Y}
z1cPHOp|V+{WwnH54t^Bp{iC6o!g$}y7r4MGWTpV1J2kUV?vui#g(zW$R@^c0#uv(9
zj$DudC6WP30U=sY+H;t4HQKX`0A-NQp=`-whO)A4Y7z*3yl=Q(nu&dM28H`qN`T>&
z&wGi5A{;v<USE18Y+CGqE5duhII|l$9EaX9&Wya_7Sw`56x-u6JhU!x^7~~kcY^M^
zaKi}p7b6&DWOH4dD);VFv)~_eaQ2|ay?a*XGQ{r6CW1bzAh`#Fg2m!moSawZ3!X(F
zBBPB08rMdc1(%$2)h1>!JHgG`_%zTXmQT@cg66z#8Aa^)dWKg&Sb#ZD8KrIz)Pq~U
zKZnI&F(I`pzEG{1-U^-NxwI{0;=wZ;selSCX1HxnaHNC97@?vh_f-XMt}%CCQGtJ+
zM#pY_6WF8OoGcEuwRKt*{+({nbfl<T-Ez4n-Y&yFWIuz&?`1UXOiVqK*x*`C0GTSl
zZ(zhG1I$#YxVTIozOzOq2%E#zB%*gXIgml=*<wwUQZ>no;NZB*tam57Aw|{#a<*)H
zJHT)s57-hE>-P>`tg-<(tFq+K*+_D_AM%)4kL(@7P?Oun1B5Gqs`jF-t(1h}Pcc1D
zCSSEhdU)Xo$5X!#oeLE+#h<vMgsG0F^Sdt33B&btgof>XEchmT>$nu?!68`B-I1Y2
z+zDdstH@cbU1t@HR5=+CL;W`z>RYakc-m$7B~sF9t5R|IbeFtvjDc-e?6b(yN_#C_
z182m<&{GUj(2Ew60iE_^k3$lv1kBN5K3&XZy`@%-)lAmPamRA$@l1^{6heAs?v^e!
zo#mBxuoG}V(hu=OEi<0(Teg5i$Synd=@p<LKF{9YE+=%q&KZ*_ewmJ>L~NDfH7J8Q
zay+>vB37&R5lqdm14ECT;e~lQpWU%I<__-s+S)rO5sxd5u{Gom9%gAScfCGjjLRN?
zGEepBrZ($gI71NgITj&pBjH041)zOinbxk2?`IK=Ht^%oojPxjz6&GsU7?|&Y-q$B
z@F}r}eJtRzhP;U-7&aIaY#UgrIHaO9AsdvnZ=#E<%pLJ#l~ERznbc6>J23mas4qRz
zgsRUbAPF5;Tb$j5CgBPk2$3HQyc+EAl$24;6n_*)!p0~-NyH+U**&G*s@?Fa%gi9S
zg~6Q@3od)nr54_S0pkie>?}iFySQvNQLAU+NDfUf(l6|V>n>h1AgO_514JXATHGmn
zXApE#8*uK@{t)i@p%=g+ygAtQ=JCPq9_iI={eS-bkL1h!0u~_m#eaae>HOb+#sB|P
zK94x~bMyaQoSt|Tg%IcFG@>&c?Kh;xSC>Jwr98s8LwrZ1A_F-KdxV!b@!asADO%L4
zyBJstJ{*D;=yfZ){5Hs%Sb?8%OabKw`E|9ndxdPIUZWiWj!l3QiRL()y-Kb6^xLOT
zzTK(q>^^%^-vDqxkG~1FcDA3955A|&t<RdLCqH&ycV8WMx-TzZp<)wO&Q4tiIlxSl
zM<<=u`AMVQ<>FcT8D0^hdN6vbLrOe(ja{vf#zRvDu=ps^WP)2jdy)aiL_m-tw4ZT_
zE0TjKDnwa`Ly{0wlEOkUDGvmnM*~ZPy;<fzn-WrD6^`)N=l@HeCH8+h4bbPdanJq#
z(<dqWzo(cI<}d#LCwy%CKRw`_0;c`|FThi-s#64f2xs$!k2!byz!-xE8UhL;wlSc2
zlx_Nl?Cs#oeSo+B6rer9VjOUK;c&tM5$R4EZ_{<0Y(9>~u$fUV1E(Mb>V|U^qpyq%
z`1tVzU74ubkzIwgQXhiEO*}b-VG8AUjSX+ldq$Pv*Gv5Mt@_n;e!aZKpEWM)6|pRy
zS+LYRx(ZN2FF~=G%Sm@$-lAmLP(O9BYzhP@J2_w8!*L>rWABH3p%BQcbZjAdtb6R}
zrH&?=T>KOy{{>X7dOu(Rr441Tt=n+C7<0LGPY#s66}G#G5eV@~1<EGz>fNDr9(Hq!
z->!Sf_w`M9Q!1mPvwuzIDE?^Zw5<-Y{b&Xir)UI$HXo)F3YY5o7o2qDq80%8U^yM*
zboo7Oylldb-*|b8|H3$Z<ikkMk4ZMs)5Z#1q}@>Q2#a*UT-{3Yl6k1mkDcg^C>V8{
zYir-SPhO^<+^($^xip+h_)*C%(pX!2w(dSUJzHCQVxFCyUeKd$=Lys+@*4&D^sMBR
zXiABOD$sD>zm)eHwPxZyAW!c#rI?GzML>!^o8Ap6LC_)-$G$`o8Zf`HKMAL#qV>j6
zZ02WNW-nlzL3iGGfsqPBWFQ`y6{1HL2%D9ftV;NTEhBL9QpD(mLS^rHqKdI+Zv5Oh
ze~m@tQ$&AWsaC@K%0$W7Dyl2Lcu_0qLn}-x<^-rt;#rQ^aCq^&X3_E)Fk8}^E+JBG
zvS=gSgGN>dUS{+(t6Vc(u1V!c0OsuQz`#B9r{ojHyUB(pg8?f@ua<Yy4Lg+AapU5L
zT5(dIqOah8<9`;{E^U{dKcAG~pJ{1nJKHO@vn}oXw`sJbCab$EP?Q+7ryETZQ_|js
zoOBkiTNui_d3x9?hR_C?_nuChFzw4gv#|8y1+PDJoaFXp8J4$g>*)&%OgTcLgeAJc
zfxq8yCsaLwhhF4pT`gwx7Wv9v1f-K<-?)vc%C`A3bb+Rh=|G4vYz+2|1oDj(?oz+J
z$j7`<W>CxUUI^X|2W?$51L>E!NWV-V{W242sE-cuc}Tx3GpJ=q_XO#e4$``22GY%3
zq?-w(o0&*Amm}RQGpJRNZaPTonpu>-%_sG3lGeA`#J;_U+P7r^w-UW?U4om+8Q8~y
zzTKIMVXrAvV}+|h9cq*b8!fgl8G5BH3y|#{ETMxz>L^BKzuYVLOZP2T>h;=xc^RdA
zy*QQ>GLvyhp}rpcQU<cOjO?F)Yu}7yNsAB1%!7gba?Z5CI|rc_cDsJSocGZto5gaJ
zhH>Ddl#e<ZABEX%d7^?6mz<0jN1gK@U{=*AjR8*^cC}`(s5QH}CQ06i+rEKrfjYYQ
z0Ugg(To8iHP%w@Y?JE@6P2C=3!Z<l>{rp35Mk``6FTpne_1_AXwG~rIK)p!s2xZ<F
zNxU+^xk(?9hGN_WtHJXh8jLmvJkeMS=|i#oP_*M?!4S7t5Vz!vWPv+5?Vh(@udONB
zLjyWT@D&XQAN>HMPY=yd0ZjdaG$s^~;v5k~Gcgd{n8--K2>}p-A%7r)2yAEF64I~W
zXyO$(;@;_50YThF3%MJR$Z>cg;EANNCD9q-cK}iOBA<1P+O@U@@@u>XXYBqgBm;-_
zF9W?&0n|^=y2qzKw#tt-*Bai-weupZv%Lc#$4i)z@ZlnuUiAklbE^v>9beui%e_23
zZA($Fsmm5$M$xGBa-Z&IU~iiCx3-*WCr9lh64h!|;evlB;Yim2=6iYeV<T0CoURwa
zo0o3|DJlHAefm<DHa&RV8@-WUyj`<_QvkShFA$YCFs+&;8~#NKz73b_HA)8lMFM$)
zbY|HMTo8ws0vfTgkU44nl!N^5AK7;e_RE)Lr_M#I{mLni?vv8peJ``~QnPV*m_a2(
z4i0%XYS_x<%e=CcWZC1(j5)+*H<M)#kABQ6`zQtXG#B5mlV#6Nf66QSpUJY9C&$UD
zSV^p*lhaPJ2;NDkQnC_SC&@zQrqU{kWt*ob%|<7ClETWV(*MsHO{wz#j?b_>NEd6c
z01xo51+ew+1{k?La%T@@l9jywKJXgCLwWrQ(w)qD&%K;_o@ct7T{EvmsfkrPtqW<E
zsv;?iM1kiAFTAFMB~<ZL6<AMhljq!^sbiCo_XdK3Fo^1nc4BIh6@*vDWz($GOKJ@l
zc^z4AUsf>v6!*N-IBL6~#4>J4RYkRP;2-CDo>=vq3K%IY4g#c1P*PNTb$Z@DJw4;P
zv2enz1FV60cYs#mkSXx|JL(2<0wT-rp3E3x2wOX)11k2BQ3AMU=dA?Xih}D|lT8hu
zg9$U89lHbdt!A2(3=aUN%;K!8e+Gq92X+iSrcm!d-nfIxOtyV=kyuJ^icKK;=Bu+;
zTcKjiTOhcDqzLmf#D8AurPw~bkg2@ZA4LEj{ii<ovyftJDfKdi=<yb$5h%VmC{gE_
zfC%C8yp`Ia5ZYoE6n{87Kkb~pd3pP`oE+*&Ne}OjjdKv6ECy2ctf|C5a4MnohCc(j
zg2v;c$7+Us>%ehxc`RCl3;U#|+bEGm-1;A&-amo)icW1_akJzdO+2;cIB^O20mzhu
zA0B2m_L@qUZEVtcRm3RYDjP~vxr*u3_MQUEkYW_H-vKPtzf*QkH1$}F=36yPt0Mp=
z!7Zg<o;V8LqDIgxP0viKk~jA6NKHxbtLskBn3x%T!wP<%u4+uDc+6t#iJ%0CBMH3X
z2=g|Fnp&*bYBIz`n+nHNo5D$WeiF8BMYT+_M}jIS>mHKw>=Hz~cNX0?_<jKT*Ho>%
zie{9@29^!_N|y1iV;c0sA$lR+-~mE=J&K(Y+A^?#o!{>V)48->ghm4NTO9hZ)J^~K
z7U*64KAgrIUJ)5U$+<})9POc{BinC_@$`#dCh#ExRgkRSwp&GmwqQ1gPFKmPQ*IE#
zSVbL-y>0ZOfnmqU-uhv^va<(64l~4kzFT>`2P2et?mgLaTE&^9PiqZT=;@xEoue63
z18ELN9?#PkB8}PAF{)D0?1Fy5)Iy!LeLsb}Gnp%rkrtJ@OqWWOI8T@G4T>0Ro5lun
zL?H5};tyU%MSVVuW*W#N`zVcJ+exX9QJXy#ik+iBjTZh{H<}{(;x`s+e7kQrCLGrJ
zcBnX3$}Q{4sO-WRzs1ahmR<{Lzs#&G<mH@N4uBUgyxme7O!MJj>Pav-$_))CjXA45
zo+N5??yd3EgrKmfoCto8H93aAMd_{DTfSkFiy$4fos<`bMUn|>I1k38_W`c37_-{F
z7Yxx1%J+neIg{Vc4D#xz)jquFo>4m3%Zu;V9&i6E!e=eZ|0L<kKD&+O_8*UTc6WAC
z`JZarf7yTh86PMAlMFbSe>|&KYt^S{{qgM4cKuPU=GC6;)gSL|KTBJGG@)8}wV0V;
z3(62=<(wd5`Ozmxw&90<V!3oHvyT_qv7uz!`}{qWvG-^FYwAzo?|(1gatFi)61hP7
zjW&3MFvm)$ewpSEw5IUyf2U~wjgyNbY;-=0MzQibLv}QYCKZ1Yhu$#oLAVMS0}M;>
zx`p0mMHM%7UQ#N?8{Ci3R7VG?vf%lXI|Psfi<_FH;j5~vYRODl>~=3Y=SR&BA=&L3
zmaP!CZh)cMSE`<RO+h6!FiL;u!hlB_L^Am~8gRCcPA-3TtKj3a(~F~@Q%?`ur)RB`
zwKYoC5e!h)^*}6}`Ko_=US%{GC2~1Y)$>;45ZY>)x)ku+t{qAis3q7QH=3sxE1`SX
z?jHWqJ|tWRQNU6THtZs7H)zip4OGS5h-vDoyd&^EoZr!YhGs3X_w%DuJbGN*!GrPo
z->vv=F)a9bFd=*3;?FQ*_fE2z7ZVs1jee%7tCC@+rjLVank>gZTy$E;XQ}5$7mZHm
zmkcVx=%$`tV#@dbhfoxq44KXvo$u-BMmdN0mzXoN3?R26!Q?|YizX!SnS(dV^++qu
zdxzQ9(I7fN5h3=V%h#|VrJ<vfqmDjD0_0_Y`MiK^6krovCB}#7yBYqI87@jH_E-S8
zv9rvfv%>&G19M*-qaWRQ`4rTHf}4iPDpSx8+%nj;wSxLqNYPh?ZcyDHaQ+b@knSq7
zAQGxZQS=^rtLUnimL_HM^ME#OkeSq*Df>lo?DdHsl2QCb96$$@Q8k(ox4aJF1Ot1;
z9kNNA{Ln5+fw=4ls9_S}M6uaSu%Q|&o6ibs<UI~f%s;_y6y3yS@|H&rAAii#0z)x*
z#f`5vN=h+AG+}$W5iDpjhC@#v07S23D(YV8xp^D(7bGI`=B{oCIo>p$B+(EsHLco*
zN9SvWuYUa%cKTm`P0T0tu8^9EdPM0awov``*YBzTVZY#MsD+Ftzy6BLLY`wyM`5Sh
zbZa&fH8bYC#s)w#E`!m?tuIgX1I#`NgN=_d1f^p^g@w*fPhp)rTEw$Q7zttYsE{U`
zD(4kqIJN{Nl|Qc59%WF`6orYEQ!tCJk5(e<qa{>bM$|_u(-iQCqXb3iL5iSpRLJ7p
zP~@U@rWt^qy%Jp-9rA`8T?$T$3*gtuoh!N8^)`#*P~lMl_r)C02ne?g(LTsxta`;$
zy)uab`HOjk>ykrY5IZXTTBw%tmbW7TQ2*8nv{+KJNxglPNgE`$MI7xx!>m!o--egL
zcsinQ7?q3ILDk{i$BpwJ6clmnArQ!A<S9n)3g-*fE};hz14CY`z-ySTpIbPz+?pa(
z4u7)v&qj>U^f;JZ^|iv!XTFC#7yb5GMJ}iEaL$gby~Rj-LH>PHXCODp*l?T7+7oCR
zp|m#(e2h$I%Q$_1qNdFJI*N&_8iysA5v}S~m6V#8LzP%4YVa+eCQ%@b$GE4f$86?6
zeD{%=f4q;EFr{h_=yFG!%^)(eA-W4|BZ6_}j!&~@KZ8#oDc1_$xo>2^fM+K*{nuQ)
z;_mn8PW8HVu4W86bY0CbWCA86Aq^ai?MO1Z)7xN%ysJBp<d;i-pH}H~K0{fitF?Xp
zAo#}u^)6~KWC`;EM6+C0fYL+QBMpG7@B`UrUPaLWNEP9sv=_{8f`DDH@Te0_u4IKe
zQV#WOO@nfeXqeSr&q7MoM+ZfiefUbvFfGKik6z}~L5<<SpAEEtZ`I9~_0+&CT^Y?U
zT?=Os&0SJ<!%*D#cLeE`D2DwBMM7`|7dB+2DXUiLq0;+{g*;iAE7Mdh+ms0mUP>rX
zyfSR-RdZxkhX=}x17v)8dDK4aHZHo@7}UKYS-O;YY_Q9g(x)v<AX>tZPWD3}d*Xx&
zW6<pmg8m4}Q-rNMxWy2Jr3{XnE*p+jSvm1hon)o8HTK$Dx04=^k$}-~PX6^i1x!?g
zjA3$WM~wu@-AO64XiXZjXQWCIotj_bL1^ZOI9UXY0;Z!x=E!8=i4`s8aX3J8ciKj)
zx(U*<<~G3&iKWDO$!ZGQ=>^N1T0Z5O=hKUfS?;w)!$(*BJ_0F<OKa@yRO_^L<GwU2
zSs-AyFI<O%K`<$>RUc>Gq|2X}5*N`fg4=o+dphYk9T7-c8{}$9fWrY{x_xKz@er-C
z$Eo`Q35y4R@=xcOh{4Fwy1YKQY<9b(Jt^v+o3-t2Z_AUP$44ip=UC>&fw!|=r?M)n
zv;ov=ze=cW1g~z_pG$<&Zns$c5XNCIM6E$lQ3+Fj$ka|_uK{I<!qP%+UG*YEukr6~
zk8Ra@FrTiY8;{~3d$29W{uMm>$0C}eD{%zd&e+2M%i5nKDflsm@~vYshJ%3p7Z_q{
z=lu6Jnj;oA3f`>;|GMuk*4Cs<;p@0ia(Bc-ay;gJ$96U%V=3ivWZB>8Fb=S<^=U1V
z>$Db9V5W2MpK!u=ckpn<{$Z1;o-u-JPqwuN_4hBK!rb&Oa3`zyBg!3btBSv*nl!P>
zV2Rm0->f?s5iEj1MJL@b?#^Lt4T3qyR<X9G6+;T%g2M^MG9d=H0fjd(lrU?2(CJN8
zxd}FarOg(T2}P1Z_JF!G5aVFXM|at$4sj7g*#pILYfHo_fvN#gi9Nz^vICQQ5ec1X
z^?<7wD_IKi#Uz9dlhWKofp=(7EUksHk6*S+2|gnVSQ}nOJXU#>556n#yC}|1q9VO6
zCHL5jiZ#A!<y&-mC-=m2SMg~be9ljg&(d0<S%eW^lmHrAGZWZ()va7l)<)HPI9d4W
z{(LE@mGp581WyOQpxLiK;b<vFbSK>m7qWvWmXQ{4z@bwNh({wh28?1)5PzgPkd|Kg
z1swlhc!i7?b$o-b5~O^6(l~A<$wBH%#kdmvSDZKJq-~d`MKYZQa|xj5C-jv{yi6#R
zN&J_{NW6H(yn?FO$L;j#M>+(ZB?X1uS+ZR}yVNsBacQxSB++If41q#Jux<@`K~AT#
zmpw@?c)|!~1ShRNQ<$thuGQCVzJ&=5scA0E+aCoRgulL;m>i9p>}`AyP8iuCyrc7Y
zin~=cR|I~P1-*bT3S=AM4|Lak6qPXa$6Y}~z!;HP5GcyKAVNUo2&nqAbj{#_ehgjv
zpi+J73k<x!C<b)6?xAW0U3D=r?a8I5DTTxkJTXZ)iZ3DSfwI}By5uP>k3p^AKhj;u
zel1NWxubediDt;L5HI3Nm@cK*D;?<9Q;@H|;@G1lmrKf60f2CDORg)SWcrHdGnlgK
z1%@b+Z0nN>3zJyyJ4s06!9jY^6)cN<43|K9Xb}exB-j`f!#NCtp{Qw1T6^rVOLm7S
zZfGx))hDSynRawNn3{2MilJf$a3(0hli_F)Ul;XnM2lv=%zN(95S?0zy|S~C%Di<L
zVp3&1Thb&+bR|LDwckC#YG1y<Q_O9b-~CjL9+lUJM12VS`1wMR=iU_`bze8n8W?O{
zEkgHl1P|j%-Eqa4lPi6dIoa#q_2JNkjDq;_Gynl~GKVrt<V(uI+{CE?5)dphWj+<d
zVIRH~ufr?tr9>hOx;=5Mpcx|+i$^}akZOVxinb*$V~=FL1MmZO9kRB_BtO*@S*ye0
z2nQbie(e=+eCP-Vn&hMi6j4VshGeVvx>?Gg?(t<ileTd11kMhkx{%fC0`Ma^Y=+3f
z=*%mvTCuesKyF(~piCMIpe6D`IW|c1q=qy^^orlx<G{4;NB%5!hz%0Swh5aMvl5ad
z(>s!Pfi!^+Lq*9F0be|T#B?|zZCB2iiAt1_UUkfX&NN~$U@*O4Zp9#j--H}tj;Xz2
zVugBcpmJwxZ-Ru==%C-tiLs(kchYpCWhF~A8X!|Z6J8L`!zj6f=UG!w6pJi?BF8Ck
zh;0n;A5kMAYZ4w;x4HKVvV=+Co6!yQW@;b3%<GBY!`vh+7<zbtg2@uxexOcnB0C?>
zyg1?+nA9cv3e1MU*+4k@99kr$o<5agi0%+(f&ak|M<k#D$c?Gre~%MdK`7;PR(h4u
zU$$Ysci`A~Sy`;C-s72)SYtMV!O*4~)oK+@wds<Fls^hQUYm>q(%KhMcZ$-CtUE+v
z1IlcOi(pEwbNZ9f(c{y@dwV&?`<Zbx&~*Rgj&2aBA;5xFG*fC^3_ZE=^@e4YYdX21
z8sEt48uTD*!d`UF@9h|cT$cMK;H(&p4mqXBY<KBy)>E4hf{~@Rn3Zu0QlyY7Xnu}x
zq9Ko%Kll*F$U9htbi;<^)VBBL4a|YJZ}WPJeOg<qWpSBTM<@4><A%gXy+WI^jnuu<
zJ&P2MNO;&u0O9$nAHrz$uXBfr(9A#|4QQ5d7t;ZddfHvQJ|n*H_su+}xx62A--l%w
zp0b?Y(C0o94{-9i?PYgLkYBe?O<~uchHRT7Cp$PnV>Dd~p`nlQ_yX8*rHR)yb{7&L
z(nfT$3$pfEjCJH}NcI()VE{46;~LLmbSZ>e9~t2TVt8SKq7N|On~A<UlanOzAvBnW
zlg?sJWqX15j|JxYh7Q2y%afPXf>$_wo9u8c5v-IU7pbsu1W{4pHB{YMU}>L1mBLEs
zRK3nUEI}Wd-?y4S*oP%m$vN;C0%Ce<M?U8A#i+y*a^j4zq~ga6<&Tb-;|OTRdb=kM
z;&hOo+oQ}eYlm#e#TUBn&Arw%q~JwEJz4c7<Vx4GAs_wmbVYWUaKxPrM|jgl{^rV2
z#S`j7x9~tysc(DFy`B2gC)=*XBwb&tJrNzARDd&Jy|(*w_u0;q-R(9uhu55>aKX^p
zAg=>7?n+V!Qy_QhYG{~K7U+r(0~}dvP?4S{SRT#sf;Y=v;i!8Fb$3YfhOxx0z!g}9
zfhO@a_fU4-ht<41ZXM?}iWwp$V=P7CUdTp6+3hVkUhxo1lX%osaFh5f1u75`wgWUh
zQME<FO%Too$}Yh^k63oe>dK8G58%DGAb>y;x96Q}$D&zTkZs`bZwN!f^z1kO9UR-D
z+56b=q#Hc@NyKNeL*v_b9)c&k6`(wY-GZ%tWgCXjsJfj6j#pZBcee5jTC<1IEx_+n
zk4Z~_Z)CwFpu#||an8;}HF$1p0eF4D;;KEtetKjDlUz?p43QF9D5jrl9MP0D2gxO1
z@ijlqSa|>qeflm`JT#ZbO*p3s?^XF4O-j&!Y!c3ev!K72#dzGccQ}HMartmFn*ojR
zqI91uWl89sE@o3ST;L5TMz=#bdIkz&G?DW;!U%4!{RInaylT>iNYyhuM{aMYdwtPq
zG=IqMHf{v$PYb*9T-{v5zN!RoGR^hLlX9t|mv#uR2=Gb@AT1ER_L}ygDoLzWDdhr@
zqycnkvX~Goia)MfhlNh;8>EOBvy8D_7zxJ}GAnGoJ^~5%7YbvNyi2fXxAu(b`epA8
zg_K3?oM6XVi&Cx~Nu01eC%as}m`4aOZq$1;51OS6R4juj_RpP34s+3!B#hb_E|pSn
zmC`*9)NJy3lFp+D6N82WHQvDYE+TFH9h-1Fu@bpiy@7YbELl(k6`efGqqN(xBe;qw
z0;$~+qGOrU`p~flFDup5vadL7w`OPM@~pR8AULT;Xd#FkT=jlrs$tieNJ#5GX&!w=
zFoGlUj@iptn-mS1jSywfh3=2?tKo^vyf1O<GYF<~=_CBFDHJKj*J$xWcT;%vb2pje
zJ#QZ!sktO-+9k!oNLf|tJF$#~#2gA)R0_8r8|Nv^EMG*lA-0TbFc*i-oidlWSAV>n
zQcdW_veBSuGMB9-s4S+kR6Y|2)si+w5MwzE-~Os~PKFeMge2&og<`LTk-xZwBcgs!
zYc|=K4RCFZW5a)0h5VOfiE=_exjcSpEGx;N68C40LM-aU#8p}jucTchp;YcILO9lo
z>mCcuYJjOJb2m%pR|(`#YF=F5q?#A$%~JQ`-3UXe<Ei7D!~<>b`T0~jaDrVLdUX#^
zFJHD>8E@9O5AG?X(R9hoaT?e+&f8eT7%@S6ew#!Iqya&Orm2>m-x{`V*iyd;vKP(9
ziE3IL^M~Y7?vvrN4ms`CdUf2%sB|+6=gCSI`GL2p%tEm>){)MMR<(Hmw^T<}9%(Bq
z6DFVyYy+rui!F+nd*%78F2Jqklqq?XOE8-xYiotCN5ewaYv?<^#cUA;TXkS{vly2r
zrL|bH$rR&KIRT*T6(^-qiW`|e!wJ|U*&dd`6>RTiI@Oig+MT0L|GJ&JN7Nk$1g3xh
zXKA4Ji_?;^62mhWDLbI_rV8z<jd>|A25i~5E3;ab*Dy{tJ+v7b8nS=2G&7{VP3mO;
zfIk=%eZI8yOIv(bn<x@5dZtJvv&eWcGDS8siwwdKrpTjgD3OJWSHZ+2(M%W520M*z
zq>lQQF0+`70m#}~u>yb6uY-Ru1Zwu+AhVg#+$!@tyGURc$p#a~6MurZ6u+`shX*hx
ze2PTsp3o8uRBUZgb7>_8!$K!|{gP@cRh5(vt5nBdM_H!$#xMgDfZ?Sd-}T=3cQ!QN
zg~wNjbFavI%H$4n%1~T&IJV8NqXDfRe2Mo~^XnOJSEOi)$%74LZ)5saMc=nGbeRMG
zV+{O(i}-ZG3VRg>rm%M@A&PiZG&%769J5D`Sm}yEcnCFrgm$NVRU49i18?zWcf<`P
zq~|G0bb<h-41+?<$AG25Q6OU}Iy(`W;byx*>!;oB#YL+w=DlpPTQu*&oo7#MD@U)`
zJ?<X;>^_uo0Hb8kJ`Rz$M8mlj=*wEwJMN);mUK%xzG!xTY@J&{KHX_m49f$ICEo4&
z@fg<Yz#EufVLXRJd`?ZAU{D)4^I8g|H<37}*K!rlq?KSisCGgH6ONc32vkDhA%e37
z_eXvV$19|q$TElIL-Vs24#Ehe_WsO|?@XZc^~D6W3$!GgIDLLsb7#~Y?DOr^s5{#C
zKJG6i1di43-iHXU`$u^AcA+lzy+suuVoc!y#<+U&^zq}JZ@=B$t!+Pk{B(D>y1nml
z%wa4yN}8EGfO-}m;Y)YUUYeu2LkS&^VyVdQ8J(o4$Ojw;cHpwOG=jRg#a6i5A8iM7
zc>znV(LQ>8g302$9Wfk5S(c8qlC8-IGyVwnbWZM&ZM(?Fe_c<PkCinG9d49lTznOY
z6PN2^qXET>Df&G~x>>FkD@}qV5a`j#om%4D8>n8ykU^AmQ5<f_+7J1%3RX23*f6cz
zD4LHCRlPbgY=Wq3Jj3;BfeB7`8Jn?MG&qHwap`=2e)`iR{(An4l5^0I3w3Vff{6)6
zc(ziSUgo};I}r$;L*BNKjbV$wji-;|U=Dx0-~-TwBb9A!iRJ?8;fd$b0AzOUozzto
zyHeA-^_~S+Xkeoh*9LsmdwHjn?PbE9a|*|@cX7+QD`a6lVXGWuy|~HwF=9qnb!9G|
z!i2M{#_xG-#Fc7XR_>=%Dba1x^W21SI@m(D+n<gWG5#MN$*FM*!Q^1mNEO={44n4m
zV$yvD#t&bYL7c&Sh`+=7`snrX-nodGJJBBRcZ$^pH7hUB&jpSM9JS4P;#F!1P8W8e
zCvb#EZ9Um+4L~@&GXWCP9x>`tQU!Y`@lBU^ISFqmKWLh^Me@N4hQqKQa$@Ox0;tN|
zm0sDa<<kOtENw{flJuG=l-W=C(}ln5<|0Ae<ESNI#+u@iEgh~0BKzsMrp)h2<$l(=
zJYS|R>ibiQR-?4)Q%sOK(<*gfNP`6(59LLLY#9=4Afaieu~dL_wdh&K)(YP>yyvv#
z?)ex4h3S*EvUJi)(bEg<qp9Ldh})$0eU9iYn|BC>I>%=xjboLMFhL`Ap!V6Eoxy2?
zX+|iI7pk07wh)U}FWifw&U%D;)o>8Zf`M#LsPqj=spu7GQiHl{%6QH|K;k05x+LqP
zy@g1?<(R23^O7Jmu`vu&mW1J)D~;ddemG4#%|$WLH{YWtGrkT7j9KmglNyFK>n_m{
zy4WiRXmbE;49@QT=^fe?7aqY&@>u?vKA4Uf3Sii4=?9$q_LW6;fF{Qn5tYKW76Vfl
zULDXY+91=;rY?SMK`9qYK$D=VXS9mR);Y`c*qY>1iZ~ii{hJA?fr1+q*8?ZY1Y~C3
zdhEa-5h*5Sc!#W<3Mf7ZP$}@oIoE{Z?<A+ia6Dz#JdaZ(S%T4$7(r*Plf+4c&?jCt
zcFfM%SeyueY8otrMO<lh%A?XQBleCNzPzF5GK8h99fy3QRzaxya2&e1NZ3Bcd2Py{
ze%TwNu{?(GAQLJQPSCnvIV@7;Ldh$T6evO|<|hUeULCbto2Big7$+J;;^Xr&CP%hp
zd>yo--Q83|AG0K}1Fk4uD&jHSz_LJ_xMQ`Ab?`C{<|}ZOag6T#Q7i!-?9|;@H>VYS
z4U1ta$d0QRgyhvHPInvV_g=<i9~&{l84bv|5Cw~k*c*(Hex)j=7*BXA(Vf<N3>pU<
zUE~nNo!G7wgTUvs**>iW>=45wt%Q(_<CcL4FdFgkcPNL8IWXf63x-^a)|#!2hvR@h
zWp<9?9gqF@0WH?zR1N_oOAbgQL$S|fv4hO<9=B^24oi%UlF(_Y1ZeH;u~CQXc;$J;
zpVXnmvQ{6fwh5~NH7D@`796pG5T{p%YSnYstCVtsX{=5x?A|)L(=?VbR=aZ97=Yp(
zFx|J(F<@%KDcBns$6#S2Jx%vE$=Sz^CT{mXyDxufALcSEMmrJEMGa(bh&cAOOjc=U
z+HJIc?wmI+&Kk`Y8Nc7KO{I_)Cd8~F;f?#=z@Phk6^RS@VvcJ9Z|BHf2;W`dp#Fv@
z&P}$kkf;u-G;6xy=x(n=QAw3pzaVU03_*DE!JHOROtL>(XIl6%nuk*pRw{K4Hwl$f
zhDxb}sUZet7If@Ckra5+2sW8c3EKF5bt#5>8l3uagAOQlTZ;NHL39j`h_z7H;*G|!
z`uG$l@JR+^!S2xj))4;1Yo;;$y~Avu!NBRC+X-g%hV8aXIR%AFuTYZF0*2nMmF_J}
z4qdB2<t_o#$^Ag7+sUGdurjaCkJ~MMIVNtI<7j~KyJr#}kG0(95{g`zVBRaEXuciW
zsJdXg`u0pgAT5zf0y>b3D!z)5i!N@Ti~t3N+*op%>K^(Ba5mhOUvu!8lxMqe6+GMG
z|4Z&or=|`%wvLj)`M8T~Yr5UcI3*5@Wgym_unb?~=2nu+Qw$igX>fuCRJAJ+Yd>&f
zor={sayp{1ZNjY0obf_|M(0k+1Y;j216eQ%&%xb@scpLTuMW-or+k*ge<myPYX9@w
zSRVg*cl&8=I~o6Z`>*)Vf6m8_|11Mu{@~TC^>3@S>Jth7{P@xKGYtRy_{m=VNjm)V
zAw?n4abhXt$0{+OEyrqqc9j>-*?vaMn?gM6{ezJ1I$?9@%G=2kj;$7)C;l|VN7fUH
zqUt_kf+U_ri3g|;N<4~szkx)Ye5kUkJ5OobOFiR$IuB`uCZCNH4?c`J7y3HK5^@6H
zgT#ucl0K<u1iDQ))HFdJI+_e4Z?hkkol2WnytHp1q8?U`|I_|5I3>!|fVz*b!WhmA
zMR-(Fxj#_Pi`rb<Ymj^`=wzXue#glc5Jo>lJx06o0-(?}Xg{pHKnLvsU_meB$3CU|
zrbedy^I%l83PRVyE&@kfDlbOWDfH}PX5Yvk{Qlly1P^RqQv?sx@OEF&hL_Lr{EHYT
zx=yxN92$l~#TcVqQjiG5io{va0e+Yyv~62JVQk6kJlVf8peKD)*@Lan2`Wtup4G@H
z>u%D&o<$RsYbc<CQopkEf<Gb);I@i#H(`r`7;o>R_epBuukR_^F0@vr(qqaDK~zR}
z2Qx#kh|*J`j*oICEA2B9i#mz!de~Ad^TLyI-ZrO$VJHLyAAE%W!@MBe4(R1RKk4~#
zfKS=y;((Fic_V$HCm`JJ8xYbIniNp3jv_uNS+lLiWLDJC-N!FiStR1_OKoYzg`p@c
z)d_`rL13w+V7S{$;W!k^1;!T7iD9Sr!G~bPGk~{-O@C$<3}5yj<?IE8zp=t7LLV<8
zEQ<29@Oj<uGh7U1fz}Z4;)TMsi*I3}SGX0AOI9j8FKC8!EhdCBDud7HieBY__{-c6
zM`Z2GD;6{QfZQBo?$2-}cED8gqs(KjjT1KmLp7JV&=Bu!b;J4sti~w&v&xIGOMRyq
zhga_Kt73ywbDYwQnbx11Rl^U$m@g7s%vWi8+i5}<+}@W+B5+peUrQ?l4F_;Bv4&8l
zlp1o2*PhKH5Fv0=f=W~RQA{&fsbAEC=Y5yr;ohF;w{7tD9)@1AY$LsN+rzmz;b!gH
zxB+5U1mWQnC}3e-w75OI!zg^T!yX_pUg0vKrtulPFMF8GII&sS!Cfq#P7M>KNk`~f
zd9xD7p2TKjkTq~Ie}6QPtFHrh2L&p^7xWj|!xvjMprm4uGLxxVg_Z$MIP|lcVDBa-
zlnkJ?f%&!Q7RlS_hZ}6uZ!IV3N};%^FTqL$Zbfflx|CtuHp8*ULKsixVCuX+hUYkA
zY7aKE6j?~#mY(zb8Do!ohnhe<U}#s9!LE>OBrPdcvhW)e-Ik?6t}E2sf})(pd4I{W
z;i<Qb81erWVgRB*hPWPQlcB8UBmR(G7k&Z<r<pc|H##-+D)bUAKqe?Su~C3x8d>yc
za?V4b!N`ar{SmB?Y8W@wR)XZ<2#nDA!oi#7+k#<~D0C@pAXzV%H^8>@-%^%20M{%y
zEH<M>+Gl5k7VtXtqLhb%E@wSnhLkDqzDl85OtnSg*>_$6btwg4Bn99`x;sGX({BHI
zF?k;js4BV3bmJL_f~J3EEAC_|J#si|U9|}(hL48_LCL&SUlnNy6`R%wNIy(dB27zt
zVjl<85GH0sQSYhD+CHi4(v`)OH`o*@B%}^yJEv%Isl7~1=Ak84+cNbqF|RQIO*o=e
zRpixH%9x8Cwz8S?e)fHL65QYl-o{%!*)1@w9il{Q>;T)*6A&MnQlW_HDAt7sAVq}F
zRbe!D&=tIJYs=yrJ;srmN2C{H#9&_bRE0O;TTGWK_@D?cy;58SN^>q(lG7&rSr;A_
z+v&rfzqp0<W|&2ip)w=H36+p;RqjvsW5y)!@aPI(&X}ojauxy1C+TKFvf{oGY4;h!
zeM)7CxhG}3Z^Ai9Yejmg9(pKV!rpzcv8SJSnqwA`OAbr>`bBRR`0v%vj}C;910lV1
zl<;OAiu41VLvhA?npmWoko7`Sd!l^LR)RH2!!o=>aJ3XBYOni7l`M(WX&S@9bK$t-
znAs9=DUqe;d?GNSlU>?6)w-Qo+Q;_Bp7VPMea6PvJW(4HsTpsz>;RQ((Y@3GAe<08
zQU=9R|D(*s4ADR14EYIbE%PL)SDHntgpi{iXGkiWYQQ#LY?K`FS#%0UI$^4e5+O;v
z`8<r3Bu?s#k}Mlugw_F)qA0xBP~;lYCd>?r>T$KS{Nu{`&cRO~*}k$=CU87UANH0@
zdrTXN#NzY_B{sWPHrD!`;zD|!7<P&z;-Ms#;^@fGr0RNB<kv7sOPce!>@a7;Qm4~k
zt`M^L{!njH7SlK9b+_p@G|f~>Zng+=xKvcPr}<|&e3J6~ZrqDTuqU-B?+ID!V^V31
z<U=!#{jWdqmd){x<OzIRqJ-?lui%^3(QfZ2ilMb>aXK$g`=vFmw~g7!r+qvZlBRPy
z=dBzuEhTEtf-9^He^l)veurA{7|x$#|CUaVSiiLH?#t6zz+sm-lYlylPh}rtaM-vF
z1aUiV{7mr)XsApv^cKT-Oz{@|4CAhZb^FHSsBGQu8yA#)9Q&7mYr*;|ulh-=b;tnz
z>%S7B!96V|FvSM7Q?($2yIw{yBZD0{1A)R{R+;S#7*t*qY_D4#$%;#_@zoo<T&4Dw
zj0<(D?+k6IGXv0KA<{DlR?_RP{hX%(HB*EFTL6B2UA79Rq*pw$lV|fBP~we+b*MQB
z?SGQ8e9w8(X&klFPq{ztGs)*`#0I7uw1=bjlALu8v{Y;p!tBg?E7eQP*+}hF!Tu0k
z>ih{Of~NzJF#hC)1)_mzmvQKl>w^#dz;Y8wv@v6{OE>dGb(wN(?@2dj(m7i+FvTwS
zvY(&tIcwjW<pKC%&mrp3#Sg_9ieMCXguWZ*@*YI5nfy+zOGkS7n3|75H+%lXz-%$U
zR1WR%pg5KL3*uMi-e+IFVG-Hj=Mh@7Pop?g2^{dHGq7ae$F^_-?;U^?QGg1%D_30=
zNiHqUJnN6NR@C?2O@hUI=8rb)CQ1xYR<^KCTwO-1PM20N`-p3E7x9NVEjTMo&|(hI
zf6H_}oi=gCMW_#T7M(fp`TPpkN5gs1GnY0rh0RaK6@WhXtgPH6>!q4YzB=#81U7lm
zqiHE|z6l#Io3^~)Gl;#^h*4?tqUpXMyzI3`Nc74kqdGQwe~o_GBu`J&$QR`S|JywL
zZyh{w7q>AY22CrhBpCJVrL<z}ac=YRs_mb<=O7&RLBKP<zg64n?OQJ`;eyIgVqo~2
z5HRd2*e;bJ?X=wzxAoh;^XSp0O4BOVw%Ys(g&YZffOo2~+*R(=&1v$KkJe)7ka`C*
zA>hb193*F<!ejWxQcS@c`*%q=bmL2gxp>%PO(#d1P+Nmk-uL1NBxyFFOhUPelzA%|
z*Y|u*L(Aq(vsl?WjlE(>8J<h-VN+PcZ_F8f18O5d;hW(K=411Rfz2PVPNi1)?d^V|
z2FsTgrx+;dL3UP=Ie6_2WH&9j^O8RwlVb_6H-6h7f9?-xFRf|Lq}0X*Y6yzt5f~0r
z<2k1UvFI@Lo^qb0NF<W$Z{O4s+r5j|()0O8eY%+gu^MTfMQ1t$PaBTf82bA%Z^?{W
zMM(AD`5X4p+W_ulFhkx6`djtXTC&yz9aD9`wV0C@2K!q^1Vm3eThvi(8F_%ii=iyW
zcz$_$+O~NL>E01mO&wrqNrt>4zjMc7wSHjuEn3bQb(i$#D`!%s<af_Z(u|t+gjhvM
zBh)xKN)f|H_6MVk%L4zvuU^T*B{3~9*|eGy5?U5#2CV;gy^UPmP7)XB8iiikOFX|&
z&n+a~?L;3+R%_*T`}AdIGx8$U4yq$0BgHq^-upMbx2tWQ1h@Sv1yTzVTeZXnhUA8s
zh%YQMuhvxa^rYG7WYejyl4z(Xr1P7IL%B=_@ycV=d3Ac;K0Q54x6#L2+FG)aXriMR
z6;)_Cb&c%sw**z{TMAzjsF2|}xGI9ZK!Vj%?8+Yw(K!S+CMXqSSbB`90WjzWaMez$
zKBpg_owxMkR3CP%k;P0Ok#bkF_?v(N2Iefmd;vx2Ybn(MaT?Ul5T^+#Kl=?P)xl@t
zpF#}v9gEo;-(?XG@BdFR+M-saxPs4t2<bKhfMQ#~6ZVB!(mtPLcgv@$KKEvvhZEeW
zr*w-+PHJe~tJE@?Utei4QMiU<XjRTHsaZtqpL}sI+Z{N9XS7yKC=$@TEwfRr8|^dV
z`DphmS<4@1^F4D}SS?TJ2Tf*CFW3^bqEYW28ueJfT}t|USYbkqu>`KS1zXO3dW;hD
z0MCtS@jayw)OY*Iv06S!+ou<o=dI+@gzctm3-#%<&D3fON{fs-g>8d3t7KhVPE;`W
zl%d7r8i~g^P}2<YSRagQ?#bAa7NDiy-j>odqdEunMvTfk^Yr-i$5ti@Q+$LibmlX^
z4?AW;dSb>w$P4R0Cbhvywu23cM>>sz#UQF!dWF@uC{}5vH>f<_=g|d!!7xXzxOKmV
z)t>mu;!lyJm*Oa^aFK^EF0I$I-X`wB^yni`c}v<TNq$1jIX{q#I}ZSv&k2viA#q$)
zYClU|=o;NA%@~u&S`%eG$wcDKF}!=vw&n`FnEo331XT0&DYTU%-Jx(Niobs8ZOJi;
zi}{KtRS0RGG>R^KSI9-}itLf@w}qE$#{T<h6lY)ZTc5PyyzZ)HeafesOiOodWr*x5
zY3FG4Ww|Ej3B4UZ+RU{_q^xS(x2>9(imRm~_`BwZ8J2zYTr8qcQD`O&0yGVXC^;vO
zYq{PE^!1j2wXPqheera6wS1ZC{j8HkV!yabYRp(3<g`X1th8I3xh1Yaotb&%96J<o
zoq2g>^L9ljZmW>TGLf|>k<Qegs+UO}CUt0xvIrmkdVKivH_{@+bC7MUxomt0WJxG%
zhhEuZ_Ya*WPiOpm;Gwe9c-c;M?|nkqO0B#P?$YC-sQg|{+xHm+9-{APE`48ToL~`&
zMHU(5#w{Na7-oGd_norQvmU-#yhRHU;y_6}rA#iS$;0X&Kq?Nnn8IL%ZH$a4lzoAu
zjgd(q)+_l8_fx%(h!!cvM&YE4T{zj>TPFJ~&w})%y^q-5*4`jYXRr!7x+MLPkVh9I
zikG>VV6;npxf1GAO|mNcEM+io5de~m`>pDY!`npS!?PInBI}(xs~H_tW+^#3J3UXY
zb&JoaRiCk?<_^Dj5;?O#IXPiiOC21P&dVxcwy(koSXW#axCkTLBNXeJGmI&I9@+q8
z&6m!PY#to(Y+>V_sk!g+4z$(rzK1eCO_m5m;Hfe;#3A6z^OAFUYs?|AQ)G=vVifv@
za~hmX`z4K$JEfIAG{dr587SGW#PG61tzo(N%^bfLBc3;oxP{R#4p7z*QWeSCzwAY@
zQ+}5(yttD=>S(u<$atN=%=ku(-}0fUULZLUqmtU$Uw3DViH<r`z=&R$t`&y->lptl
za3q=w_)_%o0kO$aAuV>HWe<YpiAvU;_FTQMEd#tz_QX0gF}6TfOtO$Qx-zwD`di&d
zd6uv+tr7RZCldP^o|HT~6i(}iuO(!Bm8ggzU=uZ^hBfW5XNX2Yke$H)3#p!9O3>>S
zrYS;7JduvcZ=|3aR{->5cOGf<U|!&B6KjgbVOqz&Do;<ofnsGR#nhc)7y@O_pX^s1
z`lS-8Q5P_vYajTD>Y+Z(L^BLw_BkDN)>|!a!NDM;R@}UvTe@!e`n>k0{uW6yufvxW
z)&uAK3P?SyrfLjxbzXbGL{~t*mH?DrGX(g5y_9BawyinE09tOAIgYRL97+0mcTSyo
zVAOF##a+-?BqBV_(eTFD!@o7TrZFzVUbYXc7+<h?aoVnUUy;Zd<6|>rC9NfVxU^?Q
z$}nGmpeN7J<isv~9q)ZT*kiIXU~IhXA!+v4m7$JVh%`v>GRyN4sRg8iB4lrBn{jeL
zk{Jc`<5{lbK&B3l%#aimygg!r6y6JnwaZKEp!bzy=&9b95b47%hx?QuVXgCX_|KTx
z8;2fcZfQI5nDdBElb}2f(^aub+0)3e)e8_jAyuUeIXy;`Oyg}}^|D5ROsB%RF`Lco
z*!ks2igl`$wQL~_$MdpBF-~zDKloj`UxpqNul#_)|9xQa_@L}TVRrT41y*D)X`Wgi
zthq%%u?n+&fD%jw1jB3tYC0)5hEI+Euq6Hm2SoS+F(#JB|JZ(9fBGa5|KrJ%$F;xW
zfBYFAJN^d`c=>}@tL{Fl)~YoO|MB!ut^TO~)T{06ZP)kekJI5lNZoxEOe9k<3fyfD
z1$uuJkiUgPQgc$<-D?xpLw?)AEk?oZr^nftQigMmj=_CC_Gj-o+Ec($<0$?tIyA!)
zu6jpvNe8J+a9AbKi!h2jz3_W+G+J;}L0HnjXk$(R!g;}v5n${*uXsbj3+X#@afx?{
z!7t}=FdDikkWNm!|L^kn%qv!EC5`LVESP$Q)APgDIh^Uv3n~(siK!O{WaAklD3m~u
zsATl{GMt=FXT+YMX18&8Sf(!*moNFt@nxI893K5BPfn%G+38PZsmJ%)>eoq&3$*@S
zJ!yCNNn75$mfx>iszl>Npq`#<FsCn%PT<S>M?n(<jX2m}GV+Yp(aGgSSt{!0PSlf2
zgyenXD*Kl4G3@j>BZ|YgOo26rF}gb|Q{w=BEUIx8Ir3XKhUX7mEP~c=ST`y+%J7ve
zm*tIlQN%Y}$Bm!GC@u*I_B;%82SS&ip`OY;A3pWODNtQjki*PT_toV|Q@PCOcD>>&
z*coL{!n*3#iB;B(vXjNs1BCYTp*8P^MnL#a(*dQn%OASK@Rp;dBw#5iEvMQf9A#EP
zEvE8W&aR2!I%XdNGAqb}kXMg$GqWz?-fEguygmPrs?xdO3`U!Ac0E2MrR$AMa+FyP
zqOdcglyMb&@Mq~R2DejSbA4|!$Zi<k*Zs*IUJI^R)wGOtCzKoI6Dxo4)1$fy!sls1
z-P<1W&?U93@9%@V92lfW#SAKWVCFWM93WRwIGoQG=_PP~7f?=zQO>XV0Uf7SAcbNm
zO9?{LTx@yrAw{sG2lEFHBiW$1m2www8agd~)D>tf=Q*`$vu1P7Opc>K%y9)R1u~E5
zgp~&-kByMpC9~G%s3z6x*)+n#r{4>bYa|cJ8SEr!md|@5p1aH}$(`O=07Nuc3Bojr
zR|ZkDf7J6QSnlAVvQfq#r6qYfk7${c_Dzh&f3@`dzyGu3{3oI5KEI9S=f7I*Nqr|3
z|MBr(@gM(`kA41=0q6LSyKn%kOZ>;$qwO89_IR(py|?pi`T+QvuhBW2^uvyQ)TDjx
zQxBF$Z_GUSrJ^DJGmLaNM7%o`*KbORBDPNw>;sV-MAg1Z9_7(`z(XNl+dD~Ct}ry*
zTJf89<;AFbHRlXvY!EoRvkR(cT>Lfs!5Zo*pY9|uw4D(gNXstzUgub%jNz%0qR3ND
zAFkuzL{X@_oX6br9$TlMmyL^~X196Nr8Fbv^DJ3}Dm$f$^-VgD9G$Qe?Yeb36N<7_
z%+$go=IiDu4UM<CdF{v7tgga)q@B7qS;P|1%4C3%!?2i^k+n_uPYmK?L*CctU`q*1
zmX`}Ol0XvK$6i5AtESC`AYcEHoh4qj4=IDS9T1VQFrNR(AeD64&RMi%#7u=Xx=kb-
z7xdQ82F<EN`!0Laid$)mWef_oQBJ&Jr{-o8Y_jsmXo5u^CvcsqYz3~PaByg2CWyi)
z@a+AlDYw6FyYMb%GrrHp+1xjd_$D@hDQj-NO;OgeCrVmz`PPbGIXC7Utwxu$$~hWq
z3oPE7*@6D_w0S3nKEzx$%3choDh`0b4pS8Eo!z4_sx<Sl)P!Onq6o%GWlw%g>bfuC
zHR5aGAC%CX3dJUJRRc4)!|(-^$~`f~VC~BbY-AjaBOVk_(y1*5`+5cA70Kc@9EF(1
zf};1M!H)v0+)5V|u2Nl)++2tAVBdOv)u-+%|5a=ixt>4k`B#C8gb>ZF^?4J3lrW!N
z^_6p~adxG5xIo?^IRpd45@t~}SJg=NL!}!U(Q_-za;a>bthz~{m$%8_Q>|Xj{5!Wz
ze3I7?zVomAaN<@`r7=NvfOfSQSRP}h&Z9Bsx<~@LK@%DW20r150jDzt)E@;n6HCd;
z^YH=)RO+J@y3!h=OR>PisQGHx0oLm#Lphd==lDk$l1@M+ugtvk)aCKqx><v{0W%K(
z;>w7xqtRgBJe@~#e}q#f#a!s2zKNr?MbmiTKn>z~IMy=`^`Y{>Br!L@{Qi7F#0@#>
zyA9~758|p?bJ2}A#$c4MDXZ(dUT}@Z5OM!H7%WD?hMB%s{i(0_A)U6GTsM2c9Olvl
zqgrCxBMi*@x*6M5<9RS0FGgG$ntBJbWrA4&!};BYS>erBYB^8+N!VArf)#2PyEDPN
zN9OL5D3Aci?X-~-_L<Wt`9+RO7<G*q7rwuoLM?Cc;TnH4MI>z@=VPo;5|@Fq>L{>)
zwqm2Ur5OqOHJ-mgAM8%!^@ZHXjss|%CooPS*hIrV<w#JtD_z)pjF;hWI>+4;b(u>x
zJ#-U2_pd6F@|Uj6dDF4EtJ(11O=*9^er_1XoFWHZMMvXtH2EG%1~Z$(nJ7WLvFm-B
zO%gDV1?D`R=WXmssR8rWN&YK$=XLgn%~ALDe&T}MzL3O6NW*MUOXLKC@lJki<YU9Q
zQ)jv+Lcz#ismt_0?+NhE__vr2!4bTxIwkg79JNC3Q~Du~dZL;R*lVT*6jtvyY*A2!
zc2L3*e%DoXiaY}GPQc1C)Y@+fzUNJvnc~m{cn_3m+Od2SH4&^+*{wneT`0o|Gt(J}
zq$sU8d#?%0Y@SgD8V>pFX`P1^bD1AH4@N4aw5q0A#g&Y1)~Q7o3nm|u+rf0C9Q)v9
zIEyBhEN(U<WE8|F5?i9fKWHYg@T8`awW;>WdEI4Xau9=ggxv4{sUw-1&3yGf3;LAc
zp5_;Woz7>2a5(JFmAyb#y_Asz275xxNQMA(K#RYp{r01MNA#McS~}6aHge<TM1+hS
zDFt~EC%)Bv<wMXlaUs|-=mf+?6my)%=Gi6f-wX3V1v2Z8_LKbh+Iqrn0#oaW+5s|m
zi}|&TJm(!!okxz2IpAYAZM*IZkemV`s0>Lu1gk#a`Zrhos6LO2kpy)@C4LcpRbD{f
ztMj>X!0B9c&W}!Bm%VTJ?L4*)0R~3#8yh4R`%p@@wz$7B%uamR=rnY5i$rS+r?CZ>
z`QVo6kM3^>b()={(-YlLf0StH`hFl}9Iqi<Cjd<E2XJ<N+Bww#rpdm3Sb<<@8gHoe
z!2&S>81smLVDdl*jvZh0fnaHnS0T>#=dH$}nK##x#-1jwGjAt%WL*|HbJy@7Gi#wl
z9hxtGz{4r*hecDU?7>qyI2x6;C3L~p7KT8Tb>v!dWvRJaUEFK4ikEG;Z8Yrr*W?{q
zqW@Kf6rY^|=sx?O$J@I}{qN3`zx2O<%E#9K>H#Mcpq;0yn*gnn?nh~OrIpN-Jvnwf
zwBnWZ3+ZTW8$2EC{Hz;I*$CH)9ko?^>mAUxTtFWyGAA!!%#9z+R}4mCew`f259KqY
zf3a_w{z;6Re_gmQFPxeePSKOrPfo@5EB@9vJd{V5FZs*yr2sfQ`ca;oN}03MpZLq=
z$+3Vv?MN3|C;Wv?cKG}MJ3iwtt$&wNx-|dov@Sa48(=Ij8g0Qrd7JPrc46o5;$WhG
zU_=I~<Gd2ra{=5wy=a-Qm*?_>-FxXf?kuj97ELisU2$Ia%RNeR>lKT|dFlD{rzH<|
zprQ|7pYYcneBI@*efV0Zub6XpT}>C3!)4kaTxZ(wq=9M2pN{7>@b63c-K2l9*4i3*
zB;Z_KBl%R2+%BU@E62W)zaS=HB(jpXwubYWo&HFuEvGB};8em0om_{eZeFEJ^Ost(
zE8!&1tCz&kt_REEzUGqEwD<Z0`=*!JeR%$mZjjbgvflPR4PN9mxP4C#FLHXAY%q!F
zMGm6(4WMEg4<!t;m-|K`SqB)=L#qJGdT143ZV#;jZ1BOYoIbcOz*--=On?bLv<k56
z2QS9f$$eGM6IFN%$eW~2L$S3iV7GAU)b5|yt$%-Ljdth3HCo9U$^Ivo4en*1QU{jl
zLsuwyVm`2r_TYRV_u<`lrTJqItL(;~QV;j^yx}^@>s?NJ$=)UFsnBaV)lPDVLK4Ml
zJJqdI31p9lZg4E6C`HP@T896e&$9fli}CbJq<_8d{P$%0aXsb#@$|3r-=Fev^1sr6
zlljjB+&}Otf+Dm><7tSOTjb-1E_d;&#z5($uU39nK<eS?T{8`Y;*4CYiwX4_t0%7e
z;mD{}G@Bm!G~>^oW+7g2+|VC*hMJyDx_yTqd}%QYr~12O1@I1`5p}htx`NM+gK@D}
zo|N%2qkLFe!)Grky+E&AoRl_;6xkZyIJJKCXT@7A?yV^x-`tjK1SJ|4Z>fUg(`n%H
z@rTjwmHA4AZ&u0%%S{ge00GcJ@UZfN`*Co9anycacd{VBTXw}W#fqEooe5N;_i$L_
z{#9Nep>!ez2LSm?CQ)v}0l$cpyvsn2PXD(DMf_XBYf_su`&r<QCUb&zn*r_K%51D(
zwCwgj3CxdVPmvr3GX1%4G*lNR1UqZ~WVXon4$`9BLcp@k8EzP6rP38o*|@}yWbiE<
z4=8H4>axZG-7MKjIaxj?m40;;OtxzKw3(`vIG_0;UD#~=x-EBjX}H!j*0`1JW<R>C
zt4VG@v`{S4i|bE$XhpP=m1EtwX0IW2vu{Vv+N6XgE_J5~>h5REZLHx>=5Y#EdR#C7
zMtO1|7{A|7%>_HD)<k8{GS2OM1-R)&2j2`aLQ(iuQIl4f3MnB}R>79kV{}=kcr+BE
zhSc&Huy%dT#ECI)P|eV4oWNTRUNU$I{LES>m&Y$#=Tb>l+T{Lfe5)kYWS-Cbn|Yj9
zRfV`&U$eq5Y?ojzuF=)}1f#xO`%}Ezgh{w&=MsSb^bkx}8UlC93^Dv*_?G4!=YY#u
zu$1a(<yo<hXbGE!tq0R4Y<qj&Fp*VlJ+TDT3t=8G`2n8HfMxKaK6)cPU<O)4gUxb%
zphFe@Qv43Hv=N+JhTNy8{iS7s$v~C(xD<CQL)eOAXYkgMonQcShV4^%gJSK{SW(Z9
zgM%ruVY@fPnz=(}3ORH!DGbx^+@y!*J+0Cq$HmNgD%o<<uXJF>^ea0xhxJx*Wc^z)
zLF*yU|6v}T*~F)qEe~8{9EoQ4`&Q$yb<V*gNN~IC@|}F~TD8La$aOhUUbV`CF$#xn
znq5D3gk2JJQH&Mep35#(DcYi=ngM1;*pg(~k|E1RgtVpw-Vq)m*46ewoBpzNb#OyJ
zu;PJ8podkee4wOI{7pjHw)9$v_l+jDVNYe8TxEVE(Lq#oq{zSer1ID2kN7OR|K&5(
z=W77&@&BpAsXuxD3-A9r|Nj{u=l)j)oE?Db54iqC*A$8X0eo6<%Ge{zEn}1MV0Azr
z<xkWGI2r=jZBozB(I@d}6!wzOaC>!?3yj#q)eD0tp+*=7N#~=LH4q9f=i!I3crH01
zt0-E`BvfeQ73J^9v_F=$RQ}P}&WdG>1hJS0S7=I$MlprqD1t2&4qI$ihZmuRGVuH<
zy3|k5zR{<_DhBwuy}d1A`bPATMQc%XFff@_iZy)iZF=?p<l+?m2a~G+0Dge+jL3zl
zNJYtq=_ZVWs<m&PqLWa4*z<}`;DTF|a4RsGM}ymGqyq}wT*F2Tpegym6BQHo79-)^
zVg`p7FH{n?fa8>_?2otJbMKjs^>?d6Yw7sM#Q>{6f9~zj<*|;42RK!rqDuB?=-d<2
zN8P1iua4h~89hOKUm)afyd9nVH<0M+`6%5&`KP6=XM|T##Z<QfqMdd}(N#U0icVNg
zeE}X_b?a~HkDn+r3D4Uu*UEMH-;VrmH}Sv6_xz85JSl(P{|Ly_^5^~U%K>>-{=EPF
z-vWZGNZBZlbYgUSCBlTl5N0C`HUDhi!`V(>tXQ(}PG;XN2<h%5hC_VtkA*)v?fs^r
zl&i3P^Hd<exf6mBbr$m)#U_^@btkE*N*L=XIp#GtS)@^Nu)T+y%`vUFa7v9ZJ20G@
zf`2F-27oVn>U&)Ukj_w=IB<HpGV+C<t}f09Q8WsGwNu0i%m;@4B{lD>uXJcV4ZeN!
z`g?5@n`mU}G%_`fP%*79;X0PmB#bSCXrkY~3;3$<K-NF&R(L!;-mnSQ2Wq6*tjmp&
zvdMmrD&Z>@z;pkcTs`C^2V*2y5}FcVe8a^`n#a;l#3;6A1)Go)BaiWvH}vUr$F2w%
z4&7ASxZS{0x&7ql4UUvP_V0QWsqZ?tg=1Df9Qz}lt8m2CVfqZVw54D|dvuqJ79$Ja
zGVWy>X}hssw>PW+wGw8J^3<XK3y-?JF@`a@6|<?U-WHIAWz~riOn&~xJEYy@SBWMQ
zIZL(P76JNwOo<{Lbu(`|r+5r_2VGtkSPx#yrWJ@b&kZ#QH80Q<7oTBSCY2o>P<Ch6
zMV1|_V-8IG?(4xu8UF3VzhA?t{Oc*l?|S!jyy3B<F*!rnc%=gN-5VXy4hm>wfC=Rh
zL3akG1;vysP%lUswZE_Vkp+-K&2!Rfg1zzeh84;&Fv+s52;TP)a3qZryr6<H3Khs?
ztVP8#H%T%|MBm?tH=KkY_E-YeKm{Ox1VZG;iPSQ&mFgQR6pE9@XjHNSs9Tg;E!EgY
z-$hA>8m(K|3F*Q1TUm`oUKb9ws243IDv(hru8U0cu*hl{4jc?I#krl}ylgl`8Y3qk
zKw_lsX?6HXt&X}2zt8OWvs$0#jLPn&D5BZbxdh_Dv$y-?>UB*K^m^#TMA^GcMlv5(
z>(t3b5Km!Q&W951wea<{kQh$^U;50U``YP-y^Oyuteh|=iw--PvlH6OnuEL+6L0FD
zIXn5^3CeDDegkX)Kn7cNb%3(qsj#LL6`K8t@$m$6is(a=4$Z1!iR*Mw>dk?NR~d;!
zFLp#(;^>*YcvV)c1GOe%8DqOE#%{$3z6bY(ZI${?)K=*iwPwee)!~V~qC|*a%oAH7
zYx>niDh}T$m>7{)3XpJcu%Xy8;5F$_?}`MDOW=U0+PsU;0?rshp0L~+FC?h-Mv7Jp
zuj9k_1U=MZ581N^`~5haSia*Qm3+<Ni!nk6@N#Y+!>!M}0*r$E)=_;Ez4-fv*<7U8
zBQ-;%D_i0OimCNbDe>;_784N6aZU+KDR>*u?1pDn=7_gaC{~on&$<QJU=`sCrUC^%
z_g=X4w{gPdQXExW3S-t3a=M+uTtZhujA+d{6KtLZO~R_-CIL~?>c{nT2?t*;kRtgT
zSrP^QTX<`lQxpv*B2C0oMFVL4*U7K5f=c{|YtNT}Y#s^=+P5{2%&OgAu^Ycavk3x1
zaf^hEgZ#{-zk%lhVtn5~wYNq@WdhJy2u?*5*x<VanI{P<mOUD)2aJRczrJ)>5|Drr
z1#7@Q{*Sp&S)%_3UfKtC1zYX=&$|RzuK$0!TYIwY>i_HTzrXbVf6B+`$KkYdy^0on
z0NZ(<X5BnvEdguWlbUqvfxoz=CJO7e3ch)K@%jv-QJpl7bu_Ainv8|aq8E)<Emd9@
z?Z*Bv$S(gQUiY4!Fla!mqUw0t)!piLcBSU&*)Qj)Ou<U#8l%`OdG+mDz3g51qYoGb
zJAiK!VD;g28fAkzY+W?ZkIvA0*ee_daqM3OXV`qx3&&HA_QLzB1k^6jaTcQo-Nc+%
zemaXVPzk&qgtGt+xF0BZ7+$-~LLl#P<LB;4>!NdXLZ-?p=$eg%RfL#R7N#~Bul594
z?6H5VBH3U-1RQ;8K|ENYM3Yl+!+wW%4Y==fBodV=$hwojpdh$ujiQ)>FyZxj7>h)q
z5IVZ(9-VZ$onOvc-PXTf9{t#8w@y06+p^awdBv|V=M5S@VhE^Wr-a`QP|04h0x>g)
zC%aDl(h|skAe5e$l1MzDK07NP4Na&SNqB@2w@|^!H!{0)2csxb_HKfW8783jcIsX)
zoX1reKkpKnI_sR{m|zF-Cw_Ov?&VSEq6-ykFdk~JO1|6HV}(%VsZ$c!KT5btV?-i-
zNk0|^8$HZu=bqZqQC(e6n@>w{ne$oqV5V9tE3vLn)zb^1X$;RLi_Cjmtvz~Ntyi(G
zUf^ndXD)Bxb(1-)zkmMyYV3!jYCjskfZ7P)dOn}-J$iHn6MWIb7muXqBb(t!;a7lx
zjjam1z{qmqER=MI5wZZ3iEe@(%&U2@XSH<`z7MNv*N$dak6?SBj{LhvvYH>gBE8m@
z16?r4yqkr^YsJWCZ5oKMRjJebzH#!p)joYqNYuWqyb5|1qE!)Zf48f(>UL?*JDP;^
z(8s*Vn3SAq14UDX>r}YIoF$m_BODwYw;3?CL4K_o)H)6)7?Wsm1^C?}N6IO^Lv0*K
z7#IrhK~bCzVrBy<-uN*+kq0FLwY^(uOlJsc*MP!?dD_&ycmcD4A`uL{v5gE@f10Yk
z%a|-i^AIMchfO_NOz;n>=Trc#2qQlaVXQ)+$Q=Rua%+UVsbS$&az9=RmI$zGOFN!l
zm_LZ(PXR^j3g@hA#q~v7K`fckaWlYt2^4@&1-3M8#Ga&o3I+%*oKUDR#sp)yOyN5P
zJ@SE@M3bs_!5Pr0F_@*aJYaJQ2AscCX@C*f{MyGjcK#G!00+QOIC9JgF`iKW8taV0
z`Fs?pHj9Y$C>YMMM<5AC3ydv>(DZe7sj7&19#D8V6~B*TndO15daq&Q=0HrSJqe~5
z^9&)!$gp78=XbpH0-9>QMK~IG@m)L*#@I)U4vnNE2Enm>5G-&KT)S`#nulXva2<dk
zRP~`955wpLuma$#(Xjb_!~j<yb%)dx(2rU0A%sJk=;r8x!ki=3S=hN<fZvqI*1dD^
zHcMDpAE4|HskhU`w@3+*T?OPvrK|=%6;Qf%xui?L!Ix=tHcObg3}X{%MFbTjott$R
zPin}Q;gt}#jM*V+lEL;ph^p$4iRalzT4_cXFnHvxRBUYl;Eam9sX25Koi+pO0a8Nu
z4L?&m$9kX=U4LXt#ia|<lej|?`|rNB%d5A8e4Z8#O~N3#cSb|CVi+t)C>^!>D9M{z
zYr+(H8TMxZ+nr#NG8K)G83LJH6SwEpLfKLDtaaK#z7l)&Tb%jAA_*nn53ua+Q~*s{
z3#Y}ClE6k-z2Msa5Jt1AM@u!~@iU%wp@q!3yxEg05IyJ16h;kwd$`)ZsPs1Br(lp!
zNAhb9N3T~;ME0@rV?y3Of&dpUZc>J21rlUkey+eJ0C_GXlT^|QAj(tS0V_ABfEfK8
zqG0yTVo;K@>R#KfQd|tmp6ZM=&aIMuQ)s!#f9a+!o%hUBB;Uk;6teUJ{Vb8qq1a4z
zKLA1f5@i!sDyfyn0E!H6vt$hdbcGCC(Sg*isX7PWD=&Huspyf`O;uh{z`O%C9x%7_
zIOZQ^)TNs|(-Pxu^-(Ey6O${>Vy2X<S-1Y&OX?hDpo1HsN>O2r{IaxJm+m=TOfo;0
zOkAvNy1!+*Usf%-cMY003Xh7eZL23?13{G@H?XBjl;g5dzL`c3JYCzgP?4tzg5$e<
za$B=(<!)}5_E|H|3j_GjHgu10kg1k}=FTeu@c_QuU(E0b{{X%$ESX}*G3&yRahRhR
zL((GK!)#Y{D1V6|Iw^uGrHexT8(_$6Y7+r2u$<>B4y%r*#FCNXSM%#KiXIb`d!UIa
z9MVHP$K$z`;-unRgroxSX-E>ImtuZ$gOwL_`KwMcvjC%*VqtDb1U*$2r7gaYha)BR
z0T<6=4008oz@#1O0M<k|(Z#GQWr_@iCRmw}9eg06XJfj-;nWwsIT|c@8`#bUZ8ePv
z<>o`Q;jBUl#Wgk@R}iTmQ0}gO2D8Ycpx|_}3IAyhm3@E0n+*>L#dM~V0mpe|F;ShA
zkI%Zz%X7>@c#2u9PEdcfo&C0T`U>Y?joBld&(w9OiUN#Y38Mf*>8dTbYU@xOU@seo
zuZ}xjoq@gd2MmSH9&&a^poL?UkYHoe#2z`E8`%uHE_)>a**A+AhYU$r6!4oeZVzCT
zdT!y?u<tw~f!*RK)?mWp6zTVE2g1aB>h{ZBYIG2JzkA(2wg;>VpY796YOA82d=%+#
zn>9c`U9*JG>vUp<ZWcu(#pA5fDLy4Et8fOKQoQF>Y5mhOi9M2a#OQ~jIL2~>7yz^g
zVP2zWwr@h^js5q5DKm;9R6WoUXf8Zu=FAtN03M<e-TzhZP`c;OJ$|oV;s;-5kQ(Ok
zzEw&|*!<)p{7n!qpM|!g8yMUV!3Y{K`hq1q7w5H_dQ?6jE7<tUY}sy^>%r{J<F{rB
zz;Bv}ns&JNJok3$_O_0d=)QmZ*55|6V<_~^_ATDnbIjsfjDu-kYB5-I?)k`<fw}<%
zH5}%&G5B`hc}#b`)?J(hzP=26egl3+1G-b&+ocyTp1CFJf&vxDz+=b3BfHVw@<#Ck
z4cB)wT6T&-q1qF-(9XRb*uAF%j~&U#5gglPoN-XH%%w#($||H}Cl)kdwfiycjYq9k
z%X|8Gmz2pf+Q*osQ_y!<9;3k0z*x$5*3MXme!W7t=&~guzy{e1q4(xnSq6L=fReg8
zhKMz(2v9>(+wY<lU!Dx;$urB!Z9tlRZn5M{yPg{VzE4>aaJ^82nkLq=Q6lM9t^Ccf
zylaWImbL@mI<GPYqE~)gN-d29_L)fb6p}){`>-68pXFou>|QLt)%VXIQ#=qYbe0US
zT!eTzjLwWN?evqr%jPC%558^FfS&^EsMVj^&n@~)yl;R;Plt*|EKZWG$}J`awP=JN
zZqzWr#BgM?L3cFzI<W?{w!n@&OE%JDM#8AsOWVPqz8r&PI1Exa)Sl!ZQB+s}2SQJh
zXZwj#^%YRvxerzRwA=Xz2PuSi>h~i|oE4F_8L)-5Q<NQeo+JzItVD#}6^QUSMTETG
z4pY5-vb$Pu)dy(_cs@>bC*AKvmEBa|k`zc**v=$Is)7{XsV9p+UVYS_tU78>R~ofv
zD~y^Yw|vZ&2Q=%cxDu8%rp2Pg#!6(e#WDV`{LkSv*k-N%EO*%qw(W`Z2e2CM^wTFx
zP^cwQ_}6e6#I#=9eY*Q>=gID~C9GypPa^z(n9~e)lAZmF(Rlx37)`E7-Yavh(td`B
zMQKVtOUQb>T*yLk>T#x|`7IqJrJp4&8pBbNbEjA{E6LlEV!@Ngk9V>g85jXdeRO^o
zm$%%{S8{nulAolOkwIsWkB-YZR^%Ehag6)9MJ}gEa*0ozW@CT)ubE`eawi#}^o6Ea
zkTs?V{$DY{hIz>RpPF9FFEPj<ffInOpnc0!zlp~t`cT|^k7G1$qRzFwBxIh(a+f)e
zM%p!_0;gw3o8qYcxZA}HHQ#2*(z0aWjV`$NW1U!H8b5L1CHyE-)op*r+rvNge6`Ov
zy>d;D3|k)UV9H644MQlU*OT1}s&sYC2N<6Wtqvlg?C_TM0WAcJ=tnFjv)z-+WAC~5
zczcJ;Ep6jL%V9Uv{nVy{6~x@w3gX)%!O@g9rh!tNYy;hKBZnfndMhd`%`ichI;puv
z(GBMMLc0W{l8{E5AF-mG%!K9<YQqP?oYKdzy^UyQ#;|Gh0uvyE@-g`;um)CB=7Y~^
zJhF*BF##l(&KHY_lN=&yj+|xFIw{%QGkd_9dZipDms0)75)q}_WQit;utksh<(m*|
z?Xf3lE38vbq178xSMv9a*&vc^<0$i3mVT1j#9CcHUP;c9)@5#IP3?Mu-^e&bz2DGb
zh(@98{btYRRN0w-lPt?-t}cZcUna2OQ2?ObrJGU;qK4yDD|-c4+}f3SS^t%<3Aqyg
zMtiOI8*Z+2H}xBaw=<)iGU@%z(j|&n2z&WMU+S)&F*)k0A3$F1mZ*%BRvqT|!Ci&J
z%fN1W?|9!Y@R-p~jnlTVHhD!pPMG0y&!d!kh)2u_iaFd#BxZ^?zz@jq3opevr{%Ty
z1Tpt%oE?=d#^PbLHokdhS1K~e!yDXyjS+#7_#;x+quxP5x=}WH+?KD@_p`->@5Sj}
z{@R!8bg_=Y<|e3Aw~<1*L=x)Iq_7EI^*T{RV8Zy?WUfZP3~kqzo{l@KO-E?BVCFQ>
zvv8zcg~db;xnpoU=LwdYo9J4MyPoB-Nb{o%LljJLoCs@#Ae2@&-x^FXQTB5m^@v}<
zSbOuEXwRgX)k2KeTdE1@&UTz~84LEoog*B8oO|e)O5M;I_L6H;ykTkm<<`S*_T9m~
z%ah$X={ERt>O$+Pu3GEobf+70aFWm%uS)vF2_;DvB1>XM5Fu~-qXp*OB~y>_G>XN-
zcF1dyQl4X6l^NQ!SkG$SVv6(rq|B@F1Qrb$XI=-KuUK+^3NV#)zN}qOFnQc{MEr=y
zJsb?g0G9Kq<7^IrxlS_n7j3XLnG5GQKwGo1f6E*uZ;#nY?e=-n(Zt<6)c7+Itu?4~
zxGQvsw3zT#WMlbh%>9(x{vSSv?KPaJU=@AD=AL-}Aa+7%=s<x+$abO^^eI&{`^VrM
z@!4z}vw8-`O(vh*L>UmAidOg@bRe~+c?Dxz{1+W&Q_`15FA2Z@`Y%Ue^i|q9Xi~CW
zV^qsuksKB~a&DqIOG?x2m26QMKd$bOj!`n6Wj)Z=W{n>^2oirjniWse6;-nI^*fL~
z_wbtqf+n}&qcUJWiJ?hyvDqsP*HwY47ph)kWXx04{>04omIspf$^x&iIaPK6-ax&d
z$a!pIj<$LIYu==g|0o#DW?)|UXl27Qf=E|I2Q0LI^ReZL-gUV&I;5dNPEP{@IX|Gh
z<wgP!&Q&Hb(p{g934q(d0WW)M0xi=PGpl2|A$+CW9hi4TGvr-lxP|qLJrFNcMD#()
z-hK1OR>c*-;XCjoS@1{Yc7|=Sah=$NQBGav&68+SK`XYh^d&AE3nd>VBtNFJ4bVrD
zYWgG;c^kEjGTSW8$nuQ@lnhDzRCz`qlpFR3@$VJt9wg0?!G4N6w<%<~%<E;x1Zz(d
zayrX(iOA{J%svNUgoFpH2j0})D#K)b@wlC@576p>&pL-$JD7^1WtgFnk=x-oRPJC#
zP?D6`;ty)442GvLFT?R-4Cm@8T9U>QO*Spz(qj35cWsnO8%<R)`s9@#l4d8I^%o-_
zr>r=taH45yNiPqY18z25)Jw2k7(dSPWi3%xRiHPfFh@8l&eO5rB+`7g;);d>_BJb&
zN;<Y%mhNb2MLV|K{hL~*t|0?{dP7R?N4)2_+sg`C1lkm`uC;P7OI9^HOdDCf<r%ur
z2q(#@4ye|uv;paWI~gl9gGe8ZJfs8{i3tvq7QHiL;^hA9YQg&(Dd1o>1pb)MSIVhx
zf&7q6oM8#h$jVsB#$xLU3n;Q6p{rv!U}r~`J^^I}k}GpgpmLlR>D24cW*)TiZH+$H
zCHX?p-$XHNW7H%<v&jAvj-xtpdOYFcqMR<~6e~kRCNal7GE!ru)f&Ph=@`XwLz!X1
zL6*+0x=nTfvD{7CMh8+1Sp^cJI6zoPjDJUtMb}r|9F)a_Kc7<ggo5qM<nhGy9tPHu
zur>{A42)0?Gblzq0i9ILd58I(7;IM)^70D0A1Y8tXlm@Eq8FAd7m(Zo-L_py!7!@x
zBJ07$XF|D5*mdZ%hg-X)gJ2~>z(;azjPCXBY+|8EL&7_bE&5lm6f}=4QBvTc(#EbT
z$`9>xpq&lGFyEo4aU$6|NO-5{*IFH9R=@3GqPdmY37Zt=DwvQ`2RH$*BjwOGk6<05
zqR0~9tiV{b3>@jLwu-|DUZ5NX_usN)+_elS%MF|?mdFKceP7zotCgcz<!V{h&|=yt
zR>CS&fz6pn*r$s?O(x8)&aC`Fn$QeX3+@Rv>4llndJ;Ck6de6#2I1P}ej;)qTe)jj
zQKyO6(w**P>CN31uKoD>i_tifo;l=L(pQ}CiF5k0Uf%;Lr5^ZX3IZ@%4tS`LeS!97
zGLV-O3;Qz-fb$6JwOy_@`WtfV<Liq|eHdbAZ$CC(<r20vniwwb9AqA_$c$f_cChG|
zZAlxBZZ|sYH@Q0jTEHis*~%*k`wMu{8BA|2*eB+bL)dqaJw*$3>|^?a@a(<Bz*Lq?
zifFY}RlEqp*luu6k8XG?mN5Q!hLcDMHz5G$kOjzk7gOBjCKL<H67grjKNjek?R#4_
zkb`ii7fexSg=cxKwFQYJf;~4JYOSDx(<A3=^qFDZH|?KXXb{1<02>Ksfue@F<iisK
zd&A}{vn}uP!dyun4#Dv3i_ZD`UcnT_U5|U;jW9j=O#K?sK?%<=fj=-ZiX1P{cL>gQ
z&LIOWkoR(IkKJif&)D;=Fe?PS_SR)%j$@nyA$jsZ>%_fmyTtp^Fy{itu=2A}>JRqv
zOrl++c9zq|IhGU!EsUi9tmL`cJda-1m*Tv$oQ$=-9NWtKQMTv^Uu#b=2GO60dOz69
zGw614fBX<~7ZKb}9r|KnU*AolpDb6Wa+ug*dAXe&Y9xy7E~U%k<wIKE%dtMapDbob
z6TMiGC@a!rHIjTWiu8wjdB*TANxpsXOd*>NizttCW`HTjRM}1SH(8F!vb%j>xm_xU
z#^cM&JzhGKO}QsaXR;~xblFTc#hxu4w{Mrv<ej}7)8h27-LHB|iPDK%kBl{txXWNN
ztT^f`4*H5?zT%LtIN~b~_-f<*#fG~tTlyp%WnC`Y_kEerYs;a_WTLy?4DiOzt@as>
z2=5*Gqxhaywm+j4f6sCoT#3Oa92l`8J26^iTz#lGLAqCS;^_CykOa7d+o2Rt{(cF6
zMQ1405*#M0FJtVPx>rS#-k$BGxDtnVX(Co*wjXDjD9VF0n<@iEm1j$+GDy8mQDtx+
zRlZ%3DuZvCDtOdfQAl?CtB&&CfhX)P6Eg*8Yn0Qql%|ddRWB#YrzLI&<kG(Srmw3?
zvbmj2impmpUDo@Z2ljsF{@(Ab-us^E{i;G=e(#I?W4W|vecTFpa$jzRJPFV$Zx`Rq
z9)@hDktV@|M(O@BT6u)z;GE@a@<-3m>?4&F$kLy}0e$t34eXBnHTnJk3d>11?L+cE
zXyTAg_(8oI?&Ub6{55MnhrId{*<*Q^{9Z_1%yvn=zzYWf#)Bf$hu)o7`%-LYQX^KA
zif^S0B!8V}+a(D)`MbAD(1Sef-}c-4SgS1sTmDxLHi2M6Uw&W3F?tm>;1|Zt*SKXw
z#=%cg&JqB%r1<S>;vXn*)b8KRT#$MF8mfMM>+~z(LARt|+1<(}t`t~_hu(+pvws!7
z*{e6p3?(}j6^B7fE_}LQ659(==?~M!Tx36mntuKo4To_sU(r|1^w#V1FESsV%;}Qs
zL|ag*I~T@6r6lCiLJ7R!IY5I8x^(#F8}BQ@#Px`iI}bC1l~Wukg2)PG?9cnxWiPl5
zIq@C01cS~1z2{{1%6-NkCAP??+a0`D)BFL-<825O#JeSxE6|z}w&{nm`*239a3qz~
z<q=*lP2|!Etr;03pwQO?cJv~o=y$c?!s4=arWZY%1<VV2_W<lJ=A6!lY6AvW6j^b`
zw{&C;qs%S|odgP+u4V*F(t!g{?r`_ltvSLW^1kV3dMSFFrFcskz<XVH^w~mpgtuyx
zkDJ`u_}WxiQ;Q|73IHv3Ox$5InAg@!^JrROyE?fQ(<Y#Ul+gp)-SpWQe&6d?={ofV
zOdyz``1m<@cprbbrZ{;Q$lvsBvlF^DuF{H5hnGv5uVoEr;W#7%9u=N@Vp%aI7)gFx
z%sy6XE*WAmyFp<;dWL*uPZ84!W-FDzdtsairm0d*;8UK8Y?o3sIBuHomu#|xSqW@o
z8)K~mi;iubf<ej*2i7F!x5C?Hvh<1VRbfjynmcl2G_N8P!Zkfw!Op{C#)VSS2#JU;
z?Nn-fL#)Ce(m$prsa_{7u##yiWCG)6=Y5CJ_dLDM93;?2ASPRHo(0gD@(@GgGGh`C
zEORunsR>=3j{H6diR>x!9%f}90pT{l1_%g{!kwC08lK;a#0sBmk<bKd5j$gkG?Aqa
z$Aq$`4BlKLVzym_T}wNJsc}$Vv*Kljqt9|K<7d}pV-Mdl(5j~h&0vtmwzdpe#1<Lt
z(KQ7|t~Ghk*-#ARYs6gzwxmd!h^#yRJ~|<+`(hpM?CqJBmCE+Q6#&>eQ3CwB0s`QY
zYoci;KhE-KI=5z4o#Dv@`q2l5N`d)+VJikL)zJ-^LWkaBqC(5IjEz)X1JH^RopL);
zE1M~t>J2gH-2SM&$}C#DLzaoxvX1ZkfgNAoa}nAydXM>{a(fM{q+dp}-7;GzcG)6G
zMIOM{Ii6LIByzJq7{t6_6i*Xt$6f>##*Rmv+JB4qq|j&25o;M1^r9*`B(Y6E@xg*~
zdXsruQK#v4SDq#rOUMKVTf}$VYrFwGzHE2STOBiO4i$2`PMa7RcbVNw1|~s7TCGXR
zJ@1an!Qb&p7T_ve>1u|R5BQjj&=MG#ruKPo<@Lvd_zk*jF#5k2C|g-s8E}6r%VVC6
z{DQwHULh~BU*qp&5t_qJA$p>UZ9~WRb%OP18cezz{X2Jdhk7X<`;&!^x6OUTIXmW*
zIm&UHY@1-ls(CsKMt9^9GVx$cuVAI(31;R|lIgH#&r!!HQ3;D4S!r*Rm9`F`i6kvO
zQsLF<7bk;F+Hb3Q(pSraHf<b`@NE^JCFTw+e2VW){tk6h6w?7|BSS@y#sG7m%zYBy
z5^HTlwrjLfl9}tQrIu{2Kn0SX(K)c>=6xwRDYGI(oyTq|OkHY4s8&k5rEsls1$UET
zJ7|E}K6=@0oE>@2{1vOi%o&`R<TSCC2X`Q8O{OX3W4#(hJ(~7786Q_`xm;Cmt<pWN
zm@@-x$K8kYa`{#i8k1?4HujeD)6Ace`KMYFvGQ+5*dYB)1|#RZ_W4Wj${y@m=CX2D
zYkw4>w`7s6V-c;gSNo);`mY^qoqclIh(Fr=qMvmuL!GxYMP1dyypbN2L`zxNHYuGN
zf;dAf-<TpmgK&Z7z#vy&&3rVQ<{URDm7t#CD&Ry4lRL~J6=TYs-ki^z>u5sVNB<d>
zBQB1H^BeMb#Y_@$9Q8wTsU1Z9g_YVeL<3!vZ~#K#Lh2MaW5XcuM{2^VSK4DAIx(Mx
zavouqS;j+Wlf>PSTcP7I_Z_uJc=$nF%ebS3L;M?1=cbF^D2%Vm0A&y&_}*fUDRuC1
zKbT-W=*=UHqa6S_0Y(_aN@i0SN@R`*fJ~9Jb0HSBeRD0RYTX|a=-^NnUvs38K?J0u
zHpzaS;J8`;U{mH474aSoAUe$R*{`o>!$flTk(*2yGbTL9@+!VY#?V8$D~DrBvS#&b
zhFE|oI-$&cn81QqNTR<yi#p%8yo=LUou3-#E$`^UJ3Bx9@#wI1=oK0l@EhcmpN=};
zpI&x6C~@96>HOlIzVaF;zj!|!og5;?TR)$jw=OQc({u0W_^f@@IxKrfC(ZWdA?6)@
z2{lhnJ6`+f_^1P5JEzp706S_yy;lI_xOI*R2|JCKNA07|FJ<r5QRf7qz5=if@2qj&
zIci?E8|U8H<@wp^MGH_k1i&XpC$G@Ivvu4$=|GR5Wq9hfeuSUi#rKVNo0@A}LLbfv
zN0SNm`_uLz@Eq@D3$P>SQ)=ww7hIq1#?f)vJ8T>`Ubm>;DZn|Wf`Z{s-?!)ywAg_E
znv@V0Xwy7B>72t)q)q4ayrV1sbac@wdyVs>3na{|^HXR52@7>j2@KRcX)zomI${nm
z^yok#?91gv%iwd^g1zYE^#xY9hZ0EfML&=Jhh)9}>!UvT`M-ey_7=nH_2;*-JpXrX
zd*|t6H~)9-={6MqEC2VO@BzVy2ii*}3Y@_%8cu>(C3-cYMxR8DZO*C+r^VTO?`$yw
zL27_m#AomS{{C(fV7l9?zfh@gzl@mSeZHLGeHlT+`!bS-_eDev?@P%V-ZEi>2l6w;
z4e#^i4Z-6xB@XY4h#cM*lR3OEBy@ORNb2yugxKMIvfRNr(qyW5&*S+3<I!EeaGwFU
zz-Or7yMP1gp4VZoak|ly+@L(yG427P)23V5J;m!(hC2#9#sN*HlKu_TL3->1iRURE
zA-sq{wz7u@DwTOOR8M2Rb0QZ+6@Sc0T}nU>@8AR)_5oQ5j>bBRf%hTwg&9)-gVK6d
z8a6&}OH$Is(5Tw+gl>Lu$INeyqj@x7Jj?^hY8YEZg5Kf^^R@|EbJnU%5TA?A`OC{!
z-NV+a#$~(Hy*T=hmd+fO@y@Gl*LT#}I0ptSzH?d*d4O~QuTr<u#!GtfkX-|UTMVVB
zarQPXq6%%`m@cKrdshn3ExT1sg~-V%9tZQTrfa&MepT9+n0S=?+``ZXMsWr#7^X?F
z88OB1UR<m=QjKnkg#oK^{VPHsr%85|&FgTCds<(@$WaN(+S}!sl|VIJcv&&0NB8tZ
zs@QnL{<xS0x#(nc!fBA}P3N<0<eZj(Xp_M`Z6K{Lrvp;bWzv}gHg$*N?8#MjY=fXw
z8AIb`PdNh$MsGg5a{)SV$jU&0%IKSb8VBQiApLt*fWXKaLdV`|K3j?dmddT&UpfgW
zf{#0nyw>pEP<St@_<F$*bz%!%e|ox(kjW(0MBoflX<h8OC`bre^iZ6TkLw8_*3{P<
zPZk`}2m&}1y1!CshwZSLvVR$i4yCoVw-ORyhz7=qKc4#ifV%6awy$)zS6SI9q$SC(
zp+-fNoB1SNdAUksDz)H?Z0xK6LJ2-rw$R%0bl`RuvlUoD=16TB;P>_Sex{L{Q(Gpz
zaqb|kGCV6GxZ0{yI4&7PqpN2kz0nwKZQ(s=e|1E<iwRwL+>g)aw6rR-TdD6>MgewH
zOV1Q&z%IAKcxNMhA9XTt|ATPKW4k${^EQWDt}X$%Ou?-EO%B;)&H41ARc!S`xaWr+
zZU{FAyWTuL*xe)9`d_Vl`5*Af*Z;xaFQNSV|J|qmt3P=H-(CIRlbzk2zx029#^=%I
z`sSwhZ%2bYj|RN_!K+p4wP)2@^(kE_KH9E5s_nqny`3j}^=)q!^@153s9U#F@87U4
z8Y@;Xb$Sc;Jx&fUU*T-r_9s^hIEF~cYBaklduNx;%6S--y_YlppW(<WUeD*#y+@C3
zZf>e0E>yw_7eQd@9Zy8dq-<6PS_z2iy>&b*>w_h^2Ix~H|H@PyIM1LssT0i80#pS)
z3y%xyCN;Qq&%9P>Q?`*>!FhY$YPT8}E&aCoxR6yFZ>iTFZ`Yi6TFbLmaPN0(-+sHx
zO4lSMUEoS%v{pE;dPl)*5yR1V9QUv9%3izbeP4xhz4t1-S_C01|H%8s`>E<R;dB~f
zC&_Va#^DYzJ8(3fh8UEUOva1vo(FON1+>3WvQmYwVY3%UuTL7C%X8@UuiHC2P^Li8
zSfk>G#Z)nfL9%_Pt<5$_gGj&mr<IG`vOilZR%#_e6z9k^4i<x`5>5s%IpXz1mGjo?
zql?b@FGnYbt)H<X<yCTuv`&6JI!A4sDN%Dvyl$VqY_u=z67`ZZxf~n2u(Vc8R;$2M
z#u;Yp3=OAnKU~E7-Zl#Er#~e7`pZ$PeYoaMjMn-2`Q^!4J^AqBmy=H8=e3>W^W)a>
z+HUe8{I~XaJ*8GMh9>&kzA1#ead8vhG+&7=Ny&4KQ}*?U7;6*qjl<qPx|xMgtOw_!
z_o5^lMLz1=9t{>Szu;7Z3#EU(n7pSkR1MoQj$m*O@Pb*Q`7#SBn~Q;tlD8TEvy|C|
zpAeTc0B#Dwz@*Yp;(wOq*<xVzaXO3U5hYgQY#QTec31I@N>J0l?hK<SSdjh@kT7`j
zH#m&w#v}Zze@!TgnZcpw#~@IV7h-bScTP@ET5GaU+!sgfwY6>cnM5dFOH8*;8=27M
zMeF>q(P<>6okS;IOUycnlf0IgcO0{K4JMxR^ws4FDU8?Fp13b`qiatSaK1lpH4fL-
zo~;X~f&(&!m&Vz{!QlK4emEi%MT$h-G^VymZgO;T(P=b)SgUVql3oQ9OfKQU5pL$I
ziweEHpotL!7|;SoEW6*A%x+;GYUSj*IEqrBZ1U<Nrib`iGXpD1E&`kz?EbZH)y7$-
z@_Cu{m4I+`(rLXG5Ry7#e_i)2rkOtWC*gE4qFIW4qW$9R$XfrKlI`K<|IgmPY`2kQ
z38H9JpI)b%7~IoeaE}KvB?2S>5zs4>6ckC3ki<%mRFPCXQlVxz00-$Iz#Rz(_{d0A
z*C5wAJ*%%c^ZN-kyT5UVci4lwR@bQW?w7s%0Z@-nW@QN(DFW_h+sw9Y+qP}neozHj
zCPb~?&@3~cLsgX?@rTNyO;?a*4+~mimYBm)>^hqBa4~;2fuZy>%h)YSWrmqW!=zG#
z3uF~C7Pe+C9t@AYBDP`KqM`{NT;<o%mS*o(jg#QKTOBr*e%E%$A>{^@ER-1^p4@uO
zm2(=q%8m)0kZLx;%wh%-Su^VQ(Wl2+6&0S{`eSdWN>ZWQN%N7&=e#U$JjhIaKEA$x
zeQmP*{vhTsw`iRFz7UX$+@P+t8`BY7*CkWTy!x|=J=>|aseJJJxj!muyQ#mmiig0Y
z>R)~&NFW9$=*D?7NDhk<w_OXb@r{YgV%m0nVfybqu`0{td(W;)qge#N$Xl#aQqbh7
z+a1oIcSCF#F0KdjE=vVj%ZfCv#_|s9#JqPP<Ze~P*wlNYs?Pz57tN;@G3S_#&2Y6H
z<Y>%S?aeB+n?zxH2^8-<1+-~Va#UQoh%jwBUQoS=s+?;h6Y;tj&`sdv6Zx9if`>PN
zf){g+m+#F#7r<4}bIqTgO_ufLrd^SXy#lN#!}=xS(J(UmX#u1~{G+#Eeo<>txZLEZ
zlP^GE^+JhI3+gj_ZIBLX$?8y9EZ<E8QVtEp?9ZN<HwAK(e|Z+XtL#N}!s2!p%o`h&
z6puFY(T9<~O@n?Kh8D{Ur%#`a^CuAcjownl?ZY-es*+-q2hqh1SY+Z-ftLG#9EzwQ
zc`qtRJ`xoq??DC0J5hl(4as{<gIoQE)9?f8azuH@iaTpk@EyIH&iUAjdc>mH=~I}4
ze2P6wG|7^~XaVzh7ZCg_m`=q(Fz+;z4=}|>;Y;q(*aC!j$OXgtEK-vNQw3%44ttGr
z4~QBxag1_$K@Fp>Ew>M>67xt)XZnCk-^_A97K>n4x#bL%KwlTGl%lDV!zRZ3DV)08
zI;=#^*(PL{@TWchEU5S6(J1IUia8=l)=bkdT!rt>@yX$fw4UtQ&Qa(1Wc%nOttfl8
zvvb((c6Q)JEA!&z!AV+4CXb(_wPe_A=S5me22VRDFScJEchYJydV^K=Uv^g>=FIn5
zRy~66F3)`lS(KXMF&svN(a4Vikd)nN&Le3GZL&aXV->~lAd5Ij9xtGTIr;REK6tTu
zO6?w`haDCO9XYxy;dWdtZ+YZtzgRhkSZjaShc>c!OtwkG`N$jl{b`(h6u=f)6K|ww
z2~l-rMeT$fKA~QTs*a{u_J8H0&E+kjLWjX{t0=E;Y^0{}pK;2r46D^z)|(QurKaGe
zs}8FxY57(FX8QtCG-qEArTaQ{yT?~CcHuCwS^@lMy@u+T&Mv4l*40#fg_ebtNeP~=
z=?KcpAUGQNG$aa<K+{_c;9#$tu4V#fFKk*a2{HpGL4E1SNo}9$FosN7+T+8649>7(
zJmv9vxeas1+zd5Yj_XNv<@=JRCleLTE0;YG43zh?aeby3hS_yu6LC^iD@!{pr!N8#
za@8HrSr)?CatIEHS*-gXG6b!+5sI&oL149HZRg{OKMQ*y;N)7E4sD7q+qYXmPxA_a
z@9O)3N~$N&b7limOv9@2tKF$Hm$KRVXMKwAqpF|vH5Pc^%r5pFlzLcz;>FG~RkjQZ
zI9!Hh9%kd`cyLIIq%xHh?`&m>TH4w~fBHbSt+_X*x9ZK$Jm}Cz*bNNaJG!f#3p5T#
zfjo1A`26tjw>#V2Zb}Bi$9M(b%slPx9duIS55XV-=x*lu$@X3s0D1RPof-Sdn@nf+
zw~x6ql_my<wfk4i6eJ4)ryM-V7Nh>U<?vCqAdeu`GCr&3UZV4y>2F&c!5LQ61>X##
zMa7h2Arj?1HJ9ZvM&FYRxRS4o{4WB$`co-&`(AKCo+jygWxiE@9>>{h7t^gZe@c{U
zOK7s{`0$(~Y!Uruf#iS)qhY*AZN+kD5g@yy0L1I`Q9eWmO7<9>29|tGV9+x$_{hT-
z@=rQe->6sb1}KAdfN%~|o;Tx23UV?HWnu9*;;t!8Hx-t#WdY_-H<m-FH!Ukk&eNxb
zQfBd>#U~xiFT`KT#v2}Pw^m@~R8-un^jjn|UE&AcT32hRrReh)+FJ3;7&|st&4Mu?
zjsZk>?qlg4s^W(c{+;>ZD5qi)&!_!BSEcuab52x>wy*qhWW9{$lVod!9?z>{C4lw<
zLK}%GiS@+-A=}2tPiBP$sC&tIJe{2;)BY<m7uZF=tk)D_PnW}}(^KSCn8|%QGtk4+
zerPeXz_F`%%U&06Kh74VnBzzNWTK@MTho0Gm-0DW%I9z?pTnj66@*JEDMPZK%l><T
z{r?|;6Mhs2fW`Lz8+SKa_tN(N_gnWr+y8%xk8S@?6D|$_4fvne+Sqt_r`fvGdgwLp
zZf>+TTlcf}|4+yrF&IeLaME1n8t#V?yBMS_^`TYURG)vk7Wia+Z#@|YW7i<RbND+l
zc3mMUN?ZfDKY2d%zYAmUcYB9h1^{l@Ef8}m{pv~|<S6tLuX*&%iM3wC=qI-J<qsg-
z_A7s=Vj2_pQ-6$kwI5@QXajSNUQ94r9(h^(?i4oi5j@PEAonHs%1<TB$A5@+oI0aG
zWPQh%?DzjxRo!w_Bfle`c77vS>`^gWp}*uKg{`p@DvZr~OpcxzE!yu+1s0WDNdc<5
zMG-`Cak6I4!bT-+s&tg@13Bs1kj;o9>2s!n>5HJDCRw4sFOhO*|5U;sT!0`!5!*d?
za9Q*)gc@fzsS%(o0(qEjcTh}B&B@Awe$seAV&6MO^|LuY{*E+q?DU&D04h3KGb26K
zXHkKplw3?BX$Y`BytO~%T~XfnV$!)rH0>&z9v-ki@G8*Onx_rzdv<?UD8mF4q5$*C
zHJVj*0#A;azdIelA=5us5TW<_n#Kh0eIbXN7kIeI5AIvCxWrHPx?}FbJ)r3A-aMkd
zWsZRpKF-Oh&qO~57N{l$t7LGCOPi5^Sd#|*0SmAoRhj^__GC%9F5AGvqY9dfPsL9{
zj%RrYLpEgN>SvZUK7aoDJ`4Rn`;Gp`Xk$tIx8}x!bo{pm_a1)s|NJB$*Z&hHoaDdz
z_fYnGa0mZudCiBLcOPyxo8IVr==yz%bKumgB>n|(MdXcioq%U^(pGH2899kPGJn)>
zi=8_i8PWJ=2GeO2XWTWz?4z6@QFsYPUY*t!+&}H7TrQ6~IWnj9z@J|cY*!E+#HnJa
z6iYo4VbyxVIi1oECxn{RQ`LRv;XFb^9`1__;>FS7GYmhxLJq5C+7BdM9r~)BO+gT*
zxW|^yCY*v_ygXT1QFXm?Bc9L7c2)R|`D1V<WoOi3esD&iYwZo$ecT!T$_Y0z^Tf-q
z-IUV!ySOxtdNQ%0(-Xc9@$i}fW81)%Xji12_mDdL>UH}kkB8^I-6|T8!iTD__wO|+
z)@En~!0*rIumRt&KB637w-s(}80q<NqT38%haXjJSmPi`{Ih@pAq*!#4zpneC>_&K
zly4=Q-mT>Os9aMm)>Ls2B`}XyrSt9H$?4PWz3$7SjuQ`sn(O;f6wjRYQ1@Nf7?+1O
zy_}}$eupts!^0P4KBA>ty<vCe*!9BEV+@EjdC+dJ)>knaL|!jZEbBw3C@+<`AD3yN
z|HH9YE<_jStbaEgr%IQ+GK~SNc(261?6vm_2?nbsuNwdfN^NU5MJa?SgEsk{=hc-6
zEg6eE<aUvMJCe7!=Jdmu2}+TuFkm(AZl#Q`%T;(#QL7<LyzgOr-<PWz%0xBnPci>W
zG`iNW5_wgy7InD`Rqi~#^e%!aE6Z~V)-}L*!qMnW06s!^NiU=tFU199q`2DNaV3GX
zBXqJqo>ctl*~P2ybuFp3+jxw!SyGG!p%f5~Q=BltQH|G3ZxLt3z`rsMU`R}dRBYq*
zmu-r(bo(~m9Lkf8s#*W?5DA6C>jMMy!bjL1htDtZWfu~*boEOjY)6qH7}@gP1i{1$
zRR$cLnN;T}gRz(E^>VeKdh#YT)hVpX`g%xFV6d``unG_5>z32X+e}M^4PlfmqS(bf
z9ccg~lh<c`U3Qji`B;}v?MpHm;o5{q7};w*G<m^u^~XPYYw7_^6|)?*Mz9T_P0Ry|
zEAoskUnEI|J#N(&2k**5&O~?CEF~GD+6*_cLriq7f>kCU%nsSi0=Y0i>?Nr1Yt1g!
zTUp_<XgC~SMv7l@X~vF_CZgdjlYiK5Q@SG{{EEyMBKAueT2%<!87V=j*TdIpU)9hQ
z>2W3DsKA&!VZ3ZKL=iP=EUww<ODqW7t9r9)af#!XJ3F1@W9hua2MTSTfoToVpP#I!
zyh?v0)=Krq@M0a!1?!JTjfr6&yg|LdI%G)I3+>!rAR4P1d$nsp$C|iV>BL8>J<cw{
zJCC~d4r>z%$|>-NZGij~4X&gT4LS*ClNt51l>i*>Yi)>GIimjbRHa~o?X3QoFQpO8
zF(>0uMsVeJrR*8;uUb|$#{L!AgP`hzDQwbjx7MQdrW8Q2txZ}p0H`%)lYVUgT0o`0
zPcjDKbgJe72$kny!IMe0YE<Ll+Lb2lNSY@45e|y!NghRtee%jjm_VRyYa;8B%G@E{
zeKqN?ufJ~Z9Cfx&I;Y!Dt}2HwPItP8$FPOeHelu#72cu3+ubgdY)V$zx246!k2)tW
zj}E8;C(M%B9}*?Lbv7e5OiR&FK|~7DIZ8|lqOg|-FONIBJm1nrWk?V!lNuFo)+$f;
zx}CM^y!s_jA}w2dft!^GVWjdpM)L+wwm#aWO1v%dzPLr2B&*vKEbsK1I%Gpzqx`cK
z=TVg{6fLV)4kV{qZ721|+1BOh1wOSG;Bd>@sxjLbSu5L_BoP+yY?iIdvluf5M%NxE
z$E0H_QNB%J=`GrpNtH0ymfgVnilZ%Vdcr6bS0YPEbo{^?XuvELt0W|FcT(n?b<WTR
zv^8ui&LRVl;R(B~;yL!^DKX2+uqIC*H&rpkiMjhU``&Kb-3zhjuutRt|0awc%{xVW
zFJJb`nz`<((sEiTV@ZBJBF`4dJLGYfuw@)<P25R#YkIfRb>@*(3)>j-X<@f&TA}Ku
z7ek6G;gp~!WtX#Wm~?(fn+wD{n{2mSqV*C*Q*99w2?kci)@YMyhg$?~y{!ljA3riO
zMLCLX67$Z&3qf1AZOmz<Zdc)0h?LSDM)CaYT%yYmb&`6QKqL)XD6&fE*F{@ahmfB5
zE+JpWG1YD-%ju4)5uR;sV(+7f-oLcc>htHLeHQ3{N5R#n(Er}uxZBF;fA2Rx>wiDV
z$JYPSgx4;-R-?7iXf|4?1OD}$X7f(#uGhS`dH+|NtyWI_KM=LivUWT2N7sJ{rZ>L-
zS1Q^*-hsPXTQb!QmTPjM$2ZgDE>zm$xNo4LrE}agqo4(jd=sTDt+3QHGPpoH20aA4
z<*bazqY<PXb${3vGXs1^Rs&WIEVGv!pjeNG5Y&A*RomX`_t7dI&N7dus}hp#@MyPl
z<Q;X6J4au4c1?m)@hMd{(%-^{@g|58&q{Jy_M<_$=9TG)k6#8c{);CX^*0=r`Odf;
zaM__RZ(&QLKPsaw=KI!#L;6jWfM24J|HPQ|w9FN!!6fi!sse9T_<VLA@Zag2+JTkJ
zwJ*<MCsySf4Sdw#KkYXD`<VWHMF0L{TNQl7Cb^I49m;R~ji;Hv2l4Q+6vu6xZ(P+B
z;oZn7;OW%NE<S>9HG5L3H9h^+lB*ZR;vgdgS90Y$64&KE=U+6p{g{N8W8V&y+|)y(
zh;^^&J@$H*<%P_jy4(&ft^5&OOB*pfZhQON-%=KblRGUHf|m#amJSPU*rW1DSb^ju
z_fXOv#nD;WqzsmZpr3XNYbsrD)(QfLgO(6ARaKw8ddf266%JA2K%>PD8|w7=WK&XR
z4&UaOIaJM|JAJ}Dc)5S7R)mx4@<dXHtf`d8bf}hW%W8>;wuDD?d^!xTD(Lo1_S4Fs
z*t?9U15Onm1s5=V;-(x7>|~UFLP?IrpE1?MdJ{d}P7Z(DIXLZhRMyoQplp_0G;~9Z
zms7lNsf6pzynb+#bS%|$3zL3)v}5c!euaVZQa%jQn-=shk3i{VRVz8^r}qesBS*(4
z8ogEyS2bKN*ly>VU@=e`tUB<9Nk0M{Rpcd{YyjM$9a2S+Qkepu-x^fQ3Y53G#HOVX
z)UCb-Vygk|p4n4If9me&Uo)9zZjpe%u4X5MhsB6ZF2h;>T#&19*~d&HC!B?L(|N)X
z8r^3cdr)CPGpE(>H&zAB_HeWjm|`_jMy?e$GZic%A-Fce+$E~`NqWdOTE@v)1_$&8
zyYh;O_O%=|4^Jr~LO7_fArv_}amQIJ227W0P<H?{ujzu>PBw21@M@>5OtbI}ZoIrh
z)DVC^uyXfGi|HqUwGUlaw^IZG5F|5iVM`sIcTZ>M)A&+Bz-l@KY=+|{*U`+s5k?t}
zS)NYa!M0`%HEY;}W`b0MoI&aLf<_W6u<1xQr&+P=T%=9UXR#<(k>@S~8WBEDz9#3X
zwU~=NM}H_Og}{dJ|8qc~;=HgY$wB%DC?)PYG*vTppN^|~UkqkFRs+YRoTB<;{|)Ts
zm~w;bU!wgKp48ECFNb;Wuo~*wjwm|bS}NegS@tw#C>Uy5a#3kEs(3UIREgN2R4T$b
zGx8v{tON@l2VDgHfMOw{;(Hqtnd+!3v?a$c+t`JwZ031T5gx<E7BuAbb$78Sv0@KB
zDYZahQ7p?8w0^yFKk>BQ4q=eSE=BC<fr#pslqI7}lFF`8)0pr9CP?VvAm~$&Ho)>~
zV|7cOB7Jt%4{d1JkbMeyXy@>l@erZV6ThjmDI%9(n>`fYQJ7b7hKZ;0zj!HD0xz2S
zsW^7o&$!oUU&<b5r3JE+V$(Gh_x8!lr%yXaGHs#c&H^#awoP>BmdqT7;Z(2YJA{03
z-F<IYWH>!`zTMl|?t0q?+uiSe*E#wiaCok?)zh^4Na|k5m@p`ll2E?Hi{tZY1s=M>
zdDY(2={_PO)>}IMW_EQWawVW@rZ?CR_9~~Zv$*P5o-%hc_R-G1D;B4Ane^67#~!bO
zrs-P1pS+4*qkx6YRz3a&4QKleEK@IuRKJgd@gDm80t&}?N6Ebga^dSrkCyQ!LLg5v
z&XEPc!ZCSBk*QAr$7)Pa#8jtzL1BI_;N*FMqas}ZKB$=S8ZM~%wv}DJ6{!D}*T0~L
z*ybs{dA0G{+r+g^;H+sOh69jm4j@?pI0zoWKo23+d3E`4h|xz{gG%mv)V$k*t@`7s
z-fmJjBey(^xHLttHV0#y$X~{o%SsuJ$bOR^h&_fH50~1RM}ruV7@disFt?~|TCD9W
zeY}G{U?%|q%%eaG(z2r^&7mo>iDzvLq==f3k(@$xyn(zKIazyKm<+<Ra8_~FB{n>W
z)wZ3tCf}+BkXJuXGa{rx`=MqbjDt>qxBrO8A3CdFDP*Nft=G$fZJkasxSGTfHh@PN
zuBUtDj{qY}dv&^6EgoZ5W>3=tj4GF~*;P`O83{-33VnalPE)l;m&H=3Yiho?)Iz%v
zw|MI^dlWxF2AC8HPV9c(X5LK|7Rpfx;rtb8&iMQ5)oLNzm#IuoS$nm*h%i0w)cSf#
zI84Jy@Hor;-}EYVcHq~U*RtyibuOp*5_x)!Nl@-!Vk64niP95P(IQWgi%-p5`crgd
zmRt@$;QLiHCqrR)o+u$WJ7^;)wlG@Yt3{G06Oar8we*-@75Sp?MO;b~lp{H(8d3&N
zq}<us(i0-5W@pv?Bu7^|7k3VSXY>MDc39C|>MPVR4ny%uM&wJc%S#mt^vTrj$78ZP
zs)<~w&)~|Gig%<qJsCMU3U&_nUu>V8cHz`twFd{3y{U)G6QC9lN&QH5iYV0Q#?z@j
zNES%k*r`-!uz{vklsW*5w@vO_Hg<A0A`t({;wT<^uU<78jn}V{_67l_tHBK#5C`J}
ztcgR50`)e9#*%vMlw<t7{u%J|dUe?p;b|)eQ>_$I>-DVy+#vv3z>g7;YMd!Nc-~nI
z)B_LUpfcH7jvpH_aH!jKA50xoSvyg*YEf=>jXK!<QZJ{Bi=UBY9S+1a!0vAr+2wX!
zsix9Xs@g1I&-fwRy7Xg)`<8?YLE~o0g(+$T*$<T_!%~*8l$N)Vdh1@Lg*p3x!fxnp
zmw!HhJ)*UyK~)R3i~OB}Y-BO=Prg`o({1p}HbVJmT-WB6!en!}B(8ukng<IQ<x-M<
zk4~^^^#l6xy~}iPGd93nt^y)2ZnktYgaIag_}*c@3lVKv^r68%YC696SGU}yV+!?j
zp<Z#Jp)NEmE)?lPQE{QEE;KDJG}DD<#f2_(p^M@|IQfLpvlw%8k;#p_iy1DL;%#|y
zho15@1SISfL6H7%>SNk+Kaz78X)BPQxShyhU_>IwIdhLiDYj9tH<8tSka*vJU-P~P
zBL04r1G0SomD{|q!Jnwo_g7a}>DO|LrsPKZ)6aXTPi*Ou&5gA_@;_@Z_0<h~BT=6$
ztLBeB?yawfkM81zSa@zsqq6Tk_FnEh-#$9s-~Kj@!dy-eBz=Dp0DJxYJc#-MUwLBi
zp8}3xW`pYYQ?K4Szw&6wlrZ0N!DZ2t2AAF(9e6pr;afSSERu78*JC6hrA2)2{jYhW
zeXn@ebN4!OSc8eXvBsfD0C}Ht#8QcAfn-!PWelh8fXPlc83MX{F*=v1V<vnzW$}81
zya*DCO+^O~dyy}P&gW%!myyFI>ZvX1*{0`Z(%uiM;;J|Huf0JyopEeLTUl*)37cc#
z*JUv2lQEGW$Gt$|h+DIdUuhP%m@LfarmI$AoT9SjH7acE%bVQE!0ux6tD7(W+|%Ha
zSt~|!E|RsXf$;2<COXu7GVdg!U0dXYgU%g_eqUMiOXYGHbQoRuqtH2)8zz;@q+QIk
z-(!untu@w8_wgr7kTVGA{KJ-R*zLfh5A49Bn{}YuDeA!E5A49>n|0t>VF&*413U1K
zH|xMbVF$`-{=Mq-$T~!&ZMrPord2$j>fJUQnL~BK`7}>U-6&U6e7K-cibJZ7?H-=s
zWhSzyMx)^}Lc*Xax^sB2vwflq+hubWalWjoXR48zsWfkqs{>bUoXb-9{vpd!95j<q
z{!`A>;B9V!n3U2XgbAr2QX{fEZfTXXyxi%1o=BVBPIB;?kJg_7drq7FXmak~<le&R
z3Envm;AJ=rG0y2U&k#+0EK3l(pPAFcg7x9t|J?Yd#jgKOvg=Lc)_k$mX_Kr{(sq20
zal6f!?q!Z@+QcMPz3w$ZvUaV{w$dv*g;z&@cPGIi7mRVRMBd4OC;dkD5=MRUrczq$
z%ZUSKVieTn&YVn>E9)@KJCqzPj}=*ZyOi}v)=I#bgjfa`u9XIMP3=BuqmVC^RY+Bi
z%^@bl4lu@R#y&((Az50fW)wiVw@m_$P8vsnU3{@I3LfSMVZs4v^<9W#r)XJsVap&s
z5q00@=jLus+kp_Ov|UTefX~F>%E6^!gt<L$+nT)mvANwd?+rJD{`{q#D*g?97Wn_L
zYr{wI09q3N>F&n;R?7e9;l{n@XaAp1@v;4XWWvb<=<WmM0raao8_hc#cfIEQ&DO@|
z-Ct)tfSyr^b&nSNJA3~mvjGTJu3Hav<UJgFFjzv$#pWgvn$FS>vJOGnAWk3T_%lnz
zFXaKFxmV>1gO_l|nJZL;QP{rDw<ky2$1k>bto#&cxWy@0Mo@+9<VSO|@%Pqh7+@at
zV1>2O^^@zu4xnmlt4RrcYQY=j^`)vU0QY^0JWkt#xGkd|NuF?2LJqGTcpQ<RAC{~%
z7GnF=eU`Ef9^r1lmE_48#yjoO!71%1gC5^Gjvh@XUrSdTs#(U5JN{@y%0PcQ^(9nC
zw+XTtoD)v_A&Y=+&;swt_VM1%>CPVc#?&+j+P|<aRkMJo=VaJNFC7T#bpV2Fx+<dI
zs##}KP<IHN!z0yyepuZ5<CE>3-%|6?1WhhKs)=>A9*m9%p}SpFRn@?_K5bLi0d$H&
zmHl?T;x<yZAy(@-!xekf(2TVo)*s^n7q~ON+)jd76sn*e{CIs`sTY;=*{Wq7PGZ&%
z{czQ#0)dK+SU;r^^~Q`DzpX2iTfs~E{uLv^=4M`Th*wKb`xH8sCYX{U8S<#v)RCgZ
z{EF0U&7E0m&fn^_jehEs3<Bj>e@1H9zK`N4d#2YZY%WKqA;lZz?{P+X3SA&DxheVP
z10JBW#@Emj<Cz%FON0wbyysbqoW^3=G0O^&tB09MJ9UQXq-yLVAl_OVHLq1w#+@9A
zYbaevav)e)t%~8OLOMq4u^41yL85}AlkF$CU|i#Cvh<ah)p*?H{wN?PGFCO2-===E
ze_1xXi?`p|?;IWNA3x)><yrmlvmIo~$vNB4-dj6EGM)J&3Tm4r&&f2vrcNcStUGzB
z>Eb!W83V`^y{T)Mk1}%ax@=@ao)Ovn{dnS*q(n5CCzNu=R7LtX*=5XgB+5&HK)i!A
z_qwED4+<h(Ql^zuH#Lh^5ThLor-0{RX;%N<FhiTolT_z~lgnmcx8TE}eA0IxN-|mn
z!)9GX!#Oq_6t5v~ik7V^iYp}19%_1Ogfi(lCAiROXf$h-ZC%ml4l@@FHK8iAGYnN{
zU+Tn!EtV4?klr+oXJ>sp_d%i7SwH3hri;O%m^C6~IAk4`&(d&EQuN$U&YcIs+LSIy
zK}ZMUzI|q2^C`|OJSNjCvu?;3j77GtEVT-*tf52{uVV2zrH4@>8!{0~=!0tPB8zit
zO(A^kP$o`Bc+TuP`vh6=i(H2Y8dLM^Go{<oHL4odJEx;CqJippXjW@Z>P9T-aDxiU
zRL|6e*(|xakSAjckz&c%ijXxcbk5NmHlG{gMrEykiyNrzH_Zyt++oXtVj$%4hGu%c
z!{qWD<0)DAsoMS?-KOh})FIN!o3^5@U9ZHZwI{#(T2viI5Ef@+9-~GTo?_@FnnvuV
z8m~+8O?RQeUXPD05^h$D=!$V+=NB{dtTRV4TC%BiU6*VdS($Ud8f`ON6WMoVZCI_~
zLgQ=Qjr1DRR{aJeY63M2w$~8vn(*Xy1*!w%K#roeHqwGQyn9AOXBLg@xuV)60z$v{
zaMnVqt$g!*@1(QwWbXv??tI(Xg>Pz48vD~X<hM<WlSz*qOMy;X03oU9Ql@szJ9Yr2
z)+;PEB?c(Y1T75Z(Hxtb59AjH3=+x`zc(y$L8`WSW7Gi9=$ms}Kg|{q{A7x_BFKjF
zten0<?WCW0j%^*y@*S?IS-ILA-L1iWhI@cDJN7<mNpfZ<aMNTsI{|#3_)%zY)bQx6
z&%J}~bmw@2;;_6>o0_$!sg7L+!30`9>)XA>hxFvOuB@8CbDY~KJn_%)tnEC$4E#6l
zli7GqxdPmW){bRuSb9J-3MS#b(`P%BbKDwjFd5HB=JozdgNi{g(Xv-Mh{DPCvttRM
zfP^)B6~4B*C9$e@PpAInbRJ>&KJua^UZai;lDrmG>e}7_iG~AXrH>z*oQ4fgETPgf
zXh$6*E6Kd@l26C+EXg&E#VILVSJz?sIkFgZ2L3zipX@I_>$oQx_7#ST&vs7sjTD6(
z|Je?VbLMlZLgxFl5vWuUHmB8TYk9-S5f{25{@E*B9F;IWDXM42wkpSu$hR56S$m8d
z@$DnYkmB1D%&m}sEELEK88e+h&(Z8Pg&LL;ToGD1<g#t0PFXmZlO&i20IwG1EQi5m
zJc=EoeeU>ttEfo{^<787qa}ZSBMJedH_&C494Pd)WzqVuh|O6cDcObRTXTd$QNW7(
zmRTpCFIE0VKMU@EB;~<}UjQw>|GC%NXl|tMf8g2Y`=3wovG0G>gi{KT=KWtcnvJ{q
z2B_7<9B{3T&HK&l4bb-dDjbDAs!w%3YvlC3c{svEqm(QJU{C#N7~DKV+=2*k`58g{
z>Dh;72|@Se6WpLExHvG!#B7c6a2WPcrohb>&ZjV{1`R*Dw)Pfaq(0`uqq}}MP=cHb
zdniUTodpp}xUi}ElgTI)p+(hfaMBZX3C6RLx&`a*Jy~)IW+f`oHJ=`JI^8|8`gpps
zfx*5>LZYbaFpOz{3H+iyC)Oeipu0UxvFFR_o$^ql0}H3Jy08<8cz!QAr2@Dqh1Hdn
zN+qnKu?pJO;MYfdEIR5ugH9ZMw|B7H`PTc2UTtF9H2jP>Q8WjxMhAe9%)reR(@*ao
zWTJz+b{#f!G_=(e`oW<lU`#L{cB<>{DVkYuxE)veqj=yxCK<LvPrwmr>f6zGBm=gu
zEla)}S?SqD-F(|u-qj$M@caw`jB$rGk(ausYzm99hI$}wsgU;GFK!LI%B=)rU~#u}
zSCsT13EinGM$@}Z+1kbUS7lddsD#@X9)QHCa+S4oBBmqodfjnZV)e`qNiZ5}mn904
z4n?Id*+vr@VIfLRV=Qm_4@Y45ZJ9phj~PWI<Uc0+2drifF+t!M10}EcBSTE#=dIvD
z-fE$$WK{t%uKZQmIxZ}m4p?1QH<xscCoQjcZwn|BdFah4b4GEhQ=zXZQWR??oM=`O
z$tt*-kZf8*_fm?IwFtBNGvguXPU24liJfwkY|a8xB~;9<OxP0t>~zU^DTbJD7N5b9
z0giR;PGR{hlGVYhdwNM+Kc~r2a1o4(*LixGQ*pJ_`9MPUyJny91*RP=&|b60BeiJR
zyDgYe9tli-J)fB@B8rZ!4E1bhm@-<!y4G^bCjknNRwlaCx#sDY1w9o|j(;iFA_dmE
z#44*$8h9?Rc@$LJq{Hx49v!h$E~5TiQm`p|I0ha@W`j6I7jVeM-4SSjZg=4~MIgW!
z-;<gLg%zKaDc3RV^$;#B)DUp2S`}bHG^ps`bYhPq5C^bqD@F2(WiZtN9^Ss+p5+zp
zSwvWp_Txs(0rveHEbW{avdQe#>nu|dZi#7$ByMB(6uM*3$339eO9CpG@wl~l=gP+U
z#2$sObutNOcjI?8k2#?on7||vS;Cu&I-9q8l%q;2UzN1KfU!rxC2BGF)?@*NTP$68
z#V`y;q)Es~XEo-^7Vl76(}qf0X2~ZUJP+Vt6nPd*u#i7O6%XcFKsh=sorrQ~6rd^x
z^~qs8Pdri+;U10YOyK-5)5VSYX@WAMz1;AI3`cJ?XVCC0@C;f^U0j*!PQPwIBsa%~
zi-~r+6*mG{dXrc)6w3OToCSwB7zGo@FeKPlDussV5-GSBDuP%e#B7|=O1^!n%2)OV
zAOxX@BJfo8K@4YuP}FX|8F6Yuct?^_@vTw_wEHymFN5FDeIYLRe=EOFC?INZGshy{
zqL`MR!Ep?gdhzVsG@jU%WD<334BKuzM^?ZYvqwj!?!4vLG(lSC;!psELWN0Yl1DD&
zev%648K}TVx%p7IN>ztlw8c_x2GBDdVpu3SBOt&9QV&5#ge(!ZOsAAwr5Q9*?2LP)
zMK{CyXG>ehz>o!vFKV?dH+Bby2OSF^St+y3OGwGM<!pyik&&feBNbhv2r&}mZ*8Pw
z+1jxQ^-3S5x5JTy(B<GM)jX`x$Sm(hA;V;O*I^S{*6|z3_Gvi)C5P;Y)zrW~5=TKi
zmED970CJF|GAf>~N0mippd>aF9h)Tt9cx^M3s3E<9cRb3rznlu6ppZi2OOKzR8_HB
z7ZILSaiFJDoV^|K1he+&AU<kib<0()2sm`+^JW1cm!fbDQ~<6G9cQh8B&?8q3P($a
z3ly<<ur+6(I1@jm#3KM9VbUG!+45a(H};}gaOR*rlqXB^uBsZuOVz(}%sWFyiE#0N
zZ@w7akAtEcO__9L;hbs7R3r+L3G%ug_kK+2!!C6A1Y7y#h$T?TXuq<Oh#jF-34CUK
za|7xfNEZN|WQ&%u4ao?!Kk4&zz8qoX7c_A<BhKlOW<mxg15ur@;ga4tBODp|QaQ2Z
zp6UG22&=v;+Tk566-T3s2)EUd?z~C~g<5B3sKCOR(W1C&gk%-YTIDsBjK5f<<}_<8
zl?T)6q9f2K?2)o*>2lFIPr9c^0fsr(EM<@Kb^#z-7Xr^48S_0m<Ve^fdzDH7IFjBh
zgBA`g;*IK$5h{E^qX{g)5hB(0O^G@Rq#@nCkAQ|uuZ7{vC)T#jp!6<nMkIq5D=JHa
z1uPR)N?1T25rZq3yu?yvbx(&tfO^sAoF>Yr-NWtO&Td&zN%jnaCkE9)bL^0MujI{Z
z`y3>^U$@KaUub#;6Eu$oX)TyOjoNEhA84mRf~l5u6^U>vPB0h#G~{zTvJN@6qJt-N
zCY<pZhf={IeyW-CQ4W@#bq}9xcaH^0nm{?{%a^vET4UM>|8$~-X&;Wl{*1_R91rFu
zi}bOD&y*rCeW+IN?1OdvZhAg4bJ51wo}R<--rj&!3LLj0&1J;qkWi%pguC8UrlwSl
zuOzRf8XU@c0Umm^wTgC@&0U#><i+m8$xu3<h}9DtL{F{_*jY>m)|nmTD~m^5XNIov
zT_4Rd=B#WSv8PMTbBj6XrV+QQHPvr@cVW>jRku-T58jIL{sGr-u;`*XTHtLmZy*~c
zwA=pRE4YGCn$J2X2i0sOc#2@2-40<IVk`VD9V_gEB1W9i$3&LjSWD?jlUQuiV?QMe
zzYN`C-%<9i0u}#&n54+Sdx>79jL*=i<hZ;@icvfB57^eK=Za0moD5*tg^F}-=0YKt
zBS<VKYMH{`^{`6fVaDl<h$DpTh<zfV<zErJxhNN{ffnu*r@+Pnb&p`c9#k9r3h(Lw
z#=;Tgf?qZp62ds93lvYuD0Z@?T#W`UmRwR*iKU4&W@$;yNVaJNS?OAh&^y!AqLv3w
zzl!UWj#@y`Lx5&ky8R(q{VI*Hbdx%8L6$n~bC`u(=v`v>&IrsJ7Ew{6ua4E?(e|8~
z*_)+aEN!}eSIry(el??QY57WVI#w*2pA}86#e=rqeR{QMF>9!NBL%ZvK^Esuxteps
zqg=!qttPgh(UPxLUvj|8G~dc?UMKc~Qw73;69VdZx>^}1L5)B7N^GGb>@1lt6s1$S
zL?-Wh64xIa+BB;W1l~!8^eT}OT5_}UOW!4SPoHpTyq<o5w(QDZ@^+63ifw5H0WuIw
zoCL#}RIAqQfu#~143whmb`J!~nnzXZo{Im7G=OsNFuZaEd8laBo7$x%KLJ~GL>?zc
ziHF|Ap8;{}C5Kv2YHZybDF-tSisbo2<flJOR*kHd)2P!$ay(8DBUhS$yF|e(t5*a=
z))lOkD4F+yW%^Ssmgg<>aBy{FGI6e`S(K+U)*q0IWyvGh%3F}oAdN_eO$vC%G0}|x
zRXHzsi5iO*DoSNAh%{5$&^iEUZe(3{i%ANQM!IB%A1oDCl6n8!bM**|STLEETM~;X
z6i7tTqQpkctE>f*=>tT$Cdh4qP)<Q%jvy$iI?9}P8F8K<(Q@9weq#ijd)nT8X7vDi
z6}w&F^N<OtR(xdTYM46<Ht#s9Geqi4J~mUQDx=im%a63N)sPQET!SynrZH3*lW2<$
z7`T}6sADdTZ+4#3$7e?_9LkL=(qhvwk=N5{uUvNO_&8^nXF)`=kFeIUABB_oh-^?k
z*p5)yQL2bwPpT^w_^1AO0t7{0*fXi>lqAnRD$0976;D9G`zf~<#bl^k5HVJVHYDBK
z-#b~U*pUe^t*dij3dWP!wS-u$*qh4Q6DKznZa}6LefkhPKKH60bF)P;EKy9|5ZQjA
zDV3<byq-`BvnL7%D)XO*kMJH`ztK-e7bDh}<>^Z8W0ybpah}Y~y=rERI1~oxJ@%Tm
zB3LnW?m%}-YXW95s+iE_oH-a@hrlWzTP-^Jv#F2X+Zc~<OynCaVhhY??SqFE@y^10
zs&Iu`Cmn~SCz27=rEio9xXna>2D;MnV^0U^$B#T+Z*%w+^$@|YyO-iJdscLHy(+oE
zM=~kaK47e!s7TeGJ4R`$$GOUGYrh44F<C^dw5b`A#sxu5S|lLkD<or)RpBYkNJQyI
zGcux^_fq-wsC;Y+8YQNM%4-S6Ct29=joP&=8!hSW2?=jPHpxP3Mk5sEqt!)e%9c&9
zTs8N4ehU=&s-wKw<ThBa_5{5bM5{~h&rvOWTl$2A0eyPZwt1@AKWDuE@(}f&IS$7C
z$u$meLbya&n!`aIJ}^sR;#07WE=HEblq<ZTZ?(-8Q<p_WG@Ma%wyfUBqUZ&~nDR_t
zx?8zsmwdZ97+6JU<WKAl<*k<mS`2mS$Z>$rOzaaY#bzF7*R-?ovzbA{$z{p0e9D#t
z1qbsRULG!)bmLu0s->p~dtx&513+CBVQwCUzn^0Oq^n?H+&7#fkjUC0^{?i*fLM1S
z972h_K~&OqF<2U+8dROV(~3?t0xUFpWy7|00=eT2XPF@*;t<xCmf8u;dF*aEswQ`6
z(_on21X=L9)slr6sien(qXY1-tLX))jwf~(6ElGh@?6D*6i`b}w5Pc0isvy&4c2T^
zM3IFHa2^%WbWPE-*&eZ|9nigi%9j&Y0lv*NF;0s}Cs$9WhJC|{%+4c@&eF?$_<^7s
zV@BMM<x7-~fd{~!YPLh>CTKd37<jtZ?Raa%hfLD*l;r=K;^QHVt^CaLFn3Rj{L_tn
z7T+0SFStKzBcf~hQRQF}oFUNo@(=5eb$>PYvmdI<ZjT#K;h8i^m%oq7O7n{lhZv>+
zAq=aTXdMay#<LhuA<lE$tf}}0>KR^w5e!?k$koZ);VVy-^fs-7qkSTpPKV)Q3u|_S
z!oqY?rInLo(+7}P|H2oq<jPo0OD@=!9Cy<iC>yxQ#%jsf2IYM}ipUQK{*$Ej+(88z
zV}MVmMp>&*<5mL}x+K*+5@4~(&j^TP8Jbl4Hf@cFqDi$yL9}WVYM8&PH+}WR^iQy3
zI}SEg=plR!2QQ7tSp3M$#xoi=GGs|4r*WUrgJx9kZFDh>^!3xQF{HVLXYTcd1Hhi9
z-_XoxoH%fX6m-JOS9w~t)n-&E705=&lt5$ca%MWQPZ%8mkk%&{<{F5UD8E=$oAAph
zyaMhM^c&Pavj@9)ll7}K$}a3GXD4||i3uq+1E$XMtdv14gAgps5`+6fWwV`qYj>FM
z+nyb4pS(QkU~*?@$s#dos24`$otzrQka<T2%e`{V<Hkg;px}jJq~Oq<p>00DY$g~&
zb}kGS$b4$<kGvm#@nxgYP}f^GL~0rbfZ$SgqO=LxJR(?qHOi9b>DYBhqqvH(-?&d;
zsO@1bPYo{2K`m3nr6gXliONjHkRwc3h~)qw%r6iDh+@ji0PB`RZB%U$QMF{R$3&LC
zi&|y@XAvHH_yC)*O!$Ku-fBwRc4x~U<gc5X@JYqAkVWR~>&Mv*!8*c<aTk{?-o20C
zb@x8TDC}zYJ}%t76Apans_)Xfttv$uhpxfYr7lhI@#0;=Qr8sh6TFvOh`FiVo^dO)
z5im-)!;M6Amg*;WUyaDR_OX`1F-4pgXRO?TRrJVskt{SsOtPl71}Eg9VQFaS{z{3h
zA9n7w)t_slQw{=FF~lSOMYE~Kd(6QT<yT~=ib=;NqgbJkytyqp;?+vZ6#(s8=jTRV
z(x)2^U`YMprZZw0hvv#LoKd8`DD~!W0y8xmR$#w|^$#om#rDD8&ZcJt+EIS!5r<;}
zK;5}d0U*#d24vM-qAcc?$_6&a=-ULz>snFrXc&3QFR{jvSam#?H51$iC!tH(bWi;m
zVTo>k>0366)n7Ue$>+~s=Cd&W0|!O<;5HV=|Ji8XyZ;~)|L1f5hfniy^FQ!}Q~aNM
zcN@({6T|;JywhymX+6a7KO3#h*8ObwpJO{}b>&SEOep9Z!%HN|?7-_?Bk!!<Ed0+e
z!eNAxll1EJ+)fW6Pf823IB?+MqO=WG@&&YJVosfy<O}l%y|5)_aCN-`@9K|XKVENE
z*Q5w;<@UWQKIZ6k^E8~7_!ywf8HiPBBw@R0(}!y6H;ytb2vn<?YSvLSuXeeN0KQ);
zH+ibNN%f91I^4KYoyB0|(AEe=?_M}#%wVFabUe~3?QnaiPhTGFXsx7*h@R`p1iKk;
z@}}NP4s@snmg_XFM8ukR!sY@l2p#y@#?C_N%#wfbnn>H4{iRpy$Nwyk|Mqk9|K{CR
ztC`{d&5h6e|5JQ&;=eKf|JAQ<&i{X=@NcpKNFcQHOlUM`1F#Ya<%ECBiJ7+8c_8<2
zhnBmUV;$cSZWXwtC52U#DfbpI7d-b^JeFGm{vB2=4xMwM6uLVCH;46VKUPgWIzen`
z&%Ai@B}H!&^VtG49KPrrz<3<^+PQ3H#Ll7gLqo#TDZ9q<nW>LjGNgka^Z|F(jvHqw
zl)0z!0RCI2z;7w-$w+ykr4=Y-h9(E3ou?{564D~7QdG6AQqDbD#U9qr<U45G=8CA~
z=XPG)Dx_!arkP8mSx?a-P|Dx*1Hq`E8o6MKqLdZDQZXFzVa><I(fGECY<p#_R?vVV
z;M?!-l#L%9B4JryOrVC3)RW?94Q^MktpgJf!13r`(3K@Xbd-U75ZgIn2DS>F=dFIp
zRq{J^%mrhd@Qb_l4rsO;$d1Bd4JL3)ZoA1JQjuTM<eLVCD{R5)TD+U7NGpW^QscnK
zp47F&R4wFlIg6Url2#w+7?9hG{NPE2=%wIoxq#SeEtj+8vz6Rva#?&>qu@|qH{^9U
z3%XVucCDx<WCZd~G7XuPED~y_8G?2d<ap7t7=7k8v=E5cMBn@Z;SV=KU*-Z~K@V=E
z=g+byDXCWlsU)hR=-n!IERj7snJ<=8K88n<>x8tmq)Xb_C6^}N#oJ|>zYB?QV!QL6
z<~GLcX3b0DF@<;@&PU$Z?@!|ovEwm-@047j9F{UI_X^L{peDkHmN!-~2C~TM6$}<J
z;I!oFNK_TBScPx8ZZ&-baHAhatQ5*dI;uofxhzQ4w<9k`wSlT{1PxugGAICHIrm}v
z>fqw;#R4X$d8tWlo4RHLwmXp9^eEP2ui*E0X<XIi)=llg=3NL@tk|$hL9OlRvFbN`
zuY}pkgIHZb4`EjTqHtNJdcmY|I#F>_HrNk&|7G{&sB?mmNV0&<)Fmm%&YO1!oeIw*
z^tQ}popGN*K9n9BqD#dC!#Wr>e1LxTLwQjBEBEcmJ;O>vKPel&waM1X3WjBuFu4+C
zJ!X>=F_gX|#!n!Zq<u@2qCK=NoGKD=Sli<&w(OV=2Gd;QL93fvX>O+d6#7-tENjNa
zE=!NRisiGko`P-|n{nAdOLkFGSJoKH`a0SwkP5oems!Td!V{R4UN{P8*Bl+m(k3v_
z`Am0iCDYyPNGL+h6Xq1${q;5xXOX<9Y}zwhojtK@Pg2J=YqK=Nu4Y^uiUcm>ypgF>
z>}j$9*v()qf<PVuHy?oUBgw1t;bsjP;<yZF=VbGnTqm<&Or_8xVj9#%*Okh8VC$p~
z4v#udMINctTUF;Jo8+sPO_!!nm<Gm#`H^6t75@8`b}z_fhMWUI0FLJAh-Kw@gkanb
zW0u6Ym&BuB7L++3tqv2NWzsCL127WX<zpoIA{LFMQ-FZ0XCRGSbMOU_+|@S?&Q_F;
z$~g1?4PLSQRey@_e})rG0`d{k|17=#d2m0I|7YXgz0dbQpW=gFZZy$e-Fph+;0&*8
zCNY^?Qx2E}#gJ({hZjLo^48!#>*fYFXRo!<Y}VnQmgntb8pjv&(J-D4yhnH+{F^t|
zQP2S9-0<g*rTU9tIt~*8943?|r+4k0P5p>+N03Vm2sOA1odq>A-HNWg33LT2#J!mx
zq6HTM@;R;+`IrNwBp%K#ku{>nx}PL*KlIUpYY_J-%Z8-e2{G1l1q3AoQ9hPR$VQ>5
zLEw*+9Hm~-ZW2={a^%Z&yMV`1yik&!s1l=a97;O~fsjN_zw?AbG*7N;XgnMa@ozxm
zo6LKoFgdRwm;nYB4}0?&THN9Deh^_r7|@+~iaAS02qeU$L_?>KR0bMCC=<l*OfW{R
zU!KQfcSxAvXg-xZn>g+m&_|7;(S!iP8p9Y9X(LtOxs;^RWK$;c<Q$X#pvzTXQ$)mf
zdDI)6l!=*ad6k^|6#oe!$gSJ}QSMuVn_^F3Wk!_35%c!YrDAH(4b_k59q;(?>B%?S
zM;&kP*n4qw`1Kx!gDY<z!|!s<`)2Rt`QghG4@w+uADn#W9X|E855Dt$3tJRnzVq#i
zqt5ZMcX;IO?Z4>mb#`ms-oZ}y<?i0WGw%shJvcmJr)hwDa!73ow7m}0dx}u@J4ZXu
z;mP)sz3$%0cW4T6a)4l;0^Duy#rDz3-p<SJ_L2AE<<X17;|_FU7a$+(9X!P-&7J+u
z!3mBE+J?to=WF=w9Y5dhcB#SbmoSVY>gCSii|>y1o;^SDo*#C1LAdswbfACRPr4m$
z?ch6Fs@?6q{hGJCy}$jeLlqAJ&=HlCK7RAOLyw@zZTN5JWbg0*@w0PyaB>7c2|p)?
zM<=@WH+#pOnzwzlcZ|q+dUOaaAa<eBA;E#F2OS24n8&^&5Isjw3WxLZxMO;>+X2b(
z;Mp<Ow<i?Q!P48`9|Jtf$mLVyjzQ25$C%-h6GX<-2A+gw@t{)m?s$pVc2>Q4GyqX^
z$GU-*73*Q*&=FANd_t+AI4~JHvU6Ntq_s>V97P{E+Sph0#~k!@jRE*mj1q~JF+xX@
zU@Sdq&G%-&<Pttvs&ie4`L}*Q4`Cygk-l^GGS2f@n9<B!ean`Px8H!y?%elw2&Vu5
z7$gPyQYhiDUtWS<Fe>LLr|jgx;CdxqGmSwYO=!Jiw906e&JWR<3eAIuC0N5@;&YBO
z#W@g*ctYTIq5yaRwgc=!r3S^YX+FS#rx<lTN-*shYqtpLc*6|cqO>o{N*+%xJc3i1
zxKrNDC^*O#jeCzK7Bk0=;Xo2%LR`-&%<?sy!IKcABFaL64H|sW(Nl;f@m`)ht^bM;
z@Fv1=cHF+Cjl=8&SUG{&0JPeTdD2+rRipO0sxU*fahiZ|$Nn`%|Lg@CC;l+-D(%Pp
zsh^xzndwKP(-9z?68}_T;t&efk`4l5G1vyGIwwGSm^vqEcrSrA%?b(O*oWZjNRF~I
z3L#JkQl8No=N!WDNd^~}F-<x4$DRo~{K>kQPX?HUn*mm;B{m0FDu`FVdJXe}Pm)MF
z1W&aCAAGN3ZlN>a;v0?oRVfSe_|y+6w-=|A#bDfH+JVCHMDq2i@ru`UZ+>=m?G0wJ
z&&RDbDjFEk04VA*90b%gzYo-#*iJs!*NxZY!nCo9Y7BhP;s^KjgS)StG{yMISebV?
zO>w#{iY|+t(DMR4ZYYm0{J>^AomJ$)TgF5Ixnp0Nua&d>4(E=-h3s*f8POi;<~O}p
z_4SSVul@S<cKy4?YuXggHof{r<3X@~ALSiVe1PDxarJbg@pNPIbVF$NWx_%PUIZ}W
zr*V%g@d6yskYfiza}95ArrE@pf_wpLSrFiES?KUNeIiPQ7-dXxcH*(RC8|Xf&*R~^
zxg1Wo;gN(g4U;#_&wzZB5z+|8)kfDK$skR1gFt$L$|jBGsvI-H$3R9pok!g7&!>q^
z>0w0PRfu)!%qjQeRF8zzSTHb$@Ij`cGD6NsUr1GtFftx_b)Dn))nBigSiN>I8x^*Z
zoaE|6eDY)6{?W*-t`^Yq;0h$pvv8JR0=Y>Xq3W>`z;dJP#g$2w(h~8smusA0i%E_<
zPjURbKLSCtHcYQpeHw=@1f$X4aZK06opRhGkZge!q9&FTypY+bh=8(ts;yH<n~6l0
z1Wu?q!?;s6lcJ{#=alq-uJ%jKmVK9oZbH&kam*{2^0i6T403`YbL{b9T&F~h@feN_
zBY-}OHH~xPqcI#!ks>F!zcaNf{V)%3HF38R8nEg@!+SRO=}g6I6VrGDZNm?LrnJNy
zp9@b{4o|?nU3AKbv_U+lP-x7|rH{@%Df#E{_cd7Y=;PzkI<$=Z=;;d(48J~ocKUSx
z1a-oqZq^0Yi18x`{xX=Dz)J9B6htZ*(p(2JGvs{Csy@vqD2FSoOis~YBMM)wHk{;>
z`CK%A2}uh)Y#Fa~gL}!|-D&cQjPDc0ZR4``MgfC3h`kIWq<sO+z+t!drvo!W>5rAS
zNYJm8=iXWsTir^JV8hu#pxNCy=c5e_4d}2psXdT_MYX-WxlE1aIobV#_&rbNKzi5S
z2v79Vf|G6uz+xgT_V$uC*1e{+^C^tkP2}#ahjSuo=Ir*~i63YGWDL;1wvV=So+MO}
zf>GFy*)!EJLDO$V-wLVtuY?F9I%YzV>E2Rw@`@k4X3t4A5idzrN|CFk1w;c&3DSwd
z#6)tWw%j<5gNY&DH7c7&=h8Yy{ZXXL;BNC;6p&f!x{YId#f3QD-0Q8I5{r?K&@qr(
zvALuyZ|0Ka;doYNmdH3kwU8oEWMWD(eUOsgY<V;ZW{OpF2FZ$LtwYX)Q@{)E7K(r2
z!$Gs=4O%q}@=nkAxK(N5W~M9PE@ytgo8~=BRNdhyFHEZ*x9wGKHJbO%s_d6+>Z+M-
zdN%kwUQ-tBpyj-{rC-1(P(B5ob!*i;X}(rx9~uw*Xj$~pbmUYh9<Hxb1&~G7p$|4m
zXJ5CrGB3`oro-2Eyryk)$YlMKKf3g<6EkynTaNUn5_>9b+zgq=%;HHD34%AJvr}lV
zVmWWf4gr&0FtPgdv20JmfjoF^_949q$&RJYE*a7yqB89oVt4@rgy*?<es-R>Ia#Y6
zHu!kfc<+5G(##Q1k~dJvObQ*h`lqW^okcbyjff~PSSb)w9*=_Fn`|DuAv%Y<8+Qg(
z&Ab`O{F8J}^4y8;OKNjB8Wq)r9v_I5^kC6Ek_%rpuk{d*x%mBxq=ikGZFTfw@ek@y
zpgx;x5q$u~+Xr9@y{srN|4^(}$wj#7haQYGxoqF_W=Z?rCTWF!F8%)k{~y@GKF00O
zQvc6;&4>3=_dgHrZ+yQ0`6M6P|A!`=oPQo}+}!yGt(d1n4BQP*_xV7*???VwFuk#-
zPu7RW+!aHwPW#Rk{LbM~C(onDdNRQD+9}u1L7aMk<9#=mQL#1JrWD$A!NU;>wBOSv
zzGiD>3QF~U@fEfZO67-`(`ASd8jl7X1jG9wa$aEUII0G<C^FgHhf@jWi4mPgg=97r
zohBT@HWHiY3=OGfI$Xh?VqvoXx~fW$I*K9<ZS~L|fy|B&#t&Dk`2Z$R6>SknyyKp7
z%^xPKG(Otb@!D<z%yx*{TOaSbG}=hmv!X;$PbsQ&h)RL!=(<+WWoT4oPQqZr)EY4C
z{yCxyw+0X`1C}94_7ucK-uA)qp0}eAse8hmNT>nPFiCJNm9c56C_(8eeE3c6;^|ty
zqkBQT&-5s(E!}hBsRwpZLZ(0+g6Q*QRSd`!<zuL3*d_7G>ARJCCD~!nr*;4IY#Lws
z^Q+VRs4#?fmV?$DYNJ0Gy)Y@T&?SKfuQXGRGN=ke<5MdqF;E7zqhfT4FRzM3A)(gV
z4DL=#C$;Ahi@X-joUFudrK(*4M@%u3JoGG_&C<DupPf$Ukv5#w9p>#@`sN8>m8At0
zi=5$DiKLi`i|(U2GeKTdRs)N>TV1o{YxVMxGkZ!<Gga-klB5P?hVgvNWTD$tNapAt
z`=>%!7dS?lWtm}tU9;x6YRB+V)5BR+_|Qog79@}YVyD*}sGH-=C*I+2om9qVy5G8_
zIE&+6n93Tf!<V?TQWo{AwKxLSjPoD?ln1cNnV9a2Qz#3QJ`<}>3%ZywG;n2ET^1}Z
zUOmgg;c!AXRr?H3{7f>^AW%6o+I$!Pt;lQ&Z>HjEf-7rh^~Z_@RV(lVd7Sh{x}mlU
zId9v*@IV^r_=Y7}7Q3f-@VHclTAib#{my=-m(lWGLU(5I%pc)}7R8lvAJn;r7>_SX
z1y(X-^Ou%=K7SU<{}<zr;QNoCCGvl(wec`5|KGj;+5i8Od~Eq2Cmh88R^$H7rGFGQ
zFTyEBE*$%P*fN55jPG(Wwq5(_S81Wxo-3r!#%@p-EBIE7rnob5yNFFDKS_&@mu1NI
zzjnfP#g2D^&ek21p?C%qCj~@E3j(cFDpbXjwk(Jy-ICQN$%imf?0>Tsx7cYzn&yOr
z@&jJs4I6@`N*5dr25Ncmu3EB#ut)&DuTMuolEB#@lZT9@ypyjvM*JxKVCuwG(a==8
zi=oY$nI|m=UaD~$Q7VP5dPyGT>PM8{D>b3%ULDWg><uL0a5g^8*Az@PFLhI@@234X
z!S%a2*>Mj5VFf)%{^C8rps({;L69DJhgXS7L0!pjlACE01O)M}1@Rg+XMeMSb^eWf
z7VQ7Xct1)TOZNY}_wT3U|2(*R_wMKY|5JSI{U0Zs_Wy_P68a5&&Cm>OM?${M`yl3%
zod(DT?<fllVp|rVU!|Mt=d5Rc2xC_sptFyOrNEww-^;;C-DY;{kLm3xr3kEh)^p6&
z{D@q`*2pDQtkakQSF5t~Q!A*NP>o=GA9_c}XtbaPhy!|y7Hdg`YRDl^S5p0;V_4nm
ze0y@VeM)({;1@*_H3Ne&PfsQI`A^wVV)hO0{`&gXTPs$be-WrMlPY>2%UCOusylLy
zJ)tY24SYNeEG$+kY8$F%FbU_sl&dE;+z*$wiWW$x{V>xmRgI`B65L)ij8pAOP1ACT
zB6wRdpb1NOGlvvw`F_3FIfDIcWo2W9;>V-iD%yehI`XSe;;z#5rmF6&tTeIWAatwj
z6jk_cuhZRKX<;2ILq)F9X_hapsN*Q(QASK1k5-4+s)<?86vVjRwfDo+idsvyEz0$j
z9r4y)V9ku*qS8%^m%l4SA({jt8Np?u=KXH(&|6D|ATePRQlh~wMF~2O<2QN20R=!8
z;Q(_-<j8bp)^bHU&WBDiip=+dZY%|Hlmo)_BM$^2SU?C`Z!VQhW>XM^hNxm14Pd#}
ztS1ysBd-^6vS26}R-Xq^fCgbZJ9{^c#h9sTa_7BMZOtKbtGbkEYLVtDmvW|43^kUI
zqp5#sFN}gYD_RGpb&$zPISE_Pf<EZe1<j!);QqBrxC`XJQE>Hf1i)qYzpago{CB_E
z`Yiu_ijOV-(S+0e@BMcO{@4w!Lf}H)cI1z)|8UbwUoG-MqqfY)KbOjU8Tsz%-Vr5x
zI_?~O-GN>8{zKY6$Nm*vql|*+Y<AA3=&&~g(+gk)m*}Nv?a3#HzwI2Hb~^_;cyC#4
zw&he<T)AaH53qy1gJ+v4MqbBr<@!SRwbKEcrqLy55Y5NIl&&FaQ15ISOuX{p(QfC+
zQ=Kj&Vz8WkLKh1t1fUOHgic7;<6b;Mv)?G5aYSWjG-7je^4nAND{H5)Qo|Qdjyl`F
zt#P5<LweNdqC1y-*?Y=g54iZ#ZT0f$;Sv7@zKEV(0z=C09nhcd;m&rKz8&nz-@_C7
zE47b0FFM;NQunBH^74o)o;>f!m!p^5-phj%0rAcAy>6$*s9=+$3_{efcMcDBwz<LG
z!;@nk%0JMbXAHK>e-7jisqUmZ2iyDnly!q#`S7^(mi>lIyp1f*6$t@6Lxhz+93$|w
zU`A1QXJoyp1XO=I^(Ab<EPfM2-VZ27B_zkucC@>FvYi*(Ywmx0N;MMi6*|&rsgDCs
ztGodcFpo@ubv)!58ll5t9itenl24D(>9UW(MA(o`1lLR?lN0LZPbHQ2_6-}x2{Z(R
z5U_z0ewWRL5?t{ns(^@jyX1xuTX$m)M{5rcUsf;_KswKh%K9{!OD-XH9kBzaz-&+!
zH7ZGEFfT72^#tXJQdp)cHw=$3)g3Nsy&r)*>z@byK;WWyOTX=+GGdHPDssaxk+hEb
z85wj;rr`zI5X9_A!&0{mBOS_xMR0rgm|4spbESP{FG&ecI2RH>K?6P^93G9LiX@&-
z`++-ZerBcdCK?<BeKsJLk+Z{?V~mG)vU;MoN_n!?x2M@8p}B(Nw<v`15K|JErld8@
z(ISVEC8Bp~yoC|NzvUQhtVwnoS`;%pulrGOHFIGU6x1|zv(mv8J0~sZ-Z)Xg9dXKw
z(0d)t{N=Ec9Id_1#Vp*YMIqK*7<TiYHNSrypJMr+%ymDC0qBzWAI<x%bo`G84<0`J
zEdPIsk0t-hg!2L5zK_!XgF74d@7!&o^nZ6_bK|}@Iv*OzpDK_`Gah|!7}wnxd-hQr
zD2&%`^tSzF=AU`Sp1G%nctRabJ)K8``FO$>q)I!7BU6FIF-p<PQyQ!(am=TID;1(J
zQNNAG^6SIB-HK>AiAN%%B~@qDO~gg5@s6XeIr$ez{_KZncq~Y0?Xv)@Kvcf~BQ#b>
zH>I|muoksv3FqNp7X=jxZM94uLAc#l!uH0N7e0#MpY`=>$p~KU<W)#c4he{${d0`#
z0zb&Yjq>pUkWJ;5T>k$1@5|-t7Dr0hGG)I1-YxWfZXw?(<mZ;@Ic0jeWrj|fVQ!ho
zDHG+EnL1^rxn*WfnOSa`3#ZJ5TLwtNpO0pnD|p=yvg3WFGLMq*3}cbep|Z~|qbn;b
zYU(gg*UAcI2f(Kq_^pk*^KvayUDBw%P0#(?9CF)1iULVr2=2u+p2cgZ2O|#(i|AOl
z4+pRI?P2}#8zvJ)CCU^+NQp4PCJ}qx&64hM6pqk{Z$;z76nt`c*zIf|n8H1B`$AiZ
zue>ryyg}L9^vXjYkWd7J4{-(r#c-o%=w4Eb6vTq+eA<KR_Bx#Um#~!bD(b0}kd17Q
zdhSmqEbQx1e?`js_N_s=rtxF}dRs6rgCI30)@1BOd<X!pv_|O_+At^h7vPbbQy<vC
zkTWvMV_Nr<J}&%8A6NdQua~|B&I{XE;nk#1Y~XN$9f3)I*1=Q|JBPcSN?294y*@tP
zK6-Y#Z9VL%hfl1Bef4n1E_tPkURjS5^E`20;86{k9{#NiYZIn)y&Pt@2CyXI@p@C6
zLSoU!8&zHC)vdv6EW|epd>g0V)nC(+wqV|>|2m=KbN|I@JfWlbtN3-*=8({#!^u8Q
z7tz1PEW_<5JDYU+(C~l;e9JEr>OPUGU$ze?+tafH(^n5m?;ZcP(xY&v^=6&o=;3dS
z71(p(>@0`VPr>OEoW62Jbr~6S{%SL?qit^Bw^eIY)P!FH(7mfPTJ_uBRZ&Zc-Bb(>
zyg2>){TEdSZOH=2Nfz{5YldQXS^#?YaC`T+?$mq_r&r|FE>|2D_8Oo7k-mKK^>%mD
zet2v@bf8my=ZdV#`GlBC@|bdt%T5mO)bm%p*El)ldU;Xv&$@?Cvh7<>GaV3K#yq@t
z^}4zU{0T;pN<r^FHB-ezg(m#VuxKc5OT0+44Ibw;xV^jUcHrd`=lA|gclf(|Upv2F
z9Dd{c?)-!EvwPzH?6`yLkzJq+lirBOU~0Vl(A26HA)r@H6S1CPvtBa*`^5nJ#Q=-&
z3`@%y^wYzm?%`qP*^8sji!2SzVoz4%IxyN+A@%HZ5076Sb#jPsQm&Ci3=}w7Oo2cU
z-M!-zGbR0Y+v4Q}4f;ZIH*H$$(5Ke|&cTT)n&owB7teAJU6+%((>AT8{$rB(uiEWq
z^{aAuvz(O8JA8FjqaryQ`}4pbU@VxTtvw~&BfC&~De;AAw^x5d!CmNUoBVwf3@su)
z8d4~e3LJ~I%axu){Vhucd2Bs3Bfph+k8UNKw+6LagU4Rw)_@{JiKuWZsR2?wHuU#r
zFtd^dcLjTmJFJA*#aa8RJodu~Fr{x&YDulM;ufsoPtne*N2QhHiY3WZYu1l7Iel63
zOI3)AsLE^<Fc1veHkLjoqj)A?h2i3_GIuC~Qy`X2u&FRPy?`Inv#-kQ(EBpZt6iq5
zIym;Pw5?9HCWR(RsvoQzm8Sc$n&qd$%&mmbXvU46J^nNisQBcK^?g!ZBHAZ;#75%1
z5fa~6y;R*waKfu3INq9UVxJ-#xrGPGv_KY$JeKBQp)0;w%PcdLE@JH_;}BF?qalQU
zoT0$P@ZW)?dk$-6l}gKSE^5GEvVEz!k15a&N~fvk7)(QC*8I`G6q(=#<5%K?g#h(v
zF$$1tSmH;!&AyQAtMg7M0?0OAv_KOwr+=%R;vMBm?)h^#AC2-xiQ#~3W=e5M%&}>x
z2SoL$o2eBsG!!YcWj)dO9&(5C2A}FZZD!%?8nuYa@h`2<d)Lnb`;R!mNRyu+{`38u
z_|JDg`~QEEk8S@U6HW@?=C2#g#$D6_|LV?0^G@?uUh~1`-Cu3OmpmI_4or18Arpt_
zOvU2jh^yD{90wqnPNP)dQ@&kX9t_n4J~hu~;W%)$$~4rJUb(yXWJy#3l_1qsAN%sG
zWQUiF6D#RKZd#;*j8|GGOHoq@5poraE*B_=qYWzNSHS3?+TJ8gBz_ZLccYe3h4xW7
z1$uEj3Vg~Nsv>LIAq7)@&8imVUXkMJ+0aT)0AeDaaMcJXUp4#q22nLtGc+l5bSy0C
z#9i*h+YBCaeNnVaaT+Wqe9$?IOi!CCSCQ>b+}z4(a2kv;rgctxc{9d7UFp0_f?{dL
zp$2@*O;pURqqD8SVKu*7)ZDUeP2=&>ZaE3^;swQ9OGZJ7jZ~9pknD^`p68BcHl7p?
zM<u6uMf%zO7YEz>c4Q{8x7-o}U`Q2C_6E<j5)i-J6gJYi`y{aj`B=e<B3E(jfsa-*
zzlT+%CZeo;qus0=*w|7!0%0hKE*8<P0mx-5`BR2xeKPMDvTHY1^<ZH-9{IUl=#%I6
zf*yz;BBr#e7(1aV)vHvickG97w%_^f@#%}s5ggHXa)$rGnV3$1QQz66SOgQXmZNLM
zpS<h9pSEv(htcz+*?IfcxaJM~>o%NFy>mDxw{JbKVa$Z~t$kntLBD<LxP}!y?~;mL
zg7ocO)7Kw?|0aWE*8U2(%?GA;N(Gmrj8}_t^P!)fiWEB!3V9g6Rg{-lskG{?ng>9#
zCqF2J{QbRpfNO;}k4K)QiN=uWbPm^1HRMD<Z&h#=Y}Ml?b(X2rPV;U<!H%8Xd?aSG
zoYK)p<)|@jG*ufofP|SGrWK=vV(=Q3u=S?5$&4hnI$m#@rH|e<DUMDJrq<ipyHLR3
zojOl<8r*fgVC&7QVs8|IA(Zssv)Cdf8HTm7Q`|qAX;wBCa7P|VnIxlsIEF8j#Q{V+
zkl83&2pt*9ri-c{10_tn3+jMX5zr-@TcWn9^v+(s)n`_XqTcDun^^^kx$$!=5g_9c
zcDNeVshH3fVrMrSqfysbVISLWd#hirs>n4jPj>X;fO62_*_a^Ro(VosImbqoZ^DW9
z!<VaW02!+$3Ac7-Y>{56s7-9$$Dv^nQ@ZJ_oTjyb7#DOrsi1~yZC0*IKo29{aquFQ
zxes^jU&}`GYm5-1&0UEUbT~hI4VQt{mQmmv*B{Tuu)LL`)hPsg*(wCT@(Ljrw@Ts9
zykfw@ZCLO#w?*6}>~e9m-pnhA+lo~Vf37!wy|Iy3_R?(|e-;3B3tp!RYVJmbX)m%$
z({FW^Z?9X9BHn*>_q7(ObsDuEKZ3V904V-w(U0#pR;?N;fgLt}Tiqp+qGJo_eG7@!
z!~_+>|B^tG>ba6oU|w1a0GJ6gitS`U63;7`S`nE%H+SIeUX9HN`CTgdu9&m{pU}ZJ
zH3CR1gj4BjSy@0QBMjA!fr8*jK`}Kc7I<{+BrxK0nAIOZ4~0futE{h^o_NwKhru1v
zk~CR_IUND!Bk1>O#;kfHH&GuAk!vzUUG%MWNi%Yj<5grr-Y${quv>YoQZc{Oj$!4{
zL}5~&CeeUh@)r5ivqVo9GEc)38POPeQ=34C$_m(;IKwq(iA8QY=eRIxlIZEW&pH`m
zyaT;aaQG|#4W?z8$~HscVmaa-I^wE+CJkmf$a}L~NiAY725cu?jQNsV4EavFoUo>5
z%LNF_I$e?%e!b}yjI%8Ze?kGIt|Iz#X=Fj^;=-k*G_WVT0x=A(k;hq7S1`Wz8`)wK
zO=U<W6hBsNkQFUe<ZmqQD|2|TjtR4+2P1TAETZ8oY*o6V`<ULvg|L@ce7n^_Fff%{
zlr%9%Gw`8_Dcx}cor{rt&cIa)8xnWOcE+E*LJsv)cjt5)BOAisox^T-`=rC)PriG>
z-}Vm=&~E0tA_PE@gO~fAqrDv}ezLdUdApTv()KEWrrG9&+AjmI0P-vM;}M42rLVZ8
z%S_22K}@g9(sr5roI+fGWyE)xwJvYdT8B}QB*#2QB;$DE=p`@*a~#QpNv~8_3l8cU
z<rPF{Jb7L7M$0uo!Bxf~f#wLGYw`&xO*Qtp^X=Zr>G8{*ozC&Gdn>1%bSTXwDyK$a
zkFg5iek#*B8%BX2bzFa2qgMk)wR(j=)f-t5_|{rY@>bMkRMlwD^viH&0mYy4h7}O}
zPU|k@9c!!fJN~KPk)Fi7!=Lg_Bfng8$X{NoF-TQw45A!TW00TxlB0YQQ7O-?4_cyj
z%G!{<hT};PoyJK4d!p2(VKQUZfg9T4F#uriF`nTpf&HcR{6(Kd_djAn{lRT4zW-@$
z+<WjKegD(i_#FS`lYE@}ADM890n@?|&@H(Dg8v?%6F}?NoA+`qfKD(-1u2X;KO{-u
zcum0&Z|E6de1f@}?G~(`q@qQG+)5Wa_Js_^bj=v~^JNZ&)bP)^hjKrD5mKHvjtzpn
zw$njxAD^6_Y(HCJx%K%`XM4BgczeRj<CTgkx8AI3J!t1@HuX(wAcohu#ZoHY^vR2(
z!;?c7i1VHd3$6F5l+-7?(5v5ezOzc)HQjhgexT_2O!+lI?C-NottaPB%4hW1&LL+3
zRbRF=upQ2X!uRhwF<=f<3hzAj`_q`xT}Z4F1YxKAWN%)nQnm5I4RJdwx<hN|LAM1o
zb4rQyX4ZF1HX97m9X;ochLJj-U}x+R%j0J|QWAN*-8TBKs+Wj{T&yC|n5oS=;F|uQ
z^>JsADBwzB5#QWMNj*Jm^lM3OB<-E}XJ>%3uXQWNYn`64j%I}e@o?r8_P3j5+-|W+
ziP(dkv+I+$uGO-)k26TOj+9`JqS08hG@G$5HO>u-xYw<^B_-xzaSTPbyhw4m<t2Qh
zQ=T<hxyAX!>6BJxSNRo`m%Cd>>4$Txh%19zW1a+45Z(OzDld;aN9fp{8VBWiEEou}
zAh$fFv|HRz7c<40*4(M}`;@{{*r7AM3}yvmSJofTW~SY<zH*LOA<-N}$w?(lEKUHg
zY97_2l8v*zsXfW5oHr5&z{J##3hHYLb1Ftw6e-)SBUM?GTg|)e^c%gZER37_mD>(H
z^1gD~nin+X3^Co<+<=(7P0dY9bE~2LsGu2(#Iw!xM+U-q0RS_R>DuR}a<8DWSuD<M
z^ej{swyRb^&QzRR!Nf+VFi3O_5~^3+h@!f>eZU~8#<z%6;Z?<4aUa7wlPQLjAa6p7
zg>LUh)IU7Uq2M3&uPYcolp?#0OyKM<Qwso#a8GC*;ZIbx;1_#HXZ`aAtSxI?)Y>S#
z2qIXRm9yGAG=`-rH*67c0$>J+>$6(Am=2z1I0fGKW!VHg1+)upvB`=+n$6l~Cvb}E
z!nG?N*iSl^X?Pm9sXlCAr?Fnc?aGyUqQTOhfsO?>?8!UBp5(xG7-qVO-a9wZ%V|RP
zi!^XyC*9gI@Emf`YUHfnridd(+<-Z~s;1lJty9%^NeyGx*PwJY-K+V}-7ACZcj}j7
zAwOToc*lLmZYh@h^L0xJDDT*@pC4T)X}x2oCbOTrS9HR<Nv}#y$0PuE@5d(o(^4Hv
z#iDLe?^*yrKWfsWrtWdvln#4sFK)^AEqV-H#3y)`DePX{l-}`vg&MzruVR4BCzOjP
zz%0HX$;HzFCB=?mBTHssL`F1pV7Rl!M_i7)2L&n#8Ef%xm!CuDlUB0A-%6ZqLn8K3
zf*OK@=35*cG+WzL&agIq#ox1}$#2gyZ-qwqwfxXSnkh>z>J$IUbZOR_xdSRFmoA1m
zk76ONOxdV-n2|M1hh?d~84ks;2RnN;{-SMHhj&eh)Rt`jICT`V0xT&yq+o<9G|(Wp
zGSe7v-t$BS8f80P3Ub4TT~=C1+#6~=d$v_!a_|`0J$*U$uY8c;BX2MtkFU8|m553O
zVxt1svIRbI;v4aGqI(ACOD8_)tKeJwRQtf=VfWlm&gGh20`c(u@mmzy>1@j#w&UlT
zU<xb5NbE}rv>QpPbm46#P|J|~k@~K`xIGt)s+TD4zdxdWAjSErHzzPRL6?fs#WX$+
zW<E_~-pe4m$j928kVaj%bsx(6fxR|}1?8wz=w*&R#WPXs#jsiX9nBMtX@~c`cF<hc
zQ+-W5+uerN)+P*2$H(==gbjVy!a<M&l>$_u(^;tFpN;(qvlNLHLMw)YUtvL)RJ(Ei
zYr4!5?;}}gCT^NfiQ;JPKyIFfi0^c`tu^htBe|G(pP)-Ex2O)yC0$QB{^)0dSCuaP
zhc~NcxK?BU{aa(edNxVHn51ABhb!%(FX+~fT!+4`lpbsZ2Psy7@v=szId0P!9%&aQ
zu`X04#Rt!>uKo4whqiAXQZiABXtu_F@<tT1!DT&}T~k7FgkW>|ueXmd9>MeNWB9YO
z(oDbDJLWGdE3NdagHC6cYu(EUeaDpZlT8TXKBi}Z-NuBdF_^D}RJ)`Ex{930Gy-V)
zA}|v~o@HCOqL)_1v!4WMqb_Y(D$a?~X{P)Casq33;o`pFj#Imd*>@=DoEO5Q_%gCx
z7L2x3!w?~fB4D1&PfX+&L|%Us1FxtW`#a`^Vx3C4<bd|xz~V<blS+84r>l7GP}U~X
z;9@KH4e6Ze&0B9IjFI>vzP423&?V&Hj&fEWioX2&(u#vFi+Xpq?3JJxLT14rhz#@2
z%+8K9%M)aGL8+W~G!GwIlO_$nYQDztDJXf78y7a<@?}zU3o5CBMBsOG;4>9C(A5vp
zoa=^1)I$Tnl9z6#*hSrkQJmEu_Zu(?RSQn{=5W5u0b~^S$n%{wB*N2ggKIJTur_j6
z8*dTg0mfsI`wv>yu#!MZ2_xbiWLN4%Z>-6jUA!TY2b#&5K>}yg|8QEm@QJvoTjA*&
zto4?P<<w@{%Uk}6h=(KpO!#^8(W8ks4t&^=XZ{&TBIoe{<Nb$hLq0))jv_^RR{at3
z><C+z*pg>0opKcSBYd?gQB&<LIZxhEEQv}pJg$hjM7g$LS2jleg&P<qf0P>0wWNZK
zlaM3kBwjCoX%P1-{hR>iZFOqzwECgPL(i-Mz2%Wu?D&UqJeZGQ(AqVEXaHqi3Qb9%
zthDOTp-bLITh7he2;fwb8mH&Oq*6xpN-%EIzi0;5Zf}4DY=YQUKo-93aj7a6s5(cL
z*(I!ZijM#@?nFXUb6J_;N}^)$wf<O7vI7VB)8T0p%AN1ZO69iu<g{AKgv6C8P8Hm;
zG^#;3LL#F6Q8D@jKhdg=B>ZgjcrN5soI}P{UYz;EQ~1&v_HI^o*lXeU%7P+ro}jE+
zhZt`D9rI{uAh0G{1J60qBsKfWac!E-50HxIc}NCT7sLEqT8`)0c=m2dsI1S0e@YuQ
zh+mWCy}4m$yhfvu8|n1$w0}O2-e6V?E)7z8D#R%X+BNG$WXCN1tF`8N_s;_RABl_j
z;SS)-;(u<m?q}?OTA$;8ev*%E|Dz^c=YYB==0Eq~Kd<@g&HK&Gd(Eu*&nSj71ZHN5
z$CD7P%F!NzR@gho1U25<)^<SM`k8XTqmcK$Y2mr61+hePk`<(cC=j1C|621fmiO=W
z4%fWj!54|zy+)25c6=Z{AmU-oAE=PpzX*p26|k~{(esZ_PM_=@Y#;4)jy1;io>uxb
z>kgaUypHJ+S#_rhu27uHe$_7MxEqR}nCb;ga?R=I<@q%Q@JO@l%5nX1w<b>GNCY<7
z5XqElP=vgR5yn=@&RR^BC2#TZcLyii-;%Md;>wynpj-RF7`ol7MJ(v7;Ik*>)QV3j
zjTgPpIN=f?dRC4xWUI)bReZXGE-S}X2maUis0PBsifQfkRjpae2?R^!fq)2;ZkJNs
zbdhZO>>`@t$a*~|jXPmmInJ~JXTLk8D|A5F?*P8a6TSD;t4zN{xvo5iv&4jR;sE~2
z89z)ta=UR3ScO~U6+p8Q0YAmy^(qh29vVxh0g?QZg@c{EdW3!K`6Nf7Gh?}^1xuVk
zI0s_XpKi-4cEhggAiNBVEy~kittoJzDuk0C9(>1GSS2@$xeCLD$0!y3izW{B6v@Qz
z2TbtrkC{NvCgj9CHcp(!7_T0=6W8W4=#oO=N+q_zZ0d(26rs?Gi%u+=5JWWpD73r8
zmx)3YwblF{Q%ofeNQxub$DUjW;bUK-njNu=3oC_WJ5u;lD@7p5+DL`_a>!Nsgtc{K
z9=F$eE-5Edc9<$Y(2}u+HSA?}#BU0QE9n8vNZ+&zf+{&i6e`m0!WdP#fqB{HuWfNH
zQpl)qy>38E6R8)TtT<L2RXgHsUbtSVp)4V4R*S%1imK~Ky_O9~&04j`)uNg@NUwFj
z##m+mvOd!QbeO*twUZG~QCALbL}8AdoSofC!R#`5ShG7RoLz|%)s}_7sE9+wv<h?}
zz?>Dji$c!(lC4tw7mN=b%FW<(;k<>aUYf;<m8<!!^3_2>qpXIu+m+%AP@9dxwgAz*
zdh%;Il(dy8CMtP%L|#r*H@8GCQR#?l1)M_|mW2piV*w_tsB24T%`TZ5_Iol`q&7u*
zvh%I4<8VNp+u`U%k3Bk!?{9y*v$Ngp9vcC(jI7?9#b~w=OlY$oB5Ix@YA}0WOqjvv
zwlRR-AvwosZHR^+DkG|@pqEf;pep#Cyp+&)=E20Q5*5)hL(A?ZSLQw5YPBuNQazO$
ztn4d&kClC8-)5!W>b?57HZ;H0re-~4b|DW?&iWE?{OnY$8!3jKh+X)Lra>dOUe~{5
zKIw@_9>ZMrB!T+!Mac74bY^+p+1~9OspvlRCdqq4X&Bfzp>nPUWJIA<4K+YG&0!FP
z^PCba2jgHFs>r~6B+eXa>2!j}RiSa}4xjfdMHDQSnw;Zm)-jG8!P5sh!h}YRcPxvB
z5~!MBukwrIy&gB{C;qeE+_EFTa<RPNuTrPn3nPDeEjAZc6j%!;PH>~!?$Y1iwSPx{
zdu_@cRkA1a_OT^3JM7{1aZL-M;VhW?=yqOie^ss;?6P||BONiS^m1x?SuMBbotsla
z8%K+CIk|?pbcU&R9Oq$`ov_c>+XZjo<=XlBdYcpa5ovslba8l)^XBQ{(f;;{`(lkd
zS-pL=C8+@L80tr8wM7!ORo2=QxAI=_DI)(}N@UI!uw1X*_Z26k(?;VyYV_qC5GMAC
zh|X9rRTKi?-(C>Q&!6}HEYkn_r~Mz3IQn1>@Iw7>v(;?fZKd_U_gkOyzkZSrumaT9
z?)?4n;el88=ua}AOycQGd2s?yf&VNOE-D6F8_kV6{L}KheSiAKdodpkF`eoo^uznj
zo9ifOz|Pt5=Z~fO3ryLWByw?zb|}4T4|oo6o<WUoR^uUUj%O4|kS<&&!8AcPyWWg1
zx)G2M`{?9aCss}3;q20%22g(B`AHJ@IcxhM?$6PDPHsv=G`y<J&I1HdK9)-5YK<*r
z{Shi7(aJ=<(xFi>@%%I-{#z60Md^tuK@O+f4niO#k;%(E32M|^3|lt{hxj+3@lEEv
zQJ9?95DY9pXrMQr;e8W6?*|c9gaO?_8_9q?EGHow`r3V@GSCo0nIL{=f-!3S@*FK=
z?I8iWhOl8n!@+>YjkaynC|y-EATpDSN2B->^+O=D4A`l6Qzr5R-updNBK0*zM6A@O
z-q2mRnQVELoTH;;kI-*>fcn<prq~mbSwqSnIb}1x)Sw%xAJ049@!`{xZ?=y*-rlkI
z;^^?}z1_~PSKdB`-{qS3&ECoL!<Q$Rr1xn1;N&~+@Ts?b@SXSDy@OrCeCOL2N1fwi
z@9@am+kesB!xXuD2Rq%DyL$)EyeClg;PAxj?(OfL0Nj&9YEz)?b)eo;gtFf`+IbF7
zwx8^E_fEd6c~AFF4iGFz4c@l*V*BW1Z|7xq`^bCo^616kamT~tya$H|dk0TZsnOZ*
z9Gu{&plx{Ub-sq*-tludAW?(cFJTx*)XSa27vCMBXNvdyu!~}>_oM^;Lz8=M?ch6F
zs@?6q{hGJCy}$jeLlqAJ&=HlCK7RAOLyw@zZTOE(SpYvfhX*G|@RRU!a(Hy2Yk#wc
ziGa6{_Kp!bPmd0v1;j2?IwUwy^`OIm5cAk~1fu5%O5t!`9(PQSc01c$0C$Y_?FmJ6
zu*v$4e-ZdIqCUl+%F%o@Dl11MB<yJ*RwM!P0MBtF^b(-AKp2_lu`P3=@-_i|BX992
zM^yvOSte@nd%XK$V-0S7PXe&LJb7CGl}Sv?eL!e~K(fr^O1KP(;=KtvYz??^*hAtu
zoVErHZx8bb|9&1$k^eD7&b&#7F<g5lxYZzz0tNv5MvPfeg5&VY(!0O+FZ`rG4JSCN
zF<W=5j*+E{EF|Xflc3M+Ly9nX3Gp<#R+|9yRMy);JPS6xT~yXm7{COxDWHYP?A(t)
z_T}dd+D-s^G=Ku(SriUKK(&C!4+s9ayK$=u$AHK`)Ar?wM^<{6@)n<QH)-yGuZ4+$
zfbI`rALDre4|@~E$~^xLThE|aoJa~@95M!fW^yw3jO;_VJaY8dpPi@TP)l@y$Jxur
z+(^;ZQ)mEAQf|rN1f!It3N{*d_&=1xl6d4#!(<p<appoDCV}?s)BVF;j67m24(+Fa
ztTIt?*<6x2wdKf@sx42kcB|2BY?#`xAis&HZ~SQtCtnf}j=6i@WaQ7#@HsJoBH`a*
zg?&Tdi29}INGkN4d=D$?5%7f5y@Qj^(ZP226dBA@@?})7_xFyG>Bt+~NDo`Ms(R=Q
z8Tk=@1+e@bf7HnrsG7MU-0eKwe%U=aJqG3sO#|nGA)j~~MFozwfvtJ1qSwdUPdi>S
zTf1|BiPKQsb-LSm0W7fz0&k|&Zs#VY1lHcc*T6A%CBNNqPL~B-x?r;i;%_^h7pG5N
zK79)8xUi6<(}V4DXOBpuc~4(F@9rJr29$2G^a~0iyQE(??f!<ILv@RedB2s><mus)
zzdwD_dA4^@vmSJ4o2Q?!XS?t5f%RT8zRNF@6&`=dorihZ?W*rPhuy;i^J9O1Tm7(L
zfAbu~2cVRlj(&M`bg03<JoxRw;Wr1Rw;nE3&YpaVgFKyWrQ%4jZBn`zDsFU0DOj==
zHY6%nS>wYz&=_$aIb|3t<~QTT{1(jE1-f1Hi?Cz=1pJtvPD=(yRsqD4`6+mk2iOvY
zf65wFz$b%AKwXP|ziQooAOSQ9n?cg|CqWCp^D8pT)Vmz+8d#RJJE#)H_?fu(p?^3E
zuW{d3`#pKD;1<S4aJt5uAefv=(skT5gPCQv4$n_#7VIr<kFEIWVM00JPdS*S7@}ui
zlSOFJ%fufBnRjFV>J$$Av-8Xwi8Fi3ju;6!5+DXzUi-1vp)x3Ci5MnhvFdZZQ&gUY
zcm~KcU}3}>?;yx+J^kM5w=5Yz%`iNp<&sMc_Tph*ru5Uv%y>=ljI7PZ6Xij15{y9<
zV%;hHJqxnFYo6N^Z>>K(Gd&lnD%EYCo5EgaX&C<)pybfUKW*QM^w1LVcvJ7hJA$!m
z9#h;I4wkSbz7Fhuq1$6Xr{o;w@~V6`h5xpAdC|%;4C?#u=cxI?5P|%)X}-41*Sl)%
z^Ur(c&3*Irf%*E-l<)D=8UKk)nVu;#<fl{fGB96<PTNh>*QV)f)AY6J_O)sH+BAJ_
zn!Yw4y5)am-u&8p_089wTfT4J49r*4|K`wQlQsF5^ETI<XPJL9wHE&iFz@6vb%THZ
zUDe@i*nh3P`)H&9l=m=?^8PwH__@yKI{!B6NLW)2QVNIDr+d#{(h>B)Gl5HG%T380
z^m7=@`seb{_L1PEdIiD?3q`{-Ns=*(b&#qN`;3Ui2+19lrpoMum(O29HI+@mvlB@`
z&GM6%&o;f6I@b>MP3{}G2Xppj!rOO(A-BrZDGtHhi8vJaIqIB2lmZ#aI0^gHvpFlf
z&i#wP>jkJon#LF5fOS{i3!mehQ^p*;SU}yjgdQ}`;^?6ojwhpQ*1sXxSK(_?h(o8t
zh(vp;<43wp?-Jx-)fmpof=PiorxbYKo)FFjg3;I2)Nma6=^6Dxq5g~mq>rlJqc)YU
z(ZA@ol;?6&9+G+nt!c)1jiOPcaeR3mswmVJZ0U$KkvanSC^b7dbf)h2(FlkF%8BK!
z$6=e<+1i<M3;hOnh!BD<)lVhra~5qBgBggCf30C?4UkZm`XFK9aTsweI87+b^LcPO
z9Vch69^89vBwrDP4Y`{nGSCy%i)z)9z*Vdl6T4dFWU*@)@jHnmpC-4j(+%)Xw8_!N
z+6t?^V0MYLev40^nC6&=g+tnMSEEf&7ziJzh<kYZwtRsnP>-TnOPdCS!mQV}&jfEv
zie8=cMWdQ7pCXxNnmz)G70%~py@)BMXaSkzQ3(S1xFlj9V%CIqYx;n63TL!Hkxb69
zhssDT*2;M0cu0p0Onyup-g|3PlN7eeN3EE)XM-~{qB{a5n$C3GkUp`P0RmLORaCe<
zr<#K-ix%9JNp=-rni{z2v`!z856g}5Zh=#Kqry{Wyv{%>25Q^e;B?vMftkT9o3ln@
zQE;Z`sTlJk-LY4y*6Sj|-w~<~aIcC6WPlGlSa3C)2IBxPT}UUuUch|iC2F5dtczcY
z3L|~SDw6J3-XZQ(mti8VKC}<gV%qdJHnoc|ZG;SF%WH0WQE(AVQ;#3RbC3kMHiAKA
z(x$h~An*<Chj{Tq*EhIH11FJqL%>$BeBQ!^{r%KcQxTLK$}2!Ksa>_^-BozcG6rI7
zx1nDBajsfT(U{8Ik-Gs=+JQVEgd0krw0CfViu}b;?&d>5M5Tb(RCG6oiUipdFvv(m
zQIIfCMZ&nF0y5LIY7OO@zOh>}H(K5H0Ta{A6CSd7Nl%e(nqC>Kd{Q)|wT_<<4e6$r
zp+SbO^{%`ig~D-&toxI2&R4S~GoM!DetH5(_kc<?@8yl1&J%hrMca<XFdVOS83(d7
z(jPcX+LTc87!6Ks!BPK)iuM?@y6~HDFRPZ#y3}389(2gN!&X(eIMnR}8vv;N@Ei^=
zoIrS>wfL}|nx6jGqMoKjiK1f8b}zbhLY6Zacxuux<w^=t6~~jQ>dFJomW$WU>JGW!
zmXc%O=H5d;eS!DFRklv1Nr80~4zE);6sLmD9O+Yw5kf_rPR&RoO&gDvG_;Wt-_2oq
zFQOz1*D&e+fi@9453YP*7U9?*2@^1uAI6TOtTFXA<@I}$!NHM)Lf#ExkZ9lX0kX1T
zuGSYUuGEcA?gGn^q!$R$eD!36>G$A7H(6z=j%!IT4Q46o7D3Gw78mS9H^Jt|#6^Cy
z8Lsn*5P?BWr}6biRc>jv&790|tsAf%hKaavd%ux!hv9Bf%FTD}z1ma4%s`^x(jJLu
z4X{?#+75Q8Rqxr3$I+Ki0O;dc$D2=Nkajvz0LtM;M^=tLJo1>(TF_R`bhs(~I1}B7
zGyRrNPtW>gw}1}P#D%J6bOlm63_9O(XRD|pN#@yVq)aWWL?@O^9W?UER?)(lRUvKm
zW7SHFbXKjj8Bn&Z)OyLbnA+R2?G{7GH@nI9!8T^dv~QUbWoxE|xoq{ckrBtXSY)sC
z*xM-GOtetjl&lD2#)y)VW#w_=pRrA{W!#zI5tnT<WtFf`CGFH+=sogU_a7+dQu$CP
zw9!e3dze_Xm}Pk!pamnm#}kY{Q|6$UPIWk+lCF8esxlqpEe&|}r&R{6O@6lWO1-s8
zbq;oO%e;~@+At`$)N89$5u}=wA%maX5}Ue2_b|Vm?>D4KQ6rwbH<m;BaAr3w7u~Sj
zG^d=J(3cZRVr|imGp{$E)S<K?CQsS`hf-a9RZuA`s1!y+ltxKxEULSgs+(6PDu9oo
zSj~(4s0jGM4S>%IfTOCe2yVHc4lCx0YONOz1KCqit$N-V(p;dqv5*O@ZmfFiUYG);
zXr~*;Z(uj(nB)jq*+H`jjZIYV#)NDOH)?!i%hR7bI_kH>-!c^i+3;tppuqRva|!rc
zROAkqxKmi5Cm?!-C1z4$R#+mE5>a7^p_CXFmY7P3X<>;umzb}*xO^FfWF4pGP8s;K
zTcx?vrL7FzC^FZ%MpTp?EV$|idAA!`Ik9G0ui@L8ip-2U^ktV~o_p^B0wX}M&#hlB
zJ>%QbGPZAoJ^KW^!+sYaw1yyxB!S1VpvrkYBvJi(LMcVnRVc+_#qV-Ef%&z4ZjCX_
z$D9dzAe>5^K)luz2NI1$%b$ch&JScYRLF~gA{KKy;skL-(me$(JtuF6-8e|1)tQQ`
zBMs_Qf;zWCW_q0-rslSI9`#+NHCI5GiLzgmQ$o6kes4#3SCW%H6OGK3hER=nTOuC{
zeSZ^ADLZgNzGRpuea(B|RZw7>3+eMRNvaK=PxKeVK&jgNbsCVJtct)gx@Kd_F~Sg&
zN>y`@)K%!(NA7*s9<GHXfz@>uzyTEAU3-@?V!s!7=OD*HnM?oLZTZX(VZQ$H{w;J$
z2?p~?BV~Qdf%i{?@nm+5){SSg^9rL~jc?u4XA`L-lZVJXokw_HkSeR+mshL#y945!
zqi-0U4^JIx1TAAp6GD`|yl2R_Ut6Y{uo}5yu71rWEbf*RU#?**92oaPYmnXn7rZK;
zhU6O<=!m!Yov)3=Z4wi^%X7VQXiYYuEy=$@$wz!|GM`FiT$kSC_J(H?T7+^PRZ6LR
zDRmaUP?P+w{8X(yv7mipRvaAXtmQWgFf={=#)~km&Z8In(>YZu^9osGBmvYo{QH~W
zT2ZTIv4KIL<;d)PiHXcCiZTG8Zp{v`ZivTbqX@&z!RXz-?NCPLjb;#%UXQCe_sP=q
zp4cWlZhKAdE4y9Q_HY!#M(~CjeS^B!H&i$cOBIK=Y@(5VX|VfdD_avWy}q7(K`2LK
z7o+sCKj;h?M)sXGe%_YMHyh9U^MpKKk^AU7P@vFAn`pokRBa?!&9|)PMP*cXZ}Q3R
ziCHSKz3?J?=?h0wlW!GWVsPqBSp2kV-cgFc+1Z|IMCN0m(Y0b#N~T7E{v>@v@MTUp
z(dxL9TOj+?JX(>=S?WzPh{?x_ws9&(tvsb=o2#Ych}hhT?5$rev$%nPmE#Oh#A6(z
zH`xJ$D4w64qt_*x$<WnKjDh?Bhd6dQI#h7os~wP*f0gWmkkfd+7Es8_W)jZ=cD82e
ze+&qPy;W_X3d+l96ut?(GAohFwDTfu6I|vn*uP|k4zI$^S@5yFVJMyiB9>lNDE>P}
z5kg;B?>XJkp_+w~CgT{XkCyOQRe*W{+9!}GA=34axDtWylVF0aBZm|_KEP4BWd&&H
zhodAt*l&o>l6x)77JZ+L9K8P22MiA8jCN?G^X<ve_UZA-_ReorQX&O}=BS2#tC!@$
z%cx;K5su;fKLPH5U}eMGezDhZ7OhPqXhe~(aumBAYiwi%QB9G*ZEW;DQv6NC_?qET
zbn#9?^sPZPE7v<?%LcWxg=1E0f7r@fzT~zt#|CEQ?{aDop$1*OFFF3PYzHFMm^5ic
zW6c`B<jW-4@hssyd4~yG4$_Cbi2cU>n!abqN_a}Nd$p>y^;pFSIa=y%lGNLFn##z(
zMC%A(ktA!kTU%Wu#HzkDtsMX{I`uElf>}s{3v3;s1tUvtveTq!#yZd{s3}3>?J}Ib
zUR_M>O1k>coo4yz(fEMnh;}2}HkIlIHV0XFA(0hEUrd9GKzaVL!kuF%s5&XxlwG>v
zB{_hzCpZ3jcOgL?VasDnPCM`qFwV$cG}O1@CWhLQp*2%O6X`59pc<TYXKdaFTPAeB
z3``QE{mnp7F@so>&<0674s73f;2DAOu&iVKMixgJD=D$rCBAVm7TTkJuz{RiTx}2P
z_gfnyHyCTy3v}r;-nhej!GG^&J$9B}@qwN#I!>RRKHWdTD<l;s5I%U;Z+je#;q>fu
zIG$A$ID#{o@j9;7aPYN-H(LTy)xVnI*wUJX#k_!}`VZ#?Hx@W8?hle3dzvaq^iU_i
z%uboj;C@=IzSq$<wT0a9r27f>j%9~w!IWa6=1A=-YjiQ^oV|D{*c~sgrdC1TuHhb#
zTB#a^>+JjTX4yTBS`0DWamh5A>Uf?y^M)O<N4dG0?L<yP%Z`Svo1DbTd{#mlq}>4}
zb8R`QT)WGuuHz*U8Awk>32afq+nW>3$CEfRt*K^~iXv}~V(wTg;!$d)fJtOZu4G)&
zaxaiuKaGrTaVbl8En&@_#n;q(Og4CU-V|gg*2b<0B%Tw*JP%s_YFrA^4y(=>QEEEd
zzXHd0vsI1Prm5X?iN@EeOt;KX`~I?CQ>t&%XJ-a&?OUNv<z|FWJ9AchYoR#BZ?VQ>
zZzD%!bkADF&8r={5P5lf^^Hc8Pf-$sfAPHJh(x*2x)>nt<#Fc-^P}aFlx;DF+0WW+
z!1kfCnbjHmuxO?O@T<pn@Dgn-c?&sxdBsVnSmRNs0m#pj=SQ9GU5k&bk@hJ&;Hrx3
z)(ebwVvu3LH_<TC-sjlRmR-)9yB)mEGh5{5-qBVw<6ddaiewc&HFi#^*K6rFCU{WZ
z(Qb*`DIR~wCe-*LHnr29*0?UzFu4bcmq4wPX?TISkjp`9imX^WZSQveNUhP5-B+G5
zdEQax2rnSL;3{M#)w0G@)?}HsQS)av?rH-HH~Wp6m#Kq=p-BNO8<RaO`!-gI*rW6Y
zW|et&ji1veDv|bKV~Yhc7hGb%AZAYNOOPibNB|tsQ!EqPsES0K@z&@|b<0_4=fTw=
zJPT)-T#*y|og1A8;sPyj9<}kQhq}{qc2HaW^=evUO0Vi3lsBiKr!ge~$B>7_YlUL4
z<R9T^a@A7TeAtk$8?xFNX4`3Qc<ZV$f7L~KJ!1haR-91&o|Dwk9wrt;B)qacm_y4J
zSWIcRk9YR=sA(#WN^Nq-g{J5M_f&;_Bz?GIblMscm3>Mjpdlqrlw1bFAF|djFkZTs
z(GBt_$YRNvSomRXq7}k*;YaQvF@;X`$Wa@}dx5b5FdlhLIB>4pP~>fs-u^28Ws6?k
zOTCnV+<k3%E#VAcidJPWg#U1cZkPs&1=_H!O*lHJT-~tz!?8QjU@Z3Td6=q<Zob#%
zv*E8&7vCB<te#VRFG(-)Yt1cTT|aGH@yEHA(A|856#ww4jcNpk*lQbbnJdoB4QI2-
z?RfHcadQRjSp^?I_8wHdKSJpp%ZY}HHd94!L!rA*x$v(xGF@$DyUKkuUA;k{pFX`=
zr;*;UBc1$SXGU1md8*TTw~^k>87U1dXQVe6a`Wkp2mLGV)6<&_8ZmT(QNJ6e?!FtQ
z?&aMgv!@4#D#qJP_PS*EXM#$CZVdA1Sr|p)@{KFH`M|R*rZ&Cr=ikBy*Zuc%yxu&U
z`xG9XV|A0j!pda|GOlH4WW1JfC~A;7%(lc~B~EezkdhJZzKX$c>|c^h*dJ8IxTBp_
zo%|`jHEKxw!G%wucxha611i_7(l!rLSvO1Y6=7kU-UeVSnfLLPiR23(H1DC^ByF!_
zi%w!(cFL%#WTgiuh6hdUz1PY#6O|lrCX3H-_!B>z>YHQWoQw<RpH?Kp6bqyHcM8TS
z$N(u3TK(Yuo$`_Ofh9Xo&>MTw=i+xjo!0c%cD8sNSpD&2HWdrBoCRl}a;<$%wJR+q
zso~Es{fZmsz2$M*_INtpbariE1<j^+<z4HKdi@R3IoUUDde=y>2=P2TJ4dOe2ZDgQ
z-PZke0AtOjRTD4umsC{scj#uHZ5Z6Kc@^paS`NgQjvY*Dl|TK}#s(d0Hm-K*t9#u+
z;*Ge=HWO>|Rn~fHCUxoIws3DFrGZG#k7~;VH{$g~7cD3qxF(h9*47;QFqB7{ax}yC
z{`g0y{h|t#{hTVzS8pUc*}Z4Vb~?`}uzKsPoJBP5j>DDkTp*9q>YXCw+7sD|1{%9;
zNJxP$^wg#hoNAJ&W(P^-OQM>c8_qB63jH~;-mJ7|wP-Ve%#H+G(j)ROD8T9MHW%Ak
z2JVk;MG#eS$Hr)!ma@xcV$F;kqz({SnN|A`Qq8Q`$pWVlHVsGn66bpnBirVUiup9{
zT(Tdr;TP{pxffL9U~HSE)*sKtlbXj}F;r%eVcSB$jeI)c{4eKHHjl|UsJ_>MH)Z8L
zouWQUZFB?{2E*4++O^Dj#W-nOL#xYo69ZR@(h0pG=Zm%{P34akm$~RBc#t`}aV__-
zZg0_RmN$j&W7^Ha(p&Y<trIMYSyR5a;k#aA*M=)wB3oc-4)b4GGdO6s<vvY8JAM;R
zJbizy3!?s7714B~wyK#G5SW~2$)p`a%k}&7F)wyXHG`iu;dcYoN5-~#=>SLLXaXem
z11d_Mq`#4<)46~g+GnMd2Azuf2IoJ(xj_mu|MF_qX7fD9#`gt^p0ha_Bo5S0Ej>yZ
z{N^qXYe8hPP_wC2-sM~N;@{@6&lz3fdyv_e&uQ9WOUxM#Z(wOBtMo`1W6o}+J>M;0
zM$A?K$&$mBw8xVIbWtO=n^DRWpnv|_MT#}J?AEOcERmyG2+B9GHulh&*Gs2%Id{WP
zS*edwvJM%V=2&Q_$pAlZGdRg1+#B`TbmzUgk){S>Evw(J<}C}&WU`|$+g$|GxNrF)
zqg*>vBsM?`qO*}jw5Ac`iKdnW8t5`p8A$dfTR>ar$st>2|2$<j=M3R(hJDIVI{pm9
zXTmUkKaXKyRLWKDZ|xfF;I&egXQekfzRO*-eYyH`YXrBYyoqG4Z^4PtDyt^RyOVQD
zlH-w_VCr90HvagkS^xEG{`b`e{Ig!IG~~-yl~+OM^{e{&>#x)kaU(N3sn`zjPFlr{
zB*6j9;sN{uehtf;B330TU@4l3iB+oZFWS>!_bAHg>iR0brU)^0`Zv^JW9sTFm&u77
z<H9D8qrfNIy*~ugII)KiCMiQX=rrd*BEv8OQI=t#Vgl`B_3&1yDL3a4D>!5Vly8NK
z*o9r;Tx>L7jb%O2E$YEgN7$fS^+F=No&^zwqSVUmMy@_0+sp!8gq>i(7Q~EXaTNS$
zg4w1ga@{_@B7`>1ZT1QwCCiL~V{_^ytQgK%bCl!&t6RV(w!pKnTN_t3I$zr~kpq0g
z6(=G}!9knoB)xg^@f_a%k*-l_M_Rq2?6)>MeQrd2^-(uESo!vC`Xd)QRaL8N^)p>P
zg+c4lM#eZ4h9#h_Vd>Id@dpj)rUTBsD<(#+nT|m?tj#--AKBRa66iF-`zB0cJfR(G
zSk5!@SGx7wO3M6m5%Ijhm4aTF%xK&-gG)&}F~|y_wW`Ee!?UnZ-xsaGSR1b{K0{@B
z;rpE`qJddo>79e^c5-$OnH6pRDPz&=6?P5=Y@Jx06NS8WcE=kE8r-&$F&sM+s|jgA
z2P>e3j$4yfwpyfRq1$+0V)pe=Ia-Q>cix||a#%K1o;#T+pOx3F*2QYhgg7T4Nrx$i
zP=*5R;UduWco+(x&noOJn@!Qf`w;?hUAq7$PgzrO7~JEgdTMmI_E8gs7gzwZAes36
zK-03Eqa1^965dk+yLDi&WG9y{b$AFzx<?YT%YEsF9C5|<l;KT|Y^FDeSv(EMa)iPu
zQ;^I{?ob1mkhoJx9M>t!JTy((CmWTn)|pMh*Hn^gIHO)k*{Vj=4OJ1Ud%NUtrBpja
z-$F8^>s8mzC<UMM@zdgz4qCNJ#GayeSeEqEmi%pr-wHjPZS-I_yFsL<;VFe@_bGQ_
zlo8`S>5_Zpf`>?1ngxUY(uymR9(Lxqk>4>DncKQgV*U?{{Ol}1;xGxzm?9Km&@GV&
zRuS$yRb(7vwGm)QgeaAQQe81I0D2Y<&>?XcD*aB+vbfMC>EeL}LG7P`ksiZ@++S;6
z5YiT=;uI(Wau`n)2o*>14myNX*cIb4kf4dsWOPPEr{sQ8aRA9T8m@2cxzZ=4sVrYh
zR`ZnEO71jRo+#%cprH(8gdCP}jEIv`*H~<=Al?_$Um(V2yffZ=AIlpaQ(6{FnO*<J
zSo%_tnzd6K(^q>iX;DDzZ8JQX<pD9dHL=y5RfHPid+*mbV_Ew#I=4~Kx%=<eIc?Rs
zsBawT@I7&I6Z%Z6T5d|NcZ4kz01gx79A6V9>I_8~y1Nh=%GRD};Wyy?vXneqD4qCJ
zWe=lj(b<}eudKQhb;R~gPMt3O3Htv|L%xhhfrQqTW7-<)@a>c}+t(YdNN8sm)p$zo
zSE&VPLAmo07MqESCqko-hD&q~oZW%L3LV!&iGb6O&muCmB?VK%)~Ubiw##BGp;9M*
z7{meJ+i?#`blp9q6x}<RE1Qx|?|yf%y}!5P?RWMMkG}KZ`Qgs?NoTjAQkT>0YlB`-
z8vti@`y_KtEdkf4>Mh}!j5aw9J7I`b7j))!ec{p5?-HH)shaKBE)p|rI;TGZaNg-*
zk&82XaSS1n(L^>D*X$3qvc!*b?Q}J{fw;|ODeH{uI;`Eu9i83+aZUG+Q`ofgbbL8y
zB~>~t_fu|EtEtyU*c8J?TS5gA*nriRAeR7XVltvruP8q#rc=|3lWM!eca%VUE1@O9
z{ed68Z6Jd=TGA6h2&UpSw==9Hu?;{+7^~ULzOXt!>4PM^Ko2Es*LF*&*Yl6z0&);A
z%%#-ChA|lIU_oPAvt;c7>G%fOt-+3RpmCOscEF7<5xI+qF=ry5x|x$ChXCi1r$tZE
z<}tFtf~n0JWUb)vQ{V>5XlBn6^Z=NVBjl3la6Agsa+TAqqWZfMKSb?L+SsSjs1^II
z<r0VD-a73@CU&r?n>x=cUA%P<tFG|S+g1m)NuP8YhFwS~(~RVuT@{P>w!E`^s=Y7G
zy+e*qQ4SN<`<jHULf1UG)=ZCFM*jk%vsfN{3Y{qnf9{mc3)M5{P9taI&&B<s@lt5k
zcN}g%9#MGq+#&KsYrZ?=@-8y9yB-Cq-Q4CdxGo~Joo!M=Lf{oSdO+QM2aFY=tcWCU
zMwV&Pw8*n~diM9X-+6k_#TgYSOqS4-+{wDZl)M!QO;)W5<|e!<S6s2O{CpIiM!0dk
z8(KGDZ#U;`t&h*yByiUP#wL-KKbW!EkytX$6*pQ=+4T~taPDE%x$=Nf!ob*BL!<Yj
ztf?Gq{B^D=CjXDSq{@WL^5RAH^LtsT6dmGjZHd#4tF_uAHyy&s+reCMUO#m9Fa?8^
z+go-sX$Nc_Z9+R==UneB2AOfd&PfWFr-oS!RR?8HIg95@cLlz}4n!TCJr`n%wcZ3E
zDs&v@+`R|`0n~Jopz`e18(h{=I4bi&bpU5mAh0)lBBC=h^2LU&z>s)u?DD0Q_@nUb
ze5Ra_)g}}sY&{pkIWq7ExdM<~4~IqG%K5{}_!}=>!Mw&?JxHz(FSDCsA6~W4@Q1M~
z&D*pj3NO9>$S$}Dv$4#Fm<rJ(*qIltRf@@9RPXFM?zv5?An6@nRBF)HtqvK4Xp1Di
zUY?!%kys5^k|6Mop6+<}9<(0TKyd5BkwW%uwS7yzV5lRi8;S=^33~%Rogq6yWgOBS
z>3HbUA)F@qirO63GR`%<K>Q&qc;SaZjyFlI-%#2-1%vOvB@!c4WMdbd8W`KWoW^)-
zrsG}Fy(>_!6W~uF7lWUY=>lu-33KQw^~XPY)`RA2H(jNDU?s$es!D6f6q3aM1GXpp
zcDGfw#1hNz!05ch8yXRP9*+ic&o&FELHfFe5HkiANLo^JX%Y!a2eEi6vTaWy@vab{
z*uxr}lHr!R@1ao8ibAaRNzvvSP7;PtAE%AJKuD`tgqtg--Oky3^W~v*$t>!o;!NO;
zV^R@M=I9YLoH^p<g0}Odz%SK3;thD1z$?prXh!x(Yd#v57B1hjd+%WHWN*8>cbv{Q
zj;UC5qBM-V@O9@1v$WuLOi{j4&%8(8{f!noypAWpN_*iboN>5s3^jAV(Nq>(MADcs
zXdd+wjtr_SsySg2>?GrOFdxZQ<B=YfSGdj~joH7oIhc;8;FDH2oH8r$B!_te`UI?~
z7Xu#YW>Cdzzu$lpL_D9$Wxp+LIi2)Uk`}8$smM`qhVk<yRAV%s*sj^3&FfuF7L>$^
zRGKI0X`-&wNSxn7-G2bVKt8|yF={oDOz1WSACYj+DMFAx={=b>^=IKlkjk~KC@bxT
z4V{p)0s`yD6Vnl82Z9kTQ+8Bpqt*+jj>C2j5R^ZvKZ<eXU=bP!_K8N0#|dnZ-^&HV
zc?=?oZayU#I0>dI0D_$4Y6d}iE7v{X=t-tEiP>+r@Kz@Z5=R5T;}rH_a|;ntcKI1^
zz+<E$>MVt?2d+B`Ih%DtTK?@Mf$cfT0HF;^yVENRfGCdYn4@0V^&4Ls>++x2fZQ2j
z0KQF>%upz>Blwo{Y!{{55_Y*TqbK<>PN(+%JqmjP2QcL3^CJM59NxB${6hsA=)eTS
z1fxBHwcdfV#dx^}>s#gzRd`ksGlw4WffOU<I+Qi)-%}7h(M!aNtObLUm_yt)i$qNm
zScGm-p;Vzk9R=y1PF3i%&e74)OUEiBFGOCpL-m|E;TeytW7m8E%`hnIh1Z8I6&M>&
z6<dE#IeN1Yp!g80omdeSfEmNum|_t&HFu5pQX<GcmqjxRF)ZR1VX3g(W)=)$)7<Z|
zbFkN^t=(bp+0gxc*-9^SiB@x7SpJ+aQe*8Wpsz>*R}&10ulcrS7tyh;Em1#JBqv$5
zDqoPxIv;?(*~qDFZawn4mtQq=VUpWwI!I+s<CzR?xqz$~GC45p{BXI|Q#bQDAkugD
zxtLf0roaTi1p|asuDOKemf-Z3oM4pKo10!&g64_YrQxY2Jrf&~QfwlNndK9^TKQQe
zBP|oT?>AdG?Kv#u@bSm+K}YmV<(stcytKT<o3Wcf7`5lr(*~M_r1|Qi19@)pN3tzR
zffp2zEOW;b?0Hl#$u<bX_lXY^M>*X;+&$Rd?<{Kb6bslHCvyRbz`78SlqnYp&Ndrs
zQ1Zwd@iHt~$k3d7b(kiV1y}Pa!_@2~xG5Ra=9(7zpN3ax_=zqOoDVdGZYR%Yw!;f&
z8rGF+$rdhY4B_jHB3eWO0|Yi%DZ4~~ERbp3@R)ghbiwE4jh1<eCqcwRFWPg`_=PhP
zoRGZE0i~K|3VYT)e6romtYzOj8^t|;<dq3VS(IpnB8(0qDMRAgc`G87>eAU{9fq@b
z%rxCg25v~$VOQzpP~0jMzX&(|&;y2$T(<9dv!s1*lWfAj`26_<ACRHLq@K_W-2w3-
zxdXF%Cz<x|jF=$LKfDbLFYw^OJ^b5zcz?tGi=S5O-o_Wrd(GB^`}ZHV?n1fd!;NO^
z3vc7Yn_m8zqk)g-eKGINquG2xxh3!ajehQ|mDbk0U+xVyJvHIA3$N8^ZZw*Wrq|lo
zczCDTy3=~-HScb2v^HD!y=e>*&n)&jR}=4-SQ`~5R5$S|=YDct#fQg10LRzK^%P|V
zG`0%KlpUEz<Gdsar3kqtw|jc7)6we(P=q4M1zvf?*9DF9a;c;Xo<*pTpVh+ZO67KC
zR)vE<JV4%Vio6M~D^Ya?3q(*L1PS%J5xucW0E=}?zys?w#UO|G6{mg!A6HFR;Av|n
zkesGw7tmIz1c$)AQw(t`JNwDkEUN)Jp5q3Hxfm)Z%qM58I>PKxTUJG<N+MM({tV*k
zVgUIqV*)y><rB$(xVEf$s#nx}A(Z?+*d1_7EbB#a7nZ=`as&ot{}dQf-O(9N@@GUu
z*fs>E6nu`+7Q#OSlJI5GghW0TEPz58oeHWuRb;1rPI~3y29IZN_68Xm(3O$q4BBz~
zCJnEx;N9&!dHJkrRX)H&G2;w12a`An>9{Y!C~t~;-G?w4%*SIu8Uv0j;YEG<OY_IS
z_0NL+e-0<y-ly3A;lJ$ufA{nL|0zE9{x1^_`+u`>_rbgE|Cr2m;7@^<g}tdi4TI!n
zLV%G1sC8QkP!DV=0PB@G+Tw2mj8%vi9zk8g<<RvRKvf`+i9OxxcAjq^>~=dVD`ot#
zW=jxQV&|~C_XN*QE9HJXjps9XQATzJk59K>>=D1JsIw88hgV&$OD8`IAjZX45NTl*
zL!;MA!0nm-g>f;cFkS-Z@L0o%lVUh=vINfY$&m&mR;`7=`27-q``ahaHN>$$J1>TZ
zZ<j#ZHOL<Xz4?O9(d#A9x`*4l8s5b3zrov;LWoiz2PRT17NLux$uzhK<9T8h3sS8G
zl%#?Rsp+s16w6MES8`X+DF?f<*N;4^T%q)eFsmEY&pYhrkM&t{{)hdb|G{l6-v65q
zTKDg#_y6XD2cP%<Pw`2g|8c@u0QeOM0C!OU_|=__)}7`(ulZo}-h<8izseB+h>fvn
z2Ok3V{V1GZAUrr8+*lBhUH(xr8vqY$oIftPDglrN`Yv<cdy*#|SWo=<70EPZx0pOL
z@Sz-?h$`J09^j362IUokb5&Hca^6&He1#%4yr_ytd`rm>hzR`td6?qar1usTJ%2$z
zUaM`<U1ytbN%Ja63Ke7hdRt}Mbkobb3gj*sv$KVWx<OBAnk8v977e8+M!r=S@^*2R
zPqRyR;;J-;SIsL;H|RVDrNic!pLo-q;Qe>k$!+Auvr(2Cj2zo;15G91=sh1vYj{oP
z#^lb<NZy2GvE6hg`yFP)zSQq3e3Rjk_U%b$x1({r_oV59=*2=MEhnPlLe53uN1daV
zJ4ccon#@;jI8$T)Dk_+!(*wS3<;3qB`4f{nc^^J2xg_Y|Q72fEj!0^y+?0RTU@p=*
zSi4TfFob&HJ;pItW#AXavgxfoJY5~jZk1A3EjEr>`IC?16fbbO(_*kmG1w)OWXZ8~
zGaac~iE6rLLBTX2L~EolVn1NZCZ)^3|DjtcWA$>?E2Bwa+)HA#TrV3nQ_dP`E*|2H
zZF7nkdywJh=*Mf59J>Jpqrk99tT>4iE+wXou_q0oa?&YnXT1|+s;-;!uC*z~fPG0w
zfW`u3@zcs0X?fT*MwsH}b6Qp5nj*_M-wHYO)--%~Qxmw}<xC4X^Ov)6h#S7vE$Sw5
zAt0c~9-OZb&l+VvoK54)Rq?<HF{Tlk@uEPYE9<N105{9WTsN%OmD!{i0;(}*tPN8;
zUOj!stlXpA9Z}NPz@K{awE_9I2#LyhL1Qs%Zv_pM*}`0<s~lQ$3S?8(w9ivnR+erS
zyKt6OAf3f2NA)!KGdn0inI0B=Cs!{nTgb|1!X|ILShmb+Py`cCW{O;>uO-=;DovDm
zu;A_6^ap+gRkmBz#DlATK1)Kf^_@q9<SUs4D{vnUJ)WIQmJaE$!hwq^udX+MSp!A4
zsNQtYb(V)N+4<TEZ&ZN@(%XUukANiMk1M%lV6EHN|4S!^zN{;nb2bUy19N9M&|m`b
z_;KdfWrn1p@CO4jtw`TO5aympX0;w)euQR=$;gi-N8AuU6kFm*tpH_m%KLBSRzlwR
z95><CfCAmoF$A$}g+$RGwM6=H)c0YDNRM%MLVF}>T6K-y!BBaR=vA|H&TtC1KEXr}
zfr;-AY+4gV?IASpCzNW$Hv54R)*=`gte~9@TKXf50_ij>1cliJbyuG^pmpnYrJLGp
zYu>%oiAN*>dWP11WaS3WZ}-f}ge}TxWcI;C(F_+?I5t>T1I2eRz?!Fr`BumzM6n9t
z@@j`VJOZHxjCzXxX7JOy^w}YXc3o{BoZkiN0Im^UuoW4LOZ_E2F#ptkuMbxJhk4k4
zlf=^*{-{v25eyXb!}jPbp2AK&CWoQ@!`+wN?fTu-ns-FUZ8$;?&Voy*yM-0K?ZF_#
zC=%ZU$q3^$G=Kf;yNxOzrR^mO>${bAyBYGIADva1q*rD3`H$6fRyrKZX+IuM@|yAa
zPfxgh=1kG5YR?5Z;(Vp$=?FvpB(4FUeKN{_;nx+92Ih<&B+#=UO0ZK)Pf@+Pl1b{V
zqPlpP`N3aZa(cojAxf@SKBV206_+_v*oILuWF&TqoJAxK3#q3OW2A!95ePcyC`AK@
z{#P^ML|}u(3Cf$B5&xO<+^8cEG&R?Af}s|DI%oIiY@lgP4v^4~TgvK-8qwmD|7!Fa
zdi1I?TAx?%v|e)z{8#hW#cG6+yTMs+=GKW+6B}cbEaZg^AoNGn@>fRILh>hmMqs$7
zm;Qu`!FFzU$qFds9%yyr^ZJOq7OEn;5jYX7(~=|dTN!=PxWd8_j|xZJk`&iG;_&sO
zg7Jn1h?4@f_$*5p(Qt}q;U@F&2)p)`Eks-WGJu>APB}P#o5p-Ai}|}5%ol5@UW6C%
ztZ?zyo5d8U-`V5P4{6kZJrF@(U^f8;DDXd`Z?7fdoN|n$g+dNzqjh3XbKo@=(Tujd
zAK}kj<y_*ubW1Hs6n&<lAHgXB+H5pJX_gxMvC)`YlSq?02|zMgUk|-`G=r6lGlO2I
zFHA8@`QZ*5YJm`xKh?&Bm$u}`z%vSjw0JtOY}aW#2r`xAV-aD7Ifo}RwtD?XJ+>bO
z8_UNAwK8M7>*SADWBc*Z=w}?;k2z!GR>O?D5Q9)kJoxENkfLjZqFM@ADlYKbEQ9zl
z<04l?^~JnPft%N@bw(VPy5?1QEmXxz&YDVIG(f<5so-H*lXAG;w27JIydTj;I6*f=
zn0DnSeD05i;$@BWAM#!^LXSH*9Y=J{fbAGqM6h+*=;{`de{93j3)|42EpOBg*IPDr
z947iByhW{hd%oq(+dtNwlCt3<QhqcjK@maiq8EX<r>h}gFZrZq(>0}eWOD@Gh%rf?
z85Vgfrsc4rqxQ0U2KGXQ7xy;sa3P)c$$e2NRub1WyY*l1ZHWHLlIoym@zj#-h-D?>
zD(yR}p06xUd{gCmA_^~~JQ`z`4%Z!fb{VJjT-KyC@xI0q>^GDl`rG%D={;NIPWb`D
zDfE<_Y_w0>PwLEBQ>RAqI{K+B7Zl~1x~g!Whvr2nZ*VT*DgKcss5&o``d2*>9Z*f_
zE#)zDAAHQ;<Z;3f69W;ER%SNIPmEjC+Y)+2rA;A5wqZ-*fmlT_RjOKJF;g=*%bvde
z(wC)wgP;8S|DD4Z-yQ8edw%j!+E`})_wZrb{{KPqv;F_4`E=*L*A4q{$PG$$^MQ2@
zFG93XqIZ~}YajtmVBL;&iq`$T6IBNHt!X@%_n~wz7{!;3k`*L`_G|%4rp`$`oL!=;
zF>cowaHJP-)Cb(_dNE21eSZ*)!+wcM#N%-=?T7xzo6M(^7!xG{L?178=H!|l;dwoo
zHA<zY0AUc|!IhImPRS0z$KY=mYvz15n{3{>b9s5$K$C%ZdUi*K&^VusM;<_UzpbF~
zQz{wbhssVBl{NS3t&L_2F@hbac`sh>)Q`d#+I|7}#njELzs60ickP`~w3<PUaR<mp
z9pPC}qpX9`wKoZ-=-(ChRH{IqqBoRinsDp3u?_or+z-jIdl2_&pJcynG^R|v3dJ5f
zmKvxXrARmas3aLg)GHF|Kte&C1%=}eIVLO`TBv+M_<9tMLurA88pK0V!lO?T)To~|
zbeRl?_&1<oP3FB(n4D7_UI5*LDTc|zhcr<&9LF7$wu8~A1Q5`MPDoPqt|nob5jW7j
zpolI>F3%-$l^#i$l!ma;K$ALrO%hX!6s1aHUzm&luy+sWjv?7Bl`yU}Cspg~X^z;&
zg}Q(fFfp?#uaa|L<<lX{6x3Un@R1tM6q`rG+8I$jo-45bsbK=eoILM%$A?c(zS%zN
zczeg*i=)G@_jWtGUU~Z%e!~Wiv9S+do_J8=X#3#gJMZwRw|(%P_uIXL-I~|=_Qg@>
z_}Du<D(&sR=<apk+1|lU_vJ2Tg?R$?Fvxay4;DKBJvsESK>@YbIYwanoui%S@N@gg
zUU%>0yISe#-pK*Ne0q4~ZF?`ak52Y>UUs*SfY6U#93FR|`CR~euy^njgT{6CI|nBX
z51NICUgvB0<sCoAu-?#CY5OH~{|Gzi>8;6oe%RgZz{4jU=o;#|xh)vgPIr56zvk_3
z?{7crP_09Na#X@%+&%A`=N){6?QO$<BxT|_b`B3tj^JkvhIw?NtA4Y045G>Q(cUp)
z<mu7jeyxP~gc^qg1nM1h7z)K9ccui2;P02m9SzXi?SR~L@C@eXz?r|FgZWe>wWh{h
zRf|&j`~UO3V;KH-A8C(SV*mH>?!CLI{r~>Mjr*VX|4;FenYN=cl}eal-H*<Kg!NR)
zH~)TP0~sL}@x1!t50vNvh`E0jU@X3Mx?UEy_~aU7|8YY<PJ%J=xPC&t!0?6B7^C1!
zLv|_z%7qt6Q3X7%+`&_jRe;hF-EqqSKnctvr7&WdL=<B=fn*FgGnyhlK$ln1a2rGj
z)WiL7i*n{keU5LY-~M7ouf`yGh&v>uEy5r|aIVD|a&SsA*wE1&Hu(~PLN!Q?S~2dZ
zz}TvERaMja%E~ORihU0Eb52<bIQCGY0=GyomRNlB$n?AyzyP5LTRC0gku|6?40UW<
zvtmrBfNWw#f{}kP>K#ffP-hQA?`g@wjEX}|%vt2}5;)e61MedAu?c+FIOi5&)0=Yr
zk$2`#dq5~q7h0m$xl9jE`+-ERq4dW?v_h%J!#ah+7inY^Tq#rx=Oc=117J~JQgQJr
z*fFGTt*HB96#E02N@+#K%)>c*aIfAA(G(3%+fktC0fuye`G|bzP0uO6@AtjKWA9ro
zsC{9y>>`1qNDqv<n~@mI;@qGus?TB%N&v9HP$>1Qh0E}sT810%u?zuOAxtPt3<wz<
z&TpMiqg`K;)F6zH0%k%H4+nF{F2!g58Ae^6jC>ORukBSpGLU~J!6vfB<T*!Qk+@C(
z-az0cFl|a8_fbfb@|esz^~6%-LQFju&VX@TMk>mJtSglPlujEUfI(Acv7h3qU?T$4
zt(vx?!t^qifwGYDsR|kp(wzAw2r2{X!TNinIm#wX)T>usqtWnQzcz&^FHG1+8Zr+r
z1OJVKTLLF(e~^=;`5byj<D4oal(|4<SgBTZlrbF+Q?AMRIZwinEBpi%-ckg)M2*J;
zH<K7?In}-g+CGcati5^#zhyOsR~VrSSL_sKFU0HZPz{O#CURb!ks1dsC6n$YAgcoM
zFAW-J4eJKBan-oqgw6swfge<F2#{z-U{#<yn2v1fT|%dVYUS6}Y9q^;;V2Z2K`!#~
z^f4Px@O)H*qcE<5nhG*rBbKmM^MYBwK~OZC@1M`3Hylt4%P`tFIv3sE!m};jN>D3?
zKd}W?V5=t_Oi3}#nL1%p44%t?&KfEdPmN;9QB2e_UjD9?^%2ZB%gKz>3Jiu_!eA;f
z@Ze1%mVWFcLnDMGo)czH?&gs^tk7Ywyg9dy9Gdz{$!)UPSbH#fDa|H+#H+wNkJ0`G
zNqs)irD~MU)*sa|nn(@G#BXG0S+o<$QE?M>6c(tVkDAAt&Z1Oj6O4;+Is;~`c)l<}
zi^m67P#E)AkLRNqV09{qWm#}=nI|^S&!Yqz;gEU;ag@f{p9$;CA{*}t6R(`i24UPd
zFH8EvYqnCWaLyurD6s=+9x(eJY>^2~)sXEMIDVjtfrZzPEbo|oztJbgKAj7b2qHj5
z9FZ}mlEK&y@n8>*Md1+L*AjT!@b+fNN~vvNr{&)u@uK|{MN>wI&_7->a(zMT0a<e}
z8fGy}f()WL;y_yBAJT8|#^4iSht6!P*p?(Wj>oicP&5eeaIUsDoQ=UXbPQ+=R}?Kj
z-hpAo^l4Xzbt%@DNT^A0L2Lx}sTpP5md;`@8xdCOBCOD)>OD;DR48dp!VxX_8HH?0
zI1aApw@84SVmMR~@%ngs(c=ukgIHW9)h;a3=`;}G2IK`yFe(ixL&v^9!OS#>GKtd*
z%u@;>p;lJcMyplY`0ytoNur1aKpF#NO_a&GQ7CrYZIDUKz4sD3a0<$FA6ce_f!7*k
zk0emOrKym{59k#4L%=*1V(Sy!2L&7RD8$*oTMK_i1PbKN8$9f=@<pN`URsibZ$gv^
z9~}d)yTJ5c4m%Tak!ZfFza$6I)lI@Y=6}RMh|sY$en4+AXEUv3EwtiL3CENyp0R&W
zrNL0Zh65rAX-n-_RAGWi>2R;c-osfOs0ej*O#T%PJ?&qB_+xhF`tHu*{)_FC)1%Jz
zF8n>|9331tSg!R=GGE!e5i^(&o#SSjD>8Gtn3y1?+$sivHpi%fKCl-x^<(?!*-__&
zJCGIY9Wl^MZ_a?%?dZyvMshX)s6O4lJ6rAnpdWwevp`)A12x$ir>qyGDGr9iupc5X
z({*`P0YcH%!uto`fg+pO<n0PQIovITnn7y7&>^%_C<{MDXHi|>2<NbsRB@nX+W6&w
zH&^=zZrf*5e=N(Hf(HxRND;ePHbWx%+^C)DN;ZRTK5&jjUIoPAa}dg9c~Z<woGoE~
z2`pGr>xN8lw8Xa$j`zGB!p+Y5x?n<OX^bfQT4KkDZ*CCT%1(wC5hOlQj_&!$EV=s7
zizn)!Maw<begDOmATCV9i8|TiQIvS0bhd}HMHx1*Tf~V;PAz7IWVizy@kXqW<_-i!
zihxQP*5@+}6wV!8O?dYQfSdzwzjJ)N{j5WMIo<Adj!vu-Gs!BXPgeq!@dKdCXP?aP
zpsHer6U#t_*EEf#^<SG0u+7$gZQYakBho*kp!LAiSaHD10pX$4l~l=7!kkl2iG^!Q
zhh;-e7y%loC>*FPn2cZy+e12WY{uH6sVO{K<EEZiOqTlO_bD|o5;-Hz)D&ZH-Kc$O
zuCB1lGkq6cp6UB<zC<^W!q@>bnkVN3BM9D<7tzB8)5FaaW58%S-*`_u+b1uNI-7u!
zIJzEVIDm9~PY!kn>kRcLWfKuReE{Ta7j=)1fktr#c;XXCLkcKW2ORzbt!SgRb`Rym
z+Bw)&rHP&}=N(G+YPs|<CutJXxd|jSbTvY0XF8}){ON29<}aDiSMRNYbHkGv32!_^
zI7`7PO(pRdR<5dz>vmIq#&Gnzs$Ew%&nkaV{)j^riGs{j=D<w3g^GG!b;PN$e=Tc2
z!uvAdFu>P10fLBO7*mywinWx0q)wauk0f&r@Vo=(+cP-9{K3}-!n7sSF_^k$+pPN}
z%XHZ4;M^MYLrdf^U7*#SsO3G2QA4(5k!NLTI;5byEcy>g3X?dBH9Kp2S_r~rHT99g
zEzN>iT1Je+UqEtYbC^+rG>JSW0WWRx@m!~h>Elu&ZbSELczPLvcs`?>FFXiw+Fn1o
zR@)2i#<L(Rcv+$z$PjfcdmG|k*T)CMKNP~@lRgX9G3*O`_8=7x9$TmspA1IVEH5C@
zQ@1(ROrn-geTPd==M%;d?8W_ngpXo|(Q4dhhH*1lni<B<;lWPl#mOe{FC#^j8J8zn
z^%@8&qfyVt)Ek@xfzB!Qae#Oald(S3MgvK4&c`e*>;bVMm&LrwxbIl-&i#RjUmE#%
z@~GLO9Ra$Gr*AyElIC2F=l+FGrH(OwvAnFXGdMj@_+rzD`<~aqB)WXrItbW+V2;v(
z>4;?8rKXgogUHG#Icj;F$Kh;0y$Y@-XrD!?SW!jyHoKm*l0+Yg^Zf5ZJIz8xE*z>^
zX!`b;Rwhy_({bgOaJ<GI{F3Yq`J2{oDLK<j5wwSfS0vb?n3ahB1n}i9bgOM-+~x#~
zbt)=KLe;56(Uimmh(!RGQ7HX;N>hBDBV*ByF^>lG@nq4WxJLp><Ngg7MHsU<!J!7t
zc+>$<`_{<83Yhi`C09uxOmXl>gH*-z5l2)DCV>fyO0ibdsS~>%tb697y;~mX^KRkA
z14!5eG<5;Niteikyh___)I{v3<IEK?xnu!~Ta4m+H$<^kdI?XRN<x-|%n=AdvSYI8
z2rW`kuZzZ$&r3>u8BB-7o5(^(i*_(#V8j4|lM#r%;7mn1F6$+qqoQ?I=QJ1svx@qh
zt^|((!hUiplCH#%E|t*dOiF!%_f2@aAQOzD1#L7RZ#tSh9XCBkn9d`ip%l}jbV?(<
z$PisU9RJEANgRl$e2TDMbRNg6RRuG{r6%EILFb#Q^EVZGc_u(s!UMNCS<0bWSUPt?
z@w0)=w0Un3=_|TsYC_tSvnsJ*W9%R|+ttrjql-TI_8)r($0ys}?ni24iT&rpdw1`p
z?LQve|7`#HNj@^uY5R{S^Ke9BAv{YhZ`AFw8D|d)&9oFS?R%``h*7QHo3jH0mLcX&
zhj-o?N}dv)M=JN0B$ld=0+6`9eg92>`$+?1%G+JR&HQB)UWo~b765?@0$aM~!-Dse
zt~m#>S4QUmI;oUAvit<;>N=iJwO*esTrtIa!`mB@#UJ^YsJh<O)m6DBF*)EnfPoq=
z2xPCAConL#1)k(dguO(V93_Pc_(1DJ|NSTly<RdPb58uLZh~PKn_uC+A1Ck!hJ8s&
zei(5KOg>ByBYQccKqqG&2^#gYdkN|ff@DVf8M1SPQ&TPBZ9Dd&#uJE<5?GfC&oNpT
zS@5#-Ls^8>={6L}nRX$irFS02m^<(iz+hrUntl#ILOQ)~!e|g*CR(0I8fHY^CE9G@
zwG|4T#$xy!b%y~Oun@uZ<0+CE9?bMSfkZMxM}L2a5>?M4nTEGL!g(d503U>s_>GQe
z!uzvPpduy$vLMDBFTfZ^qx>~MtKbl`E@8I`H21BGsZ;S8?#*gAA%ntmF6tU^*G09n
zKLQ|pRD;Jfqhc9_Nmyx0Fsh0*N&!@6a?3zrThjpAy|$ZW$qZ#%3GPh(<!Xs}-(hd(
zlqQn~qAheSlhq^xFK^m-vauJcC^3qN2oMG~sW}Tv4+lw6FR_9JmeZWw2x-2MB4&7m
z*R9awvSjhZ<h96pIHREARVep^2&>GN@isr~p$|<|%M3-lm{0~`OJFqqrQ6Ri+FTjU
z*~p2W2sC=yI5);mI?Ar6W7BaEyvc;>!4s$x_Q(c^o<L9T!2g>Js!5=bNqa~H2`By1
zDZT7bA+E^jl!a|ztnp+_cO6`J%5?!Y9FWe$S`7yw<_CRZ4SX*L!ugQ3z_am46e1<h
zh}#GSuRfpxnb3zg34L@N8V5@CLZ^6HVhjS`mgwGkIEVB3Y(B)$4P-|_WI2eV)tNZX
z(pc@`<&Ekl6w+hOJN1ltlC^COP{-peHcxiQ)04v&?bLRlX|<233L^t3hl@Ha5+5i|
zh=|~R$fm|8WSi-xxev`B`T>wZfZA3yqh>P`xdN9fc%>r#hUcC1`Il)N)$3Ht+JCvy
zb1us3+b)Q4LequG&MqLOP~sG{3;?01nP0z;w`P`yG}R#I5&@0uzwe`hP_b6NLI{Wi
zL1yqRTZM$xcwuxAli~s=lUh7vL4|RRC&rq{1I9Hwz;h9khCK{o>8pSwEXW&M&Zvkf
z<8xecA>EF$eLt^GO;NZ-vq%CUR2lMofmy?Y4VmMOLXPN!n;`a)kWY3M0cW4pwk3Tg
zw{Iv#ZycS`ttT6v4NUzYqSJcH4nik5#<@Ur`g0&5bY-L&QTD4wvSArRyd4O*Y#Qj+
z!{`Di6{Rs%R9<b+a&Qo))v75nN{OE+PZX||<ws9v)i8fpb<!l_?93BnUL;x0;&_zE
zK7y~(>lUEc;)Tb$e5I||Y7#^_C4K(RP>#uGi(B?IX1!<yb#j16yh|2tqJW^blPw2y
zlXOilwksu1dZ<;}H7x@u7&X)Z*qfD9hTX)Ugbg4BQWnBrQpeDjnEpjw9sEW00RBCr
ze@DSpqhDHC8I3_qK`P>`Eck6gRxbFJt#0ufDZKa#8KqEFw!?sjGXf!MLHKq-zyA=%
zTu$~!c!Y{P`8w#ymoSzu7!q8*#tD5<jqpQgTD>O2U8)>~&}l@6g*@7K*(iw2j!JY+
zVKln$5EW!(#f4<oLH_i0NR)Iun-9X+YaDb=SR6zSjqhP=!v%1WG<p=U3T>fq$Jr6%
zr5AJ^QC6E7u06e>g^6LpIK?bnS#z(LBi=1zP3R?YPa394Gb@x=^DH|u85AqxXkZQR
zaLR`v)o%cawph6N@NErtfHX|XoLPynXm_iGYKM2?0N$YLiZ>r4jbXzG(&%F8%-}2s
zYI++j+#_6#iVK->6HhkmCB@M7p41EQ)+)7*8%A*?8~(o!#ZkWg2Sv0yAFT~i@;tm>
zr2oNBTK{wZ;l>x<{g2jz1)qQC`kw{!Pdows`QSE|=>InE-p}NJX*C~y*8hEq4+!Wz
zI0e>wam1cMeKAWa!5gwMBkv?n5d-Zg_@z{m<P!e$>{aviKejPkq|f0!UbSAg@prAf
z2tv798ny)p?D^<_R4G%bcs?uF%9p)zwW?YfZjzyXMFa^H87lHhnaxX2s`xS0NC{S{
z{`=tO@BUe^{%2^&P*)ZvAHWEftpDcSyD9$PYQl!`dHsKi53F*UXN(CDp6MvUV%wq5
z)TI(?MxZd-RmycJo&J75kMTBG8Jyy|Dv%>ppgh&%X?PamMV+eJD2b`ssd~~@U(_4@
zLZ>43@zNX)>=Yx&ueRIT<O|PgsC>}3>}&u})<Ko>t>2exR98itlVZAUh8*CD9RE>0
z7{#V>uYyX*S_~&}%zuo>DDGvOPfZvYD;ma?yS4K1sBGS&nSC3CX}Jyv>4*)yj(ORv
zk(^`vF*yFp*s#Ro_6DCmb-D6pxrT45+)4X|SFTad%F4j1T+_qCp2CX?#z3_m!yw>s
z6&URI5q8xc^I7|+x9WQm%&hUxxE;Dz=JA~|PR?H8pV#J%JZRGc29L0``%wkcJqOW6
zrCR&x^pxD~+GjQ6d)J1-Z>uHh77|>f^z^Xfw40?~yM=!@@C*I}+YEi(DAB>C;@5h$
z{%3A~)6W9_AN0@TPa^*{Tbca7t&Pw3zn|oT3R;+F*LzAEw3SMvx^8dOSZPDy<KS(T
z6y?0&!Wzn5m~$7G>|c63pFi*RS+xG6i;uGWm#%+U_?i5lpYwlxnh&gh@;%G*`Xs~Q
zkYu=P?-K8gvSOilo;#94sJza-I6;<yn|;W_%Q8V=2s?jj*H_#6%j3>b?Zx)V^Us_6
zNBk^U|L8dLDfa)?!`6e${{OJ~dHsKi51#)n<CIr5nd18rsam;?VM)0wG^>-W4jS4@
zhitvs6sB(3!iy6Yt?b|m&zm!4`1OLX3DDBXdlC3kyn91y1g{AqzOMg!3f_8E8`b8u
zAsjOBsPt&A4t~so#%;U_YD__jiN}?By)wdB&g<~+3N#BcPK?G99>169#L&knnzniv
z9~dBAVc7bsSL4@h{HKOLS5~mP715Y-4x@pYa=x}sgHi!&aA7$FLFY!gSlAw|H%lrs
zb@-?~XR`ym%Cy6K12Bw%JjST@GYpCheZmJAFu5dgjE9vg4E;Q->O(MEjI_t=%2`Ur
z5#oqK9-A2uJ|dkRKBfwM!1OQ-GJ)XVH$;o?aZqfsMxvWpJqC*LOwCvWnPZz~YM~HK
zu6_iCWWKQ*bRg6e!8bcdt6VmsatguFb&cJKu`5JU`>`F?LJR*t>Jkc{Kk`@^rGU&I
z6;^(1|7eh+(b?80UMa+^pfhI}=kaA_T)RS=R;T(gp3J|WmGj0!aH+St_!Y_CX3Ag`
zR4S!IfFr-raahku3E*}Lxj&*csa)wkM0Ot{>;pWC)|&`!3%|lLqjeU~Ba;WB!~-lV
z4N#dzs^+(ev!>++bm>!a!_}i}1YA}1*{tvPDsu{h$svJ!V2|^FP4T`RID&@a8OR^p
zLC-()!-#-sJq88Q#tYnlS_%fGtM*UjzxSb7`DxIDfA{?<{JTAw()Vll_wVNs{X4?v
z^E3GOIGDh{hkaC#AH)~%?{3g9zb%!VNxM1!U!?z~Bi~050G7%B_wJ_S|2@3>;Pd(a
zlYD?O*?^YgW05Bw$0``H6Re62K|XuHF~%j@rO1Ch@mlCiG9RP28@{ViovJz(Y?qj0
zG>K)2O0*5Uhk|0rK2A49%&jOu2s0?r57$m>ey!KGVwzM&wbk-hl~<>?E?=)#%U|6}
z)+&v)>MvIrod1vQZ3ed8_FXmykjk5i3z|1xxz^)lnqrE7>8bf7p9SlG81^tO*@rWL
zrT4!NGxGm^c>Q_(e}WH5<RZ!s**_EwZ`fycW;y96mVh8{1E3JE5>-q3PDRJTf`#Ny
zDrWDLEPk}8VL^LsOvAu3DzgZmGFU4?*s~yAQ>HdwdHQ3PE2!S9dH#COl38gtW;q5`
zmMGd=-K;c$&QNQql$Oi}{?ge0%YPQE|BrC<%b#WI|G~YC{l~-B=k@<dKBE5<(~l85
z+)LDaisP50m40j$f>MA45tGy|QVbm}I5Y?y3CY1=`bK%Dme<OpNVuL*lrLi*()a2U
zuRhYoA>JR!XvCsHctWBzztF;IDM!XgQZh!eNXCfYfRHh&#gp2ZBWEPF@~v05>R(lE
z4c4l+UZb4x>e=z@YUkux_wdPfw^84^m8_HOQRZgiH|i9QKPK&V`Is-K@du2YlL+DW
za{4Cs49<KY(o;9Ad)c3#M=jd_eR8$%M<2=omfC-8q~!nB2LAcH{y)J77NZHnqv8!w
zoVfThm=5P7I=s%NzK&NxQC;hknBu3Z(AT8PQ-CmVqEYLWzJu-BNCIbSBNt)7c{$Vv
z>>++v+9)kw_!YaXyt6)1?93{5l~c_Aa5wtxVJ^TN;Qb{aSuK$BjD!=!re0W9{tQX4
zS$dknhdX}D9wpNTCO*gfX<|L15+`N4GD=kNUoTo4R-$^-Mzra$maR&rzisck%G0Vx
zsy*{GRMCYo+^-PE(0fW_MU60W6F54$3MRzjicw<K%3lKXa!o^p_cdENg|UR%8@1*G
z<nt>8A^Lpf{K224_J15{`-66XrTqW?{WSl-_xb+k(|ol3AI)>g90%EGw?49{!0Uwx
zdi#*nCE6Txz-({mdtkM~F<4*)-chKV0$Vv-=S^^GW$*Fh$G`+c3<Cj_)HC$5$}-l>
z7#cfvby=%9%eoHrJ~gK}G^I2_>3+4iA?iGca5!>pV#vd#e@UOu7KPT+dXsco`1O%=
zNKj-e-(eUHbom1CW7HE{Vq<QzmbR)FoWaQ!N8{KID%(a=5S>}F#i$QZ*6u=g?n_HZ
z3?x@eShvcoM#tr<Evixv5q|(2E&VXGK)C`y(4^3NgpU!!;%hFbx2EDT3AfbWB`|jg
z;wyZJU9FX0drC0Qy};mkOfUu+P#^wNEBB}HR#E9+da?Z#eircmtHH-H|5<wezkfd+
z|K-8M&-wp8%?FnJd2r>SKSj#pgQwqnL`QPP;N#&C?SePt&^?>ZgWPj>^Fj9HEkdWe
zeAC9-8^8M212(|zAkUWqXUV*WNAgMom_ljA2*Um90${Cg&2EBGx1n^kDiV6SmfCIZ
zu0ikX@^BPHm4qBh+#7>buWt2$Q#HyWv3eziC;qeEeDGH*s4nvV3Wp!%`fu6#zu#<T
z?*Ce!*Z-&akQ$HY8P~sd)#zP&yXe^eB&HZR!PI-StH1vSU2-vE>P66iuaD6bMiPDi
zocahM>A>F-+LhvdW9m=>A0&N$f|u{VpHsBHyc#NM2AU_rd6GDe;zP6&+iFRcO55GN
zuRHDX|6N|$?QHM1%m1sa9v!Mj^|Ez?F$hNfb)|~u*n`89&Zc+#-SJ6hzrNdf(K*=d
z9Guitx^c8>3NUz;KfR{7FK7?ltl@pa2Hq#|Nx5Fvwi<EL=wl@1N_D--ovxTinABY=
zxi%M=O!2$cZsoFeZn>9W(&)=JJZqo7mBz23@pE-gGJADRiKRL7IKIAu*O%rR1q-~o
zdfnb|Z%WLK&5ZkTy3^@)j~Nus#Tn(q2&c1iHtZ=U=P+Mo6@8l`3<MY_6RjG|C>YFU
zGVw2gZ(<b?-iNc=ES^+#|2Jy%rg2_xs*ZBc)r(8>0>gHVhOeOhIt&D1tzY4Yso<;Y
zHL0+EwcdQ48lp11z<9pc-<@q0XA%Q4bLeyo`7XCasC-F}Be;l17eNJ!nMt`GH*43m
z>k0fDwkeSb45Y?iYU+zNFS-uB$KHk-4nw#C2v@Z$fN&)cE)|4J1>w@V8@qB~C@9H%
zjEF$=K$l>a;UA2hXda|~PVjw>=8B7?04yy(NjEuho193K0swKyv<RK9RG{<icB?Ak
z;HAOWRh0YX<z0T+q-Pt-n$5x-z>%+$<~ly8Hysl;d!C@Ie5JD2T-K%%3CWLCp)GZi
zK4y~3P{m;CUsen~KuuKWqlr(yKOfIW7|#IH-%#LhZ#WA3Zz%q$TD?pmGM#G8@}!$N
zMyT-rMxz4w&<J|G!B`>QMwmg~R&~a$YoaWomph9t@Z4A=SwWD^7-@(u7wQA{QtYYU
zpd}737$^LbUhtYRZ}>O8Ld2OD_{+LER^7s$(W=Hc?%_<w;Kdz*u8^3yR5|zqR(Rgo
zJ~~0x<uz*?uzu9P@V_nZvV9l0=Uwk@=~;Jgw{t}0Hmq_R>2jTKUvv+5J5taBri*W=
z;`gBV)4k*8x~wU=A*I!~rh0;P?@Qe$FEL@u)9!b=_Zv04$qfsX)m!yUfx7Q8)20~T
z7|vd<&dscL_nvmt+~Le~&<!;FC1Ov^j&mL+z!0H7IfQ^~IP=nhNP#v`p5Ui2MX;uD
ztF*XmB0*;*#tz=`g_v5LHu~#2g^Z!dHq;Z@OL+2X_iOj6nRhZ_wbp&um9wvLf@=3_
z&6esbZU`XD!Lfwy0`>5q3gsA3dWDVF!&j}pFIUm5k)#)lzdco4K{02&RjF33O#^;b
z?RPbULHSmbH_Yv=hM!yQo+DQAf`FnAnU*vo(p9^FdarIF8;&a2id-qe2L}oN7yDp1
zp}~*GEu5kB?I>yaMNT5q&M0QF$>y9ySobz+t&M*t_ELXqp9SYXP9ygT?7v#~n;HAB
zhj%}p|31ZseXUYS_2MC$Ne!(73O}ec8jT#?iD+E#rN|djy!;$a39)xeVu#<N=&-jE
zw8qrFVP*8}DwE2W0&JFRr(buDj`t1^ungwj{2adHXZtKz|ES0#_nr^s088z^H}0kH
z|C$@0{Xaj+N7;X;Jv%)$`-Lu^lnkU&?)wqOQk=?#PsUp8hjOD4!eL~!Tx;=-n-yw;
zzdmbgPtcTusBsK^W=DuXFVRG*G;3!Wmr;<5;58amU6pHhtEH=Us{|)6@=r;1_lN7%
zf7h&K!TRrijJ+Q}OV|IswEy>m2cP}FKg|b^jlr1AxaK;|V#299arsvI!6*sm6clLa
zPlM<@2xnEc$LVjh>#dF2{f#>6L&+}3T$1eIUF`}LYxg&5{f+hJ2J7`!Rthg{?lv}t
zaAfJje!qgOVkLFWyJA0ix}b$&yYlNh_p59D^}DSbG&sy{P~R;7r6=iU{47}im{NAX
z^AXxu=KtNgo0k6{+`IRA{eO~=i6JkE<H?Uur2}br-Z8~Vryvkxoi9-$wsW4b6ATYQ
zhTefn1Q4*+J!aX0!c{vtLv#uUlUh%zfz(ms$gKediN$I<KLaLjXp~CNB{49Dh7Rf!
zu_l?1#~6WDWo(iv9G>5pEv>BZcjRwY7U3iwQEocS$cx~BAcEh|eU%l-<DGD2<$X9M
zYGx&nl51hPAnFcjb1yPgii33MsNLBJ9jIfr4Y^kqS)XFzu*ZXiFLC7e`=PPw;;f{A
z-#|)=f0$iZC4A(v%8N&`RVuF{>Xv2Ozp}#41_izbQ1~3rkunQpYf2vYJj;|bfbzeL
zB<VQTP}iC(D?4#?>0hrV-ZP(Rxyu?#9g=dzTS*1M#J5KOv9hx0jO=-yeN<XmSt3y5
z6-o&GHKU=Q2oe74Ac7K9#s!HsqgL({2A>2)0(1b7n}u*d-J$ZEkZ!(%-zU~~O+r^}
z(?R{(p4S`27Q~C40ryGUqWmrIxqnTc1^d5Vav$2pGWoxmjsJ4@;r-A1|EKuKwb3$u
zYWYU9M(;A7Vmb=a>RAfA@|XX9T&MpgK8yXoKS}(zX7g?~{@dNp`u|VzK}Vj2f*z{Y
zh!=p=K?%oD_{>%@7X|2T9l>$>pnb63gah@^iypPuz8u9oc07X9Hd=t|2UMxvtgiEy
zmK?`*@D!EAxjvasCm6_y0xL-utvvGZ6P>13lvmeJZ%Zo~-zoGwk`mYL{;R9ks390q
zN|<Za(Ut4=kPEJ0iS{*oBL#s1ckT8N&pYIl5R$l*@^wluIuT%G!}QG9gsEp2&|;*2
z&8!mjerbjM){|OPyQs}-2Xf64wK?cH-k!AX(KRg!Zk!{BGZ0hKHIBPZ>)HGETc|dR
zSy0Co8FaZ^D`T`7P90k-<4E970KXGp=`@b=WJGao093UE|Fi|;_>&9JgMpOzOB46!
z&(hBV{%?-WAK1n+{@>cj@c;YwKHL9(k`Ly8cxRPJX%LKNe!CgeA0Wq>#UtR&Q9rP*
ziy3HTh~ax`L%%lcX-BYryW+3+s&`t}J#thl!}D^j4}bkOh3fHo@VBQ-SAakF+il+?
zZEw4We<|Fb-%Bcfy;priU2+@^`n6u&XImBuRi@e>qO)(GVGjMZVgHfqGHZ3cPhIa<
z9j{sazK=ue<Io&aLW~~ZP2-rnV23I{Ziwn4;HBOxz{u+cr9(=*Va2bm4J*)pE81Z~
z21JCqD)xOt_52UDpzR_Ss@Jf3@twScCc8DD44kkVP|w1|yVYnuJma07uJZ6f01|y0
z|KbIGRD<>a`X8#*s%0lR&D-<ICtAfuTZ8}Auj)+~BYy~{m~GH|)vUE%m(&>H$LD?G
zFZfv$|5YieKD3Qx{QurY=KO!}bN-J{^O5ua`)D9@<G6VBz&mJ@$)~0t?~f8Cj$I2R
zDif(1$qHXI#-vMVp@uMWLQTC>h$;5ZXw@hQa5{)oST+6uRf{`~kVD#CQGKM8oIjkc
z0@n=2F>Q$B`DhkSP@xN``eCwaAAAT-Wm5CbZr<UP6{)th_1fN9MFn|Ku^n=K=~M~Y
z56AHUHdAj>_5M+Zf=Htwsygu<Y;?e(4YyXDKR!(0oY=P%r7P@M5LFJ?C{)iT93sYm
zl=%cF@W2VmV-4v_Y)OG^-oUAj@h#T4l7TccR@)|(k17!Z!K~GIY2<U`0u4%GA9*$q
z7gyC42}D7Yh{v<UOyl4B1@DqiKL1zASU*l1OZfl8=KY81``^}s&-$NF^7#c_(Nel%
z<!@(Yz5fN>!%9L-y8z#T*|~A0tewi2y?dOLze9>BI3@K&-$`)|^<mNPJl{Te*6~iB
zcf8}y$;sZqvt#c`r+fH~cXH?*zuY_VzB_z*<aG|d-a9%x*zX*iK&{*l0{qU-BhML#
zUv#%mj;R}yI7vdhV`Mc+qlB;8c;E@JE+@)139>o8von089AG6P;KM*^z=ODN=P9ot
zVq$NGmu-E#B@c&oN^#EHG(+n(ILg2-iL4YEdCAT@?%kOu(>ugQ_46lt2W{_{6{}bk
zj_i?szjv^cc`sS%b(!wolT4XW*wgR#x3g`ieDtMXFosb?=mGn<)@j%2Vo^7-f4EC{
zQ4e<TflgjMBe4P?bzg3u9vvQ@)aYAxckhUk8RM@V_=RXTbYv1t^8tp_>NY0*szDsK
zoaudX4s$>}?w4Pe>@MZuL6w8<J$JIDHzen;UJv@}WDo~Dp~-wgH`?X;q%5v3P@(h-
z%2dlavt!a4!pRw$QVFDWj&Mwci$n6g3P>`XlAeo}%^2Id{rW_Yrt@vbp82X*AA1`Q
z@88!2cDGNqGX);pyGJuB$&5KQJM~jFVdpXKPn2tJ1M8^Xz+>o$evs*k^(x&7MDj}z
z1HxH|i*f(AFz0P={05d1!aUkOAYx?{2)F1Q?0Sb!J+vR!?4scv9C`<x&MtBcVJF)M
z-<>>%mx`4<-#hlYdj}oQ;TAh+(Gi8{k8CA8hc$i{%!EB0w>>|+0=i5>ua{s7gCM}a
zBn5?(SbBa1Gu)38_yb(@lClI`;gQ~-h6ytke`b?X>Ew{tvPzPP4`}h?^q*Tq58p6<
zHGGlO*ymoOaYxbq`DB7M2}_E0@Byu1{MBT8hbDFc&1#hS3dedJ1%47VN?*6V`%vVF
z{xt5FO3=m4m0wnH^e{*K<+w_|P|;>-rB58*yL}s`a)0}`ovQcC-*7PU&6UA?Jiaci
z$PVDSm&&D*AYjvzat<h*{;IVk0Ymmrz>obC25tX@Av<qjdE38nxmVrxY=Xt2JSXW6
z<kvw;mO80!;m@UYQhmptR0sEwqB^Mo;?GivmxePZ@GXTTg2;=>YF~`Jp{|-mwdn0#
zsL?2uaC?MezajIb@(ZFG=xSL%f<p!IDx{OAhe!M74F?KU&vD}eSYle11e*>BMQ7&W
zaY_)u5Co%O7C1skqg*PnL_=&A7B22IL*Q6)d?gyRw<FGs-iJ}t0Z<TON)O<9hsPzN
z%1wkPrdrW3JcGR%xICs?hl2w=HmEQ?H70e)&`kwT#h<#ye2CbvBP{9M?zlF8d1T=O
zzh&21J)w?$PzUVB)r{vhFVhWk;<aURthuq}ne;xIEd?vdDTOO5TME{WQwrBowiFPr
zQwoVWTME{PQwrBh4lEQ*+G)O#Ew_^{x07EEd5Kewm`k=Cu4|_pE%ZG6;~F5L#}%p@
zc3DNQa3sFKb9t6-CobWBO>KW|HF!i%j;trl4(YLQM(3THE8&37J2gYXX`FXzUWB8S
zix(RjIU-@A#VHh;N2rrP=@BV><R>6+!4eOyCet9HO)X?GhD1`-Bv^q&g7IW_tuoe@
zMlLoexq&6)TU`*FSXdlp5MuWNqgegr*Q*u^JKfIqafhBC(Q~zI>HQzQvuQAaw|}I5
z*8^`gxdT#u+biE$m7l--<sJO-3;tCu-+^J=S+zUbIebbe!>G+lPT{P)n4JY=Q1Qyf
z6`pvN-h9SK4OryJA`?L400uTgcG!6F{P5trYKi}DQXzM<moT2fB}Aoz9Gn=X5FPzX
zD8-IdFbExBT(OzYn*P7KPrm-=qnZBGXPN!~{Y?D#`}ZDxj{p2gK0MQ!x1sD`N{d>B
zI-dp=h11l@;n8<g)VD41`{$TjE%A~tl7KtJspYIOPzMl@D%bc_6cUsFio!IQ5BwD8
z0bfU@t^w0KJD=4r1N>u$o7Ogq-XKWAvnb&E?BHq!%!m?<d;VlH3j2JQ-O#XcUxo7=
z2Bbm>iDX7JtxuaC)jZ;ub$`VAYSo^Ggoi>n@C|2|Ac8f}1L3JFuky_-v|jTrLJ&By
z;%eeu20cI(UW~xOdp4VF-nnymd5LGGMm#;c<23{lIXVXYISHzQ?ixExWNT3fj>h?H
zJo2b3DpOxC2qGRMh=F52y7mU)a2TL?h}irw=+7_?csxg&CYU+0_tZV`D4r*6JcTU-
z@I*Jf=51g2;mGgd0sp#if)RD-6vAaiC)tZZaQFNEAQ*?NVx!G}+D9J-nUn;(hQzpY
z_~N^xy=Tu)s9;XFVCF%}54dLteh|!{H3C2q2B5cxN1DrM6hoVXg6U8NtRe1M>!fgq
z+DxBOKS5s-it@2jQ)8RZem#$LKr}p~z@GaiiYdsBrJTT3LrNOxHA7JVrVZ$iH;!S!
zy^O-E`Y3#3sWocs?t?R-v`ZY^i&n6N-C>b}^`<sIV2n|}Y+e8uIHd4#dhBM@1B}2L
zPZ*nBMj?zB7EdoGkC1CQ2zt8#h+H$0?cm7{2AZ4ErOt7mRWtDP#mk-gQ5bs_tnea^
zW`HIXM|S+#c?=VbBPQlDBd}O>5O{y@M?pBH+<B4rWa|GR990!XkK?JcG9`2kg@c*{
z&}mY<!uY+W110n@XZ>pzdGhyv)G2+uHt3S);r&AUfB2;L|GOYAc=tbE7m7ds&iDV~
z`A7N=`|(F;W10Mi$-dM6-}gTIe|)0P-+l2PzVN*NLf`+t|KW=-Zo}XI@?ZFO<?p`u
z;{Wl#!C(09!T*0l<^LmB{0~JC|B3$l;-CJB|KR`N%fI}~zrbI7@@M+*i$DLF|KR`d
z5&i?8|NN)j-RJ+Lf&J%Q`ltv0X;(fI{{1KQ`?+0O*O-~#&+zxI^`YYb{O3PE|MNfp
z>7W1ne_@6H07XE$zqtF)|NXxoUj4T}{p)}K*WKSB^nc#nJ^a(*pZ<0CU$F)K`|y9#
z?_KqK_xZmfK>hoF{&)BHKmU2Ae_I{UzyJH6<Tro*uRs6KKjCjRy8rfPsQ+C5eh#>z
z_Wz^(`!{;{{QIBGc&WaH4}|~B#uv2zPnQ!1pI5ujCpNzS#3)ts@t+h*Wxn)pYohGm
zU;N2TB7GRX^?~;P{7?Vqpa0hv|LM>F`o-V<`F{XO{C~dq;=ldN7himZ|A)%|C;lHw
z{vS8_zbdcl1FUBN^X~xm-~F#I{&#5W{|PkrzmV?!PX7P@Mmk5z_r5T6?sVGu{L=@}
z`Jb3z|HPF0pM_$1K7S*#@LWw_?%#j@*Ig<H1Wfh*{O8{goPYk;e-gN}XWR~vIuQf^
zojv;>U+wPx%m4A`|KC6TC+IiK)EEC7{{PSa^9xw({2i*nZ}t9PzSw>KKQ{jSKWS3_
z$N%f^3Q_X;^Ka}^y#K>ty3zkAZ7j9_yqA{$9^CyL|NGN??ySMFji#CccH-A??DH*9
z2#3_^WQy8vD1?XI#7kxaI6a{sJ0BNSc{U+GhZ8Is4>h2C6f*$7&#DeQ+`=<bp7>L;
zZ<vzif`Iv6nQZ&Y+PWNI+$oiQAto!{BWyWtoIkdnmFeEQY(G#p<K<EbBZ<OUFeHrz
znhiqf(_;)T>aBIFrJqXlDr)0nIOopdNu^ue;-?|}#iMQ|Y&W+ki#+_hzFsYPKe35o
zC4Ahhs-Sq7yANy93j`M?e7#WV*1~Gl1QV!~Zzbg#mOu+zQ({X}xL5$9aFk!W3~$PL
zHF|N3diq6e+C{vtyfWr*D0`b;dFTTy1J$j)d22!dx~H@2Nr3rT2!Oz(gkQl_59Dph
zpd})ZVywEcReFoJ{xb?vTe*nC0nLIvEi@T1G*ZEe_+uKJp`j4M7YdP_G+QM#_U`E*
z#_I(ra`3X-t$x|wsCq-`1dt8TX06OY2UDo8H>;{0Onw(I0oeWhORvwL`?L7`cRrac
z2eI_CH2&wqjQuAT|IGhC!RO8$PZ<xvSJDm#K89oFOGD&=JL~KC?$IOEp~Jc;@01@u
z);4Y<R8Z>pGyVv8c`xYuXe5TvNUg4QntnpiN(K_}(?#rDES?Hj{NMia{MkQ?*Z<_B
z2!KodKU?YhzX$g|$N&2@pI>-9&nW#(-kjCN@<N9ILM!mnFECh-IOr$?0ClI2Z^@Wp
z^}l}IUPXgM{YGpF_4}jLdt+p%izpMA#+qAJ3?){RJC<$H9gt0j;nkhh5`S4>CjAqa
zc$;G(tzYFEN9)&FyJ-DNn?$Efk97gd>iDOx-=^)3?IuhiKuX__;)rfG5dS5-^*fcJ
z>PjW3Gzh2gz<SNSl>zbF^e9UQAjfUe{O$%xe;Q6u=-%|UBd>#ZrED87UonM%3I+2u
z-`Z|MzmMLQj)LFM!)cIgdZljIgFp4|FMr}Lz4huN@(3G^OFP4ne}-@Oe)*H>)?3?1
zMC`Xev-D5;Ddztl&j)B3|9{X*pZ_0jv_AX)e3DPf{|7}jnEX<SyiOX8l6Z))@5HoU
z60Z{dTf9*8@8cu){mJo({*4A?rP2-*IP3RIJ5RgY&yL$({jlZLzabxnJ+y%&3+nyv
z_;t0UzO_C0+TB%^z8Tf(9elF)1b+gH`GxgE-ow`cfE{7zJqoc{ADzQt5^tO9qX>f@
z21)5?zwJ$-#t_3A4E_0NrmX>2#l9K7W6T*}Zp1fH>j47r1eh{N%4h?JC(8be4dqr#
zC3wHNLRuBHsNSI=$$-3H{swg|-CtJ71e;kT4j4O+VQ;8mKIw9(EeeYNWqB3$z{VZF
z5zl96hRuy{>TWb*)s%SxaA7{GB+A7L+Wch&O*+Y<6zA&rq-xpeuhgYgb|1jz&7*p-
z>bILPVm1p;j}`qJ`gTjIUZ#~2V-R4}O>f8&l65zJb*tBIt)^a&1n+jabQySM#VM$I
z00x~&@%tih#dS)`_u-e7qkR}74X7VeOwei2So78zvB8zHs9X`^T1-2ieD^En|1@_W
zrH!TX|Gmup@7;~h{Qr}DNdL>r6ixtaVm%FNqMZ#TaI2*WW`~I+jLt@ES<Gr$38xRl
z1HexEj*`}&gpIy)gr~s4?jug#oO%|gAI!&-)FWJ{sYhq&2czIB^<*53Q%~X^+PtM7
zPOzs*>Z!0-_aWu2$~>b;Ebc>&z?yoN?#(>P8R|v4)E`1ZP>yoME!TrhEc<lO%RUR^
zoM%y(#tViT$QF!om(4s(vd;i7*@uW1ewfk-!IQuAD*4;}6!ZU&X9K>B|37SI@_)DP
zeUAU~Nj@j%Xq_qU>enj3d%~IgB+NUjg4s9~1HQkE$e5Ipz`_IE5gHAY_G=tA7E{EY
zdFK+PUEJd*^B!7e4r09gX_QKPLl3Qv#p;v&QHFjvs-fS`>NGHJ<)~?%<A!76QS05Q
zL?+C(>l~V^&O8=49Tzvh4?7!LfRC;l<kpJ9`P2C*bJv;K;ToltUFCue0$W)u-3P%q
z21rVMzEY$-m(H&mrT3~-3;Q6nZ*%*76g8p3H(@l0FBA4~S0>@fCX5@cd=W<%SQhJ6
zv13!r!`Zv0t5^KH?@!;%6YtqHoc;gVd(-Z=jbvf?ezned{sW?%*rY?PUXoar<|>lx
zXs#{!k>pI~X7cbrBq$*!0R{lIWXA7re{1Uv8$pTkl7us{NT9pAySlo%y1JIMckVqu
z<1hamPJ-oZav28EGDxO=wk3TSV{FMP#UB*7NS9B25c!WuMdW%ZlK+sm_+yw({GoT8
zP5NQ%Eg$TipxrKojCqs9qj9zf9X*;vUYM~C5$7?B$3rv<#xViA`Il~LnT}65IonmY
z(E#pcEP?7UCu2mB%Oi<ghfx{u0r}_0mytbv05CUw`m_WMz6zsvSd(tHtz(prca<sK
zfGaY@cN7jN?oV*8IXVGuV7}d+0+MT#MSebBoh1G^#id3Og%G8^p$}}i5GUP+%K&mv
zZ?gWY`M>GoZF$U8{ZGOE<D18;tAFwT5Al(NyM`VyN7i}Jd)J60vGg`@&_c2U6`JXR
zs`>y{O%hMe(7_-H&L;4X(*jU73xv}GZV<^ciaZ%&h6+qa5Vx5nQ*PVd`6PM=pa*#1
zJ`J!W?g5+u?3#VdV+EV{2H4NSKB{kwX$cHl<sl0)wEOR{1xv@{++p+=-N!dQKA6-O
zQ@}<UMaQyIm~~&a7ce$gW{0#|@VF%9ZBO0e9e5?dxJKD>x2ti_x!EOzr4H1L4j@)C
z>OQxRU2Q$;c#Fr2RwS}M$ER7QN|<hOXVGd%Wmm)4SyrYu551Jy5|;~hVy9C-N57~6
zsUBd4XKX-XmqD#d3`Mqxleb76;NLrorlzNo$?>e=oLNMtlYu-~Twabim7KTkCcQ57
zYSTm87L)CsGs5ZN@KYXm`KarLOrxMN7KS1NDfU?f`cZJy7^HtZLrhK5K26PCum5WP
zZ#Kr;wlU5A|4||T+c%G%{$>CFK|ZAaIZ=}QX)ug0l?$8_tx4eUwQfjxm`j`^l@bb8
z06@x%MJ-bGbUakSz`smU?G8pg1mQFZ&|e>2y&gUJN*x8VIKv>ps7eKZ|AfN;>;YsW
zh@t*YIamdXV%}*Op{J=io`_F>2hI+G*qlh*4^qbhxYpqSK%?TH&lvz(#bRQymUQ48
zD&!nD67*+7H$!(^U$hqpZ!rZ!!hGEFM)}n#lNS_uTX|8CaEDlIdmL6V%>WoiC1fQO
zjYw^A*bPLzKJsuNvLT47m^A%7o(%gOUJ7Re@dB_)B-CZ>ZH96DvyS%p!{MHSbdH0O
zz)u`hOCouZ;7ia@9VMV(Qb{=#!#s-G@8EFv?dvy);4hsgj&6`5c^w|@E#y^m=VjWp
z^Ma-eZ8`zQe)q-OgB_202HpRui~1?gHSQ!U&9?_{kN0-Tr0>056V4<sw1-gPpIuSI
zJGDFB|Lz}p4}b4?uTLlF6YD+1za0u%mZ4WOJV7f+r<vc$cv5~~dHXk&#^2b^c#@tE
zL$r(?l2IdfLCqfQ47wz5CS;SSb_g_Zr15+i4gjwT&qdXti!HRe1c-0DG>>Mu54~4v
zT!fZ~9*h&;{sTivC*Ea;5dDzOg&hKei)`!+-5Kho{R3;+zq#%PcHUcar^vI+F258T
z)DmoA|EFT>OLX-f0G8y-$7Zsh@Tb=Pix1?tZeyzd-;+Z8=k>L<zxMwR@%is07<sqT
z?fjnw0<z07XE3CpD0ytn;s(7aQvf}4)jytsx3A*YP)5EdYs>xNup?h#Go-J}!BxPX
z1+>A#FA1xqfV5CNNy5{K#B$#CFJRkv?MIWur+TkZlljIU4%`1{0qVdZfsQf!)qDNV
zox|5}_FwI7_J$rv#KZV3_Eui+dMk(P-pW57c`H3{Ww*O?bkaTE+j)Dm*F8Aw?(V%g
z+S}Pa+0#H??H~NlChph@hJN$<WD`z;`sx2!;5c9ZXW=W|^jFXVZk^x1-G8;)-9GN_
zzIx>iA1*_oelR2~fY=}x&ZoapRcw&zz4BJ#N%l-55Gzt4V8Fo@#tqW1mSIxEL6Bzu
z@BaWp{R;c`mA9lGmX!0B0Q7j0fd~f@RWC5DY^+Zo0AB3aeU)y~99m=I$#(mTWv2Jm
zDOJ{2Ea3JNvC7U11?<u#7=2ThY4n5d(6~gbzpCpo_(9#nvvI25%0(A_mzyy9F4t$d
zITXAwahFV9uNgLaQ_<05eBh|58TeNfC$e0IHTAK%)nA`^e~SD6ufYh|VLZnG5I2bb
z@O16zU-2J4#HVKd`}3lK+2{Z1BaHw4*Zkl8XUhDmAIn#x;c^(=tc_av|1qrf$2tG6
z^|eRqf64zJ<n#P*FtaKW+vbC{<<$pX5cOib=-hnp_T<IVw-5fdwLryyOs<DPdLDr2
zik_gGi&=1$tz4zU#RZk3{5%N;n~M@A2`K0kQ?|2^F^H41U^xo16^Q_cHCH4iE&5N4
z{j(s|l@Khp{Kf9!&dERD?0Eng3MSXyo44P;+TZaOmsVB|w~zOaS5|gUcH#Wd`yT3f
zKfQkC{rGtK@yg2Hf$7(x6}c()Q=obDGL=YP)Zhw?a0Tnh@2lm0)?f5~Uif8eVd1%I
zd<!7zA9&5OMNK@<!fY69y+ut9o-X|1^A&!?ug6K;pY$@+18u1_^?b#C%H;$z2-r*F
zA)r{MW^wDkRlTk}`tRo}R&fEq(Woe$_m&J^o^5GdJg02G)au{;G>)FHm<Og%I!Wls
z-i05f&sWq>Q(z3;h@;ctBstyMrY2xS)-%=oirv2YrF)2jaIuN##Tzk=5`N9-{QKVP
z?N_f3cT6=K%|JvK@i3Z<wjMoSF+Wr@3M#_H!Surm(@0;uV4$aFhTP}6Y;GRa6Mp{%
zhGz9iy-klj@`g<50uuwup0QO49k&BH<Mx+5?+|s|;eZd$mq8L}RI}mBb(+D6mfLJS
zYUdNuUn)&-sv^FkzI+Tc1}7S{O>}!--got@SNoP?+IL4d{_rfSDn&1Yezz7BjK1zQ
z1_Z2n$0N9^gk1mns{VCa|GGb=_LTQg{c9XqFB?vIjo&eW%ITDHr`J=;082sZ)wD}T
z-zg<0DT)f+H2gh3F-uFPhJ<C@lGvFlOrr-hgJxy~ipf^px~2q8)l)0hTBQgUQy;E*
zVSjT`qDL$`?Dy6F_ea}D|ID#oKk>K7%xy%B+2aL$3JXN7V6VtqVLiUi#RMd9ayK@h
zz?eQq2z)+4-44B;BtyOXY1s+4yhY6}(5MS-x}L94wXJ2~n%G4(WE!I$@O2cAVYf1z
ziidXm&x6A^u=Tk^MO>;Hn*G`jiN)%>g8Rd4<2kYl=2AmHO`-E-!G=#wm(5Vlaj)PC
zTldeP`bq)3YFCD`ZtWP-cNGC-`^~=7f8E_NUPYjUVV=vIelXago1cfz72#-3rXTQE
zENWM$NZ$AmNw=HH12iYwVq!MG<+}rcftK{_20iZGy2qUAY+9c`?x^vy$c#C^XEYr<
z<L;r=?{Rj^fm07~<NUPom#3QCetL7_`Ao;JMTOZ&XP%VvL56Hb%+k+Y4!5GSdLvq&
z&dv|wXeqrDmVR~DJl%#s+{zRufAtSa-Lnq)<52g<M49Tb#?aO0hqEGt;3`Y}&kF77
zherEHS(|3O{Xf}w(+@u2KL9U^{`gy#E6{5tMbiP>=5zK@2L8@6>H@9B!~XaN#FhgA
zhuWE-6uJ=wmpAE#3juoZ!DrCYBYohhESU-D#%(8agprG;Pv+e5D0;Tpa9G~|+tCpt
z;IB3HVb)Y`^DI-S&a{nMoo_w7L^IrO@3d`?z^bcyi0@LtpKGWrL*oK=tFz8U?=&9!
zzfERZ;1zr#9%mnRb1u_e&$dqIc(}d^Rka?<5Jo|o`e#A=7P8qKC-N4vh-J5)(?geB
z>Cy8GKe2Be&^!70ih8(VROZ}>tDJC^(nhiF>eAi&guaP^=iVvo?j7$O?Y}wMKRj@i
z?F9`<jdpv%9yGdd<Vmw-PpI)klY5dNwE>h1i{9yVru;S0STXd6P@*q4F3TQyjVO41
zftQZ`9y#et&L_N?VYkVaKS2Bcah!4>K#B4UtOXNq#Zg;)t>Xk^0y4CiUHWkX@w-G+
zQFB#;gWfDS;67vPwfb;rKJ9pc-#c%NKlI}cqO<H=FqQ-<25rJP2K^wS2)AAq3pngI
zy4cjuCa2Ycfh1=W$!k^YPRRfs)^)d|os<MtaMcTleAz!Mvu9gfyTK@eE6jZtVum}L
zO0wAdJxJ8J2o+5x&Q<D{PoPxS)7XrNrN`-{cdiHILIThaQV*?hJ-^?_ysw-ha0K%e
zj)y@hnoCvR9Z7+X?kA~@InH-TPcHo7M0J4I0*9Tr_Nw;;O+vtIQ?ux%bw@i-OS(fu
z$2#6MqOC`U@e+m@h7P_cfaJTU@(^xfd}c&!JZLe0l^uXNE6foV-)b_w&W*$8I=l0n
z1%UN^aPD7(m=#l@A3Y_|!L5(R8+F4M4`4r{SQck^FMfmJG?+KJDXCznDlMnMIrdb!
zUyhRihBrxv*G2w;CN~Kt;X_}FVt;ewkLzP9HSp{xei{Q_qAb->VZ>S>2{7X`b-V9P
z#t4|Qi2_yd#NaQG^l2T#xx*S3Hn49B&`3jBK}knq*to6Yk>R?qRgU9?uvgYKnSW^N
z?HGyxS@)o89lM}Go#wH1sFPfn?6L3b-B$)qJ<P2<o5?dPqYfR!8GG!i>8dA^k$>%t
z;)}o;qh6660m7Ri?tB!N!DJ2<7d~Q^*lJYA9R=9_U<x9hlYHn$*%mrKBKwk`9gBpU
z68|YK-@w|<VXF0hK1C{nMNfuU<DkcRIgy&0tVf*6s>R5*VFmtIvFN5Ow^NLy)YqV#
zG^&G1hPg(~Y|7H8MZVc#s-_@{J<jmr#XXFux@^nl1<AZZXr6M1SS>eSIcV(^iJ?)c
zt45{LMy2}AV3iib)m|tXm6SAAQ<NB%Gr$%ZazP_(WKi05bB_K@*ov{lV?`v0c+()c
z;!}tic9G{|4A4)6onB=VTw0o641)_G7i5sIp`V7?WtdW!mR5=E@*j~<+5kI9d;zc4
zsC1Gdr>exQ!jlIvVCoXs(lc|+RDn3q$=*5I!V7%H7R7i1WV_Ozy02b#w_okQJXp->
zSpa{dEwd2v#akBMht7Ro+l6Bm4^TP6TyWoGufi;VwutJthZGT|j2+XQVYDk04)K7&
zf|3I+lf2rF<Wwdxw${iV4F7ZcQ#mXpNFsrdbzLusO<V}r1HwM=v0`s3A!0xARAWT$
zu<uk)Py$d4=J|@ol%v+NC$`y)&obSGx&Gv*x}vKXgTt{gcIUb<F_svdUB=~;?f_E+
zP?+>O(Cf=N49<C~|99``u;EN&(OGA3UmvOSQly&FEY=ZItOGZHlt8@CL~xc6GxJ2C
z@kL(1&?OliXyE)n^6WUl^GN0bb84}G%4geCG+o8GDW^epNm<~dEQW&^$rqVKQpwKa
zv}Eb}WD)DA4eZgF5r`E#lSk;%seg(gUpiG73R72uHUIT~va`MO!(Kx&;KKHb&wBG)
z@^4cXwX<`KQNJXjWe=tqCd6xH^tWw^oci3QW+f0&7T!7<F}Ig0;tm~ZNnAJ$bnq>i
zmL6sD=zABT&t}cqs#$#~=u8Bd<bEx)@518NbGZTAa-O3H20zBBi{82TmUmNj5BumM
z7_1tiMiMfV;@)AfG;e|u66qcs9?V8mRAW|(kuVDr&PPy7HYjdI!~8aJ0}{9T2r^eA
zX!)^`l37tP3c4=sIr+mze&pjxpNGLg0F{`^VJSwaXYPebZ!$vgJq(U%!?Q>VWL(6T
zsxPtyMUkzOl-=$rso9?=D(^s$IodneZYs!N**g+s6jy`oBJv&P#S9Ar?llrTT<&o0
zBXjVA!GMBf!Jdc7A=Tl-0f_EX*4Bb7jWqDspBNKruy%qDFp+hnmj-j3s+u)b%QY4^
z%F#M?f`bm)lJ0G!TY6qN=QPkvl%1kWu3kKiUe-a+pyYLx>spm1;6$P2=y~NdXT%p*
z>+0xR8{F$S8l=^d^;fG&t;G*?7gda<+H21xj&fy<QtCIoo~l5mjYicG7nw$5XKC}4
zOyFPBN!sU7+aw*J4zN$LdITOtr&H1JK7olTQ`yXAVqi&*hj_y{j~R01be@YshYD)A
zf<-Xj97IbfV|R#=WxyE5nUSnf>xVt&f#>hA+@bL4U#(|H2T(V>uZt)sbX4gC6fWQx
zfgyi^Ximdnn9=b^F%`uDpsNIj>a@}}@AtH4W3a+B7!LF;Y(ydAQH`m`sy6;ALYzW^
z1qJ7-quoS!gPS6(7F7Zco#?FAkN5v~uY1ycz5SEbjajbj%9ND$y3ll~RdX(NHeM)A
zI#Z_PtWka6T;c7ix&>T`!n+9q>pLA<`+1;~Bch(Ae$;FP(145RuWGGa@+B2~<!56*
zRY?_!yp3kk$3Bu`b`<`uSPYJm!s$;&B5#Dzc#`QGF#}Gsd3|MCK_DGb72q6P<pJAQ
ziwquPy26?r#}P%*=Sw1WRb^c$)@#1?^w!gSlc}!NtXslQ6gvdk@lFA6Vdjm41f7FZ
zbE2TpV(8b2IOY2`VjGHG<y%O}Rjtk8Q5NM00KzMEoIOm?3An~6>oawONUmeyyOc$8
zz=DA1JS8iXz@-UH5*;UsiquUnIve9SS1?w)y666g@`R`(Do`;_;)}44a<G6<e(fZF
z4U|C={7PaJ{4<p%!d2vA;CLTnI}C^BD47OXCUJV<yg)om4@#7AuprNZgrv8gbtxkN
zfDFU9zmx`84e?xKk!_B$*7-#3Y?jH34~+)FQko@`9&*vXhmgqhY6E)A62|i@VAZO!
zQVj_rySn_Mhs7v#3<iuDfpnDx&%VkQSKyEoNRB;CW&OA}F)=M-J|AIU^ff(>9XEf!
z&w8Fo&|#iv#9=t@73n2!(oFod532*ua%@y)sWY|B53fcA&l0#%B4$%DI$qXWK5y`;
zldiq6v(xTXsnN=}fP!P-?L#;V0yol%UosZ1M2egdnC+HgC~s}eLwCnnS}SK^ogZxV
zK-3224EBagSGzIP8Y-EU>|OfTCdPFVj42Ka(K#%I_}yg88GL-qao<zdkVes<Y7DPE
z*d~)}vkT-*Mf6JOkOBmb`6(;`TFvy%9EE|3ew)Nuu=ScWV6;y6O#lk-dpO@cU*RHN
z>ow-`wC`~d*V?|s>K@wRlsYT8J0@GND6YgdESUaDj5=sTX^8bskxcTA9VXQjDP|Hp
zgqCpmhb7(|Y(53t(Y?c(S}QHH8X~(({Ds?g93h8MN8YHOlZx!aViYf{rXwK!JxNiB
zfL>`MTP59<tg_M(sT;p^B+{YMY3Wf_Z4n&tLyy=5<VV>d<sD#*d6Zy}13J@WCh(Lt
z)lZe)A>_qE3m5kcCU0zE2z^BuFy<Ff!lHQ7zJ0sIQ|q;Y<+Ejiz77u+LaZwZz2lHV
zEnPkhqvdcJr2^|h!g{y9%o0QHQlhPBwJ4$Dz;z$_Sn3afYfxk*#y$6zx8sBY_A78a
zwZq^n1Tmb{g|Wd7XIs!&)QsVRhmpe0V1h~e7oC+II-h^>^Um(}$@b3+lSq=>L@+>@
z#BgIlTpxg1et!Im{t1-R@tA@(78c-NZ_^VKQL5VBSWp6xLMJ_6?0EMD_I-kZ{JZ0=
zLiq&-2Y?>y%7z)(ld{T_LLC4&Tn`{1y|h9Au)5)e-g6!VeEs@sj4ppqx(*M?VFOyc
zhof4@+%7QCd(J3SDFA!V;c(O@H`(!8Yzf=GuZkCkb#LV%MzY5AcbvwK4sNRa^769x
zaAo2BFTbF-gELcG`JJkur7wC0b<q)K(Wq<7l)KehTN_e^+)5IG7BnZL5#IY^HSBXQ
zHCKIxsVI*lmsdlBr+!Z@JtG&3Y(X2iDPQJc!kOiGi?S^4>Ki5nOkv#O1LKTYt-8U~
zvD8@<I&!szC!g{WQmPWZLpq;~{AdY<P^EMj!Ept*7PW={U2oK(@mx?BA$US3hZm6N
zG0TE6da3b}lJq7W!w#8gqe%b@A2l7eVpO?NsxTnpuW8Jo5Er-petdY~vBaSRRLLcb
zbudJ6LospOdis{Q0mWbH(~*%~h+jsSA5t42_a}*Aaluv4n^@pI;3JttZ5Nv_a<yQj
zo@wm5s8ooV1);T8vNa^<<<wUN+2~=F%^ocp)INapo??D7BtTyHMcNZ|0D}1xjoHMM
zeGlLNrjmt*BLAsIw7vif`%yq9-J)t{o4u{2CE(FOzDvYNp0CJb=c?A7Bu)}JNksi4
zlQB}0p`Y~46Jibg!&gr=>CnhbTd+mqti!1}!TVp@Lomk-%u{?#79#d@ggn+$E_aO@
zZygk7=qP>>46ip-A5IP7n2rtgLr26Zb_`RGu#SiH7uGD{W_HTbY+w8{lmn6$$V<9&
zWw%`3CK`B-CYio5HI35!K4v;Pi^v*BuL55GDF$jIN1w9@1d}praHbzJ8z2<~2;pe|
zPx=8&0Ba8r#edGXr=&UnO~&}@=nm^2^B+Y$rO}6#!}&BxF?GsL7-VCDX{B&7F&R@t
zJ!UtM#B4HF-vY}LwCRb^b@!}26WXdau2ZFEb3A{FTUeF<k7X2(C_W9u|G)_BmTHVu
zd46iCUwI9>S4Jn5YQ^c})}AO@uZb)<Oh=-{TH+h9dYk$U4`$?CuRl4;@bS72<TFJ2
zAnu&S@i4C+Lu7KSM<nCzNMW-drafSFe$+DtYMJf6Q`C0LIgEZNE~ysr^$ggNTv}``
zqPhdyT7=_4cE_YmPD`hjniB1b5*(}>kabDwMwz;zs<w<T3H+!%Q!})NJ9C{<Pu?Ev
zAG|Dyb9oq{n&I+XutsrxX^ZyAih?f*$#mLvW6?MzSV;^!aTJILi&kD*rhh4^h15RA
zj#?yV;Gq%Kc4&_PTMmJ9OvDR(4xe$dv?Y}Gl1a1#C#IZVg<0jiXIu42`KEU?-1(Py
zrkB`hSY8=t5rN=(@sYu$o5j?tcS1G*g_pC2K-jr5Nyk9H?u8c7>h<U}#&p<}6o!JF
zGNgPoPAG^)7PlxRlLX=9e&{%y<{CyRA#~4z=psyF(yd#=f~S5WhCtn&!-E&kSNKs!
z+gh1q%Y7|xW}G&(kA73M8w`U1B@If#vvcxGG%f?~MpKVS#S@9$bJn|sJYNfQ&ZWHU
z0IPkHpm6Y<SX1=IgC_0Df>#~|<d>%iJP~RYC6yomCp01wAqS_}bo*KdlZDYYAV&g7
zB1nB7*`tD&2QCZ4tCjXkE)s4;I@;l+nkMvu^#{n~Fl`Yzd1GIc;jt%2VFDFK7iyO(
zS;E_qW(Tqk$pE~EIi)Q96dr@ghn&hjV|<T&U}wxsPgHh!<Yn)I>zw8Wx`bZemcB@9
zivZ%Xe+rv~r6s~=4-1+hWuoe}iWeTYzV1+1AZX5|M_UwS!Ih8uNe2g!;c;q<y8R6E
z+IAw=uRL4BzVcg~8bhZv^68_dXT^~dVV2`gTF$|dr$tDHB^<}1_*3)GX2>8L1inZ|
zsn^2MtqfpG3ECaLMv#J{YSRU^t<$$1Z*7$n1#3?`vSA|)(6wDK2(Q}AAg_UPZGee?
zDI`c>7;b$qX1yo7JAD^Kh9Gr!=>6AkUhTc!J2=_K$PwPb;mO`{SzPMG?}rG34}*HE
zl|D|CKL2?SXIbSS$i>7@Pm_1k;^D8`@$jFoIN(SoIHhYZb;He?1<_ojlT$J#@L7sW
z@eohu0hl}h)s7TTnp_o7Z0zA8q$#FXSWHGSNc=O6HMv+z&?viydgfsW#~oiend$pu
zk;ru%i~Yd|zzBuJQ1{ldY0DWz=!L`aci7Lth)ARpI0ZVJ-bvti<6Cu7Gw-`ZMTc!o
z)Ygwod8`E*b`>+XedHT>w}TEz+tDu<4~tWwRVB=za4<X$G9c?udI6nM35wh>D-O*E
zP?&$&-Iyv7-V!{)+c8`WL<XtSkzK~gJ6<$&$xq7TBsfF2R=R&hh$Oy(OfEKYVonmF
z^DLjbdvThj%Vv{fS%GhPKmfT4Nbj*E*37UNF=o3gr@q5Zc+6~1FDpn!s!#A}h%D!n
zAzs1p#z|AE4Mc%Kr@0QOg)Lh?b%Qh&e4ubvIu8ZOL;A}42|Q?t9R;2gS;!326z{Ij
z!iykxm8C`#p-K^J5E)paCOpuKb8<=w-H`nW&_`5i>l1fB82A#|g_6mJ?*hIm1>O#a
zSRR;I`1o|HLMarA^e2HK9;KhK3PP8Dh%b>xcJNS49`*h^IeG+9YSk_uU^t*FQFHBV
zY|klY^JpURY*6c0)KO>+VA&Gck2Hyp4#r&_1#TuhP>B^qXA{v!n>9r}L`|7>r)g0e
zUA7DVjC$vAHW3RoT5+Q|&FrDbp`WCO32C}nPeo>NDP}DKN>j$U#h5K9RBD$wvDs2|
zn<`43pk7zA(%cTkCw`xO=J1|P&y^_mNIFgeBn`{mKn_f_l590r*^Io_UT?sDFoX{|
zPJ5?G3^Er=Ju%xE5*GIO8!aEcij<-AHJ~-4+VY$7&CuPIuqbV9MRS$rCX2BEOabtd
z`E+M9U|yQ&G5<CRd+$h@{MLSqowB=~T{1Mp$yuC`sZkH)bS0r<r=AH@(OOdgx&v%D
zJe$N5x!6_>XwH>{<ouKZ2emG)$*MyX|31##*)R~)>64PHnKhHdIpEKO5JqzuDTI4?
z<t3I}qq4a>w!25;SFTIY2g-1i()9&&lx7c`!XLy+%(>D>k9gP@X^TJ&s2&u1xA46<
z&H<{*ip#^?o{Od8h!e*HX`cH-CWGH5zz#v0YJFQODf<bmtSlf~uQq{7nB<w!=#VQ>
z0PoVw@degq2qgyQ)j^5+@dPL?AC!p3CmuSCSECxGb8R4a&Xc)}ufvvHeK)iavwuw5
zk`%!qc@q&(k0huGUk>v$kX&k%T`rGMONJ6HUC~WHtlst2uh@17wJ8&h#>GY&67o~E
zj+~8%$bQHGlfbp>px)!LJ9XD}$GUQ`p)eIIwib^n0oW0B5Q@`9#-ZcjEjFI!67|i=
z(eD0>7dfl-($l}O#pWwYAa>+is6e9K_bjjl4^cg!Vg|(mZ6?S<n3m6M3oX9kx{fD6
zs>~5#5R*hC1j`m2#-vA-PB4HCV~H3wkOAQ4+~@mNS_%j=DchV3`UsX<A+`@b8*pp5
zG-<fIisH$<GQ1g8xX!i~omFW>>(%s~oGz_2B8oXmG;^>?NvsiP6AP&<`G)BBk)aQf
zVxHo*Nh=9uCdYG=yi~;$CfA9FWu4f5v)@to-8y27OQP|B&y+w@Jb5@r#oHY}a%`ww
z7UwbwRx<{@^GKXj`Mx6x@EqWaV?VseW4kOE5fnw=evd4ieDAv@^n7u9LSWXODnA+|
zmh%KPIzButDerx!eeYiaXbL#kmpUpyW0r&$j1w~M3;L;XcEYVOM#)NeLlP|M%N39g
zGX90<T1IGYTd<7Z5m_Xa3m3<^fh`~bmJlfBjrS0IDpCTwzH=g)qE)B(rX+~Wr@Qlq
zI3Xle7{4dtUpZ;ejIz^km?X&HP+1}&crWx6AlpRgg>l$X4ou`8tOaNCvlr<Z);XN>
z$RZ9kiA*6y<r<0L%i%J^>Ym5(yEJdfwv6FfLi8DOiWQC8xYI%kbSgJ<J`kH~KcwBx
zgk2C!lb9~<H2Q8qIDc-K>U=<#xfLvG8~E=C8+z>hPxw7;JE?><Q>3hf6P#A>>Ek63
zhb;Yy9G&c~4Q7<KY!NLv4jW8rdXC~7n!BJ9*5H<G$)qyp1T9n2o)B~RDq390Z(fuh
z*Si`GpM`m7C=QGO3LwQ;a!DvytIPR_RvC$hAkGfc&BaHH^d%T?F0L)Y0=ty2x-`Cp
z%>qkB)LIY9(Ppu^h_^7%<LaX8x+q=L)Ruiz1vbNTyX9~Uopc<NSv#{M^MRKKd9QVT
zatvEO5JOD?GSV#gH(TuiD(%iZ&rak1^|Y>$OpKV_T>N&C1^4Pc3~T!L^S8g$cdrsT
zYfo#SqD1~^z2iOpwgW4m<9)l@@xFs+YisauZT-fLK3cDB6k1vP4q8}Whc?%rJiTc%
zPaoGb^JpEKdGsx`@EC{pWNrP%C|v)xrk$scp`CA@LKEK->Q>hu-?Sk>MIGMOaeCIC
zJi=DKA^fdAzVQ?RK5E*6o*?#CzkyaBJs~8nes|+}T0<UO)7le!4;09MzTrRL;-4F1
za!QM9tK7)iy8L~7i`J}FzV>8s>lN<b)ooAh+SA(%{P7g%>oV~5$MW}E{`+YCHm!a;
zrPasM>SJl`iM0OoHfY~sOw}<>Y4$sztTjE|>$jq=N7Ls}(bsp<;<`rolUvR2(`gg@
zNX;;?K0&(1`r54~S&&xG3S|jDl_tN{sP|sqVl_XRHq*!(r6J&t^6eXq{M$4xSewEu
z1?Sihb4<bgZCWOr)w0dk%r;*$+kDMz^EQZ{(ju_U*TObm3)|$sPjA!e<0-AKORMYB
z+WNPG=3C9{w^LeuEUiA4)}9ESpWbRtmzS5T+bnz8oJikHC(<`eq<fl3-!PHx-G)f_
zrV!~K6X_lk>GY;R(za!5_(`W0xv*WKQ_(b2iK2mwV<&+YM>{94yo2r6d&h6KclJt?
zcUvw}>`qAsKJ6VIxqg;-%@D|qhIqIzw5A67%bxcmTX<cMr7dG`D3?29Jdl&kJ)22}
ziKpB_R?zQ+6-}9+O_a_$h)~DfSDxS6tS7lNMm(0aPqI|{c*!X(3Q_acsl;&v#N_&P
z5)S*W1;0mO&jhy}<z??jc(t?5K7s-3T&&KU#<ViRGD6CC2+RDMD-%ZjP{K+@+O9`C
z+R0^&o;73mL&_df(yo#Q2Jgxz<FPUdVim6n+uuhM>=Dt2a$9!Hk4>CS@}I#79!iNq
z?hwo3!DcirmW7z$sqa;)XZ~$Pu<VQ{AcuDPLC?SL^wadc0n{mCE00n1P}ey}+&FHq
za5#?Jad+EwAJ0X0X493x<FFQT+e-lPl7dzX>+#S<O!+S7jsH!}4RkAE_w#x6e|PWr
z<mm99d%HEGFdZdWQ#)%MM`SLQ9fE2hwOyGeS;#?6gOC)LWLMnO$(&Y@iDJ^g-I|oT
z*ao?R(sh++C39h{a~`2pzMx++H}n9F`v))gU;MNC!``bmdq=ISw)f>#@ijg#DZ7w!
z1YKUVsuXFi?JX`7T`w{vvm>Sb?`nIa%v+L5pP;b-aaNxqKIzMn67^^>j(g{pK9qh}
z+HC3@q!`!ykZB$Er6fqnf&l%!eTsS8zlJ#td$wDRtNSaBtXFXEya*DE1Y`wY<iLye
zKCJpGWpnI=Kds7?SawLp(oMqJ!`-Iy;TezEAq5ewjFvs=lX8ixj6#@qQmsUY%vS?+
z<Yuynj0rIAr;oc?Eg~*&fQbEpik3mXE9{#ZMjb^dY$!xF5Xe)Aq%^RsEC@xV%O5+Y
zh?Qwa1EByLXp$m9`C-FFYyhXSCQ03Zs8?jh!FF&MpJ8ByWW`;No$p~2B{t?qD&D2o
zp|In=8sZ#g8m%PG=vJu9jWn9|LajOqKr7+7&;A}cKd$scz7*8=`=)1P&ZlvQ`^P`d
zt*FUp3r{8+Xt8G1QeK&4yPt4a5emXR!s%|61!(Zf>MLiAD7Gv*T$8b#H*Ztk!_l$O
zkQMEBZK4&1l}sXu0>Sr}EF1#B{xBcuxo{)J41Nox7*gGfjkvPlQl6!V8!x>KGcwZB
z;Nroc5<4uS5rXp2j9DLLqBFBtXI%<Qp<wLV(6CfDV8U=IpXxvxl%1mpEykaEdW3-b
za;516Ty{Y4kwMj8_Kt%})Uya$SR>2OartWB4OWz{4#3T^bBBz0s_a$u1g-l^R=8vR
zKSRs;lp{grSYxtpfZ}odi`_izTS+gr7vT^%9-738eImP};f)>zXPX0q8~In=!VuF&
zT&}!o9joK87jtKJuf>|)u#QSLCmyKbaA=s5W@Kt=^sd?S;RHrrd^H4Ag+Ygkrr}C6
z9uw-BQesTTbC_d37cY}g*o{wzAtga;G{@ytZ?&D>M5-%z^;3tItPUyvesnI@`V1pF
zu#<6#nqYqD?FXlmvssWz6+S*Hr5mLPbR#5qcZ<M5Xqg!_z#o?X_~_$ae0=N;{ok*<
z=<YEK3U#HAk4Nmv5_jd}uVu?$bry6wZmu8c0K5l#U>~)a3N`FoyJV<Rd7(RQn)p#M
zcrg6-wGR0+-QV{kP87(SGtCf||M;}dz4-V%1N+e(hNow}-mFNJY9A4oax@`iE~(zw
zIJJ{@<?;Jr@H&Yu!>F0cptR<vL8(hte?I<-rz71gD3t(E9~+aoI8=AI=%-<Df_^x`
zEGXm}A0LORA0MA{UhzIS3lgQu$H$`X$VWt@6|<oM21}wjd?4g)W2;MXv~=kw7^=u)
z9QKuFwJ!+)Nll6_o*I%=U|rzA&-|gI_yZx#lEK{4=nczp2Q1!7fjVl`5QHC*Sc{0u
z$)rl%V5`@$TkU0v>g8wwwdV)nr%ppDQ&i#rFSDuClaFeh;3En5hj-U$L0x7x8>N~&
zz1AwWg3MZe#<idn1cO`{K<JGXiIN>-ga)jJmo0*t+tO%${HU7d54}jjh>~P1xrP{}
zOU95LEgh+uTNdu(`HM0?0m@XK)7|WR+?Y1)N+0cDyd&4;`u0%gpwSn_@Pwj`Vi<eA
z(9qD%CuibT+B*5+O<RTh<6AZDPF}~P`7S~gUEFeiYv(3UM-(L=_*_^~PsIlyqYCox
zw`xqXSO;k%)2t}=ptmaY*HGedjC_-5^)xsO$;qydMn@c7PY;LV2PEi@1i*ShLUDA4
z!9}3fqfnU!7wQ<nY7wXo%}HoT0_;O$%H!f6oFi(HfZK=FPnSX$VS*tLbRZF+A-t!;
z`>KhRl9*#p@|7sYjAUOzT;iwK#Pn?WtUe;mB&v!@BdBT=mj=Dab*7yLM9!lQ`ijWa
zZ%gdZS9E=RH%!}xQRS}3YPhL|oE&N`KKd>~zd5?grc^Wfg}O#FQ9rCmC%Dr<s~Cxn
zTv@TpKePMZFW###np|~qHWTL*4-^d&-yv^CxB6VCEU#97h*2Z5^N|W1IY|SH^#`MH
z2|5EkL4^PK+QSG6=P||vU~gj%6k|A-jv-4?1~@g{2PF|nct*bL6in#RI=MO$s_fjd
z7&}O<i;{^$JUdm(DZo-W1j<o&i~)kt0zhJZa8^Eag_eAgY(N`aokL#<S99JQ`)M=9
zgp~bgJ0Y|U?c6A^)(j-kc7h8hK`-bB6miDTg5m*~#N|eTwPvAE(;L~lv@N2w?#Pu{
ztfF;{v~bXDDa`|G4WhGAPsxM$S=DB%gO!hy5c489A<Ipd_+c7gR6DEGMj`51c`J^z
zs`~5-29`ijXy((!>qg~>HDcz?J9OyDhWw)tl(NV}R0fr~^N*svg$h8%@-sz;QCZJ5
z6cse&N^DfMtyJXNFx#Z#hIP@PTpKa6HpW<~?ETNNQ+1RiC^09|6NsfZo^+|Njpxa(
z^wAjp8$cG|LGlQU;(oyKt=P^}I0bdIaNJNC{4i7(9WFVH+92>ToRTs{=EH_-xrb*8
z<)=_Gb1EtuPXB3W+0NmyjLAvNmpNt_Sw6*)LkBn}iub_wpUH%yYwB1J=4doNzqUrF
zN99OeNJ5Mubi05WDG3wMh#M@BTD*+C^Xsu?Sd{A;MGe9JVWgeFz;={?a6D5A4>)0Q
zJT4tO!~rMfVOpfI+m=AXeQJYE&PK7MoMgL2vgORP{o<Y>JVnA{5K7f#V5FhA7xHHA
zm``y?d5mD<_cUwO0(|9eP&gjWnV;UwaCeHqU)8d`n=|B8o86*jO#}NrAc34Bn#L6P
z697?Yq9Je?6&14=qJtMfp?kZ$A*%*Q(I@SBr5H)vL@)8vb7aANsDTC?N?)bDghc3i
zVJVx@MtjI1+a*;Yr+KkiOU*H}WOhrY%^WtBBZRn2m?f{&jFCQw7VR^w<A*tRh<0sG
zO0}CCVKy-?tRmY6=9u#l4@xYgwH>Bqe`&NxgM5tdStcAMy}(j@?($sG&SIrR98cz9
zKTBshIKp0c$&$P~n&AlORI9a{y`!1hHi7*(=siZshB*mYR!>c$Wtt&zNAop2+*sg&
zXt!uQ5(5c$HH>^|>y0W)+uB2NC+vHza2aG2=)^^kWGedS@4sJ@R~af~%$O`UmHq|v
z+|FB1uFmGC^~QGA+x@Zo;%INr^3Jm>m1JTg3avg(==e^YG|~*AN8#Z08Ny7YB#S0B
zAfBLhEmYdxz<x?Oj6!lGz{sA&wgby=Lvwq0kFL5|5LsD3tZ0Hd`W2^kB)>t5Wo1Aq
z2}lJ_$0+mCCP*&IbB9BBo=DV1712}Ney|?~AkVE6C>7=Ovr!!Oee`MU;jS`CE<`>e
z6KLknLDc66s2bYuK@u}aRG3ouP=UZVNCR(GX{FF%vV=$}$3?z(;b;`}LtipLp)@I^
zU(&$Rn%W$gaM8QWQezsq$EpT2zP9Sg0>coQ)w`UWit_9wp8&LqkL2AG+{6dPme3of
zwkgX6xM`b?rq|ts?eq!tSKGAm%X(FOS>F>M-DZ19I99BTc?wa(yteXOUz={>6{GlE
z_W}#C4fX=7bhEvH7-_q}HeXw<`iWWEQ`u)JcOVHRu)tvCbqtJ3VFVSsz_5NJKZ;aV
z9ZnpCaY3Ot1^KlCsNyHVTt4F54adrn4)dGeKR8YB$JyxGt{bP>CUCqF1=iR8ZR`a0
z8SMc!aegLyKqU(-eSfPxpuQ<<5157XPTK?K!+eKlT?rkEM<Vtc?GD1`MrKt2Zt2u^
z6MjsZ8{}-bNSH54=yu6upp|Q^k!lTN%V-ZxLe_<`v~{`}x*~K^4?4LZX}Hpg#n;6L
zv4t*;80{6kUTHUIyZH$POj$O=+~uz1;gq->I)W?!;85RAPdJLXgbO!>Y+~Tr5w#`v
zgd4^jQ*&?#aEy<eOpLVL3M4|qkZ&HNI9hTWM}v%46cFCzxa39*edjX&NNC@fvwU&3
zP#0)UD@Ks*jqj-%5~d1CX@jvR5THJN?6uba-_!P-7LJu|yYX7F>U?nfiky496(EKB
zLwPhZz;>9q#%7{0>y!jIsL45QX4=XzD!HNkOr_AF=IDIt8v?7hO3Sdyt<BO@uj>7r
zi>cYGX0yw=q^Ec}_u|oMD2X{#u=jY9jVGBA>@CdSATM*?;0?K+hIg*QTx;zn1t~`@
zqSiyQ$e#<SuPg|yOu-&a9U6v(Lsr#OzLvz~pr#O4oWz@RC}frSMQu94h5llap!9^`
zIu^<C+`ADqY`ZLhs#{TMa;?lcu6|YV;z*C*a1@=Ao9(-_)d&s*192cN8`RczQc_Yn
z3R2tAW)g)MZpG&$MzlIxY>tvwKnTA+LuQnaxlDW+HS2^~h?IoNoGS`5;Nyi!TjiS?
z&?MNsmo%Al%dK4Z31$zbe8XT+5&+|6dPs?-GESXKHb1u65NEXY{IFj#W!8b@A{fSF
zxultH@HBrmFFas&UZ3L*Rl4Ony2(5gg*^otu}(SMDf3%=8QYY=)3<|G#Ix~!wU2<P
zz<Y;*be<4dH{-e0?6xGpJst@1SARoe6pb<9%Ns2YM)CTl<CQ)bf$azKr1OHo0MD|@
zjCtN;woOR{(Un(+bG9h`brLo6nO24GjQBn8=X&?@UmCBIze7JUK{MX#v5SfX^wGw}
z<N>5^ektJqrYkTvW2l_5;`~_|z+^`<>6A?&`<7V^Z}rN5Vg_5*nL!c+mW2{Ux6{pO
zfVIuq%{}qUn=@VGrqDvyG)qY_%pmzjuxilO)@mXla=@#?;4t5-Y35gJVr)Q~=?9W=
z-HL^!cN@COM2CSh+F0;H82iI_??#DXZAVdX=Hto3z%%<ySqIBZEE~HnR6CJ1a9t>w
zl)JldMZHnuHIIeoe!`jKTK`{Ef+><J_fOO3p7||wZ?%vL9X}*o<s?&*uFf%*4%z4Q
z0+W{vyMiKRiQHG3UdS<Dtj+txLak)NVnv~h$La5-s}t6PZ@&BtFQ8@Ec=?rydDfiI
zgUn~}^fkpl2&v~hd7Bgawv`zwp>!+SG_2X7TeW;kbJCJ^X3ejy%(**peikQWtNaI<
z;JlOZ3^S~}3F8U;87#@Ft!HfJcE$3YNhr)DlE?r==t&}$sgdJ}VM5{o<nhqIw(hk0
zp??;|s8|Btk&-hM)G#+H$0xgcM@QWk`>*y64(;H+$QxK0Vc+~HMG;y?CNU;Rf-bd8
zX5Xo_I~O;`He)WAhSzpq3{stPl`X~CxDjaiG{8%<IO*u%cEZolhb113QGY@=9M;Zl
zGN?NNfRz>{jVB2uR__PT%ut%e1-9btc$?m$(A+bWAr`A6^Wx`&9l0}#RMvQja`6wY
zPdzD5e+<WL>QB3D^*P}}O(IgA8&Y&<9Vb;VU&VP0mX@Q+FiQ#d%%N9%8|w7F<vkR4
z$dS9M^Y?lw>W4`%RS6trm*$Q9T6Hg%xH+%Pw`rO(E%!~P<v{N7+z`+BagN8svn~%F
zZ<uliWanMA0#?Y@zE%^hQy7utp$%^x8aKYdcO+EjhSrecD+XO8{5!T*w9>-jRhnF(
zwOOr<#2UH=-enoX1HEAIqBuk4Gl;??Ox=s8TF&@f$c9Vwo=6r|mFqsUZhf#;Ne*07
zhgBu{Y1Q>%@;R3f-Wjbunb)P!EFRz=)A9SnxO0;mx8=pnt`Nt{?Q4;Jt{06su^3^p
z`$d|QMZxPLXJpiBIXLo@ll2S^MxxtN?P-4mUZbh)fo{62k}hMu^1N1L1baCR!7-1h
zHUs(L?aRG4+b^q3K{nLDEu|c08YWd>Y3CZYdvG|lWh-Q^!J6R5OabS2M>9l_^v;6R
zK8!wdRQyizTv}_a%EUQClv=kTv$*pYgCR5sd7w1B*3CkM?x`W~HZ;TRgTa>&lN1v&
z;DLLJ(MCmL)!Ia=9gCMaJH_d>go}rMuyRJ{rxhbAKgrZ}e}1YYk191eFUPB<LH<<X
z4|2kBg7`H*-n`}oi?zch8XGPc<QKf{OOCb$VRqe20HFwTY>tp4S?f(B;RB9n(ALrb
z)h1Yrdb83G%#X$*5jCCqNM%Kt$a>kRU+B3{u2OVxql$8yj3!4jVW~G6l_LpWH0q1C
za~i;62GN+bLENW6@+Po`eg-@dpStje6_`@58}-kU7`*^`K!v}U6Bc3JC5e^5_vJ``
zUVkzgQ*_WKm^;JLWtgKEH|g1Vcy_*YiNP}J`er9|mc?g#k?3v=!l-~h^P*AzsARqe
zFp+QMiP%D*r3f61VI1V^WbcxMNO*~v6SjU0n4hTMo_tZ3K**NMTp%@oajrfYPm-A!
zT{RaO_w$J}iIZfwxp<ys<7X=?co<(ki{rClunYiK#w%xdUdn)VrYnnE=7&*j_&rP>
z{(NP^*N2u(qe1_9;E%h4u`bW<;?@s)+i$!#M~A3H(coSj9=+Z^u|2r3uEsXkg`FMN
zlrp@U<6Z-O3<hEIBaBt&gWe6^a0hw;D5U&n+-1cxH65oC)9zfCu>Jf4WzZ~Pf>qF9
z5XH35H-q7egBW;avLW{Z7Qtv+3X|zY)G$g_WWe!SBN9N!UdxTV;t$i<7~u{B|D9p2
znE6d@rtRF7a&dIe2Z9^D9`%EH(wEwPXQ8kB#{B6?HgB{@BN6}#HG%$a-KhAU4hEs2
zshx5ZphO?05*df(e2_vprpu6`y^u|K!Jf!rt_Asuh4}`XSIM?eG*@8cv@x8PCCc+0
zb=V9mi_b9rfawUH=_9cK7uz6XI!Lx<*2MwI|24fuu*(H8&U#vzKCCj(Qc3W*Inq4q
zOO#DD-Vn}4|Hb;B@><yE8&G|4MebHHlal?Wd_s#atA!IdN=CsYa8#9-$)t8VIoH>>
zPM1o{n<a^N1jt*_+>?&k+NezvtV%*!OQ&UX@6v4D?B>U*==j4CaQ=kST(wzxcA1-Q
zbB+YNeF31)0(}B-m7vOHpv2ad2Zw<?QjCv*S|aj_!kc|^Z7M&h?z09xALl}!)^tDm
z0jt_mBmIT_0L?l%m?3Zex{wVF1@8$<hX4q@0M2nSxk7-P#dLc>N0N)1w58u^Xy4CE
zZ)%?{XOjS&Q|G70^p2F!l{@b870(J%1kA|<T{<vhSWdCQGGj%2<<f=T@lZ#JnJU8H
zEC&h<3_zFsI$v&@#fjK&kjhF$rX}|bVPxoaO_!b2f9Gb)b(^NXAZrXqAd|pL(anou
zMv+<ZFlu2$u%LoHvl<w?Lu44FHCDl9n0LkHjDBH8K3CK{lyJJwh1HF0Jzb7UXJvLL
z>|HhSEn^|oxN48dAKi<PU|}KoeK`4?2Fj<Qhm+-+XxVI-C@M&prgT!_i#RM?YNDlM
z28WuU_bxU1ik!nNbcR9jJ3Im9oHprr=x3-hFF8J;mmnXn$W@SjhJF1#4Su8VA$b$3
zUwFW?PFzMm%}KMJOw0zjoqRi0$B3c6gK>31H99MG=%0SHFV_kIF2C1HveQ77R=TQN
zRx<LXwf4L%!ffr_EPGE*Z};i#J;!2?qNQ9)Oc@Vq<<h*G(mX6)mWUqi(zbd~0;fzd
zdFnZAgVhzhOVPQHVu!^UbWq}+=Joo)RWAtosnWiXU81_k{TQK%Y<1}@1d~&wetHCh
z;qN|@qaGPnAz`pyi)Y>_V#&^o+~SFZ?uz#g?uOrf2tI2f=uLH~(-yt?g?0mnI?IvH
zMpczV-E>DfOUTSS)XnHfry=DX>Sl4IGknbi>L_uf`xqPumAbPrAgu8z^Pg9antIwT
z@Z{riE6MOKO9xSFn~P?Fiu`Dazv?7!?lxUX>{g0bCvi>grqBmkz5X3>>f9OeecXpW
zSBd_vdCXY5!mWe*-XxjwON`8uX!~9_`ls@aC7Vd!O++9)*LO$88Hiy>N<PPp<dj@;
z&nb0$T1F+seMDKjSYQe<N}RV-6^ZQ*-Y+OG7k%qQoY!%T;i$s>KsiHN2BCrs<^BRF
z9{9arjs&FqQf49|RjHPcptnyS&*?<&I`ubahA)NMSTwc*N7A_(<!8$+DR-_js85u3
zkK__M50}RYxJ-aC_!K*GgDsql^fgujmc7HGG=>-K<3yqY(G-KcqRfN2F*H}6SQnF=
zCusge(CqM5sMUlF=5#fE8$$45vIxIwCh$LwzM_m8*t4VY8NaxQ8Z4D5*ADQ1>*ks?
zE$ZT0sQ{6JVdr#Xo4TIZ0Ptan+uHnS#`0mEg=nm5e+1@Xd-DEi*@uOMnHY#&@6XOc
zoaNML(fl#k2)i{b%XwrL>Tzq{>O^)EaW)qz%3bXbQt?C*9lf|ES?d`MpF=noVSKRR
zBt0(|15r&MJF#>1vAE8J+{F;VFA|mgwj@-@9QDJc-I;l!a~&;CGm?1SG%wx6$KwUI
zS~9!!PC6Rgi6ge7TNU3X`;=u8U2L?U8U=Y!o&w}0kY>rGhau}Ncb@9=QVHoDqGFGX
z;X1hkga#M|07_CVaOANLCOGNYR&wJY31hr8vLbJKXMS?(pV@cfLyYG~XJxd^OZ7da
z@_|!pAa@dyTx&QYTLtc`Y7{~X2J=IFiCb<*wQRQ-rk=SCIV}yHrEbkA&Xj~*QkGvF
z&r4;d;NYO~*uuJii_TUwD;ABZ<l#f5nDXYLps*os$GLzM)`>RI=CcVY69<^6WaLMf
zu#5;@l86BRo*%EJTL{$1&a(P+rFmPRdX}ceUZrKsc#i5Z*u__r4nhZQzF=+m4C)Aq
zVqCnEK|<Y*%sTGH<7;IXO)aohtGyG5k(9(gLjpqcZYgIk&k+zBr#tlg0f`{xOB$_H
zh5?DFmJI@KLt;8Eu;W1vf(lx8YQq|bV&H%wEQ9emtbdpq^0)2iTV(B<tNnRcK9$rL
zmf#tQ`?{|#kMSBxI%L)s_1Fn;hrYg+V(vm|1B-*eHYhL%O%rq+qtyo+z}2vqeiT59
zmR8&EuTTM{9yhLbk^xXUHw*^>-LwtEQOLtfbMBG$1S<=XC>$<jDxfh(|H1i5LN>V{
z5_RCh!6Y{cj>F*+K&dEE_TsY$RYkTgu~t<Zre|=LIKQ>7)(MMJ-{9%cj~ZoDt7~x1
z%x(sI=sJVQIf;~W<YJO@Sf?B|=549TQl)~!ih0tMlPPY@k>zk@8BANggc1^KK9<89
z92^VRilOWv*X>+)X-Sf4o$B~t=%3xWAG*j?%&eOclwISaq|@7>rYS)F6`wYy$gR$D
z=W{FtW$&YkVi2lG^b)95d^uI%!*Zf{z5VLd;m%Lplb!9IANCd<w_W><9dkbG<)X)1
z4!!v^Z!d`{h1``sPDyYS>zaTEX$Np|GN3uqC~zkKj99Zd(UaAab$jD^dl-2_BbDGg
zdz^~+36+?~M_LLd2YlQ}HVWDt+A{#Dlf)JkDN+Pqh{N83G5{v*?Wc1+q0M|WYj`GW
zLffShU$b+WJI_-iC!FN-=pjylx)X`*fs=8~1nr0voPqMr4%@~)0*!RWnVNL1H=rvd
z@|!PSB<bVR9nb^F$FR#>&q5JW<ujoPhvA_|5KG{O-<e<xxEqndq?mVjg9#qZ)fDMO
z4s)D^(i_PJQ<2Z7P<m&11DWO~dk`v3m5@?$dHW!>W31bjqV@$TCu%Xb#(3jvzXx$T
z)*4xrJ}MZ;z4K~SjO~LGp^i-qVt7aUZGx6{cE{n^b7l$PR<C<8G?<R#NLf+2d)&^+
ztM2yE-of^97k)XxysCyPX4@EUY977;ItdeI)VL7^QOysodplv34ktKSVlQRMgp$wq
zwo;bqM@PNz^hhXmnu>QK5i!Dnd5;!Kz8$i>*;J|=HAzfnH+(MT{#lyaTt7LKlu8Z5
z0nt>tS53t%DNG3$Qkh+=`0_>>T;c|~vYIArQQ0u(N7jVE8<92D{NQB$hSCc8<*DOp
zXx3Io*3fQan!SUa3ix2q%>6Py6;$(sPsJ_^PlQpGtVXt_;0m#1hkldurp2-gDkmq>
zzf6&JG*SML=-ODHmPws6^XZuKr%4r69ZgrQY}mQ6Xc=)u?i{R9u`O#4Q&%X(;w6+t
zJ*FLnL4|jq3(nsrA>RXV_%U0*pDJ_qz_^R#_2_}oqEqxUAjw~yybEThS86o5BeS#w
z%D!u^`(tx)x41)2m3!}og1KFTGD`9}g{t!tLUf=~F$a7!GTI+Mt@AR@E&ZkoJij%x
zc*zho1?F(Z2VTA$v#v(dc83Kri&W@Z-(H+34w4@o5jS1*;NhDJ<1NkA^j&^;@A%~C
z@Sl6T7T@d``)#FZx6HQt7VdSpud-_eHCZqC7{P|!)u+sx@dYRIOA_?1dqW##gaz_X
z<g3O|a<EfaTijbr1WQ*qw^WQ(L*wggn054pMIHB)0lEgQQ_NNs+neLsPn#tzDXjZ+
zJ~>Nna^6+0Nn@DV0JE->UlR1l@fJ)?FwfW<jr?)R>i@8!@|3KsG!?E0n-+yiPTr<2
zYs|S!LN3meG-l7j-88Fhkzks*vEGDMcH}%U4w5BVpH1?zT6)M_e%2f1=+@v$YMH#O
z`RuEtZ51y!=M3+L4`N}&u%?nW{KV+|ctM=|c+)VkJ#T25g1*WAN3n%<>Q4IzS|P-9
zVhaa%Zjw$3cC@r6stpBFS@*OXtde=0`Dl5|%?^eru)_S#Z~fdLb8*v*pnsh8(=4xX
ze*M_B?rQyv+}y`^wSHU#-2M8QU+(X_UO#MN)ICe$%Ptuo-0*;%gL2ETF*jL6PDpH+
zKkSTHPyq#?haoJEmKbjgg9|)>J4Rt84qjY6H-G%FNiwjuG0dhLb+*dZ0j`z7o7^#?
z<S+i!V*O+8ZsNoisHP-wn-X3(H+i+uc8wlqKca(r*qaRfgyPd#aenRaxhR$gm<W4(
zex2eyQr=aV5`=qeFDVQ&FUqzuA=Gxo7{FZ25J>7bgU3c5*k>`aI#TiWoz!bl%my`c
zTrVz8Z?II#(Oq06cDbq6>2q+IlPTmY>XDjFlN8id61vj7VBVBfnw6eE<{W?nD^Gk(
z5t+<dVO^L?o18!M6%G!QbV9c&r`Kd8U|Y{kqIVH`4=Y%5X_ExwA?!$fC&MYyGulOk
zy`Uo|n*$8(bZUi7v52tjIP+oDZ?1O*-QMEPrp6d2;Tb2iN0A_xAY}>9FvHNSP#K0b
zl`X)dWWrS{8eZ7;qPC`1T~X4sD50ZmI2A^>a^hgpWGU?EIN>k?+THyj9>Glk8J1BF
z+P81EJp-n6p)?pkS$IsFL}A9)>v+>j$+L4g!7ckg;Rg$5aWqTaf=dwii{~uP)cu)l
zEU>~OU+Uir_v8unq?_Hl_mIAA=ofwSrk{Vsx;S|EP`;XX7(O@5s2YE@tLc{y)pzrj
zWIC$H--iD0*VS)<@L?61_ml&j-qSbpg0yG!g1&7mysyt|qtdy6OjW}Bg!37Tb#3IB
zYPvM^!X7kAQ;aet8{(c)%%gsI5%z_D1jG0e7=aFhFp)@XmMyg*dsJ@_YgEfZnQSUa
zl%jj4lx1FN8;u#M28bCC0<zMCc`(`PIy$cq*|?%s2Ln5C+972hWYMpNr|s4=oyx|}
z<c1;z@V*QmpgC$PLlMLB{9;4ShT0qv?*TbG!@!RwV-Lf2jK*Y#p7#8{FdMs1oOg)_
zW;0MG8ZAV_6C^VA+f5l?x(}61hFS4pAmc$d2bQid=?&lj03e*63_!LYsBK9O-oU?z
z$?J}CMVeYIL|i<8p70yYq%*v3TTt){!`j5m3uR_wVMZBkS+Oxdjzl}K3H#w(E6tK~
zDj~+J>DjsZKX~h?y*j*+lfwe0?K9x*OPkZ{Vs0@fED0q!wB~?1zz3p^W7TF>BHDGT
z>z#g>KnHkdCT?wZa%TI=JHj!^1Q8fX5l*6^iFFrHI#FX5ZC^B`CEOcHBfXB|aT=za
zH5gb;78BpF1txq0{Ci9Baf&qd(0HY_Tn6o?7*>^SfMiLC4-4X&u`zTdJ}b${imqJ>
zQaWcUM8Rbj4ur`pK=`m_=QhD7w}Svvbr#{$oCORT06C-K1f{nCz`SM_5Xv~r84S`?
z7j}kefS3RbUGZ;Cb+(*MlK9ZSh6T8#C3E?m+w``hoM;wW+5IR3EwFAS$y&z^Ynv2e
zRof)~ON@Uqj>$C_m#3`!)bTNOyHZXaCP<)cT`FK?L}~Sg1Jbl04$GjGB9{bOV}{71
zc)*zgP~nkaf33r`Z#+OSGTIb6q$r1%0bVPl1-5Ecewe2}#4!p8ba8AOXUY5ktHUbR
zbpRQ)SP+W@IUT0C^->}Mu;jNmb3u{_H`L^yCb4oOaJmLNA8x9(V|H9H>W4CkMsc64
z>vG1fb=0H3(oVsaXYPD*R4~ie&pOIao9hbjV-SiGd*{n8W4xV3_eivXme8llN#2(f
zWzZ-lB^E~q%twI-B{=>Mn$b_lMs>XI^qi3j0VOG(-<*Gz-O98HsDp3RG!B@u9Ygsd
z)kqUItI;0kif^d1{j_E*=3^Z<D_ivx$s1f5ZX*Fk^%}8dIR7+_hZB@x0_2oFS-JU=
zvW(e`N~T4}LIy%2ljRSkT&8QFn95=@An6%Xt?4q;%H57AC?dJ4jaa(}5J9YDnj<xp
zlLAaM75VVeN~2Y?QE<Wm+ZbbtZqU64t-W~8>!npF_ApU;)HzCIw96L-vi_$jk$re+
zjPa8ff+%*wXDtWmpGF{ZPM5QZMExq6$k>LZ?7GA&Dx(8vRL18Ed@Z-@7q+~roPwn@
zwW5y9hS!n#Ig1SajvdoGCvQ!iypD6+8>YN-m}Sh&*@QkTh#9!sXy1PB5yhax9M|pz
zq&-#adgNYYs7#Ng7CkvN9Ull&kvENIgsrv^R~#l+QjR)46yi29NrR5PMHnyn>X>Qz
zrYNrjne%D0gtsZp-e1h^&&1q}RoslcO_59Sz!#xyfZP|O_ZF8-?HHUnjyH|dH4^ea
z8IGr&c8yqc?F1a~DdaC{D%rACuX=Tz;#_aolT;THr(omT+>%#^#JO`3O5Fqe>A6f1
zLOd9d{qSvI41?$_JO9iXmElja)6T}46p0l$lR7rB0wr%5V5_1q4T>1*AX^Ee5;1Kq
zOv|4_0j&7yxQw%}vtrdv{B4wD<wBbl)-;@{N91NlV<W*;9+4Xyjg78l>Jhoo(b!!1
z$Psxa2^ECL$zT9Iwx!A<$w}v~#YEt@2_~?)`-5!o7a#tM4>#w-ie6?G5-WMJdX<s`
zMwOA43QvLjm~uYWv*fv)oGnJugf+V?xvc7kWX&cVn<Z{av=D_nK6e@xt+EhS?78fR
zW=X@?vNpV($EjWHLBt207^6CVn_ku)vuz#fCvwcL;JjkZ@)z6vi|tNlyF@HA@?0UX
zBEw~`Jxd01BMAsook45%=j6X=a>K?$<&#8q#m<Ee*$*+Fb=iu9Ansp;X<!G3T3%ju
zD9`$8IiT(S*nM%dx95b8G9_&W)3){k6m@~@v?Y`s%hTM~I{SsD3--Oxz;a}gV3J#p
z_hp2dQAj`xJ1B}$%8W!VlVXjPQ@Q34sl6$N+}pqkw_500MMg00liCCD+_y9cS^I*~
zDxm{9wb(V8ttm4i+Sx2Ir0EVP22Hp^sn2)6p@{k8UmHp(gswja7^i<}kL_KFC~n4G
zNvO22D{)jvlF6uudmpA@HBz|L?keakZ`LzfV)TFYdx0_e@9-)QlQhd2_!Q|Vua!}3
ziQVGLs-KqaT(&d9?3(M(=dvzmWL3Ch18OId5;P`s;82lz(e)vWI8H6_aK;%$FC_PS
zOYDz_AAsG8QTZpxZs)@4W`a@PjhVRRUmUjy$K^O6vvFJ@)H;q!MbaWCG<>Z>)t%#p
zCA`-y;T$q5K%VA7R_V`kB`FFD1|KCxaW=tV+dPmzErU&S92U=hfQ4SBj&kX&tkyDP
z;2>_~KCQW}SqHcCY)qFU{@dKAQCImm;fKX#p8Pv;OEMXhTrYv!W9FtII`TC?W@G_n
zLRcGNz?|Xokp^xQp~GCA<s%Ku5TT<}i1THFSx&u<uZm*PG=fUr^0CzS@edPCBfW7j
zjeN~NGNqTr(wI)^4Pt5BhSDqJO*D;lGABy^OyXXo%fC(hD4UFCA#tg4%g7ct+3Wr<
zx6Doob3*|V<1FLH@*iRFZ?t>H+(yn(wYww#YL@YvS|0%mD!7S69G6I&6zZfm^wT*?
zJJD$v%_aq6g^wZw9+;$=n1oUzV=n0@)#%P=#>e?bL&!-km#C8)P2tE~Nz5Bp&;sm5
z*v2gQ!dhm7V)fxiTVF&(CQB1~X5YaYV?;$sa5fWVxtOBr(=wYrTE7EinRUlemB@46
zONajH+-V75c5g{g3dBdCs)Jls-}$2{8j9j!CJv=4eG*KHoiXo*d&@v?z?D?ZPna{2
zD#~Eb<?Hjq;S5=+DgqfzC9Y0s+?P9ud9|01*96DAD7ch!PCUsd3^W;p(*3m+xural
zlL~A>>Q(1TO=TjnL!-I(R+0mY@53*hsLAtN0MP8DS>9}?#tkM9?<D3wWBZ5?C;kWJ
zGUwnvk?jkM@qAFhn#FTKA0?J!@u|xh<GOenZ-mH-x}QVFKTZ)!S_kdsTN9qWEE{5@
zoQL@%KZvHV1gtn=5*J)F4mBy@P_ckbbjv2oQ9o3as_qnH@ov=-vnG=K17?skb8LgF
zo$CUv<=)(4PMz=}yc}StD#-a=uLF5LFT%p4!Oh7EOV1<R{9Pwm-i3Z*5D_;)vV;gU
z8!tX(7nXsCu_g?&NlmE^*7K<>TA;;=O0&hbZW;8%y1&F?n1^=@rNVI%48kiC4e4jt
z*Wc6NH`cb|kCFOy9{7M?4Z{cnWS(d6=K{BKTAM(!LnQ$=Uo#A`Y|ZeSX=`R)G<h}~
zQJzhs%8$+J{(-qVB;IdFC5kVSCl15IP<<R{T7#oRjC3N(8FgY9IdqYd91IsBUaw2&
zU|^YV7_OT+0~=xgR(^+c*1rR~p5TwkoznGZL(k2#QkmknJ4W6$e?7u3N{$(ahD}<+
zPR^i3!<vlybj`*A8!*HZ8Zy*6Pvg7|&$={qTqifF?#mnHm?P8!oC19JMTuLsg|)em
zi`9vyBvaD8xoIEfNH#AekhDrJ_@U;1{&Pek--SPHK1Hg=G<EFL#~*i&wqXOp`?M&h
zm{dV=fcpm7Wf0hAM?5l>A=BE<(%B?;HH`+lrL$Z_<;OUeQNFKbjh04~kgM~7Rx7o7
z15(JVVGD%dikDXC?fId%`MKAw@L3`jy>qDdD%nXBM60~QRWTDu@5_7f87WRA1HI*q
zMR~MpGNTm;eL6W8QbSNDbpU}d>J2CTAfHY{z_F4sTpp9%lRfvjcDbOHPL(Ruq&J_^
z9$BBv(jHYPwg+QOat?d}MJuL&I~TF!Li1IieVwRpZp%gioMGXpDxc-j=?7x}OF`IW
zB%QpkwS<J1D6&rKN%1y@lVXNBAID2+5Tzk4M!%2`K{a54T&K0-OODR4`QjqV6Bm{$
z3Nnr)OZy;hZ1z}Y=!mL6y)&w0on&>A_)$9cNwCvtTfCN>d-?jK&Mr)l+Re`4?4N(4
znuDoAs2rcvnpu?+YVIqDyEF4D;y!=UE6LnEXJs=7lyvgLo3>sX1?sOi^~>|2soX}T
zGI5*>is_abl8N2n`DOg(zQb}4(Z+rTvQSk%agtCM$t9ABa!jZA3_KVQv94h;%}4}r
z72aR5&W>WfWHCAv_jZSE8_rhP7CTa01sV}4$>Mq)32tXh#@&9oVv>v!j-BU99KsZ)
zv^4~jE>4f;+Tk<Muu2S4ijZ)?&dR+Q&bR3p-3=*_9ELAi%0&jx>GH@+<lJZZ=sLjg
z$pI$Jn4lG3os{Pc)ROkp#lH-&en-e(NR-Rc^UHcGOn``G7Vb(FKJi5~O}JNK1f8W)
zq<(A8?`j@%`Q!`Yc^J7}?x1!$lC0K5u&9$oAExS+r?R(<0zWdoP>F2eC_#liOfm+$
zH!f|_EwJHAVJoN_x8cZB`R=@FSOu$@X*1v|pDP`gM<7YvFmIPQ$0oI+#cEZIB8eF<
z7Y@c7P=dzU0XZle;PW1iHW=`{JXhbK%fn!6G>Jxd#o#`*Pjb;kJcPk)ts~mikLN26
zP|A@LjzU;)usDuX?<?Y0V6gq`vFrhpNO*O}vs@JEa*;hbRAw9I@fsG!`i#!pMCSQG
zbWP%lx=9CZiy}K;wTMEN)UF3<1{GY<^6#^=i<{HK*6;JI)QW$?;HR+hg0^5@ixUNg
zvm~BGeX;6ThDn#N&CDSi!1=_Nv1jD`oH$(=)#8?Uq~YmNG8HA0i2P%<iN@SGX*rUi
zz1z<e0{LKi_Zv@Cp5bDzC1WE<%oPi*b`o=wcZX92eeKS4C(;Dar$1%tvIKgquR+LC
z&5vT`GN=~bCo*@VNfunei3rd-i{x!;E&sa*{e$xFH|kA+sF1Rw=~0k_k2+h&dhbGK
zaKsN8BS7~Fh4jOtfqJd8VSH-s_-PO1lMQ8i<%z8q=5E$_(pWJ_!OawdALI^dQZVK8
zlFtf$`h|(3K6O>K#Vr?m&KUKmknP3e)EZgE!g*#vE7;w~y?1bI`E3%WAv?R89EPz7
z>C`zB+U1_-mGmS939$=+8gxhYD+Gji3rCW)h9~9{Gj;*6CF)f|M`JRtF-2_qL4<;X
zkPwwUKf?13Mx2!Db|AA3I`W>!2{{IbF@_4l`qUhVt1uZ7(@duWRk6z?pC<KYTR~PC
zxUoLMISV2RCvvUNLL3$YuLb~_II>}Qb`Iws{FnNRoke{FZMazUDx)4jKS0z>r(yll
zN88n=7?<IeVH^QzjOR~us-PJQg1Hn`Mj8(<#7j!!krfoDI58CdLlKqW;9bBI7owDY
z!C|WDfJm1n+zZpLIw#}NG_#OQA*q8D0i6Rvp*Cjd^j17H0S^+6w8uS>2pgw(;=Kr9
zJ)Myl9u8Pu2VpfznI2()bx0riSA_H~BC*NR0}x8*#(@wO&F41};G$6`LA3#A!@!*r
zMdt>WPR=OA8^r_SyLm!7>|E#Q`4>k*iK7wE+!)Sk62wGn1eAi^U3(PAwU!FWY;9(g
z>`X=zV6dopsKteYg53DiWrTFhhdEr^B|WF0g7)yt{Xy02vfSUV;H$PP-7___2r2Jx
z$xBKyof|fahtJ6{^P?c1q(e*zX9l2I(XGZn+rlNRkuEclhBIQ_6=?RLjCi=`1QdC1
zKO77KdZA+_DBDC@Ls8(aSWRQ@(!Higm1#PGZCA7hoPphsm^YB-m^1U9$Cr|cms<n6
z@8JTbJ32dXBqd2!{Uc^4J_Lj*!5V!vLe{;!e06VbB3Oz1H?u%il%Pul5gbz!vFzgu
zV};@5MKcXhL^LIuH5aipB1_t;vM0Kcz-I)#uu^ZE7wvd4X*OMu8Sm;efGysD`pB~F
zvnDvUl4~aZo85Cx2LMGEpB_ClH(4&JS4syce-x*E>8_{UvQ)NE=^85YeFx5KZr){7
z9q}rZpDew?+^Ip&&Dc#DW>DtM#<(w7YdEPn%TDIaoOEvFiwtc;J9Vo1^fY;QTSa}_
z_UgpD+n^s{W_mx(vuv_!tGzjx$Gw5+O@mNhX(7H>Nh(!aT|a-txS_P!1J_j%-CP6N
z-GubEi$T1a1n)9jermY7Mq%nSyow-RA21l)ye(fe+1wxsTm{+8H!9r6C!4a^Z;fKU
z-JWdb7Fq4i$R?Wo>a9R9QG;u@4-igDo#QQ6<y3+c+qO(}J3DtgPR2;6x4|MqxRVQ(
zsdfdp#$a<E;{s^8x}7#^w|apU$>Gx4(#7+i1Mupxu>E>!rHx;8a>kb>mVdqd>ebH4
ztM2yE-of^9ce{|>o(*rX8;mLG7wdh^QdQ9x=j`;LEz)Oqe<;|f-<d;1^R*%|E%O#o
zcYv>g$H2_!%DE7HG;GOLgX|N^W{kACwma`QCY?K}&8X|F(MB%LTKZxx8#_9_y*kA3
zMH?ZK0V1cv{gCl%F{5rT3CC)qwIr)MAee&7$IJwi^8xup35F#NbCCF8L0a?EX-PbH
zAePQ*P+Am6KL-m_GxgerG`kCQ-oUo8fY8sx*wKzxC<bwi)CNut22E29J*~sNhIVJt
zHv1XfeCk{eq)&3%^ox8LMaLnm)~ic<8JLYwdv(o!PK?Xd&F7`)jP*&*P3@GFxvrVr
zX}`>|jW6!RAkKKeF2zZB7DfcvE^b9|S61hoMQ%VTtEB<TPs;f=>@u-r7@@{6c!?3X
zB&f<AY+g6>I4f>pe@+*)8@P#m7^TMz+{H?E(LbmE7~-LU?^unG?oE8hL_F27Zs9s+
zyNsEk-pq9@=Xl|=x0|?*QCF?=-&_LdmtHVLq|v<n^#a5B<n4kDUo-S18C28DAQ-2X
z#h?ZBZcs1h{y89DAbm#YpQ`;(S`VXRgrVW;?VB{QcdLS6+_J|1_H)E=KBF13ui3cs
zcXeBJdmd!N`HWC(R4yN$2MNmNz=K>!pAq`!!-MWtZ$`MiJrA<sd`2^5-`U<34@wam
zH;WdQ$8rwTCw?Z#s{yPFQ#-yD4a$p8e+_!sT^hVF@*=*-yZtN(piiFIEtC2vXUpvi
z?k$U|OUI7tw@Hv{Wr#kOJxI|8j{N&MfH#Mf<pA+XFbpnyIM#4REI8fRJ<A`~xlrzw
zfgcuCr=cBGOG4_#)H;X~Ks=aP0Zsb`*SX;TG7w!m#$I0nKfbHQ9`)x%Wc@!rk-5<T
zswr$ZNzXq466*(wd%0Bh0jW#q`Bug>IZ&S`g%#I$Dl8zRy+uPq0=$DXaJlKBXf5;E
z>2sj|7&|?uBf9&Yo{=|)o!$ZTc`gyfgc<h|9R$5C^~`8^?k?YSd#^Jln34A?p6i7F
zp=jZH*<vZNcQA>VIIaw*y{r-m3@a!T4epX@3lZI3Bya%z!KhJ*0cP6cDpIVG13qzD
z)Nra~hz~%9^N<~KpgvDhoJn@LlQe{RqYaRFmw%ndwndQe=dWxx{YTipP<rEpqD7xN
zb#F#7#LV(^cDZT0o3qA02xsZoCYX&6v3JQL6b0UXtIAX0A7RhBAqAEmaLacz>rnhL
z>F;CgPKxyAu|4I9?@zK%8Tw3(8+tim-r4-o!LMQ7>SnVi5I^w)@Qy^putK=WOrU`g
zIhEW=7T$_ggd5simk<H`C_Y2wEScFN_393>h<rJiFCH1>r-w=I*WKX~6PwQ!lLYYd
z<ml9O?b3FKTj|`9E+9Wov=`$S;b8b&;HC>PW`zL;ONj2|TG;HE^PVOJ^0V7Bsn>Ue
zX^Pk}M<jCuy0QQ`1zdlUad1p26#<7mma7I_jFiJ(x~G=4y#&iaLDWR{n>k>Pa}xiA
z1Lhdbn(}I$i}FT8`-3TP9F^}MM1}JQyQr|}cn-G}C3O5pPy^kVjz3vN&>!cD!y@3h
z+;fzW@SjAPWK;P^P$yY43DT_kHRrjsAb)nEGS82h&YYr2=EZ7Y?smf*0FU}{JHufM
z&}S@9SIf~fG9x}~aE=%)qH}&)jr44K(MX8?T%wQ`2uiZq_!oY7D_7|<cz;OpvIl6v
zE<ddanThm5b^fd*mUeF)GN=^bADGBwgiWc89lVqb@uwxTTL&5{1^9<1Ga6x2GGiZ}
zKRubvBV<n%%s(`-sX;cSHytMEPfKzf0BmmCrv>g0Nodyi8gHFgg@cn=UebS3LYvzL
zYJvL$6WUChry(@k74}a@XtxcRX2bbIk`_mVYox=#qE?W#KOHTx!o7=S=Rr~yxX+lf
zOsOggv&LD^v&>Zm--)2L2EA5!lykSvCnm`jr8pjQiYSZ@XeD1)d7_5!N7B8`La7BZ
z`)C)|^f1Jk!#7xza$KY^>NWbMeh>{~guAXpw(DX{5ML4Pb54ly!`}8A@6FNSi~U!7
z-iyPd*V`vB@g`S>MA9E-=aljg7cIiHGUlj&7d}wiHQj_s+&+q29Jry=PbnYW7$)%)
zGu?%mxet4eiR%2QzcuE}J?f_?UpN{T<{=9%f?<ro#Gozcp1P*<o=-FjnIuCPe3p%$
ztpK2YuzVKBXTx9_V6BW-&M-hq7RSSMWpT^=pqgX9_s&O!E&-#E;lS?t{ZPfZ9aDHP
zj1gap2?B<fFqF~Fx3Z^MwJ2sG%n6ZkU{LUD;NoC`>4xz@C`iH!bz@$IxDMkth|c|}
z7mVmEBh!#h#$!x}nVU}49SQAw8sHEUeUrCfQN%vq7!G3C2rhB(=htJr`pYQ2xec>p
zMQ8tcd3pI4D<C@ol#Fj6mmo<amiewD@KXOBEkGifUKYXH#Z?P{&k}z`%OyJ7dj7@F
zJG<K_+dnT5wO_2SJXwFd{_VE_JbU=eTmN=#_31P3$<wEgzIn2??)|*_%v(h^N1ee!
zkDhsto~%Ff)}DUz%{Px8KQ1Zq-FNW%n{S>x26*2+dc5}Z@oK)*e|xJ}PX^yU?fc)-
zw<rEuzsK+3_xg9i<No6SzWM8`tB=;6;<wY&_3ys@*0ch>U4za%eTokibnM<5^zP~7
z@1D|A(;@i(cX~h!W#RSqn>TyA-B<hHA8jA)?;Stm7r*=h3?_#-qB%2zF!7jslnMSc
zz6f&Dcsj|vQJiKASqu!1^Aje)c<A?lPKeaZL?hp~;zP5AkqO;TaYA|47p!6xH<5!d
z820OD{&@+b>s|np#XW81Ic7BNrv7LQFI6^YVwV2dSrTAU(5+|C`$-a?{+h~Ha&_K<
z4YM~Hna3l3Y!k<G<_6tI-Ko%;1N-i~+e7<rfEJItgM_x)=kk{+@_Fv5^A`JoVHL9k
z=5~5NYH(zMQCOM_l<&Tq8BFE+pmot(c|H#NTd@6)p>WA!G0B|m{kE{-_Jh;O8SH*%
zT{h}MnuM)Rr_zyacX#jmw=ZArAH4K1Va4GNZo%Kb+IxLmviVXLWDU2YvSoU(rNL&<
z4}4rsu(k%_*(3>8PAB28Z)Y;j*z%Qj$h`1JV72f^@iGf#(Dq6fAyE8X;%g=WvS-{p
zBu6J=jrl=32{QztDsWET>(MD}wmR%9j|>G`-jr0{=hPZhzhedzM!+4QAnh1FG}I3~
z6o~@abJ00t5-m|~4|L^BxM`9eddTAJ7{gwWBr!;H=>(r+Ufc-{ISGOeLAy*qB3tr7
zU`+U_7i7J%4e<>RT!c#$I4S(6NI_$e5a|H++a%5~jg3w)g25m7ApzqEpmuOk=75;2
zfsu+KLv;xAzfV8{#kWepY^4EDL`kTWU!ic$dI%qt$NA?eYkM%5KFSR!S;uhlBTT`J
zkp#>lKr%w4$ETDE7PGuY#J_u)$Uy02n58P`5xffelhGJ^zY|BuqbWl-4vWgmXmTT=
zSI%g#LT)tpsAvhLMgr2sh{8#ydOZLwj<c91%?u1W_I;3D2Ap*khMZl-hU9tmO;Va3
zmKftSC2<yz1ma%r9nCmqs_lT(=bvE?99}BA2UcSxq{LxeakE09jp<Y;(}e|gfh0dd
z2prlNck4-}mLG8&7OXPq2XtG-u%$vA9uTEMYzAnJB(4;W^JMsgki&>KQ5E^-QYF%c
z7S6*{3bnpm&JznPk#PW$VRr-)9BQC)%y57E<-y_c$^MS_dhhsn`{iC48{8iN4zHDj
zpw@{trC8AxX(U04D4q%iFu5>-qUDY@ZI^HYmE`Lz+GCD*>7L2{o}jSM7X#ElXS@*3
zWyGE1lij_eqb?qz4h}6r2S{m;84Q8srJxoL?mEyQGeKAp+?^!gEJ!t!57V7wInt+R
zRkV*3n+8CRB)-vf^6*)R%h*)~`5&{xa-s~(;a>JO!IyQOS7%e2n9J1O5=H@I4UmZ`
z$`d4F;vX_qlGY{|g&Eg_({qL)`>CHujffz8!JQ;vxT^G6!U5B9JVL?LPbC5R^l75m
zmCZ=aFyf5T+^aoI8DO!Z%Z~kM<H8LAnZW@jH78s|<Ot|7+3KCfWB<2Fz=-B&z(`0o
zg*iE!;L2Ag-W;(VymgXVd6S5h8jMufbWD(KhQk?}DEOp002aDWTA(fwyfcK391u9d
zk1z8fe2=;d<oae9pi(f>Y3chhMdXgI(X{kTW)^A&spEVji&$I?$hu8a1AHHb?_g`d
z8fM|ZFcLpK_b9Hr-^bMOWz@QjX<>!g5RH$4C52bU2vRm;JUfpkFbZIx@R!alO47hX
z3y6>_xgu)2Zpi)EEVv5?j!B;H9qpaGJv#7y+<x^o&+!Drx>g18%VU`FzMu5H?Kk^Q
z1!tA!=GG-iV+?G{^-9Va4$30{%q#k2180F^%=gu7(pHL`Z7>;b7<*s<P)WlAOEnN$
z*3=}DD*gf#9>o^BVZLVa@;xWkK<{9MzutTOe8oI*>7*QEu$PBdu$BRH;aOCU5vk5S
zWL8D9>#bIg9kyas-WQ>hD=D@4?A_okWnj$0!of2~4eKZg?H86x(X&3R!nRSke*m;;
zqfqID-Fi92Fb&19H5$T*QXJU4PJOjw^5KU<>jNcRvLWoc2kZpdONQH%*iX7Oo}+>f
zUPWgUSnivPJBwt~8xO4f)FvPDbJ7QHExRD9RIvQA3THDRvp|oHkoh_<=P>b9D~;=V
zT+|&~gRff_G>1XITf-+5eJi$*;})~<3DuFx9j}5<ST{K}+=6wj1s>RBh<e5SLD$+}
zi(-~VkpvBvgQjMo*^W9c;vFOOgw*Aj$=uA>I7{s5>wM7twll{KS5lwIc851Z?72s>
z9D1un?wIJ{2CHjAXQ1iGmf9NS{_xVjPI0%m5H+^CiGrgxrI>=@;%WC1^-Fpmj(g})
zz1)1_Q4cg_)+2==-sFv_XbFq!^|IbU9O2#U?DF2#bb&7^D_AS>35Xdv`Hdt#>v90T
zq%d<~FT~>zRL;V)Njyna%O=t=*}D6pg-L_tB2>wS3ocR1jVAf34n?-`r^P`aGxE(5
z4F%IV9)B<u(C<zXGZ{DEQeWG>s9*tnf+Dpq%bIlL!z@L`%Gj90|796k&G$%~!?|ER
zzmIvAvp{?Ioh9*QM5&$dZl@W#(%Yh|3OO}snPJIBW!<wSc-<dO=pc8p(n}Z?r>C<h
z-AevmSYV|qQKJLTTjW_ux?COK+97tewo;e0MR#ZUank9O(^NM?g{X+!Q-0|HpcL})
zEFOiYIi)}uQ;{mC*ZJZ_&a!GuMg*TW+n{t=iU+x;CEgYcyifHEWD#u?T#nu4NQ$NW
z5vH6?%69BP1A@!L%i`F9Cy|(uamO5=9Wb{&%rG?~YHm^CZUKE55BmVs>81mZn<xRh
z!OBc{-y^fIRP@q*=96`XsKy;&d~fXcQQ0;Qv%ts*HxuAy7CHA0PHr`!@Yk6DE6yHO
zHLqYLI3>kqD<CbvBzhMCqg@FjpzW~lz;MKdJ4MHvy`$L$@a+t~k26-y!AzofhZkiY
zowcd+#NT{f&H=||vF1`7fh7FlM!WrTd;ehe;TEqOl%VR=BS|u;izYP3p}g3B`)YPN
z-i|m$>Hv0jxuiu!d;sEcFH31uu=8Rlebl0ZJY6_2>VOtvgGZ;A{3h_QOi<?!PWuW|
zfZTw9jP!wzZld&_q*%9$`)FfTAJ=Ilx=fYptPPtxZXX5el*&PL5hgL6^j($m-ocOi
zM~4TmiNzJJ&|G^T3y5`ZBZNRa`6}p5l-ZjS-O4W6)Sg?h<5rTjB5GiO$rc+zbaxI9
zUI10oqY{eF)3e-^m5s%&RoR5T8Y8o#a{$?6^G-f)_+ezLOw`37Euk@x1>c&<<!~Jl
zmy>WA0XMr=2(HMQDR-l=_tW<4H?K;sPfudHWTYELIsgY3c-5qCjO7%pXEN=<Avf9@
zM&45DJ)qmgXIU}{9(XH3)?48Pw2THC&sU^uuJ=~MyzO19i_bKkBt5w)BL0tdwqgQ&
zuI`!r3CNv(#@SQ}oJ7>qU33j}Tm`VP43njfJ@q!d#fS~DpRFx!G`I4}BR>s-u0Kp;
z7x~9~d*1e|<HHi<KkuO>b}-<{f3Ci9Ii2{<eazKIesmEJqseG%9dCEl4-gS;h%CR?
zw=(j_cicpJn!LN?CMIMBcE^n{i<{QSqgytT1y^Bq$Bmo?8F~DWM&RZxHCz><tjh7E
z<CE=!-R+~@Ql>QRx>CkicT<@!Ql=?12i7K9yp#;j=#(9M`^SeX`+GZ7`MYnw`|jD=
zci*jgExA92x8BZotLjd;U1>Qn+tr@5FNR9ci9O&g$64Q7TU~v$ytcHyy1J(O@aFJ%
z|EJ}(VjtY;G6b--@Lzv@KFtpt9>NsWzOW~+^n-D_qO1{C`taX*HX1HprNiYgx_KL`
z@Ok?5G5%fq=E<u4mp+faS^KZG$7}0PpFH_y{SlN~Uw!=a$$xpP^BZRMX98nSJnz3I
zr;{j~)Rdd@{xkhNhsk}GX4fFuod-eYU5$nyUc*D}&2o8pxqSI(IZn=2fD?VU^3(CF
zm6ODeQe+s5p4hx^F0L)F5+5dr;fUNl&Vd7LF8()EIXXN%`EMd8q^r|7eureWxKdHW
zKTW%7(o5nv`){N})5BafwvmD3a&{iWmH^#f1lhb7qaFX|;v^d^eT$`^uejs<izCTr
z%KCTle#17Vt^cQwzR9iswMT2~f35!y@wub*PbvowwM3hXC}gD9Q9Mq=beWo3+=A*M
zuSqIdS&wcR#(0EE7vb1E1j%A^an)M?sO}q*X&+kJn@UO~#4;$uE$M;`JdB266fBQo
zG?xBN0It{&E1M9FlWIZi`WiQ6S>NXy{0LlX%K8ThofC!MMh2L=|F4y-|Hpr={}1u`
zu=~Fvr#Z<0f9>kG{?x30!2QZx+Q2pb%{Naf*FSvR^^e}JApbv^OY2iUfAaM|W&V5b
z&X;?)ZKIz5KYIM+X@35{d9?oYFaG}_J}VCwyodAs06=fwbta1kUTgjTt$p2DZ+pE-
z?_C^w=YD!l-ldo5@$cbV%Q2r+^?{E$R31`M?-Z&9=8gm^L|!i#4$}@f%0%AQrnkn{
z3+s76=ud}05SY=qp;-WmUh#F%7dsDazUOw*^M_~fDmx#MQK1f2fbhcT8T`R-p7+K-
zJMVZ$%N_5<@{48fDDDq~1V+BP`nc`wFvuSmB)U?@lLXrW<ZLVWDFgDnCu^<s_OrG1
z^`*7PkC&x|mqCQ#Rl?sjR&)KN-i2vzLZL_OuI(l0<Cv!CclH)K_<GrU?MLXYik<ad
z_l{v2l56Vh)3&z_h>nMZ%`x6k;jM`3ns3ZH$Wk=%*`W=?FyKrPFF~iq{m6TR7p_5{
zyrtyw@|)~jLHb9Wyi3pHF*>U5hUn>YI>8&RU9#qYwvV%9(#s|ZOl0dHyW7VPpl==T
z*asT$c7||P=y*HZ9R=?1el+o63^)XZvNG4kNeb}BNze;Za`zGHut>u=FLDGBx{Czb
z2`({Zf_U~u-X-*(NlsjeDXIY);X!)@GoXm~P}J=L0y~`~eF_Tm1JXZP+9eo;qd)1X
z*?mF2$le;8f|)7wU?KR!Wtl7lMqL6_UZ&`5oWxh*2#+8-IL*k1CzFvkjQzehfC)tx
z!2wx0CFn$pFqHGNudY}hD#Y^VKl<C3wD4ABN$U4p{7V@(7GINU>+<)p{QcGxUy{$)
z)Bf6>Spz7m%P@HN?<0@?uB~h6{8^{RkH6#B-#&%ETdT|8J$lZ6pFVesKcZsat#R@1
zzLCG*%HQw4bBjNAi+yJmvoOQNXvfYcBvN!2K_nVAox>?HVvkswQ(wItgzQ#_SC<s0
z2m#X3(({hv4lbcb>q|t8PaiLxhCmM2DI6_<KVG5{LEyE%MfQsYT8~Q@F~Y+b7(g&&
zuq7*KuAh~KFZ;m&I_>>^Pu-3G&kx<5?!uR0)EiFvfw!pT54!UPuA(K9F05I91k7dm
zd~u<+28u1y%4n$SNmmM|Q>(I<KNhPig@~P2Ms*>cR&boao-w7&BnyYs_mz3i+R8)k
zg}N#N?vlmm+QbYbilZggad_y`8TJetUG|{rf;@%e-tZpGOBaoOTUpxgX5K^i)A8^j
ze1|{n4OJS=x~Oz|o`li6>hkj+>jH^H-f`e3JuP<NNZ$q55`TgWMag~xmatmU<P1EC
z`WxQy{{QZEPr9$Se?mYeKgj~(Lk7r6AQo^e+(b8}23uxy9VsMz=y+tL$rf)9p)+mo
z-wTMN9+iilY%JWHL=yfg1k~KaUbjMT(_7u}LhrfP`ro&$wYK;Cx%cWNExhmF?)=Z*
zNq1-O)vMz+l==E=0(y_ewdvgl=u2C$pa0wvJXBQmKz92Dn!g7~Xkq20EyUIrn;x2%
zdiU>p1PPv@^>7RRc066I&28Qjyf$bGTYA3$|6fp*49Yha-sh&!cvI(QaN6umpSrMQ
z(#mE@CX#o?pVxosm^r0+Te!z81pz6nA#vX$v|%;I83Uj<D|&q61U7pRdl)1wx_g4d
zP1WS;FW!BxW#*sY4$rz6#fFNeZEwk21ITLbODWUz8%G9()qG>84dQr0Ei7;FWSKsv
z0mea?*6X!9>b29e_YRAqY0Z*r1qF^8GA|8RC0hsB579QccCE&P0a=8FJg*D)fOdDT
zdlcX%(NXYNTo8*U)i@qrN$Mm~ApznBK@o5KNpVh)PB_mJyuff~o{ybMQFKkSC9<Jr
zM3FoHIoj638A7m2p;5fam;k~2a7O{nE!Fon?n_;m63XP%ojiTqVx~dQ5wAf9D#NFg
z<9tvS1(mQPEokm*!Fk)IuhM!*VC@p-wkgY$nV0n(scgeMBh&OvvQX!z*kKCE`1RKt
z7T+8A!!#&zHnf4Wc-jFPx1lMm<EH^sq1KUiL~{-2n&2X&I3yk#29muYLc8YRB2k~b
z;U4PKT;LfqOA0)JCm*PY=eUe=FQQP0N0b0h)aN0c8K?~mhLQxvBo)tmeLT3p7{j3#
zgp`j={4O|<0)|MDLk@SN43IkV<5F-quwJNCt4mdCR;r(zsr5oDk{9R0hwxl4*!&B#
zXmiV(*E9Ud_*W(qn_Jw~96#ePh0R(sKiyp@!UQEfh2KI<s)z98@*D%jw2(}g6p?`t
z2RV;pa)}eJfRkzGUX%7P&=O)%1vZ6wrRu#T)V`t;T}exJCb|#8!%#r2-~!IJ6r!lj
z^?5=`cQT~5b>cUDqyZYi0%0bpJu%i1S2n?atWZa10Y+zmsuY$3&B_ND)CvhV9*fUe
z5(of1Qw!-6J+nXCDeUO_TrN7IzC?Z;NmW@$^kW5A{p|d%j^W*0wo)QOUc4f4fcDl)
ze=K6vzmYhRLf(_WWBqK=#I$+Cy_Ye8X_y;cCM0H<m+G|5-n>%Y#_uyKAg^S3z`11r
zCqIu)dxviiP8Ng_MznZSWQAV_Fe3vQ%Zo7Ti><rjPnIZ77T7orTs*|2Xf##Q5{&Z}
zq6P7N4PaCHA$-38xPhdF^^igod|t9hd;6I;@-YS*^WU;oQ(&pXj*z=lLlitn6=4&R
zYll|ymC~ET5Ah|MVRxkBC7D5cXA>XjISbg2z$|4iNPGU+fgu%(OBbkfLIIP;X)x)>
zOBUCWI(&VPjGefZEtK$jA7S)WwW_5Ou5IEXu=9*C+z)ev5F_5UMQbaemo8B;5=lL_
zHb<6`CH@#=_X6F}vrs98N$*VIs4iovh4N7PjDN@@n8gz_e4GhuJ4s_~m5lTy5S!HU
zJQD{@?`^!3(Sk%b0}9NxEEU$<-nOtSRN^Y)CQp3RI=h5MbS~+brkJ^5%uyMe4q<}Y
zA_A(s=A2oC573OF8{YC2-So*oy{F{dR64rC0tznCo$~;AF)l}6_Gn?4?sC!Sk`*JH
znI$Kw-OQGf9O>sC2}EXxG+QV&_C=-4?nwR}f}T5Vx>8rgS)fF;F!F+yBl6F*2vH>q
zY!svmXRptnA)I}G%F*zI<vi{<c~;N&ka$zH=dk|1qPKHD9?rGDe5|r1X?9#UDKlxw
zU4*`3kQYIjfUAyG>Nr{{(3<`!Qd8t*oeZQyNx<<~DblvSj$zJ`_7aLmdU`FmcI7jb
z4x6-A2tv*l5&&dCo4-&e3NFi~aB0%jf`~ZmpZKTtBA|m0Y+oHOf-V$SfXLTG;8>K;
z^m1U@Sg=k{bY`>;kO+^@k@W33H)Wj|kp{3kKZn08+u{@R173aBdtyVf?$l$=p6Do8
z;0_({J`Lf%&1l>%t8o-r9I@4V*mph`y2n7Fz!C;kr%%NmU_sP)S!WcOSUkDFANv#n
zD`yN_q%56|$191{4y6Jd%Wv4cE56AB*{2H)Ex@-Vp#LP|D0?0643-7%+T`JO?qhg)
zVPblNCO}Mvw8>&APP8C_b3tf8_cDx20efAKPQr20=O|F@zvcM^McgO}m|A%5h!v?h
z9Atw^DLj-G0Rg>4ZZA8U$r_m8UlQ6a&^+n%3R+2j@239xq$P31c;bl3Syk}zbLWS>
zSNjKhT258yZ3!e;5Z-_O!%ccy-mC4SmwTw9+j+Hpd~EH7xT`8cJc~1Qy*~|xU8X)E
z$9sT0JPau^YKLRGf%rWeF#)Fi2*0#D+@94xbtu9%I<)LM@}1n{x*)&cX|+WJOsmpJ
z-q@(KRGW5J9f^P@fOpB%%ejY#qRwC&>hQpi<%#^T-@6mPY0n01HKk-=3n><->|iTu
z0zyt?U&JG=R7RJLG$JV){3+1*J1rr>h>y4l3gS$@)g+~2JaZ2Z>X^PFB-x((k~wIp
z?1w^5ZD)!YtiqYK>NYf+gIB`k?8$tlSs?K+!vJy1SeSlAWGh}BzUMB+rfl$zxSQIw
zb$F2v!J<$&!ja#C=iHR#=!FXF^cGyj<|hjlgQ;UGr94F`&EO1nc=%c(z=Ub^0Aunb
z8D6r)WB<(0$Yd!EX{*U7NH&z=x;Rf9L^mWY=U{@CD_%U7GqMO+V{H;+bWAons<~E?
zX%$wS!?JG9v8FMs8}h44B@i!RTa0jUvT$3*b}PPCKyo9lRwXa-P;mtIaAAyEpo3Yj
zU}jpQJt7qe+IHYe<SSSL|H}0fJeA8<d?8=+;-CR0OS_C0s<+l9rD`1(_bMVt9@A;V
z=p@x+Y24OU*2<D1*E@t!@{BO(JZCxFea6~FexxWXr>}*VkJmRmps*h)(3z}h3eW}A
zG{TTF36oL&@S%4Dt*u1Vpq-T!PFC5FaV(=C;tM@IIhuJSAm}O^lHuGxST8k6DJ{Wz
zh1n$Pd{BLZ8YZ#xA~+?sUUbi*bVC0hnn2OwSzZ3-30t1wDGZa;&`}jD5+te2p~-M(
z%C5&8AA!TIYtoSeq>M^k3ZS};;NZNfSn7@dE+kU6HwkU&7GQ@kg!i@AdIa3dJow6c
z)CS(P0)KGBT2}`{i+}+_xtLCuf?A1S)qvlgA%7}oy;a9bAe`M81J$ruCl2eq;So^U
z;Sstw6}-2SxiqUtYmgNr>XBN1q;JD-NVkple8U*#wdY%6dzsY!-eI=4kO+9PnjSOc
zFfZ-eVnLHG&m_BQp|u|jgDj{MTFWg$EY|ts-qH7m$9u3wlyzJfWrG%veetWb_0_oj
z%wwkd%=>Eb#p{#F)5nV)PjOZI;i6RYZ1(Eb68>6Viy5u;?q3nq>2~qTu-m1<$*i=@
z?h<1Z75JxZvHz*1r1K5S(Kx1-m7z^7$D?dp%8pw}7DRYtb=#$+L`-xeU}%BpleC%S
zi=(~0?%&@Y{13|jyjEeUwl|dC+E^vg4%KQzPL}Rb>)32r1of9?SL%3_f;~@k-VYxd
z{rAI%dA&F4`m_k4)pZ(z;qRIUx5`d1)n+7ZHXV^hT!o*$Wi3_uVTt0?d!mYO@qpSn
z7)Du#)k#B`uP<uDG5}hINDu@IP!^3+)@HE>F>}QF$10JrpkOVvO)_F(1*uq19n&fT
zX-K?XC*R33bF_t`Bx|NjRccqI^Q4i^sKuI*V_RD8QG8Lwv0bb(e(W{j+L;vB$TTxR
zW8D_o$kz=`v&AbX^eQ?>D4NvYFH{nGC7m+>Me6S@-H?IpF{q8=OMyynQ7%7-GdK#P
z@sOWfvr)0FRbN`#U@=T?K+gT)MPOu2yej7$S~`TWx3=;aj^`MpRNq)yvi<XVRwSy-
zDwWDQ(4#VVEvvVsUm4j@@CjqsKZ{VI%?gPAgtXm<hp(lhIg@B6f35v1xvZ*W8dD5c
z%PIIzOT7&+Yt)gHu!s)jtpe{AgeCO)=k;HxE9Mdx>JEdbCG{{mAoL3n)bUoYzI(j3
zzCL*L=xs;pw{ug<4J#vSr|q@eKCo`f1n<_$j_vDZa>5tTNDqLwRNnxw{=VLJF(I+m
zXF<gzLOThZ9#j6_!;1}lc>=SE6W~oOdJ}<YvV74-@m>E6NjieZ+SY)2av$Dw>{5u_
z{&(L#di34XpbEKaEHhwN*|P(Bp;v;PkL~Z7|4i}!<y`W&^Z>5)|6N=A=9~5Py#Mbv
z>uZ1c|9*&1!5{1RWc%d!Mjlxo)!C|-4W|{sM1QEto92==$%3m!g(&?q_21^#XT$gu
z#>XWv22A?1Dcy}Gqpn>dNPhwD^l$AKclf3?%C6epm+&tfM_<1^+54&c=IHQ6_vNd@
z@3&ud>B-*l!k3c>W$eQ@3-34F4zQ}DrhThG^X9jY_71iyT35AqPF{6i?wzzEkQCsQ
z+xGgg_wRf3`Ii<J(%(JJqqFvgeto6#1VC-IB?FZE>F?@%vC5_Ywea4PQ^RW8ZT$7R
zYCkM=;a`@*`}Aijz5P>nckj)~55H^_OTa#C`U$^LxhTK55Ot>cuuNhD=pFolk#Q?(
zQ1`G~>o^^)P}R2qaGC?E$rWqSRF9<Bk1ag?nn%^=iYa{jm>&N+cLd&rOC`Fw^Kphw
z-|;xJvtpV9DlO~W+b;Z0f3_cFaYn0KVnctuhL~7fydxJ$Z^s|@CKTuDYWez_{putb
zpGw+^_pI+IXEtZT<fJq-8b3+=Yc@i+?U~Mktc!WJQI>5@U{p^ZcQF7wCLl&#k@F~x
zlMX|J(my|C0g_~WeyO$6sy-aO<dxRkvvX7ynB=QtOgh~cBcn62AWG!WxNKk6Dn-M4
z)26hs%FsnPeY<~f0$oOT!WFA0n;2PjwJnDUt#FJSXM>gj`;f~E3><=-nIbr@u1S+B
zwQ3})V8Bbqd)o09(MSHP2`X`^MK2hpbS{?K4XW4Go?g9BySDt=Vtb>)_)YOK-k6Xz
z9iJQ#dwR8Z@bcsbZ*Bcs$3WyPh-51S4nSnZn<O=+J^2P*Vh8pv%K2MuZ$5rbz}%vw
zH3*ofN(ZGISY&znEBQYlMVj$6SO!%vbm1}ZddEwzZZ96DEfHzDNqmXNc=+S?jKq2p
z0(c;*JXFT=RWI;gwbb&$gL>YTuBN}#L3p%Y4gsGV2#h&XD&Gc-7?p1C^b5J;%~i31
zI#uw6y0Oin0RAY02gHV}BCyLM(y0g>5aUZyy5O&+tzY2;fwAT{H45YjO!*))<u1d1
zhIe!8Yvvic(OVVqXP07Dn<79!n9G-q4`ecVb*Q!QkNw?~AIvz{)=S<H($=2Za-JYc
z(;T(l@y;hBKWfX?2?HlrB^dvgU)tq<ewTaji|p}Vf1Q70HuwTM;frANo@uZSqe*yn
zo^9A=6;^quB`vFh)u?vbHs~fqY&bG7DYN&EZ1GpVxpPo_iukWv(wL(}&IOM0hY7Ao
zvz2T5qbyzOYj4#5xr#0S!uH(UZ5zo<&4pFjPhsIGTHSlSe*#$Vp8WI8o*{E*BKc``
z4I=+Sji--iT@TQ&iuE9Sj6BjWf7wv=GzB`HD-tY}F4?n2ApBGzw?mca9#+nDxY-in
ze5v;nMda#;Mi5(e;~)m#r+%U&hSTF>qTO^UlulRW%SH=>4y@)@R_^jqAhhUHKgClC
zJ;oA+{rj&K_1B7;VMTHFmgUuDy|nIC=~sZ<ezBLFtTxd}P=khY)p{g*gU@Lhc2C2o
zbSdg*P{1s`&txr?E|<U7%PrOmPyzf|?C_qnnA?lY+7MM#Zh2@T`ZSlx%0q7v<km%s
z0(cs5l%p)>;3_=L<Q^T#74#_X2ez`Ku)eU0KFtCB$yc*cStq<tWnJN!3HnohWa7gL
znrY~v$gv5}^&j)B_pugrelZu$SNdF~&r|l1$~sEfXQ^M)IO@K;Fj)RlH<(-I)V{r#
z%!Ot9KAnBkQmR-y8+WnEF!}49MU<JPOM#T6q9-w-Q*1i~j4i$)woJf3&irvl{*rCJ
zZP^}SV;%2TBoieQE9Qk@fMMOoze-8eE-Oetu%tlKiaVS5c;#YbCH}GDzM_Nhee=4c
zZdD~NtyTMnuS7qAdWUYD@M*b2OPh|#z)grZ7Ej~6{=fW^gvZL``h8Of#;ninOvmzK
zx%%+_<(E#!Hu5#qQC|1gKAEdRWykn0zYOf-zB@3%Y;Js|!z&bpQQ8wj)e41X8F6X-
z@^P0ItyN-_)-VTyFV)Ea35Ct3g+SI<nabPzj`m-9_1Ge6ek<uX15;-0ky6Y{k%*O`
zH3j<93M9dAlORR+yQ(6T`1Z^#U=0FuOAh_h%J)v)Cxuatt+$VLMZ7SGQJXuUOqTSX
zL$2aHFY&a8c*hYBC!>h(3lN+l2nyYmm_EU-fU_r!V*F11?y37O!cc5A=!gcx33?aS
zlqljOkMrsh!qTA}J7ev}<QnHk6hO-FNxT@oxT0VINPIMYizZz(ShTt5EpG5KuP;*A
z)A3*05}rPuF836~d|ms|`gED6C{W1AZr;8PplKIS>Y{>j=~8+xaG!1hY{PR4QOXzF
z8a=7AD?k|z=t6WyuYkHkQu3a-N&O=b3h})~+%camN_k4%?kAaw5iU-#u<v1fok#)`
z`F*4g_L{}$7F?BFPI$p_tg_KKh*A!%lP5qdEBtn8^NBSdEUwC(jg~m1lkGx5N3L}@
zZ&xz&lcakZoWYUV1-jVQ#_+$Qw5sG3ed+7{iWcoy6uv5hb}e)AS~ga39<Z}6^K^V8
zUxh_l#S~ZE5MU(oMyikjuNb&y)D}ZloJesTx27-=a(j1AcyjlZJ0LFeP!^RX!hK;=
zLQV=WM*}dT92(5iFY_F4PPsB&{I<2{y<P48eeVnYEk>ZV1b_wDzoqQ6w6yfEXwjJ8
zTFM?JAi@}7h=}|}9-TE$O02A@NHZffBi^yptkqZ4L?D$dqOio-h7-iZV9k(FN7)oL
zgV@hQ?B5ciP`ZJrqyvFiMD~;(Dsop41<rkI9o%5tv~sLr^Gdoo9%TjE5Jd{OIZRo=
z7EC1<+-7!iFtv1+pC4JW)&_U4Mh(f(a$8&J-bM?wz?tLIUtR7@Wh;-?i)Ja59QqB7
zaH(mq`i)@qo4_*U@4%u3uOLa8X}z)tzqVhh+%$NK<ZFRZp{bBGvDd@mV$;W|NOH<B
zsn~S<mqN==fPs}KatC%FV}RwQ23DhT(3dLBVTG_)x*|%N45GfX5Z+g<8MmMjFDM`}
zQW@Su(cg!T$U&NTJmviSR0mXcOun?uS6d(N%p(oGLonJHNAusx4bN(NQ(0gYO^o=2
zrA+@3h&DI6XB#$2>)w_bk^;%GI#C8a!jNwq<uT|#;~3o{sdM~U<W?Z2sPbum*)1uL
zB-tZ+=t-Z_@v#?2)MS*Y!dBFfbBtd}x-Qf;XO{tGjoFugju^61Rf=K?0vSeUgUOJP
zq*4Wmo*IQ?%&@a8HCCEq$xC3kE~XeEQH%lWFe6F7C9f63)gm|12cP4V1hgUV!>GTk
z4&PGbSM^To8f*Y+ZXOmu3FBQBijn(JeyGdz%gXfKGK#t7N~y=Hob;rmb5;o={#+5W
zAYybp1Q0n4L^hDI+k}?oycMPJq+*o)!<?7#rydY7*xYF7nJK|+GhfDt_*9Aq<Cbv-
zqZnoZbLLc_LhT&HnS{9|wj@V5Svq+B3^CIc-Z7rW7Xd}Q<${}=3;+!<RS2E>n}_@Q
z>Y>Qb9A1XrhC4$Ho6V;*aW*ukh_XwL!l`k}Y2kgH4ty9~WxxjN^x!$&cV49(DG;RH
zu2F{1q|YvvRn1U&)8?FX;4`Vf=cEId4op>pJLL*GVoMKu8wGJg<?w8Z;R>a&8mjvI
zA#VrnNb_w~|4@2wv)Bs#$m?mhIqJU0>-jQZhj@}zBpwlivV&y_tvI?e@9A`983CNT
zwoJ2`W*Re9yi{vet=6)1WCFqH&@{;DDic+-s5Z$R4rfvy*iifBQ2V!oI;*;)fhJDX
z{B)FYGGJFB=gxLxJ&}bxi$e0~bJnV@<G8gZ!fmwn(5cE5Ayyve%H(z%Q8ltVNe<rE
z(`9(oEsXJB0{SD!@_J6oJ8B}i*3fLJ*vU~xnv0%#W+iyxhm$_V$gzp=scp5WQ+3js
z5h28Pq446Smv^&X+vVlP+S{{56l}F&Fn6=Vtva&p6qQYoPTdie)dy{E6&B4_imW<s
z-VL_yF<G*5me1a%S2SPc^fFV&gM|whg_eD`WxW?F1M~s{7qm92<kr#EW!)EdCI|0R
z^;TvbQ9MREG4?6HkwoTeP=7D#o7tm^HEX8HK~0R8SPG-BBrLHZp0R7no#(Q1#I6aF
z&(qjX@kuJuN<U1p>ux{j`PW^H2RfSk{=50T;h08s;9pAa3SX!m{H5|xjdG-PFzS&H
z2dTcPc<N({=ujNru|$d<i6C{3pezPS>1OA+`CGo3*rjMZ!4axoBfozUrusL%?Ax`t
z<EobY(zW=vuBAMQaX&CSj17)oX=zJ-_T8V>CZL2roR)Hk{7OTVpMCdd5n@Kkdb_9B
z8LdtYZZgh7vB#Ok{7lI-IeA3U3QHjO)lc^buV~cOgqxa+ek!D=pD{aeRpbKEYGzvR
zc&ySl{^1Igr9I<<UD8M_Y7ph>dJ=ZH%(TwH`jMW%H`iUVvMXE%|9C<hoaip-1+W%+
zK`Elx37XrP+9_ultNyubo0~|Dj9LTFWdj1weK-?5VH^TTvyo<XX&kDmFrH>LsmH3O
zu&PEiZ64%cQ!yBu`liDXKIB4D%xR%;Ejkq-GcpGpKWf}Dn_W87JL3RdM(aYl(Ex2u
z?SLy8U|w!y(yY?;>9=i3a`gA(!-J(XyB-F(@PLqGF}bTgHx<^IyJF?+MBKzJTF_NE
zU<=Ew8mwEiC`meS&9W;V@$@pR@0wnHr4Z=l6aZ=wmI9!cQ$~?nj5QqGE?M8J!or*m
zRmwJjtI2mNR4zFM0lCFm1Jo|rgyfnbz%APZZW9F9CDoEV!Q)Nsn&iV9(?9EFOH|3`
zHS$Mm-QP2BYIMo0L3Ro&_3?M^<2na?tC(emN>5>5f3{dO2$dRP;gsu)ilm>?QH8Y{
z^4zFGODX=;ecWJFp>qweNWxXsfFhJc)0!c1f$~A|yT-$k;%Z=PkMeJ(k4*|%qvI!)
z<4Z4tU|csoE>J!`e%E+>QoLk*@@D$@q@XoEeo{F;S@(4#R7J|isNOanrLIsiPW^8B
zNOe(btm;|iX!RknYOG2SDH|!jYdlUVUNTB~GkuIw&>EreUd2(dG-}jbHd>}fDhNos
zxJ8+|6$}jvF*oBtMz+|4fr`YMW(t2vmG;(VFqS6Og}dQI0&2**DtOny%J$+0+nG=0
z6w*nTQJ7A$JhZXUU`_H~m|v8RlG&DK49r^k&q38?%izjO1G$Fga&V<&2~@RuW~8*&
zC<{!ZG!hsLrMZ&u{3xxU0{bK>je0pRO0&hrc~Y7yIL?dGTxH&jly-~?IB!L+uUEV*
z&H$*Tl_AZ4>T*jyUb2}Ry{|lE=E}5-yNq2z(MxfwDU^b-6k*>h6sy^KB%D;SijFMx
zr1W(ip%+VA<X*DH+U0F6X*~ig%ZX`7FxQ3C_u%q+dNW?HEYcJs*4?GSihei+J?65q
z9ywa0JPkGKN^~~Fs9Ke1Q3aYJMU}VZYq52hf{=bgg!G#tq<<rX^rs=DKO;i=MTGPl
zA;h{Zn1T{xhcOi?`oeogwCH-(h|xtFqej=Tk)y3mrZN8#W~?mzUhbWAw-0u^7-XPp
zB3HNgW+zU%e8DEykkGPN{r#&}dAaC)=>qT;@fiaNJ1Tg>eYen;UuwHIX$YR^sJE4>
zmM`5<RAQ_q5KN?os>V!AFB?s@hHwIVqpFtay_g!8x7_UZn<_7sZ*un86^pS@SUaa3
zwZ~K9M>e{fQXyw+)u2Lu)(Uz1sP@bh-TXdVFe*05(<gu?ZTbX=*<RfQ$XaSX0c!Cz
zo&Z&$@dT&}A9Mm3qdWm(X<5-fvA#SzOM)}R7%wI7YY|(C?NE+KX~v7A;dM#8p!%sJ
z*%zm-N@}sZ2HdN1)e}dEE8FEA!QHu3*C33bQ?@IX0qExd^h*JhTW;m9?hTNV&9vd3
zk~=1hg3**if>Wa8h+y7V9}se7@R}?K^<J*X^rJz(f^#s)zpUHC^JVJ~1*SBVnKD?4
z)KxcBD9}K1amzari~FkCD6wSK7|V!gO8=|%0n8TY+KvyZ<kW?>AsB(2EA%UwLCv)A
zRUq+#+^{U20~f+n)$BJk%Mi;Yuh)C8WkUpxro&p*NmyUv1HKpLZze}Tt+2#}%kChl
zX>y&Y#t&6r1oTJ`D{+M73O){v@N=&mF>G0t-^uiAWpGtl0PU|TUn;Y#$^y2HR%IdE
zM5(5uZ1>eJ-T73pVt|sV=A}Rj;+usv(L}CTu^1UlM@+XX(@s#VUG7t*tCrgKodr>l
z_`^!;K8`GD2Z0}Bd@(ljyXe4w$cwZs--LpXsfZhsN9*c0+k!oPjK7slUz!2{_y-}V
zM+g!#R7~)nl>fnhd*k$XB)(HSs|NN0$2PGa+LmCc{lXa3r0#R`0$VXJawb!j1=~fC
z;EgX?&W<k{8dsT0i$ChG?m}0VQ~*@z0Xc7~tL7^egSj9={~q(lFQHP`<0Khg8c?7{
zGSM|YWCt(yUv~d-w12YK{r*rq%G%m9%H*_RpD8_f>CvKcfg&=XnUIoYqnE<D%3Qu+
zQHIb6uy(C-a+KUFcAZytd^!v-!gxYfEX6{cd$#lyI*FFQ8T!A2+!6QQRnF^3iCWQM
z(Tvb}T4yyUiE*v+OlyUnpe1y9AIU~~7@nT>di4b+(Ir~4mzE)ZQ2uI?p;L7EyDJ?9
zLi=Rpisb0F>d+zdYmAtQ{DFY!hlw<K!k}A95h3|4+@&ObkH{>44Z14h(jr1z<ccaK
z&V7P#pFya+INs)_QcK`njkOBOC_qTt0&aJuqiGzQvhn~~sSWg~F!9v(_phwct<k^h
zWrL*UgMj^EX06>>M!r@%bo5-ZfJiegg!KXhRb2uUlp?Pi#aU2;!E(mX@ubhXCk1pE
zOs`Kvwc&XMsybEMP=PJAD*)vt&YlryziNJE2d!$%z$xqh+k@l%mj`>h7T>m;k|rh>
zvYEQKSK8&X1n@EECC%*zdBC!J7eJ@tp;-mC8dEih(xO6jlUi$8hqIj@wvW1Rri_fY
z^l`BnV%fIlrF0_(D#m@_XcATK!S+Cj3>W>=ILQ{<6)$)jDS69cwfjcKNXFdG3r#Sv
z#^{_<UT+*Ez43%)%JLGnv|a3#p1Q?TzxVDefx|<;%NF#Am*PVQLY_*BrmV_;Aorpk
zO2KkfLCL+SK-loCE6#f(|EkO9%kCh|%JK8-BzjjiTfYZMT=tyz*RnUVyOzD;(@g2G
zslRgCf&P|vvUKiX_CZvrpbHctIFD1^q_azxvgf6r%kpztEv5&BUR0?l(TTy7ysw{i
zKm!3z{n2=6x&x2pNd*F+iQZ&Xjaw>1hf+9AR{}ZfPezqE2I`4w>J9_Hl!UBIc;&N{
z&z-ke;8!^}SRL$IAQc`cbQWKbbXWScx{g{?#W#ZB$`{ozdF(7O(gbUNQW366batFd
zOF1{uKKy+Hf5Rb0ws)DfIRjOZqjMap5EmEA$-JJ<OQi!kAr<?j7hi+ElrPk>)|6;f
z-X_y}qb5~Rx8ke~>eYv?R!<*a<UIFFTej-tfs`FX#SEO`m-WH$5fp-1L@}QArCqSA
z6o8a<B30VI^uqP2uRTl=B`a4@S{Jh2(IW{{i%B6-0jcs?rdil~mvTujj0Q2fL&lyT
zsm+oPXB#GTErF5R@L!5=MxM{1k+XQbGz>0+p$bqt{VGq1C8a@o<R#9>MH7cVU4C&}
zeJhoL381K3Xh6Ft4CtkAU0)fEHK7d^)*G(=x`QLXevmL`R4t#9ZUz#g1aSkLS@723
zxK9d4`B4|7p8}m#s*)Qy0U5%|w_K2zW@x#IpHOwnzfJrogY6fKT-c6qrSoh`FaBTt
z>Pg&-QYCtMlgbyhL3>hk@r{ocoKsuMAH=0WOFFa8(<vqBwKMcuVgAbZ5(|#nLtgt=
z;Rw*c+sG1?=u7<Qp`VsV(vS}4(zH@w=Gg*hl`lrAuy`;To#Hj{0G-6GJ_XaAa7ksp
z;dJl3s(<IYgXc|qcwX$HjlkLad#*cd!h-i>FNosF*|`dim?Ho1y<r@WIY``PV8YC+
zxbrbIL9CU)v@n4$UKHx*9BmxWrizUq)k(*ewuC`%nwvU)LJQZWt-4^|9Ce0*HyDq9
z6Rtsmc<Yc1&4RyR!D#`d!@|O>3mH?nBvoJ?wK5w7q$WS^N9z~4c+~X)SBn8^xw7d1
zf}A>bE41~D2(W54!9wXgHHwj16I0L<KFo48A!cq8X0Kx1S{1FOEA}U|tXC_5&>buw
zfj(^!nYdo_SxALoP<OVN=1)cnWrmcB5@c0fC9qb-G~omCc`zIYNlg}}fL*BQM?Xlj
zB)$&%RydPM<P<3cKFJ3?F_JfQGChwc!#>8V?FYjE4VgULBi;qUSOjTOlX*xjK3{-!
zC_hBV;dUiIM3(qKNu*<hm-s{m;q}m>LUsfdy4cvZso(}mo99M4aU!5_)D&Jn#n34j
zou{DHbAo^r-cm%LWJ1^~yo2Xjx#9?GVq>8V)0LT%vDGtf`*sC=9xjjPU=>vuSR~5_
zg_o(tNfByQVFXrIQ<z<(ObH6h)vXZv3BH7{se#Os!;tyA6I%uO+PQxb6eo<CO%7h6
z)G|(-6*fiU=ao`GA<o=Xz(^4WY8}-S0sz*+wkfI(zFp33!}6^vAFRje`|eeDy1Inj
ztdx>d`%5&>0M5lJv)P`qB=$qOVKNqWf^rr4yS<jm&IJ1X6fkw+8=6FKu-07}2=%%d
z5Lu07n-)9t+r~n*5Uqt;)-7!-RNpPNd`m~hW>Zsop%-;|FT}K}Xw6p$nzyay^O^V6
z?-R8L$d5&pU0d)&kKwq1c*3u3vnNOm?tQMh>JL5s7aF-V-*nU#liPVbXN<5ezSnC=
z4r#M3jgmX4+8J<|UNvErbB5`lneElZps405Q%J{Qe6zJ+*PYFNyolbMF@FVh7G^cg
zk(L@XJYIb9`egF-F$~J?r}e^%QY1dES+zmcY%yGMDq0GLfNG3(h{&8FvBZbGae&C1
zM~JKr5jj0ZWJP?)1|c6C=luxOMGGB}!l*7DByWj2Af$C(D#UH%qAk0I4hg9SrVccP
zIE>T#UJ94%&K&h|+A3Qp%kfjY7@hczGoGSYgs`#$@M*{U&wtEm2!E(!kOZRE2Yx<<
z6+;16%PY(F6+qn`fP8f|1nNXG3QvE2^o#po7(~Xj6Mnb7m7-;+wnP0LfBd+8w2wEA
z-R+~J?SHoT(#=ZQ&`~3#s_r4NYn9uuk;2KGBIh-{zY>KY(oYsc|76f`a<_`Y$l(>r
z4KyI5Ou%(w!?aWiG70tq0raf>f)TBW<jPEHO@~geu`|>vHwvv=4e=66f7c60X|4$f
z$Mm%etNb!{XTScM3cnWxf$rYx?N_gm1h$X%4z`cGyL-ncM~DC1+og#r>vUb8OJ_!R
z-R=3pJqq@~#BNCz_8Pc<A4DS?<6GVuu7xl3VvwN%q&JieQY!NOnhkZ@zWCazm~zc$
zDhhZL)=Jf-cx6b}P9ELchz-(csHqj525)vvxRuR@xDzts_k!YG%|-H9E}bq!x_*&I
zui;3uVpxrDan}WL16=D)%#3bL-MTxhO}Y)zO>c5|e=9UvK)cJy4R86imZ8+Fb54e3
zLOer<eqLWC-h8i^lF2F8;W8AxlNY-48nZQhHCYt@hI<XB$G~#|<*HZGh)@ZS|L3pL
zU!L*trVLok#D~_hs#;hyOEQbk3Ca>Qu%+g)k)XibRI}9?w|%t}E4cwkC$B%{d&}0t
z%OuQ#Ztt`$7nwPSh>pjPd#CZ(|7{}SpzR`Ps6+&V>o`afTXz_Y<KDSZHiBr6o3mxw
zxqo=jilL2;hpMhNt6VW(1Ma)%taIFbbF_bO(&e(pmi-X?G}m)S!2k}P=e#6vpQoH-
z>Y}dI_AdRDa+$%hIlU%DE1XV;A;)7OJuAW4IS+d8NNIa`_}V)U5>hxuJxr8FEudi$
zWl^KtXn41XY0I)CJUa^#0%5|ua0aw-g6HNQIs(TqXvrR&PEJ#F2F0yKb#f^QhIrB@
zFr0WTlniQvNz@}P@ntx~h9@vM>|r?I_Xs(i^m;+iPiZuKm`3!Y&mqnU;@<MKu_GHN
z333VRqMIt(m)rD!t!eOvJNJCSUgsJzf~Kn&0RM%)30F@xH@&^>m)rXXO0HpULgd(5
zeEw^|54N7cRz8Z8Ydd_-zz>HL%D{!EOIg{f^Z(-B{|mamyu94j{67h@NfN1xjOylI
z7~mx!7u7|*4V&zITj~ZLM~I682aRG053uyw2#W!~#gY&Hwfewj%jsp9!Q{212tKV@
zH$?66Gg>;p-B01@^p4rc^hI<JLrD$%$uN6ni*oj9BU9Q3OO?PUP{U#oD`Z;px3Zfy
z?^*sSaq5nz_>VwPe8yH<@J4XoVvnWV{=V7CyWOt$J=XHn#1dx+(Ml@y;H}JD)uv;C
zQUDgUzChgWY#%<?6VLAHd&icM{dBB~&Q+FaRb5P(Yb$eGwNNKuR38!V7dHzs`Laf6
z<sg`b;H9M{%0N(tUX#Z|L2=uM-RQq&`XoU=OqWvX%St~Orz@)2l{D$C$WjjD<=$*?
z?awNFo<4nyf7iZwvTFZ@&!fjr9<BY?+T*qLr%#@Iv;GLmt*<^=d-7l2>dl*M{+Yno
z6VLmv$>}7@CN<@zy#Gu;itqh>?=?rSkU#r}-JR~jm#{q#Cw+^MSCq@KrV})M_eYpL
z?0m6V1@)vWg;T6qTh)-^lr|^{CPNz_8%7I<BwP5>^O!BG->_=JfhuHWFf}EehlS!H
z8m5jw!pK)~UO3gb>2781s`m_J0faF!!KB$rse~t<vndKbTpf4tk>5+=RIH}r=s^bZ
z6($`Gl<0<loEoy{r)pmYR6i8H)Lve&-3+--D`<O`8|=RvK1|-El-mo6DL=P=O%)5s
z98@|)ERHLw?ccbp-P5f)&abM6PC8nvmnEHSTkmRm_ckJUWXp<{1D=5AUQX-ey@{!=
zi_~@An*2Ep;2_RC3+ipKTTY}7JxD(%(J*`$46n<{LVAvUD2#byT4z=s&h@hb0KFIL
z5HL>SEXI4Fl#VKJu7CsPkQN;q%c$c5YX@u-8j!cLQIMwoS<uRz?3`0wYI&Q#T|e%A
z|MmrXa(J!Q+FS4WbFcO4WfvbDzUYEv`Fi`O?uqxc_Xv>owYSz*Ei$ahdP=7Pbic~H
zD=X;`C+=ZuoH6>Y(QoMiA2sFZ_%Iy?QFm<hYS-@78Z>KlGuMGWbii((o?;hFTh;9x
zHg6}+50pmc53?>z)2K;fKiQ3~*EV)FrLoztI)8#iik0=Q2(FEW`I9jbrES*Lm?lwj
zws}Z*&~F`|?Cu>Mbzkhi+B-M|)WZL>1cud0+azl)Xt81Mr#FX3C)DJ<)<Ze(n(mcr
zKvG5y?nnPf@J2gPrd@@>(Qf7=5SFYXIE~{1#kz&oT6loOt5UQmh9i;WW=EqhL=WM`
zVV6ZrSmx;lu6yb%Hp`0gG-nrM&4671(Z^#y8-}MnWIPuk2t%GvOb6yL>iY?5A`>{%
zV_sZTwVVf$*L`{LwtIZ|_Go7hqXsc~<5@LEXaWZ<;~1wrXrShW)5(B9wM3ny2p68~
zbpzk=0tJu6EVp$3v48Mrec|2<pnN}j%_G@vy*NC2y^Voij*qur?sZ=r9lq`!|MU1{
z@3k`0rv_H#?Adzt=J@2OO)a%{|8aP<+vb+IG-8C62x#T=WiSN%%eY#a#sC0N<Ka;k
z{<nAX_UPc4J>34WfAWKclQwI^xw8Fy;hqea;{0f=Qa`C<GIr6eoZ@uDBXy=sqTcwr
z#RcuM_u%W#{Bwz}XGq;Z$5UrWAb6<<^{tD@2lSzNkRn&8n8g!#<dAHFM_D*udeJ!3
zlWLv<IC_q=PT_<o&75X$&?ijGb{1k_Ewg=WNHm)$INNYT-Hbcl!-#G#G1V)!sW66`
zlIPwkUiZ-V%}u`hp&wh`qo<5ZviYKfvB0ysfPpA(?d>1@xJ`6`NP_ooW$%Ok@ZlM3
z%bdNqtF=vlVVp~ZuA)O<BAzb2Vc_>sod{Ax7Nldp2kQaY${9fBy$QPON7sBHhY@-z
zi}1od5i~Hnyv)34iylh;P0|NF_*eGenI~T(^Yy}f9hk3){^~t=hI*i}T<vLP62D#I
zx7;D@!G_%Ayuj#z!q7z3%{9Ju;guIvDkv;r;gNloH;hV(4C^wFpSw7+Ydq7cVUR2X
z<Vgu<TO5Q55D9WGgZCB0HxZ8CL)%+mSZU1cJcR$J1ZNzlDc(ntp>6>E2bcgb!S<On
z+1(7Oa54hwYz50_%arVNb<w*JwJiKvx?0q}9-7LKG#`$U7$2-YaOZUV^V%==tgh;b
zTGQXw^|wd*+hhIh2~7Zhf2yB;!_&fS#JDQmBYOQ-s{&1dZ&iV@b?KWYkDoOBD~4}|
zv92zbW*&#B^h7^)1|r|S)!)9eD{bq?-|KHX`rEGlwr5v*VgK-TnN$6(r@!^}x4^D6
z;2$LzCKRtdwJv&0p|z*F)Y$ua(_6Po8O5%>UaZINl-PyTq%r3rYt~YRC7FQpou(dJ
z)~!2n1V?*O7aEwtnUI#Zh?a4qgCEZ~aZc#soz@Bzho?(S?a#f_HgCbehgH>WyXybC
zRo7NQH0Ju-RrP(l{_mCbeW`Equ=9>H<}ty)irqilqz#9@f4!-9Bf=Cudro!C&GsSS
zXE0RhCY*ibX#3#hUfY_E+(uG4F*1uXKfr^zIR;{m1MSvQOP_e!*em;Tg4m1-VYh-D
z5}B4LYCMp}@Bo1x4b<=3Zhs5*lV@@zM7zB!sup^tx~AB2>RkrRUy<;1|L#2$Xn+8@
zw3O}M7H~^SjSaDj$U~EDTu!*$!cC8_`9qeII5(u*1jM0r;#;DdI=T_k5}IP4S|}pk
zvbKtA8ub~(p_i7}V1a8cuCA>=di><+H{X7@`16(bm1pkc*5vm7%3IlV9y7XR^<IG-
z#701hlW?O?pA`}|%f^Sm6b9OIL-9AeBirBa?C!l#w`b4nSN>@a_!Px6tr`)x0%N)F
ztzHe(5Vl~MKc3R@_nzW`x9s}MANK$LKd)XN9KQL#N5>~`fBeT!|NP&Y;hdd^zrGue
zqImop$QzT3%d6|(d5EH(WN{PNJ2EB~N;gsX+-QIWdq%Np>725}S%#eV$Owcgixdd|
zh32GlpHpua7R3!zDmW%1turHNu^0(`1ChKfO!x|(EL}01!}-Al2u-Z5c31%BL%z~n
zxSWtAxlNQ(rM@g5d~TMH2(ei63tiQ0o9`DYq*O~jwnf{N=c%Pe$~*1Dl&;&)BAXsH
zH99(A=OmVvp!=qpB^;QA!f&fFs9@2iNq5&q5Un2GgWM^ytnW8fR81Mn+S86*t8zdx
z25(73DLo7=T#bSeo|;n&9&v!57HMUpm;ZX{6jA@wvG+n7LdgKKL=S<zJ#6MPAWa3v
z2kZ_*c<RgexO|v9%?_;C#@lb+>>ccOcUrv?%{$t7Q4BXHb|2bp5eI=f<re@U%xSqM
zJJ;-SOAy_>aUK$2n5}qQSR0ugIrsvzX#=w9*)#o!uPkI<?sNBPiW!OtEou(|=M&+S
z-(Td$@n(B>ch4G5$D;t<9S_5lt5Du*jQ=8u_Z7VH#(p0U?Z^&v%Q}61zbiwOVBf&T
z)^K#IFtnD8+fx?HR0iIv(09&rK!TuT)!a1@yR!R-YgM)Sg^Ac`Vf|M#-E4s(wt&B)
zw8}N%2N|8HV)rzG0i!dGYh35h4v6{DA5H>;5qw&pmJPeY5k^QaMI}W@{<KC|Mnn`>
z`sii%;O*<Zqy3#0xg5HS;$LR(F=juwn%k_pRE2mS`P+kM){<dYLSPMka@O+4q!qLJ
z$$N<@uRwVJ0qN-5)n_$;jQpt}Rs$T?_h}eMXHz>hoT*b9WHrFwrgzHfSsk2NJJzIk
zzfPS-K9No7+^>x~*A!Y--zhj0^~1qnI-K9@;ppH()1WjMTQgAO2hY%!>G(Rz&I1rQ
zHoQs7H!j{+W5re~aR=kBYeETX){tG1E#Ljs={MB(LeY{8P?t**K&>)&;3#uZUuGS#
z<4I<;ZeKlkCNiuoTUi=odE@Zb!rSq1l6F}WUH%ULabBUiew+k7l-Sqw6P4>i9y#pK
z<1G@{6}=N#iH|uVEFsILuoMGJV?6ZFv_n7vV?~@P#C$0_ICbp$LW_kP^4#D`E3<8d
znyd9Ta2z>7YUQw72hYpHGq_jKoY|;@^>ryM{Ko+$lUEK&pGzzXqiM9Yj{{rp3zPB>
zETAUEs^jQ=^^9<5A4+ExjpTPZry-IDxa4z7ds>ZWO?idBo3VZv?X&dN9DF8LmyAwL
ze68+HRL={SXm}YZw`J}713U&x6`5_R`Gup7Lq+JBZln!wsS3)Ow(?Qq3(xXxyN8xW
z*{f4ED=Jt)E)b?1EP3oFeikQ+GU#q&KzAF<57Z=TTC#L>wgwTHz?pPLHS|U`p*5=Y
zBqofhp29vpU0^pW$wJ03J5^A{n-PVy$uwblmz#ObF^UxNissH`3_PE8oM9-_<}7}p
zo8bd%@zehC+XGqhy0}A0s@U*B9TWIX&&;p-o4GUnT{^^|@DN@>IW?%*F^ctc4CFfq
zgJcT%ekIL9?XSL4E<^gr@^CPXg3WDIsL4%J8_Fu$SYc<UdyHl?JA2*zgZ&dtbwpTb
zF<{wPu?zaWdzD8YAz{>0uBZICW%ixF;WmZGU~5<Vn<hWl4&fbavhB7Q8r)9}%$bht
zmB@K7NQq0<;A~hqY>pL?buHw?3OSYn>~04<x%GhG-e$lPHDF7Bd&eWb(ktMnTaW#x
z+l>9HIN8F`etK}{Sm>FtI|4W-z_Z7=u0|%C2Qj=&Rw?|)Q@?-*+gnV*z*clLrd+ui
zgL@0DuKq%AhvtcGnN)%f!q?gjv5^W_o$nA+cYr2~6uuK>AZ@24zW&XaCL$}8Q?A)z
z=QIE2a9l$9H>7R=S4P$-dEfn_uDmnJn>*w#`-+?9AaBz2p6`G4iTYVVlf7W6&y~@f
z5j60XD6L(yI^|=hx{&*QocpbC<Rq>$lb|miLf4{I3>?Y3??vlT$9vq)-Adf(Qi4oV
z|E(3<Yy)9#Dv(g%7dj<nMD|=y>?4h|YHmbyv#M+dFFY71I)~AZ!Zo~Y1AEaEQ1fzI
zuDF2FD?>2MsCCu|ok^v6<Qm3=0WHo{aCUMwPP{(!0%QJai`NME0(1mIt26}#3uCk*
zuCA>2(OMQ&T4c8-l#QOg%bw?02Di~*&5yXUI06)46s(o|A@H4Scuii;%TyUfO*67u
z<Kn*+Et)-Ku!v@3OpHrRO@YT%d3D??kchVLjp=(kPbsQjEn^#w#WswIGDniY7@HcO
z#%~$}Ku<u}_PtC08iTq+xz>3+4hECq@Vd=r+n6ObPOcYRFK#kTu3d6Aq23jpsx{eY
z8Ri#_cCz&h_No^mVbq{A&HCuDU4}s$YmVc4HOAKPGS$JDVo>uQG+TJ{zf%UgKp_Ou
zEKbnB35pI2zG@UyAWi@kIPj7GE<oE*+bFabkH)B%gl-_b9d7`?QpA*xF$B)YH7mkc
zdXYs~U%F0zC60X+j(hbUc{TorTm?N4Kel6M!_O4|-*Z1bzm4lJed_&xS6A0pAG`j)
zYu`NnX7w-s-w*LA`2YT}ef+}*cK!X>IQTPvrmTP1Ho{SGOAat){Xc#B<Wb)LfA#75
zU+e!vd_ENqe<8GK#mxSy?M1%dfAwnr@ZcUQ<DWi;1L>ODS1hBF*A<1@auVX^Iqr&l
z&%B5D*Mz%P#?$z8X^Xr|qSPFwED-C}Fw&ssKn!|$nD7WB92u4OHI>;=&R|$ewG^cy
z*SU=mJUQ(tu%-1!0Jt#(Z$;s-6xNKOzOMll%>?T!2bMh%y?A_Gn1?*vG@c|qhD;^!
zE`pyCJan4W;6`IV2?{;)i$G89p0<4I=azShf7{-Ydh%SJ6guwr`&0W3WkAZNc0}nW
zl#N$WO9nk#n;sXHrYuVP+J03e<Fa08x}CZCilz(Arjt|5`B_|qg^8nr=eb_w=8CJ@
zMYlF3j-~F)(xz3Q92J$FGON0@H#Qoq64lKYn;uPuSvVdR30XHSCBh)Fn}&~W;y+HA
z`<^{l&&6iajx7cc*=lkfjmFta34MPI#D@;V73&ukSH;@yNFQ!m<%%Qihp5A;9w)v}
zV`q@^h>aJWwpKP(`BD}mZIv;ZBBfO~Oik&=i(JksM%{27s=xHaN!dF%KG}c0*L{6>
zaCmZfu)jm9U&o1GdUF=!X^?t_?)eD88;}RD!Wd;O?7~LJzPc}i?D#s(g3$@o+fHA=
z0UE!x?hojMZ<R*%RLjuAAY1NV{t%v>@51r=gc=31d9)5x;nBNS@uhl&4cU7sqtu4|
z(1X9k^eVi(f7t$Uue$@^{>NaXyK}gGbiCJ|BhpeR-^*ya@bcKp2uVGVHr`<seBLVW
zMaR2O$&l=UuB(xz%h^SjHhKO^JN%5J{m8?d|M*^S@BGl+{{Hyz)!UQ3E)Hm(LoCwU
z$nTwZ{nIoaPBJKqV{EHVra@iPblq|@^x}<Nc7fOxyvBpRf8DyDU6>FDWf;9M7^SZh
z764H|l|FL-DCra$3~C83j^Zqi!XD|TNDFF<9{JI2D8*L(1+-Ft2&4S_p3W`o<=>O=
zThfV*(vD8XeP9sW%jy}-ym;8B>9W`eiE;PUiw>dMLM6_NJR<Y=AN;6449ExF^p(gx
zHQA4KY@(dJkZ*>Zx>U#l(;F_K3oEBh;{I$d_ulLWV$b<Lhl+Ca@=JqT3vU~Dqb8Yh
z{vXC?w^sj6JO4j^`puKP{_oM_r+=OQKg8!#IsYS}VHq}Kj?cOmej+&|^j`An@MZVM
z?IY{L(8r7bz3wS2C#*y1Ir<o{chlQGIeZOUHW{AK8Z@znj%a13v{*67#bv<W&%RtX
zj6qz%EW~)X5S*dbf7$auUgDU+Nmm}?JqLoL<i)->j%hF|*Br;fFmW&Z0lma5bWvYN
zD$Wx0(pj*AHrZD-3kngz6&*lS%hr9)L)Ar&uFChU76>|3u=5VKyXh9+paLpHF1aVF
z-~V~AfjyO&xyC(D9aC&Buev$%v)*}-mUI&iY<9c3Fi-}c#XC9$yQH4Rj(hBKS|VpS
z10Q*{vQn`D!)e@xMzL*_?}n}~nKBGC^dxi8Y1dNlxRwPSYB_Ch(8h)L+GNEDV#I^x
z2MVw!IQ4>yAi2)Y#i@(;F{fh~YKQzwo#ESt!TCMPlTQgKtMg7>ih?v6w{o+Yn<NVu
zA0UlkN4~A+^KMG+$pI5i$)Bx)zX(<~GzKiI6L;I@FkQ;VOB1^6%eV#tO-Pxh$igag
zX-%USPKKQEsDi5VCB3hek(2XS$v$rk2SOfr8Vq6y%tP%)7!XMqPj8YWNL`x0kq36w
za<%A}ShAJ7d4HfeuSc901FEyl60lXwsE7ebLApZkA#7P<8e>#Q?>a!vdJ=PNce?Ke
zU`wzJE~&b*%YXr)od-xN<Dq|z!|)?n3szp|FJw0u#(uwh+Pd%T2pzQ{Z14QvxBEwX
zZHLxyXThCffBO||EW2Hhi@SRVD4FewG*@tosbFCCQqM7Mp-h)wqwJXDTL|U3i*T6u
zs$GyEkZWfJ6V9z4huKP&1$Rl=j8KfH1+#RC-<>dOiTr2<bO?WfFP)`B@O`xRYWt_X
zT{}*^U7QTXWCSiAc~3IoN`8=>-uCt>Jd(Fj-iV`^S*9`spVD>J+Zqb!OdCoy<)~-}
zhZxN2G9+L6ci~u!j)vhVB+&py1mu*35xe@L?OSg7*_ip7BAL9OIn;OQXNvsKnTEUl
zG`+<!pkDr8d-CYf)BOG4H;>o;lK(%%r*Qwj_tVMV!AW=b`1n%_0B-L6>PlJEI;CVf
z4kK#xE@BDq`kBwcfz2jy4|BO-&tNelZg=-yY`=YVvf-A2_lV7&oP5yg71-Y*EKyva
zeazapI8MTmpIp=TG=SQD_3L0|dvW2tKIZJm9*>P8(4Ze+vK84>JM7R)0Y!T-ff;hp
zD7cgiPp~f^eE$rjQrOSK6u}V(#US0rbvyAXNMCmDN1pC_2GRy6Q3)}cGE72<vC6Sz
z@E`^LOd(Gva4v$$2sjd;TtOHZWOhj`9>pF^I3<@9DydzExF*O56OL!jY~G8<K|%&#
zWI~r-N4@hTj?jph_lqpcpSNUxm~^vyx_KpcxTi>x7EKRu7T+B0?Wn2b^QHGaT8R7o
zeiEdq+NYpsJ}&P)o@@>z1l6{=|9G4Vd^D--Q~n$ZVJV>yRYq69jEHZ;YmZ2tLS5z>
zF-Kz>moC?^HR(1s7F?afbgH0WRp6zJ4PFVE6#2!Y-3|m(0xJj#(h`_sfjRQ8?j&}y
z9kKi2g5eq6^fY<bQr_!;6j&Cx=~}UHHJ5}jn1D50O_kQMUW<Xvjb@gNbxoXCL-=-o
z=m{z~wPM#=WMs%Kf-fa5hj)%lYp7Yc$A&t_<Nc1c)NHXC1f={bC`is51!Hnj0^~am
zi_L09cSlE8F7LIjf=Y<O5F}DiUZyK{*(_7_&X(f#wvX*$Xceua__xNR7mwJ+>iNKJ
z1Qi7EC&J55@A%FBfh7+fZIqlG$mKt{g0p@``6#u=KSfsJp@~KsT851wIt#j&f&UH<
zHBNUr-hBl}$@1(qVrC47TM%H&Vsg<?{JuZNJk+iGG9(?TdMai>iU`wlgBm&1<j!Qd
z?&tf36zxoIv5Fin3zPZ2W?`d;4j<XYQXKX<G_&A?x}0P&@~wR|w$2&Eu~HAgz+2jR
zV0e>6b}wl{1+$%uaqq#_)ajHPRn<4WJkMEGakX@jO`Qe|qa0c5L!0@#cp5XFpngYn
zvy9*|*h6@Q8E6FolwmE7U?VxjBxmDsjL{!aOGCkVfhF^qtA9q>)zls%ap44pI4+>h
zMGXKRIXEtMUmi#WZ4Y23jzvWnRVz#T5#1NTUzJr5ZD8<=GV)igxgI!nJbr%&3}Hms
z(`f}h{5?ow^&Qq5>`v5GX&xFlW0Uxvkh11iMu$l5NfP-_5xi<fo@@G|nQo)J!ba;7
zDoC~s7}nW@dxznX(FDHdlf^u$KNi^g1cX-#o$7OLDm!gkf(h@?il5@g2WLJmV*}pS
zljtq3P2JbQAM#VQa1Rh*sFfOPS#zL>mP*;KIz>P=yi`HSYi}H>qC$IP`veW+c#ISq
zfuNhFAQIyu1il|%0An5`@d%_<c*9D97-bx;D=E(<!9aonrOHEy%N{l7X*>!@+r;%q
z-sQ@Ctgsw>3c*uqmcGT6^jaa+LXHy{#5zG7;&>!(daNKJO$Iu}kH(WM@Xq5)Z-hQ2
zWB)8zBB}&>!?|Jy@fHAlK!d+W_ihu{qM8ooQcO8ExHhW>6?J$R;M&MGP6Me3SibHJ
zB{~phSxk`1m-+3A!2&c+qwHdrJj3EzZ!m+v&ffm3{ezb+rIBfwKth6yHlv4Yi5w#!
zV7GmF@EQ-UHDH|fJ7#DMR@ej<qOYoxram^gG!3qvK^M>$R)lJy0Ww%PLq8kgWN!bc
zD7NGP(i`9bD*uj6DQ1fTI*qy!eC52bZBt0SM%7mrQ)gZnfGjx>=^FRX0$EXZPdVM7
zdnu4tTF}eEi9Sp)*XBJpX(tm;kuY#IV1I3z$l?8K_8HaK&AonJLN4Ba{!=npx~;M*
z70V1GVPS%jCC*NwREs7Kg~5&HxaiY_>IY;S>Ex7%;Pg5RbfBf&nowmn&6Zd~l%~`y
zbSbqMdG`4R;1obJrrBXxSrZm<`?b_BbmVK*5t%Q+(FwB^p@m?%F#oWzU6hDM*ov8T
zQ&6KxO&JC&!z8V#MsT%+q-ek_jH0My)@iAnD<hk-(lrPcW}u+GfzpbXw%h<KPPNJ^
zx&vR>@(X_CH|9TpE~RiT;s-6t^<h?$1%t#Px<JgqlD?eB@w*hIBKx<;QEoWQ4J!_R
zI6VBH<J=L*0+Y!M3;G;hc%Oghq3X`&5?+_`z-Ii-6g7-a^5$~Y@dN}b3@6bG`dvw&
z!xLbtO84&Dn9x5t<&E9lwnpW>Q82<|F%4|hnFyH){?|TU7dWxx(CuhdO@BgG3z)Jv
zMl})2Im##@@h_#Ch@a@a%i>Tx$x`&1CXUX_GEQvXoL_MH6A9mJ9KJ4JZ$%N#OhDy|
zD-~}fki35UtU{hNE3?7+ab(n-IfJH2YCsam^5FT1p@llf(BEQ&bS&E1%<nrCiX3w#
z<VuRYwaaGP1=R|7$m)p-x}86s7-NmHk?<I7aoggJ3-;t_X}eU*LpgIPt)b~rS0Bje
z7kffzbXA<D7V<kfLvnZM8vJ!nOE9R)mzzGIM>B>(ufRgJ%Bxk0QXD#w#OCIL&5TM)
zo^nac^}|9dpxM$em7+`IqC%B0s|rQkYED_erdgXAOa+wRc{#H~q0;+1(Di=o+qF;s
zGv)qwoJ6-b0KI|#_mj0pf8GCnh)?1E_s!A4%fI};|1_T|>p#ho;I{7HQ`Z0b+S=oS
z{WqF~|F!-<z^AbOk4}#E_C7z;kI^IxuEe4P?Ewz)PJ`?X<CJqghJ&!@V+Kr2OcW2i
zcfoav+AA_lj6I_C?!QqP+@X*@@8PrrX9fg@mJ)0<Kr%2Fje^S-e}h9YeUZxqJV*!q
zvRmW7@12OU+mtbfLI$y_BQ*(d5ED`Vv@;BVP7@Fg`Mjl^nUs!3AnIFXb)m#jq!2rD
z$R@B$TVxrDelZ<yksd8}ynpPU9PAw*caOFY{)Y)c&I1mZ#E;(L#pH03!uh&gC16)w
zt_t?ze$WkuBShYU^+>1$9fjO$pFFBXGZq1i)H#L~;ZwRM=l<e!6|dFX9j@*@T+oMg
zjdue8itTLg{IK_G|9~$V3*F5*^W@)Ss=KlgZn)Q~R+)ZdG!#dR-{oG@JBTTvFy14f
z{W#hj26(^MpOC?%gk#c1Gm;L~jRg39;qAfO<Go$4*uUy=_hsO80are-jT}V)eGhUJ
zL67D|5jOlAQG@|dK@nDWOEF{KYl_H?u#_UG%&Zh)j~2fxig*>kL2}L{VRx{4;3XuH
zAKAu2Da-tlToia?`eASX<qs#`mbX@dDIN<45eR~rSB})<TVs=-1kg0JLpDae^KjTt
z$gSgl-?rAs9a;?t%BDZlpI?@7r`b?>ci@TlwYTm)cLu`DliYJudMZw_gHbYdL-14l
zaDdU4E_hbNk_x1R|K+qCGR~jFUzVwbT9a+M>BknnaBm_jF)o;el?1gqo{U`U{npx!
zTF<DxXGcPw#tTSrmi%pzKrNIa!6IW91GMm5Ev7i`aN`J0wqxAbWhc#ZOBbe8RfajR
zHe|mqtb<zmC-J0wT{W0mtJ58_a?sr<_$$|M_w2M?yH4GO$cxih3VII#Du)+!gcOu)
zq|XJ3hb>{0`w9Ud%YisriY7x0y^BV%Vdh=>=<ye3p+5w=?6XpxZ}~!W@WP;?0OULX
z@<FqWOTHM#EaRuwT>3#04E?L1|3HNT<($41i#Vr`#GaL@*YuintOEo@Ues`BPBAPo
z7pr1h+N-44jEm<<G!4^vdl2!7U;~Q13&3=Cj#(hdUnm~3mk<l4zE~5WP!4}al-dmT
zq75j!AT|qVh76R7YRME%1rg9(Y78=RibzH%Gp6DN#QTLA$EHOLgjkeut0bBRME}Pi
z@FIhrfxx+fO?d($FF7?QaGTXFt>q}a*xu()={TnOQaVB`T$oub=K?6HUm}C(Q%T8f
znG!FoN2~3MMrhjYMoI<Ul19|_UD-(GMn&QQzsQnnoS~BO!5=yP_k%I)fMPdZ!RghV
zms?hG@CG6rJYL$;a!a|`V#!u>0Bl`_p%kOiVd)WIh$u%++?c{0>oHAeo>hRyNhlHC
zXPg*kA1#@DnrZ_~*)JMQ+`sSX2qRw<)&{MFcGZ@x_XbOd<fFqHni%NWQI_zxo`#Z5
zipNYZZc6a^Rarss!qFRu>oXGk8~`^Vc;`&8QOP8mVEO|QeA&b}`)bML--O^TK22P?
zUA2W53BDnfPs4q^42F+}ar|yF?w<QeGtBq0EBy?A2<o*(-MipAk9qk`Tj?lF(X_ah
z`&7=-m!&5)n}6_eOnV>Mm^QC0)i8SChi7oiJDo_9b~6&J45M*o3VyfXKN584tZwq%
zn$x=69-REtJs=I4eQ1|i)aZjbMvW4lz*T!No$|G<<fq0>bziO5w>DhwHfZp@i7d-4
zV7ic<ANF7Ewv;A_?6ojCsm^zU9NJavEUlUJr$zyUwt=`>oVBBh@j9NqZ%CqLTh`P)
zveGPD(+OvIdp7xJi^!G7w2|*<sisN+R%B;Wwf8su)`;C@`?*@?R^j_t;%DyFFCE3g
zEbjHJ4zl7>E)-M2Vq6AIvQrpjsrAxuOfJiw=a?MMJJXoV)W6rqza1oaI5v!jevkc3
zCgV8rkmY&I{=8PW94vdU*1Y@Pt99;*N9)8xG_;=)96VD67hw-r1KN87pyV3;d!YuE
z-SArLZEqA`usvZf9u6g8<uK0J-tg5LL1NJT_%gy<H(aymPW7mb86AdDNKTN&H3)~7
z7w!@)u0c4yl`KL<+OzLi4ObchFJVW>qwQrg3Py+_xq{0vrL|ui@+m8_ibYHr=W+t~
zCMqR26y8ItWNGJ?pmQ2M_Gomf;5ai<0fFYUHr<gw=AD4cmv>dO*iDPQ6?i{3qKm4|
z)Bq%CO~5Hw4fnKS%O(Bu^kz{UdA_)mEq0?RFBYP^k5Ci`(A4*S!J;`M5b)NQ-?moU
zRTb9DE38#kcx2sIID7KCy(g>1XK%;(Ho~^rZtvxmcy0l!n3XvI#m88=<fh8ji{m2c
z`<c%|rz6zCAL{8%B%9I|2q1~mZF=_|SqH@o`VPdc$%=vF2>xg9pWXd~AGcra@8(L{
zIi7AR6*cOqB`3|LvvY}4^VjEYKGW<!(S77@?Y|y9USEGyu>X4U_%Hjf5AiA5e{R3r
zyIJU;+8Rtq(@NdFnV5i&1)ghcaQx5Xos(DHA76J5f80CTIeh(k|HOcMo?fRb@Lw+*
zE}w7dXztw?z*E0J-tAf_dwwxmxfpdZSNn*{^1)l3zwb8a5C&lBWfNn?fgXqy`JKGM
z#D%IKWE_A(3_sBAAk7kVM}5BOAr;u6Sy(2#7pLOmildK8gV{6vyg53AjhYbXwdlvu
z-uABdACJEO<7ofH2?1_Z+TC-i9ULA&N$CYl<Gm3`pWVUGKTEYf!@4EF9-_xL`>>@>
zcqQ*)c0TTo@XVMCuf$P9D29?hy!5YA`bzdO{4LH*a0Cjmq#<P<#&v?90PEz3H{I8V
zyL%?MlU0lkmOKqz^_U|D9RXv()FaY@cv1g;?U66qvbUe$wa*3GE>g6nFW9HA=SSkL
zhK23PB9&8Fp>85gZHl4ZT~Hz#OukU5A;(Fa#o6^ZNZFH~JE$^8T3+`_FbEQiPu0hm
zQ85OwL_kCzp~>jy#P|?uOuLf^k0iE-mK6k|{Q-gq>7LZ|qf;4(!g9Ej)2wl4-`?Fl
zTK|6gcu(B6q$P@Vsv-syDk&d$Zq}}%JPz&n6*_|j3jFT+VX4u0lUnAT+6#Xpm)F9&
zdHyj>kPmHh#7`e1fhq@J6<Opg#CuWYQBL&DQA7y_z3t#l^}r8@DX9t)iQbIzrM_;a
zU;uV=Erb7#_j>O&@So$oqaXKx1+~<8{zfl^-8=&%h_x$)BS3z|d`hcSWnlk6^#zUv
zW1PL-e$#!i|I^+sU4M5>?6Zt+%J~Nl^r5AMVL0)?3$DVH_%qPW82+X@tQo~*x%4?p
zD8*+BC_0-es78+SgSkX;p<(hOJ+vYpepbe2$q!dD3nTH`XhWDC&oJDMhu&VRu2LTB
z8ZA5%5y9JJ+-&c^+S}DO!q&OK!~@O;kr9w4c#OJ3{|7S3UM~px6govALz1Lo(ptJS
z$5)8*gl^FZ>*k(3$244rXt#%If3b%u1_G22hx)x)(QjSA42-EupirrjSXvc~B}>9l
z8E279)HZ(^VmuT3feD3E;5TKlGzyNaUu%#Yph*R~Q7xmVt14jvHRQNL4)5ZGs$o#-
zSSOMX^vGeW#v7dI7(;>6FqA!%uC|G|bga_Zk@|gk*di{O>z*4<NGLuRyp4E*pcn)v
z;7>UIO>0mX>09AtNrzPsW0SsNzGXe&)-A-V{+p&M>rM%x(J|e1N5<S-N2Rk3Y#Z*i
zA8-%L6Byz~b^w&frL9%P{n_?~(^;v>BM%81-8=>;Ly9L^{fJ<ly8QdMFZPa(4k`RH
zWh}o3PlF_hlh#>~b>UkSqZxTV<u<VwH!1Vtb9Fx1dgkpR2xMG~`Ee1`ShPmAsJhQ@
zcmRvKyZp4(e&&6Z{wrEksk~WBjl!yb3R0%JCByG6bN5wXKzjXk(_wtsvN=i<d8WXn
zJf1%wMH47%$<yZwG*SOPxI~Fis$S;fuF#HQ;5|2lR}y&2l2Y#VV=BatXk2*~!}+Xj
zmTHa7up8=v0C4QZO3c4<JQ+iZ7D(J$r3BRuO(gTV<mC&Q?aJLFGz2pUcSEp8^4^n(
zRo2#K^LTf2S5HYkGK-qHt#IAqewL@Bd5FhWj5R*0mU56h+c8MB7>^NG`vKtWy2F8L
zy~}tq>|;<oPRWiDu`oG<9TAIimE(xoz|X^X0f9LPvhR;U81&ON%OfI-_@^mF-vyyh
zGQAH#rsFss948;aUB-!6T;c^CJO~DZuorTuSCIl$C@(DudKCW*&WIr@@u*b}I5)%)
zU_o{sQ_NT+NBUZDqT?65Ly><8@!uEQP$VV%Mu37V4y)t+5MSb%xFg3lIx0iMDIA_D
zH3~}ZcyzmrDb7f$BG=_M4+-8YBJvPDQqUeUNENa`@Wd7$q}~OyJ%Ykg9`+rjM)`G?
z#Fr^uCj!&xlT=KF565uOMd2Dd0`tceY0wxAG)x2W4`d<H9|42ORLX<_)Pa%&=+y7M
zQ#oBMjCPEzEQjFa09S+<d>HHYIk~|Y#^l4i;|!<llqkWn@IWroyep46tjU(k<wafs
z%8948oLMRisl{YTu?kdf5gopGalCiJ5}37$D&>!YP>t=D>?9TZ)iSr5nbj=JD5c~Y
zU~CoT5+_2PmJ+l`Tq?WC+ngDz=w)cICT&|OLnQWB<bLz%a@AqK;K-R1N0e!;K4|Jw
zPVMoVPn+cj>^2-tTVE7qH&a`kR@-fJ8qb}4XFvFwNP;N``<{9L_Wone`^s8SABklR
zGOXg^H-}iA^g?Pl=Uo%*=_V&$sjAPtDxOnek){+X*#w~~>0u!ojyW9^sJV8zIZVK&
zejDEslgkCJW0&0;yh;P+!Z+&C563Ua8l_A_TfPRX%PWnpt0(z>5&}ul24xh<UJy|X
zZ6+G6{ueJ0AR?}7f&j;nn<|KO*G7>tjZsY1#+`JEnzkIlRU{RC^Y-W^W)<E2asPO)
z`{HPCuWcC9$nRgk_HH-Ho^IGVtV0!;5t*Opz(#BZAM1wP_k6y>0&S%<ZPdZt!-JE9
zJ!Ay;?|c6uMa&lst91W&@96Njesnwv(}?Msib8K0M3k;yJLug<UIg5U>aFMoxc(rh
zF6$X=0mqm#_|@L=4pOKIgNeKD5RMf->2&+(&C_4v2o8$HFDu1%p0Bym#k5&2iXP{a
zv!IFKA?FMouiyTyX84D<FZZSqL!oRHMd0p|yO5Ra!8}n2puy~@cJd3sp{CMhfS75%
z%NRVCZ($XfpG1Pl+qPuwX2qtW_*0(dxy<vy;gp%ydq~MtGk%&+fsN0m(=BywFyU3L
zl?yQaILi8y(FZ&3<R{N&q`Pllzp-Nb*Dz2l$rCrry!GSHZKN}d(>1nGD)%mnYC0rj
zPRu&~=kW;$RQm@n4xu6p>}8N0lc=^I4dT}QG_=I3G+gdqz5$@ebQj_7Tb3n@*#*yn
zj4%)7TV{m~V>pB8a}(Oc#L=MDJr?sJNlWM+h;oT6UcIEU&i#X^m)l&)MolA29eWA7
zN82u&?U=BdcyPQJSw%Lqt~&i4g_HDm(NxESmQ#?)q7-Q;a;WD{&)VGJC_Mdnoh}XV
z+bWu$@E|t$$r?U!Dhd*%_fV$et#`cpPKV%k`a7qX$CId~m2v0{V@S~@LoR%jfq#09
zW-+bBi_x-yzBs?;#P>-1<~m@#``+r+Be|ck)86N29uDy|{qEd%;ZSjS^iMHAd5bR6
zFeZOEM7IPxP1(QWaS(MV%2#g~r@?zHKxPNyI88&z08P0_7bvv>yE^2Jr05V%85B4r
z#4tQfFmu8=In-mGju_*LiP;r)gfc~QJn7U)KvqVsr~q||b%5!c^exodFB=uo@LOO{
zxHz`)Qo^D~#25}8NYSo$*xh+`xcAfE4qh}2FdGqO2WczhsahRxaRvK?=5H$(qZQNF
zE^8uyOb)w8z!zWr)1#>S1~Bwn-B-=00j+EqP^M}fj(X6GV37>qfcv5gr^^?+uwhz{
zUgD#+_aE=YuH83eKiWL6RE(d7Qa`&HQhkm;zkSkuvAgq+-Pv&L&4}PzG<KKx#$MN>
z4m;nP6J}<Fb%z7D{4fXolHIX_iNd}lyHrG}05?@+KK#`k^r;8;OYWX$<`u*oVG?XQ
zqGvGHz7YiIQEO0$JILL8?ll^fx`L~p7;hB#n8G?`kF?ci-VXtAWxQhXOkui7@z$Ps
z+k88ff3yC~JD|8{xfkZFjVPnddDDBa`T%cItOsikoXyF)aYzF)1LfQU%9duFl?bTn
z9-fRwH$815s<KW(i`MHhyHOjd&RveG_k{%(RRcz;r>v05z*bi?HwGpB=6k>em3DnP
zWW>L7zAUX$f*M*zrDti4Xe$mtRex{ZK4+AvL|+jpR)-6xLAT3!dmCy%(~~6&=*)?7
z<{(V)Xvmx;$b52f!n&gIZPDt^n|=uApjfA_ElL!-niQoI{#Uff7X_}>h@G{8EMepd
zPljU|U<1M=H-~hdOt8h~+WT1^{=$(7p|y>AAY6}O{LDXoQAe?+FsPW*4F%w5di4u~
z(2|$1)xt>Hw~@$Lz^jyvcxf#XXM7hVQ7~K?jaEPmjZ#b!i77~c29V5FWX9c1OiB8x
z71;)F4vrP!#m%dV5I&DR3k3V9HyXFNEBOiT=+h|;LryBZ?n;?KfqS@|siHL|!do=P
z02;Lwu`$Puo1*%rrAi9WJC*eUHgV%PF|{FkFUqUG+<Y0LG%@BAN`0af5~{!!8xC;<
z=1NxhHZogh-iJo9!|8T)r8gP2`;6t);_=n-o1^_7w@>!u#(DeT@L;3zNL;E6$$7#s
zLP}I3HJ4a*C++t12Ivsm-mov<-gFNR#Sp*R0>Qp--*hYSC4st%ll5HahpSjyxR={Y
z#p=u3CBm?8NE6o+$JiTIU)5SR8o6w~D(g-EqB}sZTbC?tgF`lF=6~;NSemx-Aj(V*
z?K^uBYHF{G73{(lxZ4=_N+qzG;!>nX{=R4tR0?*ZJW%+@c8UB`eWv*TYKP3;c)Se%
z-KdQz`CriK*Y*EhUwZ<t|MLI+03YMBN|7M9EFab=xZE<qko2~&^X3ixXB=RA<KZO5
z|0s<WEak<WMZBoc+tr6mBvI&-Ijyg(c-uqe6&ojFZW^W-dL|$*#Ndke`eiEohBd-u
z^6RJGdD!m<kq28%O1_KnKqOhRW=%O*^OaT~!&A)8mH6Ixm?60Ad=kC;8+^kbf~js7
zog-tE(WHJ`L&70qQ7GhRSrVRNj?q?&JJVWJ#TMHgC<XgX2%QawVRj8Kxvz_4FUJio
zFE6t_az>#<Q)O<<W<m<B9(l%MmezEc)f@L7Dtw`>0*I3RXU}Yn#zsl0pMPmqu28BY
zhctSQs`Vtkgje_5a3)17<Z;%pxyFDr9Eq8&^)}N=LZgk#+S;I-^~-Lp2@E<s;VR(F
zr2Q^gx2rU~Tbthc>e{2#@6i2t=j*T69zRG4ZT%%~&a4rVfu@bAFxfMWrmnVHx|;hO
z9PS@r+J&5($~i2-VQ_f(x`Yx)L=!w&PH)gQ2rU>78NQ)ND6SCnT)$w^hfy6|cDbFz
zlfNkKz}kAbv$OPg`CH-xy`dkSd5@P@y?#ulnPl5f0MJ3m0)nP=Bv+|xUo1mh*c)Y6
z8~g?yVF=#t*~Cx!&rOjn3LM;mf^ANvs(Q95_;lN9so@x~`4aM1pIJ~m)IbeBu>L79
z>vz;F-i`g+YF>^!9uQjZoMH?rLOq4UKC_tnB2Eev$zaaY@hhIU$zss57GX)%nHCD7
zr{+{m5HM3(3%aS6b@fe?48Y(BH^x}Y-gBah{q!K-BVyY!M7I6vAKU-LB(_9pLSlfc
zeKg3ZCfAk$R-m)uz{m}dBamT{FAR#?meD+uru?#~oG9CB&-S&cXV{jti45sEiQZeP
zXXSv(c=`=N-GEz{w1h{V+50@VrWP9P90&>~9?v~3UVIgm%Qut8)o0loDuH^p+Hy+4
zHr#}!j;VUdDV4Ym=9lB%#hVi7q>`MB3clm5JS2_7=EIfMrYQLsz2g1Q^I+4dLhNkk
z=PBnujCFI{^q=+Tzx78?zj^#kKK|3ACr|%6|9yy0@pyOg>hsI~M<JQ&i<m^o4NIaL
zvT@eIx<bG>(Zz2{DPklbJi>UV_HdGgL&<eG=eRbxKvHP51i0;jm`To1K`%?mDP#~s
zk1oUL>=_nWqCzOfrb}B7ZQ~{<%S3ihU~M=do9L;Pg+#yAK%wSC{lj@pN!|5({&hED
zjl3Tyfj7r7!c%geomiuOa0TBnP%j^r7ToJb=oXchV8tMzxQ|*^IVn-hm4Q!|wy07Y
zUGA!2b1IEz%9r!~ES*t#wkm;h+8o*NXxyBkyrQ_3B`r5%9*uh6wglXkuJkwWzWV+%
zwe?H=uw)+Gf!Pn6;Q0#+&n}wt;ERa93zDk}qlJllLXa(@pb$}uNl<ZhWajAgc-V^C
zI>N6NOfCBI%Pw95Woci6-)l*ar}-h-oXU?8nny+$h8pjqSrUqe{jn~9zn}y>(4kz+
zOZYM5*;c*VKiJ*-sj`3Nban3`_L-)`joE)sx;3@?nu4(_20^0MYg><kaojt%AD}Pz
z8HJ+2lP2DlS}#ZbRku(ewM+1$ZYHr;`EI?sz+gB@&r4ndF$@SNRquQtg^RMc#2?F^
zOHi(|&gggJl9yWUEUjw2bt+5d0Ul+1It(wuc#@Ws;M@eo=NKxy<T2exQNp6)J9Ui#
zze?UB+A1D*hvDg2uUGSS62V5;FDXFVRmt;7miWD(<i!>D(tcwumdhR%#)EHc6QKM%
z;B<Z%<)4C3lz$ZQUYdUlJ78}-DH0OCt6d$`v8gMBIuj<@HG2K}*WFR!?P&7*@6~Tv
zTA=tkHLtqxyHNGlN%SuN3_bGl&x(_WPb+4QS90NLabAXJT_tt`l6V0FnHNR@<%Byx
zxx(b+s8~HiIeie87BAry`juh;+!++mN_s;jQ-3rb7J#U?B(`4o!_r31(4VLD4Qvq=
zb%udom?{}eZ!&Ti5#x&Eo|L>OvRDapAEa3lU)yhp<h!9QsFuAZ$}D?9SLS6ek{}JT
za!{3>$Sqj?xN_;J64lE`l@KyKkK=cx@0o*iG42X5KXiy$u=jB(R;ZbFPoY-GvEHg)
zMoDm1Y*ber`lnLA(4v$nsXLSbh1FGck&@~qd{Ev@L3TO~*J<~+i63Py!O9zobyj>_
zzVua30Rv^NMCVm6WZY%%iYrFpijs!dFB<TQ3Qj|h^XtEyE6~%zN~vTo)r^U^0T~R?
z1oG{2`KPpGROIvJ<@ycFCBbhKSm$X?$)S(NHck4-C8zgM%1!N~lxxsOB(d(V4VqR3
zr?#yMHgB8)Rh%{HCCZPD%Hj49G%1O^sYy8?;btXaFjCTHSfyp_CQw#*qp7hAPbUql
za1$Cf#bIQI@ze~?RH=a*l?ai!B9k#$yj2&-ZKnCRm25s&u$tZH3XY4MFkgZitt&u{
z)pZ6P4eMA1Z{xK^c;rz*a49dQ?BJ&rBye@jG9ITkE5)Wa%LS)4d+OIhQM%W<hAPfo
zxni=3pI&FRoCP>VNEyCr)<{Y9nq8uT>Ix^aZZsK{9nR{CCzGgAStwV!VRLzf!Rj~V
zxHY&c)T>wrhWxcQ>h;?bK=bj*_Q`Qq7w^8@J5ai*e-)s7`6Vi&aQyK&ZQq+(>e2_f
zXnL`946>}>`>jE<mr;;()5|dHo!6Jn;>;gX2fD-#YYXEUbcUi#FGwt?w0t>?PyL}s
zDt}RlD-<8TA%m3~R7))Yjs+LEAiRFjefjF}`|Vd<da`${(mx%(p*G(HiARg#hRs^c
zqN@GvqrHReisrYe=~Il)W;NfSIoa%~md<olS#P08-qKx>jPFDVjdDXT8+w>J%GE9(
zY`@;a#qn>nk9gm?7a6@X<@my&jz+C}PrQ42NV}wYUr`P}sO0_f%S>K$v$o{9YuVcR
zwyN0C5K;SX>$+Re+^ULA&|}@Uy2d)hfck7eBQE;D&E4x8R1IT{R*nFR_Mj5`3~ENP
zm~8sw$sb37c=0>R>{bZaAQKosN2nClQ*L4IxoTfZ`6#JL{!J)eRBl*+7aV1|9{GJo
zmnXRuOP3U9mB)KbV$!TztZpuL3d`o(Fsf;*H@xxWI&U8dXXs2xKWH)KJHiS|yAx_-
z%=N=;m}P~>Ri(#vaZAsgD{t$^%PZttaCGKY6`nmROlymfgMoOhxwXq9ei<nx#Ys`v
z1nZ)gF2Q<Ec@ItT0xVbUJ7YhcoayOu6#X^@!wD^4h_wDz8LjSDC@fq9ScNV9f3CQF
zGf;{^Q<U-MmXZ5`98mk_pris{8RU?byHBvH5wp*ChHn?FQmmQIbwt$FRxwdk=gKJs
zb_1#)PvWwLh&K|tm*(QaURe6lLN%Ye%CKk568Y@XjwooAXOYe>DVH5K@ujKLK|K0d
zuSMBs!%+G^dlIcX5WA>zH)549NWpfc;-!g0v}G424l>HGRO}%;=T}8?B^NDryUtP8
zu9G|D=4q7gSL_bjH!|g=={BaK3g6UN_3)O)nL)a?u?paojZ=W`a4J`cb)!?gMC=Qm
za+WNGifmYD*OYK+w(8o)MtSAckPFA?hV34?_eE9gO<x}6SruO#IYe&VC*@1K8-4zY
zDPOv%GPXxurB!wZZ7F$kD6`eSC3Vypw5*mspXPf^TIs^@SXZ4dOSe~rvV5mi*boB$
zU7;vlauqS$n~X{jjMrX`q^L>}lNJ727;)~+swGQDq_p>Vy1B|hQ}<a-witEWRMJ!H
z0!}qhb~opA2iTSFw0l!$V;EILg<`CSa`qWGYZZ#|39K3i`AfZuP07CCo65v1uKlJm
z@`}qqtDb!cm>+?2L0H&-t&72Y#p2B&Q9?Z-q!ZXyyEWuc6mr!SWCfk&Ou4wU1DKC;
zQ@|9-Ro`M3JBjC9caEL=P+J7SD~$4@d^>7yqUu7_!F2JubT%~C45I?q>hg64gmaZD
ztWN=0hI(_&+YtS^d*NAeRNG!9p3F`2Ot@0js_``ya2d`@5A}`&oVx^X#*qqF<INaS
z;lkXiCO74|ZmIion}_>(7A}|R1-Z?Zl#18u_KHL$T^=T1w%eu7RWZBNdA`^wpHPH2
zWVY>P<iJ!{V0p0m{>+wa_?giV<bg{8yN<i*yI21<Xu9*y6%#{%CQ?V02B}&CY#{x)
z!e)h_sRTAtCNHd=6^j%EI(NsnOcAUymOyDrl}VByWom(yO6G;t2J5%nl%V89o>xmv
zv3{^=&piUw8bjFC`VFe}i`CQ>a(zX8(R>3Wi7mtINXnaEG)9tZjnNoMu5rc;NXlDl
zFp}KsExO9s-9Fjw9vtrOwd5ez#PHfvw?14)bn%Q!QpT%Z@@*I`7g5uDrn7c+xi)*>
zkzy7AynJc~fv(ibK&VT!W?=M{TNx<(mQ8`HAC`SB_rBu*%w5Dyg_pm$%Yk#Q>ZXs?
zz1hnT*1pVZ21{T4y_cdZ550pp3pf$lmlz{M<&VK;Ip-XOfkW4L;CmNgKcK{pP#MX!
zluRq`%VuK$$^@rG=&4=CIn$=b>o{lWG{ZtJm_FHCHXAwB*Ho5JcAI4LG^Ihdi*jnQ
z1=O^9Vkc$SB<rOq_1MD6#Y~fW%8JUxOM{x)s>%^bftZRCdpQ86yhhs(ofaC?V8aeH
zJU5ipEjc{Q)I{y(YFUHLy1q(m)SB;=MU%BzHq0^`HkYRI5_mJSw#J9anb0_uL@bNB
z8<B~wKb=$xP33JZ%H@sQ*jda(kP5yvl6(&ttJHqSt3#{XSD=puy`6all`WgxeNUC?
zqkXwCR$@R&1u=xI&^(qHMNU2L*PBXCJ@(fdP&%i2=df2{Pia@6u2hw0>q@&gHC<Jl
zZ7rQ^IW#J(C@vOf1;uD(1#OB}KzF1y(v`@L3hHUs9J6+&wDDx2I$KNDwk!sfg-NdM
zv}4;@tXkjcoW*CMdTpm2D^TZhHVvxQ0GWj5&-m80PL+x1luPV7v(ciOitI!ysye2m
zuEK)sAuB0P%q4AIGH$(7cNi+=+F<BAle&$`&&{_{sky4E5`m;d$CZ{SxhnRjf}j^z
zm227kjW_Wd?A$lmuBYzNGstlzHoYa=k+BMP>8jp<*p|n{P`F8TGAOo5+A<uTR^Kr)
zE*DQqrIVW&pEg179E6cN8Kkmv<@(Dq%TYp-V}9zQrr9`WP_C6)-IZ<fg{@t&OShc1
z9B;&Xt4)Z?_+}ZqEE55m?)+sNewmFB>RpPIP;W3)%i=U=vv6*%d#d?qBPD+l$E8+b
z5?4W?K!sVbFPkyUf+kN6y3oXY>K3L`)6J%=riuoX&LNTP=L!Y+v0X48XT^O09#)tX
zIjt7#iY%kolFOdD8Fnrt%PoTJa(S~LqKk_CtofE%MJz?YSW@wD=1*8seW#-O$H^=8
zmG;9sFozdg^5Y;&y@!1m-`C#5H0e=57C(zeA?BU9UiQ2b3@Z%(PyIol%*rua!gY2|
znd4FflU_%?^CXVYUd21T=4{)UxK21Z;wV5KML0rJA2EmEB|3TfxRv{j*7DFfWeMRt
zhu&IABu&K2lf&2hJKeWWA1~aSz}`uPdy}M#gWU9ZY~5iDyDK(G(524N-mC4O_I5F(
zrBf5}QmhG2%W6uoG>enKw4gfhwE|dDRgwVkY;4j1?ZlBQ54~66yWkQ|49_^!vBt24
ze+rxj#0G1drw67CZ{wD&IZ%UJ(2=IPil58aO3*!?hHMEvlt<IJdZbe0;kYEtGtr6A
z2t)jR($e1yUD!{AB2@az@<|6U6?1M?E6zAnYck;qdXxFSi%?5?ildZrGc70?dfn$F
zyeedn1QYJXqp_dK4-hiLKHiuk5)}l`rzE0u1LU<r4wMDQNe@W?7!@myj=S*d8K!LT
zC_k);iCb27cklS*=<uI=yQ;>TT|<)0Jd?=1+(pXAg^?#sbTkZa#k`-R@M7+@dzcyR
z4PVB1{a~B~B%FD;MPB+zUk0qgix1*N>Hw()Y09@cfj0{9bj^DKkO4c_c+#9?;gpJ$
zi}ND%OYmWHPt0dN83IhxWD<<x3-a9Yo-VJ#|M>X|WnEEdv~u65>0wlC)u95bzuiAL
z>Av3n$%5jdiTb9(ZF%W=JQ?;m*_3x0P^M4rE{1<+?;ox=0z&6u#~}BQeIRqhS>i`$
z0bY|q*$|M)7iSnVTIyLgjl{Z8Zgs{iDa^d*Wh296a;-019Bgh<b&Qo&f(ps-g~_NC
zF}Filk?Sfhv?4ewb%$@qWGh)jdi~hZ*79pC<ZRkyiOmhi#mH_(;eyrd&}DVYl<Y@n
z8QQ?0FSt+ziC@U70i=CF<s~$o=TZ&-{kdcSszn~cFB0V$K_Ti1lAXPU7pmpW;YmF3
zWYWt}f}(>0a6*1=cisB2k$cA*PzHm-FZA~PMg`o5_`}l#(JCv_Mm?AW)Fy1F{RqF{
z35BbjuAT*1tF04w6`{bp|ND0P;N<OVrY{+J4j($~H9q2wOO6|uf%{l~Y0Dipyn^{)
zj-!j1f!iyXp|qUouO6BnlNzJtswmaV##ET%@*zo1C?O@(^SJ8`3*Lz001S~dtxln8
zt4~PT*0OZF!0FM=+pukgPba9;R;0Vm^9#*0(9O~v1h7LQ>HPof{d;@c#+5jZ_h0c<
zz{+<WQl@0txpddE-A9p?RG-?iSCX5wX?}bl5|R*;00WScm9F3WZ_Z_A&I|?@O0tvg
z)_ocgz})A|nR7pt<1dGQ@0pIYSTi0=AY+H)X%ZLiR+|TRYzpx)_s4gK_%bQsrTQ;8
zJdBZ#DStGNXu|xHSHsbOM35QJE#T@n0tHx^Q5_6vEduYcNq!$jD6?c%Dp<ZRYS9tV
ze}~bwIlB%Hq1zx-PYZBJB&_e<KuOl=wwIf9ET=WKZb_bFpu(x0;^8+3hsV)I&pFXx
zYV1t6zNx8gs(%Ps?vJBQYINYYDwmNAv#9k-qE8=h$4EuFu`Q!8Bx?pwy|a*QD9}{r
zY^?%>?9X<`%|Q;b>ggEr^zOUo!!7KBf2fKJ|88vt{ZKUmey=#T6)NomcRf(_JUYnV
zYRatv)SM!)0Ma6$vv9}N&j$|}$9Fg&52{3$KbjxYpSIX?C)zOA&ab2ecnomWPwA#<
zJ!Tzy<4Uz{PHxiXq`6J+_;zhoS7RzvT<iqQ>LN#W@_zwHcR~~8gl1X64CREUT!S+(
zNG?*u?2433YVgKAx4@ccUEG=vo<)JR-SNxod(AD*Z>y#0vhxb#%W7G=0KKyKa>oS}
zq9=k^Kjb{!36?Pzazhcmnj1>+CCw#1)MDle6(4Ps6HVSa)3!uzpiV5ScomrM@OO93
z7aQH@j&;o~(r*}o_<kJv%<N-ZTUrNF+nQ05?C1nR_2SP;>vR}#SGLI5z?{Iit)!)R
zZqS#`72KsaZO3qn{>Yr6OK)uWuydn@MBweTkh0{>CdMsvT1dC-ZTjo7kh0_;pi*{H
z9iT@CVQ4mtrk4AaLuHGDWamdw82-^Ls5LB!3gDjxL#I*yB;Kq|HK`7kZ8yapz-iZ>
zcC@tVhB>sAO>JAo45uq5BJFMiCSvt(xAvrNxgJ+a1+*`y;OoPaqqj}BA}Y7{(T7@`
zZwFr?SECwAwr;d_jG-Nb=+38BO=r%B9jD5quF9mgN`=<6mE2FaxE1Y$k<F{!a<5#+
zU2kc{^wzNVD<MU_{-*WNRGdPqqFudR%{@$R(}UUD=04nFbT_tcw=}t{YuPc&GoU3&
zF)Q_hee%yDwL<2)kvNF*y*byd%&BR&!uQDo5oQWQbtg@AC(U*Bk_)!4h1Uz8%24B)
zb*83k+U7zeh!v;LM`P7y&50tJbZB<yK2x(W_^ozb*ny^bS-4PbBk0*u(>;ExtI6&(
z;i~*`<-O2NHgAS)yYp^P!`^n(5nuNMgQG%l{Z^56sMMhTtT{5kibSXdT}}NXR~=5J
zh>-tuZ++6<`sC)V>(koUzHzVV0!LH1-P)2j1WLhzt<V&1-UX-+jUt#LIa9~t!V}WE
z!q|WSMvG=p1Y_kb!;m;8EWHsb6qE(Za-Pm(Ak_p_*|Hd(HX7SO@6A_G1OjB{QMsIH
zWqui5CDSRI!&F+8qNu9$X(%QZR1@3gKu_xEb7iO*c<F?mam_9Cjk;5}bXuy_my7w!
zR9*h1RE;S3Fyj?NA5GKj-Cz*iQ$Ps2XBB*^2{cJaY8weH1+}+h#FwN243P*s0b!?C
z+G_7vwxqW4q)5-tlS1#G$qq_e2n$is#SQH$vKEe1asyYR$qG1OD8XGG7)u4n^+k<&
z-H9!>npV-PyTKj0l`T&i4P62s9z57_%^2*O2abN#&YZv>ema-{`>QJr0zKT4XC(R6
z_l{qjm3jBT5~SL7^gsVYaM(I1ZJOz50`Zkp`qhq>G-8y&k~Z%?k60Sn54Bh`uxue*
zSrIr_&um%2cU4Ov=<~0;M+dv#yxdo>k9PmoH*F};rJBPaNbDfU_Q1eq5AdeNbs`Ax
zb#$euHZbd9%O=E%r`K4mdK(P3dTSnnv^crcIJQ@zB0}fbk`g=(bzSMj7=d8|?QJU5
z<sVjVy4xMIwr1>Sv>np3s4s?PmGeDE<>S_H5`3;1yBHm=%~PZ~U}N@D^+wxSGCoZW
z(P5T>uI?uJx-Y5FlJzzX9&>v>haRk3&#hNYA)P^K?SEf3t91}hpGGgg8@<{6Zr`t`
z1xi)>OU<J;3=>6j6%oP>=IhAjnkOnHU^g1HBWDX3n99zy2=7K683AESC#3(l*<47o
z(mD%LiQI4&tZ=Dz!o9R!B~s{pw7>hpaXhjPLtvEz0&$Xi!?+yg3<5LrslE@zcGhYN
za-1b|kIC!Omv94K;MM{yEwf6eMkr%LFN1}i34}`MsA-nxnC3u=(cz~xiCa8AA1~gI
zs5fFNpu_Ne-l0F;aJAn`YjzNoEyb|dzUWcf2h}X_3cddXgoQ58^o7@)rYm4k6yf-N
z66IH!FwBpq(9kszj{)A^LWKkQ;h|TDtP20+)TB*f9Y@0^z|G<ilIW}iWTYj0;Iic8
z!wxq?R3Y4?WS}SMA$6i1ni#;d_R!b?6NRYza&FQZdTK}y6XuB4Jgq-jIV<93moF~G
zu*~9YvI#+y!LnOjL<t%<&vV4}Wuyoq%m==lPN}LfXfBuYd0s3ubEXZPw|d%i*%6AC
zp4p`QAd3a8HnUngR9P)(fm+u)8;b(>gN4`5b2ZUve3}433(SI$6!fZwynss#NCsx6
zS%AKI2+pg?2vrm4HPZ_9yy~nf&|vo;U6nYn6YRa+c3MxWh<P-~?w?HGCpo&;EL5kz
zrqgT0L03>}2=@GWF+m3b@DEVq0{hBHea)iRuU~DB<7KH}DJhCvf!!GF=*MaVE;tFQ
zDP(Or47eL;R+sSsGQ1w^>91RG*|egi3{t;TSB`SheU!%WLl06i=eHTF&!kL@Ajs_f
zi#+>$p|<1ve2UI#dfcj2Im2bPNT=ZPz-OHSK+&yB@Q90qIHb(U$ARPnPt)gHj*Ek8
zLor;i*9H=PSti9bKmr3&qNN%DUCA`LjI)J?gD|JBRwUDi0OP6QvDyiUbelP*I>AZW
zBrsX|-2E~gWyw{IJjqanl0&joTnOy6j6=P^QSS6)-%q@|#-*0TZ4<V<R`&p2cN7oQ
zw_7DA&<n+2Z-DtUac}GjN*^~iF!#=!q@p5kyGScPN#>v^ht*Ww@dYZ|PNp+;wJj#O
zqS80ie|L;uT7oIx)&Bf!t1LX9R2%`UplSvo1=VYcFxmfQnO??IKyn}sT@>SsB3n)s
zr;jK{bp$xPzn~xVy^mx0eCu<R7BU$8DZ(;O+%o^z{v6g7h6wG@hzI>XcpA<Zh58MZ
zHY4#uRn!+hRWtfS+TZ=d*ZYSj03sn6QxFDIg|WJBxI0zR0WZ1$eiox+?xr30S)G;f
zMLL}*V2z%$99`c;cB#3jE-BWBF2<VOne&+SE+Nghr@I3rfaRH5q>21Y6Zu(9#2cS_
zX-;!(msmKm3I|(4H-mFgP(`;cPFC%$+LAt&0OT<vM1cEr|GsHU70br6Il+J^Jj9X%
zsS;k(+l9rbC+v!jjJJMVyqu$~h~GeueKAd)OpAAYO)Jn8nXQf-Ntu4;58Bg9m-)~W
z-NQKNl*daVISYV|Xijh+0Nmh@&;EitE+}{*P&U$fDBz+R4#@lPnPvsmvM=(b>WCJe
za)dqFwp0_BCl|n1yFY-G8T@7F{qqQPeIt}TuRdcM5AUTnEB{nr6)v07H!RK=nJ^=t
z&Y{5?Sj0|7?@;v?>O9<9FcU!53|gd_HDKio)#y}pKj_)zbp?8iq?kd{3_QkWYgHXU
z^H3bID36SsG|5You!8nME6M*-ov;~d`;Zz{K%>hm>T>~(opVL3LXd}id47SE24=nE
zQV&;#bA-_xJjoUHOgE%Lz34QnsAfGK-b~o<=mB~4+Ox-$c=UFT9-Inzw=BJji}1`@
z1Ps9H&Q|wR8F?*nNEhLK)%uT*z{TkXS6$CwyUK-klN-;HFxwUK#Uo5KMRIx#5a1{j
ztMmxyDWZ*hIuYcCdQt;qii8R%ddwD34~VH9a)iI(R<c6FrE~Du{0L+{AeR^WZ%+RF
zldY$YN%dPBy%OU8HS4Lx4+Doh*!^zz;IN)N05@_qepS*L%Z~JdwS=Bj;?Zhy8bvi3
zMLJ?rnp$BmKEB!NdKW0tBOA&evANAhKj{{+EQ1|P+8_}*Ve^vcbQ~BqG>mA^^<GD`
z!@RXSj?(p^z$c38X0b=CkVOHjUPT&XnJ%+(?$kts01Rt1a3C0Z1WE5{3lN8?X7vP9
zbK&%(08KaGpevWgsK-`wma9u~dL3Q{F<CQnYTP;74s&7lyzAL+K8N}Urypr`LAAa}
z3KYkIoYY)P2wj~CdRmoFNY6J?>Gs;UJw1JfXfXZhCM0DQcX*^aH|-0*yONp*oGF$s
zRZC^wo~n~a1>sl&uo&_kP<2K%3L66&O^vE_Gz)92fgP=aQ}u{fLaJ{Vf4(~S=BAj^
zNZZwqMIX*H9bGjCN2o!j3oOhSM(gU=`Y`(b;N)=s_;_@*d-xYfwLB!F3a4ffXYWSI
z`|)&HLL@rJ7)6Lzs<IarwHWe*pH*RF8v&v8^Wt6AHo{YR*iw!}#%U@q7f@<62Z_<5
zt;s;?_NEb-yS8i#`wf4LB-I<B)aeflD3@-gYS8JtK79GN{y<T(kgo#%{exj$!Kk4l
z6u(E%s)-dYs3G&s{?V%)Q$29h^rsJNYr5En=t`|c67{!5w)yXm4o>##h6JZb4vEi`
zz^@-`Sg8E^;q}o7$0x_eLvzOlDpP-K>Ycx)m_tJSlS?}gbN(pP=wA+_Mcd+rCSVp9
zIV|y+wJ(c-D8rY(x<=;Lf~&z|aG~k?11b%x@F&|)^u!d{(GAX$*?4~4CrsKW5@m3|
ze>nh>2Ri|s`9B0hcX0UE-Ir!<>edZDeK5<WxXwN>>$n<f(3gYNK(}sn<<2`>%pZCG
zgG+g<>8Kf~$}}k$MCa+K+h_Fl@c7`n!+nIAbP!c$MHjImg|zwMz@7>{>~DA9zC2kK
zde<(Uz%SI#PH?;wdhi6aWuKRd`<N<D8Pco3RXthGrzshDk|+bTbP6k9fx2xLkBhui
zWfG%S!;%<-P?f&OuhhvbK~p=P&vkL2*pm12ID`BwPNsWc4Ub-r_FjIsf7l-nqp7;#
z6)lbMK;yQm0Xx&|v(H9MGu(`XXUmS2h<M&XCgkm^FW}T)##8Z1><QBF{jo(+dYj=I
zXX3=X|KL@ey0wC8d`a-xyRp)oy|u(RY2fn6nzDWR1{)#Z(3a8i6Z6I)u2z_bRS|WZ
ziIC9P!`Q1p6a$n4P5+0%X(ibCO#x;_=;#g-01^Moz~TSmuF~DbWg)U7WdDlCzbw-N
zOaj30iWK{CSuSUDyvNW;Aj_k9qPWBibg*dP3MSdmm>LyIM3#jPKMAoHgE!UT%P?yB
zmj|UAW0v0xq`IAYwPF7Y5B~3Y(NB(FR8Pw6-zTMQ(`F>k-Eqo);?uJC`taL>@AQfJ
zKXP2MPkdPJKIXKG>o_mM&_)UW>;BR4!Rtd;-!pLRuF(AWcKdld#mL*kx5xW0OlWi{
z1p8TMz8t0;dTS(6pvptjno;z*B86VX{LMB?nqmToik-I8a=kWrC90>%Dz0jMzw%BA
z4RlyV-Fc_b@|=&GR#P?kBDkm#S2Z}FfJbM&`Fh<NwimAVWH1oo=tT^ks8&=Eq1JXn
z=ARDgfHm^86hWyKmUGN)S!UH}Q*oOi_1FoIjtI)R@R>zjcA)t68E>>R#O<chLHl*1
z8kI@KWtVyyxE%`<*?Z$S<NCGEE_&DJihy67_1B;NoY0%+PojOW@&?(|WLjR&`s-SB
zs{gGYoxFT8I^6%^WElNpeXhX~GuQuPeXten#Tl>|>twkDHE1-|#s5dP&Nh6G9Is8=
z2(zqakl{HCCGTp@O2uSN50kXKT^D$kZ-e~m&*EyRvk7;G6ZHI+2$aA5A4H+yy{Mon
zHs<PpKe^=1G3crz>S;BNM4%cH?g)iC^`E0BVNI5))u!F6!36fw_&<erSGuOGQ~1Zi
zrfcCn1_p&m;Z?_s4kS%OzQZe~!{C3%*TqL;$pk~qPJI;6EkB*6mubE%nJ%j@KS@rP
z=dGn6CRl5sY5eOou2^eHUQT%Ona0{W=(F6`FuKl8)6?_uxO3TMc7+jLT8eYXjh0f&
zMG=pa)?)8Dj24&s=sY{%`1mw07MRCR|8xfFm*m~?pX=(lK@Q~8Xa-hll#;?P`4f>n
zK@bp)7Z?(N2BUx14Fuz&n;&g0XFBwX^I){xfg1Cq7|)kFOp<)^Cn~>noM_cSKB{?L
zyAMG`Ic&J)4fPRPOgE-{6na<ISN8+Xhu$?*C&yvD{i&|=qHYC5p^<tnD^>Yz-Cpcf
z@E+9vd6~VFzgDXaUg`3eKlZ%<3W3t0-%WK5UV#eXhq`5>P@q&;|E?_yXFPDU@kF-*
z`Sg6m(X#*`DPW9RE8gSUuR{J;(<(<ZRrO3$@>KxR_9_>Qj;kSmHLbW?7A+vt_kkB(
z;Kgf;Gcr_PtS}y?V|W>XeWP`3D$ue0DPN&w3|>RwcdM*8MRKe@uQnPR=qvnoB_J4`
zPnNTJ^?8L2I7>4<82P+H3)3WiS9$zsbc2v=XwV?n``=D<Z=!>!nmQbai3Xx-AoZrc
zVK_Wgyf^_1M&pY-FB38W*SWdaypjtBqW2kR2k=D3KB8ybiD_8<M)!Q(kfR{LQ5iyF
z$LfCk4@Rm1P2ba<$n-}GTqP45QkH)n3>P3A>~wfTb`DL;C|{yA9)`j2{Ov4T*39Cg
zEJ>0#<TVVt{AT}X@6B6|$*=zZ&CC546}m|Z0(c@%T~Z2`7VZCP>k1djgEOeCx-~H!
zB4%548f>bn%Y&z70fFM!x&zD)ITa>ab}YeXN>-q?;wQ(q677In<(R!SFX|+Z^Gty+
zcv!}Tjv%D>*^i*-iL?=h4FAo`7y#yq=T5y$=piPHw(&3@($xueF8Mf(t*N?(%2|32
zo<4N0G+fiz%&7SKjW6SL>dON3Hx8nw`$=jtH{x5YGS`bjYhfdSd|1f<OF*>0`7&fo
z;IMicbaZIEA&tR%3xnY}xmstpdeif8+w*GUntJHc{3HpFUA(`|=tVP(;=_H=ESwnx
zt{DagEpPh$C?Jh2*BhY*!dl($9ctvfu2~p2bd_sTrCia<bvzWc`+_0ef5Tm2Ek*-E
z@$axYCq-ec!Pm8Z>aEGin)qfnUOJ@LfIIpPsVD8{X-UgEl@G0qbg2=vNf*#|Se%>b
z4k!a`BsmjYKLPNv7lwNZc8#}$jz>~=l7viIHl$V+eWn9li(_t%76%BD^W9nL?x}$l
z=E8nMT03NX(Ft}8mJD!}pAu6-Q-LAWV9Zsiq}!s`kISzS@**AAZwW+(IpYyAW9A@U
zOC6RxV%nekw$4g;o%Y36_E@YNoXcC?dmnu<or`PDev6*T!1IL2YgR>4=p2(?IE{5*
zdA*J1)*Onl-fs0dmfXMBzsvgbV%=s3J}Q1<&R#m7|CVI_qA{#(IAMn$U%rCY92ZTI
zF5*%5NV$${zKL&d+8Q_kJL`4RnWvIQ{3vSPm^VOgd%c&a$MHfbR#%Sm#;Ac--SBIc
z0pQ;X`AlrgP|!;fuk<JYEJmz~E>kV=(pA$EqUjU~bHlMZZ>2gQljW2oKU5v_qr|Yq
z(brqs>VG{Mv(-u8QH{?E{_jo^C##2>MPjW>ItZBpq8k4*5c9Kp3I-iJjf7|sM&deK
z78tfPO90#D(S<rv+7n9Wn$XLs){iT4mpXh|lw2mo_2L3touDDrl!B@JYO803XB{E7
z+msQBR#QCaK!dah7EIj?4JM#23z+~yNt|cG2s)V$^(HN>FxKR3GCTj&+qgwgqL)>Z
z*bGbvmzLewT6H1qBKZqcw>~CJtXYykvMGtxNu&FFxTpofZsPVEarK%rEnfl~+_=?=
z9Nh<I>ixgBbS%HV&B_&tV(bi+c#%x!N%6_(331bH*lA&d22s!lUnJ9YWjDN~?X7LJ
zY6ms~z)A5z9Q}Z}tjZB+Jox*H!n7Nc4zzRXLWa0LRjU+d6RY5fgT$Ddvw2>`1w?3P
z14&fj*!Eaht-Wt)4X|??L#oL%`Zm_e9nE1aVc_Z(qyLDq@q9^X0;|oW*;!7(zs~Z=
zWaA7B2MYYC+Qaae`nrObo6k%1Onw&f^iZE5B?968_En(vbPka<r};qZbBvK+ZM(*{
z(rrDI@=!w6nIdx)(|#kMYJ-P=<t?Q}|42K^@N)Aly`_n69bG~o@jJU*EhT9PNy4OU
z7h7WxI}^IfM6y#WCa#0~Mpaskb1D%wV)o8xTHNXO_Q!hStM{exh`J4SAp?F-Vxp#9
zt|q(DNl4x7pT99I)Lr(L2hOyKKM)|2U%<$k+m^Tp6ztjTB`*ARA~<demL^{;C*(L=
zDBcR2Ss-1Ya5IqMhDIRjpbePoNnAJ025)^OlZu}z(&SHZYlL&OgmVxEMj`>NN`J%B
zyddDJPTi3yn#r4v!xAc4!XG-vmV{1^l5t*$oJ+}jG{Kq1v^C@F@f5ZLWI5Ey7AXp7
ze7{Ub$#jP4M@(m-w6&_-B2K||4KK+XrM|r>=HiPPVVjaRugu|0${Y9+-g!J>)N!hz
zM8rJQ;X4>C$k<eC<|l|Pp4mq<>IxSP6uXgke%0{5jbjDG2D5XOlG%bpbtt=>#f$NU
zjFnmuPI+VZQt?1^`Psa03X#z?$e`3KH<gB14-yrw>CSCl9-HvO$?SCxORlOkrAWKI
zTggv_=oA~$;?qi2<&MJBp2=q7iF+*>Zr16Z4>;Bwkxj|XXF%lo!PEY>8b8{dVW9RK
z*QuH+S+F$)(8RZg*mk>cl5OuaaYo;A-Wt7`>ECw#ULWR)*TxWpFg%c#Z2<d%dWq1H
z{RD9@T-oKUBp+wamGy~aNQhm~r{-pSL%S$$Rj8`~-D(tCx5%}<HP=ra00kBy`jZAL
z$IVCpmr2+`<y?Ov7YIEkYvK33k|m0+cq3z!##sftYBiCJQ{2#fYlD^ONqE}ThU6j*
zs|~Gs_HSm~WDb}+?N6@t<q<ZX_YU#lWo&3eKZj@R?a%*?8EX^~o-$vD7kU2fH;sSM
z5pk|WS+<gomUeks?~&oG5KYZlwH-|{+@4Snq^BL4@D>4)|Bb>3_+z$m%Dz9n!F}h=
zBsq(h(*-uA5wp|OFsih$qbE^C)fJx#>$?zvhB|^|=uvWZmW)jfjLHtED$WpkS`%!7
zo9*q5jt^e$AMWjs4h|1a`r3m?{WHEkoo3<fY&DdM+*&gZzjbb_ZofmDS+kpA6?ffQ
z|CS3^1v$5*E1hXwyOm&1u1)JeT;gNZo_fB8a!32GPevve=z2doFY+s5H~s~%JaWZ0
zZooiiba|akuT4r`%H2#Qg!h<D^-?i+{-l=&CaU1m-V>y6m&;*LM|0B-;x%uCGIgil
zo>#79DQN^-<YAJcFvzV6DQc{NbBgLMcQBT3_)~P>bgAfGgFkRfRc|~vbI7V=lhKgm
zLG}+;<FWhjQO;FeqAp=2sWWL>%er>KA3vtJHg$cl6+#y?yz(jq(NmurjMWlVWj9a4
zUyLvt7&a}iVj|!P?_(N0uNU(0PO!wWfzQ&7TPB5)jOn$c^jLS1O8Vm)$d)<`$?rm&
zC2TBLLU|Qi|3G#cV+!ra7Ytinmlm1@k~OxVgbu2aTt1yVsr+4vlWrlGX%=Ddf##d4
zQ8wcg{g;r>=n=!sRS}`^RBI$Mja5IP^rie=314as#~sRE%HNgf<*w!{Brk608}8+o
zr6OY?TFQUF-90>c`>HOe6BnPy=gBa7v-{nCOF<bw$NnBq<FYnxl)lAI(@d2){N~{B
zxIUtmE_^|y_1~7_s*t+Xp?ih!;CFVGmp?*Es>eV5v{fYM{H<|-)JUdEm!Vep19+`}
z@wlatQXR?K;fRlVJe_Dj-S{04f|}C8&2a2}n6~<0pjHr0W{Hq`s)M|2O6)A`H6)%t
zjy5}PI#)D1S^i3MeGHF%Y~w+{{1rlhEC#fi12+m($91$F-DoW(DdnxFGvO5$){e+5
zZWWLH_Kuvspu&??hRw!Tp%dLMfY#_NLnNNGU9f^~<wCP;$wniBb1M!8wVrq_36P1L
z5iIy`LVZ$V>)!?UAVo7&dA=wtTp5T8N^Vq9%lvsX-3_clRC9U;12Y6Lv7kUDegmqw
zh8|s%>Co`@TU{$p&WdR0MOd@i*w`o(Y|6+Ne*<9qsN8Q&IJ)0aB$)2e5I%aCgQjo`
zxN5Zu;cCbjEBR_|wIXr6<Cru5>QOL0@xHskEgUbP&b#c!==iuh3(*sQFV>7_srpVa
zU+9imWuIN2ExKTIg8@S(6O?2ID?lWNF8)y+uFT4x|JF<YuX3blp>B1esEJQ<pnh}b
z7XCIp=a8>z5^fCG+n+1bwp8t4-e1${bDPWDgt3dBK8?O$XpqCJDX5sZM?46-vUE~S
z?NxTFDYUB>lGb~41M$_h;YZr7i@f_0a}QJl15%J}5p)npNqo8aT)g$fGW88{ykpr4
zzv|kA4mR&JVqdP>3`M>UG({h}Hm86qog@&%Tr_20b{<tcpL?sUUv(b|C~Cb%>`Mbh
zZS7S3^0MX3M40bsTW;>4QhH04?mYN#r-fpKI`)V~s|Rj{4pj^G=whb|^`^6Al$GRa
zQro|*Igo?Uqkuv1IUvS9rIZHxsm~&@&FA%*4nl2s;rj#4xh3d=@b)CoupijJ+OSum
zYr~lVjB1niTSeFyXlXfzy{YU|wb@vs8~nRP^#%b@33M{oII7z0yas)RTESfiHo{*z
zw1EpAY=gga#>8fm3BOQ~gGD||$D?Vk&cUzC4$G*K)9%UZR|k8eqy3k=KkUEoWV)S)
zVzAWB24j(2<8Zo<hmK8#!8|PfApwm>wrX(8ufOc$*Y+XONx^ovsNE0<b{^R*o?NEo
z#~2&8e4EkX^d@&dHflGBU^_rNBCNaLQf&8DTgoH*2wTcyyVaJ`=<a??X>7OJ($iQk
z*UA_JtKJdv!ka(SG{ee6G1c#AI1U+mL*!m*!XMh|!(xr|>GdKhZ#b-K6Sp6hq111B
z^Jqf<j&7b3r22yGvLT4V!!W_$vEmIDfI7@LrBF+ETugU%19ZaOO}ceAxufoi<d<bq
zF3Q#pb-`P7IgKF#n7@Oo0+!uaZ11kXod)OZ_HEI*h6!x?W_JvaYI2vOn$(Tz;YJT*
zBrcLC(K-))J-SGWBuW({0Rg7+GxbG-!a78dgg{it>P6AXMT#!efVVS9r4diJdSG3?
z>U3S8{Ak+{p=*sDD-2aFLi92pze9OdilG^b1cEh8qTM$KC5L&0lAleIGeufQYGSY6
zp6vfHf?2{0vtcwHpi9cyKU$~$*=N~jpCLz|&&wgzfoV;*GF18EYdhrCo4tzDh1V{;
z8Ue3&yOzs&nvLS|FGHts{dSoaz;?Lpue2UlSyGJ1G~4Y$esSgyt<(wm9+<_jeF&y`
zx}{3lG6QcyUAuxLZ*3hpWp2|ENtq_4Tr_-7Z-ucJ0Q+~-{4}0Ms4GuO2eMzk>4S!R
zZB4@lv{eCjuBiq95mZG<PdG)|c+!w53hKvm?3iBAH*DdjL66#hbM*S#(RVLjf3y3N
zdfY$meYVWh*wnyq=x>sOJ>hr^fx%bDE9iH3;Qwf&D3}EF=0T{bc^Z@`Dm)9$Ky<2b
zDb|Nc)DIdg2S-0sPi=ShDgH$hy)S?Ii3bj29_S(X{osI(Kq*i{NK_sW!&#b*r^^Xo
zMB2Kcc0<f2cJvHFP=!@E1fF`aZ>Y<;wY7s#&ftLRwKLLgt{O4hz?azFqy6Lk6LC}s
zkZK)I(CVbFpn)r^n{ny{s<>Vq+T^Tqw4cCXq!3W55Ayn|OhSg}Zix|CsoNB_4qFqd
z9W=}5WPf$dEgqkb7w`3O)YjmnDu<qCVtqNHV6r$^5{zYIgBFU2%OZ}AYogT_U>f0y
zjFm_u3jw0ji~`tv2u%wMZ$2kVM+XM1E2XWhAQ4c<!fXk@)wMK98@iU(^2F8(QaaVG
zY`1|hr~6C$a)2O1hhFS)AS1T3m3xmytul@gm;<Zr2aNWNsY}(ELc2ev6o|44scEJ*
zREI-FM+U~Peo>=9-InUp4)Pqr`W<;u5AW+*H{m~Y$KAM6zvId6JMPM#`dyoPx9EJl
zEYLiDwXSuo)mczIXUM3$@`S0<ZI&7{n<T4u%++qwHFyuK+%Z+U9dO;GV_oZZkad%u
zO*Jb%V?wLeIUwBstvv*OHdNKmt9V@0?1Sfe(Lqk2@1vjZNMbV$qRbo0Y{cO1L~!E|
zZgNM1yCX4+KRn&+tp}*U-MHPf9F%G0pjd~Uo1PUhlDj@HD|^&5?4svd({*+q+w)!<
z&DBRC@_f)`nAOKIIT5Dh18JkUqHlrpT!B!5_oR<B{rxfi$%)A-%}=$beY5dtaNY0B
z#r_X<|B7UimYb?uwcZaW$-I2{b3z?FEQ_&u*c#Wi(Ee{*{rmdsFX8W_KYq0>|88$T
z{_64LFaG$4M_)dA{PkB~{qgY^s@&u4FTQ&GhiLm2eRlr0RC6z)=nu=&Wwuy0lxz9^
zFZxf57i@r`QSUR7yd=@Ofd#D^H2?w8CgYg`nyriVZWZ*K5f?6@W@A+f^xM_}DRkOO
zsgu!G#0DPiSaLRt=c`YDaXn93dzj|uZAEmud22yH6m5lyMUk}bC8Ah#Q*NID$mLth
z{MuGR-7xQxqOH_&k>c*&y;&|q@s1a<QPmtNB#_RMh)9ZMff?LEvSbpuTZ_T9ji14<
z8+QrHt0|lzmp=Ob;P8vbcwL)gw|jDO)W1sNcZ1$%Nj6E(@bgX&Y}wa9auuKEg}Nu8
z5op6ye6jz{+wUk(xVp1c<!PDVBMOb08pA=|vPC&tX!z%4_Kup2`h-~~eYatZyHxq~
z?ZL~Jg8??W4!y36Zr8Ej^_r<bkEG+hWxp#dANF~s4$MdI()PJr6!AE*v9isF_cNY-
z<;$;0k=xf=5Q(2`yq9g&iTT87R8ZMb<cnksa(OCgh#LfX1a*fHS!iMk=#d@P?e0?D
z#YK#tBgm8jY1b59zf9F^0FlB8jx-Iw6@fk&bpgpVnE}lSI^e}c0?qMI;-ZK#s(zFu
z5LlZs6=CWdTST2v^z@!6lIvIauHI7WJkSx_)_&aH+H%7;nt_4{4_?iX(48%(i*&9i
zVbDn6n9xQRllGa`wlvf5qioamfD&TrBF}ixQHm3c;`w}<j&XT=m;&%!QbuL2unicv
zDm0@Oj^+f#XDC|N#tG3`k<ak8p52=~g~d~KVjZw_LE3SPb6!&Lw7uQEKkvUhINTrf
z*g9f9TCilg{E-U(z&fRu2d@rJe%jI0KbK#s^3D`@K-c}YOgz!}Mt>mHH9V}fwT*Zi
zYv?WcX$N)uo47`lRU!a?25i^lVq-%`?X`Pw5d-2&vgJ%9&_tKaWhRLEwP(>6L-%{U
zJ#q^?_6igU2v2~ESyNvhd0%DSHAwBDhP;>0W@?i$=GW%t^XTX7R~+YuNY-4KrFY&s
ztwRC86txqg6aFpWg{Zv9ms3b5i7+^}gHWJ+tT+<|K!B#`Z+d<nUQEO}CfQIq&96*g
zedy|Yhy*A<rX@34C3Jxu7e!Le^9&V!r>O#6IDTcU`npyZOfr6l9qG+Fo5trO7yqk;
z>_2)7F1hYUK-BaNoRS_n1pq~^*^iH%kA!l?=P#VkjCk$mF9*F3W_v&s@t<~MVAdn3
z3h33paZmmX{%iX$Fr;UXP7dP9DX)%MaabJAy~YrBnE;S88X$Fg#FtKV_!?V0PzU|*
z`$ubitBjiF+4*35Aj-;uYjd4`Dw&@3ol?hcivq+5whCaD-RdTyh<?3TTMO0mhP%Tz
zW9@YKx(v^NuGYG7SG(6^bOE_-e0WpK4U17N>>iK^polFUXycgx1k!<i!ha7>z~gTF
z{r1<}+uj-H8y2$|<Nc}zbA0r@0-e9$i1bpm)Y_4gjLd6^jYKXEmo!B}uUL*3d13Yw
z=c-1&`{tl$@fyin;2Y-?#LN{3XX+lxG54xyN*i>Q;4*xgDl~o#s9{+GoWnFgg{+n}
z**eFp7l<yFbB+cPae$I^p~_w>JU)SM#WKqfha?Jt09I2C=2<eN?7FHAi53;%I*G1Q
zMQ)6XxV%tE=^BriI(o3oFg6Es;_I#GILDT*5<pUlj!{>vx93E(P%CLx?Nd=BSIKlr
zv-&=XCVBSx0=mar9_Rx_qc0bH!2%BC7GumMLeK_e5!4TFCG2t%qYw>}45#2-s)lh*
zl!qc})WujvNnEHW&MyKT%!?eel_061rZUtk8E4mO{pWE(6bK@rEH7r*CP+~hB{nk2
zDfbiQE0)<x?ga-LNC}BCWbT{N!)P6TuMZWpogD5TACHc94+->j00yUe5i7KxyjT1p
z;74r{Py_FDOMNg{dGzXdZ}ivwBfuW>B0itRYSu`A_1Cxdj!yo+ANJm=k)UCMJtW8b
zdnX644@HrI$J}9-Kv!yt2dGac2=Wuk6Exr>^epm@mccvbPlux)QFa(L7E%!h@t7uv
z=ybxaz!26p<~tM=e6HYeo+H;C^^qkYh|0%(FoGEnZO4MxwQ`5jQ6XWEf?WDcZ5I5s
zR8+NY)FpT5_635ca$mkZIojRZ7wDZ{^kW69!)QEEAQ=5q+r}W|EwgF*PTiD!d#{5R
zvo3<Z*W97vO^OWoCj7gjOL(JFrFTs2<zj0NPS7#i+31%Td+F4B2{%c9?7oCH`}ddZ
zr3!x3i^0Hjtq0@`(DeSn+RJ^2t}fDP67}I`_byLwiR9&_s53;&NjA=xun`bsC<CN$
zsZPm+g&mHRLtZ2o>Pm+qBQ>tP5I4w2kj4OK^X)Pten?>|#a4hgjc7$0(;0sjY-f?2
zsYxj$2)0P6D!Ry_AzYahX;@^892&sK*ox$*6S>n^Oqcmslm8|;hwCIQ$LjWovm{@Z
zpgNd?aLCM@rvn4*RVbN>y_;D_&<`*VF83g@HR4LaLw>*eHz2Nne~kPd&7x^-lsSj3
zT{_q9z|mQSwr1ccu^0lo542{K_X4XoK(S6`-`yc{PO;F4Xdh4DD&JQ8uz*)1co5d_
z=|3mK4}@a}fN;xnv5YNvLsR28Q<Rm0>1l#j^U2HO=rS%+%-c-lf(zedy4Z`iQ)-ws
zXB=t~jx?}E{4*_$=(>3qVG{;n-J)3q>hRaatbcO+;&227hLMR=2tOW^o)CTxhCB`|
zMv*(kXokX4PPDeo%DX@`Q%Y&PosvGgZ(^s_&6LWygT><Xlm6?B$aZPgcve|sC!DF=
z13$YZH=`QyM~qF_nc$#oB}S8q?fvHX#ph)-O;5)FSS4lg&hv%3;p6$pg+2vb=F?`G
zfUWo?O5Hq=>jH04A6_z73aA=nRhLO|4ee=)lSO}Ee99!pvPe8Sdccs&%W216v#btu
z!duD#XhSfo>*<jTli@88p<ye1kDb0V2oUR!!+t}k2A#D24fdkT8LlgQaEELQ*<o|O
zOQ`gW)4<vypjZ|y*Ue2A(fVy~dSY@QE%5-&86gG`<e)+Fv~$NEQ2PC_!G}7sGMTqN
z%GwH+z?(#irD7A4(Of%fVSa9tgVnlW?e8A%R}Z@@eRR5&G4Y+Qmi_xqwP9r9p0C!O
z;=1g$!d;vti}A%Mo=gJWJPLQ9N8GDg8T%Kx^lhuQ&yDZy{rB60qkWAkqCFBRJBfZW
zyn__f0oSNbYEG=DBYt0SE=%>_fK1osT+l2?GV!cGTnK22ib^Z!fQU#0iy1zGM%dbd
zgR?XRB-u5#FuKySaI;vcy4gBIqt5!t@(yN|K|}%e?Fucz^K~TIPyyVa4oDZDgJJ=j
z0hu<Z5N1}o)>6DC;h+=aOD>w5w`#|(1TQhqCfZe~8M%BrWD5{mfiXe;U@;~yT~N>K
z#=oI;6FOFJFe`8kAlXR5w0+wZ9M$S*p!2Tm_)-aJX;bffutq6css(5^Job_%F~AiX
zRJwA_dKx;zP^u<ti?Pj6XZEbW{#2{VpFfF+IfF~yG^QbQ-Q;$PqIE6yA?+9L>VGV^
zqFvA!Z~Y@%w*y{7Epp!)p{soio&LK%_O*K=6p+<4ojx84gJ#n%xXtU4wZf@huuf2a
zs>(W^O73d0;8qZ+?(#HcxO1@s4_+sd2lT~vs%c&anREIBccoEkuknSG!dyh}gL1XS
zJbGZ3o)>&HsuRzr6DJZc+*A6Xo7t;EJbZA;GN7VgH?50q-z<%8ps5m#p?*Cl$+&OF
z)U@ilH&H6Ebh=c4pTUC5?3R!tV=dndgkZ`y2O*t@su_YzDS>M!JchwI^bCoykS(uU
z5xE4qg$0GL+t3#~zE``rQz<D+u+N@TiPsK>>Jyx{*&!w(4}a%Iv(Bx?ctzLyqA^YK
zA}z~&oC3iI*`}#4BIx><eVp_wfcqzj;NO<>9BoMz{u+?Vfr*qwo<|s=p^}wc&qO4~
zai{py8@%v`6RTvcbn(@Wq`X9#%rE4vrZ&R$R~fUIRrb$CS^RdOi)P`nnP1q?SniHE
zI3oVGEod)o;UV`*ul`JJC+JwhEAJ$+q&TZiU#Hh|MGekF0L-5x$W@lkry+S0|K!8u
z6F6@V9-&tpj1iYmF)9ilVA}v0_kts1s-||-BxI}Xb>BO!10#j$F`dIwcBkAxL3L#d
z>pN$Go=tgFzw~Q95Y~syW$Ju|CHk1~Yw^ZjK1a=@0K%;(Ish1)=Ox;?kZ_1pl(_HN
za(1fNpZttRfel@t-UtXL5Ok7eGL)S0N|ggS3-Cs#IYjq6T`oxExrQ=NlxJl*8IFt>
z8AzSfX;`Yaifn_Y#Z_*Mw8nXcesbADaWTpJWUS~rqw%Efx7fCd)y_lErHn5?$E)D1
zTo`q9d7X_fiagVr-UaD`=S6a<nrAeKM;8|Dp=6oRn3Wxf(LYrB1UrXDIEYeOl&97E
zLjxDKIvT6aOf(xT^JDrGNBE*5Lk<1+{g(WaMAD1Yj@$>SWjpopVt;S<Z==JLgT22T
zkKXJbjo!X_v3s&_nFR_q?Hrot!3$xQ%m75)Zry@Eq1ZQgsC9gPzpqWdFAMMy7>{wB
znX@7(FOrE1_pp8XNPDZH`1gvxhL0Q&$Gbea7VuWK*wG>I-9}=YV=$wd$BT=hJ}0Qw
zKfPx1ZLC<DGGTi=pDm-0RSKzrN(3*Jwk*Vgx1J}(c)ld81lUV~z}}m;EP7G@|K{cX
z3slC+f-G4v#0?D-B7loRW@bCa!={#CrJ~lIN8?whrgy*)3x@d;316{MReB(u@Vk`e
z9<4})oRm!Lbs>0BaR11gcsh)J)}#ON@lO!fz9<)?Y&o6o=({{Ek@v)gR2l3Gur-o-
ziQ2*$sC{9SV2%Ok<}_biD3qCP8reGu`sjgbTAFVQU(nk~k7fI(C(*Yc7_hdgl`6LM
zBQ9<F)8XtYbsid*`JV|T{;V+GWA(?l$#auG|D=hwHD>|vy||O1IkRSwo1wi{u;V0b
z@uUeFbZTL3TZ4!LSq9BN^3Xh5s@f<3Heqpy@2WIya<!A_M%^`ZQ~+z?yjgUEck)GC
zvN6(CQZ952dp#RV=90lr!DI?I*&1yP{B7JDIefzpnzTCji;AJqd(GU2(Y<>=52B~G
z<jop1fMOc9MWF{XW(TCw9eRoB+c}9lU4Sq(2}&+3Rd?bjQ6$NP%{D<m&W2mGEsk1S
zS21ieS^uK-`}+l?(59YHGpxQUnn&-7u6p>*6GeuB(VU^fV5=4wMNRGFX`)L`(vpLP
zsQwew_W_bX`})9`E)}J+EIsQt8qP49utD&JX?>joaAS#eO)PmZBo8Dl_y==Xo8YSz
zx?B*@G)NT^2*k7&&Dm95sd;n3q&?1n!p!4|UXWo#D;`Z1RlA7jle4z~M6j!3I|Et(
zceT)9?%vNZT339s)^_b#c(1I$P6fQF#i}p}ryU(w>QyL+w)7a~339KfwPx|FKU#ON
z=2geUbv&(VA~3yP?FqW<npF`0ny(--Xrg)p8J4u`_Q?$~tgN6d#0~=NYCf?`#xZvu
zUCx*{A3a{a`RrytXT|ec7a6$O%sM<ha4<n7WqkXE8=}eDK5B|kD9d${5frPkd~ysH
zw9C05l3l7eHRmPO@GhjALVAMBOGRAL9}8OXtxru-oq-&%D?4u+p&6hYUvPLg7@Z!R
zS!!=|nw4oDWJs#YA;sPhR}F*KuJ+8pp~KT@0<^6nxd-g*MVM)$Ri0(NQ+(l3lPtGR
zwrR!MVabZ+GeV4>SvM)xr$7Lx$Q!ANz4uMjs<GvymTgBe6UKZYMJ%u|app2IM<4;Q
z;T>Kj#d$(eGH8*R6ycj!#9b}o@ikkQQ&r$KF4GAJe>6=w$s;fpLL1~O@B%83JVGOT
z3PgxKQGMKN=wVmgk!T|g*2Aj#AyZJmL(s@Tn|`V)Pt)^@#q^r$gTcI_W+ouUQH(Iu
zL2q64<C+aY!B7(7gsL@^+Ib#;j;4mL9NMR*r|)DdvN6K48iBhc^(B?>p31ghZ*`|q
z?IA@agWbkod|@|hMnl2O*4ESmSof<Befk_IK8&Vm_Rd^i{GJ0X0=RHLx&cB9@}{g+
ztD4)PVT>P)%*Z-ai}TT!=6E1dkY`6dm(nV3KP#67%POz5+r<S)WWeGX##NHCLqQ@r
zW2jAs<40$Kfg&%^@G_qyAO%;jx_(+Hs&734yE$%sk|!lJjyBb*NRdF3NYo3vI5hJB
z(8q7%M0Yo+_-ab?RYVc!6gR?gj-U$exH?#lzP%ESa*~`b&%;I$SPuv|GEJx!vglhQ
zkcGBm*s-2Ij!;;wF|IDHtXdWv??YTs)#p|6Ik7fCU6zZ4JaioC0O>Z+na-@?_<A%|
z$YRR)+JEii>`JwJLBo)%6vfCRqIYmPL6A)AqCct!bB$yJ7qlkb46{F~X}ITy<lBU6
z{}aq;)HBg3N^mB`e3eOd*_T<5Fq@)UD&Gg=&%1x!2d|g6NBg7i_D}W?|7t@BIgMch
z!kI7B&cX5V{>j_#4qh;!q&8r&JWnV6L1n9~m6mFYd>Hf>zeD_J?^R<+$8$z!cYCXX
zOQZs@5))y2o_cG?e>*<ef2EG!x3ATOr@H?xSsY(0fSny=XL<jAnNrLhbZ3FoiCdGa
zLlm&QK6^tBRe4e3DyRuoVgh{k^5C1jkzSG4um9qN4gkUF-s`uACj)cH&e5j#`LpQp
z*4IY9W6G)9aa`nhc5G>ND$8pS0i3B-MeT`N<~cZ?4AhNF4eC3u)ItQ7TEH!eEp3o5
z7&_uD;1XZXNzy@0MHokjXoRF7x3Q}P{qCcfoWs&H^u<_!Ebt;nS<^Xtxmt;onn|gT
zK5RV*e<6<V0{X?vPWzIoy73vhaX?C$zUz5vbOI&HWbeZtk{a_qnHB5nZyy*?#a{BF
zjgI$5hi{Hv@9iHSzdkx1y*_+-Xu-_*QuKAjXVK;((1t#Wp4cd`1NvGu<3Rp6ba^?4
z@zPitU+PH1{0v1$kht?1*ix$>{hFIlb91J`(`S(^2Jy!!JUpTe8^~6N;<73$7=xg0
zC_sADzx**p*3m}BM$fo>7^&ey`nv&%x$-B`soJb}c*h@~?4BHt-W)-gEvg{mR>Pwz
z#N7T9L#7!~FCYyy?eRqsoVMy2$K+B`Al^97av}=__uvQBRsRV!`lDXK2M>VrzvOVO
zjYXm0=l|ILT*#BV?*m*>ex+y4+wH)a^m##ltxQq&eFQ9mv5gIE7jiMmm+wX*{<XRh
zvk|AFaY|jvQkPf?*BNyc;1w|Ua|J_ZYCX79fHUYyy@3}7?5L^{?nn2yEf?mn5qgEN
z_4)4SPYB9B|Hk~<GrwM#U;F0Qx1T>TwZAiO|7?C8m|y?T{Q8Ue^-|P+W!@f|U$4!t
zH|E!Wn_oww_OW?;Vt&0fzy4}|eQ$pKAZq{3y#2d)8=JSM=GWN#nwVdS`E@30pPRQA
z=2vQd{cL`{Gry*y_RPG^%&*-1nwww0m|umcU7EKG^J{5-U7BB4=GS{s``WzyRlMCc
zZy%XokIk<y%&#xaudhVyug%*(nqU8Ee*KpyIl|w75y}S-5X%{SM+Kf#3h?;?BNhlC
zF<%s;#Q+b=rn*Qr<y$x`ROeEh8elT@i7~=RuUmzHo@n+G+rDQ`q2}=zO<Wb}B601A
z_aJDL!Z~pHtE;aR*2C-SFkVFOlIwqD>y~r#T;dEC?=^PwDxRw2KTF8_lsh!-dQE;H
zIo@sX#jvs!B=nCUJxl&BiZ9S1PhDq#yy7wVKm&;b-tlORLKKX`s7x%ak#$L08WJ2t
zCZwvzkOdfZK;iS{j2T9VUyz@1%@n<@fwDVQ%u9p<wCQz(j5>u3%5pALs8vfLJ1f-$
zI~m}*z|{aQ55<xw?2qRATIT>*cnNFE3LNBRXERh&z!VjC2C<lWRvQ7J!U&sgusZ-0
z?9v4lzBoF8|0RQeXK-(7e8q+(42O<410)|RdpIl3pppdSrKH$w?0bzDweTV`*S`qi
zCd}4DhW}`}ug--j{{%(J5dfrc@P_Tdy-}~0i6W<xge<QHTf9fc+&?^S>jLhOth4gm
zO{4qHkO}WF#H&l+${@Ce#%-A0f0XL~TN~vQ_z$`#V25CFJfQa9vFj+lx}-$yB(A`q
zBsLPBI-ZIN7_z4X2H(KgQ5+BhgIcH~E8XDND!%U~nnYlQObj5;<=EKR%}#+{M$03P
zGsvBh50(s|1i0=Dw2fc_r1-5pL@Xpd35^;W)gx!dsuGzf`k!ZbA;_3|e~JQ;mJ~;`
zJ)l+nA5jA%;`tTuWu-iZrV~Z+xl)Q_-idPjrczP|!4pOGt0$<e>UpuL`qkOrBY(;U
z=ytcwTI&E|3-EioJp1v@?#Z7qQ1FB3(N6)2cZero<8sHaZUm;tO!caEfnN#^3v#R|
zUbzSbp=91gUvR0o+_nv#Qq8g$P)sX;GaniHzztzpZ+`-caSg02TrDu1*gT!0#l34T
zprG@-h-a?Gn@8w&Ntc7vRX>EBab5(@a-NLSv(&P1Yp@sFlHW4zt1tG(ap(Q`3H8DG
zvr+6#O!fATAHH*qqK1^}o}G-`m?6wVntg|6Kq>{{A}a#0H%I&59{kYLSL4HEF@Cu2
zeO=d4nAN1$QSgN_3R$I6g2WP3g!BW3qB$YSwx(Ku-4&4*Lk&{B@_KffPu0nQ34LBh
zFegbR*yRE`1D^VN>R`WnX5=yI_W-VRtL89ONo=ypPCJ{#)s7N$=B52GB|(IQZ~9`_
zH2LwFSup?|ZqxxF4}R=zPqhCRPfSW4v-3%IsW-lH+pT3KZ@7MZefX`8g{rsP`&8X$
zSkJyWOhE}Rk899iQT75gcM!s92gw(>A49IIVE?SC-6SIFfdNU3RKeqATI3mo^wi~b
z&;SPue1fC?A(Hf)n&gPdYO*N}wC6U5A|Z~nv!NL%D2rzL6$#6ILi_jM!T%B0-@nvh
ztL`I>Bc)}qSnB>b+52-p8?4d4fArS+d~&kE<|8;H2=S^rMPO&+*}RX04!$M(ra_>=
z(O-98zTG#?23ozWwt6{aIxNuYpLY*myxbps^ZNBm5bueG2?(9JaJVJ>=zZmZQRH7L
zNX6E2O;VYf!YZ%Y07VMM7DNL?Zu>2W(X3TTSn~;w+<_#N5yaPrvH&l=U9BC{nOzYp
zRy40Zc)N6PI8w+70!qwMwVE8^&@XbGl(tM?{TwJdp$|`$UH`$f7rzg;r;3>NpbWM5
z90;WMetW#%C!@E0MJL0K;~=o+kb-oM@R@(&+i5x<bO8zAz#whpB3jON#G)}Corrg0
zO)W~_9*7bUE5p#si(-*4RnvX7JNFatVT7_45YJ5;q;3M+K*10KU%vSd!@P<wmr$I!
zlurRm7W8pdarL;SU0VeppM7Tb0yb8*-d_v|Qsj{Fl;|&}JK5iwGY11XrX#hup^gBA
z!X3r$s~w5y=z<6ex|H4Cz!6?~0n{$v(WC-9u0P?9zg{jj^Rvw&&dwEa<$eo6K^+*}
zc(ufNX~jW&#@`+uQ*h``r<~J7(pi`1(?=VcXR2TiDo$F3S~L<IDde^popc+g#76$m
zh~%#h>=q*n4sBo-rx_ojK6<(%_wGiha7rq{MLu=$pS+6y1u@_h?mXtx=tRSyr_u8@
zF;M#*4y`;gZDVxK?2QL15fq%!so0mBoXWjF?;efbFhETPwuNR;Vs3Ukza~DZe@P0*
zHL+Gq3FZURT4RYPH3cm2AfY(FX5}t*AYd#1kzN^Mx^c$-sU*5m%Q}bAI{sZBG?&9Y
z)rIkaYOszN>DqPeh%{PU%-4O=nVApZ?%6E_m6)>_BrC$pXssfwk<E@~ke+Iq&eDZ6
z0dxmatpIEpr2Z5Z=`IOw+*e@6vcB+QS<_>+_UMBDS##W6$T|!w`1bPRbOaA=(@78=
zNOd~B3ho}|dR03|KLWcpDa$+DEY%uhF&ek+ktt`k#>~<#fV(vqmB*wLqS{~$oC@!w
zz#{7}h=KM|qO9#~aO(1V&5C;rG=qt%9X*q^D|6bhqpCuV13J8^zb6o~#EMOAqTq;s
ztq(E(0`;QvxDBIg$RV2L+Thl2(_G%Le2`Xn#A$;|)7HBCUiGv2Xc!$HpB%hG(>N3Z
zZ$y9j@3;L&+uPgh+Xgk&8){#b0BqY(=ZUUkE9^9l71J6A#_GQR?Z#@3yD(N!dnKOi
z!525$x^LUEKCnl>&UDI!q$&&vLwZPOYZ~;r20e!Du1$6!urp;t;*3T+-UpquDDpE3
z*;6XcU`Me>pmX|ogWd(|Z0;VLs_ULU)^;z^j5n0-1Ay|i(}!=h-ODa2{a2S?cTkJE
zYw255Lt0!H!rY8k9WdpW!2?9Wao6Dw9T^{{InFtcI@kskQLWIAa67C?Yix+isFwJb
zXewAi`wFbnk1ACsaN6{Iq*Lz2?;&7AdYPybyRg`;uEaVxd+AbI+R01-XLO;90RPi|
z6R3XJK>>Ncb?15A^aQvy*c&Q6Ds+tuZ%{|zG*dMh8D=_h5-d46g52~-^cZTsu4D@>
zR8y@Jy^2IaB{)QPg6I$}g;hmuSKpN&635#KOYtvGFIQYG?Qy7lS`QEnf@V->rc$M}
z!(9&-FoYErYG}wFF;m(^<dBGFUgT$uSOyBHQwM(tVXTF?V=f2;?pgZYx)`mCw`%O`
zKPNQ}IsGv<;coe<wG!K*GbREO#UDqtM4(X@^<cd+p3SF;XwChA7|$RdlMtKGkEyf?
z(T0Ke#ht;;XkCRd=m^&BLuj~x@uK&$IskzY>rX_Dn(sA(H@LH5l;@M>Y_3O%53M_e
zUWK{}KD1VuD#V~`!0+(2InB@OC`$E7&?^=3j6kK@GMrXK)f-*L1tDEUjC%#2)RZ%t
zb}O)PN;twBD(8Inr8u>Oidh0VSrD-dR=UQRL3d>$ZC6uOg3^UcrweHoPcBmkh_pOU
zR=SW*{`}?^x6!|r(59{Zd7KuOdVyB;eZ-BkKZk{l>Kmfyo%iAdy5&(>T6v`qn%C?P
zm13mx4E1s{dK-GJ1q`8Ygz|!4>Oav{)w9t9UGXL8;9b)~H^6hiMpQ&rbHdr5_V2@4
zMkaZJdC({WKtnA1N){JPvO>vIT`%-ddKA<hxcT<{gef}VOHZcm^3rAww8>j<Ef7rI
zF+jOUtY5C5_Kj-C<6o9(kxXo+G>+K<c__KXvXW`B$5t&!TT!emjI<NTyhw@8*oMWm
z@&!?TW4_1mN)~9D^V(m=d+y2_yTEUj<@M%OoI-@5MLMm`8VMG8(`3Q<2-STsPr+9h
z{$!Zs@c4~7L{56JwKYhmC7{po;ug74Y{E9eB-nO5iRVD!^zU;Y^sVZuUf+;OYZXq%
zvlCo$*DcRC%MF8gysbmjNV8)%38b?$y)gBPgaM?~FnNh8R;1cB*^^tD{d`lPaUqNr
z%=gK4`hB|KZNta_6c(ZyDMC8UHW=vd>xl5&(7@Q@I|#`{fw9rvg-1RVoyX_EW2*Vq
zW<i2tz=TpMv(-(-nV)ZMcD$H&C{(*ekMtICkQi)<H-}mK?qd!lF%(gFKq;jq(oP~n
zjEZ<XbkJcilVMHQ+JKw_m?l}iJimy_aeQ`$!OhQgIEyQbx?~UnPX6e)MGv%<xD%<6
z63lQ!PAzAzgx-ucWGr2sTSA8iuo0!e)r2^4@T4K9Ver7Fq-~tGTW9g+L002e4l0qS
zY31FVP+cQQ^)#JmjUp?{9dA34JKT;;_>Q)W%x(&4ksqMq9a4v^>|KmhbwRGtD_~X%
zu+)SGcfuJFnp%{hl-vknZl<S_1MEU17oAx;1fG7r!Rks_qQS06+v?jon41Y;-j?7a
zKw$u)e#KoMV-~!jTYR*8^6l#*a@fCDDQUB9j`qG8L}VrtEcy4>hx=|LWM_`=sGj|z
zcpQ`(jHfAp@MwUM0iu_RV1Iu?LYL1?y5)GGD57`jN;BU5HeR?_##jr_(Rp8CEc+%e
zvCL==kiTGLRsB3xSM@~RKpie1f28^%3f)6)(viyH)M+jG#_{u}@TD9+*!3r{5;}r$
z8)J=%gBHOPhe>0^2Z2zJU%i2N0t<yehmnpqP2_5v34AzLXJPNn+vxO~f+kQm64B`%
z9ywE?w~)wu$B(22pD8<-omN$vyXZOZ;?kkD0_7w4Bd1<Vqw#kr4-yThtw~yfA^60^
z5XMsX>Pit@L6HX`nYa1@#YpPyY%F|k#H_rrjT>qSH%FS>Jle4E8+aw|o<!SyFy+;x
zTR>nP>_HOLAs;za34n>(F#SMSu5}|ZjxXbMipKcSF`FFd5LfEn|Bof5{t^0h5<W#N
z_|-3;L^UU5unJ`<lx+gm8xnXmPG67h>LD+ma73jwIZdu}#oeKRDeC{nWPp>!ZbfLx
z%DA0@v)IJ*Os2OFDNbu;KT`}4b+&X<YfYl-MAP|%q#KT8C4{yJWvbqf<`>sa9Bx|6
z|A-z-9-(RVw2!D*G}j+va}&{(>Zk-a<H&-V@9>*XCOXDT|38)k9q2`Ea2{P;LnERF
zA#4SQe;RDHY)5r7aMf)9JpbT8_(I(5zF4a6OYDNO2Ct`4R&}B|I5Xe}?xoswCBpTP
zjp_=FyM`u-f~c*iHIDRij#o#aE3v!H;ws+?g-Rz^^V1{(y|%8y{$CLFOlOv-o=!0{
zgW6cNH@a{-*)mc8Ff3nji3A8Rp;1f;VAO|__kz996O6T1$`lQL_+qs_n7TQi0p%Z;
zkWT^p=n+aMI*R!uijC6{+~6<_OhH;nHqlSE&bPEnzE~a|BgoiOVKg^YNmZW?Ae%eP
ziDW)l#~?qL^_3z~6~lO$P7(-Ac%_Jxm@=rT!Rs1w;VXWPBM~n!z(G4D%(-;y)gjg$
zFEEU$qHimYgA+w8aq<#TpBse9qJI<18di=>V%2vC8@p_n8{WPFaeHG6lmq3(POlL~
z9VL_H*t@Y@T;5x&#&)K4t7ZuG3UzbZN8*7Xz|szF_jenfY3Bg}sLP9>OqTeyCc#KM
zljQKH6@PIf$Xa2EaMU6itjG(<JgkY-2LZVRCr9()(0ut-mJ~X;rNe+W<nMFJd0_!{
zXNHRPV<7?vHitiyxqE5@5}MG-z%PknI$Gg}wk@}NZAZg=YJhK~pYY$q6Cf<#Z-2eL
z-CMJ}O9BEB#;m*az!<2%Jyd7*FQcRVleb5Qyx0W<Qn1q-ppADUAUMU**G0+_dRpNX
zR!T60yCV?;cal2WEF4w%zt<$AQ7c;2Soji?mXXNx%g!O}CSO6<=70#VNTv|eUj%%F
z7`!F>$P&bIM*ufgHqCKATO?loV)<g1HVo5{X2YM}aU#QfMij48A@oPlWQnn4paM;6
zUL@WTvZ0n;$&<bqSUF^bzmKCnra3hWIk2LU5L<}Kt*}(#kvp>>9C&jlSYYFes-PMU
zupKG2x^koLspA{Uve`8k%1uUJgVDM~s&~*zZ5UP&ft70aOjvn8IIHTYjL#C@2|Ef6
z`y}*NF!FYe!J^f9<FF~FggiO$(uB%31Y1q|V7>-wG7Rqso#tUexmIY=5wN5C5v>si
z-eiEKq`V6FZG%!dSz19J3za6x9Ahpiguup|TTuj>66~apl2>X$-F!gSQ+1G507@+>
zb%@R^1>6e6!?|E}f)15zRi1%t$K08BEHFYrJ634Oc&yViN6k5whkVg?fxpiAl|ymI
zSiA3>l>kL#V+1!x=>4d{fi0rjgt$RAF_Rets<}NuJ%<jahFCh}aAzEAeUgut5Z?jb
zBntl1yfD0_y{f$VE)?Sr>qp&@#&eA3`=io%QdB^&%s=rUe}9pneSqo`I787N=%!G~
zkY6UnnIc~4WV0dC^+><oX>JFjqhMRxQK?SD6eg)4fwWWVZozMlMB}H+*?g4D=8J1G
zH@DoD?gZ3wh%G2&j_eFHU@!pNX`c|3I(t20uxE3%4~FfcIGcnrvpjS9t#r(@gP2me
zBKv6jKBw5UpR2ylaUUZSbIPP9g7|bGr2xsj(=(9DBZVVI)W|5$$Zo}5Rn;I!F(_IN
zrUSSFeI<rS$GLIvEp-b{QXAC>dob>;qHQxV&>SjQOlQkkMDi;2pL2{hLZPw@d>4>X
zpj=Q~ERqj_p-g<9==rcY-VBTvbR(RO0=l6Qa$q}_qF^NRD9>j!UMJ>LJ{wWtowg=m
z6Ch1RGTFqlswV()7m~tNo7Xl#rnKqIDjwpg9^&VPjT%LFPx&sLllTQfN^MePKp0l8
zXoc9u3*%Kr5fBJ13&;+99mN_z*7b>Br%avdmWjuU5(C`B{LYqBY(lj@iwl%Fm5Q`0
z6z(Cz9%g#_K#naalhRPXG!e}pW)!6#c5vvx4{b&OgNOQqT8XA8`VyJoedXYsXhS?w
zyk+~m`CQ@;VbAE4@zFqCx!~EYD_nQn>dIFSPhCj|>^Y{AQ@{c=xYw-vpX&fJSh#f7
z&D@gejFbt94a+%5=2-@XVa+jfnU?-MGzv)iwgs{9zJXi})9axEcxa8WH3h`X5(+p7
zc^EK98i<`|@i_=9Fm%y^Z4nOh1*9&x0w6W1ZK1g$nS-=2TQH`^;O2l$PeFt^#W>P<
zvuXbLWN&xx&yXnd#pv+00=vGA2EO@d5GuC&_T=@e-IIeor|e@}mgHmgMOCx@#X7mp
z;+efQokx4MdZiS+!y$<_HgsTojU6F0bqab+`wAXM@Y}u;_>;~gI4kXl(0OcOlV%h7
z)=25wkFPUeJiqSDq7C_sCs@ANd~V{rb6x@WtC=RB1ox|%aqz2uirlXl@z9<@_oH1F
zRU`x$)z0*isR{w;(AF4G0B|_QJ;yMz6MwMJqwTGh)FbLTNVPaRXTO6A-lV8kmEEA%
zR(Rz^{DeOyJm`|2eg$>S0)|d<uS)KlK(Z?})o(%Rk&-@vN?P82QeEcoI$P!KG<}y$
zulx5(i@CH>JB4Ljh@3|AMWOgOL&d;VsTF!$f|yEraMP?CIU*N)rVoiO#5R#4JF{uh
zEvQ)(>pIys??W^~fksW6I^Blt&+D$#{SBi^^E$(tw;iM-@pnUja1e%FgWv;0kwze?
zpAn&eV)j{_DRK^gd5AfFk~5$!S<6PTj^|54-)t?bs1!il@b?P1-fXB)|D35aa1G|z
zl}>INoo-41nBj-DyuZ47!OTyR8}(Pi%~c2MrMOrE#>&}6ovtH`OXoP?N-uo4{1&vP
zWMYw2Agz<Is7SH-Ul%jK18N_~A8d?7vOSyVRaFs33lUZ~6m*C9rv~Lvhb)K|<~*eL
z6l|NS3WGsOjUxL<S&NM-isC@s#W_NxHpIe)P!q`-w$U_(<ZGwP@w>#B`-sudcYD7=
zC&^^A<U43dw=Y8pzI^&DI)+6Ar-!|lyT`|lkg8t=AyPm7Nv*-Ce7x+x+&%hk9~>*V
z@)HIS_#9WhR{?6EGq9_6y|z%iV&?n|n^Z%7jG9KjW0d^3vki}Mr>7G~2CgWE2?GN|
zX9YFzJMZkW8+nj9f7lNT&Rq$S&J_AVpLp$&n9p*OPsy`_+7j$;P_f(UIuRbN9kh2)
ztx0ANlN7_t5>bn0Jq2b%g8|Lhkn01USK`&K(h}hLI9Zg?)&}keljv%O6Cfm$6uG*q
z__{HX8S1zQA1Ao`Aj-WkJXOCUrKvm7@)YBMWMu6VKMeoR%TkcAz)xyQZWtx+G3>j}
z5C@VYU>$mFG=Y)7P^MtyNj*+r&MGQ9Sm&%wDiq~2cFWsffS!0%<xVf)*npSmuAVB|
zk)(>xzDUn6HZS7oS#%1IfR{kh0*Vv5Xm#Q*lpSzws5HXz3QM4`5{C46`n2M_z7hRr
z^e}pi;@i66f}x@}#~uI1;<}Y<s=7KDh76Km`Mq$MZe9u!YbDV+2<tGpJrdTmm7EHJ
zlKj2P6tBsG8s48or=RL^_*$|;&!ZSIJ_t031emB-5$3i`0D*r_<}~9eGKX+FGT;^g
zWJo%pc0rvKwN3Et8z3l%J7mrg&Do>FhmUcyFu5fXMronX4>nU%jdr-Nh4OgnFx_4{
z1q&BNkr?=sHW|DFeY@%R1IzwDl?5LR0{dm*QMOIH`>?ua&z@C4qqaTYW2Xjlq}jqy
z0H^un`lk2)zzUFyL|PQ-OL`K`l389{6H=U}m&`{HQ6P|}q4t>CrR_Ssj_UE7+Fm1&
z7Az1mjDpfwW?ES3P#Ze8TArZ=;Y2|IaX^m0@3*MWBx_}tUM<n*%}R1PlWLAYr-)pD
zb=@G*EJE-H0vV7=)8eS!Cg4qmE{5fh=z0>7C>TaTO34XV0Sl29i-wb3N2j15yomBl
zmPZG?_+660&63X&5Jv+21imbgFXi*H#~E5LlPqQFG)POKkr~PvS!`W8K7jLFL5eul
z*b1s_NOhqV6>tV|L9N1{T1FH*S<YtHJlz0YrsZUUilkSpu{Y{$bV>xT7Pv*o%noH>
zl*OST(<L{xN1#M-I>XGOY9kpyiP*$j7t`qKlW(wZ!$n(G1)7?^AR7HX;Q~6f3ftz2
zV^YvN%JZ4Mm;MT(znI5|L%|d^b|__7CTiJiGgkkiSmQ-~WE5{si$UqBynpFRb8e4j
zUh1jlM;wVLXPx+;s9NEE;2n704<uVAR<0r`wd<&DEnyi?L35X(NS?#<j};WItAl->
z7itel=iqYE9yR|@qO>bCwx&4Um4K4Z6*2>g;8?GIWyg)@vdlz{3*(tE=%@+0B|*O9
zC?3Oep9xk&Em5iGL<1OBhG~7x%D4g!XkGFKz@CJ;-0GZ{2Hao@x^u6)rlo+5Yf8xL
zslc@}+?m0+s?7^UEld+}^oJ~s0Qw_cXn6xA(gboQ+mzNxBw6UETk3+M-`j=&xMAX4
z!I9%WSjNX|?zsVQEuT>|84KPsq>{+?`C4JRLS55K#ZhSkQ$W5XNkU$jssnaPLBvv6
zCAGN9grvoxuG=MgYJXiBN3$?&r_x2Mm<p-{+V-0!OAuHmq)bTzOxuQezjUqz%>O0!
znFWc}(cl%t2t)yvz0~p28Dg4MSWo)_6MwuH=(+CbIy-x)X<e&RJkK#krGiMlbk%jn
zyl6B7UJI2kFcWG*f-TDg6^*Oz;bjSpqAeaARJ+X-GH1MaPlDgYdoZTOP&C?KZQkd7
zmF%zx*~4~0+D^}i)nJ3kIU5@{zcr4~bh8b5Ox-(a#2&rX*um7_Diw~vWMeggm>pAG
z(~ng~U;8I?W%#AA*B|k7Z@^l3-COgw6%$#XUx1|rdk$<{7hSrUfO^{Dnyw&@l?x^5
z8fp{_J!>8xT!GHhxA%s>?k2d56qSd_b(=!g;5S*!mG20cEAr_SEQd(;4NE)}VXeX!
zCRV38`a&Svr<vS+Gbw7{lMWeCczBVSuVj@EZRIvG#RQU9aVZ7jZD%oxUeEzYelvwL
zrA6YpS336<Fm^x!SYqg&>Z+?`dX2;lki{U7N1{aF_vQl<fDCyq7$s;Z>A1<YH#}e4
zySApu&^STw&4tT!z$J+5j`$DEEU-S9N^VMVTVA|lF#|C?`r7tx9*3;6l&Cn?qS1PC
zRMr0b+y3@o;03Ti63&rX8L}uXTVR&7QXBZ4oq09?Y}H%fuE{cLpMEcmxa{r8(eB=U
ze_L;)=)>M`$ICHfx4TF7FkR`cwT+3V^tFxe7|8>$ZD#YIcx-|*Ty;gdAu=5zDYs!U
z2LV^;(l@6dTElp;wJi{thtnEqtLGJ|P}zLNK!iH8Nd@)~U%%Ra6&P8aEebVIS#qrs
zv!ZEg*|FwIOFDmsVg4Cq@@STNjaD3RMt4v^tN2wx9V^1dNE)u<YqVq~abA8}j>&`^
z{hab_lMG=1X_YMG2BpsRY?drg-m|#Sf<dtDLb(Z_%o+~viF2NA4it4pG%X;~zJ~{g
zf8Blg>7ncPAc6zeRt!daalskhHp|8JG%?15lcZ{Q+GNupWQnVY5sk~0+1;@7y8{5C
zL|=<jR)(1_n8c5i;B0I~?z>SD+S+{&B7wSHvoc+MtToR59<~FIBr&|8HU|%t=w-6_
zyo}BZMYgGPTp;BcgXTz^;5%Md!V=$lTxo`tR}72A<wCk*fK(O|rouUg)WhnEv{E<h
zg=I*lB2GPIsAje6jsV&xMLcrNZA#macW+4n|3@_r=L7J?U=!#;bqY?^k@Bpy?Frid
z;mzx#lSrH>_21o-*GKl%(f;wt(ZSw{Hi}0qY`z}8KKb*}>+hotaVk$vj`}*-wA(U<
z+3P<V^h|cpz7UxETKYBj6ytjCxF%ET^@Lvc)?U8;u8&f+EoyoT@f(DQg~p#m|MBZ`
zosc0Swu;H<ee7W1_dwq!{H;d-uobWeWmur^4W^w=xu8j>Q^K{>3`Snzr5rrb*C&aR
z|B<c3fN|(s=78U)wVm)Vt!3OJ^Hy5K8Dj+Q<UWJ7Sdr?&zsH!}>(r-OdC1P9x|Lq0
zT9fUAA_PqHq056Ub?Ku|r=o%ZkbsSOKbpb1sC%~0rj9e%oWhu)S=*S%hdAi*cJSto
zz`~t+14d-907E+hgv6oA)GdKi584~;CxBPqV3;+>w3ve+F!K1T5UH<gVVq9@8G=u4
zxZdFSCf(?87pArFQK02s`7rPYxm=Emfn)E{d|-UY@ej^~IVTN9bdFe=!!X|ERDD_m
z{}|6DZ_3EQ^9|?FvCq2cQFJ=BC(%EA=Fm}G0W@Fx<Y(^g?g;<%KKfsJU~hDHwH?<^
z2i1eCTU>CT^e8^=KN?1K9LLT%%peT>$DqB&-pNxPh0dHEz#SYk&w<A|8ow(-ZG0z$
zn)=-i?(CUBBkTy|<JF;Cga`p+UUVo!O^!)r&=*#^TrQtZMv^##XKl1AO?c59u%a^(
zpgPwQ3a!kkL_aV>h<0mQjN)Dx3F$C0!xZE5EoEh_Pzv+q4&!E~r1P*LX{QnLA2~1~
zf|++Q$(Fl#%k7g&xefE+ZXr1p2_@f7&(#z{2c(%n0Dw&wrHu|Tq##sH>Dsy+wi+<m
zH`B7i+yO_Gpq8>mJ!y4Ejzq~<;@u0Y9ch2VN2qbL18Sw4!-_lfxu;g?syeHjKdi`;
zqZ)H({DE~04w}ddy{Qr>wZe8Uh1h8Uh{i5_mn05mgpra!#$*JA_uN-?Ql}5A=rlNj
zOGC^d8|jY)W_A>O#Q8nAE!}%&<bFD0XF#S2dM7UuJuGLPBE49s(dn~n9<&jPe%8~c
z7i3-s%3Rp{NhN3lg>NpYy1Hd_E4<C(l+Yd_R9KDb7PjxcQGJPddqr_&$R-Nu2Z674
zI#^GH&7QnIC^Qr%qG50wMmYM4LRg&Hum-Ple{SFz(SlUwO_Gl4JmV&3K#WD)6Y@i<
z_z8&v<SM+igOJTd=;5hbHfg=8+KztNboO1(p?_n7CQP7iVZsNv0t|7qV)^MbC7T0v
za{BJ!jqXQpcF_>;_%Ct}#?%bV9Q<a|GScyJQRENpaM(!5SD^XGVQ)>V_@qKUrjm4t
zP9Vl9ohLTQUzVtgq`D>$3i*wxZXw#`^xCsw5SYZb!!#6I)rv){2?$-@mq=9}+evb|
z)Y+!w(oas$b?Ft6@Y;>gur}DS*tiZ6^T-$t>w5Mz<6>)lC(8q65kj4n!nlY|S>5i3
z5dI9K?iCmA*4Ni<@2|QG>{%G@1~u>{P%V8GYT4E`Yq-Sp?e%Hyosw^f;3eT;Z5-J!
zeATSnO89p9D1sbcda5bq>LnEv*DOR7PTSEQH2HG>aBm+`dtcuKj*CNW>1|Qe(BIl4
z!b%Nzq*ml(R35Ix$IQXl71X*3P*MYXc^MCVy(-w2x<J%jko>YtFXJiuk|3~xP+WWJ
zv%;Jz=x}18@B`Jzph8Ez*5O)~Y3Z7r`Q0?czKgy|zvrGh4VKp2HM9dE!Hv=XheQ#=
z9m6|=a`_!%qci!?w4i{Ey4#@CoA&;1LF$q#SzD8bt)0`*L8EP@T1!7T7)Dani1{5K
z40gdVPy|luEBRd5Gy?!n(UYhmVq!3_$R-R);qXkA<O0?Er(p&k>@*w+i9dp>a0II&
zisi^3dTHH@Mj$F{ffYbj!URI&D}&Qj53Z2}_TTZ$ldyKp5!P0nrK*naw=`i23%&JH
z44#Ng6~6pCXzUa=TdevksWFNvxme5MAi^Z|Cb1Oo*aV3VMu%R(G`1TBWWbH4CT}YO
zKi<kFY?%#eF60K#Xi-uH=@lSL@LDo72`;hi7(Q0W0J`~ch@rc<@yZcyNM!w~1OG4Q
zusNJ`gVF^!@lB#rg&o0$j_R9i2xx_ha~Pm9rUa&tLf4_-QQc|augZz6Ot=^fN*H4V
zW9Tvh0-)s3hQ^tK^A+gkXYn;vzKG{@FfG?stC+#DyjU*K(}n}qP9YSh<z1fuKND-N
z7Hg0L)<rx)?^`~dV$ddIq=I9viOaL8){K|y3SH<=A(#$D3R8=s5b!)HB%d3;wMS|V
z=wz;Pafj%v77M>xBR-7u>xN@OZzvJ12?CRXb)YZ_>=3G{j@A-r-@9(a@LTA?Pel+?
zsqRvy57l$a*aA?o6X~{#Md3#^X#^v0i1jy#iwQ<WDAGyQrqNH&`ueZ?M@I)Q6cqw*
z4!%45beecHZ`Af^D;d7r+~l!heAa04B8EeP_TR|N?0<=&N>^Kg-;qH}z0FxIm7ufo
z)t<D!;`66HXP2#J#5X@wmvwf;c!YjuR$~6q0%80Aj??wgP7N(l#{+X&M^qy)v>lkJ
zk}CAzctpR@v!wF*yO#&w?2UA)($}y5GT=M$e43t)Z6Yhsc^sX*d@*{lzyIc&gTogQ
zWc5KGsL3=3!jlrTg3e<Wze6W03N$puK)8yeO@XK?(-Nc}il!<c(qfX0lL&hHylf!=
zpppK?VlgkDJbZY%JpVPFPUEdvPJi>_{9$>KUyan4t?_yKr*!h{%m4b~t1ll7;NG@z
zf^h*-3dW1E0_KqO4Ac4o6N$6t<iaA%y@+K4O;Ox!j6nWg5oI<8`WeNBp;QQvp%%9(
zo=ns>LIfUMB2KUd4RL5yFY1|Oj`|xTWQH*F@IbOe$hgC&op8+!sLFgZRd$e<;QN~z
z&;k^%dyl%n#<=KC@3ScKP&Y#vQ%DGBO@rn;!yR@VW%H~@xn)f?9DqI&dMJBu-j4QO
zzdbzBQKNIto~OfxPt)uj1~q~RJ_rWr5{<yAbMcLBgnI=!XYrT<7C?K7+etzF$0-dI
zNuNWEN+2rHzwF!r@~zy5uE`|Pk*lFO7!3!8#^@6q$@%5M?r|TsJsYfzM)5-7z*C6P
zGwS!%)Z;She@0)2sC68`VTP$HxEymtYz4A&;3|PjJ%eQf2kx`<y^e!KcoimVJ>ldS
z-W=^a!;lYDu<qI(jSvd<==P@V9*tmKe4|lshh>*ka<D^P(JpuC_1mNUed?3DG!ljl
zlpDD7Qr}kZ;#FW`A@3vE)9i-RG0cYBTZkF3i|KXEg;(z!8mY`wDv~y$DvFR@bJ^8<
z{%fG)5M?GiyIj4mH?NNmez0o{o;#zE|IfxoBwT;$7TT>C7zpKr(N*L-^MXq=R<lfV
zC!Y1wam~M92f+6dK!)i41q4ia$IgK7162HwdIC3_buDhCzHd*}*X4n@5ozDq1@QgH
z^Z|602e?o&CK?8-p||%<3ecC|jfk@Ft$qU3xJes|6~5a)86Cgb-#hsBVE;v5ZwrTc
zaZKEGy}$1ty@qOiyNBUHaR{f%kXj3C?ZvZa{%0F<T@S7;Xp}4T3)Jy?kQ39HXGIIm
zoyv>@Hc(Dwt`rALtc%zv5uwU0?hNe1YM!F+SJ6@Ut_IYCZznBsk+xZ@hhm0TNLrKd
zB4ifmrY!jF{1q0gzv|$zz&dO(!<z8$xASJmx;Qa34V(Y?<K*Et1+(ww;vk^sMlKE&
z2&%F{8(gCagnA}&z6GQI-A)sFRUB)7qiVUi+e8>01jj0!3CNSS2HIRWYxA?HU!00j
zK_yi~ZH|Upd1F`&mXBU~_IUFsK?>#Npm21sC$4erB&B>w5V!{!>J(F)Y0;92BrKwY
zji(Uk7owQWNDQOOK-eq@FL}O<i&$~!6m*u;yCs|-Q)~+u0h^}na4{fy5d-yT;-Qrw
z#hRq^bdfL1>2*}9ftP0~#9oYcCsv6lwg=<Ht68zum<FSO33G~|{AgJe&>xl78ec_i
zrP=0u3UUWbGC=hUq0lAKRe`MhFjBMQNWUDWnt~^*c67*Q*2QjUBbGXY9tM)2bB%`T
zfOie2Qq}-!eQLN$2ltv!V+F}%ZCJh)W)}cCN~;gw$-_tK_EjS_YKa_!&moqKM?wJ+
zx>L<%6i|da78^c~QZ=D;nH9Tf9^2Al`;XA1qbILy&=<0dTrrfC#qF)cCwstD(up-w
zpzW!70y%lSkb=}gmuQ03j6fcSt)Fj|3u)k^oWhOlN5y=gA;*+R`c%tp460LYux0r0
zf60ApH9O54m}z!)N9$KI|MYBvA8q>>J@Eo+f6PeQRidoP#!_7H_Z`A4NQHT}pp67l
z>$z>B-)={{-DF^O#;je)019tv0arqVA7OM3fkkf+QS{T>Kh9UYWCE9JNW?G~0tQ7e
z_>n?y9{aJz2DV;2N0*j}1{qj{?T@nvnmBNngL>YXsH9%{o=^2fGMy(yQ0THE?~K~o
zM(GP>?R5w_+9@85mN^7ZEI03QcW&+)4-f+fF0+QLT!+hB*_6LRZL+C5U#4M=_$jn<
zwKAx>r3mbM=N0c6Oc`Fljv!YfuK5V-*dT+Ei#eLb?}rBG{XS$eRe20Y<fWaY)ZdV<
z0M+cQUe@Pmz{U|JWp*b!3Us-pq+DA%m5}CTIqW#*FH?(w$=i(-fcRQq+JR5zxbze~
z+mj6qFm!e@1~u80O*B7_=V~;ni3nsHYAj<4-Wxd_?|^JKs1L(b({zK)(wUTrwL;le
z%nrL=BoA;=r0<O_D07|Qi(tMJKi7%qBX&AzC(@{@B-D5uVPefB3a~{XI5XWzMVy@{
zBx4z0#MzkBKT$?BKW{3o_*tAzbujvbvwOQBz!fbZjN_uf81ZP(Q2~P?rS$_SA)yhZ
zxf0!$5HmcPlrs5%Ttj!-mMm(G<3cAnD3!dKSh9jQ8$^>~v1HTj6%<A`pz2n-miw%^
zD}9~BGeNrDOcW_@n1J-k@yM+cUv-WQ6S!wse8spt<m&RiMfT)gCaxr^R{k{nsB$Ms
z`MvKVQ^LV}0ZDy1lM9Acxw^8TNhGJ-qzrk_pG5|jerjpdzr_@HC8jX({*!3;%>mf4
zP1A7-rlj#{nNKevWyqpTre|=+sB^qX#$^3_9;cAUlz`;{HbUS4A?}hQ9mg_%E$0D6
z5k2SH8c!8AWg2B6Qv*W!*908Ey!*f=LwsGR&vB80{2%+Drn7WGDg8Lz5@qt5DDoju
zNE8zz(I_y<<P{|-z?>i^qikGaYAl#2&q~h-hpHNe-oUojWDL8YcJRA;<}`|&V*M1-
zA`lXnHau(9tbk1-8ol`v^+@?cmZJ#@9JYYY$!$^}-KRV;>VdYvzkRu^5Qlb>W>u*D
zW-g;nqa6&h^vQ0?iX_cmmz5lX{`&t$(wE9$o&*Il$OGR@8e#4vUmAhYuZ^|9jc;w&
z1Z}Pu2h<{!e3Mh!WO1LrJ$!q-|H8YwU0&IVtl`e4ti53?S7_zd?0(G!ui2jPLeDzh
zf0-}W!*D~;DOw?q(#w)<_MAg<8IXV&#>cH`WyK~zXW-O@+G|Tn;=4GPcLYeae$JCB
z@#jK`9n0hvU~uaQU6#<S&_YNqqB|^q5ze$LoZf&7@68lj4>3C((psFe`_!h%q>LUq
zy<{AX6%&}xSg5|`B#B(Kd);bQ`S-0y6Q0DdHv_-tMV-U4UI;E&QN(>3pXGL^WzM(O
z;`T4*zNm5iZuQW1R<+qtdX->&!DH_FNw)|tGsYvX^w;4dUA)qc1-<)8X18oHzZJV%
z6C9;A32(cRZih9_Zik!80CH|v(Yr#m;`XUW`GU9ZWUp~k1TKL9E>!_%l7@AA>zWWy
zGj{*JCH{R&eDuf`cXvsY;YfvzmqkmR+g=)F+pTdkhDM+E2CUb@#RSB3-iZyRxU&<>
z8VPW1Mqq@!I;r(dxt0)~%PQzCz<Ae4L~cEi*6Xcn58Zi{U}h}#qZ%)!%-xPJ;v(9}
z;#neW+2__KT|G^cY_30M$<^G^jj9*wyO$VCinDz$4%M~D_M!S!Gb<s%hx)lHRGIcF
zd63l8{_c0X2ZwSq=#2%fn~Q@v9GvQVbPCR0j1p)WX#vf`;gacfx~U|jai-m3bhW?(
zj9p!h>1hBkG%%>IbLR<W=<a=B(5B_P-gnXP%>bZ|lDY{T*!2^jKntc9>Xw_|GTl3Y
zg41gY0b-xcrqfiKQH4Se0$JP!QQ&AS)U4kSPPm!h6iFDsz}3{tcvq-mr8(a+q#rLi
z%9%&=LTzTBBV3?G+h}~M<4X)9iAn|<YR0GeJpN_LHa4;dI{vXfv_^<p?cIluo6!tw
zaz1(@Y65z!k#^=?;U*7_^=5RPUG^nLw?|J~8~o+%@$NS-_t6nzwD<b(_{0jWC2>~`
z{Ty6d(M3~q#v2JAZ!CkhhOvq-cTHpIm~H!Foo;e#9oRK2wyu|3bL7zN3RlGK1)KY@
zGBFt1k|13eKGZb<20l$(0gSzq17i*fQa4Tt=2AGl=3tfZeVU#YaRHGjA^46~`(ktx
zXpAjuIVz?q@~%JN-~`m$!5PHyiRYk9Cexp>YI*@SNjfAZo32fA)Fx-w(oTpqsIxfD
zdM1b_Mvloi@+bEBcpyvahG~{GBQn$#O=El@sx!Vwrx-$WjA4Z02<+1^)KWekFAFkw
zqkY9FMibRIzy{hrQ5(=2HuI!13ea?;dKpHl26Lr~k&zXx#6%aoh$j^NsDL9oy^h4;
zl}R!3Vk;7g??_uJL!_BYFi?P2ptFbk9;Q=9muZZxg!Ud%eJAG-JE|yoGiiNz0JIs3
zsZq7&T6MXg?IvY<ex|OBWueUjCwT(KhS7PRPong!=ce@lYicxKq{y#wo-sywdKWFy
zS)v0)nE?|pVvHzq6<m&~EwyL7Y*Cp{mpEFC_5;3*MXnC%Of`0}z|ANZ6d}qFpe5qP
z+AW?W<+w;sVPvQ1BMFlwP%U%zdQ7uRu#doj^UA?u$9lZZU<sI(S*hV(Z{O!7zUHt*
z=~?E4Px*iQC!QEVG&+!8^*!C-NR+^<A5p7Ant9>P+%8|eJ=y;OZ;R31H$AuMIogfB
zqh?hT3eN^fmENeP0`~b&&&0}jiKWBnXCT(W2?OGT_>Op$;Dzp3DW^^73X~SoNKEob
znyyWKNmirZ^8nQc{xw?Ui<m@gSU@3&OyLwWd#JD9so!%)iuZ6M+8zJ0Oba|G(QLU$
z-Y1A~;;4+zk|-}GNkQ^apk8I84%NvbyxQ+PN$en83d}BOLU0JQPzJEr2rL56i+q`B
zy98R&%4^;5cC~+PD_CFR#=SiX_NG?$8&&EZN0sKXz;xvhpX?k0@a6DY!GJo)c<{wy
z!_C)Ek(i0n=xOwy>d%7*G!p#wGkyD6ebX=-{j5unaJto>@n<dC1UY(7#M##p+EM||
z_(Batzd)PX?I-x##BT_#sPtx1|4v~kc5D-mLQOncsfov-CLXWU#229^zF4V=FGEdy
zxl$8fg_`(kr6#@(HSzUIP5d#`#2>php%7z?Bq-Sc0WO$u`V$I5ZRGXNF{~b)5361Z
zd5JW^XbwYLtZ+GS#qPI*xf*^aH-SO)-V(GS{G()=uxY$T_-b<b6_E)<U@5||ME{Iw
zvVgD$E=n?MQF99+#xhvR;H}Dy+7(Zw5>H74#lRX^fFR6D0Bovr!|R}}$q)WD*gS6k
zI@DKeTQ_)5w-i#xtmYgcM`1~~4yWOcpqD!SzYDx}{+(erQ011OThn4K<OT=b2Dmky
zIB**-gK~^JmQX-E)jucGIfZGFQUiAWf_xf^Z^Hnw!1rC{#o|KouA7>%2b=GVh&Q0=
zie$1JLo$!}91MIZh)WNnx{!O^BWTjgI9XmGTc<cg2#YfzSE}tmK~>^iGGA=5pd&oy
zlE$G&h@qRg2k^EESS66po@O$)LcxoJ`T}q@RCl48>*zwue>wc>KkE!=STdFRbx)38
z9F8dM5sAq@^#1Vge;@as0@kzyap37Rc{oYt<wJcXJS>ax!wRa{8n52Rw)*$=*I&Zl
zM}PckTmFSFUu}P}{f9?iK6?E1S6}_{@fWJxWA*QgKSbMiKi%rTrJ8#YMSobHF0;k5
zp<K)Nf6;%RaSUj4u)o>e`^$GnuiqZN7^xG!zx!geH&O&|Hl8jOE?hUzf#@)crw^rk
zCY~uU+PYZpRzbfRap4kbHdZBkg2g_9q&j*LFXAm0BvW#xeC}aq^<p!nY)}+Oo7b<p
zY%lh|-F^G=gf9Ock}mON6Vpgh<|bFtiLIgC9=Ntt&Yhw#YP;C!X$N*ya~8j^)-KUK
z@Q1+WzC3t!pc;Vjy#+x$g}cWdQB<r(HjF60F<mfdMh9vv9I!(bETSr90W`o4w0@vC
zoiPgG&!_n*2u)QZAa30SMfTW4L{k@744DLA&?rm2dYDJ76~QiJEI&F8c1Ho=C#Yyk
z%(`TO6)_*f3${ZbfD4gkXL&SFicR!?qm8Qc426I^41b{&{x;@(!&x3>2}u4yQd>a&
ztyvP4%lTZ978Vf3amEv>4shpVP(nUm`$l5`_1}~I(f3EYZ{F-5*%SJ7GCdn-TNlqw
z7z>~g`WsqYPs)bT8QkW5{c;gu4g!cuJYHzMuoduwFJrVp3Spf;Kx>hW-q<z(yo3})
zdtF}@kV35>(X(c1{As@2{rlfW>c?N0bx%ubB$?<O!ur{US2n!6B1zSxYx)gO+NhMm
zbBDj~{NajPjMVlkS~F=_49Hr6LvC7yfeg%7-Kf4E91bILx*lQ&R)8NVm~H_UonXtA
z=v45K!J~?<gkbcFEPWCE(~~AeALv|Ej~I==Z<*C$RE_>Nkd4>0RPuonO?9irx#nx@
z;Z}ukgTk$s>Iy_fuxINZiV;lj5J|!p{9z4iAhUfr%95*2olD8B>2{Txk8V)2Dww!o
z1BOGasb2#sWP+i6t?g>#>edxkh1i+0!w7+o#gkS)w$CURfb$APmKvAU3|?Pv@nQsP
z;NiZSOQ|xJVGt1M`hvfRLaIfs;&;h%K7zYyR3<tCGgQz<*Xrlya|XgiKAJC!^8}!g
zZ8E~HsZ?vBPI@*%9VHcBQ>YPoq9FOUP&rK!8U*+HK}1nXvne1ESiK&kfaRd8#`E<I
zGX-7uh4<!ozT`Whnn~%;yMNsu9mDpFj`vS?zx@_Oynh??)>I`}f)Q3P(Uu0X(LgAL
z{(X8i;CHHGU%eSd;yqivfr|{FHfYKWZJSPWe%3dg3}j`4yZgfKgn&nXL5g!nTu@BP
zC@OYJ6y78uk`A-u0OP;NBiLTdj(U*@_~5&$h1NZUd|1c$bo}SnFJDA&4-QYh{&KX}
zf3*Gh%Ym(V@bcxs>qGfj|HHgCuQ*#OZgQlNW28z&v$ACjuMQ4Js@eUczwW*q9Ue!0
z-PuD`f8c`%dsz`8%?MJFEH@~*--v2;DQQ%df{0XoP%~R7YHr4m?5py0RUur2!VjJi
z?YsFLR)3nG|Cs&+Q3BLiQEa(-AUPbiMhzXmdj0z3&&MbGZ`6F%e~-Jh*tbnao3?%R
zTaWCg!HyFboxKGHeQ5RhbJ_7X-@X~hIA(hOJ-K=u=!p@6x$_{qQt-<2*1X4l^B4$2
zz2%=|K&o(x%Y+oyz%4L#y3Y$RTfDbkLW<Ebd3g<t;rR#FBL&&9daE!r%Z~Ljw89*(
znt=hc(+WfwMtEvK?>~!}m6_%WH~l*4>%k)4o0Y?8_vH1f0|<uva`%V*7h1F{ns_Q=
zZAWj^>T>*vM4{k9F`5%hRi(~5Q701}g_@aHK)yWv5PNxWs2EH@c?t=>+~0q*<HjC<
z#{C)7*vt+iHfKbhm1ctG@az~7VYT9OLhlY~6FoC<z}E~2+%-J#`skuI7?)97>}c(|
zIF3!H$ga0@hMt?mA3_Jp8cqr=2)$PtHi5LF!(44ivAB+Cs6{dc=`n;CKW5CwN$nD|
zQ>$-PV6Rw<AXe#Vs5Kv*yC(+%fALtVP*mN=jlc@m0ut}`^fWk2AH_ecc4r}G32lVB
z7Wd3!GZU1UCs_#*<B;QklawjQijsLgz98c)b#c&)aeRIC->1>zLG&lp&J#6ehQ9zT
zZ@_4ROYKbw>}5H!k81saYWTUTs^dF1K|mE1)hsa|IBs4IYI*9MGsMx;)1m&kgn60Q
zW{bmjCSQ`%Q+pV7#pj&?tp%KLp@WlKGehn+%%wj}*rmG~=CXE}LXny&3NJ1cd=aU@
zo3MaP01LeX>OI+S_Qh&G=t6}(wR<=qsJegO0M=6rSkxbb^aFUWj@Dx&!m)n0)udL8
zZ!A~szU^zcZPW_lFS(m$DI5#yX}HGJt6_b6^?E;epyoe4ADvC}yyyoo^@HdUD?VGc
zxxa)Zo9ZRATm8hT+Bd&L09L^Qf1>SbM}bcyk>L<R6aX|p2MHd+)+H`sk0Wx@)|ny0
zm04j4h#p^^>}wQqAS77&>5<|u0S?ngM#J8XqSQ+0&F54eZ(H`G*IzUxf!{PDfSx+x
zX=}-&hRKlf_?DxbEr0#BZj|`V*}F%;OFUM$kNWil*Xcu>JOKHsm1F@#d{-!1LwmRL
z^A8^AbJQpu0Jj^k8%8T^0J_B`-POlBQR^6OBq6~|TCmH2DmuA}Q<9mlDJ%eQ^0P^N
z-M_!Mv|*~51YNNGGp&Pt50uv9{(bpTp|i`a#ic?QWBpSx;A3^*fn_CM6yv*wfMd>j
z7y68CN(d>1c0kjAyk#hs(Y|RAj8w~-@(ctsRzw0X6j;%NI_+E92t#*<^{X+K_^X-4
z^Dgw){rf$#8MVl*)8u!En*5#v*|Ez2?Qb7^AWjoSAD>||=|yx_K%j=p0TY{MFM&E^
zp;Sd)B)+kjNPl0>Cm<@8CFJKco=m*zl3OwNh~;TyL(x-SkdBM6l8}v?uIU;<(k_m|
z7?q_N=W{q0rJ0!n@zqrjC7m@82NeQpM3_!<4U!1rd4b!G1qR%ldMR2P*wR_BcvdNI
z7yjOD4~xMWjVDIESd@Wdvww2%YX8OSw<p^1%Y*~D$yRoQk`Hy5wjSSEI3Q9@<2w)G
ziI1)Lj)^)ANi&e&do8%&B)DV^2Fp_j!@X#%wj(Ma6oy5=vI%P+_rVdM2QI)l=$M1b
zmJT9u$N7+kg?eTHf|{--ZlZ?}Wo7`+phX3o5apWn<cJj&6G4az)#l5RaiP<!Y&5Kh
z#~vDn(zRCo@R>F-N>X1YT@ls$gvu4Dc4(vXZ0zSgXrWcC(ht>rl9ZgK*{G3!4oFZe
zm)7QUgEA%CIffgV_?Dy~j}03ege**blhRCBlIqiV&(h3mYap~tv!&&DEFsz#q_&O`
z?6%}CPiF#{WhwUlzhXBx0DUdE@&{HSCOc8hGzUhU)-3iWbW3>F&t2kHfxHVcg3n?x
zS`&S(6=SjyM^GL{P)3nF0>8(ptJ3a>qR?DL?P1_J!>1p&e+u9v4vUmuWtDKYyygwq
zLC}$*MnQ{z!-jic@|=i(QWQBs-*Z8%<d`Bm=n1u|7jS&phQ@-AMdtS!kok^X;YQq#
zRukHM#CB-SN7kGsf-U6pIR^DzbI2D!G3qb~+Qr)dr#HsB75i<A_G=f5ZDDM49IHPs
z7v6SA#4kFO8Q3vnC{N?(Jk59owW$dt6(4kJ-&`ynU1k`)0CwHnR3F0a)?ZIF`j7^G
zQCzbH4n%GzgBW4{6d*d-x`wt+aq@8qd0B*M5U+y>f)TU{>Szz7jet0~`YY94#C>b0
zdC$TR+=@+V)P**ByGV+3QDPg4CBtO&+)kv(SshATy&+9FslnCbnYsgj-o4M-Zc`$k
zPN)!Y&aeuQvtH2Wsvx}WA0K=NYI6vpr(mN5N$7p5s}G>5Y?ICMM(Qs{cE=v?URR!(
zR+G(Bk8hlF@<74$I7-y{EI7$4EeUkI6-D31=@fJbXn!9pgfZYLaQg*hO+jz*^CF(9
zd-Ec`O!LA-X-5GAHqvROXpJm(gq4!@?P3{=UDd^zn|Q1u=d)0<&Io%Qa<?ctr~e=5
zq5=k?VtUjg)!>4rBGmXtwmuY_GL%y^H#1nWVrDb#D`T>p@!iYYZQH5btrS|L<}|9o
zg{{RlGKLL4j(BBk@GFO2!!N{OYOE)s4%&7AJ%!Mcn?#K8qz-haDPA3<QRC=l8E@@<
zzs2`ol}vp^L~4x<tW|^}1L`iqkLgb}lxH)Y64g^CXyee8)zI0c4>HR1lb?B}EAHJ*
z_QoRdGSwzp8@#a9!I>n}_}YfaK))TGDu^s{aS2GA-;o4pVY%En;gw6B1lJZW$Odu<
zF$Q6ZuD8&A=O*r17w{0diI?9n(ie_MK9XYhb(bv83&&+J(3&_Q0~8UfxmEy75KL0-
zvl99O<U`oUAToi!5F2UC6GS}{_ZTHVn)4GyLWmwxcL3l_^L%debm$~(){aEXNShA$
z#MvrGx)SE6QU1S;?6qT~igW@Sx^H7tlWB=Fnkza46R`o(n8wSDRN@b<Gk~EZSQ_!y
z-J=5xKDB#vwEMR{92kx0&7KbHIAF<cry5nQf}w)IBgj$EB;YPxQN$EZRz?SUM)x$<
zB!f6S9W*bYtTiY-0+kPIW$X8-fuUgf-eT8QSyd;-Ni%pgm>JP{hkH>$p1238w?18k
zgZutv*nSHHggUFt#u$1U`s?@tBjQ|TQBHaJc<W+Fss-vGhy<Njns&UH8oIWOzzh;%
z=B#mqAQrS$eQxkPMtuMja72ky0Qv!*h^5J;Q!kiiYhCn$ULBxsd5f;j**0JDokSHR
z^%&IP>#l72T7}7OKSFDS#ti#%6+<j2P5m2LRA^bAVd#^!TKjKvjjz?Smuo9=^b`_f
zRgSz~?BwE`=FW{FM94|(8CpHmUnAc25fHfE9BQ-4PjH{DD$?nqc5&SCN&nJa{X(!f
z5wuIgz3K^L_=Z>!ly7hyuom_#H^J2<IwpAQjF4G$$!Xo(<lr6XUYg2{_lA)Ds)xgu
z+yulhA<+%$2s8{^eIii!`n5ymQZ;*wM3p*}4(9ou!x{P&Xn!fizaQ?t+8-Uhv3^@>
zZ6L(&D4X}~tLYg8zB692qtkQM#bkY8Ed34nI!_949w6RE0i1l+Set>Z$x8yH>H|B&
zfhMHr3Pxf|wVdV?V7V>b4Zx*t;O|ij5NY3CU}PZ<;rN1*?U7)qga8Z4*;z7PDB2M2
z$mBhyIn|Nz$PDv}`7}ep_o*e$2+X2Ete}X1jEI7INyb3m-67OwyplOs$uM%4z{E6Q
zsQP6YPyJo$)!ZhC>1=a9ZLw%oQt~F3dYfxcx>!{^&{g8!B$98x=J3J{9)HIj$v^mY
z;#*)2**cAg^%w!7y1U?4n<Uz5zeWMv(NplBW}j;UsrV@BW~<p_GZ<z=6ty~2EOd0Z
z_vUTsGFRF%RH7&|-snGSy_j!)Aqy~tfg<$}>kB4ZR)MnOb?r3}gdjsUqkR#w9;@6s
zXr|zHQ%_K*3zuxYfue+jHo+dNN)gN#Zno{7bl*79JWOGuw8rJN;=7AH%a`T!8cg1(
zRJ6?mZT;>pwj1_#yI#=d%yY4AiBEmwZFd%X1r=9NU#qP;t+gFPXhoa#gF3$~CwQfx
zP#h|!R76%%Vz3-reV`>4=H9{vs>ZLBgB-X=aOEtf*D_2kH6g|Lw-L&bIIiwW@nmxD
zT~#NL)AG1Z8Uea`w^!8+IFhwhIlvW|sd}Dlb(Loq`;|JyeZX=2pRMecOmf{KK)93Z
zCMctu#SkRAn`mwrWmH^>G`2g6G^l1pG{-Hn4}^`of$~UW?`y?%7_k|So+5h*4|2oX
zLSPJ*DKP|fz7UeV#O8mdQ!c`tZ2Qu_I&+_jC@1q2C3>2**YZ#3<zp>b8pFmJ_4XYr
zTX+BsqrAz%y#brp>0-Wtw4}o}2zv~*Zx0?ANNl#$vR;2593;_1ZW3SHfImVJB>vf1
zym(i{s5yGtlFL^GNb$cTeBCmc#k+|Ld);K%b%q~J7&U;kfqlR{>uP`k4Y1-m=<^;W
zal!7FwLI9zir&#hl17cy6a$RXb8Y3?T&3;l(KIQkNWZBp45k-=SOS=L0EOfL8gVqu
zfeJ#IfYGpWRQ>Oh&nFQm$6?ut8iU%GagoNLEz6yZ4O~@2R&<<4@4zt@BSJv}i&G8>
zMQWUB0?7`by(<jluX>;s&Xx<X#y}rVtIHJ;c&i3oH3B+e&=qt&T-g!5#sT*C=_l?D
zmJ#q{n)=7{{uZ7);19CXbG<y^T}bdD#f)$ej6*=kgq<4EgF{Fehy`n$dBw0j)R@~Z
zE`%yI=;jF6HU#O+jm}iY>fXdYBL`;dWl<eTz>nH7vCwXT7x|Ss``I-LV90;`D&d3_
z8l#fy;3=6=fP)G(p&dzBZdX#;7gb(|B1srCbErLwn5ljRJKNK2z%Mf{W%@?flYd_C
zjh{(BG`o(z3d?lD@iHLJo~oduXH;5`Hls&KKp8obsQ26i+i$F|{?8NmiQOW?V-+zy
zu=&kfxBlE+uy4M7V>HOMUVIOpxf}373yo+;naACc2shMBcYk50T@jg$cFl3t2wjpv
zry(nH3dETRJC4GMGhX{0YLO$SQ>$q;bh_N;*@j9;AqlL8^IiIC)<<mWWP9AJqNXR^
zeUTl9>5hg{I(m6PNfr)i=F7fC0+MFGms+Y@hu~_KV0IX)A4Bb*Av3-14E8FMWNQI!
z9r&SXu#I8c?r_Y3e%cH~<P18r*09|j<{yeW_YtOVySanei^du?J0Qny1^7x13uGJj
z6a`)cENF<N?xTGr-u9ZngayNK4YUMjWly#+2Z(s9eiqgd(>OrgeD6Muq3a5=P#ajz
zLEJKi9=W?3i_w5rc$?xbYnRGYCQ+|fX*-ZLdc3+YjvYccTA_;LQd_6Yy3L{Kx4VDV
zHysd0<4Dzoy_^Yv4@Wl^WU(qO0xLQk6gQ|o8{(f0Fn+UBv8tGYxD?<K_G3lrSH(DL
zawxG_K!8J*QNR-Ha5WM}uyr5EA<$t17DlIE&<f@<QcPZY37Q?vd<0D_SG4yr8}#5=
z<VVjS%3QcZ2X`#!B(05iRym{sz!+roPtC>ZFNV+5@H9y;(@9b@Kwa$?xF8_Z<1ni2
z41+02AtCE4di=NRQ4)xj>;{&0{M<w-H}OkVD;%owESgNq>skNk<fWR={tqXZc~_QO
z*Z3z`UG~@%NL(-qGR(j<{`DGH9s(T%BhqUxS=vg>lkDmZ_lp7&WoChiXa;rtAKsk)
zu?~7e;zvE7AIs>pOs7eCM+suT2MceQAvxEBAdK+!P|Aj9fG;p0TnT{|P+~@%BszgC
zX7P;Q=_In%(Lnnp<`h+(Kx9d^I0;LZVQIiHS)mKXrpFUbZwrWs^-_taQReisHgD*_
z__J6^tk9W3bDZ&$RJCfHRaG`+|EwW=Yl0d33{}X}xA8Q03^gA*8YYZ+TbOej0M~{q
zuf+JR;D7;!EUzIu)a%8zd*1JbErcM{TEn?%(6@8WiE4{RC~NiYoHL-*fP#rB^a=9m
zhpuamK@3;G16pQMzgJ;Zjy7BDsA9*(ud>Vjtg5l)+fBK&PN}NyHG*huTUnQ1qcOpT
zS)vT$I4dHmp)9RcV=519Mc<?~W$GJ1YpxCqQh2vRiX@^X!)KlKeCyS(<aV*n1-?Hx
zIov-!9v$r-{w1(9-@SbO&91hBaXK&J?A<7NKb|g2MVi%sTAex##Nzez>fkgk71?Fe
zx3dw>HiE{mDc{Nl73EOgbzP`7Fa_7kgTsBjvULLukPu>ezZto1b;kDkfgQmdA+RID
z<&tk4ZM;?kM}{UH2B2nL%R`#sMVE3fsmY{(yn>ji&4lLh7Sj;%T{!6a7Ve(6|0rC!
zPQ+co!M}B0s(=6cH2+%izm>n<B;lL)uQ~tQ_LpCO>E(ZW^vB1K9{oH2+o$+<r<vUp
zv_NV$LyGObJoxT#|3%;4aXkue!n*15*U>!9CXdx$1%N*uzBxYl`~LBRM_`!sPm}85
z&GFwy*Gbu*o{!Fp`7lzf`*aZxA$%|X8i2dgKYDBZe*f=p`;P`spHfK(;tOx6JiVr$
zgTc^gJ<IDGHwBOP`k4O<zhPNj#@3pbzYe3*R3X~=d1(u%3m|_7;UU#1p})^QQw1Bk
zT!VEO?Y-PRKHfjp!U|pn`IzPU>3C1g|K;w{cl#qnT4GH#dys+*dLMRH+Y+4RV|s>N
z!A)_u<c`*&`-Tm}YoeyzZFV3G{ZE=6Ozbg^9;e3>Q#bz0??xvFhkpYZ5X!=P>`^*N
zFQZvLSx(i@JSnr!7dllNd`e4X)~=&Rl%FI)smJ=;jLRr$Of<Z1m+<j7qwRh=SWAbH
zzNOm#quys%ae*mX)?YxN7<KoT^=&<BYU}Z8Z9Q&k>kFso7fnUKbc%l2RP-yS=vPfe
zzjlg#-Bk3CPSHO$75z`A=zlg9{V%8Je>HC6w!2BqJO0QmEVi^vIzSfDay}?OjUH72
zMMIwf!}{8ftDvEqG40jY4nT`;#<W*oI{-ks8Pi^U?Ep;aW=wnawF6+Ln=$Rx*A76Q
zZpO4%UpoMdx*5}6eeD2z>Sj!P4bTz-S>2Fnv7vqlicL$lP1AxXtS;j8&Tm|3__NQv
zFVu3)Rg0h{AHI|iU&)8B<-;H4!+*+$|B?@|!s6+Xd~&XIb+>(N`mcrlC!?j&Y!=UN
z&Iq*7|Bt>_#J-#V`O)?t|4sjYl7E%_&-*`|>>r+tUcK6V^ZU&F+*C?}>&H(L4Pt5(
z)E3DiPP6D)MHYRuf3kaUh^GG_9O9cC9w{p{qd<7^Q4;!cECgN_mI|rGVQ)e3R|TP%
zaY2AT<{_S@=h;kE9C8%AUlrNtM8(Tzvy{SQnP8t_dV<!3(2LvtFhcVD6@b^?{(&OT
zzw6sRNM4E@3na$HmUnav!$na1NuKgvFwlF?ocM=wkZU*tsUh^EXQASOS8GyPuF6tb
z9gu|r4r7XIu*{&ctu}BvwRL_&fm;jy|25B&TT6hN@&6ZJDctYNf4=%+```HgQ~dk=
z;rD8`=)b={-0yuBMa%%9F1^f`#W;!1Aij=z1oa2NY6<o`FXG}#q2vDR<LHOMmSKz#
zd6UsMx_@)P$g^CH<O*10%4<=AUY>_Xf3_~7S$ci}*<+$bo<kg4(5!16{pm8DE`SDw
zWbP0SaGAj<6!J@o=rSov-P`NqAGW}gN$cyOM7e;b=6OjTc3hmsmY0bh6Y1y|*YgBc
zh7)j%c(q~T3L^<Ltk&`}nLvy>_YL@rF#hUqAV%tk+uG2{$=R*kwAA0Af(;ef%|uig
zcdHVrdbwh6{f)CCX_{7bLJGKB`k<15z9x`(J-@E43Pouh#}^9AY~Xu{?6V^rjr$v?
z@nU>2>bS6aI2$%{i5L+z)oBg92Dr36!9@<)UEr*cGEl#eV`q4k-~mTleO!IFY3oMT
zFQXYgtD9mVdk$*8CB}uArpZ|s==l&i-xM|G9X2>!GowOO)DivK!PkN&fTq-&0;FuA
zcDNg~D=Qc2xTKS7Ruml@OSS%xf5lD;|M)LKw;TL`f3Tw%WAS_lbt}g9P9fnDktNV<
zGRuo=G_FmG(W1YAnA!k$V*dE#0pvimh_B2#aDr2(G2T8KeM{9GilvKO_^eq+A5PU$
zx|8W|B-wJ76!9W22DQEWlk=8f7@CR$a_4zIVTf%&Q9xfNF%1iShAXATX+YbcKy#)M
zQFfZ22TFRlP93mZU7BQq)zC4OBE4}_ISWjIzC&=n;jaM}pJIsIU`MhnTl^_<6>#Y}
zhr)w^oNYC=^LfXr8n^4xO$*Bm-)QuWB2@lzJQ|tm8tO#1;6{Q3PiVcU+W${S^EZ7A
zOm=sAVcT71@nxJ&acU5aCSNW_ggtCTI37%q07|Xh_zyLwNu4@ih7_;jAqXmco*++&
zEtTeIg^rFzoATDdzI6}YsQ6JWZoHf>@HLs;*%~-ES*=LU6{sbJKSTK2RBxHJ)g-e~
zPzHJ9LWeor0UY5VI$LJActDhbEnZ~y2x!9Rpb^;mdJBzEMKBVKOmKCPU_6C%0hQqn
zgY0+l0tiY<dbPM%mgME0#P1-DWUfeNqzpSPqBmGvPN6$HIXUW!h6f)*BH_qS*tXgm
zwA}JxwBZhVCtS%e9!{C&o5HCxlH?6npQjLr1HW3lIZ|(<XVK=PkF+}9YWSHK`67oq
zkC+>XdB7>Ncz7DpN@p?Yu35uT!|xD8yR`j$0U?@1u)#G#%TzI3U&=s2b;s>>6&h=A
z=ki8lpe<9hWVmAUw3!=dsoFktO$Rp)UWmW6wP4GXT=KYWlwDe79;OEM>HNNovZ;#X
zSL$f%$|liZm{e5AO`Y*l+y&?%lKiq%qd|JFGEU3cG<GR_S>&TrTDFPTllWr$l4r+b
zAv(?SJjb9Gfz}LlxB@6US1vVUDOtX4Blx2?d=i5~%%P_-pd2rWyoIqfeyrTs5&baL
ze7ZN%KkZlzwMFBka5#+sW%m`y-0-?sB2Mv{r+FEyuSnmfW5BZvo+pFVyN*>-#$D@J
z3OG2-o-k8&iDm7U7+zzdn!64{5P<bG&Yj<8K<0dFuBl%2p6ac5Pl>cvCy+)7LI#23
zv7(_)lW0DT#|cGdOsy2KTtdj<5}bIF?6UvGV1Ri6C<7B3CR?u>kSrPs4kJ8jik)%^
zY-ITc9-b(_f{QmgIKy_XlIR^oO~68`HCycpMhPx4n6P@I%x4L;fUZVkighxdrZk>>
zNn%WhKB<Otl}Gcq05l0fj?ji$eT#_(WI8EgHXq_IWfPOrfI@S5MJI_V{IIaUA-)o3
zEWzPJ;4f?j!slZ+r4*<U@O&K8sAo$QXaUXY%oV~eA<{I77p}3P0>f<TeTfycgH1EX
z%Fqr<It~m9ViiE>=$Sg(`DJPC@NH;jy2UHOzgHq)0I0Z^pG_^s#o?B3Lf*K&a0{kX
zZC70>AYTcGx-oEg+AT|_F*xovz|mA;L=1+SP8F1}X&BLwYie}!yiDI)3I@{i4N)~`
z2HTi-rZfFzGFH}at_V^3GdD_m?!_PwU&0G{6S{7-@!8$geVGOau0LYvdkqY)Mn!&N
zknlS03>T{rv6V@gY2%%VGS}XkeS%!AP1u5hFx%pG2U(3Qn|fyU?}qT#YbCNx4kmf|
za2TvCxr9je2|JFG;|zFNDiBf_ScjPLsPx_~sC1t~NBX3ON_Pa;sY!$^ypNpn!s&=x
zr%<pJtjmeeY@vY+x+xA)8eZ*=tU`!Qs7_b13f(3wYKSRYtVo@UQZPf9wfjmRSvRq{
zB%E%{q=?ICd#9%H6?hhnC-spL5$HHombH2S3+%_s>iz1lJH6i}yCYWZFZ)M_qvN-G
zd;7=7e&$Ie(t9n8kZ6mnQ9^LM5^JPd47JgbJ*uhQ!XlXq(m2Mup+k=o)^z6>QC$kt
zh>21YNv8SL5M!~b!dDm9+67;S08L99>W>k0P$maLIXp#SiQRd!P(S*N$*o}nhR7Ot
zhs<Aq298g#Bwoizv{xFz`2G~UdQn^x@yyHzWraPX{B(*+hKzfODx<CgFlE3n0+<+O
z{0_n^Qbd9wB{+jnN)g6JB~AiHdPUM@?ialQ6?;UCBkTqS7{JI_!${pT8H77AtcpJz
z_Akd|Xg1gYoH|T&h?!n+m=rk}0>MMtVA?TkiQ+q|Ne_T=%Ivs_6;g%O9!2q0d`+wu
z@vNyLGJeGX3(S_7&XZDyle}O)hZ4zv@dVA8#+}S;e>`1mXp+-+NbQD~?Mxjg6VMXe
zJgzWeOm>Yi8Gyq%<;9~QG1!V;R+H@!qt)V+2ysxq=|tO`uou70vjBcTfxjGr9n0|%
zD@AcK)!c9qKQ9t@|DwF$jKTm0z!?vz&KMalTqFhqg%1>f^BFTK3Ib=i;jG;=XALUq
zlLbdGP?~*Y?V0m}vQdB!5o)tqk^-2ScsAh!zWJ#35Vwe6n#3<moPD2AIFKv{AOqJQ
zV0OogrK))iR!CEhW;|7-4kc`%FgT7npCd5wC!x7_KX_{WKrN%%r*F0QPlJ$%C-$ZQ
zvB(4_Hsx3-rwN>ki$p<^V8DYJ(lu+<EL`HQcC`@{=)fL59(v*ytuVvDu$Y6>L7R9e
zDH%sXWjHt!%1gA}6pCA(M*oF&RzHKB0v1p<L?m<-x3d^5G(R`SkE1u*Vj9QDv3C3d
z^jjC9r%Iu*Q)nD6bm<hj3>O08Q5S*Vl>*Fr>N5OTDaH(oF2;|QV)zjZnpDAc=hJ$n
ztmH>@yYgL41vw-8rc&4{@E~MCy>icAR0f=9(SKF9j=5d4dHft)beE@<Ti|}FRQ8B?
zUDJEL)AQ<yNo`p|S=Y92{QhJ;L*nad=0#I2lKg2{g@>lnNW<DmsfVW0>UPp))z7Aq
zg3hX3JMHxtsXVLFXH9kO1!0c7dDB!+;9@(wF(pxH*wh-M70Vaa)~&aA=~kI4nX&;Z
zmsVH|+P&Bo$)u%2EA>_`qA@adsclVMP!{i*R}$%a*OwOFkVOJSeKFU7R}ybJJ0u|`
z$S4A%{=U6q(-^<b<aHP@d5P%qEu%PsnJ8MAt~(?O1+}k@MVKg@Dv*S`R-3gX#D|ny
zih+oU9fo@mnq8kN#Ds6wHIWWqg#k)Go)e{}?q&`WMAtK8a<y_qR&r7SY=#R$j2tqO
zK1+*o;SY$k6jy1PYyp9;l?+H25OJ+&nGz^h5Kh+gXJfa8`Z2^cloYxU$|(U1hg>k)
zq=o%J%>j`}t79UysV*qzSDuA7P7>BqRsf`P(0XdyN%Pg0;){)q!F?<QS-CYNc{w_c
zD8Q~JK{2#k%x31mih)w*0@N;;=kRPnW=2<WN!3+l%Vc}dYLg6@zNNSu-%vt1A(#u9
zZw+)J7DWg`xIjgB`ZORgfk*_-i+lz$1NW+g@dbn=ShV(J!e2OZliXRcx5nrTS*;>5
zk5Xes-RgtN=37H*!J3UBAF0>_g0N{EfOP1C^^+;5MBpS=NXZ+U|AY?uS;`ev=WpG9
zbVdX@M6wK<)eeD*Sm37?cveqoQr>*Zi}Y+!qJpo2MyUEp?Xg|}dN@_w?<^^+{XVo2
zig1sF`JIFp8OexIcDR(-REtp6d@kZkUNEy(#+ZyZg|x>U%W+Lh7o3%)MFqVriCoHP
zT*T#tiE5QD@clcxub>*Pwqsc~eHl`YT-Z4uo*ov-rUAzk(K<>X0W&2TYFN|7=dd|f
z@io_`LtPKMdY2cdH^;lfE(bM1%y7wiaENsQ7t96ff&3%jLJQR|5{7UTOt?#J(j|sY
z2hZR%zf}FFTWZvSc^nDgRBIBS$8_7Ndt<raMMxJSHJrM8PA^l+oLRFv1|Bismt$$@
z#%!$vSho(vEe*nKpdg@2WJE2KW$6r*NJgALT#v_PYY3mZ_M2!h0ZM?p81y8E&ciTB
zk|~gbGX!lCCZY(2H<83v<+Z9c3j%Up3?XgM=L=TxGqmaveqQP;(4l8)W{T<_S#a~Y
z<t+c_f54J+Je&7xO6U-SFX;0t9Khd!q^YWBcXY^lZA4Os8z5L~LD>eU@vkXmUsWeS
z9lL3IItGy<3Kz;=5N#lZM3%g|8Bi6im#{qRdJ(}c2J83L@%$?KOZttXm`;}qw4?Bl
zrx})_1;_E!z!FE7CHoNr@NnsuG>T9g@J?@)Irl_zxi@#kz}W_|CA4_~Hyh#%I(a>L
zH`T9c?Z^}}#e&}IJQd;Kw#Xu*<UP`FnZ-^<hX8w{4Xm}p9u`k9>DXE8eA!Y6ocb`6
z8AG*)ES{N2hT(>+|MH*kZ}h~8WLeicC*?bmq{(<$F7lbiin|NK)_AEPO$TQZJryOf
zYh+#~c5V<$RS*oz2#FZ;dS|PvY9E>+8~i(v;P3uli~lzU#J#Npc%%RKqp!dI`f<ho
z`|Gd1__zP}r}$Ti|FL_tf4KXv7x`n7UUm!)GAYXy!-zB$MfG1>p<+=a?ZFd4u``~+
zbXy0wRF~u@2yj9cye|ksfYKsglvBkNDEc34HCaE)>6zv8{30$vWWl5XG(>^TODqaA
zg5dY+u2399i3;8V-Q8nwwO8F-#l?hdhNTDfJSoQW<%n{h&hiOSfF+0VTU)2^5G8nh
zesQgT>a;`jzET7NEma#{V1y3&UiI;2|7h>cTRtT(_P^bI`|?CxlR9lD)WEcGoaA)|
zLX;N=M<;(%h4*&<HhOhzYspHO6;4)q_4e<74^`3v5Y7quEBGk6J!)!VCsfq!#}*ZF
z5@njhYU)5Q5Ttt5hmwlj9!Bqn(e;3Wajso}l*HCHQLW(j2RjXQZgsqA&Swi?H5uvm
zKOTN_aCrRF$G1=S9j<&YE4J+}fI~V{oNER=(!5B4rp$X0XBNQF60W5?+SxdXfAi5a
zop~u0R>>EvGYP6U{F5W}s59kf6ULq#KOp|VAP~Rjx@j2<_Ad0w&S((iI?SN9Z98Pw
zUqSam*M)+HQK@)<=AL*(P;0LWbI&POP=A6Qz-KU#Dek2Gj}*J9r*k})>6r6a%@V~T
z^xq!7J>Gv2HILf**=8K}oklM4>Ba<1;xs1Oa50Ja;NlGjpf)nfiZrw@uo>~pIWHB0
zHba4AM>Jsl2BiT!bd#J7#s|4@$`WXeF=Km%5&hCs9Q=e;d<4wJT`XxUL7fWz<%_^Y
zmu?-NH_k+6XkMC}pJrvM8Jc;KpmOI_qgV}x)Ug_^yG?9Jlahe+F9kt*fF`3`jKA!8
zG#^gsgHwKrics}&YE65_;Y@J7wYq~R)@c}-MTu|?ys0yX?@l{1Q`J+<^d=d@cAIqq
zL?uIdCMOyU#s-h%Lj%UFix@0n6;_=?*aP@R<2^TtJQyh88>ZxOTfgr%-_zM9MJM-V
zFJgIkT}65U?#f?BDj1K)phAM<VJw}f1JN7x|G?Qf%yyva1v>E_x2O?J_TAhyMP37o
z@2-h^b&Wyv^eMzV#aMOWIWE8c()J`S%q_~0%zaj-2-QM!<UMgFT5Yvv()DAR#gogl
zy!+8`yQ_`|Co#F}(NL>{?i+>2@y<6&w%UDRxYnI-l-usA<GJgNlC9QllsvkG$Xq<u
ze&99ptS<#4iLjS?dm|DNy2!T+#&IyXevBTl&cEMZk&4hYyQeDeUV$zp2i4Kmpu<b~
zEAVIwnP-U71Voz=GHk-{#pWS3rhhBIOaN%;`i8{E+#+hzYT&n0co=o4rMHZW66qjo
zI`f*``Mf5p%xj|O)n3cYYvRsp5}X%1Zk2aAGu>v#x#{A%T@6DIqE0QD`Rc+v<Hpvk
z?YsW|{F%GB?$=EN0Z*Sr7*6~Il5k*Ars&4YV#+5AR7D&Rtl9$BvD25;6u~bZ!*iC{
z#$ZNw%CgA~H`_-aPp(>wbfEoJWfyK9sS2U@a3flb!6$Kadc8=%m2?Sx*qnv<5nM|a
z35Bd#V{}(8@*;7@E*ly~+adOe4`wyL77vV@_+>icTvyzrViMw_0O}wq$3;3<eUoHG
zKdGXs5@<G6g}!}nn{H_77j?T#(~Og(yI4}aK-|gb(!-Kse87#JLOAK@zHM6FdTCaU
zP<_mq*IEF;Swx+16&hB@f%n1(0NQx;u@FPeE}-kx$BJ<G3C3E<dtc;dHZ!=PJM;~1
z%fQvmq6B>Abkj5zFbVw0BU&mz<@6goAbu4iImN7oBu0Mq_GJHu(VL^!-;Q4Fp6vE9
z^_`k3CpN0&u?uvAjn@?S)}wwYRF^*ubrW*lruA?K!HM&90WW+PV=#(2nA)KjoqWfj
z<8%s=|B2Q(tTn6(vG2Gxl|936uptfgbr5v0CdOtY{VLj$<pv#EWa4V8wMk8db!wAn
z;tp*Rq1LHQ&A@hP)-bz`ElWnLp;1w+OM9(z7sZ;}145fpN!GLk1qNC-QQwe)V@`8E
z&ga(_Z!PB(n9p1dl=)U?U*|f@xdQOSuO$kU%hLteK6h=nfeQDo6)O~z;;Z|on#8a@
z0Lo@R^belA&;ehT%y$s|^Fg}E^LG^au^7o$QmRhBaL8BbA_KE$&L}-e=8FqZnLtue
z>Qt9d4|5~s8idlw?!7+RA9DU)GYLC<BggXx7UZ5BL6Hd~(JWaO&hTO7i5UV4yocxu
zPNsjxA5u#qtJy!1ElgF<<Yr!NFXYx7ZD=X*G(H8(AI@*<sW@1~3-F`U!Rp^`U=hpq
zLVLswQycgYX*sp{4(kI?FgzxZ!2&6pAnQ-WHCM{efyz|iY|OgQz0-6ti|3=W<#gIN
z?E@^sYk+eevVKM5=Qt(MBP3m=FXh>Cg(h~;(j91d4%6E21K$K0uNMP-gG?rc7`kTj
zZMnW}8}<Pmu{L-qkh*aeL4l50H803YC1U>n+dttw*Um8<*}>g<)lX&LHBuoxY&ZlL
zZ<=cNY$&!4!dI%1qAp)sIY;?&fzhAPoK*FIHvVKfO}hxXS9VcgwtzNQER^~$@L+9A
zEFi<H{4`K^u5hheSB^i6aQL9!)idclaIf>t_JK$LQ2`DO8|9C*6F+Sk7(t|hE)8k}
zBtN-&$GmO3xWD8OZ*m%<$#xuF#zl$-m-qpqg^^b<A0JTEL)f4t-f&vA>ZtH}0z(9t
zfjH#c$kV7gSun9K-GD*_W}btths!2mWY&bC{D4&M0TB2L-%H$8k0LQ^wm&By+gY)S
zIF2-4efTJ#P#aRT>xYsKTsIGxms!RCpffx(-qZbcLXbm&#(Hb~VVRXTYQx8bX=X5C
z5E@us3b5YyHJUnh)MPS3;U{i63nDO16x0d|Urm*OIHGYFin^;ChWaFj!QrP?lmaWv
zXxrKGW&>YBjhGr;XT$7QY$7F;nyzhDA@fX^HhPz)S}C>P1^xvnsnx{-p@sDoq;rnj
zgF{T&#}a0CVRpYE?X!lht8Y%?S85H`>Oy~~e1Nc)NJ4|1HoakicJzciHyt^~WHoIE
z3-+i_A&`F5yylaCule1r`J~&L7dKt=d^%a$XvdX}=(4YdhSzOb)l%~zG!=EN551nf
z2_0r`B;@}q0FyJTV1789rO)}vXSMH~V(`zeU;pKJbZ~fZa<KdI;P3lKu-6}p{nIA^
z|JK7MPmQby0N8dYl>}#`v$^AZ-ZirJH~|LpzQbR-aOyId<OR&D4WpzjpM$}iSa4z&
zsUe)wFv9G7(S0{{o*ta^WxL6MgCk~}oK7R=CYa5w8}bJygN+&@p_vCxv)!l0P<~aw
zb{0)D)Xvv9$Zm`8OhT`aoeGZ8L8~M?M^{yJk*BfF;%o4tL8l-H^!54`d4QpFW4u5&
zZmwaWGD<NGIflXE0BUGwofOIE=-J7cCAgv*#sn=>Ay^SOil-RAXd5F%ZBe0z<hp2j
zc*fa`NW@O!i13u0O44DRXXrRm)~t#|@eOJwQ*uQ_xJDg|ky^jNwaWccV`+qCt2d0X
z#4?RjhadcTH7d}kd=33dNH}`_T$mk6Z+lv3-^|a=W67XgB=gR;u0kpo-nP!Ww#v1~
zM~R1lJBVnWM^jPvHZSXkp0}um8aFfbdvMn|xTb|%)AFK7_2txgRh^sET=YV?q6w_J
zb+DJ!lEnbJ6-7QRbyVCt+_yTCs6wvDV|O<jMKfG+Tax$lIGg<T+oJbGxArf-EdnWp
zw}naS(vdhC**NMU<vZ=xAS0qW9Pp%n9}8?gM_tLRGskNBgkU2{uv2TEtP4wd02?L*
z24Ky3R~gDg%^foMkP~k0BCv1zcS(j3kfIn8g+{uviT$(8(zCpnsT*C<#*=)e<Lgsq
z(f8!GoXm5`esE@;hbj1^2vOrGws@ktvtgv)U_(M>1z=EL8U;+3m<>g$NgN>H2|w5O
zFgLu2eumI61=`{8J6x~(^nMu4i|m}E^rDdu_eq}-sI7qy)z8X)Wn^@bG|z^b^tC9M
zBs#dSIw&^@2EzbH-^^q;P^Bkezi;+q24R;1!=f5bNeEnt-7I?rrO`A$A4y-JhQU#I
zYi<5jE@u{*$rg08JAN!|2HbD+B7%ibG-HB6=JT`28IPismeWN#r<e)|mbn7Uat>rF
z1QUU<v+4U}vPoX;<t)z^7vN<^?I;3#%xNo@GYU3R<P%7fJEVXhAgP`t+W8-~X3-?S
z$~erfIv#5JY7wq3@@WFmxlTb*aYmWT^|?^<XL{C;@m=wW6AD+T_25~=o5mA{VBQ<X
zr7opdNo%1smC}4@N+DO#+c)37ks|T%rZgZR4G(lpj35+C9a=PYYX!<(t&r09BAcR)
zukV&rr<zwFTV`z78~v%LEzo4i%}PlU`>c6OSXuPVN8pMm$Kl<qljL-HF1U`G5ss5|
zDkr$MR{an?^M<Vn_Q3J5{zmm@kdB+MB@A@={F&3N;VDB!-I5KnkmZc|RA-2(0Tyd9
z8c#0cY>ar>p`-$Egb~F=d6;iykD0+tW}rB50Rrs;`vIsJL>r9#q4WGqpC?bPu6Irk
z;a73=<hZ0gXkX8CAgeud=1m5qYRI$vGO3LDz6aH|ouBlbRh<*qhnjK&u!O5j%w5i3
z6+}GJfs1JI{Eh>iXuCT(CR}9u0#`TG{Re3;T90h>9q58XBhFeB*Ay0|g^~|~rm#bC
z-DQJt+2A`{?;>lsV;{X#kEAn1=>%+Ob=Seyiuq_?<fy7>)EzWcsd4IUKJ!TGjr5*h
zBvX)`bth)p4!+iMH4#wUJW@J%piCEx=zXen3VPgHt1ABP)3SotaWK&{JtLwcD)l9G
zt8Kv@OvW;2P^?cTZren_=oT>6Bo1dQM2pw<s_9})N14JNCJNEF*c~>jYUptuL*#vj
z&tMgBE&HOcFs%L-&p6UneC(^$y{m+`*ts%RLJSU=-YIejLUjuY2*P_5bkgNlR;$x+
z?8HF`tWJ<TUy1(Eq3y4AdH@EJ+2TEi=rZVcuoZo)cD}qYu~#wp;}!>b^JqAAnL2}d
zUO@$aa!36nL>+31?q1dWEupBd{Q<;>tKF8h`m3Z4=~_n#=W1}V?~M>E#T;Hq5D^k&
za0OG4d2Hjm?sL?{J$qPW7+GS*)YOF2U;g`T{}D!K+IHCF)FMQ$u`1=p66(+x7z1qw
zOk{m&Lx8uBo{6Cg11BuH(*<RPpcOcddOEX8Ed{8c1_{9m`z`~2kbutAu%f~+mqSLu
z)SO^fd7w`B1L@9T?AFMkpH^~!8K_9eK)g<nq1a}X|CtGZM~2nThNIE`IzFrqT^%h3
zxY4fivH?)|j*|D|>9R~OlYtX+n02rp%ud2KQgCxlQ?V8}cY$-G(BCV}1_c5&P~?Fk
zM{CkJNUBNFK80AZr1LScovT7z9ud9)B^vzQkqNLWi8LzEqE5OxROzH2#0kz>e+r3M
z<kIN*fA9)odL%%Vfn)#lS)`!);MM-<cz+LE*8mYnJW#j#9cHAimeYjhb*Fc9^KI-v
z5}Oi0W+SZw7J#Wqm^Xk4Fx)X_Tj%sj6q1<&R{=ceKvDz&{{DDZuPf>F(ezWJf%G>@
zD<*HjFW~lV51YsjQ>^YT!$V&ID?y9HpB)dy6QvSD?V37A%c5+WzDpF{dXEdua<$}n
zmX6hZe*b<{BLmf>D>g+S3YVQ53jIWVjIKcL2(yAHVi0NhmEy)J_$Nxl;S;LZp)lsn
zg{tRak^9g_FHYV=LIH}`O%YF315|l&Jx?Jr>UDHB&95+s6m*Wkq^3E9*Uj?f`31N^
zrTGMN;b8BSjMxb4DGBE^Sy1S2$ThUg)R?B%94s9|q%D$jL|Nss9487mO$cYiQ$WYj
zjS0!Z&d(`k^1Mi9@d9E;vr>R4%@WNGsJ2rzfjyv^Lclf{Rg#r4p9C;JI7{LZx<)es
zYC%WErj*K*#TW)X&L;^5&w@N-i_J-)aC#;}&Ifc5&Svj;q+HF#F62AvNdHw${OsE9
zlL=`Zo#zrbWNNuCkf&wuGLrDY83$ZtEe)h3J53VI^$INQP_MU^L2FG6Zw9AsMta1G
zsjng;j@6mT5{Q!*7uO0b4k;RI%#q(nZmmP>QUKni4i@isRA4qfu>brSa^);I3b>;G
z7m%?nI$HvaSmhDkhcQGQrgWT<zH2e^F69&`b$>o&aauCUD8;Zy>E$fOiF81yehCY;
zgwVnWB?B#qr$AxM7*Q84qOFr3I5@{?pvoLn*~wZgOGvIw#9~cmJ_2{rg4Znx*~$dA
zi;ApTR<2+NU9a(jYEtz!+?O9rTt(e-jh~gFA{ttjK`t0-IHp#mo4TN1H|s{k;A$ZF
z%A_S8;Hm=7I@0l8kkT~8!jxWvzr90AX>53;E|0k2-nB?5IxF&7RE`Ts;-ynJg6M&+
zj2R?a6!=W5?@rYrn$40)ikBc^s|kf)r?icV28T<KQt_$M^Sq>MNmZW3a}%FES7r53
z@=V}Z!|8$Doh1Dsfn0i)QlNI74O5{`HEz13-=}J{WeRBB5O9i#$^ae5n4}Ss>k<EO
zns5r4GmJHXNjFn;j6O{kR|$th|L5i-<T#&ie?Z=Wu&Bbm5b~ag4G4{1oTiElP<#vZ
zrtvQaU}ZOJVosJtOhGBvDk8ah#wbj@H`ARh4)GqzUEv+%sc_GE>)9ZQa|q(Yhg3Ic
zjX|r3q1j4Ttd%=-4|ja(p_55&c<5}d>kd6+JfPl{7u03aVnDTuqi;|H<7q8wW0Z1(
z5S77TKkb<OQT>KNI1cNfClSSC$m)s&P3{bzc|x86E}{`F`F3XN73cOa1)o-CtvDfe
z3#^!ICzt8i1B9AI=lMC>sDW#fE7un3Iej0P&9cUAYi7I;o^>#wbmRoOYKzqhm%0nU
z3ya(W;AoY67(=%S+S+6f9GX?bfsWl4Wy_3Agr!vtUS{<cfx5O1AY<CFk~c?$X+;t@
zh-Zr8!&<)vS_~BVyU;P%(WdP8o)N5J3cRRu{YJxZy#fy&1WhiYjzDOZ>4CO^*zo{g
zamPks9|ZhT;SY83n`jz%J3Ev&4H@&U=|N!`vYdQ^)5#ZxNx@dDrSXP&qD|KCfkf*5
zeSbf}d>zpP5%2f3Pcuw%G>ui!kkf-M9!3>Fcjyu|i#pII^D9JCsF=-r_mNoQRf8Rv
zrn%=@N!HrhsrvnH$JphAcWjJFn+p)iuneHO88}AV4A+`I=u#4xxEnE|7RtrJb^w$H
zYsOw3pAOUV1SQWH%RLNdAFNx(tqqUcJ@E{+r{k~bXqvbnk5+1nEBP&2ysD#E-e!O%
zq$OXLWU}VB$j-E#!_b=c%<ejoV^_1o7G{5ZYkbfd8sz2vBzl2NSFG-UysVN^EG*(w
zs?lYdPt`@ti3O2AL5KfLHDpj-K*~@tPor#hs4M}0b2uH)+$oB9^31ogbaL9w3l#W7
z%M6RFCe#tWT3mqX(F~ZrG=sL7Fo2|@I&Y|`0-PKR!jLUgoS=dL;=MHOX2oLAo|cRe
zms%{dp-g0D1YLwjRQs1|v}dRS2P;uO8D*`s{!UdMwITj%!~1uzU%GqR`B8-#?4X4a
z){VUOmCS8bg&)f(x-*_F&Z*94NgwqbazQg|ygNJYSE2p1WKz$g`(#*6kKd~EQmm)x
zhXJ0cG61p?q|U7aoJX)4da{lt_Z+pnA^M^L1Xy<@Z6Ze_i`PSW#-q}Ru%j@lPC4A9
zsGrTJpGHq9@?U7toc`T)em77M;%;nrks{acPWPi0(jHbU1s271O%qzL7adwH{8dcq
zkT}CTKqKcAFO+$apF_@MCg-YBOk8qD(r*F1tFWur2)q7a!i7~=6CXaeZ!^JfSS$%{
zJ*Y0lE7Q@Y@SJRmQN_z3WFo&)jgQ&5WiZH#_%f-^4!DpeGb}Bv@RnEAx>v6N2~qlF
zQxpnn#%IkjhgB=#(MRp4yhHMuhJ)+K3hG3429exc#u&yLlrX1BnE))yZ#%gTQplFc
z`4rWS=M%uPK|mNb@sKpIDlrmX_6|)og|X@qU(riQBy0scxH)qqz2{C2ix#S=K4b^?
z>%eYMEa1@zO#z&A)+cqk6|cISLbgB-MWu5tg_od9>_9z?1j9^Wh5Hz3*y(ZA0kZh0
zWq`78uF<V;+g9xe)IADw6=|tNk30xL-`XLtP%bbKO)^qdDKciHfRa9AY*rO4P?N|J
zt9u!mMme4p3B$YAHI@)iIr+DN2yNcTTFdC9P{$SR7?@vF_c18zQZ`zk&ecqkh1OrD
zWKaU|e#N#Is3eS+idez&V14w>^<0fa+wUZEpk!hUJGaP};|p!7LETa#5Jp^Ga8W-$
zTc8;U7+)ZjgAt{pSqh0F2bIoP&1W&4!b0#}r?{vfv4Heng2F0?L7s#aH|l2N4V)o=
zykelZae$N<uli_JdSAcH2@=quTJ4(71IV7&*<zUjp2g(bWbUMh(eq`jSms5Nlx)=n
zvY8we)Y|WQo{&10^uuI6Bm2>-Wi-(-8{=SJY_KLOO)^5r+#XH!Kuc>P1h(`vjm_v7
z3gu*-WRn@PpZG!zx5SBn?N<rLVX7z@Z&3<z0>(&<v&iQK=-{zO9)2=~Ma0aXG#Zdl
zVs`OTl;buQ$!wk%aRIs1C#tnMQS@{U(DIA~LLdw($`}nX(Xt2q5|#<Zv%!|sDb5tS
z+u|v5F46uvlAi0sXlrY0K$Zn&<-tupQOCc$&?dam_n?5|7RyDEj-gOFPvUoU9@CPt
zt*?jnZ+(cipm6N9%W_05>wZAUhJq+XE#(ko5kiWprY_Znqjlm^%~q@BQP21?W)oDM
z8lGtWAU6n-m<)alEb(O`qz_Dp=uYY!r~VDpIc|MAu_mUbt$|r@+)x=#R1I>R409@N
z(^b4M)*CMrLm8Rh@Bx$W@`nxc0Foosta-+^ZE*@0#(_C0a=tSJP3~anVPu*yPMl68
zR*LHkBi94l;^0y84M!C<4svc;RM}#V9b&Eh3m0v>`2_?x2gVEY*Q(!IZKH#ixS15Z
zjyTK`4PvPS&JwJT{e^%4rN&kmGt~n^j;0<Ylj#o*tBk>L2BJ_gM=K^$88;0Z<F&)p
z-AAO23(6r)?E0Be$S6bpa0TSu=u|cE((MNl`218KYCN4bd_sK$clWN`A)<<JQV284
zU2*vKZZpH{622JMVRL~hMCTd@tTEjvOCW?eRi0^5u-gfC2jB(}5A7S@isp!{JVyWw
zHn`~Dgb*GeHZ<r^`&R#6r%Ikc&O9Z)_Q)lL^0DkayNhU*)VaRnuh2jaA{AIWx8KtO
z*63*kKZ6v(xpsl_Kj8xCZy!3|YtAsxoxYMFi4MDo;u}hhRO5iCD4hJ-=!+Z03z7~#
zSdd3Ve#sGpbPLuV3WBRp^H5-hB(Wl#&eaH!6zqv;hkPX{@C2n@F}-$KpNQlQid0hM
zA$mT5fu$l6QGrUPk4Odc7-r<WrInc%@g>`3y-O66m8#J})EAwmkLl=QIR+DVAOR0R
zW(<otR*QL=7GOlG8-+78Da%b8INNfC*wR!{is~&;>8Ln7g^)73IUpSkaSJ(&kxxSw
zO&Ejnx`BHD1ez~$aIcKUOSR)OcS%Sq3H+&<J++`l2!xd#9r~NZ3nZkMr3v$NQ?*xv
z=~^eVv@W4fO)ge+<_X!RY546D%F|x*ej*cYrHuvDanFHX)iK}oH4FJ-Q1?xHiL9!K
z1HeMK+Kkpl<j`6kGlAGp|9l(|bIBh7z^kJ<MqD&uLuAS84x%dsZ^)fah+F!0SpZ+D
zAUqk8dkC?vn)x;>4Gfjq3|7IxsiQ<(;xv~C_UH#v!3w~Afx}U14UeTLrc1I)Z>c&|
z<TT@A(V`cLKEFQJa3d5{(PQOKk^8`OE-WB^GePx{&^51t{Vn2avW+Ofk|8I?8zNY-
zVS4P^oL|L+da#Z8e9G46fHclANCTP3qeez|#x~)$L-6KLP~gN3Bl8Il>bNQ-l4t>d
z=z*=%FY_rP(Rd8P1P}+rEc|CT9*3tk2#f?FG!QZBnL=ezd7X_fiaY~W;$4<sDPTM|
zG6`(@^D;s|gcNgrgTE1BSa6$DbGk~RC2`PnBSz>5kN1KNJR#>lw5uWpa|IF<T10T>
z&1ez9?SR|>F-l(QjF-k?2W^Z)XhmqtV3?{V&cHRZhcj4<Mkwg8gsK<z8pRy3_PVt0
z5*eDfz<JcyT7-rvY+!VH&0wWvNydo^hA~ONu`meTJg7#YGg4hd$Xvw5omlAB=g?r&
zcp0}lAkp4or7ne%rtr%jGmbd)BizjWu;4Du+}&1C$Dc;+n@NU&>rITVqVzylqa_Ji
zeBejWt_tFTpO(~p)#A?vE^e~F3yjLsyZW;H2JmUoZh1L~5D;4OQGMLBVK>o>HAkGU
zrhXboP!=H85`Nx+xVs5H-vIy(q=vz;Mr*YCSli>yHx8B?pfgiH+7B%QuE&1O12?EF
zvXZrMN1j5B)0(>4E9}3Ly6J#izTj@fW_4QgQqng!%gyF!&2;LXVJO*<$=Z{yl;20Y
zjWxs=?xei#ihy7kT3u>Zv&FK&s;!*+h=3`4A=RTQ-m{kqNQfa+bPeX#f|~3<Btfo8
z%j+DodjaJvkLE*<O{kLhX^ED;B%DCr0f?V+4g?|QJB6`qkv^g&l@&!d)1)=UOR$q@
zus3pq91k}d|M|<|T_EQ0>62}4g!ZO4YBejBL53H(T|$&ug?CUqWL;YP4KoB`W!eMG
z&;^__Xb3$cIN-T(S7$Ltzb%(%XXzN#O)S+g+Z+)SkAz~LB}OA>rXIzoip3dHJ9$(l
zaiIuMC<@FYlFTMl?%l&|&&7yn>aMu1%`>3krRbSM{sJ2-m&+!$9Bg@(+73FHbtPxJ
zV1lNDUqKVCM@+hFyGn61#jBOrx0+9|7*@70*y+_t^gjglH;6>#anxs0Z+QJ^b=a0&
z7nZddq^{#Zt0L=+)DKxb3^SpaT7=v*YZ~jo#vQR)N`!5Qvo1E8noW6HN!-Vf=76R4
z{*gFotp@mYR+yS2Z_c$9MdD4YtK`VFno<~cWWEHM4@wAhG3QVczg{Ge=pJgLSwk70
zC7d;e^3A-X8v;!M=4`fbijvlx&^^RC(Z#`wBh8m3df}@fKz5oT2iFl(g9QO&nF1#X
z(*qg7DNCZDMj54NrVb_n1m+zi8Q_o)HUVZGjJO5w9<GF`Y{GkM?0$SAhWA0sg9t0=
zGvtD|U3<O3>|-XP&p6r;G24y}8P_kF=yeUz;@uzb&Ng0N0~(Fh*;rN2k)YLr2gs!_
zEA~4Jlt7N)3K*4uxLYtbmxu58iy29L$=G~B3Mnt=tqBW@n&)^tUd~Rh7aYIVDs6{R
z24mUj36-o^kOeM4Mq*Pdlnm&*Y2daq7fk#?(C*;dbfV5BF|uZhe5J6xPr8viHrhSU
z4+1VO?5fF>u3J1ibS!)RoVY?Ns~S9~t(v5ly8M82+_Y>>I&Nb=qFE-b&2)i^u_&xz
zozW+=Vj78)MM?woRc~Ta3W~EW+X&GRbr+%0EMf!B1z@s*y?*^lp=JUdq}4dq*0s8J
zVAT?v$pF+_sF3BVoNhq}FoZZIAi`Dn!O<D?(R<>W@Ge(91)}a!wf!^UV!RdPAo$g(
z`i-%lmJ69S41*kro6>|omrZQKfpK3T99S>j)JE0htlESRT_;#iJ&O>k_TPk*1LKjO
zm)SeoRaZAn8--s9fuJo(b<1rcc5T>lfC!dizn~CUA$7i*N|Y&ME;bPncWt8|m~8YQ
zO4a=n5oC9<o8>H_;1`_kc%LwkOsT*?eWcD7-WRWiR$7M|gW)kx5^l@J9O%m4c^DA;
z)Cw2$SxQ|Gj|#@G?3cj{jgsTY$kA-rBlD!gyka9JV>;(ee|z{BDd3Q@xw_E4{us$S
zqSHVrR%K{7-yZGnH;v{)ZSSi2|F?fKdiC~X_nVjdQBASvnFuo*p2AKq$TaDkdmZjy
z|5|l-#gNn9{pr~R2KXkEmpY^D;gmggr{(qw8^0Osyoxm7#+Q-CkPS>k(=8+}A=$zz
zcaSFcu)e&4x}NC@S=b$i5poG3u*w%kRN7mh>)=+Vttcg014UKA9^Tc%*NYR>G<*Zq
zT|sI+MU0HVRb+x|t;wK*PH#9oarpv5fp&q06FD$H^kg>Az-(@Qkz#Lw(Q7u?xlijx
z=%)|~+z$>%#FvGSn>q+{M3z~Lr;M)2MO2J#?qQ4BlF=T<ohL1@=H)eYuVdSK6$U~)
zW6tjQBF{^mzM!12Qp!&EgBLKDYjclbM$H)o<?x2wI_hSD;Leo9+o@TD*{vg+&U4En
z;%YJptH;?oI2KTksqgREypuvu=Af?TpLRE`%J}*BO;4sb_m>9FK;N{jt`|@<pmnu<
zsn#FfvM%kuZtFh2RV^L=g{@Gm5A!js(~cc92BQVao*j(9^I#0I`|xg=PvbFC^VXGF
zI4V~c+@>t9WVP1HD7iG2zV&c{hB7<-XVKp7-k<kh9vtp#6hMQi-+dm81{jBTl6B|x
zbw##i+l+)gdH#C>$E*L$@=CIHBEbYrCIN~>w|vUQ?ICQBfMK(zT)!1I@fn%I!=}I7
zJpvdwIHZGSi`T##NkxQ{g8i*9{}en(cY2Lp44Lc30Jmbb4XMqR?jTf>KWJZvtl7n(
z&ck6~=zD#1g)IcWcicZZXJyw)Kyu13O$fDW#cRXKgjzore;Q6kb*rAV<iltTZtWUB
zYEsjFx3^gfm@Ew?9}I<uEl!dEEc<&{f$o*zxnY3~Y5hq6^p3X?2k&T^S30)_*SKFQ
z{^@jWGUD+G4}o*S;z+!<%4vS3(Ba~u!`>O^n3@BfCjRVpD%p#}FlGb6aV_VT<l)ca
z_v5J=3f%?#Qsx-1&@%eUp^f1K7PzOxD!3Pu@6nT0Y<vT3d0LkF82lBj6yK*RT+UKz
z_}BtIdSP0jYZ=uI>bp$<qQ&MeD`@$jinv{5AavMcVT|#swiYx#4D}*}TJ^lmhXCfL
zIXfywr@$(G4l%N_NeTkNc<Q*0nh5@s`l4qvM`Y)#s)2<pE8$T5#R}MT!4b05z`?&1
zU^U^q3aN><oM)S$uh1q4Nj!Izah_TRR`!v@czAk`ChrnScGRh+t=qn=*e2|8^g>;O
zH1KhEVT{kTRtb7Ko4Yima14P06gyA8v7wbrCK@FI+6H2Cv;GKssxywPb5~2=7$m|N
zV7vkqDEdWH+U+w}?~eAr*(O<{r9jJ{B}K{k8?b?V3MSGIVIB~SPr^UNFb9S9yBM8Z
zP<o`B1}$q5gGyZ6iDP^tvXD|I5j<Sb?|VVE=V-IN(1FeaefIQ8mLUQ{dU+whDzkWk
zxiDPacI1h(fW4vUs9a*}2I}>?BWgo`1az8BXS}mw^g|U}YduuEm5+>T;R#o|%t)WR
zc7y|GE17hOP!>7_f(}8714K6*fa*3Tg5B>hdkX7Cv^TisP&!AG0l00IWdRsUK}=Qn
zO_F$NwqeCmMpiqK!dkO5hHx@EVg!4;EFQLDOv#06j1pSt88#y@)&pG)7<2_8QZ(au
zB#p+al+DUFaYs`KGo(&3<w;nk%#ve!v4l?(feat2&gY5gWA{XfL)36w%~S=AZMf!^
zv%l*2ys@<(QcF&EIHp~RfEzAJms}FEpWqgU)Kl)Fbmg2@l4k@rE;LQCJ`I{s5!<bx
zHnV(0iuF1slNmil0ywf#e2|Hm)mVzySIMb+d@qLBFPQHP2nX~<z_QUr%xMtg*_>W&
zd47Eb3Z}O~R*FpH1FrehFxOJ#<%qSh{ByrpT{4=RaJ{1$f;4cRkC%NdS#nFn@7)r5
z1{zW8%Y+s;EIPKG)d}5=#UpN;+D`2QE#hTx;z8^N+3jeo=)cn>nkHw$;<1d;2zSj%
zVP@}1m(Av34}RLxie$B2%#iDEn&#=-6?yJY61KO>ze8COB_Z53TCVEN*2}2cv%Nj_
z2IRU&FbqgTxXSsdJD*Z{X#$ek%TJHyxi1M4n+mH@5fn)nB}ql#tlGnG;A3c8l_Gl2
zsfuR&A*_q%jxcrwCyZV}k0Q~5khiz#Q7BTa(1dK)>XPnCN8u>%%UGRGUrk`7RT`m~
zz%|<jzFP2$wR7YbDd{J)adTKRVMps(uy~u)vN81-T<%hh`m1%zJn5f@0~^+Dm1T2K
zWSy?V@QWwKwT+Ju#DRi`yjOb%GR<JFyQT5}k}7c?Dw`9ER0!>deuV??=}apZk{%ty
zdJQ1y^UneZ90P>d&_h+tN0apIjC{E{rzi?1t`ZX^Sv#kb2m&)bQnU*!2tnGA&YDsl
z)P)TypmqU0dB`OQ(|*n&Mu(OeRBhmEa8SKMuU9$g8VD;kDOC{TRr!C4dVdH_pg#zV
z8qLGwDJZb6qX|eS*%O*iaewg8!At`ac#RJSOq9=uhF)_CMSo&oc%onJpxxGZeoaOU
zZ0AKS;B?A~gFIX))hL7HMjFj|n$1aBj^;%&w%L*Ni{^xceOqzB0c56mJQ>;WF}i>W
z9<#gm-)|3&_A5lEX{oIAIE-vJ=BKr`!w}LFttIeB25hCNu2U*ArgviAgvM;5W(_Ly
zINE=?zk9qd7E{E6cGPQLhB;21f-4Ik?gTy-YxwJ=e?MF`9Ehhrr=9K*-6|Ob?<QBH
z7d5D1#QIHO>}~7k<&j!t{lZmS*RQ6>PqBV=BVK9!Brk_iMn;h1gktu?x{aD+lbUOP
zLtzn}E>DmK8wzc6CKe&&2C*0QMrv#=34p>N3NZGjdwZkfgO~e<d;93c-rqK|Dc!8=
zvBbU7muI5)9lGAXQ*(pR800DlvTG-yvAEm&dMrqns1X8T*r$dcfbwS({-e$KwZr{)
zN3XvJs$%r!;P6Eqk5Hd0A{4BT`3Bq-j`qhSLTCZ(Ht@jJs2`WV>Hr^=Ef%(1HA`Ao
zQ?<`aw6kjb!RnL(fT__b17|fBk@SJYIP2_TUU$evoHB0fM_uKo@G%$i8`FK7jXQMD
z{hlQY%sJ53`J?XrtHZr&|BxQ)M*Tae)u>)Znflq3dDx%3h!E#CQrod<T+cqa@)#BC
z?F1GvP0=uf7*vmThr`Z*Kru#!+cu{~KzQ^G6Nyo8o<*nI=&0%H%k?*CQ4e%j9hZ?|
zQ2Ev<3q50zY1evyok#-y6lrGmPT_Luq*>cIMi<<c?DafX1okvOO{SxyDDpyU6vBj#
z0h{fg!twoDD?X~NNCl@c<S)9I7^8$bX}gWdO@U%Cyh9*FjApX}6D3K_FH_twU5R<r
zUogJB|Is>{VI(IA%{4C4xtgr5P{|-e*_Qmq0pks$b@RNg880W+%L(q_=)V;m?z9PU
zW7JU`PZi;RnKaMPS6JB4wdm|+ZN~x&Xuq!32hA!!ou=q>>q!<tb~{NF+L=MRGBhp&
z&X58HatJboF$x{w3xT#sCd)BIywVA?k(W=^p_)J;xM(nTJ;;TZS$dWiGmb@%q8zHX
zT%^<VR}x~zGl<`nPSnv%$MICgL08iTgA>SZje!h=Omhrb>mWE7D6flTp2UmzR5iMQ
zFlygoOz_j?xvG{bb_&kF8WcE;L%1wzp*nLRBdrOknV+4N31?LtYBeJD^e32K^n{_O
zPsn;8EYA3Ls2;ec7@j_c4xQMQxFH=WQF4hoyir@rU1N)evYZ*L!U?*XkEaQVtd1t(
z7JRcFio>*fw12oeLg`DF(^-ROO>DI(2855N3Za0+0ONaNEIl2wP@$T6%F*N$S6VFR
z7#Tk~J4?n2Bq>53$I(!YfrSP%0&zb#&(eh#;}lJ!C?q30z;Qo1vIm{7YtC_x!8#{V
znZv=sNOZ=}9a{on4907u<H2LW%w`YExjG&TFL4DN(?y}sLp+rhAKHd8fQ!6fP#QvQ
zR$AU96j(H@xnA-;TI__9*V?hoX2}FJ*;CbtHa8QA5ePrcaEa2ar?HW`1qh9Rg`jG3
zd=X6vf2n4P$Ea-SiW7G-(#j05JaJM@t}^pVTuf*3kg_Z;7G@FDG_NsAA!Uw0b2<eY
z7*$oZ(PtRos15k*bBsVJqvhfv0I+kcP7Cq_Mz&K7RvTLPYH;5IjP@2B8?w3&D=x4N
z^y;j!dEIfD1*xSoQb`<B&9K!f^ci?0&6a4Ral<<dL_$!j^rU7W6xp<yo~-hGaI?64
z^`GB<x39C$HZYtaF1r=Ad)%f%@ZwDn!HaHgf#9{m5B#hhQc`|sznPq7obltUrU~r+
zb@!kX0a<%R$uMrGZjyk8+yIo$uqYyJIwYoZN(liB#jJ|86PUWL<+OHibjJ`h6^TR+
z1Ta>t23|Ne!5K&HapTS@h(-oYE5~|kid;))i91$oO%YY<1I1m`rP%yGP>zi>A+GKu
z2REv6i8zpR!^GM6+J@YYwt;nDlnaQ&3EB*UvpBKFwo5-BoJCj3=a}Gz!z5>>A+2M;
zXlfJz*=d_Co=Z|fc>0<00yDy3m>z{8E2{g7%OLEHqUJ_+R`srel)DjGbHmLeOU(No
z`ec%Wug!DJr&QC8r<G>zUI5XP(0Y0?XPJ$5od`{QFKPL!7Szg-Tjl2<<#az=^O^>+
zF;sIut7@OA66z|7j`qJ(I1l;I>!j=>hck?f2Yv*Ow*Tm@P0~vV$|Ew88qw>s{70%d
zP#k&R)D8EN<&{oMvEx1cZF;V-=^X#6bp?yVjQ=VO&t`Y?^KuA-18k+sjizd|m-E3I
z{Zk_sU4Ql&m@07({YP(~KBaC3(SxW@?L*>n-PT~xTZ2S2BUFd(ANM|kSpH|;k_Fyo
zxqf-PSMl8gyz*|lJuiWSWVxD0ZHT*jizT_8Yau{zt>6$JwGS~YP3bTMM|NSXf~#YA
zd?(9Pl@13x`=Y%wP2M&2qr<xIbS+LKPv_#AhOC>$mv^~lhDfOE?W^|Q5IMTNi0ikm
z;jiyx8Zt3au$w=&chfn85gh&SFa(WKfpm2pL5<NIo|~hzdSSUt^0T%v1-hsio42No
z6`g!hw8_Ep?q;vjLjVZvA?Z*vbQC*Ps~*Wt)x^=f!8D~pZiU*dmq3Tw@-paz)f?Mv
z$L_lN_#&NlNYUeh{HNC^z>0w8k%netDI1~@^dNS)I>>WH!zXOMKiF2&+czr=2*bN~
zw~7hh_AW9`vw=xyf}M*B-zyzIk2nr@t}v)%IwSoTTM<E~SZoeHE&wO!w8s9ltmTod
z(=aV0Y<oH~jUHBg1sm*zivkWMQ~aU(&IpTZ$K1Hu!&L@l=gLg(N_T@jimP1>p?VEB
zgDl?ZVhFY0>0YR>*mNy4)vCW0nrgLQ3Jp_izY{{0J6{R)m2Z3_gqjRq2!Hsr|B7Ui
zmYZt$r_<!&B$<~Fe@<uy56fcw5QG%t+xD@o{(b%Rm+<$|AHUj`f7QRokG_2T=ns#+
zeDwJ1ufF=@<1bXXM}Pd{%P;;AZQsQN+x{)p+>0ps!}4^QEtU=CTE72_{?j4`V+nS0
z{9?2>>V2lJ(dlxMMC%3~v>l6q5TNSg8KexjSnpOrzZr4i5^6S9CBax*2YA@p3Sqbq
z?65UAz-s><LTvgM@q!$pw5Nvk0mWof%Xzt@Kk;e+mBZh_0GUhuC^zEe{_f%1H^(4^
z2hY3D(lZdBn9b5f|9rH+YfAS<BMzcY=7e@@U#f;)zu13CAEpq|6MAv-)|kpDT&}5`
z8fo>!W~#vo@D;>&^22Az6i_8W+N3Yr91LzZ+Bwx7y-TiDT{eU3K9te-2ZvugR)cu)
z{p+I_wm$sev`ySBG^Agt=KhK84gCRqXzsd90QPzqlp`%|FpW4u04DWZy7;_=Sn7)f
zhTG8T!r4gw3UzQ;Tz#EjxOUYZg@=z60#C9@0>W?5qLz@B?KlU?GaqwwD#HwzEZauc
z0?Ocb2GRE+tS~fqdTmnLvEJ`Ot#eXr^(dPHHlaZQlITuGC0u{%GP}?Tv+)xK92qSJ
z6nUid@7x92mF)D?%GGVA+sk6jd4|0(y$ZN2`qUp-K<LBr_GJGDxm(a_`%Wu@5%;>c
z=52PbdAGAkde-|0xP~}J=o91R*a%6?D;g0byvh`7r*I$Ig<6v&9qA9i>3{wwx`&mC
z7*T`?7~^Y>1)?0X;R_V9`hn3jxlE?En2qD09!YnZaE^7-@$yKp(;Y8zLvs~Fx?3+e
zG^U1v7?40KoaF+rBK~_YAuyUX%wG$)03JP1j$**(sDElS>e?kmn{H?)nuWG>;>O6r
ziOw6U&eMg~h1<|p?&!>WOg}cFbPKdIBI3xZwp*&cwcNU);nuC~wr*{<RcEz@3ksV$
zk_K9H3wO_aTdi%d)G`6;Ad0^<)k1_~ohz$w?`&DXGoRAS8PL<$Hz@mj5EME+_Z;q+
zZyQE@Qh^C$L+X`IS1XRC%h3WydwM-r--2~b_`aIDojY{bGg!??dt^N{glz4q2?eM{
z=IyB235jMTo+%P_)MG^>0tN?s$LKCt7$9_p6s#eE20PZuY*~O-+_tC#WSRV~=gU|j
z&_yD0iSnqUvt>3mnOHGdsmY20B#Uqlr(7@UhSIiT;L8V?0Q0e`t2r-9@^AwTSVDOE
zIev%CIGAD<JI`{{H^u-<Cic+X2#c*X!kj*_?4i*OT#T>wM(6@^+I?g|s{Vk6eIOWK
z@Gsl)t82<}$HAMPH@|Yc&*E}nF*#qpLGY2+pmBzMonh=dvTOsq3VDF@;+@_S$421e
zT;8^5`xXkj{HCd@t45p=Lwwwmi`eDvUklJWBs)Yu;`AJn?`k-{Pz3E1bDy85V3Q#{
ziK(4rVe3~Yh(SlnB!C2V+Iw&jlo3g`uVe`4)UBtD#ieL@h|F^>D4>a0indjk$hqOz
zJ%<Q=SfQ=x0AunrY-js+bU58z*Ax<)LuTb`4rCc#5P3E1^r{=&vcEDISob@~4*>x*
zi;XHEga_=)ETRKA{z2RP-8iX?_Vy3d-|za`4n^yqM4KGhiaKL9i16Juf6_0p`e$m5
zD~x?mEP(;jJ;ocVqd^Eg_e=}>KfHN;bfUQ^9HWj;&P<|SX=5gY2pY(7bphAPP!z*^
z9%Gh?W__`h*;u`RZae+S-eIs!lbkjf8W#6er#8t$#5Al!_&Z%0!BF}WnQPV6GDFZV
zkRp>99tujL*T-VGeVR-4fk2-t!lJ-T!{YWg&IYvJ@&Yu|Qd6v1b{Mspg((knJ5yiG
z3y9_A(c1`-xpUZk;?5F|Bk%OF2GM(4|FR4>!<Vb~meWZmr86!+$+SlweGuHc1YpqW
zp5tun<S^|PJq^@X43|xaT_6!1FF2{Ycb^c2@gfH^?h9l4XwoTpbptmIw}28W2;G$?
zB{9k*wL{_2B!yIbNzxwxg$aqNrs)~y2&Mj13*RD<dQpHyB)#=ImpJf=FvmQS^!ZG!
zT4^$$T6)(>3rJ2HRGSE7^y#pLui}y^YsH=J85&r`<DUQ_W{f!%PpSsbv^X4WU~@6#
zCdSB6%c8hf*m>Wiv*oVpvMhWlKdJkGm+2FI8C4I9zNkX?o4Ex;ms<^tm^yNgAj+^#
z0EzofxjKVOK15U4M8>hgfkD{RYA=+|OmQpzj<cuQ6`0h*#*srqk!+H2vSO2RilVhZ
zIVb`!nHW!Us>(-#q@WW#A`z#gF%UN9@Z@%5^|G)nDXfAj3$gRT%ZI#HE0X&Ew|}Az
zw`zE#8w7Eqd<HjqJn!;l1&IJ!%M?oB;GCvHka5;F8csKk)4B7h4~_8f>0%J9k+>Z|
z*12sjUW>BOzS~>}lrBt5BB@ec06sv$zsM!RcZU7yugXgXNF{&7kK7T{E5z>-<+?+7
zxDiQq>q3DrrZxrORrijff~FwedW(c?qzPL(#WiGZr&(Ffl;Mc!Bfc8HdHwojq~7el
zIp~3A#O~mq4-St{b`SUVqYIF*y@2>Kq}w=~TpcBG3F3&CZ~prF;6*f@Umhh2M_n>E
zp>G#c65jf7{Brm2e;cVEe_^zsdeC&<?#YQFG~qZXngK5d6o_kLgpUnFR;BifeO<eT
z&~s3dID7ilhic3;(zSeV<073V5$3*DKg;+!T89qSQ4<2D>xeAY=S6%zi`5pREM}dZ
zra-}hik3WwP_tBX3);TQ>DGw(VgMO)!m>~Zy{<?u^b)vAFoqxG3XHGf>mJH@6u-aB
zpiPXi1aQL(4(;_miz2d@rY9!WG)TNU-W&aO{|HLyH=~0e{_|^i5k))=bvHrOr9K$J
zB*idVe+Xf$-oDs>GD64!r^EF@*D4a$s1_=<R;ayFe}V3B2|hD*d6)X@TYE<*|KATU
z|F%Ay<_e?3f(`VF8Q?wM-#a;YeJDx~L<Yc<lcPQiZ_tDDwbrKt7Hv>eVmX#U=$xUw
zeW$bbEOHidNA9fR=ex2~_wPs5vY=CiFJ%6IucGK=CUT*5XzI#RS5c8bKz3M2^MRCY
z(FXh-T1_9T^P&y>K?FD-RK<ZN(=$wNNiX2hU|6?ys%SFy;Ms!_DApw5^xtqx6KM(P
zR=eBigaS5~0JtC%rmco}Q4Gl8h@xxVhY8rAw7*P8pz2XqbsxrHzLU0)jm3;?1&VAw
z=iw-R9cIMbRwxWheYfVyqZR@08?}~5FN&j}Dcb1?lRx}!E!yzWjt_@Nb97AV+!=ap
ztTvCJ(~jBRGtk~#+ysVJ+(HgEeTOqMB+qYckn@TEwb*}w*74Q`V9oYlUwr-e(O16x
z*Oz~M{BQfOPw}r}|Mku8@&3P_0T|nb&SvraPHe@>Uq79pm<f@j*rnbqS;Ulu;bK0T
z<r54A3yzB7y~6ab6t(<f_heTQ1#cAT{O#`BmnW(=kt*X01<@PTma=%3lt2DNMlI_)
z?jkrgugA+pPCurKHZ9lD9_Q{&S9r#0HU*eN6|OtXcygJRNhOA0-zmjvu09Yttn0^n
zrMxZ|$;`|b1?+n6%rFcpDt$!^;RYzk@jNb?f?fH6v3wCc3-u-w@UAxDc`Y}DuYmAH
zcYAt?guq+H6<sXPlV~2FQ~d7|r4u&da*>?J#e_p&RA9r2$*yDhYOnu_{9niM6Y-o)
z;T;*(fo2VD-FKEnFDpsF)pSLGe7b#MUFpKD#819YL16FGI(YgLwHAjtdtGa59Yqgb
zQ3PD$e-0r9iJN9YqtDGdDO>*}`TOVzClk^>89PB|>!C4o@Fs{Wu=$*nA}(-*C(H^~
zciI@ijJmFRVEb;@2v44f9HDoa-41>&yjB8EOLMBdxE#lmM2jmU(g<NBOr8vg?Ghld
z#~|ke$fY;am||dntS?7Lc`zO#^Q&?>2BRV^qZ@N4>gPNuz*>oAu7KS@9ibM7O(Yf<
zWI&;7WO~w^f`L_4YOi&?6UBk6SJRXXDLyBgsj(sg@>xVM4z?8_2-E=ulCASCo~Rz7
zHq^l6O(6e<NG;S7Nr-`QQHwXR!Gm;=EiJyJ=s;l8xwyckRES`fo?lR?l`=_YWPge0
zT(JWaRW!RsaU}#CQcagUC>x|e&Wz#%#lSd4XR#W=Rh*Hvi6V1Z-U@@7PSs#Jv&<yA
zOpC=bp6Vb+C^6BoU&?%z*ezIWo-P-gR^pB=R-?gm!W+o-x*LaR1HmzpX#hm%3J{|+
z3q=h8!o;wR2#GhUEP?kH4FIfnua1b0HWq9?5+keTU=b7sh^&1W$5q757Hxh^^yhCY
z@UaMi)_ILl+`UjS4@cSsB1b)q9swOzSIk3>a_zmo7y#M_r6Hw$Slj&LZbl}dt95h^
zC^n6dtJCA1j1a)L<M<HLKhFAvk3|f|@gAx}bNO6RgfluG!DgQ{U9k30au|~!Q7UqI
zCyVItwI-BU!-!X~&1vvXF%roX3?7R3+_m89%h-WHQrx!`n#~<<m%h)*#RG-t&?4^1
za-bU}-q{JHl|yQQcMQ#Jbo^*P9${Tlsd^egKWC__20H|=Q8k{v_i6w-e-py#6i1}{
zlaN$q4&lxLb8#}D^U9Vpk}8#b8E}@Z_JB^nh&NW=gr%$;ih~_#QPPf~piiAN$vnf1
z`%<;srWJyHtk5dhA+o8(>E?3`!sRI4bbZcU2Axwem)g_C!W18HYzUsDw()2`xe9(j
zaF>;Q7CFEU%~phGtjf->GLzlmKCPGVgrpbVu(Y8XO=(AqJNJl8y28LplL=CTNXp}k
z>9kN{WV{2pG11XTXD*`&+K@v|1u&tggAw))w<(ZN@Ui>$<TditAZ$PW^Xr!{y!-Xe
z+aK+23m5f!PWzR$Bft%;vgItbS*mnQ1<Na{nCVU5X7wf}I9*uJ26oel)EE_h{xt>t
zChmrNU=Z3XheiWEeszPJGv;H7bti;|=!|8$qMji|LU}pGBp(F$UfKO-kDbUh^1;&$
zFm<1c>BLdd^XJja??!?#rj((25vVjDV1qg6D_^5(143|%GY;WtEtSw?Th8XpP;-uz
zDtgw4{5+nInsdL|tVvc>fmufk^f>vQc3&QRclZk8-05W$Jp6yZ-90>c`${@BXsJWB
zo}aV{k*XPR6sjVwN-bAV*MiLJr6ViaNo_{$wMdr%2bktR=+IO2z^<;CZv}pI@#oKM
zc~w_e3to0B4TEM}X?s`&WnE=cl-|@tnE-xu9eb(LylgaeG=zXmAg{dZw-!nbkcw2A
z_P&=?g`iRcE9^(^+skM3<w9e$N%G$4<T3a{xsWOK(5h&XCnbeAh5E_+abm)sD#8*<
zTgxAvJ_B1GolSGqb~xc(?TB?s3&0eba8A@>Xk8uScL?F|qv+-*H|2d@>;bNAxN?O9
zIa`s94L+G*@^++Lfx(9jD^Q}4Q9NVdH?K+lcnX0XAuBv(zh;Z8agmqcjCOi$vU<q0
zUAvQ?mymZFv2dBrQnmEcYrO2KzC(a0MwjKe!omutVFsmU;b3u}d}i=Rj1F7TSa>s%
zN7!I%Z{eQmyG;+GTG$NFl$`;OJ~8)Gn2Ep)hygN;$L<niD2%taca^vb-+TSa#aFXr
z`U>2vUX=~&1{b2P>D`O&648PH9+U%o`c&4kky$$4fL&2c_iJy>LrUx-q;pNQ+`)<#
zcCTD7EnyqBw5cI&GniCN!>EUe$*5_UK~>SsL}}z_73m$FS;BlK5@`;ix?(}X(->X7
zC22=q-a~~5z}cJ*d7N<$Iq0OEC*$-i1(BalO=qSH7EI{OL;_tkHtj>sHXAZ-K%iR~
zEzK6N0Xdpm6`7$vd*U&aTrmhBVKF$uhbsy<Ns=}or_TtoWmw|M=aRd@npCfJqNa8#
zIUC!FDO-mYQ`1zOvqUc8pbGQBE<{5^hrlA*L44k^DgunrtCkW}G^OI~rq=|4g=Q^M
z1y03;fPw-}qmgdDP@t=rs8bfDD_EPP<<9^>K4cehrtWgE+*Z3tanmDYvvDSD$Ojjg
zO`%9PzQRplzTPk2rKE$f-x8(=Vv2Z<F&U<dbUsaVw0(oIh7kl7rn;5GrQo$ZyJj;$
zG$j^Cg+l+^{Z<T<LgSYN`Ls$}hR*vlOIZw{cd4q&qv+mCxmyaq>y4$YdO(1Ll$`-^
zgl~=!-nY;WGzx^pdILdTk3nkeePah}`__UJwANv~oGi->K<Xl$+I?^S&;1@?cy1XQ
z+!MdxP8|>1cV7=2ZLo_zDBBQqAcmmj5|ZPqOJLb1U9_aI;7v{`M#jwrh++lnxo*sM
z)+!%Dl7z_)!KV}P?k<XxUb&0l$&MH!kUJ6t5LU>yuoWNx#&er;#*2j(BZ1ixyE@h<
ztCtci4ptqKs@bU3Ywd!r_C+C|tfu7l&bT;eoj8I{K!3M!Dc^V&xxjCw6ejVLBdg#8
z_DrI6pMDW6tGxqVaS0!f5I;)?<bl(HTpmSZdVTZxVfYUaKU(2yh#mFcX#%ShYr;qU
zaA}qy(mv3ReeaMkhU~Dkr9+Fh(;Sj42$KXW$ybfcAV|b`bSjlGGA4U7zbNuKM-G}$
zn1Tu&H5f`oIWH|VsKXHmCAYq)x<Ycj1hGQO>2zx@sb&y^D?~H>2y%_zgs8QOxX2fF
z*G`}#j`vQQCnA-P`iSnV$j%3-xi*$LR87=lM(x2fDQIowW3^_m8*=B;5!$V{@UspV
zNnGP|zNK1ayuqo~bF3deo)91~3zzo|)v|6ZE?%W1vW#VVlpxVJlLHGvr&KIbCEhrv
zqf0OH6|`*$HuseAx0OyinM>7CTKDC_4jpN|+mMh^a8R9TvI_feNKqsS1oLJ*>Af<I
zOqv{?+oC~>d~q0R)X<@|vWMWMD+Cc{Sap4FKBuI+lvmb?0X^@#_>*_UeF}$z4y4yH
zICL1T!|(N>n?ncmVm$u#1UjCvTL@^h8-TAes^V$))&R#9!O(<m5NrEqHQF@@y<ShJ
z;{#xL03%Tr;fRs#5-|d#m>2_6J2GM&hPc}e()j|p(fv`mJ{+av3fzUcTWao}KXpX=
z+={EeQ@r8!M-=_u6zjLk3B5BPxu;zcNDTD$Vu;zD)aq|UTAl{8fm_j??i~=Ohd6jf
z_`1+4RbACpw6@@a5T!_{LGzd{f-vDR9D@y9HGdU)_49UCPg}41^#?Ltb{N|_c{_La
z{`>90(SGN_lu3;uuKtqu3qX4Fl{Wh}H^{!a0tCC~_g!bQ&n_ji`Sj+@m?O2_NXo1t
zuw{y(Dz3eyls4u%OBUGKJ~wrrg7Y(bW|{YHTubGeaTS#@fq&D@BP`zG3L@XT5t?p?
z?joVFtx9mfy#X_)q40GckByi{yK%Emq-eyU-Z13XwT_01LVy{B?v!nrVTYM^&0Q`7
zd-K6n4AqT-v_m?LxG-jPY;~G+NS^8^G#2c<%-lr;5Ov59*QP<+GSWDnbmz{4N+x^C
z)SXKuN_1o~Ay!y~jgl8qR!)*xoJ}^l6l>q1F%<BTtH#jL0nESz35D&O<n%I+3k4<^
z;ew3im+Ha=rP2imbBcJ9zJ~@ekZYEMC46#rmX0w@GOD#y@j0lgRO9oD>k@;Qvg%-2
zsxB~OLoW1G(40_J86grL&C_cTGGfC4fsv!Lioj+SXN&SEQb(xophj1fmUFEL%aRy_
z1PC32Xwn#wBCUv$s*AWVAp$Bm@RqVDK_vJ%RVKc7e0M6B<HE(t^tO$>&>SS#jD|2>
z+mIB&r)z0DAj6^ovxsJ+O{du92)Hd(4X;prIJp@vF4%EPO(DrG(!4Zo#fBj^?JG@E
zy7v(gh_)1xlRD-Tl9>+45BEj4TVWO2w=?OxA^8liY4|Ld3%4=&Xjur+Dtyq~gCMB=
z%dZ}<Ih!PtkTn2hQ~tF2wj1-6we%5A8`a)dC{I+!uAF=%UQg(kNfbFG;*{-^@$|Mn
znp(Dmrv6njH|+Cck5V665`^||?F{{Y@L!AnKW*SGBLFn||36m$`@-}8f2_*?+yDQQ
z{Hyr?b4u%f)d&ESvb@7s0rQK_No8&wazG>KeEJDO4^R~E#hS_4g)erX&|i{kYuhOk
z4S?^cCecn4VBqG3qISm%4l8UYpc>YTY~Cr_gsB*i0#460OEin$kK*wnMV1msgO}fF
z7=+C8yL%@Gf88H_dvGGc9Iz~aq8*&3iy0cwp5;avQI5ph=o!*f-yEF0+I=%RIQ;gt
z%;M2!JC_F##n_cHNX}8;UX@GEm1$5#a0m+eNd@E&<f61eKH>D6eW_jBGzwcvzTzST
zzUT0~$|!3_C_)n;h1xU%Y)Fp)Je%|DPdx;=2vp@RMxa3zlTMh&X_B2UE><2-Ktkna
z^P~az!`&!G?uctmU3r*t8hWTW97va^&a2G17XqPVmGx^f+`rNKaacQ$kROlsb`M8y
z-X49oj{yfmqqPpGztMhkyr|}({T{czW}&}*eYCg#qJBQ)i~L&wN6TXK;C{!;Eu#6o
zQOo{%_vQZa-hOCC<$QXlNDTkP?&E0%$=2UC?%MlH!^8dPE6=l_S+Y2r{>D6)avGlo
z=IItbm4#2KxjWmrSpu-Q>du*2x!WZQoZi*uRR??b`xeWGmKElJRc`C9E{a!^f>wnn
zvY~lBseA8ICia7S-^mK@m&Utk&DN{lNu2c$%7BzZZ$~o<uC(Z)-sU!IpjEW#;1~Pa
z0bUaT8pD8r+6L%6w#ArUqg?-dvYgGM1tnn7k>wfCSR453QUSquS)fhqPUz!BdVaxQ
zKL*PKvh#0sv>sqr^2PN$DRKNf8Xe3>*#BcL#3X|_9rGdu6$U0*L{>RPC%2vq;O0`n
zCTBu08k4~TmIkX})FK&QkEgzF{uaklpr2+QW$9cT^LSFrumJw_aH}}#A$F#X6s;`7
zqPSKkG@d5q_)gZsX0!r%yM73+k!(<0MS4Corb+9RBw(mb%?n>xduMxE8EZ4zz5B?1
z^NZ1WlJ(ynzCGT5Va7wL$nEe@=wKg*k*WsaTAi6EWrlIT^VxjR>%n;iyq09k8C(Hq
zBT^)#LQ*5v-woZjXR6O-k$7*joR_ipA(HPGmg{$3YrPf$$~1}3FbXdKrBOE6jr2>Y
zeVERCFxsHDrM-pOut(~G^BOUL6B|LjBdyUM+^Qp;zEA499tD+M!6n(@xEyHReSrCA
z^Ri4aQo2r3#|pIZ1^8Y~qI|iC&We170m=)7I4IZ~YDv?D%|xjtqpd(9(COek0b$cI
zW9=eWxOU6|puza&BA;S35UiVH)&<n*^I8Zs4^MIsP#iw)u$F8v=`LvVT5{v8ho?0(
zs`y7c;WcIu-Eo45@Ms*hm6%Vc9R}(hc9f-??TA(K;AfdnH=(?7UWerX&l}7=_<4yw
z-y+hRiJf<@F7yob^Caq{eMAo%On`BfmPwscgxHl400Ukq!IM$Nx|Y24&VyrH5j<Db
z?VT#jxSThg64A5gJT;6sm$OMriTe)SG%AZ7Y$5l`TD6In)@Gv#p)dsASDiT~X--4W
zLVyvl;izs@$XLL=f@*?s^TJ{gW7I{+ofXRd85D6qu^5{R1zKp*&^Ks#8^#haXrN+!
zG3CwY+H%b*{;3rmTs+W&jKXlUvDFw6I2=qfkx->1Z@FjmP6wd)7_$ypEjlm2a3TPR
zav#Ix%`Ucf!HJD{S!-9d-a-;mHJqa*kIqcODu)gD%Rmgb+Ne^J!(5^+f;+Bh%}fm8
zIJl`0uo3e#faeobGDaOAs%D&36EwRTVgcRh4?0Yy1`huJ?7ewk8%MS<eE)?{(Z-u(
zOJebo3>Xp&*x`;1egG$#YkTyxqy~B{sTH*ZW)eT2{XJW)UELC1lFWUhUt*;0+UwM*
zv!ANLRmPNYMhEv4pfo!PS?v=jWgR}odyXhZG)zAn9{&B<)&{A|-M4)WL!XY^q|z8V
z>7ICcS^`6Sl$s~~`ehmqC-{XzycE(n%5SzrbewRkNKN7uy<!>asBnQrA75yOojxoF
zQgOV5C*&^K2BwdK)Cdf4g-t)s&Nf}&MEjjm#v>iFbUbNx({Xp2PB=3caE>{JuO*Lo
zj&RG=A<}ushhq#{97V1?_sPAVUa@f@r%#3z=bAXLCfR%T9RGbz)RS`99?Zy=lO-Jm
zqv5o$s^^5LAx>+C^eqpR{T`F?7+zu)GrnN0jBWzH;@t328F+dQ?HJt$<NVkwYBmR}
zJlQOZ?eUp#)J@WUB^XtKO$ZQRq%XFQ2#kK-d9i(bJSUj(!pwkm1!A-$X1p54j^C#v
zAZ?{4XLO_O;_TNK9L%|wK!Hi3qD&}@T5du)vl5^-u?s~WbDZZ+5)IN1<O!!h7~?r}
zWe&NUOO(PPG&0RG2!*!lRN);OQQAsc0?Q<V<pxYpBqpk%4gn(qA4XEazz@*gs1Kk_
z-Hb7-4Vs2>{T#jl_%n2lG8{IbLzKQDnB`Mt^a@X;--vEqwB=EemIj<bZ;(jy*(HUT
zFc9qmu!R`#T>vjo_%Rjn$_DU{0VCq*c`}4KPB0orN-oD}LT*HEBr+7yfw_aw%G~`G
zlo=Q!Xd^8k(=|o^t2Dv|DO^x?!f6L59Ld^}pY)P`Yy?sIQVDpvNsG$aO@8|RZhZ9|
z&+YQ&BsIfTCX0UK!)bYrDNBYb=P^A<e3TpiF>NrRJ^Y~zKeSjX%dA2(%9=S(^NGI_
z{qeNm9P;m}RbWWMU$P%8dKBtXDsd(KwO_cK10~!C2E&?+dhT{>VBz0*wc9!g8&YhN
z)Eya9Gd5z*+dMJLJin|d+ZQOfG=+5ul1{l$@NJd?%n$b!d_*WNfeqx=ZQ!h`9q>*I
zPSj%6tw_4!0%Knku0Mm4MCbpW?>=$JB$v>Ezb>oEhawq_CRc@Hfz{tBpHqf;IC06m
zM?=M3;o;XulH$Q4(CwIip}uXN%RXOpC-vMDW|x%(W7rXQPw{^gk9QICZ3ERc$bh1d
zDB6@|K&qh>j>sgA7E!}=2D#*4i#xy^*CnGNwbY{oh?HV6R^S{_kojiZ>uuPH4?9;9
zcPv71w}XsvWTc2Ngcky-J5}VkI#n2Sk%Bl}`{>Mpi2~i-mxXb?@@5`L@s#@OKvo_|
z`$Q<w%d8Xe$%pt09$`9;g#mx^am-Ej5)YMAx@0<%_Er-`Nt~5BeSC!Y_+e^VIo3!n
zPzqWkzdUIFswYhxRElkGZOVeobs%{Ffo7T#7~d>sJ$zY;8W;i4M73dmF0B6s<A<^0
z6OB=s5%EH~Y4s<zBpJdfTu>A}!;q<Q_gts4xZ<2JocwjHNeRW>B5YO*)N{0iH4z&E
z^n+H*nxU%)GK2DHgpqtIPG&iCsrp0b|6oIC&pUTxYPAUi5m`I3JyrFux*W{Y(`n)K
zdWsx}Ky?o<(a36y_)B1Wu5QYZgpDK8`>S;)+_^=R+o1t&%tl>6mQxM?O7MJfMXDa8
z=@+z`BT}(N3ZbP*Fz6z9jSB$3q?ow6J@Zb`N8POg$6SL8Zm=~Vip@t*IV<S5L^deK
z^>w0%o4{-;LLfITk#pe!_r~^Q(<)}%lMgRgo`nG(F`67jI#&8fiVI)@g^AxX<|a#r
zQ%UDz)~}z$Jy|(xKurn7AQ9}{K{ZV!d+m61p5j0UhVwJBqM1MCifVR}e9}aldI6n0
z=_itSisTji8;d$Y)UX;Lu1Vgi#!*;~5LJ-A35(Z@Mi#!b>XWdNLLv*-M<4T?YjyWi
zMqr!IcI8$3mQV9I=}mzj#oR9lEJ_GOQqyrVC77ZM9Br}iX67br5f<Ov1N3^%kqCr_
zNlI#@H#i<UoMuXy3aZ>IFk*TUrj#H1$KM@Ad9<pBTJRJoI<f%&Vc5s(8Ni=9odfns
z6x>Jqz-44a%w4VGotr(O2(Pp6?eW(*6s9LzIsUna<@dR8ZK2fHzj6P3aH}NTRwfWt
zP01~_qdBVmVaZm^@zjG-=aX>|Hm1V!{_021D4{+A3OIdUenn*7pecVWIW{am#si}t
zMx(5scCVuDd6sq)IWBm=VTJ+2YPcdfpqQVki^;SkBy}EPzQaW=`v%0Qv^p5h^9rqw
zq|=nkM(nyu$P^{|Ebm9FQoxrIHhR%W!X1QMNYgkES^gyscH)ri*9;8m@%tuHv{2Is
zGW7R;8NmdEhGsrtGcM8ORT{yBna!Bgy)B)}QMderTP};ES9+p~g4*xw>?2`XLRM8T
zrp=wLyVZkex1zo>?lKWKwm2WgojVHhy`VFqPEiYSHjT%CQ<EfjxkH;ZWVpq6C8)pT
z21Wp}=>WsuU@p-EBq)KmpKw5%0>4RNMwAMP8_--Ui3{E&9@}bY1Ahm?EM+6|T2Q36
z7ZfLCw_>>zXj7vx8ot9uC%r$F<*t2+vOvrU?_s}ST8W~Uv5SS+`f5Ryxh4ws$r|EH
z$L}QF(Gow(1*~m~wHexs0p|tTUS8LbeM2``qC^TxnjBNa+?HdNX;EzKcn#a7(yd;!
zk9CF7deG4c?bU-~j|!XhQhRkfYo4G}RDs^ubd=`i<f|8OLWgk573%IKqse)Dl96tY
z7e|$VA0r(yMuo3&RE0Z-M|%xXsh5*0w!1(n2<r1ey}0YxU`u~%xvZ6HM7%c2ieH1L
zLjwiK8}tsrtGOhxl!Zwgq4{-8;I0owLCoOg@$zIMRw%$(be{(tGZx}2LkfA01@N3d
zKMU1x&@QKv+HPIO@?)3@Y?0qe7;z*QY1dcOf3Y2RB=GG)%F-VDMls)En0>T&+i(k*
zD@Wy2)(;d>R&1j>7*m0W6E(o|gqhM8N3YG@qn8mddpx`X%3=Rhy`}uPaURLF+c1{*
zSvKOR?dgO~Fs8r+_I2xWZYi5N+LY+tJd=C9mK!?1BPX_G!pIr1Kh6*(!g>>*yAnHr
zQbXWij6Ibnc!wMa$VmYq2`PKZD<cC?M7IEk*2T=yX$UD))NELz)XhEF^g+y;xe~CH
z&qB3UR2c@ZV>@Mffw&H_geGjF;ls2HX%_WXcFtviiUgS+YIrD2%AUA@h(Ju%Q3mXh
zr{g?2WcW^YQfR7W%=oZ=%-rEH0iLgujoEpHz4W5!m~vggk{Y9@kLI-PrAV3s@jHHR
z`?xR-h%#W~%@?H{PLLy>MDbY+loR{8bhBZ1I>yLdmfB5g);LkD2A2TMCgI$Y5Fv_b
ztNm>6#j-u%b1}np@y%fR?|)P7>+4d#de4e&Dn~M_S<may0aewIc$S7{1Y0tH*h&v|
zmUAW!S<#0<{9Z&wnO`7ov_Req7>))vN*_Lm-&0J~DKO&*&ti!|W{!QdyGCopWEhc0
zF#2U?g6hdXixc3G-ZA#GW#QBnINF%22#Urwzy>U_UN?v$6yIV7j!+A;VgSw~o*KpV
za?of=pofZn=j~V(4LC}wXtWB<?I5xa)YOZFY&hCr5q@UI9P|Lb&`)LL!MXYi#~+-x
z-%u37Yjx|yA}sbAa1-bygsBijKT94r2Rpz`c?LAv`hRX?8y~@bDtmuT#(mcEeaUs3
zm)KpX+{B{T&fF#Q-wNS*|EB>>sfg#A<l;3i|FCe+^;^tspG&ibC6YQ?Hz(GIe^~<e
zn+$vAH`);cDNWjUu3mHn#S0p~#Ub}=dDo%MQ3bE(I9d?f&9<Lt*z>Tbpw!1V^m~*w
zn{fp^O^vKh;6;}<0tr2}&KI8=ra}4qsdcV3wT?5jg3K{+qIn*d<CNf+Wbgj54!RJl
zm^<N@onRcIfZPz}WR^TZw?hLeS$Y9kr&*S`S-!{CQt-lEul<hSzH-@+Ui@UsYB?zw
zWtxrKB|%K81@YEu6~i<Iuq4G`awSouk~-2nmkft_RnBC<%sgtVS6RVau7x#rfs}FG
zI7L`cGspRu^Xy0W?Lw%1eX^)Cj)`@mx9Q4(qHH@T!VU`Zyln_$(okG*;8#!Utmwn9
z+#&_@w@esuale)@Qsw@{-i>-~eoBe<OUdwHCCUxaT(ersq}7Oe$S57xljJ=rE>VLT
zE)n;j?KfJnn-)>G9FQLAKt>^3SS2~b(QI)Gm<3PTKpOxc4$$+5qHDA-fn&o)Wk`10
z^qq{<{eBAlYO^+Ca8S>WmcqbWjFbGFTTuRSspVAHODJ<QIk9p2<Y6~q7Ly%-qkfjN
z%ukPt4UExqvy0aIR1Y&DFndb#O;sV3;IQu{K*Y}WaU>B8q~5Y+=-@7w0btyAq5n{V
zpt8{#04LDY>|530%BP*rJzQTH$YDft1G&;dd9Y|8+lOW}y@n3hh{Zk>@X$XL@F)b!
zAIs=N!P=paa%B<{h2MTZnS3~+2wup1^INj`pAvRznPkQxh7wa1<$zIaO97Pxlhc?h
zk)WgmL7RaoY476*PCa^bvRm7%P&aiqBuy1P-YCjsb(9mlbF>W?&-@Nk%3%_1alyI9
zEztb8B-d&K>gb@i{zcqRmF1b%pyMTPRr0QU!<>{-a)x3G5jGCtq{%VWXqcV}E)Nqa
zt|dz#K#$%93kTqlcR_i<!7=Irw^_1}6$EbRRLzPeSMW^?oJTWRAv|Ur<Y87yfqZ8F
zmOd~<)XyD5kK%GrOv~}uR*09#qP3CWcx-!y91$0tQy>D#0+g#nJro{ENopzJ6+P`|
z9XPiHMx2P8V+vwxD7-a<D?62ww|GCfh_Mk2J&1=wGwLSN!KFbty^PJ)IR9b9r<?Ly
zi@!KUXF{Z+-Aa0Hn0Ah{WkmDXUdDyh_!{_&jr)d{ZwxO7&6WebqhB8@MQG%hpNL{c
zr9<_YF_>jO7i23+qa#+y4T8I__y8-WK^0d)yu+7Z8oGdReN()z$~5RJ_e;QP=?<BV
zx$gD-XS%xGyJY^Wk?usfAcI$<C9e(N2-m&DIO8!V-18%km4I>ZUMncx3bV6qovF=`
zb;svidVvd15!LR6S0;<T4zjNR*NWS%1k&~WR%8M`y>sho;}d%_P7^w!r|f`;4j_1j
zEqqI7RgejjiRduhNq|svbLjC2H%6f<2FZ*7ePSVo8ZzL}W|-Q19h1y??e{8e_bP&#
z;{JSj8HV3Y^j)-y>4Sq7fD%r}Iw!rPGd;tDqUP-i^^_&VK{jlX@tiJp9s?X)X1M>v
zD(CA|l8Z+eU+9Rp6qtzj!|Za{gvCbULP25DI%`F}DTQ1?#VO?ul-g_c=v6WXs2afi
z-6U!P>W$DB4N3!tufeNj^?H<?#p7OIlEJ8fHO!a?XuOfIMFj;=CNhC54>KI0r2SN5
zq`1m-MRi0Pz$e0*$D$>HVCA-<LNFubXq1g7nwrr>QjMvp?3C+wv+0<|J4Bzp4jPou
z;`J<hY1vJ(nBU&rJzB%G<TW)p;@tHQi}Oa4P>Fi9P=tsloJCt9Sljwv`GS*Gsju3a
zLwQymD9u-gTNQ14E(FyuXbNI7Mq9-YpUz$5tW8A%Sdk6=gmIV7&L`1u+V3~ft3%3@
z>l|$=!oqlrBr4j`W2gy+g$bIpDI%HgDz=z6u}wK@1({V?LM3YfxLVtrBw1+9um$zO
zz`n7IO1~ST^oxG`&9z4;(w*X35hz&@BHh?@i<BA_1x?UCT1(+v_0FPb;h7(_*7GQ+
zR@_#26nsj^PyZ;CyP$kM#d65ri0}F5d^d-#XS(&xb+5fg2!;V4kq49U0AVh&!7^9!
z5JjAOO5VY26gQ63zL^I+zc7fE*#dG}R&1KQkmi*?vyJD;9*=B6C02efOL7z!kEZO(
zOxT*bg~l_>X&5fk4Gy}8ZFb2~^)9(^{VO9*F&UCglL{n#rDz*;gGFmoJe_`!Z;`+q
z<J?u2UNTb!o)$-A$Su7bw7nA1h8I@G$1!S>ygN=iYU&hWFo#jVEtsG>lN(}7EW=7U
zH=!+@lbk1t3ePa7yo~w8ij^JX3fgWxrSuyn4(6zENa-yQYdxCUV(6UaH_4`GHCH_x
z=vQL>nqlpeywQpwC*nHc+@t6vUf*ac27K}<kcJtV%%S9BDC9|<jf=@`IqqLzs^&}B
zR1CLBNLd~dFsn9HLAx0myq>SSof^t;vNXWzsnQj(_%RB<ErxinF1Hwb{T0b&s=UlV
zBUY{$7*IKdH*8gj90O9<xndE`m0OSOWu*svNbC*=NXwx`Fq9oe(~;8~Eo`VS0gQ(C
zOg8#U6Z;{hdyw|8qOFP%87f0g_;<fz0fkK{i$a0%Xl6HJ7za&wS*|l?h?|C)@JR;E
zl0Grz?*}|HXCVi^hh=dHJW3*c=nky_6;1AtOi<{4&?E*!n*Cc)iStAu2II`Wtnj_$
z4X_+gb+0#cAX?R_A!Zi}j!|A_su?D#a%5Cro^+<6ooe+;1#Bw<My!e;)}wPMVry}z
ze<IPm1)Z^>bW*jh(_2RxtXW92%hpP&{kq<&8B-6TMeQY##juvjUChM_i(6VO8B^(6
zSroeqO%<zX;N#O4)`3Jkpvc)<=cW)O`B>p`_Dau1gT^#po=gh<=gjL2Ghusm^{h*(
z#h&lpD>}H`oKZ`U#Tqf{5xFosS^!@_QW<4}teKxjtX(44CTBATS^E091+Ag8HRJ^p
z!;aXBeYw^^sfO#2q8}AUJW}>;2D^ny<7fhN`MBr@;3=aFZAl<g*!@$WmU7X<^f3IQ
z<LIrK24ssxq2oyQS-P<(E-+mQ4RcOWg2{q|DefM*)O6A_iCt1>zcG~$1SxooXpBL$
zF_t#PZXkLXi7-P6Gg(4PAS;|P>$0&Pl6E{iVpA^FFc*bXL@E{q_{=xRj?F2rq{aNt
zmR5QMj4y<#B56!n!D;3JVIB7g<3|6PAV%BXJWTpVewq@G24>o4PA_+LGT{qfs&|C?
zWZjA;A@5j(<F$N}7t5{>6;WJeN+~;)#;1jD30F*|<@}D7d{KUYRh6K`T(6(l7}eFS
z6`~y(IgGkpeoCA}KT0Y2kC8HPWcxUG0vKT?JE|>c2$0M;s88_ZqO(?%?n-^@ST}OX
zVt86BQ^8$Nx$xaa_;3m(;M3Vsg|T#@yQ0d6`u1yB?qYK|)bpL8fjUUkcyh&A;#3-t
zYI)Q6pWCouG7(LO<V=T*cP*%SnnwhIv3XTwG9!x6LKKon6z(Fxob#db|21JD{**eX
z5G#2@5i6diBJ}PCP1Jt#yLrg_7h)l-g`>1AXW_~mk>|QqO0SbrDRr6Txj1}7!(2Z+
z%(cRFXm;%L=RzzP!#mk2%W!qR;i6rFC8zL{-p|0GiWmG0&(Q0Hq;ORyW!O3p7*U!F
zgvc;f{ENkP2(Fe|+fB<8#;PfO6syrG-L!2pDMgP8OJf^i5JLt?r<V<2IXxQ%Ul;Sq
zUW{R@%YvDS=9{Fzr<!FFT;d{dcP52kfDkb9wz*@Q+ffxtH$j#hBR$w2$u)CMweoF{
z3@FbQy;*6Pn1IYaGD+u~3rJ-d^Su#<WmG@vUg|<>%Xf>BWFR!#W%`qys(6W(Ih#>o
zze(R29k$_YOBG$rL~6!!lyp($l1Fllz<Et6t_W)dOeRsv^_ighp4Zld<s->6>+DJX
z%z%y#2ie(KpS3v%^uWO~<)DC^+_CG?Bz~XdoWl}LERpUc@`YNEsH?qXAQleXyTP(3
zbD6OBy<J}z?13cFypqh&xF$+%WvBUdlPtpNAI~Css%V!gdL@`#xtEj2c^As7ue8tH
zNg(;ttUy*INL(6?(?LAGTEa$+7?Bdg!4te3RBs4EdJs|#-*fOw`(jh++w<H-+5T;3
z&6{Q{f#5khSKafEvjSUkF574@h(~6~H76yNsC%JAZC0<kL+*Z7uS+>xM#J7GteLL(
zhpie-0P}+66AT!1mP(>@i&;QlokS$_e)Qdn(;%@wLbjzdPK6&2w^Za(7Q#&*0Dt%O
z3H_v{Y(zD4<m$Eq&Q#~nR0YCmL)7(2fH45flfun)J_XzZ`%jTzaf|q-for5aIUn)$
zi?CrXlVaMf+54b#XM~bneqqF<6IJm>D^E}x2oMW7P=MG6UnpjRT$CtM44c!aB$|qQ
zYM90?n^sF9&($uIyJKVaKzwf0NzUW`DP9)?&JzgN6UAAvY^qr8%|Td{I$EJkYB=Dv
zTn+wZAh+n6%6KTKDrqJH8jw@)6NtX<RplX58zAr1Dx)nHGo!#_;%ixUU^cn6yr&)O
zD0(XIg|``Y2GA9?8?IjD<Xo)z`ha65a8pbYt#|IiE)dD8F6f9;a1tI`!5G7wn~xq+
zG}K{cBPb$Gq0t0TZ*(|JP;Gt=O~sfHl1U0~f$bi(e+5P}9w$v{DM2IMJe!Wu(Sllt
z^N7x-N}D1!6=JN5`oS^gAS8K;+JtsLxk&mE<u_+ddkhQ8byJ}D0K&)?aXQW=WRwWq
zihJ46A|Oi=7%JxGB`pP(jB?imq2&ueN1*w-OF()dipW2P88Co$IA{~pjgTKIoKuzC
zajb2m$za;3K{D2rnT(9OU~0wWr<ic870o8l_i#Gsz#9O%UYh?4ji#_MZ)9RAq=he?
zD^B)8>pVmDg}kL^EWd;rV}3P+ky2eh=;_P|)NZ0@nx&h2>bkO~IgB@WO!Q-r4!?Yi
zYp;DL(zO+}FBy*&sYka0B^A=iK?Gyb$V6HSb0#6INi*9?iV}I$_G%feNiC`_8y%!S
zIUBZfOpA(aUSMt9WS)V2qG8_G?clzMYr56Q6K}PJxtBWk?<-b$cKgLZ^_XO3Iw74m
zV1M*W!ULv~sT5Y)j%PndcV4=k&svwth~`$XV+-e&N!UUFM8{58(M{z8s)A07<jA~G
zbS&`x(oZ0%^&JO+2+<*A<YesAzvV;;IVWkeUA2adh;`w2c+eEITE^+!OEbt4Yr$k(
z{$%RSEneRO2E6vrbYVpxTG_j8kyPom=z)TjA62gxOrqh8Ml6QJ=4H_ufD%3p3F2fN
z!8l9}0S<@jpk%{J-bjL|$=C%orShtZR2KwD*SEaX1=tJiIk&z{w!ytS^0vA4eQD~<
zF%|`MmSIVi@YR>1e!9^1573f)0aJiKy(IuUN6u>nAOQ0vHUD!c6qFvJ9H4o=8l2~_
z5%?nAiZQ(1?`-1%!}i2(UU54i)dt(9lSh>{B4x%++Cuj#vQ_(9_5+>|s_W%az*L@9
zf#dq}W!BmP+TunBjTaPt{t6}ubB&jen={x_MEkp`0HYN*PHaF0NF)9V$E9%Xl+d8_
zssFUIMOSjb6lhFXrCvsXelz9=&_yKq&?RReamu+AkrR`~R^;9}DB%0iYV>5&A~~8{
zJXtPIJg{WUDr;=hY0V|=$|`M^cBUocC|J(OVRJep0S(D?B={34SI{JrIe`j)tWxH)
z;GwQV)Nl7FusEGE@^?XJluPExgj`3%%yfvMcmVR8!1a|eT)vS0)zzZTq$#dPR4B@;
zgtRDC+UgVWSxQ@@v$fGknR4~3XmsaN)|TpOLsq^UiyA*v$0{$El$0n>ib5oA{7Xua
z{`gcnvvrT9?$8y-znod0CqvHSjEmwLhD5=<IX2fO<GV4Z-)lJ(l@LTTF_%RZs@Qcr
zQzuwKfUz`dS`==U-tx8^@Z6b(Xqe0Q!rj%OiOcwkqbgy1gveVQM&Z`Q^-0V7F)R$l
z^ab+?L@Tlrl$~^xPL6;qJdel!!Kb}SqWgt}Y6UY`b9sD{hzt|SU{s}E3g`lP9}e>e
zw+Ct?a8N=QxYyJC8osbQd=ctDO_C;~nqQP=RP2reSINK{pDRIQ0=5LL%#v3X_PRnE
zXD@a@TyT9koWQs?0JfzLUyuOwL~p;3v`s6^16H6#)HMTV{pX^qubhhQ+QC|8BFXt~
z-p@?-SA~5m$cD0*FBoG`iUYd^<L&e%$&;>%R)c8Va+v^^jN&Az8&4*f%sC1{9o>{-
zJ%~{&$nZ<*NgD6yA{nE%TR(lDFk&ZXdg#3d577-iMbi&xZJ4W?9GHXk#mSIE1*u3f
zrRKr@E)_2G83*>Ww(6rF3h}d&G6n*JcH^N*3^qr$j6x{obO=OKI2l9+1lG7RlLl3G
z6KMp4??_83_Krg=C^cJQsVt*s(@)?w@O|=iEz_&azPUv&OS>;sI!OPzCGRzNRNAZ)
zzPDr>=gQ3c={`CBe*3#D_!n65OE?y@9BSNcDuSTp>ml9A3fZYJ=L!eJ^$Of)bqu0n
z^w~jzf`&Pw4&c0H5u)#S@X>lCOJrWq19%~`3pp&zpJtMvZaj8ruQ~JZsP%D(1C)?f
zF*SuG$-lEFuYZr4%U>s4o|&v|C&PG3(?nfE5?e_pGv~ybBFSu&r3oBU)Lt@KQ=xm&
zqEKu@D7eo#Z25$ZjK~Zm8*1?{4U(FJ4S>6mgt7S3wh;)Vc~pSp$}}fPVttrDzMCtZ
zA9<-^v?PMsEV=$|P-N>rS)^PCQRfxHFv?s7uj?jZQ3Hf|Mvezj2p`m?p185IYydY4
z$3=M|VGVJn_Fc{v7gjT7QL2!Q(kv*b!Y){z8Vs&xy(W>3-Jhdg38dXrUCqq0i=F5I
z?<Em7l*-IX1Xz+kl%Q!hiv~cj0)nv;&MIpi(uu2Nomwrv;K$YAXQX`7Agjx=yGa;y
zQAQnvU0{VTJ`r{qHiFPgt-8?rg@6NFc07_D*pRnh7dEgHEBZ<`aA;x{Yi;}q;bq}t
zq|DZ^fVtYLM(A{IXr@v>r`;^!C>`2Jcn}ZcGgj=O9t(|j(R_3?<uEN6MT;Y9$O2Nx
z3nz51xu$ArG<m~{(VlaFb){>`8!EQ@$jU8SFAd{usYJgjVdvbX!K?FkGK>-GuqvnN
z4UdqgoThNF9ADdcDpD@pIz{LtPat_2&}CgG_4nt?2uu(lwJitQ2J#OLD6VWjs09t7
zv7hSmbJFc`Dss)MX+%(+8{22r3q<NCXS`O%OCc)VQn;w)^E8&2p6A8((eu6b%l(6$
z7u(0jMu*M%4t+7$hB<kZ09qRNRmOEOA{At3=}Qrvw>fOvf+8Xp^uuaR>Ss6!Ut__`
z?z4&&*ESv&Ngqz-tL_YQ4<Ht(49mN<X%;QI?{AJHi@tU`(`)84b%NM)#k1JYzgdFo
zgK_MG-e0gsdq1CGWW*m15C4AL-apts+24Kv_~Zyj{58|WX$<ix0`NPbb9#OGx4WZ7
z>2^tfW>do=mtH_iWYkrTl$$0>C`@~dqOXL;)8qk4@ux$<9($H&t7YWi5IR+|A$Op2
z`3aWz2)dT+rG9|H;XCW(OrvttO4<t8<x7Yff@ep`dy08y3bDeCSD=qOeJrEwA-=L2
zf>ct0^uPYdKTCCCF>*bXN+2<QHeX36>qy{2P*g@iROA0oSI6>zY5{dDkIs_K%MeP7
z7F4$$M_V9@N+#pg3z~A4sClpDDZ%uYFJ!D#@CGD`f$Q!Isu_c4+dZXas*<mDNJZGV
zs|oPvG#%#?6Tu=T0huj9v|O1*m`HKVS=?yaL7P)6s|QIcb1$xTf$le(V@E|P!L&0B
ze4VRm!||sXSNH3qiyM{bV*c~_(Zy4I7B(nVO2Pp@;)$%25x+90=dDPEMYQ(rQVt`A
z0nqCyU5AN`(uhe2NaX>OW_KUJHMV`Ey1F!%d}Bt10E+q~3`K_Em3H7^^fYU}b2BZ(
z<7*bbe4Y9+6q|pQu=pRnM&2T60hqboitj%A5SE(*NwI)IJwGb9=$4vQsm3hyGCMR_
zDVMP52yv@(R`!y7GS05P3W?7K%+q0rsGn;zzXKg#wG2K59~$ZJd$<3IY4zpLB>`IV
zUF&}!S3o<y0RYiY$jJ=vS)R^in*R>GLItRPHk(j#yGm!FBwKT_6Xi|*3AlsnFbDIn
z17&6_L@0d$lqL_d)6-l<Qfgy*km1?ne3qbsaWRjjCJ4S>^WyTkSzWmwb?~{HS+krS
zDC^U3VZ)oey&h@-{v^R|KLgo(WzNB}`3aqM<tJ`2_$B<kfKl151+Y*h-KPLrZDc7c
z|FwxagFFKFN)WR!0YquJeL+CrbbLi(VfFzDh%K+}@2VQNFhYpHbYz^#p9uk~(R?-v
z3{LTn-`_u<LHHkw)6~|?gVi)_d?|+4!)vx5$A1QL!?+|t+;%fP#k7YQz2>;RvwhHh
z^%@n7FSh^ZA0ZrIgb9Bb7EmsmwxPdanrhrwbce%oz1%+jdtJvCmNMLd?*pnHhiZDb
z#}cW0Cic0R414Km5Zzi!{TD6v*@&xJjuvw3bEEV8PKfV!5#P;^&AuWstE93l*#F~i
zVwchi9n1N|<vww2QClTg_}Ssn&fac0a$wQ-^)Yd2NaO!dOe`vZa$H<6=TZpyTDVx2
z`!8(#^{}yMfBy9N_zNqY{uCH_HbRyI@aIIy{^|TuNcq3_UT(j5akv9`=oKL6!|fM)
z$2)r=EWr`Qz8qale`4o-yVJO)UDJ(0Jj%7HqmAd-#(cZm1yqq+skU@9W65ofnKsU2
z%z%`P(;OyECg&7`n4+jk%5ar0v=vc!?Yr?^z|rG)kdRUNS;jg8Z0#-vrn{^1dzti(
zqc|N)+6x{@9@QunZ+3}#23RXVUocOxd{+%nuXQunyB)7*Y*2U3(eJ3;^YrXI)Nq}q
zkmk_<vwB2#c`$c%THuDtEXhlp+wEc?t<j{A$GScvP_viv_G_Igfv93$NCY$OxgLNy
zw{XWU+_|3rWI>&^xhcZ}mWjLjI?Aoz_d4Tn;B#f{YO5HUbA%xYWF>Z^#bx7m?6yu3
zDkLVOOd~`nm0VhicH%9nHw;AZ-W!Ne`#Y=<82i=_x>nJJ!L3=M3{qmdu%XoN<O3p&
z0A@ICC;dTNVx-b{SZwp717)r2nDfEg5zuI>BuuGmKCQDG>#3`wY*K&Iu~mn;Y&Sk*
zJHEhvXrl;c#qxF^PR(>w^!Jdpa8h=YcOkz~OKg606e&~K5;_5TPs}gelxvPk4wJ-K
z7H>x!+8w78>sLpk3NvgwHi8+y{nTnrJ?4I#cbysNpyQ$gH1S{ag2AZFuYWLU&4~)H
zsf+UNj)qG$b*kl}e-x$dIKdZotn2O=O~grN$GCW-!v9L}fPJ?y0AG$%@{IXqnvS)D
zh<%m}D0-B#MlFnM>i)S2w(J}T3ue_JvYXbIial!fNht?d%^Xq;YG)PK=WN6|EbEm9
z0--ALdNGz_8G-kEa86%^#tU#=9?3dW<ESsJ05CPYL0I%fwN8>lU6h!-wPTyll1Y%&
zo5K@TNEz&uY1&{GXin;uvK^~_q=#@@dg;Wh@l%*fXQp#Am;N@#c6NCl^Jnsx<s0EG
z%?uHn7qsMyoeswZZ6>espU!sBDprfnY!9N}%^@ZL9{#l+`!uG0)A@Wan39#6*K{oo
z2=A<C)=10j^g8ttO2kb2vn|^ks-n2<RyI1iu_L;%bCq@uV~>e{D()|fX8H-HBZZZx
zm;*VEks86^qdkg+g5^##j2Vt1oNm@jqA7+$B^^AB79jpS>5tHobUN&E#DZ~*rk0Bm
zA5G(sUmLyTqqY{Ulc^?l01f9Vo6$HuJD+eyE#*J*M=^P^<|blA)ZFXnXPr;wE@ELR
z6n}9?^`qhg8%F1vEqDBuJ8sJzi&qJ73rId_+#{p#vU$2|MDSJOYOj~f&Zi^kYHS~V
z>a6pbo#|bv?#v(<)#0Y9T0)V>A+&(O@C&CuNUg_qpajFQ%d47sA`L(B*m|TlzH=ok
zy6k$f>_*7vAr3M9v7O1rdfute$x-OD(NX)X=W15Ggg)1B79zxzJVXcEL&Vy#Sph?1
z70HXQLVvpyMk#GHn^KPHh*|`%JpuSWA=*|`vAq1l<g(_&yOpY<cnx4x_V>qVR3dXy
zBh}9v(Nf{rQi#eCU;S5yhc7C-RHU@)lL>?rP0X_i(0lk_e|`S9e*kHuIR;q+c4`?2
z?tJ-Q35TUv&d1&5PCCIf+TG9UV+B5sA3wyutKU3YvH#Mm)o&jD*XqO7wa1SheY5re
z%B`)eJb3h9(aIN^W90|PuXr3q|26GQhm&bVxf$>OLq9ixD*(pGu)<IGPk<Y4@3etQ
z9(MavpeUC#NKlxdVcge1f($@B0N81rFU?m$J!wnf9BWoqWp0p)E#Ld1pJgoxkXgSz
z-fN#6?d^$=8bd#f^fY5kZ9l;42ES+yeh6<F!D^m8-O!=%ffJpMfcuzYj4`d2qdL)+
zV}QfYo&ewUKd)=6KzBTeUOZR(@^brU_;y^kUB-8S)Sn{zhj~bBePeJYVb^AC+qP}n
zw(U%8OpGVCZQIGjwylY6V>a)*Ti@1J?XNzkufD6h|8!N~=YpGx?m1Ijm^3EVak^jK
zJv4;GA;K-;0Rw{EA@;fPB5ZWLZ$`|n<RY>-QBHOow<7hK;l3LKFym->NNKy}r?0Z4
z-pFH#Q0yVz2{Y(zVgIRCYP;Pu{jbaEi7t$~7%e&{8&%tmy+}C%%RkSbr?*d4rUvAC
z>{BFavITSJVLfB@<+nsVzYQDl?>0(>hBH#^de=UjZonyF-5^siAdY$*YCFk8s(Ws(
z9|kVHw7`?ozg;9za3ZF9JFh6cL-@G#Nb!=Fa3-D|Q1q(8!Q`^w)LQf7_jkBOMZ?B%
zAb%s^Q)KzOjGo8#<G0_@EZb)e%E%vZqQ~+0MsQO&ZQSs_(Fy<+_3jf``CaDz$CGpB
zj(V?}b}x|;1!hm?8KF;h@ol`>4YH8+%s(M1V6bViy{fRArKS{8SRqNt4LXmkhr9wn
zT|F}A#*yPFNyVg9@IW^}C~Z+(+OweKGGfgPxAc`S85?2(J-B6{?%qxVB__vki<an1
zfCR!$nt%k&W5ZPA=^2`e4~b1oGu0hRLDw8b*BFq<1Pl1b4Y9>M0meH1-au(5$Sd2`
z9U(&@EFaGl;vVI5=-4UEHb(Z&aBb+FY4TTuf%usAiz}~vZQQUMv8=3a5+mLROwOJ#
z>lrxrrW|`Yo79<-2E*iHqEiZJ0><w2RckIonyp{d`+xuy5xb8{V^>^PHw!0OuoDXv
zxzMMXu2{Rf6L30uqlmN*M@AmhQaRk@qi(z*qgn5K7gU95@aOS+3j8qIs9cOF5WE!A
zBNCElJWpKE7x}NyRplJ;a@y%l=v2wVs>GTA$roG5D<J@SDHbwTK$xB;aH4Nz+cNXO
z_d^#pFf7>wOZ;wepA~rd-SBUy;HV|UKSaxaek|XepMv!taZ#WDCJaCS-P}>%{-gZh
z{k_Zkp7Zuk&>Q{x-$#biH}m;|W$rij$?vDTBFH#`juXNi0ng9Xw}1Qsp%4Ggp%~5t
zOCIYg)n2~ds!2|q1e&68%sHBfD$W1YN-b<BV16hX5`H%SuJ0;$hx2dUe|nC3-tUk4
zojxycRt8j=c2>X2v%A0{XdWZ5yN;}xoR<jIBBqSz_QP-92v-Gu1*)VRyjEYblL(c!
z%aKefj=S%}J0Q@fQ1*|do^D__IwQpz({A&@JPPH)Lqn&b4QbC)s0~QXRVaK#1J&23
z@F;M|5RD@PgZG!ZCh&u^cSA3zMA&IHR1Ll=b9(s#BQ<Fu!TQ#3&XR&Cvcrp8{8k5x
zfN#K2AD}}!1a)@d8FHg)Hmb>M@oZcQU9iAsmT|AS{e%3IWuuWV`##)x^zsn84-OhO
zoRlsmSlpzi)i>lD(IHPI_|h?Cv08xA(}pJ{2ZL-|D$DY_&-?=~xh`ikSeXzPlq9e3
z-1Fn83e)FmyT@{~&M;f3M2Q}xFsj{Qc~g*Uo%bCXNN4pCVg!3@l42NoYjVeA>=y8J
zssMRR&!ea906dvfO1Kkmfur$3PQlghdD};5aZpvhIBS9t0N-SswDRMm_JI;f?|NHa
zqPa;aNHj{Ytyv$asJUxTwOj9J3cwilI<zP7(d+M9_c|wu!PJhfgK6H)KDtR9uPfYD
z^p1&RcMAEt&Zrg2iB@zIQk=IY&Qx+Y)qpNsW|BQTz;c{<Q9nFLU!lT%FNF9o6|`4v
zvWMsG{O9SY5$H4p^hkw|;}ORDQ>mw6W_)6#P$1xXf031kI2sa3s)ka-xdG1zr;K|H
z2tLn^lJNTYk`^igXSawNk$kj}OgE}{LVC|D6IAP<xnLhS>USA;IBv);)KhSDNX=b5
zJHOQyxfiRk<1Ga~S&cX{UEIhSkehOFv<kTrn@KWWQ7>U^JT8TwDoyZ7!va<k@?%Ey
z!JlW~WFk*3`RR7tBrfc$-FIq9zS3e7W&f1Hr~Fhgk|fErlW`>73y|V`!b9f<X-KS|
z?XK`aQqdYc2S>hf2<tZf(A5Bq4K0#gp{WLWMv_Ep5KVck51kK=em1dYC&-KxBq{2x
z`jUt0-Ghb~O6tGnm8R~`I-8y4c3@7H9mKzFag~E2W6Ty!c79*NYn%g|%K`Q%Z-I${
zMK~sQF*VLH73n%=+6^aP)u3e{6+C)vI5}Ym+Q7?M)AZkd6c*tdWo#+Y3e4iGLl)yM
z7z}OKW;__vLm$TO&_Jugevp+sJm)%)<(aXg(BL(fBc#>yE)WQ2R0K0KX7D~ceO+%r
zLV7z2EaTp?S|MuWV4yp$>TZzgIr-yMQ>xCp1vtUXc=Xdla==L?@qZ)lH$>p?S&Kj)
zZ22;Vwq5$vdc^*a5lXak66R>H!51Ygng#kFnqx)pPB@lCNSMH;ryw9Z`D8v%=+sZP
zUxmbzLw?Kq?<a;L<gldNENX*8G{MMK1Z<Fo)XzLVvK7dU*!}oIdqV;D7xu0q>oyVN
zOOhoYK*bUCg{qC9MTk8;gR3M$`BaICt>o9J8_SGz2P6F9!VfOqyuL`Q+fXzV6eVV)
zl}OK2E}rg!*G$@rsemtWh1Rn8c(RVez*3!rZ-S-=qd{H%QI>(RnFWg?#YsfysB{3K
zjPolOlht?QU%uNS9k)l$h8z^QrmY{^Bp<?HIf{+Y>6-fHa{!AXGNX(_xi|yw^o2!W
zN;l922eMKMG)AzcgR9Ql^Xtm0!V$Vrx5T3hY}kxcGA`5F>IM^aGmlb%IWar8@rmB@
zSeFU8!8F1kB+#VA-M!l{3U^qd#)!7>(`h=g`f5ZNfqR-vtn?zliAze?t)Gz|3z<!Y
z&-2hkS!g2t71uwoQ?DMm<TKaR4qYnL+Bf7vadMF*wNouLO*vg7&j*4q6}n2ZHlIwc
zD}tEn_A==~4#ikrIj3`w>l^h5v|~F+gv529kJW5er8<vRLf>+x)ge_U&!q}&RaLM~
z*$(6-9X02er0(U&R>AL58>KZLsrvCOLtm0w?xLiD&r}zqtx8G!MOVsVDhI|@4UN<z
z;OW=hwi$uNbUWY?%cBf5gDRl(h;Nnt^2`g??~TkiE3)T>0XEBu$=C9N%XBMhFga5U
zzH48V9ou~wVqnsC|7WCzZy)CAl-Jrlhmb2DF3kjUWb#X&Y&)!3!O$)1<y2r&L0vAK
zN$8?xh(@>arBpCC=I!NtYPYIsz~C+kLO;D*vDyCGAM6>BU<sT?m3&T&`lPkR>-ENg
z*R2wx3V1bBuF<4lF>)X>Fh=raLG_!8<e8WcTkqDnB!b5@wlXvB>6mfX8FDX@^6!dM
zvv!c3Ze8vTQ_75H*TNAqJK-`tskQ+Tu4XGG#mav5gkZ4JJFZ=8`w{0R<A>|#paOIy
z>YUi*7)TR@|GH(9`dGjA>~BlECIES56`G}EmAQ_|M>AEb02VeBL{vaiMX3^_tzVfp
z20>(ZaulLxbCzc3Vo1OllA(AAL?~k-r`4?EYvRS$9a$6@15gd-Fxu{bP?@C}oR7me
zufEVQHJxab+Ym5aRn>JD@>>nUI2iFYnO*|9>N9Uy+ckk!R+5%iO}J5IOrx&bL_bwd
zbU_i|-RHIjK$hSI@ne#Zr5WX9u*aMA6>8q?SFhgQiYw3xBC-E9G<Ih;h1bY+!8OaO
zHr8vO7)pDf6hpp&1Pm`e>#3ruR7-JZ6$woe<xV+<)C1R2SD2ZH9btzCtL}$y?~^&W
zm6>9B{G^!fJDtGrE8RFahX={&7jV`6QIE+ze}-{@k@wf5gABX>EGyvV{%{7QCwP=t
z+DA!<&k!V6|10ZnC93=j;*;uKP_mQg27RN{q}?bg-;*7c=k0HSM|kn*d%n*MSw`BB
zOqZZ%S@@S^3lszprWSU`n{<qk49pbxoAZ@3$$>WXP<Ba_CHav<UCu~6&3h2*E9{Q(
z1N@wp`X@Fj1-FrI{1$U0<h?8<qxzC<Gs<@q1$1SQ^@j3J{GNBl7h&#JLcdc-470e}
zlK2R6Ugz0UCUs7atPqaPVUwEEY}Kl)cE-_ozgp{tPHA?LePUX?W}Op--w{)In@nwg
zs?JfvVBeIAEwb#3Gpnv-;hKBV_4O7lnCbXvDCHSi8FDHHw0fo>lD@m0$bO(vE<9}o
zs@N_#G*D6T=Ob4eQ28)q5$;-P?$Y_>$*d$zXxsSQqX~;mzjSfVMRoL{jB>JG-;?x&
zVnDQV(6mxV+W=-mN4c8f9zY>0&^O@r78Se0B2Xo!BC_0ONO;wZh_ET?vpE_L`AnR{
zUa5#5za7SNEW)uOa&xYPtdWT;Etyix5!7X3w(OZpne?T}jvc+BLWd3IEK=3rQNJmH
z8<2FB)BAw&kb#2aW$NGG+AC^E!sj)kT1W>4bXm4WE{HWmczoJslXT209{7}8@{NAO
z3cDhxQDfWBQ;Y!uCX^#mJR9&E;=98l|5DQ^em1t%@OpXS9pv{83~aoK7U)lcZExiZ
z2x}3%esE>;W;t4V@gPUeYU_~0aB2v6+Q4~w);Xd42`rRtDK&#lON;T76=+ti;dUno
zhZVH2+;RR+1QXS;7IM{l3Q1tKMYce>+%U(5xIu-kpvD!U?Q<ODb6ogyoaA%d=yROI
zCE@Od;I~Fwc>T{`3HDGWD?r^6t7?WzBPXz$hg91wtnobBd>MZ#lQo^)Lp-~`nmbtA
z1)}K~&SDz-zb7r3Y_E+7xPra*;En^k1ZV!IW=)6uKMlfh0c(2rPs0=Jbt)3|e`~n^
z0zb>SgS`&njuTkZC4a8!sK5B1`ab}|aRY1m=nudf>~#tE-{xA{8RB6Ld&<<3DQ>&p
z_W<q~*OF<MEBI{$dx~?$=#LY`LyS*t&i_U{n09%B-&U}v+I|o>h=&^1bcY}4=O((C
zlRs-#@TYdO`#*o)=l_4u%RV9H$GoU%w{jRB_Mv6?tLwzP3y6Bx(A#SJOVW#u`BCFJ
zc%RU~ONWT>^SUNFMj-L5)EJ(`UwmnNq>f2nSL>A)!b^wATGv_bwLCms#o%lpeo1H1
zc22y=<;6lttTE6F#|k$h0oc-^>MO7%M&536RsO8@$u;*f`TK5_Gaql)s$}0+s#i8%
z>=Sz^?W5CGWZ#K1Z$r8v!0p@73p#WZb(QzxZhyQN%M9<MnuL)xZ^Pd?jkel9Gd^q8
z|Mha<!Eu5_z|ML!Q{Mt2TBRMsyMsSzb{?bBUFomr-lo_J%Fp}Gsp}M8>Le`{d2^Wv
zkPt43k&kNdFh&i3;EKCP#!)U>!sDL0WJ}Cu70IF2w4-ICxCG}tv?yz})+8lyTKJN3
zX&{ctW^G`N6*$3;C}ErWtq4I9V76W(CQB|k#-6{DgvgGvdq(t&q_Cv@7X{7A_}#T|
zmSIiAslkSdi7yKLoKU675@U8keoXZlM-j^D@Uhuh9IDaB$60<-K@B#LCC{OeUntyy
zW1_d2tVro^8juJ|;%dgt%3<0Ey(>gS#h=YkXAHwuc`G`GKty$n({1W3bBg+P`Xk3(
zeEsEiDq9`Om9$3rqx<TF&>1(kkCgJzjud!5o;5B;GG*E+w=l<=9Lldn2{oYlAd_DR
z*4f;`C(t@RR0o<%6h}$TyQ|FTwPQd4d&NQqlD_h!>_Y5XW`iRj)O5rU@ld>!`d9`G
zQ)tRFJ45VpC0>U1cAG|sOof+5GDP9{ZMv32A!Eu6J&JK9IhFz|$_ssB9;lX(<3CuQ
z4>F-MV_QyC`L5;zGP-~dwHI{+V&GD4=Ty2WZR!-pD6%Y^Eozf6*judOS$>kNh;QvE
zY<%+IOOeYG#nE*ll<|t8+rE|gY*)EqPa2u_jfiV1q#wJ{_=qv=9-oBJgxbC}LktDp
zS?-A%;VI%<w^du>BhSES$uH+;BlHzDtoa3@HJTl>bkf?sDiKiz5OpY##)g$@oB+;q
zbst)(<$LJGDudxT|LjXej!D|`GBPq234eUe)3FJ4&tG<e=$owh!=3x%)`RNF9Cg*j
zs9{XaG?szt)cMNz_D<i}+vR+T>g-YBpWZI4ZDZ_oRI+j;N`l6%Z6P81D83mDBI56d
zBRI#DIs8viv{M0f+UI|0_{+<rpsd+?NI1K{;5Ak<PXGvX_{|F1T78A6<eCOqYDB8Z
zGMkfUI2Kb%-S_Vod#w+rYCT6i$Kol2!(05CWl475=oJZCMx)Y}VSP(*2j88iH*d{j
zDC?ucEOqt5<5Vm$96YYsvvd#e181;@E+zGz)NgkJ(sM(+2TaSbcp9-*_??uDi~CA^
z>gmyaQp+pb!v++cCYebuFpc;a+}pU8Man_$B7!BST`UEOLd=TAf5{cVzceMZbIVSf
z13luSWnwH7Yh0Wvz}h~Tvw(+1v+jU}raP^xMT6(jY28-N9Up8w$nI){o5CWdanw2>
z=bn?h=M~DZ?C9j`7Bbtig>z2X94u7A+VL!u1#xrxvl9`mW1WEOh6W;28Sx|3lc%&k
z_wT9Dd1?IiA=bg%UU<?Nbz|w)UdKSFH{(ZX3*FkK=3I^VunhU2_RGz{v9#ODBd??g
zDl6cUiqlX-NWp-WNWi_3UjhZp(?F<amy!MFfCL38%h$Q%jOW)nC??9bT?|yV1nRP6
z^S3&nj}rRkc+5$gc3kP0(Hh8Ac*;<nE&&pAwkFsS8G|(q2^p*uCef7ZuQZMZPZKFM
z<vQ}xC;_mVM5J}=$D<v$xltopSLT^b(V8OF+C>8<!cq#%yDJ!u;G3`=Z;q|2?O&IH
zI3u+~yak@bzK>aRF7)L2lub~lL>a?ojvvw8M}X#th8b$NY^0_f<Yd1*J+E#CK8u0e
zF~nDJz25cqGo-+^&HhjyGaKO<JlGe8h{qES3XuuVWyk0O88!m(w{m|chakNCAckUy
zdolu#S=+Fj0q}Ows}_b30xSI`_No=*ie;t_AhvbkSoYE1=_e3o^@3tZB)_s|tm9>k
zR55J452ak9J*RiBXNJ;!?mhLi6EIIVZ#@ele{W1-J{p;?g|v1s2^=ku7H6NvoRi_R
zXdgFLccQi->g^5=rZqaN+j0hX43*X_3Zu)7@YoCLYH{gwfP)K?V<tRp{0XTh@lHy9
zWl)pE|G=GLp4Ut+h<PpS4g<P*N9hg)iZTq#cS>SMtR`4Xd&`d4u`X*DAn5Lbm;s_>
zZ1gRZ76@Yj=RC4v1;VAV-3ua3LO0A{0n*b`;))jofKA~(Dp3^7MubAl*Gij~n#6*I
z6E-8ebC)6zuSipym|I5YPxtJ}w?8X1oz-ia_p6wv*VeI_o^q1joZB_&uGXs|B1;$@
zFy+Otes1EQqA^W{@z_-YV=0R<tV>y&tCF3EL(j>bi8}}HL(#_K>6#}cUT(<YW%X+3
z*cRcqxuLIn7Y<*-*7Q?HpE*+TIhjD+cXdDo%!@KnX7J!8UGmFL$;In+{tJa0zJ~y|
z!l)IZxlM#QbC#_A$IGGaCV9a8qM|}|OB%=Hoq(_ldfeEb1J+LWsRm5sDM8<a8X=EA
z9Nn{0h+Mz1)R7Iq!L2h=3T!$h3qrYqp$8RiItdnz|EoXVyo+E_SFCSt9{S4svNgIV
zW3#seLc%@z-tjzx#>Dom;f{Q8X@=hPSx9z%hF=k6g05n^KDjpRO3PzHgVE%ezip`5
z#aTIXD2=QC{dP^o?{Y4WJy_(@0t~9&9&*f;3+vhlR>dVIi`;^AY1@1c-7a(lIXPko
ztR>?hh~tF5iUihdJCSQ~l@yW1f#;M|-A4PXFpMqXE@QxZ5-fS61XoksMoMWlnF0lJ
z>-k-TKdBIS$3q!Ce4@-r<kCmRIpd5h2-wIs=7Ef$qFxAX4m8CL?@*LGY8Z83umhP)
zIoicWc2v!j1_6g>m<VodhDwz5+LuS9j-8%|$#_}`sv)KgI#k`oR+*rkZS*;M6<00>
zl%H+f*m~*>iJS@{+(ednN4mB!`7oe?8Ci_4bW$@&1qe1-wHri^Iq+`U6VL;Pe`SO%
zF^&b10s7X=r@*xv!pW0j8aqPyH*RN{X=IM;>vdP@4ThtKP?$bb@9G|}-l@27M)?vw
znn#jzjNCQW4!f0HHnJi&0$_m+bFwn&w9E_L;><xIon4NU1O-zrB}^msRVZVgU<umu
zaDb=acmW5<cI%oSTxoLyI0eTBo2wR2Ua`$kvI)dC1)69e3>SIiB?7tAA(2uON2WB+
zgB7_-<rB8Nt>MLh_p(6_RzoLemDnHgvNycMozxYXD8WG&HBvp`(J32476oFZ>B#+}
z23t{+mi@J+R&oQ`C;l1XtOHqe%MA0pNtVs3e4@eeS=!x9rJ@4406?yvMOj-L$4Y{}
z%?P@|cfAAqHd&j5SQ-%LQ=m3Lv>zpk3|F?l%Dbjo#|i>y`fb=h*jw!HlE}F#Wv!gq
z?lnzhAk%0ZwUtxnowh+hbOgCX@cAr$O);b4joY}Wy@dU(9hh>T5U}-r%B@f`!D92}
z+Z)WHJ_s210u5!jSTP|q8$7-+280%oZZw}tZZWOhpNuPsm8(1tH{)JWU^-@177)ZC
z-H{y}#|6~?Wo^e#nmi?R)WexS-~Ho9S0Yh#IzIvUEYDG-D0(_N`flDlcQUQ9^KIoL
zaHkqFLlg~CfcWZ^iIMi$zlAd;h*j3x$`$Z0f5Y$|?9V8aM7$lyEYwCJ%zDQ{e6_JP
ze{-Ov-L3w<a<Gjf@PBXw|8CWgVpnf@*<h(QKxNXgxFFq_Sb=%3KFBlQ)}2<<_KUgO
z;K!<~8hd;p?K%u=Y=?cN|9aVxrpisWos~$K+n~B}M}qh2fo&bP1W=^dMr%cFH)W0t
zE5)s&S~wM0V3w0Y>r4?b7~g&+;K&MFFI~YfC)BJ_u3&#x>Xn&^YtgodVABk+VxDw>
z+j3jQT$iI8%P_RZn^=|7m0YhS(XWbOymRRMQthp0%aI=MEXV97Y9ufZf}$C;HKU)$
zjOVVNqIJB@#=u;<4Q1cst`u=OcY%$Kr$HVWqARtms}yxq8bio04$E#$JOn09Il@NW
z?Glb)g2NCeQmOro#$vml3`X&v*aVcmF@FD7r5Zep09@mg`zqcm-ar2$s3^-?N+<z(
z>pE!`yA0biy9~=E>T4Lq`a1||XtXturLTl)52N@*Qla|=H|(UotR#&DwQ+4&Kr8|3
z8;pi|c7lElm>mx2<?Xg@$V!opY7O6Pf{4|0@X-V=TZrTx)9OJ9ckMDNBhYo``&^tC
z)^!$cRYP7h_Zcs!pam6I1+9+1#h63b)Qr+FE_b%{|4Q1JqSeIk$u<`k=gCfW5<$b#
zf@Eo~Hv0Z<ySyS1P!2(fO|E9bht@lX6oGb-ZHp60!`?K}&Re66x;N3PhDR41*|lpE
zrW(mvm$x!CUM6ehdfD^pu*_N6l1QdjVt16lnXg}9Rb@!azS0iVxH5&q#-o>9D(-gY
z7Dq=(S!T^<nOC48+OMcDu;QP)7yEtfZ;xU6uFVp4ZZ58e0<w_5a&%yFMs&UCI%nN(
zN5>_-Fp8R9rIlG;)lWV!AwQvda_W@7px7=u1_l?=!xQ8D8K~pkr-|B?ATm2=VqC0a
zF`zN!kqzPiGrZeB9iZK0G#VpZ!22K%2BC%dM4z1Dp}eR)ix6k<D-Q^?^|#}Fb?Zt5
z!IEsB>h0^)W=O=1#F9-*w`!YXpmKP=Q8WO8CdQ@M{O|X&h%u5aoqXhhO*&tsZp-yd
zly5mih?Y`u)NM~K3}=2G&kM|j$^qf`{4wi^JftqQU`uWe!AUp;jY+Dug_m!rV$*VU
z?CD>rrdsQL^C*ec$xzGvKXmTi1P=|){drmgYEm~76jgDky+>U?3Ivbn7Q;xnjWO6;
zWdVG+#N1Z-?z$-ox1{rB32lD-1q!8vo%N*{hhiM7g*E1#-6bBWI%|E4qC$A~`U#0g
zs5)a-bl;lkD3MlSLdzV+tzGUo&3+)ymHm686FK0qmS+Jq+uR(+%~uhh=T^-dk9M0g
zqip-{(+`)94Rc#bx>{Y>qaPoFz2o++)}FL6i>h6~bS@&PKSFHN91@KiGmIY3CC&$L
zr*GnpL~<_txI*}^XGV808DhN*n+$9eg`B~GYf~w-{ySm1O$2}*eAa4M%C8d(Mhvmj
z`uw1~Oj=}}jdW;?&V9uInA3|i>YL>$U{WaYERxc6{mvPC%|W!}(2J)Fz1#;NLymdi
z{q+D0DEsX3GzgwFEesF<#Z98nKmcQZiKEZi`ef4CLAdON@~Q3Ph<9i4`I+TSe2(TJ
z>_rl;xt7|dPO8zQiFnNOL?zDFu{M^R*!-u{P7*qoR!Ui*y<aaws-ELHtmOw`ESF_`
zNGd~nqcG&T_z01%f2w?AIiW|QzwTm1Q$i)jRFiG(>@hMFMkJXqXebi&!K)ue;obd1
z_rgt6G~z9X_M^_9lza`=rUy`Jli5b9KgFN8ml%NZ2pWf%H9MqbgBU2&F+f~}N?0N|
zkCRvJvrgHuO!$a?x=F_J&9QQBzOV^f5Oi2}@c7&y9pLnP_7!OyzT)9(=k6@e`5}qM
ztF_5<N8I~3QMiP&f{a#3HsCqlUiUNVaY`89V6X+n3Q9!bNFIm4=}cWmrTdbh#JuTR
zDGk3lnnMb9KizJv5~@vA5w#$z?Q1vKwezm0h{xgyI$DPAZbHHk@XBB2F!CbaHJMn1
zhXgjIqJh@B#j`k?<hd3#$`816;10O8mZ0|!q0vLFzzU`^JJd$gZ<J|D1H-SH%MMMG
zvJ2<KEd9l&#;`-t5#wAo@ThO+Cw$-Vi-SN>^71GM^axDFbbuLNLz*(31F4o)KP<a0
z%ql+UjDD>^3T)mx6UID(smTI6>24vf^g!<xd=5BPzn+>5!Hz+r;}0{cGWN`Hbg2!Q
zMm`^VYUqmyV-tKE8*x1KVoijni~M>r0g2tJRyAZK(t{2@l_k!E2m!iDsn2SVPTX!Z
zIAOc#eh{0<b}XB~pmu$wMTb`_gUxasi>Av^$1uLJPkUUVb)`g|JeaJ%elva6W=w-)
zg&zR*jWYdBpS81PbzhPmvp$_3flAdM@?3UKuLJg#@sYrYQgq`hD0^SE`NKTh-1GIQ
z+g$q1%V8+Mye;-|lDip8B-vPKOIn-LNbU)=^}V%0;POt40i66+6|AEnLY+)Sm_*CG
zFlxkzodB6Su@Kkn)`kwo&d`d%GTX|LT>2Q0S{JHy*?PNm(637h8GyO$#=vwabu=;5
zf*U9!fuKQCU4u5pbJZcz;jDZm(QYxU1v8+zsX4a0gUygs;>Z<T1&=RdIPt)Z!6~ke
zGIc~?o8C+`CqTn;z%m=3?>dNS=L^sqj9~qB(&o~tlpi(0oa~ScTBs`k<Xq6%>Po7&
z2^2|^Ivt^AK<yIw8}h*buu@b~@+JehV`9z;6?RWTl@{-5Gvs0gcT1^V+P>u|)FdTj
zdK5)mjkcX6sy25%iwI;jH1|hKcZC-=%f{$nr^RTXZ;+0+U4o1>T;COF(4X!$pAehr
zHh0~bUX$OzrbVq8Iq8w@Aq!v)wx<j5vhj(s$y~LXLM=rzDqRW)-{l49!%oS>c!J23
z#JhKm*?t(EbqJ^3`leFoNy3Q124}EbCUT+|tk+fC4{S9y$LNHFx58_k{;Dm!)+fRZ
z8#ymq6c}!>=pYCUeEwUP-lq<Hon6!T`$In8GB(p-4}(%)#Elbo8GKudrGz{x(6lnj
zd%82sNcip`J596su_x4zzL8;z0`-^OCu%`x9E=%e$;%CHQGG^^M4JOi?Z@r;p_H<#
zMkygWEw7(t<XTMwIHctXawekjZ{$xs2>O^k+z%6aNPy5bl6!84ZY$d^_c8q>glAEA
zvZACH3?Jjx7G7dIjTj+LAf;A@!_3TnIY!N{oFX-p-ACD1Fr=+HhFn#QRgFP?1bOhx
z4=K@By;R2PgGXp_KA<GAQQYsr=Hn0&&MmHgx6ZuGEZQn`cHy{29YdDuN=p1*(C((2
zYwN?yp$y?F$%|NF%I2-!ui3}*_AlYQLjrXdaldm_6;-QiK0UEDt|D;l$7?+@zb)ZS
z4&P?z{KjnV0qf(nXRGZ~yHR!0vH-#wRoj%+8(l{9LM{h5=5L^NyXBDwv&KP{5zPZQ
zQs}FsM2X|F0T*Xkx6K|RIUpplsb&mzM`icj%Kp~8{&jEf?kEAC?lpo(dSju`YZfBR
zci7of&({@-hvX*&PEF3jBXbpG+u7#gvQjxIyd<x(PEJ-ovsYRPr>-`*=2f51sJJwo
zHJGm=_*%$`5#4ndO-{>9W@pm%U?e;0qEliPEFRzB_1t_Xf-Nw{Hp8Bc&0#qP$xX=*
zpV12|cevug!qndwmy##lNf=gC6SQ)XmeUb-q_PCA{grMAtXjow1|v79k*3uH%9ZCb
z7h(8I=RA$$dLvD(NbOc)7mT9gB2?5=k=5qHU^&RNo*PAjb(bT@_1g3lZ>gQYQCi4a
zG|+TUj1}{A*kdP#jKBeAQP;q@&X`FKjSn|YB<II0d80hu(uow{(DjoKw5>&{Yt6B3
zOdV^-6gaS5WdO{wq}uKA4RZhClIVsRLrYgfj#(Ag52z1Qnj;m?mD=%Mxy7jVIG4@q
zFWXE-E<OF31n++-ds=Ilo+gDO@FuYxuvS3y;}8Dc?y))~u_NJI;F=-#r*_%6^ynS<
z1_RuI$YgjL2&UYiDd=%^Oe-5`+~)TR(Jsp{=wSsTeFIW|iLvw;d!&3+b#^`1irkBN
zV>3AMBN*ErSCWoXenkeMzUg(A*r0i+2SzIYWVz)Y#aYTifCL4?FM?DwQ<+v*>Yk?J
z-KSH)q6rtG$+U|$@Z_JhC>~sg1Yt%{5`H|96H2sD!~}@<Zji1z%BDgRazkjws7iRv
zo;A%eHEBGwOeS?v!uw1!XuRX~1T+Qw**LfqrMWHuk-nJ!r@9ry;X44m1+n-3JFIKZ
z6Y%P2%i8&MQxU{Kj%+3!i?O$4N2N`Er_1oSP3i%ky{I`AqC0T~I@ab`vOr!}le$UM
zr2%u_sxp@PeWVc-qk!5DM=D-A`&pK+UV!H?*^>6wycz~{1Sz-sP1T+_n?-JUI$N~G
zZD=bjjCBfj%Qi<$MPom}K9}l6Zb^Hvp!2g7rc}j`8=@w&)|8kz4?4NgzY-8O>#@XV
z)3%T{Od%tuJ+bqqJriZZXDIGbLlvri2mTcLVZ)<5z}c=IgD=q*cZ}>PUUCqTEyOGW
zrW}X$9;S>Fwyu;$#>1|?qDD~%qG(~-pweO)G|bDxkALVe2&1jt>`WW>%T}yYmv&-6
z0NaU7IjjLWWsdvUlh_p(vB_9ft=I}SQSuF`J^I0p1U4`TDwnxWUqRhk^6se*X2DqG
z^nQWo?pri}sE;9b*qZ})WTv{Xv~*CWrLrjpAh?{?wG>q8+WpW;=0mVEHhe2{5IQtj
zH|X3Cl63^1-L$YwUuU%KKb5bI5!g;<3C^9mDrdzH!oU1P3?Fhwn?k;)en!;pwOxyS
zpkyt-@o#+o;BvD5aM|v%vziqsft;ElvBauARTq||d9;<0dTvN|JJlGC-8@+x;(cHx
z{={rK;cQux=Iw-ptS%RndraScd*<?%{_cIN0N9zVPt&w`@i>pkvf_lx$l%S3Z0rHQ
zgJs@Hdi9U=4j=6ROBrQRbDOvcrK^$#a-)c@WFn0w6^o?9FWim&t~n{>a=o}sk&lbk
zBF}PtQO%T-KBkKNUZ9DJiR4lgav{z7r@?V90{1!~UW2~kA*GgIC=~7Gw3RHsS{}4h
zAph2<qL0DaLTPvochsuE;vFK;=92_j8B*g)G?m<lOo_L<?=ACXOOI#4<CdclTaY+v
zY{6j6z!3YDzD2l_=Fh+OcYXNkVPUfeyS0p)bAT#x(2S^J)%lET4YG?z2ev->3v`Y`
zW`PT_p(4VuGnNh4i0_qPna_AFnuSR{PNWr;NKJ@Oj&as=(CZrQHQo$U0TtxShB+h=
z$QSnc=-BP^p?HORSzt5lEA?QK47|JLt_l1;Wu_a1Hx$@Ig2s$_2{L!_n;jd~NRAbe
zv0YEp)Ehs`z8?weuQI~s1hWDAsE@&u%PFM!uq`aeIO%kiu0hZ7TBGA#h>JqM_{I34
z7lY$*QMv8JVd>u0+ETIYXw^4EFtgr#MOxe3P9x5D=AL`iyT-fb-%*y#2g|OjZLk{p
zn{Ves@aij=u+8xDhJmhoN01Bnv0hd8&GFptoP2;Rbk&AHd(dnqG&G9g{xD5ums^jV
zF66>AE{aC{9=Oou3|i>k`rWunoXzqAdTHH8pRXgo*Gi%N5Nrss{43bDSl`~^q-L`x
zHI<|7m&de+jX}y1hAJPCxJT5=DgqR^sO_H390}KXQwFM!^IZzXlb1_E)Rb4WKN@kv
z0d>MCPjj}*dOHPvKX-Q(Q(aP-_hZ><5{`HOqIc6hLjT3}W=a>%@vk|b{8EZvD15m_
zr$HSA$o}{ySQyHx9K);@&+pe~+hIOZ$7p!!9_HH#9K+?9$kaHg-B>H(NGM(#;d(Z2
zS7Jj*Bi_AW&{UHo@{rOh$E)RtB<v0RlIM@H)*T(}LOQnNe9Ffbf>(KXm-vKjajl5o
z3N*{l&oeU@Y4Dtqtd|EL?)L?odB<nsDg#OkYhQ1e^=m;=jn*)kQw1V}DN;1rW4tw&
zY%pSl+{zUj^gTN+iB8L>s{%0d4!utGll#rH&-+%iINR|VMwQ@T?!auW^R--jqF@7=
zSFAdIo~>KiF(Q+`{$$cFgtTdS`-}=kCa=>`7Z7zGF`~5bFu06r85Ps}qgVnZtV|-_
zs}c(pdTg-QMIA2PQ#c~frS%IY+)^e=Nb$*GJ)a~&h#(d%@(^}WQae1WGqnj{a_ja(
z%$y~~uoh?{Vr?i#Ma5aUr6?i-xgZ98T?x^IGhEHgZ_7HypCElL)}WeH`b(MtR0!5y
z9(zK|`B3V?j6muZ)HzQcTIPuNYZ=W@o(QRYAF#6i{B&N=<_%_N+O!^dZ)kMfZhKxj
zAtz^ap1DOQ9r31tGS_k&C(O6A(b(DwisLe3)BL5Y4l6s@tT0DcK^(j*!8}J~G>|6e
z65Zf96PUnHt<{9+=)g#ngx}AOZuVD?{lTm7XMe<QAihNMtQbxZeybCEzx9kz{W+~`
z(n%jUm#E*<DcIYn{&6CFfO9bFtYd$_-U1$uo@0;Jfl4Z<Y?QHm-?Z`UfBZ7lkaFt%
z+cv%vX%A9OVz5x%sPLk?&l~oA+bLX<vEmhc*>*edE#0RNycrl410vSK75AG)<z%Bn
zY4_ustcNo3kCYu*Bu{-efq313XA7OTBsv$J=^TC}v_yp;byGXp4oqpC%G%Ooo^l>z
z7CL4fET&4rv<ysYanry=_B0Ih+kXeKyLAzNEeyV5jtXtx2z`PmL10qYqdcUe)N>Bi
zaQ;+lYN*gq;;Q$By0JF;XOP^Pi7@9)ZU5~&(Phx9oUcs*$cR^HaMR6CSfEUSi~H`)
z>;`h}{znDp<7J2PNL-oZ_HvuGwR>dDq}8f}{95QrD@Op$`4oJ2tJ3I+qna__#B9RS
z=H@hQCqa38KIPY<b$wRr9y3G6cf$ApEieIZOIDW5QZv5~DbUX~;ug2kfitO;8d_sj
zW&h3^u$Jr>5w}qjz~Cu|S>s4m2@>=tK4Pg@$y#GNaWgf1AA*w^%>sxVW(VxtX-y%J
zAq91$RwHa`krHtc3JezVmz>)SSzD0L*m<hH`<c0Jtp=hz8<r1;QI4v>L59=YKmzu$
zmbdn$NFBLw)q0dJj<WoeY5H5FOBE0K%DyUb;OF4U$oaqKlsPeN^}gVBsFez=pCsA~
zGZq_0qKIb{xpeey_|x-GwQK<w7t8DOZeAWpj2bX{{xqNn1Hv|qY22(FcKd_v6EdT`
zi)%+jYpAG5&WP<s*;BMT8K*^lp@m3Y#Bek{cpnj;GF%1D5&JONy-=@6KXI-q*<bxp
zJ7L(jWW!YxQPn2Dm9u_juHptpKLNjw&p67PAo@JZP~=Cu)1@)|p0^Nd$>?DZ+z(TX
zgivyErFFP;`n$b;6maZ9Q1DnuY(SQ7h#uM@<Ks3<Zc}C2p(R$LP9(+|qNLBSqZv{(
z44r|D^Ox2Wi(bTrLfcg2Ov^4qzJc~nNJc{?Y&P`EI_8VpT|axF7rGV{dF#FKwxHN9
z^R47XYl|YaeqsOWn76=*S_&%Z4#@Oi9B5X&Zv&eBvq4zU2rah^77Q9*<(ve_@}JLC
ziOX#JBRQ|qttS8r5c+|#6}mo~HwtyCZj;98zZW7Te|Le+Cfl8<C|G|DIaWm93kV^!
zI7<iKYR}|^X$Ee8C>n?o$XbhkxbBD2SH=c7_A0}fY+p|G((;7f!X%c;L=;NJ+!P9W
zVvJ~Hp?a|4fuCT7M@g4(`1OYs1+a6DHnc63U@9($^2=CbJ!L7)y9rlZxNNY?zaP<`
zWoVVrglU@0^<_xLH2@@6_Z-OQ90gX4ZsOC)bzSruFDZhpbC35!ZIZX*;h`NCUp5IB
z(Ox1?19&xtsaA&%WeTF9)|)zN^rkCf!`dqG7RdpY0X%<7&0iN1X@wXmgJ}M)uVZSj
z7Xt=dG&3%hWP52)<niR+-unbI5nHU=Y$B;OSfw|!{nK%Vp4*W+z%Vr>y}Wq_4u}nH
zV*)&1CnJI@W-BWy@Z@i|N^Y%;fJasEX-0Oi{?*oQBokqEHms42?xY3I^jw{6en8@G
zI310)BW`_zk@`oMq8^m6z~VgT+V}c9H7ZA(nJ@b!+3=U4??hQFx{2>7sciRfE`0v*
zzGrOpC%Pa7dA~eg3H&={esA}}Y??<)ShAq5U{Go0^l0>Ul~YtxG3Cn~Xjr4hK=5hN
zdMGUbJe1o})^<@fA;j_-J~WsW{v}UWAbora<BDQi)<3ssFlo_dh0tFkAQ5R)tYbRo
zn|E;5NbXQO@uYj<ro9lMx@TswU&#!F0KhO!1kTNBhwG_R_JV$f=DJ_(7z#;j7I!mi
zX+4<=M<Oms6_&9NN(I399Z>`ZO5Q)hN!QF~Yjy{#z>btYkRG@h7X~7#tfH2y=g%!j
ztQwHs-`_*aVLBKL+8o-<?t3NDuIV_`TE(*73q6(}f^8me6lwss;|oymbAg92Q>`3+
zh{(u%c_>KLd~+T&V!E6|<cti->Z%kh<GWixWFy``CHowIxyygq0jizjhoTEPh1A+8
zaUYr}aQ&<Wh3QOESml%x8}a7jK7&{X&=qNTFVy(Xw`*JjpTcOo7>1=-iO>>Q@JUf-
zbd6S{OvoOHrUul3O$K13?2Diek3)c%Hb@7&s@urKz+x;`(0zMZS}4pdOf=7Nz~AVF
z%wh0@n!Pr)RkH+_1;@eF&#ImYy)pbY`J{o_AgED-$b=)$=sa{C&Dsg<kxRfA>&WG+
z7_V)})VkvH@2#xS+#V~z$}rmlAdg^6cr8;9b^~uE=B*Q}>ld#g_#H*>wSJ!(XN3Jp
znUC4z<cjozal{`=T~{NkJsY#KxuDaAcoYUcmPISIY$(0#SYf+aNwKI;)sgbB2p_+;
z&mWij2TF%FQqOKR=TYzBFr2_V9CE>mjhgMNq^ko(f+BnNGGAs{h!fnk3gV4fS_tp@
zmj~zpjgP1AYf8knbD}l(8XLQF?cw&ZfEUl3f4&>($5@G++1R3Q)g?~b<F|k5IW0Km
z6#}td;{k3%)Jcvb@8Zg;c+$&}U~S>XRJWa}5a(E8DP(6hbWW7GifX4y@5%=tgv;e;
zY9yf&cOTgmMH;23C&mo{a6L^yX72h(<G|S~&ryRpy@a^9nr+hhPL@6=;XRlikUsBR
z8>CK4P=Wj}gM~gly7x&ew@f`f(z|DylKVxCn~)6&-u#g1ucDljGv#MdHN3<HiUwYm
zOnI%3D?rCuzEz^OPiNN4_o|eJMqij9PN?O<KMIh%n@cMa|8O~Gs(aflKSAtKeYP>I
zcw-5cKO(BIIH2R8+|C*-E06r_#BBaSt{fT`A{&776@UJ2x$vH6)iYvaHm0L8F?k}V
z7|=NkOdh(nQdRnC*OHIj2$rWFLu!^0F;c9;6$yP|?-gx7>(<kwd_KHN8QtRksm5B7
zYwvolCVlw$Cq*Gv^%~yxk$nyr-llhGURD=cy_&gfT}$5bscI*VmtWyqh!$;z3`qBB
z%#)N_UHl@cJVZe6d|ZglwXDU{Sf@V(`4*mi0INqq;YRdTZTT7S3MFBhBWAzp1GlBX
zmi+j7UYCu3ja$`-dy~60#N6QU(v2T|I%mwRK*|G~6TB9qJ3nGMrtLKJ*)YHmXD)}}
z$5Ms2M-O%?irrGUL)BD(h;f||cO>n`Z+`av@9(dtJHdnEv}1W9ZQd`lj<o1|^I;Q)
zlY?t##vUs-!L~T`S3dtwq<^*k4_3q9QF)NGhy?%sUjd!}!(M;UKY+%cAuvn7()15X
zz_;y21_I?Gz?pUDU%3CTQc<HUZ|UaZ7ky?H9F%yfC`hcd2VZEfvU?mThNg*nxEz4A
zK<pV*J;+hy9-Ujjvwy!UD!f^JL>-Uph!^cUb>t3WlPpz$aG?*L#XAdu0?DHquEZpA
z$yOgn9`Lu=GEBXE<vI?f(kKOUnpo@v+Em0H@Z5(4+Z4q-LUu6i)Ly_DER*~h4~N^v
zY@<_6R`J)yhTyI#rQ6SBzJHd7hPfQ5r<*W_*+q1ghUkpGo;<ok%T}dEc!f21`-2Hk
zA*%6Ywg~OEWz*t%vCw3V*>&$d!1Jo?W+j}jXI~AWuPS~~d4cL`gg>f3qmKf7#N1DZ
zqlZ4yh_all8br1la0SXIUrD8c@MOjABTb;pf~GU`t)9cC+4#6(x0G%+4MLg}h;O;&
z%YjcDibc_eMcJ{_ZdiINR~S6_vQL(yr`(u8=B2p(!m72vHF^xf-(S;NnQ9yjKQfOM
zfIeM5(k-|&hBfg7wcy!PfYCQ+?mG;$9uq!K<gfT4OE38^dPlWj20hx0rQcp$a~;x_
zUd#UUm@eaR9<8egjJ&-z_?7PJ-j{Lz*A%xC+@fcFCmrWLV;MGz$9Wfry~P(=C^Ggj
zG?MFf`|PuHVdHs&l9Ol@rxo3$LC`^&`Xgkr`MlT9{#canPgn$pr(EtT;>rf9O(_KI
zOwF9|At0;14{?Q!t~q<g2(oC>HK;=$NI08ZR3ihyI5acIwUCUC=T8@Zpt?#Mwnvn#
zR!sF*ZnFO`|5Qj@E=_hd{@P4$mAbPDD6G_b436atfXltMWG8A4u&`8@RDfK(kd#GY
zBupD`shA<MoE6XIL3T|DPg=tse*T?~v~0>LGg@q;Y(U>-vQCil$`u-i_flI?E;(gs
ze`1_Kyc-NprmhXbqel_Z^TxK%kENeJ0k||j?bQaMAMe-G+eRMt<8Fuvo-YNomi#|{
z-|qL@0@;5x!hy@Zr@gxeMIzod*^VMOLC*?Zi4m}gVJ_-QiW@3iy%7Cc>VUOL?a<TK
z%jbq+J*qjzDH9XV4=rcfByMQzo?GSx74Pw^b|MX;&sP2jX2y}I6B}5AU;nxvOg>(<
zu*v)JhrxNzl&AtjeNbQK!w`r`MRG#HJ?H#(2`IjV{{-HNC^kaVQg_~v`bu>`A7(F>
z%P;S9H)n}v@oj~Iv#RKbVId2S-_=Be=c)818{7k1M=rW%E9O)FLA*Pb3|D8UbXGmF
z(?D}eG>f3F<OawX(^NJoXDha+5zawlxQqa2EcXK5&u;w|qNtu|&sBFwpU@45tn=t{
z)aqE$x2}if#HNen(L3@q59|_MnOE_8KU#!?tsFDr+(m2u%Ex&Lbp-$6>K@-26KH;L
z7KD7>#*rU!_l0?ethZq&p)*F4TwvhwFH#;`gJ&mlxTEwdDt-7}bZ>(KeCen|;=j5@
zlCi6e8JJRZMKw13{umF+=+r|w-@o`3Y|6Y87T#In9&0PdK0cL1z)>tX>$6a^7RSuv
zEG|ymxChOnXwb@N+J`q{pr<{<KX{mf%p5vKDS?<uNb?<$G<5_tp_G@qXZXt!DQ>rm
zV7;J&LCZ3;G34IYb_FnK=vgIEn^MSkZJg$(l$9VD_YqoAk*TXYk7EgU$o-crE^((h
z%ZRK|z_Lmt)#B<z1Fc62lDb3nZx=^=oE=L<xc2$q?izs9D#|R{aPlHbpHs`QI5lTw
z+$t8qDWu&FKH_-KzIE^72m-sl&TMY|*-C1rp_;0YRg6xHXn)Oxl}h=-A%j}-F_S~J
zTx&NXY?eelMV5s_YL~1{z=IveO=1vmjSO3BlK&f}z}7XXA<D_Hd<m5Xm<5-dP;}z1
zJAk7?YjOP&`uY&t{H<RKtPiA4Es(tuuQK(wY@LsIg@tOB0_LaJuTEQ;Tv+jJQQT4O
zCD@y}`#=ZYe$E0Cv%HcP#(DlwJnVheALiJCNN=<$vk!<rHHmzr&atWJ<7Fdqg_c(p
zE};V6@oee-z2n&QL<nCBwo+N@%|#GgxNd>^%BeVfE86s&5WW6_hqs})a^V3^T~mF(
zsz687#i}wa-SsaEanC?t$2uE6A_sW7F32NW3qu27F&*z<b`act>Zb1LIUQD`$C#f7
z*}ZAuPRm4xl;s!}eZhSfpMK2zhs#<{5qug6xq>G<3QTd~T(Vo*KhSz{hhR<p$qEVu
z^&a9Z_>1t$;fM9Hx+B1|@hu6zC%C^f6hoCm7R(`NCB;go1TZjL|FGf#yqYJ&@9zjT
zqS)4B0nl_L79)J{8*HL*8y~ebI8V{ruuG)p*spT;cuD$=KC5nj>zvs7IthFEKiJja
z;z7VBGe)vl$J|=!j)P0H4X<J@)cEGe=Ib|MvCPZ+$nR9o#T0u)5NWzg+u*#&`U`RC
z3B@Q+;p<m*gr1IVxdrL)tJf}%Qz(wH{P}x5#r&WdkJwd8Ffgi;rP{FG4Lx3c5Oen7
zI5KW=(6)Yu2-f9dhv2i|TU}{EKlgi3Ae>L&#>}RO={&lrfw`KjW9#-g%jtfSZM@*v
z&+Qk*4sIoizqzG0^C%M5joFm4xJI+iIzKTvq?vHiy%Lo#j1`+Ok@<}>eiH1462eM-
zt;%3*av!b|L~r}IH*0eRb&AQ0f{69MOcLGWA(|$6oZ)h1_QeRaSYr*de)8rJp=B03
zfdVpB^=HqXQ<9h>EtFJI)yg35JF%7@HJ4mE>@eH)rR#F9%8}QQ5Inx(-_NbWn_*^3
z3Sh=_AfCudQ1}<7FRsFrQ&*Talsyrx>r^zNAP?eZdmJ*QDlnI_3f@ztG|w_87|aDm
zyYnSMJ91^(tpkdzG}nVFj{2q>m)`Cc#UQ<_1XI-au=zN6+oL?QmtvkFnzPdK693c~
zBUYcmE-E^#m_*_VveRv{rlPu?Y0PPfNebyk@ns;PI=w})BLwa;U&g_K!OI1tMg{|f
zzlRs5O)9P~es-!ccC|eZgzMq4L9ZS4&>?|;b(ToO-K~tEr_O$HFIVi1-~x0sT}Mji
zu)_?M9dcjk;*Gy(BmE|cDzl+k@4zh<*0Ud`NN!{f@m5J*Lpolg{(hh;`5K0998{Sw
z1l>IKUmW!4Tb!u4C)1*M0HPoG$WKZNF8BM+h&$3u`<}(AV@TMUvp_P$HP%>_lEG(-
z%G42y-lSk{ub!r*oJq6NzpvWH{$x`XhILhlgLJhUdJi6#_0UG%z)Rw(i)gamT^ZKd
zh?ytX^)c{cj+g%t-*BpPWnWg8LdVB0CJ%Y6BWF*T;Jwf>ljRQicSF`>nG2aDHE%!(
z`P@r|tuHS^yP>_D5gepZ+*EmAmY)yG=TQktKV<|EoDo&r{IHQa7Z;HGM+<#%v5$|q
zOK0<I{wE2xL7u$!%~0&>-r1&bBuM}hJexsSdK<!gB<q;s#XwBN8-sW@UhnLdA2&LI
z1p@)$e*tkoj=vl>G^-MQXv@h<Sqw=cdoH8@rEgF>d{6oVc4wCvq1u<W9NtY}%XA_D
zzZE0c)>SMi^LPwrw3lGa+R-E%v)P@%+a0w8<>edt5=T;>Wz9NHmHmcbzG}P`WBNrm
zIoF6}n&nq&#ab5=4mkkVOXq|*hOkfNVoD+G^$;f)osP4?mxVD0=l7D%^h|I)6YN7M
zX%plNX1*9Dl^#J`==q63H92x>01|0y6wwGBrgYrZ!l*Y3sy{=vEp(ve_x$~%rv7C8
zsJOm-U>qte{~Sl5So(_tqFyb={&Zc`Y_JjZRCFAf7i0^#ii5xfaVF|QKLcx49S2)W
zTY;yG(^gSv=n@p;3yRazYwLL1eq5Sm^j7Yp&~Z9KyX?GYf(XTEsx3*0icRWp?#4=q
zMhqo$yo6M8n7ro%y0KvtO^U|p*_pN?qQ2$qSzS7#S3G;cTiHvsG({?eTdgI7PSWeK
zWcB2Dw{9EV*n3+D?OxnWiAs&vdz&nwIA=mK!1d7Zj4(^lG3A!$o2RCltJm$TG0d8k
z>yg7?3eSN?OvcJpUJ5}?e%^@0IPCdOd;ehPh;~KACnZC#?DRBGB%P6#HA$s|;}?e~
z$L(V@^`qRPcOndsB>BhG`~$a`wFs8{49)4aA~RH(F1m`!HI|A2g~iP{Qma(vKnxqR
zXjIDL&_d<{BtOEiste9~+}Ach+KME7*RqX8{Jd-%7RAhj;3xxvCP!9e!qOydSeB3C
zZUR*AHgisJ;?Tyu-<R5?rDlS;pP><1b{UU*WLpoX21s6XYXF$3aV{|o4mM2C;vS8_
zu?6&s#yrw>Lqu1aLZx*@ylx7TmRa4a*Q~@))&W3s6Z67eIzg+}Hi%iE*@rK%(v=2U
zUtv0OGTbw>8Ck}X#YBCdgrIz6UW&whEG03$`Nv4of#&h4!p1JqUIGX!X5|b?WyLd&
zs;A7d-fjBD2@R;-K3WXt=kXXrSr9m?w*KAD<F#pxBNN-PMwF2X?-9`lC@~q?A&vcf
zcvcHe5Mw)+PGvx2ML#;7Rs|{5yP!76x}QxOmKV*wbIr2<20F1!#(=J`BJ})1v~bGS
ze>hjV9kF098?rkZ`*{$Tos%SFoB-dPDdS8|sYf12ns!hi2bd)r_sI5@oJ67@vP(3i
zZ4eewIbz67E5rDG-3j_k$v`l4NIn?@+mBYV&}j-qGIqyN;ReyeDi=>Xk<(<D!$uEr
z1*W$zu3+65V@_Xk>=QHARGZCG%#@XAk_<-K7@((r#Vz-V)s?R8S+hA+op34i*))y9
zbvsH-;KP#Z)MGmY9Byb+bRB3>CD_H&eM;dPosDhabl_Uz3A8LRhL-de(y$R2noI@d
zM4%J<*e8N5k)7M0%Cu<b;vrfLWi|r<bdl$zrz$Zex7`xb4?$2{S}!<uaW4Dsm^WT`
z_+qf<Fn60C^H&dstwEZWEDX^<ZAh+u3`2BB@>IH1fZ(}1VShJ+Mb%d>gn2~zX?Hf-
zb@5}vp{f+Ig_w@<q^1QKQy#=H3le()=$x^1l&A&(Z)zxa(B-R>qxR0;J|MW~H5D`6
zqvAN|JXg5?`yp$61zi_IUo+&q!qBR}8OcXWkn^HV6F4M+v|COMRP$%0u-#4z=g$UX
z1xjK039F{*`)q6a8RncpJ!_a+E@-}I8PumX;tCj1`eveOgZPNWQdN|iONn4s*bu=P
z#d)a-g-Fnf$(7NR!O0b@wo?XH#TtK^$pxdblyQ<<(F#QiG>55NtLT7<oQrC^zA6Pq
zLDWoZ<YQ2m4%JMNZY2!$4WGJI<-=ztloGMX*OP?Kv}+^yV)tSBj4Q_}uC11Xc-<iG
zJxcmyU9XwLh-ps6)&T;HG?QSl4sr(vC}fx2381!_bidLh6>DntY^9n#W07cCwgzjs
zRr!l8I>uV4PA29Tf~R4Rr`-wDx@P?piBg&{LMC0&yHFGq7NUw}BkGp=vw^Q9Y13?u
zO|fd6U@mw-n6#54R20yuMi7A*VzNX){mC3535%_?QgaOG`W&czX%$bkb(vU+C5n@r
zcXEbq@Nk$fdA_F5*Nv9tMFdy&#zcv|#4b2;1m;jPFdmENVIj(se`A+hAhLPEC*J6#
z3XyVC#rZ4}D+Km#(=%1GRnn$Uyz1xBIuCtiGu-}*Gp$-?OvX!a$%D!jTY^SRK3?Ih
zzT@$n+0dmyr64urv=`4+Ka5J_%bLit9)APZfGotlsK%b+KU;pv_gCwUP-xlEFcx5D
zwm$1DLnU$CNl^PF7|5oQ)chQzW#}dL1_mOjI4bVX?Jm?C_Qa)x{j}e&&zUUH*#*T1
z&?ah)j<fR)C8LqbJ(T=26kMj0VUp)69d|DoP0kr%sW<RrRFpf^6%}rSk-d-}<khdU
zOra~Ul+CVU?yl2aPBxf*w4=E0aR@+=lY|Od)l<+8-^S5g-6hU%*5+(*ZKZ?Mh44A=
zB88igjjh+Pr>1JiqlkDEYUpolz<xJZKXwg!{P<f%g}FWySD%W{girs7IBxis{3a)B
z57A2(sec6<tiZFUSe?c`fHa*|u1tIvI0aT^DC2IJR4mE{EV3jo@KzR9P$=Qr&|i97
z{Z%zp-=Jqh-9KvcVLj`x-zeTZVQSB$JT9zAi0AuKYog%BK6m2Nag9Yoz*F0;^4)s4
z#789oJobAnu5}Ah+;E5dRfYunr_nG$ePuibhOXO>2cxJEr^KW_EQT<760M*ub?tv%
z*H$T2a-j%3WyyqAL{pp-XF4jx2&|Y}%Eg?;(pCL#7^)%^m)@**BU+MQOAR*^JyRFQ
zB3hXpg}$g^5}o&^m$=iLi6jT*Eiw8=k9BWZx)1#j7r}iJNGdS2Xgwa$qL6n5RXw-h
z6L<z3t&S@b0NS!^CXSuVowJxBGT2vL<)l*{CuceCH179i6f|<!KPU#(2<fCz(n1SR
z(h3o!CelLHKo%<+Qbg(8!zt~^8qnv@Z~JE@1h6-0rY3)5re(maQF+68v3>M>Z{w4O
zQI`2Ys@ieo3*oVE1ma`cqP@!G0WOv<h#TgLNq@Zol!POncOVsU!ar>sZoKH?F#hNm
zXMcUlKQrS0sh!UHpAiFaM*QcMZyv7t@&CSg`1r5*f4|445dZJx>yy2o+pi7}UtkQt
zKTQz8xx)Kd(2DI5y=$H^nP>e5?1z8doa3BtTCuQ1(@i4$Ll}^W6pUzP2o-C^j`#m(
zZzH;YKQ$yvC^;E)+T5Zi38z5fPO+C@vOlp9Y-i(Mg1$hd`I$ZzZ^0S+KjZwLXW9Gw
zb0fgdI{%MXANld$AAj@L`Tt!$*N^|ctOJJ=a8Od%IO?a9Nk1Xmx4b(}F0Z0y6E%BR
zcQI#dhTdVrDIl8u6^8N7#uL`LK?!UPLsp9q;iZIMhBpH{bYm7J!(MZmC*z!hFhjv!
zW|hT|?og6Kwxdr-Hl5^YkCm~|c`_zjqJG*L6KAWu4=*`}x8(X7(4Z2;23arRINTaF
z?*07g@aTktf7R~M>_urjOfK8_yI!jsQ|`)oFph4a${(=*GtNILO1|#-Uwia$^_#-^
zfAsLL^Z$E%3im&;VE=jHf5mfpFo;KABvSAg6UWXfG@YdVuM<XCMHm#f_E1z;Kdhiw
zEl$}kkCZ?EPR5ySqBCX7KNdZ$P5HNDxW@gBY%!5EKP}k%QR^F4IK)Ebc?T=M$Yv4)
z^Ku9lcM7V^R4gL>=o}lO@JjPG)*)BfLZA%;<~ut;ti9Mf*x?+@H6<z4YjuMrFq}$c
z#5&3}i^g~H)H9}(8R@AgQQ36ZPv67sSBv!~keF0{Zbf|Vv@EpD1ky5!pctOOr0b@U
zTc`En%J|jj*gl%Xmf7fv)|LHp^@5S90{Yq0mD$Bom*>e)g#+OHBy8NRLc&-s{AnJI
zvYf79ysRmwL^m6cF{l6r=~$*7PgAjX?<HMI!6Jcj8xckrM$wuX4&3)ShM2(#@JM*j
zITN=!D}t`DNd;uVWlj8TR0cOCw$wwEz;j942;1L7*FYMj-8u*ax2OU+5YE#!g+tpU
zRv#$?_R$?ZnR<PeG3@fa=s3YO9#AZ6ik3iqQ%E78n)3E3Ok4RD*Nx2nhM2Gd^)j7g
zJR8gYoyw~i73{)IRKR@Rv~H*wSqJpbZIeBEujUkV;#17__jDR}10N`nRmeip!(u_p
z$Dyqq&{#*i)#`mQ`iEIZ5uu(TKspo`IRzWQ)Y&mU8U{J>zyJOE;O~kZlsYtgyOJ8T
zA7#RxwXJLocU>^LbmEH8Jkr6aU(*3mG|Hysw0tM&ou0?DqrE+zMkMC#9|KJT3jgoD
z6BImP6so9D01j1nJR22*9>iCjWWJ#X_7QWrw0n6T-qTYc4fJ_o2fagdia~3}WK7tO
z5FKL7l%s;H)0AVNjJN~52_ngk1XrF82Y5JoZV+Yc5B4pFgN+!*9+T`N9CUbqi>~n6
zLSdz9dd|lD_+#l>Rqcf-7H!f6UA5pFuGJG49dprP)<zX-J3k+%!}lJg;NR;mtq_hS
zP!ViPDrfzkx~a>KlA$S>L(?PR-=-$N#+v$gsVq$C>8UB_cMvrrp}_7VxuB?}o=tV=
zac;?cwQ+*gcXKNr0lz)Vl?^WlDwlj9|I<-?reY#si!@l1LCCE8WGtF$nFhAezC=GU
zHl!F@!K=vs-yWL@-Wi&zs^Y3Xd8VSRZqO<=q63tr9XC9qR~cJ%nsV1bwj4KG=Xjw6
zmJ7(522j^AbN#L6*L6J(n;OX5y>vXel1|)v$y-Bi#=-4UU~G{T_5so@spVIY6!xx~
zc{UTuNq4QY8KT<%v`3XzSi0fvn!4xknIntgS!eDmlILxP{XZ9xE`us1)!CWUCf8ji
zt*wxaQ10{=N!oN`*2Y6ksu&902JF2mG=I%SU3q)vNn3Ox+BxS`gF710xrCYq9`p_3
zCM>>K(3nDCcf85M6P_Tzfv}R?1YYuAXaa-jzyJMvPQa);0*+DEKDmJ`ZTp45_6heC
zx_JtVU?bxh(=E<as?Rgu88^?IYv5>X99%<4W}YeQ(=9iSeTVnvUO02n6wP%=0@lVv
z&XdS|hZXC0;x2|CvJ2ePKiCOo*wzme3s-D|(6PkcrN0HED0PFWnQ>{uL`m%4x*m-b
z0PfccT{G0v&Usi3Ga=<WYP_RL*)wX}5G3KSd)7u<k_P2;LR5aaw}FP!FfVHL$0i+F
zr=MP=*;GN9PTliAh<(Yg3R^^=V^>0zqiCF-rRdwQZjEe6@%<>|Ia<>rsfd?5M)gG{
z4k>w1z<`eNy=0P%2T*^)&Mb*!@<E*t6eC}K$@bInN6?5=I$2n3-KTgvliG&EpTO{j
zSSj<^rznmF)BYqK^%Gs!9B3Tko0X{5ie7C$->cghhM52RHyXjAeVn+qX)CMQ`wx_?
zMN*j-$@^fFI&5$6?jEf@-9Fx{g&g*{^ZTk#8X`9(G|5m%0=o`1-;DfbHY|59uC^uq
zrHT`$VubI8BB+&kl%7DNZD`HU6KjN~JjYrp>>Cn(6ezRVB(X)eUXvs)rG>9W1h)q|
zVT|)M{@}~xuS4!Ga%2Y#egGr8#FLSqQ#xJBI!kHu;8>lVQ#z+E#sVAXPX1p#IB_R7
z<3iI(Px!n+{XIqJOoJh4LOC2i07y93v{DoggZ3THB`lTGrQv0D2m1%qf!lxKwMMR1
z8MApxPPsk7I3grR;Z0|^TQlBt*c|mKE|V6i+?d7dc<d|fn*gXqx|fOD%9tBIm@dTe
zX{6w3fL_mHN^3;%R?|Vkamn?bSu-&E_{3U5v!1lUdgak=e8Grnt}$<f;;%Pv7Ecg!
z!0{?zJi@v-JE*XKniFRu*8oioL*EPr8Q$^vqDnajw=cc5GbY<$Xch^L8`X;^n`SBP
zOZ$5B^rk5i7z;|7Td#&vcfkIz%0bwX1QbB{%Wt1cF1pfVtqGJd(g4qszM@6v)C$^2
z)KZbSNR*;Gsh7Bs#zx)d&<ko*U#+RG$dB`DLai~CXhO&HXhP?asZ^{&Sq{$M|8j9I
zmOt`RDY;Mt)#}EBD92Kgm68J90drx<0lQLli;Vzz%y@sn+yu7)8Lfk^N69dQ#n;wK
z!zAh9ERcwfSxlpgQf=}dDTL)hrYl0Oi&nr$ivVR(BNW1rhJivQj1?p}R3{hIdYF=P
zU4B3o%|#-TnsE{qUt9W30bv}CfUv;X6N?u3PL^-o65b&}+8teCAC0mtXy|rnM7e~P
z@DO65lIp~dIiW%pcu5G^RL)6Jf&5d7!S!>Llaap2FgSPf2*U$f=ML*Okql2b2phI%
z*P|7OYFaVs#^8tD>9G-8siKUsXpoBRns~}cdz}dyUxMP}Pt;k@Qd(bAC+#Suy@1C>
zrSx^R(nQwHt4&aVHIJ6p$jU0+Tua9_YZ0%tDiYSsX2W_m8>XDgeI{&%s+m(*d<r<y
zBxWcD_I^IuJ2+|oaCrFlW3u|$-+r<GKYK?Ti=V2eu_sk>v<eAoDp*OHM8)YWC)I3u
z;4~>4kjW5otwH#^GJ6;$1DL1h>u8KBm&#-QwH|TC)O>KAWm@r3r(hSITxh23U=W<I
zODY7&Gw6UURVE^7Rc3bjnRwWLN_TD}C3|NI<%OP#)T=XA{A-^~w<!&>T|!Z1y;Ag?
z`GK}LTmu9(XLNN-QnmWJK8Lr&|Gv)*`)~1s`8*5o8U7y+A3u2H`+u!Hdi0n5_wVs3
z*ncZ;_y0HxaMgT9?GYwXUR>mMrK6HW_vGuGj$cgasuw`Jj<5~<s}c!hqxhF;Vn^+1
zZeeqnsR{mUSdXzm%nAg5?8n#|JjOrvV{RB;@RtJdqy~l5MLQXfF=-86Wjrta7D+lY
z?If3s^G+f2-ibbhkF7XVqcN=aX>I9=TK}ze&aO!FBL6htelC(RT!ZUNczs%_P%icI
zq9VxTKk?d*Zs)bz)A|yW=4GTW<bt<hN3!wCza1{=_H{jb+37OxWXM<GLI&2(vwka<
zfSo8=@{RDu5LsTnGv1<CEb=i+WT3tB=`x!=&z$XHl}y?yBIbT&b1IqoFq?ew>7ygr
z7g_>;cqPl=74w!NG{=(Vp!i7FKBED2#CQ`!j9AfdsP*d}TpOmQl!xv%sfg(;Z*9WE
zby#3(TB*tD2U>lsqU<GF%9o<`Xlbe8jqLY1_^|&an`<w2$;MhmyiN6YYQw!vFoK%I
z1GNHOS$l^+LlN9?f&1{=t%d=A?21ZOxr<5jCg&<>_ebwaQ&A{p48acSU<J{%Lw#CR
znp@bWZKG1?){8yy)w=hhcoh2Qm=mAf{mt|gb1C}n?<gE-?>sf5D;!VUCH(_~NICPc
zis3oHTy^>pZ1Bxw*h^1m&;56x|7OttopkuQ-k&q+|FwsYSAGA_2Wx-%fBr6?KMReI
zfHtFb#fxH7e0f^&txT9CiW`MVpnhFc%ndw&BmL}<#LQPoUK=N8ZE-zBQ!)NZ!IkO@
z3kz=-7k(`-(SYVoUT(kQ7A-MijT`vb2=_b8s=C#6j(2Kg`v&*qS^I1}qQAYQKf&a%
z@^_T~oANHhHy95Nm~{M74lbJP{d81c;1A5k8OP0=@NccQ`ufQe?g7nlYTPtEqHlF-
zmM{Gg$DDfcyiGPsjlz>?Ir19Rbqnp*>x&C$XxS#s+}`ox%_(7Ee~*IChnaeOytDXm
zLyUHK?}5cL@sc(A4}{;)p@<vN5`6a~yg`Sb9NkS~Cd1}-r(+ZOQ3;Kcctm%>9bF7b
z$RVmcEF(v{YpkIfy@(eT+cGd!sq0M4W;^W~X;;VsQF)A&1k1vLp-5Q-ZT8YuMZ~g0
zJv$9oM8cZUK{(>o%#MnYuIB8=iD>0^^G74>FZ`J&{?pfu|FHUC^}z%G{{Lq6ulxUZ
z`IN+e`p=gBRTa!fOlfG+zrAyG(msB*f3S1-`rt(0!|vngAwa64+rNCc2jutSNlcs`
z4$NUmUTpu*Kicr+?~CF)!}+|(;a%{z49u_TGBcLX*TMp#x=}XdWJ;RdlOhgMoGjc^
zg?nuYTBWbHuec&;>hKd<ox{d;fhCVdJZ}|0y-ub`WJADmM@;LHot^a)dx_YDaFKFo
zX5<EWmXX0xf08y;DK?S7<%@Xtd$r=~*U`Y}hI-%rY5(BCTHO!wgTr0)2C9C-t<y$j
z7Ul+=NK!Ui606F^lgZdCjE|JCxpogR)}%eorV|)SUD;i8Q~blOIzF=%f9}|fj|h)O
zI&wN_P!o9deYMS=0l0xRUTCX{7|O2QWw7mbYVJ!|OZsB3P)!%E*I0k64DafOL1&Vp
zU|m9~kzLACb-^@+P(|4(XZwVgWY)78-Jw^KiV2@>=pZEk0qFn@o;pZOQP}X~ll_-_
zZQv{pU26p<0*Bqvlu|3KG6`tK&_^8C#{81Xjbu29x)hxPXu?7Kq0K*>#eTW{God@E
z(#xnpY6Uu><}TxuWNZsg21S|t_==Y06n#oKz@9QH!8ta!hCHIU`^z*1f`cN`TVfb?
z1-k^AD*@VeIJtj6dZLD@ZNYC8iQZ-LyT`^Qogq-k?0?7(IVs9BPs<`#I0N2r1w-CK
zt}iag28mnI9o{CfY9yac**G+>qkNy*(y)u2Mfv;WQp_gxUQ@vh{Qzy!YIo=%(w({o
zR8v1#Ll2Sm<h+O2H=bmJwA-enz-Ug?o<3Ns-BGKJo0SgFsBj}%6?SI(<nZPGPWx!@
z#rDs8yAoiU7cpVCp9z|x=NO;h0_Jg<35LaNk`r_lh3!M1pKOps-K%cj_9mYfBAkKe
z(@yok{W0SvRe+R}JA&*zr<8K}G8)B`a~|wWD1dseX^*1;ZYNf6Vs%b@+RdhTAu0RU
z&z+42RJ8R3@)|^lYxY4z<N&(7dJ99CjN|Ual+Zx5xL^;fjm2|XHK~eDX)^LjHZg^u
z4QAYh_tfJUATy?_;At&Z!C3IT?e6F+s%+@EE&}UYktxoPxJCad>RRc`hMRPUQMiYZ
z?MR?LnzqB4;BT9eE>x*oi_a{3aB?dp#k`fKV*CaO>kC#bX<F-J=sq%I37N@M+)*=Z
z2=#FYE?wasbL{$%1~P$52~<iIf2)eDp$e<jn&~yC@R}XkjH_F*xttek_6u$F1Cv}$
z=_a%cfw&>B*jl*Qnw$w~=ZTbbWJAr>4ac=k^|=`;yy6;q%F|T^(j3sXAkhl$a=^Hu
zOrz+*2_Z!yso}l(5hQI&p+P7*CX*L$MmTr=f&T(SwFSh;hn2^`RV|qO2FFJ~p*4YS
zQKT+V9oIx|8dH2{4Bz06I!-8A_4crL441+VqG+cHxd2_3u0(`~eK9kY^eIe=&k!6Q
zw_hJT+ulE7uAnZ9!aV_yxbKN_+o)&^$5U)%rM!wm8)Ho@<*;)i5|mBRyqhE_DKK+*
zbA~uP`nFN<(yykxy=7kzBXLeNF6HW0*qLAu<D0zOPDjEO;U7g37T+^C;#a$mf|Ryc
z5m4vkYLsx@hD#Zr{Nt6*cu}0YJL9O(d9g2*sfCMf%r`*4l2RdtlO$S0;=_x+8~TT$
z;_cU))e)z8uN-?SHE(T9<p!~43A%d=Sl5b^yJGHktrVY@8G2ZjT`Ho!_Vs9){HyVY
zJE;_K&)J#dVK85JAu)GpZ`G{!9Amj@P;uZY;;YBq!j@&4<GqpV#|KyCSzd0tvPXs+
z<D{9Y+W>Xv)DTL9mIU=I(b|Zih>og879+|hQdy5^+(QQ|c-vCaB;1HO7Sb26DgQ}f
zbBhSK5K3hRqAj%WSx7f{0|dHouagaH#jYE9{;$uU;Zvdi**SdmkNtz^pWnv}`;P}}
z5B>Pxj~_q!<}dxv@9}v(M3c0LB3E9fa3SZTq??|m=x=xmm@1bj{gDETD9@(jF8ZgU
zfVndzFJ8Fs7V~N6Ul>Ph!jWf;GjTudVtD`c#pW0OETY(LoT6iLZKocst*opy*H%`)
zjs82%VNiP)@i32`{0o01-*@9-HoSy^wty1ZYAtT}`w`X6DLwP}0@VP82EV}u*P@r%
zztes{j-CN)(Gy4EXucNy#zT4*cN0L#aM|q-yJeLZj}muThdpxhg)NX($0wb17>_Bb
z{2*^|qzJeQ@ozQ-#ybOKoU%7Fc_~FBjMg*3<Ojf@U8JZLA-`aEmw<@ur4tJFhLr}%
zWPNe96}clK^H3QICP-k%Z3$9J{-`86?CM1rX275&wVbsR6yE~P8?YI>LkZqtMgyI8
z`*Au*#;wJ*;wYduYZcTeV0yhNM=bgZ15pQ|mvyJ;y-F*LjX|Yl*Z>axI*2F980eAQ
zEH>>B)wJdSn|<=b{&94C`0V7T?W4U2zP~y;{BeJGZ#R1SkLcuwy$BKT(f;!vPNE+U
zU+nH3)sE}Y|NXz)$58g}-Dvw@7ykc8wD<F?qrKzf#lxd$|K+O}`%oVmJlZ}u*~e&R
z=mP(G7w~u^diwe#IygLuUhKczKY?N=hYjkdSS>nyw)k@IXy*s`x&3ti#s0}ZsJ~}y
zC=)${&bFgh+eat+JFj1CA4RWTAH6y}-ivT1yZgsGFShqz?(L!z`T=ygxcB28u>8kA
z0Hstqv!{D7Ff!4l)?sG5`$u~_CpZQ9wg{7f1%fdF6L9=$Z)YFB?ESn46WBibM<arY
zJBJ6yd;jM(6oQx0?)J;==P;jIaTylvWq_sMd406^5{G&CEINMu^!Q}|1Sq=b`QhR2
zF*ba>cl6`_&ff7x^a8kcEcN<$uK_)rY-7iZ&;%?GyoRz*Umx$&LhT=%>>VAwes!{c
zcu<GQ{sb!lW85Z{53cCp0ZkPa<?!eqxa_zFwBU{Cryus<`4O%m%<AN58yDmF<Y<5A
zB(jP@e<!FGGjog%_MX4ke~!`Z5iAa|m7n&H_v)}e`^Q*dpS%5O8~S`rQ^sw9QSny`
zFkyXR^P>G{i`%<D?&GkfFzom7zQ6`8+0GBL+^sK<>Hp|!@_+58g8l<YJqED-{61#o
ze_C1f?SCFWe!TJ*{r7u(9<^3mE6tVW*~(vM?EjCSit`T?*76tWgK|86^Qip%udMjz
z|H0$O{}ny@BE8S}{Qvy?&)9$Uqm`ex(%~oeF$@2%t$F<a+Un}+U-|!jm(R@`w9olD
zMwv)X(+`{9^WX0mlMe|Qc+x}b$M=i<w9`w+o8R-_?-v)pf3e#JF671G_HO&f?W6BE
zZ~e;eJ}$#w4Mg7`A0F-fh%I9Vz{syfJw{8nzF+$5F8aMbGtWONbwB;+)2H(MKYH+Z
zZRJ5B{=;AP-@ni2=8b51nvZF-li>vli~5U;HzP}q)vZUXfBW0FO%#VUqUTwLCblTW
zf?`22)=hZv1teKFqc0=N!iG?qg~P(nz0VYCK{G5(YJ8$Vt85r^O0}TAFW36Ckw8Ns
znbzC_EvWB`wA927l2k{iqc|8aCJSz0(B>Vjemco%Rzq$q8?(`2Cqba;N%B{CilNJK
z9D{6<M7%Hnc|8~)03O8;hh}Ig^6Yei(q08kO0M07YAFKQ7{O@B0F~!Fe5ibFq1-Wv
zaY#P1|Md0A;n6X)vP43<C0|At%`KyYHs+GjMKh#yctq!s(~+1iDizZ~GlxGN>>Y`K
zO;2?mp<QGN?Vz2{7TdWi^T~ocXh(_eqR$cC5zL72F8XBQ9kdb@-$mCH-{D4;3Gkw8
z2=JgC6uaGwUX8P}aXdhb6p<cY#Y{!I05#brwK4{W#gNRyWqCJlb-TFEP!--`CG>z)
zHOFYULdD5&#frh&?bi7$THPRS0DO!I0P^IQX@Z#v0C6OUF-&3u#GC7ahN9>R8S8FE
zPvDBjxToW|n`}|LDPc33*eD*O2fsBX3bd)`MP}vWCMx2QM#AY#C!^_v(Z$|}crfZG
zIo~d~0aIoDT&SjKN%~l#Z`kw_jct!Ch@&NPZHc=RKwe9D*CnAwn#~E?ZI!k4Tn{rt
zD{k~$0+hziF1_ivq{*|3IU0<IaJkUVq6I+{3XjfdX#nYu`k3C~B8{V^vx}wDPMXbA
zxLNYemt>bw*5#4*iOKi^Msw?2k`@gwvi=2<3$)i){1h&w?l}x`i5i}_|7J5igR3Xm
z#O?r$zv6gUEd=)}Jj9?iR3KX7j!VXixA*4$(`W6S^Q8NJH|wUoId%y)11((#o&FWw
z|B^KWqy35lPtF%M46~o0l|KLqwUHC(S`(l{Amey4PR@W$+rqh{=UgkI<EVN_bD5(8
z5v}Ap?L%`EMtC}y!gl~})e{}Z90!6?VF*}T;iaHS4gL&^AtU)6mgCh<bP@NbvLq*m
zyNB!1>l};qGjb+Tk%L(;|J~vu64VT-8}uFM9ZZ^%^RMU0BpXfE*I#6q9}A!CT=q5=
z7YA3-t^eM`E3YjQ{%A8=`d)izV(>1&!rw1#P|;U@$+gxBykhj6bF6C0DWkOiu#p(1
zng(>9!o<38R=VgjLit@{s7V-A8yZ9k@nbA!SWLip*hs_VgOTB$93H+v>I(RjbewU>
z_lp>a(+(nSSR`G+D$&AO+=kJ$u~kgLgNEFTQM3flF!}3Jw7F$|pn7;|IN*oymwuxG
z;~Ii1KQ=$<ZTJ3t*pUgpQ$O&{O=P3cG!yXfVdq~bv@}T9LIbdF-Scz;O9n5SnmCpF
zY#nPu_w7-yqlVJN?+v-yZqkK}mlCcR(Dl9SGLLGncAqx!4vZ)D2!$zA;_Gv2O^@0%
zsvkLRmwu4kpG-1pEyLB6rK7J6s~B9+DZn!B51c+(S~zOa;c@iyA{lf8CAYVZdnF)*
zCn={~bywMxKnCtuWKWPrfb&B)8yu#y94*PQ%w;T_`~B|W3GV4qFPkjYH|+7k8He*W
z%!bXllV^QE&MK=>I#C=3^g$djLSdiUd;TLe2NzqN&cOG3Kkg$fh7XeqtS;Rk%YqTK
zfIGruuF;24@02){WPBcv;AnTp7y+wCjr^Tb6Fffx!kAimPZ7k=;6muBeqJ4~z1n?7
zZ%6qWG`2)*Weyr~L%8$3E8v}onISxwQ}x$JFWS%cPIi#&#5TIqG49J!GpB!>r*YcH
z77J(hGU;%3P{x16#{+?)BF*R15y|VyI==P8-u5es1cLZsd4%tlk<?Qt1j*|cdwvOp
z!#8LpiQ82@b<ff!5N1H0Eq#|K$j;`QH<!4vm#@p(8%(9i+IQ=3-+tG+SN{$gFKc>n
z7PuF|-;CuBW<s27ez*f$oo2nwA&u?%(cw=gKltN18)ui3b6E@I1(3-(Jn)Mlg$r#0
z9+aX#0UPEQx&$2U%nn8schNl>2*44u{FtkWSZhQ?z~y6GuwKB;?Cq8;9hXdcf%W52
z?;RY!J}#+@)?L&5t1i9X0UI0|pVQ0)FiD#)b!du1>wiXTSEB@)A#`->_#ZEy9u{^k
zzZ!G^O>RgXXJPnV#BqCwss`TdM4g@IN82yk2iq@;3qK&V7`lzU6OH(^!$8qPJj}U6
z39%|Nj6`{y41*#iAf=)cbDRN^B$8&iWuNF{98Ap||KFUW{+oYRe_M)L{wgoohvql`
zc>HD#LAY`Vu73-FYn>OVmz>7a{zQq{a6M=~uMhryaQM>!#{Ss`P9A499ljrCm&3YV
zUCe-o>?fS~ix^`7VPwQ)*aKGdO06ked1tUnHCV25U^vkC3ivy~rN{=St)$h6hG_?{
z<T}x%!$=%08YD@ByL_7F=aelknOtH5hzD!UPD&IcwD9;L{ZP0UiO?)c#$(le9-k%=
zN0m}D1@tYoa0cr%Tjks#quq>F9}8XBOD@{OX}?cE20xbZ2dn`3T}92rDsksdbnBmo
z(dPe)mR}zKln$5c(XR~J_&8;b8t!`(D8pTyN1Z7k8N5Sa7oCpa?-IE<psY%XFoorU
z%O^ofiSC{pmJ{KZDNS?lv094aCgHuuH{3CjRI#S}Sq{n9n~5b#i8kWlm7KsF&%tZF
zV`02`g1BnJv^Pl!EP^R&rb}87fGY>3+j5LIqq`JW{_ci;BP))%hB4*{4iG=l_V|qC
zuGBtmJ3U@RTUxm5V+<$Htm?0@XkuUg<jLOQvyH{q_<DU&Sf)3E{NF`Sgh|?>Z?s5T
zcy7!u24l|mB9lZSTrIo^Tu3(C3bfC&1R(1*-3~%8xG%qLHY~oRGex|QBjRBLO-yuy
z@jCFF%EC%s%{;>GxlAz4WUkw!2n#jNQ)q-z*cKtKW^){0)<g4=2AoBbabp^c2}_mW
ztQ|9q5RT0{I8>22N9S2SSw~E6<Nif#a1UokpvNc}3HxXnfqQw9DGErTvnFB}^fbrF
z0nTD!E#1kR<tIp?rQKxfoz&7C6e5*K-eNOn$;32-;&E&VIakw$x*QA|Z@45|BPtMB
z6<4o~&l?4LN4JH9OjRpI6iysom|mfa;aP?zy7?pq`h1;Rmd!q&Oh)U=%Y!Q>Y|#LG
z{o55YUo5<TYA*@KjbJ@fgAuE&s9;q>OfFel>yD<f(wO>H16s2wsKp#i?CvG82aFXG
z#&ZngeC#B76AS~zf*6pchnh1+Tpi5&1Z}8O)lWNPJSFOQG?Z2+N4R5l5KjuUc8d1v
z>NQg6O)+4OVE9e<c-B~@lw~=dC?(+{3<{kh>~@#o)#)<yOJ^3q59U7oP;ZE~iDkm(
z_~Vu6%o%DnNN$NDOQu8APEzazOfJR8_m^oh#-vp0ND7OBQ^iP6_~tyjq=VDzam1g<
zMj%wYnWw$PP@}xENx}<_lcs}OL)90_Qr{z+SYM|x5sTP^DWAbuPf0-0bY&w9nr$9n
zTL#!VpA7noi-(MD2rQe;?sVXR`!Nm(<>y97g!qh$V<OkhC;0D{DlTCjB6&(k$lxvs
zL?U8ZZp4x`OCv{9Og<RdFA&&}crj0wa0`~AGa?4@dp&w1hu|GItmyG4Lp8b=Oje*s
zK4kzbaE-c=%?B&61>Ia4!$>9o&YMqoA~;H5pK(t~oe9^uI!%gljWFn^5&Ymlhw4Od
zoA5(fu{`OeV`y~;Dc``=rw$U~V6Flb#^O<e@PZ)rd>jL@5|7i#)w&+AfV28=X_V@z
zOTQ1iVqcAAXccvfiw2q|WmP$y4!g|P6|1OsT;AUqUg^rt=(uxdi-$zbM99j><Vf-0
ze3Ya$qE};TPGB1FImt4LWz8$WMTqStJyh{i)w2s9`|GN&;Lgjt<8(B!6%SmEB{AV@
zyU&W{ktHhW=J?0w#qzEg+$pcON=ujtJraHrF*CQ}OOLHKY*BT20}9;D=M^g9;35Lv
z?W_;LYu_7!-(iXQ9BAm2(PWdd6+jUh0fV<UqdY3Bf_uYT<Jak(mezrd@k-|xXI0zc
z!%AA(_VfKh+d%S_l{Unxq7s;ZR57IR(oy6eM)#>NF8+Y`<tw=(U5pObUJf{)NNWD<
zGALnsSCoX;2FY1m=OpajG3C0<)a0SM@=6d6$>>8pi2@ZSWOZg&3Uy&BIlTa-aoOh4
zdcAPZXsKeF?~OBzYkL;!+hw2hY>|GZGE{aEpYCWum!>!}XEi6;B<^FlVCc{7o!&(J
zM(Iu9Y#|EtR@F$;a<7fybkG5E19v<jEvDNLS05zt&>4ZQj&Fh^fQcD3sS6%MxK~Nr
zqi@M$q*hSXl%W_1DIs7&v6yu=e!KF{R6nH~IUB;&2rc}8gbWw&BpBZcp5Eid(bZck
zE03gsq<0o-03TO3uqq7<;t###Y@8%|0xx6qvj<8VaMm&$xU-BBG*gR6&Eepzsi-T7
zw6Qi)eTGkvbi~x8q@foL9nVgqMO8;2gdF27nu8Zq6R>1oghe7KBFBtXzgFJ@q}S>=
zhs!Ln`;Cr)!+QQ>gfFnTp0e6Jq_VrH!_+liVkkB4MLHZdSCmwPm4aoAQ4M8CaGJ(g
zw4cQ96{nkx^E%Va7ipe$m}3M4NJeb-q>tFFjbfSc7%Y{iJ68&J-Lsc$kDrh}wY>7;
z%QWu-cODOuY--LlTw|M0n5rU+5E8+yV_0jXx3=CiTCEoHvu|&`+CKS#_R!KP5>ZB%
zoT5!~?=nMrc8akU@KvrB9~cPdL$)6SWDCw@jYQvRmHAPgAZdvN3mxt~OX>KdC>?on
zN;~=T)$ab0YU7onba}I~@l`9@wYbN(w|+Q$xhEQLyA{-NMy3^7E^jSzYcUp$1&U%h
z$(9oe_4Af$JoG8ILUAom=4_71$5JyC-6oP@b2hoF>`a1|C@7MKwmReN5}2(;+w9|u
zw2xx=yJr`77t0Mw=Ilq=ljNR3iQ!%2sCAE;Y~5qCl8R1!E0#G2u@mZ-TkK59jx^#1
z7hQvtvt$AwJZ~?xSHNcD_SdaN^~hy}W^T1sU-V5rKB2o;J9cL_UG4O==t_e~-AgjH
z)wKr?mp}KExXpdqA))bl4e4HxmUZ7nTTzRr(Sn!Wc<eVNgL#&)NJq;#?d!9TX1}nk
zasMh$wHfiStSu^tncP!S+S3qlm0F8?htDW9;ItD7rY)0cs~OaQFDHInhn(>2RqBf<
z_8>*p$gN?7GoIl}ebI`{psm>*WA;V58sNXD$Ga+KMNiuiZ-}HwGk>^9k}2J?w_aqq
z1XZ^0kJh5rARQc{q0TrSPOdiS*r6(!n)7XW;gRETzgRTnb=H?O2DGfGcNpZDODI22
zPbVAjh>SO*<CERJqoZgE-@YBbMOCx+%2qp|D#fq)cKB@jWcx(~KMs%9BW`F(%pv}T
z>cUt+3e%XNvM2eFPHL+XArgj(@%w6Z8s|+UpQfW|G8i?r)`5WS9Bn>0h%RN@Lcp4i
zT2$vJG+1Y;orp34vaVQ7i3U(eP!nNt$zpe4qNpCF^s3ca-YF@(>PCnHBsdAIXrm~y
zDt32k0QA!OI*bqph&mopj=^uayl>rV!9!X|uk0u<6t#<C0HwB+<&b~y>UjV8uXpzk
zPVRn$M{n=s0I<9g8;dlD9W)wYd6$w{E+Zxpt_B%k<H=z9;)iWAIZ-+?{SrfB5v8OC
zVIC{uh~BubP>NZsfF~0*V0XReMo?C)!&0&0b0hi+yd&Z&)RvO=;o2|xgPw2<M8B31
zQH5G0wc^r}_na@R&>JPRDYgZddGVnLvWhQ|yeU3KDNga}DAXNFVgiFmLr+l-Q+$fI
zPGIjfLklmz_3PN|Dpp2D)St4&kV=tNuZU(ju?v6miD?W#nJ|4?&FZ{lvME%JxVpgX
z4eu6M8D^vctqI>0?1+Ws@ajPTaDx!*ik6DwaK%T(_pZRG?0tECR}>TgM@RS*8lSCr
z2*8pp?FpPrOO8`~Yl&%sEwkt}ba>I_AUGezSgQ6M^ShyPltRrf86!@a5CLMdb4BbY
zai6VXn{=i2606;9^iE2|=+)L7e`jjb-V-`$qdAXN`xzlXrk_~Rc9IN62XG%?=eOl1
zf=4VF);J&Lb2UnAZTuxqu9vU`17#9?HM61&Z2+ML+oTe)*BwpucRV8c2V1(Ca(eH~
zgrw6pHpwR>V$xx6Fq&LZPb6Xkl3OfrmT=V1lZlAbYNV37v1Dk^%`M=j-J8tQEHBA5
zrfYds<h5T5w%YE;uLZCD8l<Yrm&$73Yrl%ppQTH|D)QQ|r4(g(xE8$fYglS9s#L5Y
zul<Vp7M8W}D(ct84&he6QMwlNIxsD!62g7y*M%|SVJPp5Ui)>B6sQ0rd|dztMJ9xY
zr(YMB0vPFXu)x=T6=8?-5{Tv31z2LjqYTXDwO{M(!hv$X*4c$$fe98<$*aJx{YpU0
zR2?RGU08x_QdI+9`!z;+<xEC}sRMyj)djpREb+xzRSkGuSl+a<4|wg@0HUj^2E6ub
zSeNXLz~Q!D`!$Vff)S8cQ@;+?(<+72rBFTfx&S`5HlkS7e(hH^dWhg?_3HwDAo*Ed
z2C?+IfFD@LP<8_C{7u$Ih-j{)62C6M6e$(bveD6Nzm6tN!xw;lU4Sjt2$T(wUl(>v
zGyx^Ijl3=brKViNK&fAcYYI(zqW~e!>%tXc=-p7S*6VQ1(q5g{g)P)n@{JH+n%4y+
zXOqvxPMy~U2sM;*XsXuh!bN7N>QGJVb>ReRiaR(_^SU@#Q~;G8L3a5nT+w;;6&<)Y
zk+3hP1n9L_=VtVJUb=ogFhC*f>HG!;D6dtY_2{?XSjJXc+8<s3$=ws}cP+0kDH44b
zXmR61h&GMAc-&J8EtFqrz11S6)~I;|FpJle?5-%&6RF$^{rI?8Y(!dj+i?ZBWi8!A
z#fp-_FN@TFSqVkR#%!EW+9quR*<=GI6qpu=B7zoJH(x5_K9U~PkgEhq<>IGOq19^P
zts{bxnUl9FTUKggP==`Dyll??zJNz5V;?ABbM~dLRsAha6NhC4`p7{3^h#SHu=TLm
zqb!Tjh_cLBsuw27*6+acDVw;Ibh9XWhG*!izgZlV*@?i2c_Tto(fbg1$=je_&}Ps=
z%OHvqmz;4td(^}fW^yIdR<m|n+>|)_6+pIHwps}NYL)1FXpu-r8JMY&QmU6V|3oCe
z081Tx7p+9=IPXw7IZktw)N)LiaIvH-)(kuqxn|%E3N{0eQL-6$JPK|*$~FU!QH&WH
zVHzxr;?3aEGcv0pVDY}q4_8>;gCyB{3y|<}le8>{uTRL8<|f*t^KbS>m`tu35seBB
z*nGR)>RD*~rPHp2q0W>mxfk$CQ)51w4qwB~c!D>hx(sfjC602hVd<2)Bvx%K^3?cX
z(T%3WQL*^Ma5y7Ja&)FedEd)3k|jY6N5FMtt232I3u6Gq%JHjK6uOb`08sRGne+GC
zN6&wRU3PY8KNq`>*GDgEx3I*Um3Q^Jznn#>oxS?p(6Kf^lqON2H&>fjr>#~?H|?*J
z=hH@>qL*pEkM09`G7$x@Hk|goO@aX6&&%Au;nAr{h{|qwcfvl!Y9DUUTlCLIq}1tC
zO5@sHv6H@w<kSp_k$mnd`vJcWKNZ+S9V;SUM($DVeR7qXuFZ<ec~<4RWL%(wQTf2M
zRL3Q{rJDIws(m!)Nc5b}2GR1jTI|w@99}$Tkh2NI-IULfLMrwq2}V%>RZa)pw9JTc
z^>aP)Ci^=~vS>UVM#DjbQPz@4x2`Qhw3l}gzDTh=*N`b>hZ$|+UY(!O+-EHuql#DL
z*Jr<8*1l945iJtvkf|qv&ndi!RG$Vn@bk_87Y&wct$X#i-`C!(H2?PQe!ceF+hurg
zYdJC?M)!Y=7KV6)Z|O6P&xg}NTizjByR~M&B;N#h_&_~GpswMYlt@wh`^0SnpWVN2
z`UU_W%5wWyv=J@cN?U4V)R|gp1<Kw9QqdGGNWJ_z@vw=$O*tcphim=jT^z}p{Uvm4
zJ59&A@p-dcrfhFM)RUuWwS57+9WK@FGfQ+EW9e52RP~Jj*pdy+D+Wr`z0}-Od1DrO
zBv)`WO3nl|0=-VGFr&so_>h{_ecifC$7l;mVOShlK2iyp;CJIAi`FOT<ls5Z=A(W(
z0rcCr+X!pa?fVrI1Oqut*Xy!<jj-2@_Ccez(SdeM5fi9ByYzA(G4kgmSF7d06+1>^
z$XNIR|F-hXI(s#HylU_B-<I#+`t3J9(qdrpjJyN4hduU{5QCW7E#<rz-BOb9=oa*X
ze^{DVhgJB#Ewg-{Oq9JjdIrFJq`r{v{BAQk!M_5kx({!urbEo$m0(hKvQMFSWbj~s
zxaF3)%egoZRYP6)*%<YAHEYOT7i2;GU6E2_B{|@iyLUCWVtS%ldenu+9SES7Y^=$a
z(}6xyW%nQMl<UpeE4O93#Wm-A)SJ=X2l9VIgZrwbIZ7yUruI6+n~o(9y#Uk4ao;GG
z3t0zI69joy{5Z5Nip9N#1AqZ#n{yZ^VWYdGfyLpDssA2rEPgAWdEEj!70%MSeCgW3
zNK&wI@JF{J9nd1t`WXMg&1gse2$bjB56_3};*Bup;M{Npx=JHpYRMA&)YQSkQ8(;?
zHA=~|5G`XLb?M~=3zTYn0L>Au?um44(Mm;E$p4tGZnBwvK2_nZ7+io6OGr^oN#@Tv
zy3mAiS!OxJQ42Ma9}XyDSk5(Ue*kEU;Rva%%S6T6(A6o$_5_XjB{VKxWB{(l54R^|
z&Ip#>X*%v-##eb=i7RQQjIVB3JSTosZbiakxAXPrHju<Q+=T@~TW6xx$nv{r38+W)
zb17N}=B!?*_j*Xd6J!AOMua>g@QWT@A-j75yI`M>z^*n|D|QjR{9Sk{Fj`fJhwjz#
z*0lu2>tjbfuQ7_Un=rHzHpT}fo7fk*b0L`#g#en@(B43Agl8A_OXAU=|5#I|A*!Tp
zde}g{DeN0=-iEFjnmr423hnRF<C%S6G^;r}xlB544|LZK&^U2M5BbHJ-8hZyr=(NE
z+Rk&1EUMz)z{x}QXF#UG=Q>`pwnoiPPo28xV-CzgAA$Y~tCGp7xFP5W1lnSnBp)rO
zg#)w-?)TxsxlHc%h%N;@LX*t6d{k4>oiCjOb(3%fCVhoVh*Fy}+A$5FxBX;-UcJa*
zHnb_MxWt=wWW48b&TiV!PCtu#XlF|#v_0fr(ocYLmSxvQMZaQ?AMKUJy`((5bw{|R
zK6yV$M$w}U=ONJh>F|AVmmI}{hL}bFn|H<{W7%u!S;8k%^`p;_?wechW!6io=|wt+
z4%PV*7DvpQ*}~Z}EbC_de$t&davN=;_`Svi#N8;hg3~}YYSS)l(q`413!ErQVem2X
zwFJIF05p0Q*j)4&%X4;^XTPnCx4Bw=U?I`GcJKIPcmJTyA={8x;W!Wj3TH9w>2b()
zNqhkXub`$_9%vDg#6FQbnH|PuQG642Ick7%rP8w|%Wslpo#UOT`cx+0WC9u#Y$;Mo
zxK54*`RhkbEyg{LMxpk7ly;e`>SL%-q}O$zCl*ao%p~LvHmSD0U~Jqz%0{)&7S}b^
zW?+IEYi|82Pd@4r-Q0fL&Gj3EN9z^-{K&hrkNX^VP*jDz>ww3!O&m#y10Jy6#$A+`
z$@nZ$n{K^o=$>TNKdMdH?m2N96!F?X=!!3ZQ$*>Qf;J_$2`!5)bG5}TBbHW$>)3J?
z9N=2jj&M^N9a!rRlkhn?nem#nD^^X~7p&EVWrAOJ>27Y7yw2*bxy!4O6)&_7{z0bp
z1m}9Fu(mp^YVlxG1&24o<r0hi^3`%1P+}0XXlg)#mBR|fg$pj5Dr#13?lqID&XOtR
z8zWwYBb@V}Z!DI`qe3!lRY?hb^iX*CW<Wu?Y>BL^s?nmvl%oRIx_R11O?-V_j{j5z
zF!zG;u;9Xmkky7X#F2SX^2DzB249*waH(;q^@(+w6S-dcSJF~Sk=KDCLa!MlqyR%I
zcYnk@EQ4%C6w5e9e=T4+P=Q55=WuYE(H>!X;X!hqUAFx75td)CkX*!ip_Fj(hGtWI
zTP;mCyYiv(d*0F6>1GB0ahm{bAzUSX2(=u;t^69@ilZl}m*~KLqSB#u`&Yl2j}}qy
zbXS-~bmxvm5EToMX7}D*&p1MPMr>+Xmrb0RF}I7Cks9K!QpBS8{FQXus1URTNHN?%
zhj!EC-$xZLZ;u2nuQHVCNu)fcx;RE7(4`p#@F5>tAZU9D23W@R1VWp^lZbT`?xXJ?
zrSt*Zki*U1(lIpocP<Jm;_>ldFh!nErl+S&<@fs%jF)V5_*g758Noq()a{Bxxdf`1
zsB!X+o9Ln9^LUJ5TaX)20mc?@vV>YCTNo0@K$KJ_fvd)`q*#fWA~^-FBTYCaG=+2~
zA4$rp(xc?udSEYcBG2GPCIBGCGu#Ozb%p<7KL_1-)XKBgn!YE*O>>2`h^COpzGz;m
zUrXeky(clVgTthyRflvYCRIBwp3+4CazKs0Z@DhgEoGb;1@>+NFNrRaOVOPr-eT4D
zm?K+ZV23kWT7?>TXKTmjNx#1bG{`8aegFJNij6F$O-uEt1ubrw0F`T7cUG75VY#Uy
zd&uVWvT28?*8H5DD01yHK^ZSl#B-s{rdra%c0bP=5iJ7%;xLPWgpd1aOmNakP+BDJ
zj}bblz)YYGgD6KPCK9s>Bpd>A>I~zo43Z)CmA9-LV;y*tt4?CAkQN$okb8R!XsqO*
zc54R6UXV|Qf@r)LFu>=P){08Z`!i8&mM=IPz4~UZ9H`nF&r(AGqHeQ>Ed+?r1$hXQ
zv&P$G6F%7$6C#;d1qz>^ViYCXKOV8;>>3!i8l^vQf*bLtt(v!<WnktqQG0gQ31KnI
z*F7bnadYtV;^@rCeo8v!!*accUt|)oUg8rI2(K?MFLOm&Ksl}dcZyH`FGZN$jmMW9
zVpi?*arE;#Y-ciLMvzk>h?yj+i8$I2p=S&uMJL69$t9ik3|ld)zY*qCk1>J4d$hgE
zPEmsSVI#u3h{CU=U8FBjijg;1=A+~Ji<l*6$K~4bBpZ>20QcdPS{o*<I=%b}&J#xC
z$tUXIX_->)i<?Bj@O|8;h_^K4rDdQXm+k1y%V$Fvb@TG_vMEi8R5wucL#WspxyLuV
z=Rgi7>fvb$%bR_mpR`&w;nM*I4cfJ}2D09_ItGMX*^pUlixP0bW=CT!l2KW4KUxGb
z1{VKrqUwL$qv8(mcoK7nz`IVI|0O&v+&vu|L=txeON7pvRX2FxgbuPKRTPvFuYHx?
z#EKy73AAWEZv93kLt4Qhf|}{DGbNgxDVl(B8EH^6Ac88XI}(c-EvmanKP7$20|J)^
z`@`ShSfAvv$F6^O@%!DD!UGhInFyB`6zdT)#of&<@++orrZ@v^IhPb8=y{lDM%)mw
zW!?UPMLXXpkV7?_v{v+YashPLuOdeS5_3FQUsvP#SdVN*8i^v9`Y^fl%0+j1x_24I
zf%k$dr>44qWo;w1jn$i5ij1n=t#PG#bhmC>gK@FA*8}1L!wNxdGC*2>d%UcuY9e;5
z-QQtR_ni9&f7=dsfYL7s@Ib<8(qvsG6kIrVBZw-YI&3klm{Nrm1+MzYSwyy)y1huN
zW*jao>D5`%A{Jc5C$!C5>KV)JPNN%ov7wZDnJ>Q`FE5{&gdsPXD3fd|O$^76N1Dx&
z$&z9Uh~Is_xTxwL;~a9zb3+~kEMg_5p_5Q{ObYQD*cL_FkZ1y0Y1>xmz5(3E;-7Yt
z^-^HKBeVlhhVQgJMT2{9vi1!?(cn)2LBTp+W@w6)!*vf6bCa}LBLN)UBJK<KFppMU
z4E`P!4-})0!bq>kTM}Bt`TN97#zUO4s&bdizqm3og$o5d)nhA3jaoAbokB5@0V|(Q
zF)dIuSY8Hfm&AEWfmB@ahS@$pK+BR%!zlLzu0B})=iB@qPIS4z+ZBo-F4o1YHTeOa
zzvK{VHHThOY#mA7fR!JUXdg)#^7>HJceBaAfv%yHpBbTYI2%i9eU=tKH)@BD&QTK1
z<MSeO=-4ODdev~8zX6F?uf6TvtK*Z_y}Dk(pslsOJt#9%KOLk*(cM}@LG98KD%nZ0
zvQ|gy`xUE#-1r;%0UONl@0xnuP|pz($=cD{$Za@QwObGBR;xz*^9sXK<;F%xL3Y^*
zSXwfDnL%CG1g63WW<E2RPcVd;-}J!Rr4qn5(4e6c;o!|bqqoC%VPLSqcy+!-m}LiL
z?~%1CDq@gja!TaUtyOUcvFHq|><qoT9=~fp88nP&n1<`s18`~iny%JB`aCj<{=k^-
z-&f<9u|+jBHuw%P0-e?SW_xh8FmyYfMU8P+kwAo_MT13$_9bP+Qp7K-U*n{%{dH2W
zZ31Ri7x#1KspWga2Zzwb@>O<t)vT@TYSf*M$CeI;>`%HJd<j`KOn{h8F<s3B*ChW7
zKIS(>lzo{A6t%O9-{83aCI(Oy7rP-NDhP?PAYY=5Wb}gB2SaXJ)PwI%Bz07B!caXu
zgp#_1&O#M=fU6ElrR_tj;4+Bkhzi%hXn!EQYZj>V<4@;5?NEFL!^29m!|NCwMt3X^
zlevrzuWfQTs|(NMP|ODBu{JE&uvStd)kx-+&yndeE`Rr$!(u7kcb(+Ww%p8a0A+^A
z(Yi-MOGY_Fgo@<n$VctN;=eOmdFQbT%jZ1QQTOEO;^&=p&tA$NrPekmb7sq!*|S3C
zDSNia?8Nn%UK7Sw!der(!ezc9SXvEz`;;6rv7YFv@7~Vu%3M(U0RPr*ue4TAZ{M!_
zhT6A^p=|Wbt)ZBihl{$4<W#-4y0X$*sYlBW^tkTLpYH}zK(zee6Bd#xl4SlGs~CvW
zqu0hB$+gzeF5xy)xu)hk-_n5ou^`~LWHPki4$gS;Wba`2@YxT0FJ5gd+R6ioxJ)Ac
zMG<vTkdw0u`X_orJO3_vBSFVk&DXVeG9gO6Krz!(;PImK6q-l>F8m=Gb#TGGv)+oL
zpIB!s&0q!$?Q+>b!QEv}@*_@{u4DbW^_9~bSshAC9PVjJx7I-EtBSyWp6CX#3sPmX
z?Cm_Gl;z1-SxRGB)z&yULpPx)`7pvz6sTNQDbZp#$E3=|i9SQBA@m%g+-7jq@V|4d
z><jdZL%lItefLzfdUcRsJ+89p*w%(ACw5$KLLbu5a|{}OktUZdPt90tAgF7^&q;>)
zOowNQqnjit_gOOGh&jsP<ZuXMA5K3s$km)o(`G9tl@hgO8bLL0!|wJO1(l9~y3e{P
zyXkr=-bG1__eM5FlKjpA!o{pkTB&wPu)&cuIorjO+x(Jj?zOu%IS4+pe`+m7!zNoh
z8b$w*bn4wc8Z*OsS$W3D;sn9MxCeAIIHmar1Dd0Gi(#Z_Wl??oh7#D7PYTMct;|#E
z!8bEY>Ak^@dBoYcM{3H>RYbJ1It?794u$&`aZC>l#mcGol#M(Z$+jr-W2}+_rFgoM
z9MKd70FUlM$9Ef+_XG~)@7Bhshzf*CYIc4|e5CBRu-58I9hXq#2iFHrFJag<V56Zi
ztV)tVCPRz{CF2Zjua@N5-vLvJ=uHhrCDF?5)NX{5VJ(N5Nu{Vf+!~RU?4HE_q`jp+
zDWX-A^Rfu&!&B5y;9mZ77vAj+Rg$j7#b*?DpD!v#KAiqs-vN;<UW6IG8yeShvRS-i
z6tYf-iyBXhZ>LFenS>C2N-^Rou_2mGaX*Wc(L7-nKY<2*gY$bf9g~?J=PBr6bUn!+
zt8L;V^3I`Dn-X|HWuVN{0TdZi2Ff||Pj*LBMGB8O@8mqS&}q=Cwy3EEAT)@32=MNj
zhmhziK~8{!wK!~me)RnZ<#S$Jj_xlvxFyG;<W?NjzW?C3pvD|w;h(i;^S5T5P=aBc
zf?CFcyu)n*FhWTKtmG-J-gIO@nrMt#n^Dasfmw;O^c(v}Mr6-X5{!qJjT_L6NT_~n
z>q-km_tH{WGq|rvVT+>b5`~3lz)9wGSDI7CDjy9MS`hA72D*|%lI(9SLlnhITNXLA
zwhqj&O3Vc#<`<N$oXM-uq83_M$4R_kJk!YEKy9C*pEdC;o>Ok}X!MbRb-=rYqXbF1
z${Ht7uXA=mu`xrsl^JVjM;MV^Y(-76z&aD-%Nqh`4yhPv7#h9mCu{^(`*$+V>QRkL
zG%=Su{L;brYP@qzIL&F+t4ncB?&I)lcVFCt8*7FBd!W9+f2;aCi-l~nt@j)Z2kp|e
zuZFD(QEZob+uZu~*87i|JNq63wB_bFza8Rnes5`bZr$V}TaM)yr<@;gL=!1--vl(e
zNvhA&ECa@9?cTiyYju@Zo~$~@NuRQCMVFKrkSrC(Dbc>2Y%<9Px|s)Su%#1DGnYYc
z57wGwKA_g04ZaoKSy)S%{+(#$!!!9bSS!mf)abM{sMrF}GSC9Quv(BNoPaaaexG9C
zp>Z89l5e_C?>4Q18~U}p`+rfsyz*h?-tsb;ejztBLeExAB1e?o3ef5ZOo_=ohx^v2
zT)s7G1wFG?AG<!C9)gj8mMZhDiJ7r(4Ne;<@CRjO=J!WuV*Tv0Et5lUl*yP!(ukVh
z){WWT8HKX~!uwlFF%9g(ICq*kPtVRv+F5<vh^Q@Y26NG5(2k^^_8Ti~EEK8TUHNbq
zk+K?W-F>V(_oaoFr3+&tJGZgp52+DN!Ixd5n-Y;+i2!e81zqB-33enjyx$sc{<-|_
z{;h_X1S!fW!Av_G?|=zp?H!rJzvs?i+JkufJ|V!oV_5^<Z8n?H-G*1Hp$%6Y?-v}X
zXXkR4vGe9#78sqGnz*21H^%W^x==(cPRYLr@tgJ%v+-M=po`hv=<bHy5o{oN81X|2
zVn&8)CZoB|9YnWIL)@x3zZx^FDS9`PGaiL>Kpl7svk)d%>@T2`P}j(gDH#u7b`y+7
z1`JNKshiBD1)wmKvlv6AdYv=&($S#)1@l?kz`surxBg1&@R1(e-;5skW_7p%vRKWn
zH@E)vPOH~tX`0Quwiugh*$Zzr_paIz7Y1dcwWQVc<0R`(v;jbR)CdiK*xP>f1%NX0
zM<GC2)CUyC!#OR?h@KxE{&e!gA3G)!pV^FS=kVZU@8AST`maAWG~m2BbC9FyUAAnz
zg$&33i@mQqumFZ}i<Y365)XaL<tIHgk^h{e&<$kKMnH=6rh^d;RySj-G}y+P4=6et
z)Q*pKU@%Y0x>njM!DUaN_*UV-w(aBC?Pqy{&4zqpD0kp8r9C8bYipI28xKi+x)Vv6
zhzV)klz@oZ5^3&|ZSfPfnS{$b0mS8#!8M|m#fypj`?H+#(po{Z$lw+;%b<L=nGA`R
z<3%Lo8B@3&5gX$os~C}h`_Qy{=hbVa0jNuJh(n*HAJFP38E>no!L@orq9JhHGUD!?
zjEA^?oXD?7f&m#E$~l26e~)hT7YT1*FHO)z$t<bJ&{4)lWGTUdw|um$R7n#*H@RSp
z*>sx1X;?7hFdA6Cu)>bk!=WR{x{!g+kPc|wHj7#i<+Jn5Q8hbn9E(LmN|eV&!{$}E
zfS>4EvnPzMvYo5%)CgVEXXM4da|W}{!_{4iw7Q*}v~+5aI!L$2@`!it^JGGfrL|k+
zhh8UNUH4&3!6kw9@4}X$8?Qyb%17}}W{56{fjQSqqoQJeZ|n4(0*>-s6>}ze9|?ZT
z28lBh-g<ACF80pU3N~iiY+nMY;=G6Jf8`xHL6Y-||87-N2A&dK$LO{h1U)FHL7xmZ
zT;eIkr=qp)dZDV6R`2$=d35`+{I9+T0#+Hdryr8)RWj}-$a|e?yN0q7)_Rwf)%|o!
zTj`e7#l>)JCK+6n#eni&sM$viIcPLP6v&33zEP^+f*m89W$bcJuE!WvObIj*D~*#;
zLIkLl2b0CQ&<0bMtVGC34u39Mu89t{i2-RCzmggaJ@Js&W{EnqVZsRXuUe9Tn-mhL
z(;@|&3b!;-@k(M8h$8MAM=`YU%QPM%HISWB%hREn1LkK1W(Zon^&Sao7{e{}*NG))
z8$4Ww-&35*C{9INB^Q_kVM2K=!4~Tjv_yLY(a(q@Z{rvAEP`gJIUFg^uSE!UM~`Rc
zxh3bS;iwukByt!X8E*g*iS|A)k{jXaf<h!vxk-04B{YQ<2Ly$PrGc38BIR7sD2VO>
zYkEFKmsZ;k9A)Xba(Ys%`vrPrJ+Wwhk%led=r-}SqT&@rr%59iVLe!jU)l8xxgoJ#
zD7Z3D8g&3Hw-Gf9Z6vzbi%J(tNxTPM6RQbCsqh-n)_p4ngI+RRL8!D*Hpa-FpmRwg
zp@Ec%&L$qSAPGR^ZVpfjBP5E168$QuXqgMuoG*2&Dy!^*3=>a`{JyPzw<lSf_7P)-
z=$FI5tHlDY4a8@(?X`9P1qVFL(tu=+qqae4zN_n#5s|;EcI!)bI4Hg5{D`F8c@7lq
zmM+I6EaU8G=Xq3HqVTWzdh`PvVahyQ@ExVysL^5j73f>Ohyph)eso|Bx{}nj%s+nn
zEnG(-U97YAP9k#f_mW<CD9g1s|6G4}zrJ33+rxj~{4>I+&d^)ry=mRA*T2(Vc)`z`
zTW!DvtMGq$w;Y#Tz$qk#W!WRX#$$kAbj%!DM0A<{q(P(Dgxg5QZ861>Uwt-UR`2Ap
zur4%yl{nQBr&^+`!K_r?3$p&l<$(Vm!2gfn|HttEH<7WJ^uylZk(59Q)^*lU+?Vn?
zvV<<lc-a~ri`Y!U4!X!1&?JH*L#?u%xJhZD&&hEt9!g3e)v4HwXm|4-%MA$^t2nUs
zDe&)!+R|x%so^d7+c1i7jGIat8!iQQ2pcS-6-zd+T_Yd+)K<8gt~Kanu0hXgZ@5$h
zk?L`~xP^|wrW_9&^8A?Ib|o9I<!Bka<XjcD<{d!~!3+P_DtJqAR`3)s7lvh(uCELU
z-}V_?825r+l=-#UFdO?~{^8p9ztV_4I<ip~(@y9zBo>9NH+$1@@)UjHDZ~w#*%QWY
zI771do9y%yje#ic7XrZXw4-XRzGEK_`1;_TN!Fmprd0OKu|2&a8cR_J_V{e>hQ^L=
z`AYKdltjcS%`(fgVO2|py?H7bUI_C$Boek^%;|K|QoylX14>frT0Jq52K}JMz+M<N
zgoZr{qd~B=K2i(*)U2Wnwcxr+I8gu(pqL`Sp#u%{;R;~$AM36j$OG`C_e_ql0~kD_
zISlUcIx$W&MSJx5T5wjwT2K?bQ+>$!S^qZIvbV<j!>*{pN;Ns`e{8M<VrnqnKADY7
z2^_?L1lh9n#hcRA8#7wysiBQ%8f5pxgmZ)J`^Hm2ki_z-8t<T`z1CT)VOm^T`S9(^
z<L<);Jq$Rre41s;op{{pcH!sh1GscC8zjDxat~LQ-VwU8HqzE-pZT~)A8FS*+&*-!
zir<_o7g1%Me~~n7lfF_iKt%SxF3F1}9q+O`KxYd(Xojkc(RFqxeh^K!*;lcIn#j4L
z?5zo_7YJ;vKNyt=$KI4B-CX%#O=ecbY-HC{Q(Y1*6+sM9%7;(?d-wIrR~P~aC-d79
z$(AI81wLAjZrxD#5GvQ9$tlNq(Gf#!a$K9(7&w8)%~kz4CWpi~=+$NZC)A|`%rYb`
zWd1Ud5wK$SJR2EGWAGdM!mhu~H35pA55L)Q*Iy_zD7u)Pv!aSb(G#@-TkB8EytkBK
zE8yrFc?+b{s%Wlvu>8;HKILqQo2NKD-_6U*Y{=tlHc4&X6gjxke8Y;MzB^*{T147E
zBp>#u2D|*3_wPN79>(Rgsen}<zGIOejqR9XE+lNZsRn{rA9HVzABBZI?1m6JZoRi$
za~t+r32m+bTHkr2X?|W4;B0V1POws?l@Q>fcfz1cEiuJ8AvGz53r<bS7SwTJ*jlmr
zG+<zb9ByLb5NJVy*r0VxqNH7Mj;4F8i}8a2=k+KPVGx3BzIc;Ukf6ff<QlBeGeC~J
zd)vED_x7GG)zRoYVKYCH`XLzzm8~GiJQU^?6s?FoJ55ulKWas!^fxJk?0B*yHULVW
zOwot|T$zg!X$j4e%wTbn6SaCR-%P-m=;6rPFd`M&xgD@fA{)OKI%FZQT^?bmRtihU
z5)uHy7KVL<abaH6oHJM<mKt@%^SLI`p|NH<Bu*XEZQyv-RYKukf7Ljh1H3XKb4gO9
z`JRM_uaOlOBMTRUwLTePX>ltt(QiAol@A6byzMNf7LP;+fal$CPqY&u7-=Rh^`^P{
zP8+3#a`BDO_>a1`Pm;?kxEoc7)jP6+qPnV{$_T37(vP~4nwphIj3hE*f<^Gk$bw}k
z@|@5fJ~s?k%~3&&x}sx%TW{&R@0L{LJi~V_vJ4a<htj8NKE1=~0twKC3;5Mwm17){
zqC44hFRqhlDDb9JcMJj9D88v|?`Lv(SdbVTbLhk=-Sw?2>dZcu-_t$&FC<)nM_4gt
z+>GAdW2v3))FL00fRP;J^=@wi)k<y`S#&v0Cr%m^Bx<c7rdpw^o1Ni2i9IRKyuxLY
z0^ShObh1Yj(-wEIRQJ{4O2WzSg@RIt&<`*dIqQN=+rm=y?gtp7?CB3=jahR=FsfW_
z=}9lWfXfaDgUz=~{p1Xgz}uy*+xe5uc*}M~e6kD$w?es9)cH3jxiV{tg%a{fqQl>O
zC3apz+#kryt8@AZEcWju1Nh&>&MUyWzbOO-p~sp7wzC-f`5E{UM%^ugD8qZi2k^@?
z@*#XEbOEi(RzWWvLK@GqY+{gxqK5rJs~k0U@KKL02v<~TQ=E$G2E|LMfWPd!^2w9C
zdxy{NZY)08J={6@$E&>vC%d)yME!vp@Mn@vfYN$J1}<_pK3V36i%-aGoh*1Zm(b*7
zxtr%pTZ^5n$MVfnpx~RQ@gVJAt;0DT=FL1Ar>A)Dp0An`sKH&2R$Gq}G7K2R<Fj<w
zWDD-~=;7!CR%kI=E!JA2YFGeq3cl`U{cOA*-Hho&?}pi^>=lrKc#BP9NffAxbm>Dy
zSe%K;(Cq>%^x*;+9(^pYr{f&ok1|ry+3(lSvkTb;6G^nG+DqsoQ@KcVdscU+lrARJ
zgVdP22lPO5TmSak6}m&j%XA%$z^Lq#W!h)lZw@+bZTP?9i<qCnzH8kM8$`7y+1VK;
z>&yo=(NbQ-z;t1pYC58Hxx*X0g_urnk&aNkOIlpEE_Kj`w`Ho+5#e$$^Syq8p1w|5
z^H`HOszp9pI3AAW!_QktgB+(FOloNe5G--$4i;?D9Z&bwCQwfB#EO`L?`fr4%IA5L
z>iQ3%BH5HJp;Hg}^zcu8u#=YL%G_mVLW4o%?4HIjb@#x-Ceb#)E-lN^#bda&2!}j?
z4;VFt@xd}zgmwrMcnz@3&Cs}>(~dkqUhK~D9k`k|me0KBPnPch=U;fdwS4DHJyz~I
z6Y>nO#Hxzh?ZN7>j7a1H!XKkq0h_rDugHq=@*D`)d=z(4N`R*P!2e)0<|sNuGU77L
zF_ONt-CS*nSG{T9=xK%yB`yM^+S~kI{q3<IxkH&=tQO5Nr9{&Nz^6R##8ENp&y<;n
zKXNu8N4^5{HZ^R~Y^_cSJSH*Pge=~)r8{h@8XK2Fc$fAPwjCjZbj?-4T0G^PVrZ-5
zxFEBff}?4xjJdShrd472<m6xCG9zUs4M5w+T<v8%I>{90Nw%S6Kr2ErX^-Z>;u~e1
zL{y_aF`ZV8ax>|O^Qgc@DUKSM!~yObSz->9y8BZvF)IRd(f=-r##s5s<s^hu+fZ*U
z-h>j{VxDX$PJ+Af6f<b!m^n8nG;qrreXjdtxj%BjMEfYw5I<dgXIyA;5v=vKSC<O|
z=S{#Vg3X!bAH1{mnf&bGJJuz*!+7+LGn(pP=6X;ygu6~+<$0m?#)0?PI!Z4WH}%+W
z${uoAYiohl@O%Qxa*~Z+0FLZqbmaqTMGL!#4KXCCyZ){L7R#aDyc6E3Ku)vcgkArm
zOIfo72t^wCN3SRJqDbEneXL`nxZ)U=e>n%kAG)1dNPEU!f0)G1kfBszfE&&{5}ZXs
zTur^?&DuMQ3sn43VsTHFDXJy(AtuAzshSl*14u8Z)J@_7KcZ#h8W}pmFE;EEx82q~
zQ61QRyOA0=i~PxsE|nCHZjrTjEd3{4g8{<;A5bkHLfNe1HjU(!5$N@mW(tdZmTc%c
znzxY9$deh_;$d4Qh*B{JtJPHSV)Dc@Yns=&$?u)go6aRBK3oRqgUlcSUHIS^T6pVp
zrwq=2KsW!@bqpOc9V9v_rWmox#Yb}SWJty!6lH>MIBLMQ0?}6o`4VW6gQuF)86L|{
ztvycn$g)Sb^;)nA0I%yp>!`W{6^wksu*SCAxQQpN8Y&4ZZO3&uMZSVAH<^1$%xSam
zYsH19j5Ybhy}c0en<=qKnOaFW^M)vKSYD;9iLuz#2;&W5u9x_f(z<ksJ9xFK_iB-i
zxikSpmT~~Iuht}K$E!6URi@NP)<rH0Zt`(IrKmc392TH(>=2>>dKpj)n4W^uJYh0t
zNhf<j7Z@6hO($@27?LnY&*VybKLB*l0pbNGnR9YRM@6!PsC?qMg+ht0d>ULSPlPH^
zp`J?0ti3Zx9L@EUU#x(>938hGZJCkU-Uim_Z}mO>hJeWf3rxJD>5_I!+R#+%BZ!X5
zP8XHuj?_b!o|ZnFV?Bh`FMBZI;&Io)I-sW0swFL+P_r%%*CSRgu}=WC24lZO2O&UJ
zX`c+^ZN>=WiLiyDB(nE8Cyb3BU!qIA8KJrW`aNf_<U0<{ECS2r(XEeM*^J?DxoBRB
z1f}yT0_sNx1Xm11(jeRR43v?Bv17o|Se|lU&Wr(}S1BdLc%KFWW3aeIjLEOcu)L7m
zGxYKn(smc;^hBIHr1`Bv66N4JNO4~fTGk1r-ziE-KNg3s!JuMHaw62bVt>A9*#@oq
ztJXODOwMKE+>aKduy7PN-cI|uo#*M<(1{*5$@sD+otD{?h8|DDIc^vgYUpsD8pqS+
zpm<+uuR+I8dg6Nqvo~ZH>?28@4=Cxdo1=SB?isr+g{!2sRpt~71iutt6zASVei|u7
z74OPwU~S$80%5Z(zq(aMkfxc}!<ZHsMG3m=+^w`$QOWO4RV96w*BjY@lRCB76_sBr
zD__#fZ5_qCR^PB|l`W3VGQ0kUx}~M14R4CYO8NVAWE_{5n$4!=k?iOj{Gv-*k;WGm
zUC<heH}Js|8&?y;vTh+B=C8NNV@9>62th?#;AGksL3#J?hW}RVf(jO9?MXK6o+rJw
z9PK9aU?(~W=NVeZq{E^ybtE^Bts}%d&o1B26X7(|(~)eZ(bFrlD?C)E!k?t%MVuDR
zo`{KBb+4E1n)$64IkuQv{MDcE&xiceQzzN94m5v1;O`k5!w~53eyPJ}tQ9(j=&+$f
zn|>pgraUA0h4PJjJ9#^~{cTRF=L*wB6zUS^%G?x;W7YRktSr4&QCf7^vPd<<;_;GJ
z)Wqa5Lnn%R!s=ubAO}EUG)h<+=n0ps2!}dSq;lU60)*=@2g_QAi}+i-<#>@XBG=vM
zZuB9leY+AhBfBK*x=x5IJ7NUoT*RguP8CQ!auvtw@nhG&_7vlJ70;$4_mB~4ICzqe
zDBdI5BWT^#*6n=#cJIkDzT27s4>ESz1QepMA;)RGj*9(2B<;RCNI?<y7;i?qNi!LY
z&STWu(Uwhz9M)5O&<Nw8BF^l|jHy|gJG8ZsnMJMAsg*3u*I1UMdhQszV{BNOPnqwR
z9<|M+`Paa$(~ZJwa}Ow9E-KuKXv+p)D_)yqRf6dZxq<HOUFGnp=?Qu&mb;2na7qd}
zV3$);8Fj=QK353Qq{!QnD9B@P^-7D4phw;p3)pwEW6okxsBu?tKe{v9)G9^9)V3^u
zMpZ-tAq~Y$w_#RI?`NU#TA}b--QO7NN{l=j&c;dZMP!>y-q;Kg1IRmQ@&nCg+`!-l
z^sN#OY}f!AD(L~1sZ=D=?%uWDhUgZ{__AOWVs>qK1$V&dgtYC}mg%itEZZ){Yj|50
z-mXI7H4~@4Xq%$gsyQ}6iWW8^P{KQ;<)s3f5VoZ8&F7@=r6=dBgvaU6+u@VZ7~}ly
zVA$f#w@XE%g8JJfw58JsUt<0%`lm*$!m`Z)+|KPt?-p_l*oUgrF!exjAD3#usVeIl
z@2!?RU$dTDwte>fQMOh`hp$ie5B7kQ4}Fm214^5sVwmMo3&V`j?a&I@%Tuu?sz}*7
ze34~XoKws+kC4evap;Jbg2JOOCpt2MqmW1lh{;FJwNVpB&X&R5j~<baP|aiV?7XnX
z(Z;dNP+_8U@0*@L%Cldy+0G4(bg{wVYGku3Hd1p4+~HcN+?rD^c#YhQ_DBUC5zRxK
z9IDha+X<-O=a||=5heM$RXM`A?`${KY*I}lkFm-qTP-PLaibh%pO}PU7OsqTWcZQF
z!;H<rb)<B~>Z>Z-{XB~jn$^$*sAiguwGxFO>#DNh?=04R!+EX64$e)i^*O}G2-*+c
zxKiJyG2fz56W~>f)I-E5ycaSvbQhCMgSf3WH4stgVgQx<1PEv-SxTJZ=euZ0Hf^c0
z+&VUk<2CV+Wh2Rg3iidy#Z!tl@#9UGoWz&5Za-4gbmVdnUU5LFP*_DDQcOo7{Ln3o
z_hPS${j$JA4_%JC_<pVMUU8Rr%AJ?ENad`EyDrYM=t({7trz1dDNepWDGb+n<&N~0
zW3bDE^%)KeEornC&4rdeDs1kFfWribZVKQTD2uIPT<cZG)XY{PDRm1!Q>g=pZ(TNi
za(4D%(){8`P+m;hQZ_AP^MDu1RMp~43X#=3{rd~JSlAw^OPWYmcgvmw3gWPcM8K}w
zG~(*YO7uj6>xjjDv7*DJa1vh*l>_fMDRe3cKPFigbyAgLBrpc;vZ~p;n-sW@xE{Va
zwP&7oAt|}^XXuqYol^ONu)z<_jfTjw`7<UE*)37p5U|ind`CBxa#XoDo&gO#|A_vz
zbxY!YoT0W2V_u;t+-kEEW8^B^P68eIfU-!ta^sXJwES+gzA2y!k@cpm<jO=+YZ??3
z%~+{hIxn~7apI&U57bj<P;tPhEn?z@IA$_d;tBY%rSwvVEGD@QS}oz1cRZ+yARU%@
z4qxhIEe)r4Oku<LWWzXh9)?h$4im@VKgXoU^E+FdWxccb<xF%IS%vaGF(D5`P(PB~
zL`Le0ed1E+lwR7q{d-uA;!|3;wwm0EwQ}ymztjjJHG;t&X3fzfM@fwMonCl+rQ}2Q
z!aJfiv-C#V_EF{cv(g-}+?~~NN(ZL|oHH3&n}v;RIz{-`hRwc4w<(_+@eA0WOU2B=
z(MERMNImV~Ydw4St)C3eDj401ygYApFCC(D1_4#uPSX+xSGjI$Z|OPgS1Rp5*$PyS
zg$a!}OfD_KJl^{lHkhnNU_a4vJMG&p(_(x{p_HtV+OX_Sz!Al|KB-Po4e9ds|3&$4
z|9sn8{_Qt*Gd~%p1D(ZSskOXh6hyS)K(O>PG}%;>Q9PZk@?j?`WX&Ia>*!Xrn{2Dq
zLZ(P%4>%Ri=SPnU6s-d7X5gc;QF>lmvicb2Y@GsRp{*EODv;xqWa?tNXOaQ+buMb@
z1i%W<m$Z-%*m{fr2QBzpdgIwFBP8$EDqQu_6x9W8(`n$?x{9X5#|Yf+(}0G$T~JZ$
zCytI<^&whnBZ`(@+~<1PFee;Z-m{s$b%K~=M-zRuly>ejZ)LD1osA8f0;`2ilq2Y;
zGhS+`X)VCKwVXAwFN2b!TUb2a+m9R|SYvyquwGERtj7LM(bUaftARzYSJc$0&|Pb3
zYneYCC@gl!Fi$lHLli_yhA;A#PzQ^MmcDbe3w92Y0@rK>nE2=0{QmNC*@@S8(<9=c
zOCk~zr)-0INkm~PXF+};cyPb)ARQKPN`W|b_v3@v58TiVe4_V5J@NM=0Eiz<SQu|H
z;KODJkIREJn<WwW`%o|r@E2uf!8wf%sw@rE9y@%-?%@fCjJ5cMY*NV{ltfz}$CsbS
z8=(3L@O?W(@ne#4dan4k4A}m5Wk5iY-)6l;1$C!5qb8sszB;A2v%nACbK2C^lipcb
zb$m6eI(DIxO}RbOW0@VHe0-R*dl2PY5$-{Sp^*@=aVM{pkjI@m#d>!ELVYUg0f`>2
zQyC*Z7$9Ctd^ik~HUB1CC~Mswan5!;7F~y)Dq)tsx3~`3YTEZstzupjqJ}EIqm{9M
zq3-nBY}zUs?&^uL3U%c(2btL^dQ<K!K&=@7+>%i62Bx;WPEJ)XwWZy0HliF3+!-+)
zPc}L5#zurqI1h0dTzy~&i&&#6N%dT)pa&a@*>N*E905U!I7GyeBKI<WH~Juvh_~17
zWw^<9z`O6EdfhKJ%GXA{Q@`Y^<F!}2&x}~qoT#%4hbxd)U<g8<+s(`f<}%8)@ZI<h
zE&b+Bp?Lx$jJEuqmbAFX8((sPE*xKOjJ?yj2l-oJRhxz0OUFIZLWUXLl(*13owJGH
zNSmb%V_sl9PUcB|ab`p!KP5V;%P500J`$!BxxwQfpErQ2Q-Oer(SM@2e;Hp{?8ay9
z7L04I-GXx00I9Qdu7!nSrir9jVJjH_9L{7zM<lTWI`ShE(~+>i35L+nVi3XywWVIl
zq3BV~w84n$?Nan>07bDt&U>gakV6&}u$7II${~-V^2wxugBs|-*yNoK6;To(xxGi2
zbe@dckgkMPbmCs~<nZ<8+of+CtE+FVXkT6_#J16!%d|H+-&|=u_~udLJV8e)__6lr
z-G;S-OpI|<5Wkfd94q8aeh%BZ*~vaMFk}dgVC`XppN{%53WPsQ8by=ArGDH=`mFAI
z+YkNoc8LZv*S=_DK4o~pyn((=$~LaBbGo5tn17X0gb#IF(u7S@l{Y|lWzs8Nm2xYV
zniN)Di?h2cT*5^jsn}EKKK1IjFhP^z+wnHRlPyF>L?aKC1DKW;W3pi)fmT{Ap@Q^j
zc!kjh5Q+%Sjp!h%kj@hE9#slwO+&~Xe9QHirn2buE!W|bibnUN+M|`$3J}uyFXIW3
zbugTJ(JDM!c8Tk{%M{Y){dy}V4Ubw7#pPS>+md9Me^PiwV1D1e9WI~wFV@%9b6GA5
zHE5e&VO$3z!cs}bfcLtv1ThKKGA0csCD5&|EeDZe8ou7X#rQ-h5w3#WicCG`<K*md
z*3cJ%aP%W@um+c68pG~+(tYoFx1YMZ$=UDTCn&*u-|WVGuK8RN&b>%EZCWkv_2AYu
zVSUUYFhgn3x6M;b64`6u9}4iZ3HQpCGO#c=<Ec%vTSJM5le8HaPmNPi#(lE3XL&F=
zFx9OVC~q0X<%rRJ6*GEZu2~pghlG;BVPiVu(RqTA=Qbbcf!Z+Z;P->ufZS~yJ(Ru2
z@8ggO_|n^@M&LFebwM6P<<>C?yaLECJ}u8U6?sXgY`_Y%P5>Twewv4df~#0~ZnGRH
z3SiWWTVpBY@Sz||{OTe~Es~h_`zi~Aj``W<kgXiT;u*l%GbweF9jh`g<B^X0*{Eoz
zkO#&}Mm>%%KU#?xSwNm4C)m#}quWS#(98s{A=bh;-(GfVSj}P1_SKuwiTZJjNzdmR
zp_PHnQMjxcg^TIJkG)5@VvP5|EmO#ru#%-0bMj7srj=fRy$A8oVpC|9-ot3iq{+O<
z(jJgv{nI8b#dj9AQ3>D}lA-EHvIuh@LrZS>KPAR#(-Ff1idEmPtgK>L&)n>WY7A@q
zYSk-*6f6|5Mf{F|cd;ajr-vIJV(_$$4C1ws)}={|WVjl7Nf*E?=M0Ys{t}nsHhQU^
zjgurYVT%t;iYm-AhIQod^m>@qGZ_;)L~iIb7UkS+z;|v#c02I$ESueqr?^%bj(9OT
zA30wU|AMRgqsWu+ft_dYd&-|BY1m=QFcG^F3iAPx)%~b1>wTcA(ipQ!M=}W*^!sEq
zF)JWA-JS*-Hzl~zzyg{}kpcaK6Aeay`-9f@IdG$wP5_jguDpk=-27OqtoF}9apXNy
zRrP4zCy5o2zEIk6ZoV1)9ZJ)LdA<p59cRsht%^G-tg|xsq?RK$xHH9%L&|K(@-#!t
zT74jSEF2ZO4FkXfZfiDeajDnEiq}P9y|x_b=^*|f8|$aW@~2-?udpIC2V@|u!?KK*
zKEs9r?uubsVXwV)vs@nWjYar*vosF*-Zb!q9<NfT_Sp~!ILnCbud*R;ta5f%0HQ_I
zo5T(|l=yd1?E%o(u%87QJ6gA#>Y2V$4Q)lM1esRLtFCeNC8=SIY<$gW=n@FERSvE(
zOPb@7bH_hE*AbfmVkfz^3OO}8%CfO-c1$B#HJH`_X@+XOL4w&HbGUBKC^jLX0Zi{F
zYk5iBx){(<7RD^&Krbjh(v6Wd94AaxHLyIF<P?k6;$X{MOl=9ArhE6ImDV@TGFj!e
z(9!}vb%jB7eSU6M-+fCO3-iQyo7xn=<~#C)>{V$wYqwA9sMx=BVc>&~TlKcafoI;<
z-KbUED!SP;dU1Z9^p*mv{~A*bM0p<vg)we^nNm>`=}j!;4M3~Z06Y<C$fKfj%m#;l
zgqXff0slzea=Ql`M$7~oJ(tkPno35DA0U*i_p9OeMxqd8%B;-@zNRrcs=7s`f8beu
zRI(;Ej%3mKVu4+oAsanPSn`PninAdQb2iOc8pcLq*hXiZUFK*DjP<0}@x|Hv0#BNN
zW08z%M$?j3G(wd^76(o)j<Q<ynnaP5vKrr!&^CfsD2`kb3jceQqHab{px%~QDELL=
z;V{Fxy$#bl)cF_C1GT$%8`Or9!T_eYo7<=-rH~kl;zRKStFnY|soicbMIzy&AF2?r
zy~*X%?1L2fFz65S%~q?mrCT|R(%$A02~1a(A|jkIa^xl%>gZyeo`P#EpPAarFo-QZ
zsvUAfM!V)oRyI_?8@J6^>6adCad@~sZ4({W8#PXDMA<&9ackPYw$fOsFMY9@7G}N3
z3e*ogvxdxRBkCa;BI}NA@gAdir}kZ5x7Xs$KbPL!H;chPYpr|V)%CXVv*j5pcx!c8
zfM$OPrv`2qTCPT<RtRRl#mUzt7}OJ*jzFNb!l+-kIQwt?+c2`aDRgzAwS22L;H|x$
zZ@n#G_reWlCG5?3+gn=pMxi^qb;q07X^NgdxEnGZ-VAS@Tlea<CvWLZeficZd_CK`
zwYFS223q%JAF|ZSdT7o;YRx8L0<F`rQ_fR98GU6??**O6&FCkpiZUs3Savi*T-{)#
zr7eX+mOP}So@=C}HOPQNRL?$M(qYb>ZKshHLK+tXS0~+p4qW}@#+#kp?UU^{i_6Q{
z<*Rsz-_9qK(fac8<>h6odj&-9zgyY(Y`N3V&X(6!R{plUy0*OXEpF8)9ya5q0Rmjr
zCOrIimJNF2_^jEdTrF42*eWKs>ci#H!$1|}{J#!+RGW;aNSxy-t_uTzA$>BmqJpM|
zlzx;YZiDOsBkL|MF5kPi2&AG6Ig(y5BsxA0nbX2^eD$2@HS|UproTYH#7q%m$I-II
zT)r0>aB7H+1(u>nc=yDofcqr>M|6tD9RvP0_ucj45%WqZ`Rwtyo6*Y*{UKz2&NEy)
ztXO0D<AhyLl73xE9d`bOF=YT+&(63mzWDnP(}|~fK6SeJAJrJ!Mo52kWB`t1;Js7!
z7Mx%{CM0pC1!>?2Rwd3&gRs60s5gmT#^Y#hC0hA*{o&gBqm}6S%M<v$y3&aLCxPC6
zPUGx+nnINYK(+}9Z>MLxwn8PqUgBio_UZM>K3=jqBflqotu~^cpzbpuEusg}>No2T
z{<i+$K}BD$M?DgB;gaDhQv5qQ-O~}FK@OLK{nCn>Rao9RA7>aWRl0`8w}(Ao8=@CU
zb~;XaJ(&#R;W4j@6y}`n*b#*+=q5vCu+W`j>_NiQ<6TuiE$B`*x*8MxjpwR~(<*cv
zJ&9X=_2YZAKaR(PRyP}LwW4jbcx5JHoWQDHBp5GI_O1t@Jx)7Q9Xp!R(+`z}B0lK=
zY95o%$N=eI+@Fk%){&vLk7@&18f+K%Ti}0jnK>;xt+$FNYM?$F_ENS)rEp-$L<406
z>+6j!x9n4CDF;(pXG(&G4fDOx)vGnkCa{nV6(=I+;D`5wGPXOHAUS4a&~LXN11C3b
znGvlOM+7}vtD{B)bM8&M$$Wz{BO+&zxdx@YlzLfrI?z$;pvE%#^^ooJ0Dyd)#{Jy1
zueU<t{9r(7GZ{6}lOOhvqvOM8CqHc;?M3kY)zRUP`@4I)(bInv!S4V5-|b^4boXww
zeXtAv|0CM_`PI?h@o{u`6z#u!^<sZ-7h8qKj<yd@_V<n((f+~Ci`TpR2XN;-eSH!g
z02}gR|K<J(ba8UnfC22OnpU;w@LBY7?`Y=-___Ub|Hb~vKd?(|``P}<0rvO|y4;Rl
zZ6BTN@4SAoeH6WVee~+^crU_<?Cu}$yx87<xwqSb0YInG-j90+C(-c_+b>=e=XH2Q
zC-3m!<Y*rTd3bajJ>7$0Za;mo#~r~`clVF>c200Y=GzV|6^!r&puksqJNx)$@8><3
z&i2ti8m8Ifz5nwX%E9|+cl+h`bC_Ul#=5{h?7TkOdx@il#W;Tb^!Q}|<n_s3^!)H}
z_gLCK-aGnne`oJ_BYJUoOsn?#c&`!R{f*sYE3jVh8oob$eY{UAw|{W5cXagn)ye+h
zK|T86@F!TCqiAOvs_xRp9v)!ZIA_?M!=ry-ySNy%4}gJx*n{UsxUjTj+qf3Tuyi{o
zb}{G@R`SG}DYkmB_x#2F^Sy(eJuGmD4gIu#yjO>9+lTQz$5yfDpSGdf*EDwo5f~eP
zwZOGOn;PvuqtWjExR2wP@&F0P`vN$$d^<nL(rd^+Pl&EoY9PGOb2})#4tES_=yY<)
z8J2qfDWv@7S+1P&vE_IQPsZG?WN$>jSIQX($8-cp4DY|3a0j4h%B~Le0k6Uljz$^W
z2q~sJOj0`B$p^_0j*Y{SPY0uZn)Djjr4PzDyXD12Oyx1o$W%^^x23+ABp_G{sN4y~
zw!;J`cN_fsgz|sLk3&FZ=}^5ng?c$ql%pT`n$Bz34>G$#fE^`gm=<WP?(v*Pq$M+f
zy1y<iz|-vsBd3I)Hh^|rSXj!2bU9B)<k$|hR4uufpi<ks>j9NRZ@ELFn0Db=u_Q*I
z^h>^kXT_4zpH=Sl$dp=MR^{MIEG-xTeY=~$rA$O5-2lW@WFxT>8ftk}jB<1KCPotZ
zjNoB9QDQ74BZU}UT=<A<y#Pe=Fuq97;z>4cL9gTOGu-1z_9DAX#ydcZ)aotD5`TDF
zyL*{*-lvnhbvA&78AyT|SkFC7t%7+_l3_Bg-KAL(B?Pcw&FUw7)Zknz^$naFlSj);
zEG;e|BUIJ!?%_*n=(szED{fZfl#V2ac_N6C0r|z*Zq{u9R0{Y$z1r{9SWvXFxNz2D
zQ8qBO#7Wbmb0x-9&pv7(1vV78JEC}qVZhu$QN~m>-IpT7#W?^z$i_hG1N7%D7npH4
zScK}+wj<Qym{Ed{VBA7Y+ayta)M)cYE!0Xu@m3cO@^JF=20puTp8W$03hOqqhki`H
z=IFG{J|Bi<M=D^Pen6;!X$ioz3de8f<Yi4>Hl&IkHrmoG@w3`ebYEV#V)(k$upV^$
z2VMU`&wr5k4^HtxeF^8O#%iO1+LE3aoTa>OufgtgFarFlCQJsHNZT-rl$=icY<iaf
zi&6Jh0CQu%<Qax0|0XKTJ1WdG^5^w-7)6EUi3-aR`P0XGz*xY4tI@k9Ys>S(md6@D
z&e~uLlj?mowGrKt+CHTew&ppU-q1cA9M^`^J{-@~Zskq-&e;*h=)y@Mp5?RS4bDIF
z`p5t}L(q3KJ<*5?Px%Ppb6%<+|3CKrys>Q~Nf?LcU-MHSv@#-T-a0JHS7cd^wPPJC
z$%*sG3Imdmgoq?K0I4If_p`rs^#y>GWIHpnzjwVm5eRfwU)9xB)pg+Y2&|l>fs&;p
zav>W^vRT2A5X7(L5L5;G!C>MGLB+B}`d;HpY@NOe6!XPvcuT8zX)==v+V%P<vJ9Y3
z?Fm=eiT(i5+LsReftN6V3fvL=j`BH-rZ>S<WX<}M28g}4Q$nqqD663%3Ca>EqCfCu
zTxUEyQk$%FhA@#h;K6Z;aRJCIw(tOlDYu5`28#hR0=4xp1c%TeUi)#BkVwOQxX6$}
z*?Q%=(JlfxtU`Zo%5?%=`osQMqpvmmtZ$z@MaIsmp4ICiU`IF}+>|c3-@>rqobi)Y
z!WrUMps{8j{;gPiXS{$O3d08+A8;TP0|^-#4|QfkyrX_F2YE6$BNI!oADBf^^Q|Y@
zU2U&sbC$CDsh2mnFb_VfymnT%aal~iaRI)d<1>+6jl$uB?}Ea28<au8+#Z<ER{Of3
z>Y;&%8yTl5i^4q&6nGo<YBu?Q4fZO{umyACpXnTg#1H16w3c!Z=glM%amZVUoO!<2
zZg`+?1~N#hyFz$u^+jiD)I<B1baWQ=gJXUI*dm(E+b~I_o_`x2We6K0$t;@j-_vkH
z@>hCE7S)8DoV+kOBqiq~#ic-%8grf!7++aQl5D4}B#HaPRCx&sb)+J|JbLCk$b$Z`
z8=g&J?kH^!r8^|8B`V*$k*Mr6beL%efC|x~%{AE=8Q`j%J*N~Z6=V1rJC#}uflSeA
z8MsJ5p+V&LExQRU;Z3e0JNKOQAfbRwIP6JOkc=|e5#1$B|08h<apaWsM`cJ<fn-ES
z^3WJ+NG<`I3ty6|LkCnUBV7)Sw@CrZQ;*FQ&^~*dSUm(_te+10re9Qx#!L&sS&DpJ
z3zIBz9t+XMD5Vb>y5hs)2vaZ)7OmOWy4CKDT3T5>$-d){p~yJKK<gBFiL*s=(6ib0
z!N!;&-$Qzy?Xl}&tq0#pf?(8%P}EiS$$16Pe4~T8aqOZgBTO~K5*Z{}>B*C{O>(K1
zgaaf{<#iL1LnoS2gPTN=@sBfe`&_q_%A%+Df>XkdQf-QS_dj0a*>SV>#IK!h)ZUyt
zdO^wYu!Fh`CNLQ-PAHXDNEd)A-6Qju6a+!|O-A@=M7hoe(6mZN)g!fFmkj)42?!@(
zf<(5Fw#G>(`^#A+wAI${KRdq4cPLNsX4C*JOTqceor2+-YzDKT<kr>Ar;L#9i%H)E
zDYED|L5~h1BXUJ#t(LQ#RW|Y+NrVXW<UkWALmY4|ttMM1UMTV8{0RZaY_I6g<59w0
zMs;PlZnDhH+R`|&>f`6~)7!CU-kPR!N}5^2ebTIyj(>e|QYouVV($`4A1vhCpQyZZ
z;l!Zj-G;z+^Xl`*9~N4cVV}ViJLIG<@q1L-8JyS<(<mW@7djiCv2q(~?J(;cP$s*?
zTzk<mr3%7piU?$4TH;p|v2xSYHD{ozoH(`3cZpgkF)eY7+x<6DtjYOBaFeFcVc$e_
zV7r5`|0fpI@d8cMmauQa4NyHhR;8+3_8zHyn+uj=l=PLCsR|;9Z)nQ38whFA(1OL;
z8f?*EzQ}f^0lOX~-|P&#a7_8oFb}(vSmykrhW13k&m65%d+p4M1x8S^SpX?09er~m
zfE`|hW3j_Ev%%>U0efz28{qTk3S;QOemO-VgBgzzO@Vnic>6@}Uln4@FMBV%H3~@V
zduJ1``1sWQXXR2i;dpFoaAU?K;rv~LO*=M*__JU6fUKOG)MCn1Bv-%^Wfx1)?|43)
z@Oqh!*wj3g;nqrT`<<QNmilF%O}hH=f{&p>vBeXo73w^)pOilm&@ceR#w9SAD7lly
zemn_#Qw-=z8K<RsiOf@xI1)D|nZ<SR&vZ&_kH`RBT~YNOTETEOY&#dW^qeCB_=5|w
z{K6cBf*}RNIan@NyocmoP_7y^RJ)N_!Ut$X{@vr$#?mfkHU6E_0@Fk7xwquHSt0Z6
zo{I~=*V=A~xo{AuFlSD&R3tjsw0Y2+<UDsj(-4&F52gEhx4Q1hA^QR5!fWRNE%JjH
zoR{+q%3nt$0t^G(=<MFvi(=RTV>Hn~ldFhu0#|r_{a`xMG{B!|Am|=S6-TFRr`5aZ
z4H#80lmhJ1@xZ?!IVqV0exF37<Yoj2qP?goS)Q^)(~=%t9-hV|dIYhcN8KJg4;2mT
zRX6Ju>ZqF(ntZUSHquETiR69z(ojBFc=X(Onw>;|^$<h;ne(kApvsvEP0=S!Iqj~v
zM5YK-kekvtS<FeTWRtg%3(rhL@K0~?<;z8)ts24k<$5y}^*z%I(`s%8#&r2vUAD3_
z=5$`m+j9r-Eqh9U@7g;IWto$lGd+`Z;5e_pvdcOlm;(CL`iNi1x&8n>K*GOc|Iva8
zI+r)pS>p_5qMvofNtR8EDzNpf5?|4EKZkKGU<EEoZUDt99AwP0l=0s0`3t=Nvp#Xt
z_)W~Jg(s5_!k7Jsx97-~joD#ZU32nrC!8@#D!zm_qbO`rR<UB7m?|9=*?vVUjPJg)
z9RAc*qz++6(PZ&_Mt~B%Rf4x>bG1nA61V=G=}d9tldVRHUkmjqK7vUlJBk`U7=vbe
z`~YuqQ=`7H)8P;gZAn&-qZZehS);a)ToO%p&;pw97NZj^TKrR{z*!t!P0lrXr#4JD
z0>a;6^MNGAh5?0)dg`0m9+|oA%e*S*9T#8IcI&`vcDgqccbnb@GiMj%EwNhQ1}yOM
z+REeAdefrt8sk%hBQs^l+Mui!jffI|XLa9vN@nBQlHHNuN%<)`FQVQX1TKFRB>|dG
zvP}&?&cMJK^C1YfF_;ALXa<JCNys`zXrx##+Gqy#=3<(`dZ#l0W!6qHu3ul;L+)TI
zVa6Br^4^^kkzHJzrWlw;W(!jR|M{P~|BCXV_|?0v_^No@E-UU>W&YxgRFpk2b0Le8
z(Wht@5&wA-1rv~J6pkreO*CQyZ2IodWDM|w=3Qj>O)e|&bz6emqdE-j($6@C8jC&0
zezjZeRr@FCLE)VVAYH$T+IZ2?bOXEkv46tKb7)d^Q6aWeP9JevAHZtw86h>Kva5L1
zAvfh~I)cU=O@v?#s~J+s!A)8_!*>wh-8`vEqmJ*U(bMGf1Xe(yf5ie+z2h$ar-%RP
z^LlLRF8qhDN;<L?b7pgw=00n(&6b+H>uNVp?JP(p-u|W+iJp<BAMgDrGN9HyRs~){
zmufz6n>~;a$^P*wOw4D_2Er=F?c|W!+3#%-u%q+f5M{%eQ!nqicbzfHb2_=mJyziE
zc>j!C{9Rg`$sB_fkiQnifz>}-J!JJ+c8k(Y<WXx=9IrxD`5by}^~Po7%>rv!+V7a+
zc=aZSq(6Em>1uD&cq%=c_4=W=h;Q2{Q7p=#nRrE%s*1$gPe&Kzyroj&CQngU(2v-}
z9B(7!${9B)d?qtna#2*ljU})G!CV(`MRo3TybxDk$G!Y)Z#b2jAg7p>tUybLcv=--
zT6#+bfCpx+yxl`CRQHPOlw~cyt>#HubFCoA{*#r#t9gzZiS9M1%dguD$J+f{)@#=8
z;cEp&xX5{~gda)^w6{ChLZE2|+AH9;`d-6JZzRD9dn;Lhte|=Q0R0iweC6Vx9k)qf
zV{mVVVQ3o-q3S?P5xH3bodjrZG$(e_x<}6z!V@h~sF~&aAqG`@;dD_mP1%9q-_!`a
z^n?jin}}O@M3D3be-k3J{U#>6fiJ+56vrs;YNQ$=b(9s*_nLxqyJ{2FDFOXdb@tzR
zaAJY6Pqy`?yPc&nXKFd@$Xm_@fvW+QD2q-B>#{d55rG?+F{KX9tODhHq*cIr-=VHF
zQ^--4I$03%L911CVLwm7mQuF@XPp#Ib|zU7w#%97xIo#Bo5%=)ZisMR@nW&6iPEcZ
zjqEPctd3nZm+Q%AdpHya+E#&>hptVu@6Nt_`#kjC$*sIL{Lz*@nDUUTevgly9i5NT
zA;!U3aE<R5clUNSjyB&eervUljrXLRFD?G?Ut2pH@80cgcJ>dp-fVyPp+^Ge;;e|8
zi@no02xfoIz#HBIZxmc@gCIA%0LH_sc()eIG<@HF2GG;+Y;=z*Xexf)`GSg69?<oc
zsTp71QXm8P-W32J?pcG^^ZGt*+`Gp0y=(OET_d@*%B0u1Z8Knz`FI8;ZrcG+<aQXh
zA{i9AD?Vb;+b{*n+@Z*==mTY7=g$4!4+g<x{^$V&B_O;5oZHI*untIV=Rg|o)adPn
z`_ZjyyuNM~^6;QQPZXlTwVHQ^SGRBqk)nbEdEl46H%jgRuM@?c-gtZ)F?k&wlESRN
zF;Jq%?7|7U=mrdOeck68bJnP%`ojOk$T4UvaJQ=6DKM?!=vG89CFi1)DRvp$j$Ll)
zxqzcF>Y6ar^<7IHpUf=B0r|<s0~Z}Qd=EBm6yMZ*y*?`6DcRuc9eN*TwJDSTM>Gm<
z#YDU8ZRE`^dmA;d%ic;BoDSbguk6xuDJ4xRIzIXF1u3Yy!C6SrVH#rhhx6Q<CX;B0
zsxFl;HMiAHhtr~-MbX*d_IbtP(fB^45x5NPJc=%E1#OqL6->Z8{<)AceO2#^9a2h|
zuO6p#1tzeB7**!*KEBt%%b8R5Ma8&8H<NP;#N#OjUPWtWe%U+P+@bDxWN&S1u=#%w
zjHD8iH8Q^=JEGoDhzc{tXjw|vzgGbpN1YC)7zt5oM`U8u4{T@h<R$_7!p0*h#<{3^
z_32mBkhwv)<0VBNw|pt=GKLymUq1+XQQUtQ^)5td{Mw)RGuO|PT8Go_Fr4g6C&Bgo
zs~wKR(cK%QM%LHgk6;F7BUY;1;b6`or^_Bt64<*z#tyHq|Brs2Q(lel4xKhdvB!5V
z{uYoah@m^~i|kgqOq-G434g{@4M{=(CqUHvfes^q4ip@0cys@~y00K>{J_Kn7K88p
zI2fIwwKv*Lxgj`okmjdeh=Cc=AY9cY>u=a5?A0N+BLlBJ>et3SIA40umoOP}M6!AY
z$pyzP6kA^hVVf8h_3xnvU4r8+>`^MZ+!=QO;6OVv2MFmd05-={ff1(x%%+iV4mNhS
zI$OK1JDqvO#=y)03U^?2?f?`u0x(0j(p!xqCYauC!~_w`k7ebRS{%_PQHqJXqZK;-
z3<kLuHJGU;_J@3PMj7bYYm4t_q&}h3;nBg~?vL+&@sjBoR+Z?!A>Fs36G=P?(R&*a
zX&Cs)G-elkff3e&dR1<NPFYbhCX%hN&cg0EwFl|~<1HG$lJy|7XIO8jK9-O%g7c2D
zQtWSHuW-TGTa8A<FgaZ%^sY)<13&9w%5@c4w!*;BQ-%tmgJL+kj0PA~j8j)gg1z+h
z(u^yrl2ZGW)4D51xv5@@?cw6$ExJVAa$2WoUmoR_cQuSk59cK8qZ1o3(E>-4N&a`V
zkfgCs>Q)ZbyQ*i^Nav|&rObRaE&js~zz=Z2s@JL-cIH+UA?t8W@%w2B&D>dfJ*_I#
zJN$p2F8glE>y)+i3<b8jq9g)HcFd@Iv~727eyov77=g?=h|!)8+ld1RMX??08f|_F
z4?T1Tk~|7k6Lru5<tNE>IA#w_x^#|%%P^WIiX>g3(<)M2;~7c{UL+ioC<~5du1MP?
z<G=Jw^FLefZJB4Poi|$pes>l3eNdNB(%_?g|6|`=iLvI>8H#YUf1((G3i)A<;5Zqf
zBLYTt;%GuZ;4xB@sLio_+GgUes`A`j^l#5j^F{mh8z!U4+1+$ofZM^mTEO3bE-q?$
zjxhKz;*Ai%uDBrwE8+lz`N&WTIPt8W+io^Tk>^tintn9x!f<K)6wh%=Xb}g!X`Il-
zD_vuVQ&o+&u7<*jjSwB}*aL5XXZQ_ChP1ye^7I{#Xd(EVI{WygE!3tqSdgOLf9*z_
zv2$KW;>(wegP!<qvwse$4>8b8j~)4#F1}<hJ1Vk+-`uOF>?TPYJ=)GlWlLDic#A1#
zo6q#~k>g*(l>BChZZM&wG=R1mbep8!KWbTDa%@mq+3B~YsVNgg=?&TU7|1nFY$8k;
zvB!GWczW3ElInaNbvdPG|94n#A^jZ>)P@-fR!I0n%h#=;Nk>Du7+C9BLMK34E*g7-
z;&MBPmf``bGE2@$owF$}GTf3l8O&RLcbDWL0dnNGA;R|A2&V4qFd-xu|0$?|0C<J_
zp3b53FUAj^kvky>7j?xF)BV<M2%$*4RGDkAm`1Z(j7TT!F`|q`M~Zo2r(XPYUz5(}
zeGoxadz6O<GrJAL_BQYweMQ}bpXp9+q`UVjW65=(vG$=yc_cxQqaz<CVPp0XHe4*e
zL=4`rao4QLfh@<RKKrsQy_((9tDKfz-L)k(ZwE4EJLuGys6!Q<1!(H%^`Q`gFPgmD
zr)lAUJDr-T&*_u+RXI;-oIfEhRA*Mw2+uQ+k2Sq79Q2oBjMeGZSE57?sPvj2PP=4_
z=e=T8#RfA?^7gB?%>6fqSF>{dzDipRUt-$TlyMy9Ug?a2Gcqi<7XH#u{Li=U14TIJ
z0tJR0o%NOGm*Tf1GEK%To_KKbAs4UyJL9U8o=@gu2D>05Xu@<Uw9fOp%2{p7Xi5?T
zEw-{A^!^Cqh!XXg=thJGYBg>n>=#~&byfp$=(QeB%6ie-?>YV_O<pEV)b&-a;bZLc
zNKMndx=c#>^ccRIKM41=!Z)1t)ECLYsRv+1$55dk@<zjPWpLx8(pHoy0K10{02DUH
z9&cy~H#0^IHPf%SBdM2)>9Sw`a3O+mAtT-@-Ya>e4U?S>PCC`M!S&YlBp3k+*GV;@
zKR83<o+Wvr)CrAM@vE9ngZO%8N+@S~B4=KdEp|q`Cv8gl4mBAV3?jxnF#Q`~+wf8Z
z*gWx6BL5W3InAfsKBmW2lR1si;@Et6fAG$j6JpG6TqP)Q9t;LsNzWe#r5~V7=grp9
z=G!gYssMp1a7v$Fc3$nhLmy{V_fxTqvD$+;CP#UGt6Pwm3(vS7<r$NAlvq4&G|p7$
zDbmQ}j^WVSNo^2C7s&9F2RvU5Pe<Xk`@WzP1W^krcNyB8n`4*4A*e;=o)&3lbZ9Kx
zDk@`~xolBAZTvc#4m-l}t^=x+KK37#O~e5z+)5=8m39s>4L08Ea7K-~w;SnL9{!~t
z4ltEmUA3KaLnLtCKv6dQ!OIEUOC|}YjtzoT5eH_5BG#+hN=SyaO>eZ0#FcWWNA1-8
zuEr&)1l66vdy4-+2{9@AlUvDL6u87NC)3?NdRyMPkBY?U6?VIdx(TNuI&2hE<hx|&
z%05IYpf?+Kpr*wq3e6OaYOFG2zx0Hzj7FIJDj|22R7XL2s{UHSTvEx)^+u!ovUL1w
z<K$79vUZgkpB5-##k;M;^2>#)W<CH0tS`{p77n2(si=x-Go44tL{ge9w2drF<{0p5
zDJ$MCEE6CEVZp!;3Ks21en~+G>Xk-A7e>PZCLl%bo319!QrENtJbtX|T2<W<p=%i2
z<}^ShmxHeq{*jUkX<Da)T^S9S&@P1+PGj&M8zXD+=V?sRSEjT&09reYC<jpmV}VIX
zXMf|zt)lUiz#i}Ottn-4EPu;B7!qx|0jTlg!NyK!7w@U1GY-A(2vxl+(cav7{cd}A
z%c9y0A(wR1Cv!p!`-+4M6sF<&y+g*oihv7zYC4zZsjF*_7Gsk-Me#K`knWXp`g+}L
z)*k_mv$BM2lwd(FF|HjRXXNS25s93N-+df?_uZLY>)jhFrTuHTu;x_ZnD0UN789@b
z4#;Uu8SBB6^L<oECr=y<LP{oz!Sn(@!DycxMRJmOkL#^=eaXX+ewfP0^EMGz$Y~Y0
z7&-?c3`C9@(I!5SL=IRQbKF&c-4A0n8p*^Nr2<z`eBsBydXUutRK_0HJ<10q6+t3^
z(`!Vgg<WXVL!1|9vx6YP8*;1kn<%C(y4**KJ-Z_g7i+ciz^70K-vXQE{$8W8It{)R
z7s4k}<5%Smw(enCM@t(nld)i1g5)B<!YC;3u-zDb4ei^|8yy$knk`y0cAxdhV%TA@
ziG&?VZM8HCT8dF70!>kqe&{G(KyNFlQ?~gYzB0j>FRE@?5+8RFo4i_L%>m!aNI6>K
zp?_UNu$cP7jbEV~llfAXRdX7Q$355-AG@<#)NRyieLyZ;yyyANxr~Z}pl?BavW7Ie
zCi^TKsN8-`s`yeA1nY&C@^VI#$%k^+gGxWrYin4rnj3?Jc>f*;;=A-?q7rE0f?ntx
zs7sDf3g^hV2?jS+6Tnqf(s25?>lc|1eg2GMlD=4!fXY+KABeJ<F)^Y>$l8*^$6=hX
zo=b)m9q{{U1zR{uZ+!c5R&7Qo_7`kKMWPdJ1qGCqqMM<jAh7rjeeaqCI6%%|WLdo-
zz6~3{Hm@;sC`Z`^CJqIF`Xgs=OW?NFXU&^g7z+?;wVGAjsKD(qrDMPL$I0=p&rd4l
z=SVyj8lI^`42N1$)c@e}A+J$Fv|4Cu6$;((<&-q4n56M5in~^5sRZR;E7+9d1*q`|
zxoF0oq7BZqOFJWn^!K~}*xmbixASUycjMp}OY5aeWO|jBElS0oecCDO-cFdPs|3kQ
zNE>VM`(&}|aR@qmuFuF-?&(ERJ<zjarr>iSryQ;(71R@x39psvGu=aBhm;AQo;?nv
zNSg$y^SW2`>P}~iI0m!=gFmDi$S&f1H5nkGW?SKK*cy>ZwAzs%xY%2ge^dJ5<6k#w
z{||5v5d34UQ~&ONDvPD^Nx7k@rC0p^`|q3WYv@uG_fa}&1ZVb11)y}p8^|sQIbbUj
zV21r+GKVMlVaz3z?ZO<lRxO6g^*+|Ks5%#Y{(S;n)iaQVRW3Wq(^-D5w=^bY=d>mz
zQq8e@s~)xG->T+DAB4$E0=_`v6d!zlXWIm<YQSb$20HTt&dq1e5fhRe^`v95{T#B*
zX`-V(D?y9{HXvUJ1LJ`5bh?Z=mz%f9@X$PE5xHm;VV+LBDhqp7t7Li!2aF|W>G=Np
zn;r+rhBs3VR4%=6qlD0z>0jx<ybsBIh0MHIQsB_3wiyX`L!1lTE~ADLtzXcM=>}j0
z*GeI7&s)E4B*FAKH|`}tnu%I4ZKUrPTq7OAeNt<l!D@JaddkG5^ZC&upf#*%=QheD
zdtkuKtoFmS=c+D&Rqv2wpe$P+A)5u_d#Qwd`?J`*Mz@dRLZ|qddcv7kus*Tc`+J8+
zsHLDR-i+3hAq%n4q|#Wi6{#v~HOrrw!Bw9X{5iTw{oUr_%|(jE|5+UH9Hvv+nJKN5
zw0vQeo<+t|h3_HFAeUME_(RS-&N;Kp;bodlhpYdZ4wvT2U$~M={+iWCKp*d!#{p9f
zsO%_h##$mBBgN@GdITltTAtz)JH!F$2>L@{kgl_VNvUAcDFoD99~~PBjJpI2QTO-G
zB;u{{XHnWJs_UkFjkZXWS=hG-m|kk%TU>Fe!ma$dy{FpFD6O^4u(4Um-b0RiUWxXp
z9lXZLLx2`EvA4PmjM5}wZi!N?YLzqI?P)4UnufI$d#nuXkMNGLA!12P5)bjxkrq}s
zQ3<RN5P;QX$t1u*eguXQakwqt1Df-Fb8RrVrT{>|)`<Xu+Kf2tD=S~OE3a+<idd)5
z;OQ}EHD;5+IZ{ccor8xV$#|;HcQ(CKrvV(MFlU#<v}s8J#WFqRWIe;i_I%IdS?`dg
z`n6e6%=ANV3s;YjYUtmn(B3L519`XUtTrR!7ZOQ{GqU}CsCOt8aw2TYUYRW?C2T7v
z*}36k4NrKoI4y+=3<XSNv<&|Ulu=2!iblJ&nw4HB91MappMr<GF)HdA%u5V$&N-5F
zh6dMb!PGX!<mux1^v<p*Cm1dRj_$uO<~x!V9f{eZImU4E_{7<;);*qy=VEU=og_kT
z3xPBiEnD3r<>VoE6=ZY#M&^!G$0lWoqQ}fyvh`(^YgRF~lm&f;k&|>?^WCq2dhXi6
z(Q>bL7MweZ<hx(%mBx49*=kKb9V3yktOj*W-Q<pcp_JU|)=LX4sC9TmsrwnFT)L+c
z-2tL_EosM2p`tqDbi!7xSqyfa{y*;s&Oojj%Z(0di>iEaQg*KjUi1BI+VsTg$qZ}6
z+;7CY(w7eDbW)!K5ILqXuuf=)90r`yD0N3>U;U-#aE3ucM;#~5&imTM5?PBZt?53F
zuj$m!hNV+@h!Q`E_2l5DYzr`pDWy{*0j4*e)|BOhte9AFtIIWFBGm3NT(NXauE=tb
zcrNm0_*ZjrgU!o*r&&9rXSE{nnVDcaOS{9L7WQ}E+b=9uHdXKV<%wf%O+BhZm;SE(
zv$DaYRGF8iOu_x6w}-@56%DBsAeP@7t};E;Y*`GWU2kFn*i{{L{~;#)HPcILO$p`T
zSW{j*a4h8?SxR@3=Mnjw9U^m&4`z_?KG$+UOvuU5XEi%Os0C>4k#OQRU6CBqIeVd!
zkm*0H2{rUTnV!m(EH0IvB=s8TZnaUZSI_hp2PNyzRnc!cPid5UyS1^OMz5K(NdcrB
zluCp9@nG-gqqlbkC;_MDg52EOJ=)qm+TPo}Gg!+zKdmau?0-1uaEZ2dfBLidUt750
zI!8PEueT41;;x2Y-tO&eeMT9l@q2(3ixw&S&a3qua26ME0Y6L5H|u}_=>0G#72l7D
z$3$92DOWXCnKRf1vF<H==h}(LP0n!KF<1UYyGo-DAL|Z&Sp*8hZ_KQju4L#|`b=^H
zv>9V&13OKEtxKlV?NrI7Bq<T!^t?CB7%k~59+Fl`EPas`ORc%e97=Z}#h(^7w{{QT
zAG+jO-!(bzv_JaDsN*4K`|<00Yudp%bkc--$DHX4f7%oI*>b$4erL~rC-aEYpI3p$
zg(mg7?ZNvwk4m~#X^F@)m?kPamie8Pl`nBb4!WH$i?I}DxSes=k1*D0sa?cZV2Z;_
zy0<ecT6NJb+lJY2aiH>BVo3ws9rw?1G;w?#9r${DvWgO-0iD8Z*WmO%FxvXuN~{YY
z9quN7(}xr(MSTpD77S)FoYoB-OcGg4N;Ji^35v1N3oZlFHw>b)5?3pG4f@qCn`oZ`
z@41P1oFc;1{BiRHAmwzd<X*qz7{pY)W)*;E7*9-p3Rp*W3W$Wj8cwY%_fp%dRMaTS
z=*=cW5L}ioj~=DzrZyCvH$k&J=BRQyN^I_gklWms%m`E@-}a_M@n`K!9*yB=^0#{)
z#vG8RCUl1<ik3mOIR~{x5Bu>WZhepRu{pzcb0?5XC^T||vwDGf%vi;)wtX;)rf28o
z!h)_IIPeLKQ4MY;?#oE@78v^1G^VuJl=~8+;z=Z3SAwFCl#dWQU9v2wO^v399D{!G
z?3p04=N-j2vX8B0=WbP{CshMVDqZ>EB(o3f_FCVzz1|@3N7J!#9S*L;NvT=RAw@ps
z13MdNq9}<GQ%!#31(4z|o_l62UJXX<*x#DTn7yOTR{fIws9HF2wn)ZcckUibuf?NQ
zdNu4E6(Ceoel;g8#Xcux)@ehN2^=y*C|9HSC&Q>e<<m-xP%!2er*_2cWTa*iUNBGe
zApsy2{P}crfo2n^;|2JGkSH#jVAP$=;3E!{aEgH#WcOmq!Np_{O%|)lT4Zp;y<mfv
z00_80s*T82PqK>ks0$k&)<eA`0$FO;y5YnlMK(QMMKPuYFZBbw<iIXTwt;YjX;{>O
z4}gA#-T=QRO;JmzIRzj!%02f`r-4+n0Fsk3A@L`cHR_s2DNxpFUdB^HT2)qXV$^iM
zCEdZ2SGo!op#y%e7mQ)Uj3nL}dfhMb^=PwPFTC3NaeJ2#X6*Ma&|=>NGvf6i^vCUm
z_FR?<rZ?~tiWI;c&#9|Y6A3gJV1BVbSw5A2&tFKTtgZ_+7*?@nP7$<w?gzTaN~=wo
zvD(WVrgDgy*DfOEP^G8E08`-vXT7nO0}tjcF-;zy<g_^*;pB7({V}gt(Ty;*OKaH;
z&uYBdRqrQyGYBV>L68ME4&p&4OggK}h*JQtRkgtl+4K{siNXz7SH?iz={&(*vNfeS
zM$Zjg4yEdU7jRCX3B^nD`#J|H&z>PxhVRFs9hqE5lA;D`FaG3jpIxnrRm;6r!&@f{
zi804L&ou1O)9`E>bBsJ$7}^_Vt5`Q2ROh+r1pfYPAsAYG;147@B~^;pe)6ILIc%-0
zX5~;E7S0Ay*B|Kc_#I9WOUQ>AsJ$x;OmRhVT|Bg6RkuHDxDG-SN^9`x+V2OwaELy=
z=RQXB@mi~9t-KQa$`+DHfT_lxQ(A)<Rgk6Lc?_rC^;#KowE>KEZ_Sbs(-oh?2pz>7
z>{WnN;?b{GF-Ipr6`*dyPMI$Yzj1vRe_DLXvB4341*w((Myp7iW|qICnO$z?mEJhB
zbcO5d%2|e}%({0@LH#^J9ZbktskBy&@MJWJKWGHvwoAEP0U5ngWOT{D+NMZmKu*!Z
zLoKeB^?K;>gcI);sDYr5Ql18ZyWX`Sp?e*o+baK09EjT>T7IBm=jkA_5}t;f$COe<
z)47M2or5T0rWCM@G=;dAhW>?hN2viw->nqvF`Te`TwO(I2i}V?6fPV!H^HRpb*J1n
z4FJQh#5`CEqDgziXOkHY=%QSiPD8p(Uux4Hx7Cv8e$x4;aV!Nk530i%p+C?{75^LU
z6k0{v1F!{JPdy!;i#<)LcpjcP^!2mdlERDIsYT9Kg1KI{aeUcs8x08-`>+_7#D?JA
z-{OBS@(fbkL%&RCE>LAOqxXUF>hc?5MgX6p)B0bqHJkIg{jb=XOYOX^$@X@n`@G-Y
zBuY-nfB^^5wvkvhxvnROK!IV<H0yW^jO#%MpmGAOXQ)G|Nmoc=jB0~N^4L0Y1YVP+
zXmHB>ae-DMB3>7EK3O=CLo@2|dn8X%1GN{xm6kq~&80T3`whkRlPJn{;jsXHV%YNz
zqlFD-7^^wwqI!qt8N1Csl=6>MKwXN26p<Szb($y_5TAkHQ&Dv9c)F&zgYvBhm0Chv
zEjdfk;6^Vkxrc;odJy=@4Sih~96_qfe7{uX*G&JyVThjQNp^X^lKB6Oc9^Ualx_%B
zLq?tbA&BS#?d$@+S+wql?ozuW_JsGxa{{osYyg<ZZZpCsndVdorM63?C|YYT2?t1o
z%ImmL6Pa*d%_)-4su-IfTZCrl76|y)qX4fMqIx<e(;JwYs79h4o=VDk0|D{T2Fo^#
zCV>kDW5-L>E`5sWXtCxzgVX7C;1Aet2alM#3+5m^JD<Rgx}v)?+UWf-FokFj4I;cH
z57|!L%o6Li+!v2pCRvhBa+X~%jCQ)aC<y(~;{GjuKh^Geh|+eHYwS%i9Ox8%j%APt
zorfUVl!$<)I`rL)lkV?-r@k;p!q8x0fdeH0*kUdmnWR*bmcLi6l`$<b_TtkgTu=4A
z;eLl<xpwpVEZD`}VmPIMH1kHsc5YZ?Wm{{X5cagNU5eQRGc3^U&2E*p6eCQmH+s?o
zn3x)%6X_Sk*q8*Z(jYoxr}i=$nR~Ss?(wa?H;O=`ej!DhG3ZeL`aTp|+)gxIcC%Kp
zmb-tAJK84YshzCcYl!?HJ9a&0%~%|WLW6D!s0Bc4ujVDuFd!wsi3P_$MUGC@;jpVx
z<wV7@WxauDa9E(@W8U71d?qhw5%Lok`BY`TkfTBqi|LbP)QI&R7)H~ALKsAv7?cQ2
zn0D?ac0w2o3^X15bBedD{=oFZRZG7g@vH=WYO98g=@D7iVMT*`a?ID%NqHVm&#FMC
zu;;{WkaXA$Ce)uu%BMLnTE7?RqgbEBIV_ku`3;SqmDYAan2KX+q~<n~imj`}agtvM
zc~PLPD)fX&JU&t6dKma4j6}M4iM)VMw(5ZSh4iej_4gFb)p5l&q+~iCM~PU!V<i0P
zD51PT5+NWdSQ>a`#W{(_Rl3*5(B>+~0SP#601uUwlPoUTJ(Wxuh3{hkRq~ypU4eU;
zh>*ah(u-`BD5U{JUVAFPV}frfq6^RgV(=El)^<^RzYwp*@E;{J4DU>qkjQV+Exnpq
z{slWU=uIambs>{zZ7cvH`w2bn2APH^_kuE9{T>VH-5@1pIyC3xjM}oM)T6A4F;kDH
zQHB!235MxU62@{eXNW8{6lxfGJ%Fg6V;XF>0%eT~0bpZVl0&<w;jvVl&~dbR!MXA&
zpf=(nibkH*ThWZtyRn^S*K^+xlCLb$-=($o(yDh1zgOBT@TS#XTW+?WoOnM_9d$>*
zCO0OWJ1#*23sz0X0XG4-(U8Mu4kx&t)Bpr78{OVoeKsyB3II|Y^sl-=>DYqIN?Y3j
zS|N6^$WTU+4Ov*NZouv+RjQ0rl&&t>Y9AK(WH^lmKucI>PY9BTNpUYa8=+MW&*=A8
zKJMz87Xa_9jHD%VMVJU`U@Bwi59}@uw!op&7k}P3*xla!aeYxY%1Uq=zvKYuk}D4|
z#Y1%5(N3D8Uw+HuL;}Z=J1Sz&kg-0*BL}r-XdR-X5QytQQG!2!gd)|eRt<HNn*_my
z`Ce<$doSl7Qn%PqULqKE17v#g-T!!v<KuNYZ`M!9{!K#=36GJ6)P88@9@~^uGQJly
zGvEY?!8ixf*%#)X@7qN>$i$T)L?C}s_7yj?v4~$5HJwqfcOwdeA0|3H30b`_GDdX=
z{`todJ2vqv_@xf%lx>5ck+;yo+hNl%7jtnk@N|esbJSX+upO?QRx<98Dr}G)z)LpX
zI?r@*hBUavnR(Q{s_H8Ti#ZusVxUf-tG$O(Ce&<?DbO*s7OWbayF~Aif&%Ii2joym
z9Zx4?X!pjx_{=rvB@v=j3#`v%odWM-`(4T`R|m~`$WfkHcofE22&HjGuc@;YlN&Lo
zNPaHLk?Wahh*^K35*`(BcE0S04CN?Qlq;9=V==#3Ow!e74aITup=dc2A7`QZl$S$?
zF3saakq-g($4|}+DSta0G4lR@e_F5&*Y#KsS!+OcD{hsBI8Blfv&Kr3G#<z<GdK<T
z7T0?{i#@WLe>`YVz#jTzruCi<0SdgLg!1@IuYcknRv;()W;R<H&i*j!b6t<Jw2=aa
z-lB_#Hw=4mq>OWO>Wg6(y;fKCQTKO1m~3HAf0A(F9bf>65D<mlex2B%$rwVC1p!m=
zS=09&(zj8l1Y}km0+7?yUSg`gg_R~&(eV>SPsu8}NFv!k53ZGVJ$>5Qp`^|-CtRM<
zy#!))PbXPvYMf%}r_58o9*d3fY8sPm>ss&Y8)D<zOe6n-E$LWSetjd#(kR`Ewr&3U
zCXkPH;fwY;x<CyD3+0+$3jztf943mBCZ5{jMC(k*Ev6T}!YoO{FrujC#I)Z?Xh^>%
z!4FV(Oi)TxjV&~w=Eo-gUl}>eP%>Vi8du5D5_wXwSp?$>L`Gq_a2QpQE-8F8I#7FO
z;h9gC5T)<RxC^m$eX3~A4$l=nQ!IN+bvI$mH`QSy^>kW--QbG!RSERedw=w%wx-lp
ztQVK1=+i3X97qDs96_3`<633rtsaW7U1a4_k<KRRtRfevxx+|rbtfL6<(aA4&>cd%
z;oM^-GSOFo)`zDzyd;Qdm>|RRlM6}sq)u<-Cp1;Wns#tksM9gUjG3$9kyLg(;t73)
zFNi-`@F-ArqgdT?Dl^=Tqm6eS@NRnt>)v6e650CkvVI)({E;LZqm*TYgPEWfrWf&9
z9ZkhN{|qHN#bu3sT4M%`Bsy*4ZrL=5FRG<IFmLT%ddBg=a;J41as^>5k6f!A%-y0l
zwF<W=tF6q3;s6)LGE0>9?t-Nhl&`39YX&lvY~u6DrP^g1w+``Esfcyz^?H#zj@{IT
z%a}!sQBOtl34z@JZk!uUzP#%*{4f@u=8wzKB-AVJn9Pvw;xuBSu~T=UpJQ#u#}<4Q
zBbEvg&?c3)^sI49M=W=kzn~jm)H*hPMC@6R*9qRTcj^KYvJ5kF>*{2DZ`{ru-i#=Y
zV&2r;+8s)hlbCg}g-jtg#l1mad6b*37`4?fOeh5+U&sL6ODtMdM3$MYM|Hd&P9K+`
zJqTuww18R((Ebf`k>Yw9h7M46EGD*=!6IKZ6Q_`P;cyuALlA0U8Wh(f3a7c_(cX0K
zK!A;zfoR#`C|N$oP24ujeVBU|+H$T68xROrqm^q_uj_{cv~P3IG{uH&@_D7pYvAfY
z;TcguCb9<+ux5VJ3qy4l$h{u2TgLv;V(tFQDJ^K>+q@=*j*Wy+pP^$u&~=;K<LXhX
zSak3%!h0dSf*^~dxeH`OH2I>u<`rl3d1mS`9jhPhMo9dl%L16j9tP9Bq96;D-i=)1
zP}(E)KH43>jjoViSBz{wlI!zRZ9~CI{ailkp~vGzu7ecv6lsK52kBA`yL9Cv_lXa9
zO`tR^7>^U@CPu5y5o>yXhUpq(o)wii)1&K468r}oD<g<Wy-n^6?y@4Yght7%_9ug8
z#39P0j`8P6i7yd{!s|_%q77|0ri9r{=<|nwg|UCtprFAXC!^HkGgCh9Ekeh-0bd5@
zyNs5~1g}3Gj#0tQW~>(Dh*VRsLAvojUZeCeDL2eDY(E&FT?k7}E&V=~@@COn)Irxx
z8PauALD?V=%^L*w(E3J1l3%2*a~Dh{c1l`M&-SKv3_4nD&|#WL`}bHN*{w$w22i`S
zpx;+9EJdrBXT?N;-_7Jy(}Pv+7M6I(*rc@@79!nUvEeD&`nv?kV5tMJ_KfAL`S$>#
zwNgJ><D`CtPYaGT?%8?zIJy=7CX`|Y8;8(lH96-#!x-jxomnrqm-uO$_}Yt6a8<H6
zs#D{WFZ{c{(8HUN9*4zL^jgNj()mg);0<Ro#1a%aX)y3$flXbS+PaRNtV&|*-z-ak
zmM&04PlcoiMa<y}dvD!aQf1rg>Ht%{DQP%M>qt#pwH_>1PkmoTdn{VLF<=aqa=OAc
zGsg0*N%kU59Yiv99P(9(Ei#emMP&FW`<s!5J>D#ByjQnc<NF?kD|9NDk8DXJn3MXp
zRA&11IwDI6n1T`Jk|b*y<LZ%U35@lBbv0ns;0t9X!*M0JCHG~R`TfjWx!>%dU(0kn
zNy(aysvxCDE*QHLYtRcJEly24Q>q*uZXuvP7EPV~nPx%_x3$XZj;z_)6+5B$asx|z
zE=J(x)QoT#P0n8mt-}V9EO}Nui01bZ+RBlARGyik_tINNtNF6FrEqV9HYRlBT_cE+
z)aO>p>y}4yY9*}H!ya`p$G+915KB+8o0LIcBRR}5bJB{)ll|U8U-iZc)>;rg5Mzdr
z<{1?jN((`~wA1F;c}JY1=6A6j{2eWg`uJcUGCJu<YN;1~w+(T>n3s}4j(fG*Q}e@K
z<?ovn4E32>V9IGywyI>apJel&=sCMn5)|c)Xs>{?qhL%0JD4!%%XY7r2|JgSdtT~#
zn)0Zk)^wsYkmcjYCuN=RAl8T1LTumGJa^7O`lc>pp4;ake^J*gCgGd@HVC`KG1GY7
zh25CKvuRGB^Sok!Hv_H5EH?agv-0Y&LzcL|O}k6+1-#c}c~Wji;fS<}W8Z`faLXGJ
zG+jyVdotCUv#L?n<QZ)(&95}8t+qOf)O64XJtfEq>|o&fzMf-qHG7_BZy1?at7T~c
z@v^ViKqIdPCX-WYcOAR>^!zV~T}_?A5HOwe2<_;;G(Nge!<)H#jVy0eDE#q}FSnhq
zf%O;G7853y1zdL;4*HjtIf$AIZ8P!B=R<A%BDMYeSwD<l6jekhj<k=cjW%$DPz-D(
zp7zJ2!j;gt;^WAU2x<+)#N(ItwywvhFfVeUq7}gT)FkZTwd#mf2p9d>ZD_zS_QE~Z
zbAv=Iy3#e63P%~e=&%5WtSSmi!XUy1Ig3CjJs%?FL@(k5|1)aiQ`=a@@|l<h<akbJ
zLE@>|wogqA4mSyEq$O1hS6hEQVlkK**VCBHLwh&MCJyh=+0t)63X_DDay{*CsGSe^
zYDV9XK%uVR4F|{zqI{s>`y-Wxo$mlN5ORI_z<Lf{ni~HFyVCM%XscVQeQ5lmqVdr1
zM=fHL(|PV=YygjMn4ngrRd1FXP_*30o6V<AO>{pGI;TE{@Ii9gDCxEtYT2rQ%~zhg
zm8`GH?5|Fc_EG!RLA2E%+JC_y+H(gn`)h9WnS6X}6;k8U%*dB470nt~d}czLs1<2E
zPqo2Ik$L?&uM2mb=y_de=XW9Jb#5&9QVvOQP7jM|n5jpYuN2U?MQ#F3bwa1Pl9H0r
z--HsKRav=`kZep<k6d#u%cN7u;~9h0R(p9B{;sVxn~#^5(IC}*g9fS3uu^Rr4_-9d
ztE<hGrGii{^c}@G=vNVWu_fL!lJeJyp1i19&eX*ID07zv@iSEwYnGr%NB|*E=+tbN
zRXKRj3YE-6v4Dh9AKc)v>svD8Lz*9kPX=E;Srv%Nxtgh&rN3-xfTp)G?Ivg160daG
zDzB?a;9w4843F<zt<E6ozGGh;S1ElExe<_SEn$2W#g5)|KxWN8p6|$FKzI8gDuB9E
zoS+zn7Y(WPGhA@?5+P?EzR%#~DJ1eMgY+J%Sj;^wx2A71d^B7b-Ei;*y6+@d6bW80
z45L{bV31c{VePLV;AlS3KNgLP{K2Wr2*Kh$nR)gwKCy(Rtg1YuIw58*`~tfbn>JeQ
zwST-qH)Xz{($udu#@G;g(J0ux(#NVvmo6i|-n!;(Yt6sp$W9;CdZF%mT+chE3u45Z
zKB{>{n(wG`ltwZow<*PtJkpR}umw0079MSeU_5EJ*I~{dKYr3)T5S@=a9_D3qjTAA
zthATgYioMEAby9`b+O(n@%OTtLT6}oucVCqT4<wvMV#tG@xo)z0W7yjrumB9&g08i
z%F<u$b47jZokzoQ$-e2OD1m(MR1`zpqUH^)8^)r04Gs)6CA!oZFX8XU<Luj$61@8X
z-=n2frCe&z`|`{3%c9L_>Pw~7GP=ycU&*s!apuy^g;jODSwl72!!@G`;TkaMMa$)&
zXxl#|t|h1Km(M#)Q!$E$5t3&GK`WxhkDdSlT$mb!16waTM{tC#jA)LgSiK?b0`xUN
zo2(JV^437QAmFfd1Ghr`;uq%Dg^xx#iW0R01~(eYsmkP*H*z}6F+Y?Fj!qsVi4YM6
zAT-0i=TU1{;(5kMz4knpIaDTnL(6=zUvORKb|dY_D<M&o5skb5i6l5nQUlBcV%t};
zw_<~4ZVb&#5^6ItLAP-Ky1rj|5ZcNZTvHm|L0!|m9JTRMaN5PyG=7`LQ#+U3JzaQ)
z@B3_zEVy+Xt@Jor|JHFd+BqZ1XZwFf4etcqDX-20+J_XYcVan9TW6yk!b#m0Xi%C-
znM4zRP%}IkYX1_Fn5rZwb4CPq)wO8@-Rt_|v^uIy>EcSNwxDXO%$u2fHL*|V{T7XS
zL3ruJAEA!;6mdAO?`UO-HgG&d8itBq!MsOooIhX#g+u=g&pJ3m#J-apemF~`5vaFE
z0uOJxDIx=A4uFF6d^Yug@tVk<r1&Q};+Ex4pC?XuI`tU*Zwdal><Bg_S3k$x;cbOc
z{5xrvUGkuqVmz}4H_{__p*cj5@Hw_|#k@_BBOeuJYdoyjOEv?=?He*`8Bdz%P9!jJ
zpfTib5*0N1A%>%%D?^9i34c|((!UXH*dUo1LBwcbD9a`jUEYRE-EJJA@Mp}PJX2I_
z{_}P%G+Mz}UNf$3s3?+Ymz%^vwQ8_8xX%tTH^E<X0?S(Y(r$(QeLn+uM!uYxlJ@7+
z45k;pRZfv0vN7qhizRiK8CkIwS8ECNVJiX;sxNZ&)+y(Xw)ocGUpalTBIa6V$Mf&i
z(~920zd|d^sZMt`_V>45ciwHkI@mba-a1@QWkf{1XO1S`wbsUenJYGikLGU1ZDb~N
zr3b$QT+xB!E!~ZhaZxH=m#-rGw_dD!&q#o5z3`6tU0c6vzd+%@Z+U*(^Ow-()|2QH
zlvq(`e!--Q6`fSkD5dYlQ^V5_;uyHlaBl~d?a#uB#U$U8MC0Y8kgeyg`uWak=losh
z?8rPN6n~NnL3R1XSAvMv)f}s*l9&ipCCn{a*`Q9z4ixnH_B%Z0>2q%ITK|f>yS%Hr
z8CJXI1|Z*hSCspA(764J1j&cq24>)63p_f;w41xq@>%BdBTlcHFMT4bPFp~Wj=Dt@
z!sLc{2LEn-%;QU2ZrVqJ3%nEoCP&OPM{FG>syF=*DyTI}9a^YH0m09^G=hVQ9$+2(
zLgnYuclNaFXvlY?{VsX9<7x2!X@aikv_+&*gFLCM-<8yxI<5QH@vvb7VRSzTcQ{V+
zjtFx;sH;sY$uOQYlhVh^C(_X9^XAs$Xd#`2M(kZMk&nyHA5KEDHgV#EB#{>3I3yg}
zx7Ea-6e!2g=U8m~5B0j~8y2%GJd<L1{>eut9{g_w{<r!cbMi6i;gR6<Rh;?zrsrag
z#(@0Ef@_SkQc6=9H0a@1pVOlL?2?)kxy$8_WOj8KT;7a+(Rlxb{DAh5ex8}1znW*T
z9Z0_I^_^{4bywj-?+~q^ZK+San;uLDydU`^^i0Q7y1vE{G+wiS%gK8=i_xjrpQ^l-
zs(~OFb$aN9LxQu#yKr!a6eHBsx@{|9GHQW3{b1nV+}&`=a{0NtkrdvI%xI{s&wV+R
zy-d^*tvbz%I^un$$mUrwI~0vqB;NZ-8vJ_YWtq;Ibn1CtNwxE|)xIlYsO)Iu;v9`&
zuT4Czh-w|d0gO(djw<<xm)dDmu|RDYt+COtqva#se4^nG-!7$qlF5OKn%ZK3wKBOS
ztYg9ifXohG^<3V3wP2&;AS#099^LlRl@g3p8V7^GPl9s2B8LgAqL*34PoGkxH3tRm
zy!7cMch5ALk?#m}|Ivb@ad(gO|8OMvS{ao<&sjp?!%D|~?T?e=U!R{;%FmgDOHaEp
zJkzlkW#X-QCzIlwf@a={hkT^CMt%b?7R(#Rj7S^1A!owlXz*${TuL5Y*TE`V!4uP3
zmUbJ(tR|jLt0@nNV*b62xeKIbZ-F^XB&-2iPfSt_>n1yi3~unI;hZxJi6a=h%)w6y
z>N%2-ayGjg>F}osAPB(;G3pV;P!Mr<e((BW((~iK)^I2P-VWOAVp?5m#dDH?PR2ZP
z<TWhETh0T$o(TwG{VOhhpDZG`0e?`fYY;g%*l6aq$O<V#0$@s(%tU@Fm?*9`PC8D-
z)>wBV&)ESYWrkY2{?z+%$`LBO@9V8o@5i@)%+gM0HjEotVm6Q3%wbRSPPKov_UfVc
zBU!=t6naNvpOU}H1J3XE`h11XkJ{su@7MuGvDs`|#hT`ys*%a~qFlO49QzQ%94Su{
zc2uZ~QT+85=J4!m_E<TyXm(fLP`>U`^Sb;}CGE!27=SYA;I(zoSH6Rmw@XbLV>cKb
zcEqjr%-qeSE&_h`V{$O_948pM1dB#zY{xW8jVs*;eOaIu20ttPmNEk@HjCc1I~vT5
zC}nk`A$9>(iQ#ek>TE+BXJ^<bXYEP?Kkl7NK)7y);}WWXOzK{Q&7%f{VmAeffr|bo
zw0Tec5HpMsHPY_KoI%w@nxl$9VTMtkEU4-XB-JXKd^CnP4NOT`ZO~;6Js0U7Zb8Lz
zDK?-^12b9<Z{Vq(L`C$xmD~^3fK2E{Wv!GjMxzT~Oj-=!^TGj9&5$BHlJ6Hs`BFW}
zw8mde_huAO)#p~7U2SF+_d~jEmq?X(MK}irMM8p=kK##LoRLSO^1E@u+@%Fell_+I
zPk|00o@a$3YK_t3I!JnP*u_S>5gF_CBiS@|3U*oa(hvO58HCBiy%oWH=_&!Vl&+^U
z>Ea%x_<K^;K4*2fIQf>NQZSBuCYA4}UmFx(s`07u$<8q@qnEI|^on{1EUp?oo!<SR
zJ0&k%9d|(Dr9!Em6b%E3mD-EObO1G`Nz99hwM}q@3@}=`*Xr$U%O{~W2h60x$UeDB
zzuGBmC#UHJu>#6WV{W+&mo@`nogVKBR!ZCJm5K6b$M>V)pep2ps6oiqQBxi|(xdM0
z=mAeNNEMHu-XT}xs5o!pXt>9v^ppaOj826t9<BV}<WfEKpIWQXiB3;}Gv&LKA2FAj
zz-2ayUHt5w!-0LAoK9pC5*0Yc*%(7*U!l?Kkd*aS?inPH=9e7W0#`X;XA|r$K#w|;
zh=N;<|13)Xil3`qv38E`f&hW=pW=e;z51`$?|1g$BZ2zlh6PLIbX7MLQt2=8BHHd>
zdzjnZP`g8175ewn&W5~ur=Q-0l)>y214Ezbi-T6vs}uUDf550Tm%Htr=PkFJt(Dc&
zru~F`3_rCim1P0)#-z0q^YAM50G9>ZS2>9|iIvw6&q6Gs({*XvmxmrBjRcUBYHMhY
z4A@{I6L2O8Iq#^LBnC7|9Z=bE?MYMybHPwrczBJ@w#r`f`nYvM2^eS+9J@`yaVXN(
zq0kY@`Q4IvXJI>kThZU_+a3NN2RISDFu7>0dpc+~9WPbyvsvslR$@LH9t_hx^x4sq
zcP72FI{R6jXnL#W@Wl5cFu0q%5|r6H^gfhtBQ#X{3&>3RmAe4?laL*1<=;hgBsTDT
z!h?@Yb_Q9pbF{bjj);zcN)sM_Z4)0u?W`MAn0$$!VZS_c-r3v<DRzK>Ve>EkDh;mW
zJW@k@_V9%wOY{#1@ouwoxb@@C*6xvfI<D92>N-+TN>|dO>~s)g4KOv*PUmRr!;#Yn
zi7Cx%649QVt~uWb|L9w5t@|Xfz6rLqS613~4Sx`xjlA}+ZLhRkmJgT^4M~(T7)Do-
zF%e=y7zy*!yf(;bg?<g>BI%)|1!CPI*=lhQXnLW7WmBisq4wn3x2ZOAFsVyphrB&Y
zz08S}Elc2B)_yrO>{;pK)uVE@yP2zBQ%g6PscLm)ZvC@a)z4<t{;ot>-$~nLaFlE=
za^81Vmy3Afq!lTqgIJ!iwwPb;%qoURT(r(Aql(TM-N&w=c<H!Vd*atlH)?NA+;PgO
zHhYFXc4aHfhM|tjc|Zhb2}r8COT(?m4XsrQ-O#cOqf)ls(0e+~-6Pa_V?np3ZRY8W
zL@)1brj}f*8fwaUmD|?8`yiiv5>pQ!diIf2k|U|i*^37^Y9dW^GD>8z1BXRz&kIJE
zVH}OnxS)_)n%sj<&x#uVEi6LmhmI8!M#GNFWwnsjSnbs$9SfiTDwpI{6kkx(8y#zp
z;)jNls&|Si9Ti_hiAoywt@0B0lEcCw&naOE#$jKg5}@qE0irw<^^t$lvanenH@br~
z4&%-Q%<Z5X-BZWDmrfWBlY){fMnrDXH?R8Z>wY)spx|C2W=pdSd{6G?FQ;p9mnYMq
z{f<vmF;q|#kAW)Cw$|(gs_4v?*6K^t;F<U&nE(t96XKOPsv5^s!7jQP(g$+)<OD`o
zxLaHVF)WLP1TZ5x3X^m5+la85M}3-Vyzy&k;k;bK|9ngy)$7-Fyng0i9}gd`!~gK9
z|A=m-;YYocM4$SD!KXfItUh(8D7chMrH^&IxP0{Ssv?hnHmggY%P(O#p>56mW(sJ^
z0dbLENCm$DQEBU%u3Xl24UpeN1zlT4@eLllxOP4ElxEs%F0D6Pl<Q`t`MBkYT5Zs;
zwd+guc3r!5@q9UpsR^^ErqBIsZuS;(P+?)od}aY)VcC6w`lyc|KQ%s`DHkAz*Gwii
z=syA2Y;&5{+w@^%?upg1u~Q(fOcKe|SL~w+uXLje+F5GS-C!bjob&a+cvkKGmY&q5
z)S>)^$ji7$g7Y%6B1Bf4NT>VTTaIMpk)OCYMTdW|%WOX)52*0~q<oCf$!f!BYTWkv
zSwkA}gNB2LlV9--9VO00$MeMGHrA|joo@>9ykZ|LWVACNM!I4;kc<Qnt^aSwevu&F
z#6j@t@U_=!)|(z2*^{Y1kfgCB>GJS<)0qC^8&YP=$*-g=oi7SYohF@rgb!G{l-wkZ
z)1<*4<PV<w^`6K=0>arX4}q&(Yc^Mf647(Z$LIE{hc8a?AG~cYt@ur$UEbprZ)piW
zwwldlZ*%WwZ+FwX9AO-O++?`CxY1xG>q^p$>Mbbr)~j*QjTAvBHLnTn)nCGS`VYSN
zm_VEEOZroSmOt%o?qS8<%}=|#oA5;4fERN}%3r_Zt*edF!ir<K5#)&tUl1xtA?W;I
zK{?%F{f0Ei08&7$zxjXI!#AkKf%0jzt_e88?UdpV+C?OGK5b*Q%Ipd}HHPcH_QtY=
zW}+oP7=ZL3SlBodpil`0b`Ur}?Krv}6x*%VED|H-Dab)4hA&dNvxpjxywhMJ_i_#>
zI#B$AqI>GLgYHG#`$Hq*f0w@h;7N6Fk4R@Xi@7doEt7(&`D(1^8q12>&G2$|j9AKM
z$0ADAQ@?EC#Pa&Ja92RUpOU<++Kpt)UuEpJSt3mqhJ{RBMf2`jSKCOzFB39SW-tcI
z8Dakvjuv`<j0LK)JF99RR#mT0?0}dX=$+bUrw|~cY)C<QFZvvI-5+QrV~JyQ3*PFu
zre-9#NziMfXiG-7te;amPd-Yoqvm(Xy4S4QQ@emBJ@)#j`H)H^qZ+%&ym@pwmp7yI
zBIE2dXIeRlG+U~i#r{x*p6Ow>(}e0a>-C|3-5K{dXK#noDUqE%2UjO<BEW!>a=(x3
z!XXAi^fBcaCaFt%APi@i#ZoRKFlg_D?~{AckVB1#+77!%5TuI|xn7B2P`E>3DbtdW
z62GqbvlO(FH9e%;d1>Q19Qr0{6ba&^8xw=Yxnb^krHkMuDSeM&EtAiV>|~uS<6hZ2
zo2V|}jxxP*i#^q{b<UzIyBq3$Rl%q_$CQ|X=0;NoT%(vpj{1|t<XmeJyj4D!D)TU}
zR+|K3ED2l?(0Kf1B_;2j<3jf95}i(Aw_{AxN(;dFvYj;t7@A}t`KjrJobO}4YNdJr
ziZ14DSFu0#W5PS1+%JMj*dt7Z69l>*T%&DgI2qh9i-awrr6f!YH`ppa($DC7{=HWs
zR)~41iq}%UAu`XFI&F=#X#kKH!r=%gU@>BuqG5<#k87i_iw9Njd^);F_^=EwVRxd!
zujj|GN9gtq_CnpbMy2UAo3L2c>w#_UkoL~jt0T+u$Sg(C;aF&qXxXOSWD?8tRBMk_
z;8ne>&iAG%K@i%h673X(>~{--EDx_ps|=mx$F|i%&(q;N*w<)E{`t(@o}Sv;Zrh-g
z%GI8GW_4{XsM4QV%lp_}UhivX=P#QYTv7?B``1j)?3qC$npjPb-9g$}x{tKCtZt^d
zMr6|N!P6NHw{si5#~w-Tj)how7<-2=h@Bj~wewQ^Yso3z%-^4!_QTWDe=$A9CQ}5p
z_H_gmA$}W*+Ku8ky0S<r!^y*!EN)l}AuCX`DQAXi;-E9M;r^sE4W^w2GnYt^8aPD)
z0PG8oNQTkmI(r|w|7hmcm-WR$IR3V2CzmLg#q++&yv&;vBq-fGlh1#}w9J_khf?Z^
zksXsBt3@%p`CWFp_w;_fYUlUrt{dYvqKWZ^dNC)@@c)G*6Iz{N&i$XlYnC6i{*xF?
z2J<sVIF(c(eO9sHG?RTrFvh&Tl&DA=Ge$bTR$$tO6(rsHgJG25E!rhoH^F~S2NaS@
zMX00xRV5igPwTC)T>(Y0sVL;$HBPM`4{qxB!&3__G@Z$z+cw2W@nh+)bGfnBEtHX$
z(cylcJ<sLLV&zgGyOUqvdwX&<!75AkjFqau)nHPy%E`i&4E~adx|ON?UoutsGnV3o
zt#N-_-uH`!nn$y@*t<igg(Ll&lTur2cT|Wqq`gv2GN;-Wh)J6Mj(cK|;@TzZ46Hg2
z6lN_T#f#R=Od>IGSIL*O9@q1ZB5&wRJXi13PcU&7fx!T3Q9QA3@j1R{7<)Q1veI7x
zkq*z!>BvF)RHi_f1-=2h^wBrarh*0{U29ooP$LF?I*jma7*bx<px|7jIkpO9oQvdf
z07KR(_?)tiHjK4ktca6gCunQwc53k|94%I{W0*yZg7sc<25SOhTQvYGpw2H~9~Q5~
z_XDilOYD@9>NKR8D{y>b?pxUJ4+6)6Rb4YAK`<mg7(a}y>&LQa@qS>Fh!QOlGBjRq
zI7TMyvuA1AQ0rYL+YH7ZSmb6cp#4eV8qwbn&kWb#va7%@bZalrE}204^!(ZT;ZH))
z&$fyfUMTxCc!Yu~6P%;#<xef^lh*Rex3=}o+%EAqG<23-`#uTyhC(Yx!&BxVF!+Xs
zKt(#HZ@HHhlI2Vj7pIcrAZrcMDU`aoLR(*DSA&a0N?)`Sr@U+`DX4Xk!uGkeImsdJ
z*i3?`yit`*&g)upt=~x3CH8xQp>TO4I;8;7>B<LsqUQV=(v;&gxD)OYJ3ps^VDdg3
z(Id*{m;U;~go*XM%;#FoHFqOZA^?`@0r1{{af84$g87^~N_TSXK{C!gd(MM&%Q<6A
zfq0(j_){-kCN)s^>+Er+pzttNSKU$4g~CM;j1%hwAsQ?0i@8gO*!6>s_(C*BW#g1U
z{6Z{=c3EUttMuWuxhn8*r)#|Y?6C_&FDOwP>2c2u+>^7$sp=Yy@%Yl0oV=Cc)lsCf
zi>qB&b?*MuwT@h{RjmzG)u*JnHB(2p&aFy^I5w>|u9<ez8ObKkKA0FRmJe~ed-@2c
z&*?MVSe3dbJ2je?xAe*Gp7>1mNEoMsWSia112`RS?AR`xyz@_i{#hJmW#muQE!P|4
zZJ^H1Hdz-bOL#QpNCHbPY)e#?ltrcfRMeqsa{QchDReP7E#iMS>AwNxzQZ}w{=Q7h
zXSUNB_q#=X2HmM^Tt%sRZ|PmFAHW2h4T9n=eU+KqKJ~0gfP)s#d&~=mq^hqxtdkqy
zu!d+V1h1<)Whg-y4RN;5f(fM(B%?`^?_j%^w5<!Ge!@YF@y?J&%u(`_vI_jijg;n$
z4Ze(v$O#v{7l2Whoe|pdwO{<bRV+KXZUDChvwsHuYImo^1J^sPs?ayJ%hVRLCdkZ=
zR||_YEMSHE(;fyS*47;o@t@c{blMohk8m`ePHaA~%G}-vc4jd4fk%rZI|W9fzDi(5
ziRUGQF3dMfdAL+Y2c6tP8-`K(ZsI#}zV!{K`p&yvE`kY!m`#*ANY=`nMg;Rs3<5Oa
zr2}47R!%#TyLgadXE8dpiry}>BeCd>+jf}fTWD^$z!E-T)CjMFDQ&5b%%YwT#DxX;
z)lnT$?nq2yZ?GDOAp<g~Le@UB(kfHJXxMS3jQe4Qsjhdnu~|3$D;xb0S+KxsKu$yy
zdu~{XrP*rCOh(z}!->+zSV%@#E_euRuh}%rD*}IwN1rFLHoen<f5!5QF>jHb#EzD=
zP{GXZ88=om6|X<%0p!cT`Ag$b9(1yvrdT^xAu{C=^J*D4K-XNuXC?eyaMo0bjp>M>
z^okRs1SAG7S`93ENhJG&Z4?l};$VQ=@<v6Dr)(>n<TD%%h+Wl`3D>(IzG54%Umt88
z9&Q~1wRs`p^<+3EV;sN+*KsWK*>)i_EV-7-OF+PCHFd<oBbB9Da57FeO~z?`47ypT
zZFCV09)+Dt`90AFM-h&&hgN5?dA;bdC%onFG{X+4RQx_+vvKYP$TADzNm*O}aA7@X
zro7GJ*i{XqlV@&|x2xv0;#9EhV3Ze%u9IC6GXP!{lQmXtot{5ogZb1VOR>3iX&*hq
zFgNZ&odq@<8f^?h%EMoFUhTa*RDRRX?f{lf$WKKTa(uR%HH&aliSJ9O#rZ-};nS0?
zp?tBWBQFdZQlM1~j-Ypw@<vA7Bu;>gd+6N4Oj`PY<oRlRj9-2nE$EQ5DrSQQr;;Rk
zlvvTzU3faDzO+6fUED&)x-QN|HMGWd8%4WpEWz~O38f#zLm=T|28{`VY3r(U+Brfs
zO~vVb^hilw8Iw`B!?wNhy=|5C9DtxRAtkBVebfzGgJGul@EnNp8~Ke6@g-+ItV_nx
z5UIX(HgdjSXzX*&hKADCM&>{gsd-*}`Et<>Yz5pTs~mmBuF!Q*Vj@P_UB@;ot&Mzk
z5r~Tz7j%83J$RVm2)v1ZmarN!2H_%9@wCE8V$_F<n?nG=!a#er$jTCycMg2ba5|WT
zl*^&VA&PoRyB8){S(*UOskBY}G_gWAAOK$TafYGEhFyw+2Z9n>*Luh&4dE!{=9zm$
zDS0}HhJcuq(1$%_(b*aWBw&)VD_pLZvA#J+^f>{{?Pb^xRBDQV7<$YD3sp6<NtZVW
z05h8nF@2jq?1D_j8SbXBtes9(hpJ0f*W&dKG=l}PerW{MN~J###ivY54OvO#DpLu|
zX_H+cLxBK*PQzl6f*`{1+f{wS3yLbeBz9A&GlQUxbzcP&Ob~ZP=~B9+aPFgb8DC8$
z;V>NdF$EwTE+$p21Unr;ZO*VMsHL2!{#)bb$E}9sTenl!bE*{@BjqJK9TgtTMCb=|
zarr?iZI067?Z*@yi`Y-Vx*;Xo>pQ9d+OSf*q^vt7S2)Pes4}N4c>FFX8-?f%k<>YR
z-}39k)6L==sp_$b`H%r3kZpz1bVND?w337`XdSJu9v!k-_3{YTZLE#={DpV?eR85$
z9Owi{woy1L6+O&9&W)BezmpnYF1Lcm=Ya1j(DU>3)P%WaOWXj1M1{j)&<}k~50raK
zxNMA^dCE5ub;vAoqss{20kG}|*t&p-OdptMTLA={NWu+GVzhWYMV=gkq#@zxa{LAg
z7fKoZ`qS9i^xkFYLyL8#G;#^%U#d7_r8JCIqEDc9pR=lkXl&po7CCmnbl5fEIo97-
zgL;MMiiEfm!LL|1?D}`#|LN4$N*d9+aY*0-$1_JQtr3U$Djlcr#@gLtWl&l}cUdQN
zi@ppYwFnMbZbR($aclUWi5T!jM*3q{J~Dc$+Y@&P#`fVMxAn}<X|$_RWL@iY%&?TU
z*)fOyLCYkrvxH(fip^_eP~ms}R>ysQtae-RrQUic_QrQ-oTof;W<1e4CZgE5Z9V@C
z172D9qEOS0>8w~xbt6KvA`AqvIQ)JFPoyth($kW2ot2#_Cm^kaL*Xr=N$ikp#$5r*
zh)q04!jG3^V9z{RTX8Hz5U>?9=%V`nneMWT?>B=n9BR(=NCaYC;*OK#q*=ml(Y3++
zZaGIr8f{pC&RC=BDa3IV72g;ot>9rT9S$Hfd=o^?9NC)2sW@@w8@Ya!j(;tcPbweF
zm@u;!0sfX>f;@vq)@MeU_-sm6RhXJ2nF;9G@vqNboK#*=U8(GG(rnc2DfZD9Xb30;
z;n#YFyi~6qt*@6G3$2FZKp}usv=!`3!48nekmQUyio+rEWH%JO(qccvngBV*gqhn|
z?N*%AO=w{BT7NWg>H2wd*|#V0`&qM?p2I5fxux%8|GJz7MlnqEY{E2H^Lgu(s`=>4
zM9^?pu|<1^q{T2n$6YgAj4NiN4=k-p=Yxx+LJAt++TK;a@#&NE^<!P$=oQhILl;IR
z90$<j@RAOE6^x3);!roI<4phFkH+XdCG^O2Q0q&z6s`Mfw1YMk(;9G_l$o-Gf6Z%-
zwVHk{Az1C0rtsAYRk{-<y<jl#M?o}AOqf!gRh*AwkutP>1;v(>cxxVByCiaJ#F}j4
zj|6Qbf3I>&;slccXMpnuH-DhmL7D!}l_&wzx%KW1z*uT?ShpB|s~~Td_q3Ja+|G#1
zSt{`+k+L779urj$%={pNhnNOcoH9+AQqBOL3R23^NLyvJucTpeDN0L?XAgdDm%abm
z!h{1I4Bc{Qha~Y#EOD#CQdzXBCUglQbTr~fV0+!)k0SeK5ht(XMwcwO{;Ql58xBn5
zVQ~_yI^Ce>BXdHr9=qYFL2s4NT41L!V5)l)()+5Q!l?D46rIyVY?%7UdQren4ZQ4V
z$V{7BB&JT)S!Y%-TBeR9q0%vFB$Q~;>15HI{%>fVkQjoDaFKW=biEIJ6``KAhY4Q&
z06SUaoW=U80EM)&vAYOJ_ea@9^sG8cK{L9iM$M#p{F^(CwRd>{+tzhKCS?HrbAe<b
z{6_4Xb`<}053d`FJBL4qqouY<<z;sazIs2izN@Hf2e!V}#7o{d*xla!aoyYWQKr{B
zMC?sbs*yBfW-f}Fq10hbJ31jS@6Co;u1zvG&ct~JA_2_2+~_zY0XCf3<d&svPxr7V
zX=_O<N;&CEXfpe<%vr-Q#A^h*!Ng1#AST5q$E+v%)uZ?Wh9|b<KNLtfK`E+(&}u^B
zxj$6#3IfVkZ{kkMKt#`$v6O}(&zn25Yz-UTW2L+#yELU)@@<6=FzYJXg<NRh?P81q
zt$-o7^KmdrqG?Rw`YFeSQtMDc+cA++v|EDHN@e_gsJbLN(*4)3EW(>`re2}g13VPP
zwvB>Edy&$R$Xil{aSHE<qZG5zy3Ch*bw3*NojqdoXjsGNr+MX4SNvF9ztXj4&N&5-
zvgR8@MzR)>LpA}T2G>6A2?;bMI28L6ZIL5!nsSFB;ij-#{5XFQT=LY19b0@VcY^w3
zE_@X*He1hxj}rOs$B6EIaXG%Xp%?>7TsM|+`50eMiD?{K6UAf~f+j>x=cqV#OrL0Y
zoR#tl$$gC#);ZA~ViQSLuGJ&~B1(OR>p(m_HAgdsz;{k!+{(IQmG91Ds}+=kbQo#H
zHUJQr7k{Ge`#f(Cm;EZl%@e2lX+o=uJ!k<*g+C%wSF-NM=#xY-kewNM`x{4Z%XRnA
zKeFSI(tM{?KNLip7F3P61P~YO5tlisH(By1!vKnBf%o!!IO3WTkPxj>P`O6g13bTs
zS>yx{WZV?2tcxEITdaJ51mGEV;>G$itn{LeF@Die;VLkrg*{?Y3F6)>0WeBRH5J1Q
zy@;58BNQQrDBhGZZM!pn6=?pA?zxqLZmQc75fv6m#h6FvH(@a7)Ac{`B;-BM4CMA{
zfwzw6@^$;Zjs=7*)UCy#yBs?m7QVvpi(9)t{aLh^1a>IA=kQ{jtB$Lq*1J^w^lSO!
zf77dvTk9Z-RZpx~Eek6CdRtk_rS<u&Ag{54oUI_K4jWRv^t`uz+-Kv5MI*x09o~Zb
z!x`!4M2hEFXp7aws?0zt1SAhmN+XS3Z<L?PF~Ig}MXa{2;=vaQH9|Xjtq!9^%;2>h
zcOI)chPm0$^jO4PWts4bcF1{^vBV8lFYN1X<Si1EMUl0M3`hfp{(umXPQp^OH{{3E
zj%1jWlEuDicU_Y(p=P8Io#Vp5l&G_wR#uGTW}T@5NKRHyGCah=VxrUB(C;ciUqBKh
z2UnAjv5H~$D+^T}>q#8PD2+PT_fIE*Bpg7-JAwb6Ypxplq7+}hJ)H?+N|v5%J=Ggb
z`$`N;0Tcu%DyRz*5>hL;WcgDC^6hREsu%=OYN@+<g1jeH`69ttB=RL_Qr8|LO1@?q
zt#w>lrci|a2gT@Lfpkf>{27fXe(^A#qh)Gu*TRwDU+bcVU&9)Hcl@hg`(vZ_|C+TY
zje527yms=PT%{S8F`amw?4m}<3r+%S^QBrtJ;GvR@#DwEMV;d+-J#;5^JcO5)Y@?z
ztiu_2)rFwb2+K5D7fDXFvYuK}x=cAuz!YzdF7iw{o|>=Bx=4{=IA*1<9H&2%ZtgOm
zU?x2fG+|Q(eUpb6CTZdA-p*D-d@b!8YuHS{sr#(LdPwOg@bvS^aBAqGmMezc_;Vmg
z1xG2!26*4Y*F>@bhU#ux8FZFl-~&G{{lI;ezK|rAl+hgBis-8^*0`)5fy$rhgkG5o
z7lcg9z1Q6auWw+|<dXc1xL`9!xXW>tW^_R3*0HRgG+ZE5H_?>l5T`F3T?TMEpP_n?
z2#9LpbQ)u$RVvN57wa0Z3v$M5PdUqe{5Z3Orv^bmOYc%}_GoiE^;zL?5}tA50FHty
zD9r=`T{ufEgYT@2QQYA$aT1d{&EUtU^T3JQFdCvLgKzvF+8_%{<#Avf^7hh~nq7SX
z2m~WaP{qdr!;p*!iVJaY7F>@xTad*e583ba94I?0?eOkKMJ_5lv|6CkgCf*UuA&-9
zs;oex0}gk`abn*bR>>$)ew@%G<=<ES6#BbEJ#~tnSff`n$!AuAM7t)%3M%R>4sC`b
zp1v++J6SS2+ucEnvz)e4@$<7K(gtRDE_ReNRk5kV+bRni6}VQ}neFcU1?fJlT-OqT
z`{YsCE7kFTbtkr<cKyOASe}V`D~vNMs+?@o3%JKSW;hrvw4nOCja=(EN|KP&y{PBB
zGOih@h(GsZ%iKoeMtG`Wh+yG+7znB+IvH(yUK)fK7@40teHKM$Kn&5<DC(7!9z#J9
zn<@f!75EnzaNkdupCR5&L&ID{3QFCKX2jk~cy_Rip=lm7$hiN+Za28@1>=cQ?P?IB
zw^9~DqQ)6{qag~&&?PjTqG>K36}4*oEbM6roV<k8vpDl86qA=G2?)N2>MY>OdlxtB
z?2>SfSFIz`teRM*R{=+^Mj4Yxg0|h)8imw)B*vB9nNuJ;iTBTGFom;(dBbkNGy#p|
zVFYiZD`X$5lwynwmsIr%PsZS;;?xm|j}G1{`vP1AY@*?_?*#VI%&3Q99RkXMC*7ra
z!+5VG!n2teXOd&@RSd2e^Ie_>Gk5f6x-beuPi#iU1HZ>fV>A>N$(g~YNl{BoX5cg!
ziVuK}x&gvlJX#b9yH?XssK>ap)_55ypg2ngSAj$tNP($ZON;?3>BjvG5d56xZ`4=w
zY(*yE_QesFplTpz5u!KXJi8p|VU@+WjnSTzl(>Jip(1;HYdV5Pr4}JXqf@QPo7e%W
zt>_F06o)07)}J^Ard2)vAl_Yuc=g2vEmKL0CfPK~h?q_eUM)_~>UO%9Dn#dP9ZfWO
zunjqL^Z&9qZ`0FR=C~Pe1j~hA51^cB;GuWqORNjW#FJ1yW#XB&>(oGQv+uNwJAYP+
z7&h&6aeS7ECthc$jhnXb)DZ4q=c%L}XG+n><C&SH7saRc^qT|$T%1j$H7cRfN7#vm
zyBaCW4yi%r71r8V=rq^)()`O^SYywthUoAarlc15=57X!{J<o<BTG^-<VBWl9hihi
zZb)-Hm9Fq23vVzmDS}VuW-tsViDNzIca@i-c>jcSpG^6l99nTl8Gf63wa~I6JJ@~4
zTMlh+@NN1%?svbo)7UGw%LUuSad(II=|k_W%0edE6n37HgrLf-3%1mI?C4}VA{)x8
z@i4mJyu}YG2URzeea?y*#rahAWwKMvsuHM#YIygKN?}fjT-8aF&*-`c1z}3s0$aXW
zFXZVq`^XEBkui#zN-q9_4ffY;uKbE8DOHBkw#xJyOteizR=QGQM5L2MM~iH8S!B_R
z1uwi~_zKa>G%k|dmx^8(hwA5$Tpek|s9z_?WV|w96ZbF?U6b~Vjp+q$A(1l20fj4?
zEym3^md%mS$URp|JFz(U$ZE)S5Sqr;8#q%iD<iT6rdx+2wv>-ASg)g^SmCALD7q$&
z0iCijbng_yheutqA))csP62a);|tj*^C4bj;!CxP=-r973E~EdNqq5E=*QjnP@8=g
z!&AJ1d&q6q)i~H~l?QPAs(YC1k59Z3VobnM?W-Qy6hu*@>&L)lZS1}#5ZyXyO_&R<
zBXNR`-(b&G{%4~~F8Q=La1w$@iWkjzK;!vb);*$`OAQJ{n_dv~6HOs%r<}eA<;g@8
zV!|>Gcwa}S3Ys<-QVcIwf)gn0Yk(x8s9{%C2!jz{>nlj2@RkEeuFd--J}^w$Uo-{m
zZ$(DsWO2Y_qlG7YqHr;ZiWh@-E7?`3BQ66j0o0z-W!HFEa-XhOn5_@$)NF$o6P#uq
zA|D;Z-zfzDA1`_ME9&GQ)*B0de<(Qp?K0U~p#|uDUZ@n;JKq%6lvQm;^GV;jv(Ho3
zHGed;!Uc>`Sv$!V>OFddABrl#5dcDsAI+mu1E39iG)mS{V<{bB4}9N^6Y~@ev_^bo
znU2k)oNBe_KZ-{q9U+d^m2Cq^VhZ|7$*XQ?0LjUTSiJZb;m2grvbrysOC96N8^y}%
zis_zKzyXFtG44ZA!6oJFdCgRUZ50I5C=54M9*%(lK~jI^->}2csk)S<fPf%DlA;24
zJ^)b`QU$(LR+B*esh!p}j_~UajnvNJDC?K~Fo}Stxg_(a=jaaX`c5l^$_rY61TYne
zfeB2R@Awp4*Z-Q7E5xr1qkbSv4O1vHs%JnKUlbW}Gh?!v6ibcV!D)6eukTVrhl=>J
z9#c2HPoCNX`MrSx8D~~0!`CU=U>`6N*c5jd^Jo9Gc&8y`Ktn~n{mFzB1+J>%K}i@S
zu;GlIO0$5<1oB2udK$pY*TkGCgFoCU6*%t6p`~Iu>ab#iEym~s(rc>Yo8fDjSmH+l
zzh89%NpaK;JfUfNw6lrU(9*44&ZLnilszNW6qenAr!<pZbW8}H)i2Hfl+&lz#s7$&
zJ@i(Y3q)%AV`PV{xn&$hsEA`&Ff_nz{}WNuSq+yBC&&h}PVT0WXH4%<%Bt}xY!$1r
z8jPhP<ektXYdTKlD-?^hGM^oUJUw5`Rg{jB@lVvfh=kpU42QyNWyPmmmD$js=P}r-
z#opxhF`<(YIC~%YII>v8i*+C;SAKlz)g!iCQ}R=Oh#h5gr``MM&elSDYl7z_6INi-
zBwVn^z(_5l<+g8Mg<BUVPG{_^@jLmf(H&69f>%`{gBwZKg@)6W;}pj7-OLN1nSx(|
z6$o?=vuMQ|LQMVPPvdafZD90OWDeJAtyLAA7QNpja36|WCV(Tzc*984(F$QHjtbgU
z#|dx~0kPf`0VH6fC(?T|99xkWlWPVGrdI8$MC?(_Eg)MoLRA`SP*DK~3?>=dKID)z
z-5Yhu%1Ul7Vn^0M3)QeU9bkZ3bvEFnKxHNKifNo`3Pf!ar#N=*J}rv@Z*j3IW=h^-
zXR(S!^_Ay)9TVA|^7T|k4lH+s#k3_J{ODkig3el6=ro^NtLbla!`Ct4A=F_E3~cr-
zMg(%-KAf49LUnK*%_CZmFwTk9McjEb%!F>6<s3#1(DzP*D?lp2D7_v)w05J32smu8
zgM#Extt&B_+@k>=%F!Sb%h~t-IStY2+xFJ>>Ar+yq{|=<Pj3)`uK2R!p}tkZWTz_D
zaY<c>g+wGVc61qq;H*9MTH0m?W7ea0r9Bf)s?IOUb$|(GqN~rA=1qcPdv=B*4^>fD
z<V{-j<gs;P`%z;J*kJOleUdV;Fu9}PKYIu3-uDT{<N6+BE~2Nkr(?EEhpBTeujQ&~
zNNH~$J+crl*G39T7$kIUq*8sf1}^S7gl^F5K1a5K9S)D!9*|(_x#_djNYzXADYa$N
zU$Z+Wvuz6OmV4zH!fDVv7m?U7e?BI)R{w>lWRpCDSLLdg_W>PIpK4%mn6cT?^L%Qk
zu`i36dBCCI|5xx-yfpp_JbjcxRO|e=ip@QQ;LKl7<uUosK7_0e{@)?=pKu6a!j*d-
zLQ8i)glb>4xtIRR&5Z;9zeDJoqtX{1LbshLOZPZY{=<>(Kl?-h335G^=H);8M6o*f
ze<#X+!ij=92y5rhJVuu9Bg?ezxuKW;%3X{j{J*2)o8!!kqvMVz#PYplj{i7(`j0sk
zUdQ33gxA!$z)0b@$(Q|u8#cwUBVNPbMk1LT8=+1|rmawnyE`lA4yGeTvyE*==6ERR
z8+EdpR?*fb(=jTpkNv9Gt$O|={7;RZS|<VuJKk|msbiYB<9}Y2eEH|CH2MEve)<2r
z6`%jllOo;nNmbX=#Wet3PpYjdkS)8Oq)|FG_2lmpZ$<ujDy@-SPhPb=4M3Gr4{iN0
zuU=C<w4`{em8z#>aHZyrj&PnhRzIhXLH0mNI1FnxADV>VL!%=xsufVSLfIHE)n~7e
zM*3#6!#zLksJYj#Ryu0+^eew}mvx*6{q(fMljnET8e0wCWwkTVTdG%2Y)}Rhq?GzJ
zA1AWVbv@H}^{Q<e)UW1ZPTtHYTuMVHtjdFKf$#Xvvg9wYpIu--yTC3aXMwqs)&k`%
zwJKw^gRcU2snd{J?sTOl1$Jnwv*r%bv?!mf<v$Ii^xc;~HNn<0=)c)TGboW=p<7Yn
z_7=_RWj<wbVkVjp8Ok}jvbPtd41KTWkgjsxIhfT#eLXNs0J#S+VrOiCFN|%3>yu{{
zLP>^x0*mlwWBc9KYvmU>J6zBH#^Is%9%OGmw`IEK`rH5g`}h6B_*ob%2QOh8{a~Cl
zeh=6IjG{cLAGIEZ`>2PbFK7ez+3M;t{%t*8Y1)7B-%|7O>fc(+t@i55%H#GDlxxH1
zmA`q-Z$8?be^a!I^t``KyMT|=IpuEo{=f9!!|!OFlk-Ahir(ENBm@t7{=|FsY-{gL
z;XS@YvHyox+q<u~4}M6ag!hai%e^S<aU41<EV)NMd9`!TTle;fDiHiSeO2)xJo8n7
zRk0(uAUZioNmY<sC;K{?o-V=Jc(|H$&4%Ao@oIFuys4Nmcc<Z?uiIw;5<J5OAXeba
zej2M|lUSn$LdFO_IJK1jM{Z@Vg``=ksanF-&aNZ2GFZ*@kIiT1Rf9=OcTguKoKp=g
zPg2$36*_c|IUvC7s=b~T8qG=!$02%;&s%^V+GQpA_4w1=+T*dRuWFCcrh{AnqdP&k
zzD`5feDvr(eHirh5Ylsfhsu~$)yr8Z^eE6<<qF+9!_fr>f8#jF^#X2Mkfs?epBI1N
zhaZXsw7lx**VZriRv;V4;zFwki&?OCZ@KV*wr$}79p25tgQrgmdjG=Lpm!d5#UE6c
zI`Rcza!Iv4O;LEGzw)Lu-!}Jl-)#S=KXd=g=lz4NH`^cdXWnk+vrs7YS@xCr{(9qR
z!!BSpktwsiyZP?@>n*z&ZyHnN-S#W{Gj9&_d1u4vMXzTKZ_~Uc9I!sUdAIT7q4_Kb
zY!%qwPZbdiwTgWB;1&@Sw7UM93wS?leK<PU=&0Y;P!ngM>Qg0!2(3bp_`UyQ-Tv4A
zo5TOr{qguRxQXKW&2aEFZQR2DwH`0EQv6@Dy}J5;{NKOgpU~@dZ}Cq$hdwVB3RZky
zWaftcBo42Mt@Cyce>ptb+FAE@ws(L0d3BkDzRmsj>)!R+YDa$W9R9Sq?)k$${Z3a}
zYMV;o>e{MR<(huosg*lG{i5E&cRGVQL>SlMC=N#Ceo2=OUoxC~L!8miZ_%&0FbcxQ
z@k*n`IL2Cg-dq1TOm33Z<&WP>3*Uc)llQ54KTTqK^F5aTo@$4uD!3EP1qH+Oicn==
zV&}f0097RzU-{!s*o&hiI-Phwg$Z(%hm&bPjJ(!zz4`H{&5xJ8OFvEkLcQxxir)7K
zF~6Cy--F{A1~!U_wTOpa?I7uS7_I86cD1@(`yM9b``Q_>rSLz3kyqz%dXuSxmdk|#
zZIVvXi^K7RC#vfw=U%Pn713QEAr#%$^@b5W7VHJ!a@5RHo5AA?a^yx&IL#6E$&%kK
z%6B8#*R>1D({#uEKTrP0q1OEAb>k~(3=;Xrk5^{VfBfgtfB4#J{>@wY%69Mc@Bh!~
z|DD!f2tzG7|DrbLuYarkxSc-#TPv-{|9AfXEB-zF&Ql7YhnRMNR~kvHJoze0c-3R7
zN3nHLwxW0ma!bl7#K=GYL#uVL;+2Nsq%oa@g9g`16cW{w^KzZq+Kk3GoTZ`l<Vg!1
zFz{Y?$4@}AI0xZ)GD*B`s1#176N<NR1aiqJ8boI|RDU01zb71Llzfw_<V{@lD5x>~
z1<VG{r3<wsQ$s*;;?PG94x1|qv4YWjCK!{TAN8i@dQsv{dgEz~?(TRCj4s;HN0^Ec
zS}UU|4LW0=20>N3YjaejhgPbIo*v{VnuM4?dOQyNm|S0>H}KhHwf86NT_r%WRjE`+
ziKf-aGf>4f7Gpf6230l9Osu5MJN51QQJs9cReEOZTpu{YNl1?16rXxL?GC~o8Wch6
z=$kDr;(C&;Bo=yl)g&q3uqwu=jze_l!>a<!OQ(lY_f%KdeSH+AJarNio&>-o(-4SO
zIKUq1)YGcn)berIcMi$O>s0jdX1^#Qvk_`=JtlhsjCDO64=`XZfWpPT5p;$1VrL?3
ziICbegpr|RFn&}{q7jv65Wb2Ng#nu|W5z@8Hyq$1Hv=>3#nXY>Jec5&gAp+w(DNnj
zHE%{L6Cw<X4@O}FI7$WOe4((=)Y&7ule9gxgSCo#^y=`nhO2fqMsPr-lB^K`q88yZ
zM(p5eM6W%HkDw}JI5g@khAr|YA*O5c(GeWuv5AY7C~c{6N`bI<xR_`NCJzBxfgtDk
zdT;w^|6uP&if5172+EP3Ozhbwi;+nA%&ylYP{DG235SNb4qE~iGUnKbiFmP7=o_>K
z=||z@d2!)S)mH6uk=h?~lnK9^M1$!>XJ6%LpA6%ibEk8p5(-B_0dzgeT1p90>KLjI
z2Q<9I(P29~KT#{gOK7JzR&O`=>1}U}Z_j~r=?`yr_FnThd`+LDtC9J<_w%lNhS&7@
zEH+@@{&*me@ilzrxKZ-?@aSNhKhtaY91qpEgB|)158>_bq94Y30RMQseZXVD*En4h
z*dPhIb^^N_AVqmzESi@cKR&}3xX!&{A7Joo$VmB>9<<kdys{#rq)##=d8Urab3Ej_
z+-a`{JooU@Z6S$!ShAl?=ua4{&J;N0<gs^6`p)m3d)MB{Q&?D%kl5L~g=)|TwO-jX
zUFRh$Vv0_WjZ66vLsf*MY4G%E0jl)No@xv8F5XglSoU&fVxgUFXC{ycfv7oK&`5GW
zAZG|fP4<FDrTYO%%AQ%J1&wgG&DrF6rR-^>!KwR=_B<@ZClAk~#iRj+8jZ!@Zh_Qw
zAZeV;0oT0)IDm!Qo-hT_spt`^a6t^<Qh4wHv23BmukaciUP<`y9xy5+iXRzKI368|
z$6H!kMFJ&k7e?cOTI=vX#8n0CG@RErY7P~!K#o8t&FLifj}^H}u77~xWkyKeh+ON)
z@I|B4r6CaFLI*Tl!DzEt7&`SA+AKVf&Gvv&<Q{vqzPA7$P00sp8^JJTn$#O2C4~pj
z9DTr`On%5o4pee&4z9_mbl6iD&#&Twfbg&n)Zk<|E_&iAjbWyUdEyv6>RKuc6g)a=
zF~W{Ss#ICL0-6_!7TxvxUV-u*QxhfTpQedwtZd@cELIkQ*vs&xd@Z7xz(>FunF*!}
zG70YbcwE*^K~=<JygE2ZYKn1H;G;rG0iIp&KH0i4Q)@4{hABPaZsDR+)B(F1SwQM*
zy(;mVl4Q+b6YjI8a!9JQR>XkHSm@O4M^j`$C|o`V2vb!Pj*dO_Zzx&~h0W*##|~nJ
z#DPttmL4-vc$$pHZ)(TWME;f?9F0#lC{hCDr5|w0WOgD~2>}!$0cd!ohzK^$WTX}V
zB~jT2s!x+@ga7=xP_0*iwx~pWCJqxpw`SJdB6D;DG<6jYALD%?>H~lgGhw@tf9|~j
z1nxtxfO#5T$T|ZQn<YBD2*)sI6N*ZSY0!v?)cF^tq+!EjuFm`WJDgLRKmb(KdsY&N
zY`-~tzWAW9SilG10pL$<;ZO7NGjaiu`S=-m>O)+%<a{xam?mtj>0zk`r#-_090#dR
zkQcvSEFj-k^JJR;<o<lN=lX}n58wZAwkSV-{T_b9G)vnNH(o$S4B6f1i;L!{UwG)%
zfJ<$9Cmx;j4|FN0sh&SC{MiBs518Z%zRB#ELPdn3t<D4o7c`&bmd)8-`As*9Ov>j_
zT_NcU$hLZh_8~t0{qF@s78EbwQfp7@sjpP=DVuIlg6OBP7ZH#JhuMKyaQN%(a1=+7
z4@Z5yOMjSAn$;ivnhQrCEfi=61K6HLBEH5<FF3^82!r2RK~&uQa#U~>UDd70wz(D|
z#-2@?kiI>)$P&CVWGVl<w~%3AU=u*`2e=WO7JthYRWzLC6rXYrl1Oe*I~X=1-5|ig
zTrgGP5DAh=qDOF?bB6O0-g9{Nk-`~CDcr4<8C4};qi|xj<p}W>aKJtnvebA;#tjP#
zl;d-Ua(KoZJ5Fc*Q?Vd9EC;kB!$@x!i&@}}19Ld`iZKTT{FA@HHgD3`hoU)}kUl|7
zhmeLa<IZ75S-MYxm?P~>G4>y7l^ElwA}K}yC(#*#gPn9SfE#x9>O7+Grx<2c#e$NE
zI|ZGCh)pl~B(MQi*&|}84;l*1tU@nCeY>JjOBLtLie{neUq)2`gtY;memPm059l6r
z<+dK(nXu#nDzNjDLrDf272%W{*oS`Ipd?ALgmr@DYO7KAq!7uq8euaf3kB&!K@4>6
zssFu`{$GqglWF&hbj)-0|E=cg<JG0C{=fNu`u~5$KU@E=bNVrNN)bLqa+r2ixFu#Z
ziBoko`0ZM|*;)k-H3)zK6h-VCa<O6U^Y*9*$dCF#m~v#$uzao6sx_Av3rc6HlJcA)
z7^TmBs#E6>x{6Ytf-#T!4LAu{<IkE=iUB33Ks?l$pE3O8kDMLV+b3PN_b%)OqlB}M
z;+y20q)XA?&l<>6m3UAYu`a151YVUD=9uW0gdsjO%0#v)yMr-t)v8*RQWn!b>jCQA
z1Ltr)N_K<^=VfF~{poZ-I$IQ)w~yZLy+86cc7O4H-Z(he*gg8?sZnlUvbH#*+Qv|}
zaG-7-Y`%pW8?UzCZ6E!DXX~5oqus5;L+{Prfw$r9ZyX$LZ@z!Gap3L0KiJ<p+`=H8
zL7--qf<x!d?J2EJOyWBneF=~G7g$co!b+-CIQWC`63rO-P``D}@LV<?%@b=1NeG2Q
zuu3T+o}Eu7<Ml@4>guX~Hk#I>_^dHt5J}?&cV+|STM_yte~H{F&F@21#9idJ3{p-s
z7MrBD<`RupQELr+y5_Mro#^a2kFRJuHpH;N$jI8(cf#l{C@Z=3tP2_50@Nthoyv+x
zvLyCt<l83cpo$>9rRRYo4ywqqX!C1spLnmStn!Zm%&jX|wf0S^_~ZV&%cWwO761E`
z<QKqUx(>W>U|r2Ko}rq&`a#z5g}Oy_rq2*6s3{bTZ_ac8IE>!zr=}g#av)7RoQ}r>
zW-3kM#B5PqTbvXL{#<89kK^TsBWhN%A5-cym6Tj%P{WQ+VCG`JrMM0yws$XrHEkg@
zH+Lw5aiiFYi96@JCU`0|v;?%S7i6O$-NewN9AIC<_~~5C_H`CAiI_NEHqBW$sVDxW
zKN|VxdiTJ~tDxI>Ieso&0lawXKkp8rZihk=JUxAG_=OBzx8sL*tqe#idORY|*zaAy
zG$q1(196DXMzm^@=WBESJq;Y)JW12Uzc{Hh<~E|bI*$hC!vW?Rs3lKx1t@WaT2coL
zPWcwPqD#{rh0;#On6p)7aEb%DR~3aJ2f%i416zf))JiY8i<NvvlyOg}UKbg0W)l0H
z({&os5$r3EYswNOVV?cG#zYoSqZ<HjrKw3>#cn){0Ati*tEHGk6zX10DyEjg=<t+c
zitk&Aa$(+s5e4n<of88fce$b*98viFgnE$q#@sN7r+`%tVAVQDzwB?-b~bk3zuDM4
zdVjEWP}|$zI@mbc-u<z|#$`xD_#zv1M3Qof#P8sWe8Z=4jmYYJu>aUP*xh=U2c2(%
zui}Um0HkgriHZ(&l|SAY30~u=TZH05v*;)Q>y<{8)O}<h{k-^5d}c5|>G9tF(e~c%
z31Vz*=M9b)`hf%7c(=WASSW1HBT6VwK+}8UKwe<PW%jQ*uPPrK^-s|VvQ!w1B})L(
z7A!x(^2mDCi1*Uvi8^8uEEHoo8FWwBHK+b%)%Ds@_0=nOzOgG64rssN^#*UuyHNCE
zp&$@(9&v{nQi3Uh6z^Dunfn6XQ#tgfn9D>M8A&#ODyjwC>d-u&dz@TLuG@F_3W|Yx
z%9?uQudv>ia8fX6T(RfH!clzVef(`<7|7x-8urP`(t;J>u=L|Z>!>MbifB8Dz@x(R
z48%cCE;g-eO<X(&7e2|)3O-Fd9qm@oT~B%ufYDhc7f=Qvpx$Mso_x&KQqCo{^9p;2
zrEAhgDyFM>Whw(_^duS!Q?0UknT%#CCt^3ota7TdSAOu&dyl*YNY5iYz3Jvcr=@aB
zS28`qtU7Y8tCkm93pkLXE=l((2!q~KK!WxM6%9zm{lUN)fNU}4t|N&6%W2|D=UClo
zeWB$vp&Kxrw0dt{3i6Uaq$O{b?U4}ohBhX`zVJZ27k_7yVIB#BYn2IV#i>1sA~xYr
z)stEEsWZq_Nj`T@%r{X-;TdxNbbcUp+}zvQN8tsrd5=h>BH@Q#DI_f#+KqW{aSsAd
zG(@#mmNnotGF4%NbVc(5^9sCkH|Ru3&W-S|A4~Ph$8zms>G;>$Nu@^r{a9XTd~D-I
zG0&!|&-)0vUi;_h8nGDm-}Jf$bj<vKfy7bRH!u2OFrgF}>IIx=@EZ$!1ZeyYhBYu%
zrai2Hzws&mjWl|JM6H|jE9wQpych)&``wJ6f!_^v6-)%0L<8Ug5?!!2h^Bok<P=RN
zK$2>`b3aP(Rg|=A!H}jSo(wN)qv+C?4FEG<)00PUx_%O3s!2lodo4!`mjgi%!pkhz
zXf8}+&Juis25Zw1=8GDchGk^8fn_)g4b^E<IxaZ1Q0)j+P73Nm$;(C1dZpH=DKMmi
zgkp5NA$^kV_VA(iF2Ia4W^+hF9BD5>`p4#eWZlQ?1!Y)4UK-8l2#N|pHabiA`qny&
z`#~>ZtGwD$tJx$A2hMuu52U(jo;W#l7(K<P@-gPPo8JS9-f|TX7?fVbY|oQx$DA%x
zcF?-)Qr@2rYRPm|0n{v$QN})--@%EBcOrDQ56Cir*l4<;)Yg59)XO3906pLy)L_hX
zU=71D;d?C!{y7DZ^c-LY6h1=7y_Kal7dQ*~Z-fE|Zkh)*f5H_WFEyL=u%sUP!C>NZ
z3lZ!r*n(VnIy!DIEuSa=Q{We)A$<zF{1=ld(ost1YM5}V{uqZ!PlE|>QLGQE2uJgo
z>iDP^3yiCTy2D*xT2<X^$-{X#LHvPdf^ytyFHxTu;I-;2y}=yu@HZL)m(624!~eqC
z#XfNvlTdZ%92lvPO829|7_g1oIy)c0dSRY~+8Ieq2(~+<o>J){9He-QrKWX^IT>-R
z*9`4qGzC$QI^*B)vi0JqJMjMq2qR$gz<=HCi^ey+*4@E0Kpl)KTI-E2)VCz0ZuCNE
zpGJ8R;-9OaM}NXm7nsJ|n}FKWNm>26iWAk;<u#}8nq3u0Lp)6cwW)XV;?_EGzw6e4
z7jr6|htq4_2>!SV+E)Kp)hBpfxm?WvN)a)Vml|uUH4vHLzvCWRU}<P87PO^$`*P(g
z;Vq}&Eq^6EfKfkQu01(XGa}Wa#HlYO<?kiK_{w%KO}onG6~qBl>L?aGRO%-hDJ7~y
zdAa_zYjU~zZ)mlWTDkVuz?=3j2;LV1fPJp|1CQ<cSM>&%w(Fek!0Ry_YBdT^b{6~N
zbF1~Q>;B*dSk%_zH8lqO9VPI>DX`*xUU5FU-_)n^ByS}1dnQMw)jdfc1E<m4U8RfR
zlLKIE6T)#~`Zq)c1rh$y1k=Bt<n(s9x^@9aGBCRW01Gn!CB3{3NG&URMb-|m2ZSTH
zxPk^VA}*VUJjp}vK(j@Z9u`X&eWt#!A%lI8u~-H4KuoGos}T*+G`~;oC_2L+fVz=H
zKXQ*DT0zYjJ-{1RJbPExns{J-^8EIb3wiS6-uddXr=L3AK)%3<jFsqbfK+Jh#Qa=Y
zHP5TZkIkoX&tExSeSBg8VetHv0)#INDE#FBTU}0p8!jz%+I2OG7*AdJZ_rgQhV){1
z+#Q?*{1_Y$x+na2dEAz!@p%cJt#6Ny;lHYx%h;p;F17hZ*O$Kmyum*(Bz|!Us6bD>
z<!cm{)|x9V5}IgF^QV5Rc?s|OOZ;bm1^dakwR(Nc1%mbkyb8u43>g-l-kpYh<S<U-
zr6&Ess;3jxq4PE196kKI!hgqOU;eb}$IaG>{J^==PsgJx^<MS=Jh=AHA{j!s^cYKr
zYpe9<3IEY$!!dO;{AU|Oy3wnP7VyvXG~k&T=$RP|RbSx&*9rc_@`t!J*nUmwJMKgL
zv$iHUIrOjpi7&eNAI-TrKZrXVBHN9BgE9Sg;-3is;L<(*(+%Vy=&FZ-JPZO;y0vPa
z30?UC%380Z-XtK6m;EzUBo6Ho_{%L2uRP&Fn_q4LLOu1E{<Pe(D)Y}wktMgtQntuS
z(<y>KGew@bMN-`i6Q7n_KW9G1&gVF%z^YSVHB~?_0zGFw+Tih5w!o@WAPYX}wmkP|
zwn+TAb>XF7*v0I5%1qMadg+O09`&bDtJ&sS@U*11(lELX6+%wrZ!(7E<L6O7p&6&Y
zw14PH5$jP%XD0q>tG|Tt{3K0}0MBtiBd95R4K+S%@G6RFsQ72prw6rt$Ng~&dy9W@
z%ErIbe+1+>0-kS-`&*u9;q){0RDP-bHjbzAa1;AO5Vh$C2!g#!8X`R@G7=9SWA|dA
zl$75~9#O(e&QTU!KH<mq@`-PrX#DuRL}vj#EuY9+`P1bugTR6%KbC@lZixnkfAp&{
zA3pS#zw%SpJYK5Dwbg6&I0z>CF`U@IF4xqD%O~ckYaTCEVVS*&e;#2^Cm|m_@OMQ&
ztjNQv{9VHpoWzRKPrIl`P%C^1hlt020`<409@^?5(Qhu7q+XbWQ=$J?fkvt8HQamG
zy%sfoO`5`+7QLGUqePC<KZxl6vDVBoW-jlf)o;w&;UKeBc<`B`D>I6&WQwllmt0L3
z901Axg#Q8l;mJw14lP#A9f4GZbB;C;{5|ifr&e3P(N9UMjWaj81TGu553Ciy8Q)`~
zkeeMvrsXwgS&rH!A^GZw{9Jk|%`VYtKU`tbbV;1R)#?hZ(S=e~43kz4A3bsBsPG^`
zOgm$4Y;r!OgZw(_`GX)^8%m|7`1;JB<P^N?V7Z~7o7+^-P4`ub5Aur-(#0R5o)g*b
z-^RT~FZTK37}z%NHz~P@g%opMYL!Wsx|rw-5Mb=_HV=J_fTt(NY^+ggm)RmXiu+zs
zU||9Y%-%{?+oMy;!5N%^5QOSVyhs6Y<3U*A4M*W(%IGgPcjCr9EP^xj(A(?&j)|K=
zl&6bE8V9=c+9C+`2%4$X;Qz|X(P(>=XO{5sw}sZn#dUq91;3rfKQ5B$SF4BnUJGxI
zj7QP~?$_;tQd&v^(WX{0!i|1rp{9l!M<d|quP9^iH%rK|U#zU!zeqN5Dl5>AaO1wR
zL1+QT0it9ayPW$DNQ(Rg1XfjH<5WC)JES4e(?CB_NtSIYy3S?HFHy8nFT1{e3g|5h
zIQk`sIQ%j}#$UZQO5om7lfEDKexIB?;b%CKbU_q}_@yX1=sEUpMwk3}(~or*P*$S1
zC@t~BK!XA~iCzVR>m*b!PnVh~@X&|T$4zb@r6+!frFS4f@!xBMDI`VFTau&nYY>q5
ztrn;BPY|Q*XB4UQZ!>2iR;i!3L#Y&sR{ZcpJy^9+z~Yzxv}YQHEcHB4D>SfH2t_UR
zjKUTbKsif43^dBK)Wsk0FlfqYpx!L4n#Y%I^{Dp~pCtTxZH;@2;u=37bH-07i|IOA
zYU6K~5NC>v6ZwcDn|>4=X0c5_TB9M+&Hg1DQi*TwCzjZ(0!oBS6+^MjF2!P;TZq_w
ztB|n&ZXwxjMx0B3MhVU-!XjO!*iyRKQeLr@W~vyAc9~*N(#0}eC!tK25fLv_AWjvD
za|^Ae3aw@eS&Js(UZ#NC6pMV>LaV7lc};<&=awSTFIx;{y;MOK|LmgfT;@z9N`Cq~
zi-G#{Fw~R{cqsKmLZA9YLLSu@!OuLKV+>_HeviVQd6L~DBA_k}xXkazJP{-n%F|L?
zZ*`Ik^$(B>E9OUNXd8)#RGS1ue)?Vh@SYv>W+E|AS7Vvbd_ZZ@{Uw9d(xa{#PxT{9
zkm{$%kW@{iNc{=qNPZ7|13x6IYP-aG9g=f;p+rIT1I0=ES!Py*OZ80BrTowUhd_A0
z4`!KA%ygjZpD1d|qf7$Jn!4s#aR4G(+Rt74$EEoJQm6R=a;F0fg-_?j<(esc`NV$i
z+CK#TC9iXGt#N{+QT-!SJOK%(>S@J#T+xrK`pF#3lW-6i(6PZbCAg~JD3DThl1$B0
z%RDCLv28tGE@>FPUVfHn)i081)sJgA!kNwHM-*}S363FiU~7?=zmd?ZM{`5yr$k^X
z@dpmPd=KU~eM?YfmiTNCbunUR?;IFnY4)Ddb-HzB7_1n2^4GU*t;HZZnTQxew%oeA
zTvGRyEYu^+R)<i?a1sQLy+i2k(%Nb_>1TTz!iSWs2j!%<OQgel%o<PpgBBLZ-cBYp
zc{}dOL*k#pSm0qg3a`h#-0PqwL(tH3W{+{g6hdL+JUq>j9#IPMhkfbvv>&P(UB5R?
zaw^dK)Oz^+2zYT8z_Z;2!b=6rjp<bPYXIv*cVNiyW~&n$EQNHH2`Lfj?^1JhZPt|;
zephvdFw7Z)7n$5$GK#gDtsuJ!Wm8kEmNWlSP%aAHOEzQA#b#U$b5jWL{PP?cAH_!g
zrsnV_xzu&SGr9o7zj=M3*+{JymgQN*r+$>P(5Y(Js#LRqAeu6m9L-b?2<-T>0zlS3
zvloy)=L}e?<!;1mO>0r(ym8Xjr4^+i#%6rU@b|n8fUnc@Ih{3nGWt=lr`J-x>ks@<
zFGqXCtc_ejOSS$D%(1FC@Ou{^>1Jz^{Ois&Ss11&<{=1Gy$`Bpfm^0XE^Ng>h23Ex
zZKlL0?MyA{eK!xE)-yG!_Xf8*3)<=z0DF={+~6gdekt0ER&xsZdcj#Qhx)r}NSaP8
zs49_}TdkL){p_{G2rjcLRHb%KrS@%=mhx&X-Ciw+w!+I>tL2aicsa8go7MfEH}}8K
zn|o6F<TS;~piH&lSXZR`1N@VRI`rOMy<l*v>ykm@bTpF|V+mb2O!yW`o`^vUCb55g
zn&h_3rO@)w0wMKH<r!7odO4&HUd|j?-zU=m{4?`(!jG!BHrvHYDH~p3l!pGb{9&<c
z7)n7YAXRcGBx!Hpv(*rp=C;Uq6n?@(4gn*<k*ndrCJ{2xX&7w<qkUHxZ3AO4!Sj1b
zZp6i~wwC_Q<vwztHBTyNJ6viV3g{OzW?Fr=8(+&if!Ex^>I_~|6%p}s4%1cpFzs8L
zs{i}hIOlFCT(K(*6JSNCq^dQ(Zqusb-#qjY@whu3DAuSOCD&H%iqx)9nHjTURksHj
ztTdaKAOz=Jps91s!TN<LDJJ8fn694JaRuO>=We=*?l2n7=4}mQPX$#a)Jtb;u)3Q5
zn<1raJC5{;_umly%;H|Stg4u_)(DUH4!78VCQ1VR!0%@)N)U&=B#9J7i4q0#^tuf&
zb8rdO)~>JsTuB~d${igk+&m*?Z_ZhdB0Yc1vY}^D-r?tRlUPQIpD#66nq<eWEtcJy
zti^9BBlbd`MKj$5oDXw09^Vn9>JAgT-Zh+CcdK~KCmh#Ync3pXycWr3eg<9Pk2xFe
zd`ueT83=Jcwu{YX|EZjdzf|LVJd;h=Rj`bybMb_%GU-3Ka%1cFtQBn9{d{uKPD8j@
zYR#xGqP<gn>9{?+!St*=xmZoLwtDaWK8C`NZ4ma0Iauq!ShK3H>6#C{H`^a}w$>@&
z(BMX2R8ieKfL+6z#uh=f9^rixwVnLlJYxCBYbQ^nynclDPnP)QlcjIdEt=!j(&}Rw
zv-9STbGDXRxwU()+}I}{8)apT&%l_Bm#hL&lA{1}I>U7K)YQqNikTWv%CLKAovFNj
z@J}9z<PxevWo`8`kCe_Z({}C0H3ezg;Fj-h^_>rH*@pI&uq;qXH2A84vd^O)Dx5V4
zW5y|jKNMfZkE&AbG9i`||J+HJi3L@CmK*TTavlLjCObL91HtihBd)auwfN{GQ1p&}
zlIH?^T-M*nwq2S`fUU$f^SBnGfuUwutO*~`C91K4$~#y1%3?kbhJFD?lE?N&(Qr7u
zle){+lIWT<54f+<!O+3V-fS~YUHYg>`)8vm+C2@I+DkdC6fGnECp)dfARgo?pqQtc
zPJ)Y^I<8||x-EV2ejNg6Jt9mRbek4d93rrwT`iY2b7T`K=2ps6$z@e8y0EDnp2q$#
zr?MRB#-UNFRI;8Q@T;;D?jEVXU*He&09S0Ol80Y&P>bmeRc-K9yM^rp@aw^)^raw+
zgdkeZ7+f6T9~oUQIz833;_-Q&)R`-c)ugztd>sbeD31ZeFPXYrT2)SRRpc(SPla@a
z)|agU)N2eUHERW68{LY_P(~HM%<ZQ>ajE#FDn0UhIU+Gx@1zVDp`fbMi-DKU6Tg<B
zPw+M87-cVhn5{dVHeA|NMaQZj2U*Z&Y<W<NgKnUtcbg)LyD<KFOd=>gt?8#Hd1D~_
zLtkj!l`G?}g+E%kL&t5t)SO$9+?D0RpT5pIJ7>b^T|Ulf8eT%dULiws#p8NdVc+W+
zW5sXzXSL!WE1r8`gV@|A)Mh=D&1|-_CwsQgQr;0iI?u-`mT+uwv3G42`22Wz<s`pe
zM$EM90Y2S4S<ORXw0A=XM}<#R)DW$^RpNrGv1pV`qI}5{*PAY#|EZc&g;nKojw&Aw
zV#wiKFLYGHd+lJDQ&xXdg_B@*Vf{@Pj^`AP-NMm$rO6gF(Rj7l%OihEa)>U}+2x21
zXv%}z!(*!++9^3u(B~s{o<zxV9u{OTpQxZzB8?RL7?DnD=FWx#e5NicN@iVqJ2%Tz
zOsasSCR&p(QvzY6nzJZ}10(&Hjfh5+8>8HibDu<V<7}3dtIb-<ui{t7-5lwG+40FF
z)P-{F<7sZKG8oH(Oej|H9%L3{N}qL=Cpju_bDFC%dC;iTeXsujn<pXh+hcT9xS;>6
z(m`|$Tp@~Lq2F7YryjS!z@|Y+SbvqhSp3QPfG$k<p_A9|)f`A6TAIjn+dPK$`@CM|
z!OCIO!^b)0_}XTL{#?i(HbLUaVB;s8j@;>A`SR(9dE>^pxm9H=#gmrX+Ul3L7KYrI
z%&z?-bid^f^edXqHA$hxxHrHYGBX}I#}5(NavtTilssehy&LzsL2glpd6x=2MOfuq
z-Jb|x$J;NQO!EAFj5%kfUnzr60x+kC@bL@!2y$;eI1qd@Jt7+<Z&vXyYTceA_%(l)
z$Ots2SME$HFmvXLs@%K3$*g-A3;*&p0xKEWV{CK+ai1)t@XuYe5V4W|@bUJ`A-e)e
zy!RA`<KZ#7M9k9OBw;WN^c7b;p&f{Sa<5U*+}KQ4vh;+E5tp9i-p0^-xAe6X&$XH1
z4^{=g{iL1O@tM|$NjJ}<&$g9!(T|Mf=hsL(%{@r^c?uluWdNTGY1@V*$kRyD><3yS
z8HAeY5yP$-m|@JmsBDg2H#whq;g+1Q<c%0!XZ9vqZReHDkQQTueHBxzlW>?sDh^Z*
z=cbAl(ov!qSn_xVhNrII+q%XyN9xD7>3&Yyv!zEzNJ%EKKgly|CEi)S7P1Nq?JCMf
z;OH!xhv-<~zT_*Jj&ewa$Q|&}Dh5>LmXg$Ov>{q@s^u(qezj#&ZE03(7jxQLn$=dO
zlGW03Zc8i+%x-Eqx2fD(c3b&ZFqvxZO$&|;*AV{9RNgyFbxY3_Ok&>o0XgnC^84|0
zG|E$UF@-R-FLMYYIy}rWYD;d0!(bBUSOBDGPuk>kvXrM37r)b)%}w%*?k01L?#P!S
zTV<|0wT>>TU|cUf$*0HU-{cYv_HvqCJaaxwV0CgPosGM$FBAoHjJqbt*C53pemIXO
zU`+vOO{u~-=Z@AsKdFhaI)LDWyo>dZIY=qKVa{%2Q}~;yrhP-@=6t!<VwGtRpK=tC
z@Yd2mS}yLF{&mjXDf+SW^Awhsc~&NF=}UdwU5>|<PnXy5|9Knobg9{@olbubCyBxh
zIgDm&@MfJ`@@uA<`YrWlFVC!sSF0;|9v!PIwX1&4EMKjmANg!ml0<tf<S5*(bMHgu
z-IHBY#3J@1%3+Dwzvvt~cXJgC)QthhE?_Ss4r73UukLw2f@de!ZonyPj?bH6j#VLg
zFU=w}<jzEVbhh3fS$~CasOvT7)N9VHhf9^CltTALOF?KB)CwRiNhvueC&!hwW7J|)
zd@IhIMCMkB<U>kot}_%66iSM2gQ#K}14=89R3%O#mK#PG2Rs^2;S{Vhirodlv>Ny}
z)h`!ZZO+h0x&=`-xm98r<~yLE?<$2^Rj|lhGzS`+ks5fHdG?Kl7?DhggdYn%lq~m@
z$O9e7dIMNZ4iWr%YZE6G!%6t)+=Y=bCNs{Elmv}_s`<xF%jyMrdgYLdlmpmZA`qFd
zLr#Ptavsf-{y`eakr%u>M+&-~N1~Vu*<u`u0sk8fwIUw9ee*60(0E)2>$MBFnkzY=
zCHO<S27JfMwDA@G*YDNfX~ub=Jbq{mx!QPU4W-4hD^=92GHzK3dLwq5q`W?ZIPm*7
zH9KWc-|>G`L81R8!BA8rN=3PxOh$@E+3_izSlhFMQC4dG@C+p0!MzU)saLNwV6T|t
z0x9@#81*p{_I*L>ngF!dway^r6`P93X^*j{vbE$!>C8k6uNQQV-6-L#kHw-&u<Kmb
zs;mu+8AR``ghM*l&;tpU&I!jcK(0jU>9bQVV}_loh+=vwL8!thwrOJQQdKLv8AjyM
zxykAn@Om0YvAD*u{~Q07SyQml?oB_}=f+t5q>6oFx$ct{lb64!wo(FIExC-BP0U_P
zvPb6N8k4NJU+eAZl_~)OMuS9+`F+#HK54nc^iM65-@^&AT&6Qqj>(WPEe$1KQo-W^
z^$=wc1Qnu8Q2t;N#2C-@GVpfZA0ByIyRW_NU2nsyR4rnW%77#53WKbulgSCx8cw7&
zN(5N-{8P*ah~?wuI?o1ja%fyle{q{s#FQ!I80%zpPfsXr$RpYQ+5RiF3b6C^3F9f_
z-yl(C6OLo=%kSRkf(zoR>jylrDmFkg-sWaU984Z>K<V#bI^t0E{WB?|kg;N6pW8i<
zf#{=?ZUSG72ma`ZTUI<{EBd)FKgcMEp4gg0x`+HI7miL-kkp4*9&}<0?r1zoPb1kV
z(AUdrU_0fBBnqBYbp4>GbD8hqWooDt@);lSy4Q4aJeVeG?f4;{@Zw+d3Okb@%4D*S
zJWrjZ?_l(Z)uVcASMP>^DQCQBFyE>u%zM~ZKL#P-@8l*^H@LWnbdxH{2>!62acDA1
z4icSeKT58pbIR@oC+1qAOEi@%3IoQdh?c~LfWfAz4u}X`R6kKbXvV*22n3(kD8XC`
zHUtpUxuRNbRH(`d1OcaRK$j9h;M4->ko)FG-0$))bP`RKzB#*+j-dG%BerCRP(VNo
zkPjp^3I+tj)YJ{bemIt?6>-r#uP)0-tVA%iRQeekSUT@a%}qK}b92l%vv)ndWXcq%
z{*MDihx!*XBDU*uYf?yaRZ`E2Y@hhthY67#*7sxe9kDb>b)G1N!ks9&2q%IOiXM*D
z+-OUm6wPt-)rhwtKSFcY`XxIY*1}0@Euw_sUkZS+KNzYF&DnUkdH4}b)9c6vlR{~M
zC6U6IDn~zX&KyDNewd_S5JNlkxnf@pdvv|Ze;yO;fU&zzb}XlZo75a!+(;+R{qTYj
zChnUFfsQ3oKaw;jL3$QO!KsuF<B6Jz^GKgdr_<hf68d<cV=R$jz`5aqdB^H4hbr?5
z|CCttvlv?HqcS|;fNNNsDyQt>N0VrQv=;o)vX-l<v`%H~#eC)j3Vf1UHq*p;LfA>q
zIU=qlB?%cWDU4<EaJjY?yVEU^?*;3xi8^(sXF}?Ux#CYx-2Ex*>)@c@)0_87_=~ep
zvf2!VQ)6UBBReJuc(j_i01)%%0t$ShcC49j^Is`e(0%Kao!`VvK9D(=m0P%6Dx;X)
zcDnZJ9cr(t+Dle#Az5m4{F8DA>Jn%lX9`%>a=6Gn!z9x$Q|lDCmB6Y;zpc;qC(U?I
zf(!lL82s|(L*56!7n(E*CJsprqnla@7Wk*0v75mFS!s*C=NGDg3F(t+t~XIf!X$Bo
z1HI`udzjqjE83{PCT&lBv<+nCqZv9pYawAj4w4|gl&D4yiJ_FA$YQV5Y3I_@Etr6X
zK4F)gJ#SC1BMME%W}(a-Lk$?SiMW-d9X4yoA>@8QaUr)6_^^~;<7QSJNzhCA^m>$K
zf@G4K5lTp$DVt8&xTsfJ$Xw2sYvm@4@9Bs7lJBTdQ=S?%*Ha_qj=@a4#!C}gruN6>
zFbdQM`k}F(L<9B7_Mj&td^5<9JrV>HS;wrE5t!_J;>DN?lCxd^R$KHWv!Myi3*P``
z>iH<Nm^7Tb>N}{AM3#l0QF3>+5hjYeMeCi-rY1?sG43y`FPs2in8Td}Y3S`VureC!
z^p2MS99gl~o5pc4nhb6*Dd#xxFk~4u9KlCXZ3JO#<raqbW6EO9$#}2)n`%a7?nQ}8
z2-nw86a>n6yc<y-c7GxX+81NYfE;qZ-${I9IE|u{G`PsJdMSZs0Zb7Ogko8e+G6^2
z%CLek0?9T>j0i@=Kx?3hHyz_$q>sTy@GG!WDh;*Wj29-DO3BY^rs|%Z_?y$tbfZhm
zc7GK@lSz1n3D|W$ap)-Lth>Dhysn@&DA+V$!Xm&M1(%qI6LW({tY#X+G)?M-nJUAC
z!@H^-WEty>r+Kd{aIQr0NYil=6I*pfs{MFaVHXpJDX_mL!7wz(l8$X=g%nhAj#3s}
z5_34)CmonK`$+{T%mJqY7Uq9i&Hs|2t=-_1gKP(01@9R=K%4lcF83V<hI7v?K{fS}
zX09h0hJ-Iv-&rlRtS5Q6x>k{>U7GTdpe)~&@q<1bNc&fB+5p6w#VN96!>4R`IqNhG
z#(5J>ITYPW>5n<J$T=Zzo-1gwjyZm5rn`Ec`Obvq7-<X8KSFj4u}=BFHGOstOA~6d
zk~1%@dP}$3)yGWNa77hnz10``p+AM)p`Imu5LWmaO&@Z?itDdefo7VWE9Ocn+hF=@
zbP>+@az57GGY&Bo+jT;@MkpjvQL8HwU$KIA75rOb23G8NITgz-Gl#vaU@}KN5l-Yg
z!09uMr)O5@BtK*xd&41|dTi0g45OOzl<O|hnCZyZP__S-%}VO8mQ5ke;>2_ZBSz^h
zH?q1v(yz}fW{2Da4IguvI6X*rU`c-^Yw+9|)VF9^_PQc*V)DKuXL@~6Yi!=LNoyX9
zSkc)wv-7J$uZuy5Cjr>yr=FnevFW%m$jxly3P`rOALtHG&z|42=9}Dg^EkvDib*`t
zX*h!;qEqkcTt476Az$n#d}!jcG6kr5U0_s@34^!9!I<kPPJ}xSdlyt?5S@jb<J&4y
zU>@nYy5pUFM`ztvx{ibol-8A$8V>{@owxLY6dNMdx@GtdSeL*HfKPNC;FRL~dR?j;
zq`^?oQT?6n2b}K|!$N;&ec_w}I&_cuuFY|Eq3mEJa+@wemk>^g{+a!qZY!Mc%6DHE
z;VTxW%*bhjbo@q5Id9sG&_An$%A;tON1F@kGD>)y1tb4*LMaiQnrs=RYx?QgQn%%1
zU53f6%VP9Nz4ZEI;N4H^GjPN!-;6nf*4o0@)#}~(8oHP?WVbaI7-pmRn?*PZIaN`M
zh*B4lly?#Ca}<|Q2a>GAs{n+gb+6?2`?d2Zy6_gSVzlEv4F>_eNW4Xigj@q50;wyA
z3;GxSH=e9}MGBRSZ=Np}-4dsmMFxv}zkXBuzS$n)fBLCHFc2s~Rkz@=@HhKk8~}!3
zLFjO!AB>a6?*S&JiF%FhG#vC1KN^zw`)nE{$=~k(517a1<Hsxb7qd{>f8nXUvbwzd
zx7Kp2y}GjUxV^Oew`RNDgjZhk3);H(zbVeL=lyNkosK5cIpuEo{=f9!!|%LCHykyR
zb3l)c2?&T|k_Kt5F>JT8HBtHpwtji&dERC;zKO}=q4nfRyVh>DR=qcI5O{~tDe0xX
zH_>#|CoM+R+aC2muC!1Y%hy2WX|@*&1rd~RTj0GpUM+fwfO$%?H|BvSWCh^{j$XP-
zheNr6<}Oh`JiUPz0A`BO3|RUO;$fmRG(YaX_kILg9m7EOr`<u=^WKF$V0QvcML)(j
z$vIGf?hQ%o!OVd?^@5Oe6H0%$q?!<TRS+})MhQf6=ynVeI94lrXu3w1{;DQSq8c_Z
z=V!4$#F3i;V)}Ukd=96Ks52(42k27zsnh9zxDbHy^Y+o(z4u2RCZhd$<KSRp_vn|W
zI!rtTSw~3Wa6AZ6YvRYTKbn9{bPAPswhlJmLXC}A+wZoIenCO$&Gymm*5RS|X79k;
z@b)(jj<z@7zuP$Q_TL}u?;UOdhjSPNYGw-$XU#1cBcUMH4<>#%NO;V@z;cS#h%_p3
z&<n!LfTP5ZZ*E^RfZ-2NelzwlGKEi3<pW$<73g{3Jv*OF#_Ns7)zww~Y&5M$@mXWQ
zAd<!l?#u>axyqWWEo@jJGOrI+Q7!=p3n?cWixI7WeB)qzy}+Va8=+kiv<r1zU0>3R
z!!cSAVT%*OM{i>~iLg|aw!zQ`L?87A(?0D0LU%#g1QT`XzR)0O3s9q2cPcA_g=5%;
zJkdTPkaQ5%l@M}E&jVT}jXXHM=q3YZVGJ;Vr@(K#*OH(|B_9KrTUV}X?VD2Z$NhJg
zOT{uT#2(O+a701k@Qj=Q&cf*Tp@mn`<Q#xK^-yVnQwI~1;1!8SS!kiuD=54*fIU1>
z`|1}V8A{&At(Ta@<<wCan@spAh$MJg3%;C%lX~J``lFG5t`P@bUIpF8%kgt{9EOvp
z{`2l2>UPEh=+)EH=k`HK-Pj)lq#}ef7|>zTI}a$4+cPd$lUF}T8-S99!ceg&#f4_k
zzHzA5D~)P(@wY-@n)qkI^Ww+Cdwf{;7MkAi-u}_{-tI}Eus5BIMbYXa7bS9&6*9`?
zVX%mc98WRp8??X28bc@#WEFWB&#RqRy;|)&7>qsjZyX~JM^lLJMMp|}5R{)_dBcI|
z@<2kV2Lm5%>X2%~$->8jQ~wg{tEIBqbMI{IN`->}&ANabo^fi5yG(YmP!NbXmx#3X
z`gx@VeOi@aUT#Crdf`hBMA~lI6E6|!n!pj#<6VoS5w*S0N8XGH?N$_4q5ke(K~eRm
zB$g7<$9i8v-eG2NS)UgRNAV3~iD1B@q3Pj>*-t#nig<+Y`*A{f1BbW*1K6j9t8=7<
zwDlGqdbP8O*Yuux{Rmc>h1nL$vbe$y!hDjSY-Qk;3xamCFZ8+;0T^9*0Ef;%6pElE
zl&L2lv$Y7fu~9a*JI~al9al_O^U74_p?5fm#&XglDeVFJpw3-jB<JDj<f+$<1OGx-
z_E25<o~{r2XugX=J?z`Ms^pfgWO_7&eILq&k+i(fTEKx6J-iE2rRhRQ!Lh(t@JY7m
zqmBgaV%1`O_uOkfr7c!)8l6ND8{+%%*%Yrm5~o$UfkGV%h+|`KkzXuAC)!?X1@UBa
zvjdpddG&t#-D{jhR4f6S#2#79!mhGNbKSbl!3}|D7#^u~bV@bY<9<l&l8`mvHsnxZ
zj;aT{2-dGpvy9hf|D1+!0OGj`{B9KcfaG{+6S)B9st0p}r!Sy!73(Pe6L)1d7(`df
zoddgZ9{7C_1?gg_AHa!6ObITju{1sP0SAb@KJ?z=DHS72J-DfQzuA+q$TPs5Kyuyp
zetWxjc+}b4T&$x`DVYHKhg>cuA5~wF5$Ok~cr3D3iu(q_957Zm4r+E^^<@J4s}IBP
zK`(B2s5DcfWDIX*{sYZ+z!U*rP$(q9q|@tlV9R$%Fnqqq>s!S2#jC349~WLe^-A&3
ztDSlu7oZuQ()J6GD=!<P>0t2Gi-*uOf3-i9y}$pRG3Vogf>%URA#HpSP}!}mBBS0C
zU>^X4)AG-wo&DF_2hST&;WNDQ{=`Xn{#$7}^pgt@WL50W@B)#;tMvizxk96N_JRHt
z%XT}zVQJbmwGk30Bun~DU%h$iefB<mqPBEV;L~64?Qm)6fN5r7p(Y>kTe@F3S_E3Q
zfjaeT3k&lr;&juN{@IW5wt8I<0nQgdgrG+r5rK^<w7;zeEs6kJ15X^@HGuYJQyDyi
z{UF^_fD~o&a0&X;;qc};_N_sWxbm{r&x;H6s^0VDAyN-<Fpx)>Us0jj`>DDhd!!1l
z>7c1r%Z7#`OL6@a`s3*qP@#=yE%vw9^UmOZy|pJ^@5vKBwjOx6+e!;PuLl1gWqQ;r
zdj>H8N&b!lBpS+ASa$DVV7;O~7O=o+h<}k1<6lLKuZzy0ir#bY+JfqU97P>P7GbLb
zvq2*Y3#h_^!B@)ZKH$XAw+el9zsc-*qW|)cFG*1W@2QdA(cnD@`b@!q9`!*&Af6Lx
z;l3n#-#ffU75j)dPLXh59lpktTzEW_ZlQE`?*9?~Fp7Hhcse;lCzhZ;MXqYO)?BN#
zm&<rim3SkadX2h2nV=Gbnwz}>`x{4ZpD*Bl*Hsn5L*g9qHJw`TcQ<ynIy)PiZ?|{1
zkSNd?YQxl?|MbaoODau1zdhJ`x3zI-)sJV@S0&y0hrb*iZS9!qNvgW3FD2dTKW!Zx
zf;eF6U(RY?l~nb48x<G+w4r}4;_i7zc6Y!h<Nq3L-ns3_6PO1nkz{X(gTkW!j<>RO
zA99AKesxKq-6ItM@Jn4dm~O~2<J^z?WbpZJ`_<-ibUrUUKozRDkjA{i1325fXU}R|
zdvB~A44{>G{OlCy5fHMZe*OYq>r=AS>Ac^>20ERxw8SRQP%0QW<&<@zDQWB#AChg2
z=_$Mb&iu6S0D2_7{%yhKb+!zpu~q|E&a*fGR_RxSwWv*ms<30v&^+j=@qR*XXdQTX
zl)RBi3eQF)MFA<RnLDg52m&PjpwL0mz%|TC0z0gpUSL7r&+Dlb*S`fn%?rU8#tGso
z*LQ;n?BVswIwJ-D^h)SxQ1&LkC<c>6seDR&!G_lY&~M;K%3_QYkpU3aC-Fig)yZ^>
zs&o%ikF#q78p~I$-{d_|#d=m5_6|Tf#JsG4!1M<7AJQRWDpC1_HcD7O0oJW|&h%^R
z-5a}+ig!i5Pl5qvOQ&nW0cAUkIDa}ReOMq;S`@KTO1v&ei1-angRlyPrJRJ_a1c&z
zbbiE90-Pb55e?yZ@<(AZBw34FWILZ=MuYI0=ADp3X1^Z=WCes;sIZ5YQ?SQ+h!B2P
zSz_@e2UbNIs1+mP<4D(-{@}{LNs#a(UkMYV^U~Kb?nTm@44xPHFETafS9Q4<>0qk$
zV&Q><W}OWXMh#UOyW8NCvQ};+NX{1o?2IzgB)&^II_uRX>TiVyx#&;*VvMFrlsmnw
ztjeBqDs=&Z$Dt}zamr*$P+C`0Bsm}C7U|kWa!RbYK&+rcx==tl-tjsNr(Iog<qgtN
zDg7FJEMZN$Z~IuTR~D)tTU9nm1Y+io?gDAVpz4*6rJ(z<Od!StLkAl96MOY};ZFwo
zIpx~Srum*Jozs{zV!qg8E5to*M0d!C5YvA$!IYgsn}ig$fWqe>(5a11o}0ASH68Fu
zWSj^nB+SX_6c3RyZPSfc+x0tQP(awh1_+vNS>wgepV0K`6B<K&qBxqL02wNu$o%M&
z_{h&X{E$1OmFaY#_ni)`MdqxjIXmJb-iyjfQ~Rf?2QQg9dcc~DJyffLXzEQTNS#8U
zUMTs3Ji4{H_vQ`IbVFaus7vzeNK8tG6qoB7*g*hOH}d!!5i`C#K{~ws;iZ(*6NJO1
zBh`J)^M*{Ug)H{O$_IrMuLIP3<E<_%7ZCfi<lburJYoDCgJJ}Fb2P|ttnoBy1l@&3
zV-a^+H@w?MD=r{Fb(QR5?;&6wDT%r3UDzI|KW_*XS2nkNQ{sa}b$S}aWNexQ@qjfH
zoOX9|J_VKmIdCeMz@EU9Dh}ZQg)`}GbcN=g#FBwz77<^7rLpcs5RX8ZQra_1wMT&#
z&~25m0I&y`JY{+7)2TTPMYG_aRn@LZCN~4t^(r@w%py2^1kFDWpH@I7<@q93T}&^%
z`s&WU;#6!3*Ep_qPAJC&yzNa<BCmtY(5kl6t8qv-3Y+`yJ4e6lZ#jm+wSR0K>~6iQ
z?d@+JY#eRx{wPe+Iv?h8ofCtMGU_8I=1d>W#yK3Xz_H<Ls+8YM8a{G(s1bsx6LI@b
z!H3Vag+HSN2&&8kJOMU-hU3=OP*&Dok>jT@W_c$u(q&_l&c*9&ls+4?6)hIO()9eN
zI{_4WWZ1*odm-iT-VO0-y{#Yb*u(WcU4cUlihsO&SBw|!ZM{LiTGN$0&<3jb;NAxE
z5dC@Y3R5}%&IbzkHXirZcfvRYHx*e{JdkheVHVEJ{@o4WA^B|IallyA1wf(J*7pwI
zv;+hzk(@T!4sW?m;b>CQy<tL=@DKEwxdhztuP(gBKl#dPVd=ApWFam^_lB`-U?^&}
z(d&T_C_W9F6z0BavBcvfMj}MaPB*|D>z95=o>^W*aV=oTjTZ4VNAYxZS-XCK%+jCs
z^aX3{$&(cfdSr|cnB?I>!Co1vB8JxE?)3c|B>|BO!#EsEge0JPbWq*!i#VE|os<3?
zC5INBG*=QwiB<S40b-~PI7!g-vI(Sc<K6z-jgF$A_WY?)(+o0eDyP7&bXCU7?R_i(
zt6EkUHBk&)Z{uUDF~%c8_r^#HZhPjmDsKI>?3LQB=IU~}Xx3HfgSahqY+>R0%H4~<
z+uRV~s}20`+MSx923m6(2rgHg^7U1zu`#d8YJQ#l&6$<PJwILR@!e`Ywrf#K?YZM|
zT3O{*+VjV=>b6l|+k7RpW_Jy0t)*&hypvk5?o(^?gVcI`k6KSQq*4QZJ()YUCw5Jm
zjitHs=gh_9`V*-!uZ_n~93gDO+aJ|OhId2-Am6q3jja=v`zcdS*q3y{quB*d!(h<&
zY-0|o^C4Xa4ODbBV8DYo#Oq3sr@B5WRW5@8Rc+PV$Ymv75uS=9rYN0leb$)*0uXxJ
z-hu!8^?3iMqYo#{fKFnNNj6_^z4`I&_J953-Oldb{(m1F9=-qR=MTU9KhN*>`oZbh
zdHDOqU^t4#|BRE#^z!QZ=8xallOB~YTOYQMJh~MV9~V5%<Q(uXBaAaNp0dB*C>qt^
zK#BOO1!-}ePd~b@TLAfsZ)g|2rkslU@=cwO8@S>h;hg=Mz0f<mM@q>D@&rl|%1}O>
zEGFJI$9nK$pKRpdykKd744T58x4(C|{Q(4qE}t4NiSK5$AjY+V;%9-YR;RV<;}rs_
z+}O4S4g+4H5CcN^tcDXsw2A~pJtrHM!An_1Lf;yuEa7gttN>AFYn<yV&Gn_SQx#X8
zqKz!oSKP`Q=)zK2f4{r^p~Gs3&QI&WG8neR&R?gTD_mCQc*8$IFvok*$?;)wawn!n
z`_80b?F>&a;KaRP>6~6E_WiK2^rUG+P${omCwI5jAB~@O>^dr}xpK%&x3S!8=CPO5
z3VX^sd>hD72iu36mGxHrxY=r-K-Ew9l3gOKw|WKRA^ReV*Tj6r5)}dK9It0xKv$^2
zy~FhsP&Ip8+68lX(0<u$t-sx_z5meI+26;yKn4yE(4o$Ktw5%d)R0%i5L0&BaOE-$
z=k2;8KzFtev%e2__B*dPYw9&^T>l~nez+R<!=$-XzZ(0e-MW8TABF?3wB^UZA-<`5
z8y7*DBwJ;R3ebpK+}(b+RX2B&#otN|zIo%@JNK3euPV`7OkKdq(sJi(>aRF*iRve}
z2q}3`17uGEc7;Z@-iL|5)|it9e;KE?+UtYEml%<99ix-cE?qTfO1^(#Z-8M{W>n){
zj{Cb^S$~Xktv`iHn5g$knqUT1-%onA@o$=kq~^+Ars>DV)aU_Uy>cHYSn>MdbmZb;
zW=rF?Q4uck52;U<isaY&iDcol$BU7+-%48`xvZz==-eNClO`&56L?1Y{c$u1DzjUL
zT3_9AxV8#n?FPjud;dW<4zI6+QR=-Rdlb7@M>m^KLbwHYYyv(tvKcDg!}q(alfZV(
zT`SxB*>|jHmc+Vk61mvsGhl`5>M|;6L=(<2@LYo`=nGmp;B67Rv!TYe(|NbQy4>ji
zo&sCZ@&@5WK*kVQtgii<i3E_l5w%6vT&i0MQ;B0QZN2c_b1!S9aAI3Y;N3n=_~OIx
z6gVR2jz8?LE-yaijk0~%0j7KVh-OFLE%N2-V%ejMp9iJQ&At7j!{^1~EqZZPf%M`I
zWXq0#`z1t7uL~zB;crNsh(IwqsxqGuU%uroSyfcrQ2>bDDlk@6HlCAE!yw|0IgSFA
zvf_pk=Y<egK~{h3$9?1U5nTH{ya=Ii4qQgN9UvmG(*e{cmJi<yZp3DdE^Y}~4tdPX
z0uqqr`m9a7^eraFQr{E}#U*WC?cz5hwI2fK7bKNWhs$}o7-cPyR=50@KlVq!e|ztM
zMV<O*I)02+%%|eX&?NkZ-r`HO|9ZEWGj{Z3ymjEUMkjC7OO@;ypz<Uz<oUD-ir~2k
z2Nh}Kv?|nCtzZ{g|MVKcq}LcmlYUAig)ICeE-kE7Th*oV=SBD22f>1vgA9da+oiw%
zJ!Sf`WEM^>nzdp$-m>BhZX2b(Cs27J@}_-8HC}9o4V)(D<Lp#3IQTdYuJ1D4eASbL
zlPTL;l36x-I}#!1#7z=17B)1SbvxmP1&Z9kT!t|~LQ8bK(7AyP4^*IJJzt%Nfc6}J
zRH_!qeKMI8@y<^D2#OfC1|{T)<B;PU-I!E=;c*a%vUJXJ1_NOaq_%{7D7+#L3);ZA
zB1N=)r{4lZd};>B+S7WgJyS$a&?4Qu7SRx%eqvK^*y3K*Pc>XT+B+<I{QyQ8kQWbs
z)1yaUYnmoA4cHxk`wE0ewE!UQjnFVdTV)K$low!=LXvHfX>tSx+U7=NwloNaY_Bcz
zc^rVCg>Z!hw_oF!a$X<hY-0LO-m$j`DdhN`ZL#u~v{pIw2Y{n)d*-FpqIvl>?SVkz
zr&?35?6%aqyr$^e9hy4#`*0*UO{rIQQ|et_Q}pdFv*=Er+dw{Ob0Ko;ltJ-zq#F}p
zGBfjze%LknIv<V*-+7>%nCf?f#&Y@&6m|N9iM&vuf-pKD;4Rme^6I^RcXY7*A-5(6
zx|!ejPa7W;jEW6JvJKn`M!VT=u5Z5MUcfrFmzT_M1yIGdC*9In?2peW@b7InJ|_Lb
z`um;j{X@cVd4Yqc7-X}g19d_905yxxo_S;jsjVP2<J`kA!}z~~v5Q2Hlc;|F!t)vx
zI*aH`KP}Of$RwismP!NIceF*r2<jz#^5e5!6?Js6SAplt<CC)YXF-f0O;Ij}1<IbP
z_SC8Nl&Z0*q-B-qmCmDN(!m)Z`*i&pr)KL_IaL^M$bZ=<bH$&^c;xdSyi$?ygZ{%R
zneP+SFnk;pxm(Arld?$HrDpl5G26@s|I@+pt>7=?<u3#e?AP*A8Licn&8hX}wsv9D
z+@V?dE1o%}S_{8^E|8IGN;Fbt?8Zv<?|;Xd^b1<ij)@tzPG7eHN`5SH^aeC1<9oH=
z1P)s@bg=I8-<+lZxGLls=K`y|_+CBrKHF5lnvVG!ZAT&#t?wiK+S&NfaS5#=Ybt_~
z4z)W24D!xP>-+CGi?IWO6Qj=nu#4`2owvYB(=NAqgKEK>5s;3X+xmFd1_(?Cl~uPv
znU2!RaEzL?zWJf?{=@oXoAjE@?-afJaZW9m8X#ZGZXG?ZIht>&1v1US(wthU(_!PM
zFx=Z+$7nBFv-$c*=&%=))mb7Xh`^yi8%h-+UMizWxDt5w5B4^<4iEPZp66)kM1ir8
zDhe{pu(!6>YBs$S+_|$$w4g-cfuq<sM)#wQgCDn!I<K~OHx7R3Z0{az9lY7t-1>Zt
z^<dmMreJV-&ERza-&^ZmV{4Y8!c1iUjKbn%_Xw7@6|Z*bZZBt3DP0FwqUxj?!(^{B
zTS;qfch=S_>#sSSm*6<Ao_Yb~@u!0&2NNXrR~{k|Fv1;$1;JqAdr(UW1j;l4q23j}
zKD=hI2o&YF-~y9WhS&5V4fs8L{wb%|6ICm(1*o&UM3j>LvyMQr%>k>?%xlgo@d07@
zJJT3x%Uz~(JI()a9@VpuVu0OA4RMy%L%fuK>l@o2UalXv+9&nadb><A61?)-^>)35
z;wJxS!4D9n4vrf8oA^qpL{zRR3_#_vgr!_=ytD8!pqtz^?;J#Jx|u{XkkAa!bN^ZD
z&2>3O7L`^f`E9W%AQ!Pui>#-utgYe@+zT#FaLh6K9IdXux@?uE9bLQjH1UWMx>$y-
zt1msaU+uu0{$x=YDfFAZ^iW08rjhj-dugW5-$#y9pk*Wv>~@>(G@;w1@9bhK<rVI|
zu!jxd4%1##<_>3;MY85d^I6gdmS+wibc2z)cY22IIb<syj!G2I=}-I*DuKW2bm)BQ
zjC-XrhkC*hm57CT@L)WhB&DK#QwYOf0<2ppasevb<Y(b{5bhngo;+6NH)AXPAcsLQ
z*2{v|I_sJ4mY6Y<kCB=G<$KP5KJaDt1}#${ONA?f$H&VntB+4$dJ%8X%xU|zZB#W#
zpdVgs6FnZaTF9#%S|(-8{k8t7m4p(nVWH)b<r)mvhUZTv0ALHS=ugw+XYB>$?eG1(
zb+9;d0<aG0-+7GACZhL(5j^6|4jm+e@p%6J<RZ0q|Loxk)#FJ}N0%?}6D}?)USN>5
zH|y3wmtdeW4M~I9--SlA@wGc#4e5@X+oE9Z`lo1EcNkBAfn6r$?<Ylo*Oe~VCCen5
zFXut1<kokov6u=n)klMNGFH#DkTIdby1-(ynK{#Mzt66vvq*pXAc!d>$hvNannx`I
zPuQ!y!@L>8blH@zCUyC{|Dn--*=(-As_)eg>ly6|Rm(Z$p8(7T=2C)l6558LuD9yx
z%ID+knSDNnlV2|q=^b)lwP(P}teC31`gjeizum9BSEGNs|NaASfID5o)Q_95)MZS*
zE1^-{Q>#m@m!5+aZ})khvPxOopIO7R%3FmmQblnrhJh+Gad$WSSumj>2Ks)H?*@9E
z-gw$k!C!vM6hGV~swA5<b+@5Fu+K!N8%~mZ5bQMoy!z2$9tbsgZf|7vgy&yrFO~Ha
zuxSWRn8zLj`x_n96SX=`tHN5kLMx|2%T!ouJBwrQAgfB7+IV2~*&4p;Gk`>BcJu9e
zlU=s(<LYwe<CXrnxS09Kd;FnC*y^>Kbqa~C4I+3566BHmgXF^bPk}@CO_<uxS^b#|
z46W;YCI-0}*3@_%+Bb)L?+-S&T;^udhtq<bj;*&KW5WmGb&R?UvGz|YXt^D`xKoy{
zQN%NxZWt7LJOY+wisGawjgP4W=;fJ89@Vn&8)~W1lV6-yf(nKcqcwNYZ5_k(Ctj&2
zC<*))$1!-CU!j$%(3)QXkZt|;IdOW7^THe=^_f8et8TZ8=;k)e#g^LXVxv?sNtKW;
zmMZnx{2;X`=~us-H3Cwx@*w6w)r*<ihs@M}Ryb}HftvHh_p{9+vRrUFK8xC%7CVd}
zISRucu<fKk(JqX=q}^$m42v2>ZBoEYO$;1$$&8I!5br`&36DHZPKe$PzA||cmp0{H
zEwO?mv>rxh5->|`Do*CH9svaa4oDqbFBhbOV<4*@2uKVphE?9~Q`{co!8eMA0gwj@
zQm`&y6to356i2V;)txY`s@(GznR#fn>g}Z&aEbuv(d!M`3G*SENnm(dgC$<4Vj%Qs
z4oYP$ZIqo2`JXZbM`M*f92^Ce{c(objY28ab$r9jP1-mM#rSW;1hK}zny{IzE;U!0
z6*l`+4CEKx?&KaT4=C`tK2`q23DVSmF7bargbJ_qIj+PI1T@N7uCkVrgmwrAUT0@>
zb?qONePk3w(`0a?w5_6~oWxU(R_C4<unPo+ywghBUKC@9AgLY)36MBw`JA0qp&n96
zHVI2XphK!GHwH>anmWM#BpP*x1I#hEy$ae6Rn3EtInnM3p`GeO`_?|>(f_$sL|aRL
z=s2<_Q7@%EivpO%hzwv2MvAFx=@})>0d)7frd+KHT?;+9)1A<aF6Br<kBtar$yRGG
zj~_odu|H(2vU4OgscHjst2J}0Ri3<jSy|uN-)e;FVz~k$U(<e<1Bb%sr$t2^j&fo|
z<At$|M8C@!2PKPh!K_(ea+=Q6Al0c=!4bdMqY)%xG4eTaB4N$<M1YoB!;8!<!`$*&
z1=ko2UwY{GJ0ZJ`93%TNXMuI=ZMG`wo0z@inlC5NbDVyfw^+nn{kJ&TNsi`yvwb_L
zww^qUN^_I23*#w>nEt?zJASXnOcBpP5BL?QHQbW?#r=?;jm@Ry+xvoL%(#}8XAf*?
z?GDh^9B6B^q1~ZtPS56a>|o=U$}hE@{dH%>Z-(PqFZORFJ@j0ct&ep&;};tB4;bem
z1O0fT_Ww@UBW8{X{=C*c79Q9QB2<i?B7i@Z@!EXR-26eQo5pO%vBqr2v4#WW4r4ny
zbcZ#0()?!gcC@tR0$2W}b_>IcuWIA)r<U7Ba@qP810dh7&Ar3MaO_z90OZl7)Bo|8
zHt~it>7<;<csIOxto=@`573J@@Ba&g$@g^ktj(8)U*~G5V8T(WL5{xyq&oo(=9*O_
zFiUp{<KZboXfZ&s$NgDl8>*T2(D%>g7l2I1##m`)W^}pk&gs8@{NJQSck0-7`3okD
z4*OS!uNzD7SKL|DD^0a4>l;Zg81+ATTf=UE3j4+_o=W2$((v#Wdv)w|#cIm6#Ma?R
zZUvMFV<uN|7jS6foDL{*i%|)OnD{eQ_OppShQ2P^be)|{bf3^X8v1p+lv*os*qh(9
z(!8Q!W*h%n_*v8W5Ki=8e*AfR_m;))-JD&88Sl}Z?cE=LUR}PW?l2skU9DyuX{qvE
zsxGxNRbd<4RufpX%upps_flIKp=e4hl6vA5p>mNOnbD%06MoKWC%1dh&i-xV8s`j3
zys|A1nRHE!dw^{kOUS0jcuVIvO=uTILfa`asgtk=_=|VB!Dt$e0<4SyF1L18myc#4
z^&MN--mvxsDO~OW!1kg%URqu`0n(+My`QWQ@yfhj%YBX3+uBeh7eg*m2(q^7dY0?z
zG7oum!j#WFbYvf=cRKtlo$<FPz?3EIP&NpAAn4Nt>^Kf;cpsyko}yE4<LK{4-h0^K
zb>qU1AnxzJk1x>TM)~Qd5HB+??{B9n(+o`^s%l6QO(;*l{W7&M3cvD*)HsL0iRFQb
z&zN5`4#v6et=Z~d>pECj|8e)dwvSY~S$M&v(cB1j7U=46t#N{ZA*+kO>3%KziJ@vg
z-`1^aLn`L<s!`GX;%v_<k`Q4Wc9U!_P;;(A-Q9LzyWNpMwkDkJugAYOPAG>8vsT69
z^(oryub&k0nf#LA`L}x<erh6eSfw3I1%DgsGYm7Pw>}!G0#;JA<vZ~y9AYoGCjzX~
z4IFr>ur9jL*R({DwCqOM`CZwCH-1GuG{xg+P+YZjiNhqJm!5eIv@U8uDO7+c7x}H9
zR`7ayZYU!tvs#{2M#Tr(-`v1bx5O&KQjc#fwe{2L%uZQl9?$BO4nPEj)+)Kp=@>xF
zSw-F7`%}zDP#eeLr9TO37^n&@Yb1M{XCiwJ`t>BjB*i*N!@^6v2yco4&QlSqaerZS
z^w}nbcUkwiXI32zz~Wxe{YJ=(K{p&oGj2=Ft<=WBPG@W5)%G0&qGBs{NK{kZxre;h
z0JO@|?bZI~Vdtke`*(}en(mWS&RTchtydViG;8a9_qyk&soOStkuGE8dcVnn_u#0z
z10?@COl|{nxzzp!kb?Hbw;9=KeEDqvN%Hz{1B}k8+abX@H4ljYtq!Y;Ry6!JkcLa`
z_#5FQX1D)FkkGf!CYAUiJ$GMtAB?H^P9?q~Kc{;*^FuI5Cr2QMyLX+A<CmshyDxLz
z$*aNx=uJA5H#f#aD5uR=`E9<+Y4cUK%~vzp)Ggx2jAPuFCu;z3iz?K?b#dWO`2Cr}
zn^1%UePK!O^YO#Jz_gHLbvYP(8<fNNT<Q)i1ulwP7k2^?+msYWj}^bsju`v>ILLx>
zm3njQ<KXNqM3<lAT#6({Eq4Z+0qTInWY5usGIj9CpF^>{f*-)i9{=js{y3?uFS^Wa
z3ZFPE^`f`v)lS=r@!j8eT#>*~>b5es>xyyRShI_xIl;W*Y^JS?&ncVL?2X60y!jR3
z^^Q|K?#+a7$NH<wgB;w^y|9Gn`Eceyxf={bmdn&8p?BZvT*RPX4s?zJb~|h|uAc|@
z95t-pri<s_3eY$$P|%xiHI<VPBa3|#P?!E)mH=Z6%mE@AsITS0t|!4L@xRf)h%0>k
z%kK7v#&~kQzN`oy{P33RO%4^NT<Vko7v?e~#f`2gnE>K|;)Ml%JP1wlYtBqG3=(8)
zrejXoDoJTZQ9ls%AcYj890NBA`+z_>^<62?$yqN6{y7aslRW=o8jlsTZ)YFfCTK|S
zN8vRkX61OX(dlV&9z~>~M8|)fPVt-)M<yQTACVDYb&2(qP)I2c6UmeLC(T2<UZ;U?
zd;X9DtBs>1oP?JWdW}_H*oe`4MVPLKb0Og!L6xgh@+=C=Gl?h+cb!s?#zPLoMkz#b
z(DnB83fknDHU5NORv2D@-Jf~cfFa5hgtUKB&Q$IlHro0W+&)F6^A%-ulE^uf`Hk;Q
z7bOAM*3Ji-Yd7-|#SlwO0x(nu`-6eWcaYc9C~4P%VMZwo{rYfpSX-hfqK8L&`?v0Z
zWD<>YprEpxgMQu$fs5wANNxt?7<b!_R^{@fvYQcFy|h)}K<nKS#x_04zF&s-PRLW*
z7<$7)q1&P)5VXqc+iz@#Nk2;Zzn`V!k}?3kNLRfRgFSP-u6r>5-k<KuclH-psjWOF
zcOzi52Cl~>(6WoP!=#l3^cH;yY)SUqvihO*IP-UmTO+L*k;zzDCr2eiaDGOD^SFLp
z#neS3Buqrs@W){gW8|#Wx(*#`-5q~WqDS%99gYoFG=W4b%WJEZGMoCi>ckMfm^)y(
zL&`6?k}g^KRM`v$K^%?JO3H9m$_jrtf2+B3MXQ|B(%*sZQ~>ka%2ZD0endpz{KrY7
z*RA7J=_R)?&4eeZSAG(U#0Ke|^C0{-Z{>ltGYKLJ?9J=0lg-{+k9qwnIW<4g`W|r5
za_hpOUU?3^UBvWd5Ate+YfW6`l*2|A4`x(fR0vg9__64~qSR4YfGc+e=vB72?*wu6
z9$obI<LDkhXK&<Q<Sys!`+h0Mn;HZfbD{MvIE6DC4@J)0ZXJ5-j&%UJ4|DX?*Z=k7
z{=Q1Lw>a)CYVJb{0TV&d{V08(y3W%c*(!U+c;Mf7iGLbkB4<BIrb9~V3u~o=zphhg
zPqeRB!9ppY_0IdlBMfe*-Ccm`p%|bhx+t-Mrps8eNXJ0Y!{AL-jP^hVsXxAcWg^jX
z^ibf0!@kKOqQaE=UN4T4q(+J^&C<yY@T_wNueJvqQfw)G;Eg$?SjrC<gb31`I=8&x
z+G>+-nFnG)?9d$esLnEs$w7sYVKax(;RMr_0)D#={5MHs>i1#ZvtIm`4YcV&B4Bdq
zBxRSEW_}8jN$lG_p~-&eZS?!XQR;7!+cDvU<sQ2+-4NSN8PQ?&iP5q<GLK%PYtVa1
z!Dn?Ky$$d}v$DQ<wEY1O{>qAM2#oL;p2mPx#e#NLZnm0i#v7lh(Wij*FrXbpFydok
z1&)A~*3fZyo(o|IT6x)Ae_cZuEA^$6vvfc7yS0Ai3U+5zLdyJfyh3L;RpTQk_HcoJ
zT3xf0e2W}y&<-cFs8xH~`G@RCUcMxpYQjL8aGo!*zw<@_Ye1C0-pgtw?`^|<yUcO(
ztru%6?u)~JY%HhVygqEZFW&x`dhvLr*|Hjf(eEA7fwj13O#}vq#U$KeA89YlhZL$?
z$L;a2-buyd|4L*qoov!v{TfJc#5o3YdAe8UsN;J)vlw{J)keKoWSXUgKe<<*EoJMx
z7TAj$n~`&7PE#wlHDxcpS^G-PA|r-<%YkRQu)BG{ZMCWWo&AH2L;b>9;QG?+B}O>^
z)@A;eF7*AD`mT+QC&*8KWn=E`lq)OR?_lp%QZ(;A0wEIM=F%)XX#<mEy5{I!jt&w0
zw$sHKYW_QPheLGa0+Z++_kl+7@%A^<)0cW}OWUbW8G$>az`jE-4tI`UZJiuy1(iLu
z6zH@c<etYal!F~Ou3%sJqX`14RWfjrQSJg^#l!7;RY_L}l{sGu>1RtmiZwTRpwscg
zXYk*4k1Rf&lIQA=S*B!vYxijT{SH&w3P+m*NgN7$zioo774Q3#bMNiWz6Y{69H`Aj
z(#$pBMQ{p??gRykhrkp=g=YsL1~cu~cj~YF7+A+2dc7S#9Mm_1Q8G>HKkohX!scS9
z)K309rnXgO{msz_=9k`JFzp|M*dO%0x4~5a?VjVGAMi$R=*Jhqqz+=mi@GxY<ec8x
zw>)G=^lmV@!t8&@HcqCA8w2sBSL^?-tN_&=la$QwFaDp~#U$`Yr#~cD{a#&aVz=rx
ze?12xiS<8eb(6r{_osvUk1_Q7ha8w$oDlez*~~@v1f8CP3`8V{mGzB=ao;u+km4cV
zniOOdTqTwD-L0PwYbKe4wd11EO%2OLNh<lw0kR87{3;4xlo9K}vhig3<xn{c9aQX0
zHF~2S!<w_SG75TDTols<ct4BY*l{AU=sa;Dy9r+fucGVqSAhxmh|fBxAsmUgtw<X`
z^!p^fz6z?|{{ALqgsi7%Y&U@aPcP7`0A#|sZNPUFQt?l35RK+Ez$=>92Alx%njqoS
z1E?mTd|IxZ0rjmPUQ88O`f*RV=U6BAhRJ{~<XSlA)I9u9TV6kWzrS@*a}hqdUS>3z
zj)V9%j0Y$yGoY;83(D#YD698^@^}W6$M=G=HUrAq{h%Do0u$d0&c^1}3_yM_xH}}`
zZh(zA_s2=pzsb9q=RFZiiQ9am@*rhR@a_fjwI5%FDj<Ev+sfqE`t-?5e-%tG%(EgD
zbJ<i?G@g~(jt_gfg>>9Of~G=dJLA#;v&AP=JgI7fz-u+VR4%0Zrcip2lRt@Lt=uPp
z5;lJCBuZH6mPAS_geDfXlP#Oz$s9@yb$R8?6f@PLi-!jfWWKYdv=Imw#HOq$Vfa&r
z;heqV*a2rL9(o&;Uo*H4dQ)PrdOf7eK>aB=*^{bA*Ti0O4yPmE0{g&vq1u$|)4eQ(
z&%i5hkFo?{J|@qHWkfwMtf<Q6DVL$DY99@ZD4EkFiUvvD^EO5|>A=8vs;S;QhGR}u
z9{8AizQmiyYjNIZdRaylY#jV^8pae`QRRQ(2u7;D$&}1_zd}hBhQVGW@8-tAj!x$S
zued2^+#9&jIngR~0z)&>g)s~)>`_v&ye*|tY-LQ;E!Rb+Abo1_Hu`}h8BHR^J5|>I
zd-uaSrixs`AgF6kPHv+tw~z_wZ%WoNKsb$CN(55mV%Fd?^b&es`{(EuQqJSTNbG6V
zI8=3u?r!bXUas%%?c$}m1Sqo!_9%#I6Tp{XSQ{l7-~1G;!!3{s=fFyWd%!xF->)RT
zGc4#+G&-C_<J193Tr6=@|E!Io5n2RHQ`7V6u#Jo~`N}yGayP*bwImFNAo%5|o?jm}
z(h}ahb1-!uTDxsT`vZUUL`yeCb)!^No3jVw!4yxU3Ed1~7^j6E&>l?gA%1stPZA4q
z+CbR86D9&g`uOHbfb?#dp7ABaHCID&#B!#Xu-J(~Rb#j-mdvg&n_S<|Q74Ssg!|RN
znHTz6aj|2Zl=Msi{v6g?Zg$!JxMh?@u<S{znW?t5yY*pCrC=1KaOEF|&<eHIZVG|<
z$Gglc%<i#lzjNWE!5DU^o$Ansf4r-;azL%j26cTg$OToIUB#Y~Y_;v9!`W5BNjmxM
z);4Jj;P3knu9zEy_`lm2QegM!((cV*J`1UO(5KR;gPVIe@MTmSKkXbk?B(scs@sC#
zZYaZClSKM*n0Qu(S1h%yN|9spj6y%DLMnYxs*LUATv`9H#koI#{`{0a2d;z6trwdv
zUEJJa{e*YmSm-W6JL;8%oYbq>PTaq}87z}ib>rZ610_FBR~0$<ryUOBcqfDk(ovw<
ziFi8+2hr%Gw>JvjI6X<p)X^w7wR%A;XrTwJ(2Kvfy=TwR^I)O5j>=Q9oa6kP!qg$r
zD-?*|N_ufPo_Hn2U@c6-ArM)AI4)PoHu2O4L4Zhi9Q2~IQTPX4;}_Bt+PjISbOkJl
z2DeY~O{^M#rlLW=O6mKq;&2ia>;RF(H5yw0J`gCOpHC!Tn|5L*!1V%5*!g5KUT-wc
z!bv^xFa6QTKd+ySru8U3!<Sb<xAAiPT(uESp8C(bgQ(j9G9Heeo<6r*FQEVLHv@^b
z3<VhdLX(4r4q`YDZ@exlOQ+*L45*KJbz#6bz|&|jh^}xN;fv4lKSwtOH06(noYD~|
z7R@s*fWn=fPtcA6<{qXV@9lMl*4mh@F@KOQV>EMMNiW$jA^>I!`D{N%TSx<&*z!>y
zaD*32LPxlZqfr9RTZ12kf;KgI?r9P>EW5W;pO~l!-u|ZQ#CDzdZgmp7PI9+8mv)`Y
zTj~@tAyue$=52~fy9QeLk80U(Q#A@`(L&xD?mw)jKIJ#UsnFdTbF!ot(%EY5YN=0o
z4brDf7xkxEjj2o}IgQDuyqX+#tzku~(={`n(i7@XSwz#cqn2}&SOqkDV6(`cRX~{L
zf@4Eyeb-inNOKEBkXwZU`tYFied)&`lHg<=UZHkq-7ES1e(fARd=`li)=q)I(u>4f
z#NAb6@(UHrFEZqrtb0Yh{hlut-4eX1p~&~^H?{AZ?IHfBpDF}o2TD-YEqE;a?JxWX
zVt<%myD)xOt8vo!JsA2x?s^R*pW)dkii59g1LUOU>gqE7Z9QIT+JEui(#qr3-&)J9
z_Ug*YV-Upu247cO%YXBl-(-Zh{F~yUdEVcq-RWpDom1|X@Bd5x(SBD;UgHy`;JmCS
z=jsI<Ri{9J)fq|$jQTZ*&g?IfX`+5kW8h;NeZZ*m$#77=P6qsI=#R$!S&*1Fy2<Nd
z`VCf1y;=gO`o|bptHvPgHsH^We-Yq*g-2zRr;(as%8dMhe$yGl(Lcnyl=C|kS8qCf
zVD9GEkx&gCJYSNr-wWzz!RWqK?pM6?docNeR;b#Ysw6kVF6tlstBZRSC-}EjnRW+Z
z@6IFV(yBX?>&YETPe*rzo&W>g=?(lO3G&z2;N_f;vr$Bs82V`adRv*%*$nhdm6^GW
z7P3c^+uGwYx5J9r3u|r}6k=o+3XLT0H7fPvsDGlKVfo;FJRNmVf=KGobb=cgf6#xB
z_RtU20{t-1vB<3@I=TZ=a1xxw#922m;3|3O7QUPFv0llkss@tt0nM{>KJ>=p`3*V+
zavQ}GGaKfQR^!%ut2dJvWQA-m((iTS^1*3Szq6VG&UTUo>%P@M>9qq=-Y`I6)(VA6
zecbQDf0O<x{1+`>=;u$Hb^41h_*2gZp^7Lz6rM)#UyK-qKL(>ZoEdl?1qu9~z=2i2
zOd5s8FuCkCehx=VZS~`Nby+>a4){IjO<;`hf3Jh?^sJKmNgOruKRUpjFVxb%`{0*<
zbNIjQ-NU1eckk-M{#Uj!pZ{B0X)Q0M`M>tc|M7qSl7Fx8?wh<yMtybXNIyL|B`<(I
z>w7U{IbQ22-0*t-2vr<@;w9k_@Adqo0JNU&E**u*)j4cSaRv5b^sViO=r0__H|pvz
ziKcNc@PMiWq&4z%ViM#W@%IoII{lz;Mp1v$RozFOlQ$jdPMiBu2A@>9E$VH8*CWFr
z4w?OidqIKjC|P%N6~z}`nCQ;<(@BIp6&yyo6R>M0^ZKT<ka|FWro&(~VO@^g&S1YM
zXySyOlFSYsAR-9QI_pM1BE?-)xT5HaJ>XL(csC2X6euCx$pAoLo+o&#NtddrCBsA-
zI5^S;$}R6u6jDJ*S2=L@dW(8Qi)b6=(=E4!3rIn|%h0FJqOcqRb1&aJ73p@O2MX<z
z&q=)iA~yP_T>8+5zV-*Ai9pR};4SKPUQ{~BWID#X;RKzlgBV)!#5a#;6VdMqK~3Ul
zfEWY_);lkpPDec~<)e!gPI5p>)qWMeqZ^h+T)e$jZpKwFnDpwNw>Rdh=)*qtN!6&4
z(_k`;l7^RfC0s$DgU_%__W<UujI(MD2+*hE{Z^};2ZQl%j7s~IEHYCQ+mb=nr4k4w
zr{VSUXVTXi?wlIzoEHM=FkoMK46kYJD8K=l56gf6#`gxjvaWr^e8K6|Ci8TIq{tbd
zR)h<Z=N6+Qp05c4?gnNG;R)WDT8a&;+V4OttFroh)VJTm22|rkU2;w3<10NI`oBl<
zi~6%+IHJFB0z>a!)Sivv;POT7?Ack^fAL9Wu#q`Igi@-XQ=&SFhkM+osln^aWZFah
z>gjagB4d?$hMNT8m?cjpa3GStd;&X!6tU=0hw%a?=(ipuxV!#;?7e+s8#k^m{QPTw
zim7{&N{*~(^zORpxlZDwKASi>w$pY`o7L6J*q%g|6pfVF+0Fgz4}JhSL(YpdvK_bG
zW9>GUW=IeOK@b2z@O!T17U4~g^(0?MfM_uB`u>SeOsNM*-6s|GiGB7W#dKksjl;QD
z<|@?`1hlw`DiDXLnGaW#?za+>x@m)<c)Gwn-E~g=8Q-ZH_;^L~l-^_0B912{#dlOV
zgyvyt_h^dyqmMN3#%!MOO+%wCNqV3cnpyWWkUrJ8PZ}`B(+@y}Qq(FTr6O&5<5Q9r
zs^{P9)+=TD-&SSow3729%oNG**pO;udY2P651j&yJjht67E5aO@hSs)2MkMBv3L%G
ziN=Dnq|1UE$|y|-o?G1!@43q%M$sa_3u0qo&7vt0_3Y6P{qb--+6p`zd?b-9kG1&V
z<m|M1;KnECd_095>P@llfKovzOd>&#tu>!>JMf+lm)AY?dG844@Oc-i>`0st7Se!&
zYq3)8y?C}I>43v<0RwHeV2KczGZT&HOEzmAG2b0!?AzST#TDJ<I4M^4sN-6~O87My
ztlx{RJfN=nQ{aFXhKMYIsUh%&10pnGH|<W8c!s`1MCcCLO~CT|+?$<^2bfHfEsNM>
z>hpjiyXJS0K(g)tbf^ZDR39#h(10N2-$&v(P85OieWwF#I`XT8T<!W1zW-J(m*2+O
zSA%fQx)T^oIKPXdyTn-&Vp5rodbN{Pz#wq%a@{~D^b<-s5u2KvdURM^g15zYJP<}l
zW0$yf58$GvEEb4?fAoX={V`lU896GV8DjVKzKXNcMa!|F^iRT9#2pM~Lw<KQN~rJj
z&j^1nVDiUS{BgfOpN2ysxD}$yQn$8#RK4ivcUI93-?x@tl;5e+d@4@4leh{>^Fymj
z*{Jf8?6Ox+I!|65Jc}B5eYp2*|JRQ3POpo+5WeRmFi1la_-elyTpmvE?kqa_jm-#0
z-+U;^qIvyBK`f_o(EFn-iGXrW`l}B+pg*1<7mjHwkTj&XU3FocnsARVwc1-UIgc>i
zpn>r&`X1?mD!5WBaUx|l-g%u3Xl?2xg9{tO1RUa=j;UCycb_@lABXCN8Y7wmwEmn=
zSRwBAXLIO)a?;G347;K@I~!7+(AwzhZ>%_K=cB>H<N0jMyMO|#nD!|r^^r#=+iDT1
z3@M@^v=W{wp-mGF4b3Ws21f<~P{Nu=0hp_>RJ4J5*6aYpNOJ%Q?4cAQ|7uM{ontuk
zmM)lz3Kv}`Wlqv~sc9LUb*C(m)!HFrCuAhGAy6q2NT^~~`oTFXSs&SAIrBKtk;oXf
z_Ie(ACEbQHPXnv;x2a7iv;@)5A-goY{U`%fmqxlfRFi@mFM~JNMQ>63X-E(U+;XYc
zd39YOmZ7fhhGJx%03F97t5)WN`3Z|R`KxKV3-LT~^ivFMsNwStHGu@dBi)-d@)ES#
zGbQWQEM$0Qu6}C`?~lC;tcl7f4|FDeDj|zOsQ$^YF|<&k8X5u8Ojls8(i#?+FLWQc
zKx~x{_nENJhoaC{O#ZL^iuoUw>K4l-Z4U;ssjzi-rqW3DC7+mH;lj1Xl*gyTanIQE
z73q@@!8DlAW^BX2l)B#Nqdy&w*qYX`;)@T$K6rJpgwcS^dtor{4Hc?YoPdZp8U)Gp
zKOz^`>zoJQ*F;NYqKcWjHGq#&lTgBmpqx&HQ0N003jRQbS6xdhk=!F%;y_(o13@x+
z=9A^es-`#Py=r(5&it9mMZ)U!rIuEMIS+uTM<}-o$fC!6;0KH&revU{qCAsn8qiE7
zjh1hzU{{W5%a>v6DmhF8&s&Q@hjWl@h{h$FneAnP2$%=mQ&4@@^&=Ur=!K0;n_Ooe
zX?b|;54AUpl<@bc@AU=dBD7F*C43y`7uNr^n}Rdtu}BJ#m_>~Ok#;)na{e|L-rfHD
z*|ghd14vtLkrA&PDE+hX7<LKkGNj>R85RCj6FyRKSTz>63JIU?lv~mLj57Nvu6%$g
zJ|E$#8)4Fdaw$PeHVC^F7Ar>ePW$~(aVpG5Lxe0vyrHX6DP0E@XppBcKZ!ju>Trd`
z&_)=jK}M21WwoddXnUui0?Iyp`cxi`M>>=&Ecmdf*OUHx24xIFoWqS?#P}R-&&7o*
z@5wMQ0L6GK4eUagF<JrP6f{|)$if&A=+O`1*K#-XE^#3!Lu}JI-P0}>h?wuesA%0W
zGq}WB+YfaqfC$qfZVgqPSSM-T4dcQ=Jb~Puck|Kvho8MEvI~k+lDd8Foy#I+O+^&l
za3osLkw>Vwv7)5Vh(Tl83bmyeig;<LQk=$#&!K4fdhT^e0Ef%3q<AEK50OMf!fp_*
zQF?iZD`pS<S4T1FHOIhuw)~Q3g=$fm*a{4X4=OfLD4lqG;dtnYCIK^0BNZOXDX44B
zRN_mK{+wJ?Qq|#%(O``F#TafE(o-8bb0o*g*-94ixi|2kGLkh-x|v!)=DZ|Ak0!2{
z5f%kxIvwLq>TV#%70%DuuMpbRY^*vPs{IWIRx#ZFp*Tb1YKd1aRD)^4YFAoLhTYGX
zTU7nM-EAziB3^+EX(+QZgqe24lV4zmv8*r3Mjn}Ksp!UhpS7nnUa0ZZoPd#dUsm~|
zC%9iF^4^fa1ci_71KFdP&%6r<m=dIiBvR#@KFI-PA>6QuH+C*+!~RIQqR3wI`>a11
zOf?VKhGM=USvCWxbFv`VmNRt<5$B5g(ZZGzEYMN=><}TaY7!=-1#kFnjmgaUh|P%D
ztc<;NhS;DmX9S7aQ&HV8vhml-0Q@jVNP<W$Sc+jC9Ezbig)C^G$B9h=1M3oiiU^D~
zA;t%ypSBn-ivo<l?Iv=NQ1*nVrwtAoO<@b@2p-dUdd>;Rxz8j8NPYRtbqTef<PvpJ
zag#*394muK^mk?d_s42Of+U-FfplX)6JwX?g~m$s3SltRMm6e$9PcCzbIN;B&gASe
z;M0yWtJRFsdF0%t^EdyogUB0)BX5K^#!j_@7YS|h64xWgmkhNYs+S}Ut%d2Ih!`k=
z*-9MLS?Ui-Q~E;1LUmZVGfA9`25L~)i`kv>8CzBbRJvYqV6&Hiw0Ba4XIL%I{h1nJ
zJ%dAB5=?w?5kvpUg9nZg(Gj{)qfMBR_lYI&z#Ed_Q1e!qXg2TYt(q}mG>c{sD*+e5
z5F1Kl)f+zHBju44UyIJ;`*hrYj4;?=k6w@xbV-x;%)@4%?WxeiZ;4H-$suCjPd!pM
z<V(EO(A2GxcskYo$Y?QSCIoY6raPZ26Lvn8t!Uw8c+O`SH^r=`4=VyvHXTr@YP9kI
z$kL>=X+(XK;ub=2WCM8?WZ~+N5FvgyEYUb3N>=-Nmy-tA8_2qBs#;3<)ntxCp>^$2
zo0>Z1i@n(ZOx3w%%v-Na>HvmN=06fJI&z#mt}m+L+CnoyIC}CkZ4Bey_h?Lm(8;XP
zW)@Ytf#P-3ghHocuCW-V7=QZF)5-%dW(YCt|F2G^$=>htu9&b&K8e0;Ogj<zN(1^X
zP&#a{uiTK-rn#H!se5kYR6CoWdLhT_ANjam4KFHLEPHJ534Ig7$Tn>Xao9V^FN{qI
zQ`1Zcvw`p_xX-(Q9^#Yn7b<TdIzhav#N?yd{G5BLzUS*Gl0u%(&r_G?vf<RlqzKmo
zzTncXtygAof_ZvIMuzSa7;vLOcRC0ccO42*_%I)XQCY#_lkCJIL&vR_XytKTXE5!a
z%rwGJ=z)e*RA%vyvhzF{bMz>|hD5^NlqJH@H{O1xp74I}+@EpMbG`ltW99nMnww&O
zS_!299KB&HyfJvmXT*51?!99zk~cyX98!D-T^7begG6T6l?ws>VFjPJ$Hk$DbodNa
zfkR*j6q0F|V<WhX6bM33B3#9~!vxXTkCJ0--fX56J2MegsQHOgqdSBf{q)S3W%>$T
zN#MZ}5D9L1^E=8!%eqHs7;vAUvrb2L+AHmA@wHQ(bb--(T75~O>Z$|K;q8-!Q~W9F
zt+Y$6&GJF4{@Iu`V7<3!a=&a(FhW@<guw~a1Gl-=yPRpqydJ883Gq?AC_;>HaAn-W
z5T^i`KsgxmMg}GTH;~|UP|8%op_n1)1j!_D@{cpa&I67dP#Y7HTSP6cKfqZMeE;yF
zgbN^76MIW~^V83yqjVnzXX8&D`c>|q`v2(<9#t#N9~}b!X2jcTjCX9qhHsOQnJQB(
zoM5o$w5%%hyB|FqoYD0}8hHJ)k#ba!cH32Hi6b2nw=$r-dHt=Ts6kF>*z4ic6Ejx}
zMtw4nW5Sdc$b%Ox_oML$LKn&R`kq+)>*hqJ!V;|jG?{S`s-^5F3>c|$VZX3r9G7cG
zREm(03Jv-EzB<4e?k1-Q<=X#Mep;pKTVXGeV*)CsK8e^J418szTci|E;glIoVqS!A
zLmQ@0t(Tm7Mdop%S&T0f9|`i5mkIuswn(TeH6URKCZs|a9(I3<%{gF(*kh;Xv+Whz
zM6`Ms`a{(gUtn0<ad6yAzM~k^h;;fHrbwWdR@r)l@Cir<{3P9*`2F{R#Bwo*a+Jm=
zKZq~XBE}h1LX+7_=v>-1;P9~Sa0@!y)@&HJa6u`vh;#hnNbXh@Z&}1l`bdMevL&{Q
zMJVwul#4>L<1*5E;n%u=mfu0q+`Qy~JbOxu;bFJ|Y0YOB0<EMpw!~(nX`Rb`Df5X_
zU~N?PC<hQ|qhdK0#Nex2)1k3x`OPegbmgDM=|L7jl%T?NfAfBq+APw>1jFhMWd-r3
zGcxW8YuVltC3AEl2u|lCY}+Wkxf}4+Dkpkf4rJ4SbqN^IF>_vR=`pL6B?2<iQPOsl
zvSSU^IuwN)2J1cVtV_22R00p5JbSVG{OHlfe{TF={`u>##sk^J?TSf(*uG)+G|=ch
zc?dgHXO~i$hNMK`g+Z%!gsz@zQ{Ktv_|!pYsj&~#)F=sxz>DPKOo!1@^}dJbR-Q-*
zOzi_IPZ}lW*kdmEu%;3?TfeY-u%u&WW0HUmmxKz{$qC5-2_C|Yh=D)lIfcCYG7a~B
zJwDv+#0aP!CdsJwZDWL#+7ESkxf}^8IuSLdH1TsqaqWa*dKZGC-dMAQb$L-B2MIER
zBBDnaR1u$ES94nGwvm#KZ0<_h|0wQEK=Xb%Hl#>FhTB%_U6Gk;BP?wA`gLx;W7dgM
zO&RlFsHt7n9C$a-X7zXd$>clX4>Oz?@o3{QdpE_tV;wTwGavK1$xZ~#FB;YGT6$j=
zS2oFU2HzV_tR~n&BKI&0T<P+Qr=1u3j}Lbb|K54Md;F8p^Y4a(?<513NHaS`Pi@C3
z$4eNxpn)zWBa=XFwn(LT^9Jq_7P>(tmeJn+h~v^&+y;g%5~U}gN~T6+I~#OZgf=QM
zW;()C@19y4<)U)c%MCCxY$0R60G#o1_vz1_XNP-x+|zaFxZS}=T5FA%OO9+{9~thG
z8bWvTjq?F8E!lx1Mp6iIUAHA(waIXNsS>btbv(YBxtM_CgdSL8PeNDRtLq$gjO`1t
zxMiV6IOoUiXcnWAmht)$Q@zgc0F}F>Cu3byMy4bYeCKugA3Nwf$NN1RjW@{rREKWG
z1APC!9oYRO5rhvhqeJk=LLdpzBsQE`(IV0}+mcqn{t7Lw-62-(NN7*|A@3vF4~<`g
zalgaodhJK&%E=u*VMJAg%9T;o=M{SX$oj1WgY_)dA?tC}CG+tl@yPmZ_0)W*`)WMn
z-u6k4KqeA3KH-c)=AS8Z=)gNA76{Th&c`|I-ZMP$X_AnMei3iV51UKOaG>>d^L&Ib
zt27a5DJ*&r-Thv-Us4hmzoEmddl&RGz-3#PMbS|951zbu^K|d&{-GhGWTzhXRiLz7
zBQQzDRzWPJh~53iR|6H3v@drLt_Fw3()5o#-8(wA0lgN@$Wd=Fnh_013UUWZ&ePrF
zUH$@*B-ljz6A7=MaZZPYR+s{uL%GH5{nRysrV*d74}7Ra`bk=M`3wmSsi#)wP$Nv}
zmkXEmShXwb12?t|njH*0&Yr@K5w-q_=O|4D;{nktiaOo&Gzxg)18GngWc!F+F_<PJ
zTI6R_pU6H8qmAiZQgnS69W?uHU8!Z}{*|$QYlfJ5TlyqKV7@P@$f97~?tyW3Y&vI6
zh<660tN~5Mgae^-9SgFqTN>yidwTZ4kP$(pT-V_tE-{)yU!rlcM5{fK<5itO!8yRV
zf&i-W0<X@%5iJPdcM&-02ZO?L&8A*=wr;%lgJAAuji){isKq7v9fn(<zb7#0fJo9o
z__b^wp;EyBY7nI=tQz4Hb7xE_Mh(IV!5;q5N2ClB+<WR^#b6w#<C7CdQpf1bub;dg
zLN`9)oO2XI%uM&u_r#UP^`(`vIH?(s*>33N18i!0Jv<#?NjZJ^FIr<1!4$nl3>e21
zoGm`_XlCj7qmQ`WeHMHcod1r}G6ZMWY6J1AtyUu||4*gTtk~zjtMtBgcmDe}KL1f5
z;l|<R8~;(<C_a>BCwNHGs1q^3<kI;U_V3Q_CiB19XTkiBw2^DJv26a+)W6IB^#^^v
z{f2XU(ac_FHyNL0QQFUrjtEd!82A$5{vW=WthkxrKmOC%B6F}3-98{?_uzQMTLOoA
zYbxg+dlUWj0YcK(rRX9h%K4A~v$4LUz<N3&5#A;)1}y1}!i#YFqetS8`7D_KoSEk)
z+E}{&S7PhG+iXyAr*RXFFZ=v2pa09oA33D1+s5kS->Nn1cjJE>pFHD#KD#LQuhGVm
z{GZiEtrge*YxO(*|5iTV>W#6DwA6YV>+9e8CnLT?=*i)6=jiqR!IM{S4vyEqRgPf$
zF<+jzE;k9SulL5|;W{x-2V2(#e3?0$^rz_jb6wv|^vnJMZd1pVMc?d8M1%j?douOe
z>2xG#?{-InqlrIyGNvIY+$RWIKjP#<Ns{8*C=>yGZB4@P_==jH^|ddA6K?w{sJ)iL
zf9<KmoUe{LZw{XA?jLsO*WZf8^|cVZ^T@H^cJ>eUk9QV;0upf$6|R8GE%fmZK7`So
z&88g=PMPkkOaGJanQr&-wTL^PD(PKI0gOnE%ZVp-OU~=#pAPqSpLSlpIo|uV^K|do
z?wc3K#hsL9Rg)2koka7=)&|5Y)A6OkbSEE*@k)wmbk&nC(QIe^%lbMWUIFtU0%9Q-
z<sRduBbYW~5yl~PBD76B@n$i%?;%zs#^Z6YdD(RwbmpUzu0Q2=rSY7gG`rF_nq4ob
z_=~jKNlK(Ok|2YeE?P{87hd;ce6rsVAyo5MCdHfd`blD>H>Ak%M~nBRpFHb-ZzgMk
zdqpi^$@)((WA=a5tu>o>>;G+hmahML@JAgow+n9Z&(G3#pA|lN=Kt($@HO>+n(Rsa
z-@TjvxAMuO{~IedukOST`V2F^(&|osN)Bfs+AM5h%f48UUq$`6J3VFf@rBk!kB)aq
zZ9jbV<`|cOOvkuU(<6PkkY1t)sH97xDJu1Zn?L4txNz|1#fy?tDQPGr<m%)Hc%$`P
zsrg8ru_nvO!Etp`LHP*%kqx-``)H%c3anOa(BF4sf22BY^m~&OR|bo=e(CzNXXEJ+
zAEAE5Ti*pPyMOQuM#NqbnEbN4f82TX_`mj^9Cs>++|nS{p8oRc@G1KyJ2*rRmHN3i
z+oRu4=%>Pt0TQ{maM8IR7H1V4_<)>h913%PG@HQYD4JloXQI|zduUB#B7z}<P~wPd
z9vIV>NE?CpDfz36frg=rm6)_JCzNLPM^C#y%_o=q_s_lQHCBLS{vWqei_8CJ{ciu~
zRz6GRzf3uBK!*=(6!3lE4QE}J4tT*+ZWQ3V@*nWytsiG3f-9K3>ZRPQX1p#&7QSv`
zJXz90e>}O2K)5Bx0+-d4D@{QPHtU_4YHl8Q{Q~E6a27X;v|aQLt{MvserllL8Yl$w
z9#XH&lBF0?<>*j_M}aC<bRIe`&5Af>IAqBt4S}?N_ezK_o6?v0Nr?|Nb&zTNWay2!
zFS_&2tU@b;L4hvtiQc;Q+n)6n2}kI+g6@llOaFXVaz>!h!%gRxvoSKFZ9XJ=P$9)u
z!H83LofPg9UcdQoOA5a&zvOJ(+j#c!c;2j+fZ#(%i0L~I9swvXFTV5RBeO?}h~i@c
zX4H~Pzp#~Ac*nRo@0=f~zVq(E1F6ErHmO{Nt1+@qy}o~rD5+J@EpM3kF`Q?7st<=X
z07#Bq5Yj*BYObIV5>w*HX_fXLxX=i6F(?Ct0#RYp5p;1aJX6HE=isVZc6<^o8pWdX
zpN{K%&!dnNbyeM<x6xG8it|A5V|5}NhB*EH0zQtrPxfaO|4-#M{XdPn_5U_LEBb#b
zcmAJ$uTQT1-|p<}Iu4-a^FI;)S#R9U|6BR!ecYG3$3JzRbk>*2gFhPIyU)#jR#^Y9
zECQCzf433$|GI9Yb~pcT<CDw&cQ&;eP*8@R<Sv_!RBj^V<6zT98MUFtSdfDJe&^0s
z`15`8%>N@Y6Tja2-=H6f^}klR^Z(t-=i%l$S^kn3*yqFOQ~#sRH;aLH+;Xj4Lm@L&
zHmig|-!Gr}({XU-pLe(B<!-<HZu0Q|o#Q&EhcAzrZyx%ifp@{zH-|^{KOyb$roQHA
zz*#utpg;0Y1j(z{hJN201-NL7v2~m$<H_Ze@9Hb`i%yl;t3>~_oR{-iFdsWdU4J$%
zIWN2K$Fnj0p@-*VPMJ1ve$ogFq&Fj<FG@gCg5BZJVW>C>8F<r=$m*w?Jj6tqP5s_H
zJUTcJBvGy$hUCM9{-`T=jhzRQ@`ID`Ndf_Zb3Pt$RwH%q*pySNN{&vQfN3C^6XFN%
zMv|3@6LBb5-YlXCKASN#nU)Ga&PL1$FQ!OhEXi=Xz41rBv_;4nLE<!kQGQ>2O`VB_
zN<bf>i0om*E^ihrLJ7wkBRXl6sPBWhx^acEGI0qJTpcSDOoX6L24v@XrpgbIqMDD~
z5);#0=njK$SWHknwhY1Oo7L?Db<Y}SwNm$Y;Csk`2Jca~qJjZul#7}|+Dg9g5Uq@-
zfsq)K&wF~K0X^lbya>~CBux=w&H}6RJhQ_@hseh_KAC;u<T@%hO_+jNPJtpx?hHpM
zA|TAGoFFcm8OJ~EA2~;_o*n<Pd${M&_t%H7e%^n&_tbg(cY3+!JbCr{?}z)(e>!%4
zdiCPz-r<q6d+?N=9vmO;KYnxk>hMSaZR{RV^$mWzd+>K>@7LFddq+pkt3zl1<?9#w
z1d*CJ+&wtn-#aR)v-A50&r1$LaSmP`3z!%CFZYkB?D4A-H=nHQyn5!m+&g^o6aCzM
zy#HeV`0w24v;E@(H2Cb*p@7<TUhf_r?>~9-V)xK_{pRrXtD`*!y?nZV^yJ0v{>#0m
zWx|8ncJ_YWJ2-ZZe%gKU!tS&{diBe}-XVHocH4QpN7(K@ezAupxzA7c5BHuNqjS->
zCqzs_^hHTP9lhRrvQNK=K6}))-NV0^6yT%1|9(Ry>80~@_vP+$>S-Ylm1w}8ygA%^
zi5?JXj@~>zI^I8ibG+v~fA#7q55Uph;m`X|_KtR(7q5<(fNzfW6hcT?z$g$LA|aKb
z?~mUc?K3g=503W^58u2###N2P0lyHX2-{t%|CFiz>Ht00ytMb~@b3T*y70)9oL_$0
zqvwYpG*fREWH}-#J~=jvQKLju)xD_S&cWXE7yHlm4xa3x$SZ*QW&dceNCUZlgaZ4F
z0PzPk{Dvuj0VMp?&^@zRyu@Se>_2mMpZ>g$UZ@(x9Y_0$otTVIep2Ir$?|ah;U>?R
z|HBKdBU%+d=uLg^#5vl3`IIKHFUjnmA&>D(5)a;p%=6<<Bxby60hNks=KY`UoTly6
zTJ)Skns_N%#pA1DW);*jR@x`mS!r{wvpA%V9M`ye;DxOEoTw9N@kQEMlB?tdo<}_J
zWRG~iJiC}NowZK`#LDB-h`mR(EhHy64|D{KlL#4oy#KtjM{{(Sc>4Z*=Nnxhdfu!T
zLrl!4j;n(ZOu!ujVy9!n>~y;40|Iv=4gIwH^Im87#qs{ndrxi#;;Vxfe_xE9<Jet&
ze(>fAb&?O@eakt@oQ<ug0!Q=#EBm!v9P-qJiNkvul{ueJklGr*hnrhh`Vd&R+TJ32
zRi@*hJL^i8U2G}t4v~ScPr~PDuj<IPFp{eD$vW<Ay2=Oqnl(I-7$H843h5ei&LImv
zpO2ul{6Ymf$7FninjbmcMP!)czTsd;vQN_YT9s_~`ET{NWQ*@4p>szGF#dw3Rs)~#
zXSTDhqNpu|L60k7+v%LsPu~grn@2J5)|Vh8KWvPyfPoFhKtT?{sMo>C`K%MDRsfUl
zJWz1MB%R1E<*6jg)C4P<43O*pcJOv5tj~58>4kHh4;lb#)ur&j5&qyJ0@UTaIp3>H
zwH2J}h4hx&RZdjKBMY8N!*}Va+|Zjk7pec5B)Qd4^qh&AdtMTRXZxfUJ%91)F=;bD
z(^3sJi4?^cGNl+HI1LPv#O0ljgzdVJfkZx3@&1|Df3GK!$}NYR)Yxbf`-HS$e>{Lf
zU;W2FUy_>oMfi#D91K}V;1M4=kDPy!9!Y9}TXN(}Re!1JFZFctP(O~2cS!|xp1nDE
z0v+lorE5{^{%8oPtwwo#Qs8emlE6o-QpF65?$|q?(Zv{4_61I9O+T3tR~8g&Zj$Lx
z3K><RX*T^)NrVpyQ}Zc+hF1cl=2Z$jPFX?Y-@$boJm08#e|C}HdQ=*-!z^FY7;N$@
z)jaWV0#G>AxMavJgg=u_S|zKgB^fK>tWLymI1pp^#au0{W!74N)uNo%^Wal=QpoP2
z7F^k@5|;C%#?+<7k+rF;<srRV5O`IoCe11(Sv*qu?k2uMmPMJ<tSb?RSx+;NwC!UO
z6heh{mPOE6)C01WahZ@O3b=}8R;t3{8KXqCa%lU`KM+{-MXf9=RW-s+7j`ZXl|wHI
zqIEOd>zuohx>453vbltulKeaMKXOty{(m6V<!Y>gfZBB0MaiGN2otnsQI>JzD*uO7
zW8Bas$&BZ-$y{BKV8Aj;Dp!lWh;oW(g`H7WaOA%7H%{@d$L<R9Yte`=l4gr!kfAC_
zyxdvInGH+MnEsB3JL@X>JHomOx=_&{ZT&d^t@_sa;Rjl!i_X82FKcg$vMSGpX>}`$
z>bj`QmB(n9TL1A!bHoMk7=Q_S#=C!UMQWr#YWS9uC^4TYJP122!HR`3!y~+`Qm$PJ
zbTQsm<1o(BVANtT&ax)pA25=&MWaz&Jd*CBx|Q1-NjKL>Ru+zAE!Rj^(?@b;nK<-L
z?nI&~5*G`%3=QkAFWkV{SyLkQ-5E~_nJ<4u;dZ+td5gmBtBvHJL%1!}YO(3%1>Q(q
zS2e{gf`Phk6jH~OEmI{`j7MGipOzp<h^;r6(yV`@TJLJr`d6zqSgqPu)AI)7PDtNy
z4owYHFZ$YxzV;C-zqY1-4)ml_50n>0{kl}F9nIDIWJ?m@qZgWEA|2&E8C`HB9)_<%
zcI>Ke|8OqK>Pw-}QxA#%jt*U-g!A&~Z#2pN;aqZ|^))Irh(zhp3)ckfhJalS*fjvV
zF~F_{>>7aGG{Dsma8(1Y8i1=Yz;z9{Y5=aL0j`CBYZ`FP09=a!u4%wE18~g%yg<1A
zTk?kcwRofYwRofUwRoeRhc_&7eKjGJD&%ord5|gcWN%{<c=N#+-l*}pxG-3A4a94)
zimOZUAp0RK2Hc#wCHkkT_;89dUibS*St6cgT1czPyF9HX-?{1?AFPr?Uk=VS;oa+3
zM=t$R=c}yAWI(|Qqy;~n2MmXv5~9fKG_CR>Ip7Jb*Wy_D3ZpL(UJ9j~!iBnaa20&M
zWGwd)C(HwHx)tqj<>Ul&>E{~VQMk0q12G}cj@UOQG<CCDU@8@S?^$%?TDVT9R8z3S
zB;`3+GrwQe<l2(+?$5xujN(d6o53L((5l>;jevTS;L@uhz&x;(3lH6}w0L8980R#r
zh?{~=Pe?^aHlzN(W5LgW-ch?6_eFi<ew9L4U%hkb*qYKI&B4CZk#9Y--SMls_>*fy
zv>j0jHI?{;32Dh>yfAvkItF$8(td_nxn`BI-@CE*)!6%5>^-X~7xpt&1TGV#U1n`{
zqo*81r`$2&Ze>@yYe<ITVW)T5i5oT-=4R_DE=r?U%H^MUliVCk>=@ab289c#GZ)Zf
zsx8tvHVp&QZ8qzTYU9m|oy?`?&)3)L75my~HY@GgcHLdn-R1kUCSLhA+RRxpqD4;*
zx+j;Zuv@qpEcR$~0*JNPvQ*JCCUu_GWs<G0Nvr>O<R~D&sV%1BTheOP-m)KG-P|Ui
z{3yVF{E;4*kmL)|+1EY6@B4ga9={)Ms@?Bbe+zf<aq3?B4`9(54^!lZ^$=x<9e6Xy
zSwqU`C?N8sYUwBUYt?8S(D)R%yg>vjJ!OJg)NvUbBVB;t&VN+n{D&+8mru1Dnq10`
z{OdQ5Uo78|&zPCOKp6xBnxPS$5J!xAg_Ijxemb~PS&9>e19k9*FU8Zbf!@VrJR(RO
zjVU*1<8~LCxE^0gs{PPPcN<SdcN3?fB#b!qW*vVZEpmFF*c9D=dUSlaNZdr7(zh4O
zow_GVGiA|(vHiV=>QGTd%G9cbVhE^g3YH~+7JzuTjwy;h5ezBQ0Te2j(zgR*v9Hmy
zX8qbdOMuAg85K<HS+mYP(<ywFcPzD|(JfMZ;gIUK67DGmL3v$;{dBa#?{NAiV*v>x
z`EYv_3=)re=h=HA<&>o)r8Vw)C{}fgG@dCEJ1jQ6f;7g>qSIM{UmL+o%J~4{Bd-P*
z$i8s^H#Z3#%N&;|jkT~`xNeA4!9t>ClrHn&fwo|T5L3mF&T};?w2CWw=uItJ#(%4n
z%R~R%pB2j)<iVd)&$hwBVp26hG;dat^B0;Td_sgeadDzPZ%7+1m_P3+SjujbtS8}G
zL3ND*Q`7+^@$LtKABuN8yZ1=oDKXufdfoSiP&Vo0&6aH>rt`H5BKgXE&G$PSh%mTj
z9U^@`9B>R>1V!$~jwr>_d_EfDe)8@prmt~K^eGPU;P&sivd6=Tl-<2>BJq|`gj0MX
ztrlcta}XOztIa)e&FUJG8fVA;Ef9!$YOh5e7So}Lfwg=>TW@Ku-Xjb2(Id`Tbt4mg
zbuzMH8J7>He<S{mEL82|h#oz1s+K@8HsT0KxIZ^_P11*wsacPpKMcJq+0dtE{^u)5
ztr#z6Ni8mxkXphlSyJn7|NX`gRr*te1j~ArTbj|V`5Mw}#pT+X<hC&uC}R)RW8TK!
z-ooC)74;B5WjS{dIsz@28W;;k^Bz$Zfzh3w@)0_vnyNeBm5A&jW&<Z#n$^1Krt2!v
zls_4=@^dntPu1;&#@&+)+w3rIKF4M6CtaL_0T8|t(>{P0ifmI1qwF&!!y^e=T208a
zfvn{`T&z>*&U_znEXt!Cw@nF4k@PIkgHY7>)vc`wq@%myZIrWoz{-7m=HV>qB5uG@
zKXDE#dq0La55i>Zn-S$UF@Enk8-x#z7Hsg5V4PRPwZP$cTVv}si`w77VLW^S2ptUk
zQJ?IenH&Q?QT}CaZ!nl*$%9%PkK`c?_eZg)A3zAf&J6sqLQbjjv^%|wQI7TQnZ@yG
zs%J<yc73CM<o$L8NP4&HVg#RZ0#kK&D{eFWFz*hTbH`2rUI}FStF|G);q<77SdMUn
zlSqAzgGxkfhph|hS>RuE!iVVK$F4u*JH!bjt}0h!!*k3#A5+hrm)*Ye>gZQzF!qAc
zcQfa#`_a?)<*JbnkQ;8sE%L!A^nt3#;6(OMoHL{?)sWLe>U*(K*ui4iXXzSfmS=Lc
zHT#h)%hpRCoO@1PFXr)AKk7RCCbnh4NQU0iqC%4EJ#^~D*lPGl8;}b_Ju>8V7|i^q
zlh-x3nl7(rpT>9M`m2cRI5S*dT>pE@>NM--%Cfq8C0SklHx<>kA!w-GUtLsJ7m4a-
z{VJlmnjxyMV3qNHT1Gq7qHX@9NdJg3%OXL#N)s{m{&B>45T6wu<Wfw*Q_@PB(3Kvp
z>jAX{XtW!Hf_gM1*V9DEW-x-W?~!5G8}_oz`-S@xA=LOp(XSZ(mKKVJ_g*_L-@JHX
z`pgIgnEe`~qQWqTKhNF`s1&hZh#tqcP1I&Qb{q7jL~<j6%C+5Uy;iF>YHwaZq{hl1
z-k|uF!@}6u`$t9zjv}q#z9E!)psD&Lm0h_TX}eWod`4BG=_h+BrftcCcpdg+ca*TG
zUcw@^Ih4L}4h*cAcjCYI-leflB_WhT5Z#c4H2|vH8G55rm3T#cB^VlV3cqXpAmaB;
zU0Q@$1ayT-P(q?>K5-hG4%4X6uzMQ)IQIw94;C9VxX}6kV$%r-X{p?-*0>SsDELin
zA%1b-PqGWPjdHEbVzq6fSi>q7KCYSFAfj?NBnX5GAa%MX9T6<>)Y5~Fl$^>%yBE?b
zd|otM`v!y2I`8}#y8C#jsV%!e97SC!oVAg|Uv~SG!ss6{0YzPc{BRtR9`;LuE8?TL
zlOo%=DtvQ_2dDTRA)HZ#`T@e371KoKR8f_?xV06Ro-`k1$F_hiTP`GFlK5%NuxKkc
zizt2yQ3{B{LH9^az=*u%{N<^oG>LRcIOmoCQ$1f}dTH5!&>a@b8MPJJ;xN*dj49`c
zM~Zh*9`D8ZL&YnFl>74&>GsHC1OgnGkpP-9)fCD+$VHjdQdgnOKQv{wR-w#4u1J}$
zuOTRlVB|--V#+3Kq}gM&QP(VGwWPK~PNtrxP`XP5`e*s%%K!c0TGziV&HvkS<N5z9
zZv8I*_pN-E=Kqxhp+`f{o3KpoPA1dwg^%or!%JrrIHT@p9C%2<7?d67VC)RXpU4>9
z9F3=&&U`|G$?5SmCkSx@7<Q}p=bT68bWW;0>HgYSmD^)KbQmZK7s6CVBgrtVBo8(G
z!y~>ZXEXe#xD&swZjJFqVYyT%y2BNrVk$KcaDkVUzl`Td-m}JAdT1lw1jm@IsgmW{
z#}0K}M4bJ2B+o|yUPL-#N>w+bDueujOI<=*+*hTdi|xLwU-PQjT=##07rt8lU$@d~
zG~)BW;ojZ<ek-3G^WQn9@9Ybh2jUXoo%=A%S4~iLo1eCVDq&(9ek|2HGow)OoB4(x
zajK*WU)@;wvIu~}=8^SoLb4&OWQI3N9Ztgf$l2K7L`%-0=Z$70eEOFR1it+<Z#cmb
z8Sb7=fOqibW#@2j4|yjKjys(F@5rfE!u(&}XnxK&g^fvFQZShSC9+!mUf+6%vqasg
zH|lmq-Y4r#b^VJo4N*c0G1U?Cq48rU9Dv?<Jao9Fv+?*nR5obGa(}v6Bx*NVE{$sI
zX3Iq5X~9N?Wnu8ipY_k2g8b@tNz7S<_&&M~euG|Yg)cUCRB@X|W_i3xsgOcHvsU=p
zu1Z7Ioe#O>d^GjC)JGC|h45-gBRG70FlG`Jm~5MxTI!a`!X`f{7K+^EO@o-~zI%S;
zJW_s_@NzVDFPC_K!dPc^C>iIHQn)ShNv^RDEmO1*!7K6=T?YJ34$(<=%%U}oBKK0C
zi{T&lEk-Ii_whC8giqxfJribfIMM+p*)N1{zbfkJ$KC#H-W~GnB+L9{+6~k9@eIZ2
ztn<wFgNPLhrspfd2xf}KnA}L1&hy!;!<W0qo!5u^2glC}Zpo<@)#ZCEU*7wZf;lyC
zK)*}NaJgLO=00{ioQt|U!Fbazxhk<cDLGOU1EeJD$G*ClP3}dNe>K4F1SJUot?C8&
zp{l7$8|pgLY$*t2SLqyIzxr3{9FR3R(2`dc6(pA3S~^Tfmhg%{XE76BS-#hn@&<l|
z(kM>)s2F~w7DFeZV)$hWC~QA>SU`D$NIda)O*+EvxMS1oIaW4CJX%~IJXlCaSt_k{
z5r1~#O~DZmhL&fo-EX<E*ihaJoWi}J_`P#4piwP3VN)e%!Mai`iT88yP!=sIWQ}o1
zqw~p7<TnW*g&OEqa`eMc5-8ko?I(%&klCXihy244dJ^tuLlxmnrqbFP88<Jx?>#3#
zmeE+$?zoSWhbp`JZ0t<uqY?BDv=Wr1GL$XZ`{&3Fl7Bs~-^En}vor6KbHB^I18R@v
zq}%t0)QT5K{SY`&?ex^+GbAxIWOv0UrO!J#@%qTgA$4_(0|A$f<H@`?Bnt1o-WTj1
zYRibbegRohDay{RST`{y*tZ+zRKGmK!{s_Tx!LH!y_^zlnZmWoV>;8WCwzT`k?T%R
zSuE-CEb4I~v(!*MKzF&JbIn*F66?d-TH5MF<zh=>xYCmbT#(B$Pb`_@{21Nro$Qr1
z^9+^L#85F?h*t>4K-^ZLn7kRNYed(QeYl^d9Efcyy;|6<^nUR;#*j@>-!d?YA)DyT
z{Y=&4`e=t-7~|-ztu2yhB-Q2*@6Ai8UvU-;A}^05W0tmrUW#diGH*-9>wKWG{wxEH
zGFJeNnYs)#%2=S`o>_~<I;Y9*f+3Ez4w52=V|q!Zw6GMGnYwuyq3*^)0mZ%KsDING
zm0XB-Mq`5!|FCYbNq60T7>nCi?+DgST77;&pi(e)#^=6i=*op9v}(_Y5xbK~xM1qg
zv`@IkW%S*QffOz=xBFN>yFCQuNgUYF1UQ)Us%U{Mugmh5B&s6kN>sH}sJMPTnR+Mw
zMaj}#&%Ge%o{AEuNS~%jlUAkFDGfwd%%wG__<xrA|7HmBdw4A$6Z`mEjqLkBD~bER
z+-l|ja~jubHRtDlx&JTc_@Ddz>A2^O`d7IKcFF!v({0sa<6o`c-T!twpQZlaWOk8t
z>_T*~{a(Pgfj69Wd3nIaT1L$1=u>xkKA)IRd@@=}QIu6-6Htm`V6yBBi~5kN@st4y
zqUjF<7Gfmx7RpquE&RQ>lL7)LECDc{g!Q#7?~l(Xw5D*cgTm4-I&tf~(@k`{(=Dcy
z>y@lBJt2!pXTh>tQeS%TFrYq%;&*!Uli!-ioDznyt*=d}`{$;`rjD#lI3O20Nlc1p
zwc2<y@-E2wM4DV(vFP9x8MR`+g_#tfBS#EzKg2F1jiQL^@=i+WUPkF2FRfCBduM=;
zs)qdzgS)~f#S|CQy^UutkLS($hJ%*6DyaHi@F;vSr{5c*+it|4bA?Cl_p%BAoj_v0
zOCg1_8fG;tWTQvaD5|%;w6{I2NJnU++XF@Si40iG>8d)#?%>cp^H7c)gIE0_A6XbV
z;|a9_mvHw}_tG)l$8NFs4XZqgQ$i*wxL0711^gjS>q%B8E@Hiiqw`gG*23v{@94Pm
zc<=fCfvCFLml>#U7b*zQ6alWWDO|!PvH5dD>S+cs1}l7bK{}k-f5wCn**kceI@X#Y
zG6{9#<CcpBgWJa|Fc5P?+~T7Ms$vWWR~$ps4+lvGPYH!VYy`t5>@kcZq)Gv&;HpSv
zHLXz#5(R>E<WffR9F{`bRJ7NS8y`;9{5*gT%KKM5F_(yqPOwONd}Wk5ZrPk22ozZa
zQWv&iE|WtvAYhhj2_ciNF@dB9oXQ3XwpmFwjsD=Vu>H|X#$t4pu?V8cJG$a{gfzAW
z!6Y;l8pQ`<lsyon(9i(*qln_BQ{8q(8NRy2@@6{nVp7w5l_I~)*EY9We#9j0?m|HS
zB%fvW|D3ej>v?~!;QyhwjryJc=QcjM#=rmmDsG?fvn2kn+Nd|<{=a(bF8=pcK1=;S
z@r4k(Z3A!U%~ZreFks(LFn}N8{TXf}d4I-sdw|$~yg%_~{j&mFwGzGCVP|>)#R*)2
z${@?}`?C^`W8<l8Id#su!I@e}jHmCtODwx&RGX{1239n7nej|;joQeCMorLA$Ef3Y
z=*QPaWRbPNTV@@9#E1r7ciKOr_556?7s{ghn(0v@f(5^EOr<gpx+<%r)<HIQ;}3L+
za-v9igOsFL1AG_!2q*KxVw^oeB@zJL92PBQM7XFpIR8(=9jdj@^N#m{TVs+Jcx*}>
zzRCTM-V}A_Hl=3W`#hK9_`F|*N7NEMB<1aY-V`cD133dU_w?bWv(G~-yZmX%mT{t!
z#;^ELA6Yc$UNk(I055D}l8T2OiLKQai4a`aWB&o7Q?Jo!13<FR>?oveA2BOmzuR*0
zFK^<9b_RX7*q=iyocAT?Bfd$o&G%%mZEk+#;%4dh0X_d1aP<HCi5$SX4@=@do%`?0
z6X*Ld9^qs7w#simT5nM{ie30<{Yo&nOzc8z%z)xY-n*C4h%vINWbiVY4J?!uEW*pC
zV2D>>^<i0Yh4^GP1?v=qltqv%{9cCJ^lu1J@`Lj(&1qtYN6Z+i8-6hx(nkZ*M~3t>
zt~px_>q|I?vGJXxr;<*3^OQ|ZJ*%@w8qE8BF9<gDEInkAd&jOqURi)r<;)VERW<+D
z^Xy_7tV%9rEN9E%R1(*c*Q)N78qARISI~2mhJ!s6L%#_RU+f?6y*$El%BQau=sjw>
zOn#Fp(H7VTTpx0S+Q&^Pg-LlLm>WW40``vfL9o8cPKe2o2p1mBhr_~z=i%~wkS}?f
zR@8dO^E5n*?W?ocs<b|iogyic8p-6hcW>oi=JQl3p=!mveM^>20eqjv`TjH;bSU9d
zL93}Ppgt&}ptC6H3B91oG@SkEl{gM^vHB%My@?sEAf+mv##nL=i@f8RLUDUly$aPA
zEiCy)HC$HykWpQ%eq4b{hW3#H{n|vbz%xtoU~@!#;CUlMc7_sw%r}2DVAfevNmWpk
z&*<r8gMKUS684fhB3-`Wc}=uaRJkuNL#%gnB(7@jy}*f$#|Ie<j33gqee4d|&g3+0
zN|{h?zn5m;8*KePWNQfqp8WRyE%qKhgimdTWKz6;TT<_sr28}P9FxrH4yRssaLM!{
zo9Dd@74Vl@(J?Uo=zPCxDymrh`z0clk>f&7$p~MQ1-Jo>cZ3XRpb&W{h<pj*W=-vs
zzS=;O0Kep1G?qyXKRF-r3yoYd!?&kHevuKM{{B*lkyc}wz*r(LR;7<MpYuqIRmfuj
z4|m)dL`AC+U(tmkRmG2zrfz1an%~Yjceb!*{@pTje=PEFCL-KZ{c&cg6m9m;z15Y=
z|BoHt;OaX7i~aw#id&24|8OgfJOBT!d{*}VGcR<4`T2QwdMT$UW#JA!m*j{ulCIL%
z{>=Z#hy4P+=Lj3xlL;~}uHndYD03bm2J*x|6~JWHSID5>J9xEsaLi|?KO<wK(lfXr
z!*x4=*a5=**|4x7TpFUV5n1Q=4ZQ9HPZqK=Z6RJXGD+(RfQ#tEd^p=!)-w0lYF5!8
zYSRh5!Z*{Vrmop)MDefJu8gJGsyw-Fn-b1pa)hN>&_Xlx3P~>0Ygzb4FEc%)BXEY@
z>8Vcct41m2iy6)e35E@U@(TkZ-^s$jLh@&WQ*_AzOwm*y`OS8j$Q0yG*>N^e__Q|}
z_s@3h)B~W4S!N_tz2uAr`pc9QY8<WEF=q9O6V?peJi-C=&dc3jpS;*TI)e8?PNe_Z
z**)Al*rlc2U^Cm7k;9RZ!Jypr4O5XaxRhUph712HYA&s0v8UDM>H-Oe6oYc5%mZf1
zCuw%Ekh0}d(s`XaaZMb<i(gj4a-<_zBlI-82o6~oUQdF?kQgM97~DD%dQK$9D|~a^
z@menQPG_djt1OgvRx0z)-gImUr#bP$saHtMeGO5)FyMt(0(1irr1+wTCJuUNf)44E
z0X!y|BT8%YA`yVROeV_MS=xz=*3h5Lh9r$QxxodJaz%NktA)Bv2zTI5XP2GPWKQjs
z^sn>o;G-XezxkzA>wNzCb5u+H3Tw%4T?^@j(5p;=n_t{&@+@~A3kO6k7Th<uPwK_<
z&Wqi{=X;%(`v=^1afQaa+}RxRUh{)Sm+jE-p@6AmuMD#@xNgd`K5}c6Plod#zD~sS
zmhpt_X)djY{n_rD7spqXFU*}JSa<-lT8^yd<!jMjYyHckGiK`K-a`3#odwUFs0kTw
z&*B_nei5Flprht|7DAy&xIL6a>|`J$FK-7OQ${Axu?6TYqLVdXaT$JlC}j+o`SRN6
zWT`HA`c1Ffe}6hf?$3^h-VWi{8zQZdz0Jf*$*f>bHl$6qhO!cEZ|rJ~1ot6HX{Ax{
zjVYXEXR0hI_Fvly%A&P6R8{OkwmE5OSk~l7QHK_-;bCibp#`m3Bb&4oWsKKnX9IN(
zRvysGn7j`lcB*DHCX13_(^~r8$oO=I?RNT?cg^WXpRp<2r|-DKN3|0rB*mk5V}DfO
z0_thnc?wHk18c=h*)*?GLT@WAF=AISTrC0=cW|ls3;ONgH{u#U@t6$817bI&6sWwB
zk}q<B<$Ei3@9k+fe>KH}+3Qblcng+)u;Hzc_+t%kg~Y$1;XRA2<H`b)J1+Ha+lmLC
z5seK@^~0sTzK->t=GeUAYH$tT<qa6NcTUVZC+1g_rGHlGb?c&QiLf!XT-<4*XvvvJ
zCA_tNPUMM_u$01_<|<jCKN4*?P)S6%ygl6a=H;G0!m!_?1uLp2nLl#qz^I)q^pH1n
z*zE=UZR(u{tEs~D6_-5nUnqv2Rez*FQ*r*bqSSn7W;|7_#h1c*!|^A_=c_COdK84W
z(29!6G4+4ADw`bYk~1C-I^oZ_C{pDYd-;O07)sV|aMVEBCMhKME{Zr@6%;fbuO<!=
zS7srhD98m(9IT!R9&rI4y-l>Xns?GT^H0o808YjM?vo?-m8|8fESq;G(7MX=M8fAc
zx7vQYV2MmfIhI$^a=4U#xI$vlyzYvgf!5%vXbrw9T9Ns&GGaGnpJeE1=?JTZVRdv>
z#p@eWE3zZ6NLQe)TFJi7sH^4iDriZ~>yt49GhUjnfR|d_zt$wVDq5=MZBLOaq8sU7
zU)AIAr&hCX)<a;MDWMFyl92+MMoW3>-h!4IS=$JBy<it10ZmW#On4}ee_H}D6@x_-
zumIw%1+V9MqsSSOPSgA#iMWj3Xg0izLA{nQ$Geyj%(!Kf!*8REA3{pQD6u7Uh8JHi
zh*W9ss!cc}Id4`Z3Ap|AE$e(roatmz!2Z1)N-H~S)cDfZP(_V<d~ZktT@{@{20AyS
zd0xW}7a?iPkOZRE?73UH6p|KIGGwE?zrJ+5VvaT|%D$9%A+b)0$9DKz_Ipq;^X+2T
za8qSh)zbdYedguv6Mb@>|Cvn3Cmnw<KcAF?v(?*JcK>h9ZN>AySMSdM+|K9QZywT=
zei)psuao#6PiIOQ={$LL@a)lsXw={Hq05bRS^<7@HZK0-pAyH@0bhLCK=!8#cf)z>
z>>%sYXq^vyBtZSgKaHPXN~rriUs%H2)g|rt-1?1k64G#Kc*;$6g6{cb=zU)aAMhE=
zkKN(-m5ucie|`N<=&bt5HUH&7#~)wq4B(Rdf2~F>p8wBnwyJmY|294=pZ`<ugV}U8
zo}YIwpu>2h0of_6-LP3Uow7~f%{ugTG%i#Owf5ay>$N77!bWAoR8C`7hoLhQL=rfs
zA?&!uOivTl4O3;2<r+sy_WaZ(;jHXP!Zjl?jz5~r`T8>Rp>7u^fJyZmcvE&#5M_GZ
zz|-HuQrwSB82q*)mou)h;S8c1)h~89FQ3ksvv+t{@QQ0|WLAFbg-`$X=H>3Mg^S`^
zp%8*7UVQs4;`5?HM=6C0W^t5`QG~Bz(n$u_{)us1TjPJX+|nAb+1o$(dG|%JwDxBI
z;FwxKSlpLVtneyjYpsQaxilB1e=1AiKH#Dc@|As1lhXWmdHF3ay|uI~7p_-hNYg}E
zTa%HiSBn~je8sjhit!L{Mdd1sz*UT9rQp(XTN&k~U87*-ViCX#v*o-cx3WsA##K>+
zo6<pQcy4wXx47D<Ir)m!s}2`)mXxbpaIuTU_}8n8ikZY{Wh2)L+jJMutR0qWbD{QP
z%qkr&)yXckLN_bFa;aaJl)5+-V5iHV?JgL01Gk7AZdO5QS40N?NhujYbcIFmZ#A9a
zP^uLXxSc&%+g&czO>c8MEGB*3T~h2sNQZyjW)iiAF8Ay?mwUdfT;+lxE(ciol|e3t
z_&H*zTC!X%EcZW4%gJIYSw!fy{>lZy9}p-;=!l<|%}x3Bczq0$>RD^2nIF<#R5$S#
zH=N4q>c0(@hUwH+14J`o?Sb_ML*)QeTLoK_(xC&|(7({o){m^tAU%wRBKLQ0{RqW{
zA*88aN&QPI**Z+<XWP?i89#RJ1-KyG`F-PF@H^>%Xvw)Z2$Pwmfl~KKTR6w?R44_K
zohQ+sq>2`zXQ`d)WeyC}(SXmCNfup^Z0W%=APKB4qFtqg7MzL8Qe?g?ODv$dVkB{H
z$R#vlPp6rZ@$s8yFZK@B+=hxr!Hr|`>}|Ad6SAfHJ@iJAii&0nVP7#sWLoK_)E%RP
zvGY&r((mg@o>kZt_{y&#Qjv8!Kks&S51$`(I>jBXWO5`mFzTOAq<nU>1Zm4<(*pqF
zv{%Wk34Np-^JkY%LB_!O7^u-GLbRx=3)=#YCYGNqR-nR!N+x}ZQ6s4q(we~j;(R*u
zhn_<dU&|(fN>p@r&{L96GG_cs3n3mDTG_}5Z?@Xoki5|kW+5rj#nYawF!uub;&8b{
zk$R&E%>souDpE?(Uw#oU?KleJRx?Ni={QoK3uTr;Azh|i%Ta2xyopjxPWzrx*66D<
zKxgTJS-^O|mG*usQD7@p;(<}(feGS^UU6iw^e<FfWg@3d-)cM0{LP%Q_B72gQPl#7
z>+RwbHkt`aTqkCaZO)J9GZJqb_EcXwiHaF6h4@^NF*)<758xg7!W&@nrct@acl+GK
zTlzu2?hWqY7d<q}=}F=w=15q=F^V)|^C+drCKqX>LE`zNifv_pN<bn5J-w7;7i%mj
zwv|%OEU1dnWX!@#mk>a;#mK8tTeVb@IuW==R*QC_>_*LUn+jMOG3;{TFr|VtM<FVj
z+L=zb*B^9HwsY?Se=8Sw5<%<816AbP^fHjcs>GNJ;DHIlDDZ7+38TQgBf_a}qG`Mz
z81MCK$9V6g6?kA2c#u|LE8fD^f&$Lc5)Z5r`CD1iPqV(iq`se0|H=aqaRVOE@W&WJ
zJvB@Iif6lzpXidmW|h>i`0sc9?~GUK!VP&J@LzSAh=o(Vs)|hTH_V>S-k2=%4+m0q
zI3ArAg^cNBunNY@SrGla5d8%ZtsxqYjgpl`Am@uf#s_V9VS){ZWYOpie@#@Ox7pM+
zspc%FNV51sN}CkS13giEG1X17JIiTr5<dfcVg$?~a8?-yb0D0Yqw!&-!AO=~G!`FL
z8j57;g(LA{rGfac`Z#>J;xK%;!YI5`bPabq77;2@c+nWV^H+f!FT8LB-i>3W7Y)F>
z`7+RP`oFt~gU?0&cfY1qi&Nh~ZKmisnN0`&$;lFeCQC1(=*(XUcA|6$JGK00g-f8q
z_ZDFiFS`hj&;AN<{l#!Cmiauk3oqiB&+{dK;|%lpA_hDczkL2Rt(IaJ+y1>$KIiNm
z>(YW!Y3~w#u?2<xA~A6J;y-2=U+?}$`rfR>?|*F2pS$>vTlg%E{|Im5IsWNzZ};iZ
zTGhCm=itfV(b`&7#xcbWHM{8ax`E&4>4{%6hyG1mwu3i5F<Rk1eT(^N!gqEaLOkY7
zJzPaSn2!>V2vJ`@Fr~-ra^gX-sC^fW-r5@D7jEsW(T^`to}*58dfJ)oSZB&p@-2PT
z3729OITI7^uu42HqRP&)EhQniv1=4jfvRu)sQSIeKQ10T*il6^UCcsXlIft*hHu*K
zd#PO!e8c=u!Ec&D-X^+{G1dg3oO`@c_<|{sLKfAsL6}&oD!HP}NLOVXcRp3r$O%;^
zw+h1B8dQB9V-7bYV_OPAIGbwdbgca$QFUwT4f%Kz-z?xw>F;zppWxtkJWwhBQl}?e
zDfW<uF>OW4AOAb`0&jMuWnfACU$fp!#Q(aL=AHb%jn7i~uOuB<kl6rH;GOZr8%gkO
z-<!+|e1Q<Xopeu$qdU9>YzDKP_(PA=VCV?J6V4}hf`eNCRoEcb`}h!NoJbRV)%oS{
z)xnFuTakSuuW&L@E^Biu0JURhk<{Ek8?hXB*bX<Miv@4_&ZwoHyg`L1w}0ySsW1yY
z=A6!&AYe0(h1o%g8ck7w*Rj8D2R%nqU+<_|uXl`WAt`5y7IlpP35*S+M>cdbQADmp
zwYqa^V+C0muzL!S{t({;t}{i742-iHvv{Xs<2M+0B2iRGCB%|(<eK&{#*R$Idv23*
z#coq$v#8^qGw9B`=0P;sw2C*GGWy}YrD5=d25C?dvu$*$IV!%IN0c*kvQ!#&##8^a
z<iyd66{6nHOtwob`x49Y-k)^*lfpOZ<QO0nS3HwBp3KU2<Jqh#xTj`Tx=DUrFn)@9
zX{}|$vq7i`n>Y{TYBx4&NhD~!@19OQ?;Pjbdfx04&Jq8fLge2!_^!1L1>*OZxcGfT
z#O=dP=NQpSfiGPGhXv^u=2nw;h2@*0u~EGK{L4-7t57^++_UDYz8RaTDCBcK`Li>}
zrnjo0NSiVlIk;mn(QN^m0^`PLlPWHfAz(`=lhMtTVTi~W<)WIY6s@F-444~c<Ed&h
zB5N8s|3dT6G!wKMrj)cZl49O8Qq%aHJR4y<qRRD0Gn}xee`)%3`s2wZqWCMUvEct-
zcJ%5C$m`jVaRb{(UCTQvIVtMkI=Ub#q0#iFYMYsJ3F7Kf#dGhxKe;U2H?c11K7^}v
z)JD-#38nLk7svk4>yGA=SjK_`c7%Q6nK0tgl`p1+qGzU#Cd|bpdNX}*o~V)Gys0=y
zu04ZUC)Z_|Sq1bh!B<Toumlm;M8u5{QRxlRh(gH4pQq3?rBuWOJ25}PB6hL+7`|AL
z9)YJ8pk=K)smT!dE@!papfZ*k!e*kynn_H)mvITwd#Na!r`K`KqQUt%{6Fr!3lf78
zrQuuF>E)|!T!5Lqj+R)n-w8eUwu!xvRI!N^kt(=x=1=2jEhJ(|1FkdslQM<pNNjmX
zcyib3(K9}pd(?Toci55FYbpV*TZ;~ey?Xp#ox}Zu=bguIo^_tQdUJ5R<~C|>`2KM3
zXz#eQe{j5a`19_IwGc!l0`c_C%hyJUTC>&4>r4%;3zU%ig*U@=jOi{^CBQN6za^1>
z3(BcGjYHN@D+qqe+L7=JCP-x{Scv!boqI7#q=bL3Iumt#_ku~0F&8(&Q1VFo<?Dwv
zuGWy`Lv``wU5aVu^ffM}mXX_>U}3w@0|;DG2T@(?jI!T65|^yH>R8V)dZlI=eFUa>
zz4eXB@~k(LT$64|^Vnu`w4DczFObsKSG1HCyRSjVt{wgos;y6;b~y71>3o;!-~mWP
zJtqJe_EeG@1}m;az;ybhk<X@{!hhLLLZn_T@jB$#Qowtf>De0&8oU;tG??Ig`LSF*
z)77->j-+s0NJkB%8~fgtcj5C55rTo*Y@)%JmBv6zH)cF4Fg7VP%C=5y^RBU2+swJ&
z!KC(az89p;zp-M}y_pS`Wh-Pj8p)xc)sh!W*=jKj%p^!_1T5A`0UXWKv;odumg7T}
zGRpSit*^CKBny8hq?3M=oag$Dy)@~k)*`UJ9y)b^5c=1hu{lk@tsKvRPX>FpKOF~w
z>G_FvhzTIA{|SL`A(CaeG)P&^N#4@r2jsWQXY)$)Cv&b4IS$dg$b%;W*&fA8`n&?B
z3AqfL(oFC@f&-NvWwn&r6iV-^Y*Y?sbyDkvQ=o;mf98BbR>PhLVCQ2T9#X&{!kLUb
zvEz2*HFD3bj{j?KN)$WS*Ug{Iht7qDt*VNvIHoS!Q}-fz3u;!xdf`or#H78*MqMLA
zT$hc`i18Vzr@`k3ak?c?8m)knYB+QZE@LOcS}oI>(7Ih2UxnM31=8rM!U&k8ZB7$P
z``UmFb-l^dr=HBl&U8Lvi3vT2kGBfm_U58xIN7_6hCgR<4z>7(M=AZC^7o{_HJ@sk
z_16gO%K6E)|BpnW*9ZVx7XQ_(G~)4J&3f%_|Nk~VE9d`_#L3_Ynjxp*%^073-16u2
zpbZVeWl(;K@KWDNf<4|pIMTnv^Y8lH;i+7?uqLSlu{u&ycp%<meUkwEulhR-oalxD
zf&12gA>l@Vqs>&kdg)qQKXQjS8>^DeIw$Lk=bhab`_B&w^yT&L^F3?<r&VJIwXQ5U
zu*_FDz{lZr^ri5U)=a86O3O%Jc2)K6U@+~F)*{^~X6=C`4NM*ep{fjn`u>B_i4k8Y
zqTc8MQF;nJM8KNT>LoD{5S$g$F>@Yh>(?NzzVX4?RE-oZ1NyUynTj!%9x_c#dK!5b
zq)23H?~f2Z1=R;{NHfK`{R>j~&nI(E0Y!9R6z+YVN2leJC~B*G?SvMU4C>2zdZhrZ
z<m~x_SCd@w|EwFFeKq;-y3JNSA^#h9@xQn7dAPYwv-0@N4;=Ou(qH6@7&tVAc-wS#
zMy4M<osfC&j8B}Smp>6VcvDm>oXuvF;QNOUQL=nG9-j`qGEKRMlZV0i85es<;u5=<
z1R<D<Z9+OAOv#t~$Ij62d!xV$VG*cLpFWkL@CD;Jse9$|^z@-B6+ArmXItt=d2%)(
zh1_{Oo}D?c!iNrKDQV7L0B|H)#(kgTD|s)SjaLTA-TDsZ>PJ6-q@cdf#?wo_uLzd>
z*x8-KYvb%rNdN6!mKfe>z%UZEro1WdoREd(R4Z-;_33Ywa66{{dn9;dCmNd&q)MO7
zG&t20Tt(oZq%-TjC(W1Y_q^|^5XwE#m7GGq$nduSJcgkvOxDY}A24=AZh-7vI;Vsn
z?=C^0VE_@5hYNM79jM?FZyHdAac`zP8C}K{@Tl+%j1i1aW}kp1ur>%g829Jc#a5RU
z5&HxPZ6;mfNY&UVaytXBI|M+&7_aqP9+~l+gC1s6zYj1aM-&piaaFw@`ZVy;2oC}1
z!Glbo=U7K&6Zm{Q@K5m9<Ni(Ny`dkR;eKC0@6j?)0uL&(Gh05ys^AS7IRfHS2e{J_
zj>5gv&;-PtDRKpP^689*-0F|dSe=mIr-nVQHW(B6N^#yl8Iy$lgg%m1Gw^xyNe?-3
zjnnOoKN=k4kUBtED<;Hbj7D0$3eLJ>>MMN?dx*?v^i=n33N%REjb?s#=paKY+Ku<P
ztnv71&pCSa?D&`6!#!vJ$a#JE>gWBZdrzH>-6Q(FQF4CSKmO^}n`4Jc9PS<*|J`}@
z%-KEoyYsjGgQq2D@7LFddq+pkt3yEBfBE{w{vJKXHHvSZ?jJmN9#hqWSI5qaeG&x(
z_xKgJsi5ue9Rc3Uy~8Iz(a+t-`!Dv7|ITyq+5YhXAU}I`=<GVLcMp&EpS*dod+5A=
zbNKqz(H<f3lpr7MA3TE#Z13gX!Eu=yrf1IH&-BAN`iZnVv<7gyZ>SrGK-78i>h<3b
z_n-fC?ELiV#nU}{_;`=-+kO0EPg<kiJ$bRa|FYyf-F->gAlG_DfVh(=DQG&s{IrLs
zXmywV|Kxc8)dBkR<ki9PA^j{-cMp%l+P~}{?UkI}!~G*r=Goz^m)uiOmnywtI8^mu
zPXK}P_5e{4{C;z^7s7O&?vdtt@SH~LAU>cN<cI6)%e4RKeW(?%9X{#~MJa%VppQ~`
zqxm^hAH3*%>`r}Rw9ZAl*{M}aDNo&MJMp+#$K&-cj`i3$Z~;Zjde`%3LBTHVsBdDJ
zkPzvgkpgQx>mzAW3YOnHN^7fCcd|+mdSNm8o?cG65i3U|>duF=?=fRZ`9ogiK|!mM
zx_@TWwB1oTT7TnR-Qbt<a3fc*qZ;%yqe_ebs){__SW1g9AL-uTJ4gHfv$s}lG_5#b
ztFe#Xl*E4Ly?2>GoRR~hr45Ub3JF=5%!ousmEI-sJ6SnN#tKRK(BYxBs(FDJHIED+
zn-1YhC4Z)=45`t9F#CH!Ay88FN@o4yg5pGm?ywZWFUCFMC|Ro_ic1+fQQjP5bDO%&
zwx}j(aVLDG5vn9`QUw$W6&njU`N*u<bf6461V3Cx*nj%Z%9j!%$z1iPRQ<vUgVZm4
zt2P>6a8Co(VL*ZB4a)eI7B@;XjXa*zn)t0Xor=6OmB#)H_@8aukbGmw;=2ZQLotFB
z6x#VE;IO6keRT|)5bQU9Go;Mhl5>ANpT$OOZLLQ<{+=yMXTbyuQR1s{2+nU++1)m0
zoQ+Tk#d2V^I#PNHFF{I*eHElKg@mzd&g>_8IVYd$PN&^VaVW1Q4*$7sb3=>^Qs%98
z`l~Lgc_PEFgGlBx@pR~3Egk+8LR*8Mjz>gr8=2K{F-JWU7d7TLipzo(0diM)acIsn
zxZf&o5m;0yI{(s7Tz=9vo>cjX+oVV8jE6k0@$;(W{z>7IZ~YUfGyk=x?kjk_{~TVP
z{oR8_3}oCzRk>(Z-CC_u^WN+@x{C`2-l|${Hrv%ozq`1q9w)16zu&A@d(D%m>bKsI
ztn0j3_bMlimgm*3fOW6t^}S~GDp)sb?Ru}<+%~Z$o9JYrmJmhy(S${$Ut;;wyY(y~
z$XGh>Vw|zE+zSdt1BZLxUN~eNI;Z0qzUw=b(v&aFB<3yMy5(Zxv{H(evOs;)N)M8P
zv%`7KZOZx%%>`?oUcH?MP9ZGiY&mW*dE_>}f`;Xdbu>$h3e~3jveF90)uvwvXgz$S
z@k;I$7!tIYunf{DqRK8#({BpI{9sWy4_x8VoN!g)E1uRh$WuytEEZDixzXfJ`2TYG
ze@W~0&%G;qfS34x>(yp8e*Z_cdguSWl~3;c50Cd>yx4zrz!w(~4?Zcl`uZkh&5X|_
z;TYa|;~AiS<F0w$z&G9(?$eKwQ&(9eD)m}2kXscW1zfmjl`i3KT)4et|7Uo~$M;gA
z!4;6e>qk(Kv(D?UP<v!nm$ozNFA_CI_p8h3Qw<4(7XJ#}g5NUHt1iM|X1&zTb<N(z
zS)->EZ3DP|&UKekq?bh!_KW5rN-vWt5r|xLIiGZ=-nB`yhy()zf7PCbqkDqD>|=Uw
z-qFihtrI6UQs9J5E`gKMm7eNKbv1Ndt;ykW)-94KyCV8qCSda(+@Ti)A=K`Y&eT`y
z%vM%!tVUPuN>)$eBwExNx1>cptCasHLsYX5*Zeg`D2FKN4hCOGj70El!tA6IxLv3J
znybp6^?1w%HOHG^)_t>CortmNP4=c?LSIo%<?B`+t>B7-n@$(s=)9ZN@hi-e>yBa;
zj=C2Q7GwKI4Nfrc;V3~;tG&tDryE(sw3cpkEkfwl@{U|WO|upeSrJ$0NLagajTI<&
zxAM%t8yjOk-v4@aGve>X>h2#nqzSBD6YKh)e*Dg<tUnpvfDNJ{g#xsa$@<j_Dqnx-
zRFl3sV3TL`n)<T{^~_1@R$C=!TYcJJ5C1$PH}F6DgRf*D<r`DMz<zfvdH`T>osnFr
zGqvo#)V@Ynat!L?G39^zUvp$rO?#U(p&fJG@w+K5)Qdsi){|m-Z2#Y^duiIjs(swP
zDYiWykH)j{Naab3KP=<}GM@~{yvykUl{0Zxk`oJz_RnoR#%U%8Zyb5UA^+Z>946#?
zH5y(zhyKL*nas*x{Ly=)SQ>iXB#`()1iH#D`9JwUn?jBF%ahX=HV4Ra5>GYPZNT%Y
z_r7C%Ny8vTWy{D0PG2fUosfMhGI$Kn%$1VX_wd+*bX(cc18>H$l_1D;JREKzJ4SiK
zgqS7pq-{H|7<^h9G!3_N*8S*_t?rE^!c@BquXqB$plm7qaW&;RN4Tav=B}i?p>aq9
zpZ-`+ytEpN-sxGM_D-f}%A3p=;p9qrrzX<B)zP~@#V3FM-&uclQ4Y?o(8iMUe-*c$
z%>P@h-tGV0#^>8_9`^jv!{CfW*opI-vvKhs|MW)S20jJ*Wy5(y&)f~?t+RtbtI@iH
z;D_;arcTIpp1eAE_K4HMe9!0E?Bm1VS2os9{JTl}XZ_@w|L^9b_h0Y)Z>!=a&;PdW
z=KrmHmhb;BI07)A`9m{FxSVd31Oy#0O^1_G$i)ZguO!Wfsz1cZB&!hBOg_x6bKbq|
zdFeHcS5|#F+4>35VV#rlluP)dQ!DkQ6LddCFRUOhsi@wmW3rMvG651f4M=Y^U`6>j
zW1(YN)QU20hN)0=ruDRg(PnxT4hvf}3IzrhR^3SkktI*dCiD67QQkr!jJPin)FP*$
z2;(WA9q#RQ{_D-b-$IT1CC)MtIe-z)kqtRc4^hE5uKSSwLv%S#kx8zTfjZ<HUcv2`
zGLG_+5rWiKgai_sC5A+uJ-0?gB^vz_ACn{>rjCXp_na|^(?6Y;h4OQabDZq+KN+Rx
zUz@nbRLw`?MH4+n+?zs}jT00rgh_ll=l&=}4nMn+-zXfRV8=+8PD+yZQL@!AYXGtF
zL|}GsR#Of3f*DKbWxU?Wu9;oQ%C(xosz|;Zf00@`t>A(NVuKd19lc&qGrN-2FlWLM
z@~it~0^=+R%_E&0LXT)>E?u1!A;^^)iKn%d$|zvixUu1fM~Y!~)EyEbe&CN}r6}2?
zF8O0TYa@$?;I|6NgYUZEMTrt#;{@|~9t<y?Xp&n3zz_6QG~OUemGD1r3X;Bv+hgBK
ztSR+s%e|>4Lx6U(oFg(6lIo3!%HXphC+#W4E$h6HHsY4dlz+9*R6RKGJ}p9i^xaI-
zY)Wagw*}#f&Ol-YpM_qWYEmWLA_|3_0iqYt_^Omr7-+~TsvVueVHTCMO1A2u&d<zj
zUY;hPS|gXr&a>16meVw@wsLr!dIim-Go9<|ftv=5XeqKN0vh>d)xdoNC*J9FJV#!c
zGejSD#4a5aim_qjUU=x^%osB(1N7Epi2Q$Hd#WMJ;rNXuew}~)%T)Uez<W{lKh88l
z3#QI2B8T_0dBJ7`EH69Jai)~<99WWKeI;~r;+lfss*BNrB}HZN%eg+Jmd+*M!z%z%
zl8;8{$VFyp`2s-z5I9=aX|5bWBy?Wx{`%y_?$ObfyTs?u?J$C?v|~4dDXOw2BjM1C
z-NWa5otHQ>&o7I`;uX&tL_{dXp9;!%uGRmQpIrW*;rR3`-v8NZxrzKg4foFfb1R=~
z`G3F{hWm#NBUyBjm66__VkI+k8sHYVKy0@0Db7(L@hg2Bx+L6Ryn5dGdH1lhf3SaC
z*ciHUGm>4dnk-jME!XL$lq{=Q;b1n!(NtZBu_`%&9It=K60GtvSEBQD^xLq@-HM@X
z0@PsK=^?3CL3&igBF|9dCQenv8x6t&sTHfsDps>9cDhTea*;1~AV`?R+Sz#O2drZ`
zYVddi)IS~J;+$_XE*9f9RK4t#k4muyGaH}#xMrCkc6x>TsEkcd!g3U5#M?c7^>Y77
z=Wy@E?yq}KQ7y?;eEUt>^KP%7`KsJ2XTBV|)djC=|LWEo&42Y;?d_~m|N7Uzmc<sJ
zw@Qm8k|8?bYZ2^<)5}epHm*#Yyi?JbK0ADPJDf)u^G@UPl_psRySw1`m$dj{02O!V
z#8%PcD)=s+qV9qzdM%v)MKj}H!|J~V-pSWS|H^VLqu<q(e&?NM{^;w@v@D8O{xx(J
z$;&-WbQPVWE*;A`M^WYEB)v}BbnS+<G8$Sm$rm)XXiZ(vT(#3nuh`2~wU=JC7m~Bi
z8T61GZahP#iD0awcY^sjtlWA<fX7z#TV2%M<r61s-du0e<<to>D);hK?=1w-%LAZS
zw6Z#wbH9F#xqmtw_qq$r{;x9gG3U$Cgukky+v#RZH?73p6g$Hka1}Kb2<E7-%iWk{
z4`>9Tc!h_{uQ9YL5p!Z}t>H+F0w0O@XWsC#O!{$IaodfI%A(1#P;-Bw6m}7P@JOF^
zC&;AlpNJAq2>ack|5?R}nnX5|z)rFCcj>&Fv&rW5-*c+VbK_1;z6pd%&V%l$$LUXy
z_;bhk<T*ss?<8JQa-3co*KbPZf5|(THf6`7;UzZX&bvC@irf}{;;4HHm{>FpGzq9U
z71^L(AB;)(pK=z`KxNew>;#e{kjmEy*fh<XQtY{{%V)jS8c5cAky5d@CYQ%6rqJrD
z?z>$6AMx(WbqRd`*J{q7rSX5&X3YOntJWHK{-4|UEX@F_(tqq8?j7uQ<nEx?hp(P>
zo^(v#kij8jVc$8D|1zIk^Pfb`SB(E_G#l~w-%7L9yqo{G@yX%;J>e{0onQ73YSn1U
z{}5aT4?lH%D)pnz*cLBr2g;Gsg<zZhnLi}u<-(t_S~O9sFTSJv98ofIO{Cnv6^1$h
z0+lY%e<kO>l+}CWTdvv@<~0&K)CF?`SXT`<ugl@}iwydg{bxt}&kuHA>^&_A;Nn7f
z+y`2Zr|14i&N&X|tl~tMZ6X_6cj(;1uIewxdxtNnfe<!t0!OJXBP{lQMJntV4*U*p
zj*fSa-yG?;xU5kJeJsQiw01srhlJui6<)zOroc3|r%m*rI_WWvD{l}EDs7@U_U7H$
zKCXtLf0e<0<jwe^OHwOGb5=L$3n`NW*+%A&H0D3H+QY<lvc|~uFku)KB0wamq%Idf
z<`~{w%JqY?++Mh0TvZqX23vhzb`P<J7Ypyf&GY^#Utq72ypOz3f^)1N<KduV^~LCf
z^)9m~5)V=4f@Vjo+R_=7`7))es>P_ajO(5=`Wsz1UNFykFTXP`0m$cj>4}Tv#!J3<
zWfE_rS-(ajCQJ?hM3a%wprPBt?X>Cwwe+bZ2wG6TI7qMQ7!WHVz$ch_3ZMwPictlH
z(gY%eAzLacac5}R7B;y3Y7wDQ{&eaMy^q}y-zV@3jotVYUl^yRsCDUcrbKo&*U7L1
z*v{;1pg2U|wQP>8lG4T?{Sicz{X@P{6ya0<+`!_X?jZgGG38x&{g0CZmq64TzOXnm
zP}!q0>agTSY&dZHALhbLnp-$J@%wIbEPq7mP+E5Q+?-5egfp=ZgKxd%#&*`NTUPm5
z$uY(%x)s$NK>aMdLseB&&ld}D8>KXHuJV2V;(hngL$dCX)0>|n@7~Ap@FQR5+#Rt4
zf)+!Ov}CIG-{V4%@%;2Gygihm^oKN)5sbtz`rVOsR-p2T)`R)XyC}*PDpH28*BJ4N
zJHwq!3`Rh+$M=&*i@Z#T>0Is!Vc&x~qUiDI(10KwkpknP_}O?k2(yn1#tvf)>)P?U
zQ~Fn3SVA^0?qqa^{)q=TCDbRZznh7pgj!Vi(Cp-9sbZI)jVDeaK!e1NC&=@JXemHc
z?Mbgf#|+>ypik^b>GnU&{i$b>6Vy4GPYK2p^!bJFmQlCNOudPx?r8-Q0tuJjghWss
zAwpQ0*5lqO(>;|k`_ra>eE#PW041e`Wr={e3|Lz<i&%3pM6Efw7fol;Z*ENBF7zv9
zUsj3MO0nOuN%>VGv~t;h>Ke2Ub6g$sdF4c~OY*-~Y7IB;|G|;aJNxezJ}ck<C~=+o
zRzrOPBUEljJ%1FG%xl=8Q5(gh7w3NOxB6S__mFRXRhlXN#>E@zmlP@*S5NGdK!v(J
z{-^}21fz0%D=#qEjXCvLAo^2<1HTUVRwo7`X`QuO+jBIJ4+M@M7}s9QcLR=+qP7a3
z*A8JyncBM|oo#|FQps&SI;Ab_NMZk@7dA>wlq==%)=Fxg-cp-F`^C+L&}`K@c3O#h
zVXPk*<!X3+yh*5VMAy=A?_C0K#!iqkC}psdwsIJ0lWJ)_V3>CNx^)Gm30HwM9)<F+
zb3!Zo)GQrkrZ{3AR6L?8sH@V$q>o)^G~OcBU_)0jK|Q+nd0yPGrp(n5?R)<4cJchO
zc=wLOx8uTtk68AR-oG>M4ShZ<vSZ4Wq10F?SJZhb^jHprd_6hCz4*iB45*eVV`LMw
z93!eJZDOy~v`+}1<#OjrvQLkwCI6yfj?hppn4Gxel7Xrj$ic590(D0WF{pTNXo)WC
z2MZNpV7`w2YY5I^ir~mK<SCNV07a<9*va`%tE<if2X`ks->Wu<wnDJReJ3b6r7fy}
zPFXb)Vvh-$DM1zK*TeHYd4wVco#ag450of~q~tIrCar<iax-lxa?5<?l0O~7$};qm
zhY=G!5NWNQ<@tu)*<vP&?ttES#%yDD)$E{gm@M8hP110oh#e*qRKvISBn@5X8&9Y}
z6mF4h+&lx8XkKU>wjn=_3X7N7h;|ZslZtBO$o~=!%LB(XrIYG-f;Nw2J}`g~c;2ZN
z-T%#FW$YhhYXw%SHND|{^glQhwe~-63UyjO-AYyeDaNkAQ<9Z&PAUQGYtai8kz@9$
zVv28<#rGrCwDaSSj=J+bDaRK|Zd)??ILxI1-M*|FdIg1F%KS~tpdWC<7M`Vw0qLV+
zNd+PWIG2hEuv3rcR5}*P$@JqAJVM!JAhZaTRFWueQPmQ(2-(t*lu<pw;|jF0TU|!C
zp=Zh>Az=!=GI3piTTB$?8&(4mA*(gLLcw9qF_{-v4ZlkG8?0ccxIJOMjKs>_*~ZLI
z{`_yJgZcU7N(tbW#(%Zq{=aIq;okZGZsT+F`QMmXkhlAz_q~MIM(o2SI3e8KeEf5K
zR?Po+r68~+^S@fJ*5dcSwQ6_s|5iRL`~R62re2gzWflxZoRozAs%U|eVfPdsJQV^|
zayCC83`lbkm&RYb;V*a{UN_sHPshD?L8np*zq--aYV@@R1tc~2A5F1(0;G^;12~>|
zv;G<H6Ec4ESR~l5o#Q9FPk!3#9K1T%<FFGT+9!>II$5}Hpd((A=wHB!VpJ{)Fi%R-
z`<0?q;#pOMILH?llI+x*70`>4Gl|-^^Pgyv7A!&+IU5X$%!=-tL|%}O-64$;3UkZp
zU3b&FZl~oA=>$8|96HtHu4K<KoD-Z_nfQ;mDS#uC6NZMS`}*1kqJYlWGQm-idOL%<
z9^QW_8T~pRfAltT4#IT7D168mg%1ly;ltM$h3YD!V9glS+@VhEW{g3Y;JT0ajkHnF
zIcPo@v`<H{wi25d^H?Kz6t!*fh?oY198%WcTH&Gh(Hq83v0QQI-4ba3>nw$w>;LFF
z2|$+Y|JPd8MErNFQn_3IZ{xFc{ZAx41T%Dor=2O}1@7PGohU~R+VQkgXYOz{_l)F8
z$q9ODedi}rdNS>q8+;lXZ{e5+_5l5Upl+W?9>AP-Svtq@;Tkonp>Wz+5o#|tRO=3M
z=~pCd5sXEhJM~7`KQv@6Nu0sFuj92iITw<j1!@l~iE3|URC}wSy7yu3(+Y$=gluHJ
zsL(QWZ(zKxGzPT#+8ujFi~ZIoe=s}KI6LQv*W>e$=jSB)x;VtC2I6b>hkeYt5LK$V
zJ0aI&yCnLxwWV^ct-uBg`9ME0(TTA`f$HCP3b@*t9y}>jE>6^^2<NqiPz=Kduu1rn
ze|qMOrvq>5^!%B532Y^5^wGWfM)WJCX&NktMh(vPLapj-r8E|)NoTPp$0yE7e25L-
za5fU@>0Dz3Y}O-9A~a4!oRyXcu>g!wuV%0a0cIAFn0BLV$|%}pZB^=q1WwRfia;+9
z0@o5Ft59quI^Bp+SOvTIRBzUnP4#F17LGvbERumRCNSU49!=m|n8=D3jEUT=|CuK8
z=XsWf@_BA5C~9kO1@(j=ueLhq3jgz_;PQwRYGf_Hc-}eM|DU~A&pNM<4~v;<%aYcT
zoU?Lk<_`GR&}JB+Rg@WB;Rbqeb4t!vAN3m@%9~e;zIy-T611?WViA{(#w4utbfHGI
zm=zcC;v#)Y7*9!KAlW(QP=c=|dljP_qIVgsbO2U_O>VIqieoLGmx$%0=QyUHc1Gio
zA(S($OUeGRI4evN^m4d-xOgS7&?c5*Osn-uP%%Z90VUR3oeBhaDby4iq%Wq~#=c?J
z^Af4!cZlsfhr0*Q_tsps&lA4l$DO0&z1M5ot?=o=;oj?`H7c#sZR+V?-4WQ%4-ruP
z=)ofcnl;Up_W_e7T*yhJNhnCtwkkPlQl|(5!N!|NgeSiIAlUMcFx`Aa2`xKJODt?4
zlp02S9FQH(3e&LA#;f@Z(~p0KXVn*IJBw_VKg-BOMpWvk1nll-R9B+8^f5+rR+<$#
zW3;C7H$m$ZwKCKo{~YwTwA|$rffu+Nm<O5)_K4Wf(<T9;opO##s^nX~u3TYJS+b(6
zzML#yOIBM*maZbJFCmN9k41||?x?N>x<F}Rv8829!e$pU>9w#_Mv**tFGV^J#yQZ9
z57$b2Sh@Cprn9NH@~O}0vt<9LQLDuFf85I5`On+=Tr2;(@C8coH{#KO*HQJI&BQag
zq{DbTNGm%?79M)tlQ>-CS)ynhuK7?3uOr>V7-6G6C!m>)$Ld(uZ0rQx6Bxj9Wz1Mo
z01%h--}5na0XdTi$UmYh0gY~W!*d{zq)c?BnHf1#ax`4QIlM@0M1UkzKM5S)bxsq0
zi<Ch3BgAAuRw6icI0{DFCDqoBq+(T!z^NEI^AWNSsM7bj_|}h{M-$Ic1%P3zC$TK{
zC7B3A5A)8%%N4VNHBiKk*XXCEc(Kr3f^4`f2?1k@UXmAc4%s^7a{4HRxhxk9Q|c6m
z4G=)>gk!2kinH6OS6^bh$gFSkqA_!>$%`g%d|#0lV^jF%coBdjUNo^>#EVh6OkPBh
zuf>Z(z*Jr|<=5)G7$2qFycido_5d-cbY4`iQWSLoEVp@`PiB`X5ri2*dz$BT4;>5b
z9sOG3t-|lt^Fepk<$S7z`{6@lq**`Ka>@HtQ2i9OITkS%7P1H4<QedblvC#u&}*B7
z5gH{vE~Qkvu*GEcqV^CP8Ho5~A5+soc}7HP4!of^^UOA5`uewX&hc|_{L|sy?$e|2
z_x|zTVfgE4Z!g7C2yvT|TEN4o@C*+}b;IK$*iBJih5S(oGhocV?Mf$S4sS%nWUcyy
z(nY~8DW_KTDG-`Ho{B%WL8x5M%4|tRsAnTo2@^ygz>9hmoef^lSgakJz5kMIoeJvH
z)VEnHg`J&fplz~!reWk@%CJB&8bBncu;1xSd`Vmd3wsjE8)<`q%_oEIQe3Zxpgs5D
zlV5S>3%lr3_%X8O5CoIxj?KVR*&eStcK@$nM5|WfNcBnyDyf_J{1L~oMzg6HqiURR
zy<#c@rVZ*<sVfM?d!(ps^yvl&om1wf3sUU2Bo@OIX%TkAdGB4SRCvNbe83)|*X!Z&
zTl!frdoCM8>MSa6oP7bznBY#AjbB4D{uM+YJ3XTV$5ECCr8{C6iVt=Ei;&dG`?^<{
zfIPJR+b}~zI0A~+ssnmIF4qK#b>y9N<Xw)AybC?MSD%D}DfjE$+xYa04)m`){i1xk
zlHayF8mQ~a9G|=DpZI;`ZKI}nPm{*w(LH_Io-4lN-vCBs9^LzP<JrsOi`U188<Nz;
zeu(RQb<KCtK<S=oC-pTHK{cq>yscXEHZlIMkg#y*oy^Y1fto3-og2H!)II4rE+iJM
zU0S4a)1{24&9G}pxG9az_}o0=e{i&S?6}S7$UiBXPQALm7Mz^V_`-Dhixc!PmrlJA
zgD9XBAJ14MDC2SxO}*XudJ^Xk6r#5w>p(t3qA9j;)K$~Mq<Vmw^#aDtU^3GHr9ar_
zv!4&g<M;E4#fDn+rAWoNBA;rh6WDC|7;iWxDPx6Fgf*aNiRBnZs|w0cPWq{G@|s!-
zgj3#8{!@0shzc~t*_Rc#cU8%EePJFWg*?6eQM^IquZjJ_rDP44D@F2N2@~y_px#-I
zi6z^QBI<0XcPN0O=R3)wDWxLkn_Yg81$&SJe2@Y??%Uh3Jgh0uqvt6_Q%YrlPQ%=I
zkybdZoC!X2&sV7dq3^Ghc&EHc$rsSvl24UJ@xSiO-c5e;o&W2edcoJ)|E;*S#Qje$
z{r_(N_clJOpZ^Chbk63do*D8al~g)E$>%vfKldSRR1yGGD><8}i0`bqhLuRB{PgDe
z9{VgdovO<8wu7r}0R`$kEk5*{!62}Ru{iHe3ZhC!phDN9RL$DSQTUj;VFa`2ct~Zg
zF7!k0G*}?PWiazdi9MTi&Uv$wuu|V?Av@{LhjJYuq?GO^RAiNWv9SAM|M|hoy@TV<
zlfC^H`v=cW6HnozslXmZ08+U3_>6l<`htdU)F|;;X~KW-(GNT>rbK332{zyqRSft>
ztUa+Nq~K_r+2kVls+!dTR(^RqAA!)S*U{)*Ii4uu%Dd%Yl~2C-A8$s3;0><01T2aF
zacix5T>dxi<p1q_t`+|iO#G2~NL-sEWOYRM8>x4)P#}?Q;*p1Ep;Kt@^{Xd89j&dk
z!$+_84m-y`J?$KDx|X9gR|C+Y-UP&(jQeLhDKAE_CW13>u#-R&m$C?=>aG=K&76(L
z?*lk1&g|Uww{-!PeP>hQ3|sWP(fgmy{WIr#NvuKD%@+y>!uWfqveH#fTBI7iiv=Ns
zWEv1tOvjgnBt=YJ0EvrhiG15wO4BlLYmal3)Hp{H=W?a2aJgFg=6JjYVeGOyOJQM-
zbiNeJ@x&)fllKb@3y&n(r``#zo@XgB{mk#2vowR*xWI;uQj|a+FZIs4(4QX_GZR2(
zVJZXzuGk0UU;g=ISm=*Oe1kA9ZR(#BV=w2KE97X`#nX~wFJUA`%4VHK*S$p*f8V$l
z{7!@|m&*}NN)Ex(ti)Nn(}abn$1CRS7Nz!n-h1f;)Ng|2+YB_rNiQg64X1dXv!=TO
zkr?_7zzWJr+EvOE0kcsu>u)LzKdb3;+y^zdZqowAYB@g5oXvIIm<26h7P|z^cCitq
zXPs!;nZJL~tCsmxJK!E}I*;eU<rc0W;!qtFk@>5xH42;P&!-)=kkLX(iz}Fh{){{v
zrZ{@Nf4~=z?~^6*KYNELq%O)Vgf+o=viJ?h-9cwwP;*_M=h%Jn-*5I0$-bbqL%H%I
zl=T4)wA>wZCp`N16$bIWt+~qP)KLvYU~Ik=K_o{#aH9flLr}TEJaxktRD4J7IdVSv
z!=b|$2}c)Y@eN;m&((K<02qy_JxK^P&{?f;O@iENmF*mjsS<{tRNJXWIyWT7*D2!o
z{$t~^MCV_68!#n_oPNb5%g8_$?msTd2KW0&pL-ETdZDOd672nG{K@&m*Rp9<M=m1s
zXX=!*VgRQ=SidvH7raMC!^_MOYDXpHY>UqP?Cl=yg|1rrvb*H=p0W<2b0YC{d^{^f
zBx?c^nd91*&KJfy)ku*-+nSJj*i#dQ>$CF!5n+=4chVgs6SstXUr9O2WZo?zRD@4q
z)St`)xF4vUpLY-UcOSplqj5jn{d<9L=PN0SlfkNMg{PI%cuf~Fn9RJ_PrVh_x|Tpu
z*0kh~h9`2zGsTS;y7^<hHwLznHn3Ub@=^*5@BO0Xm!=raJ!!<zY2`+ziq%$;T`_TG
zARZH021)Y>DpTC>43x`PG`Hf)6_O(72o<0gD$0L;juU6*)h+^otC}h4dbj~`9*77E
zsP6&a?&3M0#?$v+NTlzi`qcX{r-?zFL)LbGOqL|lcTcF?>2&;QcIKQ+yQk-5d&qnZ
z<(Q!Y$~c(rHcqzi$ibA@jQDsnA>)i{yb#OOGuC(O!dW}_c-T<M(c93bz)}FuJtE_!
zh$^kX@yZ)DrPlLBO)2<NGOpV&w5XkRZDP)_T;tMUt#RoTjXD;<So_T#T7~93fa615
z1Q1>&paz5SuY|EP6Nz`jb%-p#NC43zM5KmNs<<OBe^5&+H@)?vvMVvx9W0YlDt=&c
zqGVeKFRQ`l!bH=_DABQyLzR0D+s}5XuwN*#6|2aFd2WC=IeG-@x{q`JChH5=e*)9v
zI!c6*kYJ~QC`(nol96w1j9QGY{;-dA%Ii|ZxyD@@dl$Hr(w9V!GC5_WtxGiSef#<1
zw+Hz5EwzHb$oa3~Mkqvp!?uKoYX<2aJW8X<n(BmlE5G>7m$*oIGW1Ah;1+AS;n{gA
z_9*5xf{>;j%X$0^)flNsawmYY%0dECg?QXQ;fm_YC-y(c%SgGA$^}}{&!px^QHv@T
zoxywx0IWAz;=?xFQ>Py*a;b~4Id@WmDP-btMD|AdlC^v_<eO^ErO;ge7UF*;KXIt5
z+<A%RlkfgdzI1nb)g8da{@-eye#HI1^-A^5|9cysW&Ynq?qAIo@BousB=L02c1Hkn
zjdY`v`H&UHf!CX#o@&W>Lh^-78&;HX;qiC4QO|=;H6a-Wi3vz2^HCqVP<QChF4blt
zWKM5BgAN6Dr5~4$+ITCkL*n63Ct#>6kjc#M!VD6d5-LPjt|wOJKkrj=qn&B@6Rt0T
zda#oM#tZsgR!XR21P>Qh(`wisPkdm}?Z3y})Z^&Z>3%oxGFnogqSn@Dm-O2st#dY=
z_i34(pFrOAr~ZU=^G*<dFoTyny(Gy!@wm~O$nC_=SJ{+3_XnL1^YIKmpB+7D&&JbF
z-6^S#xZ99}-B`Ehi?6Xn47U6cxAoB}kj~yeGvZ3AqtKVe=S~-(;;1^CMHv~>uX!Tv
z(Li_lJ>_zVRm2T5h69oMD;Gs3z}rvY!A(IS4qWf*hC{DzDizM>rzeGtd$^nsEla#r
zR6&iPR5H=zjcTf47&mzK%_HZ#-z(oKwFq#&u`$~EF&r1IJH>GMeM4Plww75l+9MZj
zWi9yRlLE{rD5&5{Lgn}GzE5rA_pl9Gjo<GWH8!$p7<k3&%(CjtGOLWTs*HZ$(4LUR
z6i`#jhOR_JD(riG8stq06Hs*XXAd4IR~K{;HHk1UX6%tx5Q33{5yyvqD+g`-4f}O1
zzOvGIsV4X(6)m6)m47@xIU$V?w~w9-$Dh7oI;1oTtyO_YDFAQ!mRZ2KnroKm17lh-
z8kbBg!KB;wzDe1tP{6Ptbg1lPu3V{wO@4GTDi+jY!4pzWr<zko>y({$!FZ%Vl+sJE
zs-lX>xx)~$`nIFQAoc1ubxF<Z!~KKfXPw7yo*`EEZGu3ZxHN@~u%DDc<42B&*4QiA
zt4M7tSvZAZqfV%3arsr!JyP9e>Xe-OmIT$uv+P#DBnI_0M1$!9iR(?LJeZi4e0t=_
zBRf$1&qtY=n1Nr1G$zYw+VHa!;>2bKH#6}2Gjjsy7Q@SrdlGPCNHFynB0ZAq&`JD`
zTdlzpSgmn<l(kCYvZgNN2lao$Bwo)W{i|T~RKEaf_FL-P$#_gMYC~&t&;;m_!(IM<
z!>s=PqfxEfgEZaPef(r28Xssk9rT6<M|Cq307+^9c)Is26F_)+H>?k*x@Q16J@WzN
z`A_?CAU=Zi?=u1QzAWl?-g}pBysXd=`|-2s;`ZLXAELeg`rC^|FyakX^OJ~&$QupP
zhR=TdMYEpC7F?ZY@}u>Qf6_X-zVZ9)cZ~7x8{a$O1A0W`hevX}!gx-@g6Dj@m+_bg
zjmMy-@s!Acr@x1M$ZI#=e&N6PcPA51nN@^nI`1(A#~}_=XsQRqF@m4^O@q&fIfZb5
zZIp_tAdQ;+BC1hUO%xg7#I6U>m0ZHfweNm7>*4V2Yq=fuu$Y~5k*m(s1#GNfWC)I>
zQ#%a^W;K%-y>wiqRpqZyb?yaJNpmx)m}fBY&f&)rsk4YX(}vw_GsdREDoZOxJY)B4
z-9|i#Yx=;Nuon-oS+e9LI-&#C6S!uNK8u9Th|r)_XVI#GmEdD{7_I|Xlk>pRWr<5~
z9d{#Fg=$!#n!OZIcj>$A`fuzy=Fb$7Og&jF@SKP6xQ+viBRrc+k*tMC){?!-09{Lh
z&M4{TL!urcQO`>$;#IhJjfd($;I)WWxA4s~D-9M*Sv#0-;;RSqM(iOy4!fe(ity!^
zQmk^#uKYzW8zrmVdc56?2EHs2A!ZLl2_o}AFDlIA>IW@4(Wpf2s8aGnhFY&t@uAd}
zQbdk{%VLRR6hy#<Jw}RE5*=H**bq+zi`7#@F=ZW;es78330?j3P!<I`C<{)mt$L$r
z#A%_FJW0`9L%lUhr8}=x=}oJ>y<^0_&6{;JRtY~GnUF&WS`+U*OTND)G(W9~WmjYg
z__u@xr_{^rdMuRwR*TouB&5po?8+=m{#H-um^wUckX^OGRU3(_s^)@5n_RP*UpY1_
zx43dE(On)}bhcK_uH5Fz?X=3xIx5R$8`zF>Hl1HQXE4SdC3|1l4eQTnN}~?4e2w~^
z<IlbeoG~^#dE1^N88AJ9vg7Q}5LkqLex5vzFW~^TUNjwl;`c#$eQjld%9AWbl)iV9
zDmQT$9&VYMHE~Z|*(RRgVl<zOXAL~FA2mfG*D9{@riC{&yNpL|ZYG*r%QP|WS13UL
z=9-H6->T9J`B96+=HKdqxBO@@!t%XoVk(bXjG}yR$8k$j;DFK+%?(9LPBbX`doF=_
zJ|1+3Us*G&umN7N^al3Oq!)Ly6%3!{+<rpNrD_q}gk3#D&c!Oq6tQaVCnVj1nyKA7
zUeqlXi2DhFnBA>K8qzykrL$XN`MIBvpUZla(bVyxrdZ(aCj{=w8sEE$^Uyi2EEZGd
zJZ7FwQ}rqdJuj~L(KFvodIIpcn*O-HP#5$YDQ*S7xj?;3b|kV1D@q^RcTKHrzh?eA
z)+!&psGBe7cf+dIT%g5q%Zud>7b!UrvGw;{a)-INJDn~PJ-#7(atNPnk%EUw=|in2
zO476Rg5%!1B`sUbFJ8wql`3sE>jp9=0KNXL@|O9Zp5d4KmbahrwfYvZE0Jm*l&y&p
z!snC)5r(Uvc8#hllC9UBu0Xa})z3Fe@!H!AN@mwdsjx_};az!U?JLA1Dc}Gw;Ru~h
z@#r^0YFY9wa-W()%oby_nAnT`jKiZ*Op}%T=5tC*;rF*W?cI<BN;EnfX);WgS}ewN
zsgh$6*7&)Cmy^`$E4w%mP&sqxU*lPSJVdB#4~Z)N8S>RUnE5A{9c0NWkqQ~(dbSq6
zU<0VvFJt#dq$svB#FE%ZG=PYWlm@2$=^0vRWVJx`%od*RJ<Dq0^vqw-LS_S0&1?Ys
zAm&m4lBxVv<4?s{qw<1?fJ87^uc-%%UQ_$w>$qNIjI~h)L`NSG%p8+NiePDPVW+F^
zW>yy12-+}JazI3F^-yiD0Z>#@oD_MnkLro5BG!WTo!Cvd71v#%jkHdRp_JrXV-Ii<
zE@>c{kCJSJUA3IZu4EQ#I4ipTdE#pwFPx<+7eP3ucq546VJ|50;my_1^rVqXl#pFn
z43tP&bE7C$2-9`Zh61RQV>f|{>8%7!74vtRT)pDG_v}P8ep|a4#&gr>XclJ^+IS$k
zt??jSB@&GYr`!eL{s}($^8ZZ7CmjjW?%*J7IXGLTjV1YiDlUDu<9}=Q%3c14TlswZ
z&BLBQdKjFM9651*b2cvi<DcG0iGuOTmkkL23wOhL>+HZMI$B3|%E@>-(?LB?UL8Dp
zw1L9kbA$jhiyY?po<-xv`iXxx)&HcQtIhw_4gxHh|IMl!kN>Y#@AALg&Sz=<7t?A}
zDF#ed;KO~1j1Oi39Ytq{b0WT9!a(7*8u}v%ea-?h9$HCP_)c~s=|ik&W(F21R|Y?q
zQP@nv5`$r;Vo6EpaW5zozrQ#5-brR)(9wVn;K>27c&q9{3eZ6Mo`^k6V3SJH1<1r3
zRrxndcB@~)Bs&>nTj&-MHof+{+-j3K`rVS#=>T-6gKsbP5B55p;&S#0matDQuE{&r
zMlKXP$IgAL#UxV|zwXd4q^yP73WFCc9lT)K;3aQ|wAX<S-}k_0mKV)lz62#LF96`N
z$(Y4_8yi{VLGL!se8~zSLCFs{B^i=GLP)NhQBmhsA=5s2192Q0V4O!Pt-<ZE(B8A%
zH!qH}a{{SUc^st=?vW%eau_F_kIV)X4RDSkckee~v<eOXt%z{spA(Gk$Q#cCo{SIq
zVABG+{4;i#C%O9A%g?g)CoeH|zW;^GP&$EC)eJJf-aCAmc4~JinZpFzDI;%_I=q`L
zb#`vV{1jn^H+9?8THU<y_-OBVZLQi^lA7nE&dn3X9ifDr$KQ<39d8y<P@e-aF#FAI
zzE!^O2!yXika?_U87G%CeH_k0uF$xKG>daFpQJYPdNYlZnZ0cW<H6!%;2VpQk|nr;
z6P`M9YK^NiQ=EC-i35;$jH?gi5LQ+PSKy9V(S=O3JOxc+VUq7UCk?W<V1$C-H1ECL
ziLnr|OU7G&`SO(*Dg`HY)}7nnYZLsPL^7CUCKzMRhjrCq#GDPP!}W=i^~S8sx&e-v
zZIuM9*{VTlQL%8K?)-s&$S1%3-|hG3=T}Mru*Ckak?9|^|ErZ+^UnUijnDG@uklse
zT(%{{P)9Nj;q_Xh625)<=H=_o{=xCy;m^A-*4Etc#pC17lUHw$2m7bJCx45IG(vL`
zVuzV-Fh8Gk#uIO3+<U4H(~l?JQ(TYZVISHu5^1sGbw$U-oN#`y6X*y4RoEa#|M(Dj
z*l3M>)%oS{)xnFuTRwx4S2!WnYs<CM5OM9;ojFP#o+Q$ylJ+8`#PRsf#GB$e*g*%`
z0%p^0-$<*dbO$3xW|+Fo6uG^b+%@Zl+Qw#b0GtO#<s7*VS5>H#4&0k{IE_^Ymwc4M
zpVqpm-tqb=KU6v;tFn5QSkV$aGuE~!Ro`L?hlG_YuLdfo+(adllhp3cJ)2XJ*Inl@
z%2u(!m{}T@PVE;<&}phzs2*3aj8uObv5c9*C_4Z8m(t_>2QHo@Nv3+C>5X(ym{j_A
zK~B9}S-7mRc~J1TWaNs`7)O~4_jJ!V58u=Y3GYaABwA>34^+n@9$@V!!372n>9hCC
z)IJ|%jE*VDro+xHD12ceH5EIM%_m{*)6_h?D(9J%h*zF1N#PtinuMLWj%1q>W>P2d
z*4Jz)syQG<tp3II*sJb>3k&`4RX%g+f0)>(Q<|IurLV811}@wGaqIE>Uuv~h<4*s(
zjnB36|IcUsFtJG_l9Q9qbP|lyfn;Q1J@P)mMvSDlhoC%nCpEP`3P@~`i$twbHB0U$
z8Z~!$&`PwibKfInD)^i;>$z^O$H^h6#y6h6Z8zDdktFFJ{v}c8m2q?$wEzrjJbg1=
zIg*TJlq6eVdTkEo=RM?PIdP(LVN%wp)zNt5eD<c}vO47b#qkiQWH(10xuNE)rs7#J
zRPMbAEfR}(La1~VmXMl%JVyu~`IthuLG}560Yk*Kw^T+*Ng~bH8YK!#9-7=-lFAq3
z$*jBrZ<sFB{JgOWE4tTjE@Z_>Ha(RDSbY2;wad<6>>(R6()N<r)}zJ@sZ62eQa#LD
z@?||QKdr(}6@}G;6r*)hZCr|Pczx`0;k0_u)hLz&?v={g8uIe_H=U0pooxO&xFq5G
zx5Pu@^%)fYYfnXtJ>Grtx95js*FM#DD&OX;E^~JHE@$H^=Omu~=wyu2_)Ep_r<eGx
z@;0>O^3f|l)0mSDZEgL?cQu!sWHq*eqF9Z`$;n5PA9IfjhFm@hX8t*gGqIvZe8@pP
zl}LN_hJ6|8#e6bgJB(jNB9hD=BlKJ4Cgi@DnGfMUx#-Zh_XQq~U@*cL+}$gEJm<Tv
zm3xAp%y6Lr_$DwiKTB&m8{wCD1M^YNCJ2u9VCZCi>>aU)FhanzxN~AO7|96*{WzHS
z;GED^LJ~!JkehX6s@BE5zJMt4iQ{nfdz=(fdH{(Ge5@Sh9jZSb4T7@DiazwbNx@a(
zF~4Z|)*B7{lO={OZWu{$m872@i~Wl|aBclMBjjJD0lAco?_6ebDwd^%1+*~v-)md{
z6+XG_{}02fU;g_4ExrGb-nC-(f2CHx+yA+h&$aCT4?~sv*@=`m&O;9o;v>U?KXQJn
zmdn+q91M*v`8zm1+}}HLwiD@(hdyMZ{F&{9Z$At>XSifso)_gko}kdWU6({6759ec
zM(NRe9S!0SB>8c|KIKcPJE&4HpgWuR%W_trk&=?|7RN7Hr{+)mDFNcTv2B2%hbsqo
zrQjwRZBvCe!3?_!3P=6DFQ&MJvjLI{ueMi!5Sf`>QmIH|FyQg}>T|~1NN;Dg-A~vZ
zIUAaKAH8Ydebok2%t;J6%0xq@1`vOMA{7{Up9=TSOwH98bp0ah%qm|3tT?-%c_HL<
z<DM{iWbdl^Y5sLx)UaFBli&QeWgn{Wcir!>r3W2Ccv|`p6;ou*^tz~$8GK!Ga&}}X
z@Aol;Hs5dk=u-n4)e3q<<GZH@mAZHC2W)Vf%&+0Z8Q%t`aochks+trTpz}@x6N8!E
zp1%b7kfT?f2@Bc``{;+gT-Z$$i7Zara!nhV-t(lm(3DQ)tA%uV;4Y!emsGKq)}}G0
zONHG=F+=QPGcgXh62i*@717JhoSBMRX$|D2*4A=rrAxM1*T?y4K+ceFdWPz@^b(ug
z+KkIVORj}tKwk^0WPrY=RjsHN&GhD-YSEyXjkz?LLANj3RJR0{su5zP+lYzjEQ(FN
z^YKUT-<V=KAm%6PmV`;z#M7mv8)oad7SNQDITHuXUyzp#%o8IM5iycqUxBR|g})?Q
zUy*p%;c#o(B)Qz6<;`>XN(|n98$H|XmYmHV{nw}e2&GMr{yU-nPU*k1n;bV>nrAGM
zaJ8CGTs-NUPpWt_FrV-}-=6t|Z*e{`pEU5~)O^y!lQZ*4>#ZEz;3SM6LfJzrHvNz-
zGR-@<m25P?^X|!v?*)*@oYD!Y9T|qUQHPhfB}h`So_G7xvAS3dg}XyIsxDR1NAr?d
zXEbIg`i@zhR`MJ-5lx2P%!BvL`Dy$K8XnAC;NXu(4+o@Gu-lC<#i1$;=iDC*a9h9$
zGgu&ZPtF9bPk!Jj6n31!7+3%aon$h7K{$z6G(n)KNH15ZzE#R1D!n~h`1W*p3xq^B
z8wNE#$c3dBmdYbgmoopAZjaL@X32hLj8EDd;pNyHLmH;NNv)$q%8fcybNT;BKRvsK
z2XL|fuU@aT;`tvc&BmSo?^Zs!<G)|-{)#JsJ9~$Rj$5vHTie#F-N#4ftH^Em!^v>m
zB~U-|W*}U7ozCm$`}&~C{=qX`3;cJz(}6;<7pfKgz$rX^{Gvl`Iu9K6tr*re?ps?Q
zjOR#W;eDXlG%Uz3h$8i^7k)eMUZ99Xk{i#uy#UWxBB;lzn7%>mgo+fp&X&`|?Zojq
zp%{^!urH7+Tpjn6aaF4Jqa#3yMdv@|YoWW<D?X%G-<!X?kdF#rLBsjM#N7(_*2%Kh
zPrCitc<OhD(U$pzxTbVEZ34=MZ>G1Z%9__B=fcprP-&C8p`jH09V=#+{-k>8hNI4D
z_x!xu3GuT1WEbiHCt2wQUAAyR#Cb%GU2M6<Z`d1%<sBi%7qW-Ns9uQqegRag_!2uP
zhhZq#Oc8G-JdG*EiV^Y9bjh3qC6n#LiW~c*{&+g|`nVHF)zv30f#k&_J}r2W+?}UB
zNAc7erQa&$O1bP-=+9dTr-s+yQKejM6wUhu<@kf*(U8RFe$Wqd1^kA1U807bMuf3j
zuD08iYPC_VH@DlBR;yksIh8VmaI?N$uWncCEfUaeJgin~)pljO;nr(zb-Ph(Q+>iJ
z{wX<I^mMyjZMkg%Qgz#IttwC5YNge#R%@+hjT&sYfPlhnS^!+P>XOv2w;PQHT1$Zo
z0QGjuZMpUKcD1(MY`Ba<wOwzvtL;{$-l}f9+b&~UZ#AlJz1eJTyY=l_%iYGq=621k
z6JC`@V|%;asBUxp?OLN<ap{#?X}5?JL;|8qrLx_sHIay@RcR3=@UY%)wq07H+Kug6
zo$zQg30vE=mTeOOt3;nheY;t5s%6)$*BkVxRc}<N`Dz;v>x~-0Y_zDy)q0&kQ~heW
zU1>L{PcHr2px5<!$*Gmy7Qw2uYZYprP;E8vu+emD)RbGPwW(t*7kkpR@-`vl5;<B;
zm#71(IQ4R^*`)6k`coyen(Yc6w%V;aAzQD~FjVS|Ht5$VSKVzYxZQ4UZxbtQBQtxW
zO!XSgYNfF)xU~rXCUuG$Z?w0;0uAaO`rjmO*{(Kd_^K5b|Ep5_t#XCP-=;E^R;}Hr
z5xd}FqgDq?)S9hEyH%@l{dT!hrE+cR00G@@6LXcEcDX?yskcp+6oEPoWUJ(Cmn*fJ
zOK1XLYOqF_uCHyEiR9HL4P2{6W47Jgu3*2uObxpzv`s@s|JJwpX|qzNF{OUexKtaJ
zb`vA$mZ?K^Qc2uxVs9F(8g+r5Hrv~^TCGl8yWJvW8#J(PwOp-NiFn&oo;ufbTMPoD
z=n~J@+caAU-R%n6tI;sf^rHR}+cm+T6@E&UiM&MjdIgiAj()iHa)TbUXt){`^snur
zy#~$wI%!7eU8{i-HGbM8l2(WtS`~DOrV~Ik%QR!5P_;;VY7wF}A{#wzQ>_+tf=FC<
zx2tVpCYMHoFrx`s$5^ztE6h!98-q;D)u_<8SEynIAll^?4IRxXA`v*W%~))gY32~I
zh#u8yz1ASU0*LMMHq9gA|7`-~wlO=2`HA*bs@)*IZ&lnTA&;jt(V7*Ik(jLxSyKm3
z(Bo}Trb^t3nZ3;tq*^UEh-ghP6pay$%QisNXs!}nsu;T(O^iwf<fO;#W|ipBuDdjj
z)RP9yt11zhWC#(CSglUvqtT(KMC5Jig^Lj+2<;jRH+tM|62WO&xNQ<l#CpURRbu!W
zqzd5%Qn|!A^t46Oh(@AbL*Hqf={rEQi1s7|T$;)4Iw3)XrozPDZ5lHoZhae)r_JJF
zyIgIxS~M5jMuo}}_ky+PF>xPJkr-uroBq-qCs{z`B>B_C-g%{6p$SEVb82q6)~eHt
zuhGnDwTKHFEF!8TV+mOjo7C$T4H|}zo|5FMl87Oeqq$Fgfsi371IDh=)FmK9IcD%$
zy<Ei@lTd4s1SHYq5?|0$;w+*iwbgDxHr4?G(xcU+2~%qmU1^}ULC#vUT*L4;s)TT@
zMgjulthLHe`)TlMSTGtO3_m4e)AXb%x=mlUsU|=W;fMs(!ENd`HA)Ojg^3SqpbW$x
z$#oLN1ftFh3(54xHUxBySOi$mV-hh9NOzLPnAr{DfVxW~Lh=ielyJmkfWWL0U>e~j
z$&41st~O0ffT+>>MkFJ#hMC@m;H1LDa9~5~0EWXwH|c4;+;r=Zq$Gr?-8QiRKs3rV
za3TG~z;2T)0Tv`->un{l>sW3vQ|T#5yls-*+q6!#TP>kQy+twr7iYJKQY5Wuv4!Ao
z)5_;!&2501G&5ad`#P~!qq0q+mpVssui0*6jx;Kes6;O!60sq%bd&gkp0<gSbs{>k
zM2$26NYn<2LxgEG8el9E<J$s)NCe?Xx&q0*#y0c@DopFwHe@8mxC!YDhNGvn$kb@&
z5;<t1R2nRP8(5dHbki8Rki9etRJcJSLWp8cwE@0a0|??FT7H_q0Ar0Q1Q5hTP)vxw
zsVjs=o3Ws!g%&^}E%6Jjro>Mbeo6wm0ii{#0S0J8YBjb=J`o;G(r}2CYE|aWCMgmm
z*oczE7$g_aDm{hNa!HDj+@e)uds_rw6Vt3pOQlOZOG*jJV(JJz1t~}Z(Qp#pv_jEP
zH)|wOX~6+ngjlUXtpWteCtB-k5M5+3gI0uc6Wl^787)mTF=?JvkX*Rg#L7)Lkho%&
zCAkO?SbOOS=+vThj>ZXvX+pJ$<w-EmG^2USN?nuWIx!BGS^`24s7nArYbx<1DSO1j
zG@_)mP)Axs3#^c&VbHSBWI0Svi58^LP;1aP+E{#mMXQQ+i-wt$4U+HMG`Q3edP?)0
z8I+_ljUC}nPif|m+{ZFYJV)yk%{PFcsng)*>unNJG<U$tE#eF61I^!Rvks|Dnh-rD
zz96VHmc*ST#EHuxep@7!X^s=sFg1zSw=t-#HqYNG2^+{RDu6YPo^HeYP$7BPggQY=
z20(0=+gKP#384uFUTDx{Z<F|?c~9d;{6@m4#%o;L#pprClF%R-Ln{|1dz%zL;ssg)
z>cnuw3@*5{P0B%qmS_^DG%Ja0HRxFFI%$3_k~1_Rh`FjXW(=Z1gG$pAJV$h(CfhU{
z=qV{ERcNk6A3%nR(x&yE)WKE-(xFX#r%?n5$crX4Sgc4S04kVfZ7f9<rWi333GG&$
zDAe9A*P&q2n6_FF;Vl+9+m$jn4Fn=2+K}$lk!|9DIy7zKiEU_c%$?iB07S4>13D<_
z<}_7VTO-*?lNO5r!6)XRrGN^PWB`onHbgs(BB4o7>mWTXtE9<QfJ=27+_~K-6HdfE
zK$#{gsflQ>NrD!O0L@;S$0XjN$8VFCQw2dGQ_<&b)^fH<N>&@_3rRCtn8^kr?%c*Y
zQfZQr(WpaHrj^U(&`)9_nv+d%3w5T|W@3=0OVXOgnVKgiq;^Ssp*Tqa5}UNNljy|E
zBxaSz&_qcxLHN*$Pbw)xA?9!M#G#?21&t;rLm{CE>XVqH^%j#8YB@0*^<5?qK>&YM
zY7B*XPvU`8TN2W=N<-H~aq2$JZ7@01PcpkI3>=FD)JYlxsMi%)8i|8Qn3Fm|$U^b0
zq8=1s8g?2kU_u%oEes9TOkIpS_=WXzVlv`=)~0FXThKR&0z`VOj?gzr?S-5pW}rrC
zS*nS0N@_379-3h-sLdp?NabKCq*^qoO=2~&m7sz_N1|Cp(v$=W^^fKe2C4}~8#*qn
zb|fok{<<(_U8XK+xx~P2%m=LZmFBkeh~yrb3N%M5u(H5ij3TW8#1d4HNJaWxg~Sdk
z_hb=6;UHR)TqHm&!ih6U6RfeKMxzXct_563O$Ao8C=h}*Fk+qQLK-Pq4&aD3)I`V{
zHYi}LkywC@NTwo52}~+d_{&5+(i~yF(mF_DTnr78`lMPB3NDmF(l;91DD+Q~d^8|5
z>mVc`>8MB<>lEn`WNwkLA#IAOOG+h-q8bs5R6xS8&UC54Y}&?x3B!}rrxuKHQkH3q
z8qj)aC~5qN#>{o}oCG^5GVCm9V61_94N{&K1?mlyC$h=qF->w8qN)X@2}(hm$B2|j
zn5Co`VXni#k>aF%vxK4MXnK%<t%F>oMUu`=RuWbv`lnr$c|;mx3np5#j-`RvrNvfG
z4VDY3tlP*aT7gNs&4$@_8T`|NXd>N?mf>xeZ7`_SHP&L<urNr`1r$;b$>`Z;&5R}i
z@gL7d(hrGatF*8a|I(ZziORT;DoFg&Zjr=kK<%i@Y$RQfRBTLXW-nT}ppOs}lLZUa
zl~x>@bR=(B6(E3R)+e#H!=R|~%0pAITqg-h<RS<SSXj{fT~_=^Gi$<vrOAzXz)(n(
zHz4{TDv8I4Z-7e!ij51Q2t@-%9V8%eGVv&ESeknc*dp69Mx^GEKG=YEOLQQ0pw3n{
zX>?#@66D~<ZOB&)9cgqhX-F!OBqFVVK(fRnoer)LlDsgIu#9Z8iA#$&Ngd+F3hYtR
zSn3R=MXL=7FS6mPka?t~@;o914sHZmPf5WbxkG~qR&PLhLpZaRMB+%~E@^Niwp|Pn
zi4(8}FQ~+5B-H2$+!(Nw+aje%TO+|l#tFP5H2G*E^JD5LjWJ1FYPAh1BJzdwHDW6Q
zPn-x16nu^14Ll|cVI<N>lN!v1coR@a3c=4&$5OJ*@`aQ$YIGa^FX{k$qcEhTozald
z)P%iVg?Ysjqlu0ZoA5#eW4g(HB%0^+9E<^_l2lKU`E2J?N9$P6n(Wyi#S2z5u`N-T
z1Xc^=BW=}f33XfWS-4^sk`h{l&V%CAQL^bt?|^9l3zbK@1<jPe6P_@SXw_?Tk6LW&
z(ZX7<Kwy&M<8tv9*a&N53kz)%N)H}mIfgMs><j5gDj<&$>0S_&P57|da4FO(fI`X_
zEUIm|rLerhw8dlMU0R$-1E6V9X~Fd49zp$rp#Y1FBovs8q0l6S$c4#GmORmdaUlha
zggSKfCQSS~tSg2>vy|3(l4<n@$w#6XFFb9yzrb^}M1%TGk-Jc~D#GARDDE^dcm|NV
z#k8)m6O8EI#6=`zFOaHBx@8rB;96uS90{#5Y-*C{r0$W_gm;l0EH0L>7TgEy*&(q3
zD5P?c?1GnxL{A+{15Z*?u3B(>lF>wp6s%lvSwX#m2}Gc45I=B9qB!I(l%)z*1(z)|
zJSMpdZw`T}LW6`k$xvEYkZGY{wHYQ2`%g*3qGb!_PL-`RQfwGFJ2Oa_lcrLK1g|&Q
zO+va96d)Ha4x&$;gg^^EBhsayauA<Xn9;YPztGesLknvH<_c+$G=MFJLdr9oOE8H^
ztHxw)pm?L~LiO4vncgI}Ao&2NPX+c9Em2iiL!_CL(kM`9DTR>&+7Oqu;blPac9~=c
zNkl@9)_f@PaOFT}s>A3f9kU_whrKpXny~B=y({oqH`*=scM+4)Qc67|{Gfw~XNz<u
z>I}^dSUIF<(c&e3Fk(_H+%DEvn1d~hQ5C*I3}lVw3$d;X-p1nwX@OW9sW<_qnZP<X
zNj~DEIt(dVOyCiKuaAn;l1Xbiv6~CW3=CohPD|!CC{8vZQHA7aZJVKxB?L)C`VXcY
zO%mwcR0|A13`DrojNOJq1dmBKXwahRvJ0pJb&_!*EeLqSA4RjBP;R#v3aNoDwy?M1
zlxeu^<*LFnSHsRR^^;@~9NdfxX+bmsBr8CYD#pJC)S(5z2}oKJkzpI)F-D{X)!0I+
zLN-*er@>rDS`f)dP?A>wxT*n#v><pVXq=kt*dn10mp*Ab(9fuwFs)c;t+AuAT4tq)
zthffWlop%Tw207P)WPBKJ(4VGv7eB%9T;)+ms)h8Wbg`0#wcbf@e#Gm*6B8k(kj#)
zlCZ?u(7K8K@R`tK%sN`+Fo__&NXZqaCrvvNMbsdXidIQDl;QOxy^h8WM8)1ii<$?D
zq}GtiMVc*H8gPo&+u}MUy#{Viq9iOvA`GiuWX+K337wNT8v8qy2G0OeYp5lfD^zy7
zElUSOX_QHjkyL`BR)=nim4q-Z!|bZDj>T?{2BX-*t`o_0k}D)tp;1*B3Q0^jNZ?2y
zKA_3i<VHz>Bgulz9U>Wck=Y2oE0T<DcqCnMi!gObuW8d)q?LnV=r(2Aky-<)z}%*p
zPLr#F&66tWFT`7<nUiE7K?r%wT-N|MwlGhKv4~BGF}XMi5-<a;4`iB<ZqRV~F|F!w
zakXisBaEt;P7H;(5o;H`RU`{ZXBE`9S%D*lfx840=BZBlO9R?93<NmOs#Tc*q`$y}
zO#P?zs{t=7OH9&VT5zqvt3zus_Fy0xNPoe`3hBWOIHQ`FOALjqED{e?ce_nesl_so
ziZ{!!x1eId3qTAA%Z8K~ICW^EW9tVtNQ><N>KXA%3yuuz>_G2eCM89M5G2GgfG7Yr
znNx+H(r#cA(ZvoMNwhZ0x)%1=D!l#^(qyx>u#-gdxQum#YzA7?V0o~cnpSIQ>MrIj
z*<=_xUZ+W4B8!h$iaO+C$;7@Gio=&rYZ@sN*t>+`fF6;aLhswWozsBVoa!=^b{S4w
z8VsmuG=8$HM+ym6k_r|_=q1>>gFC-ch6faDQVrWLkYa$+hCANH{vintcz9eMBPb-;
zQLMuFAZ3Kq3EmVSSx*B%y{0!ba@go(D0PzFRrZ&_R;TG*#gLLhg2FVxo5Z#)SRY_%
zcz<Xig<GgmXSY7vN2C&zVen!Tmn@4awzjx9^@yzL1}oq+L`^uC9g+pKHq!j3HMs#@
z2lJBmB3#x~;Xa4vNl<xLg)|SiI*2Y1Ca}X<V36hk!<Zx&)K?fy6@dcJ9?9+|w3{l7
zP(~e&9n$q^dBDaRt-cLtK~-oT@C?Es+J*ytTci{;4-ziGlU8JG2Qgi?(Ibd|Qg?_m
z>hR29zl3@O^Mp*)7FIyTyR<66Y`}6)by^svZQfqNW-ZC82Cbu{Gth4g9j#;VjM5*>
zMUr=9DsD3rj1kOFY`irwhF~w6{$=!@;LucRRGAWZ+=ROeQwf`2H0x<l847V-9lkb_
z#4XkkTiB<mfa{<W!Z5(rBFt~6=3?iYJ%Oa0k?IBC6re!GV4o-4V1y^lRiI8PMg!I#
z#6OfrNK-tnL5`3WO#+`(6ryOwWhj_Ou!URLh=3ChIzx^9FD^SWYuItCu(Pj5ssz+O
zqE`j3z#2BP7z#-SVjv<FG#==J@YWK-<tjGypfbZzO(g(@R0*;dh=E%0Ps4}X;9Vbf
zwA7({!O(;l<2~{!ncp;W#NycgZSuAf9+SQcZzHr~phxzQK!L2|{dCdZNs3ibya|7K
z8%rq~#Ks3hAz6nZ15dzz*bu$0#<~RjmSpi_ndV)5Dh@Nd0*7A<E+se@(NR(*8qlvR
zWcy*Og*wdCC0&B1ce~Aw%qnzjxB_U>mZ{Aa`h(3F7@S}ucuwHFB=N{@D`GC@7t$Gs
zw`y4GY3jk{3-y@T8QT+3yhv2jGSc9MmoO`1lOGgo!Sf1NJ40z>LlYhrTJLB`smth5
zjcgL}-nK|2BWR(99%28CtUsEE#I?|jNPFb{LFju>Q5x*Z!zvEcd9REn5sL;a_YJ7Q
zBv#>5h2aRjgE+O$&h{Gi#bDQ9Hp0zC(792vvarMg6XH|25ixYw0wY0!-D~V@5NiwX
zlFmR{0LfTv9k}qF@J=J?3?vh==Rys%5On}WjaF+yk=kTuCJY%E>jb5Nt$zH1bDTsH
zy+V)J=Rt-XEIyLUJn!%rb|ZC>x9B0I={rMdKr(DYLu>P3V{M?~?68ELNz)wqvFkD}
zB-3c!Z$W9Q!{gI#3KS9nkZ|z9VSk7ub&Zd(W(HRw@@LWcLv_kYN5!TF4240nDi+EJ
z{!)QP2)NR3eP<I<LXDk;@m5BxRY^rmWkf3>Vt<urD-FgBw(=#|%3mC8H9^{g={d(*
zx#cn$G~0HpRmIJYwNjN6QC3?<nAH}%N?2qdUErd?rn<9*odOzXT3yMsC0n2hfwV=c
zD$Vn4wvlM<XjE8y(PQ}Q+wfK*bOb9K7e+J&u|*Y*KZv$EKP6Ly77y%1ZDSw4qCmiy
zhM$RM1$GCq-HWH#@OLrSY1-oAC4LG;v;m6;{(85`u7@oIjJfOwZ(u(P!7f}F+u`)4
zT48mm0v@NQ(3{9I-o^}s>)90$E>;AR<1~@6^MaTGdJ6IF!Z}3tKPgug=^lK`(C@bq
z#fA8Z632{fV-JZ0XblQITIK*VOz$RyFSZi4S$5#5i_IJOV_|aD*yl!%NzP%P7LhJ+
zgw~}nHYTfxEfQ-4vl34$h-8D|NW(;;q9Gt!P}ZPOkvxDtT;;+fj}Y^M*cEs#TY?*?
z%?{``_FfTnz#v%vr7l!l-g!}l(Pxs|#2(vlpF_*UQx_yAGGaM_qeDQz2STD7ViX>9
z6>NviO<Gt;<Hwf0rV!~gSX$vGff!^-M~{i%?AmI<&T8m*Jramy&673a(ppK#N%u(U
zfgc|cMp(hyikz^QnurV}o1d7xDTNWM!~PyH6T%|oX@jGVwz2a}1Z0ow7CUOGIDA4i
zI6E5(1Z)BlsBL&lNNtl5f&PFk-8u|wIB*0+74=E^A-#q;eY>R!Lxk6{y;<k|6v2Wt
z9XQ)sJj_HsMGKdda@bHbTWQ5|YeIW?JmG9cd><{JRrRzA2RwFv;c~38nTW?w_Q_Ht
zLPKF|NnxS@%~EWiY?JxC-4cdF=tTn|2GniRNi|<o5Cw)sgzUu@*}~1tpvYuNj?1*c
zHl@Ce!L|fd+Q{<si1&;%U@mGCp~gX#F?!XdeVe#$g@Za%#vyIUxPD@Mom5sx;~LaY
zvY3<LM(}8YaoHV{;PP!oH8vq?+^N{ysSE!0L}L$id`@ET)=8VbsGpqcPO4Z)lOU*{
z6gN()WJ(ias2`JfHRhj~aIACvm>g}Xpju1l)~nprn0#(B|JkBk=$9t<ozx{FZ8bst
z<kI7$u2N|W8tNxkKPRzJ!V!^JQ`^#hYysxolGs{Zt8k~RWu1M~s2|e-K<b3Lz<$Q0
zW|68GDm5j)N*LE`mMepkgfduh7b}BW@tPD%Nj-}6Kc(cYq6I22d6mF*$JPV;XMVLX
zd6caQ(jq}s5}(1zqkobpWPap8V--0ff9UU*VtIXm3W;_*gA-967X#W^2qUhBy6{+S
z^S(zNK>!tR3w~%YI0DIFG{PxV_qO0YK`;uUCuo{t*R4sVIU=kLQwTfDRrZQEsW?0t
z#F20$f&U=YD|pPPHxNCJC=l$p)@t5X1yZ3=1`x9O;5`>8G6e`Xvay?OOlz72^q6OM
z1KXS~Hc~m<j~?r}C31`wttQD{dd{;80S&Y~(c(mQY;Bt!BSwlAEe@W;?mvkwmmjaM
z)e$h`!Zs%pmc%1)ta6M#?}pL47GhLd^q8lf3m*V>#&N2_ZFvvi%2Ed)2#@VHZ}-EY
z*Wy)?#5OGei25R#NYc6?D=5O^;W~B^k4ExQ_7JcLvtJ6{WnKlEE(>fITk-T1D`O48
zg|4ilEo?$Tu+mZjaZ(eZ4+6m1gb1h>f*|3vq7?=q?6mY^-x4bXN0yV|XSWG0KlFhs
zw%Smln?x2iifB2hRCrU18HVb%>JqSyh*Ma`EYq5ZMrvT+waz=b;&Dgudb`T;twew9
zUcd`guJRTsqUsUqN``(L(U4`LP`g1)1j7b9`fcnv0SpJ7B4&o<ZG$6f%Lw2Hr4T?(
ziw~bxp!KA|%6%29Rtd)v>Iis5pf~J%Y#OwPiMJ6pg%G+XN5PZ1O;Q@m6D@xT7iL~>
z(U2m}4J#9eZfql10zMkV{x@WgAKFYE;W}7INr#ZwClV0EtMI3^5t_|0IJA~wn~&D9
z3c|oSilvP3xmKI?v6jnfxC^gn3oe@)Q<Hb^n`LYwa`XZzA*{w!Wru#7gT{zgF+tbY
zS{1|&6TWT4uke0gy8?$-3y!@uf`}R%F-R&%6%0WORhtd6cDqdd#HJb6wi@@B)*tNJ
za7+@mt2h`Bu^ih7&w*-zn%nT6!v#bd5n@^z979*fZ9eTfLL+N1FcByRmk#tEsJ#+9
zRH<XXhqwVgAP$k@a5ZeaVJDatO5V~#@L9`kBlNMxLm*_X!&A(gx}@^fpp0{nRtv)e
z$1ygTB!-A6fcP(>G(wj_DN+V#(jw-mg)k~80o&M5LvLvgV?H1lutBmAd&SsGt5kVw
zcpGsYSeA)SG;^U7Y`5xVc%Kk9h<!^uYS&07M1V?z_xHHwHe@0;>Ts}wP4{gk6=;Rc
zS9NNIC;(lv&8JOB%rT{01PCGKqP~p)ED171JO&)cBxVUgKHO5HXOML?=V~|uAY{fw
zXh9kyY^B9yZephayCXE5+oIZl_E7V;Nn2_l(kM%bz#<b<B1+CX^W>l>*^iQW8zRL*
zt#->*iUHCH7|WxNv;k}JQ*K-;bS%*?=pGHu@xVB|6XoU|;XowDmj{oWmP#y|qP)B_
zl$XWYi>M1F!n0(e6I}q4SeCtIUab^`1`y&34G~?bHS|qxSMfOaliZxLSj!PYv6{1z
zmg59x-HC^4jdHmbKatp2tl|i97=l)FSbyflrNPPs{^5gem253Xz{J&@RvBB0+f{@_
z!Q8B|vOp^XbPeeGSe<E27Nvlc?lwYvFd?=PUCxU?pQXbFZWFQFHJmXKr2q#oV7I~I
zK(u3B9>Z^3!yzdcpA8a7tSdl4f#D2wz6P7z4Rr{(xp@sounB8FE+6%C5tM>(TNsNq
z1*KkQLD9tFD$Gm;rGXPL68wcIuevnqaGW#A4D9W3s7#0pc5Wc>TR5)dZnNSdx)n@V
zTH<RY9V_y<#(Nv}b`6$mg?ekKIfzTd?kgEEB>d`ZkE83fl;T{|Hfpf8K}#!S94*eg
z&%mKMv{+&jfdn!Z`nqfbRS-D?Z$6HhH4%oz4-p66h8+akl>->qp2q1h#J0h!L56xY
z{X8cdsk{?{hz2}jdz#1qBM$Z~8K2v2Rz{#P!fqmsmee|&<P)tEi3nN<F0Ep3T|zn`
z<Z<``vEq$3Jo(J4RjkdtgwaU15R(t}q`@(_IH`mnAy*Nwflz7i7n!c0A}eyFIJa;L
zt<B1iP!(sHu;`N_Q-uX64hgV#9dXRG+8{Pr90Ca1AcMAnD82?qyD$Mrt!!`e78T4~
zAwZ?k#;yvYgRpTUiZ?CDe7c4f$R?|iundUB+c0nuy+F!nO?a9&NNGjKfw7jv3zwm6
zkOG5<;TklJ7PEN;iX1{#+K45W9d(@LXduY1jW0M`%<M*sX&qsi2o<by02(QCurg}!
z9$+7}-f9W~U7QU@6ipSXr*swbu8wU{(zYwgNrO#zXs9^XfrFOf&S>E@a|`aUR@Id$
zPyv@Tu!joAO;v0NoIxP&!hta!4|E+nF?FP=prNm{ILN!)WLVn>eQGu(iVsqP9ioU8
zZ_3Fe7!C;L!r5R%FSVFLd<vr~8+H};O;izGNANh<5u3fdWr>)}I-*dZb0NkU{N-ZT
ziD>9TkFD@|q%uYYM=Eg82Js0(F&Zxy^9$#&`E(GJewR0Gt2kwY&?)i2;It1!5d0%`
z8E-zXf<R+AV91<NN0b|xEqvmOPdB-85Vcva@`2SxL%bJoPvNv6rWUEG+scCC6T0jf
zX^KOm&Idq<#bEQ)SRF+G3pG*W)6*O!$_qjpAyg!Q5SYxi6wWCUqjT^r!pm5PM&J&~
z5h5&gq=^VaPz(wcg3+psKNRp5rjrXDjc8tni%BR3LX)Ni)@#d2Xi%q(=;&>P@iiro
zm(Ph1gThHeh*sN5>LWl9(I42<mKB1g6%C;aegFfq%?v+h1&2eLh>d9qo5-X`KRBwJ
z*TW_#0lz4juW&ly8KxUd>skxZc5JcL5SR$-9>+}E;+B%=7@Qa+yNcs2nRT%LigVRa
z9h)^-W)O)D|5puh=}m1<(K>*5evEAe`fwZ0FC21rApxQ6XK9GWI)80N(S)^BS>$4(
zFPgeWy3VKzhiaoVatk`6Qoc%puV_G8@3YYpuUJgsi7Sx0Y7RXzb$fILMKXJ^``w{u
zCP~rMrM~T~=coPp0?MsxeOjup@@P;nPC6P6BmpQbs#Zy<7bk8CX_>G`=(2G+$!zL>
z^f}p>_hIgTq?e-^@`iaAl7-B{ZS?+R==V7%fBa_j+zF_X*;7hsZ?TnbzEEz_*drJg
zu}20i(%<k<-(~dw_xW7y{=belLWP_;!Is?rM|yN4mjA0xOXOYtuiN-6&HrWItgPPQ
zk{=S_$-At+=W9z!qwbXWBlzAeAv;y_@~7{sm5mhbVc?y3v|0^Ty8<jyFpyU>yaKE<
zk1hezMT$m_Nw>mT7LkcD7@vEeBqwCgpG~{d%MuB0+=+_3j^h*Rc{gxAdCsS<lIo*i
zK9$6doJ(?c<~gH9w^*SO(2fdFg^^u>;Rwabj<f&W5ZCpbVjY<|!|~`;-4F)^Kn5TX
zO#G2EpP&=EiHSF5K>f)aC8!l7oHTHm%%`XR=u~C7^ckrx`&Yavu8#dE9qLXd)A5CW
z&g+!UL792u79p_djHpdBQFiLRXR3p8PwWP+`x)?EXPtS;y68;r={@WEL&?1<RfIwt
zIxDPP{Ki5kx@ssI{9fV)xcs-VnHTlmmnKRK)4Y*4LQf%)9CgMuL{Z<p^tI3+DZT)Y
zMS5KN99?Y^D#{b6Su_sg2?L*5BXb^&4Blmq4DP8*$800iZ}00Cgp<w_oD?V0smEAl
z0nS7w3lZo3qSjLyr{Y<hVqKXBn@d1%822|~o+ZmhMBsl_!%ha$oI7_TER;<Rt=%Rr
zXvj$#i+=?_P$}HC$5kH@ae{@!SzXHCNvx|%tQ=Q2+I*Jt{>GZVRT8yf99I5NmilV_
zbStrr*8V;FsmJr`cd)NnT3<;&$XJi=jLxs}$z}h|f)#Ikw?E77f3Lc6`wsylclO_H
ze3sgOY9p4WwlnC?x}E;e>yG9VG6IPnwAAuVQ|6ljif-ZwO8}%vPF6%Z--@;PUO+x^
zH8|n;p4j7~ryUk9Pj`=ZJ2*}eF1EYV(>Y(DGePwM(4%!%T5wM0qdw>0H&qy1DjO<3
z8y~yFxu@?Zdhj5%XWCTU1wpW&59WNiUDyoi7_(1fhvk&qbvK?4VB?L+V1$Xt<{`t-
zbp0*}Zzf=brXDVD@Vi6*v)tBsMg|z!m)i1@+gqtnze{yyrX?ZwhdPCb)ctPYWz+6^
z>N}TJ$)4A2u==`Iebp)hbInTCoRzBIhpDgO{*}w8@oY54MZDeqnKvkCwTSO|jbI8(
z$bHywunW~L3a-B6)x7cvchBP5r%80Lle!%nRqWfb*9PkGL_vz*mga1(&(73sz3M{l
z?o_TqX5NRlpS~11<29O}73n<zQpobX1lgAun_SMtc<lq*kzJs!z+J@l%Ae1?!khzh
zLh-j+WMiBZviSO1L`k`Vb_o$@Ar);Rst$&j2ZDLY8RYF@cvIUh?ttKa5Rg(vhqwpg
zV)@h!P*SiMs2kSuw3sqx8izxVAkHwOF~5f_-ZTd6X&I5Od~$;A6I`Pk3}Q5(IzuQb
z5gqQEazyM9(s&9JBXv8py41wz01Mqoo7HT8hYYE&h&Ostx#%`dYF@3ny~Mx=<Y3;5
z1BTy<??p_L&P-pF5?iKlpT3uz5TEGI`b?fJDgf`sqz`g!bRAEXSpCJb1l#PB-}fLx
z;T+?kP$;p-$`5(NyYTvRSXUxgsZ20)Y7Xvf4y9(u7^hy!+Ea3BngyO@tQb7}s-=P6
zyzx{cajiE)h;)qJ4Pp{ysi0u)#o)w6;Wa1l!%gQU^_aJ+W>fzZIrJku;qo&HXu$`X
zY|=)vOYepmL_?Rj6sD_OevOJ+H_&V&-Ai2Hw;47vK`R}y;JYWD)fjP_Zop`^M}`G6
z4C%9F)9#ro;SgTX&a(kuJMf5hXXELm37TISW=>d0-^(7&=;bY#9I&Vnvz#&>V~d|m
zvtK*MPj;XDwAVR!b+C60KDY|q)ga^AqU1n3e5X&0lj8KcZ9Y&)Rmpr+%_@}gh+?ZN
zahbV5GTLJv%Dhxbxb#-{y^&~<L~2q5X91bcq#X`qjzV)9nd*_DQ!6EYLi+0Lq@eW%
ztr?KLJ)VkIWZLK8%6ZTMpV)VKEWR2(wq%`UP@GM)t&@--!2$$#cX!v|?oM!b_W%Kc
zySqCCcL>hl?rwt*uEWgbJGV~Nt-Al#&#rpAy5HS<uk|>knA8=fP(y~Pu5<jM;eIZc
zP+0FrpLrp<%RtBY?z}c=g=Tx>fAMAgZy@~-XpBWVKs$i|;&jNzTi#mUgWmW<^nw~g
zM7u5uV-gfabXSwidgZ8G71R0alDEIYLc-JvESfAAw5j%W?B@YJ^1h0x{0u+N6j*Ta
zM6M1tiW<C3Hn8%x6q@fWJT(OIi-nSNsme{<=ox6IO+FO%l=j3=QT<~+ar9I84X?bZ
zi6vOa0Z#w7<Jgopt3i|`TJqh$jML`y3*;aEwI(K3Lt==Ac-9no33^<zVszaXao*wJ
zP>*9y?kIj1m9Y0eu0ctQMz3w3!h|JmPtveH;X_WP2fh+|upWKeXIxZ3Ejz!P@ad5M
zBJ!a|$8<OA=Jz}xi|E9fPh9v37NN0!binSBu&Q>l5P2%jYPYewJAm7G+BaaUdVCnU
zIih46tg!J|;akCHLB>wc@_sPVwA$0D)VhM_ZQ1?~wxPT0?tPr+RJ@EX&!AfTc5qR;
zxoe*smqERZgZrpUzR#zJwR}?|Fs4y(EHa(FMX3M_Od3fGubgW$S~yo}+7A!+BQCex
z=^E7LKEk!q<DiISbQ?D7zS!9L+=Q1Q-;JPG)Ob>os2c`MAf|gJc=>QxfUfJIBaTzn
ztvtu$<9?a*NSzk?sv>1A@+{?6U-knX3t5xVASj|Of9d{9TvL*HG(s9xI`KD$*n80L
zxg6z=7Ui)_5w<rrYGp&6(lB!k@6rt;O3PcAH}0W8_%Ns^mUg5nH)#_rBp;(}NDIr%
z1F6>`&nApo`8nu8vH|rGkg*)dyl(w&>3g_)0qv%i0f>|-p@Tph$jP5pu#+<b0tGR)
zv)shK7su7E1U%ut^nCO-Jf=UD9{JPJwKeSw_K?@f%f9QZv?EVoI5B}YV5{XlX2$oS
z?(aWrc|-mJ*(L8(_>jU|W#RAV6Y~tV&c6}jgSrST>%Y3c<f6`-J`O={L(+WVMslcq
zUw<FomIIWlD^bQo<033Vij&>sREku2Hs^67&j^ASVE6o4D#JVR0YW(VL@Lklt%U#`
z;v)mL+3BL?%2m`=!Wik~vH{}S<=wwo7G>FR!z_C}ujMgmkWp$^eK~j2K$9hZ5b1}f
zEnxc}C~_9pr)ZUQL(k+g?(GxQYegl;mU&smKcH<-sj0R{lvnSrvK3J5&ZN+_rO*1w
zU|!<rvC8$M(}@o`u!#F!iRnVwv1q~bW5t3~fSCRlidLR{g2eDtzqWi*q+oC6E1`*q
zQFLQM4~7;4%Bo)UN5R~^8HUS{g?BiWZ{JefO|BId0#kDqf&dBbn+l6C@Aa!tF`S%+
z?hBV0aMBxt1sMUMjC*9b6k8Er!mj|$nK|%3?rIV?A#g;w<u8sNi5|yRD$7`XLIS|K
zO$%T4BWHy_b4Z`t$A;^29@^qlSaRKkZ!S`eru&QV>%Z6s-`J6)Ob3wPN3DG*y+5!>
zO3jzZ_5@_Q3oh&#Qm1NWuv5=pw~JRb?&L&&mItxZj^K~v4QuAXbj~9l$gGW)$|a}p
z%i}1yx~-&VaxWi#7c^%hRI)1l5#`2`CqF!&af=`ZV|gJROsi~gz7sv-^2v<y%V8P!
z^rIn22>VbR`g3z1RbB9A;=DKiQY2~&3ky@+Te`x8f$0zA3O1ppATZoQ@`;3lbpd0(
z<J+!%x3o5P231yxt=?0*pc>AeznCa=cz7*0t%JUT)3m!0Z$Z#dos}$DXOU#`W=yQy
z%>9Q5GKmF-?$WkN(u|jl&hH4|ZhQsza!au*F}z~Oq1=h%YVm|uiT!OS;|kP2Pye+y
zuluBpAlslhhVptFliL}B?QMGb5a_snd%=zB3pqA+k`x0DK2NT;J;eo%eJq%Y5GDv%
z{U^Hpe?6RkWtuKUc!O(;#GwDfQm`soFOoV1gF2s&yI;OeJrk)qo4yV9VlV~vDAhg-
z^L9>M$C+Ofw-xXZK~<_a-=PZjewu%v@VMf6KR+1dkG@kt6CQTsxi~@7qhMUG91+L_
zk6XVVc>3P4qFO2JzOSmxHz%!g`Z13u1+m!TBDbmQo|ERHnJ$k?=>8QxQ~)3Iv-T|R
z3wbuXNQOnuSl1(y=fo2djiP=_pb+h!AWDs#Ne4hZ@m>E;fNHI}K1m_CQ%@LO8z@ya
zViY;0`E(BVW+#=W&!W`uPyTn#lN(cpp#Upn$L!Ot&^0fn2WgJCL4>Wv<m}0NE?)XC
z5tPJ#6`zwFIEd`8u@d80+yjqt;HIbpJ;Kb`?|xkc?du`QZ6eG+o%9Qu3LRrc*^pb)
ztK5Wp$s8J^y(Q7!Q>JVX64mKT#F<!H=L0gyPhAcZ`!FcaKcf6bsQzVGF*mM4ImmYa
zFIF~U<1pHo)EM8&@{T_M=l~b+F^i)py{jSdIpigB6A_dnmwwJ8k+9fvPTwq|8J_f9
z#LjXKF3%Yfvi%j(h<vCUZ=L_)`i7ZZ*}(?HWeO{d=MLo~6$xP>yu8YHPM9!XYH;Uv
z3*>U2;rGUI6&q#FFE87DjyF5ATfn_R^=PEDE~J+3IwFtoH(%%{7c)}V3RS({a*5lK
zjzaOMg3wFsjL3)%gsE*fyVW=*FHT<fDl%zTDyw|sj@MweW5BSCTFUU2m;C17!gZY%
z6oz3Du!}tH&A&vHA4e?g!U)_NEC30}>g%cCZMOzcY~{p`uxHJb?XRxjdiZYrHJ#ZY
z>(J0sl%~~16pI3wE>g)>@ofvJvM%lY0DP1l`(6_gw6>pQfLKSR1}b`%1#sh6L$Dl*
z#-~A_;1+ZGRuCn(C)?18_x4-&0@<ueejb~eol%+hDn+jgL$2eTHjX=a9ng}Ft(npH
zO+AlMzv<;tahzLX{Qfs>H_O^TE|POIPA>jW=#w<64g+I<h1MS#@4g?+4i=(b{kI#a
zRxe+I%sLZPjX(D<f2XPhk*Uo+7R;qn8ko>{M%2<6Y<U%Y<qiJq6{h7i$w4#huQ717
zlVFN!<42*63MDAKI6BgY=LX~5{CUaYyjZa11hJLld^MaTNr)}<CNcM^Ux`tu`%R;$
zSUjef`KzaLVe(i-{&N*OnWySXVn1%vJedx0tBkBU5>_WgvDR>KHTJAJtSm*hz?l~?
zX_Zo3B|AhIhXxYyEBzI(_@v{gRbQ){TIU91DfAczr&mERZz#pvmA=x>>r^}=Nw<!_
zLtmSIpP{JwhZ@KatYTb8B?Hh+Ad|)Ufm}hANl}N#mQ-k6(U;CxVQ6tG^(5yM4I6_u
zl#~1*PyW;TEPs*C{_N&iS8=!0+LHt4c1XTJ2Px!ew1TUUI?gk1UzF0%rK$CCp+akU
zIXLMSS9!o_p6SwEDG)<srMVGD!!tZ%gT~DKl#v(2TZbJ~(z9d6YezQR@@sf@yX~aU
z3a>O=QF&)vX$o0cl<31C={Y%QgJB|rgcVNmVKdTf8}shiw@s!!thRfA=!Aa@8yp<y
z2Kh*C8?*_JfaNG#SG$ppm%>QbMtOo^!ievUqWP&BAUhx#C_VpaQm#^#)$UlXtr!20
zDj@k&x^Io*YeZfUd%*S2vjFNZ8Z<}VMH_~c&BrXku0>t_0+c*7+V=Bok)V<@P{kSO
zSZTp_xBby^+$U9H_%+tx!&a))#4u=^j%+2w=HAM=YJ)hhO2$!k%6~Kd=j3<@Xv1{_
z56ii=va0mbV5Fon*=#Hwolv)ca&fsBX5@5(b80>QYtif9d`7vOx*0rItJnhnX=l1K
z(v2_s^aJ@KH^G?=4K+YfWn>^JqN*>CI6#zqPF>viPaNeyPSHU6AV@)$>A1e(ZQ(Sv
zPuP1sI&)+1L(z|mvE$HB!^!q&UuN8aQdEOWn$kgEa2(s|cfh%`6EbD$epTD}YVXkV
zW3K|)4nG#tC`VNdmftH{xUj5oLCxj__%%AP4e7&`A9O_)mHlk^`jr6P$0+6sU-dBP
zYH8UbPU9svnNj9jJqGR+Mza>-vwRibNF@|9u-5#*x)VvB1ZO@3w@7IPegXEE(;}_)
zUprVYJLuMy6PAs<)05QM7W*Xjs#e%K{!Pdk$e50U*@_&$;8f{VqNB7*YDN(2z$+V{
z9KJuAIu|CZzacISESlsrT^Kav(ITEQd7a4S`MpBtuVu>CLDSQ9-@i05K*~-#>fZui
zHin=ZW0s;|R7pWkFzQ#=d?i{FtTS%5iK_hkUD|=m&jtj$FFh{U_;(}zE|Y<u-8Nmo
zMz;=-?J=P3Ak=v#5ACZLHuMqr9~@|N?48$8rEYUC0VbyX@Saf3B_y{G-SfpVK=5F1
z*xHj&Zf!8}8T%_XD=oELGs+s%Z<ccVO<JMs@33U3HJcl~r$^u3`;}N%%g|Q&O<Mq(
z)$G%aX#};M>;!{aZ`w7%AipD2wb0)t=_pF}GU@0J3O-5BP`i<~*TJ^u*&dRRBX<^1
zp1b6xE3*fqq}#{wt-h-65Ek*4TD|C!#8g#djvCKhIG(`64^15=RG44R@%H*9J2zuw
zGayo^A**i3F<(zTRl<=jy5F7tI=a7*x5z8pJh?*TV2n}nN+A>C!9JI8H|7p8QUh}A
zF`jf`@>4hgd}b#?z3S2@A(me18!n<9Zy|Y}MhujMX^HsaQc3OE+U`?tKLL{>TH@z@
z3S^S<54;^(QjdPP{j3zuz_=l&Dl+ce={Z2E#ARO|Z2J&*7_0U~&g#<!C}UoK`}5Ib
zfa~^Udare%lQw-IyTiv@-`&HW7kL*t<o+Y{;GkU6c66AjM0k~plpo?Ks&`DLX4(`N
z4&jms2ayTXU1)Tv6nv5t^j|b()iw@44Pecjkf|zMw`ET-lQm1o{~1$9^TtS?SGzzh
zSa+9b{ndl}>~GJ}_~lt+R{uw4S$?m!%X>ns?9<k-Ur@E3Eb$rlrw60lUoF}As1^Ld
z$D^+cGJm@Nd^46w(H-y>xRZi8+X_02{O$kIXt+sUiJA-`A~Nw=tR=!Gp0-P1H@+he
zX3^;!sbNs_bbaU*J9;IO1BD+ArCe}&VC2W;6l3ha5GCHuBu*3$v)<Xh=$_3v<(gu*
zci?mB-+x1QwJ#<)pB~W)wUKAT?@#9rl{Z6HZ>5^N;!3xyoiJ>R6zCXlZCIIZd^08P
zUfeuVb(4GwT}&-#{qjmpRdJ|B(<0{6wyb`cX+6=&A*YPdLn+Y8aqGq@cM$_!z`;4Y
zuhSYGGl}f<d?EF>N`oK3Jw3y!iODI15juTEZqL%@k^CLfbnlztFvihcj;c(}-Pl!q
zc|^2nL1%2pqDZjkr>3YnuW~Q)I)@n9fl7G<F3H@{r<YbMGUa#TqpXM~E&6Tg9M1Lk
z9B0Slz`K##{DWg(wfV28U0Yx`XEZxc2BtpRB}(3nLX%;}lb5zs{k&X_k68s#qBkBV
zGoYM@*XOTOQh8P?2KuQ<%S=pc?@y`zj?NiTt|>0km~%lywC1jpf3GD<Qb!g&BY_mI
zPU%0X{V%(H{PojQocbD%7V*>ld5DNyPKurgoFMZRJlpgbF4UE*_rcFjrL|WGpvJAI
zRA;%IN;awc-!<PkQ=Jh=;^jycDGg|RgH%WV9+lPqEqk7vR*C)s`}g2#m_#+$`4Y&3
zIy6=x)0qF4H&0g6=Y+sMo^In_ivAz*=f3{Amx<4`-3{`!AAI)|UX$84T#{iP2UFS*
z&p!9BEx-iw?H6lqj!!+C-1YMTZ>RHIm(VsSkhzG<bb~&u;4|@l>qHbWW%jlvWh^}a
z1qT;Ys~TZ_&$)hSNdFmWI4~b83k>ayqFg9(-Ft_7tLS8k9b%TJ#qFD0_w{=7phu0E
z$rj$5h~~imJv|L>2%426KcHs5gMj@oce<GS&^b|`=KH{YiFGtJoZbZ}-IuR_%}!ON
zF;lBUiew%a$Wu*phhmEp@nWkiJlQw{mWs%mw{OCnFXY3!Rqxv4t@$gsK=_LJDM;D_
z59M_h_E)N|7{ij_ay(CfKqXbv`;({N;Q%d(9VQq0ANzTgwEYh&nBBY`wPfXdFrD(^
z%R+?o)KoeHN+XIar9yeT+1$Y2vsdHh^>MunJ^1Pp(^dlLl1WiJTdzs6fvQii+<ejq
z_Wt4R$%opjaMt2qVAP}e5uK;SDA}<{N|FHdzF$tmyF`Q!egXWwPTftrX`Go3wkVmB
zEE<*hCh3w+O}zY_eiY;r`;B&Fs~EIAZ@KnY<zsFzQW!NQE=R^OIq|6aW06;7WmP*6
zH4LM;sRgzfrc0>Z6H?c4W;`JXM3k+l%=qt*tK~dXNajzh)1}=OxFc!O5!bY1ibE#B
zJKS$a_M_xUP2t4n;hGjX%GYI6`+2Ahh=Rs)zx>IFpQ?I{5)d^ad8o?xr(1>TOe#Wb
zBVg()z13!LO2dX}<RZUwefH6D$mICJHoDWx$p}X&b+hu+<R{R<P3<J4n<{ZKwe_W<
zDBxQI1fqs_2{8}E$yJ`1?fj9W4A8VE-tWj6;6B&N7SoJO(0F-BBTBLy@OGlIWYn~1
z`q7s6!6CI#%Uygom+#wiM<Gc%p-+Ex=$G+t0ne`-A1%UI4s@)?GlTPuI7X&Z6WF8?
zhs<<Q$)2e`uw|7L5}SAhw0+7Yu8jhQQ+l1UK4&=cu%wldh+hGTX~c=sj|X=Hk9UTa
z1U|AyNQ@bx>mR+O@o6Z~DGHjJ=fO!#+a_GYj6R7bsoX9tSd8GC)SqCMSN!vnE;w@2
zuxW?{Y+4KeMtnAJr#guJx3E$h!<{zgO$t@i!-t*o)zL=yR4Ng$*!I%8&iX6aWd=Fr
zxKSto%&o+l(DTIC3fYu^r12TzA~c2tvDJDiCf@bSVOS#J%fEVr>mf%<^}3{Bg}5=V
zxyhAJd2Z}APHk2S%lXYwyeEeK#NL8xvpUDf@x7_SBAtBmWayf!a29p0@W{g!Pp11n
z1Ga8U)6Z`HSoE&hMlv0eKlH6Sm5vSnL;W@&u)+coZ5@ud_x@O_+E(mJ%`VC-<Cpct
z44=0>&hC3V+jOOw7V80hpigoy&sO|rw}(L^-02h#CN(RIDGGs8q&L^VVJ(f!y2woO
zCn7lv`~&L0zt)zum`?MAJl_+xbYKe3N~6PLv)S=o%e^JWPCol;4yV+P2~J#+o;1tT
z?SFVAt0@1wH-MR_W%bQf_Eg6<W2q&oAr)TsZ^&ID_Ix>^NYP>&lG+92y}g)*->6TE
zzY<6&RjTV9{kxao-DjFg)jn}O4r=RiRPQWw#xI2+InVc8Z4PvYY!*#10qJypo!u*U
z>vmxR#aKuyUznX0UPLUuf&8BPCO~j}8;bTCj{-@q;(4oE;qB0RehEL;ia{q%4`1oP
z&(M8=Ul`o|);p%{_=b@U&3Nu#`D{|3od$UMgf@h|dZ6c^P>PeNsj$hi`r~q8PK{f5
zCSO$b{*q*xNXNLn*jz<0sbzB$ap{@6C`~7p3<WwO*Wb@WYV~a$TbANvZmn#EJq>70
z8g7WIJh`m8KZkr;UXO;Z#r#6NdqH1BVS7@dmLmKdFhQ8o6E3`=O7PEK{D9eCM?oGY
zjsZ@U6o;-K6{?6kxG{^wUjMK=rxvD8mdV6Wr6@I)+u@gC)!deQ@)?@v@6FxFFLK<w
z3#b=Tt&SXO7GlwRr2nSW+(Y{=P_U1RtM$6eITVS^U{F2yzB284(nEB5=g-*k(>%G$
z*z^c~w^1qhL$9(XltF%7IR{o&_2|B)e^Sgv=1<EaQg|?!G3aH46e3g9g(eGc6rxfH
z)Z8<)BkoyywRh>is3BLoo&5B1NyXJ~E+PA^*9$R@5}vAP8YG#2>+GS$!egI3t`3N$
z!?son7EWDNZ4H-U`a;mSgKBE+@V1>^;tsvke&N#L`xY~O_c+h~Tj_z{w8xkd%zGnL
za@($BOk20TaJ>|7A6!LzfS}eAUvF`T-d-ps>~~2TW%ng2fEL&^(ISgLHa9?@v-I^q
z%)RqI2CyIuQe@^<&9B(VB_NV)&L_O<4&pwob35fO(u(SsOfR{fYCc@C88D&iX(#-p
zRl=1=J67zjZ{}{Xuj4uD8Sj+5Md%5s-)OgKh32%ePxFyUsq&T0UsJDUu_?Lsf8Pyn
z*st!X{Fs{Ot%<xPrGhNu&@1}lW0t1V_Ji?<^~ZKct&Xr3(-9(Sr+R}OEVSfH7gIS?
z6J>P7!$JphhGgDHmg?Beg^FvOnH^Wly*Sv#9am$}@_zSw&iCzrR_}iZ!!_^jz^kS<
ziAoB<03ni2GVJdC<*i_ISx3i~hp@@RV2~>=X!JE{<T^>@yl+|JyfV`tj~(aJjs;HN
z2Y6YA?^d`26Mg+O=Q}ap)5O%t$Eau$AWgI7F^cX!cZZTE_xAldHh5TtmibbH+*uxq
zcHUf<!Jf>Lj108Ygr!srEN}autfWCXt$#byExg!Zz~fQk(;H>Wkps>}{6Am0(N|C#
zbJ}nr)MDKwg6YUD4=%7pp?ycGhdON##9UA5IbdZZnhkzEA1SFn?p^iJFN|s*Lg@7D
zEYgV|eJb*se@{&#AOsOP9iia_s940ZJi`Nt`uN$)q#`9UPKt?jWCGQVxO!5;qGMpe
z^5bNQ?7K>2n141g=;z~_deBNg%1pzcm&FQILX8y%2P+`Z0P(o(u0auo>R&}yCRJuw
zoQY1OGWQ`PuW(Y{k*JjRFqH%sP*kJ$Vpmt{(Ujzd1tr#)*__CR9u8)c13J3;@<re6
zqDh5&TmmbF!)O%EM|qVvCpzSv3_Y#};t)v5(;-GcwAB#VQMX|I2DUSP`}=0xN)3Dp
z)x=7_GKVG4_;$;Zv^Rf<bT8KK>X29QJu)M@#G9^Q4IC7mlAk)M&+LJk2XZ%j=di!S
z)RQSO_E=mP>HIu++=aX5Z>2{>)^KGIi-|pzEVkTEES@!5%Lg>cA0d%&%vjA?0(3Qe
zo(7I%mEC4!hW>FR_Zx|1n=ss5nza77Lvb838gLnzz@ULef?UZU*~Xuo>BDGx_0g#4
zLKhfmh6irFNdFVlKN-bGi3t(0))?`&TsHrgW%;?EHkCj;Z|>kkM>*UVl9G@>_7;C_
z*CB=%<7PZ6F?952M*03qC`41e2sA`boY^R8MT#f^T$=STM^KX{V|K5m>KTsr;}=qO
zQDSCL3G2?%Q^AR7AUj-EQCD61T;&-SOEXeUR`QQ7Z4@ibkbxY3J+YrvOVVdoS>Z@s
zU+$~(?RDq`gU|adhnb=Qc~!kp0GIwsCbNKjOJ0`TItjfRC~mW6QQw+N<{lll5^Pa*
z%BYL}Edv-?!q{i1e-=38FjzZNm)Z-yx@|%yI7|OZkfLhzx#AbPFKUFCvv7cH5aknI
zi^mxMc($x}-c0=b&h1T-X2wwSbAMt8bctK~umc(acX6uqkFf_@VOZ7r4sGhde7uB|
z={@V8LCP|=13?PyIK-=G{2Z@f*E&}rDt8-!n^(U_PcW|E7Joh7ErP=iS7a5OswQ^q
z1f{ovs`*ABaX6=|ddM(+Y*2)9yywxld*b%nV~#|o24N6-O)!#;F+q%C8bige8i9WZ
zPfIyM031BUhcLAhBw&IpCj*mFGr_Gw*7;1d`PW?Y6Y=2`->;G@Im}!t=%#S}l;4AS
z4CaH%(ahm@rS12a2O7fe`d}9A@tej@Nm5?-0p=gK{}}H6in7!qe^B7E$V^#+Gi{y%
zyeN;Z`73Tq%GPH){R;Hff5k+iB)9*ku~((Z6O#v@Jw~WbuzlFAyP|HR+%Y^%aWlq>
z^4yYX>hpqWvU;09UmtZ(O|3PoscR>zAEa;7gV!d>ju|7>sBVr-M*-9a6Gf+F2t0Zt
z=CmHeD(P>GS{dvQ4s?{V8L6Smc)gObi@BX3yCc>{G=Ri(e|X`-H)!0#p+L2GL?6m<
z{c`&Qj~6<wi{t}&?3;TEsODZO%8<{{8dXPx^N<*o&_&URmv4fkx9(kQg5dRfGCr1D
zAdApw{QgYWt`Rv*0lI~=l~fdS4k)&fJ4Hw3x~ahza4Fl;98ckBFiZZChQs(>uV91o
zSJ|!12EUEiHVy92w4ao656k^yzk9xFwklErgZ>U8d&sq|94EIKxVoR7O`dyceXhXA
zXwG0axEINk%iAx|^I7C&!qi$7(q&2G42yzI9Dz=A#YZn(AX9LsvBrZh>0khujy5Ei
zVJ#nb?ZkR#^}O-Cw}9bkM`kO6n0kix9(e1Ks<N_X7q~~OtP4++c3EnU2MW7*0QB#a
zBO>YbNY0vNC8m10{mB*Ux%?K`rWC9`xDNP|(>)ZAh(iY<_$<<f#Pt&eRI3d`;qXez
zpQFVIqqCuJk7ndMaeA_z^~u@BX=W~zr~2TomHyQf^r8Nb6tGcW!5YDE=#Pp7-t3k_
z&K>GMIm+15p5|g2a!K2gH)~yd#2?kd04^#O{4@t)2vD~%ZZv5=-fY*!&H?qb-)Z_*
zq`A6b*|`f#6lE!5YG^Zb*)k)3xIzQUB<zG1nRRl_gw36*ZodG^`Gwa>sPNOlqQJo{
zQM2_Z?^6Qqs<QliJlG-2(fyGj%uP;2<r)RxirTWWNs-M=4odds@@vo-WEoR3wbT2V
z2J;WgsqYju#T1c0w<%6>-&E;-K~HrM;myiND)Qh}nh&B#B!)ZRyP|ry`xvRee)8b5
zByujuj*vVXZl-ooI+_@1CnFKah>e(@iZWjapsA)VEK>g7vS%Gh|ML6a4os8<K^<D;
zVz7L9%4ZvJ7tQDXL|FG3iJC~$ZrR^7K_>d%WDLQy65H8*ewFO3g(?ow9lmV$T^fAj
zht#b>6+f}QW<pYie=NE*GfeVwya}6Fy&TQ_b~~C<8V(Aa<sC7^lxf%a^Yd#HPV#G#
zsvRjpMKV+Tp7sWX`<^A{oXqzTl2CQ<FnOOJrbj)!<u__##G$J;f8C*P(xfRJ^P(7l
zHUwMFN^73NgIbA_Z=rfQ*2Y!3Ux~t6Ee&dbNxc@Wd4>h+l4<m<v2Lo{D@Zly;=AA6
zVJb~jEoq#`oL~z%VDM53wjV7EmUfVn#r}rH=$yqe)+owW5ugyqdq;3D6@6uxQuc4%
zu7^vj+mJQuS*k2h5ul9lO2*c!{)otT3DcLQoYFpX>&v+OR9mBCVX_CC$}+*R&y^)0
zxv$GqtE0yNv;Ww@Fz5N}!~NlG_w=nv@_^9$0Gh~m!yNV95>85B$AavJy6gHv=26ko
z&|<l}v07!rFYVT){U|>{BK?|?uz}q;&?$+LR)~a=qZ|oCnI+38@2W#gIa+gc6&=}&
zO@F{_8VYVzT7%r%?iHy~P;!$OcC9Ir4DL#i6Pnu3`%hTUSrmh5gx>-VuvFq=+$VfY
zm`#_etS}ozuS2K%EcYRnO%@QY!lMDpaX)PpnKO_6a=_@T$zJ_hP#z{T##j%>Y`!~W
zK#DfJAt^J6_cJ0V%w+`UPgz#4HfxvM%)NGtZ4*}IKR(?%wVnF?B+CZ|0-m?>1|diS
zp6sQyqAU}tKkDTHx%uKuYfL78lV4}iu_JK_ur0SKTM29AeMkY!`D<Pr-yQS!^LQZV
z{Q6cUUzFW~2<!Jy<B+a@8gaQ1?p6&`qIZ!=sSP^1g(s~tq49ScgvfUs(sSYq$2)!r
z%*b75cjUP)t>~oKt(BJ9^IwGg#F^!#uYrkRdHJ`2MJ0nF#Qo?^{}ro-8wi2#<k-yT
zuXmu^66V?B2YWvbCG2Z%+;h@@&B&Ksv329^PH+kHvXCa>k;z!-uaEEduK-9EVG7VY
zM%Ldf_WQ#eP1KI6G(5V?(Wx(aZ4)9@FAsYcd65Hh2iI=kAX0%lCCSlNW|^gdw_Opp
zK}VlZ<oW;WHP7D;de_!mh>pq(N)B9m1%m_~c_8W@*>4zS^jmiAs)>DmHx$@Q3t8`e
z>zS^z+nB}`6kJ=UuivjHq7A3RVZuTN(fznlIjK<m?2M2{%1{LJR69Q-G(S5?)$kNM
zl(i2V>eBVLQ$|gG(+n?iTbqlKKe00Q?RYeM1m%S6zflMBpLT8WpLcn`xjlNtEpbtJ
z?>=K@bk1I!;A+=oXr)Uj^@^Bed7=M~{)uHfZZ>%uqXCHIWTpR6zcCSN{EfTbI69;)
z^seGB7SRzRFT_u*=2+)Dn<rXB^WH`;==;}tA|W;m&I<3i;Cdm!21@bS=jGnwJ#N;M
z`1%k!(hG~H1b4Zk?DPXStbvQ57zx_20~pRL)&xvOxcAPQ<$3h$+q3$ikP7vOBJXxD
z-?Y?5`U_AP+s%D~TFt_`q)Y3^sUJIJJ!Ustgp6qKwWFD=EHv4E?&AT*N71-R<lBB5
z{-Ytn+uY}6DM<miv)3?@c}3&0v%8}r2ri0mlsVgFchR-TW#%P8Yjs{9pRs0~86hI>
zYA(K7P(|gzcdK*7(#?6-Kc#UJHQt`b*}lO26H03awHyfZCmACtq@&i`zIA11iqIlC
z+qsj~=#sol&dt7&%kpUgvH7744{9L^D$eHw5C_(yQCsNw#CvRX1vfH>X()a$!a9|p
zG{v?gSe5)J693wk4Nn@I(Tvru1}@fCagk+V1>N<eLtGIzqxR=PN=nArr)#q@#*?rW
zpd!8)(L=NQhUAx@RBqoWV;a9FTn)zfPr%AvyE)i!KCCjw3qJ^;2x}@5T~h3p{8FX%
zxASsVe)+J%R>+4+#H;bjXXU={(PTn}QerG&3b(Md)PHQ_yNIN8pS06@noQ;-LqAD`
z*kjlUysj<Zh#Vo$F6G1@Yfw#QRizC7QBs3aS5`w$Lx@^48a7EikMk6An~m&*DF{8s
zAbzkL9YApLazdb%ChaEb5z<X35q%NFi|d!H?PbD>HSF<m2hY!5Z=Fqjga`)H&@t&Z
z($QCI)c-t-%sj6jaS(uC|5Fip6yBE-*aBZw=US6MsB9MMm5IXgLoPLmR@DIDim>+5
zk*Jje`&RX5t7JUAIZQ*oJ?oScW4CL=^}(F>Q^rj|L3;0zf&>CrQ)OwX446(%DnQb+
z5!b(>K7>P7_bU7$22-*q8oNcm6gD`p`VQ*0_;Xp`A}aE-$u*ZU7DJ-SSWLj><J9|X
zbW$93|0?!}y-%<t<X?H8kdton9MlroAy?wf2mfKKa$l~06jB9PV0=2+P3Z^Ed^m|-
zsR$kwe<44q6EhtpjvHjotjNb5SB!@*<nDS!n~IDX>g{d8LhOtU&B;__SpHTlzx5<i
z&4F$maJ=H>r&CCIxMPmgr*&viOtbE?PxUm$dKP#O_;#d>7@#-U_H*LQMSvTf`y=PR
zp5{-#NFOsqJ++xxR|=<&kf1oJ%>o%!ckXuYQ8;X%UlUg7Aj!pGY*Mj$1gezZL3E2I
zzDv<iiMZcp0*g!CPzrpM8C2LeaLZ6CrTDFXy7!@MlnqYy)9Qi1PT`A7Q2EXL@R8SX
zCDYFF++Tag8TB=EoQ}7E2krngde<M9qKTpQR%@qB3>P`=E{Av~Lrx=v*s)7qZA=8T
zkHdxdch;%_qgV@{xGl;*&x^N!>|AUkHclJenQ*#n_YYajesxFAbZ~shkds)|e!2d&
zYGgdj`1&wHNnF_lCS(;eh=iV)0Z$K<pg=N6Sv75=TP&28@x~LZ<ah|gz7_^_%*X|^
z@0$VdoNO(Pn!;*;7~l!pb-glS!U2oUdpEv<<h6%X{icNM--w_5DdgjQ%x`u9Q`bvV
zw>9&lXcb~@P#mQ{E%gDn(>L2SNk!z=4vZ~jWIk;#sChn-(vL%BORH~yc{PPEnV{ol
zNDn0T{$9itfNir17S)S?YitT?$8V>7xG9R;J2UXbU1fVU0^-tH<Go7!K3u)DcJXTB
zUd>z;E*mpB6!r)@fy;Ar@b?DRc?!$TVH;#&uPbFm@CM}n!y13e$b?e!>uq#eAlDWp
z1cC@9ww0vIqTO_)&AUAwcX+;Guham-*YN>QAvvT5Dip228BY1Whe=^uW-fipL+$7B
zhunLIK|h<;bNxLmL29>}4RGU~(6ehpQLnOlCG=eB&9YVMvt9+^=4ZD*etrS4+7lf4
zNfBMCA2S0bh<TdYMgbB>{vMx^?9*5pH{1Lh*aZbwg`R17`Bt;EGh?gGcwHS7A4jXv
zllU`o6;UiA8x*OaWR>J^8JlykLR`Vjh9(M=4q$?^v-PtZHb_X${k>EAwtm}<(yi9k
z!+|y*Df9kmqWQm0r14+E+D13+<w3Sw&-f3{PjFb;-9F;j3QuyWUtC!nou&ElxVc@$
z9hWu#&e}I0iy>|kDhBAk{@U(xMSZ-@45(oYMKpUL9`6O5^9K2C;J(xt@t;!kixzVW
z=j2W(?oZ|x>F_nY^t@dlI&=mo817<Kjc@pXOQKXEu~qIGw~c@Yz@@A2KgpYqwzmob
zM^}u3z^A!so#0p8<JG2$B*5h=pxP)C5Dq>&Rsm-;Ue(iZmQ9av*tgWpwOt7<g!~fT
zu%za|7UDqb1C7F?B%yuDbD(sWM@D8OV2#2Lb;lx}+y0qX-L?OcIA93~T@vK}G*<rD
zP={k_DvVKLV0N!KO0t<}2PN4q=b7WbAZxr<moPjn(8mqmMGa_s2`yASz0JhGG}0<w
zZN`7Jrgw0<*oyi1w=gG)+`HLw7<P%g>tX}gbB@vZm=`O18JZMX%H*ysga3FCnzXu#
zGA@Yn6lrYs7I0_HwuU!Qg73QC2m1759O<cNW+JmQ82GflyjiGn@K5X=*8JKaG;F&q
zO%0rC&i&3|XPHDXuXg)<aakQoek_imWIAhdnc00Ye^Gz%^o?4?4Z*K%ic--ceH8!q
z@ZxgF-qztD5*r5vPTNruOUrKX6S`|zn!xg=dD`7B)Am0flL2Z+_m*=CCx5=KziQ#V
zZCc@VTQ&QLo$lbMPIo_mLybSrkMX!D)r&auyP^P%*wh2BT?LJsa5dXD>aK{P_@kv(
z#2UqA1Eo@I4^zbN6tDLh9T=D1f}5%fb(im-s&5uG$@S4@(CFCN+^k{zVZRyk>%iSl
zOW(j(Cr>u~CZ$Jh&zqhw!F(D=&ueK5AA+4hqtdWQPLtjTNM~Rk&nwycM)4Em-*3p-
zgbwAn7tUf~YMyj)8~f?&X#uB$c+vnHy92~q)+~lFLVKl#Q!DY_e2e|*Q)bPf(~nq{
zE(~_&DxUTVTN9~^A;!`dF8UXpQkLOmz!u)MG%Z_SK)sdR8#ZzDQpT;4)O=@%_v4;h
zfbXQ^6G`A}OLvpD`*3*Lb^kGA&-dEP<wsT0dr`rIu0Cea?LFFi;H>rd>urR0f;QvQ
zdiTNIF??iU-UQN2$?A4f!0nN$7!4X1^?JCk6kO3~1h*V18N(qZhzqdJFCHaNU~K~|
zK<kR8sD!Gh;WFO4h0xsic5Z8XyuMDq0k_8PnGnwC-<sej+zT9W$%7j!|Jc{JT>z?=
zYz>o+50AY1Bs9h#Ie+QeJ_y;^#Jb>oqbQEp5;U8+#;&+KbN$gg396n1S*h_e^`hcH
zY`g9}C2o2K_LS9tYf}I-y#lJ2c)M#-<7=ZgW8)r&u~5xoe+Zxe>xsH<%}KbLt>6Y#
zDm(gFvd!GzYi68u8_KVcUA(E3#!>CKsiiX8oG(K(W!2qsEO**zH(GVzdvfD>qjX+V
zQwZucxIDSSPB;DC`U+W}dA>G__HluzDNLQ&hYS=4#+%FPcV0;}z22!#g*+Fj1WXAN
zIwFVf&vEsWp4{|fO#^m^F@cBu7e(xio;ChZl_TAbi3D%Os(}jc!zKUQqaWICqEp>o
zS2#ONMD65SW&zATlt$vdTYBE@M|-jh``!RP0;ZWFhvzQ?OkU-{Q7>$yU^Z{zivB&%
zxtm}EHa-PlUQfZz>FdmR8kLVv!eNQIAAAjU;F9HLmv=_^#>4?DP>2jV2tX4YRcuvK
zya?l!8#?F+D8i=9gJn-p5@Sn$WzzL8P<shgs2Qp};^dtU->}7h2rK2?LITZ>WS+}(
zr}nnh6!w2xPEx#S8IRkL8~naPoN7ssn-+nhd~E?|Wfq<*tQ@6V*m=aw<6<uCA{TDG
zk||hD*5$WAqB9IJXFAPaMqr+osl(D2$I6lCV0N7(z5w@H`OTM`7JROjLMkP?9WXl9
zc_XGV)d~r}D=3S(wiMNPBkbcfd<LpM#qB2*mFa03UoD+K(+ltWfu%B!tU1G>qvLmk
zko_8P*JF5`XK6U`bndu=Po`hahSxO|oK_&vntq?gEz$N46Wx^VQE<>RH2xGcmLSa!
zW25@~6s6?obWNQpR~%JR7f^01Igck)Z<haNxpuiEPfs6^xYY)6d+GJKeS-~PYK9``
zda`9GDAs-Y%pV8^>ZD@dz6vX4dA>sJ!Cl<`m6lbX>RX8%gx37J?iUB(jO_ed+~3IT
zR(z8Nx=-eBNlglvfPH-r^;<4Pnez5CtVi<11Z!RaZg+1J*!Tp&*!jk&n9-fu^5%~}
z9Z8=8eg6?dqkW#g%1h2=s#P`*Zo#G18oW)$JX&sVtVla-c3>tYaH0FOts(L}CN?$a
zUrzKwl@SdjUhQg;Cd+vhDm(mKNxdCwWwfY80}Z&oz=XW%BWFDW+WtC;@p2odRcGcK
zw8=U*y8;<B<yk)6k3XDs>B2|Zo_59R${9U&`$2(?j%oMq<R|kMY0PZGp-t5o?OfdE
z4(@~Am&;+*P3iOAiZb5~oa?s0Vr$1&@P9GpLDYb|aGjsRo6;Urib<;vY9&FWjf`k8
zlCkZZ7fFI8_?Pqe6ZEW?X4?}db|B^bFE@^;HUx=0)dM#67r8w@2~m5aG8>ilCN8eO
z5TgYCET4P0>dO?|3mM{a8xFopqB`g18k$yfaY29M9y~d}d~eO<C#x4+|8>2nz_0K1
z5AB7=SP;7=b>-hEm1!TFI}}y2{<C@Q*6BdYHOAzsWzDuD@sa1Dk1y=@xKnx3Z*jhf
z{pGKeC$#<9>co9_dUd)OQ{M2P<siV2My#n4sa)6%2h0n<I@f_v_wP@uKR`Bb|5LQ>
zv@fyvjUxbVI!Vc{?a%}I<2dB*2_u2HPMvM{#vMlke-ODXIb!_fwSY>X9scdzlE4y)
zyxDnsRhP9Kxe-&7<AM(`-l<7{VePp<2f%-Bx382L(voK(S5l847gpF1t+K8aH2=fT
z`f*ox+PrOmIWL+i9{<9eb6;H#LeurlDAcjPE1-?Y2Kl$1(0Lh){Hp*-v*&HtZg;tA
z|DU=p%R<)l?G|t&+}SuO0jCmU)+D82M|@iMkbvXfMgpsbR-C(?fA&8GUFb7l{klbi
z!mo+kGMm5+)O{tjQGSso_u>H4TMW7sz<cyhZ!$Wgw6lLK`%$ijPQ^}fF_~wE2(mu|
zbU)It+MQ1GC6J0wOFfr)nsEJu#~0X!7$<_y>|AazG>d98J{+`(XcJ5-zG4bf<DdW`
zL}^QSjyJsD=OR`1vh$0gbgH?~`%-y%_;b2eg1G>aq+R!LQSEi}17%W1Bl63SNduev
zjjOG#D2hf5W@;S~GAMD0Z{!Njxn1cGi~d+x$79}!;-&%$q#0MiyqUf>c}!s0A{UP*
z-QkkDl7D+0#{wt*%UgbJc8n84g~in&%gQbn?x}-dg+&SjHW;9Ks~(pUOmk>JR|C}^
zeTq}hu}VGUW@F%}kES+daV#rI%CKoAtScaZuvTcLQG)iyCL7R#iZXzb-szX!(J61X
z_9iM(E1QB$j;wWZ?-cW5fJ|85sxGHyGM^M-H=R+@`V!Q6_V5MYP8_pAD3GqDvCHl*
z<xCQ87sJEeNbto)17y@ggv(Mb#Lef}qg>BTyAe{iqv_<?`*mo}duUDS%<S;tY#?se
z#(;>NVW?p!G7_@7?_1g}y!N868}PIv%q<Lh?t3wYY~X>k+)XI`M~-2Ijn9CtCeglj
zrAF{Jwckh_gdOaO>1>Oj@X3R9WTs54!@0Hg9Oa%&{K-YtU5G>lgU&z!<NEs`^;>qr
zKNLug=_fe=HEHGneOjq+cSB<qZeNooP(?BJZR{mCKagEaS->1Z`!{Ncpoq`MhUQ(&
zc+vDIkG89v<5YVoD3rq0L9fQez%Iz`!ah#w<%Ed$ZrD0jNUNm>6~;zkr|`vtgf>v|
zsVWw5I{ebiO`T<SEl$(vYf~aNje^<|7m{QLdvexz@s3Ic*o7^k{HTRLyf`VKBBM_m
zZ#fSR*;g~aUD?`9p|^JI+-7|{fI4HPn<Wt!ROBh-R<w1xZ+c5=l)*z-ia1v1E*YLi
z!Q0)aR=$oPGxgpjo)wMx6+u3pbXnm?&C16(;;m;p*E2^{BJk_l`>|RC7w`hPhOOqH
zenDgmtkk@pIW7b3<0H%qalD?qTApnajLmj8-`|}(dD_~N<9hOYtTd;9*W<sqakVG-
zC2q_xx|_OhD(gh;dkFsx6z7NVx87T<v!qNX?vo=&QIb{vGam2Crt-P)bGg|tb%3l=
zS$WY48@)9`1ISVfxYAfYr^l>SC;SW5OUxZyyirh63ixUi-Bq)TUeA#7L|Glh^SeW>
zG|E0~9Y)8P<NJ|j@|!JzJ<!l(eP68utEctxXgy}ParP&Lcnz5#;)~qIF0o^iJInT(
z*~y5ea6sTI@LBR4(HvnV>($1it9NFq@Avq#d^<K%QPpvj!R7*PO!er5sk`avM7UNA
zIB{9R=3G^WL~-`-Alwgs4z<%Eg3ZP48Ku#&bvxvHxpGjSH+2Lj81aru&@8;nN6h_g
zXBhNj1kZjdz-(Ih`AEvj(fH3pEstccYq!-qxV5Iy<-!O7bnMeye|4Sxqva(y;iKEE
zIh8MjTbvdu1<^-=ws*h2G5`F~`2o7RpddI6)zAW6<-J$jVi4v=aUz9R7at1)dCPS4
zdE(N>A`FIaf8u98glq|Dpab#}Z^#)ikwXZgxO`natipzT3)Qw>&#=Jh#UAG76EI+4
zb911O&iGQ2@EfhpSzUX^!P(jJcF6aBBU<cKYpps|X^yk=x5kj12#=^>5u1-_N<8At
zSfS1@=iWE_Tx<7z4}izk#DiIq-NUmtz{5EQz?VPrp}28pd1>i7Dx?1H{NQ*b!-`Ot
z2twnrGJKU4;9Ti0eB_u>`Ej^Sl|xIaATCI_!xP9HSKAzw|C=yj)`V1b_UL@!W3wNJ
zz^QY7Hx~oV5n=et^AC~FA(79&(QFwzz8Zzn`pf)^I>NH{hRa_5G;^k}RYPsG_&GuD
z$pOeB+a~jxpL)BUyWg>iJMW0PQrBa|cZHbzB&6)8V_9QQ1}f=}&hpq090JgsT$eRy
zh&iYo=;A!t-iZLGIIXqz+dB;0`Y6L2e22d0cWtf~!2Kzf+c7AL!d^ZX;V)a>G_3z)
zKa`}&Yxr`O_766<)r{$I3zYWf;fikSE$7QJ#42=!fAabM-dOAE_{_iVeB3DP0Rf}o
z^LO(i^ytbOLyJLLL2P7B=I~TpG%c7Pj02Jm{nQ1Vv63-QzlLnola}{hxAZA@z<gK*
zh^3HRv8h`KqT3jb>q2&XM12&q)WS3UQizs~HjmUuS!>(BI^4j4jRt3dIP$gIXG;>|
zw8U)YZEQu!7&Fpue@hyiAz{ymv*zmD@n?|zsew*Uh>N3I^-8!WguSbzK$I&{H0&;2
zmr{Vo=f%yUIEy$i-7m=Z@#pKE*^3EEut^%P1B|bkKow98EaiWP@LZ2>66fl3Hyz`e
z@3kymx=XJKxOCJ*sKyh%eq;AmuNLXJvwkz#6p`W-Zs?-u9qixkio%eHuD@4B<7G=G
zj+L?ye5O%Z3o-TF2uokWmenL-|D^s5f2psLG>f0|+rWVv=N5qWOM6cKd4UOCf$e)$
z^6Yca;wJx_r6qqOpm*xmo)7%o!O(%3C*Igp&}$aaRx-5}{p-3gA;2{@?xCzxTt=>y
zB9;03I`|z)02)_v7#v^fcT{Kpgv~*eO<!B>3a3{F1DJW-Rm&)f=b)$hcXFrPJx%KF
zD`UK;WmL59-R*gYWTM6DuSlh|ADe`Wj#ktx7p{ZPK+Z$Ypi8?Q?&7<y8M1K6g%=t^
z&gxvcg3^1z+wl8BPN_dD0c&Q#F}qhYH8O$4mI5(bKDHIrGf+1fULx+r7moDXDv2-#
z;tdNgf6t-Vgz2OS=5OHKWw+@#vKL`(i`;XdM`_uCqroDKn<&I+F?lr`N=;7rlmi7a
zg7qh$Ldsm5{$Q)K>zrPSZL1HD5Tm7UxYuzTP?aZPS*X+@wET@Y23m9<=yn;$a3A<Y
zWYz<h0TMm(jeq`s<v|ZzJ4p1>H~y9A|C77E%1=b!#ZmX9dWb_oQoFAzPXXWmSH1)!
z_Yjv5N6bCu-wD$AqsnfF{I8_j4jFsQzY#3=L;e5cgJ8Kos?B!D+GGB^3@2(!5ztL7
z(nyF&{lTS+t)q|QP#^O?6@3w7$V1%iO!N*3z4B_4+8104ShRv_IKy=K3v6MWcqKZY
z4GXVV<J(_$Slu5bpw&qg5o$1jJsX-`o0eh5!X5L7termv;Qpfxzp1GYk7b^(YIz7C
zyZ;wxI)oSQ$SnplHNpK9&?e<7e`mw?ebcf&;+|5nnZ{p<x{&4klM3G(TC%E_^_^t9
z^{a>++wVt>7~y`yCOL~?q|Gc)jsW;5?|wYyskZezq;)p$u~Z2ll6HGI&TnKd=-t$Q
z|FnB_gtN5x=n{A{U>3MBeKo6x%NxoS*Pw(&u(_YhNAGj;cU{9sski%w>d<v+#YBh?
zuF-8UqS0G-k*I+1r-3Z-0VbulyEkK`!PA(v+ECNfI;x8UuiSpAI?G%qy3qV-^zFIA
zZ#X3c5c8Vt)8+Fr=95BVjQFp%*W>(9kuwBrmqoVOct1YB@v2Z?&=zzr2n@X3@ASOf
zd;=a0TurR+j=6>|!ilonw@#!*v<KMF43nwMHQ4>y$#_Jak292^!24NOC*r~OEV_;}
zRKPJ6&+xS);jgy^?Kb`!5A=Dukm})Vm)WPTnc}FHYFot~(!QelCfi<L*j=E6UpJ$e
zM_i3oyl86$(HP*uA&Nl4fm{u@br;QP)oN?*Mi~k*=;*Wpg*>QZF=UH?%z3A?g0+uF
z2Lgen3<lTOwKtBnGtAu)i#sns>^CrvkqZWc21;!{=3UQXIqdOJS(t!+RNnn+SJbPq
z23ehfcZR&-<JSR$f&u@NJM;SGc}hSiEZ{40VvO+emYe@5bF#sqld{Vv#h2)QSKkG#
zs9v-1@BiE#0*`$6UJGQxJjQSSgq$7s#}bJxIXbU186_evcelTJSD<vACN%zCzw&#F
z+ptSpwZ*Qx;Q1PLwi-V#rwLWtp5C$`8RwqmY;XI>)cN$PKDs@(MvOID*L0^P2*s}R
zOGyGPLGX=U)6PPthARWWl3NFfo!Ul++^un&F3=Q@n^Pk2UN?B}WOb2Hrg!!NQKh>+
zCn^P+bcD0o|9c``+x(B%rF^aeD(WE&9Ko^qLa6NKDBQ!{$*P~{ha`EpAGe4+GYWmh
z%nosWQY9T1W&gP9VM?Ve8xJZvUnIAGZ?qI!-Jhb2wm{jf;sfPMxf>5KG}r?dQMxx#
zCXV>8N^>DTW(VJ_AL%`hxA)d^tf-E^8FR}sKXxvcrDIDhvUihnElI5bvAYm7WKE;7
zde}yjG%RjTmTK<w$h&*5KKRu5{_s4%b4yPN@Y@2HdNC>mh%0r>u?a(2(`M<JtZmAo
zN-wVROXwjcI{pzFy>)=Hk)6%Mr4WsAL0|KfKi$`B%lFzx3>lfCdtE6*kfV-UE@CKN
zF|;K2?W^x0Ta<bHzwTErccl}e6y-z+LC1L^yrPW=3e*C%D`R}`?{>qMGokMd6(4I8
z1a`}Nb)h%RvMY7qjoFgljLeRjd&<I+TS7wgM6~@rsi@I%`js+V%s)2Xw^B?oI#!T>
z#WPM(QNn!bQDpdIuOHnW2k-v@Y(SI0m>#0$YmtrN(2wz;KYt3GWq`u1(0p&^KGt{f
zk$?UrALZ)<mN7^t1JGSohOk0yCocvFpN=Orl=67FBu06mh`MCkmu>bV?e$0bn`k<J
z<)&@$KT3*zj$d^WJ}O-0r4W1h1rxDSSpR~dTH5BTjM5nY`b59<vH=*gZRS9+6NSm*
zc2=cD8*+R4mG<+|*-5{jwVez1^m*H`m-V+V+WXln?*0Fb+d7QY>u=tj$Zn_I%r4w(
zZ)l&rd<9+04a#NOew8@ai>GJ5ITzvJMf;T;gsYx^Y4_lzA=*QK2WZE};<rYJwDhKB
zS5KCGstaVv=S=@4AmW$8e@pL=-dz5FUdVTI`TtE?zQcdNjh_qg-wO_L7DIm!&VJrH
zP|~sZ=k|*s+qc!~ez#pZpE0p1)AjWBu;aD1>b14CaL;=BqR!Sed9){x1MOiYjr(TT
zBO|wU!58oz6LN=yz@<d#FXr(TcFb$uVgCSan_NVZk@kimlP30$7h1f@B&QWDuq)$<
z@4=0;uhVZgY!u=t^HnsbLn;^9(LbF|DDv^K{112&D$v<6kf!0re?D2mLJm(H9i-u5
z;VUg=`I;U&G&z27EaW@YK{7r})thENFM&pe4o;<G>5DXW>;B}&^Lljn$J2yWd6V27
z->oU#u_2fl8U0YkSG&g4yofV4`}w0xlcz01RBpB2&8@tXg*#R!E5^mQOno?6wgv~4
zdT+D<`vXbeVA-+H2pAQ=ai;sk)<5hX9X_2t+hTxtMBK>I{YNBJaqNF~@6Mw~s_vdg
zlB&;9+Wc2}&iEmW+FJIc=lIY93R_>^y&t|@zcTSr9E6SePp!-E2#Ur(m#_ag-8(zD
zS`OF+=YLi<^XI=P0QtM~|84wS_Wai@ec0Y~EwB`}j*gXKKU}~T9e=l_6qdV_W3hrm
zj{ouYGZN+}CntSLC8PKkc`<>)K)1G*ciHR7>Bemi43ctElZek}Yd2)!{_rvK_Qpo?
zVC(M>AKbt9pCgiq!^zsyy^UnvCe*u^lUqMs&S|ZiAkr3Coub><eeUa0fyi4}W{BPq
zi7=P)U~u&<yK)sVx_ujjTu-oJRg*49(-SHe>pk12mYIAc^B}+3Kr9UWs@YvRQ$3xa
zPw~yp(bSd#8|F_(m$dC08rTTOy%-TUhBurfd_B(ve(58|mcZ}j9J!SIpB+yR-<<uI
zmJ9WN)4ECD$^W<Ub8-IfITbr~U2xI7nB)s{KFKdwe)7+u(yKrE>h68-su^sqm{t{?
zt67?Q$}rm6-rGJ#%B_76+BE0Um3FfB^7pclulRF${m;t(UZMQ=h5J8i=JWsayn0vv
z_pSWAq59vZioC1&{hR-})c*hO?C^Ud!hRF>Un={3!Tu|Xcl-Zs{J7&?Ci&LxjdvUK
zf7Q?B`Jb<H^4rga=YPGx|C8qL;y-WY$DRN0C3g=FWI1e~f-u!;6>z~GOb@3AB;7te
z*?x8~IXu+_{9D(TX#soFlT)o0vHjE5!R(WC<KXP)pZy2##LI8&=koghvp41cE$U|8
z{?F6q9sk!``FZF6eI@_zvt|C@jYK~V|7;!Y$6`D3;fMc{|H=D)ILCSY&QpB8r#Qq1
z7s7+<ztn^LOFYIG^#5PKu>b#h^ZnN~>bmSXmWTDbe(rkH%RJTcaG&uk+lm^0yD@sk
ztF1gaq2ze#7hZUL?BclF=g!Z`Tbv)u`B^$au8GwX6t?~Ufca5>(dy~>!{z5^_S@e-
z^YN$t?|;qxeKPlVKyh5!Q7tdEbutlk`vewR@3wySIs;Ib(*IO{zq$c<q5W5+^Y&j>
zzw`gTl^<vSUBaNtWVYsQI{j?_+1BYUIkdpz-kEv-bAB$h{~vwv<>NOM|IMo+ZRYoX
zTBYyezi;KoDrP-?J|%mfgKlynmVx|na&(X|?@4y6xK(h`+Vj)X<4->R_{SfAymhdB
z`ux^xcY5pj^yFyve0s2b^GxiJTi+dj{Qo<+Dc^ql<zrnoA8V!MThC7q_T}KVG6p|x
zYbmUg3AMK5m<8Bqd8A?|9L)N9Vo#4`8UBb~u|M6N9L^@6$X(o+B%d7}|8z2a_WU$i
z+g(p`Sza6RpC<Y8>~wZ^lswv=o*r!^Uv7VYbb2KJ$cG2~MzY}F`VL!5PY&gEPiE88
zpKc{2CTgp*q$laWH9Ybm8|Cz5x^ss6OPe~IQ4=zm9i54Fqo0T<-9Gt=Y@`D@@2Rwq
z9G&RDM`x$jj?wt<2CmI*QKF9JrLD-YXd6FF_o(>W7XXN3Am-uT)XF)?O`)yHX&e)N
zKAh{Oj%DcI?vYse2juNqsc3C~d*|o}z6!$`TS_RlDZ{=Ym&w}LmquyJ_u_DGu8Xkd
z?{7~JCMUPf>ykX$jZ@zxdH21u-AU|~@5|7^SMQZ?CU!6h@4t7ndp7tqx%p%2*=e5I
z0VU$5qL>cT;+xXB)fU{ljb8iyWUB3O5x$LnSq}@)tvz|Icp;PKA4Pf&brbX{M<+As
z*-y$45NbnD4)^5K2`f!{Dhqv**kGQ{MlY{Bd(U>Z4&UtP>FJNGz_37*ndrSNPPu=|
zx;<f89{NUft<GlQUG1C4f4loAdGz3m$A7=`a5ItLzk2xKKkk0M`FZk}|CBE`lg}P}
z^`8&#{`GH<lfON<_xa|-N6DT0pUbEBA3wbNmnV-OJbYvg-MI5eZoi@5-nsvu$>u-4
zdbs)MQS#tna`(%x?%kCZ|4#Lr`;YH#KH5mI2cCR>_x@iu5@{v5|KPDTbMNk#cOT2O
zj~{I4;}`Eu9(<8}x%u$3zsa9>{&M%;-N*l_5B=iq<NG}Diw6&_sXNJ6cOE{z``HsQ
zL6WbYJpAgxqs@f3{QT}CF-Gowx%v4m>4!W!+5C^q`;U`He-rI#{L<FagTLS3e8`*l
z*G~SjDZQnt50BJ${`~I4&Cee5a`Cs%WH6<p_cpAlM_+Azc31wA@!6DDyYuirH$uaY
zHviuza;1Eke17N4JAaioUAxRE$%K9O<l*L*ynzhOqbGlP^!V=MCyzIizdm^IxlX{N
z&4>SS_p{AMx08Dh9_au+d9)ci^!c5~ceD%A&KH_GCcppX$)meEn0N0#-hBA*$ybl>
zKDfUwE8y=kQqtQya{uQ#>JRSo=KWgQeDLr;X`XS>nb}DG{<lr}{2>Faqj!g4c_gFw
z*<*j1JX8iXyk30o<o@Pg@7?|D=Kaq$x#R&&{r&Ev&2^c`yN|fwu697yhdlU+jsO!V
z{R>m~#dwKt=v*gvzew(U{vUUFi*Sdmjz@RHa?)Y^>~CQn`l^?gthMkLQNaIw>(SkR
zZUTWy(<NWjWwPcj`#8zhhpRq&@Z|pEtxWHo`!G)$`K<TZnhSO)%%>cX&nAakVsh?n
z$w$2*{q?t2TD>UCG;6cGYoBZ+Syh)^*Q8CSe`KQKbw!%XA36Uvja<MtWtEpj*Olp$
z4QZk2>b!2ts*taeGB2{c%u|}nv$ANjwrXjvX!9n|<R1N|Yn!yF)3l(4yl%>_Y3nT2
z#}?99US%cM$wSkks)~j`s-kSWrmA^RR=0H}J<2OuNUD<C@-ElzwVfECMV|3T(WG);
zUhxf`OS4=$Oo!wJ+O$Zsjux_}F59|G%Zj&X^RkjBrS?aiS8dj%^e!*!POi+$PQS@=
zzND+thob6=tgRaz2QhcMs_6=SQXwC<UESzN7I~93ZBg-lS=;fbJhhReNN(D+I{bOj
zv|V1Mg}!ZCiUnQDS2_-P*~oBd?~1gQ(UQ^B7DVN4>RJYz$0l7}7I`VRaZ@hi-!+X5
ze_6?tb$O?6QDj9aGttyK7xG=&(MNr3ChB`v=GsEtm8JAA<C{VUqRLu*i>}Lg)xzeY
ztmS>XqSRNHIhW2?o!(T+kk(~py=$u)3!$(T)peDOxXndTNpEFn$}F@{6*6zSCcCO^
z^SaLHkPLpF%JR*%50$)Y(`ALeMJChQ)-pDgcD(Ln$);7NOMr1~Z1|a!R92EbsF1gi
z*6KXGg}kCHG8=vwokm_?`#|SPSvWSvc`l1N>#RfajI?VjUDa7DLsztEt&L}56_rhG
z!{5k=O56HJ*0!>S<O}|g$IFtG7q=B9qc3a9)<Y(*Cd*n@m0nl0Mbk+4Xj|r}${HI<
zmUxrOQfqZKWj7a@47kpw45_TpTDL+Wot7bMY8@dN)2yzWRF`hj%0BP%va)@V%NFWV
zUAr<~O~*RWZ6==<G9M~A@=C^77HrYkYHegU%Ij+%WOe1T016w2vdl%==-}ltOY%aE
z%7<LOXxpl+bz)MvsjM4Tp{xh#THB^F6xwmwXL(!Nc9hj2U*swu<PGXV)=*a2MolXb
zN~w)xl@+bD(xmzpSt?t-DGQTPGU+UTotQ3{{g>w2LdRwj*%<bw%)9I?l~GC8%JR?U
zt#tp$uIMm&bv9GEtIKp}6|yp9jLTBjLn4b`9-Qf7lUJomQkpZ8(peUGWy6XTD(X@v
zCadH+B#g<)u9dYR8%1YRrcz$7(D9P>zyfb=tIO(Exu$bb%UFqIt#u@&lO3B&`;e$4
ztSa3kA`N8*+E({{BC}Prtqp5ZF?rPV*7YDFxs%@NT!=6iVJJ(=#FB`}T%Kg&MkI`!
zEV|XRMs`xiZqOD)HcNvd0(DKw^X1S{SuH}RlC9YkHpZC<3mFX^6cN=3w#LSxkXLB)
z*7mT>k*x4ck13I4vT&-pwM8WIQoho8mhIZm)5=zqtZq5W<Zs<SE#kPcn@Sn3ys+IZ
z>s`*a%ubwA{;g#Ll%WMVSmcGPR<CQtUM<?P4Ch6eN!zxe8CY3+Ceme@$+M7N(n2cp
z)XCwba-@;1U9r%0O%@{Z5bU~RID<tzrgk2-98+y-E2<QUDXW^Bidw$R+FaLeBEnD_
zObcB^BDX5GkFIJtGIRDxkaDu?<S;8++dp|L_f^`Qi1xIS$<ci;kCi!Zy0AbweDg|o
z7SdfNFl)kAkfkhZPq$-HsW{AS_+>-NlCX`+TgalYK5%$Rr|bn~*QK(GD;w5Y4tqIO
zbgL(od?Dk4P!TCtGtott+L<L6)m@jFVxT%p*XXcTa$<<&)U_t6gmg5^?EsU7Tg&z`
zIax3(GHpS)%84%eL~3$Gc8Rp6QcgB>$G0Y<<bj<my}AxkPFAQa-O^4RxvVrPCr=Vh
zM?{uxbrE8+AVrSoH<hlT(ppHHie1+Q#YaXTX`yf1HliemY|=mE6i|t!Q!A&B><U{^
zA}3@E)nO6I6=hqQLL)1$5iKLro7g<1h;?0)(i{0oZql74ikqC?A}O^G=pU_2sXnO@
z)w6C3oeLRv=BQI4Am>hjIv92qCsQGVW^-1`3w9>U5|QR2<V0`L<<)f}&6*;-AI~j=
zj6%%GeCVc2M2`@eo9kwhMcAOlq&j#a$Yf;%g(j89v&L*TQ|W>z5qc=glB(rg$!)|%
zvk{4to9wA%+$v_!Mp6W0lNBbbWhK;=?06I7A|?wC1KsMfDQeIx)(6>u%$msuc_nFF
z=OU4_ut43hEhD2P&ox~~+7kt?RM9V&$YGz>T@m($Y!_7~^yKYCu9T&Yr0idLmZ|Bo
zYef#p)>5I;i25vF*@-Hfsw{?)l=&A$JJU5OGbkNxQaxluddbwtezsG+l|4}gMPC-4
zSO8sP@<CdY1K*S{(OG0Y@WLvQ<)G`Tuu)}oie^~V_8>NDt^>}_LK7@ha?5x%jjX6t
z=R!8E+#}mqWlzSzA#<i@ktlhk>^PIOGBM}{jR{u~eX{mUQ;|I;s<aHC$za(@X)pmW
zQ4puLv*e%@p(UzzIFw}#$PC(JJC5Gg#FB`#3K?M{PgGLg%SKXe7d5%iwJY04Bx~NN
zz@p==X!o|>Wu?e0SGgTOqBP0jT33Udlmp2|oI{>b)!7uGhA>inS$bBW80w0WQIk_$
z&Y;p(wJ3A4_A1>>B6?);g@aDIEW)+Xw@^7P3qW;MG-=Lg(~6PyGEt@JFf#o-*tBOk
zY-Hcnxryfv?J2i?FE1bmc4KcLGbRg4lsny7SX{E8R2>oVEZt2TJ5gmOP>~ut)kWJC
zMZ2_pA%ZZ)4$&1QdbvEUD(vv!#1lcT<IrYu%4DWgaV%zNW~NU{pG6rD#}s0qOl@jq
z?#*P<sV${(>27AHx-47{F&jzI3uGp$#-1d4p3IHCt&9PCPRE$1>l!sdB=b-qEQ5>^
zZ9tSSdqIo?S;@M)QFKLxG+nM@5adz%ezF4V0x@jXfeerc)TXtsM6(lpM`v9`jGQK&
zEe=s(OIfhN&XVEjm=PNX5t<Eg6<v992#O3;(TFA?=eVp{9TY@*ZUR{pHfc@l?$$Ih
zS&?FMs_9W+s}y;q7QXBzow8u~NyiH5yY8%{lLqA+%z}(c(d9Z@M52zgbvT)1h*|Na
zsVx}RvW7Z4lSOEw4D0Tu37IIfLuC9#1ZOJx<>W0e{PeLh=`wvHV)VR_%aEa6u=O&O
zMiB&d(23-(OY<IZ(lv4v1Suz~lGu#Hu9Y2Em~LM&fucs~dPrr{sb@ilU&c{P!qPUh
zbWVmjx8BuAR~5+W!4ONbu-%O%B?7uNy*g*_<V`qa8WC!Yw4JCOI*eJ((s4P1(PVW!
zh@?b~xAh>hqGPAoJd1e{JQy;p9oxcAURhD{zOqP7{}$6-R;wO?1&V|Sb=8jwl)=mv
z5eK>STDFRvdeXTX(Pn2n!Y8xcjpP%{BQ^I=-Qa2|>|hcDOdcAvK~|(}Z<8arv@V)u
zr$=B?tA-ntab~a*v8xujbevHx%?~3gRmIV+vzc;cid-;VPNYjC+ujshQFSvmq_!ac
zC-<0EjAKJ2N!^*pC#8YfOodAHrVbrIJ1!EmWvA$H$r={hr3zM(s0`{m(fuRqNruHX
zwAx?hZISIL=Z1_#kdvJEMQ+-lsCij`{xD}8h-ENRISCM>;fQGPo0!-w$(s!xEsk|D
zCL8OXY{nJ=V+tVJF50;+P}$#@@^%E4X!mUzP8>PpF=o{aL?X#Kpa!CB;YRma7e=VT
z=U3ZYh{nu!cIsuBbU?(d&L)Zl9y}cskx{Y{OyfrTmr2q|7XilrHMv;_vgPCzyEaHe
zIgVtiO<2hKLMt+%iPIyPA!60AlgcvK7fddWF>QfI)!`2jHU)NswJmy*Sc087Iz;8b
z5;AEoZzM{B$#gl$Ym`-;GuEN30GpVkM$)$7P>@Z=_6wdInJ^K5=86-sgMcq<lOuAt
z>bEwvviU^X>v<@)G}d`Iab!KqQpxPRV5`^Rgcezcxsj@b$?@sPsxk#$_O-Oo1RVzV
zlMH5SqC;e}Y!lOIYqTJ{P9BRqu5;^<NO2KZMVXuBE+S53xk(r{kEoG4D6%pTuBOY0
z=_u-CYqKeKki1-5hm#j|MixM4K7tyjT-yb2l9-V)1G>9q#8HB5qsnQ<@fBosi-0Ii
z5+&HNRqrU2O)EE<vr?>K>`gfi^bgrRBBbizMG?u>w051WaJHbW{tT#rNL|yTu(a`G
zYFE{<P^%HaiG%Gg%eM>1wHO$68V(tewK!H(+=yJmQ>62Z?L==)r)}^Sr+Hy3Pt+w*
z^G%15)m0&{g9(jms<tJbnTsb#`%cYT(>rs#GBQ!>x5DyAoim|=10FY#YByr6%8PeZ
zuyG0w|J+U-IbR!mO|~~>mp0_!>wz!NZ%yey&A<&)6(;3SKxO0Et8-+Eb)Z`veHiym
z9t3=jM7IH_dxh-;X(2;Nl(8|HE(6kb=K1GbliAJmh{%WtpnRF*OY|OKA+4P_gb2#2
z3rYv^2Xi^d#MFr3){G4~Zu2VGI2Haw^GqPCQxQ_B+1;{`kuXJ2A?1|8S8gY-99pQ>
zrdK0Do7OZ^nG1SdRd(RxeMrs3#318nYl0M)JH$$|J=fyM>^1XB-cB9XHsZ2n3iGYw
z9gu@O&CI_dBCkg0(=9A}y=hf9L64H1Dknp5pH>Aa6hR4<1twdoF~@O-THM(C$sx%r
znuk*?8hNPs8j0%4@3Lp?5JjBIoS9i8GPB?aF>xctUD=wghiZyo)J>P+auD&X%4LDN
zj$bpgGpm&T1Q&b-uutB@ysRB|O<M*9DMOl8X35BLTEPKfj$^Uab6Gs*>k<`>NQ=q`
zVo?oFs9@_An7n52h;&J@0<<}?Y2`iYCOA4|o{*dR7BVNYj59Mzl3c}gX0}jE8=YB;
zWvM&0u@hCyOEDi?J2!FNl#Tf*bmhv?(S$=(ti#|HkeSU8?`G@C+K{t9v)R<uFLM$4
zAP>Rlv27+YNo>mC$(Ez7N==W-WI?qY(ZS=*3#R7JMVY9uVS^fr;AzdphRK{(ZI_yS
z5J_A2nz^iRc?~g}Rj8C$R;{i)=~p8HqOiA+uHZf^%&--uMF!HW1I|>u+Gf1SI>ZSd
zPCePCB2jf}lTQ9^3hg+)7SZ3N^X8vSDy+}WG}nemqYSxjGfrADpepmwh{O`X9h8Kc
z;8Pv!Zdt5yMAW%CSUN1vyfgI_Z@26+dv$hjp=K@yPmP^Zm_CWIiC5A_JTFn4bnPPZ
zI5I3Mm!mv4X1f&RDkD%!Ta&V&WZ2E#6hptpL1M-Rp03(F-Xb(P2U0uD#0rx0TBDAv
z2LzF*&!wF!V%D@KxKWYu>(r)vl|;&d(IrO@_P<48Q2Rw(l;-h~!!$z(Y9B=ZFQ8j6
zw~h>g$XPo#MV{1nZf!ku1Vr0#$cPw6`iCHx2rf3Osc&+=SJH7ilW}jQ!3QE@TsGIB
z!-#q-b7SVdNLP$#TO4hgvC(Urbm^*Wp`e+kxEoq?er6(HWCBCHM}|jQ%q;pU8l?Q0
z>6*lIBpPmIkz$ciVz;NJLgK0trK&O$6Qxc%ZoZ8~-d4<Qvt3XO2-XDa0Cv(`J?IH8
ze0gyjNjbbqoUzuN9LOzZuO1#1(xIz^Mk+E^gi2w<FE1l&)y!866+C`wbmd%DSFP=f
zipWu;u4idMlqgxqt$OE~PEiFdl$Xff<4`sKD;pNSj-3OtE#w`8HwlC_(S*W|Gn5On
zaR^GuwB)UY@MWVm!N()hB^H#tanPf%po5FLL_H-`X-bud8gw|7;`nrA*Q*{yI7E#4
zus3CKi3rAqQb{D|eIwJPkCiiBw42iOs01en0#a8sesa+*f<8$Q4w0`To}<@w)>m1F
zIB?B3D2In^r__#>22Y2`lp@SUnX3u>#57mgsrnVFQ>vPtxdU6aY#Ut4j9#0WCRSpB
zRp`^<^v|>4@y6=!h_ai4+epXdJW|_5dMpE{j$>pLDv%uD=Hza1x0r#*OBDFlO>kFo
zXl5q8aABxN*R19adqRd<MS|#-I4(^2YSHF`eSznj@KJDxs8OE<Pfmr)59uAIsci@q
z>Y6Na#ad{`(eqnu)+ZKI%aAH2?J?u@Y}fJX5Qri0A_uDIK4u`YLJ<+>SCCgy#Uezb
zTC}`UUHY<yM7DJXSU{%BSOyQLoWdo6LY2Y1f~=D!M1thyWST3pH+6(evCB{d<)E?_
zY8A&8Ai&8kDnyqD4WuA?o*Uet&UHDMF9_G3D8H@!Q8yY2wI!a)ktYJjMzRFHQrZg=
z*_W$2Q$od9ltZ&NA8<#w6C8ytaTL#>1u^TQ^>x9k28y5y#(J&zmB!BQ3^$XEgL$$u
z6&<y;fLWv#t&T%WWY`QpF+&P;2s8I{T{Bq_Hwqoe%&UggjI+b+5P9ncr?Lrd8HS3#
zP0|7t$V1RKl?BlT{{t$bylRu#sutag{^)j;HBw7|Ef6QioIK3Dr*d+YEq?f}k4Du5
z56qZlr>7P+A;c&)aA#)`AtD)ZgAXNLhkeo7T*x94Ez67&bu-DK(3*f})!=8dBQPW8
zZcb@Ysc`95UGR9fVr(=P#}TtHqmM;6afq{PB#6-yX=X7Zc^m1fjEe0|W?i(wBKR?7
z6*YyeDA`7GS@=T)yzI!_7C+IsD$mVgWg<n*t4tcorbzMhm^%Z1Qf*E;QHeTrtJxpy
z=0=?i*m@``1ei_I7DUs7`$yhLbas_6(x_~i%z`?&&Sda{-#!t8ry@jZc2*6Brr&0w
z*vL83+MvixvH^pxTHwbC+Mt|ySSc1>;e?WdIGDMz59H!H9M?p_a&tY43WKO^`j~qG
z8p{@&oKsaAT+bPPDLHNpQ=p;d%nlEPdxj{o(;uXhsQPUX9VoGtd2%vBL9*h^n_e3X
zAjB^)<nw?WAg&}U+(K9xRyaC?O(2$*fk!Y1ur@7rAX^)RT!?_^+K|5krmY2DW_U8u
zU~&!yTh+jvN}EkZIWd2kjU?t>7J?oqeBiXSxke_a3x4~Ir66awi5pR`Qx3f*L?>~w
z7Ist7;UBS+2~7)RMQf4+&s1i{b&g|L?Pl|Vh;G6GX(3>-L3$h&zVNauEwqapMb?VB
z*3lm`oZe<Ni}EI2s53j`rEg^y;8q=B80p4fKVgZeUeI88RK0gGQ=dp@r=D25?4IBg
zLyE{Gn#WF*X`q98h{~#y;Yss8zKOr5)mKlNN_4@(piab)TlHU?aFvEz3yb6CkWp6P
z4JWS%ELnw>*%t-6L;y`-g@S9-^{(i&++v1`w2@csf+mLC4-y9O9s0XD&|C0rvZ2iX
zP>O~p>%fLf&XmT+*t`e1E=0Xf#7Ggmtci$OjDPI|ryBlEGskdyXxzi}Y69V+&D(bD
zT6L#}y(!DT(=%SiLC%*p3!oQ~s<P=jJN<L)XRHWwi;B`IYp=4A<PgAR^TgcW4FF72
zCdAZh@}dY45LsJkAG+z}G%Ol(#mVWfF=#XVaFG+@wnJ1_Yb8dtMZ|!@5Q{YoXMs=&
z8a&~)va4-kWHI3=vFJ*JO(+}6>@2YhQlLq;9%LyuRS>(fdzb*57*XY9-Ku#<s3pTz
zOY<H%Py>OqrNTj*n)_Q`qvJ+%HG-}ZUCNf1EE}TSY42q%RJ55siCjZB(CZp#u`Ei9
z`xM`Xq1bB005rBY<%pAEZJOZrNX1M>%$R5-Xi?|p{!UeRnKdkvEM3jZpigE16iXGZ
zI6<&aEWlQmoV@0l0Of?sHGnBoQ4p%43MVg-Q|VD@r(=cDo7rZfr=3Z0kh-$#8;kRn
z;3~-Z3VRa-psrAP61Z3y+JLK*F>Shlenebx%9zk>09cv+fL9tYRucfCVsExhaQ{@L
zVpwcYM2z8@Fg+0uXVX{&1ocBE(_$!v8lQ5+cKy_f94Xr{F@Wk!^z+toPWApMnd3Hq
zuSy~^RR}K^I5<TqGSMjQVH?|;lm}rso2+Kx%eiT1xBAn&07Fzz4lX={2(!K$iwS_$
zNY$%vXI9z~AS+D)1gItr>XT$;07dRiX#6AwDg_AF;+Qd?7`hkQgvoRw5tTV3<ix31
z8l54pfxNa&?=9<iDf2F3;ot``>sn4n@ZMzz4vRXHRc22EER)O3G?tx(Fbpe7jz2<3
z;U>{}ihlKLtU73#ILG81&kgmA1D&XQhzv@f5Y^@@!LieWV^GRchVO|g`faVQUR@9P
zHN?CNcDKT<OkplkPJya4C{V-f<>nZ|$tb%y4Qe{pT+_b=VW|#)x%Rcd;57GlQUPMG
zP3g#aBuF?z+!4DFq14CJWX@7^e#%V@YisBQk?xF3ZXwME^j>Ldr>xB!%b^I-No&H+
zZX`TM$P+W6iRGFnhgWD?3y+C0*2rkKwdoIquDmP{+F+xWf+<y?K08BJ0;;dTcbIEk
z4m^B8rcWx+vItIK@L9lkbq9)s!2q`2=|uP6V5f<K(%Pw46G}jZu+=X%eP&`8;aV}s
zW-0&@>r7Wo6wpyLU6A%NYtkh%2#B#`PwVifD6&oPvbL;%)(`>oloQ8J-je7V07V^S
zjp;NN{E`01Q?mfN1Rg4@yvKpyZfOnW#rX<6!h&F6ugP7o;m00m4D+7=g;CpEAB2po
zLp)1lUja15wynrqM3ePZP7=U2=JTu7+aExZa#&}I$_b}lrO20X*y6em&Ruq?oNfU}
zDsKREEubGOPJ7!Izzsy@vUpaG@FIW_d_lM^%nzf1XW3gp%2hZMdkqA0hcK@>H_-Wm
zg^!I&Y|wD@(ouGI&`4W+g>BHIP;H10>+Vi9v%><j1;GB^VF1*p1tVk@D~mdBY(?R4
z6BR2npIF<noH7HSiYf@G(fskazljvvuoie&GPARAORzS~HZD<jI}6N;swzik9x_=t
zNo4SwF3fXU;AOBrbc*Y;u!-0tV3TY%Yeg*?>KXHncxhqwri{HTWD$ASU*0}1k7wtn
zt?iSO?VpzA@u(LJOFX<i(6Imrs~BWZWxBzu8iU(3IC({UYqeQ;9M;nL;PNDYqBS)J
zSB!|Mq6*PnIV&x&O>jeIr_0(d#Gt@g)xj&7DgsP>O`;8e9?n8WhiD)o@GU|H#<c3v
zBE;fAM`Ea&FamLJaSy-^vNv*zUYByNBcTJhQYJw}vdw^qGMxWy@9!te#X?%7r2ywQ
zmo<V&)`bPTM8?%sz$^f3EV1eWXjKQ+a0Rm5H623NGACW#ncB|&L$@{`GusB|mpVg9
z$B_9oaZQ|GvtVrbstd|6z6EBMbgBv#f2*kbJiy=NkPR^?lv+|hEOMNx+Gc>hLJ_M#
z!b8*oe@$v`wzANOgyAO8?LqYgB!N7VlqMbU8V7M@vk6R7jKn-3H#rxI(jw6!RX8IJ
ztXUGID{Um@d$oxz_EO-ym!;Plvaur0YdcabSW!FLEPyR4j4ne}W9<;K4kHOhgDu)w
z3n{ur+RsH^)pY>na+1sPu(P}+R8r?bgCodF9z|GrvcR*D{(yH7aJaP~15#yXgw;S4
z(-6fXdq#142804D&{+gFY4HN5W+RHY!4(;T8>K?#dw(7{c-fE!JQveXUN;MvCPFPm
z2*lup?o5d%SPYA19W=NSyD-m-0RK%@yao&lX1)0<0k`8FvZJ#S+o3g^hutljAu(zl
z@e;VS2sCXjSFemYF%nJt6DvC)3BVu)n;=0=RBBJ{xTsiiScU{E&4=nNZ><IDBI{1Y
zO<~Yr!)51$V(P98i3kb-tIffPR6=&xp(E#vEDf6&nP^!JjYW55@Jl%)0uGJrp(1GA
z<PXSIwrh#{i=@cffUnIJ8EN)eg(I=HBq)RpX@|Cl$>||E#r(FMbCo%BG*Fyp0dXKA
zRGw0pIh56!;iIWes8tx$T^<r|h^(iEut7`AnO@Txkbh)H>UHMS3Xn3Ebz|uwNKCNA
zxfuu;t=2Y{4dc=bxfLX4W?>JD7DB$Gb*LiH-P(h2+KFNm@B$5wC8tc+WX0KQgNHA!
zMjJNQ9B-Q1YAryB7HL<6ysk{)_y&k5P&69L_rcdLBCj(q8$t6nFGD(v=<jV=1`I5i
z4p~Sxc<R&)VaP<5g&e<@Z6yO&;@&OIa#QDE@U`QFx5&0$mx8J{3rO+Vb#38ASzctc
zwU)$&BP_M(H8M&h5l|tsl}m(a-55%Q{FhoIu;kt17&E+-1$t!(g&aGeE~LEaQ7QAU
zAXwdI2;r`^7J#<M<}xF!L2?&WuLGi2%ZX~nAE<{iWRR)FQyK=ATtjr}5Jr*f#pVh2
z85R?MpI}`9Uo=Mw{#}`hB4i-~lf@o+qUszFnbfRpkp>m#N*+`al2=Qc^%@`!sejgj
ztS9EfM4l|wy0gqM76&0$n=|~2031TDK%?+5JMaPC6c(^X+h|Bb3(=dFFhko0AB${+
zyyzWkl|p$;{%LliIY<a@Xo6K5BC9z6b33NUDIrJ4oERF%)a(o($R*a01%n8Q$wtVk
z5J@9B)bw_<%4_qGfTqN=l7-|Sf`+-_%eqoQTUp5aB-CD;FB$_87?fea@Wz4#Hl?Z~
zW)#5q9gyL=F!YBg9dee{z2A@1CM&~}a8sn_eHO8p6VGief&`*P-YUfEJ2E$#keJey
z3TZaHK#SQ^n}n&vL{UKS6Z7wC1j!^V>D6RfnyL;KuM56aSq?H$L004NZ}I?*tTC?Z
zvKTx-4ROpqQM1M&WR@T?l)5t*Q^CQQ8K@8t1^c-Pr+<!5sy5dzII6TYwFO`!sd?rM
z73q=!GqB}VkO2_<nq-lp6q%)q8JJtB(2zLTL}qFc7OMmL4TZ7k+7S1UjfAJxLLwL}
znlZ1Bl}kWBnNP75O(H1%3P6=1Yl2^sB<#XeEC9AZ6zvEk0tIe7IN<1e8_XPnd|7GO
zPgx6ONw$`wUu#s-{NXHJ`Vf$t8R=d{Vc<&MwC-~SaEcPn3lRfCTqf8=k(Mnd0wW6>
zHSM~#57dgRX^UW=k+d$e*(cR&;)iv-VbfZ+4vu%#It)C(p$lB130~?P*N_=K1R>Kd
zWYV#{+s1M(bFc!S3@Q_b1c%BV<0eDN;cqV}#|V1ArJ?{}m2IQn;Q7MHRBKy|bxkiQ
z!oJ9W%h*wZ5RpH#u+1_w*RY6~bYS4tLd$6xas@gt|Dx1{SUss_7LXz~ESu0E5R7i6
zdAKTwu=mT_@B)dZ-4vEARghJRz_1`9*=eB1Y>9U`)@p+%5eSft61)!b!;stF<alh&
z`IX2XBi$;%prw~3?&L76D6Uz^(o0z^mXLu<gbZ!lB%RVAn1v#Oxx+9I=LJc(IB!iW
zmIdE6<_SaKl3Q7XWEL@OTMHkE`q!};4cH?~ywL+Y_*Qdu<y$zS1P5<IC1LCpbE*e<
z&C+d}9&DS5?$m~nl+{HT-s~(iL6NN?owm|QpTSl%Y~R_zRFiRG>DA!$K@VF_Z=xy@
z`E!QY0Y+OIC{2T@U0GP<So+hFn4E<OGbpLXd`<W{7zr~<MC~a85-~%A5d$sgsv;+I
z9IqxP)pE3aVZ=d(5Vi;lahJ^UJ^`_y`k28}ld4#y!Ag>?Ao8LPab)vy2MP#{2AOgx
z>sA#pJ8@bRPw8I3xS@>XmcX1rgpdXACHex1&3T{Yp907;XBFue1jg+2Z}20x7J2MY
z6`M97cF-*AHsB_(8AQOCo2N)MIveu3fEpD6{?@2eN`nU#lu8zi^$vYL4{31ZvC7aE
zAwJ9in{Q6@A~EC3Kmmatq3!ecI7tGBhp40-QI$RuNDRRu*xkxwlBa#_vc&^!x#{c-
zC_yZ%yM{lZGW{X=8_k_6(?}wfv8E(I#VUfWwkAna@2cS2z;NlxfWrm)B+J2Gy~Y7*
zS`Y#WN{#^E=~#t<c_PDl#UXAoil9zz@gK#l6CgD2C83w#Ur`LKsLSR%&Z*F5{#cdO
z9dRPtwwyNTJLW#4M})ccxUQkAD6Bbr`eoUsA^#PON7`8ng+_DJ;7%opO$1AAOFS1F
zDi|BMUNZ2z7XRTG33fL?AyGNZMJao;Rv~T%4@ySSr-6{{+vZv51G(B+pi%&riZvVv
zFCZ(h_!dT1t*#V1H#xMbAgc>a0ya2<hz><QwLz8<K{Ao26UI?uhXUL&O;Ls@7EBmf
zYYw+cxjoWgUsRw9a`Q*!03!{YM+}NYtlI2N!hscboaxnwhcuw+z;WQYHIxrIgJl!q
z9)z^gJZQxw5LlQSY!QLt4+kCXiS)6EqO7h;#HQi&@iCW0?|<NPV0(tpz~IV*m88KS
zQLIBm1S8yVRhfEx@}O6PWyK?w4~e@)uhUi}uF276t5s7+&2>+T4=Rb}ZD`y>Z2yqZ
zj&{`8637)(7GhAc>(z7*$!>C(717R;y;&2b(e*$yqs{D(CRHOpK#+;&RaH3JYTO{f
z-=C`%TU$&YKsh-yruYC&z^V%_eqsWKCjzgkVA5{D3!o61FGyYx!V(*=7XPc^YemI`
zn568<b{NbeWT#;f5UdU8Yw&93YQ%^EUlurPI${x}5jf;T;EhKKy}Bj9Yha56&AAAi
zCk6Nd2n52ah9f9Yo*;y9DTi|th-1+^7C_Jz7G?lKDVAhj4mmVP0YhwqIS^rFZz0A6
z@Lx-!CL4(ui)Ay*W~c&f2WuRoAg~<(&P%Hx?M;|kQXEi30=;S&<?0q_ihvC-K~?qP
zQ=A}KW;!hie^uFgatQy(`cnOygPh~moOHOuz}*|-N(nqd)B+Q_;7m4kzOM7E51wge
zdObMM$uLX<<VVqmxn+ha%&+XaK(f#&%TP$8>eL1cDl+S}3wT3B1(E+AyCM4^GlrfF
z?HJ++^PROoT}@bMZnMY)bJEGKz*%ql1Fv3c@{P(7;38FN{yS3q)535eBsY>vmxt6$
zd;)!z9*A@Togw*$VK!tI7$$Uv!t@8yT1(>xQ85BRNbpxnTMAIo{euT2HA#y)lqr9Y
z2{!b6v&fSgr*EHgNh(H)9I?RzW-bSL$UQ~tuz*8?x`63nMuZ4g1?ZVpj7b@setPs~
z!Q;*HD)3Gi7z<7-g08wA3jCEtka8ra<0K2AFA(x(Dqz>*aIj2iY%%yR42&xCpXXT?
z(B;xx6F`b$+2U|3Emlv?MJnfi0Oe|aa7bm%)Ei|dFR8=wmu<R4fv8y;pdbj|Cbd_>
z>C}>Ftmk0{l(%ey7DTX0#7anMQy*E@&nCdCfc;d?C=(VqAY?xl!R7^LiJE37uUsjo
zQ(%4*Z9=R{v#0e$M=!Iju2|kM7i0;Eq_)|_Q&=_TThB>N$22l;ncAM}U`DB`arOsZ
zIvlz<-7L?gBE2c>VZ!P7pzN`%v#Jgfl;z)rT%t^iR<<FJ2S+p+$d;M}<P<lgJ{Ic>
z00J$bWMH#&VP`d(UJ>vkr8-tk6(Fk7Sq7~NO*|Urw}*_ON<%&qa4P@^0b)b^sj33(
zAB(pQR5D<dOr2NiB<z7SSSU5wlvN;l=vZzcr43g$R-NgzU?Al<x0l5kL@?A&oLswI
zn*Javi&9EGF}w{??!wd-;y_t&%8+4NSG`Y+6lFPT&B8A;<#{kkD;j#MECM=0cu2E6
z59uA1^5lgU@SbIc=O<oQcD?D?VV|U}VZLSLTD|azg+uDji1LsRq}t}WITpyGD$@{4
zBJ_+ZYZM7^(*%kOL}{&%r{Eh@Gs{9)s*0!P=}k(U45a}Wa&_2NX-LQwjYBlHG-O>A
zDCtHE2zOwOyUc>cu&fo92}GIzXcE(IL?=K+GkY`B9RI>t*AjKQS7G(5;Ri#DjSvna
zbL%9;ePnanxk-FLBwf(?YMhC69*lLA?>aauMSvpo3Og@a1(8{V6p9g`|E357^T84c
z3GFQgnR(q6CsBvIHGF=R`HwUw8!%9x@`Y!&38`uY8IE}!(4&gnNCPB>yw;+$tnNfs
zKPsrbAWV2by>0D^U`0%to=7044LP_Z3s+rgJ`i9cWgc8FvJ((rA!(MAiM3{KQEau+
zyd!Xvkux3;DBu+kKb99+sKeO=8yQAf7VJ&=ibJIindOi{<ymN<!#5Qe2{K&pmElx1
zMpySqpq=JRwtc1(zSF=&Qt0th8~zl<6Ee=++}|CJr$B%LkgYUwqJ%u{6l{svdX0jJ
z3{ajacT(MiWY~&eVAZFpaa4wkYB^U3Nwz^7gsrDDRg;kf_NvAP2(=n)a=%F$Wj52L
zD`VMIeXO~KL5;Yft{aA^3sG9lyeR@rBx$4>29TX*B_6F_(gHfIO$uaW5uiPprjqIL
zW6nHHtbkX{j(8;`=+R-o-BOD+v(y@RPYhDlqE#7(sEQ{{!79iH<#n<(i8i6>F;7%m
zO4T!AYC5s-uIRH$ASg3Ju$(AUTI#MvpR60j5*mtDc~wh2$e|4ZJ#B|5M1(LsSj1f3
zo7`)g%^Go>na><wHLV0m+f+<?VBS$f)-vBX5jp~hA%hlXh01`&uw~V_r0kVQXqS`9
zk{3uTZdzNdkn4&55wg?pFV}64zd~~=EKr|-%nwokcW0}<IK$~<U}S+$rBM3F!Ymm=
z52*eoCkdOOw^-z}<v<ROP(V>#8?p^VqT$an;B2DVc%mi;M?eec!g5FOFK4B_1q6sy
zW2|}Vf53TG2MlaR7ENpHdKvEO+~QPdd5Wz!DaS!u^_gLitl@VwumFV+aQc|6?r^YJ
z2&*8wI#9<Iz;4sBs{^*HF&aPHn}o(nqeju3iLNm@Df&aETi^6*+#`l32aD3kSxqcW
zU!BNESp-B9jAvz!`U0NY<~@IgvSkJd(_-7@bpWu)4rWYDse;@kHU2@FTA*yT?JR7)
zG7I)*3HJz=hvmT$D61{eELTu;0QVE%15%rX#DPMS4-7?19I5KcfFB}O*)~mZR+fq@
zF=>x8E=|MfkNZ5&E$afvBN+=porhBi<xb};CC#=D`(6&OuC9wdV1!B=5ELDW_mzny
zFkU(5y@f;2Z)B?&)(_NQ+th(pAtmS-EH$J9Y2#+**6Q+W3?Be1O;?1x&x|yQs;6Hd
z$0ZB=I(ey9NE(hxva15@LXJlzsWU*6XszrrbH0_ttIIano5Wd2vC<)e<4IHjLm+|8
zFU{GX!!RhXk%p}9w&|)Ypht6_T9tuvi!AuY_ynXi;&OEe-6$zpNCN@z+NHI5dI`s)
z3kITA@b-jNY(taJ))Zlh*SxC17lCzW1|3v9GWJ(+ZlGV`vNK<hl4O)2^`Io1##~17
z+V~Iycc!woK~btpfUSV&w-ZOMlcOn+pTfYGS@1jKqLO%cu)CqLDh-4Nv499&JMc+m
zsR%aeiefSJUc(ZvL|z6g3IIX*+aSmth|11<1R{|%q8JDc<ZOfnCxi*{dgW!$r$WNN
z;fKf?;aCoI9PlaUd2m|5^VI~8U9BW?wVgOfZq!ZlCecz}H6i5{H;25Jp*R|)|1mda
ztK8I0uz5+h0#gu1oNTK!B*n>k7cC)Bd6ybGGu0O%m-qha1S)B`hz;&3(iF0Y9vDmr
z-ZnH|lPb$X#sk`=$TqW3P_NQDsCgBzQqC!T3lK<EmxqiF9L0ghlr$Hb47ecVX%Cqs
zlbeC*c|<g!!W?A8wsNDWg{%o+kJ&iVafk^`0fcm{<}?o}&{d&4jkW|}9S>+?qA|+w
zYc0t5L+`0u2KAv1F%+_~<wUh%O~?hT+bTE$l%BZ_*@`(tZH*ys64GZ#3^uWwYqm&X
z!A^2sp)k?el!?G->Vj4*=UEjp0?7KnV;0=QpoY`lj88#x1!fwYl~v#>$kp3igbX<{
z7sU26dRSRaB1nS3LLG(n&YZRo)-(fKGs&vvTT-1*Gb7D`L>#lS7DT8Zx^fGCxAdm1
z111MOUlB1T4T<>{c6fjfC2nhHawUU;BVVPQaWZEC^{4D&Mp&yU-W+Z^{27Xb?P1`G
zm8Mq*D@j&()|lr%Y4Mhorlcu(eG!fbR0iUG<{Km}47jHqU>c4LJjWU?sseQ%N4F-!
z+E&-Rh!99nc9xI}fj))$78rUeL~<LL=Shf{!`HCWxD@L?vm6YTQZv}WgxD^EUR|sE
z%|MB;i-6EDDj8m{Zta*NZ$oJt0>oNV5(B$Gp>rnC0K++c)h6inD%gz7lanpu{IH1u
zcqqn06Z$~-z`V@>cW{yhWS+tS4B5@nfFZ|HFfzpugnR|KYeeHU1Vy3zot+`!mBxjH
zbc4R-Shcx1-=O}%wbSzqL1~!<ilq)GR>*?KqU?&+<Rs8Q5f63*f^I9To_$k^4T~~R
z>Hs25b0cO)K`R4!BLNl7n=y|a$kncHLT)<T=c%PIp{<fFXw0~nOT;D&iJB@Kkl{cY
z4Mnvf&kshwG>kZ}sw8|CK7yvVwkS*ju`5nQ%WEYNZiEEtT}+YUA?LEt9GZ~gjYXF>
z0a4Qss}H2D%oY&SEQ|w*ks&V<)eY2`Jr)#OXX&P#9t7V)HWH4@GH{vXN`wigo(Uf)
zIJzzXQ#!Ej!T(yr%xR=U(qZ7txp6*ainh)}J|Lt=oF>|Fz!X_l20k`GAdSUXA%ZS-
z#oJuSUhM))Cm;^8s)9DyLS!G9vq{v+IdXKzARD@>2w8fa+9ZKV9RzX_$TYB@s(#nv
z&45q9JQEO<bb)^hb0deYrI*#B{~8q1=umoZI+^Wh5wsihaLxA6J`~`%+a~m(fq^Ap
zI6)wR5;D)FvO$@@O>y~Hx7I?b<V42wMXVH5cHmS*=ctT#PgH3R|Jvpm8UuO5V4=WB
zRn@sgf=Zk}JpmNjjOb1w)c}q&Gqshh0^))^U>DiXoxQr|U85?5$XN%uo$+@fx3Npi
zBvhWlKC2tnoH~>(K@DQ!&CC_8n)Gc`0Aa~ZNn6sl=-`+u+rV~E0S&LsSHjstc0hQG
ziZqiVprb)(cXqUu#Esjg?DJQ^Kv@Pyg4zjlrA3rUR;?^knou#iPHK2sl;u3=QB+k?
zB)oZ1AjRzI7uZX<<ZU*Iy5~*cIwCk-6^3;Ovku`wpf5oy&uo+Akf=9-H-bFWhEqmu
z7kmk+k*26-PG(*=Fm({#GW%Q;S<`?`N=a`@yRgl`%XPu#g)gRTLl%x4no4WZ<L$ws
z1TuZJrXdlcE%CGGJ-;uTGsG5i1w)jEyitC0^`t#fYnYVYwhKuXfKQvobQn@J@aqTO
z2<2)?LjtoV&xMR}5~V7uMUjw$N?5I0p2t&{3-x&9qxn3ZfB%1<tVyewp_+{e;6`RK
zUEfIfiii;OI<@lJ778X^->};f4Z4YWAqt5IUoFTOZX<*W9;Vim$`ZPVe7Fq?6^zVW
z$yXFk-9HV~20ZUbVpK3Op!?e>HGuPt=yR7UBU#bkCYxOZ7R1k_YZ3pghNo$i0aXf=
zIf<xk*53v~P&uJ6`f4SQh))9=S%I7*MG_Bq|1^RQ=>Ozv5xzmIA8rHcfO#oLH5rw7
zBm3JRqs`DE8?rm)G)TMQwn|MqBnjO19OA=BqTq|_i*T#>Ru265G|i+D!IZX2z#^~N
zzgwvxCiHf^2E;G2;kHJhDUH^7P!`~{zl{@LF)bXKN=Z@1kp#4a0~22>0JW+cMpEMd
zsbL~BtrrlVhNRT!DmrqfY<vA}s;{QRnLDu8v@$%6GY<A46s$}=2*Y$MUp3DM?W`2J
z!<v*Qi{xvS38Yl=l)M?Hn;adj(?g5~B8MWbNuXgs88a*PB99(AnJay}^k0!bL}}e^
zc$ZQz<q%CGxciYLs}X+=kR8ro=~f&Pe3>nooyPtohe3Z^1^IHSf#nwCRdlB~BoLIh
zN;m`Y6i}XF<A_YtKwYa;g2X9?r=?)Cw5}4$T@AWqxD97})oRTa$X>H5bt5TCiR=PS
zT!fGeLw_4409k~@Ku{25N4lqxX@Vp{{^N)4hT8yokYwKh9BS|!M_JOKOlPEmD*t{v
z2nCiKQDE6}5X$oY@!d>I&Vj{3#b31XX<+P?X)6Uqjgg<n+aRAnWRo06g2J#$017J=
zN(-fI&CYZqSt<PuDWxUMt@W^!Vd7wHJK`VI3X$_PPInD3L&306ssY*^HV)^m9Fw9Y
zp_!uP4?_Y)0KQqG;j-4@Wgmt_);FpiFbrs%MPkR@jeiT>QN4#amWJCvyws2;!88Jx
zuZ~a4)P@G!02H4%+At)Q!p=Fb)M+TM63>7{15v0LFgKG`KkNW(Mu?T+^TOFtrg6U|
z(D_xY0OE#}`WS=)=<E_*0K^rM_o{Pi61k7YmMI;KtjuBFVEux&JcFx-aD9{|D6|-h
zAj~<?>SowD75OD8G3Ly;c)Qe%q#}vo!s--18z+F^a9t^T2#LC0mH;`1!yO!;dObuY
z4kKA;?FK~$P<||RYmzu`1=TrpO{iaG6nI36<QA;TPR+?U-5G`|6%;Zh9Fch)Zc7@q
zTfp7O{hVa+=qQvkPfr}uEb(g$X8?Y1CKZfntv>g-CIJ#<>U-t{1P(jw05K@21c!4E
zM@{PFBosQ0@{*E;(&3C9o|cpA0eK%r2!QG+@BkTU07XE$zviF}O9rAQ8#-CA@9`Lt
z>eDI%bv&p_AZ4mQ7>iLA&u&WQR7xWP@l)zLnL)>_HZ8eH<e9X?AzYJ$R8z_f3<c*^
zoNh3P)aya(mWA8uUJOG5Au1|?vSNd?iW>((hn*`OMSQ`E5Z{dynU3TEW!|j3IwSfG
z{t=+dNQWlM5{)3{N)plny%H-tF0Q&$N#EgO2d2{Yx54?WTs)9%As<?I<dfuQ6;*VU
zVLKU4Q}VUtt_~+Y`2MEy6JQ`SlAa2_Du>-oZj16|zyd*RG>Rat&;tx1Cp{2;z+ogc
zA(nJuHO%48it|Qn2a!u?M@i%IVct+;Fwoc+FqE{-psLB{fQ_2un3hCbreHW0VYy@3
zQH_oasHk%#S|C7kOew5T$+0!)%H(YTS5i^{-0`W~Z}8?TEdX#u()@-YK~8ANgchy|
z`V)6Rt7)Y~Ao0W@W`<6pD(Hq+W^Y1=gPgP)2V|BJ`oh8*6nePrbFIC?0iMB*8l|$T
zirD`ZYaAuFjcbzRW2kpi)IjM-Jl`@fAsVbNNCKkp+OW7l*=uSldBV!G6(>N>E_^nm
zp^)Pwo5aZybL%%4n51+^sVtq=0+%q`kz*;k_An&i#pLWDJucPs>L`MEGx+yYg(kOt
z2b8MplP{xmrGRN-Cl%i<`X`+vfYuG21o1>MKh_5oW>U9t6hPikvz}9em{}S{kfB~0
zLg#8g=WYVffQTyqXCn+g2!%>hI;gIw?A4I{J52%Eq6tM6RmX}b6q-WUMgc7fVCJTA
zBT29cKuN8IO3=ZF2}sqmM#!ENWy<@xHA${HDr3$Oj<appICvEJT*0lR-^J;!)j)%f
zfT$aEro#@XAvZv8LZt_p-o(X~5~FGm$sESi7V3r}L5S;lg8>TKE{a#Ui5im5NWFz0
zu#L)-GLl2Eo8ykJy-5pwEodq@9LXW+>cM<y8f6YGu|O+;*L8e1$}y@ltfp!bGdw&E
zg{#n%AaxF+u|;)8&cYTqF-9CDSJ7Hz9cH<n-<o(P?Z-}%(pM?=0KY*QRqTxLoRXEY
z=2GHKPE{+lhHb8jDt@3Y8e*s;1i&jbtVwu^nmLjOSE~|E5&0ZM5Gf&;rp6^oG1Dl_
zk&rN1U?3=vI31=NH<-c+Qf&R&l)t`{8I@TYEpL|*mMNnBhWB1;A)p#+joi4n2y{cU
zLSzv&w{7CP5uQW0)9nA;`4kdZLX>3{8uCs{n+$7`WD<qc!Va$7EY4U#!^{Ew<8tnt
z2O}ffMPt;k9f~DZmu?4;JgmDI>%7j>D1x-cuB=y9odz!o_q32+2xWon?yek8oKk6N
z0j`Lk$AqZ-8PMtZEZ@Q}#sLzYIvA`aWj3`wP%|>bN-DPjWyHS#`|)rH6CEV8kXb_#
zIpwL+oyaCs$4}}69>a@2Bvm^Z7oGD3F%~d-st#8XF&QSHQhWeque7LQ9ao7~Jq4kz
z@J*6S%IMS~Q={O0f#&jT|1@NKrS#e@7_GQUGFYGBPbSe=mbu6puV4^ruTa!b`^z@E
z#{iR1Xb4>{>p&pKA<1>WSE%P8&1LHk8;8_gm|h?dgr(Ohy`-IxG_3jBR6LExVu|p9
zBNd!KoYh%;8Zes_zVcdYO94KJX8<uK7^o?#1&kp+jkH)T*ja0kUiujqmj?PZWeao$
zs9FDROnGUQjum_`h*$jo;O<jM=XG-9yOos&vfw|<Er)hABpIdyg=V$-Ry+d=LNU;c
z<M$z8GptE0CQkZR>uc25u+GZQltC9W46f<g+1-?M&{ZyKYN{(N4hh8$6-A4zM6N|+
zg$l8i8Wt@$)*^45<O1M>RR>0?C0%tm@+k*GhAFA7&}dff#DO~qkN|I}wYi6-4E45_
z3Ipwd>op2I4oqd$!30uCJB%c&fQVjel`X(5#7^QMRa*t7c1pC?gD|JGK(57$a1gY>
z$fKMjWv&Kx2I&PGXAtHMFh(34n05t)Z=7b10)PUD@=~hw7$%_9ngXpR#E?7T_8Sp*
z4grdy^8e0<M+ySwR|WSzb-;WlwNN_MNlEi0Nhn&2x%vewUC*hy-s01!gd*=w@nwd(
zETiWMo&Zi8j25t5Ra_-_qd{VVH2`1foN*}lRjvhFN+o)Bk_(DmI0cEm!9G$umn~m3
zN<K;$L~e8bk_?x53wEQy(N{-@72A-)z&H&Q*U+|ZB&qzPt|xWdWNFm!2u%^JZ#69)
zV574ZF=nZnthA6sp`&*O%T!CscQD|l(SAb>CffouK&$ei9fUb*atWwM>maKu)hYC3
zJyH;Zax#=NkNPBFz>LBM5TYO;ykA)kXWkd~11o0Ztd5*hzaj`lEyrjYDPM=OQPrxE
ziTsMIgq#ubhj6f>Q#-#hc_b8eqg-iOD}B+hyDKe8-RX&BnLly53uTu;tF3^Xrt!8E
zyhjW5M%gK0x3{}d$sx-ul;Dc|k)e}~VX*KAq5{@VGe;Fq6%kw@)d@aD$9}H0plh6N
zq@A}>Dx=D3HDP?LSVQrABQcc0#ENc|PtiF(@S#FPgX+lPAL9YITWgqYDSyK@Xrl-!
zl;jkYoTk1~d?h*>q3>={4zUg81c@gORmO^1ZT5~rTWvec8|k!YaVc&Bg1%*(fK+kh
zI2*NUOs27d{tUn%%C%%4aF4=yXNW$bY;o`a0c#uQW+Ce&Ro^OD+`4oTF{&GqR!bft
z%4HO<oGM_V$eJNTrfK5tCSkT##}g+YoViiwB3Rl%0Z*ce$b_gVAn3u3DP19+n=0<^
z6c1xcg{>MzGjr2TLFz&QJb;JQxb5N&pb7=MP>ZPIA9E9+RgY4fJ?ghjqr(cjSda8h
z6MRZ1%+*B%y%x+Etd$sjD3lCK%h(kP)pM>0><m(SWP`S(|D@40BAkU29Xc*xGNp5C
zDpjIr%C-8QQAL~BNqm-Vr`|Cbp`FhhT07~t;&*agmxB`(?S@oJIadnw%sk#k+!3pr
zU^%&sslN^86=+3?;Z$1cCvH<zhz4AQmVSc0G+I;*eW&s}i%UdH97$s6X!t-*A(e8m
z4(KZzEf)sSht`XZMyC4Gpk9V-pM4OuATk6}ELLFq6b5&4vcdPuK=W>$3HtCfWqKuy
ziyww`0B65}7NmF(b)po;Hk{p}Yo><aCx#$Oi_?N2!@;U*QsuP+kUTsM5+s~UG8VWF
zWu-)Y5*AT(@KSAZppnBi&B?b>dSEIS=3bu!H3{&vBODAnkqeQOP`<Hf;ZLPDwLfu?
zjY^S9;GGKK!{X}LZiK+qy8*z+Y35C%@ju1V!?YX22+%dxn&VRe8fd)v(2|uxxpipW
zaYqkJxioeVf}(KE0Ud}U2>l-M-)a5@(k-fLy7y7#AQ(l``ZY-w8U{JOH(Z}_B<V_q
z-9*7&*_bYHU4aKe=2coDqln_Q1i-DOqF|cFFXUxOtFuM81s3;i@Xin_AXSBGE@*5b
zl-&*>7!Fx%3NQ&8$HAl}=+43;6${q#)>*;{aYK@wKm-9pjW!O=P>z|xf>4~4bsQ3y
zP{4KI4X&XLk5)eZBRu7d1!3O2ipL`DL-kY@ng%4MTnv$LfRRv)`&%Qnv6C6bR7t`o
z`CBazqhXa48jVmEk%De!Zg*3*kZdM+h6=m~!;pY}MH>bQ+-XVl+{sDMfEDB+VD&k*
zh8;iwZ{(6yNzHxu$832dBwMtk%+;_1S}lP9xErgz%w3F1b)yF3k`4lJj{>h`%@K^L
zu`vN;#Cb!1rmQLM1}(}otVzPb)N?=wr5CE{432#gX9|3*U|_N5qa6S;ilSby!zsSl
z33KX?Xu$%w@kv~W%99lj13L(pPg_KFM!H8nK4&pGtVqQ;-7wA+T2>9mPM*c{O)00y
zj)kRB^Xp@@4}Ur?Zi>EBYoU&vgii&vk9YxVtczZ3&@CKnxVI6@-lEDe^GmI?r4_%j
zsNwMl{HF-14%zJvD)tM+>}=~C*km2`Niu^J0Sng`Ohc)gx0a#?<o0qR0ojd9Ia8Kj
z`VMSB{x5DEFi~1pnUHs5vG6_~&}kVJG)W~mabW~<B&j2Xl0fcL)5UlIq!Z--E7Av?
zjEm#ooQJBWq23;Nis&8#b;-$2+8s{y!r3?ok`hQZ)%Jiir*XO|?kdNJx>4}%J9P&3
zewa<k*3qIXLnldjm9+rA3LcR(cd^A(sr)+#?_^i1#Xrm&xCp9@APtELcg_`|Y;2_(
zaA~HqH0-xr^=etk;2)@r;iI&LdXbDcsHRzG_N7FxVAE<fYbGwP1{fNaVhgXH@;VNt
z5tLSdlGVloFYhDJq_-DZ9}!ZzG759bbHjg>bK0i_#GJKQRGQyha%!Sm#v?z$>a4Wr
zMO7>4I*K5&3gIoMj-D1LDB_7zDWi{;O`;fa-8jWC)ry8t<v_Iy#x=%q;2F;#*da22
zi$C6`;lWxHU*S=!hj;+TA{Hk0m~>I=3dG$_v93(LD4cXeOX3cIm;tH_STBgx#Ek>(
z9-=c<RYUc|!480v8IIRh?W3-8Ytjmyn(hJa&H;RCtt@UeoMca;COMx1UT3UV3~3+|
zgDe5p2}&GC9njR)so3-yniZJinT$G%78O;JFyKlh0WZ|O*Pl2U%C5*5&S+RH;%TZd
zodUEC2t|^SJe~^-0#trbhH~(`gR0U43RdGxW0uab520}d<OITw(m4m9GhuI2cr;U>
zxAQ!aUq->_f~b&@X$?9T<s|?F=Nz1hJ9evt(t9n&vLY?&HhK&@`~|?MQ`S&bICX}g
z9I4FUcgXEe<B^Y*TxIG2!=l1R>pEEw_USZp3@2+>#r*~qC-@RgDHGx5JQ(;@5m5NK
z@IuA?X2q;9z*5o~rOlDj3(dT`v?z_<Hl^F$V8;rIk-)Oy^b$x=Ae1CtM1DQ7!eJ?=
zDy)eHQV)@H!ugdm_-<HZutwGq@sa4M*lPZ!)~{>aZJZ?<Pwg^QHM<yn(2xTHw2{GL
z?fD=f{3&Evc3OlWjS*<w_ar!y(51}X&i9&878dpwSXxRFAYwd#Uf?$FRN{fYj~X7O
z)?2MpTPf@)ui{dM*AyiK7Z)L*xC6i!69p_Ss7<_P(C~;;B5yISVUTgcoTC9Yc_nFA
zF1L7eP-~Rnwahf+i?ut1)hz?h2j&m_6){Li^+Zjo*Xp;x-JGUCwlI-jSxC7?d50rk
zD@;P2L~<}jUg3aQ8HD@{SjYK5*|TWl0GA~|jX6vl#Cc~rNLaALD&u(WqHS6!QYck&
zI9%YF^Qw`mr2MuNcZMA@0wJN3MRnkGz{ga%LztplL<eCzfE6<zb^uT<WnP5y0S~N?
zzoiQ7fW#U>!b%#B4!l>XmdB#xW}3zGEvYaS$;klcW5rj7jngXEDDJMBtN{nR1P4sf
z%#Nf^oc~$jK%QC}4^07I3B^g`iBnQ!K*J^#{+A*;tXjBk<l0hMP7r>X6Xu-)Gf?Ir
zh$-T{AwuLZ2QSf4T+HDVl*&J)E+2;#V5J!C(<)s|8*o7wlO0m0RIV8O_Uu$rMxwuj
zJcgV&CW#!_I4<0pY5`%Y$Pt+7+97HL?n)URiHsre8>e7kj%vyQsYZnY0)|fF!AgOg
zKy!_AJ$6#**g4>^;v4eqha*4LN@&nxE5mT>pow5-;DwXXfQJ!4@vusOe1P@BOsp{)
zo!N)GOiKk(0EU=gJOdz>)5D<&NaBbbAbdlZkW2)E^?-l|T^ZuKT(iv4&PNb{s?}08
z9VdZCoa?x|!CBLtmMUx*3hwMyGNDq#Y_+;&<8;#jWwEA$Ac;?LNFeL2T64alNY_Qg
z&M0e_SokC^;@@#v5V%hK_Dzm*NJ$g71ISh*iB%>SzP;K7KvOFqP-;<iD)bK1-6*9#
zP$$h~#Ov?o4Vo4*ssUh<3=rjH$<eK_1FIJ6z1TRbM5<D9x=`SE1XTlJVT)7aftZbp
z372}FfOaoZMJ-3jO$K_8!edm0L2oae)d8GWbD>yBT0?u7?ouUE3b$O1Jyyl(CXGT1
zoHvRN%_4F@EGj@My6>r$F+z`VloYso@L$7K7&Sa9fD<*Upg6<nR(f5T5ObF)r-uTq
z98d(+s4)tDQaBufm|L1s>G;9aPz7KxX=@^HU8?$11ASCfXIf1X!}S8QX@NyByqiLa
zlvo*Vup)J`q{UVu(n<y|9>*9FBk0JMrdT!Wp^fhbDv!!|;QB=5!R0rsNv-{$?CqqC
z5txjt1k_JvNC`H66C*1LWz1VVg*d=q-*q8LymU}(!3ROwR+h&=TFDZoU;#XFfUlhw
z8=?;&=Hy$nXrvM1Mn($6PNh{`?>eV*Y1uPaBw;}T78Nz~25%p377S4sLgH=EI-&2A
z7o;kB9wz|Ao;ntAS(954mvW}0${FEs^hO>%Y*Q-cV2vvupR5U|hRQQI6Vxuj8P*k1
zRjY|WljMS#2|6ot`wiwL=+oJ9go&a%nxKDUSv9zkiqyl2NCPIMRcVTJ6`>o@I#LJ<
zZ6DZZ>)^5wN~i}?*}4I^M(90S1q)RzZ=gR;oq^URQ=|tZa#=)cCUvHCXfP|IptB9)
zeuFffb6e4ZWgaD$^0?M)4uC9pX<Y6DnpkN;YuwZ#1R^j?oq{mWVNf=>s^b}e--W1l
zrZI9@iH3PANN<p?k$$0!($%PwkVaIfakWPL;~@<ARt|3>_HdOs$38`kWJ?r^GR8QK
z$`c_YAYkZFL`xh9#%Naw#ZZv7AZq8pxl|d_fd<$?*gn1+{@Mb<Fp(IL?3B(wnHrWI
z4+U((?pUO9JTc!U@c(3;KXFj}h<g!sB+BbtwnWr(<P)i-g-c>UoZ<FI%D}<hdgwhU
zFpMJ(9@2S+rL55tD#4rcqe*KAyDUj?gRiYo(=>}afXx9v64*;>g{FmzQE}F=gdrBk
z3Em94GEs$6Nm|f=N-E8`I8H}+hn0uHLD_{tC~%fEgwaTt5;@bkObh&u@cXa|Sdv}Q
zxowI93$<61DZJP@8nMCwH&BkZCf8vQ=3T1AI;i1PD$>d&4Jmy*JET>{@vf^Qo(sGO
zYY6ri=z^Rf1`RtFZwkqf>b@>(OX<H^A9kQtPI<~<*2=BoJRG3W?86xZ4gohc;yH5@
zkdwrKd#px^67C)*Kx=0b<s>GIqt!i4YcMNcI1U|>mE*<%`qJQ5%1F+{PKYNC<3u0?
zPb1m*O|%2ZwO7v11{ysCUwk(zbHNrv%%#RIETb%enw5-8_DI7Lib6r@S%~fyN>`Fa
zeNxo)0uo&<z6k%f(}L8Wqx=e-SY*{jEeMzyiiND(LLGz7(P-KH>Y9h%t%|`W21`Mb
zE#53@1bE-8LOD|W&L9}_m@<)2(Xg^I*OU&-oZYSYVKrpIX!YuMcfuTGH&F=^u&SnZ
z$D+mtH4><{or5=!YF#5lsS;6BhBb~PX>-8xQ-+$TQp|n8BdCy@&R8CtVyITDY=WZI
z>h3t6V<eL#cq&DJL9B`Hwtn7PExCrj2!k?iQ-UKI=4z&e)IcM|cgywvQ_bDN$c~0s
zrojNJ3pbh((>e_geg`xs{hHu=d>Ymb`Yae-QWL5;Z+PfQH>RdGFdi_7!);)2aM58Q
zfoE*}kx#Ok$Ob$Tsfv^s5$m+rV+sH%=PS2yKqhn=ks({HN~8VOsUd^!lzdDi=Eyxp
zeQ}^_SiLygqnrf2gMdLa=b3YUCltbD=29Y{fKMD+Q;V#_EZ<^5P?$E_I6CH-pU@Yy
z&{Rdegxo{=4|t9$RQ?d|uvG{Q<EN=Am$RafLu>$!bgldm=Z*AL_=^iGNu5P!oC4ED
zZ-mx0Wp^}A!&AP5yaO9S2s(}C14~(5Gm!s4gX7ExD7-PPao8z_)J4SVN_owZe0Zl)
z7bMI%>LH{j{st>{bVZb4i;=Jtf3G!h&>bC&APPyRHfHVdTw32yj&+Vl{5#IiMImNf
zS+!;*z|R<+alj#fz<`U=%(VD!omP7$2Y`SeW=?cP;0<gb*h*0od>}2?Dujf<NfafM
zDdK`)Ga((Y(})eZU0zp~jSnVBHKeL^h8X*vEPr)<YS<?3074E-IHj^Q!yv}r^u*zy
zQKoMYvd&y5#)KDzx>Oo_A6AKGFwhUUBcOG1695_rzmz&)$i<HW50DxptE_zutax~X
z)&@p3#N&c@e6UTSihyT{8fO%+8X><G2H&aOPHtQTjDyG`YYt;li>f<7T?tSDB@OQ|
zj-eQ~OKObj7I1EbGqiCBRiTzy1<P(rvH3baO$4!0H{tAp{h)MI1&WlwZ%DygGL@o9
z%h^iAh^$TE-Iasf5L(N%{$8or_AZMG1|$*0aAX~zj5XfRm1$xh?jS&e_(<a7q6A}s
zCkYFJiajp0Mg3UPKvPXOuU$}{*~U8w1&-DpbO_?A)7S`%RH%n}oHrt#Bo3E|20WY&
z2uUOZ-#h*l0wwO~(8_KageG?grd$U&XaIs?N#V)LEIBa@33>AzZ|rTfVfSuuOxG}4
z<BwMiS&ZdtS!@zYvCDNyM|GyiG*g8X4Dy0CF(tTcQ%!dz)hbh5sS^rToSf>0g#zrm
zh>Bp*0M5ukC?HjwgSb)fJgWdv4!epA?!tvFLKX-_gURgF8PH!KW-%0@oQuL7FsO2O
zF)Gw$bBWq5JQw5x0wR?2OdYKKQYOCBlG{Wkf`|*3{eyE7G<c!@YBt;;6u@bMA|dA$
zUQy>9fFr2VqY__f;Voetae&aF5~ajPnz_?7SI|S+DRn@>h8q?a<q-f#5zWuE#H&+h
z$j*R&gj~wfaBQKIxmNt@YQ>ZXCvY#hP$dBm0HMw`ac<B{2rOHTvPLz)2oz!GLmSp<
zUTg(HLPSNNp5hWA7E%)qbcUD)RG3u??&89afoly}P`wp5Jg75=)X^Xm>E>Edhs5Wh
zlh_j}T0T*Yx^a{))SLiYV^X<-tU6{~cd#}o94A*mtOGBB{BP(dPEt~!95V$xXV{CH
z>q3=Xm!t<~zhVs#QDXhYBt4*-9ikUfsv0gFcjB~~)j_5s(fKxF43TJBsTfLu2I#Rf
z9|#rU!pPGsFyTez2_!ze_P~~P$fCIpM<nho%s22o(bLN-5wq@~%qE%2NiLXRD#d*Q
zqypdTpc`cRW~~-R?I1yLfCD(UsH)Xa;}Rylm@-jP+|5WRs8XIg$463Yf)&Zy9Z--u
zhRGAfP-z}HsXuk<WC=o_8sadEXen_Y572a|GOg9wR+lc<h~x*9XA;Tfv?`)|EK#Z@
zm|D?ZfiSr+f>D)Ys^uuD)QldKUNY^J=8QypoNGQOv&2(Q+9*7-NW5W9!UeA69>`q)
z1kPt(DG4MTNnoF#yK$?8B1pKZAz({AqX^zTT2p40Qpuv?n#8e$Zer!93hx|HEOk!m
zF*<naQYOHukknXJ`X;G!4!~Imm{Dt)lQ_^u$39^|^{$Zrp!@<3cBvJQa;womjkpK{
zLqXMJpyBW!Y1^f|mwGf5iYJFIIL6-~9E0AY(F7Uw?ZjiTz~GRVZ>>;I9ibbbuRE>L
z4u*j=6Bi;O`b=b}({)xv=msP<#NRahL;8k8wexOBGT;NHCJc8jw1ql|G}A2Hx^kMi
z=9-~YLE}zVM9k}GuwGcsI4A)HJKU>cedWEWLIL?lmASK<unT;Zko|#=a53Rj>x5OU
z2GQ7%F=Zl!bd|_atwis+*C$D_$AwH>qESA;xN)G1)oKN`MkQTPo*Xqm6h)z4+oFqS
zHx$A+usPWbJnG0g6yS(MS#gij*_hcxR#i^YiR#RxtU2d*L;vB{C0U_$699rud6MCb
zMg(}NTxup1eosOPO%>xf(7loM2hJ2a<=O*9tU_*~av8NU2Ck`tV~O85)U+;$GmSE$
zO<-6_KF+%=x@;>Y63LYG4z?PH_|WX~7Ggu_4~nj9oN1)xSe5h;_oUA^CHaI?2pS^X
zYPCatr<$!*sUx=`uhb`3Vp&jW0WU17c=U$iXYA;S%sP9+O*gRnPWiQzd<@Udu-`hx
zn$=3+OMa_^r2x6DHG{QQVsYn;gHB4sJ9H5#a9XEeK)5GcIM>SAsb;}B1*4(_1sP@l
zZM)q0Ua1-fIUpbf=yt2<YDZO|b8xo+aZ4TG07!ts$#F=5)Q;zyrYBLp7N&L8IGuY;
zC%T0Fq)?Bx*ST;gmzrOntJlzFCBth_DV-3Zbv$~*nrt<BU9)C!fTS+igpVsV_O4pN
zMs6viSW&&9!yW<l?_7ThLZF~00Q<77qMS@h^(g@$rY2Y6!**~hYH$eafXdrZ!^@P1
zsl)Y;52y9pw4){%iwK-2j1i8ChlvC3jxA4!HxkHbbyDiEXaWzh@QBt-=wq&tHU%Tp
z?w~?v&y>(w^ZCnq$fZ?4B@sPBST%ihY2g}atsu#SrN3yi=!#HGWq~nFd_rqZ#HFm{
zKAbd$X{;Q?4Zk1<CI>CVkS=8cetu#csn!$39TtT-egv4Guzs-YoPyEPH|iVVd8@Se
z=^*e5O=l<Cq|mVuHw);DMnghrt~n+Vi3;*OQ_8Pa3jvNuA3%WN^B}3BBiCvWL3l+d
zzz4#CL{XPCRIA4o@JOlw!6t@C5;E14X_CDINY6!$2(S`h#`*`o7vllYy_H6VgiAN~
zsV=ZA=M;3W)JcR_aWKRP<pGTbRShK2`(9HL5Hl)~1H8%W$n&Js61aSnSrOsn;-;9@
zZKGJsmdIE{#!;THEfm~DRqfOZJV>qJumX0;YIcA+C9H#DNnWi5VB*l4t>NY1G$XUC
z&Yek%`P--iqtWso5iU#MCsnhMe1jT((HLw3JWm;B96C8%w(bm2oU;;}H1x&s;iZ~E
z-vJd$6=m7Dpao?*sQ^$F3Wjn3pIj-DS$QQ|BY=5lh-oo&&6cl?6e7CEAZ-QEMJXtR
zuSe=Y<)r8bnfR1!fnjmMbwq3yUmgSyj*JS09F9ONH!BC^V#1kaLsGGmaHjLU78I-K
zR9;l7@5F-&5?-VbXy06k99=vB1R<b0Fb660u@MGFTrLN7phRMsqXr3ONK?>eR0A`b
zo-p02e5Bw9m20<ls#>O5{;ZN5Zz&F!VI-;3*l<W8oA6Zl5J^ES8FU;@2~TWCX$8D#
zDPb?=ta26=U_06MCEj3i_9LRP(vUn3WTHY8OmXpUf|R^8(Gv`(LBpdk3U&7&ZXrL`
z`^*(NfY*b}6Gb;g=mtqRTGCq1ZoK+g=S7hGO{A$*CZW!u+NpXB2^0)HEkf3zA|Tzx
zV_Rw@SC#Q-WKw#dQ7Q}y3;Vnda&I+s+A9AiiK)&TN_4JdoWSsvBi<S13n2$RSFXZn
zh#_V;5M{5TpkR8%HA#tN+-mqWa8bIPOs(_VDe!}$ORdk6M8iNkg+!77aAe;DuGpaq
zqjCZ>artivsiInjPt+PMsTfi1R6}XO?4x-TLh_JOipc;`pgecexfqq`_T-q8jF+i<
zpmZLL61ooXbW}Q4zgu+uQK_khUeZF6&Z$G*q}Jcn+Kw2Z@!j%HtF%y~vC+y|&VXh=
z)yid!#}TPG>;PpYuL@<T*Md*ZtEPt`fftx=irnRQGf@g|Q*S6(T8|AS?Fy<33VV^e
z9O-J<RD^I9rbH0VNoCbpY6=OFi&{HAJnG&RO3PXjYQrXv)7=5?6w9E~R8U9lNC|Zi
zrK!3kkR_Q@XHxQ1l&7XLM^iLuwLS)=5rLzEDT;@%k;^FN5$F<0(oqW{R!m|IDO8y9
zj==|qnHC!(Js<UOm;gc~C`Pqb9jV)q>#u|UkFB9~D!r<vvXEH5oI7Nd`^XBK1%z6y
z+4y*NhuhSl&{YamCXC`dz4A?~fP3{X69;m+4|!+Rd5pKKbeT<5uY`e*V_FTa$U6f!
z0jyl)+5rslX>(AkU{aSrR8t5podK=H#6VX&^+!h}YC?iE1xX>WR@y&Dw8aY$YtqUv
z<e>OuW~>14Hmds;ks>hRb->=jYJ~II<q2z^1o+vSGeE2QL`bQYe}fTQafo^9_!N|M
zrBf%J=6$(ra)_4-N^-#*jY;XO4mEuM0^;}~p*&JdP)D^>M`Wj@DXr%m=-9ZBhh^%X
z^;k7ZG34+iXmP-%7==huf)#`<sjo`pV-N~FA9rk}%ra%?kl&PREY-|v0D;zdjCCM9
z6hw;=M^=IZd7@V#!j%qO#cWLFEcJ+0Bdj9x-uZ$wfkBA~2&)ptjx>5yf2kn(*YZ$R
z?%XWsp0IsURtXKT=v>sOBB~4O14ENCJI)Y;ki8{YB2#=u?nV+psKqBhw>Hl1hFQG?
z-<boCYp5#ds0t{9id-NcAvc1zK`((Yhiq#q&Ej5nCM^k4nvu}raBDnLrzHxG4M`#-
zu!HCgB}q~%@MJC3Jz593q4o=JS7_lQJtK#aBm}PBVU8CnxVykLSU5-tv_uFs&z+|i
z2R6!NOF^2t@ILc~tXr}+Q-&M(Z#?ovEaNoO925c*j<ynR3Q!7~S_Gq$<L83oLm`13
z;F!+mo8l?Q@u9AJ?8!mk0iA>gACsyx)J5zh)wnP`RaGL46~jM73^Nj!l)A639L<nI
zsFc`&qPEbb#WR4!W1wCHiwVbi+7ki^IBoE9!4w_w$_YvGIGZ8aBuL`OP4&FQB1N<1
zn2Ro3N+y=%E~cPUNP=~mIdLYk6o3oikBRdJD3`oaO-n=1$=qp*XI`uD@<`>McH1<E
z1W+vwElcLoRFx{Ifa+6(31C8pXsooZJQ!$@l8r;`Ljn$vC{-3giiJ77Bn6YjY6P*F
zd*?Sr>^aqQKnd#mk3u0QQGv2kL<``+c8CuxhKDHzXE2P<QM_VQ6L+c9gH}6wD2Q{i
zOv%D<5EnR0hc#INg-n&137x-mKoLeki(I7!<0<0#hQE-C<rE*H{<SaQKv^Ivl~EZ?
zlY8US@N!Z&0KAlPP(%eIfoUD&JTbsd(JT>`(h<)~H7^>Px5BgBkaA|>vVsiXCX3Di
z!fuV~yg&~dmx7xBv4W`#+#WO~5#lEO?=l4sbM|z^LEN!OA}Tg?rR->V>Da(H(})ei
zJPttG87t_~C0-O5$Os3-P7;GeC~y#HEY1<iCml*a1;Z717gW4qO`;i+X^nG|GM{b-
z5YI03aV`ArZKUEMaE-dFFrTc`G$0p!fIkI6kLV-6#@VJgt}(XY`>Q?hn3I+)F9msL
ztxAkIZ}352%~J>uat@d7i1C1#0<sZWb64g=nT#lGp~g<?SvN`z-xF6M(+G7rLO0N3
zQlc)j3+%{wo<P?_WQgp-&WscjxJi}Xi6CN5xZj!UEomxRyrx#KLp-~aPGQcfy<)6a
zj@%Ti5JkbMwWetmF(5;k2ymWCM5i*{aS(T$iO94RkYOG*bJ7kKG>Rr?`4(|a%1i-1
zDG24aNVrIB*Kl%`TGzB8@LfCcs^eO#iCSrC(TFibrJ(A74W^bTi_=X?Vrs<#DX;7(
zCUEC4%nh{{HH+0Lh9G7rBB&iysP`~$sZxXyouWp4+cn;#%^J1+S}O}1Rc!KcI5VmE
z2b&UEu<mIZ{v=|CW5LvcFmE{abOE5sk$V<}x#rGLG66(6IU|w5M{~>Zwc%b;Q_|5^
zlIKDlD6sm(^&QF<R3b#Bg(|S6165OB3KC>;j7j?7oO9<}haQ3B93siiyT{0gz#5=x
z0q{PDvSk&cxQb?EwW6FIK!};#=#s#IQUye7kpmBX0c!+2UVJxb{7866!6Bv0dUV->
z398joMU=c8F&-C6CRG9jE^>wS4<d-nEIq@hvjqG&3iDj!Dhd!IUClxay)3~;Q7Bwl
z{rE1^g25tE*49e6-lWbuLv@lutGsd`OK&}Prc0H?7KR_l5h5=(Arpj*W|`LkZ#^7~
zIO7!7O<D6ci)Xj`qdFxn#Z6ro9tbHb3)6y}4id&(Y>@#09>S4N>2RN<*HX|G?UrGw
ziF`yx5iMGs0nbf!3p=Nd1uHrzNC2yrY4ob$S=0hpnI>;gEYBIx1&3H=3#6*@NPnn7
zT~X~?+-JOlH&(2q2nYsZ;SlW&9t;A3>Shp0NZ`*MR0K`P3eUCNIczJ@r;zKauPMuf
z7ru7(n^LbT&3{`eRerSc36-XVq&w6jP#Vte){!VkO(6nPr0!{*`pa5)Fvw;Gm488v
zuAQH@wogvBe_B<e3mR@YH=slj{hb7rxKD`{Xh0bEfM{}^vyHIO*&M14<S@9De&+xX
zX_TZNl&~`dNO`Jo>9)BtwMDEHN1vjPv6s<^9q_f)aFQk(!c|o@u|`*J30c?;@YJ=A
z%r?>Uf;7a2=#cWc4f9=K=98E~*uKdd2YP~=A1Zm!RGPgwBra;{*G^f8P|mSDT#{JV
zn3+X33~5?%BuP$(af#v;=mV9LL0~zN;&|LLt-Kn|eAtI@c__~~Ip+?$fqkzEtjaG=
z_(9@PhYPd|CB#T#bx@rO-ISmZ3KX?@;=5TE4t11pE@O?kgd8pEW!dB+T`5L1NIXs3
z;|Ba~>e`K>OV0F6xfmMQ@W2l^8H9@(Lz=TXb0wk>lw{PX4oEJTt36XFPX{cjWJ*I3
z;sS7FLn$@@hy$Y3aTRF(DQUgXok6DJJRi94;EWU-zta@17~85T*aU{DLpD{u$^pct
zkf<<6C_z!0D^I!BRBKoZrFVyxtpeM~3WT4Sif+SF)>;F+IhbCp!4{V?fc-`@1qtI+
zRn#!p76=h}5;QYuojKp1*k~A3YAciE7OfRHZ>*FXjv!!D4m?AAmXcLUG9;@cqF_X-
z!VaJbKt&s<?fX+$vzx(&>)xt-9uGd~MiZP#(#?IL72dTX)K?mQwa&ejNrfVHnh_;0
zya=Ka1de(998elWP8XaEy6<tfwZH^iezBMUxZ+hGf?zskdnx%dB^t;>C*&QWIvJ#{
z<dx(~lT#a!yFIO?1RD4apdjR;yYNGyj(#Q11+Rl96(yH4#Zz>Obe7x`s~I<4&5l>B
zNg65raeIR&&&iq9nRQ$R_@X<453(!qEIJT91)8bO$NsMI)VbXabs=7sj9QFJ$u{in
zLdp8rPn~98yORn&GuS1_N~w%(a@gG@+kwre2ow~qF;32>T76Gz2-k3!L^B_3m4Y5x
zJz-J@`2c@Kfkr@lg!$8GWrBQA#u<Dw<YM@ocar5y4}k0yKi+T#G-^SDV*nls$Fei2
z*h;WI$_$XbA7Qo`^NfJi;uH*u1L7ge;g)IjD8suGqZS&ntBLgEaqpr+31KSrc@!n1
zEFdvcn-pjxo2#{mROX#QFzAs}ih4^(A=*ZyPU0-AG!q)^mLo7BaUL^9>swPk$iX7W
zC#@8o!I_%HA~LE4gBoM8YI*4<iXe0+GPxSHJL<|Yk&u^+#05VL=*eO4c~4OCo%-mM
zS<N}|NTwhxgZYNu8PV{J6dALn=7&<q$9cayYJjGuMSum10Rb&HqMZ1YysTPJb7N&w
zRW(%lnV2Nj5(NVn1d|>E=_@DV79p1try?42^hFQ^E8!E;=qa1e$6JBhX>u{<f9GnL
zP^YXU3rt>-;yH~Iuf&Aaj}7dd{P*aKsMLd{9?e?w0$uG;(3B8?A)1tazy;tssIu@x
zVu)!S2<IVI|6T{uS?eD8iePN0R!uRmAf6pZ6mn`7k#1K)z1I2&Xsr}(6tn=Jl6m$w
zG-V>z5LjhkU81tg8UcTT14JncJh7URALhXKD#f_P-Hk(9rE(U?qn%^9(Ar&C1G&Dx
z%Zeoffl4E=tN?5tRfQ}ehF73@hD#`t5LcMNsKYJT6tYqs^qX`#2w2Q_(^k<P3V|vS
z4=t_JL5bokZ)B)vR9BZNr>JwRP?RaH4s2|Ada2XrPgA&nNl>X3rykL{B%)Rztk9nz
zR`kN0&5gSgfy_f4=QL<`l0Yj(m1d5QEn!NP4w7Io&hI#HxbtC~0Y0iJtPWEOqMoz|
zDD%*J-Mp2`9<3gFVr?SMoz5lagVs$YwyLSk@mQ=&O%M@r2svow*o5T;Q1oR?K%Y?7
zz=vrY1#>8@ors?Yn&Wg$6-G<>jVz6cRE;|QU{1spO|1`Sb%3cZ;S$vnQ}Emm8;2c3
z8jLEGNHJf9RWZ!G05k{iW)1HK*^5>jB*aydo92h4Fzb^*6V6LlVOA6EQVk4%CUnNB
zWvXD7;z7u=D1uN%)H4H2o6Ve!QVG#Y8?A0aEGLh}NHh_Xpalg4;av5_NN_k&YmWRS
z@G#MQ$k{Yl*2K$Ftt;e4QWN@tH*|_(jT;BkUKU%XMeLwZ_nNtur=S!AL?E?83uYQB
zf~k~rW++jeMMc$R2*$}=Y8Cb2!nEY{!cCzyff}EqRFP^9bb<2}zk9@R!;aJ_*(DKq
ziV!#tF&wpQROXtj$Kl<usK90ed!qVuSNSRjoB*2MM_|6mBEK)3M&x&<N{GagPkkUK
z#lhY|FbyB9qdX?q0#O034b9qd&LBl};q4;MNtTjNM*x|`CM2NQbe>BUJ-Jp=@D$La
zPfNymM{EtQqne|`lg2gV@DX1jhaP?qpQQ(*1tDJio2@JF2$M&Ja)SEQ!Hp7W@2SeF
z0-KYi(KFRO4SFTzD<J2r_31y@{7Qh4akgcJ^Tvr>RAdJAw#XaFBfuon!gaXZO5|4M
ziD$_8(*Oz;RW&x@O2ulO0LpSO9&POsyeoK6aDij3z`GbZlt3usjYTsg%IFhLAqgy~
zw8D51>U3qNOC~Gh{6fp?Jm`rNBhx5ar>^We+HdgNwz#r040keZom&kL5%H%If_3Hc
zjxNIv`U5H><}i-<Og1h1h_g_6;oz@}us<^C)U}GsGxb&KG#dq3OlE##n=*QyaM(bF
z3C9MBxGqr`l3~!O@)&~Uv4VrKzm<iOJ5*K*F5X6RG>H5r)6(E+L{q4qORPApbxd<-
zcPF)`DT8@bvhL1l<{VID^Fpi%QHzg}fFx2~SQA^yJi?<>ErW|PR<J@kN4=Ek`XT?K
zFc(uE-D3nZ(9<-74{{5a#XzYZ2y0W#0Me>9gLuVNqopSyOlDI$b*55P5`P@AVNd$a
zF_jyOA;8(La3ZK6XN%x$-WWknJm08rpg;r|)>~qhPBE-iWx|;bodmKdPPfL;AQ$7D
z!f6#n5K4Jwg;pyiiH~{-;9Sj|M8*RZa6?jKAV8d30FcgHQYPkX4zFOHnybtE+C|Mo
z2_s9U!gP(%Ce6lgAW0)PKePHWz0TFBr`amm5Ymj~W3{qFQx=$LfpRK%$A{9{vK?7Q
zuBJJ-bfsV*!;@+fK8=L+S}TSYU?#~4gDhzfyo6*_q4utbL}3{fP6b&Da3{L-*31|{
z&`?REY8+h(p?EY2z-rJm<e76tP{@hUU9CX#(kCuz^<{FE0q6mijyjj|LMvZWsx0ts
zm9$_vsTl<89Z7etJ`2UB3_jnHpXtx;R@1+Ug|%qfF0=w%K+CzR+mHZ7)Jw<=f^Y+=
zP2jt77;ZRfP&0{lLn7$F*m!z~V?wZsqtwBW$e2zk<3Q<3Om-JqfjUfyUO?7qWhV!E
zs^GX`A!kJGeMvS^6AA5NEyLH5I@Ug_7j%kqER=*Pbu}pQ4x|PI0~?A$5sgeJ5edrF
z%4On7<Fo)HG;I_B0<q~*cQY**!nx5ZrHxyYT7E?-v2ZAM#?{ux1K=a)NNF22rai!f
z(+ehl&^-#ace*mnbf9Ks1*UKWxq}L~k)BZmCsBxFY)dUIs?(vNj_Ncf9SDA$4JE)Q
ziYLTvN(s_N^N5Kh=gxe{APFX889^?>DfIvoq&`kdrMFi``ly${iA8!PUh@j)PJ~6k
zAzV`0wbQ<&4!@UcT_T>T)f$R+fHdM!(DXgrwK%yP^%AEnYZZ@=#%6NIUr&+kOcO}(
zP38V+pgq_-Ago%gZx*#zAS;y?!-ZwD990*r;ASAgj<*GZVplzvfEF1aok8>+<Rek;
zxfVWsU|?PDBA{BHo3j=|^rpy1!6wu@WpSr$dlB~=2q|p)4)c_~<4ad2Sizk(id#|E
zc~r59Cb9XUN>$n>S3(0eHj3`TBSuP9bVp~1EBrcG=2UZYs54Y-v|+3K-54c)n1E8<
z11Rj!L>0BK&r&JyJ5>UZu1%u>ohhlB!m~T+W<IJzOv*CPAPP$@T*vxQDyswVH8iZk
zhoI%~0SvEW4^q8y+N&H5iqX?~2QlbK_DS<luQ(?#E@_8vpx`kfRp1#AV0$<Va2%5F
zDZ>Cau&Z*w@rF;A1&A#4nQZ7Wt@`!xBh^Z{)5ki1zM$OUszz1v78P1ps-+<{B|D2J
zjtGQ;TstK+(m+qVEmMXMLPWUtGsm__75Y|9yPRzL+^cG-(sk5IjtgO`%lK_Av`KmB
zM!{YV9GVqc)n4mrC_REBp3$-;wPk*jD&`1Gs?0JnbJgs-u8XCH5@=(o&xbM(%F3}(
z5lz9y$EDtJ07e=&xR4<3)dKdI#lEIOr@?8>o5Qo_2+c{4&y{Bc_dlLscXX5%NyY+I
zKcp)Y*kKoES|1C%Vd;2c8+bQz>?xSXnkEMGVdSnfh7JWc>&WR`XwKS@A|XL`Mf4Jp
zSxP#g+ogrk(Dn1CI|rDRl2DcrQ;L{jJn)2(c3P&nceN9H0;R4%P^8Y#N&K{0L`~~Y
zq?M;lR7@OLJY0?>*Tk4G{yQsSuQd%DUs(!a*Oux5hrq;H`6UJe1w;`sRDW=eeMq^K
zH(U9!OG`xRJ@loX&{X)Qu83#rPzZ63>IjQcVW~l3O#;(u*~O%EvYtK74QUvS5(iV2
zppDF}kYte%sPMQ{gU8+($MqoFiG<csauGn+LPQ#_heOO+R6sJCOzGP=xv7gWC{IeK
zQDut8Cbr}V@k;z~=AWnX46uUXwwiQfJk0=daNW9SAN-`me<05V5bRukx)Mqy$Dk@w
z?G$?K9vo&kQF0|HkJch*x~#l3(?U4#v$}&yE8asg%v-dMI21-ZRa+Hp2g=it#<iL|
z179$8asYisfya6xkPK2uiM--%WJOfUX->o(ro-XgpnxIWKubZ9gz5QeF#0&z(P~JT
zibf_Lcu=Ea^KwvEo|&9Zw3`19#>cx^$bO^dNs*)PV>fzmsKy2rHH5>w@^oP2;jvEn
zmlBAMR;nU<68nOpyX2HdpSh+$!-x&<J(Wj24L4f}B43JDk<A$uj0R&6?h<_Ztp#xV
z+wd9JEGua33ED)j8kGpCIHln5!q@21+7u)#wwh(7RS2RNTT9uN8hi(Z+<48LbjD73
z$Dk{5rG^Sv6fr@enxGVJ>GvBD9sQVKY!OpHq3~%4YZF){(YecgNHWtbfA%g|g;?t;
zQ|psrjHG1(`*P{zIC->kA8upRJQt;fMuiM&ptL1eXb*y^aHyjk7K+h}JbJ39Q|U+^
zOD35^v*0gb_^DY9VvqxJxQ$x2>Z#Ib-YCBqlKj>f3>bpCZJgCXm5f$vx016qLc=#o
zFeJ-VEFAS2#v#ECujteiOUvUff!d_%W+2>wmp+D)ac{R)2)!as(76(bDg2RezvWtW
zo1$#di>=;!P`cC_D_n6q&NL`8poAwZ<18xU%+|04)qF^LbVr90CE!F-CetD&cqht(
zf?Cu<M5losrv;HCoWWVFC5gIm^;|o>h<-MybLwygbZ|P<cv3QT1xMux(mM)RVYA{v
zcKRf_<O=w}`X&j&5m447%)x$7K)<T}QYO6;p@*xwp~&bkk~m6?L<L9z$An{$0hB@(
zkK(4u*NM~=rCKDJR{mz!d5(AG0nfEo7=fNTx;1M>Ot)$rXk95+381F<1W+fc4QFcS
zMXwtEN$L>i0DW>_y0TQ-N?dWB9%gN1St-DtBNj@f|AA=9ZBy733X%d5<+(d?H1i@;
zf)$8Qs}WCZtL1vNq6oEvJ=Iysssi+ltOG>gXxwTo-T<P4%4S*aasoS0BrUNaMk@Ci
z_Go{sRvd@Q$QeC`8nlCrM1@I}kHjmP+nO<@i21UKuoMC&d1|8Gyq})^4X&gHZU+bf
zDkn=sJIx7l5EUc6)Nv>g8NtzvF<up#AL#0$Qr<+dSIRNqY8fUa`k5x%A@fB%Ij>r+
znSZ#xT4nwBYcewy0J7Ez=2T5w$^|}G^m2|A3`S>U*2-VN8Ubly-uqs|W6^b5;i`qR
z(1pqI7*paIKT2*nn^AksG!?HxK!IIxtVU{DP;UW`N};S(!^Y{f_J;B`HO3C<Y*UT|
z$gP0R6nPr$Zt5<Rxl$<aYf*Ym7Xmbj>MN8qEHB+@s<jPBLuCd)Q@Y5CQpJPw($p3|
z0iy2#Q(;M~3)@p3H&6m&hP7JTxvJuAio+HWVwr#Fnr`EeB?u=AJPxY6#8M1EB&nQR
zkX{BEhI4$t_Dk%9+zm@G7_1HrWz=eLYY7f#QBkW0C{CvsdWw}s^C46Bu4*R$Fgkae
z!m9At!avB`@+2QBBuMXu@fAzYtw|-;g+YL`JB|GHqGBtm1giqRGDgVz6rk-c74S%6
zR0P4G`;gT|O-@94>gwviiGt`N)Bv4L?dtt01^~Z)p+%<~=h#m=^+y4iM~!Q$Xa{J3
zjQURy6T%7Wpc}-JH4#G-9B}c+Bxp`3it&)!2M3wwVc?wP(4+FY?2XFN0s{pih7TEI
zrqM*_93ZGyf%QaUv|Z_Z=B7K7?62(du7-(H;t=_jrDuibBY27UnzFnrJ71Rj%2Gga
zkV+-+3uHsI7Bzu^a;W$>VLJ0fhVbN3;hy*|BEos-wWu7PE;!;k4_?B{*eHb?*#ShO
zBCi+30f08}kHZ?_P)MCR=83{m2DB*Z=nGN<fFKWp1$5oH$EZbDD4{Fmi^+9}IJ{0X
zo@!;XuAy~xE?cIt(yU)K!8=DyA!2~?I2!oE&(-;mWT!?oJfAR5wGLqgE-ce(DY}Pz
z=@XdnVD^IZMQe(<Vv^+FQJT2L>7JIkgQt`EfF&-Pi^2dL#0@1<6G_x-!e(@|z!fJ6
zP})>I9Fa{p!Jp18jTTsIyWHgjij*POjx=t?{I!nJ0(Xe!;Whvr>eOL+@j2lc*IM-I
z+Z}EzK;l%TqCS9=w_a5f^;L`RkQa-R>o{=RRNXu{#?>?8aOSO&DncEC`WkW}!@DUP
z5@2WbRp*`%4~7@81F2<9HIY18%gs@nh+I!it8*$gS`*pBrPA%zhC%PGMX*;|1F8dS
z=rimUrLUfESZzS&xF8{k5^6kTn&RLT4D@uCWU9$X_==*Ri`q}M`tAt66Y6wM9XJEj
z7mW^4v<|7GRYO|M1d!*J9*0MnKw|m1YUL>D!@IT0iw#DJq8u7sbla315vpR5-lHW1
z1~~~^0+If@(;8o%Z<N3?WceBoh8r=u$3Wmvh#Th~uKm)jN$|4>Hua9-Dvq8fvd@v=
zu;^)k-o=DVD*=Tg3D*J0wCFEUm9f^sc4g}e3Ma5qG+J>3ii*;lB0&Uc6a-SUTqDVu
zql9Ft)Ol~=GI{Z+bLCn;PhA{<Sw|(=Qq2S5fvg1tOI#)BvTP`VAZ_g!WHeW&!SKh#
zM*_v_x#;UeGGIU;Fr;CSewEZp-~sy#Hdh^!*KvWNH7Vt;<~(|sGsj}5Ji}ytWpy+k
zDrJ7ov}S~I5V;{~RO6sf8sOK?5>vuRlI50LY13AbjV_%Wq#Ss0QmCyQ+8`%k!LLF2
z*YKYB#g(b5rj#|bm^ns^Oo<{}wH1}w(!~QZ*hi7|6mBs-u6R(vWCZ&HK3ILp%pDyB
zpD1LSY1*A*TSULllo1OjFx>c#v#iyUV4$Gk!NyfKXn3H6u=F+A4fw7@#?`3tDco@e
zp@~wN?1lhsK$5>w;pC7okhkgFEM(w-4A+{-rLV6Eni{7h`?n#9-aB<Da6l-GLi82;
z+ZTdvl`6GGD8sAjXo2Z{3k9DNZ?XnsWCaH?@2k$X&ei!yNcXO^EF~d*7J7^akeY`a
zhhq=Gk;6QpX=;sOvW)S=x;h^~Hc~Yyw3MN*`%SJKk_$p9EcVjnzX94p3N|<?!~}Az
z>!guuRz$8CfX>kX5aYl_!A_RrJ4>BkxzhrmX<ZogW|<97Ly0D4RFzsk9v`P;HL8sk
zyH?T=f>gth0D;uXQmt||)Va@n&_o_c^jfM=W)bz5fH|%;6A;o9@}!-HhelYbF2tL4
zF>8zX8!Nrjla?&QZls15nu^xpuxruY2N5KluC$mnaq<yXO%o}Udzg}imYO{r!dRTJ
zF&9ed++;2uAlsoK`rdZxfvJl)Zwc-U@`oWDpbC)3Vy8-k1fZ70%-re9i4xOU8Pm=X
z@9xN_%9bXiLcPpFkFrEjXayFpjfgw)bHedtK<DZV$fG5U*O)48_(`FE^klYpKnX8X
zgqDy-8%-m8?Ub9+x(S84DWWikP|j*F)S5RGB^SQhLiwFERj2XfEGZZ@O~b||iZ9t!
z@j+UIY6J?Ta<m(zQvBBBG}oO%u?A~VX%9uWP)O9+4#2}s#$QJT3m`tRb||c_a=;pX
zm!0EXwo2Ais$hoQCFYwFgN08--nPbX({-Mpi?dV#gtcz&BGO91EJ6IBQ)fCfv~ej@
z2D~NnNg4VYf<$rSaNZF@p!N#^H|L+k{L$)<xVm$<O{rszBGxDeC3%+a>;{DZjU)s_
z>S=d841tk?Ts_cSuAp$D8-ml1N+9Gj#5A6abClSW2FuWG95AZ^@Pi^(S?*bMv*1%G
zlwTYYmWm{GH<E~OvfyfEQFgc>jj*-K7DhT+<0{>-sTwT+rS=RgF`lB1W*W_P1MKWj
z5we3pE`W&d&>16>Bm`q%lt5jQCd`&}Cl2c-B?d$|fn5^4*t$q?MiD+`r^ilKwse?h
z*0duu*V=pd=#^hg2`A$2ZgtfGlvlast5XnsR&q@e$;x7s%2`p;h`JWMa!2Oku((=H
zTFF|4e^bTVD;Q9swA3;$IJk3HU63?ko>Z!eo>vYzfZ~y9h4Pe)HI&pCHOh=ppixFi
z>Z3SKK}+?J=&2=b9S5#1HK5^@Do7k8&aH{d$rxKmrmCWcKG!pha122|Vr9OL6;4!i
zLh_@j>g@0(2tW<hvr8MVPg-eH903%{EgM(s34a4VeT^XIgjHQ?nc}+uf`A|Buug^v
zs42OeYf_fMdtI2kL_cbj_6v+s>(b^pnSmAKb0QPf*F#cnpH^8@DJc@EU=pp;191j*
zk#wR)g=s4l;@G|Fjf{M3jmE9;lwdrJ(j6g@CD2V|NHZh`e@O!Ns|7PdW`KrLoby{<
zYK>;s;2Vh5b2BY*NHz!I!$z5fqs|2oUtR1#B}-I=VRsXfB-^}c6=mWPAB8S{<>2Ww
z$-~u;2AM$+j?JHIp0V>Ou>4WyAqaqMKN?~vaJc+2wGer=kJ18RC2ikuDXC+BgCiBI
z2ogF?s&iOuAS-AAq&#&>5fTGwxS+KX5`Mncm%mc}qn3~<Xg#p+v0g+D^EKdq$a-3f
z`$oH4sZW)Lu2YS9csB^5sA8q1NQzOgiHcWHOhA924aO6PN>rpgP?nm2LgDM`WSY~Y
zQXInL!Ue9?t%tUt;ZBkf-65<y00#khB39S1P0=6-Kau85oZq=3loK*jzZ>?0XQKiQ
zBo{+!OWd@`eO?F15y&7?MXAcX$4o*>vaqlKjMqy36GxKW4osDS!Q&E{e=NNpmU$)P
z8S#yhj7A_CMjoxB9E%b*N=2gHC<V1-4m*Pap@q6-&QXM#s9*s7Au+wxT1upGdw)r*
zoQj&Q14Cu&h6HRyK}s*&oK@*^paG33A1|yeg*F;PB+AR8MMdCJbya-GCNJ1F8p<b)
zEq6{G!fPn`%F<8%le2M3<tU+$Dz;|oDyDGUz%x$)U@U2$ewAvv1hxoiU8KiFg&rHF
zP{slE{yQc~d{iB;odeD49Kgq7ji}!hlv*g9PM;*NDJT3(?1(5=1f6NIW}pKNi>Y$~
z(1fz@g~scYy;+9bQNch3K^7|nKKKC~27?S>tZon-rB-<yhJ;{{#+cDox-NH;E9Hn%
z#zj%mV33V;m#XZ7R{>rH{j`JLtD~y5GO;iwxH`m%*0Sle07qFWb8{50WHFMX*D1hN
z4pf&k1ltc#OsHGRx^#L8js^}s<yxsUE!cTyYGoj%Ehv7x8cI~9R(vH1Z`jO(oGeRC
z9U(VaxuV=iQldkBosCvvsOm`Jga4X1E!j<4`q-m2sdJ$@z3fHG9LBQK1^Wzf$BpPL
zPQ0SQC=DIe4(h^@G`30;22%vEC}6Wr;2~mAYg>>f85APJkSGZ|Ov5B^$ewiK6{2t8
znp8SO?J7Fw`UCDL(i|^VtNBzej8JQ$J9HxeSi6|nR2VFYDT2=?uN*9eSiNeDKoW9g
z0E%Zfz)313S&e{vR8W|J5sJCivZBuTa9fAJ4R~Bb%%ZHF-Hq+TY{Ax}==veoh}7>~
zp-Ea`4{7B254AizMdzSAho2@!jkF|kp(S@p$dDX%M!C!p8x0=9B4+L;@Gc;?=m|_X
z<%q<J5}SqMKx+*hJ4Sh}L)Dn$58z7UZd0|IQce&-wJu5vJspNW86%}~)q9S>7Jq@#
zj4A7L41j_b&|onW-G;QkewApFFf&(bL9Q<POA!4T;gJ?pQC&FJjRaFE(~_isPPKw)
zRA&HQHCmkpUa;1kZ+IOwNdt1_LMvDfJ0R7n8zk|i8r5*g%<=|g-IP{cgEGqwnn>+2
zz(E{sS`;(xH--@4j7EhrKW|i2ERBB^FbvRG=ZwQZCgx4W1q{Pz_7Of~1wg?_X|vIO
zv(P(fSRJH`apP#fI@bt}R&R23tkAGgy)7*hP<SNkU`k42D!|RL(Hsayli@Q3HbSFP
zIvALuLr^j(sYq<y(*kQYN}+NOoK%FkDR&{RAo#vZEeq>PS0Y{r@+$(_^HyehK*6cq
zX(f=x`CifEGv&)Elz%33ieV9g!8IjcjIlN@WmtHa7b?<FX)^9^`9Q-JV4KQ9Pu$o^
zc~gKo<o6-GT<sZVi{b`K90*$2r6^(WkvfmNN3lE+r+~$*rQ@lc3*mX?Bbl%lqNsLi
z7#5NCzBa1kO3UyyYSTvrL#yQFxamkd!1Xz7Q<XrdEe++fEYG>Wt;jWiUuwp+`r@N7
zM;hY201pqM%4gf<7=9E2Ag!osqFz#HU5!lHz5ugUju@Mv1FPK;MThGwrh}-N)o5Ng
z0FJiE{o+DGYEm^ZHoOaira<)}kgJd{DWJtwPV5v_oq>D<ycZ8)Dzhj}38{aLf>d2l
zzU3^XRs()|TqnL94@L^-8^(U;iY3E<L*$cM1eMl7bI!O<wf}|_1uA+^K&jOj!A`^P
z4mqDo2?Wc9Pn@Fz=YQ*^GK5owBHl^puN*wR)-(VvsFlgb6Pjm~ye}1ZNtt^s9n$NQ
zqIoL4Iz{$~d%HE+YV?zY9NJ8y{g&XM!y`~o1u@kk@J@RLBd+{BR`WKN<<vTpjdJ#5
z(dWKaFQb^|T2}`jM(J{(AtQvIhl7Beh}tPn_+(m5g62rU4;vR3^|?_<0Hu&N>VU_E
zf+V03qOL_#x<qaGkMQrc1Pf7Mo%UK8FS9HprARBXSf>%IEhPyCf=sQW=JVe=O-Uo@
z1e`I8MkXv(WKX9`#(-tyOe5-j!{<N^EI{RvWQ8Ku<l}>TpxATaYlo7isebgvsE{I@
z2ycI@)!1;0Q!mXWXh6M3agZD>n^B7)60O74DiTTcF;^20Dsp(-L5>o4ai=M$+yVzg
zp><l)taNCWs<b>vjw)G!g|9_lYVs>|V3eJzU4nhtX?0M=UP+Itx{f#nE!_x>et};U
zt<f1Ps49h)0?E`59B*q$wrjL_SxUm1FIPaogrIe)nEcA6sRF;|+@pd+r>CEDwWDNG
z8w!AHt6A}bhR1%cE3FR*VmoshUc#{q4>8I&TO<M@MG}^oX2L7|dXvX^ccKMMw8jR(
zIglR_2F6$cM^-vp^7DOtmJXUK-o9fwWszu$^RUneGWBIq?LC1EXfMi=L!L->fg{FN
zw}vLNU`A%nG$Q>Ly9Xzq@)Nu01KqHaMk43&EjTJ3t!`sE&`N3)cYtz~*5IQFB#=Pq
z0IXD@7V9WiG8^!OF>uX5QK}x;C`7EDb-mCkAW&^lKDcnDz1WDdR48qkDjvycK@gU(
zZ(&VIF_B^#51(b&XDA+8lE^t4HBm}4k)Z08T^xbOAZ}oEz$489b4jrP{ph5+QplZ)
zN$7Z_v}TI3a{*3v`Xs=T6#QYPJY-!|)s!Si3q~q+LN?;mA(}zV4&AlPd<0sn@siX}
zh_RsBhqF3xICPq8j!A`J8_odIQ2+>Nc_^S*o_~^@Qpn+qrYm=O9r(&fN2n{U_ul$K
znTi}UQyxP6E+VWrPE_><AJAw8`H^^Kn8EP_Hmsr-TRH7ACDz3=QjEx>iF^{~2Zw=T
z9Lw>Ph0@#98kxp0cc=&$vk27!+Jwfgj6Q{=)!bGR$qOx=>e9jiDW{leMXOwAse=<?
z|3FHFQ&wrj+ytQ4s)G_%e|A8OEouT4adpg@)Jg&N+Z5(mQtai`l}9o{fh)s<Q;W@b
zNOKpGBr6U=5Lgo+n22sofGi3r)-t%vhKoQ`NUKr?#5yx7#$mcinkK<S)QL=kvd&+k
zxG)$_iMK+Z<zUVbMPOO57pPz7;0;>ql2Z<MQR%?&<ae`ml$8xGTW`{G9%8qF`5?IN
zn8|T$QP)+|uF+%Nkf>ITy47+Ekc8;iuhsvqxH#CC3Kv_%Essk*_#m-#2Js3#I_~dE
z&z!V!&<$8k0q7DPf!Vx_m|n<i)zJ)uo7%0OWFO;zlHkB=bRgr2Q>V2S?#@w~Q9GTS
zL`xtygSwuTW)w%)pQ<_;SRqzW=VHR7&%m4v4FyT`jq~&ZdTt4?C{C#;-E=o(s-fqD
z^CGAd0ppOw<O+2pb%_(prSX8WfGdf{ID?}Li3qe+6IL|}2b*(#Yl&8N2Qg@B!3`4t
zDL@4nM9&Xm)$t6_P>pi8fH8)aHu~^bCkPa33S+mrm@uwC>I354m$NjDZcP{wG6?%h
z!u`~n7?B5%QVRW})~JlZT@Z-?SZk{TuQ_*7GuQkOavBS*RaM2Bc%_yXRvt-(-?z?w
z)54|b*Otaco$_HwaE%#PH3>|{)Yf;hRF)f(n9wWh$UTOm(L66ufkCn72(Izp!FE9g
zIK}GX?&eg-4hWpHEJ;sQ04%FeRfh#zMx__tgO>0Qm3%RiN3~}PLensZz+u;Ru4of!
zVJW9xNi`2jUc{xG;DW|L1q{<<k+d%%YTX)gR3kYaz9*VLlua4Ntk%nnTu6jJZ~-W*
zATdIR_|WWIIO;Iglw~{`D;Wk6NffvMlo`Q2jU#~EQL4Y82u7?Le0M1Bm@|+LR^DL+
z_c_zrDU7g-NqVT{@Yaz8!=ci;${X1Il~zSWN>ZUc9#n*Mp-<C!AlJ}!Qg<%UL*Q+2
z_P8*)Y8PPY;27*Y=uAm_Z~_y;#mD4}%Gat&)`p&Lau<QF$VvtyqFLiW2O^m;rZ`16
zG;2VKx}z{}$Ua2j64M80Y(&|DnI`+0Gar9q?(%W4-ocG2Jsk&3#4BsvZjBgMN_5(I
z8wZ*%f^VhSNB-U5<->tYG+2?4F0+Z}s8y$BX3941ZuQmV5Moti_hugEjA2|V#)Kp-
z)Dw4_Dx?)tndAtoRW%&>Kt2lcy`b*P9I73FPO99#&{E*D^TmIZb*-i#U0ny>&G2p%
z`XsN92s|aS9XOXV4ESS7QZ0xoxzHB5(FEVguY_IN**Gw3Ra%U=AseJ|sCJF(keN?u
zh`Jn=2Wi!jg_jr10cadYBGv%a2iUC`*4hz~DB_A-o>UoySZl*{vx|(01n7pyFSkk%
zKDn085|LMBQN;$}gEL<ts$@Gh4sbw?G4LVqEXX3GLVS#Mpb(NJW+WgUE(<IgLlPR6
zLj5Xno3j1D$5$|j>apbfT(WXVUxi?ue5;5rVOeP*5;j7r{8(|D!VFj7yCEc7Hc@hA
zS|Y8W%ytU{O706d5Sai_rd`jp*4rRnwG*VGLVifZ+wA}?fPhz5BZ9<yh9POJEFa_=
zz@9wI4UEUIop6S0S*plGPibH<PYOE4pXZP|fWh(c;rhcPUq{CWsR`Jz$_}70Xs0P?
zx+y%FWC7%zbL>Nkkr^2iysoXQDuT?#?W#aq=tz8Q5f(H`PE%V~-_6B@I~<{%RtW%r
z77Lt`y8+3iQgF*0WzL0!<RZjG&Ebxqw(lfPMiLYXt@2s>jg!G#MPVY`u9%VzcwA5$
zUD^87BU-wRgU>V9G*1rNymiR$5>gYa%$(Z09OS<ANe%_8<=HANSu9%y*DNL6WR$7k
z;<0L(a?xVolmFCO*{@zx07orPLSH9$(aA|I0ZOg<N(qB&hiXri)|eO&EOht?Juw1F
zWy*4^S#>T?7!Yk)Yn~qKFZDEfsNG24Ofvz<>4}{r29heHA26>pcivDaK}vGvsllYR
z*Wxx+o0B{@lKu-gon0rj%p4wbs?T<n!_MG(1U5~uswBqfz)MOt0_d9qRiT!{#(_(l
zp@IYiWW3AV#V-#Is=^usFd5^f@GT=Kc@H8^rLVvT)i%jNTDF>!FfIog)GB9Grs-@x
z+DA4A42T48@vFtkz)DfCN%#2b$iVdG1FxHD<bo8pA_9*y+`bwSD3#(ibEz&`$v|ri
z;ZPuVKOP;p`L)Iyl{e4<U2L(bRO!O`l4+zox{#<8R)C$Vl_i=Hh_Xb^$kr<CrFhyM
zlP9%0AQON<S@axoaGe$;VlX3nhmD1=H!?5bVbv%nV!OyQpG%9kA=Q(J(E$$@o!`{f
z!*>Jtk8FRJNl5mLCM_x}Zy7UW5|j^$fj4OLu+O*vD0ZpB=3w(^$bF9t<JuUGAeccZ
z?&+A}*%GPYzLlSR2&5(Ivczr3`=x5;IW0&_G*VlNtj(%)j9FmG0kRPt0!Qy^V?*-E
z_E7h6$v{SOQ@kX&%T+-qvDzmw0Ex&r^Py<4G8th_Qtb<md8$lLwa3on7#3P!8Q}$Y
zw1WW1QK@BhjR&BpofgET6fm6Owkh-4JBZbCg~BIKk<iYuk7a<EC#;p~xgSj<d<;3T
z=|YJ>TSshXNdb8PoWeC1i}*kjR%y1N!l7E{oq_Sh;9ih~0DFolN|mkwEe2aFdVgF}
z8{tKMqVfhuQX>GW=wpqRt0_xQ@y>}4$(*Q^E$2q+GOjfip)o%VAa%|aL6SQmRi3G|
z(lL+**fNFDOYsZXB`%EzXGg2zi5de<<BRUX3`$rXraS<CE&y6m2Mmug1*9p!7nNQu
z<*aoM3q_o|lt3_x0N*rNEc-Hz)K?VVV3BKq3P34ct2Mf=Ki+)wc<V2lf4zHu?Q}9b
z-Fh}T+&bAl+}jc>lxkem?JDxE(?sia75UeHx%c3+f8Tm^_n({JCjWQy%RBev@2xwJ
zA3t2%-k&}@ob1W^Szo`sc<0tD+$*;xQ{To(k;|X6rw6C<$A`P8FQn_&wr8`+$?4YK
z*8XJe+2nNVV0swJip{1!Pl|j^-abB3MoFyq<i;JYNVp<7JvvHe2iyDmH+ZPDntW>Y
z$@)=PQ_#J9_jJ0yzZG6&O)lK%-^xGX+zYpsTzWW-Pm*ibd8u=IadeWbP37zKb}~)=
z<l2+JKl(@~?Ar7x*Ze8@?7@@!kGC@Wupg^4>B!_?YyD(Szug!=YK!mtf^70Fx9X@p
zI6FN)J53IzGG3><&l9>b{q+648`1z>yY^E4C$l7->)Wyc&@abNKVjHh7p{kAeAzd?
z9hcktd*6QgzKo(YD*y7d(XA{Dp73&UaP0kaH!@e~-quAO+&Z_5quX6qm(2W2+lrg_
zKVRIGL%F=))~1xV_`1}ped!C9=th#h08Gcf-S*Bd|L#qmrZ0cRo!k%In*6nq{CazN
zSwG&`Zg%VC-ERKP?dCz&*5$C9wKS$arY_x%tjkO6XMgW#KVNva-_hF2$*XS7x*TuK
zy1ddcOAvRw<D}uZ<D}KmGtRwqygB=eFMHGuJz2Rq>+;gulj^2nd&;yf9=5*v>8o!~
zxB6`eMyubReKHKoxhr43)^&g5i!UF)sLLB+`G-H*1L0QxE+?1Ys;}173%03VFzW88
zw>NGq_IE2E_xP&k?{9O*jt*o!k1IK1Hj-i^k-d<;e7l=^e9~3F>b73imp8bvmzFjD
zO>OM|!Tb6b?`qj4*AKR*hig9^P51N#P9~>kCx;1pe9cz)ybZkJK6YBw#<Hu2ZL%OU
z=*Rzg_w&2>IhpKDXE$f3+dKP{kM}0WvyZ=<AO??iKW5%PJ`+Lk@%HJ_!F2c5?iHT_
zuVP)7{0m{4|Ce8>=JkJ+{sxb1A=kllll`A0eXVc0;^$1>{Uk~L&)Lq|;py2q*In@a
z|InZJriZ)xXM2<6hE8`s`CI&T>-mlA*FXO7dh%iN_et{M_Wr@q?DWIr`SuT!WcTQB
zHl3YL<N%*NKRP*04z~{`vt(^@>)Ea3h8Qb1^fc(t@{Q!ij($R8J4Z+R8_DE!_g0cT
zem+T#4kyXv#qQ+zbb54{OlQgIa}lDa@=a`7TSL;x{c^>P;~R2D(b()rzC7OF-j%0|
z*phEfPxvl5k_Jv@@`$^K+SdNj;j`rAOdfEW{CIS>znAPxlEdjPXMZBg{OM0LCs)oU
z8_CWY>WAwCH~u*J<NkhfHj_J^OCM&>rw6y>o{z7;w>J@KJxRhzaV+P=@cZeB{M8TR
z=_lIc;nCqu+f&KuPsj4O{pt5I1N~s#xTV)_f3j>0_-J&K47FbW!}k8y*+#xmeEUiA
zAKUw9G9E`y_3~%aA0~%-QyB2i?mSYdKGT<x8*^>CKjSxOj<J+)3jJnpGMkE|u(usv
z_wxr^97m7VWO`4xH@H00|K|GNVm;YAO8!ffg=^njzjn$;x37gC{h)u|?f4-}BblA;
z%52Wu#~*(v{gxpY{gGMxaeDeZ%;`4MxPSEHda}JgI|^@g=kbFt?|!y*@4=nVZ%L17
z!G?S5z4uPH-+K>rRsNRaK3sYC{@urGbbtM}J@DG-+3qSG7apq(hfCy6X)8Q}FZDTV
zAMnXWfA_=9dw2e^`Fa0@us%YEM6nn~Pxi_^-V0?)q;K+cd%8c_yTOeMJ$rO|bTS#b
za?QQzjBiH$um`N@%{e#at8RK-ubua=t#9MsckzWcU+g~LK795%-g(shNoe;nFMrYO
z^?giCA)D;UJjypy-B4$f8`i{YAHCtRIt)vnIUY;*mx}o9?~x25BOV=}olK9;W;zvT
zCrDOlkb~hzkq#nqMHI>=I66+Ylc$p(Lj$K%IRS3@Hb1`h3#TYZ0vV^Lvb`s_ht^D)
z$9jwkeU>I4e31O1mmWc{4~wXmHF7y)cDrxLJtFjQ_vqkQUN^3YA7x;CkM%Yb;|~Ub
zsp4+_C6=$8RZAzf6*{I?1(I4008Xp3<Gt<E$#C7UKVJGlwzhZrW|L1p4U0Iu=0-m^
zG~Um6vM0*~ar)y4(p3~9d5%5q#xL3H7@gs{HWB@pFB^iwmhm<J_K)o5r)T@g;y_qm
zda?L2naBdU@G04nr#v~FEq%`6(dpu|<_3IT8tVY+Ch8aeRhRzK1v}mos}}4`yD@rF
zT&n%-UvkA>VOhmdc(<@#$HI!gzD$06E@xx1madPqu)FskZ~k@j;VNxx(8E^fL2+#@
zC~4#M{e|f4&u?z;?fvrQJ(~8Xw7Vtk{_@jzIDD9Zp}+me2M@{d$>aw;--fgC^{R2n
zM^OvjIJZNKOK#<`&(3z<$goShZ)Dh|-M2mLH_sh**P&M!cG36W%xXV;L#zGpt*`bE
z&R^|^S6S^xC$C$>w_!gzc_X7P>gZb@^#4A0&|`mIVa#9nL4S>7{^AV{`ir+e>i^%l
zqyFNeVPATHt4sgU<A+Z^du(U-dOriWY~&(QoKDVmPrVMJ2X!`fr#Lk+ep0wkUM6<v
z<Ig|6J=X!zPc}t&80l00C4b+P@pu2^FE^Hbouub~z2xp|<LC4(tawiNdew9KuP^bO
z^WP^q|9z56zfWjjEld9Nr$lp|{SBjw&c9~v+vOK8y>{W!ungvA{x1(c|Ie`S28W%t
zh>!QwuNiZ%X-sysX2O<Hqx|e}rXgN$nG<0>daA+a+4{%+udmZ@*9S|TL7ab@G-4M{
zza2!^yx&oM)g~$WU-S5Dv7lTp-GyF<UOpthw-LFv%5qqCcW(`?7)39``e6P>a;Cw;
zdH6w)!)Jy*cu$PEKdjyRtH!J!e6jV_<A<1+Me^VOoy1S2pZe*#h&9@neLp>3yHS@n
zcc!O7$R<a}lap;i2s5>?W@pF8M<?bfx&9tT-1TdVlRV$q_a=vX)2E|A>%z-fK;uji
zQ>$JsKpU4o&^NFE)Cdo<SjR?ky!s)>`iR)HzhzakEHxhf^V#Zl<-6s5AKkq23By%;
z=R9I>)gwlCubzgmr(_h*nS@nSFuM6lG4;5HH<o-lj;QyuwdAv(&z60-x2(-K6m`E;
z{P*BrSC0MibAJ4nigwvt{Ffqe@8Z92<LAQoZ+|}Ce<V9(^WmdwMf~W?M}K{E?OLX@
zczs@5J^0tw!R*=Atp7zc&iQX-f7$PA{Wa^?_NRy6-zJwsK6*AeT*GNN-QD0O{m<#f
z&>$hu!|&G@0d8`^&h~7&yB?mvBX9T5;;-2=2OHDS0zDwww)VlnzeHcU@#JuD!1mv)
z_u&wQi1nx-Oar-M_ehpUxLLHi8wdaDErFd$GC4Rt{mI`&RQT|0f1f)~Pkwqf3AYAo
zB7VBwx5A_4z@1o3`d??0vk7tVp=Eu$<1=k%Bl$qy@PbZeqfUxqbGl8?T&DG4GMjBb
zo6Psun()2V$80R^ZV;RD{e_*2Z7*y1qE<mk=}lunZmT8$2Cknz-`hHw>`taXOis4g
z@2BCc+&+00*T{!59G@m@_WQbg1r~A8-FV(Sglw(f6v>CS8P*+|Y*=j{%0F^Xcp2^L
zwb4R2It`0q=}R9@q}Tnc-+yxNo=(iQJ>91-?4~qe#@tnm$C6=~iGK5X2SHza)qB%Z
zd&)7t9y1Q1<3Z^ic7Aw^r6Y4Zw<ALn;~ja;#(6DvU|k;?)*eeQth^;7wM2xRK0ldk
z?@jjRqzI#Un)J(Q_`n8s_I1A`zFio&Um|YoDZA34)5+Qg{li5+Us%~<>)C*>+pbug
zuh2m^WxnnHJ%A$4FPMe4Uxto-cO*Jf>=mQ>3Xj&i{d4>KU!J?iFRiTg$HB(<vtfR9
z0sPtr@vroADg94m$oG?zH-!I#A~0XX|K;!Wzqj#ovHmw)Ff0t&c$1UE?frgTaM`^4
zw6F9ZweowF@!{rIkCHt8{rK)@|NbZ`M2v(R68puH11t?-Bl%7xpj}~N)Be~94J;Kl
zJjzKL{r)@q{yV<cJLUKOf|0fq9)^VIAGY2<ExDO|7eVk&blY|2e3rg^`o5T$-^qX1
zE$`|(J*CFyfE%ayoO9ZKIz3t4^vi{GvE{Fk4yg6bx#mRz>`(Ba-0)|ysO_tJy0o3x
z&GjJ};4(e40bbec$z(P;y<tbgduNAO8+OOJ`7W;Kv(aK)z4$I#ZPzcoST<I!5U*e_
zEQZ;_LzgzhI4_tZt0w(YJ(-{Dr5#x|-IwgfWk%)lok>1QvbWHoS6*woN5?;1wAApl
z?kp~~Z7<YZbMn=WSVpJY=fBp@E3Uj{L%j1EhWE1lh$CWxW&4-Dwn*pfHN5&8e(lvO
z>e6bh>-om=k7r9h*OeK4iI>v<zB@boe(UMUWO6kX@B;lWP4fl)udd(ee{bc-sdqBT
zw{~y*Z#9Jem;PL8|KmoQZ5^M8Xu667IDh|FRa(va|MMbE-|hdm@$-x9zq8ZnzFyS3
z{wIfL2O5)n@b8=Vw;uoJSDRb+AKZuG#C@{)@Zp1pb00mpJN^I<(D;)t?%aDc*U;mK
zPv$<k_m_uvKKu90$Ky{QF8x%m-CT0z+-ILXxcA`x{6}AYd1w65qsI^L-v8_TOMLm4
z&4<8lj=rB9ZZSxTyO|4=9B-e@@UZp2$R+c@pX=B9@2-7lzo8_#R^1<@$7>Ar+O^}O
znfq&ha_IjOwbcE&d$fN$_Vo7k>+_xauaKPe!{lV=XvVF(&$mymeYkV>^mg*`hshtm
zN&k3L*2Tf}a9b1}fMi4KJeh0mpB?Oo5_I%5;ofagj80}?wsu7b9X``0$hwmzN4Jk&
zW881;cK`DBuLh62=li;St?G5SGWk${*%*dA3B$TEnk)Cm#&r}aduk#b+US4Zr<wkD
z>D%y!bWOE4ZR6&jt^MTFWITU2{~VtIvcpeff9DZke;b7GkvvpBvI*@!!p!(I3BwaU
zls?F3Hn+>hWO8zHbTT(6+G!B>e;D=r=AXmNhg^BpNzIo&`*BL*``W?_>7~2dvq>^1
z5I&I>aPEuJy!(8zx2Bv6bJwYu;KCr0^!RzYcH{k@&pzRQiPNr!<)lfQJpYsAM(;&%
z1GJIEfl;5tj`ZMr`9(I{_SydFB_B6DVbu2caq~}*ae8w9$)nBBlK^o@WblV@$kvZ1
z)6>b;)4jDvk3W|;-}>V2z0La%g8u%&+)T&@`8qC+Z(}!P_K0(i-{2c{=FH81Sopdr
z7B_+4>FZJa3~PX-ltB)-UdiVcQ5in8m72OwY&rW+!qUy$N49X&Ro&Kzz<jrdh3h-?
z2kVh7+CFCHF4#znp5z}}k3YNf+23q=nu94mn&Idly?uN<Iow+^W`+%8B_<z=@YE+p
z86j^YAMR^FTNxhgLL0MDk3a2u{BJ{?i~GeA536BWhm%i|lVvaGr{SaI;&yJ^2#)#@
zw|j!cY-{;oa<GeW&Qf#_k+mrAx6waoePMZUT#Q%8N4+2m&#+9t6{D{UT?Tde<oD{w
zwMUQdJmyTk^N>S7{Ao%?_~ZUY5`K9Sf4k>?y%(?jqW}1dJMp)B?$<~D_sw|Y<Nou<
z594o7+^_Chr@Dks9xi+`s4V^p_jj+V41b!M(*OClI}aa?|J>Sq^x2)SHs?MZdT4)r
zKKJLs-=A-|ArER$`1{MdBJ<n}Y~J}?zTf)i=EDc^)6ehz_3mSL)#sa^-Ic}ZCO}?u
z;i}Dld^P%G>(Sl6-XDK5f6JZEKHL22F*#k9iuP&Z7RsPhghLoPHINs5_L(#<68W=D
z%N5s9_2_aHVk@uD7OqFao!k82W%~IHULz+yN87r`jC^%8oA&$($J-)_L`tD)$%cD6
zIWbRL0BqXJ|Dk_-8x`B<DwTEzEya!+_vmkFW;pP*p>QLow;N4P(ra-bV}qv0^xp;1
z?@t2vt(^kyOwjN8r|*WajXwI1$sa#S?6+@r;;)DC*OU0`=^wRw!`a-oA^N9%F<u@b
zIBqY!{&4B#_m^M%bm_%kEWh}4>BWziU;Opbi+h2x{GM-@-t+L>d;V+nb2gXX@pAQ3
zR^0K)(mPbJEx%!7#SJ3*mfvt=`3(ri<u}}1dV@-~<u@!}MPBwTzb_kBXg>T_48N7u
zs{K(7AJ@Zg&G1`0{MIe)ipj<KPB<O7-+&g9=r`cVX3`*~ik=12J_^tczwJ>7hMR8s
zi=r&ph|<x5rE{8x#W-W9o!F6G>V(ckJ)iHm=mx90eY3y*ay=dowF%eTt2%xElhqRK
zY`JuK@;jTi`%lgpgZ&j_aPN0F2=}fs3ctf)IBy)TaK?`h_TjuthEp&Z&bDMYvy#zS
zG(KnkM~?Nyy-OCIuM0wNBotTlXMEe$gyI+HEP?IiTGYZ>|37GQmJY$4R~83id;abQ
z;XGk5TQv&5H^qimI%gavE5~6$#r_=(#OAx>;nz4GmZ;3;>-sg6=Evu(fs^Hi^TXfS
zR(SmIl?{i-4}Wi#gS^oz%SD{7zrSI4Cl!BnrMdU!|5{3O@9w*#4<uQRn)uba|M2SF
zfA|~dzBxg!I`+Tn!g+Yru0Q<MyRL5GEA)Jbll^)f|MJT_SL%3(=>2LP$4!3DVe`#5
zE4}L>*7zz;d5b14y(4{*rs2quU$gjY9)B(3ujMEH&MJOU$6uTHYa4&<Mt5$<FLvUu
zyYbh(`0HeJ=hNYfEOtDL9nWINv%=q*mGO(%@ho;ciyhC}(VboVB6d8B9nWINv%S%s
zllaBc-}qTQ(kS98S*b3$wRp}#z7dt8Z-!q#9)63O)S=gRqAImKfOk%mX}QvFA@<*y
z!fG#d&furRFuu8v*x*iFn9<$gx4q%FiNEQo|KrYZ&0mJ!J{x}feE4nC-}J>fll}Sc
za<)HzH{C0y`*%9u?<RcZg#TV={N0pa?!f;aKHa93U%`5b;J{zYd{NNO`KxrvB)&uL
zyx9fi$M>AcxwU*m3@rKvhQ!i$&W~`sLWpDaO1+HLViW%>3)qEq|G#@m>@|PwIhl+5
zMyT}fOiH*n`?ZIBej7~YRf2f{@jt%$y>AA2#dBum<}g4Xtr{SO?=L@He}!!nvj=`>
zyQm-OUwaGvFB<OOn#}rLh#vnE^O>Z|8)!wMR%g2C_q$}d5eyHXjZzXn`snuPvmqyu
z&V;H^^B07Bw6AVN?Bkc7d2(r*Tc75w|AboK;iH)8c6;?5M?2q5b{7*m*KaRPrn7sL
zl4f~6UB6sM3*(ke-s=2b!|=|3+=I8~KM&}I`Hu%9bFq1r9`imP$b}1INVYEyvT~%B
zr62ov`mzT6<Z!=RkPFF@a|?8NYNIuKygfZxJ{d!i`^mpnPRMd|n~iwmD`~i=lvOfM
ztD-tPJ((UVovurrolmn|Uy%fQrS&lcZ7+P@yqJBtVk-O!zF;cO8+vVKc2QdKvS%(I
zo+00kPwbK_z4E0-dC4&MA?Ax8y8Jx5%sXG|C|rWo_{6<yzkx?GeQ_MlpS%^a@=6=W
z;bC;^+@b9yd*|!7xosXU%A<bZ7T5dgb-jKiiL_!@{6dlRKxOcyh0=n6{GIN*%RP7X
ziMed+E{@ugr`zLKX^L0a=$o&7o3B!EuD;JVFI<iP^)|P8oW*5Z+3&?=O3TA}ooBU(
zxQcdi;n}!+WS$+J9wqzRJCl7QoUzAV=6G3p=arv$r3ndXrK`tt`LpH*^}4&@lb*21
z*muTe7qdE=p(Wh(-_4E=x4fEeyaLnPeSs?D76}Ew#ke~@3pJ`3n~y(C9*03YNwf=Q
zDQZzE<6XLT<G+$`ZkQDQ=Ef(<Ka!WqrZe~P;Xn5GSA28!kCor-uWIdVf7Mq{|ADc!
z{HyJMto~~MAFIEbt$G$SyyCmlf1Iso@bqNWqhuCWwI=hs;;V0Nd~^8Cjg{Yh^YeLM
zp8X?D({nFK|8da;a>WG~r2klT!OayfmEKzUMY?Jr`06A3&X(?1y6nTc)pBSo-nef4
z&3%jUvn3yWl6;+{OFx%Cw&mY+BgvAN=U(xN`#${hQh#|lw<XWrkmDW5cCfZ|McS_{
znf?Jof3|g?!rxzi8~&x+;rG=3$-+P3&zt=(S$Zok+^>_;|8aBl*GK-Z&CwsD3pe`<
zZ@SiRj+(zYZvW=^0XIiaxH*2r&G9q7xuHkLH#hn}lW)G!|9mX}+mZhr%KuK}f2Rpc
zcY9}-f3wdwzex0+(aO>_rRV+++b3E}^iV#L33p435odlj<o+G`{p)PwYx#Ire$8KQ
z6yJW!7kl!Td??-eglT*EGAxKirut9`Wh}3Us(^m|`1&$qQ7^YhgL5K(N)eKQIxsTN
z^&fe+--by(&(v<D<l)-Ddo^6GkB9{DjvdW9W7k9LH>%O%sh3BpMQC_wi~3bxYd&H4
z^ckNd@6T@ZJ#nvP^+LS8vvSOT@reI|@mBNX?F{#*>C29{$=EB5wr8_e);1%z+uaG(
zV~&ou|8+K5&X_i@VMcZ|E$Cynj@9uIBb)M%1uamOC5B_|vg7q~nY!iJZ&md&HPQ9`
z=-5f~8~@j&(EoiF{yhl)?)887zdRd$IT(KFKiUre?u38CQSg6X^q==1Y!AQe48IH?
z4OjQS?7xT?y@(I(|KhkBY8GvuOb)kY$?k0|ulrQEoiW_>-H0D*>P+PHlSO+m`@~Gq
zpuo<4h9%GT;PCWO%?!2eV8z=#l}XiWX1A<z(G6FeD0cmNh(mlZ``OA0QDthO7D8xo
zymew<Uz&oPk9&JC-TAuE4eve)On;%Y)pTc&DR#-qmpR-%m{90(C%o0I^wyrNy_2J#
zZVc}r-%=S(AJP}`SlGJr?ajRtoz7UQ!w{|N(aulwMxSYq?8ndjx9`B}A=Oq^kL$%z
zocXFPVK~`xtK@Yo=&~S*-G?h=aZjG<HvL*JzT67y@6)aS-M32$yQ~zp=Sf>@@Y8Q@
zygx%T88^Q|-u6zDD^w70hUA9(ctPO3nbM>0etrW#m*RiloBr@i3cy}a{{iCn`TDO_
zTEF9ee;Yr)i2t2+v8?!)e7-e#@qAmxcKU<4)l`m$b5g#Z&W=#+^4r57e@dt$n|!GM
z+)h6FD0~r^d!@zc;nO3#TYtShe2gIPKi%jXRMFTU%-b*E7q<4p_k4{K$#<h?hqGgJ
zkM_w#?ZTVvLA0so)9}}ymOKmTI$ZG4r^)E``i}nV?C5klImEEwg?5h)L|2`x4O-0j
zEoo|W^8Bm?Y5K1=Vsk@J;sNw`Ox!pV@Be(Z;a^ApzA;?=?8tRazPmAubG$1)?+VA#
z*5Q$y{&Mfh_TlbN{*anmOz+O3*ZOlQ`TzXr==<5#Pk@W$e^ICN^?%Z`cqjkg#?OWF
z-^GFw*1^`UTrfdIgjmRkpPeh#bZ?KZ9by^bVr0S7vqO2#(U#sLABauzEW^Q|zvW&+
z@J;fOeypwZWz~EWkxlt;4<7vcn*VA;dp_IRpYH7H2jiOIXNP<?+0*V0op+Z<TKlCV
zFfyNtjZv@G<c)G_iTzFfz}+Bb%HgxgP|I39m$w#60lEjt&G*mt_qqA#>{MSxWbWSK
zAE_btz1_T`B;CdD^#T9BoflJ|-}t?_w~x3!-~K_Ypcj+fGs=g|ztm-Hn$bK4gT{}*
zyQ5?A=Th?DoCR8ZQ_RAnr?+O$U*#DW)_-e?Ir(3d`8)mpt^B<AhmUurhab<LU%x(i
zaeQ=gn)H<P5AJ{Q=?!LE!xtO-&vfdyX4?nH`;$-7cZK497eANU|2xyuEv@x+H5KrJ
z{h!OWpV$AYvV6Dy-^R}`vj2y5p%(_7Owa7E9{fGu`fT&=y|vSgWTus9PNwV0-cj;j
zV9CC5afYdUcl2X^TOnzDbDF#ef9Rj?*Puwe_nx%)-g}Dkk~_C{C)0iVaBYbvT8^!=
zeTqiUHMSxmc)Bjua@)r?`aWFz<Tbf7TTlM<r(`O9u)p+Hv=BaB)hm0#%jIu8bTWTU
zopimVQ11H1&`0;x>aJd*r^|+uN4ef!rL!Nc=<M3`qilU;hcD<akJQRjx&)=yd1b$j
z##JxH8{~SVx8BUwwPUxF7s;PKb)B*W-FNoI&|2uk#qa(?-qo%hzb)5o4DHNE670n{
zk{6%8FDJK5<BKo`!yt^u<7E<%vg!Jw6EAk@tS(jKp4-`HA_wYnOP(heY$RWN`Irk=
z+9LCf7Wt}1i(DHma%)sBylkUCpDk<CoNF72y0m^iyNYSCI3gR%zmQHZ{X%;7n>0Tz
zb^fd3x4n!1?e*7xO`9}ZsQ;Sh@9Mw4m7mM{f7H7Zg1TEcgSMVcPDhbfLe8ObU@wry
z5D&Zu=H4N@ZhfdIdbCdvdcXh>rS(Vv`FefM711LA?2$uIR<7JwjPwV1_xrQ8^-td4
z8`W`~i~A?kaL1LQKo{$-<ty?a*NGiEp-+o%y7U3>&qBrbQFGR#(B{i?hIqDmh~?>9
z@!?jlaeII3aPp&7D*crPe)wqUjJ|6`Tk+xg73bw+0`cSdu|_VKr14l?YND33yJDi8
zY-CGpO~pK3)8X~sjJvQfIXY#d30l}{YKq^o=5B19(|BBH+UZ^`U(w&S?e$(UIQNaV
zH<GO__5W@0+r7K@H@CLdFCLQF<%UEDVBr!L&_yeGVZ&T@plpg49`_2v$J1n7cFrBa
znH#~KR~W?8=dAj3me-OC7Kijz22WR+wR&qjh8I3chw_4vTmC{}{kg$A@5Ntb6)tIK
z_UZ$;>dLDv&0jFOtNQTjqdr=;=MVg=F5c)N6fsRpI}<nH_C~>jc;V>TNpc)dsD41U
zcD8rFKRwyrolsYD)M)Z=NtS#<j{fy=Ok6v*bGo&ABwE~Ba1sm$!DfF9q)BXh@hH%0
zwnNG07eqi(ci<eKo@@bP0~x+{ya<Qmmh}-9?))w;dEfI6&Ecv<TevZ|G-B~%>vdcz
zOD3&96<8iC=XBL(Trkh#g0h0>iZT0sdb~A#y7mWI1y85uTh<z-tInw&p?85e=|Su(
zg|Rji0e=_l6K&2x<3Ii|ahrD|`NQIlwmgAlgL>J%4NrUZ&i&y{_HO=pm+M|X(hI$N
zBb~eCyp9*a{H(r8&q5p8$U|A#N20IF6VOvbF3)ROh~t&<8elbkSN<kF6YqZB#?Phv
zKY9S~?sHsS1qO7!|0k=8MgLEkz4QOPm7mM{e@q9vjwXJv{bDPwh$wc3h|b~u<i)AT
zoLSV}$U7*%_1=b<RxoaF-V4#Uy2=&NXMqe4^@$+Ehu$xA{eqkYQPLEQZ#C1GC3Pep
zCktsEmq_ZE-3r~gmEPjU8ym}VIxfoS@ZHmVj+}gs;Y~HvGB<|j_Hs$0$1r~5sj)${
z9$u77W37%xG8{|u)4eR?%E=p_;qJRK-;BKQ^l*<f_`|))3;SMwHKoB{ECaJ-9or!s
zZer|y)^BtDdu@F2dQ6B4SIa1j9w2w?S2>^BRiqN?)qjeeOaA-6qlYZq{HOVMv)exU
zX#9w9-;(DTrr4vd7M?p~{oOk{I>r*)o1RXO4n@7_;aEG9Wb&`G=?~koB2GgWK7Buc
zg7wzenNQ#U`7Bv`|Gl4ItZRm#PJo}R(a4RvcFv3cnw^ZjRO76_e6%Lq4MSJQR}k?Q
zD^;w*<Ye;0M6*~&6Sn@z(CMMe$<3R8PUiZ}NBxCMzQ55wf7xqY)aP-JR$jjDr_M~)
z#i_b%TYkL!a4a1!KcN4!#%tLs`Y2od3_{ucYuy)t?l*iK88PqolCxuMmgC9E{!ceX
zPg<CoUP%2}#C7s-@g-*Y+1e8EaWh+&ZX}=dmt^C`EuX9}>C5Sn_BGK*-Z*!u49^}u
zy7?BKao!U`o<$<2-Q<Et%r~pxgC(Q*(WPJMu%Bo5(3jDFb&mL1Ci;5?;#K9)qCaZ>
z>>uASoIb11NZ*%N+T*sKFPz#{OV<y<rB~9cF4i~sgmc<IXQiHtkhrWybxauW+HtQ-
z9c%ixexa$trXd}xZn;c_N<K=yy7Sk~ph<C$sX}rGle-q~j_OmmWQq2~H~H*my@KJ>
zV9ivMtA@7!`@a|UCVPYa>UpJUq2)zgY3?Dftb}mW<#Z4m-K*+J$Eu6}N`0F<*uvFu
zqF2b>{_Ev3pr05y<U>a}y5l*&<cxRMEgbQQpT4;bcTPWDN0wiBz9Mvq`$r?vzw`1D
z>BsB0KO#$3M9_2=Z+Js$j_%xfEr+M;Vd1yE*KzEEY+;?g79Au!eU+y3#-4NjQ(j5m
znQyw+c>H*N^a`(a8GUC_p3IAFcSK%Ns4UlTkfJLVcz;-po^`qHda(v`&a#|)wb!9v
zEMJCi`YGo=<BFQhkqq|J{i7ef5;L!<4r;)wIetv7nY*J`XvXXFJiS-<$Nfil|GD{S
zl`<X<=im^tYm=kHq<=X-(o3HA&nIhNJ%0H4-7mh_`tr^{*5CXCxqj=hKJ0ZoX?_)%
zmb+vW(*;F%+<dC+RA+~?vtv@1CVRS&maJ2|ec8CZ=0}W1>f*Ln4UCt)y(pSrVPDP9
zLzIJalknB0=DWXr>FRn@4;!znU;32AIWe)bWcZ>6JujigPg=Wo=iy&B>ELJg?mT)F
z<iYy<s<?68X=F=Rhc&-!a9?v*lD;n&bY(R3zqAi?6LBSYy|+<EAo^8b3}?Z+`1O^4
zE*1a%?(FdUE&cEnGk@*pqWs^isu%G8#XJ6oxANoif2U8Auag@u{-6Jv9I_g=o=*4o
zU)~Uv=*EleM)GZPJ2`zmIlP`E%MyjRcjTi_421LZ<m4#)%F6jfSI&*=Pp9uT>2L1m
zQv3g3C%=UL>mvMzZ1#Enm$WF~;XmHW&o9dVm36@-AAgwKKRei&oFqq26S%Px0B2J<
ztdr?s@^yaeR$hOrShyZ?dVll&<A--ef$O;W(eeIth}&~VcI#Gu#ro*JM_=8$`*`c_
z{m(c5kyO{OL)tIjK>2#Md#aD#n%O_6N=)NF7RBRVCu{cQI;dD^PZWJT-4g|3j>ra9
zv90hL;ilxn@b?()vXmUP@4n+m{nrVA?X?d=BVSLyRc!9}>U4=8-kRbN|Ks)_MYo#X
z9@oRro~i1?U_oFj_nq6z{xcblQO5Omm+bU+eZ@2By<84GCmG#~FJUxh-wlP%MhgFT
z8%Z|!hwjSa*~U$+8lx!8htKvWHz)g(1GvR>`2?Nwhv`h##qr5xcRHKw{}i3pN3s;c
z4Z(f%s_zn<Hvi+_38pw*ST9ajtgP(_PM2QKz30dY+jm!X;5jd_6I?div)K3Dvy&69
zyK?_!Jbw5k{r^htSFZNg{SHgONz&b;kfIQFSKp!j{k~;$jRZ))C2t4x`?BpDukqH?
z!p;wuZSm~i!j=#7v#Yan^UqU~BEywy(~rJePu?FMf^3Tfgq!_T?Ij1(*}?Yd?(;wp
z{GBhC_~thDc|Gr+^3n9>cQ-S6iN4#TcX^#Jap|4BVx+TWBYo~bzvdl!(KueEgUh$y
z_R~`(aOSZW?8CWZdex>J#vwcJ`1a3rV*%pw+hxnl#&~hpF5l@(Ui4&gaP-4PqUQV!
z|0}%lTb42+WL{mcyaAap=(I98^1s-r%XMg&?&Z7e<tv{YOV-oQgjc-e&Uu5&YSfR*
z@1(bTc=;pXZ5#k^;1rXsvHV<k-6!xbJG_43A@Sx<v8$b~=c;itY~J6J=>``zEjbgr
zFBG{rH2N{GKd<V!yN9)Q(PA6b(!O9h-yC)C{h|3`4UI4O=xQCB-vZ0kkb}wop3UQL
zUJ1eVVO@>4r2cY0OdG+25*t{uVq?FxZN}p2O|Q_7UPH_0cKR0%$a%d!uj%wP55udr
zcctK*S-l(MPyAY(`^t2gxerI@{@izNH@yqzy}h4H`Tu{Mo*qtSS7v~}!2jRWWj@dU
z`HuhhE&W_J|1&IsE&1+yD_o0ivgFgFlj*bD^LHKncqoEm;Wq#A()*y(SaI+CS4;1g
z1%3K_@m~M2-8Z7SpKbr>-stwickZ!^U(WSw@dEeoxtPO}(bQ1OuG|rLz=lhvA~oY1
zfr~(xjxUPe8(MDkT1!azN1gCvyQ&vU9^h`f=n3;P_zF*%yY-?c`T2gu5$(S|**^SU
zzSe(q%gmH1V$kgL5kvpn16LG3=-UMbx%j@@8%ZdYxV^DBsXN2BJHGI_h9$Od{+T{*
zBs={tRC=*D8Z+(x>uh^p-^U}T0E0k$zt)bnlTSY#5`ecOd}!@x$A7cqQ+j8oC%f_*
z^6bD+XTPkU_tL$M`|2;R^YYsofSc!zz`X6?S95$bD3)%!4`zFZTkg%}Pby3%f4}?q
z{^p}cTaO=oF6!ys$9M1CyZg`0hly5}T}rL9H`zIRroHVO3*&__*q6W8KJZUjzrApw
zF6Z%8f%<6Kg;a=OSm$q88}Fs{?1?oJTd`73G7vYmZxCK{wFZ|wY!CwT5Bgx+U(H*d
ze?@5T5^bF~9@*;{k6+wKzG6^CX5843LCvo`s5=)9>dvJHb=j3m2Q_~kgZhgb$zR9J
z6bmzRc6jNv`5RwxuWfKH8k?QpupB$j`R-4?C30WRxs7D+HzNJdk;ncuR;<+Dpj2KZ
z3m0E#nOyoUOT=?_$rVOt&We)-xA@KNWtT6#GHTklm)IVC@vyn6k!^5ecX4WZWl`R3
z_m!q-*Wur-u-3RIWA2)8bHewIWar!|_D`@x-T4P>Ub6WWlez4L&za22jx@omy<end
z?Y;4_-FwqxyLYvXa?Zhh6)}6!Mlu)0WsVoyCfobJo@w!`%8*}hvMt{O=j+Z_5dN$6
zxHr0ywtwkHdP7R<Yti!F%tqQhJDK&2wQeW9rERp#yXoF(!O6Jl#?|*MY^}vR7xvfh
zVspR3R=M(KT)2O3aF;hiTC`sD*0%M+&5Qk9Xkke&-`L5xd?hcs{a;Z6TuKDks|+Ku
z_bW+)bELp>32^b4&F{MlcKz$ycnjNN<(62r4bD4#=GXFyb-Z%zzW!x-nPnCO2XB9E
z&Bwvq%Z#E_%WhbH?ZVm`-|@<8>(U;aU$6*W7srcGzgV&e-$17?ty8@QU)TIT8NdJL
zino8wGX4r<bn)U_+;x}6w}j?47C$oI(2~!4V{7?$L4REK<^0LA>>3jbZypJAIsWg1
zqodR3v(w4(l^`G&<bPLrRnF&sXYcaA-_Flv@gEk4?Mpr;aYby&()k(&>i>#anvXZX
zTI0Ko<oQPOVk7x!-Aai(mzDnL%Lfl0|BXwozjt;>_NM;Mv9&-09UsE6^6VryHexT%
z4j`>I4)Fz?<;Ne&zWOkE{Ctx1x09e6TO~{ERKEQ>y>%=5mQe7s5Eh;#*~j^<B>9iY
z$@J+@+RW+m?Nhz_>GXv>;rNJRH7Ao}s-hpBYVzM7XYoN(6y@ZAY7lbgp*EqkN}3+4
zGE6q!>9#cT^yKIuJn!M;+4hNE(qFrg0NhP<e`+H`hTF`pK~jqpfvSn#9Zt5TN2jA+
zYGt#HWTsbWBSSY2wtpfU?&#^$WalUH;SSE^Y4UHJrmg$@_fc}Te>}Uz-5<-zes&Ph
z#q&Vqh5H<OmAgLrbbjqjzYP#onL}!<{`>#?WG&QKb&dVyi?6iW>W8CG?GYcTPeIm!
z(KjVGm-NDM>&Vi1CMRFNb^_(e-F`?;kB+2^vI}JBf0!I5+q+s%he_dO<=8yj)#)Db
z+DN1OeWTm5<YRl27rT?mo~|gp1E96l@z6mD`|bEd=H%(xjrVU@9n~8;-U$<Y!mY{L
z{`6pan!LZa{>|Y)Uu<uyPhEKB_1p6x^mF#t!I7LsM~Bnh@dg7gzxDjQo#l2DrGPXC
zR+i?_p5}Aw{@O^Uw<foe>FF$)?H?V>rkrUjhewAu4`tn3nU&=3p*)qkB)gO3NBMtt
zh^+17?Gp&_Paq1@&5%5s9EPM@ZDz*8)lGUlo$OA2oI=SKo|8N~nQV(*s#`IEo?;`}
zIXk5swK2H;>uh>5iQD}7<Ydw>bsK^!toC6Lxp~=|pIea6H^Oks;`wTL1x9BWOc_Fm
zujL;mH+Jp0PPK0jqMz|27rJ^g`!=k7x8=q=j=IYCwndug{2s_r8BjCXMKo>h;W`P+
zmQ{G)y~+OR_9d5?P3TOP!S3n)PqMalWnuyLutE2e7oVoLs*Pm(aL=epbY1ip?@i_}
z&TgfHj91|~+n+vr&b2>Iw!fd8n9#Pxp)yxak6|vRr#}Uex=p(A_8ud1+AmH^@MbeW
zco)|BX|lV0CUdI0U)8<78rW><YKy~j+2xmfoa7`uEPVdH77)Mu(j2bnAOBqB%peWs
zR<2&-XLCr7d8G5D3uhQOk#}+C5D)3Cl<L`9LR;r=$jM&4+Q(zlFCk8m;j&eW`rLtC
zvP&51KQH-)v6k;{-n{adhOXXBUeB2J3*5%E8pc$X`7avNtC4vv>TVm$zmC#v`S&J2
z-sJ?mnV-w^e?2{!Os+)#bqW5jYTo`!>+GHV_cngs2LBf;=N<jmZ}aD({U3xkYWBxh
zeFl5HX{wd`Uw-EEf3iINKS}jEUv$;a|MLC+D)T=JC1hXK33!40&(mVQ{$G(c@8thm
z`MH??EjabQyz`Gc_wN4nezLaK*ON2tI?vZ5uiM?nn-7y>(H`8{o(11RDC>NB;tDC(
zWe82oh9bqMCmTus@p*>kwwP>(7-w5z^(lp{X9hnsc6Tue`^z?x)1%Yv{W*KH@73&U
zeS>e8rr7h1Gop@3vX-w2EZugzC&Q!UyY{x}wDB|1$NQ07{0?P3@D<R>K7n7GRdVv|
z_E6YBdQ^y28Snn!1N(F>d&0C7>J;lQ{^(QRu|NMgS-bbwEf|0we6jV_<A>^6yV*bd
z!dJg`?NGaO7-owRHf`V^Tl#A8S?kGv4=MNkCI8%f_&_@s2l3z+w`3zG?|G;NU;?9o
zeJbYL+OU3QY_j$KJ+AGD$@INl|8mIvzxe%W+xq?oTLD9ZaS2-zzEx?N>-YStg?E@=
zQ@&F#U&$0(UH4aaqBpgc?4WnX*8iHHS2_QO)%$Ss{+(A)0xmlL>vG}z&zthy`TsV4
zE`9#rfBd(Hn|D5clw|2RTbg9btv#(s`rh;@0lojb8BD{^A3f4!O`rzX--G2v|5VdZ
z{yyBBKGhH8xU~cL`ss5KK{6qyA<c68<k^^QHIzrUvSG0}@EXoFI3iEi<raUsYvtW7
ztzOoj^0!?X;`vg!!{sixv$Wpuu7(tRvEkuXUu>8XxuM`N;0g`=O%IcCBMNiS<0`)0
z`$@^!QiRaibSR@-s53EsaH;CV*DQXkbhjVMWWj{AJF~d$4UqtBf3g8?9G^@NwoiWI
z*V%-MV*K$^-Ix7{a%-3X-`}8Ytc7O}4_W^>e8R&&Twm53+>Jw@`sVdD319Yj96%mS
z`mo^s`@daZKGnKUNt%3;Y<_X)$-T$Ur+Qvd=3D74X=`~Y=0FtGPugN7W+Mz@Rx*at
zueD2-T8`i(x03c;LDevJZot;1cYaJ(b~Myr9x5yyJ4GvVdKTi`Equ4~*-^k$4$t=Y
z*NztpJ=2meM?L61J$9$B*P;5%l2qtXA9SfB0SL73i7p;Q&LV}<f`S&V^o(E9j%}~C
z541Iuu|d4_W7ZG3lONN5xGwpS?~X(V8=lZ-5M0r1J|2&^pohK6`M-O7d?g>y75qO<
zn!oe^yp5k%oqshSZpm-2@QjQ6|Mi0ZzbIw7ywm^Q!q1@p{pnzGaCGw1pRZr25w7;_
zY@eMTB~Ooza1Bg;O!kispRJXvjuW|Ve4xlJqL74$xE&{x{mJQs7UhqRKTaMKGUsO8
zN6*Dv-Jc#lyM?6IN7@&2_k~{VY@fJZt>}_mw9utx9g^$L?@)N!e24VDrRTzVXM&CI
z8#)VKW&ej0|CNJ)7smhcW`6%?**pB_Tlsli@jnanVc5Nk^!-ozd6oUIo<gxXtP<F3
z^Z!&$F~9%Iw0d{`zm=cY5dSIGDFJjn`7n8Kn9P2folXvB$&b&cyU&x|?ZZEwCI^!f
zfYmQfCx@rA4L#ImhMNPpB)?5(5j+}TofF#Imcv?6cYD*5)1MO4P?8@e@}Ga5O?SWF
z|LInee06s63~=tw<n+hM<S^O&X?K4z69fBn`b^rH(a`Y`&z^4YCl4NcNwLDot!KBA
zBEPvaJx%^DM(@#&vs>3e;CcGEV`+I3O}5qEpj+uJz4pe~o*x`Qu@dN<{VYvH>v@TJ
z9DVb8)y&7XhVQ&%OM2<TPehMq6TSKHXiXz*_y9)xc+G{z78B8r`}hXVmS;m#>wLU<
z_x^v}x!1qhkT+!D_NVHJ_(2-qb1^EbLLTEDx0eOY=A2hPKz6Cv+1wkS_sYpfB#2q0
z?A71<RbM>ZF?#yNDD9)8gY#y8L&s~h2HumCd=%cpJ64RB#*@4EAJ^s9XKU$;HXZ-0
z2mffIKNnqUZr$;+8?L+eWUj68SHT7RN^3L(s9s^Z?mzf)^UHIV>HnX-KW}W?MjprE
z-@n$Yz$$JnIg+fyx8rOb$4UKJ$IjPw+U&+%g_0<njU+0h<RfXG*Z#}_fB;DyK9Z(g
zX}2*60)qiC7z_r38M`VNsR9mHK3j;<n6CS_9lSh!2RH4Ul~EnMZ1iHRgC&T{U%7*0
zt*tP%jOcZ0zSWCu`)81;%&W6}w`BNZpE_w$Pu<=$!Zy`d9>q}px^@yg!jYu}zNgtr
zaC(Zh1b%pEdkNJE6Y0saE!d9P7LfkGF>Jqk_U6Uj@$u1d9Uf>9$dqB&CThwVl!y0R
z+6A?w!m~CtAQC~{MlLc>kS7S58WFW^qQb0^34vj%$o=r>({+AR{19dh8;1lT@xNHN
zVbT!UYe<1}NM}$)rrdg?H@>|U2b!!}XiPB8m}6OyS95u<k?OnKF+g1Iv!Y&WdEg<e
zIPRkVx$Pa`@%z6@t+Jem|GZY4#ee-KziIFPs#PF^%%z9)71q6Ozhj+DHoGnRv>wPi
zI&7!2cH^jBAKs5RX$NS=nJ9oNh#x;qxvR>ZWq%0IV6RasmGWAJTM&q$aV|;teHqcn
zj$>{AWRZCLl|4YOBR9BmD<?s6+X)~&ruA7t=E4xTri>r&J<|$c`8VsGjR2NoJsh3?
zk39${6zt>g$Ydeew^6~dolM8#Rb-ibAU-W#DTm}^h+rI|4C$T15|*sr(r_&ZHuo4s
z6~+(}N$?sK8#04BqH$KVAxWcDF5$PVs_@H9Z}OG&CK!dc-SMx?*+gSUegZOc>KRBf
zHmt_X&lfAE!x%a#!c!t;_@ID1t{9XUN%q)dD1vCyRuY>)V#3_e;;8u8TK@AU2Lk8w
z{TDClApGR-SXlzf*g8?rt)F7fJ5?4HA6rW$Zt9yva>}|BkVr7q+orU}Ptdre6V4nN
zyus%!!;U><i>%b^%liW(<S?)VKMawj;e~d>pDqkvfUGI}#_!NTIlal{11=K7F5gN=
zuMV9Xap82@bW!;d<~82Kc3Q0feX@mpr>SqO--5X3pe>PGri8>S*)=xOuqu<x*xce_
zFIaZm3I}P|&yu#vWy#u%0f)#?5eH2VMese92wFpq=<H%tE97;^6GQA-n=EnnQr4uP
z@XFt#wPsuFeS>j(fvthK@!TlALl~_-8Zl9ldN*W{nG}oi)SOeyqP*$L;z8=4wo;|t
znppLlgZLyjzfE5qsd~oEer?WRoP3=8C-vCFHX}8!Y4BAHDoM}wU5Rp@RKKQWC*4#D
z`07GrrkZlkqHHRwKMm_WH%Db-B9JO#TIX2?fC*SJTR)}VPO<ot6ALDHyW^aP+htV=
z-gY360h`p?)_^9~FcSiGHz#}S0xKi63;A79emYdW*;rW+BUEoeVcpQBP&b)i*+Cr>
zmWki4Gm=%0zCEKav^>lJj{<x5=2;L`OJ(`qw4*<H1cS*#n5uK38F!ZpW9F8u?*`5O
zuudZCmNChr4UCyX8gECUt=}J%%nYWDxS1X^6BmE{!7NP160);KM%tuJE=%>N^7EL>
zj%b{~uYI?*8F_#}M<iE%@Bx?4D{pWixF)t<F0r-n)^z8-qm;?f=*}+QeV-Ta()f$c
zpN%n>(Hh}2g>cpyb>{L9e%&vXk&)09;nn?0t%&hAQ`8%=#znPESnCK!1F0Cg3dcBd
ziMmY=n=-7U*2)K|UJG#=j<&Kl%<P#Iel%uBk@tJ5?jQPwTP4{1$fFZP(ZDc1pazOD
za!A8iA3_9w?xoRIIxXGd&_QAR0EZAti4r?}FkfevN&o7<+noPME#|F#0F6KYNwfd0
zuC31Of4|9ZX8-%Y{kzTlR|~>J`+r$U*#FilwORb{Z}PkKZ6E7sMQ`Qw>F4NEN)$)c
zfnL|S=3}yE2ZTn;c+t9zJ?V%zdH8DVwRNJo(U#|h`Gh`2fy|pO@29<9J;goalvBWz
z8^<FKyNoNxhPp=|u<DlLRx;j)cRp;j2Z=k8F*Fb8MjyOdJ(;fH&DnL3R&<26pAJos
z_==dnrOr?A=o4ME0%?xXVH+n}_k*9Tpve_f;za!w+7eauaLtJ{hPg_-&aoH2VR)gY
zR6JpKL^=B3pihjt9;#EM@mKzikt8&O{7Y<nZg>BOk1Sia6aXfy|EnMZB>cZrs<ZX~
zTl{Vp|AEfGWjG=HkmmH|<aFosq1?WZ`;Q<n1%$|rvIC2c1I(}me_Ivv%c9eVH24?3
zF1F~o)vws1$dIp1#Js<d<^}aMId(Rp1r7FeQqohva{N+`sq*vDK{0_L>+ik8Q>pJc
z_kj&{oQB(}bGkevHf(aUKZLpbrigp=$VqEkQLm%nPra_)gbV_<{e^$?tPrvr)}Oj%
zeXD8x@3U>Tt9u@AM+;DA$wr-Jl_f?$@Gm_ec!#57pa#~bfEYo~>7eqHwZQ{FaL%P`
z9<wJ~lRC2HrV>f(`|L=oX%mUWXq!bQEt^b~ko|o$F-9wdYb!}BX4~#XE%y<r42jvA
zz8v9XDrQuP(b-m<6O4xyoBk=#5_7LYd{}nHb2o6?@L#V9?Mk1B6pu!AFb9;#j-0tF
ze_Z;5s(IG;b=9xs2(e%W)i-WNU?A(JkPH_X_J_NCC@+tsT}g<wyyL=R0rKpSZ#P8k
z-%<4_vrCE|16avAb>st#w=)nO7vpQ7O_$TfjJhX)HaZw(f=)ivIP--`C7#A+Z|b;?
z;zkpwq?Jx3qv!u*I-xwR33L*hgws%pQDh9Q@T{MbR?=BPoLX#ZXc^RCw$gccdN9Y-
zv|Hv=B9ozR#xAItqMP0$QBH-9-|J9BDBUl>yjjw70#`&v2wNG`_#k!KDnniDH|G+#
zITodole~iAKC8|UwNEe>52bspv7u*%jaX4~Cq`j0ZJ%JKKQQgM%XI0bQ^#)vmlnnG
zuqW-ayTi`F>!XdQ*LBGrv3cP(KhVi)!)fu_;gHRCSR#AP5&KA^6RgM>s(FR`=lyGJ
zQD?ue_`A*iUwV5SG#w!6I-e3vqYId@|6g8Sjr;#vS*gzae|(eQ#Qpz-9Xe?QTv%IO
zYkwU{5}0A6`d+RYOi?9CQKn$wrtT|7>77kqUA&KRrJ<Z#G0fcWiA%;dYWdNvkVVNf
zCknc1GHpkIS+38xCZKB0OWQU=UE0Ur7x6peZAlU7c$>1p_l5Ozot?3XWQO!tr4QP~
z=v^{`_?{@{@6wKGiD*PCz8A9kn>6D-R5jZ&&9+Qm<97%9zgvfZpWy#tZ8hotVYM=g
z|MX3Mll}kM8JGs@7ry@?G|vZ7%+JuYtv8(JhjWTeF6WHeDn`?vcMY66e%ruN)(7TU
zL;}9Wtr@7fYtV-p1jjyukc>pF5MS&?g4_*^*lI-FUBb}Ki983;ZFu4!vfCPd>n4{B
zO<@Mc+OqE*m*qwAiu_wG&}~DNhb+MBIxIvywd3|=AJXluE!p$eY;F$BuGw_Mu<jHR
zNsVMulU62#Beq8d4-kLoPp7*(yFc&M504J__)4^R>B?5|tpl<NaV1Ni+GJ_8J(VT`
z)pJwq98+OgKA)#Sp^}b5<t`{x?uJ4&9fj&$P^czQpy4BL*L+n0mWrm|?RtYHqBYTU
z!lu)5c_>ZtGw#f(R2>lHR`zp-uLunZ+Gf@@t=p2k)w$6Wq8J_uD>Ie{8eS=<U4}e4
z2yS$m6!<Zzm6lKSmyv8<)?|tmi=rwoTHfm5@Oq@sY+_z8?4cM%{7OY+wgl!XJ&AnF
zYt^~uI?kt?)DIxO;n_|CTG;Pcpc32&N8wuCh$(13SXNzwOq>(PS~VJEVp7QnUn8lc
z!<6^KkV#Kp?6raf;mVR|0<SJ9Bhg9>MJqNIsiouqSmo59q?e2h&>w$@_{bzZnDPX(
zkIhXqXyi;Bcqlaj#tmIf#MX@9Sz<5~#YJROoL)=#4XF3hW!OvP1BcnlG;>Q%!>={9
zunR{_hD72BYR9~3Y3%H0^sH$7^=CyRIV*H;B&bS}VL}Q??FSy-l)k_Z3LjmWg-3&q
zhdpzWMdO*ABXN?AE~tMQ(Q3RPoM=UQR}c}HT|o&7`jpda#Ck)s?v?WaW)>`cqUZOD
zEQ=Xdu!Nr5k|LQoi<Tc^_9XF7la;$pZ|HPri&4ke9ef2o+B`&;4p?l7<X*qScMb~}
zxI;df(lYH@64J6xWog;m;h-%cf})p#Si}nGnKZ9v#(v=Ta|xRa^ZtUAe|y7j!wt}3
z4aFsqk{9)Ns+fn~1Y|?4%MF|~I@DaMO3IXbkX9uWoGuk}LnMzL0OkE2j8CT{ny^py
zyV4mMcNzKvqw=C6a$WEIVn9dz=;^5Eq0=z5vCebT%s!5~N2lIdBs9kWx<><)9r2@C
z??_$UD9JD)7m^I|fJ;$W)P^{@U_nhXknKlFFLR0{#}^&Rx1*+61Z$9lCQjA(XgWk>
z6A`n*XT;4D6FFlJn~@)*$thKYrm%<Pr7^+_&)gA7)|-S<U?54}8_gIXIaMWDtoXgA
zTarRh8dj1sewoN{XosF;HRf*MufS{`JaXkEb~1@s{C(I!+6M7|o-LRXfg8>H;#0ZZ
zk;PcIh@Tz+bjya_dQjj>6qM!o^}#TAW8hW7LsbxM{B#vj(!*9F_mXxsocK@`$qj-m
zMsE)VS_<5<7`@#NG%s}jn56m68~&P1U9h!hk|Ni!i{|8R3j4f07cjPSvGdD_E!b23
z7Tx*4+-T&j(#eAgco^+zxov0I8K~F0gVOBFf~ZpOLVY&$Ryz3BL&4YkSsT9I+TI&~
zcSH^P!~N?pSy`+W<I_XcqqtdWO<HYs-?}72i&es@_lGWdS`0d;P76K7!a(uJNLXfT
zfiYWlZ6%(Nu&pBnDQt<pGq?yNU0+;FHWCu$j_c3H=T22!M;{WZ>oKh`Q8f`sRFeXp
zw<Y6DGnC+jovQnM+_ogP85z03xWlI6VddB9_am{DYm~4$%_c?PS*Uv$kbcsltww&-
zl6|KO;>n3rNPdk5{OcN=+{XSRVEx^L$NyNV#^Zli*J?BSk8kpu#s8Sa|Cq)9_|xKl
z#Fu+mh_2Xm;zi)~KA46<1+n-s8uJ0J?%MtC?!R{r_D;};eB@lWAbvM;oc!lRRLa$5
z!`Lc(hpE49#T=dg=S{9s6^oQx{>f+T!=Q?N!}GT1Kv;G8x1@{c6xYApFvE)`<@lX_
ztpAQVuwmqZH+=VdvGQBwb^Ukkc=ID<52C76*2k(D>E2{NlIzeoe+lgNkd3PHIa(|}
zRdGJ0`(Lietdi@ace4jR#!+F%yqwQMStAu4m!kBAA?{s$fpk+wT8-C>gNQ^#ss`DY
z#Ul3PQ|xkh9^Yl(qQi{la$N(<-ELY>0rMEJr(KC=dMB}m*mHkidWnsiHc)P1jb5UT
zia8#)T#YL?t3ZbOnTggC4oxdbiVX`AFF9D0Yk{8Q=)+_kre{+x3VypCx&!@+>{**o
zvSp;UI3Q38!eV3CMs;;8HE&oLdTDbG4<@4drplrD0Y)BVY#w{K{E+IafoD7NINNmG
zuoIms16BUe7dZfoeV#`LG6N8lL-E6-YxXuwV+B&?h4P1tUmVqTNz8cIkE;PJ3{5@4
z3LhRh?hh-NNP?@!S?(t{@JI96KGM}k{D&E;W}j#RPpm$ChZFfTFq7IMGRuNkRS(PM
zjTL${{Hed#KRBpA`}gUdC|^6y8=Zc<bNF&kRLjfjDPyA6&8X7EQAspp2@G-e80hlY
zS)l^-*QrAWOl0zN{j?|mnOK}<doJ{88&^ix&7bng<3AiJeUF|ifoB+gEU5dHOK(lA
z$tW<gM$Bu~n6d)Vz>QmObmu<)J*9g`u+ninl$$>HaRgt)S@{uXWgo4+Fc&^U`=qz&
zG2QYp)-Bq3Hg(Uqj+qRYJDDa^QT6r|Bg`JJ*>yIx<YUwlIr?et#Xmk~l%wY8>J$Q7
z(j`6i;z#NK`%9eve+?o^hO*G^yEVMYF)T*&Ec$GTb#)oS0cAT5-msEaQI?^xl)ROY
z@lrhV=kG4|nNb=z;(`qAE<-bLH99Q{$q<`QV-OoHmP{j+5FFFJeFCI(YHw<zESl5q
z?3F8fs&<Scd$UfN{i9jAqQoy_gb?n9vGme8XOf|v#fbGzZyZ!+W3BsS6Vt&<Nl(=k
zEBzNpeZB)Ln?Yw)q%#Fl#?=@>W(sUhWzYW+=a%=PJO%dg<1O7tMSH65=!;_Kqp5ES
zeD6n)3hwp~NRqmiyHI5`A{xxpG-{*qF@{O{B1AsKFe(bhO;DYz=tHvaiOWTqZ&)UU
z`IKeii$Fhv(*w5fnXZa)a20^`r3e<B^!n0pnb6K@xq<>{rYVXYAN_D_>`c>B^R1$2
z-dlfQ>G2b8U}FZslf!bF5}J3b$ec#W+Xd$wQ{{B=ISl|)hUgqq<%B4m<5t|;1nP`q
zaEDl(2{OOau}e&~W}dm=JWE6|F%uFCs1+0CFXiwz_PfpbPu~x{>v|WzLtjjP3^c+2
z&&o=||L=0GJUjpSCcnw|f2WB9H;ZHab>dh@;gl#>Xs*fno4qI}LgAIS%t&{Mu(tY}
z5_rvK+A}`)W8Vt=Re_f6?H_`qk=*n~Qmoe_QOQ8U-0np2-nK@B@{8-a%*IR;(NDLh
z=Z<X;I;ZD0l^>uv<m!HlEzZYAnjSZ@ykuJAJ2G~#(PMA+4^LN@>$@p|d-HNvC+IgR
zs|wC*Qj^Yi@FoV!{v`c;Pu>08R&%bTbbbl|(&?jGSxFFah_~;w<>@=EY3Hnr>a=B}
zXJVZuK~%oCPK&jm!lOE(C#9O%=$W?tGssEi)mgqba=Cr<*im6nW3WerKutKg|DJ=P
z^4LY;Q1Lx2AS$P)gha&;4;>Vhos}m>dvyFq9%vPl5q*WLNQ`8Zfd^gB-n`g5K0Z3G
z!vl>31%4d1*}XV!aN()v=YRwuwV?f$4BL4L+Bgm4cP7*Ep-81aanFiH%FfQC?+Lo%
zf3a?^n$*})bjvh<*4Q~lAAI|mm+Z#cK;sV4F7FZDGA>$KJ375ACw7H@x7e1q+5gE)
z%(o5zIbr{o692IVFSGsMxA@KCKmKq3?lS)$*8Ue}e04ct|GPYk|N2dS6ZJo=*?ALU
z2$az6JE)tHcd&8wzmCqWP`?u*ouGY>^w%hrJ)uwf9)zT0rx<Q0NE_3*5f`r0$A~My
zc~GOn+9N6evYqLu0`*I7Ksurbfh!JR5VX9W6L=iP0LdC{;|RHyrQ*@XzS^Kak{M!I
z&|Z_pV7~50ukdc$+ZYC}@<QJ&uRX*rU`vU4vb$@(3XeTTpta{{Dfy83ZHjU!bh@tI
z!X(|#As%F9nsfwmKjY6dt01=VGu*mh?Pa?r%h1oRh;|hmn}bXrMX~r)n?NedzOly$
zDfeyy2O3uI`j_8r2Zf)C@!Gy=C&})iJ<j*pN8+(q`L=}gzk6RIL|D_`mjJOdc2{C{
z{bF|gV(j$`qOjXvzW_>0xq9&@-0sket>TW@o^oM?d4+Ts#VpBkl}g2=)rHX~#N+O4
zl%bHh2Vah^^b#<781`|qC|RrJ#(>$d!LBQkQx{anB-vFY?KRvB=hBPUOU;{DZO2V`
zkb@r6wd;i2*H43`3<9RB_HpIz6^{gNnTOoDRksiYh@x3&N;4q(`%=1Utv=E2arm^*
z?_9bRRt{R!?W1%~-7_6g6oDwJ4^0#ip;zur=&IT1GVp?%u5qVvL<KE(%=FXXtF`zs
zK(2kgIaaKG1>6nrmHUj?tv5Y1J<=vG{jEIgBxab&kCi`vhL2jNR5#ppt@=~o>fsYb
z5%tbJR$98yLIg8%y-P<!52`|h4KMD1%*3jqDRkdf-+B^JD|HO>310Kr(}X$Oh)c&E
z|I^>v-R563i;PKTY}<Gi@r<h^=Ueo#n*3PRA8W~vwR=ru)#Q7+o*hjpssimgSSL+Q
zg_i8sa%DKzD{pW?2Hfe({&{kpswA<f++{A<pd)g+J8;XfacZyO=`JTqvjqFrL}D1H
z8OP{Kgz1g(%h(P_ug0T0J!R<C^r``ePziS>gs~M>;}umOqM~#%k`r}Ai>ePvRFYv7
zjifsh*;kw$7Rl(4%M<2kiY$3QPBG<H@Q&dBtPUJM=Tcf)iLK13RC+rh_pj6PhvGKh
zF;AW#7N$=tLoAeCL}KARXd>0!d_qyrmfitKX?4D+D?M<9lRYyiR}3)^3;pIKw+jX6
z$KJV%W_21W9WKhlS3;+q%L>uo{sF3PZvXJ;n!F#NQP?K?LTFL~c0U7?c6v>G=r`Y$
zQA0i6w*%Q`HKlD<Q=VofaDb}cL9L|{TTMbng?>ROw+jjZk6slD>}Y_zFpP(K)=Po=
z<!gA&n0lx<LK#_QraH?|@Y(c`J#bJLONSKWdRlfg7mYcqu<Q|2$&!a&dd7IHXuvq{
zC9Ko@oFl7Jn(gpY*X!x-fj8&+7P}QA$`@XBwa@!{beCT5Owt@*tT}JApTSSOld-n%
zpB^j<(kM3**X8JfsmQ+Kn<W^&fO~rrKB#NiWVZTAZhql)QM`aWu@yjCI8Z{%Z4A#v
zW9W5SAs)$#F1qvWcpva)?Z5|-bpUu1B(^dv;WO~aRBsmSso*wl2>8-0vB@zFi`pbk
z=tdkYZld3Dnyzlll}q|e?q`7)=unNRvq4j2zz{Qp8xq!5Vs(<|`O(Uxyg0;GC2Q#K
zwIY4J9%D=BsIhp?{6rEmn}PIH>w5gE>H2ZSY+j;|ECCRENdrpulMU+bU3F_O7p9Yo
ziM=(^-wRDd$u^2pfmT_!qjPy#b}KX1CrBUIWy~pvS@Jf0(3^m1Povjk=wC(&B&q(0
z4E2$D16yg&Dr5CMGVoDC)e;?=j8O1MXQ#AGSmLURqI4%iYi(u}^Ku%Q*O(tnlM*vM
z4j|>cDG8tUq{(DzQ~ds~?DD_9MfdG~x3T|}?s56b<1LIpC)j`2mRAz?-)oiX%>MIR
z{HDJDdwBZu@!rmJ^dgzbFmugBLB=@&W{_>qM1ixl;0Ro2F^Yb>n1}49pg7j8wY&(a
z?@E~hBWtHeEr5LC280%wIZvw|-##IxC+{>#<CsJgyBy2u+I&+6jAv8JQBJEPZl%B5
zeW5Q5*~$65ym2$;9+JL<1pkh>d}R3HvzkvHvH3QUx-InOEB1gLb@to0Owj}>WDV?M
zLm?%<9WrW$1ov8m7i3J_09hE8FX4n_?2P4vj5%#uEb)b<*p^FTRhP0>PLeKfLr3<(
z<Sv-L2U3I!lZD4DHlu5ZIIRcJ&Q|zN&HCTA>`ROHoPKF@y+9GQ(x(2migCpRz{b>m
z&vrOtu%QQ-DOO8I@QWm?Fu4S74y48=PH0GETgFvT^M0NjPD3?;gU!8_`;ms+LszJZ
zu`3xjiPbHtPy)F4-G_O{W|dSgzUOqMx(=1il*&KRFsm;Ki+Jv6s=&|zd@=a^on%*Q
zy8JCg!^!d=i3dyfsRM<)wY8Oz_y6D*lmE)qYWe>YD-YGkalij@`ET0sr<Xg{ar^PF
zRMysJ<Nqyww;KPG7q3o>cm=E*R%+Gq@<wT@o4^zHf2(UN@%w+vm6`viZ}a2peW&Dt
z$?KpwMc`e!@Dli4f#WSIrCO<mnQ|9{L4R{;>FVmL)O7|IrLgIhF1)}GFTAc(9G0AB
z>G%H9|F2twuS>5^iCmUQo-SPsx}AJMdWE`j$SG6cqOW>byvbA)FBik28+1c-_=GQQ
zAIOk2&K<Am_Cj|PN?}1EcK!ZMKoN&?&Ag}r4He*@HSuaV2#3BnalC<Fz+l(@z=uDO
z*u^IdFaNVbm?6FCL34x98{Cw{PNyRXYKZo`7=)f~406U}oG639YYf?^Ie;35cpxl7
ze;71fN@?KL!yDWybi)Fl5P*1ufBoTr;dK3$*Y@}tBgIS?eQ2~dKq;ml_?KRb#2IH0
z>w~7>Yk7S4(cznq0LvXjeS*Km7@E|V62GPoyZkPYJ6^EhjSSw8^e^#~?9K?1Ky@Z`
zdx70^b-a)qahX{3S}_!%=4Qw7x^7S!hZ0n6^pipf+TI%Cp@PE7#6=@`d#p?_5rRUt
zzvVZF=+ePagSrIc<&z(JAYzycPAAmEVuGTvB?v~_tY#m&p7dw$3cRzU$XXMiL3_}w
zC?gJ<S(OL$NLOmH7C#69GrHS4#JPiaTYD`?b&=8lQy_F#aAyuetMN3mTRgL=`$E4x
zxIzk)1S&$1rja<IyoYofAX)ZIAVjNSDBH?kPJiA%5hq74PJi7w-V^Zr`uOOV{pWkn
z#j}6I$33xo^!ne&`!9b!6+a&xJl{J$5j%&^A@%U|c>md()1%`P29(`7f#O;Ex^wt%
zvG?}%@!rXaI64;luU;SQ14O9ec<1nRfA6Fq_78Ut-aOwwd|40xMI0WTGMIz?SNo@s
z_w=Yh)hEk}qZi`U-tq3w@VfJC|6u?0-&E;~{nJCN@Ws(FgW3_VcaBf@ci$ZB9E;a)
zj$a?0><Mh;^Zk?EgPr|Xd(TUN2h=V0e%U)b6(>LM930q<W=KcB9_}4uOU!1AXM2F{
z&a;C(tdiRNeE)cF_Y@l!J?%ng0-^^626gg!Z+9QwpnvwDX*<XNE=a&9d;jkZ<b;pn
z`Od4Im(bGOG`$1^w)^II?-jNHy5{7~vy;>P(>JGk;^ooNa~gn?z2jf@cQF*p!O;nI
z;G2^@iO}<%(;Y$q;6N8b9(aEC=478bbN}#k@A&x5>(l+C!#q&Huh3I~?GBWGPQ89~
zh%HyNw0Cs;Zv>D1LL*ZUzy7=j>Brd7)O$PFEho^6yQgM0s1!O?HZN+oINW=Au>W%J
zaCZ;093iM*_fPinFp&Evm|>p~0Q!K6-%t<W00Mq;=w8?)UZAlS`!B@K^I!I{6|w|S
z$H~4VC+f!CpXE64#q&pAo4nTGx>yIo+Ie-tVpRQSt!7R8rawXjmAOi#9OXWM_YLE<
zI#-F_jw^Fj^VR(L>f~RQId;L-Xsoo~m>;V6p|R>V+8Zm@hZ>h~;XlXvunZrX?e^Ll
ze2G3lGoUN58s+FE{;e8)E62ZKWzEJ)HSHVKx8`nCnrp2$8FW%0sL%FJk-N}bIyl|`
zWp7t@yWrBTT)n>Y`t`wHy`IPOvlqbRj!xcUCS-1^4lG;8uFYM#P2jkuAAmtV2VV-p
z`X`@K{CH&XV=QF;lTsY|bVP9+xB`t5{ad4dm(xM4E{n6wXgCakp)E7Cw3ZxH>#z5Y
zU!{UVMP@!%DO3x!LbX;{DXbRO3gyB^p;9hXDuv}jrB<lGzbl3HF`!4_X#!uCuxk|!
zyi$#zms5veBI1ZE!Y5R*0z_0+u%;^*1A9E?D-ygyA7HL0(9g49JWY?p>W)sr+=15{
zUjH*ck~%*p3GquhA%0HMTuM%)xzFk3m7aTbnewNQQ5qg{tmi&YMJ;0>V71c`MQV2_
zG^QK-F(3$!sfPHAbZ;2rIST6jb6Cvgvb4KqroRbHzF65PR*Kb1v9hVSbWw5TqT<3u
z#dYzdj_MF-&y!q4u)ehY->vrl*6Cm!un$WYC9gMWk2%Tz*Ya}Q|MSXfdFKD;oBX2l
zUp?;1Lr*l^Dn$-?Hgnrj%}!`I6T&Hgd*{XtQECbIcfGcEJ`CKF(}X>l8=~VMr#Tn`
zq#L<-i=TIX*{h$N>{Vg&({yO_%{v?*TOfV6*YsSrw}VZh4?CD)2!)3|ya-NyfY5M_
z{1P=?DUh)jK@HeSkP^h-Pvvj@?yCP=U#%|Jrc?jjMgIpZU^f51#c!tno9X{%`oEd}
zZ>Im7>HlW>zi+PpBQYvn{ii<J+P~WBs-^u~wUmErmh#Wk45ljoS`FA&wv);~NP|6P
zt({c<wbs_$cC5rQmDs=n532kd^$qKDH&&|at@V|e^6yVq{#92B`v0})F|J;@tNL%P
zU{;|2A6LB0^nZUD{oj-XGeHA5C0+alRe;3!H-XU?SBq<;1>97ex~MpFQE}p;;=H32
zfN~jm5dELA|DST}Prvc||4O;Kwi>_xv0N$7_W$4FH{1Wu_W!f}|7`z1+yBq@|Fix7
zH{buKZ~bZ450czJ)Xw!4OocoqVexwX<>8y%dL6{lM=*VR$a=GwL%^KIOX#u`P^NG~
zSo&a>F27bbHfn37tctc5Nwt)LzN&9ai^cd4@;}=-+20k<_g?HD?&E;M%oT}z(A1^H
zMez!Fo7)56d)IxxhaR#)&Y<Pa^IM7=hVI9q+XKE&eGMo&upo2>UcW;Ov-)4etXLt=
znnYH}sz^|gkz;{zT{yT9M4?9TS{?>134n0|&`Nck0>9GTW*38eVfZ>&I1Uj3WVhOB
zw7&f+Xbi*>7N*#qRPSM}ibbd)<oUUsUg_0^i+;_|od8#N#*V&V%}_{2qE!f$%$lK!
z+#zIJmQ})*^C7BST^?N}R6$i%DY9>3d=)Vu4zwF^p?(rIa2()+Arc_ONNk}aSlU0l
zg<t7{WX@6=4Vi>Q^?1z>V%Vo3f3#Lh`k^M3EFBpPQB`E1Y*bhwN#f9j*G7jx@DE+<
z90scUp|@Z$$IdWSY@)JGvv(S3K<1jd6tt3H3EPd+9S$QEXE)I~*xf?L^*l&NgAhs?
ziak-8*dP{<rfAVIw5T#Qw6D{mW2;3w_`U0d9||nfNZBlKo5O%a4S|(~7O^og4OnO-
z$qXbRicu)Sn=WJuXsVy=zj|J>^q!)8-J-CgZcOiqA6jj<*;tF|Jq0O5opwU+$sh2y
z`X*`(qZ%iCK%GQYNB5cJgH1OW=na8jMN;V-X;GUS>n?1&oi~I$t~kWxwztJ<c@0+w
z+c|)-{fF;l2jX^&LY3;;#@JGrAz7?iU9XHSh8dE@ma8kZvBfY$3X+v-Wqdixky4OW
z$FT)zbxk6=yu2~KAmvCFB-PE>g3<~jfhrk&jmK5q-%1QdWwpF9VK^v@EE>9LVhM-f
zwS*FKr~{%0d}SjW{3s#B(?|e`{f()$Mr*WYzuWw7rT-(X&n<(0{(lqoe{0pXxcwgn
z0G;XozQvFAf4hFSKODGH1u+-~AWU}rb6l`qI^C|5yUrJc(}eXH1x#3JD`j-N>;a{)
zFSt;t14xsI;c?tZtpX_xQuO(~NL}^X``{MDtI}=>wzwtOM*oaX^>USs)m7M;b<X|3
z8(efnb)&K=4tx+}=~W>l+QS|N7-V4YPAbd4l~6C(?GAgM3KA$~#GTz&Vk5Va-&|c^
zwn6}Uy$&vjEq@5qpXv1K=hRq!7wiyGzO)M*kBi+A<gUe2Q7)AuKdj=3SSv|~3~h{%
zU811b6p#!bt}al!n)_ttgN%#Y6j=&0KGucMAsf0%r!NSs2xF0BpC$qsrmm$-1-{6z
zQ&1c>D1gf%;BL4lX~TvkcU>%(R`T!(VO?W<?Q2Lbmo_Tv8@2V78m<ScYc=s$x}nJB
zpa4wIm5r5ZZM{tYLg`Ob2rqPR)K*vc-%6f76s0E(_*z|ye(U+D*m}+U<pJAka#NC|
zLf|_-QW3oJfRhg@^1|}2Tq<4vR^SkjqOW&D7fzp)hFVH2(56leYn^iHLGI^oO|s7}
zoWa1sv%TM4pxu|H*Ciy_wX#XDJ0~D~Z<2JJXoGa7)scF_oqoULK^-SpX$S;~8}!ZU
z`bx37zBYzXy%?Pq<OlQ$E1#l9n?&q1hXv7gP{c$Jq8+~=&e01fs@)4BKz(#UG_czM
zkk{VQ1^c~st4S9yaxV1sTrg(Gc5HfVa{^JWB+H0+0WT(Bw^+e6L`^2t@EwrU#Lno$
zt9#vtsx5jhn(a2GCQpq&{t!4#xkvCEZrABFhaDbp*scKTXg~~bogQyH(3_sDTux2w
zspu`hFBE)1&2RMPDknF5jHWafgxP)#G#~UR2?0Y6{6g;(h8?p3zR)8oP&#H?+?K-z
zrTdgwha~eDm<*C`@P}jrQHkvJhNJ`L@T{_lj$|H12Ht>I2PP~s2)o@p1am+R<=>)i
zfY-`ziqXLfMV&JWLsE^C7DZ!AcPZyw67+dQCpu;yHt?ltcBt{u=@Hh8QGdog(^Rd%
z^iZq!cp1@ZAkV-zz@~_55`O(n_ba>a?Y&ze_r02o)%f?`Ez4%CaG5z2S8>D|VGf&G
zgb`;aodgNL@(_z3e-y^sBIc8zBeH|ya_krNXeWlB@sx#vh$Ir7u$<_G-?$Cfd|6C2
znHoUN%j1N`S*Z$+2P@$&aTx<aMWqqXf9YMiJs3CG9t??@_lUm(J;}wp<6q$+isN-~
zAML2*o*$s_VV=H_8n0=rAsw#^`)psH^zeq<)l8TVLf#d<Ub|HK^c$bKg~*B9$OihX
z6*Og@)%(gkzk1CJ0Ec4F|IyO1z8+gTs>_v4r6p}5uyc6y0p-wcIK#8fo>JG7+FGub
z-&|f>D=v?fefsEmGw7-%#acB!!qQOSsEl!*j|AL@;jc(u{}E{k2o^*Q=@E-)=wlv9
zyj+4Exn{n7(d=MQXYAOes$@g~@tDebd9}I%U_L@CKW;@U2EOO`S1qlSH_9NFz*1Q&
zSE|)j*haWDoI@zWkR(zo)s}1Jm9>?X_1en%dZoHvDX+N8dCnwOOKY&@SX%=aYvuAf
z{<l(-pCyFHV!5=kQLSvO)HZ6BmF11~waW6!S_Gp~s;$*3tFZ5f%}aS>d9_lhaupH+
zXWCe+tZaY`Rj!pGUuAh2aW!DnVEePWy0*SiSzBMOt*tGuxYfLbz?q;eP<IVlTV2~&
zt*x%ELgQWFL`%v;7ynjD&=t!dt*x!EuYf4Ays}y;$NHsO0w~aVD{D2_a8)*zq4Sob
zHq}ZSwKCwcvJPS%^i8FVAY%PeEuofVZ38;Eva-GkQsVlm(Jw2d+Qu@-^5tq}xw^cz
zQmK^JxXDJptO6bt?Dw_hjVg>2pj0bE!zGO65^MuOOf0XJE31GBc5T(I*!{wkXRdol
zbsvEyBR(DQDm`cBqC{iOi<}_m0z<Z^Y~e>pB^f-(Yro9_lJttMgDAQuk9<warlZ|5
z9?n)Ikps*k*1bxM5l9<-(97Ri3C4bTr3}5cwq9GVESJ|-mq9FA)&nR<5cbTq^<^N)
zjp{0h@XJ8rHMgkxF3PtI6jffUu2hhyU?AZyN?Ead6@XU;7|_AXAn32I*Whs-$;--C
zE3GaAfv(qJNLOjYP+lo7C$g=S)>b!`H`b~!_^V|=Z@CPUBav;nv|20IY5;Jxva$-T
zu5Q32No1=4+kknzh9tDS0jR;0tt~6kH)$V+6LuskKu?v`<z<*rFqf*!ZgC@y9uOq#
zdCKd{8!)k<69G%?<3z<Pz@cHLt-yQ(h%0NjImJ#^ITQ&l17oRez(`fsme-M-u^ov{
z26BfyYqc7T+De5kK4Q0|48|(-E_QRd0s~Qo$BpG=zkndLQmbrKR;#P4z%qcrRbeve
zY&0|SajKVO>ZFq7iWH@6l7xDobua=O8`X_!75Hck*rr=ti=zW0v;x1?^|j^N^7`7!
z+Ij`Dtt3ee_{}Qt%C*`$kS2`L`YQB7Ez!Kyl^V1NSQ#+s)k?Ki2DX$&;u|nPz&$GK
z!0yV+z(cFG)Luo(1z6CI3a~%mEGz5DUIpS<MUn(=14CY^EZ0^yQiyUDumgUzyt-V2
z$qM}g8{KL-jVPh}fZeawun*TaHh@glS5|>2D=SGduK=Hffvh3<!g#LZR9#E71LjK&
z2m^8g5v?q*uETnn?B})8`szB&y&ALu)__`dWuuZ#<v3PA;ItwDhggPnV<p+ouu820
z0j%SaTV2Dx1L{lZ=atgN1~7;!E_Bd_HC!5bHpFL*BF}W5O*B}P&LY1=G61JMfCRaF
z;r+L2iBJfQ?0Q;gGkzYpWQrrug=EX`DusjIVz%1#s-;qBwLy@<@PbkZrBf-WY1jv8
zZaQhSJf$dFy{{<x%nb(x@f_q({CBS;j{OEKejzC|R$@}=#u%ZL!KHU-x=dPKMwzs>
zzET7R5SbC3T(}?^KPw%OWV}&{;c&dZvMF|8_`6Q<0lP63F9u~x%+unvT+UVUo7Gya
zSgoy$mzA3rUNx6cy0qF!{R<L_DNMTs;XpI5uPKU4^MX_^AYu0_@L#ncU{J0}2NOa<
z2nk^g{#%CsR^Y$YF*=y-q(H8|0zF3}4f?NLK~>8dW^hR21_8FR3>>t)f;q0QDG?b|
z3za|^B<C8nE40^UxgJ115k+L?QU%k`YtjA$J;&ndztisr{xy&(`_qL5hdlE0h{&a<
zd4bZIe?_{SYg7@SV#l6jkNJb+z}#Xb=k>J~!~j51xN+uztfG0bmC%Yv+_5`qRhb=|
zt2RJ=-l$`smpKg3GNLWR5YvA3I-#@${n_iZp{s9XF_>ML)h+QmEeib#b!(M=&<5&T
z*#UskBJ~2cljO}lOn}EqLIql=@rX|9;Jz5(aT$C=Hldbx*-uYVaHLTs>09eD2!$f>
zF5F+?V9IJytJaj`%k<E^$TO=aPHt0qq=zyD4gw83Ki1K}vk9IOlS&`jM)KgvUc&;9
zAqnvVv2l%Fq)Me<rQG-lc62qJ50>av&L=a{f`ZL>tbuTou~AFV$$(P?LN^jXRbcm3
zrJa$?PWh`_s`Eg0l5IlTMb%lHepT-oo!4ZF#&NGw^$2tjsfl>!3~5B*IH74{U9Rw6
zS`XeFSv{mFS(46~t7St^6H^eP?S~6XX^}K*r_N0W=PT(%B^gD-B1xIsq$VOHrcA=3
zai~E<h57-d!A8PHR+uCt9ISp-asxU0Q~H$#O_8V?YSdp2sN=|iv_^FRc~RNd#N-g0
zkgHb8L|P6F^RoF;UWs1Tm!s!3$|N_Tt7ReyCr^(1m&9^asz^g@YK~rY!I}XPb`nNi
zu>GgE3heq2poH#7sIV<lU~37imshJMa%=RmQLAdiYyisyV8tl2y2dXRkf3EDoB{Z$
zx}h7c)C}wE8=QM>xolPeqPMDI1*?!<R$X1@TnZ$Jt@HslhN`%Y;3}4`$d02TwdGaS
zJ3Ikn72>qQ5ntq4_*f4&u+oYebNs5`a$!|J)nv=m`?7vokx$_&4X<8tQf4MhNyWYN
zbo^pPWkX_|LT1Iagb$0X>jreVMIXba(=jcf5?arDN}F_oHeUL%PM;$2hj5JE5YMDM
zM43#N>q?r!m{!!tMdZqbM2ST?ss#6M>5BbN`Q6I?gF_J3FMR*QZ7zU~xBr0MdTk})
z|7CUN|K*$fm>)g!K?Vz8D>;z&gvbsPr3V~$lqPxT1r5Ep^!O|rc3pjSafVOc!*FmB
z_`~xH<{)N3l(|JoKI|O|A>~Yh!qA)MdqIZx?73HUr_~AybPdyp!=a;BIvv;$;eNM3
zp+dzX#`99oz#4%Qa^Ymq5#Z@YkkL6=f9sYgjzEtP;Q9w{t1z~D>LFD<^m*XleAD{P
z=5vvIS3fcm>-pefdSqJecZE)Wh#~Vj&Zqki&qE>vQ?==~ra+0%FwpuMD24sb!;KgH
zaqQPdg0^opy}K@U*{$#c4B{9fQbvZx-BDCH#*qQB%^7xN!q$jf%#pWIqDt`BLMDZy
z8Hom;biHG2Z%rI7THCg5o4dAc?{?R=ZQJgy-Cf(ZZQJet^u70-<mB9Yl1XOf!z7cH
zS!+$6--8I{m@{*8Il0)W&{xPHnj!^c7g5W(aMNz<1c^Ak&ReK2H<!Kn1RUQ5aX;c}
zHW0EtgmvG!z<~glih(u-=};&c5oRdcHaq9Vqn~hv;F(PW(jF(w7-|7xk;N?32K%1a
zNl|{jd)lYw??@k?eT2Ffs@sarcj#K*oujrm;_Vg}FYhgqV#QwhEZeA4yom1Mf`Ejw
z?@j5Cd7Ouc4(=!1m)&q<69I8O-eXp`KUNUu^NWm&IR@2)I{H?W#*W&E%AVRUdtpu2
zdmu&K(dW&lI@)P_E6Lyerb}AxOU2n9WXXRNIv4(F0Nzed4gR@eV&wkZaWGv+-KA?+
z{MIUN@Ot<vRvylu`!tE(Q38m~BZemV$(8;Tu&jhwlFc=-6GaYEPFY8{nEFA{U$*%9
zS2z3$(XVqvh_1RgS*eP)mi%oE0D@1DoNcV}{RlJqu1Xua7DLdf#SErrMMCR%0&lDa
zGx$Wc`c;~Uo<$;)L{v$O21qU^W6=aYiY5xY9?9m15X>AkowB2z!#M*Rg@45NK(cUG
z8;z|keNF!T%gw*pT6w4kLclt#>L}bW6HmcOLmBf+gpn`xjTSOSlpZ<HMZ2<Vkko=4
zV>lYvWaO|EDh2_L4N|xnXZbPC<}Xf9hQwc`N9p2aS!LUF{ZtwGIBHjtRrX}LP`4a5
zP~~z14WYy8a6c;+O!FBlO+Wl`o3-MNcJ`|lab!DMsV){+MaHnsXeB$^6mJ#Y)qIth
zUO_ITimE7m<2kjPX0>kCfa&o2WzjKEG^LWRlk`YB6XRClw9g?j+0rpCcE@g=B$KLr
zXABR@r$I?*<M-+pP$t=$$yD?<accR^5NYgKt1zqH7x6T!7}>2yd6AU*E?v>&&pnRG
zM49NKX-&Jo;p>U=>@+58rOj14aupm!>w-C1!>1fIX&JG3vBi2%XX-LtUIy>%NST>|
zH&tO@w6nK68No#X3vyCc$YsO_Xf|4+qjMu0@eR<4Zc_Vkf>>Dz+&A*i>Y%n#uPPTG
z7R7+B1OY_7=vN!Lx5q=m1+WoHAiwS}G)2R*46tmsNXuTP#ofWu0Nc?;)IEkWSyGE$
z=Q3FXOL6<7=V(K?`Ih)r)r|~Lqvi&qE6OAtDXmZ5ED^Tz_JU=tdA7!30i1|Z*pj#$
z%70jQGLi=tP-Zxs?8c=1LRDSmnG`S&6(=KG^4un<B(A!AZ^;h@rBKsh-TdrWz>?oQ
zNur$FN@`yvlrZo;w$`F>NfeRrtRp6QGe@ERP!tIFn_Bzzm(`uu4A35Ne@$x@R2kP(
zGm>Tn0-`C1OLnYKq$Lk1iOr<5f=$G|Cq-3P6{?F4e;~t6fhP)fMLCjtYSh994B5L4
zj?7{ACVRG9(JJoKLrot|nzTtA|KX+IUs!)G<Mt@mNG>U@;XWb%Ol9SI#hk<o>A*Pa
z$KNpE)nr5*0eWw)?*z+WzNC7jz5y%hD9?G7tN??Z<FcF=_KzH+Z~*cKNNnoX6iC^;
z{A)6AFQus#K`KM8_;>URpix7xx@X<vPxi1xgwvy>0k$R>EnX9kevlEirM!KvqzG`o
zJec^>!xfpUqD2~9XKwH?{g(@%?k6X;IcUJveNB|yY6qLn!56{tZ<aveZW68L^%w1R
z6!NWUDvz_(E|vf)Jk?j9*e(x!Aj-|v<!D=nR?I5ks%xE_i)+1_FekfnTd>Jc<i^*(
zPnU;h4f|EE)=~o{M4W{*_xKK_z?B~#T&@9#Hz&aDEc2F(L!3#Cv;!8F+OzH^1B#Ab
z;M8smj&TFj2-}NR6uCU^8tZo7$Zz$u_dNQA>iuWUC@r$E&Q^h*wDWn^z}Le2+4fk4
z@W%TA;Hre8XPw*Iqt0S(FrDik5jK~eVUH;O0{UEmi<vpP-b>|EStr-8;ceH}L{Ot^
z^^n}TvN}PmefDI8e>ohHK-}(IMjDU0qv*y=P*+2qT(>+}r~z<uPFO8LgPFbb=TTEE
zHK56Zm@p`p&9}&8vJ7D_Z6$<8gP8fPppX<Vb<q2nS!pJ6H45k@7keUcPmFPHvpw7~
z-UNDKIcCMbxp{7`FIKVvEo=n@zW1JWI4(R-_N%sDD}q}gB+lW-I;j^tQ@s{Ei7eI&
zkk*Ue2nVd7m&3QZ)|AJi4_y{^`pSU(-kO|t7><yr&MDY{7K5>F?#ZY7eM)Z93pCIo
z#Knh&B8e{OE6L=HP3OdjBX4BE4&jxdVSOM-altiF43mjQA%TAcOMTymRs5aweBkF?
ztZ2t!zP0WSUYCLpNtJJ_Z|j#}6eN>dIu0n$lR^Qi?eaIBq*_9!7lz!u%-ICCxyW=M
zoo+HG<dzapytt+xr<25K5|BXnR5(krD;gB4-yOW=1MR?rUNPBnYBoRc6jmtMbifwR
z_5$wg`T-|3n{XCrm%H%bjrMdeawdC-iPpjxwYX?R+vJt|*egmM(i^B?l?bcaG4jP$
ztL_rTq#sVhdmW|)(51rqFYjL$4l>o0dsx>tjRGb@2+w&&q4g<9XYGHZh+7jO%BV`D
zz18+2@WPpRk?9Gkdca*e0t7`xypp5G!nNA2S~g5Eaq$*l)7<qf9o|YZu&EnEV}6nd
zJ$C=BAB)Ry?wRK>`6=2h+N=3B1q<Q@*R>CLE2quPCXhoduGP{@74jNU-%3^tMh%L}
z{IY}lUHm)zlChIqiUP4_L0Pbr?B1L=LpGpAd7e=_ITK}#{A~W~56k;WwEx0CN85gq
zNrqjB(G-U_QSL<Y*zh=I&WoAT@Fko55_4y1|66}T90TU^UlXv{<;jnRt*H4_5oA<h
z5pO_gDt1DKOdC1JAsZ}7P0rZlGDkX}mDjpw218Q=y2yDauWl4-neo}2s3+Dz&r~^0
zr3#DIe(lu0P@I0hZ6YyaEuL0OxhB4ma?O<Ts$rKe7@r-yLUFExzC=7d506{X?928*
zLqFxI4UXBQ4T7D!m8K<ZSUf2$T3{nf*?|@$*mvdPfcCKJf7GbTpsIbQpkxiVTjIWW
z!^5}HBRudkBD-7={*dB~IpK7L*itMJrDyFD2qww}MaFTZXHGXb02T0nbny{3eSn6(
zo=(IFK({9O59|L+81$Ro|391W!)qR$c!>n?(oWTBs8i(<J1gIwZi%rtOm<~P!uK(a
z8SCk`?hs4}r^MaG@~t2*+IBXAH70CGnE+QkmIsz>&6aKRdW<V6!Ec00%i1^u{nqZi
znzWU1T+6--s~Gj>`u1%9h^LgS+k$<Dp0Rj=<ag^Ew12Qu<N_0kTQ%sGbCwwGJtAs{
zb7MM_!IN@J0cIDg&D;nhm}_i(2qbwyjNnFJNea}yd=0P67%TuOY6KsiLM{Z|0P%?L
z>bahYGa~gg@JlrDej_M2n~Z{z=EHn#zb>~=8gw*>fw2>-5G%27ziLH>UXcQ2YC24H
zn97iGX``+>rSjwve}aHAkZJ#Am?ii(KOp@88mo|Tmi{svl@UXd<Dxlw)n#XL6T>($
zy*+hB8=!O;&mn(#7-qTn!HfUBlF27XN&QpFB=?m^(UX=ZYo9rL{GXM~+5ak;b^lc|
z8UCweswj(D`BCwe;(js{Atjs*Yufag=t>B0`5{cK>83ufOg?i4OkvWd7*}gjW71|t
zDqx};Fwh9-s(N$sk|-Byi_agBZ(9Kr{tj*2FjHOvCYp~N`MwQG+W9sBeo=(8<MN=c
zOn8XW&e^yc_{s%JFt!(b9)|`jlcdGWle?ui4Ra%VPDsW90_Q>W6+0R`#U3&~NIvEz
z{Qvj{nkc*p+qmE9F!tgaq^9Zn#Y;0Z%wyJ7xw&TS#D@G{x^n5Plf@Kp;xA^dcW%Di
zyuJvvzc*uHW$OTy^cpM14}?X}lgEG`TI!?U&uNnda4rD;*YL&V$xkMV&BV7bWI4X%
zQ1-n7+1*qQaLzqx7Kh+H1PiITNxO?;i>SA$2i)oqgoiPmG^TxuVDt=n5Gb{U>x$cJ
zKfOipj`|1+zJlHVh)^}8bU44NxIIo_z%PMeq=MZ=ax)+4{W0V|UV;Vs{kTbccX{}a
z%dihf1dp2~f2OxJ1NZK5)+IpM^~EqW8Da(WS<a@y#L|FJWni3*-Ik7Qti!R%_#d&J
zv&b-h+msQ~I2GNN5hT8;2ra}mBg00P;D#Udv!U`09*Vf&9CN$<u3yTzXZ;@hY#Bg^
z9>sL`*cmKyzuyxJY&u5iuS1#g6mN>vRzq?pBIJaW-za{y&5<jDVPwwY3*uZXNm5}7
zTD<xSe@1C5ntVV|?qrFNb@az7-b;e*k(uVAP~}MzpAn=;DAm=*a`C2c@&}gVM9jn7
zUSE$!8fEeo&mN>&`l9s#jffg)^~6&h>RuU|s!A#xiEdG10{+Wl`8N7oN8vv+oU}4!
zwD3JN<%?1x0S9`lYiMYA;bXi`_KZTpG<OWNeh&t(2;tJVJMlp1AiQl{cp8=oN>pzr
zx>un9MAJ1|@W!M+=<&P8OtoJ`FVNb_tx7=Oi9yeMnpp0CL1w{M&g^aHlNik!vd8mG
zcN5VlplG!yqgRDzjv?vDvSiRQ?)KDB*whswn1B7n)$BP>$KO&v?ss+b*Dg5T#VMm2
z8(^y1ULHjr(Hug5t!*Dd%{(SXV-yh6yg?9CQuU(^X^2=F9EtqKipvc)xPxMdEI=EL
zjdE89n*ikk2W_DwP_dLYhdYyRQUfY-J18+8#MWVwfP#pgNrR$|nEhf3IL6zC%o<Y#
z)=AE%azj5vF{Js+v?4*X_xOl12wgWi00DIYTpp9f#!SVQrq!uiJxHqA^XPdT8expm
zf>x+`nJ!cso+wq$BwPUDU7!H2j|c=F6$rck(gTmI!rQ|EJRvQPdQ)AesSV}}&7wW>
z@^KzK)f-J!%0(a?65oGlgiL1YdlK-0Z_-*I5A0839#2vq$#dogG2!ybu*E7#Chja4
z^qvXNHtY52P7_;L>_|;jLbz>ldC+Fyrcars#S>UEuyz!vNgcivs7cxi>2K3aWOWPV
zNArrwqDnO4DQw+~YF_dCWj`WPU<W*#qfgE(eJ^DJaR~g<?RVwuU9D)fG#*U)(m4x1
zHAKV*jA><4bv^fmjXS0K*yPlH!ed+?G5e+}M!1mU!fkuSATRxfFr!QhriDI7pY|e#
zlrxV@^yN^XhCm^&54C4;$>Yw0o5sh@(*62km=Nk!PujurPV-XA+S?81+tjq5`H5iT
zL*Clk%;l$r>o@C<jNtfrhe*5x*Y5#x<G#ac!>2a7@uNn|b*H&)%dKO{c4gW4c<Xn}
zRm;kH^RqUs(aV-?ZFM!fG2tu%ZhloW?viWfR%`OD@>O@rlR@UzOSzrq&iL@VRYxaF
z<45kA&(79$7I0c~&b1?$OPAuBB7hLmr}L;agmew!PkE`!?d0=^Lc>>XDiDR1p91%E
zYaIY$x<`v%U48bkL%qs|MqN*}>R-90gHrvrQt3`pc=3i$<&NG9U}9ndcfkti+8)rM
zn{@^F(YUt&@~!|DAAq%QzyCF~`|*7KVPJsf3#{?@Ygb!a0uNIIa|~Yq>2^!4N}d8~
zUxjW+_Izypu4Ugm+`5Tz?Fe~6B~*soUCchdhr;*Yu>K(%vRjmbrk??s^Y~{V?B0}u
z5^eWDcXo$c`NtUBs4!m?8c&N2MMp)x#m<9_h8zN4`~6`|YuzxBUj=BSqJ99**VoUj
z0Y4l@AsR<jCy(a206jEo`hbY1&N>+mu6aLZ+j|E7Fjrua%{q?kW5`b4>-!`7_QbC8
z-HiHWlI>OhD_LLKL@U#4&$unb6Hkw$<=H@WzsGV;0%JTRI-a{?X@Tl(r&i2LHM(iB
zZS*ox|1FMwt6re@1Qkh83=faNORUE7Y|d=e>8GKVM^&F3lUK8WHPSce7Cw>CI?F%$
zlD`Eb?_G}M1nw!gSDcCbJQhSj{)|>EC!3M0ex9i)jhWaa*CMw~hm9Ig1^tbNP|F}t
zjXFTFS(g`gVQp5C+2|o>nfxLU=Lz(o<o-a+3H?#2>oMDR#`e}J_un9P*1SY;+)GAZ
z=Ci_>hp<0~=E&FN!FdP!<YL<Rv%@hdqo<@S-wX?V<AaiHX#>0<A&F400UCdnwC4dM
zbl)>S$M&&@_3K9V$L1d}{Xd5vOE-Y1=p&$fXJQt&j?cU{p%*>9Zv*;Ia9topFRxJs
zKXS^iI;7ivFHqQ0D7*Z|j{W{V@IU_3ll}8zQsG}MZ}>)r>B-yuKn?os;@cp{2cn{q
zo+1NG?aefo#8UqLX-h}%{>R7^>Ey}tAMSo_?Xm`YcQ^!=XUg|D`6DuVZBkbO*MEAA
zA;Qmaro2M_z9-M%M?=a2sG7i#PDpWMtjky@wJTP#J#(f$!C;kCzl;}EwfBtr9BXrq
zfn4qGZIdFf^leCzMQcuiqS1O$b{>$WN8m-^n5~^PK=M0DQefgC1lJ<kF6ThjOU+P4
zL_}Ze^Ixc?KuU)-<)MJ&rE|DgF#T0v)s<F765J2q+^;vn1nWWb@>th(2u1=>oU_;t
z1%s+(#a~L=e{dUZjiT0h$K5=qmF|qcjY?PwTCqH8DLQ)c0eBP4Ff3*&@lwcvZq9F^
zRWbDeQv1i6h2=4cN@~(dDRUPdLGArqWwf9ivymrOo1?s)$kNH*eJS~S1=|i@CqYqA
zt+|-Otshaf|K^%ohMe3KU$pU5lZyoH%#cV*-MR=?bR-rFyoP<l1mbt@24T4jCHGW$
z0<lVC!&%9;>j`-XL-#exj>=smwk*WAa<3R5PQUd2DZW*Q&qg}O0Z@7=Y(JYniH9Aq
zU(4IhR12ruRW-hfhYwL+B2$z-EdRCFch<M7Z)sAeJm~z=>#*_Y9JAaEKlcm3RLy4~
zW=s;q%LNLzwP0<awgpoScUU4YF*mCDTwbI)vRiRk+Hl@FZ>t%|B*2ks-1(dIQSCY6
zJF(ThV^#D)pElvJ&FAewH(rwRxvz0LvO#3?Y+~amxUBqv%-p`DnwN;-{?V>nL=IO>
z+avO^QV)t$a|?uYfG^dS@^o~x)O>VwuWeJ^S>K?nRV}naxM|K2BP4IDTPsQ9&)mo$
zrqGX<e&!-7aD48R#6hsS{O1mGHpR-}Tb$1WWNAB+G5WXExXU@%91#R+I7A~>)U!>-
zvgF||C!A8AN+pg@wktFr{GanPw8^RIo`jW-IaGz{OVSaJ3PR(nvhkX=gsC<vjmDkw
zovTkj6|#Pv6=r>aL1p2zU@4$>$^5RTdrU!xJv;jnKW{m&%fq4J$A0PG`M4E{zh2|U
z47?$wI#NuaKjvz|zY`Zv|1D+VWNC8r`D;2>$c|#3TofL0cRopLMdJb4!%??*T%o>~
zP8YiIZDOk9YhK)uot7#-JvdU|>)1)MBA`%yY{+;cjNco(l`Gyx(@<mKbHEZ}#*>-Y
zPJ+Q63FvWkz*@p~L;EV@CPEX&oPBPiRJ;fTYBWM@7d0ymtm8_MsCW1=-f@O(1by~g
zw_Qe}6tZj@u5q@t-ZP}D2CnD4Ba8}E4aE3jD-MM#cYLaDN#nKePReLf2Zu{v=_Z-N
zAQ`OT5ennzVm5XriZa%Vf-SHl8#C+WCBoPLRD{37LOc1{P5G!@$##+B5qI$LHsNht
z(5|9~viB5z2{6k@yl_sV7PVsU9sig$7kRA(ht;)|1+8Gq0^djp^W~syvYqk+Ybun1
zxCy{>iC&F4@0MC#s)#c|Ga%e}KJNC@DMVitT|mF;#S!R&<`QgB@5bQ$3~)9qd*uRt
zI_lp4=Gp(xd`^?SMatg6y?O)Q_78|>^+wE<seLQ<I(7b*u_>iU$5gL8@D;{ErauNG
zXXjQO0;S=9ojinFmQfDKI(?`MOVbA21=_4Fa~1S&2m2i61#|@^@o@GWsl^p+Ry(;i
z=6{AbZKM+G!5^XlK0NHJma{&Eb3Q!es|hA{fj)ox1Tru#*>Y}GMdWUR!8VzbHhBzH
z>`juoStHzeO-jGgVc2lfO9K-QnM*;2uu22{!XT*Bnc+VZz*r%=jR{oxdPD$Ju8F~f
zwYvvkz9hp;DRD`s-v?l&B*XTpmi}=^bjEC688FX_;TwGBIIAWe(O6TzO9S~`@>Vw~
zpm~A4wQX5rkG!)*?+DAxxDQ^Z*_vfX+=iL*Dro-wQ9*;uEKNM)n#JN^QzLh~Vi<}_
zOd0(1=JTmue4)DnNvb(_lVm=8bMQirafwBl3GvKjxg2Q2T38{Z5Y;jjRtn57Kiw>}
zVf~wCcEL4#DkL!<wQj_rKuVP*V%m>z#G4{v46Rq<AsgD61^%)EISzRotxm!z9Xk2H
z=?9rO4eHxi8S^LEA+H)K)X@SN41g^(XHaNl)D&lybc_sQog%S<NFkz0j$}cIK#GKU
zlp{bE++%#ZZj2O~8`u+$5?cX3sr-Ebi-RSXtJI$_lWTZxn9aXTgj*a(1&BZn=YYxt
zr+2|cESibp9=^#4k1{-;Uzo?T)7=Fog!1$)|CLK=FxWO}q-k~pnv}vhO0*P0fczXI
zLl)LMTgVusRnp9ASH(3-jG>|zm8aVQj5S-7c|d9uaYRWL&pXhx6hu&+30s17K{yZN
zjcZO8+^5Q(CDy7mNWf-haEt<)UpTpP!sHEZ?KJL?wQ>Sgk{~kffR*BrEH4A%olC&v
zm%?pEg}*|CXW)!1s5f37a{%S*q-t;3Whz*n6p+H~0aqZld|~<?*<siL6$OI8m_;eD
zVCqbCQN~%mLX`J^t9<D4uqD`kHqc^$;%!c{#%5iZFsy8?xN!R=pE-tB64#iyzWoi0
zD+hePu6rJa^c(xTtCc$WwQLk2upkQ^=<k*DuN9D0$%%NvwPQO|?i3>QC}2LgiqC^u
zSsFl{l$n<}O`<ANR~vQ4KHIAe-$W5d42?V?B~vq#?S7f1S|Wj|&@*(Cwow0P<-9?-
z+iQ+}vd0OwKkr0j>Wb|_2v~bnuVpLod^lSHFL{YKp(@7k75%}$XPnZ(=L(MbAE4^`
zSj1)$s6WX7#{oP-iv?B{<D(3=Xr7riqe0mPMAG9}_=7A0;&2U&)yjxL&dlFQ5JGO_
zdc61(@|Tb93XQcnUmONIu3iHS+bCB#9azRoh#;JoMWm?C&;4W0OF9OfP>j;Iu^K)8
zv<vj*xf_G;AlL;;Tf`Kjd8|&s1lz0Fp-%#EjKfNFt7ChRh&~=_#$&4#k~J7CuAU2o
z&k(l-5b&%EcaaT$bLi5Y9$n&B+|<!ia;|fLxG%dl1t*&yGKr3wN$y`uQ8#ooz4%$*
z@oG<w37S#;Ul8&nJZ9#Gghnje@EH!Dwb#)zaym1rfEizp;fT*=R8f6r>W$j;s4Qlo
zvg}T-l$rh++WzYj-hIsEtY9+MDh;5rOn(;*Y68mSruZeASnhR|{YTbk=wPe!C`kTf
z2D|YA4F#Oy*+HBHa!8AtT<0(&C_^H48%tdrgb7u$+{+<egoSuM@|OMP_XE4nzw)o0
z?aG{>prWn!sG<W6-m<5ak&m!4Mn|kewe7FmDDyA;0@Gqp#a-?+EIRxzNp@S&6-x*K
zUgf6a)Ix?_Wn(4vhLlWNaY2<dW+^hI@Jt(d{>Hu22CCFBin#1Ib<fTPv<<ceHrO1!
z!w-laoh`tHZ|A^OPsF!@hWfYzz%Qk_`Tp|zN5(t%c<Ed9lATNFs=LBOdLA-asW{Jd
z*Y49Pf7MSIwrPG(hfWxFJ&XRxeqSW6?+ns<P{7zo@Yw^pX~Sh-J6E4S^FvASoQmqb
zk&4S98L0sdzzZW<2=68YlJdlVj5!Y3n}vTMC)W2&vt>Nnrgw%M@I8cLJeCH>S%IIq
zDDVW*3TYS;^yB!-hR(=U3ArykcoMK)^VqJ?|IH10!ukCyb{r6Rs@dX?_&AfF&rF3>
z*SR<K`{YT$gQ=nOjfqHmF`tZCKNytm-b8=-S3d?B%1DggA}KVXq@&ECB9xJ~57K6K
z2kL#XnIhL?*j#I%79C$%)!%B4Ged>ltPPvCY7FjqWUA>4>sfld25%taZ~qoMsIe}B
zHej!yrw@c)k{MzCv@by;3lI6Q!VJj5HHVyBtml|tlJb9d?#H80JuyWw-44@c&$jG^
zsZLtad5CS{J>`V{5D7dQ=GRSvk6&JH&yb#9^K#<vScb4%2cgxHNpZU@aSD~c{fo<K
z-#8mqW;G`+CM~;$gK#&hs#%t$@y|FaqKT@tnYn7ZCn6X+4kYe$fm|U1nw$bI1LT9#
z_8#@SXgi?oQ7?L+sr7~8Thgqb{SIy+xr?5oz~Mms2Omd(EO+53s#@wu)sGRPFqjVW
zx%#E)9qFz^195~ygw?J++1d#ua^QK5o;HkeRAilA{LEn{;zVPVh%>ngi<LeGvCf-T
z9w2H!iW^Q}h^G|QGOUX7<lR7$yHmlAZ9)-E9OcGL5=2!@%v#1H;kKBnX1j{3rR-`{
zwV%AK#a6~|pJkH_XQfJN0<=4J%g1lVTY%JrLRE4FzDFcX8;L@^BG}^bVme=$EkNY&
z_9eqf!|xa>Jr#GpXw01BSaz{r-sg6;o6yBu;RT;z1m>XBLlKICnPADoG1spNi5<tU
z>ZA&X!A8j$K8kgDRZ0H*7|om;%wUckz(9;D!Fjx%Jr0tqAPPRXBle|mDB_Etmn&#-
zLlc~f<*w(<y)!aYeW4o#BgudIoT{6n0uA;m%9)dB%CDeuv1fa5-5^kj-}Z|;wCmrS
zJjxoCczAz+n05#ke_^^IQ7N^>rt?vA(kc%c=ZRV}u-@Q6d%(DylQ_kF)<o~Yhz<ut
zk;RU|CiSP@fuDNiMT#Y75bA*+Lz>A)&$_k?2H+s;)BJnK;{VfnJU$iBislFW#u=4v
zWum{eD#W!AcbCF%Jrr{)MeRn^O=nFWvZBA&dROnR#CegwP!FaCX5>TxgP&MI0?1#D
zdN#G}xG|71-`wZ8%dNVW%{gkH98uqIloEhL|F9)(BVD?o4sn3$92&N3weg@bTR-16
z{p-nTZ&Jv3X3g$&f#8&3JebcE40uI8AP)RHJ5rkh>^nP_YIyi7+xC)D>?_+U+z$Bx
z75m$~M7zowjdm!-*i6OYv~Yh^Y$zZq@*o!GZ7fQ{b5P;KZRHE#=u+~m_5%3xqq_LP
zW&cn0#Se5a^#Y(0FS!96rLBJZO|1hoCQP0Ie-2&%xHi$)JMz~6PRUhWOUh>ed#vz|
z<Tc=~b@_Mk6(Hwn?!&LFOL>Eex4G%d4>Y)6yt*s51z=#KPBU>)S^dA^Bt0YFgg?7A
ztJb6+`1XT;21JTrqDwH)An2;%xh;O@VaC<|1JtUnaC9Gk6Mj$rC`ESvFG`Ujtdwp*
zn!)8)PuEv1oz4be-6j^W@y7;@LMP%%u$1$_GXUpmd4tGrIdKFKgPthfvv%jF=9gsy
z032QkS|8Kg1By7++_t_YIy%ooe|*xi!q}&u0e%@@0M$blBY+^e+9x<V(C8hf(Ls-H
z)!bW;@toLDVpJqJCi(<^GvH+C;NlW6Fk8KSjr02Y<@Y209KQMS<5~Xue|@|zFM$6E
zd#hvhqm^)gAi98l)aDMzKKoPl>H6#e1$lw<^<Nc4HPY^~+r|$hdYI-K6FRyKj*aQ7
zO%LZ~6U!d;YD0-J#2g(~U*4rSnj+IIi4Z){{(}R%hBmSHgdyvMB<pY*%~p#<ZSb$x
zy%|5!-n8t>b!--AB;|jR=HvBXK+tq0x}o{<9WnWdf#?Z@(z71ACYa2h-}MwKGOPSk
z7k3belTkXH5>jqdEA<Du=C{8(;;hIp!4C}X@12CvWi(RIyids^i;D1BtE|V!(HY>M
z9H32O*mDgbFOlEFaC${#ZyT)~^MiPASEyddm$b{j3S$mnzEjwZ3<NF^I%@oJv*d+j
zf>t>H2s=fRU%b$xx{R=Gt?6JaL&3}moUU7?n$2+_c2;J6Uymd}4&(EDXLi)b7<3Wd
zL>nxthVyB|*eFDBDTGY(JQb#JZj{ZlJuG87b$4mKS^CReo~6p2y_b{`Fu`%>rRLkC
zy2Fbj6vZy(`u0aKen=45^FTm<JZ^=;^xHEgzLI&-NPcW)*7Q8CW7(TjaQrU#`h&%o
z0f_cA7`f}wI?zb#FJZe#ya^D0PZSc<3HPLndCt6W@yf;SC25?<iEVA{+C`ntRLB*>
zzp6h7HA}A`KzlY?BKT;ciUEMXn~vX-qBI}V_@lxRXgHzLV2}|yx>AXwaf&W?)cbeW
zifCd_t;(kr2!G`#^_d$;O=dg}BgEbJBYJPjzd~9^;_6+TfIW?wDMNs#L?pqDO2bD~
za|K5cga|7fA5Y59h_u?JHp!ZR8kH)8XatOcK!%@Xf*VC&y4`;{A@*R@BvGRkpXXD7
z8##0Qc+O=`W=nJNPrY&l_-GpO12sFC2%~lxwGtCkGoAXYmy$LvO|HPB4v|@>BlSi>
zcEZW0vxFydTN*aPu<ye9(9B*6qgAb`BK6ErEb399xtw#R%Qocl$`x<ywKYM-3oTx}
z`Wl>7z;{M?Mjgy)j9SrA79q-fiag)l$fEXu_N#5yi^PO;6=O+`oJC)};m51SBo}kU
za()pMr0`7ZUgfQ79N7DPy7Nqr|2^$#5zGcO?^HhmK<BTv*1<2qK6>u&wKu<O+dI`W
z&i<3ZQQu!h2I&x$lA&+Fx2|-a^7KJ&PQLf`UgRXXod;`3J+_Aq3HxFtw@$W>V|Ye}
zrKN6Qa~)FV`usLAI}PK(I*gt%P7wI5u)&hHqcBrU!ZH@^@2b+CmJ7xz6jBS1R#cLH
zQ&(#ewisiSbpR|x!{@fSy)(-Blyl|B`6D({X$XvX?xDSV>(R~K0(^1wtiA1Ae%iTy
zbMgYRasX4)0P_>So$YVTp>kx1-g}izP|Zp3)%SGT-js27Qo}P13J=J(C9969VeNUS
zwmDng2%Uk6Phh{wopGo(<v+G<l@}ANq`QJ!Q0}gf?&hF;9iX2~6uqMloB<=4v=>9t
z^&o&9RoV9PbVnuTy+Y%5(kXurXlx5e?~Yf6po<PL|IE6d4=D}wmw}mCDd6KL0Rb@3
zn-~xc#oIP<z8Q{`66g&k?S%$+u!zATjW^^-1Feob+ugt(yxCb%QZ$FuMtpe<F+gxx
z2m`{w(AL#An}XJj;?Fh8g4-?Vf0eXwGeK_)^+7j3_4I2UjI@r{Z`Cp)_QJcjc_J+m
zWcAIX%XPO7!4b-kA6L*J<Y|tg;t0IAkeAcjN+zU4Pgpqx`W~cv#cxZnN{!X2gUJ5!
z<{EENK?n;HI`!a)XkmC4M!Iemf=+_+i8GAR^*Qe1_PN$ufb}HI<rHQFmMXGubMT(B
z_64yXk59M^Z`JG<C+iBKE*O?+Fir%q_o4=m_ZtaS-3$h#NcIA=6O|fWKVb>fQlG`V
zpi*bhqXG+7;M3hq>A~8KZ4d8-AMMh369N(Cg`WoM`_4Gs_s;)67JT*8LnR(F3m8{u
z`F3;h@x(-GfgIJ={kXWt-xp^A5zW+Y6Mx@V??@>9(i`v^hhNAV{A%vG_B8YG34U%>
zv#sH_dBo#h_@34k+MEL)<N`M>Xejs=M0j@xuL~hPgJM@zk$Dv?1Nqk96q1zzN^0s=
ziG8qn>>d5!)L2==9@MUHsYrLJuU_g)#KuH_z^?#54k6Qn<+B9D0h0Tp5?4At2%P%A
z{r<IR$6Ns>XqPeoVRrXkk8$Ly(exph8M3Gx2m6#|dtYFcq7Zg4Y>eLKzSr#Qevu~t
z0e5{rV3g~|oGrg4#OFNxpj&8F*Y^k4XUd*CuicNJJRW^gnUI!QHau4}-wqq$z0Zfd
zyPLEr<RgrS^ELP!3Pq0VV<QVm9pUDbcc}|GH>0v!W5AWd`P1ob$SJSU=-uH{$c*{!
z6D0WRD-fR@Q6>V;zy0GRk_k6k`#f+Rr&fu8<F{o*+dah%ymrtge|Q<}HH4xX9zNR{
zKY}PkS-*PRfV7o8Z31ihF!``^O(?nirnDHfLYi6`InLdU={tP<^p_jaXV33OEenhT
zREyfi!qdSX;<nQdJ7ZYp^9)e-7H+OUbGZ<-U7%>^Ww($Fgodj*GtkpXBKrY>%dayC
zG*=>RG{jINAI0(A(-ozYdcEmj!cGA}4Hg?XNZFaC=y5Ps-ti$umMrhSEpC+gPX(RA
zqsr;rxX36H``ZSpcVht%6EgALx`B!M>rjv3t9^@vt?g}$hdf9FFg{Z?7cmV}KbRnj
zDU44TZ*C6zxIt)IulTlp*w%#vHpJj+9$0qvXKI+-4>;Ux{NM7w9Ba3Z73Zm|LGC*t
zp>Jqpmw}j!BGbWWpL|eqCCogvZ2~ez6m~avjj1k3iy3vHX)=?T!Gu2VLEXUY{9}NI
z1E<s47QEUHm+pR2u@#0V6o}@qcRm7kmUr&Nd>A8MHNy%0RLxMG*xos6?|8O&1IRP&
zi~7EyJwGW;dyVvjk2!~kRZ5e%J-WrdM2mzZ2d4cg=RO6A1Jq;RX2jny^?&8J&v=sf
z8l^G>GhZA#{X4yKAg^t(wi%oEJU^cwW(%30)6ur%UvsfE(HA*8rPuOQ>Uv1#6Y~W9
z*L@ONU?0?r$l(#GPp?&Ek8xmRu~t>i_f>BN?1fqwi*VTer+7Ve11lFZSciu(qG=8|
z{iHgS3L|Hik8c8G308%Jl<iWw#>k<P=-=-8+P#-81?w$jtks(rQ9Kb2j^sNDfkaOA
zPSN$-y?}`B_-T~=DX<$<*j5edruBTj?K;zsBUJe^BREdGTt}`bL6y@&4R0#sp{{w4
zIl*o$p-s1Rj^gwvHfaag>B~%NTX*da)*Inl=zn7GkL7@0-|Oqre?JW>_Vj93-w3_+
zYNieWc6VNnhy@%#af1`YEUhwStb?dRNS^&!_Pef8LYQ^+&cg2hoIwz!LJ+kxfybxF
zG7k2L!-s)HwtkJsTr(o>gy-z_mXVihYj64Ez4oL_q>m3n4D)Yl((fL4)@#?O4n_64
z2xliqpfMVzwjLI&`PNqKO2VQ^l}n@a4#?6~BXEUNMuR~aPM=LWtzNk6#UboJGDF^5
zY&xP91`!CH7dds}u8INC#QAel`t8q=em+`ZYd-qU;JV9?e2B8A9+oMU02Ns<ECT%&
z0QIN|qjcU9Knuy8;qz;Bs_SrSXw_Sr|6s`gD@2Z6uk_3Lp@7RK1{WJE^kzQhCFNc8
z`~duyg!lpwbFdh2NYIW9?S;Y|z6qELM&AYuPoYFgYI)z9M&dLa2_EOVw~nvJyM`}I
z4>q5-lAQ>f`;HZVqk~U-?*wOeQyFVM^U3>tM~Zxs{JXOOx*pj%0O}9&L^vsi;sts>
zq~Ph$=fLpO><%J3ftO!o9A^qpzu||mN;pp?Dba?U>hp;itQmKAz+Yji9|E8d;?5Zn
zV{@0z*hJ_-$tpT$3NE!CA7<sZj$f#t1jqN58*jq4pNw-e<#!c>%S7YhO$naVZWN8o
z#!R#8wlAz1O)(Y;5>QxH<@Dn``;hSozlo^#3T$`%p>RReTn&vwjOFOy2mC2a31ymO
zpinTku0k5^9&~2erzgUs{Ot6EFv;#MgP3l@5rtUkrZ_|OA={;2(_RZ8*%<VO?c;XW
zj=6b8fjkqp)PaP48<oZ~*Jj7R;~e)x9-F|Qn)4BUq3I_VdfY)D4>jie)}O?6BBLEL
z%O*?a{dndlCW-`})G1iM6`(Z){Zj8Tr_Y>k2qzE)9sHH7e<Nn#`4}-ZP!+kcA9kz1
zMB?A5uigA=CM<`%#II-<Tkf!GO_#6<84dPbd){P$cwpi^jkBSwW-ws4WzE=D*BcIY
zc<F7HYYsbQ1Uurs4emsm43br>bDAx!Zr#7r*r;oHcS%PGX^ocP$U3^R@sL9QHr#<D
zxsV;u0<IN7afx`WDi=RiBXhhqK1n?Ja_3zlHl45J)l*_6W?q;l5ik=eI0zJ8PL9T*
zYTUPpvwju*LOmH~tb&+2S<FKB+a?%Z8f4xS9n?5TDD*X4x4u9IpM~*Cmz$F~YgKeX
z(F){((yP2ifS)IIVnMJa;mL}o;bHbXiBxVMq+x>o)51umGr!p5(@loSGb<tmo|4_G
znVHCX8>XMoZ<IK)pt&x@=OsiVNWvH}1pWCz>sjRFK<_;2JY*RU7C>-5%ZbRd(YIx|
z0J}8}zwzBWe+E$p^4(LQP&Ek)jG!~yj{}{-sDuN$mIL=|v=~$@IQHP_cZy{lH{_y5
z@VO$x#8s=9&q;7o^OJ!a!uQZ~y<8X`O2S{%x*=9NH$|Z%s;sS+LzL(!ZlQ=&r}*n)
z@#OIWeCbxfHlwrp<QbuTS9Q}yr%0iKM_9y6A8@DF$RBqOAINTi@Y=q=zf-{G$vAlc
zkX*87chlArXcdAS;$8yA&^7#{x>r{7@`G7!Q4?DaFR#wKjnbi5GHka@H48=Pbcv3{
z=kZ=1y|BVFSK=_D<FBLQ=Yd*m<xeGZPzW-yDCjhzu}H#Jt(8G;kQ@`s?kW~)uqQ}a
zJAd6TVCng3ex)LMHzbedP7H1FzTyxB2xu6?Kp`C<WE7fE@J3)0_aJ;369PCd#b$TJ
z#V)VM^QGy%2k^zPmtqfsC#pCk;FR1-MSYI2@$|lxhj#Kd1l=sycmm*T)W3s*qV-c<
z#4=|nks0X*oGINUXOGUbZwskVy4DDDj8L%hq>sE*g-Oh$+A3z?7h)vfKuu5Z%Kz#!
z3b@@ujtv)$GpiBiXxyN*-`PV?h@mFSi|_1bfRgGoX;X%>3|<hGyvIPf1%tFGjj%#y
zcj3X~ttuv!n@7Lz!bGW}lB`xG3=)X1{@RK@5Aw%Z&#zC{v5rPEctaMXdjKsq#ZS=p
zvIS5_Mgwb}b4MsC5;`PdjH}R=SXDIWDi6X<4cU?1UE+U}-1cbjen39P726BLQpL<Y
zt$m(&Fo@$}Lt=QrACV+SipIK!#CzQTYNbxu)6QVNp`b0*&r@x|JT^M>^ikf@cb7(-
z*no}O1J-tRw<qxw*%j`huw_JaJu5cTh*<f|<zD6XeltHg%DodVo#pOxveu<0y*pZA
z=5mA}NkUS{HvE1ZGgcfgu)Udw{nTICL~O*@5BE|eDcS~!r>;}q-g_K<M!TWSr|*`L
zZ-f~<?A)Fu3}xaBNY~tx*CA&Qk_qK=g@-l6Z%3pM#&>Oq&%hk}W0>gQkr`3$yy>SU
z_~vo5>)(SLn6BsBadJUl{ADIXv+n1zl-=O~Ilfg%s%?vkt8mYgTWXZW=+A$*E;^jp
zAMkzgPh@qaLXVLVzDlDvu>fPWVyCtEiUJzO`Inp6eFrMiNrKq#Qt52>Hcuh3l~b%0
zRfS}CJ7Mw8LU*bBsFm|gQhTEk>vp}ZaAonSNE<nH><>BRxN*)<-$`hSv@#NU1(LJ_
z^mE5MPh>K#*B9j)l{zE%)~K`<$BanwiN!y(YDetzkA?mwRCLPu8DSZ8Ex1>s1wF3X
z)}fpK5{{d10dd8LLoTf+Ui8jE3xDRp3C>3l`2l~+#7p<w+ZKlIoYz73#mn=+<=+YB
zw5ZJBw)MA7kHxB#7X)+)BeCE~0ilUk`Z=pIE@om8Wu4D+rX7x+pu?G#bvM}y#FdQI
z9s@?8%2|VEGRm$4J14K%tBFNeSx5$xOVh)QExYWJCMt1k92;69s7|T;GUvwA-*9G=
z*s=VD4-0FcG^TXrup6-V4m4epT7Qj?FM-)uwFokM!95W+mt9lOq&#beK%Gy0$Z8tj
zq<vuz-M$GBvLu<a`)HJ7S%?!zcNEP3ie?ZEg{B4vY0+s?B*Pg~Dm2<`8j^p}J!&jM
z@541d-15<pI}FFnmiN;j0z2rado*$%ATd3V$1~ybAt1Bn#lW3QhQk<wP|$YHO_02c
zi~p+X6`i=KFeQN3S|SnN3k>0*?7Tcgm>r{um>#WBM6yeXuS(7?CL*Gxl5j-wgB0%~
zgY$@^V#W*Xh4_OJPttWDP<OIIyRk-panbq45vN~|7&m-4npu~9#i~VOvaICO%kx(q
zpNyA5v1q1YmL7ru_7NhHhY1W#+IXjO`Q_*0+CeipJf4I+J7}WB?d6w>ejv;+2zg{J
zkcNs*M}O}@rQ0k41s$a=5>;Z1YpKm)%n=Vclo#H!*;Y_kGuWD&S1=?q;qq`tCn*jT
zumTn%#s+lu8w*{&zHjI(&~b@FvO;lk`=*eFOkL=##ANJc1N#pdM>Dc;Fqr)VcYUxn
zM_-MygN@5!N+s;JQvI@fNVMZI*hE!Xo%I`kXTP;%G#N3*=q1?E;%paL>r*i?!&qTB
zFGd8%L4)`kKE!3Cb>e2H@-tncJj*{YV^HfqJw)tD7M@hrcDAU2zm`im;*m1^Tk#ut
zf-~epOEnv+VT)BL3q<KNVW>@>cQ9y`&BJL>_&*6NhkWvu-5O#7g<)mmn>e#IB05J0
zA%r3g)NfQWm!702I}~=D<Q81{CN?U%wx8|Sq^+Dy4WiMQi)`?s{5vgJAFxQStWP*L
z{`m;<a&}pWOl3(Oo?Q_9C1cCkSjrWr==_C2oQ6Jlcv{y9%cALzBfSXbda5`GQ4oVc
z&V4P@OcDPIf9<roU69<IdNSxLXW0)o6sb4m8y8sYF1K0%4$kL-cDzP1*%r?p^z)Cp
zoVJF+>O5EzM9jv(l_g0(Qm$@_rp#yqhm%eXsn&aC*Q*KTm`ynMm`gCn63lrCB^Ok*
z026P7#ikp<{60e}a2tr!KnoW^WFN(A1V{SQm{EeMj9rmUw`Ym?_g_Eod`8i*h$AlH
z&Ej+D?HPpHEH*z8U$HkVUhoSne>oF`KcTHbgamL0m03{{b;-;TK<4;kt+=<4&E~Ce
zF>sP5<vZ;+g)+!Pwh*oI;$yR(2Q!8?Z1aJSX1nF)RiaY(4zPT)S6z>nv%RyfpM!H}
zM=QNP!A(~U;hfw^(pB^#g|<f(U4{||QR>+!w961Ib_EHZ1#kb+p?Y{F!0d!8X*8M+
zqdf=#+_^=0m@aL?;x_z}753=?y&5y4*1Dk4jq)&hL%blm2KVO;p>E;g-s1LgN*wI#
zJp$|dM)k^N#eBREyvO#;nI`L%{yZe`=uUhiNlcM|LT-*02cLgtk}zGAC9R$9Ti|F(
znl5a_QJN-UwvYnsnoH^I>my2+rb_RJX%Wa&Y})pEiy_yC@Rf@Gb`$i+)4mx|5-;J%
z(icl?4(e1SOhu3OfU64cSM0Ms|JTOq8i*TGS>-<`huI%ObzhGybtQ98T5YK8Y;sp=
zMii7qU5Kk&XNpeMU!n3_61w&5=o|#milaoU%i+?tNQm;r0ycV7V(_qwe%7HG#Ac##
zZ@xc~BTY+FlV{|><?gpIXk>nRHFK~M>eOX_=VVv@EKH+1!7w<%X{O-huSQb$t3mq9
z4Jr>6y3V1ZPd9+x`xRYJlPKcr&i?%VXCT)HXe~MgEFFE$5%bC`-T_ed(V58@nkjqY
zYKC}%U~ytKIY#RDpM0+tXLBOBnFpCXt!adU_i+?Kzd=ERTSA)X5UjWP{l&F1u<SfA
z7TrL+k`nqmhrKSme`HfQCpGtn?Bkd=Mg!q(jiPH9a^4ZHr1fV+7M%2Dy%!D2NU0df
zbHuGQpk9ID)KnaXb*yOZukwNJ^?r4nsXdARI3|53C0()jk%56QJY$Vva?-`=CjA+;
zw3^2Lnl_umn`(KtVri<X9$Y-m`J-uIzuxRl{dQJLKkD?pI?TK-Q^alt?~S|v#@xy#
zQ_E?<+WpXP%ZyO@j}h0zfdA?&|IMjbZ1jx)(!7$gflCcHFNV73%sk&m2^1VjcAECk
z+w)71A<Y(OcTtbIPYwo_?7A&>*wTLCB~u8WFif5{A4(R*9}Y77^$G6=#i6Jd_Pw05
z7}cfX&fzp0O)c^B(Y>R+WX6medg#aLs#rO)*+Cs}aw`qWYV@y4a9bd2WZ{kxHuU|s
zF7T+JL4ujkCCW3D1R9JodXvY=t67DrG`>x;u+aD~M5g4{3u6N#dXa6XcWWykqWmN&
zMS}7Ue(yO^9Mb$Z+Y!6bC5Z8d*$q&_jUbq?eWUvKFze*(-E6$R{2X|XV&J`w85R_8
zYX~CXs5f1PJWAF0ysV;>8kKC@-{nQovB%=OS7^+LI)mQpr_ofTSCfVs<!?y0IGxx^
z9(h<y!3oToF!dCv?t}kD=heH9Wa>HCKQ?^tzu6Ue$gb}a+^G|P5U~GlVwz6d`6Gky
zmq_Nl4LJNuSn9GhqzZvIy^>5pBCZLL15$yxND=G~OboBc<tH4^U9s_}aC2byuyinG
zA3sy))^{NBHk3HEe6}XeT39HX=8vspvm{5jCvM{Itg_;By?j!uqUHp3qgwQosjDxy
zIp)~9)oSbMiLq;U>X$Lq8nFDsfa|A^Kq}G>Na5j;ZKi!m;dc~4@EeWo+)3I}Dvi?m
zwC2*|h;gND;n-I_(2sStva{kf*913}D_JuGc5}D+4$IMe2ojyLHkd<^YM`;H=6eer
zyhXASt?Bl#U$mvLrE<m<G6c7r2T>w@$zLDUD|PvI8hGurhUK}M$(Cw@==Ud1Tu5?a
zocX<ZuOcgYQX$$TuFMn}sEzwtrRH~(CE0-y<BGK=y7e3_k~0)?r8vf%Ba#9J!X%Li
zQt-)pdQ+L2sYF_%;;YEAB+4{fViJZeVM$T$;8dvY_rOV`)i89+mwxDMiu2LfoNaC^
z+5(5E{A~wFcgeP{UA9c3lxzd{9=}s(FJFKO5<+O2#tLU1hUs!pm&&7RV^`gS^~>9K
zRGQ!oV5bK`AD^J>+i!%j%+B}i>8b}%)F@s4picgPftS&Il;Z_j-lJQwoT{O|vdoEw
zRJMTYiXILM3x-MZ)M%0|JWVTZol9OyNKVnHK2<dwL4*r^j>_l4LCKh}1L-!`dP>IR
zMbAiI3f#w@MtKP(1Z(y3CdqfPYszJ>SFeFmn^~I;i?yt4R-{g?&auqNRl|XF@{6h;
zH=b~I=E|Ho&nS}qxj4Zk?_1B46M)O<3f<ZWyDwE-$bP14%hOLKIJ+J<MBa>z9Npk;
zGuo4-eqJE|^yP~}BwrZfVKRz&Ubn<^(HH$I>+W-2>#537o&7IcAKHwkKe8W~`qXF7
z;L`&Y8)Lh#3}3f;RM2O-TIuW^Du&5h-3yPp!-g-ap6*o-`n@K+dN#dNpOFX@-oO{f
zPp-7Ka}`265H===#`>|6uPQkTT3L{<v)%7niAn+d@WJX=2y5_#`@15iSoJZge5_#~
z=mh~66@sPCzlpFY@g83D5*YjJV~*z9QG9<d{zV|?pb5dBj_e1fC#3snd{+ylmKFC5
zRo)4VoQvZcu380yQH=P)f*z$HMeTLRNBhjRW5#I?qHAS|2s)qT5@2uLqkl?Z<$rIA
zd_W~m2$Nk1XFZ7t0v#pN3M)VL-v=F|c@GEEn6&#FplB_VizSQ3OTklyP%FS(I$A6_
z^aE2H7R)EA<`z(fcWvdx{X|s;eiMxMl+CkzcC{Ng(ocn-l9jC%ZET6hhFoMd9`}27
zw{)-SPSP^LI>GAbIK>^(?g!^YaVW|M;qlKo`oHS#9EQY?(g87<IWRE#IPnwqM?JZ)
zEP%H(f(~|T|Lw$75OdZYQknm&|95>iU^W$AkLnqt$q#K+9DNMg+{;)0yU#@NDLm`r
zbYDe=yy#pe0*eCdv(6MFrC*#6k*pqtOqxZ*&+<N}C{>Vsx5Pjruqr2)DwJaWuaxDR
z2le@q(OQw?q&XpUJe~=`2&6_g*9#<*?q2Dn>R41!uDi><UHmt$z-`QnE~i(Ym>J<b
z2ZcDbJB@ncQKiS-CqTd3H>Tc1=EyAbvX^!siy{6Y%wDEnC*B&dxl!Zv6i+lvQmoMb
z>IDmuOwt(-7k@mEDF9;k_4R)c^-j^5b-~(b&`HO(ZQHhO+qP}ndgD&Vwr$%+$JU>3
z?>)}BSvRxRTBDxQ7&QysYv@B?w;<?POUk#5v-QXPF@?h8v+5cy<Wes#rGv(f7lEe_
zOix=?93}-35)MuL{bi6UH~^{W*5H2_Tq0B^LbOk|z)S6wy;jXvV7aP)ZXUpOWDDkz
ze8Q@atZt{m49E5lvyQ#I1uG|CqDl(MH{=v^=h`5wv2=Wq+b$k%9b)L?-%Qlv%<l=x
z{(+DZ@skI-AS`Boez~O$(jy7j`DrwUj^gWW7#+fE@4;VxX|sbx?D&;`J9H;>(UPr`
zY>SY0Mi}0|g!}pH<Yu0p-`#(Ecl%FTsq5S==Y43P$rsg?463fu%=rQj%>4_+-#@Z>
zn~=tRvkL3+*~E<69HSp;Qfeajkb|zNq)!~^>f}-B$K1G?F~oHOutL^k^?R|Cc%0CA
zMd8gm60kICs<Ybm%$!L9+fM6V9$n=kK8hX@+p*nLX1EIDOc5Xy<$Sriq1DT(X<+aa
z2IFVrq91~`d-lj)yTIcO?u6~U=wfN&Uh;E$J^7Q@ViiF}!|3rCD4bY?p}}GMAl#o1
z^-W8U-dmmMd*2~4_G5pa=48Afqjh&Ld<2YiX0C8|e6M@9sq=4oHnsfSk#mo``sKNa
zOIk3qJdi&3-oWmG<K^OmMcT#57cgGPIFR@3C_(4Bc~y1Cpm68qVR#%GJnrPgNxOCc
z2BB$D9NEvU>y^Za2bAz&fM40YIh|*UHzsmRg44*;<8rGq<on`zg5G<-L;kqn-?Pmv
zI8#M5?u|@m*cp*<=iC|U!Kgw(DouDx0-c+~xAXVAvn7}=@h?&^S`6V)3sNBrsNgb4
zeoU5p{(yjT*O`Gy7bV9+0>iNFE&Lhvk`U}#j#L>_&66H3?l-rZ_R7^;U#x0&BvjmT
zxg9aezOO8)*yF?3p5^$9M_1qK9;Ywd(f(5JHlL|Qd2jZBFNHBWP<;rKVjvA7b^8of
zfgE01L$EUE$>Qb&%f?An1I)!K__ha_CGs|%R^XS=OacwBoaZE}g=INBSE1DRFYmPW
zI6#q7EDY|+0_@PuD1|?rt0#4V-@m4$$gbWlnbM#fC>!$3?ME*KYo@hVUQ$iKVg8?y
z(uGcki(1lKI$r<s#O~vub5z;cEW2Tc=~PA>#|rZtZ7h&BB@mc%Ov_LZ;e}zc2heMz
z!CEd(jS=s<%vS$e3c>E{PEOwbE|cS3&ts1h1Tp3Ye~A0{-GVs0n#YN;f45&3%AapP
zbEc1Or>R2`*SB(lLmXwo8ocf0<K3Bl*D!T-JgV0)&Fpk~!P*=wNt&I!oK8`GNMEww
zpX+O2w*_$hT<f_$_`oLseZ4tdvouhDcW?h*<a{5SyWOV841#^-ym}o=^b?D0^mE-K
z<`TRIfzJ<MzR3!@FdrU!!K{hikdv4R;ad#ra&Tz8?~Fqu3Go@W^vKNB|4!xf0gEtm
z2>tU;_}xW9{_wGR34cZyoQI>85sGhu=hr9mkg_(wN+A600PVKZojN5XenS8BoF^{X
z+2ZfqiB3wH)ZRTkTNMhQYN`eI`z0rGe1F1PSGp)p1U3gq8AD2-g7<@X?;jD#S2dSr
z>dsUrFDC~d7uQfv*{K$9u)582JhKGr3;HnHcWw9`uaA$|zisBE8<>1+%*U0R@iaw$
z$8o0i%s}J-7Ns(84j!nF(cGySg)2z=H2K$=!c8voyz4HGvE61YHy0A!)`!DFkA$=E
z2m3#<{#xmHUwsaEFDn;KzEV%wFTW2d#wcC^ek27Pif6PTKWz(9diFvoIuLQp4vYFW
zMIxYW_(wJ#A%G8J-oOB#vj-s_$>O!#$kTSpBQoW72`GHVTN1kN!6R(xx3R&=bIG$t
z1X@U%99jjac0mK{88FdC4=7k4<P1aPs~o2C-b(#&Tr9odTFNeGIBJ<cs5jaH?zIOp
zVcop~dG0JMQ?aJ%3PgW0UO2}vDLIGvNlmU4X3bhHt5y%^USgciYTdzvM|v3=R#=pb
zJ!i6IsmDCn(?PrwBmNQ)FJtONs-*kjaCP<7{@Hma*gH>;-fOca-IeBj;A<l!A4=mO
zF(vP()e0G*+lUm^JB!A}Y9cG53x#&(!(Q0T`Wnr#Sr%c|XQnv}WHa8}(lu~LwSwQj
z6Qit;72$3kjy3R7b!uWS*Kf`JYW7R+B4qC&83cX%@`S&l%y>YqD1-)Dm6uS#wdSA2
zfOnU}K^Zd42OxnpBZdUgJ{1g7DJb0}5mKI`0LzmBt&6O3i!}kbc(^tv9zM9NEt_u<
z6R@4Qnas$BZ0F}al2$F*)YsvlS8jS_Aj%)WH*V0aLFM8$8ev>?2H*+zwCvR}R#~S*
zfZjw&XDQ|;O{gPBoh0I6UCl<LYT`D;CbTlHd$)Awmx!>T#vq6`M7beNtF52Ll{TIo
z0ije3rc8MEX}hzwoqjv%|8%hF^u`>=($-D7;uGu^*{;TgJ9du)Vgo!UrS6J+K~Eel
zvKA8dj35%$(uF(}1x9RggB*TOA#H$gOqFhs%j&1+<Pcygsu09|Ba4ZM;Hm!Xb<uCv
z&5wJO1D};3w+Joi)KULQ1oLClz6iw`F0LoPV9c*rBubei<fBcB!ZKR|wPMkgm%#U6
zVD`{pOaL^Y+6@Ss6SDFR^Lq?x+K<&S#=(p|+4#p6!MthH`7$2F^{x+E=>+ePyzUDh
zZzqC~;E`S#d<7v9A5wP(A=BuqNYZ#Niy89z>!q}I=tYoZLEyjY2}JV;%_Z~-u5jNr
z2&Y3Q!M`_-p`B&h0`9>$xYCR6kw@crwB;n7$c5D0$4AQp(49K(@jT&Us)QvrNdGWT
zi4;@*9Xzn%t7O+Ap<ByQdrNW9T)@J7s6@K+F@Ddt0F{nx_NPjXhkM-lbboIdvgPB`
z@t~*wYje^jr>P=Rh9gF`trtTRQep4*AcNYu&<p+E!G6+Jc-E`v?B1OfqEmUqdBV$2
zGQowvn!QHBigyc+7VWvj?lnpx_mWyx{{nh9g#VcAmEeD`raz&yC<1BZJr`i!jWII^
z@LNx_3o~u=+zQ81*SY0vcr3;{+`;fm%qU10L{YWA<n&sU$NCGQ0A<(MjwXp3KP1+r
zWq-&&EWwZm5dZuk*8ehYVb$6<RVHRJaTX&V+}>ji%T4X`Vf^276?QBmiF)*CnJ>i&
zcjQoxpZPDNMoxVNQAs~P-_oWccTd%FL6fCe&VDV@0^E^i8`a9|(tK|DHElm&jQ%>{
z^pa_oT0(A;p>2+K)Ip-W{S}O$l9fB;#jHQcr_@yPfc!p3F&=a-%MNAALQ#lu?;69X
zkB+X2Ih1=OxL^0q9TBW#wCse1cX_`DgUzok&N7c1rI=i$>qX`Byt99h<SUVky8LS7
z5@(Uw>djlN{03P#&K9aESk>mrLcPkyMAAOM!pL}Y2uKNaIKwS?+fed7({YQ?qj=cX
zek~CfkISsu4AA5-HDp|P7WBxJu`_P{@^B(TWMiMZnI6%~nwlgHIIy!QBtRnpdE<h5
zZ;~<S*t%zxOr#imK=D?Qzq7YFcQE6$)~MEI>CK>@Yw(+Yn9fv|$R**L#`Rv5KNtLp
zB^)gw38KNL!@8M7|3TzOBI<PMgQ?sa(^8L4(UO$W1(eHA_6?S=zVgzX8v4d+c_j&G
zHquc{hoFk;jk0ssx7Q!l>O{FFU77U5&JPx;>hO0pybCfp9_^SKW11#bkZ1=P<VrEF
zD&)gVYc)TzKnh0jotL+A%f=uZ*~1|*n#BJ+;%6Go=Megx^sjfT=yZCB$SRY8c}8sh
zwJ*CZQvemCj{*Ns|HHYEn{z%R5#HgSkrzA~>wf}Fkw@<{f?}wsX?Ky0C<JEoio-iv
z5X}H*>=bAaT;k)AD-#+H{;*z<FHTU&5D3D-e^=zM5R8s0jmcC&aY!6=ekjjh4F13#
zP!dX@kRlx{g53I%e$2_~9Klp{pj|>pij8csY9SFo?=SnksQU2rk5((eyLH4ywVs7}
znKOn-@en@Q^<Z6{pxigy;_z0=F;U4}kSpPhG2Nb={`@Q4qoJ+birKmtO}6%jcOxG0
zc*Hv$jz~^w0EPdDBLAAixJ?XT(UcYo=m&qzLL%l8Bci3GN}2ONk7nJcfk)3jUm;yD
zq?)x=^qL#OfVvG??fA5s#VE_jk2ME~tFTgb6`=&_&^%84n1%7wlBlV5Q>o(|IIee#
z{$KVjAYGSVUs5&LskoU)@)7MyW&a}rBc8H{5V77<*uQ>yGDKNPX);XWdS$~6L)%yC
z7gOi@u@d$1nxryd2k~!`yrVrIBmdAf)3`+{GtptokE4J1JSTrFz#^C+XS{CGgo^x%
zOSb*kD_H%9Jull~Z$stnr?|aNAW>oeLt7;ttM`b^_kdA&x;T|kN)XTIuN*2yHn=@S
z#X0uBSS#{deiQ)&Kt(T1LdIj{BgrjT04(oI{~elRNBrP@NB><XIWLw*xxja+DZ@rZ
zN}FjSvqZs~NBe`lmc66H@W_8y|7PX4c}QLuT($l`m-HIHmA&jXwhl)6pGg0sSPDqg
z#_;U50r2usCKh=wOT=_-)ZD6NoA0$hk|DM0CL_ffvMnTQB2(Uml%G^3zs>QEjy$0y
zC`v}A{F+a|_yKjnTVdJ!xqyXSL#B_0ma*hFBX1^a;t#mb1y#;2@K(g(MA#kJy+--_
z7+U$_ewgYuB5$We6%~N`vf>hR+2YkT2FkP{KiM+q4KETge7BWhaK>9lo0)h@p6=7p
zpo6Gb3YK;Wt3bsyWu}n^BO@Yh9zs57qck4MhCmq<42jGC_;_V!JJ*qlW5VX4`Tq^q
zoi07dy8N~w?|(F!o@EvqHpJ*ZKRgc+diLTo=z|}gHxX3)zn&E!mLgk0LHqTi|DXp1
zu{AK7bS%@~$^Vi60A8~tTWE@opw$dy`JWJN5NuZ?m@4vM#Mhx#p9FMlgp^d06S3qY
ze$a!2_&<$kDF48|P{8(Ht7%?ZFp}b4K$_BHo&R4fQ6${ZF8<R{TY|S>Jd+MyO5>{v
zM@BrOu5f*md{4!WDsf%>($YmF3tPn>tN4$>Fku6W;NrG}BH)?-bNGy~V&$$x!kl!B
z`~N9N(QUzh#_=ER@_hNvDuz)9d&V%u|1rp{6d}rE^Z)T@?K4GL$)Cf+11d!SF&q3b
z;eYv*%{E&9n?uql`TvV0*fKAae_IDP=i}0#$nt;U&tO67>)$#C31zcX#;5-@-sfeA
zPg?PKHXDipm&~!@<rd9+LS?tcv7Y8S(l4HTqImzU{bZa);h9f0jyTJ$wCcefQFLyD
zHWF&$1FR~-Oe7Ta@x}#}(mQ&^7{0Ftmh`r1jH+fykbrqr@jt&<q~3CI`jCY86HRN;
zb55&6bnJ?<j@B8u{>Q^W|7-Ge@|-eHf8+F0u}*RHCFazviGHICr(r+e@?%ZdL%ARF
zi2Lv52zMQoy7RWvtT7{;HW4YFzH@rHh6auQ<cPy7mWx@Ka4GAyZ&L^5j3yy{C+qmc
zXXFiy2?Ga8Y1&tc2t98ousiQ)H(MgjI;q&2H*^(|-`*wtFvb;?dp_j(4vbN8%&Ajx
z1mSH6+<vax)_RNmw6@>jzv|<vcu0Pu^han(RA){|t@tjMBD@WWGB5s^2)w@j0)^YN
z?)zzJyA;MH06i3><wC!no(45dU{T7{&T~F?wT62n{5_nWof0D;q(3HdasfJMN*YRQ
zRArm$?;`~km0nz_R_rhVfGc^@X!g3dl;MvehK*6c1q!p*=!58_zZ_QgD7@u9ogY(V
za#)0ps`>B^;oMM5wCIy?$(_g_J>Lon^-hj8m#zfdsId!bkF5!d$~#xfrF@MQB9n~9
z1^eF0(590Mu*NHxoN1M0-V`UnA}g?{nu-|gMQy=QLN>cL2a`Qr8;Gq;>$7an^%e$4
z?1HC+plud=sdFsEnH$apAo;IEEYcE9CKwu-?B|Bb&7As6_NPL|$4FlZdmIoW$9D|{
zEimc>OjBl3TgQ_2q^2MZjrAIlCxkmD&aG&oFTvQ$f@cdmyRbFlJ77i#oI6S4emLD@
z8dI3B@K91k8amOOzm{A)e$>pvxEIO%^C>l2i>w*h$2JKD;OrhGd3&PbaGi3`O0F?K
z-B7Fta>CdLi8IK5zD`QxWUKA1B<BYwauYx`ytjV|#rP}E3vE*r<MeCZHcY+(^MZ~l
z;#??VAakNc*O$tMx~tWrw2Na=eEXlmZ#=$ZKz;S6+bO2T+wnNq{rdXdQWjid6ZL#Q
zy1`KYqM(P^^)sq^V2w@hF2ya>ql6id9;K{bjpzg4cGRn~r!9Sdi#@w>AL;$`SoS@=
zHHgj7Ml8_SH6e~y?81FT6=OLzthm@@q3AX-SMhZ7wNl{*#|nc7Nc$ctS80wQu$+f1
zIHZ|218*s8V8+gfo*7Yd&uBT?#KLe<@LFO1TR25JRJDHR{Xq7lU$&l7jn--EH~zg<
zV%u{a;xQtcvOQrkTFA$$twxAwN*eCs$ke?L!2o_FWnTpA^3CrMO!r1QZq~?c8VTBA
zpT~YNUAh9a6S&n@2xB2yA9ELzS<Wl{e5fy>pCKSNP%zea%!nkA%|W0m-06ft@Y-kN
zjlrNopNJtF)ReIdH6=MNn;L^rMua7mo?8jeu?}3s7Exq`x;nt4D_D|2uNaA>UYHV4
z0W7UzQfD%W^mxQ(D1FI9Oq5Q-EDOYJ`hm2Cvh4TuDU^XB<#5DJYNY&)FeH$?iUdu+
zo|!dfOp>BRY0PORLnsQT<uw6C;x8F!&VU^$yleplu1=L&PwA{W?RzIW;Y^Rxrt#^i
z!?g4vRJG^K&a*RJ2?BTZq>={G2E{AfO`?oO<Q8zx9}P778JEY?Hi_fNs3|@O59(%R
z?JlnMknTB5nVkvxFWDcS=14uKt&yV^Wm3)q`p`odR=H7aYJ&o?L0LxCy@w9mx4`tT
zq5MdI)TnL|?u)J_4En*z7Xo|a`5$uK!aF;(?GNxPyET5Qw?Izw%?%6?B;)=_L;X%F
zz36*2(EDrGT(Z|gfm<;=n829E))e(tD^EFB+jbuG@2I<+xF=hwMXPM&Hig8%(i9me
z?B%x)^XYG}0p~!N7fo`7#-7ABN(wTmMyjFFwa!k`Q;|Rt7s}K*jd`lj7(G31MZ}lg
z22qkXx!;Kpdfbtx2Z<c#MaI%7p%jO>TrR^5?n>`vPyCnv?m@Xt2v4wZakM*!@Rc0c
zv;Yp6Ng4?UW;^IE6QR1n7V3q0G3WIU$Fw%D)U~39b)E!yJQdfM|8ToTdv#R4fY69m
zfC`U-k@~o3%lHirz1TsP&(Od+)3<r0Gbgb{zz5gsJw_0p{e)+Ful?3Iw@V|0Ub4n=
z-o~*(VFJ)!x~fs*RSq}jJu3*@-1qqJ(m_k^z}jjT`ZvLVFkzcW1|u(o0E}4(O2!jM
zN11O(h!4d0B?MS4;ke9imdBjTlG`*`c=oFYQAp&q#B;{uztOjJ%-l@b6K?|P;-b;P
zM6s7^jzW7i?OK`7m`56J!JUMQ|G~_m7HANLMh+HL@Ob@EtP>P@PO9>nON8z(9cLs<
zexL_T8Iv-k_(t`h#N4--P%okjdzv?wy&y&>OG*k_P$PC$No{t)qexciQ{o$#pras$
zw=;&l14R{(+8^K394Lqk!kry(dv3HmVlVeZFKMm3dp=8<7n}GzZ3o$J-;0wg4B>%9
zTvofjw*fP$f)5f>su<I9p5K2OtCrhJ{|#aG^FwdjNr=8)^FEE(VaimI7tWLBYitUn
z=Ki}-es-FFYT*Dx3S@_9RSHY&#$OoeDsAs>ba;*1_EO8Ut5l<<4)^TxS;1Pi*umar
zG!4vqBlAv2B~X*`m4vpMnOLo&R98tlAf<}!eMh2#P?0~Y3d_xg^!*fm_$pGL5d$!;
zypxb{4T%4m;#{@G8U({!gpiaeMX_)t(ZGP=cmuhZoDr{iLJLUl48VcCLzL}^>Agmg
zShI2>+PBSE85o5WUJsWDJB}sAv}`j$ApN?b7<Y)mi*k30sO|9>99T@6JU1i^kTu{6
zP!MLY`-Le`9I5YRs3~HEkg0%i#MmmF2$)h<2_TB#KwqUUk5zUFna(0X*r*f-Ie(+w
zEyc04S*)ttW&NzSNpX!9-81dQ4o9WoYPVJr6P0q8?Fs$U%|*||9WITn_5>cHdzPdr
z2ccRvIZ0}Z?5oP5hD6zX@*H(CRqA2xRcM4!njc&KW}#6lEIpP-!cPoEiIobWQ%`T>
zU_AVr*Qe-0o}!v7oE~!h=Cs*p!XD1`lK&6I>j)D#$99X-j24b^hl}lyz@cj4>dXF6
z2_r|Z`5LL8&;0HT-Po2Tnz*{bJR(N0BD#?+hl@6Q+|XS0KmM~yLcP}#_UeR2-&j<k
zjSa`p{uHJn{5UG&P*vK_yowNHGpWN!EhpZ29X{^{|C^iuu?t$HmhA^%m+AX|J`hY1
zD1<M^4>RKAWk{q-Fld^L5>5>7p-DM0#jX#M@U!K!+(8w$vfO_n*&v<l6Koa{9sO4E
zI}K_O>rKa-An9R5X(b>L%5D{wxa1V+(9>261pbnt6`*@_m)XZXvm_>F0AL^%M{qbF
zKp~~L9TW7My<Ju)^FHjnPhO7fiGWXVNdQS#?9iddk4=I=Gn}fIe10<7#m;DTQ(DFM
zs;VFZy9E^MhXN;bK2D%03o!KNB(<3g7VkJqZ!uvk>&nE)%?Tv(e;`T5N~|DM0sbR!
zV)^1a=^7Q0c!sf9b7hrt(_MHq{J4Mn24RZvBGRd>(*GW|FnSSNf$!n+)>k?~8LA?z
zaS%*`av$zzu+`C^H%=H~!9Yda5;l9{z_?&$<ET0rU@GJ|-oDp98=fU&zqH;AZcOQ!
z9dr#<v{`kJR?|;KnF^jIsG;&CqE?z*jm#AAufvJ(Sr3isYf&4O!~)}jLOc<lG+wbX
zUca1};e~Q4Q~B`3yVtq+VGF~JM7kfnAij-P4!pVqTW|jUqs@rA!eK<pspU>NgL*#N
zPO#@S)CX2QW=Cyr81T<EI?;P;j5i!CgiZkWWfQWR$6KV>UvJy3z<+xzKocb{3X&qs
zDRYC-<IK8k&QwoIOwDOb1t;3Xm=M|cLn<?*qUOU|v_aUHVYNgv+$_yzYe=rFCBH!X
ztPJS%Y7F=$85^OGPRG5Mnx`#iS(NKU^iI6%Q-qfncY!&4zz#Hoiv)~-Z4s{kbX1yN
zz`Pbj8lY4WcnjeQdwAgWE?MA!)ZzC#E%Rq<H}IBn0X<QR`;E|VS3xJn^^zPzd;T*n
z-;mq!!c*Nn*_J(b3w{axBBXJ{=5;LIy`F>hr!01p+Pf!EJ`B-E6q(R31TrJ#%g$~1
zzl_Ob%vO^ma}HEUUHycp0*YRjbXM_O&;5y}@7Q3hYU!IZ6&vC5FW0S6axY@ULf6@k
z5)uqnQi_G)5$)MBTlpAt!y~FhsH9^5BsfK*h9P*~G2_u_3Dh4ooQ9t;=FvncN*T82
zxX8U@{t^cwEV22(R4v28q@h4EU<HQ~%HW@c=9DJ+;DxU<s}!myLLY<#ZPl#cx=jsj
z9G_OAJ?P1)?hZWM9I;_TLq7Q0^{LR!LsomWvD(mZ6oJUlCQZ1;a`nimOJ*#CBqbfy
zW2%;3KISXnB$t(tqa6SGa>7U{8zRRbJ+i$07;9U>Qh%pcqNS8%bnd5max;%WOdU1X
zh$_WQ58T><7_Uwc@+&C9GXhr<Bxh>mp5~OJJiE>1BhIam2Mg4)QRETW7w?)>=Ajkw
z=3=spe0sJ>Lbt}e>=r&F+29CT4yaxJG$*HW{{^KPiyT%(;zr5^l{k&e8C~1yBpZL^
zEMDw>L$}qrsw-57{i?cqP?(BuJ@ti5IzNFn#ISOuyjNK33RpJ|GRlcbWN_?_w<iuI
zFUnw3nD6i-f`(T;hP_x6ny721_aW%-wXXX$*LlOMvgiiv?E<jFi*eX=-fS}E;R3T1
zuY&Z(U)uGOmw2ab*lKj4p>zu*hq#l0l+caO;IdA<T?tNF7uk=jjtTsdw-(QIIxdz6
zo(v{;OQ8*B9%nECGxY)1pLLVXWxTNj!BxDU!^6jhYF1AQWh@85yRziQo)#zL%JvYj
z<`|9(dNFln!-ctRh`_%ZmepUZvvRq#23kkbC(=;MO$cN=_aT`GFHrm>a7??acRXL_
z#lC)UWwfDIu`Z?Rz$+9AUPnkXQpatrnBTpR|ISMt#kq>-A1&TZTt!?{qLkjcEV@3j
za2icsglKFemn=xHQb1!k*Y$eVuMc`Ru26Y9@PS79nSS$+7A}qUtbXl-wj+d=Z=t(%
zsU8K>8Ok+_W@c@wYU8dz*EhOs<7%2`eq)|G$72-SV4BsyoVRsta&WfxR*4V=iTqdy
zsIE8Qa~zq%kWE1erA!v+kUNM?Mtq;QpuU0(TXRk-s$E=*VSPA8fO~u}0l>HZD7|=<
zw<aYV^&Qtg&?y5&9Q}K*e7_Y((OOEs)QG9V{j&am+j2}`zL<bGU6&yYO3;423Nj;U
z%&~=tS>ZPHj=I6Pm}L=ne_4Vab(2=>WQC2^DXmE7C%<ipMG}lA9(IGWW+AgSSV4~(
zV}mcQ>a!vxu7*)*e9CCH&8z=&;T3^T;9b~vO(g910DK?Lim<Ga$ZI^V!3whS+6yWQ
zj?=0W_tV6ARWhPZiSettiYqxq9#+^(S^SST8Gt2@HU*PmF*0sam-eq+L7l)i83AB>
z(@sxiBDK;3v9+4xb|aYDgo6HqFamNF6Rd8>I*rL>3-OG8Ef1KxGWJMFGY$b8lFAv*
z7$wTE=D?L#q&j{$o2$SEIe}_d4a4LZoCyiV;FRPdtlwl*ZM=5J#O519g5Z-JkGFqD
zQN)S5)k@M2PaP|Ghh@$J`bEG&S^fMe_;a9Z05Ex4KV&3^W%DL=2#6aXq@P30w1)Wx
zwmqO|C|^v%mS{Y{Vau-G5VD?YTz7t*Jb@9HD@{1txX*udX5`i%^NZ{z1pdjkjqIEl
zLt-+Qw}>Ild{sM||2llml*GDG5c3L=QHx^WtnUe~(Ztj~q>*k(n%=(8XYT%rnCcxH
zWqZ0Q&1ik4eG{otUK2aJUTe6_%$YEoIPp~Jt`#YF$~SGm)W%ZOmyq&)JAfic0B}{g
z8K&rMVG_hN6dTKVP0b4#nz3N4aYod8koxZR7~S3mrAlY?Qcnuy1ZI{HIU*N%TgJlp
zMHzzM6NJu{xKFQr@C)L^c}S}*3)@B}5z1q7Lu4Ro6^oHgtcpKUGZ|GKkcAZ=bJ`+e
z4LbsM(j{cz7A#`8Wo?}32XcC?aZOF5vP||cg0_~pu~{0n58Xz!Wqyhxg=uI>N^wlb
zCPh_Mm=;~{-okmwn?vRTa~fYg?xAbx8iyD4na250l~i}8F0hy~>4{RqNi?K;_#^*{
z(2%Z&^8u*`M)kmnOCDe;XyP37;6qDVAI9V}@Oxq{9mN{ZCAD7=a6Uu~Z6==hD3=no
zfcg{ZpFP9oIr;i(2ObrQreT0H7n+haezXZeBOJ=uv_X5<nLFt?2!?)%d?D4Ljr-Xb
zh8Fl3rxh(=Sh|y>3m$&C(S%{K9?<LiDx)B#t4h1^xgl$8<wl=V>Xj*<<`ck>YAzAq
zZkB9_lw+^^cQrJAzeyZE-F7E>#A;_QGXN=VoN?x6&qAlqa+Ok}vU)1hi`TvkgHkpl
zY+t0m&-H1^6{<YHO?&AQpT2v-v{LbO&ahuLLLlgRSREju<i--#;x!97QF0A!>|+ej
z4(~8d3y-EokF+>b4mu5V^&YSbSeNZww?Y?+{UK41-AO_>#j?Y`B3j$bsksI@EaeF?
z#zVna+~RtDre>_y-O-pG?2e=dv9RKL{P#F59k2>HV7LMcjN;m5S>3bh;uU?UYPQ<2
z0yTJ*ZR_y8-I>of$nmvuP+Mt?E+s8F9QIsPd;e{w8!P)#%G>4oUP9PTD-7kcp98*A
zYmMs&?tI<V+_c3eCuPy}TK!6XL!9iJ)Z~*Zt8Db{dV9Y;ecxq#J273i%D>6$aqn|&
z(vRoY|AdEyWA%@!aDc&xs$Rd-ZrNd}Xemj3B*r>(Zm3xti?}_vTAi_br(8Fh@LaCp
z?6(KgR$C;8vsFV6T=o~w)#MyH`pqxb?(tt0<ICPe*b@QI5sV8|c$a-f0xBUZ9o7<L
zwg}id#&($jPK&aCdC=9BWg$CgTX56pL=^SI*nSyvA~H!wgZ!leT#`P-q-5$(^C%fV
znsmRZ;AQ~3QA$~y!rS>Q_bM|1u+}lmQLVV@PLkQdnxvt0w1e<l?B`nn$&h2JpzMPi
zSFCO>gm#P?K1XiKa!s>%G-jnto~bjs*Q_IdHFLx|mQ%ut_j>;xbQy6bKW}$;uketa
zNoFmaVRzP_6Ge=39B~QP*OgU{4$3;Jrzw|6k1u9o=a=qh{HmKx7*v6kJ?n<w9d&DF
zvV{G%B3fDfOsJb1r2VahXZ#-Kdj^1-;)8~AWRrM^eAM+Q3JhO7%-km|C43Mpz3@<a
zN?9IQWo!iJ6x`j6a7PW$Lyg|YC+JnV->0k^d);YfGE2L&Z&Wfbwy^Oh`u3+77_CXT
zp1>{T8Ta^d!~AyZLaX`&0moyumlDT>AIknWPbsgF0X+CsT-|olObRj|C)_bwXo{c4
zg%Dr@cdMaN+-5LB4kCtWU}q<XNH@07P2r|f7>G0`gvW|duOzpRwTIYB_F=uOi3%MJ
zP04zIQCWFC@u#F~Jh)oHy(oy^)~r_og}PEZI`!Jhj_0%CL~JDA$d2Zah)Q>qUH}=T
zWPVX9mpDURHVOK=@OX4351-8ro`8Jo&j<1C<V9h0+3XPZ#p&$ccxat8ou|xP*pkbL
zx*uc(t)}FKB>>7GD(dgvDV<<GzZ&EiTs|#nNH5Dhi7Razy&^)J6}C0T&!Udpi4SK+
ze92eyB=BaLSRkwhI-0{NV>{a&s|+2!$(zaxH9kxh_*3Azi6g^kf)T^+sHCn*NTd$;
z?O@qIbWAw9Wb4GC!D%Pybb0HNxHW;6Y_WnDqir)r*cK&M!8Vjmnp-3;nOX>Ie{B4s
zj}|xiLt@&f{#2L4dkF$+@=N%H53Yb;AY4)TfuOxO$m?AAn9V^*2UPBie`T%*48iB3
z5gd&5>rd_}E|I=NU*K+c>>E}YVHkO;YjaUJ5yd<6K0_UO&rc**x17NUuO8-rne!4w
z8J5@39EehN3M^f7fbzgXWU9DaH?P&`Rp*MoZ@4uCE9&1|;j`40<@J@*$!(z>G~b;m
zJ9oB>l160IM3TEXMPbpp5gEzs4JGA_1!~V5pbdGhT&EUHhyVormEa;~x4u?6cN`3#
z(=%M^kmZz=#t!Q3OMWx6MG?Ci&VJqZUVT8e*9LJs(~T{)31E}7E6)uF14hrP{t^K|
zBa4${h@~d3JZLc=`$>2+&y#AJTkvZ7-o8*R{lm;8<!;1{_>1dO{h~9396Y`=+k8i+
z)C22ry75^`-zRO<$o=puMN&LyXf*}4V~Eo*zQ^Iru1R+`Ei;TgieWva(9X|fe0JY~
zR<B_Hah&V4pT*(3q+S$`_*4R4Ka;~Wv+T;?TR+a>oi{2z;kh}O4jB(Gj~0eK4Sts)
z^eBy{fmip>8<LrQo0Eu+SQs-yIy;A0{z>WvqoQZ`{wj^JWpEXKG%bBSC#xo~+hK@N
zfY>Wp-{FJ{_%PZw`4X>}HbO7?2iej7c!U>Aq(N8V*pwJn=|h-8%&UrA8di)@dSHlw
zf|EVu9UEf;b!f^(DJm2BNrLcvVZPpR1|34R4!wxgiXV<AikOOi`pt>j-4f!?e<+;Z
z^!iqvepF*i<wG9a>i-=^hxr=OaB0n%HDkcy?#YthW~3f>tm$@6*Nr>cbElFL6?Ux;
z6`P-#S270gA64b`ExUahtkA|O`R`<XKu`H<U$2vMGj$`E`*Oa#aUCFQ@0uXlXKrTY
zps$ID%58`JITj=kwViwO<pS?P#+3soJcWg#*h$EE_!&+kv{zPi#KsNR?i6mew<)GS
z@ULm%%6&8F<<<3eN?WnQqk?qWak8U&XSjfurmmR<uKnrFhc)<A5<f?Y4!;1F{OIq1
z2P}5c#V#h(pZ-riFN5pNh-UB5Nz2{jlWCCKyg$%2o`S=StG{t;I1Ngd26vAX9O-&W
zatMvx9_qjzF<*q2<Z~EYf`PmHZk8^{%Vyj!TswKDB$}X3OIpUbxB%si(~k7IPREh#
zf5&{G--Au`h*S*;x(<LWcQeJch!KG&d5EAG_$&u^k$Y`Ha}444M)i1<x-DjVz9zP|
zD5L`Zkz;*H?*JH-i^BnV0w-*X;;`u`-o>Ve97?+8vnJIwEdL<DKYNW)H86bXV0hdP
z<wC9s6O*7YQB`G!JBe@#%*B5qHbuL_&#qMWFv72NU@h=YQ8)HKT2?Rw%?~KEebILv
z<1Ohp*cCa0nGv1AxG{{19-uJ+vyPOt*s-{;oE=VfLiLWuLV=wAch|@;kO5ee5a4>T
z?pddA)dO{{TE9RZa}<cf4ly_`q2hXhx<<Ew3RzD3Arubr=!;MFPG$94bQM#JT{95N
zQDaG$9gBdnUv{Ia|A_CXd098LEkekbiI5`i*c<7%44cDA9-Zzio<l^Ew++tABuHPL
z_2^%33Cm__xIpGHA=v=>_=ep8%%GT+gqHFm)^Gw@%Ww%d-}w4Te>HDh<s@$@e$y5N
z%#07<7}N0&BA%>>Wz|mKH~LCUA{z@_p3U&}e0w|4<ZKjYlOWwpOP}5=hQAW#Gue8s
zVF1=bNzBV{s9R@S!erIxEIq?%9hmxRSByC&+KVY?&o46h8oJybGWXGeeN@C?cI#5c
zF5xM}@*N8!xElyo++R5Q65$lC{H~QeH&fihZsMY)LmkhJFAHDunWCu1kZ;D70o(!O
zs+WLd_Hgc+Cz>9XdHE@8&zsB}ZQ(epS$-Z#(2adxxt`uE{=-whu1;K<_{~~XzV4aP
zYh9{xJ)_L;-Gv#$YvGxm^E0MEO|pz?8H+T?GHPebw6+`tGT}KwEIoTkv{U6Xk@H^+
zW_nL|5(<+l*dSj@34I_YKE|IcG#@D;0Ds9w6=n#t+h9ogCrVfwE*^qG>1QuUHuXJO
z2}Mel&cQOtt<nSmBoYP5kHs>SUkl-aL$s1-{I8ZO=yAg{@Z7a!=Mg9$hh=AP@sRz(
zWjc0He&-7izmk6eI0e986i#*8A3xE_H|}p{(hAB}xXbug<e&7eajtXlaGeV}6g&rt
zYjEr{nXnm{`a5f|mYa;Fy*A^-b;Sj;g-lh<>>vv;y9Wk8K1Wg`YDRFKB}<#4sR{QH
zOIvq{#L!aFzn!-DvZGmC%UP29j9mJY1$Q6k8V92iLOD-$+e3*D5NZ4Y0KdH?=F1Vm
z(Om<p0k2SZHgD)w35Q;17!$-shmDaA!I+>xbvWT)jls_%{BWPZ*QtgLSe2@=Y|iL(
zF}yZcIYf3mh6mx=?i9~a{pY%M0G;Mraq?*#b~v<NzR}IUhCK(Yb2}~Dpnwx2m-M*q
zNrk-S3mshRZ8@@3<$0=<W!$jfx8JA#xb*zD$o5o+6iBYS1hi2VO~;eY6tYHzuzbe=
z3=*n{HL<rZ!f|lh!_-fw_|7(mCkBjBwts_~(E0b(p|-`=F3BGWzVGnc$V1FIv;0Ls
z|NK|WrNB6J06~*SOM`VgT<GigT$)h)k!3be5?T_<{Hp!aLN?Q_9#H(YeoDR8kfNbj
zcU98yaJbuNXDF!FQeeEM&T3^0tzOliXsB*tXN?GSQzOXWlDc#S0Rk*}UBbU>O$c^p
z8<jGV6`52Oe0bi*;TnL@(JI?$5Iz(fqWd8ps<TTohYkK~m;{qOh(DYDgkZvOofBEB
zW2Sg1E^2tpl2MX8#YOVFRgjoUYP+v(`c(1tE`A=+V%?@3+4(^hp5hJaPl-vjCThGX
z;-<KYY$CUS%IheF=u8?8^E<`Kf-8khKe>WD*2AW#bSUuaHAkpzL)$7p;id7B^sk7i
zOXN6O?u2rIj*<wtFjp!WZauq(1*%BH0auqHeniK{vt%qevGW3|IR26=Xm@w<p?!BQ
zeQ^H)RPZ`a7X%P}PZA?_WLr3sk7a;>#^)$zpeiV-(L<zwi_dp3MpEU0qRT@l)*RR_
zbZ1IAvhL#cqaX!{oPS>)go%%e#_OA!r=_H%m0+&0f&<$;0#~A>sr9Ip=H1}y&rTH$
zy41NEcS>PXwAz-ci=kSCqGXp-m7P;8R17w!7^#*qjcDmUZeaDUt$xcH@X}E{X2wjS
zp|w&Z=&Ji{mNkK+X|dVcJw!^|4L-W`V)CJvVp~U4kGclJ)jQqZ7l2{jB@vdGk)9!8
za`ZAQCi9Cg+-ZEZkvfTUcqsG;ozB~}=D%F!k4EJW`A_y&1v<M$e{G%#`*bu$J9m8M
z?iF;AMLN7Gena$`)KzQXV*+giJr|3XtqY$y>G(uO1|}gj7_82Wo`Fca%UK!V_@}+f
zGP1nWZ73zzi|Bp4;UbRGP}fuc1XeJx*?)mL-A$;zKF!W|&b~j{cKVylJo&h7oa=u_
zsaV0iw%VfQ4OKHy8>7!0L6(zp5XpR#bs{)BCqPKQO$*QBzHK0NcYW6tE|AQH;@e5M
zH3Ajt1p-073D<s{RsSp6@38M{Oa)WiKlb3R|8*$&6VFGK<pL+>DYjlVe9W(Dnr0KK
zL2B?DU1RlN(5;nx%PCJaLrOpAT~;7~+8x>tkfQ)NjIi$_bBID!NrZ#K2f%3(G2nBU
zM#s49+R4bOh$yk(-ADpUjF5=7VHrq7oN=z|CcEXcF&zznV>5rn#A`<S!;6+D05UUl
zvEd&_V9QkJ+&X#vU>+zsZz#4gfNsHspR}0QGwbmnjcLT<!!Wxsz)k3UX^!^?7@iA=
zdzt1pQ$F)9J(JHnR}n(OhP^Ah(|N7W#}?eCDSd6M50n`O`0uz_;R4*Z2kiQxk;9%J
ze{K9W{EhBEO&61t`S5W$xtYMu0J!sIdL;@O3}HqiUV1IE!{(owp+{mO`C`PasE34M
zf-b6hYN^NV96(LYDz6$1%?2aQHT5R6qIPgj%Y<|>?K=fe3kE11$qeK0@=?GK%|-sD
z3Bw)blyLA-m=RjO=hb+ez3lB0Gp<lFlfmzO!J>XhdKILhGcDOsO}$6NqAXu9pstU@
z49-j8l7|)0>Ht*HnIN=rSydVIPOVfeAIiWVqx^!xPLgSZuGN2vlYfebgEe3}qU)8D
zix-?{G;r+K72x&0zw@|$oV%?6mMz-?+s!@z1x4vJl_gyd<W9(g2lrtH%P{yY%#}O^
zr0E2ck|2}+S_w_nser6%q$L=PMkKN*<Ov$%BCBA6!@h2*fhhlIo&jSRSvJsHVyU^t
z_frqukW`st@>jV-Je>YXe_8%X{&})M@KOxcU9dRW`Ii;d60CZZ@0d4wi0*hf*ai?<
zrp|$0Ch-79Yiio$q!eW1Aa!&iJuNy=HcV`n)L8_^+Jz?^jZn-p*1KQ}n;IYnQ9iIT
zJ;rR<NzGNxeYWvVbohl#gB&r`FA6IubU(H4t%$RVCR~?39ZS`hElpvnK54Esx~fMJ
zhy1cYgMxf1H8BXchHfOvN<UigBe@PrzAN(l1uoNIt|}>z!3eeVI<u6jl`2-x)?DKj
zjq<m4$zVEjo0~F0QpJWyn07XYnEACNuji81D$Y_|V&<HII$f*_q4QTh5p|bu;WfX-
z*J-o4oDTY~=z2I<Gp=}D!BM|nJ+c{K!Mm>i_p*RR<Du9kXm|#PmQ4VD9dKGqfe<4w
zwwwoH^{hwCWD^5H0Y6MuwV(_qln^*kP?9XZCE%|Q@C<6Tj^*d_o#xptjFb@1cTaka
zK6Fd;ZMyCq_t~x-hr<kE=)ror7;;UZpGf-^;#E879@9WeC8m6B1sF;pQ*vy#C^w){
zK(R!Fc`+^g#e5w84isNDEkT=vCD~w@t?Ms5p7drV_Hg>HpNCbklMNPTVq`I=Cu`}M
z<-3NHPNcXcZG~b=FQvxb?-qJ=yRwN=mE6LK6CM@Fh_R}-MtSQP*wo4xw^pTM)eXv?
zg?{gLn=H5u_ZD}}@am#F{hR2-mJ>Zu&k<9Rf=+p9P$}4mz@@f@hI8FKkroF0LVyHJ
za%$9mb5)!sx=NdX8UX|<22k1fFim-3;P#=$dY{9gZ_;m|KmWLAgRt?>WJ{ze3#iTv
zv1H#&&ZoWEoIwgGvC~%SRW4JaOo7*Y!<>;M#iB5$d68&qV(EOnWz}x=bbIfFvRFwu
z+-{cnxRgNS<O}DHiAEp)Ts<$YTN^Gu=hcr^8fltPnbhs;TX|^G#-83`t$D|8gJIF>
za&$Sj3^gA_`sFuz?cia=?d!ZDm>s{=UZdG2wOk0sa9qCvpIrm`jBNTP1_^lV*Ji{2
z3N~-g<K|-q=Mw%FQD)C?G|*)?*oM1ii^f<grHn!>YUu@V!hpmH$sk}BkgPCz$k3q4
zzBQxU`Y8l?#hUL>P8hnp3}#^|i;QDk;y;7jj35L)7!e{WK>xzs{R8l3wPJiMFd|aM
zIUqO8bS=$$G#9<IP&a|Ss`DM4_>E%}E;??A|M%^77ok|y^Xv4fpHMH{F^d62?!FWS
zQlW)o3>A_wYS04Hnt`pyRs0)rBXUFCYSJcW)U3d^dwAjMx8KUa?gS2}D~OqU$mr?F
zv+$|$@g=VoK&f1KUW0D;_5sO+!yDg4_SGq{D||MQemJz*O@P8IF2azaX|QHCp?$CA
zR40X9_kajL2{ujmX=DSXxpD2<o_^98=h73kz&mj2XCO0r&sCHWa<@}~buP8xObo7!
z=&f4>%}JT=mPAmNI^q;E!wKbiYfu$U$i+$5UUQ1j)uK#T)(K3_*rjab)VyEZ@Lvf0
zP`Izo;)P-eTzJ!{TM6Enimfx00cdAsvqfU&N|VeUJiXctkIbn6P~Gu2mnYkFG~p!*
z1+RiAX=QaBJs6)J=N>7{u!MYMRBV{BTAjrqK>NXh^mZIMf16@Fn#kfPNS4Lvd8{G7
z@`0ZjjE~W<>F8y^F;^I8tQvjiEbC=O^nqP;>A%|WG%r7(Yp~9?;22H<Vd&ktDm2U5
zPcdqTYOl)<^(-_i<@;VRGQ^~@1IjE$q@U?4$+NH)uuIG29v6YxBJLF>e8vG8P72z@
zVPIOdIt67kou8vCV-FRdwd^qAwWXQEQC^}I#vywM!^y$-Sp!rn_Tvd9O?e9GX(__z
zZ1KxJ$aupyc%ZO+^03fcb}$rCSUh-1Z*}KSQ@47#obztShmYI;zM?<7PN+z^zccf@
zO^{8uyJgdqEH&i#Hb{@QgV+Y1_CH0}3R{f`eHs%&zjKeaKh+DiAiH?E{_t?=d%zb6
zIBZq->lYmLKL6$_YOc$Cqv`P#l%(?31#uLZB3GsQV}E*<Qof3`6+bpwzWnj%+Yrip
z%DnP)1XD^ub9kLz8|Zi74weFS_WaBx9VLaMC>&c8m>aW|N9uhQw=)<l-aAMUgHCg9
zOn|YIT8Ts0$+zuY_pMfDl6QsAx5FQHE6^ABy9AhK2ztBBcc0|c#}k|GOLr@6V4t{N
zWDE#=x#{IOZlz$KGM@u7ig$-|E7ISF6EqyE)HlUa;bBRxNYR5Q5=@!Tao(HDc)ddm
z+g44zsf%C`fm;w7Ebh{E6*EB@cRr;ap4G%X(cQ_2%cculL~pzRu8{T8%|3)m8txHc
z|H<bOPA~PeJuigeOf7#Bt!Lw>OsIa_9UT3!h5UC}O?<rDwbwmf3ndh|JqVK2JP&^B
zpmoS=8D0Ys*E;AiYJ!EtO5+#}f_YFQga|~dU_zaoN7u(OJ9Kf5s51N!8&F$s*|8!D
z{s)jYw#t-veHxe9O6FU88Y!#JJ@{dUMACfd0aRHwLou=jcJ4`3-R=V>>=;Xtl>{rX
zy$Xc(dL%mmwQfHdwpe4vlt{Ny0o5lfY>Mx8C3Wkkn*0u9OhSxp=_GvVN~gB^-2Fi<
zr)V2Hqg<c?zP$CXd^0_FZfSxH)}JNrN*t}gmRJ3*zo{x9I)^m~f11)(J)Iq*cwK#5
zT-tr51%_|!V4`m}DPT3D5knlt-$sH)E%<975i~C(gtq>rHD3b#RyS5U%=1pSt3jbH
zzt3ls);05l`FM>k@g*D%*Q7v+&vc*ANu7f4q&XNpBeUi?;U7`>F48tVWGwXED<x$n
z1!jyiDZU|N&+@<cwA*}wf98?mV1g4Hq1kJE!5r$&VZUz7DeHTUOLOb(>GmEG-D1;W
z)F=n@&hD1gX_ba~^tVl2_DvD9+v#hMd7{xXW7m?x+?yP&>-oHE%hus=?-@$6w8@vL
z3&yrUz6Tny$kTa<F~xE}MBKrbR*3Zj8ZHnhssFvzCf1Gl2V;t==<BWeMVLig$w8K8
zn9-><Ss7lEO0os-ZD8dH@0Qq0^QyU(4IFNSGP|xwBw;84chFiHn!>|Q+KdtNp(`st
z5B`)}5~m}93IQSs7R5tSQIUEMIk0zQ2iLuRW4r^1#F*oc<f-PcgP9~Rz<Y|xY`%(M
ze{gXJt&FWg{IfLa#g6)(H(~U7tL`~-@EKRiX9rpMTN}z}@vU{yoXwQRxfPo}L-vzV
zIUh<{@<<jJ_waj$;nzUF`6kJBT6?2mL)|YCiyEIuxXw9r$f*esp&g%S*p=r#7nw2~
zHD{w+*)t-TgWZTQ|9{VodnL@R1!s~^q!tt*;OD&P6!CGKUBGaSbz&Qvuzb26SAl{j
z_wgKINt9e4QOnLAc9#~;6M;`NWb1)Drra3cJ{bF`1xYl|4gR4KC<*R59EEHSV%$FH
zp5lUB=ZUsN6CYt!GOE*;5VIXl6}TN89${ba42O}W0=8qyx}L4FZf6<Ot>tQDWwt&N
z{OWl05ux<={HClsAK3J;2Wp`eB+^H05bYtI{O(c=giLQ<j~;ak;FV;3xgs+z3Jt6l
zWPW61K3sFYzyI{@WXu@IYuE~`E0pRl;vR4)%AjUWJ4dMf%;A4$$hb}bOg^OUkeAiH
zU%VSJe0xhx#7I~x4+gymoyj!4_EySXdY$`4|1oayM}JQ7?uKy|v#WB8g@v8s`_*rA
z3iq5c79Zpvxyi7nBs-KAZA6foB%5i3%gB)Cp3|o7Fy}>0UpVW&;0BaVJBIVgR|tAV
zgGLJU5TfxRio!qcK8EhtigQ;<_u5nG&Iba@YR)O9$CjRbvU#^Wv9F0XwS_kGKlj0^
z!E)<$Q$7_?+r?8^kF;-tc_@djN}s&mX}s7QruSn1m^0ehK$Y|Z`Y7>PInU7iWVq*Q
z($98tSELrY^d^B5#w{3-+OPB}xy><kc0ng&)Y-skT`=f_$y;<>^j47)i05C_$MMl^
zp6|%$P{&fh&C;T5uquR*1Tm<ImeVLBZ(+y~!!^?5{7h)I0E7b|$!vSkCiU<L%mkR_
z-Xa1(BTn!l7X%IE6pU%&NiBQIqlFHW5B3$Vch~AS5Yn{;6jPckGw^n&XxVonG(>ZP
z65j<DzeSQPfUm!Q{c8igqYxf+C<0aUPH-1J{hM}@^Q^Ek5AgwSNADCogGYOt1<C}}
zAC+SS$6G8N@au4ZOss?(qI6scW-X~tL*ViSAr4Vx1hwIpdN?c~1v~L2mFJ`M-vMoi
z^r~re6yE5muO+1H)*7%0z8W1ow}u=tR)s7SQ-AQO24kaT?_x9#e_7mCjX2YIM@9*@
zuwc3%rC!BH=HwqK4Ys8g1X*^7=yf0H4BfN#vzCnq7K_k_7SZn~ZP>3kkx=;9un%WB
z{|>qQum17A5*5DuZ`%*LySFr=_W)H1<@j;*SY5XEL`mkvwSdIr#zaRs`?$58xGwEj
zV*OZZNx3i8jKVr;?_&E;ls_d>uoQ_zI%Bb@(x>xI3LTrj!tVbcW#1GdO0cy%wr$(C
zZQHhO?%8A8++*9eZQC~QoOAEX&HwZ#E0tB9^jjxYy*_oH(8qB*=hAZ@(528F6Jhtp
zg6<tmcHS@QqCe|a*bVgTcz3kCJfqwOcA^l#0OVOa-Kz-UISoKl1@`A}uWP<i>?jg?
z*XMo670tLt=@MSo0V*+2uyy4@PDa$_`x%1EQB8)rM8dC{7RXUXX9d>gGiQO9ZCG6v
z9>nrb3J36erkEWcviP2`_z~MBijRP56~^k4md$GLLZQ4TdwXF&SI?U3B8=CWEWqAQ
ztDT5}oTjxTr5D;p8G(_)=vlXtzuLfMSk6}HPEkw%PYcn(czvsx#e};^msWf)-`e-M
z*L(!7U1S>VZTU<0(B>RXOObXKKjzeoDr+bEo6GW^DrtJ_4)Y1ja0-fGVAw=AlR*%;
ztRJR;zR(~JxnyG#$(IauVZd$Fh6=WmRG8@y?4SpB0tVa{*66${D5l;V5U$0K<Nz+%
z?TpO2%7Jq=xhnV1dqco_qe!X`8Hkq5V91!Q;%(Ywh~vmz%%8z#IcG(xv_QT8ogjLX
zZ3c%4rIrfQa5-PyofSz1I#e);avow^qoprOf5Y_q6ZXP$DaYN0o0yZA<Oa(zRJ>l0
zR$V<WQ^uUm?;G3NOjiF_hWI93N|HXKbWis=)Lqqelf;;7YZX!drZ|yhy-XvXP$yo`
zC8*sA3L-_ogIrXpeWtj0FFjmTmXo%!EHNC%DhA<P*7z$-K0W|rhkURZvazMrctyH+
zXuhMM3^F@gi>#VLF7fC)g=sUFqT|=x6ZnwkZhO<F79KpiQ2@PnNBZXnn#ldgjf)_M
zRe+~`Fn*$NLIWz^Dwxu-QKx-0M$bxuxy9Sr@8}6?-<Mp8mSz?$VILU;-vkCz!_G->
zj20E-<3S{SCMbvA!GJYkkK+=y7o6ZG_*zKlQffy=bc5_j<b^wR=no~y)~^rnxtsA$
za<hZ=^*62s=TbfBq$h{N0_R9EgVSEC1pg5Jb$uhIBZ9GtQNuw;Hi<}(!nkG7TYRel
z404s`{*=6pFT*nI_cy|Lxj5Io6NiN-ADCYAk~;k}{PUm@cA7MHF)fK1tAz?9s>m}{
zWSz%9zltg1OzRUzqozz;71TX!%qy8H7-_2ZO0C3hn5TU@VV1vSUwH!2ADsrP0|4Q+
zDC5xmPY%FPd6oAB0u5%7olXXV%B4NA=TNxLU~D|EJR$c~T?Rg!$@3nUMWJlc#bwJj
zOJ7{)#`9$t)w&e4|D2LRIf48ezK6+tj0sO7&upfOJz3OP<pf41qir|M*<CE^IB-lG
z#@<72EZanKb-lz3-D?dgfhVtq@gu6Kg+a77D+JiW%x@w^dH6wp$qjfhN1U+udE0);
zGB84w>Pp?Q+SKBg5tB#znKm&DHcrat?<L!~=^<ika}GSm9qli#ZY7#^dw0<z!#9>6
zypl=&9Yf+x7c=Wm(d(FN#7-MsbIZB4oZ}mIbWbJ{ThM)Ir6Tb~4#Xrg1tT_o-*)T0
zb>5VTGlT5P@b#foQ<(>eSUlg=ACzF6M*OJ0B+Z_Wmp@Uy$o?YN^kZf@Jv;h;&5=nr
z*$qIRC7L+882F+3OI3TH3-7ur!D2hz;Q1oGaJA~RYbrd!Eqok6y&}K~^t>m_1IeOg
zi;RxTt%7ULrY!P|UjQY|=jwu<AVCCzMS>-WMV=|tjKvjgv|8+EMySR&Lu+jnh#`2=
z$JTF#5F@rGJli^~-H^MbprvW5I>D$)0$rZP;vHs*n2(c>ubshkr)mkcDIyjw-LHU*
zuOc(2-ru&!g00LN{6t|Ix34)aMc1UpMwLaWQ#a8EZ+C4&6{;~JZInJ}MQgR?$dKKG
zrBr}bU|MeKL60ZpqYRu3n4OnfCw+6HrSMZeoa*^IeAZ#G7^Plzi`!?!7?du&Wz5YU
z23ncjhahZ+Ej&~sR}hT*6?y5`^fo>%?x7WV%C(v|*r>y^7-gUtaW}7CuAjT$cc<r<
zUGiv>hQ7z*S9N#NTue=5<|J*p+qxai#q5LgJ0`7Y-lnI8spqqIaahkN$DbS!U@}pd
zy=z1A^xkYVxNCvLjYBSbIB{NaEvU8(dAE5HssFJ)7T`FzG$>J6ry5`jZ<-alj<Q}u
z{=3&ZL<=?xTmR@B#pFbX?iT>p&o}X-4z|}z<e`leRX=>c6$BI5YaHr^N%+I+shvK9
zxO36-;3vFn-e>W91Okwqcs>zbP+R1IvXD$8v&cc!Wk`cVAaR{3b=Tg!ZJOrCj=%x2
z_n!PA_6hbIp@(3jZ#d96qI&?dhC}4P{3uLBM+x;o$Ebf$WXUZ3BzN|R%8n@9cbP3N
zYjyUhr^jL+cL10{7|j6V&gZ?XYlBr-?Zw}GoTEt9IUKl-j4pC$XmW7-dYFOU@9&D?
z(IAH1n>!2Gmy#ggz68Vy&@F(72J2|-!Y&B>HVE58<YvF*!J$106ER>sGej5!O!sRH
z+xu&@hXrpTPuqU)<-=Cciw1Drdl5!7OU|}!DT%&&f+8h}w*+P7zha-iw{;zd<0I@k
zTjb=qhrgkK=(3pXEbJu~Ah!Y@l&@`|3c^TA4v~c|@RS&7CUbh3(cuV4oM+r99}1hy
zsMby`Xm6iNO2<Nl5tehv$nzNJq!DsEHyH(&QwPg~8AtV1+ZFYYec?L-FvJFy_*GIG
zCaYKpkWGYo$?pyNQKQ=LYW_p(Dtuo1VBiIuSLip=XLrdp)r;<nA=f*7)H}t%<WgZ2
zaHpGwG7pyJ`8O*2ZU2<QJ$nR^c(aCkN;Ud}`}6b=(e=^-*>h6*LLlbY5YWOr>^OCW
zCDhYMebD?fP21*#Gc$4L9m%&kBiGb%I&jQ)1bUW%tf;`N01f0JdDF;`i96pP)tnF{
z=;2sREGQ^-qAHExpB$1X90de3ib(o2{N0=G8+!zag>SV;Zk@3hl#vqiU!5TOO;moj
ztZmPe`Uco6+!Qe4zCg!APsfyW>g#}3wM|EnJI}9^75nY+)@w}(pN+x6_w9{^F5##X
zFQuA^yx#*NTgO5|CZN2bGhj!SXz)n7zwMt+N?n1*I)Nzwbz^eFO;$8VPKtV&$$$m&
zr^Myuvb(#R|8~Vsy)%Jodzotd`fbKaA~(kClTLl43o@aSQLaLa!4qNQMNAWB9nyZ&
z5T9t%n1bPbySEP8AYLmrouw|P+H5i>idhjrv@U@R65yk1;}B8oyT7q{V@j-lLXjm_
zTwei7$xZ$<11*$Z_GdkJ$Ud<i2_^E+wGnswp6P?PBA^&ouR3`L#v<2%5uw#WWO5bw
z5`b70`xC0zIq>P%bt7oBf`p9JM`HK=#F(tct|45Gaqn0Kz<~*9sXHUEap!i$4es~7
z=zQ^BL5Ak#=gHO<J(t(Y^)>#K86Pt{7?)B@^XrNutf-4b&?+y?lJQqdkrxe9#QELE
zi}+K=2=~wS*Evh9t^7RCzwb7dTpVNBhjZlI?MxP2-_$!jnH2BL-Zn@jAwzz@3yd?X
zu0|eM(ilp<7^;hli5+Ca2>-+L5pQsBZgTG@b?zT`m#ECp--y?O!!Kbuy=i~s^$<KM
za{bTS6J-Vi#=l`l>QfyDN&_nhSVb<F^Jpg6Mafb}Y?UnkT19(Ho<vwEb)<|e_3Pst
zPo6Hi22P&zn~4=LCs0MD82hYIM_pcdgYtVs#+NK-YXwi8BP=5#G&HFxMp#BijBWn0
z7~<@Y?cW)vxD+Xm6Q0BOF(jOz9rO5)hR1S!)yhecW_nHT2=6e~Yet3l`%>e1cTE1x
z7RwytBo_|YjC}ZVwOl(U8oM((l=(IvS_zRoR5qq64bMxq`e}KwI@#T|X!(AahOG1^
zFB$phC@Cl?)x?eRK{e}Qye2Wp*oPmkWM?y*^ct?b8LtfY`frzhYu8sD53Ge3j~`?x
zo^k>|(d6&SmEFN;L*wbM7p-7s<277tKUGY+H_7oBC2WqDL7t$D)1t1UO9%I9ROKZO
zh6(-vu*n4HG|XjQ`S4uH91>yX<1#FcpA+kK(naLw5ah^bRSbHE@VNlMevr+)?FqhZ
zsXQBHKmB?f{4hnBQ?nCqsI&&Yn*?G$Ok_@T|4gG4KOMzB?QszNAV$&m{T`XS*-P)X
zx&5}gAJfT%x(s|ft<uV@$93?p<>X(XgypcddFNBUr}fUoj$>vF>CFr~;&_zwbn9VN
zTM<bXrhL}jVCZr9NmGa8;KTaY+n%TGFs%9J?eb>asM#>Ic_)K0$N8+Av=1(|=Yz=B
zI?eNEjQ_Pcep>AJNC!6lSFF1~-#fnju(-L;<FZfE?>qnL@=eFpOWY4aYUFNap!Kt-
zJ@%r|w=>X@)+Ybc@x6LZ<G!r)@b!MbudIE04MX2JkTGxQ&v@*u?1s?GT@OR+XKm)9
zcXOoQ^<&a^veJ{(|F;uCVtyO@{ybr@XztvdNO%P4_>&<{#9)qa!a6^&R^<^zBmApM
zCialhT2{d`0y&PR^Gcx4E$U~vk}JJWyLa6x(DCp+iE&RTJ^fOL24dD`FoPbhLWdFM
zY+yBRHsfjh^qG4=o)alHi&A+8<RI=#uN%g+?&P&rDPlf|X5J1ndETAo3+Qh@wg2AS
zs#aOKnWTWlfbVC3^<W<6G|qB2%wmI_!Z?iz^aI^fLe{i3z51R+4&b4A0SRD!<}}WI
zG0K$@X8z_p$i*BJ`I%N^u<H@fc~!?qg*2WWhzrx5gWvSqHAW%#*MZoqJE}C@{gqpW
zCmPbzI2@A08zU&@I&%<-H+J^g!hP-*7nM~&xEkU?84Xa<rW;XBw#b6I-zoEm^E~4C
zbY|MSfAS*Da2C&x<ikIO|J`u;n@?RzTD<{P$B$L*Q1c;IGnC&!fq-guTgoedjA0&z
zFXD*6K?{En&6!Q4K;)x&?h#GuQ`C>*3E@8rvexDLGr*Q#vyU&TU!9dF9*=IyL*g<g
zhkzH(9#Bk7r&9tN$v*TkT&o>K?4#IQ^<ah^8Y(f%jc?RR?Fcu@QpRKID1wc#5Mlx5
zhk@2a<8TCyPjS3Pe8=Um5qDp7;MxUP2_#=9p2J~y3I^=+z|eX-cJ{F4g^PRFP%(<O
zc=41$C&&=dzJfPA<xFoF=L3^*(vD$Q5t3FmZrUX-6C8TIu>d6I7u*fn4ntXY)>7LP
z$j{Rg2dU#mIB1|BpcQCfpwqGwDj-Tl9|eSPHzsSptK%HdL_-AY6c;%abW|4(z&IU(
z+#WU>41#Cl3}JRnn#Rp_o_C!-NlYYlka%r)bn9;yGde8dw>ZCk6AL-|F2Mu+JBWxq
zC=2C)OO+e37F_z;%S*Bx_qeBI9ISd8l%^x*armKP_#!x*J!@M`#Zb6HScSgBqV+M7
zpdf*4VUJ6~L5eC~7|>jC0`C>xL<6-1K7KR+F5qs{WLM~&?v{<s@Wq7793`up(xdO<
zcm3%Zt^?IO7yuFR3Ea0et4-fS(09iGjDP~OkmNgV8S)NlQb3q(e7`v8S{V`V_$B#x
zgOhtR=w{%qoZUSJ!?igHA^P3E`?jb?s9#0LQy0N7+OrOvl5gRR0eMgQ+tPJM`{bax
z=z$$y%~0+Mx#n|=rsgG6peYL#&tb6}&oYDY{%84mF`q3z$}QQMM)I^LTHyAUSE$i~
z&KwH}1u=9vK1ZuvLkNuzKArwiHo4Lb<sdHhNl8uwJYB-xWJosqML`LeUT9oDA3%|&
zI$FWO#s@#w!l(u#px__fw`t4*n%$}>b!ggo!J9dTj-OcPX4=3vdDoNs{4$vr2?q{l
zaeeCcD;8MxVHm8NPYOG=i_z$%%v=GeSRYep-&?b3FTT3dwf44r-cvnfN<4Jkb`i6B
zH{f4_zfty$7*6f!XmxdUlW#w_;HOiCdUykdc66Qo0^^TVoq|k3pRSXhU@0mOD8Yl%
zdeG{^v}aEO8-v}-efxSmzMK5~(fhONslDS1{e#=()#YC+4!yq7()Nq0Gv3<@b^>R-
z7oH6C^z=!iw>AfBKk{=NcPzZo$~)xTWMAUl^zel+A<-qGOjm<dqK?9X4DaD`owPRV
zw*&Hd@LE@uT&5vBZxydR8@xp2sVuT#D*L|N84D8qMK*9b{c=OGYY*6~7KLy^ka1rR
z7dCb%Gfdj<9<qcklYy5CgcUIH7F}uUQ?<%h(nR14fmP8cJEeL6f##!CNij}ODU=~y
zgDqLbLKnjZ_RfXxpc9p|6Q>>I7^j6#5kR>+1nImBMRCD87=2+_XA=q{bWqF}Q0x$$
zrp-=ualsT}h~?l!`PV*nLHVu@6h1{E5KyX+7*TrtP^tx!jF%rGVUTrAjUXu4o`_@;
z_(vvaft+!E2#bTFHM(F8n7|*jkV}BZqFk$&thXg*1J9sHFB%3g;yt{`NLI}WCGpn~
zAF44X59E3zA6)|Q4}c*i+y}1S>wui}U-OZ;lK|<NlW*cRtOsNiRdN^24g6;kTr69q
z2VgYI{ctG*cNK#-vhxTMv6BFOa0-mkmT1Ny$^Bu}&y#HZX9uro{}hn-kbN28V-ynH
zTv?Y|2*QfF0!EJ2oh@#jHD%<5n;nqtw_n|DhNmKJ>WX0F?}g39km-8@-g_JTuIR4s
z=MmWjiKPW3@xjunPfGQ3B#`sF;^GO*&Veq+CupT2_q}#kFP2gbdE`5q1M~HScQXX!
zTb6_429)2EAzXSO(EI8SX$vckqE}nMPjy&ow?CY+N6!k4t>F#O8v9=g4K}+$IdC+&
z(*B=a_fP4&-+b`g>9R?TMKysqY&U`Op>*P$N5P=JlH35E;S{eU@a^5iSM`xIxA<7z
zGo^lcd=sIuq2tqe4mpl6T6&X4R`-EGV7bu-7<1rnQK>(MpyO6ZZw65=sU>;Xy>`Ib
zSA@B(h`KFDupR9vk5vnRd*G*6^8?{yn`(RTnUtq4L4yr|<tHqafaDxD8g#lv*UBMS
z^C>&S;qb~7G+qhB2DSkJeeL}eFI|1IkRs3kyPUXnS&|=f%UK{5eme+NX|l0N)d7Wx
z9#79#RiHF9TtfX)LLI45sI(_ErfchGE%vlmjrkYbTT@sGkS3eMjZslHe=XJgN^N&P
za8c$qwp~?JtZ)@h0*f5sq7XQ`IYMP)fsM#M@l89(idnfyPeJa0=D$IIa0mQXvbVef
ze#{!5-{Mz0@Id4e*GxB{0f03Sv?Q7xS&mJoG?i36fSX>N<KSk1OQfm%%c>xz4QoK^
z3oT$fwy+t27SWo)E;e#%w)Z@MJB;;&Fq|_C&7{FXS(ha2cebxU`tWQLVQfw}K2h7h
zdXMNrtMDr&YvI80ETwdSRE&BR?0=b*wctE!Iidc|AiQ1MoL_Bz^)Fs09w(2dX{w5b
zT}Pl2$dAda@=0p}fRc!HPLN!Idm~o~d<(mfgNZ>+noe@8p}+~Pl0*V~w3|j!{iKmC
z_KL;b)uxh9-<^PKSqR~JSc0BOo>El#$x2Z}0TN(>^TXOIYhkihq-XL4(2meRKP8wp
z#@U#%Anpp1M9G7y30Y=%()^eC4Ka9T?7)(LnsDlskxHB#gYXyA2LwxaaAp$57a>2-
z`C!hu4<*{!@dM~BHOe+AvDleUqLibLRqF6Qx-pU%VHXspWeTD;8fbzo_Q&}jCe+RK
zEvF(hFkCZi-OWrk&{h~3X`w%<tj8@&iO?Thpom2U(`GZh`udFt5;mCG?OM}wb3#7b
zoqbyUU!9PTF)2OkfC335-OxJ`fK2xF(E0F^LG*eK;Ka_fZb0K6>(mk%C^}cy$6NCk
zqW-Lg<%Kc58N}k>3Pd!Mn_vL(_Q&Kq${(^g=o^-YNsWQY^jRt*<|WH0We;uzMt#vP
zkodEcdYN1$c;5QqX^PjCJ}M4LEB-$$g<XO4dKNR-B(8k>4FYB{YYHLI#JSCLI$Kl=
z!RU^rgW@}Y|K@FG%}6h(P|ZGf>{8o;1^olfw_sZQsp9GXVkwrtSW1Hp8you)dfKNx
z$-tN*uJHz>_F>5}BXAAbUN0uhz}1_7Mx?w&wm1edjYzW8zsoFB2SgYK=E{S;ypRzz
z0V3bLgcN8J$TtFU6I69df1O%*P8l64rvkW18q_rwE>*d#B^8lMTIGa;U%6eN<>W;Q
zb&M=*?0@8Tnkde>9oX-BcW^o8EYrEEq4t%U3?bP!A{d1r39rX5c0^;s8aeBKOMVA$
zv9Y%Kq#icZ;UKgB<#ETDmefgvkjd3cMpuB{=Izu<Fz`QpdSjauyMI0VRF+R}(csVL
zm(cB=t)WC)c(F4BED4{SzI`L1!4x*!s!CC5v{$RJ{)!iuh;fAs!4m8WV9w9*n8TCA
ze&tusV_$bD4`gaam8&tju6`|V`C5?#)e@$%YNR~-ZdzjFg>_l0Bh5uprv$9`^|Vvg
zku=qOpMQLM!_8QG335tNH95C>7R=Hr2~9;7{&F#+V;8mEG&vFvpLX-y%+TfXRf)l^
z@N(EMIud(SXZP(l({!X~EpSz{laKjig<$2RAfpbox~XhQZxg2D+qw}&h^t!Hpq#MI
zDl-lZnv@m_ocj*{Olk^?Ikl&00`jP*T%3O@XOMrx<M!PqjEU)X4sR(_&A#lsUiMrC
zf#Bz%uEOT*axwUqB%_fDOT`ma8&@3yen0%Vnw&?%3(^L|m4mJ#e9PJ@JaAH>1gTzV
zSHymh`UjBhNDMX$IBPNbEdS@RVaI)AK<=ct_as4GuOt}!vUULb8Mdl`aEbjR+c4}$
zkSKT0{A^We`Fs_dU~=)U(rF(O??i39DVPy~Dj5Ujv=?T}@Qhm)-E}b;swPvB$WecD
z&vS}PJCNv!64$F`#}TaBgQ@kbqsW8Lcf4a;kU>Nlu3l&0&y16icAQiG%h=Nfr$+O`
zJ|u&iAMX^p!Wk<9><!K^w5@5w8!gan2;G*iq+s3EQ<j|WnH@0>DcKCpm<}pYDqd9j
z0%B_S3euI1p3k?@V%`L=`>zKun4R)tXmrd<7Es(WzBa;wgWa5K7FV{#%C8eX4?9rF
zTOaNp%WRqgJ+v{qzvm?9X|Q7v3AqG%@^b)KeFr5~Nit%~B|-(Pd^MW;Whxc2s)JOo
zDn2+|RR$QScuT5w4Z)ZNeuA2@Du)CY=?8#k0#_Ra^`yuub6JV#u&)ZL_(cY%VIu{E
zW7aB98h8#Cg7)5i_Wip6>S222&kCNU!`JI5gU&#0ND|PnJ2!cdkF%gE>DXE>oS>Ye
zTsc{2i!NC@$Vpkn1&hV`iUj<PT5Ssv4g}~vF6EwzK2|RNpj=o;v{8!~x9r9!1%ShV
zqm1Jm%~L=!tO8LmT)SUPx$`1J1}f?v7VZBSDNl0k?8Z}^7XtSv(3o+<ia~>h&z2eJ
z$a{PJLPGGxN-W8Bh35Yyqri3Gkq8}+yuQ_GwCaVKTWDia{kykyaLstRVLrM4W~j}F
z2m1E~037xhbC`x78(-vDuF8XYq{K=8Jto{t$r1&L0|Be4NN>z2px0V}TivM|tv|gN
zNrgO-AlWQ`Gzr-2qZJx8>POdrZHpJkFKh79jvr;7(}6CRx4Kpv8oy<DclGK*N&qBK
zS$(h{5++a&M%Ow@Zzy=rf&FK}Ml3sF_%E6;P8x(u81lb>qg%q*fh8L)nRCMRxb>jB
zunZ0~k+&(q?S3jU(=smuABS3kkJ0$(do>Pc)AGsdCg87Kr}(C_2o8e1KDzx%o`OpV
zE+~tfr6xf8_M$(`yR&+z*?JyFV8p4yIH-E^hY=nY^r1SRl1F6(o=+n@!C}QI({U3O
zo)n4Y8e;SY{Kv?q<zq~&s<Gu1dc|ZD3WQ0;1x-wp@SZLl#K=+q7G;`8Bp*0>iE`On
zwM}7CS)f>}gqF^rlB<MR3uh&oIW9dtj<sIAwtJnqw#i4(W)F9bx91WNo<WE2NfEsU
z-Fv`+e2*e!QQV|!6Q*Q={xsMe;_UiB%%095UR`i(iA^wuZDO5E*;HDVoe-g7Y`FIv
z-76+W#j3tiG?dlcv!=Enmvd$|qzP%VR=I^<kd{*`%zWjnG+qE=f8mz0fmc<pJIM*}
zM-maI%$uT(Lu>R;M<;#QVP~34--SofPQDhV*QHPXS@_CUM&M_|xVz{)tzV0>%gkU)
z!e?{u0^FXQm+cDQ-LZk(I<o0aJP`5`I0tlh`u@56^47=ZtmlC9|M~E}t(fJou|c*m
z7GlE0a1!bz;hVTJNHbwG;fmg3>#FPE-Lj=iyzP80DR;4aT0$R{F+;zRtNo``rjj5<
zTBg#}m%~#>4HZWClzG{y1q%&jvocGgshhrDD$x`2me8CW_~X!a-tVtww!<6!l)cPl
z&V!M*9gV}^eqI~@2ag*nr9lq0bs6e5QzLK<0zgmJJ6<C^2x*;yfK*jUqBY>F;fVD!
zAQ5qS9y<IizHySK^L$nypNa?rE1CX|Zckw%?xl`q?6S&Awd(%R3EoUuwC0&@SvSIA
z2;`JmG)^k2kw+OxFC)j+&6bD$WWwNl9Ku(nVu=Wvn4%z@7QZT&n#KR_^*Rr+75q+!
zpBUhXA}Sr4x=yRAl6qD~hyWV8EVl_zc9BQgmfDjjGtSalu6b5$ba)~vgaNYsT_sf4
zHzO9kXm27anI7`XCcW<m8_`IOT%jR~BY!bg1K~STp#@Dp_}ujk0ztu*?;udkephdg
zJK_Dt7{kWGTEm{_%kfF{U`R{XO$BvX-$zH6HQR1!1ei0Dcw_j)`O>nAaJ$LLndZA6
ztI81UxeebXm&ee$3B9Srqx%wq5n$}%qN|QLRu^E+^EC}aUfp^uo#2cy3{O}QNfpwo
zx&k*noG3h4Ms9c(D@Pj-FR}FU$u$Q9Py5JV&pdcGiYdyC%PI>kNB#a`Y~o)n#*ve(
zJ#jn`G&$NQX2uH=Is_?$UAXt%f}SCVkmtMO{lwHQkLUNpUDM5_kB_Y>>&x%D|MseN
z{`NYGy9uLf?*h0$mtQA3UB{%Zs~1&ckaqjZ2&KoeS6y^LzyO_{iGZiBC!4Qe4)-bX
zrFDIDdzcUSv6`%~Fx!}{u*C`pxchU9X!S}&MUBiVv1}_OAAd`Y-+;!wEwK2BRXb$8
zsOB|Mxkw?awLERBWd!bK;CU=yY%R07k;-PNaYB8*koWU%Oau-l0iK;q9nWq`66=^^
z-*-X~C?I>wbDBxWikKWoiD1eHu6HEr=ut3XK1R=pTZKd1L$$jvMXb~|M#%PI3|WtE
zn_p|67mrwH#wjWw>-g5XA)D|IC^;U%t)m3CSfO!@0)s58`WuO~UD1IzUDm*g4kn+x
zojlV-^?1D#v72tVjXfI^nTktrikGX=OMY25YtS8Z0*5ygXzwE7s1b{Q2%fekW!3G^
zJbN7$gW$u=p9O3p-UqIb(cKfgR>(*jQV0SbFVIn_3-bUoxiRjoDH7KSdr$tvN?K2G
z<^_lBV-ak1DAzRJEzeiuDi8jK*7NL94cP_BWwKKeA6WWH^YLUm4}?1VDS$R`?v=Nw
z()lyVbtTgQNc)O;yfZFnG*I<LG06t5J+#zKKuXvygiIhIkQi)7c_cpv!~JX8Q_7&n
z!`k292Au|SL#sNkzQvk-u~VspC;@|pjyFmhU$NjQQ9Z+WU(#;yoIQOXB#-WRP}nP5
zl`i*&{5i*=DvQ&n{<Zy7(XrT$^!>l^?gKH(mgT&L+rdjy|9{B}_3~(J{m;7n174A-
zvBIyhRr}lguj&V(0-H%y!40atPL}2b&&H;x)pXpvip4%Jk9)qR$owtSJhJ?_KZt@g
zHIbMeQ%_TR*$7v<0oIPAa4EO36EZW-${+D%KsNsq=`TBvaYJd={@`3(p#-DTK{4Ma
zaki25Y(FdgR|1~LH*ul#kZds%E|TF(d>RC|fz(5(2T$$4f27T*Rv(R~3&Dd9u9~96
zN-08l^3q0D@eBr_OOB5-DkfvIw9!pd$^9}7`@PX~bVAVKXa)jw_Ym1fGwvz(Gwcpp
zlqH&2bG1ECiv0VG1Wi860sHjA)<r^st4*RjWd4xQo5RHRTYcn(Ryp-=<=xES!IU&Z
zOj2T({X~EZ$^LZ`QI7Fm+911Cg@wm`F?SPWh7nEtRWd9bUSR~JH1CZrB6Acwp$ll{
zb@z+$4Xnb@&3K^_?dcO%B3KDU#3PktMJdaLFJB|x9MqeUf`<J+h1Xwo4*b^yKepju
zdB!3;3>|rj6_7>#X3L~@30{NI#lm58Nm@U;71OR<_(R!ztP3PFw6SI$>N~wZZBWDh
zF<I>=q;)?o-Jo?pkA5iw-wUBbw;$Lh@R55vCX7XA549+KG{00}X+pSYwo5#B7!%-v
z-kz4vRZ)F2Fbul4vBXuafxr@dU83Zo8Un<)Mb&+{3-%uI;Z-w^KNM{B^l0WR$LU6-
zxdDV{0%`I-ikI*2HO@Gnqi$Tmjw?p|z@!55SNo<yw{*Mz1{2QqDDia_XjK2!YCCYp
zhjK{Uz}hyT<@uThZJB_VczY-J_Xi=&N1qk3joBO;$MmXYEx;QeXg1^y=Zt+sw_dj9
zmc%gvA%{v(zRfIk{oxxh3TUBJ+`J<;m*q$u!YM9falJ=@eyt7?K|Rh?^O#(DsYL8K
z=wZN(s+ojMuZxqvv#ao2u#$pFpW~g}?e}or<Y_nN;ft~kwIIrWMR5v-yHBEi5x1Ff
zjW>eF&nYwTA<Z>}#5+K*GuogjMT1q0iGkn2vAJTe@UD8641`lYfu2PNE{pZ8@#8(O
zS(>pux$gT=QIWVz;QOx7YnVpgmd9D4R<jc$`Y?2j2k@RNJk}5qfR&B+{fb~_t<7c>
zQ`;_nv6Ubalb<In<My#OaBW4Dl20oL>)l$-oa>MG@_4M3zZ)OeHL0M-XXi7Ns3WE5
zP@ybE!0`$uHdO{&ejgSSOb$s3n67Wy>zLQ@ZGXOei>3E7qK}jkScAL2I0r)2!?_9C
zYgH2oFzR7}>2ny=<m)t<Q$ec%yNzL*;|kU&8bWHW9@OiW0hD4`*x!vLeb)*pJJ0Kz
znuXy)PqqsG!VxWC@5KcdJq`9+X|F6~B!P>(#VWOa@uC645k^fJ%!xufDV%*gHEp=W
z@;Mf45O+guew)V;0da@Wy#m+K2=V1(si~lDK|K2k>l!w)xV`Ei80j?q+khT={>EXD
zOPdxAyrPP<U~-}sKzRA~l#*uRIY4JhMMRhxG4D_(;DkjjeYCWLMU5KwR1B`P8p;^6
zx8pN`^==a;O(S6=&eN@`K3SK-u7=cSh1|C-5OYc#Yxy<sSe>}{EFz7T_#m+~lyjcy
z-?qnTY%LHK881;-cR@dbI#)6Zl?6h^;xju0(UO&ADdP4CL<2L1bfch^Yf;xN9gyj;
z{%@pZ?&0m%^g%ZMv+W5KT9Z|fm>_MFwa2qWG}nS{ZUKlEafysNd8+0lSxJY$U<Ucz
zV<}TqGpRU5skUICEWKKp<%c^N>LTYU{Fs*#W$KJI;&@9X!mM0wE=#h^VtCM-xm=Cq
zr{O8$SS2E47cx}uQ+}Qx!#@Tpo^N#ic*j2sZSGUeO2nCsxBtC30^~-mn<jjBb{}L{
z4ocKHL2NFn9A&CVZmu&^sm^uQuFm$(2qc3gEO(4tB`OI?6AC<(@pSd3hO0}OyEC#V
zU5`KKSWvsrvMbOU%<{x<A!kW8hPRB78ZUx9!xJ7XX-=XA@v#o!Z>)y*B~J62)>Ve&
zaIZ@9>jGS(+z`g3uyw15AK-6R3k?`ubi(@AOWq}B^n_Q~%^by?TExxQE9OT8aEvvf
zC_#(!9%)M6qDF~l=LswA+^`W^O7r@LO;fXywyBd0ndbTf&4s*S8P{AlvUL1rPfR|=
z$VE2X_(zJlzWPc)+l<BzR9uN%vWOb^RO#C6rAPJ5@H9X)(HnAOIb?>DY)_u12!Xzg
z7C<=2a}j69x2y=tTw0uhl$GF2l62)DUPJOl@|Nzm%AuF3>pvi`7KT8ZrWd#!*4T+`
zDC*Qnr1$Usn_89w{8!cY!lJ-joE$t{NQbJ^pW1mf$j2(C?@}g#KX_cTPXQhs$!a^A
zhJdn_6PQoyq@eu@8`P=a*<i<{y`NEPG7B(Pz3RL3>k-R9cw)L*(cSz!bOSmUf@@A|
z1zLU-FI1@IU*PdUkjZI}=y(JUpm{BV>)ek^=Cv5>@;NF+PFjDp0Q&J;)zN~~Qb;du
z#sAd;B!gaiu<W;8hRUu{<jgG5)y-DQwVZkwn+uVgKvGXA$<i?7s45qFhChW?2Xhf}
z^Ox{brV4sUCv~7?YacT_jh8yGcS%{x|20AlmJsusNnxcV8@Wo%wmq<Qwl4A9l*7U`
z_QtCdMvxw<db!lRqO_s2`{a^y_7esM4)Y5*Wf)T8tK|lya|W%OL(f2i;ZjA(yW{4=
zDbxKE8K#wI80g%Eog8%QBW1ZHNa+*g2UtJ*_eQ{W<>)-jUZBdpY&q;lHk&mvqBd<u
zmh)S}JZTp4D%Ab2hyZToIZC<^(EHyo25kze*tA7e^P!7|A&oI+l*JVj(Sk86lsT^!
z3dAasfMuzA2zgsvnvh%#VL8@wt@VWfB#xi1_cvJs#+Bd<hNb5@M&bzah4g(X-VTQp
zv28|_(ama+LJPK$Y4edTr@`qaTTP0q>Pn=j<7!j5Ful#;Ope*xykQ)QitY?9{I&-q
zs$6D!T-+<x=quX+g&W^jVv{O2XAx~N$q)dPiC=;2?-(TDCMI+sGdjs!5t-$qKgchK
z)d~2K73fJ_w#K<{Gz+rSz6^YuFhqy9?|yX#EgZ~XzL&{x7hJtMCde6mMtjye(V_lu
z1qxb#M96l&CEi@OpPf*t+F*9}*u$H9<S<kY4!vL|4uq<WUO(^pffgwXsA4zoi=RGc
z;IPf_ZquV1Okb=J?&sxAOVm}?=OGqkA+TU}KxLlnCs4Jt9X-vaU{cA$ve7AE&;eCu
z*v5~A2)ZvSMW3DRlsemkCM*$qS`bYvi(Zd9VYE4bOY|g)Cgdy*fp3tg%@Mz5*XSZ;
zSs_nia&px&H7&o@FG^+xXa6|3C{Nz}q{g4u5-W71Hp@}BjSOo0rkYr1RBwC@eGDau
z^m(Hc_@{R~YqwgCrqqI}>1o&k@3OHOPDoT~V%s`9D<BL3Ar5gUL6J*I3U=4Ih5tEy
zmt#j;<lk5q4g!x5VIcP)Y#g$>2SjNK0Jp+b5N&}Nw~R|1B>`Bs=?tyRjx|=IU=u8)
zC|W37czkTwGhTWs3SjuJa{a+ir+3HG2wIcz=kwdspb#1H6qdCs`gAlD(Z~Y0*k<Xy
z$#mHbyx9CB*`DbJRTlZ!HA+bXUPVsg?u837+MXZ!;dS&WFBI~5ifpxcH)KqDe~L1q
zOGu?KeIMowk$aEa`->4zEPE%8ad0$+PT6PqVUy4X8Iuj<i%PKRg(c+^+Q(Y@+Tt_D
z7JGp3y)ggj8agMXvihqr%HQAT8|H`4zPf5|CpU-v^~PNO?k1LhPX95ZwiaQ;asx4I
z#$Rh=m}zD?$5Ce{#~ymKGbUFASGGL(K*Yv)hY5nXrLu|o5}Gjio7)8VGWIl3Q_a?Y
z@V*7Hz48IB-7ymJdA|hLO6I{b@w?mO8Tsq$Y>n+d&#qX%KSYWD)d5*X1#eVr4E9~&
z>+>LwE^{ym0rg~7yt-e2enmI`0*Cf?8n{jDHcG1oouA^Vad2(>>tWE4ffB~l0&|81
zdhErvn~?zk3hi0I=_Z`q3{C6oSBv3Tc=*;*EE5R~(CyQ77po2Oa$stS<>?CGk!nbC
zn<B15e`qu`Bv5Uj<F`hL^Wf?YxN<uJxgz_v@GfsIXO;uVenL30G^d$#+4OZ=VJhx^
z$eY00mh{4|)n5bGvPt&8aLr2awg#h*!hHm4K?n6TZ4AKs0OXk(MbG^)Hbl=}mLI2W
zcU<vWfG2?N#FHIBYLlHwnY&A?u+s$&X7O!GSvp0{v*9;Ua+66VjtW8AOpV`Mb+B&{
zz&}f}XquAtd-I0Ho#vQ>m;B!IZHA@N+amTsUg4&#2KLx*JZ()f{^hI;6THf{a=C=j
zt}_hdCCAek#Bs2k2mlyCY_qblf&4mO_f;~07RkX-S)TN0Z|skrJ?1@0KeTo=nRoKp
zUR@P&<{8iowv$-LXtIWJ(wPMYj|k)$X>_CR<~y8I7@AT<UL9S3(^d9S7%c{rV17~%
z-vd!^AO8W5vXqniX=&?eYH@F^qRx7UwER^&&-Pq~m7g~0FD;fLo($cmt+ztt+ENre
zj;K}*(RYJiB)e;)3zfvYT5>W4zdy_KqZ--!3=yu#(0hwwdXbY&n0M~W0?YbFvf?`T
zzv$aXxn1b@svVpjdNAKlc&u<yOx}UrC(-fC;^;cP^lup|BG7+Zg?H-HsV=W!{o~WE
z%Gu~+@)qpLsoAS}t?UwSd}mfrNSPBQ!wqQ9kLz*jn&D&SWqM&WL?jKC<Qety9&G+s
zeT|C8Xi5C~d|I;9WG-Jp4g1`_Y_a>Jp8MT;uY5Iy*uL0E>4GVt2+v}tk<SaQYM)z;
zb!V27mG=R&V*ecOvQ>i5mvl6r$AhpRp<I@yUzHq-&o0#jG#^X;Xv|d#zP~;)iJ5q_
zfIg$1Q&Y|7`|eZ47K#e57R^?bRl?Z<rr2AF4YZ8}92hmX>DGUa2Jy-dN0T-CeiYmM
zhiW;TQIT>yvlxO@v@W4!2bPqc{a_uZZ78v{;25}+SBBqPLaF9}fcrzFWKVr--Ycb|
zP-b^2dLxML&HodTE23u`fyS7z8|7B#<Pv$@s6!vS^$STBjS2Kp3y|w48p8K3j<c~w
z&XDTmlSHq6%Mdp9N#&d>Ct$DU`IY(glT|FNT^~-Hdsxvb+iEOa@&iSIP*-0h2T<%E
zwHCdY+?(@l<<YJtt;J_-%|l7dtp#Ae(P6(zZL5opd~SFPrCG%7&)8&S+#nh;zi>0J
z#0um*sztg`BUJ7+rxPl{w@iLS4-!)Hx)c0<((PxJ31$6(A7~lvHrQq^itMk8JOnBL
z^Tf<@pJaWx0*J{tcYqXPMm_;xCjpZ)h*_8cEplJ^`uXvwB+hLaQ^HCf^eCn&@g3Ry
zgCLt6Ep|MqGK4rtCIK$u;S5S_T2fMMC+`aZ0cSx^@*k3z&6+Tgq!$|EL}EHR64Jp*
zC8wL)U0Eqx<xxqH3Dl%8E`22{ig{7e{4^=Gc?)^el!63q3F+y=(;IM4&cx0vQ42Y0
z&L5<^v3k?fFR1yR3Kr8Hi6TGhHm-jTU73HTkQy3B*Uvz%la$=K=C~_9r_lRfNWzte
z?t*1<JpK7uYN9FG-$1xLOXLmw@7;3GWwst7pSNa)^$9+-C5?x&z4?I%8ejb3;+Tk(
z;eb&VdB}l2v~Qx5i~;*Ox7Gjx$2$g2G_ifk&7E!g83SXeA8G>&GhFub3decec1w$S
zy$O=i!4c~FJF<nsz9ov!>V0-V?#^P{?m%GN{<47@v3wjnXc^XhHMg~pU!IJt93Bx*
z(hF&t(+&X&LqQL!^h1Hn(`0#doFELI7<<o(Ry_7%&0j>~NM;30Aq|0Wya=OHO%dbT
z(OL0BWjyty$k@lO9*m6j=Q_Oy+x$f27WbxaGxxj2aR}WZtwnR24KRXnU~A%bxCh5j
z6>JqUlBcqruV9Gg&W}i5?}i=ZX(X%t(jKn~m>}K%=BaqHaJY0JPP06sDTn;1VsQFO
zHcq<H1zLE9!(KozY`b2@a2fzLbt^&8V`jB@@s2*C;0yn=D%;ftba4V%?Wy$!95Hec
zJD3{!`|4=Psk^eFqjN-n9VN_XG=dgu-X?RdJ@ae;kcVaJHmWWOZ%w?woU2Xg&I2uM
zNlQm7Y={RM+e6~yXr-$W9N0s5?qc{#54nPCNDM+v3PCp|Z4QG`3gwIRMSy%ui@U6M
ze^IGd^&*|i#`fzQfdh2VKSaov+!+>Z_Fe(d+VM8<2Qo^cajfE_7D-iPMD&rB&P+Zh
z!4TJoYnq2p7^W=oE`|!mXvWKzx*n+^p6d)QF`ig1J(6qU?xT@8-r((#$S&MdV&`Ym
zQbP53S_lwPPDoQ^TJVnB9?A|s8|$iYxv!&YdCaVClo1`hXLLB&&iFu}Ik(5-JDLBY
z0tL+jgtW`zHylgee3iu3opcrA03P|4=iwIayQ<8{0zZ~GjC<?rnSO(ryDbMyHl^gE
zqv^{}M^_xyHF_^jIRtTAcw*W6ULLoZ{VY#w;zN#CB^1T1wKN9kwhJ>tmGjUTnFK^W
zlMFf@Q*EBB7-hZBx#6J^^C?xnxMQa9tYp@m*&Aj79}BF*1>6ik+NMq75VdDbXFN@8
z=Lu#!lV@Qj)3R7b&E5hT;zwB9lBGpjb5)HZRc&Id<6XqDIZZ;z`+e-RAWbPACFwzy
zGqPM&g|s}l+tJdk1207FawD%}u^%~mh#taNB8@x`2$6lShHV@H%%ys22;vqjNB6V7
zslmBZGwS${ASH^x3RI;WL1k`(3p8@>c%dHRg-!V1mj(e;&s6q~Mx>LGyu`h-hAm)P
zq%HDQJ%-`ex>=}o%?-gE@y@e&5fii$P9y{o_DSRePgcb1r+5Pd>nmJdUDdIO2`XBi
zibd()oxU`hmN(&iQgF~(iOZ^B-CL!3X>nwPMYW{tJ%8uOQyiI7^_Fb~=Ubp<WBZgj
zzu&JYv6-4DY3|^_y$Tp3%yK4qfJK9vccYKx%u00Y8^a^(-6c8tEEds5BG)(`3-^A6
z0-tF_KW(gj@}u@|P3NNhL?_teY3ao~D162Dz6-I~8_?fjyp65;utT5@PA1$#Q|g2q
zPz}XJul{jSD&@n8F)nJm3{kabzDl1;nt@p7_qknuu1DkKpVRr+5`5}%5;PQ7Kmec`
z0kWkD-9-_t;F@+eOtqqxMCs38!!v1&do1u=J$uum#-N-4eFK_|t!2GL+9!s?cJBHt
zr$tNpMSs;KLTfK716W>3SmEW}3T2Sp<nAPNrFl2pzv$jtdm$vcln6NT_8<pDr^((5
zPyE9I0LcPKUfF@rRQB*aGiZl2FTWu@DLx5_!uPw%G;T2<Matnfdx+b*`<J6nT*Q+x
zDcN;)qJV~b?}X1@RL!d>iK6=z@-~`9PDqT5yn(*u(rEq2)hbf<Qko3R)9a3?_kY9e
zQj$sVO0}C*^g&a<572whRB}qzh{en3<|2E}P)b-}Es;_NsXMY1b?veWV5rH*c>w#=
zv&^DIqr~4$zhosqZ?F$g%-|~cm3=dvn3I@4puD+<=Nz4H9IU~e0uuLbjQZT!BfGU}
zR)tL_d-=rg_Bsfdbgn@&p~sB+Hvfn=02CyVJEv>W2!zLjljzu^?NNWb@nNf@U-uIA
z7}lZ|Sm<$I2@AjSY|yBFK`#XJm3Cv(sQa!khA!V5y)Dt%pv2Baa|js3gl@MG76P7K
z4ICWP2Q{wmqtCR1K*j!E(3=O>g7qugfqzn<HpsO{>@#XftJ-buR3R}Cq&X~`<pc1H
ze;i8MG%dRMIk%M#QJZ5xr(@WkrEec@QKXdGu569{{TmS5s?q0|c^`%`JbfqHSgLtk
zIClT>GDWNCl)KsI-MN({-Kn9*7k8^3xs2XgIKDUrUckX@Q|EJd4`!?Y;w4y*93RTT
z70JX`n>QM@6oXp@-W2TMc7E}-oVHQ685*wY_wVJcyjZ&w$-{kWKxM$5!NAMkpE&2?
zwFgZ6@@xB;j2i&nhL`Vf3+o6YTVf*XxXA;(6Ym-HB2Y^iC?~r>5KY`^r3jaTj9E`$
z!<}Ag$(hC21X<}>r6e)7Ksb9!4P*YGhTTz^)*@~u1qXxUjaFreK@}YKAvp*JwIyJa
z333d90-+N>qA_*&J+m56Q+~AwwbB1w{}NkIrr%pI61W8u8*vKI1yPYrz<7WRyOF~i
zCEE#Bi7Qny4K}I*dm$jNKN1<Oxsl}fgG>^#ILL&94g0Y5_z<7qG(*qaU3D5}L*8%Y
zS^+&=o4H(<n)EzXGih96ej&x)#>5*6^9_}^T&Z513VhQX1Fr>czbvW&SROzqb-kTh
zLmrU+2R@w}B!?GEgR&TD^Ylp$VvK=po}?3BNvgvj+DKb4)~8TJkRnvIal<}uhI7Ds
z?j&o^ova7``9{zQ|FUHKGWbh&+&gYz%_+kpiD|VPJ02E<PVAJ{#O>=62n$?Xruw$1
zM=m!q_6VQ@qBMhq@faClCz~fuwwv9TPMD2i*~$Ul$tZy@^z%LEk1&Uzl7#HS$u${W
ze|$pu%ok<>v1smqRpC31+wUiuT0S#YCj>0Aa*{*=aa0?(RCoGxykyQc=#TRW{(aEE
zrJs!qaXh~#vUVe*VBhs|;+r+t^<n<5xY^-vcfSdqpXH1pu9IMV(Gfo`v22tyDdbi&
z;|LWxK;#EAvd~?(J!}*WVLTGSAif`8y0?cc8EPl@_ZY&onzQyZrb*KV1)96$LtN}*
z#n&m&v(|s2+^i0u=T6DI<%!QugATT5_Pod1OTD>auzQ|<<7p0NhNp!+QaH`puCBJ1
z-T+`o=yTcPL|wuXw=r{sd|2<|>2BGvVhxO=Q}BFy_Gm`v9u4wf&xM8<<8?73<T8?g
zMU)jBSXc*K5S6>?KuT8!hPD)&p!1_l^76awW$jdpV1?TZ;2!I(A@8A|LMm9;g5j?M
z&r3)7+;SfHnxQ|bPIa@tt$pq#X3r&dXb($l3;fHAHhI+0)^r3L+$6tURN%(jWSK&f
z8*f9b;E0{k6BPgplw<;`aaIsti{aS0`CiZ*XLogm+=}xRT`$dPw~l)hJ9vrM$L*s>
z2c{}$H-1f(^7G`}*<EIFT~E`4bj22n8yvhGT*egcf&SFNfSVNjk%3po65HuU${pL8
z5=ZJ^V?L3BgMn51Yka&PE^I_{`&h<aT)Ems#1v(hjyVPc$8~$#5|NR}SfVKk)+4^}
zGBhnpx(Ek}(B%%NB3fRUx}P9IH>j%}zaKnBoNj4Kuh_!#2C~8*W$@+C0mJd9(;7_B
za(G;71YV90KI02lYIASEHcB-47u21&P<ET^D=aXfKJ@Y3l)BBRQI`?H6w%8rk#|L4
z2|leMkjf^H69|-r7cmbbM>}%&b)M)~{O7irV6Cd*N2INs6OGmT!IP&s!;UAsLC|QK
zRhuh&+^k-s=Pfy>?DxLWr>hHAHQd*{*FLcZE{9LSC>I4&b0X}$csQz5IXe)NY?(RM
z=eJs`^+pAG`r^GG$-+A0^jn`Q48D*FaMb;5u|e07D^ZsvLYXt_Hq5ilM@MU-(3w%B
zSw>K@W?Zds8%+ypCJYqf8RLPKy0Tc~CR*s70fyom#fYUYT&XCmaMX%NoyztFAK&-C
z_rjSCy6Cb)Vf2O>r1Js%q^06MsUHL*xUIhE!^0dJ=$a-jWKfXK^psa57s_thj{9$5
zkxcV64~O@eoAh+G8Z`z(>(dR~crnw0k4t+e7Xw|*4C5z?yrewe`+$71W4cp%wWYS_
z98Vd7`gNteD4D#sL1t%=9n>xnA=m##`2n@OBHV`isbsXnBD+toBYSR_m&dDCyk#?t
zhoAQZKTMDZ>+nf{<=_n`F5DVtXD$1(L#r2FDg&=GrBbMe3&b8=4v2^co$C;|e`G0J
z$Episb&7o=$eXZfgC2O$7Vj;y2`nxbAko{v3fFDCDkI4AUIUU>BSLe2BRnnyKItrs
zxkkFcu##}!669}2p>Ze(nd20QCGxu`C68)&!~ppYTK$Ja!tvhHJ;f3hqo>*92X}Js
z!RPL*oQ@Z^B*%GcIvSe)iPGm14$Bv0+c0v=d#7f+r{5&ulQf!pv9A(s7OowdFwVqV
zx#i3J_@Y${fC)@qah9{YaUsFu5+sT>hW(&jA6(%U;g44UEwmZhH@9H&qB~3iZnuNb
z@s$hz5Rv^K0Ea+$zfC=m8?-~9ll@baAQ%ws-0FyD_Aqtr{sm6ppmRZ&4`MzN8W$!a
zR)K}lXAP`8fU(PYVh6sGL|WBX?id}I1Q?LY9E}Dyv3*QuG#LB%UqJ*bEN&O&)`f@z
z_Je@fNDo~oGc#p}SjnK{#l6Kayq}0zCg8dsy?=lSxCwL3K_2`*wn;(J<9Kk0>OhpH
zM6U3vG)C7Xse_<c5YH#3ecvA+lXUsuC8EF0{iMGjyhThi_W5mqyeOHnSk%Fh))3{E
zATjLuY{_EboqQ{*>a*M`MgT}Oh#pS>Xm98_2t84AT#aF|>`fLMSQyz@Y?e3-TjYZz
z%Ol~w?bFpUOw<d8+#!FeN#9KgJxXua4?Ln;gphE17hV->Wz^12z3Z4?butVy2t4~7
zeVQ7e!GcV_p4majWF%RyuT{Cf%uk3Pfb!mnHlbV|JLnUtQsK%{&vof-Y~{=Cyb99<
zmm#Y1q}z}%>pOKFq6o}*w;IXk8dLK9k^)M7#FTqN3j2wzlau4*F=O;-1=h^8NQdXP
zNX7k`sPGQ+Nhro16B|SyI_uK*?Q?rz2REA+HfZY36jN#{Jds&-f|}lL>&@wLQ|*iw
zzr@pE@2nq6C2_{j(h}uoI8&R3o{TfLX^N&EX3au;`>46y+HEy=;`w0{@(52BSLEjs
zol*`-zYkqBDV}uUbT8-5;=N&SVD^2(gdx+-7)IZ66Bv<@5nAqAaqd<xiaTwPCTAh^
z?wxmtf8Rm<A0SKLzfWtpNWFtRRT$=ysQFY)l&bl~XOXNK&Ctd}93pJaq(-D6QH`0{
zgw)d56h5mqJEIZV^^QiHr9}YQJ~~2gUi?O<L|J^~@N8D?utkX}1We3U9FSBRbv{|t
zP1C~Cuq}!c`6OD}jVR=DP#b+`EVo0Q>+4AR_p+t{SyQem*Vo_Ex)P=4uUT2NQJyB1
z?qhY4(?OdIc{5>~PlTDL!FJ{>xYs!ln*skhQmY{2S+rrxvoo!>f6oi>JK^(Zo<*0J
zz5Awx<9XPqJZw~E-l(Xd^RPL2*qq$AY`mbsWw;JK39@rT3eJM&?h-SB@<Dh$2+x^?
zXWA%wkfRTB^iFa#7yz`}wFXRG0nB{=G!aME^^+?2y|}4Yw^6}`XPFe}EN;CLyQxx5
zC>O~x$sAPiVO_DZ%+w`T&viHAXdn&!?%tczdqqd`1}n_^PH(Ujff+Ygk$irGl_nO_
z_hq-mzxB+1*la#*HXrn*ht1}LlJv0IeAsOM&Bol{Sa?2cHXr2Zy~|PlB!XUY%)i^5
zj3m?AQI-75_M4GMBLn*!AB{vOIDa03CXeDF2|2xwZ#%=LlpB>wp7r;PhL8$xiX~*2
z_nmGeLkhEOAtM0)U0cZ%qff<+xvf48@!GxhuV&H!^x>}bVf*@^fjw+rAJndg?d!w#
z_3t<4{>H-dVf*?ZNAF#Z_FQjh2IampHh5gdWd`!Da)-U_j2N>vwj7NSqWN3wZ@D`J
zdf>doTOe8=+v}z<sj<vf?{nLmU|@3hn*{kzH^B))Gxox%aR2RF;sjIX-x=>79`A3R
zkT1NW<JQ5+?!yN8VT1hL&4ItMj`y%Zeo*WlHpmYf<OkvTut9#1qu+xZ6+5;2-5lS;
z#`r&XQ~ZrL#1l5de~XRqG@Iau4RGp=x%1{XXX9HaJYw58<<)$zRxvCR4<^s9OrQ1b
zOUtQguEo9}fI$FHd@CUG;IB4%5#Z7sY%Ye78@hHBCiAA@QlVN#?uiX@AG|5~s;3n{
zQM)xH>?;dAc2-<JD>C~3Ct_?$S<&W{Mq3U_u&Ox@+&;7-z2O|l5I`A?=Rnl_D13wk
z(X13UL;=WivuIE}r@@C&M(#>6Z1k=Ta?xac*TqK_6h1~q!~z-l&Z2l<XxziLRivzP
z&-4S!t1Lr#-(~2d&F^^jC_vedTtZ~<*K}NDCE$5I4uq3OblZ6Dxu1bEutj_Xb>d=S
z1~yR0E-jD3G_6BM`^Nu;)vcgY7i2B7`q=mC{<-bQBm^5fhi#st!9qssxb>dJp|>zC
zmNc~cCZgC5E4sR{I~S52K09~a;2fjU_|R6?8@Qv<4eQ!|#}_EqH~|{sbH6LmbY07L
zN)(FhGfe{*nZc@khRPOV*cA;hd;XQLW05F^wtrzd-GPN6*c|KH2KGDTTNf#4|8gt{
z7<bO&MPX&KFnk-i<VEJ|2>PBo9<d@6KtJJ+*kQZATJnXzW){PAfjvq~`@jmU0dk-R
zBLngH*3fhUy8|d{aRNk~HPmVy%N_eru;W=6X^5TQu%Y?cVm;3th6QW>MGX)gTmQB?
zL3~U?Q!Y#j-iER0Wabc77YsqidZ20hwK=`En(TFZr>YG{fqsJD)~sT2)hG1m**a*S
zfLxYd)%3V-Ai4}ueonuxe?bs77{Z;7JBERPct@6tU2z4>AB{0Mph=+)nLjZ73mA(~
zA=byNfrai^p}Tl!M2@nK`H#wFKwPVX6tC6s-};Bn_QyK<xkm+sW;*@|1%mpevZBf1
z)RIX4XZ^$3S^cByuhL(^bo!1UBKxq-vqhJwY$8KWxg}O%($PBS$6<T7LEdNE+lTCM
z=Y&12t-u7jq$vnYcds0ZH|P_`<bV-{cU%+~+~=(nCVY+nTIPeqv@n375>I|G?qNVX
z=7F3NIACfCcjb{dc`AgWoH>5S#jg^X@IR}Sm?^T}!W4n^kc70rdJExUi3EccP}2GM
zF?WaG_pA}?`lF%WpMaLVtaq);x-*8-t1lln!fI&1g4C95hfyDJ>E=Y2qYmU!2u#<3
zWgnfG)_D1K{9_HKrFV3NK7{W?uMmG#e`Iy+p50+#2hzfe4;r!4-yVtDs@1L>Mp2@9
z+ymH&z^=gSg?c@%;_63m6?&wp0m-}w2~>o887Zb^V!4+QG(2<o8AVMJquratm1-x4
z#NwyXRrga}$6Hjamy*kmA^_o)NJm^b#gMufj_F`k`@^nO(IYiUznRMeU_nuq<$)ld
z@}C%Wg8xgtn(-rILuy}CT!qYtk+Thig7gb572uSGE1?7vB|?O%xRhFng66s!<|gVH
zuvi4RZ*)D_XG`71AGlWx77;b>VeWEiNoyf91qRTx#}-L2Q7P$N=nx$A)v*Wi6Pg0r
zh3nlcD+lAGSX|je4T(_VHEFPHWOhEAeGu0?CN9##YeYt1IfV~YU{T()hVG>WY9LDZ
z9+lyAp^^-_1CTPXAmB1kOE5@Aa`Z0>(!0^@yKSjw#CO<QI^R`4B6sU@p_dFH)p`y1
zt?QrXp4s7x_~MsK)2l+0Zc$xpVSrfM`Rr@KcRK^uw|EIWe(?nlJR8>q=8w<)zz)V-
zt|qi2jNA6+cx#{3jab@dY4M9lx-At_%C@(UTSq66qC9D0$(^l}tw=dc&`YuEkUd{p
zD}{S>8QhwJ9`nd7p||$@pu}II#cn;*L0|9l#3)Wj^__(*KHfUmYrVdQsKp#nYT#m?
zwW(kp!WU<UFIK$D7>EQv<)Hbd0gVNriwW8bxx-?1nJEWNOk{@1-#ET8{1cD<5N&XD
z%m=ay1%;C&&in%AyObw73+_Rx=;%^qON8Yy_y;+YEoY*9``(00bRuPtomlQuM#_8v
zKf)1|66{0I{I;SeVyqCYdXrsi{VKb0JrZ(;AL4X8*Z0MpH_YU9r5E94wuMK`g&WIX
zuS_pH-fbNpv<}{^3)Pz{V2BdWLIcLvE5J-b3**b-ktZHeCfP}~+zsLC28CMDnuK?7
zYL}(4C&EHL7Uk`OE<U2NojM{{fDgL!2=77nI}+Tu@!Q*(_tF<f+1?HgB*x;Wb#(p~
zsRg*aw=-EZ3$8INg%UG7&HHbY){1R;#l8c{&5}A2C!Mo1+87#V#X@)*0_Y(<S}-c$
z0nr`AI+78SK0N6gYmd321MmOvEN318BFlbfVr1*|<Pfjb?;=bjj_E{-goYU+zdneU
z*~E*+!oR1G2|GS2YQl!42^^K1hAJw2R0VesK_QVbL8NDVV{w#eN-{K^K3%QkSd&PY
zsSHXa@CK9LAZY|6ERw72C89vZOcM|y_TQEW8Ov3}Jep&mQ;{Akvk_YD933}zTkmBf
zVsORy4i>d`j4Mxp^M)YrTp7$OOco)*)v!ubrLZP){%skYPqD~-F~Ee`RE||rt1SW^
zvqszwDNe<<AVV1Xe2LY1%k6!NX7!IED{fW)Rs2+#Cg^eu4fJEYIa(a%8PIJf@omQu
z=Fbr88V%L+#u|s1YKU>rq`ehSSC&T8^jY)$(c$q4t1m6p(`?76QKRws!0s6S&CuU0
znghEJ+a&JOgsxQKPnZ5&vz}*J6p*<S4CLSQo1uL!f1pMZxH17siaCJw%I`zV_szZ~
zf1;~cpWDf$MXDZ(svYrn<ofnC;2092%oEA5NKk#g`0Y!Qule6%!Hk3%$1s;n4=yec
zs^H=jB~+y*V_!z|lM%#o`sDDJ=J9cBr)lhCO6$!*(ymY3AF@c-EPl~`-m;K55eq1%
zd6&e6XyZg$M$=@8xf=Eh7ZY<eOOi!H^U5<v94umD85buBDVEO-1LNsJW(rfHSsA>E
zm7j}628NvlF_Xoq1s1j)MTq=y%VH$*v!JOOjMF!@xs;LLSYGxnP2D|irua6R+)z&3
z49y&7_v>()ejVOJzwXc7ufy5<HC=ecGbc3qZlX*!J6obnZg@nVP1$rI_fuOg^YR<6
zFx;ix$IZF>TTwYftJB1JG%LT&cM|TR$(b^KVv8?lYH)PHkGDCNo7wC*mN{E~bl7ga
zpLdkUX_X2XoofIv9$v#zM&}w!)urkXc05;jwt+u7H~lNy5f+PCb)bWHTo=yG&gY`E
zCsKBf%C;y=i3KI>(hMwvOdUsP29l%CCV;0>Z4;#;`={0~TPIE9U~9kGJ_5CSGqbK+
z+TJAhJ_!T_r`{M&y}O9vVT;*$YJ-p<a<iCIteCTzP}W4_-h>To6mqH_h!)uh4Q@_%
zwcTqJO0hZyEOwU>*iFr>hoJIWs&5Z+&lVKel*bDSUK?NhL64#R3J)9<d~#H!6_aBM
z3fO(UxZdZ<g2h=zVX`>zBUxj(LoL8ymm|K=>Gj=lFdD<&%62x3`{rj0t?g?z2%cEp
z;+IImEt5wVwNYm(_^#WjUj)NJ?b;tqU0`TBBec<*sgR=VdN^Gn@nTRFR9}FFc$HYY
zxFed8=LYwHCb$_{;;G|Yh+y|@d9X*;3A4;0KIxneBhI%vnLYS36p(b#kFYU_hGWsu
zz~68n785y<8sKka98LqS55sBU^-(x&8GR5=Q)coQyc-rd1n-6=9D#G;$s2&vAk@d-
z)bM%3FFN*u@hD^LQBDLuq(sKvdX7BID6J30^*r&IQ(hmM>yspA4jz5Du1^x88F(fS
z;q}=i?aXz_fu2)WmN=fdu5dc!)Rrx^r>$@5X_J9apEm1xGCZ$*-ZWaDUd~^1J-$|C
zGc3w1Re<Oczouf6Ot~vUsk6iO>D(RoQufS^N9q3aW8!C__l9Wf+#MA;(C-XP-?wIF
zk?JzfqNfw{7N;w~xr<LIH(`wHqfB9;b!pN_FGj(`TJsm<#V^r4)$PofGDo<1_4%Gq
z8UMC|JE2pj{zO=SHUxLV6b|(Hxs{wWbK{E4nt4ZpSkQ>qbK?+GZ|?G9?%lEcTy2;r
z`t$KkH?g%@P0Qq@S)HR1q^w8b$}4}))6Qg_v#pA0R7}U6Ng6;zI%c}%=vwFFEc+4R
z@Pa_5cF94|X%0CkBikJZWv4jf5b3F|IKnb<bBbi0jp>XjcABqG-=sQp`L@_6P`{$#
z*8tyaZzo;Y+^?g+!>99k20VOvcUORiPYVye{~mn*&FcG)hK>GtaQ64$?C*P(h40^|
zHB6+=AP-fExg=sf6%(ame(_l(V@5Ny{*6O~&6(7QG$g7q6Pu7)T9|mjEZOXgM)U-3
zG}<gJ0?78!5nF_R2((05d}Q!!bjh(OF@=DM*@pv;N~1?ZS=3GQEtrOFac?IBEsXrv
zZG~J8TJ#JrEvq}%*OBz^WlaFGrd$=Sum8$*AzJ%ivodI-I!)@_$Lb)5zc%>uM*cP*
z_%jdt?aWbsuVX$o;{S7`)IBeSy|LrDgF$uRx+8zSRWX9%?wf@Ox`%zk!@gnWeM5W%
zJ!~N!wh%blLKk&F9`CWCf7$uwCoijW?lxBM;pAoYL4rO=(AiI3Rv*OXgV_8QCokVX
z7S43?k|PfvPF@~PULH<f@=sp=+;!pM<mKVy<@=FR1>xT7o>#;<7sPwm8$4_c9<~Ov
zZw(%H1`j)fZ?QADcR4uIzTjb7@ck{g58Hyj%eLTQSMaba`0w2naJR|Xwz=ejDc?4i
zK&H0MCFnHUT*}C{&86%V+gy>JYMUG8W!UCwbxvtL+dkPkX-^$&Q801jxmj=61tADA
zH470qjf0q;%|Oge;U7;<WuGdM!M(6Poq6bB0v(rHAishOx2t)gOJ*I^w~F}#5G$z;
z?DMg6h4Bq1a?wz*Gx0Mlmc`i+BA>@0Tn4vwfK0x}u;fPb#8GT_j7dx)cLs6TseC5H
z3nksp#UWByw0C;&u63}pS*#8OOx*3^54hqKvk>YYNV)e?jIPZV|A!UZ1k6GPp!aWb
zB)ZPB(1ng<o^dg#QJ7Ii3p<+9nD``#4|cUKm=gw;KAD7r*9*(+TI4ZS!GhH3y3|)u
zFF7347`jg1vj)1q9IdEwl_Q{4mVsG3Y7xEZ@C^}rF2#LLTG@o}oXJitD4;DY!knYV
zTh>rsD<)10WH~u}jc$QN?{Idi9@0n9eEyCBk)gU3dn3f1>i{{kT$V><Xr&>T8Yw$x
zAW1nk5G}dHMV)7pG@k-}Rl}HZeW-XZT0Nv6O8?2GbHm<%!Y1D#F?zg)kEAi8DGw-X
zIuu*fBj3gt#)?98%NSPV1k&zbpex7#!=YYSa!WvHV2L%c3M_m+wg&+Q33IxfQ8p+s
zrq>^1m`bhcD|bBTGC!~f17?m!gBux492>$6&|L>(AO9<$6J@BWxLqtfg2vjt0udMO
z*>Ytgwv!PACc*9;Lp*<==;6dCKz_@};(VN?kH7f>q2)IwHSR_}cqFE)l5N=~5)w{3
zijjgRb|8bTo#hCIPf1ZO{g@>Jl6sUfmF(1letf6R5KFU8M{1L9lWS+1zNszd2#}-b
z9~~d=hRae?<Da~BlA3G3)0s|f1;CkgRw$FFutN4^Z54oWR8`8&)l((JoirdtDRdzh
zFaj?1ePN1bG_P8er4!Aq5ZzrHnpzc-J(r;er3|ptc`~0iWSsJbzK&`()RDRBP<FvQ
zeF(CRM9FWc5aG0a(1vExhLRndsS%}v-lJBOI$YA#qIA%|t6r4anjFO_6Fyrr$|#bj
z8qs|E9u$hnf^@RVktIh{^$nDV(<&P%6Vf$}$z<p2A=4=#GixAu>c?c=BS-O=pmp3`
z<(N(1xaWsUP{JMBLAB?ZL+Buv)`2-+Fs0(Uho?-bcpuDe9?WiLf76sTlpbtx9&B+6
zsrN#-T)`;uY{$1delh<}j#kgqr88^g5KHD13rEhimIE6uR_@vukp_h{qNh-)m14>r
z+ALa~lKb4H^VqYxs(wtCBxbG`x#c2j!|a-7l2b9&G7TWEOXl7n#tx(QzX!E(@(7&l
zQt8Xk9AQLVb71)$D@B9MsbPQXs11T+Yp>bfP6?F~8_nX3!T?zg(tf6jj+-Z2t(5Qu
zSi=SGQMx|AQqK?0;GcV+qX8KxB_jv}hfeGts6Nc23PoROiOFfKGLvoApb)_5S|blO
z(}9(8?Ka1%u%qMvFo=;0G&8VWNA1|LQfB*1uQxh#=0u^^ov?dWijiGIBqNPukT;tT
zv37<HMCK->hldKe8xVw;dh>z6X&Vnr&)#%kZpwy(C#P;UR91!wL|EUHoZD^f?agXF
zGUf*)x!mJ0Q}d65r*UwsHuLE`<oPLFlo_df)JpNj&cC1HsLHDqoC#bN#VV%QJ!O<k
z9y)TRaeRjp#{1CLABiJp_OpNE*YSi7@?OT0M<(dh$>hLBr=IcDvF#=k`C5(X@$JEa
zU|5;XBbO>G%WS1G!#*MNluqZbek2!3|CZ-(a~-ki)FqUjcqR>|$l|X<+)g#WQXM|(
z^K(j>b9!>Tm8CRfOPy;GrZHFS2%xFuj(|@SJlA1twRFx1fE3ZAa#CfFUM@q7N9vxE
ztM9YoxaG5z#6{JGb^g+J#}iB|3D{7;Q?of%E{)wWkZiWc08`kXfJp6zG^mX3NTqGc
zZrR@2e%mw-U+=YkX&s)<Y^phMCwQU-fT_CyVAEI+$=U3N%oG+=YARbLd<H93T~o4e
z?=Z_Z>|NIEFfRSr$8^IGcT&dK@hs?Vq;=-?d=9KxYdzj*q!j+^7JpiDd#=l9@vX2g
zfH$>$cx`r@T)Mv$78am5<}Tdc+mfBZrsNu)1^AsV>KWu_tnxX~S<8M#k=r!OhMd{i
zIyh+_A8hRzrw7MP5OiCw_nPU$BI6`%R@~+}MU_qw2j4;%^m_i_9;HAM-89o5OMMqg
zf6z^+>v$mAkM9B~F;#y@A%KPg-X#pPC|}Ae*DEhjI4n?j?OwU~kM5aMTn5;0Co-_&
zd|5#de*+<bbWR~1B-k`!0b%Es2fMrNy}ei$50V$j)1r!Dnj29RPpVA1M?rEg;$wQD
zfhU)EJogt%48~GqMl?}Ljb!p<x$&n;iwIAXq9U68oyv&_kr_fF0mCIk^r9mLG*v*%
zA|f&b!wjM!T_8*^5>f<#W`-Pp+Ouss_?QQ!NS9tEx#NHj$)^>DwuI4Dt&;MvC-3Rh
zpl|#>Hl1KR%zHEyLQVBtDg@tPdvA>YJKZ`s*^;k{!p!jYDTH~-))FW5@nY<U*ag>Q
zt5R9R={}32Qx>KZ*o5H)C-4YCrezSq5_gWa-ZVAdV7ks2p53(qs}m$RBl7v25HN}>
zv#%=(UFM=8AhK2j$%DDpf{>vY644h{7EmiTFM2N)sco~d`mGdDP21!qpzm4-PggY%
zv;cIkI0(@YW{n*iRwJH67NRMuRGK{stve)8H|Y0n3$`Iky^TVQ2+V8$+CFLSgLv6J
zWWLSe-&jHW#t*Dv%jvo0$G%<J5Oywz69=YU>s}oJ<J$Hg)`p-v3UT8jTgpazo4UK*
z`d72EA=^Pj_E=ehZ?b9w_vZ^@@oVt<ZlgHUg{eSNfv#$7@b>p`$#qATQ!c7L1DOYF
zZSkro+Je>hu;zo)y}iu3dt$BbLD7G7ak1u=ahP6b;QCg%SJ{}`4#*ojIZL@5o}c8X
zluh{*UDGAp*x|ye8(Y+uYGQ5oteQfz#QH<mL2T^&oc^RN>bTnH8qb_tp!TIL{dZaZ
zr4UPB__bV;9?>)Ys2sUXiuzDs#zEtl1f;~FxU1_8Q!N~bg-KBxe~*w@uRDCbMq%s?
z5d%p5u|;P8O1$bT^n_LCV%)c;Sa~Gaw5yMV-w4N`OxjFA8ybqFfG1X^FA1QeO^W=;
zVpWS3>#z~&)Q1+Zt>;EyFGl`nK93?WZ1rWmYhBiz@nFEdN-I|S^gU~YNK3!H6*OST
z!SxRx)+ut~`p1uFPd=<vf5Jau+UM7cr5Gaf>N6{SAxXj(S8q$73Od=?S|l!Iq~a&Z
zt;UMTy1GCMLfMZ3N3|cY2B7G=iUMkSaj{&+FRad1E0v<kOzXUIIg!equtr#n-pP;z
zw7GtmXwg*tm#llWq4dq^CSujpSY1r7w>lsOg-8?$@tKDm&8WH9)vUbwTN=g+8;*gn
zbBn=f8dxTLkCl;CRT2|*Dsl1l^i7kCjFj4y_?V<=8c0vp<(RH3a==-%PF_Oko(8V&
z?U)A2Vd8qI0+o_XUW{b4<<jzeG~dZ-g#ej~egVsuZ?ULEumFayeCC&a6O;R_7XMO}
zfBX2wtoGnL%=*=rj~lEJ%9F^XfZ<iOerGGu*)2%WDS%}SiGp?3bKT(fm*#Q1b$GyM
zp3<`>6EDhTkrgEjhTTeBu*T;`tSXQJFt~7?;*Y0(9-9Aly_dD0L9Ei>^KrjtU%#yW
z?0DAY%WD7UzTJI^+fCV`*e+9v6E0Br!B$+x7q34FHy39>kneSfM`uO$_%Z8rV~HCu
zVo(vjtd302w_r%weif}@yH@qe^*&bv&$9Fd;1icofj72N)|u!BSL2Zx&>JpLzDqPD
zYTCc0lr)iXmX5U)hfG5>BeqPk=Atc&z&Q%>l96?)EV@?fMA@-=67SZo<##;$9D8-(
z!nU$nHP6qXuQ%6L;5&^;R6|4;-4-jU)2bE>M@4-IBt~5Nyv5J(G819e{N*1Y)BLP{
zi!mQxRAKWl<i1=|tB6^~{y^GKveu;Ori7I2OhV3KxVdlpbnq*XK??@fGQE`?(-k_t
z$n0B=<(YxSY!J^KU_pQ-&fWgl4@E*$-@iw+%D|IjUa7(Vsw>t0%9NjMsjOsjXT%b0
zWr-q6zfnPcg+%4bX-XZR5}*dj+RabY7Ss`<*|)F?1Rg8a`c)W;3>Srn3fe#wG>H@C
z_S`sEQ*rV&U~Z&OQ<36&GB?V#RFtqZ&5iLHVw4}<H2d5Z>gveqxV_$Vw^8(V{pjTF
zadRu(VM6@L{wTPBK|jZveN{02XkTQ^@oHZyIq$Q5(e$);`*DRtH2|-ghFnx6H^%Zw
z|4ec%^3-0oiiC@JXD`wwJkrl8nfFRx7K;}DhR^gxMGsH)XM3t2>)y<F`YCYt_((r}
zw4}e%&w%~AKGRQcPR=|1>;l;j^|Q+4ztk7dh40|ml>nSi_yGqz)4Rcb#b;3TMlXlk
z2@yE4e3l^eEz|2<+?NdGFQhoixD<Slc7K_)6WR<6652zT<hi9f(*1)^UjQg-`x8h3
zX&_#Yde-k_+q1e6U0gs^2ck43%H>X^F%l)IBSSp>B0^>m$EjnMgdY%dUm})MHS;v#
zn@*sC6r$NNL>H6vma26mdlg7!_g&V3R7x_IfJ|5tK4Q$|!D?rZ9GWzI$JO{8%id(M
zQOdr4l`@;dNTn-F&4rOF^|L%Zmmk7kdFIIQZ-zcy!N?!CahY8Z?-@lhnZ@I1;}01J
zP(~yrwj13+uj9<V*$~CzTMbH{W22$U&AZLm+1uSd&^H;emc*ap5>KLUad}e4V_X3r
zBkyiYG2!H!i0)v*vKxWT+iP?OoYrr+yXX!cHWsrjwY>K-SJ*K79=8#4Af#^`RPNt(
zs~{VYvpLW~vbO^vR6_O$u};AdXpTnTj&rdpUXN>!kWz9}{1ApvX;1AZoha?>wSV2u
zaEo;Z>tVU9m;nf#&uC6KtLg9r3|UrU(PH1jQv-Dxm1dF^Yo+!WIPL2_z7LL8oHPcG
z<$tHvz)>nQtb&q2+4jIu*x3z&BS)26C%cEo|NM57%eMl@99o7my2}L1!7^!*g+>21
z6HRMvm^A2>E6c1X^RV9HH<)W--P!X^gZa+qTuAAJc^3toJoiHQJI=p$^W<P_ziAvC
z<#?FZ59fA_<7V^V<aq1gBu1f(bu^O?K2e5TcFFP?KKIf<(_JOq+i6{A;DRpIw*qu$
zG5cX%r1*rhx(MvUQQcp+e~5HM_C6vBHvK`J7yL&Y)kRqFr<~MHoFtPD>LwsaJ*SH{
z^DjK6%aKO$Q@R9b_90ya^qZd1#of^f*O;DpV~o7M<y;zg=r%$}w8<qcLRe-)(PW@H
z@B)1nwPC&6nbrd>zwI77u)yYwf_rwy+r5Fs+|Kh_Ke_PT9qtN5@m2l7!|sEJ-H9G{
z!?B}(9$f1F_qx=*$2;=}E&M?Xf6&4owD1Ql{NA+itc5IHSH3O&z1Je?gW(QJyWTzJ
z?Y+b8e;WIT2Ztwz2d!;%i+$W~E;CqMW<O(|7j@RbGsib{9gxM2jj_Y={m%Dr_$+<G
zCfvRFfj9014D<bw)nS1Ts_MdYjCmaR_jnAQ&b;JNbOzjadK{fjZN`ywHgJ{`sq_-F
zx{{(}>GWP^jeGV0mpin+#XP>l1pXdouI5YQo6Kf8jX^(TKZxhaW#j0u-FmMN1}s#;
zl`TDs{mfPhj~Lf=vtWb`SlxCm&4JyOO6NBcAQL6W-$Z0gCo5(U689k;?p-VlVI~>o
zx$h3ffo0G@om~!0Mv^u0lO?~0xsO!UiL}fapVs92Ta%O6ld~!X<~yBONlG*3RyttT
z^h!d{HN*C|w%;0CuiJ-vrzcJ0q_v;1_GY@TM%P8=q(~bAXlggs0zS=^waChLXDt9y
zTw1G~RJYc8ZiZ{?NZpOtqxTta9q#o$;T^4j^Ia$KvUk5t;CLP`6CN%TX1+{NL+9Zx
z;o&afPO?!*=y_uGWEIU)-sGD09cXMAR7a2#-Li$-xa6iyG`Ib0+qm-Vz*=Uj%dB`|
z4F+y;nLWEleNL{d2_;Tue5ab5TJBTTH7!?~@BQ~2uqKQ;BC630wuz_hrU656dn+wS
znL5bLe{SSkov~-(QG?}N#zFu_va(_UM$2ae1=N9((E+2mDbZ1qU^7KYA!WVY+{O-i
z(>!S&{E{9tWdf&A6k+w9(KyB^JtvD#k<uA#(qNKYiezRoDOSylJlcK>;}ux6eRMiM
zi(rFd_5iyb+@$eI&(3951Wz8vG{6kDMIiEd7prw12DY0gTf4ihgVxEf^KjAjfrfG4
z?nb#6CTDO>E0@kK1(4v9mXpPu2=>{y(rN=oPT#ar+{{eoh9P|9$Y-Sk%XG%0C~Goc
zGWe8*F`a4Y&<PG^fn~8Xn}`{L%+eoWo4&o*+&VZ-HB8TXs++|&dW_q#j9?H(2b<7I
z($s!94y<bfXOGe0$UEn;zRCs7>au+N89kR*DA|Ge(3$->iL&Xt^Yo<o-ax5gY`;z(
zBu(zdk!Rr>qwu%u^9M@#hfo9a570tg%*u_VCc&nUrzT6JMpcuUIkD9wNLqxoFfTpM
zT9}{gxI~kZDxnU|Cqo?gjsb{w0V(dF5N(yX9~vO>P{OWP=R=EonR5d_fIf%)l|N2y
z*6#sb=(jG7#hL+6YWJl1(#>FVgM8^CfO&3<w1nfbxf$xX8WW_|mhfu8o%Xp78@e!0
zU38d_`&HQK4MzhDt+J9~p6?T{U~wt~Q^SYGW=TeX?71K8?rr_+SA#D4QdW)3ARp3K
zB7Yn%4nx;9?g+2q=ay(`x0V&>BRS1r%}JSHf*o=}vIcntS27AFgow7jr3~9NO6IfD
zJlShcFvJ9i$Wh7tL>j^vgwmgf6R_)z)HBL!Xye-I{BZ^H4lKXXIpnuIWsHrOyB;N`
zjJRY}_q-uDjiV7Yp<x_FBgEX{IB>hsV6bcq?T$b5d0=MQOf!x~!w?0&i$lQxmdQZG
zQekDoXrJtC8^TShVX&8*Y;~p4Xsqs4&~0#Ng~0(24vnpo!~NEF+b}9ow7ij82o^3^
zw*<3LZkm@SXO=RzNSU=`NPE6!1Z-&p1Ew7QtgLKA0dRhcNF$f-0M@C2CHlrd7=zr(
z^RgzQngmoC#VYWilz{D70p6^3yJd5kU02u>6grw*@h}X^EW%}y0ZBM)QjABm%<uG+
zR3kCVXe0`eX)qFk&3cs$b5)Mk3>%R<2oW^4Hw0yKOOwe+@*;(bq4}3fm#pwfI6uXl
z#h<W)3MVWk+)y;o!~}bMy^OHSkjHz^IBxE3y>ISR!lEWn<{>ohkRuaO%h?pcjP5Od
zXq4gU5kzA!-|6&BQkoM*Gzpj&M>GmO>zsudA$$EBPhJ1Ux$DHuMv*sdvDDvY(w^hV
zizQ|nZ?T-JPFGFW##B?YtRsV3NW&;cC+t05FvfYEK3^jc-|=kK>CBm{aj?9Zs>9AR
zPuss9e8X9~V|rIGIuF}igIt=!26GaMtXb;%oGagh!alIiKU<ztmyL*C<->%-hjxBm
z_}r(fs4G8R<r8~hL8-wqZwWF{*M1Ct5kOY8)$KlAEjO02@QBCPl{mTn{d_GACs(E+
zljD587Q^{`jc`K#{l@H-y_THkD(5?$-;%zJd97z>&1VTS>pX^jp$VLRfps@4>h7iO
zTk{y*WEIV}m?rq|VY;Hx&2VTs83xk4U7Eu>{QtcgNmC7JmeD-pJDmZ7yi6Ntm78t&
zOdxYwJMa9`YB!Tp;68>wjM-&|H5j|c&F1`bAs0{H#4viE^>>{bVSDd)iV#oICkfB`
zj;9F`m@`pSezyBK1vb0axTDkKH)_UE*QDRD%r--DsQDC9>%#Q|qca)<7z_^k`HSaY
zuU|Yjp08EZX|@i^!Ir8^RbbutdMSjumv&5rYNxpi-8BK%0wUSiP&h5$4Be!Nbdh%F
z*GqAMv2%EEa?ot<+=uYVz?Cb2x~>yAmeu_`3nA6+dlp2JHyOf6Wq;2CNfMbSlysO0
zf=PnjRXE8m%knCF&vWd<!O6#+)BU6SnPnN+CeE|&c=%m-n7zw9qjqmh024s>J{ggL
zIg^pHzxT<AL{6HF5@w3Yh@i7iMtvG$XZ<PD@Wa93M;ZC~J|<!gzO1PjT>PykplWUY
z1Uxv@0PkxO0_&1f4->!B2?wNQOf!+gCs(R&3-p=ZP$;aV0Mhs5Gz3(0I(L>c5PK?P
z_EFWOcZv|=$@=-Z(oZsOJP{$R+!9AmKg7wL#iS)M9Rrt}>$0b-)pI+L*AHLJZg<%q
zpWo6I1YJgyD^twwS<q!a?{Ye17i8i+2EhAQ=Ezw4>n1##^^;}_l6Ds~BhsG3J-Xq&
z0Dmxmmjl~}`$t>HO=Ig|$7sLXIx^N~$NgpYB8=N`L=V2_!6JqTj1X;b;4%3!TU)K%
z2`7xW1kT1hDC1^cQ+ysN3&<IZagQn!I~f;BVK}sm=B233tLZmSz4z*yC1Vb!Jw!|g
z{7zS+401CcDrQ1wtArVaW>}w$-NWPU?17V|Bi_q0@_g-Hmys#Z&9;oZcvwcJTt;5}
znafD@u5%tN8OzA?wfkR25a)l$GV<c@xQx7*b{To`_gY3?%(RTWm}ePzabL^Gi>zg2
z&f|t2jaK3F*ys%YnDFKy0-Lo2Xdr)`*uSH|o=>LYXYBZPALg}gZZ^*+G$YmcS-ze_
z0M0J|?xFPq7lzEYV8LKc9^993)JRDRL_PC66@r<QT?xJzM3!BG1~!*%!t2x4-bw4g
z*xvis{hR0r`#9G(#!k<)J$jI5+`-ar5~gf}JH6cZaD3|ebtENfZMVhWuh;`SxY;*5
zo||rWhc9dPx6roAc(0z;>_aCWH~;Unb==%xKeNV4V|8T(V7W3>jB)_Eh7V@M6GZeg
zzreMvg%}|Hv&o>U(}Ufu)-gSLq_@@^aaj7N{22eOBs0fOH2a>lrD$zwCVG+l?^G;A
zsmwIjivwjF?dg!So9^j-{>`MrVY@xDojaM|rXt9e1wMd(4>I5mrnkJ!d)f>|Gube8
zFEZD{^wa1pyuaCpJWZQ*l>Xh$Hl!|dmdVWQ*@Y0Z&#LxO>mXw`WxAU9!*#5x@<)*G
zZvtTr1v|CViD<Dj&l6FIZ1)pUxRmGPae$~J3Z2uTp9Azf>lP<fB`^uul=4tGS|H`k
zaI*FvQmRkB?a%5ekV&pHxCxh9_$ee;%G>_jq4Tf9gOq!=To)ziRmC<3RhT`UYB2Eg
zM~;BTxz@oa)l-k1c)_&M6NkwjKXJ&E5tIZ;b!L(ZmNGcRP3Qn*hugIV`kbzsLKwkE
z8%J@>DI+PTCr|d;#{S_>bC2F92A+M6?v#ykS&>jaE9!lBR;*Mi@tzlLovNO6d86}y
zd|?QmJPCgzp`(m2i?bzmRU1<{!VB9}Xdyro*SfildcC#%&o{@1rw2R2gVX)L4eG<v
z++o}s5W8^Q&ok>L6EI}H-@{_k4G|Xm9`qDH=t2(ZAtH<x*=v-SVDzGuFA-W1MjWHS
z1I0pzTOvTMO_j25|6v)h{eVBIz%T|iXoYy0MGGd+mlP;!M0*=to|mJwGoBquEb}vM
z4jidnLF=hyB4$-9qxgVt4v_~sZ_1o0_oZzm21&}x!vx58s)Hp6&3b#72ABExFb<rm
zr0L~C6VK!3ZtH#0tyTVG#l6;R<yG$O;bE#*pd2@3+USXl%Gjt2eMQ}aY_p&qyYJjd
zx@F^-Am2p6?_I(P$)!`PWEUl&gQ`0Sr3m6sEa}PR#`9(N<NXT{y^c)r5dr$X1&B^+
zz6gm!P7oqG_@5(2@Mr7I!CZnQ+PZs@7eXcUnb|c*0c;%@Ic&6McWN*trYzYJ^%p5|
z7|wTL4l9UDH&cjEj`}{z5BRf@numIS`7wU2qyxZi3{QqQ%rZL?eoVO=%&ncRqm$Mz
zP2=Dwqj(ou=D9bjiu;l*nf;TLFWI2qsg%hiI78Ot!e>dG%tCYB>|_p$^u6F;8AxWw
zcyn-Sv=2{@x0_SQkqH>?9#lrhR(J?4^AK8Q*3dGs0i=H(0?a%Fn0W}k^&lbt%O&JP
z@T~{g_|0VF1r094b&M<1a{zcgF_}PfcZr!m`5-(Wgy+n{Gi?+-$k7Kmdbc2kfyalH
zCq}FfFs8?@?BIg+oiX#>F+NM0Il|#Qcrzb1DP)E~W*{;Hkr{x@;K;s*6G5QUaib<(
z_>?J`G_cR(X&471{V0)Gw{$-4^(?$CDD&SHanoFGtgO(fA5Z4iDVtgsl$))CU$*v^
z8ON~9WPuS>8T87<fB0ukahb=qzt3Qd)Ad`*<CZB4ey8V#Q<9(c_+|Ri{7mt`B@|@J
zlb`8WHS0-g`{cNJe0+Fp!2g;jr^g3vWBcvavGJ~T@>V<JNk3AZ?<EjOgmc#&fB*_E
zgg|n=p^p#KwtxC*!qcGq!bz#hBZXa9X4mozQP{ZnPTq+|q$F?F%Qyso(21Ebb)iVZ
zVV$z1xx0AmSBxRymguR7i3=H+DQ_;+)1zIPf!4qqXW_)G`6#85KWwtb6qp+`5NjAT
z)UdcgEjIA2o}ewGuG}(HH7}Y7GGp8cm=9{J@fwGTzs?#P;(Gvdg!vn>BDAiWAE?#n
zPMrM@{I|}kjgK2Cfaf20XQDIme8|p+{KieLtNWph2r6u)_6)&^#H<o9{o0lVbEA91
z+#VwhW8}Gg&m58%DOn{xA(Qp=K9q?;SkVer#G9B)Tb~$~nsxC3%_dy5hajw}K(++(
zYe5{qa>hgGz<)DA$udK0c&u-k4P+u)5-CHG2MMdsp0nE|UrsJ8U;!voS0qzSd*CBW
zVndR#w@1v}e)6Qgb<l3HZT9-<PmPt=Y^%2NtoG~~`><nm*vcAPU0Hehv6kQ@A7ajj
zVQO<-*<1(tI|N$g?++^<^Eo~GP;G$ZRb9k>hW{QvW<2#=OUxM>+h)+YU?%8@ee`~5
zI?&ka>3e9UJS2g^0plmZlZzl2t=H@QPNxP-Zq4=j_2B@2R!4}^^6SWtYGbuN^!qET
zPgkDSE`niPaw|Lo+Yfw&$@DrG_N7(F5_KT0ifZ0Cfc`<O&#H|EVO?oFZ=_*O?}FdO
zc-TnGTpD5a<KNSxf2j|xFcw1kF*Jza>n8g>J^6=32Jrsa>Tw?s)}`g$fHdn2Kn`><
zU<r<26`N2USGl9W9@>9U6g@v>(#qHfKbY(Z`{5k_>EJ(I{Kvw7diYNt|GB__Z2aek
zf8)QO>1(oo=mS|p{Kvt6T>NK*|NKthexGIUkazr%uAu1qgbaw;Hw5>i_otJSQ1G+C
z<k3eoZY&ynMB>Kc2vzZ6G1rhuh+Ak*J}w|85S9`iRxc9^16!CJIE_pUjMs;Ud!QP~
zz-dwCJfn?JnX0Q$Nb26)W5dY~;x^u9*>)ptNVNMndWNRcMO&z3A`^_L|J&j_<T}h`
z%X7>@eKbBF*chZ@c<v5hVYvn--3MCFzBB_%;We*5e+#_Ezpdc@aC25T=Fsv-X2+^s
z+$Y+xbKi)`;1UF*@8k2hyP%X`4A6c8mvi-g5PBB2`ks(Met&Sk$nLMHge5X1`IL|1
z5ov6()9YV!J>Lj0V0NTf4;F!FAxfbl?l>5Y11iOMX3Y=G;fS5vj-sT>b0TRq|3dtR
zF78o{B;62{wy_}F&ZKYy?GLsQJqk49g9hYZSOeG=bUb?$h#fT+@lkjQk?*4d&FdX|
z7N9`c=QD5Y;6twf@%cA?U=5k?VzC<x@`@2&{R>*y&#mCf0;#K`;1vP^Vv9`ah|*tX
zzGa1JC7;%RsHiI1UL^u+fTR`3Ez#JwdgB3-<MI<(q6d|QR*%`V@CBgT_^L%W?wEC5
zrxXC1E7J*3?f7h2qh-n&nl}JBbT2IiTLr5N80-LQ1mLh|g0Xn_HZpH~G<LKcqB9^S
za5f4?_XsOKN&`H|K**_9J&P7T**+-eS;$n?c3$HrzQ|b4rO|WU66i^ujR(j+EBjV}
z1OnHrpu(<f=t*EZknMSPw+k%4!WHNd8@N2Qb0GVES@3CziZ01I2){%FvWL6a07$?Q
z?iff>^J@jQC_aj9DXvV~b6t6Mz-yJ<7}_u-oG#MtSXZcF;G`1>mjTcDIAB*6`|P+^
zh{18$mFs;rJ$LMM`RK&KMv;@38Qx(cBbI3tS-qa!v7rxeWVGF7!h=l-`6WgHMQj$;
zBk<`U@a$_Ct@sF#sJ7@h3D$E|q-cnmFjSB!FrIDbH+<yCzYK1WZiIoteAZmpeVmX1
zHZ3+1#tzWoBWawwa<Bl6KuQ^{nV~<SGcIvY=&(;^>e<zoj~nbO)X-&Bhn4*LZ)fEX
zX7!J)>c5PS;>$|)C*$MNS!J`fR6lFfN2O02Fv3Z(#fOX>>0tA0agn3vXT#`Ml_w0a
zzDH$BULp<98QiL902-jD0RkwFo2AP1_hRq1jt^P~Z`K7{WbY{CYO0#DlaiVxp`R1e
z>c(vtML>%okl8{5IN#cB!@tCn3X~2rUvIVF8e7M2et~TI&QD7#oaX}FW~2x)E0Vpz
zXR!PoComS=0K}GsI}d$m=$(l~ekubh(nmH+thB)t=%=(^R<LJGbvVc!C{%*lEG}Yy
zAG-m{WlxNH6!sW$j?(>g0373UT>7bS_~Uawu!AudaC9?v1|Rge<HEOPF>$&oPvq1D
z1~KB#3JXQQUaFU{aH&-9Z(uYCoCYut3~X}8Gt7ZA9)6_p7*9KcX#t=${8B$VYit6d
z)lz*VkI=&INwl9gFKjmq0uTbfk8N7nZrIUbyY-%!(RF!*Ud5AGBZ~FkrlECHCrkCa
z=wcs4UZFxi5NnA8)_)6^i26AmJM(l{_Xd`j>1<v5&IQPCn<OugFCV_#egy7R7VGl8
z^jSlH8qL0bWsmC;tEwP@2QdJ9vH0fM>a8fT4h2eLk3(}6H&9)>*Mo}aH)%md7Ah<+
z>s{-z?u<cv<EWL}whb10KwrIzqR?KUXuCnZ4tj{Iu<He8xZ59(x+X1coZ3hQ>9Q)n
z#Pbbl3LvTe0XOwg?m!ptHeaN+c|l%I2o6SIq%_gb<hi&Afg(Z=Pg#~grv1-4%m|ok
z!%Ke3Akjy#FD|mjk3*<<UbGpyD5Uu|2|G@M1x-+s4*~H<HE8OtBW+Q3#@NBto)(R%
zdvYcOykq$bC3#RI=RiRY&yi>K>}xurI6(gg_`H^qHgQ1^#~TJu0$pPdrsL53Y%%M4
zM2Zi-&*!-{g;Pt6AlA}1ON(Flx7$*ou+!XaZ&r8cXoBBU8gFUmGO*9x^MCuB^gU3&
zPB#leRk3m4tTSNo>%-Uo+eWQJKZmiY{&lPz7i8O^E1XBHQDetk#YP1P-y}LdtP*@l
zSUkm<U=HxH$PM5Jb$c+dx;1_n#y1a}pa-2To}Sg}wfY8pt+|VJ@#XyA@U_H&?afco
zLn$DLt5Wof<0^h4npSJ<$g@UxZ^v7+(>jJd#5)u|V=O`z9p*T2u>)RiHfoKP5Ry>9
zM=H=LH-&!3bw$^^L5&<XI)YaW&*eI}4T3cCb4D#BzZ>R==m>j&71`P17ggIWwFMZU
z9q<*?N(Xu6izPrXa7zW!Dg;?H?nJ3VVecf89H<QVtTT13ZM09ePEOmKwR&WWbX&xM
zLrS%QR}Gshv>k@E$l-fm!#6K2LaimnV8o6&Okj(VN{cgGM8lAxsT;$PG23&%ac%=t
zq-nJ8j)Ky`VjJ&>zmf*2!8Zzzeqf93x6QphnAdMC$MVd8s};O{+?^bcop9gAH;F_P
zpEsQ`=p{~|_Kb8$j>Wds={X%M;N4eu+~LU826I_%oN+35t@ClekEV8ybO@WaXrfOC
zZXYKm>}{-Ty1FP7sMsdI?!`{>4Y99{r1?OL6Nsb&H5s-dYUtqaD(A#)0puE}IgIm#
z^G+PsCOCVR!`er%#ZG?MqeqyvzXsdA7I!})t`=${E2|W+<uz<!@u2;+3+k#xHxy75
zq<>-ObZc)LXxRi^MbIyk*dt=^{y*EW#Z*Vfs1PoG`4{XMgnK)oZecuUYd9WY2m2S5
zEKLa4J_Q9o4o>&>w)b~7*GUM05UZ}$R@tTHp-iO%oPR-syR@GMje9h(0~*$#mM?y3
zJSi@|D&E4D`NHm85C)s?mOT?h7K}M)FANp4Z-F%2v3*+b_@IQ5NGBBxpNoTTT<x=x
z!dTiY;olOetARTT*ukOkX7BK|(LR0MJ_*e#Kog;@E~~n@Pf=|Sw<}8{*SD`>@3hVp
zVS;6ps8kA-8x6@po1D#3p(IBZB@~cNwnJPnxf@Y#l?HR(^zj6&?G9i|>9ZeMee8R6
zJYwTEWVM2j6PvUl`4c`RRihM9lm5<JKoz9ngI9DW`;2EIbU-MaaMIZlUYBwo0<eeW
z98p*6FrEb4)Nu|hnJ)e{{Xp38e5U(mb`EUD<EuaXi_le5^$(aAw38O|Vo{qT(#H-?
z60Tyr|3n0^Dtd%cYrrS6fqE~079(Rysr;%FH58>V-EhJjhq5RpW3=KP`-gw0Y7xPi
zlU6O}loB4p-hV37XdHLW>$FsXAc6nOI-|3P)1zg_+<Q@dXd<y$q63Kp=Hg<5A1D+{
zkupGI9JZvZ<0-gd?s>?ZMiG?7;(NIrk0aKK2z}r5`kRXlc_1PVIlO-K6sjo5#QlV<
z34o$?2^iQ;AkI&5xY`m2P^5i|9K)#ZS?E!(3}6s-nWTnF@CJsWM{8%Cr!XI?9nB7n
zfFwYvAU8cxR05G2Rxu<|6x@{>9@oOkPp;d{!4;lgdv^aKh<Hpp+B$h_w3|m;$6F_d
z$6|T<LGzRbl}2G`^(kW-3=a^O8~9IYgY8n%BL2I<IC<-dl?^8~_Xn+ESf2^Q*RP_B
zVq}#zkaxGz0by&m4gbEgxHo({`C4YMiKCr|V_h*+8kZRv3|Sr9w+1)->=~9$G7R~@
zu}h-N_W4=9M|v3mU!p38*9EQzBF=M%q#_K&nX`G0a**n)LUpL6m0LXqDvUt{zuVgT
zC%Zyy9op^i-3A^#((&Ljs$Ey^cz{RGd<n+I94}MUat_KJx=z5aSPqRWhNIwypRm^|
z1xVa1vSM*T4p1n)YeTcIU=HJ{w1+GF9yz<=hu5IsT%h#1vgCOxp2~;&8Q&V29=ZXf
zMR9lo-0E%ecwLJte2&u6{Ne1Z{&9&_SO^9AB5D^V;x@oQ`WE4z4MyLh{m3_*z5$gZ
zV#+Ph5jO#AI3OupOn3>>toYYWelW)&JOxo-T#-PMK$U^%=b&|emgldD8l!p#4X>`<
zrPG2QG8i-{z<Fu;%b-H~q>rCNAKoBisn7A|2lS^;FuJ!7_xHCBc1nQ8cDPc;<sR=L
zLJD1bj(0A2F`{)<En)>BTS8lKeF0KEfO8^t<`kAnF&_?d*O{<c?3j*fCC}Or0DnM$
zzZY42w+ziX_uaub5O*MWX-o(4B+6h+H-uC=r9<%Wx`yT)G+7+1(rh(pta65c1VaNZ
z9~9<VzlH(f9^oXcKCP{=(|4@{R9`AEoL|GN6F9U&z%)`oR%<I<t7b*mMR0<OIH|@X
zK!*44Q0WaTwyi$;LZYn#;}$1u2>GBCa~S|NmCEH3OcR)*C>TJb_DPKrR%W9v>Qm2Z
ztF^{jO%7&p+dvvm^WYbT|Lt$J_UIom!uf3h_0ctKnihF6lE~Px$Tif9P%C0(d6hsg
z6{gyhDsUsf2)oV?0*=~^&C(()T}SQJ&C*NyvbI@z0$-qI2YYSij6nuD9X#dU+cvgf
zJGU*>YyP{iw{`I5bn8u1%MdB#&2tAES1Sm5`Oh30IRMFTQ}atIc7kNV&OY#6KHEEd
zW9;sHETr${(mnus$oI*`PcSOTumR-PCpE~af?{|pSi_5DQ5}v+UM0>>8iekp-NleA
zu-$d#4xEm;h-kpV;g=a{+LqHniOtc~aCLTgr}3LtaXC-3iMJQ`?O38gdLc~{5FINd
zf)#7Xj*n(LKZ!vlN}4UnG*-2K=jM|kSVLDg7uRAcBR^2t)DKsRi%*NUVIJav-GBV|
zVl06WPI+h}I$?1Y<;LP#A>l|?9@j(wSJi14F*9s+;g&^4kv6Jes7cmvR%Z_)yk^G9
z^FP?1vR~wG2X{I6!l{rzE4oG43@$b_VnQfwm?P=gq(E9zj1;j`iwqOgNXWpI6=5$w
zVz9!Yt9;r$^9z>%c5-UmASOW{f;_Pl2ek$)Hl*N=5RWM#*?iLevUQv!8aJ5y=Kh8$
zFi8SW5H!eZ(nfeg+Ss@)(6Jl+-qZ@Is>RVKAcg<-PMeuM2pL-(7P*IvKvq#1d2WlD
zZjT?~qV1kd(qAY-R+qyc!<02Y<4iTXmnLMviU5Uh)!<zcF<|BM6%BW;m^lPS*neOc
z6F`S%<eqy4-G{quK!-=sbRfu^<S)}nxMeDuf}4>Ix+431Y<BVJuOkuQ%7wZpYHOx_
ziL{Z?gj&ITQWVO>-y#?PcyuLJmd(`-wcLoc0oIwuYTAyLpG6^_QiT6yyh;5M+8-=7
zo@|~i;+(uyyV?l_&{&}%%7Bi*qCFfAHqaQL&0EKBYPDKwZ{v`&JbWj_2zF>8udtRe
zU(a2xK>-S1+(`#`&KKH12^|X%^#`E14aAx`;9Vc>c<OXt8dEvKoSDu&NVwyUc8ooN
z+lS%UC&LnH%)%%r2F$W@xl-YVEwJCzdy6{e4DvzzKY{-MY?DpdHN+^5(Yz6xh-?v*
z^GaIpWRwxx=fzjy%_N9ITu&OG5*>y(xZNz3GGX6bIxCxJl~T%zUy#aq@jb6(1wLrX
zUxIBmMwW(RbhPn)MW}A_SOtJL@gJ=Pl*W&pQOiU&ss+AUW%X2*L)IRF<n|N%NTpuX
z>y==e@{3l#%8Sw<b|RnPA63C8t!lMvfmSAI)GHSlHpO49YMB$(Osgcn57V1g#GMap
zo)-nbph`+2j@R*qzy1;bTRN-MmljLx>?>Miu=f(^{aLwQKdWTqU?)R*O&_1CHe9_$
zZNkC<%^K>zK~G03K7*R;U+}UR%?{AQiGTkc|J>p~_21rO8Tb!rnHIJJEzAY=>i|)!
zZ?NA>pHSp%(QNM0Eg@Y2k3e{AU%)1~6M(jVY&v~ZicPZV7{F#6%|uJ)c?TAd{)PST
z&x4`kj(+$2V0?LXee*|2fbKO<PMXK<&C=HE?VaZCo42k1{pa5P!Qs*W9k)+Te|h)*
z*MBKcfpsxb$zlYL0PWg+JAnFE8mmv&o<0BZ#ZM9mnVU!ydl3}8P@&M=etT$aZ!-FO
zApV|+-TfzdMtCg_>G4yjI%GkkL6oj<&N`(}JYM%w2R8cxO=+RDv9a(-{N#pxXtqm7
zF&)WJ+^b*TR2UP)lmMALH2~p;HSl_1Z}s8@ZMC33wp#Dm^IGE*d&$(8lQsu>^#yUX
zw^1OnMMFzfrzCgs+O_@SqWDv@t}Xc$x3uBmbyp_C+*6ZO$AB4iy{MS3aTrJ%e#V22
zFiD?3V%uJ(mcP{Sr5`y1=)hrBUng2NDGi=$`k?h~mZ%&*!hFQ=b?rId%6R-JBDiu{
z-wmL<{B;2YJIzCf?YDmg{qx*~wc``7n<|BNlxS7M#4rW#>}sO?YK86m@0+6|_A~Cy
z*BGG2BPai6h%fN{4S}!3?`Cm(PTpciF!|8BVNA=YMAmXR4LBfuvI#{$|ES&xy9)gJ
zsWW2L(Q%0v%HmYK50te2LF+mk8R{5PF;U>B6LQ`cGk3(miJh;<F~f)mMSnCiVtkT1
ziesZPGPu2A&NvK}FdDALD6W6uR-a#2hbM6+_L(|DTo!isC`>V&CFn&sU>&Q2rz_r#
z+!}}qLO&7G+)<nd(q%xEA12Z%UtMIXX|9e1yBaZgKyoP*I#~szDP0FreC`D1>H=A_
zuFPsPNTB<Ovl1udcUtA68&zH{H$hQWjnc9aFCEyUl4dL_vFNRlcM{=1BQlGnMFCxs
zWckGi45vlYI&?;83P705SMk~suEVhY*O%0y9Mc7&1yCVCsC<Y#1e5g!jdopk(8xt)
zAS8G?9YSajSYncHpn*?`cs6x|_gr$!YNyfSJUWC6kG%bGa2NSvqK}E&(4a6j9n4tV
zA927dtWLtCe^~~EKzIxw#Q@A;UT1X_?ZU`0GzZ=+DNsd-+J#6GYjwzmhI4U*zoIxo
zEmu1`k;?(h>D|^|_E7+esS~US$VNcA7<07s1h#?w@c<u(+qk%-;1_2WoLoFdZxq!E
zQN5<$k<*f}C}Kk}<9f3s!1;Z@2D6z`j1Hjq{tzUkctSEXNBF9TTQaz4Ol{)r52&o$
zu%yz1EvnBmI-}8Mkwyp2o11?uMfJ&l97Q$Ce{A^w`0!iQTKONwKl-KOtduBAeVrWt
zB1X-Ve~d<Xbrz5r>^W?QvaEJuA8Go7cUaOdK+K|uAGPLL0;S*-CQ9mPH8exQXb5EZ
zcrkRl?8$Y!I-G2ssM%7ErPH>wbcz)L=9|Kd6793ZrNpv)(uDVLbfn>;W<0b^yo~IP
z2mGKTaQQ(K-6(g0F}(x9<7)mW2YDn&!FkbUR?w-%j-hNks}kU5FAy)b@u-U)`|xAX
zjsdi777O9?Gd!{;v(K(>@+ORsFt^axE#lrBoU*NP;G!Y|isAF0@Nt)Oi809dnH)Xh
zqk}XmTwqbc;j^juPe~!f+ve5|jBp)7B!w`0t%HBYuuxJ6A+GJ(8iY*3!)ok@#aD%b
zi_dy4TtA>C82WR}*J7s<UFm2dG=Be7D26Ys)FYM1>p>XLOT|JFbOk&ky-on&mATyu
zHdy>2;^LCp=EO0}$Ba3+1xN~Z`8ra=pEa)YhV`zkt^uRZ?r`V~p$a@ys}=I!Ru&5}
zqEeo0Dwy2&p^<)=b&_&3NV1{ZES?q4KJnpR;>OKRVAEEH_a}~HSGerd%sO#?;<PG|
zWkFz}WdZGfIvv;J@B7>wqfo|9`RlVlyhig2CYcEHxr)0ve`Iy+o{cBYK0Dc>!%!HC
zn5B_P(@|`nYK6inwrL$l_lLuylh)zEN8BcUfa3TC=VA3?8D!~&H5iF4I5(>z142w)
z=BJf(g8<OKAha-D454KLECJ`17kN0!xg!i8{3tg3$d{v9-I1cP`hUmze;?aua#5{v
z%T;-Jpnt@jGDk=TaL8RDetpE$MFeCZD@))rLh-T`JJ2NqOWqlhR{1OxKJ?DO5|R<Q
z4taubvOnRc);@|4NblNwct}Kub`vGthxL=@{?XpnN%Lb`JG8Fl!zaR4lGUU<NxXd0
z+#NH=!*Lh36P5bwg++ZL$6>_W4WUFr98ON(5KyKR3delmBZB}jc}8aEGalrNOI)uO
zPWzcf7@zdK*3Dw<9fGp4HcYSY%N-#;?qqe)|NZ)hv$JCH?9<ue$2#r~AJ_Y(Pep-K
z%mxr8XN8DtEGV>mQC(SP`OD~Xf$=*-xoAVJXNx-JkbpcL-H?qKD{sR>wbEE+yPjpS
zw%ZG?P(bXWDT<g*EvHlCD}7XMi<@lJ0I;kt%5w9IEOZ5YH|^uoS$k+>D@K+#w3V9K
z0m7EiB1*)VB*_5kmfgF-N89}Q|LCf_Sz6>@N(JBR;8wV_$iI{dtpn)Hy*)?~-%5q8
zcmIT+@NcQ0?6uGEH*JwH*Sz|ChxLFP;mJcN@&km|e1jW)r7!IB)ay$wnQ!P)QEWjv
z23o|(_d)*VdVwEMa6R-9n(D1^^C-TyH~0~3wYs$VKjN7qJ{+N54~-!ka{n!#^@(jL
z2aVWG3Qz(Rum3_|(g`;CnIIimV7+&!H4|^5DT|F*QMy3X3e&$K0<NEE4}isceB#z4
z_EzYy^3GLE6Fe(aqWY^Qw!`n?SM^PP5r6p~)d217#JXgfT=u@I@8MVVO@0x7`5*lE
z7gkBwS?KbkxWRAoMP*`{{3^eyZ}N-y%l~BI=2&8=`6~ETe3M_qU;YRG?Fyv)Rf*yP
zEka-U7x9<>Q8b9orC)kaa!X-K7Kd`-K#o$*Q}a&d<b&K&sggJ(A&G?M?MSJ-;4Q|U
zZpUuCBm0vgD}_{)igHXu=Qwv+$$27{&#&^U`X;~pCA`UPsoZDH(N^B5ia6HC6@FlM
z0_9sosFx`FC1*4$!frB$=dd`sW9e07oq;CaC>2gX4TEnh0#S(`D9~FUoBWG%6}qU%
zfx0-CX*gbFO$E~Tqch=mEI`^NVTgW{U&LSjhm8B+8`nfBE&f$~lV8MN{zn%u;vp8z
zERt`uOpD_#ikT9gqDMG4c2N23J7lgh7xP4w3U~NMQRrnj8qkSGku6F`o9UxMU=m}E
z4{q)jA);4V*MVn}cC|^j?u$AL!jRnj7)ie;%)%1W+rk{xCER=Oy!s;0C{-`95GX2f
z_x)Zx7KGWeQesIRQWQ?7&vC2b1ed-8{xK~9ih+!sh2z&7J7lx2KhWD0wVy36aj&>6
znqA`gbj`&LKJ{$LY0#oxO~a)e-HGr#<NgHrqeMD-rPoX17T{vTuh;6;dLRD&2HVj3
zqel!M2gBFJI(zh}zA@Uk#{WwEedg=K_juxWESfEzUy9Q`%#2TNs1(n0@zv<u-HqOT
zS_iF@syZfmgu_~>r^UrD{M#+g1^4{lp6dpfD!x)OdAb6MjiEWhJpDHTgg)RXl&1ER
zvSZ;q5hM}evoI@B6Y9)}?TK0KU-vai!e4(gT4y6-c4$7|uvU68Tb!}YdvA>YJKZ`s
z*}@F<LuMUqy=fZl*1wu<ksT)d2~GPxpqcbJVEE%6`bvP@XbPd6fBRR6ZY-2VU`={e
zh%AZp+$FJ2>YKZi610F8XYvkNi63P{yW@x3Ga-~(VICPN-X!lxM+(N-2~qAR@0A#Z
zbsB<_J}d8~gLH(`lM(fCc`t-SQBFZh%q!;Ih=?J}u0Gv^=3JGhqne^><!ke9)haYo
zRH;02-mOZ7X6h>Mg~1V2ldHaKeR?Gk|DToE-Zw-lH^UL|2olXBXo!bS3qmaX@E{JY
z(CCgtC*X*HDg-IcM<?J(E0Kz>=3mT!3ZY|Y$ld8Q7zi-F{S3FZw!`fb<SI=2+W3lE
zDr(NDpM@ufeBX(hynb#go_^wM!$7zArx#@6EEh9ubW@6n+EvLie^u;=7butfi6BU=
zp2>qqp(`TtPakjxq``$t_29b_{yenCU!cnB$-4zTe?aXb&<>ut8%iXNom>2MBt2ch
zn|aR~T7w&O<6!?`dgP&qjBDFt=djJzYK_{{n%q`LHtA~9DxZ?;T@rUI7wNs|g--&3
zm@*kC<P3}72PM$R>70Q_&Hu!G5r3!p7OgEz?fxz_i9+^5p-aoLEvJJ|Lih1`Naza`
z{b+O<u$CV7;hUTr#dvO2OCD_*?9_d{@$I7n%K(j5>B0}bS)OosiqE>b{LT+YjPg{(
z?>{c(VWfD7UJr&NdX3_{`1)mtJ`Jf>e26?iU%A*aeE5xRu+hISUQ?O_>9bV12SUID
zHxL6(5p6ObCn~$LovwQoK3tBuze3+wI5W;Ia!%-2-F39rBC`>!l{W*Lj&{c9R*z1R
zAf0R^&=mL_kNZO3v@ZL!2u&;13X9^1`75`>8jdzmkH)|F6JNiT@EA_LhWsB$CjV6&
zYJC&&knaCQ+4Tx1VF5}+7$9Ut>xF3;K!u#D;bS-rd7;EsRHfS6x<-jL*eYv0WsPTr
z+t4)DL}#9zv1e6~?$~(36za%YLAC5tc|0`z&urz#ACZ9JXB><~E_c86o<7BxFCBVX
z6Po;C3ktVP=U7cx0aq7~VFn!TLvp+(w7%nID}~$1=7Q<-1V%?KB2NpVs}ONPysR9L
z`1Q7M6^*=z$aY|v^mcXN^5@|&9OP{$mK}=AG*7;pk07W?Z`c=f63J`eav0<+-HCpR
zc{7uX<VC3#_2i`Em2ZRiX{5Kw-zU81-a+28(%DMmS?Lo#Id)j*rVkTlnLkCx=?P3@
zXGDhGwb-Xmk?TNoJPK9f!^6JQ@vs4}6CRU=2W<Wrl(!wp5UwL&-f@=@CO5#q=gKau
zF66=#ojjQ2>JDG614*_&<ks3fnA+!N=W{I{Wx<R37Lcxnq1k7PXQi_<?~Lrv`JpCk
ze25`<kIG7~n{QeNFxj{PMbSL-&Wr4}#D3NvJB7nn^G%{-qX$_gkMrf-o@)=Y^eT~(
zk{(Y(<?vRJXy@-$1X(3?p~**O9o^VA__ht^kctH%4;^vL2l5#P!Xl_T`782y7akpw
zQ(SyhsbBinmg<jxSbWSqJ`U_*y`&ctnDD?+s|AJ(y){V8K<a6ngybhO?z%2E?Wj5f
z9|L{LqOtE;BlNja`VGddEV5bp#}CF2k61|_S-@5*z-T8pyZJGF*1yt*zQ&}$iL~cV
zE#mzv8nyXJI^RVOE9Rap*5B7hMHcI^u%Ykq`dN?iA@HGTpUyJvp@uZbrWYQI8atwo
zIp%Ga{`f<7KvB{1gZjpdF!2Y5s~L=J(oyv%AcEa<Smp5o+(INaHGcm23{SjpZill(
z`YbP86#V*c_4bD%*|z)u<GuKCvtAe#`k3+Iw;w(({ZOwL)}aRm1vHX^KYqOwwy{`R
zgnSHt20sex&VW#!m1}2T8f!1kZqF(;?)n^H@bakvxgUyWXJ|e1xZcNFf2;G_7a_@k
zEUexsob$@oCl(SVkYHIUQ3Rx{bE@(wTFpg{sLweS`G6Tza0)<tCPp=P6^%?T7C+We
zY8~KdX#LEAg13cIas;Gwd}8>Z{mab5hmVi^Q523L?he2F*&><JuCTUY`{;|{10;Q9
zJZ9f68r&BDzhVKJf^8!UV3?<*g28HS4Z1$+_~<05%w0QC;xa3~D&o~B$vTWcM<wt!
zbrb*X2Nz`m{LuJVk)+u8)_Q~4>}QD@emr?n5$}bN(oK&3gZ)t^MNq<TejkhP_ag0)
zNEkP!h9YfB7m1=>M6D+p(pW~c6;>>YGVmn=fK@+{G(2HXrF(Pwsc53I708b?`^gjg
zql6E6#I0*?bzjl~Swq!Sz{e~FX={m;K;Ou|pZnSm7$&R__?lg>!)OWLcj|9FqpzeR
zrOp<)b)CQw(Ix8rq892CU$Fno(v*Og(NvyDxAZCMu#)l6&nmQw*qRN^&INGCyNL?>
zFtEli==Fx;k%&E_M{f4Hc8Xg$S~+~Fy$RD&-^DNpWq!+1!QG*{@}TYEEB@mZgMGhe
z%Pk_W3%N|WxT!1Fip%tbV+5VdV~9X`a&82DLe4VX0a*`oFB*<AZUvR~>H^82VGBq(
zcG&B>xc4L-6dj=PHwWAg7F2;dYe#6PRFXSZ1LgNppyKwwekG!ba*9b6t?3Hj<p}y`
zvjn1Vfqh&e66o6|{R^TH1vUsll&|afhte1M_w_Ty!gWaL^CZbgl_Z%d6MkD?B8=-x
zxL#e;ioolm*I&3CyeSCbODo@|qzB<|xsSftX9u}k$k>of-ciZJ$UE$*1d4ffRd`5(
z6Cz_*B`{0Xo_M1sAdji$D-}en9-v4HMP3h6<C%_6=U`aB2>eD7C(um?td+t*^^=CQ
zv<$=X-0F78Djtwv)2m&#LkD`AZ)Dz<WqvH80$+$oN+Zw32g>4=3|1M&61u3_4j<>_
zqB%@1=qCiUyxRc}H_yZBm_cYDO8%H7HN0i?0?0CbJZieoE*t4IP(;6(S(%rrJ90k=
z)$4k=aS?hor$N`F`O`!!SNt}5vm7V)tT^LK6me`Cj*(@yBdn%O&of1g*^cMRE{27W
z8(ibT6-wZN{n@&*frCe3U>aTm9Via1fL_~>+n^dl7rb2N;ilUMmRtY|5yb{3>F;BU
z`(7jG>aN!{JZn=$5)s}UKE^|fgvz+4IzEo5*dW0`_eOV0>-4WLMCT*=mro1)%H=2H
zdS|cDMFqHrQtgZ@>F2&Ph$^v&ik+2tZGz-t>8x^AE`Ru~T=}?EIje9fNtVR*BPiQ|
zEkf~ZwRl$8k-ym4(_(#;g-l1F6<Nh1K;yThiW@`Hu3}W+5yxhwG7SY#O@EyUea54^
zh#)V~e(2<HI}~Sf;Ucu1bK1mSL&#CN&xmc>aKCa^DAxPaZ8K)yQbaciI~BH*w@J9g
zeb8AzLz@1S`Jnzf#-QC5N_(R9R~b{vAHSY0R_aXKUYzm$g}$pWy*}(I80{&@$B);C
ztpf%)E<P$s<sK@bng9jnuX61k1VKZjJjE2QUMGtP-JWA!W~-HWX~K7_2*aFZ%wGk{
z%0R@U3K@-|*x96Xz(a~U#sNv$UD#0ZwfHINsIV$)$VMt=6H>K@c@#=8t_s@dsUC0o
zp$d=UxyjIQz#Q&)Lq4P;Qi{A=ipzr9BT)g{5nrf?gF$R#?0UqGVLOjCJ>qO5odfT1
z$iRjvi&y1gVwpyeb!}2yIe|n4Z{t^D1_gQ&;l1P|RX_sd$_VDD1Iy4*0*TA-TVy;!
zaUQEIG{ftVuGPWwUhbEKH0GeDc8TEt*hD*A_*M+}isJONz67iiyp!;PchL1qb?F8|
zaEuQU^ra`yUvKZcKg(OEBYPkDwlrh+ldj3i#T_4h^Jn5{5L;wyeK-277gFBFRRV1A
z`gY=3Zn3~kUxm&SnEjYd6{K)Ws`U@MZ}+x8l8OA#?ec&nkh`IR+UQ<JRCxqV;`z9=
zzEmOj^*s!-w7!iAnb*=-m|sZ4x0GvW#QCvW5iQuPu2;k4C6z47uZzE+bLtf1k+1H6
zxxk$&uNRp1?icwZoh^5CXUo!n7*grcAw9w2iE(ZSHtZ2yzB~3h2p$rwY}FBwK~K?z
z`xVhiJuVYtE?6L4n!GW_dC}VpH|YULo1*fZ0!(?tom|W7aC)`TvpqlMqE@^Pm5(in
zWPXFY0BFkMeun$W=DN7_cU&Q1V}<^Y2}s<Jom*_@uwC_o8<aVSO5OwW*2rr#;dJ}c
zI&6*>H1`q+L{3{45?sI(^tZi;-7lX}EbxYh2>7<OE)by$SkALZx+us)(DAzTVcJmF
zedPX`dk#QmN)w7+%6MfgJ@8_W9-GUDD82X_l->lVIZ=N&k@p4KSdwo~dg9rMjHZav
z8uaFp58Epg${<S7H341S`|Ohv*(E9Z^=I2<yJppvML=1OYwXK+yA_bjmOCPM?cxRw
zmOv1?KHpqpj4SCo3qJLwa0AGqL4hJ0%^HSiqhg`KKQ(c)6c(a$ozf@lH;tJ~;l0z>
z-#+}d4x0SeuN(f?b@6?feeIVD3!h4nU_rH#T#&eHP~IsrsNQuo5=t*llL7{^7h{=n
zX__O3lcHc!^d=2Z2HO*H<Q}mDYaDnO21q=Bhs8y?pYyrp4UL8_cdt*D7amtJ=m>!C
z$3?hD5mhhRLOtl_*<%#>OJ`sCpR*+<&sa$!T3s?b5^U3_K%8q#x*3yKh#%;c@K^1%
zupZYk1$!K&{)9_wjJ|#WruFJNk-iRMHhL7p#jJ?YGT|^(m<NO%qe+RxTe8SIP25_f
zJF@DiNQqHTRx*8hS60yyslKd|Ah{@}@@AzPP*C0apXJU<I3eTvL)$BE#JomP@6yuC
z<1}!$BnlkIV67rXfHch~1;-t!Vt9AGS&O8~h=)u%dW>SI$5tB6K^scQvl<1j`1-ZP
zqXcfTVy#x>dj`;8qh>9O5!51JVS>D5g`$8~Z~en>6f@&%y;l3$2k~4N6oj)fhL%s!
zVzDwKOSm)5wA{2>>fv-$@h$)il$;3Yrg&~I^Wy2zb{8IrkWih^SEkohq19~I#onwJ
zVq`?=lA$q$4;y)VfxLjh!pIU*23YJ0zZoRGYf{$~4@1;%L@m<NI3U4flQmFi7-x@&
zcY+aARp=8OJ5m+ouCJo?3(}*U*+?Ub|IMO9a6tAfZiolK%*%{gQ+Sz5$t3PX%jPqw
zt`Vt^APp*7Fh)w&zG4?=_amC7+MbZoR0-kZftL_^a<roWr*sLSpjD_EEibM05qN6a
zU7SP+qhjgoCp_;bgD)OYsA~o$zFPwJEX$y<HkknLw%+eI*X4Cg=QHfdqzcOK>AGmz
zWnHlw%k-r4uGQM}6@D=g;x(}JCb@XhQ+>;FC@?H47BXYARH$n}{L~CZ`|o)8_6oD`
zx~x9JA8to|$G5`j$H48F155ox^IQ5}lFo<8tDy`J&J784BF>6RwGfJbkz5cjX_WEK
zOtk05@^P6^gf4wul62x%NhW>|sl;D`NLpZ~)@4-?`xv>f3P{WFz9W6nSF0Me(&15-
z@_Rp+S2u3we&5RC{H0Mu(I6iy_C8(|-yZix2In=T(-)a6`TlrOe3KbrCp=zM-({xg
zlgEqvi%16jc=3xy*exeQ{CeCkDX|pZ9csG-ewBTNrvjg(4;i+}KGjM%>Dpv@+2Jxt
z+djc^IV1-<c%VX0vtcRGW@%U4;PcyX(+Ri}MVs&c^=O;_GnXeKoE}sySHI|Lys#(<
zng7^tJ%9=N!L0tVRsEOoQGQve{`7I_RsDzag8%hZY@hM!tDLUkX5{Mzw6_2~rZ2Xy
z9;Yq8j}xFm_Qt?Pssb1H^aRAetE_P8;o0HuNM$-m_&b6n4i-&QpwSk}UlB}E5IrSP
zVG>kNRp4T2;!xrT&s<EIsD)xd`Qy|iEDe~mVz}Ru@)ed)vg?(nQ%UQXmogbwt+{uH
zB5=CAO^%ZtPeYk5OmM%DgOhQ1ZC$Fz<Nz!%A@KlN{IsE+MDx<Z>OUPHzb(~J((m=9
zO~foW#_2Wuky^vN%Sd?1Y^oqrmh^F^9I&2!(nu{8_|cYHA3#l@dj!1Qz&q&y8WZp<
zcYo|z;%rO+OuY>KC6wVZR*-J?V+R(xDoF%#KUw^ABhpvg|8N8ab(c^LwJbhr@xjDp
z3`Lk7Zlflej^)k=u4=BoO{l*7@<XIfb8aW^l)_%DFC`DN*it<_<iY1J6k#SY_jSXZ
zQc_&-ODOI1NS=D$!vT^!sO;LkNPnc%l@(cKrUS`v<e;Cr&IQH*$(#_G!17>Hv#gAd
zD3PoWs<0_qL(d8ecViw8G%E@DGseSAy<Uw|jP&yNo$K3`8G4R8)YgxPmA}ZW{+m#Q
zdQm&Dj7yj3hILjC4bVDlt?sR2rt$^GG+*nJagcBvX@<2>s7H_F@VLeqqKeC(jl_J<
zu&;r~O3Nh%|NF#L%mimsLOVkNvraJVE813-zVOTF#m24h063hoz^W`DI_ryb3tc|E
zg)Vs+63sul&zDcw4){iAcM<n5NVCEQDYwN9x-DW~`705agTG-lXNyHn*O|jxTTnjv
zGjZz-k=R9ZQ@q;f0J+WM)z0U0W44i%f?%GZ#r;Ih)Ds!Z;eE3aWqIhZC#y3zu(v{o
zF!kx1?32We`2B$zwFcdinfTnyoZn%|U3yX>`BQomDl`7$`cGrwTs~fS_sz`w>6j3&
zPH<tawPb4kB-=OxYobnK{siXe75<6riMDeZ2E`oM%+DI(MQl1QMQRoN(R_%pr!46;
zjIB<~j98m;*pTi@XL=^^ZC{Yv=vW<OsV{Hnsute4zxuajysD!dBLmmmMy69dO%s*d
zp4pl=Rnr9SZ#dGE&6uXm%5Ts&XtTh5r#3^!Pup(Ql<C_&*Kqz5+aAo=_~{4xH)(ae
zxzi5Wgx5dWhJxn(hdpAN0ck-GroAGM)ghDIoyfo|(cffCStzL2=CKGusgL{#h5{$z
zfmdkhl=n1Vy*V0lpDl<(#0?33sV;|)`8p;BGLD*^h3}Tc<1M<9L>DdY71~8{YX}Mh
zzzy&c6(EXJbPODf9nhNwH_K=zy>r+WmmJU}3_Rj%MJPHb+2wt<MgemHFZw0YtkdWP
zWGqSyMcX(>`^y0xFmjgR#aFO_6axzGG>ZoxC1*Tc+wYiOmpfRZ8yWI8O92XYu&mk&
z<D(v{*TcqMLL*pb;QIVUWXMS$>mr{T=kg60K$bnLf=%Ey<LLf|7{$#2Q|$cSQD3-2
z#EupcAv>wzR~Eeu;>GC<R8VVP0xNk?Y4jtcy_j5dT!SB_&><jRc}Cr4_~Q;5$CClD
zsXSqEiiAgH<yJ{}K4yeR#Ba_hq=(hf(xo44zKI~`zPdYR;deN8DV2eW-%x2y;DO;3
zV%=*no|T^Z7=&q=PM01(rZ;muU^h-+a-u}hb}r}<D?KHE*|&*rBj`+;aB#y;VtqKj
zX!??MFn?}9j<`&+F!lp)EZ$i%<&~O~s~vxl#~=~uHF61|yW&PC>V6n$uDA$mEQW{U
z9=Z*3B28Dh(9MpkdU^JXg%tnaK0nM%A!ou>z>K)?@SXzuO-(fq+P=;<@AngL*f&7`
ze1qN2-cGq*u`p~B@bimWghldgyaBV6n~$=AeNMigJnPcdYJi^!VkUsjSAV>c`7v?n
z!}Jf5$CDF{nG8KA727QSA-vm33UVRu!h_S}rm?-dxAmqSX;qk<!Hwz4%|}`LsJY$R
zZ8dkIHN=w>l+99ZKFXT!PmZ@j?6M#9<OEgImYK5`kB)TAYGjDyWbaJ@KPM&c-=~hz
z_wSQL<b&RMJimX>+ZY>{A~|nFPf_yDV_L5xnVdJOrzm-+aV_!3#%LC0)0di$s=b}~
zP$m2#IYG`8;CJCp1bx`fENZ4MG#^bn?L#BhU_`GaCn%b-$eexEdL7}sWIiM(J8A;#
zd=wm`C7(h3)v;>H2|}hU@>gps@7sGPN5_ZTF@DM9M6;%WpPQ27!^4w!&xzzTLMDO#
z)x72RMTxPfu92ekOopD1ir1}!oz`&zFHcTTF&TPJnX+}V6+=t{f+r{C$z<^P=x7~m
z@15>6b=-(JOiqw8U5U9RTN<}{a+++L06iZS_{Kd2FHcTTF&X-=o_D_2!Q<LEg(5l8
zpeexTqeEB+>&OwYmYkqv$|Cd8BaX4-4b=|2BeYBbK0jY#$Ymq5XqmFeUp?|-MkkWY
zMEI##g)<bpGhMA;woaPH!Pb7WeYCaR%poNOa=zMAKC$M-s!A|uJ`D3w8@<U<b;ZLv
z#VDM<)O=KlgEk7Xs&POZY-_m*%4RD$=Zqc)Zr^g^{UgqpMQ(CZPhDz0s<epeDflTj
zLDRHl=3JQqGw?I9Q*Ls3nzGD%6k*7dl$j;4V{U?=DT~ZcPjz6Qj~xsUk%rt*xv7-R
zRQPT*_B)*n1{gdylfdap-hn!;f|NQkNt>?Ne025jS~hdoU~Yn@DT~ZU4?ffDSXsz<
zZi1qz3(ZH<wYX+UM=x>{L``36&bt{mCJ`g}AvbwNGgXN>sWJb!0Ti9j>9}QXlBOBT
z%|}_s>|9t?_k3Vq+88=IS_9=8DmOvj?4{?V^7=ZbZy+~G*;FOwqvji2js6)oum5l6
z4_dtVRamZpXZ5Z%@<S`4lT*Czt_{1hV~u`R;Pd?X8vbqk_-sZ0i(j9vt*!jO##&?b
z`Lky~u0930#*dA)=l_qb+_mCqK4WOR$JqZH!vY+PbKoZA|4l#STtT^m_Q%7a>Dhk>
zx6k-62*Y@dV4cN@&b?ueERVvX<GV+4_85#Q>NHxH6x5Y`+4Rxz<g;3%wjw>r$*^tG
z%7ll?0w`4qotDuP$t&0UT;O5EU}&O$by#!J^9ee(vO6M(*wFO@ByV7M2$wHiM4&m$
z1-fI$hnZss-Ll^lgsDc2y>+jwOUpz5pv?8Umd8z!Ac>jKjIPBzeAY&><aFd%C0W-L
z&=sBw3kGBj=z$b@&JJ5BTo90DmWo(L#$V8ObS%mpnxOrZKR!pofC0-4sB(Dtd7xLa
zA6YSQ&91VgQrsd3p28{%TiM031yh9RvpYKVtga9(iwC9xKU$Ox0nep$^vMQ5$AAIZ
zp55^a=QqO522|9sFxC<g_!(`4E?tkCr+H=<R*7B@ojPME@&lJd3iDvrK;xyEOkx1>
zu~R4<$KZs~89E!dw9Uc?ZA196d=Uhr^?GO?=~zMd<7w?87!DqB#1$ZCiG4t`vp%_P
zHG&KDST`MxM6n8YEY`#^iQTJuB7|fd(idLm(Hnx`E}v5Y+Et-56sJQ0(zv;q)=#4R
zGV^U@(AdFviO?BCbkQ^#dwn^s&_N})n&Ts{ix`CO)+9YJcv@P>J%;QFxY?dW+O-BU
zQUf}ROHgJzIQK5?;D&sM<3s>JGAc`{kF%;h?)NF?*E;)@VCQ<^jjd1I6@_9Yj0>}G
zg?!{AffEA&S5}wzDGW~&A6Wyg(RAGjW2>f@61};FSR=g&EFA|nIm-yp=l;m_P&!_W
z`{)F-FXSK^jY>OX{`yVeW@DcRg@DC%+yUs5z1M7L<D&qEf&Xx7nofY0qn2>lH{ikY
zV4U<lbLbN~V(b8;cgo)Hxo*H845B3JQ9L#Lfkewm-nGJ?!jzHv%(id{>`M{_#<6cA
zdJ~<0p+%(+18J<Dvx|6|*lt2aZI5>>w;m2jpkd{sbd#-tuGiVVjz=h;m>Bx8tihFe
z<A2gT6kFH8Au-OSnA$!%6&=K@#K@t9jK^>kZR^0|z=ulL_JSLuYjw;UW9UymSfb@B
zB(52Zyzw7@%!4jkPK>@C{K-i6b<vCd5MLRy3-=17D=cnmOnO!@_8ecz13nC;IW2S+
zA;YzR8&Y#gu8g5Q9*Pp#2a}eE#IteP@G%rh{~~~F@?53_ITs^VaD@RYk>Rx7YNG}%
zj4xadeJ*vwHlQrAVpL*7EZ*DXFqBV<$OtUUDZ^uOQr}Tf0;C#i@7#1S;tWg|2gAnl
z;mGAyg}3q&v;r~&G?Su-Q~>Uvfx;V{n@FAO2+8TA&+F(K2BXHoS#QqJzoLNX*w;5o
z8&I7%MiDTCBpV&7a`2ERN}4d*52B+9XsxibWm0Ql7tmk4EP%kWNz>OHps}``!>Gz=
zGok01ebnzv9&MFo3N0>z0xohTG&)TugKiX2Qs<ybyH?+`NF-p;hrz%a*#3}vE0AG4
z#AFrSD8vE?2vRAQ8Om=@1i>NoiWA_%O2+$Ct(B3XmgrC$<A7Z0WazR2bTKH(>(Uto
zLS?`w3g|sHkcBfPb!^iBKz(O4HVDJ?qd+gE>kBZ@ZX9!Hcf`s@rrJcD>H97$0z7W4
z9GRdvIf6Xt^!>u*3j;Z9c4=(DSkdGn`HzC-8P=6rzsA?qurg|B4>WeZfb%JYZtfl7
ztUWPnfE}Oo=B)D{D7)hs7dMn)_XLGh>Co;A9bXC(pcBo+UC)op_H!Kma!CXJH@QE1
ze;vExEsj1Qm3yy76?!}zanT>@C+I-lcJWQfAF^MyMPi+IMTQcxoU%ZHdVEfv@o6FU
zKsmaGAEB%xd}TT3y6jVQx%fn*s!qI$O8!rL3Q`}%3avlIE%9;`o+p0dy6ilx(1&(D
zAL6a{lM=oR-+7BUqWfs|vy?_Zqc(Hdo|wv<_k=4HCeY(PXVM<XhDkh<j1W?Ly|Fy#
z8v#Gi8k*PZji=v~8Ay9tne|2rFJ$L8Wmxm*HnLiUspi;2R9GX+s!7Trt)~7mkGAfQ
zZN4)@=}^%0HeI)e<pZ==U`&!poI~sMEM+-HdJ5fzLKtkD?>g~?1O~GZ4~7JbNvO%q
z9}lx-p5t3~-0`V>0=`(GWDp;KqifRxEEJbEECYRzhH{Tjo6y(Rjf+t&qI=6iLE8vP
zRW}B+ti=d3wIL={+99y4!%$U)@&ze=^}Uk5$ED_|rGl20<~4%a0h>j~;IK9R@<}W$
z`=-McC!X4sD=O}qF08>QLWu2<hblbAMcTzOA$EGC1faB#s|XF=Pzm9_4dlrJjW66$
z?8ak{L{3a7CbVcPYIl6NS!(ZsY4mUi7rpa;!)hR+`Eh+-ZED5brz0lJ5a$8c<;rxd
z;}`PpjjiM6!B$0EGYOk)aeR+#MSF>>DX>yGRu2-1PEeL$)^w>4_|iw`FlrbPhvnMw
zfhGnAgTXdKuh;CvW<)HtY8U8PxLwm$RXNfE+Pk{$=UIjsRA^C2gGx$8MnlGT<E%6G
z19vEQV&d$I4<z()278Qf1p@vaI<&1MY~)xdejo%&{mA7F(YE2*)*FOfBHqo1w{L&h
z=dJUhd3_ir<MSGbmU_?ZSm!`){o>+sSU(@Q=k+0NN9q@&i%}i%*LmwZqY-yyPfB{c
z>v<F&(N+te*J+%fhl`{_H{QI~XyqLQ#HI~*)HdWkchW&YOla^0yBfGvq7JG#x9O$o
zlt*J!yryfYE&V`{COXFbkw-8fH%upbNagb5Rdi8i(cuX1VR7O>PXX)tsldp@pl%Ki
zV8pQ!OD`<*@+Lguj7~8zz+sxH?hp-?qKp6H>lH0vA<-0!C?Y<5A?M`5j4s^LH!QU|
zZdCqWpPc(28P>99J9n!i|NiG$<Jrnu{Ql?pk1G%NKYzyO5!=R?d-#%^RK-iY+3-cs
zAUu8l_ZUxN98z`pX$FB*RPZ76@yngl7aoPd1Zo8W<NvaMFdhw*s*2o`kO7*A08C0E
zVhXAlqhyQ+K0HWkfI=A-v|9UgcenMv*=C@a@@LiSo2(9EppN0-x3}@<tL^Pq1$=Ks
z-`~G~MO8<xoWhuuwZcxbeS((5n+0KH4#gJBBDM00C%!6Z_SR8=FymE0m_kPZc;c&q
zG#-!UiquyHVZa>C<%zEf()bpeB)-2YNXt`96yIMJbW>f-(0=nwy_EKwxb&LBM(Ny9
zkLQS);>RmiZ7r5X!HRG{L205UnN~==oFp`{#8-vHGe!i9C%!5~-W4K<o&bHWGJp_@
z`n*_<*HwYEIAToGF;yyswD)mQ%0+U7b{#aCtmxOlqDeGv^IIYEW9`sVqZpwr@&Oc9
zC%#Kk^sGn<4P{XTzPu{v?}ji{`wc8O<O9=%X|jKGczgn7C<T;k*sKlg^H&890ua2s
zi6k`Xt95Nrb;8ORlc0p~iCs8u{z6Hfb@{3gGiRkLB1wS$bxRCw`&B_b3&Irn17J>1
z4w0plEPuQz7}O{xTPGULup=<IZ@E!fUM!<i5yl~xF$oyl>GdzVo^OEAqF#dyga~CA
zPKf1KA=Im|2#Q@KLi_y+Gr41rDNu%h9IO1TA=Z*!6{1$God1y|1w!_eT0Z_(nSa2F
zV1&w&1{Tdhu|}rQirvaMdYkw6D-ED9u$|8a1ztByuXBOw93KwxWRRxX(>?&ve&Tq<
zQG=5Zzq~3OwYH_yfW+_@Ot+J*<2TI{Ocq~ZDDH%b^82g835aB<!Pr0CX=0B48(R5K
z9P*G%UtokC<BzRl{H7`vUxD`1{Uf9O>prJk{s7o_|KvmR-9Le}ZDW6*2*WQx);^z(
z`?wbIARX{iIz=xO?4I>I!;q;L?lO!Lm<KR4IhC!~$6Lq08Z?>#$Ih=n_b!xry|w+%
zNbY7a6zebtiv{wb%Q3^I((Uyopq5DRZ)H6VSz56I`q}A;e^C_3LBa>Wk_{E**r*(x
z_7z;b_G~{On-g+MRKw+5h*3!e>Io7>RYdbl&#n0vi5#2&g>B>Q&T$NFw*RF#nY9Z*
z&_3Rl;$6&S_#4)Y{<IgOd3;Bnl94#XO$YL=)O6cPPY#CWC@rV+`64wr7^Ee4?aQ=e
zzH!dZF}l8=lRM0y?ZWg^iK7jAS_WOLr)IeQv}9p`V!NrC<G{Mk%rHi-o5~^>9QH7k
z2!7L^mf<<6<l*2<OZPC;XIchX=%;4<k(SDjeN%Jn&S%R@&GA#mBkcPf3p-f|mc?@F
z(otE)FwJ7RJc&;igar&-WJo+p`M`y`eF#Ddoh^a5m&!~;Ak|5-NKsR%fncjBgcz?l
zTqq)Vp5)^(Ms`QwLU}h!NnfV{R<vnorX{Wd6g!*;{I_gBA(>DuA*n=I*+4O$Ty;^I
z)J1dk-C(&|C6KCIud92Jx>$7(txXhi+-Nz@ti7n<&!su+Y(e@_tdx?dqYiGao<?)K
zxpMkxVdrqWZM@&#o2AtCaKOvGJ&^?^8f`872f}UYzwuPA!b^sPPF3<LFQ%2isw?sb
zV#7Ivi!N{~W$8h;TXhoqfn0vFGmVw_d`>_#(h&^JAR(T^%-}ks)bE*P+PnKF>4or1
zX0hO+n^6h`v8O~*_W0j6PET5UM(g0D`Q{jA_ThnKs?35-vPz;son3@wEC-n@Pf8uL
z<KVLeheX>rJ!qXEk|ejrjvds^^bY5FsFWCJKakFD4ut3B37sa)pQym(fEs++$SaXl
ze6-wDJtxdh(RRX2x`xTgPU=2krZu$jEIbE*t2)1rF+%enIZf!f-skMxG?hrpO;e1*
z?0=7)9MqU=q^heim|lwZ5rU+sT45#**%Z|>3XrOi=^z<mhv%k?7oHa+^tmu|1Vb?|
zH$`{TvU4a()9&<Kw`Z80&UiQx25&+p0QI}$Vb1U;7<&qs2@-%{f=(_w353sSa<QBV
z`FqZA_&sMvdFMHK7KU@OawJcx4jpETr6?me;u1U?YGCG&=nvudg&$Zsec_Li+c_;a
zP1}!U8)RCX4V13vhxzHd8LfPBI}m27O+gmGAC~8;^*M4TMf(J8IeU`5oP|r4!8c5i
z#ZX(JQ<Nk$&J^Zsb#q|%VaVi&z$i4gdPr}+4w=3=PJjvHhly|ztA~luXf)azxK|Sa
zN3L&Q8$(osfejPEy(y{nyHf%RQIUEok_9XbyZE@7+!5E3l-PjlTwn9?maTy)@1vd3
z2#pGogA3KS2?Gquq55KzS%Od_HN7$mWn?(FPmY`IRCOQZneW#@G4tGW%jv*^RN!Se
za5$GL>X%kmY9bO4X7H*jg+jsu#x%!giO?ikXo>mCasTZp)VygPXcVPWyAB()&41MT
zmQ%Z+1BqYvjl<XfE6VT#iuI7i|EP5$TQvV>2)ot8iYPimF)T4dMWPZICR!meXrjeN
zqqKqso_EYpA3x`ib;b%$Q?G`=_}}Kqtc=Az)tM_$%vfBOoUvkAsoYuPY>D8|x7<0n
za9v6u)92M3I5k0{P$#yaI^NX%>5LU9+Gy&}LpB#n3502w6t^pp<aqlk>8(o^)QGMW
zG+jcgJWQN81(U)tjz-Iy16y>8r{+&F-*riyK*y7(q%Dm}iplBBh%Xg_^*m{c_Q|fQ
z9lbp~_;sC3SGu;(%}2UM7nWZ<RMUPAO(*=N%E=SFbK6nhr9FfEJ+RLc@Tvkm0jtn{
z%kQc%F1|h^pZ1KxXAsH!n`aH^3pA<S+&(<m**g9e-5I2;Npj5!c^KuW#-2xPM;O`!
zc-;}y(BOMr@B!OZKnm71#uTDwo&0Q)2#F?NLuxoWFwGBc29|$eK`qz*AXWgeU@|IQ
z@*cjzsxDi6l>x~Xe@+tf^zM{EC-DvXRMhCuL{W5ntw&B>3z5;L^7tXF%9H8XJ<vfd
zG1~ZZ;ecM4@Yh%PKA7KRJ`xuabQ4^t$^lACl~^;^`IH1brCW(Y<mQT@l3iLZ>v<R^
z!bDd0e5iZ~eND)M3a3OqL~7f`6|~OTiaz8}!4Fls^_c1pLNZ=d*-yc)w7R2=9}W(a
z&f#Ryj2g4aD9CP3DVRg16cbYyf}MyyBvJ}WjV_BZTG4IA7Lal3qODSh4yoDd-~>jC
zD}$=Enj!-;r7m5?%xY5%MMj4M)KvX1mDp@z@~JH76Db49q}EJqNg-Vq(`!=~E1HU{
z*Qw=qGSOvFKp+TT$W{I_$cZbjQ&E+IJcBqLQqh>Mf+l+>kG3?jbmb|dxtdlzRZF8N
zGa4y?uuMiWpen>Ab{t<TaR3q;l15r0tx1y#=2T-OLj|3s3v-mvsn8&F1l6o;E<|*_
zL|-Rmwn*+25^CWLg-M`B>b;*1%wpcm2$k7G()2@H;Ubz+MQKHqgl-b1q;|~C-d^)P
z)+6-<)USoIhW<5>oKR1D+uYh|9veHY<2KXJ;4;sx_?cwZ@zyjaU!qQ4A1IHIT189H
ztfMVt))nZb7&8t_xSnNpF3^e}GBo-T4iYQ%rP@V>^EQj05uU4cIHoC1<a|Qgo4DD*
z;VW8SDNF&IHk`<IAUwb&OM(ksC!D91a~@7i+Bav&qB)OM3)$SyIBU@bSl-S*Yl)iu
z^fqtQ-QUPsXF?nn7G9|so{QyII~AOq+uMXd7~5AnyvLR8y|5v!;8s!JvMs#gMXUS!
zkrLJY6Wnv+&a?bV--sZB=w5_VhWcMBVakdai?XkfvGwksP(g1dmTNKG*-N0T5Z6in
zEDB^4az({Fqnb|a*O_7<Qb~`7D$_{g6ohCL{M%hfqGoAiDbC(2Y5zd<;=%&D%I>ir
z*r(2L#Hv1a&El(1j7L%wA?Z6KO8&XH!Nk{B0DvJ2W0Ec=+Y(YWcjml*PdL;|mDwf_
zmY!$!WY|UigBv|EPP4F~Op-ltfM+;>f8MPiYt@vT!X%T9s_5N_w&`4s$f{)}!zvlD
zI>(o_-bf=>N+<0p1pcH4EAqXH_H2jhl<ynh`xE-9ilM=3_?$>)<hNa!zOwcFg>e!G
z6^6uun_s`5Uls~$=C~OHb?X=liMJY+S6j!2rzfv~J$lnalY)OBhnh)^f@ji@%vpcJ
z^)jbFwLTI$otS9Li@zm0SYu8l+M${{SRD+PMGq6uett(MZl|*v9f1kkKBopWt@Up<
z=kzx^cjjbh!JN-lfw(&GFl8iMAyo%{(Cs{VqWC@+<IyZ&8s-z+U)up(+~0-cQ&vCS
zD2E@DSuG4BvN$ZWC(Y`ZYW#hT<9p?5)(}<~Ooo49dgx1xmZf$@&p~%|bQ_|}<Pbo+
zrV?0Kyl|nQ-QTSvzr=Gm=x^N5^0(W_S$wR1j(#jCv0d3<T^G08!X>y?ZpeOo_KYnq
zo`>Z@FFK1NPXR)huIpGKO+tN3p(}hcUQx=OAo79}$)B0!lKFgX4Jf$CK$k{yeu-oQ
z()usa7XG@ulFFZ{)T9tahOQQBVG|JKy=#d!Dt+i>w~e}Hz`I5-GI<ycLNwXKNCQgm
zg%J^Zw4F_3ee}7{Uo=Lkg))-|(I5>^_6SM^PbGYvCC3s=_5_QzHAJEAS(EJ+eiJJ7
z+$TAL8C}kd@Tzt)Po}RUn^Du_NODi!A}3qUeL__5Zu)6T`{=rPy7uXq@>`)prqVju
zG(v$-ZFQkzC=|$g!a%)xolR$s!<X@jD5>d3A%dw4aRi>ULX&K5q9kwyBCLIql})6y
zupc1~utbxXUPGZkMkWMmfJzbD=p;5O0$f8ksgwp<;B`(aAt>WDAuNm1$Wm$0TM}VF
zv~cA3BvLJ%;nHL7X+}&Xg%fBfzMjJHbb4b?TCp&H$hv@&NO?M_Y*J(+a%@;+(-J?`
zXq{`E=FzvTy(!^-AHNTZ`NE#k4fr-|`W{O(0Ej?$zdYvDvf7AywX8P24+c!4Jn4?}
z`=C3~4>NVvUr)aj<GRRYp%k2+$Vu{Fuu2z|Nxr0UiX7CYi!zX?XlDqb+8gr2`HZW<
zJOE{a7y@ZmGqJ>ILL5RJ&S@~=Ibj4YEjfDClai54Oh86%gVI_QF%gTkB_l7*xGbfG
z*`+5yWSi8bv^Fb0)0|Ghq!`mlr6dI=zu+XqHFq2&AQFtss6J&J<(T<Rgo%<uTi^I@
zv7n51*SR%s2%qC`CLaidLlywd-9#QoS{t}2h(#W5vBrL0_HY#DYL2KXkyOo#6trEM
zE3bzp%vm*zJu8{@OY^u5vQ}epXhj=M<JPl<NB0~ut?-B)Th(YFD)Km3E5vm;;TVgn
zaiOeMtz)|7j7qJUox(z=%WCy7lRbV6pwi)3<oq$xS?L%H3y3SdK(*>wB<~9e3V9FL
z(34muowQ9PIJ`p4LXb``lv$4s5!<O~BZ>c-r8TgN2;6b!f-W;3VdOAi@(}${Vnir(
zOpD4Wg_;rJyLvJr6~)r1(uuotU&_NEkneFohDVrg51sE?wL)TG$0k6;+B`a6UZG|z
zRM5ZLhv!{BIsRW`y+3~)`Tk$&6ZQYPy7Fvw?ZN-+pYh4*e`$Vj=Q^;1fBf;;^!?xX
zadoZn|Jbv8Xy3%oL;p|e|Dk`0f%k?ZGnj8I%-sL0jc3o+9{T^!_{`Y<=#bXw`?ZT%
z>X;z^S67}kV*URVem%(lKjZUAm@JEqH7*K|;3o!T2~!I7CAQ!GWt(+f%Xdlv6A-<g
zUx)t&H6EU-J01>im>MDI+8=c@9;6h*&UFiHiBz?7H@IL+^}-`==4I@+w++}4fO^K{
zHNeldgNSMuFEMq50nALs(|o&AHeTC7yJI@LJZv4F$<RfTVF3P)Wjh$z8R3!0L3!Xh
zeRf@8UkVFj$0y$%jMD6lLSez~u{gr=V|y72P>BT|dXL%c32ST=7H$hNWo4sqTga`t
zjDLB>q72b<U7?cLUg7|-z<B?B4HG6e_W4=`0mZ#$Zo>y<)m#Hlf}XEsap6&vkTjk=
zUz?gMkH}+1z0P()lu(dD?DnUt)pJ`s(M7EswEE|3l!RgXP@zXp@8+dx4^SLodDHjD
zLkdb`2Lb5v*l65pjvWL?G7=3O3^w#+#+x|!u=)|HWIpz|UmFbACcDn-eSrC}@-d^a
z3>yfYmszrrQu683B%i1gaVQYS9x-ih4RD-5v&bX9?HDpC29*R#z$8EjLcU?3zYONM
zn(;U{|7yYX@cC0dGp_&JKm9bj4mi91x7t`;dC>p<jL#hX?+0D<6E?jHn6Ljeeq4DT
z@BgRIS041gKji~!Y^#09wtu>282)KAfaNt{vWsci-bX)CzS|4fFE&Q$W$j?xwOw4E
zU(0BvfTP}OZnK|W{PffM$@VJSc8BEV(qdiDgrenr^M*ZNW~(bJ&noQQo5ouGpwU=e
zV~7U-gA$_~4?_{Na;JiD&#Umy3$`_|u1$<2#<nl4q2<}WEOLxv7uKxvF%RM7bSYxB
z?JyDf5mU}>$E48N-q2s>F{hwS_}3i=h-K(@Db5xT`G)akMi_-TKvxV>apj?DFmO%J
zmC?dGuEXQR@gOxrD_B=;VU1dhI&w^}0#bIxc_#Ng$RkgkV+g^HVgjf_cE?)g=qRKr
zDAEI)heg)w<^i5H!l2sDz$AaRAwjE2f-r1P$Q(%!G?`*!rO>2k5wy)k6XWewxVmm<
ztYQ;m$vSk8i_sU^&<vov%|W<<;QdDdgtVq;&3uY`5sTrw7^I0BF@~=8DD2lc#h#<E
zlc4mt9!5&0pzA}7QOR2#_#tUf`y~cA#|UK9R-6S_*xO?Kgz*q5-YUEDaNIb21o^&B
z+sWHjo3#&jPu^`EH(|c8qvOM0T06}h_WD=IY_hG>ledS*?9->MHe{DdZ0leL{`-|R
z-ye}9H^^-5AMLf8JBSa^9B&<*w3_W@#?3if2XB_y>(di<aCpM@TKlaNKz?$#OxQ(9
ztr$DpMLhe><L$SQvh}*P*E;!?YTa#}9AJ&RP~{do+B!aIZJ+LK9kZj;<D<hi&<ai1
zX|=cawp#nmof;4Tl_Iw0FU^A!)_#l8DYQntZURADulJf9B{XWMb==%OLDIu-+rSPW
zWRC_t1-F6k(EKLQzIFWTGIC)1@SxrNzf*vNOt!PNzx4*1QqJc9;zJ)Vr^n5Gr0;N-
zwNGESPg*CZCr$R|@NkE?+io8J(%NpeH`v}G@_Uz^wwucgE%>NzKmnX-Zy-8s)M>j#
zY(nFK<KxpK?i}y!;XB|0P`U-BcZi>d2h?U@$l>v?h!>eb>|Um^@$PLC@{W;>(7u!7
zE#yc0<hZqcqJu)6Cx^!;T5H)s^UYrCP4i&83AscUB6`<qH!ILdtv156c<t}Dpz2d<
zJoXF_$G>XBa+&&%wP;{$?flZh1_*fQ_jXH+5#rzWTfu%g#P9V}D9Douc{;$LmJhI7
z@jRGl#Z%wnQ&OBVP;6V04vFPz`^ghp+Ux=BGJhzl4NpBp{V`S@M&CL(G2R-YQn8ha
z=24jt$4iEhdkc@m_T6<lR=CGf#~K40mKGn6HE4SbO^Gb3>^aIuq<Dyn1PW3SQu8JT
zD7MT#kK+rtcoR|BVu`KeeRgGG$l@_>wmoyie!l8lm>yKE4q1p_C3HFp+tDJ_T4Y~t
zONb0GNS3iay7eati1#S*KXc}<b5Y5=WPA0;r%%_JZ{b3~wi&ul$B>vHhS9SqhId3+
zI(GQoUFm9Q4LcWJiEsLGp|HB@M9Aoj24f%pD=6}SILT1`ph&hVt?aGp0U&fobmF_`
zYtS4VBs_4Z_n8GZBMUuqnGOXmg=NF`7<%qq=8XkqXcTxxPz#62JAPb)k1P4;=#~v*
zXm<y6%Uf1y?_WGOD(vf5rc(Be79>^(E*w3Ztnn0wk63v^QVrvZS0zsfqWR%bkZdZp
z^~YM{MXkYFX#4|RNbS=yAgg(8c7p1a-3{=`K^!bTC~+V*hv!xo`%s%#Yw}DG3wf4F
z!CFyS5&=4~Z!m5>t;9aA%E(m)33OcZ0*m=Bj#L_D;}I&8l=WT)7#tGQSy{2_XW|sa
zYDI$S^pc<TP;LB!$c<nl1&E?}E1<^nbSOMQ3sF5?jX|m7B~|4(rA7s%>Kvz4slZgF
zV^t?V7fRB{**Br71k`vwp{WG*bai4=Rh79-Rdwb!RaL4tmBw!xbubN7Up!w!;B<rn
zZmhucF~15+gJTcJ!_-kP5%RW)x{QHk`n;`LKDJ8F=dIKLusu2eZ=VK$#OVOBHYpm$
z=`@TL5#tOZ#)^t@1{GsP#yCcX#<Hhu7lS2(f<K&@b-jGf^(HW`H-T@xNo-5hALCk*
zfEd$~6vTMeOJmtuROqsfIl{9QTm~=P0YxizDbP6^x%8gjR}0s>)&UG)(l|0^DIec*
zHOiS;2sjSmNQ#ig!|V7MsezW6hzLrpfxsfNDpG?|szen!Q=YLm6rSEsUvW}<cxYZ{
z^Il|zb*!>I(yVBk%{OIMH+^|~6kW5Gwh&#VQO`qDKiEVV`&-+`XaR^_1H`p0+}gT<
zgS*Dn)fEgLjb0+z>a!n(%BC_KTINq0xv&C<1Y4PFvD7?4<9uQ4gC>uka+#0xiqWFP
zN(^l4J%Lf~)_Xk@#=Ag5IB@s_5}sO#19CJxJBkKog^mU%383Mrl{lb8!@ujf(49IO
z>|H>^Q!8;miH3hyxu<%Qjni0@PxYoiZmcP%I*E`SBk@$P8nQ*zS|{qGE>A*gZ87$m
zTkWtjWyhw1@K(tdCP7qps;*6kAv}r|Nf_0is&CU_B%Wkfav0U2s&ms}B%YMMjJEwW
z(e~3s!%mY8J55l1nxy(PK~mV?dLKX4`nWg6YN)q(cVbuXPVDL3$sN5rxu16@ck}M#
zUf!MD$-7hZ@$Td<-kqX{cc<v!-HH9XruDCV4@-A=^9t1+og62*l>mtIN&%ee5E}U@
z>v?vyva2(zm3+&tRzl<~@~g1Ohm7p!E%(}R0jznWiL!G>lFCo(T7Ba31LdS5kllIE
z{+-tDE~ieeN@@96eYh-9$7J<P3}>QaVmPB*kFs5Iq1}38Y@HnLx3)P}9P>I8^?bxi
z`N$=CkkM}at4Ue1{i#d|&m0uIwjzqdiA1wAN`>PsIiA8Hri$=E_HO&_79Z58VToUm
zi>LACz;~tQhUaIIGa+haSUT3tVFp{#IUS~dj3d!_6-6SNCq-2P8E=d1nRlYAsNzUk
z6pudZl1eFJR3m<EiV;7x>We4sCtC-TwBNN*!F|4>kpc?tK0jom1I*L~v*Y3eZzu2z
z`lNqhY?m+1L4`5+_t7K!MNBajxjeJ+Jf?3(a-Xio)W}Hg^R+@mn#3v|Yc-!Hs~+oh
zpC&6G>$RUIs~=PSA-`62er3qdkYO<)xvfOxc0xdIEAhCUGMHlBOyenbLLQ!me|#_t
z`VafeXa8}I0j;Mt0Gagu<HwbR{qK)YpFP-r{28Cn{+Bv6V*e{swCk%YT1fcyRk~5I
z@fr#-GV*oF2hH{}J0AxG#xBfDi@iQP+(QdPKyZL-2wmezEF;tR@yg!C*GDCv-dMA9
zt7D>NM;UQe*b1ncKWs95fhF*44@{?D?F{gG-{)lUdqIC0uNNH4>iSF@$DAa*m*C`@
zKAI+*WSSaO(Lw>5SraD8j<{9AIt)V{NKrGW_(pioCzwEOr#zKJ)Hc*l@}mGNe|WcO
z5VsM`piGQ!XGo={5w+74J#!CsnlsM-E8FS1SH59g2c9{t1ei4cS680L=KtDrwEugU
z|KI*2$2ZOy&;|C7woXtN-#L8O=59ibw`z#y!DuqV@;t{S5fKjAoT3lL#((8!iutb+
z=B;Cn_g^ckKR($1{u!TH`d{->FjF0q`v1p9LjP+#d-@>%|BTP0AL{5|!Uru+Jape&
z1ZATGoBE%BZXWI`1xN)Yd26TzA(A$o<xT-{7Rb|Omux{*v;`=Qug27GjP5(M^b~Hi
z11V<(7JgLr$a4cXf<mZjeiVt*A0S$Ekq3CNrNzZBqVczhLBIF~2)!+;I=|xHe8j4k
ztn@~OY$FTN+7dgzVamb5S*@fMLbKDV#Y%piE!OM(5@ev$1>s09!tOX5l@U|8oNA26
z<r53e+5fZ5f8~CD#yaMB|M7h7>4W_LGd^?m|7d(Zusf0H19^2!>i^Zm{{Q*f^N0Qa
zpYqY<KMG}Mh%)&T%A>``Cn+PH%}?YZX7P(Nyk%blkCoO-4FC5PV|0|hj65_4S!~>v
zJ_*6bigJ<ow`D-N+fZg5l<{|^$YtMO&4B;%&s_8W+zyO!U{8AlIAQ<)JURbi|Ns19
z{{I=DgnCDh84kAgjMuFb9va|nQr}Ah3Qquv$q{4vzU2kAi(+`-rHZx=_F4x`rd&be
z3wAnQY@3c92tS7MFfP2lN)ofX+eW90U%yTQstCnwA|!ukPv-5Z`CpdzmiP8<rI|e)
zZ=PG0qb?(Lg)lVGjyGKz)fIX@-xv(W<>>Q#`UmFR&>ZQW1Tq*<7Lep&Ait(~Mbp+X
zeHB^_QzD-p_aEaj8j~A=h8jo6-Wvn&jt_T@qmyH{xv3>UMY<yfAWzly$QtCA-8(#Z
z6Dd5HwR8%K7!EY>=fmy5W%h71u)?QtxIByY;tPKDfPZ2aJYOp-<H;;eA!SJL)2Umi
z8kACO##RX@5VN)F>1tWo>t?kIx*Mrm&FS+=v<aUT5!y1arI9T7UKqJot47DN2hr}}
z&N!~C)eZQUecfc&?Bz@HFcJP*jr>}R{CW{B_dN3RDV2QkWJ3{rok=9JQ72O8?zbQ^
zNfqAWxWmyn;7?C|TtV>e2Z+MwT|KtSAK}_QzLmMA^&qi?(DcyS5sHXwIXcRTN&2*+
zNQrjSwHhKR`M@EbuRM4l^3aCDe){6M5qtS#n8Pmgdpz|TASt<$J>~~}qc?C}FVda`
z@dKy>cJej0e2sTwD;0EYV){c?E}r`y`$uD${bQwASiog(ofS8|Vi`)2QO6;7fLK$R
zkO$})nXa@PEw2*R0)^Sn+{A8w>wP8cO(pOvMAfYj93f}KGoINS8(pgidrG6T`&hba
zIkxcaoQ3Xe00}y@k<u+$ZZ%mhT8cl(l8+J{e>@tw9v%td*%N>4MA0~8iz-DWMefSU
z@DOP0m!|Rhw6%BAIxx2P{xv&mr{rQpvWBy!Tz<iR{yDn(RaliZ@So7{OlR;%Igi)T
zwPhakgYunw<yI8GD+9U2D|3-o*@*mJjs0GW{eBVq-FRNv$Qjof<kQtqB#~pIYXl-o
zIzGB|mqb}?<xYwsB3h_h*O<S$p*^d7G^X7{j9Z1Yqso*$!^73zU;dfz{0{>{@Qs>p
zoKHLjnBf0q_1Wsv`1#+;%8w8G|3BlCz5hpV2Vy?Ajn}!S0143CvjG1OItNf_w)Wm_
z{o0m-7A;!}G{E}Z@o;4Ht-u&NfZ#JMd6%x;B^g#<0*wUihZyFdWj^SI<lBS1J);9?
zOw{mPngii_gkEv5kr`Z|aS-7N$Qd1)5<4#Ik4?`6Vl5x=^i7X2UAR}mS6;xb?7@Hq
z=x!Pp5on#jfwj_`a_%36PBbk3s@x(K3dEh#BqNlO2AshVf(*K5V8Uv%RM36`Ys!J&
z#bo%i%&m?(WI0Mqik74=xH5IbV#N<8c!(NICjhp|5M{C!T$6A`(eTr6=o|a9HMl8@
z;+yQ?bZ<{Mzat35=eR=~`koMpELERYm+jc9GK7dy;&V!t8U5riuu_HI_~O)5Us~5A
z8$_I}Go?z;l9fjAPOchj7MzSU9d&zAyBP##=fa}qKnKgd7d<hl%R9lf*5mj~bcG{&
z+*#%Z!3?JbTN(x4GUJz=qNw^o%}?)l*#;<$$_sVgMo6oP*RV#Cgk=`3u9DXtq)%&x
zKe-t~xf+uX20E)tZ`g8_SHXO3jW^PdHj-1pv`T{+TkKg=wE0`KB&=ApWg_LF{Pj&d
z4l&G5XFN2<BXpS`5jT-O;=+eR@eYehA1;2lSN-`#Q&KD~lVPP4PHOs>)zjn(FZ(m7
z$YB~SSSRS%$H15#^v*=c2w4@fR7_hEVv>BtZh{V*g@TheLzT%DjZzi>^;(gr^g6!@
zER1&+*aOiUc=kaIuV@mOn668>)RI+EQp&Cv0bGVkoY>EvWjO(?gq<5>09)UIS_#-o
z*yHf(qDTm@c97#(S4`B7tD}#v=;+`kg>ZeyDPT41B2rgW`h%3R6q$^eIFm?~RwLGE
z(y-P7phX6{Hk1WseiD;9x_Rn(fajI^(FIk6gTw#B@K?uW(Y?|&?GIYzxU`57k~c$@
z#FEpI4sRZFCWgZgMr=7kd_|ifjnn9$0J>?Ne0&}(%jNCT>QJBXhMAquFj_hmf>1KA
zf-+&l{CPa$w25qOJru_qlVvH_BxhPXvepevMBPQ=COXmfLmElshCP`ooS;&eP7%h7
z9@1JYJDR^fO<9_RRM$If`qd18=?#9)Sg1^xU11lY4<ONgHKQi<P@)%j=j6`37*-S&
zI%X0bq3#f=0rON}6H3lqK#5uE$I!jBy4j0T%6P!(8SmTZx<j1gqd}k6j~}xiM7!|2
zKE$Xma|W4#Jxfwqjkbjl|0DrH;T<CiJ8rBNa67Z(;&Tj+pvK6nBCj7`XmB5jaVc66
zMXyYs4NQ;T9m3`Zwq$02A$!IEd&By|-B*Wqqwg|Plv5&vFm%ijNC&Gc{6N9}PLv`)
zov<J|q8NH&>|Zc^_sA;|gd!5#p#Zxb8<sL884U=@8I>rTSe<x!U9CvM7SZKy%!S6m
zbwHtaz?zF4JyDqA(uG1#3@|J(Nf1COZAivS$Z?!jipDOH#D|iYA4yRpP){RrVk0d}
z_8@wyzLGA6ve4iloLUs6Z1^-riPq3ihCYsxP+?cxC7$bjmM+HF51e5z)5$m4l{Fa9
z6QMW)u1;6*u)!aoOVk0GCzvA(_d>$!DS(e?=-W=8BY=U|bs3#8h$Dy*Vsbhb_x>^(
zzz7Z4XUDw)^7|I7i0fSb@bYw!P%FrhnWEk&xSFye2q~g*GqJ5ppy4uTb5nLqa#2uc
zF(<s~J);MTqwESfek#D*!GQai?N9`-UO+su3W~$21CJM6R!_ia#3QHG@aK+Q<uML9
znOjCSUtQRp3*Mz3-P{Pzew-2>H>^WLL14b%*bAb^&Z(D%CJG_w=C0)jo_hnM1O|u+
z3r*KzR<DQNAkg`XOV`Gp4Um6Wo{K#PXaGO?iI9gs6Gm(%`$+7Bi<)Zu^y@NWon=wZ
zIY&sW*J@*yH<I*|f=O%YlndSbYE>qW<1&qhX2`zFh@X7^?QS&YI{!z*ekZ`lx9BhV
zuIK;HpFNA)e?M=mHXhFZ|BO%e`G52MN%P<YV-%lmpR{w&{}Z73wt#^<v^#hQkO#%h
zY9>Jq$ANV{3F!C1B#6<)BnXm@odF6cpRO<DGhoXZ4^gnFIRQ(x)aw~Y#+Bt*9tG)U
zl-G#oQM_)Rw;IpmzT!!(ds={HUC$#IgiEYRX{_vzK<kE83Egt|70}+%TQY0{EZ+x(
zN4ntUo+d0~iS=x2(DmtLhR<n*UAt>}Z3hI0D+f}7%c+kGD=6F?!8*bbthp`@j%|l8
zgy-v^Fq!9kQCvqAfP2`dgzh@Vjv`-6^!tx>eGLuPx&A{xZ20kqMA}<t4oY(R;Xsa~
z2yn!Q)oL~R(Sr}`(Z{x#O`jlOe{?(NCVZGFK4B9i{p)NCzw$ReT&bYl2xk!}52$bO
zdmz?8Q#9Ch^azFa89Oj?+>VWVo|>uyS+Y)w6Mkd8f!PPmrHjD`EOP8jK3q^S5tYeH
zF1mLLIm$oi`4ERK-dbVz(yom>WDiC@gC(p73aAqx4FZssSuv=WHB6{qVZhV`DKs6>
z(Y<tl1<iL*Q^Ertpldv0m$s>4vc+*gC2X|nd){*OGpqTdiyI%3KzX!=u6KiBTw}})
zQGnVOa%)+kkQz29XFxkz`SD+IM4;JW3<Bog_<=R#_Gak2npeQ%8u+jQ^<ljGim*5q
zK__=Q;G!+?5DNlhD1HEUmeVuG18!HvxgsY3XNvrl#S?s~0o&*+s{~R8wg5_zPEY}g
z@b6<#UD2MAE430g3=iRcfkIm(*h(D?g3PCoyR?V*$LE1`vkv3Xt13^Ma)4gIIEV}-
z{D9_-dwQsv&J=K)gL}6nAo_+T8pw}smt2=4>R4$`uRTCh@Nz`2Uk-6znS6ggc3`80
zw4z{&A;RiP9+rTbP%56F(<m5NBB%sz>N+sfVSpp%^?1LsD#aAmI){8Xkmq^wal|>U
z&NfuAiUcBZ9EAgb^Q)Fp(;;Fdujmplw65=RDdf0LRZ)SPOYuF<csZAeM07}>R?`8p
zN<>eFp?BEk8zex>t4HM2HF&X}(Hcq1IfYq<f_N2vgCjFuBaCjJpSM_i3*y020%L4w
znGPR{R~ElucT&0#)-c$2!SaI#NmwflL&YH(q(vl(F#%M>&;b7w$+DAdFEWPJ%;YN)
zEk}HA^6z413VD2fBMW<0=cY5@@nO2uIe4P=IYNM(#Y&(N&T0=@9a$Z4)f3ADSrW)9
zfm6}dUn}zmtyokBzs3c~*r!H^f*<p&YaG8iiQ!2b+Cacwmn<wCec@Xc#t{QhDsbu1
zRx2G-xN!0H3Z|XVQn({{irEv=1o9DIPtaNwL33$wdu$x~h{s=MmQ59Q$HZp;4};De
zjgi?6qq?Bjb0e#<JWPu&m7(H*3dK4*7!S|6*)jf>U=&&i8xisw)Q&a<sbLN;QXaVh
zt+F^ok=n6ig9O$VK>S3?_;iLrF&a$I9pmELV?Vf~K<IqjTMZtnq5+B-3Tkr7;@Ljh
zs)tG)wu@pe;#$`2de}iaBr1KskF|Bnj}WuW_-+t{Z4cK<%fmyC3O_LsmNrA2w4{wr
zY!<Fl7<Y%b!23}}Jd#IXsyy<b%6T9H2$0nAM;QJQ>sCXbMh=W$yYI+z9X$C-ZxgM2
z7;_YOF&=P4-G7@M#KY046B=onzp!8#sLO4H-cPpL|158x9v|aYXSdbd+cDm?c23?d
zvuI-bZEN?W!piiK=qfAMjnfL+Tc)9?aC6qQe2%RWKARGIt=BEsXl()D7DvGt-;})<
ziI|^LhS2Js2a_P!UdCIUQRi|N;tX=zdt0w1wT)~DL0eX>>`8XDnK&~V6H>ICK}SYY
zwh#CBTPG*Yo&5HMU}=rg`0*sO`h2t*?TV4NoJUkf3wKWUk1%3WeghR$TKnQmdXi5@
zF8+*$MyXuRp)I4C|7so|PU=Mglh(u-m!9Mjkb^s;c{+8=nKWfhH?nLIEnCe2No!by
zFHdr+&PJOx=R&fUvxv!R(Z5;;s;~Cm7~9R(o^gQY>*=zN!>3L?jW<uSsmMl})wqzt
z<t$P%8h5aJ+*I8~mi}CDy+3ZgX=B{sbaHsH)HZ6|dXh~{HqwkXYJ@Ilk&@Mc2dR|m
zO@ES&G6N$gv#fdRhh;Ra)(Tx#u_JzV5j`vjx511bfsOI9j<nwqXjL}t_gs%#FX64p
z!otFmWuShA7ZG7RYI*Az*K(r@Nq8C*hBV}a$QwUNLs=c%@XK`4bRxLqC8ku21PV@E
zg<l&Atm4By)M~Yl;ZOXBPRr!6nYwD^mqH7u4bfN2cQy(Ov5pX)n%n<eD2rDymH%J)
zXzNY03OY>!x+%JBA%qsN+;|LQipsX|+Zev%*OW<<4N;97ao_A%x|SgKT-dtZZiH8q
zdl;%x#3fr+J2#VEf@*99H;4?QS@MHSP|411#|TP3>HNOY8w*SCs#F>&bMN?6q=Me;
zUjR;i!Yg1z9vvr^gk6NbzY==q?*qdc49j9)7gR6-DUDFi1FB(v;{~&}iSwPh(DbXM
zrUMapEA7*zG(RhK<^I;70PCXK(S@Vc2|rb(`iN$2ZL`GBDu=K$K`Su9cz#-nIR-a-
z!vQ0IAv!fLjyxAOx|X^cT@Ft)IdAxN9G+g%L?wfIGky^tgty`RI>8umon3+OuD=Zf
z$N)ppCurDQ$q(#uJ<`nRA_)`Vh2aDk<hVSE|G%*bd%!=?roe?=eMf9W<)9FOXqCHB
z7(;kWH@1>z@IF6;m)@)Jz5`o246e1I5mpx)7&HpBio@+%`^M>9c&=mrLE~_p0Y<qA
ziZp0pfslMSIHHC2N#mnd@oT!Jq2A-O6b~cm47}rdTy}Q(iwLJ`4M#972-$RG@GBss
zfPeb{(tLmG$ar&nczV<>D}pLIMaW8MFOFByX54SiP-|pVEG!JXv4;H!C!jwb%9kHG
zb<i11v>sssf@dMPp~b^H&+dG_fw8`?MIq*INa*s0Fp<>+S|=fy{4jt&HNhihl8I$*
z0|nEaaxCl(JovJF9ghrJD}!0!qCo=+Pw`85!T>G9)#`?9S1|nVm>;Nl7LV~O4|n)^
zlnAh^gkeRpP)x}`#>hZU0Oujw!dr*H_0);6&s%q{EMs_(Kr(pIyF;9Gfr!U1T934P
z!iueH4NUa5VGb<6gXEL-GqWyjntdDGBmR}`TM`J5ay>HA!2@_J6v}D<y6ylL6T)oB
zLL^jjjRNA=q2IGnz+CtLn#(=Q9O7NVMa_0H>zL&K=f@x8@Be;W`SHR3<Dc?L-2WdP
zH@Eh2)0%SOujQp&mK$<>2v?5z7wT!HIs<;UE}S5$dQUMVa#M3L?BDoxZYoMaK4RXt
zLr-Ie#twWxc(d0`;QZg_3BC~@$E+XP2LGl-_s|@dITiMAD=;2Ca`X_iX$A#x4|&Lq
z6pV)k9$)P@Bj{>1#hq6+27DL{3^HTAekJh4sMgTPx9_R6zZ!Y=CCX7n*Q<C_Ce^J1
z8mBoTIBfG!GZFt5T5kKObpSg8JsR@)XJA+z3JRl;mwFYEM*i#YKpz4_vvX0$e++u&
z&x5@rGx5<vO5WwrAnOvnx>?4mbVXW3ZLh$VB3G$acve0%1G*;1g@1#x@OBApm90S!
zH3962D)&j+1vTKERUiXuhvOlde4#tiy%eej7v^YWIm|M>!3`Nu%X>4zZQ_y&ni%(K
zKXQHAyw(c3H+y~L938iQ!6OeGKkXx$XBY&?Nt-SCV?I8(#9$5M7SB@HfQcp%=;4j?
z`ibA%rAd&T=5Ff%H>niV+`v<Xv{{1rl*wMGfg${oaeGPr#FiT^cCGVqpKYep_4@P;
zy*og~B#hw8?~5f~OxQ?4jy}YUE~xG)h}-SEp&gptOVEFei!o@iN&MtTM6&4Z>6_-<
zwFwU4jb=(cyRE&wyP_VLf7}@O_B#dt-qyc<HQ>uX=c$AOIxoo|yfQKS@fX_+>)Ad$
z*loQrv|l*{<Hj_FRx}{JD=+vHEBn0P>15Pk?6qFM+1|ddipCDcfyk-r^Z=dw&s`me
zW?$*sDb>Ix5bqDR_L}YOI}cLKNSkeV5Ip~U6Uc)>8tRk1J0l+RhcZdrLRY#Y`fEPq
zQ}DkR`q3RL=-|V6!v!tr(ssvbOxoVse%mw-U+=YkX&s(U%P_tgpE_N)Ge(nqd}4%q
zb-7r8$iK7(?g;bn<cZtHh-I5w@z;2aGfco3XNXVpQy#811Gf+Ro&rCy$r4j;+6u9E
zIPLn7Dx%xKm>uIy^JM$zl>DZRJv<+Vc8n~qGa4Io8V4-}ErFY$`RIiJP4gj_d(up(
z_RV9!#&1(42^p(Mq>>aFpktc9)9}n3k2X9Dt?vNZ>T(4Nl%Ih(D3N|Qxi1bpo&_}O
z#Gads(djsv;0S*pmq0aHLZ$Z`fP?N~U;0_&fA{csyJ@t3Y2R%c5GT<}qfgcj2KOG4
zQs3*X?SJBd*TIf)@)q`A(@NE}6N+&Erj8`$+W&X$%ju(kP2B&luCA`d<3Bw6@xlM^
zpYqAJ|KDl-l56zO^QZOt%cnTmBM;r~cwq5>U^t;+G}*Mrp>0fu`wsBM{s)cI@Hkgq
zKG=>hBwI#&eVgowDB@)gkDfhiV3O&*xZFE8eVXb}Gx?5O7DY^6E64^CHOv9M&c;(f
zR>o6Z5pU72pdo09u0H6cx=py=A@O7ti!a2goMKa&*mhlhjW~2Yi~T;fJD&$P{OZnR
zAQ)A1`MSc-`svJ(V?HMXFo*rjR)2fC%H<%paTQ+d2mzhno}*ExkYws+LR=mI5bRca
zuHlDYgN;Hm_Y1dqB2S+~vu}5jiw@t=NN1DX(CH;e8G1m*(b+*ctcoqk@9Jfl;5a_q
ziuih#ZacAn=>2>|j_z{LQBSNX41JZH?Wre;&<}kPrNb8%WkdIJgW1FJU;~y94_C+Q
z7tgED*J|t#yGS^E#Zv;HZCSl5M9S;|?&Vu}YL6GU<TDBnw1*~ii{;QWWE^<p5(Dc7
zs$6ww4hxs(!af&|&Wn9+w9PJTDD!lc-<gO5b#A4`hrPJyyeYCWQZMcUfOcpGv%1&J
zGOss8BbM11vIb=L=MAB`L8qq9<OT0+^@^Cx(i}h+{*s)ozNC>*kzQmo288GVnm4Ls
z7vJqUnj1nnbv7owr6YmzJ)f2TCw}Hy{{ybQ^Y}h@egC(zwz~3T!vA06Vg3J8KH2O4
z3EzO>W!CXQ{`<cK=xk5vM4TwPZ9}VPKD;($x-YCcFl*2kxyI1M3vdC#lh9m)FB%I=
zK{RPYozp7AZVrJq9{i=0^Z<D9x^>Xz=HXRti$E~T41+PT6|^nKr5%xx!GaFN*J44G
zbQ!zgTwoqI4A?iXF%UMVxT{^&*R+zN!C^}YLbahO9R_d!AZ=(mX5Zp(jQBft%&2|g
z&ia;nK>5Y8c)@<luxTAUnLy(Zz$XmwWnpPZ%zL$5p*IA=1qeoF9n#v(T^!J+MUa8q
zEAR(iqk$FBqj}r^HyUy9XDd9=E4so`=1qWBmd1I=6*=+3eq?$+Av8VD<Okh058CRu
ziC1A5k(@`N;n%+S<N?$q^aeur&yu*n9V6rA+c<jS!gWnF+NU7^m5HZP;Zq)R8)<v6
zdkbv3B1c?Sv>)&|pEJCxuG&%0^l{k-#SN4^T>9<d$V8_BjwBt}-?t(oN3bLu$JqDL
zL7}-B%5;SUi!fQLNpXEiMjfWtjW_}jx%8GFzsXW^3JI?aIA~O1txj(FgH8hQOA;OT
zz!T0!%s9t44fH;RocBAnBfVG3O8qgtR*kg)%hOoq<m5JEIi*e_C0?&`EACmt%=&1i
zNBt*EY!TI_W6$QbWHs>;hLE%ljPW|1x6vK|lyNYFk4i(1SFIf}0y+cBbjG7>06Hu+
zhL+$)9&JgwNWjan&1s6TRPk!b!-u!gs(s!Q=><}tg|y3q*XY6E%TWi70w0TX&D0%}
zY`l&Pc8xvP`<z$b$n^t+F-C|Wmox<mJC;E=4>Ha{!2|O6DnKG`ShK;PP3P!4BLh5F
z&yQ;h4=Vp(_?b)pmv7^_1MrD)z$cym{kXE4^#8H;p#T3FpKSe~Kdh3zZMJeZ07=-`
z5swO=pxi2uqad!Z#AKxwAqtQ06foshUt${fU>mK1d>u*j!c4>LcFS=EMI3~XmrXiH
z;>L<SE9hKc0St8TSky(!T}`4}7WU}e$i+Br?rptq?o3OIKR%z07ASBZw20HS7&VHa
zseBi73|upp9g{03Z^D{WV)8^dL4#D$kqDSP+2;7=jQGtJfeC;<boaiw3EMS{@uvA&
zjQW$WM4j={HA>VsX-G8<CQh;BN0_;+6Pq<4^oz4JhssJl0Vw^5GjZ!iuCgT8+(B1d
z#nA%I(>15<0*M0CoR_K!$sia#%S5NAETh;g-~fdrF~s3m+$aFEHq?^<AP_Pnff3?#
zk6yg6=2TIh?#i;dlWTgBU<Kq}m~zE|lzLUey`N|g6NYx*Q@$^GBV?UaTU>ubUh*W3
zk=!vd&yTq0%vIm@R!XgXfqT=FjgyXzCwd!8h}pZVPV=4rL9>8&)7}A2SpT2>*od$H
zYimEQJgonJ#wUKXA8P4sd^>o6%RY~zMCT>+bVuB}pIg$PPxCOcjJHxSKF~5kTI^+?
z8>%|u*H_XtFK#VtbAV4<V3KfQ$>U{^utR?VAQ<V@jW|2md3Sic!^Ff>XNVDC`h^=l
znY5uFL8@Hx{tNT4C21hRQWtw<k}r8a^bw7KmGy-2OE{IBv779T73`UQ(8QnRifCv^
z?vnV5S2wYo%E`co(!ZF4v6423psi!1YLpCD$aE2wvH)tZ)t6d7@B(Q$K%YdgptZjI
zSOG)VDM^}*8|C|nXZO*8u<6jV4JL3gvX&6CJ;nR{t$Hbi1a$c!nW#w%ttQBv;5bv~
zwe+)^>=mM!Jhek#v}1j-%*y;Yt|Fm%69ti1o(-!+@n<PwU#>IiGJHlwZYp4goH<3l
zBA&ajAWri58KW`M23*V3th(P}$YvjhNCbMjR{lHV12Zzv(kc~BX|)a)4&qVeb$e0x
zN_^l&C&0uWk*|ZIouc)M?rL}9^uQs$-~MHrkxX^)5tw*xW%m2%SO*V^BXUQMc`gI-
z-w-u&2W4sNpmoyP+H3u*dAt#!g0$gyAsJ2~KFqc0a;s*Hl9Ur7he+YM63RL;9FWF=
zzs23biFh3<3-b2b#^LFSLH<;Cn(v$K^f(#%{FdSsZ9{wz;N{0DLN`8;v5Al4D}V&z
zavyoc>zi3#Ac97;?a3Jgh;xVajH5bpP|r7}bwRTbXH+eHKu5%VqKpvx6D9>8*^@?f
zY)nVTbM{caoodvE9ryod?_C?)wvmP5=d1lI*!0;{N@Yhk%XZvkU)OO`pLLuZU)t`r
zJ$fjKvbm8&m84?3-JIY4&J7?)f)wRA+3s$%+gKuj!C){L41l>P?qpsr$l0=%jQA>x
zOR7n>%S;+pZ5T>O1xUE7Rku}99vC6aNp?X>KgPIhCF+apNfqGCno-2kdZ(G7UQaQ4
zb}1r=h9F4yp-x#5)FM%)wCGGd>Oo51s5EPJ6m{nj^6I^I)67pKD_sgf+)HAk8NG_x
z`%z8i&ilgYqXzeG`v0Bwe~Z|ktY84T?EJUa%i4c*o6XPXzn|n&eE!QRT1$3sQb3nT
zW#TqZzew)<*JAe8A%~zj`NYWyO|E_MH@i6bi_JkRdAr6|Y&#TN&E3+;*>eCXf=m%S
z{W1k^%hlk-<l+Yk&gTs07^3fzjMSC6Dh0x$2zygEa-s#r2S#I4v^Pb&%|RHv^=23w
z7tI0J*?^Cumnc|bIFh6F{^?8fD>~ReuWfE_)}4O;`+a<P*6$Nh5g&3z<c|4l6d$AO
zp^heyviCnbKRr5mdGzA1{qGKs-yEJ|O5ZPU@~`o^rK}>ynLnY>eaa}(xpqU0!xyP&
zjEk8mq~77SK*uANpqb?8h*mf6B*w7@Hg^39IXa^4|K$u#WVB}`hH4>e74)5?stQ)B
z$pU&F9Q4nQjt@`Jf*-Vs+PgXk(0AHhu-|`qa&Z8(O*lm)HswQ4a!q?Tb4(fV#TW3R
zL6Mns1-+fQsTWpg)^m=!W;;}>0HnM#+;G3hIoc*O^yKt#|KK}}K~_%^VwaXvhdX%Y
z><l~%#>wFET!&BI7onFRpivAxcX)*(11ooF3pL^*I>2RoFi<KnsVP8cX@+GPy?bXt
z4Gnwn+hU5#q#CXtj!ru5{3a7isWjkgR3Ao}pC`7<N*Qt{m<_fB6KHz<QX`^Ns|*UF
zd1QCcf`hyz2qp%SJ-c$|?2nK&`%deB&TpkW6~vPDztd@F@;`Jy1NfZ(`ICH#*Z-X3
zQKeK6Wwmg|C8x-gDGp`Ibbw|A&I9402jueb01t$t2ORB&PM0wiWkf3+)}v`k@-HX;
zawyot5oj;rx=k^7BiJ9nzZfa-bpH)3fjPOC?=Bu*yuiifuzz-Zc=*Oi;?fzRWPh{}
z>iFo@(Rn6}D?Q66o3Ks505%7shW(uz#`KN`fNVCeU2-_!m^+t~U;x_<a;K(%yK|R<
za@8oxk=$y5Fs}0<RK5i+-&lX|SX-A26>_$pFQQ#hmOH<3gg6C2S)c+>&E>0vq#rV>
z@)QFH@wdI?8LVdX0{<rN3f4edcA`>1B8f+Yc>O>T(kU1bdXRX)uV|`z?Y{Lu`6D09
z1%-JqVk8Z)4RmuN^$mljdET7Cop?8KQcHm$`_q~`h=K{GSf!u-%$Y?pII{>JQQ#%0
z-{)G1OAM%PsJP*%)515%(K1}j=x!9<Vn=wlGt(y1Nhm2+$SD4lq{>=^m#id^-z=ie
zO&eODJNi3FTe>Y`Al^K{Koz5RF5Mha+6jrMj*e6wEH_h}FDkb9wZ418J7?fn9c(<`
zjhG3KYBvVT@VzkY3A3gmQ}yGZPuTaN(@gm@v~zd@AmSv-B6J@p6G<`ynNpjXn9)$9
zKkH*T3m_U=9xw}#WZV!4mF?q`R1CXiGpOK2>EvURPI3fO{#A>qyu@y3a}0beT~o*+
zNwmF1HB41=MQ`FI)`KMr%x6Qw)jxN;|M!P)VLnwo0a~X2ZFh3#Kb_`h{qK`}O8kG0
z4*qg@TJHCwij?~M@M$6W0Mp^YzQg=OIY%N~Dm^zMmkWvsx-kl_XOt)a6cl#mAXnRo
zKlL#-!(W31IdTvTy3b;l7lug*H~8upPX}(D8NP@F9#_ZmGYl@^k8h!Qf<`H7rCIVZ
z35G)qt03`tF(nEeNl3H!$Ei`^U0esvHV_=`p3@LqomRyFK@P?gH<MDH7{~Rn#Lv)a
z0F#$!4^)bnTF2}V`Zp2l3TS{SMC`7>c$*;(zS!no@{{o<V+z43=bOt%<O!{7s-*LX
zzhSOT6B-|$)2oeVM5d>@9sOJgmb|eW%t>3rV18?9myJi0=VT~A%}WtHKc|Nl_=2=*
z0vDiK79f91U8ETOk_#0H{zWe17^FhE4mlhG&e?x+gbCPS84lwGIsjqJF6FN~lN=@(
zxn~xH<UKWUDY2S2jjWEv>y+RkMc|Euj`T8>6*E=x8>dP443Z>c?B9?^i6zvt)RhrE
zd(VH;w_D`A&Zn6U=7svz`4i)Sm$40}_9so)%Q_eOdz5XDPwgmy%(cgnH=GA%nFkKu
zh*MPN8M=xcsTcv2{0WJ6>BS^LLQKX>Apvl|$TY+>Qxs(2ItVG}5Tz=EW)Rd_phkhG
zCje_CSO7$58No^8vJce}L?@mK&^F;rcr@7o?(1;m&o~b(xw}!aVLAoo$Zo&|9PJxq
z3@CXFHx>n1wqs*d%;zo?gw`o<iNvl!kwE!qYM5mW#e(74Ro5Zj^j=q;XYyTI@|5TU
zk3k1s`<Z-*;C(H54^-)c%GXbAocn#h1JC>QdUBn1@>-6q(h+0$T9O%n#xpm2ZBimF
z9QN|Jmlo4vQ<mOAG#N8zZTYNOON)V2*V5J!$rW%p&UU(_TQU2FXU$9f=+&xRNge(W
z|8H>s`Oy5YomMYv|GBl@`>g+clFw5AZ)I&<!T&ocx+JsfZ1v!<bR4*9lGf6)zbz}F
zb~)vxw03Ko>1k)VOE2Xnm$CM+7cO)r$P|xKu*I8JUe>ia?X?@J8e*wX*s9nxnl)gN
zFd?oLxeXe5=gBlF4dRP5jGW`CNK%YzMrk)WDmVok#}g}9WA_KaJ5N+{s0<Q%$Pv)Y
zxZ#%035^=M7h*9KO@eE~AEUn9WW-o@%YCVpDUr;OmpEw-PRTRHTu}^@+sqQg%fv$l
zxAE+9*q4Q(o}ypcw_71nB|SXa`Q#kEQ=O{j;eBy(ad!CJ^k^z@@y3mcd?mu8qC<UQ
zY=9tp=<8#6SHqt@Vc@iT_?|wp;*9Zy_q@%zVYtKCz^YD>9*{=xB=PuQPj_sZCWH9%
zawW0yLMIoEAd?NZur=}mf0%P&*A_#m7sv!P1g3mR>RBb^iwq<lagz=>;07_)(tb9>
zt00KP=_PSANi`uAQWm!vyDH*L>2*m+0MpMU#V8Fi(<S04PIzePK*q-=^$t-arK$);
z!cyoAFO48jlu1?MN(rApBcb=}!Ve`7gvVkeQaK350fvR3T!-T%-vJqYxGLroNn~}T
zj98m-UO{cHY34?uX9UD0rCJXF&IX}7<MtFYSyJ4yHvX<9jF)929Rb25J@y@mMZoHY
zTv0q_G>DIju_QXDm<0o{{CzQd%j2)OMO>_yC+Ibc5Wob+Sp{H;e&UY&Lf%hnI%pwV
zQ5&m8sx<@IwY4d1iM^QNHXBI~*^2r7x@mx2*0q$;xxG&-b}4aNLrjYBR3l-=os}u=
z&tR*;-jy@tOfQO~ufOJnFvDA>*f%{8$@S3rT1H;XQ#0$7xh}{IB5}Lg3XzY6v2=w<
zEeqBt9QVI8Waa&{rxM!d;X}OwaAcm`62OUM|F}zl%B7@}L=Pz)3z`ubDU>j(txNY!
zfV(%uD_Y0Lj8!1{Vo#EU-ORmNBmomSBnQD!(O0>Sk!<NBFEC8`sa3QopXuNFQF}qw
z@bHi%gld&wq`W#T>qH_XR?!_$AGNF`NqTo8&#LQyERD9+VEJ;Oc!~>tqq$ebi>hnd
z7Rdi93qYk6ASLoFwwf&SxvPoPt|s+M#6C$|7XF6oO<{RWio5_Wk-!AsDub&CVWpYe
zk0e%dcvPgS=LN4024xRVWRbNN`I-%{M$c7TwMuFUMx#O&J;T1CEzH63{@Iz{X0EnW
z;}NLv2g{*RZl$IU=T~aA46mf{D=1Jy33l~J!Oe<oVyBtJcms)~%Ik+XNz*$xOKdBx
zL8o+Qkr_2BOpMsss>>ESS^pAbzA3<k`>CH1>p$YElrNC8A?o*NHw!f0D`)MMxH+#@
z{IR+DS)Q3!nhJSo{eg3V*G^+D)Pzu$^}{+5mZ?3TdLn3!Sa|}Z4?zCN6CvU8brren
zGINxdidsfj7*Y@lc#~-|8qrU-A%G&Vv`JWtlpdCPqcE|=ic8;Z7`2vPMPv?!KU?Vh
z(LQ&&|H)^1ipuVQ@RnzLd#lL)r`gKc|MYs>t<U#ApW^f77kD4@IJ#P2M`PdUb~+$u
zPv`%^p3-^nfB(M+|IgWTMggp^9&GoV2kI8+|NhQp-<vt+^uzjt^%3kNKTq~Q`sZ%`
zAFy)rUa67^;4=TuZaX{wx0;{r|31y9#Q)>ygmYk(`+FFrO7BV8pdPo%bX%IW6IL9B
zmcjaalCZ*j|9g_(A!DGOWbl1#rt@{whTZ`+@Es>;_lB4+X>hCaJK(LfW2SLry$G|;
z>k~G2CP!-xHX#Hkw?p(rj5#lZJG-Uxwx}UF95@9eJO#ppbb-LRofSfcdkacSI+1gS
zWa~9EY<^~})T`SDZEr4R_RL2kd8CPSVj)jL5piNQb9K{wD;;i)$ufzcFnQRLp9eY0
zkrj>qWz)d<s1*^hg9K&ng?=!?xZTiWiXyCYWMJ@YHgL>$Q#EAtN^)MA*7=kmCQ?`%
zq179LGLD9nA{axRH%s;ex&v8P0V;W^l33?r$m8}bGGd$)vC>_jB8ByFyW_EaX;FPH
zA`r5Sj|p*-;Nz6?O5l7IWn;`6K&hHRR6E$vBaaLqj(3BZv|`B}K2<&Tq#!0hCpg6j
zWQP{mF2TVvs0`SjW$0pzi>{vt7`8@;Ik!3eSe~=nkYoQ*o0Pl7|CPK>728<4{^#t!
zx}ElC{r{7EN|$W0!3rwdK(RUWb5<5y5U^1U5<-q&>Nt-nGcx=3j~3#HHoQXrFOuA_
zY>&tdakRi729*7QYU84XaRD%AL@Jdrzt$RxwB^+?57+N&{P{U^B$7(tizZ1>9?wLi
ztnvY*d=lfDhC#<psW3`^ik|#w^u&1qh=GLEm_BiSe(<O0=LbK}9yD~tKIXkW?Dre+
z4Ua?c+m~K_PXSk9mvnRQ*EIU?(MtdnjaoD1`%eUz1#zF8@4b<xg7K_oQsU>-bu#t8
zZoFH$;}?nBKRM4k(&&<oSL^gzDyYC-Wn%c4euUFVrU+s@{{W)c$Uyf03G{pEeOWJ=
z(fUQ5wZBfyiB)Grj(&R;QHI6#BBI-6#tI!HT$m)o#l#JDKnYSxIX@d_)=0&9<^f3s
ziy3Any{=I@>%V~a_0-6wrb*RN_-9M(`~BQ${r`29=ugY@e{Hv#+5DfN0DNBmKgFkb
z|Nr0R(VzbNc-fBs*HCl<=h%;8BSKM>3Q6?qq<@9pS1#Fj*Y(s>-fPB!z(t%#zfP|D
zl#NNx+4t*NcxI$afQ^q}?&Ix8x~w;u>ZX4U)z<{=@nSZ#B0cl2HQdx<qMmL%(|9_3
z@3Lo+Dj8e^EPQJ?E>!j=0RGpI9`o~h@*-848qyfmELfz=qcOD<N+9Y!)N&A&jgl&Y
zi`$<OwRz~h%M~}Uf5P?F)5N<m8&7pNg@YAK#6^fv&tgN6bCg=MAwh^&K_W*8)wn@`
ze3L(GOGo(F+Gl4pU{qSX5=4HT2r6kVU?u~o&}6!5P3l1FIW+c?l`z+nr_>X!YAp8o
zatf@{Tnbi5vvck^CYMp^o4rqKsz0gHW!<sO^9=cHR4XJw63Aa`1v&EOdD}wejPAOG
zh9!iHVKecs)2YH4w^!Q9(3=MDyk-4c!nn)XR$*5xopOCFBB-UkP<6xFc>*kUX$g26
zmU?NZHnWK9a|Fa?%gP~Y(Zoe4+xVU_vPoZrL~*V^r7U}AjI1Jl?_Ll?h6nW?s=jkW
ztd(EwSpKMjToT$S=9mm0zw^S#tI!a)lPzDZy^?dw|Ng*$aCf`^zq&{LztiltwsQJ^
z`*Z%^Px5&zAvxZ-J|4I^-+AslIm>WWW_m3203Bt_a!;V%iFfV12*N2I-ko`q@y0#{
zc~V6lP&AA<o<~m}Kfb=c-T-DmnZF!Ho5Sg1(;F=w|8F$$+&Bmy&)qpp3iv~yH}D!E
z+MJKZ((VrwK4Wp?PkcALb>iz_4*Pv)0@`^4b`{Yu^ao@e<+$RxgJ#(TRHJU99X-Je
zx?bq>eH>n}?E_ceMt-Ex1#E|Y>_wgz-fTicoAZc~e&>7FBbW;qcLUR7{dpAlPg~8+
z7XGi<+idUd>^uy;`BV6>^$_LUQ{9vM{j949c(i|e^IiYDzLre<3->T5cq(V4+cowu
z^Q&3)P1o8ZC{CL0p7jkbv-UR=N=s?()Bvs1AczamS`Djy2(U8Xk3>>AcrxwBw;Uul
z%64CH<78;*^$Nd03AIGj=-0+GdApfZuG;`cg#hu7R7@25Lg46WVG^)lrBefN$Btmt
zbT@FEmvjP)ly?D3PzN;El%P*7-VJ@iBu|TS^r_FK=u-^4r&4qo`gE7wr^^j*RM2cw
z{<iS%a5|Uf4TT5`rDw~U$?}ox39wj_5Y76&RrVg*uB9;|gXCs%Fr747fg4(?e`>F(
zyMeZ`Rc0C0l*X2f9W<uFOD)vclO`>DpYlHFs+t(NJwc_J-8AYiWtEC7(r`lJe$6S^
zS7Css>5fuQsWi_y0AieIC!RLK9#8XRN>y$aRJQUCIkTJ8UTr$)yAqxjdj<W;qh#)@
zsy3^+wQ92_855o;7+ygk@&^+Phh8FpY@@5>0PX-%M~10g6B?lxy=2bdR;+JZGAE0d
z3u8VSQ{eF<;|C~7uPB5)>S5I528VK2{?l~k35psFlUO~W`H}PD=*4TPkABpkB9Xz0
zvIQD(2vD+sV*4qI8akirz*+!Y>PJ9cs0UPj3$GAxLxRO20{A-#%}@4KE>}_Y1+h)X
z`9T74sxWObcBEgDdDaXstH;ng3Y;1U01TgtL(y=e00T$C7^)^5qD!FS+NS{O`txAE
zn7Fa0@!d4Y``941h__Z&vhfXKGO|FixXR#)d{c0#nnh?Xmzr3!p%xje@;*Vjg3Q%b
zb@^h^Z!cd8zqKNKOZfsx&B&yrw9FZ-D05e4X(F}+Xp<iz?F@k<vLv;zXU3xP#Qj-$
zc3PN*=X6D8F%GcRvZf#u@{S0N($P_c1aOLt<lXzV6t>Ga$-p$xd6L>o_-aY*C0zC)
zZ7;38oC6I2X<n>`1WB;;K&RBeEE{W>Sw8;R2;*Qd?#FE2JT}$B$0CQYEY8Zk)YH`#
z!XhC|P0Q@1AP}j}i!8Y7EE9#jbbFK~o>uIta=@}FusRa0J0bBY<^ql)kBLQQ4MNX-
zYqXh_K_7{WHD~IlOF6T+Df=Waw=zn#HT3DF+N`^{u`9CajciucTspxJ#Kto@!Qqul
z=9yL3DHp~mU@5g^`L43KUa9cUY79%2e^d2G#h=?TW>~2(GN;uN6(!Rtqg`XulO}$i
zSIU`!w!@$k-*JmGS?PcvVGdQVWb>Qe8CkcAOGj#=PXtm#3k8{F)Z$ZhJTHf~=3x*A
zwYntgy7Xoq=Aw_ZWr;%tD8ONXI|c&Nb|@MGndD>4>R%WBJ9omK40AVhr<gc_5^t%H
z(|`rks;LmM$yhROZr_dLP)_y6{tZ)I(?lJ{{=Ciw$qj!^75?%|Hd&DhIQ5l8lH%x=
zZxr{Y^Z2&3f;!wy>ZrT1Y@L!S?yS6#Oege>yHP`Rp2Qi?^TOu%ma=~bM5U%3-y(GN
zZEG>Q88##a$T6YoV2urxHN}xj81m)F+yilVWjCS(9<*(BIS`{tLKo%O>yqTdQszoc
zcU(|1-PV(=jOPqdAR%CoB2A7x6^v`iy+U1I8?Tw56JE8nXJgt#*Av(HnjunCI#5Al
zYPf6-+88NqylZRBJkB#hA6Zp_^7TDg-S<*`G+IqAT~_N_p3^g?*dN+6)i`vlf|hSl
zL9n7t1(BBFwY}lhXjH`8%SDmi%?qbLoEx_nX{Mj0xxV~V?;JhIXlfJfUA!H|-tyTM
z`(!wb9vN)oaoxoI&7a%~0AeUrus}H0Hyyk(PR<5#(OXN71sOh`28xp<)*U(Td^ZOX
z1R7g487G4pU7s>Cgt)w7>@)@l4<+pcwepzZsQyz10CyH|aMUz9(*z=TF6NWKzG1g0
zq&q<oAX52tZ4z8Mv-+k<()>wYDQl-*JNgi}NRL^vr)pSv-%tT9b0FDGh%R1n?!bJ}
zfOGR^$$^j*k_}D81{<kLi3YpcF{DKRETwB&v(8-?ttbsk6o-T{6aWkoW^`{Q-n#Dv
zAuacaUGrjZ%?7`C?~o#{DBm=ZXq2=2l{^+IklF_hM&Sx&k(sAdg@oob0I?H#LsrF=
z97`mUNW6wa{;^76(RfKtmz3~Al|wmQV@et<;El%^+A$bQ<$-tQz9V6ay4*3|dr;;W
zEu>k(xf6tl=_^QF+Qc2@l}RY^laS&U5!xi0DdVoH40{W2^dZ8o@;a{AYvpy^jIC+A
zHmRZ@P&DCH<pKaUu30SV#B!;KFd8Yzm|_2{tjn=~UO6e6q#tEwR-BGSTF~+xj@E(_
zKABHk%p~||j)4K=WKAgL%LEpc)f1eSvqyMAICL@2=LGiE?DMXtDc%`kjvA#K_%Vfa
zP*txzog<MoBWV5Fqp5@eDoC5~B_RxAqw3AjYKx{ZC!<osvYDXu*g#UP)Me)=sRJZF
zi?OI1%MKm$t8I>;miwS3tG{`inLmolA8o3j`N@;?l3#fhOK4ZX4??7sCPzXjebSen
z9ZS1lPFmxu<f~@Zc4~k)o_B#*pLpY#mL9Py6P0+nz<vAd60P18=hvk6(<Me%NP?6f
zL1i{0_*7NM$TU>Vnr={qora#izyQszGY=v>q$67aoZ1wF9cPE^J^a~QI^QDjs-u+#
z%s8QB&@8VdGdWI!$7H}pQL*$5K3N;!%-`f0sMi?+VO?v8YTW(R*8nZigsyu@r80vg
zE^V$JNhdY!QyYpEaLH)vOPDBqA-$xu+C=1b5s4frT!7PZWLZn*B}$4mSz(jiO%y8t
z34QcNX!)6b=7MqA4Zs&U0e(;WDx^p$w-_@uzY|@;<7#~tlghiTGZlHBrmo3#)M$Yj
zL<zTJwbV_Unt(PQ$xo#!*QNz5pXqZ6!>=+Cv(t7dTV|R6kHw*tC69fHNyRNCYx)1E
zs6WZ)Zt?%z$Rm<h3jnw*{!gpj%Etd|bwB(6e3DN|{J;IP!~XeS-z>@fmMWG{{|$^X
zz<@rK@mv3hEs4V6rIeu*;L_l$!}I;;`{(=p^Y7mDpC7*1zc@aJy;SUSjIXPCANZHD
zd8zBJBRsLj4Hs*P7$81!BG_heT)nHsrN@cvB}|z|jjG^y@Q5$B5LDz1@e-Ea6XKho
z)Hel~iq|$*w_#hbk)u+u;YW97r`-fhFI`FsAh|>p=Jkf;fS;14E>E2rMnG}G7;}80
zmK)VE--Oz9Hosy5Nt$0pA{v4Hi}Tk+BTR~Z_TB5_=O`uH%L?`Po6c4;Y~E}!#rTR=
z0t39KPP3t-#U0bZza&#5x*}PLs;d5`a~?P@MQy+GFRz@_vonVhk<i^WU_yYtcF<>Q
z5n*l47gF;#y-j?NiA#V05!u#W&hU!T1tnwdg?PvY73y?LKwuu=us?8uIbEug(JvYH
zMwpEOw08u@1LJ0goG@C<budUaV8#j@FAx*PA}9ot1ifSK&>gRl2O66ItILcTj<g^~
zM|B<_<3;Wi<MhC*$+deMJ!m-8<EcA(hv{V%Og<mP+_sJj<y82*)bJ3q^XIA4YGmIM
ze0kf>zQsAxr^MRuwzK};$-j-41<o_(|9|Kj`mg-C)A}FHF@<O4HkPdatyVYZ|GVA$
zy#9ZZPx1PH_U7oMbmf-<x&-~klu1YX$47rVJav9=Uc9$uqfZhV#2$zK!W8t#R7DBs
z>D_R?=;N1b*T?&a-`BsSROjFAe}C9NcymGc{IGv?zP@Ju+QVYFJ;N+w6M#IS<nIn1
z{5SX3*YNKR7ozZ9_H3(!07ynyTi$s!M%8(Qe<eSeKwhYf)4opUF~@8Xx~I-J&K751
zz;&|b6BdpSk87<9=bLYwO!+#z{Q7H2IAkG%%21T4#>wMURwNi?9D)81M<<;&6h0#b
z<~%sRqP+J2<V&W|T10s;ZgCgIkBKInMD)uAaf%ExrTs2l8JIsluL*zX&z<By?9wsa
zY}Fm$68YcU-pb1Vt*x!k^8b^3isk>|kLQOc=M{E<nSxn?FU%6DFZsP6zld~^D76C=
z@ZY_D{g*Ryd0E3_rd+X?r>}p&luUgPKF^)n$(u7Md**C7Ep3+j16vhgYD2mzkLD9U
zu9KzH5XHM-(NGc@b1h9S`-1+|z3Fqg{urtuK)zXbF#8ZmU(od9YtNfyBB^_6_;i7R
zPiNk>JWAV79=}wi#s2IcoFBnL_u}YWZ-aZ~@;5y$1#<Xq@gKu`jsMt%$)1h>(*2zO
z;gfty;y<32$A84v6v_iP#f8Bgbwovd^jZ?k<JZtD2qc1UQo%>wCv6u*XbdHk;;*4T
z7)}SkrFZot=!0sVL$$%Hy^?|w+#*%b9)&7Y!46Z1)QVb9SCtTj%d2t_46|xBx*(L|
z7;83yROlr}ILp7?t3*mOc3@FE<pZHA+OeoQ64{`HcOXf&Tlu%eB*~Jqj3fxDyrab=
zv2k$`Nv5dkW5K@5l;{s~X8G3OZH679)L&^(`vbn9Q9o9y>vCQ5ft59vp=Tgtt6z#9
zI(ci`{=D;#B5j@4dH6+YhS<?5kwtk>68{~FB|t`cUqu*pKx~I7D3yyghSz~J4CcNU
zDUAYyuBWvI-O{o#W!fk-6^$C2Ao&_8zR~7cE6G>;xUOkSGR3skS+(k9Sq3)GB%fk6
zP@(@MP@qXZg$o@GV1arXsO}HH`y%V>mb`*$48YQ%FBHtWuJmW8sIbJX&5nIKieW)l
zay{W@lPlss7cFs5q+=_0H`Ted^8V4F8T~7ZvUvLMdXRDV`(NC$gtL3t|F?R%{4ZNu
z&CX~2|5JRH-2dVp^7N#_4RBI$of*S+l|)-<^ZA}COqS@F2qttM<ttL2(Vu?VTVLn<
zVdv4HiFO}&G+W<G9^zkA`Z3$Gq|cqD^XE3yDa2I}yyXnK#&3W{ca;Q)?R_(_%%<v$
zy$MWD4E+$%T)9$|sl?f>t6<K+bl&L#%-KB*e&HYe!<_(`rex%#aEwiWf@3*F68dqv
zK1pW043S4F$DU;JR*yq3@<*&0$&)F@gBm5jXUHb0hUett@U|+R^B{_`e4j16R<1@S
zY2~#jFFBh(1VOrmdX?){J-P0G4Z2(WUo@Ynegw2c{`Z=_Z2nL9(fus{KgFk5{=eCO
zd3aW70mzoblbJVY5rK1b)4_vGEQ05xBMeP2^=Fc7k#;bg0tiYELw_EtL_ZYN7Haih
z?VtSxujlyo$#}$fQ##}=yjWYS)mSdn<?L3PuGdrL2!K(Ru)`zbIvpyp-wGl}b{%Xh
zG8%y_N^FMcjYOCu_bYktrVgQ~vHj=IPun<;Yi>Q+GS^sM*K0MrGn~gEBI4GahtB_M
z6m$4QI1@4G7R^9BS)NiHzKJ9)1qwfV>O^@Q4i1lwk4|3JqU0P7P=KG#*9k>3jng=O
zr_7~{!Tj#x<>9IWD#)m+wt-UbjKNZmvIC|uunn5F@Uo9w@_Om;>E>4+!W827GK?Bx
zb|{UJOt+fHgJ&kq)`R_%{+o+acyqk}x4-g8j%gTSC7QUu-8%DyxHLshw3yEWbY)bN
zQx&f9m2%zr$3OHVEgu;CtNrKSAHf>-;`H#aj`P@H%PbmdPV)&$w#19qrw516GpNF-
z4&j>>Sqc7qE*WT(H_o+tOSXV+INHFfSit!K^uypfqU)Rh+872?G>npKni+x$y$ycK
ziF-!@wiyLjC3J_k?3Ch<lX8@^5J1LXMU?pr17y;9&O8iY@KyZB2lK#>0_f5MP@AVg
zNS13cPPa3%61?^>Oo!ynO)!g;p(1V7qu85^ftw<S(JOa$3%zcb$4k)YET*{WBg%~%
zErwU?<Q9r?KW_Z^R;OBYzQ~UF!-ufvUNYv-U!R<x93DQW(m#`8SFuL_Z-=L^&+5cj
z1r=ZIzX9%ey?=aoc0e+tkhPd`bV@og@8B&5sb(|{`$KouCuZmq|35WXp&X|oN*M4>
zEGO{i*u`(s3O?AY(3J3RVPk@OwdQhmoO%ZZ4_%C>s_X=t4OBOu2bdU<@^4-m7M!sC
zKubqS7p!3zri5Z^h%ol~Db#Ur5VaJ~R3^`1C#l@FRz7*1s&3ZDEufexV*L))zlbE=
zu^4?ys0VR+Gph%2Kbihe-Ek;5KG}H63tG#DO3J-=(k76?TWCG|>h<$OeF>W-vD(pQ
zcD?3i*La1OX8q_ErtVa4clR8MU{Bf09De6q`xM5XWC9>(*)>}>%e*`>$HBHqmMdK9
zmTUkU%&U)B&Zun<16s^VK&icsa5+`4R#pkMYNeBDx=MMTYt?GtWT;kh7E~`g0*zy|
zm{z3UD5zeRHkNW8VvH8dEaEF-9Y;XT;~b>YJ!nS1|Mxry{SW=zY5yNbqrPOtjmd<t
zKb&~(Y%#Z=2`u&h>2=ck{|>(Yy#N0cA5lB<lm7hdd0(EPx5)nU{=xC#{>jA~JPPo_
z5EfkuOftqhuIP$lA`Q^AmY8P58h0>5-(}nwMx)KE&Fr3iwN}-t*B7Qkpdi8M-$}HW
zdri_2-zJ$rN4k`LiGmZKuP2MH{~OuRK2}VP0#Bp5fBeJ#U(dt<mcXnd7%AJo4)J_4
zWKoPN7}@}5kYH=x%tKI0NTb`6R|2s1Q2K|KzVCHVja;|huP;Rrd)iD8Qxn)g9-Uo4
z-3YnSOqURWgkX644f^Pw#z>Ga#)Isr6@XTPht@-{l-gFYF9`^PDBQ_<WrBDd$DjyQ
zMbZL@zB<8<a=;SOa0rLTuqu}^74!8Y1-VANila?H#j`lUu$~OULp>SZFCB)6Pv)_u
zckZMZG(}zI4B84j-m+qygpu*#Q>R9dm{IfW&HVEIv+nRm`rPgOKMcnAcmLb#wL7`{
z-)`&k`u{0DCFlRAuU}L<{!bSy%?UnT#NG|11y{Gkyb96te!Mn_+n2-mraz5u_SVg{
zdJQ+x$aj0zr(%*_@KTgiG22F|qzm#kXiaRqsdVJx@z<V1M+C264RpwZS6g-S`^emg
zM;0*DXOM@qou6FRQV;89?KHBNxar%IgAzP}_b;zDuHBd-P}12T7Eo)Y6$A_vwyQzB
zz~6W{Ldx3G>Jtov?<CcqLj?yPI?-Y}#T<+-8twaWF$i}!TucoNPCYtdfrps%294l}
zrm4e>D>qC4a1^kg)}{U{7_=!JlrsqilK^nQlb=~I+rS#mVBt?jk$HWToG}825~Mf#
z=ii|<z4NtsaMt>T)xZ5A#|foSqXt*?f4Yo*@#5e6iy69id!xqtT7CdiY-k5ZL%RYr
zE{{B<tP0;4W9TSmY5-N-Xc2M}OlDSnpT6lhhnP@_9joKezr6H9crS<03AAf;i|{di
zq07$gSLD|adZ64-MihrohadDMQn?&ID@61ZF#$tc@4S#4?o(3$kD`Oc<(2Y`Shy1_
zEQWFIV<dBrL!!ezBLaSMNB*#(-6(WLDhfrYi&OW;pDrjpDQK}_0Kb4Lur*1~M?6F4
zPyrGnUB&`0c6wcy+36{r#2QEx95-_EQiRc)2WU9q)9L**0Jig?yadT*Qo%RAUjVHv
zN?{<9B_o{VaF2P8Bxo2+CIff)R_S!`r@`-I6sY(F{>sVTVm@+Ny-UD|B<2SC!Qk&O
z&>6D^K5xt)A}#0`k>*ma#Z(*P(DS5)k<o<4HwCX4)*vP!&O<n0GnKd@h&_7e4O5LG
zRpQVcdg<~|Ce;9oz94uDo30!UjY?VJ@?VGN>w-7KBip560P2D|kTYKcq|`f+L+a!n
zZ)6xxn)|`ro8he@j#?vi-dop8ShlqD2vF+3x;Wqe_V_UK*0>`eMlhPfL?j+vVX8rA
zW>L*j$srpB*&0{%i<;;6cKRiQg$)2B*3`sv9t{^Ea7xs0QjbW=na^m&p@PJRnHN+%
zp*A0!>V=BADb4G~Tg4poE5%wq9nfa%c@p4L^;$ENIf5u5@vuGx@zMs-;46g-|5A8M
z*|MUToX?Lf(m|D_FDYC|8rkM22qT`vsp7);a&D2r%A_}~s9CcxTbU?tI)+8~EmSaR
zX{vchQ`JC%0#2-4sciq!7b?133cIv2nQN!0V794rUy5qc{ZJ{fEagiHM@3Q)Sj#AF
zgo`X25JTi9M@`wsEp4@_q2uFrnu<vsvF2-Lk;|26m6Rwk@v|4q8}+5i$s(z>qdqUF
zHT#Szzg$V}o<8~A%ANNA>PcTc!OPER^J>$d+1e=I|F^r_+4x_bW~<fyy#N0cpW^-h
z^TQWsW={Fy5~2&IHe81<j(#*vb#M=~v4O#kHx&15sC+Pf%sM+ohQgf-?M)Vgi9dAq
z-yB7v@^f)-q(Y)g9*0;5iEVH&<p?8Y4PmA?u;L=3Es8d<(m|ghSk3UMJM)4?G*PxL
zi&<vth&{<YK9J|q_vcI^O!*r6BMB{rJ5vm=K61lR((Fd)O(=O&lF*4`zu)2(jdx|R
z?!sy%Va3=2z>eMP?+;H;kDed)`~BmiZvicOytEkFVl6H7sv4|U_~Pj0$<l(Sht&Xn
zzqHt!*JnpRCJoCN7(;gS{r>r3|78Ew;n|!01F}=32wxN<pV^2;2(x2N{6Xl3x4?}4
zJG>)DhC^agijoL40SfqwWqedPquc2K)~$Cwa2#ygVoY6(_A`Do#r>`K4o41#E%Kx&
zMSi20VFM5Md)^Hjp|AxRMHglxA)^t{Ik4yuwsg=AvIsg2y0|sxxj_t1%@=WPh6IX8
z-+}TUZm`Y(9Xoh)f%E8=Jq=xl(m-LZfEjyfqfHHbC*za3KXYJvG{@8_6wMCPY~u{0
zXfgQ3#Y-G`_RbG+H;>R$=%s@6z+%`!&Nm+#0;AzH9fEf4M{M&VK=R>!q-!Uj<wN7J
z(KjQ-4KPnLV6JcyLr*+<Qc~m=h06r3KVuk3b*2#qF%+L^pbC)7W^*3wekoWVQ0S)D
zZO}+wU-?5m&sgA%8O7vo^(bu?)^<5hjSl_>51sCIibTgRf&ZUBKcxet=ZTr)L969}
z^qBfX;e~guKfyJ7(>DB2y1#$^`qk0FSr*XCg9E4EXHY9ZglYn@9B_0yTNUitUr$m%
z6M0H-8D<~Gtq-EKKlb9`RZWLkdeqP%m&nl;D@%=NF<4&1#IOOp2V5R|3<Pl_W+Ma-
zUcY*?e|p&8KY89i`(gi0ze}cbJg3znS7Qd4!VXBAW+q~uqy9_BW;ow3heMibcw3Du
z=5cx@3_GRHp)|$V60iuFRS3u1;$-i<oN$&JcPHG=ABk`~R>I*?a*Uz2CclaQcIw%r
zmLY&$2onvyy*N5PKRW3j9RJPIRDkw$W7iM+6c+Un08V$?ps`Emr|<j`o7z8jK{U<^
z)Pl4A#mS5Pqtib8`irIA*Jo!S&R1`)p;%=U3>RoA$Rk2R4FF;%Y8^~6I73;BCTK+n
zqV&#+5YTkc!nxM2^NL+4HZIO^JkL<uv2-r-hKrDP=HBcbqT@%EhU)C_-~xE#<>C3^
z$@dnxJ}evY;?f@pf>mH1ot+(?U%Whep6%;g?b~U;nZvRW;2SZE**^!i{!0;5K$Olm
zX7kk{1Hz~_^iSScXfPx`y+i}ysaHEd_UgZSee(MJ^~n)Vul>`r!-liDxmlS)b{MNR
z{XuP78k@SqtG+vkg2^I=eLl8W8TzaJgYWwL-=4ibz5o^M{OFafH+K6uXvDkmqZqZ5
z{TT1uqF7C^Av&`JV^U2+&-?c5c|(u)Tkp0%#N2&|rZz-rh(ZF*k@_n)4%{+nB|#8_
zqUX-%oQX#7!9tuu5o>>(f>t#ZDTSFYggBiPY~cv6C7o&@8jf~cK=&M9`Q?zsmQ)Z0
zGci!I6WeMhW+AoKcKwuj7Y^s!S#Uj5H%ji<<2@I=m``Y8(zeUlp9bhlLAotjDMhqr
zoi5O*-%E0o0G!0)1r$ZP)K)2iNT=l6H*z@QL1Ge%E}c-q8<_<X{Op8a3LHMC=x9~~
z7{iy&=_>0gZBqJ*oA@%GjuMAF2E#$E-atf|p@<bJPO?g2taezcFRVdJ=x5=kcb?fP
z#f(Iw^vDzpH_WCVsf+!CZ%Oc-zy_O=q^VBElZb5KLCueW*090yEbdEL>K&hvMgMVb
zBl-OB+l!YH-x{WVBpKBr(g>IxBG~ys`@<`5_%`CpJ_(l{@nt535KSUfS$jt9P>=MZ
zv-AD)Gu<@p5Th7%Y8a3qU7=%8Y6~o?n1+QXj7cw&5zse}RzP%TzRo@tIOi9$YfQ<5
zJgRPY)x{bqU)m?E5E^dpFHU|qI(crwMOE$tfr7%RA+lx&gAcpbVe~<e1#Frn&XQ4C
zkUVyx0j%Gk5g@yZ<W+GDlUU&t-93r}ya(sV@|Tp#s0IMD3Tx67_3BK#Q^fKCx<a{#
zYJXqM-ah`#3xm3~3onjXInwnPd<WXDZ*UH0A%$JRIzN>|16`dxY;XrXfS(}KfrDPZ
zer2uxqnsU?^~t9SmvBO!1%vvzn9=szRUy@7Il$CbE=-*(Z)EQydSaziTrv|`OieD=
zPAv$o{Xek5{_l(Zlk<yLVkl9A*8zzl(C%;PhKqdQCOF?Sn~9_{b?x;`97z>qa!E}L
zTasG%Lg9$D5+77mReQ8bbr5c`r;IH8$UI8LGbWLE#7gWTGzz?kc2?faeBuxNIB|G1
zavtod;wad~h$F-RRDATP>KX_t7`Q!%JWMZ7<`de>ca)`&>WQ|I7$;{s?&$9>2JY9#
zF~ZbSRzV^@z@>-}=<Jw?agwGO>3-_Q;s!YkT;Q6ar!7EWZou@Sp(a}vc5CB}%@o#D
zoT0F{4e9A7dxkP)DGDd7_Ru1)#1vhN5Ta}b=<!s4JZ0CXI-lGnu9XPsd+yIZ1>UGX
zmY=An;Y^uJROTqr8DLHHBP1kr2pOCc0I=F4v={}>BN)&}x~Gp-|BCb>!y(c}{m?^q
zXDvveXA?3j<5;Kz^ekmBLBN)E9d{<V6Y!{ukI|V1bh3_L9W?0}DS@XB)i8VMjFUzH
zoqF93JnB03XNwz5=-|qkJbHY=>j?PIn+-XrS%%iar-o{p=Nt-;7EHW?)%Eo7d|&pO
zu+(c!1v7*I`jQ_6S!n8By1(IaJ#>@o9;7rC=?#j=7aCyr7RW*tRFo70!?WQFm|$M)
zJV5g$=p$YXp!|D4p0=<wh0e7b&dBAGRJUOERZPnZP5lu}&LK?aJ$>YXuZ(7J8;=Xk
zBK9YnS5_kEJDZCW&=n89L)#36{dgRuPXhSXgct<IP52Rp*2D`BxO0d#5FAw<M|_x(
zpk*H%jn|78XRuzCzAk-h<99<6f*?Unkp>Aft}JFgs`uzk4T_bhiW3(-!IQOvkJ{<5
zH(5r2SB7B_ktW5Qf^miXVG;Ws0JRVMufIJ$`u^zkg&j}MpfU+A$!U8G>+%HjVOj=$
z@Ho>rae`|ER}ha^_9o}$G<M(e4FfFg4$3)VV|2W|rA+2_1dm_8)O!Xx<Z)`R&zv9Y
zIFOO^TQK9Pa2)_|yI}yeombH9jo0cfMBRF!7f=`jODjgsxAnKzCz|bEd9W`Uv4mAo
zBxoCY<%#t196$u2vuh|%4pT?N!{f95_pj)3=-~CMSFksDb@=M_>0h6)wE2pJbJY*p
zwGSV|0{QsebTetUpJ-lQ8U;LqIzLV$@I>v-zlxj`7&_jHCw9WvAlbCi;vQ#@f+Uqp
z?yRch*n(W}ZTm-HrAX5I8R?TqBhWt8c)^Q9Mt<BsoxJ`<>j9Jr=W@Z5hoq#!tn?6t
z0|Fov8^@>!2a6d=bH-@okH^3{%5qfJU5so%N>8LBLO2?S&CSgQqfGHBoG0p1D0~~K
zZbovx%uO{YOoBFly<Ns&${H2q%+L*SXK${q(KUs$a)Jdd>Q>B>C<;%~m+U2x6JX4%
zaK08ntYc26-pFVDPS6!1G^zkg=z<Z=nRvSQ-V~PD4cx8}PgQ|OcEJ*th0`$cjv%IM
z#|3IldsX1*Yeep)O2ZWSQ<xIr<W^+pvXADH#Bf=M<RG;bGhFe>$5KkM4vw+`ts)EV
zaC6~PmK0GOP_Y;@N=30jDzByhzQV0W?PjMZY8|?J+Ba#>4__ReWIB?UF~aFTot*#j
z{NmM{)UgfS+t0KRF=R-QBAoOTfmIi2we#=ZM0LAlBMFohZbg!fHzj6pi9{tXI>dWp
zj0If|WyBX{0%z@H6S$4cX$!>pS)ab`OE9j3-CZ;-2R&yPJ8!*PSj$ICPQ?($>EYS=
z>CpilDUvyaY!d*FD~>#DtNHEG%l_fX^P_#%xp6}sjB7q7g?{>!H@ldV;q?pD-!l8;
z<b_#x63i}hm5*PaytLQGH`(e=A&ez}a?qe7m;%Du8_d&C+$DNTpe`r=U?}I?4#jVD
zYJGKhj=vjDzmLWq=5Ml{#~=1-_R=ugp=23mOK5Qg`YW|nR$EMJlKOHathso}<q_2x
zO+YaO<$qb7=f`J%<%5)cNvtHN!FtNf^s)8wYb!n;-haOThVo?a?UnQL<bsV_#{SUZ
z<VKfXJe)6<Vs{2=`*XYuJa}_a1S*0J^_UVL+*X8l2Ak0rFYpliuh#PsbaKISb<d4K
z$p<Oxp%0NO+jTs_ykr$z9p|H{5`!_jT={nY;4d#vUtgR&?<ZrFZC9D(DVrq%D~Cxe
z1Z#M{gxf#b2V6@$EQ`S())Ke{`rYA=Z(g7BMBwerrf@#~l6?)Hd51-(lLxO)UVxA>
zezEtytwS*x337TCGGfJP^cYxRQ*B=;UXHb$qcdd$XSrmKLkfb>$Kw<9y^h3eoG$l(
zSNdnKFHR2*jf1-a&Hw!L@bvWcY5x>YDlX6p7`Er9{U46bzcb*J8xe~o<{hku@8<tY
zwwe9KjA%D^hu&sX;s#7Pp0>9N^FOt=vhhE+o88a$zn|pu<rj|!{_JsdwZ2X^t5cM^
z|8EFN{QqtJKWEPwfo|-~p8h{?cojJR_xIWKz4MPabiR7>m4pBLhkO0j`Rez1i0&2t
zxAp$3{|CjX>;qx+zk7YC_Wr^8D42PlegFSxpF8^hgJiz1{GY8>r`gTt|NQL#|4BY&
z{{Nu;mizrvfl_~eHU&k8|FTj8KkoA>@dLHgo{^n`gV*OUJfIm|h70zgb>@+`7zG=!
zgBt}?WubfN&2YCAgirJt4{~YkmQ!dvx^cdChIQvp&Q#vhi6|>u0bp~@2G=t**pG3m
zhW^y-J&a9yp&yJA&@L+fuSX-*dX0?wL4%##LbLvq4*lEzGn0K_&E076eme0(2*yrV
zj(mnyp{XMx-g<P}g3p=fIe(cg;;XMB=Y0S5!5gOo`@6%@X2bbDm~3LK#W`qFt!;JI
zN-;^<y&&?q*P-jrVtqhHhhQMZ{UIUBTTi;j_9NKix|DibpMg2QE?hE&m!vdoDoqDa
z80Itx<>naeSlC^|XZr=(RC+h!DUDTOATTa27Ngy+GrS!#vD$P7#rg7Xa&Nm0hjcoE
zNXI;&9!J5ffuU2;;-5{`<?e#bvz1*o>t(=q_xgEEDyhsBhYmrG&W~Q7oH-jC4(zdB
zpB_3?=$>2EVV`k!?)N+GwF|(a)9xSCTCHYhtF_hcw(99(2kBxUgSU-@F9NC8r6Rp9
z6zO$(-Bzd9Zg+ONz3tsjv$>T6X_jwwyY1fYR<qmO+1c6cb-GP#pddn#GS6Pe3CxiT
zDHlzD(P<}k-1OXxvQ*<3hmVq;Q*dk5zp^+^%C0%zVy~MRKrd~v*EL$~b<0|0N7`I_
zzb$GiE~9D;gYPEC2yf0$Y4TU^^_Skn2BA~E7aVd{V!mC>l7lgIH%2xSU+VP9A7dhY
zd-(F`#Cdb^?eWn8y6AkAsUu4d#<`$@nOyeCSira%y(B9(b$#ea{A3C%?oP%V=wk11
zou8T{u-cCvDKK>qPq0T7-wQN5fF-TLmJ6c*!$_lv-{h8WO^t})d;&t}kN8lV2+F-W
z;z~Pq+@7bRUq7xm#}tM%!x%sON-3_9IgA`Cs;Kh)rNT5R^vndlYB2vc<!=j<VM}l^
zP1I*j6GMe%AAbY9*+!??H3k98w_r30+!0|YIEg>X>EZGIkB86eD&e+)(i)~Cqr};S
z1%R@N6mEwzX{(%FUr3vHK@XJedpB%N(!ciHw<Zz~rK3=pPWGvxEN(em>t=TD>gWkl
zXh-ImNZ4CVA_f9vY2w*4r`BmZ8+sgxY$6HZPjxAo@Qf)V3;9K}2o+0MWJT5h;iOr^
zN-#i%aX<k4P4|A!LX2MbZp1JJxF!XNZyBQB7OPDjk@_Dzb^dly15NXrZ(x)`h^M4}
zy?9dLvU7iPN<qs^snQvhVDND#R2sL`d`eJQZ93ITX}*NJGAmAYx#7D?2g5J26}QQ5
zY=<TQ(K$52@Z)54jH{0$^Um;-!l$VPX@xan*#e=Z|MJxV2$`D_2AeA$ZxO-p`U+TP
zA(;|}9+@m-Zzh*DwXR~UcRdZBlKBy0IuEYfeXK#hxG;`LO8~#*O{1r&$E4fb6w=|%
zU+B#}^4E?-*nDzRG6k3w@++v2BpD~61M#TL2CVz+sq<knxJ&?RQEQdHpJoUEF=Ghe
z*QXf*XecuT_d$A7;+KkhCCisd`hVv!NQCJJ&4Tj4DR}(!IT-zieeQJr8^(ASO)<Tz
zw6P@qYp1)Nz5m&2wm;whe3DP``S0oZ>EU7j;QYtZLtwL1E)c`SbH{JJ+sF79lOKg-
zC8LaHo#Pgrjvlw6;5%=E!e{Oc`QTH+R+3Y~EDrVkI#~kYL2&31c$G3+pkDc8y-t1=
ziFp=UW|7+j9sHuLmdiP~jQ9@N3Y**>;TAq*hs#JT+d0S;o^g^z8=jYrMiWmRNe=K%
z9&hQD=^<w7re4p25dnR%2+<5}O5T!W%!J`MG57?<yb*Kwfj?uf6+mbdiCOy8ou~Xk
z+(;R}FCsjKy$mtG(;Qtz$z*Pd;RP8p<vqg08A7|tW*b_2hcPS?(ut|w5ToaiI}XSC
z!~+ku*F(c2b<9gAs%W%NCV9a%>!OnWO&Rp#yD1dI)~Jaox==@a`i}A+sECQA$@vD|
z_du!$!Pb-1UBD%bw8N=C1y+Ejo)I;NG3#fXs0&bmM-jPaXpW$xlkb9SN<pN9s=znQ
zS>SR+Q_VOt@6y#QsGJ#qGlR)H@`O)DihX8@nSh0lPcOJd<#j7=HIcf*h~OWL!#YEU
z$PMx{k*J^Or9`n}iHOmHdo~LaT+Q*%jhP=u-efHG2t9+?V$;X5iC`ee#=YUpCyPji
z3yC$(ASq{B&?gN~tQSNOB-0-DJ11o0?sP40<yEbP`y)%GdSRVD&{Rif_?s7+zO|tu
zF8d?GLX`FGMRP<T+M5uK=rS+YDSpAsW4(r!G7JHl1XQdS^%X59$piIh{}}dor_S%c
z|K5E6zTwax&{uSDO%9(U&`}Wdy~(s6Wgo<Q1yv9sB73S{`e}^$#Y*ak%1?O-*VaT9
z;~7W>hqXue9rUd-WK0xn4M!@KLw>5VvS{tW8h!sMJNCcq5iE07l>wQw`*t|ML%(pp
z*bmt<)<&<KM;v0dRO>X>yMGJS^Pb}WNm+X~fF<|;%}z6y|EKf${{Pc_iuJ#vlY`@n
z=ZEF7|BXT-s<q`EY8yjL05nH`y$MCx8ic`HPl8I|K_EzBylt<MHUtZsETDLmTc_(2
z(JC-B4Qgb5h|ceLhdqZm3Oa`Gi4!Zd#$kn28%EfLXfdE`eV=dg@#e-w^<?B-hL~wy
zLJp9Y;NxK+tBrJbJo4O0%*#A`58OKFb|>c7+>>#zz?D<Z>}n`O*<*sGWW-75!<hsK
zP;rXXFG-kWf+c_T<Oax}s&E2~1ipqf+-L9UKr}D8Xh*ECU5+0}FhMhn#EnyhR?-#^
zGP2PVwk$|YR{Q6FeRFsQkDkCH>PcS3Aly(+$cd>01vrlu-YD1z<}PS{<m_JJ20`@M
z%r$s+etL0meg+LbXJ>h&9U8&ri%PguD0;|IsL8#4<P9gTa<oOPbaV<pKMo3-<<lL6
zbz}+FfW?3CzCu%w;2lvgxTbK9Xa_qPB_T1$IKt#g<X7c@xW@y5!^S%h(Au;;3|$`5
zuv0Kg214c;HPcfF)o4lS3J)ckATh->@p9De8tk*6(sOZB<Qs_2fGIBXb;LWM5(Z?i
zr~5qvjT*z=%{aimcnI+U_!Ho@uioh?x0oB9A?T3~0zyu@u8>eMJ(C4hu{5vqZi0@!
zaZ=xUF_PaKDNHq?Zvhfb=QtIsCWS!_9jkFtL^0Bxwj+V=w9>;<a|=-v3n1Jix&rX4
zC_lsr$vJ2Zn!b>83CHNbo8q{xaxiF-$A;3^2H^;IO$Ba`rYiOU15<~%I}T<ep&*6a
zQX<D40Ck)i#UnJ1`yY&hVDst$$uVe6hQOoeeVz{ZmVSz;N*?I+KI(ypEqG8*wr2r4
z`x2RX8W8*e?tno+0I$XD7;Sjs8f@=}EYzT(jf6Bg5(@`%jt9<)`rYB_tHbl71NgH4
z{P6UQge_A8BPYR_sTqYk?DW8E<z*gv?i5`juO$8)WvUwkdpFqCon7^{fFAoHM`Pki
zlpAFZ<|(c^(!7LAyPO0AKwGbkBt^*x3dZ(|ccvfF42fm=M=_ZwGwb7{6U}MmCV+0_
zRVzulLbal-PgE<*p}SSdk1`Buh5O_K!6cI@-glRgLdGo-3Cl;WVp$HJUaf2z=|RP@
zu8g$uq*1}jjEWy+@RiQ;$p=5bSxZEF6*j0?n%JOXSsvPoh3UkqYGL7milx(e>{jI%
zqvA(09%aq+55O_9_AeJ5#080_pwlFA1=*ocpcg&>rvNEbd*ZpM;qgvO&a3&Qjx>#+
z<RsR<6_j(kWg}j>H_WG%i_3&Dx_>t+SCw@Y8%p<LDez*vmfG>BsJpbG{ERX>RC)-P
zoI3nloWcDwKX*F+8@|0-!To1x{?AUcmG%GG`h5QPX+Fj0e+Pg0uJq`S-<QiNv=Df}
zAqW=3w?ROm18BFMib4u|wzIeXT<vQ;i8HCQ`i;@U^xw%z1Dkz?9yb_|jncv4W>Li@
zyYyl@Zy9+mu9U`+<tAgJj_n*AgM-%>C+G6~4f$aTKupoR@F-~kOxXU&n|Kr-xTbF=
zb@jRp@b`zO-@ZOObW)b_auQ2{53ta;7YBbiJntVI9v`1MLl1+s`Eu?^VIpFQ9x{B3
zIj@~_+&BlYm5%x1Q@z4Y;!Q6v{J09F@8E2$)$k!+^N@MgM#jfs!)ety=o?>YMJhn&
zHDDLr8i#}8#em18%Hv#JgVD7S5)b>*kDZ#C0a00c{nY-YzL!p`hgIHsw|J<LuVwzK
zbE?qq5>g=zQ#i;~+wbdZW<|crGoRoY=-&E!Y<ox-i;wyK+!zMFDYiqGw0xQ+#N=!>
z)=X>+XJnPIXFiFpfIHvXo{iBVE%n@=p$%O6S?GaqiF6J>LXaZwQ9P&;r$7}eH-VLy
z1&ayXc_!P3PvN4dk{ImKq~g-+Yi6iX5LUxQNRecc`Z?Z@RJ?4;@`C`%rV!2snKM}S
zaoSRF>dypd#)J^_BB~eEE#fP}kgTr#2>3lY-zLBYcR#|vd;BQj-beD)1j#)kUA_H3
zsfLs83h*IiLURYgn!=g)EKfh7hmdpZk3Br4#w-W!B`snww#W|1Gb)^@I;kAGb9ab&
zdJrEi8)n{hI`80HqCfo6=A%;q*l@BV#0f6#gQT+583NzljtHKY9^V}qc2K-7M>?;A
z$7!C`Gyn*kzcdSr7Ki|64%yM5y$P@88Gte8moOrwBYXIq*|*8uDmlRTKwb%IXw;u@
zhGGu5f&NqaXq`i+xXIhGi{1cu*FsS#DM266iJBmBsT2<KC>1<2Xu_hfm?{G$St>Xf
zEuBoyHcl>%k9n=qql+Y{S%y^lsT0)#F8aGl707h_){Xq3DMXAAvY?r;bi{zJ(||H5
zbJ|*Qf5n#Rji-*E@d;b@G%);=gI>VceY~O_cn)>J(Tl}~G&#cv!sr?i>5j`L9BH8l
zNlJ!9K9>+NBTNN#3#)j3qGSj~{V1FXne{IHKnSK`agQs(Vp5pY$L}<&(xah)bB)?+
z0P{oZoS|_Ytfk|{gh#hXHcMi#kOBd73TYkznu~gha|x0TwH&pSr8&K3B_-()R}`s{
zuG`8`zHJH>!Q&21s+yJCEIk6C-N)zM{|A5WwEtH}^KNW6_{n^h*#B&`w>w$;?@p)r
zdH??@KE?b0{nNvfea<IQdJd2-cMs7(C<t7oLVY}NTvn1~l7#a&0*oBtGLP5SD7s<A
zW?K_hAyh0kaj=$rc65(U*4pgB%_;?nYTC>$LREn`-ms*;R-s3ex|mu9R1CcpLE(;R
z*RH}~Cb<XrVgXH%)PZ(7W4ibyUi7+p8>f8o7-TX%`HAx3$5RKq)y9;?Y%5NO@KjP|
zt0BW|JdLF+H3XJ0F*l6~^0t<Ecb3^;nkD&0C$c<CEK6<Wf7hF@>~<}Q+5LFr8Oa~;
zq{EA#bD(G7?Si&`AKVfgO#`*f%5`XM#{9HreK(SK8nF`#N(mNhsisXiSpCFEr>F%J
zi*9oF$n0E9Ds!C}+-gHP6^K?$;z47h`W&uCoFArMcuA)~sx>(tD(SLnaSzwtH*ScE
zI>rPBu<s;ZC?5~x_Pt53BT1r=>YcHnUR#4r<3#cXP(#lR@D^KS6VH)1bZ;{p#Lw&;
zq{{zp-Rxs5Y1rsod$9a%7SV(X?OE$f*jLF_fY$bfP^73G4#%LShDJpY_$?bXvmo0~
z=5WeQWQ=K9Ig~Xp%>x;{2RgK)o(oesi1bFvJw~=b$rasR613X$^}!<NWhAgFos)<X
zWI4XAV@6^*Rx+UJp|lTT#HUoVB3Za5_g1_#0E12AoAhZ>GCMi<i=5j`ZpB_54K<ae
z94E_wp0Tfuj7Q?`3E-*Dk~xx*3KFh7lf)v6jcOal^HjbP94<#`WWC|lOiggMwXcaV
za3|O9En2E^*m<<Tl6dLfsNP^WY%zK(MvBV5NhK>1fI91xQzHYjx|SFw6%?+yDV*kB
znVoC=7kDqe-770GUHtajEqTM5jp6ljuAy`hweIib@Qf(0%#!L;=ni=Y#8>lN^D4j7
zh?gV_sG{X#g$kopE2v3UP{q#qxL|PZPF_1eItN3aJbV*lXI>ifM3Vbw0%d70(aqS=
zB6c!QelmW8`0I10=%E+=A_t9_CrO>j;BJ`i6gWjkc15u$5^EFs`O^tr37k0_&dIk&
zCua&a%gn_bk0%%e>^<Q-c8;I2gq76XlEw|Uvg>AB<Uw+Aa&dO}9G#G6a`J#_QcY>*
zJTiWg6FA1y;Mljo_JhSGN7lezs`yX7^VDhX!Jltb;OP{|I=uS&Yp$jo#%nc>KwCFk
z`^o<W!#znX4vb(?Dnb#llo+KhJ~SY1JOi=Xa2^<s9-vf#&kslECx>Te{nP!EznI&C
zhLZvry0f=^k~)|ZuwGYA<mmW~M|u=zL&P=?)+-j0z>l0hK)HN|9-Gl}@^bVjn2-w_
zuY}|-#6amJko?Kh<4JbODc-^SwW|zd_2o!|Za6t=*7uC)SxZn{%swKL2JqF;)L|)1
zOvt1IBMwwWmXF|a63%%vuO}B&)?TO}C}yB2418dT;lewibia85^@Hn~7nby1HS=h`
z!hm7^?fW5u5!B;m89{^+l)_u101$5OnIezo&eu<!8<QR)50{VylZ=0QvIuTTB$Ol&
z5|c`yRX{2on*$b<8;rLUemMO$h<*w(5)?o`dx~7Ymx`)KzV*RuBiWSW<xJ!}8o`zx
zMj;9@04DuHi5Tf~1mk=`J3H|nbAt63k;)%s_yfC+<{i$ahmH-4SrU)FHd8wdbt6E=
z(~dR~kZ>QY`Y)R#!y%{vNO;Q#Lx+qphF&fkWnC6D>OPX=X-+Z_Ov~`50<5WW&?H8W
zWnje<$QXxW`5;kba&q#wMfIuRq@vE;ML0rhA4xV=YGnn{`2locks<oj>JpQ&zi)x5
zu2C0ZJ_ehOSh*NwPzWo3U4U6d(xROEWTaIqf?N*SWNtCB?_K2H*9dGZ838gCkhpCq
zOPqIZ=({rzAS|6Rj)^|#HIINtB=R;Zi_L5pDwbIiMm9`Eow5r=08m99s$$E;VFf*#
z_Grn*6{g#Yia_+6k7mRC*H|4iOzO2&w@(4DXAU7uZ7o$W%S^Jpr1qT+-v96xb5rBc
zFwn`KAI}Q$Sx!DapIMD+njzrN2hc`jMk#63SsFF9Qol=Yd{g&KpKpHe>2s(1-?You
z(l(aG|7vz}_rF`M?&tg8Pw^?f|NVCV>`*!7mtFv83a;o}Qpq{9(v`5~qSrZ`4!jW_
zZcC<ufp_W8W)eA({dfl`k?3R;xO#(am9i)FvKZ5q1TjBV%3LVXsU*U|cbNUvn&Uiu
z2Zn#;O!5Sc&=?ti=1hFvhhb{~i=NA=mVrRL_6Tj)lo4y_LLqg>fGHg)MkFU_qN>Ux
zSH7r2&ZJ+eNBhZfFiGjJ@B(p!_rsa%Av`1wUAZ1nwy0}R*0>bCh{(a4GZ&L>nFLkC
zbabXYs`CbIgxFGhMpXr2%8}QPGZzqZ-4QMzWOx$>c%2_{k6cd4PWS90w{Ri4^x{-z
zcJ4st28k|^#LgHgiTNC9GmOWSPR+b4pyc$<G#IHkoOoEgwuVpfbw2{aamG?@K#V)>
z5cbov*f`Km%q}q+9hoA}hM3C&+E?Mbs2>J-kaEYtC8(G26&fbsfFrsp7#+qxp^$8G
z>VB3Z97J*vE)yiq+(}}3Y``E+($a?>UKmCkKu?XxTokgkIsSo;D4sm?FkWchAe#e7
zq$h*&JD&9orarhra|ym$mT8c?tU!9$<^~s6hRdEir&-T5lP=?wvCkOA>gLo_+y<Zk
zKE-~J8wPc=aK;)D8BZn`s~Ck%&ijqyY1MCit+bas)7MqWBe`$P+~*)qa(3KEWyMWH
zpYc`J`y~c-X(|3$zxogP+)4k-`r0pPV|o17tp3+)c0c?7eUeYH{&&tH^r~opxuT_d
z+OLyUHMz2~auw~*mO4%Q!?#{YilJycij7l-W#o7<B~@+_@;&*+I0#}&ameYUB;M9I
z<V6(&FH!hTG=ss=SG1r8pkbiJjI683WpQE>MF_~^$;%wxU81%%Mqf1E8PokZo$=J_
zX$PjY<P~4SbL>UDgpXKZAm7S~^YVZza_6Dq<*?7+6Gh}a@oYdetqZJACh6oo$BDOs
zSq$1-uu%FRL3++cK(UJOYewDVu%)zQ>eiH}pt|M{#!NeEj!fW`j|koGQZ?nXG3U^p
z!FU{baiW&`CPL_eq}T)cj$r$ww)|vT10*JQ<P<^IBA|#}1@RsZw>U|-ppwV&L}KF(
zVT90#pQr<jLNGL&&?Sh%0M7yCnuWCumE@Pn6iIX~!`9;02?n;TspvIz^oM+#9<PxX
z4MTq(2O;0#B<5OUJdo0?%OfYT@Ia~bR1`R(GZ#sM5vho`oTxlf8a}GymzN<1#`VO)
z%N>S66d6#GMkLCYn}Aory7FT}L)A|@gGZEwFV!wbca=t4F<XvlP16uigZMOT&)8}q
zzXW=QC<S(n@`S)Nf%jY*eQG#bG!nCcG+lLERNd33yGy!7x}+QF?hfe=kyuiY?(Qz>
zZdefM?vhx#S-O#U*T>)c?|kOY`A*)sapqjs&?!3((s8|%`vlpF(WUwMu2VdoN4IxK
zB<LjRWS-CKzQ%{+ns-iP(b^vc_F>!K+e|jeQ0k^`x{wTVMNjtyZzzi=8yOE+fWy9J
zmF-ku@AD$ra(tlwC6#O^(vBu+l!%ZxSuT+_j;oe1P!<mT^r%`_%SWGWHxEA($E!KD
z{AGq8AywLQUTgV;u72L`dfMk8$Sp(F7p!I^gQc<KcO%5fyVo0xbL$aGg4V>SreSl6
z?Y}xVRS5Z;>h4>+N4C+{t0Uwk;*tNM1$X)GpYM6^pFRUqqTZ%Y??i^)-e~i{T}Hi^
z)>D5DhKlc9_Pbrl$T&I*hmWirgjUYY>U1ItWLzkC7L0Tw*2`9P4=UM9*$PZZ?{;vd
zS2b!6aOn4|0hR00G%u-!6Bksz1t2adfUGT5+>EqCXiXyfcT}9N_>4T5xvB!Ld1)Uy
z7*A$gpXRVY>AnKzSuxNfO!Zk+i=#bq?4-smpLL~n02v5@0je5KaQ+P@`BvvRzMfFJ
zA`BTRr1Z?Y3oQW;OBd-<vKk3buZk@Uj`Hc4opuyjLAEb;EH1_VE3~c)yjFZl0i8>P
z3N(rTQtKFUVJJ(V#KbrJP}q32$<p&RISz+i>hS~a_G*TQVMg7sb}3=s<9Q^U#^@1W
zo7<1~p|8Iw7P+n$X!C<Z^?CJFF?ebvDERJrc;$;leYQzwcVjIchcf<LgQ4}J%#wOY
zr7f_6>p8gx&YSzwZ(h2G7$5Tfw3j}de~mJCHjj9-CRzM5{?y$Cdi8z1mV^A(ElSAM
z^88yyUUipB=T!S47m0}a^kdm}a#<zJWjL?1$S70EahDqQNY2oq8sbFkm6i(=Yqmf(
zo39oTI>BefwXyJ7|H`VfGu(CUME)JzWwlMnwz780UliTKR7`Hq0zoLaV(4+KcxaE)
zX@nxm%oL@MtI;Cmb<&D66ay_=t3}t1&Dw(Z+B_6ewQ-+&Gu>{kf>Cc!0`mL-H`~6|
zAm+fya{!86_loGBsOygz>+^Qm6Yt{$_mV3QHn0x`Vpm35Rr>D(5q&m+yXC>}42@|g
zWq9#)hAtR(HISy646+9L1x38w-F~*fwH8jMxlK`i`{_@2Dj)EcKEMRqlvG=Zh_5!L
ztrF9A6CFhLUbyt04RgxgeXY@6`bWU;L<aF>q&ryRo#47To$tqaUHn3P-Y#wrozg!}
z^0BIr7ZPd9ZbrRq&gFzR=HTYw$^tt`;cd!75z$^;i?5}}W}z%kM}Fy`&#RJD9ef#N
zgetd@JRM%Nlh<6Z=MP6HTDa^S9u?<Hc0>&ck7DA=^nJHYh@PQQpDQUNDDikGRnBzC
zr%Hao@QqJY;L-kVVP<4SzuNt~1UgM+?m~*;f@wX@{Xy`(39Ou2?du=2x83LMl!wBF
zP4{1jL$Bb}#u4*rVv$?*k#vh3dAnNwBTDNfS{kY9je9}Cu5aCE&pQ;c-ySObZ+4V1
z+hImhB$IF{?d^?xX-Kr-!egN5TbEAnb*gri_jS%tnibcI+DS0#C%B%TpFuUJwr?O-
zyxR4Tjr;(C1}+cSn=#RE3vcyHMj3%ld@NK_L&k{a9Bbb%bgmy6-45jE)+bj}II^Fv
zZT93piiWQ+Eur)-9zRS3*|TM1>X`OgJV=NV{~W7>6NZh|O=wfIZuLsb*c3~$-f+io
zt@64vYW4SUySn=Q8kzUf`O~WU@@e;>mPrZ!OcJcpnX+uR?LImvU@$^GzbSk=LSZ<*
zJ{fpIv>}_Qs1=B(GBMHi-lrjTLw!39@x*>IC<eU~ZaLl1>AB;J=>eyoNfWckrF?@u
zSZv0mF~OU9d+$em-6*cM62wuNC)|6Q82%S48Z2yq!3l@(6V4{$o_F&u8e`Fc-@bUd
zq4nvw-bSMT?qNGP!GkG-es(?<pRL_l`oMOYlPFf8`|FVKRkN%2e9tHouFitx920uN
zV-OtUl+uy-EdP`c%+0-IOf%8RiY%&$=uoff2vS9q!S4v19`i2LFO5B<(C5aQFkY4`
z>Fc5!;nAv6`xz!5N%@vUwpP-A?jl3;*@#8MFiDRT0e4-Ro`laPjFK_{z2SuT2kU|+
zV-{_ERf61j%%RPy9DF93r^Gv&#~Ti_9=HRe7&<HTdB(Ca7e|hxDnSxcda`=~xzrR)
zyUJfRL?pb|ro3;O=ygPYS}c6s@2g?6wI7ps=GkS+m)~vCmtq&xPYR802bN1=;}_x*
z^G8cltrx-)P!1!IXW$oOQH4N$pdRt^e|x;1;~_3xSd*rPJ|X_#4%VA%XFVB?u45^C
zab{tN3-8;f49onDNv|Q729`XBKUiWj&i+2?G^CGQEVLLAzfnhBHMH=1mW6Byj$61!
zuW1~6l3GntsrQushmiy<^4BlKik&eLyukj>wiQmoCO|ry^}!S-d&SN2%t_L>jmJUT
z)3Y-kgQ3Bz$Kz=E3(m4=ub*2VvnML8%Pmt{31im?r;kI8O%1vIDsMrrfB%`;`A$$;
zFgM-)Gc*^9V^s3eW*ak+(++y+GhFHUy-M6&H++iu+l|{>Z8A#T*7#ca(q^54`@Gsk
z`885rAq_#ZaS|owLj?v-@!*e>?V}cXSU9r0XIimua*KZ&NSs8*|FpLMetj;#X`g!(
zMN}xyhA~@y@o$|QUw;GW=bgWaj+8z;zwJVPnO!hFf)8NreMFP&+9{&Z<xHYk8-~TV
z!Q*d!1FakhwAM9A-_FClkDtWAyda!<9P|G?uP+F4at5wCI+4hjsk7#V10O}+v7g;*
z=6gkp)&xG61y5gPnXQ!pCTX7SJCdatU#rzRjSR`3GAmBe3w~Z^RZLJv_-7%QGa%nq
z66DmVdT6UJg2C+R8~ab0)$ib=zJzmM_DbpWmkk=%p!0tAi?_ukGf3k`wlv`wi;b?f
z!l|0oey@)<&G=FDwOvHLhe@F*gc2u}zKW^BAh*AxCK)nc)&Q{EeJx|`qU1{fUtoFh
zqr~yynoQ+av8!QOXeqQqT408#Bw4BhPm{Rv&*1CBZj7lvwXBnBVIy5^c7Zh2)X#9$
zhD;Ul&B)){`-fE`8sBKi4wX;3WnAF<{?xzO-*=pLzHHnb-2UAzz4X?nBXe-ktO+eU
zs(JA+?Yas(@C%##7%|H8XZRoEJ80(FyRUUs*10djC{{6R8fHhDl*@RX-F?6Q>=+c8
z-qNmqRiCxd7tZ$FX-n`YE%b8_ikW~FsWp-`COqZW4a_FmEm6W|$Vz*U>OwFs?;V60
zQ!_o~AX*$fgX|rc*plECTEm(lb8N?PPde(c(o)*xbjRTI)pe>0lR;QqB5UMaus-hR
zJCQ%RiUe~R-htLUT=PD$6#n=eenulXzasiC`M>wLc71+l6H)50I0q*Yj&1-p)k4cW
zlPUi!SGM9t)H3Y5r9$W16{}sZg9jtj6z2>c=54~xE|3|cAG8p%MY9ETTW7Y-eTsOy
z*-)F-s6cxw&s*`8_M2g|*@P<g<seV0q5QmCk1Zl8sy;OyRwev}Ql2te=o{Nl5(e+$
zmmu{THU<=?x3okT<RE)<!wa2nhHc~L^9UselRPl~)CTh^4HsPBr#+|^Qm>I-=izzw
z@4S$@d2^}ydjnXlP8h<2V<B{|>}~A;`FR|CiKl!eI-xit|H7*ZTHSo@wB#}86iq>7
z^y`}_=0skPhq2td@vV(%jZxH8G-lhHW*Lis6$*^wW;Y(L2*ZvK@D%8XJ!>y1XhpUv
zTLtd~5EOFeit|knQ7@$*QE)+u)0}tO@nkcmyB1pvX^=w|a(G?KJhpRG<bFOmRpql1
zJ<U`0m<%sTJ8g{$vEz&}pLUND6?J^(wfT9eX!D0_?pLmwWKY<q<H|?<o{%MkklPbH
z@%(6A!w>N4J7U;&1EhastIej#D4Wj<*b?<;c*qVAC8ZAl7GDO3>zb5FT)RE}p6nod
z5%=+$V%{}-z*ZN_hlY`!4=zG;%8ffLf8pWfjc7Yx6KSVt$2)x_3!w=t-<c%Acqf&M
zN74)EbE83S=f<U_)xITx%6wQk?OQC87EQNGvFT+ZG@>tn9N{EmnjC>yi2uEvY2czo
zWGGQDcbD$B%^K~cK6b=;$RGoClDjt%K5LhrzfjD3JI>9RZnu2qXQc|cOhOG$Mk`mU
zDR6H{=hh))@JdhUOGH;j8;q=8Qees85MDAP`&O|0jAB`F{o>&#m;U3Pyw{u3LujmF
z$@H>M??@*TThyvw;#+uMxeE8o?+0{!#ST(`rD1KmVG8E?d{hoPmL@G2B11kn)bsG$
z!-RaAURtLiJfc*+l<W_Y*m{U5a#5R0KQGjKGUe<jcV^{>Y#mIAhVww~inyQ5DY)Ka
z&sT)yMzNk?!vAE>OJ}&wI@7FEco~%a%P;mCYD37TjPP|9+AF*K`*hpv)XnPwBBsr#
z2~2x>qQ~gzJ*KSmRhzViP^?a2TVGsNwjSXU_xt!ik^!@pjSlO@*6C%x;2NfQKU>YR
zdpk{X&5PbTXk`6%W;2f83!Yn-cUt@0DR2;0U2>Eu*pbuDIA0T7)8jLVce445G7$Zl
zlZw|s{-y}z8j@wIIi0uIXQI9`zf~<t(*CQUueDXEFl{vB&v_42mjlsYEvo+m!I$AS
zUDr=(%LYSaaJ}fB@KMT-9a_$ABkb|_G^Z6&y=Zh3Diu42iHewrQI{%_l7|$KVPJxO
zo)5<pmj#9bkzj4WkY2ewuFiKAxMp(m)F_|w4%-=(xsENNL|6Hr+|}3g8p4D&krli1
zIH~!UrCzzKyCTp>^>AZ|^coHH#0&D+#a>KE0{+^Ckq3LY2ha=}U_EXqOMJ4YYfl(Y
z$+=>lkQ`5TZ&kMHG7rG=iudZ7kS;T{_@6chzvW%=+l|x$lj<6KHpd(*+(q7!YD+aJ
z1jj?UHL;PqQl!1iX#;cwwxwsIkLbxgBP@*u;1Dzh;sR$N{lY^EnbFKb&NcZ)qU(Fu
zfX_>KC&cJdeB{H)_d{8lP*xfG!s8fzMJ_5Fi+)!$sy4`Jm$9Nlj9)3mkeCHd-=oP4
z!SWD#djDeg27M)T+f0NvjV8sWTzD5ReP;H_)q(?+!xQN^gWLG3+i+T~gu3pjdRPuy
zdZH_m$m`5zkm>#LB09!AcDZ9Ic4d`CS6?r?e^}}OYgdedW8u%&j$VW+!?+)zGV77(
z&JM}k<H{p@r-i6f<1O#^9bu%ivI?Q)8%!ti>soUKSj{}?k?tzaIKK?*Dk(8axMF^b
zr6^8O?Ae{sDD6sPIu$aBNw}(=zSK+f4Phc)){ZP$hn<zd{iWqW87|VEI3=NL>70s|
zUp<m%jT!By=8g9T7P6ThmCzU#u~UdEr8lwKBCO?;rN)ek#nsHr?0tQGrMwjp+~FjN
z8j5r2?o4l^BI9Ny6D*l);OKkVE2WlU+AuQDO`AJDSoU$*{pMT}7p@1l!~Zl)5hpyl
zaetTd5%7W~A!y{2BzKt+be(xTDjmWpCRX~$2klSwvB)@!c7U~DcNL&%eFPnx`TnSM
ztxS2XbCg^hr|cl0oSds+I(iAg1QrE$ir^2D;wAG(DHPgaoJGnMWH^aFwcBg_S;5w4
z5A^#0bnBuYcx*}A`XEj#^MYrFoYdfA^5eMR_c3ar5#65hip-{%C>(Bf45V7_f!+W`
zWG%tDJ#vFgPV6dC)gIze$&ld)%sIsMpMP#N_?tzn;N*Kj2&mjw%+vV^siaozMl{_<
z9m-!dm{d2NjEuB0cZUXxQEq`I`>aQ`SZ-cnqHbSwM4VdOGX(Vq;k2HFuEJajK56od
zdwFld?~*l#`e46wzZ-ddFR%bA=Cds?k7aXg7*+M<)M5r6*HlFOSXk7uxqlV!f%>gl
z)&y#U#r4O^+Fu=$&tFjO9uj9WD>=S$hBu>=A4inqCgJ}$>nL?2nw~GETO+GRY{tvH
z{`DK&{xc=f)0{kKlim3nZ14(O3eQR=HDu50y${-@c+uxQG_#c47sTlMKMR9Ck13|c
zUgM_&qK1|=<7D@Z8a1?aeVZN0>_mbb220)aNgJdO?9K1Ez%zHly$+<)?Sclm8FW?_
zMyaAS6N!i@&O&nl;v0oC?+l@v;Bt+RGEJ}X>+~8!H?a$LvxUode(j*{7PD6s&gZl#
z;eod-b+HSWuz>fk{?(_a(Qltim%&c{Eq}Lfn*Djx`GZ(mI|d7NOx=EyH-*{V<!Rf-
z@=j7k3Ar=7)>ZsH&Cuba?L>|tuvINjeBKpnSyb@ch*c@P?6h?3gjHeqw_6k`+BDMC
zWoy)m^KF0mTWi13rSsID((3}G0sS_hb3EAeT6uZK-~G|}2;jf9c(K9O-49B-4At-R
z?|$aI4P5Q@Z`5l0@g~yC`|xRK`M3{@yi<f<P$j&%ByVAU8=pGW!ow7SQ&#SjIJM$K
zGCb9D2+C~I)s(2P(BHE<_@*T9i6%cpA-z?S^o1r6efn)~Q%AYf{ci4^du3&VqAD@$
zR#YqAdQYD6yZT)!l0c{3Xj*6Z69q;y@yLR=lMA7NjFrCe-sXsVA~otEE#kxbKQAwH
zY3$!I?(>!|EF`O#FYR59u3w7G8{Iy4AEnj0+I3`(t%07q`OpbeGBGFK=FS{jSKFUO
z4Gi-3-bx>mAN*fDW1%H<4^wMl+Y2dj#}hOzCd8Kwv~lLtnI~|#Finlw7&NHZW}Fj6
z=xa-^qo+q4ld?M*_o!`7ZYHA9SZ%QujBst5<XR_+J2By9uL#_BBsWnudznyb9E#Vw
z5W(sZzUT0w!Ar)0#!PQzIWp}(zIc#}BwwB4P`BzFNhzE~d}Ui%ID8xNvElin_C!zQ
zku6hE^bAFF)<|u#$8nlE_=CfCMq?=2a@3MH*Hk)#?<+Z{Jhd(RSv7V>I!w;~XP3IU
zF3oLPWwVgVmy6Lp&B_GaX(yLrSRdOyQR`45GcrK9t>K4Oj1EF<$~4<4y>Q71)sp76
z1G+{Q(#&Glsoa%q{L(84O2zg0QQZ&Cjo2~mSGkj#s&hfAytu$A`|J$CC%K>}sSget
zq7Ua$MRO9X@$$uv-1*PANgowKtI)*dy|1ejDd^6OqJptiLUm{kcAJy0kSBh_INNXI
zk6q-tmL_u5zOc_K?V)JB(^>f5ZSr}ksxk^)XsN_<VVr7IVFe-lA5#4&n<?u4^fVYx
z*L*@Hd}=SoC8o~V1U1zwv&g`go9xACX3bQY1<Ca{UR{bZkUZlGU-38LiEs=A=&HO_
zg_{!ht1C|3PhpP5|F{o%P@lxL#fBaAQCL<f7{RU_OXz#x3$whIMbZ4^OsJ^$Y5hYe
zV(sUdas#47xeR&FSb{nJ9GG>Q%qceGu7WT21G>l5De=*CXPY9}LW1jWEzzi#?o?)W
z?OMYVg9WY0z6?^dM=I2uT(9pdy--Gy-j#+~;_csubZrJ9EFg|Tb;-ZOVn90!PlIv3
z`%F%Z{b3IN!Xz-^kD1rO7!}JYeCiYI4YiT`qn)ZBG-q9*zA=|VTOiC6t|+tPY~@dw
zlxEK|g4`eI7}|%$J-52{{O8`D?dr{<sl%nq{P}i{SSrlcf{JUe*qLwo4kw(34U8Vw
z{s<le2IQH%>70ve&$O7hgaG_}O!QbS6PDlX+!fpNrQ7$^n@rm>?U6gCzUJG>LREbE
z4D`!J%7NjmbUwfLvdCQHSS6dH4QZASX44Xtn4M9Zp)d22TIY4jU;E2l=$!`}>CMqq
z1sgp?+^;H+-Uv>kq~=MM&<0DcvJ!<|`7^$_H)up0kg;)fXSH2#@8VU_@E;ZklE9~j
z8vHnA66Kk3`Xd*;EyQ$S^{UYoF?ZtFyVsebLQUo0ryl76_TK!E7Jl>|VV>{X@(|2q
z=$g6t%7z?PaI>$fBTf93F^<6p&62~<s-LZ+MuL?cY1uY2E#3u-+QcjEhD#d;I{cDY
zvA*U(of7<m(*9bwRBhY%HK13#)~obmsZ-yax5Ry@(jab;1WXRX<LV~~-}Fo&1Z>{i
z40PK*5BMT+?Y$KtBUHPvA>+D!Wui|)yR;GnW*^cI(rY}qr$c@ch?Tb>XI{j!P<s)F
z5~-2sDnRXXb(?8mnnO3Ju+ktUjjVGWhT_T2e>l~!obk*3O8V@NM=$MVqENzOXZFKJ
z;(N3r`xge8PnFietUu*XaYmbXaR++7u3&Jvd>kd&)Gg`%p#nKVl^rvF9C|$G^UMsE
zAD|>xFsk9;Qza|%e!c!Tx%mBV27X(n(~r(1r+$lxi6~n0Y}%)}?cc`%ar%=UwY|BV
zAmN5fU{*)6`0Gh2ok#ZMPLL`M%}*b3$DLPI13L7tz4_E1^6(ljnTPt`BZe{<9t}^$
zI#tMy*K7j%*7(?)DC54kKBVPQWg5kQl=PvX=Y&sd!#ytF=@&Xf<Bxi7ppnM?vm0Jt
z4BIiC^As-(8MZFbH+5Is%U`@q<cFa*`%Y_L*=U4Re&44s-&(NYxr~#WN!2*{26|(|
zk&f0nH8lcC)%80625+vPfBF3iw#q5>CEJ+Xx{@?U?oT|24`i=8cS)sTLt**QtP)}7
z2&~KUnOP;tu|wJunTtg5z465!3@MrS2+R`)JjR+jad$<M?g59s;z4m)#eq4EZk&4N
z4OxSsMK`9v^)b-Ljnd`%EhLmDKj~|nuNm*Hj+Q=N8(AUSgcqyG@6tL*M9ddQE5&l7
z^`s;>Aw@`Y;`o#k<{fhjsV9iIWbvU{nZG6KYL3@L9f-lJFsUV=>Mr&c!eYc(8%(i)
z^H*wz(e<>ts4~5fMW?HM7$j(y`T*PE^QZvAKj*0zVJjP{Uu8<-Q#gth+h3w7e!yc0
z2T=8QTYb@gGV%?vBb~(#uBWh?LUoPbi^u4KExU<S+N^ioBPe4R;r-D6byOAaS3(RA
zytZnFNr%<Qf_`q;`ms`x-$58JI*ZC$L2K0!UqIsAW=<7f`Mc<#Ph(__*O*%=nyzj=
z$;pAWhGHEin!45R;LP7Y{aC3M6Hpb6&OxPP8zGZF8Gk=g^qt5FYZo-mj=JT;pbwq$
zs|kNoOLO(oB*9t}XUhNap7$9@YJYxa<3p#Pi|=Bez<iv$d1kvS+_P>FDe~oy-R}=W
zAvGfVW1!nZbE9J=bxYL(`4)iYPKIX6>rA8beB*oA8*!tXD<ohBt6n4;Cv5SbO`@C&
zH?~d`P`DM-J*<QsG)|y`9Re0*8K0^=I>7@BCX3P-Uj<sGLdnlhk_)^FY#EG|n9^z=
zIx$Z}T8l}3<k}PUoh*?3KC^hEz+gQ1)~8bb;$OLN=HB@DSpej5-}nN#rwe^+sy`Fz
z*ocF}C!ajPc!U>tbrZR~Fb>9nF@dv+X6xd(TqDxoZs8U9by^eyeaPr6zH}=TJ^X-h
zkHrBa&wpitfqBzy7tb`so^HaUjbbBhEJE6qF2Mr(j0BiX`{)nGG(teI#D<oiZs6#=
z`cMS-4Sj$4sMT}*+UjkS)G=rPvpkj|^c|tzBMY?<sx%%HdJ6LWY+svg@|gqSj!qd5
zX5sJ<EFl_0`e|nT0d-)7%5K<>ukAiDyf6Eb&Feq_DfK)_3SM02Y4%WD&dLeD`tO`y
z#)A@_vMML@yeE3P&y0wphknG_ykwpXUtwb$xyD=ZFx;53vSuHB4qAsI4v5{hfUg}h
z1?NvC2CG?VGAEDgnXk4ml3fLmk%lVjmdu~nQrg%_ZxTpMh~D$^<=`6ZQ5w#vs5b7a
zPZoV)FTy(U32}~S$sdTl(~P(uodat$Wq(r|lDtvgp+T}e2SO%`N67_8cXJj_`$5^Y
zgrSqcUd0NMdaL0DtCbX_3l1^nwfzRxeYmBgXA3vJEiTtrB6k!@`jizZ<c>OBMo9m<
z7ynoUB}jXL+EYX&$%!`29W9EvUAS2Fu5ObdR$i|=!?Xfm*lXK&pQ-&0m3^^OR|kr8
z6sfvXpLZp_bR}>CCsM6|k#-I#-YX`;yYSe~lX$@20)_d6^gaR@oY8vU01MmqMGU6S
zfv{h(W0W%9?>ti0N}95VCk6re_{YtVvOm%-?xfswg|uam>*At1O^Gpw_pRhJ5lupo
zr<{xyrf7PP_Tjdux<sQ+tY|p`MLps@hqMnr)emi{oPLF?Od_Kqp2Pl`Sq{&<Qwnp$
zfNu1_R%c=7*b0IQ`}~fAMc(`yTN*{O(1oTQe6GrOm>l68T{BuVm^u4O3VQvtb6+BS
zbru$&Tl6X=hf}nf%yhNNo%HZMPu~bp#j!v5`bH>MniM+uTG-kT!NT(U3XPPP(4@Aa
zA9sy$*u@7nv*Kpm(|VMNV`w<rUhYIh_-EKwa__n}ePS$;K!(4OrIq-u!kf!Lwrpx(
zexjc->RA{55<#&cfK&5<H}B!D#FMnHJ``7fu&9Kbvs<Fw;%M;Rld)uswkJgkJGQIV
z&Chp}S>pho3*AZOn5aw>{(HI@=>DiW{54~4TEhqSK2N^k$ES@?ADA*K0v@mgLZCre
z+ctPni|^g^Bg;7Ob+Rwz02QveWgc3)YGrT=^7@+j@3vk|;h2sha*XkJ?P3j6et(dt
zZE&f_Vg9hPI8aTodq9drFn|1Yw`|ru<1(NQiU-%FquCTI)R+s?ibk$C{Fj?DA^LYb
zWx&2?H|sOttUqfY$-w$7^lTos93|1W|8*6LM)J?7UiD9g59$$LtasObk__2=VC8_9
zQat=wd7Y5A)J|&@Lg%WW_2){#m`PJhfLZ)xMc63bZs&DYdo^ovXBFjkfu|Qiq8bl!
za60WlSU|cLFAo;FQG~8_EhFE<pEL3vsaz6_+A634TZLS8xaA6?S9;Y0K&XCykr{0r
zF?UqJi2LgcdJLv(D<0{42BmL{<fgO6IL21h#Q~fNv;4lG3w7II{0n3bEXmzlrtN0B
z^z`BC&?WW6IQBt(lO$a9l!<hMi57`6B1g+zF1g|CWDkb!jZoT4QY%&^PF`8`j$xNe
zcFN64asU)KVU6!dA@$|r>-UAi-9o7j^t=y~sLec^H2!trkArmBFC$-7ubpyb@%R(Z
z;Ua89;@2-)XIIvhM9U*fw`JQtO!B{ue8%HHRL&qRx5sjU34&6Ui8PrOmxHEU0T4~w
z?7g@7P}ef^J_A0z<62#HIA6MtQ27AETyj;U10U5-v8p6(iwMeDl~G|bvlRB~@b(c|
zLc#yywQCSvNWP7AIk9pB8cK=;0Tl_d$>UI?UWi=AM0L~GWyKs?lopWPGC2kk3F(ii
zdReo9zHBo{chVNHkgCl{_I+w<Du%w+LmsC|N6H^jt(ZobVyY?bV3}J?(F@VZ;R-E7
z+wD0rOWaxcgq7k6IQ|JwwK?>(&xMH|pvq`NLO636pzwZ6(6ktP7?y@VNIa)0KfG`t
zIZ&*`6US|CKq!H1*us;SMn}gEM{2|kXK)PvLAXcUXzjg*>I6;s^EWn7W`~%9j;d0G
ztmRB_i<93|*!X&}uLQT)XA_i#A2LVbx__KwzeqMiJ_53oa9L!?U}ACU(Iur&GC0a1
z=J`O5gg82WK)y&8xP&6g!=@kcGgT*|_3$<`k&CbO{T*cp)$w4KN?IJ<pc>S((Pi41
zA(dNLN588FUlZ`^s(DpfHt_kg7oWX_aBuN2l$lmPQvu7ZN*5uV;QsePQhTdPvlH+%
z*Uvi|wk18`n`3?<lN8~NgG9#S0-gL>g{gFpxOxIM0-JE?TM>a2<KL@}`J08Rj(RBC
z)P#<#iR--MpQ;>L;l)WJQ7EhM24Frz#zDrzUJOAw?q1%<$*G6wf7=GXL#LkUL=!xL
zVy~m8iFTPL$KB8*#$7H+r`5Xi?qEOIshhivK2EBTe3<UwaNpU&hrA!U+?mBsQ;m`6
z;4Xw5&U#L2M`U(YX&2o|y)a7nRD=mtMkROur8hQcz+s+Vby~8ZLz;dGugPVTDxG=~
zE~F2YWhI0>SB0|SEC>^gz=lt!)zuKiOi_#NnsZL#4|6rqngxs6RK1Qod_2pm(e5g?
zmKF>Get(>@8-bmqewoNG4{XGScU)NXXEk>cx?R9h%@m*@M$l2|Y0W<EF%Q68Q|{}u
zi==qiUU0u>?*|w|Llxbft`}xA2AuN71o>fKLPjsE7&$8G0{7F<q9NFP!EY{sfI_T9
zpo#2AuhG6;qB;Cm>2m5hlij`=pZPDocF=(EIVs5!j90hg7+)KAvt<WPJaxqdWNybg
z6Pcj4_kWZ`4hQR61ng_~`aIE)zgsFE`4Z~jWCXLQS<IbbLd{$UqmAg7ZnUR58ftGT
za&wdNd1AT5zmHsT?S-Q3xyVK!?#t%+YWQgxiaEv>Y~sLXMT4nR_XUL-a2VD%fH$3u
zo-z5DP#2Iy*(ZJTIV1y3w--+gPS@gl7s0qrto`>i3O@ug=*&j+(7b@)^|Z$H9%CEZ
zm@f4%>O+J`5&rhl%*AAf)ff%}ew>M+BC+pq`I}d!uRn+<WKS^Hg&R5BHs+=ly6py-
zzj~j&c1#m|nj}39JWRFbD_d}ls%8$9>+|eozZ{kzj#s!f#9gKpM;Nl0jp4%IQ$#X-
z@1WVSQg*GQu}O4LL%}$v>jo{rrE$dPL@s$LjTI|f(oXL>bCs1A1v64$jh?j=7NwW@
zBG;PkXu@1+v5RVg-4#z#d_b#+dlM*y2J2NhX%ia29Bose&-dj6AKCYn`MR5=;!47#
zBT(axasd5$8C2>hMxpGLOPXV{{=lb7Q}re_+TJU&1d((cG#i}RUHHB8l`czhlJOW@
zEcTbH>6$epB+vHry?x`5@-$BGo}@~~*23~EXQ5vm*N`(2Rm%))fXhnz)U#Y)+D<@r
z9Y!uAJAe|ZxX7)~Ygai=mKxRexIS#=2cNBAi)+3$&=&=SqyPEd@5LhiWxyB@gjzd|
z3{;!^0G4QuvhDj>QzyEs($?Qg?M!oX{iHuI(*$J&TfpU}R0Q`CpNjqHE%R7vycLIE
z{=EFFL)qBCPgxG(f-_5pm5TzxZ>r32pu;IrF$CwZ3%kSeHS7iZPWpi-ZQZo~VItKl
zlB>yiv0^#Kyv=&6o1*bpX<nKbBuh<$sl=AAVhYmDP!%(`&Ekjc&iAuT>{X420Oaa1
z$M!ROR?Wr=U0YT>%#Z;?<%y6VpQteJMP2B8@p5a~yIx_fdgY~gBE&ym`fm2DkD2QC
zf2j!n68}(6L#B>Js%WgC(1@KQM18Q7Vh^027?g?JCQjj0R-ZdMpq=xhO2(n%=<$6n
zFq}ZE?A6uAAuPw{`SHoyaE{bT@vPG=-;_I8q8WQa(ZbgSv0jatvr3E!C7hGIVKWDx
zG|x=@8FMcuu9td&@al6UKxDpnR`th~@}j+!8tnbJej#2~JIUvl;F^FQ-H@5Vi)hei
z;z=4`-i?n>I>!@5s@!PY^|L!NlbEj#{Z77Ct4Mx3dhoGyGDyAfeaU?r!cPF!l$2Fi
zQONY~YCJkLmVrk^j#e8b1kx?68LGO&cPlAh7!Gi=^YptNv@@YQGLxjlE;CY;s$=jz
zzFujMwl5c7YJ8Yb;;ehucycpsh3H^zJ{7IgAM^mWy~`kmj4%;XV-`vtMAuXg941_H
zzDkr3$Bui(dsLM2icsl~*9&=m!^P)bZh7}euMR&EZBNG&ID^AK!t%<j2kRzG!)?I;
zGheY&=6yR)Cx&nl;=jYZuM7yPZSo{t_%mP8m{vi|>cTM}b7py*?9+ud=R>5WQ7?{=
zaBp9})#5;`OPK~H2IDH#_H7U7Px8MvW}T(*$TA86w1wt)rGA{8&d)Q;0oKK&SWZHw
zh);eQm-kKBiAcPn+e3?d*KUV_E}lzdP=q*?D@ddG^)T&=(12{jGDV9oIF#tj=!{I~
z*WDJ5|DJ9|{rx2w{Y}C_>ZNd3Dw;-Ss^h7+2<(q&Oy|peWc2WvZ|R-`guF*C`^lhb
zmb+Q_v33?%*~bf_VNepqn4jI3suJ$DhfcMs8LjCNq~H~iY5HHe(6td4qj*0<AtQmz
zRN2a(WEOW{Pj9%J-Bb_q_HW6$O8R_Fnd<wGE5A#BA}n7_851RqJY30{6WjJxR%@{&
z-Db#@^?-dAA{wvlu3?Xr-z;8Pw)yb`9Jy0iu}q(uV5WeHm1fh|z(#3CZ|r|uyrOXN
zd)T21-AD_Y9vgN|Xp)-{gGa64#5=mTWN2!7qM}yvk-y$Sj>C=%FJp9-a`S1;D}vDo
z>D!1`x4?a$F5(WUb5b=bR@4G_q|VatgBRL}4VWXS?d}7vTiGD>lBpO1qOJ||ASFUJ
zEfTsvUN~g`G?%_a5J|wURAcRM@W(+J#wor)^`+hU-CrNY$NNmqLXr$_#J6^*b*UE0
zz1q^fXcj!KsIbP|rnU<VzfP5fcSY-{uY?hkH}#t|aR?QWS1M9UqukJsEY$<ohbg0d
zj-DDraUq8u7oP;6@y9FH6NV|ytefnsd`+gpDrc|*2@sq)ST0~i45hdpsChZ|*{CVO
z{fW%~{?-J|$=b-5pspq2pV+}!#S9g5_i-#l$=RTnx3X1@S~BW<qT<wobF95RVI&sy
z3kEtpac%nDBs<kR8!uTl!`VL>WV{-NMNP`TL1+W<yt@79j+tD@)Rvi=2%l0T*ceeJ
z+^QK5kbUTAv{&pi#y@oEWHyE{H5fYfvoUYKN1yGTDt{SHeBWczY9Y7uP&u&HkylBJ
zP}#$_h+b9z{x-zd!Af1pp2DMoYDIZIGdnj>)_5`J8tv#-A0VfEjhZl`*x7t@zV`v6
zq$dB?>DLQ7iffZSuGbVn6_xZDl5nPN-KE}m5-Sqh!SW}733u#tYny1T^<DOW&(Jkf
zMy~@l8!Ap!8JCfbqu%t)`{xKh-Ha3t(_-sJu|N^^@vUcS!=oa~A3E7L?xH{6E^sx1
zj;jnwN|#cU70&ZJj&d1dKn;3&2`A%ytnSa+mK#mlO}6q9l}*P;LVkD2A<4~O^PTJt
znQ|MCA{YBwiu9xt$R5uu50#5TujBl=AkX@bZo3D0F_y9m@ORQ#{%Vq-2l+?asG#t#
z=3kiI&wuS7b-X<c8J*0sFZMniyHkj2Px%`+J2~dBe*CFDs3#JK8mUueP~CU`QF;t7
z>_)PI%$$I9V{RwVbv#lKU#tCT%T}KKeWg!!3T((w&&}g_ZRJAs>~YuC$;(AR0nm(6
zU+->#dddLaF2b<6-w*W;r#SJwZh;w8=5nMw^pX~bgR8x-M}$u44TaW74WH6kjb&Qw
z_ZJMR?x}|&J2(oLz0#>L`5*F0Hyd({)oqdAexU<6y(^7e-U^mv3#_%;ZAehxGd&(F
zOTD$bubFoK3J_|em~*nt=wKS1FLs(CC*7ze0z{OfeqPN8vx0-?XTuoV<>*?HP^XWJ
z2~>6hW}%_r%TvXNejaCK;*KZ(rXi%EP!j(7;63l3-LJ0}r%zXp!uEO%5T_9LD30UD
zAx$H#O)=OaJaQN>iX7FUNQq^vAd@+W2zNhsKuHyrW%n`ET7YEtB12G9WM&bQrB)7C
z)BEFCD1{ly(yM3eei=?b{~Ais*=?F<tV=a1ef)*$-x~HH`R!5t)@>f%&pMYo+fF6H
zB@NAiHCmJ%1UxhDfG^r|ZHkgC@`^v@2kL)pQ#eb#3PFxgF)Ck}Pu_M7wy2in@6^&j
zQBQm|pA1fXbnLKRyN8~bMVIv+>Ty>%m$RI&B0)KF+{!JqXkZoG(Yu^fEPo@~$SEY7
zFj59Y=99qc-WFTm+80(uUWe6}rm1LUWNqMTiYiSm7>Vx_DE!>pK8!0;T-%y20oxTR
z%GQ`Qev{b<^PeSB3b{^Q%hY%Q6EnRSjPelAFT_fVM1{z^pI2dl&Y4>jP{#Vlyp{Ia
zdpi!7Yj|J76*7EN8=SVZK8F}ds(~1*fH%6;#kM{myDIxi19vH4+7Iw&`;13l{0j=m
zmj=;1OPP=kt+Xy+6~I#FeB^$<vN@Z=cybKbuxiAeb(npfLmT{&y(0Y{d4-U**QT9h
zJ*-4eo*F>k_l<0G%5WnFsm``?3g`Mk6Dgis8UM&d+Q?p~Z=uK#9T7eHD4jO8KZ3Cu
z4UxFem?7KERv|l9@gj=Lhk;Y`NNgb7y#kT0@kgT8`gZ`mvLnNR1!ow;(;6m)t&Gf_
zV{*$^C&=dDn92ssd+l4*J#uq99hZqZSL`J=llLU=UV3!PxaeZY!hQrB?z^Xa+B@6c
z`W(MP!DFhEQ2|i6vM#Y|nf<IJ8*A=_9hXvSEb^6Mjzg&x=e4Xu+M>6}?ty}hE|qB4
zKLq~iv!`FnovybR@5seeLjB%L+n9bm0Mk`8L~B7xu=*UiTzi`}G#(!#lvLLR+TY_I
ze(lqD@Y8k1$ko^*uR`i|%CNV!!z*9Z6NSHbtx&zFNkLm4{5N=VM*WDG5~iwa%b>PG
zb<^lMM*Fu!uD*pd-;c=BcA5&wjmMRpGsp(cQJ1VBlPts&Uqy2*&zPj72GrV2&BaAh
zrY&tdCSCmYMASwYuxuxW`pFjYaJ8f{e&h1-n#EqBR-(3b+NpdKOLj%bfoZ5bGRW}r
z+iX@$fNC5Cf9b|u_lbE!^xL(IXaVmPjpEOb>7H>i>q6eo0Ow<6x}J-AQ4(bWnkiqX
zS@V5mav2S=H^#`W$9=63p3IA*+m46U=B@><x8BmZla`gYQuw!<mX?-PGWw-;yVlmX
zxVh(HztSlf_?n&Pya5xAsCV!8Qaj(?z4#u*S*M#nbYpxzrJ(2*Ii$$RrpV0&Q`}D(
zcYX7F1uZ{rWxWCfEXNYf1m*-w9Q$p0mueDJbbl~>>^oB|J#(OCa4TdQ+GKtiL(TDM
zJZb_e57|1ZA!H22o!wsZg*>Djn4!>~afHHsFOS=rAovZRNq@9<jXXK|JLf6M;6r}D
zbAmrV{P)1e9)c~w08L=zj@QlZrMYv9*J=0dLAsy)M<h0io!TL5V&xnSS)<S%ZfjHr
z>Q25d`h-6!k9@D^+k5==8Jn@G;LEPbvSB5M+P#sxpfdL4OvpwA&Loq$BJ>GWVA2Bj
zzkFv9_>Ku8GVW}rN1I^&o~jb|>Ns|2dt=Y*js{xz>5^TWGpR%bXC3wC2A_|Nf=7T}
zg;>X9a)WG9sfU3pvie+_=0poG9I0fO1?L5nI|aKD-By!q^Gv)T)cSY(dpG%i{dp(0
z_4G^o817Bj0QRoA>*a1BtGU@@>1y;lK5VV_ragMS1D{UJ_N2fhdUsbfYzIaykLJ7A
z7UD^G#YN**e^vW+E{#0xcZ)~+R*mhDks4~iRj|7tW$p=)*eQ<K83C*vH+McLr`js+
zrzNy|By{sC5JuK~-uC>=so6vSR7e_RCT37g4r^y0-O}n)4QjzJsx}h?78O9L6E?SG
zg3g?P&E^GawOFc^N2l!hvAtzo&FDs}^=3^*Xv6N7^8zR|g!L@C0<GQz#HV;LcFxYu
zAM<N^%Mf9wk3FghPYGa-9WYm6WKH4ByXQdb>&+L~4YJVrXTOrvR&k>Bt67M>NTjRH
zCJ_))|05VUZWdaVnr{_pb6B4@>6;_WYY?6~@rtX}fAy$LZv?e`;5tT@K0TY%22_HM
z^d8Ez#+Um*2^TXhCiAv1B<>yBlTP@qcWp~4HIAs#?7D(Er#YaKkU0I2Y>?eKxP@>!
z)&vf;Vh4GL4Pk`HT)GLS0>BkjPbvdSm)4s{inOV$TRnz=)NzpSkH(1eW2Z(;)~zV~
zz&-Z`@CJT#iy%-CwCJ%!7q<ctdB!z_R<?i_?GYT}K-i4R5A2#d<${klX#&D#gI3oY
zMv6Qj;$+svpd!Ydnpdi=07I;etB?zico12j`w5{7vJ8Ny9&`Vsxq!$q{S_=cDpze!
z!Qd534`6&Fu-a6kgN~Dg50wWGWc)uy5a_E{O|zs`YYQOjSDZ%%h;<iSy?8e%28ApQ
zWS?jeIL%cehrsa}b42%=ZGkW*@Ue?mWkdKJ(lLRv+zHF4tjy07r%qFJaRLxHB+!VQ
zln|nEtyHH?Uzx`6^6Dxm)=kO6!>1J<*gxs9`X67{oRcFmMa1|SRC>;7jgb`qh2O`z
z36!LUn*ln45eU%v9~*EL7kL>c1GFqHD-0Yz!~5C-+=~g8rfvlOGH6R%Zy704rn1Hq
zP~u*aw33JuYjHp21VYx7fO_vs%LxR6z<2r(GxK=OGwgy3c-OB8<A=d4>5Wi5tc`*p
z*}{+?;38}y#@CNqTJ+f^1R#7YyAICt2`McsoFwzj9#<l$W$}$eMNZZ_P#n@?dCDZo
z!?8-_?ooWe1yV1i5;X%04`+L8>(aS~F|ZT1b&xWwT?*6+j!_|UycqrRu3Bq&qd2oS
z%YISIFxc@>%i3p^wGk+ljh^^(6+c?iDu{eG6d%}SpCkjKo^*1&6)2Q!lCnB?6XQjA
z`8~S)mw4+Dwyyej@gt0j`Loo2i#H1sM-?s*WOS|CI)Arm{BP~Pb<1fm3gw{9yFqfd
znMDYvBfg8rn3Os@W$JSNJJ@*R@3~!Ckb`}ChEJN{rwL$JmcRd?Ao!3aw8FRxRs$#y
z4D*bE3BJNH%XwsUX$>#0o7gk^_HzOkV2)5>#1@O0^C56}S9i!y;vG|$r}IvEqPvZ(
zoFR(<xoyyk?U@@5atOxXJV<!435fqv=ZL(?5Fi3Vn1=6^A&R#~@&Q3)++iqK=JTiE
zfa9f;TZb!~%J4?h0t)w#I9;nC6sRvP0)JQUUv@M}os@;>&2G9%Nwd`+66Y<I4O%CQ
z26)YS=vuXUlTpQ?7a3z)w<6|yM#DiQu7+r}w4z^6^vZNWaK;Ioa*Tm7#=wg_!_>cP
zmMuMM!y8xEJ*_E?%rnsKW#4J~Yf7{D&NFR;m0f?YnsLmUW}u_8f)`f|AXxyRVyOB6
zm;(rlK#r8kxT)A#LdOu55Ys)g4)nt;d8%T7d|&=CDm&ZLXJulHIapBsCUo~E`;U|7
zOkgz-dkpM>8rNvj=d=fgAO#ryUH~Ie4wj);P#oJELF~@D4W7ip!ZvFhAB?^9Z8mK(
z>R%?q+&vb9=ndkjqA@V~y{-RX0}O8jPPZ3);Tdx%>udy~Uk{8fuR?;z?3)igmstin
za~JA~DEYJAKTZ(KlDSl6A14sB8VaHZKUZaULBxXAJ#+|$At<pxr*sbWfL4g*|H{qp
z3&&W7sQ#%MsIZcXUqn55))C~0-AtCcT*n`H1dUc_nIr>Q3`FK#O~<wjA(P=DvrB+E
zeg0m(v#*PtW$A&4Pm9G;m#q6>QySjbYH~}&ZVk}00yNoK^!=rnN^pZ?|GFqti=qUq
zJVqDi5y|IcZ(j!-&?p|`1i~f~-28L|j;}LpgR4*LnXGAyQkQd_5DD}Q1st#blexxf
z(}EUm>0w=o{;_4Qehi#LJ-JSN2KEq!)V^E&I&*t>6U)Yn8D(tiKIx_<E0N=d@lb{(
z(D7Ld1S$lBkJ||o#G9u^P_U=~NO6H603zNR8dCz98wK;DdO6qs2@RF90FPWWj-P>@
zocl8Cnin7?29kznr%eFqPW)4dR4IRJpoUv+mqGusFraibm7$jtxO&Xp3b@oAfyjlF
z2E@kC$uq2D4x2F3wt|9?aE7pUxwJ00z+;)iosf`2w!Zw{oq?1K=T^h%S|Y45hu@-S
z;LVw~ltw@lpAU)3CyTqraRlKe^up?;la+t0J8<}+78#(B;~Wr(3}P#mZSZN%mTXHQ
z#8yV>=9De1E(gv9Y7n8A0y$*R{hV3Kc|aiW-|DMHAft9ch)vFB_55o=pypv3fr=Iw
zoKKX&EUC)|6Z0QX%fcH0CYV%(9#NKe1i3RfUd&fWsWsGMpsg=iIx7$^Px5uCCWmZv
zl67ja)w&ba079DIxtksyfHCSg6QBkh(p`>uF0}!3qv`iRy``oN@mZIjWYZ?#QP2#*
z7??#>)x-4Y+(B;_yXvP@Kxg#~MpVMzwcA)i;eRtW8caYO>WI;~l?r7RZ31%MQZs_c
z4e*u<5MZetLu()4^g)${`$P1HjJ8P?&c@z{9S35LuI3<nnzBolC?Pxib@4N&xRyN>
z@4pI=N8F-JHX4Kg;(<;wpc?1;@j>8%5qP;pio6-+oDvWw*u}E`mmJCgo6~OH9pv!$
zdha459l}INsQ|4}|8QKThTQA{@vP$^*inBCAe>HW)Op$b)nkjScy;+K;#<=IC&`^{
z-SFA373U-w2<zFR30Q7P*Xq85{Sn}ECpfGPVFk{u;k?*HS@Nh7@%#YR)z*&`^$N-^
zo!&{#J3-dJv~xFYG*4Nsh7bX5b40^n>kQE9ApBR<-7F<?2&#^C6MBPi@-c^LmB@3-
zzbXaow=oRj3qug8FLeYY{Kti1au=5o=gkZWbPX6me<tg9>*5$Db5wt?1Uq8=&M(L(
zgADD1=#IGBr3UdRgnX)vsa@Rig3+MmiOByOqy~tG$Xu-(133ms&p;ZOUcup>Us|cm
z5Ne&s>6wGG^Qt98`CSvP-$$|#HJyw45iXIk)JQ1sUG7YT;8GHx>&Mp-+{rw+{^`D3
z$4wgD0Ta#v<1!m~4phn#V(bhe^#~2B$I7z2^QZ;R*%D+!dZKg6FoQmpb^$Qt@^u8^
zN|0j|zC3{{wl!ue;wnw5%wJf7b;RHnFd!acr(r5)ny+5d<{4dGK{-MEvyJ~j-7>NE
zkzt3F!__c4@Drqp8$q-py%meV77LzH#>KS#4zJJSrTLc#@G#PTf!GQl_Wd^k*$8VR
z>N%xMewmvf1Ztq%>Pl!S%Ri{iVMQg7vJ1}PaU%EmpUC60HZ$x6$W3Go$q=q`rR6{K
z$9_5QHCnaGh(Y9rIOs3NnHFB0=oUSz^IxIp!6Xey|JmLYafUz*IKk<Ic!yE<bPwhP
zUSNFXvWXjzw$HNUVYaRd`1P&J{J&T#+Nztw5rbg#KAqGCTK<dB*v=Yt=~g|fKJAvq
zIT*dw|6*x)#uM(C0v4jVU;@u{yKUMs1cGtp2~X?adIKe3AlN3=atWynKBwP-ERfq@
z7wr6?xeaifwKM2O3=c!*uhz}os6L=-$W002p_`T)vfaO08^zm$0<Xb;qj-tLeFzp>
zlJJyAZSNe4{U4vlic-7KZ>tP+pB+de9s4hmj!y3cSTdTJ8`XpZXAn;zeIdlZ!T<oh
z!HgrM5g~C0dTK##h>&ofenx=ZqJae08Lz3My%VqFRoMl`EJ>_^*+2)xMy=>R!^W%M
z5SRZ#5<1K=X`&%Kg~>3%wq4m(gFxbSY8_;5gjnO;qXVk6)%-ubcdUHa!N`<@Nc$q-
z#sdF;4tHt}E0j2^8y{rafp`X@&Td=G(!^i2V+3sC|Cd3rf-JuqIr39Y;FugqF#W3t
zAwk{t@eJb!q_F|aR1mPmIo|!3rBELUt{cf91@XRV^=$cHO75`yj^_E>uCIcYLE<@(
zCIsSx9b@O#A(CzgE0F!r$WX2-`)^3DJHehn0G5S)@err@=fKOm;iSsGoEpdjMQ@Pk
zf4LhA@Ia6#z#en>1>a9hY1ugC1StivfYluil>~^uI;PZ=;ZTSbc0B=nSP(b~%XN5;
z-|g!EpA*EQGHwcxv~qSn@3jK`Ga@N)J(f9Mkh)Ra6wwclXZ4?P$ZrgnKY_!?5imC3
zPZ$2ng&|lKkoZ~n`1;YWD$x4zZ}5MWw9aT%-Brngr|LzJ(hkyRLqZn~$jnc&jGfWd
z7&Am9_Vr)V#I3L_&qD;Re+P}Q5+CVtK-$ZhJCia<Q&acg+;>**_&;rA`dpIIz(xtn
z!0PRPZuxDGzJd~OGJn=HiBz2QFSCSo-F3s(@FBhKk>hDTM-_h2r^!2yp+ZS;<TyeN
zf?q}B|I6!|X^|a<h|9lo?u(uHr^(KK4ZS`PqVl4L>5JX+KTURAN<T22)(nG<R>*Gu
zC85wd@d#+9X4nBswoc>FY4v}MmpnE+XtEYO!`SgJ|Ep=9oq|{-)qhb7+UTL`H~d36
z6jVcx4KzTZsTZy{{aa+nF#-M5b~+Y3lh~W(EfXTZzeScj&ch>^O3Dh>K4`6FL%ao&
z8AImI3TLq%J}5LzRWP@||H~HWY27MaKr6m9ZSDW;JXVzXvWi0Uo5I<V`~SnRm|4#Q
zfF}*i$6WargitoLI@3Twlp-UctCN*~8bBerRd)>Q!rQ#VZ2m9)A_8_j`~W)Ua7-hM
zH4s=vZive`caD54H@r!r`-sp)uQz+KV|l;+53E2_ztR2=`ni+;|2z!F{U{C>!#JuC
z0RV@i*#EzU0wnAIzqQr=?En8MKE?k3Z%$vo=%1aRUL2gCl|}%_6kPvO7{_^#=bYi&
ztIewirA4NT*t=O)Xdcckmz4<zSYn;|)FGZ7#Qn(meVtRs4By6~JEV|1%4>e&&9ES5
zP<MvG0wF~h*LHo41CBg;^v)aZt*<R+k$*Y!Mr%-EZ~grqc6yv5BN65J=-ZbE2kX$<
zb2oM!#$*v<w)F@D2*iOi@duZ~q0_&ZUHh|9Ut?9PJ45Kt0De2;#cYVtv>6qQT!KwW
zzo0j&Yw_BnL2P0-b#DMW?)rio7y%-ED8!O6O&xbQTug~TIj-10fBov{pnuWpuCFnj
z`!r6_<}|*+Hi7IQq~kRLGPsSs2pgG1-ujvw2UCC8Us&D~5=cK2kKrsCrZ@1wpKz=Q
zb3Al=!$lYj{vPe6A4vllw6X<FTo4IGT5q<PYQo0D_y%J%#a`c^`LXX#{NDhdM*j5-
zx(SSDc{5r}=k_}DMR*DH32$+cdJe_B(3yfva$vIg(Ul|NW}q_lTL#kr5NC+TuY`K%
zSE1*Q92|6K9E48HzbW<uv;>c)$c9&*Lu2Y9moa@A7IO>mJ$-|g0O<Of^T;^}<{0L}
zq30XV0B-;Hg+FS*VloW<>HCH=^M+m&xgkbzAG(Xk<FXXsec%xgAT@HfGg^c=z_I6s
zqu_eBi7(9|UPJHzeJ}e=T4TH{tkOV|#NJTF9${pmqi>B)BDVoN_!9}B{U{2CK1D3K
zoCE_5;1K}4o7kvziDX8~;1`217e~*Tynq`<)>yzGdJzoiB=+YMAOaNsDsqM}4n{<j
z$ensJI1K`WLG*`#cf&w1>Ib$1gob}3j`{&&#D)Lj>%h5oZzFCsS`4oUfK>J{Ha|x6
z2!PeYC-iE=*>^_FX~GX!fXB!s1W_;zFs6U(g2*3X^N6M9RRZHU#DJR$<|Muf7ME85
zA_A15s}F!sqs7n*AE<VSvAOHWaEcfd`Cq}jqD~n!!I5ty1bhHv5iO=Lx(^6%&mCUj
z_(1nUZx&A!a^8(M1PSHLgOFq=a%(a{RGg?f(9-hM31%A5r58seiz(s@kds=BeZUTR
zW)m9z9R*8+1j&166b5r7V3SiJ#8-YKkdO+|RWKQ;7%NwP?6{XeWB37ck^4RNL!^@Q
zQsjUarMg8STP&T)&m4SDQ-?VF*q^<1FFlM76A(uM^@XLdUO4DuJg!;-I<7Mam{xBM
zE<X<!o|?A2bkLG854|~Hu}P0)nSf!0Ve12hU>?@$I3>MzFi_kfe(Su8l%R8P@l*X6
z1i@r&Z4JQ!SEx=L@JJI6Z-m~2CKB;tX1?>3$xL@sbgt1~i&(>fb)uO&hvAA5n)DSU
z)Z~^LcIH=ZlxdKK8ocbonyC6<${2dbf(Diwwb}sHF)&z)>c;5eyPTB2G^P9-#vyWM
z6Ms4g8V)U>i|G{8ak#UQImDU8d+iaD$DqIoEQr8$DB5Yxid@mNOXLJ{HPKf@1+cKo
zV}QYr5D=jP)bOxGFvI6hgoihrBV!>=U~Sspn}SLNJEja!BKq2ouWT^h5Z6!xf#xnt
zx#zq#1O8W@J16pD<SOd6XqQp89uu178T7v8)I{b<J6>2vk^~_Jl7i+VckChKXe@XE
z)BqnFO4}L(Pt7*ZQ{oFzOO`jJE3WG-l8nV2m{Tq3B)<s`bwVv=CVLuuM$<jYhzn93
z1PQ4h$-vV>GO~z|OA#N$^NILy&b=v!WYh~#?N-o{TS@y+GYzX*7inSa{8Bwos<Tmz
zl;Sm1iqks318O|9-f-RlhfwgW$o~z4_<3V53|TV=0Wye9<$n#8|DRgF6i?nubMjsm
zPF_~4X!e#&N9R>A3*unr4=EQ8up$gEvYE4(`M)ldzTo&Hn3$MkC)_Mjn=~gCf)q^(
z)K?&j<4yydHlx(0g#~tg;-yz=yYiM+)Q)&okzSFSb2#V`Mv9yTvki=m$UPc@PJra+
z4)<r!972-S!Hr|!e&h)C#JidMvRtHBG*)L}Nuw{BHSK_Bm9vnYnO62aQy9yFNnLfE
z6WGAPfRT#E^hwm->nqqy5{aicKuXX_luV@*qoP66SVj}$wDLL<P^h-zCA~j`X=vd8
zoeSHA022-=&UYTwH#VM`>k2#ptPf3T0n_0vqpl}VL{pOUG5IV@a6o?Z!ob)kJRW(;
z4=s}lm;~F}i00l97<FjU(_zH`b=uby>Q9y(f`fa7>(GyB4KXW`5W+Q@h&+Z#MiM+}
zRzVf&4c}fN=|B>+W38_{XQ+H&MOI`pbjBlwz9<OBW76_qHy!&E(QOnoTKyFFQ20DY
z_I*f8VDDg#aS-u$K*tPYN1av3;;i_0_UoScqwgb}^rK6Dq(>jK@IbS%p_q|!oYq%Z
zk|XykwHx;kykXEQ{J>KJ*dreIuGOG?rR!d~??eemrpbsGnZOyl7>+m!cqxKWy~S2$
zUxBha9Fn+F;zx@CRN_KvlYkJiQAQ0EVrJD)UoDJ03o(0`|4w>}2r87h4^*$l-$_s1
zl=3Kvhw-GIX_Vi7l(j3r8WHm#NR-c!X8J*LD3o81=%DG_^Zu*-A4^syCHl+-NUu$0
zr{w9wz5m>E@_*OQozDN|K<{!0+q>J@aM=~WlJo!0_Esx%{*PX%pU?k4#i#iEUygiV
z9vt+~{(5pydIgX#s|(Akqm!fa+UDkF-TA%W|9-!}fBN#Q-+!M!a~0m2deb1h?b8mb
zkDL4(50A!dZ{6Xq3()rp-a=gucj|?8u|&b!$osWFjN<k8j_oaqPTjlXqmx65AHFU{
z$9VKsv(|H_L0z`)hi-&h>Iii%JokA5nieQxVF>Cx@7>3X$wWP2>5q}rrvb*WFQFAR
zu;xZnKnfODP(Nx99ym{)JaHay@dx$2B<=e8+WTd2g%%az_DL|%KUX1aIDUh*Yj0JA
zmK6Syg32?SjcWbA-`VN)`*qAxmpr_IXP~(C>vA5B8Vmd%6~7_qwy<bJ38E{2^Cl^P
z^ZAe}rtz3uW3L2(OpR#nhFAv^>?Tj)*_Gf>PGjL@8;zkHFoE;sao~>dKj$C({S5D}
zh;&98lTz-$*|4kyf{IPhms}ewqGtod#KYSmJFDPpx*S@@1@Bet?tR!5fC>wnY#d$M
zbg@<jdbThxY}W8Z3#S#``9(PX*Pi<p_h3jL&|z`=0^{Z5i5l*Dac46DO+IiupEf9T
zG-d=bm*C~CO@>*kBZDE(4H5y)#xs7wUqakj(~AaS!^QC%yw@SExf}!7<frWve6xUV
z!GxGCkZmDBaFYX{W13xm_?C{yNRigiG`aBmAb97g<7*@X!9^t)3m_!(yxn!^Zj;8=
z87%w>Y<?QJF}U_*2N4Jz9auWP!uwZuB$<E_*3@$W&}BedDBMUwuVABac?;CQ_pfKt
z&t&}4gV!J&XD<A3CrNFebn7UF{?f4}f<SmoEq9E25ydjhC@hN!=b8H!njubt-O(9!
z=GvXbd=!#~h1(+sxOnW*iS>L!yX(Mwmco~MCG&P3di`kF$A<cX7@(kD22qS}2|M+g
z2)V$%5ttzct)Ji}BJP7WIh1+vf|YBphEifRA&V)YRLYE6WwBV-t8ek5sg||9L~tyv
zqn0c~n!GQiK%S_7C>o^uQ;h~`y78U=`}Mpk_ww-M@O1zDP*l0I8fSHhu3$P##zrIO
z?_x$<)klw=$z>mpPU|X(N!B_cN%le+SCk-kLT?@>nNJj3fB9w7;Fn+aV_m|?0Fxd+
zEScniVJO7HCa4<Tro}~#IFH<h&ht{NuW3}O>Pdol@$}jgfM)tFq7q1g#e@<#Z9Gd6
zO11sPGTkrTb}@S>jbpDU4;Z78<mNGR@e~e<k)1~m3QwxksFaR}3<z_LJ83K%nvXyn
zr7Y!%BjW-i1gK?lvfY6-Y;woK9F=Hqn-Jd3@XDQCRwsW#_7&#EV<S-;p0a(bj=0Cp
zi_r7FJ$v53wQ`6T{GdlHV$u$}n{8R~>Bt*T32~Wa5TIvp%Z}=TQX^pL{Q;CPSc~z9
znv?_AIoLmgg*ljSG6s(geE0;mhUcTHtY19g@J>E6+wdI@r>LiR9N5PN6|nEaLfnt8
z-FfYyRB0dtyiJ<a5jqWzOdxoX05lS<uR5-B9+?_fg^wOz)at6wF=K{3@^0pIjV(hz
z@*=!KDVlZBVu;rq{b^9nAY<2`fL_y27)6OVv;qK<3w42TWyDReQ)vtZzj|iwG1R9?
z1*2ItAjkrVK+WXN!*aSZCaed5dszr{zHNZ8kK`SOkG03o1NcuIz%te7=;ZuE)uR>k
ztpY$RivF<|53l;}X!LPqzYtcqK^g@<fQAh=K>4^=UE~$_Ct3{tIsJi#KSqBL^gm~O
zW*=pIg7BZyogn-ey}9{kb?2t2Kjn9JxzqTPYr8w$|EMQ@^`t-YhLb{9kn;PVX1CSu
zX6}Esdt0r~_dlQFQ+)sP{P5to-0?$|NW3t<!3=_%SI?9?ME{4QlTMosP*e%@LI|!S
zDwI5aFpb`cLKHuiBA^$=p-WyKcmSi|^}6_*j%1Es_P^hM{`?ekA#yYL@xm|&otKhz
zl8)s#rDNnQ$k^$o*LB{(HsmtmDts)W&Qx;1pBb<hL@f16JrxS+8mfE(n7=6ani$b-
z^cZv|cbXvwy};C%>iO9D!nl{1xx<MZB^i%rE}AOzhZEnM#dzDmJuyMTe`s1DP}6YF
z{(9CYW1Gwo)yb(m&h%E7cak!hZl})8uzWE0X4w<4<aUI?qfFbMjY71aQR9Y&Kt{6&
z22XIQVfuk4#SR;wD=@HqOx`1aSr9v96psh6`}@?aQ;QaJ%#1x^lVM%MjqB=GC>eLv
zcD|b?kr#d-1lA?=`?*-2WQW_o1SzTqJ2fF+pY<<JUhE&8_TkrGGVKM?W3q3~wwDI+
z^7!c6gTDOu?)B>|lnCwT3UP+{Gz)ADiZ<}s=jO9C65s8Ae+W1neAnOq_U!fX1?ax#
zN3RYus7&4A)nojpZ$MJhhySE;faR8iiSc~mPyIL&F~kFR^fzb?ZDbIf;w1fWjlR-b
z)rQndUL@7jv$a|+LY=%H*J}wZ=h-u-Rj*sHjYlAI7%Sr$ZVYn|g@epT6Mv8|Hj8u5
z086vy!FU{baWFPIpdQJV1F!D9u#Uaq&OEHuYP_ecQx5NqXHvx4DYSUXB7x7M^ur-S
zG*^aKX9xZ74^LCf!`)U#$k4laOq*3kY|rS!oBi|eh}x}YyK4^4`SZim)BcO2<HM8J
zPTP3X@1wI(zYkwtT$~)7AH6>5_pNMt);~QwJ3l=-IA`7z03jN0`@<LjsILicqVtv?
zktOl98_ux*a>fNZRp_x9Ht=igO*8I%U!ntwdpUJg#oCAgJ#o6byS+LROjFDG2E$l1
z*U>D|A0ma;{b(?8XK!nmzjsLYx}r_ihPaXb>gV_?yr|$G&R29}`eo62w3vZ-WJ!=6
z>G5zDPk5r0sGgrK#Qw!TclZDHXA{hi-FKIIfG^Ykdt2LC`!6W)S^xhOpC$g^yf;4U
z?=SZNH;Yzt@J_@SauOYpt{aZXcy<&=qZw|j@o&TQQif;AuZE-Svz^4Hmt^4(9j(I{
zF965>Wgn~5mG6KPyz|2GB)B&0yB)XLaNL$*V|>Ks9_}11hS;D)Io3qZ*adCUn~~pR
z4R-90VdDX!k?gg}3Im`M6fRS5IJl?rrk-xwAxF-d+j5>gb!1)vonWsIwc7Q>HIu+F
zU|4%DF}M3La3@|gB;R0d+T_m2s(gl+0+6YPXUl#xC1Y&9RKe@H$idCg2B}J9ES~uP
zvH^6~q22TVcbksB;i3!8MXy_Xn2g89vt$?=$^!88@Ob~n!{=!IGYZ&*sD)sf&ex9V
zh>fO2G-gZ_w@G$knqE(>#G*2IfUL@~g%dXMr%X{S`5w=W<x1#_(#w?6o;?I^;p1$#
zmF;J)-*xQ|pK|&^^}WXIooZ(q-(aVR)b{rAt(}4uh?S?6omB6|h&|UjHVpG5-I>L#
zygQ;*=({mJ0pDkZ0oi33^Bv~F(3@122dpvTe*ZVGR1hfV9|G^7!sep4_V7yCc>z0k
zpn$&fjMkU{;ywkkfxT7c0hA*R(8rx<Oq)jPAJ5Puq3VXrUvDH1Pvo1;?ywX8@(O)0
zrf4u0jAPo>swq9<AQi5%4<H8;GV<|aapItEU~?I_AuZQF)wHewFyOo6{nMAQSvop7
zINm=yb2ik7{MkXa-EeBz0#Kj!+g$94)7<-anyPoDilzs50f}<|vl8ZD!WPFr?Em%5
zyu4JCk<OSdy;z`nqZ&?Cv1cYGJjAmYkT1bJ?z5LuM0a)#_V%U#4Prnj{xm*1De<mH
z`%%LdHF0wnA06del=Zx0#~Jbk!_yUb$P?12Dj^JL!JfPERfGMLR1}3-;9M@;(1mFR
zL=3%4H`HLRK#)$*Y?BNPFl+%@9iW>I#V}BA(g7YY`9n|KpqVqZ50gkd1EsxX$M{*T
z>Z5F}?xg>R=sHv(@RNMX_5aTHcC(q$|GTYj_p|>0DL%#e|LOVZ;bE!TuS%3^`z*5W
zCFoPg9&6EPSwUL;hZ9`#qh)0UoEVXl79D~JxnYO*j43%vGS{C3;v!BKzZm3Y0xUFN
zgrEUX`~$-U76sJQi(T@iCNm}20g&q|IY*-GNjxuu>lq(ID>Tt)7yf_0A2tMjY{q)H
z0<{A~BpySfgDzS#5AX<;HUcvKJlZGU9ewN6YOM?Bn{Qy9dfCU5Pmoh@&QHJY)a$TR
zsaueGx(QTAsfA??976*D<IVod!!(2{*qwb#Nbxnyh5<5*jrR@~cw7~d!QPZ@j{)nO
zr%tPB93l$GA0EB@?%Zjil8`Ol=@k`k+lp_si;8!W<2k<2x|l_aIa=2Pi_EM<dFO}m
z0``2caRv=BA|k299eRHeVdx0ZoQ5$P+K<Tw*NYP79_Ju<pk9vD_V7B&QV4kg)tQ(5
zgTtd^=o9e5S*}CJhx;%32d`hf*~b%Au|dYs@aWbB7gFs+EFK%P$*pB{5zt=_{|W-=
z`~Bmi=fH*wbw*ro)z`DO$1E<;{lD)`Fs@nVLA<wKR5I~Hn`1mN&^||dxJcKy<nLIt
zfi!&2keo+#iq4e;df<XsM1vI7+d>rW#LYoO<^f5kjcb1d@`3^ekjK00&txn}>+pCK
zJr+=0j`a=a1;zxqA@6hy5&~O>UUvi7fv!H~7@CApcgMy-?0ioa3n^w|cM2aCjGKnY
zF?NiIChkBGAdv<<_Lep)tjfW5iekUeubU?ffzL&r2po<;@Pr`gqM+%@$GMS@<H^VQ
zX>)V)m*gk@0|f`7ZyCck@%o5-HXNP2;^ujD`MVxY9k`B5M!x~xT#&w^JGD`2Af=!K
zTnM#hDq)1Vv$7}&Bh8=uE6bd!47&{`g6yq#OGA^2Hzsk#(6I=sZDs<@Fg5hncQIW|
z=<3)ID<xn<7k2Ft$JLQgW3YZj^I%4jB4)<KW^<8kaF^o8nP7XVZYm;VyKfDaf>NW;
z0aMaMktqR8>qZo{%Oqm-Q}dV2Wc|?6Oyuq}kn3w%NwF3NLHv^}dRl-#HY?VD(F~TE
z`_*e}HeqGt3^q&bRzyQVLAxkaNFehcHo>va-d3QxdprQpTRn~lCBJMsM+`L?ZXRlk
zID(htBmbQb$`anGQ<w(UbP(1ovw$|(rHQZ#L1)2<9U?Re+C*h=I~4K}Be#llL0G~g
zI0$m|!(JMxS&$yMUtoLtdw$5CKE*NnT~oGUu1{Yl3-0^W3Y=7Ko0T88i>g0vzi*^V
zns5J9Sg)wrP6}A3u-Q(g*-on24j{~@0!7sywX+q<0VaBrfG_J;k%mI!=3IGro@H`2
z9lXo*@~&k)1%XRn8g$a&V4xXtSxRDAWagvusAfE3u@Kkw>0raraMe*DKtt&s&YXNj
z=h1&1p7&o}obP{oe3*NmLnE2k8V!1M7c|U@HZ+p=1{xGv#w5U~yy-mktkf7SBgd!=
z5yG?*A}0N;^e98bD3CwQgyQRj6PF!%crcndGfs0{a{86WE%Rg&1aBAf{*@bMucb0f
zOa@5&OoA@yAAC{8Rt>Pk3cs`LCS{6#)4DeGBV1&078IPyX;2340JN5Bf)3`?3hcmR
z67^4=zg^T?b?Y9^2q5gpf{iDaDM4(CvW?a+o2uLfOQO=USTNPd)Q#RsD+<32N2>~J
zNq4Xy6#Cy<O=GX>;>NRuP?hlmDliY}HT#Gc(2!@P5O9cb#QGy2oyhxBcmD52NktoF
zv_wRD_RJvSL#3Y_od4KAIoLn=?vMyuO2aH4MvFm?4T13$lGK^|B4&y{^hcA>tPoxK
z<G75+EEKeXE@H_7hBRodXst1+r`S_M7_hI~r5976Yd-u*#KRNklux%|Kljd^EKu)q
z2HurB8MC*&Y#b^67?uD@nB41X*MI(CJWF-rJ(6IKt}_H7!iVT=QmL-8lIRQstC0bw
zLp+0i$1DG0KEhLQd@=Q4U&%LP{!DEvlYqAwP^u49k91ER$e6t2zc9$L4?9~NObW?G
z!IK?t^Kvsy7XMvDM8Mdy$_#XnZ8ae>Z<o<+$PX5>9pNB!%1x1@5>U8Pa%6T#SzsJ8
zLT>3m^UF}rxyEY;7-|YFi+2#L25Vz9%Mrl}YXGfQ$YOoOt$eMrEXnYPm$3BOlrk+#
z&Rxvw!g=i>RNi<d8}3F@nT6S(Gxu!H6ZK&K;J+`9P7h1POtLw*_ElcP+%Y5%Pqg2a
zEixG%CKktf3oK8x11bswZjXbb<MF5$Sr6DKkc1aYd{rqL;)aMeTCkxZwp6cpr$r&9
zS<5vqY8huNhF$6_*<zk@p@`83tRiACR45h=#(ZN<hcN(PGXr=MT$^zJ*Mw^mYH36s
zrs^A#%{VlvQSY=|V=HOe5(AE>9*03e;%+c;k^2=<8r*Ced0QI>+O=Bpm6`_XBzu)Q
z$lL7B2&L}-njo4tw7MAv-6hHbpZZwYkKft3FIjly*ocvZ)j$tr8ROIKtF=v_)v_k(
z5K4_prr&%6sl!67Jn!TUNtuh2i!+$fX<;J|i}mBI+_A`<l2g-kw~Zy+Dg#B<!4iQD
zC2b_EyhN;sx+RA^30e3X&Qya<3*@3YG`)jlR9MP^<?>tm0(Rxc|JH++Ovdz>W#?ha
z)+HGvdTq3p8y+4s%NSL&q{t2kPUC;?@lb-wIvnOG42)5LN@atfjA2R!!D3Qo7h$B|
z-52?@lA-bd1d~yJ^+BMJ7JHU~G?%&ZS)v-o9SjpS(J}s!f+MmHmXgdOno~?Lq7g#+
z$8tOrcW5-on#v3tlhZ88=m^9t|4JC+aR2PEp1tYG!BA3I{k7Du&O%Jad*vXJPyCmb
zbFp5e2Y7GHSFQCV@zh7)EFQl~>?L@aEbtGmzHIP~^)=zbhpO&U9;@2SC*raEA|ii2
zjKdK5du1?MArS1xl}#&f(0vK0kHTYVUPrQh4CcwLef;kSu?}<1osR&rOIb!V-G!0v
zEIn3PdTjOYbKHt2XnuWG?UpPXmP#b~lS}#^$kAFzFmWRs2_J(#l8L%lfS~sWb&kU8
z<87+XF)`^VP%<+(QGh30kr=nf+H?e~>%1GvYPCdL$|Ei6&Rv#Iq9C6cR=!**Up6zm
zsaDW0=z!rL|8RuqoRe>lPR>kM01Smn>Apf8CK#v*)hQY*rv)NfBLOLW2hk(c27w4z
zqL-yCV<Z=o<U~l*e(28dT+&FhMCQW<<M8qLt$62>r+IcH`GTyHu*uzv(Xg(3H)f10
z9<P7#)FEdfHPp%80ml1_?5*0G_=rT4Al9o|?g|Jmeo||f+_I(CLA>seg3`7s1t?i<
z*M#Am7s?*}iF4d?xLpU@o#QPB;*x~?p7?LQ$!$&3Y~vXf_zCg<WmBW|RAE?Wx1RjC
zk=58!rv#AUghhp+7vu?!&l5`UJ&%SY*FH3K>6<Deu($IN0sh2ge_{V3oxuc8VQFd{
zx1HnD3q=47^Lyo^#JhIq^nU8bLyA(YC7-fUVJDgZpCCaA0?)f?@Q$VBJcxX@cbs8E
zi#b{~wUpOe%HWVL!20mt!C(5v?V4Z5Fwi<4nSD?uZDyjM{GvhONMsd;B@1eggGSm0
zMh7=Sq<rTYOavpo&>E#1Sq$(BhWi`Lh_m$jWgSqFldR=%&DCZ1mI6d*)xed(N;Rqx
zOkKTOXUJYzj}xF(Aqu#36uQC&n)i)yGfUEn=o;a$mI)LmjYdgvDZ3|t?<6VAFnwuR
zp%6Bs^(n`&CWrSwxblW?%_N$LpaTLTWOL#*>$GmNo@ELkwq;{arD39BNt!0KSgz?S
zV;}m}+Jisp?jgB52k7wP>#tc77swQjhR*?JY(>_Kj@GgUDSAaW%uSHSD&V4CNHZ&8
zPE9ioDXZ@vmYKTTVL!1ZM(Y9-Iv&>Qa^YsGQ1B#47AN9SUL`A6-Yk=}#{7QPP-83<
zWnvQRk}Fzr{)Up507{d*`WhiCahx@NC08kV?TlKgYsh)!u3RJ6rx2nVuBYQ*-bLxF
ze6w7MEo?W<_dHkz`!h9V#0(|z;X|ir{P2OwNy6*}1r4o8UCm6UE8SpcNBtwH%@v55
zXS#9$a#zyXrC2%Vn~hez=`t?3{%wg$$G>G{%@CoKs%(5D#M75ilt#n|C4v5FVzQ#l
zeQ0xwrw$X!K+fq%$<SyR%>FK6jwEvjOCYhJao>8%(%;zsOS3M(kI4k+D)5J58&lyz
zO*rY}55IZE^C;|Rmoj*i9NhmixkRrzYZ}YE1g$>*)>OyxKq_-v<(0=6*DQy8v{B6t
zpp?L$N+bD04Ckk~%`F~l`wjb=P^qZA{Ra3xII6JWG{+P}$OI)xShMi(a>X;tRe16P
z&oDobKeaMj>5$fPgs64QGV-w|e@`U4k7=p9{Q=7P7f*R|uc)D8@rJDDiE6qeGK6fJ
z?;{|@o#H>BTb+vkRv`?;lK5}U?shi*!&Vnwe~$m~2|mT~AHLl`JJjJv%ECZo3TEcL
zIwx5drr}kCUH#}0OxA%)Nhl&1e{VcPZ`*>y2^CSHA79P;-i!jrBynhznHL72F-zi(
zEmc#+oH2r8+9zDPi~mkBF7Gz~{dnrmD+honpa1Qx?QSmqOQ-pH{(q8B$^1V$f3^Rn
zeCDen<q=>)n4x_M)Lb5n1<lJBu|HWgz>D@sOuURRU=#BxMGj6vw2M~}<Gz+WIDUQd
zlHyXla&P?UVk))C$bT3t_<p_pKTtus{c8V5_;#k<$Pv`>{<rx2^zh}G^DG+}V+rh$
z2fds65&~u_B}4C$9K6w?8g(lbG&t!{8lANa8lq~i)OO<LExSgfx1;D?0fAIF5Q!u#
z<uirX64$95q<SVw4Q*+V4wqrDn5P1SBz0e&zP@<VKM~;B@pis;I`u3r=_>4}Zv|LZ
z6Ocap3sld)*=W_(8O!s)iGnF+@^mM+kx!{WF}&Eozf^wyI5hA={G+ZtjBVz)5}<|x
zd$`UZT*TzT1Z9SvgX^M;8B6j0qJa)an39xykW`jcG-z<f<ETGb)ao2vkm3rq|EJ?%
zp!JA6x{{_aR1bQth+`6ScY1U<)K9*<m@mQL4=Hc~3n*%>sQ@r~WNAS00Ew~@jyO9j
zBI!DpKKh}hLlvZkUK+rr+l0nhZAQCHxg-)RFMbB&Uodoa@yD=@x{O{iz8J}gqcIFA
z78FN5pb&BP4y;>xz{vNHn<oC!fx=D}0clkOQV6#YaQn`HEss=V#m#l@vpKpyEJdRb
zkM5_yqZ~EOhx<{qm{P2jR1gmpl4DlLrg?@$a20s6)jvM`{_r?Iu?kqX08G0GOs%ZB
z%$zltyQrN`#dg|D+G#Ior(3a|&XRUIOWN70*iLszJ6+w5aFS99idhCFF$eX?uK;>+
zK+P*F=L;5%Z=TwPY<|T^%knY?DXL3JI_wp*iUvn$sg5oN=Uxrv_FYkK-yh1Bb-4`X
z&RtRN+#kx_)llx<73J>zp}e&k%3F6ud8-&@Gb+ymGc1oNn5fS`FjO(SERZ0HDz3E(
zGSA-a0}gbnjg6=C1vP*Xw`f(F<*D{WA{ylP0^F4|=V#?gU(1vHac=ikPs)GoeDQ^)
z&Y$vi1c&c}Yv^9sV1r!NmeB;4A|2AodWjjt{Gr0~=;Xy~_~+>SX#W@ho}wP@4#NN=
z2_rz!m>smo83rR;@5DkFG{j4ECl^W^qjReQBD`}$3O_J(qalZUptd3!12H>xM<ZXN
z{11aD=74XoX<mes2mm)4q||c`(KvK{ioJ~HP(Fn(SNmgsHV*L0fda0fmGhpl86i98
zY2;1bc@YIRrD(}9+D5yWW7VoQBz<1nTF<`B5mJ^bmBt%(1~aAQCw6M|sA1%B#A3{$
z>4KRxQR^hIFDX(ZoUhkZUfOK!R$=Y7QM;gWyRdR+dF4)F<!(~hX*GlvHd6d<kZbMt
z=KF^Evw%!o$X23Ns8<+uZ57*v6%&wDu|%URMypc@y}cCrox9X6tk}snT8vlWu1!}h
zM$BRkxz4g5&#*J<7@1I5mCMYc^lfe@SfG;{>yc#(lbqmuyvfh1YPw)yFH91tbAB6*
zGEpf-LZ+i{zNQ3foFGEQ*!(I|sxz9qNVIu34BgvAt7Zd5aXX+#ea^+UxBfoeQk;*E
zY07Ga$Z>Fq>u)xYqn7MWjZRVMd}0v9aWIwWODRl<K#3=5R*_GK))bv!=3!P047-DS
zN<CsmBqfo}hGWfZT(lD7+?tg5x>ZjCcH-)S%N5(~OJn$u66bpCS0i1))ii)UQpg`#
zu#7I!3do%Ya_GRHb>&f$Cbue(TfV+-sj!{}46|lC$10?bqBxh^E9b@c>Gc^XNxo_3
zL$u_rrC0Gs1N@>hpv=VJB3(79MHTQ{L&9&`p^+WJ*q>nT7=bJW@mH<5YJJaofhR@B
zi^*gqObj=}9G?na;UxybdFoJk^z5UNm0!YhzigV*PvYokJi<$=j=z2)Xuq(5_<8Dt
z7IAlciMfLjUU~HKRWlvE2H~-5l9;^+ran#%GA2hG@+RAmD@27w67z916cVKTU)a})
za~!4ZRyeuQdfI5H$RW=h3$e~wfhiJ3AWW2C1A>{<yxdEyp7G8h>7p_n(gPM3p21?N
zWKh(YNFTqbU7}lP5<3ndJuE!vtrwc7D3<<6lz4PGUyU%z-X}Lg4M)vOXmJG+&Y{f1
z3=xs8jF~jIGBE+f|Cpis%4?v>79n!EXLi55gC%Rzn=qKWml$l0=O3qEf$h#LlGw-#
z_8Q|W6y;7QbCRY|;>&^aN6*MsdPd5Emdr>TO6&&@^IFA0SW6E>T1@#F$@I0OhH1?h
zsI|Kf)!NE~wPp<0nvl+rK5K)}bKlat_e%IA;s(ZNJYGD3r3038UiX36(6MJvb(F94
zM3jh}YJnIp(u>P#6LRX$`f5@N$>dRfwk=y%c(5_`QriEA)s3e)Hle>88+%MA0W!H{
zd&s#L_L*IunnxY!gQOaR{#y0|Egrx`en@>QBT2x@3^U<q3pC)+95QucG~F|<JX3M#
z)bo0+rm6UhW!|41{X}K(qUTSLO`xS(zTXA6hulZS-Ub5SJhd>Xg&;|IyISj*u5t}1
zI!vssl80ufjNC)x@t&-`>4Lxs#}_gM^xO1fZOvrxnVu)46t7X91tHwE8)4YVp-M%L
zG1Y<5=&qLMj41a~kM<taEJ(>koK9vH;IDKwsvvdc0^K>s1P_-kyv#;v=ede_aUMLW
zIP-4M8elLnl1@@iEI@n_;`K31x`0xw4?VoASM`F~2I)vDGr$_F;d){K%s!qSiv0ZA
z5NmlhHASGV_)O3Cg4g;Lj#u*hX<86e89V(_%c#t%rJ&bEAETAxYm9oKV(-dbyvbB5
zb_Iqw;S-_ivnJ)7L=*F=Nsdx2Bk4^}L3K2gvK1|vONlfB74@Mp2eo)8S)TY9OeSa|
zboX>(L6*RZaysQFKF+Jdu!0wwafl?;!T?7IR(1TE>cXCpdoZt?r)X!gNox6vaQVY&
zXsmuqm%T`{RP}99nq;PynbL1^TBWfE6aKB2t%iPXsgv!~WzkZU(P@5R?97oA2%6H*
z)L{Csex?UynYskUe%aH!!W>`51}PlG7nkRNFRQ)Lc=MM8%UY%nbwi&l;w9Db>b$9Z
z6LLF~l!Ba@#HE`XV!%(dy;+mURCIbUS9*HYZO<p#^=Q0sVDwI1A+f58t?PgAo@n{5
z@BTMMnil`6`=WxuT)XRVs*nl^pby_ZeUYJZ$rh^UWU$;lL~2yBQ@@k_cgmu7xsCA>
z|Bv=|b1Uor(do25+kbzGPqF>?{^{Y#e*gThZ<e@!q|2Fx#>usWGGg{;w5>_(m<_XR
z!)BQccQFGbE4=4NCx69k$jMz)rnI)%HJ`Kj@N;kMVi^9BH*{~=)|Ju_z^28IJXrNc
zX>-!&N2lk1?LR*}*oP+1;LD5si{taPzdf(Dny`^+0mCL}yt???-<B3mrzU$x5i9)R
zTeR_wuRYB04M;gdj9rpJh2Wl?A07PVtpDclw14sD`TqIg8iLK;5AmEN7d`TCiE>Xs
zGqBbn%INa^tEj9hRrEeiwH+6=OZk1!xi2!lo0nc5@D2(`*!c|Si#~&!ViKa63nR!|
zHwQJehQm=p*t#*8^Xdj7meRK4E)}o!)E(3#(0}myLtiwpDaB|J;@%hZlo(KS=X3Za
zVWSopM@DD3<2e68lCYAZ>xDihSDQ~3WS*WuSlp8cWp(?MDkT^hAM6$t>d&ukiweRz
z+~6Q$`>_AU4Yp39jqOGXbu>30qdR@7QB`&`kB<gp;M2yYiUwoiPZ6!BPN&jfSm2m6
zA~>1WocxDM<!F>E)O8T0?{3j;K&9%Au3SDTnYo*M(U!*unNiI{n0g0qE=175f8QP-
zKCeydYc==>H`?X>soUWwSz#r8`TCxcxF6_@cBl0}jz-m2{|f$}&31PEZ?=1%*Z)uP
zDPI52&z@IU{moLzvdD$--NEtU{)w^|Y3Eig<fMrH&94&VARbAq<K!)ECTou*87Nkz
zq(!hdi0kYFx>r7Z43z(!JUQ?7xtspaA#|tFyWxlH|1j^n-JJg4-u^uQKgFj+|L54p
zug<<dDA)f}<#a)LjHX_-&CN~N>h}BJ@59>l@~q!~pV#yhPf>cXKAHRULvP~Vc%z2>
ztve(ig@U(G*Mrr!xGt6`cpG`Y_J>gnih=E|sizJ>l~9E+oqE5S5@c8CH(|bRnXk!5
z)qLAF-}d`3-+J9tfetmUNlTG(=x|R8jWJDH&5ATAg>>A|#~gALPWoFn41F)Garz^W
zmOOH!TK^Rc)2lj07)d|sbve!=e064?hsnO30Yf2$4-KksV~Wg*H&QZu$??)Oz=Qgd
zk>&%DSM<g}56?p|lT;eVqaSyACXx<5{88a}v(wArNV+~EDg&It?5Q0yDY^u+l)?S;
z0F#KlodwtA+==d&pm@ffz>f$8y1tuF+!%gL=?TuD%?C+BCi_smw@fjZi7+Mqa`?P|
zdidrPuZ{4Cww_`g=gTi0d4XU1aSqPG>yv~1^P1am26Y|zeE)~k^K6~$dmuIdAC%&F
zvj6I^Mxh^Y`_OPSx@kPb#mOjWfpvEA;>FRAy2tg>hBJi|H>z~Qg*E#Lt`*wpH=Ugd
zrCLs_SD{$DLYa=!>#pY|^~=MP!_)oqLy^>HHIy(77EXQso{;3{tQMwh$bVj6Tgq?9
zXnSI4tC;W0FO!D8{1W6>VuG$Arv)08)UV9sKqe@$3MpvBdE_?K;Fd_kReFXe+U~|P
z)y1EyOEl^2QV}idS$!{S*R8KKv3rDzCgOX8iiHHl6(UPePJfW1Xelj)nD`LW2{e|G
z^&`+nR&)z}WL)sff7wXZ5&Jz8zol}&Dt@X)4!=r+WaE18hSLC49;ak{R$%@VcNNL&
z{t+twunTzWjSdB^hH_m|#H~G)k!VyH2*8rUJy)U*Zu+v+L7y`>^b#svd+yunENw9K
zBkyMJp)->ZaO6ek{9451(PD__S^a5HPUf-ePZoe+LhdS}#-m`~+AC-&9X0ZM)!>g-
zgfGO{tB8IuNjFf1p$>Q?HD5Wz3Kp)y1i$q?L%vXJPaUsru2U)7XZ<uCqMgcV(xK!a
z_6K--Suku^oxoXfVpn2aSZrZ4@P}t!(5rv&C@l)-UBDY;oOKQ;{!tR^l{y1T_SBul
zpzo54P9kVln7$ZkRXV5mNq5iah>5JyKi11MA>hU;+R)GIcT=KPmGfgS9$xj`(P)JQ
zdG+=9&T@W#H2Q?1zL-GKV(?K3^!Sm19(qK>hRnHk!x_ctnR%C-y*n_%Oa*f<bZ3~`
z2RFR9i(5pF9}57Cv=IRdyTe#qpF;ogDo$pGQ$trHJd8wFPG>{Gt8X%d#|A?E{ycOq
zr)~`~f-QD!zKE{s_2Tz(nefEvwz@qon45$}oY!zRh-f^atgQ$0q;Yd#E3^CT5615M
z7`{~Vw_^C!`TUOb2*N)WIbMhVOlsWx(a7;*aDVhza=m9BsDA7liaVYEt0#T+L<NKG
z4{Y}VOYZ-=on9+_{@-bCwY#6s|3Ag2`21gmJN>rw^xrI18nTgs9#gDFO4Jhs=qxbf
zTX>Edf{Uz+m+2dPQIAu3;aO~@#kj<Iw9em#1g(#1X^pNDDX4TKDMw#)0y##AeS%a8
zJX2ZcEd^urg(Uzxz1ib5E@)ZAMkCOz85&j&Z>2@2sj>q`?ik~I3_Rncc`=imVTfr`
zS3Hr?*b`pV$pkvzxO$J*o--=gKnoZZzWP0<c7ffD>ZS8%x?J^Bwb3sJpQaz~W$+_F
zLIsTp9)g)PSILJO30)2U9jKtK^kYt~=e`3~9fb|GDF%@84#$o2Ej@MQk%62EX5*P<
zl-4+jlZQ4h>`jhNFOty@4Ux$2xxUGMCkn?jz^6~?9c_zB2+nc387n(l*mc25b&ml8
zXGc*m^d*S80hkNZLMD0Z6#c~QMD1YLb3ltgDoDCh8lpBd)uvG=LF{ob98_c3EX9$T
z<Fl8uq^A@%$MBVl7;}tjA0dnnvxtLKZ71YCea+wWHpK>ql7>X0LqmDj0fl&hk%R~a
z{BSQZYysBCUR-&zG)(mFf9qqKL}gNiqkz#a`zgDjhY#)6I~W?;ELew<yrO@hrw-I*
zVW6W{)1XQM;*{ME79cCAJm5OPftnl7FmG!=z8dLR@u|V8XKk)2Ekddpo^&-mr!3fg
zfpcH((K2RcI&go(k>s*!N?U~iu}B*4r)i86i9-o!Je%u*T~?QfX)}ViRlGM8QyRhY
z%iHwtu~8AVc29a~F6!eXs9Bm2nKPp&T#O`r;=qv^Q>prmV^%56g=8d|@;zFEGnp3n
z;)K&2&*RX@pTOA`lJ7v^$-o_=Wx72b12e>|uOCQ)gNJz-X4)}(@++vukD`7-A}=GE
zGyH3gMVUHnXegh}eR7{W>HieKj0P~ARj>hEX8+%5_p<gsJ=hX_*8e}jr&#|#-ambL
z*gyOcf0o+-W=nFgnMceeQ=1IRYUbimw!pulr~l@Kfr?urpysQCl3(rw)>PC9jeLXB
z0DWipA#ZADK_8O^XWFr(t~6TePyHFgPCs>Tin|k5=}vjGsV0+7CQT|0Fww2+hV>F*
zQ)6sK-1)yRW^a`trSnL&29<cWJC?%EqyIWQ@4vb@N7X7{puD}Qdpqz}Yt^h$(soiz
zMNUe+o`>F?-g=<A(FxCz0av4!f&w$bkFM@eb9ogNF@h>Z#Vfg`>O2g_{a99OnLGNC
zsCZT27+5Fuqg?$wkERg7zeT`8Z#lSS_PiPK^Lde9<?{jle{3LBaOP)zme~JpHM?2=
zzg}zmv;FTU`7HDQJ3BwUI5=N+3YafjAtMZKpq6HY;gkI3d1Gc3Qp-@zqViHAdq&Yx
z#PVn0l``B+7qNG<tPqG}f9fqO_3O%Ma!SiigCM?&Vs9yp(0S1d=_uFgNBBEuQ@@=J
zufkvkD3FsMd8qMdI%D6Ph}-3wP?6};kJr|w@y(t-lRAeT9v(iq#<`IkLQQU+`69ej
zX%J-V=;)KM5!oWF>qt55|EXgf>o|~Xogtu-miOndNZt5Ta+^p0%#6>dGY&BXB_4{Q
zZLi!5yN(0~<)F(1Y2=47;Obri9YBQm6Fm0D@cQrE3FX!?Yotn}fiU1DaNODGaS%G8
zhvgLda?$nM2uX){_NNhbf{}jgoV|Me`uw}I^TRj&6a1Ic6|FIcVI>+?w24cIjx{kR
zHs$Iy&;6K&s)jS+@S~Gkjvj=T-e?{&3f4K~4=@JMnhLn1cP>T*qO-o4ckOud0Dv<+
zFj6(4%YKS}%<v)(_9?lBfkY9gucHM8u}0TSjycY>A9)k^He#1epE4Suqpc2IuG}`U
z%EXI3MER{hXDl$N_R)-Zbm+oNX()G4#!*lwdzWj5H1%Lqr~=v~zC-6v=&AqCkBK@Q
z<(tAFVLT_|RrrF}kRt}FhA$ZgddwsD92lL>l+Y3&n9jT?;#lM`*r7yOCD#C~_jk<5
z9Fi>ck|ER}@F-V}9=9w(o74@(Vv3a2LyGjHs7(NbyUz^>GvKi;44O|i>x>?|zXFYM
zhWymr+*GhQ)T(nxBvvV+6(0<4Db^LtCTF^s#6FBlWFo@$6hdxp2o2W}<&o+e&>6Is
z#gHG<t%ZLT1S6V=bXuk*1P09lK&a=Fgv*g%0ZmAlxNI+GJPT!3Vk}(`prRE7zRr^O
zxxqX<aZ?OLNtU=Dli1Zh;DqqTGnS!`HfOp~SDcR3+1QM*AT9o(R8p@V)sZGTl@~c5
zOx@Wn3l)MwmFYYmo;LuU&{MpX2o>IWfK=32m=amS$iw8v-s?6j@+%EpW)*h^cA|1=
z0A*pG<iwQ78lIq-H{1(loS`_w5F0e%WMjJNp*YZf+sSn12mnAiW-X8#FmZ{QQZrN2
z01q#ruRrB5{KW`u{3amACGnOlK&;?U#Quo0C2%Zb4>)TyVq$q@8YKM5F{5Ejzlx;z
zXhEnUmH9yuq@O^MEAuFcB%m%~=<<VvWQ^GXM!eq9yJTS|(fPzVb5ZoBmd-R1v|O{`
zF*G+7DPZjp{bbqo28{uexDT?9%}m(Btw0y;C_eHAi%as($%?n3=TC&?_txL<Wi$@a
zH8S&6xp^mwf_c?M%7FNOJBKc<a3SYy-~}hXhB@SeWSC()RFiHK8x*>NQYg*m6Il3=
zdK(dlD_W3Hi=jsiJ!Nq?IS?P#()UU#1*uVoR-o)_^xxMj>A+LPk!GlSh=}uU5E&o4
z$zDby=bi5+tQ2kXW4TzHOn@UAdR5iMHox(oZPIRB6~ap*KN^NU$PyQqOwnedp&O1^
zrAs=Xe420#AG1j<gVk*3IL#-hRVm7uy_W*5Cl)GXirHCMb_r>vXn_ng6K?paZO+#p
zk_*MYzEBjW{RYkAX%NP0#i8sP6vc#7aXcm%bf2cwPqhdfyt#0E1QCMR$jK$)G<PWB
z5EAWFPWy1il9L*hBVc0*>_|)R)Q><TO{5eboUE-qQde}`$2@@)^W|qT)Ry_HsdEh6
zPpdJX7)C5e=ok?;T78OY53?V6V-6|_k3CFlS9g(TQbrd~PrWl1Euuw79J!JdE1o<s
z{X!D(s6R4gTs)*g?QV>rB?SLDEGn@vd?j2WN1?w?`mo7RB!pjAbOj~nr1j)({Z~|q
z)%)W9W1W(>1SPx6G1}<Uj;G47(XkmY&ti%ol3#nK#7rI!Ze!0J);FgoFC`EdsfA=|
z0h8Rj(HfTC$j~{RG55$qhcyUZ>Y`O=<8L$_IeeE=S2b#fl4jHcRZ^!j&^j+8eYXZ>
zLm$oh7`oJG^3<E7xT8Iz1N(hE5FYkpRy-L5a^9VUjsj;icVbx+hopI^_3%#Jn=z0y
zDRCZV2e1sjT+}3ULWl;N-5498_j~qTeYTy)Y-aFy<e96RZKJPSHIP3DCKFgaXhG50
zXCq0`gi;Ww`VJE#;i9gVL#<&crH&NQYZUPc2h{!;R)Z*y_Rq05oyWY1*r3Fxqfv-k
zt!VBJ%a~2i$rQ1ogxNqdLM3?5`f9rP?YDwgAuM_5$86B!IjUG2Y#pceGBg>`HV744
z+TF5CbFw*BNqb|p>>F|aR_ItN9u#ho@C$bh58_$V-`IHOP@jscaF?+P7sM*6uc_cn
zCm38fmvNW|48s^+Q|~=WUIoL3V@87<0shhWmb5TY>VI9J-JQ~d1SISY-$qW2)>m0V
z7>&Bx6q5;0q_yZoj|Hvg?<n^GWQZpk4qFzpX%nW}ViuK#a1}#rhVD#`FdUDxBAV`a
zE&<J}ZLer)U#ZH5%$0s5yOk^d@@gUnFcZ&xXRdbK6$}%6EdiO-#>l<lq-MAyL8_u*
z5pH*G=D4V$!5^}{>a@=M$Yn9aG^&pw5=q5UgQv5Asnw99m{}a++*OKi7%VQYv?fWK
zeKF&SxFOU*9;g^u(Qjx4lgMy-&r;lYnd`S@waqkOOt5`rj+jguy}wGNPNI1OOYxAR
zS30-C6>Ih79VFXFi<~7hmjq2JR@@5>#pnho9(1I`nch_LWYAmYBuB@X(OF{ftsnqU
zouMr-K>z9F+oO}zp7&df)g_cc+jvst_?U=Q>O_S%Nw`Y;NMuCd5q{$Z=t6p!oN_GY
zbXe{<7%gFgGvo0&qKeUGEJDeN5ATZl_>*^*3OI-xVCTOtX0#58<{I%vb&O{feCk3c
z2OhIN%B=}V7fDKPjfe+3RX#XR1S9`Ww~oe>DD=qoNr37$M#1$=&P?K~R8vMkJq*yx
zlf$9Edwj@EK^M8L<*~(#o1D+rssGlW4~hRYY_%!{fLmh!)!Xi5<G*#cyPy3(KFMck
z{HKFft4jDME|%OIeiNbK<Gb5uB~hW|!T0;8{LlyzWdvC%@aHmqmKK#*6OQd+X+;Ui
z;n*H7YY}5r<XXgs%UZ;8xfbzZX+?=X;n*JL2uVRK)DJ$g;b(UWAG4+$@E+@IvyUE|
z?$B#yT$%npH7mhP%A&;lv0}tzy@U5rSM*`=C9yb1Jye~Z;1Yd+`>)x^4M((T#T}li
zY2YgdVD4Mmy@(|iY>XFT$F~6R@mIPgyaz}=DykG<brIsWa30|Oz9eTx4Ta7MuY>Td
z3wro$WN{`gpb6mCp9M2UBNZm1s6yRULzQ+crom8W)3pSuaw-0U$F51Wlysxv7+%r;
zI-y;%Z5DOtKQ0(cm53B3vF;p=;@-&mFA^wZ31Oud_d;5gzaFoSE<<-hor@gw1tZH6
zCj!8DtW2>L_-s*oA@U|4O_O|8J(zK#^NBlrn@(=NY8;VD%i<~#M(lw8$iYT(ZGNEW
z`R4@(v2_UBtk$7FSWt{yoA=v`PZPT#+vNTB;S&X*$hBG0i%MZ5Xd_nr(B^LO-{r2f
zVhH#p`~Oa_)yevQb+<p~fB7VzlKAfj`v>10RtW*0F1V6KaxUgOb5^9?mhw^I*(O03
zi6|s8s{j%`KwVKg!wE*2hyw}|kfi*;%a0ivMagYAW||78yn7>kz$XP@q0E!eB1mns
zo~Yd%TYiw82DVDZfD*q#Js-G{PsS4nje^u;sl{B`mrAkdY7yhfZd%z8s-B&rO7Q&X
zjQrNu)@rrHp{s5<#J1}8nx}_HCkOj5PUld&sB*iY@|%m(mmpS7|61H`r=Ti^`(LvI
zQ=_#%h=R!i=s)#mnS4P!j?pBD#kd6Rv?63Cyy~zL>g4SB_4!%<47n3?1+A^MoB5V<
znE+Bit-p!NTjI2-o{SU?BbGOeXz?m}G@`pzcf$Mk(8Zg=fp;6=MH}(c6nSUlxWGQ~
zwa*r->!}+?l_3e)2T$sg7}3d1DE1p`@kSq;!kd0d^D>}dDs;EVFe}gqN2uK-A{pih
zS%UBde}aUU&QX+xOs-gp@{Xis!i!c=R)v3H2<qll6<cw8PV$=jnn@2O?EumT$NOhV
zs-@PJ8e}Q)@}PhA!{Ol@b^YlYhWrV+jayben^7i|2njP{Ixi2L2p-HMvCX@LigcQS
zGk5CVI)(uqS-C6d(5C?nZZyGQZ<AZPw)H~vYQ$4F0PNE^qtK!ICd1IlI&7*-patx-
zcH5Z&6QO6AV3@WSneLgb0VdY5e2KFC;8d$cbpBJzlJ~JgH-eO}vgoCx#Qd|<be>>p
z+tel7`Pp+v$52q&ltQrrJ%ujN<ANA27PS9%c>0>okdO9{kKl*%d-Hwu27kaL#se>v
z*a=1wc{i3hpKns4iR7E6&=gCukfc`4f7&hEo%BEP+^X8f68*2$+s^8L-PULS|4;KN
z*8gzTE?4|i37llk>o?~|uTL=k4Qz+rxgp2wUmLN>NMjAn{wSbVKZae9F_#$1n^QbX
zVIXIw<Po@E{nu9j_wP|KgFiIA;4cLL$rilCf^0iDX;2YWBUf~aMcL*QzQBq)_AlA2
zv{6uFgf&JUo?qQ!r7Cq?th1P@cB)hvU==jGkWLo%V1fl{iC$LnhWd)OB-xVd>ym>-
zjffgb*nm>V<*4o$wzhpv>(+-luo-^GAqXskxc=pWIE#OBpaKI*9K-}dlEf(^h}ZMP
zoZKi*(pQ23kTpZb09Z!~poA=$m)J)1Q%U1rw|?Q)k5pvi$oabpUD3~?L5}RkLylTd
zdvuMNI{L#w62^e<Q3$0+^@haU84iNE`|CntH<(2b&1KH+GUx7Xy||P77bn)LZ7lKs
z-tKi;dHMf2|Jx_|6wCit7w3mRmdbxs;vO8h*~krT*Oz)9N26s$uKgIDCR67ND$NuI
zpLA#JWT9^N(XWRPU>9DD+Dvv|<arsov$yDZ;5uw(mNR9>0(i4ASwv8=k=Qch)==3G
zC}U5m!mf@SAad%ZT9PZ@nK%xTMe>Fl4L#m>&_QBiPMJkTD)4!uH(G!1q+X-@qa}xx
z9IT{@M(LkW++GSOx|rcM1LMu9j4^n8k3?7_e*yGIATvO6!sbj(V?T^y!-11DZ1lgB
zN(0zv4WYwN*i%w!qaRcpEYQ#y9Z1Qzm4@vqn4k#=*OkMS#SFVkd0elrd?Y=E-X5Sw
z4oFv@U`Q3RuY+k2;%4tVmmIo$EISUw>yX>=<H(!97CBf<MpD%!p*{~iI>F^zeBFTV
zmQxe=D5<59lamEB9$n)Bl|{O*>DG_e^mm=}z5m0}NvAD&yZ8tGdvcEXNSim!9_;G@
z)Y<6|7>d|YpEYcDPp7Pc5(lTSYdOG$<?sO4X`=)sq56`tZq-!UEiD9IpY<<JUhE&8
z_OSs@lpaL=#cb^QA#vK80#yj%?9I^$*M#qLe|B7<*8k7mn>My>BniX&Rr(c(oUuun
zltk*VW5s?(mSsmXwxrRKWH!liK@y@6lK=yNI_&uU?QdOu;UFpbn4Mj7CKd_wSzTRS
zRb2<u9F(;>yU)4uSPWQ<X92Z<kjz=oE|23h8^d<*iyiSj1%`???nx%Dg%8*s;j~97
z5Qu&dF6!+|w&={<P0)V&YL)#O5vAfQOpQkV%-F!&AQ%%`k!K|vxbrrmM!sQxNM%)i
zg)a4&Q4Fs%xdF5ijfbStVh1%Kgp@m%tW_CDQib?}qW+CIt8o)z!H&LdD~pVKP!Idg
zLHxzu^Rrh7XqhNk<jQx1N+pR|Fh2|=$^O*J<5uXVyq8;b@<A(vpR2gS-5}~+jQr#+
z`b_{a#!vwOeKZP70rPDCv=PuAareu}*8mM^NFjU`42Rn8rU%>}x(IoxIIOs;8wXu6
z$Uh>x*WO%Pyv-KA#~0zn7ID*I_F+u0!e<O_bpXYlI*4lb;eGQNf~Q{H&e?%(>6oq4
z?$*xf@jq2VwQo+7n>hwmw=?I>oaG)K?z;l>69)OMr}!FuChpWoetxrtQ@;ZRod*mq
ziKTyT4TW4Ad=}jS47ql)<R;%xeKzr*XVT_$czu`on(AkFovLX9*1j;qIZ@a>WA3zc
zZWDK1x!hq_TsMp&yjEA_)TrU10g&+zUv^&XobK2PPfK6({@~<v|4mUH+wdx1tjYh2
zIivPZYik^F8*lL7%ZC#3SvFm({abCo8Eskf^xnUJUk#9k=eADoK77!Y0-pEN{^`Nq
z$%$R5wnQtk)X*=FcMksE0a%>YKg_k2KHc!wXt1AQxOoQdlaBi6^oQfUofpM67=dt3
zA2Xq88=aE)xc$o=Rdt<;N#1>$_5|-VMcMGY#q^rJ-ucge5*j-yxG-fpf*z|HIIQzC
zuTYD17WIK&O~OlbxI(osyVzbZOhWCQWl+JYkE%*NFzVOg1?fJ><@3E|R&zSKHPS{C
zWE6u*a(gCHcO`%6nI9^KrBfCqKj05@AuLM=R9+wWZ)~8029i-e6y_b;0U>ml4`o`_
zOc9*$g!P#flT|WlS=`R5UP>Awpr*t4s(k6{+xhV7l;pbD1R#q)tY`!E5G6;kv|k>;
z-ED~v#+jXnC0F@zTh$#;h#HHpB8lLYT0#0}0v5YQ3TxjdaNPfb0>N7*70OfZKD}x_
zvlI#o3;4JBEE2RIrw<>h`~v(24PJPV$QR&{B)vf4HNV|9?;<rh*mP*C!%b7(3BH>>
zWf(v4>|Bc~-2}d&Ob=`TjMws7Y1c2w3sbp-bHh{729DF;iQ<eWzzt~8H0_Ud7+qjb
z6jbHC%A{h57{iP5%}zlu8ijz?&R{927^Wgi!&8`sWz|5<+~*&<#%E4@DeJT|7$lhg
zP8J36htzT<t5Dpkgl%;FRVzWwbTX3B7g3g=AwIi)zhAo#g`3at_U6hDGjiUAIWVp{
zPt_VoT`@qH`Xm3kq`vbMQ!cFWTIeRmH@B!SxiP4GWS*zq!>69w8|LY@E{WO*<zd#h
z3p+1Vt|C302!sEmFlaLte#CRgmwQ?$$B2V=UF&Utes7X=cz|IvP<3qAp2>P!py3v4
zI2`=(-s_#8_g>Vut)`>ks@QZ%e-8`&antv0@ab+#dUSkvD#u$gp2|5$eV3-$i{!pB
zH56&J%c^IUheQ6f`}d<_RcF2;RbP^>%>iVQr*8{pyV^$rw^Z&o0GMMAvgX!$-yUJ^
zge>!qEr*X^5TW@j+XYI_Q54iE#$K3w$3w}ll2{_N&40e>JT}&Z$`3UbL#k(6c1FgN
zq!&~$aQ2lZM>33ueHECFuj)&#3iC^CcAA|L3^U`QUE;D1Ayd1;sFQdDhF20@yqmzj
ztmw{2uknV{@^vLB*ZFeOT&KY#GFF`eG~QCg73B8(^MIquph1O-l850$(BiQP>(k_~
z9v;bL<{9)cCX{V5n@vo}K$yDXe+7^XG<5*uVI#MTNidEvkTH-rb%%Gg8hdhCS6{IM
za9QU{`H8evawyI4;gB2kFK7+;iSvK@x6l9CTH9<F^MAI!+JAhJ&+Po4J9Fj#-1#(i
zAYIsylPsJW+5V2v_iqyr-wJbIk!nqb&>K&}ekW6B0-Qkbgq0{(&bLBt!uodkMd%MZ
zKkju-c7ND=(RsCZx_fk1H_74L9_tkIO?6n;*V%YJCg{ij&04ADnk{ofN(bSw2$^_;
zd=aNA3bn+9)HzvIY*Xlj2w(*?RN}(LvXq50p)r4^MmnKfKzQ^Q=)1cFBm{7OTmUat
zsk%<GsI%<}LssYxP1xN;k$?UP#Z&`zZuomIf-fmWhJ{aC7+~ExN;p^$xj2)=Q^r=&
zWoLYGV<QWtH~rzp_!m)DdTm7nrBk|(#;CCr7FvZ`C99IcP`suZv)6VLIa)9&;0Z^T
z!zh-LjT18%I%z&B%O}UQ!)Wj;IyGkf_Q+$>YC4bMY!1kqvLD<Hr>Lgl!SP2K$gws<
z=$Y3tvJXG{3#_p+bW*VcF>5YxDSjl8dRZ|i@K?aqFbDazWo6lP-nnREzbzL7>_}rK
z?Ir)#32Y_trJY|?5``tfc@m@-o$$N^!$!8(PL8Zv&4k^|J(j$bnQ&M-m1yerUsoy%
zonP3k=p-6ml?dkQ?S-E*vq=st#zEsoC02G(S9k2BCzgDr?jUeOJmXPErNh=EVyhV}
zkB(o_B@6+Yl_0vX6^FnyW^v5EW5DVnFG_=Fe;}!?$F6K{^w4X?Rq+1bj0t&97CEgi
z!A^FuT8aDie13uAzX`&t{L@rUXHW*R_DuyMXl<lmz=y?o;XN}oYcUyF34S8jDv(oW
z?iLz=>+`*+;(wN1|9T&9x3+a|Y?GL^Zflsvl20KeSZUsUXZIgx`^S58q{k+KzGSFw
z;%vIG;;G^c$?gvwtR%W41u3Pm-FKddABEDIe3+4TSA`k`K-;kfr&5C{o8Dkm32EVp
z=p^KBlJk<?Ed$3V4l>=(SdPjCN33MOOw4VZrt%!d?MDx3bh+e*4Nrwegc5qnj5_=T
zu!sHHwykkVa&L6V;0}J_!oS^mcpUWjBZddWie2mO-`4|<E^uU(Bc?uO#Bl1XK%Uhj
zr+bvLeC>iZbt~<{srWEsjFof1KVk^PB~e@4P9hU<B|Jx0K<xreB^MpyC|MMMfWjFI
z(kX>?*D+<8_gN9AJPG=)BF$1m7~7nVUQgURl)Ele=)Hw^m*^X=)BV^9#1+=!RC)f=
zLGe8Bc5>-56qcj6?~q~?s|f4t#W+sl0a|A(hD_4W>#nr!s&10ebAx~WxoGEw&*OMW
z3k~3Np%nx=B^!4RiQMJVhq5c53d}GFtMJ1mDEd<Jn=<sN*#ElwvYAvV7RN~dG7iv3
zU^{y^vr>C2hC(?7YmtTnt5Wb-Z0kl+Ypf}SkZ8R`@xx2TEq$YCp@x7;i%yy!cCDgQ
zht4pH9LtObepUI?Ei5pz=?sI*V5mU=I~>IA$7n^0RUSTEE-P+>jFteq(a3s~1Y^n<
z1Jj}Cv7{_BZ3t3g!&t;p!4t-qVK$#}%!H>r7y8kOV$2aTq^i?2)o7$pzG{p(QTCXR
zba!e3x2ZFh5f<x8dUb?Ivsu#gQ+3Z*G4~Ji<`>`jw~Up0xBTDnV1Dnfnf||z+MD_K
zuj^ZD>tFSMU*a<*|M%gm=~=(&{ipE#5=~w_ckaxhf!g6K%X-XyOp#@upS?WU|Ia<I
zwT3qJ%2aJ;>4E{QQ&bh(So>~E$Dkmqm4Vg_0vjSs2*>1n@aKbOKOmI`unm}BgOaVp
zgU%%&A=;>UX)quMRB||=XzG01f_xMd9H@L3RGO23!HG6XgW)Acy$gfHPkI-q32Lxc
z!-JIvo=?q5);a1u0Wrv1lFpWJbiZR95uaR{!fO@y1Sg{{_Amv&NsQU!u(g|bLLMnk
zBq|9Mtu4`!xYY2L2ny+d^JUS)`nI>a3P5#=u9O#EQN`Q2;@$G%T`9hvZ@sd8-NS~i
z!tz$JhJMZ!HuDt<W75yL!j=GN2iWf$bR8+j4s7D7jP6fv0vgWHA&Bl)ymrIeXn30q
z6;Wsl))$yqPJrZRUV_;)DH8raVQG384~CdmLK|eZnYS5I;!aH4n4$+9q8Z<_@d#Fy
zRG66q^ot}%MZ8keNQibol*tlP#(8{lcsob?%ux`_AH`P~H6?qHQgB=#Ff?GQK)y|q
zlo8PI9Po-VZVdy>Y0s`v9JZFDH^KlY%q`CHys2wbfE8puMw~o{5{cM8;IgUM-t?EM
zP5zs992ZqUmrOnfB&K)zF=m9!J4&jSQ~k}jN1As=M0yPzB!=kWlpIUga?ppR<xH~P
zkYD2~5jK_pct?{=B^MiMe^87dGXQ8`#YrClhEa6Hy$e$?QUqtx3S;0>kLUniuwpig
zVwxgP<qXZ6$x4y{ZS?=Db8vWS84<tm*3O*Q)+;J1YF4l17E_PgXKw2{_BVEpp+SKk
zvpoPxMgTmvDy-vwvX+|pdkQq+>6>cIL^c@(I;cS4)pR~n<np5culxNZ9MXQk>{*zy
zavKd1)#gF(RooEb6sjIy_?RCt3eyWxqKF7fZl}0)*=@`d?F}Wah}G3RUUcK;f}h<R
z-5@#&-q6!JW3^V%DBNQHlv(eZMnP{`zScRE!A~$<zn77>nq0c;#Dae04>)-yYVT3R
zK}15q9Wil)^9%emlyr=0t+4%m+@a*Bs^7W_)nQqp!Ydtv7(F_i35fLI+IH3M>-JVS
zy;0s3MBkw6Rvk5y)$-FajIGmvFs`UQhEjl<p<rjf8sW#({HDAQF0Nxu$`}hnlWkxH
z%Uw_x31=x;HS{qXP0#~w2M+Wg3CdOhh-zUC7If$CIP?~IbMoUZVJuNrIO)aE1&{>D
zDrH*2{6~}-D3w^|RzQB0!Iiwa1KUW(JB`UrQc-R^GBCR=MmFa}$>SIgGz`NF^fvKz
zjC1Ui_8cBaO?V31Nm8$%-sXftX3<M}H}ZQ)4Er_cQzBmUSj@<OU$rOAA-*rItgI~2
zC@|sTm^T4O`lHb8ybTjEHj%tX>~hP#xk;MQ&`i^O7E;5^(Al(;w`+;mOXtaGJnYCU
zY6Zsxk8&XZ8ql-u<ouU1RudKYmp-Ls^ZYTY7A`4^BkCl^OcCojdM?v_3IOat*Hq4l
zO0um|-FkhH%{e_E6kmhq)`N%oYBi1cB(A|A8>I{}FhhSypLk1VK&1^`+AVnxt?tGA
zvXt3w+T~<1Vg1IH-F$*xmVS+v>I{0^b<~-@fu^7@*tjt-qs*u&vxq1u!>R*SOOQ+C
z0e1xZ{(@WptV#zScbr$iINIUw4qs_H5APXU)aLHTn%2_37yL8lf|4$tx`(aRpir)<
z^qncEgT;nsGY;FSJDe8FXw?UCPOq)ir>j>;%=|Z0to)mN?jHZAGmhior^x@axlxG!
zw%Km4ebxVbiO;O~KSzg$ujdE?B*mtxZ-DW*m|Mj&Z+su-bb$zt;yy={;rL+`9|n$S
zk^~wUO9R9&BgDQ%e!vH=<cfo6wjCbJniHJ|?ai%XxE#F)Fj$WHVTH=EOT5qL^HZUK
ze#v$A8;f7;nrB*IKS!$@ZyEoVI60O%IEqZ5vuj@jL$o7mlJtWnD;b+9c$o7Rt-dB%
z8ukMQAwYIA3`#7a^CrxT*7)da>40_YU|573VtRxDLHy`&cn-?ey?_sD_n}mS;?KtC
zHLTI_)~@@TYyDoY)os|7><durs`*TT*lv04H}5a`1^#WigC33FvONdrRhW8P6Q!A<
zz*(dG)WlQ4pYQX1!^4LU#cyw>v3w&xv+y^4N3kkOn@o6EUs+irCiUZhOlXKn53WHl
z9I_4km48E#gGb$d&_}HfSGvNDf($L{k{$qCY+Z(t(5M4jaXc$g7gAruj+=m4q>Z9%
z99hiLHCIJ8N!x-$6F1NiJVM@{BjSj%Lx}@~o6M^#$y#OEA|(m7S6NRKMAMhJ%==?5
z1fGE=4T6i!HM&;+Xt<c)IouU?P!|0rXR$vMdCNUp=9}BckJ#$n_A;0kYBOhtt+#JG
zxfZ)&IM3RjVl`V+fzv8LN7ZXjt=CqUm{#m{>F#?k|Eyg?Px4DZ1DRfg`V>RN@~)pg
zy?fu5h2!i|%+uby+u&28%D(^s4CpK2UEFX}Azo2@R-v}CIQ(QAd7AUu?TJ;Di&Ht#
zn%6mpIo<y?0_ol2f4{rU_5aNHulPN8|G%;IHUG;O`Amub4b18E@ZVhEllb$D{lTa8
z-cg+jTb#ZVG3JSPLa8h$>x8cZ_hFe6REqoEZW3IEk|&OmRG^L+FS#*<*AwpuM#?|J
zsQ&~+s(x_Izf&~d<o5Z&<cW7i){7**@H793w=-l{2bIhtNXaf*SZrX(rC%K5Fv!rW
z0EN6TMGgA!hP^0_C>um<7fH;u&P8h2U%CJVHhgboumS_@jMH~*v;?JGqDhu|2zyTO
zLCMDlX1L@Cw2hTgzdbQEe6NN@fEmZBpl-ZwXVgGddcg5rk-?u33}_Xo6N+g`qi2zf
z@1;|WrHLVPbvweds|D<gVK{C03$#k|_oT-C#m?d5ryQb{1X@ln(wD1ls~LGylWR7)
z1{PVArE0g+Uk;8C<xePDxE>Y3sLj>xG_aaaw+xerZz%|0Fe)bsGjvZw7eZ*Wm)23O
z;r2P-EZjl<azOL2XMwNURElOHcN?Rz-&2|Gz0BlGq)VPuuQOIoF|QHhpqncOc8G*6
z&V~E+&f_>E<$Qy4?67%oO8ugtY|w9zya>2TDs>71BPK7fL)~HL05B0-LJa|Tg1`J`
zA`D3ph8UD&6Ya6z_nsE)j5ue<;q%w~Kkgr%oe*1iwDW3DjEeB*nz9<gAKR6dv}3XK
zUNk$hCS!n~+KyJ=aKc0HnMe6`bP}ALJuPD=o7CfT)rE)R+HlZ0hlNaP*wXjkx9Uyi
z@pPf|B0MMWh-(liUcX}M&bfA89Uq<@c@Oa^PF5v!x%Qf3SzMc5-sxwMjG-6q?fcT6
zP_i=RVc`8>NWKTNhlWm7FgzKSdPqYpt=L2#ER2sLS76u?Y!);S$MFB@Tj=#a&uRcG
z9IG0NGauAD!q932SS)zIq?x++?3u0(%XVJ@t_H1h<0ZqZ<M`?>IM{;^f%p)+w#>QN
ziLpcq;>j(RkUrh&SUDTGI7gj5RhZ?Xn~RDt8U(dLK7lB&HZ=qgC|zt_mLW-H@6Qhz
z(-G})wQB!gt@h0~@KE7-t{5$u?xCj9X9_|?Lv<>Rt-=VM9_^v%okWwD3`i}&LilYB
z#X@YZ@lcP$9W%g1j~Tu{%p;@K^E<{3F8)y0w6G+7H!qSf*)PEn=}erd_*Xr5RF1{p
zOl&8_S*i>Lu~kcRTkg(O7+uM*q^q$w@u;)fYP)1|6>e%)e?XfjA4!?#+bYwjbP;7f
z6D@Q}AydC1@pH(fY&fpqHZoCYi!gd<mB;<_|Cyf_eoh2m%TUyunAT~o5J_zTOo?1r
zBO1qy<I|j;=$2nQI3+hLj)cp>wy=@!VKz2pI^93`XTC-2=*mXG#XT()L^mvMU%Y^=
zD!m{a+Ndy&uiEsm^Nta*ZaeYRRE_U-cYHdl=S}sTwKXaZyFE@9^RNpW^=`!<{Nrrr
z;PmW`un2;Ch;h{{f~sP7HYbyCYaT)RqOBo=`+xTH&%r4a83k<PvvCR*qd<Ckjb{}+
z0|<Ds+bTHK@@*#sG{5VF2&=8~`tb1YXGdm#Y`ci3j*tR-u0h011Mi*vgWqgtBy*-z
zPy=V5(7AH^c}|_6<yvIZnUZ-sl%^7pb;lic%EYFgSS7-tgA+Iwo5DTQ1ddVWdqEjz
z%r37~P0Qdv?xcj;D7FDbz<x*JC;wG#xU3qyc8kx+L%NmbU?ydgePWhUQ=5N1S1Cie
zD`Tk+^69*#b9PtlvNAkXdmxXdm8@n?pFuxM+0By8VDK}?a^7OZB||j<2zU>%$mB4e
z#Tj$;`Fc;=lTXI%tQGj2XLn$8G{()%<>(rpfXS)ZtSK=#n&EI>VZ~~4G@bXkCEH!f
zUfhDe_)Ofl?ATkg-*cg41tZ|>+=|^^bqv<6fF9N<pTqyMEzJ7NT}dfDG0OKUt+UcL
zW8SXFi@U!Ey-XzoVwE)qHo!bV&<yJs=Yh-TVjNtE7deJJkiH05L`N%k0rLXMccIi!
zI#}yc!61?#rg6eog-AlfSWPwS8FIsb<5o*gRp>7cI?k?ulIWeLV6u)oR8Z$iXNq>;
zY7{5|t3%&g0fLU%a}8^gLY!3FQQ#-!S)<YbQU-DjF09D4DNF^r8Ijupy6~|BMgP)|
zGQ63Qyn*Q1!)vE<)^q**d>ZUdq*f5s`a=nP#!e1Y0fxrawK-&VCAr7QK`Ls#3zAsb
zcu}4)EPyT`L5iuw@p6M(P<ah;uXx@|a)$Kr8taKQOONm1{)8`>pv!B+*EeAljwT}m
z7FD!~pNCETvA(L0D(ZRPZDFge7F{gk*Y&o3+1l8EC#|*em*3$aq$0iC+Rzc26d{$J
zz4Lni)xn#+gVWCL-aa7ptHNa%9UgQhGa9M0c>jQRwG-oAkz5YzLkRjBuOJ+>^qvP-
zc<+JUkg%d~TwM{a=3{DU+??n9r@r1Gf~AurPy~SPeujk+<TpmyloX)ccdq404w#CH
zIpESnlf0sY0yy(taHe8FCz&^gy~)teRO&|9bWOU~9QorhyZxZ=klgbisjJn62#WQg
z#F3F(tHH!iVE+Z&p1pB3R3>u9I`>Dc=+jtYQKKfkftgOsR4ZrdtXU3gW|*w-75y}0
zmAl#h8;|{YYz$`E|8H#;^8Y^in*aUFe5Tm{%kRVK=Kofyvdo6+H;_|14bsaur&}AH
zqvO4o`#*b2!{Ji??a}FR{&gY$(yba<vNH17W%}!FZ>hiJKAhmgN$%k_KD^F7>~C%4
z#!+aiP@>Rqp+un<m`Q#@g?>uP6nZKtgMBH`DubHuVXI3(-DgE`9UbrYoz!arF?c@7
zKfmVZ*ZJoNH*AOT!i5&LlYf5A&#&{(2{PCa{4Ie8HdT0YEpM*rjl}o>`bk_#j2<3-
z?`>0fU^E?>oS(x<Fh<sstl!~5kR%{5)*ZKz=VveXj*ky1xWK{!j8qu!8SRp>PxnT-
zQ@n3nHZFS~#BH&zf|rdjJV%$9Z$6yG?uQsza<EO)5c&EE+DIU;4*Z%T-KDun0Rji7
zFO}2d0>?2yX9Yby`~lw@;$A{7pK?aQ_hEo{3TSD8X+(5t=rl{Rcmj_cH&^6;lMr~&
zXq@Q=%~Mzed`?CaGz8!ab1A6U)6#A;t?NXu1*g(F@HAr#=1xH>CSCLj#U)Vh*X!aX
zfnB5?9JeIykZ*I0BN+MFg?RLewk+R;3<9U)h%rU~Tb`G3-Gy<xjozhA@&a9Sd{|!|
z9>3W+m4&UXH@uDdwiTI%oO==yD-aw6&`z&Q(p#?^kNrO;WCIpW&^06WICe8xg;9(V
zTLAnWHI!^@i=h($A2CiP1I%8v%bv`P9@dssr*(d?oO4HRc>Gumhap!sdk30!kDseU
za?zd+YI_)JL2ubotKqea>CaLTo9(U8Iq%a3J@2b2@l5Pp+QVGNO5tCKG=6rn*E#v;
z$?guuf4zTS7l3EnMP0MhXMhLkO^O&)YuCNRN6&fOK@p=7KBU~$nhb@O*%xgxYKNVK
zut+!zvm4x!l8D-}9~9y>47)u={ZI~-ARRZ%oJZcvBnY0Lyx8_eXe}3ygM>8}FwQI(
zp&U&nmF#+ijf|5RMmB;UNI8jpr?%9@>XL;FeYc?<AgpAZ23#?o5%>h=2XY0jBe@jz
z{4oYs;iTH+kHiub3(8kvABBFXF=3G4iK@XtW^N(wM-c2HXkCYBq0XhLr+RRDQ5v-3
zw934^I_`U_m2OhECQs_TMyg(pPh*v-6$v)esb3d(GpJtpnNrHC#<{z)J1G}yDd(((
zw4V}PvF-Xa&|!gFK#sDxe13RMbvH1a^=I@pxRd-Rk%{~0gF8nbGvvS4`g-2}f3x-I
ztNiyxKGpKy-p{9~<9cy&GF1R{ifJe5AexL&s{ts2DN=hK9mf|PVH?&9I44Iy)IEIB
zvR`m`EPVCUYd03HH=KmPqblo*A3Xg6HkBGEjt3;1U6q8_E4J&DRmGO{>m?IU%sRt$
zGaOe8?TAZCVM+%m2`|mqJhN-~2}UoKRIB9eoqvxRR;}vltKu`3r92Z?c$@Q>a>L*%
za*NsS{C;0p?WyW_iN3y!%3t*z4lPXO;Ep(qsC(`J8!wp=rGKPAz@}J7kBWYE)y%AF
zc0Ssv)Y3-7|2588U*K~m`ridPc0f)59Z4n6d!XVtm_h&Bn|b=bzSds<>i_jcKGpR9
z`Ofa&@oxIyMMu(&;~qOcn0_2gtL0=5M-o}UqwSmn3l>7<LZM))OXgf@i>Qfit7TCh
zOORM%y-Q$3cPP=cL1<}y>QIY4qH_?E=<+w)4!}Tcml2l1jR|hCogVy~*}?m*oDVw5
zj-uDau}hD3r0(jna>l!biK3Uy4`z1h4?7f;fBMlyM-@Ml+z@aM;}?BqMdUx&fy1r3
zN6FN_=JYkQcx&F`Q}VdaQLC7>y%NrnB(<1tlE73|9Fs^=hVaU<^s=EzPGXIs-~@Ff
z8+#Z2J>Bd4bi8wPw0Ep<6{WkegM1*i`eTsJYw9ty-RUURpHg0^mwrYb-OHjgBle)S
zth6^;Ut=0Dl2!%0kcU`vIIZ$Bg{7X#a7-a||4#hJ$H;%9kw2bC0Gx6DuWhyp^56RU
zSNZRYd}hjjZ{F-2&2{pZmoJ?8Ns#$r1e>cwh(Uy^<>ZtZG71yD`Q(&-p_f7rbBY=6
zB>$cEd;W8${m*CdRG#1d%*y}zXsr<cZ)@{w{)aE}sowvRGI5TbpD#HhB1AMRc7v^6
z{K8=)h)1Hh5sI_7B$0lYWH-Wsjx6Ti7FH(j-q}S|nX>$q`MjUoWtya7#R|m}-otKf
zK(iOX@xea+<>bxb;pq=2r+Y`81N`^ow<?)Q5(ToL#B`ba>-s4rx<&?)6gYG6=~}v2
zjzlhSZ`@FW*3d9pc3~=7DfQBYrY6+Ok>AV0%fNa-%~-#wrs8#Zm~&5~Yzl>2!Rgbe
zoPw=&n|B%wX974(`X)zT7?~Gce&Lj7b2JPO@9_VIghyGbFq>`RX0LHRSK)Hfu^%;5
zflQt6_3eTb@wdHGbqOxR9r|714h9$r!PLj6`LuZMedibh7%LILRJ123>;-{hj_KJZ
z$J5oKWzbY?hS&in!FYa%+5jsyoY)Pg7fBe+BRJ=q)-#HSePMZKbVc#t^ARua*j4JR
zxw~yhBc99NCLCO8@wAXUG{2KoZ>maR0PgmjIe=X8I}N}BHa(ru0%t%?i#i{R^~H>{
zPQz%I?I!vx%*q)CNYe4tBzjJH$?bO@4u_nJaK;o0X)c+X+W9dv_*>lO`b--q@p%W+
za*Vn+S&)Mwqw4RI=&g)K(*;E+uoJCnlkXPzWGCy(E4CaF*yLO9WO+*xyY;%!G*(sj
zmVxwPFgZ*EQB_RKM}l|!UZvNahH#d&#Kg>asx_SH+U<|$p!_abv<YRNG_oL;Uv+oU
zXhq?lQJm#Ta*nvW9p^At+1gM$dDvJ@l%pVxmU8}Kc%{;&adB~30#+m!`k0Rl+9y@9
zkFq^v*RTkX(B&uwUhpyxxFX1e?v|kiKcHkB)p(K2gBR7^&V9#Ni80pwr-019J)L@1
z*w?7}A(vmPPCc6>g-_wuc4}el`?hD$^o}YDS9D}!4(VMwaD-g(1v(|{o_<WY>?*7(
z*R&YaKpI0sQ1@CvvCbt6rPF$|(B<w4T@R$RJJo~f&#dRbU$$!+bt3p$L@M_IUNTHg
zS)ON(?ceT@?aOV4G?rXcOh1uJFDvG%k`IPEN0s&4SJ}9ImCf5%*}8p|N4Kdm<%(y{
zn#F6Ll8RFmkU3q;N2?z1r2kV-I_k+s-T$w**IR}A|BcPB`oAynnXdnzN9R9>&Tqav
zu(#3E(V4{#Dx3u5^yCHScTd^YH;c)}oeu>MO^cb+ll*@mOT-D<^h%C9`<6o4<U?sr
zn{hmenwZPL<de_UKuw<CjgxG<{4u5aELHDe5o9lm6-gGLkyN}pPlBNMY6ARRujKjl
zsG==oz4TLklHr?(^@0q80}#E~H+c8x%z=Qe6ZOWELTPS;eO$;@WdgWBM#9P&`kE}O
z&t<7n_9drU<-PE`4mPCSKX$km_UK3g?v79(xeR-O$Bh6ANXSz3s6F6}7G5yq9HQd8
z%o*RPIX_7-I|hd4H3=fA?QK&e@c5P+kj#IF@BNg#NQ1r;kW>s$#)|7;4X*IoYrHs4
z%m8(Otcg~xAVMr7`v8KwKkiglw+i)~LeXTDzxZOi09_vOtJtgP>VT(nxt_u)R#>ns
z&itXx)#muBg6+XA87pZHGhCWR`6qI^N_N()uHATXH0=9QtTlxL9fgCW($)r;XI5!w
zumo4!F|`m%ufxEPCgTzdnz`PmGT-WA`s5b=$6-Is%N(aOy$~}swy2`H14)M(^yjwW
z{I|bQ{WtsEiT@iX;U#5Ey%}}mVY-q|zXC=k@6n^pO8d{&qmA7C@7Bip*Zgl^<a6&E
zypdf^FBb1D-t%4s5qeQ!Zdhl9f9d=lWWTNWS8rFS+!=cOJ;|2>Jn+7U?;Xw||BQY-
zTc#S$bL7u%#+aiX&da4G^t4*)EUhdqnnF*%Z7os&v&F@pk3k^!4qq<9U?*up0}i4~
z4~FA4&leY;@4ebT@ZK+ao~iFW^_ISUZ+?GR!q?*=oH0wk{<?^*Eh0ZMo^*$J$9aQU
zwxP;jm%MGSA1|VQT6OEm$7%1|_onIxPnyKgEo#6^@L);TUBdGV{ZY}rl)%Lox#+=p
z&pXK|=du*=xBy4)M}FdMa6>7!axGxy0*_OSmAsYq2`*lt>My0Ge+hs44gD~n3Ppgr
z=N)mDU++OQ@|wQ)J<K<rB)woIe)a&<#EmBzqr?xuw_&b%N>z{HNS=^4{+j!F?7h$&
zY~lT*%|{#FY02raSUY%$5q#Fs?d#jN_y2jT|Mknx^W7J(j!#a1{OPxESMkL+wQtwU
zphV7M@QQ0S|I=^2TWfyT`R(Dis|+3XZbc{IEP*x}UhCm7hz8k3&8&C5;mNaa*XzyV
z>v|4c{mEzyc<Qa5{PWH8!`CM^<hsAl2fOvnb%M|1weKE#Cwsf68y<Qzq8A~5_7q!-
zpFdr|uD@();8NvBx^k^vQn?K30yM1s3xMpmhXm(uVKtg<3aPZD8d;JBfORTc0UORx
z24ID|<zG$vzJ5L~|7#MTf0F#KkBau6?X^c=&;Kv+nVJ9f`0(XC`Cqx%C(r^#DW#3P
zmHsD}w-v|o>h<AsHM+eMNji;`?(nEqxJuVqsii<K8`e!qZFz|3UN3k!s;;5HD7&tE
zgJIkSF_*44d7Iq32QM0n3zdUgyf>jGI6Ts+)UY<R-;vfNMdsoM&w4NK=yrFz6b7s-
zE(HM@b`<BR%w;b9P(vX1QjCQv-?HUZ)my%W3JMVCJFD`R<vy#lU5XP@n1);=Vtk0%
zD`wqCS1y<X$tmll?&wOEODQ=jSL+P6)Ye94_wWq2R&Kqp@pzmXlZb}56w!?|K3=L9
zOJDhTQRfuLM`1K5E1izRsN?tk$kkAfxr#d)Osm&PufnW%k*j6DqMBx5NC$-D=-@7Q
z>RIoi)UAeoRppiR8>~_Z*7bG;Sg|@zCcEehY@w)XH=@TC%{uL2uKR`QOIcFF8r7nW
zl@vc9K%)gf+=h2C8TnCNP)Xhaj;d0osx;QwJ2-oz8lgP^E!Fif-Q8e@zhKuePjd)<
z?_PHAo*G3eg&aJ0N@#p{##Rj}v$plARV>h%Wy6KyooQFKc56O`_j?mDP$uMM@dPMG
zA0vHG980`0K--Xp7p?>=9O48+pHQMI+<sKO7e`3mFlU*E>BuMJzC<4!K})>=gLz6A
zl7MQdP#<`4foM;uk}&`~$b1p1t<eV^1ebJ-u^eUJ@}NS=HqOBT`Lyi7g2DDNdt_Te
zJ6=z3IJVLy<FHf^6`Y6Ly0Zhh^?Rf+4^c#w?9Mb$5=hN3y_$axkoAy~V3ZS%n6;pm
zd0`<k?WTo>C0BIcB#Ops0*ZSjS31&cu~kL7sJ?;6J^QLb0hWiXdQhQJF?$=QuvTp&
zmN6`tHgL1MlLWP-<xLAB(V~0a4zWNW-vd(gxm~#!m~h*gNK5+~LtprrpU2K~AN}Sq
zPL*e+5gf&Rj?9~cgNw{#@LzF&nnB`s^>`?RO_)7MF+@!d6AljJ)XLizM18;<M0;+j
ziyGrVhw;HC>evLw5Ecygy$dLeQKl|@#C*O~89`+W8VFk6ICxH@*lTSFYx&KZT*O0+
zC4|v&LkyaR@TTZP6i^5=HpY__GmjS$!9I-?iXEvMcIyqC__^Q1$V9k(^HsTNzM%lh
zw~XC#5esiANp9V2Bu<Tvd%QR@b$oBToC4oq%+QtFZ1=~g%kL!r0YIW)&fqWqF-!hy
zw>Jv%-^S)w`R~hos^!0*_D>J?W(0pRWu{7Nf2dTfpY*eeH_b4dzkA0!2Y)~D=)ouM
zLGG7-VuY8#ieBPJZ#^}4?7VaMX8)8ggH6)ba1g}_hj!#}VAKXjE9_kWK$9CuajF1Z
zXmVj;?X2SUoBe}@g;v$u{R6BFuS?(Vp1!Vrc}htxfoW}56d+*;-mh16UUZFSfp=k}
zss_=q7iVvd78W)udZi-IPus6{Pk&z6npWua#m*^=@6pUM3k#2@m7$&%zMFfN3oTqM
zMwl}+KtTHdGz1?^C?q#BNQ?t2H964R?4py!9YiQNHSCyqm;NwBE)rX#a$aza8w`(8
z49VWZ8v{H+1Sf|SyB!-s<A#$E4_`z(!c}Vw*xsyRq#Ot~4KD*H)E|u?C6^`S@OWtF
zq%ww+9pg%BE|<6`n8PISd^yN5!aLpgU^kTCI8ofN9i7z0)WhRFK-Ee-f3df_^G_}?
z1(`elKzy&lXYuKUwft$JwLY~FV0~+2dNVse?(Dx_Xl+)FSc+j9`Gr;$9v`0`@8P_w
zaQOMo3BImEUshL86!wKyB?7<R+j$8D=K5SdRed3$DO8-+@yY29Kx)n^FHTP8Zk}~9
zyQlj<?%lG=?%A8$^@7BxbF%l3TUC0+B<wa-4gepJet=l};#L)fvNAN7-WRKXmLvCQ
z@3<*lc}PY-%fVY30rJJ(^RriVE10vIF;0Jf=k@-7?j6_gBC|m>rtZBrKN{Y_+3VNp
z-}mOnhYu$H^?c3hn9(_Xf+DM_{svsUDx(d5)H`g-F7U^&bAd5kbltixiYghqs08Ds
zcgS#bGEV}{>dNSz<hm)@udLWA9Bei>e$tG12Q+1Ex<}V{c>J)cfDWnz^NXY)h)Wb;
z5t59FBgjbzIZKiiUP>0_ij*m9tWLQ?=@ae$P{)I*EATPNlWB&U6~%>7I}#Av=m_-b
z86$+yDi2i~)Q=J`UDz)y;9qNK`<(gYN^^TYr`!nsn4s+-oum;dBW|3NZcJ<+HE}+P
zdUP666loMHLrSSZv6q=8@P;V2`&kx@#>5q9kv7Eh9$V=K*;Nok)<~RD<fp?p0HDS%
zlH}%)!#Sfc*|0*FV+jdczJLgTf-FZqmU^$l=q-kGW}OHsGakU`S;YZoH_E$x<~z6%
zK-*wAvaogm<aq$<hwaZteVF!rKH^icukq3;b$-E~EG_fitPSs7vy$733uGgQrgMOv
z45&PrKRtP26Cdxrq7K&md{WbG)*Ifrj|o;jl(lrwK{DsnYStLZ$g;jx|2%6{GmBIw
z8oTp+|MmXqKfNFJUc;-;BdS#|TI8-;RK9GHyKZbdY5n4rsz_^<2koNM3_Ps4?JiqC
zDgBEI5?oj#cLbFKK%821Dq|G)LUZ<SyI=b`rF@4)o7P=!Hg3=G&+LvRkJmTT$80Bg
zyKlc}KFb5<b0G50(f((_RXTdr1jz8&I-TXK8#aU45BL1yBb3ha95+A*fnordycZpu
zHHAVoBqe-6-)5It5b9ONL>O1+vW8qQ=VFP<(Xh_7VmPJUIyK7swTe`B9L3okIxo~J
zA3&~H<seuTpS2jyl3TdY(PF!0XiiNQ2k!J#K4`0m@>S4Bj<zwMLf5ukJXa>?x2Tb`
zL%%~!Hcp>f5jXk|!ElVs8YT=tzAfqt)7uBuvWLFse6!#NxOa#yE$@_`O16-Et(Wi%
z%No+#)|mv4kxlCf@kF<x5Ho{zCj&}uX!yma4!P9Sl9~fv0&jBs-bL-IVV1Ok28eGt
z85!m@yTXIO9->Y~24|<8u}+>63sRB>fRaDtR89q86%L6x!BvFwwj{;-#(|EN{Z4Y<
z(G+JKKKWX9x8Bp-sh>ObREAG^)_g|t1Aw%k<()CO0<83!O&Op?Y*f|yoNJ?L)%5kT
zLL%K^jc$eS|MtuIx%XwoF=MT~Y}UCDz|{xOMuOX&L^CnNl>hfclf?xrwYEL)vcr0!
zc!yenT7J<L(qWcc<jHw#P?{Al!AykV>VmD`=hjAwEOem_$^wm(U0CQpe5etI>i4mG
zvw9jH7K31qJdXg11GyFc%{UyUAk|DPZWM0P%oyhyAhNMT_&r<7nK`otr6r!;E7=rG
z2gg?mJRb#~e#V)Db$(`QuHF08-o2<<jlGzz)ku-HEvc$5v>}t^%gsTw`An2X=xm|)
zw1yf#(0#n*vJFyMCc)6ZMw=igK{>Jj*;2F;D)uMsKC5UJ-KNh~(^S&c1WVFd8+VHo
z!aA2qx_+9Q5@q*>mnhUKP<ns<>8VHGJmthox)MD#1&BB{pGkr@Rjgski-hbw<962S
zZcgtvVTzh$G>C!L0CJeji@qjd8b?~^+dxM)^PDSdg>V@4L(Kb_mO@P@o1PzVi%R)Q
zA!+oi6z0LZ%n#8(oMeS!Bf98x>NAPHJpK7!KyZ|0DaNG0TMpXpL~_KC4%U7YU;4v_
zbHxrD^@c6wsCuc`RHr0z7+9jA?e8X0n0Xn7HsG}JWXFeh^fnGYNI^&ohZD9EB$Jej
zc#=Vl30;+tr7T{#!4NO}%P>yt9M^NpBl8hX=3*#}*%aKgQ-_xVql$hrvoXztP8%=%
zUv@XYTl{bF<e9UN8U9}zTN~}X{a^dh)>r$#FY%cY|N9gu+wSzh->Qf%BTwX(z&TYG
z%kT7G?e3~}_|Hk*&O}}5N7fnidL7H9EEra`e)7+QyR?l)+QpVTZ%%eQKkgmR+0ZDx
zoHo4OR_m4{>$O_a9$PFBhu|%}0OBsGPPt&}g=mO~MqkQcJWO@=(v>AE?=`0f#+&xQ
zN1kK=LR$(41m1lEhYIA>^C@KtI`vWnpjJ!uvO<Z4C#j?rraYtAo>_psgS}%+6C=~C
zu~SQWfnkyO`*6^~2sH6I{jP80={Ar+1dHTdLCzV#Rp}r-))4gJmhzP~HR-2tFh0S`
z-jt!B8O3tL8;1>V9Zn1k{KL2VG7*nBa^;atjZu{}9tE9omTdDg71}4n*go<dbJ)Zf
z9?dP2qMtvMtlcjZ#G{;>ZKz#zy!U$N=e-y8ZL4oGI%m7Or>fQ98jbA-+_2pu8@Z_6
zwfhfjQMD#2WYsCMHKuI?jo^BW`fq^*nlJ+IuQJ@mUACgX^2w5wA~6losesX#?=>zk
zjsbEP%FLk`q;?kE=zJLVvQ%f6Myi1c82gm!JnSZZa#Mfefbkp~si`eS`GY&ePovRH
zZ4?sz1Bw8@BZVZ*4^^zMaATTQ?Vsi<$(tW{j_GY(%yfCH98Ji~H@Xa>5Swe*J`jDg
z57CPPz3rFE#<_$o{V_o#gWB<V7DTQUq>BPxSsNnL<*UFtpY0#-l~xg3nUY@ic23Hx
zKrexx7ODs~RrP|^@>Ndu{?XYzIW4V{27h#VX{KPTVsj~aB`!u=8_jN*8QOyeI|OvL
zNA*;P7=IuQI35@_ckcHx0WUJLuU~aA<Ne{w&e7>H$CUtK(L9Cojh@<;X67E8Cv&#7
zp-E^pg;5q*<A&#SS~qkTb_8Ht1pA?vp?%L_;)9rx1p(s}Q^p$JG*QHb7N#W5*lh=|
zVU$Zv91U+MdA&ePVxdu+!yAf7M!W896kqW!qj<b;PJY~F$W%`P`-WaoQ&l!sG}Tf?
zl~%6dO&TshXIAA{WDW1#qzJ1SHFeegZL1oO&&hflGp`r3omuNWyDj!goosD12zvxS
z!~@acjb=po6vpcFOD1>X|52Q$6M8-&U<UvH2>AU%{;##K@jt)FCy(wL1<?eJ@SJ4;
z<}-;+JP(HfGH{b2>IuwYk0glPT^r=`lJ-|FR@5G-mLc4J@>X1kX=oqQ>5@Jy%|9@f
zT!oVFwQXX)PTgY@#RZd)P^HmaV2X`algfnAdm%azWO`syJ@OO89dTtlC=%~XB$iMA
zl&&VwkRa-XVi#LAIkN0abHB6gGKXb}Kd6KBY?DVK%mDZ{^drO{l5de(;Q8p5DMTt9
z&b>*J0?%B_b?Gf%=*$v%sCmouMOj+t*XaL|UR1O+r4^kTNfzO4fQdcDUQU~<<ePPV
zJEioj=@-VaRFB-Cr|K=j4wrXd0h9bSSH-Sn#W@pQ<2O=|Vlz@!C%9Ch^I2Kx4r*Dx
z0^458y{SVDrSp`>&1cpci&m}V4KyZJ7Yhs4fNJ-3;Y*5AxiF(`azszU!2rhRM|?FQ
zZFv+ZMYQ_Vj9RcX$Wjmv!t=0KlVxjoDo>~MRmYn{;2WSSUo}dYDUz>hOW&)r<=GQ&
zk0=Z@N;c*|7JiMEXz1Ll4yLOvEf?rlO^STbx0hNAD;Jp3BaTo)sj9I}GjP;vtky|I
z$}g@c4d{-5p}E`vCT8v*rc5F?US~cSh*cAlTjHyl=%6^!x<X`Z7B6ll5sJ^lo0@J<
z?!tKP1^UqCG-Mjz%lgO55}QKhsoH&qN;JItism@`z_n@8w1UxScJCHmS@Cy)S9i*j
z0qX+wzk;U<Ht1qPZdC4F;Y{41Uw&cBSbM`#pwFZsa+X*|=I}OWjK1wO1oQ=pSQQii
z^Lxi^I&0D8?5JL^4~vEMnPCI1$h&0x&F@V-Wh5u|eZ4nJXt}*VU8}bbi-oz}&!0GT
zIhOgH0RTzef~DLn>ce@7^-RjQDBh)2qw6j3v=R;PhJ`kfTF8TFr5pvFQ>;)&PO}+k
zJRcHIMd51fofG|B>@!GNpMp}n*!5fBiPL4!H_^2%(|()ZnWH6)l`YE|q{YT)z+`Rj
zy$Z5bfXy^cN$!1B!*d-tcz}p<(hR-s;CTKVqZYRfsNFeG{LgRHc~pwuGCTHqu!xSs
zN6ocit%N#=te<q62z)h7IaHkiBFVx|bNnLX_i{}(&xgwWqZapHEt7uze7VoZ<bR(x
z0rU+0&(`|-RzCiBYwc_P=P&Y^ng9J3so&?!2E*aYW(4?@ct~(w%*+9OF{?z9B|+dM
zbv6l`hXa-W3&VPGLSA4?GozoN+MUePAuKaH@d_Kj=TcKRKP5$*NxrOSW=fi8(yyI9
zuroUepHj*=8E9vu?JG$+yO^7YlVYPh<KEO7^JJHsk=0{b-e8ru4S)SH@uLjCoDbtT
z$)!S>R=yX6!(4Htw@<nlkSmL88dww<wPRpMm|=d_7snU*Dj?B}JMJ&124~Dr$W@XA
zMZMCnG5M7#ml2K||5_<6`@zr$F(>wiLD~z<Dyj0SN&b!NYNN5;RUUY0C!(C|RH?Lh
z9<9<j(DznZrCms{ERA^x{eC~G&Nw+nxw0brq?==!{#w9X=H!(8y%&!-+o84H(odc^
zyL7Sbjame9a2fVyBqP522vp7>UiwiO<pH2v`(|Noq2AP#dbg-wmRN5t^z10fmNmGa
z0Dw7+ti;A?8Fb4qa!zbiNo5EAjJ)HOImg|0J|Sdgb;xO`KXZ>3x$Q9gK4*s}CGPn-
zoQBS#a}tT%kov*@z(I{Cm<E36zx%9<bH`!9{_h3-fBC=)goTpLe34<%AC;`vrWqaI
zq9+|UJ9sBgVDNz{+|9vy6d<fW%WND{g#9`l+eva~W)HK4kpIh8-SdC$B>!`G{cae|
zX97M;{@>Wz%-erIYPY}2|6k%$E&p@m#OM15Q$>Hf)O;~u#q7<~0G2>$zevPkw#bws
zKtt9r73(#8#Hk#VVJ?#zv^SPWmUviBBJ!)^AlRzHc{m)V-gy#_sP6f2l3uXgscEKr
zLxHjI*1}&@(Wr4m9SX~ZO{`Kyj6Eii-=(UyryEa(Lz2IwGsz&zqrl`{Y1|7bJt*0?
zVoruI^ZIds7Roq+Fr!G(=<;)k5w5e;9SS8OMc$~FgyW2Yb;RA@1GJcB$3CAzf}$G_
zs&p~u6b~oN79}*jA7aj0Hr^TeZv%X%jaJ<`Q2-3G5%jy*B*g*04$}-RU9ml}zgEja
zW}0FiYp*SuY^$=7P6kVr`ues=qGQ8Cgc3L(N5`g|Y)6Rgsewkpz(?(jw8wr<Ff4Rr
zS_&hIm%7BFaO%~9mB9*zT7#Kf`4|Cx<R@=s0?ihuqUG^$>lc3Nbur``&_Ime+ZUr>
zE94#;3R(-3zAH1)vEJh<bkf2TW3p5%`(FEvSs8RSv~>1b9&#^Ek{}(&6strK8&7tI
zySRQKXvK$187O*@YDbwkAzY3Dk(y+}6-H=4%01@s7k$lD#$4)$=Rnq|vXuc{u{~VF
zjN%`s0Z4Z~hD2__Dumbtj27NZdbs7$3K(`Yh?XwI3qZngIq;+hW#E*O1WoUZZc~OK
zFx6-*8!-|}oI+<c)jL!LGH9w7*CrNa3o4zz0sOwF@IIxWycGTK)o$qk09`wTuG=P}
zyi}G=KW*IG8hawO(||%SH9!*EjbR0KdVq7n0u1U0d+&9COZYYj#uTofgY#oL0Gm$S
zREGGU5#1lnvnMILlF%J;6WvKtg_wmM;$`&3%;zNYG2|p{22{WyucG0B@2Sjb%;W<P
z2Q1nD-R~im>QSJ7!+AjIYH*k^j8UpQ8K_-qCZ(<hF&`E(Q<UU!@JKd5vJVoQh5`7f
zI){AZZTC9{rvwrzF(S>d)3J{Rl2;cYY@|`(M`ERpm8jG&O<BB#x3aPVwCXonJJSM>
zTOEiJG!q}f4jm39e54v5u5*~AnF2K{Czh$T87N*jc+#n-QpqMLX~7V<Q+@6r)=^kY
zIA+wD!IYUPO34ul>!2139bV(%Fd!cwHBB-6oHkx<1d1^wIaa4;4>Hqze!roJ0*^Z>
z@;BRMZz#1E!?wh$ddiSU_dE6AUpBua{7(6}8YM3{<Cn3DC8u$#J?(I7o;9DDCcUSg
zGw(tvYG0L7FqnE@4*S-cEh(D<KfS5t$F8(p>7>_Fj^$iG2{L7Frp?TtLi3rTe@~xk
zXMTFF=_?Gh*+Lr?)v9d;Rj>vSlvPD*FvSdxOGH*ETepm%$r24Zo{WVUN?Z1ktQ^*u
z<q<b1tcNtT1{I8LLN`Fy?7*ZPiZEUPaH~Y*nf0VIHnzx^kgyul7^pOfkfVzfc4LHs
za2O=@22&mM@`BShfpb|814nU1li~r4!!grPXd8O1<ud2E<i4)9p#@xH07bS4v>H6x
zre`l1VxaxI*_^(@-+S)DR;{*OY1;`~Mo2WnRos$t{+Fp0?j-*g5-4_<#8sFA%#i=r
zw>ESB-|K7bR_m+$|0O=v@_#Xl2h;B9rU27wO|?BM;uP=(fRz1$4Vw554r3_Ot=+Gz
z$k&@C-n28!xTZ81<gch$VT%3G2*pm4uk)QS6<oYzu*%Za@erP8TDPBF*|tRq3Jzjc
z;Z_tVx%kJ)>JVHywI#YF>ok|TmL0;kyoX;*3x5IGWjslLn>G(6$d;_s6-WS+F=dlu
zgTu-x<6oYJ7K?-HOd5cRNbb8Rt=-3>aCn&4v|enxmqSJ_8b*>9CFrC>;BFf^-(2+M
z<WNI3r_-li+4gy{_Yy5v_c|x9_x6tLh{#suJ7Bd9s}jtf3OQy!HR!CS=GzAhC(OTE
zg8CIelps&0tN8%d$ay(qkFvPLaTk}j;ml{I)odB0+@a5dhULU<PJEiV`qlfJOrFB*
zhMg$pxY=PF-n7`5ws!uenwHnm)4H;<6R2rA%skmZ^ARp(H9N;r(SisQSyCD}pi6&f
z0ZV|?5U-H?^sD*IN@&a>{$|G`nsRi0KBn_-@qdI|6VKP_&bkGfmH%(E5dUYZwf>d=
z`y!ty@qZ|nlS0Ag(*pq&%1*rtQcpVSiOJ>u(T1bi*mGJTx&ZGD@no9WYx-_xGWrl?
z{)Dc#Drhj}^~`$NwZ&|iXM@7w%jS5j<e-Q!3@&Lv{~$7z3kFVU>J5K_p<Pt$Sjq5m
z!dfXJVJkYin{L$gjBxB*wdn!+%LK;gt>Hm8+PzK->fb0!2s9`#27~pw>v>1Yq7rZ@
zvj82v*f_Ge-RPk=pJ7*XH(#8B36!i8ayUy@rzj5;VyE6ZoAcB)Efl$|!a|=NoSp2w
zP=*>4vKpgfw;Tf+E^1|81}Q!dI^-8B&EY}Aqv_od8>(9`4n5aXMS#rw>L$Vb>-#BI
zZQfN-nO3U6k8S0lW9DM*!nv@W86PBx=?wcrEk8z7TKh_I1$4qAy2^TQ)hIhoIV+y&
z(4QHF{4BDP8O8d{RE*C|Vtd-HdKlo^{8Ut;Q7X_Xc2W<)ZOL(Pw#VTPTV_X)vKwe9
zfJh4#Tpf;+71r`+mMeJa3QhMZs1oE%>|_z<iY)JnNOrfcKAOCHr>ZY5l%tdeKx-ya
z>eF^Kk4uDWsw>8E#`cy>Z#g!GTzli*#c$ejF23quLUt#^Q4T**0+I`+r+PQ5!gPO6
zp2rH!6}E7VZyemR-c!ZzpL!<<3QV21`+Dc(BzF|buz6AFCa30Z3QL$-F!O8(L<kaW
ze{5!|{Jl%YBHfMrYhtyg4Tk8?ryC6BAfr({D-6N|A{*eI8RE?=NOyw^32tF8L9w2D
zX<#E&=fY3=E@I|}I2BDb5(=jJWtf^fM{JFOvSX*p<PBTK)>QY;NH3kI^LAcwCb6>=
zpKInjLK}tYZMVR({-LO|exPVWu?_0RF<gbpT#TQhpsuPb7XW(SFe4IOlEux@;jA2N
z6(&&YI6Vw0cES^6pr`Lhb8y{8=yAdMfqXePl;z^_m^)p=DCr1sya<db?aBq(PbnPm
zMt<ZEIODjIQpE1d%}t5MPMGKtswF;jj3z}GO_0p1vKZRu0oI>Ty(V4O6YwaHC7E8~
z0AOc?BdpL3bg&~dVu{~Q#;G!L0MJZ&lC#s3R=9|VS}r$AlGUG-8TmI9v|7R}$~`F0
z83x}?{0KV1%$5{sTUiEpD$=#wMSd~V%yVViIcycyfom(4>|+sEIDz|$QNGU@={UEq
zZJVg+ieW7Af#+gs3pkEr7So7Top<axS!a8SL$vWiJ`>Hm$X3tXkmIt_1-W+_`jl%c
z2{E~>m|!q1c6&$bn|$ZE4d5W1#?yYpF0SPE#VIC=JA6Lm_VE8$8o4cz!w^uq2QERd
zn+x~yXvesSL{niL{zaKfF)zgc{v|?-vlXfbA_~^(;b`*huDpe*?-Uzv&?Hy*dxItB
z4I;ADN)gxezETX3kvmbeCi@v<Fs9fI8=(v{ro}c(z@1y(W-+dBzcM<MdBuaW!^x6h
z3%u`C^~5LQi}QQPm89HSj?`4PUk$vRj199lOnysl=d~nGmL|oV*a``0dVz7udBq)7
zQ!N`Iazr6V6ATN@lf2Vrm+e-z$BMgMZ-A1F9k&_kSL&dsgY2>bd9cMJB@of{#BG_u
z;7CL{O_`cXbb+RNR+cbJ>*NG(({q2mf1o8wcYi^h5yr1E+e?p*3Kz!Yh9%3*wp<vr
zXKNZ|Jj}P93wt&<{hUrfXDb8KdHDlJ*HFzYI5H_n)US7rU+o#`e%3K>C()s01rqxW
zM!g`-qLbt3R9hIvUJ|Bnja4_+pQJ2R_?}v6N_#&H`dpihv57_RqIk_HL)PcGJ;XW@
z6AN(g4U_Ij5lLXh@I{;Wv6=*8&~!3~gVvtPW38DT%ykMis^YzF$9$<v-wGD&OOW0Y
zf>r`cn_^7`nIdQTT~8gAQ}|m@ZKcYYpT{(0`*w8u7UWr_vHjn|z@@V|I7iL-KY*Q^
zgUZdz@0Al^bwnzvGB?{Nw>3625DA7B^H;f<)OlNRheobRm{4v6)RA<OL@u?Q?5pfK
z)|K2m^y}6HYzhTi_y`I%jf80!u4t}>M`67X#!_$OT%BojZovY%)uvJoSM%OeICg6@
z|GOWV(@(`b%KYnPi`$(qcRgP2Bo%z+{l5tBuiGh^^_S-Tr>5=5n?e20cNV#u|Hr(M
zANVuF|6}vfqqUs<-}>gGulYZ|$Y+ZG$Bf7ibHsd5dv6}&K7E^jPNbj46i|B<TahPr
z&=X8YML;eqAg5C~F(hpgX84*U33*4$nNH_9y1O9>r|f8!2e6$V>~4<qatr(*_2zM-
z$6R=oZuDMFGO?hm-}px5m!+^2m|_-Rpi4Ykd2l`{<Co9=h;*T3xlX4SeuCMlCCl3$
zj-F0Gx=O@&8!;wCK|l@tn|P8vk&>Rb+AR6}%J2S!@edF@Yo7W1Deuba{h6!Rx@|r5
zsm^^q_T4<=jNotDY}xgGEvvU$76QQvX;2dOpb+rjL}Ea2*Ailb7K^<#Lu%$h%E2PY
zx`7!FmJ7*3gHtk!ZQyB~`9mFA;+Aa@Q&eco#00tZC{@m`g#`lYw#l{pCdhosu|Rt@
z!*~EuIGzk)(?DC<$RDSA2N(Uy%R**wErIxg{gWNMk!t85ux4%a*Yp=+oPL9%WsAz|
z=`N*O#U0=b<1xjCLGS<$u}AcI7!3O<g#rnafD*`aTIuv6<g7KW)fEhzGisQW)J)kJ
z*cNdEfB{!~8TJAvLW{UATdN__A!tRY6`++!s8A45MgUNYz}$Hsp)fQYHt?Sh+n5TQ
zoS508+EfN6K2^!%kf2~PN=h!t_sAGefvgNnU<0}7=ltfBp9yDB(y3ZabsVABH+O77
z<%hr@<EWu#^PD`Zu_YBY2jjMqE42U$#yUv?6`1CV9jPs#fm|QxfIx1WTnXBWhZym2
zRYh>%gx^fab0g-cvAmbkj?7K=(`$^HpoWzt==p6A-)e>PtgBY6CZ0>oAb3w{6&dq&
zG>!!c#_=JSFDXblbPskMjK&$p5n)RelbVpyhEa>8R^fdSW;Ns8U*}d|#tAx}Q&BpB
zuta%SQKzmcJ2jN(j5=lELkmMZAyxthSfc+o@S;e0C2gtLCd++T2K~V4r(ki3J6F4o
zvP(NFW}H%FwrdOCP7lpzTnZ^;zL{LXh@15uioZNFPx7>+c)zrGzpA(nUzDq0!V%@G
z5EC}YSCFSAJ#f^oT=Vp>tgyrc%NOUzB^CJG$Q7rD#llHYR$88xPPDANdYoTzkk2bH
zW0sFuK7_$X<bQWEa8Hvlrpte=wY7FD@Bg*2{x$yJ7x~Q0|8C`HpCc8#Q+ld!#ws+D
z%nHfl_fKoUZv#2(bbj3F>>R&3>2y9A4k`fdk!~KUlOi|D-%9@Dino&LxVkQusCcUq
z7=I{DZ;WATob<2AtSqYZ-7p<Y+1;Il!z_%-^ICf&b`ws4R|VOtCO`S&pc)QOjA37=
z<Aw^@o>E)jR90JDj;GZYI9BwHKG-w*#uh62#uld4mUSqrE%~RnC8UqH>vOK|G4QP0
z9J!2v3%pryec=OT2rmO>htO#u2`G9@jj61=oP7N@GdsCj#ZIRrFL|v3AE1s9_WbTE
zq-w?;(!fikgtaaW5Ws$=3q6?cBqBC(dDR=Tcvq)1iclb*W^_TlSfC8%Nia^f^)rp(
z_wJdF?%e|%*R>XOVHZkRQopi2-R-6%7ePfQ7%o`NX$pw*6G$-whnbd!KlWa`@8fwr
zPSBQ;N;bS{OMwmO*g<Z?AFQcYLIH6l4+V~W;DBKY064Myr9ZqCDD<SMGkez9(yS@Z
zHMOz@4z4jy;NVWP`(*2^22q%`T5&FK^;QlCF7`32k8)5RL>Q3^q!t6JtH6IdH@pN&
z1cBw?dK~mJ5~A@pNSHv!`;7`1N_?))D4q^$v8C@Am>Vc)80TkU!P<=Kz8aANH(&Zy
z0NsqQK6{0%LDEWn$_2s91kvFC$da%(fq~o<nCBMg_A9hF?N|fu@?(#-Tbz{@4c(I5
zQG`)+S@^v4F2B;cTWg8=fS8}I-I>I5=jo*Tub4A*`>&g`AN_0AIr<l_bDaDurW_~5
z8Go@UU;k_7d|fu_`R6>tSfMDf|Ias9`1<+8pF8RQD22=X79cb1KUy1`>-qd2t&Okx
zzc2Es*8lx*c=-3}u|8D^bq%UZ?EQRnczntx$F*h70mKFlm=+Cx*K76dxvCArZqL*x
z4hF|iJC7P3mGNpEEwqNel!Y-Gw9$iF9Ye9fKj%^1G!>77DAyi7;uh@z=o+Z9$<;_G
zZ+&GA3VNTbLeFOOf-$*Edcwz3YI5Lyw;Da0RtMV6@^$dplsak9LvDT$WI=S9tLwZg
zX#<X=gE$LRZUMYK#z583@`Ju4HfeG<5AbH!OOxIz-gB+=NFk?&&^e2)&_MIK-+POf
zpZRGQ-j@tz>M1EW{=fEQ{D}B}Vye~gKQ8{?+S<lOKL68J>(Rzn`u`<9v*Q1qoF1R;
zo}P4e=7|4imz`mlhjuh{_aiE2!6>v9!h33M1#=W6%7jWAeyrL?Akvg=t&_=@U!L!u
zzS%kIU`)-U6Z9wfjg1&)oA6pQ`Cq&9`E#fJ?}SfGXYzr##~(e~tcw4+-dfA&f8X4C
z^fmwc7x~=#2F+ww(~HG>i}$=Uv>$!q<<{5xemLm-;U~#6`j(Bth`){Xv%xdiRus0y
zG6cnxOPqPAcLCf-gu2ZOE1OV{GM=FeL^>IdV>03z4}CPr8Ko=Opd@CY0l^dK=pA(V
zbgAvF<Gr!>56t52(+eEm({Ed97zwI7$#yM_ZY&$ZfEbNm+W#dJSy^fSR}HH-TlL?l
zA$<Du+cq}z#=j0nlaUHV!)`cG<n746e%hiUM`&<shKCS&`riS}*ZX$e`_s!3??K~%
z2mkwTEPbNK;bCB5Zqln6Ye;9HXsbwe!t}HsPrAVP4eHd<;OVy;i;Ls<s$IhyMb8Ux
z@}7rJI(#wl6n|e`gu}r5#ryVs@WE>iGH=cM&D(~?NHt-X{<c>8_PzDsgZI#LAJprd
z+LMc7dtQs4_2Vc&b;EEVgSqCxz&NGxHD@T-Jd~C_6jPR3*FSL>E$R81-$C_Nubu0e
z6S;HuH>!K+>*m8YwoPf_pW5vTusnK3uc0JOSCzHr4yED9_(eg4%X`gXMqSWE0H-50
z6&y@{K2k?b2VGQ3i<`3W`aHzxDT7>6=ufgh=81Taj5VzL!7%d?bv-YV@9T@sG@&$1
zlIrAVX9`hOC?-wh3#zg3ys$+=6t1=W?R)MTkp(^FmG!R~u^BIoqwS1+-5UFbJ9Zp-
z$++{NF%z|C<LPl>qxZaBDNN2)XnskSnY7Q8d8QvxbfN*~4urnK@laV+cbE|1-PKJ;
z&k%?9K^~H2G6TpdgNXa>d({MQsBw^-2fh3jk*9!S!5_Ij%Ws^H-A<fhGL-jvSOkH>
z*h_{=+h1+^+s?{tm;7*fN=$9+F@Ert-B#R9WdPNp->@-c`!BK)GGoD5jj*KORW%_*
zOnt-&W|9}>{HUo=d6U1<iSX^#q9GFo^_qh~VX!-;ar*A*(oK*q+0<Yr!q2&%Z?U5>
zj7I5hrWG;!8B0bQ!09^+qSk`rbG^b?oSPY!t*8Y63k32aikHkv!#|3mM`}7SGqoTV
zUEj7QuJ*i3yw$<N)LY89V@rZjacSrwk4g<kZ9rKI-I0)dY5Jiv8h``AN7JeN;bC^9
zDp7W36nb_?%_B6(C|eJwEG>`qzy^i20iMuW8NG)z9?u}Mum(hQoPGJho&a^ARu~Jf
zEy_xl4*9+8u@By_f+Ee>DWm|(g_=H*lF<k6sfWE3Kup8zFkko7nnDi7PBF9eFyaKx
zhI8QS;B&HD`^$R2;r(R`|9Pyxt*81Q{Mk<H-mky@8a;ra5wV#GMZ{O!P2au;Xwfg+
zOs1#|>;s)>FGx0*%yWF5^n_kCaW{E2T1^i)N}NVr-k|k<`5Wj;zU6xJ9L(0Wkfa9V
z4jRNOh7_6LCGW1EUw>V4>2#199^#!Q)PHC)oiT}KvMdC8fCO4|5rX&c5bxLP^=)+h
z?Q}s#nZ^wbkig~(=;<ky2!@5~P`HY{6B@di|LQWIEe$zW8XBSvIZqn6LgWb0K)5#w
zAYWdkHt_(WEW5N>qM`nZvj;Ip2djPhVCi6I=>Zlp#m6M2z;{~L)4W);Vve^peH^Y?
zry&A^U}KI%i})DMMWM9bw|{)F*%z~*x7i04)uA13A2|8#fO`Mprq=)?G?0#sXhFN$
z922<hpcUE~`DO%=a=y`z>XvBdRt;$Ocx1h~FZym5Dy+K!<UQ|Y82LlGdB{NYzVwF^
z3RXc`qkGv350aUl(h-y{vq6Wl<4Lh&*m(j>HTpe~{7u5{iXrZ5Dn=mHU{O?reuzqe
z8Z*dBPN%@0qp{8e=157vK{9UG`7*gYxu;@$T4^pF4?}b$%dRljHw>Qc8fc!&jBP8G
zvutY6$UbR(a)h3~9F=gl7c0+sv~ukD$6_}9V|Kfm5%2cFXWQyiAQM?Lk3QSH4Q``n
zCh!)17@?MnP@AY{`3h+UtC~oXxFSc9pqT?kdq+5^X9yrSrsXQDv38N|j)YvIeopv)
z8@nw&+${;kY}!<Y1cCm=l^lHdq!@8)@;~DMVEQnfXg<*;xi3R_mum1~pXYk3?tTBg
znN}S-F)xigr3)#kU`bjR@Xm$0vyr#h-n1iW`k{0?7?Ez}^MJ@f{nBGZmTABNWjZ6g
z%%BspoPOr;ey+N0tFDHz{xUC|q>s-5rD;TS7TF|nCt&!9b4Qv%UKsgHK~)*fqSk%l
zc4y4p*6L7Q*wv4U0?!e5Q1v$q(DPb}Jj`IIA4B_x{hhina*oxnDlyI#ariCu*d+$?
z)J1>Of{Rq@xq}5L`1Je?7IyFO<zn>}tu1v-y`Rk$MC%K3Yd=Q{eudoBB#SXp35NFv
zb}fi7@Bjxe%UuT1RqI`|yGe)?<x<}d5*`8%JT*Z>Uca)&%s04Cyw?NwiUihu5@i+F
zBrCe1)BS^gcHZnCs0IM^bgN@Egn<M23QDTk0DD5(V!$upEAg5X+W?t=E}@QFb3c`G
zUfs(k&`-LeYEc(Y>{}yxqTh4hG%vnR;z)9QrxY_=3v1i&2mQKTiC$1O`i9dt;TBA|
z4OJtO@-L{cD8s`bS>Xd6BcQdu|DFc}JD-cw1Nx?#0eC#|9>6K~0I9d{Xw@m=gStv<
zcn_lZffr-cnyWAk^gsY|P7AcfNQq%aU0E3*4xmIeKXt^oGo_iek~VS+2JQKyzylbo
z7u=wT?Tjt?p_QQoee&HMoMP;dC*Fa+9VA%_>6a?;I$wf<2btSc*uI%br9tCSRr56&
z2-cpk`=O}UPH9(jAUkb$Z~t|tSQuGR6|jWEjGzOWw5qx|n%akn%jDust#yXSAM|~+
z^J=f2-}DkfRPTJb&&}Nlt6GPLe?L32Dyi$=)ZTwY_Q)iy1gdWKC98!TaLqU+*6IF%
zJ5V7}bS#wAa{{EAZfaD%o~y8GY#mF;>Vhy)b{R!67x*RKh{K75XVD@OThyT;09c#m
zC&>rJ<ICGW^xHq|w@OWC+Qes$P?RYlqM$dzb8<hUV@c(0G87{vF<#vOUc^@z`iHlQ
z<c#r?U`4TLJjk&g<k%e~enh*6p%DdUhc7!vr^iU^loIj&eH&K#O{U)b<80^P^z4m(
z@rQbWsH&d=UuU>l`>fUdsLHB!R|o$gKjspRWQQ_h@4Z;6D9e;)0he1eGnFM@o07xn
zB~8KU<!Ik?L1qD~O1cC_aMNPhs=GL{`WVmb#33EB18lCZx~@w=XoN0nSXtF299Yw3
zAE%AiB_TXum&vTI?N(i={pVSYrH(?o^%-s0lXjTdV&`Oj=RTDmTIx`wLZphUL^Pp4
ztd%M9%4OKUc+cZ_MBdUtY!h|K08W9MfC&aplEa}+IQZ6*7z{4nn^d>07+a=C9Fw;L
zM}x}?OmJUg0JF!PjKU_N<}zUJ75NY0Dbv`y3a~xNvn2<*H;OstROGccw+e?!Ak?0y
z7HvQ885XQt6F-e(CXL0)dYV)1BV9=XyF;-5tF73+e(w6Yll^Cw_CH<x*EVK*&&Pk=
zYJK(p`68cc<-+O7i>W#Vem_0N4+k}!C;Y1k2Xs5t0{alnY@Rb4&ohuehI3_@@6aBY
zkr!T4E6mfal$|sD?Ia6l4)ZF^q9AqEF6cbeJQ)YQ@I34_Utp|E4%dpWo6V+2;WK^m
z>Bk6*Dod+(?x&fDLAIYzq(C>Ox&*SL;Nj2+wv|db{2n|}NhSarx)=Z-;~YNmB=(K5
z<yTS2sl7UuI@hIaoBv`tki>a~Y5Y$9Y&u4tnBhw5MUHLjOjUOQXFgTS)W99+;DJ0H
zLY&Z;5^7@1U=G+Rfa%NYl*iiX-i%2Lxa=h`$RLO^OlW!283vcZ5FcMZ@glnh1qFWM
zh4hT#5KD{rJ$75iN3UZa??ye?t~~xQRmlZ<Nk|$$8a4^)ekvM3WDX=4pb0`s(&v6e
z(TBs{1lT+k>76~cG>Bp97=IW9vCP{&IulrPp3vYN&GIm?61H}RVVp>C^Lv@#q7~Ly
zKpV#y8Qf5nhqw}38_jN*QMX$g&rP7>ZLjs5*{NZW!A97Yo9OOM7N}_tgY#?!*W)2J
zR~o)oeLSxPl}#9AZ(3oB>-(n%XpvmQ#~aDVJC~0)mXG&K4~nk0Jq#;MpTd{lI85-2
z(X~<Pz18Tb=dFz?J<s!HzR|7UZFDo>63WN(<>STj@qWpq@Sh4%KFx;^1>F^&5CXv_
z#n8Kg`WP*2)D8N56@nIb8s+gA`zTN-ZIy;Zs-kF9mRlqn>pD+rEo{Jkz}j&gcFTEe
z_k-cel7RMS6a;;n{1CBJ6llfseu%Fy$S#Nx-i3dOd(8M4NQ@I{mcxxl6a*R1i-3qx
zjbik|PMl!KGt37OkiOl{9KvoK0F6HBCRKKBlwHt`qeo^KBMv)`Di|GHybF`SV6RMs
zG+1a9<2X&jF3fQ353q>NZ=Cp~?$IKS!?gTu?^Fjd6ZhdPNV85)a@lmUdJWdbTdr@T
zFeE&UR7OVTbnoP}^J3?8hoTR9YuAt3-L1`DYptX>7R5DYOT@z(^+eHC7Z#usjL`sp
z>MA^q6i`Ef*SVoJsCacpG^G8V*C2TvdyVQ*H^|!=q&K|BtZZ$*ezYtILLkf_@<$YK
zM+M%&G*2YZa)cw}k81{}18E2h91Z~5z_3f$6#lhfRdP5ss><e%ONRgBj#>ivW|ekM
zQ7EC}h+ALlx^R4co(7WJSPE=y=(70Ll+E)obC$O_n#S}BhP8p$<_CrwDLgQ>41?w*
z_;G)k;>=JW<a9#%hV{MfuF$;Y47jC)8F=nN-Nh8bHsPNe=BsI5$QAP84bS;lZ>X;I
zJ2EZgw}nRG{EmBXBQmzh39lznr~_g58+Mt~-JRVZ_Bwk9JI`P5z34z2hjxPvtEdxc
zOP;Oi-=FXSQifbV$EU}8d!60WpDRXKU30!i0*0xL|FnO4uy=Bjr#^O(DMU&Y`>?pE
zLc*H$iQ*C2Upxh1pek$E%Cy#OKJ$K$-m%wkp-Klc3PHUV)idGF`;;jI+MxG*&|(9t
zbijFjH->|@?WvBbO*ixT6&$H#2a;BGJ@T)0&pP7>M{x_&7;|?FZ}N5NvIy#0_y}#Z
z8+MuTBpLV_rU-fJtvhd$0AxrXB*u)YZ8$F-B!{<~DhT`=KbjCDLRMbZwjl1^_fj~!
z;dnr{d&SOZp>?08!nT+rpfHx9IVVci9A%wc!>K5{gD*<jHOk*Y=~@hQGYnP%gCv8`
zjK&s^{XZ}a{Ul4nJ{yHXV;p8b?oWm=G;fC_IS*B$OqZLKFOFAFUo=rFHWDa^OX1uF
z^1B<r!m5D%*1RZeez2|S3Y<V7E;T%24OHAG3f<rFJKQ*i*5YPiG1Dxd$f(iwqB&KS
z4*F0Q0=cW75)5IB`CMXnN$|?}zI5cjMSs^!aa9%%7LLZlum`UIl)&kwAm3qI$}*N4
z@wqvmnhng`kOcAzdEO<(11wQ7%g}ZiV+&H_!y9Qnlk@~ck@3clqwJ!6uxf@GJG17J
z2}5R+_Q`eMqR|H(itSR<k@o9r^{V8Us>mX>20v=tEJo+2c)SvR%e2KER%Y8oMr6?>
zyyS?rcF2FbRs5}TKTc~@#<b`pKXV$aNVQ2BGNrTo_@wzvji0lAiqZ@_;IB11`>-TL
zunI{IG_HKb=v7jzHw=Ibj5`>h0kAcxQI3b&@_C)3@IV!rlT``IWNZAs*do4cIWMh#
zWITQ{Fb(4$2?Geb&{|eWRjRaMc5{?4ZZZbOBe3zn>?aUkCM?@1Z}es=Ix|+G^n>2e
zSD9H5`#BRt%JLsn3=_=Bf{j^LPN~^_z2O9RIm<v|hefGIf*Zx0YgmyDkp@mfe>L9%
zN>IqZ;fv-(Q~ju+wlb2JauG_=m>-V!c3yOLU+?W4oE=S9S!#4rVXS4LNHYmC-MLre
z$@FWwo72}P_4>?avte4&Nav^hgZ1_t)vqu=-I9`oW)vo4H%wu$WC=YA=I3!dCYVm5
z)ITSDsf%|NW<MEAd;(r|_XI%-4zdZFsgQIY$10gjOmPuXOc8^PW;dMUHRV+T0lEhw
zZ#Q5Dpg&<WNl9(0k7LOyh8h+D`l2m|l^r%!WXD@pC2+=Y;M}{HpR=Kr>fo}-P4n3t
zXBhKoWd|9a{x+!Z2xA8DCk8>u+;Q?khiUH2C_H^?u{4SU{PWKR9j<XkS>`$Cso?Ny
z^HeBd59{0Z8dk2l2_#vuZn8@vXYC@hctMDopP9?%)nJ!nO-^`+YA(u?+(7q2KINqV
zG7a*ohuSW|39XLMxB~3voi{|}qC=F!2m46Y7=dIee=1wA6{v{?&`)(x(q9#ygYBwJ
z%{u+*c5ctrBH>VS1Dm;AYMT{z83K_F)WsI_v+T0M9-FeoWUk9q)0}IbDc7LTsdbN!
z{B$-t@<j#Ix$8_#gnxUosWVw<i-)C2YLTjZQ@Qc)-!I+x-^{o1%b*Hq2g8{G+iA(?
zu}z*r2Q|@o7F+SI!Z8rNyMLdVUPm`*Ms)wao?s`h>$AoU5`KLiX1#P+#3hpE{HZsK
zpw}hkI~M0u$R%@DNuLFQ@$sBYzc8{Wnbm}O4Kv|mWi9JQBr>FeK!IgR4!{9^gTEAX
z9geV8m&a~0dYe2^dK80;DvG9VT<3<a!aD^mr|BZ2-q4fEcWGdWugYO;pI!uC*!Hi2
z49$bNRl0^DDOfCzDNnm%mOSqS?||dch|~xnEEHf^txh|B?xljRSXgnTJ$oTJy@6yI
z|DaOcX}QG1D}aFr?nIL)$Dq;k%rO>i3qjqQ0TuAX3>x9O%D1l$SrM%Vy8~bvM@l8=
zGM!req_;{1kt$iFc_BL=R7rcvV0AO{=^ZbqI7Qr7llZ=jDI59MQz=Vk=@p{<$Y~?G
zB3i9pzTKQ@W=cO{&6oAWGU2I1vUK|bQ2nF=3Qig8l)X(Sk=u)v`OqnPE_YsaOP#k*
zoSm|C>>87dhQT}5-KpA^p@GuH$y6L+A<UFgE>E=_E=^WM50maAC`Y9p?Y3Dm^^8eY
z83c2=>u0CrBRi^pS(M2;+5h#j;U~=h{%CDIAOCfIYwc_N$1n1!w*T8beLdCwkKf<b
z6L4yBcc~Q5l?9&6yguHl&vA2{Rn|%>ubppTQ+Q-q2D?bEh7|A+RBv{E?!4GLI{jhc
zQ6U#JRE0CAAF#@s7(Tpl$1~Hs!;6x#dRWk^ZOVK22Xp0-cDi=~Xugc4`RoU}TZ<^~
zZ4yMxL^pIGZr_8MvJwLuu~T|`x{_(ybh&K3M1zakGQ6y-lcyn>vZW>X&EFbqw4s0F
zH+jMmfcQLXc$hg?K!ptH9k>)h?Sd!QthZcSrbg=eK&u>m=@^|6RE$!^(Z<BUG)Vga
z@UoJ4ne%}U21zhLR)wB&BJ+X~e}h~=`;so4i#n^PZ4NqAd3#aY8+eft%?dC2RWDTL
zUiHe!8|`)Ji%x;=%#M9TGH)nl$V10#daCe;0)Q%DXhAPO#clJ5EDp`@kz|T5KIvo^
zWAhZGh7i-4TjlUFq;HqVd{j=;+%+$+6yh2Z`8Sx**W_*%8;IPKU##Dl<z+C8yU3K{
z(;(F_nhG5Op!MBko44Ns^d=FfUzb?ifWO;9i!22KJo;nU35KJZ)nXlUnq^6R16YNr
z2~=8fv?f)?!Nw;Q1q*bO{l>Q9WgOK*h(s33QLlcAPf`JWKTNWlPCw}RH=U9FVl;X8
z&V9kp$9XguQxn#2swu-K#bfz63#jQWtG)VR$~p*|>g^MZ<KD%#J#8+=K*pP+3MgA?
z>-UBMim=`q$CXIOanz@aCQ3uzw}?e>o%xYOT2H;2HetRDeQF8McRZ*l0{RJX{HSFO
zr1{pY=BWuiz|vmwJ-paEIXyo7=iZCDTu)sD!py7KI?QtXEJ4{{@4wkURU=BR0nxo0
zb*MOg3v75{h_8NWdk@PRbZHH5Bs{tBQTGOq1V?F?KTOp@6%YGkb9}+CVGxZQWWmA(
zqTtFDfFJN4&I;8NHiZeDx-&Xc9YD#k^9#GHJ3}vT%&Ma6b9HAXi{?Z#vza;*q7>9K
zh`Y`eE<PM5Xv_N6)t}q%;}kDi-=Z%rtnTb`#AoD-X@=_>k0U70hKn9Aj-CcjKt}HM
zV^qP44*&O{Gk;aBf&B)#Cp&Gf%GS<dB5US3mR|Z^ag@)VcrQ66B5I)YpnqNZOZw|l
z15KXmzeY<9T@!~?x6<tTT_CBodg+bA2XU;ft<{TgG3ds#WOPz!Bp@lmWJWa&h9U&2
z=DcLXr8v4gBs2s*YWBQ0Xa^|NpN$~}V9eQyMiSMUgDe)LC?C)*QH95Vpy9N{w}8nM
zjRZ+{|I71UeEsm}PWm6)n{JLiX6S#`*SFgF{2%SF{-0mwQ?36wIzD{aIsNC+jL=d}
zu{`Tbh|<k~?^WM`y(%jMd?H9Vsr{p(WG~Xq;n#{%8LDzq>w87HfmLoWrCcUiiELwg
zHe5X%lO+yR@FznN5c0NF2qVkyf<Sh3y!Ub+RYEU!&R(A`EG+#VVB<>#|Bdp}CMbak
z1VJTFcHSJl-ZLdz-xZ3`+WiP?rwTP&%9`T`Kk182Z%pcg-dhr0Ik%c<w#Womj7IU!
zoYz*Bs@3V*jcqxMI-;Xely+Eaj=73~f5#iiC_o{>Pr~61hjxX3lYSFJBlN{@iJTkH
zt)ZMJ7<uUe<c1*(L@cMYG4NX$C}oYiiF)V{aKV}_v`doEU`9DdAbEa@3OYC@TkXfR
ztYY?!<GHW`Ijt0G?*9D;jFGW_y7%T}VPR{7YE#56jN?N&U%l?+{G2Z(@NVzw0t8?@
z?NP+(Pex<54lFkP;_S^)=lR)7)Qv#Xo15!fPV2NhO)D1`cSB}l-5XvO;lJv|){l+>
z4_=z~W#;7SrhUak*#MyRF?N$bieb#Cbi&Q@0LJWLD2*|$2&xVBP*C6mc`hY$VDTQq
z@q|Ni>PkK32!!TtVfG;P;<x?{LI`sLHKFKbi0D<aR0rs?0K4k%7|^A)*50_qsA=c^
zi-vtlj#@JC_U4uvw&l1iw^ylTaD-+_34vj+*kw;g4B<=5Fhb*0HU+fyoN*k$+io2B
zWUTE7NwETunPmO=s%)S<&XZHjm43Xpf3Uj)bpCYj#X_x?b2X}=CIe&5VyMdMMvl&o
zU+tV89{+P{3+*W_(AKPOcRDv~A5dSJ+WhBk`G0{Z-r@pqI{(*twARk&e_MaFvH6w%
z`x2ii`G0p#ewd#AmkZ1p*29XBWKzV@>3TkidPKr(cHzw=8BLNO;Qe}oy@~tUy51XO
zh|eB{Q;1Plh^O5SEF^r}8IOlS_eKnSF0yQ#K3QEI01GhbuJq#3s_%1&)pUftqiudn
z>_s0n`9l>kZ*}>TepZ>M5ThTo=^!npF{p73Sd>HRA`Y>W#M!X3-ma;q-Zk1rkRMgz
z*t68GF?1I^`_qH3&z^a;^|sf92lX;58KsA|I@#K&Y3=m<oosDP@5IamZPB`bAa8Lx
ztdP``S{_q}UMSWfz>6Yt2gk5KWc4_nTq{M34(kvZd-px^ZHdn{wCYWar!HETMdR#?
zS2w6gUjQbpH@>OePtZ@IraaW(aKd1wVVzZ-c7wJ-2sL7x@Qi;6f13$x0|$V(fdj$)
zbHIW8iA&%>9o_{F)Zks=VDRC56ka=+eL-Wp@c!$mcY(Oo+S<mS%P{Ke$D2X7=Wlhl
zodWBoK(F0x`@#C=cD@BYsEe5^LnE@c0UIm5#rED}d+XTYTkP=f|2V6yU7w$Cw*2${
zqoBXJ`MB33`_Jmqy^UVb{q8(y`7oQ_=6bQT9_!ng(7S%TW%d#4=HCW4j6I}})L>16
zfNj1EuF={O*ZI_|<sR2TfV$ClZ`fQ!*qTCFXxLlzHgKS3)mrcZ`@pBUZQa9nF!A1Z
zLA$@%+AbDoQ-N0Z@uT(4@7Cq^tsD1m2*nXq^OQmlra(jLUXAATP>pzbgRqn~6k$2?
z#kCOXHl@Tiyzs(@4|!LZNxj8^7pWFk0w9wS>cRpPgVpWf#OR0AQ8fE)tKqda>)Te*
zHdh3o;kt9hi$cW<thipc-nN!EVP0$3!Pe%+R(ERyUwz;`hc@qUc$EN*)|1|qEpr*L
z7V|Jzqh~3I(Y*_=hU<UdTW4sIH}(1xEC+MJZhmS1hQ|Z#TYlYkUbpD=WBs<}yj}Zk
z+tUE`=7gqaL(%}`9L-mhqZ9&$iw)5>Wzhn-qCpoe+pPGaMceP};Ou1Yh3D=<GI!TI
z5aj0K7BoAjxDoks&5++tJjnoTW&6{+^9E(ISGGf~hwZY5>tzo&W^VBI`gh&$wp!iF
z4eoc>g6|$Z{;s6JIu%%d++E-BgUylx8{9%GfHI$+M6|X(7mZlnz#Yr@YAUtosMN|=
zTA!m*J6~yIj!Nr!LN;aJd1ae!3jO-7P6Z#ryLJgB+uUlwiHSHv18A$Z4TSUn+R)lo
zonB#~^=-sn9Dt&xg(??V<x!mq;sDmSO}VxVU=0`w|Ix-H8Nj+~+dx|nU|m|1LL1w-
zQ*Z$5GJrxAlw1gC@Cpa8v2Dt&%K*OHg8BE5WuXCVsJ6|@=>cp&Yme*nO4bQ>B@SRi
z22iMSvB5_O7Q_L_QA6c6WB}`Jzqj6PJ^BoXiEOLFVUphpxku~8M;jHV5J1-)L#@px
zSW+J}8~KB%wc!?6&mTqW?t4DT*0w)(Ww>!X2G>pFd=9oZOz$nXz*=GWYfb_0yWH@-
z@7(u~&G0EK&c|RkckuWLE|~7%QGN>EBe%d-ehS`}TVOLkg-!SUhP?tGK^?g94Tsh6
z)(gXT85ys@$>dlWFVD;5m>F-)9{yda>zpi&Oqjo}o39%#&%=~h(d2dg4WS@(vZV=D
z%cdNaER#ig^>aFi3`Nw>iJvuuN<U}5^CQQ{j1&O<DW*x%QYth^5zW`zsInj;$R%6F
zk{fo(^|?4es5uV@nBzij$p?M{Hjw(rvw{53uz_~R^p2Q27F{1d>a9QOe%ETXHrku(
zed5CNrQ5pnM(=#n?{BQPA8mk8_vpMnooQpuM;X(`Z{&2T;?vfEJM+Hx47cX6YAnZ>
zuxcRZ8(ygGvT9tZgjFk4YRzJxpayR7_163h6jVV5s{LpN1J&;Lf=BJ|W-w4V03ea;
z>xM+OW-w4VfVPZTZ@eM{wf=bHyG_5l`H}3ya(xQ(V3u#qebk<tEufiNJH4h@ggR~b
zjmO(~cZAMesgC)C<F^=xiYC@o6Km6(Sg&rPElsSqr#I2AZlWbkz-czMiB@$JYtjTz
zjHykmRW<<}2{!@IoYn*}DiuvUmL_JL`Lhrj>P{QLV|7j!2k=M+usIzJ#OhQuu{9r7
z5i?ZL#O8chMf_4l6C3kkmEnqtO{~v{RfcaWHqo9Bs|;sVY@#(MR<){|SaY%Ju5|kL
zteDNzSPV>&nId{$!b}kvu1{&lVtVqd4VL}zd2X_Hj`mA#tu$9u<c7prypk1C1(FWd
zS6q;U1VF0({ZnuMfQ)qNgh^*;`jAZ`GJ|lg)7X5;+^j8@XK`A`KnULy;!{1}f7RJL
zc(K28P_F}|Z5EFvf?<T~Gz}hi&Eipb@EBs4Ot==DTNb)(Okrk-M~?Eav|TRFH!KVj
zW^BdFOj=v}%_`6;DbV_jZe_$)Y=$Q?U+8|dk@&y#xs&}zI*Q}$BF%#FN;-!b2swE_
z+N`qw-P~F)*#B;{zS@6$k<YzvR=Z)enqDm4TfFDJlEkl`?*Ur$63lt(B(Oq>3!}RZ
zMo8O@<pyU~Fn9rNo%<s+=&UIlj38RM3g3ofKsbLTP6n&^YxP7|sp}Y{xr~+27RLSw
zgS^kzHTL^UYZb%HjX@l1>u)P7D-Dl-$g|&8Ja3O|=b$+W;!jOZFjOtf383I7H*l_B
z2Yoig^O9f;y=gNIg3wv&4}vG2vje>EFa0F+qwJaYJ@*D*y60o~_ZnL0!QUJDOD)L9
z)Cnp6%zJLKAx#H~{+4DRR;+rehtVXZco_o<e4B7yuy;Wc+l6Tqsw6^dZDnN(&LFfQ
zNMkZ)l!(M+Wk^gFEE<RdD=X`3zu8U6RA98%7yy%E?BF9Ycr*oXbitdlf{XXkAoH5n
zi;KNc|LGEd&jseU%S(#_o2TEl7J0f)ziltVT%LZrzDVPE`t8Qz4S(6h{BOVjE`9r6
zs(o03sV;ibE+>uK-qsI-r1&V!tY^#oowL=QMaFei+UL}D!F8B<EmbQ>{odjtw^l>u
z1)7F|;|x6S=IMV^W8c1~F@Nyh!dHAvdG2X~AG}pBz4kh7Z+H#7$$xndmLI@h_|cXh
z552MXr`PYnKUv~6``&|J@e@7ZoFiT{@E)Z1{_EG3duuEA1`qxl`n@Rj+r|X&=g{$g
z;nNS)@~ztCVh>gxc=*3RJ^$*h_uxI58GGNhK0NULo6Hsj(jNheEu8$OOup0F#Ge})
z7OgcKQ2&mwNwbf_6Po`cng1jDwWXoadAwmm@1eJz1K+<9xaLZP{^s!T^oNtvy`$-A
z(CuP&E^?g*-N}5OIkt)zEX<GkPdEkdw?MqeQt*?DS0y>pB|SREHv-smmfOCZ$l7Ak
zJ%H8m%fV;mzy?Cxn<SUe()_0~$50z2@s)R;#3OHwf_}zc3y+gEl*_L1pO(0V@SxDw
z0&_f5ICf+k2NVO@9IbNZq%o(5fga9>u}>ZmTwsJLsU!|A#Y_(RDs4{bXPy3S^Lqn^
z+BF6?Y__jG+yvLtT7ca`pABiyZYoGjV_VQx(`#)~ldZMsZNldf|JiaoaavC^d#r2J
z@}o8C=kW#)ee>GQ<ZPkxk2}X8uAVN~2Vhyb1N`@7K~s{lGS6QgVFp*+)+MjKUw>Uh
z(GkDbun~|`8>N$$&o#fjsl(W@GNq7CpSBit(&v=(J@b%EzUOacCP@D<!|}ByKi3vz
zbjjkaX&U>+0O^4bP3bQiAbFnwxd4fMx3+fum$lZ`HSnc>N%6nB$L&eS7x>Th2cmt8
zNX9W+ZTb+i)KXSjN^5IVuW4CTEyDC=bE@7+{wv0Hk^tzPUYT3KjQpQ#?TtsS{I|Zg
z+1~mp|9y#1^_j}C{!Ti(Q;$@;)aQr=mcF|~p3B6K(jlKF6du|i!C51bjUR*$wA`A?
zVZPJtCc$MW0sYB+N+jBI${vUb4^@3F^J1%BjdQedGdwU3mPFB7dP&$te?MRHap<~!
z4^Q!7h&s9_>hw^F9KG5flOVaNtLK<Y6FvU;F$Kj=DIZHAVI_V*IK`Z(7<<cYW(>`X
z0eMZwgVk>@^Sz+gBqn2g8!`KnT}Zw+6=E?o=?;)j8SADnktKC-ozu*!0@qKx>nR1Q
zS0e@H2Xn+#FNc4gv9oC9YEY`4WH6DyuP`S}lA?z8?g=U(IBI#U!b+l04TE53PE|5{
zLXj%R8AVHz^i=51=c8w;9)*XQPIbY^(@|-hf~%FGHg);M(C4fiZhTE!(>~4;TWt<M
zo#4GHNG7#tHP-O3;<R|5tW#bL(@!~q^fn{l<^cv+=Uq0+jloK10zck`7-tKUsY~=^
zT)>94NRncVWOt5mm1?ro@Z7*b(gY<9!JJPtKOT-aPRL|w_k6>_sCBe!t6}fYKUL1f
zry3?z1(^^?IsKpmrTj@2b8fY|ibtK#2csfCSH;Y>!;^C4Ke{egdD0}<GC6y9vbX~+
zNZ=kTlbRLozabW8Dw)^u&cWY1yNAbn4Tgm{g#d5MlNi|xFEHknqZP9kt6{-iCTmCI
z!im~|gP-CHgZ(MY<JqaGW^(xW{eCTUHUU%tRxeER&m=sx?dLKlo;u-|=0edDRFi%k
z%-1o3>y?nxaeO6eummZjJZ%n8XU}CkebY^3N-Fps95F~+?RjzPy!`f?x%Dcy+N5l+
z@k2o8^c~Qa_M|2Q(<7>X(T({LyJ^a1a(B|WWGCfk?V^P>vz^!buMXbq9h`P{Uc5MN
zKi@gotC8!M0T|8`x4^&E)?=V#pBh<9P*ZJ9cZ1AY0<|Hz#aryaGIBC|KGh?&sYu0;
zCI3P>MNwO2Hs5eLH{;-N2$#2J5f(${_X@O1_fo<JFsG<ul<OZ=>_G{QE@gK<4XM$T
zB`k1kpOMVW+U}+MI-PV&Mw#E&G;-e8oT|blA|<@c>?9x#Lt{K#RYr*dz(1&1wEf)3
z%pNspaEsGYp`Wu;T?BU!)ZT$MZknCO=e6uNlSN|c7}9<z1+=z+!;6%&#T9#^4EsM5
z3W}6aTq1kecU&kWsw|^s9n7c>RBtA<;$hz*w)De}lSxU+r=KlVz%HIGp9!ckt!*9h
zRtSGD9^c?MvKD7XO7l_l^P!ra;SRQQ{^yzjTSMx_zn*!ocaC3C1ee{{J0~X<2{0DM
z(4TX1&pt)f@kxUiyZLPJ5$B9I;!Uno>=h09PLmtYANXNpR32QDB1UE5NTQ#Yf+Yuz
zJHw-FY##%XGMJR~@j-_X-i7t|Fk@^iF=8ooZ|c=BDF^<3NI)TZ12biz76mid2MI;&
ziehRdxE=?+%)}#NLkof?H+K~dhj^ot1jEqp4lzbm0Qh~0mpc-<R}fK|vU%UDjaT>n
zACK&bdIGbMm<3}Y4XQSwg+m9WfZoIkWK3X%vg+6cx1b+)qZ>skVYrP7N>N57rZOIm
zko3945kxdS3F-|`aVHi949<O`%VR_eCxR|*NmM5+dwbVmN*dg_`#T_&ffOqq{eJMr
z1oJEF=v^3Km1BBw1C$#R@L`31t{SRSO8N8n!T+w=n@!Xl6<h8@UcZ%;2xnz|Oyjw4
zagdes93O{;j_hFJdx3Ac#guZ)&Fsu=;dPntaLXC;;bouJm9o<R$~`sjc3N?E3X;WY
z)b2!aXB1xsQ}&PW3<TS03k}m)4AI4^ADk!tpmPyMWrTIv(`+;hoXd(^kez4Be7Djy
zIf<xD1}RCl>85XLc=wBK;EF4~9sS)_=@HUSI`q4`4=#j{kizs;i+n4Sa#vPjEU_Wi
z3(KbwRG@a?ue7gN9pNt2Q@z3`lnlh&2+2}%w>W7mjyy$Bl&Y01rw$h=CiVC^qOKZ)
z20|Bu^!H6se(n^-Y#`{@7e-L*KDE_+2EWo@xH6fq%e^3HyFl+R1u-boe1;FGtyPTn
zg}Gt7WRL-@%4Nu59c98P8>rAl5l*!?Nidc?a2YxvA|4TT1%eO)l`6mhc|eB0hM_L;
z2UHfe2~iD`19mX834>539MNNE!kiz{DlLtO7aYO^gEk6K=sQA2eRtrpU=l+NF@Plu
z30p+}NFF97q)<<}h7dQJ`k+`6A96t)XUSv<%t?UT+LJd1su<%Eacq)>j_V7}PkL-V
z)st*Ki}+CyUQW;3x&@vdG{LTh#0JxdcH<Ey2B1;cy;BZ$brnd91DHlBX@~`tjL~uC
z!^XhD4^R)jK<t6e#jZ_L0m`sM$Tsvt4&w<TL4eWUiI?r(FgY8?*46R^&4E>u_Bhb)
z>6~JY@}w@He}0SilvHhna^F#0S{ixkQM^$?Ry|5I>ZL1789t2Y!I11}C8BI_8TOdb
zCJ#z@auJUM%-eVaTSP?;jnRBe)=JaOT5+XZ)Lk|>_x)4P#-9%&q&RyQB%i9?YqYrB
z`^>C(mR-SDhm_CwxsCmgHsKig(O?+N<@<r38U7#b_04?z&yCHsul^rj<fHvRyk;<2
zT;#}_o%CkZjfcRuUXu+z|D+@?;We7#TV`!+a`XH~ML_p3zGlb=tVgkm$^9U>#-|~k
z#+r078udMHp3QU`WUeYCHze+K9H%KJ*iiAa6&fO~hhz13WdTBQzWs=~13Be6w5Kv3
zLDFjtZ^iRo<m{T>>>Rv$jr^z=Cw(4e&&N(t2al1KDe5TMn$YOAWemIn;f9lo?;P!W
z3@iQm0@H>?Y!B;WS}}wa+vYZ#IPj)!4i2DIU{&O?nrxFB^jIlBNf^Eo&|HF+=EKhO
zWY9AsZ{&4w*m<#MUh7!%RR!36kgPX}jT#|@{u`0t+xJD3`S9P$j5E?^o6+cl_a|C=
zKM`y1ys<YLWU|MF34IUM(7w_^zYq9uiA^jE)|GaY*?hfaSfgGNr^>3B&P5*$mC0n;
zAJQcRCI}OQF$o4vF}i7v2J>)*!*X~c#)?-dnM89!MVRM^0^DP3qW~>iv3bNSfTY3b
zEDeU|AdyZ8`R$Pc`%&0gSu6p>FT*|>T@z;#M}}i_5j7nHr*j@kHm)4rEwaj_8uc`e
zRio0ELlDkLe=F4ZayGU9PM<rS|A28>oUUA~gwZ^G%*g+;wcg&y`+vgIujl`l_!xTm
z*WZKAU*+6V{v^ixMJS*g)%~D1^b--HLosa3!gIfuNu~}Wp_E_&2n+}=tZ8$zbi|`D
z%h<ZJK-xI@0yZ{-$b#%17@j~_)4zrwZNr03Iyr~w{B`A`&g2UvQ4m6On|nVW9Uh-r
ziS`zj2@cX4p0?Xnl~8(ISg1J_MwrNC5Y%g|pX_zxu@CYnYaZ=%e(2i2m~YY2j={f}
z+rT_J#%ziEyQlEw^z8V+WEQmGbNa*a;ZM#CYL+sTy&84#-JgH%Pz9^o)6?VHNGxXE
z!BF&s8iuI&oP+K;gN`O6N1OZc6KK~ks8Y!!@Q^8tiG~E+XLt?kI^w$mUe{&#jjFl|
zg|a>7+2f7ki0mC&_0J4lG5_v3K+fs@Z#Q%SwYx4BzLbIbQ_d(6U1qs$!yNcBeW>MK
zQ_rX<G2K@6^hNggb<Mf)AbsV~AEfzZ`B!glaSEtdEJi;w__-HJ+9+S9>pA*#%{R;l
zZrN2TUFFQ$rpyZ$WIRcN+hJb6IHhT0p3+iU($tg{xg|WJTO+5y;ugeNWlSw3%C!>j
zmS^Ujn#=aq127p&%SWPmuS(l{>kc{bXECL(-CIdo-;V>s6jV~F<0&0B$!s;V1hr+#
zZQAK|6<_40Hm<8-Fb`14GsWZV)>tS5o1`e<bg*d6#k{kVo#(Ijh`e-m4-ZaGZG*j1
zik?@q9R9d>e7yf+uk!|<?7uqryfj~NBGcK9Td_*pT76PEw;$>EXPwz)kz*~HLG_`g
zXYsF=ss5clcas0{9(VM~^#5y*T6y{ZtN#B>eN6nP3f+G})qmjV6j9sf=mtn108~3m
z;^C0>mL(c)OYxmoGkV@nsK{5>2};FH`UoHsN<%>*CX#SGram}~M34ro<YnbRNcxFt
zz2))V!Ooj6ptT&$S-f4Y1&2wCB7F4ewVQXm|3gLkC({45;D2lR{r{-_=<ELf5+ChZ
z|9zVEhhcZ+;@P6}3{9L04*^}>XB2ZY&6i8)ZVDb20|)?Lak77S;4S@CW0hnS{_9d@
z>CT&-zX69)r~(N2dz}1rO1=Gq@_J!3wchiyS1<Q}E~(g^3{bCFUGw00@5hpQQ4(BE
zsr73AMF~VYgRl=!(bc%p&z;w=I>c|*hJJmaMiE5uYn>vV76P8Ot(?-T1+H#tpP#4l
z4VocK!hAOBLQVSoN?e&Ib!#dJDZKZ-*C9z&{8sP(dAWYPC#nVW!fvGg?Ady|UVpgG
zBXaUys{#Gz-tnPKW9@olt*$PnLqAn6S0S7L*IpM8Ro^hLNkZM!ThceYs<=^HFR|vj
zg$=6ms^8Pyo!uYy;5a$hbCc=11!`GOL%D`O9&%QK$Mt$e4Qg^B*9xqOJux=cn?5hP
zy^hQUwvU!UaKxm6m~$?bk9!A?N5&1aRu5Yo5gOnt<2b|S-I2f{x<tQMz7L<Rz)6}6
zf<`~+`8SPzntoVP48RiGrBTt8$}TT?BH&WgsN~%5;hlO6T)>d6R)?Mx=et!-+^Nob
ziAez~20v(?=E^ffYq2XGkdPB6Q_~#Y4_oSu$4!o>#k33g7&I-9=whPb1uFv+gi41;
z0wL$%)&9$Wc7E7<eYAIsVVv$=SCqk*B^7j|N}(a}Te526y6m35=5;wifvfH<tq^dR
zlplljuZc;8M#cFBb{ksQSo>~k`g-1Wsd!-kjPVU#vva*^!+3$x;^9B{Uf^IJanxoN
zow?KLjfayI|D)grg{aMECwoRhtXt%&L;}Xp;a9aHWh)UiEveXy<;@Av>(X9G98Jq#
zA;H{x0dKud2k*}iHESZu*DI=M#b;HU=3*mlHN3Q4FSGVwS)C0%SiXPp`nCPA*s_TC
z)=2xn&0ph2sdF6#y}4_LBfB=!aO+FHjhBbVZ+1>4OMQ(JE|wKLI203dtFtKPa8v>e
zoUnyKRR%AN9ZoZZD%6UZZAHbYb2-`DJ%!`Fu=eb@Qnma!{fS*Q!JQTMGMS;LkkWhh
z)N6gWw&uh(?{xNFyy|r7<>NPso8r*oWX9xmWo!Du(Aq7!<PSSP?$P#`wr^kveg+fk
zPO_lWsa5X_y_MV+<bq4p%jvT85UhPOWm;<E75X4WCn^%9o4NMolvcRFJdn0&!Q9k9
zW92lmP_cvEL8DQ0Hyno9O>IfU^QC&ej|z~>c7AnmCR@6^-;!OQ8w4NRwLvstJ@YwC
z6pIP`rsAI4d<7Wi9zt37Rm)dF%_=E|CTsbtVvDj>k+6IfL&c`hrQB8w$fR;k%2atY
zF=ePaXXiRBKjpbtj^v-<@R_n2)4~1;fUC?N+0;-ZMzp~Bn@EujZxr{L2Sz2=F)Dm0
zzl74L<^8TGkeiCDwqmnv20q6-uR1>faK7r=|II&l(*I%PMnH*qHGnhh|2Eb)H}m#?
z>tFT%U*;oAi30DWmnl!Ji#UFpc2f5zM&M!@Q9O^y<Db0*>E_NY?Je8Ct(#^H09CLw
zkWiQ9zPZa*bhKrR!yUpK?Hs4V(DX&lRa4>)YxWRPos=J?8kriA`OE!TKGDmj*SZD<
zIVl@Z^yh~~H5{lno@j>IfM(8>D%6}I%r{r8D2XTwGox@a*34L(|I$-q69RV(A3wL;
zs_}q6a%##E{ro%)%ys-Qhz6L~<92Jv1G*i)%HR2B+z<Z8%~=iUR<pJ&Ugp@Hq%Qj(
zG-VpkXI$lUJp5EkOn-c*NT=KQNK!@PyZiiUhtGz>D7ek4=O^iFNLXdMpBNA{#Q6Y`
z`&|Ku@&o<-q6!EgXT-t+NB7#+FZ$+9KmSTmUwFk|%{#Sqp&Ea+tLc}^>brR>TL9|u
zx1s;;rur?2Fg;3N>>?1nr*Gzk02E%(x9!Cb+h2v1;^$8M|1Efb{LJA0+pVof`TPHk
zwf0y3|4V#Um&FIRPkLlm|GKiWQm=dIO_cd;aHBF|u~uN>>Jzn^jnolVt47)B>E>_I
zoUN|SwOpbM#4+Eko1%)cythx*lj#Ky7;#0$AR9^87yr{Jj&O5EeLv|NpXO!~3@J&G
zPGo??%PxW&JZ#t}loHqJyg)Z;7L4TnEjO&9`D$eeF#?qV?;z9Tr<wOUj3(FQ&BZ#U
zB{JH@By3Og#ip`JE}G-!!@zD!oj2%F&2dM@n3IV-SZN*)(4RKWVmwI8=TtE2Rb$@Q
z>fwgm4d18>LFMnO%-M8i0o_-MxdG5WZ8Q#*%Pcva?>>Ae>5t-Qc;o#JG$lM&?rhvF
zy8)BayPB5OF5cN=YlC6f?WuH6Ra3LBI<>*Bx&X3nynfn0*xGQk(T+(7zW3HkwbsRQ
zZTo&lYaDU;;&U<SreM+S|8nZu+rWA8^(6kE@|kk}AMfqFc(eBj`j~b8ueEdMe`{;w
z(O3JwFY+;=2QV-Nr@tEl2~5T@8Pk$7YrUS&u}wxs!DxKpBN0d!@%F&HrNBx)#t9{d
z-=06D5DREcLovB}H|nSavZ+VFxpsQ~C|IP#G848$K~niL34-S*FFYcT`WQsRl=j-%
zruY@Bz@!m|PQd$(^B71E##C6m@^3g<O*8>%AfBYQ!!eUzj7fTf=OvzEW84-!Nw61O
z_?Kavz)<(Gzt-BK9&#U}P{(76qZgcGM)K6_Cb8eASRc@zGKQ3bL82z^od<q4fm3=h
zoxpkEQ?9=;o(bonGLmNDEyaiwqc{p-#_(b_n?(4YBsv(=o4Ak8$!bW8Fbz1A1Gd42
zgPFpnQ1aI-7)WYEzxS5GA#h~?V%!wUW<<A0envOF(B8-o0Y<$fB;zsY@-Q02IE1p<
zXRy3D^DAUnM*dqYr^n`xVu_p84bsdkWGZ=u33OiKM}q)wu=)WeTqIyvt3`ud4A9~<
zBCcQ+7>{tk48m35zr~1)a;9?Ft#RV_XzZBLH%NMuH05w{&?$P5E?&jSu<vxTvbc!H
z`R?J-Klcw_aehbyD1#y%-z4GSf`f%Y9b6>n97Aa#hsbGevHm`=9&l{u>RaUy;V$AU
ziZdgTT`)1mBpmj6QN)p5qnsMp1p?`HJjgYTFbq+hKN*cMoiRYMM@4zIfe*MQ7y>Pw
z9lw6!VJ65YtD5YuL_zj7-q!z_&y@3jg-k{_vS6imKKPhEW}N?Pt<CkE{J+*}eU1O|
zMLykN5Jt@*kcbH-HecF-MMqN9lxXNpzlT(M*c@#vE&9nIed0BnQQRaO=|v#+b65UX
zPxb4k<TGXe>oewK`<S}_+iUBO)^hRxT8}o?*1qolFY$S)Bm7`|Rpu4E3t(=B$lw4&
zk*0AkB({-M9r5{j2)~Dli$E51pDcU*C|m4K29)NR?8nJkf5gW4sBgibW@$WPR+RF+
z1knXb37m=%Yp94o$cZAuvPhXAvm4}dkxiz6ru_hTouLYjCQLr-xdtKf@f^GrW`Q}V
zZ=NjD4T(y44Mi>{-IZQEDk`=Y7ni-wmDb9dS9=2z!v@~x!CCaUj!lq#mCV`+>E`)e
z%o>5JlO{9g4dP+RJrX0ar2z%brRc+&?e{!e9EoBUHh?`P-cZR-1X#AYbf6{bCN&&#
zsK61$m@NEKnSn{z*=_(bQ8I}lW>US;WSE5@&Ur(i=K;xQfh!Op=sgrVvWrv;2VQRi
zH90~ah=WOdX{}s3>7t%8L)5@7{OAT&2=N19_X_Ip3Q;6u64xfZ9x&?X6AWe>_b04t
zgHb|<Sq{`3@*3sSIL3+gP%P+U%zu&_98nJB#xck_eay3kz{hCOM#kKPwZ+~!Z7V?W
zCC$_Vds7KIIiZ8X=>=CfjD8<b^z`fiB!iVvU&Y_UB^^xQ3uQt^#$NZzSV53DuyEkX
zB4+sBSCX}dsf|*Ma}3`vCa^MNAD2f7j3n^N&KbcTz<9qfgW6x|>D3=~YHp|B_u_H3
zl3k1`#xZVhKpns?T>VuK$h~|o?M_57kT^VYM;VXFhp)7ok$)YICL@w32MO)N>;glc
zgFG@p<?~pgY}WqT|NY9(Qc6>cm1$5Y>vm8wy9`ABL7!n7{BY2rx76h&u0=#}K3^I1
zC!_HS4K6<-YSi{y8G?vB8GG!}gK7yK`5V_TVKEUyA&Mi5YIX=E-o}@9vj%G9Y6Kij
za2@o#)7K|xT^S5{l0M);Hi(D)E^L#m;r;dRLG;G&y>M3sCa3Nw{c8b0=R9O*q<~{N
z!y5^1-3_v<KsFCup<vWd_)t)22A<^mWyc$gh=vW}Z75P}+68sJhouSno&*#sJLsE?
zPrhC;fh|lTH!U-n1PO7}fu+CdkOOFb2Gkkp%&`nY?=noX39cu@pN%&#Ok5R)<vom^
zP?d+C@h>Zm!fi>HPFDmW+$F~MxDW=5JB-C?9&xec)CDYdjKy!)xZ2qr+`#1xmcL;S
zt;*_9>c~1wYy!@7=tStutAn%Ew@TsWgqx)`!nDPx-m5#6Mq7{HHoPc|(>9^n$q(xQ
z^xj370ZJmRE2;Yu`2*5Lp(g4@XZQ8t-p_lxj4+4#C(!>%<X^&(k0&Ix^Dd5V!Yq!Z
zo$y-4B^*kU3#4J_qMkPOWeru#{85<nO*Le6*l`leO){;M**Shwv8CNPydb*3k==KX
z&N?SY`v*Vm?4L>)0vyLtd=(@WjR6C39Y$t6Z%%&PMUG?ByN`b!u_lOtmjI`Fb6r<w
z2CklWynnLW{LxaT*8aNJKk1?96-cuuupe__VBv%tWA0gxors8nQQau)#Y0W_=w9c|
z&Wj&AKb*bVJKA}*XG6vw`WrMbzcCstT+lwIwjSYik_3JSGCm>F1HA@G5+|KR5!@nR
zdgpixnzledkS_eUcoah0yFdT@^7YQE6S_|$@+FsWM@MosC*Y2P3x5bZED8;P*V|24
zZU!sP1_54xE*9jNk3gvev+S}X|84rmRbYe3_xM&=`IRca)5N>-lSrZ8?>=nyz>qfs
zFg_|lvgU&(Xxhh2GaKU7V+af|GQE7H8|ETr3m{;OZ(yOt!FPyCXc!mfL&uX7SfUY<
z2q3@Xxelux*u7gDPiUO`uaDN-4wm&slVCWEg2YTl!g&k_%}b>2#mO08Ti%=IB30pm
zZnf;xfij2C&`5GWq(o<u0Ar5EiQ%PaU$_S&l4e4YQmU<@G~+!qaBm6bC8P0xXgoom
zR`+fL@8>Bk9II!!!&Dz^oFty!DN@XqdYtj06!6Zmw+H1C^w5rhD^GihNtf&~oRuEO
z<qoTOe5&AXPxwxn*fKhgDdz~$SYj{5XU?mID=<EZwSI%K(t$1Q*V(*`kq?kMfP)K8
zP{m2~VVhfA73N;_&;*TczcKYn$+6D+1;o73m}oUhMT*Z9Cf6GeF>-8hJq8X{hj!<K
zUNX>eY&wwke7d(GX#xj_m08`-3q;Y|QzrDdbQb`J;-HQNjl9FdHy|@bePQ)*aLAui
zjjKP-!}P)+yk^Ep@`DW)a;laAOMYTL;L~w?PJ$VT$MkN3+V@h@mm3aqv#Tb60rcpz
z#YY(~<!TH1n>YpxN93UC(854`)y)ux2W&i|Iudgh(13oUfgauv4is5)K#Bh2V?QMK
zdAicV8w^A~s0o<cgdXt32mXR@BqS>m9q=Wh0ydZ4q{swfyn7~KxH7__@Ufow={r+i
zgb>m^0yf~0m!Ys|jl{=jeZ7+Y=$xTg1uQ*X`8O#|7HvBMRzL_`DK`rXk`4IFc>=<S
z7FOe+yL)}g$1))bO_nW@x~O7`NNHTSbC^SV0V~3Ya>U?fuD{<88MD+#E`s4Wg)NI0
zg+hPezz8r{LaNBck8h}<8C2sX+ViONHyFD~&J;eqry!l8yc9J$%tVS51K29bBItuq
zkOIqoQHr^gV=4pb;H|>6<n1U-6Q4`VX~2E*&2>g0{nKECB#aDi!roh;*J435b=&O5
z5zvQ>`Di}Q3F2}QEgmv(o`E0*<MRU2Rh4pfYBrQcNu{{#43mix{cY5@_Gbw`!l=@C
z$jXlFDpu=@$9u|mxQLc2TsN&=o+4LsS+;QST&wPClmt{{#4t@KqRx|ZWEfmx`U2?L
z)~eK>Xx0e^(8s(#Ol?Tn#5<Bb5b^5SJ3R4zu7=!?zRZ|eN34gpoc(}VSAZRFJ0hgz
z0)Y>pzADj72w$ZVNO3^&N!E|ABAIK+roi?hwb}H+{7|-Pf@c+Mm5gt@N#P`g@V8oK
zkj1s&{`&ZgWR>#1#xaF3Au2J6x}xChC8Q4PPZGX+$8aiqyit%fL<5=Q+aMUTWS#lx
z1(p`9fi+`N2Io1zlQX3#c~o|gI+95l#A-%rE1HbDxRcIBO{CjG*6AXEZAJzUfbEw|
z9K$L|YHN;e9A_zJ)bcokq9PC|ApG9<^PJHScrFLP!Xs7iDCHC@nt~)PQU~se6hX8q
zfZlAq2eYL~7I34KHZcG5*Dm^9Pg>tuZ6|{Xt3Ss$dYZhDEyOWu>t-?xqVOut&xGo0
z4V2DKM=57$xo~bl)ug(>K~rRU<m*v~O8CHNp+Q;>du5J7j2dUSp^hh6Gd^$9p=?Q<
z7L&h-#xKaP1MJ9@hm8uJ*o4jqFWE&&|5B=2rNaV4LAwEOU&OtMKD3@_?nJ9#rz@=R
ziKeNf;a^*6d9}YyV0*Pl!T-o8_&KnbRz5RDR0@115DiZeNM?(PHg?k<()A#UCxZ)A
z?o;~Xn{h#tOvN#)GKda7s_Rx9>dUh`8x#4XP2PMKO(NQAN^Px}uZEMSNV3@}+5v1j
zw!xAN#pYqHdpAX`ALjjp^-L0sswB;Mm+^2iD$&FpMtsSUkUepK2qH0>gpm+0hR1O9
zghK=X&x$fakkT1ZTh6>1GLAGJJRPi5N5!33S3;SX_R#2aw42!(>6R{@pebIFE8rP3
zOf}t)3Dk58;(I+<Q?&T8?i)~nK=%}-DrM1YWNF`KqOI&yQ4kUh?EwRd*`Fd90(A10
zlmE$V9<Z8|j!#<!jS?uS;!;jC1>>ct@^z8gQMpWRHWQL?&0P*Phl+toW|9mkGd1rD
zcs@W!%BsyI&)84XiTvu|j11|-z$g_@GPz`7YcXF=L%H;$Ns{rMYX?|D;@|k`Tap3&
zVXCQ8@q&P;FwuJ&y&M~<u8CS}(QB|M=J%01<9wcY#{$2Y=vL5i*0l)vo*{FyObUId
zC7}Z?rOCq<EB4^-JQ=(w4KQUQne5R4<@f%W05e^|ZHuA_&J0ptvxFP;0R@EZBtcup
zFe95kUeipDWuphTJ-rN-mE#5ZL~$$-A%ml<vK3+JbqcEALq1#pD<ixuGIpD+VV$HP
zMrk2L21g`OLK~H~d<4|9iHu;aU2j0!O}(#qY{(c9`$<A?@d}!Z*l6C&PsPgo4Yr@I
z6kPX$aVAM@lD8~7@oucRYLK~(t<lLECP9vCG~7F{+bFx%@#v5!(V<}|v0{i*+1S#0
zaU6RQxwpYsBDz@f#hgZm^{APgw(XUz$8}ML;E#1&>$ef|v7!-FB9Vu5elpH1jU4mQ
z_C`?yAQdYgUKfF>(U-eOT%(%N^x?xgb_|dwNjK3MOKAvJed|Iq*9g9$hMeKZLA{0t
zHL$j=b?c-)BVtAN1-SP@yg}E(h%!vbT_g8nqR$y^s|Zgd<gXV!Eu}8?E+*02bct3s
zr_RggFjATX(k<cGo6-ujw<HYzl2$B=Q3YBg17oc;%dmzNPzkuH;QSoU;gn4zvI}D&
z0nO<HH3?Q$R*Xq7nnd6wJJV*Zi&EB}z^ipp`A!}uZv%qGA`2hHz4T((CD05}Q*l(a
zg2!lR!eMvrCk;uih{PXSiHQbGBBj|npCmL2$3g)YYL{)0aeb8iv4m-i@UAvePf<}Z
zMplHZevMTzBGcPc68S=V%E}mu6=}M<;zR?8E>f!tINqba=uFXy8MUB*U83QY#D5|?
z%T>Y{+Cm*Zh{5F6)G#*EBfoce!rlA?az%VaY|0KS4K{|9mDiCqJ2^WUJlc`(>LD^A
z%tf5j>g1W$0jxzwjaHB}caP3QIVc2qTg!1hAjD~4c+<$2!-S7hbr~*{1aGbIrujl`
zT_kTnztmCJY(C>Q6cv_`+C{Q%*)d$jP4o;<x-3|&Nkqp`AGXzv7A=ohkVG?tQ0FbA
zrl}lsJ(|3GhkucC!)(lC7sM(i^cCPvtOfwsA=zFmvh_kAc36OJjC_yv@_28r4&3|*
z4OM!UWlI_WrRo>k1A(UJCw(UCEccSRz9Nw1Z-*Qu>Z|2=VypEghAa`XNyZ=%>WqA{
zc~RiADeu0P?^*qaT30{<;K)rzM;;}6kpXub%I^XdcW|bO8gW=$T<0=I20<X4#)!3c
z=?!e1BnC-_=gm?`KOq~Q!a`PSg6UMH15|r8G}JW~#)c=V=3V+p7-TnmF$n0D;>zHN
z&@zbakPsjIK@`*Ztd#hxc<8fnS*79zN3i?wA?h<$foBXd<x7Y{M@X&(X^GBFUuydi
zt7?f`Ri6BsC#R6G1|9G;q7>YPyC1|6!6f3>aadK+Pk9M?N~|Z}^*-w)xvd;CREV)!
zcF$Oh_{w=`d84zjjFpa5ch9?shOnCJ$X+blgr=-}v{|sU7RZZ^b%b7)D?wZeqf1o#
z<ucrI$&~$C2^ljsauLzO<;<$hp{&d_9n2%s&|(}0_4WRCa(IAhknu!kUDf6^Iu9&s
z)UuRrP|Og5>yRdp>xSgIWD=BuM7SS0ai6Ma=xPy&#Scc^px?J0XjtJZDURiyA^sgk
z`5+b3N6c1-MvoPpS_+zJ*RfMZZ1HQiZJ{Jwa1D1qxnoVT3y^W^N*7eHmsvFCF9wyY
zhb%f-575zPJn0xYfgew6_&rgz1|2#dIz;w5qtq&pN20~NEs~LB`h|D0feO#3_F699
z*)P*M8c0`w+EFX%(C?Dlwfj063e)O7mZw~^P>HFcJY(yl0(4j2N0X5<d1~Nyvhaj|
zv~Ax9rv;_@d=Hq?C^Xl=lca$cD%l4<MLmyth{xP|Iu4@_$lUbf$`7*!UiRac4j!qE
zEYAF)^&8*v2>WS68l?8FKz8b+fbzWycYsz1?5Th+l%C*qRZ!X1n3`!If7VdkJkAvO
z$|#$22=7@>*ocJlX|UR`vNm7^eEA)ki4ZYT?2rDU4g<f;u1V|luU`s<zcL$%d>QrS
zuUI<L#8lDJwnBq|B+oWfv>d#iZm7#@2D<vi3nwF150xs1<K9aRK@qditgYyv#^X!k
z^WrR9Ky{m|6hE1*xD=Xi^FI2@4~?~fcTg7FA(Lo2Vtt9;fO^CPeG^IJiH7@V9i}u!
zsfgTD?qZztUGZwfj`X1Ih;%)+2upktMOMi1dW&;d6dfi5KSG5?-oPg{f<E?^drfSA
z!x5}}rVLv3P*6OG8*>(G*9qn!i6u+AAuI&B8^9q>&KB63S`?KJK^raQ#-q*Iocn+7
z@hTK+Z)IMBHpi%^BEVUe;TTKUy9qF;6y9fq+3?1MJgFDX{Fkt9V*h~MP(!5q=?#7M
z(2WNH!e^Ux<LQXfJ4C9IT~>6fD8v`~Ig2=oN8sfyzD2qr29~uRctPHz%P&?C$W1C)
zJEU{mlar1N*)kHTM3-Gi970^0h|i+D?U87p#2;BCr6SYj96Ttws_COQc7WdUB--o@
zQ&eNb3Lm8}_Aw{XQ7%N(3<-6}28JDI3fFOzlu;~U_zGeer?_j$qMc1zTP<(rXrIzG
zl5vFaYs?FaoT#;;D5Dbjlq4F+t5WNZl&P^taFZ`b)YYf*0wA3Yh`&ID6pwguGe*W&
zJh_Q~6gNW!0wuEKN9GuQm0BF^DYY8L08n-%30;Vybfbm<Tk<0A>l;g!aJ4hd4RG^h
z=0x?x*c_LMBwyCl+V9j|;FS>Sv7e9z%v!^s+;&FUe7`V8w%o3NgWy1WBDREO)snko
zu;Lrm2?lJ4m0pldsoVx*fHq3QZpmSJxf0vpjX;hBF%X6b)3%ErRu+$&L)7ERxCj@u
z0S#(qk>|%-7qw&_88C327==MNF@v6-x7+he(KpiO;){b};GcWJP<bS=EaE3B3WHET
z8lx(u&PUp8)Eg{530>N9PEp_}2*i4&YH_5k{7Cl)5t4Hl9mg>sdot1uDFXmDKd;%w
z@|tMW%bLZltEm8DHDX;YmY57zaq_lqX?@|m1xSr>*ED3N7#Ip|!I@xa)Q<ZTvauNl
z5wM)SaGJH(u1gLKfZc@_ZJD21wA=vIT=4<=G!ap)o1i}5>ktwb-l6U=iQ!OU8=(}p
zAX0LraM1&Ren&uT&W#(F8jyshU|oh85-LQRIM^~B-3d2#W6wtIWQhzFq47m1!9U!?
zj&ww##ZW{eRc2QDVnm(eVrwhSo0|dlI=q1+IttLvE>x!o>in*eo1?>p)nYiJzFg;A
zNhp;xp5PS|^sAi@lVE_DXrF=hv|kfr7ok;Pf1-^JWy)eO%oc5Y+PpIx$k^TSX0!Pr
zwA&?CEy9~}O)z*xkeRHomUfQ*RH=dy7DD~TF&r;9wzVfk8#%|I(e|~iu)U(&HAaSx
zD)k)J3dD&q-Ufzzfdp;9QP%Jzu@+{<iR7j)g+q*OqwrqPx~UW!0GBH>Iw*23)CN|t
zMSqV`gH*VMVk>Ej8A1%XnxX(kHiaSDB|lLeamDn_k`ItLyorF50J+cTM)fT!K*Q7)
zRXa{%F@5O>h<b^C#ec$eL6HQK&VAo>3nR7&Cr(-2G}Db##8%=!omV4ty<qf1Co}-0
zeKTE#*<zAJC@MUQt<5eeYN^nO|C*!Run00;h)rag;Uy=JuP&%`Z%87VL{gfl7#Yv5
z0hIBkIVxeB3nT6Ip!p&4n==QDWCi{~tEj;oFyJlZ)$~P4_r_A%6(t90;75Nr0H(0-
zc%GD$`(xsxjEZc~jFLbb-^H_w-9}R>R%<*(_Zg!|?%6PPA6&{LEj8nC&>=*(wV9~M
zaf^^jp@S!h^_(>fmZAwC8u&O0Qv!wcB)d@KH(JNCer%Oyt~c|FCQzoWtWc4r)m^0(
z{TQt#suRnUny72cbpnqn)S1x*%i-=*eppe3=!=>L>ydiwSX8N}Dw$-VP+_`-659Ry
zJ)Q|czoFD8)w;gh>IP9<UwN<FZB**i=Fu*)(l?+#c<~H>t5tdUb`Cw>)J9}2=V(Ss
zekifRR9Y~lsa8h>-DU=K3k330I2f?#icXLCh?E&fWmG|AlxUzn3W0;6t*Ce)yfNA<
zA;YJwKQ8^^Wg7X`Q2J{t_A4E&C_z-D-OlCLuAAYE6AmSZYW9q**v}JcE5z6Z<Zhp{
z$k|xI01CC2K{uHo7utTDx1SAD>waF@K9Efz^Q)pH=v_#hyhO#R%h`xPduWkClC!Y_
z$+Lqnz8`?ayF%-lKHK|9Ep&5Bd@Tqpdd97cQkGMw3}Y&U9)j^?*k>clo<E`JZo{GC
z&q;fP+#M@FERI<&QPKY2GB>KQ<|y96DGLPU*R75oGApFG5_E}=eC;Seo+wO5slFF4
zj~HQrv4}!!Sxl#(9Z1m_=RnUWM2hzY+PrwJwUt(zni>o-^u}bQj!PqHE$^~duA??E
zT&BDwD^=u>*)n=~(~#IDp11e&>G4iS%Bh$duw|~;6-!0yC0%m!CpJD-_N8dEPN;%n
z67cBMpu8-)u#0J^_tzwj{Hu$&Ub6SmH1oyDiC0UzWUR+~zwY`niN;mo0?Ako=J%C9
z*v88G%35JD#G`?>o|tJ^qU8i5Fp37ta!*(NIu3@^Non`c^_p~DustP}J<CIA!kVNg
z!86o2&PG9{8(yy}1-a5d=9F!>1j||pSa4{H-NK9cCOcK*UA)APwk~38bu|7?Zx5BS
z1)-P#6JySIhvkNraaJYL#!qCoJ8Q=x1r^KrhFCiQ#r8AtVI&z$lpLroWOEHzLpgzv
zmb?v;C>X-YqHMg30XV95Sr0^~l&E$2a3V30PeY1L6i0N`uP{P+36R0RpDAe=It&wK
zhQWj6$rqPnD!|H?LNUU)Ax2{r*a4?#BoV~HX51ZyYzAtm>p40A7}NfF7tcjVAQBtx
z$3Tci;#-D#C-TphrNOoAZEdhJMA0D{CYcW^qB-e?**iHxH}D935%dC*_t~y>t6qIz
zSZ2GH@%3_ZxjDoxny{Kl9I|rTikpyAm0(K@IRzketHmQO@2KC<W+-^sM|XCjzM}J!
zkq^z>VM&{#I3qb9<Dia0@d}WN*t)WF&JV?&%8Q^If*@}P9$~lMiy-w!#d|sf8Xfs2
zLF8i%O6r=lvCSZG$*^z<8cwn4Q;MCx4Q?d#I($O*5)XtqKz!wUJJ!>>${PEoiPcSG
zx~+k!5Bp-9qpqX{_p~jl=$-W4j91gvpw8`_#i@w`29-*whrWs!UbjSg70Rp(AKUeu
zHI<rzwuZ!6Ym+L18yz|#n?VhZ?GJn(y^R7D%f#;YjSuVsUS6=vqWCH~^aK@5LQlwO
zTmePJPv8|W?(NKdQ0EWQ3Zm)Imb@;h<T$sER_i#Gz_|TEV6Nhj6TOUwm*T#e1S7l`
zqFYHOmBW&I*V|GSY6;Hd0UUJ~zN3FY#R~b_a)1`}Cea>}#A4Eh6KXFKr!mO0T@mIO
zR;z^g8U>=yF7IeqOV-jR5<m)scf{OuoOUMBxgRDS<|rcO8}%WWzVqLX0vH^*5-!u>
z+wy7$Xmo%y@R3CWOBT*&2fV@^JbGH)kqa}<f~6aXuPr6&7$CvU(Y~0G^Yy$<y(FZJ
zF&x(vWy0cG6K_$oI35D~9^xGYv9Lnu9-xogI4ufV>v&3N2yIvpnj&WrkyiH&Y|{>7
z4JA;XzN!@S^+hjt$)`mvKn%Wvrz=SmycFY)s#W47@M=>_Zi}A7!r+zZ&UpM|a09*8
z5Q?V>2yUsjyKjz0f-d@j*QW?eOMhGPYRCiDHO%R5tH=eGo-(_Mf1`r}Ia)uP^)EkM
zR!P6#_s6`ufc=Qn(XPF0$0|~L;`aej>8=y+7=@e_OjD;5D6y3=M+=2h!<#{7_9P~W
zh>PI}`7J}!FxZA2tp&|kt*DH{8x;v6w~K&6C+rBHj}37fDx!$n==bqPE4QtP_~tb<
zk@8nS_H{zB7OFh&`|29+Mr_fitLo`)+mYRbV%DwuD3X1KbgnC#46-(`{I*z#)V^E7
z28+=L-nEtTtVp|?92>`4Nwf+uC_<Ojh$pE7vv}Z7A~_f4ZkDslWnOJOoH)L61o3*w
zrD*E%w*`PZf_TOrv_5;bRLRn|%e~gx+Y|vrG<Vx!c?_OLv8>jvH+}DSWb~0~r)%sB
zH)N@5w4%>^cnCZhH1~4LBcd&se3|+%06(oj=Gz*Z*}-g>FLrK2-veq!4YF}1Gn@}t
zz;f!(&xSX8oFH$-9v#|A7tO?i^no(BBOd<>i50S^66w_T>dbOH4GsJ)61=w<gW;zO
z^o%Tl0@7~nNJ<JNx!++YAX|+@MT=Ub3S1|du3z-MGhXg!k3n{ZoJ??4WfinGxUB-x
z{_^>)9$?JZp!BBIrG_FQP%IQ!2{}NgQoPfX7jU3uWY47sUeo@;WvV36A4+@`>JzzU
zbOg7&&Zb-DaOZMDlD~yG{)&Qt79}?Y*J>~6Q3Nm%6DizNQ}K0b2sPS4s_3#PES3u{
zoVcA@;==iOI+y1jssd}aN3y4@lC}IX2@~hA<h5qCXj%yLQe(ZLeJxv`Au;2i2FUG<
zg801e-_+{1hh&uEiw;Lw5cb2NZdhH@LR(>sW*MAUhr_b+RT(ds?9;0Dj8E~8Z;D82
z^-_K`jk6A#9yR6Cf~a1TmEt5;C3ff_ELnEEl8(&HRYR^=*O>}^5V;MpY$dV63)msC
zwp;C)dJvMkt+20n$uH`1wX@OaDMe+zHcP=v8FsxAbv_fjNSS5WvK%SX)D?}UB&Ccc
zS<(<oqYS;pcsIx8=(omQs<J)TC#ay7Db!P@&#pVRMCx+fu|cRo;$|BeIlO2I1Dp@z
zmga1C>_Be3O|_XO99C6KhdK^(JM9Eo@kbapn?qQU@vgC?%ti0AYdSH&+`7&l`(@PV
zH`4xZ922obT6m#O5OHwK9S9QT1kN$-M~-Bb>l9Z;?ke8w9CZ#3kM~aYj(^-U+7xK)
zmx}<%72?BhRzsA8i==sDsl)_LogWj75Rd^|lDW|U)k$ZE7MLz<uwvCP-;P?rTx!xi
zfV#;n!XG9CjSNt(&4~Aq$Pjp5bcA@4>D0O8HvHa$1L08-Vibd(*fw-xLxX<FVB~1G
zDJmtM=t<la_k|)+Y2lHBL}fiMHRq!HXhy(sL&dv3w1N&Xnu`kggLcM)3-JR4d7p@H
zNLf*Jz<8Yb)&^+<)ahCQd=7IFVK|x;<uvPD;kG;J`Gli@q!;0N#@CB<qf8cEBV06A
zGNMy1am$j85d-YkE#*AIEKnwxCR<|zA3={iUTUh6BS3;Lfy7M0Q41y2Wr=c)Aoo$a
zlBSbS%rmJE36xVW<9K|PPZVd3c_Ma>-zZT}DOZ$AsSp*55MN7re6t0-?OS76u5P#_
zs2MH4Jn^mqG0e2X;BY`kBLLc=MJ2ol0X}yaUWucJ3V(z^;7vXCqKo&VK0z@MDH(4P
zJ)6ekxp!f7Zyd7g_evzTeG=$tSab_jL8pzM0^MP(lIF;AtLE^?K(=ot=`a{i-d@;Y
ztDWsbRV6NyaBB!&pip!g^J`#R*!RdfRTx2Hj^<RtE40c?53J2SB{xTGA8>q29OC_c
z8gm#dpg0_43J?c314g+s4pP=7hr0aK8T#Cu92Ajb9K@((Lq?lIEi8JDX+VRvPGm(9
z&14s&q(sUcibaDNOb~8Jk%$zDMI<y=OM~)UCv~~o6Qg1o$VDtfRj^UK=}F12=o>(S
ztTLo3i*CxKgc2P0d8k?wCBwBQhWbPaKf+d|nAJpks<Yu7`qKA94rGjBOA(?&6*L3G
z0-$%VFD6tR?n9LE5-Dw3hzwghR2itCfjVvfcT`(jSV3dtyB4v)*g4vl;42ofqVU^f
z>#ovPut$r;owqDWg`89mf?{vcA&%Co6h086NO8o0F0vyM{wWqqeRTn=?Lbx-8Zuz*
zl~QIeIK@(rUX?#BF}a&<o0cnKX_|US=hMfJ3Qpx>poARnR8F3qGkm3V;5#Y_5P(-D
zCJtg=QAO*A_-wYa9H|)nh9cH8zbc$tabQmgq)#|JN5f<r)f$k|gw#nR<%Z7XIf)0d
zSnN^7F^!a!P-(D+6Ys|mV*~?RJn2Ja$_L=+t}BT#sXmt#lWS{-k;yzqU7L;*CwZ{>
zG*r1<7zn1CMCu`33vvEOr^he$U%u?T+4)&)l;|4Vjc~~PAnPyC$$+>cH3CL`a`iJZ
zqTwr$atzpDHBjC=eQcW1iR^w{VZ;uXO8kYkQqU<*3O07K(>Z^QnQvi1*bL70_e%UL
z`^2xZC050oO%?%Z(#<9efdX)zOV~p;yAvCEXf7jOWe)kQT<{U68H)U*7>nX%g|j*M
z)a7`0oO71q3i7pIss*z?b0c#7pj^Zh4i_ST+srM_m3=#zw*|&fhdkxyarbvR0uuJZ
zK<;o~EG8w^wOD`!eYtuP4&2h`YhG5FEa>=O#@EsqylIag<r;|OfQ$qHB>>j|mDX0;
ze<{)7o&=ZyBokExJBG6qtVox8>0*NBCzFT@3fXcaQWx~Z$V_YHmGO|`n`_({$X#;M
zdTjWQ3HGS3n$##4wPlYzQUMC99YV?8)|0$I05khwEYc_r-S2^THkPxtT8pGeFXBNz
z@r|DdfrZb=F}rV)8f#eE#GGCtMEz{OcM?ftGn-uCZtrAsNXU*sw<{?-YBo)dOHBKW
zaP&5~A;umhsaoB@Wg;fUFdH`P)UuC4<dwoXnoo}6<_ka?n)o-giJT1t^CJ>K!jcx1
zlz`JvG2%Qqe3d5_JGdc@LD5s)#+BKDu#1Igyp%L(-BwL>SaEe|iWWkbq3+dTz?`yY
zu0xUk90XaagP$_vEVSM_gFH!_EZbg1s?7JMdoou<Mj=pQYak2J1x9(0*y4}T%cAO;
zqLl$!i+#c@9dpU{-M2)|OcWPn;vB`olcJ=m5@<PxuTJWvM$XJPVj(B$rbCb&@7R#0
zfL|^#!Xc90>Xa{REm6@qSri`OjCbP{WESrTXi(a_2rtVH(-(2{Ak)fO49uZ<Ib2ZG
zx=*x~p<z~vS+icSB_4{LmUX^dy_8Vb((CB={WNVj-Wd(U$Tr5Jl^fIR58D3PGNz-z
zP`x};M}q6x%7#}vgbj+89Bnq`*qjk^T7o=z*P5AgsLnww_kGsI0<_20>m)hE9%b+(
zJtBJc`JB#C%-C3(aq=n}$!?6!htL`s${QJyE!^l1$(IZdOMSYT43@Mhy+SwUc3IA1
z850^zFMzNR9jH=_sp+n)tTZTW+2QWbo&VfBKE!UxZJJbP$nTs_u#?1RtqTcPl$@l*
zNXs+1;5ip2P_cM~Gf(A!z`%#+=i)ZFW(@Bt?Mw^Vjf~muidyw`uLkFE#uhv?*Ile>
zl<5wjCJFKe0Vs%ut7{_Y-5Qp44NTt#VfQ9uhvae?lCJA+@VLc@ilZThz#7ORo4DXI
zg6Q@xlq{>ObXHiRi*2Or8`~#2fcPj-p5Ai1hAAhrUUuC<rFSRH@FI>6PGrpK{35Fj
zORJ?r15#vPTpkwwEFYne6VN1?0>w|LT#;LQ-w|KBzK*-;1P&<+eO|DZJUBXi?bS%l
z{vh?n%D%>p*j?Ay*><qAH3K_Mx&q0pF&U(u9wRApY|N~}$xu*$(|dA~DTXooACEZV
zdc=w%@*n0zR4ggvkrF7O*&n1$5eH=S-R$|C=7?1KWXmZLW=wrHKu{Es=R2Z&UYM%s
zhGiZVWMqgT?w~R00k0m+yppPUNeUt5NGC>KK(<*GsrC0VHFZpfY%q&^B8Q-?^+h)?
z6d<`1GD*sGRE2UJVkVgHlaLWM0cMyhv=LDSW5nH{F{Wi>OlvcbF{mEPqm9~x$kUP+
z10~`DUg)jX2P5Y;;(W1qIcsZJ<(8i#$w;`2eh`eUMOU2j3P<8~;_y;?8L9dS4I5TH
z)M{kptbgI_IPThn8O|1RA5e~ha^UL_yl52c>%^r8aV9hMF(HXi8CKf5+d|r~B2Hn-
z1WwA)*Fhdq5-wE~Ccb&1gUL_rOvQ^T(zu~UI-Igxd*jK^ZXYJ25AzMAVy`lOl$3@{
zBeke3`Ex{^G{h24&6<ux&X<^>2?1_&6J?hr)+s@8Q9~6Mv>_R6eHG+|^%N8`nF9VG
zO5_GYCIL7U6@)&OJE}A{6>5u91-Qx-XB+d@;`K_E+{*SI>SAq7W~JowVlw5hZ=p+e
zkw*{wgw@`f5Ai+B@I~wyZCgzT5{0L$24jn^G@|M0Q<g6(H>%aEC@&fj<(vU@_%>cN
zbzy~BzeGGE4p195%fZ9YC67roKQot0Mj#@-y2HWkL>dwXhSv;)xDM_+1~Dbv%QGCS
zP97`C#E=v7&^4fh(lM%t5N0%sL~8k*wg<@hH<F0_DvG=cyO-Iw<H$5TWC~z}DNK=y
zO3~fdJ0~Zm6~;SGl!VUkWR;-O9NJ2g^db>!LdSL{r<SJuJM3HBi=*0*9OX81V@`9?
zHLzATR?8Lzq~+DdRz=~Q2XAC@BvR^*Qw6X`wIhqz2HeO@qair9xKtV#V98FrU20f_
zpjYx@$!n%^D6>q$6vNYFa(SX}S0P>mV(3iLJ@Zxth-9J(^q6HL9%_tNVIC2W)T<fW
zC_Q-cgr@g;#B~d>(qNDLhvm}P34^2(FlZeHyBZTw77>hZ$%(p3b7?T3Ramj69|~?*
z<f)t`i0J}ZRb{<c6tF3%uEZHoaVt(D6x=EA2$>gHwp*7v=YfhK?}=ia1`OK|Pp4R-
z6Y0Br%T9nrFVcqjQC`)<1`Mc;qxg1k$Rn>VsW?b0&DZWQUYWb-&h(+Kt{|kj{Mhwv
z1QI{x4{2wf7Y(8V=Ig>KFeZmwQXOJqbA$(rD{%!&E5p(Ha?Z3w#t3#-?#y%^AbO0+
zfTX>ChgIY{HxQOGq0^|iG6$dvy8H@;%EI#~GfZxS6fAIJ@@4U`PsgV*g7CE6NP}fj
zeA_eb@pN{L@u~~4n=?poY;cQJwc?A~yO^~;81qcowM4;yFH@Nd6hRZX(ijOVnf4Ne
zMKu{NK&ni&Jrxd!VxXZpr1r*Qb9Iy&#C?%=yS9Hzy#WaqLN*^ubAJz?tF<`}C}0tV
zM(?mi3P_s$j%9;PSNL-8o864bTk<3Z_CD0egcm@6+hakuv-|VUozowV4}Vfz?+9(i
zf#0{zc0%SDTXRBH$@l=?Juxolvy{fc?k$4yd^<)EWVSMtjD*sJvQuAGUsf(SMyC1!
zy<)_C6ns{kC4&tx83~)a3T($J5L|?`<yh$$?bBY7;AbnT>c8}QR{GhM1k7HiLteF)
z-%-q15QA<wGl4wc+URt+FVYHPd#_)0{&BW*aC)X`9vP-(#JiI!tSdq0GnFhTEf}e3
zIcLqQ?Mw!Eo!fep7ji7?Om1a_CLeU0!Mbsj2@3Wmm=coZ0giS+dNF<T`a7SyBe9!M
z^5r`Tp)iSb0K10m4HKHsgF8d9PovQ=qo3x6Ax9G&{p!@#SHVmJ8|=#s&Gjau$&fdt
zh*BuRnQN^ILyQ9zfXi0HAVB1-?gpG>J0-&x-=w_d=ye&_69zaUC(-AI7tPp_my)MW
z>_7=@$j=Y@@uWM{ks$PihFoK7w8Pn}<Gnh#mNC55hm(?OT$|fQ?l-lR+D}QpKN*>5
z7sUWwO8ecg{I|M+PT!SXp>ZUq?2h`@^qE0quRJ7x`<yUH5!|2RL{i+@vZHXI`r2*C
z&c#S@%Q;bXo@tlezD{{;EsUR_awu?DN2ggyD0`u1m&O$S?*b*GNWw<PaJXrDupgDh
zEM~p+C=_PAz4jN$H9XWY5=qUYZv9nvf+;oFD0n}u4H^iUkOD9&%0iI^ZR<IVVgru_
zb)4fw)Z;hsSf`(&NXX~s#5dy2H~ij&k%gsG&;*Z;FL!p@OT3E?;t0wTFcXNG^M$<$
z6j$+#bhZ(@(tFEiao*Qn2j7)MX+ngSB%B>9-If~q!TE5KUMv~BRnO(f*9@@^KBU5e
z0D%f9iw$`eVk_G0No^vf0Y2T`+5KU!mi1UfbRTyP4iEMyRk_LoWf{2a9PP8PCw=qI
z$+TRj?F=XqqcQ1UEJjHbzdl#OXxNFgN%$0&M$TjwnOBvoOinzZ$d*>yT|cFyxXR$)
z7A#m3$xns@;o@i=IFACoK%ON3jM-RKpKQNKAwoqIlaK0StVlIVUzznSwyoE=9HmT*
zNlP?unyiJ+tt*9|G-=^PioAuCsPDRS_X4tK*jtRvIY`Ja2D+4Z%bMr%Q>`=xSr?^2
z;`=xbZe|VKvIA5`6PaR0`50q27|eH-qPyl45cs616lE<Y<nxDuThyF{%fc>?Me~4y
zz40PZ<efHedGI!+a_-~Gmlu)9XiF*-a#gXu6r=rFRY)mImo&R7ltBfuBHb@Xc{Mnb
zUq;JO#-3s>NFPqAJVM{JxmZEr=9sx%x__(E8WLt-&8lM}(Jd7L=LUvS#NGjvaU*(w
zAv_+SE$w6!Re8%xt|Q|SIi|dNnO0%O_&~WBqva40IJvga`^hu;C^;&wA-3ke#xk$d
z16^WxGCrZ8yF{UhSO<mwIo`lz?@SZ|=^MUc98=1ehMkia&A%<1(Nrv<Ft#^QYqx22
zlW$=lviOs<5Z>EBSVz=jIsjHcslO)KG!-m$=&~^4xK%`B$PE2LNRROr_N|-KK5wrJ
zyqSo#_cW{2N!@MPw@8+5JuI!HH&~(7;7On|df9BRprfj&4v^|llN@Q%J}Roq8q!m8
zc38cu{5DH@M?MQ7y$O0mGS8>{_r@1DsVL-C6LyefW8JGsuIb*89>q0~0)C3Awt$Q$
zT^6lWQ=?*x&#CZoOICr3j$-n|DuAifN;-=N=)j0|sTQAhl7u^sR^#(??HHZJfMX-E
zr*aTI?JF)zb*67L*q5lE&rWb^!jn^%j(I)7SU0J{m(XpiPf-?q_o7L4N)iE+5#q1O
z1pjr5eZ)yqXl(+~8;U|m?$somWkK&@F$R|X6ptKZqmil$z<E#F@xCu<<XJgO<m;O(
zbA6&t?B^k>n3V`{Gq}=e%U*ya5JxYEH_uOA$fNM^M7|vYKVqKaujBob-PJg0y{)*$
zd*g?k7MXDx<E5%7gN*;LkI!67YUeFmipqxLgq+YsQxqSppQYog#9U2M-lB00=_%-h
zuq|<m+e~GjXVzR3zpIOQ7^o;xl2|3E-mDmS2n3CQ5(ruGOE@VGGiiJk3KWJdH*yS!
zbMMs9(wF$iu{wnFgoH>vxM5%L5#3H1D2wa|idUH0Z&}?!`eT{Nl{uc+W;2&q+{x@B
zVwDOSrY>tFuPg#s9Pj$1UgZ&xNhX^;p#IdDJ+mn$1?06ZQyq<JKBo|aauVfp2(h@G
zFoH>pneu!?mdUpk%^f8H%B?W|8j0tq_kxXMG9}f`_$Ac83Ll2qO)Vhd)f0-x<hZ1%
z+Oe|w(yxMI$Q=rkPX=&w5u(g7==x7Qeh}Z7Nk<DF3bx^_8d=Vp!AnFnO2Ddzr(w%l
z9@!HqU%(p8ln%{4!`h0W2Y8T#Twlv1OA=<B?_zZeIic!J*h}JOT;WWuP;HF5wH`S}
z>HD3WP*!Sq!hy3wb|26V_WF8EEA3NEKAy_Z{fx=5E{_-3Y=VHv3J}xL4R9=%A%-@X
zQRc;b_r}#)bWwe=Voj;Pax-IB^qLjLha8>RYm;rH>soKqd)q{&R`O55A<aCdITc*Z
ztc0|nouiymBz+Lbq3qUy_jd^3E7m-a7-j8Hv0J`UsXlyj-_^T81#~t9k+SzTC$S?W
za{RBMdA>Io#@#|zmx9l8U$PLX3n?r0G#nsTkvzy7@~zC5^TC)L>ih(Jol};%K;<MQ
zQ=t?N1)Z(x%1>~Bsb$_EXLnl2d7tvNI2!S=>@=Z%D8_uP{s7@kN$cp^hi+v8E9{%t
z*+}>u*A9fc+~wmDOF6DY<ZI7DgPmNpT0JGF8{JjmMGPg^Wi#uB?Vn248p^%2+2qEa
zejh!vRNSej>|*d{mv8>M6TG+WOOx#47LgMftJd<y2e1jqV~8564N&2Xf$v~v(CB#f
zFGO2rlvU>;?1?37W!z&>?%Ohqxm8=QTMBYk?u(L@E+QolA;r2xpxBP%4&b#$f#S_;
zddO?a>9)yHgp#L=AIXY?n3fz<7WKX;0~sIFDb;At4$>tdUYtKlT_GMGyhO;r0rGwl
z_8SBEujh|HU@~huhe|5_%vqmnejRICOg;QM2goL@uHw*Uch}42w7;-n1{?&PLt6H8
zS49%&(r9x>tj*Q32HrPez$(hSCBmGe_g%@iqv=FHP0d}3BETL#MT<&p!xxh=g251r
zbg7Le@#6|zDcm8`n1WD-<Tvi3+pcjlwPZ(HZnq|`#X1Gz%=a{j%uz@CMWqYTb+?T+
z!M8K<FiSzM5p*F;8<o`~CaxMC$~v}MVVaDkRmwzHgP0d{9mQczv@Kh;5!w^zE4PZF
z2y-o3Co>dzPT5e4Ly@<rezZrjSQ(n55K@&ajZ~1{nkzE#Qx4YaS=m2CAEBzvA1QVn
zlPnlZ3XB9n_A?R+&oUc8<i0dkF+1e*=|`D%<U_MBGExvtd&oGioi*5I6C>WO>7A#f
zn!Ylfby+<Q$%v!U9%R;xw0Wpxwna5thd6$tM<7cQ;ntDOV2WYcNQw1QIlS;_XJ*cs
z3M)B~Y_}<>lo%!fFt==AmU%>L;8KiK0cQhMD&cj<K)Yc<z9GX`WjWA^vf|;yXk|98
z4whNu0Em-y0>z5I@WrA7Ef<zVwX)=i#&RhQFkmq~0-(Tx5d#!zvwUSyEL2SSLg<XG
zW;EwMTaIDCbpT0>ZVxWsk{UbBd_-heiSb0qn|qNkQ^tyrNF5#c6eEzVbJ+AIaH9v}
zvY&WAn_(e#!Ag_;B`!Aw<?Srj>T|<UMocmZ2fRn~ORM@Y?QphJ*EAMm4Y0D9JY?DV
zqKR5ENsj8|z7rV=qhQ-{_lOIpTYK^Eb^?f7%3PEIB}gA~YQm~0vsx8tUO9H?khJ3A
z;i-((4p7*>0A%DQ=BG=tg2+hLF0?x^RuaaTU1uMVjVZ=1zG3{kOgdTJWp7ezgAyeZ
zYK-4oRYcb>r6E>eJhY8N(22jSgb}i1{t=N`Ey(lXd5PC2c?z=LiZ6B3z;b_P*?ux;
zl-EQMvH_=Mv{@)3QJ%env)8YMt)?x_`EP7X#v+NcNO18uP*DRE!5Z{>Q~?k3UMddR
zcA@T#G9Ol;YMw_R?2p2%N%?-7O5K5J3wu4sp&^f|H5I!-@iaQ#DDoB<5EUs!oh1b_
z!0!es0CV3886!?&>h{GRFU!y>;5bhl9paIJv*2uzyz}C1aB5%NTd0wfb?r@q1|vGk
zx?brKGGBv0q%w(8tWB!>7>hK<FoaQfjtz*R%=P1~&en#uK2!oVCbo6m0@6tr1oKQ(
zNS8jPg16j?B9um1!AIW3PHZKbx1X{F-^t52r((9ZSZ181q6HRh6imtmPT3(h1$+Ze
zffX_iJ=Wtx76ZYtY}*akxnvTNBl$!}3(Wh!39;Ek7a|kEX|synSmB$r+ZmhBsk49p
zp=X<;D7%`}i9P1({%|-M#dL__I_UHV2GaRUL67-So%yFav;kssB>c9ve@3z+qp)Hn
zRk6F~#1@rA!LU=IBeeTKr3HB4?SA(i#uc~%Nx5*k+k%IRfNm};eCs@5q=G4*ob0u8
zDeKb-g$ic5fwdrr5aHJ2EvC8>qCnve`y=t<<jqonB#JK&<wsM2^U1f|X-qGQI>}+@
zPDq1C?As_zmCmImGWsQqU;;#JYon9ZmC-f3WKSYd-Q%cq)2r;~hw|$ch13>BujXkr
zcSts*T<<6$lX4SKzC?>BUI46T&=Fo7k0`M|?@dNDI2o915IBwh=106g+Ex4GJnl_W
zjzpXfNG38Ma_=U68garB@NCgD7h|L%L7^D%=@RKno;W!3BSMFSD2~Yb4>QkBkJjo4
z?3QTnqwf)lwaPA?lEMeD>p2F9RtXTiP}t|&Mbn-eFDNBfceKId$P{XyTc&e-pC?zL
zXg-J6E+bT2QlOaN#-spO%02DnK$<|6c$tn$0IiWSN7`9SyKRZeim?#)Dq<Mrr}xHT
zcFqT=Zw1~S>Ds6W;Vistv!0VeoYUE;PK0Yo8F?uvj9jgT$}Q+RqosBoG|R6q?Qjoe
z1on(#PgMKzHFWT3*h0REDZu`;6oQUy%8_4SwF^!aSc#Dk64Fkwdz<n9Vvfp=PXDwy
z0!}97OhwmQ8#WbblwXc3Q)4T@b#9Dk<AR}1sIdvfb2!0$BAbt0fXN0w3I-gy4g-^3
z2CFJNNRRHrn)s}*Tj#Cs^q`}*_HQB|^NnDrZ6z!~wZ3gJnR_mDy-$i**88&qHLHU1
ze4DbeRqlrf`JlgwjfrXiA>6QCd-!lSkxeSVWC`wCJ&Jg=cX0S-?~QYu?Cl@?xbqs%
zFjgRVaSwx`moN@$f+j>38K#PK5IWmIGh-YW1w(-3_Ke=Ca*wD)3QM6;o<V@FtB71v
zKmhbGf!0_g$E&fNXEqiRCmsyp&k`=F^mC0XgJsPwP?L-y6z)^EYiNRyG;^73tP4dw
zO6u7+qV7%Wq?;|VZ)y-B{~a0hqKOj&L)^uMwJyk166=K6zQk4wS=bUr=$e5ytZ_Up
z&z+$cj?f@cu`)fywKXJI86K#Te}a9NjYlex1t9vsXe1`$!Ks)@<Wv}P`#_Wj*}bN?
zc-v9~N7YfB4r`0VLCj%s_^RYGjD^FIJ0E>Ots2st0v<-jOpl_<%YCDY1>jn-YF3m@
zKFP^kSLKX+l{H8&A?da;wU=Be7j8eaaz?VWQw~{jUEwUTET>|euN%Hn>d0zP6D&ot
z2ZOZG)GbJ!S=%IUoQN#pM~-O>6=cTQ2`-NJD+nLxHfMuCgD0QK@B(Ajpy5#7dPj8l
znT|Dv#Lj5RnbVM{2X=OPj6O=yR7*^Xig41o>}z@#TTx@mLE|Xr>J~RH3G1}4*#5!m
z{e!*Et_GrH90?;1lJ0Onz?QrvCvZOgxFk6{^W`jVvAn&Yak3=sk;fjOOz=d9h1*v-
zX<H=EvG!rc8rR2^;QM(zi&T^@gS`|Dl7bS79H(tllQ^4<{A=BpQp&EfC7_bK12Kl7
z`fflh3CS!<T%-@AKQX$=sRM|}F!tQ?E~OF_RRQTG%q8iCq+4N8Py7CnN>Pl-h|RPH
zC2ai$%Dp-O)Ecq%>($xLR6bbys)<vLTgpvK*dQKPWpmP}@uJ*CYabN%7N4U%qEi>E
z7nDxTz^XKn4+>05)L~tmE~anT+1Qn7vDlAcqG_G?T?f^VlucZT@sYgIqo>3bb|d-e
z)U4Dg>Kc+0xXBopUs7p2VTlv;Z%dLWHs_PdsOE_IJ2V%hB9u`PPi{-`m`gN*lDa-e
zR)eg!Dz<{86DF)-Y~h|!-=~uy^9DxarRwoWcnQm$*NQe^$=rH1bm(Vb6Hr;WvGSM{
zv5c5&lANV&A*Ca0;@(bE9T>(}p*$TiLWeFf@dgR#J}Q<`5hlWg1awJ_a*@?Ks<Uoj
zoYExTbIA_D{bA)WaU!&{&KM-Q7zvl&%%+U?a@J7yOj7_N9Vkk16UJ|x4Gd%@kYQEE
zGwf`gPLYOf>59N4fWbc@s`t?jiq~YFvlpO7eyeIxm<b^YrA_h8e9(8Ac(Xv#{1R8d
zc4&;X608C3Imt&$uFI>{^9VcA2#`$%o+t$Zq-`&(R20bT=VD@!It;05;Z95u09d@6
zo(lg^?8h<dCg)z_wJ~<AqBiQfTeXOr4Cx0c{SURqvjK~h(O;E{u)z+(x-*fo^vxuS
zE@u7FPETE~)pX_n+4|~|U8(-~&aR)PPs~MLPWh*$842#91XVbMN9-OMS=utqs?sTr
zkoP&Q80qNsaEK9r{>hP8+#VGJr|hSMVJyUO6J#wNwF&`J9Q};j3=HFM=_aj_uUdI)
z?dWC>jXQmPqLp-oGtb5rk}66h4+$44tP4G6c14>wNV|k9Lzb=n;E2@7e5o@9D18qd
zworGkiAp+2kqa@mf^@ZT726Hi;SjWst0M%6G-2xWRfuG=5+>nPqW8u_<zK`>U!~n+
zyE&yiW}n|%b!fNk)c{I28nf!6DByK1EX52yf^r~megIF*H<b}rejQ9ylq;X}HG6M^
zV4RwUQM;j1JyfteVjOMVquIH-)AjGxjQUx~u&s(+uRI==E|tUL@o{E5T8oJ?`%Q#y
zKwd_}A=zh;u%`|VLbC3}4)9o!8+;gY^i?Z6s?M4&I~8wk0%G=E#}a)P5niS&8rjA-
zZdNMmBDuVfA|-f}-!$Y|-!+$>E0xS`EdFV%x}>z;I@hJOhWfCF^FqSyO(LDe+2=rZ
zxDp0c#MBlwyc)rnjYFnQg_(7+#Oo%KPf`vJI~o+vb>%|PrtPHd{f^M4Epe-zwYNjX
z>6Mn4<qEkd8Y0pca&cfkZ)?|bE{}o>1WXmvmtTxrvvdh3Cx&{99#v|xJ7zA}an4(P
zahjQ~ZBmH_YB`@K9Z3xJ37a^Mb+5MGeu5d1y~j^lmGR2p%vr?{;}v(lr1}({7$X2_
zY^a9JLf^`<y@^ub=kAe-UpEV`xtN^%<r?hGJnBR;aE?2hH_jWb<eFz(qJ%d}Y;0{=
zxKu(6CRyAROA*EXRM`0;l1);+AW%|9#JLvaJ|p5JB&kkgrmat(D*MAHKv)Bp2vqE5
z6OM0)nIoNG)u<|^hy!lN%8A?F@2VF^%W0IH-up(<=zmaJx7^4m1xlK_etP_%+@skx
zBuee9%E~3z@g3B-Y7n#xG$kvo-Q2`pG|eHL=q!mWSy68I>VG`;XKYSoYAxch71=L5
zuSSo8?X|29NdOqpUY*Y(_egL<WGSF`xoB~%N?#=Lm@VsV3mDg~-dyu4KDUZC<kL^0
z<^pG=V#NxxgyL}$h(nDs&l@+qHP@oo8dj&XOhE_OkdpJ=17*?a(Um%m?|;y4iv!jQ
zGZ~C5$4WeNNeI#hFI{QRWOpsIyx2)!ZG>1;gq3A-V@a7GIWD(EagbmgB5LL7%bHHU
z*|KPhjwR$AML@gczL?_`+1yG)3`Cf|(&aQ;MJyWQd?wf`C?f$;_-9JIH4<M%6<>px
zY!gDPLBaACNuQ-}kx?xt*`t^T#ZmBa^g13`<{3tfqQlb4HMq+BWd}DhDX)k`5ngDu
zAzwiB@zBI*BB>qFM45x76l)y=xF#_y*bSah=aZo&v}%9$vK(G=Wn+&5O#tzjsuygt
zfRqLiOz6T-IV>9miwcOw`)rH_ZN2n+K^M__!0bIn`&BiO>0vRC5(T0sPpYDw@N6+s
zPl6Zh&=STg#fwXt!S3PFKlcw_)o14A(%hGDsSQ-;Bd3@u$2BE)+}@p5STgzb#_w^m
z>DNjF3eUpm)lc$W=P!<od(BOd$&I<Xcd*=dm{8Sc4a?T!=%KyYKT_ViCqHb+w^Otn
z@k`s|fLN@=bGY?L9c$V>9z73JGMlvW8{x)^<v8~f{n!MJP?4-TAFL6zbZ2JCa#y8Z
ztvf{Y*lo4)XX`9dQ#goimmjCp8OPRTN2VHWJmW%yR_gUK(WI$wVx~(bj)lqeqM{G6
zeJja_M4Wlm8ETHHQnAW0@lq=%T~KHuaxhb7W{zLl)I)ubEtB~cHt)?QFX=Kc|L%pA
z(OYZu@`WVwVP*w|;uui2be3CmE>NtmSQ%jEC^U=Hg!OW%=$$2^gcVaWCrhkhBdzbe
zTFZNmUpHHAiquu!l(D(WHG^y{h4}Y}>6{Kr=@sUF<+lwh%%bgXi)F|?1^%v3{1hEv
z1D^n&$ofcKCOYpMZWJHj?{c>p^kX4kYdhA5GYsje(#K4-urw_;1s2Ga&IPDQDPlTe
zvGM5^=L*X#tsyb>opt@?kKS)|C5qux6=<Y)!YRDxw1WJ=`Ampnp8S&i(MzR`_oFas
zKtmsF-yf$OPJN0OlJ1&3g=|zU7PT=m>*4S#otEsP-K;ZDS@D}0^g8KP5R5C!Tbb-b
z4EZQTrW_lwNcD`2;~bkINeDxV&sy{vsHzO-<z<<ZLB)lF!ClSXk_}Jf94fRd)t8<k
zWpk<m(;{0c*w>kM#trl%cMK>{IzTyr<0dmjx5H-V`nyWtpl^~+ft<XjsXlFs7_C{T
z(oqwu40CB}97a14IN;3vRKd2|5(U_pL}xum`l3Q;t6U3xkiy0~at8&Xm_$s7*poA_
zT4N~<#9PTlouL#r^g}WVR@zzXZp8%}-=37;PTOmw+_^3P&748Bl7?(tNek%UC~trt
z8}<QxQ15jWurUN18>%dauAOmNCgqD5wYd+v52((A;RA)AfZeIFAhpc3Y$21x=N^an
zW&|78l?@Wx6rgUhM|Ys)@^5ATu-*LBiKe{w(WOL(s4ylBjx6o?>c!{h&F)PTeXQKf
zm1f7}ZrZv5Y9#Q2ysrY>IoLTJGjpy;OTjqqx%`7<Q6O5^7f!}b<%Z$5S*D}9N<nM8
z!Guxs8JtSEe^^~afa5H8o(>Q)jzP|$2-GER8=@Q}%Q7n*zP){gCiO1jI1M`NmZTCF
zAh?{|qihdBqMrmmAhqkFV<o_Olp_<uqG)WCI}7O8(4N92;RMh-MxsJ%5tBkEa`d;i
zh+)@c<*we6do~9_<;$GB#@osWV4XC~?JXKJI%2)GCt8PfdCCKFE-NTfMWD;(rlmG-
zajvXZm5B^qymt~s>BwA$uekXxRI$`{-ewQ5ITXVmV|zW-fCdqLmBg}~VT{{7!B`?K
zN#ccEWWEX#Ls_tv{3R8PPlIB^0>x%EB=$8*seBfge6UMFb_Eo!ouzmJ)2d=WzpORa
ze`_eiG370lTk~Nm#$&V_{bU$Y);adNb;y}S2=_T;u8Fp;{B@Lp`$|vGbX`Z<7U#oO
zm92woxMkhH%$IkH&3KK+GMN;si=v9tzK9Xbr=qC~nN?`JRhS@}*6X|(wl8Vw)r|1*
zgv1PsI$NaK_JNb_SEJ2q!jo9Z9?+!H*!@dd;XcbW#_hy0adsdegv~fD*Jw(PDGZuu
zv+Iu4PQH~?`#+AvBi%|x<CsTNekv;+OckQpW7ct(R1h|_Fl;C?A9sK6hl#ExNYzG@
zCYa0m+H@-73$0@vYBi~&vdS?qwK5=~h8`iu$|H2oLo7mrnsP-&krL|YD~3*CQXSz`
z>1LV?RE1bY=Wv>3+WZc0pZz}UlT6}&C7AWZqJ&}#s(myyh_r>#G#FXRAo9Gnvn}J$
zt{-o$UT<x<hS4QXYvP-4%)HozqSrIFOF%5i1^_rg_GobU7vq(ghrOPVc48K%sS-M3
zse3Uw%_V1vvv23=Hdo)B((Ni|6SAxfS@Vjy8OcqbLN>WE&U~_TkXR9v7+{8%l!{W3
zi?&>?6N_Uwbel#q)>?T~*ZMo0j!jGSUUfa(hw&inNh)?HuD#j;w9f%^aGk1!InlEy
z$|vU3lwg1r`847sbqlaWTX*Rq?DvCcNpxb=u?~~L{I$x;joBy(dvBU1mbwbuoO9+c
zcJ4-nC3j>>@tF@apeTU~`rNy*Z+3;RlS^E6$7^5Yu8hOpieze<oGY*Rqy1fV6J>G5
zHlrtL*U4m=%&<#rNfBRcmTN-U)p1!$e7(g6n!TYAyp$A<X8$(ANL-k_6$ni6zB^S=
z@k};3ks6DMoJAy1Y#)uigRLl<|ATWVn{aR%b5#DDBGV<ElC2P0eJDRn412_J3@HXN
zh3IBOIQDOysBnZ9{Zq!OK|~i?k_AdhGUiM*4o992;w=J}I2fW|SKk`LB+@|=t=ae{
zB{JWjI!25x&p<LS=^`v24bzZu{7Hz1LJ7tyz-JcU_mkl)9>nZc#0hN+izcM9g*+FN
z%2`~t@AbxGCKUE|s9A{{m7eB(KWKc=_rfMlt*87uaA<^G074u@+u=+q)IBn1RZ5KY
zB!(i%jKC8P1jc%PZG99>pWf`T%b1J%R>yy(*oI6y_`XPwqGgQ79M-lB&az|$4|A`k
z^B5^?$b~);V~E$UIy<lTUmald(<GL(IC)JJG0G|*txncG=PJmo;Fx^@aw|zDY!bIN
z>!6KC`8+g=djVqh#{^x(R9+ZNNQz3MS%z;Y?~<DCL2BKf=qM0Ea~(*Q#A{(Edvy&W
zdK8%OvX0>67SG*x{n8J9E5VuvD$-mWA!Eii?qt^@0#Q6kdJ<qR!AQ)2KriCna}d}0
zH0D$U2o+2kghjN{>W9-eucfgmrrK-`p~<L9JyxVlig6>lq?{*(3s9;!avpLtbFOe>
z;}6?D=9Ee*rV@ar=G=yOApR=;ZO!qI`OZSDYX2B5z2Va3^8)4-gW9rB=R9Ji%z5#4
zh)+JpZ_eKOw!0KlT*7cIDoMyx(G!-qw5rTndb#p(5~xuWCo#H%BigLl_F$4vyk!4b
z(E+MG>)9ip^1nqorO%>gTmqbRUL~#vk8zP#4nSgs#!-XRFtWLuoYvv3DGEI@U@F_~
zOrwFq*wMl(wQRiXpaMGRzOUj2I<Yw2+^Hs?0jmB@#4i)is}TE(8q>mZqg3b0;N+VG
zlcP|(>bd!xcvB1gSk<&D(5Hc@<@p>(B@HWob18@|16H|3NSyH1V+mOyG;t*BQC>L6
zdfJ7XB3x>J#KWW0{lkNkRsG=T`0yqCv-fiUXXa!q8$lE3fyPDp(2EIRMH2}p0!*&d
z@x}QtxF#a&c`qqF5%FkGgc-{Z;OWlaj+8PO_*qrVHc<4tagvdBVgoP1`J1J7qX#t0
zBe9p>86#InC%xyLjA5-}QGmRO-$4^T1Lcia0O)7}+Ly=jv$rE*awz2HGj?vnyaeQr
z<wR#LJ#r1zkw_!FBOTKdU_xzA2p7Q-t!-~;<{Xud0kxIG8|@mXqQ9{Ji&!bdffG&!
z`(ht2G&JJzL%aECMy@-yAqG65LlxqzB7&hP|0!{g+R$3;QtVZk!D+ckWiEeOdK2|7
zk~rdIU7Xa`mkcFrL@hz($y&i$aw{2L?wH|7>aroH<RGCwIDZA<i^_Ixq@M^ir!?2H
zE{yuY%-@O$Y_U1YC*Np@x`7D`@8q#im}jEYlI?*!))%C13XjF<0h{SoIKOAD{E{8<
zGh_2HJE$$}+DoN1+gHjHrByIdAUGN}F;5$0|IvQTd|yrpY+JkNiz^nFo!isA(M^us
zkQsFm$c_S#eA_s<U}6QxR7Bq@oWBSq@?<d%R*(}?i<ujAozl-JII@H|gbv1M<SQJC
zOX_oEVPYE4im~q}eG_&7$NTEw43!4fl_$lwP_nM;V=bC+RC4jwF@AT(6+@~@v~~*F
zMwW!y+q9;wNCV@7YU*p#VRUr4$!s4g;aD9B(delaQ>kK4N=SDVQlTtD*IXCUOx{9{
zo{m?1B;&F=+|@=}$pU07tQ0UWoU7?>U}@Du=H?4drik5rV-629Mgv<^GoX8j&oYWd
znf4^EcaF(qn{DY%^c|_kh#yCGSc`^)T#%!P!Y&w7!h+oBq~un@1tKtKP8`M@Kw6wI
zRa>qb8R;<yT#lJGbGI1$*xUxS+S6qKHht|*B3SdjZ0y`wgjPuz4#(Dy)pSC@qE~9Y
z>KceV&xb)YfGuW4^ipvO?O>|YLo0|TGq2?%i2w-exkd|FlpJc9D`X+34Uw+T+4P*p
zjH>C$7|#dT|8y_FmsUf{@U3Cpb}YXu0qumvLuD-OI$1a;pl{W_GJturbJRIFJl;Fm
zJN|LcHGEa(C}Xl0)8P^`mC0TFlX&lN4|JZUPTy>phs3=Q%@sAN0OMU{RBhro{0+om
z!2TD(>saCxwpbqB0d{eylw_3va$N5D)?0*SGQkW>O<81VHTUKwyq9Yct@=TYq2FVh
zcx7W?*nUYl!5*O{adwQRx9BP63eqJ8HHE8hakYq)M~O=8$>#lT_mm=Z($mVvmZVl@
zxVG}*tFq0v#8;D6S&O9wK~!YVMbF&bV4xIR_M}_X%<jW7_XlPWQ=RB|-gKma*wha=
zKwXs*%DNq!WHBO~&><K1@_egNGBvEcDwK6H6_(u0&zbt7x&w3)XU{K}XzwaoGp$d3
zkg`U#krPbHOn<q<=LkWSro_Uk9<#MkK6@a?QWu|UQI4U$J|Hg})Eiia^m?Jojay4H
zAzBJ2!x!kIg$~PWO6pl=<&_f_C~{k0=Y|4cS)S?^Jh|Ny&cl5pN<L~`;>BXzCy;PB
zk}73y!OL}ADZJ{(n1FaaA^uJct>Lp>QqXW~?87<ALV(Umq@1MA$&M$`&V^=lEFqT!
z&?|#Lg~x@R5s7j#b#GJ(8j{;JtrZsz^6o1G6|tzoisNNY6Gk;+FMQJmiF}+vvgn9l
zxqm7$i9Iq0i#KS>?qjCqwu-aI5_uAI{h`lsppbkuBpiM|hf$AGiVZ{s#9^rL=%Iib
z*-e??@P@p?it(f6`b}~LaBN#i87~HF2_>l#)_}UK?VP+mrs(Z9fXp$XovQMdF>L5+
z(O|ln<A~^Ml%m`on#x&<y%d5@+WJb)cm%+gpqz5_NQyQNm_+duvUq~#eIgih(p;ls
z&bb_uIKw<R>K#;qN9Q%2B12UCciL-fkJlcze|hxyH(zs&?MJKa$9Sx)J(gnyg|Rg9
z$LU3^oxd2_NT)z7qw?D#;;XhF;sjkWXf#;#^ajzXrj$FlL>6P+J{}m&PyAWD3`b9J
zr(kxPrzm(m!GEs8es=Nn@!H~l-1!3t9i}KXQXcDIoa*F;t1AO^&J%tqy?Yn`u?C;5
ztquI!dbGJ_|K(46{Xbe8t@hUD=A-sHlxweTu5J8>xAqZz&iw(z@e|Mcj|oT<*<?z&
z8Snp1Kg%8>(o^JNydWMv9iD##GJXC0+kK|&|Ix<kr|AQ?_@hUg)%$;K&E5a4t=9V1
ze|Vdpru*ri|Kt0A`uh9Vo!&M4$JY?RIQHS^%4p+ueN3nS>+6N}Z?_*kTK`J_zr^RB
z_w>_!7ViOLcade|C#$PhS63^8XtEL~gVi)X&#r*$TGgU5`Ac606$o~bjfRV#cx2Gt
z$v+Pck52Ya=!fU+{M_078U8zbbF}|@uXA$x0)Ezh+&ezmKRjr7zreZpXB5M~zrl|Y
zs@2gw|4(({^IM(Td9io0d%RCq9n!Ax)Io&+1#AT|V=!SE8SPF7I=rV&C7^_Mtu3Oa
z)Rn$mWA8qE=qUw1YYep)NrTKdQxNkw8D;FjWXO?>hV=8#yGKV>S|ed)p%Ixc@US;1
z0Y7N99<W8Tbl7U?F6-15dPKE0a)mZbp%noG$_AXG$_Tn7^_lEcVbn({F)#`0Kn9|C
zB$P@8hEFYVKpAqa=?7ko!oUN`>OTei!U5Jj%0VQN_7T5S@GVn;8lp-)s-nObQnzl>
zEF8oj$V^aml-W?*iRl~fk<K_c4-%bw2GexeL$o0Pf=^Nf0Plguss|ot`5Ff28K#@m
zgQ12DoJd2b(JCKR(zI-23SPwDBiWULZ}uf*g$ls=|FieBU2Wq^->>zr&`oI*LlWYI
zmc4;+;ZnNWvn=g_a(B<ea=cFBfZN2*jS~pV^537Ckz`ALNq8&Go<sI@N#xOJB#ksL
zmS*V47#K*C=qNmeQR`t8TN*zR!O$5KmdFS~cgw^Ve5mwEu8$&x1@RO9Fba&~b|pn;
zKp#Iu!h<yNqibM%{j~GnJzSnk*MdQBc-(jq(GtI_<nTN+T{k9+=3xKB?%u)Co?MtR
zkOeDsOfnPMe_a2IGl0eTa}fI8SGL*y8vMBpg9P2J!s6V@tZ3EQ|KY2JUtP~{yQ4F<
z`6v9m+#Wi<H=R+f!488fb~FyoeCX@uD7Xs8XZ~p0L#q*A7GU(G?j)x+_e8&8KhpVc
zd`(*2h{J?%7tK!Jox0FO@HOZM7i=@+U$*&~@foDOVV|5ypB>Q3VVgtOr*GT99y4qG
zf-cuT+0T7vFu;9mb3g^#UqwOH#qLD4rSnG3&K+edL<5(vGF%NZSOpJ)CeNsV6yZw{
zGY*eM;1|cgVgpcQCWELJjIGm0&!jv@z;|0ozaLQe>X*XrM$Pjwar%IV2kyp~8~Vgs
zL9a*e@tm;Yi5-CgYWP=#>k<Pc`s5ROi5JeCK3g-4uHP4E_+s;vS8|-Jt~e1$XF9XQ
zk`3E1Rp!V_0=bkA;=QWXz!P;lyY{=i_s0jNlT1`7%>aqP*kH}}dZm*k3yUoJ|7lqq
zsbNf(ujQ1llUQ7{d(PPDmrm5Z2qnTg`Ef9|O7vomPgXWjrrJV`RbK8EQIMtY^N%Hv
zQh0PH2bZaLu+F=X=mwPv@t%GVN&eY{B_teBR=*2n4M|x-5rXeamMwSe7M@wsNNi|2
z$$b$-s?6N_bZ>3;Na&Id2BI;0AOII|>i*8bkM^hIqn}DAz%_DsoQ^Fr1hxEt1M;N9
z@Nf6$lGGNKP{$FB7b4d!S#bzWC7U#2gsxqrdx(!t5W67n!~4DcqrK9Jr0nS9@!>A~
zwzF3yUTbUz-76c`gyi6poTge=Za5Fb55&meQ7C*FKV8ZJWi2)Zgc~Gdxz9Zwvn#rD
z)$@$x8c>*8ZURb65duW+2MTU_Yfri*uHabr0y^R!wdn@y27*QC_0fehYV91^pAT)E
z-<+P<OC0m5DXQLQvPozNL@}3YpCw6>!o}ES=fcIQZ56PALR>d0lX#V9kIONF7#HuP
zL{uv5lKmWcB}uK)pF;E$W|*q-Y5sjFLXqa7IsKNrQt=r<fK5?giR#kWXi11P8emNM
zHN~|2LjhL}4Z0inE;03~nPThvF*QokpFUwm)!khRfElut$Uwl??!kyhQVE(7yfALh
z>sGC{UIiPsUOgY8g0xD}>iVnQ;L^veN~`o<Yjxs-0y188cBj+TPw(E_hx{FcjZxgf
z)%Cakvey1psnx9Nu-l6o*&R7o_*xeJM3faOn9@WLSIAqGop?!ha6v{Lf>H&;l2v$K
zs?SUHDVC}t<Uf8AGCn2Wa`g`EHmWWP;kR1a)aoxsKiYeThaV41C(FyrY$tZM@N>$#
z!U`-Jd1)eEr6VJpl&Y8{>LdN{R+L0`tktR+3SkEyKYu{pI|veFaZ)64lp!ANS!&(w
zix@--R!d?9o&UqZUMYT5wvx;1gx`XZQC6acqooRFiPw=NT=`>XO6^j2p^2m8{~Uc*
zS}+aVjD>xJLxIahoao~3<)sISH((gBZF3stuR1hHpxJp~zI$nVK0q6{A!Y4;q^#YM
zl-t9u>16XWELtdd*xP9k??iD#3d+P2!&qHKFO4?oPL~eQDM!|MKvhSK8#RjOV=x2Q
zhz_!N<9{QjpMoI<H0@uBaOIbH(v6?hqS&skOlkVk>*2*KX4{=%e-h$9DCAD2g1nAE
zp+m@FB}pqFP~X$)u}!)|S!?XizyO@4<ACL2#L*UDZ-HUFM)e^sL{e=YD8c6Ew&5|s
zV9MA5#v66nCcby4xQ3s%#GxZRRl#|S3a-Uc(=btb+MrkR{ISV4TTJ}?Y?fI8iEevm
z;%;)m+#m!u8`$zq28k3f)0S!CV;Th|cqmIFM4qppTaLYw$*ymd7NUCZ+>wW8W}0j`
zY4>6A&qoxcs@E`P(cBFtcs+_-E;fY<vfFq>*rh{usX=D(D6{l1Lvw<31Vgr>;!UJ$
z3y<y~dVI8z0i=L#F+tXBShdC$9;qJQvWix53uD`MN0Yd6-cY%nJ_5w!0!+gNj!1(m
z=L3^(Iv{7P4N)MgmK>9{;Xz$K5MiMmw!+$iz4DsJ`apw-YcOYWU{{EL)b*+ILJZfb
zbC3u_!sBeW1B}r?k*Zrf>gI;Vm$zUC(Z=TIvRsbyTOuuDenXjE!?#xaOSfD445k4<
z!9%BRvdWe+{1#?1tLw8R=YT&`W+9$noPZK1nR4WoVX5JXVt#jpU6>hNlpBm33J>2c
zM3mIbt!7j7oOc~I9J$5Z4n;>pLGyHH92awN(4iBj1GCf7i!Pw(LMy^N<WLB}EBJVY
z6{p1{Ku-g(s<pe&>U17HX3oXKabQOu1xxP{CJ^}@+0mR$k>GJ^m2I(FwPvz^^C@ex
z2*;cq2whVcyhPgox!{rw)Hc{n^yCbl$T|rSBi%m<SptM+)_~-Ip9yfK&pGtd0(Pgv
z(d^B0_uLuD?QG(Q{H||5pd+X;0@~{Ou5Wkjk=Pn|#by2@EQ>u(N8xlj@t|aFL(3sf
zOpH3jg;K_P_{GHO>U6YC>M{C|*@M}Hsx+2a?RekRs7h#AvK^QooGbv(o!J=H;=tCe
zfW^IJUS<7ORUDu0ul!!ishh(`BU)#6^oBWGQ^FN+pi4!^4==@it}Jngv%=+xkcbDm
zIONqgtu03S>T8puh?iCbP%`B@6h(Ec6A7@_W~xp-U8f=2kqss5G(;V$6eS@cS((;{
zP&P!{y&_80Vtt;XJr1ZaO=WkpX6%wmrH)pqe!EIFtx`j&l)EirK8Ij5u=P7*DfJ&=
z^EDwH3%tcfDs;|sJlub6-RMlA_XHbhHVF}~vfMSm;SixRo;m&NJA-!DQJ7qtYAZ3<
zB<gt;d;@ZFS~BA<DG%%LP=Lv&;%CX!3+g3(XHk{1dRFTWZ<n~POe6QjjCj|BZS)Ip
zZ3%BT>3U9E(2FV~){5#BYelS~LnG&&w6J@+7M}t{7um^c6|j>A!sUMAl-cVxCwyw+
z-9$PFB>N_p4Z(wP=Z`UvK-AT%82{A<i-w##p-a3HEjIYG$(#+gvf?Q&Po%!Z+LcON
zQDB>5j$hGSiTW6kego?z%annCD6YEj&&{2?Mq=)i-uaV$AFp8w{!vwjjWqPck6`)G
zMHQw>1s-oqV7A8qA1!-PXzHMZRtKaaGlK*S!0(Q%aLmbwTj|Bb^k}!ttz7qsQK$(G
zgJoVPr-Vb5;n`_PlG&>(P1SjEsRygcRGYm?OjksBGzc(f5kXO**7Mw*kWw;rVV99&
zFjF$Z9964TO)!EYnlkxFe%5IH0ysOc#=$|d(k24XlL%w3V5OmsBx?=2NeE<RvFqm<
zpsAMc(pqiSmQBbMnUlY1Bc!#JBM8%=^@a*tZ_LIEyWv)j<V!=pDPz=QOCzQ}hnh0t
zgj(xmx>;&z)U73D(CVsukw;g=WsE_3k4Lwl@HXtK)mX3pVEwSRDkrJ}@)s`<RUE%t
z3DF_va%8*s<^U7+iR|Cx$QSVeMF`7q++A6r+}jO3LTk6#lmR3-vgr0RKNVF?uLMbt
zP4w6iCAvz`3j)PuCaR<ynIdF159!uYoFC05FO1z*Gq7;qAanzRT9d2sw(z`>&CgrQ
zaW#6%HNA~g2?$QCxC!0cLIDwN7&kO}NpG+5()GJukDjUS<gHfhPd+`pr4N4XUOxD>
zhxy>w7R(2~R;$nS!LQBr!LMcd;D<r~Y7mTu=diR>TA}7E%a!cB8kdq-@cK1w?#}2e
zG_&=bkdmiF@F?9Cr6uxfaJT(b+KcGju)tQX#oCOb5ydLC0|)^B$tkpOEgCBkHAvP?
zN*9vwwbML-$~%bKr3GfBRju{PtY{VIiB7x)3}U?RVUoeVGOP)a;$3*8#kJ#$ITrnw
zweNCZ*j>^1xg4SSPdn}mWuM13q$CLU@t4HZYF-Dq>D}4az<GuT_8_l;9PL=C9m0cf
zgDnqHqaDT??aB(Tmz*D^@DW`V)4RATaHKi>+THvVamBe#3eJaQl-eC<h#S+b)+%3Q
zX=6QU*WntTa)rB{Hi2^M)@5C3>`hJ0gxbhiP`VMA`Fh4XgRX`yML-Wm`AcXFgF3)?
zDS?mgXlk`$jsMFwloeot=AStpA|gHal?{=>eJg0_Y32$6#O_^yG}&1WXzr4H(EFdX
z{`xK70i|0@zX!S#yWYlYj*=pBnBUIl{#vPimRmiV9gSDB^q#djdJmW3sQ1jc{})9$
z9(Jmp|A0GY^X`AI*RACJ??&Uz^Zmc4_~2D0Z`#`Cf42=xjAhG0<;S)GMoiZmwYK@+
zZ9@if#j^N2mcxkl`!<h+kI&TK+lFxftlErXXdCa`uru=LBzlwWi1^2S85Bo`XKk3t
z0AHju!$xuLpneu6voN5^KzG3Ken;4Gc)(ZK6)65XhWM9v;EdzL{iZYsBc}J=@v8A(
ze!rs0wq?03u3XrZ26?-h@c_dhXFX_7&Ts(i^b>#NUThn?l!C3vDj$}v;{m-f_Q86D
z(*31tKJ+)N(w8U@QXSr#yWZZP75`y8axTCCy&Ci%#$&VBf8DA#-X`vUudg?r@Bco@
zN1l0X@`dMh47{4vq)hf6nr;JUJo2V^0$T7SKMY-A0Wc*6V-eEH^)H%icejNJL-1hg
z8Ca9TG(NQ7@9+G0)G8DhM*IBm<MH8MT(tMw=ffR)SNyL0$}P*vuYOR$>r_{jHf1|5
zDD4K}_h>b%w;gi*V9WIFiCdr5>&l=}e|Xz;=mk_M8EP40JB{NXjDgPa)j4xRwG2td
z1SJ&D5H_vH<rqCW{gaI4EGjT6)%PPprt6`YUf+)lk%$}RMg=eYws`zFp6_gd$m)h+
zb2#z_&gg1^r~<39Go0}Bl1=_&fvCd(aA%Z}%;pitD1`bW?b}bcf8I@IJkIX<NYd&N
zcDzTR;o)1&BM|X48_j&K{QF4Pd#$i<Bx4^&%cDx#dy?{P<n29)S(L@_{bcWB(e^DR
z@MF>Vh;sOmY>5Z$65rdhnAfL!>^2MArHAZV3)`v3-2MJOoxJ}p`uFMM!*}DqPhTHp
zSO4DKohuvIg1Ac(G%bktBtg}JI#cFRxe&gUc|<Oht7RUs-%;b6rx`8W;t@nG_S(rK
za*>u!9*v8*a`I?hw1uNBmBr=KxnwQ`pU$Onp*VFewTs59GkLST5F9X@#D$vv*`zM~
z+$+<);Nz-Ny70rAF_aG{+A!K~FBrKtKTpLo5y^<_^rN~Orx#ti)=6)!@J?a}3roAZ
zY)OA!kdNb-V@ZG;0kV`B0&1I*uvNY^v>$ZnGBga8VtU2{>pZ6-`R1P)=fC)*gbz;w
za`*fn>y6r*=lmZ}@wvtPpSiw0n)r0FDXb2!?%c+l`G33q=4~?n2Yh=z|MwK1m;YRy
zgrn8A=dXfzW5cWQdEgs{H=yu?;Z<l*U~;@UG!BA3C2_+iYTjxN5=74?co>}*@{G0^
z^Pi{0m9;_mQMyP2gY-Lqyv#0LcIo(IN??ou{GyZ!7nmqd$yl*79HQVH^Sf^@D`3v&
z0#wGF_JA)6_%{}J(|Ud9D`qdG6!%r5?TthG?Hb<fxeBWTXG*E?wpe|6xluO^AFyK@
z$Uep;l600#w#?umbqyZS-;#M!J2ecvT{jFa-BIX{OE6G_(By7bkys9|m(g#$R^;Jb
z!s!UprkDDzFW@QqO6;2z6<1o?Fmu>46Bp~nZ2%5y7&85*jHEfjSd=HFA}A}xGAn|v
zQZ&n~RHS#1SR!6V7R}RiT};$Y^{J&Idb5jVLjy!TA_=BBw2I|KDH`i>p=K8ma<9k4
z)bNqWYOLxEhrku3qEM>(XBA?P)|<CQQyBztz#3~Nh*b4&NsXdA%AyPnO+Lz2)Tj#v
zCDmj_-~?82i}EM*?1WW%l&Y0737m>htX$a{xqZsv2!%Z_sw6eHs9-c;l~IqyTX8TM
zM-K;IyWS}0S*M$PV0aV{pk`2j%uX3EjfljL2_|YroU8K&0SlhbW*>#0dG(lMaw<mv
zrv91&tEVP36Gsv%fe1e^7ofhwt{_$d`#lB1b3$;g&m0v_L4HMz<9R05sBdYC@PlbQ
zz|wG24@FH%_tIje%*sX0M35GODE#d=y||c(Vuck^@4vob*Ea=LtWpM@aS2(YzzWqb
zf#;X>*)?<Vpn;G=G@afZQ?<HURZW&W(iOZh3qg6QnB{LNvXx9cg|fhsVj`ZHC+oo$
zt7YQCThFXmO!v$*QbjM>uP%m6E{=8i#}gR~;Wwm|^T0`sdIdH~k!I+{3!tnNGpf#?
zf)`W!BtT{mtuMb9FGLyV$_%1Exg)mw>6quz<vCR;GmntdJi7^{P_3qF^Bk@*Brta7
zhKqelE&QxyhkTv0Eob3K&&x~plj{r<8HPbDP`~hQyVfnPM<j7{ozbP|+Y?{!*v#Dk
zDbMPVCX#N~1!M)Gp0rqzM!v`sCF`SY=8a$p`<a{?L?F=q6VSe+J{I%HMhxj;Ff+Dc
z{BZG9C=@!*m~C$EeS8lKN=hpGRSATY*{z1>1}Lehpu#tUOIE{h+JG9PK@euQa~`ll
ztF^`UaFZ*rtr$_YADk&b1hBzE*VTpMYN}zi5Rq`VkUNFt2lffD%n>HNa{9c8lK70>
zKB&l3yyMT;@o0eB8!Xiu)O7d!3vU$olplq{*|cTuYmLRK1~%InbTj(*`_guH@8ChQ
zoYl8pTkNmD7!4MZAn>F|xyfFY6j5V_1w+>;)KM`Mg+ePgVmg!PQZy$3=Fl!jgey$2
z7KG<WE9Ooktq3nOk#1!GcNv{?*f-faOkM_;0Uxqg?79fQi%m?qhB|UgB9tk=ZZa7f
zwJK2Btw;}yH2yzA_kXMgqtbVvQEKuJhB+Ac)JEhiU3)h`3q1mf|CivU$|tBA875{I
z!}?n+JTDT(5+^6SVgcb1ER;pxvn~hT(*74$0q<e_|6{)WZ-KF&u>Wg~=lsu4^2xFP
zZ(;NsoF}4aL?G;73H@%QZxm+TA$%1+*j+6JP_Dx|0+{8pmOzi@w1z>zy&jW47DWQ8
zVj>A5SRZGoTEkb8w<77CujGP=ET#!1yrZkZRfeh}7_LG?q)KGPlo{%PWu{x;W&P9@
z=8{a<-DQ&RbKX*64!nS0sD|B`0!9HQKKl&w-<_S4_lE1RL>X?-_2uPt41rPqAu^ye
z1`<h4G4{ht%=tM6m5uO_8cAr9;27B`V0BiU_>*wr^ot<I$C&#OIs$s1OIa`h+j%f_
zMXJon8LG_}LH~l>Pd-M#=|l*_N#{JmL4tS$|EtpU@gfY2*>TG}8dGV#%xY*^&^Igk
zRyQ&1`oD}{c7C&u4~~zHclPa%loIv`9~edu+JY6}cai42h=rmbSQvy*WJGqi3a`I%
zDk?xq{j7uL3PKw>NWzmlgqsbg2qO3_4f7~|9YfV!)7ZbQLk6$LD{XQE`XnCuQ<%e(
z)PQ1X_Q+BF6_z(<D=e$CnBzlyw^g3D#{r3b?jlUO2eY^-_7l#;m-HN}qd*Qs8NI<C
z1(zZ1+|+yqQY2_rTb!Bzk;GhX2!ljn@oY4)VIVOGAQ@aI_GPA)hHNCg9Oku^jW)Ao
zn%|gP@iV2(V4BkkQZ&_!ag9Sxqo_d&|J)OQCJTxN6gIpM@+>aqPVATLz1PQ7y_ok@
zwRJTS7wTp*u>#qpxXp2+a+Zm!+LyQS49s)@NJM%SQ)LIm`Ih$ekef$?R;MoMkxsap
zGTln1a06*$>G=7>2^z+^?w^=9yt!_Ni13X53!*^D!1UK)Fu;`3laUupLY^8r<gqI&
zzp5t>P@UmzbvZepNZOd*7sx~h$n{O?lmz+)Q|BbeVQ9Q4-uA#l(UjiB^uo?^Hd3$6
za?)KG4Tzi-ZEJ*`w1|cLG{~#)cOPx8Ak2pp=R_oEJQ#ASVt-xM3ZxX*d@{M75YJOi
zbK>YfG-tfX0pa%nW<w~K1m*!IZw?^5FnN<k!7GjG=K~#!_L*V-55kMi!w-M_<38s<
z-oAPJ_WAtBQ+(#lKMy!e;`H7pf$lv2b*ql&Kc46R+kfsf|LTwG`K{ZS7yqxeR!_|T
znq@u5|9g_p%OQr%bI8kqR^gbblZ<guzc+=?pKtlO|N8F?hqr8F&ia3Ay-CLZTw8lS
z|MxVX)zv5xC&ho~v+MF``xt0`XEHtyMoo5z12tef?Jj2Ra4+!LC!R9&T`+JwA4AP^
zRiAA-<6z)*wv-Z?<G|_br5HL|Eg6CR6AaW6PLW!2;daKsNG%D+T`#Dft3~NBw(!_c
zvMz8e8)^}6N-K)<FJTa9H00V7?1u(4K=*amM%p*BHc@(u`$apRgg!T)pPgtn3L6H`
zV<k#t#9=&`XoDgCCyR2&3J8h`EHHM){Zb(qj;rEXq0CC;tY0=?i=r}n9sXHn2gm#S
z=)tDudQ2k2H~S6ws+r8V|7Y(?x7)_C^zYJBur#TOT`?tY+FG`1v{re>OOE9veNMTL
z4@FWIV{Ii;iJf$wtbg<)^(zcEuA&xD5-m$$Y=<Opv0PkST!6rLyGQst`QN}4)p!~M
zP63G+PLY#{QJ3ub0CQaZZU}Pom&x6ih#W7$&!jV+rVv~!0mX;Q==l>4e!IvECtL|4
z+e7?oQG$OI1qPSEpAz^Z<#H#S0z>l!7*{|9Fa<#ZAu_m5xSUvmlrs1SBA3JxNVx<r
zn5Ha3M<pN~oV`<wE=<&|+qQePZQI?eZQHhO+qTWswr$(CZNK~bce1l{l9Qa|By}+>
zRoC@Y%`t1t0;_&NfWRNo7-&9aDTOWe!BpO(1c2TcED-e%Q~JsGoIebJQ*32S=wzJs
z&6U-Ym3*}u&aNRKfHo&h;PzcW0u3h0^`Fqar3Tmi<u*Gx5-u-AdpwF4Eo2C6P1jzr
z+TX#On;+g+XtXGJv-3{O1l9#qHiprd=0X|fd*MlpAqG2q=p;@iN~buB9r!)@g1Tq&
zZ*0)Ma{)9P=h^<G37~&MV2EKgFUu2(0iEz9L$z<ww+RmN_rO1b^a%4Xq;hA&W9IR(
z_>hW=P<MMzB;h_9o+kSrJ3Qsy3FtEgFYq(%;n8v8{+nffX1_x_wZQ6U#VZhCU$uk~
z9Q|7)+bJ5e9&#>;y}mG^*>Eo;IF0G3uz9Fd333m+zo|G|s8{lR{q4OZ2EGR8ZRh)3
zu42~%w_QHH1C04xUr-&`PvEpN;#rd6)$CrpK<Th<Kz-9s_~8OKJ5u4y-!UxzjsLEE
z4?9@t>VqAhPrk&=d=#MmD(Wv<{$AD2Yg0(>{KB$kzR@tlhT?L@cwIfu<DcxwR4U{A
zsFfRw-j4uax|Tt^qi1%?w_I}^dn8iXmuSDBPms=mp)Urn(S>yfMj&Qa5Z!fOzJok7
znBX@qyhs+{gIEST>%WJq9$+=V83VjQ^eo!oI$it(MA`*1eMk7gSl{as%8;<GLD~zJ
z|K(^xX7*{$=JdYs2oi}2#M$E41ky(hSUpE!Pp7m(z6jnSV@iUa-}2}7^_Tg2TRs0i
zG~AF@GB(+Aw7r;ZAx4<E8)3?&#-DM7y90(WrbeYN@|Jp2Fpk2DwU{7(vzr8EBSBm>
z&dUJ}y8`6@N&iaAl%h#DIF}@w0~aG<U&<iGWgG=;V!|Xtx`f#CS$h)UBC(OmLY5@y
z$MfQtQkf=-2mQn1v+0FZ5bv2{EpR4L^8F!0xR`o*=g~3n9OMq-Vy8qynIw#jnElk@
z$N_Rd-M2x46MP6M@Sn|xehq$Np<KirfYDOzm8WPk68KG0TUj;_p>m#^@^}oymD#o;
z&*J7IlKF|ycgdpBQgd}?_3IA+Z_ZOqD^$JBk39O&RUa1_MZ<?bN;;3B93+PO60G^f
zLX&3=2Nt~eE$x=GWH9*z=d!Di82O|^R9t;iGo%LsG-Z;$e<-5<Jrr;-`8<xDhvp&=
zP&v~J3P5WWz^hM|MH<l&vr_&B)?5O>NYQBrNEZ>-|K<<B<oo~dxLR5zC$e2`Zi}Pd
z<Xdei@8CM#C=$qO9nhm4g;*EPpyNJ74n-=7At?dSijY(P_yy+Yj++w_l9-T|5<+7E
zA9J!oE)C>l5Q>Q*lQyIvE8kHR&xM&0l=ev*$yrP`PGe}ta@R?yW-?HLhhkJYQKj2c
zeuy=_gMQW>E!qvt9Yksxyohvv=pj{>q9DoOBc*vL)MHC@P(DfZY)r2`8TBqC`Ijj3
zC!#dNmpsJfq|81H?690ug^Ec2JTJj3$ft{q`UQD^c84#^&lKXzP@eQWs5WX;rC-iy
zB{Hn0P%}iq2QsjWBw~bADlkM6sw7H~<>o=tu#7@$xVNY8av9#ro<_fdkrZZO;CyJw
zQcL>$qXLnOatdZ>krLITI!)Corau)ag|X_j1OCD0sZ992?-wqp7m`efdQl5j&uRgw
zOBsgHpH9E*RzQl1)%rJYLn&2X-}fet*OLDU4Ir><>-5)O`RcVAa>Xtu%9SV}!*Qs)
z;?JMwa(vtM)}Qvii}pO@jaUEpHtAJoY3LU5sZ011_%F~j!Nf=Ymr>-}`*AR+G{YAQ
zc`09`fHt5Gm@jNYDx)``${_C0_{wT9-H|KrU(tnj&li#v<YkDJa#NjoNJ|pcDaqv1
z1n#6#PRSryRB}R{rg=2F%~ShCSX4)#Nb&kPSnWuNX4$CB>e?BIDE#XPW~AqcHp4$8
z*xWbADlCI-ugIC?aS7f({1=&rcBBUut+f;)3yWL~7pbFNs?Q|0Le9@5s?5<ZB(_S<
zFC?Nute;F~jnOa0IU?$d@l2?CWd!QdZlXUD`Rh7A5}C`)|3%v%KN6{!xqdOZ&&)rV
z3<qd0#@EB?7h|TU6~>kzO)fSvHcJup*8oP>w+EQKP5vXTm1s8>V%N8k-C71ZZNS56
z{lk++<1YzJBkn7p`dGB}H+eYq)A$+9Z|$N#?#vcEIR8c<ed!=Gw#ihTn#`=-`8qtK
zil5(y?LX_$#wfmGP4*zmt2lv4{ewY=eyowYUzWY&ivi5TaLAV{l8$UlV;^%YFKRMR
zEQq!I{Yj8-1c+aTeW8T=&o1|WDLDs~opO^NYk>sj;uQ{eRc-$L#oR3Sxc^d;4r<3n
z6QqYOo>O5`3EZRQM%KiGfwv2RQ)UcoNb-DbigS=vpoW#1en){@(n3o<$LsfjF9NNG
z>@6!}A1+2o+Pf%ICr#V;60fYc0?d2%4b7m?!ZJ->IQ5Pe&tn+UCs6PO=c81p^ABnb
zaDucF(9q?S!*#~?17L7bpfJ|E9mItbv?*=ZXYPWgy20D0yV|JZb$hKdf8Eh<R=J==
z{C|ZNMBIK!60J{O$D&&sh6zVM2sF)Z^2bHDejR6n7ux!W$3d(Cq_r)Z{FlYDWzliX
z+P#0%HUQvM7&iWz)6q5napE=q-<P|ky*votTiD-UuQYTPA?%F7O$o@>Pfaf?_Yb4b
zHmS=LpUZ*KJ8_Cmkm6vluvN`Y^R1&k)26glP-YWTh*|fO7<O!+gHNO9gKAtT^ekHw
zGQor;G=t#0!T5iD@?uMl;I=S-$?BobJj^FFJ9)F@SV4WmTNlw9SMHyO=D)42a<2OI
zIJ(N1{`shDy#(o4MEdk7%sfQtj6bOodUdO$mWmNksFtc-jaj;d%}X{wGnE_mR7bJn
zr?)gh_~qqIb}rDxKl^Qf_4PcQIf=JSRk8*2$(L&qpwauGr~Av9{`Rl_EKa5zD^XEk
zfcI)tvU!w}Q2I2iS3h`CtyQu)D>bcF)@WqvbwK(F#CjDl_Xuv_26e)<JSLYi(EnPp
z&$F_?tKO|KbqA^U$ebborUAXM9#^V4Ca3m?NT5x2^jF81b{f(7FHUv|j|z^(9Lj`!
zA=Bs)CA`W7OSBh-Xi>j?jz0v6V@5x9{YRWcKZs67pZtk5VZZhU@1@!i@;0C~@vAmV
zg@%IL*X{kf6?nz|X>pr&`;-ey6#{h>vwpYtpSl4hhw;$dI)u}O4zHXl3Q`4ETyrJa
zVyU6M8S<W{B%xpzHk}bP^^A_YqP{E{>VpQ`>GYRDVP&-EX4%~L|EwjU^~<VgZ%7!1
z8&2ptH-bWKQ6IstxeE9m#;WTFzkRJPQ&)O7IzC9Sb0z^;bNb?_cpMCHd^6m24k6hK
z<GoJo!Rp^)Lze8AVMob`h#mosm-1q1QcNUyW*DOq$n2ggW5&><^<*df(tTW?8WhIs
z-Yd6wdmUQ_EH4k7!eSk8^_HV*SyN(+Xw89kn-=ZfU#FDw#A5&-=i`*C_nVCk?fhAv
zY_}{DfkRfQ{ga!g^$L}-quzgoX9?2<1~RV$%nJAzX68k5GDDRD&peF08J_tt5?I)+
z@Li9hDq!-PIc+5pyl6#b*vaf3uK)EWv6^E~(Fc5S+2|*m0_)Clwqc)vXz@^$5dp2u
zINT`PFNbGW5|Cf+d)Z`zKH;o7w;P^9+yTw$i|8Tdywu|LKMTXnOumcNsH2)}1iIgB
zSfUvJ1wW#)-3_RTwgg>*bT4g}C45>kIXw`~72kv?WqV#Z`VYWwa0=@#KHAw1j%la`
zrW6jZ3yc(oeD8}>GJ>q(Oua&w@@1yl;`YWRPp|7}2e2M?1W*>jEvgiiLx517%@jO5
zqbEORYfxge#)`LO`D_;VObtct+OLV?8I4kz9HaH}uZdDwtaxu4rNpaV#y4p+v(AH5
znZdRzs%njsSnppDwIy+P47ul9R%r{Uqj1u|P*PHK@(#xE_%mT!qyC>wt9;C*gSN<O
zDSS!{5HGWnpz4_l+q%&1M;OuU$}Yle6R958gP2xX#B^lf2EP7J@t51RF^G51Hba*g
zqRJn$(VO{E?qQo?PMO6AdR7in9{%%WZmg`KaM<?b@}S?z@{N9J3Nr)Wsz6=v%YY`9
zDZO^eew3j0km5*n$EwGRZ>hA&w^*~Ap}Ui>&llCN&mzs=6AQU-W0lA8l$@MO?$e^n
z>l#qouz;Kcul%myc$>p65)X4z|NbC%cLxGImj_lgTZKtc&%h#jS{S?L%$o#-fbGua
z^4!-ZaFbGy;Q{QIzyQy>9En*;7E;tR;cKxe?Zh0Mzf+9e^q<!ZCzrmH`a2OJX3o}_
z^J`g5%LesLii&g3Gjbmb8E}EylIOr#3&*d591}b0&K9xa#e7~sH-&Em5)qaDieqxD
zRp!sRE<j)1Jg!ze6Y{b-7ZP_Ca$pWsu@k|4nLnlo%bW^Wi_LP%hda21x4m3!NW84Q
zQnvSfGgFr%Bd$NaA8&7K9Bt;NZ=zqVUfz2AI-<an-oZpBl6!;th<1_Tkd0i_e?tFd
zP@)ZaYbMC^jQMa<l!dNl@%Kud2)j%TRHW=E!Fk)klU9MDw(;uup6RbVa$?@pGeC$p
zL*I*LGl7i99r3n;zsf_3GQ`hP7p%BS(yF4(v!-7vd)rK_3eW|$#x;iGf`}3-;b9%m
z=OPyFSxznIXv`vXM+B^(>((OtCo90hR7T<gmg^XBR<>3v>b#YZ&`?lVk4De2QRiEB
zY%`F7dAQy-adfi^+_YVN!>PEqqi+pf_E47W+-o{PRkLgctfbA34mD|(%7Ing>o1cm
z`ON5hiECOnlW>*orZr4P5AiFfhjcb|RQv28ZsF{^;<7`+bx-ZS^q@q<*z3E3FvhKW
zof-3IhXjoFqP=>T1moo36ocdBTzZ$u;^eqHA@Fi5@F^pP)*W7}{&3N|ZQ_Q_<M}i@
z&QpsMNKz|OU>O6~_uPv{15U$~js@cZ)X_?D2Yuv@BX)rLM~#Fr=5Ky3f<Zv?V`Gx}
zyT7Ck8~_oX4-OEI?H+poVEXP8fX4dWqdx#F$msURvn|}J7*tnb*|v1R6kb$p9)XUV
zRiI|)WbHCrNbajdBn{$M7)ue~G>A(ZzEM%RJi(HM0-q7N(H42{G#(-&oOi4#(`miF
zh!u-(f^@1;;%O3W(l@gfLrTFMDox-nEXvv*Q6bFmYB?5?;A%Ng#U)w5?YJ*2%7it;
zfjvdhlT8fgVK%n}lF-=NR@<k5wU&WArKgQA<HthNC5l#s^ku!y-&2LRG?=JA#&-eJ
zYL<Vo;BKfU%wx|9qfPgW3q244zu5vwwZ=vuCb(Y(PK>5^^Z@N|u|^0g33=~N$H!An
zxm06gR6Omo*)%@7?d$r0jyHza=wh{A;}?!H*=(eX+nNZC)SF_p(hjBV$T}LWH^OPN
zJK=c{G?+Hv!LB6}Vc9XgyHw|!`5H!6E8i01sB!7F>dM_fO<v@Irr*{BO=ofNj1-Wf
zjm$C!UK$88e;$f@wyd4EPDla^55f}&c6Ijp`#b+Ocx`p}RqC;C-BrDqef*Yfba(dr
z)7weA<ImM+qo<$T$H-TELa0g<wt^N?CG$p!t#9RJXKk{!Dxs_X&!#A(k(m0Uk@y7G
zR5UGh>AHJdPq-je#e#NCV9gpBnh*rhYtF-}ICPFfJP(S%eAEka!hsYotw&Y9H*p6B
zhyP>Lz?@^}Ww2-JDw3sKESD1Fti|`*j|uodV{GSNT$i{(tj&K-0ZwSn9lyepCLt!*
z7!|@sdPD7~*L-_y`GuE5xsY)`rTgy!H~X0875U7|h0kveo=wBpJMmj#ek^=P!v2#;
z^E!qZbucr|cFz;Aq>nBg=-}CL%qPQv_2^f)cs85dmvW3Mj~G=Ug;Pz`rua1Jtm$GI
z(NI;G;PUM`YGV)jOgqi?*vZvI@S`901QduchW(QTLvV-ur4OS50q9^}TePz{3xsr}
z()b3V-mJM65Rf(O=KO3CFNPMsY;3cxpy$7}&=5a&QdN2huyl!a7?oUliLjo%Fvrp9
zm5s}k$0e1^RzI9Gvq+uTiwneRqB!wWTAHBz^75uT=V{_zeKtXRyYJ2&pkZt)*!_DH
z1-!h}ML>=pylCyn8su|w1OL7<59gSz>LVkMn_p;=-<MjQ9q02~a}Xh7Hr>dfjIE|J
z+X<B;kA)rnB~4f-L{K6<SJ|Ek0X4Pe#3CA7PjPY8>uAr8#!t1}R70hxqik@V>ub+W
zfx~S%@ga<^w>Aybn`qC06J^?RVL*P{Ol@#_SZ>XpZoNJ^C~mao#)BTW-uP65O|v7?
z+ie{UPzKgU9*DH%Ktp`S<VqT#H!PUKb$<8<LcH$voIe0WHIcD?{ZTM%zrK3xtEu6h
zZ|a~Lhd22nt!rKp+l?~&5ZX<C<Y^@iUig_9sBL~2BBN^nw(dU+Ma=K8Cy)RCE|>Q9
zA5IOz)wWnVH1G49F<9smu^xQYgW!+S<2Hd3o7oMp9JK(FM~zc}c;fK=8$sd+K=O1m
z3y_cd1Q_}TkWTZQ0>VE4h3SJo&j8fOm6mbyU<H&CqaJYD8MB&x8nT7~jHgm=hCd-j
z#cI^7I8lwz`S5<lM1%H2ejPd$abv#9!gJc9&FJp13tphV=m;s!SDxAt6Rci;FFSO$
zKq(zYKiBpx4g_9?Hue5nwZD4TFwp%9#ihk%KFahC<pq&5yG7H(Z_j~7bFS;(reS=8
z>7tUG?g4SGL+UW;ioZqM|CoO&WM_gHomcxB&OqpsHBo&O=s=ohp}{b*6(a)+0%*}R
zlgQB#b4rvgYh%pjJ_S4s#&|fY0Pv7Q)@C41>jMm8e7O6P$S@{a{Crn>do9R=)j;@p
z7=maeK}JnXk&p-xR-uHVZ1BN`X~=-3AJUy(_)hBVM1-0;*kT%(mSYPcf^&Jpyvpp|
zCgVp<ppNB)5a(ma+Ymb?Z+o+ZVRP+55DR#pe?g%YUl=aeBh6l7dXo_h^4-hjY$-ne
zMY7;s;LSt=*|jiv-g7kdO$TB_QVVCLeJDi0!`}#Cb}($Vt!zDg9#F&3v*WWWGZCRR
zMU^v`g(A!mi6q(Kx(SwErx~p~TN7%Mjpr!YO#NR{3mgR`TomN42u^2;(Mo7`pF6o$
zIRDdCP=F??yWQNjws)a=dTqFpvim3MUjJzyY1!7Lwi8G#+iK84)|B``R4`u-Sw)|D
zYJ7S~vuHIv0mFix+2B!6{lu8guD(*2El54IReMB!Fc8<V)r(;ikqCcXyAS^8l=VY@
z?MrsE<cSG-?X5WH&aEVQC>>Vu5Jh?A^G}=lQHrU~#YJ{HGV1cclQRb1yiY3eXfSWa
z5Xu=oW&i&{)4=~jQwXj9P18c8|Dh=qAoBoV3ov^3w*WJK_g`+e{*S2#0C1`Cdw?4>
zz#d-QnMT%w`Kf1gVSxn0LFGSL0}>DX0Z3dpWT!(>k#Nt3_0KvT6nyAaR%~9xyJoZ?
zXTcf%Lx7m5(01m+{JT%`LIPLZXoW=r3pO@PUp^Bx_aSRc*60I}nDBY$QxTDqkF(-}
zfw;B{>9{pIeB=>GblB*Fxv1z<Y*POVtElL4du$PLqeW`{**uk(Bsofk0dks6Lt@>^
z{HC&U^-xPWguYc`OSx7t!dhNsc7Kv<Ct&wzoINj`I)gni^iUY&b_*!Q1_zmd@NN|}
zIhMiM8@RvC5-GSO<h4JOfIu<rLW7N7;cUQq-Q?t^zv~?$!4y%ui`iy_S18tay^$e)
zb37!<aEjSRGmNe)`*8SwkZN;`a?58lWyFI{4=&8SZFGO3!9Vjkh@x4(Ey`Z))NRw1
zvx%It#0yEkV+fqVX73gyC`lcaYYMV55M=T^68&gZw_ux`3=$S{)jzkxnyuc(u~N15
z_*4E=H98`S^?mqcvFpg{1V<;xSZOksg?!pF7G~xq8|$!DNhu^rNmG=>K%>;Fpk|`U
zH8UH1-GE(_D&*V_!L1J4%!F(?&p)b+LucE|^%(NZ$+F5LAw_ag?^5H{3O`=L_i1JO
zZG!`vrVF|o`%F+*H<R=2Qlyi!_Sz6U0_JM0>s;P>iVsY$r@PnJ#|6;nvE9{IWyrpH
zTk&d|h7evoa;qA<Ay~9D88ZewiGxouY_KoPo^;i>-<m_>GL!=g|3$g?E_k(vb4i-r
zs6q1b=Jd@Z3L701*W|?4ZvcLGfHa_IDnWzj_=svAj%jglZC?e+R%Ce@44_E2O2xa`
z(AMZ*4;UC$88fUz2)k`Z=saqyovcnPsYz=|<H(4DuEY#W9;<Ds`+ujZAy^n7Z5Ry{
zKnL|)X7lGPwxSO`i43v6=zkI!!NKI^O;k9;pNy=4EbOyRV2IjUXxg;@532He%YWsw
z$32_B)3~tCK`dqf87enY{p5nmP0}%N5n8%i&axTwYu9_)NKBYL_3^VL*-SAYC8hDb
z8FpMjNEc&Sva)1hO&mVlD3%nO@9LtScjHW-nFlukfBUy^<6IWASab5S?C+WUj%gCC
zn#^P#^r2<=^`W)xRs(u}e(BekKjhGd=$S=HvD%b+@5#$^lS|V1Z?dAizn0=I>S2rB
zWJ7kDT8xQz$&~p+5c<+D$L6zskQDdZ^l!3Y`WUUpOhR~C-DD<u(*6sFy*u1wqx4T+
zNXFaS{BJVS+zr>`F52B=ZnEII(rnID&SlMb$`1AXT8)`+eJ#7lpU!SAJ=z*?vf{iG
zw`wmq`TK33>Y}$^ybOMTR!r6+Z!@5}&Ywm^Kop1FX9oVF0lMU=qXA8`%RcO}6o&wg
zk^G@I0LEj-;NAlu{$1cZ{~0Cpc+??nGsOjcs?ZSm4W5*`AUx#62s-{-vNvJoB&klw
z_Hl%i#$b-#0gJk^!=~`PEMe+2=~-aYsTBf+uyI6($Ukd_qNAc*88P&Gj_c(8U4vRz
zg+>Wk$m^o{y^QkY<Y*~hzH%hFQprok6i9ILiqk4KnLCEY(<3=qUS5!q%)*0OaBLRX
z`9gzQ?axVxQxg9_JzV~>B<S7$9xQDH-D{1M#3k%)t_Vpoq?<?_9M9KAEdkg7qD+Np
zLnOsT24o0L?z$Ycl&2&WZiY!EKK&WVQY$`&6DOxyr>yWzqd>&P6&c)^?9#8{W|yJ6
z;r;Qp&Rmw48N5IKH)OTRSN_;y*EYAT>XfSVl}d_S{v>GfPpbc1oU{_1?43$4KQ3@e
zwP+!Drs&CK$=CPpyTM;~ws|?+iFFAxB=7clmp%4=9v36^^|&3ULVvj1v?!wlJ|sej
zsYQ1OfT_iHlQqO~VCDUE>oFDvF(r^S3mE#>fCz?cdZIew{*J3oX+qiT$h|k>k2NvR
zcP!BqJ6ho9#YX(fh_b)QT1Zha{S=Ok>IG467pD`Vl(B8L?C13Tv8~A71GdD)0S&+J
z1%Ald<wLD0a1N}6aD4zD|GxFbsYHSWh0N6tqu*>wC(@=!Y;Ze2sUX?;p^rG)__P)J
z!;pKWVBfN9YfO+IZ4vA1gPt|>`p{9ax;bV}=oRPdL$vwdoJ^vvF`hx>JH>Y!;U?|%
z;bZ)N){DF*`S=KSAimydP3D^78N_~4e0{JE>28jq6ZuUE@}0zW<&*dR28I_C=lysa
zpYyWU6e0j&IQ0|{8@$0J0rng}Yx!^<`9W`&t~71$Wm(xz{Ryi99hlqz-~&UVH}~H&
zai6f$Kk*3%nqrL^m<U*g_)k?08A!Gr^$HN<gCOvYVN-!}tcQ}|ju5R(`X<RvqCHkL
zwkLZRLa!w$17})ItFmv{n;3WtrtnYf$-|FQRi27nDkoR*RxPV?Z|7V{lG?TP_+3iB
zaRgEIAWzma<8byJB*K7dv$Tb;^dR5Laov~GQ*v7Zl$(TS77fuVp3k7`jq!jHk+DL=
z=1{vu!gLLi#&YBt+@zjgqBG1wetscb-&#XTo4AIZ7|dd1(X}?9acdD)gCfh!B))8h
zTPlL8$q`qU9oXl~S4PWz-1FI>61AS5t?-^fW0)tJsy~UeZP)8GJi=LKNeMkZTq6g%
z2_<~4&jx4@mttbfM~<Ssol04%FJ;Mb2NAD-#PtRfX1?z~L9Yo*u6WbmVD52qMti=A
z2K@O{AjC&Q?mFS?F<d_ymF3)OQ>1Q+%2alemUltFAg&!og88bPTC(tC$~M={!K;YE
zQ0Jl;xwyv}MWZNfV`QhqPALhxY%|q?VJSupgu>Epfwa+wGk_T|f<TI7I5qbnF6mMo
zqU5rV?o4?&#T$I<Uzqq$FYlQ`Oy_Wz8N0$=V`odXJnK~aYS<W-dg@T|#B5Og^tQ=o
zo#M<z@b>@fHLV`&fc=3@4T=CcOsf;GoFNH8v04*381|86xLW3@T18`ZBNTYTyAxd0
zx!nzBz0zqj73<QtCcV3hkMbVuP2bw9u}MCWD`*%NmHB@0Q&<(ulR6ntY&BHKM?2&o
ztdOH_Tk5O}3F}eE)0Sz=$QwA;98gC@>nIb~_{-#){f*AP`$--cEh^rtxR|Lx<kGxl
z_2gtm+064Z4guXFpwy9pych!V$0azD6$957lOa$7h8zT-(uP(kLrcEPFMu9So(GgX
zkMT%nVbA9mqlMcB7e3Gjs}`Ql*wv)PG=++r3G{g5Mg2;y)G4UWB~sn$<?48^C^!GW
z1m1JoE&oPcr@wbA7mp?17f%l9=$lOsi;B!4D3i~N&|Is-=Sy=ZDq8-XHg_fE6;%g;
z`=1tnSR%}9?0?NO^NRMfx!@S_qV=Ti9>xr&hLO@eBEll+0>LsY2oTgx_-E(`%(>G_
zw^eu!v5A5d$7&pvD85eR#B&PcBMRYYPJB1@rH6k5o9q>1P0S3$C(l&I$Ql)q^YRL_
zpeFC<<vqq^gbAufTby7E9>MH#HMimZlGU+8?Y|0%8hy=c@s5t-&ZRPg&l7*l;BX!$
zvN+NEWW^5-_)59`3E#%|nVc_I&ws2N{mOUr<6b+%OYjU^yrK6Wf%@|@+t0gagVLJ{
z3-b3bNxgBfyfNLR_r0mbdJsYPTmM!2RyNwVUYqKqvwIIp-v;uFyKhuCZiSVv_zSiV
zKHLPwDjfIyJC&>0seX8VVauM1ML=%rr+@pgFQ(r3f;VBlapFgRif(Kv*J`ApPyu&t
z5|;%!FgUA1BT)>p2Xh-yuO?F%tG2A@K6Djzd0bkYFY8G3(8YV`=%*Ax1r8(Bi>Vwm
zlfbdN;@5fVJE$QVW7v}xsu3?zIghPWhRh2*YWoLQZ4_E$<B$}PVvXiMef3la*xz1U
z(RPSo26W`F(tvI~9>lgRY~Lu>vj6stYd{lLPU>>O@hzici=wGdOo^CuL)Eh#Lxr1R
z8|%rS(V#Fjpr|Kt+x$?FOp&ubi>cdKz^Ae7=*;(riat5L@v?bc?2gIx!0u7Ech=@y
zfarS<-#r@<eK&^p2kfPiT1sRjaJ^6QiC1krLqR>$T}>qh*S&LjH1ukd0!s-F_s>t&
zi&P3U?^wA`&53|*_LgDHYFNM*B*hPGB>js0=S?MuuP*BLsq<?UaC=xORv(X955G|t
zjpDNs*PjK+=OBZj!$Q`^u!7h^-!3YUqXnr$>E$HuTen=dEY~Kh%O^S5u6@XO(q=)o
zd+--n=+HgWfR2r<oi#Df0tzW`5}8rjKno<fJMV@!g!`%-0}K-xXNqY)&VD!v87w2c
z6GaE-!?3NR&j1V0*8>W6aj+(^eXYT4ABJ$xR@a&K(~4Y#fX)T67dy^RBJrmo1UdMi
zGx*}MNtXoYNpv+uoZ2pAx;T^<zip{R9k%;MO37r`v^0qrAW$}-MeksnTXooRN{AFY
zD@$hgai&L(KNelHJ1BhH({FD$o?I7`2(3fDKcu#dQwr|^XMhpqBtN;AN2Y&a5HB`S
z<Adu@s{P3=1bX`v0LH}cScKSHz-(z^VEx7zZ@kk@qHinX4~Dh1=18nKlC*6Y4nb{Q
z@CZ?1S>)|lS|RmxnkZk!m<$TPtsIj?tzenq0+u?dA1p|oxgLNwLX^qLQ+yAp2P6RN
zB91ffXiGvC;cKgas@=x&ffQ1_nC4&At-%^{Yfpqh%!(1!zx=VX&9$wBrWo~C?rDuE
z@u<{Brk?Osh;9VrT8RPcZi0UiNo^IaqqqY8L%)Vy1f)d7?=$j!q=lS@-mF*9IXHMn
z%3W9%>;^u2>iiG*QZ28Bb@)j`$Ml)yF>Q0a*&-%)UuZz89B(yyOIeW~2f%mdl3Epx
z=7S9B&NPkOYK>Y~DxAU0y35&X67<8|<@}j-zVOT~63KuNAm6S|K*(JnkO*TQ#Ko@6
zO(g{@%}rk&$UIsma+h8I;t@f1>E)AZDS6!pb|JshTJp~>ZlNs#I2Y&1<JlN0860EQ
zm>e6xN%T*p-@8I3!bD5i+NRV<;n!|h$;#yj(h*nNXTdQ#6l{G3O}<ouje+y;Vd8kA
zgR?mKAJY#hWDe5KTJUM4b$sRp+@e4-=5mPLGGM+FPBqw!vXO&W1S_NI77&bo61kRv
zC5uwj7V9*f!iCAD(7($DLAQSfbdWwK?cO5{aSSpq;)-KmoO%_C*1<$tZ|_D9%p@oI
zr~Wp&;{9Gm52UTf`}+;iN^|b*n_Jk6rZeYM!>dH`Fjfb3c&e*QuEDEkv9hh=RI6R(
z+!J*{iWU);jMa$}rLNU2fL$58$)#cIF@cr)QJ0|_f7|sn=1h9#wQ6LQ-@X_!tE6p+
z5ECTzw*K}>gPuYvJMVKbjPJi(`7G>29ct^6425C4hl;pokEO;vP`qovEh&_<OcqHA
zh2I7}9QS$eAT{W;;gS?+DxP?y+|ERaZ^H0YIccCxQ~otG7o}Es6qhmZs<J894jpr0
z&=)DoPV3d$$FQEY8--@TN4z`1$wHgKASm7@Ol0jgFgl|C_fzC*!&9ioQ?9A={gvT_
z^T7@_HQ*=XC{d^XrSWrYZEy9gNjH-mRKKKggLa1K37ZO(l-n)cc<m0d_69oBYRGE&
z$vgB+9m`@ITTd&DAkmP(1-g$csl3i?ske5u-$(9o`PYB+@nX9EUawkh;pCPG>;aRc
z{oT>?z&Xr01RK-75PpKQ2I0H~5lLawBF;N^a7@)X^{uLcpf+!f-muKdiDhT#&w1`9
z$0)UzOqS*>i92y=$5ucsZwRnaiOta?BCmobMgneRr##{>3{_`m5_v-Y{8YC<IePS0
z$880wf1HT_6}a`5;>oki7QJW5Wx7@QYu93@LS5&L(>}EQth89GbS<9F6Kl+pXTAJw
z^Mz8mBrW}_dm0m%CLr{W<%Of*B~G;PeaHiJH@-(vFE|=Yj?VKp*NIDfOPmJeD4&?1
zD5mSIxC)GfyMxG>N?zNL@^(Nu;U&0v<f2{MW<T=M7CV_U>>BE5gucXICU-LPtUt(Y
zK)P9ruxSpyQ1x&Tqm$eea4SsJj|;0=x(3S->>p53*2sTCpmm4vSOXh!1i$m<>H|px
zD29<~Bag<Hna8p<f?jYumF(FVI9Nmlkmt~%j9^;{i#&Q2P_`H$BttocqgNZkY=-i0
zGMdTCTaDMAJX$jy=Z<!{(QD60pl;x{3(HyK2iv7*Cb(ZL1MZgTF!B|Ikk_<S%_{O1
z&5>8MO3f--mu#XOYP?vSv@bcya8zB?rptxwTC-ZBbkz6SxOLrruP(Km-etox{6}3H
zl4XS&HajZW_{Z6@`rJ{&P^UC2f<G2zaj+>$QU5+w=lvOYG3u>YXO-t|zFA!X(<jp~
zx)Q4`@3><h+i~G=&Dqb)Oh}hBJpV1~DH+T2B+oK%qYlj1lh2*OtaUk^<~MM>0v4$-
zY@|TGqx)2FB#{KmsAoXhHHR`3LRH~oNBqP(f`?aK$;qrt;<1Jqm{O51w+LQN2K9HE
z-hy+-b2Pkvk3Wq?G&&&{x3-kylDj8?uh<rsW@)G)ffu$7(pFt+@G6H7e;w_qywE5T
zIBC1(=rml>nf=^f*B}Xsq*`WzS9{_a(%auUg$ff-8)$O&_(f6ugb-?A2g7z*n<&i_
za`8J+&_53rh2iOvV`H1amywG~bQlvIJWV8lDSrwwub(!D3qC?BrPz;h{GbX6q7l-2
zKuFg5xoqD@^EQ5+{2R|aU+L$n6vIxP=7ANv5Hiq_*D;2`#5U2!s?+s~0s+zZG`GK(
z71N9}64i+L1Uz_ibvnvo7TCX4&v@%+8gu>&8A9K0LSSGuT_6oNNXK%nI;s(th{>*<
z#Yw3#tD@5w2Wuh;sDPcGIZ^?q%7TqbFu(B}zhftIt5fgp;YF2l(Ex?-RwQbpZm43H
zS~D-Cr%?IhW1MmN0rHh#hQM5HJ9;AlGM!|eBEc=XRgxk58Co)_6;)CQ+Of4YP4xG5
z!#Iy0Vcj^8A7SI@p~jj47?gOQ6&MWXxPbY{RtZepl<vU~TucF%Dc4ZOuSB;Z-{79}
zae*?uYc|3CP6FDQ0HdW-2tf>pyYaLW8nkg5S;`U}+YtTHdQvtqrW*{}6RJc4B_1vS
z*;jmVz#^sFS2~WRI&rHG6DrJ{6>>o%W|4&OhhO>}$Tsl5V(&8aYCn?i-VYPwoaS_X
zL{>MGZM^NXo6QAO&#geCPqtY%@ByP%C1D5(G+UHb0iq>|t&RxGc#`$CcfV;n$9Q>G
zBO)BEXMurNgF}>?G+q{&-0uF)r-q2p$NfH+LM}ai_1z$3m(Mos+QZe-@_G?wQJiDS
z+&-}tDe=v22wxdq-kHF5`y6y<TC5nhpdZ+|YnIiC7P(DsXxY`O_gd8+GW9~ZuuJ~(
zq&QVME;VY)dDyOUvHU#uW`XDeBSa9=DnNLzR!Nc;*0imX{zWxr@4S)40X}L--MfvS
zVxL?!75*2lObk!1nQ2vSnpR!o65|&NFCH7|V)#X22&Apq=Yig5KE{4s>w^iVfI)1m
zcx(YN;z_QWcE^G4)GhD&C*JdYrP_Zd!<{sV2eA^`Z&!Y`%RsJ5KT8^I<J+9Cfj~t;
zl}qP5LCZoV^$F?JN#~CAq-~tD0ngX{a%WgrvnKdy1u&D^_o>eLyO<6!i-5a6_U_Pn
z?7(l9&-vyOR5ii%v$(SDcpo)m-M-)aKX><hlN|4g*Eo0!x8_YAO1eKRglS^uty(Y5
z+kB+h)en6pAv1Ixc%-{F5$gw365BbVRV2f_xF8Q^M+q5CNDpQt7w*SHb=MB@-oY|5
zKJdGqdj)q)iohfWr}sC*y{q}V$-TEYXG9~c=KNYgYww877tg;5&jU1=S{W*CwA)cd
zS7BfdWw*D^GtCU0!f=1H!x^LmS)yQV0qP1h&^zGT>#Hd7sh*Gr7i2%&Skq_MrnLPA
zDE!&<_>tz%yfgC39u7XZ_irx4c_!KxyH`=e%Yswr=yCH4uBg9p4g{(!chFP!JkKv&
zZ;aLT#^s3}5Q^}`A+MaQ%!PFkkzaP-j72c`5J1Yj`IgS&cp953?hxENlGS<~gkE1Y
zf^AM&vEsymSb^rL1Rw}xJlhtR0^A8<*htKX<ND7N^|&#*hQw1;n4e%VYC)N>0*O#t
z?U(inO4e>EZWwKGn@(M2E<gx3JNJ26l_JZhWC8r3y1FuW+*!k3O(XJZRofm7$=#VG
zcB3eHJwno{t_?iCU(wvl0|tlM{=$>_A>*(sytkpCqr5l0EYA=%^5P0NbA5ehOCL4L
z7pp7TVVj+bo2hEW10c5BKL^5DR{pzH%GURx$S)CawzhC_yU%<gqo4xv9GlTd`F|}O
z&}@vm5in>Grc%MIEP@$e87cK<dxE*s=uIm8xIcmPu`q*$vfM9@;LsF&+1l<;0)KfG
z8M4=`%3XJADK|`vcJNhHfxNSP)z|7d1IVg&m${>~Y}vYGMgLXy(cGww85`>e|FshC
zo4EXPW%NM8rl92Hu@bgy-t4m--u2y6JFZkJWe~FusXl(H+_q)2N{!<`+CBDwm99>9
z$$4A~Gz=A!d_Wby1;hX5b>6c*t>tm~!qRT$^GMip9PNctJMJ@CY(4l9i*AKY^M+%2
z0XJ7C)k>PP9@O^O>M=eims2VAE3BL-1_jX{A4truDvSeLARK*lX3dUQd;R-r2OJim
z-1ckGeGg&<I^<RjFuv2pSsG6aJ$Q2cK;zBZ0K@H1*D+g*Y?8LgaTsOtgUg%#o9XF*
zgWbh3KT|jm=T3fS?|((!vRngk?a}Bx3*Ch(+@|uM--FUWmGne@_~aY7EB2EI)Wng<
zIBuOh5jZrkpxaf3+8+nCTH2DdBe(JwR3z3J%{ovP=VkC+)rn=rQF?*cgE0z=7mzP?
z#$X0TW+@(mym)Ir37ZRaSjf@)YiJvFz2X;CzHx#ix#eJU`PIcO(CT*&@0S0V1D#Ls
z^)SB)C%E0+t~MwOI0X^K3-v)V=x_;3H6N~$l?EeTFk{tfstrKT6c##zM~*Nho?|i1
zYuP;D<86+Yux>~83CJ9tHh<>hb;KL?P$KRwnFI0suVxDBX55`jy@9Sw9aL*4QQhS<
zNy=$cF{Flkkf_I$XAT6X$01i5t!a8H-~W-hDF_}X>DquVFDJO57nona1(By{Ii%wU
zb+5ic-$etETvu<MlePv&l;~}bYreJ`vz1kC8(nD8?;(myL{gYyT47P3_??y9UqL|@
z413svPKWFQeCy)=<zSRiiZO1VkelZ+c}IqRO_rI+<svcpM^A`vZo(>&UNyD}D!2U}
zB33I<_cZ7`cb(84Tucg=PSvK0PtwLl`UpO@5@S7bcY2|T**#dbG8yYqrlFg0`E5LK
z@64lWs)L8_xUvCgYpP%iVeh)NYyOsI4eVbadN+H`h6jg)e||)8-a(~>BiEHGiZ=gC
zXLH`Bsn3=AJyX5km1>e_mhQl+weblL+>4IA#fPT+BASIZ3^U2p{?Nm`%AE$o?k|vc
z=8H(X{wY>HueU<f$@-6ASVhj(Ym1&Horu8RI!<vmcFxy?dR_`p`)AOn=nkkEY!W_~
zty@-Xau0`zb|g6mh6GDRg&|!`;f@auxrq{onD}AgWTj;K+Nc@H>mT4*L|k?TkqP_}
zWNiE7#QXl{LyxIWk*>JLBTf_ebo|$YEvbJg9jSLO-&nYub7xHjYoP!6_I<~D>XXMo
zoN0zmop^@K>ZZat2O8oo!AqaC$$J8c)+%G`jdqehwT>5$6JY_M9_7>NF1vFa53HRC
zrZjEx!XN*5{(wCF5OL4uhZj4zHF;x!<j26wB*8{C@)Bk?B#_`q`4DD5k3JA$dU|zl
znssdxd<d|{UuEkt3+t~Y?g0`i)&zn&fS9=6V0x7%``Sw|dN?m5d-_tCB8C=Nm^LYk
z5E01Y+=Mh=a|-d`JG;eja`-C?tG={KFD)BEqP+6JLFewxUObTnE!$TkYB;&{I)=1l
zyIUmV`NQ!Jxx*{EarV7%KKd~#^Z19gBd+!jRQq@1ffqkh2utZ9PYJE&p%3UTXrB<I
zvc2rG0Q;6MY_U)0^%ir*sqP*++r+T*zA|pyOXT|j%K!ez$!pab_~FV3sCV#UoKI+C
zzS<0>ZRKIQ6;SJoJmK#_sP}mF=zSbEH8&HuXE38Lei9BJ*@rL)uq>TfcvoH8GGs~C
zE=pHb|1Ipua?e-`ex2A7OHUymqo^sq9caAxanIQFUuoWTlDcEh&F4w&uxu7Gr!*(-
zR!pzLLK;8!YqG=XTWAVRvsW>C8&QF@Tn}DyR!KI9?BBVFRTpDJC4fO?h!f*Ttv<rc
z>{2ug2f*V2d6DwmQ3p=@w2}w<DG~18?b=-aG`2oXWr+j$h36Wr(A92J1{j)IY2@se
zJ}4zPH<t*@7-3zo(!+@UVDz)r8vf0fJ!M(ejFM9^R_oX$`ct7BqU(lQd7-2r#ulCK
zDF!yIQw7fF2~xSvAP>Xo^Yok@<DaKF#4V&*H&T{VE3WOZ3R<+%Cyy;ocxz7FihFzH
zAr5Mug5G6u)Vw9OM&)FdbdND><wJoZ;~46xczqy?l|xVzjr>u3dKRf3K;7VgTp`rO
zF!~#!HlXbTg8N|RgCBp6lByq>Szb9G96q_M%uAvy-_@U0HkLu}@WFX0dwNDfI5_G^
zLxmq8=SOC~E_$S3YF&ipHQ;Y4GPX@VvH;J>N#R#&AZN+2d>_LD+beO5Z1$h2*U{T)
z;LYC@7VN!>$xLEj+9-*k3!0?_^6hP${W^)RzRli}OrwtXrvEB(KsM5POMf*kR?=C^
zLE=sK{f%0iPuG4sPHWh#0PZ){&BK9mMhXLP)hAw6&#EIWZ#gS(i=S!MMy(4`S37xr
zmZ;czOEMT?&%n1T%B9_J#Mj>6U>Jo(h!~Ql?l85f?w~HR8c*d%uaa+Tm)_V6N&=DE
z=L4TIZfoDjn)Qti*DoJ)0lz-a_k&R?Za*6mKfHZd;b)hS%qRxak3d#1iOPidAM}2^
zmlS0A$FjSn<+##IiQlELkO53(abC)ve@*X97!vm)FCWE!yV7`BC+rY$0Ho&GNkxBG
z%9oX2t_Cg^@EL_Kf)3L62RU{VbDLkYJvcTvZF*K~^OYu=>H$0UqjU0kR>raa=4^hW
zMq8|o_#d%*M3><7S+=Gfm-0uJHd!$fRf-*lg#<yGd9e$EqHAg(UQqlF%xIYyrjT@S
z$8eny@sa~Gp63D09?QJTd4)e6Z14P@mhOxNsh<xMP5ahihv&ex!7E$*oR;kB_PK*(
zv=-hzQwx1PC+B0*;`U0vQNH7gzmIyDDf-KZnom{kM<t%pIufwa+>WkOeBT~Z^g48x
zfirOGmtcE$yH-NiY9__B&2Y|pxx`&mR={l5?WeOpzu_%8Xf3@2#q*i8QgNL7lo4hJ
zXfQwRTxKG?o}yv~f13OX>nTdDJD;r%^Qs6CI_h4Gi?^=v*ml`@#$tQQ5Q@{Ujwt?2
zr>U1Km6D~)b$Gp&D*w8crd-Y4ZU(`ar7ZnzwI#x9)n>><1dlc<2-k)*o1{xyOC=*v
z*X0aWY91AJ*T2`#>W#C@Ai1d8m~s)8&B>WGuz(EfwsSX~(M&nEtioMxoyw4yijf<6
zCZ!TF9!@E68e{q~n~02=Wzw*F3ssCv7&<%Yq$+QaB7Hz{vF{vTXgdC8^eZiAhbNUD
zsg)8L+V0g{A?@^OX&F(;uj@bb>&2qmbU8hnpv@^<yuGV${EdTDIdVatJ1p_jL@cJR
z{&l#PA6kfI?`~nm#|>Vrg+A-n{8@zkJ}!$JfH}ENMFIXMof|m-zoJRP-;Bb_R9kJl
z>;0PXx|ih8%zsv==8yQoNpE_n_+`SX(E&y{Kuy?8)>d8Q{o>TCNs5vxaz?jwX#{7N
z9X<<SI(>5Pj~Lp^1x^Ho!R4Ed1OLUGnNtsrV19<^2q0^#DEJiQUmPIB3^NJ}?4u&8
zJ=xWu>(`G)P^Yp>I;cF6rPgVQlMJa^)|3m*hZIfRKNFOsx|ef6N8YCflKs@~_$GdA
zvb1N<|1*!@)385;8vW{qem@knNltZ3YZMQAnO)M+6k|*uV4QR{%S^5XWX=VBx1G1N
z+es&S4!cQhG}dNEql*BmMRU4Y)!O#hNCjj;pPeiE*GKV3bjrfqmCv6m<55pBh7m`z
z6XZqOuO@`_<=7dx(l|_qjB?l6ob$8Y$z7tFrHe!0>HJABkxSJ7m_pLQ`p*SbHpF@&
zk9s*zHjlc#l09^6wn|yyd~b8i;@b70WmPoC(cOPP*PZh1;Qu8I{#+rxfknv?=Yz^w
zhyOEXd1m~jm7prz!_)o{bvD;nt?Zy7(<txl8cZm4Kl^Na<!k!Q9j#A!VF+v69AsBx
zvrV2-djW~;Zy+e;sr&RycRbzd-l;vm9I;y0BnQ^mUQk$&6w#Y~;_6p9!~h=!nzRUp
zp<~*Rm@?tNqhf1bKpD*^H(mPb?tn<8W?wB>Lr{kI>@9sv>7GjitYFD*Sj=E;t;};I
zX2%+8yVUhNv6IHgE@-zDFTh`1j(W($z&lf-3Yz;ms<X$|(#G%Qb7<J{)3YkH>S?A;
zJy~GKi?t}?%CGYup)VZZ>8{h?4!+jGg8sHeTVszdhn$cX&XVvPo1nj<cB9_Si6<dc
zc(~5@yf%6qS{80UDx9j_rg4-7YQX%V!vfLmHaTxGo)~}HPFk4Tksh_M#Y%PWjI}dI
zPGwQLh6VErT_6ZEOiWA~{EMzNnARTgre~&p+w3Uj3M=X{0y1JT(uPp|c!aB@YRMtD
zlqQpMNVj1FQzVC|OgsWQG)n=vv?y*UV_q;(RKW>7dphTifuJFrqP^}J`;+(yY)+6|
zmQGk(ZcQg<s8tJ;X$DN8Weeq`owl1>uP<m%1#=D(3R_OO?pxTm>f2iG>mTEmhRL0e
zhpu!zj(6bf^w?k&<`9BK0FSwVCQ(Rly_0-X3F;hPE`Fya{&oIMW%_6GPrZHj=Daoy
zh();ylTS4F#=^c9?&y<6{ZU6C)vu*XWq~S_pzHIF7My0$>c7PwvgVc(X3~Y)<O?{x
zMrBo|8xtSjlA$C>v*S^sHn(*zRlj_CocGnGp#eyQbSv=P3ya>8<WoO&D0SI*%ZMYe
ztLef7bEeUd$^T5Zun~|jwu6@grCK*Yc3l?k7`FJFMNQi>Sp0*=+DzpXOu5X1gkaZE
zdgzWNA79tz2%UDsGqUtEB-(WXpVKIQLsJ-vr#jkCqPeJs$^Ejh?tJf3w61%!gnn9(
zRSMw3V7Xgje4@QhOLRp}l?K6wwN$zc4mqOVwp5`vMQ0=?aqU?JCGXi)dU8rI=AS@}
zes!dJ>9Ee?P!)Be#}2C5b3Tm)@Wfw=sV3)|WBXb_7E(^PGOme3#!2fKufdIQI(E}M
zPZf(+k|;u1rzewXDYtHaHrEUdP=d$c>nAGEG)T9?_0`k476167zM~3*KsFvf3tl%@
z&j?(V2Em`xl`c^YeifktM_y4ITd+bgiKM^&dxZo95MebijSX<-?RpsdGY>#H|BHr+
z)S?!F<gqa-z$?gyjq%tIeCLN^#Iqma<^`CAzG|dAk6<otjXIXMt=ZwS^LUp<7kI;+
zJBb(ushmxfm2jE^Zau;9sMM)fH^$D(@f<8#?DAN<VpkPg{XdM6$rN|)ToUfenCJ^g
zB!F(@dR#8_!FvP;#mAP7G!T)ZdM>Z+UF3MwwecaeY1F&-NpNkLKn$W&FjVC;2aJU`
z1L=)lB3v8#mI;3e$xZkR{xf%u@k<qtQlv%&sWotBQD5%W>t=L9)jb0)?-5Tpeyu8u
zIwcZKpNuB$9`#BzWWL;q+ANWy;HjIufHyxPcsd_~Ab%6S;=l&o@}=X}G@dZk#!P2=
z#t@6U)X5gb!RV#mZN9HD9y%QBn33XjBWPSoOFMWfaP?@9kX-0z>2-28YCE}+y4fD9
z*NqZo=zq{TE)Erc>_9Iv`G?M`5~5G97h~vm*WcikIOL=S`jF$OywWpu%F`vuP8pqw
zr-4UMJax<o@IXJDk$An(0k`KMcvLG-`j`4knyWC-$x*dycH&7T8%@sX>RI$iqt4v?
zw>L-10CjKb{JPnDvA#71xAY<}3%hYxV~b$q%j_fSw_*nxJu#a;bhLRpW=8}$SMs0H
zup}^K=>-Ru63b=#TJy>!vkSn4N22|{CQQGf!(#7FAEE`5J)nv)Py0Kc_C&HwBj8Ks
zr?i6tZzQ^96k<)cG+z`|!qvO;Ht27fo1nVfluhLJFt=1Y#rj5-De8<R<z^j%Hh=48
zIV{^e)_Z0u#N%y|WvK=)Y<jZDlcI~r8Z*?35%5@90<Y+JcsfGJ(h_b`X*EtmXX^g~
zc0h^0Wym~iFTAM25dzY3@j_JiW)W$7z4LiEnuSr%NJLBAS_S^`IP#D8Tgh{mE&~t$
zBpe<yGhh^h3guu(IXj%$oDI2HeL>lk!w<BMy3LcL#$oUD=%fi0hXW@KNI?(M%vdXf
z^3Tz0G?nUh@9~py_A_uk944c3rAlM>=*MIDMdv3!9MSz_5b}X+8nBMIF87oHh68{D
zCkVu|>)7xY6j#AAREy!%!Y4F27kI>;QuoY+BVMD2q4tgK&!<yhUT~_ToXQxu0^@B%
zYpM;BYa>rQZoP3lpiByUPDOz40>c*+0QpHW9|t(V_aM%}AqB8tAweGFAXWa#kWK#?
zL%9kgyL1&!dgy673$KFFO?~wxf}ryGVsnxYIc;PGDtefTLby=S-*$QhRGsPU=EqIS
zsPZStV6yh-!7tGo^!jSivZBr{TTfW%_6zCYpu>W<-O-Wl@Lg0hUvZ^+xoW0=`@#v+
z)0ByQ$P;Bh)Kisz%ugNDwbCSUO$nnSOCcS+Bh-pn#yLf+PEtBGD^8B?)oPQ%Q&E^p
zb&oT;oRe*dTJ^%MTr1OY51~_?{ny-&X7ll~WM@*0(w)h7iLvwk75YeSlfVExX&gr3
zcs?$czc}aF|2b_ObsI*~GXc7mEAiNSl2LSItK?GjxSXdH#8XP~kcA-|O%^#5%3i$~
zGgyYuf?vqn%ti>u!13^{$C11A5RV(Ln+6K7h)Vm$uhOh<cA6c0>&~*%$Ydgu!g)D5
z&4;81X?+^E%PeN_V|Q*bycvnFxkx5U*gS%raA0H!bFdW5UHF~@oD!1=5|Bzcyq#pl
zdS1%3jqf@?ce>5Du)Yr3fP60hI+%56PFm40E<Z>@3BJlODc@CnaD5C|>A-ZUTw->K
zn*`O;<z8ox(2Eh$(yU+9$)Q(P#dp2h7G=~*vv6UNPc}?9^AI2vuZGpA#<Kihs(CvF
zn5%6of7f8GDxDD+Mh-9O>C!x2MdY<|La#yqAZW2<am#vJ+nDCdR#*IH6>+5aN|$D~
zXcm%`R4{Ze%{`@n8}YK_OiA=z@4d_Nccq!c)2c4+bveHXR^ec(9C0!A!_D1=nPH(k
zN7J~{0F@88@$A!DVc|8WY-QEWUO1sddKkwa(4BPyM3nx<H~<_C;Yf8zxjt05lM3Mr
z-(a{ka%GK3i=;e|u?+#J2Uf*(<VQDk&+A@d1ldt=h55-wI13|aHi54nf*r0WwLR~R
zbeFUI@@ISV$zQw=uMD}Q7I<q`mn}Kua*}-5eNW5A9@qBEjX`j=5zXP$@VmNFq|e1P
zm>|@L|Ig~c`}aF!G`{oeufIHczghb${z;#Gc=g@G3?TpdgZJ<^4p#Hs_NRwuzbc-h
zrv|%MkQ*;Qv0Iz+>iQCGZ&iSNfl<4dd0PNt5bG|`;Mcw@m+_0YfnoR7^h+0&mCL!O
z-Xm`-t%eavnW=>=3dv-3f|;g(5K~){UTGHRuG8cWvhEZt7m}!}$J<+4AX|-_)O=%x
z*4*vZMk?=s05OFEgP**y7Oz*{{(mlb6&=ADNN^PR@I6yUHB|X^QNHRor>~ou)j8V9
zMU@g>OM#IJ)rF?;Rilzx1mmB1_LaDVF^YpIYQ&6SMqy7o8S#vJWeRD!m=epB9_`*0
z7O6r&s4+d@XHa+*OcTlwy#RSq24f}sBc8sjzX0|^f6wO^7*nG5BANzQFKZVsF2aGr
z=8s${6EuMclfs`VelNg*27hO^^#0-h6V~%fJ^Q7m{$Ai0zcz&L-#z>lINgISZ!2YY
z78CmJZ@}vQ%iFYhk95N9!<zRJyA_}RV;aY^Pd_$KI<58*^93WD;?nL*#lnu+U4#80
z)3xj>%rpfY3WyQ+dEh$zOK-Jl!NZ<(>{nN+PC25dyiN+!1$R83_F?}Er*MG4+xQTp
z7A7Hx-M)7bqKu6(aqv|=!~f63+VU4n9Wm__Vt-ll9z5{+gUrL{0_qCZ<`kA<trjLV
zZl-n}Pe0UV7;Vki)XtcJ&ZhGqv$0S(M}LOyB;Lg+KBwGq(L>-%@pUjA&PQGl#q*0x
zj$469JdbCWn4Ruo6x2|OX8;;d8ob&d#O}!?NMh8aN;&ps9BMO$m%uNmS(96M^N9ft
zo+}`K{cD~6uMg&!?auG_VZ_l44L7iBK~h)K6>IP)#Jqn<tD$cE`_RijlNaW$ZG0YP
zOS%Bv5?W!m?$o!U4&I>>*ZkEIAj(3Z1}Q4?G#@c>4uYgV4bPD_M{#rkfBf@vpxE6f
zoA8~civq{-Bz;<|I5|pvHlD1RgseNWm}TK-d{qdrh;{J?y6Jz=zjZ2CTiSt>+n5cb
zolTS|yN8xTz9GRh-)i2NM3q$N%$LlXl1TS-G6%(tF#Z8+*;4^b$GQz?&%Hj3lLAJb
z#~1S?!}6GQZ`R>|wawba=8B)<jX`e<{fU<wo|mhlMLF$(ruJ46-yLn7<%;%*-RmHt
z+1DzHX#JuFB;nz{WD4o;zx#Cy#B>K#+&n%5>b4UqZ$+O0_OTNzZfu_c^obKF?2?}W
z^C`kK!x-5BtZ=FBDP2+o=Vx&dM)u+|h`Gfj01bbbT)L-&QBOF31?+8BQkHBm-xWfe
zOKP^%9yxE`EsZJrZd<z2FHx!)GrRef_28U5ZXD>~<YWKF3t;0P=>F@AH6Ig@;I@oW
z3ZHZS3fi$TLl74hh{JH2%s5T&Y<ffGfs4f|<1OAElD}fsbX=g|K;>(Xm|d~$xD<0}
z;NE8w>f|88{}yY{vQla~P79HY$)Zq)cC*M)$)-;p(``K?jjv#VRIURm;tfUsAvKCr
zhJyH1s^#fmFdFuw`lX;FV@F9<t)wgOZTt`D8cP>Lyy006{s5{6qtxb7I)O%)zg8qo
zSN4Ui97x|57+JbWfB&%a^IOXhKX)6a5KMQ*AIguj7H69J<to(kGBphIFxOYhV$7~u
zaJ6O^y2ag^x!QY;?m_$Hhs@Y5LQ(A`!3@I(^r8tRi@t*8MS=tQb)#A@KxTv1yN%;k
zy%>WjoZDd0sFgk%4bgC5O}#?|tvL~y)?R|lwBTJ4+G%z%l4bAcIOmU4oE-C{**xl=
zG>*DfRAgo2+=p%D1LkW*BSp;OO2<ZKc+42ZoY~?;RxRuc*>*7aDezxOS+D%_r(Qgq
z1rZu8B;HwVG@YGc2b7WcnK&z+)m7(U+6ma1N@;)Q`3bNU3V`WR6jvW@`KQ30L)Q9a
zJrm7{i01aibJB-i_9j!1O0Rm-S=XGT`9H0+V%G3^GsHo;lVwQ;6?!_4fC#)|SedHq
zGa@5P@0(Yd3L8+GvBdHdPdC6lptT=*Z`()hZu<zc*0mcaon}t!p0oV0$;S<av$14W
zqq2!*V}WEgo%dm@4aa0=;?0uhrP7~P1O8x^SnHB&jpHbu#ZicHGf`9Fyo+!by<OH8
zcee~nr$Qv(4w+6Y8dt6NhgpTvZvkQ7h|0RGVlb!U#7Y(K_uoDDEANH3S^5@EUzCuz
zpo~Z$8)0+>ve`hVEH0YNRc7(Crq7tS)SwJ=S@it#BpzWVAwpSxCAbP@W($jKP&s>!
zTvbhq&cAo!Az$ovsCe4|rqX!TX&;_;o4s!9tx3h`J#XatF5^v_+NLWDLrQR^r9mZB
zvD6$GeNkA)FRd0vjo=as;zn=*SL6uwCLcQ@eNzxU!fZ9`cBUm9181<aa*_zVe?(c@
zlN4DAZf>+rSXW8*f|Odb-4S>{d0U(Ht?h@YR}ShXr9MXZz6zol!Vi>mWNkkAO+_d0
z%E?j&zVnU`^3vuwDHjr+BM>mx{q;1Q1yyewM5#;IzT>s3_mqe`cW@D6SA<}9+T6f$
zo4GX;s|Zz?vK=$RH&W*qYhTo}hoa}}qti6YhLzu5pDUG9SkCRsES=9Y#vWc~8FmX>
zr5qYVTcsSnV`h!jEToAKbeemoC(YjLX196tW7ZpM0cv2Q8(?ew$$U9xjKW0&Hi|65
zi&bnDv=|j`gB9rhJ|boB`1H0&0in+yQtIlP6)|JfSU7H@+)^A_WmiU&QR~*&g7Zq_
z0A9DcKQBaCCm#9JFxhz3*#|BOEzU2(!BR}=k_DsI?-yXkD6;}abm?1QqSXN`oW5@D
zyD^aQHBBi;g?(4bmr>wH^GU`5HHoXp^9df_%NhQ+TKUxlq)Kfw>rHy|rCtu^cnd5R
z>!c%sre;+<NX63uJN){jQ_!#_PK-B2Rzufi29WbOo`Lwu9?iMgbC0iJn%spK%xh7F
z6(-qTbyWvy&YsK1^}WMp<LJ~ls~4s#aW`3_>%@M5X?&H0vJ&Yijl&oO!H+#$yOJNM
z*FU!@h`=EgQBhCw_J;pt`GWj`P2VfN)wvG5DBvXE;dn9%$Y*SJ8M3#7%8HV%Uz31D
zR8bUjWjbu<X=Kqrie`RMokbM0xZWy+vk1b9^aGOjPd#Lqy}ef}kql;hiKidZ-*G}Z
zyOdazI6d<JdE?<xX^Af{mg`};We#Cbu9lV)pI)n#GA0V8U##vKLwjM3u@npn<$2wM
z1<qrth|7g6eV2D6OW$S1`rooe^0r@QX<nJx!V5j`51<O7MPn}IsImy+=>}tmFGq!c
z;+{AU5_Lc78l`c|>BNxBJgs27TaHZduA3g$$fDR7oQfwPn+ad~0y}_{I+~$ic{~zD
znukcB0p|dm9?BU)DF~5pd&T`><NyBLL&ZSKx(i%4)YZ3j)3IY9L9Bhx0~yw!ZX7o9
zE{J;Vi8i(2wp;YNhaEfIhu$b0gebt(E@B0+%vIbhsF+)3#-`+;DpyZ(v0zZS0wa+`
zfpi9KE_6}A3F!6I4Hj%8AJKXpCW&8tga)5%uVmkzA>bQaUQ5bEu{O$59~(j0*gFbu
zu9=2+zdG5EdkPok4?+}Xgv<NC6;8F7TU(xw`7-->F`Q8z7%v@ef6+`_O1yFpHkAFn
zo|sVddfv-jZ+mlVYis+kf~GyG;*kp;wR??j`)zBl)9Y1iu-u;EiNY$!26ux~c_~$u
zsbOS|Jap>Wliti*p8(R!>CejMbGrZ%m$+M8#Td{OgUwJIJuK5Bqgt-(BdBGCDw9kD
zQ>Z0nhj2Q*?D>O1*{^yZE8Zg{bc3j;=nJxGX}!0$dJ6GQC29J8Wvw7grb7CcA+6VY
zd$nYC132qRXNxHf%H~SZtm>&H{@@Xw)Xyt_l+GePxFKKC9M&IvtYX<Jyki6a6F6-A
z)ZDM6RsG>Cm||%FVb6~7h8nZIPo=R%la(*F@|*!$RG0r{Q<vOCODE1Ovvk_n>OyeM
zb=71=13h6|D@{(>1O}}Tw<+6GR>{s8wYY4?%tE)Cug=d$UwF2-m*ieLkz8=3gq}>}
zs}MwU^rqSOr`KWXaLy+_IOIt<RX%sh`ZJ)EuP?*?B{`34X#RP86;#NahQNuQLIG)a
zI+HLuB!T#5f+m8LQyOy`<fw;x1yz{6ujejVM&bE~U>a?x61J)uXhX;DvHX-DZzGF;
zyv>C7r$1@#t=_G}OWYzJz+Wt&;5P<?$J^ztDpsDbBeR0Z+s3meE||Orz)Obt>`4aZ
zvnK=--e*17<Ajm!q(k*`W%`3AiSWLl05SFlS7Cz22Knht-#IQH#$!J+Z_T)<85=1Z
z9!bg+T$j<i+uo7w|Jds2Ku6YXk2$t_y<YXOFeOs1I80UwO5SnUDS+(oIq$REGDW|?
zg+a>k>B(!22P;i<CN%yEX!blaA#blgnNw0;FMRfwXTN{^%d_6IC#l4p%iT-KdPiuW
zux`ucx9#@gnj&|*s!~q!=g&0=%K58)$a8s?`lu};mi_io_oxYC#!3XEOMed0XdpSl
z8N|^Hx&9*JQDyE-K&pA`9&RN}y+7*yx_|oicvW1z#|m8IbMZw$o-ZjTg&as7%*REx
zVpf@3Ak{=CHf$T+t$@$>N9|vgZ{KPdeUDYrI-i464P-G+kJ?7T6tA;O#HN#zz&QNr
zI8Dke3A*!m2N<_C%2O!EK4okiRr>Egcr#TO03s3p2I6ZqnV)|mshH$riQ<zQR1Sh<
z63+O-s7JylU)P}oiqqXVY4#dN`@PP)#&Iw5IISYc-xNDn`LEVX;vIT=gh(l<O=_NB
ztM5zsC>BNpSyDfF-)+^-LF!vHkiw7`R0RzUeU$2<LUQd-df#ok4XO`YM?Vy*nBM1%
z5|(~k3Xa>tSQZ1p@wrn^hY^L-ST^n7ZQmaFZ?~`FvFhWyEfkW!+e%M-xBUp!0MQuq
z@&G_qy(in1&w>d=n1i`>7m%OsFkgl{>#eG>!QJv%<`};c-z$psogOX8yELq$rQGJT
zJod=amA-ouxFbv63J9uqS)|Wz4@H$$*)w_v?UTLYS+KSa({nFvosV>XRdEEUHMye6
zo%+7X_h&JOE<fIeby8Vg?%9*7_m?knKuqIZ^+*52Ei4+?&qio}S<3DzxvGU*#^N$d
zcZn~;ukXfD@iUK-@B%~peY`tQ#ZRgqHK*g_9oXOPx!*mEo}7RG2o#LI5Dsp^8I9iE
ziW!>q6#vWfAEVUmv?Z@jTZi4&QE%_?|9(OJQk?YW(a;a4bd$P*hO<D&Xv68{RgH17
zfp2ULV}oVw5M2%5N>*}p1j3uIw+&Rf^?uS<UvB|HC(ZwJ+B#|OdoR4L&8_XtO(@Iz
z_*!N(qJP!t4A!tD3JQP96r_K4J!tCm=%CR$q5EtyEqR_TOaGJ~;J=mp%XwtK&e`bO
z<qOo3W|3PcC(X`(K@x&P5|4T%4SAuC8r9mLuc0>7<1(qJO-`R4TGNw0KeZ>$oG=_;
z!9?M!TTD>rIG>5*-Y13;TAKzV%tnz7n3FYN`ez&kHEmF{%<;fcI>#)P2^E%2O?8M;
zxNAk0Ojx0(D-@eE+2tI@7TE%+VUszBslg8Vg2Zdfnh_|aO5Q%fE}GpJoP``_3;E7{
z<LF)1s79NZ*>i)uj||GvTrPSMrn(mwnf~AQQ7)a$y%Q;V$cX)9E%+Gp(XwTcot;^>
zhUOqk2-R7>kW}$r&FT%*z(~@;sEAgjbPr3T6-qI+W=lHgHD4rWisvfgB*kn&w~zua
zdNe+hd6{w647$xiTroWoOla?Id%t;@LH&EQAec?VbM(9FmCL#-<u!8()+*#^zaV(J
z(ZC-}tYWQ+cDff+414Y=lWz3NhFu^;KP4N_rq_SYRxmZPOJ6bSGbh!IAdsF{ouy?r
za-3>i_<PmZ`{DIT`xFkY5^&;+NDCL_EiKX9E-{W|P9(?`$y-MOpTIr86nv!MQKbGZ
zufx#;FX(z$ry@G>$!rSyxmj+V3W^CZ7sbeSy%|Nta~6hKG)im0RnM*{W*PcDN*{;M
znYEYgCOv*_JuI`fj0;;$>eA-ZGWB5FsG|puW*Rtf6Cq{Bgkh_JXg1q-8*5}sIprO*
zo{{toXznLhR7j_B$6@Q0b_#gYZvSB3ITl)W8)LR`nZZ?R)LTGo===^x;aiZKkdaih
z2}wu&zAc4V&{7&PAD6eDRlV<BGijDuG?!+%KX^9rXY2LRE#}keUGcPOuNr^gPcYL0
zJ7ok}OUmLv7E~U$BAhSy^W6Ck_oVUz{917rNCG;7aG9#7qEE1MLSw&i+-?1cK`08U
z4*<{8_(nI851GLZ5^9(nIiomkMy~Yjln{m8H#gaw$86SLcE9)f=(N{qpPuZYTXdm2
zZT7__z39bJPn>ms%_SNGY;mEf*r+9#6J*N4PcEXlgm%nO0aS@{X*3*}H3qOi7ADs4
zxV823`EVHE;w<y;ifmWqt<6oEX@1OViCr)4b-CF(`mu3{=3NM(>ZuAk&qG3a9;moQ
z4=IeEjJ$`9^eB`jjJzi!H_@7U0z1_7tHE2Den1GPBT4TBb55R~9CdnoZyF~Qmer((
zFQ=HmbqSms{lqD-!+aVf?3ATLt>B3LJ}~t#nUMh|jEtizp(XXJcKh&;I;GQH5_SaB
zktXcMuH*j2^VtN`T0kEYQQo(Y4qC5qDZFhQ?RW4*L=?KA!nSNsa@@!tZA|9pqYy1D
z$LH}Vsn0&ngmj0yMm)aT)JHZv{xArqUTxy70s|}bCtez@8!8PyiI1KajnN=UMW%!C
zUtoMN*u5v8yx(EVdsuzw!T-+Ez}S(FV;7C3%np_DezyX4zvozhSY^C&m2Fi;#lej}
z?LfDH@L#@6JI+=iC&4&|y#_-QamLgXS&5ED5W@cx49+?YR01K?#Y{QusZnG1jPz$W
zgpcojGv0i{q3aIOLE$-tw)B4IQ0G_P+W*6z{_@=#5AK(Ukyg?nFbiRucva8^XKVQl
z-z=~YL)5I0S~Beex$JU;O!!6xgltSIB+4=f0N+^zfdx#At=U6aqpLWp!>%!`m6Y4e
z>Z@oPUcsd4WdKBT%Vm@YaHn;I*1gl&t>~p-3YmhQ+k}w{UqvMM9BC?@$&J;AoLo{6
z*UryxQ|a-$-;4o$vg4565}9|PwI!rfAeQ2*bP&6lA$=(l?ENE{eKr{?AYX<Qp|Rfo
zIO0oD`0ql1x2G&_7Pm3Vg+YNt-`|BKR-2k^b22w~l0{aYwcHr*FkyGa>^%CyxHTL6
zg4ngj`6cj6>XiP-Ptf7zb1>U^(>y%<w6+?OtyTrSI!zk@d2A#f;iMSwaC=o;+GEmK
zq#o|3UA-lzF%!+1oh|7cPda@^w(BcTi;lHCnZ~o2Ipb|6h0X~aC%kYHGHui^>tTf9
zsxb*VX8cJu{tgG)zi;4PvvKio3DTWC{sReDw>J%NrQ8}jD`7@p|AFg1H;gZVGCBzS
zK`0a0pM^3YyH(MqhVtdmcBi%Y1yMJ<CGNi1O8rBSmc`bp>+QSW!YG-+*IqIo4#SV1
z?t}ug%`>6k+YDU76KST7r*S_>5)as{Qb47*%>CiT<zSlhLOcGydK}MZ7P@ty^6ylM
z*?jVc1>=8htIurB8D`3qj>v25i<rmM0T<(mcOFI>^EG~BJ%d@4->`cOvlvid^SDuO
zG<w>n-Q&~lAB2WuQfy)Nof#$W!?c!^04!q)l!@4JpZ$Oj57cZx=kQY5f;?}>m6;-6
zGmV^f6&f|+r=xKG2~&V&`hnH?u>->1Ud~j6%I~?#5)cdl$trgXcKX;+vvb_sYaO(j
z`*zLjV@J*APu-J7T1)lMeC+C}#5vE7N*=pv{PdF(4?q317!g1H#0_N-A&(cM!mOKr
zT#O7=FN2KYdWZX2Y*0OUT-cCREp4c{+J2|q%d~~njK{9dVGf2o=JBzk^vQ9f`=&=7
zF-sedS6U`Nbq>47C+)pVqw28(2E00Hx4YSH%Hx$9WgSLtq@vo$mw(kd+HalY%JX9v
z`WxLwrUId#A3G|vj`j{u_nT%NtdKr-PnWAx{Mb<*MG!}Me!LReBr#JKg38yFui&32
zy-X#nU_5qI5(y&PiV`f`tz;^xR*Ea-pJa5W3QSg|y0BvF$40l=!we9e;|5(rXUcl{
zPo|L!2uFLi5T#*cWUG8V+3|2gHrwV6x@Wv~;dnlaFM=rBZ?V>sw~l&);Cz0OAFtG-
zw~ktvY$7SFMQ<IoP&{(rR%+qff=V^m>gN&WOLtZ3>9-52U-bJ0ZT9$WQC*{=qprIm
z2*{)2f#O?7rTJ{?_k*HJ{MJ$Jqli!LYVy`4J;j-6x9Y)LR~;2w&s|4HLCn|e`~AzH
z7Q>P6DvakzrY61Z>9?->A3rYWExdKqxqs31KmL6`(_j!Lm;?s!u`viH$;Ny#fKyM+
zIHi1U8<->T`|qFP->vVTZkm7T^W^dNe{4P3+J5%*>G#`@pZo{BeFA^H&HEVOvd<jG
zKJ~o+m;*1E%@>qg^8UZ+=i6^K@C<tHCzqukn<u;9ZIw<>4tLisXS2!9#>Vyab-nLL
zadhoZgL*$6Zw%t=XcYT{ymq1X-ERQlQyuVGKmX_UT8S^<_N4;GG58K(ua)}q>4?61
zFTIV~c#@uorD_SM<m1&ph6S%N3+Hs0<`^1Zd6`b6@3<4_A%Gc5af_Lw+0K9hzp_d~
z8S#vvK>yN@E`p@K_V2uC@9~pg|Cb>>+ql0rmaTvIWY+)FCr`is5AW&yb)oq4zkK}{
z&p$7@{ynsT6a4JilcM>5`uJIP{-1rnz4ev<e~Hh=ddXY&_TtISG`zT+dF6h^+uq#9
zxIZEA!eHdRo?`TwsrO<m4+d}?yO4)yW;pgkeh4h|B|t-f4dAT=FhP}JFulUiHT>!X
zsf%59Q29o=iphUV<x$5cuqUC4ZWvF;z^%y~H=e3I;0R?L4=~`q3XP8;4}&Q%aCA-6
zj-q5ghic1V48(kmI}jX$2BEl=LZxvq+mU{GxxSH_Q##d;2WS+Ypc&rGht5(6Mhvb9
zuN3m4coz19Dns))Wa9_`in>%cOg=wmub|cb$PdS4)#vUCG-)73bp?hxnD+x$Z&WX&
zQ+Mi(#{*TM262Cmeh9vrxefIBrg%bQG)WBok>RGRGf0{P(c?P`LY+c^3?QLbG-l{<
z`jn<11S*0KGmLo3d1lWkOVvQ*I`)ES051b16zIb^o>3S~K+g<=txQ9pLAJ6aOeFDe
zhC+==RQS=U946BcNp6ZX6)|-siHraXci*%+UZ;J~eb+c?dhq@Dr2S)Szq#+d`Wap}
zy}kDF&nK<dZ@S)__90$ec#WfdczV=5X}vn_w&B5AqXRY9XvM(0#?jAS^QU7th;+R6
ziPw62eAohb&;TZpY&APok2OcFqt{grV0cIEu6Nja+v-BGZo7)@BCvc-uYKUXZJzAC
z!E5_ht;1ILXKM1G)jh)I4xqh;cicGXw)RdB8z<iJ>B(`sL(p)1`>oF2VWai7xnGAq
zK)YV^$L3Mj>%3_k9%hEyes|P7!2wufeMPViTWERD&B18*TPMxEE)FaGwg*UrP99c0
zQrY5{=1)x+QRC$2Du5-1)jsMp|IaCugZJKk<89+LjIq1~JE(X(J!!thj<*jG4&AD>
zx~JWy_qyHQC$x8(CqK6Knw{s~VY@?!JH=#&sN}=u5ei@pUc>iSr=1q!kC1-UZJwN*
z9(P;qqYBLVJHQa&paHe_3D@l-8Z#iPeeyHHMP$%aRK0g^n(!Rv{78n^J!v31&>3~F
zYnFso0iRuCu-;Mg^<nFE^JuS$Z`%myU8~cq@Z_~RSf<5|ziU9tr#O6?H0T?DHE6j?
zQ|q-3JPxzAFNF~rkVK~?<O5GTr+aS%`?xGNN~y2I+Hfo(7}ku3awodx^oel!PLxC(
zX<)^JdDKrl>j^NhT?tuIXNmtHf+zfyeMRg2^m*TWE-qd4LcYrz=+j_6p%?sBo}+sh
zJ;g88(x>O8(#E>iz6z#OV0o%%4^v0=ME0%-I2rm*k3wKV=QqUPD2XcItZ;;#VAjxp
z%K2jJu{2x}4CIT%uoXaeGbocV{dq)ch;|@<gz~)fi3WQTP#)EEfWUci|0c&bakx%!
zSmc!^O;9CcEcnjZY3fCOs1+kBP0=(jn(D>Vy=cl^(~i$R5k9^RhZNWCUF+!ac8Q0)
zei@3+)p7)t5eP;zgVtjzi)Y^_16bbz7L9}Px$OwJ7_>r3*{GRmL9kKein<uSMr&DD
zWbo{?1mGE;W!S=#nYc0~=uWy2teTH<LY{1@y8sR+!EncQlab7sxT)e)aqN_TwY>fB
z_9;I9CCTVsPJheJe~+JRZhxOW|Dj6o>-p~seB9^1&A-+#BM68e{^$x>b^za^VK@pW
zlh}LVM>8Oje>zWpIaphp0_!*o;EdoM#qo4-IR_E^#iSqUAFILoYgG;jhyHo;^{n~z
ztoik<`Sq;%^{n~7{j4c6OXjSJp=0rpaj-<Mi0RBeY&zZf(=(|l;io0gY#_c)jMP`I
zAQ2*Tnt=-^K?IT&Nmo{r>IL+M&b{e4psB~(j-mC$lgxf4sOV7xYa%sc_!2%)HqlAH
zOuzPk%>^H4-g>`E(KgY+z3OG9bT|pJzq`jEI)|zr%iVA!Y$QqC4=Fxe8%6;|JovA-
z*Zm2@_EGXdKJ{|5^gD%9uHa-MC{<}4`rhl$KFT4K4xRrs4-$mZIcimr>mHo~E0B89
zS={-j<e~Lkoy@zK;TXCDgNg#qh}xIllgKec0|JV?45c<OYFJv5Vh;Mqny&`_%&%i>
z5(B`?U__&0ozINxCLYj;8X(r?l^!Y$Qx8$sL?lq=cEHONh7Hq6XKdJm@Fa&ReJ)TY
z&^um&8=618pxrV-ckydKQP42wE1E`N21Bk*^+cxNe6X<V`4P2?WV@j|07tpmoVH)9
z>vA$2`N`}sh|&Rg?~J6lIKGj86HL=FP~yO{1h~49#8QA@YD?1q65=(;mnTp<j~vy6
z)WVTc156vdi(+C=YOGFanuA%DdL%eikP_I3M+35F2J~TyR6xd5YI-yO1N3+@@==&E
z!g5)Nz^+bkfkzkb5I9hsrU)j#gLn$t{s1Hbka5^h8Y`QtkJU8h6R1rO2?Xu_ikL1&
z@wq?BW(r1`Y9v`-FX6|CL{FbH0VgB_9ie<80xHnG3g#zMGaxTo)yNBPtG-p=)GT)B
zwU3)eNE9k+>e1=jSFn4$@HRhgfpm|b!_v1Lo4|X6u~b`~9x(gf-pS9$-8Kaf?HH_(
z7;14ji{YvTw|CM4VWDx@>%hhho$z4o9KxWx@cwxTZ}mZnB336aS{P}^D75a4l%}Ai
z@E7dCv|)bF4zKv~h*Sj*XpKH$ssLaUeN$G3brN7E!Xj9QfqzxdFWzSqM(hwhvs)v?
zTi0#olP8x)RpPL>z(*lGq|IAlqY#pW!&TT|dJ>oxHe=jCux#?YWHl<A?0$@8%ea6s
zSRikIqYvT0-u{O20_a+G$nK`MYc%COA`rr~Faj6C_8xc!d7FC73@S$w*!mOYyUmwV
zh|=Y_9ag0dpBq20zohb#k>eO}QrkRu1ZHbsb=>YSta_2)O$|bNe-X@j!ex4jxxfzf
z%`Vf4(O=+uop>B@yjGmO8)U-7gLQs#VgB=^?(N4I+e89a!S3~qVy}j7kXc3h2Q_j!
zYBJJy6?&ujnCGD^2r^~{72u{$HXfGO)7P-~2((H%Y_qnE(cLQ$!)3~mi<ZNXf&>F9
zfk6r`;m4y#j;W_5X%SEuR?IQV&=ME!EmE#nc@|T2sbzwbQp9nI&xesnGc6$$VE9ZU
zrQft{CXO@AA)v`+teiK=4B=rtS-J&XR@+`y-n<M(6AZE>KZ#`KeRa@>L6~bdQ~9+e
z`KHh5p@hehktQG^^)J0LKQv~I(j0L|MN;h@wU3%Rx_~jBwWHW0*lW)h)!#d5qEYxk
zqjlKacLO@`!x4+9EJ$ZX>?I8}PrAJynm_9>=k7-KMj=XqeK;GDJn<p8VXe=34ALTq
zo}#J1xW7{``4CQE6I#-8gBw3=H}+Q?AX*8+8P?l_Zm`0Q6fE%M*q>c4Y3{HEC+)j6
z*-u9=%`R?B+43V^Z`+of*$~4<BXV!%hHx5vh~n#rsg#t1Yl=yzTM?q_gK1zMtFp^y
z9Zpn=#*xE)L%;3DjLi$))?ONCDsv^MOPE|418tdC9y3vE?@F8D^Pbs+!nM(k6w0>2
zk6rMMZt@+_ik!t3u!Xtg(CI$RnmnlQBT1p%KDoKu!bRVo08yuxjMls2YASjR&`(;z
z3B*8tH9KNvd+Qe8bI}X$oN@uV#g}`qd1i`MjD3?TWjD-=7*(d&m=IWI=G0_I!F3tF
zUu{3`@tW+7;k*|Q%4Q4S6p;+R6sE01B`#pM&z;>f$Vb(}?Khr~O2DGTDwSv-V}f+*
zwfB4G$z$oZ2?^#T9Nstp!SSkf@N@6D**ww0w;puaA_*mSQD9yNLFgIqe*fKKDP?DA
z1Df580&`0&XZM_?m?pxZ^#C3AGRr30_&2H@<fnqp9$6MRW+=Y|sTpfTD~>9^pV^sc
zvSZ`%Wk<Qv$mU7VGj=14q!~t3Ejv65+#Lqx-ZfVpn6u-@OkzI>g=Ko|<X=Sp=u+SP
z`M3!y;O!lTQm`rCVUElVZP9*~S~l2Qpefg~7L!`sNx5uhr%rb@sl_{4DhZ>wx0k9g
zo%@q{+B5hw*2$}TmHJVknMkwt5+^6aRI{36sI1RDJ<|SHy)_Fy>g3eH&)1saHDlk-
zpP!5w&^p!iDRgkj24wCFTs(gsT|9#JTj+m#PFm1$Fpj4;EB6!-HYDxcuJ^#Lz#|aQ
zEuw!kEYb>Jq*~k!P(@JIMR*}#8iHP9Z?AdWh3`MMj$ZfPowT}`)9K)#d1CA-2w^xd
z>tmk=nG&MXCihCCF-56}hW;q<r#&K5b$li|x{}SguL#Mgtnq$@Sl_ZvN}80=)QU#!
z#Ate=XH==?P}#tpF@`q1G8!!-xeiDEMdCdWV6Rxg0)5%6z*eSPlnx?Xjwt-D0W1&W
zQsZXhd`al8+{1`uUBOtSUj{@J(%{AWr(4^<rqEK1rhV%C+}UfG@)UlONMbw#jH)aP
z_*$uLRo9Fu^M-W(*zx|HtW{Nz<}zJ*RSZJU=$!ClXLCb_hm<l2f)72^{oB;?IlZy~
zs1LRUJS2%DZm7psa^=A6^{3Sqd8<tkux-VeIvh+>YR<3rlm#~^m?EAMd`{Yt<*^mg
z|Da80;$2_H7>CxsAY+Me>f!NCoi5;fjR55|pT4)QigG%ckdGP5S-A`%+dU}B1O1F4
zq3KNalz`fT0jluGP$oO(bWF*DLA?uSm)5D(9H0B#)l>4nb)dxs{Y~b*bD5?}yNz}4
zT|hTZctmGulCMhg*tjNDC6X>?Kf<e&D&7&|jaxVxaZBrzBM!%|uEBWxeB}mUNuPjN
zyAB?XMrcUl%_ko4UsUhemxP&JdD&1DB?uG6!<2=K>=Bx9W>C)3b)>fYJ-j+YR0s`2
zOVl_8Dv0`lxq~i{__LjJ>l(CtiCftW*wn{aj}nbz!7}d*#elMM<Vxd9RW_)&Ho$Fk
zj#_IOj<-~#T(%%h>5#-vcxtIZh)pfwQikw1_HWJu3S0jUsJd*+Q&rj56<&<H)z*;j
zgh{#%6EEE+;di<%@@*>cjcE*oiPO*9Fq$_3x)e0B^qS5Cgv31#26gYi$9=|l#1>uG
zVG`shzi`_&=al6GbzuyYzm?mVx2$`WLdd-5=RlhmyeokJE&F=YP}K?FZH*_RAT@0R
z!83m$jEvVdTu=<uyv|Z{dtg{Z3$w6wIym`#=)Sx)6bs+Li;C9%Y1}7$7V|P1IoUD$
zrVPlq>MI%7)WYGv=|0=9n53GB9f9g1&R?GU>--qnA|1ZN89v?ZGN*-<U#dX@y+>0f
z4rSwDij@RgfTjrG8ZT{;O{SFI<%mk!$Vhn$`AxHZ0NkcS{Ke~!;v`_}$aK;jXOUVF
z!Qntj&@2|AsgDLo*<hS<w9Pj)pHLql<H$Q#b_aZmdL1aU3O1&Yy$yCgKeZ)6TZ?Is
z1qM|w(5*yixy4Wt_tx_OTYxuyA3%(_00?v+`@v+Eg(HS7w8_H4YPOELz|pTS!~P{a
zjQA>JJ{6OgY0wX}sb&@w#jv?R*$4XrTQ`oWo+-6q{T3}n6eAr_+gUss6Pd}4oSRSe
zF?G7*<ic8F#f>*!H(E!o*73t&)=mO3IGzRLNj&wZA>d>l`J6^~WZr`4Ugn-GmAs)b
zN6zL9HRs{W?uj3Z_()#Esf5|M0lEPhN+_rKu6=sAPvpD7<F9&`@ik7HQGLUr{_JK+
z%LLB~S=8kx%{gI9u_21xC8$sWL@~Rh4JpenSLce#h%1QXJX?Dy23_9YGQW37(KSe*
zEHaB2c%@54!1h(PDk3K43KdONHq^-SRjWOnHQe5@Uo5UO(xzytXG?gYRwt-_Ez~HW
zZv5YzR*cuvD|4r{M1=-gj;4Dp{nP~HYYO72eeR|vA28LgYl6~cQbI(P7?o1m(5#rY
zX%a+E(5hs%HA>xJ@&m6cc5EPpp8IG{_z%3TR%U^0*J#?2xMVqFeu#=`46i7W7OyUt
zkO$awhEQ01)KgV(#30P>hlx_1`F-b9=4gb3GHNvow|R((%~(*i!P)1H%vfl$`#FW3
zv;WKbo}**cDU{3YJ`o^^{=28F5e-NS3Dn?jiz&3qX^iw_-W#pDX=Nok`Ai&VX~Q@%
z=jb9`K5A{{1vl>~;KM8me>Jwes_{C>h%d`dJZi%C;XfA@x|kfc59i~LvniX_CLkLI
zgJ4kQ6&p$4xIbew3d?kAIoW5MMT>N~e?WX$24w}^|D=^cjnTD#Lylx<89pBc$|P8T
z<O%*$X+?wH)KQ(Xj2il6;}|E7=4{|E$Ce!LwhCR#MCBJy>gH}jF#u$%QZ2Hb|5v*u
ze*Ju*PqF_m`dGD&Uf)9-OX5F0-h_7<|KF!uPrv&Aeu>Y$dH&v;+i%I~&s(|&SKj;d
z<1O8v1MeMucO5;rwcqY%c0#FJEMHxKbw_XA(mi_We!i2g_RcMN3;c6S_vo67FG}~~
zm#eCkKHn)9J#tI;;gM^&<CgB~j_dZtE#1x+cd;XGX>~{3RlIOZD|q3q;(}XR!3B49
z|J%|s|J#MmxBu!r>+9$KKE?8%=}0{3*Td+}Z7h-hHlIAp#DCu2{C@ju{Fg8CnM?yr
z;q>>tw~Zf~z1C3&xbLB)MEH9t_!yv@ITiWtH~#XeGz!l#RTQQ_)vrHoz|)d=q4Qhy
zLLQbTA1<u->5or}*h-}%*xq+MgZ4`Ma1@`0WPiOwccPv71hcNv9jS8sFa5~res;XS
z1E>B^*iMwY>fcKz;(@HemJY*n_*Fan?l&IFC$Ba#o5c5Zu~da}BUB~TM*Zo{WETGq
z<9@~KA2l3roAvSFv)fp_{+~U2`u$ce{_oST=f5xVdH>D(SMzW*@H!M3{ns)EeouBb
zHfB@*3Miu=*5m2LhP5TsC(%V^rIHnp>DNhDk6NcOnvV@fXbnc9Jf^WvRLJ##I!uiH
z1ka1-Q$Olo*1b*;c<-;!BYiV%@&ZKk`8ma-x7vfg1i=QEX6rSCC~dQ;ni*9{6_Ach
z*~Qi?zi%A3Hb4RchLOP0;wEj_KM!joI7ChHXnX@aBHsAhRTy0F&fq+Rj<*j+yK3x}
z`ucjQ^sVxbES28y3kp5qjl(D$`*`3A``(`NK~uTORL|bi;fLFY<{ABAyixHmCdE1Q
z7LFh-ie_N}JP-Ol9gk;nGcp+H5)_D1F;HxTl9%>lGKQFy<oHWrC2&*-13+P)FX7DS
zje@IS<guA&4chw<cz`aPJvh?`6n|mtf52*`@w|UYmEbW~gVS}C+WbIIE-pBB!}$#z
z=u{W!1bwbd<uEMN2>piP*cW`9jKV(J1%#xhW?PwnZiD%xh>`rE7Ut`l_&7{F;>not
z{F<<WTb1J@E}H`2V>mFwTqIQ-HxvmtglEa87dIY&Oz42>6V?YoKb}uU=}9v1S{rSS
zeF0~sS&1ea4R8Iisyhh8vX*-8CuoQ;Pk^*W;q1n=R>1els7@bk!^lSI2v*M=%`R<(
z4B_NTB$alX3=B0DQV0k^3$I7k9n=zk7zip;%1C1GCZ1ETgs$ii??*SRnbB$ZUhaBZ
z^=%9wQNrjeil9?WdgJ+M76QtUY?3<0Xql2t7|!xKDz7i6afHcU;QczAo2~oV=UOkZ
zZjF!LLDS!U>zz(6rkr&GDDsS0!dXel2_F3hLY;o#u@A#(Lg^u3AJmKh$nA|1FmREv
zz=Em*SQbF4F|sMP+*FAps@^zGX3!zE49KSL<AjWRaGlT{$2<y2LxY1zg3+*sRP9I1
zRIn+31PF&6XMpJ`C|E3IWf^#9$sjpXSgn$cB47s1YzVjWiI5sXKH;7ph}Wp<BDBce
zdcQ{xM)Ae3Wz-A2ZXUK@!-ii01okjy$d2bVki<~{JI6%|Wv{D1&%@vvy(P|p2w5L<
z>0cp*29f6Gz)A=eXeu}orCXxxgU(SC1&GGju{2GAkOtw@>Z~lzcsvO)vPr#1liPZG
z42R;zQ5U-SDl-MV63;g4TTkj+XI|}PI{WM1nRzpF2K@%~UdPBEN#6ymhsTw8<uiRv
zgS_^vN?kdVYnwAbl7iM|=fFC0%XltO2^pN<m~Oc2qRJ;jRjDeIU_c}E1t&UFo_Lim
zpEiDi<liP6W4vXO;$)cHm`?qhGcSs-C7{h2n|+)SQ^8vyAn-Hb<7doifDMd-=mO>e
zRulAlMry`o*v8m7GK=__kPo<jT>prur&;(|D!rPIKF}Cx_1DhvCpU(TCJFBhwJlWE
zT~P0*{OIiPuzmEp_qOrV8EIc(G$qBB*cOa<2yd%sD+L=MvOTS1JZW~0wJwi6ro49K
zJ>IUJ!xjb0ZYJttUS?<ye@^D`s1J>=gQ?6PW;3U508V(}m@`m^!JJV!!Lc$89|RGs
zBwoa{ufl5zx#Y1&L#cF{1VZz&I*{0LsHB!OKzdjHXdX~pDztm5duX%E@t$aFfU+fB
zHx~6P*Fnd}gm%9%>3z@9Y8$WSkvHR#W81iCFpjVAayA^6R0Z<qQjx3a_BhL5dA+^Z
ztpC+wvGiMn9seJw4~9MB(w~oT_?Jo+ie&Hhaf)Vj?+sgQRSl8~K8Dnl5+P|$d|uU8
z28S_?$%j4c0;o5PXkVc?27pE013m-+86%D{9~@F`DQ$wbAK1|qSlGq5`y%;RY-9aQ
zgCn0RG^%D*G@uM8f#w<C5M=}Fsc$iO+H)@{t{6H$3TuT^C5cVf@$>`HEhD&NZ+Wnv
z#zf#4u!>r+-xC32L@oG_+F>?56sADIS7emx*8LpsPiA~QFxV-T&d$#I)@8Qxa#uF%
zhACn=VOw$(A1co!mb8>6Uga?6HDl|*n)7E>uU@aK+Q@DVZdO(x;RzIhz9Ck=)sB$3
zba0OK0ME?6p5c_rqELPcu;k*Jgh8|S0iu?Y5gLw+RMqD1UB)926KO_?Q~HL9E)$v!
zPDRY4nMQxjS#SYM@eJ4%u-Y&f4Yd3i#Zm2_!8B$zYFqz$v_4AOD3&_F?J*Dp2u+=l
z{|Ql`&&IaISwuq9M8?MEC2izi_uir`5=J~1^jexq6hjy?C*+>3ualu#vc3)?galq`
z42e@uZ)A}v2QT=_av?9*%-o<T$t$<iM}s;7Z=ok9DJ2AXpJcKy;Z<zo2U$}x?;{@@
z&PO{g`t2+821UbbTif5)X-TeCy=RZV|0~cI*+DDcQF1{ipFPVv)-<dUAGb9^2RgC+
z60KFG630x`wkR7MlTA?WHds;M_Iz}zk<j|$YNg!9e$lqzXgNiTVVy;^MpmXFs=`AY
z8T_C$Uti~?)5)BCXaNb!NRaD-_(SF|fc`K^=0SQ!QuC?E52a<IVIn<?kwDebnaK&x
zWP{c#m8B8iW5R<iaU70(Vu6f`IvSVrW{JKM2_03()lxXqtD4T8xIyY!$5ViwYvw?L
zJ2bLyb^!)(Jb${Tm<bL<#kGOO`RC+}R_b&TlRh9_N6M(2p;p!1Gs;u5sqFiu0g6jw
z41q@)1(u^?_Niewx9cf-M)Kw@{e6cF0vC?r-V+}-7rF1HGaEOPu))3VEiJ7-pPw0H
z<;7h>M8ed>7aUYk*u^9!EMN<1-{~~0Lpl1XNFoDO@h3~4GvaeK;;JXv4l4YcEr<~b
zE$kXd=_5G%DDIqqY$7LE88l*G5Tbz|N`h%@Op>wDRSz1!!dOS)Obt_ulzPtqP;gA6
zl}MP8(^Na63uQXSB@@3-=P8tziDXn$xdZdeB(?;2`VDU}I9HLbw>rW=vf24_!c;Q8
z!N_$ct<Y*eO$>Dgle^dlQ&AHBtz|0voYHg{I}&3R<BF#27D}N0e?CJZBI48=Row5-
zry@~XO~P!QA&)&HFW4;8*Xv9I2?%FFC%iK52D0hkE|qRY6`T?>|43cew0D^a4rW56
zMAWum990-nx)D(`^GV4kcSd7>7e+CI;uy<Q@X5?CgFh0zcmZITM)Q0iBE}g$&y3eB
zWgL(dA(Cnm{ZG6PD7ccl7!)mW>{E7N+2I+-qs}&-a@W_-*!J|Kd3^YDuhVUGPdjJp
z>+EI7adFkG@_+_v`E!O$ZiAV<JP~Fnf`LzD5De1&9m>~UqBNp>WV#tX7_JBdIcnW8
z3Ubyn2C-lik&<w_+M}_c=@8Cm6l;?XS`MVSdV=@<ubU?;AykWh+!-Yc@_KM1f}-Hl
zN1;S&DZ)W?5`B?tKK|qE=27c#wK-p3kHQg1b>e=Ws^p@W^vo1fm-^^x25lCOUK=en
zJUZT&8RZp|mNe&K)-a*C#Q!RSLfe?1t$veof_ratI+~NF3zg68xS8m?icEQrx)e|8
zHX}2KsxEMXCY^ZY!6I0`%^bv)T+aUjpOV*R#(x$1*>>O8>%cyOkM;Vm8lfzqqurEn
zd?bg674kkRj}lVjsi48k^hIS%MtO?qJWkchq`A~;Wj@;@M?Ir*XF^X%y{zX(p6MrI
zUIyYN22JMO)jXK^=ka`IZ`4YQsQ|yXbv(|?A~9dwpeh^ZqxgJ-ubVcoGO9iuWU}8r
zeRbGeZ6yuj`S~cQO@J|nqy!m`VxQC~BvuJ2nFOsjMxh%&FL<8O8ISdnRdc>Yj8V;F
zxmgVR5VAX#sa<6Ms@*=cS8E)P0)UAA+8aZ1(Prvj&`s4f&6z|UtVAsAp4jr8ZBmcU
zww#ObZR6PNOvHqjs_$4E8b(+CG^8jEVxLKddeDx~2K(nM0bGF?l3%XoK%hO(IE(ls
z$ADaW6^tYZgo8(jx2bVsro*aZ0|3YDqmxNCyRKn^G(Cx<BoKu|;KPalfKyuiAb$SW
zJW!oK4COWfN5HZA$%GQu6RuBlBlC0cWdNy)2wD4_HS;pNPUe1m+Ii#ZxWuv`GQ0?)
zU`n?W*cb>(0i)*pMhVRd{m36O<2L3{D=^S8kyL5d$V$%jG<wG2Qwk@kw1x64br<F&
zN$^Ij9MmuB-kJP7qr?GcI8CDvZ&S`HReg;FvSo}0#O!R0t=2MxD6l8~4F&RqBS$bA
zI=7W>_r!%VRtn9hL~{0Yd1tr`h}q(TiU!OG#=*?5(F8O9^X+xnYb2?C?6dl2{TZ`r
zX6A$w(FKq!37Dm#Jr_@Cy*@g9YjFkPL1;f5B-mN;!k(UoGw~G$26KUjbh^yMP%%1?
zv?=A7t54RZ<`5C8beA%{^r#}Tv||K6Hcwtz{Rhr?4y<>ao?sPbS@S8w5+PgVV^qe!
zrmeU+0O_Qrf*eCs-3~OfrioC?G*kMD&jT_{q1V|*xsjRr*B+f+kZ#8Veu#ILgZMhC
zkWoAzM$%IQDp3tN(mTs)RV!zj_ti_8!~j}BL-T`L8d&0dra>@tc@7JM=}Y4Jlw=|D
zphRlGVOw$porh<JSV>9@#ZC$Hv$%wf@M@f&>w{LAwLa|qPwMmO7$lK&r|HMj>703+
zgm6RDtgpAwsU5h{YzIVJItk9Fq!3V7)y6eMS(%JL4-(z9Isuom*Uw4~C5o*v?4F5v
zmc%uOisl^p&-mg2i?UWABzP=mYOxQ)u^~d|6Xc<)k3AoCtvxG}dWny^$Qs`TB*|$#
z9O~Cb{)KT7&Dz9acmX^JZ(m`)hI6PMD2yaZGMD>hk?{7gJ2?4pJjP3if%aOYNzk*V
zPTID+fN=p4sdKI9IqcZQId68>W!S32a6E=mc(roFAv1UbNaFs7V5YcvB=bn}!$`*l
zWnWPc%;`SB&?jSqb+?MtBfZN*6bx-enSJ!<y*PIjK`$HAi>otp^m+9v-TBj9w1qm7
zb&*4u_*&1xc4zYe)||O=S%*hg>XCe%Q*b6gvxZ~awry?fe6ekNV`pRA&c?QF+qP}%
z?ElxfI9I1?E@rCccBZ=f?e}RgpugrJp0*V2Yw0eRQtTGyP$_m5rpl3_T32B=)zgnL
z<#ulAg#eByTAoA?n+zaf8?=5kAe3m|l1^?a7eO0~XdBT)4n*~YQlp7j|DK_DImLBR
zs4`!Uu9Ir7E2sE_^3K(-Q}HU`t-S;XU9(bck8w~Q#llgA0y)Tpd$Xe-B{!;r#lyrk
zRg|c^!ub&&<^m~m8a@O{3)^8g1Lif+yj^E({Sqxj7qHCJ`bw;2A#El6)OMahe?WcS
zJYMrSwPjar<t`c8Q-#I%p`R0cmuG5UPDb9~vZJNy+ALvc|K+JLgX&4W`-p@92aJ+A
zJ=gZIvgw?N`bSE9f{v_$*rrD#3zuOIQ~E^%$K~zoMOId8^0XE+$nlvPa{Xg__}>|y
z^)cZTA4PpYpj;}TJ^#pTauGlo>{ANks|U%-ePKOm!YCi41fb3oWaiFBin7nTOaf>F
z_Dm2#8Sw(|Ok4}(8y0Z8Wd+r#;TBPKqZaiFZP)3jysydk;mtvc*avlW*?2N`ktrxu
zfn8z$*#(B*pFJ%%w%9AQFaJ!h#B`1-2${-8wC53RGcHke2VFPYz&e!*jK|O~NS~P2
zv*TL~iG|vx0kP1bwJQciI{G_sQOeE8h_N-pfu`UACgSIWI)fB1*tXEp`es%6*O;(U
zUua0N>@B1$p={zfPkAkwQ;)U?ZG|gD89o0rJd+2-g5>gNCxMMjFTrjIS{a0sAfkfj
z{<Row^XX>py9IG;LK+QhJ^6}Vp{xE?|I6?zxHx>Z^<7A$lB~yywWIU&#Ih?uCexst
zg?S9@O-agUn1e}0IT?mGe7T?$si9JCu8(}W97Q?ORrk<GIbQM#Hl2FTSQ6H+N^j9)
z{zJYVS#ExSVFSSupyR5Vi2WSLKy&P9+joD?3*ES^rn@*Qp5|D;TOg0w-D;_~kRHe2
zx6q_G9AsONZewP2Ofr!HW|xG{g*N9JY@dFALk))4S)GOf%I0rmci(wPq~`LI(j~2@
z^2m<4G=!FSiehxA<UwS{V8KLGiAf5?(NT2yCc8GU3BG*+e%n|YZ3B1mFJy%eR}H3T
zGle3vVnN8Rc64bA$w~F1tWuW^PR`#(%1%+oF~+edsv21CD@`s+qWW{{plEHQ;2(g#
zLqp>*%#ousp7aRQ2%}UKB&`UiyP^=80<P}WM=~K7Xyoc-O$+>e(FwD(ENsIi6F~1!
zWGGHXL;=ZSQg2)a;HpnjOT6WqVb`Y4TWbf~A*G1tBP*)U=XlNw7LTi}!jkyqaygI`
zhaB5I{ty`w-KIWw53*D1A7#j_Go_m^jUrkdP7%MLkdCrpLwQJ+w({Gmr}U(D)`l?6
zB95x&nkvdsxvx^<5f53KmTj8%@gUK)rOUi@jb0{GL(TQ#cuAaq;O*7Q03NL&y!|l6
zDHa{Km9(Kg2&;hFukbCC$(6xlxnx+&3StWPo{Yd@GdP7u#!zOcoMVxMeP!O-3uv6h
zQ7&^d55$P{m=2eZBcXDs0Hp>F5#&%#Ga3$;bjV_c@KvhRu0et4<hOxV$(%|i+&^X6
zm@yymnkWC4aurJ4ivnlsydD>gk|5uiegG3w8DhY{6fqK>Mztp^S|S;RL7^JL_9Eke
z>m6w`E_d-Kw4{$~O~I6d<|+9SSCyBJqj18eb6o?0DW<dEVOfMPQ^T<-X)xt*$~S)(
z$JAtO%bIh_%&c;Hx~@jabDMmDKPgqSoWxfcU!mE@F<OL^(8%@FjOS^d*1=-DQf2~7
z_DM~S+v--Pk#Khx$AW-?u3&JRoize{95N%%w0z(qc$L0QCXYm^6<)7d&a9c<Vw!43
zJbi<OF<IzR!+hO&F6-XtLu|stfgN_J(q+G7k!e~>zc`KZVr>@qyfUWDCl{-wJZS(B
zZI#(vO!QYq^I7_+byzA~%ro0)6n+^+x_JlitU|Y3co<r*6Hbvb$x!%k=5MPfN@pdp
z>{kJpixrzzB1fgs1$lr#CU?Q{(o)x~3PJhG!P`M%=W4Z5lbOZP@Bj)TFVDv5h@0)l
z^>g8w?f0^bzpajjoXln;{a5yGw+2!`zD9M4A4x^(R`cTu2gj~t!6QW^WI#HHawy6#
zH^Fj19szArk+>qbO~Ptlf;P+WX)WK^uyj%hJ;Aaai8{3R*5a79vf-#P`h-nonx)mE
zlzp$8c0ITH(-xynDM{2Gba!dZL=%<&iz$DwZw528ppj=M$MCPny%|fvk%h66mf`rW
z1RDfgK?V(Funv@$vy`cZdIiOWoo;)n{eWdgZU$J?rEj$?{z68narTT68|2vndmIl6
zLT4ZEY)6Xx3U)uQ`$p`6RQ6TYoLkZPR6%^Z6yxn*1&}0uZoLmq-nzM7h1)Xvv2zoW
zb2ByBi~^D~I;mstTe&NVMp@gK*c6yo3s1$u%b)Y@@Kq&ft>k47Ro~O&pb*HA_q@%$
z$8ctYR4xjdDOgrVXe&ay$ECYyA!BhR10Stj)$DUNxUaIp?tr}h^DJ6St)h?04HRV~
zP3l&Ay(Hjj>yE%TX9j>vCA~*AzG#hT6V^YS)n60LXtK)4CAC3F$<@cTz)dZtt6!&<
z+HOo+ik@6!KBSVHlGXDMk5gIe{Fc;B>@ZoXO)i2?aG;Q<ggvd_81cd?W0SGR7Ao<d
zkt6lM2n~+MT2Ul&<3-Wo(tExq7XWQPtNk45!QY!AevM+er7VLYjUnSyOOi70m_fKq
z*(uQmgX;(?wQ|zG9*TgEy33~Jt2%g%Lo)~+_UnZ)gNSEmSSwFp!`{t0ZZwv86zt8@
zjqg71a#sB`_6xjsd1@6Uy%2BJIzj78?q4o?@D{4VWRl|B!)N!}j9d6;-b<r3-sC3G
zE4$Jn35%x&X)6}y`>#BhC1?Hd$~Wb(wUcuY+m$r~4u(Ek{hsT@j|s$_+cZj+W9uRL
zX_Eo*Bxh+P$JcKZub#yCWEZfLmI~d%Wsxlrf#%dc<^2$|^{{>V;OkK&RZ?1c|E5Pw
zq|C3$NtaxMpEJ-WNh50$aHRT`7pSh02d;&Ycld`#eU8HhOC8DLq5c}U#YE-N$+QBq
z|0;1=@QKK#XUvn^9zg-`=W=8pBVl3G;O<(M#y4F(NAyl>v#fW301c@kC;*+MnU5y`
z`sSfV;v(p8SE7)F3QDxG0BhkGng~|dC5{?H1M-w$rU^j-j_<N(1`;bH0t)WlnHENW
zv9UEv;6#zKN$!jV7F&)c%(72sUC2xo{^V#Pk*e6&cM?fXVER>^@LX(hoW1A61S)<}
zoc-7RMz@9i@;xH=8gbzYEnIT)F)1?9@>AqO$y(x5DQLf6Qi2!RBmEMCYLGHNlceYO
zW%%H47ZU1RZh=H}JbuIX^KomarXz-_L~c-X;p*aWo^HMcwHPCH3I;LqH9~Glu|f4}
zI*0@s?T+OPPlfPQVSwac_4V31@v7l?a)nog)Wz<3z5!{&t;F~pdD$y8Emip-u&e3J
z>2m74!%s}9JyCI0Uufep8Uv6FRm;wI`%YH(@f0s}6GTT}R#=r$5L0w2^;xztbA)#-
z1BAcq?q#{m4ctmX<xTXT#h00TykSZ-mvjd6=jqf<;Gp30v+et~g{d9UgQe7$QGcRy
z0t(YsJPCIi0(s&Xzz{FYtkir}k-tgioW=Jv+J2Y?0`@JuByGTJtd)CU>ek7+-+Xjg
za+0G!$_YS)XY6AdMdGREuOzfM6zs>bylOA~w0_bbx}B;i53V)Tl8)|$h*=w@QuwjY
z12McjvWha0)=lY}ssxod$t(9141=i_L8Wbs;;XVF@un4QBuUR17x2ey%0wpuAA`sU
zMvEgW_s3&*vv01(eEg8F`|$Mg>5&2RRY=LzT$vf*<-lZX$u`>qFQzn-%4z_(quDj4
z`K?&IETSd5&|(jID?UImm)UtUx&<oI>>x0{;u)9H(>AO~jqFS|0S#(I3chXO5FID_
z?mZ6^rSC~q@petpDDfIrP17~};JF19<-<cJ8#iUg{VfE?vjEKk75}3{7^aUr`Oxpk
zJ$Mu60q%Nd>Ld%2F9ht#eEf+`-i0d>5__tLzigcv(4y<ybXs^|%(IUf@eFt8MGHZ)
z!BUGHbgc$1@&~x&NA;^iEAEb;#DT7w*V;1xfuNeoRx^HwF>7=wv1xIp)3D^aMHD($
zVk<j{nK2$5(5*s;C=^4ndFo*8Gx{7h)VOGX#aT3^vJxUvTOtxTet#q9I2L?M9M_&|
zz;m}nr|$qHSDG|5cc4F+u*$PEE?TcdlQs8owh;YxQ)9;-xps6KYoSdbQx-Ns)9Pxj
zz4F~V7=^aTRuW(D?Y7~s-xkz(Gb2TdpF`J0EO;-CK){{B3loOxjO4YMbnrL7Z<o^$
zP}~tyN`CoNR5~}!!&|i_Wu(sOdSSDN)Q*4!!bGZYC6biDbgoN_%UzKh$FL4tB*J9=
zxlNylNrkLBAk#$6F33Uo(59L%^D0K+w*?&$9U)#wEvwt%?K>4q6UB2)h9v}z+|7xa
zc7b?G+Y)A^tbduMSma6;JV#p&855Y{UPV)Ty99!41BStVuN^}vP8PHlTL@&JT;?r=
zNEYv;f=7LC{`w)X_hOIT7vn3l`+1Ujs+s8y?U5hziHNF5YVwas?Hvn~3A6G#-Zf^1
zt#TA4Tv)1ee4Rvz(zvR3N3u35L&+|%6GEM0ah#L2$jI9j$R3EkHk1JGFr`y2lvC0v
zU7<-T*rdx5@yCYAhB;`C;06>>=3Dn7n0FBiJvS~~0?%$$p(IvTFXn(Di*Mool|+-5
zJWT^~Df(8mnGzZiE(U?KEu0K<VG%MV#S?wCR(Qe_*}V=VDqw-g?(<)c61i%SQh#<p
zd06AWv=2+J##<1fw~PhZg^)46V*_i3q!UW@AG<dkOT<80l{Fa(G)B!OIuA8si4*53
z%k;+(PAdd$)TPKw4jn8`yM^k5zP1dxgLMH%wkDDdHh5P{)>KATXI!~Qv^>2HkUTc`
zqw98-s?;V3o`cl8>}_Vz02T7_!Ef4OQE^TPmtCyCg|6vh{RPGn+yemG8jCA%&7fi-
zk+F)b6P4%Kij!4&hcKKPZ&k4yJFpyc@TexW8byfXbZ24{wh^iB6axHvi|T&o(0bmK
zsZ6ZA;X785h+?-lT--d4OzqtB;BoMxePUUlmN-(uj)`SPmGS@5TwS7Eb=$bMS{S(^
zd!j!WdaPkb6nrF!x}9349oKH9o-6yw9P26yQvRr3;$F^NMng*jqUj1!UgSq2(_dTz
zQQ=-&xt%UKKdj@$uEl@>Pftn;uJh>8w0>e_ybgZk=E=<`^th0gq8FNVunHltrY1I#
zFe3e;;?z7<_GZAPrT~-Ez(qAx1L@V3NpX~vHAdmznyjML%rln^QXH)^+{2wRDiIcr
z2fF5@dyyP7&wSEr2fBoBG*^R31lf%kagHPJX}H9MP60-#4I2`}jJ~|XDMRZ~u8;uY
zea(*YDD9+Czx2y^`BW;0Y7z|dOxc*c_$beWb3ASPA}|WFBC0sjWMCq&FQ;?N5sKDS
zz>Q4m%?iqjMTF}gaRHR)91}y!Fu%BdK|fEfg$*o1-nf}j#t|HmuOljGNovC=_+N}-
z<LCs470r{HgY#Juahho8l66YOUrtpwFM(%K|6;YTGn*>Fbw1D?knE=l0d8F87^!1T
z-Q3I2ZPcpoQY2;lnq*2_6a3@;YT6Jk6gRRT*!^niEhY#&Y;6gR5glaM0pO)p#Rnw{
zz0hWd?6VQLveX;|X=)YDT?~jkj6a0dv3I}A)|)kK1gjo-x(5u=KuXERw3Ld|QLoKu
zvHTF2Z#GCufOebHBhg@i2F9GLmac&1@LTK1WXW$T&93%(TF9tu<)R!kSLVG=9_Js3
zoWb-`QGuN>3jzEJIU_62VI`3=HWjiY&~*okL#NXmck7@U|LhA;$Ko!wMvBQK{OHn;
zcZ*<Srga3Bw#aBt%FcT5oGd9V#L4@Zzv9^9s>?Yrl1@H96<v^CYj%Ew9SS1Z=)oy%
zCgu-?))QO+y)B(*1)WCM{yR=Z$fJH5v@TeAd*NLipo<?N=|j-l#{#CbV1$tK>rOBA
z!npsIigsaE?z|RCM$85MC36s0Nv**n&#`uhKs!w+beMlDCS7inMvVqCiQK?h@rIJU
zQG(cZX)`K{Ub)xGz1LMgSUS0tCPgXHi|9axUJ8W+QhDX~nNxT_1XrdmWM8?4B1*dE
zYO5>$&LhRcVLjy*mAMR_OhqzpTXE`wVCFgghD|qYqehu-#t{MT)2#Ab_1PYxF=-8#
zuZ*>JeDdO+amcVL9?LS&uf_}gf+9t>1s&76jsSmBR4<NvF0s<!YLJWg4x=e$Glj(@
z{%zb8zxCX1tKqLk@f@B>^I@Be6L+qtMXg>VhMjrc)>qrN^mLYL%VfN&%SXv;LG(<i
z)z<wMrU$UBbSRfEr|v_h+VEJq8MW}mDz=eHr@_w|N30TwQ8O2Kux!>xcIn?hFc})3
zM$Ms8rknzI$7C`Y^YJcB`!Y2hZaTib9pnZ(raVzkg@RW_QE&!k%W13*_1<+YOa&Y5
zrj`&TFoS>W8Ts&mB4YEfO&gQM#J*jUavnwp)OB7SPBrIcOR$@&vn)B`yV8UrnVIAe
zWbW8tLQ)J}+g?seEit93c|fU35PaMPt)1;!0b00ojSE-2JRtsqY+^IS_~1f+silkJ
z=jWcumVvR`63@9Ko{TIt*Og<0f=-HYc>G4U^k~9K2j(LQR1Z_)i;W3cUuvy9|MsNp
zN_$p{r&<gYyPs@LD0o!@m>|0fFIvqk=jQVlBlFxAi>buBhAmrse$U(FIOs$%jaTbj
zlAeXLxQ3sv%e6_?KFy_SCEX8w_^i+pEOgP&j!0urHLy5XMZOEQ<MeFO3@&F&Bf63*
z$zc^HR%csT`IKnXVQuZ1Mxx-u(=*Mdu69!xA;5RykLzp}QuJSzhfvy^hH$_W078(^
zYm~>p&6@>`kD{UyRTpzxt_svzeENA6egSggU&Y_QBM!SQYI$<(c)y7;qP4J+wOQFt
zs;3xAoDPJim^c*+qm&L6hORy2J-^?NU@TKk0gkWEwO@~n@|>K7+byB;%``@iwDFx5
z_-(Ig4n=+yc1T!=kEY~t`92=M2VNN8tG&>2Ub^nr(r9v3yBfN`Ip7yp43^caRc(*s
z3WY|vx)0(1wo<H3Q!P^1tYr)W$Z1I_H=Q_M?xtp^&!@Mz!rVU&^%E?*?7Pl0YYGd_
zvp<tknLGmDM7s|3m)Jr(J(&v!@6uX)j78w*ab&p78S;&Yv4i{b-1SuO3dD-I*(ewd
zEUjq3I7muo{hRK3s~G@M5blI9C7uAwZzW8E#e-USFNh0Ds3{AkXva%nQ11o)vn0T@
z_tKF~_c`DxRf&PvWi2_b{a*TvK5OLjKgL2OCbSyf6v(uScVU9_`y!<o$y;*jpj{@Z
zA|%uro)4ydUnKHY(4Pv_p0UuUYS{Zf%OAO0!~LIsv@_*%`KOQn{P=#Xt$gO{A2tZl
ztb0v>-1rTJ@8)juBX`0sFO<J5=T0$c8!i$C59Gao6nrUM`OPDjovT*fynmJuE@dp-
zf?D#=t{)5uc>e=500Uu*V;P?IUxM{J6c?VT7Ye*}c0QIq^^7b&ZZa~iv~-x4nu~7J
z%lZhZ+hv#QJqh!;lx&ZN>-yIx3cb5YYcU>lv<yB4T+B@A)c}?K9feg|W$oHDCh*c?
zmiXB2Dy)|<c*}5`GLzR0yxWox_6kZqZhX1USjc(JqOIz3>u7w2GB-5yvVWR<4thKq
zyXrzu*qFFYIcj-P8?~QFY%z-Pve%683TmdB;49-%E{NPqySAX0j>0q=@_d{3<N#`0
z_Jt^6?(}QOkvc_vP$Wz~eziykmqeSqgd8JM4p2#cCN&6&ZMjo~{#X1=x*V!9e*Y)2
zBsF-Xvch8woubfFZs+OjiDi*dfQ@-W|K@Sp!FCUy@}?X07G%yHRh{zp;a@nz`)G(I
z&@UO&jCg84%rXhl5iH=S02}J4i%>{ve<UlpAlxI?Uuiz?qb(OZVRzy}@sFU#`^Uh^
zcJ*g5_*BYCe$uHIVWSd@ZiQI&U6JPpdf(kCZ*2s!Vr8I5h)d#f<Q4@kfLq<H)w)co
z#mksB&0}5T`g^79{dLsKh0rrj;T)Mq7+hdFyM?YlbT^-Yr@fEoNsa+|F2{TVA2jTg
zl%l=Ux!6TG`5BB?1MxunF*?d};)UjQ+MZTTIfspz<8;{X`a!RoeMrTaD58QtzW`}P
zd^A>V#mi|i;%yV}|JI+S_|TRE^<WrrSbh-_rAqWp!hi6&kMr1nL~+0_EiVO0f|GTx
zhCW99&xBHfo~1}9n|glU-ko35CW;=5ShU;toM6}BR>oZPQmC|W;%NIvkh7=F@ZT+s
zStn>a2}k0Zz(1Aq*3<(n1Eyy!R)Kclcw-K(Y)F9kPaQkBr7M;#@KHW<1Tb>lRfit0
z4K4=v1xr`h?Z4%`SBTN7Ct^Yu5IBv7l){DJ^Nw$XCP^1x173SY>?rQHr;0-~S483k
z(Jw!*OSOc3h_kbCS?Dg<1-&J3=bM4~&XQuKL~hyrscAJOyX2I=sNKVvpOtxWjB67K
zaJr83P7|Cxe10<1A~!3xc_{j$%>ww3X3NwFCvAMsj7f#JXY5-tH2YbB3Jsy7&+a>S
z{&1fCZRMKTrH?qss@B1yRAR1#S8FJRvb9-dphXSs0gI@!S-k_M$aL8;P0LtMl+Z@k
z`p8Dy8}#bmj%{5zdxQf^kN(?q6lj%6RQ_)Y&jGnPZ;J1MIbPI9B5t7|pin`q-`z$b
z-}CPKu4c9&w8w_uJEtm=zgyvIE|JD%h3w$%mXB{@C0j{}+CA!Lxsy`(a&0gNA&7|Q
znnm=?EEzmi1{2e5RwukuZO@|}WuE)^$q0LL4s|m>3ZyBu7PUwg`l!N<L73P#hj<#T
zvjf4btxXp`YQnPvr<D<FRYeSa<ya^*Fg9$bELgltKGmSvb#s{q-CEvUZ|~UGEvY57
zwo4#r#!%?0?tXrQtqgppjP7hZgtA_7z3U0)vcU32c6Tu3c`P4@@sO#sa||}>YCWk3
zt+KqJY?6hQ7|rGt{NZFU*z;8?OqiZwAYDQlRzG#^gpu{7z3pM`{+f1#_-xx1TGoYM
z!ovUkAzAdB38hUwxbI5=UV7DyC<FMspKWMVWP56hB;=NlCgH>*@>Mrx#b>^rMC%=<
z{#65jU`|t=_gp2tz}7w=<{)wbgERyYc6^GPAWou$3^IBgNpc&mh%rnR1?uW98VC*!
zC!d_9kTumDRalcm$(+~GB<P*UoM;*bA>%DAf)u!iq+E;zMDCO@{UNq2l=@INQx`RQ
z8`{|)&7>hE?6Ku;<5@UM_1=EudH8nfxL1JMy?&=umO_p6BXz{@YZK}7bFex>*bl2V
zceOQxBVdKUEmr%U%i{IJF!__hv-XkhB~$aRNdo)~-lUZI14@1HP~rh<3%y$THb1Gz
z;TIiB8p+q`Nwrt+?5WfEys}0<_i|Lw(j?{fLVr{+DGqdU=ZvFYk?G=?JB(w3lq~as
z`=H5H{^EwU`fQ<6oi_f+Ewg`cwH+m5aIG9W{(8HH>h3;-S_1394~%t*fspbTJ(F88
zHYC*(a4^4I%unU;c9Oob_OeYHVxH`PwmyyNnB+NGRNWb^%ivg!(4=FK>Oz=nVzv!d
z06ij4>=wfhZYf3PJ8~L0zU_mor?_bD%qe<+nvR>CL@!nfrLTdR*wJRfe15Y`ihA(+
zJ@-tC7Tg?e_NaTf1Pl$u!w4P9pKYiSo&M`%HhG7X6!lL&`nEW=^X@@HaY~&4!RQx>
zWp@Y}QW;Supdn;B-a#0A*M9Wh>|Hm*I6nxJdT9J2gV@_tD=S(#bcAs~{>YQB34>l7
z8!9h)60PbOw9ibn5mvR<Hd+_uh(4+^!>7YGJLrNj$H$1qE9{EgDDy+A)kIpv>v;<A
zNF(2e%?jH*_6p=vSOQyXut={0=H5SrFf#WeGORGATpw&T<4Yq-mh+J$!#W!P;-2}I
z-&S%#8ZIpDbJ1X!h92s~@wFrQ+%g1W*fh8s0iHdTuvt)$P*=DqPxbE@9uFs>huH7F
z7wTZ?^cHBtEqd2Q;&6!p7wo=DAbyJBMfFjKfHQ+Q&t=*RQ!*H?aFZk|Gh>{LqAwE=
z!4hq^sU*6h?|!43GThkT(tDKG^TIW;uIv?imIL-W@;f)C0-Z1p3=5CGi+yaeyB>l7
z`ns<Aq|G;m4yobb9ysW#5dK8kLm2P+oWsSn^MSAx{Hu=!H2Ec8mx;L(=WhEs{b-~;
z_co9-gXYWBGr_Dt1B6si>J8ZMF&Pez!kNY1s&rK;IjSdbE){<PqbYT#hpM>}s`+cM
zo%(&HX$Fz@Sg$nR%`xJDy*@o~{qgU@@kpjvrU<a+3#n=qGV2!=MefCG1_My=hu9xO
z7f6!>y;*|!w-ZEa`q75h8|GSpUl1wwqD{5WCrwL!k(S~F&mnRrW7~TucY?Ng2*U?v
zk0id>`3M2nGYK!FQY#RKyg#oC8JPoz7x^98i=VCy&!e=ZlBQmpOE20pzVuY4VftOr
z)%g<I;P`t-o49T1_`XTbD;M&15pN&B&plz*PB=9z&tlCMH+`TwhF=qw>Ee39Zpn+2
ze>puKErhhu9Bz2<{L;KDFoZ-!&oBwqQ`jAO;ol8Ogs5~(B{c*uK|b4+wG;^LN>8uO
zbzPReRk(oKYt<6nruWj{lWrNK8ztfLEc|XU=qDz)?o{KhA|1%x;EIQ<={S~+nh@n_
zBax^ZiD;=r;D^#=xwWv`R@2{SIbh<v&`f`t(@efzPh#!pEf5eH^gg1Se!<157X4Yp
z`qc~N8f1!wSjg$oGdBM~u1Nj4t<-~A1C)f@68WnJLpg_UGllFnkr*~Xz`+C)%UBo>
zoNGqv(B$>l9KCV>WZ^y>x?m<P;}9j*o_2cbzKv=X5v^9hnZcdvC!3PAi&ocCSUi1*
z<^4s6&Qk@p70&m&%FJ*G`n5#|`DeS8<NUD50$UOZUXq^*3%o^ko`z6AJDScS08BY;
zR6;vhtLHThaY&C!8z(-7w&_X?mG~u82}|y<Yc3#N0maQeiIa4~_uf2}HoS~N0&A&w
zw+abqmit$bg-fAYKniKZArOirkyKHF5lw$@@E7&Q(_`0~%c?|)&*GA70F}^dDH0u;
z!EIpq#CD-tttia$ndAL$ybY{vkkgjsghMv6<qhE{$(^Lu1%k7YGuuDLOmU(J;d#u<
z@gQ_XR(fu)9`F4dXHb}@;HeiN>I*-}R`u^>43fuFN-U8BU5dN%ODbib#c2xjD=;EU
z9*?t++*Zp2Dh`F_Ypu*lZH7)->2T=Ji;@;XD<m*-Jb;gGusfx`3KVeen#X7JvXIO~
z<I?UqT?wl{{k9quR4RqPze};`d{v~W^;ig0R+fKwUri(Gu*=-w=&ciDYgVy#I#Iwi
zV(AQGcNJZ(Is|^4rjZ()yn>(KAoietRM;1UrL6%Q(?&CqQWOsaIKGH+X)1)@EIt~q
zG@cgQiRF=cqQ}*f&3?(A*pbMlsf=B5^%v)!VAf?9{Lp0Vq+a_<?N@ipW?NT_qMZe0
z*PwS2573KJlv}Fi6Pgm;SA~saeC)@W_L6aER_xkUC%vo~6EeY|pt)?GS<>3-IEae`
zlu&??LOyqmhZKsng%@!eI?N5iv&|b<Pr}ap9L0A`ed@b}-~Spup=V>ss(HVEvI^DI
zG<<7%3nK#Uq&n%J5hCw$QVg;-m<A;Xl~tu}EiZL5E<w*t`Y#Ixct=<>%bas8%^cvx
zJI*Jnm_opaT*Z$KD!UfK@le?T-RgxKIv*_RTl>{rcCNsf)>u_nB7z$aG)+7zun+|_
z`-E}Zhp}|zQ5oe7iS|CJQDuC=zZa~J9s^V|&j+O804yTRT44OXhEe<D+;EoRXj&l9
zLrE%q<PhFi#Jqh>Vb)Dm?BRHx*NBH&JuqI75HZjBuNhMxL7gjB8`gMhMwRdz3Ukr%
z8Gi+Q(5dD}pTmjwxX=zgfGRre0B~Gcn8ge^BPBQd;7EH%b`?@oXbUL|=<V$t(Nwbm
z7)C-0oQbi9ldg0jmO)~NQuUTCW;B$jAb=_b=eP2aJ2Ri~nQHytetH-9;9@8=!NGB*
zlPWYmY8e_?_WN(|;w4=xQm#U$*-pKVTDkx&Wd+^E4Qw(qN6p~`ihZ#%Bg~x3qzwK{
z$>zsQCWU%)Kilnx6T)<r6Gap~1G0LRpTEtxO@f2P)J-5`I6w;SlJ{Q8^p|#S-(KU6
z!TH_7jI(zC<{sK`mn%f|v(Sdqz=_2je98KNTJ~-*Gn}#P3+ZXdzPzcN^U88@_W4RE
z@)gY_xQHwS$~_O0`(YeqJ;Q_`wLrPuFzsVz3~##=#`);<|1ow}mNUCUa|+RsPSUkR
zJJ#oX$5>vJ!i)81lY(dz!@2}dp0*~LjLvvAk${B1ycG<;e@vqFHj%ZLDP$_yt@iiE
zsb@Po0$ber$bIOy^L{Z$wt|QKS4B?{v+N2d>oB@w2WALm|JE$CT|1-*C?S6Cr@Op9
zKhsvM1hcRdmv{D&Yg5*2fD4}3%-V_Ud=dz*$&}$EP2VK`X{q=AFs|H?@vWv|l~Q@&
z(0iHQU*K+@o(JHKK0ft;U;G@z+yql~&47MxDKvbp+B<bl66@cIb;JQJ6;e}uu#`Of
zVv_k_GIEm6R8{KIlNWn9w83oq%}aw8GDSPPp}%`<!Yl=12+<U$ZM1?8BHuJwhA&F=
zRO8!c_N$auC7k>>B*=Jg%dhK}w{SIke7nVW-R*RqlAFM%rQy*Yo;}-|rD7;MQfHof
z@-BuU)$d`IUll;WDZ0GsoSq;)2LEImnY+Al%YUW3tQh4Q?=*$0^;#n1=6{5B+Mv2b
zm)6w#KpUVm?^}ofKjw^o0ieuSi~8tLudbq45F?ry&u?(=gu5|D8NCGT9I>GYCf0au
zG>(-I^u)EQ{VHJ8zrsKKR4~7iF``}2{3>;})IETf^0qVT8fTF_*idCIPDh3ft$W;R
z?YTlv|8-9?!#MjcS-L7-pO_wH&E)dl{92VwF-)6=4NmjUk(*a!+Q1!xej%k?x+|Rw
z+Z9i7<Lj-ItA2J|&Rt{<j`@Ix?EMEC_AfZ+g%NmWig(9<U_9E9u6@wMiKA2Z!}{&u
zFN(uKDPINN={0nw<}iM%8PRo#+h7Jkq*$WZDez%2FxI0!TU!bQIt;x}Z3evl$%V&*
z5k-Jeqe2n+mBh<ru+;ZAOj5-m-!A{&6zry0H&4FOuH7>Wj73xI>LMFp1G@BE**CJo
zFJauaIy0Luii$GvM6j#wQB9~@aXCgURWs$K#qZi*bt@g))D(%R#o6AbWv3sz(e~I+
zf1-g-cUu@qxqotFsykJ$xUALlxwvzMpQoP;o@0W|36qFiDs52RknQxDa@98Q>69>S
zjje=cf)z!Ve<oWLNV9CAM4~EJ?fi-Qmiw%J>b^W?8hy(<zY4&Mz*UH870bwMPFjA;
zwT19Lu24-Fb?$#AN@d90cG8QAN-cyo!*~ng_q5`u!KRF^gur!{YO0V+Nf_wK<Y?h?
zMU~U0#Ux}FMkCLf3*b1@(9x4>9t8>eO6a-;^}jo>?RpUrs|yv%kfk@ZZJW|GgB33#
zG3__0!n|gDmV^JJ<eP<>Ue7HEH=>c;WujXI?f|QToj~$7K`p$Nl!nfr@@7BYra}qh
zl67_%#++ta5M+{#7Cdeu#0cg+&wIs&`|&{;34CGH0^+-<mad5*B4DKqld6|7K+ZQ@
zFak{hlA#=O$!&(?-(+esr_3$4s}M~AzGe`%c*wI;TowiU5a#GsQ96qT0o>u7*B_}5
zX=aqm1yhNesZ(5Pf6tOb>m<#dY7Br9e`qdJF*xZcqqApr<6`FEp?A2#!EcZw)3ltR
zv+QC5rDBLIvfd}2Fqxu@EY^RT$7<(L$mByK@9zwiZOJu`YR9awDT(Azf~N|DaQ4s{
zsbbEe>u}1C?O?eY2p;``>xJdK6vG<3SqkoO?l$eRgrt4!iaWGh*^zq~+%8M{n{%^0
z%QQIozzeprdBO1#c^CnI!`44h5M~Uz+!?qmZ=d;!srEhpP|hCrXHHJHl_*kv*&7;N
z>fK7enwqM`ViA&IQ|+JgxDD6?`p!N+2@A^{NkJ*GT`EpHWb?>-as?SqLf3z>$wLCI
zqIVGQj1pcRj*pb^n}$-9DIY5{71Jf#W{o;HNj96L(yom?ZJMr41e)ARy;aPLJxJ=d
zGH@SeY&Hc(-m@B3Tmfm++w}<&UN&cil@<?OrJ=$L|4R|COE`0rk<Y^_2z>1}2JY=9
zM?3;|etxdH(FqBc?dfDV=WfKP!lFXB$m{)L2Y5i^hb*mt=D<nuO91|)=hrmd3lAcl
zIo2r2(Mfh)P(rjng-D`j>=*rhfBs;r{k1l4G2@7*!>U}!qlD~A>IoD;TgGZnHMFpu
zx_FQ~y~)5M;gSb$Gw;WdLn8YaqU2d2QEnNU2c8S|)MbKq013^hrAoR~jrs+j#afMu
z0ZrCi{aJ}^QHQtI>@ZTG_7t1?O4Jxl5ByoM^{;Q+DNUGO5&4thL#WvU*5Nr}CYsa}
zn2F6tZ@cJ>HJ|N|fn4+q05!W~B9BezsW9Fa`-_5U&zc0axCs(6KF&gIC@zz~Vtf_>
zvz)+~)p>*13aQFQQrRAn)Y@G^BpOck-K@DO0pKhxMdBSJENn9B$gM9nve3SQGUv_F
zrC7Y8;*YXae-ufE3L9j{ZOV%6q7QNK_~}RKA1)xv)rNayf|KCUvcx*Rz>8zJuFHln
z0_(V_h|Hn_u?cFSU{`6*3<3z~h1oA;(SKF<<q~#mkh)#+=7KAR%Dat$d?SUB+F9T9
zt*<r)5CuVn=Hh@!$+Y$63VYEc*YHakx+|aJ9p#rSBov_^ROE>r0%}O4kdn56_ds<J
zur_sdYxbg}^JI?zF@hV%J_s^Op1GvErAB!mPyz_#aS+0!<KNBjY!R3gzK$jD@|vcg
zv6sPo_4&Bj;1^%`P6lxNzjE^gmbl}CT{#UXDjV1x-?ghO7nJFn{LWAJD<ZU(SSXal
z3mOcE=$x)7MXMh8wIUEtN<~$}pDxwj@UDPv-s;Up3u8Is-2<>osU@#)C^+?5;lNrt
zS$3nQH_=}-fHcF@#Qy4SQqGJ6SG(8w9-5u%QKZcwJr)%|;}=Xuq8el+T814vz{wch
zrQl7(&fYZRX^klEUi$Wlg^0obQfUL3V)!e1nL@&Ddt6S&rdf<ET3v1tVx+DGf#H|x
z0kr(FrCURXUwIh1@AygI`N%E+d*jxSJ+`^uK0scyMl)FwY&bAqmi|5$d~Kx)-x(pU
z8?*(|tErbyiFZcF&PZA>vSI~^-|Nnyi-J_2$d){yyL2EXj6NKfo_};fJ~G1gVy}_Y
zNX95>gDjT09v)n9pfsc^nOR@;{I8#TK1DB7$}DoyzUi%KoI|TQUd=3Yj{9OkS3DxK
z*e22*i^Xdqzshv4%eRjsZisoytjy*_n?w!Dx8_Wa4jqOXl(E+FQNFjW6+yHTCoY#^
z%_C7%a{<Lve^8KBt8Dlkw>nCgu%HU)1R=@zMFY5sO!!r7Njn@Gk=88fUvkn2TkbiY
zz!11jj|t$kg~j1Jt5Aef=}1YY#9-Hn;^VbhF@;tVN9hHVGeIHtMS}<*dx(^5)%O8X
zU>$6+F*i5?+KyU+mQ|Bq!i@p)zy=nc80DoE?}6h)bJ5;ym#mc`*N{n<U<EkfgBK$Y
z5V>ALw(((z`%L{R_u7n9N0e=W8GV8WW!VRxy}m>&4CIFX#K<Q1==}2`rzN(UXn{6@
z%0VGS=pkUp92?_GMt4ikam;==WYbb_NBBA}^p!s?ryyu<vC8`t4nxxh72QUxHPFc}
zRL#M?4A!<LnfrMp6Y8Yf_Za1fjUoxtM@_j6OC2)6?rCgT?$9Vpz{IUxfmp#++3c}L
zi%D}WZZ<Q6^JvtP>gYfk(6~*UOb9_-=>IGR+V-RO67tP8D1;r(nrt&!A^Rp%aMR!z
zj0C);b*?2hf=UN0hII>SUss;u#(M9Q$+vIK1s@wSIVY$TBEt1%d+}8a7pQOvPvyZP
zup@bVlB|-GvNeyRAMY!<@!a8<SevPWrc?6P^(rylAsxgRWc;yOc3+WpzNR#X5C5dp
zr}EShCiu8K7{;TJ=%pTY#{BCp_Nfj5oq<bYM@vacB!0)J9utgIT|^okw~SG|uHzLH
zPh(kAr_JOhANHA$=jJR=vZ<xZ(aUCGWq(zchXN#9UY!%3KF6_%AcA7kwNSIH$vYX{
z;zP~3j;t048?3zLdK4t2=u{PhJTd?Vt3c5#^x8j;GGAHxH>bYn6=HkPZMNOD==UN+
zQ=#CWGt=LMgRQeSZE*w-O)zq*uq_7yMx+>sn$t*m2rb0a6-kQ-CaeS^AK!F-;!?u$
zEm}liAsym9D=LriD(L1oqY8!Br76O$izZ#%5RYp7Z73~4z;^};%9t@y>atE)r+0Pp
zvLUH+o7j}|(txmd0(ttQ`~(^Z7hUuhGbPx<6JMOa<L_0I{#1Bf2ffCtUw`S5$9^@7
z_c0L|2@L^iNztTJ<7<brAjPH<=LhVD<xTI(s3{!^vgkwQPWa-5MqM++r}CY@t)+`9
zot(;ZNN_(Vvo+m(fdzEkH<Dun3AhxuYfOIm>i?41(=(JQ*=D`2)t*)1>hRt13eJi6
zj9GNE0e#`1{khxO70IsY6U~hch!$d!;$RT*Z1#_8^7SCJHQ4@ZK9jTizqHl6i{(V~
znQ!BZvE}E668WATU$~>@-Hn5vTaKH8JJVcll(v(vkxy@esbko2dXJx-#|9x>lwsxE
z5X@9oM0U=N%*;PkwgZDIT`>af_vTo7T?Y~aztQ9<>R$R|%>>DQ25UhujdRho(729@
zV3(JRdwCE*H|1jY-FaHG1_+*v=3^fbG3nZMh95Wr2KeZqi(6sOZP8BAT!$aH$0%A6
zl`V!O;i^u<MVUmJlT<WQBNZ{Yhq<YJsV6=3?Y6xaLk$Mm5>y-8Qya%jJaA*h@0x6i
z0^_0;Yv;Mr%8*R;s_m0fW&T4cRq&LP<4pRBsNS4Dp!F_NfZP{fMJ$J#GM)l+F!wX&
zphI4q*AuGviYJWGT>b3|eo$E?si^Cphj5J2N4tQ#1beoa?MXTx48k7v@xXS0qq5mc
zE1hJ@yUG_}c^aF5_Cb>oVU8dgdqV|PMsgJRFk-SixxAp5#a~3-3+F(!gB0bS5vLmv
z=7O_Q2bl@hIcQT%6V@_v>VFP;x|s|>l1P)>-@C+->LsH2q@u)yTL>kiT=5dsl_DYS
z?cd_8idnHFblzc?%OLO;;J5r)UAMpXs__j;m9?+&`FxPNc*?APDfVgI;XV8R0i_3t
zW+ewr@}0{Y2Ll+rUZLUNG3`}mCFf25<rZs8)Kn1k-o~u!-qb!dF9jQIxuS0reY&@0
z=za8hZSbynfePT(XoXf?&nzAaRd@wW;R|}f-?Tc++g@c8aL9EYEF>PdhW_1qH89@#
zWz)FL@glS?5a8N%96MD|z2dO|G`B=x_pzn;00wCg{e<4fW5ce8&(X$>b>(|e*tRlc
zShVvD6h1p9vTHmt)rH|}`Mnr~%r56!4WePBepMj%@RKFX?S6B`xy_+BfHfgq3(DH)
z<~i>jiEmFxlr?=;A=k3Rcg4}Qa`nug*R{a=R@bz0$@_w^fiJviS)v&%-VSd=kO#E9
z%kKThW!;ka8|usg!Nn0E?unlE;O0l%D+FqFgIc{I!Dc3?_Hk$)6gm30tkm;nn@v#y
zM9{>2D-j~U02FHTB7;0nwby(FtI}=J+h^5ti+A06Ut6iU)7m8iJ*QI*a-y;I&JEt;
z4J}kY5yI!727+GQ(yD9Oe`WQjE;#$79|~SFe*xv*za)F1i!;E7-!=)b^Y4$Agcs`f
zTu|zEkN(=uoNu{hivk&mWIB&M?$y&LYY@U(VboU&BI)EoA4A$LUoTq|wWWQi{R(Uu
zYbH+(;ReZ6A$z|RjdAksW|>Yjs?Ce09;IO>*pEy8fv_PT=PAeuCl!vzdV3CLpeC(p
znoEfo)wAE{PS1(cr@wM_HY(B}wkEO$JrI51i;^J_c4(C99DZgBzGpK-MQDdG)|0j)
zV##Ok4$(zDLE-tHqpD1!a8^$cA%6COb=XpITX3estj27;U^84NR3^VXLt4j2PYQCG
zx4mgX?4r!-5+}hvi}HKJxq8;Vp&qhgc44`$*WDG99Gy8eL*bwu&ctP)ud+RVQf2Bg
zJTX@>@0S`E(o1+nOCg}kqDxP2Q*X(>Asgs?S$%sh1;?VcsGZ}xa+l9$G{mcI&gI^5
zaCE%!I+32Vx%e7-gGucBUfN1FTiIB5j_uswyKCOm$gAj}=Ty^c(j(07e)@L?R(l)Y
z@D#pKC#mn{_?gR;DC~@v1Ox0OWty6hPoZMX%6F-kK<a7ILDF*YM%C&TKy4&+V;mC4
zVPggqgkQ5GTCVuf7k9e2zwQqmTt%oqG}8>;q-{M>7I*~wB>R<sVY#{3!^hO`?2EnC
zstCsffDb8XWLhf79Xzt|!}lhMFD6Yp8Z@)rr+Y@hriM_|4Ui_ugVLUvalJ|=`*(m5
zp0Px-BBfGa>kdVpb;~d9Ht?B|4)cu4qBIw@LXoh!2EG}{vmMSE_45=gPNLvUvx_Fj
zr3XwnT$thi0z*#Dr|@T<;nM$j<js<m`X-lyeBxh|<z*DE@19*0il;+Y*Swc=JLSpW
z2k><1kq-^Ew@1`F)0F!L{?=6R5#k$DRaIfl1RbiLO#d5k?if+5%JT;;W>YY$h*``{
zG1GFJwp>|HBAfl7M;JL5>9AzKjXFzwALtCw$Mtx2JjA`xDQo+;6lHuJ+d}G#OmU#O
z`RATiXgB=D8OoM_dl#mlyz)p);+tQQ<QfxanMcpZ>K9y{P@M=_d0d2zg}(=I0+%*~
zy-*YjiuMKr=%oVtGX_^dlD{2HY$LAx8suUF7nIs`L%(P&ZG#>4j;E)7V2?@`T|1jn
zXOUPZ_)JOyF4+jCOf<{YdY?PWLITEzv*MOH&%Q?Y#rP)w0EbKpl0gOt8m|F#uLDA$
zIqqD(CI)h(`xTD@R`?V`eRHj`;Fe`4J*ji-7ElsP0D+~~?~b@Cwx#D|NA#RPgG^s+
z1-glvld?wRBoP5<^!##2RVFW_W0dlw35wPyn9eGdN)0$u8K~0$=r3dul+puqpnW-X
zl@r<y@TMWCxi<Je^IkQdU+UIZ*Eh<QKVqn^aD4v|vg)v%qCXvPuV-rFKObK&JAamb
zeB)!ae>$F4Xqa9s|KzyW1R9{dE%?6}Me%4MWhX#=L!&4yLOj%XuK(ZlQ{=g>BD-OE
z^Hsaz>$Q2R1<<;1(E9ujGPpVDazsr_z++671$G!3hk|yABBTd<_xYi`p$1P`2*`XW
zTJ2?;)PO7S{YY9F+<SmUhRKOHv;eSk=S{FSlWzcFoMsyYK101-@YbIz_X+QvOe?_E
zLMZF^Hjk=8K*QDv>tCR24F+UiJQ~He+UC#k`BIv>zv_N!>$~aQ+$L3$pVk?%?SeBh
zn}#|0j@=0TY1?7GGWO3!IvE9b3tP1|BY71S+c^8#+z<-G<#R1J6SF_}tP?r!zDwW)
z=gTAYwxF3$g0hxaMY<4=?27%|d4|R+6YqhJ*f(&<{B47fFCpe7*!Qa!<}VPaox!OD
zt(7p?hZjXPw<LX|gI3IId3}p7wh~C#=7WpPlgAhsx$K9byx1c{WHIm%j7#l-Qt8qx
z-z2d4YHLV_Zdq>{v0tD&Tz)uqX?B0nXqgIvs}60{M}wj!5Ip3P%y72lt^NZLY3h3H
zT#A`dA8@+K-(CZGq@-XbZ%JVJ<+~l4uMlOkSc&8uPV6jEoK}gjG;eH}!9+ZTW|S@%
z@lSNX-@!b&rrX4OpQ712MGQ|z>r>vOd=5O>N9w|w9BTKHPt~_Cwo`pmT=U!XKt8u1
zG%ao-DFwD@T0f<UkH=bgTv;|evex<qWFjZ!!l<24AS4*oBC0Rs{3ZXn$LZb(C*u{t
zwUFjp2)o9Ni*(pb%m%&QdL@S|u2w+@!y(hD;LK+8YO|&Uz7c@>jkBzEFmCoZ-wL})
zc*W6_v^Jx4CL$Wze69Q5!RI-<T;%#b?AuB^KfSvcNhi=!J*#FwM^H%q@|&<=By2is
z&GKIwYFK$jo~Bt7k0Z^22=oQ)HtWomnza2WEMW0|W^B+;jwGF47&Hy7`bIU6?2OC&
z(kNzrV+2?tdb$GQx&4)juJY8@F<iVFF(xATS0e;L;V6d5e#FT9GZE?Y!PFlsv5B5D
zbN_GqxXswN6O^x==Yy#d`G)6Q`Q}`or5~SgL_Mu5w|`JB`;P9jB`dvwjRy$M-qil?
zR@FR&GdxChQTPN_44)8)9Qm6O4Yc0I65m61hGJhuU^N{4_mf^eEybUT=ez&A{?t7y
zY6kS1nNbm5l?)qu28e44ehMmF@tK~2|EM^wSE{6*&7{$Sb?Lnso91Omp9}u{*rR6N
zkB7Qz71uE8=MSZJt28^uL9vdVZSP8^c!em^DZUkZ_LWoKN0|l&lkQ6WBKYjYlgUj$
zhQ;G8Mp@eBx&8K+*`kyXF&jIK4V?q>5AClr<Y*`Uexv9vjsWtXH1vC;UZ#7Ku{UaN
zAhTX65ntXD1v!kP>Fv)|XL#{MC5)*J)T>c4jMY1*(muA}LxYcO7jGtr?NW5CUN4__
zy<fzAARTkI!R<OF^6TMe^zrnq=>8OY0$2FL9B2)xGy&`Mln6gMwY^0?2@9wOc4S!d
z1o^<8Vg?~~e1<wAgEwr7=U+PJ-lJ;^?X%@$6>oX6>AO8W`qOdOm&b%ph{qc_BEk5x
z5q-0UYV19eLx)A!_1S`@p91dohu`iw$8)>*VMw2Mz--+cxUl2O8`$Z4^$jHMY4B~|
zw%{Sq@W!Uw6THKYU^DY8aXU6T(Xk~%B`H8lcC2N`wd?5+MK)c>p619=sjSSq=nVxO
z?kdqfCX;3d-DD{Gaog~rlvlKMV0<EV%|RVtsnURa7OH`6Gq^}<$~<B?Tb7Sk7~n9o
zv(ilVXa%xw|5IPd+ta{m7|b@{C$E<3rjxTBBNU#}jx?)}0W2K!1CFHUWm)ny1+wPZ
z3^%^qfZofytp{;@_Y7l@!>0*xyoQP!bp+gFd939!#TC5U70UhR_XM_^#QG*1i2;4a
zvCP#Z%&?~GaDyy^HDkE0C;Piyp07}#AWEb*Sw!m!g}*ljr_`cTjVwqRy<Gy;RkbVw
zxpaGuQN9dFgem!BX-!4`?)vTbkI2{pjtRe6*4Fd;?|@$-Yo6_T{;F-svHdi`RrSgB
zUAEtHbL~_T&ykzcs$(*Jlou;+Y_|fH(<Hi`@$Do1_Q4%@pK7uu*rkb1<>CrpUCOkY
z-{&Tk<>+W&H;aIjFP^t*EAXK@(<*N*$yaw6XC!{!Z+p2XS5@Nct$x05MKd2DkO;MT
zTeWGzuHOXMw3I7HADSGolP*pd9BSHZv6HI*-LS+?vNx1Q%cIl*2GPgw_2v{2HNDH+
zW8r|Cje@UT!g#?B{&c5JKn{2zIi~_^X)fwQSeP2F069yy1yKI%h}9eDZWj&S5e_<b
z2(NQQ1>p|e;=NCXdME!60J1<$zd?Bz=OWvFF85;L?GNAht!Dnft>0?r58V8%c2?g0
znfjO{xqR8Q&<dk)W^DbT*pX#w+4<C<RHg{00YHeE7lZjE!~Dc*(F`D%zA~#`Oylc+
z2GcmVe)2t(aJ0IhIl$TCdf7@m#O(N>ApDyx%Rh5vCpV7H2;4=TncNh2Cfl2<$rOlS
z=&mpv+ri|Xr|xL4k52b`y)3k)z%arak(7OTQRX;pWv*ZKwyWM_RzHzF@?Ba<O?xx7
zp@dNtD{+0Zs#yhkId-?z2hJ>}l4d4}l+0v`C~#f+6S}2{m#fVwk+Lz@_G=KX{i*RP
zZLdGhEQ&3gqLOVrmUY=nCZlkcE?u!SR@S0X)&f})9>N!Gbh+M-=i~`(^bi*xL7oPR
zw%2FzhaeKjjw-Ww6ki8Z_lRfld@`|KniGPz*m%2z|CQ6bE^^(^FE_Lja8KXFxrR(c
z`O}NU!W3@Jf(DG#muYS6Pq0{Sc?)Giw=?T8);(a|K?dGG;t(dv3@m6w9aJ;qsFQM-
ze6{TK>h>qxJ_@ae@iiL-8aZ}@kCQk_<A_q!do+fJ9o=mHt^Xl7iR1A>Jk7CNe=y)S
zjG1ml{pq2}<S42GJj@L1BpAn60s0$vCVt=K^p=p^z@4oFPqK8iZoEI9nUqDA{~s}P
zCYzD4$ihkN2j2M&-5$!QC)4<1>W|?S%0BRd?jt+#I6$+(#43Z;$mAsYKxnJ#tYf|h
zY-t#fFF9v4rW|Oh;RKBtXH=T9-edk{ei!J7`6PTLY~h0qVR#$_0_$&riSn)j%G(l9
z4ON@OFB2QRG0T;T2H;NyUp<fksEGKZ&!#EG7^S5!?ZLXF7*VG-)ZJ#MYcQ{Fkg(T)
zNzh2I?|(IzcWOjw-JXB7q5L2DDYpNVzr7?G)qsf&!;5-<49un;Mz?HZvHj=f=F{yb
zw*BY!_OmD3U+q7?#OLqFjlCZluQ3H@tNV9269=;%CamvY2K^6Zg9dtR{sRo*#9K3J
z(L?y#={61zd+_$}Yn4)|b>NlJ8mikkdEM-K0%vE(09YygNotqB`)%)S<A-K%@ATxP
zdDQJ4wmMw|^~oYa6b^z}!c<r(HIMdN2W4oh)9hLuJ#4)?X`G-9n!DL-c{K)Tu;YFA
zn|sWkpdrFZ54|L?NDqS}#1RHODO>RWTd~RF^*;#vvwHtN+E`-${d8+<I~V`=$@gE^
z|CjjSHt#2w9*4%l5cYw#xYd@Ylouy7-*c!i4yt#l>nCi33-WL<odGqCHZUd&NRJyB
zjc@~D!3wUyp=}V4YbtV@&U=~EjlLutfzY2*RvnamFpf8RfU*&;6pDx51dlajhH@Q~
zSvQtNOIx;c>&GKFO=}BmmDuf^a{Pb{6h@fZ((44`aBSFLW0aq9OzEfixQs}t*S(#}
zLR0w7JDI|NHDUL@ny`O0VgG8v{?&y2f13%r*mSQA$9{hrC-uuU;~}X7tVd}3Jqk1N
zBru2HG!u4$Vv^dn<ZC3>0W{RY)Cxbil&}1m1h^xU^aZ7%JPyQ2gWAJpnja^?@LIzo
z+O*5~$XmZewWO4^Lk&=!qu}H0nDmtPOHqDgoA@EPp=f~`xP620A-Hi=YDMA9sDR(P
zc$2oycC2Y6z<qz_AG2O%F}6qqN>z7@Fr~2t5MN^yROp#iowAO{llch5(wLmbf&ab=
zrZB1?<m}&G%bNwsj1pfCgKOE3FvhdbDzS5TYi6d^xTKg7FkWaGMJ*L>P*koN!wvHA
z6+LzC&Xd$iKH0iHef*a#iQ_2QD4{~FmgY{8a^*68dGW$~N;mQF1OJw>p+}D@93vJ>
ztb30i!;8MUy_8#9e5VpqEygeENo`rSxPqFDlR)w-V>1#dc7%~9Z|HIjHfkV2*`hCJ
zJ$zQ?*#Mr|+z}~RO`=5Tj-$~H<&0#_Ce$0i)J)@>a>bk<A~~W>>P5O#RJOBO?Im|<
z*T_JFPf6I-8F$r_F~-WYo|0~LS1!I`v>c2Q=qCdDNhNrrPuvImm&=xyuM_F5>OEUu
z7%I<rSjIsaiPo@CHpRG=X@{?_^s0sRN{!pA)1;AEnh;t|8k@Ph#&~y@AVW3g>{11*
zrOCp|yG9IVd}u_vG(cJ1--n&cNWaD$6vZ=+ma9kN8c51=jgdIGs5wjQFF>NB(1C_*
zt#%0!1HvlPTZUH?T;LUHs%1J#(V-3Ha8A}34k__02$Dz>oTHmh1v(Tp6Tx~KN;X}B
zi3<6X>m?JC(D+LpWR{u;v1y*+bkZNdSxC)T)tV-m&ZsV9R>L<R%R*DHlu27uSF05k
zK%W<YDpQq}K+^>h`pvqzAau=wRgoFT2A@Ik#(~okD7@(u@|1@l)>BN-cNChVm}ttM
zsr=|z+E^(tS7aZMvKn}TH~UouA&CvTV}~*()kLvU2Bj@gqPnmmHDf$>JZhIi;!s}b
zy+|8;@W3<X7T>~FVVKTnGy=WD1g=Lwly3qfowTA3>c;!<*EF*&9+1Ll9@uHHF%DPY
z_b<8g0fCMsIdC$HXA<aN?`?sMMZr&PI%qR2Uj~(ojikMYW-?!M{}E<Tdx<}68xfKk
zW_mi64u!+9XN-Mt&qeg$P7i_-GEahvQjzz-pkTWR)i5UHWomqX`Kw(deNG+C)R*b1
z)pA`w_R-T&Q6n^=`k(E2K-qwKCe=gJKAff9bk)P0ZYuUG=~nfeRMNF_0>hm+*qtaR
z;*oZn;_WM1#GD(00p$jfA;_>;OI^I(;DkU;gGFmmRec3+Suw(s)7(DSJX?sJ2s0g-
zB8pJO&dyLs6*rOE7OV!fat(H&xoq$;OlC>lWUOU|xSNr;vExWb70HvjoKH36Qj{fB
z(H$bwNKj9fAT-r3FFKd>KyOTbDMeS~mQ+|1x3Oq(NWU7pxA7DTW>DP`R2%$(5(%Vu
zLrg&_bKOxnM%nXhnIHX;Sq7)y7Tg{^TAdE7q>J*W+P@EpTDUu+I5X9(UL>$vW--b>
zGZ-lSPtu?Iv;HN9#pgmQL5)E3qf)wSvy7a~frnCyFvlz=kuJDg;ca3POi?XIhZs%*
z!B#m4NUMbFj@6^!thR!(OQwoh>oYUjg|~R=KNy&+LMNjIz-rM9;vk`1u#7&nnpsy(
zIa@KOkFk8za+meOvy1d9lb9n}kswfj&92KTg>$4H@__8sf=wM@Brdf!S6wBWDJBl4
zq6SB*;aQ<2YHT@pCY6?r#ei?p@<S60RH&0Hx=0!%0)`l{f96Ls&5qEnRZ7Ti8&3xT
zhW}!Y!O&5UN#t`5Sor9pi#p4i{y0#ed}S9BT!ryG;SRI}sF49Tj6QgDyFjKPq_Li(
zL~x;{o11v9O+wH{hRM5(R%lhF1&+Kypx@xY<rPv1DS{c)6g}vZR1Q*92otAx`KoMz
zCK?(dvR0)YD1i2PNFVq*fj@->i9MT=X^**g<rmpLyqX0I)GAJWKyH`9Kzr*r5re=;
z{hJ<Kaoa9t+Qb7LLW~G7=4n@2wuLbiTj)9Wz&bp$a5f0C35V&xi(&7lfi#(5o49rd
zB0FW}Il%5I+K_*+_Ear_(*;6Cz`>TdQ+D>^w6l7f8aU-ZveL}fG)HdLv`Sj!BPgYq
zq=kiq#&U&}sFi<FAOdDLF!eljvC%U%FeE>DVB*0t=hqZNX^mjr4Pha3VjoG{L^>Cu
zc)EgHq7B$1`_HTr#y$*(8K#*#fys>ju?L%S?)Xu0oo`f?q7%uILx+oEpy&!DlP{&k
z^HphP=~=+swnT3y_jAe)Z{YReKo^L&{(P!8FxOc@K%NA((AFSXItQ2HCqvytj1)Iz
z=!c^uB}XDJOnVNr;wKB#Q^ak#Au5?8NrPHb^^+b`#q@G9nX(cTmU4HC2A?|_egRX@
z=gYnoBfrcu@*?_Oz_eN7Qb%5Ao_O={dYNAV?lkcRN?S9OR54ZttJU>`++5kELrhQP
zI^p08^MJzzm+MHeT<s+*U8VE<NS)u5Zi=5O*(04FevU(L=H5wjSY!cBp+2yjAErWp
z+zo7HC(r7T;$1d>GDf1#LU{;0(3iWpZ4p0ZrrL@^6BAq|>)Vq@P+CDaY}%Hg6!}CO
zva{DVAdO$w=9j^SL(X_7LC`@SP5din9S;%aLyFAAnLI;<ezY04v9V49^nipr<0Ns-
z1~WX(WDb*+S8~K*^wYIv7!)I=+|0XRX=OQ|wW{3YrT88_TY62TFF04dwNuwbqUp@=
zY;Bt45+{o8L8aq()EnjiD$Q%a?S)#wB)bx+x%ELsPVTzy+HgJ^tx48CvIfE8^{mFc
zSO_;R6OfV8p7y3oR-&!OVGo0vS=TtJ9!{^VB_LI~^=<d|DKprfPffh^{fU1bjzYi;
zCXKg^zZ@5yE8Z--MLciUIdEgsBLu$O^;Bdxz3-_9=DwBZd|1`SmAQ7(6%%^vyWY0#
z=*(K1#Mb)xeDp>=HJ_#XAoHFFa-lqv`%ChEh%5z`7!X~AS8$+x2;1dDzGyB|992n~
zm`Gnm>2ZhK`PGh*mq99RXBMDi{VDXi79TD<rG0@DLykymss058in*{!L;#_SwGc{t
zyp2ecp22Cc%56fbQBwGow5!H+7@E;9CKs8(8J5XKd@290wq*VKxyz^6{u`<BOW1!u
z-G2IgF8=q^r%%4xe}9ROJOAJ2U(t?v>wZFdZwjpAFu=3SQ5;VPmvi8MFDCs+|8T+j
zY8L&~Ec&Zi^jEX!uV&F-&7w1A(JwgEb1o*fwu_c5gF1xw;#`3etD5rhksI`4!)l%Q
zE`8KT1G1&&*Drv(T}sBhVgv6rlD(`al#RuFK*@BJA$QBr2_T<?od(WBWFgE6(Lu=R
ze;@{Z8D9g-hf~Nk951HuBb;$wdOSbT@kvFCW#{jcW&=1*uhVVp{XnN*@2|F&rq{ER
ze{-hoY~t`VL7f#4A+@A5($}ZQ>#1b*_P$}gAYPilvtgvaz<+Sy<>cVz=_mJ6!!oWN
zG<Z|j`6;!mBRzc>!6^_!7!Og=5P6j2E4B47g5dx-D5kU-^uyMo)?Q9x3=uU|;Q%*H
z(<HiNM|(n=EZqQhG8`xkZhDlQaZk*0@W3)U<wgL>7=I+urn3B)g5P;c?>yBR&}&;2
z?{D;W$NiRpjDs<Tz0q%~_#a1`NP7d%-orDzjC}aZ=0j7%C-dFEoX+B;oX<;7>MaQ$
zeKQO4WMZIC;%u4aC`i-8Uw(PGWBgoum<DPR+(Z)E2AifP*M3?1<(EJAe_30r61<dJ
z3{|l}j~?zUh7$pp%5z7}>9U&BqMEa1HD^UN{be=%qMGN+YM$q60uS-$qgje?(sw0P
zn<vUvJ1hY2oQ&N4_rm^t{PX7aM}(4z7g;>R!UaUbL0sw63ViQavhTeDz&Re6BW8|;
zgwfIe@+%NNe%adoi!xeJOG6C>)**hcn5fX>O^i|rmC~bHQ=MXlQS~n1g!ShH&19JS
zk+C`gU8_=W1a<*qukyYC0!k0$mu`EneOOJn)+!ikx8G(Eqc1a;wg+{qYi-Un!3KnD
zR;$cKaPvg`C%Fl*w2V05#F~lqNvhFi7F`pT{c_hXj-LrLa`au{Qr5nLwH`?=;{}t`
zWYOg!UT24}QBPv%B_3;H54eG438$h71s{%rYmAUo)?uZL_)3NeDQ`RC4npc#y$6_^
z%5j{8ruPb*j9zdV_}ceXPG)S(?_=NKP`n1P*U}2=LW0kL?DgV%*!|Q340Z*eZB$L8
z-cycWx`mK+qR~Tb8ioSWHC=g$4U<Qb6{_hu(T6&C$|lW5WC=jTGbmTW^BqGQs{^)o
zi8pAzH=Fw52uqTLp$DfoR=KxC9KImLnN+}<*Yq6<CdqsF{VU2W$mlDGee>3mY=7cp
zcQ*@5X5mN~u;gyxa(C)PMb4{7yqmyoJlZ0IcigM8O-XYH&Zdm!l1CPC7q%(z_QdK$
z5bwH8#7_n(1a+kwLT=&;WOA50N%#UJ9V1z&&}4OeJHpJP{e!w8lL~!JuIre2I$@rG
zFv?LJ)iA~MkaZZ96l&GetcZ0L*C878b(L`<0wY7v^MEZTC59El=bHl(wf)It8Uy3T
z5K*E7NLR<q@*^7rW1#LNRY1uA@DCY3qUHuf$7q(&txnq89gGT^VC*imq!i_frfysv
zL)7bGxT@hy)F%v_<5~$=WkxJ6I;iKsj6stb##TTD3%Y{@q`#AV?Njn5fdy6~K43!j
z);8Djpb>(=SLk>p%s_NDJX$!>V7xMRA@YZmhlqKSi7|Lcfm+DaolQ9L60E<BX4q;o
zJ|~^rIUbj6jA(m4!Gvggpw<o4PZH%sAmH^Vop#JzXnQouh6Pm8FGc@LL+!0|tUa|`
znKAWH>UnO;#uF_Z6DNo;Z0&`QA<ELH_C+U0^E1v}3}TnMk-H+(i@-RIpsEYbpC~Wx
zc*Agt(JLcye;kAtJZGEM{c|F1Y$3~>yx(L#wfQi6hsEpW8)X>6m`F#G>zJ}D{A3JA
zL9bcR4YU}yT@zqSghOOc`YGDkpJT{6pfDPhpH@dyT0E{8g>Ez&-KE_h(Z^UzH{z|@
zU#ltCu~-3@QC875mTBl9zC7G|sPX&)e*V?M#1*<E!mHXtJft}>L49PlZ=rOP;OfaV
zp{_nv+3jQ@iqwA02iQb5T|LmvMFS;*@?Lu7(=-{|hPSm@sUYUt!uE?c-b{ZObL%kb
z&5T)Qwuu@e4AEQpjHVu$v$SBE45b2F5)9>rdBg&#cO6K09Gg~Bj4oaD<f|wPz=_~;
zp2bwkHI)Oeb@XVfQo;Z3h>S&?p>|b3R;qJ{skz4ex2_s5<v@s0OYX38h!VU@VYY5c
zh&qJodXjSXR9#kZ9HEHh#zA3HwU0KYsbP|iCdHYYt7~NoxUEE!!w!<*HkrL9AHoTp
zTC!Y`2eh6ZKW=w6GEbN2!_bY<s;BEG9}3Qt`YD$2*8B4*`6FBzW)rMsL=D?ZGF(lE
zo-QE2p49#Nq|V}-$T=ut;2qO7TWaNY0Ij&ofEA?SJGXtjX(^|_Lf3hQQAPM(>Khh_
zFsS@{9f=-4;xh>am4EuK*6|)6{@lYGo}aznf6t2Qg%#d5j&D=E)9l`+`0;7yO~qbv
zfP>mgK`GT!#`d+X6%gz^w4|C>G@m0yh;h;-7YsOQj+Gr12zwlcKf@{nx4MHb?EYm;
z-Km&_2*_qZp?BJepx`|;kv%-+Nr(UaWW{BHa|dSoM2^#fVXeGs3Q3PGx#IJGJa_0(
zqO3l@JYi>fVR_XD$POwlwxg%pMH+ZN_PTkJvl8Y-XWb64GkPnU1sAEQsQIx3;OtA{
zids|$-b-TngR4r~BQzp&fW^-(6ll)+>a+IBr{gIOfsc`Em3&`QB5>_k>hmf01m=!s
zH-|2qfa+B?8&1*DpW#q6;`NGSwhGVssZd!s;rs2=SBK5j=X;;*US0E|^HDzDe)cQu
z1#pm^=CLGpvxAK1lxkGsH&<{M6AR9mRL(iqF!i}NQs9w^G67S7#IZL*m-EjdiQFT(
z+(Di4#JJQkKZrx?YNu%N;F%D^<|DARY8VaID$XrYeK0me>*xRtZhwBBY9+5I3L_dn
z2TpyGK}NYoYpb<dvzk3p$GcUUEd~mmnZ<*0nX_JDe;x!AeHG`z8DdrrSAba9GCiz-
zkG@GCg-PT`<v}6A;pe`H4nM?$1_tpJ(Hnl2(;T7hZp?{S0P&_l74ey;&)f4TW-y<_
zqK;a5ua!dnbQF&AexHu99%0VSd6rn5zMq9dgO257poJrO)o$m9f)^$*@1iFl;+zp7
z>Yv?*&sQA%t2kb5_*jr8`aE@hz8ey7Ov@!f3i+foxO7>D>QNM*=1JZqrf_^6k{DJR
zAs3}Fx)|;9L8`4NolXP9CtE8)72OV2#aDIiM4pbN{mD|6p?w11E-GvHkX;p~aXiBz
z1pV2P6O&<`q2){bWDkDkS#*ISFyC{hX#8qE`f$&pv1J63JI1F1s6GzcsuNV%=vSmX
z#yAs6Vi-WIeE7G|{!5Pj3vM{2PcF@Xr~s6qlF|ZL6K%=V3RVr15YdTXp>+MZyBh6e
z=P=7kf6AAL+5K!KLdUVN(yX?H%&?rQ{9bx!EJa^|Kaiy8rMYt|>Sb;N|NP<QhUUe5
zWlqVGK5LvD>&L-3@vIz<WL?u?*&ki|H+ah=@xby|jQ@t)BYx7=wY7Z5Xj6Pgb>peE
zLvj%<t~`nIw8Y2*M0u!E$miyhbzo`IvdhSUK)gv+bzdmsGM8LPN0-8F|HtOZD@Cd=
zyeAchu7*C#AtdjgvaGuEu#%t0Klp(3V=z4jo<3Gf;EAZb*;IWNh#ewbWUeg+MP}Ln
zB1R*?emtE9bmJOCXu?0J-{&Fx_QC{y77G-~qwRvTn{$Pv0F`J#j7raT9*lFP*yFQ>
zf@9ob(VidI3ATkHq+INQ_6UaV5~>#nGWc0pn8DBD*~*-aZNr{aw`Gj+)`E{3)M~;H
zeijHoxe?`~tgI*w87O=`jjvY|ht~c1$5c*HIW9|r8iYfp$*eplV`UW;Qe}D;Q3`Ne
zWPi-?p&<^Rpz>u&#j4WAtjmK6hPmXlt*N*}wX-o5F5+42#qn4=EcKxk8k8D@3S%eH
zG_k8@q?hOE2wo@z=tp*d7ei{Kx4&B9LbuY9=%HlP;SK=VG1=oPntmh_D8R;=OIMGR
za@6WhnArX4)W5+5Y?Cy87zPo~+ChlW-MF}zqPpb^D5X<zTPfL7f~6%2%dhHLbgONx
zX^O?Jemoz|LfXwG>&YOPz`rlO@69V!V^M3msChX@@Z4g{h`=jIY@hC`Wq0Ve^|i$x
zFNhNwYa|qXh8!*vXY<g^oxHwNSt_jSlIi1|G=xo!{f|b`%}iChfFTIoGZx=wF?c`X
zetHGvlKKCQWcPm`>0rUWTxg_OC``X?99N8BVif*i#VKeY^Id5Ys3ZxC1vix|D4?=Z
z;=j*)0PB8>&b>E=Ta7-WP5B5w>76JJ`KHFUQ#><Qy7OWwb8l<!F1eD7!<=YGV`L_l
zz2KEs)^=BTi|j7E;9A*Tf&Gp)S1Fp+b1g275h)^M*?^3d%BP|8r|GX1wf;-w<)YKd
z-Bg(Hu2_1%2mR#zNJv^FQZkM*nMJoi6=4cR2tF(u5>3jmUf2u4l03x!qPpdlJMhC!
zTWlDYeaC)BHN#y?zcEZFOm+zfYdcQbj__U#`_V06!`Y*I+PMYrom&8R-i|MXUcCi$
z*S*$4;JsS_&#BH9LjLYn7(Zzpy}kwT^;-ZZJEvQ~{_`zh!>)Y`$p7DMP}1z)0`j-F
zfNbB5Ed{-M3(%+$yani&w*ZaiVJm^oc_OOM3J!eL^~oKC5dEz{Y0S<i5yd%)lKD9B
zwn(3}y8Wr8$pMHHb@T>24cK5!V2NvNdOK+P$L1L5j{6-mz=D^;zzW_n11fk445Z)<
z(quYg$}}`<ye4zw=r6L50?<g4MWEBmzar4YJPIJg;x9sAvs>^6$+)OD8Lfzl{+*>~
zu|1?cwm{TSv5_038M*fDAdh4uXp0o-4^IB{E}ZFPVcM?}1RVCQ*KfS_VU&|b2%u7`
zWprH1zdS8#8YHh2_;jiq?b#EbY;nsb5P83{x-actfd(?KW3-!NI7`~gYYU6?o&T2V
zLppfwdP9{Vg_IpU57s!|Hh${8Iz2E;8K;n3QCeQT<{?E^>F8S700=?_Q$uZOkkA1I
zW3aWA+Ju}|K(4S;o?b|TcaKtG&R}tjiY!584Ab8Q-Ul>2SCbh2O7Sptz-!F41vI6}
z%h*~tA~`0O@pM#jRW28W96u_uYTB0D#w1g&Vo^*{oD5xwJ-IVi4+n4*$@|e8?r&zu
z2;<rlPHTe%_3!ZBjIlwq5cpG=EKvkd3`+t{naU_eJO~0&fSDuk_+>{;ol;zjRea(o
zFBj*bkT6z!D{O(o6=P717?f^hCR@d?Cx`IJAF2Cg8Up*)aj;m56q|VeH3t!Z%|cx^
zHgc1{DdZ^&_ZxY_6Xjp|;YiJt)@IU=9C0}3)gbah_MGXLuxU6|W_YCm%kpH;&>v5?
zZVDCx#yw%c4og9HVY)Uq2Uo*-0E(K77kp>M&82PGgn!>RE!oStfD+=|<W>n^f~+$?
zNka|qv-qI$R2fkQ5Cb-?n@lYw`E@&H&c9@Fy~|iys1;CExrxw-kAv@{*9PlxvTdn#
zP|zUGm1+-lLG0E_!Zlz^iQIXQAln-#a|>jv(iKPDbZhd=*9E#evq-v0y571Jbmn`l
zl3P$@i54#1sW+`9U|bF&`iK<l8F6`HSqs(DevwW|O_D9G$N?}zl#Nc~SX}QTW!Tw=
zGto5T0l7K>?sJkYbnc(2bZaJ8z78Hz2t_*I4bVFt<CxF9tq)a7HHE8_o57?~Xk{{w
zq5y}8ff-SVqeOY*V2s+!a)qK=4w8C5+g}M!vbDMWB&&^MzC_nRiVJduDpKJKBTIwh
zi0R_BD{?#x(mW1lYT218_fWDit+F`sEGV<}Xhx*OrrdqY=fx0{Auo?3_Q_fSj)-D8
zT4Gnwe|7NJ|5z0NH;MZn`WQQU_PJ4j7svnI-g>h2BoqJl`|rQs{2KrFOMKk%f4BZx
z_1^l^KJ3!3gJ2XPr+YC*E_NQyk_i3@5(?BC%)iFz{TiqDYn<M%aeBYT>HXgtr`HM>
z+iCCpu-ATj-01d@Bnk5k#E%)vHkB+ee(ks6kV5soYaKn_wsMGECqA8tyKxf(?vm09
z<#QDaRBn)sNBAKf`@2q~`L2C>xc}-9dSqYzh$Lpbf1a=0I)Yh$jSJIVIeqV_+&Dy?
z=Fje$^3qWasJBztTY2fIw%_b@8~ghwC(Zxku4)u;RDaufje2HxRe9;CMrLW<pN|VF
z>etS3(%bfNw`i#9eNnqd?at}(F)WG&jq5TFAnjvBC%kso*RNf3d$6Q&qkyYA%tPx4
zR$)P9^}3)c^sDh>qjgwZTa|F(z1iIdR$YK}e(A1udIU7P_olF>ymwcIMba#qX?g3Y
z2psXK@d}XG+;`VC3KUdd(6D~(B+pl;2L;QX-?{ij2SFC_3VP>W@Wr*{rK4IGcV*z|
z?t1ENAyN)-e_DhVD&VMo2uspk58t@P*Ld56b&Phl1!GJLII6#CcNSBgQNWE|5F)w-
zY*@WbD>^L&_^#z2at@$iK;A_VfpppTS{rTACb8jEda*ym2(GCA7zI~;lnvFL?Mkby
z6b0D`x||X{-Tg97F%*X$oiN1{=WpJox0ByD0U57@*`c3^b#bMVH7@I6goAfsgj;i2
z@2^I@!d{vTbzlS+9D3z%tas){EcKyvl%zc9m8~w6?Hs^Ckq!oqoKMPc8$ZCte6nBO
zu5MSV-UF$X(c5FSZyezq6hd++KpEk=3;EVng6?@{xLXcI&X(53Qz-u41)LHGgJ~EI
zV=Jg*6c4gd@8NVz2Q+@jS!q30*;~H^pco1=`+R+xMj+-mvB8elwSr&Lf$u{wqI~w~
zd+Cox6kC^LebV_$XFP-^VsAQ+D5W6fkF*qX-`GT9>8;g%)9M}Qt>%*%jNL1n_+T99
zamxU4I61*>bH{Ui^0TFudH3Y!UgLG6b+nT!js2rnPWkS~#^H{u4XpL5v43#bc<q$!
zjQ!t*j<>BthiumacGCl%bNc#C?``uf90zvHYWyf)4H+C&J!qdE?eAn;J8B~Xb>IZ#
zt_9WPyyF-gN|;@Hd}cj-Yl(D<WiFU9O(gV?l2zb20M!oA;!(Q?r@%Ixn|`*;QOxxs
z>&p*&uq23+s*?cfXdI^j^RXVDO;}QjZ@^ujj3pU?(DbxpgD|P^`En47xOQw1Op<nQ
zia;=#?PPml$(~C<C@Rc=$P?=GLJ&-TIS@9{K3~`iA;q06IxPZT0z#-Vi%y%CpF2P}
zsMi8v5T~9N24T~&BJq@h@n4~Ti*6Nhrlu%N+<3pBxn+*=8+_j?h|dWU4z<}8Sjet}
z87+}PJodxL%)TO)<YeQhU`p*Iz1{lPZ!NSITKhfjo3+7MLQ$DwT=0n1XnCZ1lyqBY
z!?W+#lgv&Y#{Jo-ELa&1s+o8k)8N16K{CreUiYUL6Eo;OK!?5&FzFz|Vt*M8gDO4G
zj|(e9x49E+oN0I3Q2@k0e7Zwdz}AS)G26SEX6Orc#1cO6A(9o00{*Si?@<u-m<lu5
z1bAQsQvu^zs_Y*=9_V|7cX9VTBn9>}N2ONL0UQj3#x>{)r|7oTQ*wwH2foCLNKie_
zfhPTgm&UrOav~e9<94U@lL;7>92`OhvD|`80ouq{G0{H+!Gx<Qc%%3N!_WfG!UW?Y
zSSwTn>0MJxW-e1DXy^1`w$;n6W)&nx#8o`WO)N)}yb4DA6-wY$fwFOdpI83KoMC+A
zoMGeKQYL^n#7_HA@ddmSE|&#9zw4ds{fI~Ec7>cq?RTA{eSTNT-dsx;()fU$;_I_;
z9AG@FoI{ND+FPGtKvy1{eRA2y^AVLpPtTlxR*HtfwG|59V6pJfz_voOpje|<(u!0b
zNLz3m8(il@O3W~V>s2oa`T$mS3!`dpZaNFjxnx-tU8kZI@6Ytts^v7H=l<goI%u38
z8hVcO0H?5Dh<qVdN8s^Wpk}?INKfd^JSP5u>@T_XLNU{B=a<XBcC}bsdolHADc_(x
zCL-^VMPykb<Y6VNOs_tFnB*@e)zpp3Vj8+_BmWvo>W|_iNJSmTmWTzk`0_{X?1@<L
za;K(2|0+w^Ou89sUncV5$iGPPJtrutx)FYpY@aJsn`?fNF(pBf1a|w85v+7%1`&P9
z@ufsGiAN*FU-A18#xoqi86bjxVLTE2pfd<Br2LS8nI9t*U9GCi{xRL>G@mG?@x3F;
zKL2W4oPWiq*#4`25zgRv1BbiMZDX<h7yQ`H*?&EG@-_ea7x}2^uFc>$TG|Lc`s2wc
z&{R;92kWJc^?Ho|B=qm#W)z;|7a#wb^h@xl^Yh!%3>eP;%60VL^;5k5qhMCQyq7kX
ztpBHvx3)9u|JjqR@4v49FY!TJ?T<6c2`9F4K2CfeRR-7b^aHBVCIPv0pmE<DCJs?p
zOoK^0#WZfpLN04Zy7|}I_U6`B)$919D}RQH!j2ye!%;Yy#NG>^LSp_C?Mg4kemEkN
z(tbRC>9k4RL|9L%-f<Y9$I4M0PY0KC=*){rKhi%|gY^{cTW2$`GxMYVC>#zcGxv;Y
z2hoLCw_<f|+nN3Rrytdt)9?e?Fk)tg7yt0_TKEG38N$8^Pt8tzHIn^mB>UA!_N$TX
zS0mZ~jYhKJFd`$@-Vq!~-)N&*_1mzH75R%yV^e4KqhPj2x*Gb0Id(BM)p{S!y-Lxb
z%ApTvwpi8SE)C!N{=@;`9V~8FL#gZO9!87mkXA_I73K=3W%+3*n05I?@93LL130^K
zK-uHlj&6Ta1ck@RH#eO6dO9m;VLeqb6twdyj0U%DtCSTKGM|NAS+Ta*5z!vp!}g1Z
za2kal7x#bS&n|C)p&x=^(ip+Ek%vk_1<;+CHS9LINPqU@sG#OL+Juilwi{TqhJ@3f
z9L4*=$iHz>C9872o;vUJDL(&^Ztq@BfJ@GQ+nd|D^WW2F&%U1jzQjjwOr!<vy=fjE
zH&1%Jhc?q~%KcUxH{N#kFshQViM_byYj2>Rm#AYMQW_nbwHUi%7-4!6-5URdy-_{q
z1+I&y`Mq?N^bzL@$5;7Uk)v8<)Qg-IulydK9&{!7T^>}EidQZVDtMQP0e*8WMj$Ll
zvtintJn;H|{cBIZEvbPL7sOXr>K$KOVAs;j;PA)f--KK^W>m3XbdG^Ny_D+L`|+H-
z`gQCaiusJ8*T1ox>{Yq6@m^Ba4OhKh_vG|wuh9iLNHypy%N2?X$@R&J+Xb{QBeE)+
zI(sThHw!s@+zB1^dOe2+?rw@G=>a^Ty!B;&qDH6Uf5`ysSuxO(!v(;?>zU%=36&TZ
z5VC&Mk}#a13_2x^OK-}C89JIt`X(vMvnrLSIBz&|4>L>pf9oyC|K3mW{_iI@QU7yY
z|LL=M|NnmT@#eGa{{Q`xulxTO`MCZ6?_Y1bbr-$uSC#2kmFZWN=~tEMSC#4iN|mY7
zhz`eoe;SiUG<`^+F0Dr|lG$Jsp2LyTdWP9;_?et^)p0djD4|j!o$GfTUDpQMM-K!0
z5eePaqcs+wtWMLNy7^!b_Gk6J`2>S}Sw%z-vsTK2?qL8n455eb*xdXY1N967;JH&@
z?>kDN+)v#z5W(d3$q@(}lL-uaFCLG96E9X4_QwM&-sW@GQ463>fj-#uK(REKln9$T
zue%0)@Gp4tpeMLd;XVTse(v`_B&1B3%+EKH`MH@+N_%6_X-`VO@srE4X=nE#(7_Pp
zV1~`S4k9e6I#HG?8l>1kL*=Ck+B7tp0HIK%Sk?Br<?g6{{^*bP=aVu&RDtzu3&CXC
zS3NIN!HTB}YU4LVx<K^S2Xl44g>M|RZOp-eRb*gzZiX(VV#@<AOLBN9U4=eX9l#W3
zu>-cBu^R6W!Ob2<0GS30#|&88%01aO%?C&Dezg6(2rcw{v}J{?%g)P|^m??tu-LYN
zDS-IRE>zF~^fs-5BZkJ4GW8y7R!3W$eLhD320kdrD~K4dda@|Vk!}G27_nH(DcKb^
zibS`pQPkuwZIoJMoqyUCt}9BYt(x112Y_J)W-d@(Q%GS|>m4r&`&mjjx##Iv@?i9<
z(x>OThs^tsm1<6vK5A(P@Z6n)8Q|Qm?)ModICdy`=|@p8N+cLym9APag0Ffa^l6mC
ziX3sh{J_Lp)rjs++BRKfNtkh?#Z_UaRhGc^`*sS(z7@{h#Ei*hu+|d52=@ULti9|T
z?o^m$cp6;HVRKVnPsWZ$5nm<gFr^#BgUHCgkhnw`*aD<N5IU9n(}5fgXfO2|$E_-Q
zPhDfQ2DE+hL*)N6IFJ$~iv5ZreBcFF7$-H<ep%C?AJCBi*r#|yLI=<+iq8kw3-*T$
zuwz+&NEjvAX?qWLz5g%MS&e9lOPYFQ$O9m1E6^l9miVmshkK*Ik7y$>NRI$r)t!~#
zxjz`-ZL;gtAQ%<Bf?9NiTu`m>T|d)9<5kkX3<mR2(516vZU}KCw~M*DafFdtGcWa9
zjMW(iAaJ=xqF&BWE0KMP!bcbZ&kG0c+Gc@52*%1+U+n_M@>O4LwK8%X9Z=fj3>8}M
zCjo|?4brFiWo{SLPpu72N6+VID7;88r!{BA41>`?yn=lSL=v8l@USiklS9}?5k;7j
zF!--|h{84=0eo~1=2GIMNZGYaZp&=j6!T1RQ&`O8#t=HQ4A~6k{|)@i2sRp<7K^v|
zkG%r<i(?t;@6UBQjiS9ph!vA+v?rWWgM|$$B9F*X3%^+Vje0r0QQvlT!RM}_7!UJ%
zm13>P8>TQHH)(iom^b8B#2nRbK^h)ns-zDiXVd86OfgNx5K#$-B7u=1#5=!H-u9aD
z=^@l7^W?JEKev`h`c_8g{jOs^A7gj{N}bYcoOas>C(WjkO_$X=GUC1U$xDc_m7R|V
z8j`u|y7CxWO9UT$GImF&JkfXWh89eyMwuy8*+nf$d~%#VAfsV;F`r_{X_`7jtp|&L
zFv76#8yRANYR6DOof)7vRRe``%H+vW8?k%o`F)#VAaSj@3anr`;Uu-BangOPss6Xk
zPu!%Q-d6jlgQ<3U-M!=T11Smc04Bl9xCkv+jjD2G<x!xeP~k|H9vah6k$uk}g9~|H
zhtoeL0;tdWle*C?#a7V2{%HImgp**7+tueI@?VTmC;K^Ro^~ik-@hC7$w(|~6LxnD
zogTG*GEhXo?%I8A2c{U7)X+T3xwTa-#-8d#()3i!d@a#2&xf<J<xt5B_>m(?KOT=k
zdVzxnN-%?9hD9;W09~qv$tCKK7=naRQO657Dx~zhUU1G}v1%Anssf70;wP9>KvIzg
zBTDx}WldnC@O(;FJo<oyHx&K|({a$wZUv+3H4l40m%Vo<t!^`A=EjU=Q<mml<<gU=
z`AX&Qm8L9T+&yciSYI@8mguiiRo!J!Fx78@(Zq~!LpeZTYurdK!{N+OPudCYWxKR?
zSxZlMi1%pgc$=nZRu7vOzqJh0m;Lihsv#|;(ajWRBY{4`;bfwZn&(b6AZ+fYkaJ$B
z1Wa?1x7%+`b0WUkbfjqzU19&c%4MqgHo0T9ml4vzu3NgH8)!YiFyh-sBU}mouD#@g
zShn-#I}g!jSE9pNF3C;$PWMbzHL9f#9oZcmWY9rcxiuYds-8kRfL^3SwC2$<AsJ-w
z;L?dm2_PM%onXZpy>Xl_CPkt^phPCgOgbt_LzKh6K|EZfiZtXT9;JXJ8TGC!+;O@*
znMbQ_GR9oUBRctbcJ8HRM@&XNB_?sqo7NI(fueQP+iM&izG_%8p$P!W@ziz|e`oZy
z7PM67lmnL!Myk=0=Vk?{ap6I+aCPW&43^MRUuC=opfa~=XJ#=WEgNf|$s^SwY0*~O
z=g}?HMWo3Di_{RysKBNu#a&QC)0zcSG{pglc$PkGMl;yu*9Sqm8#F%#{W+Q};8i9X
zs_3nW>?kM)jx+m`lSw@=RAJQzu*Q%%<Z~}M)(p%Clvmp2Z13#*JkgYqFa?LzWaXY2
zYPS369hC3@WYV98B!m_t&)j{o>O3nJ)J#<GuLC`W`3g1%4rfIvj|3lOicpA9F{?e4
zH`1)<j!5poOP7d#e)LBGv0`2XsE?r=)V&X9Mj<2ro~cJH7~!W<4r!?#az&(NRFwY%
zk(L>uAqa&RnEsJZ1|Z@igCeat-aQCGqAb66*lZk~9<wB$U3r64Dpu58=Y)D0Mpp4S
z3Njur2AqPDG`IL!=erGIidB^XZ#K7YV$K7-8td5=W69?jNh;lyvX?fw=xVv5r~_;r
zz0OX3wjG>A%^r;TaD^Fj)h%m9Fa@9fn;xCFlL{2M%wQR+H*RCHyPok%7tK+Dy2(j`
z(a_TAX^kQ8W(R8PVpX8tz~1TPjAn38iRZ~N05oNg2_l)y#h6er7$kBcWhp8ky+0pu
zI76RWE(ws2+=lu6+1wu?AlytJQtIh$jDZT1xC(8NMmgkbyErm8TU@&ROMEv8`yb?r
z?WRPRZq6p_UK?!zufrs$T7WSB<ai8~fSQ4MQ%5-WU+QCdPg{6iR1@M%<-Bk51Z>D8
zmE6Xa_RLSG*CDKo{SSdMlvFG0(nsqaQr#<7k&fGhZ&3Q3$FE5AEp{ZCPt_F>sx8u+
zp>UX{14OO0;#|e5Wo!MU>n~kA5^j@6n2tVC2|<%fip>v%8^w9a$j*|hqf#vwh%(Gy
zQn6F*-5f*6aT&=YX(@;LJ{qIqeThm{S><UZY|_1pbl+6>q+&`R_S={_J7%oa5|uT?
zJc;gejtbzmnov`Qqb_FkzC)^|*hF;Q+7@sz`@?{?C+x_0KAMFSn0fU6N|x?aIFnHv
z)f}^#TM!lAZvtEBE#>e+;+s#qeJ!62*0CUu+H|=@i`UqH+$)mt#p|*=4Flqmz~KBG
zMKXgW`{XJ`d__VG@uoALB-V^E!-T@;0hLLTc`&GY=W~qhDoqSWc)x=yKAz7e^O?#)
zimP2vQnJv1!ZyyxG{9KNA%!#MYwlIH1rwH9Sz|I-hlMppUN6w71DFv5#*UOQqU%5C
zSc(X_1TNk_EM6|K;s_z7$TWC50y8p=qPnwisb_fpeQ>^&mX#3rI$9Qrjfy{?#Wgx)
z(l&^FhdB<24VWXHM}wG@zG1S!a>OLsmA4xdzVg-(S;@Fyt56$KUfBhLa)*yn=fSPD
z1v%ZyAerIuZncRJ`ztl)uA}w3dA2rA(P{^nT=~<`S1yCfT=ixmML5BHf}RD29(E3^
zcr52bTl0=QIhjxJrU+M)X~IfMePUumKO8B}brnF5F43M>5%moL!rh@>&*$k@38WR}
zoivXRf9|2x{?8bRbwL@tN4MlqwTV#;op<`>uD9*l>daC`B5S)1G(HFEJguHcx@$*$
zGNDlA)HG1M;CK{Y2h%dug`#xWe>i!Fa`+Yq;G2djk}O=Lu6?>odEsu(%qDFYcj~3p
zQkxxfOFxYJz>xTQhIpe^hZ;Mu8+}_VqmQHNip3}F8kCDU4-7q39gpo8&ZNRuVS4k&
z;f!$}tr>NaKA>xFg_<fs$v_@BF9ryu=jkcmJW?AC2})Z-Em!zjL319+N*e_IDW0EG
zW{<wMK|bG7$Z?>><D2Q|k)o37nufbp$;p>#pKC9rnI4w+YC1cR`h2pxugs;9f0;^b
zW@t+X3p<4#?ika9Uj)b-F)KKT4YwVl0d2t`l`7gA=&t21ZhmkI_XCXF;UI-v4P%7Y
zKHp-Fd^Was4HWobYFlJ})=5M(>coQ}hYtL>m)ds0QbXUH*UgiHo}bdbts50<D3VHu
zO{2sSP6G5^A82ya#hu+VIJnt2jH7~4<q+*otiz^_i0`09QC<Ogt7@qVu6U9i!UnoL
z?VYq<nYrTdlZIhWzZs_KCX;X-i8|JWs#85|UtX`I9OmU#cn^eEMB0ur>&>Esi>iGC
zTJ_f2b8>=&H6BlI)@&mO`+`Zi@)P7%(wTtt;*+Hv-lmY~Q=V45UkE~3N?EU9=Dtz2
z6-B9+6-xjsC{=VLqkVC>`(_mCcsNYO8?^j1bbFURupl1`;_{6-OaaoncGuK|zaa~n
zT!0*+ixx6oz($@*D><p+8`ri76*Mh4Dq<Rd7b<f5nsfx1U(J(16**JB&FuO2waDr`
zz72#3{1=Bh!J&f)f`dWr7_5339bgUv)QiaC7IO?4Mo>?dr0&ArBc2T`$Eghp23s>`
zO-A&M5$J@YR~VaJl^nTDEW*c8L!quJj$b;3k^B61uh(E`Z^S+n{O=}z5ep=CRbgSk
zv>>3&g`|`gbkI#exh#rmG0%LBA=7Yy^s5heUD&rs8P&5i;}&Ufm58{WG5X;{e0rcm
z3r+Ty=EJJZba8XD4%AgG6A<Wmzz1i*ka-?<iUYZ`pLHljwvswMq00MwJ}lTj7M&9v
zV#J~oW45fa#x|dQa*0OcI12F=bWAA)p)05WaY@)b{QT(OwvSrf_KD-N!05Ae!=1YV
zUDnM462LQHo(#~Pa*QN}8lWr{fKW_+Br)bBv6U-gLB<a5xQs?|Jn>))_>iN5Oxm+g
z)^Vj1V5-vSCL>NM%Q8G2DtU}lPVs!o55=n3R73Jjo3GseSAYf#6iIp-&o3_PCMY&_
zLr94id<>Hr3-*IR?jLYw$laAQiIZNL@Pa{$!^i|B@c~Yno#Sov>BldR^YS7u?ghKE
z@CKV`3albr#t8T!O7aK66zw$NKM;u6LcZ)Q4c!Q%c~CTW%_|@@)~1^`9jSa;)k3Iv
zPPvuFw5=nB`EsO^n;X$lq%-DEG5SFcZ7W(1eB<V-JeVx$H@qaB1?g6Z*>_<X)eH$-
zjT_a2=RxY0l7+_*NP$jwO_;s{*QqZ`SG`h$kA1%90!U;3V>q6VbIf@@J_m{d$&V=1
zvhYmQ9To*EnZoJ@I?Dja!s{xfd4L^CwCdk<o$<Bvo0=ll5mHnQ8=SPvxm&V~$RA=9
zmPE)RoGtAeEYhjiqNXlCsa_fmqEi*yf^RLF?E@+1=v(Ht1G_j7hqz7<u$J5V_Q~UA
z-D*S}E@TqprBXNwXE(e%N}v|O0Y)l`eHm)v;e9F^zh<GeMDtBaC9jc%VKO!G1*A@9
z&{!pALn5$akT5UPtP5e<A-2IqcPG5pL4GRf0JGi7@8xAfieIlV%W$7#IV*}wgP}Z`
zjI#{JdC2d{Y1lR8+N6{h`az|-_UB}+>h2bM_dD9Z1qZ~>=gSf1FG_EzWGnF|)r=4)
z6(ldB-o(B^UdKQ=>&RjZ=0k!A2_$r@otZJwJmh7N^yG}Eokb!_W{56<CIwb##^O}P
zYa>Bhr1@kkQTyk0w?(1>-eFgDx4kbrQFN$K0f3b80JH7<HK4C9t5%bO3oJ&AVL9&j
z%+F#{bDESe?OCb~Vmopn*<}_KDTxLBDcR)AFvl=I>mD;%3_cX_g;z?;Bqv?KmWkM_
zdrgK3NB1hb?PWpv=katV_oVvj8E+d!KILRUcvop`J-{48%k_X^;awGa27ZX*YnU&a
zCzG_1OaKsOal`$C-d=~(yoPLbZef|)SU2nDwcxe6yCP(E(^jfvLp33X#BUbZ6E3+6
z%UM{wA&FVsNe=vQG@mZ9HOYCYRBWFVk~6b*21|NJsf$tH=Z|3H&DoHM2MgzXQ#M_x
zZwlVvlPrQ#$&@Z#4R00nQ&CsR={+xDoo~R%2xK@PRn7fW6D@*E@0{hzUJp-oM#UL3
zBwoXwCw~!{$NdtdQ@BuxMV&g`FSUEo2Z&s}YnY@5X>@DbHpEtblEU#Da}}fz&4BAB
zLt08=#ST5Boix}LM{?Ce-}SaK{nN+RZ?b0q#Do@)dbUV{>IU?i^Bz2~R<}~K8Ueoh
z#pt>HSc}JN@QPcmGs|!=f8%e&ZgBQM`yx2fM!Gx}EF~KaJB{yuXA3P&sjtXfgdi?J
z{4xQ|rNwWsl6V@_RO|-g8HuI27q_#MW@A4~q%M_W-qgmjR!MEV6a!Iu7-422dt<Cq
ziXPaaT<F+Fkcd?bD_H0hAqPt0bcQ_*F~iUh8aZBBW|EjT?`f(W_8V@~Sj0Q+;(F)H
zG2WuHyMsw$FP+<8O0Lh%rn^%({#{^5OH}quQ}mmvi5YJGWTB=wNv=nWhg;YSS<YA&
zC?cu7WdC)XKfU*5X35BOaaT<>ZWaT){Mgm@2btByjeuB;#qM{J?TLPf_Fyd<BX+T^
zDybCpyI5IM<?u}%v)OF1Luk%20?Y2he@0mcBgk+8)<TfzumVePu|cNQ&z!-pOYA<D
z7)@i*8sh<5xnJ(jIZDspqVcSHZ$YOsIFGTyeGq#!?;jW(7vt0n#CVnRm7Bs@4mpHg
zR**QBx4u(0<@O$B#Xjv;y*0tpS|ty2l_47Pi|tsj_{8wZxE@<Yo9pFVt@0zyC<U+z
zU)p8;8AP=Q#NFO+?|AzZQU=W;$0*3t4ObGVL!zO9Q`M$EGPWwKVsYl=p!(wDOPC*2
zBIEWh8f}E}U-Mudu=X)f8gYjSy8Gw^6A0YPqks+Ar`R|f`O^!EYE0q+svAc^bOC1=
zN-lt8g~r=;?}Uhk?0f0*Mk|xgZ)SWel6(j!>e5HGpo1!_R?O3m8M^^5gBnuC3hF@J
zumf<eo4FL$jU@0^FbE7pfpt@h(#iYHUy*S={O+MS^;~k=znqpQReWcgf~Dalm9(4l
z_Fm_!ZOUN{kY@3yJbAQ5cJ|e+O@U`O^UGAVBl<R#iea6v(<hI%ExQc({isZ1#TRa0
z3U#q&vMVw@S@(wiI2=((Qf=W02VUOD$UvG?Ld*hfuA-(eZ=yX7F2V%Jh!5C0-nDrg
z)?Lz86%I$#>|xgm<+{Xe`5?jo3o71YHV&sd>g#7Yvq~ZuvC%!pzlD~#8Jk_Y2-Gh8
zhLvvByY!RPmEGz)k@&iwwQuQ@fr}6S=IcxxM!u>^prX_yMwk`s{F9kwyl?Hy#)XG}
zjyninVe;jNWy))?__FJ={`ZXXQZFRqc&qvboN7MFU5&FoHw}jYztx=MT9L2mJIe&n
z+cKOqLLguq4Ety)S|{ZmDlRFeurWMbv^HxRqsuPN&VznxkgC?ORyoU5@bn^UAl|df
zyhr$f!$`Pq+t(O2!Zb26sM*b0d6W5!`BYDgY9IDl(=vv-pW4#=GW{i5t8Q)OO)K+?
z0@HfVk}d}n&IMM1So3X&d7fe;D)PSDPuUXnl;>*>_mk=apD>T~Z}`Dxv@K2mfk1x0
zGh?dg+a|;cO$*G3@#8Qh)_a4~SevPEz>#B%t+nx!JC``?I!w0llQC$fT5c28#U{<v
z5oS_Fw$1r2W*3<N$k^XLT4HC+E^F*gJQ?}@z#4{J^5ljhu4+K51s0mz68)R12=hz8
zu-=tL@HoE+Hb~_XCTuV}PXahBX&<rjapm+#FACSmChh#Xc?X9i6$N}1hhbt=OilE$
z5K39){9|0B6>?P>M5e3cn1kmnx(-IUFTRen=(%IBX3q}#q}R6CB^Y=VUMk^bLFN=I
z47n#l-!a%`0t+jw0mHs9|1~^$v%(E|Zxhc>v7@KhF~f4t$+P=chw-?CAyfuhWEqV+
zLa~Kbo++j`p9Zbp!X_)HBynE-72TLBjUwTF6n;RrHJHZvXhxPN>9r9#DB;yuI5VB1
z?X_)01|~G%&ZcF-)bl=b;Z-=;Y@~}t8kt)l%#P}4B?9PIaf=pXPr*-Co8!y%k6y0)
zQ)FB+dW&kocrr`9eDkU$Q#$`b=GfXy`sxo6m>oI!EMsdxY${P|5!AF-#ox-z7rS{t
z5LG`P;LJ!PX{tH4(Y9i;vVmP~3%Ox!n_NccGxQ`j+|%$p%O_P!7G=Zf&EhCv(yF$m
zb)7%}dw?sAq?DkrrjFb+9@ulGkdTWf_eaeWCJU4aGP47^CdEt^XyppDt%|P}p~0Lv
zfvJ-Q-U1CE&Ru;LDiEqay~yPFScgYfIwP>?2Jo42^y8z^t;v|FxHCx15fCv`H>hFN
z((~I;;%5`0l6_XE#RGND|3atj6s>m|VtzC!0Ng0BW9gG@VBkeVvp@`O<$(1r9t}hi
zmylg@;xmGQrRP%VFVt~|m0YM$t~!#5+i}1#ESQKtJ(c7-7lABOfDb}_4xYGGRX!yE
zJEP|+sJ+mJD&5_v_KJI321rp<=Eds<Ke<3Pv#a{-ss{of9(9}ps=br~hUW;^nlG(}
zC9>W(>qSVPU0Je<Bh=!*I*a0e-w%<EGykXjt@SCSc)gE7NI(F+LmNx-e{Vj4cUJz-
z?XB<O(bxQ+U*Pli<Hp_(jn~ay3l3g?FO`yD*2C4;M}woX(11!0yx%(U){GkT5dL<$
zjl;tpy#4!HrBrGicxB9&*KM4<Zgy4rv7H_HQYrmOYL>tIZSQU4hh}f@^yH*@)a@O%
zI$Z?wNfRH({!EzqDy8Ppe(RtNZFHJl-MPcotCPkFW+u!xWtLO@g$6p_cfaMw_6Y#f
zxO<$YA^<eRV>ra4Yhqc${2#?_iq}7ea2kfA;Pcy9y#BYJeg8PK{<ps0di?n7`u`H2
zZ@o7>-=3Q9(zj*`-#sIR@2#@|7el&jF5qv))C<+wWW_}R69*U-M=pk6b@shc*bgF%
z7L-WfJIo}C*CsTsQv20^?sD45*uzYWu}+N`dzf}H=0JIMa;zNS!?^!}-OK86sna>^
zA%r9u!LQ~|jkm{#&CagkRKZ6d%_hCf@7gFlXVX~ci`>%-jOv(uh|+N>90vd8mA@;W
zcA7otOQpJ1(Y<(-?M4lHS=bePS>imG-Danoj$sxgvl6h=qsH6jE|iw%rQ;u7@3oH(
z=&?fCq)!;hm+m2SeC4Qx@33a+O-uBBjsI+)?0#2HE(7#Hn+6lldZlOR()-=>uRnMX
ze<Pn1@4N3Fe|lI+;k1ql;oz%P;T$)*dvDxu=+&xlI&B)Z6A-^!1_?;M1xG@lSI&{F
zJSgd!1emp$LDT+NIzDM0w0`>A?#4WsZUBM%qmtU~pxbZ$wkw%K6>~4~p82!9g~?NM
zEKepME?Dj>somX#x9fdZ-UrHoJ+ty%nH#Tcd{;KhRCG<Vt)iM{nY5<aC#>m$h_%gf
zggM#O#0^ez;xHa5x*lo31M(>?$?UdIy1P%GJ^uc$@&I%9Hcxg<NF@p3zy)yWpasrB
z>vic*13y5$_df&gCP+$unuG&lRU5PMWW!utHCa6201BZM*>~l%eUOaK@lthb`}_JP
z{BNuDr+E~96ywz*Soj)Ob1*Cg9|>l@e}Iw$rGQ7Xl762Rw%_gTDaYgxej)zqrM<l!
zO}NRWSL=HZ$(s8+5ZCtp{AX|dllKxtg{zHd4kfmY?++e$LH{y_LGA5fKmq;*tpPpn
z{q$2Y*q?q{74A<z8Gs)>0>GGf<ZbK!HZc9j-*#*5$EA0TlOy2zo!#0yyjZHega2db
zhW@NJnZ~min@!*usj6#|{1<*lag8!_M;A3pX;uq$&ZcQn+Hbx(ecd}aY`pILZP%+^
z!2d4>=Rhru!`>b}hT)l=sd%;Facd8IeSAy>D)?Q0Q{Al4n$W;24DxVa!IW=6*!w>N
z<#$dGVA1R*up@QTpFY22Zr2m$Bh0x{hX&HB_|xV^6;&Bo?&_7PxYS)-siYe~Y5(p1
zE>lP?x%7dE0rjJ5Es5!#QYsn)sqjGaEg0jMGG+sflZrR(Cneg89LO<tuN4qv05OrY
z8W2I0hOxXdl{JT*DQgei=-UeTb>V}!<}vIrsF|+m%=PG-H4O*A(&kvX*YS3c4_k|v
z-au2<id9P#I1BD&BD4H$ceA8KIg;Y|l%?5my-zp8PEp76c;!6Wt?etk5{rWZBFyM|
z(%DM&FpTCOv2HlT)Zgvn<`GFIwC|8INds-+;x%7aHe}PJa)keVRroMp80EIw2*s}2
zs6V}#P{=BMGiOxa&6lFyOIaJPxutK!lNtO65^gdot=jXu^t%X~oq5#mAU5d=^{BVE
zmu2Wec0U3wJlOJn4@mB*h4^kQnMc1Tv-u#5*B<heFnA42rWyJSKRa(4Fvr9ZcWbXL
zRA%2Yk!w6+LaK%_Xc*T32N%&0c{7DV&IJRD!-fun!EHycTKIkGIariuuxUp6t>9an
zLE3OGQ==UzqMPN>=O%66pI(PiMU7ati@^=bd>RV{n?{BSW_eTr5^IASXgur_Wg+JY
zS&r=q|0$6AHe6`UVt+L>-@ONJq`T&*cp?;9jt@^?w~ltH19(myQcyVjDc$Rh;`qaS
zqShO9a3?!jy#-V}Q}pw+%*)K%#V`e2uG`kmq8?b#q(9$!`@tmf%IN7!5vT`&7$rxT
z(;y%l5^4ue)H@!3>3hSm-=D^Ku;C|{B{^2_$obk)MBZE)ry@FoU(&(+l8)<_WZYEe
z%;NA1$olcNs@lVAFX$AsMz5hUDV=YN>zDN5e@C}!mM-Xt0>V8~-Il(TNUg9#FHKln
zcnL&9+mHfeO~ek@a1F)+rD~BjV}~C0<rVy^aV^tgsyBAb=KEG(N~H0C0`RB5Y!DfQ
z<R*u<c>pHc{Vmb$L{Z6HGf497SN{n|Da}rVH@KJymZT$C!&tv1bJ>~jY!NfFJf&DE
zyW-Ru)If4ftD-j)<`_l%MnTDTcmXRaWtV%dH~AsC*aHtu*p|(t!~}iE!iJL}8P)Bv
znINpzQ%>|MjC_oFzEdhvYVCOPB-zNm0y^^t{sispH}tbhyTgByog+@ceD`;SX?13+
zwd&q?FF=Z5jb3K{GgP!l`?jF7HC|@RI-JMVJ&YhX_gOl#iOV^{qM_x+^tm%|OZ1~+
z)zLS6Y<7))e@4%gKs@<yAvdR9t=4Dr!x~~D@vw>7c6~F)K$eUkyt?@iCXO-i3v(3m
z<g+l$FmBmLVCQl2(a}eKVfIm;d`=&S|37=rw%oR{<g@t|6FQDbg`z~sk~gxY9GZkE
ztSM6FMUE@+VL>1y!KMhB1Z8WpuG-qF{eZ374>@(7&em@2Hz<F!-90nF3;^CFTXABd
z5(^y6rKjiC-P4yL&~xPQt>g`zeGjNCF63Jb=;Q^-*WssIbGKV-u%jXg$%=G;8S8@O
z?4<7fg;?(N5#5b2&ct7d5-j87&+_akzv}_E%p0MW?$zGfXlQ5CQ25kB4vW~Vgxcfy
zu^e?Y;nz(@GTLp#6*9CO=q$&Z_<?PB%Flnfke4}OT0YM&G2b}+BW^YLzx<uI*y_MP
zC!2l^+JNUJEJJepI1$lM*Z6WGu7h#{-2e_1Seu1mUTxymIgW0f<C|}th}r<gKuo}~
ztfc30pAt<0!g>;8tG(fjQ!gSqz$=PxGcQ`5!#c3{^rqaxixkO&VM;cajp62<KM~)&
z<{Z=OWyM;V=@rjF|GOme;T;eTgF%S;cS%Hp=vyS0#C4><Noi{@eB8X)zp`Ia_fWne
zgxsqinEn0tIHvFXRZ;uu1x@!=o2^b7-T7Nop-<}jr|(5@7JTAf@Rn}0&n(b26rM$9
zYkX*8y~JZGX~TiFBsw6LOk_&N=VRnBy3N@$<2=Oc=7jZt$)67hSsu9nd94k}B;rMx
z6Wg85Vc^6I3w*yDKd{3bykREugfl~vg@&77bexcZ6>KaXKtZ!AP9~t@uL-BU3Y0P=
z4|doCsy~kNXwAI2ry4AAG;^@E3;%n0?OIXjKt(f2S^I8?a+Y7C{*QnM&!c=N==#X-
z?%F^608`)TqI!spt3A3TpF&F*91DsKFWBnvbc*n69yu22GGrs7v2b2SX88(R0mQE4
z&+M*6fBO8FcL|KHGuR2yoOFA)dUy!A?UcN#{&APt1L*Ei19@&0fKa$}9-LwoE<r<M
zei$<f1|;v>^Z9&Q<{J#1Q}@GeAg^S5kX?R6Z$urD<Cky0{guCdWP55RIKsQ`aCf4_
zQ_n5PfoKWsR$nin{ip#k9`siKRCWSO)g5-|_FbUH(517@O2UC)5LFJb(I9;3RUE_N
zO2wnsYU({3%52pH(%Fc>Tm{-@2X=Er8pqE^SmlXemxynJ%qC_I(E|m_oqe-vbn5&2
zO{3L$X11EU+mA%)R9vPS;Dt0`zN(pkJ)SZf08^~V17lJD<!bp%qu=0nj-v?^b?W4Z
z_XM-&g>Z8xdUS}%AnqQfiS{GX{CgK~p<&ofSg7)%qkcmAnxsP61YH^2)WnCZB5{>M
z+eFFhgtoM*0_t~Va)AIitz-l#lQewd_tp38?xg&vFVgG7DHNP2kt;Ms^r*w4jmZQI
zCJc_Qf23Eb9Y&LiBvLcM#1Su~wwF?V-0*s5k?A#a_VE2|u1S&r?4;pNR#BLD$S2*L
zMx@Sh*gnJXN3lP#m>@4VH%?rI-wjTHw9ppX;qLxX7uIrnBcT9GdJgQ$8>0`I6YHdR
zMP|w542jPdJOJ$N)vj~7>Tdqic3N%W+YDX+WQ9h-ZhG}%b0f{9x&r?xAX~k(h9jbl
z$gE0~z#Q2iG0=0M)YKV(bh?w!%HT|G1b#tYAit8bo?;y?3Y~`bh^?NI`kRf~DHxDO
zsYS~O70Nt2j3~Q%bdO2&tum6RSl6S^_%B=SvOIC8UhqW{k9oI$>ZR_TIsJ40qK5)q
z=M1gv)vPF6!;oc(MN@sx8~92WRfVx#7>rc@=%8MEMYpNMU2te+7+Gf!3@D8U3rB?!
zqN$&ZTA9mEVY2>zKseu8#~ii%A3xrjX#WFGRR4biva_vQw>-!5mFxe{G5(rB{3dP8
zu>aa#f3zO8|Jr`MwEwu1=f0EyKLwuM_44O?DJ_Yv!}K%?bpUBfVn9mn#S=M&pneb+
z_j}x`7voT86hrjT1YKInj{76`40UHP*Biw#7#yyF(J!=;_=PNCQFoz3&N~uac`J!(
ze7w*A9YJGH*(1%@9gmHXZjb1Ec`$+=dn133J;nVW{@4!vdFx#5v7c@0HTq4#PF|v0
zD#d%p2iMOOw8(_2F*w#KyfASv_RuHykG!J7YqrDEfxdWJag2s%&@Qul&&^QQ4cVq<
zY3}e`m|^pE{5!xdKR-(NY+L**0`*A3w1qHnzkVTF&A#i`2TmWxB_rJ>0Iwvx0+fL9
z@SSkXGPWfHy&;4-25`uP?}DLJ90Ys=iAiIF%%vP=Dud&M;}G-06qz*@X^kDWHhIW|
z^MQ!LIfkrbg&f<WO^$th!q(PUA-}~&4&bmm3XxMEh`2%GFBDuCk?n+$^AVB<Xp_)F
zFY1}^M9v(Ovm-|XE+7(L^TP9-VoCj-G^Mr!)bl(qUH@Ew5!9}_$F-&Px`<a2ac)Xk
zqK55q5K2mDC3Or~7)2&(rH-B=$Qgs`geobZ#^g3^i#+oo6N|cPoYxn=q@eYfcdJR`
z8b$>pV*r|_h^=6%<`_-B39+q00LQ&9LKNB*py=Zp9Tb_{n2D!k93^!C!>FJQoUn!w
z4qjxiL@^1Z!=E%}l@Lj2j)?CNz=)ueAvEYUgLciNST4dRl!YsJR?{%MaTmpSLM(mi
zdH4r)DLjnn*6T*0g6y9Hs4?1muoKiTx?&^i)M3RVb1qO%;6H@%#2Uh%40qU(Wt$Rg
zHE}BrJj;kip}p+QdqN(e85&xXJ=lAX0SDfg)d9?pD2{+7l5Ysjq{av!5tBRGqWTS*
z?e)59!y*XsjK&2fxL@piK0mATpBo+t5I@$?xsveM$UXhSwoT#F){#B`VHU7uqslI>
zu!i&;Xg~>S<_-CxXKyf?F8=-gd(9Ii9^EJ7)1SBTNDq>OU|;YlxBV!WelSkw-e@~c
zGJsVc(~&@AA{Ol`En*BL8kV01cDPkl9sl7-@Vpc^=)EJ{>h&>@Ug!XG2HL8PVy$9G
zu-4gXL84CyJDe0Zt=MQ3U#a+tqBIh+IEG(!Ha!?;<x+Z+i<JEN&Fg50H0gw8p2<}X
zyi;>aP|QEl93}=BQcns!Ng=uL5Ys)etuH;R{P~{+_<yb{d4o1)@c)~I82`VqzP`2O
z|L@{SV)kb-_TsuoOVagc_ktK`l|wj`s~DMh1sQ#eQT#*;kd~5MihaU_xB5hvUaZoo
z)Y_#^yVh<RWu1WwJ)>n)p_i|O0B*`Qeb%8(8VKu58e>OsX}JI<Ab_kS+WV}7T|w)e
zLFe5VC~n!aNlr-Bwn{-vj(k2O{y#>-#-+N!_I?}0+!!~+M5%}g;o0F7dJHpDdtFun
zUTYnn3!hQsNEc!D$prUrDiY3QsD@#3GRA7{ko$8DkrG=msSpwyTA&|1m*d^eq=}xG
zOiF)L&f-b&CeEOu6k>yA&ZLNp8c7`UGcJ`ODa`9By@{fW!$T`Il!=L#T_r?ArRj}_
zw!>CN^j9Fk3S<egUh0A(mC7;ntDulyR$PLhPL^qFk2qZ8C$rVrFPhbM!-z;>ID`VA
z4*%KdJMTkZcye+<CUxRr9?|I>+b>p|vgR{ci{<;4eV*aJa+1u_Xe#NPP#{5ze-bWd
zH9CSU5e~jqNZSTt<rK${EL;;(QbtTBvbY5}RMU$VuJFQX**_Im!*O3-qbkuzL(^=R
zN=CD}q#wWhX94<8ns6-K#!UKedpk=1Z9d*u(tmgHtgWTi)|e1gbTNSY^?zOe@AW@^
z`}g1e?fM_r|IM!d^ZIYU{m1p+um5)aKiB_v{dbIRU)apAKh77n^1N*5<I5%=Ut6qv
z;bIt<XV%;EORMKy=2;Ov*<&U&J|R(L7fYv72^Ubep+BWn(VmDycINogoY>mZ6YntU
zl2>zM8$bWG<3AeKNEa#5dHi7XIv@oycuucmL+8I5Z4hVhMX)^XO<s>z43rse)GDhV
zr6ts;Y|$fTB3WtYRKk(XOE@kfzg7dMsb%8?vV^`HKO?`S4wUvAV`6ohzBkAOzbY^T
z$HO5;U6FT4vXw-t_+xl2%BJ6o;;pFF%QVf(k$Gg~7`$}MN=?q80D^{d$^^xe2$h`8
z8TJijn}U#%)kkMh7?;fE#TgI-RJ%^o3v!?^f!5W6MlD7>#%V_`HpIGmj>V&@_r3Ru
zAowODn*{oyW!IZUP6on|=;Y57^3Tpi=Ixvmpq-0P`FMk&)Kk!I5%Q02DQFYInY3DX
zP2RC7l8=&@ok$=;y~-{cY+q@o-(AJ=iIIxo!~;4pNvOD_3cr|V0s1dAr(dv*S@hrL
zMvVS@yuQ7p|L)?sh5nC{MhDStNw?6`!S6)8Mf4ehqhZ434*xp!DET;rTv(EaUl)1!
z35dS?!aTk6(yVQ6%%B193ypHh#g&t2d38?Ef_jDi-BprE0;UoHw@^!(M872}Ny$pX
zh!eY#_?n@~v=~)6LC5I}pew6l=L<+n9FHU#@iP;aUoKsVH7HXRsv1~6ph`p3^45Cs
zXEFK@eNiml#tiyzWBYM5{s%nE_#b!jd|C7#x;9x#?v|w4S45hPFZrFCzanLHkODPX
z<DO4nGD#AjKce)kit9Tdag_W0C5a<R92k1MTSeUDSo^rsXxBPrW53w0wmuV;v%vX}
zK7nr3#*Fj7P}qva|Jquf|9A5Q`&LJKO%Tp^IxkwCgVcQy@?yg0q+|RY7vR`E3_NS_
zx%0wjJ8UpM>A5z0!4+Cz2cil60-cK*r569i^Xvq>Nl-qc+8r@q9>-2Ds0zbq(_O@_
z8YC2-9hoP?b7XVuqC=%K^e=3LQgeiM>rvP=9bC|PcXaM_gH2d;V$}2eXx^bB?Up_v
zl4{F9qs+N*eYJMEQ^pEv{T8rC%s})r0W#VChcF8{Q+eSR`S`$BF;W83)1eEyQ7V9O
z2H7QvE%_G@NT`XQXn2-<lRQ=MF!{ab`tpfC^Y8yRv;D<q#{R#x9@GCQ6xNsazjyL{
z68<ld)w`XQFE9Zk41Pp*7a?^ur_Jsy3}^#NS>)Y_-V3Y<b6R8_AC4cQL8O+{ei*$l
z2zpX@qNT%b2|NWk^RO)pTZf=xU=-vM2bO=1Od`HhaS;YeA<D&hL4^5Bx7U+QA{JAN
z{6&!K5)%m)C%o68-LTU8A9W*Qz!$O<Pc*@DAkYouv$IWK5tke@nsrjdFtrWeQE)56
zJ%<LbGHUY#?c*d1*LWq^-B?v2v-H(ky)KPLmqw#YqtT_&Xt0|ujYgM7qs#lXKi{)}
z{7;6NSh$Uu_kVHwPx!Uu|L)@Xg6{uh(30f^;PL|SE4l!5FFWWH=udOaXVNm3_k7DM
zzNmIQj5i6xl;2$^G6U|8(z=2E_ri`KXPp0!9&Kzy&i~D=rTq79o;yDOC;Ei^q7}oJ
zq`{Ij_#>!oE3QhnG--tB1gvN1aoqW(>cf=Wl_q;K#Xrv%^JW^mjiLK%=~J{Ie2Q{`
zC+o|P;sEA1^iSfIC|5e-TH;Cc0wcV$*nFK-h3fe<(X}b>tIV>M=>4=5RDyRUTk=wA
zJIMp;jeONARF&>Pm7{H{2h|dJP9<tb8*uJXRrK#hURCvF6zRis&#AXF3r+NP`n!<3
zvf*HC5<G)`2Nlif9Tff45)cu8ph>Igk8Uv_ba(o4bx*9~QyB;70?nAqJ7svkLfPh`
z^#5nk|KHe*%Kr+Fm-e4`@_a$^KM@srN#ieR{I7_{|D%ihh!PQGh;b~n)jMn{`HPb%
z+@3?l()#aBfGlwS^Z2hfXk+^MU)bC(#O(jpx0dJsojhwRDYg=G;kB`zV}~xxXQ#(1
zLmp%7>4iw>q5~k2Xu&J&j6BiyF7}`{tT55t7ym^1=s-lAj7f0~)ey!bRMn8q8!<&_
zIl;DdG0L&`z*RBW!SJs)_OX@=4|Y)3wy+Ld#SR-d!wc6(CuW18cj<P~Zz<}6;E{Xk
z^?KfWJb+RE(B<~*Sm?s>cLZE42HObLZv;@b2eit?n2s#pBDGC`^u)WwPZD{3&v$Jn
z$7^F;vs0?^s12jel?D~=W<ATjaEAFwpg@xfQY0wQ)$Z7KlAw`L2%v5R4cAX~WK~_y
z9-|hDB}Z-z2E~I6LpUCR&~dHaD8xRE8rH0KB<Nqwaj76?AXyGTMSTW<!&Djq*XKHn
zREIYlL1S0!#KCFP4RGx-*mvQhgA)Z{xbS?3ar8iOn5!<#L9RnZm>7Ad{(GDP%A}%G
zn?lRGHXe>R<%T$?`h0ecMxqCpxpiPRS+l<1dRc534Bn3#^<%Sal-aXa@X=tU`q8U~
zSvhF2gL<`WG@2BbzErQZ8s@Whs}2e2ViQWHX~n>|V(k?(emZIx%_gfin0a_qHKD$j
zs9scSnMO0mcz8v#R>?7_gVpLSRy7aJ7G!JHbJ#9c7B9)_`|QwYln&r$@tIjQTd%0e
zeX~`==JuhzB0DNJT4t$TEjHLuyKz)+Qf=5jAh=4^qIqbP^8f?1%Zy{A)?&?rVznCS
zZvAD=XkZ7lzCNS6s%G(7)!@xRZ_8%GD7CO#;adri2tdM7-8?c%CcYRy8PKC*<5do-
zr46fIYZ@=wkPp7Ia`CWOfj(wtU<XF1)NUAu2zY%T>uI*1HCtw@-7;9EUM~~cn?~c<
zEE&xwtXgjp;@V9h-^#^S5u3+a0Bi6W-k-IbCgP8fUTYbRMw^^sWMRx-0)_wwMfAT*
zxUScz&w#9Y;}zD6$e^Lfv6lx1q{EokME6>aBBG-S2rRYKoX{%Zv!!&F)r?BjtQfVD
zfnV!b(Mz+5;m&dJ%qHeBdE+mO&~h8QPlE=q@mFOo=V)k|xzCE_V-tbrnXxvQ5=~P~
zA4qMsO9uk`xGdI^yg7bya{_6T_S|^YDb?FBmRn)s!0Nkp@x&YYnbQkDhnk&P_DhQI
zUhG%#icdr+&e9J?I}f@$4@Q~n4ofpC-QiK5JNQ<Gf#z?g<G#(`j*FdQqtfhjvQLzn
zNou!R2+}^X_vdcUVVU);=Es^@BRCp;Vo{6zE~(o^tQ@36;utT>nIzOjR9PgQrw!@+
z5GiR=XXp87GZY%$nLtTBn+|*%D~y2NgwTQnR!oH;DN96A5*A3kp_}N%#(|##Q6Y1b
z&yM!X_%I;8O|sY6_yZs$#z3KXzWfbU;agB4fv+(&lT;|-Gpc~YX<-L;8L&|wZQ>#0
zd$!l3lho-WB`t%R`$OOi@JNNFp$<IHRiaESktaIzQ^gp%;wnoY7}aW>ZN}79ryDR#
zm=|~l!Dj_cis;;k`hA}`H`IYYEFMj{kz$H}$%nxEV@y@iCFz?w&sY&oYm9L_8uOQj
z@JE%F$0`k&c^ojo>F|#2?XqoTrhojU&!^k;=y39xHM7}|%1lMeqRhDe7WnRdHYU|y
zEzCFXq)^G2II#l2k|st8=m6Lu@icjk$3VR%AxYSLY_TqKTF;uTVyoR$q&dh4Qn>?Y
zrRNMYy8JB=%*`W+gTAb|co*PyE$L=TR-{;7z(n=0god}riEp)(=)XY5jHyVf=dd0k
zI@y?Q1JYBG!IqlWh1bc|k?!}5a`JtBLLGR@*D8EpOkSScz=bc5frVr)*PwSscy;?t
zTAxgSGP7?FsZj<DjE*d_RFKGuVE=ovQq!bjvEhdE(X1U8t0s^{27CBm^biGO(FR~K
zb+ggcGy^xVYH|^XvQOsOmtQ)_&XMht?T@V<oo<eUE5zzw0l^P1z->4=IuKm4vJ<2Q
zZ4RSz?>%Q1-#chTg|rS?5C~cX(tx8yOj4wXuEVe9kwG{I?m)H`(WK|AMa<?-7qVxP
zMb(<^<BH1%NL>ipcxV;EV8B=ht;&xKKkCCWf)N?hh{z^%>E?pwnUO`ipq1vdJN+BP
zIi1&DQFm-Nk4w9R7@NVa<nYB6!@VF6tZsJ*>l0bn<TVKFK4XSupYtWMLWYQxmlpRq
zUvErIKc|}ursI1w_Z*;y1+o>D4WpP>K$91B%BovrW{OcL8F1+y^3Pol2xfjmfwP_)
z9;s8f=e~7-QQnDEg(J7R7c{!dzSAbd6FncUjgFF8o4zvd+JrGUYM95!c+o)U&E)i&
zlE!5`@`1utH_8B~qD3!{yBmhs*^M1*a*|FBm8uHi6Ns(Ey*zHV$?X?yn7aXWg%iGB
zKTO9-08Vw1*al_BIGK`(f<!9Qjv#8}!IXRJTm^z4JWMTmyI?5ThACR_+YU~Vu19-h
zP6%pf5_X-Q3lx<cb8V6%MkVG)v{O2lLga%2c&LJl@nBaGAV=+{0v<1BF*T9m5#oK|
z<z%eY9isbT&r&VZ7AJpZH(d#uPT#mOA_Ss`d28sNojH*$BtY!R6&nvQ5r&>d5{Bvx
zmk(Muz^puHlw+Hp4{+2d$fYJ7c$1cDbJ+c9qZ3r{DF$a=;Hem^KUYI<X{YNi{g&rj
zIIn%qIz*39*o7UzYvM2JePm+_aI37fM00A@$nN*iJelMEr*vq&b*k>jALacI{teog
zrT_70>v8P<=g~6$-<>>Mh-hT?-G2Az?HL?Rr|wxcb)S`p*TP++Qgu&KsiWtWPU*lX
zJ?|XW%k8Ss%v7r8vkis;|5i8h>)8~Zft1$Shq+(oXP>CQ!^OMxh6x3~{gr1^zBNDc
z>{YY&JTWi)(<nAxsd<a#a>w||D79NCQqHJhDw!U$lIL#~8?Zrls0m&jHlP)g<dxnk
zWP>J+TG`y!JDA!xYvs;Sv2~DvWaF5j{tC5qVAfhqwl*FO*U%M1kH2~YpZ}yhM(vnU
zF%=O|DdLgRIoS8vKjU6*dlv%~BH}6CbNg@k^$O|COv46cU=bCrdGNstN`yF<5&`jE
zqkKW==VwFU|DU~oU2fw@7Dmzan@>^3*b+biAOPMZ%G6pA2})R|2o6C?_Gfv+4WL2x
z2tZ@H0ba(VFHW3@^8hDeKgf>#YwtKG&NHm<jZR*ws;l|}fEUU38e+y2&|R0TtgNie
ztjsKUI(M3sQ@@BmSQ<F29KlC5(?L9YFEFuaVWoK>`1c~nW){k3%cE=-p=@TN412C0
zA0IZj9Rg31bbjwZ?D>Iv02%@BAakMP3yy^Sb2<2A)riRV4nD_VY#d={op$?hE)eK>
zY<yp?d#t4THsU}G2-15KIssK-Wo{3u)y$U2g+bW<3=7)iD!Sp{n_WNn=XUuYdy~l>
z`dGC8S8B=qA4G!3{r@X`q60S12d&d}Mz2;lyA2(`PaM$v!fF4d>Dl>LWLNdcWGMYF
z%wxL0VveQ2bOg<r`9pKdId>`(ve3?*!ZevBj7nPH;6s*9&k3jBn+0Cw)p13Xk#ZF{
zL9B}L@>O2<m~y5vo(+c+P|`uu$42yn$d6PSxMoxF{r4h=Dv!wFSL1vDe!1iRP?mMC
zORrRd$jH{NA==rY{E}+)l;knpPmm-GG+IS|f_eZ{EpZOigWm+EJcS`ZqoNk9k%p%_
zCJly4n`a!c{FbJwrBhIrLvjfuXMEK_hO-^L&T`~K<B3d-ndz-38?Zd~&=JJ;(_7Bj
zle&nn0^v+1c`i=n<WM4#lIy_sE|jHYmeQRa<@@_YmL|8+qxxY!!eyZ-o<Lvl=CE~|
zrwfw{%1e=#-_8!M;Gx^T@Td6-6ptFiDnv+yShO*;Saz@7UjBDeMIS%E!{-+JzjN0V
zpo{MRswDLP>c-Y%{^zgq`2)p&0DWN#Xe*n^pjS?bFTE|#hkh3{>9FUc14roNF<#FZ
z<4J~ljcnMP!sZ-K{mFz4%F^S)aU0kcUPvfbvB8&*5hj1=2ouMp8&r)O0-}8?)n@xA
z2|T&=xKiU$k}W;hjj?~?SQL48hU0Q1v|jP~tqn^gbY-XtU$O8Qq!JHOaol%!T4LSK
z@py6Tf8S5G{1^7`lIt(+Ggtnr*5H3tTmGwVJ?8)WN+0wB*l!<tT~RAnM5!d|Vo&sM
z#?A<Dxgc2&qei-c6Wqwahj_41Wvf)HR5xKaafX-96trUW*Bf|4Z!+;gz8g=0qW+N@
zDwJpon`s3g)YZ=eC#wK^9~?SeP~My4-ebJcW4zI0ywPL4(PO;Pzh1nNam+9nIlaIS
z@r>a?j2b<3)Q(#(&@IV+HuPW@u&o?96rD^k@B!V)KnEbwEa8oZ7_j8gDRu`+yzK{V
z?;kEn=vG`!NI@rgeDvgPvjh8e=k%xJM(16<ZE2!-iHI-@Y)02e8In9^+ww6=f|82?
zZ|a8^{b1A3uo4YDzePjO=QUK_x<yOXt$9tY*KX0&dTm})TN}4%N-LC~lj@N@wKS1D
zw<qr3PhtAx)ecgy>fkTi(4ZfS?*+gd*LkhUeVI|Oay=N#t@(Uj%>{L<Tk|U~Y+$`+
zsg?FLD0hB+3BuUDV#G_7MVmbND5JTC_fObsyEpXWDSCZA6%!xtT?mkgpu|B>L2Z6Y
z0zq@Yj=Jck5#lxtJFl#VO~}3|Mu0p>VT4k?_=g+#(9_fn^}cLXaE4dTO-RRqr77;=
z=rW(j-~nvd91019MOmQ$@&Pu6R!_t&hB--xY!HSM7*I0g=te%=m2?L9Lfb&j>GpEP
zbtF_O_Y*b;4Uv(>93qWLnqCURA$M|+QE(st$B3<};$uayU`rqZHbF>=8Yzpn{*`v@
zjZk4;kAhQx0N|{FG>h#(qqsnv9vXj@jd$er`*=>pkO&ydIRJ>_6Y3RxRg4jG;W~YE
zp@)4yJ}_~>c0M-T;xrajnn6hkYT<E-@Pf%wqFQGAQ=C}iSFK~!#!Ky+J(^5!%$Wtk
z;y4tZMgrXrFlPdYj?QG_Vo2K=Fd}OIx$>V5J@mDvXPbhAQ;c8q`#b?&ST=*4R2-Vc
z7Q~Y$YKZu*QcxpEV*$AN^aCmy+l7qCNFDmY7RABjC60J7bYP@%nGsmLSzXAcIwRWh
z^4$J23DUEwVJgJ3wsl;lO;iQG!CDbJ8M&j-okF#us1!v;!x)Srtz6;7GcLq$252G7
z=dIyDp+ZTT5{-R!!L}N^xnq@DCN%$3DB8dybF<cKkl~C?2tQpQjZe{|&)Ho*k9R3w
zzTH3Rysw|+pBKYe+u=p&70;`LC;6J@C#yg-rn|xnd;NT%t6P6Ss6nil5A}NO4+u3#
zF!Q0_+W38;j#6f-<ssRWwYqzgn|xRl%&u)78~!YR{{o#p{aATwi4kF3au^GjIC7pg
zY~Du-)<#+u4ccst8~BV3jN}I1%P$;zH^jYN;NG6td8kVY@rzCf2|Rmq&J`<##gY!%
zB`KtXYzR)&Eo`f}pX}*zB=<k-wp_xpJ^(VeKxBvbHR8hmE-GS2oiI?vmzm>;&k_%4
zf5sj$3Be@+XMZ-4aLQuykQNr@Z~9Tt-J$bQvZo_o_!Bo^yAez-d`Bx5?!p7{G<=HB
zaKL39rOAzBtXe(>4Q*8Er?|AuQ6076l<ZA3{8=8($m{{`G$95m8Arwp%3nZoeitPr
zC3ngxDHNrkh=}vh%7hWFp_YdI@eqT7RBHn-2n~Xb1g=PU1x#Q*3xz2VhX=DEN3|wE
zMaNyI_X%JcIb)V?$c#E7!4MWpkwXThlona|qzj1>TSHS`&EvIwcpV-|tFX>%#tL7R
z<v3P|=bj$x%d$8CCq^5QWbV(Vli8F*)w-aG*K#rhctA0a{z!&M^Tbe;FW@fTDOonA
zDa~!=l&Go%YR3p_>&j+_{<()i06e)X<gbXQwV~LOx<rf)qn_i$IHstsAunD@6pFEP
zU67FEf{_I^`MpE9ZW0QGH!e+v=;sLoA2~RE(=_Huij$J`l|tiQdm%BY?rbpNP*s#z
z(W2`FeTjk)?@bITNLr9bDa|v-5(3}5o=SN*TC*~?5St3zzt21nr{$fN^imTzHpKVi
zp-Mui1j=wPJ%1JgaXOcdH^h^zIDUIW*9qddjiaxkcb-Z_k&Ma4c<2P@ykA7al1h@P
zA=w<=k4^|EpqI2$RBkY#1-)W#4t&YJ9Omjo{mBR9qlws+IB-y1B6W%f&-G(KaQ8(q
z8P0&Mj6uu7Ga9VGXYn(+oylc$<WJol?z`{1JfXli#&W!?Ob@H6Lv%vPAlXt5DtWXr
z3%v4(MQOxIx?%juYx@#A1qPs<`2Og?*OR8TImSR-nJbD_U@c0iQ$>*+H0z;XdhN&}
z&{R?ImJ?F}i^3oFr6xseT|5zSV_aORiX3)McuT9d>&M7?w3h9T{n`129RAQ9OfCJ6
z0e-cs2N_8_?DSyhZ6+fi9V}x@lB19%d8k+#RVdj_q<_iRT9J8I|FLs?(x@LEw)P^y
zO_o~S71FkYSJuYgKHE)eL=GfX$L5Nr*OQM49%f2s-rV8KkwfM?%tL6|_$EiD^CqQF
zD>WNwnu4h*F$_qa$U>Ou(Oi&!S(5k)d=A!?>$k6(bI4x}FICk*XkNBhW6#pinJX<+
z&#_%OtGl~#<&{=}(#UB;0F@lqht!@K$y#|fCVsARPE-~V85Os5?ZmysDE_c*19=8n
zZfMa-))L~f<6ImgJXSO&5O~xTY$iq?kyT|+lH?%AWx5kt<F+jk_ZYHNQBp=-M3xk9
zHj)p+i^7tK;~fY2OI){#?@!TE{cP`Fa*`DzvqgBVDV@0bn&`}(3M2v4e#U<KE>}ho
zOG=|sSd|SZ`G(fn5Ox<#UV+@7wtFa!{f=2ak9K{MB5~u_o4%S_XKI{;*7YWbtFS1q
zOApbI8y8mr@}WP*(0K~bCc2Tb3yWc}`M5xpp<dYGtP2v&bT&0llu<d8mM*=&DSI=*
zkl3+KT%=;UZvb%?7d6tiseA4<L^*mJyT`_m&5|Q(`oe7K>+qyGOyXaJL(F3j^cyLB
zN(m8&SxcEOT9aDFq+^)a3M9`IJ_LndsQqD1pVOEDA6DJK510!nb21jK6^yeLda}+>
zOu^9*xnYW&@eLK+;DRY88#*<XtAx=}$FUIc#ullP8l??PN{x)UG_#1U^gpAL&#Ec-
zRGdU1lQLGJ8<vUJ{MZjhq+;U>d9XlMslbi+mgYiaEwTlEiK0TJ{Hz)yKAt8NAUPT`
zV67HJet|V3$}kq~AIf|I)6sY3Yju<}m?n3T)B`2JNY4+HDEAZyD0o^Hb<A26N(+jf
zP^K`=q?3nJa||8!naseuHepaBQF{$GLZT+}`!vM_)Em;wLNbVO%CWdQrpySvSrE|S
zrPR#mE^cp3(~V+KNIA*WSYccYjjf?^7PE;ThMtsUQ5Hf=;yI8I-F~hn$QUPWd+4uK
zg1$#7n4-JD;uf1T3JK*w<GdfDK1X1u3CT&wMwHP^qA{`yg}n<96pB~^$X@EOJ%6Ol
zo}4NOw%ehS>g5c}6m9W?Q8eVBM;hBTP(eluFA|E|$19rTnoz@n{Ymd)vE9<NQkkO*
z(bebRpmEY^H~&Y2OO7eg&MxKK$qzu%37>JxDP_^^y{B_)aLw;`MTL<`nWqqcP%N^3
zDU72?hZU$L%b=l3XzkdeS?>jj^lc<$@Y$UdF5;4dbr?n^Z|ijuJBmo0AI?99ORuJ<
z%Id0f*f?SsV}~2;s*}$n4#X=!?~^C8iD&eP+$%7AH!pu0B~ateoB8ev`4Zu>5bK18
zVxPW3i+Q7?!V<@TJT9Zs*E=P&(X`80&?i47bwu=PR}xbkVMc+aFeZ%+s@gNz?$<nG
z{F4v)F6WcW57{2k9})p~IqJL(0$?Ot8=a*FuZn(=f%n~kGaF8KWHS|Vx}a1*xUI>M
zJ<JKj^5T^fj8R0?=BCfmcx@e-vgGzAplqi~Xu|^!N7-DoJCzhU#B17=Wo}fEJyE5f
zu&}95ML?iH=|u@mmStF-m5?~&lLM6!HM~J;pJWmrk%1ih9a|z37b&7<uMG#%jIK}l
z66*Ll3>Z63SdR_Uv3vskq-oDur6qglt}JF+WT}k|kpYU9WQ|BUP8=$lcZT9|4W7l&
z(SXzMQ)2UToM^Pkqv1>1T*SE(bWviH)2@7Eo^gN0N--bx4!UQ7=*ZE+bl`Y&*6^{y
zCjzpWY*jL@DAxJx#-2#_{VI{~mlV%f>mh~Z>GUbm$Wv(asTBI6^Bhxz*X>z?-qY~u
zpU4yhg6+_h%uK(u=^Y7i4xKGQV3JJ8*+P+tn3{7OpM6O^L&F;*dNki5Bb7WNUj}Dv
z`Z6dX|Ia<$@wsNPcbe+nAgLpy36STx(@4io#U3}0i%982>J(PKnU64iJpBhk8T^f7
zP3}#Lu@<cl19AH@LpSKbpi__d<U5VDX!irzJC%Wv8aS7S$sNmJWy#@9Zc-S4B#JZ!
zfNR&bHi7hEykE4_#GN7JXAw*IY%zuyM~KN0x7#8P(J912Mu83k5QmDCoS4sa%9;64
zyHD8WA}`BXCT%KiwKy5rti}1(9fHU~dVEBduz>JC7-8R6`52^yPkJhpUKu`S0K}ym
zP@ET0BcX%HjKn<4Pdk8FrrsPR7bm0`GAaBX9=1=}%#id>*JdvsoaI_AF=^nQoXa8r
zG3L(=br7EP!v+YD%g~iS^5&f+AhqgB6x}i$)}T=iZdpZY@zKbJe>iWG#6Q2E6ooUp
zera1Sj2gDdA`+S2xMLIvt>Z&`05UES4Rn5A#_PHISlB@v;e2QmXmR=yMR~rU{(E$)
z{&!L0UpqVi1_|u}QWnJPhV<H7ojiMni>LDRS^o07YQ<QVmtt*KR4eL;g02e6UmDxE
z(Wz>t^fVgt9w-68fKAgY$cr&AMN&sF$9YLYw>r^lSv7RRBey*JWz|Wk#MKzO5TKcu
z+z2KMnp+K{QLQ3_TAdgVC_RIkRGPkL&!Qi?2P>*(sBO)Cm_YKOvZzVAl;E03ArlJV
z!XZRdIE#~E8g*sU;#Z}(hoq%{DPq}651f&Hv@yn07EQ8Nk7m6KF#x72l}=?M)|_2>
z9GafKg<|fz;gCHLb@sW~mV>?OO<^9>>&^y0CwS;D(J`;33@{Z#m7?l5xqC^^Su8X(
zya3J3SdWVL<8yZ!0%RSE+V)^~MB_9%*3soAmrme0eXo}$zg=qVq-?Hqm6~eS(X^nR
zz%FZ?e{%>OBBNTVZTwOctMFZ?X~e<6Zf&hbcs4ZMA)&j%YAqtw4?v{>r9<LFGEQ&l
z$QIQ>BJvOr|0r(&FU{tFZ5`?u<I3fwN;~s~>r9N}I?KsN0`w{hAe5jN%w@pCGLN3Q
zUQA-6V%aiV{75@OM!aveVia0V0VgC@Fakg-xbo=&5{%rU+XmRBiS8tUu@BG}4bP7l
zI|I)OB=c-5jdJS)AT(;29aLjD_?aOt)okHX5(u8<<bgnnj+rv)G8{{KBYNN#ihN}s
z6fRgzxR?dUdMMFq^!yEXU5FVL75=|5$gg0W*+*!Np+9nkyTxoTH{<Gq<{xi7Gfw{_
z)1hHgjOP15o-eZV4cqOyw%3kSC!+&r+8`tdUgVoN)r<(W-H>L$5LlK&nQV3%S9Q}Z
z0FfxHf#!A0givzG@f^*64vED|lMDXPny`eeG1oo5JsSZ`J3=|go5)u;-oZxHfA$@o
zLE?29PO)2bo^=bV{nh|eN?=T>^08B~rPkgU_CS(>T~Nbs;+79?5xr&cfujR3J~osC
zMgK0ka|F+ztvymX$WPH@S{->Ohnls+iX5Jp-r#*c+&vzRa!#x;WxF+-$=ZtOPEdOf
zawf(Wr1lqhNjpZ~nGkc4glkd%rJez7T5~DMcbrKEu_xRSLT}^^ogfN6&;wx+*A!0x
zp}>664!j~=Spzh3pmwIW^MM2H-RLet@`WL1fQST#UbjcuwQ?)*iB5>?heQ9WEZ%{#
zhc4%$?*(oT(<{;mwbE;2uHOU=kUU-VM7K>TH@_%JP6#w7?eq?Mg92Faf&f$08buSE
zI3l-kJ|E|BtTCQ`0EfY?8CRc6?l0*i8?l2>QQmi<D2YAM){5?TZFmr|K6>QAqv(K(
z9yQ_7)&^{mQ{#<`tRj-`==hyZhN#L6s+b35^zbZd$9%^vCAAXJRIE0?gX-_ypbH2X
ziQIQNJG3XUCV)7N1%X7)t0J)=ti=L^4(}ro)O(p&G>L^0trIV9yQXV!{LnM~#>gL(
z4jzE=IkEx1;Qe|y4>8$cbznIjAdq9a9(NVW8oGkk($tek?jFxZ(c={5Z$<@l3F{ap
zijC*MKz3v@4KkuiP+5r$4Qrl^IN05-#3hX^b6zz?J}_)}=RP_vjiw#CN6ZujB4n^1
zM+|j%sQUD~r*_&4nhQ|G@`Gpbeg~%dWi*Rb;$z{)!&u||v>kg&O-%#n6=(=pI#Lk(
zgS<?XLzOhoFz#aeXoFD^P?&jr$E3Dt{G3%`&z=f2tj6KjaAlcTQ(9K7FEKaj^EvTE
zpUHSdya+R`ABG2AD#<RHR>Z@D=3(-A?4TJxJSSf2Of^$xik)EP1b9yisc3)&WKE|x
zo~A%)g^0|nu9s#?BkA+DP@9f_hG}{=z%gf@m!~59+?JA5FSnp3{3Iy~KL%BiDIlZI
zB`Ax)%Al@f-<k9_OQpB7Mf5hypto6^Vl1DOTTothLtm8!X9f|@9;xu*sZcxC;1Lcx
zT!J`-D&9F6b5TkD?t6K0_bY2JSD)}_@7XgnSRi#S<kIoYGy^Uh_*el2w7m%{Fjfb4
zQwspd^f}Vo{O5!gqs$0(X)dPIB83|OB+Cn6MU%_UJk5v=9LiN*hk#9zUhSl+k~cYd
zP2(@lhKc%sk9Ks@L)klttR&|%e-@g_h6Z@m7MiS{_CRfTT9m;~p`B&HO0w{$w<6T*
zAmzg!r|iK0-@3!0|G^K2eVX^3ot=br0o}vVuuyl(LcP^d_ne(O)S>n*J1(APAV-}D
z>Lr)dN~rx*B^@WlK7%3c0>pfv92E8^_;q3*$>?a?aKhGNx))j=GPw8*txNFanW>W~
zpJRDcF+tZZEQg+c)1Y?|<PjL^vrvGh)%xJ_(CjPhFHzdX(yl(HP>z6D9A3#R8+oW-
zf_CkcNMt#KGQco#6`*wu$9tQT`0RuDQx$@ut+sr~ES>H0pvt&^pE<CN$O6*IjO=bQ
zZkwnC>6Fjs6Y19o^-nqJ8ldtibkcXPqZ4VK8hq`_q+nfF$1D^v^8_ear79r6QAgE|
zBn?`=k{xhU96nL1F|%-C^@2W(mMvYJgDXNG^|UC0f}(?PMZwC{cfp4QK&YaJEifbI
zp=cagli`aHxFL2<iCgTz6Vp#Y^9q%8A<9xrGexI46etB4$P?QvAYGU=i|tVQ0qGq%
za<07*h%OUSt$}fda!v607B&X-hSs53513839KSFZFE4(68DO+7?kU9*(5={gC2~f|
z75liA3r9|uI{hInXY~^h9P@qSqpM<O9HVl?d?nf_Q(;KCHkIR&whD0)v?x!bUTQSM
zbgmu=O^R`#ZySBLj}44Es$|97F|iENORQC9J=i9Evs=`qxs26X6rInVy<${J_JJw<
z>3QK<H5!$y^UbaeK?FQ{E=$Z8VopU?pA|zu;8P|A?t&KdVB-NDw;fJ|h{Q2hCi3|O
zFk~6~Z1K@&lJKm!=<sL$`AgJXjGv~3QCEy(3%YA%=wG=Q`-F+1$$}bZSV^bGSPYM9
zBPHcaavc=K-z1sGFZRZrkgxO(fBqZAh{|^HXCV&uY%;kw*xbg$gU#()V59#6TB`A^
z(oUusR+-V)Sa3ppV>HPZviK`;Mfhl@3B&_Uz;<3Mt9MZ#9liVBd{>bVWuFL>d+m^k
zoOTb)Fs>3{TKhqBK)`FTFH);cKsfZSRl*b<cT2-&L%Y-GgzB(=MVk`~q*CaNb{&;0
ziqC#v?>eXBAKpKd6TcDypu3pU3?kA>)K#^8G{ahqeGj3)uvQcxL=ROw88!zEsmvu+
zn=q6JG_2XrRoY%|iSm@-L=0=lHsI?He3d6RBb4#vv;%};t;m&(ErZIKyTPzp8ru12
z2}GH#Ycll6%}qKLx<Gk&y#Xl>@C##7$1wAOb0g&dn<Bj^7Y-n_M-h-lFvJSy$I)7V
zI{A$98BP69?$~HV$=YMeR|N%Nw0>|?6h@jREfX2fXm?l87j@>_c)J)?%9;?3j`SfJ
zz8MlK^l2fTyb=+D<^n=bDPkJBpRzbWX_94(NPM7{DCJkD)WNJ@#T<MA2}31*;B&Go
z&W1ab0mN87M{6yIb*!LX={~8Jh<T`HMj>=L<-W`;5k)Eo=XAwDShfHpA&ayaC2HcT
z)NL!LGemOIZ89{KomHdRp-xMy{m&$uv=tygq5yV4iNCyy%AL?l{LU0)vR93sT}+1>
z4t@H%S&Vi^Vz<1b5iCqmhJ3^wz>2D3q!WLwq{X91TC`mlq>l+TURWgnjMb*9WCyv}
z5?Zvo%f({JAc`{N2%=p-zL8M4iyT;q;$3K0iCTxHJxZSGXy;meDkaeyU06XOPRNa8
zr#p=K@AZ5<tHnhkiGC0ytQpYK3^kB+8qwwBnKJlkF&qCTct$Ih9S@VBjb{_Pg6_|N
zRlWOcqA+wF(0F<0(3~-b7)4&tZxv;-)qMEuZw34bFMh84!r^s_XFvN}5ec8`6qqRD
zh-8p{R+#?9)LCf5kRsmSq$ruhMzV#)NYN7;KLnHO>~GH)X#4Hoj5i<(6Vg6;lWdfk
znNp>tEuuRKLmA!KP-IA<UQea#pedw{DRS9a5^)HtiMrdOERHI@l+_E{A407L*#?^k
z4Xq_QbjA-Yb&r?2XDm4Qg-cvHT)M6T+506m*9yNiUd>@RW_*N^ax_x;Et_17*@L_b
zAoqQA(x8M8n0}OdpPPe}8i3~W7T@N5z}^NhNwyr0m70_dR8+Q9Dp)wMQA9-)no>}-
z&^ap?<|y56*mEXk0w^nNfUG(sG04P`V}D#CYa)plhIu7Fbwh3b^w^;#4}5^6e#SFe
ztw=neE_LpBx~C}jar`m(=#<e(2yvhLc>Vo_dtG9w>Q(L!ZOBb=+(100TS+IWv4f^>
z5^JxykGY&a0bsJgMP9P39@0r*l5`UI_|Z6+<43vJQC)^d+Q*OI^>W44$^63y*~|Fp
zPCD>tXa+4Hqgs$zEtpqrnptf+ubPut&6!uNn^~=!S}paghf-(D<p4NMo`q)l1*XkG
z>KSO}G+uvKsa@xacE*mvqKS>9g^7Ktlpe{a$<&UmQWAF*WJSCYz5mc^f!Yd(P)+gl
z23ET0d*_&chLgWgWVrOIqNAb;^04ZraXqlqbD?U7s&=M+2a(KPQn5RD^lzTp3e2o+
zSmfu`=y}zAUW=aB%;)RT^L6w2M)Z8ce7+ey-!z|ZMbEd)=iAZqZS(o_==pQ=`HSfJ
z3-dWH0RC1tMraMatBbrgidb0a=^}eZ5ep%GU1Z-VV&TTsMH)sC3rz!E<iIE*F{Y1!
z?FsyBY5$H;mo)j2s;CYrWXezZSRG|VSJ*{)jwXSB9ylY+Yg8IK<MSB??4LA_4-LO%
zWt9R|SAdc$awwT$=Pd0_CVl|B39v)fgFjvm1|P306}k>DoX!S=oN?k184)zp)-5V9
zoK?OhnD(+XGe(Mq;PgTzE*9a1KO6Qrp_hI9K`kY%A-D@hW&lgbDI_fr_WoBeZ4q+0
z3%t)ZGD#?zz!86+`H?EFWCK>;*%vg)MvT@$EDv3Cys5#HDsyIE3ER=>N|EpIQ3=$U
z0pZzbBu<cPGf9SQiebYAmy!o=p_q-k&JbN>DUmV_D#R+iA)Rr{2TWotMvTb;7+n%0
zaf(oa64DOaP>`@tDuVA%GmI336I0MYB9tZwB$+f%Q8c|_F}e8o6jz3V>>47pypsCT
z?V;+kYuW;+?MMPo2^LZMQy0+kDKr%)=^aW3v0g|xpgl6$dGLcfs4d~hR?#ip;hBs(
zdvF@9zwd&=!AdU$|5RoAcwCu4U^$+QTzch@YG+n{incVMJ#OP^S{r?T>_Qv1&4BEg
z3dKqvi*Rl^(cAkpW9u7iHO*a!@96k@mM0Nokvy_MG-R!Q@~lew`qOKCkXkMC<Av9>
z?dGwW8qC?f8dxu+NJjWc9}Ir%G-K$B9K*EvAy4I9^1Mn23~~Ug)vdy_g+s_{U_G8h
z$o#~oR|-$^aZzRreS$!yIvuIc1l_0B)889seQDD?&%ul(ra9P~#0@CsCshYYbV0j0
zDhoaGfEYhbNYCk20$n9ow#rmjnJ!zUtE+UEt>Wk^&f+RsX6bRj?4t7NzIfF6d{TPS
z%Os#Af#ec_bLIy)AMRPW_YsfNI<mQUIdbRngY1>Fs;wvvWo1qE%u^o%j~Nrt?l*c@
zU?P^5D>umSVZ;w{-ReRdd^4Y5Vf3@HaY7*X?KzOohb(at9{((u*h%)hCY~Cj#BJ<O
zJHp4ObBSXvM_4eF+|%4Gh;#uUk5u|6r_%Jk7H%rcghh(;dGr>IQ}bR2^IuQrzpiAw
z#?QRj#m^k}pKhu%KPcDUr)^kK^BNED+Ip(_%j*8F#IvB|6xvFaj**%YjLR;%Mh+U$
zag4H@OU);?u#%)H6{WFz)zQk5bppswi}^h3WWX*~<!K-bff><HW`jy;NM9JyQ2>|E
zKxt-tI^!hqNRK9hBw3H2|4c)}lPWp0$%1P1DVs=|`WeBczojt`yx<9Scwb#2Xesc@
zr&cHV#sFM>kYlz($$MhRwrA5mN9VljF+|Jm;;2$*g)6{=cMOeLVkG0t$3kr4%*UE&
zL%+06*3`3?X<B=VGyl6N^_p@SR%au$Ny_sezsC*ZA&T<%ceNLPbUYOK8%xX1Q#9*7
zjb$+C`OsE4@%btqU411=7XNhWKb1$M(%5rAo;~3dZ7wR5aO6y|a+p^aEf+=Z!q36q
zN)`UrC>EC-S9AhZcQ61n(imoxk<}b}?gD*fb8LXiRp3W8x6s&Rokq#?BO_#iV^Nin
zOB#G4gOWOM;){jHc-;}*<bcOouG>#ZmZ}Gx9zhT2j^$4C^+^=FOvb#y{#F!T(G0RP
zGg&6w02A&S@k3wkLmv75mRNA?J-AEOemwt8VQ<>O5Z)&l$K1#q^N2p~T>qbdX>CeH
z0@%~WPfk@~XBdoJ0P>WL)zRhos=X6~1msCGUqm|hQq8{s5Hh<JuFXp}+_9-wI~PSa
z-eE<ol5R1=s#*S;*kod^tfnwG2tJ@(4VUc2Y0lK&&`BAaDS`N#UK3$WIXc33Dd~*3
zGxW{EZ=p38#w8l5I16<G$|Tz2o>`jMCkC;9aa<yVcSa|!IfYT>VY2|S9|FA0EKsR=
zmCf4^<lPxvx|yVG80`_q#0)v#;gHS~bW#vHVRw3g9}3PGD9<56ndY*5VPBC>E)isr
zzfmr#n2O>;=A<&NMH~)cPT%5*%#|zK#^TWDl^O#DuMGS^wImN@LV_9NDZKF~vgQ}1
zIsQgmIh=!W>d&N~6O~0~I)(*H4hVFCuq@A)Z@^|p&H&R0Uy1uy%xxd(2>yYIH_t`Q
z5`~vAM^<$$1Jc9EG>Awtr72Y!%h~P8=6LT{ZDI9DB)|t)e&sJPOgU|Nm5sg8KJC1#
zH;)SNmM-~m#rNT~@A>76SJ9&!I&{FkHz{A_jHg3y<V{0-rZY&M9i6os`}ykvUqMrV
zZ-y80DKul<t^AuI;o#c4wgXu3xT8=MH-<eDA?d(!?&ouRu>?4H491y-jO>`XqO}b~
z+t)Q2H`Y;Um)>jFMeOinC0E>#u4^kRc0I!9wXtX|c(GLixmYub%mJ8vl4F_E7XVy~
z1B~#lC*Zxd7%>!7xAP{UYRe7Iy3uU`6q|7<pm_vjO9JvT6_Uvf7Ire=hzb>ibB+gS
z=(nj8)5GGooZ=TiShXQ^5W3ntG%;}3H~+ZSpBw%8q(65CKD@xg-zA}6Uyq-mL_=8!
zB2h$=Bo>lzc7nuyu2`+D&mFmuhA?zp;L2Bi@X0v6?V`N_jSjb4kkIYj7i2zHD&?|<
zis^K&iz>qPyO5*b#COf&cTK2<Z@h2dpTon}(VNb@=2208tN*wF5!muQv9MLip8ryb
zK?d+7%%vB#+WPu-t+KxLd~;)ad-Hkac`=u6KFKA^ZsTybDhkD_qzV-N`MdBJ^x(QS
zSM`IT|GQc7yEDS~S@Q_@q95VgeK1W-RUZhl6Gga)=r-q}d!zPZ<Hgo??ZsxX`g~(!
zYkOm(vc0}td9k@!-KuUP@avm*BvANmqR0rVhOWi+Ty8_f3N-MLofS|MC%q4(v}teA
zR`Sr$-WFIPkIhLem$!{B!_}|pGH*JnzV!&MuX~>31G~%~$MwxJ10nMS2YkT;Gd012
zA#B(T4#7bVmn5JY4S9byvBqQu=H3*mmaQ}aFBdD9%TzEExSPbTc~i`J>AR+ZYBMM2
z@&K2XhPbp4<n<WH&SDAfE<l%ROGC{?7l2)}!FDp_xO+lfTb4Fzi)o``LyYiNAD%R-
zmCDl83`PGK!~u}p0&rRQ3!-~DUP#(i+F<3|1%f)j1uYbz91KN753h?bfL9L(W=wOr
znfo>sOej-?|5CtwNOU@15YF!(3QW>bKRO@BA1kQq2D##PD$G&Xf~g5y7tP&lfpA9k
zf#5NfC}yXO(Yry~=zRYXKtf+wgz95Jj^xQL(Y6DdNy6~zMI5<p^p&2C_CpHFoKiZO
zDn?fpF+3?{DJBp(2lXlBP|3yKCvb$t3gmvfh7oo$hj-4r4abmr_#r0>yH2Xv_`$qO
zGZ{dJ**6_AaIa)OaMLb#A@hC@ya1zPuY6loSS2f&yx18pU<eb(VsV3hwUTPgSLinH
zXw@T2n(ZSDn%T{+i#S_phoNZP<15au@e<U;6{jg~Y{n#n@hfiutQ6!k>=|dV)crTH
z`$MyiV-o~mcaMai``7dQYFA_oA3u`nHQrRUv~%3}6I=k-@{-$R`M7->fk@c5t>*Yd
z=4t)uv%f9VJp-&Ry-l6u&-2%hjXw0ccE{5gm%)$ZG`ULs_1=Et;LY3Se}1`dpeMub
zUeyaUV+6_BH!feyS!{N97u#EoMVV(?)Eh8iKbWcm3^Vb`U)*uu8<17F?+!%VAWT+U
zRLLxRtrhn}*4%>8*1tV|eveP!_Pr1ze!D|=t?y34wF{4)tvTV%xYwBk-la2j%NO_P
zqXM6;tquIQy1iL3|D{(O8{7X@-Kf^KHaE9x>rk#%*{s(7O;jFilyg2ajCK~{-)7y}
zcsiR?Zo&IM>1U065BB`Y4JT2=2)A0L@}g9$RI5eNc7~UDhULPy@xU8;lZh|Bcg9m7
zl7FCw<M{}$1?l^ge(_aWTh)qe>)3PAhJECNEO9aOLh=2iH`YJW+M+;R%nE|dVK`Fg
z2A5Gd(h1V(H1N7JItaug96W^c&^c!o^jvx(lki~d4+d_bfe&^kc~?BP!co6Hc~=ug
zWlYc!a%v>4??-pgMKN8-i#^V*kCjI5G|DR!hmCw%Bv3uSFTG2FA*%Bxr;8acdm43P
zf9mzzqRKWzsqiW1I<#YUtWr~GsG!&0&;h9}C})8JT^dMHpva4<(xB1#kQk^tL1To)
z;ivESC@RfSGq(nlLZNJEeRKoQ8HN$|bp*9J5Iw#l*Q1IQVvTWL02PfH0FIv06nIlQ
zs^T_$GIiddlP?}<Yh3%7mdwY?t)M!<Fv0_FM$Z(_u7M-EGVv&3BJ>B-D<lDfsPH2X
z=Xz)iN0JMWrp8QNVJJsHo<DD!ZP9KWoPMaEGz5G<K54yg?l<<u>!09dL+rJVe>!Qt
zd3!3}whs3jCv8zb+J~n{rzg$VXQwTAkgK<$W{y@2ysIDmBpN>+pETNS(K->$cgKfK
zXb(C#sUMv-8||WK9_<~T?Kh9!6a};)j#{VUu=%ce3dK%aMeLW-RV8YQ)`57}IN5s(
zKkKiXht1QUsLO-q=@E8!0R7d)asA}9xp#J0KM}`gC&#TewT9!{Z?^Xi>&<tK{W8D+
z{ffr>#?h&0zpWo0#)jMaaMU=#0a#;wO>G@E>#q+R+#QT|zj@NwJH=r|-}V5B0OTR?
zvE#;G6TdWmY`}=>CqEUTSz=eMqjux3XHX8_i~ah$`WqNyegSr1hW5@*8t)MB)&aKD
zK6~9hZJwT;HpH7&YoE~GZk)Vt?lsyk#bK*Wh&yXHiqOev9lOU?0Bi6XzP~<eHxYk?
z^rO?p$;sLAX|r`yfI0sF7y=yB@pznY-8!N%1F~8tKViFw44R6f`0%y?&tcAw<nT^U
z>WGduAaL*0ED5~=K2MFoilfGx!{(dD(Ov`Jwy>cO&32=}lh<rxnI?Dsp$<Kt;qYnF
z05<+=&~lNcRx}SpegAzEf#<^58jwW0Dai+(w$Jw7O6+s?B$O@3C|q_rZ(%}#YC84y
zPe*&5<CEt5`e~!{R{ITPmxziq4m<Vz{mx0FzMt<+K{s0V^KpgwmH2JxDj99C3=Cp-
zcyS6W5jX`w^76KAP-Y#hS$gGOmYsh81hnmfNIWtMp&11_;x^>HfFfThSoqn8|04X*
zh_gEFyTf>=^3j4$<9*_sd^mw+b-PJ<kXd<{d6_#iAMiqx*woOoyUdM&r$v*K=vO_v
z<@D?wHtI)b$4hi76Zn{Y%12pU;s@TCMU}I55~wIy1BJwsw^D4*NNcI1(z1uz{557w
zL$F!-RHI@(aSGedNvGLvH%{}@OMp5834f!>EKe^=ucnus(Cty8D*XV&g<e6L7VU-s
zXViAy>4BVNw@e6gdW?#&cj5MDL-&+~Bj_(3u!4nhf-kj&sA0r$QLJ)p6W5=koNI*k
zUU@Kd&O@QPhMnRF_RYq=X{3pb3Mv+btPL{y2n4szl<}|J3F8j+b6XgX-QG0b0{S1)
z1a~^oobH1p$;Hzq8V3JzMG^(PJPv#e#ou#=L(CEoW>%5L2eN)<?jpDw{oZQY7yD%E
z|0v+SX&koRlt=yh^)X-n-`v~+o!`>`tJ~|9%}4$JYkdCl7x8noTq#$6$zM#TlW=Ek
z?HtsYSr^y$8dHLzh$)^nTvF+RD2aTnQmd3I&r6kc;Dz<^*q@DisP(<&@`8(EwiK^-
zf$>nG%40$nVo*+w*Fi3A9}2m&QHv}_j<dk+|He-_O-a|Cq5<K92kP0CZtEMdGj;mT
z&dN%sjyIQ5Qrl0V&S;DY8?P?##@68^(j_Uo3EtV|mIa4iXr)!&eoKC;q1}eo9r+4$
zzVmB<DS~lZ!W7e#qy>GW>490H+z~tB#0fs(^?98O*9oQo^Uv=9H;y|LZ-N<!yFuzS
zjJQncoXZr7;^&|6R$B4KpH7FK+fA)?gGJ8$LJ>NFZpG1T+;xNV^d83i5}Ss?y;&&U
zxbAT51pV~#T~MXR@W&0Y{r`kj1PcD^z`e>C!r!PwmkMAf@0}su=sotKpTHld*11$=
z&anuM!vi?Qe&C$@>}r}?uOGd~u3DqO6YZ%B6Os-a7Lf0;leRNHANl@R{N$w%1-8A?
zr@$FZx&8kHGWDE)T%;G4FQH9ryVVCYy`2rG=YcyG?;RKnQ1n|r2&bvlVZh#%k7s){
zGqVc^Hr>AXAI^m{{JWD{Wg6TJ*liR$Jo0*<#0gMnkY4%%QA>^g)e}Dfl<Cv$U%Fio
z(Xho&?xi=bR;tfaOX|145`I3w%T)Go?C#J{Z`tNBJx=evc3CM`H_Fv=xh&bu%F62M
zYfw&pKn0X{ruOP8te;i!D^+bxh<p4h#{Lzi$kw+RW2)qV=MMWJEcDix@9R_i1_Qdt
z^IJbBnFfnC2YBh|(|~euV<N-hjSS=Y)#tuI6y)}QrK?pb@<HFPN`uC0I^hQzC8J6)
zspr?S$hTcr{47%?FNdX(H(gtQ-raQE&5iZJX79xdx4Y5nIo+;X+lEhN(A(<vo>yzN
zt-)U~CZY6vtLv=4=&x@(&hy%f-t*q`+Exv!xEq7Y#*0DsaD59!+Ewv-HvB|L;ndDu
z{K-d4m^3*I`O=9}6|G}t9&z!j_PqR+ETT9Qlfa+)J%1?ZDht5tsk}9oQj&*w=mtWc
zw(sGVpzUVzV(r#gtk+6-Pv&IkOr;$c3sZV{(dD~*05(i=&)EM}T?+AQIiipgcQU+b
zb#X^IP`9F%`5xRlMhP+LOr1}_wtwY#ieHH+&}b;LMPtO)$fZj*fgq3ED=~ojGa!(i
z)zy`fXveoV7~Ibv|FZRBdx>eCz-n28qJ<*YdS2OFwiXoCwW=?cu2p@ZYi(4QuC-A`
zKi~YVwjgn*eXbBgX-rg*$lX{PO;A(~c<aT|Xo8}u)^??~Y%M4n)k^1;skNT#TGgee
z1d8g3tSvv0HCb!q2g|S>tQ7wH-*>(6yY>1cct-z%?s@L^pTW#9QQS(>xCI3vDV)s4
zCAy71MM6|dW*IqFE}4pi_>P3x<eQ88ad{MzrJ(GHTLo<2Z$1z+RfYDN1xbLLOOp~5
z)nvQ1zI3gvbv-5N^4!(cRXLL5%I<8<nN2VJU~RNUBdo_Ic07K8!A;d7q>;%zQ*E|#
zRX$%|o(-)>Y^b(;t=bD7-W?=KIXJ%W4-aT$j5H1duO1F&6r_(k3H2zA2EXz#AZ+JB
zNZB57W0&FtzAwu`Y%b5YH#hG?gs=zgaXLUR3}-GTPo}8w@ufdR%A})47Dd7W?ocpp
z^c)$Wi4pG)r`!b;^bWGi>0ukM1P`3RgEzdKmYELj8y3_H#H&IW(#Hp=A_X&*FcLe&
z!2TH35W}l2vm#_~P#8JLtw{!OZ4<+?^m5=`>rAp3hdKax0}nNSRsOlZGBnHV^a^9O
zZDJ%x2QBeL>>Zx9Pa7v%1{DJbrm4^I4lH?+NWl|x3sga2>_%}Qb#1yg^rkl;(M)?6
zFx|*op5Fp?C@k^6zRc#PKv{n-Yi-<S02?#_9{urI`>hy(9O|5tXJQmffvXX-l+)q7
zH2v|MEVCZ<oNN+zKwIGj%st*5d5mX!dne7;4NbN<H(~nJRBzK;m3l)#5@nnEag%3v
z<2JLqAyHagW^2$LuVcq=VLvD#m*@+M$Hg=9G3Q?oP+SIXI03O27w3yxzyyWWk~!Tw
z?i{uD8;A9uaJ5JxTx+#|B$C^{1%rXYJkqTf%k1*1){6?)+P+O++p4ea=eL+nC=5Fp
z?JX{|HV&T$uIgS2r|(Qqbztdk`xeUv3QK5SEWNcrQDQD*Z|XTi?;q@Gfeslk=b=n$
zfOkD&{BXb^-D3SiVQl{6&#%wkeEj9(&m`$=ZG8MiG*Ht+9?zE{`n^w>_f)cZ?&mfr
z-KJsSj>kCztoxEKJQ*oZ?QY#>g12b5l266t(>bhz@xVJ5v^ko5#XBGS0p<1weV8si
zf%)uv0V%3a$K3U8P`5>>+xN#$IWt1(4PDDM^I(6Z`@k?1{cn^-W-QwN5H@6D(A%50
z>1C68A-$U!6<vCB)^2?40I%7tQi~h6p~8*l#2V2~YS=iCalJ!9gLJX2Tdd5DEn^DS
z<njpDXtm%~Cv=P3&~=E5Z)F&q(wnY6*Rsf=*PUG+`xxCAIN=53f*i?YGUZUF3<8mb
z)(CXAxs*;RJA=a5nbSoAPdl-KWd=M|HGP|LZ1Ol1l`0e=0nRSv+)`$IcQ~QOm(ny<
z;}xFI<K|lZbyLZSAOt(Zn~*7PvvQ01gu>X~JGzui(7cg!fqb9+v8cscZ2X%nxfu6B
z^L|8om7_4av6RXyn}ot7H@_pjRUoURJHcRrLM0(%XGqns(}R#fx!viST&?~{r&z5w
z++OGhF*GL5FRgbHcq)ws=1&0*%Q77-82F8T*W_0iPH%=T!?wIuyji&qY;vZMFvl*6
zPE&_dYhW_Gq1SWAA!k{i!9tV<PZkH47veWw+y}w|$Rt;WB<u}!+&5<DzhY>Xw%0&W
zgeDl_7V9}18A6hN%_c2><Z5x8w%{q{D1xmRW|qwg@=iK}W|=i8q1n0*Zq8tGK6XAd
zkJf7{jSlLDGT{zCCxDhG^^JRx`VlPfLvK907JE&cIo4C2XJI+5|Bd^Rb2wQSzTahn
zRi=>J+e`0Buq1}=;G6)n0g3vfDN>W4zL@qVrfHNlv*ihAoe0M`2wQkihOjBsH&TcZ
zTIzavj<bF*j)OGoUQd9xcu}sqo)ePrNw%41&tfVssf5d;rbei7W`R2k(<fcNE3j0@
zj?HN{N@XqsrZ;uRc$6|AqXI?SlzR-=^0ZyM7i}ZrW@8U_KItBf$clhwBNz%`m;!@A
zTiWypMenuj4Rv_xlO~E;m#Krc+XHOxX-fZ?|5zyB!SD^>Nz?K|vol%>hyJ<OBaH**
zaOg^PpSXgyMcn@I<(|`rxhngC)7MuZnC!YY3#a~wy&j@_lo(aj<%z6HL>8SXFFJBo
zdOx|i!xF@KB+X_`nHl9lsDxx`BRCYj^`v>@PdH~N-A)4s6j2t{mOqYxqW9lFfH!u5
z`;4Oer_nZYyCc4PfWlfEo34#D6)kw=O_I1<t#|D9Lf0IX?{Khke-Tnzq2ls>nXMp8
zAE!dmdtq%l#qf2+7_w>>7+LX%spc=1-cX?EeLzy@q3XB=_m9ZF<VbbomWHBxz=Ml@
z^66X}Pe{3zD_!Q}brdTCC<U5L2)w2D5-56K@C=&=+CbKNWC?)@L@OlH{T?2Q&@RlA
z`Fv?E4n^<F#igN1>hwKgk=jto;4ICqq3FHHo$Qv3jS28eyroP|EE&B)0`Dth#K%q;
zCLvvZTA$x*S_#G-(RQacJhu5vUJcGn<N4AY42s@ns{sUnV#L&A9%)Hgczb(!*06mq
z)^N=6a+LU%cUfnsZs(0oL`cpfoq>{Tu=#R%2Zb%#5!r2Qo<|uSFZi(Gd~)3h3FAtC
z+umB9p11Br&r0M_`DMw5y8LWx(rolDs?Mi$Pe6X9)wFQpGS>s)hy94i#JYTktiHD|
zd>`0&^E9=de#`7Fx_=LkYrHW_$#2{#xjQjGo;V?%5z}RJ1kv)2CHK=^k@@yf9;Jh5
zG)aZSL;qa)<)a6#GnLx}pAUcRfTS%hVOvFqbSBRA<#+pa+U>_6(1bmIn(k7m-)a!2
zHxnPB>w7&=!(^w+<7l05^aDCRmVQhp6!lVZS<W~s7b%W@zuCrU#*dUkq0Oh^%MZIo
z!=7~gY2b&cwd6bAbS8Z?USg=%y9S%SP)e6#DG$H4JhQCbidh~I7eM1MNiLv)PK}Ls
zsk2k*@^mk$1qXZ@b$csMt6Pi~yE$?F;M^Ij6S&*^gWV3h;$8dw9;;kDl}nlMWoKKr
z9NZ4>IiOzxr{QEF`0!&#8lq4)*N&gJ_nx~AC?5K25V}#(W4rjYkGpX9MqMaVzJuT2
zEnqmt;j>*p`%GbsI30bI@8AY{i@sTDLSGT|<f1#Oy6yneHmFNvsr#kL9EujmD@l2u
zr&cta)0N7tcU*N+B{M<cp{jH;S(^5tC<3vpzqz42&XD}jEEC*_@r?4Cy0G0ylu*(m
z0%d7AWQ*nMzYlNxS%!<ed{@xtjwdv7y%W=U*oe=@$n#<O$=K#iSo+|n^El<8uVfJ=
zgsPqQDw5K-wwGq^P!zj1BOX$#S|Je#0<!cS0tD87I1M<btg^|DW+1AAzSCou#^wEY
zw}|PVU-%i}67)t1<v89Q>4M3^r|F1!8aS7ryAz|77S3BbSK^#R?vv@$VuZ;cRHuBc
z4IbIS-cRtHM?cZtiN5+FGmh8oedRtufVb-ur$B%%?>o9hjI@7?kQud+?2)y@l@1-P
zNYne6fA57e&@I~2S>N-4$&)|p@(X*D7Pb)@lTK7d=!}Bt=*RsQW|-m}b#xCI^}YPW
zZQe`oL>|W!WmxfU>B@Tty1|XDZFG1$mv`)Nyo^h>!g6zb=?uMobhSAwY&S4`8>IdH
zY|JX|*77HETYMsiZ0X`3=}Hy7;-hZqtGdI!eb9__0;-=-x9iK}eZ9sTTJJ@A9eSfx
zDqMQfAxCQQTeaoMyGG>QcQ428wVSct<V%fm7L&+5b^;=mbIyv<M2S}<rjv=Ne8IxR
z@+U=Gd{VTmFk$Hj<x!t|TYkIZ)0I6~HQ`0Z(o!$=@TvZ5N@9uoW-LDt0kHh0#Tv<l
z)63W;=#5^^d&kEIhxIpYlo?^nAinPLZ*n?X9?9~g<ia00;m}PFsL*dsL>n<kbl(hG
z-!T5@V}};|=JHbGCQFTGtYtc9HG?sg!~icwbn_TH)JYqL_TDh$D2x{&$d)&$ZL&#?
z^2^^iqYP^bzf`s?Jhx&OC)O?WiLUgjLLXcVy&_PSa;Icawx8dIBd&a06{{4rrUMzp
z6<)+Oo5Ea9y&hfAL6HQG4E_C?Tk7;wg^qmfr%wleE$QMVU3|`~!s^P34&E*Wy=B&?
z5x|W#j3Dmq5{6T(bnr5#9SVr1+mtAZPkV-;&mW4DU3Yrrx?>TwL{!2*L1e*871S@9
zFpUQU`7eTlJ5|@~CG<sJS(V`?&Oo0^;nLSPIOX@=H%e4vyIR>Sioa}cY~x?rP-Ec}
z1*4w|_EUXc!jyKKh3qg=o?SCmunaoouM`9#qXCO}0h>1keR53K<5I5N3tp^v<f`uG
z!9*KpA^IU8wq)Q#k3(BI^xSAvz*dW)8_@KXI~-yRNfQ&55s}eFTZDF5*_TPuxKdGj
zI*cf5To?5{rT8G?oiRQOSUaSvtyBdf;mKr(cL%XvM4^&o`sY#9V7<$%EBg3rJQ#Yg
z@@O+6y;kH;K~g<Lg{rq+eg3@r3!s>eHA?-Pu>&F$p86Qa(j{r3N4mh{m;A{M0NL(c
zjJ!UuJ7;TibA4Mk5<wEF(&B2(VgG8f-^Ax${Jah0scaO*R%NhNt5I7z=%qxRn&)_|
z8N|SN{=7Qqb&I0nzHkQ5sR^lC0_@NYUJXX(RAPuw-3ovgKW}b0z25Vp*nIA8b-6z7
za^1|(S}_IaCCSGdt5#lAUu^3}+RZoZ#+&!3)U_t=7)2G}IRuE}kOZ34c6;(94z*su
z8{l)`r@*__f3ZPbwDIH@Wc%Y*yZK|xb4KDSR=Ep`XBP&$@uJ&xoTBJgd)4k%9PfK+
zE$!pMZs3Xce&BaK_fq`4UR!_O8x%#g=Dg@v<BgDK0g|Y8CKzjZE&o59-i2sic#}^)
z5K_$@)VlHdee$_>!VrWD@om0&)IP1_t*jW3JQ4ZkIUw&1UV%NvHnwY<&WkOH6}qeu
z*LvSA$vZxK4#$4ztLTVG(byia$`+33QWbdulXvi^=K#hwwl=EkMX}z4;WFCU8$5KO
z*4Rbi4`@wt24ogyDx5uzLHSkW4^ScwyiZ~uX2K1Sa<?m6)!GY9EM#?nWp5~*9J-QL
z*R551FM3g3>4(jY<o_}F2M|hivsPn*-os%D7}uM<Jzyt%*J-{9T0Q`LgaRy#wC47<
zw|Rs=xbB4AFpv+x#y%#ayBb>Cosyz?061*m%Y5NiWQyUK?-HU^jg;PV3KR$x|BC(n
zT-)sRpEE$}I6k(zfy(e83>4^#8<@bKH>%yrc3-Y(PHRrL{{>pzk%2uV|6?c8Q5BgT
zQ2xLPMkPw$A%3oGxo*FoGCaKFwikF4opF;?Rd@m087Nlrb=O@3Iaqxc`L{Q-@j0ly
z;s<X8jc>2_k%@HO?X4c{c>Rs77cY2f`K*|393;(*Oj<P7V`m0>IUa8SNA7lCY%=|7
zGc9?%E3?7?Gamp;)8U-b-68)0^v$2QHu_bU$)Wwpn;<!!!&K1CyU0Z)|NT#ATxuX8
zA$P{;xSwD2-R?He$$OX)^aGxesLM`f((;1U5xcYtoZ|V^4Uo0?dEl%A$p8n~ayB+!
z!0>w&*V*JPfdytwnEAa6obVq3pr6;DZ(&qiA==8reptSs9`#H@!M$hCP^-f8VF129
zMCLR61Rd8;51Y{YW_P{j>J5nXFG`f^O!akpfj($Epcn0aC>LctIKSjcz<|`ZGvEZk
z5tArd->Nv3t)h4i`<=s6^qRBVkPi;R3dBNuT%YVIe`%5`QqW%QK6m@;a=IBo+Aos`
znny8}hfge8r?gX9U*GI8>r60hLMQCXRJjuv+kdxP1&Pciw!S+>vQlA_z(PZJO~WKr
z-uQO%Vtu1l9Z*9g5u)p_A7%X^AIh8aD^G9T{uSQ(4)ogFT<-%;w|eXDMup+0_yb2?
zkC2THy11F}A-(yaZgWKDmZ3wYrr88X?Tm=3IEw{c6fC7E-nv5$5JpK&UMQ-r^P}5K
zhuV2UV1ko%$!8_+#O%Zf7PBvvsi^b;1SS}`lFd{DvJ_D?V<U3KC{iYiy=G}jPE-$^
z(_=*}lhtF%oF3TN9kY5!fea6luVhG@Nvw3$?9*^%<&<+hVc{^Ao)~9DZ{7}U%^}Lv
z>ayCgd&T*LVbGu={8O}`c-H5i<h7di0xFiWKO*ZbRg9DoK24C9fXW_?V+QNRLsldQ
z1CdhEdXZKUGvTCGG+(4t)F&qKiq?yiiXcH82i_%mwb&J{7wJ86UYL{~qZjEF**Kn3
zF?xZ-iiZDR_ZzRz-u$Y)8`QmyT0TXcEO3$JnBJ*;hm29buB;$W$GsFc15ot>A2l_M
zB%$4nx7La4;|@Vw2-t@15+m*@R0xx21hDP`)DTI&EUxrtq*%hHJv%?AWkD*YN^4zS
zd40oRk>2Rao0(^0kM7K1FC$tfy`d9cxFM|0wl|s#Wvyu7@i8F+Zv0sw-0`Is_+u4m
z#S;Eh-^xf#w5)ad_3}FD^qZ*DSGNkx3@%aV&Y@5mh+ktFEq@i5>Qb>+<vLCbi_$0L
z%8I?ROoI+HmTGZIDdmddjpqQD@qrVZyJHV}UTM<p&sjZE4=yUa#T81dPJUPZct45_
zjQp|`Ba(@vFg~%%`WvRaCpLx}hf9gkfqq70G>~c0Rdbm2oT{?T47Gb~T;Ac0{=X(7
zYYLIi$v9$24je1#k99;niXk4~1;nFZF+^eJKSE&my^B&fRl33Lry*+XKVf6J0kNs)
zcS9)%!2I-DZSf--Bk63}=)3Rz;~z6!@UK&K{2Ud*y9WYa?76`Vc6?Q`d3p0G3ad1x
z8G{3XenE@5!PJK4fi_(bpc2zNwCj<HG;sNnao%$UxlW4-n$^*f$-sG4;e3-5C#t;@
zr4;g#(}@XJPUSB2s}|9J#d`)We7d%Z6ZZG1gdMJ-QZDj>l#;|Ga7*g^gd;v+D)Hgo
zix)JR<(2xFmwt~Dj3GzC_W6CJQ_+p?v1JNk`b=I2FbhIy<?{GEqwj`ZKnxFA6#6U!
z?z9YEUTIOEV}Gn6A;Z;}{nex3S2Ty=siR~EZ9m{E42ZHZV0#Rd>tSd($p>UBFk(?P
z;j%!j<?MXg9T%(}68ExD8{JGFal8n<Jq17L74Efo?ci(w66CR-KXD2M5mXcrY%m8q
zH4;*Crc4Lp5xo(NH$8F3(7D02j3h#GHC_Ub@gU9+4~at$Bji!atYHRDg-_%sO1zBZ
z#g#nY+%S^{M-(QR4q(NPr$$m3X{01hF$XN(iwG)-kLf==&^U*dcHo9RXX26<D&H5(
z+urdHZ-8SQa2$SqAI)-~`~c+dPoA<&Fqh_wV9DB&FBlmD@;~5(5TH+CKsP7`??A{G
zZNLo-XD}$RXg}n*UdPaW<;qeNB?m8a`^Z}_v?=^T5ymVay*`#GC|`GALjxH4fids3
zXz^D|HQu>!JinSYtzUP<exrT5-#k%g%th0Ym7<kBGNGbRP4rITjaD^jt;&dQ^@6w~
z!^(P1U{XCk<pfx_HiVgE&j7k&09{k2`pCl=EgzsqgDfuLC4mQ)9W7LBy3ss3J(0?S
zs?H`1$yU|F=JDm0*@~3$nT>iXPL`Ay(uB#F0Ud<67zcgTj3dipRs}RzsOw<*{lMj&
zUCz0xpe7HW9rW=U_OX13A^;8$pQ`CPcc;pd3PlYbLj_PSmXSUl8S;T_W@B1ddDd8s
z8q}uDBqq<-C%EI9<^-5ZQdMz9*UFpM3TQJkSG(0YX`Hni_5J-51tv9j$rg$|mA8fs
z8Mrp-pn_X^bLe#i&a*KcC+@(ZELfl*a7rEaB%<IUr(f==ZrGB?+Oxcd5D|}@ALggq
zRi}6~^KaxinF<*Z{TX43s1OT~Cm#&719DfV-8wtjYiI@8#1+T8!EQ62MqWig7NpwJ
zi7FDlCgN(jLbb>EO6qqb=h_?1My5_|CcS|%Y?l+2aO}#QK<7SW^R1DDRo(hT707S|
zN@l)RFpoY$VDG&tK15MmPTtS~Q3FUf6!}+pr(|uT5D5$Le|0EB+z{;-7tU;0mc|K(
z<z+sVMQ<;Ul9p1r05@6O3J^1}xq+sw6pv8mEHcIJ=pB^5^c=$&DrLtUvX316@`sET
zOsF9Kvaz|tF+e_P1Hcc=O_zcV7{kKAFzuKX;W8J-lyO~`XpFQ`Iz;7c59GKhE6Jda
zfll6OLb1LhP3SDR;$|=RdzHmWGIHKF_#}yMqzkn*Y(>bf*s7}2g0P&5S!KH}B~qa+
z4flf!Je?fNy~rRcXo+u+mscd|xNPdx!PNcMJQH<d8dxcM4gK@-S4lcgOd>V^yZrZF
zH^1>`e*X9M%66?9&;MTAdc6Pbt9-uJ{cjt0x&JNM)@EFs6W^l^mukBtnW^gf?zH$P
zVetO`Z_b!b!l04C7~t{FA1|SMyoB!Y61vAr=pHYjd%T1$b_reDwR7-HCFIJHa&(c4
zo_rrp`yfo0FJ9p-LnshmIvrwM(1C9MU3;$s_%*BDglibZVN{f+D13Sef;QI2+m=@B
z=PzY(JQV{@0lY6@4hQA&&T;H-=;K8v_$OpPw3q50W(#f)v+z;(Gx+-BkDX~zxYHg(
zu0~Af>^TJ^Fe6ZAtO7FpRu@Tg?;~VO#45DDtN$m=e>M5Mc?8cZiRZ`lQ<%Tx^LFc~
z{;na&A#r784aEvA)YB#G(oe1nV9|kt&*n(|+u^fFJVl9i5Wf5+^v=h$bAt}m<pip<
z`_R=|bnk@r6_CcEG9kyhHSG0aYwrh9xvs{clRHCX-`C!HQei^JkEi{z3@pKIP|&IB
zsybY<0O28MT}5d`d~nOnr$DFe_W)syAUxGa85pv{zK7F*>@CJo1o=IoGKF@BA*RZq
zQ}Eez!rPP7qS@2}Dl!_e&>04^@r|eYz(I~TY8b{%+b-Em=|o`!9pOexrtqH1pNzBG
z!xJxWtfhiT6~h*!Yi1X%Vz3{MN%!=}oEJp{aN*!FGb(<xwv!0L&4h7;oT+lXK}b44
z$n^FrmFNg-Y@uh!wP2@aBm#_(h_KEk<PC-Q(!js^U?B<3!AYaRa6FIT;Jo0*{5$#>
zN1Z>xTld=S&C-dWdDPj1t?_l83AHk(>1dp4IH)-rrU=_RDy1`>Z<$DLUSA`B>`kdz
zG){r^*CWrlM2qiQM@`sf<owKQ@k)E_;v>_p7Wb$`(_+4m>?^7OQ$SsjfMs+CjJD?}
z4`Mu%i;}Tlkxj=Sg{e<##f>?f<H83`W8!PmMFNhaR;LcK3K0b1v9b~?@k66=Tt95S
zZ**w0e-E-pbrZQXvl8aY@G~-H;1+{t0H`+bg4YL+lBY;NH$ngiEcN&G<{>UW5>HHQ
zq6ZD}FqC_<*$&hInE|9Bp@=TIvxUa)7z%X`fLkLU!$I3}i?l+R5Wg?2H~JxVWaRkb
zELzg}NG%xhg2DYGG=Zmfn&B~2BTs>RP!RciK5`vcEx;qZM-q3Q-Ca#I$A>?4Fu8d_
zZ_;$m#5J+GgK;5Gk5-HPYPIk(tt<^sRmd8*)d-3qEamhjz^L)R6)58dW0Bj-iQklL
zz`UPN_M)T{(k{owG&bHzWD+ChC8FRo;bCtMzADl~vWGGxyqG9i#oAaR5?Q1_85KRH
zvp@DPWA1}!1^CQ1kh<T1G%8!_`!hU^>?>Ib+mO#Po7iuip`b5YV3`SBsHlNM_Tlyi
z%J46XVML2qg=bXiER=rlX1gF_w@!-IBb1Sk-dLA@^2aO$vf^vLyDA0BJnndX)`&q)
z#BCYIS}0p^UE(l*-uNXOHtqu%5jwH45<43XQy?RiHQGYgsR!W2uDlyVPHqu6Kl<Z^
zA~(IB=E^a2DswPF6!9GOxR?MC)xn>1BMHh{U6oa-LDh`7bm?3pv$4-c8?ZJEw;r*Y
z@SLI*Szv~tu9c#A2|F<huaQt6W-H6HnVkT-rWJ`*jmxU!nx}SR9g%Hb9_cvxZUU#*
zLn9WaRY4GxyB>Anji+fRLwTmv)hV7wOp7u<JU`?fidt`RCIE+S=hn@X%jL}ac;FRp
z153i!p559iJi1hmBmvPgSd_`;Z4ceNR8ki7Am(=w-8YM8el`Mnqkf`91cU6K3$3_7
z>edM)%<L($Am)tGZrC~9J1)kbogFoQOg;pq|6qUR^UD=$duxZomvI@Ob$kkv!jV!z
zD%F(trbJVzX^DmpT#|B$Apu5t>>cwcMTYK?X;ItU&}WR&xJK4I^b}Q%l8G+L^-77-
zEQJF$8lPR^^Mw>~hzE)ikraq3ET^Z9g3`$LTp6NI-5a-$NW~yUX5l_)8}FDsu_WFc
z3yPQq&3;PWTkPY|cUc(5RIwp>B%IGcvLV%yyfLQIWL&BuzR*fa7ZOT8ZchelN6nP6
zC*_{O2ha}4UVA?@PO*XfdaZ<*+S;I7^=9L!Bics$uJZZvr7$00P=`yt4uvASHeo|J
z0~n}Il5+lkRw$09c?4o)6VGn3zp}8b9F#*^%L36F-G7--H@KC9eH=AgIh2qBjcje`
zMl|@5e4yGyuFqhIT{YS>kOex&rzer|B)uWs27Szi<Yk0*Lu@+98iEx64)zO(r2;l*
zqseF_E-5h+z+)OghGq&nMDAc6EXr#pr6;yC41Gh(AXQV<{}sBSJjuT*mnJq2a09Z`
znk|z_5Xiv6rO~>rDgOHU+N>fIyy{vi6$!bUS`obHr6N7Tn;h+cuIsvjC;gF>)WUo?
zW&?{|r#ZJ*b-Cx9&geE^FO()Bg)|Odp*w#A^f(x?on56Qp2|Du*CH`HdRSfrzjci|
z!#^A2oJN<Z1H+YW>7Fv?kegC(vgX-&zhz&BK=hj>ubCShp9OW$m*r(<A#Y;8!x={3
zgXrmJgyZERSZB!j`u>P+CZO;m3s|#DEZX5RR<jWti5@63^JU~L$du)hnPZ4%o0}3m
z8k;S|d9MMCT&-fz*O%JMMe}k+(N{~kKe7HUbxw3<TQjbZlZ~<nH<3>0FQaGqRoq-U
z>WxzH3Q<3Gy94w3t4I}<-59DO^alTSdfk`N8$&S!IR<}pbRjA9w$$2Hd;D9@A5GB|
zByM`@LLpZzbSY-a3vn<$s;_R`P2Yx_t)q6Q-8e;gCJ&9E6WgRyB(mxh#7BadUT8Hr
zCI!8W6;jhv21+c$irB>l=N2O8n_ccQO(xPXqI@NRoH)~q#o%Fumx_`yATTH#fq-`B
z!f<@je2?cf5)Pyk_=`yZVjU<tf<}qZMApZyX3-$lg{D*MeoSmnrr8A5l2G!SICb}?
z*9LJLC72FziOw@tq}9Q*Om~S&@`MBGC3`WfA<TP<QqWJ-P3g_-=yMViFO@Z)3b7}Y
zy<_tMafWq7Rs7A^Jd)U69Z*-yD<TDy+^x}ihjo!<y8#;^I4p%u1&X4g4Yq;H-rCZS
z&$JV80<WK|wdZUqXtRk!i=i?d_Q1SqO2))VAktVW!bDKKG%O{4cQ&9tJ|MEy0fE^<
zq=)0bRQ6Z}qXqJv9CfBz70p2>l5Um~D;DnEW~pf3<-uWUvX`-EsXMT}!^+)tUdzls
zxUl9d(GGGDKh9F(mu)z~N=_eviolW7j}Oq+mE8P@VeqvU0g%JQXT`zT0qxsT@$MgX
zs8FI+WaozEaqeBZ@zXMK<WE@+?B1yTz5D<hYZG-m%8)D}P`8Je_q|)aa?k_b38jFK
zT}Yh*7Vte|FE{cs8~P-t-4EvP;x>a(b}7w*OhPxVUCkSOL*2x>D)()`MRpr`TLvs@
zs+?O3dzNBvW&_1^L3nyOx8);${2J-^Zg9N@WoTgw#SFt{;*%jmFAV`=>BI%%x<4rQ
zf(eZg76>HZEUJ+;$5{DpbBnE}&dx%34*L0MV<|*Z>xmBPKy{h9idyFE`%D2G&Lx>W
z*f44OLUA-sX{Ig*bgv!ckQDNxbyw+c7OJB!DH$6KfsUz>@1uYV(pJDCWKk=f(l@ZL
zLle-03ojGGfI-wz==2^R5-XaG*-tR?{6f$?&ZE%NmrzR-u!UJllRr?H#H@$efd;c-
zGz?_~Z=9U49q!7*&@;<atkIdbr=nL-d`Ph?r4Zw9mF7EMsc3V!fn~0Z^yXx>Y}(S*
z8)FnYbVN!DytYj?rGO%+c=$)Mr0z9JT(`Isi8jfxVX4)=KX#>wzlj!8bH_G<kfMAu
zUO;Pwau9g~DaaAIU^pCRx#>%jA$c-T>;{sBbh=;)!IODR5#yIdOA$a3?S|yEAy+`c
zZ9|?d7zs*I{=!g~sW-&hc<Ar&@kg15V+tWF(bi9WQP8UdE&^Ud&aFn{14$J<3G5RM
z6(F9(F7L<s3?)$mlg_Ycxv=hv7Ec|OL4s~tm)Dv52DT)s$`lX+kMXv6eR6{iuxfhI
zdjSywwa*cmV&Y9)O503EK4rEt$I4+s2MPdnu#mB4^r1x2IJ%4t=Bp3k(h7B&5BmHg
zs5>+iJA_I^U8S$kTOUKwQl=0U3&AHW#AYmVHra!WJf`yq^0Hu`6JE@5c#G26**JSw
zgw38|c4#@TGHi<S%V@qqDdALJ7;miN&eU!xZ%HjiyM$V|3>7V1ed3w2<d+>Fg;6I*
zNj!!I;0&*v8+C?CgNP1Kc?Y_@J5d>}+<~BywI7n0Qrt8?>vIG7?=9m$7RLYJwL15V
z0h%BGQ>|7i+jjg<tx{dzevJS58lRQ)0HErNqO?vOI^FOw3g$5i<}nK9F$(4}3g$5i
zMtW$s4^tyy`1xJ^NhyKv@P;l)Wi6j_8?+DQ-C^YmmDxt7mXRSQed#5QSIx<U7VO00
zj(ey*h8K9+N0*td7|y`ZVkeZ&zI7Ff0y_xhp2OU_bnOC+Xz%n#vQN_;s;(2>5KOqi
zNj`)3TDraI@P^b{=^rjz;4afnc;Kay31hz_OIA}Iw=#Q{ITL9QWTBG05Tlxykixl<
zvay^#)i<4pm`-JKZ0P^h5WAvMOf@Y6c8+{`a3oFCcJ;lJM*XzWIjA=e8~cei@C3r4
zj58?abGo@Wa?_h_oSb%kX#CVU0j7ZTRg5*eCo{CDbi1G28{R^@uzlfP5}ik*d-x|0
z=C_~GSDm{%Y}NOZ1F?oM^qoF10L&#dWod<WCwOw~K)3151LHnA&FUiAd@mZA>LRsW
zJQzmQBbJPIGr`6a32Y286?wWw)I*bOno+e<XJyBXo%U#%Ai_5n=d4mhgQl7j>r^Gn
z%clXuEfo?D2?N8|)^JHcC=_vV+M*k^wX4T6e-7EbO61Dp*=tOOd619cScxQMf#ys+
z%Hrq{wa{Z0InrG*f{1;y=_e@Is&ADMOL7YXa%xaVEX3@u$OL2)hQIL==y1lmYkkg!
ztiu?XG}>?_AdUEumc(AqL1OHn(+mlAo_))x680Qi2L{=$f!2gqN|UpVq(X8XlnMfe
zLk_*ZWq<GCMaCELJ{W75T7=$mXa}%U%C}~BEAJa~*iSLU1O|PX6GY;pq|#OmjYLkm
ze`}}+t6Vr8SUARuz_l?DG79AC4LvrAnQ$3x(IR9x+4qiJ1ZF_OWENq+xYG+LHFotD
zhhd7y-7MDTvyP;|C)F(Iq|KAIp~%@6WTfQ^Jc-h6P)5k*+egiUI6Z6&+`q@BsN7U1
z{zTN{5{3purra*3z?sa3<Tj`BUz>4FDn}3JBd5N2(;~N4vg#Bh?}%@ftLZzRW$Lua
zHD(7T@`}#btasVf(r6&P5n}?1sVr8k#@QOBjlw)=I?1QXg%exAjFXsWd4z;?T%i%C
zgDyC6!9p&0<y$R}lB@%G^Gpm?EN|qYcQTzNNZ#b}M1bspSpan`o8+`IE)2P+WHtu>
z1EJ7SH%iEnGV4@{ljsc2iDMBPO2HMM?PUl?lA0{8Dj~-+O$&pG)2iE|bPd<c*gg00
z0JlI$zlppr-ig#`LjaOK@^hd|f@BG>KyTr2N%J5H1u=0Q`~AJmP>-MA>62~$1#Rfk
zz43$c&1iVPKIYqhE7kRlg#EX&x$$WK{TiRYh`O9-y57e-p9SjX44JTXuc>lG4kGvJ
zD83}mx9)Hf`ofBlQ*MX$#*s4(yz3pkPnN{qPj5P}>+QEYVsGaor}E$0_}KNvAG=O?
zVR*jm?d^#3UT=QYWh%lG$~e6vN~86f`S`~l(_b9!o6lEzm{hexc>#As6_}~0%d0ZT
zL>bQLwk&zQOcWSRIjQLolmlu=(gVb;*Tmk*;Q^;_#v6@LVxrv664e;i2V&6*O682Y
zlHh!YI7OmVIv@I7ay0>=6+@SL!4TtV@Q5COYs!?MC^zDvV8SA@B9n%ywx52dF#DY-
z4SOO7xaF*ZrG8Idw~%|fvO+C&*kxYVb$b`SzG9<XE<ep|v@gD`A0NMO{M0(>ygq9l
zg1$;d)R&ZbKvcfRdlA=AkbEgdpFm2Gpg(ycdVS+NB{D6SMd^+Bn4^#?l_D|xn8OlO
z0K->X?Z$2uApgCW*&p_k&Hwihr-vXBhUMw?^gewoIRC3vx2tjfU#nFg`Ty7W?7gf1
z(7=p3&39+-w52T%Yp3089f|ewM!8a0VXJf_|K{jS@|Jxs2n#F6C$0Z%?49N%%@kHv
zIBX%`IKmSFlrKf@HLY9YI9XeDWfIh!XdN6BR8^2msqSf`ecBc|Ot4Sso{gL+I)ybl
zHpi+*J#!01k!y3!D^7kKw{XbnEAQ%iC$0RsJALm4sOP>0ev2Ah0oYl)ajH-PIC|6g
zQRMzNW&Hm3H!Ss8<jc<r-{!FNLG!SY=O}&{z_-6Kj`z+^PS6O*No_m(&6Cejj?EnL
zOx4Bf=BeOrzWvSW_A>!PE$6ua#;(`*8i|4;_wi#jr-92w@1gO}0A}N8KV`&#2kUp<
z%EeU3dWi{{vR+bFrmUBonyIj2AQ)k_di`8B9$-)A18N<|^RCfu*WWbqxqZ5H2&m(d
zyW5FygXQ8hD~xW<VhE9>rN)o-cgKfx+;$-L>U(b+;&rP9l+E6T(e+ZQNp)eEYDd#P
z9Xp3K*PIlKWfY2Mk>C3s=z{!JQ3wATyXv{jzl>io_m=$T_dc;rtK3WP7Vr>z0_3#P
zJjhd2Zh=~<@9%f^TJMg5f;;<-17Hgjg_Q5?odD%F@SqI?oIli0j)=OcYUi*~KkC$v
z_B-$33y~JIiWet9YlqF(C-sw`G`ibw>o9Zauux1`{p1aWJhhG+CwR!IY7%_WW9)jr
z^`Q;3bKC;p>W7D&_D}C#w?OYcJvnQb3(6!ZrZ}8pHF7*&1G;+ifl(j<IBXvMAb~f4
z5Ypl<uEJUek*3Egt4U7T;gipnUH9zuVRKJ>`@Ot(khAU_!1CQGzk<gs5=9T^aE@2d
zBW8PVzQGwGhNGxu(kpvo5&aVX(K<T(31^yn%`>EJVd9mMs2-I#F#^9jIXgOSzH3lY
z`sPs`=|L#S)IeU-QSWCeFDHC%c_^dH*H8A|Hs8;0UzRrpfkW0qC|~fJxR7_g@p`(D
zYm7C6dCkj7Gg&gzg6>XD=TG_~kOyd##}J=oz$Kv1-XA8th22RMt;xjd-Z>!4y~gb|
zKWB0ggya^L0)nblCgGd6D_ltJW88gYp`9Jcd1P}ypc+29&j9a!jgWyQ)p{|D$y43J
ziu{r%QS{j9eR9s-JsKPzdq5jXX>~gje&69IWT91SqQuV_c3d6H4A`u*ARI#jpE5sj
zBz#`b7Hnv5JMZf!ZIOZ+V*$*WR6Vh&bEk`>OrL(Y)JPJ`@y=*nwman6k$}g`sd*ss
z=o11P!x2h-C#}{g<4R8tlmNZ+uu-sZkK`AxBywxBFj&L<l*2WDGF`){aS&N^QB}q9
z<KJPk+y`-F?+27ZlzmqT)Lg{cl+ku8H)h>7`Z)BWojA64lI+a;r!^2`FO3>SbY%>_
z9qq3_$=$#b&(%9YdmtG?M6UE<SS&@Ctl&?1!*gfo`=4f$oQ)DS;Oq?@`_eE)ul1v4
zHhBEZ-Q>+Jea_x2$IW{?G^FUlsPZ|tgnVGN6E&mDeU4~0P4>85`_`^vl481KK%Tso
zbReH-34uUMmlCYWvUv}_O7NfCN)7nAt>i$<<W|yyIY3K-U@zyn{AlsMo@{*yhA8J?
zsjk!Zc&wAU&!<j{xW$%lHehc1@{_*%%T>RW1b`hd>XzEY37$Lb<cWGq1Xn)fj*g#2
zyShm_OH8A=yC<jVL3j8&6ZO4zdcBLlU)<a+qmW{F`U#ptqFuA`Bj~B8_)^P%WcR^8
zYIn8d2(wkyh^hRR_SL?E1+m6%bxD5BJu3w;LHCWrb|Zh6rjk4#fkyE1l<V58qniiC
z{vEok&a+4nlEMpP2L3`<L@ASoA%Q8g2=<S?x6fW{H7T#ktA-MFes9C)<A*-k_WuFr
z{Q2Vd|5PgL8!7kyR37dBU*nT>?LHv0aH@B=eigm@5k*{eQQKA}O1|GYZnc{~cJ|b}
z8b*564#`VJWwXk6I;5I(It4tni=IM1Z{Z<2W=k9E>E3aauG-8h)!DC~e8BAFvZH&(
z!~Ls$=J<cG5$yr`SaANgzExe1t^cj<&Byb<uk!g?_kUIIa{t$3(BWgy;bYL@W6<Ga
z(BWgyA&8&#_D@H9se-9~qwkzDJS&!tM$Eh;gzh77`G$nVty;iV5;cq<Lp;x?2Jj08
zVF2H~;7o<+P_F_Q)$R1<p1O2}?=VQ-HX_sQ(WMNWG%n>15S4pr-W4G71`zd+ahZsf
zhEf5*frF{9R>ulUAtrIB>*vn__@OucgbB6fWoKAF1|6n<iV{M~yyG3bAIQk%XXN+$
zY&XEMn}=#El27?M7`ZE`Z0ahL5c2d{cMZD8OuQ+Zp=N(eLM>Kt{)%{gfHzElgtc_$
zPnGL4<Ib3riQCud>{Ww>yp{JVZ5k1GAjVE-Vfu|Qdk@zlH;5^^f~Yy3C5)vDim@px
zq+~%IN7q9wn+(-jTq-5Hc<T@QGUW_Uvd%Dr`OkHjTi}u-z*Bk6P&A<`6e-Hk*mkG0
ziHvLF<ZB_NL%K0T=5+juZcb%bWn(tQ0CC#XsO6L_mUgztL;_2Eu!q-w%_a)PCRSy;
zjZ2I*ld+CbKF$l@|D-!e<P9}@)DH=vSc`;RN8WUW;+MMBOZDPjPv|xiyvH20r^v!c
ziGb+3_%#%F&>t8h*sQEkkslw(b|bzvTqDvLzSHlYP`=*8&|?Mr?r^z+(BcQq;=4qX
zOP1_qPEf31h<AR^hAu6gc=2LtRy(ZyS-6+cWbYXhVo1HlLc&P;=pvr}jG``eRwrbB
z7=^`CMTx~_S|@phAT4=yADX^M23UDs<q<4K`2q{}a!Rr;vFeYbr|H8Wg@N+eQHEt0
zF48mRqJlN%qNtr%wDB(X;_aVkcEFjVqKzSK7a~3{w+ACvtIWtaQ#T{26o`e?ytzvz
z&TShv-zC9HtkWc%^0tqNybLiztODx+ActYb>j~zH3)IyNpYa|(Gdb-|bPm^Fl%Lkh
zB_B^xYhSPyyRitF3v7ee6eMAA!W1FOdUS`(whLNYm`ip+eaz{)FwJddO4cPB{}PE}
z7p96`09RJh*eI2ry#6A#Q1dB`J1V*|v8e5&psL9vhnd@I8bhLnSCS-b^^?qAn$d&R
zL^{k?Hq&G?X?#Bl?xph4Fwz@I)`&8jrj*6y_?A{Q?bT}r+YRl|VyetVqui#8d*>QP
zp3`Nk%tckQ(rsXx4-HGGyjMhmN?caubmW{alXqP+VJ2lRG;?OkoT%r(wdFRg?OBTP
z$Maz_WJc1#tmR_qPjQj^R+%%uWS8+An?_$zR>V8@cfU*Fc$K6kPkn&#r{r1v0+|~h
z=97K?6ZS(HPjKHepati@TiY8O@$=uUjmPufukuMh|EX1q;++T7><-17fFpdrAIS%J
zKyxl1KAze<p4vQ~+B}}xJf7M-p4!NR3qmVkQYF~(hTc>id05GW<XHhFnix5g5QDb_
z+s2jA#<*K<HunBLi!S&JZ$@2TX5Av5(wsgeV+~$zL58I(l}zEStU{@-bQXl0h~ZFD
zEN47bdB`cR8drKsKyhcVl{u1SIn4k4F~EwQpj}3pu#245L0L;N+XCJKg0~ZfLuAau
z8{mkSZgB4Q<yj8eLplA!1)eV9m;=;S`~KBfz{KM*k%>)81U5TY$=Qs<G93W1-=;Xu
z`l&uGOL?W=;UMWwV(SseuJE+O-^>@zC2slrioTmKLw6cg<R9j1Jn_=6`G?gsTIyBP
z_&wIN`Ck3BfUe_{<7ptvsGo@<ZOo5nl)>L-ArLL(Yxov>F&G)|;79CrG(P?jdkq`Q
zcshtm@b6e5+}fie_$yX`r>vuY#9m*<d$~;MX6QP)6Z~$y98J`#(ZqT&xlu1BH?bGS
z$mxgqx<6A5!Z-5;=21~i(s%P^hb~{{m-O9yX}n8&1$ve@#Y~S;5%tI}>W}cwU%K~K
z6^$O5Mb88O>K|_4%VO%MS)@7c1&109@|RiQZ@#DA;@9}AXkO(nYef!gp(btqVZO#N
z$rIln;f-%x#&}|3b!4t1`O7Q-{1|mv1&aD<78$!&@-2Ley@=?5f0(ZWXMC<^jlNre
z$+J2Infz%MIdMlI=Th3ciPKXp#hzMR1Lxcc&edS_??fSkZ^@r#k*SY&Y$(jiUv_~R
zWe`>c=$BO>@J8w_d^KOqtf`$P=a#P^jv&;(b!s=X>m_*nqU3Jb`ak6xcn}?PzW%?l
zxn9|f`+siK9`*mP^1&12Ym_#oN;`6B;!y~>@&oc%m|#+FR_Bx~#m9-TE%^bR@=Cex
z%lnaT+{KSH+16%JymO{g(VjXWf_Q_0_#SP6RNDof6zb|)n~#6~(;1f<f%l1|zH>B?
z{0&ft51^637*9^mAI&0<W|2p;$fH^0(Jb;WZWf6gQ*~HfE_(QVcoVLX<)eJ@%6L5J
zji*EVQAoFM+s|M#9{cfPeUNYy&%9W%p$B_Im?$>%y7<h18f5|#;v6N~u^vSEr>y5!
znC_C?a6#1Am)RqX1Vuf4=G^JfleTpofSL6ekM9smG1rPI<<X7~e2?7e-p~(|cY8|5
z8W5H9J<20ldNt^aZ+4|eQ}gJ3{jj;;IoL0lS8P*LRMc?l;;PA-(z9me^U8|4I$pt)
zc0H)Nb-p_r=o3Tu-g71j1l7tI&+4JW!0lZ!G(|zRxOh=iBy>1BS$J2Js^(DeRi20i
z-!(q8&JOoqAGY>>KxBMFt&+>*6FDq;S15>o{!<v$U_GA{%x3X}7rDS5?3|+vfJxs2
z)1wbR^0vN8gu~Bt-vK~nG>$nV_HiKsMA-l(`gUo10#y-Hio@2$scB;n#ObSNxUzMy
zW9YXia)@DdL2u5Oa$^vsYGM?>E#FlWST3cvU)=VJ(StRy6%z?_duy}~Fa;uK_$OlS
z$9x9OLB@bc3{Ji$IOfoL>Ls@cl2$^*t_WT9q++Uue|(~BZF<bhM}-)btNP#D==j~p
z{40>cia7~#{4Z$+Q2OkNG)9V-+ct1q%W~970BrhNvrG1E_6ae95cHBT5sulUD6bqs
z-@|j43n;8mdoXi9S8LCIf!e=`iui1KNDgWKE7A=Sr;d9^woI7O7~qn+QzQ{=!>6x>
zV(z<eN92kU_Ls_^k|6H{c{ze2a1|P30c(k8<e$N;S2iR{(q|)m@(5d4&cwQTdo}s%
zq4Q|w_5+1|97;7J<<Ont{^?JqY8A9whn+UiWdntsR_CMvB1wIJ|D-6Mpk^ll_Qyb?
z2|k}W|GlC`dNIngH_u*@E9lBElf<apgHzEW?_!{<qO*yxU<O+p?29nMPd>z{=lV>q
zh?@>bfsOh*<O+m^dE5A%agsf9B?B06QhW|TQpbEIjng<+O43Nr031E4W6UGH`wV_C
zcM71_*YY0T^chgM^dbm4^onv+X{sf*X~jyISAdWGv1+5NJj{=L@|8n_2#T`#T7kUk
z4mxidrw50mV;^+d^u6a`?)0v!s?yaU!E7?+kO>D!{(S5VqmT<E3uffIvURz1Wb5}?
z898oHwUoQpD$(F-6zeK-Bia@JvxS$i(N4tGa3_fs`{%AOOX+4~gC}$rxz0nNp#1<S
z_=_IStV72vcwIQmo4y+Q-(h3eF*%~=_l!Y->i8P>$|qRwc7uxTwmEKCws`MhDZ@Lj
zl*mIqxghmQ{K0i6^`Uo}kdJsB65U@qLvy=8&tSb@DE3IahY)1Yg0YdL>>@gW24E7}
z)Y}Mlr?5Ittc*}e%5+ifuPindmR$=x95v9Fw@V3<G1BJo@k#5n)j8ceF51aLQpfuJ
zA_@BbLuHz`hxX>M`Fc+d?VIQ^9$UR`?{_}A!Pp(%c9hNi!{2R?Df79u9<5?}L)wZ(
z!b^|r==A;JA7E(fw*!0c==Ap^I&vjep2Z895e6vqCP)6hJ9KX5Nvt<+xJYD8;NqyY
z-#D!Q1h|0O8W-^WUR$%#vC+vrIe8YMqEPd9^&dO$+KoMsI`W6Dqc`{fm4z2CUKGTd
zs8%YKLW<<e$dr){??Shi<odKBt_E&68%_%=j1en9R|SWxN~;9(eW}2A<U<|_Z?4dd
z*d_H*$!aaUh!W3}R1@SPg_pFUz-tLrs)SO&Vlu3JU3xXW?98yES2T9`paN~a<(CoW
z;=-*QGC+y|r)t2dg0KE6$C;0Jy2`Tw+Fd>g?lWt~jPO?+9JL6`6o)cm_<;xURNKJI
zzUAAbT)vVu!lm>jrj8GeM^?kc!YoGftc@y6DieP=1i?Uvt3m(g>MwG5_@nYmnO=xU
zYA{~O@Sk0A+&VmLot+vYg=rFj1^xz)VJxB`sKXd0^8qmogeQN6+@V@zcvF`Cg5@8V
z;Hb@7A!(b-TJ#GDDl)GT%rWB{ek2Ma^W@8AVV|d4-V10O+e{yLVUvuc+xN#VqV5R{
zsSugCTR$LWXALuIg;jOAE!_pE1eF`_?|`m!G$kQ1x3&a2QpN36JhK?Opk<o7U4Uy_
z1>MQ*%}$ySMg11wJw^VK=~71g8fHptD~9Z-(`ZkfgEjmcUU}2rg<OrQExJ^-(QNOv
zj*fQj);c#)KRjvF_kY?kTh)u*d>R>3Gy1D6=nwW&2Uy}xdMRT^PE4gqlXC<WKoDPL
zPMGS1&LzRcc1uPjGz3%Bp|aAd$f61SE*PBee34ZSz-^&L4(jn=ocVi*Hb#f4^+Jku
zKHI`TgO3p#BgDW)TCG?GW$Jx->oF{8KU*xB%Gr%a&{}6_X+qNUQm+nrEpwCjoyipO
z@ML;v*`MJ>_>YJJDE>BE#x>?2jk0_1>DZ{qtrw}S2NG?K=9eOYB|&Z<?SDy-Rr5=O
zybKAPk*A~N<hLURB{8d^q16(dYSeo!Uc{Uv!Bq6Tpf~fTrZAk8vk_OS)ofO$dL!3z
zyb`#lu3wiuL*rMjy4ZVhk8w#ntrQ-Zu_td{QuAuEn5jfA=x&K!UoPa4JL*ktQrapC
z{beyox1j|J*!?|dfja)Gw2<gAl@?;9vS`67mP!lh-QA5AthTafAr+(rT2jZHa>W^X
zlPpT$BR`hWZk0J>E+O5bg=DggjI%Bz_sgP?Ink(E2ci9W>lb<GIz=HPpWE8pT;BvP
z8%rI7ZF}PZ1}K0&SLCbc@d1488s8`QJL*&0;de8=E(`$i^onHPw9@*dGF~H$q(jnP
zB^EnzYlVVRFzHE5Xs+S;Ai2>oo9qyUU$i;tg45olj5s6pGceKueTWv>6fcOK_#uE5
z$|Qc2p}`5!KVsqpz!~%{Uwmmj-6;!&Ml>8sN=+Fe&?SdK)5l)WkuwZ2m@L3}G)&`1
zm+9&&f+=u?a&=u{QS_#`5&qS<s9JDB>0`=rw**i3gbunFeqVK{YEf7n`ap{=u&&wp
z@CN;Z(5rdqI+#3YN<Q7}+}iiu5MhB=pK#Us!HsIqW<iM03qK@_kV(7v0XBnUF^ict
z6|*++Bp}oNY?7DxW>m3wN2y%r+=of<{ZT@Ejq!E$c%cZ<(;O*w2s^LaxQmB@fcUod
z(nLdYw~mP07)zGX5LJ0|!B{%|(!M}sK523WDQyXqp1p40l-X$1WP474XmGK#-6%#8
zc7mZ8U06+-2#HKGDJ8$z6)Bwbetk!znXDwou02mWoZe{*aQR(7S5z6Juna6C5Qy_n
znEO_gg9`mrTO0i-I{>OP@_;pHZ-Llr6sskpGn^eFZibFX<V)T>zT84wfzk$FH)xGw
z<}%EoHt=WTei<23pE4p6Q^5<|1I*rl@t4MdJMay5HSY~QOu}~K&*ZVZGXPe{j1w;*
zfzI$9#k5lIiZ@?Ua4NT_FE^*~Rsf0|rZDgpN$b)LZdA3hXra&hl?QX~h!IAKgzh->
zfW@lD0-#h^M#^^G9dQ=AdfZ(fkRS)`a{K}Xr4oylZv5~JK*1WSMH6J(sUWxnl!Gd+
z_EM8I6?yXI1V2%GRe{!{ZBWac=PkpYmfj&rD$Dnjy6od;N#_ocIG-m4mxWtc^`gJH
z;pHdfu*cxM6ccq&fL~$9Exm${Fdr;}hy#I^gPX|S6L;s~3XG#7|4@`Ke^SoWo<GcR
z^09`2qO~`kx%M7py6Gqw5?(RAV#VgF$!)-3h^m<sRuh{VlCN+X+SW0-iq9}rt~vPv
zZ8R9k&OsTWI~<hyF6VT_qO`;>nU>=ou5-!P0Fj*zVM~!x;*;(I@*+H%zI-neud^NV
z_K1a?yDXjVi0{JOB5K6XVv=Szym-B|nZl1@osMWgO0sF=HC*)K^$ep&IL}p&d<|C%
z;>mcSt{^csP977RAKcyayhf9jgmNAt7#VX=L#w=t?m5vi??%g<-dM{#4M$x}ju;lX
zAQ4^kmCU5yq#XmPk6JJ(6F{#)V*a#vRMw!DK^+4A4fXv6Rsdo|ay?!I*~k0p^YCjR
z`li2PdQJ}Jbe*Z0OV;2nhGZ2c<*6`|qNLGbV$F4eWrmjYm?3ZL$B{`vp0h-)o8Rr8
zqO%yiE7{ptH8}E^CoCGx+O4J^S=xuAZ(Hrtvm+4E_THw^&isQu0$6Wd){I4>@S=lQ
z6E4%6GyYy<`O5L8odLQ>qyD*QIpJq5(lPx{<z&mI$0r^svzvj3saY^kQ&}0%i?4{P
z?`({DhSl@5_K+9-s#EX&no?wKF}{!+AGJ>F@9WJ&biJC(_p$1;XVPTx%Cs^x_D+Gj
zpW>x_bMczRbJM~D)Mqh$=;pOhwU7a3b!bogPAUr09T9rPY%TQG2r<Pl!wcy?&6*6(
z>_(Fw&3;1it1c<|Swf|9%C!ijv2PrFT#DV;@n_WFSf9fw7$>R5-Sj<Y(O%OdkNYKe
zo7?U(DaHX{*i1%q?GLTiJ5ZWiGm5ollM@;ps41>)pp29dK+}#yP+srZ270VrJ+`Ua
zr;NcR8c^57k+cBDEX+6q&X6O-Q_dZ}fQ@;nLkbCHmc1K#m%AXDB(#BDp2B7i1hY#&
zw88v-#`1-R@;f2Iw&rBxgR)xBMFyt1UgBgaBXnYE1AEN9q%#|1Uil@=<`K^}gKc`n
z`a$RHsQDwS6%lJnRrhbH7bhE`SBq@*2u{==l%4_dN$D>mlCdw!DV}cFvkS+J&9RnD
zyPhnq3a5AdXn0N<p6A$|7f}L6eEa&0LAy-RdFRu>IM2Y9VIMlMmXW4+@G^05B_$Wj
zY9XJhkH{@DS)rgdLelG<Bn8Cu5lgMeZdER32Vj|vEel{o{ZMU;dW|Z@9ESg@mW@~F
zY+N;fjk~ACpja)0PIS^5I%$rVSy}~!CuFG*whpi`{`G-m$;I|bMR6xC>J&044d$-v
zM%>pKV92h*T&-Xke(xwFW^=*$5@O<rI|`EGv&!BK#QZU(i}cA=JDg4EToX4dIY7=*
z|A7PE^=NR4TKld1sIVh0rqfBdv$ocEFJXY^VR__X{t16DE%*G<nmm6WdSiFZ8FY{z
zmf)EimZpA52GXyocC{ZYIr<;9+GodjRej2M2oGuDQTGxQ)4Tcnc*pPEKiT=;oW3)`
zBk;9*_kqCy+uNI&_kY7DdH;9q-^AtvjBnxRUp)WY67xUwy0gpsTmrBl|NmyC7R&!%
zt88v=KIZ@X8lU7Xn}^NUXYV_2JDrq!HjQ^F`GTTnNH50kT)DhvT*zrXm)DHvQga-o
z-UWDw^w{8l6_hpTp>=<u^031lV|LlWfRWBLk|p>)D}0HnS?t4+F#0Mhqchmptu!0a
z`(unq(H*VI4$NB=`8&5=h@duFU!~*IeByC|8!Nq1_XBc6EdJ7MZU2tuZ5hC`qxv8z
zgse)W0+328PjD!=4z%z@z+9r=Kc*flSRQHdn}4E4XczvxT-zT`nx}Ky<}@*h#y@8w
zy3Th3#xL8u9YUkqM4?uMI*`*0e9%iZrF6+*{t1*-Gpnl=V`RWqh79oc`KH1z0zM`Y
zh{G@E$RxYF4k{+yM~(Osqm5-IkSG1i&7h*XFExW-4t_a>)&Tw}Q|OO7oCyu8alweu
z-HV~EM5c_%T-3{}P#+faihZfG?X@-FuYHf)wCNN}6&T4(reuTz9n!t_!YLCN<HbTu
z!JHF?I(u~55XtLeI(2#%$s4Fv1>QgfO%Hv4f*8ktjWI{oN{nsEJ81BUct8GhFU#a;
z8Vl!5)2B&?mUZOqtAbL_#n|u5sF=Ka)h;I4+)Jx9zBg?*g%{Y(CCjNbXOxq-uG-y7
z0-@0_PmBpa`3YNu>=T)lIl8`d`okQ2k->#pk<F-;=8e5+N4h=XJQjsXCY)l>a=%$L
zNi?wnu`qeb^vsR%i|DB$VlM0SB#II)_P^&vWRIWU<+GgrM|;YhRlxcBU$wTqQH|+;
z)!OD`{`ar)Nx%P%bFEkJl571j&G}=R^T#yjk7>>y)13cHra4csCK9P+8x)P#QATr=
zH)?BA?6|EZQTG$;W503OKw_v|SE^ZM8aRzyrj}`bB)AL<WQq+Evtno)q;~6|ielBh
zOg`;&G0<-n|5`7jyaw_yg(u5YoY4c+DqYiRX~6h0U8SZH`!4k3-{jMVwyIOIDh=H&
zB$5qV71^v8<SAQdU&T_>D|KbE6X+A=Jn8ZUomf2`22*b{-mDg&C9da|UeWNQqt^Iz
z$}?Ft=X-A(dp{_0$QSq=Ts86}gKPlmkH(>I3Jw7~W(icUUW$)#Pm4Sg!4p_#D(iTG
z&8CYXi0Af*8&s8tiEEow`4by;!Ue<x49$oHRn*c$!AKU+djp6@vc?yJkS%<-1~KY+
zSNzW`IwUfj5tFpqn!Bvnizpwzb39@NGIglD1<f+IFT0+EX&l4a8Ln=4^59}RwX)2%
z_RoJtzbV7ozl$gIK<r3YBRzp}0HcYGT;lNG<P;ezYQDQk)DlbreoHut#B0gLZ})$n
zo`DOcb}Xrcn0?<JVyEt<Bq4t4gqY-*Ulg%H+zpBbg~OLJ^3|v>Tnon_T{hdNDK3_2
z%(*DE?bPbK-&Y+|5}bMTIPVxnq>^q#w34}SD*t(%%sVVux|8bSk!0KRm*|Dq&{AW0
zh;9~*W}b=s*4wMi4Jb0owYg@rC_XPFZ5AKQ$M{`)BkDe~*|%h&R;H@#jbF0W4Cl$L
z?OP6J9*&KKR0)2Zm5J(pjM$L)nD-jOpJoI)wv<`#u9g?mXv>x9!Q+H$o=NcX$T*e&
zF|Jq45?`%RXB<#uV<mDOJ@P?SAD`p+IqX|F1P&S(Fsvx_F$)HkKvR@VqM?fzj(usz
zATcsdb6sUeYO*~zAT<W$YNtdEw3`HLSMs=BJIH0OCXk?ee9lmf4hdY-`P5DNo@T)2
zn&(#1nlD`+&%F@sb%WWs$M&76FX)tT4UhTA0OV2_F^<KCJ$CT3o67QEnnl&&&u%K?
zei>^uez0Tl-*~&Jh0TMY#8J?0Dl4>#hDaDQmXd>bg=k&du<%KWL6*(2H}#w$ULTD_
z;DMCnpuH1@ymm!k$7n(_I$kDY_bSi3y7b$XTNUr*lFz4a+it`;X|e5!NLjq|Va^iv
z|8sKhxrdE;f&bU`Ms+Lh|FypLX#f8zpQObGbJS;8YxFC_RCAuZEN&?qjcr<yX|Lb3
z+1}1(cVnA~Z$A9$4SF^l>{FKE4rVm|%tqw4tZwe&E7VRW3J9X$N0C3D_>{Sx(lM#@
z+eRxY8VNbO^|%o2(B~aqe;seo893fhCXrE50Q95uN<yh}ErZPRrqgV7nn$XU5o|LZ
z$=N$s&L<Z{xpM{axjR+w^7%Iw5QT(TXb%?n>F+&Q)W*KjXmM(p5C8sit5ZdP*~$IA
zhpT7zD~wm|_xB#{g5gHIC%%kql%!9FU1m*ZXltUChJrcZJsyrud`xuY4ZZ0NN2Q{D
z1Ycs}7j<Bz(;&%^5HX_r=X`%s7H|D4Or}KP^j97UBGd$)p-KLz(z-<waeN*JeT;Os
zEG~MkxIOY<iO*G0Jc+ern95T6*o`h0H0Joc>-#vV_B>AlcY+6WQJ4H8E0FYD`tqt^
z%uXsvP!~yxF!vkXfB~))ufF+)h5O_J5V7ZhcEepXPR<M%ALU(v|AK(R*NH<p$Q7(i
zRr9AsZRrP~kqFEpJ{)$P-lxpsdR5bB7P>(vbA2zsM`SlnA2T3BF|ER4bFgf~v2PPe
zZ#TgXKQ9eT^Jp$C(Iv9C1V!z;1|(`Ol13dpP5Ed7tm?AZ>B(7RKDPz|l2xULAaD(N
zY_Q96FG;C*DS}x)8;hANOAp2#Ehu*)-B_ZAYuCp`5vmyV0sYuD22oZ#Q0b~M-WV;S
zGIJ69#EQ}jqo7{Jv2yCUQB==etf+d<ML!$cpl$3SThGg^Z8^RHUphm*2|GPyr_rel
z4DlmLAm_#e<e!-MRJImPc9FeBHI`v?G3=6RCv$qz-eNwqXvMf#B|}uwcDnfcAYS0y
z6lmkSuO{W>{yWE*6W4y`S##o2&s=j(LiV0(&q+v2^9(vMxi8H)V-b{`z67rLI;SWi
zHKEj^eDr&3<6r-?g#Bma^!)Jp9u}a5_Mgqoxcz5)<I(=}RX%HLD{E^)+Pdkc)&Kh6
z|LgzzU;o$t`hWhf|Hps*U;p)gi~st6|JVQVzy4qU^?&}?|M6e{pa1&*{n!7AcNbUJ
z%a!eNb+gQM<Iba-Vt?dKgB$VM`E&t%-M=iSyM(T#x(vOm@3q=LW|*Limxd8)&kx)K
zOxs7kiEH-H`&*}$bn@9d;H)brSW$gbuTEy;Lr~b5D{%?=O`EM`k(bta3?7`BZ}aAl
zRfb9a(%0Y&^44=5oM)fA+l5N6G(f54Q$`^(Njpk9PPP<FV+QqI%tXFS`OkA9RcOwJ
zl&4}2h_Z>LK}?p9Kve!w)@+zZqp4R_CC(V%IlWeU{^7bg`%++5zm!;{Xd`xvs8G@v
zBd^~B3I8=n_+i#Ki{ev6&rV;J&p3f5$mgHf-yiaQFZ@!VFYp8SJ+MyjEQ$6n3;P}L
zzBKUjT^8;RdxCAomS#335Pw(tugTIoo!J<j&IM={>bV-?DQ3A+TJtI0P``Ju571Z@
zWs-80MvQvaFIU;3#)vTU+$FXh9pA1`o2|D6K`DEs?jrAvGhwsx3*t#)>T<EuLZ%ub
zlKye{k;!>8y09o?ejiNL%XN~tSI#KJY&gZufhRoE$H90sy)H((AI@oDZ@ISm%fF`A
z<nmy(qQf&E(!(JyVtvG%9bk9N@Fd8VC6en)q`5GdMNDS~yQ$@UF52*B!hnG6H5&|~
zE7eVw6Vbmla?@&WVIv;RYHqZNQ$~fsSZJ%c#bwor>&4dIGN+?tCEM2_St%X?YckW!
zj%2u~suRhZ68pDxZO~j$P6zJ<O!&WHG;C}IMHU_Yi^ijr*^R`z-KYyvP(FCmiz8UW
zmu{Y0Q7esnDY9(Ji$1CBPy923XWhA*j6LSg?LE=x)(bB$zR5zR<^hX##?%Q>nn8R*
zEPcS7lQij|G7nDG!|mYIJQ)_51VVD=Bpk8_l2YX3ecm<R`F-QaFXa|+d7b+2t*n26
z&l2{Zzu!Ibmp=>Qe=D_WJpQ***{nU<f4;_NZM75&0Nx`T&IX142EN#HgV}WIiSN&y
zi{L--Pq}yT>JJvpi>(*|y`oyaXE3jf2fa`9EXBIkl7QSbl=tBxc^@c{cVQT8{p|ED
zMS8~KUVr_S0$-m##aA5t`lpC|O$mLKLrg}y%1~Eq=04G`cBm`1cDHEPM5rq^b;oE|
zJJb~$x^uK^BGgp{3Ew{2H6_%Q#(1}A*I1}42MaHbcKvHsoa<lX5w3q_DGD?|yn8Qr
zm1T%FjTFR5{u+zE0l6imjBScbFB7wQWj3_9kZr_4NecK*7)BkDBq4UhWY!%*-M_ZF
ze{;#KP9oP|JFVCM2@7IHT5dcLx9Ds3sD+eHOjAazHz<Q=g9I%ouHp3ic!5`W)k<Vr
za45es^<=v|WPoKO`b&Z(_0i?Pip}j8Mi+OrEWW-LU`nrE4ltXBza(5zb&r9?OJgUa
zx4c?1t9Usrx&ZE)>HP7tqn1^kOB9M?)agyH^A-9=o{RjIJrvPj#=HjVf5v)DyY7e@
z%)B9v-kJyVQKotINxguI(qw8YLYgH`IK4D*=HxdsKiRp%ZIJXB3^$L=v7s22RU~q|
zu$fn8liKyd<|=dAR~Dn#dY{untcGo1O4f+nFzf|lmrrQRvFSylJcyJLS<~{;95$82
zkW!TuAP!x?XhKJ;*bbVPpmTt1?B&i5_7_<o)JJ84=Y~NDX}&qC9|B!X3G6;5GAI;S
z=7zV2t<yZMqe7vO7^)tfX4EO8`)1zoprQ*?G&1~c5+ko<_Zu<dRJ78n&%*1KB#zr7
zmb#pW*()xv1ZtTtEy8W~7{8f2NR8dAG_qF+n1f%<w_{z$HfH0owfz`P%2gr4p+5~{
zYa@`PlYZhtb5VF{FfFQdrErpQh7wgvUzKSrm+C~I$0nW%*mRm!LgE_jypiwKH*vZ6
zU(@yK5Aj*T{^woZd_rfLJNL1`|7&BTww>_*dW`@3I-jHt+kF4i5AaXA9&5hTx~zAH
zZ11V5m6}9pcS)?|U3Lb2!6AT&rqc2s@q6T{R3@KDPL$no>Z!Xh@)0dKD^GJhU~q_8
ze|dP~=jz!2Es^NMnlmG*f%!a<Oaf=C10ui7m>hJxaUPS#poEb&J#&FvB2mbL0~uYg
zmyNlF89yEdD$GQYg1d;879sC<fO8@GmdIpsTc`}MX5&C+N{|pq5iLE<nRXYEGdm|I
z#;sCc#0K!+B=Lof{$zUXKS9n5i}%fok+AsB+yDuiDa?(Iu-E0h&<Ja(qy<LYBWp$T
zedl1m(>!XP+DnAKCxTu0X~ZXO2sIl|E6jHirZTRy;%*RFh9!R6^Zier%h_?Xcwj8}
z<Z{nC>;G3vfxd+NPx-&U-2G408c6+#`=2(}ALakA@p;Vu{h0szG5_~t{_n^9-;epf
zzgYh7dC9+*xJ@v;3D?kE6xxs7hcY`+rnS4J^QL>5#OjdTs7c-=Wzp#aCoK~DfG<)~
zz3h0H;N=oiwOs0FQ{uGr*G}KPAa{3Uy21>w9ohWq6$bHRIv55-UmFH9g9+x|ogJPw
zfjjKM6cPk72ltSDYNhmRyomCHM2Io*6;ETS6h8?^bZy}>iJ&v{ZW@NMKkH~yl1gU|
zciH^93!sXn5lx|4)|evdweh30^lzYyr0H1pRrwT}sYd5OG&k~YI+%odhw?!OI`iwC
z{Hn|5{QXJ;Ut-*q<hcFGZHK*d7UHis;gWa71}>j2GvQZDPWT^c<Vy^E(Tp!O?l#n+
zG^Brofva68J`#F3k54U|Z~9haNOFT%zVa06$t)4!IaXw;8!c3#XT9g}W=$EwlABKI
zK5{EWP`mRsk<|MgvWe_osj9y);Tg;ZR#Dg?#}GFk(VevbFX{5c=xs4MONN_;DrML~
zc|ERJZ$W`}ohjwYR+kw(6UIdbYof{~s&b_gTPe=D<BjJo6+4%<JTzcJy8qFEJwg9X
zP7W;c`l9)=v&2J5u271p_Ai(=KK6!9&xYv8n|zGacppfy!+)t1-OJ|ZUOGAV@|n4p
zPRo6}oZNRw$eo>pn|5l=Lr@D#QKgEUlUv<?^D?dKl~pxTOrpAcHH})WnbCy5x8;{V
zOW6M%_e;nBZ6^GG;Mt@7|7(06?f;MV|3~}(qy7KU{{LwI{}T59dLzU5uU;&&@}u<e
zAXfgmdn*&a!^IC%?EA{=CEeEl+3qgQfM0hb>%G;FJ1h!ycV=8=_bBgs_$g*;aEFDL
z=1rRFI~BDO;<!nTUOh{-!Q9$ZUv~{V{hwl7OB&_t?h+RH+rW_^uDGq_4rX`9W$pXG
z8_Frb=8Eib39AiN8sxskI0+W#Uwl?~m$1q|_~376dUp^;ck$R440IVg{1=(#TNv9H
zO*3kr<}@1`>Jsz(^@o2ui~FL9R-<1q(j^Snw`VKvJbSf)-K8wi+I$F9$+p7;Hj8O{
z*ewl-#wh=rSP`Q+`f|R<@}Xrbl+RK;V<V0gr|K_g6x3VRJd2<v*}3Mxh%e5y1x6G;
z&k(5B-aMn;qhIb<`()eyl$1T`mA&!3`dASESJ~W3=KtELKHC4j#%B_MVs^dzAA9fW
zKQubcqc*7Chn?e-#zFJP|5%Y>0-d4P?R!DI)M4{A=<WZp;$FMGj%?`L-}uYt6<O!o
z-;CFv*S`JDZu9es)Zn<RDkdMUOg^1k@1q}|6@jj-962L*N2s6sZrBUF39`{0@y;82
zun7SBggtdn^oAbh&Va51X-i|PQ+egR8-!HjKS069WHg=kc&m2n=s#8ty>7T8N{8S6
zCP5aZq3Udp?$L#}O@Q5m6$<Tl4w{FJPV3;H-8k*MZl1Pxw>JK094veN_r2bI6aUH2
z0{efpT3ff*e-*wxuK%y{0qNtd6J7`+0O5@$Ls#2)wXG8^rUTD>PZsHsJMv)_UFiBD
zTYX`LyCAuMfUp+0lcCdd*9P9WzlLp{yVFttGMqmux!jcSCvHIfg=GVlkZ-edW^^ka
zN^mH(ja|3TW?xyzABc&61)>vtnO^yHkU&9B0b7VM*Y*(Bzqa{vAQ9elfvxl|K*9vM
zsw~<r+tE#nKk^3{qDu+2gApU8ToyY8iJADhNo5PqO)5pvc7~VE6sxwKF`&+yOnmXZ
zGoHfY`bX-y$>X63ejX1^9uG|(4^18qP5w0xP4)rq&RgTKL_W|@=y&S}QL&!@4n=ik
z1@`hYdC^30KI3ir+#TcYid)3kzd=?7D;RgY5H~XD-f9SDA5ouwUr^?D@xG8aPC?1A
zF~$p?*wVySv`_BMOXKIIGqhX-qe`n|I%N4AJ$jki1>LE^J<P_TcRqIeWERV>qQr3^
zO(liAahV1JQ81y%<CFc_q>%7{oL>u|Us%iU{!N*a2r6i0&mUp(y@kD16HjU;01UOu
zxbTBybE#l6)C+4d*q=3u(~&O`Z_L^%Nn9`WW161TDYanD(a=ZRAqZhv&+!N+?H!V?
zISrAKm7z_Cv^hlrhkYl4Sgc-5qnQEG)4hHfAC8Ov6qy($5q`GXdr1q5WMB9{?yep?
znz4Whn=IbDY>K~$<@ENHBItqNcG}JV(V)$8gPJYP|A==^FYv=f#pq*nir^mvu1n*2
z?+o)7)1sh(7Q{zw_=Km0(ksMd>6J|}vJieU3(4vcRpq$@DppvrU}?Kk6zDBTih{2C
zEP!MrewzaotUd!As!A`=(3>cl0E+u~DO*4{&dkQ5qMyap1!y_>N^BS!r9Zegi&1JX
z-3*jkg|bnKD?AmY79=oSC^#Rbk_{%Y054)F<)TTHQXlhCDjSQ6W}#FvN;#B}#=?A&
zc%f`LA0L9^uj1dc@hZzC;5VD!F{|T?0v-nB>17O36Wcf)R(Iw`luu698+RJfjf;CK
z{FSqsR*n`*RE`#uHTjq?5c^kii<~G{1fG~Bkf#=i<<yUx$e`r;lC`5U4CA-vXn23p
z#XwOG#A<go-~;=iJC0I8Gs~rErIVYyy*-#m{&*$U@id6)s_q-t6Ht!wihCDRwvA+^
zdf%*}H^pKkf+Xvlutnn5_4wS;sFoBU%!5Ymif<BBb!?2ueTX@XXN^6xX=}e*m87E{
z%<l)k9$|W2yA6-i6K8;KHJzwrU8l<%-eV@mKiMbS{#%{~&ZQTYZ$`s=_OamnXKQ1-
z60`qqZ*Fft+JC>sXXuR2XU@61BYG=6*g0Xd4lpllNu2k3^luM~tgQGUKOTDH*)@Ih
z!|Rn5G*s<~F6<ayZ)K$$IOE=hOGW+h@P;$YmhdS19CS|k3;0p=1C#;aCi2JH{}wRg
z`M6eI{T6g%d03>{0cP{F$bE}vDLLG+b6XoZ@ykn;&c}K~zdCoP;$k|Tgga|%=ic;U
z)-A)()|jkia6{0$@Gjl8t#YNjRR#(upZ_EBGC_(cUH{{9AkyDYX5oeOB`Hw}@#Kkk
zebzkO@0=dCcW+#@w|#Q)se3)~gQ+;KpT6Dw_V~m8S{U?pzQv#TcH&QT0^NZJ_;Uw-
z;CA=`D>mrUllpr+4sUmk>hBsne3*jd_<OTpC`v7j0-PeW-iPIp(?e*&vLBqUfr@dA
zKlGPU4Tf4PRV(G{dg-lqe$n>aAaKf)Pv_Cl!&%=~*~47G61)^kG$2ZVL!6g2BTCOg
z4gB3%^C#1_q2F_cYh7=Q2%_$&Sm{!P?r<=h;AOrsc(}lk&T8gQ+;JEVd4?kV!j9$i
z`>?knW*voKwpNFlROu&BIV_2%lZms_y9i*KfhyM|uSC;)@RW*AoZcr`Ji7AG>-M%v
z{qDK_+r2b@?|AFax8em#$%ox@vm`9X(r7lEdhk{~diE^-2)@C<?H=U=voVlx&I3>0
zf>09j9Mv6P@*1bJ%G`P_XZ(Vdwz3itW=S-D1d8nNiE!%}i<I^oM`)_-G=8kVJ3ef*
zcV4$zhr6vKq2ILIhw5QYyW%Wb(#f8_jX$z_=$tm%r|nojIQ>R{ORlB_bbyq^g4;Vd
ztiQqWkJf9V^Z{tz4{{NS?)~`V`~rvj#(U#=V%+ML4okFppVx8hokE7u5aLXp`|suy
zeTY&Cq=4S1k{@`$z(ZnfC0q=jO2FrPpLPec;ZQgG-yB;SYs|Q~DP2ziW@0h{)CzBT
zyf@Il<RA4Qq?xuCwvHP|xFXcVew!b{1op++EDR*4-E)USCs>m_^FONP>e^}{hh}bE
zOS@G9a}MF8735+t(ocOa5Z#$K?62X7dwuzXB@048xh%f@Esm$p5u)BVPF}a#jos?X
zk`e&npCM}h&^&H;>g~=!y$Kt0RrIDVXjY~7iBT*lNt?&t{4Q~N>E*#p|1aVLEENAL
zL|>CP9|YR%@a&C5DG-9hp%j={WZKaJ6n<EGx^~B&Gn9|C5GF<-Bwfj;(Y_^rPpqqs
z?R`jnN@DDd|K^kk<*_%konQy0tF4XF_4BRL)<(PtZZGLYOaX-p8#8TAv{7PjZx`C=
zKvUQpHN0Lc0UWr3QeQoL7LiEljX1)=0HbFrk>b`*$BkX7tj1n_Xr8{+u1Y5)W%y$Q
zo-sFfxe}ko_WL~yf!sFc?26wdrzpJaDK5jCr)vFO{q&^yW2f=Hez=>1q4$Pm_nKBc
zj+TGrWO*s|S+Xv-Ldh9&-~MK__F2_RDc-yAds;f<0cO4}-Jt)*EO0y&4%{JnVccVO
zd!s%LaBXc*Jl)&*cpUiWfin{5s2z$tOmE@iI}aC!KbVU5UO0o1wWqVb=YK?Ge|(J%
zp8EbU{P=$FV|{iFQjHVb@bizCy-Ozu0q%0wnLZWHsK2!#o<4c<)S%g0(n?HLK`{jz
zjOZd7oDMlEAydF{{<kr5Wb6Ml)bJr3z);EG-rmg8|JS$It8x7wN<8ZSU*q$aZ&1}*
z3ok@z=B});%QYV7H%@lH{muNjQ!@3R&$8%o>*Q1y#2-7Q&8_wA7wSC;A7&Z#0LyJ`
ztbbn7+x54<sjoYw%IB5Xj{NO!_Jh(6mXX4Kr+xy0o2qj1W_M*}I+~EnXnyo*>W(HL
z^b}T(o9vSbjq&Tx*1|4Hhi9+9(r)ejutZV3+<Ik2$!!vPkV{0aYD*;u=pG0-4Z?(K
zvFDU~!PG49L*pm={U`S(dT-Ze5X=Vb+Wa0HpaM!MK6l5!Nks`0Z^ye58<iJZR_Va~
zyKz=hy56k35GA}Nsx<cds0@S`PHl6`EQ9U9Z0P}gHedFgn^3H8ZC1>O;jH^N@pNtP
zX!kASSe&BpwO4;?mSTVnOn#m-E{TrMu#;~*pEn{J%e+CvN00@q8^Ff&Pot#jkZ|_V
z*r=cp1R~ihz1pkCMwu)y55uxZNUmk}1W&K0$$~vPvXRAOZ`EYQpBpnl)1V13T8p_-
z3GEISKA@&r+b&n&e^tQ`NqdU(gU|A1&nflXAU@OTrSZmiY)@8h1x;!8ZC#-|70*!C
z|AbDZ-{yM`wxjsLXAA)fMldad2xBXsS3vijsB6E_R|!;$lXsxgHBX^^XyKJetVVx4
z5Z`~_XdSHd9e3o9(NzGH<`rNn<Uwn6x?<shaIn%vrCZ}`Wj6M%L%LN9$ESGG=M`*!
z8MZ?}&V_P13^V3~Udh=gN!YE$NAKe=^&6NI^94=}flYJcOjBW6v3H!$>4jE6R(Cu+
zo1A(>apj7>JH@Lp(M1ChCKzKYbn*-+`bL!6C`3p2BP8{G5e{8<BC7a(>|(p8xEMtE
z$(w}23B|zihO+>;9H1JYfKJ^03gX<}iV*Wv@e4}E(GG+Q0NW`!VF}v_b1N%yhht@Y
zr}Q}{Sc=kxxmG4NZ2-Tph(ID%FFAUky8pbafVx2b>pg^wG57qZy1rdmPx$|DRUhTQ
zukwi!C=5pAb7W^#z@>!ht~0fsW142qk7a32%iKH-(7B$TNhik-&7<{NqDYvM@!1=3
z>IaVeGcrPi7+w&o;GK`1VJts%5R79m4!w~#rM`?Yrlyn7xg-E^gj=PpP~0|IzXLlF
zRfxfx8@o30a#!AXy+(N|-0^IruFCZMac3I2JnprQjyk7%$HnN^*-`UH<LAM?@dH8n
zOt~h=F%B7}cP^Vs?S&op_ymOOMA6smf50vuxPwPVQuKzv?ZP;KiDi;BQ?`8;)81s6
zPJq5HR25|59i+R5fX*!2b2_+PWxULMqy1Vx3z*@TCYF_RkpzxhMW%kx>G{AbD4(}c
zb{1aj@$=9qKlX-^ry>-UcV%V}9T6IQ(P7<4bn?bxD={IvE}9Vvc%mhbB|(_+XMsQl
zk8g5=z!|w$e()(Lb_#}%5Q2n-LX1`}(rzff@(xKc%*y!)3+6kR2o=#Xo(}T4zkFAz
z^+m2Io;{;x3NO{GPDq!LnsqxEUy<+h3b5JIKdP0Fus!@-dAVL29oO6K#=iVr8GRh*
zpcQgN`z>C$I>MbfQJ9AC?Agm$*EpPs%h#^jEmdExua9t7Jx;VmIDoc96tqvSO3IbB
zCmpDNi+JC=_8x{6nq(biU}Z8mcc-+31|WOqpG+@{@~Sj^C&Qxi`MmC^pi`F?R%No%
z!m}uashPqOg@)7SyM`D@LVx2<+czO7$CzfZ9-^fVzvZ6{rgJ(ROw0W%Jlx#}wE@e6
zASu>s1yFtH)uDf--V`W<s;0@$nkt!t1G+KAXDGTZ(5Sd@E?p6Nz#!eh060|$WaguI
zhcREe3VPII{5y(dR~+WW=2&uV=eQJEI28HP{?UHp_1T*OySnqL;zuignbD+hSxpbJ
zA9TW_>C2;kU9_g&y2A-Z;P?WTU*Nz5asbXHhmTr;VnWor0Ej?$zj!PzDDdY-Nt2e>
zJ+E&WY6@~)<8WW(csr3z?&Ma;D+>stW4*}75<IYD-s;Htn;%T3f%@r<>8F(y0)60a
z#3}~oN#4e+&ZT;*fcaH7;!4zFQBX@dKpz{}RXHX`BlO(^2y)G%gI3N+vLFjGcM|{n
zC#FWgE4<(vy<$g7Ob)@AIB6Uo{?x$;j-xkGUWRiY5bks}XD8=Y<Ug>8;Qx8qREW^0
zV6;$3rg|`&<n<_?QF}vooKI^b%GU5fk)#-S?ywImBmmryXB-BGIp`hf!1nR<x_ndq
z$5WBtEQs#SlmoM9yD(B@U>XWF48VKtV}RVHV4@6)lmsx=@5SaE_yMqnBuSGPRbMoT
z+||?{VpmUiwyPCmx`+aBHlCKB77}PD3W(akvd^k~nWJn+L2?Y69e0mPS&w~1t{fw4
z1>H$5NwpABEwoNwBak8j*0hX;3}VFWDMZn&?%(jraiRu`gQ4RG4r6Cw`GI8rAj|@p
z!hAIFBzOmeER3I-lB$Wb?b_?U$Y=r{M0<lgCHAKIs+H8mUa_G&gzh^?5nXf>jjiW7
zD^{Vo4Ggb$f!t{SwRl0{s&Z2=iZQTM3g!eZ`3Zkq;Y5sarBBOh7BbdxuH86n?461i
zYAli~a&eW(<>g##Dj46P#1R7DBT@i30c-API=NW{!~ScGnOFh>&1WPt*|nJo#+bcn
zoS=3tOTi4g=a_961Q;{v5IRX;xtQIi$Ot7+C(|2R*9w0yLEd=gY8);isn1eG(S?<S
zu`efH{Dpc#@}k~~G>O#NnBs%E!-%ph>Y^^Jv?;xpa;uf(F$rKD_xzzD+0l*?!nW4A
za6v#!-%2EHFW5P-q<cLf+sLBb;cesauqD3hgGi_v*B%wr08~=U3nph>{JS-i@9M{5
z$9jUXnm=U|h%x7iGE`3ss8`A={`vX&&{b(8$Q1_Vj5I`YnT{%xM5(D$gmX9K`AFP5
zY+^7b20Q+MQHtM%Im+ihXQ8Cv!QO7`r)TZO7_mI!L#a@v)6OT?opc8MC3slGAFkY|
z0eMW|+WQ(TYF_gPhiC1#`>!8>0b=wJZ-Xj>RR}{J4vV5YV?=Q*c^?^B;QoCEi{I^+
z&5crFQ?Gux(g|p6{|6{=0C1bBz3{p5gesJ(i3EpzpL9q}ix6JGT%>J7S?Z|ni&L;q
zU3mBbWN=v<$yF(+2Crrju#mzLp}KH+!~HG<epi&@Vnp5Pqf23kk=`TKu%4-hr0&On
z2}RSk6@~xF&a1|ncQigKUREnj8FI`4_achp4pp7rq>LtwqA(tyMZ?}pvU&mhEz=7b
zs?1*S!ScPJ8ERfPXJhYLRn*3uGMadnYyV(BwkgYeaE|EDMxz_Uk|q9zDIGxkLC<2?
zE@2H#(Zl7!4ZNwjKgT8-n~_$NTLG?SST|q-sy0K)0B7(=T^M9!qaBm(W&gOfMDSzk
zg+6SSv<~$B%UMW=)o+#goGyDvK4!45&j#UYH7R9n?nPLaOB4i@r+{|Mu!qybXQ7hG
z%@bCP+0Wzz$=>eE5auq=*uqKh#9peP6&K)p$@H<%Qs8FplndF+iLTo#EZ{K94<QC3
zS-{w80sN0Pz)+j6h}76XIx?~zgOV)4A+ulZfT{~wUE5($&<-a4(BWiUiX@=6qF%13
z_T4AY3GVEtpvw57>jbJsWFQ2TjeDa>o=UE+qq_Vp{e@c552zmffObf$E@IFk3H=}s
zX+#k)yJF+n#<TqTvsxkkZ!AkE^jlaobn)GHq2P0kd!PW?K+!G-V}ZYaZe);MWGs~_
z#>_o%abHAK@b4Y5P`M)(Vxy<rMDFy;#XLCy`d-?U65a_t5<|B~kH(0Fs9T_?a&IE(
zKER6U!v7VOP}0}Vw6G3q=VK)>9z4i0f+oNEI_lnk9c5rB`ce54uB{=)BRfOD(Cv`%
z9sK_ei=~Qxzl(jn#c->}zuChDx%a&jI02q&^kI;FcLM4Q9VVc<h<kq-4^u){p3#jA
zLmTICV<=W-10<XU=)?jlthQrfCOMKj>9CM+i+BxZ-4In#Gy@S7p=yk6V5*(2YphqP
zwW_lXX?W{=XzriBC8aSx7=hA(pvznpxBRdh8i_rZ&TxjN^J;DV<!zgp*LEh6v1D56
zgUol%$=vce@fU(6S0K7u)b;|B{N&#3d{=p%6M!U<!_~b*rX3n-QRK){m+a=_T=K0k
znbJSl0lVDPn5tjkU+jmPPExVq_NVE16X>=k3HSvO@V)SD5&j)pN^3hU@5sSntA1)y
z<J}3-8bh2O%aw;1$sdIt%j<)sY0-vzDS9M)RVx2V^oUPVcw-LD;xMOjOGqnmae-w}
zADdSQ%Y+w^IVY{q5DU?H{+u$p(4vyFT+vD>Gj|A9;YDMy3NIX#ReIs*5~a;531%@E
z`pz`#W#6B5hwfrY#T&y4^7?Y|$_;mEp+&C93CVDzqOTTU{cObLxr9g~S4*j?AT-Y+
zU~|9xdHok@=f)qEU(l5p#GRb+uu2b6%&S~qUz=}g^ad4Fe#l_pU_xjY-u))li(<Pd
z*2U+@gaB31hP6HqXWbhyaYB+$u=pBwr;Q8H{`vG`2}P+6wHSlg2>!9WYW_UxbS66P
zhYOsj+v8$e;R4CwJ_y-f3LzI>2*NM?*C9g`6B_^07WhoW0loRMg?o}zyB}JZlprii
zS*rL~rY`7~@F}}5d<pzL2=eBV;#}l?VRB4jFwKhUOi)LY##B&;B75pB4wQ@|yevPh
z3|lPnQ{xaz_F{3AIzgy3JqaF9*%CXDh}&jkGsQQ&P!|UZ2gcDgHK8U#UGAb<(I>3X
z#2c5=wB2AOxz9b}W7V{pHn+ehbB|<=qZw$vk};K3rGr=ZxPfI2mlK1}ac1ye?v&HD
zQN1Gk>-$Cu(!e$Iky<lC4n~}nUfKouka^++A%>W%)x=$?$zcFwy1l~7IAjN|i?e}W
zi+QA()k5w+v{i2_Iuy3s(|DIvQ+XNH+KnzrG8YtofY^IZ=;E5?hSZr&F?XzdQRq~s
zh%RR0W9~mb=I~UU2Tm#s`pe~b!KRE3XPa9#tR-|c6`C=)8Fep}yhSP$lqqL|ml#Z4
z%#aU7Z#XA>*CmR1+E+FXa@b@L%Q{yM-$ww1|4DV_g|OV*5KqA_XzA-id!E{Nd_RH;
zAp3Gt%W74wxUpREZ#S{Hp=4F7k0i9jEby%E0cr3h60ieyy=mYC9`rdTw+*JUQg=4|
zWbB0Kn3wm+UtW0Pdr_@DhcC~bnFn@@rnt(87ix|_FE!I!SnIHL_~GnSPIYbBnR{Zn
z$pAZ};<yvxYWsowR?yjrZr;FUhea6w#wtje@YWCJeCPAgR<~N<KGWTl$k}UgRaf0m
z0@bVb?uS!Hi*LcqMF!4j4q1QqN~J>bI6dKPb<06nXW8tJG<R&Ep_xPw;d%Lf*~Qw#
z<~JjEgzGK64f3tdF(m;NZWXe&TA+fZmYbXrZAqqi3B}=I>*!7AUH!)gV2>iV^P*N;
zU*E1(*0-K-ZftLFKCf)^I;h=k9V|uCw<GJwKXr))4A)hSsinN!7EeVR21G2Cx3^bc
zekz`SiK)2lcJkUG{f4kg=1qIgxGz?-2)udpFjy^Rqjmki357S0z6^zb{}txq#g~|i
zKNyL}(CP$%a|6gNRUZVat0fX{pE+TFa4!+&fspx5iwV-=A<%LJGEm@*&%Z2YsnZ8T
z?6-_q1FzNJl}K@L(goy;BX*AiIR@T2o|liDYi~3g84{pSLgei*%_D;5A{kUvE47V9
zBo1XZrFg&nJI;als>E&dHO8A%gb#lPLrlRJxaUp)3RXxVa|S-6>5zvEU8mm}VH+K`
zT;(xl2xS(rCgiQpY?mn%#4|i>z`A5ai)s?!KUXVCs1C={3pG}xs9KCYFW?k@HyqAl
zd@9mYQcjs{$d}ha(}|2voIx$y_t6>=xFB!%W6^g94q#bO+Jh*dBApDAqvc@8_-G%V
zK<AQViwThLntTWf{EIh;L|YJZ6~!#t(V~(Mv#({SCI$i3UVLF@@CV-J9vIu-W?<Vu
z_VeEl*<XI|Qz7gT(m(jYCwX5hSuLWg=h0e4joxMR8;q^vqy_e=XRRL?`<oB0t0+s#
zt~x=;jCfmyL?yO}8wfo88e$Om6(-dX`HwJ$kK+PJ6d1fn*U)legQ+hDFzT;_N7Md$
z8!T!gRyGQ)BouQYAwlvFKACEh#H4U|@Z$<+Fm;0{P*#SVeCb)czALKIW(+va7ucB>
zQ9$ZR%!zvr$fYP=ieyHH;)UVN6@S^-M7iXRH+?(n#!gFkR{FjQx#qYcYy|7`Lz2*G
zgLuf(lS=&b<iYJFU)0Eb|7{rOtkFJR$KdNO;Cv)Eqfq2|s?_v7uha_mtVJgE^cEg)
zo_4D=QPb<`j&-8(peoZ{=MA&eTRZ+@bNVvY^xID%=9vO%ISer$Jk8&QF@M#~1@mWB
zf56Fm#h#zB^QfH-d2(5M_&wtelX!gAetWyMS6jOH&y`;u<|M{!&myC(!t%gWGk{4k
z)h=$xFxhU@?nB9`k%>^EGoB5HmKTO{wm{DrBm0^8iqFxE*lcr~!CXu%&gtM$43I$A
zCd%wXA~D%Y%{8FHOjW-rRHy*bJLa6OV>ns}z&xCqFxXpm45_OZUS~v`YX>2bPNRIm
zqC_rZI=aDEhPyH<Q=01~n;QcOcZ(vkaeDvqPQ3xOMBT}oCDBrl+1F$m+`cFF=VBSe
z4?5oXZyb(nQK8KISjS>`ab_qk9Q1e9Yp2YZK0vY1#(QKPD)+21z0@*t(5jG$1EUnM
zgZ^wnh4`!S4vB}};1_=WS?wKbq6PbQfVtP?kc1w3XpR&#^}2qMe{$j21a5h<&G58~
z@rD$wtHl<Sl}SN8A@8gl-A{vw3UG^D-+qxG^<MfqGhMWnghG~HUA)hk3ysU#AOJE?
zn69GEP!W{2I1`&EsDT*x<i)DORaCZ(*Y*9*e(PPmc_eaPpRnbH)6&={BDle;?Q%)d
z?Lw=Vhemk=V%|?uYr>>ATio|hIx9N;en2_AE<Cm}{#JH8Ai0r8oV9)cyG7&lb9$Xs
zC^{WYV%ag!748zAox4+2GM^l0QRHyCVb-5e*YGd5CZ~WBK3$@}g`K`>P1K=Lv>KyZ
zmRKG8(^Wy((q))Hc!EOH=tPOidz|E}i#}wbKfE+mciF>%7eK+#r341j1#IMaV=;C{
zE{wW2o#CvksupPOkACEV>4p-to`wX2<ZZ&U%t|t$o~gKXTBmPQj$6?Hg&y68arFp+
z1{C0(4qnftd{dY#Y%EPq;-CMt+7Kyi>^V}K#^D0KQV4hX#t0yqy|J$wy#+9MDFMyI
zSdNN*fMS0M%&lL<vEF5jM?O(Dk``>xeh+iq$dC>s9PH#4t(}50>jzGtQ$h+wKQ!PO
zF4kK#ryzLXF^{vye9Q3y_QF|@QH4SdK~fgVtZC4ABx31w6<OKS+L*Hy4W?>w(E=%p
z1AjK|3-=O)tY-W88#@sR?tPl^SUlzPN<2k1KFwqo=<r5q^JU^Tyz3$26^Z4ov><aw
zt0uRzl%?Eknd>-#Tr*Kh;12M%?-ZX$jnTz}(s^%W7JY%~Z?v1M)9bmDsgZ#v%pNpl
z(@_Io15B?)yBA%Yk_^30M?m3abh6dMgs)B)t>Xx-R8-65vUR$p$7^SvMOzf<x9q+d
zU>({q@nJ_kR3fFmH(u%!YNts{=e#<hjL*17s(O}eG0|T9h@&FryS^FvPCxGYjs@nY
zYLgnODq^XkYJO$o%3agc)uR1V7MkajXf8V4q^_5AMO?0JncLNDoRLS`?6YUqvR~NR
zQS&ghsj)ZIP0h~|%CxahnWfYjh|ViT=F1RMGGn|8S@pZ<@=9EgCbu==Lz6U8>QEAS
zRtoF*RSQ~9uW0J2w!Y%@Om&3{WW^|ill6{8yfJxh9??#4!TwhHY)~quZ3P`+)gSiL
z?AVi7Fp9lW($bQ$O$kGYNFoNzrle9N0Ha)#fEwj3m6}))b0D^k6!Xw2*mqG9vR9w+
z0A4?t^cJO7eA74;6qS76w11Mt(&%Z)YJ(i|FP^NvI^*lg*gmNtn3_ojoNWasS_mR&
z<2HZ?%>HO%Bfkv(3b#QQ)0@&TkqY<ZO2cMN0yjpQ&wb#GtaywAYZI2NKN1GcWtHCt
zpLDx-4>fY-hrT4yd~jt#Am~tq83<r=Dt4HUL?lyOVr;QQmJcu{;H^uK3An-87$=AX
zCfs{94@Ig!cgJo(2XNzPe0p2QlqTw;c(Ka4O*}1frL3aZiP8s>ReePWMJ5Y`&vWUD
zRusHTT^#|ZSzQVd8l?Osmcdf(Mr0~+m25vYz1c#<EeKL#(OgrQURom(S=!JK4aPM;
zmM<%q?`yCyI-R7wXv(?C`C@BS*@=&sgH*&MM}ti2o8&=g3avoNLSi>0nwMK*jffvA
z<E=}Hz0lsa>@6*OM?5&tu5s30T4Nc<5>}$S1g5=7$LFVuV^mdjS-}(^<TM_iHd{w{
zeb*^wJk39mC9QO(^YWWYi>$1+Q0iG4^0@SsYJYs0Inp?T<{d|Q*YTF4h=#pqqK2bY
z5uq&||2kgRWCn4q3Rk0qPNR1Y7eHD<O!c~Hw40_Een9&Rs#<A-w6rHZQWLxP9Im6s
zs~Ww-pdA=>udK$M;=Dj@)8L)h=v%WOqUFv}i+E+Hes<bAIB7J*VCb9+yeTKV<2dER
zva0mY-8tQTDN0DeNCqXKcr^=Mdr<%rvqUb7XFd@5D?DkCEh+E|A|^%H{6YwNfK{Wg
zM0#c?9apS`exX&CfjI7S&WZ!RP7Iw6chwFTv%JK0SG6Usrf!V*t@O&geGB#fwEaWX
z>s<K$r}=wFyldIBtu!b0iqx%Td9qQx-H|4eJMr;J^ZkDPv~Fz2PuR3&q5t7G9xcS|
za)(J)8)4RET*KlRczEL`86>YbFyG9cpLQJIOZ1LymQ7+%3QHP6q#Tt!SiTN@f70?P
zI+`F+lURsnhC>e{BUBoZh3a1JxOwy@L)BZL*;zJb?Wa6Z_bTNk{`g#(mX}o>a432(
zD3<DxXg{&VLz<TkdhW$9OApQeblZVpPUCh;y4tvGFmFtDPGgeSvHGyTjJrox!*3W_
zw<LkM1Cl&uFmYtTw~W`Jg{|)Wv6Ydzma|w~S1JseepOv$p7`=ulwMp3EE>=Pl#=ia
zbiD?BG`Nw#$#8%ud258O1Xwbi5j48&%tYRQXw;Dk{o)Bh{EYoi?#-<*gtq#nG<34M
zZ)f=_DsQu;p=}=Roruwm+zD<4^4z<l?t<pXfjJ3(vLSmMhipl{8G7VX4di*3io`}2
zVC?Xue)OiHYE(q2dMm6Ye3<!@c4n0<^^Lu365fsoe{sFAbj7NwNStH6up9}F)?7a1
ziA@;n?p+r|cz0F!AeG2KnX)!fPTZb1@OorVA~N=azDt}BgL$X{N<V}fB2h#+N#@e(
zYo;Z+BgMQsJ3MVJPbMj|zGPJvJ7QFoDAo9}v8PLYc}hy5pgZ?LweL>3_oiaAkvK&!
zggwjIHz^?TCn+W+x;CZ3<;<?pJzpw+AQ^V2zOc;1xYLEsz)j=+VVGVg-SEtL=uG=L
zQ|SV$bIfGT*WsjOolD-w3Z<XOyHaDf6Y}MouXe>&A@k(cQeskUoJmz7uF2XZ`e|wI
z&>W3oINg9N+J}wCF)Vb_G^XT%Oqc4?O}ymWrV>EfcS3XFPT%d$&O71IbthTp&QWQ%
zKgS~?e$Zio$2X!Hx8GO}&e5H+)|FJ&wcn^|?<z;Re~+#Z5<oclu|IYTIm1OL^#)Kv
zI1(+IZ%pv=C*&@xFDWV%>Ea>23A8AvbHf3NE+s0(ZY5F}iaa*5SL+gsO&ZZ7yf3Nr
zcI4gd50|YnR6g1AJl?zk5y?hoAGPM2(srs$!pS?b=W5Xr!)VWXJvR&oGu(*rg6JV&
z1GQ0|j#)W8$wBKIIInxI+jkeAtZKb<;DpnqJoME~-4w5HJeu({y1v^!SUP3ca7|1v
z7ajD@S6Y@nNt0SkiuNLMG*nDMw`|y1k_jz2fBTUODEm^&aqDSQ^N7<I;u&x>VRS=V
zl123jiFA9}sY*3@>NE)YiRrHxGG9Tzp|JGo3U6(*?jTE<^Lg{WXzrJt{}fL~n<PT<
ziZkllyc8ZR_Cbt3DXyL;Zs^Z~9^Og9KCb91J{voijyFU@P$V-%7c|}nG`!Hhb#}Tm
ze4s&JswHp2LT-Yp-mPx)CCEc`Ms@pno3ATJOG)REUx&UDE|ihSj)EzoV(aF(o;omH
z#02Kp|8DK-k+cFq`z<9x-NOEpf&mK4@UJi@3aCNO2(P0teM#-(V!@f`bJk1yhDN){
ze+%TLN^sd5x#z0@kB8d6`8=kRX3j2JH?ZR!opOfJt-=ZLKF)LR5|eq{sQJ?F4Re_P
zT%r02br~lu_F`_Xwc?)4kzj*+yX~NowWt5}ta)l~BT{e&Z4bmu`AaH)i~wX-*1iI$
zfa2wf+_*x~`T^Y@v0-xhz@VXg0k5){4f}L`5=Q3sp$st1ksm}XQLG{|Kk+^8E}oF|
z0&g;<SbE`1MWc0K-9c`!&~!6*>j&ktALEvBrRPZ}?w=DS7q}aLObtwwoHAvz0wlJ^
zh{Yl!jxsN^93Pumz)%<O=k_sb(i@FnB+eAG9|5kFQHFCu1KMi^65pd7(Q0C-edVRb
zWCRT(f>j#;&Z`(aQZgYc5lk{)&8Cb(+}oH$Nd{82B<CAbgJ4o=<;gC+?XR3rjRsZ@
zy>J6q3uV!SwFIrJW)P#EJk5)s<`mWJpdv>Q^I}TdM4{OHAcHo+pa8R{Aaxf_IWk`?
z^Cj0Z%#XxNVtY)e26!$jV1iJbQumCQ<^W5i0*NZc48WP%!%5HYyNWraEQ?h6$|Q5u
zLM)d?rf7wu9sBsAQGZjXbeEBIbjOCJU^H)9(smQ+Sg2INJMAc@8Wu~WrM*10+C@Sz
zU!DbQjrR;?-!V>}PtEy{iwLr<gs7cf#1y+Lm8wCW8J#Y?oV%FPlVzxxAKjBCr#53~
zl7{7_qk9%3{!8FJpU>;0#G)i#ym(O%YlLaczE@phRx1CEri1Nm9|C70IPe=0>~t||
z43pZ((7(_Zt=2oyyKsA-Lg{)(S2>b#0*?@e{<+s%0iJ*1;9&x79X_;oRn}1_Mo>Q*
zPt$_>b)>u*icSR$d1o?>;+c&-Jl!U?BZQTlFXhhfxTQ<(nG}(q#(t(3fj>LHn7}OG
zg5}KFSxm`xRi2+j%-$=C@odDub!tX2t-_XCvzF7ThHEDpWjw3@W~IVe{pScuOPuIY
zZ2(L1s7PQ%Uu!dsfSzf8V5R6-h01DUtwIf4TKNo^arnub2&k{0y<ZkMm{?n^t`pOg
z_~{aU+cKAZZE1+p#8B={R#g|n$QSad3LyPB&41Uw7C4|C@m+a+5EjT}3mp_iep)L{
ztA#bWOO&<g>JKv!@zc7E7cU-cUgDP$EZvxSLI%s>_nldZArjC57$c|epKi7VIWfHc
z3Ak1-_~hP*@9=6y3GPG9x^#B<eJ72_d5bBEIOY9VW#+)rOvYIrcXyfhWiGywcudh*
z{@d_i5I($#iwQORg)hHC?>gIaxbB~E^8b4?`acIrE#~ZhM#}mFZ6<dlgLDUqH6fK2
zQWZKKRw!lgUkBrZI3K%FlGK}6$+*KrQ6z&OpauNoIS&A8l=2CBaa?$Vso}WcUb{WY
z8^aD~s2Iw^=^%dp{jPZaa(<bAf<jNZ>Z3>tDE}G$WDJhXV{?X>IA-|sj2b`M_avP>
zZwhJnv60YGT54zPkLlzlZ;Y9OQ_*y*W270RMZ;3`#yo~JY}0mf<d0udSGj6!y9^Xw
zt^)D1r9_(IGv<{#Q;^0YBn-F{7C?nCP_eK2{@7Izsu#+s3v*<vgZwDB1{$pN&9k92
zn6m{+)<=y$4V5n~h}y2Yz0?TKjbTt<qaCZ8BH$UYvjr(*GC0u0Y)o5((lHP*ng|KL
zoWgzm?rsQ(>MzDYEmnQsV1Tz8f4rePj34KoLVpq%!N$HmE}%Mgytv{<_Slz2Up`+0
zP9>ff#6QJGAq8#J@ax%N;07Pi<wQ8=c*E&bCdno@6w#&kx5HG-57OuYk3VQBTfzbg
z0&;=hg6cEDM}MCiSErY9fduZd?w47+DdUTIddeFdWX<TKFGeTxupbn2gzp{7zbkFQ
z_d|m`W_#eVFSVrq0BAW5eDvJY3m>z0@{z4~eu2jpf1kPI-d$LL#0?%LB-gPmyXb8p
z9gTNrsrFzkt(z?wq5~6=KbuZwQ@Q#L$-&x(`3YTU`i)%GznN1yV~;sj?2PBxTtOH6
zYy*WERK;vO^@ixOFmxRZi5MGf9erm>iUW$z<20{p{R<DXb?>Wq3y*h6sS@=K91{l*
zhuO=PGIWuffTA1r4bZK7W3#cSi7+gbO+*n|GMRHFhALCdV$9%>fwE&tRUC_w%+;ia
z=6d{mi_M~PU8z=TmGxV3orn!6^n?PnQp90|zvyn5Ao8;RlACUZ5cUAe?9QSLptn|;
zv$NsB7CS|G<2-(Gf^+mYBOm8g_;DGFC0FNJgL7deik|i+)&qK|eBTVY-7Y{WD0eAS
ztbXy?NctRQb4;|YoaQJqBMpm_GDhvN<{q7vMTc`}a5bK@<G_UrETJ>#+b_{GGVC}Z
zrK%32vw2-ngXm5pZ?a<wmQzXq-Lj){9cX_R!0oeVFA3qL5;sa~SLE@LX$nEb4WD5I
z2Dxs1Bae8ojh`#O6mzAEoaM!p)q(oJ^qJ0yvYn`mk-l(2$CJBtEGOQX`krd6aF_1G
z+jpPvyIf}U)%5O5NFJq#u#(VNL|3_cACf*xgMLaM2?D-*M`6hcOGN9*eiCb;O0Goc
zNu+WnpEla3op$^14pUhQ!(j>O;`UPtH6M(k2n<SbdnYjNzoH0$o>S_%cSS|d>0o8?
z5OCZb2sd~LL{O0SUHV5`w9$RcMLyx?iJyd<h;o~OR%U3C#{em^ye0_@Kjbn}HK{JL
zMW;ZV={wpy$K?2;8~C5xu|VUm!236yp~$1fIr1;Wg)gN)tjdM*?dF@~=5eDa;7h0Z
z=E(9LGPWy34@DW}lWegl4p8nR5d!a=)b4zg5YfAqevQiEhms<rX#2q%_wfc)Bl<Dc
zWhHr;U+O&-7Ssa@ap|b+8`fP0EJ*QX2G)x?R|uHJq6=D7m)Z(HK9x~(O0_-RJ2t&{
z^WTL#-}MVS94a@ke7cN{PWDER=%_*LwT_N3!`ysmab6Y;NXNWom5to$V<j?NC1a%=
zI_{AZ0BT4y2T?&>%h5hpNVr0A$pxr2s49ly0!Z$~l&#zBJw|6%PG#Mt>0c6`jI*QW
zkI~yDX5_ZBvfRupkIqysmJ!S|Z<EH}tUVMRa*fRlQE8t5Hpkwy1ylho<PESpP@~hM
z%Zyn2p=(E=khHAlW7`uO?~B%kQ8d}NDqy(V6DwtnRd*L<a7vl-IF$i7a~H50b<vV5
z=Fkl^XmtF$(#>+K`c^CZmaAKn2x^$d%&WOdr<N#B_h)Ns&<i^fZPV9ve3E5(vOzAv
zK&-wpn26n>$w<<O;$Yu?za&|t3MFYvnsLQ{HL6%B$2gyuoQ^KR_@t1Az17uK@m*ga
zOK6LOdh@Wc4~qXPEeNU}LlU=?ff=i@_7BbDW1}^$nI;^`Gr#Ifb4aSq`r)B$@VMS?
zLwkAXLE@v3XjnE?!Ncx<d;I+O{}8(=g;Na9UF*A(a7|uLwHEe6k}Jy>_w57yDz>&Z
z@Zak8X2tv$KO5Cr?cb{KcWZNVyS5JHs@ogu>;EPy4>7<+pBaoj5aQov-Pw3Ln^SJV
z`#<Riy(;$GhhCS07E2{j7ki?AGj>K^Pu~JN^tyOm(TZ5bFoZpSa>Iu)Xy&fL+?HyU
z>L%z*&hQeo5Es6U2i_2Pj4!@-##5lEf1v&Ue1vx&_I;F4N3YV_!e&~5GZyvpz{x7W
zDK`$CZdeq}F@;9dF(40%g&4tw;cES|1eZ#~K)UQHf(FGIr4bV{RGqG0;GAo?nM0#w
z`KEBX=>-S@*viQ7Q(`A<qev;wCvGtEaO2lkEs5!c!_j;kpF!qy9j8Z?M(%V+!X*;0
zg&0dAfucaK5ne+AEZLDqU{2S+#8(O>V}I)P@G`$u-s&)A3ppl2J7&k@ehex+avwS%
z;soU^P@qc#DGC%AYJb*q)1XmMNTBWnjXdj9P4)dA*$o^ub88qBNFkOWbAgQF!1k=M
zPqRj$vc^F4_>NqUDq;b;APb;kLK^$gQ<?&A8dADZY6GwD8#y<4l!Uh{X<YjPL@gi9
z)IQxDKJuq@a|56U)p{2XtI&tRA2B9Ee=xm55-^AgKPqJyZrDh20n*f%sf+H=R&;#&
zwh2N(>)`Z5{iGq_`|(NZeRCgn^w&SZ%La%}$3LAk-@H8)Z(E1^jgz*hAMK++b$Zf#
zeRkS{2f2D1YUXIgz`Od<PonYT@kyiI7OfM}e0O}<g!Vq5Tj<egv(YZ13*F(_e)H%}
zQ9v8wsC6n1o9~*ZQ0%l-#D1}{WKGdJ5bqi%dvD=q{dM!OdHNG|dC)vP!tM^BzdDE{
zC#TK5v%~s{I6gZ$Zndd393SXedx!PryT*PQV1Rx_<9*}kRJ7lcKw}NJ_2H;-f&;L|
z`kLB0Y}Q{NHn=+&?LMe*d#5<8=-VD35r70useRnoYvPy2j|~`6{p2U$MkmCET1V~1
zU(cW%ychfRcl9?g#{2^8zzpr3oiyGd;H?8}r+xOiecC)dJ8g(Jt=2xFz1=u@-`s1o
zUy8$4n-F)_ZWINk?8WY}6~G$2hVQS>+D*hCA^qsIadL7-nSKi}=N|w=fP?xON_mLu
z))9>vkkvZ*3EM?v&{Pz~hqn#7BoHqpTxG=75gnKSX7AK23B3Y7PmRHfqsE)V=9|XR
zUIX9KZG#`0?M8toui3^jP44_d9eO^);nSo6Z2Z-r<swb3Xda0A{`)2Z&xNryAc=NU
zk`Fv>pY6Ss*vDnD#u=>ujoJbxLU+i@fnGPb`UZF~1pm$`PF(p5!XoZnIOB8XXLdUd
zZBi4ghq@r~k^e*{D6i*?u`qf_XU<o+3EcQIapjE3S#gG0{_4Y!?$cY50qNejH=Ol}
z3qe`vZV3ErOjn_35I|p$5#)Jvjgj9K^edboKn2CCME$T=_o6n~xViEd)m=`Cbh+rB
z(F?B=N;l`o;n{vGubVY)p0(eTr<U}{eN-F%RG)15|AB=6e_JU3Z*FaD#pM63?e)z^
z`TuKt)>1|KTBRu7dB7Xpp?DL_#>gzcAIS$Ozn{y8X+r&@JpL$;Kg#2e^7x}X{x2wx
zs}p&3RtD73+UvYc+-k3$N22NX;j|Bh$``NjkQ@){WflwBES>XrdXwQS#Q#>@Ym}Hp
zZZ9W()8`(j4v?cAB^vg<F&%6Gb08U8Ud}F^@SsRPl9cJp9S<R}AL*<oMWH&DIlvr`
zRxXYFD$B|T<AS<%;HCAt7kgbyEhQytEJi+zb}9BG%&!7O{n-QyMOjo=&6e`3D1GZz
zFkCGO|I3w?<e21>wmYqBWaN{@Rxj`Z7wSvCq+lhZ4n=IeOn7DBq`c)CPg7AJ-MdRO
z2AhJ!Kg@`n<xHsg30={qGZd4*U@R|6T1pgo*b!@~tY%duNBNxDbkAyfJaR|fqFBBo
zMIU*i=G^`yspNGom)rEF=`61+rgg>yhiV;BoI!2^iEu$DicB$mOXg5i?4}-uYBb&&
zQ#8WMZLu3oJmrlwwJ%qepB<y@0?fW#S%en7GU7uc?;mDPDNHOnvE_e}^~G2uu7WQo
z|6BSW`9rNecps?bZEtU8>3{f%>3<uw_3eKXn-302%I9BP|4W&FP_1S|_W|kP_Vd5F
zU3r}Uukx8Q|G=vP=NzAvd-v*NzWt}V1^?Oej|Pb9qy6V=d|<z+3!ZT{mw1>fpVMbB
z0YtG{BNwgZUN{PsurGyr+OOWV_RkI*9nfDJC(U=H!FB4#O~dv~w8njr1zL&*r1ig}
z$EWB7w0Z!&;y04%ND#y)9BMBmh1nRLbwP;av~BL#l&M!Kuc49WZRA{sQ+EO~#7mM!
zqq|71T+BJl8C0()9CX^71))!|b9OJ-($GO~B6r%6h1k6}Sq>8ipfb@x*RauKDkER!
z6l7$dyZwbF12>$F+{G<k1wML98Gt4WpAY@6Gh7IzEEa=t#dsxM1v+#G8NM`TRo?x!
zx@wozu4`5vz#h3hzM+y_G0Yon?M<)6YHxa7B)I5Kufht`L@Fdy;$_NvcxN=*scTu$
zALLVDFHp{1>`nUWaqbdKA{gZ_;m+cjSnPf|zn9sybo8Xx2Z2921gztKc^;;ALp6oz
zsa%|yc-p7e3R?<AX+S5@mKZ?_KF01<Y#7{Qq9~6dfdj*lEk=WQZ>#Ashdq6h%t@Jr
zSt$N8t&pZ&vwh16(DZ$?ND{eEb3E`({Nit$76*9SXyAkw=uwYOuM$|3IUco6J7^Bd
zCkjidG7*Yh)cgIm@^!?HatK$b{3laNA9(JtZ&Oe%!HjanB!jwRlNzmNoBH7$8<iZ+
zY*IeDV}m9uG+Q;F->&Hx(dLSAGQLxDCN|@blsX;X5LcOFMo;pI&9NBUFOkg^&7Cn8
zq-wVA&tsIUzPb&?m)B25doeuWefU<KmKZIx5j878gjV!69`Ul+RuyrzG&ZIoO5wq*
z{#UhKB*_<imC^U$r2eLS(r7nMF?U`&b~zR^K@btzxKdR<hSVJ_ZHvS}C!QKJiZzvo
zP;~Ljx$kvW=nQ$pdKKH<t#_8pVZBL887VwH@ggos#Fq*sSHi&WHp!#rRzmj}Sl-I!
z=vzNn)3kTesGl|j2D2e~;^ZnaN|`s_i63arbc7ykUYlkTIEL96><2_)J@BSCd3N%T
zqvHnvf0YCB%z79^0<Q=y6j4|G#f}eO{4r4nsM`Oh`QXDz^R%I&gwU6TUGz;5pnH_m
z^8lO~PJ{)&*|l2#q4Cq{PsgAiygNSqiP7=fJfvs}pj^{(>M{EW;(_Aj^foBhX_UcP
z^B@GqoW~B&*{QGDFX65BOHn*QrV|Ic^+W8^sO7;_`PQM?OgNDoZw2T&0?M}Dhldo~
z%>-5R-djMs@e5tvB6paF2Us>8gE?alOYD-gFY->PU`%e=ky_ezr|)s|$WvsMQc;V-
zPpP#W_p<gM%=v?BnHSOm?xv;EgUHrQJKKVNoXRY<ee!l5%U@{%Og)<$YRaJOGMNRW
zV8iBiHLAt{0Gy_2VuXJ-zo(2mbtg2C$`$A1$3VWs!-`DvffZQK$=0<}_Xq;ov`#Dm
zFTPHjAkB}FW<z5GMOzMUxOn1;b`9Q^i-Oh*Iv0A=ry+YNUb#;L%8oPX(HW_XIL4)&
z)av%Aoj2~3iTH^ZrMHQeb1dVAM|UG7L<m&BbUA?dy#h@EgjN_jw51D3wJpYO8kkAU
z6jMkSNtCvihz-Mb;?|sRb}fig+et&UG?bwg$!Bu%rlC6=D7X{SmuhVZd7CGIg=Rv&
zq@Rcr`)OA;0DwonvJ#-2WuOqdST$%pfg7m2pH`78L2W-$p_Afc5>@*yh+7g#c%PMQ
zl2}lZ-xz>oA`U;ioU#lN2F6m@l)@d<jvEzXT0+8}kUd~y(5n5sp};(OBAz|tHT%j?
zYzpF^|Fk;D1ATudwl-wCDX5klU7PL?Yft?NiHwDaN!x?TTFPy;l)ZvIx}<^AvkTb4
zhCF0r;Hd^uqh3YxQcIE@ANtPkuO-EqA4X~`Q-VGW!Su{UtF8KR^L^u_Q;jAe#vJkb
zw6yIUo@ew7tQN(KckcAU@4uIK;T2$^nAJ(1e%CmC+uH8{0B!O+N{UqR4$axp^4+;5
zGb_ENit(_E1-%LidgmlSr;YqpAf?%Vr3sO&0&yWCLQ^QFqhy{dd6A&lU4*(=YAy0<
z-_`O+%G-`hGKx`%g_c-R$@g{*;ep31$D%~ZRIBhlFdI^^m<q9S2bm8LVFhqL9U1#T
z)R5W^Zbfpo@*DM6<{8N?qgp1EXlR4ek@ns3P09C1yn68eskE|?Qf>!2`W{c&WV$T)
z3ERz=8G@}YoP#>+2528d=O!M3vO1^g7hHj<DXNlkCa_SM_`MGxA3wkAXU_RQ{tEit
zdmjG(+oJRTS`EL);=ec7E05>@U*nT~I&V7WA}c9hyfU6~78!g-2kPuVpqx8pR7U7r
zy26=VqeuSOpZ+__{gK3hg*))JL#L)vjir>a%-k@3gWLhuR$|+|Se2yNkrqjLj0}~T
z_X&CM0IFF?@#q-iFhM~eBz+BGvYS<sW!Hrr+{F_`-E2xJy0qIW#3mU`rS;nBeVR>l
zzS2b^ZR65~!MjB<18H_^104=$U1chuI}ujq2)FJ$$(Cv>Ju~iUksNTROORU$WwPsO
z6vV4>y(@3pyAXL8ixU6vMq&%j_StI+A)pIGI<M<{Kb#$R*j~S*_fVOvC<V&hjJ!rk
zz!D|X#vDB}T1<{nKT2!OLY>t>;!PJMmQOElftZs<`?PgpU<PHNsOy3y-NbEdrUBBZ
zW2?d%*yY=bs$`%ef$4PI#1TDzsxok#Rp8dB#!#2~$$l29Wj}YpxT>0g_*=J}sQIN3
zCxeR<>oU6dNm->W*4!D!wEAXCtinrH-Q95ylrw!?rrddAdJq~0+GGRGL(QZxtQZng
zQlchfE2=pFkfvggQuF}d7$s?w>iaVgjKr{?QUUefeR^-yN|+GBW{b}+uuO(ijoKMv
zoxH&dOeg~wx&<{`MmMUfTP;_6p-PRw%pQh+F+pX>_E%T!qy89gR7ZN@dus7D8t*)x
z6KRHtTgGuBcXw4TPx+K5Jn?t{Ps*DE`{A&^yIU!*Cq9agOXx#+ldQh3Mw1>2AE~65
zc4&}APHFxLhT+t*j6i=8ofbtkMQ@`rnj*~!iI>vE2o04tGYZ)RSQJ_KisJ``u1xgM
zr9BsD%88D#ZBY#;P)!qE))P~L>t{c9>IbKdlg`QhYhzi&Td5S{Yy?YXwfMSm0Q(;`
z8MERWJK7xUXV&~=mNn)nb<a%AHaD+F^P<kr*@qI*ruv0OleTL=#9)+R*CewgHh?6_
zS?oexE%UW$@m}ot-h_NVac+)CdaG?#0XAntOFJ7#HSb24CzoBbng#B{9elx}xtH*o
zEwKL)@n%B17;VdlCrcUX7x*PuyYL{xK>^|52Wj$<Iai#+Hgh8`yo|FQJbYq`y7PI`
zN(7`j38`g>Zb|2@IVeOl@m%Qk)7Jd0*1NTMq!(D4#Tb)TSme(|=XtN#KC0EiqUkqh
z;rzj7VbQ6cbzW6?$Vpmujv{xTc@w2mz%QuIw+P8oj9j$SE{Aude&P!cOZ;Di_EVVl
zZ5Xy?LHI)v{)0@w?@#v&<|mcx<CFCDsQ#0C^N=*Z{_r$^JC9yPsJ5?x>65#Z6(lm7
zzcD-*4H{Z{{iSQGSss$67$C<|OJ8)U3pBNC%uDi%t=|VGr7yrf|9GTymw8I3uKDxy
zXL1|LNutUXtHo4@p@;DwfQ853T6{+uBh<nlB_(Qi-qw%y;b*gjEwxVC<_P#UAz-|z
zv^vM}$JV9ICR4QR)RkcR@M!nCk$f=6qo*2kwZZj^76*8hFhi#lrSr+%q}ec5)bR(M
zz-1p0Rtw`EKHj-Yw^pURlWs%_r6?-)+3<&roog=i2cpXjIz(aUkn$vsyqG>}H!sh{
zmexcQiuVJ|;O%^}{*?2}eMnoFQB*xjDH#J?J<2HAfu(tV4k$%~b^KHvefa*}s+a!B
zG@6N>JJgPBT;iW|>~Vj>HL$D$nqvKB5KYUh3+9R`Hi}{{ax1Ig|GubOoQCQ=4XSek
zs;>$S;)oQ77>elG?}(u|Oy?0yUmZVqkzX;c@R+!%;{U!LZftnY6+HKc!;(5?-LMyU
zUH8;)V-neb++_%uv|Whal6c8pIK>o?oW;>qNh$Me96!g<i4_cc=DkgM4`36ywVUT0
z|Gx_-ytu#f-@h%)|Gc%eUXA<zRVo{g{(oQNlj;8#cmE4*|35bf#=iY1oc4!aSGfc>
z2YAUkYhGR`ayxx@=uX}K4swkPm-Fl@S3UA3kOc(Nofu$}gb-?C)={QvxBrrp4PSXO
z=e;+^dx4`)RJpPd+nu5ZQkNY+=x~o|L588Zu<2@5Cv@?8)uc{zJPi)raXyq6?G^P<
zcXIO&RNmIxZ#(;q!^UYN#a5;q98@?vmM*s&rxgFp_mdNjs*J&^_?dpz_-9R&%fHA(
z#cjN2v|8GbI4uK8u<4Me0aGtKp~Yn0!USM|P=S&)A5dR_T|J%tK;*{PP7V)k16QCN
zfAnKf;Q8o}@UKJHxSbuHVg^HM;?$Ru3-1VsqQ16(r$0g&XO==1jAVfO+=Ip8e=jyM
zoQ1xBCu$U4r60T!)oOCK<{4`en^k=__20Q8KQPTX4{4~O24$QqQ9wrr?U?B(`Bl<<
zW07kV_pVzqBK?`Zc9Z0K)H;&HO2K;)7$a~vf-4@&r+h*+co>amyeH?pr{kwPviE<c
zb^qf_(=9Ekc0IS+k6G26xz#igCu&<EZ?HJ=21OD2Bc$g5Pz#GJ-y93fDq6bo14ZzT
z82bK%ype&hg+F#Nfxg2Rj1+VT?ie$>hqIx~TSctai2PObyo-4ytl%oF6Pt9kmdPed
zLtQdOgw8h*=aw?Gzp!LGhVO0s>S`Fk_8)%$RD3h5ovjB##EX9&L{RbVtahG15JG{S
zKVtNj7^UJbvf8Ou?lCpyR4kwAW9s_?)Xy6!y2LVl0OQ?5cT~wCjSL2Ax+#F#_7sxb
zbXPQvTBq%^<8<540^nkrYwP4)`weW<t)n++#562UmPm&mOJI<GZU#h+qtn#nQ%f9k
z@t6yL(1Q|%{?v04kwal`PGB`)CsKzk-Bvt#lBy`Dg@lqq3mY$Vq=ZX4Y+iz<vjRTt
zv={Tv?Xs3Zx|Q*(#bwUX|LMYIe~d<x^T3~t`*$@4EQtTxs%&h>^8Z#hHy`hR{VJd3
zQuxY3ogZ7rjiXMxb#}7X5ZjeXc5+|KEZ}8Y3ZiF|=>;s=zWtB{V>Boz2+od(sazKX
z-!=i?WYFLQ@AXibicvXH_k|02FS~es*xLJ{yx(|z_D1QLZ{6Y0e~ks1tKOGGO7IMx
z7(MA3`qk>_#!I-8zHz4nire2CdhU379C(-VxWiB=m);P#kAkuvobrYC_rj5E<7;5a
zXw5>3Snc)};O#98Way^r;2o>vJJ-Q1&^W9H>=NDH5;#tz^va#Mf1jcLhs4?k^yD<o
z<qXn^sK8S}LbW*oCcfnyknxIKW(~}v-IoX<74`DA3FwVtK5aCo<AG9d=^C0yF3>82
z>reoCf*Zb&g%gA8+jHD&w>O)*Y(LTzG;spDL(3n~^Av)L2DVCr+IPFN^Uf)C_s;Rg
z(oYzOK#f2q%mM~|&OUxi(FPX(xgvc5qj+NwWgWD=*h$X{RJxid?T&Fr?BJYsrU6b@
zdd=D|k!+KwlWxP$BEdE^IE{!fF<aQ5wgPeDDC`OisbVU#olnE^^b!Oc!~+j_O;ll%
zHQ$c;b)MgUNAEG~YL)k6E;@F`emHd9N&d-HnKljn6}K%}NnMfc$ih@GKoP9)V0f~Y
zs#)P|Ow`B~phz)xD#9N9UzpNcXRl!kjT1bFX-O{nN22%#B+NfGUEZ4TfQFEh3+Ehf
zgIpes1vLLLy{|6YD_IQPG2K|8?zB`*O#P`dl$84aXYb#7<4CgwQLL(a@9o*zdj@0R
zJRI1D{Z)!Bk*Z88GkKF#C3RC|O3EpU<S<F8G-{qak(rTX6f+~TBQiy?)EpeY7&vbR
z>=)ZF^BeqT*bhD97sG&o^A9}m5AcIu3~U3ly)NG^Zh7HN>MBN8i)6%iUEliFx7PaB
z1#M~&^r)?`ew1l}0hro7^8%}#5Ac~lcJa-cJPJ3xs2%t|<!YG7iKKQ*hRbJjE08Do
zsT2CJ!wbcNtS8!B@pl7CimAH&#*!Ijx;2_4lNS3-|DNFA>_^X-nFaQM{wS3MbwNzP
z_hhT{O!U28&x1`6_??I@$$YxMKBE+sNO2rO*`P1{QNQJei<+tPq8KTXJrzY1Fuq_q
z>bB$4bv-sj5g?D9!2pnoT<;97U|UBdJYyD4hrh@M7c=>0fXp?7OkP@;>J}!0;w4|o
z!RMGcWE(bC4vY7wv8=eYGb^)VQEO?j6Pm2)233VY$;sTzu%t}ZM1tO#nJ<5C?QiTZ
zDQp$fl0`9t<t?fyn<%HRTu$ABmne?4Gm-us6Zan$#c^=zqW@?F(xl7LL|HtA?bPcj
z@<~L9k`EJ&Tfko($r;cd42haz{`LN-eT=>0M(PAQH7>WKxO%zgJi0OcX~gknA{Yzp
zLEK9qP-oKPhC4K*O~;P`!k9z*EO=}~^Ft2miZB@sU<yXGqZKIPH_RZ9;~6-SA{fB?
z1U++>@NQ>GT)dJHOx6Ts9C3!AScNCL8BI%&7y;38y8uR7g}|^<hPv{SX`sY;pxo1(
z>F$FiiL#Oh!k{B<>rDmU$g&AO$fgz#AM(^Hco&XW0h~}6`BXkpiBAP^nwG0$TCP~c
zMr|SvqX(y`*C~=AX{HcVBxXuRqRn<2SZ@U(OT6Zko?+9MaMy1*{(ZEZfTLcnp4s|#
zTbYsdtpg7AynE{#KVXL0U)Wi9hcFpq5X+uAfy;z|<w2ttWekZVZYN(;q*kaWa0m{i
z)TW4psiSl|*q2Cld#K(Xs<(&g?V<V$IaJG6bEuYo4Tq|wKC%zg*cn<CAG6O<KC)s*
zY3dv$dp!GCgI`AxBO)G|up@gzZ-CJpVY?7E&Y;|&lN%bHRyVLfgXCS$wuoAj5f?UX
z1=@9;j@3(?j$iIE_+^|o<y*>1l(l+k$~u__W-FV&cp^9kEBVi+TmU=ZE0az7SG?b^
zzpm{Z>>p}!DbZ#WhFDKlhb`juU>rRlMQ(>Q`Js?ig(RhmXuq!B0fqe84TB;w@se*6
z-I33%k+M)%L2Hcx^Ysv`m;p^B0Y$4J?;$xM#Q5x;Nj3R&SI?7B!FEhh+FZ*rFLUIQ
zW=t{mq{cXg6G}0S<mELoh%G+9m<%|yM`68BOr%15a`0-Zxu!Ea;Z!<8UI1GJ_|iwr
z1!XO9rE*O?^_FZozO~5-DhASvcH{Wu=%IG3(?dFPrq(NM2FSb-mtGWaUFlu`8&~gB
zU_n~}^FzcOA*~O{U*74d=_KV2D%A11bRG;nyvnD;LcM_lspDcu(Nj2OTEPc*QMSM+
zmO`&_2Wtkoh#RIU%JU5P>ECCR7EjneS^jGTyzx|5)6jaONx#%Kk$fs2kqWLVoT$eX
z%R6xt7Ljt6jZ==HeR_XiDgB$#a3s%CGO;edhe<w}BH)aM)Lw0?w%(|T_k>A@3@$oN
zqAY%af{%wVqPA;1pSqsQ@xspx&}1WD0)I<xPgk>-w}S*g65BWHc*3@34(z0AS@*$i
zm^|smA0mk+^7xKiJj>1ZHvzS-$6j~RcFE=`bnp_IeQxLyjSH8~b(G;~OkFQ_P>i>(
zT61n4Z^#*2j){2dX6DfHWYn7-An88*fGuk>p_ij*zL{YPIZlaPy4eh{aUd}M?<PR!
zMNP$Fm~myFWH-8`QdB9}KJV$1;wpx8n<ePi_KdOr?*`$?P5A$>RIAG=|NqL`t^NN^
zJX6{KBkL>6^__MYM5KlWkpQ`m5nb{i4~(5-cP2o)rGt)b+v#*{+qT^?I<{@www))o
zZQD+su#-%md1t=OoOOOe)mpWx?%I1_yK4JKE(d!_lD|irmREyseM{Yr!YLOc{cXGl
z$3wTp+V}&SdlT`=x{_d*mLYqU&lQk+Iv}hdT{`9VEazh$4>4e%h`v*bnZVCvvq^pr
zAm;(jUKeRXbJDJDUS8tlIRTF+I$LkKX+-5U<fg?}Y1R=8FHx)G^{!e8F-gQj4Bw{P
zhG%}U#2F2RZD&|Q&_(@|W)Nq?GK<^J37gfSnbn(&QPWYp74lU1-uSe4-3wuC&D){A
zd)@~B>gML^da&7KrJQj;B-=15;{iq;d8SXLEn(h*5n32tn52$8`5)9pb*%k&NQO9n
zNi8MBYKXV2lBTJNIx6BL`v#^M;e%p2|Mt|&Tj##_s|!J$c`|d7zwuK*>8AO;UBCuB
zJ{X{+DoeO_6=9~C-(oBZqp3D7<##zXh^xCTe5zWX9))#$>ZWWC&Hi8594nlQaG08X
z=^~(|_%yEf0693G<{y3}HA6}=qE@eu^jghhZ{-NL2s&zGC#``$Vze3PsR|fy$!3lR
zKu->)D009T_*2v?!>Z_^erTi1I|7C^YeN%dnDR`lSC-3{w`FBG9SEM>k6Nc%(gW^e
z2D5<QUpgPW-6U^u?;1L4F@jA*9Gs9_rj>qwKh@X%hVYsk3C!L?zMd>F@43I#DeLQK
zNl*A$r)<93b39C?ey2c?=9Fy|;=j(|!$16iG>&k<6voQ9pqs_3ZrM3!U7J!A`<^w#
zGwsL1h9vi$z=)+j{)t?s>>@lIBs!f?i_6hs=mlqG*NMUbi5Q+gngrQ{0>H+817-H_
zE1Biomq!*FK9|rS;^v#ZH^2UUG@(DDmUw<@O0FMC321I-1<uKDHCgO6JCWRN@jd*N
ztK%!4SsK$m#yJh#-WxNkI`+kPFZj3Pj&DZ8nY$4Pb{8Jtom|`NX47i9ip1GCWeW4&
z^o$6mh!3v!s*8UMpw0->(#kgR+G+MiD;~e!Z@=7{Rta+#X26)vjF;m?(g1FLjW@Iu
z_R(dep@42`3Ed-VpXONfU~ZPT@OC$aa)H!3^&DZJ48VLevnykNI94+?;aqr!zc&|C
z4>2t}U6_)UQDuJcx_&7>7&aCnLedbpZe%k_5)B2K%$?yclEJ>O^Tm%HAG|K{+2u<L
ziOS6od1zbH9S(ePrQwz?D8m+YVexFwcUA>b*;>n3y4A~)>k8vV?BUV`{uy_Et<$Yn
zF2XTbgAqEO2Ca#sE}CR%IpJL8RThX3=qp)lKOXk4HGY|}OIbOS!CWEZtNHe&Fwbfx
zVe>2ek>9Rk3Q$RedtIhqBM6SNvGXt<Mvaxx3J%`6vAv<z*=SCa!a??q^M-|xP|IU_
z&fgQ<#g^?b@4<VS(wimnxo3?N*y}O;;~TUOHcGjQFGU}46?U7eyS6+<I=AltAaf^y
zo?ly0v>ii@Mb?(>=*9B|hR-S{S$+NzO46^yyN+hHh1}+|e+Vd0;m?$c=g#IzgtG8)
z48@Z<z-MA*D-OU;N3YGk)q3_~1F&8zp}ty_b=_&=@`+>PK63U=-5@{v_6ARurY8==
zDfHc@t1q?Yr#fjZ)Amfn@xYtB<KJ~Qa2@A~DBk7xW9-JFX%n1Q@`Ml;ZA?b76g0kE
z8NF;&|Kl}w3e{h{-e#{F)kkRlW7NVg-22Y>gFl1UK<{ddoh^$xwUwZM#k-MUToN$=
zr(`JTS2{Vfr4FNq_agyjNxb@Vnr&C;cQN_-^6^PL8KulQXW0Pw?k8t(O#1eT{3R8#
z>hG!!Ieb8DVn5dtzu1OE9{0nIs33qZt$RCLUZQjWd-oW;XF=L8A(f>=L>UN9sHBV;
z*U`%dt$J3I{{(N2^4J>S#)yJ;sJ~F(_rt&OqvpdDm&Hz0teX)emPv&X4m@Wv0potS
zLIIK=39{gW#O@WL9Pxlqt;0=WZ+3xY#`wN_8;8G<xenk-!*dvUf;LIic-Ro1{2QJ3
zIL``M!2vmfK|Srnd!U~J${M4jlIx&AYrvh$`d9BKyVrH`aiwUzgAAv`@<vg8IXebs
zaPKs!uXzoIcRdwt8MM9a>tPc5a(U_76aje}of^$tLSO63_cj2_t7Svo=Ob+R-L<H7
z^jyciq<B>Vx2bLklsr@-0-i#W^B-psqU#n-=xR|Ty5j~P1&8E4VMRgyR>~M7ofI@u
z884HfVJ*FT<NYM>k$LT(k<)oX&?4OtV#JA1r9U`l1gXU>IiT^`)9qVNU(>-!y~{bQ
z)5wO_!;!Jgtlo}0Eu#W#Qf82%XtN2CD0@3uNugXlwPS)JXRczKs*quuF@c0Q<?y1>
z!h`w(ahr@o)*Upa;K%47af746XmvK9dwB#N->v&(2M(h({-i~Y?jC7#ZkfPgtP=`V
z29MSN@nLjOXk?eX<!|MnDL&Bt)gnIUxMmK;6*<+`1q@H(z#NmR;}%d?`>lG2qk=q?
zQ0_%JdhwT5t4+}-=CSS6OTV{fJIJ~Y9c?$gW;<Swc8lDHEdml>hNYhL3AW^4y(ZrB
zWhts<%WgwK^^3;ME}!hs60K>Jy;8&G;UOZw!}og0qI!S33Lt`C>F#a|*1>f&O5w*Q
zg;O}GRxT>jr0NgD)0nWv9BGck^BxsluS*lpNyU$=xoRVv24%t6>f?E=$tC~BhE<Vr
znkqxf#g1hW&o`2M#wE9`NhXg^o9);i#)RLB#LTnrS414De}{F{iq}T!^vb^EhM}W6
zGh5J}h;?of%!W_b-o>lE?MfdN!eU;#5^g{S!iwR4V1UG|y~86P!Le8JSjfR%j6Yj#
z+aZrsLmPvf0{Wx*SuoB*yBxZ;Rz|LV4NPAlxb78kpG`<)y{+rhVx-AKxbWTwsi?D~
zC<N33>0~|71B^ry_WjRA#Zs1hydyXW&}zApD{VV3V>9eYLCWp*P+qYiidMn>A&J+d
zA&7&J774&dYm0s-1|q8Cs0&v-H42++U-W!sSj|gMrqnO>p}n(FSo#fOoMH{VG%%qh
zJ#@ByTbVb(G}$e=wNf4FNSj$HSiH6aB;h~mVPr+3td10@T<qIh#HPGr{81H>%uxz8
z3JrtrS(G6XdUPNHGTB5*|2Z>5ZFGjE@IF|@v`{HB>6J3017!oN56Cu-BNDrS9ZPR+
zmQue3ro$gxpm5KTHzhf1?9uK*4|nSA9m>yFH1}QK;MiIc{y;_%-eaX=0e?)(H1z#+
zD56<0A%k?xX4xt}Ql&Et#@|{<BRa0p`>H#`ar$0$B&{RR`v>)W{pd}ZaOD2}PzJJp
zZ^rOqGsMiE$NmI5(;`#no{5?)vE_w}*PPMec7BRwXm>fM#MwBJVP}Wz%-<_cf!C@1
z(ol~o+<)Td6fqURjok%$?ieD6-xBzph1|@hi@cTJy7SG$Fp_J0<FGgFT*6pEE)Gao
zI4vs`l}dp+tsX?vjENd|F-B{^XDe=&aQvEe8(`^ryE^=&3{^%DewPXuAS71oqOTks
z<6Q}8K-j8Ru#3jNIS&fMPo7u-yCyChu2}gS8<s*^x#Sk6aMUhpWrNbF?5KG3AtSvU
zFHEG=gzf^*PZQr@Vws?Wh7T5F_osjWU=l4)h==jCal@r=ARa!A3+rqNDuyr|Ym<T<
zgByas6e3<kChVk=lP}l6OVHwoWTeEYu1n;hG<z-v`QB`W-!LsJI%~fPEGNahV|t>C
zj=bMSn$pn*v&VM0Q?en0Hj>~pAESyh1(6D58)3iclfXiO7@0%z_b|K@1R}yC{y`>B
z%Abu754^cUSLzd{^)~gcXI}y$9}5rB<Td<^Jc6f=zOC{UVRhBN>ebt=f_e3Evp<#d
zX=<g(?G1`!YiMZtu&eueSnhFeX=;Iiuh!h%32xi`@B*Gfeem2B*6;XdLToVI+4_9s
zlz+AZG^|;NW^&7WceX1<yyp6M-k*KDSEwW3pGQ{u&3rz7|MR<niQ+Y=`RVP38GrDI
zU18zLtfKQU3|(&QjQo6c`t<Or>iLfC^j6y49l6mL^t&{6^Re&kaj0+Up>jofc6GyD
z!ks~CPl%}jzF%&fkVb>PW3+IzT>H$sxAe56q~FYJUT+Y}6SJ?LF0H8he7>p20D{)-
zR$i>|J~)3pZbE{f1Q~$ruh-Zv-KTBDv8B(y?*K?yWlXKi0ZJcjP>P5>QPaTHO9rFZ
zN3?wKpUn>S8iQ-NAV@Z44tHG*2D<`lbrESiJXt@U#cglpeExNl$=h7BLjNJ=#Vknr
zbh#qb0WI%0fBk$DDvG@$%eTJ;$8)O(C^#-u<+Op2`1f;1=Ki?MvCU)wu{OUYXpQR2
zFQJZXs}r0HH~`vm@yT9+>{)<-a6Dfp&i(9j+Rdz9tL@&Z?5(!7|7W;IWPkcM)&06V
zSjN*VoyqCd3(H0N^WJR1$o{oFa7_BEro0#VGRyvg)15xL22`5$0@Y{F_R#P!C72&-
z0l=aszNl3gx0f<9v<P=--H#bVnOZEQJfUpd6t*7@Kdd#So<MV7hp->FhYVi1g2jtn
z>~L+uu~5+PvY+i6bGxuEBh+|WT#heSXK^*fVkeVaSrpfQtI2qoSMsYzOMia=Jyy_#
zS;1$m0lcCUb8o_OG*M_Hcgq!`;9YDINwoEc{pM#s?-IQ-ltSLb7-Z6Fcs_+VKk6gR
zszvY0n!%Rfdtv2a@+p>c4`>VY)4S8p<PkkT3OMq6vLcvFG?<dCmKx!PxzO*I*}K0p
zjJ9z`bJ)#F{KrBC>Bq6=?^~OE7F`4SN^w>1znHbB@NQFJq2X~w{%|WeZEOaboc%_?
zv(Z7L!JN4JRu-Ec+o}jU+Evi6w8#eyB}9l*(VTU8ow=h12?YV?EGDt;C$vtE`l~{P
zFyQ9FR~J^`q<(mbb<<m3TUH)}bD?(inVC<{ORrrPvZgztR*nwWjvs;h)@FCE+KEr+
z6pea-*!pIgO1UqXJ$KTve&N1i+pGKUBCN5szu;5o2;vUk!Is$=HKecsrKxZftOR27
z?V(hw3^PQ~TiEAD*(-Tj%}QXyWYCHZ3s1r{Rhe=<i+bEJos+WEZXUc}4lOhg6Ax1=
zTNPpWGlPJrZ%wc#=yn5F4Hn+ziZ3<l`zppdwPb)0CjIn(0pG$!{#(V=P23_|tvE8>
zaNqENRZCw~j-PLYzs^QBWK1{Gis2E<v~0OJvZHS5@0hV8cU}HG^~p+$BvT!@p?tu0
z*DVmG-eh=(HP)3scKepq<n#Gf{MB46`Jpc>2oEa)3I$2;{Cu#1Zz;e%p*>E=AV8NH
zl~OE~)@?F-4p_7ns;wetvFT<Vaka#?8BB+`5>?cs9_gggp}ap$?oXPI&$ieXsw3v;
zBzZhXD5-(f|8a@D={$&P0M`jEwQn#;Fq0?C6@w+@FKSCN$;j;XCtX}FkubIwnZsh@
z_wXaOrc(K*ru`KMb)ygoq%NG*T3_CG_B7ba`W<SAK;uEBY%bzKfV`KaO`JuC-qN7s
ztrpJ9h)5m>c;WoG>|U})l4DH`zdgFCR;pHq$k$$|{!8=~`l~wMx(_eOjOtZ&Bvl?i
z@c9L?m1D(7r^3k|JJx$i9vp0Dpy|e`B?=1iFaFbn{-d~U9%k3{J_ZeX_@b3t<3Nor
zN)8!QMLMZD3@ldDUKeKsORT_%0VGmA)W29P!ObXWWrE~-SK!%8_>%OsNt@4rRY|~N
zM24BH2rHW%$gwx;;&aN_*@$Fex?eN$E}Rs9C}7*WJC<)Jh^8#S2AnmMw-^gu8HFSe
z>%>!+fQ`{hk}@0|46pUONNXcaCZ5M=(GzDg)REt+l{BQ*kM8grc2Q`<xeAMeXaQEL
z@DSOOmSmi)8sJS6t=R(`t@-u9XzT$mPB**I6YO>qOl2r)#EqQwRSMz&hLNxQrp&3>
z1B*}X=fSB+7zD1u2yy5DqCa}#P16c8yMJv6ogF6cmgSN7lPItq{>ZnFm(!DdCCT=E
zTqW<%3b^mG59j!MGD1X>YGEC%fzjc0eWyfRZhRF}C?jQ0MDM;Fy_kasNRfP-$SZCe
zyTYiJct9HEXe?UqCHiq5^`o%{^$oKiv)QcSIF`vcbgHN(e~FW3k_PZPru+0ZoG&6=
zAVRK3kSw50nSf905Y$`gQ;cA(=Y7Ui#K~7+tlTpi>fafw!}@sm-Q;<}e>?2yV@>$u
zwop@7S9h#$E{fN$_)9=f$(n2WFexUlO#aMd%wB}lLTq;)_m?mQ73^QCLgJf+q1zo>
z_T6fZ)favC%;}KZ>JzEmo6vnX4T1OOw5pJKhE_z}I`%v))3q6`H%HW}(Jip!<#!L|
z8sM~?N(^ga;oUuH$_%C4WeTB@PE5?ZvP%PP=g__j<_X<s6OyUW?HCkOr-&{WVF;$t
z<1D&mRHN~Nj*tC4K?bfP!^(NJ%aWvl7s^KIlhj4{nBL+kYeYB8)S&M~$IdXyam46a
zrbVi9`278p?$rvhzH~YhOtkp5iA?>hPVQ>U>a4X_%vEHo1^Q=pj~yh8?-hYX590o^
z3?4+%kF4JUgSNpF?pzvWf|T<{6SuB)tpH%{_(0dRBJ%prcy8?L$iIR+P6u3;z#K=R
z>6NHC=%;x$BCv1tPn(Wm#pKpJDV|_7;t=$|4!yW=y5=JxqqK3SU$=!HQPfZEwx-$n
z;su;yFBfyF)48MW`EYfSVw!f|YSlfxQ))uCD{O*)PiLX;^X#DyQfP>KUWpMOVF&(Y
zt$v9LoPrX4Lu`D29bOTK9B)Xf#7SA68gW0Uu$o>edR{C2v<lOYGKFd^Cr4Dv!@@Ec
z*}<SE{rF?bP@vVNuYA{Wx28fh9z$kq^}_%JRI<>-1=cw`<rolO4|`>`k$7mulQ=?@
zI@H|oeHc{(OcU4iJV)dJ+jHPYG<eD`YES+#fZW|h4+oM%Y#!~+sx@G&8b%MkWLmYP
z*s4er>gZ1!Kfj%Tq>Mo#Bi*x5xQx9%22HqR{syR4aBZ8j)7HJ`*&Vjd$?9-MxjEmP
zc~+*NU-=yq%s+AkwN|c5emE0ZwG&kXPAr|oSkmEA-$T5)j?1+a&gnwhwg0pDeb)L2
z*uUbd$M)#Cgy&fiT54nIa~fg=<%_{!TvHxYe4+wNO_#sLb?0X1!E2A0z6gw^OMt`^
z#~@$#tdGJ8hp&Y^x{?7-qpQeHE9q5o>#4rqQJdrkS=xJ|Onccsc7${Ck!UT_x?x_q
zCfX!&_&x2ZHlG<U5(-#iH)XOQev3h7W`qo*S{dEHOwv_nt{pmRsn*&nIrwIvWw+Na
zHh+0`HyCU#5_GvTx>l_lH^!a6SesaX%E`5?oE5y>472lF6}h#x{re0D$d`%stYTT)
zgUgF$SJ>DUaYW9tnoB(8#4T+7G7*_F(WFEMGTE7I;uU7!7D@}#sWBO={98Wvyx2?3
z4bC^U!Rn1i_t)X&#$`^o8zlHr@S`AE+k)npZh!Jm=ILvSQhuDb<s&RqC<93J(ha-A
zkE-qp`>UUVtNiZS2&8a%46yAB#2~8VuR_06MN|GE`QC}gSSIooH1qo#UPVck389Vm
z6;nXICIuYpPKJO%aA0g6fAq$`x&uRi;2Hy5^5;QGUF8gi=%<+taaA+t+7eEMspU>g
zQUk{L3`T7%Az9KK&hIxglu$Xt8Re)i<cT-JPvV{!7d+FX0J&UGl+X`OVQdH^=dhc#
zcCcfbe0xdk6e<N-LG3c~VcywhIOWu0))9sZi;Py;2PN7-RWgc=t~FSP`&?eOL?#r?
zp|UlTB*hs+-GG&_zF|Z8^a-=;*kbQl7KID`!x`ljvBx0~xr)wo#s+W$YZz?5BeiqZ
zq$cqs0kZd(gV^7m&S<imC<3y{HRK>2d*XAW_=5|xvMt%{4^cSKChI5FvDV}2ss>58
z%EyVeF$P0x((6BIe<4O|W4j3UadQ(y&LA*gqP75?qXq~cgO5{gX(Lyrg)>Yo=6;gP
zE%-kcHjlRl;lRH+%h)lGBXAS-R!=iGWfgEVFm`x!YD~^?oXm%*8Mclu_YUzVbJlVg
z*R4v~iFv1NMKdBdA(*cRN_V#j#LdG;n)38-w8|6n%hmr21CgL28<*Etq<{8n?#f(n
zPCD*qlYJHdlji664eXaVBn1E*4@`nMwjQu@A_aJ@K?NV8^+Vi|TQ}trt~z9-2nlo*
z19a`Quv%whnn<w>&m67wBt5G4p)X{hQ-xs$;FcuT&=`f}kTskRT&bhpyIlS0BLvK4
zls6cgRvm*Xt06ALf&akf0|c!mKhC*A7T>BIDJLCJ#mPW}g;`;_Zbna>bm7|suybj?
zK|qd);WubuiPSgq7@W1o4nWz5>F%7y*o4JB+DrMQ3tB);%;a_0HLNmeuWoF5>Cn@f
zbdH=y5l=dE8?+2>qm~_F5Cs~a-zxD^jbJs^vpazFfL3%3s+as|(mHR*g_I+0(5ADe
zIy83h2S{x59ag<GcZG)Jr-`5ux;9?dI&W4pS!V`MGnv0>;AhULb^(R;AfWc)+y77#
zIaSX`E9P<q4Ue7TdJ)s_lp&h^guN(uq5uRZY&q-!0~3omYgia=F;n3v_6uLtv#42A
zTBfMK!{TNi)P5vn<lM<TW5CrspY+fP^JrzQcfV&PTF)#dao4GLZ!%UWAMZ3tmB1?a
zC9doEB~U!Pc=*fr^}V5a3bY_&!Z%tYbd@^ls)|p+jIq@*8(QBU*++6}_s?O#NfmJ9
z=l$tq>q7apfe=~o8^D`KU}=ZVU==Us+z9Q3cYMC@xFFbA*O(gRQMKLE`LhKIfZ(9l
zc-Y(O5zwh`e-^r${@u{otS)!#N5`-`;@2H<>Nx+<ICxx=^pn;XC;j0h!fQn|X3niM
zzl2~E4E45r?nC4r-5$eMHkdi&mieNP+tB#;0*>i2;akDfD^CN0%2M-?RCd<N>pBk)
zICkP)cmBu_xZTnb_E4&^SSD0w@8pS8=iozx>{WPOk4)Dqqsu|LE`hC8J1;^H)bTn!
z`88J)MH45s>)Xc3323}(&@mo0(oqg84d|DDxRnlR(*v(gP_>awZBMzB4oOaRP(Wg%
z{e-gF=;Dqt(QCTVAQo&`kYbq&_?qI`b}{HNolHB1?lP=dayIsZG&-!9^vRG+AdmV+
zQXlInA9F57?rZM7u=}pBbzN##cBp+ag;;lM-SggNJ09P{zI&LMLmZwGnG*CtggJIH
zg`NP0nM}SyyZ^eXqoRo{-x+}V38Xrt`9eh(zDpku4QH_Q7-!$dczlvB?P`q;Trpx>
z$(a|)b~tOTlH)n6E*}$~Yx1BNOO#WxI{lstMMzfEY#I$+dssI)YV*eJ>0kp6?v_UQ
zsd#vJ?jMjdVSM9BmzmTnh~i7p&~zVL3!S@~yt3CjGtnb4mWn;un_AxXU{qlTMs`Vp
zP{wWQ*v=bT+UJ>I+t=U5({JnrPf2v$>5s2hT^2JpogV+Oat}m~88V-*IKLV36J)wu
z7VjQT50YWQ%NGBL%D2eqHBj#Zm>;&Y?Fapa^?`Tmeh)R{LV9ZqviAUyQJ1j*AYt?)
z;^HQSSFA&x`bKiTzmbtximiTBRFS7deAqxSfDat&ieL47z4_ow+!WM8iYr98GSqi~
zpc#yUXU?N+92Ym}tQ;mqoE&f#8O%BicW1FJNZh*YV#vZ#)$I{aaK>N}^;>lNz#b84
zjfw{SMQwAv98&x-({5?o$>(-<G9^1>eD+3LhjqK&RiHM(WwIz4QYPb33MxI+ERkNr
zHO5zx01+ybEbWM%qYM+K6yp(&D+1xgFT?fN;0D&(!n&AjDnIZu9VHIjY)E83f=^$P
zj>OqNqls#&h1<2Zd7NU6o=xq(rd-#vlNC4jx(IICmCL+wOpl7}U~e$FBGK7O=E>aS
zn;3}+&UC_LN@by5Qo7mZ7~A<Yi3n3VB_zbUD|w<<B~q#_i6QN-V-6xIMad2FL!URD
z8WWz`&@`;(Y8V!iTP^{11{>_HkMFtjq`gsV9VRv6pD8w4>y0r8G-Z_{qIh$Nz;V|D
z%g1ur0@hC%k2!9>J-*QypRNqwK^lq0axB%*fNtx_!s&@WX(U_OQJ1Lsv?Y{!#^Llr
zbL3CISc25-ap<eh7S93jB<g*I-{$K&N8I)j;<vDTLI4daaN6<Hckji~LQlQ9pg7;$
z{z%I0J5T5F{Wq`4(>H<nS^nE*2}_^c+;<&aT`lEfZ%s;7+xvHx``pEYW|=$MwGy^+
zJS%gdv*?lpxGX%!ej(A`T%_TVFMeRT6lTp8BS&D2ctodSj_c98-Px0=BUcJ6x@a=e
z-TRnYho>V0=7N<|<+mV7$$Z+O!Pyj{!_1*VL=&Op6jWIncVWxIAMAxwr-Bg+=jZHM
zP2id=Dy3}ZHH6mrRtbBC!N!F+u8gmpGs9R1Q;h_W08s!@jI|{N1e>R+dM4dazl)_i
z6Nx)r-F4?L!D-Q|S9d-i!@8cD<Tyx<(RoH_ShwV>P@LYcII(da5&0_HngsnqYBCsJ
zdL?nQ3x}loMw8KY?xYw3JT{iG1CWMlFz5NqCE>3#0GH)R3CTNkDuPes{ivy*^$!mT
zYB;)vf=bLpwtTLd2A<hX#&l@LpT9XPN2%wGM%s)R`3pGx7?Th@36f@XX_i+$&(Mp?
z5WoWxFd13$Ul*Yf)|j>pH}93AEtE=yk;!@*$a00fAQ^;St4pt-nK=S)bM-B#6j>D4
zH{e#Fdsy;V+?-<n3|vZHpM|LAdmyUGBQKa9#GZC>x{AEuO+nLBohd>}u)Dc=DiM<>
zK)Q#@Z^k5lF`mJ8BqCWZk9iY*3Jmgx(hj`-DO(FgG;hXUB*iuFZSL_2{E{P^>y{Ps
zTDgWA90H?|Ohu}JOJ1)^!abOH&to*{_(jiVVBN>g7sAXgHQ+Qcr@}#HKVoAAMe)jT
z3iFk*E<f_;R@U87{(Va1mk#NuPKsAzC{=f+t8cn{o$>D<G)u=RkZ&)+_t{8`)8roC
zp*mJmpIPcON5km~*~sI7QusjAIfu^0jL>@Lbn!7&*n-!JL|S{!u23HDp!~!5PFR$N
zuXby}Xwhu8NU57Ow4uf7Unm1isKIISafbF$CDv=0CYVGXg1~idwx>`<m6jYRkiS^#
z@M}w_+duqDG+murf;lt}Jz?MhktvN=U?arUT5V}7opSmW8FOx4OP5NCqHxHIdLEbB
zVm@qnI_zdbDXGK{4nO0P9|EUh4Re(I{zMsR1RCLhOg7#MMkpc}34}9Pu+Qhrv=5d7
z)N?`M-yM}K%nx&H;hE)Otkbd(Xo^%$r4t^w5m(5SxiwsPm8@$bYSc!XOOKDo&#u?Z
z{^0BFS!SECryO<jYuK!xQjBA~gnP*wIE4$Ca}vwW2PItu++s7+D_2hoJ87m1iap9(
zR0kCMzUPEKUM|>8A|ltF1+&D4H<z*mb-x4lteq8AWzxLjyv2HWZ{qznasD8}h594(
z=}kn=d$;s-!}zVZaXyHXnRFmS7yt$j^U-jOm(mz=wOLK?gYd+$vFZ3jKHUH<Czl&v
zRXNj?vW=jhnID70^^2t2OsbLRiD+W+#+zby_EpfdP}j4sZNLmw_7(HLS>vhMwI!Si
zRq;z5<Oz5!-_vGIK?MNX`u-%whUXm1=ZciUe--KS`>4frd7Q!NHA(6Bsjm~_j_5?=
zD6vOo62v76Ug!_Yr-3lciO+xTZnHvR9}t+(1A6O>;d=uChfFWML5$d(5+F~L`XF(=
z-!<whD=Ud#2FEESn;*Mb?x-)l_$p;ZCUA$p0tUc&U&csvJxwC*A%+VPJKfKJ#+Z{D
zuJeXnP<T+sB@X?H4`saq1B7`;{3&GV^@0EE&KTKF0DAy)ZAk6&O1H6)m0a`(6)ueZ
zaBMeSp2qc(>9>7UcCB?=u-o+Oi;hOgV(`6(PxK*;PU%K$bsTbj-@L0=B~zrJv*4~y
z{~h)%d+2^fwCf;XnEZC0%jf9T6EX8%5CfK3^nOZKmen88<-nakOiZOg1Qd++CMk1#
zEk3@9zi}GD5L@{6%$@oqK(0FVXWV~unt#=4_P(o^9zjCHJ#HY+1s_d+LJ!K3=<3f5
z3m5Xg;j^@Efj`*L`m3qY!wA{-!S70HP>hg-O@mKzd%^>i)?Cl!CLeR+6KS46txPiz
z3t_(C#YJo&kkvlGizI)%o`?F_hc~nsBJjIgBnrA|m?k4XdG^y3Meg3ef+7C|rFs;N
zl_?&<+}}>cSLHbqw9H3!$K_mD>9;H}^3@57ew@PSU;`EF3SV>-<Z&GhE`Bc0Uv-@o
zGS!{J`;SZmQM!TCvRyr2t~4g3XTiEqF2c49vvE|mU!LLx9VIOE&X|~o=PA#?JXfYR
zn0g&?_GSyng&#g{l%tA{Jb?#ix3`4h?IYbnTM`H1sl3frBK=LQgu9X~3BsS42OeEO
z1Rr4r>Yncj1qsDjeh}c1zER1;D~4Vl4@+dJz7g6<Sg0G$dCcM}mXHmKx#Op1A3ib@
z_1Sjm#Rl4Ydvo1YVZXvY{OESqK*{dvx_iBB(6fP6=i16HM2Jir*tdE8+5P?)<P$F>
zYSazN2G?w|xB33eqx9k6R<~jip2Mf)*9}k$d(IE)23~)9)+nL>`%J3|ntp$tEc9om
zzL-}3WE=a+GWIJA|1>r^&on*_ao5}21Yxr9`yZ+_ntA^Zl|~HI&v<d$1E9A#2s3o@
zp1rYAStqbt>EOn=IsLA0YeH1^+jkR$xNw#UId^+QoWQT*Q!@ys=C=E%aFb}MU~$#w
zCO9?J?(oU`B`}R~^bKY%0Aqu5t*StVr4M}55}()pYV`%_+4|skW`;7LTWQlvWw)HI
z2Tg|u0StevTkOo#j{q>L4q|nO<Ll=;S5Ed9`fT%~kA*P4s{_RP3zPT<qozbfhGBP;
zoD-zs^;P$vD++cqy4d|Q##oGESI@7qw%)eby*_M2ybo8YGmO0sdpUKRReif<gOyee
zt5+8&JWn0_B~17G3j{iq)0y2`ky$8CA8l4_yl<<0$Anb%C4+F_G=~d5FV@Hk2nDW7
z1pi&DL;bz9utA2S-bBLIYXZ{i5`~1Lsk|{1+i)V;FD!z+I)79kYOS6&o^iC&h!x+)
zVUwz|&oQ}$YU-Mg>08O~M{e>G!<kuO6um$=R*Mq*LdrP;p(viMvln9;otR-%WYA#k
z+T=+wJb2gqwRGl5-0CH2OEU;E8^tJ%<5aJZeHcq!pq%~%CEdxQOb|tr*RpRap}lMu
zOA!}-UYQF%m_7LG_Dr-zG^0c;3P$V3yAh}iHcOrlr+6G#Sr|ND$n1|9kfK=bjX9Oh
zca*Z=qNq7Pr6PKfOt2eBqc9PZL_t9h8$vLxop{K!Kk;UwZL@3O=`X1RhxhE%Z>(<U
ze1jxi)uy7Uc`GKZ`S%?|0jA}aGtR3Y-PGPH$O?^zyQctvz70EmP=oQYvAjK-{*%F8
zXq1st0v!$!U9!O93Lcb~&HF0Y_k=mQkEFY1DC9cmk8~lBJr?piP(N=3<rG#gh(6iQ
z!m)f*$Mppmq34QE$gx{ywy`cB%pp58Phvy+RtwKKtR6B{Y0A5TLoyW6iw#G?kvoY`
z%=p1k?#f@Iv4V$o^1-3^WU0#iWLGoFMH{diR1scd=dUnj!NzhC{hH|=p4OQc74wB*
z@-|)PKjtOX7VA0Kj8mI4yi#cWXmnH?i{(r|xKA!by3I-!{_?#_c8SmDvpo`Ks}h$u
z68a5mQtx9NhKii?-$$e0yG*RlatKRzWH9{ppdR-ha$w>`XjW&8vgAU@0p+GPD|MaN
zrByD|m^e@_Emxnea!sjv*!XxAtH(e~=gg84yFte)M-qt>C5i!pqB6xeIYWkN@0t>2
zAqPYRFu-2h-x(|%rBYj5FHP+tm<(Sf8OOc<OkYwX-NhPQ`a-R@r!=A}gc$nj=};#(
z=)_KB_zsNkx@mJNewsXdhH%h`V`yyB8$+v?<S=_B42a@l*^0CC`VnF-W+D4d60<&%
zV|p*BatIG;j@-H1ZUpCQA}}rZg?d$T0C>YKvX^Bnl~lw~S1T<dKC(hw6f0xt8`GMR
ziR&&-7F3ZXadr18Kr4usWSJUSaPXF5F~%`lV70lwg~RRUwi=D&rzG$ZDw1F~C;i9$
zI)KCdaL#&@*&elkX12T<)6w0Ge?(XxS@S~yb~xX~)lshdrD#kpr<neYo7lLh`COIb
zP3vll@%U<D*V1#5>zbK}JMucn9aq%#u1cX!9mJaLo0veP<1wrKE4L8t;o8b}j$qQ6
zxJ84b(KHhe;;I#J&`F>l9R%z{=<ZYYA7MRvLz!*Yri1{5E6{*V5BckK)hDUot{3}F
zv))XZsXfv=bX~EwoNR~(Hl?qzOC3!G%WTEWQTvQeiUoT}+}usf-*9Jt)AfF>E6o77
zorAvVBW=k1*DoB=>@Pq31sK<s5-H;uy$aov#59lHz*`O&rM9h<#x9$n;9k%lbWPvS
zz`Sa9>ehKIY*IK&FKHNtK=>dwBnA!tM7?kXz1ZY4v);3ri@ie9rHWCbY_f$$>7vgf
zttI$T>Lf7>nT&D`QQkXnDv<#pDvKKp?Mkpsmla}3FW%A0aaN!?Tgcmj?f8EG-5uWY
zG{Xt!rdg(5+U4N<A=k2m{S+mGXdI~O{_$5km+3*^#QnyT?`6S9HvYRx=I5l;o8S4$
z_oZ1bj~hhz_Z4*GVmr%#Q^Pv4LT+To+u7RiUfyWo66VW!6t!64`<2n?=iMBXnbP04
z*#TQ3DEDb+KT!G3+7Buw0S*QoEowXN{fbkDt+$Vns+`mB(vEv$>(AdJf4?fIyF<Pi
zn=LAWBpOyROKORd?{;YK#Ll6=crKdr0Y;~mANM9o8x@t}t?Y6?>nU>xqhWpHF^kAd
zou>7Xv!fy1;)6av0LGJ#5`Q`qN2OWqSg~+Kov-@nI}hIp>b#)#I<7kjFoI3a#I{-H
ze{>=g{^LJ*FAU{_GIAro{BRZqHwnv7_N&lF&p|ns7qDt8C{a$kNP#qBblw~!Mz3K3
zWpNSj-X{%vh^ogpvj68#7DNA2&$qJdJ}9P%BG5qINJoUC13X38^OEjv#pN$mvwJY|
zH~5kqJ~*Gv$MT(~;ho-<<R6fq>^g(ok9eB|zYkGh1CF?-UugI+SY`Fb8e!BRYFl_<
zzV`K$7!+Q4qeJ?`oTx0hdOxN)V5!?@&)=>6bs=>MWY?31%{=SBZuTPV;;0KC3Xcnx
zKg)f5#Cbo_sgsJc3f*@VIi*GnH=$~Td~iC_-UTVGT@33DNYUN$X=(bri2%{<c7poy
z00S)PGpz;5ET?jKJD%R2o*2}9E9xLeA1lCx>qC&-V}3h(ZI`w^S+x8)ow>ynfK(W|
z#oRP@xF`9G6>=TMBu2#E*3dvK?V<<bc~XkC$KfR+RB>bH10FH5^-_o)-XUO!gaW){
z>MLz!$9e@%Rctw)tLOUA=$nIJxp$p)`OD*W1|`dUC1NgxP5$KzrY8^*i)FW-8EroG
zreNU?aq%5->i65@m&aFHn*F2S&RA02y5FndUx2u+pF`bq=7W9vm1|9o2NMSdcS2<T
zw9??_(F6>Gsnm0a^PcK}C?i-y1Oi(@rX$L5X|WXB5<<m%tQ9fp<8SASYP$M3oXEcL
zWI1ZLVWUE38%GuwPS*h7Jfk}T8R9kA8j@gDoc^Fg2RvCqgg}`I$8V^>O!k$GtI3OQ
z5z9hHXNhmbJ}8+{2P8RYRV^x+l0;MrDr+%SYn)n(#dUrscM2}`pHmB1mb)zK8KkfR
zPOq8LyqpOH2;=3|#_?D$H@|6{7COOhOi^4RoQv6^e*<K<smk(TV}AMcXSY1z(DqI(
z%UR*svB4T#v7G#kYwBK2`}XSSQkEL=)6(nc{_agUt=wwOfp#h`SZ&Qg?K*_G*Z9{j
zfAMaZHFll_!Nh=O-lY})#!Dnxr2dFrEXg7370%~Pt>5{;${1RAWS!iI%}8%tQDh97
zshZk?H0<k6nf;t6PMCwmaH+ErBhK9aXJQzJR;NeTGamTMdC<jE^IaA`2W?eCC^xXn
zA9-~CbzLqNta~oXe})e+W41466s0&Qc{HVCqb#zY4bs(%K0AW=g7#khPFx}IhRbg|
zKkh)ND#zdGzzaVUOEd3i*nA?Udb!mQATM)#5rPZg#j$Q80S9{vh?Wwb{Ns7m5*HwG
z4ODd|l6VfXE`6VHgj;k^JjSQwr0(rMFJz1^Y8g?;%cNUo9BGT?Am<RVV_tbt2soX+
zY^{;@>I*99Jy7+J=y=M&oFj#F;x;`PZg!|EC;`t?q^l!&%V2^|<zT~7)yfE0MpLw`
zel$9fCozj(ZSyz+(t8Qfjb{w=Wpa!V;tv<)Iwh0S_}@DYG2B@T*Mk_}8#|V`ObOY%
zE_mo&>PI`<Tz#*Rv&kfF9b($}I`!~~g+#1Q;Dq1vidzSdGIbZu8}<noo=Ol7>s%mo
z<1pluWnP%se&{{Et;~!d0k6}VWV!V3FG^!0u;r;r8)c`|Jp9Xv5l62cVw4ECsDpGP
z_A6Fbm<Yg<mwprfEES2oaoB4b5GB=CloO*LNm7mhHTpS>t2$h2sgax0X-TzE)P|@K
zYLxnDw!-z>?RBe=shL<d`r40ezMJ~DhHCdRp~BK*3<Psh#_>F16eEbG)H#YWazCAU
z4Ot_r^~4{NDeUqzkF7vG7@4M;EjFS@i4t=Sucbo>q<h^i>!ayVY3?V%<`1c)ZcSK1
z{CIVM=_tzFN&(UwHrpyX1~-`J9cZx2a_OtOD$u}IiBzTXl5avS_$?zk=+DN&Osd10
zV(oeL@ByOnnrbYl=ENGi-8~zNhR|B_9vva}3|Jq(af%6T^`Hv;#a*{HUhGvok7?F{
zb?|+o_X%}WCT-&Pr`dYG{9JH1;j<-R7n<xxl)o$FA6G+B{ukdduH1m@RApp_#-iBi
zMHA#)dA*D<)F85d<fb<K<z)xe#n~sUK}8hIi6u874k7gTaoj$m*t!pNb>Xnq`7X&3
z5*)y<dKSC&-)h3LKA6!JX&c^1n1q^E7C!#GEu4Ym6qEVJm?hFrU$kc~Hu-p-rF-I4
zeW#VCtb`X0x{)wJt$64!qEH7A?JQ+KgHDvCC6;%^JX$$#gZvDV-I9JhH7+?}(lk!G
zY3_pe-qD2IB;7QU-^})bQLN|5JPL%qG`tdWu^7wOhI0t59EEZw_0ozM%AGmU*BNVo
znAkPc&Qoim(`~~SM!!YXwu@$b16EYQ3k})XDRJlgw(gMOokofn{S1}`?Q8@6^k&mP
z1T5WMJ>c?T-iRtEtCpKTZ)-khV|d@51)li`2?fUieBM~Y24;F-vEB^0t_QbUj8EVg
z`&y`69_I(n+$bCHC^zHv38r*M(V;?l-Z7V1V)KvwI^PaHPAa^LM(cRyUvqD-Kfujb
zR}2^qI9LnMJ?-jL_Px6>?sLCuA9mFm+S{oS)pXsAX^TMbL~0|mbas~p1fgO)O%B0E
zaBFg?J+yaYNKePuLZx*ZVU}yBRAJV5o7+ow{h)ePH2WD?u8rkm0g#{}T_#RGoB4g*
zATek|I&u%4>_&Q7m;bDb;Seuf(bP!yr@8Eoq}ZvIa7a~)Ua=J^_uSLYfj7}tm#kcn
zlYDhagMwzAB92HVnloDii!?ilBWk#FsU8@If{hW;Pi-beJ@PxVoA?Rd10&nHMwd79
z{_c~wP6HN8c7v@~v7W?ecVEMx?prR7S??O{3Teh4Pv^iZl|!0~K|`~942mp)?}ggJ
z&Ftvn5Kpww_tR<MR3;)?=&C}<em8yxNl5<>PZNuo#8NI9EmkUwzLJm|e2*-~*+&5p
z2i{BHluf&)R<+H#`I$pLr2(1zHA*AE%&ff!&oqs&W*tpqzb7k$^yZu<HFHf!<wH_x
za!pT$j8NT=wk9UGB#q#Bj>$KkT?)_6?D8}&9d{cI-!4h#ZJk};iuz@ku<+{I-2kEp
zG*E0-C^Gapk3N}W2hrI~@KLlc`IpJgbOtBV5FeY9?j1O>``p>0Lf-hu2i`=#K?TkP
zM5N`4R{Bn|-LQQRg0>@9fSuP^#qwAp)Q?|VWL|a0!Yg5R;Tf$*f%J^u=kN~O1mEy@
zM@^4w{fEh(rMyxEO5t1jZHEsrOz$v<a$P=Ko(YX(`sgl8Nha2#{S_Yp54<P}wYPTx
zpoG9s6sPWyAz~N9(DdvpTB-gApkrgE8FJ^IW8vWD)su+&EHSBT=izwF{`sG{P{sg4
zy=-JTD6%zWU~OQe`-maU0>)+qOMX_|7=iRw-%}gCUehnLZ9obF=kK7XPsx^uUTxw=
z8Ia`#v72p`Ag$;vf%AzwuN{g6{S6}`mzl=afPl<R6|eF80)c(DB^Cw`dOzRHVR#U(
z9i83Xb?Y0W&@%B~Fp}iwqW=)5&K~>YF$6&xAjeO7$1Q;Hvz-w_ib$~e9JoAcRZHB^
zusknMYq^j$5Qgl~&eo(?xDUs*mA*_X@N_aN_OPMxBpceptqjjW8^bSgn%Bh`belUW
zVM6yScsA8exURbApjRC}0gut-UfdJ^IFCr^gaZnbH1%S`ep|K8oeJAq9Sy5>5kF8t
zffE&q&a3#g`xSg0V{&FUFAY|3{`I%^nV5q-csbLT7Qo`#?)G{us7Y^I+gELe+Gg$w
zz#1QIB5|#JR<U^psJlBS9v|s-)BYK@7bGIw;Jj!ruo2k#9aSHgB*NuG@*ZD}a+v|{
zWD>X2K9nIgmVvR%5D7Ijt3?GCnS!4%p7;wWO!a#z$|ljP@zQI_#j(iL7MuBRoKN--
zr3>Q~Y2I9SinXBRzSO2wuut(XuKrMI#AVXM*L(~Sr?K74`d<gvnNb!U=s291fLL|G
z#cK*kX-d1f(A^uP6PKuA^ii7&25i-e^wt@ZcW`>9$H-9{k1y@a8P@EiC0u9|qNE3D
zZwU>Q!d=YfIzrH<ik4-KOyepr5UnXE3$rv~Kqyaf4Sba+E3erS%OzK=77XMHs4q-M
zB6<Ry_Ra0``k}`c@ICGiXZTy0-`5KqCm}Xoy?Nc`zxuN`3gnhz(;wKLB|GCkSBbGf
zt**JpCPb(brZW!qvT9hQ`9q5lVN>_pdLB_q4bU<EZa?yMH^m?(Mja6)sm2J%FoXEu
zks8|jzB10kh6FRM2M(_uxZ3k1MDY;z4Ct5n!ZEFruuECzDNsSuo6Ig<{D9;@TWm^S
zZ9v@$hG5H*zOZu47py{q8vNIyo=dNmSIn5}IZ#*8(Xer-RmN8oDIK7j^*T+*T89K_
zbcb>avK=SSV;f4_u}-7tL4%iaj2G+yQDXf1;q!+4-SvHYyJ<L^NM6zxSzO)G0|2x=
z9=b`9<1BtHPCZYi&BIvvqpe8`X&To9bM8!CPqEheaI(KssI?KqM40E>z-h2M6N)Lz
z!(@K3T>ZvBdt@1&Y2vL3mq28t;-Es30!VcTB>hP&M7?}s4V}m^q}n|-kUg#?M=XpB
z(-3ar!O$M6V>n{073cVSthGvGaf-dl)ImgqcYr%RUhEOK*e}{~g8S6yKvv5LS;{9a
zz%KbMgHHhmX_o!>C5=;Ac_%AiA<y7|Gl4(d=)i!3dE!3!#7W0S@0w-i3#sUITkvmP
zOG!zI>fgGDiJH${IbN)mZ#?^pwChpYWB$n9@SgH;Lpe*yHGJn}9;++hs|~58A2!A&
zAl(rDJV;uA8M+(k$g>C%lV}W_N$^W1<z1fTxlDd(XcN5+t@r9Zw3#~;n9&!MNkVz!
zOUKW-qQ*<_k?1cB_yD<)U0(Q?5c;@vl_DhmrehKBz-Ib|AGM24&7xwp?%hqlELMzw
z&GHxSB8?%1*1w9E$OS<AhgW_`oqV6=EIIcd15HgCS{3}!25R;P53Pqho(I3%!Qu~6
z7Q!qxgW?FXn+F_EetPp0*)}Sg79@C66LfJ<ZjAX^a^Z6@@2{WV(w#&Z3aQDyBC0*<
za>R`DvgRZ*CgolmqAB(uPKCY9;yHEE_|Dj_XeIGdh<{;!8fP*J9My+sQVVNH1%}r(
zh8LiEvP2XtU6^^3@YxgcO^LFQ1!;*)k*Ao<!MGVjgRE(Q;UO$UYWAnc>It1ll^5;@
zcL{Nr@OUIZ2dyaBQ18I4c@G0Og~Du>)ST?~h^xwv-~|oU`A1FH{8PraAai)Rf+2N!
zCH)7*)ndlzD_pReUdHg^7Y|ujGqJ_&YC9#$%fXKl1p)#K4sVdV35{q882(M$J2<WU
zV&G9QF&E(AI~8>*N7|-WWj3BwSn8|vk<p=DH@v%y#fYSyHB5qek}KrS5e`Z5?mn}2
zcBMfg3ZiX_=r}QQWjFcJ+>OKSuA#9c9oP5djYw!~+6I48Gk-ux<}l&!f{$9~@Hm#5
z#O1<O-O}xlMd4+YFAIMp(TgMY*1tWZd00uSQ#kzDfEou9WjgLNcnQ6%mTiH9_|k`I
zA$r*}NriCEIw#3jnbFlxK?DV^-qd-XVwIM6l$u9>QDq?Q4^-yEeC7Q-w&FthZc)~&
z-MR3yJ5VY(a-UB~pdfQG^=E2_#7P2>Xh;5ZMvg`Vv&d+4VbD7!+uVYNG%s*-=0$%L
ztgG@T6T9C43eR&Ax_8gr`{#Z2#4+GUKY(g(IcX=H^=a)OzR!;R=v_ry5)IZc<cyjr
zbVc%q6-3Y>OQfCC$KrCE#ZqE~-K6if^yop$O<(|-lSQT96CKIxhd$gRo9n7wr5yj^
zfrjPe`P@x1vW*km4;A;&m#^E;4}qNtIZFngd1_P=P7B=LN8_STz{MM9c2uNxysPn$
z#F1KOYQgaSLt}>!1lNvJca7P>*8d=dggfMV75jUEh=um7W!s5bOKRsI9U6|>ikfkG
zru^D0Mm$Cs@j|#Lp%$jHLVk`A#{-#`KUi%4uEvMcSNMMiW@zXA>!}J)+payCZ>nT=
z(6zgQL9^PLf9x<8YU(VBBM-zn%*?riwnc@y__H5_;;sm~V2cP~cLw&eh%&$<C(VQZ
zcqBz8FU<ds3={ckJ=3)&-jAz9FPi;;11OZ7@%K(OSjH=Ccr^aLe%F`ly9Idh*k5F|
z$ld=X@UD)C$=P=E0;bhH5C0?XOmFCmRNLDR{2w9alfYd`(_U~I>>B&EwdYfQ$#-kJ
ziVfG;Tw%%J)^53=yKSu9?snBWrm)=J-iE+trOf~nqM5{>4OIuY3iP3F?N#|NI<&J~
z!=rFl?X_)JpulS0YTL!fZTTb?@YD9{2IAlQ#dY=N`4SIG=hDmg#Sn?p+zR0o%KY!h
zisz?`trN-!$Y<n6*2Z&>MVI#OhP15P>9wmZ5*2dRrIVF)RnM1q)yQ_g4acQdON>u;
z>YFXNfB1b}RAGb8X89pQ3z0Qr5wP1$%pz5CX~wna*&Zn$-y19IvToI20RNOq5K7(R
z(6BCazXg=g)Xnw3P0RFo|Nqi5PR{iJgWYv~e>T6UTv%fh0xgX|;0*gTj(<zj3*x4j
z;hZx1@TLZvJCgPP)nWv%??-y{P(2~sZ*-C{He1qkfN3q)F}S|l{h>Q6cr6h6U7p~R
zOC67GmvfJx@_CpDBO|@q?YhM!7(gszpGP?YsQ+R_3r2|R6(V)n;@fm3&Y5$RoI7SJ
zpe^%~1$K16cRb$pgD*WoV3SHiq>)4XoTI=I-oTLfL%e+(P=DZhlf{C5Uck*I$m`)g
zdQil{$4YfTJLSdZ1)7QCP|knj5-IN?%;GYk#>}nev7;0SmQf?*z2CaLgNeYQLrgX}
z&;<HV^PY&~9#39TB*rJp*E)IC%4?wdDTtXl0EBvMYy%5wsqd3t7nd^pnfbpsJBQ#<
zqejcdwr$(CZQHhO+qP}nw(aD`xv_6L|9d^?s;=tl?(sMK2B%J)z1P|WKelradDUi1
zb+C}q&in!No0nuE3}dJ{@^v*bcAo}<FVg6Hytg1fdIIJ*1h-{C$j9pMYwjER$3fql
zHzdLXhV_)*r;&s8WQX(8>*33dzOE1~awGA@5fVod<2RHbnD}Twn>j5*Q!l|Aq5fgI
zl+ZtPRz|Txj#xcYYFcubhP4fv+f)Tl-?D`iCluu|w2YlDOmCVtzyjE_n?nv&q71B$
zLSlBfHSvt>xo9j7MmK~uTW|9ACnU9U<g)B>Z_Dv|V<5d-_vJ%gb9}+l_PVzhW^T7G
zE&Q+Ct~ClTNhJJ&x6G2h4?MZ4E9MFBGD!Y`eq|*0f0l{GyY~rOI^Ir0ySf|d=w?RD
zVXQ6Fj}5;G-V3(Cas5~VNuJT~Ox7g&Py?hueg81rQpMbQ&LEV5s_*Xj{0*BrF0jLJ
zi_9f7i-XMSXQyG#eUjZ%`5YTF_3oE(C0E96k8(Udu{Ya@@Qh%PJy;wWv(6ZhV?IJM
zSmdDlS`QOG-q_Q|nHnjSZ3mYK$y%>=F{qB4CCnTuB(b3%dKi;@(YLJ%zPAqF`>FsG
z2umPNsdm|7I-J_G4uZcD_}RAqr~Qy7uK?SRYsZnO{Z6gpFbc6>*U@{FV%Q$bx%#Ny
z{juJ&)n79z*Cs2??l`3$Li8U*_iYhBm`b|6;z6`HN^7XHB%b@St)2T}y988?t^>G-
zV01#H&w-H+OFu|5l|vl%INER?U2tQNx*0(AzR>$bRM<0^%sBLrwNNH;aP}|gL(xO>
zPt&yr6Rl<op**1dU@B0rLJdl}+ln;voaUSYSBkmRX8sxlk-0Ukb6B094eqQ;z62?p
zUVM3qi<CqgDvui+PIK(pjoYnh<dQb`Rd(xa#ylrh-5ILMFi;m_e0c-sC{HC{|Hy<~
zv%uQb*zA#5Z3V6utvi22C2*0BFF<@P$L$(1HQa#AwEu-*Uybeh%Oy5vaZ1<oJikn-
zHfFI{PmrJ-lN5EucTa^XkCv+{4NBB+1abQML<4+ZRJJo`k$WMnivUj}Ecx^<7CD@(
zZZR6NcE}7{b^NkXl4`GJq;$Os1NoDSt2V&T$_OSd3M2)or9YHWb<e2UAHqmGI^N<E
zdd?E9$#^C|V<v&NG{@u7Wkf-A4=~JQMp0x02>BbahW?ZpkoOI}v`)qRq}(F@eN}Vw
zz&)Ka)()C4w<mSvz<9DW#v9i{dF>D_MfGk7phJd+=A5cLp(RY4J(g{(IpU6@Tq6_q
zL<?78C_ub)z~MAQh_O@-<gJyR1NcM-?>MP22hjoZwg9|UKic*Cl<}H)qTK%XIYB!4
z=YbG_?ALlyN1K}b?}u8t{oUX0q*F+_lUfp@WQ@2Ow@(w{QN$d5BpY-|zb1M@FkOMb
z0UyC~^G()Nh}`%}VbpIuZA`8{d<!ahA$h8?krCyy@I}s_8p?iA>X?{aP}$AFvY%&W
z*zy{D3y=VH9I3#ap<g}cQ0Yb62@Ed{2ABoXY`8Z(QwGiPXweQKQS=#)e4J#FA8ndC
zk!Y9%SQewqBov(Bc7*9T10hfO4C>SZuq`(Mt1pJHEo5<=L#{kVb6k;Y)6fDkd1^?b
z9~G5z&tog*BojhG10M*(1Vgh1o!Jv}oTH35c5)Q}tgYN}=8+#{D&m2v7+$`WEz=OY
z&Onx~8E-iRpv98_Z=_v|+WHKzTQJo0z?I>rOl$UmqXZ3&tSf92yZg$wXC&6sM_WD=
zhH2T7wDU5Rv6_!m0^YdhbVE9*tBf+`DT7gaA0eR?uUEK;sb7E{GODJ?2py7INu{86
zgg8Pg<imJ=P(^x*)X(_Ovo#B+zvebL)HXxiSB<z^iXW$_4eVfdBF>51QJFPFn^YJ~
zF`pGBk?_aj%IuZT3{x^oK>6n0@);tOYZS_PHzlwVMk)<^X3YINY;GNN@~cJdZ%N!z
zru8hN<D{TBY6T3-PoFX!{&<^%>zM(I5gbGg3A_s0L{tpYFX<zLze@y1$d17BvjUGg
zTdC{n<0bpKcG^W2c4mW>fo-mWedd<!0o;ZXMt~YB^9I{b|KPMt4>C{QKRk;a%+~ES
z*({(|j@QBXBn#PgwallpcYL^ox<^%2$?`Y1i6p0-x8)TDr*`1DR|81$=tyAZN@@FZ
z8rRv-bxvhhPqs(_<a`U7T9Vo6uDpJ}tGj?i)DJQu(=goy@z8ku<f+a_!nIZlxVT@T
zT!WS#y^gJ=96yL-ye2R+eUCMFA?9q!JBRV!e<yl_9r2^CtE(k>`tu8K+n@dxFw2sD
z>d7SzP>%TjGSPew+spVNic<PWK3e3AFTm7voBZqRKVsmlnQo6U*#3^=9~>pH1kc8Z
zWP?S7-@qZA2NH7w^%(}Y1bVbh?HpHH<x;3fj5HG4@+xI-bx)w<bY5_Xd6)8MtY$7X
zKpsc<mBpmTO{ByByEA%wtT9TycC1z&a5UW}CrmK2E&Y3?v8V^00rfL1%b<<&-HRNf
z(7jQtkRN?IqP+P**El#DtQVe29~yHMnv>0aPf#TzQ5>>%lFfqQS-3`Nbt<Ult$NSm
zEPL&yDqXUXSoZg6T?np!ay4KYlcSIuKTrZm6<rB(qE(?o$FIjqGSu+`jDO6S16@yn
z!ZRj6z#7I}%m(&=HJ{Gt-+w@<4cdP?5+Xr!q}3ccMHS0w^>NRGIYL!jPz;puf2y@N
zA7Of`#*8P*#D_CEPL_@{ZUsxF$!zmL+#t<8jA7dt9L-92uNA~T^!{Wq5II{I{d13=
zKCPvDndv8O1Y&L>)6+R@qT;=`#+6TsUA={W?!e`B>Tw?Us`aNS{+M3I#DtKjReb$^
zAWVvva+OSi_E8^nfBn(u%kMu<A5%cc17iuv+NODEW8sCOLxiH!C27@>8&bmYr;+Xk
z!K(LxgNp0ci%%mvx*WND*V<vB6myI6@?h$`fho$RD|u_ClpC?LN5LiLchE%plcf0f
zs32<Ru#DN|VBBX^L*3+&@MQ*?n+tvh#rdv9LHwoD+|FsVM8=X`8y3fao7&YRuU(^_
zofkl8{0`(hd0HH*cW8ATgwhqfRlGP=k!Ku`qz%0VeR~79So&0Ww(18M40DuV--HDt
zME1zC9PB6(YB$aRgmYuI0qWB*ileLx*J?Q7Ak#SAi2wK~y=gYS(C>jYGkx>T<pj?A
z@LU?T?2#}>Pf8j-2a)_`z7fvNdK-fXAJO~IFHFsp8x^LPZ>Kq|hy|$MHC)>Zj0(<=
zGuzP53_Xtnp1MZewe{R}<Xu1CtG8U*R*VzWL6JT)a4Q)$CaesIGqvIvVp+q~2x6uw
ze;!67Gi=D`o3%QH5<#Bb&vYVewAf3E26=LIh7gUOrQu>uh?W^jFGo}7(CbGyQsfQz
z`<=;X5q6hfmoQgBB8>RU=p1AhEr2H+k(wSeMF<P<sQnI!ek;vB`<lj9b&&vngx!fI
z>iB{27#NG1XO;CX@<Ci}%eA{qW&e>9<I|@}qg|VhKEix{gt)rlQCZE9h6-9;jX9{F
zTKS)gO!QZTQLgAmy~2rHG|vLjyp@*Nr?4@VoHly)VTQ#k&pLh^a%Tm-kZ+klK+IUf
z9~fk8tW_`{<2z>dTI}f>#k&T<($RWjaO78irlN6`sz(h4wrf)^*a%e@DsQkpy21<H
zQQt|MX_7&x?<h8{03W32HMq9n3foo2nah{x+_UU0z2d&+T4o87$#zXzi<fuIn$6xe
zb)5bJ^~8;iYSy%X*C0Zw^CU7uJLmTqB-Cy72<L%5{YsTmKh-NWQzs2eSrLCq@1lKC
z`J*3At>w1%49v+n8bGiXYc?$Hqt_w?(cT~rB<X1mQ{Zm!d2I0c#@N9M)L1Qao3sDQ
z*;-|7%2%Pc$nE|F!5TJf<1<Lnwy?nDzCa$lgJyGW)ctG>7~U8g6Yqaw98QFx+r$Zh
z8%g8b#$#btSHxJaRYVVUEEA~ZA(~qC=B{IIyW|W9KwhnkE4SRZa2-AYhmSQ5J<S&T
zzuN?lV=cGuTh6X|m9ysFFzH8tiO(8>sMbG3VOJ{`UkE!d<8u8{!p;6LI}+uGF1nZt
z%xL-pQ7?|TZ7m{yy>7wVU;RWkbFGp+JhoTD?i;f;KUiWdeL`iAO{JkBgQW0T1WWr_
z1a*A^*54l$>;_><DO}c}gq&Kw&ndiX-VC!6lX!@<CyPL}2N!v2OK^mpVw!$SCUDLe
z15Z}U#m1HL!7#nYQ{VVy%D3YvW%;~p5knT<Dq{~wH^+R@o1}I>qT66lXso8_u98<n
znc+mUibreg>>Lo5_(MCzSP?#wlVNriIG1X2u!7&d!377?jI03vuE4t2)s?M4K1N~T
zf}W49K)%*t-TYCm{+*X~n}_D}e%{K?_hDy$$GX{<Xv!u$WoPezr@ctqgI?{<(nTze
zXj~cT?U9tK#Z;FqU5=s~BK}-?K@c|I{77cOeNB%8VA%ik_q4R7HT=}4rT^ZdUVhl`
zb*jIAK#hPb-~(#CjQck$e!8<NQmUspBU@>KaV!pc>zp&1<_XCSXX<xjy=D*HEt+3}
zbc3WOa2#_0W^hP?4YW*b@IO%D3((*OKokqj&V7;jS+<$*t8p^EaQ<=xg|M{m1=q6D
zk4}JZp>a|09y?-9D@e`)Atg{~w%;~J|Ff>jhhau>a}cH%e0lTD`iuz5(F=59HQ?*|
z?KPjS5(qdRIb8Eyw`5IbNIv7<1MD@koPF4G++TYXe36;*<rp^^3BWo?0)BC;jsfZE
zz`1dO`<>vv+nMu`z(T7ElnV#rr+pT#stf@q_7fC&hGX`!B>7If3$(sH5RMT2N3g>P
zMngUsM~n;{&{tym4Ax>U-)td!jHE2*W_YF%6KG7xCro}GRz7(#IL(t?m09My>ACW;
z=ivKilqa_QZ&71whxdYqDg_!5%9aI-ahcdQoqda!{zExs+g{@~w!zsDWn0cug1wMD
zdb|4ZzQ-d9Y6RlgSD@WycHsWVc8sEj>Y43_l?sw#H<5}Emh~<Tab!VIWcCZb)!obf
z&CvVPuQ&-;tgs=Qapj|wdj-}AIjQ5+l9;)!ZIwW2A>%@fVle;qy4SA9rf+w9(=W1l
zqHivHYm_<<3}XErrL`&~=s2ddIoFfMN;U36n=yywFv`K_(8vd1FOtaOJEV~qK#B<v
z7tF^ZehA?N5`zs@x5aq%?^L|zg31Pv*wP6vPRu#@ZEW~57HsJ(Z<e4F?&=-PbZk5c
z>)DrNK$+1VR{z`mAEhSu;8IxkH!woZdI-33$)U4{x=2&?PL2BQ==~o#^Kr$@AdL%v
z`Qr%`C$*%qsJp^!^CRz#_jwV?>$oE05#qOH-XeshoJZEd@Y(6t6alwDr`EM_E~RJ0
zL3Cg_?wp^s(+naeX&MBT@?b+rl@uggH!O7v0OF3RfHP@y2n#zoI*j)iG>O-pYlzNc
zu|&Zviky%(t&`OS^r*9q))}0Y&SZQ4XSe!3{o;_<*K?Lini$j#MY8qT@s9TLu;>1T
z9*A&?G0%E+jfo3TO?e){89{qrT2;8w=JF06bgY28JgX8BcYJ|AG(Dsusi!sv<>QYx
z?GtuZHj#!<e~sb7x^?4U3VJ&Nbsm@;%et{V374@zfZKYBYyGAz^L=iyGkw^|eJ$T}
zXn{7if(cA=5Xwf}W~WJNVWW#`5^zT{_<uBgf?K?~Xjf5Q2f<LKNTD&w$^#ar!@}YQ
zE#5|Hc49mzj5iWRUBS;37rt2X=;z(t-B#a;$fL|*XggZ^B1b0hy?DzYT9D;|WoCBa
zg?w#9T>5%=-F#2;*#X4ZsDxJ2R#D2AAi#WTI5?;*q+0=7LY2L)gs1sj9BBJ;gvE!f
z)`G>=ra62N9#7Q~2B*@wqD{Edd83iKozsdVUL4{|1Ug1bOvc&oJDDU*7`=hVWMLlh
z<78;8w*d#J8W#|jHxcJVRLht!M>=s~{R_*5eA;;eBIPRjvAysamcy7``T~MS8MrWI
zW?$tkh4dFNK`ox9c}gXONz5a#3eNx*N`g6(IC<45Dw&qc24tzcUB6ER-<|YvQ^kid
z=cH5KNr|zI^&3;8^RlZ3BgM}aM`g#D;bu>zakIpk^V7vO#ZObGEYrD`()~=ux#lcz
zG<l*h?}z6+qu-Zw7Ty0=iHX!C7JMqIut*3SdvbEwyiy1%er|w{h(EjRgW~;qf_46o
zG^HvU!>4W3CeT@e6DFpju#s5~VEiL-)j@xpxNG5&LbIJd*8Ds3{zU^#<=^L1Mhdk(
z3(ZW2dE;7im~s<qZepP0iM@v9v{x2Nl$9B{Uw$HBvd$3NQ&+orT2)*SbBpbl-*lIe
z1xEm0yrwbH&y4mkQK0*t>ffEQH<mSvG9%%WUeHDrd)x1D7Io&~_(C<vzp4ADNvUQX
z3<iJ?YR#I7ebn^$dc|c%nK9d$Xe?5j^cJf1at~oOhK0b!i^$n^HR|tlqq=`A%nXJX
zM_?eK76&qLFbeZr-gT!i_!|PI5TqttADznQjv3cc@~Bs3#H1=WivLkqZN$2@&!<pF
z=JEr^8S(J}?OAe#CPu>3zj<T9qh*;!!pUT_nIW}DdcO0LMs>HD%c}Y2T;?|!=QR>_
z^BG=2o11bz3y7#>4thy8{k50%_O=obEhL|QS;@&jBChkb2t0;}jEI?xUJYt<+b&RP
z$4m=#^_2KG=1P+CB7?MO3(uPHI8}ymxrn2#c`Hrk#K6}wIRjY{7;z)bLN>#3VmFB#
z3I9&QTfSiL{4ol$pDmX0)rq#4N#@*v?j;=G)+}7RGLqgw8TzReV=S7+-wuF5F#PEv
z^5f%%^^ydff&n{5!)Wj>k?vbx5N?xzIcH@DvKc;u5jV5UZN^P8Y<NS0KKbMWX;l6n
zU~=l`7)SIRPA0lW?Cn7XvYMsIQRPqfGYT9`?UQ;*B8ef3{RSf$%86HRbL{468X)_)
za+n!Z4g-^*NaDy}i$R<25N?!+DT{!cr=$oS4i7GeSp<6ePCIndXr>PIlq2&1Of*Jv
z!Jpg?BWTh9B3$LPcS#Y?>O|7OOET@aZA}!6DHf$axNH)J3645Wv}li%TYva&>VifN
z7u_MD(wX40!>)2%SY&2R<n{!bbuVdCr%$K%&Pm%x;hDe)4&P7}<44YjO3H75g%UmD
ze`x6NmguC@tnh4>yK9y-40X$VkqEZE|3Zpx6-;kiDXwffMX#vdp9$b$irSS&*k1R_
zIk!M-3|)u<LJD@=Gr6hWNrCR)(Yv7g7uyVjAaBWtWS0dp`izgp8ZH}U&PJ(`m(a)z
z1#ZCV-1_(#PxW3+Tw5Ir`<n(D#k5+&&7IsjHRYWUFi%D>Rno{Nzwr5n)8Z|X73E%v
zWSllQm&tg!whc=xlvz^krlkBNM?#p(3Td!OLaZK{p5V0jE*K3{FpQ^$2PI!0!KBbx
z;iRW1Bbc$#`t*UqOtyg;gV9<&ABf!BYnU-!hPg1^J0{+JT_t%=To7PAJGJ;PPYHOo
z#Ml&(=F8dgcvGEWx}$$Zg3QS2nB8z52O5>rPLoJ+K5SekEt)6!df192-Hx6=hpu1G
z`^zbfNHd2w&?=^%yc4IhV+Vd6zP($ZpRE9zMCnhyvjNMOv5AI}kVB5st0g6uAWKfW
z>7*TFqkaXvQf{aH746Iy3<I7}2wURA@^X`WaO$$?Fbe7Aejj<0;vA0N33+4Q$|Nwv
zn@^o-qM~9RZbKxhi#->{R^|?_Y+7b&MxN3qzq5jOpE{;8MrkisGs~@%t8HX@Liq@i
zX}c!+2*P3VE&T|Zu7)t~erp!rnJV$)I#H9sqd;J&V|z<mrA{hbU!r!8$goGCA{V2y
zy<KnpR_D&9lBm?Y5<MlO_XS<ek3>30vr8S|uSJqu0PW!kJr+hK61T1v*}q{IPjoIJ
zLe<Fso29Zgq+d&qdj}Cq(*bsz+Ic-iuyl<W<t8Lj?P+SVNEVhZ7=!yl3skqAIQ4y@
zW*im3wD6ZGDm1jn>36IigGt#fhJ9g&@t@l;E<UX6y106hv|HF5?8K@*I|o1?_}T6I
zYxV_CU95qv1EKUf4{Rts!~4*Wox=jJUPp`66EuEP>GL}^78f%>D9y{!85l1io?67?
zWZchhvud0@;it1FDe6Z>lUjY<?wEgf#Ch^f9v(l+6)`bO1?M>^ZFyKai-9<939ttZ
z-UJiXL=cVnfgYQWZF@Y<|AdX(&i=fi5NO-Sh#32+wm7B!k@$dLJw2Q1#B2F#=0wgI
z)9Wm4k#<@LvsmO9WKywyxG%9~Q06<@pbGQD^MP1OeJ#NBFoQ^dUOx*)ixpajhWf>I
z7&j~E3R}Ag9p-uWs`4)qvpR{RL77xw{S7DmF|NFH?2iv7bnO1}HX$rJ4&&JH$O<|Q
z%(02(6N?sTS<H=Eiqi$Jx4cY<@eZDh{U)ekds4_n-qlkbP>~~c#6_#qSy;5t_$eSe
zq%JE~NwBPC!Kcc_$dbEhveS_E?B7sK>`PN7lFciq2>Y}&Ueb=tq6kOA<=U4J70l%-
z?9?j6a&T;^i5jLq>jBa{<*@*Bck{iRvx4RHXiRfSJHlkB=nhZ-j^bMLef~0qieGG)
zER_XZz!aix7<~@8FO2QfH!Nt3A8{;w0{iU**9zBoD%0V&iRg{m71l+-fGZpNaoLd+
z&q-|KZ`Mj2iUV5ZyVJ0bb@zPM>N;v0q+mEdf%3dt6k;|Kijziz@KPFYVkZu1u;;wS
zl52mHVg_L^AXqjY#L@Vh_`%OD)Y}uuN(;;;R$)hk@rZwL!3QTviGLoL_5Nv7(bw0I
zp7vY4tNrUv6vu^JB9mYABsn<o09VPmXm{XWkfk;Z1pw-xs5g^Vf1hAu4;sYutc&z4
zcvy8hbyQ@@*#kF^DD?hcOo|5XLa*kBFr$k5_g+Q8iU7fUorATnUe^HOZL%z}aagRj
zN*roh#9R>f|1iFL7t5(ILT%IcT6p#$CyhGrQ8$CwAuh}rh?Wfku*?&N9d2y^um6MS
zL0*F!{vEs`pjjM^2igVg)pLj<$J7(?)`*-9`@H=diIXl7ODl9G!CB$9kl3d|$Q@wV
zEJytokdHF)1;8QDK2Zxv5k#hgu>`o)$bClbY^}0j-TlYIm!sw}EU51e?7stIh_G}<
zELJGa3g}p|uoq=n*Ps^&`|tlK6&JIxphAk`8L4>6(J{}Ls|=@KM4rCdbmOV4vXwDV
zooW3H_Lh)50z@segls_wZ7~19c#`kXW32@`e8c&;ASxQbd>cgUpay|g0Uw_L!a-f+
zM)oK!;N}rQX-J4RjStuon-$_y{eQB0*50s<zjUj8`|IoFJp7CMf$0Ac*4ry;AOD|9
zMYai)?B5cwD4;EbLDh)bx2rFH)Xg1Aqkhy@Mir%-Uc`E9Z>;*?KOc`DYQ8_XuJ1*C
z{js~f0sq!UZ$I|@e2)#RedVw5u5WHxDp+&ya}2Syub$UiWe=p<3-uMfmACiMW7RD_
z@bmvKl!~YZ0v>MG*sfotFUGKDEq$+b5VJ^`Tbp((|84-!thD!${<oC)gEauWZJEPk
zZ=?PW|9X97IyYAq$h)}hwX9Fk+K0T&4GV<BKs$P2@*kI5d@aDr0rS_tuL4E!H^hbZ
z*TcX38@u&)HuM8o{l81qFl&hyq#AcN%Q=7=+}?K$x*%Y*qKZAfs===fXWLF*8OZPh
zivR$2*W09p>H&ZHST!4Uy*pKZpZNDG4%cyQ&TV@G1#ukz--*5aSnmhaG&h@%ICPWH
z>T-%F9KaFxcZ!(vjYM#QaAy%e$^0aV9wKx$Mx_sBbsW%PqTZ8%mRCz{XJV5q63Ev`
zZ?z~eID|Qfv4aOeN30kxTn@w{h+dT;Iq3sdMx>GVIg172O+KQGCCJkubF#7&i;86;
z&S@h-_TCo-o`Oc>B3R@>K17B7FjA|f(XZr0wMcQ<%7he=u(%7^gp<;+p){w}-^J_v
z@h$bso!Wy4?4tNhqk_d$9tOnb>-4rTb~ea77oql`gMp{~M=T;yImHhH!FD+3i_U*N
zQ6mV=9R%E_Ro2$LO<qx<&W+$^;w~56-xIhG2IqS|LhmOkSj}>w;da{b3IcvU+FofI
zv!VB6?3=C~7uWH|OIXtY7$<|Y;Ih!z_VEddRa>ZFw!q8?UN@SG5eY6~2HNcvtlU<l
zjRVD*1PkN!R7G1E&odfP8g7v`BQw2^8CaFcsDD;tO4}ND?-my5%B^~mOIzpq8aqXZ
zW-Avr#Q<$X%?xi)s3fcoUmI8bh*Y4C@7FA$O0*jY`q3h+aK->un+crTBu_P%YGu?g
zlgHb$8Y}L5ZCSbcN=5jdd{79i7H&J`Bo<<u6bOi8Yf%AM(ml!>(ACT1x~{?T{$=ZN
zeMLY;j4ePKM{B&<Lp6eupufGpx1_SPHPJGk0r?4eN7e9Ybc{<UTmabL<#g=(v4yrm
z=}cebtv2%=9$z3QE$_Q{vz<@4Yyj<QFj>Q;eU(CjJwmLrD8{iN#M0$bdn!ppK&m6M
z(aARhE=<P&TNYJ@P;1!N41Xas)3ZaSC3PKJ;tE+10L?l1)?>!HKoK3qj>&41yES$f
z8m@fX0rYw{4(HW#%TjcCo>Nz@feB`Scx3|iMn(mtw~|2=Z4;!ev!RdNv1XxoOpzYk
z`n2<=Sni)ntKeO{?)WFE+Ke0hZR=fPc6FZU^wY@sh-vT%BsNfRqX(Qq*9MPO&z{eY
z{eJHK#sIL4s`!NGWaRzry(|mXKqFkWd@1e&X<-1k*kOS?^Gh}7k?7oGBynkn*>P~Y
zV77R-?$-9^)?yW3ko}&v@BbwViyp)*RJ!E$P?T~g>lelg1#G2-94EvDD(U=SocLht
zn3d_1shAI`fSCOl>)Lwa-qwD;(ZWgK*;hJv<=HpYs8Zjh>&*spo@Rr9tkcf(e}E1k
zIMzcxcoBXyU<czG!v|QDv}7Te(6r|otmJ1t0Xqi)lzqFQ$Fm3{jg;#({LCn@VAeQy
z$%9?ebvXg3u(Myu@{Wq)LoB-q0u5K%u$1)r$h8QqbAH&3(XIKFMlXaSyU?$T9`C-4
zp(sbreZ7>H|DKCAwr6gF<g=q#evNwjSj$Z?$q3dtoa5mSOSdqcJe47)xHWK@o3KO3
z0)+MAgYXOuQOD5+1MWV>6U4}Q#0Id1%;m*7(Z+F(flX*Uu0k+Y;hb9<kh(^F@9v6%
z_SDkX*zKK<>kAXM%XfN}D*r(5c4~87d(tKZT{(ZEZ!}h2UhGt5^)1RT6^9Ku>^2;(
zb$jlg+Ei}lI!IN6F}D?4Gx|}@#nyHiIG}bZK4N&@)qF^f0=*&UbOh~x?Y^XYZA4XL
zaJHbsf!A=2sdKk0-~+9da1Q7ilB$zH4lX=cM96<Z6N7i|BmkI<wB;n7p{=UiC@$PE
z-n0c7-jIHuetTg#hfs!0>D&RyRW3o#^CYDGzM5IJ!KTdBQG43L96NnWdgctdNmW3c
zz8$+Iz5{%iA5Oa|N9aKa)UBtEwd}K%%^N(Ese&*Y%LI>&3EioB1|bInH=c(qC=|m*
zzQ}qtGm5CdHzQV0)%!J|O-==$!3dUktz)!6QpbMBFop`ZGsml&K<~w!N70*E;+&`i
zrkmjSIMMQ&LZX%&d(9Rs-rQl`76K4k<KZ|H2Dk9R%Pmv~GgS<D;+ptIzUR}4I`W{@
z+=31x9b|7u%1R-&mZPfWi1x-wMCH>Sh0QDod3B|&f%{)^a=^7!%_5K(V*k6pV1Ym~
zlQ*rD5udN2#hZT0;u?wf%OUm|T~>W~=PGQYIHPi^wQx%d^^gtRW#L6>LM2sa^_d7q
zOETU@ZL8bZF~$S82TX%ys6)@eUMUr4c#b-%B9rNUo;?~V-T15Cu#>E7$~11NuLd6>
zL{r+aMQitMlr?j-8IfUonjQ#^fvOSD8B|7YjM-Rv6ZOEi?7o#bOd808+o^q+jKp%%
zT|_tr8Xojku|l=@cT5T{@RqLf@8{`N^GktQy9wxcot5_UxHjJ@C$mpLkw$^J+H^N%
z=$^bW`q{b1Qu{M~`TyNNYupZggjU|x?Tf$v$6qZyo$568WA1vo_Vb4<uUkoki2Kaq
z1XggXsmGpe;j`?EWBXm~WA7^v#~w}at;;#Rl>27&pzs*hMiFI4%uhVZavnR|Xxh5l
z4<wgW=LK7E*tZ4Y&gdh;4naserF{Ewae2hBK9(Dp1B{_dHDYl1@XD{79FMkcrxUqT
z7;s_>gtO^J(V=c?3-^L`*n&1REIi~sVq-JEv?k-zcLV<bVH_o(|DiuF41nrOirDWV
zglI}xOOnijIH3~{PGAFPh+-ytu7aPzzYw}mmkR^zroeo!f*bac%*yx@@ELt*<tsGo
z0DjYl{C??i+wcgLTvVc$O0`*!j+EOm+0|dJpUbW2_~}5WJpa9Eg%2utk)Wvz%7D$k
z6CXT){LJ1+c{cxB(f&M>AF#5f3q@!4quDkPqZGW~SM3t~ulfM3Qka??>V1OHzl1El
z=SifvG2di@+0QPPm#c@3df=WN>C}LWGHX|@O7|NA81dhC-eZ%!aV7Vs$9X#}wwnR)
z6TCFP7cgIQg&|P-#J;7AlBuCZpAv*+KY3*d;Rt=;okyz_um!CJ*?E*Z${={m;!|X#
zkoX*W+JWHX-|D6YH<HJm;<V7Do&yweW4rM=Y*-`gx;vlKnud2a+%N#|AWKz={x){~
zpXc7fR^*_y3T>%A8^A8OBY$_^_H{=4IGt#Yfs7ryb!+d4o3m%e>j8u^lx)@i>{|#!
zXR(*Z_2z@s#S5L}i`jXA2{*qu&tokxxKLO%v&I+bM*%eMBrU&B0u`l{%wX^1=7ABa
z@`XPZ!;#O46S4;OeL7P3Y5^n0`J9FrCmWDxMJF*BdwS7MMX41($5yDUqfP(qkMfCB
z(XFAY<^3nOgZczMrWrbA7g6~9&XH)U?SP<^Xa$N_b1>MzOHoD*w9EIb%W}gQH9c_|
zWh;OWxF51Aue%8O^(pLl`PMg#8NE3@5eSUXNu5(WoQ@+{KTb~EDbgmmAlhqbjiPv0
zg$&X^9T`3SunJ!84pJ^G-hUn=^x&`LKm2jA&!{&fscfgc9D>~zG_e98bOk5tUFXl{
z5_bT@qh6ac@bAEQ(J!>xruQMZtYo;0a%SBJ%bxnLxB0AzF#`tz9FjdCZI<E!v{Gr|
z6&cPBuOh{Sx>ukj?xn6`1<FQg^Bq^l6ml9ECxJy$^A;|r1%m+s@Q;%ZM{y^wkvA0R
zCPojnk?M@z3U~CMyfQh7W!O<LISDHouC&h57m5}vZ`7v}W7-~Nyt)!<{7}NpRHFIv
zfc3C;3$rRRRv2-*cwos+9N<FuM>F9}Oi4m`1BY!}B1+s)G_MJnoKz}f+g6&7JpQ1y
zl<jH-_oOGNgBb9}ytb_*6YCnOs8?Glal&FR{7XuhUU)lYI~)z6K;By~+=s){`lM4;
zYJ|!cL+ZdU_>Q})LSn$=SWOH(n5@A3EHXULh&MC(1K6BiNiIDKD5Z%@(NJ!IVk|nu
zk|>VR^Ha!@z*VzSbSmut^}Tg=ERhT`2s&`AL%_6}CSK7~k4YkUOx*Es(+Dr~orIj!
zvElBXg_HaFz3~9`e--;dLg&@9vDO8W_M$p80hbUjyO|dbi6nr_;P3nJ0P;K}*yr<p
zGje+=MQOr^5?rx|TpONC-{-K9f(48ZH24Esz}7JkQu`CweaBPAp-5JeF^B=m4Wc@&
zO~0dHlm=>4;`XM`aY<TFxhS{vQiLI%13>!rm{yvqCC?8FpS?Fga-s`S#83c%L38hg
zv{4u^OhEz0ZAHk7u{c82bcT`yF|>fvW;D_ZV`TQqayv(q4TKRDIKVkz>!HJ>Tw@8~
z0PSo6Gq%Hd#9M16VHPknZUj1Da4~X4e{lSSIZF%pv8R~AN#A+lr@a8J7e_c*6_tXu
zoCDrA2;plsZw>-MM<Tf>3Zzc03im}yGI~Hf@BmLQ#|xrW8wp{i97G7gFc2A~Em1&i
z<0WVX&90*m^~`FOtYQl?9jirPeTz(&ID+ryYE_%lL{k&9XwN<4%3KaZ0gqU)CS*J~
zLXCN3a0JD9ZjACE5f19yOPbCPk3_FoZ$hekL98QWF#h7?5;0PRQhX6i86CJnX?#qW
z2EqGRqrUp!+y6T`z2ReEvL)c@SZnBgPM@%<Q#pLuG29+)mb~$I#$iZlye8K;nFuqP
z{|0bru0biy-;+*9<Dv?<3dh@j<vF7K(@;l&kC&(2?q3#b(x`z*VnpzrLn@`(p+e>L
zok7)f=*$b8lSXG`1}pt@gA*G=?Xp0MbI2QxdZu#KbJmT+A>1M7LIzmZpsu8tdPC92
z^L*%QLPAV-KMatC6(W+I=`oEv+Ck!8c!$U7LcqKcW)=F(X3m?C74AyI1eB0~JDH2@
z*M?f^e&<c7*)*{#Qm{S!m?tnBD@mR@RQUFEkTXSm?uk_AqCJ@{b0%=z>1e^fxk`9>
zF`WVXogLFT&9uo(H$6BXrK6DoQu^x1LVYkDL@A6U-vrawGR0shnR>MD#wj-QO2aa%
z`0BhOn0c;4-*g}n3-}Y@lV~GPCys<5aiior-PCn}lV)YS25Q|}nFN$o1-z2sXP7{w
z_3BU<2})#ZU0&KLkaiizhz)QHMO{~%H^F|NDWQQ{V&(!suI3}w<i2`i?Cl%)>MWg@
zRgx033T2(DPcJ7kJEhDD9d3x4h1-4=7U3wnd3UnAsoW7w3O~xM(d+#>V!qXaM2B-M
zXNYm%!@@k5_D7LqT=0$t9M!lxk6qvkmzd|NX2Au<&OuGHyg0+`q+FM={}Fh<$F#2A
zEAsienl?1*p0!)IGLl-guP#-JUglO)XWy@}*aHZDM14_UjKS&CgK$~wU+X}$R)V<k
zlPG@d`6gGCliY;L6%8W+zAqM6ifv}hcgkhhhD;O5$xKYtkGe%7AuVd)54+%&5e?VF
zYodwaN6oO|niwNRApLM&CA!Pi>P2T1rQ+~MiqRh8r8A=@%G@PX-m0^b^FTjUY$EJ;
zcbVZuk&(<%h8J+3sBHq65Iq3cJ9*SH87L~wNRb^CAvuOh%zYYiC^&E4>&QVOO5kXV
zLl7^Hm6xy<S^_QK=E9qq92MB%sR0N8<vT%APLX~-g^fcjIf|R@dCtI>z(6_5R&;c9
z(Eu^&Bkn*2+^7=rd3S&walS$glA(Ue5FL~59pg}IPbT&Y_=6lm{K6=B_#bAKl%4vj
z6i#RuOussFyW!gSw-P}D!=iQyiG7CjR}W2bA@c>(Lj=|O@T3oeJyyzs&Jk?!i~*dJ
zHA9av!KW?(AjC(>ack}Qq7%ra92*FN*eZjh4s>LeBu!SDJr_O>J$Ueill0qhK?#c*
z)os#76<+=je>i5sqQn?M;YJh*L=#(Xai?(Svd^H{SQb%5rP4q;xG*JyG;Yb14|BP4
zWGvg>-3+4Ll}=gQ7N_a7y3WZn0M&^6xtrSTR_4f7(GGyEnN8{mb-tMge$ODY&NN?o
zKGM?uW-+Q;Os6ejD{$&GjHMj{eLEA#97D@A3O+TDK{oj{qpaw#a3ZmyxmgDVsIL&(
zFOn&MfX@7p*T|+L<URc8e4D>Ia3Y-sRH-cgW;K)PQfFk&YBIGHa$z)|7ffs-vcOz9
zQ~fjvF)rjymO$VR3PQ}G_i0UrlZA=z%bl;HSFFkVI5RHjn?;<@MaVTrSKRX;ljc3d
zyZC%8@w_owZ)x;`c)MnBBXewK)y>{)%4NkdsA2=KFEfFg{yBt?i)eCEdkC8<inQpK
z%;PIO#w|D@3Sn9aAxyRuH7J!i69^@1dlEKel(lWN6}EApqpRV`DwCX%+o4D~M^cAB
z4s)A*R(H*xGn`<@kr4h$$Wi{i{qx0!8$(Do8s;Q^xvID32LBBA=kX~D9O^*qdcZ=s
zYbY8O%2AsWw8k7EXv1n`sxY?Kn*N0fz91RcE|YtUx9yVo4pS?-yjAiIO|utDV-Jnj
z6mZ=&SKg8TLW|@&c0rlxq8Z!^nZos@>)>;M@nCZ7(WD1fGC3I{o-|xwC27KaHAjBs
z?P8+wv@DEAlgQImGdV4RiZejn=yp;7*Ne;m#1TbJp5r9eX-Z9?0JEPrNuhXZC~b%l
z8{kOT?;M`DHM~pC(znn9QMGn}Wi=tJzn#qK_5=-@oXQ)SCrwSqHJWO2+I)7=MB(-j
zlEkemg0r!dH~_f6TOf4bC!*WjPMqnCM$58NqvoPVCjM^u?iHQn8k*)YXjdMIN}IAX
zF2!*GX`M)W9APL7`l^GF%O7C(@`5so&WVFvfOZsy1fK%Lj-$Bv&>)0pAk~{0i{6h0
z(8K>#H{t{CIlJ^AkdAc-aS;^xx3hv7gFPXmN6diA!T^-^7$Nq8c#m1NL}YlN*Fz`p
zk}gsCZ$_}-WMEYmUEgevRF?Z`{mNALc_E@vb%)=BbSqIYxfU8>0IHV>i`%0*QR`WS
z;9Z?b;%qDc)&#=v3WnZzA6d2(x0nwmhgnMNJ#R#F$JJRSO`5<{%)C|}DHCye{+=y@
zI&r+-)gh+8pS47_?d+eVPtj!VwhL=|;YtV+MV$?h<TValRRTw$rA$b@?A65RyXK6F
z6HSNJA4(+tdk9JVj>m=hAx|L%H8F}P%w;OHX#r9_(W>F&)f0y6Eylis1{KLCm=Kc%
z=kQAyNygwUgff=&#p2ZrFh8?s_&-X@E8|C*(d2mv1AHsfWWTp~YQips2@W7;O*GwP
ztt_)u*dntAr53XyhW^fAMoXHKsj<`p6Sor9zX7m7Bg~+`eTO_2gBdVB#}0`*I_85O
zP?<Q6Zg;YQ^oxGqGa118>%Bt?$-7IMF<Y5Wbdv?LT3k<gvaX~i^C1XQWRbQH6TkfU
zBY^o<qR#CiF#m}v0G7e??y<RvEwi_h7OKlaU|?d)&*ea^+_*oMvI8&+eGsowV8p46
z#>q0WP^e>c3clJE2e8Z6Ol-@9$o-k!R@Zg?yJEneFfjVt*^S)o$XBxl=0kc^f;8n=
zDz?h;kSAy4%W=@@R%R4m3j144fehB+kQ^pkF}>krIS3nBNKO`{@j<bNW>`Tg4~S6O
z<yJ6u;mxzgY8{lQ)^k#1G3c{WWh%nzLqeFbW?FMBN^IGInI(87D1S>di6!8672{Qi
zaNAjpq80IYB@uo9$gmBCObHh2wxnZrtt=SDKz?VKxgj~5(IV?+oYl^ahYs5W%=n_n
z=a+gftkV1?8O*ggdF}u4<zukjG8?Ek<3Mnhj4iR7RMRk~9tbDLo-a$}+$Eu<M1J}J
z-|G|jE=5GC%)jw~W(fF|xk|+|gGF>Ej*_DY>~jqGGUaP5Lhxh#Hv3Q+%cY)ZRO75~
zqr5J$qU<VXzLn?ue3Dva_6xViS6I6~;pOa4&fH-AFU@-9#G|bwumVs2RKPCd_XRI@
z1mlU}9203^{v=vOxgzby{FP6a1W?Dqt{Pd1O+#8Pm96dzcu?#<a4q$aS~qMFv0;(|
zTk+9X136-R*iOMMueXC*zHUTAxvNr4VA;Bn!HVh>lem#CUds*LsM;baoFcRZZg5cI
zAg5&b*^@|W!~9{FcMhrAe3Kh4Z3)sV2QlJPC?4W-hHnduainetchrcu$|KK3xr!D0
zK4lwQ6FT(vbNYmSR}zXN$x0fLtvzYQ*ME{_oc56$))E1BRjJipO`f64#rmBd=o;8w
zn!K_kv;TA+0W^`*?(Tha^olqi7K3{)V#U<fC1qO-rF!wFEMctG;Wld+z4RtJrbLj7
zN3JAZS&7(9m?7$9Z?kIEotiuWzwRxtEJP;UjE>f5reWr5bK4Q3E%kC!4ZMbiVfs}1
z5QtXDM}oXdM2ks@uK`O%gRWD;7^8_$6=#EQYwmm$Nl>S>#))jD#)9^q_7T-yV}4J&
zE}&n6pQ}1^|3^VMPHJ8AS47(<K38@Im1XuqlCX}e#K@!9*Y1(+e!Cpxif{yHHOYcf
zN(hS<dw@KB0c{ALIYgen5m6E7`)QVa-{6)hrE3lzIfiDL$L?hkpY}u%`B;9kk9l(l
z93BsV$~k8whPJ9A!cm?xeiP~-8OfepKGAZvoF5F{&?(ZsCg7umZZk}xfU{7gzqlK&
za=+Mq4*us?Ri+%<oU?-+wms;KZ|@;OUIHERULqOyv>gcB7!W2`PNy$qP)6622@$iK
z+CxBDr8}$`Ik%t@;*P}{I)+Rlm2oAM>5&=3e3FW`JH5&F3VD_Ox<m$8QMzpWs9as9
zlBSKWQwjFF{aD7>O?dj_jR4w#+~-<BBC?a=#lI;w#Kl|pSKig4`p5XQWB2al>Ic<p
z#*mV7I*(k^VoQ*;F1De>s2Y>YNy+xY(3DfY!H$!!YX#t(B-u=+%Wp@HN_nZcmJka3
zUnG9cN24@$WTFGr@Z0#r@}%kb=h6mj^i4BydUS1_38gglV3wrNVux=>jb&=nN~p^s
zu{6U&5*Wg~HmekuEQO2&vlVlv0<iJiSvf##_7e?sY0?X^>iph>+vd<sZInj(zJlU=
z_9b}ju0-(U0W2=Z4@dZU<P}^B3zl_oj+)dIJ!)Q-yzMQEAIiz?M?-vHvF*h!5%k!2
z;WzOOWPx)#0AMrnQ*Zt$DV`@Ci7&~qZ6kQivrW<@JC$-$dTM0WbvISt`0*2F-zPh<
z6Ai2T@R?YmNU`UPti->0pR3M>iS)xSbTf((h?w)5KsdSkxs>BNze_%>t)f4K{tsd1
z_gE<Jfq?__Xhmg4b}fLJqh}*m$yVpyUmr31v6*<Si(JR~CmF2YGk@obMUomrOn~(k
zI5J;{uy^w^#7mA~5>uGT_xQ1<OR-2Zs#goe78{{{;?h-hu3!IE$Sd!z&80Ewx4*}2
zyDkVfHFY7_3v#ac!RH{f3P|}qr^V5qCCDJ3cx79Jtq75x&Oyyb6Qr2c)|vg8m<jy;
za}n0>ewo7voT9;h5%KqXlKK7{97px$n87859^9Kj%DjN(`uy?rjecb(?RM&#QF7A#
zP-bl{C?_*r47eMt*=$IwI{VWzgfk16kXKv6U4+&rURK9gd;&6cqi|#I7#H1Myfm7B
zEN@7U*iu$F=WQaM{REu!^n4D!Fx6`{{2PLLUHt>Uq)0CuSf&UQWOLGNA(2qR^5rpS
zr!q#C8PqqGNz5x(lA=9d>kN%lJgcrS%3>bX9)h+vg^`@se(@=~(6EEgQWR)J2Fp4h
zlz8i4&LM)lm)Lc}E<*<-MnuSN(+cq*)C!{z|II88U~B~K>cZ>m+OphgL;q77)@?R!
zl@RQ&cZ-8pT21i~KmlZQ6iC46F)Tv&JMTYg?2Y{m(_{?;hs8}sR9S-EFt!Mlo0S^{
z<fVFU_9GE5o|@>?7Ay2^gVM_sS%PAO;N!X!u|gnUV=^N}-GG1|r39?Sz~J{5)Y*tz
z6V1Fa9wk1UG8=hFXz<|-?m=+I*JQ=nq398Hw!n<fi|whxM$^1uwS;Go6^FPYjN{4-
zxi<k>5{}`FY|z(W(&_LGy+Rd<hlV$d(eSv$!mI=?TbrRJt7`IO_Skj{AyWh5`z=i)
z3P6@Z#^!-R5I)ylFo%jWz&5XpQWPWaO|pmJ!gau*h}JS%b=eqol}GU!xSWpDz|68N
zA$Nj3a0?6hXsj_%GMj)7S6gCM2G9w51bxyK6|$bmPm6`eFd8EV=9qV5@K{x6J3!fK
z#tK<2o>6!6oj9vHURQ5B*eSC*<uDv5<4+&(Cxc~3dETGF&K5xYL<?0XIA@mj`v|5~
zots)#JhhIpKSMIF8Iixk;oD>+N3(~H3Yt2yEYkMR+#jEl$UWsUS#RyQaI;M1LxDUt
z+|jl&{b@AkVZ$nlN8rrS`5oq*rH9g&a+@;f@v$%r7sjPYZv$1anh4P{KFhofpx-pG
zm5(&VjK-h*R}&i{wB8;|wgzcrsXiH&#ss3{j1%a`!^~R|;_I00xROFM#RzWa#hGQ{
zNt$xSYB8mmSt<`p7*=CT8#A>@7U_T@$kUc(WU(sQz9-{%Lrg6_&XV+qJ~plvWSV9d
z+|g9hojx#VzyGR&dR1|9*4FyNY+r8bihMWs^pHb2TInizv1kcAHnRt@x9KulK;Afu
zK}dbAMCQDaQC6c!Rt($Cq0&)V5lDuNL}jM3vD}$qVhb{oL(N!AK$E^06bW!Vw`_@)
zOjr4W!b}Jv1^KAlSqVI|zftLxFy%s98dV<TMLA+UomrSt#L3HnW{fA_<ckijUJO6=
zTPc7GC@Cb~kvh@KZI7%MdIHPwFPIDDhM;q-GQAU}6Aol|lWY`TImLAD$!OXx3Fpx^
zlDyGK<dM5k!X%wNSJ~!T_mEnSBr7%-bwWRQtS<tLSjVqYl~BoiQg&B$aPs^T5f#Xs
z0Nlt673l-t<eUNhj-p##wy)ol3JTP_tt63==162|=Eb!NiA$gSUEUNaB}5vHvV3iV
zY7oy9O}x5W29pSbQaM#pUp1+U2n?c!`3k6ciPEIV-{|y>qxT^-SdeESP}qeXM}axC
z`O+K4uw0AYmW~DexBYCAuh{h$NQ&S_LXim!psvV%l2os4)%$7nUR6QS4Yt_FbBsIU
z$(|>OsJgC4f`Y7;B4&;Qg4s<yB}CtcE}ZdHJPkAEgg-V{t_SeAQrxTMjKM;yFen?x
zbaUsX!b1N#Fh~;uoC=??><|~A7mCZsveiaNx<Mw12Uy@KH7Kcv+jstcz-W+tit2VO
z<3J;^&o{RWRE+hC3N6hDgUfFv`9sP1JF5#t*#Fsm8`~ddwYI$nH9CcHOWG3yqx|6d
zQ{&=i=(Q2DK2Px6tv6nh7Ji*#`;Zl)rKu&Jto;wuD3SK)VFD)(=!IuM91v9zU`)$&
zb42XwgwC~3s(Yp}V=(Xi2p;&+Rm3OH+UExDcbSTpJ5uv}R)LC%q=Oy63w3+QT7^5&
zHMV5fHF;fzNZndR^$KI64fn;92{-4We(4D;C5w}XU2!bbqEYyjQk|=&x7e`{&_0Dt
zCMSS|G#gIWcVN+`lO2?xM~jI&3c2G_MJI06he{a`i7H&HK^(|Ub#_1eQwLRZ{VJaO
zIfk}EY5gkQ-ITE^J6_jTA}@1RfYz1^24HK8BVw3JhkRZFn$|xHqCFPV`;onONld4U
zE~l(v0CpLPnTtZs!&D8dEviWlvjK8pd18Z`@Xd(8MmEJ!B+c-BjNCS=+%@avDJSt7
z-Q_GbRq)iE9&{%}Rl&0zsCl5KQ;(dqs#%LL<wB)1<Cj`4X+|$b8Ko^UYHX*d$@upJ
zBtx&zm<41`rrT*;sDRiqeh=qA2fh*bF>!H|rH&%wwgnqjO^=Op&M`#JCm$Z{@i#8G
zJQ`pgxv_^L=$Xbz8q&6jR~`s|U4JO8Kp4Y%VNzbo5yQ-t`$ngvrtat8K7z<DM16g~
z(4SA~Zq+S)KsGK}8sE!qnbB$kLV+xkHpL%5Gjz?+pj0_Vqhi^@;Kp^;o405k8DQ=7
zm!yzi3!q??_we|ROS=Z6{ygeoeV5NxoiVk*{_#jDF_P)DNG_{^S`DRPe-7!nK>Im2
zra<EfWmq&Fic*d<fRd&<?&J;k%`^WDTxjPJjY~tfWec@*v9e^2LBQuhh^@_SH~Ix@
zZwLKs<p-jHrPyyN=ypUJk1}p0TWCiN(BWNZz|)(#+(e3=q)b3FMwr-s>hij;cYw9s
z7lLKSct9{aiVBKeaNgIjkNKd4?AnJI*@h50lY;cJXSkX4FrdMWNau|GHLpzgh|v6R
zd3f@#CMSMID)WoN)z`q23R+uJbH3!CNFMlWYf`E8BU7od2Q&Vt=lxjz4*;h?Sij8r
zw~m_Z$^Vf^=f!h@jnDs8F0ZUq;_F|ntW;KS^MBpMbCDET$sAT$nGJ}eNnnupME8eu
z+ILza7(~KS3=r#>6T??W@SO|Q83@Jc-WaofH(#x9Z*JB0R1q0ib515NYO5@VIFd~m
z2t~RLQRPeQdUBX?YlZS*;zcF-qMCfMlzg##_@y2&WA=a7IYAi!r6?b5oUUvCFIAS7
zQv1JryZ>+GL5EXZXen&rLX#vxKB^Q#asVhm8O}SHObzxGUUGyECWTUQ+@-AnMX)-+
z7+Ftb@X8Dn61zKl`^e+IhCM4VvGzOhKJ_<xX&j0}YH>qlbw_0u$CW~@DkiuqnG870
zouX6I;?bfgysYiRJc2?|2IB=m6eUPhVei!%yX<e_nlG4;hGT=l+&uDZMm?Wu?%SOo
z3X4qdIPhhHM0`h|6nvTrK6d2W4^m_D9g4tvAdj=HCRw*(2&q`g3P(k`<k6#cAwut8
z3O1FPIt3F8DIGKqmacL@RBbsr0x-${s)tY5woP{1$4;pAWhe#8WCRhcFY4OqyJ5T^
zWL#>1q`|R%rOpakN&76yOfR3}Jh>KJJr-QO@8@J|N^bSC*nWGs-)Y&S6ZCp8Saj%1
z)!>-Le*PF$A(T07aLhribV<|7clzDkIQpdOSUMzx#GEZn;uD9ArB;H{8Di(BwD48i
zd6CtI1#|P8vI<YOu^sp&+$9Ppvleog4@RYYB)q}Fr#w&36Y&8VC52`W)U;&i%;dg`
z-4}i0uTAs`A`h=~kWG^tF(JyjL01kOdLpfP+#?p-dLP>}iD}vbvHK@<)F}A@-TRPl
z(wrGnjvj&W%0whrkGfKT&jx0>5hb{pLaDa5Cq}*|&w9`?KO=nNPEYo=qtfSL$9UnL
z6=atgvOBCwUcu~g2rSAQBQNytaNJIO^`&w=w~zgd;s1_Yzj+#ZL$`^SE|*9JJxTss
ztEBk9rM2=c|92D51o>~0gcrvVTfkGUM+phf3Ok$?Tp(8ntXxzGe4KL+OC{75AiD3(
zFC51IN@$W3fgP=hJVS3^dY^V_^)lj3Abm{$?g~WCi_zQh`X9OxYzBkN<$<3h|CKA%
z#Qra@E>~{%|4lsCrT<BW>qa9Oj?qn6A6YNdwR0&Xp@`%kyhV;El{d>bz-dwpV;Rv%
zUlFPpxoB#1A|n%-n7bJlhRS>F)aC3-WSj$hD*3zx$h{BbyCC#Aw;cy@HX)Tf&Ndjj
z6vr0x(xbzqjM0nn&XL7OVGS=Y`v@^dC8WXYN+%41QySNai}!;h&0$3fWZ;Oddx~+X
z=<b}QS73o1<&%d=U)Y^kPsNkrfJZ*UfYQY}Y;njECgxa=xOL29MPA9I=hD#}D2bml
z!b>J-N3F-AR^ll#@HrHC`Q`!8ee6D5li9oMavXV<uRc~jA)qwhv$J*`Z5R^iYEG&X
zi+m9B;~Ng`Wo#1QEv3+m9|1Y9<wU~)vHKtje2B||*~NQ##qZ=*oWm@67>)-jRi`R7
z2SBh&+F<>6bb_bBiWoKltdoj-s3hPT`&gY3=rEt3olXa*6YCS6LmPG(a2QuF^W}J`
z{tQs<<Bj(u@KZtOW1^s880>BMYf@0(KG*tW@PBAeG`zy=-;3P;t}Nf)|K7-xzy81g
zg`>f+iFSo&P2g3c#jw-5NFS5r|K;*Zg8#2p%eV6XjXZm`&3XgY;PF5GJ);8fg8xum
zSy`0-|ED|ry5$X{zx?5!{<e*L^ndzal>W!gKm7~L{88$={r~hI{^=jT`lo+%f^KPm
zR)T;^fBEXaeD(kP7hnC&-yA#9@mIh3Enw7F|M-u@1pEw)JMdWl@DI>CA3Fd1FaHsX
zWqtYEzri|R-T6mi%Q6c5tA9mb{xtI1C-~b}|LT7he<AT#R{h$p`_Di8FaJ;f-@X6C
z|MPEd9_(MtlfVCAb;CvHGIGCqChh;qYQp}bvQ}BUz5l(D2Ul4*JrBgofI?8V^=)gf
zheTgIqpx?UU@K^0vC<zfOwzZ1K;HaYKoRlp;kO6k8GPn)>S8HCqd$xtDE|EeC=a!6
z*~~BN$>0BS4Jj+;<@%Vk|5sD?U*+=B?f$=!=dLvTP@W*{1w}3!9E5oB&K-{RRl?A8
z=!YDLGdH^92ScxWhLI=O9D(w(MdF9r`kjvB_5<Jh*@ex2XW(@xG{wUYPWUh!`BJ$E
zukVm@Xmx4r@g3z3T)xwyNFyq1=N;&dGXhJ0cYHz3-M@babyzKmL|0k8Bb~8J*zqt3
zOT**Pg#q_4Y{{JnHGPlEW%!+bUBX|>{QGK|Mfp2-fV)LAFsam|Np@N~^dov&BLjQ~
zRh^3uq0t^x=lfCIKRvfZN;Ry;m;7V~4G`eJy3v{6W|zsxZ3Fm9*85W6mqM2`qf~<e
z4u>vsMX1NbHm_;@^Y?$>^S!>)yMg^*Sxw&m-R}RJdhUwXyw2k&Kqdj0c9*BN@aLZL
z?PERp`yUPVhy%E^ATVkFm)Dk)_y3jh((V4gi6_qgCz*Ad={Mi*$<LpA?6=S5pUL_^
zsX4i*^6#sO`@gzcUQ7Fb-0uGyd6fQd&DQ@te*Ab*{y$s)_uqf@|9ETZ|Nis;`5#c<
zxBAsr{~F|hCuNJU|LsS767MV36@LG({;q#UYPrQl7|T8Q|KGxY^yz;z=EpyO^<R;1
zxEor1RagJ=b+Z4Zoc_y?<@=0w)+*_Cs@2SP$}6kc@74U0?<;xlA7#H^&3nI={eHRn
zxBm>!$A6i4|G1K~4msm5XO9yErR?`P<F8b*;Z~_EW%v6i2R@Io#}6&#z%y^Xa^U$m
zdtT+ok8|Lh)6S!uby>@Se<f%9kFwXLQqEbgJa|^K$6wL-oPqyK)inM;&VlDz&ih9>
zaI5CbcQvPcB?q1>IrFOIz-KiFK6&t5$-%?r)qJ=;M!JzjmzFc=QdJSM&;8_||EPQ@
z!QtO`2A4Sd@gYEu<Nuda^8fP6?fu`4JnH;k`Y&JoJzduQ>)-sQTlvjbA1c4;R^dnW
zpFcm2-agm&<nMo#k?6wL{`#4)|0~s$|0n+McK_eRqxS#ufBEXSbl3imziG98Q!W3d
z-Tuu|`M0fB>$lZ%`ETH7>&}WM*uQPJ+rM3c_wcj*_ppG=E30dd9)In8UHOgU{H9X=
zy7hJSw~pid7Ffow+g~sJ4gBu>4Jz9I;UA?Dz`*S^EC2d8Fb2GT|N5)neDz!S?an`_
zn|}CSMhy5J{QqBk^%WeVfAg2$!2hAt*UoRhZvFP__HX}(|M0*1`m4YD&tLst{)789
z6#M6|{*HaJ{^1oSq!(|4u-EzOAGKB=aQy%J_kZ~BzjmDe{O7OW-`H5H|MlO<v0$Tr
z_?N%^>OcQ){^qOy?tk)kUw!p=oG#%ncVZQm9>K7_`a6W;|NVde9YOPdyK+iD|C|5e
z|42XQPyXNZ^Z)a=4{&^HoMaF2FYc^rc>X8s@@wZWUw_^D%WuAJ|K+z|{|$oSzy8bD
zfB6mk;Q%<>RK}`v(Qp6qAC$2LrY{jNoc}3L1E7jP2FN0u0lEO{fBwgR_}NT(VrjPb
z_y?Q?;K5(+;8YL|{?Y-g`pbU>NcEThIpWlR{J(vLDD)qTU;nn#>HNq4_1C|3UDv`d
z1jX&Sa}!Sn{crbxCc5G0jsH?D-`fA(#4~37`L8SJWA^o5E3Z~>*Z(G-iR)jkQbq#I
zvT{)`unGKMb$Kau|Fc?IyXF6G;<+m}j@|YN$5?eDuPvkn1^G{5I10J=qU{Wvme=!!
z9>zyho?(T>MTsb!B+tcPJeev15vFkG4uyCtY)}*);fNKAG7<@iX9X2dlD;?PTPU@H
zZV$4qeCb7EG*A^}+)G&jb5}$2!AWK<G_61s*PY2q?1CxNg6oQP8FEtGUBSwZAX|@k
zzv9#Ty*i9C40<kQaQZ}r&d;-(K`RfLK$l?MckH=SCV*}bHjTR(^2%bRY<Y@se_XNI
z^Zb)0r~BmIM*}+_j-8?c7BD^*ZUPh5ov6H`GW9M1*La*zAcRqfshgYbAi&_F8+B39
zu#0^=RFnPz14#Nul=Dz_gv+gFdIF!DDx{}O7-m79Qoo_?fkM04AT(xt=%pKbGY(qY
zfx-KZJEW)z7G&b+C36Cj0o2Ip_0BN#|7gHT+O7#%E4j$(2d99rarDZ=ST1Fw?4C=0
z%@k=91GI+j2QL^!Feh9%K;Voe4Y|&kRW(B_%e3c#kI_?IOs$E*EaMw&>fKOI?Y?n~
zy3^Cc$FS^(?}>5nD1KEjAt#>y)k>-F_-Cc47Ys{%?}+V#W?}^<oc~LewWR;|68yY9
z|8L^COF3g@zG7Hs5qbUI2zILr+g|AP#uFck?riQn;Uu$YGRoAHW4$8&bY#w4c6~;i
z0(JpYBF}fdkBX!qR$-ciVdVC@f+CGMP$h~+E~V5YbJT@J4l7LYZOONHdUhkfB>Jr@
zo<vWEytXN*u%1ph@+0jWEn`@tD|Vz0g-Fbw9(!;i_8oNLmM-5wrzmiE2_rngQ8ef|
zLx5{PS|F$ONN4Lf2F41(H3-q28xIVMg$pey?x!;%1`IcySp+d3x;+YZ2DIw#>eA9<
zgj0gMs+6Z<ub>#mrC_taCMtO_M?|b{iBbpXFy3Y$esFQ#jMxfUhn>aEpp@P36O1jT
z50s`e9EM&?oh#&jet39C#xI7&!uVrotriCT^YrUs0KLwsK0+wwM#ntSX5Sg8d0-|V
z+5u?Ntmcu5O(wn<%Sf~`LzC%F$m!WVdjjP@I6e50<Q;xM&k9P;&~8i3<i)yFN4t2h
zJ3rE$b7oN<LBVz=R>!huV^`3X6abJe4FEz#8W8=)vBlMp@KtP7Vd$I*dtI#Y@fnOC
z=#Z!8sL{im`he}3wP7nI8!$_uI-W;1cR^SyW6G<^!%myyj^@42Lc9%lH?9Q^@St0u
z9#tC_s9$&=lN-`-IdYRAH2|Iw*MdRsebhU{G>&P77rq!ox)Aj^qbv!Z`{cWQ@R_Xt
zSt%(`2aL%vEANNTc>b?asigdWmMZ1tTmJ7Rp1Y#aqc}KfbrpkV)Iv`0C;-XxxG#p`
z8Rth415bV=+_2Od81;pNDZ_yeywxxW&t}sWLD!0xQG|$^*Ln-oN&)*qJp)^ojObIv
zm^$>0C?Lg%<eG~Y)kIawmsLgWQ;NVa8mdVgV<gwM)E5j-rR*7{BzBbpMuqEmzo(_%
z>LI23shVTvQ-kLXCpk#kcq(|7asc6W7Xar(I-sT<x(Cm(vY5<xCB~<RwW5bbN${w-
z^Sr{9a%SmFrG^^!O{mbsy?e33(Crl{+yD*l>XxR{yIlo?tQcEH3Pguifbp6!bt>ko
z<CI+lU#ETI2d5yD9Jw+;SBi^>r<KXfL=@wHq2%08R)A5Xgn|)Ll+dc6Tj?Yg7v7Q|
z9EYf)xP44y5QHA4PC~n58g<+8?+^7nyrCL15Vc`2NYW>V!-hSiq~nzH%~7$*n1UFj
zf(pH!Y^vod-52HZ3n=<Dj2=2yVNqpBGgA0*dMm<k>dySxaa$u4>0Eb!6h*(6@vyKH
zYk_%7*tNTEhzUk3<{i#NCE#M9QRp&)oSA$KN{d&wsIueTkTjn*^f-hy!3NI@-#wM&
zZBf=a;Dk(0c;xbWqL?&tG0hF^m{a#YfP&!RQ5L0B=S+dMEH<|4we5YeyMEB9F#>52
zDCM!4JE1veCi?)}l2D(PDFd+OB$^_Ta-9xu_njZa&JX8$)~M#Tr>t-Y<H7+2^5tQA
zszm-4rRgF5d~qg4xJ|+55$Ult*a{02t`27=Rj3yxhbevVr8VQRg`kk~xOc6!=;3~C
zxfsG3W1`!-AvFO4KV}iTE`|HH8dthGmH12zex;B&Cs)RulPlIaIn^@EPdFG?7VKjw
zv-A=#pu{{l*cZkvBF?(wb&xEy+%|eQ^KL=DVZ}a)F3+_s#kjVWT&`^;$+Zph*|w#r
z*tR9;?t0m_m5VcNE7LJ;OGR;a75@Ji{$Hs|PH5%2IJl)*IJnhW3O}BSH>}Q7I-Bp*
z(5+7bW;R=SJ}VtvnuV=gou%;OnHbjUOr@{jK6#1Q+g1AaF|)c={xS7UGsPK|15t+x
zvLZ6^V=_au-XHHfUYk@@k(kq^50k<EVV-m5piNzVCgXMT5j6})Cd#E!c-^rI(A9)>
zngEaUnrGVyPJL9XM-+zkgWEf^j}Md1l1I-}3$|tjDHdQx1s1%5>sZ0%sYsnB<*o=Y
z;;Kwq%e5o)zqjUIs+=dXL0ZbcIcgwN`xm*2#5KK+D47g-v%~y?a8HjyS5B4VJjb!u
zc6y80^3RzDq4#u(a7Jf8P`Ik_4~PVU3r11MYC3BvWwLPt7GXNKRMT0UpDCz|O+|U|
zd7s=l*1DLXXXTK{XX!X$qXdZsLM#|%0wnJ&<zlz$-Y@i-tp8nA`d<*KONfhCtp6=9
zm#ZoLZ@GG_|Gkk%>wi&UVkk{Q35-$3P55(Q!2xM3DVMS!^t`?|EXI^BQuZB&cu79A
z$c#rBn3=i1a^3KXRyKSt!^81n16syq8x&5K8!CBngOw<obf!0{<Nc)=Jn|&ADEGTT
z;}1^HgCU+lyX_%xRU{;n^5s~mt>9HPZEFW(x3Z$EOHn4Ks?m~cw5pU$wlUswWOL-;
zxgJk}(#A=xTXz)Vwv1_=qAy7gx)M`^u1wZ;-W5b<PF<y#VT~yX7?is}WtN#IBLEdT
z?g3A+sUW+chCSj5@%A&TNi@r|wk0yflyyPprj{+3eD=I{GMhawJ(~eRJE%yK1B2Qs
zc%o<oFcaAjWvU0nA>}ts1;7o6zp82)nAy7GYT0_7Py(;SbijYrs@Rn=n%I@kr-<d_
zk!@>96yky7oe63&Gq*h=3lDa8XZxkSrFCl(x8;b`l}ys=nKP|%e8PAy6HLz&s#53z
zrP8qn81{Y3r~lfXiTr=%QOWbW!DTW)P4fS#t|sF@mDg5o<3HZWqj-G9{o+~^j}%?T
z#b*$DeJ4Cq{D!<w$ziywBE!5wo&D%p0KD~-cBQi43b2m8C?DGIs`L)kX{2pz_d8fw
zY8hdc@IrCQ@|b!LuR<!sIXz{`L#?rd!zu_TwnC-y+Tls-hN34>?I)SU6Ju<5MszN`
z-g#5oB-7}S&oc#&IXz>^YKAV_Cqh%P&(-YD5}JLsm_3(c<)P|^sqe#S%UA94cae)j
z!va2%QShO2m~MO=IV;M6N(ZX`9*uxuaak26&3Vmuq;0KeopaUQN>;gQx?EL`DdO~m
zA=z<9fgU5XaySS)3T5}CLX`bz7CmJ)sX#(AdT=fiyY8AqJ}i8l7_i2_02~bjv!$A`
z9aVBWs^)i8k&@5Em4)VVk>CLZJbGGrkf?(ljj05<9X%}<9~2e3H~Cei$gr1xmd|My
zT5ZBC4sW@Xt9vG&|JAewZ>f5f{y)prN;3b;(#p!p?fHKb55|9|)wLV}=uo;_UA%KQ
zt^y=kj@2jRD?kS|eL)=n$QVPEBBlHsCYwd49~8I$H1bf!BhjxYC7hOv!YR}pDzBGF
z74Upp*+;4Yc9jW8@4=&pWHLu7*<Q?Bi2sYHx@`Bnnaom+fx{4QlulqwBObBLT<HhU
z5~ZZkL&u6#G;}%BBf-E!8`_W)N}{)ratTs)G8Z>yy|j9>W=v`opT;NpQ1o1QP4=wH
zZwlT5w{z@v3h`UqCR;Xo9RdHvZ*1q_&G%v@c~dv_g&01Qbg9ptT50w&4_x)II#J&3
z-o>$X0ymO=Txf5s>{cwDYdq<?eK*Pf8hrp9%46Ilri0m@z)@}NY`>_#6ph;cR1O$=
zAm-Awj4kt3Cc1u*nz(;PetP9Yfp?hNN%+_a$!g1qD_`!G)#g2Q&RF+ktTM5qU^E<z
zDC@G@7Jt+;(7P`R+Z;N+1UpZZO2%tTB|$ZnW-*4fs(pHJ&Q`V1Lvz@Rnvyk6kbr_+
zM-QZQ>Uu}Vz>It{AUl6r7SH|wl(B<)NDwge>b^Em;ce0jB9|^d)b5x~A3phhpgc|`
zZVhM1Y`8U$BxYKR+;TAUbwFlfc%2iN<u;n;n8r^nn*=R73`plDZT1JNgk+GANb5&W
zQ9zO1E@o=Lez{1rSgvFi9z|}64vdmIFbuXGj={CiEy=@{WE!PCzZT2`YFe2N^Nz{$
zJ_q$aH#77rd?w%jFPE%6c_A&}1plw)mDO@G|6^tO*8l%Tp1b0Ox|ENG7$i|Lmv=?o
zmnqF%N=x4Hx?L9?<k=<~KFHfZV$jJ{3aS4#`Sz<E<&?8sy4Rx|5lL|Y_)B2!rT;qy
z6vB+^A;lXZ#SA*6gh3S9O<fCD|G6v#YCc{0tna)a_(?8G+ilIl_gQz$R^BPa;>p9=
z6?n5(uv1a_L4mBlN5qoc$KVDqGQ2KzdQl*bMo#GXL)Yasvl^pY-udbRIpeq?MmRu`
zkB@cIM@c6^zUp0^G+s3v+sJbK#PiRrlx-XtAp$xD-KI>i1!p|ES|1^@GtXpO#U?Ac
zv``&3zL>_E?gi<uaQd!U<G{D9GoWePf=(TNcTf~3m9ZcArJvm}kTy3W0-?g|deG`_
zeUpUf7IK=XW)INmTe5S2NXQY55FSM(AfI{>8kf@LB{uGM7Fl^M>ox(r;mG%K$vzD{
zt-Zc0b{mG1pkc8x-)FTqj!ljRh6^2glq;$zE3<bND*H&G8^$NLhzNP=_(SVb*qXF#
z1E-E%P}}S>aEf~bBlgfoSyNub<LJmV79}&JE6y+o8Tr^^_M7)oM@)R<AQGj4n8PU_
zO7QQDLW}=ovLz8bq7J(O3RJ|hvZ2KjQjwIzwlHZk$wGmrX0yVc&wm1CipXNb2=drM
z4HLtuR-`vB8d`C}c~WGPI7M;fv2Fb2_4<#c3fD(E%ag|4u(x~Actw@I=LQHy&tf}P
z)@$SH^j(Z^8%b9pU&dchWQi(6%~5nLF&h;CloW>ASSKER`(af>p(xi!!%|@?$Ays*
zmq@TU3WJf~F_YlKBJcs5uv2ybOtePEPC{*BIS9rH4839jw}>cnYKtZrgTly9!(hPe
zyzqSX$%V2fD!2k2UOe~6b>+T1qhUI7VHpeQHE)|m7OnkJpPHfIw(1SqaaYUw4ad(S
za~8^pIE8`MR8FFEiG~j;sLtGzCm^wyjSfwr^AzpC{jG)(-q=z{;<5F`n3MHj_CxpM
zaGGJOvL$0-W=*20zmJ(tqQ5e?0<vHv3j3U_&K@U{UA{mhmL(r9MKd}AuSoP%xDzAz
z*~6Z*p%Wj|C?eaNIDDbec&r-4CII;P9TWXTz7n6#X~7Yo13U>++y}ZFz<$IOm`YJd
zK6VD%Z7mE?7pW=8as-`Y1kH2?y({)Z@94-)?WKUNh2#l@PF+3Th0v1W00{lmEI=sz
zbe=qW=V1uHV|jle^Kky=ea6Y9+B{6^3=>c@r*3>mKcNIG=M7}+-aXwS-T9@Q6=-=&
zu%PZK2*ku_E;dx)JWE_!T#Rc1yRclxQg%;|leFhK3b^-7$LoL$D~GI%%bTZ`(G&U+
z^-Q5Bp$TMEy`Z*4Jw~a)W@&J~j4K3`XHEiTTrt)-0?Ldn1q^Y<_lxLp)bnTYo~$J>
zJ#5fr#7B-VtE?75j@=%dz|liw(mMgmD;eeQ9V+UEkA<$v(OdEb?CKq;Klw~nWyxm<
z`Ld3UK6CO!I*gS=UZFt2ez=CgTOtBLG2-F`=c=W60>pW3jT{lRLvJwT3k`Zn#8EQ^
zi#8QO$r5$Mr+h7<4B(^;imjEN>D0u`6anWKv`u&<ZpeXV++MH9f+ebz2+pi>WNS!l
z46QC{#Khs8hJk-%HG)CwS#iA>pCw5`C?L^9k$98st)}^w&256nNx1(`ED;q;5)c!P
z47n;Xhv1*Hfy@U^MpG#Vrn&S{G``Wip}4@ph)<lj6|djt3)D`b_(Sbo<9+3@xW4!D
z4g6d<7nQ8W^>00v>(uErk7XCQa12O>)-PlNDM@ADewR%^WA1qgO>{Q92cw&y{ETTo
z$DKG6weEW{zLoqT+^`Q^ChNYtY_!^U$s&1CDMO8_;Efx4-7~#ynJLBT*=Ig&w_b4M
zwK<b7!rkcR6L+}0tt{4ocnq@5Kz{;|f)Xw1pb^CQf5N3FcK2MoXI|yV@G2?yOO0PW
zpg~72V@_F=Du>7c%*lqbMCl(8#jv!xR-@Zc%;|lftKDaH1zUEjdBD`h^qDDnD=iR`
z0o>p+qU}ZXGMNs3mS<m1z+6@2+CmIxViF@DiKaCFdun*M=rbGoY;q9PYt-p!6<Kmc
z<ps1w5NvM$0~Ye!PE*|<m8Td7R>b=qyy?La(Or*4;iJeq^2Hn#>7U6TLAT4HB5^qJ
z^H7$tjMcS}AM2CHI7ytu5g9QuUbo{NA#CKh*^z?ZnbN7bN3qGP1|toDC<OwIppx63
z<HF^HlXGg4IrXZC;+v<+(-x<eQ+0aPCq8QEF(}{w=WJNTs!eAHK}ss}Wgrez!W=m{
zeNT{Q13>^lo-&D-sjY?oDvyV`6c#^=MbRj1j`{-;IX=MTXI6q?kniY(6Bki<V;#)+
z(!0a<!yqh!&YJ`0tQR<)racI$VK&6#bKmzQpUL)rt0l`vEGh-QGANn)GH_D-@8wGJ
z{%?6@`8NN@jXdgf=iDFmN~88no9<sK;m1tg02Mp8!IgLe*v<gTDpC0Y$Zqf|0zJ%F
z$F2&g5a4^Y_065_t#?VId$P51<h76{%t1G5(v6lbHYXe8=}J3w)yYe2;~XzlV)X7k
zC$bZg0YTH}vRLNBh3u+h-d>KMF?{CiQiE5Y)rWYu@o{l~m1JKaS>qjoc!dB^v&19e
z71pu`kpdZ2Io421zHdpZyyW|~SegmS>G{ymj_oOpE!X05)k)>rTy7}|qSpso`}I=o
z$J$2B#Wv`2MSWEhWrIugLd{Gyqknr)J0Pr>W?It~ZckMh=O}?Hsv-sm3kbCLSp{Rw
z9auR+<}ve5?iY<H%NN@;S#6^3ZpzjkacelI_2)Z#`}TBk3zmpeZ}o!q38}@$uQQRP
zj=J$+|5vEilvgjz>{bpXY&x{bv4hwP{l|~ErN#5DosA!0q>X*}^L0a<2<eqOwa<Np
z$B$kZG>%B^nQ>|kIb>kED6AYeptTvXJ^kbQ<|Yj50Wets96aVeDa24ZYFdZ!*Gj3K
z^K%Xh0rOos<bUJLBYwmw$POhMU{7r{$@~KOvYUD)+kZVOjRwHvyQO|~E%smKrPZ~h
z|3|gFb{qfYMjp=pA`W&p*Y|6p??#aWq8wW=w9cfH1sg?CNGMVi=}alk2sotBLlXA^
zeKMq7Fxo=-=;iP9(9Pc5>&GmH<i)u$s(`u!X;M*HP|?(m(AXZG*YSG3x*)^V=twfi
zb+p`e&_|Pe_f$ufxhs|y#I}CHfrG=LHw=8VE~798cg6C8u(Cq2Jqg(ptSqoW0agn<
zf5=yxs7B&TO;afmg_VWk^~U<HGOmKw;E^^7NjQ5$Wgx>bjOmb|9+H6fh7q^Kx}lM@
z^q|@;gyP621sD7dJS%S4&TW>y+bn&zS^9o~S^CuKQFvuT<4m05to6&-sPX6^IH+kN
zgk+}*v`FHwA~|3-6s*;l0t$Jwb6TXlg7bf}{*Uti!Hy{nofG#$X@Doi|5#c}>i?E1
z<?1c}cN5QD;InXbg<4$>{r8Jz92EKNJ3nD!n={LsnT9_86wLcl$^BBD@-&(@M3Za_
zBX^lq1I|yT45Yh2G_5tE^jEY=q&_fJO<7`fVu`geCBBH$b~*F3l|jGPr1!NV&*`A;
zd8cl&(CRdW)~+neZZz>E9rLj=?qfCc494K-@c-(#vv@}5!OX)LjVxK&l=r22!2>-1
z^uBd9Og$6Ne`T<Ei9Ya<Ut3$rJOA-X#{XKu_`fSxHp?;3ul)R<di`yK)fxMk!2gxk
zs;T%dmGbTV?~Od@bmnwaXcxbOcHf?l?)4mzt4HoEr>KG(MoMMJ4){gU^?HCPq(>NG
zxM*eb#LBDou@gFNB*=?m(?xqBHo<Z}1Re;TBeWAywi-Ge%(07sVoqJM2{U~mi^ix*
zRzPH7Ed9rDc;cr~#Km!#MH#j<a#8uF-r8Ynt)@tUCOd(m{lz<Xx=O`{FzLXYOLDO6
z#Npn#!(K@h+aClkah#5<AnzZ@@~NG6A#gu>z>t0??uy#Z3+qs`$}h$$BrRc$v2n^E
zcE-bP;{Mls|HX0a0`z|sM8aG8e*@3->#wt?&)mlZ`d?XHP2K;jEZ^S$+{iPvr#wf^
z%u4r+2EC_2*by;X+!@VW=TswXnrqZ-)UTZi`x9oswu9QY(Ya6g_F6R7ZRfc<P4D$%
zoT6X|Vh+0&-+ylcD4}dM>J4pjkE8h};myGAfLXp)*sQ#FGA__`K43#dbuzWwUU2&4
zkNzC@r{oy?_paCuhVB!Q*LvSM(}A}$y1-HMI(7oQxp$62*Hv!ZXdit_86*W9-!fwP
zP};~-Dg(X{WD_zR<KkG!K3`^}|64Mn?W%o+tH>jrV-%8WH^ze_f8DsDi>{mzTa6jL
z3I`4-J?u$;_SjwDwFs}%)Bm{MZ<anL#eXbUS5xsH%avRDe-jVJd4Wyn^b{w~?sKIQ
zr}7^87_E$h@{;i-qXTQMJPgXh3Z!|&js+nVTP8G2w(o-&o(){-YG#v3b!N<c!UE^1
zQ$rEiOwWKhYLq+!q+3=x*;f`XU7(5&v0@=rIM-nppOjur4<S}`O!z;w`<Vbc6hB3#
z7?{po<gN@HK@RTbI#0J^1cj-iC(bL{yC;F^ADz>`O^WTp<Z>bHw{41;%m)i*>RE0D
z867DjJiP$&rnkd^Q^bku4k8m}=02L`-A6HSx4!*yah!Ko4AkV`Ou?{c2uu0o3GgOI
zAO?1_+{|OyNKC-G+{vfvEXAtm-(o-_d<53(T%h#$8iOn%fbcF}*#^e)d*H)0jYXw-
zXE}VkLxM?80r*_vv#2C(3^=3;l=)U=95l7iI5MBpQx4fU_mZ0XoDGS|b+eP`RLa>k
zW#FGYjQBSJx@%!VkI^tFQD!UJQ&`G4!BHvNW@SE`D@9S^->OAmQ5M-JCcw2A9;@ss
z^=`6NU~*3)(v(Q!9;B@lf83?-#_&frVeU{CHOuRDA{EXc6K|CVE|vp8=#r^e54?^#
zydRXs9Fm8bu^-4A%@|x#+dsuUuv+oY-1^*4-&PJ2<t7FUnQJ8+ykJF5<lVjtjp$$m
zP?*}YjZH5aKq?tON(Vl~p(=isR}QAgK{w;z8^7!0TwhlQi~0%COWv_`M}QK2H##0i
z&z^I<Eg5dL*ORXCMGLinN+Oi)Yr9eCPIJTfxw(?t=cb;?_8-e7%dfOVa?gwczy$t(
zZ5ep}1pkk(Zu$Qkc)sYEinF_YUDz^2s+s%_5O=>x@ph$0C<ZAq$|ju(7s`!2f@7?s
z@)J!N1@K)r`;fLUnKN2IrUGH4I<`d&+gn!ZdFJfGdUkk%fz;Csy3PJsQ~ADp@?sex
z<!gC9=Q&+iKH=!OY&<UPCb0KWKXJ&z%hnmUE)ROU$HUkx;tlC}#Fr3*7&MU$YXY-@
z!H!`<VmR!@(q4uxYQiW8j&$m&mhnHQH#m08$Y*mqpDqNODR1##z-%ZEtV+M8xve>i
z_Xd!|H01;rq1qfw5dCRzTJX1p0lJ!UY$2<BlZU`DK9Hx!ff8Y*cM@LoGNG4=c+j7j
z!bH$Lnj<6LJ3W*&D6Rsgawx)H1|A9nK5$r)5R(*{Sd@5or(yu9cAPMbnY%N>^7`VY
zY;rP3@~4*F&`OI>PS90gk|FfT;$9Zwm=>^9SW~63mXmZlPpoJPPv@YeLV~?DiLT#g
z(t<b_Yw(kiCcU{b^M6|%@t$v%X-ApPB`L`4ELO!DL9&h{lJ1|-xNk1m-(0deJHnKT
z+J3B~g<F_$Cbhrp%f}%tsd(3uA)H3x2N`+}p>DP72SZnd5kVVh*X=~oWub$H=rV-t
zAQ+5#j<$~a5a1s@8I6(BQd(_ta~zY7BTudGyx4nN<SSx~lST3rHiUsW)F26u8@2t~
zj|MeOqq-7?!t}-7=5rSGVneYd6Kfr^Lw6vujjy1DRBISr+=47?f^0(5r@xkDzEH8h
zzZJs~jK$DI(y(N-2jhvQg>-YOwmk$LI#VG6FBixv<a|rRk$YEF%8;#ANWY&7&6|b4
zcsP#V3}eJ9HOP+F!K(}$Vp4*_XWYK3Ot-I$^Qfu#EWN8@f!kz`7ak(BKQW4nxEWVC
z0n(s+S-?ynNuGd=Bw`t5Rmdxk6}r3;to>Cq5rGpe#f?_yIT0GFBt{W1ZjJiO{o3AZ
zJ`o7e^92k-M-i<|Uq!qox<8~VkitT&hukZl%#bDZ82oc1Hv^)SW3?wlE}{J+F@v!`
zH%m)aLvgH#fPPq*Wv%jw%15hKdj3=~v1jaN0dj<g9$zJSDj8U1297el+TFaia|<bZ
zQA|vO)9VBjpjaP^Vm<;wgzL3g+lo{~SK07_O_$8J+pIl5plmXw^^N`dn_8*%<8FPg
zCd!%QL0SF~kfD9F-jPwDdYVx%dx#<vNbQg!I}cC;b7;5De7_A#G9MQ6c(_yWG^Wka
zzoPACGI>F^vcVZk)nwxSa$s%B-ZYMAEM1gnEM*f7Rn0z<U^<-qnsQ`Cvn^UBbI~l!
z!I*fAD!7t7e>&zh)mQddh(T9K>yw<xG-Q6<PEP2_a`{M*i^hJ(8~)EFli%bsS^ra3
z{y)m>|BC&8D&?iM)ctRH?Kc14jXWm0AJPKy1XAn#%XR{~^&Y;6_wd+=_7(kNqFQ8f
z_~^q~f}`tfdT?fKY#lU!UllLb>svc-;1@W&&<#k1MF&!E-TBTK{rskbFRN(nvWYin
z8+T}r=T{JkIUWSLdcjc2@mjxxpvQ3l{e-RQ5ccP2Fp&28OWh*gdh&l>PyWB+;Lauz
zSbl_FWbnDM<YNA{di~#x0X)Gm*_mOH8sN@k^V$2D-l2Dr<PB~kwEPNqEEx+AH4L7G
z^&?+f>FG$5C(<+BB+bP<n;aJoW?j**q@cf5tL>uM(_{|F^t@u4P9G4tYsZ=p72hZk
zwO-8ohJY{V^`$~9%BpR8qNoog8(bz+7^S0iFuhGCkdnP2Nx*P&)Y;At=kaY!h*W^i
z+R&Qb$Gm-!e>$T`QMbGFc9(uZyHpUqj#)vKl0LpoF9844Hk}sg62y5!fh~FDgq<FW
z7(rLO*xB2tr55A*>A>gKzI^^?a{R{%DgJ;fzgY0cuO|EdEv+pj^naD*YWY_GcN34T
z|Kk|o{Qyq1Amsa%j-feiXW+EFo`>mrKi7$PQG+lYFzr-w^pgYqtmJ-K9T!NA`J@?+
z?Tbd@Q*M9cBd^W=k(lbzl=f8_>(JF>6yU|jU9+eZ-!h6k*!@y*!?%@i;-M%f!vdgw
z35hMx-r!{Mnu5q(D0p0Y5H}h<?XUltNdK$l66SI&arO+iL+SQrI|?Sy|J7>B|9@$D
zb@i71-^9c5e_7|$^*+)@<UA=9OAJ{!&VvPDI&v{Ouc$1tS)I<Of>ea^eIn&|F=~h?
z=tc_c%W_v#r>W-kQTcCITUxYhP{|_sB_n&;g%_BV7(@9kX0)un=L~6OVx8o8pwj-%
z=FSt2nv5!O9Sga``JXz{zQY^JWXE`B{tU0@C3sb8Vra@6Qf^On-hwJogei|bpOttE
zaLS@;x9b42jcVcx*=pxSaY&!b)v3<qs${G)LjfrNEc8b?Re54c2F7fSd@(8adhV5Q
z+-QY*o_;+Hl*KXm$C&^GN@YJ9^xO|_Psf45$J|Chvu<?EfNA!ffl-|58!Xkim2r$u
zLGp$}35|B(YWeYDPHi}mGwZ_UNLMG(DmIrpcWg6bJUGS2v!B%py;7Sqwgbg|y^-$Y
z;sILQx`vqDDau(eKsC>K6v7v5uR=9Ii|EYpyym^mg0!2qf<Kt1(1m{?-D3g9U$9_u
z#M3%7c$YUTz13%#6^t`~PP#>F*w;0ydVE62x%Yv?!wZG$TbZke$`oUijEEl1aS#m`
z^k3Na0wHpl@1qYBDi29nU|$cQl)l594%}C|aEYBL6;N`~;!Nyp!@phIi>z&oK$MsZ
zFgwcJw^>Yrwc&y|UDW=&7hD)}G`>DcI3D%v*s*uTeW-Mw-h0HG;P7yqzk0m81X@{a
zr2_MIaEf<@Hg?%Z(nN$B3!iI7rwj3dXkmFPgn#a5vi;|Zig{FGyPPYJ|G896`Ttf|
zmu}_%8+m3><HnpXWyAru+4nxWod!iA_~hG8mqdIjt4oh$<~|CU`Du<`KT8-sDRD-}
z6`@kU1FB>N7f}{ggoe#IrfK>l!iOyOsA{PqB_5)4nPz^O7JhpIzA6$2l#s(KV5BiM
zCFuFnPv@3E#bAjE$?RgKA)_wOA{m-RbvO=|b9Pc(GVqGm&8#nDzpJ`p&dS7W$0#3n
zi#(H-J~`19QTeOC$CiogIss{zS}@-eR$S?W6=rJRIL6}BVBHdjev?sSOFgd-vRT0o
z!akg%OG_&&%gaku*cxkVYt_ms9MA>5%EAO+D#tpE&JV?T>c&+C$Nk`j-5xR!$#F)h
zOI0~N4C!|aQlj#!q^o+ez8pH5E4eb23pN(hG<1XD6LfU0)BmOYmSxDLVK0jL`+idQ
z=8dhL{RVpwWB9%Ot%d|YGO7F*wV0$cyosS%@jeCQxLGc8f#cl4%Tyv>hYW3p?#JQ8
z2sdR@wv^6g&Qoc!-R^toyF>$;OLS2d<-?2#%9?YrhH@sGEEGhxi|t0xA2`x83VYOH
zpu1ieVV3yQgiRnYfK4(uG|_+z(92>8lQbs2aL@crW9;WX8-ESY<oo|6?f6sb1;OCz
z`M=er<>dW;6@Izp|8C;BD_*F(U}^D>%Z@1!>pr{b6V*kZYCO!4yb|LDA9RpM_==c8
zeAYHyYpA5RR_aFz92D^#a~p^R?srtwz^|T*aUqbz3{Wxg0TVQ~!yt<6mcDQsJc`Pu
zM=PpV=m#UC&3}4N?5foX2WrzN^)MjcW6Rs5QZ|uFIIf)Jujl8u@VAwP-&M-MT3|H6
z1{!B^F*PC+aSruA6XU0#FU7<{$a=Atw;V9>VusJ9@3vuR>ikAKhfn9Rm;E#Jv*~#4
zAt@#Zto<{(U6b7$3a?{MyzwD>^jP36dR1@>=VS%%`6D+~FsEmXLrTL9y3*P8%uB_N
zjL&OQ@K8N8E}lv)K$9ch@W5BDJfREA0o#hZxF3o7Chb*~Hc-wl?L<pII0ka5R1$TC
zdN4{03rnTKo#~b@Vb-TDR@4Z{?+Al7BqlU<xITPT+HU4RK0Tma`ZVy-o94lJ4D)CJ
zWh*uzO?!M8frc8i&oN15Q_|isILQqvkVaw|u-bCGldGx-O#e(d-dXFBD<!G;DM?oz
z8oLsKJr;pI5P>Tu@{pHAA(bKB=Go`SL(L<P4)~dl)vCSRF;%*@vP=Wuu6S#^pvy=y
zflzvTS4AjbXpj?yRT&S8qkyi`0}i*~Xm<)#Y9cD)v!@Y(T;eMjizyX?H3oHMtQA{(
z8_t;#9JrX>+Dtn|ozJZ^=#oJ~(i&#mWYn2UqtoTK&=^!izpiw5v+STOXRo51iS{%Y
zH-zz9EOVPo<uiuQxXASrH(;u@E8KQZs%qmssa|aB#fEPg-sK{5UI>jeJ|`70F{*f)
zRK?7Mk10+e>DrZxag1$yD)^VNi`2I1mUCAQnBH>o14`|~CXg7B3O(BJvW7z064AZN
zML#l&K6#-F5-AGj)3!Mc`V=&(71CIwdE{MGN9gr?l5iw{_Ee}H%b|@=F^tM|;kLE1
zZli9;p-#D&J{8Flnn;+@er^%#i+(1{|K(E4iQEet|9>_4{-?aMmdyXOR=t(~Z{)cN
z`+up)jl4d_^>dp*WP&iJ)Gh35O@ody79*+5ddmhnf?7zawl`xciim^!8NEe)GqM%i
zRt$9+!-8v-r=U+n$W;xCHBBdDpu}_(-kps-;{hVDWWL~v;-f9JYAP+O`6vdbBM?wv
zb}nMw{Kz>{Sau!MyceMcxis><KaE@tUvAqrU{_p4#ulLY+CG0n+k=33csB&l^`+^s
z4ojZA!LhEa@V3iRysVR>7@{MFL@&yy_ykh&6Sp-{^5!MR@RBAZJj2MdtGtvk^@;q1
z&gsb{O%zR|ZF|#G$P2}uAcBSfB|P3A!1y0<!gqv7d{KiF5G7Ed@)l9K<x1s@D9gE!
z|C^)LXe>4^+U&yw)dU3v!8u2^8pNtA{JePe8BDoC8`+}4#W`QtEPg^tPU}DzndZ11
z0&fz(<fl9h2mr23fLkAmo(n<|ImNUCkhvmQfp4Z$j07j=d~0X+4WU%UmhEOrsHmHk
z$de4)A!GVm$Vh<eAs~T=4tgVnK)BYJ00M~XVv2li(<({25s%$3<q&8AU^L0Y#=cBV
zZ%~%DIk+1zwK@WCQa74?)%v-QtJ~*_pUL(=YnZ&`1U+?27(1yHojQX~YZiWRQvR>i
zN;3Z2a{1Q&=Vl(o|LM52j;~`)Vtgy){Y7ikJ{b*EWbfV?QbQtoKu;8MP++Y~-O>y~
zukVC1+>N6~lyg~Au|x7));;vXCMSE|(eaQ~><lv05sU^A8)9UFNZ5>u)WE;r^M!R)
zqt*gnTXFSGn9p*uD87_2K2@Aeu~%E)+}YlG7k_IRtKh5n-WI&Kb8A=ut^FXk6voCC
zg+k_cI~9{OQ%Vg9Vb}|fN*E9nPVMUQ*wT6e6p&ga=A5c@spIyXGYQSC8l6_@#62tF
zgk)Kh*DJexJLuybW+a`Ratda^F<nT3k-n?Qa}Hg^5qpY>CH*6cuSU$aK??k{+@zp#
z<<&+Z)&Xf0O#wEO)5^G@8#M`zs<>J|dml;D;|f|HtK~h4HJf1{ZS`qtDN~-8wS5e?
zR^LXO9yGE(RI_eSv>6Wbi#$s*x^f)JbX4Z40x91Wn{Lk?>X5(83t7?36%b(Qt?{eM
zd$Q9$N_dpADH#%-sQ^=>mfLnlksi19O}Hy0x(h;g7$?aHQQyH(dN}3IsE?`f5W847
zZll@_ugOEFCnLc}=AsrERD-4RRu-6Vbu9)1075F(X=hn9r=u>ZIe-Qx^ONRO5`0!F
z17dn}Vkc%Nvw-Fa^L~ow_q|X<$hX>>TELR*K+*Jdia5~OWHZ*bUf&|$6>&5qk}F_Y
z&|eJ22K4g8<wPgY!9sj%jfs%_J~kX7qg#`rTbi+E$6I+J&lf$oLL4l3TP0BuP^lHz
z^T^*OdYz|$fDLlK%8BS5rMvTe_*>!mCE<{hpLaSqsGX|ATB|7KtbFJ@19|C0K{P1~
zC!Xs!PV+v8cr}^-f2{5QNsVv;FMx^sf3=$Q|6g0V)&Jheb64yPhF%}f9)+3PJDatJ
zj`iBY0Fb^b-L*_|LE<@v!61OM>x@l7duKDT|JnWoWKk{+ZGurG6@+753y7uqa3qbJ
z=4sn~TUihf;T$=%Re)1DA5fu(bJ*ZB)Ow2F!#|~pcw&9|D{)Ftw`MFl<v?~y--PVi
zpWRI%FKEFuQ?H8ZRmhM=HmfK}&b+EBDNc2x2O&=%AirqzH?p<lvNN_|Dm)P7(xb}b
z$^&%2Qys-N>tSXss8cP`F0pD>r>I#Lx!sY`eP$)>P2~3`E82XuX?3%<#n$}G<;SZz
z5P(lB_<ijnuqb2Al?PaT;@o0mtft3Usa7978Ut|nyheo{UkLaNM{MK)H8L5d*8Nx1
zo(8>;Bck8{eXoNKAXIYl%2e^6<^1KT;P)kQ`Gu-HPz^0TP_0e5c$1fInf}ejGQEIH
zRA@z9*<vm|Fb%FeFwIWA$nk|cM%Dc^%T@*wmo?LhSh}hutBA^jrAsbbe0D?R=To!G
zT2Fvlnf|R>?7*z6y2jwIT;tlVJ$^u4jOj>k=9}gJCfk2JE)7PlXf%_?KmJUL|G1XQ
z|5911uHEwgH}P=%FR^>@e5>AgC9KdH$_K-`9K1Ov43h{{2lW`WdKeVplQH9yzi4Lj
zu4n+Jw&A#QbwV;-h+>9uutc)mLuDMQ0DyVd5%ALtx!p&aF_(!KzIkd2X4n}2lnf0V
z`xfaT<8(3ZqVM+7#Zc+>9g#?&{A3%g>!D`hEO8qybss7zWJdmwJu_y#`ql_IFPkCE
zve&*FMb4272TA%;1!&6<;(8!SJau$Lxx^SAaf<|PvO*KaG?L225NlNr&(lC1`4@%0
zT{8~<^rELN$~DJEdrxAvG-!{9%Ff&Z<ybK3j5cD{wwX<=a1+ze|Fv}Nj;qc8zP!4U
z(*G>q(*K)zta}U{nMHX3T8S=#Z~%M5RoOB)J0corxuhYI7(%hURf%Kg1E3?OpC0vw
z-k|52QqFMbw2#s1-)Xmlup`ly2#g*@3v)#CjTL1)obB*|(W`?;9W8V-qvOG&ZmUw3
zT8|<|#^vz0E}IQjp#`a@KypS_Rm#caf(KhABW~?%p%H3k6iQD)gT=7MDd0|LX|3Gc
zz85P=f;*ebh_NZuIpWJYL;NAyOjTo*COC<_R=#PNF4AOG!Ie?#0&{gg4y;^3aWb1p
zaFqj(I<;g|8f`JcJYvS(%Ee+sSIW7cR`V+{Tfo;z%XoDM<IP{ToF!8U3=G_C6me{m
zx`b)Pl`S}SYL@)j(*(aW!;&9UHXe=CQ>-sX&>|qj=?Eng(igIr*%(;Aj?9ZJeL#u~
zeDp%5!F-sN*ZoD3n;*1~q`13g?~&@F*fAl;dv2Gk4DVK|wrye-rmtNj=U{y2T4BOr
zAVum`B6`yCF>3^t#`iY&*~N380nih<&vbSaM&qooJ5VV*?ay5b6A-$6m;`4Pw>`B^
z6HPDLp6c`pHxC0w1@gmOD!{|si4#SGDipoWCW$J%d6G6xhYK0BP){~S3UhG48ek^n
zyFNFj$@jlYB|k7BK!U;S0>A|Rzq-7#lH~tamX~k&|C@MH`2(%R7QEPGu^xTl@i#te
z>@cY%VGjUIBJYt=sPBHTlQx+|SW*GAA~trmU(_jKyAGF0ZQ5H-2Fm;;W!c&%JTuv>
zdd?BKDJcK{j%_1L09k3~x=F3DlhhQl&h$RVK!lq#D(Z+Ls<+OtJ>*U2^oS0vSr}#1
z7-wV+F>+a@w2+bO%6%7y2e4Z??#Y*Cp=M1rlgWbUTsM^UB`4FE@w_SLZ{T=Fm~nXr
zXO87(dAU>cve5nD1)~VqCK<eFwxlzkn^<4NGx_|lE>_YSz|ztTEWjlH-?ioB{m;@`
zb>;T_zlkSL|A#`}ox5=*pw|`mCq#9o+zHa(@xCA2FDj{)!)c;6P;%&;3x>B}%WVVY
zh=ki83}?)?Ii29Wq6Kf#u%F=d2}d*xIqNxP#iH(wh7(gLVA0TRIX$2Rlo7}44|;f(
z2P%4|Oe?Rlx?EgbzcllcrybOC&R>C=@Y$E4CTzIuyqulGW;&3uIxK_38<QL-cEIye
zmh(BEGIKuqs5^F8m9CVVMy1KNK+dTnog7T&Qu4dyD6;R}k8WH1QBMGNAO9DH?T36$
zw0oW?DSKeOF<h(CETQeJYG}+z-=GH!6DorX5eeY`Xww($I(i_bQ<wa(<~|vaoj)y$
zXMd1>yy7sS^-(imC14a26sF^wWq=g|*+fA7F@|^SVtzqDT@+Y^S)_&^Yf7&u5AG%6
zPF4P@j7+&2xiH<8O>jKGHLbr$uxwLN0K1=Cs&)lbE&u!<!~ZFxk4r>;;b%PmSE*LZ
z$@u@}O8Hj*b0ZJ%PfGCs*yMFRHoFnsk>8eqSBVP@2500HBjz_21gy`pXgIwO4mrIx
z93VeEZ!ideX&QQ=`v7Y|l)v*Ij{1Pei@?>9ZWnpNpgTN8PRm2ufIF8m<#nW9<auLL
zY<X?hkK9GkkRtKM&hESV_Dj)4<9*nR$US0zo{u3$*b;%1$01sy=m6qU3nPt~BFSpe
zJ#~WXLKn(YI%}Ui(E+4b7ouXp#6K$UB=z+Uvd@@|8dXLEC&Wp`-6-VQilj;OJXAJ!
z1s>)wHYcP=I%MjUj@F?G6^;O7R7B!^1icT{MVp!g6+aY(KZbww3&x?3TlsWulR?oF
zbKF$i`=O`31L5C3lsSx($exNbnhJnQt{35v9-Cd&_*D@1!mv*qNyytMGaYKDoIJEJ
z9ZjN4C0Pa)CI&pQveiRTOcs|RSra9flEu*LvKgTVWW3;Vs$c*GL%01QQE(+$FdpwS
zR(3U67By+i<HrlGrDub@-TPih8GE_VBjNfTyI|U3MaG2Dd4<lU@`F;V&v9TQzM4UD
zK<h|%WdLf4vsy{^iNE$Ro<AcNM;U$(XPgtlR7>th2Qa`6Eu(4x=FZ_yiWgI=$m<}r
zsYq$V+e-4hR1wxBJmWp3_tKfQlVsW07UKElgvE(%5;gq<qhOSRbG{r6MzYZmJ5Pi0
zlbp^=m!b_S0!woMYE<9Ee{p_Fg3O{FP#<vBwq+FCqkao^{(a3fdY$`b_LjQxlU0Jc
zZJPMQ6M$kWP6r)3Y!GTjG2F4~aT+M`qFWIb<+LT-EYe!vez60mg4^rJMc=3c67m~0
zJ!Y!AL6hDR(KPuF@B<<qeww!PRHxB&eWv?bkD^guMc!mns?dd9R^*UV>gZLmw3I7{
ziKd0dS#$w!vM}8D?_15Gg~MWwgWVJkbz|M-VEnQv5slhy40iBA`jAj03^Fv$ii^c(
zfr(D8obzm|^o6<6#nfN116Mdlux9904X1m72z8-InS32DqL2j?qfRbDrtanw{Wzam
zQh9IoWYm=UYw5EM8!qE;p8mcg5k!*)##@+vo#tv|!-7t_u_xJGWL|FE1qP6g4TIer
zQBSGzNreH#bB;f<ZZeYkMV0Sfv4NOOKws!3_CyyB)~53T#*gApQ%07jR;OPU79i(j
zt<)l1Xyr)#<EEkk=26_f8w)f4sdR3UT%f=9eo;0jdfLihL(-;BN8IN(_m!+k7F344
z?hgVykbywnm%7sXN@+@YBaqt#0_VzP54OdqB0?Aq;!h(u#yzrOVV#sZ-C$+Q&<^yv
zU8>|$F&bKq_i83p&_&XuAs${wB_aC>Gmyy+&f|P7N5ICiV{u8<KFsP#E^KU(6G1j4
z+0wlk%^OD%ac!O|-mGdu(XphK++N4{LFY4fVVUweM48F<CM(_9)IP+Y#b;O_ayc?y
zY&he@J=LWoQA67^hA31CuRifSzzw6LV*vGVdM)iB!K_1q;cBXypN7G7lt-rt%TY4N
z#xsYh%xz?#L(S{PW)KTxF2e)jAB*B3;?awO*C`;0C3>o;@gVSgn)1-;ofu;T?J^YG
zzn1mIr#LG*2;HvtadP^QNolnZ9wwdER7qIoO!+LrVa4u_$D*;Lw4b<Vix}O8rvblC
z;8F4#)mPiG(B0hnA&2JHT@-A>o=%`<t#h_+gu|Og9(?kLiG`A)s`+lx-e(fmoXz#E
z{Ux@Y#<>9{18l05#9(yIc31fTY52#pnPoC5gb0&r>LFlB^hHt~W<@NO=W99kAt&a(
zEL-7a(T1nl%M#0kK_NI?Yn_x^o=r~1WxzJ;mKlNv5ixeJk+=Sn!x6=21Cn`%^wumk
zI`$NpUDg!obL&8V&CeM9e>j@e(JSYf<o{b;OXPp6z>lR{{r^ooTK~^#|7Zl~^WvAR
z?r(QQ3{91>h;>_~UM(&@)Ly5F_jp-58sNEaUvmle@kBOaL!YJ|9ggxMK(_~!5%2-|
z6Rh(pI0a_eKeOD8rHe5MKpz)n^<gjSc%izeg}+o7B(!`tl$unYO}4(3eCfbB^;4nR
zo;+cehK?y>jONlqG-O&)=#opR!8&MJY9#Q26_rwdkczsIPdr;B*?QOUM*~*$g3!ZX
zWX4u`F;4Swb);_!w+&+>ok$(l)A0UJo(wQBVl(hnUV!-D=`KHd?33`hx6Uu(8E603
zA3VI0K9I<-t*zwIe|!@3e|4o={z|M|N$(S$Upf7su>Oljz$hO1K!z{T$At60T&^bb
zzm`|Zx99(jJbZvWxP$kcp6~YH*Uvqq+vf(KjQy_|qbuuUcKW}vwz70f|8L?Mv;HmD
zZy)!a@Z_>m;3WC4yp;6+D=$~dxAgxe9+Ex?3G{N?CZ(SUB|v70C7Na_<~<2&7z9Mj
zsbcue(!8Q7GggdiN};N4YiTJ;a&A!_V40eAavOHIQCqx#Pqz9_s^Z?0F;=MrU(rw(
z+nb|*OBnK>awXz>M}DE7huPXMW5%EqT6Z#_Dn1=!+;)=EK7nY5wpr&kRNMWI9F;L6
zHnmH~VvZUp4TPnyR`=#uS(^oCu4F;l1ZP#7!|}xIf8fKdg!OB9#?b#8vj1JGR+p0T
zpURcx+xXu%^4t~s?Vi*pwPQLjzUDg(kyOxaFcn%1TZ_}%1CwD@ruMJL+CTVt;!2ep
zCrBi7<Jw0D{j9_YgUvmmS41L{cX*%7B_7A|wElclK0kzdb9CD(x<SBy9NB;HUD=(1
z(>}qdcA@*Hkp~k%kUUyk(eHtrfABg|?WQ}2ZtmRioxU4EIajzJoL-^?90{!Vi@kpG
zgi`o8Vd$KR%<pu!IvO;!4eyw;)0B~xPGig9LHLQTr?#Y-a$(S;pdvC7d{mU-b5O0T
z-U&+T%LW9P&K!?T^q=pYI%g3YacC1BCp;SUNtK$}J@wVp&1!o(wzhDG{zv@R{U`?f
zL)nWB!=CG-P7o*;mS}lo4FNyY!OC{AN9q@h+cyl^oUG%*Kj8oq{`Kfz`u!vS@sUqT
z&!-F7a1adOJ^a(+U$I+hnA;;8YHq$q7Sz4a?Q{Q52L=g$iO7rkE*Vxtee-ME!OSSw
zV1yUnx&-}%2}PKX>t|?$TKgGC-8vILV}tk)_1QX$+PLkk7x3f6{<{aG{F#2|c9Qiz
zBwpCH^hf%WbjsWa{LLC>T?Rhme14YA^i6Xos?Z63g*hD~%#LYcskLKV>*GGX?bGja
zuJUKM7dY?|Q}G-l=#MFf$1&`=NY_W3i(`oj$JC2#1J}8AChV3lmnfRz1Ttfg`*DCf
zpMSvjfqXI0Z-!?BK=ffx4Co(N9^5A~@fWp$nR*0Z9zz9w83d6SbP)vxT?Sl^Ee<oe
zVqeA4q&;@zeQ^D_=KykmPw;T&vin;NXl~$yK!mWJ`3hPfmKP{dB;6hWNunG=Zr2(0
z*gzAv<WVnZVS*Cc_KOy~YDkx)E5sjHVvH(UJ<;~bplgOnA5YZg=e*8>GBeMuVimPA
z^=6Z|$;DtQTuA15z^Oe&qjSvgzy$CKy)~1NKE5zrXkh?k&2x}SX3Sh(x}fz**7s%;
z{v6=dNV927`Q~K%q1y#KI%d!``_3T7i*q4qj2{fiVh)N+10<&H4^>tUj;IiX(gp|d
zst96HuZPq)ZeH&B7I~Jd!*)K}jI9Xr%7Ah%lPx|pp)irV8@FPd#?MDL0lW_y43xz)
zwBij2i`lX;bTMTb43zB^q&*r9WZv;P%o8@U!1=Jco{u2F+d*fLF$4=6GKWAm#BAdh
zv6&%tRo|4ZPWv$%Y-EcZGT0=Cbw~K_Y33CnmPGG#&p~&|4w^~%9XsRismoEPMCtX;
zo7yJrw~#X=#cYK$a0hnxanNZtQ+Q$<QBnMvA^KUERfW<6H1@!0TMN8s?d6Z6j5nBd
zI>~I<b9_3Cz9CyNwP3gyQ#avU#9=eo{&$+)A2+}B27H65T_~kPk=5!S4po*!mSLmF
zJMwiw)xeWOIT8|=`B(f9>kT)1dXS1j#O-XQsa?vPC`@Kw=9ll~<*YS`IWr1Twn&U!
zk=GRd4}|soTo^MfOcb9}MqcX0xpmcQ4;>0}j&SiwPC`{ZkB^+lIp9L71?3ke{afdF
z<qyU8!1Jd}wD3{Mq!~jBdRc(7x_OSO_$U)-x=!E6jNk6Z;i5gmv`rUfdB*ZDgP@~a
zltv0sO&{l$J_r&1=~LseI}N7BU`tz-EU1sL*BIU8-W8M*S;%%r!^Gy2`-&~pdBaMY
zOjH)e>uJMwZbKQj>m9xrpII`cIXm}FGsk!pjOeI6%6fpa$|M>(0dC+hZqLkupjF-~
z{VkLxXSBqa-ot_eP8#R79v+Jy58)T=e2&_TSDK2W=p}%TmK518nP_Gw4>uFQT+jye
zILMu*cS^=0<Rpj0(lcI1t2mu9IsiJmTViT)MW5^qUO-pP<T`QTm>(v*O1ffVsp-8j
zv2;Nc(o~cE1aVBjvCx#*iBkDS;!#PykLcV;zKyI$WZy;YoR~0*&+|l#kI?q$R3oLA
zaRN{CrS~}BC*|`jlTi9@(b^|-85I9KHT_t(aAIiP>>XW{&QnZbsF-H$Drv3QiG2pl
zaIi>ntXols1|JvpL2+)6==sR&b=XTRg?=a~*hpw2?*tdzIf(}up0^C4_y-;&{hM@z
z4b|wg9CYXSN47KWocblpyLFC#q&;K_#ZNLFU1`Q<_wq#MVvDHM;8Rf+tRE*X8+ejx
zOMenP>8!-fp(uIKQ?9nat}z3vICtPAWkblxp`$uSZHv<oKLedInW!u_CFYfh<2p=o
z4wjYIBoRzXYl^bkf`MEnNfl|XJPYcd48{rk`1L&PK&m-NXoZPK(p8uZwG*>TZe~-x
zBzZt2K54E9mmGKi;){r#^*fS;#Ca0S&|Q9JYxk!Do5(a^Pa)qp@dW(^G*-n|#9kW-
zaB}zrnGh}OM!xr_5&J=VuEsT+7m0|6m`NIc--~ePmSp2oaYihaz93h~ga(1d*2zK*
zA*3zHBoW!#!(-4hzV9cZT;7gJ?ixhCtc{bsR934ae@eJdQ){-;2F0c+t<I)c*%=ic
z=F)S_LbGECxjUg30?FZ@JofoDLhMV|Vv|v3=UDA@=3&V=SJq@^!YtU>{f56E8jjgC
zAQ`GGE?*8o2SA`<Q%j366Ipq!JZ2<GQc7JP&Imb>1ttK`u_O!`g7w<Ks5r1l)+MFv
zxS7Xe2}n*bIv#bqJ(r1Ll;n#o{$(;;8KkOuVwHW_g}8Sw<A5>#vxQP2Nz?7P7@50X
zB1}VL2g07TKXgM<7`M!pY7m!{SDhGnH4N!Q+zoVE-Z9uR$G;q=vD)k|S}1b6B|RZG
z8s{6S$oo`3=y`{qnpj(1*a+DtGyRDLpoUUov4F<vG}Y97+17o9z4AU<Wty=@vuOK|
zTeIAAqoDV}H8Yh5WIG5gjTmVKIgRnLd&YkbgE$cAb2bq069a*<9{)|uoNAAodENg2
zB(|gG{>0?Up*A_}mrm<MXS~yAZYXc=)6vhX*!&qgY}{O@p{1$W)IPfHkrdDsg2=_B
zR!;E~N&ueWLq%}vqvNSPPuRcV8Tz`#CDG^vL2F*hz!!YI!F5WN9Mu|q<;Zb5%yC*D
zI1}}<PK9JUEG1?!Ch4K^w6fSzmX_8VKh(EhraopugjXclh0=*~dusEeB@t7tv^r7`
zj%pB|h(G^1A<?NvX+fkS!39}(naLTc&S$Gx<(l<}JLegdvc`$eU6In#FJ=~;NnH=i
zoY}}#Y(@J?X@<;nQIBeCcGHjo^hoVt0~Yu?87PVQC>@^*UF4RRs8_kjgmOo_9r$Ln
z(7L>6$tuibYR--MDd|5p?1Nu-9^WQ;Ljl?C2LU1#(2G-4sdYU+-In4o#)}wcpoRS)
zV4pK<H6kI?*^EM$oV)Qp2<IKUu~Lj{a=arrcs{s2QIU3tlX(of%H%^|@<O?6PB!20
z2`vzz`iGPyq*8<iz2FpxD_SHTN-p;`YMx?DLqxmfr;$wNf>tP6rEUyQur{H7A}(2a
zmnE!GsB;;hEYFnGj?(r)ln+((4LRlphSzX<EEQ7_8(1m6+f?1~{7=21H8L{L)E$yx
zgbwUNU^7^O=0~6Okc<xYgQ$wixAEas4iDosqhn|G%6f9^I@pEE;G;pu!L`**x@0jk
z1Ap-WzOlDaSxv_zVQg5GnS!8@v3lS>SQFZEHG2@hqgAojq!($XApGO&oz2>78o*W%
zoQwt%^5u_crU*YO<!S|fRLjd%__0)8U4kFW<wwi#W2Nk@z>n2(dli1HmEAR2_fe(%
z2!1@SR3F0+r?Tw8k5*;11wY!AM{W4gsW=_@;a1u}g+F#HZdcZ=RF|+r=oY(Qs;*&&
z)#?g%zfx^shs)K+*!^0yyN2CYJFBwp<E16+@X=BQyKgP6VTaDr3U=RFYGH@%rN`KP
zcd6UO?w2HmgD#d=X@<+o*da`pX1`p<!K^O3G{faKcDTIk(Cn8Vt;o90$|}upWf?ns
zv{I$nuat2x?utt@Txny6?G=Y+zw)Rf>n^RX&<t1Cu=~ntg=W9Hgx#;Lc4&sHUF?2k
z^)bzUwY4nkw$@f?hHGos{o}O?&3<hOyYH@bXohQD?7p-1m}bA$YRkIIkJ>bgM=q`5
zqenEuM-Fxf%S*F=v`TCLs7#P~R9%vF+mG8ci^ndl;p0a%!^aMG_~`L6&HnK!t^MON
zLFRF_CF`y@U7Cf{p*3_`G(+bxc3*MUX!gzut-Z5EkZ~$iS+~>b(kxmXTEkY0X4ra+
z-9K)v(d=6*wDzqff=sL8$hxa-hi2G*L~Gb~Y4+_l4yM|!(hS>WTKo1Y&Az={k#*gU
zLo@6=qBZQeH2Y2)2jg_AG{a7r*1oe!v+w->+56MRHg04A6g{8wD-fD9mKVxwYVmTC
zoTu1|qZe;ik|&;Vbo82JQ|gFfbGk`OvX1U=f3*N;0F7QqNls?QOe~4rSgHzzLZMKo
zT7N3*K8~IehEbo!Fd7o}(FnU=ivq$hTBEU#HVFIZaaYzIjh+&Qqdtw{Xh_(PM%aCS
z6cC1^H5&WT24O#X{6x)#;K>u3is4h5e1njtV$`R}*B#JQ><wx1tw%H!H}xFsK0yj}
zyCDL!)*T>ty>5iSZgjf{`g*sAh&=ADBU+o?O+EM5`cG*pK7B%yZ`7x$I1Fj>tqo}^
z1_PRWk4H2WH`E;L_WIZ%hz;z%*BfDnYrP?MzusHJ4mWxMcE8zsj8uKx+fZ}AzY!6J
z8-qSgzL2orc=D7c-zH(Wu|A^7*CXsVx_S<-M}*<}06PS6McA)DL0}%QZxV*<>)7GO
zdXKPQ@9Me#ct{vN9)&ddo)Y$t`%h@{Z4ic!A4fF#0>b|Bnwo>X%^_j9Il}I{n@<V*
z%|3R&xw%0YZa&8D*Ea*gesfLD{o&Jf!s6*Bjp5TSVfeH+qRBTP?4L$7_D`P>WuAt5
z4nA2YES_xA7(VF|hEICfA&6(f{z*h*|Ktf#=1HjMe*ZCH(chpk?5`1q{UD;rHzMr&
zLmK;jpD5FRs^;K&_?WN=H)ssQHNr3qu={Q}BJ9H<jeXcB%7jnV+#d~lgyFDDV>sL-
z?1$?^ntUN)IDA55Ka2?b;Xu#9L60yTbZHC+n}q#f9f4UJgoNSX361?ABJ2kPJ@-ce
zVK`c&F&u3W_M^uGntV?Q!%?5cel#TPM<X={H=}?sjMiujqYc77dW_xoqNjvm)TgnJ
zhJ<}I>XxgMgLD9-y39<yF%uu7$sifB0y6m&r89Ie%LZ`_n<eA^P&$x1TxEzH9EWLs
zj0B2_WrRde(l!<O%RuxmoKtUXO*%ZRthC|Vci%m^_gAFSXmn5fZ>|_NP&ll1e)!?Z
zz5i`vfA_>+iR@RPc`3cp(4(+0Yf?X>4J#BFPgXi(a}gC^mJO3L3Vb~|LU+)IVh26#
zQ9+I<?dmc5#Njb*m@TMO`3H*3YL@_tIa2Tyop@dEBI}k{W;%05hO-%;$z>dTD#PGY
z+?+a)v#xuYTU|L0bia!;oV9+tY+bP*k*U#ACF#RLKBB4z%dEk6rA!UlM`lSv0>+D?
zsTxrO)mWuEXq}Buq`hV`^qE22q9Sfl6Wk)o^U(V3sth-1IY$bODg3|%;ASzE<9?XU
z`>vUW?*5sb>u*u+ZKQT51sJeJ6Am|?uQKr(+X;3aR|elZVrP`wisj?n6iX(ThZNG4
z5(FuVXA&ebu;LAs_z3;2btXl%$K^b4pthuQ^hkI1;uYIv$HI)0$d-3>2xL29p0FX>
z89bjMpYUv-G&Wi59@|-Nl+flRu81+yvXZkC={~isgSzB$%$8;p_V?@M!!Prxxc|rZ
zy>1`^SoQtC-p1q2z>WX4+5LL|`-^<|{-1PVAIJSP#4`_0k>0;B7JcLm&&9v))6SQ=
z{ij{4^({Yvm;UIIUn(zfonDYJPG0bHp7z63KIL^sKJH>f@jJO!^__3nZrmRy12Rby
z93o<<7#^7b0c~3EK$8-eDc=vm5SOIs+#&Hsaj#nM-oAM$+VuWzn@Zem$pZ2y2_E6;
zG?i@S)$s#h(X|D(GUi<#$TC;(`>H@ANfeDjm%sDnM_*g;{?nO^ONqzU3toyWzYOVI
zf-JlI`0Uwe=)Ix%>=~UQ_+M%K{I7@6C`vH`xc@c!Qm5fr>Dz(y|Mb6?7bZP#@WMzR
zQ_}cf%joa09NrOo^mmNO-zFW64KoCS2j5DYfFIO{YzO|voU!!gA?cM9D1w<Y`tvd7
zZ_aOdiAzv9(@$m)Twpr#+r$|Ke-q_M!$vgaZyAt|bpu7b+%1=Q*@?E`GSO_DD-T3M
z^dyR1chSxuq}UFvwhEc|h$B0+3I$=0S178ZOB9NOYE)7h-ngalI5WrE(x-q|KT7a3
z7&APnlLR$lGZfBORLzPitjp=x^`Z^sJLuGyjrn#|KgL`qS_O3P;(71j;oOo(hNEHe
zCC)G90T^dqxV)2&>jcFDYTC&@>1(l+WFT2ce)AQR(~t{xizW2EzP92nqcW<zbXiUY
z1Xm}pB@S-#*Uuyx?aO?{OMLQ59(q>9=3RN|su2!mbC80n4#mobDHsho^=POhFy2Db
zSkj%d5lr1^s8e|O0Vr`5lJ~QcbU>a5@}S<^1kjrivE6sBP!k9FZFtJ%4gU47+K^Eg
z8|$57Igb+(UhfHy(2rGxAkT3>gW-Tx*l<(1BYxWX@Ot|h`g#l#+)AZU2Xuu<-gGmP
zI`dNyc`tr^2og2LDwJ)}XbieM<D9SYB*XP96g0m=?w`g5sh`Q@kkDD2Wpij0cVb3E
z*&szS+I}WCNqK8m)S*U=foOA4*Fxs&$L194s1?LZVaU{}-mYE%`AX8{#N<rP8_+~y
zjP)%OkC4f)TBy=8P>(a6ef!S>cezqHzdz9+9(b{}%4YOmrhG26Q6{Y`DbDTdQPGM(
z+b?u=L9O7l{lYgNCEcVOTb&QYl?4v@<G>q#U3wk7BYj>gf1%LIj;q9+0++h^T@>89
zl6|sVyefoG?epj^mg)rN6e;zNY~~fITn<|Im2Jr;2O6X(xt^|JL{Dn9T_dLK2W!Z`
z?aJEuRU%}Qxw7eyTMg|7bJ9BN9wl2K6@ub9StBl`(`bzQBPeoJ@Ys?i*gYRh)XyL1
zKCC6Wl*i+vxAIS^-m<dmb^k*^zilgq_IlwdZu9vo6|{hGc*vSH3Eq+IidEsgv;B!(
zcgABJyi-cvqZD+$A&mh%&_2k9bmdqZXP(AL#X=s%=+Lo@vZLn1s@O|lyEl!->_&k;
zo67su(-u!TVNJQBbCYw+Dc_$+tx0_?R76!7_JWwIYn0~$v7LiV>e5?cH#2_?532oF
zQ`e&smm}<i-Htv<G2mGRRlR(V2o(W1STxNQutcqG<Jw9@aFp>}HkYivx%Z#mKUR0_
zXi@d;hC|t;YObEsE81fzAz|##M<tCK!UPIcHOMl>hEU6ys*3t1kWtYug?u+!v>2)?
zqScV9LKY`f6|~mcs)FWTr@EZU3RNY&w|1N|wBu=3ifjqBMJ>V6<i3z+J5@PX2e2cW
zfEciOKphNJb5CyUsh)1m?zF*dBO6iO95y$z-Zsr?bZJjDG81+{lt*WDW4nBo8I4TF
zZZqDA>U+`36^M$7nF|xy6`w=qTIzg+*2ZwioxxjmP$wVt=)eaWp{P*Lcg3rptnsYC
z5KUH6(v7S%Q5;+8qao-N#f<GL7y6$4HSO@62H*yEtRrEqgQgJD@t_H(#j-aA>exC2
zPt(FNc+AJ(F&-6DTk51ZE-3lF>yAn{7+Y{!YlpRwI-pHH0#bTLh%ejzOH#^~prev_
zG(>!Fp9hxCC4yB(!MO$64{w?FbRb?qcbYvX(M6%sr@Bg%!Pcs#?;}I06A(~;^q5wP
z8y>5X&faW<#K6RF84qJs1Cu%G>Z$=%$AsY0vkn;z^pnJBph$ENH+>?fi&-ltL2%{1
z9T{)C9{Y~mB>f2T1VEc5gJk?r+--lli`xW(2~Uv<mkB+JpFJgP3yY<Vc>LK*@sxWr
zc}vRjg{Pnfc*2#h2!XMex4har9eEmNGumP9f$k0^LSXMLpNWq3eZ~3yz}uKc$8PLl
zUYIQa!(<M7nH6u<dsj~FJKnBnw2EDIyc47WjBU4<eCa6`{=uQf|Lc6e?>6SHW=fpc
z&HlxUsl3?aDgS@o?KI~T5uCMgju9m2uqrtdEAWHki6(-=Dx&4_^j@J2f9Hi_-b+I^
zgfcK<*=052Qm<6heN<XW)TfEHBu8!utBD`GvgTa*f@qS6Vc9`gqu*g!z%C{KOT|!r
z-VzUe>T<p_u_M!<W(K<lI<dsSjOw?PX;+@pC};apA=q*Ea+sgZ0%Z1)y=r>UFZgV_
zHj}Og5W9pnT9&*Ia$~2mecb7S8qxQfSMm)Mvn0C=9QZf?_F<RwhJz6gB^iB&TKA;M
zG3uc9A6u)*M~c~lGu~Q2igZSxv8=)ErCWb@A~Wwg%0}^aq{UCjG6zbj^F`RoH3;>t
z5Lipjng2#V5K5Fhj%E>8H$r0?&`}TW8t1rXQuVGI!^U05Xx;Ktkw?#QoupO+X%qJ>
zH6;U*rVBLGZV=$6Fa~88bZLRD>idD`j_4xe9+ZjdJL1<!93>bbqumJ}iesdPjGHr~
zHD@{wrJYx%F^)6;UD0~%d&|@tnLBg$Q)6(gSqkiL_ZJ;emdI7Z=2_@jYKi-u;+@_G
z1A1CAlg&@{RPijZRYWP*1*)czpUs^mmZkQ>3#`w9WR}dxb-uxDu<8MKd0g&mn;AK=
z9#Ja;)RccVL(^$<>sNN!VK@s-3lZ0~%S^aA=b#H~=H&=R_YlLGI8;T~Fj8NiMQo4?
zb3snLOe0}$(ibNUaHlnbO-99cj&;qcP(2NrL`rCYtUP&jq;u)988t{^)YqVYIxB0G
zccsHo_JW`ZiKZ8&I+m*8W$%l!VxfWY2E)bAGGl|Enw|{>upA4Y#_st4Qp<k-Z~S&6
z381U}zk~JlUeERaUSAKs`hS0k4=?zW`6;LI72R+0C(|%P*KP9=#+Gm%WhXI3^)a7?
zeGb^9o>AMXvUUg_%v0)Bv{V{oN+f@In(6a=xnV^>QuL^K)~3M9YKO<qVf(Ez+M8RH
zZ$G-H${hD!7d|LlazcwibPfQm$iJQmb}SiTumOw(bT41B3$SgUPucyf&@m+)!4n=M
zq(lw{eZk&ZdX}2#9Zr(NQ#Lb9!x;vGV*{_X9h0(>%e7UxHWj=rH1BfrcR7asOm==(
z^?tVwuR5f@{ll?Z6eGpqk!%c8Sc6_UgU1?L+HLYP^7(JMc*u9H75?Lykfjy$UbRqH
z^5fpqxXU%6II%34WtZ+uJB<E`F0GeDA)#uZyEymWvYo+o0kmjZ!;2rAW-adk^l?v)
zUBcgYb$fSP3PArbjH4`@9fy;qfPTBeUE)EGDtm7UP_bV@9WM^+Vx-L>{{E&wPSRya
zeF{4LQl$RjdT^hzb$B6CD_EB#^$*u1bq?}!q-H%>LVX%fKsuc_;two`M|?RNP<t5+
z`qAtxf=wiW4Q<>NGGJqPUI#qO8!hVx6qVOlzm&s?UO3xagz6o5V0G7oNZ%_h$j5S7
zAIj7#uq(iTWixWpM;G)#I6pcrlkz&qz$N@8oU84_{t@hXK_2(#M<VI}jt*e?#dZt$
z)_tLx0`Ut?-A5w!kKF$Ftc-pdommpOEzjQAw7~t5<@Z;4r^~qjt+fw1va@s^JycdN
zvmhtR5y^=1?VM9kL<~92S*6fkrkFy$Sru<Fs?}MXan#1UI2atI9wT}}GZDvhRJR-O
z))@r^&SAQQp12$CA`*w#%Av^HQdF=aHtK4y)+3)6a$&$=Th94@1rb$?G|J{<H_)Z3
z?%VIln|xTyymjwoNc<H1`juBdw&3jBXt*iHWSa=$Sj5{JZ?D<gLE2DG+c`ZC3K-V|
zm`@DS;xF;~AI)rWnVhJJi5EXH;2oYGs0(EIvpjS$Z5il72)0E{fr!J+1#KR3Nuh$b
z!M0ex6>Y3g9CLX!%GjnDl$i_<(P(stchq>BjcpzB?We=hkUHm<{U;JG<jG`wA-7Q|
zL)h9dGZEsDt^n0|K9sQ7{`b$G<&6M3qD!%g4U~;OB+lRc0VofYb!`?N9bs-PO0<QE
zV?w|+z{ix^YdlWQIC0jD&UNp{*?pPLPPUYcINFFR{Sf2{2;VHy=GbX6jt7)g63So*
z1&XRnqS{M9Y6jaR`ni*VBroku)l=n<k1(6neP%jiAgD+ieipgT8VcEArCr9D$PC?g
z#ZwGpT;=ZCdfi}b<+-~(y3PpaFsX1MdAIpI%r_i5NQ*MvsmHChn!;_`=%X)rOR*1K
z?GSqVFS8L!g)||KiYK_KjLrnZpYg>kytb81le3AMdg!{AaBLe(ZeUUlosdH|p+UzR
zW88B)H$v#Qrd`5|gc_}HF*fKq3c1`V)MThE{X{}aBH)RpF&icz9}G($R^g`yh0=I)
zGyxi8E()sG3LmuWV&q3k4xV@J(4F9v@OM$QPaU-Df}a5zFcy9#k9gv&f=<WLWAL(?
zwf5jbao|(%I2f$d)r4&WFqAk{mbkJ#hw`cz*yh=@;XFm-raPbR2>F88A)3rM{^Z#)
zrm>w3#!NN3$pMT+_+gSA%r!fRrp3^=$czTqai&6Eila0fM58&TZ44(DXW_+aVQev1
znj4Up^wOYfUyAZgH8hD8MAf%B9ekpx(1sE7wnS8!)f|hS)cmt=$|M$-TU21tDfRCO
zPCqSHFmcv51#EGe&64S1GC7pdZ+%E}G=_Z~SElaD7?&$~-I=n~eZ(0^_x>KDVBzm_
zM&5gftODC*jFrW=d|@>hf;7_dXSH~A%MRAuMByd*BEY+NQbKgE>WKavoiqdu8-R?|
zHR4pvr|LKx54OV-P{vSTQZQBbBs+J^#9zMAFFAuGa_8zD2GP>$T#Kfh^-^9_#TSk>
zFE1v`6i>!-24Yk6q70OrIICUhRZvP+Xl#2maJ2R1Jyw!xdmsaRx3$>3{FBTcXMl~c
zV9*B2D$wFiGFKwYta%@C_a>->kY`8Kqb-CT%kAa;E?2pK1>;T)6$ZN@My(goOzz#q
zX>^*T7t}HZsKbeUmj?XqGu4lKO)~fBHrDyJ)(HON;!aha|D8@z;ko`1VD<SQyz8ym
z=YPF!(EA$y>5F{i`P}K0E-+xsmv8i=G=a@(YgMuZJZODG(Nj)OhA}M~vdlLWz=C6V
zhXUS_)-2PAsoWzJ`XZxE9A8A5CDL|qI>qKL`yq$`sAw6};KfJklLc80R$CQc{Wy(>
z2dgRyN{)$iTrnYrAG+y7{(6-I53pn5MS-Ud3eYbL^p_Su74v^Ej&J1nzi$2q-R_2a
z{@?5MzRv$I@yUZi!EhhW#@Qj?cNUk#3@}B^`N%PotSPCA37yrN&SLRc-YUj5^Vm#z
zS&IHyTGWaOI|xe~4!KcFnXzM0S?L-&9Sm&Mp#V~_7sa2Q4n<GJAMiYsZ|HYPKqvdo
zSZ)qg^c0sm*a;awDRfpL(*=77qyrAP*ui?8V;O^_Gd07IjE(3Jm-nwe`o^tA1Jd$V
zXd?{Y7?4w3i2pQ|=j+G#RLKANEFOOW|1T8!9{;b$U*-Ro_^`Y}mn7b>UFw5nc2cGQ
zMwZMXFJkHb3xyxVli3P3uyXJI3Z6uD=xK28o^e}8ZXPd<Gb??y%IQK?fkx17U?*&Y
z=J8=~W5W>0c5~r)dK{Luw*JJ|T+r*4Hiu5b>0-@o^o*URJfCbEcjr}c+@I%kgqj6X
z!n2NgmlL!|LdKcS`1uy^)1L1ZFT8u&r4;s`l6Z*bFfwc2{p~IXz}IPnkrN(ba2kw!
ze~OCld@A;zzfyXzI(o^`#E)ESl%W7a<%F<*_{*S$U>UHZ(u-Uqy>RWD!Cam7^7k3q
zO*vIya>^z)USU7uqPd0PWA|ur4MpE_C(vP~@W#y#`F*ZFeD_|^wQGD=R-+@U$k~G2
zfhIPic5q<U4eW5_cr1bE6?k(Z<9yBJaiGrKIb#*wtDy4^%HS2#w(2aTF#Z^={ADzW
zQfTVpA@5Eo1W`Y-4bW`a<AXV65=7&UJar$WVRj6laC~vz!>HYlHQNbNnHqtOKZ6hh
z0?D!mhEb__zD6x1M~HU*fKQO!z~y}HmAi8;&pWoH-R&1Ud*a9UFU9WmySKahVsC$I
zcOOklSleS*(l7)buB9H*=m=(_xcuMWKK?d*@Y}&}*#rCyKhNmr@UnOH%=jsOyHnMj
zB0^bzZ3z!rOJ!NNncNkgh(&#QO<Al3%VIbdS_?gjW@ylTmnKu-3A_>x-+-1li|L6q
zV<ZXa0#aL*c($^7|9|e$og~p#)enW=|MF0J80E^a=6m)$!g;*&=BKwB0EQF2+UFUD
zP<8?1RzJFkd_+|i#nmV|5E|AzA^>`n{FJ0W9%bRDNTimhNKj-h>OB?duz%R6Du?mp
z5E?o{V?V`<D;~!32IEtd_LHpqticHB0waU2I4biSUIREvVb4Dl1mrBitblQLyt=w7
z7C1z(k7slq(tOqQTD%?i6leFM$(KfC><E)lV<JM?Ls{+1QgQ3;PeOM5rz0k(JHMC=
zaxxZuo;JGJm(jK&Y8#IoFl7Tq1~@t7r<}cHJ}t@QNPhG!ydx41&>}a)u&D$AuJQ3{
z<a)MgfRa(hpkAhdNVOWV7{Gyo7$JZrM=+5I;=D-DSL7y<83NNBjuUxXei1ZOZd(q#
zP61NT;j0R`SF)cMKa!tHc*3bGF^LFzmH>>a29S4Tc$&dHO)2cY)(Ft!iH<w&W{N?1
zwZ`&?xLnHxGD|-l#=~<*P+E~vXstdQh|U<*8FEIDwbX&;!GUT1<nwRs??+H)<g5b|
zPiiQz@~cBTT%W>}KxVtC2`TD~;ZdZZCG|p9G(pCkGE7(Y3M6V~>@Wm!W6CZZ8TT$(
zhjV6<8*NvtDBmL4I{IB9cZ^UbaNGzt@{a1)LoDht_b4T(dq0Rr!|2l^3PbXLOi!KL
z6Mvf7Zf=B{6l^y+atB_LR1dw6p30%bH`peyAAO^w+)5MyBy#{W#-j@js2mZCQHL|E
z$MP~H(;vomCQO+Cj0?9^i46H$5IkBp!Oenx>gtd@ZsY*nnTQ8%U9gnpwZc<+xkUOw
zn#)nafmr*DD@4$(kC+ZAgYy}g=b3KRn*1uwf<~GhpLBIc0!YI8$f{2+Sig!h>077v
z4Jz$dzM)W>X+C8p<V2-QnFFS!r7>h#Va&38c!ce@Yfp7dm##fk_47$|KI6K)7dD3Q
z0q&*#8@<KQ=T5Hqr#YxZm*%{$cH#ty9gsYYI&?>vnhw<tY-K*7+Y#{$#-bmM5)Mq0
z%v0W{-FwJ|acb*p#_^0c&Zm?j<rr1FJ~~GO8_V0rmLMu%pFik;mi2=}4)H&3iDxds
zTsh~PC3zFysafx@Cllfsn~S`hy>C-{I!iNBMfB9t9ODnSQ#K>L`z-abtoj_1AV;wI
z1z9a?bY0)x4GS<Q8#jonJhQp5FXnc+;>&JIbdL*^0}Qhwd7GTk5HxetpS6mWtHfeq
zz;pCimqF>J#2R$2FTZ7XZ7J8b#FGma%nG!1(9<Gs2M4x9B(<HZCCVR5Nl___XiK3q
zpj-$UcSYq!pO)=%F<`q=s`9xnrR_t>*G=(x?k33_TacPC8W{KV2!K_WAi5+?(SEuT
zowJwsJ!x@Csm2ZrDPC{T7hK5zXc+!bMBclyI>Au->=JAB)xmCbcYRQdptV^Vp`zjM
ze2*G(LEun^A9MH+gnXf7xX_n+b;I5A$D-4YJ<3p=AB90}V4!2lQDJmQ&psBgw?eOH
z2g>AW-P6zk<1>;G#|Ktt$?4x{F}&1KQ56KH#NRt558+8NKcZxRXh|Gjz`8je$3w&S
z-65Oa4chC+T2J)RT8g$}G>@WJDG%DC`Go(lnq+X?#(T;i24#i&ay@_P0bp|-0cg-i
z&^123mK4j8Bra)Cis`QCZEOl@doBhtC>CW~dZVK9P{7&PF*d(M7dJV&w=}LLBYN$z
zyy;O4nvY^&jG{9#Bbb#iF2BOYW}j}W@l7=C4WmM){>~v&e}{#r*Hz(Ce|N>oi8Apq
z%Gw10KeTq9_=ED<=kW}oSx>eq@5qrwqHTidw9_t{b?jag_8h(LIca$3FTz=fNB{|v
zX-4P%=CQwz6m2M2MGVdNwwiX*D}6OmZ%7#0?>;&2Y!ay}E;5c8x(r~d0+7^k8XaJU
z&teQ3W109)a5AwXBN6Gj853-C;c;Wj807abu~n91+sXxnVKI)&d`9|z#nL(QT<<|V
z!RX)orGsBQoKKEB!r^^;)Z3i%6%DP$N#!Rvez-|&-wrD513fR#IT;tJk%dDyZgF*m
z&#J<(d7Wd0$EbN7(D_X%L4^y$TcmwnHXkI89@uvGP?s!weIQ_TLcXyKOWd&P+Qubr
zj=X`R^w<`L#<v*g_M~)PsPq^#Q!LzV+ITXB;!PTsC94Pk<In{EoY5Nen@NOf3YWgY
z4>?DmMHBz{SXf2X{PG99QXjsOp;}RKxGSsJ$k!GnL>QR)1h4Q?aNag7K#0HUy0)1n
zP#IlOQi(6q)i557mhGvsMEToFe*N5#VJ$(|fM-A7B+q`XVA{_MaP8;YXWP#X+Ztp1
z`R3W_v%|Ry_jVgBh56o_u#~k9Hejh^UId|heegNCSs>4#=Q3B@rJKD{=3=ug0Y=6W
zD}S14OI$E_T7DJiP&vX%bw2wvoS#nhsUb0ZA^XFy&k8*J{!Rp&N`D{rO(H7^PT4A<
zsD7caz!Z2Hx-dx{0ronXxPNfqQ4=}DM~Nz7;Gc+(fPq9G`aBR1ttTh$18fYQ*&Ql<
zq!_24UQ2I5FLU_dkZ{v2=aU2W8Y)ySayD6Y{k<p(YMQ8s+b5LK+ofPFp$a4@hstWB
zAttmXtV6_Nh3quKvzUwt_UFRpb0c)rnq!U&9e!p5D3tx#kU|Mr0ut@1<7hn06jsN;
z%4lVBC!twm5}nCPC9(b$tu9Xlh}yO)TuK$?6_z(F&pmKO_ru}u*u;mKuETcKF52m3
z<NgM<<oeVAV6P}pCR}Ktdr&r{O=<_FwXe?*#pMfsTJroUJ<^V==K3LlRiu$+TEDg0
z*>A1fMUQ-!ei|nsT5Pm^h}~vagYHoaNQ{N~N*<mz9-?dhA)d&bPC3G+w!a<f*z|{d
z<AnT6h008%moj=O&t&|K>VrhR*vWUC3cjtsxrvX|i^5?S^+|_M2om}|(i4nDMvoq}
zEilzbgUh8n#tk>n#Aq1kG`>2yy}Uzng_(}5_U)QIPfbZDtp9+_t_KIjRH@~|)3y>F
zo9tq}@H&?Haz@c}brMw!Vys{FDtVa*hvTJz;OElM;dw|tG{91zWKn|Ad3M3$ApKK#
zI6BIG-5kPB0AwbKzuJ-s((#HljMM)1?rSkll9P-K@^sY4S543|pQM>`d4azVL4Q8Y
zt^6`CFGaMJ9w^VAMUzh}*ycS-U}Ya3-^aKtr}rtcfi7kkY^lFlivIm$^e&(2Yi`U?
z8is<GYu~t%U>;h_MULC+igivj+)u{CjyI)NUj&6`T-n>=h8+jQu<l7kjf=T<>>=|u
zz2wMTYr&N*=#El6Oe_@ZImIp_3g%QOx8{`V)8U(2YTYSy8XiTHSy(K%;S?NPgdX5F
zol<AVlvU9!_Sh+=Bm7qtbX>LbV%{C9mh9cNwckFr`~Tg()HSaDd;RGtOpcUac25hz
z2udy#VjXwSgaZCkI6g}851OdxiZdHxP=sVcyc$nJGu}%fXi%hXVQ^$JBYPu1&X2h1
z>mBh5CM(~*$nOt`l@><&>Ylgm(cv@u<4J&4cJQuBJbWl#$C>msdMKjV;NGg+Wb0SH
z(2%trs_2U(T3WQ+42KkHg{Qz2aLZb&V*fb8xL^rNC!j(+z_cCVgc322(dTIpr4!W=
zXqf4II_uC*4tD>uhtx%eiG0tFFR0HLgTF+l<g0hltYOnvzS9wxOp7ZDPk#Uln;uHD
z(EqOd&-bhMCBpYs{^!}s|9o45=DpQ>_uDniNg~&j%15B4AP@)06GM}qYs(%}y6RD!
z9beRxOg=>^sH?J+=N_)kPO78I?TpwjO<uN_p1z8+BM?C_h-Vnp2A_`=C()gy`RQqx
z;(+NTjiVs>r-nImTQ(4{%x1%W7ELnpg9$m#$OxpR?rr6mG)n2QN>?dGoLN8*<)w!4
z#l4(?R=zbUMZt4GevK~xr)>5NRu9Y#k|_e4I*V0tlE^?Tcm-*i@By`~<xA}6Qaq;s
zt<&2amlH5G{OZ+Up#P0rl<;JkQhOA`ifX?^AXtXEjE5P=P%sPaGMy$MR3`d95~&b}
z%F74yspeOwWlPpY^uZYRYOE08HKb(3QAJVvJ&-CxG!Shr$M;%~qcIFb_6SxUqa(cG
zDlc2NrK%|b=NshWuS}i28RmG`^f;nBSbTeny_XPZ71~sLEL%8fRFkQVDaCJ6=t;GY
z;D6MQCy!3hldAI+faG$vpF1{jC?h~+hj<^HGf3mof5~1mUA<~G@qaJG?m_x~|LX15
zi^HF{-n@9Vy?g%(Bh9wCalWQch8pD;?e~#40bR-N0T~dl99s4xL#O$1f@fNe(>!7P
z3kckEae?MoVuN$|iw5U-J{pZ9<^D?4{|SUtly?4(>EQ${oC#3;_*9Moa0S<}j>c%u
zE^^BwA;pA~&ZCnb3gK0M_qZ{&C)Q<6@+&l521&D+eE)s>_p4%-LU~3%)_KE_HGj{W
z8}q$9dg>ONc#BQciKgwPMPWFbPkr`aJ#RAi(eYuCdEY-el&w<;D0A`;`+~hAZe;E|
z9Tg`(bcfy;H#Pa){tO9F#Cb_EFiocOF|Lo7Fa#K)ZWN!33>I_C|9Yr$c5?o6fc=oC
zuCvoO-BO@EuUkqRTBB0}?hM&b?OCE}1RBv6NKpX5yeF}62dJAG_3;rYsOJ5~!vW08
z;o&r<{M(jCBR*p<Q1Vreja0oHK1A*#TaV^hN(7$b{f|~*!>3i~*8fon(Rl}m$HSIr
zrG`H=Z7DP~_U#fmN7XG_t#ymvCI@H&^NUTla|~B9#m2FB(MiM&0ufkuTAYo54i=(X
z&iB!$!xZo3z&`pEMy&KgDZIsEhj`3l-YNYkuW<^M7X=Ds2MgRVB`9d~(FhLSrc^?r
zi!2U@6bsSeX#V;0#UX5$Mx%IuK`Ak&%q9N7n4_j5dPh808DXXoAM3z&NM+{K*<#Y@
z6!ht#tg`?1#oK4(>x&**GujoAZ#YW1)niI80IWo*bRW_tEye&;e9cq_pH}y%pu_w!
z2J_3I?)Gx)-Mj5KFT{^K`_JFLf3uH&{Is+Eik`fEhd<xF-4idipYPI-AO9|1Ztvqi
zc!R%ox8A(m#y|Gp@y;74hCiSf|N05Eihc1K>%88RKi+&0@8H+=2Z2xaxGDYM4gKV1
z_u%)dmv8a+tL-=WX&##K4IF-cvHeQ?y!~NkZ+}nxjD6vctyl0+0`s#8&CkDV{~gLf
zi{fX3>}LY)=e_4!@Pz*)IDY1S#m|4+dIc2#rWZt;91uJtF#!3;){7V7AJ4aT@h6e<
z9})ogy}!M?xBqr`Tm0kI_6Pa)-P?Dsw?6Rioj2kij5h!J@$XPh|GoE|s=~Kl;OF*h
z`eBvRUv(L$>h|AM^YSlU^KZVA&<0WDAM)w@H#=|NNDPn^ueV?SxV@Xx0(A|87O!^R
zynxo>*WUK-zIcU%d<A&ok3IPDe(z`g31t|rSBTatr2nh^-JREB7fa(0F1(xn{E+u*
z55OJ{z#a|2-iw`|e&U}D^d1d?{G}f4F&0Ap-h)5h{taGW*LyjZ@HfD=NA%buLdaj#
z&Xqa6qVUuJ=)>0YU&IH5>cjI_TY%ID<kb%^ci+B$CqB?s`432$4>${V-n<kam=+&)
zx3^yKPgzzE-v=a4-lgu#O0%ra)7<$^2ViY`{?JKZ+h%2T*Tx)DDrS{pbg35;?SpSL
zbe^OY8t_vMG@TjeiL>am+Mp?_S#$;K;{fHR+ASJIaDQ@X48wddh@znmQXzHw6{miu
zowtpCt!-C!voMxsa=9;-V3M|j7sXKKBf$0weLAFTDOJ}W5dVXFPC`u?E{qj^qEK75
zbzne*^g_*B!J?wS(h@;BptTPXAH63H8c<vmwepbaR_Qr*f1t8qOC=^v#X-Se=8jCo
z$)Rldid+;<WDHr3Mw0IVk2xrJoXj)TpZ5#}N7iGvy(93_72c|xgTexXL*_CKd6*u}
zPtBTSiUU3V!XhqX?%b%8#rRN&zkDaU;(tU(etjl?JMP$cUy$P56*^e6OX4Atzu>xE
zFc!{s5}D)s??sE`M#~)lGZI`2R<7->*Z%0mSOBMDdF`Lxzj|fYB?UefYo#`H1sY1M
zCZO#t09%DWm|5?)w)NWQ31t@dyU*LWErdEq`AW=}#jAC{bt{N9tJAEMB+|NvNVF})
z{a}nDmZpx{5yswlAu*D(ttS*7CG#UWbL#Lf(77~&?V?mO1(37_m~xm**L-n2UzRac
z30lXJ2}ZP-h39hr@r?@vEn?)QW>Q0ZTOz$v@>DR3mq}(KwO$e(WVBU$3W@?PwivHI
z;k)F3&dDS>lad|q2{Ca8V5Igz2AY(-V=$Xz)G8<n`wu`!?mX`JufyKKAFRV*u#9|Z
z%(T&hitu&WpK!}1<d%!5^-TIEJj}6!NBVD`HFq?Ia!uje<r&?()!?5IxHD@rOb`Aw
zZ?8%l6zYCG8dyq$VcyQf02zkH1RCKX+3~{hAx4S=T_S`zqwG554ixL_;#k#m?aDBU
z98A)`V8E7{F-g$1AnzX=1{R6Z?4jJGk_XKc&m3{t<}0n3D^0Y-Z=wy{@5owY(eLom
z9tj2b@&ktU)89ZytgTz$HqCGTn0ZCiF;$v(&hI~e^<;GeYlt|@=0L*J_#AQg?HrFD
zNp~bnCg|cb7TlZ)x@V>-xC3)+o(^O(EftRs=G|Fzmu=>sFgPvN11`i1Ra_=d@sLLk
z6Tkg-u43{1rQ7>J_?pHZJ|`>S={rBljB1Ka(5DH0|0d7T3gJ+mhvNa7ClPrLQvoyU
z`ElIY`{x|btzN_kdw)(DRm6`M9MX=>D|h5+p9(^P2&)4qqZ$%#iX4OyaEB2Ym+y!l
zLrh+rFnLD_dM|LSy_5JEygr`IrrEPckD|#cKAM6a8m=bk(Ifo!2m#Cpz(cdAZ|*?N
zDe&nj;SL{l(~=<|i@KI2{P|lA($wa8?*LgqroWI-ex~Z8_&JUbB@8lt+I%wL8e%wl
zCSFA7x{+Z~Je3469*Q?Q;0&sd$OE`;P<3R-2`JP7bqIu>V;o1_GiUT0k=l%h{hZ>9
z)~_&yX$LAaD7!ROALau?3ji;2iuRmuL=O~GMnxTTQMybc&1v%q@)RdYo{llr$>{}d
z04*^?A(~SwMj&kxIoB4I=Mc_;xq#7GkwP?&L^ze2e7?4jSL!3V@kA3g$WUrjMUywc
z;6miEtqM7ILhjGl#Toz_H}LL=ts@x9qfjXfn)&h>!!EVssIYPQq_&aM<V+>~gw4qG
zq3GQMOxjat52?wZoVWCY2k7sAV3JKuW>th{H0H7%0Q1sn_io;Qv^VdgESpR~k5cYc
zlMJ?4hq|Z{Jw~1v(w1M<vd-V;r%+8Dmg)7M)+03pe2@?u<EC0VU{#V6ze%;Tm=TfE
zEwv>iXb8_q<jbn5wqjVVYmJ*c_a8*@Ct9pDX*9k(o(vqFR%J$Y%FdGxBiID5x^2O1
zD70qoaM5E0>(3{$1$%dh<^}gEuZF|INSXfCTHqwyx^Do|lGYb@p;T$u>8ORW;hAb@
zQM<Ove{Yw!4IVkf82=4bfgB5}-6rFQNmFYoNzf@@msBJ%i=fo?5-Hz+jnaa~E!obZ
zRnM9pBn7kMWIi5ps2?7^JS<d3%&O;xiMoe%4NB+}7lI+z*)&I}Y2?lz#neVg+y|Ht
zR7}od?Yydj!Q@K?#ibq-<D$E2%&M>iFlPNCIMe1dnO+Z$X(bp7lVy5cx=c$5vsnD^
ziumumlevKi@HO$@yWO>QH~#zM&9Cv_zsQGO*Es{{A^Pm4pvBQ*%WpUns`^%NK+SiP
zXeyVfx@4|zPDsJArRkBm%%d?v?l7girR-kpdd{~5P&TvA2)C>5Y*^*rzWHhA<@?>O
z{hhaOo)z930jmvY4hqfuHrd|YeY@*vz&t`X(@i!^SB6#c({fa)3r@V!hu7YGfAsqM
zN+(|0g68fFqz-@kJ*I%S^qgk-)cz*>;30ZOD)4U;*YRpFj>5?yy3oMRg|vK?CMI7A
zPs0mw22v;loj97RIF`HyqJK)tj=tjv<LOa@Z0XM%m2Ke|Wg?{zdf{1k@er?q4<goi
zaMuwI2J=()d7<EinCftj4m#t63^!ynF!V=))H+P!R4M%1h+du!`$pjU?9pGcmapD0
zPFn}?YkoRig(^k^7%RDX1I%cc(s>ms%4ST*pY&98(h>T;^sh=^Le+er&`U@Tu{%VQ
zJX!?#60yQLpHP^{@Cf6~V+M3iXe;Mj&SYk;TbVFewTlUvPmzV7U_3)-JJhK!#87$g
zaJ<bpJA_T-r$~|Ez&=QOP8-fo7CUBGbz)m4m9<b7bahexBrA@A=?`x!o>szZHL&DQ
zQ)q<TiX<6$!%WPMPPqo+R86`YX%@gt+f>l@IPw{DeL?VFgy~s4K~GHLg*jy{>x2j1
zIEgI8TijjQRd&vJ{9I#UWLM0@it;<U*Q&VfM;E1Kst=j*vHY^S$;#XbwtuA>;9T*g
zweN@>3OpR037K&{Vy-5wUuJY=cRjM4aSxO!fua}^yUtdt+MnI!B+@DXG5*OGxgP?d
zGAu~5oJy`u&N$_*(nwnDz-Yo24I7gwk?X@Rs3Tp2Ba01HwqoVHP|bBYtoZYvcV4~N
z+uz!MzgNmFMVMrK=0c;rYCv*u+OmZoijm^0dzKv2k}Oxe*;)MDOoRnLAl@QZW)jpw
ziMp$&Qp6C0OXkLfPe&3quT5|?;aM`Hvle7pDLfl!1pHSA`ymGr^!3B4=3FHpXsSx6
z-r$sQ1Ky&G>y(04>g34&mO6VoFF}jjH=3-F@MOIS&kqUn&2ApH&*M9(%LREk`Y9bg
zsuv_O9?9xXuq=9tS65XJF1yMjDVT>yMKv(wwmG8<jI-5MCslNjF2C%&dSwtLM>B`v
zFN9hlylf7FnJl3ejJzL}`oQMCCJS`M&@Hnt>%Mo%0a7O81o+99g+)DSeBoe*0|~D(
zljS5suP(v=5wCYzvC_<9X;n3<fg;Jr;_!Cma)-Ej&RR<NS|u)W)N@Q!ptQc+ci!^<
z<}}>h0!Xf2<s?m1_3_Y=UOsy!??@YN^9Q2Z-lrPy)bw!Qh$)B{_3$LKGfTrsCQpz!
zE~qY=A9udndGj(4?Ly5^nh!kkG{HbK;svFY$?}VjnkM$mTQ1v`%i`sOEAy@!eyYp+
z@BPYw@TCUI4{0SOZGluDG}_FRQkdBOOzzDaOiui{wDS``M9fP26JQ^PLKe=PD<OCR
z62sQhp$eS>_b&tv<wN#QK8v%+NU6|W74M=Hw^w)z5uLnn>v4g1m`-uYQa87%FQ;Hk
z?l{WST@0T5Fuh?1Y1})Z$lZKDfsF!ECSpYT_ZeQ5$tcP!h5bf(dWySH8EH0TkFO4b
zNFE1Sw(6gXdM(nS#qknHCnyZPny=<mHzv{*$pCL;f+>a7_3#@<X5i?8c1E-u;f-!_
zsJrrHm(~MlMCCD&)*{}bq|ra;AY9QS1Rk#9<<4i%LOg|~LUeSIMMFGG#E}LKVh*@~
z=0cg?IDl3(;8S6$JB%h5c2&^it%A@Lra-_x@IYl(at(8#su{v)OxfdrF6wJOL$3oI
zj=?b|XbCeiS{+K1>Es68JXOAhG^QpLr>TJHtbC1=qoYV&_rsnKjb1PFX7$PE6dEL3
zk?If4Msn%fF@UFg?s&+I*b~FieP$xyT}k;|!s{ajgYXCPY|PP=%%pAjQRkdc#j5Vx
znW|%^wjBR9{5;@eAdec)2esT`rPixCR6+M$abKV;iLL$c=o$Kx=+kE=8MA_|X;}+w
z-d%pWXd<qe&Y6tOakfFkav(A$@nTTvWuGSAFp21rG2TuGVbhQ3!X)4JKnvS3=;9Ra
z8pEcOu1C98Of6!VX>;xrm-LfD7HDhH4taIm#W#0VJ`tFs;~APQsM<sE&v`;OH_1P3
zN<Lphl;C84%O1*>pqaCf58hBgN<m$cgGBX7VWTrlEI~VnP+pp5e+orK0y4LQfV39B
zwM450D_fgbTbGoB@)2+Dhcj!CvRo<q_M<yBU0qD3X9tOV81_NPT8FH)%A_<2kO|o2
z1_hmpS0=xAF~UbDpR@#QuAdaFQh7}LHjZ2Y`DV=%L;cEW)07*>k#uxdnl$RR@D*>o
z-{k^#wcC<fVZULsEeT4UViGSKD1w-$0Xoy9?9Yl=F;(7ey3pAJ+xcP`rxEM>rVEDL
z!x_WpsxWP6yVcHXx9pPmx~RwJ<$X8gruo_IG(4MV9o)oL=E>lFjd?Y#VvkFE3fe8`
z{Z<DR;lW8KN#mn<l6`*>W%60np__TI2Fr(df=2=C6Dap_dNw?Gg!#o)Q>*YEOC2X?
z9j$qN4~waMCPN8abTAwNKS#qwhjwt^k1!Kfo~~S}A|}Q^{GhXg^yJ?t0{?1WbOZvd
z00Ahn2zo{yVQ7p}D(Fj^(d3hOjdFdkhc#bu#qR_85WfEe5Pbh=b~=4@N{_Jd)!F&%
z24F4)?^;b;IqT_$J~!g?T4~AlNsxoEeYf-C8Eqt21&ugGEul*%iN08FZStAZp(#VK
zghOP`cw+lZVc;fdPc^pE0tDfF#v5^%SH^YjhEh>(v1z)fJ+`sLsXaFcC1u=VzhOps
zK7FVcLnIjorOGHm)k9O8Ga@9&z7@%QbCY)BxeOvkhxI2;hG=2Il*zA+{e>=f8lrVg
zr*RH?-TP>edDJ!<xH=G6pRj>x2jkKsN4!~NYzZi87)9AKcLjwsn|bVyRzC7A^ORGi
zIdioTUy@4v$lOH+y!PU!Fmz)VsOLV@ljkhhnhvcu2||xXY>xaOQ>IDaJ^74U9YFcj
z+m`|jh1+lTfdZY<v_~c#{7t!^Rwb$QpT>@d?5&dZv|BrkpGu}CXA9qVGMeBG18;e=
zWU}fV;LD$=8mT`K9nYbsH0|;ljJ3^BK`kHH+jw15uWWeCsfH8B3BA_~H|_Iv6MffP
z$d`skdh55z_xKTebh1y;VYHikezqj2kTT*pW9oJxx#hs@hCA7w3>$Reb6ucp9k^<u
zlo+CO9R=r!hF7^_3@F1qmZ8LQS<nwjI`Hu>zg)%dEnUL$uFwxpW9xFF^0!dm@hIIo
zcW2Lg3ClE0F**^$Z0Sf65q2QGQpZE)K1KzOlLc)aQb*&S4V;6laTDHVE8UdFyR5aG
zFbx_5dX=_=w5)FeN$hLl=Jq^xt2eR#aZ#<>3w<hHQc~6GH%28ibJ?(L2ny_4I~+PD
zU!gr2jq?2joy;ea%N4)2N}6;|%zgz)d=g^-I2;0LjQV%j0b09sG!40q9O1<E<)8~_
zzoV6n@^%0N%0|$N_=uLXX&9$^YsWGF@bU!OGASUFsj24fAg*mBH#>31%C*(APN5`s
zVk5Kby?oa~*jm^W{!vj5!KZSCfUBg?vCAY!z)`KK(iroYjy4V|+UFKp%KOqPsoiE(
zSm0v+^313NQ?+iCBjEreg|k$v?Eda3|20DmQL&hCNUg%k*;x-2Ev_C#G3E0VP;~6U
zHUj8MyY@%NFmZ6jGr6FrNIt@A_5HCo{k!(nx6fHvFa%vYB&v&&@;|UPJEetypRv`Q
z$tWo;%=0@tWTj4fIDAv6U`P!|0n9OL<em5N_XIO-Dk$v?tTaGnmsjx&rjv$b*B;Y7
zHVV8(TabKmqXl_Dw-838l@>i$r2Z~{l~Jk8fB&Wg9r?UqkSrCwNNa^H_E|=^did4O
z6_eJ1L9XH)^q+PXW+c4tVCLlx?p#`yYae$E1(c)o04Fb5TMnulg#CGw_Mlj^_E`MX
z!^!2E!ztUX16MZN7~J7;hpy0Nm93JfUL77c1T}1ce%K6k*f5X)YoQ|FpC6goLhP)^
z9JkFDh)&uO%0i51E@q5s9kLG^=^kKU;ntmkrxhI>@P)5T->v1NSm8(knjX1PRLwSB
zyK9E%P!&`djLcIZD2i5>Ookn`t(z)S!{&5gib<9tIw|D3i9W!k_${GYt<d9}jWyr+
zdWOp4<Lq>bzqy9?!DPpAZc{dfcW#ZI^~$Pt$<o!@iJcFk0Y!=W8-LSXoP$M#2QTN{
zYR;8wzO~|)%tlb%q7(-IA~Jm3yk*f70izhBqHL5etQKx%#@C1nuSqqZ#OKm|gTv?X
zC1$)K+1%fm8&F&J0_1rgK#=^48eCX~#}~$Ck$iyo=7Moe+~!5S9nQH`7q~L_L4_L-
zZT;s#1;NT^fe~1MT$gk~6%7H8yu<W_59s<4?Oqkj7f(9cY$&h+;Ty9BQ0)FWJOSEj
z?ZX|^38PaOYdqJXPz7qNO=BHSH2Q<(F}{*+>ZPYUZO@mSk)*|S0j8059<v3~jTUJE
zDzvnepnw&3Q#=vPV1Ut;1Qv;hl2Y2>O=nL^b9SOSC@J8iBpA#wYd|(D4<e}!0`iaz
z__4z_kdch;lS(5Z+6*J!u&5q#0pNHI89QI}%cDyX$&^lq<<&<RZt`cgg`#1Nb`0j0
zqe|O(xkPGv)2Rr}bt|O*-7BEozT|z{)wA{`8$V44q(%1OE%VR;dT6n1W=Yrj#u_OO
zoM|5B+59ZWPsh{OmG9^)^UBRh9+)Wmu(_t`-n5<eqwlQ3-*tZLfcxD`P9t1F$qAke
zNXWJ6MPcE4h)d%{25cc{3$|&w4#s%fe^tEYAd$#>tmS2N%jXDoY`G1*AECH{CXJ@Z
z(*_MHl$un?lbq;W1_Q9TMbp6V!}?B-lsF6X%O!l`16Y#LW5VGqu~fme_Bt!Q!`2?>
zNc=Qj*ok$^wrn+vanAbYw`Ig|K1}=Rd_u_%P_W@e1`iMFI}_yClu%&OaOO0mE^V+~
zQ*Mw==UWXgNh?Pdp0y5a$kfs0e-n%sY}E2i{^BvZv_!BUT|lYVncnUT$ID2i_-JXH
zzgHt?oMJpd|7f`mYNHYlo9fAMa4qwUHJS{naI6riEw5zc$S!&FWv)q%S;~KZQl2)^
zrrLRK-J_z0Yfb<ygD8HC9Y5nxq>tuD=a8C@W7u9kiz9XaK?$EcwFO8+X{Ss2zefXm
z7jVcyU369~jQ#yT;xeDeSK=9b<v(*(M41t_ak6;9M^5HGaOZ&vTTj)B`U;gXqVjkf
zYUkkU_E@?VT~~~vF2VF(N)p0nU_9jAv^jL8WpiU>u>>7b>w|u;eOD9EYt_{<(0(g5
zL&cl^5~%qpF7=eC*>l90_=Dmxb3ib3qsu656|fSAbh9qu<o4EnG)PXBg<Y>X4^;?O
zhZ$+>;@)4Q!}+r?9p)z%bz%zfBF&0t=rQ_sbS6RZK-_nyP%W+T1UKyWucY<D6&p06
z4*}rAf6n8XGqbUVPZkwD8kjQ8bS4gBO^4<H9|hImyb=1`)541ua1}9uLat@`VzWza
zzzFfNPpjY&t3LKwxh<FQW8IQ*&~0plFEPNIS|wwu_+^E=m2GnDqfF4^Yn<EM(+#AN
zY`|<2_N0_sG!L_y+p5WRh&TfGj7~U0k~UE1&?w)wEZs&gDhMLR9*;5JE=?q>Ev(4*
zH)SjI#pY6Z#NawSin4PBKA;|)aJs5en>E?MC>jgyhMlN4`o**REq(9bVck)LMNx`S
zz%1iR67Lmb+*86_B46^DwbwLK9NoWAU(`Nh1?l~6=f%AOnAnHDSDAAP+2|agrpeR<
z!dU9e2J<!y)4Y1b*7=~&^e>Kh!c8R3D4N3RmRWxHS$!Odtgk&go+;+Vb$bdZMxe8z
z)9E1v75M94MOzP&Z}zH)!-H^6aResDV6Rv#D^oV%p$(Zo;mJibyXR?<9CxgoPq}v-
z?ijP&hRJdMSg7&d<SfL1O_*7wsQEh{Hr5#&ekzW6-ce*u3ZN{rUoj^_JB8A;xxkXx
z$w&3qA(ofco=P7ZcR*ZQw`#CdqT+|WdX(+vx5+EID`6u*?mB-N-h0;aI~MtG6tgC*
zq3~Y=cGYD~VMovxxbNGX-H7=r4=(Qr`4VL_2D&Ei4-}jf`|KERawMpr4#vzrG-P-q
zlbyXh4bpi&E?9IU#$spMq4hPZ_b+m`L=UIpq23ofSJi^JwCLAURX>etVyJl~qPsMI
z`@Ow7dyN;h!pE=R-2U>{c<H+%UQq7FA!}HasE-v(64H}I$B1A@8GCD;>mc8MZ>b?J
zwHmBs7KN(U;w9GM<&V@0tE)+YZ`-chRw1ZLA^cB?n+QU9sB<d%oaUE<pWD@)<~N@m
zCXyNN$d1LEg%l(2QtV|b%w#!VJ>bN4+_zsVsrPy{PdZB0RI?mOrD8cgwa|>}K}EHJ
zYbvL&kSnW`%tCZj2;hsqoc?9_m!JRg`Y(GqdF2TYop_iQZuq_0o@J|g^X@B5ajy8c
zUD$}8gK~++<4{KPUTll@uX1v;%iMUqvzx*ZoWmHVapu5b$VCq>7CN+8=!8Na{ZEG~
z7$-ugoD1cA(+;jx79-rRb~1&3Sqo!Zpyo5#n7BH01~a2M)_-mTMcbW0H)OELe`-5{
zOza5~_K%KD`1N!9A5Z*GOqTuVCi}qfJC7f4l*Ip}j}!lMqZe%cm)N*TAj&@f;qgDq
z#-CyvUO)6JeX8TXt_7Qq*PQX+eB2Gb#((`1A6t8tfdX;xTl&fqsV|o=-oJh)9*Ny;
zPL5|D@I!5R#P*0>l2U!(mc^77!AZ-LvSO8BrUCn61Z*u5G!%bKX<LeA47Xs6wStdw
z<2fd3`Iss#4ol-#+!LTj0`|~_T{bsLuV%BcE_TE~s0+TAUGer8(FqVJsfjV>3T2Eu
zN=D-eVBe2t<Tw?bPvcZ8o2MA&l(8S)8rC*~8yEph;b`v(09R;os&LjXWsG~d0mIj8
z*vN*8lE$4#@+j&wpo*de>PqN6HyS5rXcArP2_P4RYB{p6HQy3VdK;ThH=YI?-Qe1k
zS;^b#AeHVJjn@zh|E^)9ewK{!goG(~E0m#AmgG!r2+cT22PNc_r{GZQ0it}MiHHCL
zQI@4;54mhDScc2UVQuTjz5V@HY6CD0v)K($tRa2K6C4Y7IMiH6GJCg{h8-^rL6E+C
zwe@^E-wN_6m+DC#3qw;^B5D9fU}LQ4xxKrK=C5qdIZG;M@T=YTw=_3ZWWR{6%yVGb
z&NLavgA0t&gYi2$<8)p^%3QpOcsM3cH*)N;V8S;DkffU~=wV69JAq*tzUT0XXgH+@
z-{FJ6a12^%UcdV34<+NM0U1YW^iL5u6r_ha1?j7wdi3i1?`<cl##31Za|>kzUF9@}
zQ7e=O0x#$d$!Pj7=~-lB-a@B9b0S%j<o=KE_x}FN_TTT9P7hqo*v3T58~}$V9)y?#
zlbp+?@CLqd56TAKsMzyW>@Bw_=HnmKmgotYZl!W~d!_W^&<>~o8c7YwEHa;vq2Y)$
zBzY;_6aU&ffFSuPlWT|Tm5(R)Y7ZyrufS@Ubj}(<#gCJCY!4uj7=4vx=|hz{@=E6-
z;-+8kyxiT|-$wh-ARHWX=5}rUv7?;7NoEnb4W;u5pC^Zzx?oG^$VqN%${V3}P5)Y`
z7oARL7pwLZrgkWMU|0H!xQvAux6omj^OEJJNbg1fxuE3@W64WoSzmUkL-u#$qWE`d
zL3U*0f*c;yHej(zq5PFj<0HI&e@Mg`9<t|F_N<Fh(J^ER<tVoMqQ|lx=5WlxYnvb-
zm7dy*O!NMOlK!nbQ8wpr3ntg_o$hEHQ5HMt^Mk{NtC~3=(x_)C?+ei>2eOQ*)jm(r
zEhPH%quCiodY+vnItozXT;e~2BgN%M&Pc0vqL|-}R>-T8(h^vwc=xIR21qB#Oij5K
zIpM(DEjlGrWZJjCT$KUlMWeeI8g*D7@u+i@+<fFqVUpEQYgS!!j6N#nmBGA&WO{Lf
zoQrF%6`dm$V+yN4Hi=O5#Xt=I9atIhS%jB$`D-#W(UG~C#_on#dTDe@%X9PcIGdpE
zV*Fl&N;g(`+lYJh&5K<9G&Ps(A!t)$4EiSZPh@utjQf?9Z<m!-F?O~lrR_8-#<|g|
z>{9%0YPUI%YE6fIJ^E)yH#)_X(*GYg)$smEh*={ufhMLwlHy(3@x@nt<_7f{-6mPA
zC`oVkS`7T3qVW9iy?9LVBMNWGWYvhnaa*q0T2M}f5&Ff1>5)t`yo?H@w#4|+iFtn~
z@89<C;ybb4r5kvhiuZSy&0&{M3k|V?=!rG4E;hs_Ap3;2U!{dxuoj+*pe6t4sXx}#
zAM5Imjh6V$YR3F<kxf<hvHIhQ`s1nkBj|ebq^J?I9if$Z21f{;H&%jfZ~gw}`n{{K
zvcLpm@u^OkeE!^Xy=<4_EsXAtx-`v|`@L&T=i@LtzV<|hW=_>gHj1P1FvuqyeedP-
zj=rzu)6YNIsMLBsH|hIEK1J#Krk;;qr-=#1f7CRoV0pBBp@W?Ey*o?Nldl%1>#|#s
z--a?!;^8nFVGNwf(V-8yb~;qYkz-8w8mx9H)b(r1OQN<&M9cX^nPDhL(rTg4$i0NV
z*yc$qg4MgGowtR3Q;mpKUF#sQlxqO}8yqkB=Bx+8^i$9(J_n)tspokP!u8YIzYC8B
z3o>bN6GE}oQoCFlJsJZdI8yiK#H1J2^5VV4imx@2!g8m<d*aJaLERQZmhZ{(y@uu2
zWcjtLMv|KjN$n{_*`6p?4V`20>2G@EJqlFK1ii<rUHC5$n`@7s;!)Z*)ino~%vI$l
zgWMUb>-QVODmjc|=V}XFGFkSx<3B(GTyu&}5)3*S$lpEnyJoJwdHc)u-><Izm1L1Z
zl(<4+ORT_O*1pQ9KTJkFLpg!w^+9raiuXIx2#xTZFK>})Pmz;{ed7sjuR;-ku<D6{
zSQA6B4!<`*584zX@mL&*C*l}5CC2NxV-Wyrf%p>>5v++s1nUCStqt){5p4b^i3NEU
z0aO|Rg^qzbW1!0fC^8lQtkFS+{Ve_*HDXYsXt1#~^T4h;Qi}#&kj1B88D~kxQA0!c
z55ytheMrH<&JxbM!u&x&7xZx$o`pGa#TMFCEW&-Lax~??-g5lsYgNkLL6dV6S$61_
zt>Eje_xnFTQ+6g!Ii6y!!6~#2yYC@g?*5NFI`=WB;h%}wPh)@*=!70@rq7~TBb<ZW
zknfv}-Jjtw9(h8-yu4nr=*eH%;U4t^ln15>UCobhtKh80L)W{83@M=;#V)F_RNVh{
z_wAdP@3!{#$XsERRkQVmu4k6r|3c3EGWWl_8$qvd{|k$Mz5n$EK3?&PgYVw|V&<iQ
zDVzW;rQkNO+~$jc%G<8(et1dWyQNox&z=W3{SI?>=lcuyF{PpE<32@xr~ul`vQ?bP
z<v3BGkkDP;0Kud9Q#2{Zfhv4khlVkm&1H5=Un5gnj3WvVu3h5^DuR;kmJ>QdFEEDF
zcpWfr-eQXmB-jUKDvyRnXsa~FfI^kzNUcRob^(&#Z2c`p3^BXFu(A;uSo4eY5s6_U
zLuLnW@cY%<_lW3#*>Fz}x`744Pvm=!pn^hxq4Ck(R)sW1#l1ftpOA(_f5?+ubiy6S
zr}3=lRD}^cIGxbPJdovq{6cXn4?Ky5+E9%>xmuVi^0)LiBa;=rB$eMC-jDbOZ$=!L
zmMv$+aIwp=Vq|Q)H?~O8C%(C9tPrQ)+JU;+eVZsYz>e6VQf3_XV@z#)sJOgB@X@^B
z;?|@fAz*W9i9*o|`-9)kyWL?lYL!S7D6y<KDNbS!uu_{}9$X1$;hj0}z0^JpF@c4>
zxF`hq9WxpzR<7cn7crD}C}(T!MyXt5hf=o6PI~<qP0!9QL6?x5psl_A?Oh@&J)lj#
zLr`}M(w2BMp{G^xj(DzCPnNu#!9!XWG~o(bJSMB5@F6m$2*&f{2VHlQLMYSEWTXI<
z8mmDxUnT3}nF587DPZxpD2+!K8hp|aX8BF=i^;%5$*N3oSw;y(AyctYFfi0*>;8Lv
ze#pa-2p*jKEeuktNI<vw0`HX#7=v&OJB8#77O#)ksze!To?tMW+1yG0=HRuD9AFI!
z-_YTmamfJHlCLngEIQyWBBtv<8;Doe6Y`}D71|fgr}lQLG^`y;H_>_?VhlCP0*kmQ
z&v?AIoq%d2k*`a<_%&?IztpE}|2GZiS#(1i!0P>9uo<kcJNv)K-Sv&H`@b*o@h;Rf
z_+k>x(8I>jhgwn+hK9C|YBFVrz$^3|+)+lWrj}Z^s=;sGZN1;y7FtadzwYkrZ(D10
z6F(I6L3z2oFMfLa)_V4C=gmv&!OokX@)FjfKq6E^F53tB*)2jmpAa@yv!;^i(ug%;
zi%8S}(P#JV0#sRwEPG5A@#EI6e%^Fx@zVs?6w_|(TTbLsB6n5}V|cSvl+xEy{#$Q<
zX^D@B7i|(64?;GL1~H6s!(n*$)7Fa@{JwKM=HR>wkCN0D=pOHMM0(jnj4uah;Feb<
zXNw-v{j_nGDEcfl&hLJD{`UQw{T%2&^=MnPnfJ$WcC2U<4sqj;QFK`MQ$_$InVr!L
zp3R1*NI}`%szbeABl7hW6ouFV*QZ|ZR;jo5e0S&FzIgR^>xH5q8Hprw4OfLjkhMkx
zSrgeHji<P?01@Bf+wsD1SGhi2)^1&fh!P<Zcx8xPrpsk|m4)tep|whBB%kz(kJc(>
z7Pk2)9G+70`Pn$`U?K(YD$B^aLd+-mZ(-ei{r=VdPRW|8iA;jKd}%JN_5Zxze!u;~
zuIVoH3sv6!u>JgI6o4}3diVCtOQiWy>l7;s?r_%(^%oeeYw*(Y!}BLvxE5uCWz`gt
zxs3+>7H0DH-?m;EqTb;Be}^IQ3;ntg(cV1jlmJz?ekA@mkLEBq^C=w`%qI%K<wi&~
z{!xZ9^bgkJFLFFpDp?6qTlMJJE#+(9bicX{Zn!ZWpo|+9B!F)g%NjP{nAEb@^`ajQ
zbCT+itcGSlq>OL)ACZwbn<kSi%0zs63PTDC-1uS%p0dsZVIb|31RF_=4aeu5lQ|`W
zN=8OfaJ<bab01aHxQK8+!D9@WZ5bvBn!fRGy7-GJ`fxZgeZmwb(r`{!C(G;w<i1T8
zhKGmbg+(l7J~3U3Xwn+rjZ;za?t^I?=6CoU-@ES`(K@9BSKm}kioiQ5^3bE`^KyAb
zS9|#(I@R#QCez~=BnTz7m_#zjJ?Q>;nkorYvWa+;ut!^VoXp3={0x@-@%tDWMb`Io
zPP=YE${EH0;-@4XL@M$do%nJiMrAYPSpLLvmO^CCctfP-S&oJ5b@)&=tua2ron@NL
zkB<Eq%IJ+2o)1Ltz=N!iVzD?444~vfPR2I6K7?rFfj3S$zP%X^I9t0p<!zl!EB3)M
z+L*50b86d6yo7~m&1&$^s4<iXK-Se$wXX=uHhWIFURgP_&|1YTxC!0SXSc<C-`O*?
z0KlNmqI43DpP`ujBMw`Q3A*(uiFw<XXF~9vlTOE-DeziH+AuoPD2<b$SljH{QC8_~
z<r(HOOxWZUt%41Ab1N0Gp-c?1>g7Xo<A=xe>R?fct7J4nlAMvS!q$$`<gDfDY?6k?
zB4@qF=gD|@C=ruweq`KqZTS`<kVPEV>jjS^>B!S+4%f3Ly_yZx995dcmUtnRXdYQK
zcj%6v)RxICFM0o6Mcy9A<FtyXyRP#zKd?`uK?KSUC^q3N<g8d#XWfetH5`6P$|6be
z1gM&xnDs^;i)(fbr_(WKp|cJ_JQ_C!&nV%Uc7b`XoPm`3LC=_<m;PC%M#q|1IH_d(
zL@AlwDOS3vxW*WM(cv4&MCyehtS2M~cr^yx<o2^jFJ`$m^Np8eUmXJe%%8IJe@yNC
zh5WyR$7{V}{*T9B&;P%~$9w*dgP$M!Q=UCeA9twylrO`yn1pU{Iuxz@c@94;b71>_
zDq~E@Z(Sn{X9T5o+HQ8)keX_Tc7s<I1c#yxm5cka|L6VAz7F(^YPPY<()qD96sFz!
z?Jua*BS8vUKf7q(M{5hJtse8wyLcL*YntgQLCX!nLs#Hw#}cVj*~4ncl$Y&CXEbc^
z%1Rk}V&Rfu74qJ5FavpfZ=S_f6ZG<`n0uu;&1g@Jd2l1%C5irgG@^?JpQA59JDo8%
znnswv_`D@BxYxm-hoF+8O;_Dg|F1NeC4*#q6Kg<?{}<-RaQ(kFHop3QeUXpf|4R;j
znG4v@l=hgesZczPf6k-yqS^Fo+2Xr$w$O<x8C6iedSu0$=qMyBvwPQ}AuRVhL3aUo
z=zzBznz!>A+Vl8|;<6C+yw@hmz#^H^x-au06t8@=a&b}s_g6Cg=T)ZR1-X12L-8nW
z3hx?U_n=>U+xznJ2mU(8A0U!GFN8{TK821zy5DWzeJGA#b-X*eTZxB<2^1=ek-i3%
z-`b72#Tk~SBT~XZw}g%2v?Y11DN=8eNk^V9-8xGBF)U-@t)lZ9ap2N;u_KZy+$b53
zlQTZF=bL2eAgw8Kft)V4JX>BylPHY`zJtFSP@S%+f%_WG`zRE-XZ%Z?iwp7D)BpQP
zKOEz=f}zp*Kj#U&ZAd9p#eQqyf7oK@B)Z^l)Io<L*}628H4(6d$UE1-me7==QLuGd
zZEZ4)Moq{0Exg{*f_CKZHvK*@(4<?71IJ+XPOZMfi0;dz(GiBBL6Z&@xYHiEb}Gti
zOqcR}d4cJ|llVyQpFQLBA6D1{E3`pFdy{N*!PcyAlsmhF8FtQ4;}>mAf*k$x8@C%J
zEga>0i&gKIIiRWv5{h$FyP44aMKQMIA>H&8YxV^qe_m)s^pEnuz3{RGKZ%OBII$uW
z^1dWak+lzTw<FyBv3z+@sD5?eV+w^n?2133e->;Yko?8!_>p<a{h$@oPE)UCjH5b^
z#^Dsbu=%X@(ix^sJ0HR;KTyQ<s+Au^+Zo6*q-*iPkCXr`4`Aj!+oemf!<g;cRNu_k
zBloCNd+N5l?OzpXRWV8OF*1#__qC89Nbf7Dgg-F_D}bnswkS$bxkn>yKTS@ei2*m8
zY%O8S0$kS)&oJlfJME!D^CgodQ6OT8z!dTLKode$vk$g2&~b*R5y}6O3|sd*>H;@L
zjKO1QAb5R0qN7VM)@6=R5rXReNUgyM?sOOqha$^F=-*5zJAk-+W}I`|aAuix%e|!j
zeWQL!k#>EN(6RNa{A&h}16v`<+`;d<qtsPx42~n1(oQNfAp3aCv3tMq!9%+%afzEP
zH^1DwH4)B0>h<Td$jJ_P9DxER*7OseHW|fYrx>+*<hX@gqyU(60DCf%Csxxi1%NQi
zDA`8P03za}NrJ86`y2xEkXw-pk8`2|Ty`G6L(zufip?kxG0<|%v2mp;iIUywt&$dM
zEUIZ@&e!~zJGs<T57Fv)=>M8<;(Bcv4173Ert@(KdfP>9@%z2{ULQB<^jXkbt1b8J
zX}7++wWqaZ78~|zCbMUvGpyZOZj{buZd$_vlfmT0XFVU6^_G}<H!>G!7a;nv-pt_q
zg&M7zso=l{4M2Sb2Qb3=#^&Rvl^+ij3AEIxf0rp7XlCg=IxuEwP4Q6(s@6f}NZ)dY
zMMf$MxsmT?T&v=4zRyAD(@+f35ENn#yMW3eMctipn7=6>6F7u!>b*whe9F8#I1XWD
z8r!c3&)nd!fxmuy_3rIE{=SL7CJFBG3>$=FMky%&&|jMx=AXKtRQpH6!VEHf8OSY+
zVwrKrhFYOK#uhG%gH&e!*9nGi-~gc7{=XLVHXgh7e|-Jb{{IC&C4pMx;JZ`wSD1^K
zf<YG$*=Y#cTs)aYM^P$0yN|<y_C4^Vt`@F0c32QVur1UHsndwB(uxps>I6QEHU}0_
z&2u!+N$1t>dm*!A+i;R1+8ElP`*`i~dhn#TUQ^Od$&Ctqa(er?mf=a>h_{ZVoxj~h
zvAT^<$vA|;h&+w-8`H@SA6Zeh@0P7(Pf2xU-IEX-`FE{RHpyY;WVcW>zL;-h3;O$P
zHdf22?u`dOhp~fqe)-NceP<KaaWY9T4B!8V6$x*ff8TQrhj##9<<o`ndB|c$D{csD
zZa6v7VPLFk(ry|Wm(97gmyt|e&08uPEM(F_I39pvPg#UvY2-JnPAk8vu*tB4h7ItE
zx(V*IN@g&XFdN#BGpC(Vn9Vrrc*eO$a0IEer&}C+3JdU&vuGZ2FGYhPBO}dLZ7li#
zfV_{!NXJrD!dPu;p+U)xJ$epyc<})#M7I-wvEwljiNT}D0;dVzCMKuY0v@36Qq`vR
zPMVO>IcQD9sJ~ze8S<VL=Y_Ilu9O`VUyjJ@(<JhP_3qP6G~!j7?sSA%1^N$G_B-=a
zVwC)*{M#L|GeW;cBq_xn3}G*lpHXlK=rJl!7gz?favz291e3Wt?Z`_eyuS3&Q*tQn
zZyvVuWzAFgl_t)^Pt)Nj38`z-A39xO+S5oFnd+{tD+T?MZ#iL?Ovd?&b6*iUh1Z`V
zTI*GNJX|YZ#okx3=i;%H*t2HYf3mm}t{eXyHkwMkGc#uAS+tlWyd&OXSmCoci_E%F
zl*hwOBRo`;p?k<WTNqv_=nU=B64pH6^KikHh)Pe^c+B~LPDd}rS;h=N(Mn4zo2Ufd
z5{n%n6@keINzO4ZEDNs{)OFdppXO#ns~GEj(G};`6lz=eC^n>(M=mthBD4B+ZTY&k
zC_ENjTR`Ng-f*X`7|T;``x9r1Ra^Q=d0{#iSCITg^vcAHQXpG+^r0%WN>%#G1AP{c
zPD`FP{<MoD!BV!0yDKNMN%_)g>!8*e>Y0`7!o{l@U4s7<4`wWG?1o_NO;TDu6Ou6Q
zrehioqFY@K&6N<@W|Sn)+P`atsa7_AT~HZVYVElreooFP5&{|}lX+@Q6f5Qd^p7bF
zme`B=CzN4tl1WW?GW^~;s9Wb?rK2l0?C?Uj1o>7&CNAmO1o>-lIy_|imGT0@+|fh|
zNgQ=1qBAZuwe1$mx;J|ms%cD;9D$9p>@YTbjd&StYjE8~u{7qkw@{PBJPc7~UY-V5
z-R)vk*WI0xRaf5eb4RVT%yl3ZXw_W_y03qP89WQe_i9-$z<jn96VkY$%s#`4<<zC-
zFdL2><||cIWLv`|$}kKxNF(X9A;+yB4d}WjU?LMSf8&G2z0j|cHU~X`=fCfWURRvP
z6FN>_L7YE@<0DW^hos45V-T#Tu(o12?|XIaH#NAIRA*M`0C3a!tiv;|!z+DDT^G)S
zY2<&cb-S%bsQ1Ic$v8Rcu(uxTHi1@Z>?W28&i+Tm39pZI;AgccBt|o~LDFlE)=(8G
zeZmgS>e7`S<ibQu()j35X_qhwD-}#C%p;D%RaSx0D&olD1TTDzOKM_4K$QhBbc0mq
zg*tD@`@W<-f_0M6HE*r<<_L8}ySm$}Iu&|>w!{Om*7I^DDU#+2^ZoZhl^klSnHN|C
zCZNFtxM{+K;sq4b;h|hZnxrSkE0y8|b&by6&da_1x9{XM!*$GsfU?hI=zS7&Py6Vd
z2KzObiFraA+~N!q6pbj5ftMrm++~gdYm3BFD>CnQOT4I473H7|FHCe+oQrC~IN=53
z1a%dyB&c=cq)dHo=e_FX16PkO$cciVb=y!mJpRQu4ci?9ILooY-($JBx+aNkg+31R
z)2=Z(Yb?mLe&`Wl^v>hqzLea%L6PT`b{c6AP>aa9VKknFs+E<t)pkck=0jZX!Pk{`
zQQRtlXq0pXU!HeRX+=gx&TdKi*mgcNKL{46ELBnMA<>dh-ZTyja~hiA*3el8NFi-9
zZ};T2=FE>h%#CwR$9!M#2zDk1*jXU@7c<;ng#$@ZoC*)w2o=1}g&Kt)1gV|PPa`S)
zUjOJvj>!)5Cx_s#f0f?=-%kGAVQ{@TuqY#eJiC}mVP8NH-@{-voer}2GP6Qfy+J-V
zU@x${i5GBSUFT(tU)8S3;pTUzEj^?K+Lfn9Zrhz(<DK(?es8jg!47%bcYrxZX%u}{
zYrfo5ij`a=yo;O3yGF)1kmjg>VtlOr9HS<nZJ6vZvl-q)rs)%<u)RQAXr4Y!_iAed
z&)>e;H#GtqO4^p+;e9Qw{c;z?;RZr-jOVE(a{!Gmpf~_?7EUH1GA&H;iSmz9Gwvbh
z(2b-f!DUg87vp4d^bN`he2anH5E}}wqqp^9#jhURLpTvclqtMPqYK#zSZHX3NMqNq
z)0z(=HZp<!{!n%Z%~FCTP}F=@h<e<w)CLJdUUt!yyp(oIiLwAu#rceh1l1@ygVHOM
zk}p0wiqd<g;9@^CMH=P^s-|1?AfoqmRiNnIGw!4Uyv(qWkKE-8YBY_G(RmfLKy$yt
zkt;IOacjg{4wf!W$>w*NTVN|}OuRSIxrUB*rg0{o1W$Vpd8lYfK&@tT{X{rBFZRiY
zxkU!rR?ECGP;2V<oB3h$5ftqF&2|!Oay|*fr@%!I?|V{ESsA^9kOG|zxk!#Pyrl(?
zO{*g@4vj<~cXUlv>BWyQM+S;;E(|^Ksb^H)r{t&<-lb2(dcxf(6AC9-RF)QAZ0IP-
zXqPn(7DeI`+bDObE@efz=7Rdl&eP2A41{8Lm}k)tO%))5lIbn5pzYJ=t)XD)%p%ZP
z;@JgVdom~*baixBbZCwy<O)8?F;nT{EOyh8p7VvrZ)PjCvW-<lA{C~)ZsTe7L}z2^
zur%g2y!v_j)vLG0y#V!`V%z*TX9Xnf43{%5OgAG66`sG^*@pFOe|PKoFFS8u3L{ra
zWt*~|-KcfxM9=y)Y0Q+0B(7NaU66U2>@~+|6r~&3l>}d_uxrwMf=1iFJG-oN63gyk
zAQo?9`Ez$ij~&whz}tr+;sk;NvMnCb%h@qZLi6@tvr$vjJd!<oUlw+)SAN<WYdvWJ
z$t03DU?qqu{5-GdsHEW%0*aEHj8L&384Uu-Fn%~?;7W0QPqa$~HilWSOz}*^28z&6
zJ1;$!wmZ-^T4Y!7)}CdW6=x(#K)SWUS#lZ=TCCX6Q(Mp`lU%IvVi!1*JCg_8*1<L>
zwBZd3hZ#hLK!=L%O95ttsJ5tS9l>h}i=3Ltn9FE_=LHbHpC*)cGc*$n1)C>*C@_&h
zs#o6azTJO&xV!!C)!z@F|NQ>VFNZ(=eSdrJ-b3k?CKXo>hiJ4TBTTTpRHwD1y<bSz
zPX?UnNK$PyPjSdR)LV9m?Z6TQpT-NU0eenHS}gUNaZGa2NmwNZ1i_PkI`P?Mlmb|~
z`bmbTRD4OMB}+dOZTVNro+YPd*vVl$r1Oas6-Bk3?uW&^VQjPcm~Y;DY`iZ-gXV&&
zZ(M6Ox~BYUAjVm=I*`&36Wx3)KocG>TDxtzNd*i-X!@(Lp0Hs$nIvZu+&_VQJH>nF
zgEa0(sOgJ4Pr92=?-}(`rc5YYI-WJ7ia@NZp=MWd-3uxNuqDW%@knVaMq`AYr99js
zH!vx_h7!H;Pucx1j&Xl85kPD1e|6W_1NZ({ulM!-*BAMCHxxYh?rviH!@Hf`ZCFld
z!RB+_EYFjJPn=8nSnwRf5}KjO@!_XHkfQ{410^=>HS80n?h~`wSe!dA)~sql*Ll6}
zsb`eW_h@u0vJFtQp|3VH+y1n!_F4ei`o;n5{L!7rhyKpYa3W!EmT8h@vCL3SYr);~
zyEZ9MT|8G^Fhx}BOmkGQS_RL<yw@$#FM6wi3X!5xXDDDM38~~zNcy(8sx@mUJu{+&
zriF|kd43>r2Nr{f(A4FXG7kEw!ZDT-l{!R0g>fEiN(`g1;Te{SG2K)>cM^RVgKS0r
zSEWskf~UNOpNp>O1d7Tsxr+zft$hIaIR&S{B~ju4OY{la<6&Wole8LW&DjNzX{*Be
zmlM+FL9k)6CGn|dx{qtXbQY+4+xy!e0M5M#k7&1<9)skxpNM1{rKC)(8d&V_zbeeW
z=o~57bJLhQU3Y_?ziV!sHgpx-jCH)#--1k$Y%wM;M<0B!*Z1UjxiF?mqj{qG{1vxR
zYVU-zL+6$8Plv#r4rc!n1`pfo?kJ2Jiaxye58Df9)9lFcnfnav*(IhFxr!&lAZTNc
zj!DOG-?ut`x4pZ!v$s##$mWw_g1+(0za^sAH>V8!R?U8vniPK}N;7=O-}2`y9~6-2
zX@bWi?gUftsbI@pHtABByopdzcSPcG&8tH|fvNzc1WLyDNdm3FW?($lP<Dk^hELOI
z5L2K5(1TeahV3T^@|fqU2??6>l(r1NKSi`fJ&DG|S~vh44FT7HnBq{zBWDLFSJya`
zE{{_Ta{%f#S>K^_JR|j5=UWg*)XYrod2w@UnkH$>Xc!9@v}w7*Op}|11?^aD8%{o3
zo;s6-uld@{Vb>_kFTT|4uR>dbkbIIf6qFsS-KU43kl4Pwxml&Ko3I+@orN*NYA*1h
z1D_vdu;uvO7g?OOg%F@ne5Ij7m~8eZ4tw;D1jM6vdcDE<O6T|Ue#ZhK``2f-wOVGw
zV35x9spdG?mRIrIlZ9EXSIu!A6XJOZ1Snh#MWh*YgN30RE(aa?j)3$+F%2t_Ya5*w
z6q1#X;~1FYT(q%T_uxJ%SN9&+kAs6p{J7_uTcrY7gg>gpxaX-cD#N%|1i;@`1^l!J
zz6!&N3X!kE=q7|rVS+CzV-OpFy^SGbeDX$=ez7DGsDpYDCjA5i$e5=3L}{e8Dz2QL
z9`>Ux;B4&KZ)ukSeEx%YLX^e7zx!Ta(6B{j6{Lp9ZVGNSw9{&EVS%#&?)pGRh#v_9
zaMXlix-=<{LzJx^owIBcL6MrO^f3csXs?56R~<Ax1&tQ<pn1)zpsDY-2hG~?!RQz>
z&mjpzrZZ2fD=ULE!tlVDUDEEIF1ro;#uK?9K*azQ)UFY<$b8qUc(>-fqxCla90i6I
z*jU>bew7(gUKZp7hG@d(3=z>1Eax-(N`%$|ISS(xu;!x%H2$Nz2da~^<1{K<IZ;MY
z5{yPG`MFQwu*BT{DujAIgjj+wzVxf7hHlN#f~|oYho7xMs~aYc1O||Fc*r}lZujd@
z-q=v4;`E5mK?5cfQlwCI&0n=_fPxB6;a_Vx!?-LXH%{8rL;=d?<oqK;EySQ@M&eG;
z?QPz31x-E2kWS#_FwB)Ne6wK&LM_r$?{2ZImCLuD9@^ricAL0!w9wyB^6a6Ie<t%;
z-ArLkbx;H`6dO*lnN^HcD)&iNctQlrM>V4>Nh!m3Ukh$frl=&$1>cae(-fugkO%It
zfZ<xAgKN-LCv^qCxJh@1O`AN70co{dgGX-dpnQQ76|(BSYi3~pw?D`@fbo$k*#JQ6
z?!L+cz5OA-%%eV~&|!{j+Z@9x3Mo+qtCtNcx&F~kZgGIIF$3UEA@<}A0Q{0{SWA$#
zX56`5e0@`-KEh?84E80+ya)m}Li!>C=Ik@6kD<Cp<K!&k#IUfAz=N4|YA98PE76f%
zv0%J`(U7XG$Lvv#4r7DI^xR6u_n{ZS;+=uU(_U|F?QyTWw)tdZ{qf^v5t({0aS@rQ
z>@pIg<>+3?L{<{$2836pVg>=VbYtCe_6E5DsxUMZfx8|ZP5G_;GTN)YYrA%dxhxEw
zG9dgU>G?(&{gpt<KH|xawz?0Gwm)p`!*A#%nX-Gdu@K5keW3T?x=tDh-uVfWQJDn~
z{VFm;pEQP(!#GUSWEuiVP>qBq{VW;JXQoQZMdh`St+zj+BX=YNTh6df8jYEvSn{Ec
z+(ENV)-jrksR95Uao_^L&d8e{kyGq(Jdzhi&cak*Ng2&yV`<!$rwjdO;e<W6^sYTQ
ziU+vY6H{R79E#i~i4m;nw&=H3di2~Ii5)J<E#<;+=hS==7;AX(EhT9d@6@tWEU@PA
zm3+MJJkC{@HK!v(C0+OS649Z>2AMS-ZC1bCR4(RTU>-{pfepRqh~zWfJt$UuBC&TX
zn(KzF-Ssx`)B)&70sOR-;(?2Vt^;o>1|kSb>jlf;9`s7v>n%VMXN%FZVdt%cob|5!
z*8XNv`~(N$X;(abQdh3mu-sb1a_bGtZ8R*m*|6N>hUK0#EcdiwxuDy$VABx^tRe9&
z9$M_8C{}V?i*w4<l&GBJ&H+!JLz^VEzokf@_R9>Y)?#6_)`B%4&RS-7J|V5%VL1#A
zo91zAj^m?aF^)b(bQ2IA>M04GvZWx9=7MyrBSjpCnY=R+qf5AFIq2sXh4ji`v_&fc
zd1I%^DYu-QMzRg|8#tpSZV&;1hO4}?&a*kMFlq8B9vVx81P((c3=;Hz!BD@_nIrFF
znt<*>QF`L&Ox?(g&H<r`kzwZ!I@qSl)18({wg{nPOANvzG@5+(_HS-OBI)y*XAFi{
zMS$OQS%d<GB~#@tI!Oi*-RO)$(xO2dIgLLvXC-)-G72a2snH?<GfY&b1kUa@BVTuY
zS1Luf5en=vrzrcNE=18Yqmkp;Y??iL^ymm`%=@dreUHdJQ2w0G$KyvE!Q<c#*?N#U
zF@VN;_vyyQT5ogHz6`{-6vNpp92_6c_+p@p8gZD-(kMLjNpV`iKyLTEYX-fYo|i8w
zvU)fx^T6@19kN}wnzcwg2t13XTwy8~`=D~McbBbPz37!|9=*o;jXnaTca4ZLZBT~}
z4j&Zthz3<V{xNVhFui=Q7umshH>G#ove(U7!D@3MMo^1Lfxj`c3Csceknl2##%MIX
zf8{<lSP}Fl#;T@J(4Y`#J~e&SmuS>cWg%j7=as|H&RY+=`<q@XZCdf6i`}&PH6D!N
z3x9X(p6;wofp_E@mk4Dil`vbc{oZNz-A5U?(sw9XG>z77#;Z*Z*m;MpF8{K<O{bDo
zn`wlr+zeC+k!s&sc8o)5onIaRia>S0Kh`-fpX};`UOe_Kq2hvwl-mUs+T_-v-Yej~
zz<y;BGCh4#M<uqO$jD&I`;Q6b#OJmhRI89R#Ib5Je^t$W3xQKQTuTC19E6fFXoiK>
z_(hl*8a{rL9X}K=wqHGDZ%Wek3>+3z!j>Kn{mNImd;zxffQ8mj{}Os>g706AE)CC7
z`-K$wzSxX^^aYJu{*>MSi6^7vW^Vt~-Tw(TyK8R#r%f#W_5RNn_)z50!RZj=0g6lb
zLrD<nO7syPrSuXb4T<zXhbyI1wbE+zwouV~+Xz`LziU(sM5-qx%SPRA_Dsfu!3fx6
z5zb-fJDI7-goQ&t7EN*$CM!NRV!gIcVy+|>gv9plt}l#^%8-}wg<{Se&T=fu4xGrl
z`eX<}#kgZpMeleHwDo@f=lj-qPqEy6GO>Ig+;0S~t^^dzz7HPWf0#zUQ^dtXe$;))
zG?ib2E8+lZ6QN#$2ElENz*SSOK<h_55wG9B+TVG!{bBq0pNl0@zCY(YW6zPk^OU$I
z^m7!3Hu_iKr>?<IfaRCt(dz(;#9fN<tvYuMCe*t#rf?xN_B5W5p_0%2kK@zpj5>9w
ztbhbVEej9{dJ9p$lt?yT^_uZjHD!BC%Yj$#xBgrLARo(5Q0J0UPEQf!mAfBa?!JBh
z?(Rcz_c<PYZ$E$gX7By$?OlA51^Dyy;wVk#Q~Xng@k{UCQ)@6@*sNrZFSm4@6PPzY
zF+XACN@tdB|848lP0cSHldyh<k-5EIu$EyM)L~dVgn!hmdh>Sg`R>lU{p)C3i_Dga
z$*4d%C?Cq~I23P^+27E&X74zJxl}hpRHMr+ntqUOU^+=;{y=4{h}r@?Lt^cw6?ECG
zdkG46_NNzYOmJR(*n06ozZ3VxNPP114$EO-3*o$`6v8TyYFfuq)Y`Hf<w5e6<ns*<
zMI~=2D49Fv6Aox21^6E-QVL=;-@s+VQT?(Yak*KI`_H!7vWM@6wp+I~fWGaP=_KB8
zsW+1Sgz3>7kHNFzC@-R>1Escpe7n2kLQ|`<c`K<tuca#ZdXv&-5k2Ro_JU@cG}Jf0
z_Aa*>?ES$Lb2uj_6K3Bqjb|5su9<0F)o5TETVNjE+@|N6Jbgz*6XSLn9TtVgIPsGA
zP_XlNGLc@w%7=;_c%0auz9_iHb1O1!5wFsX{t{EQ>B6)C)AldK+qbX(1e*(hqC`2$
ztO$xhIZub8U(MCf$8x+|0PYs$@t4s)EQ}W87c>ASsq&Tk<2mQe+jrZ$1?Jg${t7Q2
zyx)U;1Wfh;1<v|m8ce5M@&67ex#Y9^;sIU)eSpU!;sJx~wFpyvs(TIYV>p-Hl@xLO
zm*+tjDa-YtJX;>K==(_)j<o--;JCBoJQ_~oS^Syfb5b;3&Ohezs2)5_0rt!tIvi1A
zi;pS)R*u3rDXPbTX-k>K4xh;(z){C$3b_8;pMHP+l%4<g<5@DzzC`@b-s8<+vk?Dt
zZS(8-|Cjh+H2BjgiYAVskY72FVcYfxV-cTD#~jB4SJg~;yVLyvRbiFA0%(Ca1n$X%
z3Y6TBCm}{&zz|sNO!V&yd@bcD-8dgdlOtHkKBm!8Ht&lLuH~1o6tt<G%d6b!Ad62a
z7(MoIm`ueb`~%fr-?5PD7^X(;>Ic6Ye{-s&k7L<o8!NNKRFR%TerO0}3xUu=KsDQ6
zY5#tY;nmO0wCk!nEO3CijTuN^^m_@ux27YZsTYd7^-ccJo5a@2cxFZE@<NH&V6NQ~
zFlAN*M%szf-<9rOvTDcQ_CaxBRrup6<)wqlIiqrJfke2Ro3PPHVEA(d5=Zv#uXJH-
z&f)(93+*;A4@P{NBr|kB(X}~v`nO2(D<gZaLD--HVGV$KMTm%9Y>=qJS&R!cLgvXa
z3^aG4L?Fdqi9LE(PO4%20L=b6|5sk;Tp{Y#`Coq>*KN*V5gbgcV~nw!O(V=ZH^a%)
z#$2*x&Oy8mxuJ-E+}VHr_WhgMFq4ItqtF~nfJxF($s4Xj_nYdr=@t;80)mf6km9BJ
z!X3jni`F@OTE1TK?Yat2(y(9S(lqsn*J@FdL~4N~i6$QR>3S$So1*jB21Dwc^9i;v
znV;%8NMi9*Gyt)Q-jl7CX#I8`hV-l3<$t45i!y@u!xa7qdTXr%Q^?57>b9EP(kQFJ
zqsP$G3^?!(X5M!5NayIap_oV0r3~CArj)erqp>Vu#RHdRue>8Mnt%RmUZEnIKXNF(
zXy#^xz{iv{b`lGen82IdgiwVa%b|)77f1C^gD1Wi7gj<<%F|Ow(Qhd9(+<$1?a670
z5~-pHtqE#gwWH$c6Mn`({P<`h=K_`zT<1W-08dJ!W5v+PHmJSAFglBeTfE^2=Og>D
zL}=&<{EZE*+Hsp8Q>5(!3rtnJa5c(TJrJFqQyptJtK8`cx9?^ZIgfW0*nZk&7ohu|
zvpGrJu`>DUox0ggRWy?O+}M48PoM&0z*f3K9AzBJn(t!@8DVSVNv{~l&kpnqUG`)4
zhVL2%5mNPv@N%*B-qZD`n~!@>Hv#yAg2rc?5fBY?JuKRd5bHzJ>g!9=o0G<1UN?@2
zCe3M_g=3g{WD1W)@p+L9rU1$1N@zyqvSwXigo|Hm*sFK|!V-@<lN7c|5AZrkh)c64
zV!R)m!^3y)&YjQh?%`n>kUi1Sk=Y)vyHLJ;C*Hi>7b|86uY2Cf?dSraV&dhcAvR>*
zK|-VBP{oU<=;!_p`JBG0LsSx!cJSNz#>R30w6H2SflYzlQ3QxpB5H}U_Q3`&;@jGK
zpXv)g-yF!S0AaQOcw28?{NLN%|NHQESEb-PCQ(knv217Q41Zx3&Iu+&_W~S}&K1DF
z9_d^KU=e)~Ab}NEkze6f0ABSxuTbNMS8K*AGc5!*cwl_#nP1jaq&cY_TJTkWJt&e2
zrduX8cR}WeNfyK0!mD*c`rCle`5dLmb%+Dne>NYS;1-~YP*ySd?O5*{yaY4~-4HRm
z>fhqTq=bBtj0lLc0qNG6Qs^xe*#`k7=EGFJtYXzt)}=1(6`OOW=vVNj=Vi{FX1K$f
z;7<=(bJBKyGj}(VylOjy8+617Ks&dOnDo{L1_1Z*QnPk<GFqLES)GopsQs}|^^`#-
z!|}NA3LC;5+GTM!FJBQ4l)Q$G7H#i%t8Zw?LHFQ6;N*|CfH!SS+)C+w!0fQNFDNE=
z)B`O|2?$|fhu|qhi1Hrtu>HHYbgGELW&F(+Nu~G^M^!E{m-nyQvd=<sR}aPVTn*UM
zHDr>-ha0oWP^a9><ydl=cf;0<!%DcT>2OtS<IIIr(#^l4ZAdF@$KC~&l7=LkiZ&Nb
z1_?^OESaZx<l4uRNRJICv|_`uaO)XQa;d}`2fQ{H5m$lgmBEFkDoIfZQen+UEz%A9
zS_dAdNE%ps0#oaEVIPQL>3-$c-M4RE?*IMWc451skg!9?l1~en;LOJ=IPgaAsiP^D
zMa^~O@0b5qT)$A#>lFz13x#og_jV7<e&01IgX^od=+$izp!PJ$Xcp<Hirunqg0gNp
z!2<p0{ZFT`?Q-zZW|)kkAx&WSgnOW}AdX~%lq;%_qy<ESQi2B80f5GHQ~^Lx4?s5$
zRu#^~e4=)Qph@9w{Tj$O={;DocZGRD8`GFK!(I3IKyQ2>z^-?pO|K$`)UPlN^*h>5
z>#}#mPsw<koN@Nz*;yi1FmM+LM)Z|f>(OaMc9G4Z)9jwH1vfgAN<g7M-@n!$Ru2%3
zQy?-b<A~I1X^Y*FYl>5bL(M;AEbIlFS9Jx^V%D^1uX)k6=0(?=7u{%HbhCNU$IXjA
zv5S_^%o~~;<}U9`%#G%Y-<Pe|d~S@ob#tRJ!v~8LZ9F%E=5r%xJ~x8qb0cUzH-hGK
zBWON1a(x6%&vNy~(BHtGUGkwQS-SF(^=&kJ<!4S+jDY%$S+>ZcZeFGeeF!y<d~=cF
zeZ0zLc;qM`Wpam4RRG#<1A(r}HWKNJ6~^3OO-lz3fh)AQ+aX(!lkG`^xxPSIO*NBw
z$_p#1H7TvA_N0#2*jAk7u}onuA=|=4!qk0}YUR_>Ju0<`_4=`1prlK>a<)L*#Ra`U
z0Wl~0@80%4l&M}prMHyW=&kpjJi%pibN$46JHo}}FquS$2v{emlq;0%YZ=MXwz{#U
z4EBMg&0}YP*<(AQB^=EsSlsqvrh{o47b2|qzyEVO$AfEx!DD;7Bi>Jk7)*@A;9~wr
zj3&#jeAEc=Bmxn0(DpD*!wXL<oN<y$o<;16oT2+VJ{(7*nQC&HM!>Ffd}joXFCQI*
z+bULP`O2qAGX`qPE~tAjL{Qo@wH$}H7Vl_sueV1}4DYrZVzjQwXbQj^;k0fUr)e@=
zi>11YvlK=*POr&S`54x7RkiDx7^4}o!xwxUKQy%R6V0hi%0`LzJ8$+6UvGVAIjq;e
zfI2D>XCS@<Mds-}3_X8f7vn)U%dPe9*=3UP5F=Blw4ERIEeA9`PSa$TbYSE={rUK$
zGma()W*^qgrD9ppCOB=j$ALM$Koe72f|tuD%W~V6NT$eN*c#O;am@&%p|{X_nJWjK
z-vqrU^smDwK2T#6N8_Pv0SPdFqQT7Uuf2^8DiJ@a=}J||Cm}Z<ELvWP1*S^}8gN`t
zpFIl)gLw**$emz!*c6J_n$S&UmN<(7iL>Y^v{`EH-a%0+kZV*yYW?(63nT=zVAt>+
z8*HxE985uZ_D*8FCDyUHFMEJ_2tbrf#HuE8!by-l!cy^vtic2D0QV`T_m9Jhh3cK4
zFnrzIo7p#jSIs9C&say7p-!{`?vJ@{Q+EGjb}@|}-B2HR%j5CmjgtEx^l{@q29F>A
zm)N+W{wqKK;rBl(#~)|>4O{`LiT@eE|L*;t&9&~=`#)deQxcJLkh(7SJ8z!vHgdAh
z*zLmfHIRmulvM+E22VbP#sRKf0@rAx07^&uaLNJ(CG`M9qqB9Cm#JA6jhz78dB3XF
zUUj2M8Xv_I$~J;Xk=+8e6~zrVHR?p`F7^g|UhEGO<bi^RI*`mnUefsE;PKNZn@@u$
z>(!m;avO!te*Al(J9)Jsf2vb9FAfOM-d_X{OV`&no<3fCvbOo8NCUh9oLQ9T<GyJ)
z0Df3O{omtY$bGf&K@j9>fj;TZX>)~+yXKAzFP^m3GwGGPFj&AG#}#k|0Y3Tz;OZx{
z<2rJE8PGybhz`0B9bJ;kmJL`+t_r6Ytl5_U#IJ3Luxc`uud3iIabS3{z2J0snBT)m
zefNH<CdV-HPL2%)W5**G<{73AJPy(GQ97!qU38bSNwVX05fI9c7&ueY@&z$04BRqc
zG}5l%csnt;@-zy4KDohW7p{-iXpbR?sD(E(Pm^Ihx-f{<nT}yb_$kzLa>iT(8vMvj
zdA=jhrsJ606FL09YyxXKoAE-&#7xoI!cA#_?aLwv6&>hC{}ioo_N?Wx+}bs;^O_pe
zD!j(BB}4M#-+y}bc5A=kwLIJn<;xg;NFu=JV+u4M{xnX)nbIBl7bE&A=M#|Ox5AFp
zsg^4g4GI_g=&trQ7VJi^$7tw>>hz<QO3P>+t41>MI$Eu6Xu#G=fw{g)Qs~vAovfBq
z<93x43$(>F6$Rj;3JbZ^rKzbBH`ifYVs;y?%@jkbxI#C?ps3r_p-`z){1GS=)S%iy
z02KZ>`0I5gwisFZju)jSI+a35m2xri_SQtZx+C6BIEf)FzB8;r=NB`;Yo&#uj9T}2
zn1DD(u<8u8lK|eYm~@~7>R0nIcZ(*{Z`;qFsnP{MdyAsO1O}cGBcrd3coV)sr_G(o
zD4uxZ-6>_jJ_7L&wUmBX8?myfXS8BHyCbHn*(yLN&cX|^Ls|=vXb=&ocprmOLeBEk
zl3VX~L_ZpYpba`L&FIEcoT=8Jww8+G5viQ~H|>a-0)i5MCN4}-isK}P@uwK?9U2Kl
zB_p3v@a$=t4CjOBe$9ffd-f|{hGts2Sg{Jb8tApE(_OVyWT~+L(!*rlAIlYDf__i4
zC_RPcbC#sF0OTfTQV9(w>e9gumYw-;l6(VEyuDPs!s&L*W@yHCCAjx!y`V*wmhKda
zA2BTy$lb4zp8jJ$mG)m0|F>=b4TAOVMj`&w=H|v%`|p?dP*kO}FrFQPEIaIDiZ%?!
zH;!@b(2?zQ0nFXTr~Dgq3CNIQA2VTB&kjK3Y4?8T`ZsDnq6LeWtRrNdmRwy5hw>~-
z**=YYDYvD#D@ZX9w9z)brvtdp@s$3~;?Ge_Y^b(XuqeKC)AF%>2jf~L6XbsDLhmc`
zItjCQAm&-<8em>*zjC#vRP4TczxT6JwfMpfI*YBr@BC_yVQ-)=RPhRDK(pL{{jxl3
zGnLxidh?4|VGj+NYdkk+g_DzeGDV_^O<7OeSYUQoU!1*W{mz7*;_GaE@EI$-<)y3H
z<HqGJc#8DmtN#noge$O@&Sg(*0w@h&;aY*L)x1Ve_p?ART@Q3+m_J}LElvP)v@aK;
zLeCn>%f}kGB8*kGB!4gG=jR?6G4@wQCxW6~G{FA6h=S2{Wkp|wA}p`BKD^p~(*TlC
z<H%JMZ*`lGgIjfpnrjO)bY8WL3l?eQvCW00WIa2MCR`MKY3T$}`f$<6yJmi`aDQb9
z_c~DfdNOjq8&v}j4L{_?<Dqy3c)i@mKX%@{*#7VkTYV=wLN0J7pm(I_9bW^*oQP}^
za9}f?u*TA4AX^JWX!rzK#d}yhb&L1=CB@gg#Rr3`;$!w3Q>9Cah9Q+@8@bVTF)=%r
z@Av)X%i13d{N;Nk<uQ10u{^BumF>$ztY)~@mBri5C=vfTj|V5jZh7f%3ha^Q>@luk
z4`%>-qLMqtZs|(qD3o4+H_FDsJ9NEr*6<fE9Swi+n_`Tx$QRXk))lQ_i{7$gCykEg
z<1j5)DX$@WczU(Tla{RhD?l^Y7~u1J&9GulFXznE>Z*~<k^-v%PgYIf609u7s1aYD
zvZbQSQ??;@a^X^$Ww7S5=vuXJLMZWUx;EeR8c4JS#94D$)?AP+BE_mjSW|v%EY+$-
zT19sTH#L!RMmbAr?LH#Gqz+R!Btr2Bg<8R52DN+WXl?FF+53yFl5H8S@w^>EkjM`}
zrJO11<r4D8IY(eWvQ~(?2rU1@p@<?e8i}K$Y9b@hdHu5SzdSnf6)$6fOXxU?d^Jjk
zoFKo_qt>9tVBjlW3es@sE#C9+6$N5!Q5-@JK-fZSJz+9R(teo!GyDv@h~An<v;JF{
z#^Ep?@FMq!R=nDyHVe{qcdDy6DkYdbaRnCLnk=6%mqTc*4~@!VJWR?vUN+DPJQD%;
zD8<9WqV&u$EE~Ko7NdERH7Qw?W)d!r3QwD>LxTJg4?1Dmq_MlfLZI4abTt)h3rk;M
zuv4leF7+vAn{JKpYj>aMll8jwD?6IkCEES?77x&xt|`$WNiMh!iV?n0I6M?T?!vEU
zDs-PVOHg+m(Z+_|&|l;si;-y2_I@~wMrgvE97(gOeMP~fT%QA&A+NDWMV4#X`ET3M
zaG&Nu-#Gv-av7Hh0b{HM9SskPZKaE}HMH8gCSd&=1Z?1K%S|ohj436Mo4TW#-O8{A
zIIe0`Th(QIqBT@yN7dsWs2a5-3Ys&*B8~b9Unm}E8Paz&%R<pLyJ)YP&w2{vT3CAy
z_f`;Kkw!;1PJp0509CAppR)*$Z&)-PhnWZ`QnKCvL$mbm+gmXFd>QUtVDJ`cwBg`&
zZ)fmu)Y!gQGC)jpj+5uSkUJ@kwg>vqH#aA$nyf%bZdQ=EiUg#B<ipaH!!0KDJQ*Ia
zyr>0c%TS^Ejt1pWUnvC?RG3_GF6jy~ImNkNL{{NhQdQI#*;lXM{%u>d^B&r&e#uDJ
zj(A?6dgRq-5e`tFML9uzcvhb#pCX$ZeE0{Y(88EcBfy^Bn#!0(eduy+-aeit(x9};
z!jj_0;k35ZWwTlfF`fDG21qaMCR`3UYp@mpu8znsa!Zi7?To41`}t<}a%3uYP%1id
zRI8s{ePjP+Zokxe%R>7Bofu`u<UL1jiD%(S<TyOIQ39IGNfrXMJ=M?hm6M0kC~T*^
zHZ2lX*izkQ{s?m&SC=r_>RYhj)KrEQsm<3A>H&JW|Ka4~2&U-S^51vFYXpEY_NEkX
zN5RsMQ0#M-^KWj1(v;~0%h_Ilw>$vSV_JsC&-XjC_>^uR(NJK}CLO``NjJE6y)g&`
zn_Km(JK{w+3o$lG{3(wii}p5xakXU3WIM*sz~cIxFhSv5Rs{^uYY3AFw?NnKt!Iow
zWp6z_A|@5aSmJ`+dsl1GDeHI<;BSW{^{5kXnk-4v=@F)-$GH|~$(XM6YG>$a5>F@)
z%%?ay!{5Xo*OUl;+?J7_-kE4U9+b^&?|dDU&DT%Leo4}EdHhXXOuv#rNeqX3EfIZ;
z(08cSsCwB6OJ7MqR9g?O(WWvW;XPK*{>>^&?$UW6ouWddEbjJj<a;w36N*=fVw2K@
zvEZcDg0i-e`+YRNxZ$z#==#<Om2ATD(ek);;>s6v9sSDZ+KCq+b5+Qvm9dNGz9b6v
zh2kB<%Xoc0nZ_<|nkOnouV#cVB}bW7bVUl+ir#qdx4^!ycF(sY2QA7;4LGU+XQ|I3
zo4RhHc2mw%pIQ!7pUVBg5*(@9Eu~SBL)E7Vr>f6_TPa7}g>;9wlEE7jY4N#JPN$O1
z(yh<3m7EJ7YBrQN&q6uKtUk~+qGOE|j^$0vF)rV`(Mj3H2K&Ya)-$jE6tlATZ!;_H
zxgcrDGmS>0K`rwf)n|98wkJ4h##x%=$wFK^;f-h%6oQamO_HL5Tx-^~&*$^&p#Z0%
za$_`y6wi}Vj^7@x5(5X>f<}59WcX6Z{0HcQwd`gV)(hKJg$1;XKQY(i484p*k`7@L
z0^3k&UCgBA0#Ti(Uy@s!4X{l`a#&f8jvkt+jVrZUIkmNo$sP9sxq^CnHC|<lgbn2H
zo|nRbhr~e{jZL!$uhIT;J&(mGXX%Dx5j0?G&(c)M`x-ny_rD^SJwck4F-{FfsdkLM
zF^9-CEUl^6JOHfOn1x6e<PgE#ylBrXDq9k{?x-@J=aYh)G{(W_h{x2DmM%m4tuEWE
zDC-Oa!&x#6&*OAJPS^RA`f`I|4@1u1=1|!5x69-P!o>*hA<(k4w}`nHjYpjn(Fe3+
zs9H|chQ#Wd2Mk_`tZZct1qveIM%JmA@}`2A#|Q^mIKTznl(7u-xqqo)sLwqI66PE0
zY`JJAHSjmPv4r4Fm660bw-+Sqov~{*UTQP!mEP*ot>>$JQ*BY0Xv+agNP)o(l|l7z
zG{WFqzi#b6FBoQ>yVZ>rw==wlmcMMe&}Hd>C^5`t^cw@R*jZ~SmOVeE-{j+%uVN0Y
z#t^to8%v)HEPYo6%Zq8lxA(2hRSQ-=ii)^bH=#IOq3Is47i!yf{L;3s>^$1$OwFU#
z7|bKij^i;VhmJA+H;=|whWZy|sA`6}BYu=>Fd3uN7DL6eMd#^0aA5XO%qP+qJS(0G
zHfC0n9rYmDX*F`bl(y)rMVCWo?E?{dsFn-<L&@J}JI<Q@rf0X=bg!wlnpfrUY&3?a
zy9_*XSZ0YDUKb?yV9<9Yh?k`>W~0oQj%x1^(<>!{;$JSZ54Crc@-{^xHVPcqPx>P4
z4?s4I#Buz)@gDRkbSJ<9uGz#y1e=A5W%%$4tCPUz!JYTs?(VOy?(M(b-Chc@JABT9
z1Hsx2F5o(;2*H8dRD2(uPsi~f#$3MRXck#CV8S$f)R?NU2oPPO@i@UyaG?l~=HUPZ
z!AUZSVJe@6;&V9p9GeF+AbXQ^rYdi}diV1dtQ+W`Qa1pqb@ws^KnNvxI7lEA!mhQ@
zvFe$0ACWg7^qnhxG3r+Qi4l>u;mjL2)eNONDA<3!F6w&I+{n#WnsQx7--7q9K_MM#
zMT*qx(8Wc+<9DfL;{jfe!Vqz?f4@1W5^@U3$Jw)Q0Qkm(+Fkt@7}n)ZZ10GD8R&0z
z9OJ^C(JoCklZ*fy49|nh1UzS#{Z+SxV`)Fbg#^hadzb2BWGynGK+>(=7{}SiM%opl
zdusz$G6wQCgAz6z3vniIzugp<N-urqy*?!AxpqPy!78sCG_tssP~e7Vqz~7HaM3oH
z#$%`kFN4425^~enERN0}CT!{p`z|{zhEJ~vKD{r9k1FW7sLL9N&yrQVH+t?pziVQ`
z%HI?$Sfs0+JKNI5pPNReOWiSi(coQC3?Kt_+Jb$MaX3DR4(vQ9Q5p~G5cgb5LUhk1
zRAqr%@(WB<uBueJbbB{&=e9r=?`0YDo(jX+^53j1iTk0jtK$3hD%uuGZx-5K?}_t@
z3Qr5oU#y9Xp17!*UagCO%B+ddxaUD#nU_6sD`|y%ezo&vZ+mxt0TPGSMW9k3H)P-l
ze57U}yVDQE=g$YCrM^|Pk@xlavwM|AVHb3vEq=CD(bQ%U99C%t;^G2YkYAbub8%4%
z&yN+YJuZW1D277~PZfbVkDafHeu$0at-$xi@PgVks6DS}@JZ>&hZt~7k9@cwa<Up?
z7n<$Vp%;o}Fnr-$a=Rl2#}VoL*f?c4mm4OEKM)OtZ3-;_^0b^RA<SKaE>(nC?|Hz^
zq28{{ZLTJJ8pg02VVyLY5Jj_#$t*lKmmL`!+s9*Tsf77T<OowFbhZ3Z#13xrKJ|0o
zyDCiPr%*VL+tAzS8c`fJD1EN(fFn%cARI!yegv8#2`04TW$+uu;ew)0xGsZq=?2y)
zwN|wY2_k*DFxz9wxm}(O)4qWg8-a2-Tt!^tF(xxkLN}eD1Et*tWWG;$b+2Qlqs#}_
z7+{A$oE!Ks91Nl?`=ba%Dm~uiU`*hz6@+W$-hHfkuZBEruIdmKA1*{!s!&Q=eA|$^
zdcAzH{Xv)%r5BYqx1AU>r3B^aP?dkx3NF)*OQ1GMqJpCkcs@w#W|UK<j3Uf&f;p~?
z918+f&c$^=J!e@xVnbz|Ns~!(BA3Weyx9Kn{Y$aC{p#)3i>lGXTuf;+PK>jj+a&K&
z$QvY(f*!-88Y!75{*_F!L*lqL4iXzbB%{I3#oR$zHjUh*L6MpA@IVc~s)_Df*knwS
zStsmh;pDDu$c9akuEN2LcBW!-*Ywp4lUB<RL>d{?Iy`-_qrnZJW5uKLV6%HuJ*DM6
zU1u|xA6524P+JE0qk*^$3K9QkZW$XIRj%olW~gqi+p#PQQL_pa2g_E}keSM=jv-mN
zm|@p-HcUFOU}?4bn2BFBdPez0s#-p%<_B-lr2<KKxe52;lAprjRR$tsU2ua1xm367
zed+|1K#m}vNrx;xO8Y}6c!ECObgO>m_3^y=TsKBV#Z>dn8BOwq;#9OWUo6&1CBf>a
zt-qZLE!T18#*0%FJ%BfW8G547>D91Y^DVM)dE~Pad&Hnfr8=SKm9+9#wX7^3{y#E;
zP|ao1Wd=rlZb;yjkLrz$u%`UtV$&MghR`j*3l?<sQf=UhNxhS6DkN`A%H1^SZ;6Br
zB$ie!6AY$7`X&9<RLR7TSL*SWPF}*pNu_msb=gw)=$m6EGb+!$7RQe*<43cK@{??}
zb8Lz=N|xeMx62yS$>2Jb5jk_XRc-%xy9^_NH?cL^(q5y~R-v&w;#YJhJBxDQ??yxP
z5uiqC%pc}nt<r}h^0Wi{>`wp}RK`4wO1$bdmPIVKvRbH2bCY-mCuSZ1yY_N-aRGOI
zU)9H*4&@6>-D*^*P`@JKr_ri(&55Hv^|PV0>QZZ)+h@Z`t3I_Nvb24z*5d>!Z@-!B
zb@g%A@4E3)Q)qc`8;w>AjRphUcpWTuZSazJRkVdpS(}Z<{W{XFwBvH}<nnOLe!>e&
z!n~zxNJRBnSTed~Yc3&k;xv2OD2|1)lj-X}jg#Fw6UA>9yu50-?3Oy&$QlhwT5UE!
zPf4o9(3AH><lFOR#={cy3wL07b>YmwvTQxxljv-5ym1%h;O!IOmoh8Bm4m;UWw(fb
zHD4*XDwVQDczj_-Se(!E+Yi?Y+E1A~(XZ^$E~heTY^0E)IS{=HBZaZb<{3*W3=BOT
z^t85U(7aVQBg28~vVg7N_-UX0^0tg5B(?qK16e5RJ1x<pP?%tRG0EbljN%^5LUr)e
zWbVj(FI=g3XTD^%IW?~DpdiB=Lbn3Zee|k=^GXkfNpQ|jUH|JP&x^+u=f(J;y42mx
z941TXdkvtM$Mk^1BXlIGKtlo9tK`r^$<pcO$BpMT(*m3Dv-GvR8h5weyxiuj!lg&#
z)gno(iFL7onO(&b@w7rfT{?w5sbvC8k6Y0Kb>XSkS*y0eUaos8t&8<4FGQwHtTatJ
zA&qXGMjkjfMOCPN38%cl!4(y(z<cBQP{kP=&Bx=)<S=zOR9VQaa-IRgYZ`P{V?k8(
z1*T{s$KV#AH<nJ<EVy2~<`k-IR4+Y@<iZE_R%eqWn-7lhpuQ`7I+N^#FUespbMXTa
z@FI@JL(aZI>n{rlx}O>jPR_z~2z#s3DNwv0kK<XXnyKjP5Vn>&<yi)Or8~JexR$6R
zCp1t_Ph}P;UMXVCwR`Rg_xbcwm;#*45%ja!B3VivnE5_C4Iqmk>4gyCX#+rRp@N;d
zV*c#!?!2y%<@T%%V5;VX;U%<dj*+JdD51VemFNCSEEKC%x*GT^1+|rOlKW~`yC_g~
zf4$0XE4u9TYWgg%SqH7dVV)K?uH8b=)$Tw`HqjLu*Q_5@t{cSnOD-FZigM-ay;BAL
zrN7E%0pOcZ*Dz1P0_)$?r{d`owY)vu6i+t_Ldfu`D_%IW-vc+g;dt$VgzoTicitZq
zU*z!GK(eUM)D0kQsq(Chv<Wkj>(Xtf%B2}QUSwg`UBdgk!+dcz`>gJ%dh4k+o=rU-
zjao$rZ2nthtFZlAq!Ah0L(n8CE$Lt|PgB@~EvOhrD%85fO8x>h`*S#@=hP=Wt<c)!
zwS(w1=PN6Cdyzk7zrH?oe~YuLK^Ic9DV=amnMQ&qaB-ozSdYss;bAeqN@3Fkk8TkU
zo({5+FOLzazdB&n3<ILrkr6o6>+NuF4F?xSoh57o7B1`D>iAX(w$i)Th$9NKw9{+G
z+Lbsii5taJLEMu5@6iCmA|Hn{ih9(?Rc59yPBmf&J}FZ?QMbu72RpA>t<0L)x^<nZ
z?PY5>I!dD~!w5pOt(zZ-ji+mX&)^tV8${g=i%RY0F&ze{!&{1os!O_&9Pvz`+x)E^
z<x~uODU^!gPD3#aXQAE8V4P%;-L(BE6;r@~sVpwv!6IuBTLw{50kZI+MLQYG(jiej
zDe>~VY&#xWwPSy-!aEEQv>0OWB3Q*Ut1+2g#uszhjwoe-?jYATASvj-<sh+7AV-V1
z1(3x4&g<>B@AsDmjr6D601VW^x4XIVMBZG~(3sa0ZCg|%TJPWd`0DNRU$$R34dac@
zI26xc?QFl<7qV2#k61hbJudd~QGSck0XxiU-~ycF9SjxmWTLN};=N5nXD@*Y6$?8Q
zn#JCy7ct#v&_Ey5L*2$om2h8bS|q2Z==?)*!dl&yl>}=PPe84`cnE;7B8Ne8RA-?|
zUW>s(_~O=RKB0gR;rQC@BZJkJ=bE`3d&6QlVc9NUA%vgfDM5<as=}0li>X5rPtx;~
z0vIPE=sm_1bpP0ScewLr|M1C=o-%8_$D3BEVAEHu7py;Cf3mi@Zk1i@`N}@+_14xN
z_quDFPd3&cKi+uKePUMHT=!M#nniYAzdn4u^Tvx(q1@I7Pq~ls5Ic>gu+ocju@)St
zntS`Zhg~n0g<4O7r*^%-3w)v8=Ela_hE>rd70!?oL-9FrbRIh3pPx>#2>m`WgkFkX
zGo$#3&%?q=Jc~a^9W2(Fh8K955GJQl8ng(C<aUC+w6UBGhXu%q>l_7hKILefsD_YX
z8K;o8GG|ek!locY2cA=%>JYb;npcgs1|VlZL7S!Frzp*$l7%S0#|H2K6)!yuRXm9;
zR_$Qjvix3r+?QcF)KLL{V6Fq4hmDJOxV(X1P63oVBw;x$5xJ0+$Tg6BCnqJnk_<XI
zC}XfiYY{syT4~MU%tL@zNv!~{miXqoAum|MfGk=}#DS`-xSJ+{E%IvTz(tf*P6EUa
zV_PmXDQhRoR|cqIfU9r*>+9#=>_fYtPBshs<LD9XogU3$N<PAk_amI&o!;tfFuqnF
zuoLWVZm#3+;PFP+{EeTr;PK=C3f6-jOpC|8H7M8Xc6%HDCAv3+W94U#rWPUoYu=wv
zX7h@2HShmLKV)b+1W^Kux)jp05Cr&Tiyd+4N%9Hz$U_i^xfrMSozw8VBNu{B26DV5
z)}=W_iG1nq-}3Sn?gf$wGFa<c=Q0d&Hcrk8uEXZ(6bMHQLNSZjrdn|k&N#C$v<mYr
z5e|()YsLGN*7<bd?H#d4-T?Zhp5cOxs#r8pi;$-(=P%I?SFkyngDzHdv35g(6c5qy
zGY+RyJe;#j6^ePC%oG7CU9@s)rLg)^<cb~G$rTr!$9{iy7Y%5~Th2wqSI*-X??Vg?
zSB-E&X90FryEH@CD7xIc@}opm!*f*?eGVQhTAw3A9a3x_v`il1?V2*@w_>HkwBR7>
zt7L0BMxSl7sd6NFEIvw=tL-{jl#O@;mkd9Isza|)TC^|@JKk1+)=RDkX?FPCr4KU4
z?>?^oz3QsMbvU1C(Tw}?(_{u*his~Ov;Z}YGEjGk;;TaWhkq*dKU^=v)6U>1P3F^V
zX+5x7|Jz*KeB5>PzhLum@2mdzB|hc)9}j*j*W`Hb|Ka8C+xPFp^WE*O{q1Lb7>5U4
z6kTABDHAYX0dWkQc!$v}@&xUDvHc1J4R>NZ{;>7pg?=vXt20Qmgb6@i^z?%JY`ezl
z`Wjbw0AcNt)ptyT@P6;_RR6wZ0&&O?&SwdT#&{rP<C-ogJ~N$E;`J|k`%vX|16te+
z_~;n39N=e3dcuG&0(CvOx-|vj+h1$|;oS>v;|xvwX*8Rs6Ol~D7nJ8jrQ5WDarq_`
zLB-p?k)!yIFnW|1AI&~dLpS@ytEoXtwEFPVXoQY5k{K0O&KfPry)8`VgcqvA43mxI
zULBy@m}>qVH3%zs{9&afxn~V9+P^NuM{9XaO+5IgqB#bMo1aE$ClE~fy_^`WA95^Q
z>yo(C+T}+TCXu^FS5waQoUiJI68KLIGSIASl+mz^$0<a*;~0&77id*9D4F4v)#S_)
zA$P>q5HGNfU~Ep&KB&r8jQc>WRlFU_%`3OQiy(3H8j5*FS6js}9&zeGO<Iz5H!?=O
z+Z?03j&HCI@E-0Z5b4U;D-kZ_H_?Q@p1*znW*>d-3P^MvFNI#SCVS1AEFu=zSRn&e
z(V^!f0x_?}w(qvzyx4j35;xwcGU0w*3JX+^X-?0gQ%g7@w(2FKtePl@#*TPk`Pdc)
zxGkHZQC-imG4?H8wNqIy-J#Ha7l6$9MM2m8-QJ7P{cLQkR~E(<=46x_<8LecWjEkG
zHEkn`?<STpSOh%}RGZpazI@dfvtXjZl}V2DY`^Xx8zgHw-n}YNX{DkLmH}!(mh*!^
zn!?VDSKF48F8KoWx{K2ZTM|#@XL+g_M~I7c9b9{)u8r;&!|~?EKRO?bVUhe4X{T`*
z|4$)mz@$!s0u-H3VLuQJzpRMVCR_Avk#eCR|GEe6Dupj9Dy$VNoHxQ_rLBNjX>%Xd
zSm|b62J?yjUajc&;gmxT%Ygs-5n4#O_9PMt1HbGw3lf6WB6sWgFZPm39?&FZr3>tF
zE`1*{4c~3Qx@if_-hF|GGu&~G(aF*+<+)i$&QgS4aVG>l(V7%2F@Kj9PEKbAC-{-g
z2Xsj5Cm?ROa5PT(;rMVGjjua(^OgwGwK7J5b@}eh^!BI7GqlK43ZLniQ|(y`bo1fx
z#X@!&6r*oXXL)xzk(Iqec?;|>cQQLKGTQ%zW8CXpNbrXbMV0{QYU3FWPK@fm&!O*~
z7roWRu%JOQIje|@?2b~Cf|hrLZiE=?KSYO)Nu(VYcV74+f*1Du=Td3sthJdqa<}=i
zSO`0|46QnW_!L-NG!TVt4B&W<wBokqPoWGI88r060dI1O%sTL}x-qY`s6$ZIR9aLF
zSeJiV_je@8<bdqF5E(3V@hFalnAHujADl34ux&}<jwu<9(X|SfjwOgd@dn2ey3Dfp
zXhLQOR=T7eW^a2RK#4xVi{eny<IEi)ep(o&TYYOWkSul-7}mV%78YTlKnw!SM6$i+
zoTOoeF5{sAYG+wsdJ6)x;hWTs(F`q7u(ij;u;_802YZqBl~wWM{7Br{*m(SSVXm-E
zYxX<Su;#wAjW6C2S5mBN`ei+*J6s^0l0i7eRX-0;#z;A4m&}^sPRsSH5Hz5)Y6FP9
z#A_x*6Olt&)N#+E@z@KMJN^o+(+j<|<eNQfE>l#&Y*=%$-0Wi`@N1-neuRc)b$d|T
zw%8V_#8;S|s05-v+%P6TER4yTg~^-b%rX_ivOG<u^D*U!mQEFE6tQnSIk`i(X>9lu
z{!t_1)o60AQV8+Hr5jQsnSEO0kWbuhqm_9vYrL#u*+l~}!hjWl*fNWh+3gIn70h)%
zl=ks@>jS0$!P{H1vmdYDnZq(?z%d~zjAw~f1td`)isR%g!V@smeRAm{X>T-yR(`uo
zaw1mF^aHZPpz*%-W6L$!XO#xeDqOmL_1<PN+`R&iT?U;lW|OS6`ErGTEA+5}BKwuk
z>iMI(msYaO0M0b;?2sm3h(9+sH^oSNT8P+N<9HAWy1C;uEVq7WH77U#Kok_8OsW^b
zd@M#i@yT2tKbS{oSi(l4;U%@}U|DXc(^%`<E`;pW6<&;x8R__@_4z|}K?k<^xHCif
z$QO(rivD~?+a5Y$rgU<H<20Eh^Gq?#rH1FyYjJ0sUTg#SZ~w05nYwpmF(fqBdGnUO
z-4gHJ!m!kgi-uAWzy-5xJ0b~DOek%~b=-cl^?I8u-DM<2{qbLgoK1=8z}Q<r-t=h9
z-2IEBquHQCANzK-!St8V9?1`E5+uk~%eY~NlPz!bI2>w7<rL(Omm1iAwYgG1xHmaY
z71PKb6e;vbw`e#xAD+M3+IdZbGZ=^QDQ#*DV`n(w``}6=C?0#S$>Q-u1z#p;9+HA0
z_f%niTxCm&l0nv153e_c$NcH_t8mM$`O3jo@Sr(!*}Fl7Q$T}}vE47ot;Djj^0<K=
zz$7^vN5doD=dAkL>S0Ye7@2jFYqpG|1RA-fs%?H)^1MHg+Y66tMy@X}bm+hI!9O37
z8}zYnM4__GyDd<F=w>ji@`?0eKT6X1l-UozvYWcXu>$%A7Gu|Jy-XuHxo@_)UU93f
zG^uVA?qESs=tVb=eW3+#IZjxB3;yFcpm4YJdK?g3RSGF3(R-$tFD|l8g@wmQ=m!r2
z8W6pptt^YQo+~U@X@i{0HCW6tl6DlC1)k3^NS4tWZF8xuwN<eXJOQiFJTv?wdiaFb
zHta?jF}Qo9p>o;!kgxvR4tbM!Y?8~`KH;Iq4NkdUlPSmZ$IqTdZck^n9h42s+F}C(
z<e}}hxuh*R7;DxLm_xkKU=)R(XL#0baCp{kb9k_nPhnF!#sByH9v-UT8M`!|0!`yj
z5zwCI=U06#$NsCncFX#juJP}qcT@mgvn($I?}6(pR0{2y!pp~#YfJHDPx=(INV%24
zTvLPTcCw`8EE48GdWHo5N@Iwnd_ta_Nxts9T}f_?=QX9|pF=p_0c<*~6xk_L_0W-y
zrQCH;@rvCbAkLPdW*!D=9{P3+B^xb{awU&uO$E&!j%zqwEi}=!cf3N$Yq8&YzyJ2D
zh3nr|W4ht#uS3|>$$(y2MZXZ>D@Wx5z{V)&*=nVzqpqXWp`j*LL#Pi#tJ~?8WN|2?
z4N@gounMh}r9hQdT3`e$`v1{J5u^W~k`!Y$bmHMS>Y#t<SBr_?VzR_^FofbA60rzK
zG#>E^3wU5kPC5)mmjRTmD|czs?#k2Q8KU32chi%~vJ^C)Q;ScJFFL21RlwK{t*@4*
zCE1#{N(*x}DkrEBXzq?P9S}I^cJG<vafY!LvxK!KB#SgFohC!{8cwP8Rctz<QFw?6
znJ3nM@uAV2<0!_F>xh1oI7?Dt1@Vlt8Cvg2?`5s^-s(4hlJ%@~x)!FKZJ?-~43@O3
zF5NQ(N119HQU)jB>@=Ju9{qLW-$;Mua_hcwLo<IHm)r1_i_GjZi|NC==w-VhPNOUf
zk0MD?z4$MqDLnPK5?n`Bcuo?pSK?=S18Zv2DM_B^^E3nS{Z{QlV{KXdOD&W)p+`z;
z^QHeAA-ST$A4B+!KPlk{j^i~GevEg7$Ut$UL|<Y<wLH-;VQnhaqi%AqwFK28{{@en
zs!Xp_yc^b!#1F!B1h>7HFjRb@G~Goqn!_AP_UPbxDeHOf!tK2I>8<$b{i|0PY<@cT
z+$%aazSBx@PTp9ape*<zfK|!+q6f>6_r)5lC*Bw9Vr0Lt)|qp>Z_}-M-Lqf23kp<c
zk2J}%dKo#lo!dS2eoXpH)_U_6Z+I<Qw<n$-hv_(0u&$TYMBSNaT4w8|;pWOv5XZgg
zR1F$({sBPu-#YjWH`1u)Q&2ON|0EfF1$-k1_`do^-t7bRZJj-}1N5?l9^KWW5=uEi
zTSo!a<rGtSpsVJMJf?euqD6okZAq)|gd4q^S^K2gR-a1nh(V23OI&bjTB?Q7ZhSFd
zd2@Qyqjs|h8W}D@$UvhkIsF<)2VVkd?jn#~1hNZ>e{~;?r{<!o=>k)9xf$8=EFh-T
zeg5{%-uu_vyU*07D37r+62m0o948bp>kC~dxlh+g{1iWrC!>UUHPbch4G_INq;ln2
z2_*+SRH$ZoNu%~!nG$1Gq|_Vv*U9{}kEEN3!I7!DxwK^?LcVG=*+uzRKHmoF&rPzR
z3CTPt<W<V!=a5P&%he&|pGJ0VTcF#)#)`ws<0Qw{H_6z7!~>~LHfd_v8z^p$k^uRe
zDNHMBvQ+7o&2^Ut8TBAr7+e!zXs{04;9rHId;ca3-MG*4)vdHo81IrEn=DQ8iY9KN
z7FdZqtBMPD@s>$r4%SEKCKh%$S0|FI8ONW)In$}s1saQ!QD>e-opjjmOtCb^IhiCf
z>hlP%?Sa5J3oo)O6L(MW0njaY!@|=j^B(b6&`r{A;Z?kZ=GOfmS*Ch{W9Tcd8tM7e
z;Cd5&Dz7-9Xj2!Q8usnM)4Exz;5$mEJbg-qR$)XiS0(1)0fw;NnW0I%O`!)#TXuL=
zq}1Y)M^$YqeR3$TFM%5MU6s*&DM^GMH)ZOjJ~dbF9^^@5UBTFT`;)Xw!(Y3<{xK8H
z5N@)>zr!?ZCW__$vwZ#;5n%k2r(2kc{i8HGOXFGO&P2>)_*0VpXuKC`<vcF3^*l`v
z7Xr>~A&*95Hd8tMOVpgH(s8T`cWA8g2n$Ldqs5A}!5N*qQUroN2WO@rHyEsh^F_M5
z{~T<u{`9XQuD*zLQl=C`An{L+df`UjI}I}wLLamA6DHC2<tFALhsOyfoRH=4i?<Yo
zFH)uOi(M)k<CR-_-xY=Y#wwH0B*92pmt7I~GXrV)%2Sz6H+Eitcul6^5l2FwC9<y-
z5***Rsm*)7yg_X)NIzj-woQE723m!RIzK5IgJSA-qf16}e|nLRxb>F}!f2ix!qCj-
z8M|lBr&onarNMZKSQrPcwHtBxe(W6gSv1<waJ883!;?x!Vn=I@XQeTVa2Pn_<hpUm
zVydOGl56E9?O1iC2hZxG9oJ;I3$)H*3>iM&PuMk=+b+~yEIOz9P}pVSvAX0k9L8B=
zmX^da`mMB){A0wQQ6?UHnJoHmnx9Jc`ZC})1l0S~4TVXNvMXuV-%dVAe4Dfa^*oe{
zW>yUD=V)5-kS1>{X!$|(Oz9%CYB7?GvP0UnsXkdU`Ph4(0$h{aBG-x%UUozqYz~u&
zr#)kwxk8f&TU8@oKD<6$@-VSvQok_t2$@bg9eQCty<iKxj|GAv3uq-s)#Ez{YghI#
z<=<{|o9@|@Z&Ms5!&4jw3>P=dz|EO_rT)l+j(dnflBUsMHohqCAWF6gG>{!i^HQ=?
z(7Zp42Qy0Hr?o0Q0hFG}M-%StY&Agjn^_y=8&sfg9-$?-(~601E^$_6{-@7C_iJbW
ztjYh>>uv@cPX5o}@#F5=*Zfak;^UP>IPNViR6rFTNOkED--t_e87X8yVAZb;?+QBj
zWj0X0S|D56tU0+N<}+$=SRGaxD&Dr8j4T04F!jSM9za7X8>YJ-Nz(Wzo`mDW)A0OI
zxy2gW-2vyJ#yO05S;<Ug@dMYb(rS}ab~bELW-T?^BNalY@`MTBl4T1?Os$;RWw45%
z_hf-u4E$z(tjj7~5vc6sT2OTthN<g-<a9foV-lwK6TI~Vic5lf6dA0ap|<xc(YbMN
z&o!^Xem4SLOyk=T8h3Yl$Nc?yb~^PjE<Q)6wsVh|Kh(|Vgtgi!K=qHk?R{o%@eee#
zq0cZ+iurVi+m;)K(|p<Mii^^hYhCfV+^%qWE-u99E1U_RIsXGyax$$KpmF-Mo4gR`
zrA=1TPi5iaaPgq<$Xh0F!Z)lD5os$Z=^WC)miYb%RDu~F(+~ou7bFoUpizbW!PT`P
z+IjPQ_s73~F`$qD)NwM!U4Mr08E4_S;MVC4Y*mxfDcu~IhH<(C=jlXt`H-KV6AuEf
z*~#nhLo?ZUW+$<8fdBA8g09WuxPUAUqoI!#psdl~C{s0-XWPpJc12fpGzYMC4!Gq2
zZXkAw*x=Nz!RGTIOotL3`%Z8vCVa^x<3xFU_6!=ejw>AwW-yUq0|StNpuS;L*;+gM
z6jJsHyCC69BCEuJEi2lW%S-WO(VOKXr%`0le0|JvfJ=+PC~i<v%pkz>AUnl6ln=|<
z*&fif@{wmOxECJ$piyCFsa`FsyxgxKA=&lOl1~lu?WH5qIhPSR4GHU=Cr2Qkj|)WZ
zJq0eRA)rm^^)Er`ioz1yZr!lFT69>($=MellyUW-^loKPDx_p_P?{B%;680IS1Kh=
z)pQ|c5p?#<PFwoLXAy|18yT}NBC=}7tkFbTc+7Y%{V7IlTsvYF<hsU){eiO#h6_pm
z<^zod9(kdz8_r@htKO8NJ7F#Inu;#KD6P1Yn^YYq=S}&fbc9RcC95^|WHGhU(`lYi
zjtfeg5PfNON6a;g^W~%-{Os4srZ2+4p=`NXX$f<;Rzkt5a?AV<V*h6N{nf35I=*30
zk+`=9>e1{bKt=Nc!21YbMK2LF&#_dYC{rW3kwFxA8N2Rwt@otK&U8GZP?{pZ8HIc3
zs|BWC?@4)KlP#%-&b7O!rK>cWjIK$!2iU~9=-{u5Z*G}}(8;Y6u~{GEFVM%)wMn(e
za9k|X2QLzxg~#LeIvIb7PL6JlS{3t?GZ2sClc<TE_2x`A)OoN`Aqk5TXJY}3IQ5cB
zQBG}jSlz;;m&@5~8=~o1t2DM)@8X*4)$^Z~d3SJ(#{W!31mc4tOvDNc7rz_+Q5&aR
zjU-cJjeS*D1HuJ8tl2YbRvIED*A4*b43o9eNs>H2fF0$WCaW~wSJL1!PPhJrIw_#V
zChQM9K<8If!Z-4W!LHkpb<5$tl;<pe3)2`t9*9p-n&FuCLyR4TKMY{Yyw|Za>jfSd
zYMZYFCSWyQ^pT*01LM?47Qk~OnlQWvKQP&Fjc%-BWoTi58~!p(c1<RXUCXy)@aEI*
z3JiUSY%mKhg-3wra2ui_E`?Fi*X(HPmduW6lQvQEWg4b*Sr7PPsbRB4hG*PX`{9rU
z;sB(Fk0npJiTePAKzqL^H}dnZD*(m;fv+~YPyndi#?&Au^E8ZsNqHu~v(q>u5`^i|
z?T`RQY`xn6c|NVPF)v~!rG_3?Ts44qC8Ct94ORc+5RFnqhZqn1P?WMS@bz%C#f6P#
z102uNWO8($XV-n8cr~`Ie>~sXeW5%<uDuQzpn7E^9Z^&KEW<uhUb1VH#Nn9Ch(oIm
zvUj&%%T(bRnS1!2569q<r^#`ql8N8CTR=H#6qHQPw?<R|kd?8nrq#UYMf0NPbpUu_
z_0#{8D-^yAU-cY}Kurjt(n)jDq8+y%rp>7~IB=jgs8lIG%LvtxtZ5tv69XeFQ^3Mo
zC8voRl5QYCNfaY-WG(w1T(;i4+`b_pBEs@1CHkfB){3a;ck5zUF%vH(rZqk@CG~u@
zdR4XjeFZgr`FaX!dh+$t>D6>p>;|j!3Rlk1B#nN+RF0e?1$p%?Os~#{sKf$l`RY_6
zQK+y{gSD?h4bBlpE^UIbm$NpOVUfy8K1N)uLO>N9oO7MI5>E_ChSA5?Fu<jECi%5*
zk68TMzqT|P0u}lqlr)GwEg(>+YDvYKnO@RkomeU9uTHX*^j0feyq(>cd?_VgoroD~
zvE){3A~dWz4F!!`=LTd=CEryFf(q_wB0yYDUAWHjatCA$$sCkD7(A<F&NUT1TW@}O
zBn8kf&E*etc2XvT<h$~nf+|qzM63!_I}&%5#68JtRB7~qr+n3Bq30=IwGY88afJ$?
zUDtO(gSQwKZj~xTy8bFnaB=Hc==iw_xQEsEW~w_Y-x`hE9q!Lnz-x0qC8SZox5*bL
zzdleuHC!V{Zrxzp2GX!%dc#{wl~9JfT1@5n0G6*AC5@=gO-N_c!$^H=WEQ5LdIf9>
z=)&HzYIO`#QI2wD%iTiLPKnM&9duBl8a%l<ZUUZFvD2#@lR|m1>6W*)<fUV1opda&
zHad>ciZmp>SG)e{Ww}H{DX&f6ybdN)8^~*6u5r-3GsY$Ou)x-?F*H2v$>|K@sOt2C
z^ynY|zW4m??)D?CSnCITPq==W^MLLy)<CTBJc~a?tgkGv2kc)M<4o8tw0X9wcg^T;
z#kyq5D66|BHmmBA5u~i{I*rAG8kW^Uk5FH5Yv90N6)NR&1h@|?s&7`4?g-G2DykDN
zu2-}mO}>;&ARjA-i=y+UTm+O5C4;d-OtezRMP*~T(iJO}q^RJbl{K+a$wi|Iu-C;(
z9T(+T`^I3U$G9)F-7COf$3<1uH)}{Ys)nDKXr+padM+2q(Q^2R#2=;KVMfXv@y}`&
z)-M<b^qZqn5!cM3;s}UJb}Xy5Su0m61!<>}7wcy8vXwiVQkIoX?j_K{$*~j#drQ`X
zxwKrp&H7nfT9*aa(xWEl&(hUl;8y%2M>8p&Okf{VCzwkIVio4VY7^KzW3hZ)th#cY
ze(lQDDi-?{{kpUNGkx7#RHrHju@4I10GN3w)+%%#ua%?N7-kB^#`><k#MLL7TTL7i
zyxMuavwxG=56ag~4EZHH?A96iDwb}encg+DNUNEkaxJ~$hxP4rYZ{_Oxnf;~mKsy2
zT0byaswL6_Ej6c8T~juxnzJhI_-|w0Mgr5TY?QA~8#y@*02<8R3fgW!Ym2s84`Be~
z<ZrDBnJ39ahN?J?CjxVYh3D6}vu^=9N|MhQNyvZOYJoNaY~|W*yb0elwgQZ!^Tw8d
zt_a7|<4};L2je#;3EBaN$=SrJS^RX-mjJ3xP_Cd6r^`1V;rDSo9@o}RPNSo+ft}&i
z_6O6-Kwsg<l4b@)n`@XFh+ar7q?N_u(74oA#cv<+ZRNI0wm`J@H}l&^EcDw)EK#|S
zCb}clB~?pWI}#5nw{Zv!_DCqYvcPDE3U(^x35JAG?Nziy<p|BH)(9!ak5NT-)7)p!
zuh_){?4;I$0L6{%-)|qGZTNY74O4>Vk}?KaspF4w?pnbyTB&1-I(ArLQdV+AJu|G-
z^MZkhr#^AON@E777-&YQcAsyL^$HHPs#z)%a3x=Or<vmzeg+I1FO+$`&()(-E_*`w
zEV5xUW+c$#GykeO`6+K<h4^lTM$BBz)nBfZ*P=WeehMdpYUjx^VQw{C0QRY8+&h(|
z?RsiFsN`~g4G@(J)`1$8{XFs3!FgJR&qisj-#%8Knyi=BTv@#0N|PRa5_zRThdvxT
zb(I2NXP`xb%7&ih4@?d&(?@}Wm)oFP?CS-uei@OAaifh`Go3|g<_nmryb6nksb(M6
zu$^9YJEbJ@f>iCiR7xUGTS0YO3o3azfZa-LD;1(@T}XFP=}+V9pkce~4d#rVGVuiV
zZ}CuIThb?M8VxAzdZkwH*+KD?wYN~%EN!6FA@j8wA<1?9X0Q<&^y@YA;QS_9=@eS=
zx|Cac@A^#_?Ml<=)Y{2j;wBwrt1m=%abp^wH#s_!<0Tw{iN~X>LbakSSB~<~#zCPt
zpTrdH5p9I54WL;yu8R6#16wsNUrryr$}`N%P#=F)IzQZz?uzrtFiJ<`<g9vCb71HM
zHBwJ{<u`)_9S1Qw_QGIn)R^Ubp3UX-01+}cCfg4x=<fIxbS(##n&UHlQK1<ybj*TL
z+vDLv%t7_)OvBAUfUXe&Jg`{^gtgiOLDyNnmI~D{Y?P2;fitcu=G2>X;EZYo)d6Cq
z#xpf60bmhguk>pAXi91W%__$Cpc#mjN)XD}Z4oqs>Ld5&Ol^&3{XF+kybj;S0(c1P
zVVcO~M|6I<5RX@LSGRQes$Y?B#TxEFzpO#r*US<&aep&qX7K`@8v0&4iVL~6{>k(f
zcDKD%wS~F}s#m33)>;SzR9dQceT%Hn3`o7&(k+sr(UrZ$)TagnDFTA6HPN4LR*&28
zz)^R)daL48!ceuqEFw+czu9^FW^W$_X?PUI6L^TS)C%uM*TnD6$ekDAjwgjX`Q^^)
zVGW$0=M#+jJww4Z%w~t!VZb#Tq9|+CV)^JFJ8$;4cOU)Z#m-MZm1BEdtRw>vS`9Ff
z#p4OyX=q%07>`E9(v`zY>m)lKvB|3mn)K6ur;lEjT?V9=p4))NU}G6{nyKg~pF{)q
z(ov4HzAD*h*#CGcxI&9zH+aS(Nkb1LlZlq8Z-GI~Ro_Y_w>7@%WpqLVeRI5)zbw0Y
zO1%c<HR*;x`OCG+TdV7?bn`HL{gB}G1XQOs+-0ROBNmi@(gZn+j(}xOBMfcQaJU%#
zQ5ju^XcsPj*>e&oS})g}oQcNEQB|{}>YD3fz3O^#fIy+83jSLYo5i`P+G#eI0`d~t
zEKbSAn(29_V^s_F!v8FakB+NDlP%1_y3rc<HQpFJ25x=|+#K|-&(6!?R04=s^5&Q|
z95QS-Z__J{Yuc<I#1OV<NAq!*()xuqfd(XyDN$X$1=^sLr3hd78&^E$ZwAYVzh!x6
z14#P>hwb{TV~}&}<;&gemzYrS_0F4{of+ZL5eyYx^Mt)>y`=Z~BVSL_Uk5`!P`+tm
zq1kw%1i8zlZ=TdQy3o*WeYmxu4J%zm?0bf{IJ663=m)B1Xv6cyLrV=e8rqUZeb-R|
z=cbCK$M1>YSV{})-+=bTBeo#mcF#>U`?Ah=xA)$yRj&}o(RiFVT9geDg0zZRh5;=2
zy(naESG}rXUTSe~GT2QQ9eXXm*2piXsN9A!;S%`IrA#b7uFDK7=@Hi-)obezjhMBu
z4q>gRH;>l>%gds8RWG2{a<V91D);N)bSN%O{lGxgJ=tJdw6O{i0ncS0(Fv_gnNvXr
zW@)ughB|@zqxX%cpx&WUNxExjX0G)Y>{S&cuw}tDNpc$uw~j?^Y#8aByN6IaWL&L<
zzw^h#-(4R1#?-Gs^N)kRG3{>;`c4(|n6;cUI(NQN9@6?nh+$rGs$uYvCe$h`=bYCv
zxc0Gap-w|0Yuqt&D*P+7bM=k?TTz^&nQtkbInZXOWeu0tT879xxu~|RJ6+m%os-L>
z8vUu%p|bJ$g2R)|`?EA0(4iU9XOt$VBA#W@xH9RCN8VMjS(AGl*FYj1A0;UiKgDo)
z|LzABrG)%5%=UaFdP|IiVH$U%@89;Qgy`e4)Q}BOVJ~}$XDAgz*7FP*`gE31rp`bW
z73~|*!b3QkfBsyPy&lwYaf#C6cY#)f_V405$}cA_Df7<nJ}0C3gv9S8p$y<*JP}!;
zOqix2ALnKu77DLvYnvXGzMITX58-zvK1S!$6f>m2MmRa$ncz+Mg9pJ?(J4t|5;G<-
zVA59YD12fcK4zyn9=X+Hx7Zzia^62|$KDd-a5_b&7Q(fv;Ms9JjsR*ChB8<cym(bm
zg84V}v-1PVfNC}d09@RFJH}CI-FQUAr0g{n04bod6>ROE69?4%Tmj%&RMV7)$GGA0
zX3H_ak+%l76L<?3oA7g|%&GHnj8P(U4d>%{98HcuPif<DABfBQSNvCTV5|w>cG}~)
zGYL;&XX{q3P%eK&^-TQZ-P?Cg>ZisYG_@=HG?}99AIsWcc|!UH#ejZ(4@)KVIzde*
z1?$Q}<s%ia8_S31wdJ)HzF~Q7>1hT}xkDI_32AVAy~o>#+~@qd`}WPt{lCB4mVT+S
zbG#l^u{vlT;cJHV%mJGr&_32Y!8PmP^s!IrUA|hR+zhN1-vtyt!eqK?hU<y~57pc<
zw8D}ozOd>PXQgLCYTveIQD#Zx4AJ3m7-x7}6X*oR4hQ2Hq*>iWG)UrX^V`s9-(**@
zQGq)Z2yqekh!vq9M~PXYIi`PIb8_<4H^)QcZ*Ey{Ok?~`K}g3_|M*pIi<ch2z!|>M
zf;~)Arh}$djx$Z=N>T<5hnbnbzO}}~!rLCsgH(6FLzQzw%G==e5W-6EdNOoT6P|9;
z8ZR3+h-_dZtICuxY8DL=%o?8ymg6vM;!Cy&kE%tXIX{+<P(1_vVI$PN=@H5mG-Dw6
z9JtxpZ$04`UIX#)*jfQ=)<3g6ji1XJ>L9t43>DhPA4v;E3{))jNqR%QKoJI&K&x&+
zKWIp!AFsnDU-gAAr!UlwC&pWtjAAy)V%-kF*ZB;31hm$H@klY-dOJzuqj(aI58>^h
zeA=)LzGG*%K+nE0K#{h4S;u^ooyceOQ0Io!$IfYV1p8B&^b#iR>?|RL=OKD3!ygY|
zfjORq{c&WP2XYI%Ak&v+oy~3PrU5X2iop_%$L7H`yj^3ndO#%^$2{|#gx@$<&f$M3
zvg2evrtGCE+XEhLp>cr>YBmCFGT}qCNpxi1Ahx~HFoz8+WBQoLf}QPmSj2Z*0(#`8
zg@b@G0CzTmO$&?D_*^NS=pG`+lo-Q7fe4yRA~f^BzX1LrZP(l)IHp*nNB=-zb$c!$
zX2)qnS4OcV_!-d89{pTHKk#nZkj;|A<A|<xBP7@rxAp7x&dZ<o_b?)h;YF@VrmA(7
zwFXnzcB{sj6CGz#`7tSRM?B}@R?Mr`pVQNXFYyvf@K<FedMKt*I!e-0qZ!QTOMN~R
zgX3s$0uREOk;D)=bcRt%7=~46J}3g<jV=9(B+=;*v<MnTNpC26;1=oGMWCg;NQoi0
z+>)zIliW3#S<x)Ga__*g4?4zAqh7CRy?ot8n;7=!KFIlv1urMXCY=f?A$}mMba^49
zg<Hs;rATv-9C8RO(k5e>S-5MGliXA;Bb7VdG{;k0t~K6!t_CB)P5<ych-lf5t%g_-
zaA}8dCeNEbwT}!j@yIwVWjjhd5_8H&Y{Yyu6$r=ZVk8b`tBXN9vb-2aI_7N$cTmb3
zG-SffG?<^Z)VIe!P1*69@2aN}F1DXMtJmjKYG7tgR<$hTuk55(p7&PHE3@FKbjvWx
zp39;n>!7AB?Hq{tgjZjjYlc8`05DqXRV~@1X+);J=8fjfka8hXU0zj_N?P7-629vW
zbq;+s=qc!+F?zY7=)y1x*pl4Qe_>4W?A=9#%$(hF;x^0IZA-Vk?R{E^VI|4LFu^;{
z;b0I=XSDW8W~T^Ju-s;X!*vl56|&8Z-eBZcZ?#0&A6Rmhf-XQG5jK*+65vU4PD0zG
zv*QYl84Pi;kV^Yeh2no;20<#c$(nt`7OAk+9-Z9j4dnOVi<T_ga&>__;#EAGk!5q1
zh8Qp>gbmFZQUY`!eU1!@G7bXjHe~&jByu)GP4+vzjm-sWF&#G73(KZfyn^17e9ffu
z#Uk=*qf@}X8OYs*0k&%pK+m25GtW~{MXy*}%P}BbjZa417gr8$Zjg{U6l=YooJ=re
zpJDpbwmz#k>|=A$P_)jl^l5NjSP(O6RKoeWd#>+2oHx$7%Ma)2OqpbjrE3<->63Qo
z+)<)(z~w2pmU2=zbI#-)vxkx;ikEV(Dxtyh$XZ4RHSgPmQhZ=}a^@(+jSq;`%JOw=
z3k3gDjP2>Q2A9W{^KgdZ#rBWyUy9xBS8umod>wEb-~RjvlqygM{O(+T3SPJ#D}WB=
zF4A>pKfngF&{?uHg48bINPm5Yc2h==HNPf4Vt^evwiJn>UBy(9Qjf9uIoUrvubGco
zrz^Z%exUF}3pe3i=L6N0z424)1?4sdyXO^d@P5!OYt;MHB<)H&zE?J-@M9~-{wbwC
zcf>B)d&GP?3}^oKka)I{=sU66t0Us?KAgK{SgU@T4U+1k=|JJ9k;~dL14fNkk|H0t
z-zx_WKmNh{y&<a<pJ*dkJc~}X6^y6okpY`)`cfZ5jMKbj>!oHYXtYQb|IC+4t@M!V
z$PJ?Sj16v$<CAC)pSNX4#a3&ihe8xr8}6wwLM*z^-C(wiN~z#4t}!K|E0d1=be3mW
zAmtbr1Hq|EK6x%tEy%*$aZz`5&`2z5{Bsa-0sHoQYf<A-j}NM5CG|xxFU74D2fJO-
zw%e`A<b<2u3wraA&P0gb8SZ`clA$(d3;1tEY3edwiQnb&i<RN!>lo&jSArV=XSj=(
zDt&mwTP<p-RCr!fio`rN_5%f)tn%h2ZOV<f>%vrsR_TI+{M%4Qp~1umsBgscrX$35
z;kK}<n4FZ<(*ZU8^^W7C<I<V{dog^m0qS`btSeQ(mer(6__GS$ipm;d@2JyBkC913
zla!^65@3K?shp9*8>eDx8!dwm1yrL@igf<R=1T76w@ItPuzLW@$IJ#SIr*dEQuMXq
z!a@0CAu~9xFqY?kENCW6yTkd%gH}GEw+UO7@`NI=Tp~;5*t(Als*_(cCP^=kPH9qA
zX%8N(R9NN|l{3^!%(i@(F?RJ&Y;@0W1K;m&65;P}5@T4ZZXVz7SZMy=|CxhSzPK-j
ze=?tC@i3w;Iy7f!@wqX2+y(=D_kDpP-`^@p5~zBkbRpH`b~xpxsK9OAAilT82{(rE
z_t!$X%6S$KbJP4Furkro?QF2d(K-HFaF1m;OBME5-n*}~mt#jKnUk$6)@0J!ayzyJ
zu3cfqrp>%lpy($g8&Y<V`6T`)`hN1`gIXNxZuaV}T0{Kwrfre(@dN-ceZ_jE4c8Y`
z8$u{4PgDnpK<l@U__Sr7sPc;yeqPcLb*UQy%&4L8+-V43tnhO$=xOw+3EWVuY6nYk
zNv!;4#Ti;<n9SR#XrQRi-4U<DlSpK9beaoiAxaQB_76`ZoTdE))J$AJJh#3Lw>&r6
zzKH&*7}eY9%ZOb(cFBwcYt(e^H;3^n6s9_I3;u=jW8mF;HlZ~%ih3{tZf9SlHo1L|
zg|CkMRn3+I?4{51<P^}3@}ZD)_!Ng?e^AVCP2HEBqzsbjg&GYny;i<OiiyAeReY55
z8V_>Nztz~_{vf*dKuPgpzfxX5JeNCntY0=Lcf>aN`baD(Cxcumu$6f7DY89mHSwy(
zq>dH1=N)RCC=HaA2UP4!$=u0NRf>HVNK6w!&R|htu`TqCM1DlFHO$0WRFS`Y43jQC
znkeJC8XX~}qL4!EK>SwP1b(oJOe}-7xN<{10Y6F^f&nJXs}Fdf`N8S5$Qx0Knarvi
zo|o43%_jB1v9BZnZ}$;<VB59?5j5{ED&pVz-U0tsxA@n;*7nHsrdAoT@A4jt@2YyN
zJM~i9Na9mObR$cv!`k6FAyLm0x2hP+Mks5TRjATInc`WMQR$CUEjg|WF#T5@vw@C@
zE7|m7b+srx(_)Nglq5k>f44!k7PGH9t=rHNI_;lLC**o(5iR{k2@c6D!Mte6ry{#!
z>&QW;=23%A4qT~t>8eX8ZK;_QO?AhtnOCb(Xw86KSksfHiV3qzsGGDwFML#1=uQAW
zSDwT|U-&DqhC;PUF&@P!9du_=n8NbjiO$2pObr_AIO?dEiQe^uyHSmSuA+`6FWc1e
z0}VvS7t~2tG`mZq={Ouj77*MTJPLis{}ro{(MH*-RpV-vU!fH7>68ULC*$gegA*Xm
z3Hl0W@E#T!UY%;4u`rxai7(c|%Zcq3Vjm2*wz-8)`}d+zh&ft2%B!LU?-mWly@QrR
zIIqd5k@EwMdeFq<flBslRlBsXkBr8NQ*cm8O3UW~plknrASStoejC7mr5K1=dj7(G
z4lumS8{5#K!EB&}DgQw!Cd2s=4h<?gz@#J#q)Q+bu89tpRe3IW22E4<gsFRiu7buT
z#FH|0C)QHoMEu3zYyaZd+@Z{7VUHhM?GC=Fo7f_ba|?R`c@{@nv_rb)FRwsy-4b<z
zO8ijn8ApR4ubF7wgld%wWr{zSUrw>-X<JSS`gP!@%`}^#?1{4eiLMTfS6IiX=(pd?
z=4%7xp=}&n6f`G5ccI%z-=dMiYUrNdGLD}<Y;RAN+8bTRZccF^UhlklDE_ha;)Qr1
zUTnWIZ?T7GsFwA|$>0R0I0tyRfygceMY<TP!MzSc!I7M2=C-34Im~OB$1n?#8-uf?
zWZryG2tTHRI^?8PAtXY|7~F);4+J?<-!`@L;0u4EQBd1jPmMoxfLPI`Z3l)m)FHWM
zF-1${u{ulAlbeWdBtAQV%kPL6xcLd8>L(P}eA@!GZ3W+I#ei`TJql6ejvG@7o{Nes
zrg@|i9i;0zz4Z#AaLaq^QRo#vF~(Tv0;!Njs}1oghoK=7w?UX%^i{zEcfNlAYJca^
z_J{4~xVXewG7eGY(tEKfY*}HSHxi%X=nQ`=cDW&0U5@NBLZUP#b5-nQPqgcTpeUX5
zp$>nN)6|~vpTaZ_hZsH!<nt|1P2SG@6poLeDh3bXxozFPY(n0~4SAwRYg%>!ifBMm
z^WX-Wzf_`}gRC})cytLpmt@V>gI7IbpQAJ(v5c{Aq+q6{ll06{Jc(z~_~H+k0GeQa
zvFKkYOUUVuZk3P3pCtOzEW}XTt!$i}S+}3_OYUZ1DEp0$4`sH;kqSsXQnrsI9Y(2T
z>EJx-W^5cZT3La4$oyr1ex2*{i(cc-Z?}=|z}MU8Pc&ld3vT$Ncw@Y=TS;XM9+&To
zz1K$f0BP5;BcE59S4<nN8J37ghVJiYK%z8_21QfLG>tx~_}K1tU%%%~trI-kjFiI%
zD{izLEjx@zG`=fCcf=N3<%&U-U?w94qmT|^6+(p;lvU5WPiq@Ee5ZEkrKi_M;qSj!
zrOS@<3TKfPIh8r%09)z=#REM58NIiS@{->8L3Zocl1rZXPbY6iIvYD0$!I*!jzi<*
zI#&l#N9zgBrnqioRUqjf8TXvzQ4lL@*6LG;pf1+UjwI*x%A&40vB^vEqOglLUT(<6
z2EAc-GPYz-#);&3k<c~9i~PoHxmN}Y_2Np;QgT^gCyUhTEdsyF_*MoPoxV1P?6;47
z_&4BMUl2x;Jd4mz)wwYkCD+x#C|>Qn-q~*qX;*C6HQ~w4jeS#?cenqxAlw_!Wuf+s
z!d^bRtHI8ju7J{5%~XFF@wkcyJ0eR5Y`EZnS&e9QIlEHj@y|LrXvSewF-x%x1!T7Y
zcw`?Hvx}({7ESKj5ez4ECo9DG!nE|%1okhWDVsnPuY3coUTWs7z=dN)EhaQK#OA`J
zt*0wHrz{82Zy!hS@2Fl_E)AOs3bQ1=nh42-VJogE=9IJ+kX-%`N|B5wGENvp4>X(2
zBbs^j4Ka>SW3+qpu7qi*w*s8C@~DKCHNURyTz)LrxQ}3sQM?V*beqiSOC#nqtsN(I
z>v9RdF1-5cscabJ`f@`+q2geNdI&-jcGzRz#4&bLdauOYL!~Rx9+w1W#ky@X)uka3
zquD&2(A+Yixg(xaP+Hh{qcxUHkF@zx@&EhLIAPxz^(x1L;@KW@NpX34F^mTUzloA|
z@*GDzvHc-WKT=&e(c7{qI?;3YB259uU=K{QrYIaj6}cz!BcsOx*E^UySLGNfQT7S#
z!qgNRB{X7II#mlV-3P9uxaFF$w}uMDCoYYh&{b|rF&>+4Xpg(%sq#a+YE_s~t{XY9
ziOI<b(QO8iSLe41*}|%z550*d^1xe{%C8H(c)k7l$L(EoPr#C{p|BWW$a8j{hZd4x
zHHc)@B%A@Vj9d?ga>kUMzUQ5<Afwz9w)LdKXsgnJY4M_IdT`*)6(&Jg+z#2yhFBOG
zGV>Pl5)?Pcjs{^<3|QQk(a@oUa?qhT%WE~Iv^x%V8UV43Q@k2jZV3RXua<7}EwZx1
zVKRcHDbB<(06E6fW;Wc}7IQBWU8NCK58QXu&krIzg2@9VCK&o$B{l+nEAIzNs)ERv
zI`n(qrD=*h1Hl(g#E>h@<Lnq@`0Ol-Fz~umI+=@6$cJJwACGZ}rU}e&Nij69r{NjU
zaXFeP?Uwp!PQd%!>yfZww-xl%5acxI)+{YKt9w=xGPhxVRM6W;;<11=MI4K#Ape4H
z`BI~s^etOeE&hIGMI5goV~M1{>BWu7xzGZKpGJ$EDHEy}I-Vvn3q>eMlfdOD3bP9_
zPLh-Pw06D2O740lbsF*Ms_2td6R{pY1cy{WwSEJdkF#hwX#5)8#heH1SBTDuQHn<E
zX_$fn2(uDZHK0cH5a`Wb%eJSi(;U<=nPjAbUdIzm$3Qh6ivE1YR_Aa$mfi<=RNyo<
zO6I8n5dr~V0R>iF9Num1|15%M;(Zojx)12(Q^azmP&BwF^;J5kh-XqC&*1koqLY7p
zc)^MPfSC9Po`e!_Wvfn$J*!2)h@)NWBap#tPH5WNuXgdq(OoS}n(}q7({qlJs#d$6
zGY`ytg4Tg?C$b0tAmgesO*tT7>1BYp!=jl-!7<l0rj%Ddse^dEoM^_*<XYrg3a(z)
zNbRx|WOu|qit$v2ew@TOCuw<4W0;f0**qMH@5R%HKoZ!_g)mFHtKBZb4|}$L*pJ8Y
z>|#OO{oFeS=>zj;B0dg|<HHQlPb0Zl)DB7|!fV#-j6T7f<mp(PsA(jHfqOOe4*o#d
zLRV#slpKa|s1f+#yl`EY_Aaw1C7GBNof=eHX`{@yCGjzN$CH=y<VenaudNpUB6?Q`
zm2o#~M%2FrFh7kp>*mK?$Cz%kPp3V+x01(;x6U=Z3ZrT?2$H1`XbQW3?Bu4A+U6}K
zbNvC{#PT-nslw14lwNTlPwD@z0m--T_3){8k?uVc(<F=Y1zN1gON#yIIQ$eR={=VC
zm^lMv6<&UbKf9U%i$_o`jz|YXqZ5b@q%#(_C$Abee4{e6l$Zv}nWBxgi+oYN?$s5i
z(c!`sqg!aDq3B~u)vuuqk*}QQ3#cHC=%A3V#Jz0AGt2v#aP67c%1&SfI89(R3^QX5
z$Z~B|r_6BmGrZ^zZ_pzr%zP>_&<Ylp;T(1(gHVQjQ2L(J5_wS4DndJFx)~^!XARVR
zs+2~1QaDigFkP3J3QpdF+PQ8vcjOb<DXfNa8ad5K3N+~OS2h;VMv)duwR2#lUHm?W
z7X#?wi0*)5yU164XYITrqc!L&s@O#3l!o2x6aQ`HU>Vii(~efw3%r1z8y6kzg2=<q
zzu3H2$_6!ZAJvSdX0r#k-VLa9+>%&Kt;0_v)vl!Ac<j>x96eCd4b?&Mh{wP~I+7dX
zG5VMt$`hqgIL?Y(vw#+fp9Y#F6<b!DRIp!%>(s|pEay?JYKfmJ^>SVwTmwHkhB%F6
zxl)Ipl3*N7QU@$7Ow?xq9Th)|=&9;+10*QtsKs?${4Am8;>R<EW@!lnG>@U8&KsMw
zyu|+6=%{MT%%fA-H81W?T6?^7_04~M{rtH;bpN80QC{aqsE%ciV2?F>gtqKQd`7T3
z8;q~j2Xg7=<~sfk9&dEb-|$)Qt*@>BSFj%RHa9jN_u%htuiNW&|4Vdl2*=6~D4Jm^
z#DC5Eu)&;Hl&g9FFZx03XNMpoKA|^=x<5kW-nvo}ksXlm76@uPFX=Zf{HM0#77B%P
zbnP=e15-M#(Md4*t>xI{w96-jWvyRcm9=cO`L`$qO&tW)G`zqBP`E#X_8&oCuIo;J
zKGJ^uY}Xg9us;~K$jWBfAhr9WXhSUr5OtI2s;)H#v*e~u3HWlGhZ!=n!Yvg9$`idI
zcZyK0lzBxg7&(-bF4pLR2Tm^Nt}iT18JVYJj7L(Ys2GrQQXG@!_K*OnWXVIoqEN6A
z+VyxB;wA*Hf!acr*}?>kV<dP@b_g@YC(sykpn@t(D}_7w8=W)BqpxRThu++Eo4HHJ
zXghScOyO#v2=sW@9|yr71EI>W#~T>gX@NNpo#+R8vf?Kf0>nRPeTdR{z{(l93J}w)
z4cjSB<rFq@X%_JXq2i@2x{)&MH<=`w8P1s*&LuNwZtw=3V6JOpLZAww&|I0HmIe4Z
z7f<2Co&LbvAnuVaZ~9q~Jkyx5d{L!|ld#ML^svgTDI7*xUOIxg$cENrq9RFSBk1dZ
z{F02|=}mD;Lw<Pi<KE6cw)K6|NHIrp=DDNSw`?F+ydmyd9(wGO09^Lw1IXU=NIG{(
zcYE7s1MmDzl20D@c2d_VSP`HxIp<Px#fyxKp;q~pdf!q*N7W7*fXA+tt-?BJ_v`Pr
z>w?)IgOV5C5Rkbm%&Y?|K@2s;C%g`i7KDOV5wm+>yN6>XdTJhKm7#Dh%%g03Jh}?x
z^ICB0K$Q+nG0Zevg69*=IX1qaNsHDZ92BzVQseUsB=0Oi_EZh`FD$d*9kd(b`31ed
z5QB@sI9e6^#}qz5%;KYCbXyuE^C>zqNz<)kAx=i6?V)@e_P2(^m3t)N2lEvDAJ|bs
zBop}K43q$D7Xd~in9&x~hCv4b%Qr&sGH<MJavz7E@VF(K<R&qn$dr=IFEMEhVdaG8
zJ5YLU6DG24KQX5N9VQOhxcd?3LLbT5PmoHVt87(lF*%Wt7=mC<4jDLZMq^O%G<%4~
zVc4TWO<)#USP+SRgiqASCFr0vTNT_tk%D0`T2p1QHV92R5(qM;*;xdn2Ez5AJ0K^<
zUf@*Pm}h&2_F#m;Y>n}f$n0bIh<qcjylJvIuYUAZ@f`ym8cmTsFF!4d<<SJ%c+hB*
zCg-an_{(b3DQOPJuZWbz|A{P_Pe;0Gj{(5GsTG+O6S-G8kwJam{vhE0WQwz*D6-9~
z{JExH*o#E8MFA8{<Ru*JMFl|2X4Kw+*ifZBu)Mn|Sf(XXP=hng;lX*37xq$UYyZY*
z6skai9|siDA&UmdWSAX@2i7h1CCPVVfKCg5p2FOXEoiNs+;s^2ZhLocXKxA67v{MF
znxOQW!5ggE(+SK*%7C9FH$!qi42a}Mqf{vve9=bGeZkDV;SgEde0`-Sr^6(fbVxPA
zFqMqXl`xVXa3jhvpl<c}sR7E?oDP62chn*n4jfj0W{1=xU#rZ|QFSK;ATa)z%yPQS
zh?G!YRu(0K_VUVG&a$9L*kI|Hg7SpEtC=u><+!|bXkEMuHHA$|IGcro<HK2UD2w4J
z9ir=Kc<QsL6!^>~fSN9a*6{RV>Rzq_1!Wu!X5#*p`&f79ypjEt++5N`0j^Olo@!L{
ztZF&6Zk;^NG%PaApMhSlUv4}1t=+A8j^U46yUtVO=bzrbHJ+XxIpl!Gp&phh^jqq!
zZv$jB8GiokHViYRuI-LAY86_}I8G>HGKj;(|E3?#D}mu+MUdc^%b93GS)tuwbjJGi
zy{k%*!l{jko75njUwl4LN?0zx#U*qKue?2~D9s7%7JR+>ICz1ckp^zpud(Ak`qQ9O
zjWeD~u@x7zsl|R<;<IR>>Z$+xZ36$LW`-<D{Bx-GS@zADHlU?TH3Q08IVeEqSph7&
ztzJz^;I*%*vOBzSE7e(J?ia}O=7V%emr?uFa_O?E8i`Y>od@Fl9B9xJ7Z(?-tK(aF
z#q&Hczg_h7Aa!A@-YtazC8Ie3v!(!OhL9cOpGL2;=*5M-;oskVwf)ALp=H;dJjRAu
ziXq_v;!xlAtZF@;%%Y<x?a(EVNKSyF?c?-978IS0jSYYQ>qh^&d_4s0E+S8CJRM8v
zgsk=X^XG2RTU+1QeEj4o@Y&~<ACg|z0)<=fn^u0@*>6N?6-nCk0Pvc6`tgj5!Je@!
z`o+h7JPFeaH7kC+FS_b*MR5r=Q4cbsrbn+}4BE;DaV%Q@pB9CCltZ|=F208z1?&^(
z{{qPodZ<&f7cOGjTL{yj6w^ZWz(drs&9|qkZh2Q#M0Mvx8C3&|s_RdYs<8E9!UkTd
z1_jvF<tvQ4$?VmX>YIyDoyZ;pOH#eJ5Y@Y-T~$$?4OSp+^N=oe6EGFyDQIJgV?ja`
z1p)_japJjH$aPi3R3CH%5$ejY1oB1~D<-26G|^N($e1!_D;_X-_rHEW==O{s2WB|e
z#TtbDbRA+S@vws02;3}2c5s|U>tZCQW$Omr<?HrJ&Rvjbn6}ATrs#}p1}(R&N0gU^
zMzpuFdH>0Qm#n6GRJh)6rXwia@8>h)87NOy7<}mUz*mk>-O5t=kOq4SN{pPut-t)G
z^Os@vm%j|*kE|uy+*7gAF&?hzGjW<7ZKOq4Rq<uOn1%7!S4mcR5MXACVl^zHYMq8t
zaoG|rifXD<OT?f}5Va-7ZS3m6NlW95x9nBbv5M9RI)u7Ro_bj5<xMLaM;71uEme!?
z3VZN&4D#(_CbRVP@a!7?tzn#6JW(+me=Swv|7WNQcweAH!@3~og_1#`WZ8OGELj$r
zt=Rk8feHKD`D`)ZpET|$@R)Ba%61!!XpN$>wBoU-hO^`Vd+@&Y02fRCOARorGaM!B
zM#RLLROHm%dS2kPaiUP3G$==+ExrS?duz3-h$4653-`6|=_{zh>^Gpd2fO+KsFs?R
z81(9&6$8;P1GZl|4A<zfbTDd0e(5fQawJFnYxnrr)8o1wioSp)G6Gqs7G;D*gl%ta
zy#PT`-ZtiJZ=_Mx9)?<}Xs-vbl#v<Md~%YQ+?99LBB7flmw-t!JC^ad%NGBe$JNKA
z4I2z9kiAWy17AR<h65C=-9F5l9+)?-!Bi~-24_-l@p<%x_xX;<Ri{9H7>m38rFQz5
z$@CO972$ZCoXPvEUVwOqxDoX74Sxr={AWoz9$uA*Lkh}OhQEJ%Yj%l&b-4N41-?M!
zmp7`~v=rmn<Eu8D)ji8?WT~y2==?JUKl>H2DOrA~h#!u!_-t0Il^7JOmeuL3S5)#<
z*eD0D9I_2^ELjq*PVSV_WPBPQN|ee)Ev5WKF55kjTw8QpN~(0$Zf;n-9jsN3NEs##
zhr(m&Dv3c^ZlqFI8z$nT{=<mehEVj@1>04eOBdv1O;>xkuKd%uxv){Vs6ln`wkFk}
zKPt<Uuet2xJ3`6mwT0<XKZgBmMHaaSgXv_h<_54MqdI;yE5o0js<vs#HijXc6kJsQ
zz#2w+E#F#}GLQSh_W2Bozzo6@T?%d(&Cp50@?LWNJ0h?1lIaF!O77f!$!>&!@jEZs
zaJ^Aph}DPvbbCM@O~|ZM6XOa2z3-Xtd)9k8r)@(EZ7$`W)4%-%Jrja*I6o{8=eYrg
z-=V+<{rLjW1L%N2uN-=G`e*`vIe5u<s3IC#g?iYwJr0xTEH7$-n&Xl;*Ve@qHppby
zauamaNd_gCiIaJzZpYURQW-uskIv<laPJHjkRdGeR8ZdQ?1zm`*!h&rG4oDNXoH-V
zpk&anoC>tYm|#Wv*>mPF7QHXbFAY$FrGbN+lBQq8E8hjMILfheM=cd8?E(;ivv4%h
zuIOI$TpHM`BiE<(F`Xt;b3ik`T%<EM7`Y(I(cNw)8>+l%>1<>+F8ILaz+>7kc=O%&
z=xp=XzY6;HgV?AO{O^_luHe#rlkl}1;w|GxeQVC$4(*nL?b`m_J{U`emm>)21hWim
zhSxii$-t3=3P$s&OAVeQ1<%hl4`4tFTp+KmZiic6TKn(g`BB8WQ1(!~geUX9h_ehN
z>z&}q`g*-{o}nyJ>O-;Kd%FH~^KtL#V`G7l5RgafBn-sm^R4I4_xGPaf4=qd<^I;z
z^DX%IT>jgK7caN=pTmFq@RI&~xliA**h?+~fAS0X?<M|*CZQhw`FsohL5Y|6=W~1k
zzo8|lgY~dK{*$Uf(=WFWjx8*>Md095D1#7Cd)zG60C4x|?Q`sz-aRL1@qg?ND{UF2
zUJ`^?CjLEfNq}%Mfal+z78d^FK?W4~Pe9t3cY84HUcG!PUOnGaHj!jLo6cuE5#jaD
zo0ogu#lx(s%C%`8;ZLPGw3)JHeU77wR?$bWyk)g#(owjmBg>5y8zDS?+5Wp92~xV_
zbe?hBuFDp^>KWY@fuyEo6I{F;b1YAn+3i#%I!(t%yXl=5A3V(;2uk&0WbC`_tvwO&
z5B~10J%zuXV%Q7#dlUZNq^JCzp7yXrm!9JL$MWgAfPeIK1D<Zs(*U0J&`Wg<9<5*5
z?%D=2Ok~bL<BaHHxKUKH*TAbk!`L@MR0Muh<?{lvm_o>hE|+%@rf&_ACO?VOctV!b
zn<j;Lz4J!@z2PB@AMpQ-U`5sOf1=s7ga7<jUHqTNYwH_pcKjcB8}z=$|M?OhJN^$(
zRvDTmnn|l$@(Gi353LY!_?m)$#S^^3p;F1V@IXUqsA~Fh$|laLfa?N<;FINxTPiC^
zoX$f9r7zH4$N6e6)g2m+#m8?wit*moix&^Y-t(<p{I#>kc?RIm*XG~!#~$Yx$V3M=
z*GKblNNbpNV<X3aukKu0x1Zc2z~eAGrdeg&;4#Y?uEOSRpt7^~ZsU?{1sjB^EL!QM
z9A`RaVCEWT>WkNb>lQDKK5-e)jl}G<F+7*(om*C?0x+o8t*BQHVYjS5s8a=JNpBTB
z^*OZ1m5x=2)n$G(9?{~-!;-Adlee17gU97e&h;1J@SrU3rpw@^1+T;3rH%SaKVF2p
zgECjQGUhG?rkuBf&2pg1IU8%00$0k{!IKII%X%uO0YbhYOKaA(u5vmIn>#m<`PFwd
zolfR+GbEWhO~|RD*R{cfq3RlG6XI0)*Wm@a@=CclD}xPVeNzk<3YQ|Y=tu$=m)Osz
z6fGB9G2U>>-~1KYozAP?_qrlqsdE9Mt;snmMlJK8OOk-~{mc8?ySsd;@xHv&7^X+}
zVJle7PDj%27MOyiPdPiZxL-QJQ(nCa3XF(I(y&!6O+kLG-K0SEEF)DahzFgC_D~*U
z<SCgTVH1y*?WhPvY<j_3ZyhxE_4RHK{$C65kM7zU{Jas($Pq6U-7P44Yg;PP3ANzS
zI60%xI>L4HktED0;E#_LluM3@vCky{^k>r}z`iXGC2o>;ps(e*=kjl18i%ki7f7C>
zl&OGY&E;Xy7lX>>J}<k)rNxgW<>d-<smom*EVAmf_Q?4`(traSz1aTo{Y$aC{p#)3
z3*V4x!XwG}FPcgGymGYNETs8x%SNpc_qveuo|Lp;z);@|-m~&Iqma_qo8rH8*M==<
z@}LPbIz*`AG9S^Z%1g*>zxVze<BM8hDE~;<3bST!cl-5ndrdl4!blR=6s@eirqQWv
z`=9gkO076AS)ssa*cMaqEMhd-jjV}vbp}>Bw2iT^-Vx;G*2^$o19%okn(d$J&{4++
zsuQC{u_-FUKj!eC;D41eHZR*3Lkxsr_-K@1r);R97!*<bq}B(F)v7&BNHxW17-AAd
zLymbkgi2|0p(4yJL<CZ(%vU)Y^a}Y!Y>LO?i2`=bm$Vz6=aZ+%h=#}vq{#dp$Gy~b
z524l)6Dt0NC8jP_EscBCZh?qBZ4TOT$*Z0`J#WVkf~OlL-4gaO=txhW3MfT~)#~1C
zNxN%imtGt;7Q<oP-(X%~Ll{8??}-0Dd;h-Jwyi9R!{^`Ar@&IQS7O(4MCxW`wcXoE
z+|;{CoMSt^>@05|N}_DmlBkkWY{$p@nSRgkJ=r%i07w7?DN2^zv@2Yzj!oh+GZ+j8
zgTc&k2&$J%IV|!G@!T!a+m)wf;w~|lJUJ6GB}#`{4fM4*RGOn}8d&_NHxx#4g5%Gx
zZQ@&=#1neNv_CAq#C#S5uHp@tn(^h4$eltxqZOT}lbKH@vR~Xh&LU6do59`yL(czZ
z&`R<Sz<f36Zy1e(3BUllc%ql2aU8KEElo)7<Sltta-X2zSta4?ia88vZFPsFc+M})
z_B3i1zGqeH$JU4Nob@M|8O9&*0UggN%%wW0)||mh0*H^fWN<<i%~hQ>GoT;szde>I
zj%Sx4M<6H1v7xF`d?B29-8TH!f&X?G&PGlxO>xByM#N`5&TlRIyA`0L<AcM!a!|?U
z;~5HPD2b+oq$?`|I`w#!HDM~37~begh;9kZ-P3gUeDtkq<DZ%`@89kpye&8SIDKHT
z@cTIXL~k`rw8$z(r#vW$`o=w}oa7@{HJioS&@wmJlwf4SVmU^p=GQq~4@{nAxj!*L
z&CVm=UrqRw5jeE^FE<$%0#rP^sK+}Xu-a@f&Agx2w3&nelB3XwUKCHFm;2v;zryN-
zCj(r8*0wj8Xd>yqS+?Wlc=Kj)$D|rA?0s2o#6GOd$otcZKVm<Nu;2VPiE!7R@%862
z@zwT5m)><u7i!cZdWu0!W4jUik22be*zj89R>6%KD}4*5i$dVc&<=wrp7F_miF>m4
zv7Gs=?o|XhmT!&BCfDQyrP*6O36KgUB?l$78m7Q382hmuPzwl-072PJ<^tmsz)^H1
ztYiY7Y???zvq&=j#AcoovKQd4+wy)gAD`015Lp_v3^ylVJ4Q-L+lI9&+bC4MWoJpw
z%|*F%l7TrjcDnc^*#!};oH8<_rP`|vG6@}&kw8&moh(QkEXf?uCy48jJrN*H>Y!AL
z%lHYlvcaybr4}ZFv@iy5(B7OKS{ycQbS(Ki^{QD`5*JfUv3;|7Tg72IDO&Z6x}2FO
zFmYjY%ZMW_Ca<4lumHgyUh>N^dcY<gA5|tCi!%WlaHYMO-6~^Jd|93_m6awTGy%Wd
zDjo71O}P1|yhY12E1Q$;YY8(rB5dTJc_RZ4Dc7KiO|)T)B;8g)Q8ch73?(=Tf;pp{
z<RzI5V6K|l8X5`;)*%75EB<XDS<2BxS+4M7f#LPWv#TwZz7?+4o3OUfFj{cZ7P55W
zn$L1mqL5B<U~(sk$&kLBS%Y|%AMC;41qF7aU(1Zj+Pg(OBuU<t`^-+a@_pt_OoI%o
zbDN?a-PrsomZq$PVF87mG8E?g>*r~fg6mfX*^m;FLiZ1G(JZ@Hk(4O+G|R5Ci;;5L
zV{Tut$}kKahkC&q!LFN61B07+{YCt|C9wy5{F$H6<&FHcCJzH`#08DY!EVgNQY)U~
znXoDpOYj@PP<EDBDNkn*iSFW>1A!+I_c0jS>a(OM)+dl|zAC#!t)iK6Q`Y)bGv022
zZgvM%ONV)Fx>jn{TcB+5(YcdoE8O)v`Ac4Qy|dXO?OSc-EQa>{(zPww)L@pplyuUL
zQh<OJ_ROiXVaxE;Z+Ie2-@MEqWz9JGkw(+=X$`FWBO*y5;d7WF)1OpFG;GEXqa@lo
z{R?V|MYNUud~RxDnW6b36-E18GY%PSTGah3jG5Dy2hbQ-R!1zu{IJU5y@FA?r}Zgd
z{M73q6fk~xwSEOm9*PwxU~9I3>6oldElUr@7pP@?%>D#MF#h${e)4Yt!74hH^Z!4e
znxcCmJdm1V>GZFtrWDW?&%-}UHKoMRNZ|hnHAR_gpN&B)<IJ;e{UqH|_ClQKh}Jz=
zQY=G%@2ZPAv)ItyMdNM|-j~hG06%A)DFVKPqO@k<3n$fGbpLeHEInhybP;o<^hD8+
z(LCi@Kb*|OIeKc6kn|CT3}JInkG%y&-W|M4Z+uw&a59%Zs<KC|nB9R-zbTMGG-)as
zNSS{!#yE!jRzvZhMQ7Oc+`H*n|0E;?t*PJi!}(<P-M7x?N)YCpEPk;rvK;QdeJO4=
z-;Equp9l*n5{DUay-4?H$O+lJ(8q-udqQ_=U<p+(o}O$l-KnC$ODj7xs!N1=y(n#H
z(S%Kkn=_XUaD`xJ3~z+|#xB^1joE~SY|4H|0mNo(&OWkBo*?%&z3-h)c!yFOIWBV=
z%xN;G#lsa)Ab~E31Gmmx47J4E2E!0iE#|h>`#G$8D=n6b=E@&CL*PZ<%gm9?oamY_
z>gJ2)!g-acVkxoe%v1OUGgblT`gn0!jOZabLA~K?oVujpSn!yc^3L;Ca>3@u$$WPH
zIHsei??>VF0Dm8yg%OP1xWvVHl^GWClO;!C`CEW)K4Eln=jaXHa@F0O>YZ}c8#&dR
zC4sNo>))~Z-AHGzojJ$Ja+wH5C^^i=Rib~;u%v=@dcm`W<#&R~(gRo^=y=G(AcxNw
z-Z^4Z54wBgn8_-IG`JhX=E^IrE7acf$==9>yk$2+D#;co*sOeqik!`gR047LvqC(h
zxFX(3@JhfEy(}{^CwNd^h1al@vvaF;#;sDSP}lFc^7eDdPSrJ{%Yj&t@Qu%k@Y#qy
zHp;6sEg-%72U1?qD@ljIG(UB`g~_cP1193EkIb!?slu@wVWM=Psw%nrzWi<$%dbc5
zO>znL(&wouc!hZopR=AnyYwllrm$Ob#SvF!k4@&I5f1be_KDow7Qvt10CQG3E0PRU
zb?S)vDNVo4`rRm4veyD~CJ>|~sIQ<wYx<W%F~?a8rl!lY{?u8c(QS2`Ffp5*POH`I
zuy(82XgY2EN}A)=yF1NRmo?o^2PSfJr_rgmncH#O%}!%yr^(<qr`2wBnjQTv%A4K8
zU)j6e<HP+I`@8J*{@a(k?D_5?{C}72z25(?-RFD9Kd}GYd;50(d!Q~9-`~|5IC_7y
z`xf87+CAJmW-kv84~~EM6<RvlWp8)izW9~>2p`@uXy^D>_QT%my|;RO7&_?d<-yyx
zyX?j8;lXQm_#V1E`T>5&2&^xl&g(t)diOmPI|8_V(CYuVkHh}@SG=!z03QL?qoe&7
zQ1plW!`FMivKPO;J^lf3!#L-!ci9`j>gY(v;W+>Zc<;XX6-ogZhkMWWUO*E+?H|6{
ze+zYg+&%u`^_~KGDvsnXMr*KcMi5veakbjk?T*`F?hbSHk_})Ghc%$925U4~qs1Dq
zG3v0!4r}Non|0Q7fIV0fplY&ai#35wfUR~|vumJb*+%6}u+L$m&EtHIeA_xuw9DrA
zCQ5Irjin+!DcoFZ?WjVRZs&W8#Nu`V99GGAl1TWp)1UpvAh2UJ%Eij*;?#>^OA1}1
zc^cJ+E!@D-U%GN(GzT?QJ{ZbqalwS&fQK4e<RnE#I&U<hupAV#!#A25hVw{)DA8ez
zyKRq*Y9Ob6V9qo4KK4NuI)g4h`ka!*^_&g%;@t0FaN-B3t<2`pB!+*dK7|gDPF{LD
zs$!ENc`bAA$Y2*u)xo91fXdaN0(#L9B<^Nje>Nu~_WTiLY6<bXIVMqX7EJi%jqTit
zfgt4G2n4kVM=;F@oXm|A^UjXZc|$|M{|I1nh_kq0NDHF5KiFO%0=)T^DFes=Xh4_0
zkT%0850qfTQM04qBkyV{W&W0Pb&8wc(sGuYN{dE4d$X$qt!2X;JFD#BG|m7#O!QWp
zpaCV;+Lx^g@B8E=?@Cz@u(<fg0+?(P(n5NZS7_?G&)77KgLK-mCwT37?gNjXdmn=^
z+ThCzMx}&>M<l^Cn&R^dq|X_xG9v0A9dtlp`z*jO?50&0M%d-Xyo$B6qh2)KTlGc7
z(`|MsBP}Prji`-hY&X7uIX4b5m}IQXx;PcUXr2>6Zwy(<_VEiWLVYi`tpYG2Fr5eU
z=?H|nIMkG4$7qQdoNg=AMqwO&q<k`iaGU})p9)E43~~v{-xQcK9_14kq@>w_KMW?o
zgdlz5F~}dm7Dh9I0wp^9neUBA{h<S1xmfabiv5ORW+-(tZYii;WU=0SW;Dc2QB(lE
zim{39uL^h+G_%%2a41#zDpSQ=ELT~Ucsuz^lZx~Lk-6j&h0m=GDR&J^6+WewD|{9$
zS@<lmY~fR4>5@G!%P9Di91+>Yf`ts9oZG^yEok_xvZ&#cv#{A=%)ZHA<m~lUKTyjz
z2Q0s7zr$X2sr?`<9kcK(^2TIHiUJUUxN7|Mc7}#v&u&846TU&&Fjv^YkbTR#Tet}y
z`yOyleH)EC4kozhdA(p1%&xU63pXD2oyQ0^dZY|}=${9tF^K)hm$@-X=r=Q)5X8dN
z$!NXfx&<xgeDU2V(yVqU!A}`+IU1?%P%6U8>=NN5D6HU9F0^j5QtMAEKa=<qM2!3}
z5M_kZ3fzTH369~=5!2W~(BvHDY5@|>r>CU%-Q>jLZ18{5kS(S}aPYXoW4-(n2$$XP
zAT&vd{0mRK$=rhKd9SOYBjnthgP-<Nr=wv6nyeCd7nPrEyzWPg2%rahm%$sMMiS&(
zx^IC5{D=#Tgeqw%C1(Z!CDJVQCP*jflb<aG=$adH*2#@3z}E*azp87gnll*gR~br8
z%*%F?GLvwYP=~a%wNWT9K|K1jtU{rpxJU~rv;r53D!@((KN{zMOHsy^1j-MH4=Aok
zol=ys;9PX_wFtp_-q7dAqRy#On191rl_n+mWf4{4sK4ycD`=7%`C`J{0a%;N)DReu
z2M{+k+>wVJxx}nn{uM~RMtRBCD5Oz3qwkA6t|U+H6kl3`3GP^pJgV5sr43J0j$Dqa
zlDVbeEOlk`II>@*AZlDG9B(`ES2`ZVvo&@sy1gpym}316U>U?y6c&f`sPB^^uJD5O
z289ZpaDmUd_7fm6cME5|<crliJ#n$(KH6DW!^!9xSLt9#SDdiPBrrBW5D?o2(AK=)
z2UT-8A6Wp8`Z3*QG2Zj`tar?04aCm;m{en)TJe%{1zFpqVEXyZ^uJPP9E&jKJ?6eV
z?T-TV8A-lY;gcY50-zO|N9>s2454k0VpE$>$fW2Gwm48y4-({4VDzv2z7CeyvXJ9U
z(reC)rTvMk0p1^lv7Rr9k~zks@G`Ui7hxu2(^4#s8ih}%xev3&EOhfj7UHugY#||*
zAG(l}ig?Vr<HY>2S|CAJ$<>enTMb&sbIj)Za#PRHFga!w8`1{e%u}Igw_1&M77TnA
z#R4>&O46^dsXfdB-|jS<^-iNx@3vY_+sSJ=cWWI#sbaGmwz0xTPH{%XN^F2_=PH^Q
zJF%azm>~rvfW#DnsnE6&uaPCNj-U9+Sz5*i4Wxh54Bi-$aih?}Ih{kX$_sDuc*ceS
zEESKd{$r5NY!u=e!u^~U)P9{7eU?MWMNJ&~<8bDiZ5UL~Z$vDe{#D<nq~Z3GcD~`A
zaDfra)NjSrGHw+lJL40!=<rVC4z|cV@)u19U7Y_JRswH)=M>Pz`JY>Dr_<5%Kf86;
zX@AN8{1DG0aZJWjouC>s3ed@E7WK!|CmW=&#=$s%ec$$1+&V~1@dB1|FY@<a3R?>o
zY83I-Lzmntz7tK0BbE_Nzu*kSay%UcGX~{qC(Jt?gXVM^i}ND0Ob^TSuuLy0!#lxu
z-$4QRH|@!}HA;MAmZ*s$kJu3&<c|4)`4;PQd_cDUzOA+afAenOm%M(k%r}`b*b^vW
z34u|W266@CF-$p+&bT$#2RdAy`u$)S_ybJjxeayShBM)8Mu+=DP%TME8-yT*$*xBE
zZ9;ih`!Rs<I7w9q4aBgN!LZKo%7n=2$cI`R&A0y542Lop$dNP$A{gLEjB!69Mgf;d
z`NwY|D0TeiU=_+#;r$7#ar9+o7wBJj5%4}mQg7&1#Am0`K)1HUe|ao2?To!EXo$Nn
z16tVa+(*2G3&E2*tFdmkiyfT#8(ZimLD4smGKxA2jr?+m9;9j3PIlZMnF?_7r*Y;#
z!3FIr5eWh6)o9;D?gR)Z%$$i2vV_(ZjlBFW6%rUQIt>V+(|lTsLP&4;4TysO<joM?
z6cvWwurT~13zPcik5K>PXE9Y?s8;1IC$YV02Op=U_*X?~tWq;4N^#_RJ$|=1&Jz4y
z#cmJ~;sPXB91JpUDdA8K2@KT~*fxyD6e>NrQzl$q4soGM2T*TDqxMk%yDnfjQSv63
z`N+2vq~D(;RF~T=p~0s4u&TU*aSH?I9}*h4d@}H_Fr%V!d`HLOrev(jI#ufYgnef@
z*IG~$06xK-M%ME%c>;xK7{Sl83XD25m@5E=C01{j+_HZ>Vn3tLPY(|hr$oa+!t9Jj
zuOCjYrPHaH#-f33Xb!Oi-itu|2x$5Cv%-s3Kp@KZv;qAE^QxkQ4(=6D90Zu?YJ#UL
zvUQSuVkEKT(4Y0s^+PFYWqd6vY~tbIm^orW^A;6!MZwepp<fh4mGYO@dvBA9CmLID
zUcoXP#-#Zg`#NXao^lY?t>c}}8y)EEnV7Anlh#bI$l9YgmG@u9!hx(G@p&`4H8?yN
zkg2hloCfv-H@8Xxl3AsZTcshYWOBjUrU-%yKU}(5B$xF?Rb2eh(5jT86}N{0&4V~y
z5xkgP`lFG~jiwoD-Q2l|bg3y&E)?9%bVB2c6aWJJ;p9zk4n_VHx0iTTiS~^|XsN&$
z_9slm`#M2gd3`1FL2{B<3>>YR?WJaT)C|9viyRHUdc&I((kcfn5|nRtNmhik@ht&*
zP6m*Cdm1hmxafjv{tc^dcWujp$sz)%7QlZ+%u@YLUn}y`OB6J8ZEfhQ>~G3-z$-M$
zBw`eqM9Ji;SU;~wjmr_GWPFkNk-FWMN=jP5Bb(nwdUsGr(1=S<fFa4Yq?;Cq{PI&~
zF<m_PNe;=!-#$+AyMAUI@$LF};@g$ELSI}Ju2_!B|MS^W`F~iewKh7-#@0jWcD-Im
z>$eAQempup+}nLqUZiOnOQn)s?3G6IwTtXg_ueo2N5@ANHEiWIHVeqVh%(6M(f(Ul
zv{zZF9A(Bhxif~gl)(fxF&VdMvYY&d+o4=1d0tcQM}Moe49~&ayU$L-zsfrTXzn;Y
zjn>w)KDPe~>*Mj^{+pFp&ZMzZtFs~dnETyb@V&9%dvn3}R`xsLW-!6G*ip`$wTlLJ
zbAzzmK;sxPt*QLpN`B9q%wy;QMgx113nGfBQuNg~D|w4z{;K$heUDBrm{5<dkOUNQ
zpIFIb!@wU6WZ2O3nrQ5smutcyFB@C!cB-XeJjHj2CclBBG2{v|K#2WSCw)?#g?L4a
zBdn&<<|CH<O`QC%uy`y#M(Nb%V#8QBpaq!cwC+$O4Yc73tWK7eSJmGNmmHWJ^;$j4
znM6H<Is4@4aU)2sl)xs~1<VNCFxtQpih@$*gy-NZ0`2wwoBd-Mf>D~HCLzBYP4@Xw
zFb)jW5`7Y`!?_8%ZHyYZ<0CLk+euW#k5<kxODBq9or4I1JKKP%1*Y|hHccCCI2*n=
zc>ng8U53#GT}4b50|kprTp0TrC7N>TCp>11bwCdHe!647{zs$huc7l&T_;Ayp3mkn
zET8BYKI4ZMD26W2!;ut5rtxg##WOV6R%#XP{cp;_GQa8ISo9<%A!dehRoQe(K;zyB
zzl$aB1<JMr)AMUnTKVLTLt41#Ub!hZ{4xR~fsJ@xzqNIn!C#{IK|790dz4V3vAdoL
zdZ<DRlZ^(rZr|A?>?LCd@GGnzK~nhXS%j6z?0OgW1{4x4<TBuiB_@&NIRC0Yn#TdZ
zWqanwCTj(-Fy7Q_4hTN05ewC#rptdc-OLD-HitD=uWHzFX5mb`stOpW+cncfic7%9
zV49Vp{6J<v4cMh-QjJb1Vd=#<xA_ZhW>B*dD{T>nm#=Dsk7Wrgs{JHgX94*7iQbsi
zpjr%!-k@ye<W8+VLAH7V3?$^@vel9Go)Ft*8c5dfY%L(HCDQwtS3t|_t?K!c-w@Db
zJq<l6Z!umQ<fI6dYRZ&gyDybY^*sNZbx9JtMP5TJ9gN#MQZou_Q<l>fQ|4n^c*V4?
z%6@KbsM~fXZvnR6DC}S039bUO3U5ZxX#h(=V~52q>3mj52{MGmx<9fK%kPKi)UrIy
zCZV92O1wM*YJ{tEddYg3`2K64_;Z8WUO=bk7;F$-FfB)>K-NtbVut!&f8e-{rcQ~0
zbdVnSuyczrdRo?1dLX)c{`%m>kIbcDXZpy+4OYefS$jw5?7ibSVDlK3tt@$C*GgC$
zL9w{n`4SXGikTE$JHe2#>?FfA?hhlG$}MF`hTa6|r4;$o(Y29qo7`lw`>EK;pzW}B
zyKS?~(3cJyy6mHxrtcS2DEPNKkC3Ac55SR9YlyB}u4(B3@+E_SOCks+bgbz4L%x&r
z*)X`;V!U5A2nOivi=iyIyyUUBE<JR#iauggmFr3WJPIe_JeDN90Z44}u0nu6<Fxsj
z)GFl$rgw?a%Xq(Lh|w~X$qdgzW>y*4dMqA0c@l^#g&Hqt3Y^-&nuUn7P9b6$lCRn8
zckhpW_$v*KK*-4`;F(d&RQ+=dqpC@e>xWqXC*(tl^qa!Y9?hRgHV?F1{1J<;EB^l{
zU358SU#CPRxPu9KpUpr=ioJgJ_~4Hv?VI<nkN541HCcqiiC^$_b{Q6ZJ&$~~_TDdh
zFCKi*5;V%xa`ak&o^_m263}IMdSTH6LYPceKcDoAP>1NWv#wDEZApd2os)9Ss(Qth
z4i|33t!5%Li>JkGk*|SPz~9QAT4~jCR;*JQYt~aTbL<z44AyasI<7u0kJt~s&`@Bm
zdF1I9vc8D7MgGrm5YPNc-}C^b3uf^9yg!?ZAfb=AbDRtxmx<3c2rnnt{3kyOjj){x
ze<XgurPw2}mFcv;V)cIjJg>PKLxVgiXSd8s_gZY!%1zwtd1Y8*(c*cfy?VrU$-y<8
zpPi>PAg_H2F){?97<q%>3M8D5*ZBwJ2g_w%0&VuV>%$=E&)AvIIf?F?3D{Kjqn2yf
zat+f>ov`od!lrH)R<6?Gt%J+lk(;4TPa})QIZro1C~c6pKB>rP8@=X7D->L|pN4Q#
zm<X>IdlO$!Nok0JV~~#^*=mEc^O-GlAg#^ZqWX+qmZ05-H;O~0F;K$s7B=0(mEQf_
ztgkb1%K89QFjFG=E|}=mD~*yrL-XE5MED?rCIAN$c^@J<@`P3>-Y(7nH5}ig%nb#+
zZqV~*NZw0NflkhW52N^eJ{)2YBhC0)Y*bZo%gQ>_!k03;8HA|>jr8e(7pV#BOVXWs
zNPpmEyz7A>i206^jOBQ?#u+M!0cFPNdWoktqL2gYHxb?&Wv5T|iv1gv_%_GCKI?Ol
zC#N%*XHq1XNM{}NH7$rE3-Zr!fu+-u@KV2tAY6wOI}{c>hpA#I$Innyj<6jl7rOQE
zyA&Uc%Pmy_S5<U;lBtJXFJDU-#w;ge91gl8k*PK7k4{BR>$MPh{GHbZF$iw}q*66$
z&c-MF+U(}$Ci{8!@a_KFR}6ozF?|@>IEcx<`%Ly)qkgmZV|jbES}pIBlyi?cgpXHf
z;`qgDte@buTpL3#7)dY^{O~0PJ>Y_K6rRPzT?2mxAL7a~?4KUfok@=m`h@KTaXk0g
zqgK7%RtJMGvJ>(R;eH~1a;e1B_2{Cja4Le0LaW``>B28{%EKxY#Bz0-RL8X_i}`h0
zR7ZI1H@-43INE))_x=9f>z7O6;jV&+o5jRgh>4p;#mS&zdOfA5qB&%2;SIK%8x0<G
zeNu>v?ob+%;=9E2R!#g}1^~A#1kMr=*q9kMl)Oifcm4oicrpoV@_1w;tK42Gf76EW
zia9mMW&x!SwsR_LS=VSJbK=3bz3G-Wula@hOb2(GX#K=4^ZnOsq$x$0Rd@7@QG008
zm)^RUBq`YsREm~jFSpg{G@6ZWqq)<~aWjA((U5(K>!Ht`?#bXa^Tremyq82LAI_6~
zpw`KzVX4n?jl7aRktKkVZjx$Ihg>GHCp(1{e^l)%L7p|@kGnu{*E<7CTocIpvU1vJ
zCmw}Y3EJ(&t$mBP7s|B<1sAvXKdjkomTa$HFV$Y%a-d^tuespr1a~Mzqlw?2^SHdQ
zlZmsl(c+d1wT8i&P_^+}4NU^Iv3FIIu8B&-vSl^+JT5D6H?-YC5g3B5QRr@%brS73
z_uGEky<L`;^+GZ6KRhhPI57MV?=*f3hR<Es@a6Ei8B8~amTM+uIG=H9;;GkPilQay
z>D&iBd9n^EbN*cPwBEYSA#oxRidXfOUAb4IlUqoqg?`^lP>HWZITN}r@OD&Z_a*DP
z>YS(OHF`(~BbozU(~bf(R^M<_IR!+y_TyVioCj6o`i@Tx^tGNw;nX`r7whCsxJs!%
zU~zNnwk3ymS8kTeYY>vPdh;_j3cZ0B4s$zSPmlLAXmqXVJMz*F2KO;)^2knJ_e<i^
z<WUQ~eU}(mLcn$};$L`F|3~us=Q#`i2X7{=bHJ8b^8P&ITcA2D9(vRq#75;aWrDTs
zGahL8iy^wtrS*S=nESJe=PwifUMD=!_+IDx198b0iLg3Ds5XtyX7$h6l<Zgyg;^4I
z>!10g?>gnim|+UMU{JBmVjQIxhkLund#1~c#Szk^CC-y<q^lzLp%i}Z#*lx3`e^T1
ztT{YQfrwz*XZtS=$au*FwhC;sYW2!$K*2_&b|&JA4r;<RMYLE5CEA_%AKaH$BpJ;B
zYYe|iz4T(biIG!tD*CPTk^@4%5u(~Hzx^d3+gyl8IH3$x6k{B36kPb)+%=(<N3S(U
zhZI3LWmO#tw3@_osE>`_MMA;ks?B4+77co}DVD};DwELQ^gV^G<vr}kzl>n+@u-ly
z2jANz)PpcS@2GbsKvD$;-VORbjGimsShP^gtZ^P5l_Z*Q$s_MdzMU_grFA8eNj4md
zV`T0y!?C#QpuT2;{zW~E!yZ1Xk+I#My@NQbxs|fofw5$~Iy`v)j{UIr`ki{sguG4X
zlO#G2KlhC7;(|AE?vJMI>gp=@s%mBP{p4bT-n{X=*AK^IR53A(Bjw#m{WN84ws^CW
z-fR7f#?=2aJ%#cAG4s`(qyI08|KF+C-G(0j-|4g)^)K=NAL6k}6&!a{ru+aa!_yyd
zRjsijR8A-_8qex!+{aOJ`CvgRr#R)?@~-UM<|SRhf|$DN^wj$p27}XnI2r}$5E!4H
zQuuKYf#`f#XFJRrP0ziPO!bf6Xw~ZEWv?Z1kr+Lx0#x>NE*ueCW?GDu9ZcqWS`*zb
zIAZ5I<*Jli7I4VmWx%2rN?WA}EwK8WlPk8Yb0YP;9Ziwg7ZJD85vD|MeiF#*Q!vE_
z|2-QcB~1w@%A}pC3JXPQ7s+5bYaoJRbCx}ntE!2HlgKrcI-n|dbmsPxC`fcmL&#8#
z`ic2Qxd(KcffAPOQ@k?4ZZg5LmB{fHz(zStoB>BGrG;}>(N;7dC4jpEZC-lviX4fX
z8;`;^_9(-1pEY21D;dkRuj;hu)M0-uCI(hAZ>NS)a28Cw(JAH?;87<fjvtcEIBGxG
z8STOaL^UdW!nAu>%I4i(UUhp>S!jICr%EOZxyhN7&0G{uokjUo-5)R=I`_QINqcU~
zXP&Tk(xsBn+!TFctTN(Hv8GtFP9^*Uyp5y7uh#MQvzHLkzJ*{gbD(SB+7fRijGs_6
zC;gTH!JI^8hqIdHpUmDy9T$>8hkHlw8hQdkP*X=CYh-4qjb5xl%}{5`%@~6Y+Vu@H
zUb<OI^VD>JR7!T_Vo>g>f9I=oEF^W@9GdcU@t~sD(J_bTkr|{rMuX596zXyvDIBwJ
zsF&}Oyema1fwf+spe%<RnL5NI9X?`j@b-L+x3(^Q+5!)Fg?Rw*$y_pe+zF9PW-^CW
z4v02IH$6cu5G#Yoy964pL@$sX)DKVAR+f01^*fQTT&D%JO!`mpuP<0yl0Nd*kv=)U
z3@{n(jZcw&+iVCwI}C3$?J!K^(It78yW%+Nz1IA-tXwZno&5&Oo=To#YUiv1>t6Rb
z*_T@T@F}(asWPK@4dhdaH%jqZ`~0?z@5R?_6owb`>B6-TE17E@XC8{zi6Rhaf|{jR
zH!MpXbu1Ji-XiEipxPQsm;v|C{$pqrts!x&#G1uyQn9@Ai)!o^5Ln!C)^1c9%|Q)?
zDUb~0Jcb*AXzcN8tQe<-T*mpG&2zjw?M1%P(lDGy3P6-B3e$<k+a?O{c8`Bx&NKEt
zMi2WlkNXTGCuWK|8|+1Ti8h!e(F`Mh>QmMp{aUPa5JY!DzV2;jI68NYs=0=mTC`HR
z^(7j{@Zsf~#?l5INE~t$f8Ia-;iui#@Ar<D!py1)EP|xDERrkr;@0b~Iq=6Quf(n4
z`6QrZS-99m0dQlMjR!;aE$eOpz-;V$z#sK(w7599yXkqoU=+-*mqW$Q3L}_x<XHKk
ze;%C1fKB8JshCjA0L|4{ICIN9$)()$M`%dI;L`A2id_<s+c}~JR<@6r-N+K=JcU_W
zX2rI?nur?z+K6JBku?nsbPU}jV9jC?`C@AN1M`+LJUG*Pp~k%GR9zr$z4?_HN?U}H
z=GUU*Y}|bw=HRBPl=)lE)n~pJNy}M`8Dtv~hy6;)e}iRN#-7c#E5Xd?GP`=NKBb3R
zKI)pn$(CbPk<V@BZSI|$5(pJzL4e#p{Py7!TRQ51Z}|8`IKem})}}30I7lbCsf{Vp
z#6K2*WZRWmSk<~}y3g1&jDvK=WKTdk{*Eay{B!SP5Jnq(m54BLWQ+?Wru{XV;!+sa
zdMzy{8QP$*UD{CgVAL$#MF9k|j8VnPc_9Sy*1$!@X>fSqg2DYN(@dGgv>Zl-({~Bo
zp%iiwqhg6oOwxG9cH;{W(&G>lf5wWKj#Kqb-eCkhO^Llf;c-PUVXQ@k<ncxZb5Pm)
zGGe$~uZ)(+Re}UPZ9ge4h*;GVpypG#=;=&rKxM<UDKNE#Ng4RVU=mRFS?T<MY;H6o
zC{UuqpZSiPHd3^fNllw;x$L(&eCR_DXGt<u<dNRoOad`a;<1Qqt7d)&eah|7=I`Do
zTs0#nIJAHGWRVLmHL{6Iu5C^`t7uu4b`rfSGcDASfp#@%Lx9?sgkmKO8nT3vzqMiL
zu0a{&EwSYkGJHxYWjO^$Bh|t$A47u^ql}6id&)WH)^6{G_D%uSQ*l5r^hR-ZAeYep
z@F}4KQn6L_KneRDrigq@m2mDaR0{DaQmp1#`l*jRtl<NxpVydAmY3;mkxGfrD#A=Y
zOK6w)<PhS%DUi=k%PXe%te~9YW0^p+C};f3sMea`u9j(eg}u7cQPKXJk50yDVUGcD
zrxTmheyuqRJckBLxC-=wvoekXPTg((S$qWqO84w3APJZ6C!oPm%1c1hNPGl{>J~SF
zo*Y}<NnpZX(xE`1qd<CeAbOO%q_EPfz2oHELw8Lu&*c3mvYp9a=tq{RXT_$eolwj#
z)vICyV}A*=wdRsx9Zd;C#b^W8SZf>Euv*z%J+^t8_0=t=m>i|m=q35fPOX%;G+L!h
zxqwn?eT7a+{fD5Ed7hT>_V}n0D)H0!Xc^bjQ^#%a|DT?o6xES9=F|}IM;|5lH@6h^
z-4L_5VVzG0bZUdKN_qCZG0etdBuG}KhgP{Wq@Ig|>86B%r9rkhItu1=q9Wx;34>p*
z@6*#^2#aJy6cl}&l)+Tt?P5GreiY5Sdi(k`paNxvegTFlhZNywRHVS2cG48qv36F#
zj&(Vh6e(ID&4UbQnDp&0uoy&VVtF11JosuYN0xK!Cs%p1N=va=JOL%JP-6j5V$EI|
zCN=E6P~1g`=W+tVGIAy!>M&62<*`diZd(iz<g6meMs91t6^Ok8Gz$p5K&ob#eRU$g
zLFsGpbGJLxpO1B!CBp_f6hBhGjKfcvwY6(g?P${iNFL+T-X=P;dMk=!c`gw(E;ZMB
zY=uv8R#K7H<$je{)=DM&M}!W~_>D5^#>AxF&E{<t>q+t){AeXfp5{}UAW{*&Gda`+
zVm-u2HcX31QKaaQ&cKuJE~WE~kvN0Uk0&!~&X}X8r_ENI|G!|>85an~Wty<diJS(q
zY8BV3nDK7`5&2X^FB)BJVbk=D9BeRDv~EVyVjWfZjNYtp;c%war4e!XKgkW@3_L|s
zp1UpU>K;IIM=>C&&rK^A)^F5H)ppm{vga@axWN&~+7z-rDNlP2>S5wb0d2Da@XZAk
zgk6OwsP81q`1b~b<n9{;>GMR(od};JZXSf}syzAZi2mc=uSdE3E{uMF2oWfA#lhyd
ztnP76Y+c#L*XYQwlGwUQHyC;+KkdHG$7j8BwU{wZlao{|XQBd_QuVYGD;jxoVO@N`
z4isb;C#Df#_x0-%oF)7g7x0!oAURzXbC&3+khfHl>7C&9SdXrdkgZvqge<YJ>wAz%
zh_>T0yGEnr-K`5cAO#!c(gpL43;cLa(^%JLJy40X0E-gE@{9)@14YR!+PCxEPN3%S
ze{M4zR8wLldJH#?BfktU$uNqEC6~YC`l>j$@}Soqb6G#{Rzp3Zhp2JI6vonux@J)i
znjLDJJ<Z=(k^nu&El5)nJ-?4RKE!1Kk+zX1uK}fxWB?Cw;oB7FwNRjuMXLv;2h7i*
z1CdPZsnttCI+A<8>>nK;-M3ZHyeC=2&6%?0rAVo{r=P==fW#ur@brVv81n!mxeJ+`
ze*A!Sr%^Z#>3Th#qp+!Wjo}6U{WfFbP!Pv_V;{sWk~?uDo7COriN;zOt03(C=Jzvq
zD?x2b4pR*C!2a78htGetZvipuQ4jr@45K&a<8y2wC7C=S!c(i>HUCPGy9ue>@?A?S
z$Rd$q2>97}YJQZXrhYQUSAeWF!`zZf1(eM#DH>KlSkSCeGNl@${}s|sl1p6C7%&_G
z(R(n9{n2o#b>2#l#{CeaxLF%PT8#czjv(?xdc+Ts=?D@{j)fBr;d1JAvw#Y=`q|`t
zlaUti0zX2fpvg9rFmMiQxV>POU1jZ%cbralr`>gSnuQoxiWOtx<YMBam?W*XlpgGZ
zWn#uhM|q1qk%QJBh;v#aAA6;Yq(h_GXmvY{okn|yDZg9kfT@vUoplv@#8a;iYub~M
zKb&n85(1V8R$-1)$s<9wKx%=`V2_2JTj>ZI<yTQ#hYIkg89ORp*oak4gp0x0R+RD>
zli1CCXa@trNC@nLqD%`MBxT8V?l2CNWU$0QI1Vcw2(7@Eflvm5uIc(S)MQW^3`gN*
z#scjdihy)WViQ*Dx^AP<aqBSQTFp+U)!eb>0ZDWfQH@7Ox71dWjbw<PRIXEk7heZ5
z(Z3`fR`u)q*9W^fX81ekV9*_Cii#q(-Aa{;ZL3Hw0OSERvT!~bd{4le$QUatAe5s$
z=uKo5lv35yp0#y*nSNCbMkPN}{#!g0YgO>d(zo#k(RZnSt@Ld(`ri_CeLy{NDfVXn
zOsdnfJdbkq5*Uqs=9A<P)H7|^I~LUQ(OpRawd4I+XrWe$sH*5Pw7Hvl%Bl1j>8K`c
z%IZftW!9!7ZBn}{>PKnia;niXgYhtm>X*^T9Syp5gudGNMFf<o&HQK#3(X93)$-ef
z<6tlt*~INR8v^nFc~!5wi|CI<EkS!%CZ2}8;jeXkNZBDC&g)tNEAO~zXE7(zvlt3#
zG3*w)7cXd5I2_xWy)Un03u*7sJ=?@zIUq8LTGnH`ut}Yug-+Z&xpYDg;Mq}lhQU;1
z%SpEEyt<&%J%hIMKED>tiI_OgG*I&@9q~YzX{Ch@>1$vDZ4*XkN=un?GwfT=1>G2=
zvR>$Q;~+#L(+{HwP!2CgXEyTO4?rVZW(&Sk-(lHz9m~5Nt)ZJ+R)?**lGHXkWj=D(
zfNY#d!>f>Aurp!}nf`XxLRbK(=`eG8e9XE6!Y9{0aMZN5Lc=y>mf}g=1Of&#j$m)M
zxn*2greX52KFHXeJngdOWFMh#FZn0g7CG91eR<aUFz*YQAK=mA+n=9(A@lt_a&_q$
z0d14`DlJEg_aFlIkrbSN`h*hqk%IyIr~>!PFyr<m*GVaDIlofMf5mI1@=__iv1vd;
zE9agzq_1U)q_<g#Np7+wgiY5oBk$q!h`k`oU*>}?{|=7@ke7i+K3IvbS08wMk)J5~
zU~X9v$#7v=RpM0Tf|z?{UKV}Ai*DqVwFY?j$&Z3z_U3c0D<OHm6h@tp_p;L?=!|zr
z3Q=JbqFdrQ-mknsoBH5nn^MrUv9bGwjWgW=KVmqU1y}gXa=I*EmfJbT%W%Bxp$ymK
zlZUt!v!mc_;t%#GGZczTU|6!=ABSm)VV2!3Gt@<0TH7m0sO+>z5aFj_3JG(IW+TI>
zl(duZUsrG{$fkLZ;+X$|wv=;qqf+}$2{4ev9DuDoZ1H0w5Jhq93z=x3QJn0%I4PdR
zGgNCxiE`1-k8#1<I#>KjwOLRwC+xdGAiVG>OeiFS^ZLKDn}mS3Ipgq%9RuBm;b;_I
zQUos?3OwDX<X=4?{FUFI<9TK<#Q5BUaPoM@=CRKJ#533{54QNl^`U6)lE-1=@xZQj
z+NbR%yy%|?=qxag{4I3R^`L=gyn?9aY$Ofh_%X6`ViVIafSF7w-+5%BEuPkFIz^9q
zr2bAFw$$i43$kZhH0N%x0}KjBUE`-~o<1oFP(}@kIJyZ8+ipW<XQMP+Q{YbE9W6dM
z8SnuoJa-y|b09516o-g+d=X4VQ`irZatqzB`@W<K5f$GPW|2ReUBf@YgrDD23_GMH
z=DVMXmOO@DqXCbBJdMJ$$Q!e8J|lzI>>Mh_fXs!D(0B3K-sV`L0r79uXU{%Lvi|+=
zhEaKw56>pXsq*_E%aAZNPY<@kCn`m*)otowB&os&E2S5Yr}rd?V_3Z&xjW7FM(OF4
zb^hRui^;<Oz=7iYjlbRI&W!vP>f4<TZ^2!qdab_gNC3KdQ_Es|35T$zM?pA`lj&;l
zKfhQ~tT}c0l&mNNl3S{sbEob9+JASt|MvKF=Q(rSPX2eN{T!rfr(IB_;XY@s)9f^N
z8trC5xpwn;p|vnmVgJpW(>MEXSpoP|WcL@q!CvO*`0%t2C>XxmSFE8WHZf{AO-qd(
zr(0A9sgSADZnYY%jK6$(?cqZIHkgm6_?iB_P$C9C;-M&ezE~YmV$DJk6>NqXH;xYu
z_m<=;*IqvMCcz9A{u)A26W;M4uawdt1!j2d;^KnUSryCaDC#)sh>VkD5Ge0>+&CWl
z56?=Ig4W2Q7inD43x#xg*(9M~RbzpZVjd7fLzP9uPow@4-2wkty3-k`xI=7Vi4KAJ
zEFIdpFQ-RrLMwVIZ?b~?(xpXKIONEJMN>aJ(=8KwIbn-e1qB1sG|JT>?QDMS$Ax^3
z#2tBkzx0&;G8ewgg|*IwFF85?rJln4pR}A~QrB>Dmo%Wo`9JIRMysvo|8yOv^(Fu3
zgFF<$d*b_;4U22_bd)QC-xC956@O3-lcnV=zE`CM^PERg=gUiKPq;kyCzz!Mwx#hU
zIw4?~I_~|j{Z(pgrjB_BH@9EuZ=MJMHduwSnN`g1qhNC34|ownIExyrdGbZHWuC?J
zzj5abz{T_5skd9MG5_mz*Zng8AL7yT|8h;3k^s|$7PF39CD30w3I<v%=}JaIpiQ^J
zoVGAzNd1_r*Lzo(9U;(sNYD=Carx1kpP8;h<7=Mtt=VmK+V!T}+Hu*<^NUw*_|NJ7
zi<9QBzy7D!?f+-<)zAOsjb43d&VtE5oR{w9`O(FTgP;HJ_?LeiegDg=>!Y36AM}UA
z#_<2_|M%?d-HR9h@!xOf&VRPUld=EiKVDyiC$rPv4zI&+u8#iG2@iTNe;xea>GZ$m
zKeylg$MDGQ?ELB-Tzwn2M;`~@kKXj&)ju5dF82TX$LOCwJpW}j|K8jE@A1p4XV;&O
zn%;-_A_(67e181R<n3^G_^tPUej4^i{rTm~Xz2eV_-X#*;O)of-HYDv_wQyu{`>5Q
z5C7cz`19{aC%yk0x(6?2znwk%_sRR?%fWBc{`>LC^|R?&>vy;Ld*}7&#lhwO+52zB
zV8jhRBXv_Tox>hxlqQ7~B&?s5DCFd6!VwcCM_LlyY}>ijoNP7e(y#8o4t37>eIE2L
zsPLmkquDT7M4ADygz|Dk=!ssMO5QNzQ={u<h$22^H2juRZ=F;+-LC3MJyLkI=42~5
zb*BlHRPSB{A)H!ZUeHw2X?9O4J1xB_8Sj<X6X7ZV<81wI*X^8C9KCwvP0oB-yRHVJ
zj@T5d{{s`B%pT(oIGmrIOFOa<7`UR(&~oIBf{)2fxOWF{U*(<BKqVYj8qAtUc4rt;
zn+;P>`)oUFDL8Gx!r@dNhTu_NJL^|Rj(4Xqo%Wsbyg@vVL93=zbm}L1RdTFNzq|QK
z4#;VC<TI@`GlyDk8i1s>Ig&<m0AFzjI^vfBn(nJWoottN^g8D=grbQ<_t}#?2Ma|D
z3c0)`=mjqnW<ED~8+o6bIp>gxXFN?7>fJJkc8IcXS_NJ+A!P(wG<NbS&k|}Mmvmsm
z=dAstw@iiz-ikMbsbz1(`Zg6EL`B|6HNhH5xPXFrhZdwg#G~*sdk7>AYkK0OXJX@#
z>=*C|tLLHEpIn$Uq*!#%o_YQLJo0AfIzmUMTGBg7w#*kD0jobsTE5UL#awpP0U6mm
zW^AXt?t-k})KNLt7raBfSWuXfOg@VkmA9_Q(pIa{UQbg^x7+NtJ8pMP?KwNmX1mjD
z);o<(z1wOzZRaj6*UDjy4{;_{!ehN!{Z{ZMy{g-1;nFZHBG-cfQl8E$gJgXxFENZ5
zwU;B?q<U*Fv&cCm$+R^hzZCqFjk3r+V#kq(t|UH5t4lA+y7?&6-syJv#Q%;j4N2~g
zJlgX-I6`9vTmpGzCsC>4Rnfp1SZOU8&6FI0{1u?2q)%jgoT`NIr-_A4G`j`r9zIKp
zWO21ZlSZ}$-X^;7%EUt1EpG0VaHm}?<Q2Y;KIWEEI6tS<qKOWS(hnznyn0Rp2<@EU
zL@4NTw5ZGbnt&@0%%5sz@t^l~ER$#dyYzzDoeh8DSz!NfxD7|Q|2ge;yY<EX_YhAU
z&Z9neHH)7Lr?{v6QGjFr)mOT8kgN6;WDS@vv&%5LsNhO&6q6H&w%8+dn)?ug7_2jB
z7FL22{p0C*NY)lAfxnyI$xTmu$KNyGgF*5+7^Gjv9$6dcQ_abA&Oa-?Lm9n$Q6lXh
zN^k&F(}q8rPdOy2z^HP>>1Q}(RkgRO(r{7%iFyhG4Ysh8K|ua*tvYJ$h7|e`1D>J*
z+#j6+?Pv3t`;yJ4ir}#A9q}GJs~q|~M=f@Ou8K5#{$RV3kva;ZKkx1zv-mumj|L31
zok@5(@&{)=bC@^a0MlLD={34dpos`oFO4K(K*-%X3>B{{`GthGnrvkG4~g@gEJ4ib
z04-r<$4$9&YbnbI>x=_N#TpAJKyj}WD!2v}(En)x9ZJIPa<c>bCV{;)P}!k@g^%MJ
z#H=?8`xm};)tJ0EFVLP>JKBGBbbRnmFfvZE&to7RIgrY(K?nQA!P{dS*b7_CB`+$m
zcxr+E%t*8tL%VW$!lvknEPQl#U;Ie!HR#|R8^L6jBkg!Tng!*lr@=xyeRdfI$`u@0
z5TRI!#70l^3H5bvBXIl03*~{HJpHd1%;*ZrI&{DV=f53z4E?Xuaywu2zlV6N8XgRO
zIE}e(m&(HD`^Vq!@4bG>xUrpKiX}AFVm_3f7YBXIDGuJNNM6x?n396T)^HZ$6KtR)
z_wjofw8h(@<EgqW*!RMEPTg6e+L@?!VgsBDC=7#vz+lVTdXdm*KKUc4G)HXRR%=Nj
z%{h^lq3xNdwtz?g3t8l?G<x(+Fu3}TvYo9)lN?+g)mgi>u#m&r?S+M0rrk{7kzi5;
zcb~toqedgmWYF1rK+vg|A1e_=QdV4MnDeVzhTCyqz@41I?w@<X1TBA{7L$529pP<*
z@fg#meNNO_4(9~v1!6!3hXuvVo30<-CGgcC(UEmqo#jQqqh<K1u=8cameDyyz(h@w
zw8?ytlO2!Pn|&U`0f78rqmk*mcGuBB!H@r$;i60>;-2P3u%>wttT+<EI_5>N;=Bl!
zpBI0IS@Gawk?DJdSz(NY+o4MxHOJkdANJ8mAm9<w$rp}?2T=zl&nv3XDT)B&UQVjV
zO1pXTwR3B6kpjM8nrBO<2zMb9O}d+#RqVoON~DU1u3?u?m)n!Zom=uTo41?d+OoWw
z%_Cq-nrvs=!|HinSL0wJL8?8e5{OUT4Ff7!m{M+50s_zo?pNfSg?-cu8l2l2%#d&F
zT}eo*(Bjt|*cuLoR`wBl5ss&LdF!}8Vjp96h&y-tXt+s>^yj8)8Cek;gqM4QU2nP@
zUn@h+>$)eFx=Fa?73#}mlF<2gwt#<mBg(5-DiqLH>FXP7#KGduY&913mXc;E?9ys0
zV3<~34$HJ&2~0CgkO--I{`gjryZ_(+W62;OpNQF?)OWHdJrNbYW+`$TqP>-?=k~7E
zw=8uMV-WOC!E!-|D_E{d^S>^zwn$7rb{DlH)}5rO1P?<j5V@187@<L)MiaDkI@!Lt
zg)bQv&>pp#n^d!L4nIRW_?cuiU!Xu#a|c4aNaPQm39vc-U#GAa$wD4&LdE1s1{FNx
zx&?kJM#X{*Rm{YY(6BKud3$iYDmIp5gzU;rdft~sJ=5NoMg7a7{$)}BLl*U%m9KcK
znqBXfsGPgV*_O;S52$UQCEB2Dpqbjh&s?@!R23m`NVq2DlDX?$p#(LCM=NSU+9;5Z
zRi?k>#lMM}W}9bLh)K1vs0K(lOvWw?=C6T2AMU=x5bt4>yW%mP)qP7k9Q6FO;Z;^c
z;}+nfhU+@I*&$io)Qd?L+mj=P77rat_SK>#Yr(?1Fq|8AxwrFclq_^fK{^f+XHxQa
zSR~;OaaI6-!ynyl*Yre9qIP4`sLx;?=XO04J1Pe_^dPjmb791h^r+A7$|cb%@Tt;^
z<oQ(@r7XTxYALJtSW-eC;AdFF=8A>S((YLJly%9%r?guZXVM%6q^x_EKH3@Q>y#wq
z1%lox9JDRqOOFy0+o>dm*SZXt38!V@GKY|v`e+$m)PiHqfMh(vVSE~2Px=YKe0cM_
z!!eUyUb45-D9k&_%q8gQ;ekj6Lm>?Wb*D5^py$rxtb7$W*77=6u}vV+le{R{@Thw?
zn|p_cOofS}0tyYAM_|Cy=6K!{=WCm{X)=nGcgU$Y&;J8M`D2oy`}hB7G#XAL<Nwic
zzW9GU#A96&<lvhgATRe`CrL{@bb31*`FO)_oL#i9?B0C*2>puWVg*W6%th-;`J0N$
zWnEj<fAS(PI%5D&wr6P7(UK#Gm#!AdU%YIv)E`dfXG1Wk5voLm;0MnQJU){>Bp(yw
zeuLfMf{FjvPlJEl`}K&2{hWF;kXI8!@8D^D{A+dtKTfak*VAkI`3ZYC_2_4he)hA9
z2&v#$o#LEW)BzsG3!ukw#a1>Gn6u4i0H1|45ENd_$nT*yT+k}ZAg1;6^7+yJf9)9u
zPCbkyAzRe*JQ5#T;8AIrLWTE*aZIb)Rb#UUO>L~GoDLdp0AdoGtLPy57+Dp_U-SC2
z;G<vTCAD~x@YN^8_xLvlx1s#^bavp~UFN6<Waes{+==H^Pf9@HWEJndU-plVk4&Ww
z6-w;{4_{9FOQfQfd^SDrLVze^Q7j7T0FA`k@-^w4QiJusd{`sJJs`ew4<<-}ZB(0|
z!us|!iwy_eA5Ul3G@WiUcnSd|i<}fgm@US!lkb<QoyG8laDHLaVCs*^ImR5CA;u&}
z*O|%0S1v$N=-%2S1PVeu*n~m33hpK@9Cmg6>EfT!KPRu~PyFrO{@YjhZ>m2IM{|ly
zJ}BY?6(=p~@4=6o2o<W5CwT;<kBghaND;Qi&|}J*(PlFt9wMeY+r3ruW(ieCrC<^*
z0Ax_lgDISp(URz?0AZFqEpeCL<Kf=h-8Xx}yK5eMXMUFb#@AU{j0jS2Wd4zUIyqk*
z{*M}%<V-f}O0cMT8))J_5B8GW3Sgsfa^?%Z)BzT(I!?Gbvw;@vCd>W^hw3_|dnRdh
zN&|Bd<|t^(u!^{=fT8l_2ZaC&CM<6!nQ%QDDsO+uA3wfrR)J97xmF}OZ)H%LT&ZL2
z79!=A!Af0Rp~D=^Rv9K$QPT&iBwjf@vj80S#NDthMP-KDBwa$5BG%Q??4|R>Dlr6K
zPQrAEb*UjGlp-oncG&vo2TGztbOj#ZSDGM^5>Wn$gl(hTKxHM01mxgH`)J%NAUb0d
z%965hr~|gKXrh`!rvS71$f3^uF&ufbU_`u<SUxGDD?)mF42ojRE<qmWK)677Xu_Bj
zH~uNB4bt{$HWSUB;8{eAPJFeucu%Zezb#}Gx3Fc`-n6T?y&S#JjulK`+=CgB4DZHa
z@WxqIFs(qiT$!a()Ga~MZ@)!DWES!7SZRu?6(xVwoZRgTmrm@-%jc}F@p#@|#@PJH
zjg4j7SGdE;1H#En`Vl5*P#mi74wxe8IfN(K4!cFVprJ<}y!%yM(#e$1wYmZUrZS3k
z7ep5(<q#YDnUQTdGIv5op)9JF9vBWmy^#Lv>AM7(c>oAbD(1>xoRbXgQ+l&O==1Y_
z5yu?FyT0h7hzRGHQsCX|-4}bpdYUs%uAxRJGCrl8Ymg3Py*8{l+;75-32TZ#E`&E9
z8d<GyK=m=q*YHi4{Rzh3jb#q<Y2XidK%D?DH4J=Y06eq<S&I<T@ECWIBfb?J^olrR
z4HIWwY%M_%t)7Qx{_+hN=vnL8D`_Z{pxlBvh2V?d%S|exEDiB2gcr47GV^g`_wsp3
zL1&pj+89A6-ef-R`BCmX!m|fqkKsVUbdhiX$T+uw;rQWo1}U6o)HU`e7iWLw5l&V$
z%0vZfY3sNh6?58UR(ru0xUg%>y?k$KQHB9KEhy~R09nPN7ZK9w@KIhwE?)@sV8|#5
zl=yDhpXZKbf&Q{+E|w;a(b`>TU@p(245n!uSKe|_L|2dXSf35Dc;-|`Dh`4(U)uN4
zV9Ng%0nK^M69ZM5?`}a=(OXV!@)#8v)*^q%BUBdlms2CtjWzb|>X0uUG??aeD(_o{
z4qiHF(WQS?2KEL6{?P#)qLG19#sf>+cFbW_n=U`3SbC)a6+JC8ILnsLbdl2V&JZsi
z#xy5l-blKlN!K!vE+0t6xMvQf*1l^Q&1~~!M$^5+Xy(<;8_lK4XSzt~cxQ+gkEV>Y
z7jy4g>yUnuQ|Oa1zdqrh@~@8Du&*)cz{;-7R%l#v`dB!!pYAeIiz-{kYUv8uP85>f
z9ct-nQnZu3C^^EeY+IjKVHBJN6K`}%PRXecrN~u<OF34urEoi8j=o<_vRmcVV49sE
z>rmGy@~BI=(N(?ETj;+(@{N$(7PErMt_k6Enkf95L$QVYy0R!Ls+`NO%L*f-j=~`8
zfw~+cR8_uPQkGF#@(hpTTaqyJi}EqaSM9Lbc*>lP)9LQCyUtE?p(rz(BG$<1Xd!D*
z@l{!)sIqmWm#&cQM4{{5p<YJu$RA)=wz{+s%gaNVFT`>)S6YNvx#Y|WFD5dqFfVhy
z^wNoy5nlzgTF9d-i?5=}xjee8_%iA!tg#-b%dx;J;tOLMdzMHq<cJMl_>PPJUdUnU
zg)a+_{j&S=W!mT_dEkLg&Jpfecq`c-7r;?skIZYVzDq8wpR?;-rH-X5eIV9?L0NvN
z_0OVkKDETSQGFe0Ov$vxJf^QX0XYFB1svAXC0g>uWqs|QMDn4*eEWwc8`?j#*qQ#}
z)#1VWckIRC-tO@plsI!VFSpERSN{y}U-BaSCsf}Z1%02rIC%f|7{>AF7>c|(f~wyw
zsP{bVtyt^r!S0J6m#*uw7w29y3M8z}yqdiH(cba?OHQC_FjxT9OY{ln%{KCy#dA6u
z!>`Qge1*d8N@tbHFhpj#qF=;pzhcArXp}c?tyQq$qFUC8ceSLTzcQ!i)g3|9ZSvau
zd~@(qDYvbRHxC{3%M*Ex*2cNVXp!rVrBLp%+@f=ldphgGD@E30J|ds=qv5uDaX=PK
z$PGdq=I0+onEr5Cx@OMkv`#1CL^<wYPaZi<cPH0DCFj^s>GU2?ItXq&>7eeGIO$mF
zjLG2M?D>eDgY(Z1+}lE+@_bS1i(OGN2MFrvLB-N-H)kT>?L=iAWPWJ+E;@=?fs(?F
znmcg7G#&)Qp&#La@yq9Nc4B#%DU5G>>@ti-g9Y^E^|L-ZJw|T1MRZ>*Y3Xu8t~8{G
zjY~_|<=ZRtS0T!AO3@r8taS&f-M23f-u$@t>*CXS9(4Q4Bqhjf-E|f(Uc|nyhBFWa
z&DS|wklY;zjfrso;k#OGJ;I0IJto=rJNaf>Ly2f$I@;&kg67Z}Gq1S>y}afWKBD|4
zN&i(@RgRj&9QzohH$%|FKeOm%2Q49zY&xf1<&Lsbh7qpxX=d&zio2!DJ)3NH8M0Y0
z2JR+57jzZpo_nw0&v_5lz8F@(M~<t99LNJ{Fp4jH*g;=LLFmsfe-DFb?g!!Tm+%k&
z`TM1Qt3<kx*<V1PWtzOd1Sx;<C-44ed_JEI!pl45eV5Oo{4dRB+r0nTt~bBj|9ptY
zdjC@nzIp%i7z7@R2C(R3sQ;di6353gDUi>XKHh(3y|dH#1aH9eE7GzhYorA&6=H$C
z3(G>OYG4uKn4Ok`)5pvFZv4cpgH(g%YaDN&o77;=Vb*rfiTw{g)Ii$QV%Uk-02}XG
zWJ>%>>EXqB01G#40<bMgu&6cHJB!uZ=i)YBU0-$wL6l>+hA*0l8cX-FN1oXRikzl@
z8o`KXFd(NmARmV4as69}5t52}p&GU7P154+HdH@RkWI#T3^N1Am~?30lEs0#6#Lw&
zgyclIJfG~lBo}~Aj-*mY?~QliGxTFr(+Xe01_`rCD7}id_?Q81D7H=q{t#1=PtHz7
za0qoTXWW?wT1-SN&B!0(Reib@|CJ4O!c5{Xcszsu-*O4SIW#Zc#`2SELP51Ww1Q6t
zBmd#%5?j|~lEpRV<%yfvGz$Bm^qdBRHSu=J)e2^_C^*B7yO%QK<#_;{LHHuXxQkR#
z({q~aV@eY>naLyeGiEQr0iazdG8W!y@C^#(MG-OcI@y^i9i{wqPA@!6I3p26iV-?t
zDt*<&PU>h+VpM@Kc*S@O6AHJ|vdUJ1N%3r0NTo|jC7j<$bHGcM#!AvEZ|1F^Sp4T-
zS+&g5|Hl5<9}a^)h}Hh}9hJah{jcRXEhGPnTW>YmU-Z9+cu@M%0(1%^9!A%v>8QiX
zO}0%jkHn788}SsY3s&N!OwWsbY#T*AuDYV1v;aoYnI-m!y!e-PzoD34AjAKjRe#f7
zf5gn30ER$$zj{LKT^VOBn9QEw=J?6RCJ(c=ajRTDuSNsDOk&Fz11<SN07!Uc<1$yN
zW&<fK2~FmdblE>10hqBr^&)SEF1I|K&p4O_<M|lHW(=>%sw~bW(V)EjRVuEQBOu~R
zF`+PA=gT1Od-P%ogBYtOLsClT5t;`J2NPc=(d?88wW{QU+qAI4YNE;@oP!*CQWf;r
zcv_{HO1w(s&*sqtbhe~gu8yTiuT;^JSJ!UvgyfXRIF<41PJzY>^Q%N^xcIZa?W9R%
z+D-n-O<!S1cYM`QUe(<uzUnBi+KrtiyxK`F2PU6*<dHW-QI$6QRwWKL*=af0)f9z_
z#XP5yHfMG#E$FtpB+{Hx_&X(pph+pqdihl}pPa_wD1;&Phml7Y@vI}oKUZ!kGGr7C
z(A3K<t`yYj8vgd?v#{oc!&>B1#I4%YkNTKW`V50c((+wN$Cz^aYB3#dHh=TSAhyCj
zX#BvqK#EiP6KB}Ti8#05NB&r@KO0dNKQG>%LLYRFvEy{z>{#tmz!fHN$mrUtpUEd}
zN0|A}L$~mTV3)M0V2zio&CVk~J`YEO+9<pPs<z5j>|ggsehq`&wwJBrU9nE-I<Rkn
zIaljl1HqU(?&a5mb~%sIcB4$e+B6&mz?(2+XfUjeqPZRba~e+PBUEZTq-X$R4~7nN
zT6KFVr<0U&S;H7Dv8#vu5J+gw!!IIK`H@TKQ;@<w7u9q|9b!62ATI5kGLw@A85l8P
z!c%+$QxP;?iy8gdGw7@r#+i711U-g=sZfhm;=%$edNQ%8I8140yP1grt56!L0u#J8
z4nZRfqm<h+d?rfbA&EaLHO3B%F_Ll``5*DjX*iF7dJ*$K27HtL1kdkay(6`q@~Cp}
z9GrO@8IsyvcXVPZm*4F34up+rK#&8VZ#LB${K(C0qhcE;WxI&Tc&g;!%Q^^0JR-V4
z!S!U|_X9cyAWrfu&BZ=$k~X$8pOy(*i4QU&L37HXIR)8`v4|)Hd^QwzZtzNc_#P_}
zV|lSFshzJ@piwxLBr1isvm)X!s!JliF7Y5An${m8UR+hO@(PN1#n(C9&&^_c1#O51
z!GMz00%6Mz(J@WJb8fH0Mldk2CqrP;GL#*gb&_W}2`X!V=sA^ADm%7PG32u7Ln_el
zUyvg?qdo$OisA07ydM3e$Pjp-mb4)qNX>_Yds^q)Z>1>F7F??|$-}Ig*VnCOaINqZ
zE;jfSFE|=t0jxK1cAD|`cJ3ryiLx1(weW4h6sX|$XRLajiO#PV<DEalc-i<%VNuX@
zRKiLs7u3mePN}lz0q*LqZTeQWf$YHP>pE=rww-LDM{F=ByW4qicCJs{Eu3lRpSCC#
zPoB<4CfN{Fzb#ACmvSG)RHAVsA1(vqIZQ6>*hkUsO;~5UHI7+tK9f*I82Tp$@iFmZ
z6a`Y#2x7q#Sl7z3e*>PKgmQ55*fyb&I$c1qZ`2n}4gIf24CY5LyiQWP1B56-`(YH#
zr)aJZdBDCi#jc4DVlnYA%P1-dtfDY1N7baN4o<}PKPXkbkEl6tBR0B(M<i5nTSakR
z5_q42#*1!jQEcX-0BVYL0jVw%c5Ly@&hEkYAl*H>n=lLY9m*QDB+?)mtzX2B*d@V^
z{iE48Qzz+{s$$LjBEnu&!&b!!MXkjbrIGJX(F_dajBsb^JcSSQSjm^3w#J7J8-Z<U
zac@N%JC5<#_vrkK#2%t7<YojcKNBk_bR&sxU)`1zwTr~;mj!&q1zZeLtq;WcJXdaI
z9zQEu{T8k8f1OoV9kVjaElk<u(E1W@R1Kuqq$xF+lkG{NbN+%&6}}Uvq{Tgv{HAX3
z;0hFX=1;;oEakW%!WHxa1z1)or!<lrBmquVJ*Ne{?@h?1_T2AZ@R&ld7rVr1A(xL!
z5SRRHFb;5rL#088i(hiahyM7I7^FHNVEu4B#dAK(wjiUpG;KuSy~#xYgzF65@8C7I
z%bpCqc(y^wG-Nty_5|f9R=_be&}XpCi*c%RQ&T;uwPDk2g4ts{AD-a}Cz7WJ^6G+`
zmd#N(6ZD#!f?^Ot=XeSX;v<Xh!)hz~^{;e6N{y?N&|bt?Ar)U3i`kR)0&*CPv-VHZ
zLs09;zFI$o(G;)y#lY<~O2rTp6Z}gXTnn(LJCW-BNIW!PEz|<YeHM7#sbA0y#F)EM
zoTEPK;=KBO9`rA$)Fd4EW>P7o6LC)tOHp6)4yK9p`B+}rWake1=&*B_eRSD*gMDlm
zMR~X&Yp@_*Ac-}==)xV8!P|3<OgS0$B&V4x`m9~Vbi}0*Z*kG=olQ}cZVbxX4aucV
z{?;6=D?GpBpZLWxS<rsNPPF!&sr-x1<ZR}rPRZD2wla&3e&w^=aio0kSdwm112{C^
zQ11h945*5*lZXdH`CkRTWY=u0&N%?;^Ry1jRVMC$y2K#M_Z^GsSbNE;SF&mep1NH~
z=~gL97ajnoon?3+IS?cP>}=~f?SxY5_4{+&irTk((BFtJ?KI4wEjVK)<TA+0FdCr6
zAmmcT6MH4P6;DerUm0z?0Z9tUYboO`Ac!Q&9oR3sMy~^)Qln(=Ud(RVx}#!;lN|Bd
z;@JW{JhWGi^FhB0xx1E+p?p7bm6Dy|tt!<2tot*Q85%|0^N1mvdzhAr^d)g#i-M;d
zPcLR_s3lIyf1`7Nm8Q<x=8pQ8cDXgZut_~S^&GhzhhsytUls%A=HWo0dVjkceezph
zBZb_SjY9nBjO#yoGk?W1+p0FvOl#m8PH!`){|U}kFYj=+Do;`~&HkAWQWp^<JxDEw
z_Lp;1^SSFe>TK~j>K7~Qmt)i~$EaV9QNJ9crqAbijGCaRq~5_N&svHWi7(dDe@$yC
zs8U&Tse>;~bLsur=aw|&n49$!MwB=hKVU=`v7QJu0z_d<nVe{PU`mZa)?w3nJp)rd
zBe7b7LS$X8Gd?^d?dP$KIMi;+54`|HFTc!p?#1Y>ANgl788JvmPeTw>v%nkiBdXjz
zG*MziiSA>uy<NBquF47v4F#G#($Vjg<d$=@<reSE%fnRKq_nD)u&nt)<{alp|K&IM
zUv~IkcKBa*_<zt2Ujz}%-Pr$2S_0PXKxQld#oA!U?6a{pEWNcaYb^L;0r*$709a5A
zFj(U(0u>c>3KTkY{^y-d1PL!O42;ir+-`j=MN`km`Of7ehACiPFN|hlA7qif6{|NF
zhM<W+q>HXEeJ(MvL)wIi&O~fa+N?=!I-graB~|nOS2KO^mJ}u4!4~_WaHd8*CE4FT
z55tSG7hS|JM!phj_cl$oj*rcF;t$R^)0oziM+h9cV|p<K1C`|{t|hO_lMYKf;*r-Q
z&huCwD23TiVH-)iR{siSZjy!A=;q(pd=`v?Pm))W`LL*e)%T}K3>b7g<aghxBM=hd
zSnN<?6qvbB9(x0`pTN?JR0a?!1q#D6^pf)Jl34-sKMp_}pa??g3^TeyztI^J8XZY4
z5;P%2#JN_0-Oi94qZ8mT!M|gioS;u)L>WptIl+jZD14HjPDrasC}p(H+GVeXo437n
z{<E3T_?P9b2v|&MnKFwU`|n~>TTs8)thS(Xu4%1Yy{vg{K|RgH=8Ovlr^w8PkKN0}
z(w=seA2j!fmO*c@J?n$M=x-C7u%8b0Us{%kVIV}rFo<F?^MuPW&`cPYaF!<qsH~%}
z%_`Gy7kc?bsnbg3wEA0xwP8nQR}Jrkq;*-=ZG5STv7H#;cnFHEltL&mRYGKqaOe|F
zB+Sxi87D$no}hy6Z1crx3BwAdoU2rCAv@Izow`=&aS3-W%V_1A)wtU7Z&vcfD418F
zoF0wV#Khu0Bp<4d-R6J&&4|>?Q7#1|HvDk37FxHlL7y11q6l(lIbncwB{@(I%v>ue
zK7Xv|z`8c67Q7c)Pp#mW(V_8K#po#!UW?%qpL;TX;<Ky)6rUxHp!gIT1o2tI7)tGB
zN3|TG3XGz;<XD{^R^w<XdaT<>ice`nX{K<2?NcpV+F**$5=K*^Sl)=QVm!rX-4uRE
zPo3ojFh1pkFh1q1g=xu!X27&)DdS>x`NyY}aZW3k*ky#9JuJU4*c6vqGG6G%lJmCs
zWzLU6t7;^sr!8JZ<P}Maxw1gH^?60B4?as+el!9sw*KI=J`0d76dci9hJ*VH2U7i$
zK6&w9XQOx>q5tVAj{oYoE!T|y-)=SBFY#X=;;~xZVDR;Tim-0LJ9W*Ndi@Ku>_-0Y
zb4<JhpAFmX&GGA_XY4KJ&FYhJbaF;nyx=uUgR#flQiv}x+=wmJOe~B9u-ru-S)HAS
zc(^D2z)B~&2oy?tHD>Sj-@Y={bFw0-M(54_rw7cBqA=Pt&CeW#pM>BZ#Wim}JFjsI
z1)fOYG7w`nFS+Mf2lzzlXU~E$eq$d14O|u`{%9F2jo|kJJuTin7yT~|-hRLTif+$m
z5S)ZrSCP*En|B9TVmVYoGR}LWzYIdxrib8Xf{V&(vc$q^HI2eq*bhgg=2V6*X>Dlt
zqqFU<LKyhhVK+5s4;o<g+dEJ|ktdl!T?H8D4#1RTt(1fnYpwwMu=RuKIjDeZ8nnXV
zva8C=z3+G5zdn9e+ub{I+@0Fd54&!wUAY65dDE;?+kO4|ncnJW!38FK0N5JfE6Erp
z-9JA<--W|VqAZJ+kYjj^QRCXwA2K~OvKrj7hN06Myzep8ZUO6ESJ;O^(4UcI^@CW&
z(BL$WwN>ndallU&GKX#4R$O8~E0QUlt(#;IFrUyhqei)20<?6+A<r*>P9BUaLgc-H
zTNKz?_$-Fm6$}Hr9zOPBH2I04vK=#~rA~2JwIR+c$TcTr_)X{a_c0pbapM#Dc;5l1
zzv%s`*me;PNs1gin(BL*{`fg*AA1uSMl1goiyb@A>M4EShVL-Y)62n07GmB4<?SqJ
z0lp_K=uN0QMV>D@b<E&@>tj|;LB<alRZ4wNDQo|kYcCW}I1XlN>qI!E6Xm7s;Kb(n
z$q7KDEn)$Ds<NE;HyonZV#*d(W#}`NEk_8AV%KUtRe@+5Gw7Z2>G^Cv#k>UxRAi7A
ze_;D3Sqw@zp7T6NxTV0mF?~GXoP~0Z%wq)Ux4Ai_f3qFQ+5fW7?f5c4G<*K+5>u|u
z`crZ^f=+1i#Mb?D^l|YlgVwYBKCsH_YSLg`O}mE=o)x3$&9wgFU8bBV52?YTQdA=8
zJX5ki3S*0!SOST9NhAys*}yAAAVKp!kjNVedk^xBoy&d}N1^1ug6@EmesoPXb`TNB
z$0nOSVlUD};z?l;Zn5o-m}n#?8J#NXPE53v>ZfT(m8y8RoxIa08YNj1o>cK{0793A
zQ-2c2BNoLTe3>xW1goL%YBk$Q&GTbW16XYeN&=R_f1f#SqsiRwo(}wvPbc%yD7$(g
zAu$jn&=PBTRPQo`p+G^R+y8CH<+|w4z_nl(^?t&GJ%!>-4!PK}p?bvLhL@CoG=<O5
zN^(FVaxf%Ax$+hiEQcO{uu*r3C(r&r@;+S;Bj103{J(C)b<F&~t)}zE{{Ik<)&4IB
z-$+qfdH?qH{@WihQY<JS{gD@p<)J_NPka3f3_Lg)sNUH)f5Ip@%gq`l3waTCohlGH
zN$KkadFe+ywkdDQn&DK$a~xk|!#A6^RV<o(O)}d?jJt_Zxf8tPV@Bx3`cvP#C`3zX
zPvk^a8obREt0oP8$EuQMU&|12N%68iI|fwfFqd@j_rEVHD*N9|Ee{1*HAT|0ASUM>
z!5gsX^sX7_nQT%`g{{7S{r>2Om(SVm(XVe`eBrK=+?BYyL(A8b{=W!2X}t2Um8$h#
zp1k#c0$VhZY3a@yz@qivY1YmBuTK3-{?`Y2__oR12TtbWo*zjGsOt!-T-1C6xY&Z~
zr~TnsvRjnXT>nbFXvwI(k1+K~+1GZKB)svHumKEV&vlxV<u3sO%q}W_$A9~<Qq1%v
zAZHV5m~J^XX-#7fTum^jrch~x^$lv#?pHy}-mkuk2NI3YksX&q-05gNOVe>Kw9q`J
z0p){uDh9?_Gc3EV5nbnEbjvK@MjHKW*RtzZvla-Z;qmi%W4NIdx7INEUl7jY?2zA$
zX7=%*#H1O1?*+J~4+gNaju$ihBeLXv^hQBa$s7aC08Xt}y4~)!@?WKZ^xp%1u+rg;
zU#yB=%hISVJM?2?2b@dr9_mXJq(>#T3HRM5#{z=?(emxfQ~c!Sf1i(L!J0e(i`W0A
z(`>cO{eQjP`m+8%#A8pNje~D&{%_vAKYqQ>p0d4P_FiCC_n@zt>-l}9@ihv0<z+<S
ztoUms2DkB{m-nHsd?2VasrAvJ;1B%fo~Ti0HAi3gKe||IidQo9_YHiHw$=1KHBtSD
z@wqVe77t<$X#St~d++yNGV#yN4P}G4WpoOw?qzRY?jOC_J$(6jP$uoyMv(!(3}+)s
z5lI)2=-@{tsH4&4E&PNf?9Kbv$NO~Y9d~wkdErt&ttI!&C{p+8CVpa_{UF|-++qc#
zG>)j&-YKk>q6GST?j0U-I5ss1IcPjgK$1wv8&UeT=&b(~etgu2RoU%(xzIwfX*lJ@
zbQ((L<G)Y{J#G?^kb11HLHP6T@rxfo`-_8tFDNOt$af{=CH;1_5-ABPos=XZ=y*T`
zGQh|S7+L}Sq3D`0XqUgw{kf0IU_$IiPIlT1!_dJWZV`d;J`9%Yd68pc7m>zB^ra+U
zytCVEbr-9<+3HAxe1#2B-F<#=c&w|%=>XHXB6KJE-)=I@bz_)UrJidJf0^smccn6E
zeAW!#ra=lAP2R<&t8o}B^)^fHkt*cI*L3Opc5!$0<+{6{QP1xG?!pKAL%!DXKsQ@F
zAPDz*;gcWz1IRU|kAYP5>HnvmJ$$v6bfHByGeOWgMVALi{_wM15xHcL@c~LC9J^+p
zGH)*ms54dXiYfvz7cR138emC~*b|5T#<-@uZ-201tSLawE7quILC+Lw)>ngjWtdyb
z!i;*r6}!+#{-Ch;uGtZA7xx4>IzBkuqj+yJybf%Gp=+E${&+gO*0C~!$w<)z%#OUC
zL3S9b>GWbWQBbQS0x;x_ZxmSz+IUolZlwXtf0YInTtG?C!~<R-gwd#pcrCmUHQOJT
zA<&pHd`M!4O|O`nAp#ao=Q_V*Ti2R2v8KZowGT7-3)hh}H6{;sN74&qJ-eCs{vduv
zWi|Tk5?JxP-}mEqI3IB-i%5|+MadlfNb>p$)3fZrs!gssAu>XUV>jexq;+F<2Uza~
z*?pS4(=d($VX%DvmL|b^aGOu4*qVS9pz+(pT&?5k`#Cu)@j(&mT8^){4w4#go_9f~
zW4o_klfSH>$SlN|fjoaJ??S|OS(ZQ+A+o9nOW?#C)wF7JC?|Lsa5yBqEnuQJy1GXg
zGeag%8}E&r+WK-QY66t^Ld;bm%+T`a=iPT@NXb*wk;=Jn5sUp1#>%XhqCH+jPYvZ)
z?1_lP*{E+MfdKdoeD*{DOCkCzKq-IbS6DFHP&>Nxrh^{3F0Nq+mm|&~q+wo)Mouw}
zER?j84FSRh1;{6Y6OOJa3<4lpOhyq#=^lwF>?0`+F~}$$WD?W>hex3Id|U@Hd4V}=
zi3F`u%v6TJj)lOjvUqZb^*C#ye8diYu1=y;MKA#^>E-imM_sd}+=(exB^slUj7t&c
zzJ%wz2t8Xv+>gH7Kin&pBOG^K)y)!3Xlw?N?l$sv6r^&zSOVH0PvI;;M<}{#%*fSo
z5f)??pHn1H+S?NYb0h~rG`og*?j@(F+$Lb%?iRD83863u7nC4n{VE3w$0@=?YCkfL
zNOm~Z1apZ>%b>wcE#lY%mCY!edS@Qp;t4?j_E7*nLGcGN=Q0XriS=09CCmFK?1ML(
zdHwU#S$L{k;yC5`eoqR37KRpM@2Tn6V(XM`m)~hIe64PTq}bH&aNJPGw`S3#bK?sc
zc#>C&K@aU<xu9@jFHdLMQ8SFy7<&{yV$DRhY*$R0uZPH1g5Edv&=^{y2v^c-Y_a4Z
zRAhB^)=1Yg-tb~dQ_t=_5t}#uaP-#1!4~eoebUD_vg;7=L59=rPIh4fHp#B&5)}3o
z_n>$Wkps%JKZBY{8&wgG9j}0Z(4K^syptN;NxAe;-BX%N>0pXm1Y^y^D%)MhfEue6
zs@G&<8_el?-oe3}RZdsdbvlxBa+fT2`4)Bn+_bHmOXj-HRI;ZZ3+(vfFc>+m9|hAH
zW#9<snkw@M_7Z;of-__=Ob(Ev0I$@G(Gm5wkW0~+8xT83{t(@ew?I!;8J-`N;`RWq
z{_tE4z}kZlH!kSlJ)hDnnN!3f*h~#&Om}73F*w0l%nDS{mF2R>aB5zsxmQD!YNG&e
zzdD)it*VVyv3DQSson6C!C5p%Y!H=ObqGmEbrls=FcGxia`yTMQ~5~!%oV09y+9;~
z?IKV%oJl_vaQ9Up<LOa$6(IWSxrhJsr5<=5h8GM(Mljjl-Y(y{S^!5&|C)Eol=#5$
zvs8U%2-1GwtJT$&y5&+gz-XP|97enI^Kc|sg9{pBD<02}E~NwWz#u-kq=2MzK>J#z
z_`uH_<{Sf*00_Jk!2aL=lfO4^?Gu93|0I@{ZsiRod{p@{p@!uYO5lxRm*yw*JQ$j{
zR)qb%N<}MJqN1}L&Gdf|{Z)@YWqR|&%cW*FuaYylb0?|NT+VbA8Cgcj%7z&m0#3g?
zBK@JW`mS?xJyKzfGw=EPqhHO1=>EjVm#M4{#@(kft-3Yt`4<kZmzmYctc~Uqyk8xR
zLCu_^K~<fgGJ6q?wcMPjt2W96L{JEY-aNh*5PX@mpV3<VWhwqF=P!lw_#@V1PUqA~
zEjxX`EX^y;@;~j$i(JFQy>ou?bGKHRS@>t1dE88b?njz2DCQH99QgQQS?)BX7U(yT
zhA1|hN_<6=%Rgze&`E&7>w!quK>J8|jt=x`;^a@04FBhu)2|fLIGRBrz}Q!0h>2^n
zu*RWZ+E;KhW$CvEhkNf{@4whRT6x((rrCe{;!v2dBr^`ma9=6>>Uwcvlp^+^95p6)
zjFNa@EAxup?wwdglbHf89yG5;u+}Ixypjv8G;i6ld9`<pvl;42qfI!`sj_9b^Knx3
ze83kLEMAoC-CVdKK6s<KfR{PrXk(X#0mD=aqw_da&&ikP-Z#5P$9sn_4}N}|xyPp<
zkN4_$*gHbK0A%f8aWTND>@!c6)5rn%8B^P$$*yvn10k7*lc;2|%-b^Zx8%r~us;&c
z>zDpx^l1kb1D1c-3OtV0cDcY#t7k?XmZ5w<N}T``%-!MVk8dh5%tQ79c~L@Gu-j78
zpL;Un^d~OW=c;0g?ji2KaZes1yUiY*(RIw3#?L<%F~7-K3QhdUFpT=b9<Cth<{7z_
zy2D@+#OI1yr|$lU1eT*rplIR&3S_+@1o*8h{q}g|k9;pK4Ov|;QeeO0F~mScgyu1;
zrH`R4YNDCsz=V$!3fHAZ#dgH2FSUF`{+J<H+J`?mYq;luc@ARjLc9ASLZfk2GP|t-
z?F3`TOp~;E?2J{}n;(yk5BGN8e5DQ8m?am>l={69UgDzD=Tm+sPW>1y`p7-U(-MyI
zyQ>!;QRdaWqObS9KjuHQN}r$)OzFvsenLF5-@U86?^h&vp1(eL@gu7<PL(5|Qq?TO
zsVIK3zNN}{I`^v%Ovx91gOHBm60an@Hi$RvE&so@92&`UMv?LG-TUXS_m6&9#TOu7
z<cmf#7w(j^UQ8Km-Md&;>3MI2v#&Su@IU2?ek6N;J{$%F_v*)CjL*@F!~J)_xCgs0
z*E>c^!)qERu{9orFe7e6P+d?&o;(I%A8)ZA_kKP4;GAr+$HOpuym6b)?&^p5+)Khm
zBG+Tg&IcHA6&JJopL4wTe%gJ#;y@er9@(#7OIDFd(d`^=u_<DRo)-Z_FvsSh^#FrS
z0N%qW^N;}ivzDW>VEli9<>2M3!-MzlvY}Q*N2uTP*d}Nn#9ZyLZSyd&O)w)PlQOPP
zHqh;nJJn$1wzPSz?WNg^56~~WFJI!#YYx|D#tlc5qW;(m==yjsEk3^Ht6}{s15Mp!
z`j;2GulL`uCkm_ft`$5skRB)>h=)`5eu~<a0g29;0=lFn#(zq<&>eO@_F)eq*XRWF
z%6DeucAZu6S&m(a<?Jj=pRUl`$ohc;D~M|=Vc~dQlLrd4Rnd7LAN{Wqb0Dn*v*9lp
z%qB1X3+AU^R|2@=_%E*OI1MxZTf6xs{>y_r*7z?t_)J6qG-JRXz1V%r!@pFt9ai?T
z5Wl4fJCFGYH(eNcQr~Lz=aFHTqU#3ARZng%ax78dg{no6R-vJ6oNa8~)Va(u7kUXJ
zTDOe&$)Vc3tzKxKDfk`s^6j@6M6?I8<3f=dS;Rh!=vHtICfM(D9!XjWrllP@AhDqQ
z$e*0Swp=Nx1x}^0cyaLl?eS+d7L20rvDUxtn7qNO4xiVUaBEEkT6pIC`@dKIdSg>^
zXpVn<w^uwekJ2&WzVc)=!s7%yXO7E`;3M{eY}yz=LsaEqTtH=+4~!GIwGQ>{dg`+Z
zT3J5lVb;bkJ9-&9sx%BH4?{!V=bwg(Rtc3MBtO89e4mH1#zmgZ!ZRQJXdZ~5sx;cH
zi1os;(C|-0XQcw{QGM8dVlEN9r7%M%&%OAZwCv0lx^hH<i5uW2{cwP$?JE3M$?Tm)
zniAYm9{GCu6@J+xHr^6?2nKrVb4YH@ExDv4W<d+C%zR$CxrEdzu;qJZRLcw#lo?a%
z(i{C-5{msd9*X@p9*SMYVgJnrt{l{)&FT#Y<+ghBThX3R1Z~6akQZcqbMr29kjaz3
zWLSuA{dij|uS9kadw5EhmX9&QJLX@9H@9Xl$2j^l_*TBJXF1)Ne)!m@psXRMA<aX4
zk=2#eE{mpG0z~0-!)L*i!>4fC;bRc1q)vcODZPMqp>(88*-ycg&L|4z><_EV*&m=i
z%cMOwUu&~g0Fygyx$tb%%g<UVZtL|mPT4B8y4<Wq@eh@&zZK5d^Rbkl4>M=6rv;Pt
zhliN7=QL>v??3shbuA1;v+d@BeZ1xK(n5>GALRl^gOr8p$4b`Hr$X+sYDti6lEf_#
zC7i(xY2q#;PT~tOl{3=hzgE%!0DOOtqX>K|)CB&*G6gDfu~H~gKA{%y>A}>1PmA?{
z|9S|K@`*&sr@w$A@UJIQ6dT6b+>5-)%=e|=+<bx&Pq^bLp7t(pdQ!KEKl?lb0`1-?
zUjqg!+roR{MAl&xj$y|>3t6`-eV=es+4Ge~BFe{sSqtRc8OV!y0A)l6F1p+JU&r_>
z$VkKC)ESJ`04PQ+p_A@MKe}c#kQPedW8V@L%0cct22#x*AX9(feeMgHe4<4Gz(+k4
z&WwUKx#YyUuudwZgUn%@aPbNIj<s*e2RWE19)~7fwV7pwW5JACpzF)ny4nOvms;2l
z`*=x!#5DSua;g0!h-2vMk<)0lHZs}9s0>iSVTuP$cJpm)G(|P7sm$K2&h5r*)7#`$
zeMBh-S%WYJC!eqz1-jzSoHcaj*d$d-=y$uv$9sowb*aRI(;Lx6c|>)L(uJq+L$Ak%
z!6*D3<6}6?WewKM$BWmLm_aQCH5Iu+bT}sLh5(?BHMD+M0WH3RN%3+BGna5{B-mlz
zcn{w8;9Z|J*}#VA`T7xcu<IOb|7!(oKc$06!KV>X50OH2c~{veCyIKqM&z=n#C>!W
zeFi<AVG<nlSE0`+a>cxNola{JmNp69Dll4UROxQ->^Kd_?K<rpx7lsfyMC?VHq?Ev
zW%8!khBY#2Ifk+DFo-bG6XKb>z$I#sTKI3clI3U|1>|aW>ur@>3281kX)bho-bI!)
zHp8VNKd<mU+MC3kCcx_g=oBvut3rBbmUj%1N4~U%qBx)6*V-hcd&pie0f<3=(zUcG
z@~$~GDTUHaMrVH~bthD4OyIHNWIpyWNwj}81$sDj=WBCKzSR{D>jsFovS{U(lrlCw
z_>i9R8~g5CF$S3e_{cRmA(^Ei)2eFF<498&ZTc9@R?Ai<(SR)9fG<wd?;81Z(s51k
z=5J4`q90Vs*x&!os%drP?hX4668QRTk~Nb;Lnjh&XlHC}4>{g%yy!wO36<GK?O9wZ
z1_c?@)#>_jst#LPlNYc;*k>m@S_*48L9LPB1Hlm*B)4&q{RGvwGc8KpEg(vaZ95`K
zY{KD5HP}$@AIK-WKjJA;C2=j7?9TY@(P;?NQ~=G!VLVed0ppkgokqdg8Nb18X(#g0
z07jUG=rA~jjRq7Zs~DMPvq%%mrvneXP}MjoZx+D#1DuJ<CMUzPGeI>P90}nmwnC)&
z^Kj29Pn6L8i<N)G_-`MA$uLY4OVDWkwsDe&Ezh*d0Tiqz<G8}~uPnq`|Lsevw?FBV
zoBthe!pH0J09=s&)v34IX8t$V{o?=kAdfx&I}Lv70mwiMMo};TCGuwMUGbZ2F`6W#
zbkP#QYU-#AV}FWT8mnyXKRw_fKQ=3317cW}ZIv+36m+~vtC>HLRZ}hXhPyTZ7z%tm
zls<)l<G00RjDQS~{p^Kan}Sj8lbUZ8!6=;jnb)Mfmk1OnAB>?lH5DlN0dHVsEt*M^
z4fU-epEDQt2#@dB4k<{05vqpzenZ^3V^wV&zKHn0;FBl+&-`#*?%xaKf5&lL*Yy8x
zb~<0=|3f^F*bn|_iWy_(6D}Jm3|BDbyW80JqW*aeBV2fcV2*cGNP9o-!<HRysleZ1
z#KWzB^@x3xy06a;DVuPBp}tVJ^wLYl9`yC;(=`e1?XRX$*k{0PARN!257_jb;nfY?
zG=tiHw)w=Hd6Os3#^%n`MjLi;w`q+C&E01VYsnh$`_pU<r4!JOJ=|m6jKYaCfX&|w
ze})s6es_~>D|Af^ibU*#0$i19ounn8x>*8SJW<<lvu(I~8<`RaNm}Bgv?9PV_T)*G
zH(BGrL>ufWb2o0&(sQFUHDBX^>7{uwce~CuS-a73JKfH9t6kq|wc*7-b%O{t7XKd2
zo>b@X5q^9P>uLN%wz`@8<<ei(kMv_>gOYA5BZgb}Q@$z0A@~S$4=TYwlJN8CM>6$R
z<yW!2Oy5&+tVQo1vA5w&3DO`UPQmA3HU|dfA)Ul273`mDJ1yk!uXkD$!7B3c@S-o<
zq6_4xP(YDdhxTV*!#{jq9*8XHJUJ?LHaZI<;Ay(fHbx`bH1hj_xU??AU4-))%@w6`
z*zbF2O`{lOv{6p>U>;_ukXx~Bm67DY)|{O>&>xBUWMdO}{8r<pq*zBO<utJrj0L8T
zn9ZX}YG1%SF?a_OZF?c>g)<%^038J4Z76??V3Q&ih_k=**=+jk>C?;Lf>K0p&n})i
zt>#Xb4>a1<yvU~;>!2{crc3PjQzocHI9~?CA-)sVIcccapTQ2i%Bx5vi;kE^ToSRG
ze+47Vi@2<c<ta2oP0JmcShSLEsN`3Qa+K4pySQ5?zgue^9R^#qMF1-bT?%`|hcRiM
z53YDiF~#<WAZz(t1J>;aQ6J4EkAzS^MUJBA72;1!EaMM@31{s-@CJx=VXfhnx1ciC
z7-2+Jqdf1Y=X0+|Y|$SG=}w>aCoiZCcEeYa(~B|jG&Z9ElmeqlVo_x*S-YCFv5BTs
zh5r))|3MS?C{0Lou&UBoHSO&r-Nq!9zG1STu@+4tC9$#%5pRbc4F95`z^kktCX85d
zG?Mzu56C0F`Fh6C(&-H-Fd)TF3<kI~LtE#5aCSb+bOnO74=cT}#E}UT8`4JjFe!XP
z?co^n<`#}NZ%rL@-a<O$vPBy4%_^0D>MBDodP-{~UFTK-7*3btn1oe?uq{zN!)Yn2
zY5jl4suE`mH>oua-z0h#R^&{V;YH$5x%_g~>=c3Y2WNQiHJ*aD=b!ej0SW~4CfV)D
zZ|Odq5)LKrB?w7`7-&`KhjG-unc*dP{NDutE9-p4)d(eWOf}nIH7Q-PeUVsm0891_
zy0ew(O~<9EPa()fpSbi1Qq|#qy=wu|dhz6aYG|zwfLzo|aEVBzwGJ*x8WV_#zwU!!
z3c7k|-Vt4ke|p!w@M`U|WC8c&fv^VlK|K*O++xf&at1;rCh|caj!DY|c^TuPBAlUO
zA2TxuB2B|MpmQX?nhCb%aSSme1SszFvt;i%^<dw~c<N97k?%Np%fTmq0PT<xk6YLX
zb7^|qp$*}prD~h~ERt}lC)*zZOU$s2H_YfvjkiSMMF&_CX2*>7$K0SOP{F8&u&^c+
zh{hP%E`CNhvUK75iXY|6?oMTQe3sle%^lZuTis5(+wQVXeW$^8ob7g_*#*tI(R5oo
zjZTX->aay~TJ^5mYIK~Pc6;YGt=?$X>z$_4a#*YBv~dHoz0+>EJI+qC(}3MwyTfYD
z_I9J$sn;9LcB|d#cAK4~fo`|%G}}9^oo<`8>+L4&mAczdxzmO>u3LBEGc-`&Znhgc
zP_FGjFFW-{(tzVK2R4t;(ze@$9(SBh*X`EpO?bWCZSB-MJ8ieqY_;kV>Lx(jfzQnb
zYeA((tJ!v-;T@-eyU=!f+iiDSt(N0LYmIg%K^DPlF#ruz>AJJMv(xId+(x(C=<WdB
zp#OT?>2^Ea7LdyAIugeY`~}2?%?hh^>)TKtYP8!<8_4T)us@(}w^0X7;6-ys)&uhI
zz@E#&KHH6LAYR99>~sK?j=RI!&Fwls*z9!N`i|>3JC5wm?E>_Kozv*RShU*>=*Mlf
zTb(X!xwpGJZD<4F210f^ZBY%e=t4Cd$L=;zvkkO|!FC(aG;6oET>uaoLkQu&)*a~I
zYB%8()?hn;1$5MIIQ6d6+G#a`M$i|GbF<#)x^B~LyA4<N1p`%YxJ~>70;JsmSZgp2
zXxG~T5&<&ZCg9-Kw*gMz(w)u@(5BmJqCtQr!pGBKaD{PGtVa+a%Z$haH?Q^%WF%dT
zPe~UFLAGVHU1Re?=uy#AESetEF4lx9KOY{veT6rLH!Ip7W!ezJwYUu}gi?YS?!@T;
zmvnX;YUC<Is4aufjT%?F#1b!yXP|uk>+6HJuXja4b)Jlk%kW$<)0faAIjRT^uCd){
z!!+-*#?H3mz$9<8$~$l5N8_-9{951X;9P}ygOe71tGqzNUf@+$LfwMPo4q&B_YN(j
z=XCh&P?DUrcX)_AMgLfF!+=Ko*1C>^0C#fThqVEuPqPKGrOiO1gYarK8hB~E&&FPK
z;m_ph+>K*veLfwmr}cV%>wI8d{J_Gg>9(Q!{qlg%N#{@_?NfzB?O$;tl>R@dgB>&m
zDhV~F)j@B&D~DZYvUlBhz4%G>%GqEw(Kq{s)wk<)C2F)*^qPut*z}@iI#3Hq-u|+P
zBz1!%P-F3s{FzDe%hDu)8nvB2jwCx4Jab55qh1M;z%;NjiaA$G@y0UK)jAetufHtQ
zYk>$#hCjiT`^yOvNPIn+Vcb*IxP*`GkY5Aw>WWRS%7VzjgiiERbn!Rzi=vu?vbhMA
zVDix$1p^BS7s8C$b18rEL%}U!?T2I;#3(6C0lXMY;}{Ab5uOi<&HES2p|eTgT2bKv
zkpZycHLcTVz^;IR1<kqM>aYr$W+M<VQ}hI#JpKJ?RN-a2^+tWCMP(ap*iHau^9eF&
z3<4?gu@r6`8nBsZQYi;?0@w^yE@yp=G|ijoz<$hWbg=;JQg&d+z$(8DFGL@(C2V)Q
zoOrNla6zT`y(zwdZtpZ*{%xlYpfezKOVXmPQGvV9kO5)F!-N~jnLqJ!D<ni6G=1V#
z?n^Hlyb)l79@Oc=&Z^Oc?NF-$yGC}S;w`_oaPzVQyAhY&WNDa`>VQVofQ@mJpika*
z+ql!%fx0QTBz1P`u&?aGc9s3!Ox`tMZw!pqW<WjuvfJv`K}iER8zxH}?!MfAe}w1Y
z(~-}f#N@xZk>L$tsYuzQ3xsxv<gM;b6SmL|Gyr&Ul3m)0Dq*G*$pq+VZ}$+y<|2TE
zK?MO)tc5wSar+N!vsZ*sqkRs*-ya^l5qkzS?ckq6?M4GjIO9sU^oou>k#NQ$MwZ7<
zv3Om9U^LNHJ)=~wry{Ah5G#xjKgL59!m9)t9I8gbC}_6hDM84`8Gpf30Q!aGY$4cm
z<T$!!BHNV;SfoImhu8C81>+-D&wqV>@XG@XQ)0&^5}5S3!zfv>S$cRDgTL-E%R-%p
zAL$E6#|MXdFZYj*^EHOMO9pN#9}vlw9}a;}LYBLV)1)C)W?6+6RP2zyCP^<Bw&yK8
zc{jwE3yXQTlPAFzgS|Rw?+Fuluda%XZKvCHGWaRO!Y|mZFdj}F(cstf8h2geRDgEh
z{>l@|@S798YdqTaKuNnRkl1ooWib~v3kHjzO(ESqda({Dv7JJanm|iz7D3vZW5UDi
zm|Kop7s4yxEEEe+W;23acmUesCiPk*A_NH#NO>PcUexxYvpM=K-4$qo`JE)00Q2SE
zod?^cMzTEldo!o|AKt&(+e&V$cG?~5o@E~UQOs)1&bHfeK#A^j+U=djPQAlwt>$*C
z(QMU0Nd{FJ8rY%Ir`#bowRwoU^dBOYcFvo{^XC>8Ml^ojKmOsx!NK9n^h&WE^2Fp?
zPOnZZo@8Q4c10cNbEO$9WKcP!wIrm5?3X6m1Xyv#ibq`Q1KYwH0`iY>I#gNv^-<6d
zM%P(Z;qUKczs_wFmZa8BlegKyd(SOaLBqCFfzl2zC!SZ<wXfcp?^d+A8Tm75<rQ;F
zHs1nhC}|~ERB{3sRH=a*0WA|anU}0*uINJys^~*m(|LD%Oq<YYvrNZsrej7ZG9p9v
z#<en>lY}+4D5E9mgcC1{!pr4H7e|6M+S}bO5E*-N77QB}Zq<2Nx1ele8_1xPZKP!%
zF(egtUHaA~jb|`B{}$+WG0q#|($sf>_QeBESZayFb^&gWUBY`mny?>ySYoCa-G=)G
z<l<O!kn8JN1XtmlMqL2Em~jXJVv9y0qx8dQ0&<7@{Ncyd*u$8p#GuwmieFs%!dHO?
z9!k6T8-8i<)+}F|^reaYbX%>?j?->6kudnJMMQ!wy4VGXnpP9t9Ozq{_k~c@n@!i*
zX*AoiUWe*oH_lGGi3jnmZoR|n?O=cHuG{H$+fZev)2%mbeQ^3YOO@vM*Xylzz1x6J
z9jDQ-!NE&&nsmF(Mz`LEhIV$^R;YPtGswwI#$Z`pKou|=yWu0vN0pBSQP$3L#$sM}
zUstf4CvBvgpk#%_QxCfTY%G-x;D=^2Pd9FFcX%yYJln7X>a@&#QG0u*+wNwRfFE`-
z=~v9~N)$T#h@%9+gLd~K4z-HpBer+tk)A;A@jnL_!4!7O-nKCXX?n)lDahZ0Ubfw4
zP2fO+B~`=J6DI;el*dvh@^~A@@KfA${buv}DsxKn?m*fyvvOepP%!P?I*7~$G80RK
zh~*!MiHaWUS&qWWRdb-4%dTC6Ws?&$Rs*;;7M`9#F?V4x=%@zREo{xDqd23OjnHz}
zA}(00kK(x$yCRxNJ}_Y-<B-r}|IYAs-|`?8YKGY}8u^sd87VlDz>5Tl=v8V<qJkxS
z&6s`1oHqJ2(Ph>##!A3HTe@m@QKEH=E`h;oL=W38b#Nhi*v?sviPXmU$A2<v@18}$
z8NeM{>5b7tZ*LbicIchWWABb_@obeC<){oND6Qq}o5@rv%%sn9kA^>kA+p#s3i@r;
z6KCdJo5tosYdI%QITGc09DBXK1XR^YEHEcFe+77~z7hh5yKi5apa&DWhBgau5$7*I
zw~4s&D2rllqBRwz9S5>ePTuwQifYKi_ey6eaoK*$un7+U2BPY01<mMQxuZ0xvb3@*
z`X7=*e9;`9<DX<+yZn6_#h*y|)I5MHMO3RBW%6k~o|Lw&N7{v4QfvfNq0?x1V=P3s
zS@L1qoPs3*k@|-Uh_aLx0Arf7N&%yWTeOx{TsyMstPxNUwV|xOtQBgUa1E-+d|_LA
za+%0jb0pU;z3$YRVuD)#Oi5(TvQy*FBX3kLUCdwi&s;^tP;JjKXJmM=+=#7{4^w*n
ziRqZf^Zb-+_vi&#ud@ece|FX<2MLk?AWJ_OzP=YpOkBGD@7%6^nCp~YAfd^vb@f>Z
zJMwM$Owf}<S7-}I4<)pJ##3(+GYppT|NH;Y{fT~Ap7lE2Z9EC#e>=J5YI?yOCG3W`
zBFfzA=3I;D=yaDnaN->ZG2|@lpti6FBcaI+-lYN}CIXCVY8SOC=}@GBelP+JR#hVf
zi=c5{zdw)oZ4w^Dem29MKOU1L(cz2_N_;aBn(YGxV3Q?aSvCV~@H=N}MC8mx%qqW=
zrblI?cKL^F+J`ihMg1R2(1P^uH2Q%apDi1Nm{Kxe2+vF>G2SyhrOTur`lAq?o`caS
zi2Z&z85qg0h@^n#1j8QR@<5_${RI1uFs1a6o-zVS0tl-pH3J||`llWqRD>I%NHa>I
zja!D1oA-z8I-CPUm<xh#1c!rppZ4X^Tn`;9BW;T*nZZmC0W4B4WMlC?V&9_~9vu`Z
zRt5fxiRCHpLN7QI!{*1CnnXUjSO{%bB#&2Yon%=+gq=`;#1pWSubsLP=@}o+*k*q)
zl?ppc*lVf2WbKq0mjhLMlbZzy12IKo3TTAH_Sn$BgjxSTE}r!!B&X<NGn{#r26*Hp
zdEXj;p@_jSJMc7$^}X24xr5J|2hDxBG0X2tRxTQ{0zkjY|I3sRnaT!z6p3NU@S`KR
zxU7OteqkNpOx!SQ{Fvo&RGLv?aqWOBk!sY^jUvb`67`5L#2zfB&(y#&TS|Z!mPR*X
zNz@ybMzewCS(m>Q?Y=+4tD^JK%#3$WD`#}}u}s1(R~)tGhnmieh74|C7L>?S*J(7I
z3aoa0|Cueq^pf+K76d)CluEdT0iW{PRe@KiS^zjc*%0Z=OA8gFG?bE+1s0;mvKr9Z
z5zHNPh2dqRDa1v2ViToW>Hrjp9a$(lzsqq-nm!}zK9O{yD8zZ>O!Qra$1cVv#`Irm
z$kzuN>h3v`!h|rZ!un~NrE1C!Cs_#ti?igFgCDcX8ST^l_ATw#++2JyE<FZ7rZc73
z(28ZLK`<PGuB*inq~@vZtbmrA6Jj=2rRsT^F7n(D5{g%;6>?q3lWh{t@ipy~R|+*(
z)E+JMRsPpgM@xE>p?Z0NDXTmYEwiTzGjFi(Sbe+O?H1Lh7HB`D4`X2kYZfr|$;uH8
zK>_SHxv~EiK`bIzqDK#plqTX0eWYMLjLaP(!si*hoLDna=nc{ZDCva*YU(*mI5g^0
z@K1D7>U*O;M$pCIVZ-w=Ff-I-+w5Jl;}@?nQt4%^1n@%>35E<r<H=_+Fw3uN9KTB+
zuh#;TIse8_l!^MoQRt;{nKZib_=36Uu640QkDi5$^k5XWEVY*1QkoKJmhd;o!I7XY
zxeA9fd<h^21H4CpR|f1Gs5EgNN>AEbR}EAPH&jwM<Bori`i}!>v2S5}b9b`ZO0w)4
zF`Yw!%I4-Kdl$kQfaV97nDEaS_m>zDMlA5Z&(TZ(1+#h(Z-XLRKcjx~iePwb#*4Ul
zWiW0lmO(^v%6#|@_#3m=B<j>ZCzZP_f7bZ4qyflP?{Bu?v?lE@$z!_m1oV<?q#mHV
zk)t){SqqAqBLe3&_}5?7IeTz;S?#+bWaQ#lB@!-5+9TmnHM#G1_g@!ih-K}Rd^u3s
z#jW?jkGE!KRQ+T?slaW`R7W*Co3?$_bkP<RE2ib!Kgy(hUq;-|+!DKjLB<l#*T{xv
zGiBL=`j)Il!E^o5%;U3IWC}0>1CO7&PxZL>w<ngSFoGPlbvg^D*7gKyndY8iP<%DA
zzpRjw>Fa6&Ds;ZF0Dy5Y7>xY8!Jvw)Mg8@{*(@Bd8|PXUXAKBY*uxp<G2xKyBu>t-
zLY(;%OyP!sLt%<?Ga5kK_e7d$S_CmhC#(Rd{pf+S=_|(J&mhdZcrt-4@c9O=A+avx
z7mZq8gK;=7+hDC!gT5EfWP4^C;pFRThEr}&@>eLOUAzvJ-)?Q?c8Q{=OF#`144Ph*
z-n_ddkhxoTG`!1T$7hqZ$8zJ(dt3s+@;xqPxL$*uD&3%s*;3|gsq9X03;uy8YQ^8B
zbHho_e&H&$+Y4$|vD${28D5sZ&MR*@*`TEr$<9-b^ds0|_!-v&$~Qub?<~ZvAxbJ1
z%(DBjM``wwLFmVm$FK}~AH_CLY+ANh&!^bPJRfe{52uu$qt>baPp6KNmHo^@ZMV2z
zq3h31Zf;mXJHbC!wKUy``Y1+$EA|axUb4Zja~jON$=ZgYtLilq7G@lrT!Xa5%#G!<
z3bTdt7xrozw9A`Vja6@q8+z%zGV-D`iqXwxmmwSbxQgLHDDwUwh<GA9<RsWGh%-|e
zgpI``oLRJ)5{YN1&FwtxYT{pJbfd4E7PX4cUA4HF&DPRuH*RCcRRw0#x_xiP0}ESF
z7I7@TMdK?r`&-m>?yjCEUFAEwG$j!wYu!p4f2M5tx0Eq@rXin@<e5UALSEzn%6X=b
zfsX-VQA$ZoN#y;&O%Hw8W(T+*r$v=#Cc)K*bgpc|>_X<K*_dNl*84-5>4r~tP7D4!
zQNwz;T*NG;SOTqfe-K+Fqi?cB!Y_g?@OLVM+Q=$QVIAZGrm!;6=fD)G01BQ!TKq*=
zLR*Vu*6q73Mrj(f<yRx?=r1R5gd6I;Fi9?tRIG<0e*$(;|0-kWl2*GfIb#1@PhS4l
z^XsV}jlwhd|DE%|7UzF;nk}cP=YMtUZrlBm|MejrYx0fr(a21`@dNV1>+lTz57Klr
z<gcgbdv1&Q9I@#Ti*fsW&YfPg^($Sx`yK-^<9Ro%6iKYNSY$FljfDO1`ZbSEth@0~
zhqyxnsFimV;4@BMW`dIKPGKi~6^zMvh*ub3wHgJpYmrc!I>ki|_SB#JC^S3d7b29_
z>lR#i<Pc2Ib&2VQU>zBew%}kIAa?0t&QRDW1pXigAB={<`gR2LF6z9CNw`|mHt2c!
zbT!ilMLuCqQrG#7yv8e9VhS@yYsx^}6&MD0JO{Sv`7@-w^uKtdjSCdV(Mmi6w%N}<
zDW2F6!X<MV%DUlrj0&oef;gB_?|5Fet)a}XDM@;IdF&Amk%_a{NL22V>V{&vQi<a*
zmo-?EwUVz=ArLx>!d|Ir@rb<uEezmi-WjgJ=-G~-_dU$)$ft#j$WEwkTRU&F4%>nM
zb(vFNs(*o$<d_y^jkik(ZmtIcj&ay2CQb}H?U>y02fmUU&Q8Aw&11vhjBACXQH|HG
zjlHW{?;2%6Lyc32r6!6inK-|zPVlx`UAVMn^uZ+mZ3(|vNB4@A<Vu?0`X^7dYh0_K
zN)v3sIABYM1brN3QyDPnc2(Y(B)CM8)PX5j4OXgECmV(uoJ7mO^53v0gK!SZJ}<t3
zC(;|6Ed%<YLPwh_t6T(|4oNL!{-hsLo=^mp!gBE8yVaXkOokIQLE6TtbPt@V^8DT{
zN6OlI#(6Vol?$cJ*>b`dSDZ1fQnJt>UzyM+jP2kLH#2GzSm5w9Pdn1I4DJ$)TIFpP
zx^NeBZ^1s`5&J%j`aYk*X>LC*S3xdjkW`pF`+*PTEaa^f)phb`h}uJbsRb<L6maQ+
zs%}2}p}fwlULdH&7LJFk5V60v^ZQI@J%>_%=bjWY`HL`$=2PmFvv@{E4`3^gsU4qT
zU_{En=#41KJM1|Z$!MD@!M_LwBSqlcAB{pi`jD@3vZ631Xyr$N*?;@f?(6-R2haa=
zb7f4QN8tsiN@MRV=&z0=z{M}L;>S9x)E&36HZ;?8aVulFFLJX;Ze0@qia>S0rcGA4
zdN?$>Y$(9;XG#UgT^HAf;XkkH_4`Kh`}wC&C`1Uwr^XWWjQhYzS>cT?z3W(@&9dH@
zIVwy3O`a@yB;3KwA7@q?u~_kM%5v4n_^>6A1RRn;tVvW=f)f<2N}?04%<whowrEi@
z6)CE3S~CSlq4Erxa~zIkwpiFH8N%0wL8}mQ@|gjF0-_l-2mCFgqse0E#HY}&3We<j
zQOo5e#ik3h^!8veiLSF13<j=ZFI8+IQ}Pje8RBs=?G3NtADB#Bp>EaxjZ(e`<D6@;
zd?+aTVaxRD<D+8G{C&(#y^1A?4!$YV5VQzm(T}|N-01I-V0}4GnE|q8mEu$|cjYN)
z`fu62?iLgKKm6s*-r=h~o?euIMe@^LSQjujOd=PRO)?-);%BEIT$LgktiiG*LeS2g
zS{eHh@CGK$T2D&??d4iBsLrX(Pr_ps@?^}$Mw<tG<vVUm^fqMnM7zcx4V$!gGU8rQ
z8Q}vP*giGzgMwd*{DNLHhM|^$IJYxUzOm`ZuU+^c*?G&-_F$#LBgaYr8yLz)#ZfmZ
zMLQLRTooAJTJ@@uSHfi#82q9V4OaQ&O{qkg{j7q6?byZ}@jB9DWV2y8-Ldb0W#zkV
zgsoCz)nRl?4`bfmZ~5U>^aDre2j8+r;U<wtkIudNg>#$Fx-#&1&oi=l8fEsJ*<vQW
zvkZ{rqu?jLHK6G4bDt%9KIN=-8BSY{eaf?r!7wlPp1*&^UhN$p?!8KQ1cjbziio^R
zG~fmpp589;tO_kz6q7GX-VV8EJp%>7KT8!8v?jM3J57t(_o-Y9xn)r^DcaV-WfX1O
z3a#vR&r~(W!FcdI><{VVc3Z06!`<4_saUG5oq7_B=+AlbnRosd_oHBnX7xLt{w+BF
z!+`!BS3m!AI-N%S%lY3!Jl6BSWbn;Xz`dV#U$Yu)B4EexdhStTrf3?GKS<<HM*$D;
z63+2Ykj=nO|E^05|04#e5+U^;lX2+rZ5qR#UT8u|bSZm7pUB#GVvjJ5!dci4M?zUA
zm)ba!cv$Na*bVnDNr!0J&*@I=yzbH)M-ZjvXpljZzs~D@7R}L3CLH<R<W4YPLn^{~
z9rCNu>*$eMQo771us55>JlGF%&-I;py$LVAeLM^%{^MJvZ+wy0KffotLeKWZ#yT|6
z__vRfi@D;=G6ju;r`wE9ldTfWM5AUdn^2aDJJHSAa<>{=kNbfaKHkE=ZdC&E!%F-}
zzu(#b*^T&C|Hr*wdD_a|!&g5s^36xL{3+h(#$(hlLRYcTb&*WC!A3qfCtLKdd$NUX
z;otPHdjhbzeAO2lH)u=zX#*|bf=cG{=;IM8C)Mt|eFF}DR}<sSkFNowJP2vY+{Tuk
zJO<6+@s@yi;}$dssxRT9W-?G6{jdvwy?~Lu^f^EtgLe)ZMZ6K{oC8XB2#h<h5Gp>0
zsXFMib_Pysr#q-On}fkltM0Xj_12)}4qe|L4&2VL-e?T(3eSYiL2ZvP?p6*Y-@gP%
zULqtf0g{(50g~PJ_x0AxmixWCxA*-^xAQ$f^8GT9ybKYLGrXNCm><mpGS@gl_V1R-
zn8Nfnoc)AFkIucL_ixaOmp{$k9vr<m+<#{zBwPdwrsWbNR05viaL{hJ{m!7#@LL_n
z?+)E&tJU^<{=jYb8_iDF+vzxs`l^run9^jHtdArbibQ}o$IS4!Ce!e4-H5C`-wLju
za<<2PW6Jls92C<Sdw&8|H@48`q{uvnT}hlKbBcv+U6MFTz4_>(G(JUhw;W#DbY2!M
zjlqTTVCVA$J)U*GG?M&I?nn(24C~i)9-oWX%**@G%lpt@kyInv5hc{xs&Cbt5+uW-
z_>ar~X`F05Virm!IO0-B!kf$ZMm{ZtHjymn3#qvbwz0w(TaRf}AD6-Qad`3gq<~F0
zZiXYAhL)kEJkUf~c7lI+3~-jf6qBn;SEZPTCz&L23x(@^hPE=|Evu@*i82XBeAbkw
z3!gg@pyesDq-ekZDqIiFCyCUxt@3Z58;20DKJ2R|Gd8EJLS!bNgCaFSpZeGz(Mc$K
z`8-#dsYqS&<#X1pXhpEH>Iarr&8b&1WYe@E8<Daspf+g3`DpL;-iu>-YmK%DslU57
z93r&*m;kRMsQ5l2hdx}Zsd4N@lE#i)7zJl&oaM||4m;lB<E_Wt#~Z31uiY*XJ)C6e
z+%+pmy6CV7!hkYZR}j?cMEi3f1D@qY^9eu5o1FtMamTrNgttsF?(HZT>-oMoNQ!^m
zXztapXpM?0F~0H1KWwwi9r^G%6u=D1hIhk<`{&UHcM!7R+u&=5`4dZ^Afvvj9!WBu
zss~kg-0olb{W-sm0!VFIOtBgfV}**n5$si@->6End=G$pW}(J_SFRp!)sb8B9R!HE
zN2Bo4A6S(;3!u?D0gX7IJlhs7y!Qq1i1dzif=w-Iuse^pnDVE4AGnOh;YWXce1fel
zz=1t}z4!gG^6&bQ`UK=02a~m-CE806`$Q_#eF5%Wtru|b>fQnW<#2EJC0R@8w^xS;
z@85B6`{%C@Ui>K1XJnNaHC4gYSrpEv;)Vo^*%_;{H$NU7LxXQ@%TqquS7>(toO#_N
z_$`M2s*h<Ew`6Ca3vNaNKbeStG}g){HJQ5M3w4jvD2u3Y6X#^A6pxVvmg>U{&jZ^$
zNGwAGqA0YH{0sl}Glco>&V&&ocVE=WLnDu5-)ST($H9F-%1cE?TsZY2erb@@4erlY
zqZ0#+-cyq;C<}gpjkTho%g?7l<$ApF4`x@}W_%syCeDpYjtRCLgwA3Cz^@Ql#lYK8
zx!6Rxg{3X=DM5>j0J<6Kzo^0`*56fy8d0EFa)lE=fyoMU+7c+JQQ%E5K72rT#1%7o
zDB||9{&*l>J#jY50A4V}d;lk5Jnx^25y&4u9j*71i%EDXfciY~qTSMC5B}@X>@10y
zu$sX(8HVkFQ7d$Nvmtz=A}rLk#EwE%6cjtqU<t(O-V++R7|eDn-v4=Y@RqJsL_r@z
z7Gyl1AK|63F<umtr(>|46b2?FjxgKF*g7G6jxK?4N&|vqJbq8i1K84B=5fj>Bm(UN
z>-2|HcN@5)oq<qRT7l7{#O95p&^9KL;(>qB7kGfSkm-D;-r`axcy?z+Xlw&uFdR>8
z8?XLvaX8r~viQ~ltnvYX+G4eq-+-SEXg%8vzXrc^0O4=nsh?CfwpfK#Hk2Vtj*IG0
z8PLMyP69uHn{~ra<0WWr8!m}5-%)bN2e7ZyFnN4a0e<i*&sfE)0A%n-5C7;@ZVek9
zH7Tq$qOonPy2X^gdbc*bJl3-z&>zQVQ?Gx4t0JRcxId8fgo|TAKHeM)QF$AGJgILx
zS!j8cbM~#gQK>%Y)`h!l7^g?F)j?<-SZv{(ZEp)=Zx1n5%j`+z-|FsFWlOw7Pv9q_
zp{-ye3yp1)F6en~BU-=L81}l#<CUY~#6R;WJ~vFMc5?+<)|`5`+j5+?+v#-Le>JiW
z8bf;O$y1K3C~4*s{w|0x&NdpBhoEUp`o7&!gA>XFG;glHodlz;>u-%4f+;zByp)&y
z?tK9D>jXaca;oNyqqpSH)fBXOn<SY%nBP;-s6psD?Jd@uOWPSQV{0a*%NC1663Y_E
zu=g99^Ui6(82CPF@zZOl(Vxe_w6@li?z7?EJ_~*WAn5`*=MN0A8Ts2++gBLG1TP7Q
z1rg~WS%_cDx3v^Z2EoT*fcfZXQHlYd%SmP=vZR2zPw<xb;~1d1)~QabAsKc<9vm%?
zHvn9Pk2tiF9@#p4Z}udzG?#qZzAF3(|GP$eKm2~ZsNm9tSE^8=B9MCQT?OO$n4CKK
z3JgQ@Y{@Rlbp@(8jphi$A6!9?BJ^30c|A0yp=iPhH3`}EiU3%~2s)0#E$Vnk26kj<
zbgJRU2%HtU*_-q>oY53W9QX}{-Ku~<CqN5mAYc19m-EX`L;6a8wXE96j_Wy{ZoLIR
zcXk~5`G>yg*YSdqb;HY*aiD$dP0$mb-~S<VMlZkstd><r(7Arq;S1dmDd9TJPIITx
zZgxP&>+w6B=l&IpA8fY0QC!*hN8W(duZBuPpqhfj)!(`Q-EcwQwJXKTbv6sR90nz1
zgOX#^oJtCD@^zz36Dg2MQ!FPZMsA&^+iiB+9k<)66yv9YW@9?r@csmYix<g)Niaqg
z07sM!=aW9aN(=*DFuqWFdltgaC!A7FK1Hx-4{xBAD|r=0Pn<26$~G31<wdueTRU5z
z95mdmc5};dcc`x0YLzC%u5d9Efi7UbJwl<1W(&0TEOvthab?yj^o-^HK>KfBvF~5M
zKl*_?yCsfpBj1a7u$9Da2UD-4#~Z%?D2=77c$}GbQIVat`q9#nuWE9UfEV`F^ElOh
zvrbh@0+ef2u=`b+wB0@W^{tk+x<r%^!yF>;8in2f%|JBrYO*!cT+D9R2kAvb*jI$*
z=QJFi@}MuLVr-v5&zlt-FA662#vg~#^~njl%^@rFa6QT1nke62L2ni^vb|sSkB*OU
zPvTAFEoQ^hQL?FR7b2<UeC<>;mo<Tt2=(N-9lzu6c+Ezq?)EzMW_!>aw!KcjKWz2d
z^}auB_qx47w`@UAvWR0CF9cSv4|ZSblTO~;N#<NIQKlfxYow!!BKctH3Cus(dF3(w
z<qsZLPO|0Ytmw5GO?RhVZ##o#uj@B4<9WT)b{f5It6y)!|Lac6^LJ#>Yji>>TZMP8
z5~8v%Zf%B>nSVu&JLHA~uY|VFU3u`Hbz(n1^YOZ8ME329ak#b2`GEB3fjOvh1P|4W
z6H_<^gLoOTGuSl+42rV}0}0K3$D(Y;<{;%hG0%hl!+)PXX(A&3yhxlYjD4IQvFY&w
zbx)Q=%P~7n%}yzBW%1F5=;+|^n4d0*+`RmpVtS4VKx$$fNSf)4>QByKTABk?NN^d}
z%E@|_+Nc*ss!JVanSY!TFqwLFXs`hdJ6Wur|H{6>vyz!NnSCcYPGv7bE4|CI3@&$K
zp7L1tt{-nbKDFSzo^jVHM2Cv6_Kw#|qt%h#66YU}lHX3BZCXija|=Dek3Jo$DoFB9
zK=3)Bn?KnwLcLW?F>9a9vif6k>N17vqDt?APoF&YclHLw9H?#~ZzVC+d5x~u@cowG
z?lpV$K?5|(-q0U*TOd|<x^-_j*r|8wT?Shl*B$J*^@igOJI!vR@76($@jwm_>K(t|
z9C`z9#~tc<kw#$;1V7#S5HWahQN{V|p($tJ_eUNM@);H6XF<J@wgA~r552-8!@a}9
zO_3LgXEX5neT<m3DLUF*1SK>#%Y$;W06Onmr@kCy!ZpGM*D*z|o?r|n<Quu@zTA6p
zc)I`n>8oS&Bn)F<p9aIzvzgUtRCs0TSKh_T#G7=HGifj+2`#J5&?YCw1f5<@(;XC-
zMZaU>rVLfevplF!AU-)@U}&~7P2?k@LTWodY-yx5q9q#f2x;)E3i;{8P)*hSSEyht
z{e0bn|LMA?u|i`F6zA^_VXuNYkUnDe!bC9^zK|v-qf+K%L|bA20R8`bn=5WlHd1+}
z)^=B_t#1Z76!ed4**ln+5{kHk=wSp=f1utdTY#X(nF@T^%o8zfQty!*OjJVvC^>~R
zd6*6x_t~Lae%#U`l%5wUG4XkUMxH|vX0{<wH}bs;xlt0gLi-oRmz8*MA&>51^)Q(p
zZLPSMJjncb3P{hV+~6FB(`}t_7!(3U*y#Yzc#sUIyl#qbUO=t<{e2ah%~OCXSf!%v
z60R(=akWk()vq9HL--K0c?>)EG40Y%VH<Kn&AQD^y85g()gOhi>JEiY49Q(B$9~QT
zi+Z0&@V$%z3?xOC-Q9!laYzxi8fEp2N8U%@uz`^&!pjT$%B3e&zV_psGU2cW*wvyz
zuQr9w#<&lkgi7Iz4@w2<B}1`Q0jw$+4-{Lq>=53q#-$g`PGQ7PG5;e4USutt<aJ|+
zVf+Bg)5s_Co(7Xspg4tJrX0PRzfd;QDo-7Nqahj)=bjYE--kbWu<I8GZ@=Gv#g1Ta
zpp$*uW}ec9fCjdf4zxa2^cBzg+|G6#{^uAQc-k3<pxK5)+t&Mx>k2297AGMKC%#!J
zWmcENyO>=NV3Vow<^bMAlDw>Y5Xm%zAb>FE7rH`DC~PcWbScU;zluHe&OD)qqAbF3
z@M2L;X>hD0a+VRYMOzq-jV?tE=46>eV!^))r;IiUmYOlf%@B*RLMy(~B>t-~f9}<p
zvg-`ZAdJ8vlfpuQ{zc4c_T;eYBBN}twY!Pr21_ml-#S}Pi`+x-nvGgx3a~uhU|c)p
z#>MdBvA!;0U%CyRlS>U`od$*@zb!!0)EGoOxaaSWex*ooN{P(k#p7LhQ}lh~v6za8
zQmYc-QsRizzo7s2LJBZ05-H266owZVDvGzSHdQeKPAxegb}6=2@}Z@9|Lv<kih@Gu
zlqBIoP2yV9B7UZ6$>R=4vpJuysZv+_&Wp}Ia&ZhQqU~a5X)D#3zjWZWix-O7fHkvP
z6EuNWthh0kl38cm`HfP{DOawj)c7nlJ@UZP!lt^oQRT*g9!ob3cp>i^kR1?yyC(nP
zgsSXG5XW<$J#sqj=7!}M#%A*fEbp$qHNwa0Hiyw;yg*I&%yf%EBD6?gWvma}y)~H7
z$?ervkZ*1<`;5dbG12Rma0$BFu-@a<9G1l;_oS+R%RLh&rO8?%!2+gNV2%Tt4|5vK
zX;Rp*Hgh`6*<nr>c2~@WI<UQmU4E0fE#|hF+hOhwbGw+1yy370G}&N{CTp}<qs<x}
z*4SZ<E^F3V(_u}QHKE5QYqnUk&6*w7++ocwuB0u8wOrO}uoeK+Vy!l7by#bMwYscb
zXKjbIUDj@}c9XRM-ZpD@SbK-HyR1`Z9fx&X)@iU#lXY6G1L$;EXNPsVY^Tn49Jb@K
zod(-!vYi&&X|o-`c8BeBS+~x*4(qzC+hE-$>$X_8&AJ`d1!8oW8E5G&cVbU(YlFVz
z_XGNkN+jIqI6I5EQSu(YTK+8nQ|~z4uG?yMn)PniF$!lk1Q_$OvPHE`rya|F?kuTd
z<pr~I-K@cnSn<rv3rKGi{`@BXX_gf{Mq7#+8T8008vk+JdZXKRoMxldahlzRTi<aj
zi>3j`m$zYOeoLzw(!xz7@#_V_!+0dXB*KAkkw;u9EO5#IJ56`PViQhKmk^6k^8io{
zW?in07$Xq8O|DQ-+)l0+_WT6EOgM7x@HrWfa|WJj`naoRv@9inb{pL?oGSf2>*!W*
z_w-a{5Gba2@zcW}j>Vx}Fa73~QoM&h`U~sq{qk=Aa8K5%FDjn&unt%>GqL0-Jx)4z
zCQ1&|MFa>;`8>sxco+~qJ%FELWYBDc^r9OoxmY9zOInGd2wv$y#3co$=Tm#rV%OxW
z@ZsLky9TVqQ`3G4${PhQI2{DQc^~MfILa6X{z#<zIkDH_hh6kjE39lekGL})L4^Fs
z0g<`4gdV0a@(+8jUmq|v((yTVd5#lR>BF{(KL_c7N(h$CwJ2ihT@7aySURZT5DFt7
z5l<-gz!tqw(9$J8PC-@l{<Z<6?w~MmI`GkxhIx08bFhFNSXZ^<EQv`;5ZwC#fg<VH
zi0Q6QOvw-KA52~?64D<?UYhh@!7PV~MVm*DVWLeDRWlAIeLwYnra4Elj0Y{6eDYuj
zV1iuW56oZoh!#T+Yk733bo;C2!gL-7V}F1XSuwz-w|8-&!@gks>RmJ8%=F{_>(`k>
zloA$<LVHLmC{xRY9{j_{3;Ss?zDITo_Q;D24C*G3voxZb?STCQ=E5t~MJUSv#Y%w%
zg#4F8m_SNifLmU=ceuU1ZD)uN9JUiyd3W&km6rGJPNRWGc@uFdBla0x4}Opl5+RU4
zLy?ZWPc}r%7N@|Hg#Rg}_~q;2hB?H`8v#ugAlqN6(HGeMUXWgg9Vu=ubV5Y4R2Xh;
zX1=A_E{E^dgl#EHXD+r0hvhq)=J2vf4{33_O^of5b-2YRhfJF(g99r^NHLV6Do5C7
zjKCo|E994uWUSf&#g`y<zlVvTteG*LK%ar8KY`At!PJL+fWPrfDdKDkU)6;ZrJ@~V
zy4yr?4fx)C$SRwSe@6eD{IlA`f3Ru(XM<iZ?1UF~@Si&VNJn0HCGb8Rr4OvE7sYYq
zhVv>E*Iske=D*flUJtUL_f#%3Z@<!K8me5fv5d|n8$uY&X>XAq9G?P70Q2sG?f}kE
zS(?ZE<~}XzxO9uO3i>9z)bb~lM#TuZ#KDQ$PBNVV3PigIpO~Nc$yB{;;LW_$8u7;|
zX$y{*EIOQebhJh-E~%(Y#Qgg2-y(%}pTEvcV6;T{TJGX!>;f<PlFm*eDb8t;6EJNS
z>GDF|=PJFtF&oT8GYEPt(jQ|%HT&?<5ATm(9{l{4y*)VE{b`T%LfQ^^q?xKSz?)oO
zde{1i^l{Rt448;6QhbU`aQB0PiVkpuA9&)9zrD^OI-k$zp6?`#y^l)Z%SY^ua>AW}
ziq|bUi<@mN;Om0CQ^4nw#1nRiHac}cVMt+q`yLeSj|X_PjR7l?#7f1REHo}DY0<M4
zOz#{zPLuuMGG`W`CJ@ybt2{}L*X4;jrq|YQxLX$tt&#KqEw2rHmc5g}iKqR^{jZ<<
z!%&Q=Xn=_Uh%pEXw~Nj$Lq=W|Nz2t}R<U65h#gFPZjF#}kN91E&dI`=5xs_GQ`rmT
zk1!rLbo`99J5IYf>^B=juiJ5ko%V3xc%JWj!*;#z^qtPmz-{ex+L<QuLSAypW#ywD
zD)%4SdNBznbUBHZ4P8j4gtgN_i3}#Z9J4pG6>NtsZ{Rz1uifo-T7I|Q=(h*;PS2_P
zUbES6H+I~{j^ni~ypZd*uOpU)9@yEnvc(I|1I$afLO8&TJ-Qv0ST}MQA;K%V($VKb
z9DQVU*oeoo6Zr=kd9!(_%IanE`4D42Q8@BN{$K3zmi_(jIi=ORaW|VBms3<oPI>6*
zXY(ltn-2s%-HcOa;Yk+U+}Vtess<);iW0g76AGmu+Rsk#+r?A&ZFos$1sUpI##Ty)
zX^T%qG6zD5f@zyweiCs4LZ7Y%4Cf;eek6TiX(<sAur!d&P)>yeq}e&Yc*5e<xU%w~
z<Rn!ZE;;pV^QUPYoBae?S|bx;4kTH&*yF3m%2NNh`8aQMmYx*EzT~gLXGJrMdkN0n
z6ZTQoL{sM#m*Yv?@5gE{k5}T~!*p&@f=I3$$#i@SPyBi87di$J@f6=3yvw6gSyfs-
zs4Md@yq+b>abb95^<<SIqN)C<wx|G$D!H~wD6c&`n)V%=ika@eBcIiHiTh9>ncy#(
z!(4xPCk~?le(XKw4##}GK~W<X8@_2KwbL8>oDt!#YdSYX-5AxykN)Uda-|O1V`}Sh
z2IPfYt5DmV^<HwDQ9hif<)l~E4Q~G(1`%dz5b+^#*vN{UyL_TcR91*drUboo7V?wH
z<YoZ-4$u;pjZ6(7IT=ZIdbu1=^3bpQZl~GuyjBwgVXsy1?bIF5t#@}Cy-vLYlF}bG
z`u=(wGCe%jAo-lTNj~SEBp=<85PCjO2_VAebB0dVisWugKA)5nQi+F*1ON2A$f?*)
z{>?fV^S*)}_9aSlU-`<_QVo{@Lp1!!Qq+tt|Ai!0lB_n3_y%(jocZxg%6#qJDpTtX
zN%Wdn`k_6HVxd_7gc6`mitWWyO#h9H1WOqL^upmsR2(qw+>P!{p67b685EY=Kbezy
zg?-a9qg#HzwAQ^+E@P~|M^XpfpgnmPZ6{*%RPIQgZ1AwLJz>^By_<|5=toP3B-zo(
zktG@9>SK^27zEgh9$OSSZD(!+>>mcX)DwoAH6qBKxEo6#c^9ai9I%00r`T8)SS|%@
z9c4jYF3<=*E2Tk+bddR<hkNf{pYFbXZPnO|)19nhwo9GT1Z6i#9&u{n2$4VIWOFgS
zL6E^b!;AjpCd8BRkzNy<6utws7IR7tbse|SY^^}lEP?hpZkxlAmqyo42}Ax<e8olY
zkx1W%%8>Y)$9?K!Z{x+0md$b@t(KuvR?=XwamOxY@|gAQ!P~u3ZDSB~ce%EA556ze
zG-fVnEZMYmj%Az1JQ7W_Y2=#K*GXE{Y<D^Eh~SnP7L^6-+X2m2+J*KNlaHe4&%(S_
zPWuy2VR&#V-pDzu-aK5u?3}ck;Ou;cfjYHXC2yw~J?)Zw@g|JlzN0u+T<~l`ZNz0D
z!65s%UCxOsRm;Ew<khdsWackL5unpLiXg!6z5`@<@GEWZ%A_`DEWbVU;l5=XEuPxt
z{7rr$y;#DXWZ>=niQrAb2zV4ipjR-G?@7<6RB=A#hKrLlDtP%8)ax-f{FNBidlI*J
zc>8!ueNS&TGSN~p0!QI<WOJ;R+#I`$WJ(+3n=)aHpjXR?C3IxK%M+<@7FYIr{_N8C
zCvvNzkUd`o=RX(jyV5OJ;ts$CMH0-gIK6!S*Tq}D2}q0h8Sl=&0?a1f=vjObOf#;x
zq#h*oc#R}0H^v6dq&TqSvKSwHlEZiY?Voj-YCiXbT+53>+h*$c%umE$&hftN;eHzb
zXI&z9e~qsXcI4Lo^_O@^Hq~OfT=^7PIDR^x1hc2pc`u&#wrBm(-TT0GpxtibzfPxB
zSO3KfA@x?f^}n2^<F;F^4yf_}3%<II#{XjVyLY|#nd8i7?0?OB^T}*pP;SBZKj~wY
zdwlRg=*=)RydmN$@8-RyNAUUG{@YjTI?9jGoDxwFpm~saJ#+wo^5}ryKldgRKRptD
z#C|3pv!v*NJ1<RYpZq9fqIgU&Q2ctj9ws5f+bZcfF?FIj*(ProUE<U+z>LBU9gsQ3
z30d;lwSLC4?GlLL$@?Y0wx-k=Y;jzKR{Wciq6nP`i?B(+YFNRdSNee-9hp@Hrd5Fw
z|Ce9!f&sso;sv%F9DDi=lXNrFpRw}p{qxuRM?XA0djA}K6rb<0o)-uGcqzV6h?7zf
zO`ezONSjidJGtTx<d%If=zfEh9IEQx=3L{U;9$V#K#Ft5%hMWBwz$h^rOhdRGxp=y
zJM-0+Z>^(~UrqF&S5ru(vK!eKFp(SiBKldXWq6a*D93lW{&2)u8cXhMHWqiM&FN*w
z(_Igqnc@ka3c!6z>5Zu!iM!*xdAML2(Z+=)0B>eBK}!YQ5;M=3Re5tNZ#HFXxC?5y
z%aMK^6H2S*W?8N5$ca~O`N8Do*7tAq;YFw3BpKvN<C~F%tWhit>1X3Mf6cnDd9qaT
zhAe*9X_eA@M&ZJwxKQ$?hsHVD%CyJ)Cq=XuKi9M#EuIf|rJc&HBzRHzQq(cI#H@jM
zbzp%yK%W)fBGDxKeLlasU7whJcW>&-6oU^(lVWvcYC&^*6A|6sEX5yKeu*U+8(w0@
zqE|!t($M%~aI_k~&#x8~znMz*=9E!7C?oWf+C)(m{gsrdMPrI1YGvL0(KPA3-qBnO
z0dze}&>(LD+euK!&`XlQ<hiu?JqU$AT=~jK2$Z(@w6xT57uCrqVB08c%dr)2*{HSD
z%q(c(0W`CBrfT-?p>#9rz&e5wuK2g1jap`6mDSO<&x0k^w54k_lp1%RhYzoD<jHLz
zI8p7OvA8R4Z{NQG+~oCC5f&)kqH`1OD;2XRkDON9+0avPNK4#&jQ@B&%xXQ9CK~*+
zjxY55MA+NA-Qzgv4n=vIG<-e@exIkS+C9rQyd4txzS%1s4B;9}_g~Rz4x>t@Ja3E&
zn&~zxIiKC)&rlmiv#55@`?RTCkVfPZI6tUk0B_6jLjIgJznB5k1&20RRZ}~(@qH6q
zF-3v_B~yX64q0W{$Kb30D&{Ug`D*QL-a_Y^3IHnlrS?2p;iZ<HRGrMJzg8iJBcuK;
zY`ffdi<@lK;Zm>33Ij382h9YI-gt5sD}w{c1|p5Sl-IVm+z`#PaR$O_DBYF#g-Zf3
zbt5;T=nFHs-lyGGt^tr1;hE}9JG2yT+C;g*gaqabc|rTpBle?z&4a;V%$ymWM+Zac
zmPMyp>L4Yh)nf58Bs!q#qg&U7wTLd8l{@uR>bfRt)dUzn?yh4ln)7N?i-#`KsQ^DO
zV*X8bdMY9OkM8N|Gpq;o?K7x|%gYgvh;TOo?tP8~B-n_6qV8G=h*$q55$W#bMZjYW
zaFQ&|f}bS`OY-0!ISy)A$*~t-tW1A3G(L}2oef*}K!Xx7x;iL8P_75!VxS963OnP^
zwvsp&<i1DM(o4D#2Eaff4RT_m6%4$9fdIPO=&Lxbj|F&^hml-Su<-I@fA$9rvwt-W
zB2sr0e{jxzY7&xVCMj?7ZX=a~wMsiWJb=sHfDy!4AIA_s--%uRAW@Mc6e1Sof1t?o
z8g!rI#9tDo=<YB@>xU_v-W8-|u-3=ybZ_DgydGy*UCrQdZ_+Z8;Z^+@`D5|%%3kM+
zU9(S%YLp*eN;U$m-<40++76(!J}&umS2p>SVUte}!6%>im=pL8u!_ri>Q_GOpG;0s
zYc+sbn!qkCjbZFH%a0IM{IrIlUUNfhWf}@9eix=W&oB)(dGAbfPN`*hXLRG&!7OEJ
zXuxy4d)>R%%G6gNI@La3aodz_h(oo$0px1lK#t*)SrnifHNK%Q8%vu3u8a{?mDu|l
z&M7qPUvV9}URU(!((ykdez_^89CoE+fBvXms^A3s_rEO+_qkB(9;{c{HOIK;^)Jq%
za6b8q4DugK+>Zf;5LwOSu;<&0kG(6N1++E|M?wD@jmKEGHj3s-4GQf$=-oT%?K@W+
zysHe0pkVH><n&a()40)Bkx%f|-tkk+DJU&>jP4UJJC<iZ?&aVPUv4qU$7BHf`ypxT
zEVr!_=H#HC)Avnv6rX>(@}Z*~7}5gw3yES!*8$l5@t%9$%k6npoIkUxLwWaqM&8Vy
z^sj5<5dI3IJ6!}SzW-Biwi?F$AJ?h3T3_z}Jj7$Y|6>e(dI9JWJEE=g>^$=0^AK;5
z2WOzHPr^C;gU6E}!(hPT={yR;dCWvZVj<&3Vm%nO-cv1YScZ>|l13=gy%tOxf9hSZ
zQFwNixnU`;R*o=)bA3C_VkA;>syR8$!p&t0w+vxH*LNj==b#GW5+ls#C+xd#nJqi|
z>)qqMw=aHWKkOeJ9~}OQ*?*^VN|Y8}n8Clt!GyW3y8h0Cou~3nMm*-LP!T}7HaY?v
zg0l&$@`{upMO4+wVVL8;Ri8bZgs0-OEzWUruUqyG*jEw!zyF;j@4mrz-c??NCh83n
zp<_LD9MTVfyZM2$Sv)%>465|=A3TNpK;{&i_*XnJkD+E;2L}H=I?f%JTzccb7>ucq
z%=8nJn`s0`#I#xoIn(m~@2nz*vT}Qu5kexu=l~C~ztec&xU^gK+x#j7D{OG8389O|
zum=RXC_`yE1)gFSD$u3KFOz3h6Nk%)IE=tBnD{DA$@CkI{K*+qvao$`1Z$pm!Z&87
zhNI0~5<IfJQrrsj%YzpHGhX=~%=@s5qx3?YSF8|<P+3_x2Vo!J1o*xy?2l6hXprW>
zOO0;U9u35l4swb~#?8wyD?ve3m!I$mVT=caX&AzOI2uuC#QgLO1*<{94n^iI_C{ww
zOKct+<M}0d6biZBHs33F7bUr6-x@J1cmjkc0sAH!N^`@O(oqWy;SC09Mui|7h7bD-
zzBVFS>WLB^Hooo!XBdE?N(iZYS}_Po31u;`*)Hs+i$O0AJ}r^51UtI)Vhj=`_QVA?
z3wh_Bm#p=#`y-#ngEM%pKsM~XekVPu&{9I-Y~~Z0n2m)~+LT$6Kt@cqaqf?%?CR<&
zH!46Si3$KaSs6wojF_6;5!pU*72d4;$wCC=>Hi@ti+9ud)2CSfcU!H7Yu^8_x7;uK
z|3f^v(JL{92dh+Wnb;E$L!>(aA#*{L^!-zm0P{#&fzj_bpnyD-D3|WDqfZG<;&_hX
z1P8E6jKV3-8wMMOX&C!TJ`$1r6<VguC4M|Jm6jo<GNELzihQ~OWh^T+D5**fv?wJF
zNhExHM5e#l_0*@h^E{@Vj?2$76O+djLnn|3VGA&Kbx6sY=^B_Hfqn|&OB1@^htcyh
zqN&Xt2S3nhFS(=^6`%{ph81mm?T@FkYm~q@x0!D|;|qP{Dok(G^VDME*a|7d54`Hy
zS-<(&t?P$j#^*+zsR3*d@UO(s9Q-H;g;**cg_kOs1xtDT{yYNmiDeu(CF1rqzGkaS
zx$!MUO6uUl`KM1fuz)%YNrWcP={cnjnMNi%ans)S@Biz+&?Vo;Wq>Q3l#~fWN{m=l
zHkcPe9+=S*Ll-%R1B|y0ZmOs^R8!#L742REn_4bg#-3q;M8_+xF=Co`H-+fLS~E4X
zQo-ET&%&9E4uyvm)^apHSP%nqVQYEds>I-Fh^aWk%J!!5(RT&vlihe^-(Y{Iu=Xm#
zfC}Q}w4$xX^H(SvR7~<`tEqP?+%5hj9|0|^Sno_LlixVEB=A^y%ImY_q!`1Z)^({S
z;(kwXe?eKvDMJ0r=T@bM$E-{gUrlZr)Wa~C+_Z_iTczzyZ32T18N=wB8%pF8%nfGE
zhm@J$phSgJ%iLDp-)86O%?ol|S0F$b2f=U%avjzanzKTr^H_v}v^Jj2j%-3aO1b?4
z#Kp+JdI@dPVF;^o;H*qIn2)FILqGmVzeHJnCohY0&siK2JBKOEhE6$#3!5YQQ_rxG
ztEM%Jq|T`&uzq2rZW=oOav>G)fh}=N(XNv*<oU>9&G!d?%SP@_>--wd$x%9(Q2qwK
zfM140e2N70bT*zo#R~=aW^;RXHB&D5nD7n<>_a&9jam-YVwVM=SD|7Ri&~4&*%6jm
zvR}7czk<jMx-J;l>@sE8Z1gb9_z1CsMwfw@44m1Jx41U+lrt-(>54J@=fB%$oU-fB
z35;&3)B`1pLQ!K_Q1f#lTGKKt%AHd(xTuXbUnW(-qynNXKc_^chn`ZR+s|u8>EE;k
zeeaid`-gi+#*)RJ#1n5CpM&Q0wM^ej-uOc_LJ4l)(2Z&qRVAyN2s;s(%+>dXR%2a+
zu({cc(#+yNSNhE_A67SLJwnqkeEp7f>vgj9<6qx=%U5;vB-T2!i)VD+OkMz)yA)(x
zdj)i=esVL-Nz(V&Moo!${6yX)FFQu6P}Gt~<dj(;IOU+D37U4bWyYTTVXpD`t!}MI
z{(c2bdiYt8_ybHE(9&Wbt&Q=?*9}fwWn=v&7y*g-ci4GHfv4WI<h@Pp7)Uec^h)Zq
z>PL>plp|7v%hZm{G{I(?p!39r4-a&#V|B>KpJH~So?4QlAF-c(iZqL61WNvl;#X29
zIbG$+&!=G=U<CS@p($gFk$vVeh}9dOD8XOuJ%9g-y*}7|iJU2Im}Bpn9AYq3vKP$)
zZ$#2$TdBM|p(cSkqd8ASC1a1zLO#i$^&zET5&lFJp>d1F0p{Ppl(<T3z@Pj~fbf2@
zA@Xv;rrNvaIgZ5*RM50#FnwzL$%b;bNG2A}9>JEE0_mYu?)=Yd<vO<&$7seaYUWdJ
zGp^B0qo|qbdXSo~39IR<XywU0A<48Yr;MbWNt$!>ZvWlh>;1PBLsOb>p1@4uNnpr2
zC-1c(r{STJ4}3dfz&#r|Th-Ypw&`(P(SU`7N<4cOgHV81lw?QAw?o->bfu#(gD*9?
zL|fWlLrz1qZC0_N8mN9Dso}!%Rhz*MJ|6Mgef*u)0O>(BOjvt43MQhJiZC&B{~7&r
zqU(;ddQmCu^_kDrDOXpNY!)ziG*@8!!WzG;Moskt9@kZ{iRw*oi~nYoTcIuej))xN
zo#bcGa}_FP@yVq@_4o2%rTx81`dhuL+dP7=gS5#&G3>wKvwpm&l7OG2$`fpEe5#7$
zRXne>+dgpEKG533ai$6u<401$Eg(vwm+OVhT~?}jYnt2cyLWqUUy2xTrpu7-fJ}-Y
zNIEgX!g2LPHJY-2>PYCNVMtCgCRXUPK>_aC_|vJ^^TFG~j8;BIBd3||4=e{2WSzpp
zo7)0Rbg1mFQ)-UHTS^*gF%YK)<~uco1LQKtwc(GpW5cCOT9*|>rOCgnxu0A*=0kH9
z+mdJI&9H@{3!pGe_D&rZL94Z15C=i3LOqM&LX^15e$Tr5RI#1EeJkmFb&>}nQZdb0
z`55ax288D#>1l4F%B;2C+}X+=bi1+)+QDA?XaUEic%GcJcp~V^%jYur*bFZo2Q!5!
zzJLAx=m*`zO?t!p$~^ocb9c93!zCFK>!uzL**2Ua=aYg)ZYj`|#?tTn2#+lR(;;x^
zh|$3$W+^6WDEPx7JqTjWu`K`Wz<$U^9dh>|Y&METBpb|FIP-OJC%^c@_YCUR_`7T&
zP$c>nJa1S|XrB*}bS<h-|9XUV(aeXWL6ohTYXs6o1mXFXVd@0~9-|z&*MIxgESXP?
zHwSO`(Nil!4SwNa@qGtOlq@`za>$S*S!R`k9~EO6f3IF-%&jNrXBM1<2I2?YeI`TE
zeEca3QxNyP2sW2*-oHNHw=o7~)Hb9&=ruKud0#27b!?I|C;!Ut>nBadsO|l-_aX_n
zM?g@L4Jj{jftQi~EfA-7PDGrfnv(%k*_e{v3^Vf5f1C}t1lv+XVNSVRJh34bd+01t
za7A83^f@M3o{7v|7U;eH2%96Bh(8>Z1mDGeKY~8K{ts`Y#t6XHL@8b(cRFITm*=53
z4o-N5?BJEE3$wukju2Sp<;^jCMK~Q^QUbxqr#pwRM$z=b%bqY!0qn+LYv=c2mzL`t
zC_GZ^AJGPee2Il>WK~G4LP>>bIGv+k8Ee+NZD>hTSu6*&hNGNgz2p~T*QdPpX)rmJ
zt{~(tscN9Po^!k|%*BC-2M81;$K+t_t3Gt<tR#+e*hhz5xa^~=@beEyUUKJBz2i99
zbEQaSQ`CU9>lxc|y6$ErJ^T3K_~>}|_=t5=*@v@&U0{^3T9<tQE#Z^~@pKAE)D>AS
z4K`mDLMWI*8jjF4hcbDkoPmt7rL=*7Vwq`p$vyDUQbx{s$cHe#J6jC4{sH-CBR=MA
zZLp6GlN>A1g606iNAem6zkfOlW>EbGNRgxnR!=4>PqEa~Dtv$19}jT%RbiE=a*`Ak
zZ_`~8@SWS_-;IL^ks_ojsw_7n-*LJ!4lrp^F_R9IhBFsdAgc^agxA3Yl$}dHPP4~Q
z$BW7OccuWJ+P+8ETv>n;;V4#3j7Jy2lu5T;>>S1muk^tNVLm0@FmbHZqtAsg+GK$R
z=cpc}{6?xTeEjxXRv{=WXm<LW?i{R5L3yL4KaXb^_1GUzN2>1@XBkD%RB-faM6#MJ
z4dX{w0&eIvbTOi{x0*K?M3g@zLg%&FD6WZL=ab-yTY7HEjRG34q5bt%SF|(CpfZ@u
z=^PABPIQZaCcp`@N^)0Ca*8@jEmPpB@Czj_veb6;+S&a_q4A9K*eMdja%iTMfHruk
z+yvHz7B#h>+!pe>H1ft~1}58T!5{!V(3<zGiX|=dbgiSoD_1o%%$ki7HB&O0wVTCU
zz#W3|D3x=<_U2R0wiXmxWt$Sd@WA!ko0fLk1|dQCz)l`0&Xq9M1DR-@ris?Mc(&e%
z1je<GUUXa0HPj67H=DAibU8)GR*@z6R`)rRMkbKMf3#<BxhK#6dmIktpt4Sbr+4oI
zwXja7m3RLWAJhLEzW*=Qx_j4)pMP=x@5SQ}Jb!VwivSDm|2oZ9!?^!jZ#Tc(|9y~$
z4)I{v`FOJr<Ws_3#!<!Q9Kk=voE2h>^-d};S?*6q;n}H-!*C;lR;!9HY=&URDD*Yh
z8ckWPpG3E2-^e92o((`<1XU(ag%v=kSzrawbl6@^u~2v4Z+H=eT-Rt-?GklY!j1cT
zqI}2CXn90aJL#^%s~<LksxeThlx`<1dq+1XKnyh?`#C|2ZLQRv5$oZO5x3OIg#+7#
zE29f(C2ZX05Q#Q*hM$TRNwKwS)y<OFfN4xXSC9;|a3uH^k4D@dRA|>+ag__KMGYMC
zIJpCMwEyb;(V>I8W@=Bg<CJVi0R#z!xrX%yfLecw+g!^(i{(Fhdg77A>TAFP`QK=_
zI%fQbmfQIv{~zL6O8zITKx@Dnr8K(MA49{>xS>JR05KeU6Mrj-rGtrHw~ce!1SE7u
zo}m>M1uZ{tllE9`{wsCPWF3CDS*vKf=$wLi_~!J;`{>IT$Kesxd$O^GpI!s1^3(TG
zIF=s?fraqb9C+B9YhFvUd&r|-6$x?%=2(1XYZ%tw86Krkk$yP6h8+uUrW|ds3a5__
zSTTWq@FoMij~>k@+}2${miwfLS~dm7@L7<J)X{69<|uSb_LN2BOxjiN5fgB7x!v5C
z+eJII_yUZ-ANsJ<?E63A**-ALxi^I#Kv_EHS&j=x#ZP4%w!6DqRHVmT_Wb#C%L=U)
zzVxP|L8`;Y|KP`4Yn%X$XQ&o0PaT!4BDx^(i#aQoR;U@psH<V#AR$693e(awOG!n!
z;04ze@PtXOd_LGaJj~;P7syM}Ka;1lM#lpoP%Y+I?$Qrcrh(=mtYPR);!8iO&B7Wi
z>maB>pKQ7szKYod0I-zjuiV^A@;93)u_aKTP-Ams9#L)o2Xl$h<2b#f#k(HDEFxu@
zV?-)=Fqv^b7wEF4Ih6M1(pfNOPrt!@QF#9I-P3OXbo_;`;zA2zrt?PPP^4H;Hv)K^
z4O1+}d&(Ajvq8`}oJW11))~-M49+1u(h{&h0)NAAw#Jb2^#bGs!`pnCH1aelb1xAE
z7VCfKVR#YWWBf0t*>2P`@xS2J7ya)6o~86Z&I+Xbk-C>?dvd$4YJ~jeZyHg6|BYIp
z=&PbAgB9b#!wH5-N@k4`?n@+NLL2YI=i=fixiO@F6O@)<0o;e{H}1pr8~X-xv2q8l
z-|`MBO2xgDk0lu)&1#Efnbtr~O>&Dr<zAD#<(k07#~5MES-yTsj!YA`R-%dl=|_Tk
zCOJgtGb6B8F(}YhZ4`!6BfOBL>^WX$*Xm*DD5YA#sRq<lT(SyLLUseO{*=up;#Vto
z(3v70k(QbU!DJZX8=47fGsa#=Y0+Mc1I1)}`6$~+#oMTHv`$z>wo+NC8A%^&Lxm*v
z!eMl2WgB^Bp7>p$M}~BUh2Q@12!0v&P}u?f7VmGv+L(Xx8V!2n$tgVfCm}WfFVpB7
zcv~F>2wl3t7(nPxfFbh6J)_y@uMYQqKHNXv+dcSR`?UBLsZLR$Ug(+-kNH`fg8IZS
zVfr<^t3~1w{j|swIzvNV&8=rmpeM%t(A9bbX}V-zi-wscx0-<Jc)2pAymeMR68GnM
z3^XiHa6D1RD;+BGE#Tutd?M2fZ7h`IO~n`2D$2P^k7*#Qzf}z9-dh7?uH%h;!Fe&y
zP<e^2E<6#^7*p`cJI)Cz;&#(uPJ<(frS4WU{ES-#EF|2OT84Pl$_}n4-Z<#jK=c_m
zqqSo2IophO18h0rAaF>z_k`KjfD$d>bpUJKob^N2L%%N3vmU2U=^bQp45KvRDJApU
zl7oefo}lmm76Zj3Nq3#xp^UjEv6jAobowG8qt*FQ4^#ykyYlPUnq(8~RUW;Z8z&WQ
z)-Kg5B2vkjI_YniNqi6{lSjC5XX9(;ad+-zS7Wx+i)0m&j(qBDtI{LwLNkThe@3OZ
zxNr9sq5iBqtExg5Z!DHz*}E`(K~#`CfVqsCX$NzmmMJ{v?Q4ZS2FpV6LX{*C-Bs$6
zVCvdnQGIQf2c}lEh8IIqvo6VxD4(j#&j+JVmQ0@9RF=VsGKSW0`^DFJTjpk7;uIZ{
zWHGvGXe*TOJEfcdv*Vd(_E$^s^I^g&4`8EM0n}#6Vz;lV>{t8?a<Qrsrm7G?cStIm
z{{x?lw#FMB1(S<Y^!}d5&*oF^x{qqNI>cqKj`9QH7ako2qcbSCn?dVbo0{<(u+*+8
zzqLPAIm&qm!9-6?n;6BXh^e`#;0<9rwfWT4YnN_f5MEA9Eg~O@C<MJ&j`Hd#sLiZ~
z0ky!<Fri=60Eq@2f)6q9v%;z7t>9d8@CIt2X``E6S%TCY8%A1NWvEiz%y7utDLb?(
ze<D-lVw2p6AzyW}HS@abU_|GuOe@RC27J~hABbQ@L4>%RI27|i_>M%ruoPwW#oH`)
zE79mqjiAsl@Bfw(#(#2IY+0QqA?%O+VreJl#b+bzmTMptcCx;4Ik$vx<C0{((#>6y
zbSt{Z{)jG5AiKzs=N6hR5h#VC=!z&Q+1(UAs_Mh*8n&JV>Ny@_=4<ETYhAUxmKsl9
zu{I2%czNrAsLVs)oM7K}&3FVA`Se2ijKVV>8w)K?cm&9GR5IjHAYyd#QrsU@BAm}>
zxeH2pJDhCBFu=7i?yEjVHUr#4h7MnR{)d+g@74de*=U;QfAw~=@#XyQA)ckq|A-aV
z?fb?3IbsSuDD1@^j|o5%7GHz>(=N{H&Jb^ssNR>pxIL*~v*l5o`OQ^oS+OwD6<YaC
zxm;Rw3AQ52SB!RqlPpJ(`q6gO0eLA=LHv;x%iMiWdKJoR0J5(d3{;8tlOF}cYjOV%
z6WI);*K&*(_&to<3-#ww#2aAhjpav3DGGj`r4uzV_4~mvfL9u|3TbjS3VYtD@|7aT
zgole?Q@TNsDbH{bV06Cl`Jn=;=rTruC3A_=FVXrOeYbe<7%j=_f{}Q{UXa8_Jold-
zz*^AvDOH3p^m|Cf2$z6MfSG#$DV5c;RZg&Zyq(^E6V5aU<rGjoVFg|@(0j%|hKDsK
zNW>)IcoJNZe})FUDC4<TL>ebMBFc=@rwT`C_r+_9+8>Ftk3l$@@l2+cxY8O+1JOqW
zH2xu6uxb=bVhD4zm>Aqaj{4<PDFWLLH3zzobF8yir9T%yT>OMwI-p*m@|SW$-^3HW
z&qP*D{8t`f70Q8JqMdwh^WBg}rHE`IWf2fBc(a%s2a_w%sUZALhk|@0Vt}-NzN|=4
z(BH*z^v=9sLXw794aZqbE;ED9;;~t30xEzUa$%T~{;tbX&U{~q`3r&L<iqWVQsX1%
zN($YW4j=A*hm;kU>Z}E=oHW^mD>L5O_@ni!&;41f{|g}ois5X<j6jR@|4zMa=>KjD
z{`sQ+Kftq;{;#vbIyM5hS4VeUDXzteAiSWzr;gY;-6e=AVoby}FS)WBp?~n)it^z6
z2ehkv7;#7cq%(QMcFQU^dZpV+0U)$R!GuAi6>@##RFvUGcB8YG{>V3@`a~j)54k|X
z_p!tNW8jZ4Ya{&OW+4?t6+mxzH7b95R~YvvC_}Rm4|%r>01v3LIN2w7<U8&sh_4z;
zpj4~z+Ww%%8?DtAccN6H7f^@#y)$XVrGgb{6Y<(B3~a3?>J9`dg`@0Erz7-{2My`)
z&FKrwE4Yy}DG+wS_{v*-Do<5MrQ+#=MHkN$1-{pFPfdSl-uAIVN2wSqYSKjP_VE^b
zj6FZzsAxOBdj(foA#iW%2{E=B3R#k`9}&#AHc9u1EEuD)F_`hdJ(}BT86<Q+RSki=
ziCq~7@@@-5imJFUlN-P2C#mtL=}F>wzwi6%HMl$~<lv`Ac*(3Il+7|r0Bu+IK0zRN
zYR+v%R5;f>5V>Q$c&MC$p*q}qxqtNL;N|<*d#5kny!?Lu_3_@}>Dz;&z1QCt58nOJ
ze+Aj7^?7q!rjO+XLD^1d1YwWE?r>VLSpT0!;S~09v(+zvFUbGdXm(oW{hxNH{YC$O
zh-WGNKV^mdJ3v`mT~Z5OyFE%6fr5doD+AKyCo}&_H~HS-CJ|j7V#@OeI+?8#4cT+C
ze_yub0%VNB3!<9g^N1bMA&YWYP4;sUrg3|FJ5yyTXFC8{K&HR5a^m7atRtJs6iY5C
z)w3XTrW9mO_))rk2jk*=UDzZ0;LT=U|NL|oo+?P6Vy+2qY@rgNEygP8k!*+C)S<nG
z)t#lD<Ip0X4+(k6hX7mW;Y%9!bYF#TLilhumSd6si!5+>8Ze*;uH)qRB+0c+mut6k
zI<q4x*0?Mw`2ZIHcO#;5Z)VdkBt<A{alv=GD#FJ-zYqm4{!8~^e@j;wb4Mmq#WKKo
z(`^FpQQ*(6U}1=T=Uyir>UKn$8t;}nW-nL8pV(8)6-{hW_kQQM0-%gk^ku4BzvC1^
zzo`r-m{%Sa*1{<NMRh*gdFK9==NXyJzDzdxJYsLd8PBWnm>WiM&-s`%?#J0-dYq7!
z(n9&8@KVY797Y4oqIEGrcZg9i4rWwt<1?M+Y#!saBt&>oNkRMCA{merbQcv&iCwnI
zM%jYRFXGLjwbS<TLDhEZ@!mv@SEC>{yqAA*{hiM!l^}}>_m(OA=V|#5nOgKi7%3le
zg2i}RkxfNcP-7fi<!Rb^3*ldBy<6)lwvMf6`2~3S<?^19{KIFOFkqd9;ehS^wEOyA
zW}faml}sx-qqvdTL@MY0XcSgpovE`Ec0+&J$@66*f0@W%CbE4ZW1fn8o5#}odeH=~
zIj-h)tv*Jo5O%Y7c*x$)$331=iJX}Gbd|A(cg}FCee}P`0n7764t$XViX0%y)_Cs2
zd(@uw)Qq+gYnqNl6%fnf9dS5}#mSwhlAPdundWP=K7E;|#q(4+Ng}iOS5vy1fPORz
zQ{_$7)MkxAmtf-7ygn|3HQo-hoHnb~M54xSz0RgrnGl-tDKS}W)x?pvlLJFpDN_W$
zArNT1FS6JAOCs?HOh`OyxF}*_JBDlI)e;*qNhpej?%3ic<ky+aMpUO(s*-APEZvi=
zRM6GJXdy8MNtjQh&GFQaB48D2*^jf4U-aK7p_=AygdrB~E=MrcMUazO>Yw6^6vs~~
z;c!2U@E*bF`o3I_9<jX%B@xAC%#6CIg|*Ye9v76G&q4~rDB_Z0sL#GXnPL8#I{OFo
z_%ev8ODZW!>7F?D*rrCGi*<$)T7peESzFVjav0>s)Dk(w=7JlC4)86=(MWNX$}nik
zl7F1r-rAnU{-2+K{q8mXL%q{5{XgsN&X@QP5ArPK|4FQHKk*;fC$6oGv)2+Xl)pcD
z1JK+kpcdIUFt;?ikB@S$BV+h>YI+-*hKf`vC*DGRiL%r#-HDIcMOsF?zz?m2AMvIE
z#ia4XB_X`(JfJIL{Q9=)dR_=RVOa#a4o*q=R3iVEKa9MyyGVdV`M(^eY5IRVU-CaZ
z%(GnnFJgrx^!)-Upr}tbHx!Py0-|B@l~4)}FUsh#tsUEYu^r>E)q=AL-XQE<<NR_K
zmBypj_&gj9Y9mS{zp(lKbsxi%1ryfoav_EZWGMN$&ow??p7HWqn9-bKhtrXKFyvRu
zD4GYxvZq`*GE;iMou+JQjCrHHP1F;mNf%>De@IH686~+Bfmye5n@z1DWH2xEjB(A3
zcF3Y$CixVn6G;XUv<FH%AhalUyRjh^xgzVv?w5jLV5B`6aWCaB3dk3qShO`j81USO
z;_pCJgcsMWYF3sxc1|(L=y(bZWs^{t^0R!Sn9y|WE5K#qsTt&?+y|177+aw~kK!=O
zC8{M5vLH2d?azobrUHy(g_kX8C()DLo#7QgN|k_d%NYeOcj~}tencD9*l1-i_mP#y
z-W6;ur^SQqiYyKe|L=1daydGf_hfBDei?<B_=Se8{J8UwNQ<V>@}vFGwB>l@O{Txp
zcIaR3S*-u@<YRZq0JcE?b2|;k)c+c-FZo{|<XKApldQ1rE#QlTH*a>|zGVAvzduNg
zb7;H^qZz+;|B;j{I+K>!s<IAhsRSGalYxIlL94`}JiV6)h?gg<uAH&y*KS3ZJb|Qa
zkBde(XBT!;H%m53mu!|U*-9?{W(oLe@A${PUytrW!<1rzSSHahN1}s2Tv9qn?SsD>
z@~`AIj{yR0QxW+^kI-@W=Jb_66L-ab#NI^yPTI^;u)r*ciH0m83nsHD#2{ufsw)9a
z`Ze=$o+k0-FeT^PgT1%Mn~TBf&4bab2I|xhjgrDY!bU&~SR#Xo!(DA1l`@MvHoZu!
zJ@9Mh71m@rx$#Fc9W(owP@%<uEWtz;2p^n}Jdp{OgS;ZNe6R^tgJ${UTmTyF0nk0j
zi-Os8S<V(LRLsl!Z-G}fmr%wQum8PKh#@-pMdSO3|J7=@-Aw#1=S%#r2YDWebhToo
zkLOcdFP_e4!3f71mic8A1f5sbttPyt#@Va=*UanxJ`du+Jh<0_idGJOtndJVP&V>U
z&w`O<>9jX06S;AB4$;H^R*$v*x7IL!rLWvK&p9=cxS27~4dyW?G40IbVBm{BZn+89
z@0W*>oQ;HMLjt1?gB=7YA6{aV70kpPo<`$S3X4@tC~8Vsktv`kwnl@_V?gp=(x6ld
z<wg`OYm~;V*CEv*>5Zo06bjc**bT43cbWftwbr6?tvO3HmsA<K)UML%Vn}!u_=ne8
z5sVS6Y`y^D_1^c#{KvY0`LErVFX{NfVReQ%(lK#-e{rLqpi#7simK2w|IL#&gT=MI
zt4!@ab5qc+&Z2NWO_EEpGgf79empup+}nMVl);0dm~B$J(ViEnUGog|X|Gp!|Asw(
zeemK(z?HXi1eNPG0AS*?o7>xk)j3GwCxDx6?YpF{qQ*Gqqn+jYlt+pqE3O0~6>^!1
z(OoKX)=O(U%I|LZrZ`LHHKQ@9(cq$%C0p_K=&-OfRFbKR>MF{h&R)EdaOlZ!T7Iu~
zrqWugmPDWwgJ~^)m$aOf<8MOH@4^TpnbSHTmmx!B<Aap))g&xJKQ%opQc%ad@zgkI
zXse2<dU&|`a_{Z09FhIEuk;;QJnzN*C_qd0eZZMEe|2|QrE?*z$31Pu)wdbvbdKf0
zOjD&&0$lGbf$tnP0Q4^umSBiFTGx7Su-o_g=YE_l#Piv74h!^rIHYV@;~*EHUT~JA
zG>QBvus*w@E3EYsdwFl*Emt7~;w-M99D0dt<{XI{N1{eZup6#`@)L+U%mT$8ox~}J
zHYOMweSFPdWOrHlG|!DxU)iLj0q7gFS&>^W>Q-jb(s)RwI!L3ZqbSVSdM07gJc9hK
z1R1*!P27`}eewQ}E{WgC0cg?rf8EWT|JU6w=l>7#EVaGktg!BF9g0s{Ymc${XP_y@
zpc`VIT1w!AFJn4A(?fdx?2Fq;XLB#|CNrO>La2>n5O_1pcz_4<<QT8`ekx)@cTr3d
ziw8Whc)-44Zjx3!xXr94<Oac&1cDI{R(U`Ltf7UJRE3l7y~vO9)STU#cI=X4Pa23s
zwrts+aWj)3Vb6<$K9FN#*q0tLC_`pd&Bn?Dl35|(;U@{#Gpve;sz&p)MGWrdjf}R^
zd>0mSq3E{Zl~fdmnR@TlV323Dujs8+49j_4Z$9$JUNAw>^<s`Go`D<Evfl{6|NeKT
zy!}pw&M?R1XckTv42sB3Z^B+LOT-Kf?Zk1C24aB8MoXAe9xSdr;T$DY;-xS}Hcm8T
z-TBNnm{&W8&U&TUm{;i$=~J2+>v<?-C{H9O=V~vC_4YZ`0Z&n32_V1fKonsq^JGv_
zN{vxg0yrgTC|VDAGIO%Y5VqxKv_eE6;~%{yeR&@4DWU(t%V^NMxAT9{{5qY?`G4E}
zqW?X_vz-1XSYc80-{g)CrktW{Fd>_Q7Kdgj^ryPFP`_NR5s3b5J2_TV4qdGxvBC>f
zq+rAb&XfjDj86EK5*|u^9j#ha2T4NVLxz+bVWeE?Eb7g#ObZAn;px<yowE<K@pKSG
ztioSzE2*mhjLOM6sLv|U18h*0eop`~e|jp$npF5%H1~^#NhJB;m==waD3Kv3Z@?ty
zJz!_zp@UZvF6%JcW(r3ab~BtlNo0vXc-)!$5F@V_6rpjboVx}N$*bvRYEsYZWvv_n
z7BklaV73}}QbOg=f-jx5@#S*t_ApFi$F2<1l!Q-?JehLv+M_z2oF70{ydX#NB!|j5
zhKr|@4svSArpLJ(*7;HJO9b>cik6InUoNo!eV`>FC>P*gFI@sTqe6*5|M<WTJp~Du
zpyV!ih-o2N!V=2$cWXoPy1HWE$0{}1K#d{>n0KIyY7csNg$DNUaX?Ok_KFhT+<wV4
z$rH_&?fU$awqak?Us3UF<AdvoHxBwWsI>%6i))ccrpT}#`sA?zoYlXGS#2DQfLZbQ
zVi4QeCb5lPaNFnw`-U|V+vtTk-_^&ekwXK<Nzg9);9pH6Y;pD^0zP}PvB?j2>KnHw
zcBpb9lj5DI>a%As6MJEtkwqp&FzW5n^pKSYbAF9R0AIz%Y9OGI%K0^?^BHWMhS&?5
zyTb5-Rg;#+F?(`+@bcgp&8}%M^`Vr%VUNu!;aG84b3;fko!>(OG78TSTo8X06Xq2D
zKIJcJjva<lVxczhN8UACFyqSP7Rf;vQ;%ox1-AU?ML{@^K|lub2+oGKycv@l-$n4G
z*YD#vBU9@2Ks@Bc7O@>mRAs%~(+M3rjQc<hDHx*s=4^wjx4fks<;XzZ4nIqw+sxq^
zBTE6i>HAu{bO8;7^7Q}D-k<lkZ6u4r@cH-kr|6-0CzdQKT(nr4IQMFE;wQ4@E6J0Y
zW9#w<lAwf`1ULYx#TuQ@{?^hBbOQ|#q!!y5F_A?9y;fIOS5?=7c!#}^QGbBNJYO`2
z`5o}u1Mb9uWDtFZfCSDNVUW0~EFDPBV{ZqW8@j_Fyk4r@ifW8{O>#;r-na>#D$PH3
z+{iftdG=&b6kx9H9!Gcv4htz&Fci@McuaUHQ^>msK1u8*W8|KPH`sUwOnDv!-qn*@
zH@8#fL$j1|4T)mWSkw3{<lQu)HD$V2BP)aww&M1ZNHg*Vn;X9##jO_%rPP|f!RS#4
zPP$gdbv@eKSpt4{>9yy3(YZ=hP8s{6h~6CY_x@xcMu5d0E{2P=;yes|?+fi<6E7N5
z@FH_=Frg;Q$PXVRv8jz2tW0dG&xwLX<NJ#`He+Li9MDzOm`;mG1AZ2eGNkq}>{`4#
zb^HLHh5~>*5D44ChNg$5OP9>Ur&5)Pen!1M{WE2Tl;a+4hg{f!T?!co!1lf<a)x=!
zk)(MM?_iHCWyv!WaPN6z{WHIUT>}t?impAhTxNo)LrwNm!xq%GZmhRnu8J3;>fPqA
zz20bU#6A4vBdT@`DCv!kfM6t^qjP%xj4ZM3c`r@DEDrf3J0pWM`{79Ao)*#`KOELx
z26qB-+QUmpU=$>A%jc113Fh^ku#Y5=XL!fF5dOBO3o2qkA48Kw=aX?SxGXQb^*VSD
zS;M#vx$K$Q@srE&H~5);|Hme!4;TNXvAVvRx&Lc6p6tIK<ulX$pG1WRiU1{Tmyyp#
zMH2@}vgKjtf|>yYR>24?Xaa2nRAS*6OM5-Cq>wYf3aTB9hA|ZKl2ACOmUfltNUCGK
z^=4t~P1$-!Z@o*QqA*^?AZ@Av%x9X@t07kx&*fBCDx-7=y^xjZKaRHF{j#5QUlT8K
zJd3Mb=aWIBD>q3WAaWRx!9}em^Sv==c6(dV=EjQ$vIg7mokK~=`5IpHtBeWSn?3s|
z4}a4DD_e~xr@<proA}`hhBQB>LVHvffOwPJT%*~lt*))7&GA)RZ~P0)BChcC&0b++
z{UFFTBvVxvLUHOUD$L<w#Z1|jpeQB8Nl)7{DyOz=p1#=9T&ID!-Rl{XF4#wTP@I27
zZi{Kg#3y6;h%N9Dr>@c&qEgV%AR0Tj{o`nVdynLGKZl-#L`m@2Z1>zg>iaP?OiD{%
z#ZufBJ8HC$V^+Qz2?A?FAod*27~pXeZ#}0w29&{&K5Xb8m$xRIqF6j8!%9&tWo0?a
zh@C^U5VuzDo4M^>!*NhHl<f2r73$?t!M^7XdNv}P+8J?$o0}@Mc9W`idrKRHpi618
zrmtZE?GA}*PhZLA(@LgS(sH1cT1k!2sg-QXmE=JbZt;%mch84T_!(sKx7v%v^wqO3
zJwxi#2%*$Z!3k{6*Vk6omvg3(=N+c9k*Ys!9vpis2um<F8SdrESc#=v&LzW`SSwnY
zlF;$b+%!{?KuKq!xM<vJrB)G@7Zr0998H%8KdrnCpbe0Uxe0xYF7TXy<<y{MkZmYX
zFwPeh?Ata@RS^!3i)poNqow-Qq%EB~kzO46A%y*wgfpu(k&}ik@(Q&HUe7Y2W--)@
z*dTp)%_;0%WlC+n)8>B*+BrSFr)jtHr>${N$=Bl9x27>(Q)*jhpKa%KDkW1CpuB{`
z6xm7wq$3;-BIP_`-}#X{==bnOcG4Z=ZF{;>%T`G#g3VqQ%(c;j+E(;#Dok$pGJ`V|
z;eqVs*r#U%62dWUo+O75=+l#tZ(8C;A2A*@W}~@imEyDg;Bq;4K5&qp0b<{668A9F
z0!#y@ekeNEV&M8`<MUFYw0i}N3I>3LI$G)ClV@7Ncy~-I*pdaicBnFP!pP!^Me&f8
z;tGL~h&nVgAUbO~RZI8LoZd$sJ#LikqcOdYx{k2jB>FVsl*`;6d;XH@KWBNZj8BvN
zoM>IH<hta9s^*fj4b>Tq!r)51eBO{<MQC6MWA4G&hZK4rBT+iYTk$L!_20PQ;scDo
z)S8r;?EmBjiQB|fF!NWhr>Me=)e+2MhMAV>t3GY0mcB|5tv7qK5G>EvScv<lSEMe%
zK61I~m~`Eht`y)F4d9iiJs|0lT~z7I1ClS<k43FDoqDC#`eBKeZJ>&F(YuErU5(An
zm${>#j*D@f)9D>OI)S8-|4%W7O(BwHnwUZ;%QSJH#8UQ`r;IPAl@EANS~C7$;NKwz
z@Ra+%^;SKd|E1Y%HJ<MO9^*56ct42>_k0OhkxYP8n5wuoflr}Ex5Ta&b|(W^sh#(S
z@85qo{<V@)`IS=3Pu2RS_>Cy+ie99djgscM9}QMIqhLfavt$v?`hj$sMj3pM<&rXg
zvuKH>pUuPRiM9NUQ}x7=8Q#y-6l+kzdB$*9ZRSN&UTu=sIhK}DcA$I?Exbt=?J0ML
z+Zhn%7$o*u=(5Enng`B>I9Ys{h6~@oI?r++P`J+bxy&|>-@bO@IWT=gsE+9u7PrK^
zfJ+o-hKfh{S+rU?&sS5=apBOXfd?pVTC4Mq5+hColX1}?8QV%-IqAb|<N*5!qvS*!
z8KOsB<8{iE+mv#Xkzqq0U^0K=tzjUTxm18ycUc_vt-H&Puwnig`t!8v^P+!xQ1`q6
z)Xk}RG0;V+#{^_{vMnp}@pRYb-%i|-ZnO-8sp5$K7AJv<hQVhSL)NM2b)k#de|pkW
zK>$nr`OeEPcjvO`I)K29Zye&Sr#=6TV^H(H>Ac!%f9{1Z%VntNYdO!?^AKqLUJs3U
z&36yp?7uq^zr8s)_$s91KLb;~rClyp{KGr8U^;p8cK`6h$<yLL^x{jCL|*(c^GEX_
z0e&8k_b-b#`$tEIM^9Mus93{Rvv<T9w!B@E4ZCE+tALzuTN}reuB9=CO*t-MBw{kc
zr-|k9lgL<Np$GElZ!~QWTegR*xlp|mH)<AY+^T4k(4<UyiHmxQknejTMl_+0y3Qmb
zd~kW`YvjIp=>Td@Mzhi%#3LUOsdFt3P(ycLIHaqq0hLf4l{EC-o9QOVvDy?7W^Mse
zAUci@|K+SNzf1~~y3S5*yMrKdr>$gca=&x%{_y?%EgSFq)}LvubX-i<EoYrR&%ZM9
zlE^C;ZL^WT4Y@R+4P&wHNDa|(v_-INV~X&A%eAJG+ee%RVW7vKop;j`CIFQXYuYG&
z|GrUSLF^`G4j3TXJM*2vZ|?PWbOdXC{d|$~I3q1Znn*kAT@fO+6~FLVbULEjMOyt1
zLje21<m_Bq7T^Igt*LeH0jJ@LeqUrh(Au7i|ExNamv`mHbap0N`CwvZ4(da37zK<4
zM%3+=+5}Ht#CQ0V@c#vLyi@vzsri4`*3$R?_4U?M{=Y~0%;x`#sPItUzex3vf{dK5
zAw_Wb4wbz#q@+v^7gw3+NPvZrgH(c+<(KDP_gpxGD3IpnY}^!S6bq+)rCkN^lWWmT
zJ^3PZZk)5(h`zXpA3`S~`wkIo;GZ`8QcBBun90o*>FBRX&k7CRT8$rZK9nfui#N)i
z&*wwx8v1UCi-zbo#YMAd3>awb{5%-~Rl^)YSWzaNDjG!3>vF7N;rU|*pM5|L98p6|
zA4|g+Ok)ZVu>W*c;v}9Pl&B4ztC|E=4bHa^&Fz|2h_%E;YkpY4Z)_lcyp&JOx@cd}
zHt)+9K`?5<qD>pcmoF(G(IA>r`YwbOmY51FHP99SYu+&uoC?6i2|dQ}E0uDA;%Y?z
zq^aPEv^~|p>}KMoiN6Z_EQF2%4iC%<8#TVEfXN#j$lg52Z<0@$e*WWbd)V{8zShc|
z|IMfK|4}|Oo&SUi4|M($+0Rl33OYI^KEdxthwpwl`RDt6jwQgOq>7b_IClqw0Mkbe
zdb&Jr3cL$g@|B>Vl^}KX9CTz$f{;WQ#3J@2CvV`0JR9vo3>iP0qli^5hRYpv>tMgT
zhacXZw6_lq;xTwWwud@+0GJ0o>M>DzatQX`o9W)63#s_=0}+9A<^hLv4PvS>5FZEf
z?jP_ExojfUlN05P!6<`WCqVExieQ|dP_}Y~t^6Zy1*4uhGPoQYn6nwb0m+g;^ff4+
z2j{S+C_$t19EKOOH`2&7;-p)_kdD-Z@V#!Hdv|6qSI~~{UW#Zu0dW-}q*ko#NUpSj
z1btZbFv{yaQ@0|Qaf|U`3spOA{FiQPpmG|1R!38&PYpM8fTrN`jh<dlpSymhpZ`iG
zYr7YyN1B5bm~#HFHCyTPzg6FOI{zQ#Gt>E>Muq%5KzEIeACoYd&drq-;Orw_dqe?r
zFH#wH6P`hr?Ik5-0biHh`30*$QA%rSOulRikHL}k70FCvi)_cQll<eE4$EZ^0vY0p
zuHzKYSG)-2jJ5>B)oEef>!P~X#dW_F)%{XjcT`k&R9tslRCiolH!7;Dv0S%l)OrX1
z;`KR3trfiq<v6jVm{v<Su*A3J=Yxs!tQ02F({?u)U1wg!<A(-m0#xcMuM`IVZleib
zqePizi88HJ8H-;A-VPH8iq<182|zhb^@@-6q}w;GgfB0@Hp{G?k~ct<-}UjA%hvX{
zwuF{|!FiYd-_Ek`|9$)5@t4!Rz)2bp=>@V#D<jMi{`?2)^8T<ae%t@&@yEt#Hj1*n
zcCzeusN1|l-Bw=RTam`Zd5J({R&=o)`jSJKdg#Y91o;J%p%zWScCvCmw4&64XCATX
z!Bu{fbp@B^lo8RE8ZR?QRJM{CtEPbD(bm*RYO>yMJqwDPQ!4HAXkVC7H0ea$(CfJD
z$F`JSpjiMqk^%jJ-D$T~#s9O}Zf{-58QvN}`}CIRadMr@!2bU|$(xV#nJ)ifPHf5+
zJhu*biu|{}x}J&uytek_|NSVRndHA16-e+~5J%eWDrxp8*UKmjMnD{{pJBov89VWY
zGOMdMihN_NeV|`w?$t<CK82tBsw%Pdd}Zl>FXE$$%*x)D@fXvf9^0ZyFId5a>8tOk
zo5su>NRUN6n+h>bmV-kwFR3|r3G1ns@umx=#TnE3(8IV;*ZDD|2GM8MNTephVBnsD
za82R&a{|<9mAiMT?4i&O{lj8lf^wqcry?gUxmK^2st13;K?<wbJyjqyAmp9-Qky;T
z`HvDqQ<xWjX>)GFQ&Gz?qSLBREY&AkeQk`WsCGKRh09jOgG=W+67^-WzLqFJ*vM%@
zIJ5j0Hw<Q&LfZoXd5)hv=wUv}rh(OC=-q&Ee(iCX(Ho1KDmL)5XstBGU;irTub<$r
zRh^MpfS#PNd#>emVmt1LGX=#3yA*=_#zfPO)AOC7%Y0@V19C!@Q#6rF!-6B2-z=e)
zydO;b-qNk8x>?L1n99DTH3#0?d`@o~OK|iFR6~?&BfGm)F-MB}@9waNSlW)Co(esL
zx^;#sc#pkq>3K3;%90Yoqm-6`FUjG#90<PGZ)wys(F<I@m;qjL>|iD=rf*qLWl{zm
zj~q;@v?K|u4u<?nF}4*}vn)%mt#Wjk^>QJCv0bm};-L^QNwExkl2-~kj00*tC5lDM
zqB9{59PQZIKC&C)EhG?8%oR6vdMR2o6KKk;LMGW0Z~gmPg5nkb4YLyl*3S4y=VLh`
zVnL+tn3}nZE3ve2Wo4N=qWyiqdzSUhz;7Ph$6LH?3f&BZkjpyRKR)>iAev>Gxv0Y6
zRM=9>M;C;L+^wYm(msB_{qD{2ui5i(=7Hx|EVB#q>1RGFSwS_C$y{Oj0E}EfrH!02
z5Q-aA(zzKENj*jW-?q0q^=x^-AGEPj{CmywF`u2d!FQitJ^%Qrce=C)Ct%zo)q3^6
zl!IcT^2yEzI76rJN}jpg#JEc423;M>sd8;<dW$57R}DO<v4Fli7X+tarNQav!pgH-
z@#oP^l#c&~x$DkCWNT(t1Wb|tH`Z6v_TR15`qTaIqkQIx|E8e=8-oQC${<N)qsa(&
z$&Zt<H$Y6eS6i{zok{tAqW?1pOAaUgs7Xm8E+y^5NwNTfABiJGceXfdOE+is+<EId
z(Ij*+hz(^we!fU4A63iAl&Q;<k=h`*#PpG&3((Y_>xQOWq(<2v;kz5wU{F2>)=Xq<
z%JEs<+VX=odiDC<>$IjjEnlj>2d=LR>lxRx6~1+@b9By!?NH8}z=4ue&RClDdmc?g
z8;x;dNC}S4r;qSQh<_Pl3H4BKQXz%1Wb~@BjKbwB(nl>Da;AJ1x_<zRf?i`(zP^kO
zVacCx((B!03&Ln7E4x#fpI^xwCRz5PYSd4cy!{q83|)wj(V&ci@Ez}<=C`ziU=OW5
z?V!9J)LbjOgY=U3v4c3K240bl&}|84GSgl%HWRAm#sSD3nQiqwZlhoVyk=YOrmww^
z^uaV9W+Ro}NBUU4$?ddWb~mlx|7N0)C(t~WoAFRWZ3xS5wv*|5+(L*VZD^Pv7c)|t
zI>_}A4snYBglLSBsL22Sp@wLL=S>B(Aw@nr1)!o;vj0pb6;B{Vhirh}yF?T+0}5#%
z+Tn5G0GxOT{fW=_4>d7#uGQ#`Zg>fJRwgS@I@W+%N0^dC^;7Zcl}<GB0}V)bnI6n5
zjx=D6&75^1NXHkl1in}565K&O0T5ZboeDmLn-zjx$HyT~1LAi9z<Nml%Jheazg3b^
zhVH<{IE(!t=s00s6@FXE2J(7POPJ~UpP?6ZAJqSEeIsN4QD0ws(*HclXD0m*p#rIV
z?o+8l|5{A0bzLu6o#63Lx3G#aAj1Rw7DO^O>d*&y(@9_ZEsH1+moA3~pswNQcEYm>
zMo9q*6p0b;%d}B~<-SDS3-gQ$FM0GSVrLj9EOf4?&-Tpq-O%fb?|;^z+nt1wcaeLw
zm7VlVV7Rvd6Gar#pdme2`540mnT8K`qF#;5%lT0yqfT}J1GK?lVF1}qSvqqKGU&yv
z4tnjRU=}1MM5<7+QeUa3K8?z09z^6G?sa0&XPtDf@N_fAhbC0<w4qWkgeQ4$!oroS
zd?O`lrPqmoCY>5#JLpA!Fp18yl1onYdj2$#QiT%%$6jv8fT456w}!P*Fz~w9c<G84
zTQ#US6(-oY8qS$J#y_ttC|t!CKe1XbB|ySfZR2m%N+es6DnMIfstPhlnKaJ>vNH-g
zC^FKYBokQ&MTJ?}m}+L0X~o(~o1k6{;QnOpUSaOF^yKdb%6d#dW<!x2tn1H<b^Q`p
z*Ea#x&jVDSm!|}r`Vvkv;#)s-|E1v@{b?Nvz4^(CYcotH)4=RIdDbq=B3elR)^m?3
z6%dI;61M&@@n=Dh14YM);NXlLVCt{Q>hk#bK=cRBnMnwYLpW~Jy!DTwK^tp|kM7kd
z6xFS*@gNfa8yG)$vsJkjTksWrpQdFfJe4V;5PE&EZ9%U?65FQL4kuL>`;4e~rFx?V
zak~YdifPYC6DD6UbB1Y8t;{?vuo!rL&%HvJp#RiqHp}Hq1Ev0Lqdhs=-u>;(yI;}+
zmZD~?8q>@%ORd+;V^lpcPz!MmEsd$mE_RVZJJNEx;aJ}>Nofr=Q2E3tWLG-DTWaSo
zFw)AD7>s6(SE(8~v+22Gr+bdBrROMa3o<$B0tfA0rJ|59lNFq`$5D5DB`OHWim0%I
z61%=6tP8MVULRdg&)Ui@rVecAPbfV7Ec80Si{|kniffh;xY58#ACjT1sVwz-uWAi8
zd(HC9N-Y+nhoMoJF8`C&%)t3_4K&%EOA#<d{%>s5o9X<2YwJ(`ACK~xN&Yuc;l48f
zDxEMOZ_w3anxmOn2QAIJ1BdjIGWblQ$xo|{gV4j>H$*v2GxRf$vm(8+My3z8|NEb>
zkM{T5C%+!;AOCuIu!n;7dJ<?G_1QN>ltrDgx{IHfg}g<#mu@J$G=W16p8_MCGoM#D
zcnm#5NvP^+#4Fp+AKcF$>3;sO^+TjBU%iPAIObR|0jV4aD^>X}#{k{Pbv_ruS8IHN
zc7dPGCM|bJag#rbs#?Am4fDcjhG4$>r~pn$^MC#8w4$o_rDnFUE=b=jDY*68%+N+#
zXiBI|6W?-^r^QE?p_G;gAKzIigzsF75AP1%y!$O3Q5b0X-S&S8`#)qL=S}@epDFae
z-dao3|3+hV?TP+B#%DJBKSqUz(E!VGfO0IeL>3;5Uohs28w{9+X5Yu+{r2(k{+=XK
zahE`Ouv4u0<W8LP$=m;)KMsRv#M<Lp^G+8)Q}+LAW22G2|Jhi7y8n5U5Bcb-3xpf^
z5^r4g?M;kS&}szDQt~`(4U9<$fQ;pEa<D8gL?fvn_W$t)cWp0_u?5l74;i|FgBKIs
zE{I2Ln-TPdgNo#=zPTR+KqkV3kD!z^E&Vzk+8hrIWmrflYEq9V8ewES)VP<lW)zB@
zlD(KksysRTu=^`dCwiFq1QXypW*O;E1q0<3=8^i7VF&ut!(5V&2d*at!!Soo3in<o
zH3z8C$i&o!hfO1(E>8j;*SP`}fPY$&tT*+MDhnWXF-8vfm;J--y*;a<)Mn<z#R<H1
z%<!Ot*fe=i)>X*CsSR=F!U2+NC7~7k5*NEI9{&D6-oH88FFpL@{gVu8s782FvrLCw
zv`b8<=MGBEX6GoA_oZMml-!3hgQT_~HN!7vnolPj1)~zvNs3LGPbQ93;e4p{lzpsY
zU^9b)`cgJU-FUvgI}0dM(RfNBgPYC3UQ_|5H)97y*fw>)O<5`oUNag;r5B4d{v=%w
zuP>Z|_Qn$SiGwF`>?Ej|#7bHg^~KzhJmHdsd8$TX`oDrkKuI+W$3(-P3Gy(bDR6Io
z-KBkE$G?$J9{=wI{qXW`W?%8AnE!9At*@u}|HelBDgMvne5|ZIEq=nnFNl2~@q;+U
z?Zem43}TCf)ftUkzem=+*V5J8d_NfnHE6XKx|g9hc54_O#`VX1Ir2B?Vb6=G3o0o~
ztx!X#^m`qIJ7@AKG$TSj8{iyp9iTX2uQLi=adS<s@41)gIDkpy)}VL|$~!~su*#L=
z8mx<kSqj;o=uJ4Q4E=!`g)MQkw<A;wuVf49IByGrOwfVhPioT1)u^LYR^V&Vfbhdt
z(ip2pe2l^ifQv1XTT-fh9>7RtQT(1;a76hkxFCMd7R0f&&*6X_xOLQWB2Lh#+pM<H
zd#viMHtL0qHSV*q=6yESy3fW|XKpNoDQ_{`8(Hk*7V~^)&F{LX2L>b?P$2!T>s=rk
zVvb&;c3Gu3en3oAR!~1{>?VG!%4z(tg8E&cqjAq2lZ(kp#cU%zuWgoM6}~TXTxi%5
za&IkTt|m!XwC0t&LaH^VJN7OlRZt&`oQ$7PbToRAfmaSaNxC|~>l_dqCTL69@lZR7
z?i4cc)1~_Z+Hn%mqd@tzDj3F;WNG&@4Ti(lwo#MMMuuhtBWeW|Gj4<~m~@frjFlr8
zL#U76uPI6udv-8zOe}@A43yNjdFhgk(j}XvOSVdvT+QDqe!#1uj1psz^_E4)#j`<-
z9WtI^m#Ut3=4weP6)v>3-omI2>=59pPw1WQ`xjJ}pUc&bD7jFkNqS7~7J9Fl9e+TY
zY3)2!A5{-Wl}24^yE(OOgPJgoU{8@VH1Q+8dxP=1{}R<+Gix-Fr|pw0f)>^N#(KQM
zah%cwPC}myTKavQyZG#(YovLdOSFLEHvx4ZWOw}Q{9`@Ke5kd}?(?LDv`LVaVB~e=
zn;Jwdz;gLJO7kx9H;;VVmH;M8G;I`~uw_7EAi%XX@sm2kqcNs@KP`8&xa(l*&b|jw
z{XzCYaHl?gz(9oooi09}XlGIOg3;i#dg4Zo+cTr^ssb>Ge@(pZ=X5r-7y%5{3YLVl
zKIDZ}b%pD9gB}G?toCS^rI{)Qc*fpWedt_vebXCG8)D}Eyb7grug}$oER}kc43;N<
zn^#hefe6IMkgU`RT7UuT!WoRtQ-P3UVCS8__Ev-88(6Q^*mygqQR~w<=_?u<WVi`?
zy|g{G)HSQ+5_GX&b*<}RBZk>A<sR4gDc;ISBl(mw9*l*0rpxhiH{cv6l9;n7GWQfi
z26p)tR*@I?3@6xFP`@$-yg7DivurrdUPl>%NRBVH@5nIqp0*u9%%u$?Q~cfXPUF3(
zkXzrKSsZ)Xp7fDPM`qcb5&#%{YYG77-N)HJpLX_R>};8|bH=Srsq`LTZ>uDyPn&!G
z&3&$1qiAzK9l(F8Z5n;frUAx}b(em5pcD9Mm)?Dseo;p-d%9qQ&lgXhcI!90TUocT
z^UKlx??-P=_HnCu7{PnsT)U(|*!ksn`|tbs(DPAI1h9!xm&aL!K;&o|wOkDWr#3+6
z+X!Q*BsIv$9P{0U#h2|7dZA1PE{Xio@2H9u8@W|r1Z_E(c3hpUkM#zcNdv5Cy-BMb
z3L47J?DRCfys;v4mSqXuKH6N9UPtDY%~=!~m)+>no^~sDLlnL;G&cny-S>}<mgG>A
zpzdD-s`q|xo_GI?InM9t`gh9xZxe|0YU=)XeWUSo|NAH(Q@P8VmNmSH0n&?3Q}V_b
zSwSYFHgv9PlHsV~y;4QAl3RcZ5I`!yN`ac|!!E%bp|T91vuu#9P+@<;e&N%*jYlmK
z&>Md;6q;Qse#mG&zyXSz+cdews2AE(3beuQtFG%~<N909ti^5VoL$DDrwYT!_2<!5
z?&!5g*IBN2c8=L6LX0)k@4F$YSUYalnM7`?HpMebBDX^U;RxQ7f@X<{3QoEl+}*rM
zVgl5#af>k3kuy${PXk)8Fp|ZAZ_k;{Sz`D1`eOE|&pX^xZAo^iq~_u;A319So8hWO
zdS1l_7lAZ(04+X0%Wp?tT3IWT0+DQ&CB{_KM+foYv|4RgYHA@>f`qn9;Nq|V7qyfd
z$O}Q)4`;bmEuN-Gc|7s}lZHcKs#D{$yCG_L?<=a@)am?~sm3JtMa&$?ZlQsC-pJa-
zLO?B>RHSw#^0Z>?jZMu2aPq8Uj;{hl<#5mw|IL&l;qfTIg|+B`=VJuGZ1J4(JKkAN
zopn~INhN9J4gF3Hfl9<m7E$>XH7N8w-Fdns_M0x9CRGafb^?d%M+lmYjiTg*DnXfv
zR9uLK$|?bWOB^2_ors-(qG*v89nDB9YA_*F7KyA-Q*MDJ9UrE5#uDtn8+w^Uho%%X
zfN7t(asO*#^R!?P;^58OHz!bPZHD2H-ireJ&kF+F;!Cxkc@*i5A^V@cq6+;_6CSui
zWBg_RL@elIOMyty0L~pI$C&{WwUV`wO}hB08~D-q=ZYcS;5nBL3?hY-bmQnbU>_pP
z?BihI`e&%M2=yc_iZB4jJ7n48CX+a{N-whlLNfB_h*5Y%<5Dg%ZpqLU6d5$_=R0Uv
zfkXdh@tJBg3u@#ne@yf|kXbJqFcIh%{%DHJCjQYZ#5Sx1|1=AVTsBmu)c73gHBO5v
zGz%-_fmm+Y<CDXqeG@zKwqZ18yO(ebCsI!KI&DA6O|Hs|x~OGk*aVfJ0xF|a@q7Z9
z5PM@N))^*Lpv**#CI9ZG>t12l4q%&TrlK2!q1zn~uFW|s<9WarcIv^&JDskaZqMzj
zV+$X`p9LMoA+7Jyqvu~Z1FxsRjrL0&r#HiJ_V$l=r_#}$i{zPd+fAjZ*kB$>-9C8#
z>$Y&tFp=0e&g@8wg}LQP@{h8_c6f~|s6Ax9g&!LpQO1i#-iualjd~it<qOiLDp)qq
z?zAad+4)Ic5V@kvBv47MJtDm*DXtsBu|8iD9qaR^=-S(<i=OpGOStK2(Q}#<j4kS_
znE}d(uILD-Xll6GeO~M6JeUlSC8qRPLD+L~1;5?7r}dHvEIQX}PEORFQX+;J7l}1r
z0Kgju;O7DaQONGWZx{Y{ZcBpm1@mg(D*Q4LtnJWa78Y+IPJ!;E<5Lt@N6;Ged$ZNo
zyKiFmqI-t{U<<H_v$epL*U&cEP@a^oT5FJz8;@QhQw}|~ViCs&cPNc4*<Ol%7z~w{
z*SCsXInHC`IelX|k-;2)SXQoHKXk5tSpI=$4qssXe^^|$YF0|Ofhh39q8=uzk-%ua
zJ-#Jgcz&PQ@fv<16WQ4)Wex2f?dyR->+LI2Yr(6$Md8qq_LZUG4xKA|tMt<I^_R@P
z(Q9Pg6s({W0tbPG&1GQ}x^z=Pd1`}Dcu_QQ#X@6qnV^RZ2jzTDp>5h}n%qUH9GuQ8
z4Y9TYIM>2|Hda<wMUx(FtcmrNMpM*Rny@=p8f(cCE3xECR8=!39-3@IHGxas2A7Nz
z>z=sHgj3>X@|YwN)tDz#e&v`K88v*8U-lx-J|Lc-LD@-1g00zHT`Y!^>>oXAnL|__
zw6Ik5!jUAoFiB3A{SQddIQu9Vnpp?mcy!E~Fg+x4D98K785t)p^{*aIokZvkgA14k
zN^T{fxpB97P@^n*(AW!OB@~PuC_Aem9Dn>X$DO3vNal-u7Kr!4ECZv7h4&m@v(Ijd
zjV28ozr!sG5(3b&zBm)-!V^$S08b}I;$K))jKxG;h%dr%;D7k}@+HeFCtM{QYHd01
zEcedDLT)CVTsT_mWd~$~8m6fZhNA&;r36ENGQ<deuo)FuK{%qM#L=Mvi5rVKaI*uf
zff9gN#XV7TYTSxJk6iuqm$$Dvp!7RZDzAV*SEStF(tS;?IoITL&Y3jqAfvilB>wQ%
zCY(L;YfH4$*E;|O@rD~&niD>-TcSy)hD}Cd0K2RkoQ2Nl9N{ydZBOk}QYh)kF%xL+
zv{7P1C%oyN3)xc#Q?e>mY%_b$o!OoVfbVzHk=75fapa80E--DbPYM`%_QwRu)qYM+
zkuzyzoz*dyk@$5s2<LRQ<v`<&dY<%-9QI^LonCD%)qaiz`MQPXChRziwJ=}@{lO%O
zMJ|Poz3iZ|5hpWddJ6lg0mPyu*3v`d*Kwz6Xlq1V8lqV=z!4lslE{9IvC6LTsc|SW
zd8fw)buTri<Ps$2emV}CxCB1MqV#;AbF`{7N1IAAHA*GTwdNYH8mqj?9|Y*CWvb2*
zw{+x-?*j^MspPFjTt^ohMlSl@Q8C!mlvaW!%sS^~@_@p)L{a)~hNuC#g?{W(TAl8|
z>w+v;8=|+8^c*#n;W-gEb8kW8ZscX_v}>n&#^E=6<?Ife5w0*_c^3`6R;B5g4a(@p
z7jD=IqKsKLet;)}mi)kXFDX%5<&!VOHdH{TdCr>_&^)%}82EH~UX>$T{E_5weJCPp
zT}SMp^eD@japvA_>VhXk@>^ebQ~m$6`gdOap2znA-}1sgE%Tk1ITr7J{+1V-)Qc!L
zKdrcJ#rfZ-P)z^HpIrN2PV{*%CcsnTKdr83?0+{_8&C0{ALU~W?jRT64DXPa_EzfT
zQ(+#C4-S7nIQ%6}=}U1_Jb50-ysuDMYGi}6R7BJy&8$_?s5MXF7%*}{5(h*^{h;6=
zOi^*1IiXBTB=+SQYIR1?e2xk|H$|>;qlpHtJ3@7Sxds{;eY-aIp>rjqQ8lWDVq*-x
zs+nV^_2S}a%gx?nx^ify13Lx0+u}uU<gGd?Zh{dy5;=n;k0G3#EH|@CnLOR-Vo@K3
zvR~66jXD--XowPYPM=5n7>zZWbmFws>89tyro5EXGi(AVcINg77p@J1xzy-56%2Ia
zJ42O^wgiT<5>!ixqyf&787aO_QkH`5saVe|BMp*WXa+#DmQ##4p&PAq6C+qLC~x(Q
zfO)OA@K)TMUd}Dp4TI%Yuf3MN_R^rg3zbo?9TOn5`40dO$CO+M2p^yYm55wF@<`W(
zHt*rk8K-hg&b&)Y<SXacW6lItqEgX{INbrhpTOMXu5fBKdh!A{#f#iV=cFLk&0ye}
zEZK$$jnb&5r)AOOKw-85*;_=ra+y3PP*py@3=*ho)vap<v<&zmheAJDabs0OYJH$N
zJK)Axodl!uc2W!f&uPlOpwHEK7pJ%0ENETFg``dU*Xcbq%FQDeho<*Xk9)}3lgAj9
zEnZ~IAjIR>wje2}W~bj}cHhuD3-Q8PkIraBV5HmJO|fR41hZ5V+aFGTMOUHlE)6uP
z1xo%4`$h|RHplKwdqK4l_(Kg>9#YBHOs|B#6{l{$6hh=W%4!pybB9=3V%Xn#N948K
zoOj<%-4#dVlR9=&XO(0h9J*cf!sN<AmYQRaXjnlh@7NobV!AOCqL{Ww-%faAY1~)l
z?lrCbV+<ZoZpCVHFp<6e195qd-vJZJ2HBwtC$y!|t%ssfFcNH9lt;sp5@lB)JNePT
z=}wz`-uz?$d79y9;Bjg+nBsrKQ>{J+*oM^!2DL7L8f1c6quE?(wVL$}vAVIcUSDrE
z#Ifs)$AcXE$eY<3xjQ@@f%e&hm{iA*(E$Un-!|{{tYp^!*$MLM8IZw417c%Fwj8eW
zCMht-Oy9iQJ=*!_>x0AX6F~vd<KQ2$4Lxa1DK)z{{vkqOpp1(9&WYR%1g0N6IlWH-
zgI;u7G*<F9LZ;jtK<S`96$Y_$5N}$2VEEMF28(j^sdAX*t~0=0I?!M=L#{YEDA{my
zN^wlI9Cby}6}bu#7c>!&O{JqKGN99j+<bkVPEnJ`Qy8%dRAxWpL3a>Dc^f+h&^??Y
z$+3=FoN*8UN9tcEM2#bkhTd>^M-@b_WUS5!yqaGV>taK^gaZ_9?i!-e6pfZ>tcu1O
zdfhZOMB}AsY@*Q*P_AZEG+Uy%Dw=Dexh|R;qWMxZH_;BL)ex<wXtfLkEG718Vy2SR
zA8d#>D=RDFd6TtUF~}EhbJhx1XAmHzeWcYPf*GF0@l9ca!(o90qq%u%TSGKNtU`_Z
z1v|ESv;CDnv{VgVs?IemP3|&bx)&7=NAbyIe}ub!g49uMx`)y?l~!Y>saT%UC`GYK
zXgOzE{FxO!dBhAr)E&6+Z!qYQUl-|93l(RW*Nb#*^2jKuH7x<OIG<OZoRdnQIv==h
z(i50L*(H<l_Bda|bP8gdeHpARaSYr+p<a3%wFeuBO8xzH?_cxo|3+*H`LBr^UUw$_
zhs^)j*jR66^S{=g?*AU+Ly>n-87(s)qh&KZ8v)+N5!cbE0l4rp_i7|6pTbXmRh8I!
zzOwYc7x7U=e7sq@t;*<DDw}d!TsVV?YXrE$-PRUWdJ%7dXEcrxFblw)wCNoj=H8ds
zgo0{ah)TD@QjT`-)QBUY$O_q;Cm98$je0OCCNT|_zFO7xMQ)^f6eKtoj`><2Su}7i
zTwB_f_+?JEmgK!XNlT*c<#)A4ruj@Z7${?QkVyjrCAf=(!dK*m7i!0E$%|WrDTb?*
z@7wCV3{obwH9$pa(R34_Dno_-g$8mHqL`R*AwHUDz;{2b=2D~HT%~_BZJ%t1s!~){
zsGk)9gMQSGuKjLYoQL)-TXLGPsP7axKQn#!t5g};p;71sw4BVQjF^e)QmqMG4=Fe!
z(>TP0ngd{=DUB)|THNVMCYC>-{%z{G$)o=PEOCu4Q}2}en?BR>e{HO<rStzbHkwcL
z|1myRlBX?xI*~6cJk$j{l<Pyib0_S{n|Jg}!>i410c*$<tj2BBxDD=3+>9ojXws2F
z3+BsA#do9ds5uHDT^Z8Ai+c1P?zon)H>1I|_(-KtiIV1$;W*(U?!QFEXht+DnxQ1N
z6~K<vwNBP>Y;dGbIs?z*b*Gw<swW`Nu&XJyh!i=<=aNs|%4xP*TtTt#s-Xr{5~&&-
zZA~8JH#qWF&p*~{o2M@pZ=og{)4(%p$ThNSq`Cf#p1X9LVwOtZrpM)9i49uIzy4M5
zlb=)z=6WUCD}JGlc@Di31^scGaHLHpJu$_`zW|c}*;+>Wm$D!9`!XVS!Bng1)-8su
zxE<Og4OXms0tcMk6O_0K#}CiQwhCuw=nHL!!0i1|SY6d8>VRA)9B^nQeKd4K0`nh-
zPQUMU^#ddRO8dT=be~4;avQrMH+EfZ?P_X8E14Ommz)`abUg}JnB5uW2nBv5@)-g?
z%{C?5$1Uel5Byjt$l-4~(TKaW)2F$6DWFrT%@nPQ;Y>#WfjIjTAGeiJboMnW6510W
zJ)yBuY&M;5=3NlA(jb*7C1T~OBC^Y^#xe&DjjN*XJ8Ti4G&RpByX=^fE+Iy|(lBBv
z+Xj(G4UT_#Mb>auVw8cZGH$W}t)?}4YY$;=r2E3H>P49FN!mav^{=&Rj77$9kcGAG
zv=^9V?=&04(;n6{OGEJh=%W6rQptmjKAB7R2MV2<q+?@pb&1!wcqWhyK}_|EXQ+-M
zNqlf9#-!m@db-(Z;U{}E5(tWd)5ki!=_hYl*vgYw+P@VA<=2q%6(eP8%U7*i*gkn;
zAnXg9hNc~bYP5T842JqFh~q(UDSE-B4~QF#c+F|P=T0Q#dC7?ovDp<n$YlWS*%oR+
zrd1S&$ADPf&#pRLBN1IX1Jnv44pIV0)Ky$~!6X9m+lMWS3VTuuGFp<?3(h#S53rE#
z>V@Vcur$|a=3iM}Fte04R8m<yFJ1QFcgHTw8FMy{<U&a9VVRgRPR^b%BbXEuhn#jq
zQ4>^1B&lGA=rq<~zt+U_Y2<OyLLV(+y~In|>yHhxI?cg{_)I81QEVp!Znj!uHuPgr
z|5yVZ46=uSBa<n`qKr9~f~1Ml^Cj4r9sQozay#-4Qvyb#z>i#BPSZvMaHspgVxY9?
zw26TW;v^Vj*a)eZLIWQREQ)#%bengj;lI55O2`ap3o!!eRIb8m)V@|^)NV%F!Cowa
z5%FN5cZOOVv^&t1LfZ6>W7r5{Mr9zyWTGjFxSWMVio+dVcf2zrTtR$HDcge6gnQK+
z$_a#`UX$lp(rBE?K%3wWCuik@yvMBWGKad7kwOqbVFl5rfrh<eOgU!s%>9_YcJTvg
zVOQY|8c%tt5_5NEyOVIr(lqLy`C8UPYn>jP0A#@pLxufv9t_fUi-0?-(Vt`h=@%dc
zOB}e>fpUbP0I}^{caNZ(>>h~$q6-M^yMw$dJxncuO;r0m<Nj_zybH$emN-FZ()NaW
zlc5{QRL1bn50Oxob7avG_%a*wGA~C*E>!1QE)s@K^!ee6?1UDJS|+ay1khy|U_v9L
zU6BhAfRg}iv(e|r3uR=J=eX7U;Bv8m`p|`QVswJ3LcEbnOnM$AdT=6yRi%2`PE0gv
z!rE!TJyK97_a4a(E)Z4Cg3VHUy_wnU2tfrv0C+%$zdQcmJ|{eDN^w&|%>$B0apC!j
zvk?Ky6Gr2~wW-0;uR$B;s}fXUmt%A}$?5`ePkg!vStT~ciJlcEN^UJdNN(~C;ea>9
zTLy>ygD|&(hTl;C<lq=ij2^mV^jy5<z>@TuvJnim_7H;=i<6)z#wlcbW>li;{c8u6
zjC%!xAHc}@bV{?CiUxKaUu#5KfDrlDHv#Rq7*@n4!_Y24egg6}GASnB*J!>U_VX?G
zc$2qh)CktXoCY58KDouts913sjOb!3vmg#(LUO;r9D(RA1LzTyG0+L7Q_g$an7CE5
z&s%fvu#ILFs+iA9pzx8~lUxWc1FQlPC|DG<nTR+I!${jS<_3I!`0keqo@wYHXKws?
z4?KO_=N)?TcxldizA(++mq-etfFEHhdRQf0TyQTCJ--&U{^nW6W`<|f#(r1~EYX|L
z(3nn;(kEF29gHazXHqC*#6-8L4RN8{zGR{hW0|J7&<(!M=$ZDw;1!!DvnZQri3>fl
zH4=r-Ng)|+O=VEaP0>|Zdh_EUCz(S;*NmrKDJtE^hRVQ9-&8ub>AN7I{JJfl+!zI$
zjiH$rPrh=|ti*+yxrJIuq1dL^xB<?!|G}g+c%0os0Dvj>KlSEDEA9Wkw(;cu|0th)
zn-)*ys$;xS%1h=yFED*w;3xJ!nB7CvgnVwPapplc=T0M21s_s*ii}c02N5J<oD)m7
z2W+$a^1O=W7b{O;OYY~BxBoA^U_i3%-OWFy*?%-!&3eZEqrUO9{~zN6ht;_o@zoJ>
zY(DA+(10jH$4qA!Oz@lpo{5zq%YvP>$lK-Ff`}#_C&B{JNI&5m5KT}89<V}P@@B*<
zViorpQkbnR;Hpr)o8qpn$Q6=4r{Zr5_}8%W40`)8_68W*pg-}utak|{yN(8EaTo|V
zxdJ6h@#!vk0HjQ0Xvmp4p;Egu8GJS^4MW*v<x`am3KL;LCi|qPc*hZs(&SgA0HJ0V
zzad7D>ek|#@<^uF{kUmiZ7~BSDt)Rokqn*2e2XwcS?V9?KNzca&L_Z<t^KmYZnscm
zUxnNUu#pm)V@z|->m*7GbniMt(+ZN4+$B+B_;1Xc3-acvI5ljCXc+MbsP|k>AC_qx
zknuRKP)+5mmLI^1M*XZ~uPTKEGE_8Wgu)gi=$6(Hc%Q1P_zOqOe>U;gafAP$UrVMG
zsi6(M-Zo#SFm6pB$eJ+@Q_hUT4WsaNiyW?<0lrzHt6nq$qztv8?iPN9;5&{(gw}5h
zQRBIL<xmtEpNvKp#j1uYq(+48hfB`Ei1Aw=@9Y3q2BUpSi}Q;+KDi#bUl+H4w`lyQ
z;@4_(b9Hllqq(^T16e)m7;@L+Vc0LB)0>c@7yYu3Nb^D~kN-)O5H!FMT14`dy#pph
zE(X&ZaAVlzv^WnmqM8qA%lLqfTEY_H=nt0c|M;m9i}inG#riAqK;v01iAHh`h^FOC
z(A`6gz(^9La$iWWHWXa9p$`NHZB5u&u^YAQ7~wN=x}U}KK<#m<2U>i@Jt@ajxDaYr
zG+WkfL8yM5zbj^39CHg*|HvvI^XN2^X<|ccEB9a<YWjXkLhWXD)34|P&$~&|ZFm(1
zy-C;2Qf~aaOSy{!Arm?uxyWDOInnt8@Fmv1!`^|45`U6Zs49EiTnJ<ANNm%{EX_A9
z4THE!+RB(lP@q$cJdy3lHY2W3(%*AY{bS0u4H!Cc^1gGmXfbG}ZCWj3A?;UQxMaUR
z0{qip%;(Z#?4D)80M11x>eoArS2e1GVAl@gUmK6Y;Dx3ie-@v9ZOn{Nw8kK?bugL}
zF6F`d568diD78BYF&{Y)k_kwBqY;JAW#P`voDL2U2kBYTaaq9(93aw|>4yo3etwP8
z#^4h&IG7(l>D?6k{6-K<9%sbt5%e|8I%s@DvVlzLbCBWPIC0Cl2Mu6y3}6W&3QbJu
z2#`ro@t`%wBSb`!z8zZXl{`!%L}NsWB+tPkCer~w8skk9>JAvuP;Q?eYiJ^HUPiiX
zK%pX|@wbaP^vk43$M=LcDUy@%QXYrQ&7W#brmk&{n^3LS*Pj}Rc=U@Se6-hqr+ZE9
zMNS@_y(PM>I9@XHFy$pI>!Nz9jZyf9ZWLhz?YgLRL!gr`nX5$JnePlLdH{nG4QwAD
z?;oAKIeaHxZ@)R%->W2HSkpU$1{op#rt`w8?UC9J{~umBA}2x;G<3L({ujP`3E1g|
z?#jL3xf)9Ws?#DiGK<Jd+i12>@0OZU288N_szAXC)Vl*VltTmkW)V?TdkV8_er;d+
z@9~rC{}~Kxlya%&^!~Wx6#&wYg8RR<#(FcY|8K27-TytxhcqD9aNrKvyGtpV#{mVw
zKznJo3r9D;t3{`$q`1eJk!`OhU&5E#<n-AyR$yywVHmA}=TEL;A5y!wsg7!izbSr5
zSr3Gu4Q1L?rVVAp&CLipt(ax;LqouKxn3r8w&T#Hr@fc*tjcDDKm(az1k|STBM#?B
zZ2w1NJQYz1EzX&k8TKQFkV|Z4)Q1gR;jw9*t)dY?O-<B{ze*3>!*{RW{DLvugaNs1
z3SC>?HB3uIqcTC7@`(es-Y22b=wVrg1n9Ya2RXNtz^t)AMm3fOBT>Nw<aN=iS4vhS
ze@>%pY@?i=04}*S?x#7Tll|#!dRlMc#Ohz8rEf_0LIY@V=4q_irZL;l*0Mv}CD<yr
ze%r|8JK&24LDv~jAce;KgJ`Cmx%3`@DFGSlA!gV;_kbypCY-7MWf+H=!^X8WCx30i
zUZ;jdkr}G>+<|kg*y~iC&RJx{dcY5{={Sxy(E^-M@@LAua6$ZzHlINKLAdQW-Opzs
zFpWKP9wZsL<HN(Z#|V^dK;CH5#W$w^kHsSeqfA&`P_l3q)p(Q^khjvwZStH=q@zh@
zyTP*O&QJOj2cIiB<kB!%dksCH>x$95ykf>kTbQ!}L^}ZLDD*C%?3u=15)oHNjLnmB
z3LWI+2a!aUNysMpIO$1f2KGt@yyNs_`OM1#`s4>Ql#b~KIl&3--^w$~h!RIgG&qLA
zXI<NEs<;dR)lKHqC#4;btHmfx8iJ_<3f&=PZVdYUoYu)`PY&!XJut%FN*b7HpJnd%
zwRbi9(!{{7%l(z2)>9TXbMV~XniQZx>7^>MM#?==$nJQ-=2<H_U|O;p>r`%HAm84m
zz0b^VPZHX<_Q{j~#vz;pAP79X{pVV<)m+Qif3{jr^50{8tP+`8eBrxelqwQIOLNm<
z7bG|KEWC7o7!1h2Mp|ECE+XOiKqS1L6C0y12&rj9o{5<wX6M?f4!P+Txj9u+h2;Re
zUeX%AB?&cMHi@N?ev<^yXt%ld_EtQ4*II=fBL0Rzk#=)<i+cQF=Xm$%&CWi1d#pT5
z0S<lq+}Q4X%>H-CTcOV(if@j{PENM*d+bQ$3@)AP2$*Geq&rGNQ_@d>Vw!5;oe~WN
z#wQ0vhI}*@R8t~*h06M0k}Jt58B8z0SQ7*W+aUDSjn32vWWRztCJ~<o+s5nX8=XI!
zj0Wz7J4kVCIv9p{;DzGkXnXg!H}8HyeuRC~R>Ye=ykKX=qy6Let>siBp?H0Ow_@7|
z2Yj_k9y)MhD(tV(GSoU@@EJo8gn||>)e40>WL+>dLP5Y?Wk}gGx&Kh?9=zFqcVdj!
zD1nZi|M$b2lk`Ia?J@<*`T@_g+42TqZaSm&5}Plt)e@U9uWGr?Xf6j~03bl>@vr*_
z2Zx$=nxASMU5p}hZqhXo<(NoIpcdbHJz~7FoOM~*5|drN9a9uErMb_b5aRdVo1^{R
z6M%_?z0!#<9sXwYeu8EnOn+jNSaN2TBSG#@C)p`$9ij$C2wi;AF`gi$(37-d+5jkm
zD?>&o=+!58uiPx~ixTrK<NbBlWj98OV$*lW817>w-CWYX)EGob3}h?PiHwVk7Gt@J
z4WuJ0C#7U$HR`3#$pM^O%gQ2b)viE_ei=hm21||?SO=;Rzb7EO9tY-q$u4QssWi`t
z(Zje3S-|uWV;Pi$f?1Q61!*@B)z8r~A1RU7bA<~;xjWXO`Ic5oWm^$_aaM$Bl2}>r
zN?|n)Kw&csd1rU~_=LS{IadHYW8*TAPx{`~RLtfE3h{d>y9fztlloOh=!E-lIv81l
zOrFje(B^2~N@NG%Gyyy<8_Ln8)l|&0#22Lcgh>c{8#a}MD8n%wue|7(nF-F~{n7sG
zH~$dMmipG&(qZ)B;N(qab8a=VkD3{ZkS*2GN-ZEdYh>b#BI_{uNZ0EcO<^c~t(hIS
z>yXnodm`YSX6QQu*cZ^jXWXTiE)nCifbTufWzaQ~#c>k3krR?#9g{0IONeNrsYG)<
z54j#B0BTuQGFa1?18r2@<{j#4RS~_GZmT>R^=%58ZZ&Wban*2{YzVvEqsw45bA+Uh
ztl3<dbD&{&%d++$GCs`S<hHG(UXkK=hX;p;?^XN&yx;PB7zL;FoTqI}3oN+LG!ds$
z9fsbZuvvJ>swc^&sxlvbY!q+&&ETljMoXRXs?mlpi|c!{sGsK4e!kXL#pV99Y|~^_
zW4O<PzBBIExet{T27f1LDXWv1s6t_3RPpmL@F@^n8c(%0(imHWr~j$QNW7X32_yvW
z)yP97Q<gt_Fmz<h8eSt_4X^PQe{_|RdFZv8mn>#SK`k_895kd}1nT(@EE?48FdjHx
zuD=GL7sQ811}CbKB?*ecS0glya0HB)qS}P6;?H^Tzz*ZyF@#jDMJX#qWPfr&_NhQ3
zmSI?3%)!Kd4l)u(fRP(vMc7u52S+y0`guZueekxHY>s6M8pH~?;TTVDK!h)cNlD46
z$P|jb{hbfLh~tC({r952l9s_$&v~rz{bL?<rjU>Hc)siQqAiLFWnd$#S6VX0agw+`
zoh3xZKvw#gyp+NpdtR5JBf}w+?e3{c3YP5|1t*mKsN97c-h00Vt=(r^S*6C5)|&S?
zvZj9DAG&O&Ns3nDvwZi8W0q^^C&8Ir7OsY73_bkU>l)kpZq&$j`ZI%(+AsJpx3Dh0
z#>Ug+Jfw7!RL(N1SZkwgse6|R?t7Aq9rGyFs#pyv0)fMF6ur?2Hzk%)H`PQ;WO^~x
z7v6|)o*CG*-E+xA5oApurd75x0m4MhZwEBKdwCyF$)DD@haS9X<XsdU`1b1<4xS}#
z_8Aym4h@Z*0>&~sQvt(yV8*2dM#2n-p6`s)!NwkVyX9Wv7&Q0rw`q4L#cT6+`ycI-
zqc{7<6re7>YML*&C2H9#QBA62WN)nUlgN)`mLP+Qpil7w@LYKh5IhwX>k4WHvzF8$
z*x=8v%ouL!UI$w(ilm2u^sx6#9LpmYU5gxlj8R+hnuXBDScZ9S$I>e$QRvNH3i9P{
z#nNw+8?3?`v3YL8vb%3D){1mB^>cg`g|WO9bDb#J@3?_VYP||~iX=Gc`NmC}*djO2
z+hp4cRs~Giz3O2zXE2STv0z>6Fi4GQBfRQGhVC|IAiT0lb52^_NE7RHfu<^8mF=_m
z#6Ie}q8zx%ZZKd>BTA9r7)rBxLOB4gk{xV}Y(DV0Rsqdu<?*@GF!lb?Qp#o150m)e
z1Eb>{Scm-*nf@EapH4^!F1|d3F`WYv6ld@`CM;}*gh72n%*AWDkXC1Y0fNh5{mI-h
z5f&!IDmpImA(b3A%hJ%J8&LS{0LF$l>G92G;W+2pRaPG9U105sxgFkMhwo3`yc5Bw
z6n*BxcVu&Bx!~sxF$I=SwhnSkyW6|J;*hQZy3zmuLsGc;1JUmb-&58|oO~2u2r~&3
zz#$dY4C4r<?M(vI)v_5A#RtYD6K<~vUiT)QSr4416^<GVa~r#F_S{O)-`MajBJ)2x
z^6~D-F7W*$Wh>jB*553G&gwlwa;mUb1j)k>C*}6>G`y5;-F2IPUGcCS=}TZ{ML$1C
zaTU3<&Q!cR;lr`zQa&F8%tv3H>V5xoYFk=f>7t7x)srgay@>*PzaQQeOI^&?xa>27
zVJ$jrbPDrVnN5(J?FAVHOgv@#RMWhNK9B<L^~N^H+axI{_Snc5G4D9Ysmyh;g5EZw
zl0xr{1APcsK8AuemnEOJb27oh?G!d2CoFsQA#fr}E)}vnIi={NbQ>z3tkSI;wnh|D
z!+J`1)DZ?iW8?Nw=+?O2thb)&EpvZ257wSVF}~3p%3%$_r9C8DeAdnxFEIjPJH8dl
zNsX*pKqN|Ee^{g$txc?f(w2>2^D<~Ajc|TprZ-ZBkI%#4lB4@anajG2TY-8jUGb_}
zkR860=pxO^ULPLrY#(WV-O3CVY21}=c>703c<|yVf8e@5Ea8_Q&@oTeoNpNBh-MoG
zkAVhb8OCh=Lo0JlV5Sk@3(#PsJ2Ui(#i8F>p!E867F~-BDtwJDk=-sbNbZIAFjs#T
zbHKD-Q|A{C+_A1|Nfd5qR6%!5NEj!&y!1BabPZ+Xf_RPjN7$xY&Q2v)Q5Myd{44NX
z-E6ar8->;hW-p8F+lS7zILGKm?8ER`w~i-Jvx#5qiL|UW#2omgtE};RKeAbMFIg@!
zMHwOINGZmZUI%rNT0?L4I8a_(trxiL!37N8n>}`Bnv58dBRA~hVTFAIL5&Rit_5*S
zoH(28(<I4eg+qL@L!B}hL+cZ1zZg$mpB_ED^depm!cuZb>Uk0>obfX0+@6DZ4u1;#
zkk5W>4MJyu`1iks@dz08+??^ct&5s58orZ>jk&*YG6amiR@=bf=M-N6%TRhBc70yV
z9!=B7TT*P7BW9+8Vy(df8bLFaf7_$-jT!GITwFT*i?5*4t}j@n$&N3#HkYQ7FzI!^
z5s>WdJTycwiHX=g{^z^h2SNuc<ETXQ9F98@^_XV0DW6*VGdVtGtR@uV@DyfkE-%*J
zG=c)K)FHVbe#6a(_TD`>yM30nJMyrBzcA(iP)vuZb>~{eB~mFV-}L1TZ+tpYDvAk(
zMTLWk_ByB2jV9p;2OA}crDY?kYtPR+t;p&Zuf~D8qim%*lMT52K3dno(3|zTJUCEU
z)xy8rad$-(OcHc*pcFdBWNm65!wJ$JlT~EYKY3@8`0%+GPIrPVx$6g$vvZy&Dac^%
z$;9I+b8Je0Uy=kZnYB0eVC{Gq#VCwh>D`C7?ZemY-}e7`+&(#MpX>vl)?7195EO>D
zPquds_S<M|faPs^x00K|mV2#g8A`4RgGos!y`k|w-dfso-LA3(OH<96w$4}diHXox
z4Uu1>JE7TStg@4(GVb-<lyY)oe5=@YTt&u{M%CYnISPyxOL4UAW58-;Ca;Q>8U$`E
zNk*v!44<+x^Ad_$E+h+AH$8jHGNy~6c$_@|?8FNXf>8jh;LUBJ`89cq+YMeH@;uB}
z!P*r2mV+ec^4k!^SZv=)gG>b!WLXUTHMPrDt3i`&NJ=opCDQ6-0<e*{jAq1{$S5sN
z>d2xrkV#Im3T%CBqAj%7W!k~5lHUxzEz^o}p384Zl_+jaT3c9~NtMa6#oEl#C%S1-
z>Ljx&E)hEe+I_35>A`5Nna;3`dw`dO|ER^gpn$k?BPG!YvbNlm<uTPjj;(VdRHIU|
zq?|r;FSW+h=Kc9wuP2S$K&bk7^X~Ow0!EfhiGfg2xrt$jMO>J0dCi43W)<Z`wqtHf
zimo}pkTWT5Fg?smL`y@dQjt`T@~S7*n0lVqUJXRQsw!l(7-MfnS<TP$Q{`5TZF-;U
zFx8slu~xyq*F~s*S8E`15R5DlGRo=f`~ba@9&M>)fA_g!2C4i`)(zI{uKHJM<MGx_
z4*7f8Xj$0VEN~tNYUB=pf*2VaX%M_$j0z^x!t<0ssbDgGROry4zkj6C%yAwGYB5rw
z3DLvgRHy4;@}8jQ-Vv`1;j9m`x(eXpgpUU{n$2V5n)GMQLAkt!0WJupV$_=v{Br?%
z-c56J`+$chfn2cb&NQ_}8RLlW(5ouP$w}InPjhlAaBX_{T}Xq8C;lDtf!Qd8K@`X4
zlz%;i7@pxnwlkLazn(u1gJ{HHe$f0c@O5J&o&RNh^(p@EqkOFKe~raYg8v%l$iW-B
zP|--Uq+NPSrX{D>3tug5Es1{b)sk?|T=>`P4e%F{pjYoiuk&gX<9@!XixK}KGmKZY
zhWJ-!(tp)lr{A@H=wdY|JiDk3-64DpIs+&j4Cr5cR7WMLd`X5B(JL6%u=k3Gwq!dG
zaULwszuC(emkqDcVKYqBizYGd4q|U3WBQm9r;2q?Wh(Xzm1Avq#p}JIa!ZxOz!Vyl
zi5zUh#betFc04M+2e7|AeD~($@Q4hg2f>-Zz%LWL&Q;NcGaB3yfo-c4at-KKkedP#
z14U{#4;ldJSOxxAXN*HSso-h+gw|Da6H7IPP_IBs6;Xj&m8HsA^1X2WYTCk!q6tT$
zA)BLa=#9u-&P6uBy)US!QDc6$Jum8FusZDT@HcJlE(V~vq2^c67vcF2(B%)yc+2*&
zak{*H^vmDj_u{Q+WB`|fI<{nod#d1I;xPP{B>bS!O17pIlrpU(@hXn=F_iJS0Bt9D
zZ+>rBmB3GA0H{H5=$&C?FO_BrQ}vw2Ij3N(r(_hkNeLF`tR}WUocv0uxbD(GlUfjH
z3UC>O2@f9Uv2Z3p8hzN`FzdmsXiq6YU!0n1&syQ!9Sj1|<Ovj1%)^xm%mFZD6Mk?W
z7BneSsq&oB#qBNLM+>tzhj6>6db2k|YXB9S@Pq3xbAt)Lox3mP<=o&pPRXOi`s$*!
z%%ko~J<_r^5a58uWLv|g4&-_4>LI}5Y3Tb5>rXvHu>IT>pe9PL)^x&XtA*XCidunz
z7O0evj)tTI1SBlBy3d_@lE(GgA3IlE+`8*=G=;l*7Jw8@tpGEVE7W(}Z}$^}Q%bw{
z?#%((u~O<nneGa@_0IfsjF@g5oyJ#|!5Hu?kGX_iE+ZNCnzPcgjkT{@r!J%E%rq8z
zC9GWRv7AwCitKc|?r1Eck<&GsP7)N!D0n;zVpR}*jVwfn*6{@QkB$oa?s67qm=dP_
z#x}{VpUhosu|m>$hf@O@UgNJ*af6}8O8|z;PaPqL24Yh{>;^5?eGz9UpKGY-dP(-z
zvyIrOwq)^oGKasc2R6s4u<c?;?%u5FLrG$qnhfB9g`tyE*Mce>{#MD`p4<d(Ph<9Z
zhX;Pp(Erki&Zrz|flKx=3vq|@+H0iQl1y)nQ&E`)V5SLD{_rRTfR?<$mOqbk=gIg~
zyZ}5Zv=G&IJ)54&rCUirWwUPKOm>vk86(0DBZ0y<8eZZlDNj$z#W!-pfe{l0;U+3r
zwSuf2vQDBFXXuQx#f)@EJX7YE#*3Aq=X*nEu!4VQQl}aVY$glCz5(ZH^f#?_Oaz9;
zt+Wp7bxw()Ifj{e0?BJOHT)#qbtchhiIHp7<(QJ(WSK-Vd$vrbW#<~VTWW2AVM#6A
zULfRKIFFWvmd`LY5>DQO5U=NNTM);ey^-*S!wEaS@F1gQa(f_khEKs$*!WVV{1{St
zPnNc+yg@J`XtFI|q(Bw+I^?7hO@_wvp5r1f_Qg!i;sv$wIg*K})(dL%#dtsNj%t``
z669YK@|4u5h6iR1-kI4Iqw5Hs)uhvo@v1wRz!nUx@0{+S?+wiHO?>YvLYMck@p$C*
zGDT&tfKR?z7`Bw_Q+Z!^5288~*rpd=lp2X_s_%5Y0U$#Pj<Af#5$C|scnqx+ObPln
z*C-kQx&~&Rp%Cb~hoJ*fDOh=HwY#H<kz@ov9WSsxcY=O9bT311?Aq&5{#ENMK)M>{
zf2xhWu{Ix#M4(^MU#eSM<3T2ICoez|(&7gy*6<<$u!HAT>v|*D4B5<$SP~WhJx*&B
zO0Xtfrb?8I(mTLb42~dcnJ!S9T4q7jTcC>hFZuME(t<2h*ii4h#wSlfGtRVrWPzR+
z<}8B@^<}SJuq^W31W?Rg096~t3+s79DqDpqNeK+u;2>l0SzO$v2>#NkCBt}p30O6d
zulo5E)77FqVHOXe5b&21H)oXip$js7jMdMgdXYM@#^JS0)XK~f4^<D$M@cy`hmtcu
z(t*NvL5gd$j})+c_wsvymp07Y=}=+vGN4gc?GyuBySUKrDvh=+K93hTh3dtHZ4S&U
zO6b7IhF(NW#j?!Mjyx$efIhNkAhJO#>Ez0G&VpD62WQiDYv^t(yO30vPW+)J-T$Da
z8iQRfx$XtPk(Df`a<u>Z(VLTfE61|yjK<g`X$Vkqk{xr{lY8A~Q#OOaMIOm{1C>K>
zQ6um3GTy8s*GN#ISK$yhi&j6%xKI(4Xb<5DgVhsPm9#8K@y%tYHMs<}cx_UGk{pa;
zVbOyQHf!G*MCnLzNe37~0h+<c2^D?Xe|JO7We<EF%d`<Jbx3JbWQ>a$k>9-6zepVR
zjFrM&tHl+`XL%JODcv87Hx?1bphr}yk|Rb`vUMcD?*!o4g_)wUKk^{;(abN{-2oPQ
zYlYw_1W8%2%m^AQno_75tbwcyx{#8RY7}@J8k&4cFFiNxF`;7-%JV_WK&evMIxSGD
z7hj33(TaHMot;zIF9+y(09AUfLxHC*0<VXe{U{^^Id@`Si<NJ|QYFv+1H`8LNc~Ko
zY5AX<>#bD&=k?W%#*_WWV|=XkAF%ittB+Xq7%`bi!edA+4P7LfbbWjGK>Yse;r3h3
ziUKcXSu=b9?YdC_l9D`ryPPT+!{1}0QMOf}FLZASMdBM!Gf<$aD@Ut>eoSpj{7hGn
zy~M&W)|m5sr7R{(-Qtah!TG4aQO*1N5ggj@w~voa?e0G6DTo-HyL|r&L<KJi$oo7v
zOS>u9h8g(c1+0@^$}+sd#gJu<p&erA3=R-8W)6=X?9{z%M47=#L$O&Jim8JSSZf#E
zYLR=oE!9Z#J{oD|-hSk*WfprwcNmZ+S3!(ImT530Z)sH2O-F3;)2!Gy+vq7!g&HYJ
zisx>eZ2}IgGW%trwc1);bys`q^=`AX-dk^Nb~ZY_X47rF>^D30&Ss<2ZLN0tb*H=5
z-`relZmh1Zw$|#Kt!}@w>aLfX+G?5Aoj$cVT$$&OOwSGAr`5XyN(*cm)&tC5pO!WR
z;OIlVeh)FS73J=YG-c(3j_6<cNVJcayLi!o{T}b1d^p}eLRSS0_!*`yu%N^*vIO6+
zGIcW+L|{G!ytbDaA7RGG(j_(^=7knMkH(=Uo_}NzoS7gvP4-^y4f0))7K4Y$@ua)(
zgSZ!oyXnGNJSFt(X*7d~h%=bJ{r+-q+wZ<Wtj+(vp=^c>yf#=5Hs7GTZ%K&p4m`q)
zao5To%z6=yH!kw>J0JDm9lqZ`db>3D08*(8>}&bLy2)o5A9RyGo_;V-C*m~ZZllrR
z1vnal%EKue3DY)GXeBmW{2v(H){^)i7~j^CR!@!_GY6-hV#%iH*r)o%8Ev&hSD$L`
z7;vy?^7Fy($=F{|a7GAOS20!uO@L7YLWO|yIj@lK7VOGVq?ogxM-gH!F=^t3yk>s!
zf1p8tb((9F)wqiG^8JUMgEz;&8m2|J=mS-H0=Tf<(CfGbQ<%kApkTPlHo$n0#N5@5
zX-#6Bj1lMAC}VDRHyDhZF{T!NEEv2`fPi)fIZzlS!-P_wmgWOQ&VHA8EMw*B`(5Hg
z!Jd~h4PAJkN{hep&i<>p=`*f+9}OIa3TX2p0|OO!_-WOcRyaOgVP|T_ltUF~>fr~`
zq<bz)PbHdiQYKl5S+OjrIF2wmC-qniHerJ%_W9sEA1M;y2Sg#VfCV~%TBfY7H`|Xf
z78!n=E{3=e**HCq77YOK4v_~t8mpwd8YW>#L#*&n6Ahly;M3cWgXnzH?*o=qsX^<_
zkF>nu=;+nB<tp<Kxwk(iLd*uXTW;NGGspY{Eot%608JvGPuWMBILn@CpO?jSMB4%^
zMPJi1SQ$i3Z9K1G_~ZjjL0JQ}^HkpQj!Q>3D(T7|Ah^Okcc4LVj;-*9{6PK4VbimJ
zP27pAD9Vp9)%tN{(AkNP&<#TG3tF2<Y>Xp+O{F$3*cSCgkBxb?!e*A;3}}H+xK|#j
zSdsDt;h<--5_@lscejuB(krQ0R>kOvYJO_pgkOmXd)zINxrgiVeYQ*By@(3msnart
zh+5y0r^utR6<dv*SsIK596tFcs&PVZWg=*1+T&BHS)x5Ukkad@D$RE^&AmK|@p-gm
zdS7mxM&%dE<fXE#hn1Py0&XgQtx`>PoG<sVT=+s;vST$I$(nxlFvE+=PkIr2c6-J;
zVRllo9GYjPO0#cwTHCbcx$97v{`vN8rttJR6sR54SlGl@v&t>aMweVKxt|_ky-Z|(
zwDro}Zr}QXjeuzgD1>ca3_MsQN8eRkCUnORg}HV7-j4xtWS&oXVF!b|oM&@OPxr8@
zYTEa-3-22R%!%W#FI)d|zKFkmK^0OSuc9VZfF0JZwROBh(^C-d0|`^|%0!tSaja@X
zydXJ|l@D3%wq3!+f=-&%S8u;~Bj7DM0|)+BLqo?CZEVme56!(I;|0uta7M=BSyyZO
z5NadcYBl7fGQ;a`F!Awn0(Ec4Nyf9#!TbY`bQ-fTuW#P{GMkDuo`E#Kz!V5-GMDE8
z&Sl_G6l=PxEIln06hU0X0i<qGkGJ>sV21d{5gpMjH^m%%E_GA;KP&}L>0}$pkDfm+
zrz;o^3)P9|xV%MC?rc+5AxED)RnZ$OTH}tVDqD-!Qeq>pYUNi>f|P0Qw6a|4-(D~N
z8fiXzTrtkpomyy=QnSSrokjQ+RfvHt>;3lT;6RM8N0`C{T@~io1*DqMp_hPd8BaN7
z?%SV`MJW5flV4i_SUW)nL~VB%gxCM>1zp{zmiim^3U7m;`e}>~xdB#rvl+dh5hAs1
zD7lo%jV+rcl2N{wGYX7;HW~Dpw93|2rcdjE=VP77Hn}E9IgIk-DEC5n=OWc&K(nC7
z!bxynF(T(d3r%G-h(%d|VM8nT4-BPplR%hxU%lObdwBFuv3Iz8a(I+iG`8DIk^xa3
z97+-`?~c!0-wnyN3Fi<_(BxEl@v?Or-di6b>n7XcB$&R;;>ZjEnKLE1$sG(Tf!m0E
zfzd3G&KzF86?2Ei*WH>OF{#Z4xJabZQ@c`QL`@R};9@cK*Vwz5Mwf}LlIZb2OYs>a
zUQi7D8XG0QpkM#)d1r1ko@wplYu?=TR~!@#VJV9NsbXq?(@W9}N;GJh;?k0RJND2!
zv@}R1Bx?jozP{5tQGZ458C^I%5L|2J;QFF8Tx;dvY67%uaRrPL6#$^AQt|fQ#%T5-
zyG-%MO57M|*TWt}Z(#h5*Fof`?*Jb$91WCH12WrZK$tm)i88WFPD*OWlSwE#WPaDf
z_Pi)>KNkc^OpAxIbI*;hS9Z5gjHnA_?ZI<ldtkayQGB@?I}T2(#JwQ_`(vW2Yh^*O
z=mhW&Qv)P0ggkKr>e?o*Qq{(pc8R3{QqHCc`Fg~s$|V7uRE;UeMsqtka<>^Is#5zu
zs?%%JBD~D5QBB&mjfP@;BvlmGophKb3Z>?XHltIgi$?3A*VSgs`~eK(4l~wTEjMW;
z(O4#}Dp+jfu*-$D&CQqE#@iCi*@%Jbe2x^F{>T<dlxRAaUq|s&UBerG5c%ZRB;$_y
z(otW!Q(EEr`UX?k@A@Gy`e>{w^WeE-v}1K>TEs8=l6}lT<lyiZ8MFgAkR&vjj8(?^
zBg}sTROiBG4T23E?Srh4GkAv_mA;6dQH(%CUWCN|1f4%%gj<bfYjsM!7ZjjNU6C14
zX6zMACCm$Xcb8r|Ra&>yhy|HnSZcg2vEC%m_~@yqxe!UXoT}h<2?~oF&EJme;ov!z
z24>cg<FaIz%~V9ULHBCR_2LC8QITmo*Hgw~C93h7aW!~sO+_vdLT3x{1)N&mzzJo<
zJj+g+Z8_$7^N>qODk6%gv04r&7z~dSPO*%1;RORnZZ_C^7`M!)EA!a^h1w1@I)VB=
z=A<EdE^w1Q4jgpELL<N#kt#Fvk|;)@1?6p$9iX~}$gDtBm+d$@*^UNWe=-;hqqE0{
zud;2M1IC$I6v3HjyAEwi^2m}tw2o|*%t{N(Q091uhdCIK?YRyGj!IK78dM7PSidmw
z<S=x54M`Kl^TuMyb<VXuAoZ`Exa|L9fA_H{i$>$=44ierQ4%Uz-_j6mE@m%?8f9;Y
zlmUHws^hSp&9gpoVQdUU6$fPNjl@B-m~oktv#?aq4BhnItaU!<6JTWUA&yf^aq!f>
zRu~ZU#lgf$qP5OSNcaD~ePBjf#gY85`~#H!0g$Wy6}Hr1;ylELk`d_~%tGpdYy%vu
ziq1+#y1;M)Zw}{_B%!l{vVb<-*Q@*`C??=P+mhc|ii##vds_-T9h8WVQZ%99t7wHV
z9F6U9{tU=nhJk;U1X+D36q=Xw#@Wn@dpN%`b&6yPE2Py?j-~>XBUj$)ilKAm4JSk4
z43WnzC;sWty}AR81BIz!0RzNZ87z<UqyEA9QU4G>iAG(eJpChWLu+uq0IV&j0LMbw
zAO0>l4QRS%0p9OuA)}k(BbyZT`^)l*BJm=Qon^FJ@`6io)ux_!MNV_txto8>88>R?
z^wMwR5IRd!rid3Veqd4WFUwfR>J0}BM5P4B0Oh!BWImlg^T_Q^Lbt|lwb6u(pHXRG
z==kjOs-?<sW)>NFS#Ot{ozj{#yv}rN!Jo{Af}Y>&m)mr!H}N?T4jNNslj#{=jsVAz
zxVpN^x`C=#`b!^t4#<$`r_fq}D4v$}JB|pxRI%E=?zsaOt-*O^<GUv5z=QEsF$FWc
zEV!!<#%)q7lN%7Z0A@FpX`8L8oTf6RvOY_N_~+{^j`nG5kt4+*dBb2aHriG^JLq5%
zWw{t_YV=z9o@XW(s+i<hDD}>m32Ed)x9hUjbTq&)HsKKP>UtWasPSoFN`XjXl7dhH
z4!!yDkU2daI{<<d&xB*+jT|I}<KYMsB31a|3Pwygea3;UN21neEBzm_b&RMHaS>6~
z+IVJ!Uie7)1(Mj6{C5TVs2H_GMFupih>B{qa;khU7F09=uj}F}>27+`T~7Q=Z}sAM
z(F}#tMls@l;M<b;8D8t96Pl?A!v8Gk4l9gkveXvvDo&3*;FaM5j($0236+DU)eXt+
zJr?GARE6ThyZDt}KJPKBF_=h`uRwOo#519b78z>>z*A#azM6uEW^E>ezmnFq<V<b!
zmNn!SIDel2GL_I75UHrug<vw-sKOrZ3S5hm2c?J0p&fQV4x8Tw#~z-une2kh*wpMW
zG|zG*9$V6=kTSOjC$TrO$!tW65}Kn8Q(j%sy9#obNOUgG183;zx)Pa=jRPBIN3;`k
zw)kFD4TvZhW&h|FjSR`2qHWnx!JFJMnI&6PE^>N3Vjdg7U$rd0U&b_Mw*O)}N<1WR
zPWiM0q%QFSrJk7F;}ea)mBpbE!$d;$z#dwmtK!n2<{clUv&DyT6+6Gi>7jBlGdX7o
zIg@5xDI%0XBO7XHRdC|2Vf7)C2R`iD#2%q^ftxtLSrr=ASsC7<PKfeup4TIdL0JKP
z?`zC+1>!$GH_c^ZFMOP>9-KZNj$Wc+w``5wAhDNe3tYtV8A~vQ^Ya5qSM4ldUNu>X
zLiXJk)0iUkmDEHkI%k;~HnW(9Ad!-P<<ZUFXqu~Z2)$6S(+i3in)Zz*V+byc8O-u6
zBIJNh<EHb-F>>x&i?jDc+i`k7mTpYPfDu_|W+A_vn1iw>HjBk5RubXv_emuFI#7z)
z13E(sx!fFzHN2K(XCHlB_2I^EXAvK3gr>`qH2RYFu%3)gm4CJezPhGl!aw`)lNP3q
zpT?L2Vx62OO_rG<GWi_-jQwHko>uc9p*1E}8e(R&zWH%QkMXBPLqw*S()=)8PTZoO
zPL$~<3Pm2ws8yei6{&$T*Xc&fazd?F^3^iwP@WdmOgD*#`>ktczJZvzf2NNm{;%hc
z-7}7!{^Py$fl+=pHr8_D|I#NN|95S@`Cnq~UV5MM`45l(J7xXDUgz#%po`-_H`g%O
zb1MILeRcgQ{_|seWW;A!X9^8J^`Zj`)?B|Epiy`Y@da3wXBbd@bS;kdc9;)JT&Pr0
zGMtfTm%*nPOiElDyD_<xdD)a+N2O>2Cd6o8-I~y$Si!NY*K{zdSnU;g?BPA^04>Nl
zL0mVw=uL(rfqWnUu2QcoS1`X88PUUDf<M_Y2fjGp%BS*-#)-j3lV1+}G-#CgrOxA}
zulT(KKTZ5iU+9VaN;8I^7XGF$^hAEe@4a3R{#~W-u8Sa9iwS;ZIT=g)i#Hm%z3h-w
z=dv5FflHnIYRDojS*;_BH)JoBb*;;XES(H4na(_8<aYSJT1O&S8GZ#jCH}Xex1zc*
z=AiW#SC<29H;i^v^;JvBW>PZlO?_#pFRR83wA!syZKDOF6{98jhmJEANW}n(zx+x(
z<L}5bN|1fw-sP_x?9w(sg6s)m8=FGk0vf_QaUuDJRvC`8we^jcn_RJD-3DJ0a7`WP
zvr;$GNT`WsPDU}Eo{NTJ%5Zno9=TzJi7x%FOL;j?4VmJY+oTTMo|J-R8bZGo>${N3
zB0V-`33dU}yi_sBM#;~uyqZ2n%{vG#s)uFr?1iDI;CVipYvN#66gfxr`0dvL3V(eF
zXguhI$X^ae4SUUXhVg-^Prz=eR?oLp!#I(l<M*B~Ldp8drY#<1D6Z&wjk{f<@C#0-
zYm~F5YqeFz;EUBi%(~CA-=NxA7)(Yg8-=VtyymBMLj!<!8W^@4Wd18OqvkTd936gm
zAJ?F(Q?Yya;oXU7isO@`{q48Ms@b3Q8_%nrJ5VoTd(52QRn>JJ^D^Q8b)zZtJ5LRL
z#wP1VlQ>)H2>sDSR=ryz4Uq4Ry)SMJ`K8*(xhA!PA7oHIbd9Sftn0g%)B1{Y0my>x
zzbI)N|D`OTrlYW^#RC;M(1HY2w&`5E(PPhN0adWBjQ_y1Sr$X*x<e@d&)_grH+}dG
zeO!`jHSAnr7?O+y0f*)YLyb;+c5y(9Y)+e|*!K9E&>JsHKV-~2=3=N)bbO&;GYe>&
zeCGC6=zNOP5Z~NB!#tlxf~qz&*v1Ci-dNXX!Ft3LaWcAa!laobt#Nq4KiUDPOA89#
za@{_{@2)cz)wqFb+}~+j7#sXpNIYfYv>Z}-Du+y#&!T~)dwjJ>vy^RCp&JJITl8&5
z(5Z7kOnjsrD2hLmsi}ac=}g8*x9Pzj0f<qCfP+|wXZ@+D>EX@l&1Mt(*kiBPFks^v
zv{x3-y|M1Qgk91ws0Z{$<TDB+bFySzq^0yCYNP&4>e*>t!3YXZ9a#)u*+zq>kNLiJ
z_kK4<v`#?hWvo&s%;HS2+=N1pTy)Am<&s@(p3#YADx*Dg7cWcK!Mi!wS2*AF@l-Ym
zIeyZK$X`2SXTbAQGUw8*_>`$fbxC3#V@k<d15QfKzMXc$xED;ur>CZmc<!0VsVUP8
z3a-7J_@xtR==hg(VoLMdEwAWn@5+d=CnK{cIIi3osn^%nS=kVVlMzO7h{W#E?)s`w
zxv81#V5^vsSGKQxE$Hf$tM<gla#$_G7pKqqalkiGg{n0b?**}-<M~c_4XwJL`Q=ME
zY<kZ|6Bu<3xMKGbj$5u*;f(Yk4*X3d)8jDSGU+y1v|`~ow$9w!q|_Ecb6Xy<d1qaA
zW283)tY~aDlHCf%HmH}`2i84M3jgD2Y3Q#Zym=vWo8^>WAAC6eb^G9emnD*!u+4}+
z$QrZTGp$);2#4DMju+fWWRet}Bh<&Z+6^?>2VmM66BPI`$20a(gX7(~rp7aD$tW02
zC?rwpEsxHAEA=tL=G!urx97LvG^cnGz#wW(kQ=OHgf2lW5b%tWjL_)OeWnmetT>X}
zKRU;jS!=E<)3eYnNiQl7_`>zV{xzG%%R208wJbW<ydOEJj53|4+^a%GMD!x*<Z<qu
zou`3`?rl)f7n_@#YECkDYdZqz$ZZdt2v7=>SZYJEZuPh$%%e#xL$VHt4p-vpDtjX@
zXGHh3k!Ae3Y_A2o3XrG#-oMXv#YmpEMYW-F9@u54w80r<(yIXN<$6H=Lrp<!<3n;J
zZiF4yigzZCB32mFrS0jdK^dgj>A*p9hJ_jBh@&TJK!K3R)8FZ>2<GX$A!b5%w8)4H
zB#;w<fwCA58yD0grZqt(WX@d*qsh@IM1Ys^0hWRTusPIX)Dg)VcJOeAK`rB7pA`Xv
zp^-EMb%vaX0&v|zwJd~)sUXv&q+~iFEaifg8DXs(#KX|&yf5S$<zj(+j}%OYI-4ev
zw1c?^<e#u!Y3oRmFZfw1%k?atdIN`I1;#B+^&K~QqOeY34@3<$5TkJnUCXdWk5LsT
zcAi!Y*YH^@o9^Pb_LbAHk+)jnmlPGzl}0^>u*juzdlG~|Q+^VyG9*RKr00=QUV;Xd
zX_L4!`uRZ|kr0JUnlL3$NhAaky911Prln6Nu85@bkH`hp#mJLU?j>)2I6-Tt-^I{H
zv*buTe;;}mu=(11UO2v9B%egJ>&1cRPp(+Qd<_!ru#NX;F{3sPFhE8qS+NPdt3|+Z
zp@>%1YmhfNwsp&Qi+L6-GE?-eg@@{%djqtq=Wv>65@YgDsQ__E+KHHVgUdEC{uJtD
z65?&7_7KW{al=47AFFUt?6ihXsyx8OWv!Pe&<=cny%Ty7N+j|)h#OHs<;cV>qtZd7
zOpQbj?vYcJjz%P~ZAGPfGu0YnNE21VRwV<oOyLCy9Y-|l^$F@>;0#;loHTs=!r9{v
zM;^KLV**)+m?U7dCPX{=1c>xgM8)3pNRLD(T5@Kfwh9<QS#4P!SVS5bNkbP8I>Kl=
zr4)0i$5JikUYZ8;tCa;($r>DvET#=PKCmcEXh(AF>iB~LarHBW^D{NWxe?>jT2;c#
z)%vEHk+C}j0!DfpIwrH{%x6AlJ_B{D#)Z{+^ErLqAU&p9?ln|VTN=O#%!b$o84B0m
zM&{=1PpXUJL&TnnDLEzdO-E8D22Mq_HEd&Kf($k@<~vP@*|&fw*d1|wB4Jxwu>U)O
z>EeqYlHDu6;cClNTN3?gs9Sl>=NubAXzB2z>;z--7Qb|vgdk7v@-9HGNJbHsl#}Ah
zdS_=YqV4Fq7Wg$PPkHLoq8I9MT{n(;8M^%eJ6r>g_U7H|Lo+0BJQPi=yF5otNFx&{
zlD2H*;6W6F1IMArXwMlt=E#i(SUoH0v5hhsrHj`kSsNq>WQHjRWB_OjRkGZATA!5}
znn`f&xRcQ1xyD-1AkP8DYd$U<^@1HMj4~t|h9vMI0Z5j+o+br5iWH>!$RJhbY$YEm
zF(L1Vo_KDCY?bG^NA^HU*jqIEu<&><^A)Ov@}v0ozim~rhw#s@64Vecc<SP>e-%Zw
zt>^O3=_P|!iW-4=e#V=GE>^9Z%bTaWosM7lN$m%KA~LsI*7;ZRThR4w%xwRpSWKmA
z%T&J2JYl{%9?YdfK@|89pNiI!RUvFkLsz;KoRO>?GV{RH9t*A*Eh+ajpbJ<|vf|ae
z<092ndQ^BG`jp~#f?>yjM;Qkr>DAm!2x*id4S#{PQ?(Gsv|UJ{e=O_Sf$4oN1`_oy
zTS7*;uXATgT<B#6Gj#{eH5_6EY-dT1*mQ{p$)#fI&~GAzq2~FVwEPo*8bMfmV$XuZ
z8Ld$oU6Rh5`ea~WX<#qMx1(0U<T>trbOlozVNq|6BFqk4s3A7%{|jM)wW%474<9$Q
zVgP661?3A9-x*+o!YU3FoZIfzDAY*j5*lz=PQ#>wpS042D>v8bnJZYZiphYg85~Pg
z{I}w73%UsWjGv&*?4QL8VT%3tD7yB$P09ik^!sy~f}`A0VE^50);Ci2-_1sA?aBW8
zF+LPICt~$Q1cVqvy!U#ffjV<3Iu%K|c$f@b2jl7YCj$(^MdAWdIt->n$ntCfnK~BI
z*H`K*^<|VDK)}Jfv;m#ZP6tF3PRr&~nN`vvTyqqD6&V=`CN#!EgPF?v{qaBF?J5uZ
z(ZK6EQG9KOW0VhxK1&Oqb0>nvF!dBi?WQ2DJvlT~zf;U0AAJR(OJ(Uom(CpONamhi
zfmVKZSuHo#U`D1e9k=UDB9|uvg9wA(qzfJO@M^`0l7O(<0NGf^>*A~PV8oSwU<Fc~
zx_pG!ttbaVlkjY)+Tn=xD`};gH0S4S%L+C7H6>m%qsrr%qUogVXb+<^psVQ*-b(Lt
z;sXxF9{}}~nq`?}Tc$>~X}_CR<u?{OdS3lwk%>8<B=uVLk5iFWc~jB$c@T~5<?&6r
zG#;q-()dQp?#5%#Vxr&*5y7j;wL%*NFX(A(44r8)z+hI)Y##*dLbsLeRGw57BP7>?
zICjUAk%1HVoIMf<)tf?+-YxQJ9aS_4!q6LwsxmMLRSBc|B7P+R)ED*A@PbZz&iz%S
zROib&%T2vAo<y=^PGr>{c>d=$zaS2yf`d#6Js-LAUMJQrHt_KO$PMX_%c$p%)W)YI
zX$p3zBu7_99#;0kz5ueUZNXhn(yg`}DR9FaC@84BEWP8a@^I%yFnWn>gMz$C@ad1s
zfbT5<h^8xNiWjFKjyY!-5`=ZOvcViME(lBsehze=wcajLE%PczHBIU)w9bgelkVqb
z(V4KXv}}i5P05Kj2@Sc$O<y|KeC+UesUZw9>iH8UjY!3btjo5Lc3&$agXfp1Pwshr
zPhKTqNg;Q#>x4jJ!o>od7!f&Fv!JMsfL)k=${S}lp&5>upY84Md;p4au)qIai}A_t
zjt{o~zJK^yygL+!@AgwKG2n9Q5e|!}@b8GANMu<H15E8C^f|eda{<d68v+;zA6ps*
zgPww?6HiW>X`#*z&p?h1?^3!diI<T+<J3i#P7?6cX=DDmQ%#q_$a}Q^{@~5-Hq2R(
zsYXJk8jE)&Mq1Bh$;gSEv%)V)P~wvpTAX^{r?VTeL54H%E?j9YOU5Fp#iX;a*aT+U
zi~*qW{UJ$pc7luh?y5XQVshZc!ANkdB}^*xfyr|L8*4M4cxpd6^b$(s$~wB2;%Mf3
z5^s<j`uD;C;sArxm^L(WfKg(qmjHORYiTVbjkOeyI3fqfgtttyITFK&DX6Vl*&7KG
z+!%4WEL$T>k(NZ2GT9mSMWAJD$RaIkhq6#p7HSq1YRN*4qC%^(P(3b`pnW_djakuW
zT-7F)snwjTR%@<Wt25P_edkI{NK6x=fpg(9<Fq=%7L9EaiVPD}Z*$X|WZg7E!i-zI
zHs%|9{Z?-M)j3I2R79gRO08M&#B<RYpQctcX8)AKn1r6<G#oyJ>Clz4(pp+AM0Owb
z?`|PxH<}wLGOsiMLVu&%ake^7xDL)zNn=v>Tgo1+d)*zl8TnVUK+q5`z7n4<=BQ#p
zKgytR9t|(Vu)J*%L)3P5{LJrh5NQNU)nA=be~vQ{PaP7uy`fvg4G`~18U(CBf{3;p
z4PGk^XDK%fDs)G&;9~M;S_kp$Xst>AfW72Yl!^^MxTI1Mmr(;rA$*L8G9YtJ?G|}&
zt2O&v>T*z9Lj0zL%A$cTz)-cbXIaZ~mT4um^Q@H?&u!#9-AOgoRtD|osyo;5Gy9Pc
zcQcDTowsr3sk}N@Ws?lps^0f;b{D=o-iLQS3-uGPS?a{gFSS}+N`hD`^8hELaS2C3
z`H60MXXj&?--5zxVNP)(CsQN<bwDNJ*!q+j@zQ8@n&s*=?E+_Eoz@(6R?RvZ^Z<3>
zAST%)d)Bg%7a3)0ncpo0rfkVp>5{9tCBNbA)GD=|@=L82m&$CXQntWP+v%aV6H5KJ
zw*YlOioY3usyXF;8iMT>qV=b`g)r26yXTIFcWN50#$wMUCaY0Qt;XQRw|Ws8YD=ZL
zVOhQ1>m@#0u_6@nZFkN7lmby2ZK%g7t=A0q6ir*{`%@P-3-2z<5QP-L?H3W~otnLj
z&;Y!Lxup2+A@DVkbGbkk)vA+JN>_t?w+Spec4>ir>H?x^AZbRx%TwabFW%)T{mO`T
z`f@$ISf>Mqh|~z^i{}j5u?kNIl2Ib~e41Zfb#GBx+v;=krKmyO;79h7jh~>+4@eL~
zO$U<dC&MbFi#^B%p_p%b79fgcMX*-YwvaC@>Z-!E$+nb+QUUfQ%c2ntnZVC9YA7Ta
ze}^?!uBrMR8<Goc>%)3$rW!2fJGxIUZ=pzfTqpJ&CNKFQD*n4QY$pZxbv09$S2Gzh
zInzaLgRfmwBe8HtFPpZP_r->Oe+$RsM&|Epm_9vy{%d;tS9;xX{qFhD2|v$g09b7Q
z2VYxjY5TucYvalO?=e16FhLatuY5EaA%p#+vEI*~aqOn<u!kF3+`tzlLP`6BkMJm@
zm*^2D!qaSc3@OgVEeqcrqt9vL^l87Jr8l+<(t4Tu(Ylng;!-jSf*J)`RV@QCO<Nzw
zS0x-N0j8FEoe6cJ#()4|hreX5xq4$!sddE~+ck@tD{5mkpi0(?`lIrtBZKIhrCS2_
zEeA_Ewb@UzZ8xk;n?lXRao!?0OfWAl1s<w=@+(G!H}zrb>uxXzpaoQ-_wXDt=mAD|
zWJg+zb+y8s3G8eOZLC$#m2BhcSevUkqcyv|H-QR(g#M_}t44i!>6Xxxu+%u!O4m9|
z*NR<J@Zv{V(O~2sH6Kj=q|z@+PZeo!TGYGN<$!#(tp1o8OeUogJ&h(HQ_hId^Pw(c
zE!*VR(u@3ru_ZBfL0v4P(-9#aSv)tFyeOLJ7=#glXnlKZ0Ec3K`^~$9H}Cd|rKP{$
z?tD1-tpsj2>n3tjV$@Q5V$Q8JWiOShhAeM-4-Q5XO#C%7_~;6jeIe=en*(Un^*r+k
z=dCyx1*7>ooUa~cHJqp3`J8wW%{k65bB^;1^f&bUGF4a8OOc|@<vSf_fb$?H$xUkg
zQ`lN`mJBC@u~!?PlgIv7XOZMUB06rK_@yU)X)3>z>els1B_zY!a7+cX_f-KsdPU7Q
zp#2DQA_2;txmP1m^L#>&8*~u<^y>M?PrcKn#aj&NOWw`+c;s~5(^LBT>VNghZMu;+
z!lX|avz+b+zxK9!k2_7{@t(Ha!*03yyt^)4@oD4Dw(*>><BdZnytXBa#?Rwx1J-D-
z;jP`yKVKglZl8$ZHOI$WsXy(zd);?ySrMai-5&(bqi>=!<1&N${62P&swW1ne>OhP
z?jP$0c>t9}h&MBQM9EX@X}jF_F*W6s`l|Z`JByL=T*e&gxsiu3H=;aPx>&0}(0*AE
z<3S`aU#Zvkx+!&o4Cga8Gi>4~tE`S&7(}(MH#&F2OeOr}>^FW@xaaV5Py0@Q+?EVe
ze5&m2zux|EaI#g~-al?MU)GL)-EOX}f2vq;dcIAn20#Bs#m|FoR{Y%GhQ&`d*wVZk
z7eDv4c`f58Vo+1@gGwPjD!CsD`?Vh0@>0yzJ!6c*_q|o9Ti7or2ghyLDs9*+?O%4^
zw!hK+LVX)C{3}aud`|KmjPMp2Qzs{V<PK#D^y|5m$^}GIACA><{Mj3gRF21G0kFPk
zth6}0f$DO_9v2Ni*<D9Z^Fp>6eLo~^!O#8D7yE3pPiPVBOP9AIcOg{xxldwc8BY<x
z%EG{w6Xk1P?w9yXvHx&_d4oP_pDFR5RySI$Z2sTXC;N}b_?T(B1V^JMY4he9k5_)6
za_EYiq`(T`#x0<EULs0<hNU>Q4t$Y0dG%B?Kbj3zq_GJ<ZI6RC+JN5xu{2YH^+)hO
z{hiIHGZIxOk0vN=w?eTYxt(loF={9ooBBc}=xiLxgh17}%;k$y*+4eamrBz!in}+H
z@8BT5r&MP%CN+~*KDdx^pec-UM1@eW;+W3llmLY|BgQzK;E*|*Cys6$U_L#%)80OO
zty;loGpgiroZ-mxRlG$G!Xi3@p!=C)BI+w2Q)d&iKK6qU=>0CA5^;E>b4($7TCNV=
zm6a@u?PL1MOH59y>>qhm(rCg9f*Z-mKV^a1H3kq!<u$8(fYtN8=p5b?T(;CI$TUuI
z3a9K6Kzo(ciEUVZHpE9SYO^UVE_^z8rV0`S3(tKygGgl)WMkvFH;e~^k1*uW{jMZg
z^1@P<T$t~xxC+%w#tV6sMIB?2)EW<pX0XEHm;$>$5`v}rKQT}VyK-S9mo5lFBlLK{
z&CGdkxM}#lmhL-A<Ray`bWSlcG)zAv!$N>Dt8Ps0kPOB#&S6{S?2y?}EOQ3oNxr1E
zY31C1iOO2#Hh<dNoHWLv07jC<m9d9ak0xyd=%lBudQ}LMvx_O&9CFqOU`mRIxgH3*
z?7h%&DN!2y{lFL|UZ|;BaqTOj)H;S+_&(5Ty^<AF6uCZ8!8i460~nw<;uBk80Y+hS
zJRe;FnfAy$gV@Xiow=32{6$N`H*0$jMErJ~o&-P|A<6TXGvUT*7;X3g-NByqMP-TF
z!rdhyiU_Y#%g7W_#Fb;2rAnru&>e?(J80qyWp22s(#yPC4UmU{fhn6_)UJ6lv_Dlf
zsVX;}tMAE%5l@iP=mH58Pq3C%!7<e{av5fuA>{-&L8)ylBa)gf-aQzFFs5<*29*bW
zN<$L(irL1+n3fqewYlPb)eBq-g0FGJ+5P2<Ns5pAPhxESV0ONC_MP{^PgWXNx6k|V
zX#*x*{Fyf3ET>x(^Bxbn?TXlWb7S2%PjA~{`7Hg@-g??w`ZwF&Vtq2jkF6mt;&l>U
zy}NG2VSRCnNnL!BB`=G4AI9Fm8(%BbqcMfUc$4Za=qRXXr;jI(iywvEAJb!tReH(1
zB*r8=RlgFbEX94|m6lf22**({4fw^vl+*EXn-Ay)M)(to>z)$QtmK9UH3!Mb)-zdZ
zO$>Tq7zUr)lMxOAr~c~YoRHLF<oCTRg%>*bGW*{){8|lbC%WCAeiD^yyzR^z{qdxW
z`GC+u_u5os*(Z{B@SrlZ<Ho7SIlm(1k<{CK2>SloyW+;J<h|p%z8ckiNz_`8zbV_C
zWMAW9%Spo`8PXDyP>h@~a&d*fEwNfozCydJA~G^|L6uZ#IMnkMrwPg&zdwABSxV7u
zgu|IfT4vlI(Anv%`y>2wv4})bYGUv#4PEz#x%n2S7gLh55`d~=Osu%dC>SNTyAQ+7
z0M@-g7(N=Z>m81b-Wp=)4m+-uW%}wE-AJ%A>N=bxG#@`dL=p{Awf{a0M$Q?m!1G11
z{r=6|cQ22FbE?Xjb3P-Qisn3s`h=2?gOUl!-2cb>H%I&1CrA%jeVdTQIdPNxH3hA2
zdF%up+ryr?9y0MID{8&Pi2ZQXk-_z-$f&wJz_BL`ojV+jufIuDtS6{A7ywKV=sBop
zhOy9+oX=`naeJFyuA3v8zXTY{A}I4wI(YvAb^d$%2OvklgLn&I06G2x#LKK%J_7eD
zEm?;WbKy;`@xYT*?<pXgGq`lFBg?$$>Paht+amNZv_1NG+cFyFXWdR4t0PHtL^Qy#
z+R82gDF@k*qNRb#{jLIfQv5@Tza9X22|lOVlWab=66c@qxnsOJigT2~iQ-3Ovc|V`
zp}N>gw*>>gNU|%FEjwmaMh6fK95{yIKF1C)eHe=*1SYq)m}=>FS5iF~euwN|M}zA)
zKO2U|N}52#qM3$4pz@8Snu~(&XFPT%eE@DG0~TT{o)4&jfwp8|Lx5CofFTXX2wKeZ
ziGWT|lZHf>*SMZEPaP`DI5?J%96fY;K)MV7W2!xhTs|3(CTfHt$&XDhWl~ql@77Pc
zV>l2-rdpIq*C<vdrkleo@xT;N-2Ig_LdoF#ZVF1=yEmlESy;`9KSB)clIb0#{_an{
zd?6)CdOnn72`wk00Y;LAH3CTh+N7fqkc`_V(9)%xdr6TEQ~7V>sHh%CMfJo_u=Q0~
zRL^co%}L(yIH3(u<BgKF#l?~XEfjF_JW?5_uVesJ=x_WS9`&9tF0HW*;Npu0f2rS|
zS{tzsgKJwge|)T>itvvBRxh?|jxE6PsDNYhR5VV7NtCjBKr)#EI5%XIw6Uw!qL|5^
zLJa5V^0FXk)faE=?a;ble0q|Otwmzpbg36=9?j|VP`Aicp7&o~aZ>E&G^5uCKLdZ+
zKiU6>eg;YfGEieUCTwTHy`e&AO`oT_kwm%>vJ`$A`qs@Y;$bp=6je8PlB(>mN)<B;
zQPTQ&YW%l2iejxfuO)D?{cnA})oP^de;XUCjVJrx$M{&IwBf3k3CzYj@-?{<L|O46
z3=owE#556d%d~e{KD5^0a&#M(1a~uoxan2O#vsPe#|YcE#gujbC2l686iLhT;V_a<
zQjg>;!qU-7{!K{=T5tLSSb!QQeyWXw8Z%13ah?Z0>}RxXRZpC5*Bx0LD2zltw$>V@
ziVvNu+Q2!>^8bp=HDEWc%@224SKa#Ph8mm+-oMj)dR|Wk*><|;Netc6Kz|n~pyopV
zC*a)2+&aIV8R*Ts09{_Xq+n0pTbYwWe+Hv`cPNu99xvSswt+}-=6L?%6V^Qp)+qo0
z$bVMy2UAIS`oKUpag?sbDDHRd_{}fJCx`FjOn)QK8c$2yd`vAAgZS{b+uLbNhU=BH
zW;xh@ihO5%mW7kaZDo|?j@!lf_{a+*M_1(SUUvVP5w`TLN6wPZvaOpy-aUMGVgfmZ
zG&$SVJEQF?I@j}(r#tRW%>FoA2e~z-QUJ$sI-Smak^pY;QE9+}c<o)`Jthb?W0e0@
zG6&zi8p}lY0owH>8l<UfSl5b9Ul6@?>=K<qx3}BJC;LaFKOpXm6ikt;t7SoS^T#mf
zf#l-YsQgL<qYM(Vj%k+*?8%ncfW=&EZfPy`l<aMku;25}T;u`KE170%JkGQD=|&eI
zrNh6y$#5h>yDSf{n@OP?Y~3P)6E^mw``3@-;fSOmtkPH+!xCQR1o|+X(R!kaL&}s?
zj$(Ep-QI0;)^3|Kbjxnhl77~N<a5b~z>hq5>UXcR-oae!XyTJbO4KHTcn82NW8_OT
za@+tz6j?ELMv2fPGSGY)AuQN1uk`!$nIiuqDMbCvot%KD`2V)n>dmzLU*C9&|NbZ+
ztNgE4y?oj&MY#N+=eFxgZr5*IlD9cQ+_eJP0Pg7ma4M_!F%K2LZwOny>g2VanzUgX
zK|@bT+OQ3wkqp7$<KhDL#M;SgeGE<87@GPRnzk`CwJ|icF|Y$QlTfCQk>XeVhVYxh
zZ|SF}No=crBTa6rP{mGd(^Z?<sx3=Z-Nx@m;acp*h7Y3HD>RcgM<2S1cv6*U7q<nB
zRaIZ>s=llyQ;$5yUqmW^$^Ow1n)5-q45Pu!VP@13+6B63YhYwtL)I~#LONNC0S8#t
z$;ilBgU4k*7z~0-6{p1Dx8$6R<hI)Ws%m>FRi`;qotX2c3s~7};oIg+s|?%#2aCZW
zlwDm}XWHVL#+%8i&No2pU@r8N4LsNY|Co?r3MTT9my9m#ouZ+>-hOj%_;+CZUmqUr
z?u(N*Z}$&BoFJoq-{ZsGfDu;^D9-dv+?Z<<-wzlWf{OB#fMU6!GKlYOz?hI;g~L*0
z2Bk=YIM6k(?@^+%5$6GCHF#mpI#nZ6fpT@~qU|rP?}ltn&~pc42js-@C0YxOLT`wX
zRJH8lMi*#u)0S2NDg*^dt7MFmPmaV|GSsqatMZ8ofsddB0&Nv8s4Yzd+#Y5cY-n<7
zL6WX_FkEO!sSH@3$|}IfmZ+<=W@tg|L($2Y%?cDoq^NpHbktk@UFDe6Yr2{l%1jWH
zH!P|xx@B=Wai1U5VxF=LBwwrXP$o^E;R<7;Z;cqj><XBZEiW1eBZ3zzLkPXdtuam!
z=Lal~CMhD+q9-T|jTrc;<F5%O{Y}*FX(|7nrB*6?{@T_lvj*A;TQ7Xud}gOJOQaxL
zLbi+%1~2GxJRO#JHRHmK!op_5O<7jQwAkWb?g~kiXni{Y5MQjBmkyb1ChYV})I`-J
zbou#?)6H-OVoL*=M8+l?t-z-sQ=aR=Gtj@DnQS*_CEHCa*^Y4~=tl-OXUrg3Fx)`N
z-b?Qtc;4iQJp;yaRoOzGV@mGzQhT96GuYie-q-ZU>XqVB9*Slq*TN4(v>GwdY8DVJ
zJK*R%$Ol|KLqwW75oxA~{p?hvaUWE~EL%)OQWU2Q6?s1w70GU=?}Liy9JIl)mLnte
z8L3F!N<>QT?gd3T$f(kHar{pAvmaaz+#aS}LSIliSTlzsY3Q9uzff1NvK)?$Rn(*z
zX1=ZTBcW_(XtoZ*H&6;TG9Hi76rGJKDLg}l<(h@aG>eFgdRFuN8n7Q{A@CpbQk!N>
zZ4xF_N-;S+(*K=!-OqyDA=$VV*XbI=X`(%V!Zk8Z<t4myd^DFf*enzSK+IzUW%w73
zTgR7yoV8|zIzMTc!e2}woDX$+6fW#NoF2CI%s)M5(Ffg0xl@jO-`}|~W${hwOsSQD
z7e8wcVJA62X<(TuxC_uE9598objt*FG62WhjmoKL6dp8mxG*VQ7R~@Q1ZU?=#60Pc
z8RH9VmLZyH<9g{Eh3vvFU1glW%7n=%vp-VjOqOiVb6VAN4y%Vct2odf6CdGp0O=xB
zwZ?i;mz|)YaW?`WJl5&8AdZo%Rl|q^0rVg}n3)v~3OvXACuvr;P)IkfAk6EA_z=_Y
z$mgbC&Bqtm+jO)lK$no%XV8ZHj>i#4pGzbXj{b~h=1zAExIeh&)4T(0hrXzJQcyjg
z{N<GV=18G(K8cU(t}{VGG#M?+vpKQq@B;$RG-kOR^~sQruS<O*6<&b|k7+;q0MrFb
zJvN1D-XDcoH>`6EgexKw72F<hg4SS%)DRjK0}&k`qjhMkC53Q|Rc**5Mq`|~GCR%8
z;}<#CwE9e&A+7HmLpR9VJQV2v!yA``_7K|)+<;G3ojfmg#Csw;|2bqw<8wf2JfrwC
zf4E%?;*F~q!suM{it}Mv9XKW_hB7m*(vvm0KVZ=u|H{Y^PM7jeP9irBNiJ&CN~-;l
z17$dF4bONGz#edYW{(5B`Rm2bplK)91<{*?D((%nv?5Moy@1pl1Y@#6^Z~QO3DSv`
znTcmvhhX%ZLjwEy@KEe*9~BbT>3aKF_?hqL9%g2?E@dMkT@!%@AO2P`AWx==I#fc~
zEO<TRP{bwdmNBplvc9k(>pk#{->;ZV5TGqZUdsZ#w1Ykf#i3fwNU-|G?<rdX2KYB3
zpq3W+>l)q~bQo5Dq*G#&`ctjWas=>yU(IyyUOrRoKM7uQJATSfvHfRjt=?Kq=YLsi
zJo$e<%10(CIS(%3IGoVI!QPRHU1yT~<3^(<C&)>})@f1+CetPYBS>sPAnoZWWJ7R9
z!49=1NGpf7;49)FIAfVWMp{T(#?UxhNhPg%qtV=4-+C*WYvQeQEt-HfqOq~n+SqEW
zuB@*$MVxs=(h~2BezQ-^%2`_u`R4z9tk*VAUu=EcuKhPiO7w?-Kfd5E{_8pZ-dZ_*
zu_#uSZcX+ANNC*DbEfhC#)tpL4fJn3PoT4Z4_y$8{4*eO{|@?nsJN(|l!gWVn>~c7
zN*(8Ewu5mPhd(%s!yn=&v8JLp{E;?S<VLH1Y$fD%i|lT2iK|D?tA8wNgtwAY*XuR-
zQKqgOARQsS)2;lsZJuyJ7tJzVG&6lfE;2=>`jE?jeNf7?&h^-Rm1>UKkp<hF7!8Z5
zrZK~9VHMzC$51AB3|9j4{J`46JY{_pbg!%xYPDL<&CRijB&u7C4saL2p-$o`$6^7w
zY?-;|f$LlV?&<sQ+#RArncAK`;1gG@Ta8@2x7db;O2bBm{TfjqB=&4V|ERc2jb#W!
z*qd^*0Zo|`jSZ)m>Jgsz2)dM0IEMuO2q%6-J}|&Z{G1aJmtBo`!&WsqP=z{w{cEN;
ze&VFCen8igRejS#y}VGs0~w)0jv0z(isePsz)#j?$3TRWAX#2FS)65|Zu11}o)KP8
zM3W&Ga0l)XEi$#hISaC;3N*tgaY;^UNTu1FZwNe<@Wv}*kF;8FAZoJX0<n~;8K&kG
z(aVlfbJJabAMl3&Ohng&2dA}fq?Q0NSH}E7^y3&hLl~!;*h&V=Xvit2Qx5L|RqT&(
zAUbN}XEyZ44`Jkh6KE4k5`yQ3bfzlU7!BC^8iT8Pz9n)@HVn08C#X0nYAB+Pe7OO1
zedyH~66kMvn>XYbl+`~9-&0FfYj1^FHuaF*=%|QTST!3&i_Tn-mKkHoane|4+Uf*H
zMnG70Ko^Q4F8&61d^q7?^~pWsR&2kBWIvq`dw=M0s4Tq9kGHge`!cMoWZmefOEtow
zt|UuFRgktUnwy4Cs!tyY%A{IG0*$|))1$>trzu>br+`k`NblO~j{}YxrB`X7QpD!$
z_sr_X#KKE?C#G2(onpoe#Le^v*K2nYQg|*d7gys336vkZq?=>*1teUmMo}!;<^&7H
z^+?Kv{wNYus!P2)elLRxaJWEORaCAjDy7pd`3=X7lZQ@w7@g(JW#6Yz+fI)W52SAP
z>5&3=q`N+~2}!f<a7%jusf(x#o==<;fUpZDp0v}Ou>2`j?ISutV{O*HO86yp&s?AQ
zlt#`N4)7%}3vUcI&`!=v(vM`?<3+=WW2yFj=j!p0rBow^+L#h+;OwxljUC$O1}o?J
zpJStXj1(3Ob7_(JSx}SXm~hAyD7Gw;$7DL7Ux~(&SgIP#R%|nDkKE7;dYsrgp5a~s
z0h}h!kKz3eKqXr$e`;bO=AKEZ%4(!~t@_8QNUL?JC@E^~<rC+-q%@N+TWK>E5tmjc
zWTvppED;wc0v~TTm=6<AkbWuM!d7kz6*ImXQUucCvHnUjzRy!6rB+SI%_2aus&F(D
z!>RKA_@D1~n_B_|4zc^s-GhBm<ql8+(Rmw=%b4sCMv`3>Taq!=#AN3hW}q>F;y6hK
z8Nt8ZbN0L=JbO+yHIX-*3>?~(u}*w(Menh(2*N!Y9?Oslm$HEsV`&m9{gFrZ#y31k
zu*@U^q~<WXiMV~51D{VH-|hb{4z~Y!_~8W3H4GlQkkmqni2ukW+XGyUi!H{%uHXa@
ze7C5i7UBVcTEjS)H3{CD+G*l%3$!q<yo*r*O6l5_SA^ncvig^<Y$(#E8EBF-cpC>z
z9`l)=4uz35>*laIhV0T@6x$SZDHa_#goU(p<&i7mm16ZZUU@=pI)5RK$sDU)Do`s=
zo#i8k4wsL>aXKLkwB}wpfOOQSsHzr-O~(Mc*|aYvhezv(gjwq{HIdUyg`w9=I4JHI
zYg-EPlJK3BB6(1IF|VY_tx-v%sEPcH?J?Andmz~QbV0O$O{7sDKZq}?UV{BqW4zjs
z3IM2tX%qf-^op<5;tP&3-#)M4RVamFp)jtO0ovo?Jwff@aC`5~yI-_~hWN?7e#_p!
z#fl*r=u_J#FB*&gYwh-Q(He>lZ|5eXN?P|&++g#*8*JTogR9dUOxDgO*I6{vrkt%u
z<&%+mB%=WoFGqRSS`=@PT#^=qjW?M`rZ~n5YZOh2xhGv)qJnOpX(|MBx5z<rRt_0L
zMMe3HFJX(12|8@A{-%N<=TX<$bq%EvI$mX|s-)1iv~&g3K6f$8E~>e>ZzTMIy!^rH
zQ;*~kw7pHD(~PshY4T&$YAd<Am^ibN+`wlB5prdlpb(0JO{cl>1*T^;$-s;pPq%qD
zapKI<6PgH6`nMGKpUIJoD?C<W;}B~pMlVwgX<M6>2Xa$Z$1kcG9{tv?KehBwtB#R@
z)McSO9hNGTr(u~7$Fu9H`m+s}5HtZokupjH)u&vcNCMH;)pW4xy_IA+Vpt|^7b&dF
z<5eaqAk&la^~lwA5cwTxLP?=)$P&wo7cW?7Ma(5xPCI8cCLy~i)hD}{_NS#b@!A~;
zIy0~zQ>e+rZVvKJyZiZ-03^IxOmE{SYJCT4omtC7U?3|oVH&I?tZvZn8~2LZGFvVw
zi#b2L<yG8v-P$DHL{*cq<a1GtyH#)At$OQj)mKYYzek1-Z#%JvDD6~}sJxXjj5g*t
z2-rfA?tZM?VKFr<8eJyUjUp8kT0%sVAtgYaNZa7^Fz~%Ebl#H_5eb%qYq4rO_px&Q
zj%0-1U_-gr{{?avfdwmrn7wKZzF2}vBuNFJp;y>YnLYo;7fvT~k){CrP?3SRo1tsc
zax^PM`#qHv5+ji73_IR?lITuJJQ!{McU)i&txIdYZgHTVflf@JK?tDfR3(2a&enVm
z)w!?cbEwjNHJ?MZ?yGq_Rl8R@#?cjsR4I~1c`zrwLTG8`Dapi=oq8>Z0}pTh9RK>#
zxt0X*${WId^Cy_;4Yv@fZzE}I4gXIf%={B)!Pa*T(lOM>e)dKqw<j(<N7QPRzatna
zc}QK~0B!Nc?h5W#(mbM(gno3pqDP7r@*yVMa2%X}t@PF07G6hUV;vV+ONwkIdtWhW
zH0!5-hJB{1-HiOPiU9A#R^}4KWZz4XO4$`$MdZ~<Z#k81zS=FWYAc&kyk*PIM&1b^
ze-NV=w{>g3|5rr6v<|MUO3fRqtjvk|KP_L(v&8{%+RU}RdbO%c(aMK}oo9Q2RAr+B
zk(K~Ut{_r-wC9U+LS6q5y26OMqne&adzU&4jA0XXSe;D|_N4mznyNnyjZMPvo^96A
z)qny&^cl7I0-kd+AMNc3XL2R_o;&CnI++FW9-}A37ZrpZ#%52X{XC2?iz6dOf?6Ib
zT3EHXqO`v+teWRiWW034uv8-$9W!plmNY!2mSCPLbj_$A_>mA-h87Z9^;%r}_7wAC
zqwCTjGONma;G`Sv1~t_}`d;`}TS>qkcPk-R((u?uv4F9p&={D+Iw2@Tyv)OHJ~Ae6
z>>q@XW!yCIyfAR*h2{`p-IJ{S8HMhJZckiIFxO_qniNku-!gkHR}C;ORSzFo>ZUb0
zXk<>2O47R0nMjP3F%_`b=QWE>tW~^h&$XQs5h<z7%1ph%0+OZ%i*!p-G7^UO|Gs^2
z{OdL<Nt7Klr(0ZDU47a5b_km`jJJuSmVVb5o2${B5}Otf?FJX5X#x(_bTv>(JUvXA
zjtdwkUg?J3XdD^Lp$mipl}c1Na{2~G9AK0{&UcO1{SvAPZ<?AIjqoOP$CD7F0>i#u
z>4Kd4yn>8eWx3LB53i+euCjQm$@rFbaP{1Ex87M>-2my*?RVX7v*Gr7o%P11(`{`u
zSL-huFkbiNrtUDMv2DbwUj~Y6n}f8Z#$^V4MzP7H`Z;0xAML8|eaJ?P32CL9YN+XY
z7n<G4WP~=HGL@;L$8Cudf0ALBbZA9`6Gk0)0%sOlqhZEP1gt4Sar=52*&hZ2vV2SJ
zO0KE)rioD5yYohKW2FxNHS~qPJI;KIEq&iShK349E{{)no-#hhxye}|U1m9)Xb*|0
zOv_B2Hqevs8g^*1fBEXJN-u2E;YS<r^3kiLX@=G3fw|~LI^|359m6!684`JU#zsDB
z4YDT*^-e+!u#i6nQB7VF5G5cl-v^crA5*TO79WG-(7^p`a7l3<JUw}t%!HU|-dWR4
z;o<nO)z4$1ogT#sI0N*i5OZ--*GtYH8B<<9K33*fwXc0z?P(2yL=dqOPucZqhPvwN
z6u7ey?75m^-7uhVbPjw_jyy}6A8B^2Z^qd2Et4E*<!_t}N}87bP1~<=%eVOX&OMu-
zK4m^r{J$~dHj26rnE$8VTwU8p`+sk&wVwRHALGOR9~3kr0%9?1f^JI5K8f5~*z43l
zV0VUiTXEwDw?IZn^doi)#C13nK8}Z@o)^kzoL?Kuz!xr1scOZ4G`p%ildkF-7uUup
zms)=DZqSR(k|rbcvyG<~e?iubezbvU-=C@TRI-vE;Ww~Oq8c|)jr)`Ncnr3Z?8uW5
zRk@i{{L*vLQ%U+J;f&N!7sRnj=s>bO**Bm|9tMM@h>{eTgWNpP`=&GL_c6#BT@WFE
zfD)-2O15SJm{8a8;Us3l?uag&1$e?lBQ(Fj1)?5&Oqi~CW%9{!d-76<dyvgtf|wgk
zIuQoV@QF{Qh2dB#%K9FfTE;E_L=+Fe7rlv+*HzH3l?=RS0U2h982a*`rkp*bRTBsC
zVGdjiYQ_=G>Y}=}H6BE!_MzkY7!QnGhb#Y%!tReu^yvA}2|tV4zeG*8Iq|)#DCmC1
zOTbze11Hve_!n6V;zRpEP!W~zMMaN5st!<{N7{*7PdL(W;-mXN`dkB(vn3t9kWW1e
zfywG+1edCub>~dJ0eG1bh0|j<T#?LX<c(aJuQC$*hp*E@f^v_PR_7lnFk6-CpDN!-
zgWcOD<t5%G!C2^;PS0O&gkxbyeN^LCIXHEW1xL*jmwQI)cARTOqQ^&(8OHx7WQnGn
z|C&*1ZFOEIp!oc6G}aoebpF4M)u;F`kMglP&XR|o4?;>1ey+r>+*xN>%gwem^`2QI
zFa2JsR89&$Rf>hqRH8wngqDz{u2Kzk&e}44Z5tEa=Ic4cCTFd!pXRmMn7z$LV_Kul
zIT~%ojmE8VTtbT4p{T4pg-Ec*&|ngPe0EXl-^15wZBA86_A@Dka@0Q<;S2lKr0N@L
zIFmM=e4uq}c+x0fBIUur9muujAc2b2@Q__Wg1xts$w?fi8cvM|Gy7zqtmDjV#T&B~
zH&gS@mMvX^-lolvw})0W1_M1u2^T%(PM$w^vXOf}CwKC)c$h57z|Y0_(22Y+GQ34b
zTa*_h0Xr|E@j7U~DH8uRY1~ZN=(U)fh7k<LNtujp%k57?DNG%r;3sviD|u*=p{>6o
zDYfN_f8JPbEpBC%==c_S!wlGDNqY+Vp>tImIA@|YL!Edi4Qr){S#gk-5>FNw)ZuS4
z%&}>iqYN<n73OJD7<oTqnJ(Z&<~qtaM&BJC?Y}>Gv%7t~R2mpD7;ye-@_f?5gw9+U
zI$}O>H1EFb8RDh^gtrc?yt#Ms!U5OKXu$ZH?Yu2m8ge@?dCz5>64I8W;{u03(mE-+
zipYH-f`p+3dMfL)jvq;uQ9Ia@IK?TjJ)I-p!Z|`geF^;~?`+`910Nn*16xTXf1(*=
z$L)k?lOgfu&!uHiquFdMrXj_#n1f4cel)-kz2Yqf-d1fcv#G=oE!aa3s1a&0Rnps3
zTipR5JL;r><%No9RIYVyhN`j|Ra4620<Rh3d50=O$j~tS&$N5R?Ot)aal=>BLIY9<
zY;E<Mdwr_D{~ew6vfX8!Bo$G(S-P!4Td4)joF06c-Z1HwVL~AO`d9HhN6-K!*(zu(
z-kJ`yr7Z*SW549j&bBPmn~%DPE64BQa8OA(Yc=5vqTszU>w3N@w%@<WJNbGbf)1|%
ziW#WlIHXlb<Avtm3-h%E^^oe+GI0Z|*m5C~#&{$f&Bvcx>!c#5*W+0+3UM=8#F4fI
z=G-jkh1URyoEnXSk!+p)P*2U4XQG03oCJz^2jQ3LBO!&ZcQE9)d@9NRey6(ODf-_*
zaCYYTXLkz#KIQ(m)oi8pzx9pA+LQkGF+Oab3n)Hp(*>`(92y50{*~<HfIXbhyIOS0
z7q+rOG#QO3zY-eh(Wy=s$MUi0IpL)T<Texso<F%_M&WGWb-K^kn^fx-IT|jXu#mQn
z8qatWTN@Z)H@C^H>h?w8^%D0qimTBXPND(Y*m=Mi_X3wamei2(DsGJS4)F*Ey`F>t
zeoHP7nNwu?f`j>s0-WTzmvEjd*cnBv?e$L6Ot58cijo-ci3=Ej$-h>IEnDJZI_E}B
zzfxnnauq^7ial%NASMoWf$5#d83Mf^WGZMmw@d^RLk7G=K=pz%<xks8aRrLRM+4U#
zrKCfwKf*Mvp)V>+RBo3~^QCN1(dpby9^a=9GFtyJ9uhS?m3~sPgbdD?6Ee&|h^iWH
zl^e~C7M-<*WUR<^k;^dQC(j1c_=~WNo5&0FMscu2g}E-|`+>cYOROzDrGTLeY%*gW
z$Z&?!j!d~tflE0HJu-;K@N}p#cRWAwh(WUtN&w@AL(g}x^UgIQpLgavu$R$26r)ln
zd$GE;bs-zg?7G~I(@1s>6~5!{!4L1C-O!27k+DDuqc%?u_Y26|+dD@mwuotj;pkuy
zsrk3lN(@>bLwLu=0Mk6XVm#R}$0ysnzloEh?cM#QY#@$&%rArbF@rt@{ior^cgjzF
zZ=Wgr9|t)b*S>h8p);zT118r3zlIlC<$1!X_J6HLivL?(Ypg!;e~<COV9=v$@)jfh
zj2Bvf#1o)}7cMya>JuF#3%NWpT9FJ$0nVV+6p@tfNYwg*@eL^k{GxJPXC>@)49fbf
z1U0U}7%E0Bc+^prixp8xbx@Jynu#<5fWkIO0AS%Q8RKtEZawe<`%%O?l-!PTP%%`l
zl_gnvsRGinWMqO4CZVF1PxUI&@(2r_!(g)oBujbG5Eso`DmFyJBwCw(L-d<in)t?V
z2Db7EUI<7?)Lb791Q&S1#*Bbx9OV0na|s_?%N#_9^Lv+EC2WdXep;s(niL`I0al44
z3V%0i^tB1|BYmcv|CB$JA|KsB1vE|nv$mSf|JG<V*PqV+$N0#U6QQXer)B5Rj+Dv=
zgtISr?4y}EM=V=;wje(E0}mav$7uJjy%W&{_L%lJ2J5Pff>8y^UJqQAiS}A$C3>c%
z9|CbRVtoj7$nLnq3B?0SJivR2)8vZb7SK6s)6m<&NZioX8*8FEFdCpzgGkq*07Ap2
z|46X`kUR!`B+C=p3QRMIOjo%a?~QYJ0Mm+o)H=eAA*y`O$6<YtaASW}=urF>>Af5x
z+k|N&BvUXoCV9b2o&MPI{2y7a+l0os+@J66wZKd>hSGEsO{>*^j-}>3Hru>ov){xG
z^aELIS_nw8t0Rpz*sV32x#pS)pr@K@T8rAvG_6ISOf=I~o=h}nFwy)zE(WLSe<<sE
z4d-6#PriHs`F>_bu$cd2XHS#=1NQI9|Km|U9OID;XyjTeMTZzU*BquE2|7q`UQg^E
z?ZzIAh!P+_%36Rd<j=^gj?!`iu^bFIaz0dvCjGv5rP5Ctyja+iZd>i1+eew!KWpo(
ziPbDZYba|Pv4Hu?L?=M^PS!+|0Lo_(p*ZkyacLPq@qdBnD6c}WGpHe|e<*^io>bb^
zKPt&S$K3Vjk(42;a*ohe70Mcg1|#&kN6^Nl(nY@Dn32;iYKM$9^fKuJS5$zwa#dzY
zcw=`c8Ztp#T;+B;bfK<2@FaFczJn^imlMi31~RfbH;%=KE+hN8klY@AcCRCaTcH<B
zA_`W|>qF{C4D_2qCoU25w8niRDH(Ky1KH!OWeeu&k1S<zEy|W<h}SShJXJ}G%8RZp
zXUU=@jN-Z4W<S!%M|hhiwXTa&y&=KVqP1g?S~pguB3h~sT6#1o9lB$OyiTN(E{{%*
z`U?F`NAZAIfE!-((|WQiUD(~d2-PH4xYGRom!rcE@8i<jaE`iS_wd8J6WBb*CrA6+
zZ;w@zKcA`&(QHaSRH=;eepgku^;6NH|Lbux2&L3;XKb!c&6z6#M1m}#{aON6#zxsM
zAwLj}SYI_(L<N4O8tbsZqOpXHI<KL4KI8y^j!zeu{u!|LSwvXOUu$R`ud-#A!#F@%
zFbV0M1P&Us$w-AUb}=0IUKL-(UQ@C$if~DiaKs}t;uJz%8HzB}2@Lj`A})<7r6#`j
zFDS;D2$XOvkCC=IbZ+Dq{g6O~Udnm7DvO=Qh1f)mQld>F3icBpY#g^37)VU$9p4tC
zG28P+v>#mAgx<79nv#M^TLEdjh9yN>s`h$UDj*b~$#dD}637#-znF@KhtB9A-aFwn
zCAY^&$=SL~&9ybCXx3D~Q9vNKY1n-V3ZjbR;D5U3N!=v3in0~piOH~ZsyY*B<npeG
zE5JlW6a<sOceH<ea(J|_MiD{T3*+iO!NxHKERgXDV6B|bkxC<rYHi9S8A{^<61F&9
zZ_j;(0WvWmT;%v5WPNelEW<!66prF1UN(@Too*Ks8oC)3hv&EBbes~h>vdR-M*a2_
z5hDaP-$8r=<i@=T6(-|UIuLAx17&kyp-i>UGLAOvY3E8b)>SLKc{5U6W?;}S9-Qg1
zsC=fmW3krax29di9!1+`otDdywV~VBq3iA(?}^^T<urTOaKcS|3OITJ3)X{^1Blc$
zTT#oV*j$P-2S!qFh8Z_t9W}EH%~Xsd{K~E>w)IidDS(eY8@`2jO#(=akQgHg$*Dp}
zkn0Sz!C0aC-@2Uzp^(wv672V%Njc*U-C&YQxWf`8h=j;dbtyc6ENKhLwIG8#I8vjt
zj21BiJ`LztCY1>3bbPvf#Y-AkAK1;$9kN>s-5S2v!iSf*|G^p+WC$=O3x@Q-o7WKl
zp^N(mjws@N+#$uI1r7zpz8>w-0FI&yIHaM)4lrw{B5lmVhaOseq-;QpQYJ?vq0i!D
zOr(rON!6A%Ux1Tn)>ET#Mw4NU<PRM&%wgqaRW^#6Y-FYtwj`%JCblV04K326psGq7
zg+7}X9-aK!iN#VIFioLrslwyXK{P8-xO3fROQ^iE(WHy^L;cBM+7Lqb4-RHGZKyoB
zw({2ir1ZzB!V7phAw$%ILwE1P+xJO4S>XJa<4sJ-3V<sCilYt~G9u#`n^4r$!f~uu
zjMHdWkbTDW<9?v7UF$_h3NADLu6`~mlx9n+_}E@y1P39hQTWJ`XLK`uTvS)WyNxsk
z_G2~#Wl|6|xNVqUTSbV=FC1C?3wUW1q`N?Tu+L@Dfo**rj4%<z;F=8jVie2NN7@;C
z#fdPc!yp)cu3&@}0s#7)ZSU?2@=iMydG?N$>ErTR%PvS;zrNyJWCfzCFcoGfWS}E=
z#o9*JG_$gQbhK0<$GBXpOsYxwb8P#>TBR_jRx<O<dgjjF9D|j%<klk>OUzT<CJkym
z*4wDV6V6H#f%7xBv2n7&pTTLbv1fT74(lxqis>kFQ56$oqm1(~>v*yVZhu<1AR%W+
z1}+apvoT02BT7=jf!kG}OCGxP-Hca2CaoqOczhlPmkBO%$X|L9msSSp(PDOp&+<u2
zOl@;^JX^k+TPbfv7O=DeyPOX3H#lT9&}HH>NtqxCw>p#pKaTsACeZO{VnodzKe_u-
ze6+^+O@o8z+Q;}bCxInClLEgDW0JI}LF~R7HVQKh$r_Z|Vb)VF$<`bh7pLhDdy4Te
zC_Ojj!_m<w*}=;K<)t4Y8R(5eMEBe=nz(plI~`Lnt4g-zFRwJtrQA-O_^~xND&z8Z
zSW*ScZDB{Gy<0jhQHS7ESPc18k-bAwpPc=TJ51!CEBIMRZCuTQoa23SP5>EzmC3J{
zKi2ys*b=!4`${;wk0iVk{T{+za?Y59OA^|-mbUPfd~~#qBk7<Tf6Y>$xCz9zqzXE|
zi+}%H+}}~~Jf6swHlW4jc@G8!#}xT2T(8oHNfu5E^00`NBGTj^$&Tmq1qy0WBYDY9
zdJaj1EsZIbGYK5e<^YarmlGO9&`#vVVf4bFH|g5hK{c*69ZeuI_VJI*(^$46wvEmj
zyMs$LT@^5*QpsC+Uhx<<>@EW5Bs*&(jAmQlSvO-@M6fKZ^pi>Vl{Zr=Zgy3)9VB49
zVBm~d4aRl0@)27p$<S@Q%3OZoCQ#*_@Jyh8_>|)DsI)uxibbA*=1xWN_Oov%qm#<)
zoLvr26XQTa@tLyMoY4rR8rChS82qG6u(otx%yKH_K%M2*TnxRN>Lh7pW)(^fP+4n?
z`VG4T_&lX+sZ|p_%p#|J)%9zC{i{$p`{XOu0p7(C&f?FuwIwxJwssle_V5lsjz#Jr
zJwKJ>+cv4&Q}uWyyWrfkB<EWq;d)UEY3GA6U@i-is!Uq2%<JZaGRnq;j7R|L*O{qM
ztyvk^WqI620#=4ReN&aJYN+R#mkA>fpW2HBp+wX-V#zLD7A+W=rP&zD6Sz&7CpFl%
zfX9p)?+~Ni4ik(lEsPol;<l;UbzW1eWfgV$WRoiqN0R~RCXac2rG{4ymPD~o{o<f^
z;PL)1e}7hPC}}kyS&Ke<c1r?~a~3_bn<32*|8+!p9_KIvpA!GIRbNlr|1>vRPySzz
z@>vkObZw0{#eCPxfw|zQ^Z58AIvhy@ZU3{%DjG~8I8p(1fw}0S1-D9z#<>(Dr9{D$
zN~9M-4GC#)`-6atJM{Zy<nW;ljs*6viHn94E6*0-(LaL;sVO=9&vl%;4CUNqF&+<=
zQP6g-RdT%~S4!Y7^SzNef}W8WE=jn|^yH((1etRZK~<)mFfX7y*q?MlcKsfY=S@H9
z0=e&>MSVGmG2nDL!3^oM@rn$A#~A?QQDMi=7PMAUxyqN>9^ul9T+T?yd9J-U>7151
z97ga=${naT=9GoXo^ge*)^T8M+PvbX=SJNy28aS?n=}aO4}hrzDZ)bxd(dldkc`)E
zXKpn`&lWSn2Gi^5HtA-uBD?fd$pYJSRkGMV9Y2=vb(9laf{V?JsyZZRs*cdEYM?Jw
z8EE!rU|WE2<EmC+iDs`><26o2TU0rzaw<wLv^U5u;(do(wzPXcA(t%;-&5FS{IFI0
zF`MGYVKi0jjAZ+|>1}W0SLZV6$ImPwmGBcAO@%VVTwRYcmrnefTdT#j;;dLRD&c2|
zQ%8-Z*v-@hB<C%N<49<E7E}yrbWDm#whSn}Vp+~T*2VJiM0<b|vga*Z>HJhNAhXfT
z8kQhwC4jf<pf10c882l$%tByRpt2oC#^=L4`?oM#3Z66172Vh(8nsN6V>vlVw%9n2
zzAxIMU@VAt!KIeqQ(rd~{~Pz|vUboCBx`2Q(xg3NVTPEcWHjKEj!{;>4noCqZDe@>
zw^_}qqjjlK99B?$lH4JAB^K132#bDiw~tTukFpqp3i)Lr1AQiLCfeIdj^ael_~tnq
zK-U*@qrvE(X%{tm%T+pRrnRU(a_F>3vs92dJIHHJr<7ZTl(L{fJ^m0+VV2rx4K=m=
z)JtMZ!}l}KV$EFs+wuzX^phDQ?w6{PRb-Wjyl){3MuJ=hGwIV&Yl@F5oP{$>Ef-{l
zL!z%(^8Ml8Rc>Kkjx2def>LGN-0(9sG?i+DJXd2vfPdNVf3hYIH%m0f`qmPS{uR#-
zBb8ArMLX55mc!3fTrLh-r9Q<Ju?(V>h--zPOl&J=+K}Z)a<Xa+ThDe@=HU`?9nxvD
z``HgJ2X61oMQf)xJ++7eOYKXSPB&>r>tITY<2V1kPtxk%{?3PA#NL}<_K#24ssILS
zX@gjSj!X8MgpA&hGG*XZOSB@M*A5Q1_ujnwg+Y)tL$LBMxz3LGi8(<@qwbL%l&thv
zPB%%pDlvr&6!0LoERPV`1)9l`lje2@XU?f}EalXx6)fS{sY=i2+=-v^4xaeQ_qHq^
zLaw7{(GarEp3{f$SWch#$>MgoP{r!wlCxRHG{u_8L*3`0Y9?hGAKTC4D`3Cbz&E;d
zM!k+s2z8~9AEdNqq;<k~w_;sNxpmQ6hkx`va!X7-@$`C@ZoTE;vlyk?v9*-Mj6+2Y
zB^{O$MLYPM4(+V<+OYTP2TGSE`;|Setd;ANF1}~&6sF4bNb<U^^n_avH({j{b+1NV
zh*n>E=Z&&GPn)(vzpt&be)`<wXNLQq)<fn0TVGqt=KtGxy8n5M&z<7Q+*9C^kVui#
zaY|LZmbkNSQQgm&I0M@M`WcwAUTerA`I8~W3PS$6u6vqm&oePsqz(v00s^Ui>BDMe
zJ_*u*W)Ia}mW=m6FeXV<RApZvEpR=f5-;7V^nrUDUuffH{q^`91q*rZs4KX!^I2W*
zF;ARYZMGeSuh8CWygdZL<^azkn4R~9qmPTM0xt<wgB3~2a(s5(<vYC<(iUptO7!o2
zU?ojKoP=UqY74?f<8f|Ukf&fQ^95s(n#@AJJlDeJL9*yctBMRlSg^siwe?FMEmFFB
z;dRH1?!5KL-677l#Tl^d)Q}@0u33gkXp4iA(gdkEvMuPgWY|v)O;2m&0__L34r!nb
zU>8A*U&}4f6wTrSEnqh@1#(B;y0vWa^|V$@tEKU#H+4-UdOF7*?HtoiCr+0Q)Og<y
zCTHXntP(aM^*`>0-e@d#F%`KuIQqaF0=it$(~JL3`cA3$LX+n4vS80tN>Gn&;`(^f
zk*4D&#~qvi5!4(EwB~q;lto5D^o{Fq&X+^G0fgt-&)5CGZyy~0x~*S=Wem>3(7C40
zf<Z4jcS>dYVYp6BNJSnl@XuED51UFlIi$&Sj)Q#AT0|=R18S|}thq3gMr7@XYl({V
zw<Bp`rRxj^&ws!X{;>Q*6^8M{qCJW{%({Ujlyn<r8~Ezny?XwsQsq8ARTe9vZa*0r
zfX}OcEP^Zw6*Glo7qTf~xkz9yLp2y&4r<BPqas%5ONBJ5Y4f1mj;)3;zyw-2p;4(+
z{KI%-cuNFbCgVkNqsqGwFh?intmRs&{&BiEb-X|0a4q9KQF+vS+Ek&-cf*(Z-aB^&
z{o18-z0B5H7(>LSTt<$K?ZNs3jA$e$En(lq&CbSEm##|b02I~I5}nT&^+8ae63z@@
zy^Y1)0V|;x)gNJ!Ir>z2Eg6c=nVh2&^ru}Kq#!mEQ4aOvObyUtFOfO=ipyrxTNQ93
zG>50KfhD{Bo;X$GPe}^fy!;s~N%11~(=NmNaT9ny3L7QU9l)+scQFmp#s^4SP3l`&
z3CTC}8SCKLK*lPS!NjSE?GOKukuhALg-B+4lQ;mdB(K@rk}Oa<f|+r2XO~tfn$@Hg
z1l@DTKXWP8buE=aB}}Xm`Pv-=NJvhs!03oM5l0_{cE3zUt#qqJv3JZ?k_$+zpyGpU
zab#r*6(T9CKgL`+F~CyIL@I0)F)i_tG(cJ4T1DiM@m^Aw*3&8CH^rykiGbf5t>rNr
z*R(?~;yZW72Ev8of4<w*@}|ml`6_`#XNdnfcLexC{cmHnQD0rp=zm*J`Tri}Gkg5c
z1+j!j1N$o4;|YP(;Roc_LXnKv?jUZ596*g`vcZbRbg3EpzQ%5&L^NF|L@Eg9CPfyD
zn?hs2>Ar8!bc2%Bk=+1I9-HD2SC{C?AmZ%YtX)JW2b8EB2?f<Ecbqhn@3+SQ;V9Tc
zmuELd#|1o>5d!3#fTlm}=zHn-V<q@b3%JVh>WnZo?TyvdHBtF=Ro{o7#;2>s9{<$q
z$xmb5{JY-LzOR0|T5Xv>^>z8YY5w5z)@%6QFn?adv-&2t_wwbZtL?Q<SG(Kr8@}(Z
z$uiJhYpnuPBt{_PX1PEUsmbF@g4U|fvB$$oN41(YES4DstAvB*wH8;(W+9mb%Rv#o
zju-yfmD6-wdb0LZUX&f^j*Qzlh@gyM6PIT9m2}8}B_{6P_*y!vbDR*Uta*)<SPYB;
zrXT>18sGAoXe{q+;E!cVY21W$G-ZIPIW8NaK~qkYXkh#Jc>n0+&EY%odi%}6{vOnC
z+-0GffAWP=%CV-X?CkHqu6zfpMX86hGZv0t&V+LAVwB9~ICcca6TZg4r{C!s;(3JU
z&<_6;o<*zLcQ|9#8`^XHyP5pmfS>hN>b<P5pFw-@y8*w~;N2#aX}}ru8h+NG%v!Tz
zpJZ;V=tdU#&K2@?MCW!I9ftPyaXpWnzFUg=DlGUi!05G+#E$O-70Mii8hSL>?hifa
z?-J;-vjKm@&pNP7o39hL2hnSHy>jOOo<L#0Gr4GO<BdO3DHqk=?@dN33io%i)Q`05
zt?w<%x(#JEf#YmJUmM7I?gBT8OAJff+@F8fFK{$mav+X<_bKt6Oo}JX7?QMjcPALM
zwj4ng&?1h{PpZT+B;;Qcult!A!Fb%Um>0Si-}$Mcq?{K27&x_``n#EfWBVqK={U3s
zzc+z2w2(|R8J`ia_VM?2#lnUp{9^5UU>Fm`;M@e?6Kc#VaorcbH1qLg7jR{x!4fs%
zO&$M+BW<USN73Dnk^(Am2k|aJf|%5V0mY*NH2an@;2w!XD`&A+^A~#+h`>HR--ZJP
zpTA`OWe>h@HY(bI!C@UWXK>61!;yErG37%eMNpCokyQMQ7TOFsjSS9@nFM|E@vD9i
zjI~!PR_{ls9^y3z)20Uee=5EM0=3YpzpR7!8sq49f{%8Bqyn#IaP(!}#77iY(rUHz
zk4~UoTFN8wQMiqS3Dto6uUQOQmkiPCRwXq=3fPU~``ZG4zjVkxw5KkOg3vqjFlGuV
zcNvR)w!V}p0Hbp_O5lkR<w<SN2*jSjHIb)CrUUgTfpZTN3Q;DAZ=FiAo$YW0tw@6T
zogn3m5#nO5CYQ9<cjS+bzT2t4>y~p8Nh*AA0b0HU^lSktZovE3(C+%{ib`*C7X;w2
z&ZX(g*Ivj4`>w$tpKM^)50Z62BWd1795#;jrEzJ)2e@H2`7rcr`(bHU3y@@OhZ*sG
zM4Sf7<Z#9UE!(&U+5BNh1p!k&g|)`SH?%5#fcI#CZ40fn`kJ2LNYC5;aXcLLyiip5
zA!ci@C09Q+?6aa}DejKUO!7)!Dls~nO+M~3yimb!?v`5K(qrY$+ani6Pfz0{UYD`&
zeiB}fUgdcDuIXj~e-R(Os10=Q!iC9&7Yx$O1wUWxtK3Btb|i_KUXiGfz*MG5>7n^I
zrkBT-jdUqCMoFR_1s%n(+1yCwM9m7fvW#j<rUW<|G6g|v4t$GanS|~NuvC(M%Wg0P
z3uW|bOzF#x?Gn$>@<rhYO$c~{ffiR7KoflCXvcKnt9z;zrgNHc|L~cMR`uz`LNn|i
zYNUpZ=v!&(cA{z+U_P?%sFJ5f>CI&JSHT27mi<sk1%^FM=k5uWLqS1sOU;t8Zkp5N
zkVfPkC}~2xAX~T!F>RcqIs&I1vsm}nl7yoqO?Phh9@;^@;9cwA$2h*+amBFytm8;F
zFy(U@Vf@>dM&;Y-hpWnJsP0854BwyfQslK%U|6{6TuoKZ`&GREl6PLlJN0)%{;2Ow
zDVU-Ly)mWzO<8W*I5xHR^L|V1+ARI9-{bhGy)yH7$>SxdW?P$sHqX^HR0K&Td4rWi
zXbbat)4YLr0Os|WlYwe`WqxK>wJ{DbSsW69Kf!hMLu{?o-Q_pCwKo3*TdU4@ySq|}
zfI6;iXnTJRbz7N>nG~hHqWD=dVJ<06Cz>Ofbvu50n$dV)qSy1&#{4sE%&&CjZSLOR
z#>7pz{+jJW@wR;f+TK~?&AGYvpS3Yl2j-vkPW3D8ShV8$Pu;Qid6c3R_iI$Kt^!xO
z%H?S10(|$kzZWi*tZmYkGVC&zHltc#Yn@A1^a3$*LmV=D=jf{UWh@{wl4P1<#{h4@
zdCj%lhTr<0p6>=o)BLvy(6Mn>OaADH*GgRgp&gyNe}64EZTwqqq_q}{rnH$>@m^BC
zSHCw>zh5Sskm_y7dUA8dzt>ac)?~TW)bo~nzMXo$DW7l3_BK<tgXqoxW7*s14T<C5
zt4lt#Re2DbK?Bt%KHa-AUYZsgPk4SWcpd`wcKFA@>OvDnM|;@p=zkb*di+Pf|7pzM
zoY-jb>eE%X3zXQE7K`o!A``8<(|sb94@N2#xoP0?6Dskyo?7@WpwlL-w*&7w-A|p*
z@VJYI^8+q>Y{D>fM&B}1dS?rUoJEl|oz5lQIHAtx#||=CaIUQG@^0UT-}`r<=>?3?
zf72S=h5x}+$mnG3kyl|PYU17dJxY2+Jk}dBGYi6B-0_>eKlNHqwOFu;EAaOQ5ZRqQ
zwv56PePbHCUT1M7c81i?hL`et>yur<u*&8y8~7VJ1>~UM_scc3YG6@eeV18qd|zMB
zwviD@(#njrobsukmrafHY8BLLrs~SSS9K8s>c7<CmIqhW)&|dgW0QB<Mw68XIPZ;m
z$+mPj++i)TZ!C*-u<k}H+pdD^s$3sjLsEFGm8^fqF~&}{NTv4JtauOlZUEQ1yU%OT
zsHZLZ{&BSb_oMB1zwjp5Xs(H7tChNN(<s@ur%=h#wpe0BB8O&D>MD?k-G3r|YfGis
zR2sL33OS@PJ5oye6VbTFYkPU@yNJd$H*@-Fn*9{fxEQXxydUGX=Ad!bH7Z-KXf1bm
zd{_tT&PwA@(w|!Yj$<@jDbRfk>hCG(9^kgWZYq*v8n?YCj!)p%+v9jMtTi@UFE`=8
zjkTBGH^Gz4Tx{0z2HlMQ6X{$j?~aTr8p|k7Uuu-<&6LKek&*&7dB5O$GD~i-WUz_q
z()~349USkUu>1LD9e=)WY*WW6ninG4NoCV(DDj_-b4ZUi`KM49r2U=INH*>Gx2ZIY
ztrQ-vu_TH(jrjL+o3)VG=iciy9{#%jk2l9B$L!>@{_<t3vAMohZ+)Zu-s~8u)Sj;2
zrA)%#GCJN}nUu%t;e61MHz9=0l780uy;_cn`{jB{rM{6u*fl9=l-USce@f+_QMs2S
z$aQpA+U1SXgx}2;TUg;e;ClUAbp^<xGAW=4%l@Run|oRGP^448EYdNi^|Bo41hR?8
zH;=Zpx%zUmv5HXx*IR3wje2u^RWJGWm$>N5mm94{^X1FcmuqWtAcDNQVdDUzo_N-t
zf8&TT{~?>gi-dsX-6OtCp^A3Hl7|W?Eg1KNX%tG|Kjz&7=G`0S-8*XcgT}q3`fa&a
z)KQhRK^xL9^Cdfv<7GTv#J|kivk}VfZof+)S!)8ueoJTj+|1_SOTXQ7F^Ojgef>GN
zg5_QUY9>3P$uf(M-MjM0-c_=W#GHL4i?6c@2g%4gyqiEyd63&9i$V@_FvH@7y-w^V
zH6ceu3RprU4lg6zKewxF;eu|P+kaP`cIicyr<J-hROBZ{0Q~(jMf!B|rAP|&x3<l;
zJ)3nl%h=y!U)!BWLkzxS1P1EQzVrnvzgxGg_GYr8`syhR$Y8~)W#u<g2b3l<?ya)g
zaR=jW?(yM?2h9FP<q^E9vv?4@3MvV%#*2rp-a&`~XAnn3KXhUJI4<>{6J0bs`C=f-
zZh32}JO(+#7&q<QNQT>yq-KBL<c>1j&w7fxN{fby8+w`IhBi~>l*qZA3fZ;KWjB!f
zfp@Et3&L@}Ubk^U|9!OomhQH8{&~D>0JYYruhlo#*Xzx?*l4bPpS)3K*PspYfb6|6
z*+wLS$vA?2K*lv+JA}bwZJP(xeq>Pj5wsthYnH7$r}jf*MBX31Pk?nhXNeETza~XC
zS2x#RHe1cL?|e7aM8_ew@&hQj7fb-1|LzPX-*kNGd*w}O3cP>h6<$OB82Fox<f6St
zBUilIY)Gz>$h?NHbOpN3WzeD>uM?Xu`8ZpBAfvXD^ppHD0G<Dwt8HK9886FXs%6p5
zVhEObFUwMt<sWj4wbeB%`8j~oT@~3_eJN@$SL@#;<r#eGi$te^3nt@Vahik}O?6$!
zpA$VT(o))RrI};6LNPa)G2BU=ytW@yl#ubtj`S<qWuq1Rt(R*mhFTegC`xw+LzdOl
zzG~LZwwwAsTjRe`b-603YCIN;fgXih+LL89Zf3pC90@*eZpbkxO?WHyelwY0U2+^v
ztvnl&O<98!91GV#j(2Teu0bmN;-jv?x&^jtpJKxxf&-2d*I_3)A@#Zh`<-N*>vB!#
z{!HT_70itgSuf4!&5cyO&For`PnONNMqdvdrm}9cAz`$^A+6EKaASw(_VVT2nt<7e
zpWNWcat%i9Z$7B#{rUiuHp|=Rz@cdJw3&{mXZiV-&GOdP&GOA06Xa>8$0+CA*(^_k
z>+Xiu);wl;wlykSuHc7M9(!B|>&|MHhwA>R_3t>w*x{|od3?4vc<oT;Mw~(T?X7(s
z-J*rS(Dka?-+xk8>WRucQJMctDq}ft6DJ3?8P;1bH(Sm1)~48Kz5FhvMmdqR^%2Eb
z{FX`D19MO|`4IW`JsD-B&U<YduEny+>-prv)$RFd-JRsa%}=G|L#o@9ZE1gR*EP*`
zOTORvWXd3|RJqkuJ7wg>S=VGOS(7yhqjh=Ktf$I;i}GSD6I$fOm+GCqCTW;!@}k}b
z(oej@Z>ss?ZzV%+%jXhj@rEESXOk&+lJ&C6l<75lsliuicK7%UL;W7Y7_I7%&f`tV
zX7jN$yB^RWAM@A`g5Xc;ygVy^x5nD_?RD19Z>CdTSbn}`{%&3e*4KME^_r==W%)ZB
zTvgp!`MbO|DqF7LXLFUyVjZlzv6gMOh`%dU|Bhpf?+aG>J6fg?9__R70k+kAU5>wN
zzI@r-sIN8F#pXt%-fFyD{Z6kX*&v*AhskaubZS+*KR2gF5~aiIbBqp*OI{GB1Je+r
zrGW2VVdmiB(2<FixmWBo$zdj&cH+A;mD5ZH_E^TIFgC~!p(}#VJWR^jeC~`!KAHe}
z$t1=>@FyhEPw|oN8XxJ~->`>=Z>44HFRt%~UKfo9j>jP&_+baLZ+s`*M;2GFv>YA{
znSiC>XYPb)1v#|VBwivuU_=8nTO>w!7vJ42*2>)aM7iRa!(smlR^?BsKg>snrsQ1G
zHmG&YW>uZ!d&~`@7LDvnQERix30uC}0;+5DF~*$=`hA3+%$(s419<o6T+ozhX<}Du
zGgdQpEB+KXUX`&cO=reKRv51u(US#{WOJKY;@yTNZRUT!KYai8%{v}<#u7xn-~LDX
z{Wp7NWKq(0&tSPOTuN<4F`CcDe||r&vU2P0YtE}mVYW)>?*0sNE3$oe3A|KBZq2~;
z4svUzEq&heu4RMEP}v68omFlvRsW7-jCEf-jB{&E_AEvF3)B}Q`?8v~a|5w;dv7n^
z21}y0xwbB9&GmX?t=@XM*0hkif4q73`cOtPiEF<8aB%QllD*inEvA2%W;p16%arf#
z*B2TE%x3yT322>v3^Xe+wncJ>UZJ=}F^LGKG{?-ds2bi!6+X1xMDm3mqdS~zWUs+4
zU>IYJd;;Z<+BPWpp_KR%uN6@JvdiY0m>mMu?-*hl-=p-3&(W0(4SBIWY#Yb0C#6jE
zL0n&F&V3inKv($()jYUWwxvG@#wt^Dh*dsKse0PvE5_|j-frmq+k(IM8~hB_-55s*
z$BOUK*Ae4AA-TfqfNkk7g4c%Y`<${H>!Q?x%qZ5Ql<-X+7m|_Jb(VNB1ts>6S3!F+
zAU>_f9>Z`S+TCgJ@qm&!n!uu(9Q`iIA9J5!j_NB^^`lWf9!2PUg;Et=TS_M^BtNUt
zR}-%QcDK2|m#_JXrzPVZ?MVY_l$x+Dgcr3dePXtE*Z}}dywHRUQ);3~-p&q(a6lOB
z$yjvgMZ8w$42t;kQZngyCA+!D?c(}i<XOZOG|$_3$uL5E#cKtGE1LNt9`4Jd62BuZ
ztjc*R+(tMwq~jSz&qR3PI^+D*wSwvsuMZHHP_S5g$?(L?wAcn_swLjF$?OB-2f_}=
zi1S0--`?Ogef`qpK~c+q=5BN?@tS|HZ}a$?`(N1!?t8KGeIQb}_9^2Hn|J!6RmZB5
zJ6{%*lVs9Rc;%E;H>t5tW?s3MsWuBV+_<&lHdhPErN>#MHGiqKnHJY99I+v$<&-0m
z_geEao%W+Fh<BO9BWc39B1uLPMb9_C&URwoVm%!Cf6QL;d?ns1zhI3^#iJd`Djt`3
ze4%vnQgZpLdtcQ?Po=?4#Tow=*Xu3<uu76rP5^$%8WT)<LKp5OoExSJz&S$WqYA)M
z2ygA%%TF`RTg&T56M&ma^VGBmttq&!ZE9`JDgdY2TGfsG%9JbkLGFacw<a}bFSG3y
z3BWJcO4PsO7-P~RRl%g)tMk!KhBL@rZ^nt+En=-TKxg%Fh1y>x;Y7T3d)}C~?3^-f
z9E3Bu8AUyFKfnuG9-ezO4jrbWm**a4K}G_{)USTk?|;j5@7}}KWiv)8Z^XuIKBuoG
z>yKftaTB1}q_h0^H}ZXm&?NHh@x>#Gm#^2d$oZ{DilZdrXyrs#?-S?(Q{8^cxN{GF
zfmv*kq&+t>igp`?cEhNn+gF0J6q;X?z#n74SK)wo0qNfOTVBHZU{kYesE*VWm)hL<
zCb`u2`v*j;g9)0+_%PvbJGJzEu30&j741l0vNVZ%u2mrMsvlJBw008Km3&bjiG3y8
zSFN91d+VmjzA9VV*w=Q|&bI3QoUNwWPA+?DgW<gQGq$#D_cODuTZ0v(SQhJGU24O^
zo|2-~!k(6@f5$P#{;n@sxr|EAU1`dM3Q<%Nwi<V$DGSqYXf$i4yHcPexo@m8{MNlb
z9#3B0;RRn)tljJB#OHgGmz!y)hLZAfEAPTtK7U;=L68(&*EBWayaY*WD|Xl@Tdv>-
zFI=(gn!E|hBS?AjG6sa0TK|q?j4zBgIoJZ-aJ^=n!J7)o*prQDR*txQNB6(F+K>Hn
zUwh%7Ur#$bJ=^D-(!D0%#NG!zd#xL3d_{Ved0&#A<^I?VVDjjh4%a=cjd|!<x~)7~
zVJlbggJt%lQ3=+am7bNVf5$P#5gK=S9C#CqmVIk`d<%_??@sHh3T-jVG#I_dC}01n
zoKqQ6gMl{5V58vn^Lt>O8fr@`)@e0co_rLiu}*1w!8u8dg6sNSt{PHpt?9|c%9Jbk
zK{f=-Vx4(N4I0W!t$)Wc#s(Z~eA~Re#w;I>fx`RKm4l6S%D9L%)*CO^o6Yr?4Y6Kd
zZ)~pB8_m|s&F`L*@_`VMrWuOJ*y?|JGm;dcO9H@3^H&?GLzM*Cp|x0*Fb(zY8WP~X
z+|Ma2Sc>%hDMA9wx+ZIukN^!C5}@(vQP-rdugN`x1hBo!xcckxSK$Ga%fIx#GF<-g
z_e;JOiCz8ov=9M$dzO#@Q`c*ni*HM+d1bgiv<oC7s<g+W8f%WJ`+csJ5hhWpYU|Pz
zp5QIR_94ugDt&@l+jZH;z8p_O>vMzmLsQnT>v@oO?Z>(SOI?egE-?3`eeD{DxTJ&t
ztE|d={W`^67b_%@KHAj=k7Jb;Uy}d1&!sX~-Go^?8rG|yf~#&+V58+PTEy;eGp06E
z)Y7nal@ti&Ib<@?GMTKB(aC=2ey_goh#6nL@k}5Oa{;>ceVFNyF(vVsm}Ma7i~4`w
zQb~)-<~P1nQXuG2_<Bm5lBhr~F*1YaQ&0y?z~l!#O2!mAS1{r6B=n=Ny0SAWIc7qH
z#H~4B3!5V^Aa8&oD)IpvvxJ!b%JPE2oBqk<g_+hwmlqn}U&!hE2q9)&8wK;1Ict(`
z#}b12zV=IO0<tM(gH*k*DI3u9jbx9|F`&%LW|0Y`tW`!PFkrZ?%~>;QB;PRTZ|60e
zwBcCEnmMt!y;qLzR{U*2jGeRS*|Yz8`us^hq1*GK8XW#`M*oOhNAx3GuhRMZBfstr
zyp?fxFmE4q_^hw5;_t@BT3!DQpXPdVwfSF-)kbrDZEd63f^yA9V|C-dMEyP|n)jI?
z<0Hg>O*#{QJSiwQ<^6a1iGoQ8bc0tunv5_F-;Z*=pFJ~}!W*Oo;-&&`E4PYm9ECww
z1S8jP!((xC6O6`@sMLIc-e5NvpAp#7N>ZL!P2k|Rwp{<>`N{s#+eP3_haKZ(ci0<v
zzAHWw`eDN#qwqqU2hsSHzv3`YMHPEHjjMWnaZ{CD`qXPmG}qg%RMoeigsfD_6doeS
zTnUY|;saoOv(3tqFSMe@l=?mK5y2!X|5hCX`Ndkv`1{P^PJmghLit)}((k)yDU7Oq
zH^0~*=zhjheFw&tTWlOUel%dVy5spycx?=@jin^<Pgb@&06w3Ww%^miNiVEb(3{m(
z13Q5k;iAGh1T~Y1U!LQV-F#%bXc-noRH5{#c=algQPgKaTsj^|0l^S3*Mom3q+NI|
zoHNJsjiMazr%}%=Sk6#x(?Ef8nJHd|-Z+K|wxkbmG=Uv}5Ra?UY78bIQ>WmyAbxcR
zBR7mlDx3Jc4KeBz(%{hPa;yYE60LJSyxYNK3_Xb({+$MNTPR?{zr)ZwJ0Ih0&!S03
z)SSTpWS|i6Pc~AioWcXYa++Pt32bZ`A`s^asH=CC0D>kAZ_}eNNBc2G4g`9(JDh)8
zn>)kUcVLOT00lb{dA<GH{>jNd7d2r~-*MPRvc4o(SKesg-931-C92p500et6aa@fy
zeme29U6)u?5XM8a{O_STxfj8f9t%f|$Jc4J8V^TA!9e<lQTpR3J!>c+KB`hgjZf3>
zV`@{y!j(&{1fgdQ3Cbl=zbY56s@~E&oL;9l1w72GU7K(P*9+-1QE1WY2s#j)@GLV8
zKo*U_SE*8!YO%Hf&X6k9zgfDiV)avvP6m|tQrw`n=7Ll9(NT~h6LcP68TVhJGV(@l
z=0MQLQi1(h>xxg6Dm5woP5At&Vx9`O1wA<9^Wq+`K|F4#gS>VnOjX6y!BN5E=*~yR
zl(QgoqftT}fqJgKT-#VbO`}EzFH*a`itXgk6vUG>R>T-&KkYZg&25Yhd9AilZ3!d<
z`fuZs!!`n#&)gHEAT@wcKNYpBnY!j3j2JO@-&nVb|CZ|<8){<{ZQL}*7R()izUgSM
z6~LEBGawaEtOBac<n^7jOi&~iEfs)F=8)Ri=qAxj@x1SRc7-=yObxJjbcJVzedzha
z#?Q2~z<Qol=%NnyMgY}CbRJ9wz(u&6{o3t`(7CLnMvbI80yG&7JUm6UQyDiXu&;rB
zg433lM3RX-*EdO%4EKv{fqOL)H~+8t@Bg>(@BjDl|1E5tzSz3uN@>ohaAL<}XFQ2G
zxSc)&!#<{R_**4Ag$m9RDQQ0lOg<zBhSKn5N?*^Vfeb9Pty9nMqF#A|t(WO_XEOMl
z?J^YF;ByA@sRHldFtH5cj4PMv|LtTj_JGLSM-h&Y$0X{Z55#!UaWd*5Il{)Gkc0f>
zH}N|ZwGVgzr^gxJGl;sVHOh?qy%R=wEd6T|K!JIYLk;RQr#8IB>Oz7vuh_Is5K5w;
z8+v~q9ew)5GlE|Q-Dyj4=MKl%)VQcKE@5^SmtBa17U4n?1Ci6t8(9txlgSVm%jeNz
z9`fVllMQgkrl6rum8*&|W=1+G3u5SV)e?Mh#ii?oy=4&N#u_bl*o}W4FynL(LuSKL
zefOwSY-WNAb<|ozCwK2Zm&)Sh-9S;!^0XJ))JbkZ&(kPvW$bi5jinF+2Vd^i!E#B#
zPkutupquFsD5kgw1SErxM1)~LY1&&b^dsco2Tn9j(7hi9L*i=7AybB#uDIRvfR1Rj
z5P3L;bMQ-IS>8ZNCzlm|iMRe}3d@zG!gSJTVb!aup=r}f#$_YM)C3@fJ5HL+%v)ok
zzt#rVhj6DoUVdlmUEb5?)=QPy)cOz}d0*3ZkjpY{C!<o~FV(HB@c^YZyo5txr%kGo
zHra6W0yn}WA5vd0P7aRkv)n%ZO<=vy?T+cKKFtMj43L_P#P~9xF2oUbL1rS+in;5$
z1DNASlrsd%K|$ZWa=R0{H8Pb?Q8)BPAV=|q!Z}NHKc*&tmkSl68cw4jKB8eu+qrPO
z0k+&`!E|e@<3z6dj=u@XPBRTO@6-TvkCTFZOOvh2nN)dbpE6pV%JKdQq5>WDqEbUx
zH=2!?P55_Xr4Ii!wy1KmBL14{t69)j)7BR>{^s2;(9H{^1yct@rL;~L#9Lh72o*q`
zV0_NYO$#l~oeP((e?as^Y;=8f4U8Yuw6{T+1XjoId89E~tK<KsF!@m$+^}lsV-$2h
z!$d1FC@K<=r?;%q7k~Y0Y8oY5XsQ+x!PIsqgCTcB<uwJ~L4^W`UP@!R?Y3q?9HH_7
zxJ1}OWzG^q^OBu0Ztkwo)<<phJks=kky}Nf9(8EyM2xbOvZBlgV8K%wMRT<LGNC-R
z8ZpGZ8h3&8@+N8QwwQ3f3xw0{dOa8uv_0{$DHQC2e&LAiT}QHO^fFq-$PDr=j5t#@
zQ<nQql{ROd6o}8m?d`l%Q*SRWuJ<_Y98CnH;^k9Thea^?fT!rt^Bs6`TVU03vxEkC
z(4W)sQTaL;Trb_SU5AFz+X98}0SP{wok>oXlx;}=<AIWnZ4d=?LE&DF;N;N6pfW>;
zrU3czSF<wb(2L;wt+Tad#`@>uY!ekMAM-eru-9p$fhOsdHR45gp}mfI&jCydYQFuR
zdxZm##-3;V=2SE^f!;QIX-ql_Mw0>T8POoy65=ND>uEj)he)-n&<UA6z+XUG_yQvj
zZBOv_q|bJ^9=Qc_a<)mg>qZgcu&i%|9`}WCq0Y=Qp-YNub3B<U#gHI2j1(C)*u!X`
z3;5S4Mji>i(3P&p5ikWgHDEC%f}}gi>;+NTgE8aj;P~QbZ^z_5_q^zH4LP%(7{V6G
z${5maO^#4A|3!|y23Yoa0PwCw*M1kRi{t7!X!tDMH`cy~uCLuF1F9M7*8ne^Yf+y*
z{tR@FF>4>12UM*4OFc0*1#XEg(a?bbYv6U!nA^VKRO{nFT4fk_5VV0J7{%$Sp>P{H
zV*qN7Y7nn&x0<)<Cg7K>CMru?&5Er-L2yNcq8;a`!<KCwX6;U%U8?OH=oaJWqz-y3
zWrI~Tsao3N00e>>mh!reMz^iZbR8j_W~Zg~h9Wu905)WOYYEucvHL3UQRH2sjYxMt
z+AU2!GaTFUiFjy0TYGfS!+3l+>2-cMAxuFiZg74cS>jYZ@e_`i%)3D1_fl8hOn?wz
zHKe}ug*eb!)w4A}H%zpaH#Z3wS>uxVK!UP0-F{2;Ze)i`o*mXWoVeO{gy!+!|LhG0
zVtftk1}$d#Kr*dOiVS&gmX6sVk7{r(Pq}^oyc`xvRCZ+%q{euSs<89x&}1n6-O^(m
zJ0sSO0pa%^opqsei9}-@bb~>f$?Fb#k!ifs#z!d&9(>eJY<Q>=8Sx|}os7)la%^|8
zD=#A=U^Kd8v3XjqI4ZknFU7jMX<I*c?-zGORm`4B*QHBvV4__jDvA`qQn(<@RIVzb
ziTs|v>*pq5(+2{Z@48kvnzcqVJskB-8qdh)O(q!eA$^LlTtnsUc0aOG4*kJqv(|T9
zCy%GT;Wd_Qo_)nqBxxIn8~GNDC36h>WeNTb!e~p>mx$Q7@U_{fH>YvPG}l;3^0h6b
z|J<Lc_WyK9;P?4G01EB@8;!NK#(LWRf4xzEvj2aK4{^5`s|Gh9?`AX<f+vdSjvYji
z!yTzJ2@6PSK!l5}M`NQwY4)cK1zC16__wNJyOrfB>O-ym2E=Up?)WkYKPQd^B;_I_
z#l~}W$!49JFG)G8N|3Ex>OC8r@_RDCOTEW=%GYdzCJPt?O$!3d!`KF9mdF`hs!(=_
z8soGZp99DS%8or>1Yr+t9WYrtN=v|FlZQaS_76M19B==9Uuy;yHI(V$qkuJpSdIZ4
zx<kkF$u1oqo+C$mPWK5YjU+ckRoVSi_H4Eqk|D!0NuT)#z$^!K5aC#8WQrUD&{i<;
zlPM&#^7{BRbhU=i2E-3UX9C!UHB<v$gvRq{XHXh>7h;*6C?I!c;SBLW)FIfXiW)Q+
zc<HIB*4Om89MkOtcCOC^_a*>gWhK)n{R=%-bv&wS_>wfvp5(_=&BY@;N)|B9_}K4y
zNdC`SHJjqtQrzg0_$Wsi1_Srh<ngSs7=BnDJ5n-O;If50jW~^QB`l{G#Lfga&}U;`
zOnB|^I>_~VT45{$JHQKi9*8Y`qs(@wZa;LR^OTIWB2LcJV%&l<9_j%L(;e%Wl-(iH
z^L^mDBlJzNE*9$H<!Dut5_NhL0{lHKV}|%w6UtXvI+1;L6X_9e3}A9^w~tTukCrNP
zEwFNcuud?4efi&_gTg!@w(|~$?Sg}0JMT~^r1?8V<bG!grQazc@)9Xfe(_-pe%FP0
zfe6o=45+|P8Ud=?35AedSGkLFcw$8pshWqjX<vhYj9w2n)X}Z@>tCl3h?^xzo}i)6
z?TGANwk9Lg+dz|KS)kFr*~rGOgBlwQXhE16g9$j<K+|+gCmRgvH}7_jcK-SL;Bfmy
zAJekh;fT4ELf*v-GB3<*z(fTm8e;z+2-4Jh6g)fE{XyW!a`lylQAGKzrD~dy1_5wP
zNqXLyOMV2^9rH>4B!AgI!8>Vfeikf}hZm4QcZ^Gx^PYrr6&!^6Hw*5REU3Xvx3S4i
zoCMRjEZ(VSD&(paZO9E%QIalUHCa&2f`M{4mk!zGz`;Fo&hYBC$ayF|rFcFU&KDfc
zsbNoa_c=kcGtCLdb2jIs)SmA;gF*DFwT#;wr1}t%h$dRyJ}s!HmzJQ_D`b#)=ji?6
z`-Ar%j(;^bEJeVH^&;dQ3dK1Bl^&K%eWsy2adFCRt=)4`&jBsB(=?yjf`XlJ6pRLB
zAm)e;@O*lKP^dSha5s-IXNUl-bv_*+@D;E7Tjo(v*`;*iWFyq`(6<bwJZ^N$()Ztw
zvwhEuE)5f15*U_8ngLPgxp0OI^5{M@dPww8tKSukoafD)=dB_%>xy0q&F=do`D)9i
zJetTOjLa2o25uiZLht7EQW=GT3n(axA6DS+9K1dJ`@VQyjk{PDRoTMgY?P&9>4cVR
z3JR&uET|N>ji|sNL~4`FBA!GFHPk1c5~<HD6iI#NpiJtMOQF=~F(_3$80*tATOf<h
z`7M;&Iy|1cqpwEfz6Pe|5x?yF=9KrXX*&T4V)>nrLoDOhcOjaoM!pK>*#F9&jR$Zx
z8o5kS<`Z31Cc4X<OF=9&S2tR=5GylrNCOx#S;p4I-%xFXBvl3k*<pWQc_VC8T@WWI
z?d`CLC$%ad?r!JF!G0ighj@CslSs)@A5h)CFDZHF{-xxduOcO<!2TX_%N@AVR@9fu
zpb8mJa@0uDu%Z@CHMx>%<4s?gS0jmrHIBw;8{v${aALE$wmv{OY~3H=JqQA+h8);!
zq*Ly=<4f1&d7(9{sv51N@qxWH5Z~~K?Ake{XY(UKsWZ=t2T)VGgz#>tH5hehoOaZK
zb_=R}i#-2qDm<2nhu6xrdWsrODavr2ge)LcHs?wot!M?%%D$e1N_`?Km5f*1aD@zs
zJU-a|`~Kl;)q$4U8Mm(Btt%?M;L^_o1qsCv-H+0`4@rzj3s`IDp&{U}L=TzNNYjJV
zYjiQuXJVr*IKHLK<WRj$(2}$BhC`s|Ao~xl(K(jS0ote)MK-1bl4+pD@Qb!^n1(Mt
z)K^b4EI=E^h%Kq*>SO?XrVvLT0pO5zs``p0F2Ivfc1~Fc>g_{~44UkpsGBH>c@~hy
zs+H_KVC9oNfcl_v3Lz_P3I))J7%)sKpvjpCg`AJN$B^cOiEapA&Z=*HeE>rE_Q8Py
zjlyU<ILNvccqZcw1>)J-QrVuMA`^48!ZGJZXVgb(sn@|w+NbzeUHzdiXI<1YV?8=N
z*vHF234oB?$`oEGt5kW~TR0;O;z4~AcVG?-xH|95r>Hr+`GS5wzKD*DvNCkXO_j>w
zI?8=u)2=`<+0xIVZZ8m9_wwCOL>^X+TkH4~k0XmBhoj#@>X+7hk;I+b2d0-0KfMxi
zqy@;L7C>E1GyM54cr5R!$R^l=LE0jeS%Kn-Q4b|187~s!Ma~-OZDQegCb!n(Qz<xx
zy@9v^?)KV^)m7?Mgs*@N=lI*vr8DYvjBBguC$J8;Vyg!HlrsRR!jNaLrmO&RhE;IE
zmMUn!+|vt6#J({XDxdF2@Mkn~k@evE1%N8o-t29bZ+E`7@ncvMGb1w^#D)uzP^Ke}
z3eNakii?fa#^Q2va`4)|LTp%$na<=fAa9;#LVXq_*F`=ncpDBi;rxLE75IOz$5;P2
zT+^t9CV(CQaK>Zc`H|+|W(BCrU9`E2I*M!v;?5a{|A4t)waM}^*BC==N_Ql~5vfF1
zjoG_uH0JE9IY(d3Is0m<zSz}`)-S)Cmov4!I#b)L#ceYav4)ltf0IE+(S(WukFvEZ
zdBaYI>|dj>?9yeH^=NNLjL7d;+Fil#&spuA{z0dF*pf=RP!0%Wvy$Zl(jUv&oJ&+0
zGEs^aPiwJp?=3d(y+xSybOWgwCw;#SHp?_P1y6og*ofg=iLRYv_7B+u*)AayK-w90
z7_zIklNOoxAh8N-y+8cBQs(fmR;KR5(8VacYdP9e^^xIzt5mw^fYO^LSr>Wd7P~x6
zt%M>$DK{#5*swipW*n}n)OVRN<EH~l@Of&<sh1tbtk7eD!CbTJ&eNYnt2K2Xg(ZsL
zk^sizvPEpReaJgNRG0w<(RJ&XQJ4MELX24gM>+C-=V9Q3aMmkEV9ULT{*gO|2(;WJ
zPWQ7PTmo}^M!do`nS%0K11+D@+NDdyBeuPTM)!7(-~9JJ>CpD}cRu_g_TK!me|!Q$
zA#6~X)Rgu}zV5hPXA-&6niNr&n5U?C>&>JFNPl9TwS|nb4!d=l5=d;y$kNR=9;Vr5
zZnMQmQ+D%7^#^yx3Tw@A5~CQ<K8s_L-w{`j$H9n5FR?Mi;1p9|D4%8Bbhh<w)r)D(
z)av$YJfphKuj#zv+%;FH!8nPD1M>3_b411LmNdPdA{o%W(|Qb}HiolSC{f&hylI1e
z)Ruy=l&~`!@tzuL+*d=*(`m5X#bjRcHlUbi<=_ukPJA@&ql+$4v$gA13N}wm4J*-_
zr=_NqPL*#dRt`x3!MRi~`6(uQ>4t$~%CB=*Y|LA+nP1WRCi^h|UYq|dZ!n&(<C>~!
znyO-&a&e{Z;AEOQFVdKxm>fyoS@RUZWR0kD<_Kb*FKRm<j{hkgB`jJzn<k@_sNBj?
zlocujGd?hbi9;?hwE?g<<BX^<yMGIQG+`+5S^^2Eqqw;{T$;o;`kGJ66dt3b55&w&
zMCLO7cQXqLSweh{S<=KEEFymw<R<Z8PBkKL+i7|xo0(`o(jCX#iPP~0-uPO{i816Q
z!m^U2bItvqrCN!xmX#(54RllX2#pggUa?__dx3t+xZ>Wc#&Rnrd!iQz7cYP^V@?5!
zO!i`p4W0f&V*}!NQcX~dcDWO6plTL@Du<CP;$Sk3`IBLX4PEdC^bS~UJ!sihf#Ey1
z_3&O|F#v0ihGVgHhN4&~A#wjD%mnz>hX;i{M4~?dL?QNsq8CVA5o>|@k^_3`V)D`m
zaLJnAH2<<=Dp{N6T56WbzigQ5VwxTFe3vr!b4QXw#P{fiW~{WJr8cj+9d)^os(p#(
zL2N&O8=fL5@ST3@s@y~SB;65}q6lC;QU{T)KVTas(bSTN;m1JaI0O=IQQ2B5DU`V-
z^a^S?tn8k8b=B*j7!(3d;wJQi3`IzmEd~%y3FZD6oAazXX7{lzT}uT%nR0?#G_<_y
z3g#K#iwBnoA93dX|JnQZy*AD)ZycR}f4Yhq>={E^5(w~#H_6)=u+0PmFW^pR(*Dqe
zR6w;Ql}05QlXT{@Z)4xczJYxw`%3ouuETREl{h#~(mii9)3H!hJ@p*cvz~SQuHj6+
zF%bovGFe*Yw5nc@!g(;rd%WW-Z|JNHO5|;VcAD~%RYAC77{gWSFSz0DbJ05kkVgxs
zXF;}c4KKfAnr<+2_ZDTYYDF3GbRoN*Q!vqm-r4O3z&!q6A_f6#N3Aj6@7#ySyEI*a
zO1fb4EOk;F6iBk0MVC-eNuk($oCr@hYnhHX43nu)iU241S;~ic($G<ZrapZOJg#&W
zt8uO@$->H}6NFARWgwtwA|5Hi2ed~PE*8z@Bbb_4yld?8QaeqXp%`XMpFo{6lxYe6
zj$TL%QW&^o5urnj-;(sk#c1i1sfKyyzkWs3gXy=rF|Aw-rodS%|MJ!1_kZcV`(o)Q
zCrL1;#<fw}&ECD^uV4LJ?_NShh2VH(cP6l_>=9QG0%0kI#<E)!)E)1PPPJJ<@p3fh
zbHd}JYvy3Zb9CZ4!K)q=Z04MG%)qu5vjUPR7cnuPzLc{JVC845hiBIJ*!85Fjq{6q
zNR!SC`wDfQv{-xZh6S>7U4yq)!y|b{Zj7Wu-XMw>k@h}8Ff;-72GLM&xkWg%yKWE<
z|4}8siu7Vr^6SelGh$Zsfc5K6g3B$hy8L0*PEpf--EFgt^{$8MAn&&5?mP5({@o9f
zlkqjC{oFWGBx@;KDWNM$qyqo7Ov-V$z)mP<C_oO}@4K9VLG;vpPfTJ!t>-F6#YE#!
z)!qxL+WX|oWX&+u-q$$*>v7oT!m!y#(az}wBxIaE%ohNjKN{n)$>NxZaB=Ai7T1=3
znwM=PY5G5}4eNxsl%<Ur_-%7uqulJgb}y~r%e1^aErEl5$ClA(lC0eM-aB=Gm9e`I
zjr;If=Ale`J(=Kaa_?!lOPlu`*^Qn3!5aP{?5#8;jr?@SX}R-DtoxtxlG}zODPwpQ
z!lOUe>{nX-eDm)Z$=`&L{4HW6f4eF8V4Qq(G{JVhh2#s)o>@rC-nmwG>#VM=-zOK8
z8od}7(^1l;7AINM`oiFvuQ9`@cf!)+5J;qnS4RhL596mci5F+d*1_BTlcbXzpB(LM
zzB!Iw^7XAQk?2p0me0m#ML82AjSnUlacFlw4eX)bRP=gX)rV-LMY=G~mf0s5X>$Q5
zn8>!p`{bc(fpq)DlY{Mp4VEkbg9$xjX?9^g;qaP~Oz)-I8;pq*<z&?gR=iXBp;d9S
z{tV-bNd)@uear|>Q3=PB0$gOA7t@l2yL>pA6#@XtH$W-nYQT`v45A&!5?CMK4`Xvo
zbalu5L%aXRQ@>&a31rOM%^>ppw6yE6u1fs_XH2yA*nB8;SS7-e3$xC%C)x~g`he55
zu<Qd`#Pot!9w6d-s%mV%;6#yZP>ip?Son!C6NN%pk*;yZ$8=?m<FR<|Yeor9#vTp&
z!U`YhM_{4FK(WOFi^=<nm<VbJOt_;yY3GSV4CaGu=4ImGm}S+ESz@Z`Tb2IqrYhSk
z+^Q~Xt2M8_(;9IBcubcBq2*kj;0xl`U%afX>3}Q8^8I|;=b+vklb!kSG~QwHI(O!*
z^9=u0$YFGQ_JmQYIGw;o7Ewh_V91RmRM(GxjbkL|Pt8N?!`$#kHk4KN7`%(5r=-II
zu#4VzQ`>;8_H1@!^^SS;aN|SFujrKL|I8Tyn|6>pkkQWQayBzfUjBozle4t@9xMgm
zkc=nE3CwJeBAQw3Jb5pdh`Qlk%zvoZ_htrCITW=07M`^2)_Jn_Y(4oy@-UyHoLFN~
z!l!*^3F>}kC46d3OG4XoDB(8q68Gz-$h&))nPx}%Q{B<^k0S1{Woky&xd|od0d<a{
z64|(Hw&zc>8^<qTOW6Z9;M1|r2SF*`aT>>zzYQ{C58YBC%{j(AB|4YGG@m>wMdqb3
zEHxNQnA$q+j;5#f+>h+U=M&gw9_x{OZ-oyc!`OM=qi^3Q0y6BL94E2;j4c{;o1zWV
zL!Fh?_28zB4TB!ed$mtW6_bbjXK;x8uLq%%{cm(U!rw@DBFg5BJqv&+n9|`C3WaD{
zrtAB}crG{HS*!HCti8*+&Q%|hcS%U2GhxzQ#&Mt{h{m^!Ip5%l4+{;yu58fLR|!ea
zlJYoXD2VSRBle-*{!oVTQ2u%+^Z`TLl=PZ^n>yn7H@Sf($q|JEVYn)YYEqba86`sK
zLfc^4nBpiV*^q@fj@IxISlr#y32#6tl1LN<s!q1{zBxVF`bK(>P7OaGqKwo8i+-{7
zLI=BPzY9Qljd$U-*SQz2nk>5G5xaKf9c^46tjAqjdACH`VXv6d-dlVa^lT|v76$lJ
z;)B1Yar05@otoA=@1n=c8y;V+d3-f~d^Dw*O@h(sN-h(P;R{C6sq}bMR-Y+ve5OJ&
z^2&$O3X=-a3UfDa2JW4)<|fkAOtK(wv~nb|5^sWUindw*oKBnTpC7MxKST5VQ&2xc
zJYaAGaWK1{_l&|38<7o*>BXh6EydraDRsGwm|y0Q>^40k`Gf(haf8BNOBv0xDFppe
z8|JVB=HP;?!pUklDsW=!C~0TY(l@29hI(jN+JXxQ2t^srqS(bQNfBH;Fw?>`fgETt
zVdLz-ricnQ9Ag7^NEU?{h}$y$b2YkSDO#zTxQ-QtTy;?zcXk^vCe3&{9C9VgVX~JG
zryrYcG|J6nhcB1LZWOh6R8U(uop+ZHBn{Q)ZMcOlN>|{Nnc5U}-hK)QL0)kxOhESI
zLwe||uaX7s4Jj7?o8+wx6Z$R5JMH&RdFvnvoPEmTfyPn^obqg>soS0p-P108m;ch0
zvE5r2N9rD^rb!3aPSbu)l=Wj(nh^$83<L6T5rBM@IMPm$ybE&0&Hkn{ai7O8zH@%I
z>-sGj&(-^NIG;7I`>uVtdw=FAHfA}gcgy+vSf*311DWq{)3UNug-yS#3^NaYN+KLJ
z6+%VU`UHvxQ9}0BB>)oQxFE+ZNSit<rb9)Ax&edk?glyg1nRLa!matTH4ekOwpQV<
z9my$PU3o9e6;p}d26=Z}C{tA{4)KOzIgjVwsT+5(AKtC8&fOZDv+8wbz4GpMJ!#|@
zvhCsX^UQkBINr8??5u-^O#UV(MIaeC6=;D){pE*VVpztt`DtcxBY+E3jqLlXiuSPb
zuK77B&eDDw>K1b~WPIjix+yKBn$Qrk1C|$6Zef-(Hl{zPC5B-Y=pkW2s-7AxtZ)Q8
zjz-Cf?)e;Nc}=~E#)ZGn8-X*wYTB5xMhF)SY^PPkt#Fuxl}oEi;q_^qCbqDF+#S*L
zdJ#lQ`a?V$X~4glT1~sh`Tr>#bhUnQnW~)(0a=9|hkyTj690;Gd<G#b{IE>K*1W11
zJg>9WL$Hq@V8eb`xzd@J_Ezu9yX%lZPxl!TAlyFNm{#WH1m1N_R%zp=0nF2htPIKg
zoKDsQuF|0u5h|`i>47T}vHL-A{l;8RkEjpfSp`H15d%rM4c~W%iEbV5zB)cRIK118
z2RR${Q+eAV28pFh?29)(YMI}Brrakv8wS)>yx{cg0`|Mpe0WOy{{ngogLBR4^WAWh
zeaF?ZI<Z>w^Ss`3rXmcoOfCxI*XnKJV7^o`*lFxd<N)=H;(b_zO3zp0lXjTjV^`ip
zy>pK8RUGBpp?Sj8&!!Y=cSuC^qEXgsGG%GE-^;93oIG<djPJS?hsEa}M^D6c5m)%A
z!;wm=ygwi$8g@GRyhCB0_zB$qGmf$IOONp`ob#6Pgte5YHKhDFvRiZ>vZcHA`yXZg
z@OcoRd-<Hk>KV|q;yL`<bUaS4f8kS6`Zms>KS5W$<59A8uzzy<QF1rtNb~(@BD!*#
zoJ~t+ha=*dqRT+to+R0*AX39>epVfVM8VG`{Nt^sq`!`ki>zj<iWbm%=rx2n{>n=K
zU_SnS)<5vDR(p9kJE%LoM6L6t&<3x*foLKfYTolVpeo$%c?>_|9@N?0NFIiheKVYh
zJgJ+HN4nv<IK3T>BznAzA1`lye17ge2N%%bhs7x@w8QRo^6&qiEZ$kRp8eTa@6v4(
z>97W(wf{1CdRK6RXw7ea?q^QGkofStBlDBT*?IhF<Gks)`YUspACY{1el7kA@m-*(
za6YML^=8brQ?Sa}=TAe3>f|9PKMmLEb7DGuGM-aisKu?NR`Bsi1ukmvo_I)i!a`CF
zA{G)p5eexA6r>QHr?R*%dt8oF0FB<z%nd2?;pbBd+~DIg=`|mTcCTN7Dya0#1l)bb
zeO`S$BIkCWP0A_F*i;mvU2}ojPh5_>0s4G8m`?=c<0tS=&;BAXIroOh`6OJLibF08
z))fu?ECbijct{3?p>Nn`=9GINwWwSZ9`vJH^*Qq3bg?~QE`^sy8_KP&WvTb4y(Iep
znsWwI=g^0xM(cQRKT)PnyQ!^(uVj9CIUQcKnLvX$RJi_yeek%{0<7Ve7{N#*c<zy>
zcXMjoozmiN_1;%+s`23C^UK!6_Ew-@ELtG!(p`M+^M)`tUGMfx$6L}a?Y8;m>xzW`
zGm-;qo}BgT&7ws7j5z+E;WDc?3#@#)GfR7;9$-u3&0I-mZ1C#-hX1zWpNZO><7Ih}
zl)0iRqp^d7H^N-#+`}1n4f6$`o%pr%d}xL$V75EuOR`5<|8;*>UBiI^;Cb>ee)h(d
z8KvT1DZtEfbw&zjWGMya;fgc-{`uN>wg=ymzI|8w?|n}!J}~%n==QU8I34*jYIj(h
z8_Y2_nl+UM&)c*fZNF$n)t#i<Mq@JTZGFeLI0w-lhki~jiS)R!#q-`$)1PP-px^?P
zN~LHy`vUKvoPBJlS){`*pQyMy&MtBgch+07cOM|U{VFfBreImHMs=l}c3Ng06aTzt
zeL*7{?O+U<*Jp8*4)g9()3gUW=7ZLD4iEPBPPb0>PTw4CE6_x*(mOi={3xhNde?bR
zP6R`wh=wgDsP3fy`<XlU%)QH@+f;0y;tHYKy80i8Iwk<a$VMU4U~`}y(YysD_T`rI
zv=*{v_7ML4(EcBC`rd209x&uy;!7(P#!r=n8pjDl_9`W~N=x%5#j<*Qs}{ATA_699
z-l<m;V)G*HzDL?CbsSB)z))=mPDI-1cac-P?cIwZY)Yyf=qQAQnZXe8WW(iyRbufj
z4%!+&xpR(B9WGlrh9zkXKZQTvC4w>KBXC^wrd`zKA-W@SKpD_$jF1@v_|0lE9p>(E
zD>Go3O&9@>h~~l5)s@Hh<<UBl&K&?uI(I`b>D<Dp-EBV$<W5^zy^WdJeRqI6akt)H
z4#?el!x(NKhqZP)Y)gFSEn}(NeDi4VdFY7XQ-T5?x~2G}D8Tz#+3sE()s1SlM(R9R
z`Fl6MdRqZjeD09e_9=x}x#>B{u5-)n)<(Xf>aNHH5?wm$&Ye>S6(2P=xe4J@<O<Ao
zItrrdxZzxbwa;_n=Vx?M#5}X6ZEk==i34LMi|OIvZ2@&*p(!up&W`uKDWkPC9<#-V
z5&Ns1Vu%L6!3OwTG#b=<=3la2jp4Y4Aj6}VPcccM&Uy%?QMGNX@j=6aPPpvjNW2Cv
z@S(;zQh{ibN}VpPm!3Jr)9-3R((0dd+#+~(HlpgrXIJMxJ6~=7@f%jqocis8+@V||
zA!YzkgoU463Zam)N3Zx)5Zn1D{jF!N6u`Oh#Qmo@?>-T9D$E(DXCBU`qu1qCzta2#
zT|;Jn-GWuEa<Q|5bh>gj*!Vu`-7J;fP1_yLx;<+i#OsoUh1qTWP|4~3Ww0J9A$>x<
zs{q!WX${jlYvjY{zHD{zduU=enA18-^Q4BwDqaG=TblU-=tha+3$MI;_wyU+P$Qqj
zzN;2Kp1?bD@MBr)Ah2ArH|ya#s-!UlF7vEMmYU`2zUT~}!O}g6)Hg*^pdG^i+Z%+F
znJZSz_O`X1Kj_u_4SMyigAPV~7uxNxPCFl4VgB$w6=^|o%HKz)(;ca0_uTyOAK0Qr
z;uy^sQhSSdt?$l&o@4y8um3feQ1!{*Ig9(;m$TF_!mW(rj$6w`@BbV=P<>Q0blu^v
zNE_6Ll55x3570|_|ME}wVa2gkaumQaWYlt5LbX_TSQbN6Yn)xQC*A%hz5`;*lPBx=
zxAXMzO8756kJndL{-v|tS$*>O@zd2cx^K0!`uNGeBrBhFq;oz~&~K9b%k*qIoJ?=H
z@0RQTq#xqnT%CFC+4JY{9GR^jq|k1V1QxjGNFB_FQtAbjM$K+fZkUkY`dUwL`?A^)
zumNJ8B)v_GX$c!As$xpY2dS}E(P*5WpXXhuJ(>i}_TB(xK$^b>!nQ%7XW6iOIY`Iv
z+sUTr{V;FC*~f87F2q5+Fr~8$Py-p#i>{z{w&&D=5-JxRYF4YM*K-~uTYPMZUWVW$
z*i=pj<ppt_>gRva?K=YD6F{|z6~=7f4cF4JIEA~orX6W%o1M(;Qic%(6QT8YIK9vJ
z$k2sW>w9!kOsE&Em|8|LKU)W{>5zT@R#h~Q79aj?Npvs?2w!PE{M)-)+wu_~xb^qX
znwXFHM6SPk*3x`*IvwU8C4i;=8GqeB$pPAK<!ERU3caVfNE@@QsO5LTn7$IjaW<Kb
zX7Ltb`BKC%FB<V9;zmC_{%(J3HF;3kej6B)cc0_)@Mw`l2PeSjRIV)HE6>x)Qh4v`
zJ?^Co5-Cvt{?uKWEBaJrA7>ijF3y^$__STXa4JGe@ZjqG9+X!FF_)dXTUO&+{DEC3
z=0uQVVtjE+X*n{|#f8er@2BxbG`G%5kaaEtxZC|d`7PbO?)J0O*%a(qcqiP=OjF$C
z9N1EhyUP`JnzS(e;ohNPw1%#*d(x7+H<FBedJ5RbQ($PHCSNDZz3jvC5O%wNmzN4J
z?^HNMeZEN4<<`UM$bPD9QfuUEkDA6f!9P{1EaPUurX;S_UU^(K@Z7TR-iyV0>@xwY
z;3vWARV~Uj%3@VY{9Ik+vpDPB(#h3N?_{iJ%kOb?l%p;o&ly(gnyQCuo{!gzmS#rt
zz3i~KU>OHn3oD3zuThR_@6+d3mu{?gHe1G<Pl>u7)!$WpZ~a|2_QEa4EQH@(juTDC
zpv_hyHfY$r4k_l&oPM!(6}W8N>?mh+)WzC0(5I`T_b1d1-1@|oy?4T>7$a(GlU2Dk
z>1#jzGiq#~_fxC?=~Vs<l`s0-tp7b;TUl9;^}o)Or}WS7`rohcd62vTC|}Dtp_!4K
zLsY#gNZTU)=|n?XrZ|3~0FHZ{R3f(?XHf03KFhjCpr&N2KgAIv{=U(;_>lKVy?H>w
zWl0)dHyugUP#`t3ZGV(rG4Pt8NhyBXJ`2qKKD8{ZF1uGzQ=Uc}4;oO#M%NOYv$(ZH
z>P}}pIZpc@Qq&TnZzN>(^U<iFH%#(z_QM}92E;zv-C|(FD~t2V6#{nh((;6Rq%iap
zs^!J;cCwduvtgOFsT&f_xpi>(-R}M?iKwT6P+MF^6b{(&fF%@CI7cMXA)6Jbcc?*f
z((NbD+K)*SMLKP_e>xgx-JEsq&eKL&Oo5=>ZZDV95kz&7*RT_7u1zO2iuy~UuFkp0
z$~`V|CtQANvSNRy{fjZY_V&Z1U%KxjgruGp!&3n!wV!*W;-7NZulva&xGQ&xJK5i*
zt9t5L_>Vv7H3@5|xp2`h&eHy=%Fpg+*A|hQ7T@G}$EZ1fZEfZnem<32X+V_KYiuT7
z=&U|%uh9Q>7W8Kt?E9>DdfqEfnFhY+{|>SEeF*Rilfh`&-_)LboGiSvS<HJF4(s9H
zDmptGDkhh_6-2$axg~itxLMQZQw3NDpnk%)#7~W<!&9~bqd|Ro7xvU)0to)=rhsHI
z(@)%uBOvsThnxpVEf57m95d{~ZZDxh{p29P713BakacOlNjA?pg7`FIK<+t|<a=sT
zV&s(1XvBzYai!F8QB3q%wsCX>g?5Le&#C4Elq1?S=Q%SZWn5N*SPS&I8_uqiM-Y4;
zH3d1WA(=_amwKv$nW+Rz*rx6vI!CNXhr8R>wv~erL|aJ1jy97YS-7TI0I*}yJ-<Lp
zA>#2vzJa8j1tztHsvTuCzTijoMCM^My!;b4VT68bE6Ooz<tRlKemg|A?9k67-qKzO
zrAyZ0#^Zp>|5ngR@X&@!*FfFx{9rv3ndzZZM;)7KwI*X?lPxI-SAKPkh|m_el?t%s
zSH!*K|DnU$gKfG6H(nN3ElwbY6!X=vu-_D!6ZtviM1IG1Y_ZMoD-Jk`+I{$=PTx<-
zLtVjS_3N)0UYY;+_jmO(8ISAJ+T{N#!tO(8RZR59I2<|r2^$2brJc97T+JBmOK4q5
zl#kXbje7nkjP6H9SN;*!Prigdg`q9@u#!3*?jb)v*Dxrt8HoNmO+OIN$KuF)ANnpl
zoaMY;@p*u<6mUm;)YcZ6W3eED4xQ{BlYYy>#!~!hzB|m0+cG1z=Tj2a4cSKLC&u$O
z+Fp3b)ArNp!yo_llUE`Pj8nO@Z3TBd1bZD1lGga#-Q$&Pp5?)N`rS7WboyIHvx{N`
z^~7T~6?NBWt8RNT-)Q5}iczJq-a}sUs-}f2T@tWp_axOPjHII{v^&Z7g5qvHOaI{C
zUaQm1dG0EBtP%I0C6j80rIrR7TA-^fAv64U;ilU{vn}zT8}C(`o4v0}uzJKY!6JCw
zT@<SfM{=hj8PCke=;!aE$^djeZkmwqMS#`8X5&eV7vkSa<!kh_37B1KCHa1I)q6MZ
zg;8UOX`0&>UA#|QGKcf}Cs*&=KW($Vo7&_(yV<*JvFX38X;Fmx-sQczn9dz?dWYdI
zAajBwO?5vl+`J`c=_Vo@&&h%t!Ohys#(Wm)ZlOMK_vv4jiUXdv+3STqvVh<Dd?<qp
z5nc{}kcV=H&FT9?cVkV@dwEx)jecZaNwURH*iRJ=W8SPh6b4IA)y;|)p`bfMw*C@D
zZ;37N*#I9NLpBUDhIO#~cdpKoO5if*QpW6_1cmW+6b2=>_a7hfmAZ&dC!lzNKm<yE
zPAJQrDf%kl56XX_yT>pttRcuIJ|!kZLYdQ*gksQ9NmH$hw-g28*h2iIQx8bQNcGs4
zHbif1hV_JI!%kQfk;!SzMz((*u_SEmmUAwgq59J*nuOa=t!N~lZzz=>%snIUxiLuS
z7KY*4nE55xDtCI>-H2xP&0cO}75w2SpAAf#HTZ`fl2EFg*%!!mz~+wRlz4AERD;4T
zJ44g`<_dMnJL{YY%vg{r#(8qHsBY<5!4VB=EK%RVxFGTwls?wh&FKbb$XPuB)V#kw
z^O`niLfYn(a149xLjANIqAuuc>I-|%*@}nyA`!deND;|$sm$L>BKs;x|K*#<nZ<E>
zHsIIZWO{E}`krf={3V`E;+P<i%Fpt4?M3AY&#o#LO!R97d#iE}_gi}JFPL^n6UZtZ
z(k8p(w7g_<SWpT@T&HHf`SFXRo$cM@1ejGvJBJ5HC&}^2=F!O)Ke-2}CEx+lIhTB~
z98r^<uLxUs$hTFhH1&+<(Zx6ngAG5)%&GJ}!^1qJ2a&b;F8R8K;AN+T(Tfk`F+JpG
z=bs>d8GiA_7o_RY<iIb=X9jmCm!2kcxxRX++}4@1<*joM`L?<5=kC=XNM`h$%TwgP
z^-B{OS8iJxu6)QRf*DD~`dZ2iOvcl!q66ZIfBmXP@pCl^<B6yp&rcO9%?-H?yT{wW
zq7o>hGHH!?e{tEXXkpb3vQlqu(W{-xOHskj%QpVa;Y-=j%J1Y$50d?&hgyB$I_x==
zB3}~*|Fv{}hnhaql7k8LP2OVu8l)c?;WK&SvN>waN$x(Mr7!K<j&f6sS4We_OQg?M
z6lVUFHs3>QzIM?UUKZmn8-q1JiJ72+T({emOt9HW`DS--FPITOM&E~j6Zdl6!6#k#
zHUO`>wHvcx3l-8(8QOD9dC3-j##>0dw)Sj?G4nS=eXPVR7$!84T0c0&&_Ca)m>iv;
zA$<+lct|zgi!!?#f~Nxo2z?a)fY&<eO;6Q5S|<e{d{MXS%s$t3**x0c-G8-_Y~pbP
zKVXkiXzu@7KPW7xN~R7m_8<L}#DB{+lhxwy-UGm$=CXIE#R%$QZ~)esC%^Cav*E?$
z5;K&JFFw4RYpJB>JhH3YoILzne6W2$4q)XTE&BMkKXl$zm?~O?oxatA%Yg);nZu4d
zG9&O+yfzD8Jp2&~=@(Tsz48*C!&WhD@f^;)tk!W?4TlSx{IS&nCANeT>zfN4em6Bm
zy#o!+=~Kl;cuSugPpxmv`4etw26Ed>6LS|tq&;4So12AlH^a*+-d{LUJMAaYJuJR%
zY~;hdDiGq+>ZW3g7crOiv9t5k-JFdlGq(qpu$o8SXV-I{fT62qLU;@}PlZ@bYL|)T
zadrMiTCLcv*f>+?@`c5P|Fc@Nia{Q5EkRyp{ZYNR<2G#arAnP&%hdy}Co~<F>MxD_
zi+XFj#-6$m?xgVQH%O7Ung=L$C#PC{6Y>7GtA`9N3)VLvcA2tEXyi+5^SyH#<nXDP
z&#^(SrRtugyQbqRWT>^_wp;W$nhqs%&N=Dop9U4pe(<zRFo|BUiw{UVo6`bs%rEiZ
zuY;>^X-e=L>&Q5L0jPvxhGvnP)0)!Nm+!w$zWm@C-1#^eJIEm-)hQ~PE|yF4x<rIk
zGp(1!RVl6}+)#N|Lj5ZQTT7efsFl+%0YTR^6>Lp^;Irp{hK{r$0Md+*HN}_;taEWJ
zI|^G*heA(49!(i3=z*iHC>ZDhq9|uzz_?7>;aD<8*r8lVEDc1Vo&?E|@G+gJD_$D&
zv4@%wav4VTF)Xvdn@O3*w#ft0p;nRa0*U1NZqX+-XacWIAJqsJpe$-sf^M9kH#E_#
zF1`y|`^)eI29dukXgW*wmj$UPRZa()6N8#`1D2UCVrw!<l-)6@745$a7XlH!Qxz*)
z00X~bl<I}A6Th^K!=#A^RjWvrh-yt&^I<Hp2xrwo$I@!D5Z}@r^gJ)-`&TN04DL|)
zXddzmPmgV70lT#))jN-H1n8@^hk`}i%-RE@&UN0wMaiCO|5WvsSZ`NJ`BWo`NTusl
z-tX7<E7C^9YVwfoqQAbHwH8zjY%Otui+}!<o?EW9%lVhI>OMvoZW?c$P!rpK%Q^Lt
zTenW@@y`Cq?*7i+C(NvS%daxIH8R{iNGROF64LZAugRm<aGEYm58qeIpjU4M%c@jR
zwU3%JamT_RzdzdL*`0JpZ0divk<_~m!l&#Zfr_ucpJ^t#kEsyZMKg1C+k1k%>vtQK
zAGy=>3Q*lJJ2TgQg2GJV#~e3|&isvzm<0}YkY+x~10s*kJ~@XH@wwl&3Q5hy;Qor#
zcKj*S#vY9Cg}=H$COW@bLISO{*BiIau3Id;4X)+acXNp1f6(&RFe1nev+5*wu2ynR
zlD)h>9NWiA*9on&r%Cdc@Av=mj-^)iKvS#xiGVGV9F05XH{{QGZ6!(W-OzFJW#0Rm
zWs`Qh4Kao<Zlw&SBiLU=MsB3IySAaDyEP=UG`AHZbZ+KL()Rj2ry205qCQB8S-q{k
zLpL<#dvSX^CX7`G;7A2gZ;QicZm3n2CuFQrV}0s(ka`Pn!HEpgAKNLlz*icw+{@0v
zs~(|ukCIeE|K0q#3Rw;+nVpLokAp1oarZJuxpe@G86c~O+d<egVu(>)o?1=&sv!vQ
zRxcwNJP9{G$KRKhK&cTnm0DIwOMm~j*Bk%#X5-(E19c!|zz-)S@)Ge5<AagV?(Cm7
z*BZjXM#bq!;&D2NV(G!b#VW|GNq@%cGV3v05bz7+e0{ONF{YJ<Y~(QX+M{Ded3&fP
zxD_On*Ljtl0!53-X5AX{xRZG|Cg#QeP}DPErz18FsHbYj=VzAUEuhYy7Spcngqx}T
z0d0-eIAwJ1el~Fk;F_^b>=6(Gz^&_YrJ!?Geq$IqnH`-Z8Yh3*9iA6eny+@CGI<x!
z1e1er-i13v;s^u?7*)RCmx{9}x-K;CgX2F3m9H20rUlgcLeznhIy>J_<$2@!r*L$e
zcVL!ae*9uP9be@`U<k78J>|2vmA;F}W`^QVXjhqgChRxdDF3ToV>PFR#2nT3uX3yN
zo}4n$H=6-xJooSFg(M!Tf4)4`5-J+<#4fWL>amXtmqN7w*GM{{nLG0>)Yk-Lhr)CM
zWbhwXWK!k=&G3xNdWj!Y9;_csW!=mv)+@5o@F2<wt>Z&!<X!Ujzt>7A)rPw1P##YQ
zw6sA3^F$;@^G}oW>`HBQSDL^Q<X^Z{iMj@YDO%7e`V=WE=D@Tl%j_VmmlkVD(!Hy8
z#{acCQ`*-%Oi>NTWIg!J&YOdy?~=Wp&2N(Jos*rdlbvno!wa)?<eFL74HGkj{F=$`
zHb`)zey}2h&LJk>aIGHBqn{hJFgsgy$>X8*?WZ_<$Fi2d<(W(6Jvs4NGAJMU0DWa@
zaEJ++Md2>;)A#+7W8gSc0%5S6!TQC!I9P&3fQQ<M>m*JEPNecFS`zGjmf=Ac2NfH{
zX4Aencmk#UBub07Ax9}yZk!<&zP*>xiImmc9!zVs2a%7EMKOMT96M9FjfY<!X*PR^
z#u5hiGcSGSgtS$|Kj&Cl?XbX_Z}>uW+^*UurFW1#LKCIrgFTF@)`y4Oj}j4P>Pt;*
z9t|MX1y0-o!{9BbMp8<IJ>lMu{fjMl9aq>nIyyMo@RIN)^)2WxN)2?!`DjvZEYt~Q
ze1gzvQuq2AVGH)Kc+1}!&+{NTB(frj%oXg$l<A<^)3cH+lkl2$yT!Ptg4_?;xInfN
z+xpdw<nrc*z3PV6iPp?e&}cFveJs2>IN1KzWWNwmEYuwX7fQYOWl;->e+hc9ST4<i
z8wXAl9Y0V87LFIZ&ZxQ2G)~0yjZ*`Q1O@H4=!>mpTb~w4t3GQP^!NrREt8(>^lsKu
z4cB^n;r>VB6yLi;hx4e<o|KWvfR1EVl0`u*F-c{K=!t$kq!G)MA16N|qw}H+IcOQW
zVQaE*AF4m$dv?NJ00_6_7{zyV6#fL$a4GX+*^+6+-~iVszo6|$KttzQ{{Co~ti0n~
zY3U;U{i6$dQ5oOAIp}FMCz!e^y^_xC<s`-*C1+DE#?<A43s{?~Ekxg1ofz~BEruiH
zJ4F&aFHTu6M<mI4k?{9$PS5*}4O{RD-y<`rwlHa7BRZnQm7~m%+g|v~aN%7gP(|;O
z7tntP=Gghm_%FlIxf2SEs^0O9E7YGp8*m>+eYcNIe9fbZ-b2s-q4U$bSV=T?5j63m
z4>UU7#VkkftIQ@$f<q>TciJ)c@X_rLAI*RG5RBc^Recz~4cg8nZclx_AU=!7e`lqh
z=LICrZ6SVI9kLTfxl0O&%e&ib6LU7vVyqdTRf4V4jDGZ+A@6-iV>8EegkL%k7V$-c
z&^#)3PhqipQN)zjt{hVKOeAB~epInz{KSsYeidxZo?-yb3iYXSEzd<tw)<m?o~<*R
z2F<SDF5lEXw{~aOraknpHNsS6o^W^SnCi~gXjwzs|BthadGoYO2zwoc%wh2I0<$`W
z%XRZ8s=aoevCrG(8BYH*`U`CKNeCU#O+=lCPGZmjv!DW^YvsLmcnHMi07<IOd)l6j
zd*<kxZ@+*sB6%o}Yu5K?=xcd<UrBek;(Ry1RJ}X)*N;)2dT7QGX_7DZ=d{4KlZTq%
z?h>=r1tb8XmSL--MR3V5D11C&<jN2PhQ+K{3Q87M77Pkh8gH`p$(dskQDWE+&;x)_
z!!I{hD;k0lw^d5V4X4(-p^rYj!9&a}Bk$F!UJsIk=~#Og+e(haNj4t@S#EGOx@y=I
z^Yn+q>O13>YfW5o_GtZunxH}dx$*HBrE`vHcGr;wtWYB)6X~k!G~Z)hLOCR;9$+>H
zSzgwuu7_P|w;q0d1psKir|?v-_zLGj1_DpH_;A?jEY*tz0#f!?fL|ev*3o+D#<@^A
z6r!okd#7jDlF=u-7+-&?5TM&?H6(bOEt5qQ8qmYAVfz>^MLw${`hhw-)kD`o&4mgf
zVR+Yb9h5Y{9GPKjY|pbg(8s&4kW=8$s9abYSJ+@2%P5@;m@O$+mE-s<ms-mp!GTl-
zBq`7xmq({N%-#+)>`H2BvV{nyDzxeFYWUcqK67>e+HE{=R?u|fQ+6LHXY%+BG-xh0
zYBlY6eEO$D;ZhES=Bnr&d8BXL$4KpyU++K(0jA?fcvmYD*AzSEyJ8AGM3iC4t#R#4
zuJUdbN2Wd{qVA}Q24K0oH{ZyabJxZ6lzVhKDNgB>cz=o+R_nie*kF6r0%$ltbJn+T
z3(GOOZZ<VL<a^rn@J}W!FdAA!)|Xl!`d0Q4)`5pXw&}Y@l|6CFHx?$B;(+Sr;S!22
zuQy3A(tOyILXIhFWKsLt5;hW}c)P-sDUNot#cv*O9(n@>*UQ4|{5axda+hEfrc%GF
zO8=ZqOsCyB&=*6uCe4SI5w9eHzpFyJhD}saHVtn|vVsE-N*yk#d8VnS)k9Y4^w9Gn
z=Pyy77R)d=ZMi*eFGgl;v2}1Bo$;*Oc^L5+p+DW%HEyY&ySY_4_j}d4tMm}C+R-@s
zkP8&MzWnSuW;JSfmuGKgKs6{ibi;zXejiwxPhe0nDwyjj6FZo8ff6$e&CQlIvA^I}
zY!72U4;+MFjJ0rI(1g3OGRO7mGSRg^TQR7;Pm?a~h;nrQ3AhXQ&Mdz@tNflB<$3RC
zrj$F}^{ud2Pp<!_#K^OfjcV`RN`@)q)oF^8$m<ix?{N0;gVwV*t`1&x3Bi2&g|8e8
zh+6cJUH*_yj4Dma5l*Gf)Y;&1<(1z{zcH`xEP|)jAZYH)y@So|-ThZ^XKK7pRqU%T
zwsg0ki;DH6BHPX>SXs*k@5~bH2`M3W^Ao<_0JAB1y&(*Q_zV$gm>jHeN%3g@VaKp?
z^B8_>4BFp6zul(>|Jk_s^5=R764;+UeLS!J4?b1==anZb|B^iZTphUS^M5)1^G)k7
zfByV;+<*O_uCA{BzW%?)=l1pQtQa<8Yc$S_F~SY+2Mm8({jat4r<M9&YwM5Ke#d|R
zH9i_*v*2Q<NbB!Udl|mulNSGm<zCPV#tRC0)$L{@CYq#597z0~X63?tZR1vk5rUJG
zFx`z0l5EJrw7m{NizFYza?gD!fyT*NUQp^*C1bG}ZyoHv+<lcC@0`>$GAu}lt#~RK
z5B1=iSwz%|S=Y+<#4RG6xu^vNymO~$M880<BGl5KYNj}a-@jK3WF=8xqqs`q@a?;g
zVQsZjGX~`0&mF_&jU!+UuPg?cg#5GSL7Fn7wkDjpn=H~xml7`dmX^>8OR2&N#p?{l
zFNTHAe%|7wYiFz7-(YO=-g^!&SY+PDg8c4WW}-4^f0}sBFcV_w6;tkU7=h<CJFm}m
zR#@pj6(8Mcaeg|sN?Jb--S<<g_HL6C@)Q^Rz;|aFT=uZ$Y3pej7O`>UYweVALmpku
z`w^`j@3FZ{4&DQ{ilX85mE>dccx7c!CSN71D<zx`mg;(nG@jGLoul1@ZMxc7iE*^p
zB#{k$%!Q`KxlGxkox{D|t<B>g4=!q;#&NX{w^dzb+WWkOd2!98M~%)6&K4>^u3gGB
zxf&OUSe==F^MX|N0|UV?x>c_w1q6Cs6v%MThD%74aAY)-3|X6=WYi1uj<$a4H{_4*
zP)dTc!gV7i<KwzL{nbPNAV3@Z!?je*F*yMo#O=w)w;iDo<!Y*4O-C#J6prv<W)APb
z7#Dm?HKC^YOy|Qn`PZ)&(te+VYaiweR2Iw^&9)W~os(#0=U2b)DGP3X*Pq7Rh4xdI
zEZ~4lxF2_E6V`LbavC@A!S$evp7pNA&4P#Dv%4f^B&&@Y_E%}o%#AbeWjk{KewQH!
zE9%6&A+7$}vmQ;)J!by57PJ3hKey|DE6-bLx8Ks*L7!3+>=ylRb^YmTMgLn}Ut9fM
z|NAvQje977;_{xBbapS`cYIrLRiVoAsu=fhxO7Q8T4=Z^wCU)S2q?npyIIDP9M;q9
zzkq4=<H0vSnb@+qwTCn3?eWeLEZW?YuO9|4|HB_Sz$*a4xl>!c>^w!pX>ooYK%dKf
zTYI}CEF}zS8QpyR&F<lwolx7H|E{+uuU&_O{#LPlCs{g1z4>2azT6n+PEIF!ZhL1h
zoadQ&aUx_O3%GO!p^=6AJc2oiQpQB4S|n`-aWVO1iK8N?Bko;Pv}wURT7=dbGlR3q
zrvY}jfp1?QY`)oj=U-IUImr_SI9rPj&el2UOkHHMb9#9x9>Upfgs#7<>`{<OW@7N!
zxOmSfv*{#5h6i_-U2TsI>s9qobl3OnoB#9n;OOleC#-X(csN+|?Cl@Oop9~pmY+#S
zx39IMlAqTW6G6=eshgq7kPp83;wM?&`SbOzN>}RcUrJ7B=Ox&B^QkM`oM`8_=G>p>
zbBFW)S<CSB7$ooh62L9z|JswMkE`eZ)77WHpZ~wc$AyZEf@!k#X+BDR1R78E5USTh
zMJudSGY_@G7Pa>f?Nv@ZyxH+1tF`hzyXMoJ&5w6J1uLjRL1!LXgAcjInl7Y4@Kbr}
z;3I#uZ+GrQU64p<kkHxz)@~5PcJl<+wL3O|vHC^>RyWS{1l_WD_Yhfe7|a?Y7TWNM
zqX$Q;tAp7ux@jL@7c`te!o(^OmZb}tnKQXsK*8NMOMulos)RysF8Uub$DY^)F!ydp
zit+6<P4^IinPQ}vwi`)kF1k0tKv>{h0<pgqJ|-C9YtfS86TuS5;p*}=D(CB~os-s^
z&Eu1uqt@p3_EGD_cdh+R5?I|~i2O@OG&7+;5dwd33QMPtLZv+JH%UslC!*P+P0AYX
zV2Z3UbXCXhQ&X+ke00;OYDeZbq5l@;GIjzn(c^2$qWeWEy#T1W=R`duD2klNSLRcW
z(YiLUotF}lI!m<JuT0Y8L9%-&D}Z$5`w+e=Eh0iCKYl;IUqRJd0E#3x-MX<sH+jq_
zb0LfY&;+y1wS>mHs$N!e^(^Z$k};=gaAJ6OI!5vK{xx!PE>ks_l?LgnNk6rc+?`k)
z&08I33o88n2Fyzr<?c)P(`PvU?;!s@X?5TK*R&W<2cK9F{x<th=kb%O{I|0DyZ`@J
z`8-HYveKs^%<4{xN^qZ35?g9G9h`bgbXbaEHWBrmi!HF1%861Y2jB4C^{%^gz?iVb
zxkEpg2{gD(y;YzzQW%qmaWALLbH7-aRaIvd$%>5S?&xIzsVfuNFo|L-amEjIF6)JC
z2jz}W^+wCCk9xGcid1{PA9xO~KhT-2E6Gg_xW_F-IBI5gSaS>t3*Mk0pmKNX(!*eY
zH%t{=hMWYSPA8Z2$PaQV{CZQ@G5XPzc+H4M@?`KHmk1xq6mf=@J7cU%dGd$Ex>0Y%
z`0W?wlgB=jA9Bm^|Hs%&{wIBIKmP$ln~i@?9O%8{KUY~?_&xsfSNPn0{XOoMU`*Xz
z7`$cu*H_o7{=fAno!|X`zsl#qzb;S9@$y+dT+W6c5?a&pQnQu;tj5q|{-hSbI{6hf
z1%2dzL6#wbHboXcQc)ZTBpL+J!9@Ys2F|FJHs>^Xl>vrzlnuqn&k3^9Bt+2%90tG|
zA6=i05)M6;!f;u4ajD5cL7a0wzx8~0Nt*103!1pJ-wOmj>YJ`E^X_H%Y7}4L<SmZP
z;{qn_<OCsd+-#HDrMCJ-@g99*RN`b*OvGEn6C}bc{Y+hz0~|=V$m>N&9tvtoF(4T-
zH5T^AO{QX*AYU07%F$I193a1+auvkWQJjtB>US<I<NoD`xM3M)iYa0+#tT7GQ8Aoo
zR#DnR0Z)}DB`^297eE`2vkN-+lOO*wJUq;M8-FSPu=tnWAC`XN;@sTGX)>zTDzs#z
zkuQ(O|7hN>fwdI^qoiX+P?Dy%Qm4x60VlrcO$?sJt5eCwJ@3tC=z0p}G<`)L(j<Ke
zmLUpal^-|~zzRFdC*zdX&``KQQ91hr&k^Z{{O||Kw@BsVU=@w`#Pl`MKsFdn+{0}2
z!vtg@!pwP($HU7;y$->vqD*VOPf|GX0{$~v)AQakEz*L>kMEM2nRhPNa5bc515_JM
zKXSk*D|SU00tLToNNFu8A<DP9z*mVi<HA|e1{jJ&kvPCTMed^)iFJ<`Pq77wA1wkX
zb!YqZ<@WLE%iX=5rFU`TZ}O6J<tw-0(R^GCQLHKXkdAY#!ps{Lg_dUz@KQCe<9mXg
z^nGP#eGhVe$9Dx=wf5GB{<}O7ppO116AjJ*N&LJQGAe=H>|cA1CH#uiaoZ4%-O=x;
z&jd~zaE?Xd>Pro?zhd(<Txtusyk*kzxSmQnW!66@%2`Ohc;_sdyB9;jMD5W@At<`|
z$5aj}kE_s)fB$=;-#fwg)sXn2=)|D#t&w!F4HnRy1<!i)RebHMYTeqpcG(!2OaI-}
zGL88PufcRRlW++Hm7ed`#!&RiPyM1Z2rDaDYI}|tjN)OHJ}@4R+0+~U{`bcJ6FpG9
z_g~$;w++}5%L57%oGq+`w(-uOJ&WG7YbJaN3#YDMWm*!MVOASbHONdjzS(!l*FLj6
zI#?ds##*=vOK713QUoMuMUW0F$I9<nslU$WcKP3#`9Ap__t*bAD{H^!fBq_;d#t}f
z6otm#JH6u;`+ukNxElYl{`Bek@A}`b@lhX|U)!bRB_riK&l9|jgOT`ouONTeCFbv3
z&gT<N@CV<_n%ZCPy*+*{p<!{ULcFb$%sL<JU5q0$^TcWhaI)Y_$uUTc|A8M~c$dV_
zUv}&?lb4SxJ-S>CudjyJ4MT}*Gd@I1n5fQ-Kib3uzG;<jTCH_jtE)D4e={&|NB&uj
zvx9C)(5Z&Ws0tzLD<yOQR(1*e-&?Y1!gKqwGyBtOl9&Pbw<h-AKQo_u@c&QX{PMXi
z|9f?%%Kz7%tapCr|G&lu_?sN1Vs1AHz-YCS0YW0AN(VzB3Mi9MgBU(gA}NLntHyxM
z1hGpAlWN(95Hj-?B+HO#-hzuZ3tDKOdDUZTi^tqpIA+EN=DKi8bditFlS9{l+7yw^
z&7d8vbEE8L8)8I50H3MTk7k*4d$t)k_voEZY!`=KiPd^@@FyQi77R*)KM@S0;HFyI
z9rf)kibm?Xwt$Bob-fk}xD2s?wXyI8f9SlMovquUd(A}|H}w<LVlI#7^3ql+^XuXc
z*h(miHYn&)!3VQ-K6F;!Jr2U2sCc&PyxMn+hjmN#=3syK<lxBrf~%;$Hz4^2X?pdD
zz;}CAAZ8y1e&?U=HWU}9R*CV|k@$c?DN8tS3L;lHLit<ljBgEq_^2iSlGT*}?d+xo
zENr2r7<T;R-5w=r8nx8>Ex-_$VU6ZnE6xO_SGIn|CfB>Xd|1Fz-DPgyQU?!-)lRa$
z$=`S9mk734%Q9p>`91U4WxNXk^XilQ;|+K#aoq_3nu)xg7v2_U`;!1L`XSXx=9RR0
zj;2pxd8`{+y9!)!)BJEIt~w#o>7;1UrtEUK4dbBC9trp7Sf6o<J!*cHeen#3TYWlc
z@d#Y;TEpXZe;Y3MEwjGKws@L60B-~d1U&!hrsPZUgngbxkdx;ZAlCcMWB_O$9f_ZH
z{<z7yY5T2(;Qxz1_p$$l#*+KI;}-pI<#A_5|9iapyZ-m9d>%l!Le=PjOGDu_NC{Is
z%cN`{X&<9vSmqxDC3$tFY`A?sPmrQ>MB5a>=s}P#o1toh@B^T#r;G#ao2<x3K}&$y
zH`w&`fmLecA#gQX3njhc2o9jl_*Q2GwxHd0?P4Iw(^dbh{vJHiSy2SxH9QI=jDO1T
z#yiCSugmE`=WIV?JmUMN0o=C#*E%!!f2-?{f8YPV#z*7-Wh=TBPSXAb!2B);Z66HA
zb-5L445Wclew`({mOAKa#489)OHxjA!3R_=o_=z>lNuw@AH@(6_wpcF)mG9$p%^tD
zlwTfi@~>bTEDN7y6R`-KbI>w1mv`Tzt>1b&|LHz=*#9f7v$V`UG4}_bTlW9c$4{!~
ze`n?C@A03%%E#9l$P!xSyc-#_P^{86Z8sgIXQ(!xBlm88Hc*|Lc;P-dwrT?@^TD(a
zD;|de#z<?-kN7K_rqRa`L`}76ZJ;N?gfq}0FL=0KWGKe(OBi6hqHWSplzGzcNfoB=
zrMRTGZ+Y__65W$HrQ_CY+#tCF!8Tg%lw0bEUS@9=y(!K-soL5;w>J67ImR6cT(Z93
zOP>V0cP5cu-qWfr-Hhc>cbE*%XJA$>nz3S>ubrizwP3NW`1^SkyX3{yRSn=s_OmOa
zIgO9vdw$&b>0L4|`k90adqaUEl%w6y!irnDx~t+A{uGe=rWQd{D~6rQSIMYAdFM&t
z>Y~&e&~66s{nrqEP~iJ|we>OYOmj?k7+!9kj8j*mtU8nTaeYf6;N5L*m;=du5kL;q
z<vj9<N*cj@+|{FlK;qE-@_|TrO8U%o!jAqx3qsXFQhvlPq8+|RJ-R#1%ABHf2fl;4
ztD;VcJct5&mGKATJlH<?cHiom80aj|8kDR3WKj(Lp&d-~I`3@my2->G`AEFc?+>oZ
zuI<l%5{|9mr5-!VaX4drmmJp#G56Q(_U&BMQN+tYz^^5WLHakr2v0A@S%&cJ&q)fg
zXG!OCYn+ys{>4F&<<eeUQwjNDCGW9!hosMkaR!4HIpji?0%xEb>6a!3?fY*^5;pmQ
z%CKQi1grolFltl@JR6_7B=d7o{i@88sT29Gf>N+jG4!k~`Y0>*%MfZzf<Mhv1iWRM
zBxmTi^B6$nYK=24vh|LZrn3^cKJP8tDZ2<XkHC*NbI{&-|NJih{-evkO7~XodO(7&
zNEL3|ky6@yFLf=)pig7u?a#Lvqf_Hok;s2*r9b%G!T!@>*uU0v)B{}QFM$8MwmyUZ
zyY~2Z`_HfPQTwlBGcht#7fv4{+hO-wJwm9@&787KF0-`Xz889$?5uC43bHr6aD`{<
zKqu)!VynP?`~!&akv!?UTXPzf{^Dmd)dYI>Oi1JXRO-)ul+8WP{E-#~w%qX~^XJ$<
z-?`?EF1%?1;^vHBt^M6(j6aRQXWM}A*j_d0vyQUvyzs$-cYf}2&oL$(xoYP35m)~2
zJ8b^}KX*9)*IHvb`tm`h;e7WN0dDjEuFUv<);cS{=YRbwA3gtdg{zR}hW-{w(7$_G
z{|9~Uu>T*ohy<o2>wT&R_%`|f@sq0j-}$}%$FKC!{Vyx*PU%mO>fgjIh;8j3O@_y<
zE{Z#N$;-{%y@NjmHm;x84|E;1%@D)auDsvxCZ>NBA^Ugd>F>_de;()QZ_V-J&mGSH
zr!5ZgbyIrZ^xxag|MjOc=l|N;%J1>tzsg6?f4{g=R~ATR&gzhtVhHSIy3Nlr4vV@M
zCbYjZOafCpu;p$)kBW??eL8^Lsp=9TXR=6_SO2j3(>qB*mYRW<?l~R#<m0=sg~<Ok
z(}np-hv)tDqU3{PA=>QqyhF=9@I$Vo;opb~lSlIOqkvb`jEkf5?>RCBjS$$4FVMml
zl@!jOIrtm7r7v*77-jUp1uRAI^UN56#JVcpKku=R+@Yf}9|}%7DHXh2Bb0-a_p|%;
zeH91`eW8h^(ToMAa###ok}1In@`lQ$_H4JGtcQJ)L-LDZ{fys3{^QyOPV%en0{IbH
zqi*Y!<L<KXecE<O>r(1vB&|{MkOi(Ezxe5UzD}1<C;if@5L7nr!n>rGolP(3yvwo?
z(OvR&vfRr)EDxt7E&Y2<Z<uM+cJh{){Rf!BIwStdO=Fy6rLKGC_6d+1iDC3mOCx8{
zLz6U|TwB}kBa(IaHrhw7zD2UO{`kq$n|dEUHY}hgd|JPe=jddkU@AyXw0d|PoqO{j
z9OQd1AA3y+ee~9I042UN!OcBTLKK_#1TMNq#0`xX5R+M!*yp^TG4?0@vM?Ep76iD}
zVsi2z{J8CAEhs#N#+GX@ocX2)qq;k|-wP60v7!MMD+}(<vkTmC+X7bGd+4TQUT+`T
zEZ@@W-gGc(k9%jgcSvZ2F&L*@&E6unxmqJ9#P-WVellz07%w6EXsU=$k_T!6pPwU@
zw1^_KFAC5RABqykQv&($@L>NHQycJM>4C%D{a5qpR3045$Z#uqg(hyK$s1Wt6lfqV
zw`_F$1~h-u^8L)#cWYbcwTR`vJIMd5njQS9=Kovqe`fLDR-dl^ZvXpLK0f~=otRxi
zu--zQ7Aczjlyk1wO(0nk*L<go2;f{U+NZBGE_^yKRZL$p$8e%y1}5Bv*<rzpW*P|^
zuvD~}-ceKZNw3mtVqfDZT~wG3V;@(?dcOz<7T8x-r4qSx(#nvtaP9>6>8MX)EIh(q
z{!|foW<9)Bg+YAcXwrp>ttK$4-DGWbBKnO6D*KqB>Z{OD^-~N!TfP5#Z_6tcw#b((
ze0Rgc_cC(fvpCPv^)UEhDf#z*ztht|$2}D+bg>3bM?WpiJUQ1+#*-S@%ETCi_H)0I
zOng{NPEoG4k?~7zx0)Hjv4ng|bbRWF`YyB<s9Uo8AoUcW_SEf;ItshZm>=Hz$@XFU
z+{3tUpF4!yxW&57gm0gF)8#J{YQsx^JN5l66Tf@U90J7WZc#Y)`7DI+GaUx;IC%Ta
zXVs0`O?A@)DqwQdzuKi|6xO@>18!rpm<I)d6I3%`ga;E|OZ~z1GwQ_qXc9hYq%K_D
zQ4vaT45P@sd`KMXf@r0*m?c3*edsTQCYZ`2KBoLmyOfU|wq$7ufm<Wl9VP_V=&VIv
z6+@Bh(~T_IFJd@45ow55%y>I0sDBEGF%+RG2?Yn_t*CT{*#CCBJvT^9*SkU>qJ`}j
zSDfr1^+~lF2ETQj!F6V__fBk*Q!9`KVSJ;8^jWv^=kzR0H0_({=C>AhfB(#UZqon8
z(|bdG)P8Q!|2k_=D)=9rr)y7tumAq5d>(k&K&&#;e3G@3tzvX76*m{RmXg(#&U$j3
z_CKT(!0jBT#0~oSXjBldn&ji`hd*8nU<2!N`4OocRh&<*pnx&|fFy!aO>`hj9@C5C
z?PM?SX2X(RcAQDAovnkz?_j-P$U|cIjK{;JngA8TEQGYNu5d?Br>38gdghA*14K}L
zNmby{$I1UnNJ}lCF%GYTGQn43qDmoTd~EB}lYR-qnA*PSFVpg9#DP9X471EmixK<K
z8txpJ1Lasf^6IP4B(sl)p%<g{YFOv42!Q$k+#xbi4FIdu1o2Sdy=-``K#iqCZX{`O
z;ax4vLj;{(*CRcLHa0}qxv4L5kWGhta>(>)L1(pM_4JAs3Q{OWUV<#H34}^MFevX5
z(abi4;y<0=gM$6%M*H7j^fRhH`VWJ=+^7CW=gE^Nzt{ixRX(?^fBS;OK(3wi>F>BT
z{(E(8rvB&p@Abcbm5=b|FC5Yxef_Pw^!w*m{M79K&&BrL=l=Zv@ygoM-}(Qq@tL#!
zpM&kY&#nA_WwomR(f|L>|9_3o@9h5n?oYJ;KkKgdpWF8T)Ah9({{Qs%_}^dU)Bd7e
zUX2=Gv<v#*NBpP6e|q%4esR%oaXvyPXW6iOIY`Iv^>4N#x6<M~`rF?xf1?rmp`YtF
zXT7mM$8b9Iif(IC6#cTHMxzEI$d*Yy<(NhOseRdy0;i}}+Q!R|UmqNuoSy6)y*WKO
z*gk0Z8}Zm=oDR$LY}_v8Z!v6?^5S-{Y`AzxsUe3yhea>bKYQ7zT<%X(4x6NZXMX5b
ze#y`1YddY|Y1%KT`)x#xwdmi`I2&jGHO<SME@PsPzkAaF%oD6TZEC2|{!n)5?RY5f
zWhwscc4<QRzpZXcb4tIVCLcX<s$oB6`)_42Y}hDzS&Q?pMrk*@nZZZ<e`Te0w6nLf
zdAzfKaI$m!xoGUh{okS8zBVKO(I3C>|6k)HK?+aWt7fHzdzdKmtNKr)(fZ7v#@o@w
zIPGQ0bbP@$BOI$xZZsNu2j6apiF6+UK9YJcwY!IXI0ysC>Fg>w&(g_soR!ISF-@*g
z2@RSOBWS!i*xotXJlWYm#bat=fCL9?%c{aN3u<!Qc0PF|;p*J0NxSiS_tk6Z%?ZCU
zM_^)iOy^}c?I(zW=7^m^3ZN8@Q%sX`dd9I5=jg+@Y$rO@e{F0X?VjvzZSHN%ZA}`1
zJMPWF@k#Rbc<1QYHIQr`ZyvTA$2(hZsiE(z6-+~!b*CIQf1ZCtHF_y;Z4B}AuiiXD
z`Q%T-QDpl`a%7%^H^neHph;a%I;$HiEA;=#?)FKty0Y5&{5`0W<VIpM-DF>Unh#5z
zUjS3tjOS%J1vGNw*nWA5do~(hB#T>r+G(M)t@X~z^XE&+?r@S_h{OCcOGmWiwBF+c
zuGI5>ag|&WPv;2fZZ^jI5=r4`Bo-rEvYU9AO~B`qQF`4k(q7q==(o|hm=vu+`muF3
z?Z0pJGj`)jj&J`u$l0Uz5P-{>3%%?-o%Scqg!(|cFr~34AJYCbOTHJ_PKoHg&abEG
zFdM&XN8?&sefnhe_HpqXfhv9e0ga=PB(YGy?i37Px-p=B<vbSgiPOXrJxEQSeow=e
zm>*zv3PjM3`soB-qcZOOo4h+N;G0VRH0{$U1kw5$<@d65+`XI`)stsWZyyzhvFF1H
z?RH&)2K#k*3FP+{s_>!X^$T(1GEieR3vrlU(L{ZlXWbu&1oG@E@BYwCHorZd9mCVd
zOUZUN%!#)gAe(0VA@636R8X}ZbA7aPe3(EufgjK)ipNGBNOdWO)4`e4;-jqzfHqzV
zcBIj0hEhJDob3V8#u2SjF_0M?XDR2%2tDxp?M+kaB=J7XbU0Fa`<pBuC&!m0@r=_v
z8_te!_1Qi4)DQUxt}j{=NJ^l-UOGv+G^OnzTNx?o$3t(1%cBbdCuKqnmzTWMzF}VL
z=Ij-IteN~^#8G*I8Y{-LS8G<koDO?uHS=%>Y7OR`xJs4|Jk7?#j>s`&2#EQq;W4t4
zwe%a2(fGP0?{4+;K|Z<L0G=!*$D^#9%LW-EcBaR)p`J-TV(E;>BJdbq`!QnrY?Se~
zpP`?|i|K{&a2(wE@I%r6kR@l?W%?nf@k#At=H9P%4!%f^PY#ZDG+|{hB9@_E=l9ul
z(xbgF;g&M`UJ?tFpdDNbLW@_D#Rtz<pK?{Q!*NEhnU*w2q>*r>^rgh%;9dk>5A{Xq
zcuYg?=kLW!j#ZJ)d`QQ63gP67<nZl_<F_x8{kLxpH%}aslq77oV@Dj-OlQ|P<urC0
z_%OH(afRoY(?HSHmFMUx`}5PTreSMMXz*~H(JL%2U8N<@e7`8(bJu%GK`V~g=P=hm
z1`+vkb^%f@3Pdj;-3|dmS}kp)^JI^g=&2JCusU?eCR=;EJNqZe;U>vRO-NfjeaIuX
zT0h(k*BIZ3A+A4tx>VB!MweRrm9EY}<;_Z17FQraOY6_j(q^wG2NUV7%vISLjXI$d
z+R1sBMY7%fmj{~mM8ES~uMr1pG!A%O&TM9EcsVhu@fbp-Kv2*WY#qFLv$?<RQf5GE
zqoULtUTn}eyRRVex;xOv$B%8aqCuadz>?(PT&34#axqOwS)OFH#rcZXSK_xe!RX(l
z-GgIZ-<RVoLlnp2d)n#KY>C_NJhApMQ5xJ#=eksZvp6<tnS&Wl#~>y8yPRZ$ge2d7
zGmv|=LJWrzV1lr38nj3W+XpZ;--1(nK|*6%dn6rylW4`N3>a&OdPOZdJ^(mvYw^Le
z=W8p}-tK_-*atbtHgx$=GXjc;tND};MtwalG0i9n!5hApe8_P){BWIQA4mCE`q^QM
zI!;km`3K+%kH^!IJ5ZB6c%v+Qr<u?{Bo)$Q+uX2je0o_auf>ymL~p;4=ospjJI+#^
z+{_SyrCxphl$%|rW`9W;{jrzPzoq~E$F!fUc9PDMjkVQ{&hvj%AzfJx(^?~)60r^^
zoMF+^<0}+qK=*5_tuvw<q#Lt*lbAv&h#*%vl&gm9RXKhAaXU<2?4G>b-Pzl&X{jPY
zcb3|X&Eae#U<uTa%)36DtdiDFgg}}vmuDFwFP{jpU*s6bwA5hEhI_ry2Th2PCH5&x
z3HW_Pta&(*qc=Qa$Jv0cB#@RGNF|<XDAqmB&@KL|{EKU3gGc@6;lbgX%|9={+1-~n
zNn{d6O2X)xWcHL8jU0m5x6d#~N%AcnIWoi)Ipve^nAGQ2!xX?YZi(;v&!f%#S360s
z$XH^<@>M$cn(o+^$-@NUf$cXtZ(i&iMf|{+J#D<s(`PgN<Ai8=Z`h;gfS=O=>7oiB
zcw-=T#4lcX_PqMy8VN#&9CU-E5<W21R1k?4OP}$a4(IOM-ILeHTlAu11B$tz^YH^h
z0N>IXEFvDuOlQ=|vRepm?U0J8)5HPmnk=R#_uG9ryEOp}Dh3T}clp3_Sg9}B5FKU?
zxw77|#{PVAwEG5I>Cc<n+p3N1zS)(I2(On&L{s8ea>8thV9TvNv)0b0dA}D**#~sg
z9v|-|opz@!GT_?UoWmZe8#{mA*>YQzR;3H6iKGw)G3wdM%ZbAy={#SzcOP?Ib{MW`
zO=v%+{Tzs*ES2(;i{EaZY`vBk^KsgJPjs>*Gd9Rr5KQ}+xND1`M{n1C^Sk>eJ4Zqy
z`VyTU_X2L~BAZNv^hE|>au!JlbG7D{(HLAElf~Fy?VJ$zY9iy6|E2#hiSW0>gX1QT
z#4$LY3|>|}*b^eSgQM?~x5t}A^~F#%9ywZ>qIhh`{65(_q@S}9C*9)Ke0WCOsORd>
zpH0i?Sm1?Rv5^p^zh@JKNsV@9Gc1x6`(+^%XLxxjc`Dd}H1kDoO1o(D?Vm*v<xxDh
zhG~_Uqv^qfWN5c^e5)6_R9{TAWV4{j^3<N?7o=nMXio>0k;MnAE6-M{Qk55|Y~Uoa
zpu0wr*c3|LytoxXv&kvg=p5pCLr!zFbGWy;wZmL|oh8u#g#un9<ugn|!on6>oO6Fg
zXLlwj@I6TL81~u|2soX!N<)e$!^~3-5eVo^fHa9)$A4mqIokX-p@v4>*3-2$2;Xmb
z8F&uf=!zWfayv%OmU(G2!3pCuny1elK_9(2J!Vtg$#^;xBrJ@E&S<s5fdP;#`>djN
zyxo7Xcd+%1@HGZ&k>0q{DW=FkOlC}crrxK&taP{TrMnYa@Bf$%v!oN4V2^(b>2B+@
zN_Y1Z<&IB|Huqi~Bzs%O6~hJ5;hiP7Cv*<nMRE(@_IZUj(dyanpf`&|0#y_04w8*=
zmR%=qkgL#^KeOT<9^>f@4`q$<90u<0rJSh=-8g`Gg-^a`&!4+9yyBqNmg)KFP+0<&
zUtGWZDA?vag<Bq`WqZ57x4Zuhnn{DBLnhXgKwx7{2f(5j7t@h6E+<@YTyC&xY2q4=
zANXd`hG5(&n?SOrxuaOnE9D>-p7~tPDzTAo2>UqLf4TdL5g}lc70c8_3mD6dEqI??
zRBvmPmSr>%kC_+k3?=VZcZf1awH>m>Tx1>XCyt==^Sp}|p0PMnRi$6!pxS(U@;bpA
zuZnSxPxPu;g3rW~c1pjv;Km;R!W!#Z>{WV0r`cN4dHz3&rR^Pj8*#JUTR53B9K@S_
zY2#B_8e7a}nOZ|MjGx8S*m(q&)&NUOB9@lbcUEOt81+aIbMmDzqy{HYIy@p8$($);
zfyNOojaH1}>iMb6-m|;R9vtsAlQm~L8h7CF)d~3!`MFd@FB`0yTehb;HRiaiVn}dx
zVRVTZij3coS>U8(;*CtHS~!H~*k*tq6u+fA;o>Qs6ph~0urBh+r>|&YE85`cS#3XQ
zDz0HZ(fJOiFSXgGsfTz@E4%&n&7s-sng-?82v+ElnEl12^ndZ{GVflx<a*)QYCEMB
z{+wDgcs^-r1$={9`W`bNlHzuDK29%Q^^3E#UkW2#TdH}0`FF1n=jspF#DBAlWm{n*
zPP35W-Dqc(&$1W&f`rbLl%V{Bvw@e&zE$9N>nJ3EX;$n8{3?g4WQC#KCvz;`Z&}?P
z6f~8^kWQE`zZqMCvzD>%yg$gv#b~j!8tDQX$#x+@93=uqXd+5#Dbq9TDoZX30Ska>
zT`VA`@(i$((B#vVSTj%=|5Y~Gl3VxbPUM;`F4?Z7#`-YEkGT4<0A@g$zbhro0?V`Y
zC%^3Jwi=&qo1<~wr_=4XIp7d9(?lZVbuoQ3&UD*vZtV$gpPnt3)3c_@Fh@Jz(rLKU
zr0v%zS?+K!DWNZ5oN-<~Gq^H?wUL-Yw8KCl{x0ScciUJmUL9}#i8`=(@bc)}rn>ID
zBnl~ok;Zz{Oz1IZMgrlI_1)rItnrg|=VcK+pY{xGzM>eZX(}HWvM~$bXRO{8)cLV!
zlTVzz#TYXrxF&NzXu=cmwSt9Za;>E1d2VS=X-e7f%3&0cmUR};@~UGAY7!e~qFM_Z
zG<)G+f#vpBe-Cj=Zk;C5dZf1~Pe<DwXR*MRb4Myf=l+N!PXtB|re)u0w7Z8Np74Bm
zuapWq+#8Z6N9l#kJVyKG?cT}mG8@Mn)8jWkfyX5wxtOLW?OPk^n2k4T^o7<eM~@f=
zlQKQ$nvaw0<D~q2>>0FuNOXPd7oiMR!8>iv*|GG2W~E>YXEsd7c_GFGxBOW;=7auk
z-g$QT_Ql@r@oSh>AYb#Ow0KfD%r%u8shP)Xt{Kxhj!7)sJ9x$BC`jYz!x@+>D=`{Y
zgb5YxWwVdd_GkyXg>iNT&SHu-hdiEGb&Jo=Pcij5H*}^jw`|?ddSZu5^--4hUxWt$
zG^Nxr_Cbb;%*%o9Ydv_%$+XMI-}#i57S2lEI^6R^32I4R@9gazxV~e@8E!?mu@I#J
zji$0$o~-d^*^+Y+RHeZnuz8KAL&nO`L&(cCX)?-387(o1NH|`441hV51BSPWXAbi0
zd#(~&aKQw@Ld5jw+%h%d`1<PzB>Y$I*b}Gpa&!n3cJR7ZFB?rR**s@IiPajx%wn?U
z&||S0KU?cmbZ1!49DNe0@vr5^@^bR_XpeeynW?pF<*`f*pMRvryw68;ywVuyjp_JW
z&uNi~(3=pk7r2?;8w@&q7Pp4}KsK$Gq!8X|##IJPwxUx^MV(pQI4n~txOL}w#-cV$
zW-izaP@u$o8F59t#@w+dPiLES6^)&F0sRvrfT~{!qAZAw%D#{`*u&l1Kw~|PA%Jlh
zD@6MuKerQx$LIqO7&`&RczEc$U0U9X0s7fGLNpp%O5t^mxBuMS-ritaj#z8Ozr-)v
z-QPNrU<qcpuTGZtPITFfEugPrMi$~_PP;1s9|6=cKR;n%o%8~j0N@<wSfMD^B=1v?
z{=E72<X~%WbN7w(%S}34%Gv89n1CN?V|}3MW%iphw7ynTF4>Vl=h@>hmd1}?x;L3R
zJe$5DVaf1t-5ecd7i_v$)3N_}dwjCH9b!(q;W6lF22a8GTHzG9Kg4qzC`X}3r{X~v
zQ&Z`(m4dUjbd_6!{KA)8^iNTPk5^@L;90wyI!mwXI%Af<n>N9k3qc92;G=$;^Esz7
zJ_|%Ad&f@L<z4u+?okWVBXMqg&FT?pcnClc4hhH5jNON~Nv*ubuJEJ7gG1~aJ2qFi
zrDuG8Y<?)P%sqam*@R3BMSpb261$cS5$;0Dh&oMZ5bL4q$8$A=Or7OJ@FqU@)j;N$
z9q)Gbq8!j<4iL7nwfB~xqUg*#Io3^s+r(-3S|Uk^7E-}Xl5iOb>EV3|X{Z6cKzNSG
z9<&VOq8uro2sSBP2BYNP5(cvlK^}oO_x_Zov&-B}85naG=Rr6+J~j=H@1dq$a1L&C
zE-G36Q^d*8KcwiN=EKo+vMjc~Q?>QcB0b^&CGkugKT@tlr<Bo8k3=(>aMua-HAWzc
zkd;sARO|x77NB`ddECcPtj5Lxoi`5EGsSa7hgrY42365U>5HYyPZ(ZlgZ#3y+E%Zt
zkmbr+th2G@HAUdBc!fY0a`_YlM*m|=h$J3R3+t=vPi!}YH<Qx0c~<U7sLyhA={UT^
z<g~uzBpLPZIiEhPBx3%Jm_O#>@pE%W>O;iYy2cxL4+B46WK&4N3JcESiaXAy!)eJp
zGwk7RNm`8xGw^Gnlh2=2MMRb)3ol+rLbyX_rM1}k)8?KxH3|3ea%=A*Yq8r}4>TQ2
z*JLT`qMa}-z(4zCmEum-<U3B_#(KK(xU;eL<X2URNdzZd^|ep>U`g!~yzE29@*G4j
zrF4nO@CZtLcdFsy9DUhr02Pl<Hbds&^X~A-0y{;Y=^+#%pEOB4=j0gpoGzHkL>{9>
zEgN*><zzB~$ag^;c6tUtC&`S{|Bgu3Uj9;A{<<Qyvq-B^Z=CYivXD2{b;NlRIZjLu
z;r;SV1a~=S=f@E13BWw^EE6{eYtM9An3&NSoN=3vpVk~t$hBjr|7J4jmn}Z(Sa!;X
zl_M3>bC0$sZ>7}NNJP_}mHYE6N!gRVBnnc&9-r0)X~ta*gDjz;{Ef~P5)ryqGlOL`
z*6G%Q1FmOWUmQ>)rzz{t!~`yaP=WYZc<hZ7VZUH9I(qYDT?0LNxm<5>u05`J$|3B`
z@s_i0#V&FVztYW*cdtB)&f23lr&~B)&Zy6myr2Idid1>Yq(07+n*|N{kOws?sye35
zbUwZin`tdGg{}OuOlBo{wVA~J@|W3Jvbvgd)_+6ilA7OGiCkMne2v5>nSz%rsu7Jg
z&{ESm!yEpw9@`;uSny};>@@J^?cOFI+har?xJo)}q{D3JM6QQkq$w;csdqns2!snr
z#TVFCKjwq!An_hvBqKCftRZ3Qhpe5vxK3OSL(XT<<Id`v7pe#_4`!LrXEuOfT#!t=
zv3njwdcn0oG8!M+!wDb4aD<d7<}C5YLB@znreSVnJD>rTSc?x3^HQT#b;`^l#JL%)
zvdnlbH0QxRg00V<B6Vg+jOJ%LYLcU^wSS<)Ml=N_Dj!64L-reviOc-rl6k?Zi`O|D
z7w_$vZqW|{t-L2hzqHs@(9$Q64gmhjO!0}=UZz7PClS<{`_T+j3oNHu?7vytU<7Lh
znE=huuDLEzMStce%mfKDK<T6ZIF3z?a!~>Uo6@<JHODJi?aX=>9wre|hkG!;C;6xa
zoMdXd$+@;!&#c^L0C`kKsv%0|V0dzTcb?ubq1Dg~jqftMLo3CWZ?$@7wAS3^XWV5D
z#$?^PoDmr&Md1>)xG)(@0@PghQe*B?&IksTk0e^^+1m4!rO)b!%QQss;CN^AXzMkd
zUuVU~WRaGLm{nI&e@L*FvRh}_<SK*PDetkV9eWi3n@c=me;SYT@;zR5aPTG>rSN~z
zJA4>&Gm4{iR$HFP%PA7{ER@z+CDy%h)_Yf-9o1!I+B#R)-xk`fKCh5dHXM9t>?Kym
zLX%^Pya<MoJ$SbIv?Hyo++w^s4#vu-fkgC4JhR61x$r_4=f@%jD<eC9KHNRpY3je5
z5=gr9=O*GxcmBLVE6V03k;aU9e8@3+&FEl>&odZmdKIP;^IO*R`G}-1ntpf!%ITRI
zpEVMftsv)Yv%XeF>CDsY(r(Md)CJTyd8t%?lMvt0=JxK}W70=GAu=^cC^hJQH8ySB
z5Yx^&+q%qz1(Rx)q>$-))KWfd(Lt&8oakR$VV4>T(xn-1Ca+;@eDNL03h*W{b7N6f
zCyO}5bl5|}KEIL!J#kp5JIf`m;lZb?rdhXIwEBpX$;=4G9$1-9nBXO-RqQcO?qiQZ
z>&$lb=1C!^K;n?eX_OUjVa24e-dT?&Ws*hzlSq_CykTiR9LlXxTTMPn;RqMUIkBA&
zmI(BN##YEs#L7p_y(ZE3IGadl887$g=H8xI2rxW6MWj6}WbJ-g&ocysq(=Vj{1)PG
z!q^cO;)sbQ*=F3c-X&W!JrWonvh~j@Ev^2x(vldV^>kP!j(On-`=<RLcmY?RJCm?0
zkL?r8o~?D9Y5JApsoOhyQ5$Qku8qS#Z=Njg(0|aEsjvq~7lCsze&G1K{Vm*!yI$_S
zJ$?<^=FCI<vHe2)^P9MBIlT9H>uC4zMDF5ou*&M(INJKmsTN2&!sS;(g9Int(F(F#
z4mMsE=@C#Pj5vHc@Qbdl`-BxWT;#08Ak1?N<bqy?JWQt9)EgkoEnh-`kOatQoH!gf
z7wn|1_!tnlg{1!0B%k!Nijx5O8o6rIO37M*NpS!Yd1~>&+LKl1Oz_RM;MwA+mXP6s
zi}vZzNCBEsUUDtAVQs4<gSquZ^bvxOTKK{-s;%?>w7i_{vc18mplKw)Q&zv;v9@sV
zawAT{V1JOzu^j$qBu|hiAcm6V;`}`E7*p0GYJ5c!K6Zd34d<UX`@6bRc$;1r6?7tS
zw$39-uzkdHu>Le~c5r-@xbupk!dbkh!!GNWnwT@;jB;Y><H3`44l=<h!OlN%okrm^
zR(9*M7*eOEgOtR{QY<pEC7(LcjeVYUtTZtj_?JYfk;FO1$;E8IgI_<|+nju$x%y5H
zPaQF;S-Gz+B-=b1$G{QJ>4&UB%o2+Qj*B;})fw<M6IAdbvH+8G39+#DgeR~CnPeXs
z-r_@?wk@i&3}a<2l4(NM6&Sww$X;bb1bUU*!6<wHsNTfwb-+08;rY>+4BWK0d9t&=
z^_@#R)?>qr<*eA`Vos|G+jzQ;VE7rohw77NoKwUHVR0^FU6~w8x%g=NvwW<YiUr-P
zXtS!`I=DyPoW78*h-={uorWZjolrNwNU}+{=|v|btz1Y@P5?RreLGNw-8d|jj_>%u
zW+w4pi=74`<#O6u`MBv2KBq7}=Goe_`i5*yY!U^j!8s+8!uLs%Cif1Nx2!$>#f7NV
zsu1-buxPI$rMmNUWA(R{qQs4NyBM|m=J4R?WOM&yBiVJ)e`chW8=a*Y7Pl}zO-zJM
zht4%fuN#bv5g6W}Qrc!FmFZBrbEb7!IgTLhDOv_H;4DV)^NDwze^~JjojBV0Q!{z-
z-QLchB|q{zPPUCDFUbUMYEWDjWg2^l?CG<0=gGufK1L$E>G{*O@TNDr`-qzu=Ys*;
zWrzVxvWsi?DoL)j-k>vV>%nD7#RVUI@;q#EbN{>O0k7=hDX#{z01!R7^}3ntlX&{)
zKgZ*zXYf)y;Dt^JNr&PbzHARM3!FBHFX-IU=oNDChEGJcI1a){B|c1K4!3l4JoP!E
zTEYuDPg%UsWO<dKCPj;DR9f>yrxMsk?-3y>?Q<66(|8!tg_EPrt#5YsU$HtH7$oq(
zt-(W;Hj-;Q(L$N$B1d2y!@rQsgh9U8+9W1L`%4UMJTSIF9DlocNGG;WOfD17M>b0)
z7Gq6Z;KV;1g>l#D-d>JlJ7dGUHzIO!7Uq@ZT8o|Hb878ION~fi&c%&XRv%+(;V&(g
z0E6I4>7{s})O=wPU2-q$-z;UG?7o5VY3ubtGdVigqwjk(F|Zm0Z5UdL6SnAawl5sM
z+}?Td_LWd5>k%hrlD0q$E<ZgiI3|%x0ZUcCFc^<*48y?uq=xHK{rM(Jvv6CJU}lj4
zmQ1WiZm7;kLs50&K&4w<jRHIk=YbgNB)6=TfSV_abXJ!lF!iQg3CnlELQ5_NpSrwt
zv_<C!M;n&YK_$)Ed77X(t#H^{B@R8xiB>i*LaeRFye=vxn!>KcrXP-Mho7tjicDs(
z4kEmW&PQuYtFkPT42^DYnmz)q)hLQTTt!5Z^?K~IO8D^v=9Q#++`qV#FsVxQT5e_$
z0#P(=O&y|OeEC5}=ji7%jvr+uBY}+3LZIRxUq{6I9;d5-pIPK1E5@2L&zpC>2~#m-
zxY<Ah5k~qxE}Eo&ftOR;qp5ii&o8;iDS9uwXw5~z!#FLO>;j<4;&0{z)CkxM0>BU&
z?kMju*)y|p5+*yMEqR?`CRn^JS`u(xwt9#~P1UyIaRXAHY#Lx9@{ZE*8s6^;K|uR|
zIuhz|9+#?nMKDh>w%x--ojT5ADsisX-cZwAIzD!XlroL~l_<GVCQ(BxR$sjkYlkUb
zszX66rh_Nf(<ra#Y(6B<Zxlq|m6wRdu&9dF&blyF-Ho*wNgCXcLczYIO{ExW0+Uhd
zLSm#iXG#gEhMA#PeZ(_7IR~x~OLac&3$N!_+q)3`ptk#=L*$hAF{J{D;PG>rLk$hI
za6^eS)HDeg8K`HEGz=R`%p+zPk0g)_iJgza+}zcbd&ZgUqOKO52^BbQO&5tEyAe)X
zUJsx(l_D~G9B#y(K3#VPzBEX^N=<Ix%ZJmCYN{}c#3}+{lVn>wN4#q+V^Lh)V5O}6
z=jwTCD&ydjj0A?M#sN<eivrw9PI<+abg&g?&ZFPHr%4|j3Siety-T|qdS-<jBY8>!
z-%fodiR5LtpR^Nb<xv?cwWSYt*G7*rfz)6{yIYK|Npxt5Y&amc4xBix`s#>v^@(>V
zusUBexHu$n*xN$;TL<6rENRr=>XS&IC-urAkteYb;snxPR^jc03NOO*wzF>1Sx-8h
zjmM$eVCA<^c!gcwuJ5X}5|Yylvi9Bj-)NkKnrGCHPy?3c?KWDp^g^&MMRoxb%+f)_
zmt2HQKwKC!n_NIzAF_=LnT~xLg72<VXBpLX7;2il!vfxJnX!<i9Qt-U*+q~`4#5Gi
z_oeogHC~4<fu{6u%E~Cqot6EwEE`(<OxA0hT}y8y+3lP!uo@sHD@)74NkU_JgImSO
zSb9shOGC=~`2{C&;7MeAe-zW0#^NBJhi#aR4rd@=3%)o#h~xJv9rv7U*w30lAdz4w
z^89n`s~}rlB@7Zvr}+ey{?KM8d9sM;N4l^(9Tg7Ptik&8QoFIL{n7J7N6oh|8ML~N
zK)IM__qyB1e0(Om$4dM8KdjZ`_|5Kd?8MS6WY!J@L3$+O!<krWpFZ&(tp9u?29oGe
z5vf_*m4E}tMA%vU^yBBw<gv$~TWn~Nuda{W&Ztl<12{L*@mWp+#yDrD{^a?pH>F02
zcG?5R6_`PI;Ox1K4KL4}H$2XymkjI?5+_u%e)`;}hy3UE?#q|r{lmA&=p*+^jv3#}
zASQD2+x^{x{pd!`Rung&nq-#Uw@SmDa0m-9t6#-OM8UIcfI#0|q^Xs#!4pW`DV>M{
zXB<pWlN)1l8X@u*f*aj0(FISRJ$BRLEG&tjjdDyeo16}J_P1fwV3lCy_WQp-+WFHv
zfzLxfeH_B86EWYPxWHkU*I-=IoE0Y*3zD6w(&%W%+2F(2RWzr6@8S4k_5@E05La^1
zAvztmoV(k5vH8i3Ewa(M4nv&nJJrCOtMD!{2&VSaH@k=^$osScZEnTCb^qYaH^(PO
zJDYC;U!4YR`L}l5%z8+>P(+LUu0&4meqXiyyWQ=I>FOCf`SydF4`2k_)4|9At!gYf
z%k3L3gR2V1+Eu%psc&d|g|pmV1KogaF<jN2l@G-2BnON8OJO|EqPkRjfn>S_y&oY!
zE_4M;IFlKS0Sg~FRyQ=B!L4pi6p7&JGx65geGZZ=a-T_9e8I@xy<ChDVxpO-$8F%$
zt*6iM<|Nqzivf>LSq(zqjfB;A$C;qJbHZ$1zHi4f&Yr@0<Twe_Vut6V#-2V|c^+f6
zRRHGfR)x4^J_g-$V%$(qJ<^h7=GNop-X86ii8oSkAXgBDj`>g(m2Xf~BHqk`-sqZI
zuIkhrI;mUm+L8)k;LLD3cJmRbo#nFrixS$x%T_AjbSa{iLgzUbBvy-9FSC$F3kb99
z8mJy>x_EMn#dhb<w1<z)2@Js^#okT!j^1*QI$~5Z+tB0o3ePk0@M0YDNik)(Nw(J?
zy<OgW`PTflbfAE|4_^Go&elozD(o?0EdAmFbxiu#ahR%q{kLMayi&uiC(V=Z4tLlg
z1o@5aw#bhVGpJ5WJ1{4ZVoMY&eA;WM$2)uI7h?t-h^cku87GQvS<Hj!fi8-dQ>)aF
z3_%htld$#?Z+n9*kZXamT2|A0{4{7A6m;twT#NuyWnKc6`kY;&aQBuLoWX;9v3qiG
zcx=JC9DXi>7`p^GeGl=?r-*M3lWZltolnvy0^c44uVd0H@$`b1O9yA*586D$0fJsQ
z&&u~Nz7zTC9Sd_HNe$mcq-t*ZP%c35qFO5KjAEod>#W=yIeDPY42VX?N99Ev5SS8c
z$j`k}ASpX`ifO8hPZ$P=SPM+35NfY|=BWdyD5o4!Eg_kP5fI?8g>T^s4b?X_*{lqT
z)*3|<z$BW=C9{pG+~au=of}9RXSCdW2Bs|g&|ZPvNtu%#SFql@6hM~Y)^-1iNfJ0i
zq<XoApc`B&f@FkqB*}uMOP94qff&3`M4@88Ju4XJ={4d$rz44{=5<^$g{RAK0@ijA
zH9-yb3)oIId^qKho<6A>RvDxcumZhgQVdA4;h@Fz+=?(M!!OlorlIe%4v0rMU0GGa
zskX{?<CVu9SGzz+EK2$YI)Ws0t6t;E7?{7KTDO22)5--1K@kJHCWEJazeXOdLeDJt
zFiM9hkJK-_wH)Q|MdIMZZC+Ip7cL9spK4*`mBDO7RB@XM@h{^7VGkM|)z`WUf}PA0
zhaxm4G)gW!I=^42V!_nEfFPU&mskz{<TkS5E11W|$JIJVD$9f`NL1kNv)+rnW~Xoc
zQ!YA3-!74F2v>)RbwX`PYM-&grjn?`?I^4L#)0xaXFw2)@vT4>=v<ja4Tl4Z*P1Zl
zy$w&FJZG_!D+(--9D))#W!7^q@X*nmMKocv#t8nl9>?b~&s*rF8De*S$QIgSUY5KN
z^M8mIh?xE+J)1)sWz#>BkZndTvLOdi0j_2D)$z`&Ke4juZ~(Gi@Q^?cVbbW{%@;=`
zyod4dv^Cg90wF`aDk~BfzpX)lC$A5a#S_@O#k-NbMhd|p+=ELTne5=QpK>sb<E6kp
zI73IlQ|&J3`xREG(<dZFe*<6{$Zi#vjvCEl&`IVurRsTX^>k5B>i)!;vd-Pws_;6O
za%|9K3abu27PrDXsUU*8E+jeu{0nb3&mHX)xPv5w(V5&uU1*E*WQ94-Gm!vNc1i<4
z9WFA{D@17@Po|@0qP8)H=Ymb*O$UbHQ3)Y{?R7Y0XdTB>=N}WUqhk{EHp^`kHZRP<
zWp!wHoT4AGTU$her>vR0U_TN`xe{g{p`Nj<h6A@>OvEc`xH~PwXKi8Ud{thhqu!Yu
z?9Yq=ge@sFVfDdgT+>4A>P>zhUPleF7%CMzyeW{o+Ot(Dib0FD=~mkNTTA^bED4GP
z1BZkU5y*$(c_9)%iv~O9s55>jo{8a%kDF;qxS06noQIEyp8Ly%psc$nW5q)95o2_v
zuq;9dob=T}$Z`ERiO<Z9)LG#k{Rfb3Oe+oICxwYw23fF&<<JgUH}H(avtWKq-uX}c
zf#}8ju8^w_lSF)}@<&T>hzj0}CEtP9VLE16F1LJSMt198kODcm6u72Qt^o@O04mhR
z^Ypp6whv^x6RX05uXavQ<<O*5Htm$O5&P-b&U{E^E<uNsZ9H}?j~QL?x`Xa?ue{pb
z)5BzJK86usJD|a;6YxpEL1g7|Xe_deC&gV$cJy)?I#*f1!UzMfPC0O_FSZ#BVlZT7
zb})*OxNxz!e4suSzvK}M4@oBVBsmy0_J|spoD;X@phpIo%ZF95k!XvLw{LJvVlTGN
zcqW2iPlxg0SO|lBuyYbe?IRO=gCpTtN4sgDblxy1ne+0B5JX~$ZRtSV$PCXX9}`jK
z7x|E*h@JOsWyR-s>pXe^a7s7l7ek){zeoq*i?_##giymnxs*U!eg<vvJO-BbVA6oz
z0_%a7A`BfI$@Z5m#K4VDpGqYEi!pJnF2wFMIXu{Z<<vW=%|R>-ksJ=tN424*N@cv9
z&`Gylq=(p&Ikf*E+)U1O4xk=0`qbo7vQ8j2WSX5mAIW~Wiai;CMhSNmDFch$iUFmb
ztV($J(X<k&p#d6pb}om)(^E+>I}9SH0~i92j~M0wwvrO|aZJ30_X8@HbH-pW1M*iC
zAOd=O%2Lqrh{&Ck5+e&k2ow7x^l<MnUuNqRiR37usk3Njcy*>j^^-j^-kQe&6|a}S
zg?}<aCFPK5nPfJrajhtmDc9F$V#HW37a16jZgo05Ri~Sx0BIK$OBDs4S*Lj#@NO~D
zh&_s^Rmzg2CHx7J*e_Ug=6`fK1r`sLN|8Qoo&LT^MP~MB3L;uw<Py`aLYc(tid-v@
zLPu#iA{lUOFD7YDE<b;)AU0CRE6M>0Q;1)u`TMCn@`PL5rWG%SFZ<U3sR&?=+^p);
z+KaW@@?mzwY8zHHv|214ftbXyVGmBdf-aS1zug_4i)6`$*;+wEB?D+>IIEb9)3dVZ
zPbZnf#5~IoXH^QlNlg)m)h2xK)|T8o7uV=qJ()L$%3vjaavvzq;$b7Ef2B4u^WMRm
z2ex_!dJ`9%@YfjD<i1f8wTY09#c)iDKT<+j!6i$wqslpye0y>rrn!~tNxGvc?<3(-
zC6VLE)rVu>t{6d`BV$sK^351o+%<0b_+<0sSmbi&-y5VKO=n1bMVHf%_u1o$dL<qc
zALVOD?in+Gmtv{wWhcCa2+6N~0q%eL{JCX!XFB>hNL(I*OI@p^F@Nx-uU4KsZZhO8
zSmFB5pa%~n24a{WQnGdO=hK&ao3D;fw|DlxJLL)`@G8NO0zhRx;knYEWaPZZX2>-=
zMa@VCI>0;DEr=_)>Jm0e&8JaFYDhf{(!=abay!_av^u{DVX2`Tl-*?RiTG7|u7$g-
zv+fq$!Eae&%&Z=h1Pah&4>{(}7pL96Vd41b4bAZB%eVVmr^jy(ksm=~Kv~H0alLWH
zxnaw}(-6r{5Q81A0B<LWP2ywV(O*^`86Ygfx>!9AsEB}R&!i;HA#4uke9AKzPUD1@
zTXqg4KeJ2go(39Pfk;+5`stiW8ACLP4KOIocH`R&D*t)GouPwS<!?Hej<#HkXfpwP
zQePFT9)!T+Jp+tc+zeah8Y~n;$A$g}9aiLrQZoESsn%!_3H)HegvfYPj9qD;&EW6Z
zOkq)v=|HSY=Yq0|^NgbyqXC^=Z!}uT!59&4B*4-4?=ZyVRY7W7o}JMTf6Ct@G3)sM
z`~RUM^}jyQ{=!{AD}7N=k1y!2mw7)YnmhnDWX`R;nqDU_vSE>zm-N@}BqhO(&OSOi
z>CZPbul?&G-Cq_%`ukfn_T4na_m>$r^(Lil*(-37WX#vooW7l;lX7~UCYxi@0<Z9v
z{~*!jGI`ymmdErX{c@CEkcyYQnf6GZ!yWm6<X6OokGa=rxA;JJ|G@7eN}|SJ+Ot~_
zXE8APzMoIhJlRUe=mMARMZe>Uy7bE+EiR|&50_KSQ`%?$Ws$tf#yqb7yi5!J4}JeX
zQ*IwqL#h@GPUGx-ir1c8myk1ty>Ui=y&dP&hl{K~%-`dcIn6`XPhO41NYbLYz-;~J
z6@8@_exx_OCxKR+t7(sxr@&p*9I9pW>`rNJhkaS8Z?io4W=g6OuQbin@q`pbS{7V<
zMFJ2lz#!{tM~*MC3}|ov`hC$S7PyyA$2v+P=e>M@W%ziBp8r6@yQ1btSgY-n6xL*G
z^N3ECBjOUG9hiw3o;S%Vnjaq)MQ0(9s)SjOE7FjTm$1DOW(J~fYL1O?p<9j>eYn(U
zv(bhfG$geOUEt7ijqdgyWZx$uC*t1f(1Gt2N;xt?%K_V-<h*DgBhef>;i+R`=YfXB
zo@N(M)x$U}#PjT09DnC16EbLPa_PDH5+#^RLn$RYWsV;dvV5(RsnKYC=1-$RluVP~
zY@E1|KaRWmmw%FvM*VVZ_43xi{`T9glh6H*75Y4RvW|Z{Pam&@|Ke-s$@=QQbk;ko
zPaZ#hy1GX9;g7X{Nmf30N9sOPm}QgXU#4etLQHSC@0RQTq#sls8s}$I9BW&&V~2<>
z-6}+qpo=)18wbQB4*Nj$q_ZB<pGMJ1rCohoO$)GBLTDKA{j8!g;v&4Q-F)Q2=!x+(
zAf}NRi3+6&K(fk`<Jv|3`#3^O7>o%x#leHF3!thKV<v5_uOKWb48CUt2@ZgJYbM0>
zIkc10r|l2+BXJ&2Gsz~Gq`vdlGW+PkxuiOG6Q&UyE+k74YoAEYBK1WfjGKZI%OE$d
zgVZQZ6ORl5kKMdzAx~B``bj#O5_^#B=~VgvcFpl%z!*TqZM1<pj~E?-Q_&Ddq<#bh
zy7h%+BN$PgQ-D^(&od3fl(`IJ!Ype<s#N5WmC7u*l+@iOiCTSH1v(0vjULdfxnlNE
zL*SZ*Dc7G|GN`<)R+|apSoP+zvGb8DWb=ABmRotLNSRuq9KbfTICNeQOuUZCK^35l
z28;smsc{M^BT*yp_EMIGRE*wGEP@=BE85Q}E2uND)v4K+^;*OS7U!yIbArn#ABsWj
zL!MoYik!olb+vV2agw}JNIzK3utW;o#AxgqfCW#D*viZhtL8YlLrr~_Nyg!IBX;us
zpjc&-%K`~I!8wRyc|aryKV!3@`%2&`oMYPe6Ut@L6_W<%Ql%X1afTRRoU@FUk69+!
z8IWH?TI#$<q@@AeDkd|OptzKDAsW%zPKPpV)>7O;hii2rDul@Dpk3ONK>8S7OkpI&
z-2?hEzE%Za=o=w&L-j5+NN&S^kj+if02Y~39}z-8WC}$Gc6iRFBf)E2T%;30K^<sJ
zx~1Up7K8n{powRXI=u<{AB>gLGm?4u>Nx)Zqp4>=c3DCpn5xSE-~a3X?e2v7JRaD7
zpLQ=rAs$^`m;4s6t3jIg8xB#=74c;C8&#yhf`W<@PGso{%e5d2b!#FZoo4+SQR0@r
z$8IfRAmf7iCEZHW2K{+1tcp`^*aSzbD8>DFw;hG#m=ld}xou~>8}gZ>T8)$M_S3P(
zzVRmE7I}V<oM^lN!do4Yh^qriCY#EFUUP_I%0{ZOVSl7%Noj<&0YD8gdzl~@zL#Z#
zcqW=+P9maWf+=WUakzW40o=lLJfJ<?t{JwAMH>T{&r0lsdzak<0~TyaZkjYD^Aaf)
z4NrdfmdlqO@&oesIp0mch~g>~TG)CEhZG}}W?eQUa8Fzurl(d;<))uh-LDGl$Jq<!
zYf?m(Mvo+E!EO~#kDsk}<G4#_fux;O-XW@iChcmmHP59P!(2zhd3Nq@Xm?yp)EEtW
zLQpT#YS(E1ju~M?)(_M->`iID9kHP3K~Ubznc-`n+xwENh23Z|T+Id@Li{{1W5WAz
zbkjcrTC5Zt9ySABV$dVnlw5!j9~N1!;W{JcT`V24))d_d?ebT)A+^Ij*x)oh$K}rS
zuoVs@G&}Z)x^wt0TuNtIL(C%{3#B_l*43Sy1<W9wG?=!saE3O-%k)P{GtP^4V^h{$
zDoJRv9w)5e?9{*`61M<UbiuYSqOQS+l~mo{{cG1s4YMJ&R3GFW#wWIh*b>WCY%Et2
zQv&mB<YPN2hyYkpil#bwHO+fmkEf2&@j%pYCHkemXO|?6Zuq>EzY;8*Tx(f^87oGY
z+M|Zo#=b)CM6^~I#P)gZcHTg?(U$T++OXA*Y;avXE~gl>&+u$5Vx<?aCMul{qceeH
zOhoF-e4vAq?6&-XHj+&{@|uacc&|b!WM(m&>Ym5+@PPq&M=*al9+KVe7Fg-0gc-<?
z&&71;X6fpZmHtLl)g>Bz8$A?eArjTK?g}3y%1Kk-N~de)bTjCMm2^xK>_LwC5P}j>
z9Kj1PbSMhM%v9OTXtZ2~E;O4n^VW)XvR^bzRyW8hA$pcztyX7G1#-66OowH`vP0(O
ze0#PbVx&Kr83m+zXo%5N;{r1ll=6b(#l*paW1!(35XcEoh&y{(X`oHvDFEh3RMp47
z$aG^5uH`v2ILbI=ukGYdGVjt&9Pk-(d$D|d#_oZ(0JOPcjHp%;3?VF~LoCNxN~+Hq
zb=6&dk=AXPO=mEUc3;qS6I+5QZj`VH<ii>9%B@><;e9X9QZ=A~3zQt1cOESh#7(Bx
zhCi~SrT2ZiZJqWDBYn(`lT1GgIW_dzJCIZ0;nAoeW^U5kcH=IqTv^!lHX;f1m->Z`
zRl?MgY|yd#m2T9nbaLBDH<LgqkW;4NMH-O|E?jXVQ$oiuHy~~8!r|c(D=ZZzBhbBO
znQb@`vxKC}U0q|6k}EuXbK*qGdZ`YJ)=RmblhY>a3_;C?Rd+_Iks!97#0JaUyt=w-
z2Ueg~SD$Sc<BMf|e0g<wWf{`&X>oq48czFiGKi$`+4GhYc1hin91_xs-xNR4ft`{r
zR*Daa*H~;+p;Xg{vy(RJOFodxD;)I-4NPO<lY#k|mfn<*xTrbtvtnLeZvLM;5BEI%
zuXe)Ww0%X2Vf>SOPunDDqW#O-|04VE$=-2$(EIG~xY_=@^7!fFr&as!%G0O6+kbzJ
zPY_<#h&)cOG<@e+k^rinlSbpgg9phA1pcsv;iS+gAU-<Kszv&Q5#bhnqt0d7tohkk
zGGG?7_C=dyg|o8kx9FCH!644^bh!MMXCH;M5t;T^HYvY&ySul2O0W9rIxGL$mL8qZ
z-Y&U2fDkc<46qZXuFfqz5(lb>-Nm_kvbC2i=511q|2paRTa$kI*927rSkA8L6G`se
zt@bkN*Obc_*|3F|wh+ftw#&=EN<j8d!t>H(T#$ahwW+DLg1G{W0NgJH!Qjzeb<Lvm
z5C+kbzEBtak1dOX(~FaE=nPuNHSVc(t+C1T;feslMxb+dqyUXld9#1b(`bKiqp2lN
z2}+DxYe`b2LvG4|e}Ao+021CC5J3<<SQZk}m4yQ?mpSr0;+RVt4RkzdFPG!)a)eOB
zqm}YaPu8A3r@#68O7a(e0w1{ruV`@$cYB#fzD&PLTkS4AQN5pfG4FPS)y_1Z&Ur&O
zMe{s|8fWAzIkS`aSC=FD*P0<Cb(G&0y`6)^ZXXjmefv<l=}dEO0GEc(W7yFrTZd`{
zlt1@4@Ybyb06-oo^pY!>%Bf%<NSi};vNeDwgFHIeqALj`Fo;|Xg9tee25Bp4!j=du
z9Y*|%X4%zU7jqDAd9I@?s}_c-fqRIJ-JDgjKDJ%(7<UvE1WU%uD#NyH|0x&R@<C;d
zh+)F~p#|s>SECXFLZ&W?K=}+S$(}*TmG4N#Q?utK!U`L^%Li(rOnb`;WzEq_zQ(l4
zc5t9W9%_8?#hW089rvIWjqKKvleE=+IVI+Xd&ggV(G(jumko6tY+#jGwCWWcy9?-V
zVi@^o>V@#l9qCu;ky7xspbj^qnlw0iQiG-usKEAaUJ*dsa5}C)rBBc#BHcBki$<Ur
zYvO=pNR$RN4Nwo1POlI6ct2Hf_&L#frB<=wRrRkeK-jrOLTG4JcM+rjr0?AWn<{kQ
z&m{2mtR60>kX#~;5a}A}HK`(W#DL;dKWZp-xbV5uA;ODlCD&Wxg4FuhZH)^aWa&^#
z9ms`-;0t0<iZ4?Z8bdb89PBG`TZt$>6F3>xG|KA|B*U@mmo!1`hDCww0!lZ}K4{dT
zp%9F7$vC5_$P0(@Be-nm=?6B3lK#SAfOJoTqp-qtPEj965{Eu$t?J46THRyk4EUGQ
zP+$5A;6f^zvfgkF`Js~P){`e}gYx+j1m{oi$0gq{xHLH|!Kf70I1^`$M!dMz#lm(`
z6g_8Wr~c&@rpIV6DHjyHrUhm$)!HtSJq{ELSV1fKK6y72%kM%FPo&B*^E*dDE~6l&
zZhvHd99SFDj&iBwCOEU>(n#klElFP-W)n;|2c>5$=;xLn>~_Nv^ImF7!dMx&$#$`$
zJM$?Z`9W=9i9Z{RVZ%d3x;-i?CkO_#1dwbTidiy7c2KhBoeE=!_B}6@92_!0z`-%D
zzQ`=$B;tf5c1%jshwQIBc=~JHJNv79VWT0ek0sqGfM*^aCTsk#ZRi1Fqtgv($g^bz
zWq+bYB^$b(<p|+eC@m`BF^KpG6L_g($q9tQKZNfZM`&0S7Bb+WWgo)k^%^h~eMZBz
zO3>)|pv?O88;mD*Y@JO@X^*yYSNZX5SW=|_?d~6+Z0_xSZXM$m{g3`yn~ncj`Cb3}
zH9p4~(84#j-|YO;gslDk`HY`v|EmH)4DPeO<Hr5J`sC>f?fH2BKc@SC-~YeH=YgJ7
z6&xujvzhqa+l>c}2SKI@V)q!vIxMp=`?vwS4iI~EmQfQCoP>Z{;xJ4n96uunmj)5B
z!7pvcD*rO>U7i#Hoi?m%^j4UW%MFQdu*5O0Qdeq4Ln{Cq>ZA(kM9t(AbB9h#L@aRr
zAc+8-_sQc|FOu~);)E`6VR9)Qq-$S&opgwdle25mocX6S`E7OG|2DAOqB{rf&M)HI
zFM`{nCobYAqQ~eu&j3rT48(!zctef1qkea26rERR)XEF7vS`i+ke9>)bjv5%-QU`K
zyS;Oq+<xx^tjw;4WE2t*!9unRd$H8|GJ%|JYD~_mHKO&T05P>9;p;w6&()w36{N^q
z21{sHDcPF9HVCXfwF3_T5o5t+ek5Otq*5a;tC7@BT(_lnT@Ga7U#Jo3K3`#QOU5e}
zA(%w4>*{7vq^|{SV1d*X<h8Je+Fa^q*DhaaA%@0Tpti&f)En@&(-9gt9LbM41VFX*
z3I6D`RQxHfai!UpJOKh<P-+PsDau`6eM!utJyXggUq)QQ)Q*D5on;rf7z{0>fj2bP
zf|2B)Jz|U=rp}Ofd@*&IuibNpTVm+}?Bx>lihQU>9FI6!aN}b^m<dLJ1sZ9dbFMLv
z69tc)mJYL2GtXs)Fe}mxyXyE1<0J~7skzFeU|i_-&GY79`|aM{_KxhHJ>-}f$N){5
z;)k>otw^neYj9M`(E7ns!qr$kOV3#A+MQv54%lF%`1=MjVzf}o<OG-83=FPM<)?O8
z%(;apDY)w{Gqt~S^6kOVH+P?@sK)m>;1m{s+O;r`ycyicJnPL!SHqlXyoNIs$ri*U
zI!~S|)k3D{8~~v}i6|^c+B519gRE+1Twa849G7d%(bho98kj>~+7?a!0l(npp*1y}
zNyCT(#_Nj#@RBAw(76pg4NUGVvyv_R>_Th7u)fT;B!E^<<0q<9bT&KPG5efvHwToh
ztwGr_QX7|;U@XN_+VZ&2{LUU&JX<Ic9))1Gp2dU4>yUL35)?g**7&Rw+%M)OnQjT;
zml%SjnR>&g)vqq2dtdBeq=u_hzRyP^gcxCeSd^j&1`Hb4dA{22JbBjcwCOCTQ@f4-
z>#)K7fsq@N%~j!nx^@pgtOsy&*3{}#eR^Y~lSH4WDVRk$6;_&|C+W)*YvqfiwXyL<
zQulcvNPq#xR<lC#o*a3E|NY<poqW4_w2ypXd{?Ff+uxKyPoipHjBTi<rR*c^1{bi%
zoE6a<8NCs`RHL6sC&4a2BRD_C2<dUbuhN`rN&+hxTN5cGNDZ;AY44$9vk1@~kZuYX
zwSl1Layzn#q)H4YxV!De6sd88V|VuYZCxm|le7~pL$XNQ!~3@UV!1H}l)pIfR$cMn
zJ&@P(3t+7cD#DK@vmnu>xBoM?CNm~YHcq%XTcTpPr04L<<hz5n$>z~ca{QM5gFn9A
z+&{sWqlB$P`&&E7$pIq;@9g6ns<NKE-bolG`sL=<&M`IgA8(IOxQZkogb&`H@EtD?
z_Vy0G1-<O;?(ejPhCa)uQQ0Fz<sF<0hqQ@>m$HMBZKvW#;RFQ@CmqRM9L*mpHzLI-
z6HzjDal8HOoZUFXDsc(B>59;0`6T@!pBSU~R?Cc6dZuBJ`MGKqOKc&H&v@G&mOx;L
zW}5ryiN~Q^P)qdDBg0WK=6-dFL&yvSH&6ksqrv;72oMumIZI*&tzZ`d*VD`va5V2b
z>(>o;(b5Sw<|f__QMJARMg%yo*rBC+{?M<PO+_hcC*S#0So2<T=~nnAAk~??>2g!A
zQU}AK!xNDo+ef2_oSV`1rJ;tB-~n)ANatN=uJ_a0Oom}lU)R<x<gDD8V0|^4*29&|
zuB97&i${NrJl6-wrm}@#v6NDSm_kNauvtWcF+AyuyPNx)34<D}uP?PlK3C^@C^&_c
zTR@$T0m4tXb*QUF{WHHXx`hjJ<Khz6Q|K2L%6x{&WqxsKp}S>Elrt_k8DxtIRyBJY
zQh7jIaeG%(Jw>xdWOtQ53$6N8wgXL#agKwMHpXt<X+I%$$r%>8b1^$bY8h(Qa(P`Y
z69-rZTFi1;0Ca@jn6PXdLrkRz>t|1R)Qo?Iy>s0WLxYsp!&4n2pKzW-2{bkrrsfbi
zK?-X(=*gDN%Hs~RLf%NWBA9N;t-e+qS?Y;lB?NZ{huv8wNP7ODqx(fG;`G6g(Ac>n
z1t&N+Ud4&BsHYexZ9@SRaW7^g4sLPO);0^rN4*8{FKP+GFVRIrQYKGVRxt9dzKREt
zXPrU(Qad%l+IyNFv9DE5=?Gp43T7`g)UTSX7##!5GVKdLm0bd~>K{lxkywM{gVS$z
zb`Cf9cK@`)wx$dr5A@*X);GdRlrVF4^>ZfQgCK5Icu2cy7~zGwDtw(1JukL1umPIy
z6w$&YOe>pz$#RNG%7CDfz$>+O4f0-3B#BD-J2zSE_mYz&81BJP_Di$ERD_xr0k|de
zxMW3aG=$mch^GTn(T+?eJTEm%#)Mu>Sz$PLj&5(=YfGPmTWbaF@U;>?;JBa`u8Pzs
z8Q7*zxU;<}djqHR$k_TCiS#<apazVhK0ATIc&kI3X5*(^TWgbgAe+@u5}Lh(jtqC?
zG6Ly7Nkz7YL%{Lm#1%O}UK^h@7GSk7V`TA~v?`9art}UNndl8I@B5UHo!|``FeLJU
zJH+`gqK1T^<-h?i55v58L)(E$`}fc7$1BgnC^AX@)NptNIjM<*!|8*w*@;Ig;rN5y
z<I6TRhKPY#Er>vN7Q?ESW+GGpgEz_H&YMKiL!HDIN1^#BExqId&Rk@cu@j-wYegW1
zRMQ<_kGwpPvivr>9H*SNJ+akLQ&o>GtB@%ySmi<Gl`TB4r5?nTJ|1xBi%_UDC9(n$
z&azZ;L7fSizH>So6+_UaMpJuXh(U;#72NK^IZSFyb=I3n7_ETD0>^fQXqZj9ZPj3o
zi$MmqP)3o3Vo}7Auil4r;?vUE!jK`#Ol-;-!iM;D=&F=-l>{IfsQekW-4-x*F630Q
zaG)tjb|?!0@}_YpZ(-lgC5Kv0(M5TUOcotB7Yy~gD1BLqXOwqTPXMHvYKYDP&DC4*
zHar>1pgc9o4;<(h-QkE*Z}>H+vhwOGafbVT`?aqO<n7MNUbYd(leJz`;{$s2;`Zw$
zK}7v1_GdpGy~`FiQ-&L`cUgVg)@Hb5i$u$3Qvs|V>ntlId%$5bW3!HwN=-}`{$cgo
z6yjdf-#9J2f@gRR<1b)z*j6YK0%y|%8Nd*gBzA?h1|tTA&byj1ln0X@#;<C~XMBZ5
zm@LyCTQ1A~G6(cl4-|*T?Q?6a46{08mQ*bu#?QQ5GR%4G>Y9nBP6&x>>=?^nbhBvV
z89goxi-n3sH-J%$cz_fsk=OF%u_2NfmIx4N&T4AkwNZOsKu?{!Q+iKYp&=Gad~3BE
zekCviEt|?=QTMBLt-1iIBPW@4XEDVoG#If^<+$l=80Q1wiuuG4W2IAX=d+Yxx9MRX
zhUIZhQ9rOsux+*TlgnzvEjT=%J!!%z$1F7a{sy8%gGC{yyKu~tT5fM-i6KXH(Yw`-
zF|ViQKXlrw7OqU+*F;BG9Aq}yum%BTlnvQpO6&<`vloyNSkLWn?ICYm>ilVfln~N;
zDD1A7l$2zhN_>|hS3rY=p#Y@%otD)Lj0Nh<<|%P4L(;YwxCeq5Xj1wdU$JC!i??fm
z$Gp(gFYVy#>Ozwm)IZi1l10nz`1-4)1EcqnmGYqpK|Ne$Jb@rMZ-xUoki|b|jJH?Y
zjSCf4t)tUIOvGl7HH}MuS?mxKTS9c>2tmcJhFk#Yfs;w|!oWa>lk}r=a7sB}@8sRE
z<gt)p8w!FHjxUlgzp^0)Tvxi2Z123>e7kqD@vm=ows+sYsUMAzU07b~&O>7z-3{)x
zp(!p)h`Xk7&FBG+vak=;;Yi^ty7_eL^(OuQ>dNWi!QOYBwUx)G$MompCk-=zb}x%U
zr3HD|Z&x`o9+g&K3+DWwtOXC5`609fcT0PQr<iEUyT1&ci<)i+REFO)9>A?o4PW3m
zR?YhCvZpUB5TeeD;>v)b1-+-_3O@ow0^55QTILV}pe&vlh9x8AllE;~SosB(M!Mn$
zq<w5zABP3gm-yfVPmh)Eq{$72R&s+-4L1|mG*lJlij<O6&}9XR;n=M_6#{M~w%2LC
z8iKRBvi@wPzHeEJZ+g6<2AkOqn&}0$5$;sf(fEaSujuHk;jxxJ@7;F)lRGKiuXgr#
zjy69@@ivoyoz0w3g)>gd#>h%PB6@qIu`gof%qOvZB(R}rT_nb+w<;COAJTDP8p9<v
zrn%ZQEa!Y17y5ApZ$OFDk@#{80}byrHL2Ux;zWgsAqT#vus6E4mBg&zmP<op#jdVh
z4L;)#8$~T+Q3SY@SUT+(+keIxk=B8sd&3+R^qYDknN0W=J{G36SDvvBwYacy+IK(D
zB#fq#*<gMjl&Rc(b$oJg$UX+KhShzXM8AOT4s^~*F<QXNFxIBM;%~*79vjtO>D>5U
z*$>n!3#UQE?ss2xu=gJBADryI{O<JlVC$QmlllD$3(&B$8zqwb2nDB3r1WuiG3}@0
z`E4PwfUR~>$4OExWC?m=iJV<<R57_MI5UC6=jXrT?cwps=F!RNe;mBP^U)w9@HiCO
z0Rt?9Bbk9h0~(OG>WQqgx?s5UEH<aT>-K`{%?Ts76hXZU!|#CSd4w=A_Bvqxc~$LY
z#n`*f0=Eh@6c$>sBcvj?&dsvh305V!gc^749nuYn`rz2Dvy4sv5sNDGuDdQ|1vMcq
z%r8og31S1iH`@B}B8WenRfbF)zL&0{f>hwW3{F=X5m-UUU*P77`q5=DuAX?vP&pcF
z<=-7u+cEug=0)uM_pe~XuD$~zPAMix?}?j)!`HRY(1L|o9=RZ+W3+6wVFUx<JQV>X
z--t>bhJjZyN|Y~qfZzGVJxft$XM|%vl1ap~G?7%H9+SmTwS$=m!lA%;skPnJaagDf
zK!AbAGLHo?iY|01opsV`A+adcZqQRaz<4%JIfIj~H7ZUb?K=JM3?Pozf`rNPyj7?>
z(@;<NuxZXwi)Ya#l|`s|fh!}(1?S{b>NpHt@}4YN<ht)th{uJ7Qd3rX9?<tF!V<=>
z;Kkg#C0UESn{i1RD_Ev&Hw7utd42O?2uE(YNNB^beHNL6Ag)Af*5a{cT6)D7)M_wg
zP~~Q+LH|m|p7f+TuW-`wI-p1`30wVAoQqN-O2qQ2nVmyVoRfj0{w|z**VVJ&!X2TH
zQ^g7h+IAPrNmAg0;rFS_Ot<v6+igw!>_NXuEt<AW3%5L+_WKwh4`6|{F|XZOYw9gk
zV-!ydiTfP<1`qfnx<Eg+RDOQMTotgFLcWDB%OZudxiN9`$djQdkhR@>B5aw{Q$eBe
z8&pb(h+7&mq}AXVL4cC{v-*cfA!l^JcJfAyKMB{df`vSrT%j7+-oe)9-b#!Ac^b5B
zPf9`V6`ehcQxJnjE(PseWfpTb@p5Qb;kDAOrQR`^BAcA2gHh?K&R&c0Nn_!okSDKQ
z$nnCjYt7DCrF+nDEY@BM@Pf`rzf#$jlOauKtBj!WpfZMjX5oc`v4*8C3t}kaJ9U=2
z!Ck1Xviiuqj^nDX#d?GN3`V;BB3TKJWRA!LIR-X-W^_Y=FA9n%iEN|>Osz!xW$!HS
zeJy7$7UeAONi34~$;d=XF+Xzsd(`SQe2KWulUj9xxce2Gk2jCEc6Sp@IL&b(vW`@x
z(!2|06E5to!YDNSsE&t7Z%<CXlk-H#-gY;i=H8F^A}t+Ydytl#PTUE{dB)TLTR^10
zLvcTjq{^&B<O~}RyugmE1=H|&oh=D@Hj6_-@mMApXRY=2N{l?J(VLj6B!v+yo~qo5
z#=_}H(Dvm3L&e+I?Y@TfLz-=&*%mh>6c?HbGzUhip{YAMs)w|g!o`s>B=#fH6dnl;
zjLJt#5({gUR2g+&qvpf2v@WLGZ&8H+A+Eqyhw%Me6P?l8P-a|IzxrWMFtT=oF2WMm
zZAs77FrwBRQrYdnXn@VCD=}!+<#7}qMOi!P>c?>-DpcG3PUM%!tx%BcPREFjM75r5
zq8r@5F?vvhXbJZfKJp{K?598r*~c6e=Wa;hbiuOEMN=6Fj0@4gJQ3Di1grm1{NOFb
zyGhe8!m`!$=%X(lMM2vzb}N<u8-c<kV!W$XX$qruxPCQnK<33h`WoF)^A@Bb>CUlM
zO&Ks+EkhD4d|zsY$-4z~W#N0ZlD}KvHqfnbnz+lgeN9&Q0rTOzhvp7WAMl|(KLz8H
zKtLPj%%cm^J5eOqq4iU=iZwZI5U4<1o~~PtEEkL(;w6k`aN%~FQF6S$d3gN#;N%3M
zueTbG_{=gOVmgOpJHMALfJ%(Xmuk@ZI{8xTT71nH1H(`mG=O?c7HM{oLqGCIp+!0=
z7=&Dh%<S$E6H|a!!u8_HiM3vI8K^+rSjWS3MC?$Qh{~)18iez0h!fs$HX}*bG5{M7
z1gbpPzM7D@;irNmPIgoc*}m#Ify2&ihH>8Y6C|djFOp3T30r&O<9bj7G$G|_%(al6
z6Sl+7WSRP2{BZc}<Ah`wgcwwwrh6EOqOO4_{`tx?GfxE`pi)GfG720$3v39+nE`ha
z@<WE%3n+^R-*JC&(!z@U`D8`<Q7eV0LW_!_4)@-y4Wus<p_ED*W#~PlrWQlzw!De)
zm6se*VlzUnCZ2vFSh9SV)D3p}C-;D(EGGg&Pe=b1UbU#WD<sX(alNDgA1EHC3Ou0V
z^HL*LIG3h;uaFh}>t=w%jJfaXsiP7NciKGgxfZ^}QLQo&I{^5)m;s#AnuYslM0rpv
zF|ZF9b_egfV79S8rjr6ffQVb-bI?iGs*aJ=B+4IWQxe6Hu){i%Vsk*%n-pW0&1WuI
z#U^{;K=qjwb|piQLtR*Pt_mIJnLzzoeY2?FhJ}l#I3_VIHRsmMH<Ji@r4M@tvkWW^
z^g<7uukhoRmP=9!5n)Sap;Zi9XBQxrRyH0N&d0k&9ElHKWjVze5Zp~@-}}#(YB49}
zDQS;;XI^9Y-!biXwIK}&bS~ji>ba$T0ZS3-Go>L6+uk~E^Tx!?(%shKTQi0!J%}`c
z{VhSqkA}q~Mrsi$3H`!FCKuR0Bs1hJhlU+3xa+BlX=Kp@ET!F`A%-K-S(4OJ0|0%@
z_2g(Dr^(jQ){}Kn_sZ#jWzT-v6(b@WE{4uecb<#Xq3}xYoeT)!Rm@fNR@AwWxzIYw
ztVcNn9#%dA>?LaNQl?{sx`>J|-C6m!CDnIQSFyv2)S}})XV>&PpAgV^prt53<^vj1
z@G@nOt^sGv6qsk51b4D&va-8C6T!|i7fFq!%QUyiy2s$7Acgn2l^&+YWnru#T@@*5
zS}M$}d`C$V8Z~X;RO@$UR^;%9e8g2Kc{1n=Pz(_-ClLJ)Tn}hAFhpb+?;M{T9PMCk
zaZ#g>B@#g$f0rJ*9tc~AhmqPH4@}8V8J2yhMT3>A$w;L_GzaU3t{n5<u>WA68J4a>
zb$EO`&4#~yQ#RO5_nUW>??0@+QG{kGlM)wAZqJI`J0B$%c_XAPn>$wr8wEb|4<XF1
z#MjKW=ik;010^HGGPe6zk&4+SKs_xUPW}Ue=Xm|NMmoxswkvK4Zxw!|lf#?^GFg|y
z7(IxY6s9RH0J8z_b%_JjiYUC<eRZ^XvST^d28fNC#4MW_<8qwSWDe~sIIZij8k&@Q
zu$C&`3Y;-u$s)EjdS~uBeg>m%uoTP?Vt&I;)vX!fh7E&ME-TIwoNm;P%ODE)eI*3k
zHhq(X#A=beFk=OlF1{djL@%a>4(u@dT`n4}cQ+g3RPzI{eyPKZ#gnsZ7n>X=grNSA
ztKcprr07r=q$+#PE;r&_5}tdGezjn#9IM0r$6@z!3{$X`ym6${%OKhJ*rc*~7^l<t
zsXEx-`z}F7_i;S&0%iz$W(8&Q;HAnL7<;f9!9;sujKgj`&fLYYa9YSF3Y9PfJsXi0
zO(v7TU_k^}vYNHU*(7y`?jX|~8nJ3=?08f?-be^X6nZ`IK^``<eu%DoqD;1gO_W-t
z)mF(hZw@7u7p#;up93wL>K0a_B}CzOi3x}<5Y@XNX&TLHZ(tKzCYG1SJ<*IYS$I!5
zWvcN&D+v1>v`2pLJ(`z@?t8Hb!MB$jfV;lLd7v59rNF6~bFi*sRc9E>oa{GHGkhAv
z-(rh3)g$B`Dh-6MwwLb`+i|pWxVO8td9r)3e|vlfrvDAEeaiqy1M-ky4*dbbP=Hn%
zCXzA)$B1iQg7k$OgpxO+Z-7+7{=`y(ZBS_g23p>98qpQSfBFdDB>BT^(aJx_c~QOc
z2fqLBa#4mR-~XP_)vx7>jTJxZ{fm0asqV34P0&A!q_TG>Jj5lv|6cuRaAMQU*jOYq
zwp2_@haAgdT{no_*4@dLR2-4>G}L^ewfIU!`4hMSO9;`V0Z~+?sdUDeVmn&XuA*LR
zq_Em&O;SmvEF$q(I#6RS>vp8PO~;|;`D&~!=A&O|jknYloX7FYWm;YNV`)qZNPJh(
z-~6;yUty_)9Hq5r!1%-LqfUj@WQ}lOmYk6%8wP5JreP^0V(g_`TQc%;i)<RMl%%%E
zDUOR`A&s2{AEbI*Ta75G^vV+6c#63}zZQ|=JQ-_YuOPEm4_94kDFo&gD07Q5kX`2Y
z`IquwKKk0e!piw|!z=x^lBLhR_UX%uL7uM$65+0!60kTXWU0m{;<OA43a<v)pJnIb
zC3MMY)rGIpqzdxkF&qp@wVQEvZjqd0#~3-KS0+pDMo(;tS~e43M+S?@r4O>mhK!D^
zDlPVs%#>_0l5xvq@!a7fsnSYqJ%J2#!AHz^$${QFflg>h!9~(hs>y{0jDTAYkH6dB
zVxxsXG|~T-o!sUGeQ~O~Lh<et;M^dNj^Ny&M-1rUAc;awWyQ<6ODcFUnFZ~I(Ye>k
z9ApYjV+q5MORi105llMY^(Fp`qw#AW&=Xva<A%ajlw&)jAhQMMEaOIi+rlBPlFhd#
zuUX&Ukgxvj$(L@~+s={X4pHzk4nK<0ww;(_DPpJ!Wr0G$L^U`fsGOk364h}bg&4!}
z;H=OxsYs{wu3d;<E~_?oj9nswftA=Nl|>DRrr&Vb=3+owOEYt4M-V!N->-cNuuFPx
zdUrUFRfAqR>;bP7Uz42*+zIpmeEe@3d?42J{M_vy5$k}iSJ}_9AL*#tz1tX}!_5$c
zjD+h?DYHz(*tUR;Bcm{$=T~CEAYR-K%0A*$7GprNyZ`c_Y4X^?%O=xKGdbMdf7MKm
zU%x%sKKOQDZUAB$eLL7A^;6K(=#IB9j<=3>U+grcxwrfN7uwLl_xQ@&7kj(MulWo8
z+++lk&HZiq;o$g0+j>o3c^mGL#=F1u9VT(^<f+l-yBf*FCNV^;Q79J`OK1*>FSV0z
zHRw}!8wADKr#0zN1EgR}g5oE3#cV_;6(G!oU>47^ZpwNM{RQ1rRf8hjex^5&z>{;z
z3M+b=H!p`_bvG`lWfEOs>0aLAEV%i(PlOw1E|wJl+8|uH8%8Cxk(V|3Y9ZR)YWqp(
z+lk~X#B*|{W|*nLSd|Jj72FHfFX^8Szd8UYBC%;aErXn3aS@1mY-mDU?SQvm8i2_t
z(v0y)8j+4q9+q{3*mKMrA)W0YcVs*%!*Loc5+efUQUgouyS$CqsVxO*Z8L1|ym<Sn
zVkJi$53yJc+DE;%p_iWx_WnUsaj|ClgwsD7vm)5iE^zo(d71VQYayKl#m3!T4uG7z
zNzk^DTRz)Ap;X9Rg&WE)t~bQ00Xs(kZLv@1j$dOI-U4VEcg2dW#!;NkH*uMH$u5+B
zWTi#t5xx6dQ%Q(>8wz@_a8;PO_(G4VdO<9XF&AEF!(d_N9%k4m|1`j+oG~2w=$$~@
zP(528v%Hj{x}0t~-?nK287w60ZE!OhvLde&?VMwk0GDZz9c;`NF2$~*?H9A=NEwbA
zp4!PC+l0-;;D$+E(&AnmI>G@JHEp>!7vTv6J(_yR==c&ki_>gd?J4&gj)N!j<Er+<
ztr2Srn%^prL_vw?Vk+4-EDL}-Q{J^2K5bqso$^?^6LY!FsGBFN8${xmdQ6-FPhIRJ
zJ4`hdk&mDNW7jnVaj+1vkj+q9UVuGJjRzV)X#I9ionzNtsvrh+s_lm`V-nNIVrG#V
zj%8~sItFi$aBq&svWM)n2?mlXj)rR?^og3tXQO}@)&&igL8N+pKgB5AjFgv@p>w?q
z&Gp&>y_w^#B2*L6pJMIF^)@#&$dQ_^4Bs)>x++m)5;CWnxE2hOF-7f>tgo3nMnep2
zgwd5+VwZT*Vm}>Uz^y#&UFE&W<&x>Zp^-6`lKHA?B*K7Ob|+gK)y{b1T&ktK4qZ96
zDUcA6UaRZU0^xbuLpyXiO0RTr+4(8fWStbpZrJT0dr$1NAy+V#DB`aV)E3vqeA<-$
zb4Wml5RINvd$p7s;sJX4H48dSB-~qjRZ|?|0q%&=9nVc{kk2OZepgBfGfeoIG7f=r
zpfp?p<T}hldF*oGf<WE|gTz9o;}ClnmMt#Um6;f!x(&(J{~GdXNf#f3hGy-4KjQ<M
z6!1xLz&YAvH%2bGmg8Jb27^h?RT-D)hk#;WP%+z5KHvhi>{SpM+I*w31DXc$;bmy(
zs->1cg(o@9`+z5=S)T3MAACsYw6Cvp1)EUHND3L549z?q?{Sg-4CKq9j_OFjL#%O?
zz5?r9=Z#o<F0!iZF7|4L#bZhEJqlB~{0N9iy+X1}Kle&{0gri}Iih&-@`+A}lY?e#
zpYGreFb9P*cn6qkkKq#KJk-)zvVr9%R&J0Tm4?nG=GgUqT!&o8Nh;mcf?WCB2c;pX
zldE<Ol_4-cR%u-0ZGu1rWsdIn9WYOT)KbPHm(z&RB{^iq?(tn?Q_~jv7KW@sW)`T=
z?@s%$9Zn$<mW=VIR=1|BAQW|EW|A!k6Fo$XxAMVEio7vPKJQOUt7<%)2!6$RbZonj
zdp$~7I)sRfpqnd}aBSwKlG8+D5rEER?@HpJ;=%<LK;AaT;R3|BR<h0D>yb;3scq2{
z3Epfno?A(_o*)lsp%}K<zS8QQEl`7RXPWY1_i~y9K1wcihDOS(bcE*<>D4z`Hu8R;
zc!JLS+#&jF^Nod6$RgE9$`%(icgfn|IiZ)<GFEFEE2pT4#TF_do~E&f9#17N0Pw;%
z-Is;kVRCTrCV8Jj;*Adko*!G0K&>kU2@b}c(jB;CDVH`P<$xi@6b}0XxH;?F!4VB6
zX*uJPtjjlg9*2IMB5m_j_t2?T(;gYZp0nFE9;l;&TI#sd&)fN1XvZK;TG~!$#l<XC
zlLcJ9e0BR4l5^!0u@}?+dw;lst1CN)#@qC($kCBf>Y5}H?{`w|M;&+W4Yxg3CW~TN
z<h0hM*bj4uW-JV0(Ts6`^z)513<2GXVde`JG)zZ^Zr0UY@3|&lX@n`GW@oQm4DX!q
z{Wk$kGLzY<&G68|NL`#6glbv>5WUOF36umAfo#U-(an=Ox`}WGprl$U&C~sZ?VY{N
z@650itCo5yfe8M$1&?C4Nm5d>aGjM4VG!<=$IX5}dMrS8K#0DiMPMA%5Hl^OEI33)
zW*%O{B`M~GE0PV1d9UZhRe=C?90!LhJ5gswk|VVMGFOqTuOtKNXKrGpT8=~LRkJLm
zL7?S~EwC~Tz<_c(hUAsr+9k8fb2SdcxAoYM%tE)Hmk9o}>fos&5npAz@43W?Bvf8;
zG~BRzElz6UYD{;GTx+C;naHJL=!3|mQ5ReSQH;fnOH{y2xsc>!I#!332#G=!1J<^<
zup^f&q#>uCDTDl40G~ub(>_;;4D;pYIe@itpJDDocM&l{?P=ZabTH+RZLjIdTJWf%
zVf5I_t3LK~w&D#0*0bp%hxw^AXbb-8GIrRqjg_Rm^9j3<M1&9<b?!aJ4uK2ij>zvW
zS}Z(_nwARBluKtS#)iWtBo*lmu(!e9aw$@hACFhlG#q!%q>2?nik8l}r)WQ_^2|Qp
z(hV3QBQwdfdqoulo$?DP;NE@YplV)|<A+gfzUx>#M5ZTgPJmoG1CGQ~Z@dw)Vutty
zccf5R`AN_{-F(oh#u>wu)}67=%pfPNGut@bRigF9HVf9@Pe;fNai$x0yxDOerC}WT
z2J71NU}FxG*){-s52T}&z$G`<A-lG5Pc%+$Qx1rx+9@VT*cG>q*yjd?W^vk)%M{S8
z<oJ6-_E_b=1tka7WP&(`1$8pAFWb7fkz8i({o1aDq`A!<Lw9d_2<sKg_$+j&<E-yA
zljxy{ZYGmHXP=lDWivmb6P-N}oXE(c-Gx8aMpFi~6Z^3RR`HwQKx{m4DexkKSR`m%
zL@BmD$#LTSVAxkO^^FGt1LFufuLg7s3){yQljjz}BMX~*jbmeQJh&n1paf5hftWK_
zfk~^VQa>aD6I3j~q3ZvOk|re2ConV8%iL=^D@`QwG?UfGZVnoji=A@{ccy7A)yF34
z(h!by<w80vV#7x<xW|MfQdk*7=9b3T8OFNQwNXeIhB^6Bw>X};xOuHV`$5>DtDkdr
z-FQ%4>u4TlPH$%S0macYd9PG36Dz-jJ!>{?IG|81e3h!hU40*Hm8ZW2UwJb)mehEh
zeN@O*W^i$<k9-ALj#6ef)O2XS^@7$+1kxy5^VU4FEK%Pljp+IMQ5Y}dik^Y>df)0y
zchtoim~WN8`vO278q6hldsW6QQ9IdzRYXNgyXr?41T@Tsgm4+8Dzk;bl)12!SZ6uQ
zdeG$dX2=A_(<nSF=z#h)E1BC8z2_Z$bE6ggPVcM#3WmLXzYM`?b*b4fbXr`<?erGX
z_|v{9SZ`ug1<ZFpJg%HqoXBl~L<L%_1xAYs4AE#hv^=ZBL*h}s{7Q@uF+hA%U87u?
zSP4{h38`BruG*^EO*`gU5$BC@o&hb3sC3ee8>r~j+s&iR{ga&?X=Oj;lyJyM6b4?$
zQ{L3L2F<b><a#Y1!pBYI$22`1o5Wu_->6w>g9x_3dB+i<mYdylC@F59X3}(JNU(!x
zCag%oY`yWK+FFJ2%gWO#cx#47*Bs<SQ=iM$q>#k9WUYE-kbZ2TmClO9VJJ+1mKWm#
zgJlSI7`VJ7w#-Q);0&v+f3XiXT1gfyhtNz$ORBfl_RK%oS>bT9&Diq``5~ykCUT<Y
z;B#tY;gL!hYxR<i1R=AH9q8?NArP?%p(7OW7c4RslE}HbuUJM2kdR#I0C7o@?23ui
z*(~~qZLT@TLYal7(+^&P3(^lT4;oa?IeL~!W4+*M@fE(D_@uBOG9NHmBED+D@pR7o
z3N7Hw1SChrmzneP>X1L=tdbKX2x4Njm-8?@9GDmKX|^{sn0@z9occk1IYyl`vkn7k
zBKyrLZyCfAxtm+iC05&tNrd4U;41;lI7ze@hl~SuqPn44d9`52Y<q!ICicB1?D#1!
z)Ax$x%_5}Elxd!3Aj^W;vJguNYWL+>Dk*D$V8%)`H%GT!Y33GS^)yCWYvv^<Fh5Fm
zQnI+ed9oyH<Gtn93HDEQC&GK#enLA&3TEUXN)D(&serZad^`inf!Gwa+D9-~F^PD3
zmtDzIQv{IJHFcGOmwS5xC+(<uz_~_5*)Eb%CLFM1k|XP=+f}o%192J_@UiZPu$_~j
zMk#CxdbkOn5uWL{O1+%W%16oLHveDURc@-Yy0(66ZcFmb&UeSj$<gN4H^88{Q*Mi@
zQ{Zk=c1g|hu#E6VH;h^)ybz;Z(Pm*Iwn+?~@zS2J767e|vC`Evu1VyqG!HTyfo0Pb
zz$A)Dd-+F3V4(9i(^{4I6G3Q-=w@Mt?4A$?%bCs`jy)X@c`fqN>4dQc$mrKWj~u9*
z3)iKV4q2;Z&x62TaX|k?R>{y|TcXEY)+5c>+2v$1DmRuD#V;?GN#M)7<+2t+z;qgT
zZvegsaGMI`ut<*bSkuJ_`jEZ<nr7qN;OfhAIxy7zGsW@kDUx+vVMB3_g&@+oML_yl
zLUU5#lRL>+6>O<gAfKkhB}T23;vz)A4_h(ic(0#(M*30YIrfm*LIm&zER_*E(-;71
z>oOzh7vZagga&CMXbK_K>Yl^C!9{Sz*RN})zS6j+7*9RFhR1iFO}c7)5dUwezf|3o
zHwDL}F7x~x^B>k6%BnM>vmA(0(y~cEZ?N&uJvmb}+6BH1NUn_sig${RH$%UH1aeGJ
zHZ!NAj|W(@&hq}ogAl6WI=RX;jM6VR+fl_z+fVa>PH0GGx!a5$zRRIt7yhk!MR1>$
zr9?1end_8Iqk&GRSTYnKKR=KCIkLJD3<D=AI=Bl-MzkfLMNq%GEUZgcTz|!UL+P17
z`W5Fv$S}_X=b7p=204*isrrgjW8xiOEDcN4iDIdl@&|hp7FCxz!r0K)rKOOj>_?ZU
zGIwDapF%D!K*=i?_^dQR)??zG=gcPSfaRUuLT%klMhq>>I-BIu4GJ6$VbJ!KGLwkw
z8P7f&(?%!ZoOKa_uc9fjoh$b>T;i?Oc^5FX#3F$vzR|uriS2DI?j|c4JQ4=Lxl@HM
zQj&JI-X86qe0LY9aE`GPjL{7>|2mA>5iKRr6C(VYoD@8r@E9cJ2QJd_wfNTHM;7NA
zqLnqdhV#c&@pHlGsbR{V6(1GhApq*5HO3CObgWU->d6?YiEFo#1$OPMM0__fJvM=y
z5wCe41DIQ=KZ`>_{ZYD8&;fxhz*ZVm{)zUj!~M72CW{)`z`0PWZgB)nvLFd}*_3ud
zGkR-aD3dgYlnuCs3&U0ihB=**T--w`&@u0J36v?hh_FgA@TV3U%rhNcOmS|V^@9Np
zF&9%Qoz->qJZ#SFTxfgI3&0InV|A6eD2R%7Bs<U~ib{r8(r&j&PAA!xgU#r#stF-_
z5QiuI^M^mOiu{K^2ANm?{kP(*-1q`+)UVIa)90%zYu)wdYiauYxi1zQq_A-g`GOu%
z3vSoqP(vVPRK{vobCvKM4s8ulUKkdV{D{u;!VRm>ddp-GwHKzSarU}4=Q<-}wRr7I
zfkb7cmdGT`%H*;=tkK9p%o%K|1h<m|NB$~%RNkPjM}Ti!SV*>wNwtBQp=cF#seKs@
zL~L$B$tN}ZShp5csd&A!w|C$)b-pC($x<Zd!c!DAFT$6T0yx&&r|=Uk3JF=cwC*?u
zssOuuJuB)J>VKHQXa(W;kD%D_eRy`GMmmZU4NFfU490>3-F>zLL|SX^QRt4D*KVU4
z@uUjBzA3`>a3$p9X$w}crZrwsuGApYIS-@-$pwlX6JenQ;50a`T)p`uscRyc+YTPq
z2YSh(Whin(fA~^q<!gGFs{`?91?E!y-csI9Zo@OJ@EOeh-5&eHAHT$;UC{CT^}JV^
z?&9(SVONIcU{BVsnU)HZdrZ?|MDRay>QOWKV~K#!KbCBN;_u82D~*L&Qn2d>F^S9*
zBUz%|l~6$g_MHvHGaW-V<HW3NwtvJsqO5(kGa*m4;nR44bH|5ub*?15!QuAIv<HN*
zpzv#Wc1BU`AerE(nL=fqX$)LZgP1FH^!IXlW<z!~6<TNfW#+kFj+l8#_;C<hjsaKD
zX4r!$O!vlytgI4?!xxf}#-!5XRJp$&@4VuoOlJ3=|B=XvUQfzq#Wh|R{=jIYc$=eT
znu}cH9sYoIjIi0YfS<)Ms2Tx<Ob};hX;qhB7Rc`yT|PawT%@_cuXCS<h3`_(r`8`O
zPbo?M`^yn3$Bl=~6gc8be=zM*H@8Sn0|8)=IaSQ>neMtgKNdfn<NCk9kOlGNET$SZ
zugW`TnqtlFqF<b~%E@)#-RDaHNEHG$d(CdES-fP+sJ9#)Yp}Ex<Pr17&(?o`fs5Eu
z6TAG<MLaXJ5O&72#&<-m{`>3{*NljoIGmm>A5YKN_o+3F-OSI@L>C!t-U!VH=3Pdt
zt<Um|%1pRk1T*pPekS~7|Cv84dUyPiuRSh+OpMyrR4h~bk2NKX-(9uX949D5pU`9T
z_28Q8i;BySUb7%SEQD{U<H@<<6LH>cUoc}raTNlez@%`1jvTXJhNDu9vUp(5$5}tL
zQg<$Q+Gw$_jC>NPd+Om31XNBR!pnNzLZM>z%$71iHMNj%sTt;)-Uw|Frn%P;jE?8Z
z<emUB*hDxd^81<0XXPiSF-$IF$d0C34PtE|2o|f1ZJu)A9Xt^rh^huP!ojsK(i-Xl
zi7VzAok<MhLW^S(fBf-7=YBIKC00&Q!a>_^U)ie9-%FlOk~hUTQ-`1w@tM@X1v+w-
z%1;KK6ZF`Vk%sQkk3~0Et*U<2U7DD4m?+FzB+i@eg`=}3iGgDQ9UU!l@nyBsOhBEk
z>%sowZd(Hi@K^<$mnvZ8hM&@==idk)J#WtRMb1P%jd&`?8Elp=5t$+5STjT4Fi!!o
z%@U9%7%7UV3qkVgl^&>3LLbPE^|p;T<ja+(kepZvb_vWgtT1C!3lbo#XpYf3v-vQh
zSCeJb!a|bT#7Z$p|Cm&_UT^Nd+DYE*Y$5?KMs(uS7oF8yvFNOK@^n3<w^|{H?Qxo>
z$Ve)cK~DG@gyC&BjS%@+RFDOJcEKEUGs=Y9?}9es^b`zOUZb~K5T<m2rUiVl+M3Zo
z=4+gI7zP;y)@N#!nk8aa-gCuVmN|3e!?<EQX*QntnQTbK=c^)8!x=f3L(VO=!JMx3
zld01v1FD_OeVV|T&T0HLw{n>xa%mz_yk0#E=0KTI<3XU4$f#!~k6lqc4$9VoN6LF;
zG^tDNQSnz;{=`?f^d0~|Es7YeGEhG|pCGnmoL^i{yydG}@KsIMXeCBa8uc~r?%W*D
zUZ=at&WJ=NY{H)B#!I_gs2L6K9lVN+DSIfy0wZ&&IOf5`40|EBL`OL2tc>|DlQMv>
z+EJr&!YT&LWL!)UiE~-N4pn*2S-)Te0&45*y1pd^5A{w8hh!6bb)++Xs4zn8oV1f|
z)@(%!QO^twWQ<Zj!wUo+%dW9EGL%`nLDPniV2<n|+Uu-7!z{ivZ!yqH#;D-O$hKVm
zjhz;*K&&ky?iT~997me{i%05m)u*g~rc(Q+mG+@SuzJs)tiB+`OM@~|*pXIQunVue
z*q!r_Tu;P;0lb$l=nJp$#GfD>cFuXWV7BJ+vXSb<O2-3NhMEBdZmp1Wz}xH;WLxJr
znl;{O1~0)7jp|1$wI+;kL~X%`+Ig5xA$5$6BaqA<D6_*|pjDLWa;O~7w=c_8-4(lU
z4iAn_Huq0Z+i_>3qCLwdds0Ec%N@)P(kf|hh>{H3J7eu|ZJv=0nc>H1w5s^>q-ZFh
zg1j2Dv7GmbPr;qhC_)LboouO}GBEMY7O*$dY#{olE@F|-WM)M{(FWPnc*b7mpB0i~
zPm7$NZje?UdqW~pt^$K&!@}v^EIPP5o<U}_5+<nYr88v8g6!zcZO_t~1WS`z*^?7C
zufd`r9&dR0yeQ7#-2n*zr^kCZG-I7jlnQ(YKa5Bp0pNdtY0wO8^LPhoOxbYaU?}Ze
zNFKpl>@{_k=^nL{<2sUSuQn6&lZWhqhK}$KQLypDj9zXW+0G&y5-K}39=HXadCU)u
z3s<^15k-JlIKv02J}(=qHJYB0Y}TqxkMoL!1s6&{YiU*ySw3;3i>wgn^&82>m=mo0
zKyh?ed(EpF==+eVKNP_CzwNn(RtV&PS)_j;94+3@noTtwU5pjJUzcX3Su=V+w@xB^
z6b$H5Fu^JVID1*}$|1X(<y2tZQp+g_^OLMHe#{CY6j}yU`GuSGN2Ob8x+U(3@f$7T
z!ZGO4G(M6NXwFMx#lJKQgv69qao(c$wa$u<ZgLH#t1XdgNTt^Ut|5iSQ3M7Otiw<a
zSdLhqU0dNs<ESD@DP<^BqOVJFhCl%5GqM2NETIqEpe;b-Kvk4SQf|b(lG?F%S^L??
z@NktF1M@!D*Zt$lHSV0LZii?}wcv-U>BDrubv(Cs4v%)WHcxi8HA(q1CUQ7nlJrB7
zTbNq}9e?iqy-sieA7va<jujaQ0GkumoN*{NgK&7GI57uSLQm9Z_Ik)cFYbITPs?*2
zgRzaKW8`F%pA*_6Nc@gMo_zksP>XWS0>R04lOO;vc8{cAF&(2BLAi5=7==L;NV=XR
zY%%n^#L!6@Ao`6R^e!eepM(ebSrC@58n?(!EfKT|W`C~wY;>z&b@k&=u$@rJjnVR~
z|7XwESI)aDtG&mo>nrPz*H@oEU+;9goyX^opJ(*#?CDwdr2BX^m{*2ajN{21)Wmy1
z6ttIc(3_Gz_`;Bt8OYK><*l2#r**a@=rOPvM0Nj$uFRV0#|E$`m2hP>)RTVjQt{!&
z5!_vncOHQ37=&c|E`c|+-S>8P_D_!Q5_t0<OnD}aBS^aNiK-5@vLdmEQFsjvDV6+?
zFdG4-yR-%GP|jy-EP2;eIujts5~-rq@w90gN}+ZS6H>k1$fEsb$K{OgIx62+*3T7r
z#J{D%85gua*H*b&rQw=$ui=ORJiUO#uo^I$0E#HwH(dNt`RsvhTsKh~j2Olub^-qD
zOa|4Mk5a5nO2LdZ`>3*XIy7zikp|b9#<3wWs`A1uDQZ#$g{z?i3Gprsmr0|PoJmQm
zqYz^tX-MtUsOw{OAM~;VX(08HIlODT$pTuA6VG6QtRes%{1=SAR0pQP!H%-6WKu~4
zD>%eo&I1FA60wFM;<PiRA##7T8SC67ye)aN^XA~_yX4L0{^qNlH?-I8R@E?*THS0h
zm?Es#lW|PEK7sq}TJZdQIe2~kCh~EB?(AiO$j@?uPKv#b<6POyQxLzo_Iac1x}iCd
zH?`!lVVPL*cT)HtO~O~qzCa#iJx{m0zKP{BpMz)}c~l>d>j9Px=4(=fhDLGS$6?F{
z*250b<DHXcvUm6v$i^DqU{K<++Z6J&@xZ^1zZeRu_bj8iS34)OxphG%o|>Q7ZWw~J
zGZt&Ick~t$viI_>gu)7-b)gfYb^4+;W{Jg@jR`UG!^umcb#gM;ZcqfxV^3&;7c<bH
zX$7m+mB%b82jwlMW(CcSQtT{?sGVr>9Wl%X7#C(kXIaLHacoPm!r35ppP=IE78q{w
zvL@}j*j|VobYwHC1R@rTk>+)|sC%9j^Z99<b<p{SgDePffO4%Q#<Q@!vsXG_zcyzt
zb?Bx5g|_rIAv_;=Zc#LVP|k&shZVL1VFf}+ZnlEmAw>W21c8hBjccdJ?38-M`6y1g
z5kg|*HOCUQx|`0pO||n=vB=Dz41m~DH-^@$4<KI}52~xbcxKo*c?dKzv*9CBU2<$!
z`|~BUIj$1%X7kU=T@MfTcDKIUfXEQ>1wkm_$UD#Et^~zj8*GG8{_UVnC_l=EO(R6F
zQdv5)+5|on$OG$Vt^RnLw7yPuI4wY<T}MQmAM*kGP-#auMfYG@5n~d}w4<DJHrR=-
zF%)rQ8kjz((RS2{^IJOc@;;q7zhfs}#+}e0V0u&?_{c`$pU{9MTF-myjZZhNAJGee
zisA3q*cdNy46_tAGJBt30+Q^2;?XC2OUx<UDM#%H{9R_lW}T>MaMsKsoInL{dZqHO
z5H0w(!~pDZw((Kcl_GI(CD<N}J-q&sD;orNz;gpDC6f*A2D6Ap%*MdkJh5P9*cO4Q
zV`E|3N6g>ka!^K@14050Qcr4F@rKNS)NL3`K9{1L=3)<(<Q~ShvgwPC<~vMQq6usk
zq8psbY^5nPEn*^PW~?%)st&nV`DssKxwuc9V{`4TCK4|tWunxd%BR4Focz1{TSv|0
zbtnZKzun(G*ylJ=oN&h^7AK3nsRKQf2vV!WtaVd%{=Bo5EGlDTolX4d0XoI-+S@Fm
z87Ot^OCflz!P0KT+)xFsfOZ=~cb;5ez8H{RK~x^BzQb}KjY*JX1;Slo+^3j=f~$*B
z0w9hX?QT>qbTS>Xm!IK^MjSFe7Qu2#2mEz=PE}+{5IoPFoCupuh_fOBTxyB7n#MoY
zjpb8r0^><3F-$C$cyY+_a?vYpuF4h|DIY8PH!Tz6ggK}J_?L;aIxDE*W^<?ZQP$Bo
z#$hrh$^l>C=+mM^N-oHK>+o$mS!1yxRn16DCj7iio1sYf)i0HR88djt$>_d>sKn2@
zdJX5(p+^5?{Q&aOmAMqJPP<_Rm=xFwP$#zgL?`k}hiqmAXKN+_Iw4FF9!82mF$8#(
zPT6ET<L}Pe=N}PtIRk<-I|Acn((3{?6OL1SRLG06-1U{@D<S>qz=O(l@T>EOpt|^1
zK^bX@vl(X>YWLE|DsyhHZ_&lHD;PJdu|@b;Ler0<lIoR$A>#JYtZXN3Img=KR0_4L
z^K}MgMFV6~2cgV9vUJGHw8Y9UpDm{KL~5J~tC3TWp_RS+#32f4z=}nF?9Bvq1VBYz
z1U6k>dkar!pb9xe8gXtYGdHlV2*Z!`jcY-9Lhk;=rT;5M!o6?OEb<d0yAjt+3%~$C
zt%4v@jDw8E%MhiG2Bn3GeQJKZI?@G$dS>U0*<TdQL@}Byb2yqLta%SrUu87xA+Y-3
zAvCLz4U5fZ@*Zg}$eEr6onETKsX2r+*M)#49nK4{nZxTwdZ+Npfs{Sd32-o@Tz{T)
z2aara)Vt_qgl;zGq)HS1b$u0Nk-10}XOb61$}|z1>`s_2&>LTmbOJ2YKt5<Zi1a5S
z`{NKWm8VsTwMV2N6cz%jX4h=+{*W0%w*eb88>(n?*_pn1mYhba0f+%GbHf$*y37^P
z*4Za}v%5V;G!VYf@^`tyE@DgMV3JY=*`CiDy(*+wNirS5CoQf;mE2$=G=-Og6;K6y
zVg-EAj?gsQ$#cP5yx>~lP5fCY&mtpS&|o)}sHyn{i5r02U5<dDk_)PL|5|lx)UxYZ
zwMB%1@CG5J{Jm!9#iQ~W(aq5PQ1O$nD(c7~3b{|mZhYQ^<G{~c{5QwknkR)}Enu*o
zIsNI734m{O*xl={RcTdIns~BQ!x;!gFy<7HM~E?W)$JY))s<f}Yn1D5)GFBEbRY+W
zYdTqd{BPW=Vv_bl;Bq|H>$#)UOotlc5meiqnbQa(T}Qeg<6m$wE)IW1%yS@#&H`gI
zr4E-^@v8*R7LCb4ztCAhDW8d*etb-82DgCHi#@>^fK5nhTACWqdnvH)ldO9=)c7_*
zfuD$sX0xO-uoO;f(dR-j0`q10YBg)3i9ijX8?E!l$l97TALh*43Q})fBqP1tJg^}D
zmb|B>6xF%Kh@9+g{^xhe%cGs0J0X%h2ti3WLG%jVaoBe94+700CCXGAIv8fb=Eec9
zCu}NlZ$fTnz;dQN&dT?4hL<udd3*xQ-9Sha--NTphI)jB$k{P!MC^k2oRvaetDDtV
zwS^RrUbn4qC|Hn{Vav<ecC^;3G$w8gwg`wts?s?Ns>EG^_~W7<v~KKBBQwV4k{STr
zjC~UD<t%oVaK0TZ_KS<t{iVo*%S$x_&%wAYHJt}9NiQxSs7?&!feq8d#hB+vRy&&{
zGex9{V&OP&8Y`=cyJm8WO@y&3T-}~<9?T3W%Wvv?h~QzC1A*}{_ZJ^3is>~hhK{H_
zNqORI_?m2Q_xE=9zeyIOM`-?+e7qIcH!ECh^2<Ha*f;m~G(VUB+<p;+*Vd7o2QTr5
z9?mfwnPG_X*pe?L$P=7coJ#E6G~_U#iKacn><H>@IT%}<QI3W&3jbP+nu`;qWsv0l
zK&0-bO$etd-!O7F?o{I_TRt?3RXgx4&yYnwbe5k{0K8w3G+mtrfyl-#>1C<Kk5}>S
z+CgpFiu2aXbIhFz<1Q+rP%FM1#?>VNPMtLzqMN`{XjmfkTit%4@hv&l1WKNIdAYoz
z4B$j07+(x-4AZ8$*^0NKah+!KE$QG+$9dt)!5s_(n^#bjQN5zUN$mepgH2>|C^eNL
zBu^Gj$3-!4FaT0{z|>TBaWZOF><^TdLZ^_{I(XsxC#R1BhNRw33dDNPYy{pJuqhvW
zC2MJZ=g)_`M?1DXmK=Pgv0PSx9aal!Bm{4tS-&(kgK;2rsWv?8U!Xo9H^d#+$UB<>
z7d+b8-+be`$0C8!7gJ}S&v$7_D~5#B4LLmRdTy)aHOx>NiFj)|CUOa^g3=ImflY(_
zkk|xudj_wsm?0rt9`BrlY2OJXqO5=J(vjFI+wZxK8YZ9f{|dTS$k(|0)|j{Q_(vp$
z1uL_@lx$1zccr#oR9<*wDMArke6;|(>%OxbsNNIyyRw~gpF0tw*3l=bZRCT?gGz|b
z3+4)a^63+l7V_o1ywDTC33&kr(nFIyVDA~C0_QweHe#X3^Rnxi>a=hiN!UOc@SKVW
zq1FBp1NiobPKqP36?Vh*LHIpOHrA15odt8A{SqNS{q%=xoIEXjakeXzFQ{A*8Gq(?
z;n*lmhHIvx@+INXQV5|Y%F1KE^W=yk>d4a^yTD=WsaQoLWH}B5t7jemX6{13<TORF
z>S;}Hx56R9vC3(odA;D`)fT<a6D)7I!-O`13i2D(8Rhd;XUB^iO?M!R#(|>AhbQu*
z!vf^^^E8lQ#gq}rv?d{0bh4(r#j(y|0fz4(82p{ZgLjh87Dkf!wDNBSASP$tcCMhX
zXh@=ZqHNQssD}cGqI@L7t(`k>b%3kyDj)}=0j_)9<OO7O%O^Q`eYCT=y|c{)f9|0J
z0kMf>acHUt^vP68W5j1Kqf`u6b`Rt=@2ZN0)25V`M0eDfAd6_SAPW09O9VCK%z`-B
z1T~G{;+%0;CSg_M6~#7d@iZEMq`<6F^o?aSwmu5)32;TJd-fi!?w2W4hL&(uR{^~f
z<7qn0-p!yy*>iYdKFa!{XT+5#Vd>XOf%1$Fmce!L2h-nJ)BB`yrOT*yD7<l_wEac(
zZ)-{u4TbI5GUQpig+fztZ_pW1d_~YSACuYm0d1lQEJZjb_=6Fw)>BkY3@4~R-Kap|
zqaWsHQOJ!Z(h@b&LNF&alGH+u2Mkh~Im5gdn+=hA-KDx<vXBy(sjoaNFH(+Dy#uHC
z+cGjWCC~f}(V`74I-jU0>yK#CyO+cOG9fY-^6t`bjPRLm!YYRj!<Ks-EUyc{X$ILL
zOog_pXBiK{XOGdj_g_<Zj?VH6Gm0U|jiwxS6De*IVx3HaG-;`;l@F63Ts*?gJ}zbo
zKDgkR6xPqN%q}3^Fvn_RL%&ur|7$U!H7gA~v$YAHd*Zj)ZY0SF>}a?N69aU+^#m79
zBQIL^<az`t9$Y~5tT1X8lI#rw&&gamm5UGzyTt14&=WAPyR@P;B?0Hg?8V{9n{Pua
zL#p#*k#vpny6l=w#8qjNz)r@#bxr|S;8m;bISWWV7t9O_%l4htTDK})mfYp)GTuX4
zVppAaze%X&wPpSIsc!X(mb{bBtOvaNri!g;y^_mtt#I8xx9Nn*ADrwYoegn=&FM>!
zB5CO_hz~$?*nm-^sU3|r=iJdv!)P=Zc!z7`9XuQ-$5Pnw@t&-nE_l$dRTl(kP@j`b
z0pL}GSI#OE%c+X3vy2XTlr3qp*2*Rvb-oCTnW~|~?lT=HIAs-*(ydnm=@mwMsz|X`
zJn3pYkBc}~>|NWc9%vB>HL&+{oOn>}hknRa0?h}=8q%5`H%lPNH#<lBB&MQbBhCHE
z(ZSv=G6)2agP~Mwt4pH2%+>cOmE2q{NO6p@&&Bey*)Hb9E54~Gl{RHb3jv@H;Zb+&
z=!pme3*_u_=892qQnce@a9V=Bou<9NxoU!zeFW{!^{F|7W{{7$9!*s1FDZr9YCI-D
z6$Yb;^RfokFR5Yenzv!9TaE3tSliOTkDW6wzEPdXZ7r6|R4XF4P)QcoJslPsiZ~%5
zUu<}hUB?WHCZxqfXkkJkJUDO%c~tOy=<Ws5@HkUwfdL#eOB-nlWznA^*6L53^Tl#b
z*m6s9!I%+)k8*XkQZ-jkByAqIyu!7mhQ6M=V$WD%V^?u1UR{t*BgEZ^toNw%Elxpk
zYLe31PX{B71V&JqoYyVH!CU%93<6|UpUL$o03eQgMI+>DNd}54h3VWzkJ__YbYSW6
z;so{A;|oE)LX1cxgkOgCk*+pwh`16BD+Uec!$+RbT*7VJy2uo@R%L!*hQqf-lry9m
z7O#o;r<{c5cDK6m-wsD8p5D)J2KcS92#!83iivr&M6TW1JUl)A?)da*=lJ05(bf)~
zBO?Jv%d-+Oj*Lc3Tc975N|t@AjyelF>ScO0p9m2rQhT0PuJOPQ%5oME*WhR36^OS6
zYXEwmn#Ak&!h}zM0gTh16u*QktdTC(<??a053gXhlV`}#sO9U%&sjc!I8Ds>a(a<5
zF#XL8z7d`Jj(?v7Exo3el0!ygH}2|lhZY8D?*pAs3lbDZ1h&9V>4h*dV{w_JsAXw-
zc`#TG`gv;oT-FnONxk%W_mUU6)DRL8FAS1MEUxhPsSmSsPsO<C3o^kAO=dPOI4@w`
zs_fvg(CXz(KJt`>R>i>Z;>k9rw2R!2+F><<8ha0El5^{dZ#68<6+l$1c!(JzgB_uz
z$VTXulVu(7Pd16>MEupLglgU-T}1%PrTuUkNHB0EKrcrcj&b8B**rYl+22kM_V>O^
z-W+W2+-9w4#EPXQfrQo*1}QC_wS_@shFnnF_8=!vK~e|<6LYP%9yoRs`x40<WjPJX
z+aE=%rmn#eS7j&ef_)(YdJLtb_5Bb?i<CF^teji?6Bl+`48?<n1M#&m7>*rfRjv#|
zT{lOJEq?(0<E5f*z%S9~^f<#ekXW#8CWD@+sD$)yj32_brGfWIxR$i_N<yqx4O}b~
zj9BMf<5avf)Rc#&bGd0kKQKry`TVAYv+!8=lF%rI5cd<3OI_C9I0cSQS5Rui5SiMM
z8_qPxLZxP}(t=OtQF`tbLyXT^Je9C7QP9^GJaF5>oh1<#l3&G<4kV`!^O{182QLLO
zfBQu=^@awnWi@6XTI^8r38@xV%1!3JB1fUPT%=b7vB1v$Pj|=V6a~n}4}E5-lZ$Bz
zWQNSD(r7ZSgcr|)APNU}UW0u^e1NC3$I7t?8z5QB<yHS_Hq=5Q?6WX|af8^2d$^qz
z=L<{L9PSec@X8&oPC96EaY;OrldP`-%Yj?VV_8cvb5EUFFLO>bun9HDDDcl!DrP@7
zP`))TX(ehpV(O@K2gerBFPt7`TTpcHhNduPv3}b9>a=0$riUU#$>#Cq;SJJx5OqnL
zJCM?QET8jaXeLHqlac9N-ec_RC&T-da^aJgR+CC)hYj855<@Eqs2a&!%&a4-uqMZB
z7(GtUrI4pQL)+Y1;yXD)9kd@6*8`*i;&<u9uM6o<7Obs>rr-&s?4b_?3<l-m_zP*q
zVvQOP)bN^GE%K5&2v!$3`Edfqu6#pVVr;5@`Z3W`*mfd%fMc8B8Mfi4JE9d+DQxD&
z38ecoG6-{2YtWItcp7v^b6^4E;xa|?(1^qOYOfLFu00TF{N*qmk=D#|=2BB6t-^6}
z5~vWS1^vWMdV5e-4^l55l*t+7oK)*}4};a0^?bwo2Sr2xQ4_M7*z$w`@h)Q<Fb^UY
zL~}&S$PaB=+GP@TC&H6j!GK!5Y(P`aj@$O-WYD+N+9?N4YyTYuaZLneD?;HsvPSrm
z-CVgd(4LG(hlgPxAFBLaj9pV2JsK!QSUNFW+mW;wUY66JTEJ^i)H%2`&eSKN71fk(
za;eN&NVzh&TpUztrtHT6J=o+@iLr3(hG8!_`e{-K>b(&~$Y(3)q|Wwyo`2M+DUl}4
z(8gPrW2b`d%KWjH*K@TnM2PzV!kmsn&!4xXb_Hcx+}u7mgr?_0kk91I#{nxq{uPwA
z3I&Sg!#odH8sEsWhz*`&H^g4A5rHm{KOg#R2}T`)Nb};=@#dd)u#_)e9qoL3w0p9n
z$GhBq;cK>4RYh$?BP>LV29+`0Nccc-raM!g!x1tBwuP9ChuH!f;YS>7+=VcojR&P_
z|H1nW_9vV(mg9tRuK60E^lmNyFEepf!0=}AK*^%9t%gUg5(+de*(bz1FT#xeqiM%t
z@L3=wV<D`X0WVM{kggGzR*9(Ob4gOAT)L{bNdRV$XIy(VkcAtKVbKbvtyQ2-s2qX9
z2sWpaLS$9@eU6CJ4*jfVV@>U8EoG^P>m}oxD4gEF;VR)S5o#kEx(ay_p5q)Y;u2S-
zC8_wJ7Vks~hz$X-;#7tCn~r@8qSs=1(ngT5?yy!wGLS{ZT5*<{i~@Om!@~Uu?ONn)
zC^bQ{1<SO}@D)n8EKyIK%&XR^rJ&y&9AkyKB&sxXaNY(xg6l5gHT+Si`b?7EUCKt?
zR9T@)S5a28))DfuDbO8Zkw!y8PhD0azs|INH+f>nl4gm_W#=^>#DJS(2XM?jZXu|c
z7P<$`Xw?Xlw)v1&1BQicqY4zq<*Gx_bv*Vp{*aA}YJFH&9>vixy2YjtnI`9IY~YR-
zN$R$BT0!fmd_Hp><#>6@o~#efc$W?Rm=%vHOwO2)PNpSiG=mF*o-dMWo>n6zWzWrc
z>#+EAkxg8=gEOhqHYtK2Jz>u2wbHV0!9wx*5Of<|l|`7F#%Xy8Z$KDSzyV~8Kf2C?
zbJ}LYnS+_PSt{S8E`G(U0DVyWJ&Qg#!-0r|ozuRsrtAB`it`!k6LXbbUuUND+U`=Q
zlRzZZ=$P!IMbWt=W}Tb7^a?gtvlcHa%nzm+1(Cd*9pw&)VR0pvEv;fyVLx!$s2DY$
z5~|f<b>0H2c93c3jv&w@y4vzhdeQD03z-IQ3wxy0Bi@(5Cm4AQGN4nLtac&6Z(MD}
zMSNKT%?GJpH(MLZ<D_V>hD8*=uFD&(N#lWL4Fcg+OK}3?)eE$9TUD%bNxqf|hm;qs
zhqo3jh=|VeJ@)oOGM$KkV)<W%@qQCiqySDOEw8%b7G)J~f6(T1Gzny|yw~ezQM(};
z+bpTJBjg#W!7`G{DXOZ~VF9JRz$W123D;F~5~zuh0XZ5E;t{kPHFTz#Y~KnfVjbge
z&WaKoEix4I6LoFCc4rIEc74Jbq^Z-&Y%PtH>wV{0=|~|Dk$50>NsyQ2BAWLtq<kE~
zMJa{P5LD!)d1%x>q^04Ae{aF6@4m<LPzm4pa<rHZ7HwTFUvV*{;~+?$ac|Y_<W%B?
zqn+*D;{|5+W5c{cgCfMh1P(N17cHxqr3P43+RN=NAR_9WtP{;~Yur0)xe305ksEnQ
zZ#Olz5s686F>=32KL$0d*jB<3;Cs_F5kNGySR;c)WpBr~L<do1?6`@%7TSv0j}%?A
zroFK<9|ny$Vb8t5fZw=zmo#QLQ|f%?-D2f}<89~HT$5|exT-w?rhcYNH)l}1S%u0q
ze)OAN&G0yW{q|)0;M@IV|A3XR7%1LA7WH`GC;?Xj$AUPKo#iJ+D%Isu5E8KU8opyz
zF&{X3a%t9Wk-?a=qNiHBqP(0UtN1FaBWk8|&ftifR4@mN=x2|FOF`G(**VUP+QMoq
zKm~?OCxH$jnX!XXLR8Z*V@+CXTL_hg_^gPf-Bq{p1%(kgM~4}8$FGb4SwN=0NiA1W
zfRw1SKTTU$ua<x(J-$=P(}Xv3vbFd2_+;nkPCI9xV=|3By2v^ai%=C)N=eaBBCNju
zm8iA4mqnqdOv+Ng#?bcU9%?WOVN;?{D{tmZ97tWk!#+OCL-<*=vjeA{3CI%GsrR?c
zC!j~gj^bwoFS+C#Ap0qfpkjSgjyz-C68?kS<Dp`Y!D-RUwZQcyS4Wfhb-|JmYwC2=
zvl`ekaGssE>rxDe$Q^U|EuppNhJG?T^eO0!oovf$?80(RxpayMuRV@nVk-iUE$U65
zj&!!y%zYR8D3q1jOv_y@xs1WJo~%86&N%gq0~`(w1P-#-4e#MULQc)O40N+)15Jm_
zl(pP62V_p1U?XN+k!*lqfjQvXFgz_TbJF8tGEbBe&cfz=^sr&r2R)64iYqM}Lr1r0
zvgzVEc-x>C97mga>`Bp4gH7PTHb{I!Paq*RB!#_Xdt%Y=IU~O_8kP*v#4J*(&)bVb
zkBtPE4kb$gW-6u&HX7hf3!+b4WDBkch?o2!ldwdpWj!p;+@-2HJQuDrZxiR?5G<Eo
zho=EKbV>;zg_V|X%;c%5%!r!Q?5FL0NJamxz+ME-x>Bn}1t~{J4~0~|SR;1odbm<0
zOB!QzWStLX*9&o2AP_AbzQ^vBmeoK#(nFi~l#1v`-Vy?Gi<=^YA!Xwnm=|?WA_9EN
zvc{`R$_>;{YlDTj$R2UDYC;Yhzf!J?sW=F85~q}bsejcy##_7?2X(Z%S&qyp!<mw&
zwY30JfTc%=&?`l(vZbbFYf7FU7bzn~Qiet>X^R+LR5(l*QrE@a9<C<sqxVT@9cPKa
z7H)UWT;y&CH7leeQJl8MwoK9*PBb&~oH(oJ!s>#X!0Ax<xKyKvGDFkZm+0P69V^)H
z&A_-<yN<!E_>^)ui*#CPd<KgEqnxP>ixGGF!Z9sNw&K!uq+hnq>0QNmDft6;x&?Z0
zH&L(iq8A3gTS6ooD}xtMFT7#f7rMLUts?AoR&*bgf<nO?#c<^7y9CPb1n(27x@~EN
zy>j9k<Ay7Hnxy^r)v4B_MPVV>+PUUms38n7l<&MjviVCuqQ{=O;B7*d!kA(TOx=pB
zH-m2$NB|FNWlok*G720mK>;U5o%CcGQuj;2<rMuygnTwU)WsH;+2oGP%27NnKy<}2
z&Dc$%VHe|w)2jEcx?+<M_C`Ro7+NFbe9CG#V^#J}2ns!LPWr_lb^Q9#%sYjR-^ipP
z8Of0XZmp)h|72@#ptH!Zjk;XWh<T?npIHj&I+ql%%S;rEU@60S2?EVc_l|{;dBi6$
zVkUM)xVR2cBEMkF5`-m>M?~t3CdA>+O()#jFXrWAQ2Fe9;&qo|{60wewHQu~g)gI#
zrLJm_n6*$yQCFSenW%$4;2!WCakspBq7}7t*91u0Cj7~c*HFcoE~;tP(C+8YgUeX*
z;*ORavivE?YY<n4K@Ne)n$@?OT1jU<c7Jp_%d=hwUXVU94pcfG=h+wlH_6Pe%nw5+
zq}%IeL9@Zd1IbH2f=+#ZRm3hmV+^seSjn-Vl5uw4=Ok#Bo82_Hfx8Tlb93_hy`2vQ
zOG`;a0V;erOD9<zR~IT6OFni>HO|<lES3`;99!bt*}v3A0UUG6_{p>)RH{*=Azr)k
zGK?R0*tTQ7?lzxqYQnhUfW4>X@_f)$m(0Ze;9XbZ_ykm0b~e4ZFjJhX%^~D1D3Kl@
z#k%2M+%kgbaG2MW?FnF7k%dyrJ*yd1u!@{ps#f0<h!4pw)`=^VXt*<5Mqoni4gqh7
zc?iHQ5Y~he7&8n0h;;Qw$)X&bzIU!gbAR8q5~}jg#KCSw_6aduag`=an3><K+!vCQ
zyBe|~yVGxcaF<KO^@us*1M8oQDAwxgl1LQ-@o7lj=8|)cL48wU*JeJK65itUVyo9;
zD0>B267JOoCNnG?l$G>k$=7|f>IlfqWX~Fe2d#uQ9eM+wEOph_E=5=Un1G>J6r4_C
zZ{Utdy0cCL2h+$p+2QM9S|X&xa(Wh4@w6jQ!pKWwN=-R3><AQ17mMar%xrdMxWac2
z9cR%E%)CK7($Cm5)kDFWrsoE+#KYE@77#01{4{B$;4UtiY*<te=9(vrDg!r)dRIe_
znaX!%aCETxI=;@O#(@`XnE;fPswY?fvO_gS&T%>=SFdIFwrD7PkO|;tptt87A>Y+Z
zeaufB4xvmeN)UI*HjxiEG}^+_qecVsY{JhS!R|EGMSPVBt#BMP=eQRhbI;+JvRV?L
zs@ZEGKLf^Yd&}mdUV0i9EjOnYihI)vDI--oXd#wqadjzptqSlW$5uAEgm7Vhv+~Tr
zUToG+OU;nUGl)(|^S&CEevh@2y4h#ahsh@8bfL&jU#jzW?40N!CKF~~4d6<y9vZcK
zEj6NOag?x_n>ksHafGy9f)i)i0Xxhb%d&caIU8A}>V&LoFl1+KyG(sXf>Z+ZS&FGs
zMaCSu<fg)f$Kyx~2OJ0NsZ&Cd^0LfeT78AKq#+sFnPlvXzu(*fYKpcs<gic{hZs|U
zBl;nq`Msza4!qJG%+;ziTd}5cLR%?NpuJ@cjG6`(FDP*w)fs397U|&6bv8+{;FCMn
zB~qUFXp^vI&e*mx;KV<RF=>F<k|z4|kw%0^e_ZAxuT`t{E;=A|8LEddGMhngEv9ls
zbqT!y8RAPq!7s#5Ri`nNLeXU;bi+;w&Y{`rzpga!jmfvpPqKZm_07)F^8V(D^DE4C
zo#+4z&Z9?sqqtTqygIoe?e!3;DAq0(C$Vu#2keER$Ss<2Nxf)I7}(rle@PfSE)qGT
zRwLvKwggE6q)|KMCuF>j1GEqY@S`QPXu&EPSlnw9{t@$ve3zi~8;5X!QRUr672RC+
zGJ_WJ4t_rbTjadn=^3#ZHxId$Yq6r7-rCFn3YtXglTYP5$C2HoL!oJ@qhjXrW-Vm4
zPZ8LhkLrKNB-US<^vfHro=xp4oHQ69+$jJO4j7h{uVx>DjI(K&1hRIE%7?7ZRO5l$
zzLsd2oa`M-=#JY6VjV{{D{e--q+!);Q4+Boc$UjcAJTD&{C5`=!%d_BL+};%gg%5y
zXG?y&_$49|fnTu|4BaC7T64ZdSuN^cw+Wr}!#Zcz8b>jAF_>p*MLMMBWfPJ75L#z3
z2z5)GaL%4fZ>CArx#JKS1`fdJLsm8O>L{@hB1QceOwij6t6PNh3ts69nhirwt8F(9
z<rC#X_*#UDq=_}v7@sQ%bQvH>OdB^E5qNyTc+k)fiQiDO75jY*=!YNpgA^Q#$}G5m
z%;B}%#F@#u5qx?+E7cqc%R15pg9b^jTmY$iN_?hrLZvmGk}7@C@B?U(Mx}&f&9<i&
z+8z48$2YDmoRM`m@Wqw7D{cf&)}GzL2T$k9@!r9=T!a1gdmmUbmXHO~fvoa-YMxmR
zANMM$_*6L119KE%G{&(W!Z0fF9}c-gYliSDF(!`_xf=>t2fKJ4CIbrLMA-cru@ahu
zprb)%k`yg-1^FUf&NUe#;F|ks(ZocvrZzaJ;36z*83s=9xx+7!{0D?4BKtx8?Vx5M
zyRrDSndxysoKnF0*hHMAjDey@<aaY@d@6Wf@j}RS0Q@)|rvsptl^c?y#W{2qJbM)c
z(#LDilwhRpxbXgqLYLHgK~<4$M0j)9V^Ye~`&eX5t~2(|em1<IjtaZRENcJT7C;mL
zCrcP6R|w@6`@Kw4PIC{XXs%Ogi>6NuTKbR+<Z-!$-iNG_RN2STSa8v2248B8PTK#t
z(Nz%_j_(s+!{nJDv_=h$&MFlymikZFqvEV^9G=bUtj<&+_BLRcN??c#r`=$f`QoC5
z|CL<Mti`S%tI-&_<AX|ym`<MlcJdz@wvb+>E*@jzs{WNE)CSSg-?{v`2t}B=p#?8R
zWC&IRPII&a#2(k*LHe;p9Y{K>&+Za$w|TO&zlD_Y{oRv;qdVZwc#dTWCt44IW6`E(
z77(q4WV}rvVln~vPz(s&XLl8Ae~j)Re8V}SN)i;ioEYAC;5rb*D8<NXf0Fw2Zj>Gs
zmT!%uDX&$i{J^ncQW1(X^hRU2fiK4C=u$EH&R7p1E(k%-`-^o3EYq``DNJ>hg%K5^
zAWD+wf5G&^hUU<(o7@l~<8v@R$YA}vv~*z@^@z0SepU1Ib%}&8K!|k^Dzjo&b-{hG
zD^BwnEV~-=$UUf?y1vEFs91`=f?wl-WpawP9wj(&M4vjEm0%eA8#E)KTtQwaS{ji2
zJ833ChL}fLZ<<+N!()1q*2*Yyh;MBtdseh390^DB3p8Myv2IlD!@E5e?}A6zx?zpJ
z4A=MT1-5I6+SHi;&~4I5vhybtirqgr*?qaYwRy68uz!cW?lTvFa79v~)sA;HnOXT!
zOQmEk1TkjL_Ua7Y1{wuIP_163ZC(aFzt>PEoX<Lh;REn7+jq4W;S&KQfaQ})&l?Xy
z2x4Hxx;+ZH79C$WFNy_$j&_>WwxJ9IUx*6`TNsm*UcEMk{iyRLg6rYi7kj(MuanbL
z>+>I1PER-JJ@7kMZ{XqZ4FH3so8}aC*Rql<YRC*Qod;3Nx^~1sIKDzQHrHuR1zgBN
zB2!V)a{!nNPdU5xkP+R>l>O^t4Kw+M0hGRpr@t9Y0H0F9V8860eSLbWapfGjvtvz2
zEW=Gr$aKs$aluWzLg9D#uPkgC82_!w^~i%TEs0>uxc7oK-c(rcX3}nRTMxOdV+n>2
zkouE8U)Y1II{dkm`?L7hOaApWyffj?Kgi7m$H<nIXFl@99jz6j>$s@@N>%%bTtK`6
zN02j-3dk}8F(sL_p~Yh7wh=(I=f1XVRH2odo7iMz=^*NBk1xC_dQ&OZnD8{qdvJYV
zi`p6xr*<8Yx{$k08&n;{?X5?fkAwvI?VAAz8v1teuwP#O@G+b8nqmFeWMT80odwHZ
z5FfaCq<oL$v$*q-y+!XUJrh5ZRAbOCvABy4`KpZh*tbMSL{4I`#D<&Zz(@ar?6sEB
zd`sT3z-6YS2(y-TWP6%s-DxQ#%?LqTCaGdoEVR<?KaH7Z*J(U-sbCzl%tQ)#>9MPQ
zHHA8`YxhCj;E@-)muxrA&;FfMz|>?HBQTgj1e8zIPf4=Vzliz*q(~obiE)AOqS8oK
zMTdmU?l?bFM;J`fL*}31hv82ujMQ4Wy>B1oav;s5#z<{uqiJ>aTCUI{*v2Bc;OOS<
z6dr%3zS-ZGsTM(onHc7~cAVDb1R>@+W}yk;dug7&0k!Nj*?gsxt!EM)Ai4ND8*>J{
zuyCucki0rLe7$o-!pqU0c5YJ?V);Sr(2Tm|D$7QB6t9ZWr3B<M*eW~2ykMIf)YH++
zt)#QQ_9R&}apCIfs-0((^L8=5SRS8u@ju+ro_w4H5Kxu&ISP<j>8Kb@`>9JOfqa!b
zdcIOx{C<oR)o`WvuCg<)gjdGIaT1nS$ac<L(x^2Kz=F3MK^es;?Ge<#1{9Q&>;u?Y
z3?RK&S8}gSG#6SO7?vr-t}Z1VIY@OHhQ(FdORvlSoqUU;o%Sm`RKE}~o-c^9Rc2Cs
zLNbRmY$zEh#OaL5!dl~~>&u+ZoN@P392HWwL2Mc>^^M0l>NBWt_Hp8*!qR1Yms7Sz
z!>-7vLF|r8bq*!+3kw9>qJVjt@6^xkfKfe|pV-Y7e}d3T&93zj_*xJW;1}JZ;1ED9
z3S7Yr6UhfdA7zEq3Ss-Q_7Na2h)08vo}{@3Hf;{CEo>j1>#PiEY0mQT<dPP}b_5dy
z<0fAyOhe5+fga7ZbMkXt^;WBuygv9g**!_VJvjR2_<!RUw+)2Kv=Ns^W2G(fA!yBS
z5<|x@c=f0h1#DpNa{(mN2c2cj>$s^574VZ6X@7%r5%|>7dm9X(15>m9kZ8RYpQyO7
zybu<FB<5yJMJ2sbtE8%5Me+2Ll0*qqZ?q(*o#VsRW&C%|cT}QPqy!bPmZlSbs*O@-
zK$~G7l?`u*ro4T<=^9^96*ofaC`K%O1<~)5|9^X5+up`;Wtp#oU(ri>Mx+gZ1S!cj
zV{1Z7w9Sb`YDFs9Y?4RQ1R7*VAR3DXMA4hgZ{IrSzEpJsq?}pD`y?S|o>&CB>%DH>
zx-aKgkEobwRq@`U$d+7>G-c_5Pi1yv8<&)BGp3I^8IHe^{_aqWY+f`Iw7RwGBeX>?
zB$fL32KZKFP8_E!_eDj}2kQpbiP(|11U6AoNeTYonSx?(Ud`Xi{8D%k=5={aNF#+e
z+P+`~yK^zP>dHSoeD>z`(b?~^-yXa^M*gTRejWTEXE@$Kmy$8p6kV4JG{uP9a&n^#
z47_Nm2TV=?mD4tUy#KunifDHF=JjEAcESt(LH6q4^fc_k=XPi$wyErd32)@bxDMm3
z1{dr2pr0OFTHPiWh+k*v>2dvJD^1!qi#I<;mxFni0wrl;HwFcnyI6Nr0u`R8Fv!sj
zV9?6~p}T}j4zU1>2$pX^K@T;i1RZ^tL`q@N;o3^~f756eHJ`W{7<%BTA1b=+GV^c^
zl={QYgJct_Cg8emQv`NnDq(XS^6)iiS+R~A+7XrFAdFH3hAs7ON^P=2J^S!S(2-;Z
z&wq1p{Os_#A+i4m4eNVBs1UGys0hZgo0|c-KqL|;tx1IIa2%E=1`UEq1~Ga!yam5g
zRCR~|Llz1I&PS?W@n7T;1>KP#8XBg!kQMZwUw9T$g4?+cQ$OV#LZl<@+CPMgP`IY_
zv|ZWb!S3phV!?d!h`jZs$$7eeZHR>HQR31(%~+Ti6b&pfTNSGV;>p~zG@p<+DEh`N
z(l>F>@t_vhr)69SgwLD_AM#C7(ZnF+#p1Q@T|sK=J;vY?Hla7@@**fAH2kuU=lSe@
z7?AAO=UMhukduUZPQsqZ2PfwwVn7H1fcGDz@9*v2_C6lnOCKFP@kaqh6*j=lx_5Td
zcfQ~&d`GDOdxP}%M=QU-G9YIeHNoK$gPp={y;XXqw|X&N8C@|0#)-2DC!Th_NP*WP
zzJo=)_ja>Qwi*p26K8LbZ9ejE%ol2;;c0A|7!bm~8o8&`kiD={f^Go2A{;|p(&_T%
zs_E^<)h#JTwPwLysjCfLd8U8CZNIoQ=U^O$Aeo2n*m*5nLqaIrK1D>&r*ds^oT-Us
zYkaDvl27GXs}{i@VhFh;KM15oUQRq?r=-d!+mWd)6ujmfG{B8;0N0n>;cAvLFlNS4
zQfmlMwzKbH{E%7`wa!^X!V_TuNzW}kVngoal6vdUg4H9OUlRpw7--10l3cN1rBf7&
zM0Q!Bd@SCEsgI$n8}i_3wV(YS-~X}ql(};Hzx{sS{`q@F^1$QrXg8DZ+Q~oZApJ75
zYub$6u^-9G7_0sLG~B1|s2%~ve{42mH=`2Cu`+N}E8TmE|As<vS<^oEo}w)KONR<8
z-`^GE$%wQ)LTMbv?TSQ>s}26K4R3d#SPXT$SiL=&eR^w83wkIh<4yAOI8c9u11)2V
zI*}z4LK>zyyR(WKu9qFfkdiAa&VvicBlrgMQTYMcifUkB@V=B1<S{`&%Zq6-@|R2k
z-9|2B825FdF=*m>wxs@uJJ*q1mDFIcG!S>|zj4M3s-}%bzY|`h$N`Xc(L8N2l1^E<
zsF;MH@mv^sdi2f0ogBO|20R|Yy!=@#=$gY<JVtSjYNrqyMJO?ibPzj*iFM@!jiz?A
zLpTT8`W=%0_d7pWkJ}0coaie*rV7UQH$g<bs4ft=11$ZTQ87aBt>&N`!k3dbl~Zdo
zMgdyuT!kZ39+coc3)Gl4Du{a0`l=9EQ7a8tsdZW^XIMr-)feEWh4J)GSIV&LR_SBI
z2|akCQ5p=VmzkI_-cek+x!&HzOuSI=%GD~w;X5x@6x76nE@WrLD7vHnlI^kjWIb~?
zQ!6c|#kgG5@tjhZl&ikJiY)Z9HZ_yDGHL|MUVVG;{5b@e=boHw9&e?DryO?QDQv8=
zWsAx;&r5;B35EQ{0^2Z^;2_hB46pygpfd`Hy0o=Sv}{q-3q==7&1D4MPnLulNrt4C
z%ZVALqF^WM2`+`moS;NcCOv6C7qhIkJ&k1%HxG1)u!a<KLshSAJFFmpt;@`a8Lf4d
zpxJ@44&zTkoH0G<2}q1={Dh!S=^~(D7#Uwerx2+!S5uK=a25g(QI9(*Q}w&l&F2FP
zf9;B<t?iKTNi|j5jkgY?JG@jsgG5cS0tGq~+|p8s=yhmRbTA5%RJ-Gr(5VwWM&n6C
zSxJ<I$cNCTiz%GXU5&0wyxwb*vw18@2G0k-s7PUvhb)V8PoyHHl6HaTqM?STBoxNg
z9gYNcPGC=B5s!Ahe6sSB%TC2a5n`Nqfulkg)bL{(#iD*qn7bRXEeUmB>%1TXS}f9x
zylT~9X51ooghU+cSBhw}sAj!Ms1N1~dXqwF!tb&rD?E9*W#@C^%34SqM&)qPA8vIT
zu>_zYjV;@kreQ6`00Wq!z+k3)7qLR~2r%$YOX$WDVt+S+Y@F2_O=K3XlQJIuf|CVz
z{>1QO?R`e#zZaVit)Cjic~vwdbLo^t8h{p?x)ydm)iKiP4f>B{{iPuGEqZ3B4wF{K
zDIE#Ha4v=jPz{N{lP#oZZ4%o%kU8!M0>#dvWA6cVoYF5cC&z+|)Ltcegt!4j42$F@
z5z69Hl}6s{k~E1l^g?3!5FjfKROLQb1dle%+ir8^6Nf<hv$hKWb6yi6McX&K)96Mx
zWy~po#6iesW0J4)S$h!I)MashYW-^h^ecjr3SC2kV~k}B=!G#SrCz)pNkA+Ef+X0)
z>CrXJJE0;&wz+yXb2%Zes;PZddK!E)T1k-uV&tVp?jXW|$-JhES@;RD1~l!OJLoEL
zDT-iCQo23RF(EB#(@$u`O)?P1MM2|B@2UOE;;TeU#K>5HW*k6E<HT#8(&@j3PSm06
z;Wy{@RkyiDVyE6?eONu|xXH~x%`~4TF^xeAen`S(S!hpILQhtL;?+emG&MM^;IiHN
z>Q@|~r`cDsCGlPOqprq_<{uUur^>3%FA*n#AS}gQ8P^^OVH9U4mYiTb61k{!<<aX)
zVITz{iLONd&gMD#s$H+32$s#fsVU1OU1IY08aCP0w(SL(P+a74(wb`6Xq(&{;zQeQ
zT%6Qg&&Z0#m?VSMao+6|y1cQ^wbzYii2|$UikiV2Q2HB{jMIk5z}3xWOB`n$B1S<l
zPu;CfSBl8khT%y9G+H~yB#QwqT7U)(-Xby;?#d9?JS(ea=EJ7?g2GvJo!@MAV_t)p
ziE{HJ^4!&Qg$DV$HHC_$xzZftU(y#O&9%0&u%--ZgO@IqF>_A^I#R-&#NX!uw?0g|
zpJmB5B!gbousTf~%<J^Qx-l$S9E35B1G^x8Q|XO}OV)NlT$?HvV|YwdKp{shthnE~
zLm23U?%@CKdd_;d`}oP#IbqPVCwIP}qqDagp8P_dhOtyuC{E=YU-J2IxC}QIOkI*P
zA$Or0!NJk>MOBVAdMpEp)lRtg(tE2y0LmHVPUWC->)I)Q5Iu2ISV3G$XfRqHTIV6Q
z(#<X7*2&qB<@B78&z?dcX~?>p(jG=1;LS?n3$SyFd6Vi|^fxi);M@Y@Y**Bdu;4)=
zC>OkKWW7X3JGoxVcb<69sbM>sGc&k2*Cg8*6cdAj&X<#SUS>om>PEYd8ya}e;*GFl
z=*GAP&Mg%Wk@<1r9uI;{J6|&vlI$FfDWNb7iO2#2r5uDMga}2km9U3wv)q$Ho0*Og
z>JWT>(+-g@lux7gXuO<yK!D*f@VcMy*err<0)cx;PUPXFs?|bh$)$;A!4)D1ZHTCy
zGtH$DN0(r?%5A`fP`8QmV{TaqtwbA|H;=?Xf`EWA%L&S~jFWa)uq2h}hGirj4g0K`
zkMyG5JW)3;f7q~FXiMbtr<jyE*y(4l^U{rEVwmC1kkGu)X51$mFy(qdQUb$O#yP+z
z#Z+m%ht)G6B)oS+K#Wh}jB#{1)bzx*3RQE2OpTHUVGe*BJF&rJMPV@y%i4wRnHi9o
z>86JC0ZV&~EKVag@N_5qF%X-bIjsaCL+>%*#Oez)s)Q^m)PgzhZJY&gkB0=zTe2bO
zV(Tz@Q^A;~jf`<U-~>hqc}t$XVV9F|qFw%=AZ5q4Ez1-b$&7rkgZ@vOPczM}L21KE
zcEgVC1J^|il`MrUp-}ENw6U&UNEN8Hk~vNF3I`4qFe_+9txXyVdtVLRg0&+2Z7}Lt
z*vhKQoH`byjl1_bJxGMHEZmH8y)gUg?|S}W#nVd`ngk%!Ng1LV8VORw!_P<gjC#A(
z>xNLlLoKetcn94DmvpWJv%;rqKWctDVhM2h=w_N<l|z)DCT6fTObktf0>VRSMzFci
zk$!=&43oiPP4v|CW&w!=I4?Z;wDZ7oj5Ra05}vnt(U|6B;T$Q-KVk(Sw1qOkPiB`f
zvf9hVVp2rYmBBckFYBAuJKXp!q0;Z@IQ7ErNcjzNCA4xj0(3ai9F%QCV{}>TP^$va
zB!?hZljjx$?f&IA4*KF*1MRKTTGY^s%0(>PtcYdU3Cejn6k~*7q#|Gr`=Ikc@~m3B
zA?3G8-s}k-SCjIAakDv)aw1K^Kh8*iK>@wHeHi3idhzWWN#&s42;-zDbC}}2)j+R}
z%8m%!+@dPTlj!i&ez2SPiN<Rq>~bY3sP%F)3bHR~5ulTkuuP%^RE7r0;u^$_C`yq8
z<mg0iv{(TG<*8|8)GgC@*ibV>l4)FHcJj@C96meCzI}c8-(xawgwJLs?sbJxpp7>s
za+^vWN3?1G-PaRlNV*~5!(IeoxVXH^6mHXjZ}ovuxN_cTHvW;CCvakk9S%|`5@=pq
zta3BCTw+?(8^Iy5D^yeoI9gg|sgdJfz_(m8xFw8eS7MpX_u)RZ-N%o4d9`Chafl>l
zr-ZMw9L5DJi@|#xesUt9>^q`gy3!>cZkiC7bjrqcTd7A9U1<kE(gUwC#{P@wRqSz~
zECoGiRJj}HwW~v-rVJ$Od?9$S42-}_-m!4(y~;!jA1)=yI2;Cp?ak2Kx9q{ElkxIx
z=<8dV+s_8H+w6&p;Fh);B<1VutL)XPfjpGRWO7|CWle?k%%QQw=Kx?o^HZB1oh&-p
z7RC*dm=>enqvNX2_!FH6jk%LnsQvM?o__ov|K&eIX@9m2@n<TBmsp9J{9%9bk6*_>
zUfNUq#sB*A-=J+f619qY9$B)`pRpDG+CTmVZ5w#ozQ|&wkG{-)M05V;ZQJp2OPbSY
z=-|=r|F5>~NIkJN_;zsHAPyew{XA{M&F19naG!!eP=aKeBLhkB1H?LJ>>N$K#q3QM
z7cN9$=Rqc1Ugh(5S#KKAGlC$JEMb2x=(3@XKjCnMDDfO(v<Q)64N*2NfjJt_hQ|%H
zhGYz|fJu2o^1IaZdcol|GZ}Vnlzpp5p*aN-FqG+%revBUXjBn+dv8GJfg9R!bXb`Z
zZ8a+2mm`J92uJ58QFN2@!!e+9KbnYn`_<QB=(bj+bR_Gc<vGY~w!LR<=jmesR0+7R
zCSYRxwX;e0lf2#1qQxx3sYbZHg{ZgAh{2A2m$YGUXB>HU@a*j9H;38t!*5?7eE0J3
z`0UPH|ClPq1DUtKFcS0p!quLC?=ZRIu8+83<n7Ih*+5(EVhk?RfI8H-Cn_`W8O(2u
zXqZ~y#qCg+uyhpQxtD-PF4AvIQOAm+-b=XH%caI@t7*x=RY+Iq*el`5ZyRmpd92J&
zPEedg`svv!)2giq)3qs%R<5sFbMF45xZ(q}F+k~ryG6m?6iCoxuKUpplIsA`&!>cr
zeqBv>CXs1WT}Zk>kCyxR;Ex5pIxf-I!blJUjo1`%Pk;@WsJ#hZY(9NgJF<-?tactm
z-B|YCNl?hLgNwO9hRYN`>hEMmC(RMW1w=z7BT|N3pmO9DEjFO#bt7zQ62+hbQf+{F
zt=PmK2smy}pwh0`AT#Deu12QDr*V~r-Nq=vtrR`M7}{)%#1Akl-R98IAQ@gD=*PN%
zAIq%o^Ws8EX14yM5{5!+mZjDCI)Sj0L9Xe7iqV_#vQUmC5z$t^sIn3r*cgY70JcLy
z%fk{ogy9Z*iySzUu-&#49Am{$$pM%b!apxv6@@<OJ{OVdu}&5{FJ?k~)x7SKsz}!!
zZh9RBy>r)GYZ?JKJg;W5T?xBKmyis%`orRt>QVx7)1mSk!wULH;+b-@nBQrI$5kC4
zkWXY9uxnEIEMkUJ7z_q^*#shIQ!!J`C{D~GN#M1lN+qs2OAycO1mb(b_I<uAC+6x5
zH<;g%IGOmwN}ufXXld_O!a~|>BFhv*M@kO28m6P+t*}H9m4ZK8^2D4X>#9^Uc=)J<
zim-8txRgTQ$T=hD10z{deIebH$vrsbtQaFJ3swvb{*+5-+>Py%M^|Ov(g4jhOrTjo
zu(9j+ja<0RyPnv|DQgRhIMumA0>h$OA{Kz~XNQ)vx%MROJZN@ZAaP%U_Zs{wj_=fL
z{Wbi-(IV3*+Dq)o-#rN#)abmR8j8!ws%SD*uWYp+Q-SAk_2l3Y>-|f$EZkLrU@yU#
zT!=fyI4Z|u0bsqYqUCHRehlvlLihQWk|uC8ONp^<Fp*atkrV^Q(d<r=p_asWtTbYH
zGn|lOTPPLS&HtCm*_FSt^87=%p`?QxZ~Aqy*hZArHbT_5nE*2`i^<4Runm$Zx+~_D
z(NHyG>u#uqt~3E2O#IN(Vh0*7?6NL(dk6@lgdd2v(HdYmkWtol{-h=J&M!1~(+rxc
z2uHI9w7h0|QdnEhYL}~A$9krQ!osA~9;hd{Y~6<X#8rrpmldm|QG6QJa@%=Cn1{5e
zW;3-l+Sv3bZI*f*5jIn{ahW53qlZhkSvn(IdP?Yc316PiJ5q%NwcneCn$4f9s-_9{
zk?ME}F*W_PMNrFBj7J}%T8%^N;qFc*i$%Z|>)0PFfOFuSu+fuq4s-eKyePgoecpuO
zoLT2M3)@F0Hlm?~vWkD?q?%D0SUO2u6^Y#9=NC*fY5d+#quYG#=<RK`l&ms6pgF?1
z1tsa&*wE}d3G6(%-)zT5QiTj9f*D{63*=6BxBIC31YxT3@Z0b+>)YvlzQ60`o!?Q$
zpu4wE*Fohkhp+tATZd((pf9>#b_YA%!2rdD*WT)DUhEgW!5}ti%}B0k8w*79_;}L7
z!4696Fw%q3oTM$#k>m0O=etwliXZbm{XJvqU3OT>^<F@fJ*bp(B^Zp{GC@j>jAda>
z=zI{$bGhFkQQ7M3JZJ?it)yh>ai+*ln#KXB9f>PpSHt)x1tzs|DD|}VZXUdT`Q%aW
z*~xEv-@N&*^Nah>Km11wbv12*+o0}+)9@#*1LnaePafgFgU=uDr2pk-clYyO3?2=3
zpFDp2`R-nLZt&>w-jiQsJ3nzd)_#`Q$65A^<#|wkmv=n(k>CGLKLDkescqs)r{Abb
zgQ6Mkk#f$4%gTJ{3#8LgHEJKX=}xEr{P5d@H!sfiJO45q;mPdZ{w@1t6ObfZ*(bm1
zbf`8=Cb$0HfA#&z@$dFCeePcL{9K>L{)a)VK!!g97>mhIR0sC>=bt~mb^kxw8?^TS
zlf6fe?)U%C@p<syw$IDyc7547d-me(Zw_Cd9-SPYe!cNU|8e$3|H%fvKK=e{!1Li^
zr4K--`6PYemqB^&{7d-e>;F`xWH_lWKe5MmpKgze_uJFuWb&Wb`cf!L=!~jq5GO&6
z`hC{>frXxapZ&43fI$cLoML!cWgB96!d+rG$<Q_uKV8#r6t6DGX^R0Ar@D$WtmzFY
z>;qzaJL9sW72&6P+txcaKp!=H^65W|1X{cQm4@P{s^g>kf93ptvO5^u@Bg3U^AEiL
zjppW~+h3RaKjH3QzyE*gIzGPt_g3`(-FyB2XZidC@BfePd;ITPB=Q$??)!~T{`ar`
z&&EH`-p8kT|35fB`u6bj?Bu7d<L>+a;PGDgcWeLeJ-$Exf0obh1r<LfzS2aad|Hmf
z2B{=BMZ(V~4bB>RE;|~zrZ;z^4!3YJDa@HPUmqSke|ad8=|(X3$4*C{dTCX5zHWXx
zok7;i4zlN`FW8ua^O}*hq{GP0Ze~C`@ocJ`&uu=h=wUjw_=Xqx^kSJ`6kBYu_%=d?
zGe(VpNJPtIND3GQ6n!BHGhq<d*|S&Snc@mbQ7Gw|p_azdG{jg8vXX_wuyUe6mGE};
z>U>-{gcm#nC`zL^1lQdhCIC4WK&jOh8gqt!!(u!MQQ*VvweV!EAP6~<{YJTjMYOPV
z`VE2;7N`N~5y~<twFRvNTCQ^XPR-9X6IT?(8NP8!<GQAMpY8CLhnYjTfTIx_wsV`h
z$fJfh04&f^RNbGoa0DjHbW@;_5AX{lVIxwtq4S`yq`sJ5xSS!zWzp|+cEdt^sc8+1
zifr0pXdWnDt_+l+Cv_XhNuy%SSWB=!NFX4po8=|)q!_wVUP*3Klkx>+EQ5Ob&;oj-
zs)UV6u~Ou`M0ATU8G9EsIFJLOQw4%X{XWtFM#|*yy~(JS7gOSG6HtOVW;aDX?_2jv
zL9Nip9f_@T52)wrN+)s33?=R~adGy!e~HtU4%A@h9gg=$ip7JO;O-&hFN@Qh&DwC_
z`UIK`vzu;SqB^T3K!Dgz4G}K%5@}~FEP~hz5|Qs=kK>bA62@U9jqk!-8YP_fRbb)!
zX#iJB7|#eSg3?70cMJX6OfvG}3`cS2_A@=Dx-#g<tlxFBI=|WCs&|L_MU^|+<!oLt
z_Ete7RPMn=6sEqKvD4L9a)5i<*O3wog{8h1mio81iV0ywX$q2qS4ZhS2!AR*0KKlP
zpQ(dPDv$_`+sp6ceF@pC#*2cPL;3u?3}T1b<5C_$ai*+_;sLVg%9;3tALXMJ9gVYV
zl}+!-eM{UzFe;W87^F!!mNLOtA~Z}sb=pG%YzLq!c9Iy+ZyxGWRlIR95_i)8I>9>_
zR$+^&>z}^ebA%PH4D@xu{UpmZjK*^A8#}9q5-W9HRqyJ?s*^lVW_K&fMmEWBG|ecC
zS67y6LS>VPNQ5t*zb_F*$Zb(MQ2mEgLP|ncx+&$9WQUeco+8~!uv9ypM`3aOws58d
z1}=^wVBS#oG=&#|Lj;wAt&x9rgE(5)yfqjX^7EyprK12LOPfjB4Wb510l~X2>q5}6
zT$HvCfFv+M7CX_U6VVH$=;FpvS(I%cZ_CdZN4C!hR}q#7i>PF1C9#PSs@`cvJLC)B
zwMkUurQl`e5|>;w5TNpj(#`b~oJ`Y=<b+Va^M>%o1AuUYo?$I)ggm~&8Avd(LdLul
ztXo8HidvA@v-4secH^ruVf~h1>4VoVnJPPqT?(3oOd_XRI>Cbc(ANc;C_C}s&*$Qk
zQuuzx_!;aANIE79S<w_064<XP?CZ{+(3sychH(0hn-r@-L-9lsvMd5ubdBGJKKMkA
zK-PMgj$=ho<nk2M4V%WFGM-Wz=KJa+FzL1PP3c)$g|1wsBo~x{v+zSWqiu#>AG|aL
zVwR^NIX0UtOad7z&HT3)#!KpfozCO1NuO218pGo>&t_F|^-Ia-L$!iLTZOevq^=;T
zB-VqG?ob)<o3<OX2_6=iEFn`7RJMe>M40Bojm$B)bYL&bNmW;~OFd-;pHoAHj6Pr_
z)$_2p(QiQxP|d-DF3D^Q0Se%cBBJ$PP;cErZWFtw5k*b|Fv*7yy5B4p5|68URjwf%
zuyUN8ULrnYR#2-Ccaf0=&W^If>AW0P+0k#3kf&EUU@U=rflxWy{Ljm<S#sVrAj`wv
zv@j{8ycZu7!h=JQGu#9rqyH|L8I(BvpufNKGi2i=O#InpkneUH;fv$);u2h8CJE|d
zGB!j?0NH|i(y;!o&WjOX)V07|koo6)2odzfLs@VLxAz?X^CC<~iQu(X(UbCgPJlg@
z$8bfZoXieZgTnDMCfdeK6FL@D){2J+U7O!X!iAK_HR-+5Zp0A9u>u%Z$w~^#{|V11
z6vvzdMfa8yvY(z_0IR&<byuQ(^cp(GaN4`7{iN?>gpeyall%xi-8zS_g%vgIwrc>P
zNM3^JJ~GDOK_Cc{WS6K)VerwE#YxyXPd*gIP|8~GYdY>q@}!6yD%b=!ka5nCBf?c6
zjcqCn=K}7*ej-zW5QTC1J!?EnvCUkKE1_~8zU!6KeObYZK`D3QBI#eEK}C*`t7_z2
zk%A&pPDQB|vUp|==Qnyaz6eF}q;*L6As~YL+yMGrg5)VOUM@9q%*(;x4S~Szrr>~%
z1RDhMML71a60BgLU=?8dLOi!5+R6r6Sj7Jnv1CB3r(`u$!gdh9)HAG>GfCLJE{b>1
zsy+`Z_UzK$Dh=(oE+^1y&zE8SFZzz)ML6H&4kIysI9QuXm2uQ)qY;AdXVs=K=Wbc2
zy$p-K#6g0>URoR}!iE9Ygr7X=F27Mg(zw@M#U(K$e>Y(h842V4R^sz(&A8SqqdLw8
zzzsAe?_AabITq$B@eSlj^j%AU*>Aa$EWv&`3pJbeB9FY9S04nB3;Ma=#cF2jh4o7Y
z7CA=jthNclRI?;PKr649X9_`s5lvihtxH7$F`}}quJ0$@6vKwMVLE>E^1vig-!QE_
z--k>P9<?0RQb&|&n1JF6rp{t9hEWxU(&BgG<lKhQsb2KXZ+fBNccOq=|5;Rx;B8`A
zAEoLCbO}tmU6`RlhvhpdYbCY@kP}Kf+CJ$<OdgG}&kU(xJYSZJedKsDa6XY(Lm~|U
z5ds7gdfirth*7eK8Cn{%Qo=6#0=w+GlBg*Pk~J4!WPC3Cq5W*Ig|)amN5rm*89WBm
zaJk4zvLCe*VyuON7V|R5dVr8e)1B0Sg}A$Avtc(gy9K9Kv08Qu2p1b{76j14ay2NT
zv7`$8X&KbzQeY76puwS7P~$WC&meJ%%Cvs3NroWp0Y$RjuX0eAq96l249j~W=LPnT
z-mT|Bb0)G5k6KA4G6Y$jHCK<qA-=Q$it1WC;2~T?n=jIwJp<!Wgu{o6)Plxv;3z5O
zq_wr;JXOTd1%t^=SYQ`GXAw&kbyxVcWFsox4rWyi2PwkZn%R+X;}5Wixm_{{wo%cm
z#$$)b##t9u<Ck)i=HAE2kNx|ns;QuuvNTj>-iZ!)uwrz&O(Q6C&~h6aoU)=c$T43`
zLj`iYD^I|}z#ykc2%SO^43F4|rqy?&F0n9R^KcCo{cY9<M-~L0u}YdIDHt^z2oW)$
z$4hm%1S8Fk_nd7&`C{-2gEasu{edO`N;*8Hs={hfk-sQ7N63qnD;BZx!T`^hKTA*&
z@p{+^FF4z#ayo-7saP$M8?&XzYATD=-m1Enm_S@QZ8iiLputb8aENDLKK|FlyoZ~h
z6zX3~VM7Cnw>$}|nZ(V`4rmxMKBpR~KTFXnHNsq^F#e$?5ovq`J_O=TIoGs2%L~yf
zh$tVJ0rcFmOzl9G;x=o)`Vq2=H&g=_k$Yp%Zm?)@UzB4{PnO(|L%qVf@G&Kq3Zq(h
z72#m3|Ig*r{VP5V|F6Zt^^srj)75de|95Zq^FiDH8~(9#@BjTdJ`bGzx-t1kjrsJ`
zPqU+!uTEZ{9UPzGuQvLn2Ut=7>urqNmsTjAf|LtmA}XXAbWHU_Lihv;V_hS&a?-~0
zaCv)}0C^*qvD8FzPi&bM3mjdY2T3i29WYid<#+^Z9pxeET>Z-)zXTTlIgyh`BfYU&
z5?M2K3_fd3{ueZ?QRPZT<ldw<;;7nn(gZhX0dy0}%LAOL6X8Q0hn`-m`@Aw0h=?AF
z4gsZHCkj?+XvP?<)H2xwIp=T<c0cd$g#R04gD-dcgC}3~2mOHq#5P8u!!)}2BKyh~
zLJxmF)x2o_q@DsMm+90u(FAdatEL@3y!&MD^DjHi71IjLb^1oU$IF^J*0VREZx3&Z
z`k^J0Gx!G{*p!|#@pg!bC!7x9Xw&F|Z2NuApuTMta<;(nj3$greL-y+^*jD=9Sy<v
z(>R9sV7J{1#X@Y<9bUhy_Lzs-_e?`)RnLY&CWW<P#pzDrB7~aN?}T4i&mC2eQzuC!
zoKzRmHZbM}9l*Tg!iKDrzUvqim~dx-)D_E7dw`fffWA$L>ott=SfTb5kQ)Te9eP11
zhT0934j<YszK*2vbs@^WhmLi^&+G%q;^P{GC1@GeV6U8IUzM|`Yk!lqtxH-Lwc;UN
zSJ}EOQBZ$2Zb<9kWy!Iq$nIey9v_@_<9JzabrgrX_qpfuu+FAE3PEG{O`uBCPKg{L
z%#f(hP01^WGRfsWOyAL~gfTd@{QJWfFHR!mgiY}U@(@D>fa+ry$B>vvZXe2*i>fEt
zje4&)xoyQ`-<Au9_r;brG+FaLT{rr}iAZ`RQ8qP#UrPA{!y;@%)=z`!utHj$MMzF0
zo<CC%LvyRk)zJVe;`$anpJ1K5?=(kTWaO=5eoIR*>_(Iz$T2g;7O0b_l+0!Wzintc
z>4k2#qdihx9sfI8lFS#Z>YS*wP2Pk!TzdY?sj+rX4f?zNy*}CI!p_LP!l4^hLr=Cz
zHNU}*J5-$Iuu4p3n(;(Ioz;E>M)IBo!)Q^N7iDy_?G%o%MK4h~<iX-<mKjO=a^}g=
zw42$rGJ)($(t~9wh_+Ce-!&iMMh45Fs2YR@7ZP`3Qch{(;$18VAG4=*&>A$QA&MZ#
z0L1jw6+N9jNZY3rO4(N;q$z>2um0DvnlG<Z6cvDCPy1@c2$7MxyA?<W5ftS}GvKG$
z$=l~Azda76Y@QGqO(2<{SJ%@mNjY{@NC#uG%DvfP6JN}W74~afe+xxF!a$y&rc7QA
z&1tPe#ncuAGGH!DWD)9Ozsmnq&6DUWghWieh`L3_q(~syI4>u_QKAoYTKV60RK=(R
z0div%(vR0hCqc_F_XTJ{KrAFoRS~1cWP=^S&O}iPfDvsW{Y0)W=)Tf!tH*P_#;9tg
zrtEvc>bncSDSY@^Feq#Wp43yHlf?=~jc6RTHUz#;k++>l&?7SBs#3NASx|Ad_w^g<
z2DV$FmMKM~qs@hrjOO(@2^9n=&G<q^eB%kFEIsJ`knQxoblD?RL`e}F{odORaDBG+
z&ee@JCu*-yC9~b;p}$;Q_CV_1-fPBa|J1<()Cn#;_XeC)HE81_UeHyHGqKr17vH#*
zbP;(^yig@Njb`r%lM#1wdwV6dc|m5$UmCW%wL!Sm7V0u+L0*tyG`U~J;-*?di($o^
z*Lh&NnweJ5Bg|2hLPcF9UE)~TW{_UBi7P1U+e2aIUOlL6@Ue&^D)tqvQmkSHafA}a
z{0prTHbb{~`a~A3#_S{r8Yu|aZKd1GTM=*L;LX|h4kyLE&t3+pRE)<A`k1cma;v3S
z#AJ13wBz{BL)h22?}?W;r*B>zzU~EOe>g7|y`91C9^1MzAFb{W+U;8V1K;tVsw_1y
zWg0{Q>HZL$YweZBA00e<(TJ?-cAP%2+X?`G(%(raO4Mj9Tt?o<R3~gHI?Y>VyJ1F)
zXmbZxqYcg$g~3x$V#6m;jf~Zn&gW@nL(x>S%0-0J*JAMCQ!B0CX%WO|5G|R?MOVbg
zL^p+W)Xctujx5LAN(ZseMgE>Qs04B@?Z!1<{PqUSsy14`yYsK7u(SF$_)ICVK6B!w
z>@#JW%l@E+toeLK*2>Qi_@8}7Z$&6!5>|dV$Ujpc5-*ypJ7JBdD-i)^Jp!}$8We-A
zb(#JqYxCG~rW)@ha&wcQ=Rsv&EQAluPP{4(#g>k!XeG;Oype5E5_ZK&?gnz@ObpZa
z>gf2pZi5)CYf2^h7j@}kURI-K_)tqrJEfMU3fboAGOB8!Br0nn2cAcgjlG0v?4x7p
z@&SChM97MkJHh{@Mr8!VzAJZ|o0y>)>Nu1GC|#sibl=PbjB#F!rKfQpTo>mxRH4ho
zVpi{Oi&dguR@;keRu1d!d^l0HoL)l-bg28Cq>hI*8zf;I5-}wg1q)5{)h}r%w){oV
zxoFG!{eGBI7^Dyi9R6xs(Hbw}783sR*{^sN2>(qeBmeR#>>W?X<NV9roxS0sFZc5N
z%P+k+rBrAo#mJ~Op#*OmHr#D>-~jJ>``GCbo?zEDYk>4ELf^2&<aPYc;YD*^oP6ik
zWBy%Tz^O=1q@3`Q?$=~YSnGg(FZm>OT@4XSJn9Hv9g0#6D=V~2*>e{2YKd^{%c@$e
z)N_uopYVl19jz@X=0aHVgW1arNjDABk6q1PAD$kb^|7H!#c6cBKjc3cZ@anTwML?^
zf`N1b5M-dwfjSE$?9>4z;4a47;WaVQbsnT)H8wHIHaxGD$V@{wlq6&Y2`W5_`-a%e
zdXV`_;=u!ibO=^p-_0Cyvejuo6jZ4FsM<wFwWKZU@Kyz!5`u{*E6ju1Qytid4x=kj
zuRsk<tZ0RiU14L~7&Y!YySjuu$pB+-jO%b(f{_waEf&V^WQmK5SC2Fq9X27%qL@jG
z#ZWfXcH?}k`;bVyC-Lekw~6Nc;dd*nbnROp1H<I%8*c;=r;e8~x(aY+RIN)hR^qK!
z5e`LqaZ#lerc^oz{Pqm*a5R%IQi5{4L-4`IRa-;ZLrDNnoVDuQNCsrXThPy*fkLe%
zhb;`rblY(%6!&kHXEqVCbAIGm)od59V8rfTlyZ8(Hi-ywTBxg8y1B({BfCb)cvNdQ
zbF+jp3*4G&{66+(N-{qNLobxD(NUULR8wlC*g39>a$RM)v!T&j#nD2TQ#mZL3q-8q
z9jh)~lX?ZcNqzM|gth>-eL*(#uot~`5;K~*8jV<D6dAoQ)ecNceSsLO#mdbJ3edco
zWJU%lp>GY+zfIV)!!Rq3Glnaif)~}g=MvRWv{W+vxz8!|bSsN&bIH!sXgQg2;V|Is
zN_V-=s+k+)95{I1c@VK9<szE^KBvXY-B&5^`wb1Y+1}O->JAC9c4xP?u6&swhO!Rv
z(yVX9Ix%(DUafys8)$oObh7gx4!2!Gx-Hp-0eq-S^kEX;(rjp}{^r11P+t#(QY$xt
z>GH}f7EjH}AORz8$Y5{|bpaoJ+`AYtqDmGvhg}Qm5*L_!T1foJgKV_)8^4(r#rc>s
zicpbm6L(g_ibvB+I0uE%v?ELu3Ad`+7-DOUPA<8GFki{6B9Oi)CX%+PfzyM4TMVr&
zvsH3aXbo*Nsx>CSI^9z?$d6yjG@n`%?A#t}@6!w$-?1bjJ-B7|uJaqcxAsJfL3cH$
zho@<;ZT@w}V~>UPU#@dOM9(LPJPN1j99J?6*!Lq%dw+i8SzNZ589o~nDV8EZN$Yyn
zzoo$vifs!_|GUsguspk-<Kk{cMI#xNx~kNMu305bo!&s4>50|BkqQbH;nP27Jid7f
zS}N7bByA4OqhVaknFg#$B5dNJH&+sWCardC-PUbm0tE!tj7d6$ro-7pl~akIgE2&C
zE3#}<is4x)??;&uIwrRqrDfYZeR1%c!;^1=#*m#HA2JtE45MKw4B=b|H;s$vesKG@
z4q&70b~9ifk|w83yw2eyO-+ZX7&w<fOym&rApH^5L?DZFr@G0Mu(Gngc{xx@ifp~;
zXw;y6i)V=>AW9;<<Tx%ay(}(?wp_6O@#su^l&j_l<H<>6%!>4gQsxV@L!3T)ee~+=
zG&}qshtJ-C38rb{46S66B<8jU6@Ip8C<NYN|8ZWpG%<3XhQce)B}s#b-jqej%JiBc
zsQ`)ZkJ?Q&w=^0n&iOc10>xtjE5|BhO4Ns9xJ+)wO+8sG5doJ5X!#7TpU=bpGUd*r
zb#VSl{}BGEO2NipLnjUeE6v8d5DABC{yf_x2`=KmWeImu{#g-bF<s4hT6OWSuXJ}q
z&1#k)L9l`?88v%6HV8E$f=8OwE*Qzj<&*#$79~+S@4aMaT#!BYGT~83Z1v(fCw>n@
zS_e|Wft4@3O16KU!wUO248W6ULdy=~4il<xHeI3b)6Nk&NLxKJn!D4Z?|yys;)QFM
zaRj{M9r9WoeS7pw2#;jpe|)vKPF(r6hwx@-`{DnenZSt_$Fv-4_gHPAUYP|^=h|0i
z5H(}kZx3D{A02;Z%rq$lan`G0YV2mcO8%SDac?;oy;dDvhIef*2E8DKDjd0|FHeOa
zXnNzfSqV;wS#(`@lZn4ANi*f48g(D>Q*r01Mc$nBrW?n(RcXMNCGYq;?4S7sFR`^G
zgpbR41YOr*1h~qBB)9|1D*0XP4-(1Iu2m?-J|Jol@1NW9v0Pm-8jlm3b&4<EQToY9
zA#1LRyIe=>R+>v^i5sIqMCPntUt;|}dvSDl9Ax$DLm^9f^ZNFsEON2e7SDIC=FS7p
z7BH1aj`L9(LzSw1HiYW#*U6(>KGGf-h5Jl(FZ9^5oSf)AS)3-)ZFzOtTuhKE)-aoK
zZEr~|<kZ<3L$@+FdzsMpbtUNqd9By&C~johTB8<j+Z;T23&MX9Io4wc3IC-LB#TPE
z3;&H#ZT3zhO*x-H<IXm0Sm6)TI-n^^=<UV?d3*B>?8=SmT<m)ru~V@t+MI6Yt$~`#
zZ?rA(kX{HO@p5W9tNG_FddxE}8~Jt6lUh$$IEiXRp{UKE<WczJRVUJ0kxEpWkb|ZU
zZciSJ4C(b<JL#5%zHT$wGrFBlgU0jv=<IhZanoUw9UULOAQw>@J8h2l$Y{K7AFCL;
zrCpKNOgX1`Atk-*ynK%+jv%|1bMf`mO0ixfiVkB@HEP06ad=B_G<gwIG?!fOrmCE1
zW0nD<2{Nu4g;O%RvWn@AHoEp+IH~mE^P|)3*~!b72glDLkd6;thNDVupq@O^cEQTV
z)sz$SGIXORm|WSC$imQG=7)v5nURBpjgw!gWo&w}#KDBAQM|6mnJd6Flqq?wq{GTH
zg>kYwiX%Bq7sUtK!&QXORS21*Sd;sN`3Ze05syi(!6g3;MKMH}?>E)eW=um2HP>B~
z#=41VudXbt9aI=h%*{nhYdI$Xhtn`CL0m^MXn_$JIEguRZ-}g85~o#Dq}8R->}5j$
zY}mHihzV&A60cJd55wRKW%b(Nr7W4XjqlzZo}Ruu48<I2re|obQl!}SljnQZa^KN9
zgIa_roYWpQZ#g|Gxb~315D7M;mCWk35;d|wjC@wU<KQ(zgFKy1@)X^&KQDxBTox2t
zj`J%A@(?H=HPvoI_Y)WIRk6_sfYJ46Q@}9jesgRfnufWCN}RW@T<NL1Chjc}LAJ2`
zH3?O+Avan*+&-!xR7%_h7?H8LoQ^8J0*5a^9}kaNXN7%T^W^zbELh4cCgZ<u%H=;0
zK;NI7o&}k6c$%HQc?Iu8ld{O?n2hC&u#6Gcg+*J@xLn8DU!EKvot?ZEnd9;P)8ti&
z%<sx2NnejrP8WYK3C;~=y(@0aL1bmFG$@i9F{fG>^pJYP?P@N6$?Xik@xofv$T;lz
zQ?fui8soz(6vnkUUliR;&yP>DWJMHAu?~xcfz4_d4bSlI6)KQRlqZ6ea5cd6lf`i2
zQ85YX3wn@DW2<eAl#P`iq2)+`Sz^N$hYja19Vs~vr;>ilgrGE(k8Z>6nh4DBWw97K
z!yg2-O!K_pX@p6P4QfQhkGeJ?KCkgfbx0?DU-MAt{C_q7Yc2l!RfUYud{+K6Ic6Wh
zf8O1BvV#Bq_#XfL=lT42{Ac1bZ+wDOw~g$NKyk)DzsC0e`@@EQ$rXMuE7zh#ci79U
z_e_DJWk1wt-5>6Tkp4rb*Hh?-aOYWU`%c={BPYlToHw^WN36X1jt2mvamUYS(R_4%
z#}jbO<Ec9yfymA;;4ZxVnM)uJ-tjxU1$Xrmu|L(6cnKeUDq(rN{aNrt-tjX4N{IG)
z`y+5v-tjZqikSDe8VvQ3W)~xkioE@~a8LTk0C0g#@*i%-h@QWrcR~Yt$8_cOU3~+A
z=UrpFm>1z5_lM3uBS!lD=l*m5x&PdM?mzdR`_KL7{&WAi|J;A>Klh*e&;95AbN{*j
Q{5^jDFHITuv;gp`0GjefmH+?%

literal 0
HcmV?d00001

diff --git a/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md b/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
deleted file mode 100644
index 00f21a81..00000000
--- a/redis-stable/.github/ISSUE_TEMPLATE/bug_report.md
+++ /dev/null
@@ -1,24 +0,0 @@
----
-name: Bug report
-about: Help us improve Redis by reporting a bug
-title: '[BUG]'
-labels: ''
-assignees: ''
-
----
-
-**Describe the bug**
-
-A short description of the bug.
-
-**To reproduce**
-
-Steps to reproduce the behavior and/or a minimal code sample.
-
-**Expected behavior**
-
-A description of what you expected to happen.
-
-**Additional information**
-
-Any additional information that is relevant to the problem.
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md b/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
deleted file mode 100644
index c608ccdc..00000000
--- a/redis-stable/.github/ISSUE_TEMPLATE/crash_report.md
+++ /dev/null
@@ -1,20 +0,0 @@
----
-name: Crash report
-about: Submit a crash report
-title: '[CRASH]'
-labels: ''
-assignees: ''
-
----
-
-**Crash report**
-
-Paste the complete crash log between the quotes below. Please include a few lines from the log preceding the crash report to provide some context.
-
-```
-```
-
-**Aditional information**
-
-1. OS distribution and version
-2. Steps to reproduce (if any)
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md b/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
deleted file mode 100644
index 732dc647..00000000
--- a/redis-stable/.github/ISSUE_TEMPLATE/feature_request.md
+++ /dev/null
@@ -1,24 +0,0 @@
----
-name: Feature request
-about: Suggest a feature for Redis
-title: '[NEW]'
-labels: ''
-assignees: ''
-
----
-
-**The problem/use-case that the feature addresses**
-
-A description of the problem that the feature will solve, or the use-case with which the feature will be used.
-
-**Description of the feature**
-
-A description of what you want to happen.
-
-**Alternatives you've considered**
-
-Any alternative solutions or features you've considered, including references to existing open and closed feature requests in this repository.
-
-**Additional information**
-
-Any additional information that is relevant to the feature request.
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md b/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
deleted file mode 100644
index e82cf002..00000000
--- a/redis-stable/.github/ISSUE_TEMPLATE/other_stuff.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-name: Other
-about: Can't find the right issue type? Use this one!
-title: ''
-labels: ''
-assignees: ''
-
----
diff --git a/redis-stable/.github/ISSUE_TEMPLATE/question.md b/redis-stable/.github/ISSUE_TEMPLATE/question.md
deleted file mode 100644
index 6acde0d0..00000000
--- a/redis-stable/.github/ISSUE_TEMPLATE/question.md
+++ /dev/null
@@ -1,21 +0,0 @@
----
-name: Question
-about: Ask the Redis developers
-title: '[QUESTION]'
-labels: ''
-assignees: ''
-
----
-
-Please keep in mind that this issue tracker should be used for reporting bugs or proposing improvements to the Redis server.
-
-Generally, questions about using Redis should be directed to the [community](https://redis.io/community):
-
-* [the mailing list](https://groups.google.com/forum/#!forum/redis-db)
-* [the `redis` tag at StackOverflow](http://stackoverflow.com/questions/tagged/redis)
-* [/r/redis subreddit](http://www.reddit.com/r/redis)
-* [the irc channel #redis](http://webchat.freenode.net/?channels=redis) on freenode
-
-It is also possible that your question was already asked here, so please do a quick issues search before submitting. Lastly, if your question is about one of Redis' [clients](https://redis.io/clients), you may to contact your client's developers for help.
-
-That said, please feel free to replace all this with your question :)
\ No newline at end of file
diff --git a/redis-stable/.github/workflows/ci.yml b/redis-stable/.github/workflows/ci.yml
deleted file mode 100644
index 39b332a1..00000000
--- a/redis-stable/.github/workflows/ci.yml
+++ /dev/null
@@ -1,60 +0,0 @@
-name: CI
-
-on: [push, pull_request]
-
-jobs:
-
-  test-ubuntu-latest:
-    runs-on: ubuntu-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      # Fail build if there are warnings
-      # build with TLS just for compilation coverage
-      run: make REDIS_CFLAGS='-Werror' BUILD_TLS=yes
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6
-        ./runtest --verbose
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-
-  build-ubuntu-old:
-    runs-on: ubuntu-16.04
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make REDIS_CFLAGS='-Werror'
-
-  build-macos-latest:
-    runs-on: macos-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make REDIS_CFLAGS='-Werror'
-
-  build-32bit:
-    runs-on: ubuntu-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        sudo apt-get update && sudo apt-get install libc6-dev-i386
-        make REDIS_CFLAGS='-Werror' 32bit
-
-  build-libc-malloc:
-    runs-on: ubuntu-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make REDIS_CFLAGS='-Werror' MALLOC=libc
-
-  build-centos7-jemalloc:
-    runs-on: ubuntu-latest
-    container: centos:7
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        yum -y install gcc make
-        make REDIS_CFLAGS='-Werror'
diff --git a/redis-stable/.github/workflows/daily.yml b/redis-stable/.github/workflows/daily.yml
deleted file mode 100644
index 432971a9..00000000
--- a/redis-stable/.github/workflows/daily.yml
+++ /dev/null
@@ -1,308 +0,0 @@
-name: Daily
-
-on:
-  pull_request:
-    branches:
-      # any PR to a release branch.
-      - '[0-9].[0-9]'
-  schedule:
-    - cron: '0 0 * * *'
-
-jobs:
-
-  test-ubuntu-jemalloc:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make REDIS_CFLAGS='-Werror -DREDIS_TEST'
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-    - name: unittest
-      run: ./src/redis-server test all
-
-  test-ubuntu-libc-malloc:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make MALLOC=libc
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-
-  test-ubuntu-no-malloc-usable-size:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make MALLOC=libc CFLAGS=-DNO_MALLOC_USABLE_SIZE
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-
-  test-ubuntu-32bit:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        sudo apt-get update && sudo apt-get install libc6-dev-i386
-        make 32bit REDIS_CFLAGS='-Werror -DREDIS_TEST'
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: |
-        make -C tests/modules 32bit # the script below doesn't have an argument, we must build manually ahead of time
-        ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-    - name: unittest
-      run: ./src/redis-server test all
-
-  test-ubuntu-tls:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        make BUILD_TLS=yes
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6 tcl-tls
-        ./utils/gen-test-certs.sh
-        ./runtest --accurate --verbose --tls --dump-logs
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: |
-        ./runtest-moduleapi --verbose --tls
-        ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: |
-        ./runtest-sentinel --tls
-        ./runtest-sentinel
-    - name: cluster tests
-      run: |
-        ./runtest-cluster --tls
-        ./runtest-cluster
-
-  test-ubuntu-io-threads:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        make
-    - name: test
-      run: |
-        sudo apt-get install tcl8.6 tcl-tls
-        ./runtest --config io-threads 4 --config io-threads-do-reads yes --accurate --verbose --tags network --dump-logs
-    - name: cluster tests
-      run: |
-        ./runtest-cluster --config io-threads 4 --config io-threads-do-reads yes
-
-  test-valgrind:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make valgrind REDIS_CFLAGS='-Werror -DREDIS_TEST'
-    - name: test
-      run: |
-        sudo apt-get update
-        sudo apt-get install tcl8.6 valgrind -y
-        ./runtest --valgrind --verbose --clients 1 --tags -large-memory --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --valgrind --no-latency --verbose --clients 1
-    - name: unittest
-      run: |
-        valgrind --track-origins=yes --suppressions=./src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full --log-file=err.txt ./src/redis-server test all
-        if grep -q 0x err.txt; then cat err.txt; exit 1; fi
-
-  test-valgrind-no-malloc-usable-size:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make valgrind CFLAGS="-DNO_MALLOC_USABLE_SIZE"
-    - name: test
-      run: |
-        sudo apt-get update
-        sudo apt-get install tcl8.6 valgrind -y
-        ./runtest --valgrind --verbose --clients 1 --tags -large-memory --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --valgrind --no-latency --verbose --clients 1
-
-  test-centos7-jemalloc:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    container: centos:7
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        yum -y install gcc make
-        make
-    - name: test
-      run: |
-        yum -y install which tcl
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-
-  test-centos7-tls:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    container: centos:7
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-        yum -y install centos-release-scl epel-release
-        yum -y install devtoolset-7 openssl-devel openssl
-        scl enable devtoolset-7 "make BUILD_TLS=yes"
-    - name: test
-      run: |
-        yum -y install tcl tcltls
-        ./utils/gen-test-certs.sh
-        ./runtest --accurate --verbose --tls --dump-logs
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: |
-        ./runtest-moduleapi --verbose --tls
-        ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: |
-        ./runtest-sentinel --tls
-        ./runtest-sentinel
-    - name: cluster tests
-      run: |
-        ./runtest-cluster --tls
-        ./runtest-cluster
-
-  test-macos-latest:
-    runs-on: macos-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: make
-    - name: test
-      run: |
-        ./runtest --accurate --verbose --no-latency --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-
-  test-freebsd:
-    runs-on: macos-latest
-    if: github.repository == 'redis/redis'
-    timeout-minutes: 14400
-    steps:
-    - uses: actions/checkout@v2
-    - name: test
-      uses: vmactions/freebsd-vm@v0.1.4
-      with:
-        usesh: true
-        sync: rsync
-        prepare: pkg install -y bash gmake lang/tcl86
-        run: >
-          gmake &&
-          ./runtest --accurate --verbose --no-latency --tags -large-memory --dump-logs &&
-          MAKE=gmake ./runtest-moduleapi --verbose &&
-          ./runtest-sentinel &&
-          ./runtest-cluster
-
-  test-alpine-jemalloc:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    container: alpine:latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-          apk add build-base
-          make REDIS_CFLAGS='-Werror'
-    - name: test
-      run: |
-        apk add tcl procps
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
-
-  test-alpine-libc-malloc:
-    runs-on: ubuntu-latest
-    if: github.repository == 'redis/redis'
-    container: alpine:latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: make
-      run: |
-          apk add build-base
-          make REDIS_CFLAGS='-Werror' USE_JEMALLOC=no CFLAGS=-DUSE_MALLOC_USABLE_SIZE
-    - name: test
-      run: |
-        apk add tcl procps
-        ./runtest --accurate --verbose --dump-logs
-    - name: module api test
-      run: ./runtest-moduleapi --verbose
-    - name: sentinel tests
-      run: ./runtest-sentinel
-    - name: cluster tests
-      run: ./runtest-cluster
diff --git a/redis-stable/.gitignore b/redis-stable/.gitignore
deleted file mode 100644
index dd9d4b80..00000000
--- a/redis-stable/.gitignore
+++ /dev/null
@@ -1,40 +0,0 @@
-.*.swp
-*.o
-*.xo
-*.so
-*.d
-*.log
-dump.rdb
-redis-benchmark
-redis-check-aof
-redis-check-rdb
-redis-check-dump
-redis-cli
-redis-sentinel
-redis-server
-doc-tools
-release
-misc/*
-src/release.h
-appendonly.aof
-SHORT_TERM_TODO
-release.h
-src/transfer.sh
-src/configs
-redis.ds
-src/redis.conf
-src/nodes.conf
-deps/lua/src/lua
-deps/lua/src/luac
-deps/lua/src/liblua.a
-tests/tls/*
-.make-*
-.prerequisites
-*.dSYM
-Makefile.dep
-.vscode/*
-.idea/*
-.ccls
-.ccls-cache/*
-compile_commands.json
-redis.code-workspace
diff --git a/redis-stable/00-RELEASENOTES b/redis-stable/00-RELEASENOTES
deleted file mode 100644
index 62d1def1..00000000
--- a/redis-stable/00-RELEASENOTES
+++ /dev/null
@@ -1,692 +0,0 @@
-Redis 6.2 release notes
-=======================
-
---------------------------------------------------------------------------------
-Upgrade urgency levels:
-
-LOW:      No need to upgrade unless there are new features you want to use.
-MODERATE: Program an upgrade of the server, but it's not urgent.
-HIGH:     There is a critical bug that may affect a subset of users. Upgrade!
-CRITICAL: There is a critical bug affecting MOST USERS. Upgrade ASAP.
-SECURITY: There are security fixes in the release.
---------------------------------------------------------------------------------
-
-================================================================================
-Redis 6.2.6 Released Mon Oct 4 12:00:00 IDT 2021
-================================================================================
-
-Upgrade urgency: SECURITY, contains fixes to security issues.
-
-Security Fixes:
-* (CVE-2021-41099) Integer to heap buffer overflow handling certain string
-  commands and network payloads, when proto-max-bulk-len is manually configured
-  to a non-default, very large value [reported by yiyuaner].
-* (CVE-2021-32762) Integer to heap buffer overflow issue in redis-cli and
-  redis-sentinel parsing large multi-bulk replies on some older and less common
-  platforms [reported by Microsoft Vulnerability Research].
-* (CVE-2021-32687) Integer to heap buffer overflow with intsets, when
-  set-max-intset-entries is manually configured to a non-default, very large
-  value [reported by Pawel Wieczorkiewicz, AWS].
-* (CVE-2021-32675) Denial Of Service when processing RESP request payloads with
-  a large number of elements on many connections.
-* (CVE-2021-32672) Random heap reading issue with Lua Debugger [reported by
-  Meir Shpilraien].
-* (CVE-2021-32628) Integer to heap buffer overflow handling ziplist-encoded
-  data types, when configuring a large, non-default value for
-  hash-max-ziplist-entries, hash-max-ziplist-value, zset-max-ziplist-entries
-  or zset-max-ziplist-value [reported by sundb].
-* (CVE-2021-32627) Integer to heap buffer overflow issue with streams, when
-  configuring a non-default, large value for proto-max-bulk-len and
-  client-query-buffer-limit [reported by sundb].
-* (CVE-2021-32626) Specially crafted Lua scripts may result with Heap buffer
-  overflow [reported by Meir Shpilraien].
-
-Bug fixes that involve behavior changes:
-* GEO* STORE with empty source key deletes the destination key and return 0 (#9271)
-  Previously it would have returned an empty array like the non-STORE variant.
-* PUBSUB NUMPAT replies with number of patterns rather than number of subscriptions (#9209)
-  This actually changed in 6.2.0 but was overlooked and omitted from the release notes.
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* Fix CLIENT PAUSE, used an old timeout from previous PAUSE (#9477)
-* Fix CLIENT PAUSE in a replica would mess the replication offset (#9448)
-* Add some missing error statistics in INFO errorstats (#9328)
-
-Other bug fixes:
-* Fix incorrect reply of COMMAND command key positions for MIGRATE command (#9455)
-* Fix appendfsync to always guarantee fsync before reply, on MacOS and FreeBSD (kqueue) (#9416)
-* Fix the wrong mis-detection of sync_file_range system call, affecting performance (#9371)
-
-CLI tools:
-* When redis-cli received ASK response, it didn't handle it (#8930)
-
-Improvements:
-* Add latency monitor sample when key is deleted via lazy expire (#9317)
-* Sanitize corrupt payload improvements (#9321, #9399)
-* Delete empty keys when loading RDB file or handling a RESTORE command (#9297, #9349)
-
-================================================================================
-Redis 6.2.5 Released Wed Jul 21 16:32:19 IDT 2021
-================================================================================
-
-Upgrade urgency: SECURITY, contains fixes to security issues that affect
-authenticated client connections on 32-bit versions. MODERATE otherwise.
-
-Fix integer overflow in BITFIELD on 32-bit versions (CVE-2021-32761).
-An integer overflow bug in Redis version 2.2 or newer can be exploited using the
-BITFIELD command to corrupt the heap and potentially result with remote code
-execution.
-
-Bug fixes that involve behavior changes:
-* Change reply type for ZPOPMAX/MIN with count in RESP3 to nested array (#8981).
-  Was using a flat array like in RESP2 instead of a nested array like ZRANGE does.
-* Fix reply type for HRANDFIELD and ZRANDMEMBER when key is missing (#9178).
-  Was using a null array instead of an empty array.
-* Fix reply type for ZRANGESTORE when source key is missing (#9089).
-  Was using an empty array like ZRANGE instead of 0 (used in the STORE variant).
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* ZRANDMEMBER WITHSCORES with negative COUNT may return bad score (#9162)
-* Fix crash after CLIENT UNPAUSE when threaded I/O config is enabled (#9041)
-* Fix XTRIM or XADD with LIMIT may delete more entries than the limit (#9048)
-* Fix build issue with OpenSSL 1.1.0 (#9233)
-
-Other bug fixes:
-* Fail EXEC command in case a watched key is expired (#9194)
-* Fix SMOVE not to invalidate dest key (WATCH and tracking) when member already exists (#9244)
-* Fix SINTERSTORE not to delete dest key when getting a wrong type error (#9032)
-* Fix overflows on 32-bit versions in GETBIT, SETBIT, BITCOUNT, BITPOS, and BITFIELD (#9191)
-* Improve MEMORY USAGE on stream keys (#9164)
-* Set TCP keepalive on inbound cluster bus connections (#9230)
-* Fix diskless replica loading to recover from RDB short read on module AUX data (#9199)
-* Fix race in client side tracking (#9116)
-* Fix ziplist length updates on big-endian platforms (#2080)
-
-CLI tools:
-* redis-cli cluster import command may issue wrong MIGRATE command, sending COPY instead of REPLACE (#8945)
-* redis-cli --rdb fixes when using "-" to write to stdout (#9136, #9135)
-* redis-cli support for RESP3 set type in CSV and RAW output (#7338)
-
-Modules:
-* Module API for getting current command name (#8792)
-* Fix RM_StringTruncate when newlen is 0 (#3718)
-* Fix CLIENT UNBLOCK crashing modules without timeout callback (#9167)
-
-================================================================================
-Redis 6.2.4 Released Tue June 1 12:00:00 IST 2021
-================================================================================
-
-Upgrade urgency: SECURITY, Contains fixes to security issues that affect
-authenticated client connections. MODERATE otherwise.
-
-Fix integer overflow in STRALGO LCS (CVE-2021-32625)
-An integer overflow bug in Redis version 6.0 or newer can be exploited using the
-STRALGO LCS command to corrupt the heap and potentially result with remote code
-execution. This is a result of an incomplete fix by CVE-2021-29477.
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* Fix crash after a diskless replication fork child is terminated (#8991)
-* Fix redis-benchmark crash on unsupported configs (#8916)
-
-Other bug fixes:
-* Fix crash in UNLINK on a stream key with deleted consumer groups (#8932)
-* SINTERSTORE: Add missing keyspace del event when none of the sources exist (#8949)
-* Sentinel: Fix CONFIG SET of empty string sentinel-user/sentinel-pass configs (#8958)
-* Enforce client output buffer soft limit when no traffic (#8833)
-
-Improvements:
-* Hide AUTH passwords in MIGRATE command from slowlog (#8859)
-
-================================================================================
-Redis 6.2.3 Released Mon May 3 19:00:00 IST 2021
-================================================================================
-
-Upgrade urgency: SECURITY, Contains fixes to security issues that affect
-authenticated client connections. LOW otherwise.
-
-Integer overflow in STRALGO LCS command (CVE-2021-29477):
-An integer overflow bug in Redis version 6.0 or newer could be exploited using
-the STRALGO LCS command to corrupt the heap and potentially result in remote
-code execution. The integer overflow bug exists in all versions of Redis
-starting with 6.0.
-
-Integer overflow in COPY command for large intsets (CVE-2021-29478):
-An integer overflow bug in Redis 6.2 could be exploited to corrupt the heap and
-potentially result with remote code execution. The vulnerability involves
-changing the default set-max-intset-entries configuration value, creating a
-large set key that consists of integer values and using the COPY command to
-duplicate it. The integer overflow bug exists in all versions of Redis starting
-with 2.6, where it could result with a corrupted RDB or DUMP payload, but not
-exploited through COPY (which did not exist before 6.2).
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* Fix memory leak in moduleDefragGlobals (#8853)
-* Fix memory leak when doing lazy freeing client tracking table (#8822)
-* Block abusive replicas from sending command that could assert and crash redis (#8868)
-
-Other bug fixes:
-* Use a monotonic clock to check for Lua script timeout (#8812)
-* redis-cli: Do not use unix socket when we got redirected in cluster mode (#8870)
-
-Modules:
-* Fix RM_GetClusterNodeInfo() to correctly populate master id (#8846)
-
-================================================================================
-Redis 6.2.2 Released Mon April 19 19:00:00 IST 2021
-================================================================================
-
-Upgrade urgency: HIGH, if you're using ACL and pub/sub, CONFIG REWRITE, or
-suffering from performance regression. see below.
-
-Bug fixes for regressions in previous releases of Redis 6.2:
-* Fix BGSAVE, AOFRW, and replication slowdown due to child reporting CoW (#8645)
-* Fix short busy loop when timer event is about to fire (#8764)
-* Fix default user, overwritten and reset users losing pubsub channel permissions (#8723)
-* Fix config rewrite with an empty `save` config resulsing in default `save` values (#8719)
-* Fix not starting on alpine/libmusl without IPv6 (#8655)
-* Fix issues with propagation and MULTI/EXEC in modules (#8617)
-  Several issues around nested calls and thread safe contexts
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* ACL Pub/Sub channels permission handling for save/load scenario (#8794)
-* Fix early rejection of PUBLISH inside MULTI-EXEC transaction (#8534)
-* Fix missing SLOWLOG records for blocked commands (#8632)
-* Allow RESET command during busy scripts (#8629)
-* Fix some error replies were not counted on stats (#8659)
-
-Bug fixes:
-* Add a timeout mechanism for replicas stuck in fullsync (#8762)
-* Process HELLO command even if the default user has no permissions (#8633)
-* Client issuing a long running script and using a pipeline, got disconnected (#8715)
-* Fix script kill to work also on scripts that use `pcall` (#8661)
-* Fix list-compress-depth may compress more node than required (#8311)
-* Fix redis-cli handling of rediss:// URL scheme (#8705)
-* Cluster: Skip unnecessary check which may prevent failure detection (#8585)
-* Cluster: Fix hang manual failover when replica just started (#8651)
-* Sentinel: Fix info-refresh time field before sentinel get first response (#8567)
-* Sentinel: Fix possible crash on failed connection attempt (#8627)
-* Systemd: Send the readiness notification when a replica is ready to accept connections (#8409)
-
-Command behavior changes:
-* ZADD: fix wrong reply when INCR used with GT/LT which blocked the update (#8717)
-  It was responding with the incremented value rather than nil
-* XAUTOCLAIM: fix response to return the next available id as the cursor (#8725)
-  Previous behavior was retuning the last one which was already scanned
-* XAUTOCLAIM: fix JUSTID to prevent incrementing delivery_count (#8724)
-
-New config options:
-* Add cluster-allow-replica-migration config option (#5285)
-* Add replica-announced config option (#8653)
-* Add support for plaintext clients in TLS cluster (#8587)
-* Add support for reading encrypted keyfiles (#8644)
-
-Improvements:
-* Fix performance regression in BRPOP on Redis 6.0 (#8689)
-* Avoid adding slowlog entries for config with sensitive data (#8584)
-* Improve redis-cli non-binary safe string handling (#8566)
-* Optimize CLUSTER SLOTS reply (#8541)
-* Handle remaining fsync errors (#8419)
-
-Info fields and introspection changes:
-* Strip % sign from current_fork_perc info field (#8628)
-* Fix RSS memory info on FreeBSD (#8620)
-* Fix client_recent_max_input/output_buffer in 'INFO CLIENTS' when all clients drop (#8588)
-* Fix invalid master_link_down_since_seconds in info replication (#8785)
-
-Platform and deployment-related changes:
-* Fix FreeBSD <12.x builds (#8603)
-
-Modules:
-* Add macros for RedisModule_log logging levels (#4246)
-* Add RedisModule_GetAbsExpire / RedisModule_SetAbsExpire (#8564)
-* Add a module type for key space notification (#8759)
-* Set module eviction context flag only in masters (#8631)
-* Fix unusable RedisModule_IsAOFClient API (#8596)
-* Fix missing EXEC on modules propagation after failed EVAL execution (#8654)
-* Fix edge-case when a module client is unblocked (#8618)
-
-================================================================================
-Redis 6.2.1 Released Mon Mar  1 17:51:36 IST 2021
-================================================================================
-
-Upgrade urgency: LOW.
-
-Here is a comprehensive list of changes in this release compared to 6.2.0,
-each one includes the PR number that added it, so you can get more details
-at https://github.com/redis/redis/pull/<number>
-
-Bug fixes:
-* Fix sanitize-dump-payload for stream with deleted records (#8568)
-* Prevent client-query-buffer-limit config from being set to lower than 1mb (#8557)
-
-Improvements:
-* Make port, tls-port and bind config options modifiable at runtime (#8510)
-
-Platform and deployment-related changes:
-* Fix compilation error on non-glibc systems if jemalloc is not used (#8533)
-* Improved memory consumption and memory usage tracking on FreeBSD (#8545)
-* Fix compilation on ARM64 MacOS with jemalloc (#8458)
-
-Modules:
-* New Module API for getting user name of a client (#8508)
-* Optimize RM_Call by utilizing a shared reusable client (#8516)
-* Fix crash running CLIENT INFO via RM_Call (#8560)
-
-================================================================================
-Redis 6.2.0 GA  Released Tue Feb 22 14:00:00 IST 2021
-================================================================================
-
-Upgrade urgency: SECURITY if you use 32bit build of redis (see bellow), MODERATE
-if you used earlier versions of Redis 6.2, LOW otherwise.
-
-Integer overflow on 32-bit systems (CVE-2021-21309):
-Redis 4.0 or newer uses a configurable limit for the maximum supported bulk
-input size. By default, it is 512MB which is a safe value for all platforms.
-If the limit is significantly increased, receiving a large request from a client
-may trigger several integer overflow scenarios, which would result with buffer
-overflow and heap corruption.
-
-Here is a comprehensive list of changes in this release compared to 6.2 RC3,
-each one includes the PR number that added it, so you can get more details
-at https://github.com/redis/redis/pull/<number>
-
-Bug fixes:
-* Avoid 32-bit overflows when proto-max-bulk-len is set high (#8522)
-* Fix broken protocol in client tracking tracking-redir-broken message (#8456)
-* Avoid unsafe field name characters in INFO commandstats, errorstats, modules (#8492)
-* XINFO able to access expired keys during CLIENT PAUSE WRITE (#8436)
-* Fix allowed length for REPLCONF ip-address, needed due to Sentinel's support for hostnames (#8517)
-* Fix broken protocol in redis-benchmark when used with -a or --dbnum (#8486)
-* XADD counts deleted records too when considering switching to a new listpack (#8390)
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* Fixes in GEOSEARCH bybox (accuracy and mismatch between width and height) (#8445)
-* Fix risk of OOM panic in HRANDFIELD, ZRANDMEMBER commands with huge negative count (#8429)
-* Fix duplicate replicas issue in Sentinel, needed due to hostname support (#8481)
-* Fix Sentinel configuration rewrite, an improvement of #8271 (#8480)
-
-Command behavior changes:
-* SRANDMEMBER uses RESP3 array type instead of set type (#8504)
-* EXPIRE, EXPIREAT, SETEX, GETEX: Return error when provided expire time overflows (#8287)
-
-Other behavior changes:
-* Remove ACL subcommand validation if fully added command exists. (#8483)
-
-Improvements:
-* Optimize sorting in GEORADIUS / GEOSEARCH with COUNT (#8326)
-* Optimize HRANDFIELD and ZRANDMEMBER case 4 when ziplist encoded (#8444)
-* Optimize in-place replacement of elements in HSET, HINCRBY, LSET (#8493)
-* Remove redundant list to store pubsub patterns (#8472)
-* Add --insecure option to command line tools (#8416)
-
-Info fields and introspection changes:
-* Add INFO fields to track progress of BGSAVE, AOFRW, replication (#8414)
-
-Modules:
-* RM_ZsetRem: Delete key if empty, the bug could leave empty zset keys (#8453)
-* RM_HashSet: Add COUNT_ALL flag and set errno (#8446)
-
-================================================================================
-Redis 6.2 RC3   Released Tue Feb 1 14:00:00 IST 2021
-================================================================================
-
-Upgrade urgency LOW: This is the third Release Candidate of Redis 6.2.
-
-Here is a comprehensive list of changes in this release compared to 6.2 RC2,
-each one includes the PR number that added it, so you can get more details
-at https://github.com/redis/redis/pull/<number>
-
-New commands / args:
-* Add HRANDFIELD and ZRANDMEMBER commands (#8297)
-* Add FAILOVER command (#8315)
-* Add GETEX, GETDEL commands (#8327)
-* Add PXAT/EXAT arguments to SET command (#8327)
-* Add SYNC arg to FLUSHALL and FLUSHDB, and ASYNC/SYNC arg to SCRIPT FLUSH (#8258)
-
-Sentinel:
-* Add hostname support to Sentinel (#8282)
-* Prevent file descriptors from leaking into Sentinel scripts (#8242)
-* Fix config file line order dependency and config rewrite sequence (#8271)
-
-New configuration options:
-* Add set-proc-title config option to disable changes to the process title (#3623)
-* Add proc-title-template option to control what's shown in the process title (#8397)
-* Add lazyfree-lazy-user-flush config option to control FLUSHALL, FLUSHDB and SCRIPT FLUSH (#8258)
-
-Bug fixes:
-* AOF: recover from last write error by turning on/off appendonly config (#8030)
-* Exit on fsync error when the AOF fsync policy is 'always' (#8347)
-* Avoid assertions (on older kernels) when testing arm64 CoW bug (#8405)
-* CONFIG REWRITE should honor umask settings (#8371)
-* Fix firstkey,lastkey,step in COMMAND command for some commands (#8367)
-
-Special considerations:
-* Fix misleading description of the save configuration directive (#8337)
-
-Improvements:
-* A way to get RDB file via replication without excessive replication buffers (#8303)
-* Optimize performance of clusterGenNodesDescription for large clusters (#8182)
-
-Info fields and introspection changes:
-* SLOWLOG and LATENCY monitor include unblocking time of blocked commands (#7491)
-
-Modules:
-* Add modules API for streams (#8288)
-* Add event for fork child birth and termination (#8289)
-* Add RM_BlockedClientMeasureTime* etc, to track background processing in commandstats (#7491)
-* Fix bug in v6.2, wrong value passed to the new unlink callback (#8381)
-* Fix bug in v6.2, modules blocked on keys unblock on commands like LPUSH (#8356)
-
-================================================================================
-Redis 6.2 RC2   Released Tue Jan 12 16:17:20 IST 2021
-================================================================================
-
-Upgrade urgency LOW: This is the second Release Candidate of Redis 6.2.
-
-IMPORTANT: If you're running Redis on ARM64 or a big-endian system, upgrade may
-have significant implications. Please be sure to read the notes below.
-
-Here is a comprehensive list of changes in this release compared to 6.2 RC1,
-each one includes the PR number that added it, so you can get more details
-at https://github.com/redis/redis/pull/<number>
-
-New commands / args:
-* Add the REV, BYLEX and BYSCORE arguments to ZRANGE, and the ZRANGESTORE command (#7844)
-* Add the XAUTOCLAIM command (#7973)
-* Add the MINID trimming strategy and the LIMIT argument to XADD and XTRIM (#8169)
-* Add the ANY argument to GEOSEARCH and GEORADIUS (#8259)
-* Add the CH, NX, XX arguments to GEOADD (#8227)
-* Add the COUNT argument to LPOP and RPOP (#8179)
-* Add the WRITE argument to CLIENT PAUSE for pausing write commands exclusively (#8170)
-* Change the proto-ver argument of HELLO to optional (#7377)
-* Add the CLIENT TRACKINGINFO subcommand (#7309)
-
-Command behavior changes:
-* CLIENT TRACKING yields an error when given overlapping BCAST prefixes (#8176)
-* SWAPDB invalidates WATCHed keys (#8239)
-* SORT command behaves differently when used on a writable replica (#8283)
-
-Other behavior changes:
-* Avoid propagating MULTI/EXEC for read-only transactions (#8216)
-* Remove the read-only flag from TIME, ECHO, ROLE, LASTSAVE (#8216)
-* Fix the command flags of PFDEBUG (#8222)
-* Tracking clients will no longer receive unnecessary key invalidation messages after FLUSHDB (#8039)
-* Sentinel: Fix missing updates to the config file after SENTINEL SET command (#8229)
-
-Bug fixes with compatibility implications (bugs introduced in Redis 6.0):
-* Fix RDB CRC64 checksum on big-endian systems (#8270)
-  If you're using big-endian please consider the compatibility implications with
-  RESTORE, replication and persistence.
-* Fix wrong order of key/value in Lua's map response (#8266)
-  If your scripts use redis.setresp() or return a map (new in Redis 6.0), please
-  consider the implications.
-
-Bug fixes that are only applicable to previous releases of Redis 6.2:
-* Resolve rare assertions in active defragmentation while loading (#8284, #8281)
-
-Bug fixes:
-* Fix the selection of a random element from large hash tables (#8133)
-* Fix an issue where a forked process deletes the parent's pidfile (#8231)
-* Fix crashes when enabling io-threads-do-reads (#8230)
-* Fix a crash in redis-cli after executing cluster backup (#8267)
-* Fix redis-benchmark to use an IP address for the first cluster node (#8154)
-* Fix saving of strings larger than 2GB into RDB files (#8306)
-
-Additional improvements:
-* Improve replication handshake time (#8214)
-* Release client tracking table memory asynchronously in cases where the DB is also freed asynchronously (#8039)
-* Avoid wasteful transient memory allocation in certain cases (#8286, #5954)
-* Handle binary string values by the 'requirepass' and 'masterauth' configs (#8200)
-
-Platform and deployment-related changes:
-* Install redis-check-rdb and redis-check-aof as symlinks to redis-server (#5745)
-* Add a check for an ARM64 Linux kernel bug (#8224)
-  Due to the potential severity of this issue, Redis will refuse to run on
-  affected platforms by default.
-
-Info fields and introspection changes:
-* Add the errorstats section to the INFO command (#8217)
-* Add the failed_calls and rejected_calls fields INFO's commandstats section (#8217)
-* Report child copy-on-write metrics continuously (#8264)
-
-Module API changes:
-* Add the RedisModule_SendChildCOWInfo API (#8264)
-* Add the may-replicate command flag (#8170)
-
-================================================================================
-Redis 6.2 RC1   Released Mon Dec 14 11:50:00 IST 2020
-================================================================================
-
-Upgrade urgency LOW: This is the first Release Candidate of Redis 6.2.
-
-Introduction to the Redis 6.2 release
-=====================================
-
-This release is the first significant Redis release managed by the core team
-under the new project governance model.
-
-Redis 6.2 includes many new commands and improvements, but no big features. It
-mainly makes Redis more complete and addresses issues that have been requested
-by many users frequently or for a long time.
-
-Many of these changes were not eligible for 6.0.x for several reasons:
-
-1. They are not backward compatible, which is always the case with new or
-   extended commands (that cannot be replicated to an older replica).
-2. They require a longer release-candidate test cycle.
-
-
-Here is a comprehensive list of changes in this release compared to 6.0.9,
-each one includes the PR number that added it, so you can get more details
-at https://github.com/redis/redis/pull/<number>
-
-New commands / args:
-* Add SMISMEMBER command that checks multiple members (#7615)
-* Add ZMSCORE command that returns an array of scores (#7593)
-* Add LMOVE and BLMOVE commands that pop and push arbitrarily (#6929)
-* Add RESET command that resets client connection state (#7982)
-* Add COPY command that copies keys (#7953)
-* Add ZDIFF and ZDIFFSTORE commands (#7961)
-* Add ZINTER and ZUNION commands (#7794)
-* Add GEOSEARCH/GEOSEARCHSTORE commands for bounding box spatial queries (#8094)
-* Add GET parameter to SET command, for more powerful GETSET (#7852)
-* Add exclusive range query to XPENDING (#8130)
-* Add exclusive range query to X[REV]RANGE (#8072)
-* Add GT and LT options to ZADD for conditional score updates (#7818)
-* Add CLIENT INFO and CLIENT LIST for specific ids (#8113)
-* Add IDLE argument to XPENDING command (#7972)
-* Add local address to CLIENT LIST, and a CLIENT KILL filter. (#7913)
-* Add NOMKSTREAM option to XADD command (#7910)
-* Add command introspection to Sentinel (#7940)
-* Add SENTINEL MYID subcommand (#7858)
-
-New features:
-* Dump payload sanitization: prevent corrupt payload causing crashes (#7807)
-  Has flags to enable full O(N) validation (disabled by default).
-* ACL patterns for Pub/Sub channels (#7993)
-* Support ACL for Sentinel mode (#7888)
-* Support getting configuration from both stdin and file at the same time (#7893)
-  Lets you avoid storing secrets on the disk.
-
-New features in CLI tools:
-* redis-cli RESP3 push support (#7609)
-* redis-cli cluster import support source and target that require auth (#7994)
-* redis-cli URIs able to provide user name in addition to password (#8048)
-* redis-cli/redis-benchmark allow specifying the prefered ciphers/ciphersuites (#8005)
-* redis-cli add -e option to exit with code when command execution fails (#8136)
-
-Command behavior changes:
-* EXISTS should not alter LRU (#8016)
-  In Redis 5.0 and 6.0 it would have touched the LRU/LFU of the key.
-* OBJECT should not reveal logically expired keys (#8016)
-  Will now behave the same TYPE or any other non-DEBUG command.
-* Improve db id range check for SELECT and MOVE (#8085)
-  Changes the error message text on a wrong db index.
-* Modify AUTH / HELLO error message (#7648)
-  Changes the error message text when the user isn't found or is disabled.
-* BITOPS length limited to proto_max_bulk_len rather than 512MB (#8096)
-  The limit is now configurable like in SETRANGE, and APPEND.
-* GEORADIUS[BYMEMBER] can fail with -OOM if Redis is over the memory limit (#8107)
-
-Other behavior changes:
-* Optionally (default) fail to start if requested bind address is not available (#7936)
-  If you rely on Redis starting successfully even if one of the bind addresses
-  is not available, you'll need to tune the new config.
-* Limit the main db dictionaries expansion to prevent key eviction (#7954)
-  In the past big dictionary rehashing could result in massive data eviction.
-  Now this rehashing is delayed (up to a limit), which can result in performance
-  loss due to hash collisions.
-* CONFIG REWRITE is atomic and safer, but requires write access to the config file's folder (#7824, #8051)
-  This change was already present in 6.0.9, but was missing from the release
-  notes.
-* A new incremental eviction mechanism that reduces latency on eviction spikes (#7653)
-  In pathological cases this can cause memory to grow uncontrolled and may require
-  specific tuning.
-* Not resetting "save" config when Redis is started with command line arguments. (#7092)
-  In case you provide command line arguments without "save" and count on it
-  being disabled, Now the defaults "save" config will kick in.
-* Update memory metrics for INFO during loading (#7690)
-* When "supervised" config is enabled, it takes precedence over "daemonize". (#8036)
-* Assertion and panic, print crash log without generating SIGSEGV (#7585)
-* Added crash log report on SIGABRT, instead of silently exiting (#8004)
-* Disable THP (Transparent Huge Pages) if enabled (#7381)
-  If you deliberately enabled it, you'll need to config Redis to keep it.
-
-Bug fixes:
-* Handle output buffer limits for module blocked clients (#8141)
-  Could result in a module sending reply to a blocked client to go beyond the
-  limit.
-* Fix setproctitle related crashes. (#8150, #8088)
-  Caused various crashes on startup, mainly on Apple M1 chips or under
-  instrumentation.
-* A module doing RM_Call could cause replicas to get nested MULTI (#8097).
-* Backup/restore cluster mode keys to slots map for repl-diskless-load=swapdb (#8108)
-  In cluster mode with repl-diskless-load, when loading failed, slot map
-  wouldn't have been restored.
-* Fix oom-score-adj-values range, and bug when used in config file (#8046)
-  Enabling setting this in the config file in a line after enabling it, would
-  have been buggy.
-* Reset average ttl when empty databases (#8106)
-  Just causing misleading metric in INFO
-* Disable rehash when Redis has child process (#8007)
-  This could have caused excessive CoW during BGSAVE, replication or AOFRW.
-* Further improved ACL algorithm for picking categories (#7966)
-  Output of ACL GETUSER is now more similar to the one provided by ACL SETUSER.
-* Fix bug with module GIL being released prematurely (#8061)
-  Could in theory (and rarely) cause multi-threaded modules to corrupt memory.
-* Fix cluster redirect for module command with no firstkey. (#7539)
-* Reduce effect of client tracking causing feedback loop in key eviction (#8100)
-* Kill disk-based fork child when all replicas drop and 'save' is not enabled (#7819)
-* Rewritten commands (modified for propagation) are logged as their original command (#8006)
-* Fix cluster access to unaligned memory (SIGBUS on old ARM) #7958
-* If diskless repl child is killed, make sure to reap the child pid (#7742)
-* Broadcast a PONG message when slot's migration is over, may reduce MOVED responses (#7571)
-
-Other improvements:
-* TLS Support in redis-benchmark (#7959)
-* Accelerate diskless master connections, and general re-connections (#6271)
-* Run active defrag while blocked / loading (#7726)
-* Performance and memory reporting improvement - sds take control of its internal fragmentation (#7875)
-* Speedup cluster failover. (#7948)
-
-Platform / toolchain support related improvements:
-* Optionally (not by default) use H/W Monotonic clock for faster time sampling (#7644)
-* Remove the requirements for C11 and _Atomic supporting compiler (#7707)
-  This would allow to more easily build and use Redis on older systems and
-  compilers again.
-* Fix crash log registers output on ARM. (#8020)
-* Raspberry build fix. (#8095)
-* Setting process title support for Haiku. (#8060)
-* DragonFlyBSD RSS memory sampling support. (#8023)
-
-New configuration options:
-* Enable configuring OpenSSL using the standard openssl.cnf (#8143)
-* oom-score-adj-values config can now take absolute values (besides relative ones) (#8046)
-* TLS: Add different client cert support. (#8076)
-* Note that a few other changes listed above added their config options.
-
-Info fields and introspection changes:
-* Add INFO fields to track diskless and disk-based replication progress (#7981)
-* Add INFO field for main thread cpu time, and scrape system time. (#8132)
-* Add total_forks to INFO STATS (#8155)
-* Add maxclients and cluster_connections to INFO CLIENTS (#7979)
-* Add tracking bcast flag and client redirection in client list (#7995)
-* Fixed INFO client_recent_max_input_buffer includes argv array (#8065, see #7874)
-* Note that a few other changes listed above added their info fields.
-
-Module API changes:
-* Add CTX_FLAGS_DENY_BLOCKING as a unified the way to know if blocking is allowed (#8025)
-* Add data type callbacks for lazy free effort, and unlink (#7912)
-* Add data type callback for COPY command (#8112)
-* Add callbacks for defrag support. (#8149)
-* Add module event for repl-diskless-load swapdb (#8153)
-
-Module related fixes:
-* Moved RMAPI_FUNC_SUPPORTED so that it's usable (#8037)
-* Improve timer accuracy (#7987)
-* Allow '\0' inside of result of RM_CreateStringPrintf (#6260)
-
-
-Thanks to all the users and developers who made this release possible.
-We'll follow up with more RC releases, until the code looks production ready
-and we don't get reports of serious issues for a while.
-
-A special thank you for the amount of work put into this release by:
-- Oran Agra
-- Yossi Gottlieb
-- Viktor Söderqvist
-- Yang Bodong
-- Filipe Oliveira
-- Guy Benoish
-- Itamar Haber
-- Madelyn Olson
-- Wang Yuan
-- Felipe Machado
-- Wen Hui
-- Tatsuya Arisawa
-- Jonah H. Harris
-- Raghav Muddur
-- Jim Brunner
-- Yaacov Hazan
-- Allen Farris
-- Chen Yang
-- Nitai Caro
-- sundb
-- Meir Shpilraien
-- maohuazhu
-- Valentino Geron
-- Zhao Zhao
-- Qu Chen
-- George Prekas
-- Tyson Andre
-- Uri Yagelnik
-- Michael Grunder
-- Huang Zw
-- alexronke-channeladvisor
-- Andy Pan
-- Wu Yunlong
-- Wei Kukey
-- Yoav Steinberg
-- Greg Femec
-- Uri Shachar
-- Nykolas Laurentino de Lima
-- xhe
-- zhenwei pi
-- David CARLIER
-
-Migrating from 6.0 to 6.2
-=========================
-
-Redis 6.2 is mostly a strict superset of 6.0, you should not have any problem
-upgrading your application from 6.0 to 6.2. However there are some small changes
-of behavior listed above, please make sure you are not badly affected by any of
-them.
-
-Specifically these sections:
-* Command behavior changes
-* Other behavior changes
-
---------------------------------------------------------------------------------
-
-Cheers,
-The Redis team
diff --git a/redis-stable/BUGS b/redis-stable/BUGS
deleted file mode 100644
index 7af25934..00000000
--- a/redis-stable/BUGS
+++ /dev/null
@@ -1 +0,0 @@
-Please check https://github.com/redis/redis/issues
diff --git a/redis-stable/CONDUCT b/redis-stable/CONDUCT
deleted file mode 100644
index e0e15e26..00000000
--- a/redis-stable/CONDUCT
+++ /dev/null
@@ -1,96 +0,0 @@
-Contributor Covenant Code of Conduct
-Our Pledge
-We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, religion, or sexual identity
-and orientation.
-We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.
-Our Standards
-Examples of behavior that contributes to a positive environment for our
-community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes,
-and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the
-overall community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or
-advances of any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others’ private information, such as a physical or email
-address, without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-professional setting
-
-Enforcement Responsibilities
-Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.
-Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.
-Scope
-This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official e-mail address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.
-Enforcement
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-this email address: redis@redis.io.
-All complaints will be reviewed and investigated promptly and fairly.
-All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.
-Enforcement Guidelines
-Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:
-1. Correction
-Community Impact: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.
-Consequence: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.
-2. Warning
-Community Impact: A violation through a single incident or series
-of actions.
-Consequence: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or
-permanent ban.
-3. Temporary Ban
-Community Impact: A serious violation of community standards, including
-sustained inappropriate behavior.
-Consequence: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.
-4. Permanent Ban
-Community Impact: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior,  harassment of an
-individual, or aggression toward or disparagement of classes of individuals.
-Consequence: A permanent ban from any sort of public interaction within
-the community.
-Attribution
-This Code of Conduct is adapted from the Contributor Covenant,
-version 2.0, available at
-https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
-Community Impact Guidelines were inspired by Mozilla’s code of conduct
-enforcement ladder.
-For answers to common questions about this code of conduct, see the FAQ at
-https://www.contributor-covenant.org/faq. Translations are available at
-https://www.contributor-covenant.org/translations.
\ No newline at end of file
diff --git a/redis-stable/CONTRIBUTING b/redis-stable/CONTRIBUTING
deleted file mode 100644
index 50d56786..00000000
--- a/redis-stable/CONTRIBUTING
+++ /dev/null
@@ -1,74 +0,0 @@
-Note: by contributing code to the Redis project in any form, including sending
-a pull request via Github, a code fragment or patch via private email or
-public discussion groups, you agree to release your code under the terms
-of the BSD license that you can find in the COPYING file included in the Redis
-source distribution. You will include BSD license in the COPYING file within
-each source file that you contribute.
-
-# IMPORTANT: HOW TO USE REDIS GITHUB ISSUES
-
-Github issues SHOULD ONLY BE USED to report bugs, and for DETAILED feature
-requests. Everything else belongs to the Redis Google Group:
-      
-    https://groups.google.com/forum/m/#!forum/Redis-db
-
-PLEASE DO NOT POST GENERAL QUESTIONS that are not about bugs or suspected
-bugs in the Github issues system. We'll be very happy to help you and provide
-all the support in the mailing list.
-
-There is also an active community of Redis users at Stack Overflow:
-
-    http://stackoverflow.com/questions/tagged/redis
-
-# Reporting Security Bugs
-
-*If you are reporting a security bug*, please contact the core team privately
-by emailing redis@redis.io. Your report will be acknowledged by a core team
-member and once the report has been reviewed you will receive a more detailed
-response including next steps.
-
-If you do not receive a reply you can escalate to the Redis Google Group,
-linked above. Because this group is a public space please do not disclose the
-issue in detail, only say that you are trying to reach the core team for a
-security issue.
-
-Redis follows a responsible disclosure process:
-
-1. Reports are reviewed and analyzed privately
-2. Patches are prepared for supported versions of Redis
-3. Vendor lists are notified with an embargo date to reduce the public impact
-4. We push a fix release and your bug can be posted publicly with credit in
-   release notes and the version history (and our thanks!)
-
-  Issues and pull requests for documentation belong on the redis-doc repo:
-
-      https://github.com/redis/redis-doc
-
-# How to provide a patch for a new feature
-
-1. If it is a major feature or a semantical change, please don't start coding
-straight away: if your feature is not a conceptual fit you'll lose a lot of
-time writing the code without any reason. Start by posting in the mailing list
-and creating an issue at Github with the description of, exactly, what you want
-to accomplish and why. Use cases are important for features to be accepted.
-Here you'll see if there is consensus about your idea.
-
-2. If in step 1 you get an acknowledgment from the project leaders, use the
-   following procedure to submit a patch:
-
-    a. Fork Redis on github ( http://help.github.com/fork-a-repo/ )
-    b. Create a topic branch (git checkout -b my_branch)
-    c. Push to your branch (git push origin my_branch)
-    d. Initiate a pull request on github ( https://help.github.com/articles/creating-a-pull-request/ )
-    e. Done :)
-
-3. Keep in mind that we are very overloaded, so issues and PRs sometimes wait
-for a *very* long time. However this is not lack of interest, as the project
-gets more and more users, we find ourselves in a constant need to prioritize
-certain issues/PRs over others. If you think your issue/PR is very important
-try to popularize it, have other users commenting and sharing their point of
-view and so forth. This helps.
-
-4. For minor fixes just open a pull request on Github.
-
-Thanks!
diff --git a/redis-stable/COPYING b/redis-stable/COPYING
deleted file mode 100644
index a381681a..00000000
--- a/redis-stable/COPYING
+++ /dev/null
@@ -1,10 +0,0 @@
-Copyright (c) 2006-2020, Salvatore Sanfilippo
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
-
-    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
-    * Neither the name of Redis nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/INSTALL b/redis-stable/INSTALL
deleted file mode 100644
index 3083f1af..00000000
--- a/redis-stable/INSTALL
+++ /dev/null
@@ -1 +0,0 @@
-See README
diff --git a/redis-stable/MANIFESTO b/redis-stable/MANIFESTO
deleted file mode 100644
index 37278946..00000000
--- a/redis-stable/MANIFESTO
+++ /dev/null
@@ -1,106 +0,0 @@
-[Note: this is the Redis manifesto, for general information about
-       installing and running Redis read the README file instead.]
-
-Redis Manifesto
-===============
-
-1 - A DSL for Abstract Data Types. Redis is a DSL (Domain Specific Language)
-    that manipulates abstract data types and implemented as a TCP daemon.
-    Commands manipulate a key space where keys are binary-safe strings and
-    values are different kinds of abstract data types. Every data type
-    represents an abstract version of a fundamental data structure. For instance
-    Redis Lists are an abstract representation of linked lists. In Redis, the
-    essence of a data type isn't just the kind of operations that the data types
-    support, but also the space and time complexity of the data type and the
-    operations performed upon it.
-
-2 - Memory storage is #1. The Redis data set, composed of defined key-value
-    pairs, is primarily stored in the computer's memory. The amount of memory in
-    all kinds of computers, including entry-level servers, is increasing
-    significantly each year. Memory is fast, and allows Redis to have very
-    predictable performance. Datasets composed of 10k or 40 millions keys will
-    perform similarly. Complex data types like Redis Sorted Sets are easy to
-    implement and manipulate in memory with good performance, making Redis very
-    simple. Redis will continue to explore alternative options (where data can
-    be optionally stored on disk, say) but the main goal of the project remains
-    the development of an in-memory database.
-
-3 - Fundamental data structures for a fundamental API. The Redis API is a direct
-    consequence of fundamental data structures. APIs can often be arbitrary but
-    not an API that resembles the nature of fundamental data structures. If we
-    ever meet intelligent life forms from another part of the universe, they'll
-    likely know, understand and recognize the same basic data structures we have
-    in our computer science books. Redis will avoid intermediate layers in API,
-    so that the complexity is obvious and more complex operations can be
-    performed as the sum of the basic operations.
-
-4 - We believe in code efficiency. Computers get faster and faster, yet we
-    believe that abusing computing capabilities is not wise: the amount of
-    operations you can do for a given amount of energy remains anyway a
-    significant parameter: it allows to do more with less computers and, at
-    the same time, having a smaller environmental impact. Similarly Redis is
-    able to "scale down" to smaller devices. It is perfectly usable in a
-    Raspberry Pi and other small ARM based computers. Faster code having
-    just the layers of abstractions that are really needed will also result,
-    often, in more predictable performances. We think likewise about memory
-    usage, one of the fundamental goals of the Redis project is to
-    incrementally build more and more memory efficient data structures, so that
-    problems that were not approachable in RAM in the past will be perfectly
-    fine to handle in the future.
-
-5 - Code is like a poem; it's not just something we write to reach some
-    practical result. Sometimes people that are far from the Redis philosophy
-    suggest using other code written by other authors (frequently in other
-    languages) in order to implement something Redis currently lacks. But to us
-    this is like if Shakespeare decided to end Enrico IV using the Paradiso from
-    the Divina Commedia. Is using any external code a bad idea? Not at all. Like
-    in "One Thousand and One Nights" smaller self contained stories are embedded
-    in a bigger story, we'll be happy to use beautiful self contained libraries
-    when needed. At the same time, when writing the Redis story we're trying to
-    write smaller stories that will fit in to other code.
-
-6 - We're against complexity. We believe designing systems is a fight against
-    complexity. We'll accept to fight the complexity when it's worthwhile but
-    we'll try hard to recognize when a small feature is not worth 1000s of lines
-    of code. Most of the time the best way to fight complexity is by not
-    creating it at all. Complexity is also a form of lock-in: code that is
-    very hard to understand cannot be modified by users in an independent way
-    regardless of the license. One of the main Redis goals is to remain
-    understandable, enough for a single programmer to have a clear idea of how
-    it works in detail just reading the source code for a couple of weeks.
-
-7 - Threading is not a silver bullet. Instead of making Redis threaded we
-    believe on the idea of an efficient (mostly) single threaded Redis core.
-    Multiple of such cores, that may run in the same computer or may run
-    in multiple computers, are abstracted away as a single big system by
-    higher order protocols and features: Redis Cluster and the upcoming
-    Redis Proxy are our main goals. A shared nothing approach is not just
-    much simpler (see the previous point in this document), is also optimal
-    in NUMA systems. In the specific case of Redis it allows for each instance
-    to have a more limited amount of data, making the Redis persist-by-fork
-    approach more sounding. In the future we may explore parallelism only for
-    I/O, which is the low hanging fruit: minimal complexity could provide an
-    improved single process experience.
-
-8 - Two levels of API. The Redis API has two levels: 1) a subset of the API fits
-    naturally into a distributed version of Redis and 2) a more complex API that
-    supports multi-key operations. Both are useful if used judiciously but
-    there's no way to make the more complex multi-keys API distributed in an
-    opaque way without violating our other principles. We don't want to provide
-    the illusion of something that will work magically when actually it can't in
-    all cases. Instead we'll provide commands to quickly migrate keys from one
-    instance to another to perform multi-key operations and expose the
-    trade-offs to the user.
-
-9 - We optimize for joy. We believe writing code is a lot of hard work, and the
-    only way it can be worth is by enjoying it. When there is no longer joy in
-    writing code, the best thing to do is stop. To prevent this, we'll avoid
-    taking paths that will make Redis less of a joy to develop.
-
-10 - All the above points are put together in what we call opportunistic
-     programming: trying to get the most for the user with minimal increases
-     in complexity (hanging fruits). Solve 95% of the problem with 5% of the
-     code when it is acceptable. Avoid a fixed schedule but follow the flow of
-     user requests, inspiration, Redis internal readiness for certain features
-     (sometimes many past changes reach a critical point making a previously
-     complex feature very easy to obtain).
diff --git a/redis-stable/Makefile b/redis-stable/Makefile
deleted file mode 100644
index e614ede8..00000000
--- a/redis-stable/Makefile
+++ /dev/null
@@ -1,11 +0,0 @@
-# Top level makefile, the real shit is at src/Makefile
-
-default: all
-
-.DEFAULT:
-	cd src && $(MAKE) $@
-
-install:
-	cd src && $(MAKE) $@
-
-.PHONY: install
diff --git a/redis-stable/README.md b/redis-stable/README.md
deleted file mode 100644
index 87225b34..00000000
--- a/redis-stable/README.md
+++ /dev/null
@@ -1,487 +0,0 @@
-This README is just a fast *quick start* document. You can find more detailed documentation at [redis.io](https://redis.io).
-
-What is Redis?
---------------
-
-Redis is often referred to as a *data structures* server. What this means is that Redis provides access to mutable data structures via a set of commands, which are sent using a *server-client* model with TCP sockets and a simple protocol. So different processes can query and modify the same data structures in a shared way.
-
-Data structures implemented into Redis have a few special properties:
-
-* Redis cares to store them on disk, even if they are always served and modified into the server memory. This means that Redis is fast, but that it is also non-volatile.
-* The implementation of data structures emphasizes memory efficiency, so data structures inside Redis will likely use less memory compared to the same data structure modelled using a high-level programming language.
-* Redis offers a number of features that are natural to find in a database, like replication, tunable levels of durability, clustering, and high availability.
-
-Another good example is to think of Redis as a more complex version of memcached, where the operations are not just SETs and GETs, but operations that work with complex data types like Lists, Sets, ordered data structures, and so forth.
-
-If you want to know more, this is a list of selected starting points:
-
-* Introduction to Redis data types. https://redis.io/topics/data-types-intro
-* Try Redis directly inside your browser. http://try.redis.io
-* The full list of Redis commands. https://redis.io/commands
-* There is much more inside the official Redis documentation. https://redis.io/documentation
-
-Building Redis
---------------
-
-Redis can be compiled and used on Linux, OSX, OpenBSD, NetBSD, FreeBSD.
-We support big endian and little endian architectures, and both 32 bit
-and 64 bit systems.
-
-It may compile on Solaris derived systems (for instance SmartOS) but our
-support for this platform is *best effort* and Redis is not guaranteed to
-work as well as in Linux, OSX, and \*BSD.
-
-It is as simple as:
-
-    % make
-
-To build with TLS support, you'll need OpenSSL development libraries (e.g.
-libssl-dev on Debian/Ubuntu) and run:
-
-    % make BUILD_TLS=yes
-
-To build with systemd support, you'll need systemd development libraries (such 
-as libsystemd-dev on Debian/Ubuntu or systemd-devel on CentOS) and run:
-
-    % make USE_SYSTEMD=yes
-
-To append a suffix to Redis program names, use:
-
-    % make PROG_SUFFIX="-alt"
-
-You can build a 32 bit Redis binary using:
-
-    % make 32bit
-
-After building Redis, it is a good idea to test it using:
-
-    % make test
-
-If TLS is built, running the tests with TLS enabled (you will need `tcl-tls`
-installed):
-
-    % ./utils/gen-test-certs.sh
-    % ./runtest --tls
-
-
-Fixing build problems with dependencies or cached build options
----------
-
-Redis has some dependencies which are included in the `deps` directory.
-`make` does not automatically rebuild dependencies even if something in
-the source code of dependencies changes.
-
-When you update the source code with `git pull` or when code inside the
-dependencies tree is modified in any other way, make sure to use the following
-command in order to really clean everything and rebuild from scratch:
-
-    make distclean
-
-This will clean: jemalloc, lua, hiredis, linenoise.
-
-Also if you force certain build options like 32bit target, no C compiler
-optimizations (for debugging purposes), and other similar build time options,
-those options are cached indefinitely until you issue a `make distclean`
-command.
-
-Fixing problems building 32 bit binaries
----------
-
-If after building Redis with a 32 bit target you need to rebuild it
-with a 64 bit target, or the other way around, you need to perform a
-`make distclean` in the root directory of the Redis distribution.
-
-In case of build errors when trying to build a 32 bit binary of Redis, try
-the following steps:
-
-* Install the package libc6-dev-i386 (also try g++-multilib).
-* Try using the following command line instead of `make 32bit`:
-  `make CFLAGS="-m32 -march=native" LDFLAGS="-m32"`
-
-Allocator
----------
-
-Selecting a non-default memory allocator when building Redis is done by setting
-the `MALLOC` environment variable. Redis is compiled and linked against libc
-malloc by default, with the exception of jemalloc being the default on Linux
-systems. This default was picked because jemalloc has proven to have fewer
-fragmentation problems than libc malloc.
-
-To force compiling against libc malloc, use:
-
-    % make MALLOC=libc
-
-To compile against jemalloc on Mac OS X systems, use:
-
-    % make MALLOC=jemalloc
-
-Monotonic clock
----------------
-
-By default, Redis will build using the POSIX clock_gettime function as the
-monotonic clock source.  On most modern systems, the internal processor clock
-can be used to improve performance.  Cautions can be found here: 
-    http://oliveryang.net/2015/09/pitfalls-of-TSC-usage/
-
-To build with support for the processor's internal instruction clock, use:
-
-    % make CFLAGS="-DUSE_PROCESSOR_CLOCK"
-
-Verbose build
--------------
-
-Redis will build with a user-friendly colorized output by default.
-If you want to see a more verbose output, use the following:
-
-    % make V=1
-
-Running Redis
--------------
-
-To run Redis with the default configuration, just type:
-
-    % cd src
-    % ./redis-server
-
-If you want to provide your redis.conf, you have to run it using an additional
-parameter (the path of the configuration file):
-
-    % cd src
-    % ./redis-server /path/to/redis.conf
-
-It is possible to alter the Redis configuration by passing parameters directly
-as options using the command line. Examples:
-
-    % ./redis-server --port 9999 --replicaof 127.0.0.1 6379
-    % ./redis-server /etc/redis/6379.conf --loglevel debug
-
-All the options in redis.conf are also supported as options using the command
-line, with exactly the same name.
-
-Running Redis with TLS:
-------------------
-
-Please consult the [TLS.md](TLS.md) file for more information on
-how to use Redis with TLS.
-
-Playing with Redis
-------------------
-
-You can use redis-cli to play with Redis. Start a redis-server instance,
-then in another terminal try the following:
-
-    % cd src
-    % ./redis-cli
-    redis> ping
-    PONG
-    redis> set foo bar
-    OK
-    redis> get foo
-    "bar"
-    redis> incr mycounter
-    (integer) 1
-    redis> incr mycounter
-    (integer) 2
-    redis>
-
-You can find the list of all the available commands at https://redis.io/commands.
-
-Installing Redis
------------------
-
-In order to install Redis binaries into /usr/local/bin, just use:
-
-    % make install
-
-You can use `make PREFIX=/some/other/directory install` if you wish to use a
-different destination.
-
-Make install will just install binaries in your system, but will not configure
-init scripts and configuration files in the appropriate place. This is not
-needed if you just want to play a bit with Redis, but if you are installing
-it the proper way for a production system, we have a script that does this
-for Ubuntu and Debian systems:
-
-    % cd utils
-    % ./install_server.sh
-
-_Note_: `install_server.sh` will not work on Mac OSX; it is built for Linux only.
-
-The script will ask you a few questions and will setup everything you need
-to run Redis properly as a background daemon that will start again on
-system reboots.
-
-You'll be able to stop and start Redis using the script named
-`/etc/init.d/redis_<portnumber>`, for instance `/etc/init.d/redis_6379`.
-
-Code contributions
------------------
-
-Note: By contributing code to the Redis project in any form, including sending
-a pull request via Github, a code fragment or patch via private email or
-public discussion groups, you agree to release your code under the terms
-of the BSD license that you can find in the [COPYING][1] file included in the Redis
-source distribution.
-
-Please see the [CONTRIBUTING][2] file in this source distribution for more
-information, including details on our process for security bugs/vulnerabilities.
-
-[1]: https://github.com/redis/redis/blob/unstable/COPYING
-[2]: https://github.com/redis/redis/blob/unstable/CONTRIBUTING
-
-Redis internals
-===
-
-If you are reading this README you are likely in front of a Github page
-or you just untarred the Redis distribution tar ball. In both the cases
-you are basically one step away from the source code, so here we explain
-the Redis source code layout, what is in each file as a general idea, the
-most important functions and structures inside the Redis server and so forth.
-We keep all the discussion at a high level without digging into the details
-since this document would be huge otherwise and our code base changes
-continuously, but a general idea should be a good starting point to
-understand more. Moreover most of the code is heavily commented and easy
-to follow.
-
-Source code layout
----
-
-The Redis root directory just contains this README, the Makefile which
-calls the real Makefile inside the `src` directory and an example
-configuration for Redis and Sentinel. You can find a few shell
-scripts that are used in order to execute the Redis, Redis Cluster and
-Redis Sentinel unit tests, which are implemented inside the `tests`
-directory.
-
-Inside the root are the following important directories:
-
-* `src`: contains the Redis implementation, written in C.
-* `tests`: contains the unit tests, implemented in Tcl.
-* `deps`: contains libraries Redis uses. Everything needed to compile Redis is inside this directory; your system just needs to provide `libc`, a POSIX compatible interface and a C compiler. Notably `deps` contains a copy of `jemalloc`, which is the default allocator of Redis under Linux. Note that under `deps` there are also things which started with the Redis project, but for which the main repository is not `redis/redis`.
-
-There are a few more directories but they are not very important for our goals
-here. We'll focus mostly on `src`, where the Redis implementation is contained,
-exploring what there is inside each file. The order in which files are
-exposed is the logical one to follow in order to disclose different layers
-of complexity incrementally.
-
-Note: lately Redis was refactored quite a bit. Function names and file
-names have been changed, so you may find that this documentation reflects the
-`unstable` branch more closely. For instance, in Redis 3.0 the `server.c`
-and `server.h` files were named `redis.c` and `redis.h`. However the overall
-structure is the same. Keep in mind that all the new developments and pull
-requests should be performed against the `unstable` branch.
-
-server.h
----
-
-The simplest way to understand how a program works is to understand the
-data structures it uses. So we'll start from the main header file of
-Redis, which is `server.h`.
-
-All the server configuration and in general all the shared state is
-defined in a global structure called `server`, of type `struct redisServer`.
-A few important fields in this structure are:
-
-* `server.db` is an array of Redis databases, where data is stored.
-* `server.commands` is the command table.
-* `server.clients` is a linked list of clients connected to the server.
-* `server.master` is a special client, the master, if the instance is a replica.
-
-There are tons of other fields. Most fields are commented directly inside
-the structure definition.
-
-Another important Redis data structure is the one defining a client.
-In the past it was called `redisClient`, now just `client`. The structure
-has many fields, here we'll just show the main ones:
-```c
-struct client {
-    int fd;
-    sds querybuf;
-    int argc;
-    robj **argv;
-    redisDb *db;
-    int flags;
-    list *reply;
-    char buf[PROTO_REPLY_CHUNK_BYTES];
-    // ... many other fields ...
-}
-```
-The client structure defines a *connected client*:
-
-* The `fd` field is the client socket file descriptor.
-* `argc` and `argv` are populated with the command the client is executing, so that functions implementing a given Redis command can read the arguments.
-* `querybuf` accumulates the requests from the client, which are parsed by the Redis server according to the Redis protocol and executed by calling the implementations of the commands the client is executing.
-* `reply` and `buf` are dynamic and static buffers that accumulate the replies the server sends to the client. These buffers are incrementally written to the socket as soon as the file descriptor is writeable.
-
-As you can see in the client structure above, arguments in a command
-are described as `robj` structures. The following is the full `robj`
-structure, which defines a *Redis object*:
-
-    typedef struct redisObject {
-        unsigned type:4;
-        unsigned encoding:4;
-        unsigned lru:LRU_BITS; /* lru time (relative to server.lruclock) */
-        int refcount;
-        void *ptr;
-    } robj;
-
-Basically this structure can represent all the basic Redis data types like
-strings, lists, sets, sorted sets and so forth. The interesting thing is that
-it has a `type` field, so that it is possible to know what type a given
-object has, and a `refcount`, so that the same object can be referenced
-in multiple places without allocating it multiple times. Finally the `ptr`
-field points to the actual representation of the object, which might vary
-even for the same type, depending on the `encoding` used.
-
-Redis objects are used extensively in the Redis internals, however in order
-to avoid the overhead of indirect accesses, recently in many places
-we just use plain dynamic strings not wrapped inside a Redis object.
-
-server.c
----
-
-This is the entry point of the Redis server, where the `main()` function
-is defined. The following are the most important steps in order to startup
-the Redis server.
-
-* `initServerConfig()` sets up the default values of the `server` structure.
-* `initServer()` allocates the data structures needed to operate, setup the listening socket, and so forth.
-* `aeMain()` starts the event loop which listens for new connections.
-
-There are two special functions called periodically by the event loop:
-
-1. `serverCron()` is called periodically (according to `server.hz` frequency), and performs tasks that must be performed from time to time, like checking for timed out clients.
-2. `beforeSleep()` is called every time the event loop fired, Redis served a few requests, and is returning back into the event loop.
-
-Inside server.c you can find code that handles other vital things of the Redis server:
-
-* `call()` is used in order to call a given command in the context of a given client.
-* `activeExpireCycle()` handles eviction of keys with a time to live set via the `EXPIRE` command.
-* `performEvictions()` is called when a new write command should be performed but Redis is out of memory according to the `maxmemory` directive.
-* The global variable `redisCommandTable` defines all the Redis commands, specifying the name of the command, the function implementing the command, the number of arguments required, and other properties of each command.
-
-networking.c
----
-
-This file defines all the I/O functions with clients, masters and replicas
-(which in Redis are just special clients):
-
-* `createClient()` allocates and initializes a new client.
-* the `addReply*()` family of functions are used by command implementations in order to append data to the client structure, that will be transmitted to the client as a reply for a given command executed.
-* `writeToClient()` transmits the data pending in the output buffers to the client and is called by the *writable event handler* `sendReplyToClient()`.
-* `readQueryFromClient()` is the *readable event handler* and accumulates data read from the client into the query buffer.
-* `processInputBuffer()` is the entry point in order to parse the client query buffer according to the Redis protocol. Once commands are ready to be processed, it calls `processCommand()` which is defined inside `server.c` in order to actually execute the command.
-* `freeClient()` deallocates, disconnects and removes a client.
-
-aof.c and rdb.c
----
-
-As you can guess from the names, these files implement the RDB and AOF
-persistence for Redis. Redis uses a persistence model based on the `fork()`
-system call in order to create a thread with the same (shared) memory
-content of the main Redis thread. This secondary thread dumps the content
-of the memory on disk. This is used by `rdb.c` to create the snapshots
-on disk and by `aof.c` in order to perform the AOF rewrite when the
-append only file gets too big.
-
-The implementation inside `aof.c` has additional functions in order to
-implement an API that allows commands to append new commands into the AOF
-file as clients execute them.
-
-The `call()` function defined inside `server.c` is responsible for calling
-the functions that in turn will write the commands into the AOF.
-
-db.c
----
-
-Certain Redis commands operate on specific data types; others are general.
-Examples of generic commands are `DEL` and `EXPIRE`. They operate on keys
-and not on their values specifically. All those generic commands are
-defined inside `db.c`.
-
-Moreover `db.c` implements an API in order to perform certain operations
-on the Redis dataset without directly accessing the internal data structures.
-
-The most important functions inside `db.c` which are used in many command
-implementations are the following:
-
-* `lookupKeyRead()` and `lookupKeyWrite()` are used in order to get a pointer to the value associated to a given key, or `NULL` if the key does not exist.
-* `dbAdd()` and its higher level counterpart `setKey()` create a new key in a Redis database.
-* `dbDelete()` removes a key and its associated value.
-* `emptyDb()` removes an entire single database or all the databases defined.
-
-The rest of the file implements the generic commands exposed to the client.
-
-object.c
----
-
-The `robj` structure defining Redis objects was already described. Inside
-`object.c` there are all the functions that operate with Redis objects at
-a basic level, like functions to allocate new objects, handle the reference
-counting and so forth. Notable functions inside this file:
-
-* `incrRefCount()` and `decrRefCount()` are used in order to increment or decrement an object reference count. When it drops to 0 the object is finally freed.
-* `createObject()` allocates a new object. There are also specialized functions to allocate string objects having a specific content, like `createStringObjectFromLongLong()` and similar functions.
-
-This file also implements the `OBJECT` command.
-
-replication.c
----
-
-This is one of the most complex files inside Redis, it is recommended to
-approach it only after getting a bit familiar with the rest of the code base.
-In this file there is the implementation of both the master and replica role
-of Redis.
-
-One of the most important functions inside this file is `replicationFeedSlaves()` that writes commands to the clients representing replica instances connected
-to our master, so that the replicas can get the writes performed by the clients:
-this way their data set will remain synchronized with the one in the master.
-
-This file also implements both the `SYNC` and `PSYNC` commands that are
-used in order to perform the first synchronization between masters and
-replicas, or to continue the replication after a disconnection.
-
-Other C files
----
-
-* `t_hash.c`, `t_list.c`, `t_set.c`, `t_string.c`, `t_zset.c` and `t_stream.c` contains the implementation of the Redis data types. They implement both an API to access a given data type, and the client command implementations for these data types.
-* `ae.c` implements the Redis event loop, it's a self contained library which is simple to read and understand.
-* `sds.c` is the Redis string library, check http://github.com/antirez/sds for more information.
-* `anet.c` is a library to use POSIX networking in a simpler way compared to the raw interface exposed by the kernel.
-* `dict.c` is an implementation of a non-blocking hash table which rehashes incrementally.
-* `scripting.c` implements Lua scripting. It is completely self-contained and isolated from the rest of the Redis implementation and is simple enough to understand if you are familiar with the Lua API.
-* `cluster.c` implements the Redis Cluster. Probably a good read only after being very familiar with the rest of the Redis code base. If you want to read `cluster.c` make sure to read the [Redis Cluster specification][3].
-
-[3]: https://redis.io/topics/cluster-spec
-
-Anatomy of a Redis command
----
-
-All the Redis commands are defined in the following way:
-
-    void foobarCommand(client *c) {
-        printf("%s",c->argv[1]->ptr); /* Do something with the argument. */
-        addReply(c,shared.ok); /* Reply something to the client. */
-    }
-
-The command is then referenced inside `server.c` in the command table:
-
-    {"foobar",foobarCommand,2,"rtF",0,NULL,0,0,0,0,0},
-
-In the above example `2` is the number of arguments the command takes,
-while `"rtF"` are the command flags, as documented in the command table
-top comment inside `server.c`.
-
-After the command operates in some way, it returns a reply to the client,
-usually using `addReply()` or a similar function defined inside `networking.c`.
-
-There are tons of command implementations inside the Redis source code
-that can serve as examples of actual commands implementations. Writing
-a few toy commands can be a good exercise to get familiar with the code base.
-
-There are also many other files not described here, but it is useless to
-cover everything. We just want to help you with the first steps.
-Eventually you'll find your way inside the Redis code base :-)
-
-Enjoy!
diff --git a/redis-stable/TLS.md b/redis-stable/TLS.md
deleted file mode 100644
index 2d020d0c..00000000
--- a/redis-stable/TLS.md
+++ /dev/null
@@ -1,87 +0,0 @@
-TLS Support
-===========
-
-Getting Started
----------------
-
-### Building
-
-To build with TLS support you'll need OpenSSL development libraries (e.g.
-libssl-dev on Debian/Ubuntu).
-
-Run `make BUILD_TLS=yes`.
-
-### Tests
-
-To run Redis test suite with TLS, you'll need TLS support for TCL (i.e.
-`tcl-tls` package on Debian/Ubuntu).
-
-1. Run `./utils/gen-test-certs.sh` to generate a root CA and a server
-   certificate.
-
-2. Run `./runtest --tls` or `./runtest-cluster --tls` to run Redis and Redis
-   Cluster tests in TLS mode.
-
-### Running manually
-
-To manually run a Redis server with TLS mode (assuming `gen-test-certs.sh` was
-invoked so sample certificates/keys are available):
-
-    ./src/redis-server --tls-port 6379 --port 0 \
-        --tls-cert-file ./tests/tls/redis.crt \
-        --tls-key-file ./tests/tls/redis.key \
-        --tls-ca-cert-file ./tests/tls/ca.crt
-
-To connect to this Redis server with `redis-cli`:
-
-    ./src/redis-cli --tls \
-        --cert ./tests/tls/redis.crt \
-        --key ./tests/tls/redis.key \
-        --cacert ./tests/tls/ca.crt
-
-This will disable TCP and enable TLS on port 6379. It's also possible to have
-both TCP and TLS available, but you'll need to assign different ports.
-
-To make a Replica connect to the master using TLS, use `--tls-replication yes`,
-and to make Redis Cluster use TLS across nodes use `--tls-cluster yes`.
-
-Connections
------------
-
-All socket operations now go through a connection abstraction layer that hides
-I/O and read/write event handling from the caller.
-
-**Multi-threading I/O is not currently supported for TLS**, as a TLS connection
-needs to do its own manipulation of AE events which is not thread safe. The
-solution is probably to manage independent AE loops for I/O threads and longer
-term association of connections with threads. This may potentially improve
-overall performance as well.
-
-Sync IO for TLS is currently implemented in a hackish way, i.e. making the
-socket blocking and configuring socket-level timeout.  This means the timeout
-value may not be so accurate, and there would be a lot of syscall overhead.
-However I believe that getting rid of syncio completely in favor of pure async
-work is probably a better move than trying to fix that. For replication it would
-probably not be so hard. For cluster keys migration it might be more difficult,
-but there are probably other good reasons to improve that part anyway.
-
-To-Do List
-----------
-
-- [ ] redis-benchmark support. The current implementation is a mix of using
-  hiredis for parsing and basic networking (establishing connections), but
-  directly manipulating sockets for most actions. This will need to be cleaned
-  up for proper TLS support. The best approach is probably to migrate to hiredis
-  async mode.
-- [ ] redis-cli `--slave` and `--rdb` support.
-
-Multi-port
-----------
-
-Consider the implications of allowing TLS to be configured on a separate port,
-making Redis listening on multiple ports:
-
-1. Startup banner port notification
-2. Proctitle
-3. How slaves announce themselves
-4. Cluster bus port calculation
diff --git a/redis-stable/deps/Makefile b/redis-stable/deps/Makefile
deleted file mode 100644
index ff16ee9e..00000000
--- a/redis-stable/deps/Makefile
+++ /dev/null
@@ -1,94 +0,0 @@
-# Redis dependency Makefile
-
-uname_S:= $(shell sh -c 'uname -s 2>/dev/null || echo not')
-
-CCCOLOR="\033[34m"
-LINKCOLOR="\033[34;1m"
-SRCCOLOR="\033[33m"
-BINCOLOR="\033[37;1m"
-MAKECOLOR="\033[32;1m"
-ENDCOLOR="\033[0m"
-
-default:
-	@echo "Explicit target required"
-
-.PHONY: default
-
-# Prerequisites target
-.make-prerequisites:
-	@touch $@
-
-# Clean everything when CFLAGS is different
-ifneq ($(shell sh -c '[ -f .make-cflags ] && cat .make-cflags || echo none'), $(CFLAGS))
-.make-cflags: distclean
-	-(echo "$(CFLAGS)" > .make-cflags)
-.make-prerequisites: .make-cflags
-endif
-
-# Clean everything when LDFLAGS is different
-ifneq ($(shell sh -c '[ -f .make-ldflags ] && cat .make-ldflags || echo none'), $(LDFLAGS))
-.make-ldflags: distclean
-	-(echo "$(LDFLAGS)" > .make-ldflags)
-.make-prerequisites: .make-ldflags
-endif
-
-distclean:
-	-(cd hiredis && $(MAKE) clean) > /dev/null || true
-	-(cd linenoise && $(MAKE) clean) > /dev/null || true
-	-(cd lua && $(MAKE) clean) > /dev/null || true
-	-(cd jemalloc && [ -f Makefile ] && $(MAKE) distclean) > /dev/null || true
-	-(cd hdr_histogram && $(MAKE) clean) > /dev/null || true
-	-(rm -f .make-*)
-
-.PHONY: distclean
-
-ifeq ($(BUILD_TLS),yes)
-    HIREDIS_MAKE_FLAGS = USE_SSL=1
-endif
-
-hiredis: .make-prerequisites
-	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
-	cd hiredis && $(MAKE) static $(HIREDIS_MAKE_FLAGS)
-
-.PHONY: hiredis
-
-linenoise: .make-prerequisites
-	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
-	cd linenoise && $(MAKE)
-
-.PHONY: linenoise
-
-hdr_histogram: .make-prerequisites
-	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
-	cd hdr_histogram && $(MAKE)
-
-.PHONY: hdr_histogram
-
-ifeq ($(uname_S),SunOS)
-	# Make isinf() available
-	LUA_CFLAGS= -D__C99FEATURES__=1
-endif
-
-LUA_CFLAGS+= -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC='' -DLUA_USE_MKSTEMP $(CFLAGS)
-LUA_LDFLAGS+= $(LDFLAGS)
-# lua's Makefile defines AR="ar rcu", which is unusual, and makes it more
-# challenging to cross-compile lua (and redis).  These defines make it easier
-# to fit redis into cross-compilation environments, which typically set AR.
-AR=ar
-ARFLAGS=rc
-
-lua: .make-prerequisites
-	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
-	cd lua/src && $(MAKE) all CFLAGS="$(LUA_CFLAGS)" MYLDFLAGS="$(LUA_LDFLAGS)" AR="$(AR) $(ARFLAGS)"
-
-.PHONY: lua
-
-JEMALLOC_CFLAGS= -std=gnu99 -Wall -pipe -g3 -O3 -funroll-loops $(CFLAGS)
-JEMALLOC_LDFLAGS= $(LDFLAGS)
-
-jemalloc: .make-prerequisites
-	@printf '%b %b\n' $(MAKECOLOR)MAKE$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR)
-	cd jemalloc && ./configure --with-version=5.1.0-0-g0 --with-lg-quantum=3 --with-jemalloc-prefix=je_ CFLAGS="$(JEMALLOC_CFLAGS)" LDFLAGS="$(JEMALLOC_LDFLAGS)"
-	cd jemalloc && $(MAKE) CFLAGS="$(JEMALLOC_CFLAGS)" LDFLAGS="$(JEMALLOC_LDFLAGS)" lib/libjemalloc.a
-
-.PHONY: jemalloc
diff --git a/redis-stable/deps/README.md b/redis-stable/deps/README.md
deleted file mode 100644
index c3ec424b..00000000
--- a/redis-stable/deps/README.md
+++ /dev/null
@@ -1,82 +0,0 @@
-This directory contains all Redis dependencies, except for the libc that
-should be provided by the operating system.
-
-* **Jemalloc** is our memory allocator, used as replacement for libc malloc on Linux by default. It has good performances and excellent fragmentation behavior. This component is upgraded from time to time.
-* **hiredis** is the official C client library for Redis. It is used by redis-cli, redis-benchmark and Redis Sentinel. It is part of the Redis official ecosystem but is developed externally from the Redis repository, so we just upgrade it as needed.
-* **linenoise** is a readline replacement. It is developed by the same authors of Redis but is managed as a separated project and updated as needed.
-* **lua** is Lua 5.1 with minor changes for security and additional libraries.
-
-How to upgrade the above dependencies
-===
-
-Jemalloc
----
-
-Jemalloc is modified with changes that allow us to implement the Redis
-active defragmentation logic. However this feature of Redis is not mandatory
-and Redis is able to understand if the Jemalloc version it is compiled
-against supports such Redis-specific modifications. So in theory, if you
-are not interested in the active defragmentation, you can replace Jemalloc
-just following these steps:
-
-1. Remove the jemalloc directory.
-2. Substitute it with the new jemalloc source tree.
-3. Edit the Makefile located in the same directory as the README you are
-   reading, and change the --with-version in the Jemalloc configure script
-   options with the version you are using. This is required because otherwise
-   Jemalloc configuration script is broken and will not work nested in another
-   git repository.
-
-However note that we change Jemalloc settings via the `configure` script of Jemalloc using the `--with-lg-quantum` option, setting it to the value of 3 instead of 4. This provides us with more size classes that better suit the Redis data structures, in order to gain memory efficiency.
-
-If you want to upgrade Jemalloc while also providing support for
-active defragmentation, in addition to the above steps you need to perform
-the following additional steps:
-
-5. In Jemalloc tree, file `include/jemalloc/jemalloc_macros.h.in`, make sure
-   to add `#define JEMALLOC_FRAG_HINT`.
-6. Implement the function `je_get_defrag_hint()` inside `src/jemalloc.c`. You
-   can see how it is implemented in the current Jemalloc source tree shipped
-   with Redis, and rewrite it according to the new Jemalloc internals, if they
-   changed, otherwise you could just copy the old implementation if you are
-   upgrading just to a similar version of Jemalloc.
-
-Hiredis
----
-
-Hiredis uses the SDS string library, that must be the same version used inside Redis itself. Hiredis is also very critical for Sentinel. Historically Redis often used forked versions of hiredis in a way or the other. In order to upgrade it is advised to take a lot of care:
-
-1. Check with diff if hiredis API changed and what impact it could have in Redis.
-2. Make sure that the SDS library inside Hiredis and inside Redis are compatible.
-3. After the upgrade, run the Redis Sentinel test.
-4. Check manually that redis-cli and redis-benchmark behave as expected, since we have no tests for CLI utilities currently.
-
-Linenoise
----
-
-Linenoise is rarely upgraded as needed. The upgrade process is trivial since
-Redis uses a non modified version of linenoise, so to upgrade just do the
-following:
-
-1. Remove the linenoise directory.
-2. Substitute it with the new linenoise source tree.
-
-Lua
----
-
-We use Lua 5.1 and no upgrade is planned currently, since we don't want to break
-Lua scripts for new Lua features: in the context of Redis Lua scripts the
-capabilities of 5.1 are usually more than enough, the release is rock solid,
-and we definitely don't want to break old scripts.
-
-So upgrading of Lua is up to the Redis project maintainers and should be a
-manual procedure performed by taking a diff between the different versions.
-
-Currently we have at least the following differences between official Lua 5.1
-and our version:
-
-1. Makefile is modified to allow a different compiler than GCC.
-2. We have the implementation source code, and directly link to the following external libraries: `lua_cjson.o`, `lua_struct.o`, `lua_cmsgpack.o` and `lua_bit.o`.
-3. There is a security fix in `ldo.c`, line 498: The check for `LUA_SIGNATURE[0]` is removed in order to avoid direct bytecode execution.
-
-
diff --git a/redis-stable/deps/hdr_histogram/COPYING.txt b/redis-stable/deps/hdr_histogram/COPYING.txt
deleted file mode 100644
index 0e259d42..00000000
--- a/redis-stable/deps/hdr_histogram/COPYING.txt
+++ /dev/null
@@ -1,121 +0,0 @@
-Creative Commons Legal Code
-
-CC0 1.0 Universal
-
-    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
-    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
-    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
-    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
-    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
-    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
-    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
-    HEREUNDER.
-
-Statement of Purpose
-
-The laws of most jurisdictions throughout the world automatically confer
-exclusive Copyright and Related Rights (defined below) upon the creator
-and subsequent owner(s) (each and all, an "owner") of an original work of
-authorship and/or a database (each, a "Work").
-
-Certain owners wish to permanently relinquish those rights to a Work for
-the purpose of contributing to a commons of creative, cultural and
-scientific works ("Commons") that the public can reliably and without fear
-of later claims of infringement build upon, modify, incorporate in other
-works, reuse and redistribute as freely as possible in any form whatsoever
-and for any purposes, including without limitation commercial purposes.
-These owners may contribute to the Commons to promote the ideal of a free
-culture and the further production of creative, cultural and scientific
-works, or to gain reputation or greater distribution for their Work in
-part through the use and efforts of others.
-
-For these and/or other purposes and motivations, and without any
-expectation of additional consideration or compensation, the person
-associating CC0 with a Work (the "Affirmer"), to the extent that he or she
-is an owner of Copyright and Related Rights in the Work, voluntarily
-elects to apply CC0 to the Work and publicly distribute the Work under its
-terms, with knowledge of his or her Copyright and Related Rights in the
-Work and the meaning and intended legal effect of CC0 on those rights.
-
-1. Copyright and Related Rights. A Work made available under CC0 may be
-protected by copyright and related or neighboring rights ("Copyright and
-Related Rights"). Copyright and Related Rights include, but are not
-limited to, the following:
-
-  i. the right to reproduce, adapt, distribute, perform, display,
-     communicate, and translate a Work;
- ii. moral rights retained by the original author(s) and/or performer(s);
-iii. publicity and privacy rights pertaining to a person's image or
-     likeness depicted in a Work;
- iv. rights protecting against unfair competition in regards to a Work,
-     subject to the limitations in paragraph 4(a), below;
-  v. rights protecting the extraction, dissemination, use and reuse of data
-     in a Work;
- vi. database rights (such as those arising under Directive 96/9/EC of the
-     European Parliament and of the Council of 11 March 1996 on the legal
-     protection of databases, and under any national implementation
-     thereof, including any amended or successor version of such
-     directive); and
-vii. other similar, equivalent or corresponding rights throughout the
-     world based on applicable law or treaty, and any national
-     implementations thereof.
-
-2. Waiver. To the greatest extent permitted by, but not in contravention
-of, applicable law, Affirmer hereby overtly, fully, permanently,
-irrevocably and unconditionally waives, abandons, and surrenders all of
-Affirmer's Copyright and Related Rights and associated claims and causes
-of action, whether now known or unknown (including existing as well as
-future claims and causes of action), in the Work (i) in all territories
-worldwide, (ii) for the maximum duration provided by applicable law or
-treaty (including future time extensions), (iii) in any current or future
-medium and for any number of copies, and (iv) for any purpose whatsoever,
-including without limitation commercial, advertising or promotional
-purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
-member of the public at large and to the detriment of Affirmer's heirs and
-successors, fully intending that such Waiver shall not be subject to
-revocation, rescission, cancellation, termination, or any other legal or
-equitable action to disrupt the quiet enjoyment of the Work by the public
-as contemplated by Affirmer's express Statement of Purpose.
-
-3. Public License Fallback. Should any part of the Waiver for any reason
-be judged legally invalid or ineffective under applicable law, then the
-Waiver shall be preserved to the maximum extent permitted taking into
-account Affirmer's express Statement of Purpose. In addition, to the
-extent the Waiver is so judged Affirmer hereby grants to each affected
-person a royalty-free, non transferable, non sublicensable, non exclusive,
-irrevocable and unconditional license to exercise Affirmer's Copyright and
-Related Rights in the Work (i) in all territories worldwide, (ii) for the
-maximum duration provided by applicable law or treaty (including future
-time extensions), (iii) in any current or future medium and for any number
-of copies, and (iv) for any purpose whatsoever, including without
-limitation commercial, advertising or promotional purposes (the
-"License"). The License shall be deemed effective as of the date CC0 was
-applied by Affirmer to the Work. Should any part of the License for any
-reason be judged legally invalid or ineffective under applicable law, such
-partial invalidity or ineffectiveness shall not invalidate the remainder
-of the License, and in such case Affirmer hereby affirms that he or she
-will not (i) exercise any of his or her remaining Copyright and Related
-Rights in the Work or (ii) assert any associated claims and causes of
-action with respect to the Work, in either case contrary to Affirmer's
-express Statement of Purpose.
-
-4. Limitations and Disclaimers.
-
- a. No trademark or patent rights held by Affirmer are waived, abandoned,
-    surrendered, licensed or otherwise affected by this document.
- b. Affirmer offers the Work as-is and makes no representations or
-    warranties of any kind concerning the Work, express, implied,
-    statutory or otherwise, including without limitation warranties of
-    title, merchantability, fitness for a particular purpose, non
-    infringement, or the absence of latent or other defects, accuracy, or
-    the present or absence of errors, whether or not discoverable, all to
-    the greatest extent permissible under applicable law.
- c. Affirmer disclaims responsibility for clearing rights of other persons
-    that may apply to the Work or any use thereof, including without
-    limitation any person's Copyright and Related Rights in the Work.
-    Further, Affirmer disclaims responsibility for obtaining any necessary
-    consents, permissions or other rights required for any use of the
-    Work.
- d. Affirmer understands and acknowledges that Creative Commons is not a
-    party to this document and has no duty or obligation with respect to
-    this CC0 or use of the Work.
diff --git a/redis-stable/deps/hdr_histogram/LICENSE.txt b/redis-stable/deps/hdr_histogram/LICENSE.txt
deleted file mode 100644
index 9b4e66ed..00000000
--- a/redis-stable/deps/hdr_histogram/LICENSE.txt
+++ /dev/null
@@ -1,41 +0,0 @@
-The code in this repository code was Written by Gil Tene, Michael Barker,
-and Matt Warren, and released to the public domain, as explained at
-http://creativecommons.org/publicdomain/zero/1.0/
-
-For users of this code who wish to consume it under the "BSD" license
-rather than under the public domain or CC0 contribution text mentioned
-above, the code found under this directory is *also* provided under the
-following license (commonly referred to as the BSD 2-Clause License). This
-license does not detract from the above stated release of the code into
-the public domain, and simply represents an additional license granted by
-the Author.
-
------------------------------------------------------------------------------
-** Beginning of "BSD 2-Clause License" text. **
-
- Copyright (c) 2012, 2013, 2014 Gil Tene
- Copyright (c) 2014 Michael Barker
- Copyright (c) 2014 Matt Warren
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions are met:
-
- 1. Redistributions of source code must retain the above copyright notice,
-    this list of conditions and the following disclaimer.
-
- 2. Redistributions in binary form must reproduce the above copyright notice,
-    this list of conditions and the following disclaimer in the documentation
-    and/or other materials provided with the distribution.
-
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/deps/hdr_histogram/Makefile b/redis-stable/deps/hdr_histogram/Makefile
deleted file mode 100644
index 83d3760a..00000000
--- a/redis-stable/deps/hdr_histogram/Makefile
+++ /dev/null
@@ -1,20 +0,0 @@
-STD=
-WARN= -Wall
-OPT= -Os
-
-R_CFLAGS= $(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS)
-R_LDFLAGS= $(LDFLAGS)
-DEBUG= -g
-
-R_CC=$(CC) $(R_CFLAGS)
-R_LD=$(CC) $(R_LDFLAGS)
-
-hdr_histogram.o: hdr_histogram.h hdr_histogram.c 
-
-.c.o:
-	$(R_CC) -c  $< 
-
-clean:
-	rm -f *.o
-
-
diff --git a/redis-stable/deps/hdr_histogram/README.md b/redis-stable/deps/hdr_histogram/README.md
deleted file mode 100644
index 5f62c234..00000000
--- a/redis-stable/deps/hdr_histogram/README.md
+++ /dev/null
@@ -1,10 +0,0 @@
-HdrHistogram_c v0.11.0
-
-----------------------------------------------
-
-This port contains a subset of the 'C' version of High Dynamic Range (HDR) Histogram available at [github.com/HdrHistogram/HdrHistogram_c](https://github.com/HdrHistogram/HdrHistogram_c).
-
-
-The code present on `hdr_histogram.c`, `hdr_histogram.h`, and `hdr_atomic.c` was Written by Gil Tene, Michael Barker,
-and Matt Warren, and released to the public domain, as explained at
-http://creativecommons.org/publicdomain/zero/1.0/.
\ No newline at end of file
diff --git a/redis-stable/deps/hdr_histogram/hdr_atomic.h b/redis-stable/deps/hdr_histogram/hdr_atomic.h
deleted file mode 100644
index ae1056a8..00000000
--- a/redis-stable/deps/hdr_histogram/hdr_atomic.h
+++ /dev/null
@@ -1,146 +0,0 @@
-/**
- * hdr_atomic.h
- * Written by Philip Orwig and released to the public domain,
- * as explained at http://creativecommons.org/publicdomain/zero/1.0/
- */
-
-#ifndef HDR_ATOMIC_H__
-#define HDR_ATOMIC_H__
-
-
-#if defined(_MSC_VER)
-
-#include <stdint.h>
-#include <intrin.h>
-#include <stdbool.h>
-
-static void __inline * hdr_atomic_load_pointer(void** pointer)
-{
-	_ReadBarrier();
-	return *pointer;
-}
-
-static void hdr_atomic_store_pointer(void** pointer, void* value)
-{
-	_WriteBarrier();
-	*pointer = value;
-}
-
-static int64_t __inline hdr_atomic_load_64(int64_t* field)
-{ 
-	_ReadBarrier();
-	return *field;
-}
-
-static void __inline hdr_atomic_store_64(int64_t* field, int64_t value)
-{
-	_WriteBarrier();
-	*field = value;
-}
-
-static int64_t __inline hdr_atomic_exchange_64(volatile int64_t* field, int64_t value)
-{
-#if defined(_WIN64)
-    return _InterlockedExchange64(field, value);
-#else
-    int64_t comparand;
-    int64_t initial_value = *field;
-    do
-    {
-        comparand = initial_value;
-        initial_value = _InterlockedCompareExchange64(field, value, comparand);
-    }
-    while (comparand != initial_value);
-
-    return initial_value;
-#endif
-}
-
-static int64_t __inline hdr_atomic_add_fetch_64(volatile int64_t* field, int64_t value)
-{
-#if defined(_WIN64)
-	return _InterlockedExchangeAdd64(field, value) + value;
-#else
-    int64_t comparand;
-    int64_t initial_value = *field;
-    do
-    {
-        comparand = initial_value;
-        initial_value = _InterlockedCompareExchange64(field, comparand + value, comparand);
-    }
-    while (comparand != initial_value);
-
-    return initial_value + value;
-#endif
-}
-
-static bool __inline hdr_atomic_compare_exchange_64(volatile int64_t* field, int64_t* expected, int64_t desired)
-{
-    return *expected == _InterlockedCompareExchange64(field, desired, *expected);
-}
-
-#elif defined(__ATOMIC_SEQ_CST)
-
-#define hdr_atomic_load_pointer(x) __atomic_load_n(x, __ATOMIC_SEQ_CST)
-#define hdr_atomic_store_pointer(f,v) __atomic_store_n(f,v, __ATOMIC_SEQ_CST)
-#define hdr_atomic_load_64(x) __atomic_load_n(x, __ATOMIC_SEQ_CST)
-#define hdr_atomic_store_64(f,v) __atomic_store_n(f,v, __ATOMIC_SEQ_CST)
-#define hdr_atomic_exchange_64(f,i) __atomic_exchange_n(f,i, __ATOMIC_SEQ_CST)
-#define hdr_atomic_add_fetch_64(field, value) __atomic_add_fetch(field, value, __ATOMIC_SEQ_CST)
-#define hdr_atomic_compare_exchange_64(field, expected, desired) __atomic_compare_exchange_n(field, expected, desired, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST)
-
-#elif defined(__x86_64__)
-
-#include <stdint.h>
-#include <stdbool.h>
-
-static inline void* hdr_atomic_load_pointer(void** pointer)
-{
-   void* p =  *pointer;
-	asm volatile ("" ::: "memory");
-	return p;
-}
-
-static inline void hdr_atomic_store_pointer(void** pointer, void* value)
-{
-    asm volatile ("lock; xchgq %0, %1" : "+q" (value), "+m" (*pointer));
-}
-
-static inline int64_t hdr_atomic_load_64(int64_t* field)
-{
-    int64_t i = *field;
-	asm volatile ("" ::: "memory");
-	return i;
-}
-
-static inline void hdr_atomic_store_64(int64_t* field, int64_t value)
-{
-    asm volatile ("lock; xchgq %0, %1" : "+q" (value), "+m" (*field));
-}
-
-static inline int64_t hdr_atomic_exchange_64(volatile int64_t* field, int64_t value)
-{
-    int64_t result = 0;
-    asm volatile ("lock; xchgq %1, %2" : "=r" (result), "+q" (value), "+m" (*field));
-    return result;
-}
-
-static inline int64_t hdr_atomic_add_fetch_64(volatile int64_t* field, int64_t value)
-{
-    return __sync_add_and_fetch(field, value);
-}
-
-static inline bool hdr_atomic_compare_exchange_64(volatile int64_t* field, int64_t* expected, int64_t desired)
-{
-    int64_t original;
-    asm volatile( "lock; cmpxchgq %2, %1" : "=a"(original), "+m"(*field) : "q"(desired), "0"(*expected));
-    return original == *expected;
-}
-
-#else
-
-#error "Unable to determine atomic operations for your platform"
-
-#endif
-
-#endif /* HDR_ATOMIC_H__ */
diff --git a/redis-stable/deps/hdr_histogram/hdr_histogram.c b/redis-stable/deps/hdr_histogram/hdr_histogram.c
deleted file mode 100644
index 5f5286f2..00000000
--- a/redis-stable/deps/hdr_histogram/hdr_histogram.c
+++ /dev/null
@@ -1,1155 +0,0 @@
-/**
- * hdr_histogram.c
- * Written by Michael Barker and released to the public domain,
- * as explained at http://creativecommons.org/publicdomain/zero/1.0/
- */
-
-#include <stdlib.h>
-#include <stdbool.h>
-#include <math.h>
-#include <stdio.h>
-#include <string.h>
-#include <stdint.h>
-#include <errno.h>
-#include <inttypes.h>
-
-#include "hdr_histogram.h"
-#include "hdr_atomic.h"
-
-/*  ######   #######  ##     ## ##    ## ########  ######  */
-/* ##    ## ##     ## ##     ## ###   ##    ##    ##    ## */
-/* ##       ##     ## ##     ## ####  ##    ##    ##       */
-/* ##       ##     ## ##     ## ## ## ##    ##     ######  */
-/* ##       ##     ## ##     ## ##  ####    ##          ## */
-/* ##    ## ##     ## ##     ## ##   ###    ##    ##    ## */
-/*  ######   #######   #######  ##    ##    ##     ######  */
-
-static int32_t normalize_index(const struct hdr_histogram* h, int32_t index)
-{
-    int32_t normalized_index;
-    int32_t adjustment = 0;
-    if (h->normalizing_index_offset == 0)
-    {
-        return index;
-    }
-
-    normalized_index = index - h->normalizing_index_offset;
-
-    if (normalized_index < 0)
-    {
-        adjustment = h->counts_len;
-    }
-    else if (normalized_index >= h->counts_len)
-    {
-        adjustment = -h->counts_len;
-    }
-
-    return normalized_index + adjustment;
-}
-
-static int64_t counts_get_direct(const struct hdr_histogram* h, int32_t index)
-{
-    return h->counts[index];
-}
-
-static int64_t counts_get_normalised(const struct hdr_histogram* h, int32_t index)
-{
-    return counts_get_direct(h, normalize_index(h, index));
-}
-
-static void counts_inc_normalised(
-    struct hdr_histogram* h, int32_t index, int64_t value)
-{
-    int32_t normalised_index = normalize_index(h, index);
-    h->counts[normalised_index] += value;
-    h->total_count += value;
-}
-
-static void counts_inc_normalised_atomic(
-    struct hdr_histogram* h, int32_t index, int64_t value)
-{
-    int32_t normalised_index = normalize_index(h, index);
-
-    hdr_atomic_add_fetch_64(&h->counts[normalised_index], value);
-    hdr_atomic_add_fetch_64(&h->total_count, value);
-}
-
-static void update_min_max(struct hdr_histogram* h, int64_t value)
-{
-    h->min_value = (value < h->min_value && value != 0) ? value : h->min_value;
-    h->max_value = (value > h->max_value) ? value : h->max_value;
-}
-
-static void update_min_max_atomic(struct hdr_histogram* h, int64_t value)
-{
-    int64_t current_min_value;
-    int64_t current_max_value;
-    do
-    {
-        current_min_value = hdr_atomic_load_64(&h->min_value);
-
-        if (0 == value || current_min_value <= value)
-        {
-            break;
-        }
-    }
-    while (!hdr_atomic_compare_exchange_64(&h->min_value, &current_min_value, value));
-
-    do
-    {
-        current_max_value = hdr_atomic_load_64(&h->max_value);
-
-        if (value <= current_max_value)
-        {
-            break;
-        }
-    }
-    while (!hdr_atomic_compare_exchange_64(&h->max_value, &current_max_value, value));
-}
-
-
-/* ##     ## ######## #### ##       #### ######## ##    ## */
-/* ##     ##    ##     ##  ##        ##     ##     ##  ##  */
-/* ##     ##    ##     ##  ##        ##     ##      ####   */
-/* ##     ##    ##     ##  ##        ##     ##       ##    */
-/* ##     ##    ##     ##  ##        ##     ##       ##    */
-/* ##     ##    ##     ##  ##        ##     ##       ##    */
-/*  #######     ##    #### ######## ####    ##       ##    */
-
-static int64_t power(int64_t base, int64_t exp)
-{
-    int64_t result = 1;
-    while(exp)
-    {
-        result *= base; exp--;
-    }
-    return result;
-}
-
-#if defined(_MSC_VER)
-#   if defined(_WIN64)
-#       pragma intrinsic(_BitScanReverse64)
-#   else
-#       pragma intrinsic(_BitScanReverse)
-#   endif
-#endif
-
-static int32_t count_leading_zeros_64(int64_t value)
-{
-#if defined(_MSC_VER)
-    uint32_t leading_zero = 0;
-#if defined(_WIN64)
-    _BitScanReverse64(&leading_zero, value);
-#else
-    uint32_t high = value >> 32;
-    if  (_BitScanReverse(&leading_zero, high))
-    {
-        leading_zero += 32;
-    }
-    else
-    {
-        uint32_t low = value & 0x00000000FFFFFFFF;
-        _BitScanReverse(&leading_zero, low);
-    }
-#endif
-    return 63 - leading_zero; /* smallest power of 2 containing value */
-#else
-    return __builtin_clzll(value); /* smallest power of 2 containing value */
-#endif
-}
-
-static int32_t get_bucket_index(const struct hdr_histogram* h, int64_t value)
-{
-    int32_t pow2ceiling = 64 - count_leading_zeros_64(value | h->sub_bucket_mask); /* smallest power of 2 containing value */
-    return pow2ceiling - h->unit_magnitude - (h->sub_bucket_half_count_magnitude + 1);
-}
-
-static int32_t get_sub_bucket_index(int64_t value, int32_t bucket_index, int32_t unit_magnitude)
-{
-    return (int32_t)(value >> (bucket_index + unit_magnitude));
-}
-
-static int32_t counts_index(const struct hdr_histogram* h, int32_t bucket_index, int32_t sub_bucket_index)
-{
-    /* Calculate the index for the first entry in the bucket: */
-    /* (The following is the equivalent of ((bucket_index + 1) * subBucketHalfCount) ): */
-    int32_t bucket_base_index = (bucket_index + 1) << h->sub_bucket_half_count_magnitude;
-    /* Calculate the offset in the bucket: */
-    int32_t offset_in_bucket = sub_bucket_index - h->sub_bucket_half_count;
-    /* The following is the equivalent of ((sub_bucket_index  - subBucketHalfCount) + bucketBaseIndex; */
-    return bucket_base_index + offset_in_bucket;
-}
-
-static int64_t value_from_index(int32_t bucket_index, int32_t sub_bucket_index, int32_t unit_magnitude)
-{
-    return ((int64_t) sub_bucket_index) << (bucket_index + unit_magnitude);
-}
-
-int32_t counts_index_for(const struct hdr_histogram* h, int64_t value)
-{
-    int32_t bucket_index     = get_bucket_index(h, value);
-    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
-
-    return counts_index(h, bucket_index, sub_bucket_index);
-}
-
-int64_t hdr_value_at_index(const struct hdr_histogram *h, int32_t index)
-{
-    int32_t bucket_index = (index >> h->sub_bucket_half_count_magnitude) - 1;
-    int32_t sub_bucket_index = (index & (h->sub_bucket_half_count - 1)) + h->sub_bucket_half_count;
-
-    if (bucket_index < 0)
-    {
-        sub_bucket_index -= h->sub_bucket_half_count;
-        bucket_index = 0;
-    }
-
-    return value_from_index(bucket_index, sub_bucket_index, h->unit_magnitude);
-}
-
-int64_t hdr_size_of_equivalent_value_range(const struct hdr_histogram* h, int64_t value)
-{
-    int32_t bucket_index     = get_bucket_index(h, value);
-    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
-    int32_t adjusted_bucket  = (sub_bucket_index >= h->sub_bucket_count) ? (bucket_index + 1) : bucket_index;
-    return INT64_C(1) << (h->unit_magnitude + adjusted_bucket);
-}
-
-static int64_t lowest_equivalent_value(const struct hdr_histogram* h, int64_t value)
-{
-    int32_t bucket_index     = get_bucket_index(h, value);
-    int32_t sub_bucket_index = get_sub_bucket_index(value, bucket_index, h->unit_magnitude);
-    return value_from_index(bucket_index, sub_bucket_index, h->unit_magnitude);
-}
-
-int64_t hdr_next_non_equivalent_value(const struct hdr_histogram *h, int64_t value)
-{
-    return lowest_equivalent_value(h, value) + hdr_size_of_equivalent_value_range(h, value);
-}
-
-static int64_t highest_equivalent_value(const struct hdr_histogram* h, int64_t value)
-{
-    return hdr_next_non_equivalent_value(h, value) - 1;
-}
-
-int64_t hdr_median_equivalent_value(const struct hdr_histogram *h, int64_t value)
-{
-    return lowest_equivalent_value(h, value) + (hdr_size_of_equivalent_value_range(h, value) >> 1);
-}
-
-static int64_t non_zero_min(const struct hdr_histogram* h)
-{
-    if (INT64_MAX == h->min_value)
-    {
-        return INT64_MAX;
-    }
-
-    return lowest_equivalent_value(h, h->min_value);
-}
-
-void hdr_reset_internal_counters(struct hdr_histogram* h)
-{
-    int min_non_zero_index = -1;
-    int max_index = -1;
-    int64_t observed_total_count = 0;
-    int i;
-
-    for (i = 0; i < h->counts_len; i++)
-    {
-        int64_t count_at_index;
-
-        if ((count_at_index = counts_get_direct(h, i)) > 0)
-        {
-            observed_total_count += count_at_index;
-            max_index = i;
-            if (min_non_zero_index == -1 && i != 0)
-            {
-                min_non_zero_index = i;
-            }
-        }
-    }
-
-    if (max_index == -1)
-    {
-        h->max_value = 0;
-    }
-    else
-    {
-        int64_t max_value = hdr_value_at_index(h, max_index);
-        h->max_value = highest_equivalent_value(h, max_value);
-    }
-
-    if (min_non_zero_index == -1)
-    {
-        h->min_value = INT64_MAX;
-    }
-    else
-    {
-        h->min_value = hdr_value_at_index(h, min_non_zero_index);
-    }
-
-    h->total_count = observed_total_count;
-}
-
-static int32_t buckets_needed_to_cover_value(int64_t value, int32_t sub_bucket_count, int32_t unit_magnitude)
-{
-    int64_t smallest_untrackable_value = ((int64_t) sub_bucket_count) << unit_magnitude;
-    int32_t buckets_needed = 1;
-    while (smallest_untrackable_value <= value)
-    {
-        if (smallest_untrackable_value > INT64_MAX / 2)
-        {
-            return buckets_needed + 1;
-        }
-        smallest_untrackable_value <<= 1;
-        buckets_needed++;
-    }
-
-    return buckets_needed;
-}
-
-/* ##     ## ######## ##     ##  #######  ########  ##    ## */
-/* ###   ### ##       ###   ### ##     ## ##     ##  ##  ##  */
-/* #### #### ##       #### #### ##     ## ##     ##   ####   */
-/* ## ### ## ######   ## ### ## ##     ## ########     ##    */
-/* ##     ## ##       ##     ## ##     ## ##   ##      ##    */
-/* ##     ## ##       ##     ## ##     ## ##    ##     ##    */
-/* ##     ## ######## ##     ##  #######  ##     ##    ##    */
-
-int hdr_calculate_bucket_config(
-        int64_t lowest_trackable_value,
-        int64_t highest_trackable_value,
-        int significant_figures,
-        struct hdr_histogram_bucket_config* cfg)
-{
-    int32_t sub_bucket_count_magnitude;
-    int64_t largest_value_with_single_unit_resolution;
-
-    if (lowest_trackable_value < 1 ||
-            significant_figures < 1 || 5 < significant_figures ||
-            lowest_trackable_value * 2 > highest_trackable_value)
-    {
-        return EINVAL;
-    }
-
-    cfg->lowest_trackable_value = lowest_trackable_value;
-    cfg->significant_figures = significant_figures;
-    cfg->highest_trackable_value = highest_trackable_value;
-
-    largest_value_with_single_unit_resolution = 2 * power(10, significant_figures);
-    sub_bucket_count_magnitude = (int32_t) ceil(log((double)largest_value_with_single_unit_resolution) / log(2));
-    cfg->sub_bucket_half_count_magnitude = ((sub_bucket_count_magnitude > 1) ? sub_bucket_count_magnitude : 1) - 1;
-
-    cfg->unit_magnitude = (int32_t) floor(log((double)lowest_trackable_value) / log(2));
-
-    cfg->sub_bucket_count      = (int32_t) pow(2, (cfg->sub_bucket_half_count_magnitude + 1));
-    cfg->sub_bucket_half_count = cfg->sub_bucket_count / 2;
-    cfg->sub_bucket_mask       = ((int64_t) cfg->sub_bucket_count - 1) << cfg->unit_magnitude;
-
-    if (cfg->unit_magnitude + cfg->sub_bucket_half_count_magnitude > 61)
-    {
-        return EINVAL;
-    }
-
-    cfg->bucket_count = buckets_needed_to_cover_value(highest_trackable_value, cfg->sub_bucket_count, (int32_t)cfg->unit_magnitude);
-    cfg->counts_len = (cfg->bucket_count + 1) * (cfg->sub_bucket_count / 2);
-
-    return 0;
-}
-
-void hdr_init_preallocated(struct hdr_histogram* h, struct hdr_histogram_bucket_config* cfg)
-{
-    h->lowest_trackable_value          = cfg->lowest_trackable_value;
-    h->highest_trackable_value         = cfg->highest_trackable_value;
-    h->unit_magnitude                  = (int32_t)cfg->unit_magnitude;
-    h->significant_figures             = (int32_t)cfg->significant_figures;
-    h->sub_bucket_half_count_magnitude = cfg->sub_bucket_half_count_magnitude;
-    h->sub_bucket_half_count           = cfg->sub_bucket_half_count;
-    h->sub_bucket_mask                 = cfg->sub_bucket_mask;
-    h->sub_bucket_count                = cfg->sub_bucket_count;
-    h->min_value                       = INT64_MAX;
-    h->max_value                       = 0;
-    h->normalizing_index_offset        = 0;
-    h->conversion_ratio                = 1.0;
-    h->bucket_count                    = cfg->bucket_count;
-    h->counts_len                      = cfg->counts_len;
-    h->total_count                     = 0;
-}
-
-int hdr_init(
-        int64_t lowest_trackable_value,
-        int64_t highest_trackable_value,
-        int significant_figures,
-        struct hdr_histogram** result)
-{
-    int64_t* counts;
-    struct hdr_histogram_bucket_config cfg;
-    struct hdr_histogram* histogram;
-
-    int r = hdr_calculate_bucket_config(lowest_trackable_value, highest_trackable_value, significant_figures, &cfg);
-    if (r)
-    {
-        return r;
-    }
-
-    counts = (int64_t*) calloc((size_t) cfg.counts_len, sizeof(int64_t));
-    if (!counts)
-    {
-        return ENOMEM;
-    }
-
-    histogram = (struct hdr_histogram*) calloc(1, sizeof(struct hdr_histogram));
-    if (!histogram)
-    {
-        free(counts);
-        return ENOMEM;
-    }
-
-    histogram->counts = counts;
-
-    hdr_init_preallocated(histogram, &cfg);
-    *result = histogram;
-
-    return 0;
-}
-
-void hdr_close(struct hdr_histogram* h)
-{
-    if (h) {
-	free(h->counts);
-	free(h);
-    }
-}
-
-int hdr_alloc(int64_t highest_trackable_value, int significant_figures, struct hdr_histogram** result)
-{
-    return hdr_init(1, highest_trackable_value, significant_figures, result);
-}
-
-/* reset a histogram to zero. */
-void hdr_reset(struct hdr_histogram *h)
-{
-     h->total_count=0;
-     h->min_value = INT64_MAX;
-     h->max_value = 0;
-     memset(h->counts, 0, (sizeof(int64_t) * h->counts_len));
-}
-
-size_t hdr_get_memory_size(struct hdr_histogram *h)
-{
-    return sizeof(struct hdr_histogram) + h->counts_len * sizeof(int64_t);
-}
-
-/* ##     ## ########  ########     ###    ######## ########  ######  */
-/* ##     ## ##     ## ##     ##   ## ##      ##    ##       ##    ## */
-/* ##     ## ##     ## ##     ##  ##   ##     ##    ##       ##       */
-/* ##     ## ########  ##     ## ##     ##    ##    ######    ######  */
-/* ##     ## ##        ##     ## #########    ##    ##             ## */
-/* ##     ## ##        ##     ## ##     ##    ##    ##       ##    ## */
-/*  #######  ##        ########  ##     ##    ##    ########  ######  */
-
-
-bool hdr_record_value(struct hdr_histogram* h, int64_t value)
-{
-    return hdr_record_values(h, value, 1);
-}
-
-bool hdr_record_value_atomic(struct hdr_histogram* h, int64_t value)
-{
-    return hdr_record_values_atomic(h, value, 1);
-}
-
-bool hdr_record_values(struct hdr_histogram* h, int64_t value, int64_t count)
-{
-    int32_t counts_index;
-
-    if (value < 0)
-    {
-        return false;
-    }
-
-    counts_index = counts_index_for(h, value);
-
-    if (counts_index < 0 || h->counts_len <= counts_index)
-    {
-        return false;
-    }
-
-    counts_inc_normalised(h, counts_index, count);
-    update_min_max(h, value);
-
-    return true;
-}
-
-bool hdr_record_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count)
-{
-    int32_t counts_index;
-
-    if (value < 0)
-    {
-        return false;
-    }
-
-    counts_index = counts_index_for(h, value);
-
-    if (counts_index < 0 || h->counts_len <= counts_index)
-    {
-        return false;
-    }
-
-    counts_inc_normalised_atomic(h, counts_index, count);
-    update_min_max_atomic(h, value);
-
-    return true;
-}
-
-bool hdr_record_corrected_value(struct hdr_histogram* h, int64_t value, int64_t expected_interval)
-{
-    return hdr_record_corrected_values(h, value, 1, expected_interval);
-}
-
-bool hdr_record_corrected_value_atomic(struct hdr_histogram* h, int64_t value, int64_t expected_interval)
-{
-    return hdr_record_corrected_values_atomic(h, value, 1, expected_interval);
-}
-
-bool hdr_record_corrected_values(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval)
-{
-    int64_t missing_value;
-
-    if (!hdr_record_values(h, value, count))
-    {
-        return false;
-    }
-
-    if (expected_interval <= 0 || value <= expected_interval)
-    {
-        return true;
-    }
-
-    missing_value = value - expected_interval;
-    for (; missing_value >= expected_interval; missing_value -= expected_interval)
-    {
-        if (!hdr_record_values(h, missing_value, count))
-        {
-            return false;
-        }
-    }
-
-    return true;
-}
-
-bool hdr_record_corrected_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval)
-{
-    int64_t missing_value;
-
-    if (!hdr_record_values_atomic(h, value, count))
-    {
-        return false;
-    }
-
-    if (expected_interval <= 0 || value <= expected_interval)
-    {
-        return true;
-    }
-
-    missing_value = value - expected_interval;
-    for (; missing_value >= expected_interval; missing_value -= expected_interval)
-    {
-        if (!hdr_record_values_atomic(h, missing_value, count))
-        {
-            return false;
-        }
-    }
-
-    return true;
-}
-
-int64_t hdr_add(struct hdr_histogram* h, const struct hdr_histogram* from)
-{
-    struct hdr_iter iter;
-    int64_t dropped = 0;
-    hdr_iter_recorded_init(&iter, from);
-
-    while (hdr_iter_next(&iter))
-    {
-        int64_t value = iter.value;
-        int64_t count = iter.count;
-
-        if (!hdr_record_values(h, value, count))
-        {
-            dropped += count;
-        }
-    }
-
-    return dropped;
-}
-
-int64_t hdr_add_while_correcting_for_coordinated_omission(
-        struct hdr_histogram* h, struct hdr_histogram* from, int64_t expected_interval)
-{
-    struct hdr_iter iter;
-    int64_t dropped = 0;
-    hdr_iter_recorded_init(&iter, from);
-
-    while (hdr_iter_next(&iter))
-    {
-        int64_t value = iter.value;
-        int64_t count = iter.count;
-
-        if (!hdr_record_corrected_values(h, value, count, expected_interval))
-        {
-            dropped += count;
-        }
-    }
-
-    return dropped;
-}
-
-
-
-/* ##     ##    ###    ##       ##     ## ########  ######  */
-/* ##     ##   ## ##   ##       ##     ## ##       ##    ## */
-/* ##     ##  ##   ##  ##       ##     ## ##       ##       */
-/* ##     ## ##     ## ##       ##     ## ######    ######  */
-/*  ##   ##  ######### ##       ##     ## ##             ## */
-/*   ## ##   ##     ## ##       ##     ## ##       ##    ## */
-/*    ###    ##     ## ########  #######  ########  ######  */
-
-
-int64_t hdr_max(const struct hdr_histogram* h)
-{
-    if (0 == h->max_value)
-    {
-        return 0;
-    }
-
-    return highest_equivalent_value(h, h->max_value);
-}
-
-int64_t hdr_min(const struct hdr_histogram* h)
-{
-    if (0 < hdr_count_at_index(h, 0))
-    {
-        return 0;
-    }
-
-    return non_zero_min(h);
-}
-
-int64_t hdr_value_at_percentile(const struct hdr_histogram* h, double percentile)
-{
-    struct hdr_iter iter;
-    int64_t total = 0;
-    double requested_percentile = percentile < 100.0 ? percentile : 100.0;
-    int64_t count_at_percentile =
-        (int64_t) (((requested_percentile / 100) * h->total_count) + 0.5);
-    count_at_percentile = count_at_percentile > 1 ? count_at_percentile : 1;
-
-    hdr_iter_init(&iter, h);
-
-    while (hdr_iter_next(&iter))
-    {
-        total += iter.count;
-
-        if (total >= count_at_percentile)
-        {
-            int64_t value_from_index = iter.value;
-            return highest_equivalent_value(h, value_from_index);
-        }
-    }
-
-    return 0;
-}
-
-double hdr_mean(const struct hdr_histogram* h)
-{
-    struct hdr_iter iter;
-    int64_t total = 0;
-
-    hdr_iter_init(&iter, h);
-
-    while (hdr_iter_next(&iter))
-    {
-        if (0 != iter.count)
-        {
-            total += iter.count * hdr_median_equivalent_value(h, iter.value);
-        }
-    }
-
-    return (total * 1.0) / h->total_count;
-}
-
-double hdr_stddev(const struct hdr_histogram* h)
-{
-    double mean = hdr_mean(h);
-    double geometric_dev_total = 0.0;
-
-    struct hdr_iter iter;
-    hdr_iter_init(&iter, h);
-
-    while (hdr_iter_next(&iter))
-    {
-        if (0 != iter.count)
-        {
-            double dev = (hdr_median_equivalent_value(h, iter.value) * 1.0) - mean;
-            geometric_dev_total += (dev * dev) * iter.count;
-        }
-    }
-
-    return sqrt(geometric_dev_total / h->total_count);
-}
-
-bool hdr_values_are_equivalent(const struct hdr_histogram* h, int64_t a, int64_t b)
-{
-    return lowest_equivalent_value(h, a) == lowest_equivalent_value(h, b);
-}
-
-int64_t hdr_lowest_equivalent_value(const struct hdr_histogram* h, int64_t value)
-{
-    return lowest_equivalent_value(h, value);
-}
-
-int64_t hdr_count_at_value(const struct hdr_histogram* h, int64_t value)
-{
-    return counts_get_normalised(h, counts_index_for(h, value));
-}
-
-int64_t hdr_count_at_index(const struct hdr_histogram* h, int32_t index)
-{
-    return counts_get_normalised(h, index);
-}
-
-
-/* #### ######## ######## ########     ###    ########  #######  ########   ######  */
-/*  ##     ##    ##       ##     ##   ## ##      ##    ##     ## ##     ## ##    ## */
-/*  ##     ##    ##       ##     ##  ##   ##     ##    ##     ## ##     ## ##       */
-/*  ##     ##    ######   ########  ##     ##    ##    ##     ## ########   ######  */
-/*  ##     ##    ##       ##   ##   #########    ##    ##     ## ##   ##         ## */
-/*  ##     ##    ##       ##    ##  ##     ##    ##    ##     ## ##    ##  ##    ## */
-/* ####    ##    ######## ##     ## ##     ##    ##     #######  ##     ##  ######  */
-
-
-static bool has_buckets(struct hdr_iter* iter)
-{
-    return iter->counts_index < iter->h->counts_len;
-}
-
-static bool has_next(struct hdr_iter* iter)
-{
-    return iter->cumulative_count < iter->total_count;
-}
-
-static bool move_next(struct hdr_iter* iter)
-{
-    iter->counts_index++;
-
-    if (!has_buckets(iter))
-    {
-        return false;
-    }
-
-    iter->count = counts_get_normalised(iter->h, iter->counts_index);
-    iter->cumulative_count += iter->count;
-
-    iter->value = hdr_value_at_index(iter->h, iter->counts_index);
-    iter->highest_equivalent_value = highest_equivalent_value(iter->h, iter->value);
-    iter->lowest_equivalent_value = lowest_equivalent_value(iter->h, iter->value);
-    iter->median_equivalent_value = hdr_median_equivalent_value(iter->h, iter->value);
-
-    return true;
-}
-
-static int64_t peek_next_value_from_index(struct hdr_iter* iter)
-{
-    return hdr_value_at_index(iter->h, iter->counts_index + 1);
-}
-
-static bool next_value_greater_than_reporting_level_upper_bound(
-    struct hdr_iter *iter, int64_t reporting_level_upper_bound)
-{
-    if (iter->counts_index >= iter->h->counts_len)
-    {
-        return false;
-    }
-
-    return peek_next_value_from_index(iter) > reporting_level_upper_bound;
-}
-
-static bool basic_iter_next(struct hdr_iter *iter)
-{
-    if (!has_next(iter) || iter->counts_index >= iter->h->counts_len)
-    {
-        return false;
-    }
-
-    move_next(iter);
-
-    return true;
-}
-
-static void update_iterated_values(struct hdr_iter* iter, int64_t new_value_iterated_to)
-{
-    iter->value_iterated_from = iter->value_iterated_to;
-    iter->value_iterated_to = new_value_iterated_to;
-}
-
-static bool all_values_iter_next(struct hdr_iter* iter)
-{
-    bool result = move_next(iter);
-
-    if (result)
-    {
-        update_iterated_values(iter, iter->value);
-    }
-
-    return result;
-}
-
-void hdr_iter_init(struct hdr_iter* iter, const struct hdr_histogram* h)
-{
-    iter->h = h;
-
-    iter->counts_index = -1;
-    iter->total_count = h->total_count;
-    iter->count = 0;
-    iter->cumulative_count = 0;
-    iter->value = 0;
-    iter->highest_equivalent_value = 0;
-    iter->value_iterated_from = 0;
-    iter->value_iterated_to = 0;
-
-    iter->_next_fp = all_values_iter_next;
-}
-
-bool hdr_iter_next(struct hdr_iter* iter)
-{
-    return iter->_next_fp(iter);
-}
-
-/* ########  ######## ########   ######  ######## ##    ## ######## #### ##       ########  ######  */
-/* ##     ## ##       ##     ## ##    ## ##       ###   ##    ##     ##  ##       ##       ##    ## */
-/* ##     ## ##       ##     ## ##       ##       ####  ##    ##     ##  ##       ##       ##       */
-/* ########  ######   ########  ##       ######   ## ## ##    ##     ##  ##       ######    ######  */
-/* ##        ##       ##   ##   ##       ##       ##  ####    ##     ##  ##       ##             ## */
-/* ##        ##       ##    ##  ##    ## ##       ##   ###    ##     ##  ##       ##       ##    ## */
-/* ##        ######## ##     ##  ######  ######## ##    ##    ##    #### ######## ########  ######  */
-
-static bool percentile_iter_next(struct hdr_iter* iter)
-{
-    int64_t temp, half_distance, percentile_reporting_ticks;
-
-    struct hdr_iter_percentiles* percentiles = &iter->specifics.percentiles;
-
-    if (!has_next(iter))
-    {
-        if (percentiles->seen_last_value)
-        {
-            return false;
-        }
-
-        percentiles->seen_last_value = true;
-        percentiles->percentile = 100.0;
-
-        return true;
-    }
-
-    if (iter->counts_index == -1 && !basic_iter_next(iter))
-    {
-        return false;
-    }
-
-    do
-    {
-        double current_percentile = (100.0 * (double) iter->cumulative_count) / iter->h->total_count;
-        if (iter->count != 0 &&
-                percentiles->percentile_to_iterate_to <= current_percentile)
-        {
-            update_iterated_values(iter, highest_equivalent_value(iter->h, iter->value));
-
-            percentiles->percentile = percentiles->percentile_to_iterate_to;
-            temp = (int64_t)(log(100 / (100.0 - (percentiles->percentile_to_iterate_to))) / log(2)) + 1;
-            half_distance = (int64_t) pow(2, (double) temp);
-            percentile_reporting_ticks = percentiles->ticks_per_half_distance * half_distance;
-            percentiles->percentile_to_iterate_to += 100.0 / percentile_reporting_ticks;
-
-            return true;
-        }
-    }
-    while (basic_iter_next(iter));
-
-    return true;
-}
-
-void hdr_iter_percentile_init(struct hdr_iter* iter, const struct hdr_histogram* h, int32_t ticks_per_half_distance)
-{
-    iter->h = h;
-
-    hdr_iter_init(iter, h);
-
-    iter->specifics.percentiles.seen_last_value          = false;
-    iter->specifics.percentiles.ticks_per_half_distance  = ticks_per_half_distance;
-    iter->specifics.percentiles.percentile_to_iterate_to = 0.0;
-    iter->specifics.percentiles.percentile               = 0.0;
-
-    iter->_next_fp = percentile_iter_next;
-}
-
-static void format_line_string(char* str, size_t len, int significant_figures, format_type format)
-{
-#if defined(_MSC_VER)
-#define snprintf _snprintf
-#pragma warning(push)
-#pragma warning(disable: 4996)
-#endif
-    const char* format_str = "%s%d%s";
-
-    switch (format)
-    {
-        case CSV:
-            snprintf(str, len, format_str, "%.", significant_figures, "f,%f,%d,%.2f\n");
-            break;
-        case CLASSIC:
-            snprintf(str, len, format_str, "%12.", significant_figures, "f %12f %12d %12.2f\n");
-            break;
-        default:
-            snprintf(str, len, format_str, "%12.", significant_figures, "f %12f %12d %12.2f\n");
-    }
-#if defined(_MSC_VER)
-#undef snprintf
-#pragma warning(pop)
-#endif
-}
-
-
-/* ########  ########  ######   #######  ########  ########  ######## ########   */
-/* ##     ## ##       ##    ## ##     ## ##     ## ##     ## ##       ##     ##  */
-/* ##     ## ##       ##       ##     ## ##     ## ##     ## ##       ##     ##  */
-/* ########  ######   ##       ##     ## ########  ##     ## ######   ##     ##  */
-/* ##   ##   ##       ##       ##     ## ##   ##   ##     ## ##       ##     ##  */
-/* ##    ##  ##       ##    ## ##     ## ##    ##  ##     ## ##       ##     ##  */
-/* ##     ## ########  ######   #######  ##     ## ########  ######## ########   */
-
-
-static bool recorded_iter_next(struct hdr_iter* iter)
-{
-    while (basic_iter_next(iter))
-    {
-        if (iter->count != 0)
-        {
-            update_iterated_values(iter, iter->value);
-
-            iter->specifics.recorded.count_added_in_this_iteration_step = iter->count;
-            return true;
-        }
-    }
-
-    return false;
-}
-
-void hdr_iter_recorded_init(struct hdr_iter* iter, const struct hdr_histogram* h)
-{
-    hdr_iter_init(iter, h);
-
-    iter->specifics.recorded.count_added_in_this_iteration_step = 0;
-
-    iter->_next_fp = recorded_iter_next;
-}
-
-/* ##       #### ##    ## ########    ###    ########  */
-/* ##        ##  ###   ## ##         ## ##   ##     ## */
-/* ##        ##  ####  ## ##        ##   ##  ##     ## */
-/* ##        ##  ## ## ## ######   ##     ## ########  */
-/* ##        ##  ##  #### ##       ######### ##   ##   */
-/* ##        ##  ##   ### ##       ##     ## ##    ##  */
-/* ######## #### ##    ## ######## ##     ## ##     ## */
-
-
-static bool iter_linear_next(struct hdr_iter* iter)
-{
-    struct hdr_iter_linear* linear = &iter->specifics.linear;
-
-    linear->count_added_in_this_iteration_step = 0;
-
-    if (has_next(iter) ||
-        next_value_greater_than_reporting_level_upper_bound(
-            iter, linear->next_value_reporting_level_lowest_equivalent))
-    {
-        do
-        {
-            if (iter->value >= linear->next_value_reporting_level_lowest_equivalent)
-            {
-                update_iterated_values(iter, linear->next_value_reporting_level);
-
-                linear->next_value_reporting_level += linear->value_units_per_bucket;
-                linear->next_value_reporting_level_lowest_equivalent =
-                    lowest_equivalent_value(iter->h, linear->next_value_reporting_level);
-
-                return true;
-            }
-
-            if (!move_next(iter))
-            {
-                return true;
-            }
-
-            linear->count_added_in_this_iteration_step += iter->count;
-        }
-        while (true);
-    }
-
-    return false;
-}
-
-
-void hdr_iter_linear_init(struct hdr_iter* iter, const struct hdr_histogram* h, int64_t value_units_per_bucket)
-{
-    hdr_iter_init(iter, h);
-
-    iter->specifics.linear.count_added_in_this_iteration_step = 0;
-    iter->specifics.linear.value_units_per_bucket = value_units_per_bucket;
-    iter->specifics.linear.next_value_reporting_level = value_units_per_bucket;
-    iter->specifics.linear.next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(h, value_units_per_bucket);
-
-    iter->_next_fp = iter_linear_next;
-}
-
-void hdr_iter_linear_set_value_units_per_bucket(struct hdr_iter* iter, int64_t value_units_per_bucket)
-{
-    iter->specifics.linear.value_units_per_bucket = value_units_per_bucket;
-}
-
-/* ##        #######   ######      ###    ########  #### ######## ##     ## ##     ## ####  ######  */
-/* ##       ##     ## ##    ##    ## ##   ##     ##  ##     ##    ##     ## ###   ###  ##  ##    ## */
-/* ##       ##     ## ##         ##   ##  ##     ##  ##     ##    ##     ## #### ####  ##  ##       */
-/* ##       ##     ## ##   #### ##     ## ########   ##     ##    ######### ## ### ##  ##  ##       */
-/* ##       ##     ## ##    ##  ######### ##   ##    ##     ##    ##     ## ##     ##  ##  ##       */
-/* ##       ##     ## ##    ##  ##     ## ##    ##   ##     ##    ##     ## ##     ##  ##  ##    ## */
-/* ########  #######   ######   ##     ## ##     ## ####    ##    ##     ## ##     ## ####  ######  */
-
-static bool log_iter_next(struct hdr_iter *iter)
-{
-    struct hdr_iter_log* logarithmic = &iter->specifics.log;
-
-    logarithmic->count_added_in_this_iteration_step = 0;
-
-    if (has_next(iter) ||
-        next_value_greater_than_reporting_level_upper_bound(
-            iter, logarithmic->next_value_reporting_level_lowest_equivalent))
-    {
-        do
-        {
-            if (iter->value >= logarithmic->next_value_reporting_level_lowest_equivalent)
-            {
-                update_iterated_values(iter, logarithmic->next_value_reporting_level);
-
-                logarithmic->next_value_reporting_level *= (int64_t)logarithmic->log_base;
-                logarithmic->next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(iter->h, logarithmic->next_value_reporting_level);
-
-                return true;
-            }
-
-            if (!move_next(iter))
-            {
-                return true;
-            }
-
-            logarithmic->count_added_in_this_iteration_step += iter->count;
-        }
-        while (true);
-    }
-
-    return false;
-}
-
-void hdr_iter_log_init(
-        struct hdr_iter* iter,
-        const struct hdr_histogram* h,
-        int64_t value_units_first_bucket,
-        double log_base)
-{
-    hdr_iter_init(iter, h);
-    iter->specifics.log.count_added_in_this_iteration_step = 0;
-    iter->specifics.log.log_base = log_base;
-    iter->specifics.log.next_value_reporting_level = value_units_first_bucket;
-    iter->specifics.log.next_value_reporting_level_lowest_equivalent = lowest_equivalent_value(h, value_units_first_bucket);
-
-    iter->_next_fp = log_iter_next;
-}
-
-/* Printing. */
-
-static const char* format_head_string(format_type format)
-{
-    switch (format)
-    {
-        case CSV:
-            return "%s,%s,%s,%s\n";
-        case CLASSIC:
-        default:
-            return "%12s %12s %12s %12s\n\n";
-    }
-}
-
-static const char CLASSIC_FOOTER[] =
-    "#[Mean    = %12.3f, StdDeviation   = %12.3f]\n"
-    "#[Max     = %12.3f, Total count    = %12" PRIu64 "]\n"
-    "#[Buckets = %12d, SubBuckets     = %12d]\n";
-
-int hdr_percentiles_print(
-        struct hdr_histogram* h, FILE* stream, int32_t ticks_per_half_distance,
-        double value_scale, format_type format)
-{
-    char line_format[25];
-    const char* head_format;
-    int rc = 0;
-    struct hdr_iter iter;
-    struct hdr_iter_percentiles * percentiles;
-
-    format_line_string(line_format, 25, h->significant_figures, format);
-    head_format = format_head_string(format);
-
-    hdr_iter_percentile_init(&iter, h, ticks_per_half_distance);
-
-    if (fprintf(
-            stream, head_format,
-            "Value", "Percentile", "TotalCount", "1/(1-Percentile)") < 0)
-    {
-        rc = EIO;
-        goto cleanup;
-    }
-
-    percentiles = &iter.specifics.percentiles;
-    while (hdr_iter_next(&iter))
-    {
-        double  value               = iter.highest_equivalent_value / value_scale;
-        double  percentile          = percentiles->percentile / 100.0;
-        int64_t total_count         = iter.cumulative_count;
-        double  inverted_percentile = (1.0 / (1.0 - percentile));
-
-        if (fprintf(
-                stream, line_format, value, percentile, total_count, inverted_percentile) < 0)
-        {
-            rc = EIO;
-            goto cleanup;
-        }
-    }
-
-    if (CLASSIC == format)
-    {
-        double mean   = hdr_mean(h)   / value_scale;
-        double stddev = hdr_stddev(h) / value_scale;
-        double max    = hdr_max(h)    / value_scale;
-
-        if (fprintf(
-                stream, CLASSIC_FOOTER,  mean, stddev, max,
-                h->total_count, h->bucket_count, h->sub_bucket_count) < 0)
-        {
-            rc = EIO;
-            goto cleanup;
-        }
-    }
-
-    cleanup:
-    return rc;
-}
diff --git a/redis-stable/deps/hdr_histogram/hdr_histogram.h b/redis-stable/deps/hdr_histogram/hdr_histogram.h
deleted file mode 100644
index c26c56b2..00000000
--- a/redis-stable/deps/hdr_histogram/hdr_histogram.h
+++ /dev/null
@@ -1,509 +0,0 @@
-/**
- * hdr_histogram.h
- * Written by Michael Barker and released to the public domain,
- * as explained at http://creativecommons.org/publicdomain/zero/1.0/
- *
- * The source for the hdr_histogram utilises a few C99 constructs, specifically
- * the use of stdint/stdbool and inline variable declaration.
- */
-
-#ifndef HDR_HISTOGRAM_H
-#define HDR_HISTOGRAM_H 1
-
-#include <stdint.h>
-#include <stdbool.h>
-#include <stdio.h>
-
-struct hdr_histogram
-{
-    int64_t lowest_trackable_value;
-    int64_t highest_trackable_value;
-    int32_t unit_magnitude;
-    int32_t significant_figures;
-    int32_t sub_bucket_half_count_magnitude;
-    int32_t sub_bucket_half_count;
-    int64_t sub_bucket_mask;
-    int32_t sub_bucket_count;
-    int32_t bucket_count;
-    int64_t min_value;
-    int64_t max_value;
-    int32_t normalizing_index_offset;
-    double conversion_ratio;
-    int32_t counts_len;
-    int64_t total_count;
-    int64_t* counts;
-};
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * Allocate the memory and initialise the hdr_histogram.
- *
- * Due to the size of the histogram being the result of some reasonably
- * involved math on the input parameters this function it is tricky to stack allocate.
- * The histogram should be released with hdr_close
- *
- * @param lowest_trackable_value The smallest possible value to be put into the
- * histogram.
- * @param highest_trackable_value The largest possible value to be put into the
- * histogram.
- * @param significant_figures The level of precision for this histogram, i.e. the number
- * of figures in a decimal number that will be maintained.  E.g. a value of 3 will mean
- * the results from the histogram will be accurate up to the first three digits.  Must
- * be a value between 1 and 5 (inclusive).
- * @param result Output parameter to capture allocated histogram.
- * @return 0 on success, EINVAL if lowest_trackable_value is < 1 or the
- * significant_figure value is outside of the allowed range, ENOMEM if malloc
- * failed.
- */
-int hdr_init(
-    int64_t lowest_trackable_value,
-    int64_t highest_trackable_value,
-    int significant_figures,
-    struct hdr_histogram** result);
-
-/**
- * Free the memory and close the hdr_histogram.
- *
- * @param h The histogram you want to close.
- */
-void hdr_close(struct hdr_histogram* h);
-
-/**
- * Allocate the memory and initialise the hdr_histogram.  This is the equivalent of calling
- * hdr_init(1, highest_trackable_value, significant_figures, result);
- *
- * @deprecated use hdr_init.
- */
-int hdr_alloc(int64_t highest_trackable_value, int significant_figures, struct hdr_histogram** result);
-
-
-/**
- * Reset a histogram to zero - empty out a histogram and re-initialise it
- *
- * If you want to re-use an existing histogram, but reset everything back to zero, this
- * is the routine to use.
- *
- * @param h The histogram you want to reset to empty.
- *
- */
-void hdr_reset(struct hdr_histogram* h);
-
-/**
- * Get the memory size of the hdr_histogram.
- *
- * @param h "This" pointer
- * @return The amount of memory used by the hdr_histogram in bytes
- */
-size_t hdr_get_memory_size(struct hdr_histogram* h);
-
-/**
- * Records a value in the histogram, will round this value of to a precision at or better
- * than the significant_figure specified at construction time.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_value(struct hdr_histogram* h, int64_t value);
-
-/**
- * Records a value in the histogram, will round this value of to a precision at or better
- * than the significant_figure specified at construction time.
- *
- * Will record this value atomically, however the whole structure may appear inconsistent
- * when read concurrently with this update.  Do NOT mix calls to this method with calls
- * to non-atomic updates.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_value_atomic(struct hdr_histogram* h, int64_t value);
-
-/**
- * Records count values in the histogram, will round this value of to a
- * precision at or better than the significant_figure specified at construction
- * time.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param count Number of 'value's to add to the histogram
- * @return false if any value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_values(struct hdr_histogram* h, int64_t value, int64_t count);
-
-/**
- * Records count values in the histogram, will round this value of to a
- * precision at or better than the significant_figure specified at construction
- * time.
- *
- * Will record this value atomically, however the whole structure may appear inconsistent
- * when read concurrently with this update.  Do NOT mix calls to this method with calls
- * to non-atomic updates.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param count Number of 'value's to add to the histogram
- * @return false if any value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count);
-
-/**
- * Record a value in the histogram and backfill based on an expected interval.
- *
- * Records a value in the histogram, will round this value of to a precision at or better
- * than the significant_figure specified at contruction time.  This is specifically used
- * for recording latency.  If the value is larger than the expected_interval then the
- * latency recording system has experienced co-ordinated omission.  This method fills in the
- * values that would have occured had the client providing the load not been blocked.
-
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param expected_interval The delay between recording values.
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_corrected_value(struct hdr_histogram* h, int64_t value, int64_t expexcted_interval);
-
-/**
- * Record a value in the histogram and backfill based on an expected interval.
- *
- * Records a value in the histogram, will round this value of to a precision at or better
- * than the significant_figure specified at contruction time.  This is specifically used
- * for recording latency.  If the value is larger than the expected_interval then the
- * latency recording system has experienced co-ordinated omission.  This method fills in the
- * values that would have occured had the client providing the load not been blocked.
- *
- * Will record this value atomically, however the whole structure may appear inconsistent
- * when read concurrently with this update.  Do NOT mix calls to this method with calls
- * to non-atomic updates.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param expected_interval The delay between recording values.
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_corrected_value_atomic(struct hdr_histogram* h, int64_t value, int64_t expexcted_interval);
-
-/**
- * Record a value in the histogram 'count' times.  Applies the same correcting logic
- * as 'hdr_record_corrected_value'.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param count Number of 'value's to add to the histogram
- * @param expected_interval The delay between recording values.
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_corrected_values(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval);
-
-/**
- * Record a value in the histogram 'count' times.  Applies the same correcting logic
- * as 'hdr_record_corrected_value'.
- *
- * Will record this value atomically, however the whole structure may appear inconsistent
- * when read concurrently with this update.  Do NOT mix calls to this method with calls
- * to non-atomic updates.
- *
- * @param h "This" pointer
- * @param value Value to add to the histogram
- * @param count Number of 'value's to add to the histogram
- * @param expected_interval The delay between recording values.
- * @return false if the value is larger than the highest_trackable_value and can't be recorded,
- * true otherwise.
- */
-bool hdr_record_corrected_values_atomic(struct hdr_histogram* h, int64_t value, int64_t count, int64_t expected_interval);
-
-/**
- * Adds all of the values from 'from' to 'this' histogram.  Will return the
- * number of values that are dropped when copying.  Values will be dropped
- * if they around outside of h.lowest_trackable_value and
- * h.highest_trackable_value.
- *
- * @param h "This" pointer
- * @param from Histogram to copy values from.
- * @return The number of values dropped when copying.
- */
-int64_t hdr_add(struct hdr_histogram* h, const struct hdr_histogram* from);
-
-/**
- * Adds all of the values from 'from' to 'this' histogram.  Will return the
- * number of values that are dropped when copying.  Values will be dropped
- * if they around outside of h.lowest_trackable_value and
- * h.highest_trackable_value.
- *
- * @param h "This" pointer
- * @param from Histogram to copy values from.
- * @return The number of values dropped when copying.
- */
-int64_t hdr_add_while_correcting_for_coordinated_omission(
-    struct hdr_histogram* h, struct hdr_histogram* from, int64_t expected_interval);
-
-/**
- * Get minimum value from the histogram.  Will return 2^63-1 if the histogram
- * is empty.
- *
- * @param h "This" pointer
- */
-int64_t hdr_min(const struct hdr_histogram* h);
-
-/**
- * Get maximum value from the histogram.  Will return 0 if the histogram
- * is empty.
- *
- * @param h "This" pointer
- */
-int64_t hdr_max(const struct hdr_histogram* h);
-
-/**
- * Get the value at a specific percentile.
- *
- * @param h "This" pointer.
- * @param percentile The percentile to get the value for
- */
-int64_t hdr_value_at_percentile(const struct hdr_histogram* h, double percentile);
-
-/**
- * Gets the standard deviation for the values in the histogram.
- *
- * @param h "This" pointer
- * @return The standard deviation
- */
-double hdr_stddev(const struct hdr_histogram* h);
-
-/**
- * Gets the mean for the values in the histogram.
- *
- * @param h "This" pointer
- * @return The mean
- */
-double hdr_mean(const struct hdr_histogram* h);
-
-/**
- * Determine if two values are equivalent with the histogram's resolution.
- * Where "equivalent" means that value samples recorded for any two
- * equivalent values are counted in a common total count.
- *
- * @param h "This" pointer
- * @param a first value to compare
- * @param b second value to compare
- * @return 'true' if values are equivalent with the histogram's resolution.
- */
-bool hdr_values_are_equivalent(const struct hdr_histogram* h, int64_t a, int64_t b);
-
-/**
- * Get the lowest value that is equivalent to the given value within the histogram's resolution.
- * Where "equivalent" means that value samples recorded for any two
- * equivalent values are counted in a common total count.
- *
- * @param h "This" pointer
- * @param value The given value
- * @return The lowest value that is equivalent to the given value within the histogram's resolution.
- */
-int64_t hdr_lowest_equivalent_value(const struct hdr_histogram* h, int64_t value);
-
-/**
- * Get the count of recorded values at a specific value
- * (to within the histogram resolution at the value level).
- *
- * @param h "This" pointer
- * @param value The value for which to provide the recorded count
- * @return The total count of values recorded in the histogram within the value range that is
- * {@literal >=} lowestEquivalentValue(<i>value</i>) and {@literal <=} highestEquivalentValue(<i>value</i>)
- */
-int64_t hdr_count_at_value(const struct hdr_histogram* h, int64_t value);
-
-int64_t hdr_count_at_index(const struct hdr_histogram* h, int32_t index);
-
-int64_t hdr_value_at_index(const struct hdr_histogram* h, int32_t index);
-
-struct hdr_iter_percentiles
-{
-    bool seen_last_value;
-    int32_t ticks_per_half_distance;
-    double percentile_to_iterate_to;
-    double percentile;
-};
-
-struct hdr_iter_recorded
-{
-    int64_t count_added_in_this_iteration_step;
-};
-
-struct hdr_iter_linear
-{
-    int64_t value_units_per_bucket;
-    int64_t count_added_in_this_iteration_step;
-    int64_t next_value_reporting_level;
-    int64_t next_value_reporting_level_lowest_equivalent;
-};
-
-struct hdr_iter_log
-{
-    double log_base;
-    int64_t count_added_in_this_iteration_step;
-    int64_t next_value_reporting_level;
-    int64_t next_value_reporting_level_lowest_equivalent;
-};
-
-/**
- * The basic iterator.  This is a generic structure
- * that supports all of the types of iteration.  Use
- * the appropriate initialiser to get the desired
- * iteration.
- *
- * @
- */
-struct hdr_iter
-{
-    const struct hdr_histogram* h;
-    /** raw index into the counts array */
-    int32_t counts_index;
-    /** snapshot of the length at the time the iterator is created */
-    int64_t total_count;
-    /** value directly from array for the current counts_index */
-    int64_t count;
-    /** sum of all of the counts up to and including the count at this index */
-    int64_t cumulative_count;
-    /** The current value based on counts_index */
-    int64_t value;
-    int64_t highest_equivalent_value;
-    int64_t lowest_equivalent_value;
-    int64_t median_equivalent_value;
-    int64_t value_iterated_from;
-    int64_t value_iterated_to;
-
-    union
-    {
-        struct hdr_iter_percentiles percentiles;
-        struct hdr_iter_recorded recorded;
-        struct hdr_iter_linear linear;
-        struct hdr_iter_log log;
-    } specifics;
-
-    bool (* _next_fp)(struct hdr_iter* iter);
-
-};
-
-/**
- * Initalises the basic iterator.
- *
- * @param itr 'This' pointer
- * @param h The histogram to iterate over
- */
-void hdr_iter_init(struct hdr_iter* iter, const struct hdr_histogram* h);
-
-/**
- * Initialise the iterator for use with percentiles.
- */
-void hdr_iter_percentile_init(struct hdr_iter* iter, const struct hdr_histogram* h, int32_t ticks_per_half_distance);
-
-/**
- * Initialise the iterator for use with recorded values.
- */
-void hdr_iter_recorded_init(struct hdr_iter* iter, const struct hdr_histogram* h);
-
-/**
- * Initialise the iterator for use with linear values.
- */
-void hdr_iter_linear_init(
-    struct hdr_iter* iter,
-    const struct hdr_histogram* h,
-    int64_t value_units_per_bucket);
-
-/**
- * Update the iterator value units per bucket
- */
-void hdr_iter_linear_set_value_units_per_bucket(struct hdr_iter* iter, int64_t value_units_per_bucket);
-
-/**
- * Initialise the iterator for use with logarithmic values
- */
-void hdr_iter_log_init(
-    struct hdr_iter* iter,
-    const struct hdr_histogram* h,
-    int64_t value_units_first_bucket,
-    double log_base);
-
-/**
- * Iterate to the next value for the iterator.  If there are no more values
- * available return faluse.
- *
- * @param itr 'This' pointer
- * @return 'false' if there are no values remaining for this iterator.
- */
-bool hdr_iter_next(struct hdr_iter* iter);
-
-typedef enum
-{
-    CLASSIC,
-    CSV
-} format_type;
-
-/**
- * Print out a percentile based histogram to the supplied stream.  Note that
- * this call will not flush the FILE, this is left up to the user.
- *
- * @param h 'This' pointer
- * @param stream The FILE to write the output to
- * @param ticks_per_half_distance The number of iteration steps per half-distance to 100%
- * @param value_scale Scale the output values by this amount
- * @param format_type Format to use, e.g. CSV.
- * @return 0 on success, error code on failure.  EIO if an error occurs writing
- * the output.
- */
-int hdr_percentiles_print(
-    struct hdr_histogram* h, FILE* stream, int32_t ticks_per_half_distance,
-    double value_scale, format_type format);
-
-/**
-* Internal allocation methods, used by hdr_dbl_histogram.
-*/
-struct hdr_histogram_bucket_config
-{
-    int64_t lowest_trackable_value;
-    int64_t highest_trackable_value;
-    int64_t unit_magnitude;
-    int64_t significant_figures;
-    int32_t sub_bucket_half_count_magnitude;
-    int32_t sub_bucket_half_count;
-    int64_t sub_bucket_mask;
-    int32_t sub_bucket_count;
-    int32_t bucket_count;
-    int32_t counts_len;
-};
-
-int hdr_calculate_bucket_config(
-    int64_t lowest_trackable_value,
-    int64_t highest_trackable_value,
-    int significant_figures,
-    struct hdr_histogram_bucket_config* cfg);
-
-void hdr_init_preallocated(struct hdr_histogram* h, struct hdr_histogram_bucket_config* cfg);
-
-int64_t hdr_size_of_equivalent_value_range(const struct hdr_histogram* h, int64_t value);
-
-int64_t hdr_next_non_equivalent_value(const struct hdr_histogram* h, int64_t value);
-
-int64_t hdr_median_equivalent_value(const struct hdr_histogram* h, int64_t value);
-
-/**
- * Used to reset counters after importing data manuallying into the histogram, used by the logging code
- * and other custom serialisation tools.
- */
-void hdr_reset_internal_counters(struct hdr_histogram* h);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/redis-stable/deps/hiredis/.gitignore b/redis-stable/deps/hiredis/.gitignore
deleted file mode 100644
index 056959ff..00000000
--- a/redis-stable/deps/hiredis/.gitignore
+++ /dev/null
@@ -1,9 +0,0 @@
-/hiredis-test
-/examples/hiredis-example*
-/*.o
-/*.so
-/*.dylib
-/*.a
-/*.pc
-*.dSYM
-tags
diff --git a/redis-stable/deps/hiredis/.travis.yml b/redis-stable/deps/hiredis/.travis.yml
deleted file mode 100644
index f9a9460f..00000000
--- a/redis-stable/deps/hiredis/.travis.yml
+++ /dev/null
@@ -1,131 +0,0 @@
-language: c
-compiler:
-  - gcc
-  - clang
-
-os:
-  - linux
-  - osx
-
-dist: bionic
-
-branches:
-  only:
-    - staging
-    - trying
-    - master
-    - /^release\/.*$/
-
-install:
-    - if [ "$BITS" == "64" ]; then
-        wget https://github.com/redis/redis/archive/6.0.6.tar.gz;
-        tar -xzvf 6.0.6.tar.gz;
-        pushd redis-6.0.6 && BUILD_TLS=yes make && export PATH=$PWD/src:$PATH && popd;
-      fi
-
-before_script:
-    - if [ "$TRAVIS_OS_NAME" == "osx" ]; then
-        curl -O https://distfiles.macports.org/MacPorts/MacPorts-2.6.2-10.13-HighSierra.pkg;
-        sudo installer -pkg MacPorts-2.6.2-10.13-HighSierra.pkg -target /;
-        export PATH=$PATH:/opt/local/bin && sudo port -v selfupdate;
-        sudo port -N install openssl redis;
-      fi;
-
-addons:
-  apt:
-    sources:
-    - sourceline: 'ppa:chris-lea/redis-server'
-    packages:
-    - libc6-dbg
-    - libc6-dev
-    - libc6:i386
-    - libc6-dev-i386
-    - libc6-dbg:i386
-    - gcc-multilib
-    - g++-multilib
-    - libssl-dev
-    - libssl-dev:i386
-    - valgrind
-    - redis
-
-env:
-  - BITS="32"
-  - BITS="64"
-
-script:
-  - EXTRA_CMAKE_OPTS="-DENABLE_EXAMPLES:BOOL=ON -DENABLE_SSL:BOOL=ON";
-    if [ "$BITS" == "64" ]; then
-      EXTRA_CMAKE_OPTS="$EXTRA_CMAKE_OPTS -DENABLE_SSL_TESTS:BOOL=ON";
-    fi;
-    if [ "$TRAVIS_OS_NAME" == "osx" ]; then
-      if [ "$BITS" == "32" ]; then
-        CFLAGS="-m32 -Werror";
-        CXXFLAGS="-m32 -Werror";
-        LDFLAGS="-m32";
-        EXTRA_CMAKE_OPTS=;
-      else
-        CFLAGS="-Werror";
-        CXXFLAGS="-Werror";
-      fi;
-    else
-      TEST_PREFIX="valgrind --track-origins=yes --leak-check=full";
-      if [ "$BITS" == "32" ]; then
-        CFLAGS="-m32 -Werror";
-        CXXFLAGS="-m32 -Werror";
-        LDFLAGS="-m32";
-        EXTRA_CMAKE_OPTS=;
-      else
-        CFLAGS="-Werror";
-        CXXFLAGS="-Werror";
-      fi;
-    fi;
-    export CFLAGS CXXFLAGS LDFLAGS TEST_PREFIX EXTRA_CMAKE_OPTS
-  - make && make clean;
-    if [ "$TRAVIS_OS_NAME" == "osx" ]; then
-      if [ "$BITS" == "64" ]; then
-        OPENSSL_PREFIX="$(ls -d /usr/local/Cellar/openssl@1.1/*)" USE_SSL=1 make;
-      fi;
-    else
-      USE_SSL=1 make;
-    fi;
-  - mkdir build/ && cd build/
-  - cmake .. ${EXTRA_CMAKE_OPTS}
-  - make VERBOSE=1
-  - if [ "$BITS" == "64" ]; then
-      TEST_SSL=1 SKIPS_AS_FAILS=1 ctest -V;
-    else
-      SKIPS_AS_FAILS=1 ctest -V;
-    fi;
-
-jobs:
-  include:
-    # Windows MinGW cross compile on Linux
-    - os: linux
-      dist: xenial
-      compiler: mingw
-      addons:
-        apt:
-          packages:
-            - ninja-build
-            - gcc-mingw-w64-x86-64
-            - g++-mingw-w64-x86-64
-      script:
-        - mkdir build && cd build
-        - CC=x86_64-w64-mingw32-gcc CXX=x86_64-w64-mingw32-g++ cmake .. -G Ninja -DCMAKE_BUILD_TYPE=Release -DCMAKE_BUILD_WITH_INSTALL_RPATH=on
-        - ninja -v
-
-    # Windows MSVC 2017
-    - os: windows
-      compiler: msvc
-      env:
-        - MATRIX_EVAL="CC=cl.exe && CXX=cl.exe"
-      before_install:
-        - eval "${MATRIX_EVAL}"
-      install:
-        - choco install ninja
-        - choco install -y memurai-developer
-      script:
-        - mkdir build && cd build
-        - cmd.exe //C 'C:\Program Files (x86)\Microsoft Visual Studio\2017\BuildTools\VC\Auxiliary\Build\vcvarsall.bat' amd64 '&&'
-          cmake .. -G Ninja -DCMAKE_BUILD_TYPE=Release -DENABLE_EXAMPLES=ON '&&' ninja -v
-        - ./hiredis-test.exe
diff --git a/redis-stable/deps/hiredis/CHANGELOG.md b/redis-stable/deps/hiredis/CHANGELOG.md
deleted file mode 100644
index 271f1fcf..00000000
--- a/redis-stable/deps/hiredis/CHANGELOG.md
+++ /dev/null
@@ -1,345 +0,0 @@
-## [1.0.0](https://github.com/redis/hiredis/tree/v1.0.0) - (2020-08-03)
-
-Announcing Hiredis v1.0.0, which adds support for RESP3, SSL connections, allocator injection, and better Windows support! :tada:
-
-_A big thanks to everyone who helped with this release.  The following list includes everyone who contributed at least five lines, sorted by lines contributed._ :sparkling_heart:
-
-[Michael Grunder](https://github.com/michael-grunder), [Yossi Gottlieb](https://github.com/yossigo),
-[Mark Nunberg](https://github.com/mnunberg), [Marcus Geelnard](https://github.com/mbitsnbites),
-[Justin Brewer](https://github.com/justinbrewer), [Valentino Geron](https://github.com/valentinogeron),
-[Minun Dragonation](https://github.com/dragonation), [Omri Steiner](https://github.com/OmriSteiner),
-[Sangmoon Yi](https://github.com/jman-krafton), [Jinjiazh](https://github.com/jinjiazhang),
-[Odin Hultgren Van Der Horst](https://github.com/Miniwoffer), [Muhammad Zahalqa](https://github.com/tryfinally),
-[Nick Rivera](https://github.com/heronr), [Qi Yang](https://github.com/movebean),
-[kevin1018](https://github.com/kevin1018)
-
-[Full Changelog](https://github.com/redis/hiredis/compare/v0.14.1...v1.0.0)
-
-**BREAKING CHANGES**:
-
-* `redisOptions` now has two timeout fields.  One for connecting, and one for commands.  If you're presently using `options->timeout` you will need to change it to use `options->connect_timeout`. (See [example](https://github.com/redis/hiredis/commit/38b5ae543f5c99eb4ccabbe277770fc6bc81226f#diff-86ba39d37aa829c8c82624cce4f049fbL36))
-
-* Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now protocol errors. This is consistent
-  with the RESP specification. On 32-bit platforms, the upper bound is lowered to `SIZE_MAX`.
-
-* `redisReplyObjectFunctions.createArray` now takes `size_t` for its length parameter.
-
-**New features:**
-- Support for RESP3
-  [\#697](https://github.com/redis/hiredis/pull/697),
-  [\#805](https://github.com/redis/hiredis/pull/805),
-  [\#819](https://github.com/redis/hiredis/pull/819),
-  [\#841](https://github.com/redis/hiredis/pull/841)
-  ([Yossi Gottlieb](https://github.com/yossigo), [Michael Grunder](https://github.com/michael-grunder))
-- Support for SSL connections
-  [\#645](https://github.com/redis/hiredis/pull/645),
-  [\#699](https://github.com/redis/hiredis/pull/699),
-  [\#702](https://github.com/redis/hiredis/pull/702),
-  [\#708](https://github.com/redis/hiredis/pull/708),
-  [\#711](https://github.com/redis/hiredis/pull/711),
-  [\#821](https://github.com/redis/hiredis/pull/821),
-  [more](https://github.com/redis/hiredis/pulls?q=is%3Apr+is%3Amerged+SSL)
-  ([Mark Nunberg](https://github.com/mnunberg), [Yossi Gottlieb](https://github.com/yossigo))
-- Run-time allocator injection
-  [\#800](https://github.com/redis/hiredis/pull/800)
-  ([Michael Grunder](https://github.com/michael-grunder))
-- Improved Windows support (including MinGW and Windows CI)
-  [\#652](https://github.com/redis/hiredis/pull/652),
-  [\#663](https://github.com/redis/hiredis/pull/663)
-  ([Marcus Geelnard](https://www.bitsnbites.eu/author/m/))
-- Adds support for distinct connect and command timeouts
-  [\#839](https://github.com/redis/hiredis/pull/839),
-  [\#829](https://github.com/redis/hiredis/pull/829)
-  ([Valentino Geron](https://github.com/valentinogeron))
-- Add generic pointer and destructor to `redisContext` that users can use for context.
-  [\#855](https://github.com/redis/hiredis/pull/855)
-  ([Michael Grunder](https://github.com/michael-grunder))
-
-**Closed issues (that involved code changes):**
-
-- Makefile does not install TLS libraries  [\#809](https://github.com/redis/hiredis/issues/809)
-- redisConnectWithOptions should not set command timeout [\#722](https://github.com/redis/hiredis/issues/722), [\#829](https://github.com/redis/hiredis/pull/829) ([valentinogeron](https://github.com/valentinogeron))
-- Fix integer overflow in `sdsrange` [\#827](https://github.com/redis/hiredis/issues/827)
-- INFO & CLUSTER commands failed when using RESP3 [\#802](https://github.com/redis/hiredis/issues/802)
-- Windows compatibility patches [\#687](https://github.com/redis/hiredis/issues/687), [\#838](https://github.com/redis/hiredis/issues/838), [\#842](https://github.com/redis/hiredis/issues/842)
-- RESP3 PUSH messages incorrectly use pending callback [\#825](https://github.com/redis/hiredis/issues/825)
-- Asynchronous PSUBSCRIBE command fails when using RESP3 [\#815](https://github.com/redis/hiredis/issues/815)
-- New SSL API [\#804](https://github.com/redis/hiredis/issues/804), [\#813](https://github.com/redis/hiredis/issues/813)
-- Hard-coded limit of nested reply depth [\#794](https://github.com/redis/hiredis/issues/794)
-- Fix TCP_NODELAY in Windows/OSX [\#679](https://github.com/redis/hiredis/issues/679), [\#690](https://github.com/redis/hiredis/issues/690), [\#779](https://github.com/redis/hiredis/issues/779), [\#785](https://github.com/redis/hiredis/issues/785),
-- Added timers to libev adapter.  [\#778](https://github.com/redis/hiredis/issues/778), [\#795](https://github.com/redis/hiredis/pull/795)
-- Initialization discards const qualifier [\#777](https://github.com/redis/hiredis/issues/777)
-- \[BUG\]\[MinGW64\] Error setting socket timeout  [\#775](https://github.com/redis/hiredis/issues/775)
-- undefined reference to hi_malloc [\#769](https://github.com/redis/hiredis/issues/769)
-- hiredis pkg-config file incorrectly ignores multiarch libdir spec'n [\#767](https://github.com/redis/hiredis/issues/767)
-- Don't use -G to build shared object on Solaris [\#757](https://github.com/redis/hiredis/issues/757)
-- error when make USE\_SSL=1 [\#748](https://github.com/redis/hiredis/issues/748)
-- Allow to change SSL Mode [\#646](https://github.com/redis/hiredis/issues/646)
-- hiredis/adapters/libevent.h memleak [\#618](https://github.com/redis/hiredis/issues/618)
-- redisLibuvPoll crash when server closes the connetion [\#545](https://github.com/redis/hiredis/issues/545)
-- about redisAsyncDisconnect question [\#518](https://github.com/redis/hiredis/issues/518)
-- hiredis adapters libuv error for help [\#508](https://github.com/redis/hiredis/issues/508)
-- API/ABI changes analysis [\#506](https://github.com/redis/hiredis/issues/506)
-- Memory leak patch in Redis [\#502](https://github.com/redis/hiredis/issues/502)
-- Remove the depth limitation [\#421](https://github.com/redis/hiredis/issues/421)
-
-**Merged pull requests:**
-
-- Move SSL management to a distinct private pointer [\#855](https://github.com/redis/hiredis/pull/855) ([michael-grunder](https://github.com/michael-grunder))
-- Move include to sockcompat.h to maintain style [\#850](https://github.com/redis/hiredis/pull/850) ([michael-grunder](https://github.com/michael-grunder))
-- Remove erroneous tag and add license to push example [\#849](https://github.com/redis/hiredis/pull/849) ([michael-grunder](https://github.com/michael-grunder))
-- fix windows compiling with mingw [\#848](https://github.com/redis/hiredis/pull/848) ([rmalizia44](https://github.com/rmalizia44))
-- Some Windows quality of life improvements. [\#846](https://github.com/redis/hiredis/pull/846) ([michael-grunder](https://github.com/michael-grunder))
-- Use \_WIN32 define instead of WIN32 [\#845](https://github.com/redis/hiredis/pull/845) ([michael-grunder](https://github.com/michael-grunder))
-- Non Linux CI fixes [\#844](https://github.com/redis/hiredis/pull/844) ([michael-grunder](https://github.com/michael-grunder))
-- Resp3 oob push support [\#841](https://github.com/redis/hiredis/pull/841) ([michael-grunder](https://github.com/michael-grunder))
-- fix \#785: defer TCP\_NODELAY in async tcp connections [\#836](https://github.com/redis/hiredis/pull/836) ([OmriSteiner](https://github.com/OmriSteiner))
-- sdsrange overflow fix [\#830](https://github.com/redis/hiredis/pull/830) ([michael-grunder](https://github.com/michael-grunder))
-- Use explicit pointer casting for c++ compatibility [\#826](https://github.com/redis/hiredis/pull/826) ([aureus1](https://github.com/aureus1))
-- Document allocator injection and completeness fix in test.c [\#824](https://github.com/redis/hiredis/pull/824) ([michael-grunder](https://github.com/michael-grunder))
-- Use unique names for allocator struct members [\#823](https://github.com/redis/hiredis/pull/823) ([michael-grunder](https://github.com/michael-grunder))
-- New SSL API to replace redisSecureConnection\(\). [\#821](https://github.com/redis/hiredis/pull/821) ([yossigo](https://github.com/yossigo))
-- Add logic to handle RESP3 push messages [\#819](https://github.com/redis/hiredis/pull/819) ([michael-grunder](https://github.com/michael-grunder))
-- Use standrad isxdigit instead of custom helper function. [\#814](https://github.com/redis/hiredis/pull/814) ([tryfinally](https://github.com/tryfinally))
-- Fix missing SSL build/install options. [\#812](https://github.com/redis/hiredis/pull/812) ([yossigo](https://github.com/yossigo))
-- Add link to ABI tracker [\#808](https://github.com/redis/hiredis/pull/808) ([michael-grunder](https://github.com/michael-grunder))
-- Resp3 verbatim string support [\#805](https://github.com/redis/hiredis/pull/805) ([michael-grunder](https://github.com/michael-grunder))
-- Allow users to replace allocator and handle OOM everywhere. [\#800](https://github.com/redis/hiredis/pull/800) ([michael-grunder](https://github.com/michael-grunder))
-- Remove nested depth limitation. [\#797](https://github.com/redis/hiredis/pull/797) ([michael-grunder](https://github.com/michael-grunder))
-- Attempt to fix compilation on Solaris [\#796](https://github.com/redis/hiredis/pull/796) ([michael-grunder](https://github.com/michael-grunder))
-- Support timeouts in libev adapater [\#795](https://github.com/redis/hiredis/pull/795) ([michael-grunder](https://github.com/michael-grunder))
-- Fix pkgconfig when installing to a custom lib dir [\#793](https://github.com/redis/hiredis/pull/793) ([michael-grunder](https://github.com/michael-grunder))
-- Fix USE\_SSL=1 make/cmake on OSX and CMake tests [\#789](https://github.com/redis/hiredis/pull/789) ([michael-grunder](https://github.com/michael-grunder))
-- Use correct libuv call on Windows [\#784](https://github.com/redis/hiredis/pull/784) ([michael-grunder](https://github.com/michael-grunder))
-- Added CMake package config and fixed hiredis\_ssl on Windows [\#783](https://github.com/redis/hiredis/pull/783) ([michael-grunder](https://github.com/michael-grunder))
-- CMake: Set hiredis\_ssl shared object version. [\#780](https://github.com/redis/hiredis/pull/780) ([yossigo](https://github.com/yossigo))
-- Win32 tests and timeout fix [\#776](https://github.com/redis/hiredis/pull/776) ([michael-grunder](https://github.com/michael-grunder))
-- Provides an optional cleanup callback for async data. [\#768](https://github.com/redis/hiredis/pull/768) ([heronr](https://github.com/heronr))
-- Housekeeping fixes [\#764](https://github.com/redis/hiredis/pull/764) ([michael-grunder](https://github.com/michael-grunder))
-- install alloc.h [\#756](https://github.com/redis/hiredis/pull/756) ([ch1aki](https://github.com/ch1aki))
-- fix spelling mistakes [\#746](https://github.com/redis/hiredis/pull/746) ([ShooterIT](https://github.com/ShooterIT))
-- Free the reply in redisGetReply when passed NULL [\#741](https://github.com/redis/hiredis/pull/741) ([michael-grunder](https://github.com/michael-grunder))
-- Fix dead code in sslLogCallback relating to should\_log variable. [\#737](https://github.com/redis/hiredis/pull/737) ([natoscott](https://github.com/natoscott))
-- Fix typo in dict.c. [\#731](https://github.com/redis/hiredis/pull/731) ([Kevin-Xi](https://github.com/Kevin-Xi))
-- Adding an option to DISABLE\_TESTS [\#727](https://github.com/redis/hiredis/pull/727) ([pbotros](https://github.com/pbotros))
-- Update README with SSL support. [\#720](https://github.com/redis/hiredis/pull/720) ([yossigo](https://github.com/yossigo))
-- Fixes leaks in unit tests [\#715](https://github.com/redis/hiredis/pull/715) ([michael-grunder](https://github.com/michael-grunder))
-- SSL Tests [\#711](https://github.com/redis/hiredis/pull/711) ([yossigo](https://github.com/yossigo))
-- SSL Reorganization [\#708](https://github.com/redis/hiredis/pull/708) ([yossigo](https://github.com/yossigo))
-- Fix MSVC build. [\#706](https://github.com/redis/hiredis/pull/706) ([yossigo](https://github.com/yossigo))
-- SSL: Properly report SSL\_connect\(\) errors. [\#702](https://github.com/redis/hiredis/pull/702) ([yossigo](https://github.com/yossigo))
-- Silent SSL trace to stdout by default. [\#699](https://github.com/redis/hiredis/pull/699) ([yossigo](https://github.com/yossigo))
-- Port RESP3 support from Redis. [\#697](https://github.com/redis/hiredis/pull/697) ([yossigo](https://github.com/yossigo))
-- Removed whitespace before newline [\#691](https://github.com/redis/hiredis/pull/691) ([Miniwoffer](https://github.com/Miniwoffer))
-- Add install adapters header files [\#688](https://github.com/redis/hiredis/pull/688) ([kevin1018](https://github.com/kevin1018))
-- Remove unnecessary null check before free [\#684](https://github.com/redis/hiredis/pull/684) ([qlyoung](https://github.com/qlyoung))
-- redisReaderGetReply leak memory [\#671](https://github.com/redis/hiredis/pull/671) ([movebean](https://github.com/movebean))
-- fix timeout code in windows [\#670](https://github.com/redis/hiredis/pull/670) ([jman-krafton](https://github.com/jman-krafton))
-- test: fix errstr matching for musl libc [\#665](https://github.com/redis/hiredis/pull/665) ([ghost](https://github.com/ghost))
-- Windows: MinGW fixes and Windows Travis builders [\#663](https://github.com/redis/hiredis/pull/663) ([mbitsnbites](https://github.com/mbitsnbites))
-- The setsockopt and getsockopt API diffs from BSD socket and WSA one [\#662](https://github.com/redis/hiredis/pull/662) ([dragonation](https://github.com/dragonation))
-- Fix Compile Error On Windows \(Visual Studio\) [\#658](https://github.com/redis/hiredis/pull/658) ([jinjiazhang](https://github.com/jinjiazhang))
-- Fix NXDOMAIN test case [\#653](https://github.com/redis/hiredis/pull/653) ([michael-grunder](https://github.com/michael-grunder))
-- Add MinGW support [\#652](https://github.com/redis/hiredis/pull/652) ([mbitsnbites](https://github.com/mbitsnbites))
-- SSL Support [\#645](https://github.com/redis/hiredis/pull/645) ([mnunberg](https://github.com/mnunberg))
-- Fix Invalid argument after redisAsyncConnectUnix [\#644](https://github.com/redis/hiredis/pull/644) ([codehz](https://github.com/codehz))
-- Makefile: use predefined AR [\#632](https://github.com/redis/hiredis/pull/632) ([Mic92](https://github.com/Mic92))
-- FreeBSD  build fix [\#628](https://github.com/redis/hiredis/pull/628) ([devnexen](https://github.com/devnexen))
-- Fix errors not propagating properly with libuv.h. [\#624](https://github.com/redis/hiredis/pull/624) ([yossigo](https://github.com/yossigo))
-- Update README.md [\#621](https://github.com/redis/hiredis/pull/621) ([Crunsher](https://github.com/Crunsher))
-- Fix redisBufferRead documentation [\#620](https://github.com/redis/hiredis/pull/620) ([hacst](https://github.com/hacst))
-- Add CPPFLAGS to REAL\_CFLAGS [\#614](https://github.com/redis/hiredis/pull/614) ([thomaslee](https://github.com/thomaslee))
-- Update createArray to take size\_t [\#597](https://github.com/redis/hiredis/pull/597) ([justinbrewer](https://github.com/justinbrewer))
-- fix common realloc mistake and add null check more [\#580](https://github.com/redis/hiredis/pull/580) ([charsyam](https://github.com/charsyam))
-- Proper error reporting for connect failures [\#578](https://github.com/redis/hiredis/pull/578) ([mnunberg](https://github.com/mnunberg))
-
-\* *This Changelog was automatically generated by [github_changelog_generator](https://github.com/github-changelog-generator/github-changelog-generator)*
-
-## [1.0.0-rc1](https://github.com/redis/hiredis/tree/v1.0.0-rc1) - (2020-07-29)
-
-_Note:  There were no changes to code between v1.0.0-rc1 and v1.0.0 so see v1.0.0 for changelog_
-
-### 0.14.1 (2020-03-13)
-
-* Adds safe allocation wrappers (CVE-2020-7105, #747, #752) (Michael Grunder)
-
-### 0.14.0 (2018-09-25)
-**BREAKING CHANGES**:
-
-* Change `redisReply.len` to `size_t`, as it denotes the the size of a string
-
-  User code should compare this to `size_t` values as well.
-  If it was used to compare to other values, casting might be necessary or can be removed, if casting was applied before.
-
-* Make string2ll static to fix conflict with Redis (Tom Lee [c3188b])
-* Use -dynamiclib instead of -shared for OSX (Ryan Schmidt [a65537])
-* Use string2ll from Redis w/added tests (Michael Grunder [7bef04, 60f622])
-* Makefile - OSX compilation fixes (Ryan Schmidt [881fcb, 0e9af8])
-* Remove redundant NULL checks (Justin Brewer [54acc8, 58e6b8])
-* Fix bulk and multi-bulk length truncation (Justin Brewer [109197])
-* Fix SIGSEGV in OpenBSD by checking for NULL before calling freeaddrinfo (Justin Brewer [546d94])
-* Several POSIX compatibility fixes (Justin Brewer [bbeab8, 49bbaa, d1c1b6])
-* Makefile - Compatibility fixes (Dimitri Vorobiev [3238cf, 12a9d1])
-* Makefile - Fix make install on FreeBSD (Zach Shipko [a2ef2b])
-* Makefile - don't assume $(INSTALL) is cp (Igor Gnatenko [725a96])
-* Separate side-effect causing function from assert and small cleanup (amallia [b46413, 3c3234])
-* Don't send negative values to `__redisAsyncCommand` (Frederik Deweerdt [706129])
-* Fix leak if setsockopt fails (Frederik Deweerdt [e21c9c])
-* Fix libevent leak (zfz [515228])
-* Clean up GCC warning (Ichito Nagata [2ec774])
-* Keep track of errno in `__redisSetErrorFromErrno()` as snprintf may use it (Jin Qing [25cd88])
-* Solaris compilation fix (Donald Whyte [41b07d])
-* Reorder linker arguments when building examples (Tustfarm-heart [06eedd])
-* Keep track of subscriptions in case of rapid subscribe/unsubscribe (Hyungjin Kim [073dc8, be76c5, d46999])
-* libuv use after free fix (Paul Scott [cbb956])
-* Properly close socket fd on reconnect attempt (WSL [64d1ec])
-* Skip valgrind in OSX tests (Jan-Erik Rediger [9deb78])
-* Various updates for Travis testing OSX (Ted Nyman [fa3774, 16a459, bc0ea5])
-* Update libevent (Chris Xin [386802])
-* Change sds.h for building in C++ projects (Ali Volkan ATLI [f5b32e])
-* Use proper format specifier in redisFormatSdsCommandArgv (Paulino Huerta, Jan-Erik Rediger [360a06, 8655a6])
-* Better handling of NULL reply in example code (Jan-Erik Rediger [1b8ed3])
-* Prevent overflow when formatting an error (Jan-Erik Rediger [0335cb])
-* Compatibility fix for strerror_r (Tom Lee [bb1747])
-* Properly detect integer parse/overflow errors (Justin Brewer [93421f])
-* Adds CI for Windows and cygwin fixes (owent, [6c53d6, 6c3e40])
-* Catch a buffer overflow when formatting the error message
-* Import latest upstream sds. This breaks applications that are linked against the old hiredis v0.13
-* Fix warnings, when compiled with -Wshadow
-* Make hiredis compile in Cygwin on Windows, now CI-tested
-* Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now
-  protocol errors. This is consistent with the RESP specification. On 32-bit
-  platforms, the upper bound is lowered to `SIZE_MAX`.
-
-* Remove backwards compatibility macro's
-
-This removes the following old function aliases, use the new name now:
-
-| Old                         | New                    |
-| --------------------------- | ---------------------- |
-| redisReplyReaderCreate      | redisReaderCreate      |
-| redisReplyReaderCreate      | redisReaderCreate      |
-| redisReplyReaderFree        | redisReaderFree        |
-| redisReplyReaderFeed        | redisReaderFeed        |
-| redisReplyReaderGetReply    | redisReaderGetReply    |
-| redisReplyReaderSetPrivdata | redisReaderSetPrivdata |
-| redisReplyReaderGetObject   | redisReaderGetObject   |
-| redisReplyReaderGetError    | redisReaderGetError    |
-
-* The `DEBUG` variable in the Makefile was renamed to `DEBUG_FLAGS`
-
-Previously it broke some builds for people that had `DEBUG` set to some arbitrary value,
-due to debugging other software.
-By renaming we avoid unintentional name clashes.
-
-Simply rename `DEBUG` to `DEBUG_FLAGS` in your environment to make it working again.
-
-### 0.13.3 (2015-09-16)
-
-* Revert "Clear `REDIS_CONNECTED` flag when connection is closed".
-* Make tests pass on FreeBSD (Thanks, Giacomo Olgeni)
-
-
-If the `REDIS_CONNECTED` flag is cleared,
-the async onDisconnect callback function will never be called.
-This causes problems as the disconnect is never reported back to the user.
-
-### 0.13.2 (2015-08-25)
-
-* Prevent crash on pending replies in async code (Thanks, @switch-st)
-* Clear `REDIS_CONNECTED` flag when connection is closed (Thanks, Jerry Jacobs)
-* Add MacOS X addapter (Thanks, @dizzus)
-* Add Qt adapter (Thanks, Pietro Cerutti)
-* Add Ivykis adapter (Thanks, Gergely Nagy)
-
-All adapters are provided as is and are only tested where possible.
-
-### 0.13.1 (2015-05-03)
-
-This is a bug fix release.
-The new `reconnect` method introduced new struct members, which clashed with pre-defined names in pre-C99 code.
-Another commit forced C99 compilation just to make it work, but of course this is not desirable for outside projects.
-Other non-C99 code can now use hiredis as usual again.
-Sorry for the inconvenience.
-
-* Fix memory leak in async reply handling (Salvatore Sanfilippo)
-* Rename struct member to avoid name clash with pre-c99 code (Alex Balashov, ncopa)
-
-### 0.13.0 (2015-04-16)
-
-This release adds a minimal Windows compatibility layer.
-The parser, standalone since v0.12.0, can now be compiled on Windows
-(and thus used in other client libraries as well)
-
-* Windows compatibility layer for parser code (tzickel)
-* Properly escape data printed to PKGCONF file (Dan Skorupski)
-* Fix tests when assert() undefined (Keith Bennett, Matt Stancliff)
-* Implement a reconnect method for the client context, this changes the structure of `redisContext` (Aaron Bedra)
-
-### 0.12.1 (2015-01-26)
-
-* Fix `make install`: DESTDIR support, install all required files, install PKGCONF in proper location
-* Fix `make test` as 32 bit build on 64 bit platform
-
-### 0.12.0 (2015-01-22)
-
-* Add optional KeepAlive support
-
-* Try again on EINTR errors
-
-* Add libuv adapter
-
-* Add IPv6 support
-
-* Remove possibility of multiple close on same fd
-
-* Add ability to bind source address on connect
-
-* Add redisConnectFd() and redisFreeKeepFd()
-
-* Fix getaddrinfo() memory leak
-
-* Free string if it is unused (fixes memory leak)
-
-* Improve redisAppendCommandArgv performance 2.5x
-
-* Add support for SO_REUSEADDR
-
-* Fix redisvFormatCommand format parsing
-
-* Add GLib 2.0 adapter
-
-* Refactor reading code into read.c
-
-* Fix errno error buffers to not clobber errors
-
-* Generate pkgconf during build
-
-* Silence _BSD_SOURCE warnings
-
-* Improve digit counting for multibulk creation
-
-
-### 0.11.0
-
-* Increase the maximum multi-bulk reply depth to 7.
-
-* Increase the read buffer size from 2k to 16k.
-
-* Use poll(2) instead of select(2) to support large fds (>= 1024).
-
-### 0.10.1
-
-* Makefile overhaul. Important to check out if you override one or more
-  variables using environment variables or via arguments to the "make" tool.
-
-* Issue #45: Fix potential memory leak for a multi bulk reply with 0 elements
-  being created by the default reply object functions.
-
-* Issue #43: Don't crash in an asynchronous context when Redis returns an error
-  reply after the connection has been made (this happens when the maximum
-  number of connections is reached).
-
-### 0.10.0
-
-* See commit log.
diff --git a/redis-stable/deps/hiredis/CMakeLists.txt b/redis-stable/deps/hiredis/CMakeLists.txt
deleted file mode 100644
index f86c9b70..00000000
--- a/redis-stable/deps/hiredis/CMakeLists.txt
+++ /dev/null
@@ -1,165 +0,0 @@
-CMAKE_MINIMUM_REQUIRED(VERSION 3.4.0)
-INCLUDE(GNUInstallDirs)
-PROJECT(hiredis)
-
-OPTION(ENABLE_SSL "Build hiredis_ssl for SSL support" OFF)
-OPTION(DISABLE_TESTS "If tests should be compiled or not" OFF)
-OPTION(ENABLE_SSL_TESTS, "Should we test SSL connections" OFF)
-
-MACRO(getVersionBit name)
-  SET(VERSION_REGEX "^#define ${name} (.+)$")
-  FILE(STRINGS "${CMAKE_CURRENT_SOURCE_DIR}/hiredis.h"
-    VERSION_BIT REGEX ${VERSION_REGEX})
-  STRING(REGEX REPLACE ${VERSION_REGEX} "\\1" ${name} "${VERSION_BIT}")
-ENDMACRO(getVersionBit)
-
-getVersionBit(HIREDIS_MAJOR)
-getVersionBit(HIREDIS_MINOR)
-getVersionBit(HIREDIS_PATCH)
-getVersionBit(HIREDIS_SONAME)
-SET(VERSION "${HIREDIS_MAJOR}.${HIREDIS_MINOR}.${HIREDIS_PATCH}")
-MESSAGE("Detected version: ${VERSION}")
-
-PROJECT(hiredis VERSION "${VERSION}")
-
-SET(ENABLE_EXAMPLES OFF CACHE BOOL "Enable building hiredis examples")
-
-SET(hiredis_sources
-    alloc.c
-    async.c
-    dict.c
-    hiredis.c
-    net.c
-    read.c
-    sds.c
-    sockcompat.c)
-
-SET(hiredis_sources ${hiredis_sources})
-
-IF(WIN32)
-    ADD_COMPILE_DEFINITIONS(_CRT_SECURE_NO_WARNINGS WIN32_LEAN_AND_MEAN)
-ENDIF()
-
-ADD_LIBRARY(hiredis SHARED ${hiredis_sources})
-
-SET_TARGET_PROPERTIES(hiredis
-    PROPERTIES WINDOWS_EXPORT_ALL_SYMBOLS TRUE
-    VERSION "${HIREDIS_SONAME}")
-IF(WIN32 OR MINGW)
-    TARGET_LINK_LIBRARIES(hiredis PRIVATE ws2_32)
-ENDIF()
-
-TARGET_INCLUDE_DIRECTORIES(hiredis PUBLIC $<INSTALL_INTERFACE:.> $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
-
-CONFIGURE_FILE(hiredis.pc.in hiredis.pc @ONLY)
-
-INSTALL(TARGETS hiredis
-    EXPORT hiredis-targets
-    RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
-    LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
-    ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR})
-
-INSTALL(FILES hiredis.h read.h sds.h async.h alloc.h
-    DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
-    
-INSTALL(DIRECTORY adapters
-    DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
-    
-INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis.pc
-    DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig)
-
-export(EXPORT hiredis-targets
-    FILE "${CMAKE_CURRENT_BINARY_DIR}/hiredis-targets.cmake"
-    NAMESPACE hiredis::)
-
-SET(CMAKE_CONF_INSTALL_DIR share/hiredis)
-SET(INCLUDE_INSTALL_DIR include)
-include(CMakePackageConfigHelpers)
-configure_package_config_file(hiredis-config.cmake.in ${CMAKE_CURRENT_BINARY_DIR}/hiredis-config.cmake
-                              INSTALL_DESTINATION ${CMAKE_CONF_INSTALL_DIR}
-                              PATH_VARS INCLUDE_INSTALL_DIR)
-
-INSTALL(EXPORT hiredis-targets
-        FILE hiredis-targets.cmake
-        NAMESPACE hiredis::
-        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
-
-INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis-config.cmake
-        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
-
-
-IF(ENABLE_SSL)
-    IF (NOT OPENSSL_ROOT_DIR)
-        IF (APPLE)
-            SET(OPENSSL_ROOT_DIR "/usr/local/opt/openssl")
-        ENDIF()
-    ENDIF()
-    FIND_PACKAGE(OpenSSL REQUIRED)
-    SET(hiredis_ssl_sources 
-        ssl.c)
-    ADD_LIBRARY(hiredis_ssl SHARED
-            ${hiredis_ssl_sources})
-
-    IF (APPLE)
-        SET_PROPERTY(TARGET hiredis_ssl PROPERTY LINK_FLAGS "-Wl,-undefined -Wl,dynamic_lookup")
-    ENDIF()
-
-    SET_TARGET_PROPERTIES(hiredis_ssl
-        PROPERTIES
-        WINDOWS_EXPORT_ALL_SYMBOLS TRUE
-        VERSION "${HIREDIS_SONAME}")
-
-    TARGET_INCLUDE_DIRECTORIES(hiredis_ssl PRIVATE "${OPENSSL_INCLUDE_DIR}")
-    TARGET_LINK_LIBRARIES(hiredis_ssl PRIVATE ${OPENSSL_LIBRARIES})
-    IF (WIN32 OR MINGW)
-        TARGET_LINK_LIBRARIES(hiredis_ssl PRIVATE hiredis)
-    ENDIF()
-    CONFIGURE_FILE(hiredis_ssl.pc.in hiredis_ssl.pc @ONLY)
-
-    INSTALL(TARGETS hiredis_ssl
-        EXPORT hiredis_ssl-targets
-        RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
-        LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
-        ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR})
-
-    INSTALL(FILES hiredis_ssl.h
-        DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/hiredis)
-    
-    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl.pc
-        DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig)
-
-    export(EXPORT hiredis_ssl-targets
-           FILE "${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-targets.cmake"
-           NAMESPACE hiredis::)
-
-    SET(CMAKE_CONF_INSTALL_DIR share/hiredis_ssl)
-    configure_package_config_file(hiredis_ssl-config.cmake.in ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-config.cmake
-                                  INSTALL_DESTINATION ${CMAKE_CONF_INSTALL_DIR}
-                                  PATH_VARS INCLUDE_INSTALL_DIR)
-
-    INSTALL(EXPORT hiredis_ssl-targets
-        FILE hiredis_ssl-targets.cmake
-        NAMESPACE hiredis::
-        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
-
-    INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/hiredis_ssl-config.cmake
-        DESTINATION ${CMAKE_CONF_INSTALL_DIR})
-ENDIF()
-
-IF(NOT DISABLE_TESTS)
-    ENABLE_TESTING()
-    ADD_EXECUTABLE(hiredis-test test.c)
-    IF(ENABLE_SSL_TESTS)
-        ADD_DEFINITIONS(-DHIREDIS_TEST_SSL=1)
-        TARGET_LINK_LIBRARIES(hiredis-test hiredis hiredis_ssl)
-    ELSE()
-        TARGET_LINK_LIBRARIES(hiredis-test hiredis)
-    ENDIF()
-    ADD_TEST(NAME hiredis-test
-        COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/test.sh)
-ENDIF()
-
-# Add examples
-IF(ENABLE_EXAMPLES)
-  ADD_SUBDIRECTORY(examples)
-ENDIF(ENABLE_EXAMPLES)
diff --git a/redis-stable/deps/hiredis/COPYING b/redis-stable/deps/hiredis/COPYING
deleted file mode 100644
index a5fc9739..00000000
--- a/redis-stable/deps/hiredis/COPYING
+++ /dev/null
@@ -1,29 +0,0 @@
-Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
-Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
-
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice,
-  this list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-* Neither the name of Redis nor the names of its contributors may be used
-  to endorse or promote products derived from this software without specific
-  prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/redis-stable/deps/hiredis/Makefile b/redis-stable/deps/hiredis/Makefile
deleted file mode 100644
index 7e41c97a..00000000
--- a/redis-stable/deps/hiredis/Makefile
+++ /dev/null
@@ -1,313 +0,0 @@
-# Hiredis Makefile
-# Copyright (C) 2010-2011 Salvatore Sanfilippo <antirez at gmail dot com>
-# Copyright (C) 2010-2011 Pieter Noordhuis <pcnoordhuis at gmail dot com>
-# This file is released under the BSD license, see the COPYING file
-
-OBJ=alloc.o net.o hiredis.o sds.o async.o read.o sockcompat.o
-SSL_OBJ=ssl.o
-EXAMPLES=hiredis-example hiredis-example-libevent hiredis-example-libev hiredis-example-glib hiredis-example-push
-ifeq ($(USE_SSL),1)
-EXAMPLES+=hiredis-example-ssl hiredis-example-libevent-ssl
-endif
-TESTS=hiredis-test
-LIBNAME=libhiredis
-PKGCONFNAME=hiredis.pc
-SSL_LIBNAME=libhiredis_ssl
-SSL_PKGCONFNAME=hiredis_ssl.pc
-
-HIREDIS_MAJOR=$(shell grep HIREDIS_MAJOR hiredis.h | awk '{print $$3}')
-HIREDIS_MINOR=$(shell grep HIREDIS_MINOR hiredis.h | awk '{print $$3}')
-HIREDIS_PATCH=$(shell grep HIREDIS_PATCH hiredis.h | awk '{print $$3}')
-HIREDIS_SONAME=$(shell grep HIREDIS_SONAME hiredis.h | awk '{print $$3}')
-
-# Installation related variables and target
-PREFIX?=/usr/local
-INCLUDE_PATH?=include/hiredis
-LIBRARY_PATH?=lib
-PKGCONF_PATH?=pkgconfig
-INSTALL_INCLUDE_PATH= $(DESTDIR)$(PREFIX)/$(INCLUDE_PATH)
-INSTALL_LIBRARY_PATH= $(DESTDIR)$(PREFIX)/$(LIBRARY_PATH)
-INSTALL_PKGCONF_PATH= $(INSTALL_LIBRARY_PATH)/$(PKGCONF_PATH)
-
-# redis-server configuration used for testing
-REDIS_PORT=56379
-REDIS_SERVER=redis-server
-define REDIS_TEST_CONFIG
-	daemonize yes
-	pidfile /tmp/hiredis-test-redis.pid
-	port $(REDIS_PORT)
-	bind 127.0.0.1
-	unixsocket /tmp/hiredis-test-redis.sock
-endef
-export REDIS_TEST_CONFIG
-
-# Fallback to gcc when $CC is not in $PATH.
-CC:=$(shell sh -c 'type $${CC%% *} >/dev/null 2>/dev/null && echo $(CC) || echo gcc')
-CXX:=$(shell sh -c 'type $${CXX%% *} >/dev/null 2>/dev/null && echo $(CXX) || echo g++')
-OPTIMIZATION?=-O3
-WARNINGS=-Wall -W -Wstrict-prototypes -Wwrite-strings -Wno-missing-field-initializers
-DEBUG_FLAGS?= -g -ggdb
-REAL_CFLAGS=$(OPTIMIZATION) -fPIC $(CPPFLAGS) $(CFLAGS) $(WARNINGS) $(DEBUG_FLAGS)
-REAL_LDFLAGS=$(LDFLAGS)
-
-DYLIBSUFFIX=so
-STLIBSUFFIX=a
-DYLIB_MINOR_NAME=$(LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_SONAME)
-DYLIB_MAJOR_NAME=$(LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_MAJOR)
-DYLIBNAME=$(LIBNAME).$(DYLIBSUFFIX)
-
-DYLIB_MAKE_CMD=$(CC) -shared -Wl,-soname,$(DYLIB_MINOR_NAME)
-STLIBNAME=$(LIBNAME).$(STLIBSUFFIX)
-STLIB_MAKE_CMD=$(AR) rcs
-
-SSL_DYLIB_MINOR_NAME=$(SSL_LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_SONAME)
-SSL_DYLIB_MAJOR_NAME=$(SSL_LIBNAME).$(DYLIBSUFFIX).$(HIREDIS_MAJOR)
-SSL_DYLIBNAME=$(SSL_LIBNAME).$(DYLIBSUFFIX)
-SSL_STLIBNAME=$(SSL_LIBNAME).$(STLIBSUFFIX)
-SSL_DYLIB_MAKE_CMD=$(CC) -shared -Wl,-soname,$(SSL_DYLIB_MINOR_NAME)
-
-# Platform-specific overrides
-uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
-
-USE_SSL?=0
-
-# This is required for test.c only
-ifeq ($(USE_SSL),1)
-  CFLAGS+=-DHIREDIS_TEST_SSL
-endif
-
-ifeq ($(uname_S),Linux)
-  ifdef OPENSSL_PREFIX
-    CFLAGS+=-I$(OPENSSL_PREFIX)/include
-    SSL_LDFLAGS+=-L$(OPENSSL_PREFIX)/lib -lssl -lcrypto
-  else
-    SSL_LDFLAGS=-lssl -lcrypto
-  endif
-else
-  OPENSSL_PREFIX?=/usr/local/opt/openssl
-  CFLAGS+=-I$(OPENSSL_PREFIX)/include
-  SSL_LDFLAGS+=-L$(OPENSSL_PREFIX)/lib -lssl -lcrypto
-endif
-
-ifeq ($(uname_S),SunOS)
-  IS_SUN_CC=$(shell sh -c '$(CC) -V 2>&1 |egrep -i -c "sun|studio"')
-  ifeq ($(IS_SUN_CC),1)
-    SUN_SHARED_FLAG=-G
-  else
-    SUN_SHARED_FLAG=-shared
-  endif
-  REAL_LDFLAGS+= -ldl -lnsl -lsocket
-  DYLIB_MAKE_CMD=$(CC) $(SUN_SHARED_FLAG) -o $(DYLIBNAME) -h $(DYLIB_MINOR_NAME) $(LDFLAGS)
-  SSL_DYLIB_MAKE_CMD=$(CC) $(SUN_SHARED_FLAG) -o $(SSL_DYLIBNAME) -h $(SSL_DYLIB_MINOR_NAME) $(LDFLAGS) $(SSL_LDFLAGS)
-endif
-ifeq ($(uname_S),Darwin)
-  DYLIBSUFFIX=dylib
-  DYLIB_MINOR_NAME=$(LIBNAME).$(HIREDIS_SONAME).$(DYLIBSUFFIX)
-  DYLIB_MAKE_CMD=$(CC) -dynamiclib -Wl,-install_name,$(PREFIX)/$(LIBRARY_PATH)/$(DYLIB_MINOR_NAME) -o $(DYLIBNAME) $(LDFLAGS)
-  SSL_DYLIB_MAKE_CMD=$(CC) -dynamiclib -Wl,-install_name,$(PREFIX)/$(LIBRARY_PATH)/$(SSL_DYLIB_MINOR_NAME) -o $(SSL_DYLIBNAME) $(LDFLAGS) $(SSL_LDFLAGS)
-  DYLIB_PLUGIN=-Wl,-undefined -Wl,dynamic_lookup
-endif
-
-all: $(DYLIBNAME) $(STLIBNAME) hiredis-test $(PKGCONFNAME)
-ifeq ($(USE_SSL),1)
-all: $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(SSL_PKGCONFNAME)
-endif
-
-# Deps (use make dep to generate this)
-alloc.o: alloc.c fmacros.h alloc.h
-async.o: async.c fmacros.h alloc.h async.h hiredis.h read.h sds.h net.h dict.c dict.h win32.h async_private.h
-dict.o: dict.c fmacros.h alloc.h dict.h
-hiredis.o: hiredis.c fmacros.h hiredis.h read.h sds.h alloc.h net.h async.h win32.h
-net.o: net.c fmacros.h net.h hiredis.h read.h sds.h alloc.h sockcompat.h win32.h
-read.o: read.c fmacros.h alloc.h read.h sds.h win32.h
-sds.o: sds.c sds.h sdsalloc.h alloc.h
-sockcompat.o: sockcompat.c sockcompat.h
-ssl.o: ssl.c hiredis.h read.h sds.h alloc.h async.h win32.h async_private.h
-test.o: test.c fmacros.h hiredis.h read.h sds.h alloc.h net.h sockcompat.h win32.h
-
-$(DYLIBNAME): $(OBJ)
-	$(DYLIB_MAKE_CMD) -o $(DYLIBNAME) $(OBJ) $(REAL_LDFLAGS)
-
-$(STLIBNAME): $(OBJ)
-	$(STLIB_MAKE_CMD) $(STLIBNAME) $(OBJ)
-
-$(SSL_DYLIBNAME): $(SSL_OBJ)
-	$(SSL_DYLIB_MAKE_CMD) $(DYLIB_PLUGIN) -o $(SSL_DYLIBNAME) $(SSL_OBJ) $(REAL_LDFLAGS) $(LDFLAGS) $(SSL_LDFLAGS)
-
-$(SSL_STLIBNAME): $(SSL_OBJ)
-	$(STLIB_MAKE_CMD) $(SSL_STLIBNAME) $(SSL_OBJ)
-
-dynamic: $(DYLIBNAME)
-static: $(STLIBNAME)
-ifeq ($(USE_SSL),1)
-dynamic: $(SSL_DYLIBNAME)
-static: $(SSL_STLIBNAME)
-endif
-
-# Binaries:
-hiredis-example-libevent: examples/example-libevent.c adapters/libevent.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -levent $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-libevent-ssl: examples/example-libevent-ssl.c adapters/libevent.h $(STLIBNAME) $(SSL_STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -levent $(STLIBNAME) $(SSL_STLIBNAME) $(REAL_LDFLAGS) $(SSL_LDFLAGS)
-
-hiredis-example-libev: examples/example-libev.c adapters/libev.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -lev $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-glib: examples/example-glib.c adapters/glib.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(shell pkg-config --cflags --libs glib-2.0) $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-ivykis: examples/example-ivykis.c adapters/ivykis.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -livykis $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-macosx: examples/example-macosx.c adapters/macosx.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< -framework CoreFoundation $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-ssl: examples/example-ssl.c $(STLIBNAME) $(SSL_STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(SSL_STLIBNAME) $(REAL_LDFLAGS) $(SSL_LDFLAGS)
-
-
-ifndef AE_DIR
-hiredis-example-ae:
-	@echo "Please specify AE_DIR (e.g. <redis repository>/src)"
-	@false
-else
-hiredis-example-ae: examples/example-ae.c adapters/ae.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) $(REAL_LDFLAGS) -I. -I$(AE_DIR) $< $(AE_DIR)/ae.o $(AE_DIR)/zmalloc.o $(AE_DIR)/../deps/jemalloc/lib/libjemalloc.a -pthread $(STLIBNAME)
-endif
-
-ifndef LIBUV_DIR
-hiredis-example-libuv:
-	@echo "Please specify LIBUV_DIR (e.g. ../libuv/)"
-	@false
-else
-hiredis-example-libuv: examples/example-libuv.c adapters/libuv.h $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. -I$(LIBUV_DIR)/include $< $(LIBUV_DIR)/.libs/libuv.a -lpthread -lrt $(STLIBNAME) $(REAL_LDFLAGS)
-endif
-
-ifeq ($(and $(QT_MOC),$(QT_INCLUDE_DIR),$(QT_LIBRARY_DIR)),)
-hiredis-example-qt:
-	@echo "Please specify QT_MOC, QT_INCLUDE_DIR AND QT_LIBRARY_DIR"
-	@false
-else
-hiredis-example-qt: examples/example-qt.cpp adapters/qt.h $(STLIBNAME)
-	$(QT_MOC) adapters/qt.h -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore | \
-	    $(CXX) -x c++ -o qt-adapter-moc.o -c - $(REAL_CFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore
-	$(QT_MOC) examples/example-qt.h -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore | \
-	    $(CXX) -x c++ -o qt-example-moc.o -c - $(REAL_CFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore
-	$(CXX) -o examples/$@ $(REAL_CFLAGS) $(REAL_LDFLAGS) -I. -I$(QT_INCLUDE_DIR) -I$(QT_INCLUDE_DIR)/QtCore -L$(QT_LIBRARY_DIR) qt-adapter-moc.o qt-example-moc.o $< -pthread $(STLIBNAME) -lQtCore
-endif
-
-hiredis-example: examples/example.c $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(REAL_LDFLAGS)
-
-hiredis-example-push: examples/example-push.c $(STLIBNAME)
-	$(CC) -o examples/$@ $(REAL_CFLAGS) -I. $< $(STLIBNAME) $(REAL_LDFLAGS)
-
-examples: $(EXAMPLES)
-
-TEST_LIBS = $(STLIBNAME)
-ifeq ($(USE_SSL),1)
-    TEST_LIBS += $(SSL_STLIBNAME)
-    TEST_LDFLAGS = $(SSL_LDFLAGS) -lssl -lcrypto -lpthread
-endif
-
-hiredis-test: test.o $(TEST_LIBS)
-	$(CC) -o $@ $(REAL_CFLAGS) -I. $^ $(REAL_LDFLAGS) $(TEST_LDFLAGS)
-
-hiredis-%: %.o $(STLIBNAME)
-	$(CC) $(REAL_CFLAGS) -o $@ $< $(TEST_LIBS) $(REAL_LDFLAGS)
-
-test: hiredis-test
-	./hiredis-test
-
-check: hiredis-test
-	TEST_SSL=$(USE_SSL) ./test.sh
-
-.c.o:
-	$(CC) -std=c99 -pedantic -c $(REAL_CFLAGS) $<
-
-clean:
-	rm -rf $(DYLIBNAME) $(STLIBNAME) $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(TESTS) $(PKGCONFNAME) examples/hiredis-example* *.o *.gcda *.gcno *.gcov
-
-dep:
-	$(CC) $(CPPFLAGS) $(CFLAGS) -MM *.c
-
-INSTALL?= cp -pPR
-
-$(PKGCONFNAME): hiredis.h
-	@echo "Generating $@ for pkgconfig..."
-	@echo prefix=$(PREFIX) > $@
-	@echo exec_prefix=\$${prefix} >> $@
-	@echo libdir=$(PREFIX)/$(LIBRARY_PATH) >> $@
-	@echo includedir=$(PREFIX)/$(INCLUDE_PATH) >> $@
-	@echo >> $@
-	@echo Name: hiredis >> $@
-	@echo Description: Minimalistic C client library for Redis. >> $@
-	@echo Version: $(HIREDIS_MAJOR).$(HIREDIS_MINOR).$(HIREDIS_PATCH) >> $@
-	@echo Libs: -L\$${libdir} -lhiredis >> $@
-	@echo Cflags: -I\$${includedir} -D_FILE_OFFSET_BITS=64 >> $@
-
-$(SSL_PKGCONFNAME): hiredis_ssl.h
-	@echo "Generating $@ for pkgconfig..."
-	@echo prefix=$(PREFIX) > $@
-	@echo exec_prefix=\$${prefix} >> $@
-	@echo libdir=$(PREFIX)/$(LIBRARY_PATH) >> $@
-	@echo includedir=$(PREFIX)/$(INCLUDE_PATH) >> $@
-	@echo >> $@
-	@echo Name: hiredis_ssl >> $@
-	@echo Description: SSL Support for hiredis. >> $@
-	@echo Version: $(HIREDIS_MAJOR).$(HIREDIS_MINOR).$(HIREDIS_PATCH) >> $@
-	@echo Requires: hiredis >> $@
-	@echo Libs: -L\$${libdir} -lhiredis_ssl >> $@
-	@echo Libs.private: -lssl -lcrypto >> $@
-
-install: $(DYLIBNAME) $(STLIBNAME) $(PKGCONFNAME)
-	mkdir -p $(INSTALL_INCLUDE_PATH) $(INSTALL_INCLUDE_PATH)/adapters $(INSTALL_LIBRARY_PATH)
-	$(INSTALL) hiredis.h async.h read.h sds.h alloc.h $(INSTALL_INCLUDE_PATH)
-	$(INSTALL) adapters/*.h $(INSTALL_INCLUDE_PATH)/adapters
-	$(INSTALL) $(DYLIBNAME) $(INSTALL_LIBRARY_PATH)/$(DYLIB_MINOR_NAME)
-	cd $(INSTALL_LIBRARY_PATH) && ln -sf $(DYLIB_MINOR_NAME) $(DYLIBNAME)
-	$(INSTALL) $(STLIBNAME) $(INSTALL_LIBRARY_PATH)
-	mkdir -p $(INSTALL_PKGCONF_PATH)
-	$(INSTALL) $(PKGCONFNAME) $(INSTALL_PKGCONF_PATH)
-
-ifeq ($(USE_SSL),1)
-install: install-ssl
-
-install-ssl: $(SSL_DYLIBNAME) $(SSL_STLIBNAME) $(SSL_PKGCONFNAME)
-	mkdir -p $(INSTALL_INCLUDE_PATH) $(INSTALL_LIBRARY_PATH)
-	$(INSTALL) hiredis_ssl.h $(INSTALL_INCLUDE_PATH)
-	$(INSTALL) $(SSL_DYLIBNAME) $(INSTALL_LIBRARY_PATH)/$(SSL_DYLIB_MINOR_NAME)
-	cd $(INSTALL_LIBRARY_PATH) && ln -sf $(SSL_DYLIB_MINOR_NAME) $(SSL_DYLIBNAME)
-	$(INSTALL) $(SSL_STLIBNAME) $(INSTALL_LIBRARY_PATH)
-	mkdir -p $(INSTALL_PKGCONF_PATH)
-	$(INSTALL) $(SSL_PKGCONFNAME) $(INSTALL_PKGCONF_PATH)
-endif
-
-32bit:
-	@echo ""
-	@echo "WARNING: if this fails under Linux you probably need to install libc6-dev-i386"
-	@echo ""
-	$(MAKE) CFLAGS="-m32" LDFLAGS="-m32"
-
-32bit-vars:
-	$(eval CFLAGS=-m32)
-	$(eval LDFLAGS=-m32)
-
-gprof:
-	$(MAKE) CFLAGS="-pg" LDFLAGS="-pg"
-
-gcov:
-	$(MAKE) CFLAGS="-fprofile-arcs -ftest-coverage" LDFLAGS="-fprofile-arcs"
-
-coverage: gcov
-	make check
-	mkdir -p tmp/lcov
-	lcov -d . -c -o tmp/lcov/hiredis.info
-	genhtml --legend -o tmp/lcov/report tmp/lcov/hiredis.info
-
-noopt:
-	$(MAKE) OPTIMIZATION=""
-
-.PHONY: all test check clean dep install 32bit 32bit-vars gprof gcov noopt
diff --git a/redis-stable/deps/hiredis/README.md b/redis-stable/deps/hiredis/README.md
deleted file mode 100644
index 3a22553e..00000000
--- a/redis-stable/deps/hiredis/README.md
+++ /dev/null
@@ -1,658 +0,0 @@
-[![Build Status](https://travis-ci.org/redis/hiredis.png)](https://travis-ci.org/redis/hiredis)
-
-**This Readme reflects the latest changed in the master branch. See [v1.0.0](https://github.com/redis/hiredis/tree/v1.0.0) for the Readme and documentation for the latest release ([API/ABI history](https://abi-laboratory.pro/?view=timeline&l=hiredis)).**
-
-# HIREDIS
-
-Hiredis is a minimalistic C client library for the [Redis](http://redis.io/) database.
-
-It is minimalistic because it just adds minimal support for the protocol, but
-at the same time it uses a high level printf-alike API in order to make it
-much higher level than otherwise suggested by its minimal code base and the
-lack of explicit bindings for every Redis command.
-
-Apart from supporting sending commands and receiving replies, it comes with
-a reply parser that is decoupled from the I/O layer. It
-is a stream parser designed for easy reusability, which can for instance be used
-in higher level language bindings for efficient reply parsing.
-
-Hiredis only supports the binary-safe Redis protocol, so you can use it with any
-Redis version >= 1.2.0.
-
-The library comes with multiple APIs. There is the
-*synchronous API*, the *asynchronous API* and the *reply parsing API*.
-
-## Upgrading to `1.0.0`
-
-Version 1.0.0 marks the first stable release of Hiredis.
-It includes some minor breaking changes, mostly to make the exposed API more uniform and self-explanatory.
-It also bundles the updated `sds` library, to sync up with upstream and Redis.
-For code changes see the [Changelog](CHANGELOG.md).
-
-_Note:  As described below, a few member names have been changed but most applications should be able to upgrade with minor code changes and recompiling._
-
-## IMPORTANT:  Breaking changes from `0.14.1` -> `1.0.0`
-
-* `redisContext` has two additional members (`free_privdata`, and `privctx`).
-* `redisOptions.timeout` has been renamed to `redisOptions.connect_timeout`, and we've added `redisOptions.command_timeout`.
-* `redisReplyObjectFunctions.createArray` now takes `size_t` instead of `int` for its length parameter.
-
-## IMPORTANT:  Breaking changes when upgrading from 0.13.x -> 0.14.x
-
-Bulk and multi-bulk lengths less than -1 or greater than `LLONG_MAX` are now
-protocol errors. This is consistent with the RESP specification. On 32-bit
-platforms, the upper bound is lowered to `SIZE_MAX`.
-
-Change `redisReply.len` to `size_t`, as it denotes the the size of a string
-
-User code should compare this to `size_t` values as well.  If it was used to
-compare to other values, casting might be necessary or can be removed, if
-casting was applied before.
-
-## Upgrading from `<0.9.0`
-
-Version 0.9.0 is a major overhaul of hiredis in every aspect. However, upgrading existing
-code using hiredis should not be a big pain. The key thing to keep in mind when
-upgrading is that hiredis >= 0.9.0 uses a `redisContext*` to keep state, in contrast to
-the stateless 0.0.1 that only has a file descriptor to work with.
-
-## Synchronous API
-
-To consume the synchronous API, there are only a few function calls that need to be introduced:
-
-```c
-redisContext *redisConnect(const char *ip, int port);
-void *redisCommand(redisContext *c, const char *format, ...);
-void freeReplyObject(void *reply);
-```
-
-### Connecting
-
-The function `redisConnect` is used to create a so-called `redisContext`. The
-context is where Hiredis holds state for a connection. The `redisContext`
-struct has an integer `err` field that is non-zero when the connection is in
-an error state. The field `errstr` will contain a string with a description of
-the error. More information on errors can be found in the **Errors** section.
-After trying to connect to Redis using `redisConnect` you should
-check the `err` field to see if establishing the connection was successful:
-```c
-redisContext *c = redisConnect("127.0.0.1", 6379);
-if (c == NULL || c->err) {
-    if (c) {
-        printf("Error: %s\n", c->errstr);
-        // handle error
-    } else {
-        printf("Can't allocate redis context\n");
-    }
-}
-```
-
-*Note: A `redisContext` is not thread-safe.*
-
-### Sending commands
-
-There are several ways to issue commands to Redis. The first that will be introduced is
-`redisCommand`. This function takes a format similar to printf. In the simplest form,
-it is used like this:
-```c
-reply = redisCommand(context, "SET foo bar");
-```
-
-The specifier `%s` interpolates a string in the command, and uses `strlen` to
-determine the length of the string:
-```c
-reply = redisCommand(context, "SET foo %s", value);
-```
-When you need to pass binary safe strings in a command, the `%b` specifier can be
-used. Together with a pointer to the string, it requires a `size_t` length argument
-of the string:
-```c
-reply = redisCommand(context, "SET foo %b", value, (size_t) valuelen);
-```
-Internally, Hiredis splits the command in different arguments and will
-convert it to the protocol used to communicate with Redis.
-One or more spaces separates arguments, so you can use the specifiers
-anywhere in an argument:
-```c
-reply = redisCommand(context, "SET key:%s %s", myid, value);
-```
-
-### Using replies
-
-The return value of `redisCommand` holds a reply when the command was
-successfully executed. When an error occurs, the return value is `NULL` and
-the `err` field in the context will be set (see section on **Errors**).
-Once an error is returned the context cannot be reused and you should set up
-a new connection.
-
-The standard replies that `redisCommand` are of the type `redisReply`. The
-`type` field in the `redisReply` should be used to test what kind of reply
-was received:
-
-### RESP2
-
-* **`REDIS_REPLY_STATUS`**:
-    * The command replied with a status reply. The status string can be accessed using `reply->str`.
-      The length of this string can be accessed using `reply->len`.
-
-* **`REDIS_REPLY_ERROR`**:
-    *  The command replied with an error. The error string can be accessed identical to `REDIS_REPLY_STATUS`.
-
-* **`REDIS_REPLY_INTEGER`**:
-    * The command replied with an integer. The integer value can be accessed using the
-      `reply->integer` field of type `long long`.
-
-* **`REDIS_REPLY_NIL`**:
-    * The command replied with a **nil** object. There is no data to access.
-
-* **`REDIS_REPLY_STRING`**:
-    * A bulk (string) reply. The value of the reply can be accessed using `reply->str`.
-      The length of this string can be accessed using `reply->len`.
-
-* **`REDIS_REPLY_ARRAY`**:
-    * A multi bulk reply. The number of elements in the multi bulk reply is stored in
-      `reply->elements`. Every element in the multi bulk reply is a `redisReply` object as well
-      and can be accessed via `reply->element[..index..]`.
-      Redis may reply with nested arrays but this is fully supported.
-
-### RESP3
-
-Hiredis also supports every new `RESP3` data type which are as follows.  For more information about the protocol see the `RESP3` [specification.](https://github.com/antirez/RESP3/blob/master/spec.md)
-
-* **`REDIS_REPLY_DOUBLE`**:
-    * The command replied with a double-precision floating point number.
-      The value is stored as a string in the `str` member, and can be converted with `strtod` or similar.
-
-* **`REDIS_REPLY_BOOL`**:
-    * A boolean true/false reply.
-      The value is stored in the `integer` member and will be either `0` or `1`.
-
-* **`REDIS_REPLY_MAP`**:
-    * An array with the added invariant that there will always be an even number of elements.
-      The MAP is functionally equivelant to `REDIS_REPLY_ARRAY` except for the previously mentioned invariant.
-
-* **`REDIS_REPLY_SET`**:
-    * An array response where each entry is unique.
-      Like the MAP type, the data is identical to an array response except there are no duplicate values.
-
-* **`REDIS_REPLY_PUSH`**:
-    * An array that can be generated spontaneously by Redis.
-      This array response will always contain at least two subelements.  The first contains the type of `PUSH` message (e.g. `message`, or `invalidate`), and the second being a sub-array with the `PUSH` payload itself.
-
-* **`REDIS_REPLY_ATTR`**:
-    * An array structurally identical to a `MAP` but intended as meta-data about a reply.
-      _As of Redis 6.0.6 this reply type is not used in Redis_
-
-* **`REDIS_REPLY_BIGNUM`**:
-    * A string representing an arbitrarily large signed or unsigned integer value.
-      The number will be encoded as a string in the `str` member of `redisReply`.
-
-* **`REDIS_REPLY_VERB`**:
-    * A verbatim string, intended to be presented to the user without modification.
-      The string payload is stored in the `str` memeber, and type data is stored in the `vtype` member (e.g. `txt` for raw text or `md` for markdown).
-
-Replies should be freed using the `freeReplyObject()` function.
-Note that this function will take care of freeing sub-reply objects
-contained in arrays and nested arrays, so there is no need for the user to
-free the sub replies (it is actually harmful and will corrupt the memory).
-
-**Important:** the current version of hiredis (1.0.0) frees replies when the
-asynchronous API is used. This means you should not call `freeReplyObject` when
-you use this API. The reply is cleaned up by hiredis _after_ the callback
-returns.  We may introduce a flag to make this configurable in future versions of the library.
-
-### Cleaning up
-
-To disconnect and free the context the following function can be used:
-```c
-void redisFree(redisContext *c);
-```
-This function immediately closes the socket and then frees the allocations done in
-creating the context.
-
-### Sending commands (cont'd)
-
-Together with `redisCommand`, the function `redisCommandArgv` can be used to issue commands.
-It has the following prototype:
-```c
-void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
-```
-It takes the number of arguments `argc`, an array of strings `argv` and the lengths of the
-arguments `argvlen`. For convenience, `argvlen` may be set to `NULL` and the function will
-use `strlen(3)` on every argument to determine its length. Obviously, when any of the arguments
-need to be binary safe, the entire array of lengths `argvlen` should be provided.
-
-The return value has the same semantic as `redisCommand`.
-
-### Pipelining
-
-To explain how Hiredis supports pipelining in a blocking connection, there needs to be
-understanding of the internal execution flow.
-
-When any of the functions in the `redisCommand` family is called, Hiredis first formats the
-command according to the Redis protocol. The formatted command is then put in the output buffer
-of the context. This output buffer is dynamic, so it can hold any number of commands.
-After the command is put in the output buffer, `redisGetReply` is called. This function has the
-following two execution paths:
-
-1. The input buffer is non-empty:
-    * Try to parse a single reply from the input buffer and return it
-    * If no reply could be parsed, continue at *2*
-2. The input buffer is empty:
-    * Write the **entire** output buffer to the socket
-    * Read from the socket until a single reply could be parsed
-
-The function `redisGetReply` is exported as part of the Hiredis API and can be used when a reply
-is expected on the socket. To pipeline commands, the only things that needs to be done is
-filling up the output buffer. For this cause, two commands can be used that are identical
-to the `redisCommand` family, apart from not returning a reply:
-```c
-void redisAppendCommand(redisContext *c, const char *format, ...);
-void redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
-```
-After calling either function one or more times, `redisGetReply` can be used to receive the
-subsequent replies. The return value for this function is either `REDIS_OK` or `REDIS_ERR`, where
-the latter means an error occurred while reading a reply. Just as with the other commands,
-the `err` field in the context can be used to find out what the cause of this error is.
-
-The following examples shows a simple pipeline (resulting in only a single call to `write(2)` and
-a single call to `read(2)`):
-```c
-redisReply *reply;
-redisAppendCommand(context,"SET foo bar");
-redisAppendCommand(context,"GET foo");
-redisGetReply(context,(void *)&reply); // reply for SET
-freeReplyObject(reply);
-redisGetReply(context,(void *)&reply); // reply for GET
-freeReplyObject(reply);
-```
-This API can also be used to implement a blocking subscriber:
-```c
-reply = redisCommand(context,"SUBSCRIBE foo");
-freeReplyObject(reply);
-while(redisGetReply(context,(void *)&reply) == REDIS_OK) {
-    // consume message
-    freeReplyObject(reply);
-}
-```
-### Errors
-
-When a function call is not successful, depending on the function either `NULL` or `REDIS_ERR` is
-returned. The `err` field inside the context will be non-zero and set to one of the
-following constants:
-
-* **`REDIS_ERR_IO`**:
-    There was an I/O error while creating the connection, trying to write
-    to the socket or read from the socket. If you included `errno.h` in your
-    application, you can use the global `errno` variable to find out what is
-    wrong.
-
-* **`REDIS_ERR_EOF`**:
-    The server closed the connection which resulted in an empty read.
-
-* **`REDIS_ERR_PROTOCOL`**:
-    There was an error while parsing the protocol.
-
-* **`REDIS_ERR_OTHER`**:
-    Any other error. Currently, it is only used when a specified hostname to connect
-    to cannot be resolved.
-
-In every case, the `errstr` field in the context will be set to hold a string representation
-of the error.
-
-## Asynchronous API
-
-Hiredis comes with an asynchronous API that works easily with any event library.
-Examples are bundled that show using Hiredis with [libev](http://software.schmorp.de/pkg/libev.html)
-and [libevent](http://monkey.org/~provos/libevent/).
-
-### Connecting
-
-The function `redisAsyncConnect` can be used to establish a non-blocking connection to
-Redis. It returns a pointer to the newly created `redisAsyncContext` struct. The `err` field
-should be checked after creation to see if there were errors creating the connection.
-Because the connection that will be created is non-blocking, the kernel is not able to
-instantly return if the specified host and port is able to accept a connection.
-
-*Note: A `redisAsyncContext` is not thread-safe.*
-
-```c
-redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-if (c->err) {
-    printf("Error: %s\n", c->errstr);
-    // handle error
-}
-```
-
-The asynchronous context can hold a disconnect callback function that is called when the
-connection is disconnected (either because of an error or per user request). This function should
-have the following prototype:
-```c
-void(const redisAsyncContext *c, int status);
-```
-On a disconnect, the `status` argument is set to `REDIS_OK` when disconnection was initiated by the
-user, or `REDIS_ERR` when the disconnection was caused by an error. When it is `REDIS_ERR`, the `err`
-field in the context can be accessed to find out the cause of the error.
-
-The context object is always freed after the disconnect callback fired. When a reconnect is needed,
-the disconnect callback is a good point to do so.
-
-Setting the disconnect callback can only be done once per context. For subsequent calls it will
-return `REDIS_ERR`. The function to set the disconnect callback has the following prototype:
-```c
-int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn);
-```
-`ac->data` may be used to pass user data to this callback, the same can be done for redisConnectCallback.
-### Sending commands and their callbacks
-
-In an asynchronous context, commands are automatically pipelined due to the nature of an event loop.
-Therefore, unlike the synchronous API, there is only a single way to send commands.
-Because commands are sent to Redis asynchronously, issuing a command requires a callback function
-that is called when the reply is received. Reply callbacks should have the following prototype:
-```c
-void(redisAsyncContext *c, void *reply, void *privdata);
-```
-The `privdata` argument can be used to curry arbitrary data to the callback from the point where
-the command is initially queued for execution.
-
-The functions that can be used to issue commands in an asynchronous context are:
-```c
-int redisAsyncCommand(
-  redisAsyncContext *ac, redisCallbackFn *fn, void *privdata,
-  const char *format, ...);
-int redisAsyncCommandArgv(
-  redisAsyncContext *ac, redisCallbackFn *fn, void *privdata,
-  int argc, const char **argv, const size_t *argvlen);
-```
-Both functions work like their blocking counterparts. The return value is `REDIS_OK` when the command
-was successfully added to the output buffer and `REDIS_ERR` otherwise. Example: when the connection
-is being disconnected per user-request, no new commands may be added to the output buffer and `REDIS_ERR` is
-returned on calls to the `redisAsyncCommand` family.
-
-If the reply for a command with a `NULL` callback is read, it is immediately freed. When the callback
-for a command is non-`NULL`, the memory is freed immediately following the callback: the reply is only
-valid for the duration of the callback.
-
-All pending callbacks are called with a `NULL` reply when the context encountered an error.
-
-### Disconnecting
-
-An asynchronous connection can be terminated using:
-```c
-void redisAsyncDisconnect(redisAsyncContext *ac);
-```
-When this function is called, the connection is **not** immediately terminated. Instead, new
-commands are no longer accepted and the connection is only terminated when all pending commands
-have been written to the socket, their respective replies have been read and their respective
-callbacks have been executed. After this, the disconnection callback is executed with the
-`REDIS_OK` status and the context object is freed.
-
-### Hooking it up to event library *X*
-
-There are a few hooks that need to be set on the context object after it is created.
-See the `adapters/` directory for bindings to *libev* and *libevent*.
-
-## Reply parsing API
-
-Hiredis comes with a reply parsing API that makes it easy for writing higher
-level language bindings.
-
-The reply parsing API consists of the following functions:
-```c
-redisReader *redisReaderCreate(void);
-void redisReaderFree(redisReader *reader);
-int redisReaderFeed(redisReader *reader, const char *buf, size_t len);
-int redisReaderGetReply(redisReader *reader, void **reply);
-```
-The same set of functions are used internally by hiredis when creating a
-normal Redis context, the above API just exposes it to the user for a direct
-usage.
-
-### Usage
-
-The function `redisReaderCreate` creates a `redisReader` structure that holds a
-buffer with unparsed data and state for the protocol parser.
-
-Incoming data -- most likely from a socket -- can be placed in the internal
-buffer of the `redisReader` using `redisReaderFeed`. This function will make a
-copy of the buffer pointed to by `buf` for `len` bytes. This data is parsed
-when `redisReaderGetReply` is called. This function returns an integer status
-and a reply object (as described above) via `void **reply`. The returned status
-can be either `REDIS_OK` or `REDIS_ERR`, where the latter means something went
-wrong (either a protocol error, or an out of memory error).
-
-The parser limits the level of nesting for multi bulk payloads to 7. If the
-multi bulk nesting level is higher than this, the parser returns an error.
-
-### Customizing replies
-
-The function `redisReaderGetReply` creates `redisReply` and makes the function
-argument `reply` point to the created `redisReply` variable. For instance, if
-the response of type `REDIS_REPLY_STATUS` then the `str` field of `redisReply`
-will hold the status as a vanilla C string. However, the functions that are
-responsible for creating instances of the `redisReply` can be customized by
-setting the `fn` field on the `redisReader` struct. This should be done
-immediately after creating the `redisReader`.
-
-For example, [hiredis-rb](https://github.com/pietern/hiredis-rb/blob/master/ext/hiredis_ext/reader.c)
-uses customized reply object functions to create Ruby objects.
-
-### Reader max buffer
-
-Both when using the Reader API directly or when using it indirectly via a
-normal Redis context, the redisReader structure uses a buffer in order to
-accumulate data from the server.
-Usually this buffer is destroyed when it is empty and is larger than 16
-KiB in order to avoid wasting memory in unused buffers
-
-However when working with very big payloads destroying the buffer may slow
-down performances considerably, so it is possible to modify the max size of
-an idle buffer changing the value of the `maxbuf` field of the reader structure
-to the desired value. The special value of 0 means that there is no maximum
-value for an idle buffer, so the buffer will never get freed.
-
-For instance if you have a normal Redis context you can set the maximum idle
-buffer to zero (unlimited) just with:
-```c
-context->reader->maxbuf = 0;
-```
-This should be done only in order to maximize performances when working with
-large payloads. The context should be set back to `REDIS_READER_MAX_BUF` again
-as soon as possible in order to prevent allocation of useless memory.
-
-### Reader max array elements
-
-By default the hiredis reply parser sets the maximum number of multi-bulk elements
-to 2^32 - 1 or 4,294,967,295 entries.  If you need to process multi-bulk replies
-with more than this many elements you can set the value higher or to zero, meaning
-unlimited with:
-```c
-context->reader->maxelements = 0;
-```
-
-## SSL/TLS Support
-
-### Building
-
-SSL/TLS support is not built by default and requires an explicit flag:
-
-    make USE_SSL=1
-
-This requires OpenSSL development package (e.g. including header files to be
-available.
-
-When enabled, SSL/TLS support is built into extra `libhiredis_ssl.a` and
-`libhiredis_ssl.so` static/dynamic libraries. This leaves the original libraries
-unaffected so no additional dependencies are introduced.
-
-### Using it
-
-First, you'll need to make sure you include the SSL header file:
-
-```c
-#include "hiredis.h"
-#include "hiredis_ssl.h"
-```
-
-You will also need to link against `libhiredis_ssl`, **in addition** to
-`libhiredis` and add `-lssl -lcrypto` to satisfy its dependencies.
-
-Hiredis implements SSL/TLS on top of its normal `redisContext` or
-`redisAsyncContext`, so you will need to establish a connection first and then
-initiate an SSL/TLS handshake.
-
-#### Hiredis OpenSSL Wrappers
-
-Before Hiredis can negotiate an SSL/TLS connection, it is necessary to
-initialize OpenSSL and create a context. You can do that in two ways:
-
-1. Work directly with the OpenSSL API to initialize the library's global context
-   and create `SSL_CTX *` and `SSL *` contexts. With an `SSL *` object you can
-   call `redisInitiateSSL()`.
-2. Work with a set of Hiredis-provided wrappers around OpenSSL, create a
-   `redisSSLContext` object to hold configuration and use
-   `redisInitiateSSLWithContext()` to initiate the SSL/TLS handshake.
-
-```c
-/* An Hiredis SSL context. It holds SSL configuration and can be reused across
- * many contexts.
- */
-redisSSLContext *ssl;
-
-/* An error variable to indicate what went wrong, if the context fails to
- * initialize.
- */
-redisSSLContextError ssl_error;
-
-/* Initialize global OpenSSL state.
- *
- * You should call this only once when your app initializes, and only if
- * you don't explicitly or implicitly initialize OpenSSL it elsewhere.
- */
-redisInitOpenSSL();
-
-/* Create SSL context */
-ssl = redisCreateSSLContext(
-    "cacertbundle.crt",     /* File name of trusted CA/ca bundle file, optional */
-    "/path/to/certs",       /* Path of trusted certificates, optional */
-    "client_cert.pem",      /* File name of client certificate file, optional */
-    "client_key.pem",       /* File name of client private key, optional */
-    "redis.mydomain.com",   /* Server name to request (SNI), optional */
-    &ssl_error
-    ) != REDIS_OK) {
-        printf("SSL error: %s\n", redisSSLContextGetError(ssl_error);
-        /* Abort... */
-    }
-
-/* Create Redis context and establish connection */
-c = redisConnect("localhost", 6443);
-if (c == NULL || c->err) {
-    /* Handle error and abort... */
-}
-
-/* Negotiate SSL/TLS */
-if (redisInitiateSSLWithContext(c, ssl) != REDIS_OK) {
-    /* Handle error, in c->err / c->errstr */
-}
-```
-
-## RESP3 PUSH replies
-Redis 6.0 introduced PUSH replies with the reply-type `>`.  These messages are generated spontaneously and can arrive at any time, so must be handled using callbacks.
-
-### Default behavior
-Hiredis installs handlers on `redisContext` and `redisAsyncContext` by default, which will intercept and free any PUSH replies detected.  This means existing code will work as-is after upgrading to Redis 6 and switching to `RESP3`.
-
-### Custom PUSH handler prototypes
-The callback prototypes differ between `redisContext` and `redisAsyncContext`.
-
-#### redisContext
-```c
-void my_push_handler(void *privdata, void *reply) {
-    /* Handle the reply */
-
-    /* Note: We need to free the reply in our custom handler for
-             blocking contexts.  This lets us keep the reply if
-             we want. */
-    freeReplyObject(reply);
-}
-```
-
-#### redisAsyncContext
-```c
-void my_async_push_handler(redisAsyncContext *ac, void *reply) {
-    /* Handle the reply */
-
-    /* Note:  Because async hiredis always frees replies, you should
-              not call freeReplyObject in an async push callback. */
-}
-```
-
-### Installing a custom handler
-There are two ways to set your own PUSH handlers.
-
-1. Set `push_cb` or `async_push_cb` in the `redisOptions` struct and connect with `redisConnectWithOptions` or `redisAsyncConnectWithOptions`.
-    ```c
-    redisOptions = {0};
-    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
-    options->push_cb = my_push_handler;
-    redisContext *context = redisConnectWithOptions(&options);
-    ```
-2.  Call `redisSetPushCallback` or `redisAsyncSetPushCallback` on a connected context.
-    ```c
-    redisContext *context = redisConnect("127.0.0.1", 6379);
-    redisSetPushCallback(context, my_push_handler);
-    ```
-
-    _Note `redisSetPushCallback` and `redisAsyncSetPushCallback` both return any currently configured handler,  making it easy to override and then return to the old value._
-
-### Specifying no handler
-If you have a unique use-case where you don't want hiredis to automatically intercept and free PUSH replies, you will want to configure no handler at all.  This can be done in two ways.
-1.  Set the `REDIS_OPT_NO_PUSH_AUTOFREE` flag in `redisOptions` and leave the callback function pointer `NULL`.
-    ```c
-    redisOptions = {0};
-    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
-    options->options |= REDIS_OPT_NO_PUSH_AUTOFREE;
-    redisContext *context = redisConnectWithOptions(&options);
-    ```
-3.  Call `redisSetPushCallback` with `NULL` once connected.
-    ```c
-    redisContext *context = redisConnect("127.0.0.1", 6379);
-    redisSetPushCallback(context, NULL);
-    ```
-
-    _Note:  With no handler configured, calls to `redisCommand` may generate more than one reply, so this strategy is only applicable when there's some kind of blocking`redisGetReply()` loop (e.g. `MONITOR` or `SUBSCRIBE` workloads)._
-
-## Allocator injection
-
-Hiredis uses a pass-thru structure of function pointers defined in [alloc.h](https://github.com/redis/hiredis/blob/f5d25850/alloc.h#L41) that contain the currently configured allocation and deallocation functions.  By default they just point to libc (`malloc`, `calloc`, `realloc`, etc).
-
-### Overriding
-
-One can override the allocators like so:
-
-```c
-hiredisAllocFuncs myfuncs = {
-    .mallocFn = my_malloc,
-    .callocFn = my_calloc,
-    .reallocFn = my_realloc,
-    .strdupFn = my_strdup,
-    .freeFn = my_free,
-};
-
-// Override allocators (function returns current allocators if needed)
-hiredisAllocFuncs orig = hiredisSetAllocators(&myfuncs);
-```
-
-To reset the allocators to their default libc function simply call:
-
-```c
-hiredisResetAllocators();
-```
-
-## AUTHORS
-
-Salvatore Sanfilippo (antirez at gmail),\
-Pieter Noordhuis (pcnoordhuis at gmail)\
-Michael Grunder (michael dot grunder at gmail)
-
-_Hiredis is released under the BSD license._
diff --git a/redis-stable/deps/hiredis/adapters/ae.h b/redis-stable/deps/hiredis/adapters/ae.h
deleted file mode 100644
index 660d82eb..00000000
--- a/redis-stable/deps/hiredis/adapters/ae.h
+++ /dev/null
@@ -1,130 +0,0 @@
-/*
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_AE_H__
-#define __HIREDIS_AE_H__
-#include <sys/types.h>
-#include <ae.h>
-#include "../hiredis.h"
-#include "../async.h"
-
-typedef struct redisAeEvents {
-    redisAsyncContext *context;
-    aeEventLoop *loop;
-    int fd;
-    int reading, writing;
-} redisAeEvents;
-
-static void redisAeReadEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
-    ((void)el); ((void)fd); ((void)mask);
-
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAsyncHandleRead(e->context);
-}
-
-static void redisAeWriteEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
-    ((void)el); ((void)fd); ((void)mask);
-
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAsyncHandleWrite(e->context);
-}
-
-static void redisAeAddRead(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (!e->reading) {
-        e->reading = 1;
-        aeCreateFileEvent(loop,e->fd,AE_READABLE,redisAeReadEvent,e);
-    }
-}
-
-static void redisAeDelRead(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (e->reading) {
-        e->reading = 0;
-        aeDeleteFileEvent(loop,e->fd,AE_READABLE);
-    }
-}
-
-static void redisAeAddWrite(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (!e->writing) {
-        e->writing = 1;
-        aeCreateFileEvent(loop,e->fd,AE_WRITABLE,redisAeWriteEvent,e);
-    }
-}
-
-static void redisAeDelWrite(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (e->writing) {
-        e->writing = 0;
-        aeDeleteFileEvent(loop,e->fd,AE_WRITABLE);
-    }
-}
-
-static void redisAeCleanup(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAeDelRead(privdata);
-    redisAeDelWrite(privdata);
-    hi_free(e);
-}
-
-static int redisAeAttach(aeEventLoop *loop, redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisAeEvents *e;
-
-    /* Nothing should be attached when something is already attached */
-    if (ac->ev.data != NULL)
-        return REDIS_ERR;
-
-    /* Create container for context and r/w events */
-    e = (redisAeEvents*)hi_malloc(sizeof(*e));
-    if (e == NULL)
-        return REDIS_ERR;
-
-    e->context = ac;
-    e->loop = loop;
-    e->fd = c->fd;
-    e->reading = e->writing = 0;
-
-    /* Register functions to start/stop listening for events */
-    ac->ev.addRead = redisAeAddRead;
-    ac->ev.delRead = redisAeDelRead;
-    ac->ev.addWrite = redisAeAddWrite;
-    ac->ev.delWrite = redisAeDelWrite;
-    ac->ev.cleanup = redisAeCleanup;
-    ac->ev.data = e;
-
-    return REDIS_OK;
-}
-#endif
diff --git a/redis-stable/deps/hiredis/adapters/glib.h b/redis-stable/deps/hiredis/adapters/glib.h
deleted file mode 100644
index ad59dd14..00000000
--- a/redis-stable/deps/hiredis/adapters/glib.h
+++ /dev/null
@@ -1,156 +0,0 @@
-#ifndef __HIREDIS_GLIB_H__
-#define __HIREDIS_GLIB_H__
-
-#include <glib.h>
-
-#include "../hiredis.h"
-#include "../async.h"
-
-typedef struct
-{
-    GSource source;
-    redisAsyncContext *ac;
-    GPollFD poll_fd;
-} RedisSource;
-
-static void
-redis_source_add_read (gpointer data)
-{
-    RedisSource *source = (RedisSource *)data;
-    g_return_if_fail(source);
-    source->poll_fd.events |= G_IO_IN;
-    g_main_context_wakeup(g_source_get_context((GSource *)data));
-}
-
-static void
-redis_source_del_read (gpointer data)
-{
-    RedisSource *source = (RedisSource *)data;
-    g_return_if_fail(source);
-    source->poll_fd.events &= ~G_IO_IN;
-    g_main_context_wakeup(g_source_get_context((GSource *)data));
-}
-
-static void
-redis_source_add_write (gpointer data)
-{
-    RedisSource *source = (RedisSource *)data;
-    g_return_if_fail(source);
-    source->poll_fd.events |= G_IO_OUT;
-    g_main_context_wakeup(g_source_get_context((GSource *)data));
-}
-
-static void
-redis_source_del_write (gpointer data)
-{
-    RedisSource *source = (RedisSource *)data;
-    g_return_if_fail(source);
-    source->poll_fd.events &= ~G_IO_OUT;
-    g_main_context_wakeup(g_source_get_context((GSource *)data));
-}
-
-static void
-redis_source_cleanup (gpointer data)
-{
-    RedisSource *source = (RedisSource *)data;
-
-    g_return_if_fail(source);
-
-    redis_source_del_read(source);
-    redis_source_del_write(source);
-    /*
-     * It is not our responsibility to remove ourself from the
-     * current main loop. However, we will remove the GPollFD.
-     */
-    if (source->poll_fd.fd >= 0) {
-        g_source_remove_poll((GSource *)data, &source->poll_fd);
-        source->poll_fd.fd = -1;
-    }
-}
-
-static gboolean
-redis_source_prepare (GSource *source,
-                      gint    *timeout_)
-{
-    RedisSource *redis = (RedisSource *)source;
-    *timeout_ = -1;
-    return !!(redis->poll_fd.events & redis->poll_fd.revents);
-}
-
-static gboolean
-redis_source_check (GSource *source)
-{
-    RedisSource *redis = (RedisSource *)source;
-    return !!(redis->poll_fd.events & redis->poll_fd.revents);
-}
-
-static gboolean
-redis_source_dispatch (GSource      *source,
-                       GSourceFunc   callback,
-                       gpointer      user_data)
-{
-    RedisSource *redis = (RedisSource *)source;
-
-    if ((redis->poll_fd.revents & G_IO_OUT)) {
-        redisAsyncHandleWrite(redis->ac);
-        redis->poll_fd.revents &= ~G_IO_OUT;
-    }
-
-    if ((redis->poll_fd.revents & G_IO_IN)) {
-        redisAsyncHandleRead(redis->ac);
-        redis->poll_fd.revents &= ~G_IO_IN;
-    }
-
-    if (callback) {
-        return callback(user_data);
-    }
-
-    return TRUE;
-}
-
-static void
-redis_source_finalize (GSource *source)
-{
-    RedisSource *redis = (RedisSource *)source;
-
-    if (redis->poll_fd.fd >= 0) {
-        g_source_remove_poll(source, &redis->poll_fd);
-        redis->poll_fd.fd = -1;
-    }
-}
-
-static GSource *
-redis_source_new (redisAsyncContext *ac)
-{
-    static GSourceFuncs source_funcs = {
-        .prepare  = redis_source_prepare,
-        .check     = redis_source_check,
-        .dispatch = redis_source_dispatch,
-        .finalize = redis_source_finalize,
-    };
-    redisContext *c = &ac->c;
-    RedisSource *source;
-
-    g_return_val_if_fail(ac != NULL, NULL);
-
-    source = (RedisSource *)g_source_new(&source_funcs, sizeof *source);
-    if (source == NULL)
-        return NULL;
-
-    source->ac = ac;
-    source->poll_fd.fd = c->fd;
-    source->poll_fd.events = 0;
-    source->poll_fd.revents = 0;
-    g_source_add_poll((GSource *)source, &source->poll_fd);
-
-    ac->ev.addRead = redis_source_add_read;
-    ac->ev.delRead = redis_source_del_read;
-    ac->ev.addWrite = redis_source_add_write;
-    ac->ev.delWrite = redis_source_del_write;
-    ac->ev.cleanup = redis_source_cleanup;
-    ac->ev.data = source;
-
-    return (GSource *)source;
-}
-
-#endif /* __HIREDIS_GLIB_H__ */
diff --git a/redis-stable/deps/hiredis/adapters/ivykis.h b/redis-stable/deps/hiredis/adapters/ivykis.h
deleted file mode 100644
index 179f6ab5..00000000
--- a/redis-stable/deps/hiredis/adapters/ivykis.h
+++ /dev/null
@@ -1,84 +0,0 @@
-#ifndef __HIREDIS_IVYKIS_H__
-#define __HIREDIS_IVYKIS_H__
-#include <iv.h>
-#include "../hiredis.h"
-#include "../async.h"
-
-typedef struct redisIvykisEvents {
-    redisAsyncContext *context;
-    struct iv_fd fd;
-} redisIvykisEvents;
-
-static void redisIvykisReadEvent(void *arg) {
-    redisAsyncContext *context = (redisAsyncContext *)arg;
-    redisAsyncHandleRead(context);
-}
-
-static void redisIvykisWriteEvent(void *arg) {
-    redisAsyncContext *context = (redisAsyncContext *)arg;
-    redisAsyncHandleWrite(context);
-}
-
-static void redisIvykisAddRead(void *privdata) {
-    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
-    iv_fd_set_handler_in(&e->fd, redisIvykisReadEvent);
-}
-
-static void redisIvykisDelRead(void *privdata) {
-    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
-    iv_fd_set_handler_in(&e->fd, NULL);
-}
-
-static void redisIvykisAddWrite(void *privdata) {
-    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
-    iv_fd_set_handler_out(&e->fd, redisIvykisWriteEvent);
-}
-
-static void redisIvykisDelWrite(void *privdata) {
-    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
-    iv_fd_set_handler_out(&e->fd, NULL);
-}
-
-static void redisIvykisCleanup(void *privdata) {
-    redisIvykisEvents *e = (redisIvykisEvents*)privdata;
-
-    iv_fd_unregister(&e->fd);
-    hi_free(e);
-}
-
-static int redisIvykisAttach(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisIvykisEvents *e;
-
-    /* Nothing should be attached when something is already attached */
-    if (ac->ev.data != NULL)
-        return REDIS_ERR;
-
-    /* Create container for context and r/w events */
-    e = (redisIvykisEvents*)hi_malloc(sizeof(*e));
-    if (e == NULL)
-        return REDIS_ERR;
-
-    e->context = ac;
-
-    /* Register functions to start/stop listening for events */
-    ac->ev.addRead = redisIvykisAddRead;
-    ac->ev.delRead = redisIvykisDelRead;
-    ac->ev.addWrite = redisIvykisAddWrite;
-    ac->ev.delWrite = redisIvykisDelWrite;
-    ac->ev.cleanup = redisIvykisCleanup;
-    ac->ev.data = e;
-
-    /* Initialize and install read/write events */
-    IV_FD_INIT(&e->fd);
-    e->fd.fd = c->fd;
-    e->fd.handler_in = redisIvykisReadEvent;
-    e->fd.handler_out = redisIvykisWriteEvent;
-    e->fd.handler_err = NULL;
-    e->fd.cookie = e->context;
-
-    iv_fd_register(&e->fd);
-
-    return REDIS_OK;
-}
-#endif
diff --git a/redis-stable/deps/hiredis/adapters/libev.h b/redis-stable/deps/hiredis/adapters/libev.h
deleted file mode 100644
index e1e7bbd9..00000000
--- a/redis-stable/deps/hiredis/adapters/libev.h
+++ /dev/null
@@ -1,179 +0,0 @@
-/*
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_LIBEV_H__
-#define __HIREDIS_LIBEV_H__
-#include <stdlib.h>
-#include <sys/types.h>
-#include <ev.h>
-#include "../hiredis.h"
-#include "../async.h"
-
-typedef struct redisLibevEvents {
-    redisAsyncContext *context;
-    struct ev_loop *loop;
-    int reading, writing;
-    ev_io rev, wev;
-    ev_timer timer;
-} redisLibevEvents;
-
-static void redisLibevReadEvent(EV_P_ ev_io *watcher, int revents) {
-#if EV_MULTIPLICITY
-    ((void)loop);
-#endif
-    ((void)revents);
-
-    redisLibevEvents *e = (redisLibevEvents*)watcher->data;
-    redisAsyncHandleRead(e->context);
-}
-
-static void redisLibevWriteEvent(EV_P_ ev_io *watcher, int revents) {
-#if EV_MULTIPLICITY
-    ((void)loop);
-#endif
-    ((void)revents);
-
-    redisLibevEvents *e = (redisLibevEvents*)watcher->data;
-    redisAsyncHandleWrite(e->context);
-}
-
-static void redisLibevAddRead(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-    if (!e->reading) {
-        e->reading = 1;
-        ev_io_start(EV_A_ &e->rev);
-    }
-}
-
-static void redisLibevDelRead(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-    if (e->reading) {
-        e->reading = 0;
-        ev_io_stop(EV_A_ &e->rev);
-    }
-}
-
-static void redisLibevAddWrite(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-    if (!e->writing) {
-        e->writing = 1;
-        ev_io_start(EV_A_ &e->wev);
-    }
-}
-
-static void redisLibevDelWrite(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-    if (e->writing) {
-        e->writing = 0;
-        ev_io_stop(EV_A_ &e->wev);
-    }
-}
-
-static void redisLibevStopTimer(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-    ev_timer_stop(EV_A_ &e->timer);
-}
-
-static void redisLibevCleanup(void *privdata) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    redisLibevDelRead(privdata);
-    redisLibevDelWrite(privdata);
-    redisLibevStopTimer(privdata);
-    hi_free(e);
-}
-
-static void redisLibevTimeout(EV_P_ ev_timer *timer, int revents) {
-    ((void)revents);
-    redisLibevEvents *e = (redisLibevEvents*)timer->data;
-    redisAsyncHandleTimeout(e->context);
-}
-
-static void redisLibevSetTimeout(void *privdata, struct timeval tv) {
-    redisLibevEvents *e = (redisLibevEvents*)privdata;
-    struct ev_loop *loop = e->loop;
-    ((void)loop);
-
-    if (!ev_is_active(&e->timer)) {
-        ev_init(&e->timer, redisLibevTimeout);
-        e->timer.data = e;
-    }
-
-    e->timer.repeat = tv.tv_sec + tv.tv_usec / 1000000.00;
-    ev_timer_again(EV_A_ &e->timer);
-}
-
-static int redisLibevAttach(EV_P_ redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisLibevEvents *e;
-
-    /* Nothing should be attached when something is already attached */
-    if (ac->ev.data != NULL)
-        return REDIS_ERR;
-
-    /* Create container for context and r/w events */
-    e = (redisLibevEvents*)hi_calloc(1, sizeof(*e));
-    if (e == NULL)
-        return REDIS_ERR;
-
-    e->context = ac;
-#if EV_MULTIPLICITY
-    e->loop = loop;
-#else
-    e->loop = NULL;
-#endif
-    e->rev.data = e;
-    e->wev.data = e;
-
-    /* Register functions to start/stop listening for events */
-    ac->ev.addRead = redisLibevAddRead;
-    ac->ev.delRead = redisLibevDelRead;
-    ac->ev.addWrite = redisLibevAddWrite;
-    ac->ev.delWrite = redisLibevDelWrite;
-    ac->ev.cleanup = redisLibevCleanup;
-    ac->ev.scheduleTimer = redisLibevSetTimeout;
-    ac->ev.data = e;
-
-    /* Initialize read/write events */
-    ev_io_init(&e->rev,redisLibevReadEvent,c->fd,EV_READ);
-    ev_io_init(&e->wev,redisLibevWriteEvent,c->fd,EV_WRITE);
-    return REDIS_OK;
-}
-
-#endif
diff --git a/redis-stable/deps/hiredis/adapters/libevent.h b/redis-stable/deps/hiredis/adapters/libevent.h
deleted file mode 100644
index 9150979b..00000000
--- a/redis-stable/deps/hiredis/adapters/libevent.h
+++ /dev/null
@@ -1,175 +0,0 @@
-/*
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_LIBEVENT_H__
-#define __HIREDIS_LIBEVENT_H__
-#include <event2/event.h>
-#include "../hiredis.h"
-#include "../async.h"
-
-#define REDIS_LIBEVENT_DELETED 0x01
-#define REDIS_LIBEVENT_ENTERED 0x02
-
-typedef struct redisLibeventEvents {
-    redisAsyncContext *context;
-    struct event *ev;
-    struct event_base *base;
-    struct timeval tv;
-    short flags;
-    short state;
-} redisLibeventEvents;
-
-static void redisLibeventDestroy(redisLibeventEvents *e) {
-    hi_free(e);
-}
-
-static void redisLibeventHandler(int fd, short event, void *arg) {
-    ((void)fd);
-    redisLibeventEvents *e = (redisLibeventEvents*)arg;
-    e->state |= REDIS_LIBEVENT_ENTERED;
-
-    #define CHECK_DELETED() if (e->state & REDIS_LIBEVENT_DELETED) {\
-        redisLibeventDestroy(e);\
-        return; \
-    }
-
-    if ((event & EV_TIMEOUT) && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
-        redisAsyncHandleTimeout(e->context);
-        CHECK_DELETED();
-    }
-
-    if ((event & EV_READ) && e->context && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
-        redisAsyncHandleRead(e->context);
-        CHECK_DELETED();
-    }
-
-    if ((event & EV_WRITE) && e->context && (e->state & REDIS_LIBEVENT_DELETED) == 0) {
-        redisAsyncHandleWrite(e->context);
-        CHECK_DELETED();
-    }
-
-    e->state &= ~REDIS_LIBEVENT_ENTERED;
-    #undef CHECK_DELETED
-}
-
-static void redisLibeventUpdate(void *privdata, short flag, int isRemove) {
-    redisLibeventEvents *e = (redisLibeventEvents *)privdata;
-    const struct timeval *tv = e->tv.tv_sec || e->tv.tv_usec ? &e->tv : NULL;
-
-    if (isRemove) {
-        if ((e->flags & flag) == 0) {
-            return;
-        } else {
-            e->flags &= ~flag;
-        }
-    } else {
-        if (e->flags & flag) {
-            return;
-        } else {
-            e->flags |= flag;
-        }
-    }
-
-    event_del(e->ev);
-    event_assign(e->ev, e->base, e->context->c.fd, e->flags | EV_PERSIST,
-                 redisLibeventHandler, privdata);
-    event_add(e->ev, tv);
-}
-
-static void redisLibeventAddRead(void *privdata) {
-    redisLibeventUpdate(privdata, EV_READ, 0);
-}
-
-static void redisLibeventDelRead(void *privdata) {
-    redisLibeventUpdate(privdata, EV_READ, 1);
-}
-
-static void redisLibeventAddWrite(void *privdata) {
-    redisLibeventUpdate(privdata, EV_WRITE, 0);
-}
-
-static void redisLibeventDelWrite(void *privdata) {
-    redisLibeventUpdate(privdata, EV_WRITE, 1);
-}
-
-static void redisLibeventCleanup(void *privdata) {
-    redisLibeventEvents *e = (redisLibeventEvents*)privdata;
-    if (!e) {
-        return;
-    }
-    event_del(e->ev);
-    event_free(e->ev);
-    e->ev = NULL;
-
-    if (e->state & REDIS_LIBEVENT_ENTERED) {
-        e->state |= REDIS_LIBEVENT_DELETED;
-    } else {
-        redisLibeventDestroy(e);
-    }
-}
-
-static void redisLibeventSetTimeout(void *privdata, struct timeval tv) {
-    redisLibeventEvents *e = (redisLibeventEvents *)privdata;
-    short flags = e->flags;
-    e->flags = 0;
-    e->tv = tv;
-    redisLibeventUpdate(e, flags, 0);
-}
-
-static int redisLibeventAttach(redisAsyncContext *ac, struct event_base *base) {
-    redisContext *c = &(ac->c);
-    redisLibeventEvents *e;
-
-    /* Nothing should be attached when something is already attached */
-    if (ac->ev.data != NULL)
-        return REDIS_ERR;
-
-    /* Create container for context and r/w events */
-    e = (redisLibeventEvents*)hi_calloc(1, sizeof(*e));
-    if (e == NULL)
-        return REDIS_ERR;
-
-    e->context = ac;
-
-    /* Register functions to start/stop listening for events */
-    ac->ev.addRead = redisLibeventAddRead;
-    ac->ev.delRead = redisLibeventDelRead;
-    ac->ev.addWrite = redisLibeventAddWrite;
-    ac->ev.delWrite = redisLibeventDelWrite;
-    ac->ev.cleanup = redisLibeventCleanup;
-    ac->ev.scheduleTimer = redisLibeventSetTimeout;
-    ac->ev.data = e;
-
-    /* Initialize and install read/write events */
-    e->ev = event_new(base, c->fd, EV_READ | EV_WRITE, redisLibeventHandler, e);
-    e->base = base;
-    return REDIS_OK;
-}
-#endif
diff --git a/redis-stable/deps/hiredis/adapters/libuv.h b/redis-stable/deps/hiredis/adapters/libuv.h
deleted file mode 100644
index c120b1b3..00000000
--- a/redis-stable/deps/hiredis/adapters/libuv.h
+++ /dev/null
@@ -1,117 +0,0 @@
-#ifndef __HIREDIS_LIBUV_H__
-#define __HIREDIS_LIBUV_H__
-#include <stdlib.h>
-#include <uv.h>
-#include "../hiredis.h"
-#include "../async.h"
-#include <string.h>
-
-typedef struct redisLibuvEvents {
-  redisAsyncContext* context;
-  uv_poll_t          handle;
-  int                events;
-} redisLibuvEvents;
-
-
-static void redisLibuvPoll(uv_poll_t* handle, int status, int events) {
-  redisLibuvEvents* p = (redisLibuvEvents*)handle->data;
-  int ev = (status ? p->events : events);
-
-  if (p->context != NULL && (ev & UV_READABLE)) {
-    redisAsyncHandleRead(p->context);
-  }
-  if (p->context != NULL && (ev & UV_WRITABLE)) {
-    redisAsyncHandleWrite(p->context);
-  }
-}
-
-
-static void redisLibuvAddRead(void *privdata) {
-  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
-
-  p->events |= UV_READABLE;
-
-  uv_poll_start(&p->handle, p->events, redisLibuvPoll);
-}
-
-
-static void redisLibuvDelRead(void *privdata) {
-  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
-
-  p->events &= ~UV_READABLE;
-
-  if (p->events) {
-    uv_poll_start(&p->handle, p->events, redisLibuvPoll);
-  } else {
-    uv_poll_stop(&p->handle);
-  }
-}
-
-
-static void redisLibuvAddWrite(void *privdata) {
-  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
-
-  p->events |= UV_WRITABLE;
-
-  uv_poll_start(&p->handle, p->events, redisLibuvPoll);
-}
-
-
-static void redisLibuvDelWrite(void *privdata) {
-  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
-
-  p->events &= ~UV_WRITABLE;
-
-  if (p->events) {
-    uv_poll_start(&p->handle, p->events, redisLibuvPoll);
-  } else {
-    uv_poll_stop(&p->handle);
-  }
-}
-
-
-static void on_close(uv_handle_t* handle) {
-  redisLibuvEvents* p = (redisLibuvEvents*)handle->data;
-
-  hi_free(p);
-}
-
-
-static void redisLibuvCleanup(void *privdata) {
-  redisLibuvEvents* p = (redisLibuvEvents*)privdata;
-
-  p->context = NULL; // indicate that context might no longer exist
-  uv_close((uv_handle_t*)&p->handle, on_close);
-}
-
-
-static int redisLibuvAttach(redisAsyncContext* ac, uv_loop_t* loop) {
-  redisContext *c = &(ac->c);
-
-  if (ac->ev.data != NULL) {
-    return REDIS_ERR;
-  }
-
-  ac->ev.addRead  = redisLibuvAddRead;
-  ac->ev.delRead  = redisLibuvDelRead;
-  ac->ev.addWrite = redisLibuvAddWrite;
-  ac->ev.delWrite = redisLibuvDelWrite;
-  ac->ev.cleanup  = redisLibuvCleanup;
-
-  redisLibuvEvents* p = (redisLibuvEvents*)hi_malloc(sizeof(*p));
-  if (p == NULL)
-      return REDIS_ERR;
-
-  memset(p, 0, sizeof(*p));
-
-  if (uv_poll_init_socket(loop, &p->handle, c->fd) != 0) {
-    return REDIS_ERR;
-  }
-
-  ac->ev.data    = p;
-  p->handle.data = p;
-  p->context     = ac;
-
-  return REDIS_OK;
-}
-#endif
diff --git a/redis-stable/deps/hiredis/adapters/macosx.h b/redis-stable/deps/hiredis/adapters/macosx.h
deleted file mode 100644
index 3c87f1b2..00000000
--- a/redis-stable/deps/hiredis/adapters/macosx.h
+++ /dev/null
@@ -1,115 +0,0 @@
-//
-//  Created by Дмитрий Бахвалов on 13.07.15.
-//  Copyright (c) 2015 Dmitry Bakhvalov. All rights reserved.
-//
-
-#ifndef __HIREDIS_MACOSX_H__
-#define __HIREDIS_MACOSX_H__
-
-#include <CoreFoundation/CoreFoundation.h>
-
-#include "../hiredis.h"
-#include "../async.h"
-
-typedef struct {
-    redisAsyncContext *context;
-    CFSocketRef socketRef;
-    CFRunLoopSourceRef sourceRef;
-} RedisRunLoop;
-
-static int freeRedisRunLoop(RedisRunLoop* redisRunLoop) {
-    if( redisRunLoop != NULL ) {
-        if( redisRunLoop->sourceRef != NULL ) {
-            CFRunLoopSourceInvalidate(redisRunLoop->sourceRef);
-            CFRelease(redisRunLoop->sourceRef);
-        }
-        if( redisRunLoop->socketRef != NULL ) {
-            CFSocketInvalidate(redisRunLoop->socketRef);
-            CFRelease(redisRunLoop->socketRef);
-        }
-        hi_free(redisRunLoop);
-    }
-    return REDIS_ERR;
-}
-
-static void redisMacOSAddRead(void *privdata) {
-    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
-    CFSocketEnableCallBacks(redisRunLoop->socketRef, kCFSocketReadCallBack);
-}
-
-static void redisMacOSDelRead(void *privdata) {
-    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
-    CFSocketDisableCallBacks(redisRunLoop->socketRef, kCFSocketReadCallBack);
-}
-
-static void redisMacOSAddWrite(void *privdata) {
-    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
-    CFSocketEnableCallBacks(redisRunLoop->socketRef, kCFSocketWriteCallBack);
-}
-
-static void redisMacOSDelWrite(void *privdata) {
-    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
-    CFSocketDisableCallBacks(redisRunLoop->socketRef, kCFSocketWriteCallBack);
-}
-
-static void redisMacOSCleanup(void *privdata) {
-    RedisRunLoop *redisRunLoop = (RedisRunLoop*)privdata;
-    freeRedisRunLoop(redisRunLoop);
-}
-
-static void redisMacOSAsyncCallback(CFSocketRef __unused s, CFSocketCallBackType callbackType, CFDataRef __unused address, const void __unused *data, void *info) {
-    redisAsyncContext* context = (redisAsyncContext*) info;
-
-    switch (callbackType) {
-        case kCFSocketReadCallBack:
-            redisAsyncHandleRead(context);
-            break;
-
-        case kCFSocketWriteCallBack:
-            redisAsyncHandleWrite(context);
-            break;
-
-        default:
-            break;
-    }
-}
-
-static int redisMacOSAttach(redisAsyncContext *redisAsyncCtx, CFRunLoopRef runLoop) {
-    redisContext *redisCtx = &(redisAsyncCtx->c);
-
-    /* Nothing should be attached when something is already attached */
-    if( redisAsyncCtx->ev.data != NULL ) return REDIS_ERR;
-
-    RedisRunLoop* redisRunLoop = (RedisRunLoop*) hi_calloc(1, sizeof(RedisRunLoop));
-    if (redisRunLoop == NULL)
-        return REDIS_ERR;
-
-    /* Setup redis stuff */
-    redisRunLoop->context = redisAsyncCtx;
-
-    redisAsyncCtx->ev.addRead  = redisMacOSAddRead;
-    redisAsyncCtx->ev.delRead  = redisMacOSDelRead;
-    redisAsyncCtx->ev.addWrite = redisMacOSAddWrite;
-    redisAsyncCtx->ev.delWrite = redisMacOSDelWrite;
-    redisAsyncCtx->ev.cleanup  = redisMacOSCleanup;
-    redisAsyncCtx->ev.data     = redisRunLoop;
-
-    /* Initialize and install read/write events */
-    CFSocketContext socketCtx = { 0, redisAsyncCtx, NULL, NULL, NULL };
-
-    redisRunLoop->socketRef = CFSocketCreateWithNative(NULL, redisCtx->fd,
-                                                       kCFSocketReadCallBack | kCFSocketWriteCallBack,
-                                                       redisMacOSAsyncCallback,
-                                                       &socketCtx);
-    if( !redisRunLoop->socketRef ) return freeRedisRunLoop(redisRunLoop);
-
-    redisRunLoop->sourceRef = CFSocketCreateRunLoopSource(NULL, redisRunLoop->socketRef, 0);
-    if( !redisRunLoop->sourceRef ) return freeRedisRunLoop(redisRunLoop);
-
-    CFRunLoopAddSource(runLoop, redisRunLoop->sourceRef, kCFRunLoopDefaultMode);
-
-    return REDIS_OK;
-}
-
-#endif
-
diff --git a/redis-stable/deps/hiredis/adapters/qt.h b/redis-stable/deps/hiredis/adapters/qt.h
deleted file mode 100644
index 5cc02e6c..00000000
--- a/redis-stable/deps/hiredis/adapters/qt.h
+++ /dev/null
@@ -1,135 +0,0 @@
-/*-
- * Copyright (C) 2014 Pietro Cerutti <gahr@gahr.ch>
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_QT_H__
-#define __HIREDIS_QT_H__
-#include <QSocketNotifier>
-#include "../async.h"
-
-static void RedisQtAddRead(void *);
-static void RedisQtDelRead(void *);
-static void RedisQtAddWrite(void *);
-static void RedisQtDelWrite(void *);
-static void RedisQtCleanup(void *);
-
-class RedisQtAdapter : public QObject {
-
-    Q_OBJECT
-
-    friend
-    void RedisQtAddRead(void * adapter) {
-        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
-        a->addRead();
-    }
-
-    friend
-    void RedisQtDelRead(void * adapter) {
-        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
-        a->delRead();
-    }
-
-    friend
-    void RedisQtAddWrite(void * adapter) {
-        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
-        a->addWrite();
-    }
-
-    friend
-    void RedisQtDelWrite(void * adapter) {
-        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
-        a->delWrite();
-    }
-
-    friend
-    void RedisQtCleanup(void * adapter) {
-        RedisQtAdapter * a = static_cast<RedisQtAdapter *>(adapter);
-        a->cleanup();
-    }
-
-    public:
-        RedisQtAdapter(QObject * parent = 0)
-            : QObject(parent), m_ctx(0), m_read(0), m_write(0) { }
-
-        ~RedisQtAdapter() {
-            if (m_ctx != 0) {
-                m_ctx->ev.data = NULL;
-            }
-        }
-
-        int setContext(redisAsyncContext * ac) {
-            if (ac->ev.data != NULL) {
-                return REDIS_ERR;
-            }
-            m_ctx = ac;
-            m_ctx->ev.data = this;
-            m_ctx->ev.addRead = RedisQtAddRead;
-            m_ctx->ev.delRead = RedisQtDelRead;
-            m_ctx->ev.addWrite = RedisQtAddWrite;
-            m_ctx->ev.delWrite = RedisQtDelWrite;
-            m_ctx->ev.cleanup = RedisQtCleanup;
-            return REDIS_OK;
-        }
-
-    private:
-        void addRead() {
-            if (m_read) return;
-            m_read = new QSocketNotifier(m_ctx->c.fd, QSocketNotifier::Read, 0);
-            connect(m_read, SIGNAL(activated(int)), this, SLOT(read()));
-        }
-
-        void delRead() {
-            if (!m_read) return;
-            delete m_read;
-            m_read = 0;
-        }
-
-        void addWrite() {
-            if (m_write) return;
-            m_write = new QSocketNotifier(m_ctx->c.fd, QSocketNotifier::Write, 0);
-            connect(m_write, SIGNAL(activated(int)), this, SLOT(write()));
-        }
-
-        void delWrite() {
-            if (!m_write) return;
-            delete m_write;
-            m_write = 0;
-        }
-
-        void cleanup() {
-            delRead();
-            delWrite();
-        }
-
-    private slots:
-        void read() { redisAsyncHandleRead(m_ctx); }
-        void write() { redisAsyncHandleWrite(m_ctx); }
-
-    private:
-        redisAsyncContext * m_ctx;
-        QSocketNotifier * m_read;
-        QSocketNotifier * m_write;
-};
-
-#endif /* !__HIREDIS_QT_H__ */
diff --git a/redis-stable/deps/hiredis/alloc.c b/redis-stable/deps/hiredis/alloc.c
deleted file mode 100644
index 7fb6b35e..00000000
--- a/redis-stable/deps/hiredis/alloc.c
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include "alloc.h"
-#include <string.h>
-#include <stdlib.h>
-
-hiredisAllocFuncs hiredisAllocFns = {
-    .mallocFn = malloc,
-    .callocFn = calloc,
-    .reallocFn = realloc,
-    .strdupFn = strdup,
-    .freeFn = free,
-};
-
-/* Override hiredis' allocators with ones supplied by the user */
-hiredisAllocFuncs hiredisSetAllocators(hiredisAllocFuncs *override) {
-    hiredisAllocFuncs orig = hiredisAllocFns;
-
-    hiredisAllocFns = *override;
-
-    return orig;
-}
-
-/* Reset allocators to use libc defaults */
-void hiredisResetAllocators(void) {
-    hiredisAllocFns = (hiredisAllocFuncs) {
-        .mallocFn = malloc,
-        .callocFn = calloc,
-        .reallocFn = realloc,
-        .strdupFn = strdup,
-        .freeFn = free,
-    };
-}
-
-#ifdef _WIN32
-
-void *hi_malloc(size_t size) {
-    return hiredisAllocFns.mallocFn(size);
-}
-
-void *hi_calloc(size_t nmemb, size_t size) {
-    return hiredisAllocFns.callocFn(nmemb, size);
-}
-
-void *hi_realloc(void *ptr, size_t size) {
-    return hiredisAllocFns.reallocFn(ptr, size);
-}
-
-char *hi_strdup(const char *str) {
-    return hiredisAllocFns.strdupFn(str);
-}
-
-void hi_free(void *ptr) {
-    hiredisAllocFns.freeFn(ptr);
-}
-
-#endif
diff --git a/redis-stable/deps/hiredis/alloc.h b/redis-stable/deps/hiredis/alloc.h
deleted file mode 100644
index 34a05f49..00000000
--- a/redis-stable/deps/hiredis/alloc.h
+++ /dev/null
@@ -1,91 +0,0 @@
-/*
- * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef HIREDIS_ALLOC_H
-#define HIREDIS_ALLOC_H
-
-#include <stddef.h> /* for size_t */
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* Structure pointing to our actually configured allocators */
-typedef struct hiredisAllocFuncs {
-    void *(*mallocFn)(size_t);
-    void *(*callocFn)(size_t,size_t);
-    void *(*reallocFn)(void*,size_t);
-    char *(*strdupFn)(const char*);
-    void (*freeFn)(void*);
-} hiredisAllocFuncs;
-
-hiredisAllocFuncs hiredisSetAllocators(hiredisAllocFuncs *ha);
-void hiredisResetAllocators(void);
-
-#ifndef _WIN32
-
-/* Hiredis' configured allocator function pointer struct */
-extern hiredisAllocFuncs hiredisAllocFns;
-
-static inline void *hi_malloc(size_t size) {
-    return hiredisAllocFns.mallocFn(size);
-}
-
-static inline void *hi_calloc(size_t nmemb, size_t size) {
-    return hiredisAllocFns.callocFn(nmemb, size);
-}
-
-static inline void *hi_realloc(void *ptr, size_t size) {
-    return hiredisAllocFns.reallocFn(ptr, size);
-}
-
-static inline char *hi_strdup(const char *str) {
-    return hiredisAllocFns.strdupFn(str);
-}
-
-static inline void hi_free(void *ptr) {
-    hiredisAllocFns.freeFn(ptr);
-}
-
-#else
-
-void *hi_malloc(size_t size);
-void *hi_calloc(size_t nmemb, size_t size);
-void *hi_realloc(void *ptr, size_t size);
-char *hi_strdup(const char *str);
-void hi_free(void *ptr);
-
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* HIREDIS_ALLOC_H */
diff --git a/redis-stable/deps/hiredis/appveyor.yml b/redis-stable/deps/hiredis/appveyor.yml
deleted file mode 100644
index 5b43fdbe..00000000
--- a/redis-stable/deps/hiredis/appveyor.yml
+++ /dev/null
@@ -1,24 +0,0 @@
-# Appveyor configuration file for CI build of hiredis on Windows (under Cygwin)
-environment:
-    matrix:
-        - CYG_BASH: C:\cygwin64\bin\bash
-          CC: gcc
-        - CYG_BASH: C:\cygwin\bin\bash
-          CC: gcc
-          CFLAGS: -m32
-          CXXFLAGS: -m32
-          LDFLAGS: -m32
-
-clone_depth: 1
-
-# Attempt to ensure we don't try to convert line endings to Win32 CRLF as this will cause build to fail
-init:
-    - git config --global core.autocrlf input
-
-# Install needed build dependencies
-install:
-    - '%CYG_BASH% -lc "cygcheck -dc cygwin"'
-
-build_script:
-    - 'echo building...'
-    - '%CYG_BASH% -lc "cd $APPVEYOR_BUILD_FOLDER; exec 0</dev/null; mkdir build && cd build && cmake .. -G \"Unix Makefiles\" && make VERBOSE=1"'
diff --git a/redis-stable/deps/hiredis/async.c b/redis-stable/deps/hiredis/async.c
deleted file mode 100644
index 64ab601c..00000000
--- a/redis-stable/deps/hiredis/async.c
+++ /dev/null
@@ -1,887 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include "alloc.h"
-#include <stdlib.h>
-#include <string.h>
-#ifndef _MSC_VER
-#include <strings.h>
-#endif
-#include <assert.h>
-#include <ctype.h>
-#include <errno.h>
-#include "async.h"
-#include "net.h"
-#include "dict.c"
-#include "sds.h"
-#include "win32.h"
-
-#include "async_private.h"
-
-/* Forward declarations of hiredis.c functions */
-int __redisAppendCommand(redisContext *c, const char *cmd, size_t len);
-void __redisSetError(redisContext *c, int type, const char *str);
-
-/* Functions managing dictionary of callbacks for pub/sub. */
-static unsigned int callbackHash(const void *key) {
-    return dictGenHashFunction((const unsigned char *)key,
-                               hi_sdslen((const hisds)key));
-}
-
-static void *callbackValDup(void *privdata, const void *src) {
-    ((void) privdata);
-    redisCallback *dup;
-
-    dup = hi_malloc(sizeof(*dup));
-    if (dup == NULL)
-        return NULL;
-
-    memcpy(dup,src,sizeof(*dup));
-    return dup;
-}
-
-static int callbackKeyCompare(void *privdata, const void *key1, const void *key2) {
-    int l1, l2;
-    ((void) privdata);
-
-    l1 = hi_sdslen((const hisds)key1);
-    l2 = hi_sdslen((const hisds)key2);
-    if (l1 != l2) return 0;
-    return memcmp(key1,key2,l1) == 0;
-}
-
-static void callbackKeyDestructor(void *privdata, void *key) {
-    ((void) privdata);
-    hi_sdsfree((hisds)key);
-}
-
-static void callbackValDestructor(void *privdata, void *val) {
-    ((void) privdata);
-    hi_free(val);
-}
-
-static dictType callbackDict = {
-    callbackHash,
-    NULL,
-    callbackValDup,
-    callbackKeyCompare,
-    callbackKeyDestructor,
-    callbackValDestructor
-};
-
-static redisAsyncContext *redisAsyncInitialize(redisContext *c) {
-    redisAsyncContext *ac;
-    dict *channels = NULL, *patterns = NULL;
-
-    channels = dictCreate(&callbackDict,NULL);
-    if (channels == NULL)
-        goto oom;
-
-    patterns = dictCreate(&callbackDict,NULL);
-    if (patterns == NULL)
-        goto oom;
-
-    ac = hi_realloc(c,sizeof(redisAsyncContext));
-    if (ac == NULL)
-        goto oom;
-
-    c = &(ac->c);
-
-    /* The regular connect functions will always set the flag REDIS_CONNECTED.
-     * For the async API, we want to wait until the first write event is
-     * received up before setting this flag, so reset it here. */
-    c->flags &= ~REDIS_CONNECTED;
-
-    ac->err = 0;
-    ac->errstr = NULL;
-    ac->data = NULL;
-    ac->dataCleanup = NULL;
-
-    ac->ev.data = NULL;
-    ac->ev.addRead = NULL;
-    ac->ev.delRead = NULL;
-    ac->ev.addWrite = NULL;
-    ac->ev.delWrite = NULL;
-    ac->ev.cleanup = NULL;
-    ac->ev.scheduleTimer = NULL;
-
-    ac->onConnect = NULL;
-    ac->onDisconnect = NULL;
-
-    ac->replies.head = NULL;
-    ac->replies.tail = NULL;
-    ac->sub.invalid.head = NULL;
-    ac->sub.invalid.tail = NULL;
-    ac->sub.channels = channels;
-    ac->sub.patterns = patterns;
-
-    return ac;
-oom:
-    if (channels) dictRelease(channels);
-    if (patterns) dictRelease(patterns);
-    return NULL;
-}
-
-/* We want the error field to be accessible directly instead of requiring
- * an indirection to the redisContext struct. */
-static void __redisAsyncCopyError(redisAsyncContext *ac) {
-    if (!ac)
-        return;
-
-    redisContext *c = &(ac->c);
-    ac->err = c->err;
-    ac->errstr = c->errstr;
-}
-
-redisAsyncContext *redisAsyncConnectWithOptions(const redisOptions *options) {
-    redisOptions myOptions = *options;
-    redisContext *c;
-    redisAsyncContext *ac;
-
-    /* Clear any erroneously set sync callback and flag that we don't want to
-     * use freeReplyObject by default. */
-    myOptions.push_cb = NULL;
-    myOptions.options |= REDIS_OPT_NO_PUSH_AUTOFREE;
-
-    myOptions.options |= REDIS_OPT_NONBLOCK;
-    c = redisConnectWithOptions(&myOptions);
-    if (c == NULL) {
-        return NULL;
-    }
-
-    ac = redisAsyncInitialize(c);
-    if (ac == NULL) {
-        redisFree(c);
-        return NULL;
-    }
-
-    /* Set any configured async push handler */
-    redisAsyncSetPushCallback(ac, myOptions.async_push_cb);
-
-    __redisAsyncCopyError(ac);
-    return ac;
-}
-
-redisAsyncContext *redisAsyncConnect(const char *ip, int port) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    return redisAsyncConnectWithOptions(&options);
-}
-
-redisAsyncContext *redisAsyncConnectBind(const char *ip, int port,
-                                         const char *source_addr) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.endpoint.tcp.source_addr = source_addr;
-    return redisAsyncConnectWithOptions(&options);
-}
-
-redisAsyncContext *redisAsyncConnectBindWithReuse(const char *ip, int port,
-                                                  const char *source_addr) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.options |= REDIS_OPT_REUSEADDR;
-    options.endpoint.tcp.source_addr = source_addr;
-    return redisAsyncConnectWithOptions(&options);
-}
-
-redisAsyncContext *redisAsyncConnectUnix(const char *path) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_UNIX(&options, path);
-    return redisAsyncConnectWithOptions(&options);
-}
-
-int redisAsyncSetConnectCallback(redisAsyncContext *ac, redisConnectCallback *fn) {
-    if (ac->onConnect == NULL) {
-        ac->onConnect = fn;
-
-        /* The common way to detect an established connection is to wait for
-         * the first write event to be fired. This assumes the related event
-         * library functions are already set. */
-        _EL_ADD_WRITE(ac);
-        return REDIS_OK;
-    }
-    return REDIS_ERR;
-}
-
-int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn) {
-    if (ac->onDisconnect == NULL) {
-        ac->onDisconnect = fn;
-        return REDIS_OK;
-    }
-    return REDIS_ERR;
-}
-
-/* Helper functions to push/shift callbacks */
-static int __redisPushCallback(redisCallbackList *list, redisCallback *source) {
-    redisCallback *cb;
-
-    /* Copy callback from stack to heap */
-    cb = hi_malloc(sizeof(*cb));
-    if (cb == NULL)
-        return REDIS_ERR_OOM;
-
-    if (source != NULL) {
-        memcpy(cb,source,sizeof(*cb));
-        cb->next = NULL;
-    }
-
-    /* Store callback in list */
-    if (list->head == NULL)
-        list->head = cb;
-    if (list->tail != NULL)
-        list->tail->next = cb;
-    list->tail = cb;
-    return REDIS_OK;
-}
-
-static int __redisShiftCallback(redisCallbackList *list, redisCallback *target) {
-    redisCallback *cb = list->head;
-    if (cb != NULL) {
-        list->head = cb->next;
-        if (cb == list->tail)
-            list->tail = NULL;
-
-        /* Copy callback from heap to stack */
-        if (target != NULL)
-            memcpy(target,cb,sizeof(*cb));
-        hi_free(cb);
-        return REDIS_OK;
-    }
-    return REDIS_ERR;
-}
-
-static void __redisRunCallback(redisAsyncContext *ac, redisCallback *cb, redisReply *reply) {
-    redisContext *c = &(ac->c);
-    if (cb->fn != NULL) {
-        c->flags |= REDIS_IN_CALLBACK;
-        cb->fn(ac,reply,cb->privdata);
-        c->flags &= ~REDIS_IN_CALLBACK;
-    }
-}
-
-static void __redisRunPushCallback(redisAsyncContext *ac, redisReply *reply) {
-    if (ac->push_cb != NULL) {
-        ac->c.flags |= REDIS_IN_CALLBACK;
-        ac->push_cb(ac, reply);
-        ac->c.flags &= ~REDIS_IN_CALLBACK;
-    }
-}
-
-/* Helper function to free the context. */
-static void __redisAsyncFree(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisCallback cb;
-    dictIterator *it;
-    dictEntry *de;
-
-    /* Execute pending callbacks with NULL reply. */
-    while (__redisShiftCallback(&ac->replies,&cb) == REDIS_OK)
-        __redisRunCallback(ac,&cb,NULL);
-
-    /* Execute callbacks for invalid commands */
-    while (__redisShiftCallback(&ac->sub.invalid,&cb) == REDIS_OK)
-        __redisRunCallback(ac,&cb,NULL);
-
-    /* Run subscription callbacks with NULL reply */
-    if (ac->sub.channels) {
-        it = dictGetIterator(ac->sub.channels);
-        if (it != NULL) {
-            while ((de = dictNext(it)) != NULL)
-                __redisRunCallback(ac,dictGetEntryVal(de),NULL);
-            dictReleaseIterator(it);
-        }
-
-        dictRelease(ac->sub.channels);
-    }
-
-    if (ac->sub.patterns) {
-        it = dictGetIterator(ac->sub.patterns);
-        if (it != NULL) {
-            while ((de = dictNext(it)) != NULL)
-                __redisRunCallback(ac,dictGetEntryVal(de),NULL);
-            dictReleaseIterator(it);
-        }
-
-        dictRelease(ac->sub.patterns);
-    }
-
-    /* Signal event lib to clean up */
-    _EL_CLEANUP(ac);
-
-    /* Execute disconnect callback. When redisAsyncFree() initiated destroying
-     * this context, the status will always be REDIS_OK. */
-    if (ac->onDisconnect && (c->flags & REDIS_CONNECTED)) {
-        if (c->flags & REDIS_FREEING) {
-            ac->onDisconnect(ac,REDIS_OK);
-        } else {
-            ac->onDisconnect(ac,(ac->err == 0) ? REDIS_OK : REDIS_ERR);
-        }
-    }
-
-    if (ac->dataCleanup) {
-        ac->dataCleanup(ac->data);
-    }
-
-    /* Cleanup self */
-    redisFree(c);
-}
-
-/* Free the async context. When this function is called from a callback,
- * control needs to be returned to redisProcessCallbacks() before actual
- * free'ing. To do so, a flag is set on the context which is picked up by
- * redisProcessCallbacks(). Otherwise, the context is immediately free'd. */
-void redisAsyncFree(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    c->flags |= REDIS_FREEING;
-    if (!(c->flags & REDIS_IN_CALLBACK))
-        __redisAsyncFree(ac);
-}
-
-/* Helper function to make the disconnect happen and clean up. */
-void __redisAsyncDisconnect(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-
-    /* Make sure error is accessible if there is any */
-    __redisAsyncCopyError(ac);
-
-    if (ac->err == 0) {
-        /* For clean disconnects, there should be no pending callbacks. */
-        int ret = __redisShiftCallback(&ac->replies,NULL);
-        assert(ret == REDIS_ERR);
-    } else {
-        /* Disconnection is caused by an error, make sure that pending
-         * callbacks cannot call new commands. */
-        c->flags |= REDIS_DISCONNECTING;
-    }
-
-    /* cleanup event library on disconnect.
-     * this is safe to call multiple times */
-    _EL_CLEANUP(ac);
-
-    /* For non-clean disconnects, __redisAsyncFree() will execute pending
-     * callbacks with a NULL-reply. */
-    if (!(c->flags & REDIS_NO_AUTO_FREE)) {
-      __redisAsyncFree(ac);
-    }
-}
-
-/* Tries to do a clean disconnect from Redis, meaning it stops new commands
- * from being issued, but tries to flush the output buffer and execute
- * callbacks for all remaining replies. When this function is called from a
- * callback, there might be more replies and we can safely defer disconnecting
- * to redisProcessCallbacks(). Otherwise, we can only disconnect immediately
- * when there are no pending callbacks. */
-void redisAsyncDisconnect(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    c->flags |= REDIS_DISCONNECTING;
-
-    /** unset the auto-free flag here, because disconnect undoes this */
-    c->flags &= ~REDIS_NO_AUTO_FREE;
-    if (!(c->flags & REDIS_IN_CALLBACK) && ac->replies.head == NULL)
-        __redisAsyncDisconnect(ac);
-}
-
-static int __redisGetSubscribeCallback(redisAsyncContext *ac, redisReply *reply, redisCallback *dstcb) {
-    redisContext *c = &(ac->c);
-    dict *callbacks;
-    redisCallback *cb;
-    dictEntry *de;
-    int pvariant;
-    char *stype;
-    hisds sname;
-
-    /* Custom reply functions are not supported for pub/sub. This will fail
-     * very hard when they are used... */
-    if (reply->type == REDIS_REPLY_ARRAY || reply->type == REDIS_REPLY_PUSH) {
-        assert(reply->elements >= 2);
-        assert(reply->element[0]->type == REDIS_REPLY_STRING);
-        stype = reply->element[0]->str;
-        pvariant = (tolower(stype[0]) == 'p') ? 1 : 0;
-
-        if (pvariant)
-            callbacks = ac->sub.patterns;
-        else
-            callbacks = ac->sub.channels;
-
-        /* Locate the right callback */
-        assert(reply->element[1]->type == REDIS_REPLY_STRING);
-        sname = hi_sdsnewlen(reply->element[1]->str,reply->element[1]->len);
-        if (sname == NULL)
-            goto oom;
-
-        de = dictFind(callbacks,sname);
-        if (de != NULL) {
-            cb = dictGetEntryVal(de);
-
-            /* If this is an subscribe reply decrease pending counter. */
-            if (strcasecmp(stype+pvariant,"subscribe") == 0) {
-                cb->pending_subs -= 1;
-            }
-
-            memcpy(dstcb,cb,sizeof(*dstcb));
-
-            /* If this is an unsubscribe message, remove it. */
-            if (strcasecmp(stype+pvariant,"unsubscribe") == 0) {
-                if (cb->pending_subs == 0)
-                    dictDelete(callbacks,sname);
-
-                /* If this was the last unsubscribe message, revert to
-                 * non-subscribe mode. */
-                assert(reply->element[2]->type == REDIS_REPLY_INTEGER);
-
-                /* Unset subscribed flag only when no pipelined pending subscribe. */
-                if (reply->element[2]->integer == 0
-                    && dictSize(ac->sub.channels) == 0
-                    && dictSize(ac->sub.patterns) == 0)
-                    c->flags &= ~REDIS_SUBSCRIBED;
-            }
-        }
-        hi_sdsfree(sname);
-    } else {
-        /* Shift callback for invalid commands. */
-        __redisShiftCallback(&ac->sub.invalid,dstcb);
-    }
-    return REDIS_OK;
-oom:
-    __redisSetError(&(ac->c), REDIS_ERR_OOM, "Out of memory");
-    return REDIS_ERR;
-}
-
-#define redisIsSpontaneousPushReply(r) \
-    (redisIsPushReply(r) && !redisIsSubscribeReply(r))
-
-static int redisIsSubscribeReply(redisReply *reply) {
-    char *str;
-    size_t len, off;
-
-    /* We will always have at least one string with the subscribe/message type */
-    if (reply->elements < 1 || reply->element[0]->type != REDIS_REPLY_STRING ||
-        reply->element[0]->len < sizeof("message") - 1)
-    {
-        return 0;
-    }
-
-    /* Get the string/len moving past 'p' if needed */
-    off = tolower(reply->element[0]->str[0]) == 'p';
-    str = reply->element[0]->str + off;
-    len = reply->element[0]->len - off;
-
-    return !strncasecmp(str, "subscribe", len) ||
-           !strncasecmp(str, "message", len);
-
-}
-
-void redisProcessCallbacks(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisCallback cb = {NULL, NULL, 0, NULL};
-    void *reply = NULL;
-    int status;
-
-    while((status = redisGetReply(c,&reply)) == REDIS_OK) {
-        if (reply == NULL) {
-            /* When the connection is being disconnected and there are
-             * no more replies, this is the cue to really disconnect. */
-            if (c->flags & REDIS_DISCONNECTING && hi_sdslen(c->obuf) == 0
-                && ac->replies.head == NULL) {
-                __redisAsyncDisconnect(ac);
-                return;
-            }
-
-            /* If monitor mode, repush callback */
-            if(c->flags & REDIS_MONITORING) {
-                __redisPushCallback(&ac->replies,&cb);
-            }
-
-            /* When the connection is not being disconnected, simply stop
-             * trying to get replies and wait for the next loop tick. */
-            break;
-        }
-
-        /* Send any non-subscribe related PUSH messages to our PUSH handler
-         * while allowing subscribe related PUSH messages to pass through.
-         * This allows existing code to be backward compatible and work in
-         * either RESP2 or RESP3 mode. */
-        if (redisIsSpontaneousPushReply(reply)) {
-            __redisRunPushCallback(ac, reply);
-            c->reader->fn->freeObject(reply);
-            continue;
-        }
-
-        /* Even if the context is subscribed, pending regular
-         * callbacks will get a reply before pub/sub messages arrive. */
-        if (__redisShiftCallback(&ac->replies,&cb) != REDIS_OK) {
-            /*
-             * A spontaneous reply in a not-subscribed context can be the error
-             * reply that is sent when a new connection exceeds the maximum
-             * number of allowed connections on the server side.
-             *
-             * This is seen as an error instead of a regular reply because the
-             * server closes the connection after sending it.
-             *
-             * To prevent the error from being overwritten by an EOF error the
-             * connection is closed here. See issue #43.
-             *
-             * Another possibility is that the server is loading its dataset.
-             * In this case we also want to close the connection, and have the
-             * user wait until the server is ready to take our request.
-             */
-            if (((redisReply*)reply)->type == REDIS_REPLY_ERROR) {
-                c->err = REDIS_ERR_OTHER;
-                snprintf(c->errstr,sizeof(c->errstr),"%s",((redisReply*)reply)->str);
-                c->reader->fn->freeObject(reply);
-                __redisAsyncDisconnect(ac);
-                return;
-            }
-            /* No more regular callbacks and no errors, the context *must* be subscribed or monitoring. */
-            assert((c->flags & REDIS_SUBSCRIBED || c->flags & REDIS_MONITORING));
-            if(c->flags & REDIS_SUBSCRIBED)
-                __redisGetSubscribeCallback(ac,reply,&cb);
-        }
-
-        if (cb.fn != NULL) {
-            __redisRunCallback(ac,&cb,reply);
-            c->reader->fn->freeObject(reply);
-
-            /* Proceed with free'ing when redisAsyncFree() was called. */
-            if (c->flags & REDIS_FREEING) {
-                __redisAsyncFree(ac);
-                return;
-            }
-        } else {
-            /* No callback for this reply. This can either be a NULL callback,
-             * or there were no callbacks to begin with. Either way, don't
-             * abort with an error, but simply ignore it because the client
-             * doesn't know what the server will spit out over the wire. */
-            c->reader->fn->freeObject(reply);
-        }
-    }
-
-    /* Disconnect when there was an error reading the reply */
-    if (status != REDIS_OK)
-        __redisAsyncDisconnect(ac);
-}
-
-static void __redisAsyncHandleConnectFailure(redisAsyncContext *ac) {
-    if (ac->onConnect) ac->onConnect(ac, REDIS_ERR);
-    __redisAsyncDisconnect(ac);
-}
-
-/* Internal helper function to detect socket status the first time a read or
- * write event fires. When connecting was not successful, the connect callback
- * is called with a REDIS_ERR status and the context is free'd. */
-static int __redisAsyncHandleConnect(redisAsyncContext *ac) {
-    int completed = 0;
-    redisContext *c = &(ac->c);
-
-    if (redisCheckConnectDone(c, &completed) == REDIS_ERR) {
-        /* Error! */
-        redisCheckSocketError(c);
-        __redisAsyncHandleConnectFailure(ac);
-        return REDIS_ERR;
-    } else if (completed == 1) {
-        /* connected! */
-        if (c->connection_type == REDIS_CONN_TCP &&
-            redisSetTcpNoDelay(c) == REDIS_ERR) {
-            __redisAsyncHandleConnectFailure(ac);
-            return REDIS_ERR;
-        }
-
-        if (ac->onConnect) ac->onConnect(ac, REDIS_OK);
-        c->flags |= REDIS_CONNECTED;
-        return REDIS_OK;
-    } else {
-        return REDIS_OK;
-    }
-}
-
-void redisAsyncRead(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-
-    if (redisBufferRead(c) == REDIS_ERR) {
-        __redisAsyncDisconnect(ac);
-    } else {
-        /* Always re-schedule reads */
-        _EL_ADD_READ(ac);
-        redisProcessCallbacks(ac);
-    }
-}
-
-/* This function should be called when the socket is readable.
- * It processes all replies that can be read and executes their callbacks.
- */
-void redisAsyncHandleRead(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-
-    if (!(c->flags & REDIS_CONNECTED)) {
-        /* Abort connect was not successful. */
-        if (__redisAsyncHandleConnect(ac) != REDIS_OK)
-            return;
-        /* Try again later when the context is still not connected. */
-        if (!(c->flags & REDIS_CONNECTED))
-            return;
-    }
-
-    c->funcs->async_read(ac);
-}
-
-void redisAsyncWrite(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    int done = 0;
-
-    if (redisBufferWrite(c,&done) == REDIS_ERR) {
-        __redisAsyncDisconnect(ac);
-    } else {
-        /* Continue writing when not done, stop writing otherwise */
-        if (!done)
-            _EL_ADD_WRITE(ac);
-        else
-            _EL_DEL_WRITE(ac);
-
-        /* Always schedule reads after writes */
-        _EL_ADD_READ(ac);
-    }
-}
-
-void redisAsyncHandleWrite(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-
-    if (!(c->flags & REDIS_CONNECTED)) {
-        /* Abort connect was not successful. */
-        if (__redisAsyncHandleConnect(ac) != REDIS_OK)
-            return;
-        /* Try again later when the context is still not connected. */
-        if (!(c->flags & REDIS_CONNECTED))
-            return;
-    }
-
-    c->funcs->async_write(ac);
-}
-
-void redisAsyncHandleTimeout(redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisCallback cb;
-
-    if ((c->flags & REDIS_CONNECTED) && ac->replies.head == NULL) {
-        /* Nothing to do - just an idle timeout */
-        return;
-    }
-
-    if (!c->err) {
-        __redisSetError(c, REDIS_ERR_TIMEOUT, "Timeout");
-    }
-
-    if (!(c->flags & REDIS_CONNECTED) && ac->onConnect) {
-        ac->onConnect(ac, REDIS_ERR);
-    }
-
-    while (__redisShiftCallback(&ac->replies, &cb) == REDIS_OK) {
-        __redisRunCallback(ac, &cb, NULL);
-    }
-
-    /**
-     * TODO: Don't automatically sever the connection,
-     * rather, allow to ignore <x> responses before the queue is clear
-     */
-    __redisAsyncDisconnect(ac);
-}
-
-/* Sets a pointer to the first argument and its length starting at p. Returns
- * the number of bytes to skip to get to the following argument. */
-static const char *nextArgument(const char *start, const char **str, size_t *len) {
-    const char *p = start;
-    if (p[0] != '$') {
-        p = strchr(p,'$');
-        if (p == NULL) return NULL;
-    }
-
-    *len = (int)strtol(p+1,NULL,10);
-    p = strchr(p,'\r');
-    assert(p);
-    *str = p+2;
-    return p+2+(*len)+2;
-}
-
-/* Helper function for the redisAsyncCommand* family of functions. Writes a
- * formatted command to the output buffer and registers the provided callback
- * function with the context. */
-static int __redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len) {
-    redisContext *c = &(ac->c);
-    redisCallback cb;
-    struct dict *cbdict;
-    dictEntry *de;
-    redisCallback *existcb;
-    int pvariant, hasnext;
-    const char *cstr, *astr;
-    size_t clen, alen;
-    const char *p;
-    hisds sname;
-    int ret;
-
-    /* Don't accept new commands when the connection is about to be closed. */
-    if (c->flags & (REDIS_DISCONNECTING | REDIS_FREEING)) return REDIS_ERR;
-
-    /* Setup callback */
-    cb.fn = fn;
-    cb.privdata = privdata;
-    cb.pending_subs = 1;
-
-    /* Find out which command will be appended. */
-    p = nextArgument(cmd,&cstr,&clen);
-    assert(p != NULL);
-    hasnext = (p[0] == '$');
-    pvariant = (tolower(cstr[0]) == 'p') ? 1 : 0;
-    cstr += pvariant;
-    clen -= pvariant;
-
-    if (hasnext && strncasecmp(cstr,"subscribe\r\n",11) == 0) {
-        c->flags |= REDIS_SUBSCRIBED;
-
-        /* Add every channel/pattern to the list of subscription callbacks. */
-        while ((p = nextArgument(p,&astr,&alen)) != NULL) {
-            sname = hi_sdsnewlen(astr,alen);
-            if (sname == NULL)
-                goto oom;
-
-            if (pvariant)
-                cbdict = ac->sub.patterns;
-            else
-                cbdict = ac->sub.channels;
-
-            de = dictFind(cbdict,sname);
-
-            if (de != NULL) {
-                existcb = dictGetEntryVal(de);
-                cb.pending_subs = existcb->pending_subs + 1;
-            }
-
-            ret = dictReplace(cbdict,sname,&cb);
-
-            if (ret == 0) hi_sdsfree(sname);
-        }
-    } else if (strncasecmp(cstr,"unsubscribe\r\n",13) == 0) {
-        /* It is only useful to call (P)UNSUBSCRIBE when the context is
-         * subscribed to one or more channels or patterns. */
-        if (!(c->flags & REDIS_SUBSCRIBED)) return REDIS_ERR;
-
-        /* (P)UNSUBSCRIBE does not have its own response: every channel or
-         * pattern that is unsubscribed will receive a message. This means we
-         * should not append a callback function for this command. */
-     } else if(strncasecmp(cstr,"monitor\r\n",9) == 0) {
-         /* Set monitor flag and push callback */
-         c->flags |= REDIS_MONITORING;
-         __redisPushCallback(&ac->replies,&cb);
-    } else {
-        if (c->flags & REDIS_SUBSCRIBED)
-            /* This will likely result in an error reply, but it needs to be
-             * received and passed to the callback. */
-            __redisPushCallback(&ac->sub.invalid,&cb);
-        else
-            __redisPushCallback(&ac->replies,&cb);
-    }
-
-    __redisAppendCommand(c,cmd,len);
-
-    /* Always schedule a write when the write buffer is non-empty */
-    _EL_ADD_WRITE(ac);
-
-    return REDIS_OK;
-oom:
-    __redisSetError(&(ac->c), REDIS_ERR_OOM, "Out of memory");
-    return REDIS_ERR;
-}
-
-int redisvAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, va_list ap) {
-    char *cmd;
-    int len;
-    int status;
-    len = redisvFormatCommand(&cmd,format,ap);
-
-    /* We don't want to pass -1 or -2 to future functions as a length. */
-    if (len < 0)
-        return REDIS_ERR;
-
-    status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
-    hi_free(cmd);
-    return status;
-}
-
-int redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, ...) {
-    va_list ap;
-    int status;
-    va_start(ap,format);
-    status = redisvAsyncCommand(ac,fn,privdata,format,ap);
-    va_end(ap);
-    return status;
-}
-
-int redisAsyncCommandArgv(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, int argc, const char **argv, const size_t *argvlen) {
-    hisds cmd;
-    int len;
-    int status;
-    len = redisFormatSdsCommandArgv(&cmd,argc,argv,argvlen);
-    if (len < 0)
-        return REDIS_ERR;
-    status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
-    hi_sdsfree(cmd);
-    return status;
-}
-
-int redisAsyncFormattedCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len) {
-    int status = __redisAsyncCommand(ac,fn,privdata,cmd,len);
-    return status;
-}
-
-redisAsyncPushFn *redisAsyncSetPushCallback(redisAsyncContext *ac, redisAsyncPushFn *fn) {
-    redisAsyncPushFn *old = ac->push_cb;
-    ac->push_cb = fn;
-    return old;
-}
-
-int redisAsyncSetTimeout(redisAsyncContext *ac, struct timeval tv) {
-    if (!ac->c.command_timeout) {
-        ac->c.command_timeout = hi_calloc(1, sizeof(tv));
-        if (ac->c.command_timeout == NULL) {
-            __redisSetError(&ac->c, REDIS_ERR_OOM, "Out of memory");
-            __redisAsyncCopyError(ac);
-            return REDIS_ERR;
-        }
-    }
-
-    if (tv.tv_sec != ac->c.command_timeout->tv_sec ||
-        tv.tv_usec != ac->c.command_timeout->tv_usec)
-    {
-        *ac->c.command_timeout = tv;
-    }
-
-    return REDIS_OK;
-}
diff --git a/redis-stable/deps/hiredis/async.h b/redis-stable/deps/hiredis/async.h
deleted file mode 100644
index b1d2cb26..00000000
--- a/redis-stable/deps/hiredis/async.h
+++ /dev/null
@@ -1,147 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_ASYNC_H
-#define __HIREDIS_ASYNC_H
-#include "hiredis.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-struct redisAsyncContext; /* need forward declaration of redisAsyncContext */
-struct dict; /* dictionary header is included in async.c */
-
-/* Reply callback prototype and container */
-typedef void (redisCallbackFn)(struct redisAsyncContext*, void*, void*);
-typedef struct redisCallback {
-    struct redisCallback *next; /* simple singly linked list */
-    redisCallbackFn *fn;
-    int pending_subs;
-    void *privdata;
-} redisCallback;
-
-/* List of callbacks for either regular replies or pub/sub */
-typedef struct redisCallbackList {
-    redisCallback *head, *tail;
-} redisCallbackList;
-
-/* Connection callback prototypes */
-typedef void (redisDisconnectCallback)(const struct redisAsyncContext*, int status);
-typedef void (redisConnectCallback)(const struct redisAsyncContext*, int status);
-typedef void(redisTimerCallback)(void *timer, void *privdata);
-
-/* Context for an async connection to Redis */
-typedef struct redisAsyncContext {
-    /* Hold the regular context, so it can be realloc'ed. */
-    redisContext c;
-
-    /* Setup error flags so they can be used directly. */
-    int err;
-    char *errstr;
-
-    /* Not used by hiredis */
-    void *data;
-    void (*dataCleanup)(void *privdata);
-
-    /* Event library data and hooks */
-    struct {
-        void *data;
-
-        /* Hooks that are called when the library expects to start
-         * reading/writing. These functions should be idempotent. */
-        void (*addRead)(void *privdata);
-        void (*delRead)(void *privdata);
-        void (*addWrite)(void *privdata);
-        void (*delWrite)(void *privdata);
-        void (*cleanup)(void *privdata);
-        void (*scheduleTimer)(void *privdata, struct timeval tv);
-    } ev;
-
-    /* Called when either the connection is terminated due to an error or per
-     * user request. The status is set accordingly (REDIS_OK, REDIS_ERR). */
-    redisDisconnectCallback *onDisconnect;
-
-    /* Called when the first write event was received. */
-    redisConnectCallback *onConnect;
-
-    /* Regular command callbacks */
-    redisCallbackList replies;
-
-    /* Address used for connect() */
-    struct sockaddr *saddr;
-    size_t addrlen;
-
-    /* Subscription callbacks */
-    struct {
-        redisCallbackList invalid;
-        struct dict *channels;
-        struct dict *patterns;
-    } sub;
-
-    /* Any configured RESP3 PUSH handler */
-    redisAsyncPushFn *push_cb;
-} redisAsyncContext;
-
-/* Functions that proxy to hiredis */
-redisAsyncContext *redisAsyncConnectWithOptions(const redisOptions *options);
-redisAsyncContext *redisAsyncConnect(const char *ip, int port);
-redisAsyncContext *redisAsyncConnectBind(const char *ip, int port, const char *source_addr);
-redisAsyncContext *redisAsyncConnectBindWithReuse(const char *ip, int port,
-                                                  const char *source_addr);
-redisAsyncContext *redisAsyncConnectUnix(const char *path);
-int redisAsyncSetConnectCallback(redisAsyncContext *ac, redisConnectCallback *fn);
-int redisAsyncSetDisconnectCallback(redisAsyncContext *ac, redisDisconnectCallback *fn);
-
-redisAsyncPushFn *redisAsyncSetPushCallback(redisAsyncContext *ac, redisAsyncPushFn *fn);
-int redisAsyncSetTimeout(redisAsyncContext *ac, struct timeval tv);
-void redisAsyncDisconnect(redisAsyncContext *ac);
-void redisAsyncFree(redisAsyncContext *ac);
-
-/* Handle read/write events */
-void redisAsyncHandleRead(redisAsyncContext *ac);
-void redisAsyncHandleWrite(redisAsyncContext *ac);
-void redisAsyncHandleTimeout(redisAsyncContext *ac);
-void redisAsyncRead(redisAsyncContext *ac);
-void redisAsyncWrite(redisAsyncContext *ac);
-
-/* Command functions for an async context. Write the command to the
- * output buffer and register the provided callback. */
-int redisvAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, va_list ap);
-int redisAsyncCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *format, ...);
-int redisAsyncCommandArgv(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, int argc, const char **argv, const size_t *argvlen);
-int redisAsyncFormattedCommand(redisAsyncContext *ac, redisCallbackFn *fn, void *privdata, const char *cmd, size_t len);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/redis-stable/deps/hiredis/async_private.h b/redis-stable/deps/hiredis/async_private.h
deleted file mode 100644
index ea0558d4..00000000
--- a/redis-stable/deps/hiredis/async_private.h
+++ /dev/null
@@ -1,75 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_ASYNC_PRIVATE_H
-#define __HIREDIS_ASYNC_PRIVATE_H
-
-#define _EL_ADD_READ(ctx)                                         \
-    do {                                                          \
-        refreshTimeout(ctx);                                      \
-        if ((ctx)->ev.addRead) (ctx)->ev.addRead((ctx)->ev.data); \
-    } while (0)
-#define _EL_DEL_READ(ctx) do { \
-        if ((ctx)->ev.delRead) (ctx)->ev.delRead((ctx)->ev.data); \
-    } while(0)
-#define _EL_ADD_WRITE(ctx)                                          \
-    do {                                                            \
-        refreshTimeout(ctx);                                        \
-        if ((ctx)->ev.addWrite) (ctx)->ev.addWrite((ctx)->ev.data); \
-    } while (0)
-#define _EL_DEL_WRITE(ctx) do { \
-        if ((ctx)->ev.delWrite) (ctx)->ev.delWrite((ctx)->ev.data); \
-    } while(0)
-#define _EL_CLEANUP(ctx) do { \
-        if ((ctx)->ev.cleanup) (ctx)->ev.cleanup((ctx)->ev.data); \
-        ctx->ev.cleanup = NULL; \
-    } while(0)
-
-static inline void refreshTimeout(redisAsyncContext *ctx) {
-    #define REDIS_TIMER_ISSET(tvp) \
-        (tvp && ((tvp)->tv_sec || (tvp)->tv_usec))
-
-    #define REDIS_EL_TIMER(ac, tvp) \
-        if ((ac)->ev.scheduleTimer && REDIS_TIMER_ISSET(tvp)) { \
-            (ac)->ev.scheduleTimer((ac)->ev.data, *(tvp)); \
-        }
-
-    if (ctx->c.flags & REDIS_CONNECTED) {
-        REDIS_EL_TIMER(ctx, ctx->c.command_timeout);
-    } else {
-        REDIS_EL_TIMER(ctx, ctx->c.connect_timeout);
-    }
-}
-
-void __redisAsyncDisconnect(redisAsyncContext *ac);
-void redisProcessCallbacks(redisAsyncContext *ac);
-
-#endif  /* __HIREDIS_ASYNC_PRIVATE_H */
diff --git a/redis-stable/deps/hiredis/dict.c b/redis-stable/deps/hiredis/dict.c
deleted file mode 100644
index 34a33ead..00000000
--- a/redis-stable/deps/hiredis/dict.c
+++ /dev/null
@@ -1,352 +0,0 @@
-/* Hash table implementation.
- *
- * This file implements in memory hash tables with insert/del/replace/find/
- * get-random-element operations. Hash tables will auto resize if needed
- * tables of power of two in size are used, collisions are handled by
- * chaining. See the source code for more information... :)
- *
- * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include "alloc.h"
-#include <stdlib.h>
-#include <assert.h>
-#include <limits.h>
-#include "dict.h"
-
-/* -------------------------- private prototypes ---------------------------- */
-
-static int _dictExpandIfNeeded(dict *ht);
-static unsigned long _dictNextPower(unsigned long size);
-static int _dictKeyIndex(dict *ht, const void *key);
-static int _dictInit(dict *ht, dictType *type, void *privDataPtr);
-
-/* -------------------------- hash functions -------------------------------- */
-
-/* Generic hash function (a popular one from Bernstein).
- * I tested a few and this was the best. */
-static unsigned int dictGenHashFunction(const unsigned char *buf, int len) {
-    unsigned int hash = 5381;
-
-    while (len--)
-        hash = ((hash << 5) + hash) + (*buf++); /* hash * 33 + c */
-    return hash;
-}
-
-/* ----------------------------- API implementation ------------------------- */
-
-/* Reset an hashtable already initialized with ht_init().
- * NOTE: This function should only called by ht_destroy(). */
-static void _dictReset(dict *ht) {
-    ht->table = NULL;
-    ht->size = 0;
-    ht->sizemask = 0;
-    ht->used = 0;
-}
-
-/* Create a new hash table */
-static dict *dictCreate(dictType *type, void *privDataPtr) {
-    dict *ht = hi_malloc(sizeof(*ht));
-    if (ht == NULL)
-        return NULL;
-
-    _dictInit(ht,type,privDataPtr);
-    return ht;
-}
-
-/* Initialize the hash table */
-static int _dictInit(dict *ht, dictType *type, void *privDataPtr) {
-    _dictReset(ht);
-    ht->type = type;
-    ht->privdata = privDataPtr;
-    return DICT_OK;
-}
-
-/* Expand or create the hashtable */
-static int dictExpand(dict *ht, unsigned long size) {
-    dict n; /* the new hashtable */
-    unsigned long realsize = _dictNextPower(size), i;
-
-    /* the size is invalid if it is smaller than the number of
-     * elements already inside the hashtable */
-    if (ht->used > size)
-        return DICT_ERR;
-
-    _dictInit(&n, ht->type, ht->privdata);
-    n.size = realsize;
-    n.sizemask = realsize-1;
-    n.table = hi_calloc(realsize,sizeof(dictEntry*));
-    if (n.table == NULL)
-        return DICT_ERR;
-
-    /* Copy all the elements from the old to the new table:
-     * note that if the old hash table is empty ht->size is zero,
-     * so dictExpand just creates an hash table. */
-    n.used = ht->used;
-    for (i = 0; i < ht->size && ht->used > 0; i++) {
-        dictEntry *he, *nextHe;
-
-        if (ht->table[i] == NULL) continue;
-
-        /* For each hash entry on this slot... */
-        he = ht->table[i];
-        while(he) {
-            unsigned int h;
-
-            nextHe = he->next;
-            /* Get the new element index */
-            h = dictHashKey(ht, he->key) & n.sizemask;
-            he->next = n.table[h];
-            n.table[h] = he;
-            ht->used--;
-            /* Pass to the next element */
-            he = nextHe;
-        }
-    }
-    assert(ht->used == 0);
-    hi_free(ht->table);
-
-    /* Remap the new hashtable in the old */
-    *ht = n;
-    return DICT_OK;
-}
-
-/* Add an element to the target hash table */
-static int dictAdd(dict *ht, void *key, void *val) {
-    int index;
-    dictEntry *entry;
-
-    /* Get the index of the new element, or -1 if
-     * the element already exists. */
-    if ((index = _dictKeyIndex(ht, key)) == -1)
-        return DICT_ERR;
-
-    /* Allocates the memory and stores key */
-    entry = hi_malloc(sizeof(*entry));
-    if (entry == NULL)
-        return DICT_ERR;
-
-    entry->next = ht->table[index];
-    ht->table[index] = entry;
-
-    /* Set the hash entry fields. */
-    dictSetHashKey(ht, entry, key);
-    dictSetHashVal(ht, entry, val);
-    ht->used++;
-    return DICT_OK;
-}
-
-/* Add an element, discarding the old if the key already exists.
- * Return 1 if the key was added from scratch, 0 if there was already an
- * element with such key and dictReplace() just performed a value update
- * operation. */
-static int dictReplace(dict *ht, void *key, void *val) {
-    dictEntry *entry, auxentry;
-
-    /* Try to add the element. If the key
-     * does not exists dictAdd will succeed. */
-    if (dictAdd(ht, key, val) == DICT_OK)
-        return 1;
-    /* It already exists, get the entry */
-    entry = dictFind(ht, key);
-    if (entry == NULL)
-        return 0;
-
-    /* Free the old value and set the new one */
-    /* Set the new value and free the old one. Note that it is important
-     * to do that in this order, as the value may just be exactly the same
-     * as the previous one. In this context, think to reference counting,
-     * you want to increment (set), and then decrement (free), and not the
-     * reverse. */
-    auxentry = *entry;
-    dictSetHashVal(ht, entry, val);
-    dictFreeEntryVal(ht, &auxentry);
-    return 0;
-}
-
-/* Search and remove an element */
-static int dictDelete(dict *ht, const void *key) {
-    unsigned int h;
-    dictEntry *de, *prevde;
-
-    if (ht->size == 0)
-        return DICT_ERR;
-    h = dictHashKey(ht, key) & ht->sizemask;
-    de = ht->table[h];
-
-    prevde = NULL;
-    while(de) {
-        if (dictCompareHashKeys(ht,key,de->key)) {
-            /* Unlink the element from the list */
-            if (prevde)
-                prevde->next = de->next;
-            else
-                ht->table[h] = de->next;
-
-            dictFreeEntryKey(ht,de);
-            dictFreeEntryVal(ht,de);
-            hi_free(de);
-            ht->used--;
-            return DICT_OK;
-        }
-        prevde = de;
-        de = de->next;
-    }
-    return DICT_ERR; /* not found */
-}
-
-/* Destroy an entire hash table */
-static int _dictClear(dict *ht) {
-    unsigned long i;
-
-    /* Free all the elements */
-    for (i = 0; i < ht->size && ht->used > 0; i++) {
-        dictEntry *he, *nextHe;
-
-        if ((he = ht->table[i]) == NULL) continue;
-        while(he) {
-            nextHe = he->next;
-            dictFreeEntryKey(ht, he);
-            dictFreeEntryVal(ht, he);
-            hi_free(he);
-            ht->used--;
-            he = nextHe;
-        }
-    }
-    /* Free the table and the allocated cache structure */
-    hi_free(ht->table);
-    /* Re-initialize the table */
-    _dictReset(ht);
-    return DICT_OK; /* never fails */
-}
-
-/* Clear & Release the hash table */
-static void dictRelease(dict *ht) {
-    _dictClear(ht);
-    hi_free(ht);
-}
-
-static dictEntry *dictFind(dict *ht, const void *key) {
-    dictEntry *he;
-    unsigned int h;
-
-    if (ht->size == 0) return NULL;
-    h = dictHashKey(ht, key) & ht->sizemask;
-    he = ht->table[h];
-    while(he) {
-        if (dictCompareHashKeys(ht, key, he->key))
-            return he;
-        he = he->next;
-    }
-    return NULL;
-}
-
-static dictIterator *dictGetIterator(dict *ht) {
-    dictIterator *iter = hi_malloc(sizeof(*iter));
-    if (iter == NULL)
-        return NULL;
-
-    iter->ht = ht;
-    iter->index = -1;
-    iter->entry = NULL;
-    iter->nextEntry = NULL;
-    return iter;
-}
-
-static dictEntry *dictNext(dictIterator *iter) {
-    while (1) {
-        if (iter->entry == NULL) {
-            iter->index++;
-            if (iter->index >=
-                    (signed)iter->ht->size) break;
-            iter->entry = iter->ht->table[iter->index];
-        } else {
-            iter->entry = iter->nextEntry;
-        }
-        if (iter->entry) {
-            /* We need to save the 'next' here, the iterator user
-             * may delete the entry we are returning. */
-            iter->nextEntry = iter->entry->next;
-            return iter->entry;
-        }
-    }
-    return NULL;
-}
-
-static void dictReleaseIterator(dictIterator *iter) {
-    hi_free(iter);
-}
-
-/* ------------------------- private functions ------------------------------ */
-
-/* Expand the hash table if needed */
-static int _dictExpandIfNeeded(dict *ht) {
-    /* If the hash table is empty expand it to the initial size,
-     * if the table is "full" double its size. */
-    if (ht->size == 0)
-        return dictExpand(ht, DICT_HT_INITIAL_SIZE);
-    if (ht->used == ht->size)
-        return dictExpand(ht, ht->size*2);
-    return DICT_OK;
-}
-
-/* Our hash table capability is a power of two */
-static unsigned long _dictNextPower(unsigned long size) {
-    unsigned long i = DICT_HT_INITIAL_SIZE;
-
-    if (size >= LONG_MAX) return LONG_MAX;
-    while(1) {
-        if (i >= size)
-            return i;
-        i *= 2;
-    }
-}
-
-/* Returns the index of a free slot that can be populated with
- * an hash entry for the given 'key'.
- * If the key already exists, -1 is returned. */
-static int _dictKeyIndex(dict *ht, const void *key) {
-    unsigned int h;
-    dictEntry *he;
-
-    /* Expand the hashtable if needed */
-    if (_dictExpandIfNeeded(ht) == DICT_ERR)
-        return -1;
-    /* Compute the key hash value */
-    h = dictHashKey(ht, key) & ht->sizemask;
-    /* Search if this slot does not already contain the given key */
-    he = ht->table[h];
-    while(he) {
-        if (dictCompareHashKeys(ht, key, he->key))
-            return -1;
-        he = he->next;
-    }
-    return h;
-}
-
diff --git a/redis-stable/deps/hiredis/dict.h b/redis-stable/deps/hiredis/dict.h
deleted file mode 100644
index 95fcd280..00000000
--- a/redis-stable/deps/hiredis/dict.h
+++ /dev/null
@@ -1,126 +0,0 @@
-/* Hash table implementation.
- *
- * This file implements in memory hash tables with insert/del/replace/find/
- * get-random-element operations. Hash tables will auto resize if needed
- * tables of power of two in size are used, collisions are handled by
- * chaining. See the source code for more information... :)
- *
- * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __DICT_H
-#define __DICT_H
-
-#define DICT_OK 0
-#define DICT_ERR 1
-
-/* Unused arguments generate annoying warnings... */
-#define DICT_NOTUSED(V) ((void) V)
-
-typedef struct dictEntry {
-    void *key;
-    void *val;
-    struct dictEntry *next;
-} dictEntry;
-
-typedef struct dictType {
-    unsigned int (*hashFunction)(const void *key);
-    void *(*keyDup)(void *privdata, const void *key);
-    void *(*valDup)(void *privdata, const void *obj);
-    int (*keyCompare)(void *privdata, const void *key1, const void *key2);
-    void (*keyDestructor)(void *privdata, void *key);
-    void (*valDestructor)(void *privdata, void *obj);
-} dictType;
-
-typedef struct dict {
-    dictEntry **table;
-    dictType *type;
-    unsigned long size;
-    unsigned long sizemask;
-    unsigned long used;
-    void *privdata;
-} dict;
-
-typedef struct dictIterator {
-    dict *ht;
-    int index;
-    dictEntry *entry, *nextEntry;
-} dictIterator;
-
-/* This is the initial size of every hash table */
-#define DICT_HT_INITIAL_SIZE     4
-
-/* ------------------------------- Macros ------------------------------------*/
-#define dictFreeEntryVal(ht, entry) \
-    if ((ht)->type->valDestructor) \
-        (ht)->type->valDestructor((ht)->privdata, (entry)->val)
-
-#define dictSetHashVal(ht, entry, _val_) do { \
-    if ((ht)->type->valDup) \
-        entry->val = (ht)->type->valDup((ht)->privdata, _val_); \
-    else \
-        entry->val = (_val_); \
-} while(0)
-
-#define dictFreeEntryKey(ht, entry) \
-    if ((ht)->type->keyDestructor) \
-        (ht)->type->keyDestructor((ht)->privdata, (entry)->key)
-
-#define dictSetHashKey(ht, entry, _key_) do { \
-    if ((ht)->type->keyDup) \
-        entry->key = (ht)->type->keyDup((ht)->privdata, _key_); \
-    else \
-        entry->key = (_key_); \
-} while(0)
-
-#define dictCompareHashKeys(ht, key1, key2) \
-    (((ht)->type->keyCompare) ? \
-        (ht)->type->keyCompare((ht)->privdata, key1, key2) : \
-        (key1) == (key2))
-
-#define dictHashKey(ht, key) (ht)->type->hashFunction(key)
-
-#define dictGetEntryKey(he) ((he)->key)
-#define dictGetEntryVal(he) ((he)->val)
-#define dictSlots(ht) ((ht)->size)
-#define dictSize(ht) ((ht)->used)
-
-/* API */
-static unsigned int dictGenHashFunction(const unsigned char *buf, int len);
-static dict *dictCreate(dictType *type, void *privDataPtr);
-static int dictExpand(dict *ht, unsigned long size);
-static int dictAdd(dict *ht, void *key, void *val);
-static int dictReplace(dict *ht, void *key, void *val);
-static int dictDelete(dict *ht, const void *key);
-static void dictRelease(dict *ht);
-static dictEntry * dictFind(dict *ht, const void *key);
-static dictIterator *dictGetIterator(dict *ht);
-static dictEntry *dictNext(dictIterator *iter);
-static void dictReleaseIterator(dictIterator *iter);
-
-#endif /* __DICT_H */
diff --git a/redis-stable/deps/hiredis/examples/CMakeLists.txt b/redis-stable/deps/hiredis/examples/CMakeLists.txt
deleted file mode 100644
index 1d5bc56e..00000000
--- a/redis-stable/deps/hiredis/examples/CMakeLists.txt
+++ /dev/null
@@ -1,49 +0,0 @@
-INCLUDE(FindPkgConfig)
-# Check for GLib
-
-PKG_CHECK_MODULES(GLIB2 glib-2.0)
-if (GLIB2_FOUND)
-    INCLUDE_DIRECTORIES(${GLIB2_INCLUDE_DIRS})
-    LINK_DIRECTORIES(${GLIB2_LIBRARY_DIRS})
-    ADD_EXECUTABLE(example-glib example-glib.c)
-    TARGET_LINK_LIBRARIES(example-glib hiredis ${GLIB2_LIBRARIES})
-ENDIF(GLIB2_FOUND)
-
-FIND_PATH(LIBEV ev.h
-    HINTS /usr/local /usr/opt/local
-    ENV LIBEV_INCLUDE_DIR)
-
-if (LIBEV)
-    # Just compile and link with libev
-    ADD_EXECUTABLE(example-libev example-libev.c)
-    TARGET_LINK_LIBRARIES(example-libev hiredis ev)
-ENDIF()
-
-FIND_PATH(LIBEVENT event.h)
-if (LIBEVENT)
-    ADD_EXECUTABLE(example-libevent example-libevent)
-    TARGET_LINK_LIBRARIES(example-libevent hiredis event)
-ENDIF()
-
-FIND_PATH(LIBUV uv.h)
-IF (LIBUV)
-    ADD_EXECUTABLE(example-libuv example-libuv.c)
-    TARGET_LINK_LIBRARIES(example-libuv hiredis uv)
-ENDIF()
-
-IF (APPLE)
-    FIND_LIBRARY(CF CoreFoundation)
-    ADD_EXECUTABLE(example-macosx example-macosx.c)
-    TARGET_LINK_LIBRARIES(example-macosx hiredis ${CF})
-ENDIF()
-
-IF (ENABLE_SSL)
-    ADD_EXECUTABLE(example-ssl example-ssl.c)
-    TARGET_LINK_LIBRARIES(example-ssl hiredis hiredis_ssl)
-ENDIF()
-
-ADD_EXECUTABLE(example example.c)
-TARGET_LINK_LIBRARIES(example hiredis)
-
-ADD_EXECUTABLE(example-push example-push.c)
-TARGET_LINK_LIBRARIES(example-push hiredis)
diff --git a/redis-stable/deps/hiredis/examples/example-ae.c b/redis-stable/deps/hiredis/examples/example-ae.c
deleted file mode 100644
index 8efa7306..00000000
--- a/redis-stable/deps/hiredis/examples/example-ae.c
+++ /dev/null
@@ -1,62 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/ae.h>
-
-/* Put event loop in the global scope, so it can be explicitly stopped */
-static aeEventLoop *loop;
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        aeStop(loop);
-        return;
-    }
-
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        aeStop(loop);
-        return;
-    }
-
-    printf("Disconnected...\n");
-    aeStop(loop);
-}
-
-int main (int argc, char **argv) {
-    signal(SIGPIPE, SIG_IGN);
-
-    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    loop = aeCreateEventLoop(64);
-    redisAeAttach(loop, c);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-    aeMain(loop);
-    return 0;
-}
-
diff --git a/redis-stable/deps/hiredis/examples/example-glib.c b/redis-stable/deps/hiredis/examples/example-glib.c
deleted file mode 100644
index d6e10f8e..00000000
--- a/redis-stable/deps/hiredis/examples/example-glib.c
+++ /dev/null
@@ -1,73 +0,0 @@
-#include <stdlib.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/glib.h>
-
-static GMainLoop *mainloop;
-
-static void
-connect_cb (const redisAsyncContext *ac G_GNUC_UNUSED,
-            int status)
-{
-    if (status != REDIS_OK) {
-        g_printerr("Failed to connect: %s\n", ac->errstr);
-        g_main_loop_quit(mainloop);
-    } else {
-        g_printerr("Connected...\n");
-    }
-}
-
-static void
-disconnect_cb (const redisAsyncContext *ac G_GNUC_UNUSED,
-               int status)
-{
-    if (status != REDIS_OK) {
-        g_error("Failed to disconnect: %s", ac->errstr);
-    } else {
-        g_printerr("Disconnected...\n");
-        g_main_loop_quit(mainloop);
-    }
-}
-
-static void
-command_cb(redisAsyncContext *ac,
-           gpointer r,
-           gpointer user_data G_GNUC_UNUSED)
-{
-    redisReply *reply = r;
-
-    if (reply) {
-        g_print("REPLY: %s\n", reply->str);
-    }
-
-    redisAsyncDisconnect(ac);
-}
-
-gint
-main (gint argc     G_GNUC_UNUSED,
-      gchar *argv[] G_GNUC_UNUSED)
-{
-    redisAsyncContext *ac;
-    GMainContext *context = NULL;
-    GSource *source;
-
-    ac = redisAsyncConnect("127.0.0.1", 6379);
-    if (ac->err) {
-        g_printerr("%s\n", ac->errstr);
-        exit(EXIT_FAILURE);
-    }
-
-    source = redis_source_new(ac);
-    mainloop = g_main_loop_new(context, FALSE);
-    g_source_attach(source, context);
-
-    redisAsyncSetConnectCallback(ac, connect_cb);
-    redisAsyncSetDisconnectCallback(ac, disconnect_cb);
-    redisAsyncCommand(ac, command_cb, NULL, "SET key 1234");
-    redisAsyncCommand(ac, command_cb, NULL, "GET key");
-
-    g_main_loop_run(mainloop);
-
-    return EXIT_SUCCESS;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-ivykis.c b/redis-stable/deps/hiredis/examples/example-ivykis.c
deleted file mode 100644
index f57dc388..00000000
--- a/redis-stable/deps/hiredis/examples/example-ivykis.c
+++ /dev/null
@@ -1,60 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/ivykis.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-#ifndef _WIN32
-    signal(SIGPIPE, SIG_IGN);
-#endif
-
-    iv_init();
-
-    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    redisIvykisAttach(c);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-
-    iv_main();
-
-    iv_deinit();
-
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-libev.c b/redis-stable/deps/hiredis/examples/example-libev.c
deleted file mode 100644
index ec474306..00000000
--- a/redis-stable/deps/hiredis/examples/example-libev.c
+++ /dev/null
@@ -1,54 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/libev.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-#ifndef _WIN32
-    signal(SIGPIPE, SIG_IGN);
-#endif
-
-    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    redisLibevAttach(EV_DEFAULT_ c);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-    ev_loop(EV_DEFAULT_ 0);
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-libevent-ssl.c b/redis-stable/deps/hiredis/examples/example-libevent-ssl.c
deleted file mode 100644
index 7d99af1b..00000000
--- a/redis-stable/deps/hiredis/examples/example-libevent-ssl.c
+++ /dev/null
@@ -1,90 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <hiredis_ssl.h>
-#include <async.h>
-#include <adapters/libevent.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-#ifndef _WIN32
-    signal(SIGPIPE, SIG_IGN);
-#endif
-
-    struct event_base *base = event_base_new();
-    if (argc < 5) {
-        fprintf(stderr,
-                "Usage: %s <key> <host> <port> <cert> <certKey> [ca]\n", argv[0]);
-        exit(1);
-    }
-
-    const char *value = argv[1];
-    size_t nvalue = strlen(value);
-
-    const char *hostname = argv[2];
-    int port = atoi(argv[3]);
-
-    const char *cert = argv[4];
-    const char *certKey = argv[5];
-    const char *caCert = argc > 5 ? argv[6] : NULL;
-
-    redisSSLContext *ssl;
-    redisSSLContextError ssl_error;
-
-    redisInitOpenSSL();
-
-    ssl = redisCreateSSLContext(caCert, NULL,
-            cert, certKey, NULL, &ssl_error);
-    if (!ssl) {
-        printf("Error: %s\n", redisSSLContextGetError(ssl_error));
-        return 1;
-    }
-
-    redisAsyncContext *c = redisAsyncConnect(hostname, port);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-    if (redisInitiateSSLWithContext(&c->c, ssl) != REDIS_OK) {
-        printf("SSL Error!\n");
-        exit(1);
-    }
-
-    redisLibeventAttach(c,base);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", value, nvalue);
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-    event_base_dispatch(base);
-
-    redisFreeSSLContext(ssl);
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-libevent.c b/redis-stable/deps/hiredis/examples/example-libevent.c
deleted file mode 100644
index 49bddd0c..00000000
--- a/redis-stable/deps/hiredis/examples/example-libevent.c
+++ /dev/null
@@ -1,67 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/libevent.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) {
-        if (c->errstr) {
-            printf("errstr: %s\n", c->errstr);
-        }
-        return;
-    }
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-#ifndef _WIN32
-    signal(SIGPIPE, SIG_IGN);
-#endif
-
-    struct event_base *base = event_base_new();
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, "127.0.0.1", 6379);
-    struct timeval tv = {0};
-    tv.tv_sec = 1;
-    options.connect_timeout = &tv;
-
-
-    redisAsyncContext *c = redisAsyncConnectWithOptions(&options);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    redisLibeventAttach(c,base);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-    event_base_dispatch(base);
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-libuv.c b/redis-stable/deps/hiredis/examples/example-libuv.c
deleted file mode 100644
index cbde452b..00000000
--- a/redis-stable/deps/hiredis/examples/example-libuv.c
+++ /dev/null
@@ -1,56 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <signal.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/libuv.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-#ifndef _WIN32
-    signal(SIGPIPE, SIG_IGN);
-#endif
-
-    uv_loop_t* loop = uv_default_loop();
-
-    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    redisLibuvAttach(c,loop);
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-    uv_run(loop, UV_RUN_DEFAULT);
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example-macosx.c b/redis-stable/deps/hiredis/examples/example-macosx.c
deleted file mode 100644
index bc84ed5b..00000000
--- a/redis-stable/deps/hiredis/examples/example-macosx.c
+++ /dev/null
@@ -1,66 +0,0 @@
-//
-//  Created by Дмитрий Бахвалов on 13.07.15.
-//  Copyright (c) 2015 Dmitry Bakhvalov. All rights reserved.
-//
-
-#include <stdio.h>
-
-#include <hiredis.h>
-#include <async.h>
-#include <adapters/macosx.h>
-
-void getCallback(redisAsyncContext *c, void *r, void *privdata) {
-    redisReply *reply = r;
-    if (reply == NULL) return;
-    printf("argv[%s]: %s\n", (char*)privdata, reply->str);
-
-    /* Disconnect after receiving the reply to GET */
-    redisAsyncDisconnect(c);
-}
-
-void connectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    printf("Connected...\n");
-}
-
-void disconnectCallback(const redisAsyncContext *c, int status) {
-    if (status != REDIS_OK) {
-        printf("Error: %s\n", c->errstr);
-        return;
-    }
-    CFRunLoopStop(CFRunLoopGetCurrent());
-    printf("Disconnected...\n");
-}
-
-int main (int argc, char **argv) {
-    signal(SIGPIPE, SIG_IGN);
-
-    CFRunLoopRef loop = CFRunLoopGetCurrent();
-    if( !loop ) {
-        printf("Error: Cannot get current run loop\n");
-        return 1;
-    }
-
-    redisAsyncContext *c = redisAsyncConnect("127.0.0.1", 6379);
-    if (c->err) {
-        /* Let *c leak for now... */
-        printf("Error: %s\n", c->errstr);
-        return 1;
-    }
-
-    redisMacOSAttach(c, loop);
-
-    redisAsyncSetConnectCallback(c,connectCallback);
-    redisAsyncSetDisconnectCallback(c,disconnectCallback);
-
-    redisAsyncCommand(c, NULL, NULL, "SET key %b", argv[argc-1], strlen(argv[argc-1]));
-    redisAsyncCommand(c, getCallback, (char*)"end-1", "GET key");
-
-    CFRunLoopRun();
-
-    return 0;
-}
-
diff --git a/redis-stable/deps/hiredis/examples/example-push.c b/redis-stable/deps/hiredis/examples/example-push.c
deleted file mode 100644
index 2d4ab4dc..00000000
--- a/redis-stable/deps/hiredis/examples/example-push.c
+++ /dev/null
@@ -1,160 +0,0 @@
-/*
- * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <hiredis.h>
-#include <win32.h>
-
-#define KEY_COUNT 5
-
-#define panicAbort(fmt, ...) \
-    do { \
-        fprintf(stderr, "%s:%d:%s(): " fmt, __FILE__, __LINE__, __func__, __VA_ARGS__); \
-        exit(-1); \
-    } while (0)
-
-static void assertReplyAndFree(redisContext *context, redisReply *reply, int type) {
-    if (reply == NULL)
-        panicAbort("NULL reply from server (error: %s)", context->errstr);
-
-    if (reply->type != type) {
-        if (reply->type == REDIS_REPLY_ERROR)
-            fprintf(stderr, "Redis Error: %s\n", reply->str);
-
-        panicAbort("Expected reply type %d but got type %d", type, reply->type);
-    }
-
-    freeReplyObject(reply);
-}
-
-/* Switch to the RESP3 protocol and enable client tracking */
-static void enableClientTracking(redisContext *c) {
-    redisReply *reply = redisCommand(c, "HELLO 3");
-    if (reply == NULL || c->err) {
-        panicAbort("NULL reply or server error (error: %s)", c->errstr);
-    }
-
-    if (reply->type != REDIS_REPLY_MAP) {
-        fprintf(stderr, "Error: Can't send HELLO 3 command.  Are you sure you're ");
-        fprintf(stderr, "connected to redis-server >= 6.0.0?\nRedis error: %s\n",
-                        reply->type == REDIS_REPLY_ERROR ? reply->str : "(unknown)");
-        exit(-1);
-    }
-
-    freeReplyObject(reply);
-
-    /* Enable client tracking */
-    reply = redisCommand(c, "CLIENT TRACKING ON");
-    assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
-}
-
-void pushReplyHandler(void *privdata, void *r) {
-    redisReply *reply = r;
-    int *invalidations = privdata;
-
-    /* Sanity check on the invalidation reply */
-    if (reply->type != REDIS_REPLY_PUSH || reply->elements != 2 ||
-        reply->element[1]->type != REDIS_REPLY_ARRAY ||
-        reply->element[1]->element[0]->type != REDIS_REPLY_STRING)
-    {
-        panicAbort("%s", "Can't parse PUSH message!");
-    }
-
-    /* Increment our invalidation count */
-    *invalidations += 1;
-
-    printf("pushReplyHandler(): INVALIDATE '%s' (invalidation count: %d)\n",
-           reply->element[1]->element[0]->str, *invalidations);
-
-    freeReplyObject(reply);
-}
-
-/* We aren't actually freeing anything here, but it is included to show that we can
- * have hiredis call our data destructor when freeing the context */
-void privdata_dtor(void *privdata) {
-    unsigned int *icount = privdata;
-    printf("privdata_dtor():  In context privdata dtor (invalidations: %u)\n", *icount);
-}
-
-int main(int argc, char **argv) {
-    unsigned int j, invalidations = 0;
-    redisContext *c;
-    redisReply *reply;
-
-    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
-    int port = (argc > 2) ? atoi(argv[2]) : 6379;
-
-    redisOptions o = {0};
-    REDIS_OPTIONS_SET_TCP(&o, hostname, port);
-
-    /* Set our context privdata to the address of our invalidation counter.  Each
-     * time our PUSH handler is called, hiredis will pass the privdata for context.
-     *
-     * This could also be done after we create the context like so:
-     *
-     *    c->privdata = &invalidations;
-     *    c->free_privdata = privdata_dtor;
-     */
-    REDIS_OPTIONS_SET_PRIVDATA(&o, &invalidations, privdata_dtor);
-
-    /* Set our custom PUSH message handler */
-    o.push_cb = pushReplyHandler;
-
-    c = redisConnectWithOptions(&o);
-    if (c == NULL || c->err)
-        panicAbort("Connection error:  %s", c ? c->errstr : "OOM");
-
-    /* Enable RESP3 and turn on client tracking */
-    enableClientTracking(c);
-
-    /* Set some keys and then read them back.  Once we do that, Redis will deliver
-     * invalidation push messages whenever the key is modified */
-    for (j = 0; j < KEY_COUNT; j++) {
-        reply = redisCommand(c, "SET key:%d initial:%d", j, j);
-        assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
-
-        reply = redisCommand(c, "GET key:%d", j);
-        assertReplyAndFree(c, reply, REDIS_REPLY_STRING);
-    }
-
-    /* Trigger invalidation messages by updating keys we just read */
-    for (j = 0; j < KEY_COUNT; j++) {
-        printf("            main(): SET key:%d update:%d\n", j, j);
-        reply = redisCommand(c, "SET key:%d update:%d", j, j);
-        assertReplyAndFree(c, reply, REDIS_REPLY_STATUS);
-        printf("            main(): SET REPLY OK\n");
-    }
-
-    printf("\nTotal detected invalidations: %d, expected: %d\n", invalidations, KEY_COUNT);
-
-    /* PING server */
-    redisFree(c);
-}
diff --git a/redis-stable/deps/hiredis/examples/example-qt.cpp b/redis-stable/deps/hiredis/examples/example-qt.cpp
deleted file mode 100644
index f524c3f3..00000000
--- a/redis-stable/deps/hiredis/examples/example-qt.cpp
+++ /dev/null
@@ -1,46 +0,0 @@
-#include <iostream>
-using namespace std;
-
-#include <QCoreApplication>
-#include <QTimer>
-
-#include "example-qt.h"
-
-void getCallback(redisAsyncContext *, void * r, void * privdata) {
-
-    redisReply * reply = static_cast<redisReply *>(r);
-    ExampleQt * ex = static_cast<ExampleQt *>(privdata);
-    if (reply == nullptr || ex == nullptr) return;
-
-    cout << "key: " << reply->str << endl;
-
-    ex->finish();
-}
-
-void ExampleQt::run() {
-
-    m_ctx = redisAsyncConnect("localhost", 6379);
-
-    if (m_ctx->err) {
-        cerr << "Error: " << m_ctx->errstr << endl;
-        redisAsyncFree(m_ctx);
-        emit finished();
-    }
-
-    m_adapter.setContext(m_ctx);
-
-    redisAsyncCommand(m_ctx, NULL, NULL, "SET key %s", m_value);
-    redisAsyncCommand(m_ctx, getCallback, this, "GET key");
-}
-
-int main (int argc, char **argv) {
-
-    QCoreApplication app(argc, argv);
-
-    ExampleQt example(argv[argc-1]);
-
-    QObject::connect(&example, SIGNAL(finished()), &app, SLOT(quit()));
-    QTimer::singleShot(0, &example, SLOT(run()));
-
-    return app.exec();
-}
diff --git a/redis-stable/deps/hiredis/examples/example-qt.h b/redis-stable/deps/hiredis/examples/example-qt.h
deleted file mode 100644
index 374f4766..00000000
--- a/redis-stable/deps/hiredis/examples/example-qt.h
+++ /dev/null
@@ -1,32 +0,0 @@
-#ifndef __HIREDIS_EXAMPLE_QT_H
-#define __HIREDIS_EXAMPLE_QT_H
-
-#include <adapters/qt.h>
-
-class ExampleQt : public QObject {
-
-    Q_OBJECT
-
-    public:
-        ExampleQt(const char * value, QObject * parent = 0)
-            : QObject(parent), m_value(value) {}
-
-    signals:
-        void finished();
-
-    public slots:
-        void run();
-
-    private:
-        void finish() { emit finished(); }
-
-    private:
-        const char * m_value;
-        redisAsyncContext * m_ctx;
-        RedisQtAdapter m_adapter;
-
-    friend
-    void getCallback(redisAsyncContext *, void *, void *);
-};
-
-#endif /* !__HIREDIS_EXAMPLE_QT_H */
diff --git a/redis-stable/deps/hiredis/examples/example-ssl.c b/redis-stable/deps/hiredis/examples/example-ssl.c
deleted file mode 100644
index c754177c..00000000
--- a/redis-stable/deps/hiredis/examples/example-ssl.c
+++ /dev/null
@@ -1,110 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <hiredis.h>
-#include <hiredis_ssl.h>
-#include <win32.h>
-
-int main(int argc, char **argv) {
-    unsigned int j;
-    redisSSLContext *ssl;
-    redisSSLContextError ssl_error;
-    redisContext *c;
-    redisReply *reply;
-    if (argc < 4) {
-        printf("Usage: %s <host> <port> <cert> <key> [ca]\n", argv[0]);
-        exit(1);
-    }
-    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
-    int port = atoi(argv[2]);
-    const char *cert = argv[3];
-    const char *key = argv[4];
-    const char *ca = argc > 4 ? argv[5] : NULL;
-
-    redisInitOpenSSL();
-    ssl = redisCreateSSLContext(ca, NULL, cert, key, NULL, &ssl_error);
-    if (!ssl) {
-        printf("SSL Context error: %s\n",
-                redisSSLContextGetError(ssl_error));
-        exit(1);
-    }
-
-    struct timeval tv = { 1, 500000 }; // 1.5 seconds
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, hostname, port);
-    options.connect_timeout = &tv;
-    c = redisConnectWithOptions(&options);
-
-    if (c == NULL || c->err) {
-        if (c) {
-            printf("Connection error: %s\n", c->errstr);
-            redisFree(c);
-        } else {
-            printf("Connection error: can't allocate redis context\n");
-        }
-        exit(1);
-    }
-
-    if (redisInitiateSSLWithContext(c, ssl) != REDIS_OK) {
-        printf("Couldn't initialize SSL!\n");
-        printf("Error: %s\n", c->errstr);
-        redisFree(c);
-        exit(1);
-    }
-
-    /* PING server */
-    reply = redisCommand(c,"PING");
-    printf("PING: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Set a key */
-    reply = redisCommand(c,"SET %s %s", "foo", "hello world");
-    printf("SET: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Set a key using binary safe API */
-    reply = redisCommand(c,"SET %b %b", "bar", (size_t) 3, "hello", (size_t) 5);
-    printf("SET (binary API): %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Try a GET and two INCR */
-    reply = redisCommand(c,"GET foo");
-    printf("GET foo: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    reply = redisCommand(c,"INCR counter");
-    printf("INCR counter: %lld\n", reply->integer);
-    freeReplyObject(reply);
-    /* again ... */
-    reply = redisCommand(c,"INCR counter");
-    printf("INCR counter: %lld\n", reply->integer);
-    freeReplyObject(reply);
-
-    /* Create a list of numbers, from 0 to 9 */
-    reply = redisCommand(c,"DEL mylist");
-    freeReplyObject(reply);
-    for (j = 0; j < 10; j++) {
-        char buf[64];
-
-        snprintf(buf,64,"%u",j);
-        reply = redisCommand(c,"LPUSH mylist element-%s", buf);
-        freeReplyObject(reply);
-    }
-
-    /* Let's check what we have inside the list */
-    reply = redisCommand(c,"LRANGE mylist 0 -1");
-    if (reply->type == REDIS_REPLY_ARRAY) {
-        for (j = 0; j < reply->elements; j++) {
-            printf("%u) %s\n", j, reply->element[j]->str);
-        }
-    }
-    freeReplyObject(reply);
-
-    /* Disconnects and frees the context */
-    redisFree(c);
-
-    redisFreeSSLContext(ssl);
-
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/examples/example.c b/redis-stable/deps/hiredis/examples/example.c
deleted file mode 100644
index 15dacbd1..00000000
--- a/redis-stable/deps/hiredis/examples/example.c
+++ /dev/null
@@ -1,91 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <hiredis.h>
-#include <win32.h>
-
-int main(int argc, char **argv) {
-    unsigned int j, isunix = 0;
-    redisContext *c;
-    redisReply *reply;
-    const char *hostname = (argc > 1) ? argv[1] : "127.0.0.1";
-
-    if (argc > 2) {
-        if (*argv[2] == 'u' || *argv[2] == 'U') {
-            isunix = 1;
-            /* in this case, host is the path to the unix socket */
-            printf("Will connect to unix socket @%s\n", hostname);
-        }
-    }
-
-    int port = (argc > 2) ? atoi(argv[2]) : 6379;
-
-    struct timeval timeout = { 1, 500000 }; // 1.5 seconds
-    if (isunix) {
-        c = redisConnectUnixWithTimeout(hostname, timeout);
-    } else {
-        c = redisConnectWithTimeout(hostname, port, timeout);
-    }
-    if (c == NULL || c->err) {
-        if (c) {
-            printf("Connection error: %s\n", c->errstr);
-            redisFree(c);
-        } else {
-            printf("Connection error: can't allocate redis context\n");
-        }
-        exit(1);
-    }
-
-    /* PING server */
-    reply = redisCommand(c,"PING");
-    printf("PING: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Set a key */
-    reply = redisCommand(c,"SET %s %s", "foo", "hello world");
-    printf("SET: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Set a key using binary safe API */
-    reply = redisCommand(c,"SET %b %b", "bar", (size_t) 3, "hello", (size_t) 5);
-    printf("SET (binary API): %s\n", reply->str);
-    freeReplyObject(reply);
-
-    /* Try a GET and two INCR */
-    reply = redisCommand(c,"GET foo");
-    printf("GET foo: %s\n", reply->str);
-    freeReplyObject(reply);
-
-    reply = redisCommand(c,"INCR counter");
-    printf("INCR counter: %lld\n", reply->integer);
-    freeReplyObject(reply);
-    /* again ... */
-    reply = redisCommand(c,"INCR counter");
-    printf("INCR counter: %lld\n", reply->integer);
-    freeReplyObject(reply);
-
-    /* Create a list of numbers, from 0 to 9 */
-    reply = redisCommand(c,"DEL mylist");
-    freeReplyObject(reply);
-    for (j = 0; j < 10; j++) {
-        char buf[64];
-
-        snprintf(buf,64,"%u",j);
-        reply = redisCommand(c,"LPUSH mylist element-%s", buf);
-        freeReplyObject(reply);
-    }
-
-    /* Let's check what we have inside the list */
-    reply = redisCommand(c,"LRANGE mylist 0 -1");
-    if (reply->type == REDIS_REPLY_ARRAY) {
-        for (j = 0; j < reply->elements; j++) {
-            printf("%u) %s\n", j, reply->element[j]->str);
-        }
-    }
-    freeReplyObject(reply);
-
-    /* Disconnects and frees the context */
-    redisFree(c);
-
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/fmacros.h b/redis-stable/deps/hiredis/fmacros.h
deleted file mode 100644
index 3227faaf..00000000
--- a/redis-stable/deps/hiredis/fmacros.h
+++ /dev/null
@@ -1,12 +0,0 @@
-#ifndef __HIREDIS_FMACRO_H
-#define __HIREDIS_FMACRO_H
-
-#define _XOPEN_SOURCE 600
-#define _POSIX_C_SOURCE 200112L
-
-#if defined(__APPLE__) && defined(__MACH__)
-/* Enable TCP_KEEPALIVE */
-#define _DARWIN_C_SOURCE
-#endif
-
-#endif
diff --git a/redis-stable/deps/hiredis/hiredis-config.cmake.in b/redis-stable/deps/hiredis/hiredis-config.cmake.in
deleted file mode 100644
index 98851dce..00000000
--- a/redis-stable/deps/hiredis/hiredis-config.cmake.in
+++ /dev/null
@@ -1,13 +0,0 @@
-@PACKAGE_INIT@
-
-set_and_check(hiredis_INCLUDEDIR "@PACKAGE_INCLUDE_INSTALL_DIR@")
-
-IF (NOT TARGET hiredis::hiredis)
-	INCLUDE(${CMAKE_CURRENT_LIST_DIR}/hiredis-targets.cmake)
-ENDIF()
-
-SET(hiredis_LIBRARIES hiredis::hiredis)
-SET(hiredis_INCLUDE_DIRS ${hiredis_INCLUDEDIR})
-
-check_required_components(hiredis)
-
diff --git a/redis-stable/deps/hiredis/hiredis.c b/redis-stable/deps/hiredis/hiredis.c
deleted file mode 100644
index 990f6196..00000000
--- a/redis-stable/deps/hiredis/hiredis.c
+++ /dev/null
@@ -1,1175 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
- *                     Jan-Erik Rediger <janerik at fnordig dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include <string.h>
-#include <stdlib.h>
-#include <assert.h>
-#include <errno.h>
-#include <ctype.h>
-
-#include "hiredis.h"
-#include "net.h"
-#include "sds.h"
-#include "async.h"
-#include "win32.h"
-
-extern int redisContextUpdateConnectTimeout(redisContext *c, const struct timeval *timeout);
-extern int redisContextUpdateCommandTimeout(redisContext *c, const struct timeval *timeout);
-
-static redisContextFuncs redisContextDefaultFuncs = {
-    .free_privctx = NULL,
-    .async_read = redisAsyncRead,
-    .async_write = redisAsyncWrite,
-    .read = redisNetRead,
-    .write = redisNetWrite
-};
-
-static redisReply *createReplyObject(int type);
-static void *createStringObject(const redisReadTask *task, char *str, size_t len);
-static void *createArrayObject(const redisReadTask *task, size_t elements);
-static void *createIntegerObject(const redisReadTask *task, long long value);
-static void *createDoubleObject(const redisReadTask *task, double value, char *str, size_t len);
-static void *createNilObject(const redisReadTask *task);
-static void *createBoolObject(const redisReadTask *task, int bval);
-
-/* Default set of functions to build the reply. Keep in mind that such a
- * function returning NULL is interpreted as OOM. */
-static redisReplyObjectFunctions defaultFunctions = {
-    createStringObject,
-    createArrayObject,
-    createIntegerObject,
-    createDoubleObject,
-    createNilObject,
-    createBoolObject,
-    freeReplyObject
-};
-
-/* Create a reply object */
-static redisReply *createReplyObject(int type) {
-    redisReply *r = hi_calloc(1,sizeof(*r));
-
-    if (r == NULL)
-        return NULL;
-
-    r->type = type;
-    return r;
-}
-
-/* Free a reply object */
-void freeReplyObject(void *reply) {
-    redisReply *r = reply;
-    size_t j;
-
-    if (r == NULL)
-        return;
-
-    switch(r->type) {
-    case REDIS_REPLY_INTEGER:
-        break; /* Nothing to free */
-    case REDIS_REPLY_ARRAY:
-    case REDIS_REPLY_MAP:
-    case REDIS_REPLY_SET:
-    case REDIS_REPLY_PUSH:
-        if (r->element != NULL) {
-            for (j = 0; j < r->elements; j++)
-                freeReplyObject(r->element[j]);
-            hi_free(r->element);
-        }
-        break;
-    case REDIS_REPLY_ERROR:
-    case REDIS_REPLY_STATUS:
-    case REDIS_REPLY_STRING:
-    case REDIS_REPLY_DOUBLE:
-    case REDIS_REPLY_VERB:
-        hi_free(r->str);
-        break;
-    }
-    hi_free(r);
-}
-
-static void *createStringObject(const redisReadTask *task, char *str, size_t len) {
-    redisReply *r, *parent;
-    char *buf;
-
-    r = createReplyObject(task->type);
-    if (r == NULL)
-        return NULL;
-
-    assert(task->type == REDIS_REPLY_ERROR  ||
-           task->type == REDIS_REPLY_STATUS ||
-           task->type == REDIS_REPLY_STRING ||
-           task->type == REDIS_REPLY_VERB);
-
-    /* Copy string value */
-    if (task->type == REDIS_REPLY_VERB) {
-        buf = hi_malloc(len-4+1); /* Skip 4 bytes of verbatim type header. */
-        if (buf == NULL) goto oom;
-
-        memcpy(r->vtype,str,3);
-        r->vtype[3] = '\0';
-        memcpy(buf,str+4,len-4);
-        buf[len-4] = '\0';
-        r->len = len - 4;
-    } else {
-        buf = hi_malloc(len+1);
-        if (buf == NULL) goto oom;
-
-        memcpy(buf,str,len);
-        buf[len] = '\0';
-        r->len = len;
-    }
-    r->str = buf;
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET ||
-               parent->type == REDIS_REPLY_PUSH);
-        parent->element[task->idx] = r;
-    }
-    return r;
-
-oom:
-    freeReplyObject(r);
-    return NULL;
-}
-
-static void *createArrayObject(const redisReadTask *task, size_t elements) {
-    redisReply *r, *parent;
-
-    r = createReplyObject(task->type);
-    if (r == NULL)
-        return NULL;
-
-    if (elements > 0) {
-        if (SIZE_MAX / sizeof(redisReply*) < elements) return NULL;  /* Don't overflow */
-        r->element = hi_calloc(elements,sizeof(redisReply*));
-        if (r->element == NULL) {
-            freeReplyObject(r);
-            return NULL;
-        }
-    }
-
-    r->elements = elements;
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET ||
-               parent->type == REDIS_REPLY_PUSH);
-        parent->element[task->idx] = r;
-    }
-    return r;
-}
-
-static void *createIntegerObject(const redisReadTask *task, long long value) {
-    redisReply *r, *parent;
-
-    r = createReplyObject(REDIS_REPLY_INTEGER);
-    if (r == NULL)
-        return NULL;
-
-    r->integer = value;
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET ||
-               parent->type == REDIS_REPLY_PUSH);
-        parent->element[task->idx] = r;
-    }
-    return r;
-}
-
-static void *createDoubleObject(const redisReadTask *task, double value, char *str, size_t len) {
-    redisReply *r, *parent;
-
-    r = createReplyObject(REDIS_REPLY_DOUBLE);
-    if (r == NULL)
-        return NULL;
-
-    r->dval = value;
-    r->str = hi_malloc(len+1);
-    if (r->str == NULL) {
-        freeReplyObject(r);
-        return NULL;
-    }
-
-    /* The double reply also has the original protocol string representing a
-     * double as a null terminated string. This way the caller does not need
-     * to format back for string conversion, especially since Redis does efforts
-     * to make the string more human readable avoiding the calssical double
-     * decimal string conversion artifacts. */
-    memcpy(r->str, str, len);
-    r->str[len] = '\0';
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET);
-        parent->element[task->idx] = r;
-    }
-    return r;
-}
-
-static void *createNilObject(const redisReadTask *task) {
-    redisReply *r, *parent;
-
-    r = createReplyObject(REDIS_REPLY_NIL);
-    if (r == NULL)
-        return NULL;
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET ||
-               parent->type == REDIS_REPLY_PUSH);
-        parent->element[task->idx] = r;
-    }
-    return r;
-}
-
-static void *createBoolObject(const redisReadTask *task, int bval) {
-    redisReply *r, *parent;
-
-    r = createReplyObject(REDIS_REPLY_BOOL);
-    if (r == NULL)
-        return NULL;
-
-    r->integer = bval != 0;
-
-    if (task->parent) {
-        parent = task->parent->obj;
-        assert(parent->type == REDIS_REPLY_ARRAY ||
-               parent->type == REDIS_REPLY_MAP ||
-               parent->type == REDIS_REPLY_SET);
-        parent->element[task->idx] = r;
-    }
-    return r;
-}
-
-/* Return the number of digits of 'v' when converted to string in radix 10.
- * Implementation borrowed from link in redis/src/util.c:string2ll(). */
-static uint32_t countDigits(uint64_t v) {
-  uint32_t result = 1;
-  for (;;) {
-    if (v < 10) return result;
-    if (v < 100) return result + 1;
-    if (v < 1000) return result + 2;
-    if (v < 10000) return result + 3;
-    v /= 10000U;
-    result += 4;
-  }
-}
-
-/* Helper that calculates the bulk length given a certain string length. */
-static size_t bulklen(size_t len) {
-    return 1+countDigits(len)+2+len+2;
-}
-
-int redisvFormatCommand(char **target, const char *format, va_list ap) {
-    const char *c = format;
-    char *cmd = NULL; /* final command */
-    int pos; /* position in final command */
-    hisds curarg, newarg; /* current argument */
-    int touched = 0; /* was the current argument touched? */
-    char **curargv = NULL, **newargv = NULL;
-    int argc = 0;
-    int totlen = 0;
-    int error_type = 0; /* 0 = no error; -1 = memory error; -2 = format error */
-    int j;
-
-    /* Abort if there is not target to set */
-    if (target == NULL)
-        return -1;
-
-    /* Build the command string accordingly to protocol */
-    curarg = hi_sdsempty();
-    if (curarg == NULL)
-        return -1;
-
-    while(*c != '\0') {
-        if (*c != '%' || c[1] == '\0') {
-            if (*c == ' ') {
-                if (touched) {
-                    newargv = hi_realloc(curargv,sizeof(char*)*(argc+1));
-                    if (newargv == NULL) goto memory_err;
-                    curargv = newargv;
-                    curargv[argc++] = curarg;
-                    totlen += bulklen(hi_sdslen(curarg));
-
-                    /* curarg is put in argv so it can be overwritten. */
-                    curarg = hi_sdsempty();
-                    if (curarg == NULL) goto memory_err;
-                    touched = 0;
-                }
-            } else {
-                newarg = hi_sdscatlen(curarg,c,1);
-                if (newarg == NULL) goto memory_err;
-                curarg = newarg;
-                touched = 1;
-            }
-        } else {
-            char *arg;
-            size_t size;
-
-            /* Set newarg so it can be checked even if it is not touched. */
-            newarg = curarg;
-
-            switch(c[1]) {
-            case 's':
-                arg = va_arg(ap,char*);
-                size = strlen(arg);
-                if (size > 0)
-                    newarg = hi_sdscatlen(curarg,arg,size);
-                break;
-            case 'b':
-                arg = va_arg(ap,char*);
-                size = va_arg(ap,size_t);
-                if (size > 0)
-                    newarg = hi_sdscatlen(curarg,arg,size);
-                break;
-            case '%':
-                newarg = hi_sdscat(curarg,"%");
-                break;
-            default:
-                /* Try to detect printf format */
-                {
-                    static const char intfmts[] = "diouxX";
-                    static const char flags[] = "#0-+ ";
-                    char _format[16];
-                    const char *_p = c+1;
-                    size_t _l = 0;
-                    va_list _cpy;
-
-                    /* Flags */
-                    while (*_p != '\0' && strchr(flags,*_p) != NULL) _p++;
-
-                    /* Field width */
-                    while (*_p != '\0' && isdigit(*_p)) _p++;
-
-                    /* Precision */
-                    if (*_p == '.') {
-                        _p++;
-                        while (*_p != '\0' && isdigit(*_p)) _p++;
-                    }
-
-                    /* Copy va_list before consuming with va_arg */
-                    va_copy(_cpy,ap);
-
-                    /* Integer conversion (without modifiers) */
-                    if (strchr(intfmts,*_p) != NULL) {
-                        va_arg(ap,int);
-                        goto fmt_valid;
-                    }
-
-                    /* Double conversion (without modifiers) */
-                    if (strchr("eEfFgGaA",*_p) != NULL) {
-                        va_arg(ap,double);
-                        goto fmt_valid;
-                    }
-
-                    /* Size: char */
-                    if (_p[0] == 'h' && _p[1] == 'h') {
-                        _p += 2;
-                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
-                            va_arg(ap,int); /* char gets promoted to int */
-                            goto fmt_valid;
-                        }
-                        goto fmt_invalid;
-                    }
-
-                    /* Size: short */
-                    if (_p[0] == 'h') {
-                        _p += 1;
-                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
-                            va_arg(ap,int); /* short gets promoted to int */
-                            goto fmt_valid;
-                        }
-                        goto fmt_invalid;
-                    }
-
-                    /* Size: long long */
-                    if (_p[0] == 'l' && _p[1] == 'l') {
-                        _p += 2;
-                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
-                            va_arg(ap,long long);
-                            goto fmt_valid;
-                        }
-                        goto fmt_invalid;
-                    }
-
-                    /* Size: long */
-                    if (_p[0] == 'l') {
-                        _p += 1;
-                        if (*_p != '\0' && strchr(intfmts,*_p) != NULL) {
-                            va_arg(ap,long);
-                            goto fmt_valid;
-                        }
-                        goto fmt_invalid;
-                    }
-
-                fmt_invalid:
-                    va_end(_cpy);
-                    goto format_err;
-
-                fmt_valid:
-                    _l = (_p+1)-c;
-                    if (_l < sizeof(_format)-2) {
-                        memcpy(_format,c,_l);
-                        _format[_l] = '\0';
-                        newarg = hi_sdscatvprintf(curarg,_format,_cpy);
-
-                        /* Update current position (note: outer blocks
-                         * increment c twice so compensate here) */
-                        c = _p-1;
-                    }
-
-                    va_end(_cpy);
-                    break;
-                }
-            }
-
-            if (newarg == NULL) goto memory_err;
-            curarg = newarg;
-
-            touched = 1;
-            c++;
-        }
-        c++;
-    }
-
-    /* Add the last argument if needed */
-    if (touched) {
-        newargv = hi_realloc(curargv,sizeof(char*)*(argc+1));
-        if (newargv == NULL) goto memory_err;
-        curargv = newargv;
-        curargv[argc++] = curarg;
-        totlen += bulklen(hi_sdslen(curarg));
-    } else {
-        hi_sdsfree(curarg);
-    }
-
-    /* Clear curarg because it was put in curargv or was free'd. */
-    curarg = NULL;
-
-    /* Add bytes needed to hold multi bulk count */
-    totlen += 1+countDigits(argc)+2;
-
-    /* Build the command at protocol level */
-    cmd = hi_malloc(totlen+1);
-    if (cmd == NULL) goto memory_err;
-
-    pos = sprintf(cmd,"*%d\r\n",argc);
-    for (j = 0; j < argc; j++) {
-        pos += sprintf(cmd+pos,"$%zu\r\n",hi_sdslen(curargv[j]));
-        memcpy(cmd+pos,curargv[j],hi_sdslen(curargv[j]));
-        pos += hi_sdslen(curargv[j]);
-        hi_sdsfree(curargv[j]);
-        cmd[pos++] = '\r';
-        cmd[pos++] = '\n';
-    }
-    assert(pos == totlen);
-    cmd[pos] = '\0';
-
-    hi_free(curargv);
-    *target = cmd;
-    return totlen;
-
-format_err:
-    error_type = -2;
-    goto cleanup;
-
-memory_err:
-    error_type = -1;
-    goto cleanup;
-
-cleanup:
-    if (curargv) {
-        while(argc--)
-            hi_sdsfree(curargv[argc]);
-        hi_free(curargv);
-    }
-
-    hi_sdsfree(curarg);
-    hi_free(cmd);
-
-    return error_type;
-}
-
-/* Format a command according to the Redis protocol. This function
- * takes a format similar to printf:
- *
- * %s represents a C null terminated string you want to interpolate
- * %b represents a binary safe string
- *
- * When using %b you need to provide both the pointer to the string
- * and the length in bytes as a size_t. Examples:
- *
- * len = redisFormatCommand(target, "GET %s", mykey);
- * len = redisFormatCommand(target, "SET %s %b", mykey, myval, myvallen);
- */
-int redisFormatCommand(char **target, const char *format, ...) {
-    va_list ap;
-    int len;
-    va_start(ap,format);
-    len = redisvFormatCommand(target,format,ap);
-    va_end(ap);
-
-    /* The API says "-1" means bad result, but we now also return "-2" in some
-     * cases.  Force the return value to always be -1. */
-    if (len < 0)
-        len = -1;
-
-    return len;
-}
-
-/* Format a command according to the Redis protocol using an hisds string and
- * hi_sdscatfmt for the processing of arguments. This function takes the
- * number of arguments, an array with arguments and an array with their
- * lengths. If the latter is set to NULL, strlen will be used to compute the
- * argument lengths.
- */
-int redisFormatSdsCommandArgv(hisds *target, int argc, const char **argv,
-                              const size_t *argvlen)
-{
-    hisds cmd, aux;
-    unsigned long long totlen;
-    int j;
-    size_t len;
-
-    /* Abort on a NULL target */
-    if (target == NULL)
-        return -1;
-
-    /* Calculate our total size */
-    totlen = 1+countDigits(argc)+2;
-    for (j = 0; j < argc; j++) {
-        len = argvlen ? argvlen[j] : strlen(argv[j]);
-        totlen += bulklen(len);
-    }
-
-    /* Use an SDS string for command construction */
-    cmd = hi_sdsempty();
-    if (cmd == NULL)
-        return -1;
-
-    /* We already know how much storage we need */
-    aux = hi_sdsMakeRoomFor(cmd, totlen);
-    if (aux == NULL) {
-        hi_sdsfree(cmd);
-        return -1;
-    }
-
-    cmd = aux;
-
-    /* Construct command */
-    cmd = hi_sdscatfmt(cmd, "*%i\r\n", argc);
-    for (j=0; j < argc; j++) {
-        len = argvlen ? argvlen[j] : strlen(argv[j]);
-        cmd = hi_sdscatfmt(cmd, "$%u\r\n", len);
-        cmd = hi_sdscatlen(cmd, argv[j], len);
-        cmd = hi_sdscatlen(cmd, "\r\n", sizeof("\r\n")-1);
-    }
-
-    assert(hi_sdslen(cmd)==totlen);
-
-    *target = cmd;
-    return totlen;
-}
-
-void redisFreeSdsCommand(hisds cmd) {
-    hi_sdsfree(cmd);
-}
-
-/* Format a command according to the Redis protocol. This function takes the
- * number of arguments, an array with arguments and an array with their
- * lengths. If the latter is set to NULL, strlen will be used to compute the
- * argument lengths.
- */
-int redisFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen) {
-    char *cmd = NULL; /* final command */
-    int pos; /* position in final command */
-    size_t len;
-    int totlen, j;
-
-    /* Abort on a NULL target */
-    if (target == NULL)
-        return -1;
-
-    /* Calculate number of bytes needed for the command */
-    totlen = 1+countDigits(argc)+2;
-    for (j = 0; j < argc; j++) {
-        len = argvlen ? argvlen[j] : strlen(argv[j]);
-        totlen += bulklen(len);
-    }
-
-    /* Build the command at protocol level */
-    cmd = hi_malloc(totlen+1);
-    if (cmd == NULL)
-        return -1;
-
-    pos = sprintf(cmd,"*%d\r\n",argc);
-    for (j = 0; j < argc; j++) {
-        len = argvlen ? argvlen[j] : strlen(argv[j]);
-        pos += sprintf(cmd+pos,"$%zu\r\n",len);
-        memcpy(cmd+pos,argv[j],len);
-        pos += len;
-        cmd[pos++] = '\r';
-        cmd[pos++] = '\n';
-    }
-    assert(pos == totlen);
-    cmd[pos] = '\0';
-
-    *target = cmd;
-    return totlen;
-}
-
-void redisFreeCommand(char *cmd) {
-    hi_free(cmd);
-}
-
-void __redisSetError(redisContext *c, int type, const char *str) {
-    size_t len;
-
-    c->err = type;
-    if (str != NULL) {
-        len = strlen(str);
-        len = len < (sizeof(c->errstr)-1) ? len : (sizeof(c->errstr)-1);
-        memcpy(c->errstr,str,len);
-        c->errstr[len] = '\0';
-    } else {
-        /* Only REDIS_ERR_IO may lack a description! */
-        assert(type == REDIS_ERR_IO);
-        strerror_r(errno, c->errstr, sizeof(c->errstr));
-    }
-}
-
-redisReader *redisReaderCreate(void) {
-    return redisReaderCreateWithFunctions(&defaultFunctions);
-}
-
-static void redisPushAutoFree(void *privdata, void *reply) {
-    (void)privdata;
-    freeReplyObject(reply);
-}
-
-static redisContext *redisContextInit(void) {
-    redisContext *c;
-
-    c = hi_calloc(1, sizeof(*c));
-    if (c == NULL)
-        return NULL;
-
-    c->funcs = &redisContextDefaultFuncs;
-
-    c->obuf = hi_sdsempty();
-    c->reader = redisReaderCreate();
-    c->fd = REDIS_INVALID_FD;
-
-    if (c->obuf == NULL || c->reader == NULL) {
-        redisFree(c);
-        return NULL;
-    }
-
-    return c;
-}
-
-void redisFree(redisContext *c) {
-    if (c == NULL)
-        return;
-    redisNetClose(c);
-
-    hi_sdsfree(c->obuf);
-    redisReaderFree(c->reader);
-    hi_free(c->tcp.host);
-    hi_free(c->tcp.source_addr);
-    hi_free(c->unix_sock.path);
-    hi_free(c->connect_timeout);
-    hi_free(c->command_timeout);
-    hi_free(c->saddr);
-
-    if (c->privdata && c->free_privdata)
-        c->free_privdata(c->privdata);
-
-    if (c->funcs->free_privctx)
-        c->funcs->free_privctx(c->privctx);
-
-    memset(c, 0xff, sizeof(*c));
-    hi_free(c);
-}
-
-redisFD redisFreeKeepFd(redisContext *c) {
-    redisFD fd = c->fd;
-    c->fd = REDIS_INVALID_FD;
-    redisFree(c);
-    return fd;
-}
-
-int redisReconnect(redisContext *c) {
-    c->err = 0;
-    memset(c->errstr, '\0', strlen(c->errstr));
-
-    if (c->privctx && c->funcs->free_privctx) {
-        c->funcs->free_privctx(c->privctx);
-        c->privctx = NULL;
-    }
-
-    redisNetClose(c);
-
-    hi_sdsfree(c->obuf);
-    redisReaderFree(c->reader);
-
-    c->obuf = hi_sdsempty();
-    c->reader = redisReaderCreate();
-
-    if (c->obuf == NULL || c->reader == NULL) {
-        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-        return REDIS_ERR;
-    }
-
-    int ret = REDIS_ERR;
-    if (c->connection_type == REDIS_CONN_TCP) {
-        ret = redisContextConnectBindTcp(c, c->tcp.host, c->tcp.port,
-               c->connect_timeout, c->tcp.source_addr);
-    } else if (c->connection_type == REDIS_CONN_UNIX) {
-        ret = redisContextConnectUnix(c, c->unix_sock.path, c->connect_timeout);
-    } else {
-        /* Something bad happened here and shouldn't have. There isn't
-           enough information in the context to reconnect. */
-        __redisSetError(c,REDIS_ERR_OTHER,"Not enough information to reconnect");
-        ret = REDIS_ERR;
-    }
-
-    if (c->command_timeout != NULL && (c->flags & REDIS_BLOCK) && c->fd != REDIS_INVALID_FD) {
-        redisContextSetTimeout(c, *c->command_timeout);
-    }
-
-    return ret;
-}
-
-redisContext *redisConnectWithOptions(const redisOptions *options) {
-    redisContext *c = redisContextInit();
-    if (c == NULL) {
-        return NULL;
-    }
-    if (!(options->options & REDIS_OPT_NONBLOCK)) {
-        c->flags |= REDIS_BLOCK;
-    }
-    if (options->options & REDIS_OPT_REUSEADDR) {
-        c->flags |= REDIS_REUSEADDR;
-    }
-    if (options->options & REDIS_OPT_NOAUTOFREE) {
-        c->flags |= REDIS_NO_AUTO_FREE;
-    }
-
-    /* Set any user supplied RESP3 PUSH handler or use freeReplyObject
-     * as a default unless specifically flagged that we don't want one. */
-    if (options->push_cb != NULL)
-        redisSetPushCallback(c, options->push_cb);
-    else if (!(options->options & REDIS_OPT_NO_PUSH_AUTOFREE))
-        redisSetPushCallback(c, redisPushAutoFree);
-
-    c->privdata = options->privdata;
-    c->free_privdata = options->free_privdata;
-
-    if (redisContextUpdateConnectTimeout(c, options->connect_timeout) != REDIS_OK ||
-        redisContextUpdateCommandTimeout(c, options->command_timeout) != REDIS_OK) {
-        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-        return c;
-    }
-
-    if (options->type == REDIS_CONN_TCP) {
-        redisContextConnectBindTcp(c, options->endpoint.tcp.ip,
-                                   options->endpoint.tcp.port, options->connect_timeout,
-                                   options->endpoint.tcp.source_addr);
-    } else if (options->type == REDIS_CONN_UNIX) {
-        redisContextConnectUnix(c, options->endpoint.unix_socket,
-                                options->connect_timeout);
-    } else if (options->type == REDIS_CONN_USERFD) {
-        c->fd = options->endpoint.fd;
-        c->flags |= REDIS_CONNECTED;
-    } else {
-        // Unknown type - FIXME - FREE
-        return NULL;
-    }
-
-    if (options->command_timeout != NULL && (c->flags & REDIS_BLOCK) && c->fd != REDIS_INVALID_FD) {
-        redisContextSetTimeout(c, *options->command_timeout);
-    }
-
-    return c;
-}
-
-/* Connect to a Redis instance. On error the field error in the returned
- * context will be set to the return value of the error function.
- * When no set of reply functions is given, the default set will be used. */
-redisContext *redisConnect(const char *ip, int port) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectWithTimeout(const char *ip, int port, const struct timeval tv) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.connect_timeout = &tv;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectNonBlock(const char *ip, int port) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.options |= REDIS_OPT_NONBLOCK;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectBindNonBlock(const char *ip, int port,
-                                       const char *source_addr) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.endpoint.tcp.source_addr = source_addr;
-    options.options |= REDIS_OPT_NONBLOCK;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectBindNonBlockWithReuse(const char *ip, int port,
-                                                const char *source_addr) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, ip, port);
-    options.endpoint.tcp.source_addr = source_addr;
-    options.options |= REDIS_OPT_NONBLOCK|REDIS_OPT_REUSEADDR;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectUnix(const char *path) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_UNIX(&options, path);
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectUnixWithTimeout(const char *path, const struct timeval tv) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_UNIX(&options, path);
-    options.connect_timeout = &tv;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectUnixNonBlock(const char *path) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_UNIX(&options, path);
-    options.options |= REDIS_OPT_NONBLOCK;
-    return redisConnectWithOptions(&options);
-}
-
-redisContext *redisConnectFd(redisFD fd) {
-    redisOptions options = {0};
-    options.type = REDIS_CONN_USERFD;
-    options.endpoint.fd = fd;
-    return redisConnectWithOptions(&options);
-}
-
-/* Set read/write timeout on a blocking socket. */
-int redisSetTimeout(redisContext *c, const struct timeval tv) {
-    if (c->flags & REDIS_BLOCK)
-        return redisContextSetTimeout(c,tv);
-    return REDIS_ERR;
-}
-
-/* Enable connection KeepAlive. */
-int redisEnableKeepAlive(redisContext *c) {
-    if (redisKeepAlive(c, REDIS_KEEPALIVE_INTERVAL) != REDIS_OK)
-        return REDIS_ERR;
-    return REDIS_OK;
-}
-
-/* Set a user provided RESP3 PUSH handler and return any old one set. */
-redisPushFn *redisSetPushCallback(redisContext *c, redisPushFn *fn) {
-    redisPushFn *old = c->push_cb;
-    c->push_cb = fn;
-    return old;
-}
-
-/* Use this function to handle a read event on the descriptor. It will try
- * and read some bytes from the socket and feed them to the reply parser.
- *
- * After this function is called, you may use redisGetReplyFromReader to
- * see if there is a reply available. */
-int redisBufferRead(redisContext *c) {
-    char buf[1024*16];
-    int nread;
-
-    /* Return early when the context has seen an error. */
-    if (c->err)
-        return REDIS_ERR;
-
-    nread = c->funcs->read(c, buf, sizeof(buf));
-    if (nread > 0) {
-        if (redisReaderFeed(c->reader, buf, nread) != REDIS_OK) {
-            __redisSetError(c, c->reader->err, c->reader->errstr);
-            return REDIS_ERR;
-        } else {
-        }
-    } else if (nread < 0) {
-        return REDIS_ERR;
-    }
-    return REDIS_OK;
-}
-
-/* Write the output buffer to the socket.
- *
- * Returns REDIS_OK when the buffer is empty, or (a part of) the buffer was
- * successfully written to the socket. When the buffer is empty after the
- * write operation, "done" is set to 1 (if given).
- *
- * Returns REDIS_ERR if an error occurred trying to write and sets
- * c->errstr to hold the appropriate error string.
- */
-int redisBufferWrite(redisContext *c, int *done) {
-
-    /* Return early when the context has seen an error. */
-    if (c->err)
-        return REDIS_ERR;
-
-    if (hi_sdslen(c->obuf) > 0) {
-        ssize_t nwritten = c->funcs->write(c);
-        if (nwritten < 0) {
-            return REDIS_ERR;
-        } else if (nwritten > 0) {
-            if (nwritten == (ssize_t)hi_sdslen(c->obuf)) {
-                hi_sdsfree(c->obuf);
-                c->obuf = hi_sdsempty();
-                if (c->obuf == NULL)
-                    goto oom;
-            } else {
-                if (hi_sdsrange(c->obuf,nwritten,-1) < 0) goto oom;
-            }
-        }
-    }
-    if (done != NULL) *done = (hi_sdslen(c->obuf) == 0);
-    return REDIS_OK;
-
-oom:
-    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-    return REDIS_ERR;
-}
-
-/* Internal helper function to try and get a reply from the reader,
- * or set an error in the context otherwise. */
-int redisGetReplyFromReader(redisContext *c, void **reply) {
-    if (redisReaderGetReply(c->reader,reply) == REDIS_ERR) {
-        __redisSetError(c,c->reader->err,c->reader->errstr);
-        return REDIS_ERR;
-    }
-
-    return REDIS_OK;
-}
-
-/* Internal helper that returns 1 if the reply was a RESP3 PUSH
- * message and we handled it with a user-provided callback. */
-static int redisHandledPushReply(redisContext *c, void *reply) {
-    if (reply && c->push_cb && redisIsPushReply(reply)) {
-        c->push_cb(c->privdata, reply);
-        return 1;
-    }
-
-    return 0;
-}
-
-int redisGetReply(redisContext *c, void **reply) {
-    int wdone = 0;
-    void *aux = NULL;
-
-    /* Try to read pending replies */
-    if (redisGetReplyFromReader(c,&aux) == REDIS_ERR)
-        return REDIS_ERR;
-
-    /* For the blocking context, flush output buffer and read reply */
-    if (aux == NULL && c->flags & REDIS_BLOCK) {
-        /* Write until done */
-        do {
-            if (redisBufferWrite(c,&wdone) == REDIS_ERR)
-                return REDIS_ERR;
-        } while (!wdone);
-
-        /* Read until there is a reply */
-        do {
-            if (redisBufferRead(c) == REDIS_ERR)
-                return REDIS_ERR;
-
-            /* We loop here in case the user has specified a RESP3
-             * PUSH handler (e.g. for client tracking). */
-            do {
-                if (redisGetReplyFromReader(c,&aux) == REDIS_ERR)
-                    return REDIS_ERR;
-            } while (redisHandledPushReply(c, aux));
-        } while (aux == NULL);
-    }
-
-    /* Set reply or free it if we were passed NULL */
-    if (reply != NULL) {
-        *reply = aux;
-    } else {
-        freeReplyObject(aux);
-    }
-
-    return REDIS_OK;
-}
-
-
-/* Helper function for the redisAppendCommand* family of functions.
- *
- * Write a formatted command to the output buffer. When this family
- * is used, you need to call redisGetReply yourself to retrieve
- * the reply (or replies in pub/sub).
- */
-int __redisAppendCommand(redisContext *c, const char *cmd, size_t len) {
-    hisds newbuf;
-
-    newbuf = hi_sdscatlen(c->obuf,cmd,len);
-    if (newbuf == NULL) {
-        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
-        return REDIS_ERR;
-    }
-
-    c->obuf = newbuf;
-    return REDIS_OK;
-}
-
-int redisAppendFormattedCommand(redisContext *c, const char *cmd, size_t len) {
-
-    if (__redisAppendCommand(c, cmd, len) != REDIS_OK) {
-        return REDIS_ERR;
-    }
-
-    return REDIS_OK;
-}
-
-int redisvAppendCommand(redisContext *c, const char *format, va_list ap) {
-    char *cmd;
-    int len;
-
-    len = redisvFormatCommand(&cmd,format,ap);
-    if (len == -1) {
-        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
-        return REDIS_ERR;
-    } else if (len == -2) {
-        __redisSetError(c,REDIS_ERR_OTHER,"Invalid format string");
-        return REDIS_ERR;
-    }
-
-    if (__redisAppendCommand(c,cmd,len) != REDIS_OK) {
-        hi_free(cmd);
-        return REDIS_ERR;
-    }
-
-    hi_free(cmd);
-    return REDIS_OK;
-}
-
-int redisAppendCommand(redisContext *c, const char *format, ...) {
-    va_list ap;
-    int ret;
-
-    va_start(ap,format);
-    ret = redisvAppendCommand(c,format,ap);
-    va_end(ap);
-    return ret;
-}
-
-int redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen) {
-    hisds cmd;
-    int len;
-
-    len = redisFormatSdsCommandArgv(&cmd,argc,argv,argvlen);
-    if (len == -1) {
-        __redisSetError(c,REDIS_ERR_OOM,"Out of memory");
-        return REDIS_ERR;
-    }
-
-    if (__redisAppendCommand(c,cmd,len) != REDIS_OK) {
-        hi_sdsfree(cmd);
-        return REDIS_ERR;
-    }
-
-    hi_sdsfree(cmd);
-    return REDIS_OK;
-}
-
-/* Helper function for the redisCommand* family of functions.
- *
- * Write a formatted command to the output buffer. If the given context is
- * blocking, immediately read the reply into the "reply" pointer. When the
- * context is non-blocking, the "reply" pointer will not be used and the
- * command is simply appended to the write buffer.
- *
- * Returns the reply when a reply was successfully retrieved. Returns NULL
- * otherwise. When NULL is returned in a blocking context, the error field
- * in the context will be set.
- */
-static void *__redisBlockForReply(redisContext *c) {
-    void *reply;
-
-    if (c->flags & REDIS_BLOCK) {
-        if (redisGetReply(c,&reply) != REDIS_OK)
-            return NULL;
-        return reply;
-    }
-    return NULL;
-}
-
-void *redisvCommand(redisContext *c, const char *format, va_list ap) {
-    if (redisvAppendCommand(c,format,ap) != REDIS_OK)
-        return NULL;
-    return __redisBlockForReply(c);
-}
-
-void *redisCommand(redisContext *c, const char *format, ...) {
-    va_list ap;
-    va_start(ap,format);
-    void *reply = redisvCommand(c,format,ap);
-    va_end(ap);
-    return reply;
-}
-
-void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen) {
-    if (redisAppendCommandArgv(c,argc,argv,argvlen) != REDIS_OK)
-        return NULL;
-    return __redisBlockForReply(c);
-}
diff --git a/redis-stable/deps/hiredis/hiredis.h b/redis-stable/deps/hiredis/hiredis.h
deleted file mode 100644
index b597394d..00000000
--- a/redis-stable/deps/hiredis/hiredis.h
+++ /dev/null
@@ -1,336 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
- *                     Jan-Erik Rediger <janerik at fnordig dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_H
-#define __HIREDIS_H
-#include "read.h"
-#include <stdarg.h> /* for va_list */
-#ifndef _MSC_VER
-#include <sys/time.h> /* for struct timeval */
-#else
-struct timeval; /* forward declaration */
-typedef long long ssize_t;
-#endif
-#include <stdint.h> /* uintXX_t, etc */
-#include "sds.h" /* for hisds */
-#include "alloc.h" /* for allocation wrappers */
-
-#define HIREDIS_MAJOR 1
-#define HIREDIS_MINOR 0
-#define HIREDIS_PATCH 0
-#define HIREDIS_SONAME 1.0.0
-
-/* Connection type can be blocking or non-blocking and is set in the
- * least significant bit of the flags field in redisContext. */
-#define REDIS_BLOCK 0x1
-
-/* Connection may be disconnected before being free'd. The second bit
- * in the flags field is set when the context is connected. */
-#define REDIS_CONNECTED 0x2
-
-/* The async API might try to disconnect cleanly and flush the output
- * buffer and read all subsequent replies before disconnecting.
- * This flag means no new commands can come in and the connection
- * should be terminated once all replies have been read. */
-#define REDIS_DISCONNECTING 0x4
-
-/* Flag specific to the async API which means that the context should be clean
- * up as soon as possible. */
-#define REDIS_FREEING 0x8
-
-/* Flag that is set when an async callback is executed. */
-#define REDIS_IN_CALLBACK 0x10
-
-/* Flag that is set when the async context has one or more subscriptions. */
-#define REDIS_SUBSCRIBED 0x20
-
-/* Flag that is set when monitor mode is active */
-#define REDIS_MONITORING 0x40
-
-/* Flag that is set when we should set SO_REUSEADDR before calling bind() */
-#define REDIS_REUSEADDR 0x80
-
-/**
- * Flag that indicates the user does not want the context to
- * be automatically freed upon error
- */
-#define REDIS_NO_AUTO_FREE 0x200
-
-#define REDIS_KEEPALIVE_INTERVAL 15 /* seconds */
-
-/* number of times we retry to connect in the case of EADDRNOTAVAIL and
- * SO_REUSEADDR is being used. */
-#define REDIS_CONNECT_RETRIES  10
-
-/* Forward declarations for structs defined elsewhere */
-struct redisAsyncContext;
-struct redisContext;
-
-/* RESP3 push helpers and callback prototypes */
-#define redisIsPushReply(r) (((redisReply*)(r))->type == REDIS_REPLY_PUSH)
-typedef void (redisPushFn)(void *, void *);
-typedef void (redisAsyncPushFn)(struct redisAsyncContext *, void *);
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* This is the reply object returned by redisCommand() */
-typedef struct redisReply {
-    int type; /* REDIS_REPLY_* */
-    long long integer; /* The integer when type is REDIS_REPLY_INTEGER */
-    double dval; /* The double when type is REDIS_REPLY_DOUBLE */
-    size_t len; /* Length of string */
-    char *str; /* Used for REDIS_REPLY_ERROR, REDIS_REPLY_STRING
-                  REDIS_REPLY_VERB, and REDIS_REPLY_DOUBLE (in additional to dval). */
-    char vtype[4]; /* Used for REDIS_REPLY_VERB, contains the null
-                      terminated 3 character content type, such as "txt". */
-    size_t elements; /* number of elements, for REDIS_REPLY_ARRAY */
-    struct redisReply **element; /* elements vector for REDIS_REPLY_ARRAY */
-} redisReply;
-
-redisReader *redisReaderCreate(void);
-
-/* Function to free the reply objects hiredis returns by default. */
-void freeReplyObject(void *reply);
-
-/* Functions to format a command according to the protocol. */
-int redisvFormatCommand(char **target, const char *format, va_list ap);
-int redisFormatCommand(char **target, const char *format, ...);
-int redisFormatCommandArgv(char **target, int argc, const char **argv, const size_t *argvlen);
-int redisFormatSdsCommandArgv(hisds *target, int argc, const char ** argv, const size_t *argvlen);
-void redisFreeCommand(char *cmd);
-void redisFreeSdsCommand(hisds cmd);
-
-enum redisConnectionType {
-    REDIS_CONN_TCP,
-    REDIS_CONN_UNIX,
-    REDIS_CONN_USERFD
-};
-
-struct redisSsl;
-
-#define REDIS_OPT_NONBLOCK 0x01
-#define REDIS_OPT_REUSEADDR 0x02
-
-/**
- * Don't automatically free the async object on a connection failure,
- * or other implicit conditions. Only free on an explicit call to disconnect() or free()
- */
-#define REDIS_OPT_NOAUTOFREE 0x04
-
-/* Don't automatically intercept and free RESP3 PUSH replies. */
-#define REDIS_OPT_NO_PUSH_AUTOFREE 0x08
-
-/* In Unix systems a file descriptor is a regular signed int, with -1
- * representing an invalid descriptor. In Windows it is a SOCKET
- * (32- or 64-bit unsigned integer depending on the architecture), where
- * all bits set (~0) is INVALID_SOCKET.  */
-#ifndef _WIN32
-typedef int redisFD;
-#define REDIS_INVALID_FD -1
-#else
-#ifdef _WIN64
-typedef unsigned long long redisFD; /* SOCKET = 64-bit UINT_PTR */
-#else
-typedef unsigned long redisFD;      /* SOCKET = 32-bit UINT_PTR */
-#endif
-#define REDIS_INVALID_FD ((redisFD)(~0)) /* INVALID_SOCKET */
-#endif
-
-typedef struct {
-    /*
-     * the type of connection to use. This also indicates which
-     * `endpoint` member field to use
-     */
-    int type;
-    /* bit field of REDIS_OPT_xxx */
-    int options;
-    /* timeout value for connect operation. If NULL, no timeout is used */
-    const struct timeval *connect_timeout;
-    /* timeout value for commands. If NULL, no timeout is used.  This can be
-     * updated at runtime with redisSetTimeout/redisAsyncSetTimeout. */
-    const struct timeval *command_timeout;
-    union {
-        /** use this field for tcp/ip connections */
-        struct {
-            const char *source_addr;
-            const char *ip;
-            int port;
-        } tcp;
-        /** use this field for unix domain sockets */
-        const char *unix_socket;
-        /**
-         * use this field to have hiredis operate an already-open
-         * file descriptor */
-        redisFD fd;
-    } endpoint;
-
-    /* Optional user defined data/destructor */
-    void *privdata;
-    void (*free_privdata)(void *);
-
-    /* A user defined PUSH message callback */
-    redisPushFn *push_cb;
-    redisAsyncPushFn *async_push_cb;
-} redisOptions;
-
-/**
- * Helper macros to initialize options to their specified fields.
- */
-#define REDIS_OPTIONS_SET_TCP(opts, ip_, port_) \
-    (opts)->type = REDIS_CONN_TCP; \
-    (opts)->endpoint.tcp.ip = ip_; \
-    (opts)->endpoint.tcp.port = port_;
-
-#define REDIS_OPTIONS_SET_UNIX(opts, path) \
-    (opts)->type = REDIS_CONN_UNIX;        \
-    (opts)->endpoint.unix_socket = path;
-
-#define REDIS_OPTIONS_SET_PRIVDATA(opts, data, dtor) \
-    (opts)->privdata = data;                         \
-    (opts)->free_privdata = dtor;                    \
-
-typedef struct redisContextFuncs {
-    void (*free_privctx)(void *);
-    void (*async_read)(struct redisAsyncContext *);
-    void (*async_write)(struct redisAsyncContext *);
-    ssize_t (*read)(struct redisContext *, char *, size_t);
-    ssize_t (*write)(struct redisContext *);
-} redisContextFuncs;
-
-/* Context for a connection to Redis */
-typedef struct redisContext {
-    const redisContextFuncs *funcs;   /* Function table */
-
-    int err; /* Error flags, 0 when there is no error */
-    char errstr[128]; /* String representation of error when applicable */
-    redisFD fd;
-    int flags;
-    char *obuf; /* Write buffer */
-    redisReader *reader; /* Protocol reader */
-
-    enum redisConnectionType connection_type;
-    struct timeval *connect_timeout;
-    struct timeval *command_timeout;
-
-    struct {
-        char *host;
-        char *source_addr;
-        int port;
-    } tcp;
-
-    struct {
-        char *path;
-    } unix_sock;
-
-    /* For non-blocking connect */
-    struct sockadr *saddr;
-    size_t addrlen;
-
-    /* Optional data and corresponding destructor users can use to provide
-     * context to a given redisContext.  Not used by hiredis. */
-    void *privdata;
-    void (*free_privdata)(void *);
-
-    /* Internal context pointer presently used by hiredis to manage
-     * SSL connections. */
-    void *privctx;
-
-    /* An optional RESP3 PUSH handler */
-    redisPushFn *push_cb;
-} redisContext;
-
-redisContext *redisConnectWithOptions(const redisOptions *options);
-redisContext *redisConnect(const char *ip, int port);
-redisContext *redisConnectWithTimeout(const char *ip, int port, const struct timeval tv);
-redisContext *redisConnectNonBlock(const char *ip, int port);
-redisContext *redisConnectBindNonBlock(const char *ip, int port,
-                                       const char *source_addr);
-redisContext *redisConnectBindNonBlockWithReuse(const char *ip, int port,
-                                                const char *source_addr);
-redisContext *redisConnectUnix(const char *path);
-redisContext *redisConnectUnixWithTimeout(const char *path, const struct timeval tv);
-redisContext *redisConnectUnixNonBlock(const char *path);
-redisContext *redisConnectFd(redisFD fd);
-
-/**
- * Reconnect the given context using the saved information.
- *
- * This re-uses the exact same connect options as in the initial connection.
- * host, ip (or path), timeout and bind address are reused,
- * flags are used unmodified from the existing context.
- *
- * Returns REDIS_OK on successful connect or REDIS_ERR otherwise.
- */
-int redisReconnect(redisContext *c);
-
-redisPushFn *redisSetPushCallback(redisContext *c, redisPushFn *fn);
-int redisSetTimeout(redisContext *c, const struct timeval tv);
-int redisEnableKeepAlive(redisContext *c);
-void redisFree(redisContext *c);
-redisFD redisFreeKeepFd(redisContext *c);
-int redisBufferRead(redisContext *c);
-int redisBufferWrite(redisContext *c, int *done);
-
-/* In a blocking context, this function first checks if there are unconsumed
- * replies to return and returns one if so. Otherwise, it flushes the output
- * buffer to the socket and reads until it has a reply. In a non-blocking
- * context, it will return unconsumed replies until there are no more. */
-int redisGetReply(redisContext *c, void **reply);
-int redisGetReplyFromReader(redisContext *c, void **reply);
-
-/* Write a formatted command to the output buffer. Use these functions in blocking mode
- * to get a pipeline of commands. */
-int redisAppendFormattedCommand(redisContext *c, const char *cmd, size_t len);
-
-/* Write a command to the output buffer. Use these functions in blocking mode
- * to get a pipeline of commands. */
-int redisvAppendCommand(redisContext *c, const char *format, va_list ap);
-int redisAppendCommand(redisContext *c, const char *format, ...);
-int redisAppendCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
-
-/* Issue a command to Redis. In a blocking context, it is identical to calling
- * redisAppendCommand, followed by redisGetReply. The function will return
- * NULL if there was an error in performing the request, otherwise it will
- * return the reply. In a non-blocking context, it is identical to calling
- * only redisAppendCommand and will always return NULL. */
-void *redisvCommand(redisContext *c, const char *format, va_list ap);
-void *redisCommand(redisContext *c, const char *format, ...);
-void *redisCommandArgv(redisContext *c, int argc, const char **argv, const size_t *argvlen);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/redis-stable/deps/hiredis/hiredis.pc.in b/redis-stable/deps/hiredis/hiredis.pc.in
deleted file mode 100644
index 91b77318..00000000
--- a/redis-stable/deps/hiredis/hiredis.pc.in
+++ /dev/null
@@ -1,12 +0,0 @@
-prefix=@CMAKE_INSTALL_PREFIX@
-install_libdir=@CMAKE_INSTALL_LIBDIR@
-exec_prefix=${prefix}
-libdir=${exec_prefix}/${install_libdir}
-includedir=${prefix}/include
-pkgincludedir=${includedir}/hiredis
-
-Name: hiredis
-Description: Minimalistic C client library for Redis.
-Version: @PROJECT_VERSION@
-Libs: -L${libdir} -lhiredis
-Cflags: -I${pkgincludedir} -D_FILE_OFFSET_BITS=64
diff --git a/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in b/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
deleted file mode 100644
index 9a283dfc..00000000
--- a/redis-stable/deps/hiredis/hiredis_ssl-config.cmake.in
+++ /dev/null
@@ -1,13 +0,0 @@
-@PACKAGE_INIT@
-
-set_and_check(hiredis_ssl_INCLUDEDIR "@PACKAGE_INCLUDE_INSTALL_DIR@")
-
-IF (NOT TARGET hiredis::hiredis_ssl)
-	INCLUDE(${CMAKE_CURRENT_LIST_DIR}/hiredis_ssl-targets.cmake)
-ENDIF()
-
-SET(hiredis_ssl_LIBRARIES hiredis::hiredis_ssl)
-SET(hiredis_ssl_INCLUDE_DIRS ${hiredis_ssl_INCLUDEDIR})
-
-check_required_components(hiredis_ssl)
-
diff --git a/redis-stable/deps/hiredis/hiredis_ssl.h b/redis-stable/deps/hiredis/hiredis_ssl.h
deleted file mode 100644
index 604efe0c..00000000
--- a/redis-stable/deps/hiredis/hiredis_ssl.h
+++ /dev/null
@@ -1,127 +0,0 @@
-
-/*
- * Copyright (c) 2019, Redis Labs
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __HIREDIS_SSL_H
-#define __HIREDIS_SSL_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* This is the underlying struct for SSL in ssl.h, which is not included to
- * keep build dependencies short here.
- */
-struct ssl_st;
-
-/* A wrapper around OpenSSL SSL_CTX to allow easy SSL use without directly
- * calling OpenSSL.
- */
-typedef struct redisSSLContext redisSSLContext;
-
-/**
- * Initialization errors that redisCreateSSLContext() may return.
- */
-
-typedef enum {
-    REDIS_SSL_CTX_NONE = 0,                     /* No Error */
-    REDIS_SSL_CTX_CREATE_FAILED,                /* Failed to create OpenSSL SSL_CTX */
-    REDIS_SSL_CTX_CERT_KEY_REQUIRED,            /* Client cert and key must both be specified or skipped */
-    REDIS_SSL_CTX_CA_CERT_LOAD_FAILED,          /* Failed to load CA Certificate or CA Path */
-    REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED,      /* Failed to load client certificate */
-    REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED       /* Failed to load private key */
-} redisSSLContextError;
-
-/**
- * Return the error message corresponding with the specified error code.
- */
-
-const char *redisSSLContextGetError(redisSSLContextError error);
-
-/**
- * Helper function to initialize the OpenSSL library.
- *
- * OpenSSL requires one-time initialization before it can be used. Callers should
- * call this function only once, and only if OpenSSL is not directly initialized
- * elsewhere.
- */
-int redisInitOpenSSL(void);
-
-/**
- * Helper function to initialize an OpenSSL context that can be used
- * to initiate SSL connections.
- *
- * cacert_filename is an optional name of a CA certificate/bundle file to load
- * and use for validation.
- *
- * capath is an optional directory path where trusted CA certificate files are
- * stored in an OpenSSL-compatible structure.
- *
- * cert_filename and private_key_filename are optional names of a client side
- * certificate and private key files to use for authentication. They need to
- * be both specified or omitted.
- *
- * server_name is an optional and will be used as a server name indication
- * (SNI) TLS extension.
- *
- * If error is non-null, it will be populated in case the context creation fails
- * (returning a NULL).
- */
-
-redisSSLContext *redisCreateSSLContext(const char *cacert_filename, const char *capath,
-        const char *cert_filename, const char *private_key_filename,
-        const char *server_name, redisSSLContextError *error);
-
-/**
- * Free a previously created OpenSSL context.
- */
-void redisFreeSSLContext(redisSSLContext *redis_ssl_ctx);
-
-/**
- * Initiate SSL on an existing redisContext.
- *
- * This is similar to redisInitiateSSL() but does not require the caller
- * to directly interact with OpenSSL, and instead uses a redisSSLContext
- * previously created using redisCreateSSLContext().
- */
-
-int redisInitiateSSLWithContext(redisContext *c, redisSSLContext *redis_ssl_ctx);
-
-/**
- * Initiate SSL/TLS negotiation on a provided OpenSSL SSL object.
- */
-
-int redisInitiateSSL(redisContext *c, struct ssl_st *ssl);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif  /* __HIREDIS_SSL_H */
diff --git a/redis-stable/deps/hiredis/hiredis_ssl.pc.in b/redis-stable/deps/hiredis/hiredis_ssl.pc.in
deleted file mode 100644
index 588a978a..00000000
--- a/redis-stable/deps/hiredis/hiredis_ssl.pc.in
+++ /dev/null
@@ -1,12 +0,0 @@
-prefix=@CMAKE_INSTALL_PREFIX@
-exec_prefix=${prefix}
-libdir=${exec_prefix}/lib
-includedir=${prefix}/include
-pkgincludedir=${includedir}/hiredis
-
-Name: hiredis_ssl
-Description: SSL Support for hiredis.
-Version: @PROJECT_VERSION@
-Requires: hiredis
-Libs: -L${libdir} -lhiredis_ssl
-Libs.private: -lssl -lcrypto
diff --git a/redis-stable/deps/hiredis/net.c b/redis-stable/deps/hiredis/net.c
deleted file mode 100644
index 88f9aff2..00000000
--- a/redis-stable/deps/hiredis/net.c
+++ /dev/null
@@ -1,612 +0,0 @@
-/* Extracted from anet.c to work properly with Hiredis error reporting.
- *
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
- *                     Jan-Erik Rediger <janerik at fnordig dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include <sys/types.h>
-#include <fcntl.h>
-#include <string.h>
-#include <errno.h>
-#include <stdarg.h>
-#include <stdio.h>
-#include <limits.h>
-#include <stdlib.h>
-
-#include "net.h"
-#include "sds.h"
-#include "sockcompat.h"
-#include "win32.h"
-
-/* Defined in hiredis.c */
-void __redisSetError(redisContext *c, int type, const char *str);
-
-void redisNetClose(redisContext *c) {
-    if (c && c->fd != REDIS_INVALID_FD) {
-        close(c->fd);
-        c->fd = REDIS_INVALID_FD;
-    }
-}
-
-ssize_t redisNetRead(redisContext *c, char *buf, size_t bufcap) {
-    ssize_t nread = recv(c->fd, buf, bufcap, 0);
-    if (nread == -1) {
-        if ((errno == EWOULDBLOCK && !(c->flags & REDIS_BLOCK)) || (errno == EINTR)) {
-            /* Try again later */
-            return 0;
-        } else if(errno == ETIMEDOUT && (c->flags & REDIS_BLOCK)) {
-            /* especially in windows */
-            __redisSetError(c, REDIS_ERR_TIMEOUT, "recv timeout");
-            return -1;
-        } else {
-            __redisSetError(c, REDIS_ERR_IO, NULL);
-            return -1;
-        }
-    } else if (nread == 0) {
-        __redisSetError(c, REDIS_ERR_EOF, "Server closed the connection");
-        return -1;
-    } else {
-        return nread;
-    }
-}
-
-ssize_t redisNetWrite(redisContext *c) {
-    ssize_t nwritten = send(c->fd, c->obuf, hi_sdslen(c->obuf), 0);
-    if (nwritten < 0) {
-        if ((errno == EWOULDBLOCK && !(c->flags & REDIS_BLOCK)) || (errno == EINTR)) {
-            /* Try again later */
-        } else {
-            __redisSetError(c, REDIS_ERR_IO, NULL);
-            return -1;
-        }
-    }
-    return nwritten;
-}
-
-static void __redisSetErrorFromErrno(redisContext *c, int type, const char *prefix) {
-    int errorno = errno;  /* snprintf() may change errno */
-    char buf[128] = { 0 };
-    size_t len = 0;
-
-    if (prefix != NULL)
-        len = snprintf(buf,sizeof(buf),"%s: ",prefix);
-    strerror_r(errorno, (char *)(buf + len), sizeof(buf) - len);
-    __redisSetError(c,type,buf);
-}
-
-static int redisSetReuseAddr(redisContext *c) {
-    int on = 1;
-    if (setsockopt(c->fd, SOL_SOCKET, SO_REUSEADDR, &on, sizeof(on)) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
-        redisNetClose(c);
-        return REDIS_ERR;
-    }
-    return REDIS_OK;
-}
-
-static int redisCreateSocket(redisContext *c, int type) {
-    redisFD s;
-    if ((s = socket(type, SOCK_STREAM, 0)) == REDIS_INVALID_FD) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
-        return REDIS_ERR;
-    }
-    c->fd = s;
-    if (type == AF_INET) {
-        if (redisSetReuseAddr(c) == REDIS_ERR) {
-            return REDIS_ERR;
-        }
-    }
-    return REDIS_OK;
-}
-
-static int redisSetBlocking(redisContext *c, int blocking) {
-#ifndef _WIN32
-    int flags;
-
-    /* Set the socket nonblocking.
-     * Note that fcntl(2) for F_GETFL and F_SETFL can't be
-     * interrupted by a signal. */
-    if ((flags = fcntl(c->fd, F_GETFL)) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"fcntl(F_GETFL)");
-        redisNetClose(c);
-        return REDIS_ERR;
-    }
-
-    if (blocking)
-        flags &= ~O_NONBLOCK;
-    else
-        flags |= O_NONBLOCK;
-
-    if (fcntl(c->fd, F_SETFL, flags) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"fcntl(F_SETFL)");
-        redisNetClose(c);
-        return REDIS_ERR;
-    }
-#else
-    u_long mode = blocking ? 0 : 1;
-    if (ioctl(c->fd, FIONBIO, &mode) == -1) {
-        __redisSetErrorFromErrno(c, REDIS_ERR_IO, "ioctl(FIONBIO)");
-        redisNetClose(c);
-        return REDIS_ERR;
-    }
-#endif /* _WIN32 */
-    return REDIS_OK;
-}
-
-int redisKeepAlive(redisContext *c, int interval) {
-    int val = 1;
-    redisFD fd = c->fd;
-
-    if (setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &val, sizeof(val)) == -1){
-        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
-        return REDIS_ERR;
-    }
-
-    val = interval;
-
-#if defined(__APPLE__) && defined(__MACH__)
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPALIVE, &val, sizeof(val)) < 0) {
-        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
-        return REDIS_ERR;
-    }
-#else
-#if defined(__GLIBC__) && !defined(__FreeBSD_kernel__)
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPIDLE, &val, sizeof(val)) < 0) {
-        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
-        return REDIS_ERR;
-    }
-
-    val = interval/3;
-    if (val == 0) val = 1;
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPINTVL, &val, sizeof(val)) < 0) {
-        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
-        return REDIS_ERR;
-    }
-
-    val = 3;
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPCNT, &val, sizeof(val)) < 0) {
-        __redisSetError(c,REDIS_ERR_OTHER,strerror(errno));
-        return REDIS_ERR;
-    }
-#endif
-#endif
-
-    return REDIS_OK;
-}
-
-int redisSetTcpNoDelay(redisContext *c) {
-    int yes = 1;
-    if (setsockopt(c->fd, IPPROTO_TCP, TCP_NODELAY, &yes, sizeof(yes)) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(TCP_NODELAY)");
-        redisNetClose(c);
-        return REDIS_ERR;
-    }
-    return REDIS_OK;
-}
-
-#define __MAX_MSEC (((LONG_MAX) - 999) / 1000)
-
-static int redisContextTimeoutMsec(redisContext *c, long *result)
-{
-    const struct timeval *timeout = c->connect_timeout;
-    long msec = -1;
-
-    /* Only use timeout when not NULL. */
-    if (timeout != NULL) {
-        if (timeout->tv_usec > 1000000 || timeout->tv_sec > __MAX_MSEC) {
-            *result = msec;
-            return REDIS_ERR;
-        }
-
-        msec = (timeout->tv_sec * 1000) + ((timeout->tv_usec + 999) / 1000);
-
-        if (msec < 0 || msec > INT_MAX) {
-            msec = INT_MAX;
-        }
-    }
-
-    *result = msec;
-    return REDIS_OK;
-}
-
-static int redisContextWaitReady(redisContext *c, long msec) {
-    struct pollfd   wfd[1];
-
-    wfd[0].fd     = c->fd;
-    wfd[0].events = POLLOUT;
-
-    if (errno == EINPROGRESS) {
-        int res;
-
-        if ((res = poll(wfd, 1, msec)) == -1) {
-            __redisSetErrorFromErrno(c, REDIS_ERR_IO, "poll(2)");
-            redisNetClose(c);
-            return REDIS_ERR;
-        } else if (res == 0) {
-            errno = ETIMEDOUT;
-            __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
-            redisNetClose(c);
-            return REDIS_ERR;
-        }
-
-        if (redisCheckConnectDone(c, &res) != REDIS_OK || res == 0) {
-            redisCheckSocketError(c);
-            return REDIS_ERR;
-        }
-
-        return REDIS_OK;
-    }
-
-    __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
-    redisNetClose(c);
-    return REDIS_ERR;
-}
-
-int redisCheckConnectDone(redisContext *c, int *completed) {
-    int rc = connect(c->fd, (const struct sockaddr *)c->saddr, c->addrlen);
-    if (rc == 0) {
-        *completed = 1;
-        return REDIS_OK;
-    }
-    switch (errno) {
-    case EISCONN:
-        *completed = 1;
-        return REDIS_OK;
-    case EALREADY:
-    case EINPROGRESS:
-    case EWOULDBLOCK:
-        *completed = 0;
-        return REDIS_OK;
-    default:
-        return REDIS_ERR;
-    }
-}
-
-int redisCheckSocketError(redisContext *c) {
-    int err = 0, errno_saved = errno;
-    socklen_t errlen = sizeof(err);
-
-    if (getsockopt(c->fd, SOL_SOCKET, SO_ERROR, &err, &errlen) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"getsockopt(SO_ERROR)");
-        return REDIS_ERR;
-    }
-
-    if (err == 0) {
-        err = errno_saved;
-    }
-
-    if (err) {
-        errno = err;
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,NULL);
-        return REDIS_ERR;
-    }
-
-    return REDIS_OK;
-}
-
-int redisContextSetTimeout(redisContext *c, const struct timeval tv) {
-    const void *to_ptr = &tv;
-    size_t to_sz = sizeof(tv);
-
-    if (setsockopt(c->fd,SOL_SOCKET,SO_RCVTIMEO,to_ptr,to_sz) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(SO_RCVTIMEO)");
-        return REDIS_ERR;
-    }
-    if (setsockopt(c->fd,SOL_SOCKET,SO_SNDTIMEO,to_ptr,to_sz) == -1) {
-        __redisSetErrorFromErrno(c,REDIS_ERR_IO,"setsockopt(SO_SNDTIMEO)");
-        return REDIS_ERR;
-    }
-    return REDIS_OK;
-}
-
-int redisContextUpdateConnectTimeout(redisContext *c, const struct timeval *timeout) {
-    /* Same timeval struct, short circuit */
-    if (c->connect_timeout == timeout)
-        return REDIS_OK;
-
-    /* Allocate context timeval if we need to */
-    if (c->connect_timeout == NULL) {
-        c->connect_timeout = hi_malloc(sizeof(*c->connect_timeout));
-        if (c->connect_timeout == NULL)
-            return REDIS_ERR;
-    }
-
-    memcpy(c->connect_timeout, timeout, sizeof(*c->connect_timeout));
-    return REDIS_OK;
-}
-
-int redisContextUpdateCommandTimeout(redisContext *c, const struct timeval *timeout) {
-    /* Same timeval struct, short circuit */
-    if (c->command_timeout == timeout)
-        return REDIS_OK;
-
-    /* Allocate context timeval if we need to */
-    if (c->command_timeout == NULL) {
-        c->command_timeout = hi_malloc(sizeof(*c->command_timeout));
-        if (c->command_timeout == NULL)
-            return REDIS_ERR;
-    }
-
-    memcpy(c->command_timeout, timeout, sizeof(*c->command_timeout));
-    return REDIS_OK;
-}
-
-static int _redisContextConnectTcp(redisContext *c, const char *addr, int port,
-                                   const struct timeval *timeout,
-                                   const char *source_addr) {
-    redisFD s;
-    int rv, n;
-    char _port[6];  /* strlen("65535"); */
-    struct addrinfo hints, *servinfo, *bservinfo, *p, *b;
-    int blocking = (c->flags & REDIS_BLOCK);
-    int reuseaddr = (c->flags & REDIS_REUSEADDR);
-    int reuses = 0;
-    long timeout_msec = -1;
-
-    servinfo = NULL;
-    c->connection_type = REDIS_CONN_TCP;
-    c->tcp.port = port;
-
-    /* We need to take possession of the passed parameters
-     * to make them reusable for a reconnect.
-     * We also carefully check we don't free data we already own,
-     * as in the case of the reconnect method.
-     *
-     * This is a bit ugly, but atleast it works and doesn't leak memory.
-     **/
-    if (c->tcp.host != addr) {
-        hi_free(c->tcp.host);
-
-        c->tcp.host = hi_strdup(addr);
-        if (c->tcp.host == NULL)
-            goto oom;
-    }
-
-    if (timeout) {
-        if (redisContextUpdateConnectTimeout(c, timeout) == REDIS_ERR)
-            goto oom;
-    } else {
-        hi_free(c->connect_timeout);
-        c->connect_timeout = NULL;
-    }
-
-    if (redisContextTimeoutMsec(c, &timeout_msec) != REDIS_OK) {
-        __redisSetError(c, REDIS_ERR_IO, "Invalid timeout specified");
-        goto error;
-    }
-
-    if (source_addr == NULL) {
-        hi_free(c->tcp.source_addr);
-        c->tcp.source_addr = NULL;
-    } else if (c->tcp.source_addr != source_addr) {
-        hi_free(c->tcp.source_addr);
-        c->tcp.source_addr = hi_strdup(source_addr);
-    }
-
-    snprintf(_port, 6, "%d", port);
-    memset(&hints,0,sizeof(hints));
-    hints.ai_family = AF_INET;
-    hints.ai_socktype = SOCK_STREAM;
-
-    /* Try with IPv6 if no IPv4 address was found. We do it in this order since
-     * in a Redis client you can't afford to test if you have IPv6 connectivity
-     * as this would add latency to every connect. Otherwise a more sensible
-     * route could be: Use IPv6 if both addresses are available and there is IPv6
-     * connectivity. */
-    if ((rv = getaddrinfo(c->tcp.host,_port,&hints,&servinfo)) != 0) {
-         hints.ai_family = AF_INET6;
-         if ((rv = getaddrinfo(addr,_port,&hints,&servinfo)) != 0) {
-            __redisSetError(c,REDIS_ERR_OTHER,gai_strerror(rv));
-            return REDIS_ERR;
-        }
-    }
-    for (p = servinfo; p != NULL; p = p->ai_next) {
-addrretry:
-        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == REDIS_INVALID_FD)
-            continue;
-
-        c->fd = s;
-        if (redisSetBlocking(c,0) != REDIS_OK)
-            goto error;
-        if (c->tcp.source_addr) {
-            int bound = 0;
-            /* Using getaddrinfo saves us from self-determining IPv4 vs IPv6 */
-            if ((rv = getaddrinfo(c->tcp.source_addr, NULL, &hints, &bservinfo)) != 0) {
-                char buf[128];
-                snprintf(buf,sizeof(buf),"Can't get addr: %s",gai_strerror(rv));
-                __redisSetError(c,REDIS_ERR_OTHER,buf);
-                goto error;
-            }
-
-            if (reuseaddr) {
-                n = 1;
-                if (setsockopt(s, SOL_SOCKET, SO_REUSEADDR, (char*) &n,
-                               sizeof(n)) < 0) {
-                    freeaddrinfo(bservinfo);
-                    goto error;
-                }
-            }
-
-            for (b = bservinfo; b != NULL; b = b->ai_next) {
-                if (bind(s,b->ai_addr,b->ai_addrlen) != -1) {
-                    bound = 1;
-                    break;
-                }
-            }
-            freeaddrinfo(bservinfo);
-            if (!bound) {
-                char buf[128];
-                snprintf(buf,sizeof(buf),"Can't bind socket: %s",strerror(errno));
-                __redisSetError(c,REDIS_ERR_OTHER,buf);
-                goto error;
-            }
-        }
-
-        /* For repeat connection */
-        hi_free(c->saddr);
-        c->saddr = hi_malloc(p->ai_addrlen);
-        if (c->saddr == NULL)
-            goto oom;
-
-        memcpy(c->saddr, p->ai_addr, p->ai_addrlen);
-        c->addrlen = p->ai_addrlen;
-
-        if (connect(s,p->ai_addr,p->ai_addrlen) == -1) {
-            if (errno == EHOSTUNREACH) {
-                redisNetClose(c);
-                continue;
-            } else if (errno == EINPROGRESS) {
-                if (blocking) {
-                    goto wait_for_ready;
-                }
-                /* This is ok.
-                 * Note that even when it's in blocking mode, we unset blocking
-                 * for `connect()`
-                 */
-            } else if (errno == EADDRNOTAVAIL && reuseaddr) {
-                if (++reuses >= REDIS_CONNECT_RETRIES) {
-                    goto error;
-                } else {
-                    redisNetClose(c);
-                    goto addrretry;
-                }
-            } else {
-                wait_for_ready:
-                if (redisContextWaitReady(c,timeout_msec) != REDIS_OK)
-                    goto error;
-                if (redisSetTcpNoDelay(c) != REDIS_OK)
-                    goto error;
-            }
-        }
-        if (blocking && redisSetBlocking(c,1) != REDIS_OK)
-            goto error;
-
-        c->flags |= REDIS_CONNECTED;
-        rv = REDIS_OK;
-        goto end;
-    }
-    if (p == NULL) {
-        char buf[128];
-        snprintf(buf,sizeof(buf),"Can't create socket: %s",strerror(errno));
-        __redisSetError(c,REDIS_ERR_OTHER,buf);
-        goto error;
-    }
-
-oom:
-    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-error:
-    rv = REDIS_ERR;
-end:
-    if(servinfo) {
-        freeaddrinfo(servinfo);
-    }
-
-    return rv;  // Need to return REDIS_OK if alright
-}
-
-int redisContextConnectTcp(redisContext *c, const char *addr, int port,
-                           const struct timeval *timeout) {
-    return _redisContextConnectTcp(c, addr, port, timeout, NULL);
-}
-
-int redisContextConnectBindTcp(redisContext *c, const char *addr, int port,
-                               const struct timeval *timeout,
-                               const char *source_addr) {
-    return _redisContextConnectTcp(c, addr, port, timeout, source_addr);
-}
-
-int redisContextConnectUnix(redisContext *c, const char *path, const struct timeval *timeout) {
-#ifndef _WIN32
-    int blocking = (c->flags & REDIS_BLOCK);
-    struct sockaddr_un *sa;
-    long timeout_msec = -1;
-
-    if (redisCreateSocket(c,AF_UNIX) < 0)
-        return REDIS_ERR;
-    if (redisSetBlocking(c,0) != REDIS_OK)
-        return REDIS_ERR;
-
-    c->connection_type = REDIS_CONN_UNIX;
-    if (c->unix_sock.path != path) {
-        hi_free(c->unix_sock.path);
-
-        c->unix_sock.path = hi_strdup(path);
-        if (c->unix_sock.path == NULL)
-            goto oom;
-    }
-
-    if (timeout) {
-        if (redisContextUpdateConnectTimeout(c, timeout) == REDIS_ERR)
-            goto oom;
-    } else {
-        hi_free(c->connect_timeout);
-        c->connect_timeout = NULL;
-    }
-
-    if (redisContextTimeoutMsec(c,&timeout_msec) != REDIS_OK)
-        return REDIS_ERR;
-
-    /* Don't leak sockaddr if we're reconnecting */
-    if (c->saddr) hi_free(c->saddr);
-
-    sa = (struct sockaddr_un*)(c->saddr = hi_malloc(sizeof(struct sockaddr_un)));
-    if (sa == NULL)
-        goto oom;
-
-    c->addrlen = sizeof(struct sockaddr_un);
-    sa->sun_family = AF_UNIX;
-    strncpy(sa->sun_path, path, sizeof(sa->sun_path) - 1);
-    if (connect(c->fd, (struct sockaddr*)sa, sizeof(*sa)) == -1) {
-        if (errno == EINPROGRESS && !blocking) {
-            /* This is ok. */
-        } else {
-            if (redisContextWaitReady(c,timeout_msec) != REDIS_OK)
-                return REDIS_ERR;
-        }
-    }
-
-    /* Reset socket to be blocking after connect(2). */
-    if (blocking && redisSetBlocking(c,1) != REDIS_OK)
-        return REDIS_ERR;
-
-    c->flags |= REDIS_CONNECTED;
-    return REDIS_OK;
-#else
-    /* We currently do not support Unix sockets for Windows. */
-    /* TODO(m): https://devblogs.microsoft.com/commandline/af_unix-comes-to-windows/ */
-    errno = EPROTONOSUPPORT;
-    return REDIS_ERR;
-#endif /* _WIN32 */
-oom:
-    __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-    return REDIS_ERR;
-}
diff --git a/redis-stable/deps/hiredis/net.h b/redis-stable/deps/hiredis/net.h
deleted file mode 100644
index 9f43283a..00000000
--- a/redis-stable/deps/hiredis/net.h
+++ /dev/null
@@ -1,56 +0,0 @@
-/* Extracted from anet.c to work properly with Hiredis error reporting.
- *
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2014, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2015, Matt Stancliff <matt at genges dot com>,
- *                     Jan-Erik Rediger <janerik at fnordig dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __NET_H
-#define __NET_H
-
-#include "hiredis.h"
-
-void redisNetClose(redisContext *c);
-ssize_t redisNetRead(redisContext *c, char *buf, size_t bufcap);
-ssize_t redisNetWrite(redisContext *c);
-
-int redisCheckSocketError(redisContext *c);
-int redisContextSetTimeout(redisContext *c, const struct timeval tv);
-int redisContextConnectTcp(redisContext *c, const char *addr, int port, const struct timeval *timeout);
-int redisContextConnectBindTcp(redisContext *c, const char *addr, int port,
-                               const struct timeval *timeout,
-                               const char *source_addr);
-int redisContextConnectUnix(redisContext *c, const char *path, const struct timeval *timeout);
-int redisKeepAlive(redisContext *c, int interval);
-int redisCheckConnectDone(redisContext *c, int *completed);
-
-int redisSetTcpNoDelay(redisContext *c);
-
-#endif
diff --git a/redis-stable/deps/hiredis/read.c b/redis-stable/deps/hiredis/read.c
deleted file mode 100644
index 682b9a6b..00000000
--- a/redis-stable/deps/hiredis/read.c
+++ /dev/null
@@ -1,739 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include <string.h>
-#include <stdlib.h>
-#ifndef _MSC_VER
-#include <unistd.h>
-#include <strings.h>
-#endif
-#include <assert.h>
-#include <errno.h>
-#include <ctype.h>
-#include <limits.h>
-#include <math.h>
-
-#include "alloc.h"
-#include "read.h"
-#include "sds.h"
-#include "win32.h"
-
-/* Initial size of our nested reply stack and how much we grow it when needd */
-#define REDIS_READER_STACK_SIZE 9
-
-static void __redisReaderSetError(redisReader *r, int type, const char *str) {
-    size_t len;
-
-    if (r->reply != NULL && r->fn && r->fn->freeObject) {
-        r->fn->freeObject(r->reply);
-        r->reply = NULL;
-    }
-
-    /* Clear input buffer on errors. */
-    hi_sdsfree(r->buf);
-    r->buf = NULL;
-    r->pos = r->len = 0;
-
-    /* Reset task stack. */
-    r->ridx = -1;
-
-    /* Set error. */
-    r->err = type;
-    len = strlen(str);
-    len = len < (sizeof(r->errstr)-1) ? len : (sizeof(r->errstr)-1);
-    memcpy(r->errstr,str,len);
-    r->errstr[len] = '\0';
-}
-
-static size_t chrtos(char *buf, size_t size, char byte) {
-    size_t len = 0;
-
-    switch(byte) {
-    case '\\':
-    case '"':
-        len = snprintf(buf,size,"\"\\%c\"",byte);
-        break;
-    case '\n': len = snprintf(buf,size,"\"\\n\""); break;
-    case '\r': len = snprintf(buf,size,"\"\\r\""); break;
-    case '\t': len = snprintf(buf,size,"\"\\t\""); break;
-    case '\a': len = snprintf(buf,size,"\"\\a\""); break;
-    case '\b': len = snprintf(buf,size,"\"\\b\""); break;
-    default:
-        if (isprint(byte))
-            len = snprintf(buf,size,"\"%c\"",byte);
-        else
-            len = snprintf(buf,size,"\"\\x%02x\"",(unsigned char)byte);
-        break;
-    }
-
-    return len;
-}
-
-static void __redisReaderSetErrorProtocolByte(redisReader *r, char byte) {
-    char cbuf[8], sbuf[128];
-
-    chrtos(cbuf,sizeof(cbuf),byte);
-    snprintf(sbuf,sizeof(sbuf),
-        "Protocol error, got %s as reply type byte", cbuf);
-    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,sbuf);
-}
-
-static void __redisReaderSetErrorOOM(redisReader *r) {
-    __redisReaderSetError(r,REDIS_ERR_OOM,"Out of memory");
-}
-
-static char *readBytes(redisReader *r, unsigned int bytes) {
-    char *p;
-    if (r->len-r->pos >= bytes) {
-        p = r->buf+r->pos;
-        r->pos += bytes;
-        return p;
-    }
-    return NULL;
-}
-
-/* Find pointer to \r\n. */
-static char *seekNewline(char *s, size_t len) {
-    int pos = 0;
-    int _len = len-1;
-
-    /* Position should be < len-1 because the character at "pos" should be
-     * followed by a \n. Note that strchr cannot be used because it doesn't
-     * allow to search a limited length and the buffer that is being searched
-     * might not have a trailing NULL character. */
-    while (pos < _len) {
-        while(pos < _len && s[pos] != '\r') pos++;
-        if (pos==_len) {
-            /* Not found. */
-            return NULL;
-        } else {
-            if (s[pos+1] == '\n') {
-                /* Found. */
-                return s+pos;
-            } else {
-                /* Continue searching. */
-                pos++;
-            }
-        }
-    }
-    return NULL;
-}
-
-/* Convert a string into a long long. Returns REDIS_OK if the string could be
- * parsed into a (non-overflowing) long long, REDIS_ERR otherwise. The value
- * will be set to the parsed value when appropriate.
- *
- * Note that this function demands that the string strictly represents
- * a long long: no spaces or other characters before or after the string
- * representing the number are accepted, nor zeroes at the start if not
- * for the string "0" representing the zero number.
- *
- * Because of its strictness, it is safe to use this function to check if
- * you can convert a string into a long long, and obtain back the string
- * from the number without any loss in the string representation. */
-static int string2ll(const char *s, size_t slen, long long *value) {
-    const char *p = s;
-    size_t plen = 0;
-    int negative = 0;
-    unsigned long long v;
-
-    if (plen == slen)
-        return REDIS_ERR;
-
-    /* Special case: first and only digit is 0. */
-    if (slen == 1 && p[0] == '0') {
-        if (value != NULL) *value = 0;
-        return REDIS_OK;
-    }
-
-    if (p[0] == '-') {
-        negative = 1;
-        p++; plen++;
-
-        /* Abort on only a negative sign. */
-        if (plen == slen)
-            return REDIS_ERR;
-    }
-
-    /* First digit should be 1-9, otherwise the string should just be 0. */
-    if (p[0] >= '1' && p[0] <= '9') {
-        v = p[0]-'0';
-        p++; plen++;
-    } else if (p[0] == '0' && slen == 1) {
-        *value = 0;
-        return REDIS_OK;
-    } else {
-        return REDIS_ERR;
-    }
-
-    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
-        if (v > (ULLONG_MAX / 10)) /* Overflow. */
-            return REDIS_ERR;
-        v *= 10;
-
-        if (v > (ULLONG_MAX - (p[0]-'0'))) /* Overflow. */
-            return REDIS_ERR;
-        v += p[0]-'0';
-
-        p++; plen++;
-    }
-
-    /* Return if not all bytes were used. */
-    if (plen < slen)
-        return REDIS_ERR;
-
-    if (negative) {
-        if (v > ((unsigned long long)(-(LLONG_MIN+1))+1)) /* Overflow. */
-            return REDIS_ERR;
-        if (value != NULL) *value = -v;
-    } else {
-        if (v > LLONG_MAX) /* Overflow. */
-            return REDIS_ERR;
-        if (value != NULL) *value = v;
-    }
-    return REDIS_OK;
-}
-
-static char *readLine(redisReader *r, int *_len) {
-    char *p, *s;
-    int len;
-
-    p = r->buf+r->pos;
-    s = seekNewline(p,(r->len-r->pos));
-    if (s != NULL) {
-        len = s-(r->buf+r->pos);
-        r->pos += len+2; /* skip \r\n */
-        if (_len) *_len = len;
-        return p;
-    }
-    return NULL;
-}
-
-static void moveToNextTask(redisReader *r) {
-    redisReadTask *cur, *prv;
-    while (r->ridx >= 0) {
-        /* Return a.s.a.p. when the stack is now empty. */
-        if (r->ridx == 0) {
-            r->ridx--;
-            return;
-        }
-
-        cur = r->task[r->ridx];
-        prv = r->task[r->ridx-1];
-        assert(prv->type == REDIS_REPLY_ARRAY ||
-               prv->type == REDIS_REPLY_MAP ||
-               prv->type == REDIS_REPLY_SET ||
-               prv->type == REDIS_REPLY_PUSH);
-        if (cur->idx == prv->elements-1) {
-            r->ridx--;
-        } else {
-            /* Reset the type because the next item can be anything */
-            assert(cur->idx < prv->elements);
-            cur->type = -1;
-            cur->elements = -1;
-            cur->idx++;
-            return;
-        }
-    }
-}
-
-static int processLineItem(redisReader *r) {
-    redisReadTask *cur = r->task[r->ridx];
-    void *obj;
-    char *p;
-    int len;
-
-    if ((p = readLine(r,&len)) != NULL) {
-        if (cur->type == REDIS_REPLY_INTEGER) {
-            if (r->fn && r->fn->createInteger) {
-                long long v;
-                if (string2ll(p, len, &v) == REDIS_ERR) {
-                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                            "Bad integer value");
-                    return REDIS_ERR;
-                }
-                obj = r->fn->createInteger(cur,v);
-            } else {
-                obj = (void*)REDIS_REPLY_INTEGER;
-            }
-        } else if (cur->type == REDIS_REPLY_DOUBLE) {
-            if (r->fn && r->fn->createDouble) {
-                char buf[326], *eptr;
-                double d;
-
-                if ((size_t)len >= sizeof(buf)) {
-                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                            "Double value is too large");
-                    return REDIS_ERR;
-                }
-
-                memcpy(buf,p,len);
-                buf[len] = '\0';
-
-                if (strcasecmp(buf,",inf") == 0) {
-                    d = INFINITY; /* Positive infinite. */
-                } else if (strcasecmp(buf,",-inf") == 0) {
-                    d = -INFINITY; /* Negative infinite. */
-                } else {
-                    d = strtod((char*)buf,&eptr);
-                    if (buf[0] == '\0' || eptr[0] != '\0' || isnan(d)) {
-                        __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                                "Bad double value");
-                        return REDIS_ERR;
-                    }
-                }
-                obj = r->fn->createDouble(cur,d,buf,len);
-            } else {
-                obj = (void*)REDIS_REPLY_DOUBLE;
-            }
-        } else if (cur->type == REDIS_REPLY_NIL) {
-            if (r->fn && r->fn->createNil)
-                obj = r->fn->createNil(cur);
-            else
-                obj = (void*)REDIS_REPLY_NIL;
-        } else if (cur->type == REDIS_REPLY_BOOL) {
-            int bval = p[0] == 't' || p[0] == 'T';
-            if (r->fn && r->fn->createBool)
-                obj = r->fn->createBool(cur,bval);
-            else
-                obj = (void*)REDIS_REPLY_BOOL;
-        } else {
-            /* Type will be error or status. */
-            if (r->fn && r->fn->createString)
-                obj = r->fn->createString(cur,p,len);
-            else
-                obj = (void*)(size_t)(cur->type);
-        }
-
-        if (obj == NULL) {
-            __redisReaderSetErrorOOM(r);
-            return REDIS_ERR;
-        }
-
-        /* Set reply if this is the root object. */
-        if (r->ridx == 0) r->reply = obj;
-        moveToNextTask(r);
-        return REDIS_OK;
-    }
-
-    return REDIS_ERR;
-}
-
-static int processBulkItem(redisReader *r) {
-    redisReadTask *cur = r->task[r->ridx];
-    void *obj = NULL;
-    char *p, *s;
-    long long len;
-    unsigned long bytelen;
-    int success = 0;
-
-    p = r->buf+r->pos;
-    s = seekNewline(p,r->len-r->pos);
-    if (s != NULL) {
-        p = r->buf+r->pos;
-        bytelen = s-(r->buf+r->pos)+2; /* include \r\n */
-
-        if (string2ll(p, bytelen - 2, &len) == REDIS_ERR) {
-            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                    "Bad bulk string length");
-            return REDIS_ERR;
-        }
-
-        if (len < -1 || (LLONG_MAX > SIZE_MAX && len > (long long)SIZE_MAX)) {
-            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                    "Bulk string length out of range");
-            return REDIS_ERR;
-        }
-
-        if (len == -1) {
-            /* The nil object can always be created. */
-            if (r->fn && r->fn->createNil)
-                obj = r->fn->createNil(cur);
-            else
-                obj = (void*)REDIS_REPLY_NIL;
-            success = 1;
-        } else {
-            /* Only continue when the buffer contains the entire bulk item. */
-            bytelen += len+2; /* include \r\n */
-            if (r->pos+bytelen <= r->len) {
-                if ((cur->type == REDIS_REPLY_VERB && len < 4) ||
-                    (cur->type == REDIS_REPLY_VERB && s[5] != ':'))
-                {
-                    __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                            "Verbatim string 4 bytes of content type are "
-                            "missing or incorrectly encoded.");
-                    return REDIS_ERR;
-                }
-                if (r->fn && r->fn->createString)
-                    obj = r->fn->createString(cur,s+2,len);
-                else
-                    obj = (void*)(long)cur->type;
-                success = 1;
-            }
-        }
-
-        /* Proceed when obj was created. */
-        if (success) {
-            if (obj == NULL) {
-                __redisReaderSetErrorOOM(r);
-                return REDIS_ERR;
-            }
-
-            r->pos += bytelen;
-
-            /* Set reply if this is the root object. */
-            if (r->ridx == 0) r->reply = obj;
-            moveToNextTask(r);
-            return REDIS_OK;
-        }
-    }
-
-    return REDIS_ERR;
-}
-
-static int redisReaderGrow(redisReader *r) {
-    redisReadTask **aux;
-    int newlen;
-
-    /* Grow our stack size */
-    newlen = r->tasks + REDIS_READER_STACK_SIZE;
-    aux = hi_realloc(r->task, sizeof(*r->task) * newlen);
-    if (aux == NULL)
-        goto oom;
-
-    r->task = aux;
-
-    /* Allocate new tasks */
-    for (; r->tasks < newlen; r->tasks++) {
-        r->task[r->tasks] = hi_calloc(1, sizeof(**r->task));
-        if (r->task[r->tasks] == NULL)
-            goto oom;
-    }
-
-    return REDIS_OK;
-oom:
-    __redisReaderSetErrorOOM(r);
-    return REDIS_ERR;
-}
-
-/* Process the array, map and set types. */
-static int processAggregateItem(redisReader *r) {
-    redisReadTask *cur = r->task[r->ridx];
-    void *obj;
-    char *p;
-    long long elements;
-    int root = 0, len;
-
-    /* Set error for nested multi bulks with depth > 7 */
-    if (r->ridx == r->tasks - 1) {
-        if (redisReaderGrow(r) == REDIS_ERR)
-            return REDIS_ERR;
-    }
-
-    if ((p = readLine(r,&len)) != NULL) {
-        if (string2ll(p, len, &elements) == REDIS_ERR) {
-            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                    "Bad multi-bulk length");
-            return REDIS_ERR;
-        }
-
-        root = (r->ridx == 0);
-
-        if (elements < -1 || (LLONG_MAX > SIZE_MAX && elements > SIZE_MAX) ||
-            (r->maxelements > 0 && elements > r->maxelements))
-        {
-            __redisReaderSetError(r,REDIS_ERR_PROTOCOL,
-                    "Multi-bulk length out of range");
-            return REDIS_ERR;
-        }
-
-        if (elements == -1) {
-            if (r->fn && r->fn->createNil)
-                obj = r->fn->createNil(cur);
-            else
-                obj = (void*)REDIS_REPLY_NIL;
-
-            if (obj == NULL) {
-                __redisReaderSetErrorOOM(r);
-                return REDIS_ERR;
-            }
-
-            moveToNextTask(r);
-        } else {
-            if (cur->type == REDIS_REPLY_MAP) elements *= 2;
-
-            if (r->fn && r->fn->createArray)
-                obj = r->fn->createArray(cur,elements);
-            else
-                obj = (void*)(long)cur->type;
-
-            if (obj == NULL) {
-                __redisReaderSetErrorOOM(r);
-                return REDIS_ERR;
-            }
-
-            /* Modify task stack when there are more than 0 elements. */
-            if (elements > 0) {
-                cur->elements = elements;
-                cur->obj = obj;
-                r->ridx++;
-                r->task[r->ridx]->type = -1;
-                r->task[r->ridx]->elements = -1;
-                r->task[r->ridx]->idx = 0;
-                r->task[r->ridx]->obj = NULL;
-                r->task[r->ridx]->parent = cur;
-                r->task[r->ridx]->privdata = r->privdata;
-            } else {
-                moveToNextTask(r);
-            }
-        }
-
-        /* Set reply if this is the root object. */
-        if (root) r->reply = obj;
-        return REDIS_OK;
-    }
-
-    return REDIS_ERR;
-}
-
-static int processItem(redisReader *r) {
-    redisReadTask *cur = r->task[r->ridx];
-    char *p;
-
-    /* check if we need to read type */
-    if (cur->type < 0) {
-        if ((p = readBytes(r,1)) != NULL) {
-            switch (p[0]) {
-            case '-':
-                cur->type = REDIS_REPLY_ERROR;
-                break;
-            case '+':
-                cur->type = REDIS_REPLY_STATUS;
-                break;
-            case ':':
-                cur->type = REDIS_REPLY_INTEGER;
-                break;
-            case ',':
-                cur->type = REDIS_REPLY_DOUBLE;
-                break;
-            case '_':
-                cur->type = REDIS_REPLY_NIL;
-                break;
-            case '$':
-                cur->type = REDIS_REPLY_STRING;
-                break;
-            case '*':
-                cur->type = REDIS_REPLY_ARRAY;
-                break;
-            case '%':
-                cur->type = REDIS_REPLY_MAP;
-                break;
-            case '~':
-                cur->type = REDIS_REPLY_SET;
-                break;
-            case '#':
-                cur->type = REDIS_REPLY_BOOL;
-                break;
-            case '=':
-                cur->type = REDIS_REPLY_VERB;
-                break;
-            case '>':
-                cur->type = REDIS_REPLY_PUSH;
-                break;
-            default:
-                __redisReaderSetErrorProtocolByte(r,*p);
-                return REDIS_ERR;
-            }
-        } else {
-            /* could not consume 1 byte */
-            return REDIS_ERR;
-        }
-    }
-
-    /* process typed item */
-    switch(cur->type) {
-    case REDIS_REPLY_ERROR:
-    case REDIS_REPLY_STATUS:
-    case REDIS_REPLY_INTEGER:
-    case REDIS_REPLY_DOUBLE:
-    case REDIS_REPLY_NIL:
-    case REDIS_REPLY_BOOL:
-        return processLineItem(r);
-    case REDIS_REPLY_STRING:
-    case REDIS_REPLY_VERB:
-        return processBulkItem(r);
-    case REDIS_REPLY_ARRAY:
-    case REDIS_REPLY_MAP:
-    case REDIS_REPLY_SET:
-    case REDIS_REPLY_PUSH:
-        return processAggregateItem(r);
-    default:
-        assert(NULL);
-        return REDIS_ERR; /* Avoid warning. */
-    }
-}
-
-redisReader *redisReaderCreateWithFunctions(redisReplyObjectFunctions *fn) {
-    redisReader *r;
-
-    r = hi_calloc(1,sizeof(redisReader));
-    if (r == NULL)
-        return NULL;
-
-    r->buf = hi_sdsempty();
-    if (r->buf == NULL)
-        goto oom;
-
-    r->task = hi_calloc(REDIS_READER_STACK_SIZE, sizeof(*r->task));
-    if (r->task == NULL)
-        goto oom;
-
-    for (; r->tasks < REDIS_READER_STACK_SIZE; r->tasks++) {
-        r->task[r->tasks] = hi_calloc(1, sizeof(**r->task));
-        if (r->task[r->tasks] == NULL)
-            goto oom;
-    }
-
-    r->fn = fn;
-    r->maxbuf = REDIS_READER_MAX_BUF;
-    r->maxelements = REDIS_READER_MAX_ARRAY_ELEMENTS;
-    r->ridx = -1;
-
-    return r;
-oom:
-    redisReaderFree(r);
-    return NULL;
-}
-
-void redisReaderFree(redisReader *r) {
-    if (r == NULL)
-        return;
-
-    if (r->reply != NULL && r->fn && r->fn->freeObject)
-        r->fn->freeObject(r->reply);
-
-    if (r->task) {
-        /* We know r->task[i] is allocated if i < r->tasks */
-        for (int i = 0; i < r->tasks; i++) {
-            hi_free(r->task[i]);
-        }
-
-        hi_free(r->task);
-    }
-
-    hi_sdsfree(r->buf);
-    hi_free(r);
-}
-
-int redisReaderFeed(redisReader *r, const char *buf, size_t len) {
-    hisds newbuf;
-
-    /* Return early when this reader is in an erroneous state. */
-    if (r->err)
-        return REDIS_ERR;
-
-    /* Copy the provided buffer. */
-    if (buf != NULL && len >= 1) {
-        /* Destroy internal buffer when it is empty and is quite large. */
-        if (r->len == 0 && r->maxbuf != 0 && hi_sdsavail(r->buf) > r->maxbuf) {
-            hi_sdsfree(r->buf);
-            r->buf = hi_sdsempty();
-            if (r->buf == 0) goto oom;
-
-            r->pos = 0;
-        }
-
-        newbuf = hi_sdscatlen(r->buf,buf,len);
-        if (newbuf == NULL) goto oom;
-
-        r->buf = newbuf;
-        r->len = hi_sdslen(r->buf);
-    }
-
-    return REDIS_OK;
-oom:
-    __redisReaderSetErrorOOM(r);
-    return REDIS_ERR;
-}
-
-int redisReaderGetReply(redisReader *r, void **reply) {
-    /* Default target pointer to NULL. */
-    if (reply != NULL)
-        *reply = NULL;
-
-    /* Return early when this reader is in an erroneous state. */
-    if (r->err)
-        return REDIS_ERR;
-
-    /* When the buffer is empty, there will never be a reply. */
-    if (r->len == 0)
-        return REDIS_OK;
-
-    /* Set first item to process when the stack is empty. */
-    if (r->ridx == -1) {
-        r->task[0]->type = -1;
-        r->task[0]->elements = -1;
-        r->task[0]->idx = -1;
-        r->task[0]->obj = NULL;
-        r->task[0]->parent = NULL;
-        r->task[0]->privdata = r->privdata;
-        r->ridx = 0;
-    }
-
-    /* Process items in reply. */
-    while (r->ridx >= 0)
-        if (processItem(r) != REDIS_OK)
-            break;
-
-    /* Return ASAP when an error occurred. */
-    if (r->err)
-        return REDIS_ERR;
-
-    /* Discard part of the buffer when we've consumed at least 1k, to avoid
-     * doing unnecessary calls to memmove() in sds.c. */
-    if (r->pos >= 1024) {
-        if (hi_sdsrange(r->buf,r->pos,-1) < 0) return REDIS_ERR;
-        r->pos = 0;
-        r->len = hi_sdslen(r->buf);
-    }
-
-    /* Emit a reply when there is one. */
-    if (r->ridx == -1) {
-        if (reply != NULL) {
-            *reply = r->reply;
-        } else if (r->reply != NULL && r->fn && r->fn->freeObject) {
-            r->fn->freeObject(r->reply);
-        }
-        r->reply = NULL;
-    }
-    return REDIS_OK;
-}
diff --git a/redis-stable/deps/hiredis/read.h b/redis-stable/deps/hiredis/read.h
deleted file mode 100644
index 2d74d77a..00000000
--- a/redis-stable/deps/hiredis/read.h
+++ /dev/null
@@ -1,129 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#ifndef __HIREDIS_READ_H
-#define __HIREDIS_READ_H
-#include <stdio.h> /* for size_t */
-
-#define REDIS_ERR -1
-#define REDIS_OK 0
-
-/* When an error occurs, the err flag in a context is set to hold the type of
- * error that occurred. REDIS_ERR_IO means there was an I/O error and you
- * should use the "errno" variable to find out what is wrong.
- * For other values, the "errstr" field will hold a description. */
-#define REDIS_ERR_IO 1 /* Error in read or write */
-#define REDIS_ERR_EOF 3 /* End of file */
-#define REDIS_ERR_PROTOCOL 4 /* Protocol error */
-#define REDIS_ERR_OOM 5 /* Out of memory */
-#define REDIS_ERR_TIMEOUT 6 /* Timed out */
-#define REDIS_ERR_OTHER 2 /* Everything else... */
-
-#define REDIS_REPLY_STRING 1
-#define REDIS_REPLY_ARRAY 2
-#define REDIS_REPLY_INTEGER 3
-#define REDIS_REPLY_NIL 4
-#define REDIS_REPLY_STATUS 5
-#define REDIS_REPLY_ERROR 6
-#define REDIS_REPLY_DOUBLE 7
-#define REDIS_REPLY_BOOL 8
-#define REDIS_REPLY_MAP 9
-#define REDIS_REPLY_SET 10
-#define REDIS_REPLY_ATTR 11
-#define REDIS_REPLY_PUSH 12
-#define REDIS_REPLY_BIGNUM 13
-#define REDIS_REPLY_VERB 14
-
-/* Default max unused reader buffer. */
-#define REDIS_READER_MAX_BUF (1024*16)
-
-/* Default multi-bulk element limit */
-#define REDIS_READER_MAX_ARRAY_ELEMENTS ((1LL<<32) - 1)
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct redisReadTask {
-    int type;
-    long long elements; /* number of elements in multibulk container */
-    int idx; /* index in parent (array) object */
-    void *obj; /* holds user-generated value for a read task */
-    struct redisReadTask *parent; /* parent task */
-    void *privdata; /* user-settable arbitrary field */
-} redisReadTask;
-
-typedef struct redisReplyObjectFunctions {
-    void *(*createString)(const redisReadTask*, char*, size_t);
-    void *(*createArray)(const redisReadTask*, size_t);
-    void *(*createInteger)(const redisReadTask*, long long);
-    void *(*createDouble)(const redisReadTask*, double, char*, size_t);
-    void *(*createNil)(const redisReadTask*);
-    void *(*createBool)(const redisReadTask*, int);
-    void (*freeObject)(void*);
-} redisReplyObjectFunctions;
-
-typedef struct redisReader {
-    int err; /* Error flags, 0 when there is no error */
-    char errstr[128]; /* String representation of error when applicable */
-
-    char *buf; /* Read buffer */
-    size_t pos; /* Buffer cursor */
-    size_t len; /* Buffer length */
-    size_t maxbuf; /* Max length of unused buffer */
-    long long maxelements; /* Max multi-bulk elements */
-
-    redisReadTask **task;
-    int tasks;
-
-    int ridx; /* Index of current read task */
-    void *reply; /* Temporary reply pointer */
-
-    redisReplyObjectFunctions *fn;
-    void *privdata;
-} redisReader;
-
-/* Public API for the protocol parser. */
-redisReader *redisReaderCreateWithFunctions(redisReplyObjectFunctions *fn);
-void redisReaderFree(redisReader *r);
-int redisReaderFeed(redisReader *r, const char *buf, size_t len);
-int redisReaderGetReply(redisReader *r, void **reply);
-
-#define redisReaderSetPrivdata(_r, _p) (int)(((redisReader*)(_r))->privdata = (_p))
-#define redisReaderGetObject(_r) (((redisReader*)(_r))->reply)
-#define redisReaderGetError(_r) (((redisReader*)(_r))->errstr)
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/redis-stable/deps/hiredis/sds.c b/redis-stable/deps/hiredis/sds.c
deleted file mode 100644
index 675e7649..00000000
--- a/redis-stable/deps/hiredis/sds.c
+++ /dev/null
@@ -1,1289 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Oran Agra
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <ctype.h>
-#include <assert.h>
-#include <limits.h>
-#include "sds.h"
-#include "sdsalloc.h"
-
-static inline int hi_sdsHdrSize(char type) {
-    switch(type&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            return sizeof(struct hisdshdr5);
-        case HI_SDS_TYPE_8:
-            return sizeof(struct hisdshdr8);
-        case HI_SDS_TYPE_16:
-            return sizeof(struct hisdshdr16);
-        case HI_SDS_TYPE_32:
-            return sizeof(struct hisdshdr32);
-        case HI_SDS_TYPE_64:
-            return sizeof(struct hisdshdr64);
-    }
-    return 0;
-}
-
-static inline char hi_sdsReqType(size_t string_size) {
-    if (string_size < 32)
-        return HI_SDS_TYPE_5;
-    if (string_size < 0xff)
-        return HI_SDS_TYPE_8;
-    if (string_size < 0xffff)
-        return HI_SDS_TYPE_16;
-    if (string_size < 0xffffffff)
-        return HI_SDS_TYPE_32;
-    return HI_SDS_TYPE_64;
-}
-
-/* Create a new hisds string with the content specified by the 'init' pointer
- * and 'initlen'.
- * If NULL is used for 'init' the string is initialized with zero bytes.
- *
- * The string is always null-termined (all the hisds strings are, always) so
- * even if you create an hisds string with:
- *
- * mystring = hi_sdsnewlen("abc",3);
- *
- * You can print the string with printf() as there is an implicit \0 at the
- * end of the string. However the string is binary safe and can contain
- * \0 characters in the middle, as the length is stored in the hisds header. */
-hisds hi_sdsnewlen(const void *init, size_t initlen) {
-    void *sh;
-    hisds s;
-    char type = hi_sdsReqType(initlen);
-    /* Empty strings are usually created in order to append. Use type 8
-     * since type 5 is not good at this. */
-    if (type == HI_SDS_TYPE_5 && initlen == 0) type = HI_SDS_TYPE_8;
-    int hdrlen = hi_sdsHdrSize(type);
-    unsigned char *fp; /* flags pointer. */
-
-    sh = hi_s_malloc(hdrlen+initlen+1);
-    if (sh == NULL) return NULL;
-    if (!init)
-        memset(sh, 0, hdrlen+initlen+1);
-    s = (char*)sh+hdrlen;
-    fp = ((unsigned char*)s)-1;
-    switch(type) {
-        case HI_SDS_TYPE_5: {
-            *fp = type | (initlen << HI_SDS_TYPE_BITS);
-            break;
-        }
-        case HI_SDS_TYPE_8: {
-            HI_SDS_HDR_VAR(8,s);
-            sh->len = initlen;
-            sh->alloc = initlen;
-            *fp = type;
-            break;
-        }
-        case HI_SDS_TYPE_16: {
-            HI_SDS_HDR_VAR(16,s);
-            sh->len = initlen;
-            sh->alloc = initlen;
-            *fp = type;
-            break;
-        }
-        case HI_SDS_TYPE_32: {
-            HI_SDS_HDR_VAR(32,s);
-            sh->len = initlen;
-            sh->alloc = initlen;
-            *fp = type;
-            break;
-        }
-        case HI_SDS_TYPE_64: {
-            HI_SDS_HDR_VAR(64,s);
-            sh->len = initlen;
-            sh->alloc = initlen;
-            *fp = type;
-            break;
-        }
-    }
-    if (initlen && init)
-        memcpy(s, init, initlen);
-    s[initlen] = '\0';
-    return s;
-}
-
-/* Create an empty (zero length) hisds string. Even in this case the string
- * always has an implicit null term. */
-hisds hi_sdsempty(void) {
-    return hi_sdsnewlen("",0);
-}
-
-/* Create a new hisds string starting from a null terminated C string. */
-hisds hi_sdsnew(const char *init) {
-    size_t initlen = (init == NULL) ? 0 : strlen(init);
-    return hi_sdsnewlen(init, initlen);
-}
-
-/* Duplicate an hisds string. */
-hisds hi_sdsdup(const hisds s) {
-    return hi_sdsnewlen(s, hi_sdslen(s));
-}
-
-/* Free an hisds string. No operation is performed if 's' is NULL. */
-void hi_sdsfree(hisds s) {
-    if (s == NULL) return;
-    hi_s_free((char*)s-hi_sdsHdrSize(s[-1]));
-}
-
-/* Set the hisds string length to the length as obtained with strlen(), so
- * considering as content only up to the first null term character.
- *
- * This function is useful when the hisds string is hacked manually in some
- * way, like in the following example:
- *
- * s = hi_sdsnew("foobar");
- * s[2] = '\0';
- * hi_sdsupdatelen(s);
- * printf("%d\n", hi_sdslen(s));
- *
- * The output will be "2", but if we comment out the call to hi_sdsupdatelen()
- * the output will be "6" as the string was modified but the logical length
- * remains 6 bytes. */
-void hi_sdsupdatelen(hisds s) {
-    int reallen = strlen(s);
-    hi_sdssetlen(s, reallen);
-}
-
-/* Modify an hisds string in-place to make it empty (zero length).
- * However all the existing buffer is not discarded but set as free space
- * so that next append operations will not require allocations up to the
- * number of bytes previously available. */
-void hi_sdsclear(hisds s) {
-    hi_sdssetlen(s, 0);
-    s[0] = '\0';
-}
-
-/* Enlarge the free space at the end of the hisds string so that the caller
- * is sure that after calling this function can overwrite up to addlen
- * bytes after the end of the string, plus one more byte for nul term.
- *
- * Note: this does not change the *length* of the hisds string as returned
- * by hi_sdslen(), but only the free buffer space we have. */
-hisds hi_sdsMakeRoomFor(hisds s, size_t addlen) {
-    void *sh, *newsh;
-    size_t avail = hi_sdsavail(s);
-    size_t len, newlen;
-    char type, oldtype = s[-1] & HI_SDS_TYPE_MASK;
-    int hdrlen;
-
-    /* Return ASAP if there is enough space left. */
-    if (avail >= addlen) return s;
-
-    len = hi_sdslen(s);
-    sh = (char*)s-hi_sdsHdrSize(oldtype);
-    newlen = (len+addlen);
-    if (newlen < HI_SDS_MAX_PREALLOC)
-        newlen *= 2;
-    else
-        newlen += HI_SDS_MAX_PREALLOC;
-
-    type = hi_sdsReqType(newlen);
-
-    /* Don't use type 5: the user is appending to the string and type 5 is
-     * not able to remember empty space, so hi_sdsMakeRoomFor() must be called
-     * at every appending operation. */
-    if (type == HI_SDS_TYPE_5) type = HI_SDS_TYPE_8;
-
-    hdrlen = hi_sdsHdrSize(type);
-    if (oldtype==type) {
-        newsh = hi_s_realloc(sh, hdrlen+newlen+1);
-        if (newsh == NULL) return NULL;
-        s = (char*)newsh+hdrlen;
-    } else {
-        /* Since the header size changes, need to move the string forward,
-         * and can't use realloc */
-        newsh = hi_s_malloc(hdrlen+newlen+1);
-        if (newsh == NULL) return NULL;
-        memcpy((char*)newsh+hdrlen, s, len+1);
-        hi_s_free(sh);
-        s = (char*)newsh+hdrlen;
-        s[-1] = type;
-        hi_sdssetlen(s, len);
-    }
-    hi_sdssetalloc(s, newlen);
-    return s;
-}
-
-/* Reallocate the hisds string so that it has no free space at the end. The
- * contained string remains not altered, but next concatenation operations
- * will require a reallocation.
- *
- * After the call, the passed hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-hisds hi_sdsRemoveFreeSpace(hisds s) {
-    void *sh, *newsh;
-    char type, oldtype = s[-1] & HI_SDS_TYPE_MASK;
-    int hdrlen;
-    size_t len = hi_sdslen(s);
-    sh = (char*)s-hi_sdsHdrSize(oldtype);
-
-    type = hi_sdsReqType(len);
-    hdrlen = hi_sdsHdrSize(type);
-    if (oldtype==type) {
-        newsh = hi_s_realloc(sh, hdrlen+len+1);
-        if (newsh == NULL) return NULL;
-        s = (char*)newsh+hdrlen;
-    } else {
-        newsh = hi_s_malloc(hdrlen+len+1);
-        if (newsh == NULL) return NULL;
-        memcpy((char*)newsh+hdrlen, s, len+1);
-        hi_s_free(sh);
-        s = (char*)newsh+hdrlen;
-        s[-1] = type;
-        hi_sdssetlen(s, len);
-    }
-    hi_sdssetalloc(s, len);
-    return s;
-}
-
-/* Return the total size of the allocation of the specifed hisds string,
- * including:
- * 1) The hisds header before the pointer.
- * 2) The string.
- * 3) The free buffer at the end if any.
- * 4) The implicit null term.
- */
-size_t hi_sdsAllocSize(hisds s) {
-    size_t alloc = hi_sdsalloc(s);
-    return hi_sdsHdrSize(s[-1])+alloc+1;
-}
-
-/* Return the pointer of the actual SDS allocation (normally SDS strings
- * are referenced by the start of the string buffer). */
-void *hi_sdsAllocPtr(hisds s) {
-    return (void*) (s-hi_sdsHdrSize(s[-1]));
-}
-
-/* Increment the hisds length and decrements the left free space at the
- * end of the string according to 'incr'. Also set the null term
- * in the new end of the string.
- *
- * This function is used in order to fix the string length after the
- * user calls hi_sdsMakeRoomFor(), writes something after the end of
- * the current string, and finally needs to set the new length.
- *
- * Note: it is possible to use a negative increment in order to
- * right-trim the string.
- *
- * Usage example:
- *
- * Using hi_sdsIncrLen() and hi_sdsMakeRoomFor() it is possible to mount the
- * following schema, to cat bytes coming from the kernel to the end of an
- * hisds string without copying into an intermediate buffer:
- *
- * oldlen = hi_hi_sdslen(s);
- * s = hi_sdsMakeRoomFor(s, BUFFER_SIZE);
- * nread = read(fd, s+oldlen, BUFFER_SIZE);
- * ... check for nread <= 0 and handle it ...
- * hi_sdsIncrLen(s, nread);
- */
-void hi_sdsIncrLen(hisds s, int incr) {
-    unsigned char flags = s[-1];
-    size_t len;
-    switch(flags&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5: {
-            unsigned char *fp = ((unsigned char*)s)-1;
-            unsigned char oldlen = HI_SDS_TYPE_5_LEN(flags);
-            assert((incr > 0 && oldlen+incr < 32) || (incr < 0 && oldlen >= (unsigned int)(-incr)));
-            *fp = HI_SDS_TYPE_5 | ((oldlen+incr) << HI_SDS_TYPE_BITS);
-            len = oldlen+incr;
-            break;
-        }
-        case HI_SDS_TYPE_8: {
-            HI_SDS_HDR_VAR(8,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case HI_SDS_TYPE_16: {
-            HI_SDS_HDR_VAR(16,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case HI_SDS_TYPE_32: {
-            HI_SDS_HDR_VAR(32,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= (unsigned int)incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case HI_SDS_TYPE_64: {
-            HI_SDS_HDR_VAR(64,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= (uint64_t)incr) || (incr < 0 && sh->len >= (uint64_t)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        default: len = 0; /* Just to avoid compilation warnings. */
-    }
-    s[len] = '\0';
-}
-
-/* Grow the hisds to have the specified length. Bytes that were not part of
- * the original length of the hisds will be set to zero.
- *
- * if the specified length is smaller than the current length, no operation
- * is performed. */
-hisds hi_sdsgrowzero(hisds s, size_t len) {
-    size_t curlen = hi_sdslen(s);
-
-    if (len <= curlen) return s;
-    s = hi_sdsMakeRoomFor(s,len-curlen);
-    if (s == NULL) return NULL;
-
-    /* Make sure added region doesn't contain garbage */
-    memset(s+curlen,0,(len-curlen+1)); /* also set trailing \0 byte */
-    hi_sdssetlen(s, len);
-    return s;
-}
-
-/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the
- * end of the specified hisds string 's'.
- *
- * After the call, the passed hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-hisds hi_sdscatlen(hisds s, const void *t, size_t len) {
-    size_t curlen = hi_sdslen(s);
-
-    s = hi_sdsMakeRoomFor(s,len);
-    if (s == NULL) return NULL;
-    memcpy(s+curlen, t, len);
-    hi_sdssetlen(s, curlen+len);
-    s[curlen+len] = '\0';
-    return s;
-}
-
-/* Append the specified null termianted C string to the hisds string 's'.
- *
- * After the call, the passed hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-hisds hi_sdscat(hisds s, const char *t) {
-    return hi_sdscatlen(s, t, strlen(t));
-}
-
-/* Append the specified hisds 't' to the existing hisds 's'.
- *
- * After the call, the modified hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-hisds hi_sdscatsds(hisds s, const hisds t) {
-    return hi_sdscatlen(s, t, hi_sdslen(t));
-}
-
-/* Destructively modify the hisds string 's' to hold the specified binary
- * safe string pointed by 't' of length 'len' bytes. */
-hisds hi_sdscpylen(hisds s, const char *t, size_t len) {
-    if (hi_sdsalloc(s) < len) {
-        s = hi_sdsMakeRoomFor(s,len-hi_sdslen(s));
-        if (s == NULL) return NULL;
-    }
-    memcpy(s, t, len);
-    s[len] = '\0';
-    hi_sdssetlen(s, len);
-    return s;
-}
-
-/* Like hi_sdscpylen() but 't' must be a null-termined string so that the length
- * of the string is obtained with strlen(). */
-hisds hi_sdscpy(hisds s, const char *t) {
-    return hi_sdscpylen(s, t, strlen(t));
-}
-
-/* Helper for hi_sdscatlonglong() doing the actual number -> string
- * conversion. 's' must point to a string with room for at least
- * HI_SDS_LLSTR_SIZE bytes.
- *
- * The function returns the length of the null-terminated string
- * representation stored at 's'. */
-#define HI_SDS_LLSTR_SIZE 21
-int hi_sdsll2str(char *s, long long value) {
-    char *p, aux;
-    unsigned long long v;
-    size_t l;
-
-    /* Generate the string representation, this method produces
-     * an reversed string. */
-    v = (value < 0) ? -value : value;
-    p = s;
-    do {
-        *p++ = '0'+(v%10);
-        v /= 10;
-    } while(v);
-    if (value < 0) *p++ = '-';
-
-    /* Compute length and add null term. */
-    l = p-s;
-    *p = '\0';
-
-    /* Reverse the string. */
-    p--;
-    while(s < p) {
-        aux = *s;
-        *s = *p;
-        *p = aux;
-        s++;
-        p--;
-    }
-    return l;
-}
-
-/* Identical hi_sdsll2str(), but for unsigned long long type. */
-int hi_sdsull2str(char *s, unsigned long long v) {
-    char *p, aux;
-    size_t l;
-
-    /* Generate the string representation, this method produces
-     * an reversed string. */
-    p = s;
-    do {
-        *p++ = '0'+(v%10);
-        v /= 10;
-    } while(v);
-
-    /* Compute length and add null term. */
-    l = p-s;
-    *p = '\0';
-
-    /* Reverse the string. */
-    p--;
-    while(s < p) {
-        aux = *s;
-        *s = *p;
-        *p = aux;
-        s++;
-        p--;
-    }
-    return l;
-}
-
-/* Create an hisds string from a long long value. It is much faster than:
- *
- * hi_sdscatprintf(hi_sdsempty(),"%lld\n", value);
- */
-hisds hi_sdsfromlonglong(long long value) {
-    char buf[HI_SDS_LLSTR_SIZE];
-    int len = hi_sdsll2str(buf,value);
-
-    return hi_sdsnewlen(buf,len);
-}
-
-/* Like hi_sdscatprintf() but gets va_list instead of being variadic. */
-hisds hi_sdscatvprintf(hisds s, const char *fmt, va_list ap) {
-    va_list cpy;
-    char staticbuf[1024], *buf = staticbuf, *t;
-    size_t buflen = strlen(fmt)*2;
-
-    /* We try to start using a static buffer for speed.
-     * If not possible we revert to heap allocation. */
-    if (buflen > sizeof(staticbuf)) {
-        buf = hi_s_malloc(buflen);
-        if (buf == NULL) return NULL;
-    } else {
-        buflen = sizeof(staticbuf);
-    }
-
-    /* Try with buffers two times bigger every time we fail to
-     * fit the string in the current buffer size. */
-    while(1) {
-        buf[buflen-2] = '\0';
-        va_copy(cpy,ap);
-        vsnprintf(buf, buflen, fmt, cpy);
-        va_end(cpy);
-        if (buf[buflen-2] != '\0') {
-            if (buf != staticbuf) hi_s_free(buf);
-            buflen *= 2;
-            buf = hi_s_malloc(buflen);
-            if (buf == NULL) return NULL;
-            continue;
-        }
-        break;
-    }
-
-    /* Finally concat the obtained string to the SDS string and return it. */
-    t = hi_sdscat(s, buf);
-    if (buf != staticbuf) hi_s_free(buf);
-    return t;
-}
-
-/* Append to the hisds string 's' a string obtained using printf-alike format
- * specifier.
- *
- * After the call, the modified hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call.
- *
- * Example:
- *
- * s = hi_sdsnew("Sum is: ");
- * s = hi_sdscatprintf(s,"%d+%d = %d",a,b,a+b).
- *
- * Often you need to create a string from scratch with the printf-alike
- * format. When this is the need, just use hi_sdsempty() as the target string:
- *
- * s = hi_sdscatprintf(hi_sdsempty(), "... your format ...", args);
- */
-hisds hi_sdscatprintf(hisds s, const char *fmt, ...) {
-    va_list ap;
-    char *t;
-    va_start(ap, fmt);
-    t = hi_sdscatvprintf(s,fmt,ap);
-    va_end(ap);
-    return t;
-}
-
-/* This function is similar to hi_sdscatprintf, but much faster as it does
- * not rely on sprintf() family functions implemented by the libc that
- * are often very slow. Moreover directly handling the hisds string as
- * new data is concatenated provides a performance improvement.
- *
- * However this function only handles an incompatible subset of printf-alike
- * format specifiers:
- *
- * %s - C String
- * %S - SDS string
- * %i - signed int
- * %I - 64 bit signed integer (long long, int64_t)
- * %u - unsigned int
- * %U - 64 bit unsigned integer (unsigned long long, uint64_t)
- * %% - Verbatim "%" character.
- */
-hisds hi_sdscatfmt(hisds s, char const *fmt, ...) {
-    const char *f = fmt;
-    int i;
-    va_list ap;
-
-    va_start(ap,fmt);
-    i = hi_sdslen(s); /* Position of the next byte to write to dest str. */
-    while(*f) {
-        char next, *str;
-        size_t l;
-        long long num;
-        unsigned long long unum;
-
-        /* Make sure there is always space for at least 1 char. */
-        if (hi_sdsavail(s)==0) {
-            s = hi_sdsMakeRoomFor(s,1);
-            if (s == NULL) goto fmt_error;
-        }
-
-        switch(*f) {
-        case '%':
-            next = *(f+1);
-            f++;
-            switch(next) {
-            case 's':
-            case 'S':
-                str = va_arg(ap,char*);
-                l = (next == 's') ? strlen(str) : hi_sdslen(str);
-                if (hi_sdsavail(s) < l) {
-                    s = hi_sdsMakeRoomFor(s,l);
-                    if (s == NULL) goto fmt_error;
-                }
-                memcpy(s+i,str,l);
-                hi_sdsinclen(s,l);
-                i += l;
-                break;
-            case 'i':
-            case 'I':
-                if (next == 'i')
-                    num = va_arg(ap,int);
-                else
-                    num = va_arg(ap,long long);
-                {
-                    char buf[HI_SDS_LLSTR_SIZE];
-                    l = hi_sdsll2str(buf,num);
-                    if (hi_sdsavail(s) < l) {
-                        s = hi_sdsMakeRoomFor(s,l);
-                        if (s == NULL) goto fmt_error;
-                    }
-                    memcpy(s+i,buf,l);
-                    hi_sdsinclen(s,l);
-                    i += l;
-                }
-                break;
-            case 'u':
-            case 'U':
-                if (next == 'u')
-                    unum = va_arg(ap,unsigned int);
-                else
-                    unum = va_arg(ap,unsigned long long);
-                {
-                    char buf[HI_SDS_LLSTR_SIZE];
-                    l = hi_sdsull2str(buf,unum);
-                    if (hi_sdsavail(s) < l) {
-                        s = hi_sdsMakeRoomFor(s,l);
-                        if (s == NULL) goto fmt_error;
-                    }
-                    memcpy(s+i,buf,l);
-                    hi_sdsinclen(s,l);
-                    i += l;
-                }
-                break;
-            default: /* Handle %% and generally %<unknown>. */
-                s[i++] = next;
-                hi_sdsinclen(s,1);
-                break;
-            }
-            break;
-        default:
-            s[i++] = *f;
-            hi_sdsinclen(s,1);
-            break;
-        }
-        f++;
-    }
-    va_end(ap);
-
-    /* Add null-term */
-    s[i] = '\0';
-    return s;
-
-fmt_error:
-    va_end(ap);
-    return NULL;
-}
-
-/* Remove the part of the string from left and from right composed just of
- * contiguous characters found in 'cset', that is a null terminted C string.
- *
- * After the call, the modified hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call.
- *
- * Example:
- *
- * s = hi_sdsnew("AA...AA.a.aa.aHelloWorld     :::");
- * s = hi_sdstrim(s,"Aa. :");
- * printf("%s\n", s);
- *
- * Output will be just "Hello World".
- */
-hisds hi_sdstrim(hisds s, const char *cset) {
-    char *start, *end, *sp, *ep;
-    size_t len;
-
-    sp = start = s;
-    ep = end = s+hi_sdslen(s)-1;
-    while(sp <= end && strchr(cset, *sp)) sp++;
-    while(ep > sp && strchr(cset, *ep)) ep--;
-    len = (sp > ep) ? 0 : ((ep-sp)+1);
-    if (s != sp) memmove(s, sp, len);
-    s[len] = '\0';
-    hi_sdssetlen(s,len);
-    return s;
-}
-
-/* Turn the string into a smaller (or equal) string containing only the
- * substring specified by the 'start' and 'end' indexes.
- *
- * start and end can be negative, where -1 means the last character of the
- * string, -2 the penultimate character, and so forth.
- *
- * The interval is inclusive, so the start and end characters will be part
- * of the resulting string.
- *
- * The string is modified in-place.
- *
- * Return value:
- * -1 (error) if hi_sdslen(s) is larger than maximum positive ssize_t value.
- *  0 on success.
- *
- * Example:
- *
- * s = hi_sdsnew("Hello World");
- * hi_sdsrange(s,1,-1); => "ello World"
- */
-int hi_sdsrange(hisds s, ssize_t start, ssize_t end) {
-    size_t newlen, len = hi_sdslen(s);
-    if (len > SSIZE_MAX) return -1;
-
-    if (len == 0) return 0;
-    if (start < 0) {
-        start = len+start;
-        if (start < 0) start = 0;
-    }
-    if (end < 0) {
-        end = len+end;
-        if (end < 0) end = 0;
-    }
-    newlen = (start > end) ? 0 : (end-start)+1;
-    if (newlen != 0) {
-        if (start >= (ssize_t)len) {
-            newlen = 0;
-        } else if (end >= (ssize_t)len) {
-            end = len-1;
-            newlen = (start > end) ? 0 : (end-start)+1;
-        }
-    } else {
-        start = 0;
-    }
-    if (start && newlen) memmove(s, s+start, newlen);
-    s[newlen] = 0;
-    hi_sdssetlen(s,newlen);
-    return 0;
-}
-
-/* Apply tolower() to every character of the hisds string 's'. */
-void hi_sdstolower(hisds s) {
-    int len = hi_sdslen(s), j;
-
-    for (j = 0; j < len; j++) s[j] = tolower(s[j]);
-}
-
-/* Apply toupper() to every character of the hisds string 's'. */
-void hi_sdstoupper(hisds s) {
-    int len = hi_sdslen(s), j;
-
-    for (j = 0; j < len; j++) s[j] = toupper(s[j]);
-}
-
-/* Compare two hisds strings s1 and s2 with memcmp().
- *
- * Return value:
- *
- *     positive if s1 > s2.
- *     negative if s1 < s2.
- *     0 if s1 and s2 are exactly the same binary string.
- *
- * If two strings share exactly the same prefix, but one of the two has
- * additional characters, the longer string is considered to be greater than
- * the smaller one. */
-int hi_sdscmp(const hisds s1, const hisds s2) {
-    size_t l1, l2, minlen;
-    int cmp;
-
-    l1 = hi_sdslen(s1);
-    l2 = hi_sdslen(s2);
-    minlen = (l1 < l2) ? l1 : l2;
-    cmp = memcmp(s1,s2,minlen);
-    if (cmp == 0) return l1-l2;
-    return cmp;
-}
-
-/* Split 's' with separator in 'sep'. An array
- * of hisds strings is returned. *count will be set
- * by reference to the number of tokens returned.
- *
- * On out of memory, zero length string, zero length
- * separator, NULL is returned.
- *
- * Note that 'sep' is able to split a string using
- * a multi-character separator. For example
- * hi_sdssplit("foo_-_bar","_-_"); will return two
- * elements "foo" and "bar".
- *
- * This version of the function is binary-safe but
- * requires length arguments. hi_sdssplit() is just the
- * same function but for zero-terminated strings.
- */
-hisds *hi_sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count) {
-    int elements = 0, slots = 5, start = 0, j;
-    hisds *tokens;
-
-    if (seplen < 1 || len < 0) return NULL;
-
-    tokens = hi_s_malloc(sizeof(hisds)*slots);
-    if (tokens == NULL) return NULL;
-
-    if (len == 0) {
-        *count = 0;
-        return tokens;
-    }
-    for (j = 0; j < (len-(seplen-1)); j++) {
-        /* make sure there is room for the next element and the final one */
-        if (slots < elements+2) {
-            hisds *newtokens;
-
-            slots *= 2;
-            newtokens = hi_s_realloc(tokens,sizeof(hisds)*slots);
-            if (newtokens == NULL) goto cleanup;
-            tokens = newtokens;
-        }
-        /* search the separator */
-        if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {
-            tokens[elements] = hi_sdsnewlen(s+start,j-start);
-            if (tokens[elements] == NULL) goto cleanup;
-            elements++;
-            start = j+seplen;
-            j = j+seplen-1; /* skip the separator */
-        }
-    }
-    /* Add the final element. We are sure there is room in the tokens array. */
-    tokens[elements] = hi_sdsnewlen(s+start,len-start);
-    if (tokens[elements] == NULL) goto cleanup;
-    elements++;
-    *count = elements;
-    return tokens;
-
-cleanup:
-    {
-        int i;
-        for (i = 0; i < elements; i++) hi_sdsfree(tokens[i]);
-        hi_s_free(tokens);
-        *count = 0;
-        return NULL;
-    }
-}
-
-/* Free the result returned by hi_sdssplitlen(), or do nothing if 'tokens' is NULL. */
-void hi_sdsfreesplitres(hisds *tokens, int count) {
-    if (!tokens) return;
-    while(count--)
-        hi_sdsfree(tokens[count]);
-    hi_s_free(tokens);
-}
-
-/* Append to the hisds string "s" an escaped string representation where
- * all the non-printable characters (tested with isprint()) are turned into
- * escapes in the form "\n\r\a...." or "\x<hex-number>".
- *
- * After the call, the modified hisds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-hisds hi_sdscatrepr(hisds s, const char *p, size_t len) {
-    s = hi_sdscatlen(s,"\"",1);
-    while(len--) {
-        switch(*p) {
-        case '\\':
-        case '"':
-            s = hi_sdscatprintf(s,"\\%c",*p);
-            break;
-        case '\n': s = hi_sdscatlen(s,"\\n",2); break;
-        case '\r': s = hi_sdscatlen(s,"\\r",2); break;
-        case '\t': s = hi_sdscatlen(s,"\\t",2); break;
-        case '\a': s = hi_sdscatlen(s,"\\a",2); break;
-        case '\b': s = hi_sdscatlen(s,"\\b",2); break;
-        default:
-            if (isprint(*p))
-                s = hi_sdscatprintf(s,"%c",*p);
-            else
-                s = hi_sdscatprintf(s,"\\x%02x",(unsigned char)*p);
-            break;
-        }
-        p++;
-    }
-    return hi_sdscatlen(s,"\"",1);
-}
-
-/* Helper function for hi_sdssplitargs() that converts a hex digit into an
- * integer from 0 to 15 */
-static int hi_hex_digit_to_int(char c) {
-    switch(c) {
-    case '0': return 0;
-    case '1': return 1;
-    case '2': return 2;
-    case '3': return 3;
-    case '4': return 4;
-    case '5': return 5;
-    case '6': return 6;
-    case '7': return 7;
-    case '8': return 8;
-    case '9': return 9;
-    case 'a': case 'A': return 10;
-    case 'b': case 'B': return 11;
-    case 'c': case 'C': return 12;
-    case 'd': case 'D': return 13;
-    case 'e': case 'E': return 14;
-    case 'f': case 'F': return 15;
-    default: return 0;
-    }
-}
-
-/* Split a line into arguments, where every argument can be in the
- * following programming-language REPL-alike form:
- *
- * foo bar "newline are supported\n" and "\xff\x00otherstuff"
- *
- * The number of arguments is stored into *argc, and an array
- * of hisds is returned.
- *
- * The caller should free the resulting array of hisds strings with
- * hi_sdsfreesplitres().
- *
- * Note that hi_sdscatrepr() is able to convert back a string into
- * a quoted string in the same format hi_sdssplitargs() is able to parse.
- *
- * The function returns the allocated tokens on success, even when the
- * input string is empty, or NULL if the input contains unbalanced
- * quotes or closed quotes followed by non space characters
- * as in: "foo"bar or "foo'
- */
-hisds *hi_sdssplitargs(const char *line, int *argc) {
-    const char *p = line;
-    char *current = NULL;
-    char **vector = NULL;
-
-    *argc = 0;
-    while(1) {
-        /* skip blanks */
-        while(*p && isspace(*p)) p++;
-        if (*p) {
-            /* get a token */
-            int inq=0;  /* set to 1 if we are in "quotes" */
-            int insq=0; /* set to 1 if we are in 'single quotes' */
-            int done=0;
-
-            if (current == NULL) current = hi_sdsempty();
-            while(!done) {
-                if (inq) {
-                    if (*p == '\\' && *(p+1) == 'x' &&
-                                             isxdigit(*(p+2)) &&
-                                             isxdigit(*(p+3)))
-                    {
-                        unsigned char byte;
-
-                        byte = (hi_hex_digit_to_int(*(p+2))*16)+
-                                hi_hex_digit_to_int(*(p+3));
-                        current = hi_sdscatlen(current,(char*)&byte,1);
-                        p += 3;
-                    } else if (*p == '\\' && *(p+1)) {
-                        char c;
-
-                        p++;
-                        switch(*p) {
-                        case 'n': c = '\n'; break;
-                        case 'r': c = '\r'; break;
-                        case 't': c = '\t'; break;
-                        case 'b': c = '\b'; break;
-                        case 'a': c = '\a'; break;
-                        default: c = *p; break;
-                        }
-                        current = hi_sdscatlen(current,&c,1);
-                    } else if (*p == '"') {
-                        /* closing quote must be followed by a space or
-                         * nothing at all. */
-                        if (*(p+1) && !isspace(*(p+1))) goto err;
-                        done=1;
-                    } else if (!*p) {
-                        /* unterminated quotes */
-                        goto err;
-                    } else {
-                        current = hi_sdscatlen(current,p,1);
-                    }
-                } else if (insq) {
-                    if (*p == '\\' && *(p+1) == '\'') {
-                        p++;
-                        current = hi_sdscatlen(current,"'",1);
-                    } else if (*p == '\'') {
-                        /* closing quote must be followed by a space or
-                         * nothing at all. */
-                        if (*(p+1) && !isspace(*(p+1))) goto err;
-                        done=1;
-                    } else if (!*p) {
-                        /* unterminated quotes */
-                        goto err;
-                    } else {
-                        current = hi_sdscatlen(current,p,1);
-                    }
-                } else {
-                    switch(*p) {
-                    case ' ':
-                    case '\n':
-                    case '\r':
-                    case '\t':
-                    case '\0':
-                        done=1;
-                        break;
-                    case '"':
-                        inq=1;
-                        break;
-                    case '\'':
-                        insq=1;
-                        break;
-                    default:
-                        current = hi_sdscatlen(current,p,1);
-                        break;
-                    }
-                }
-                if (*p) p++;
-            }
-            /* add the token to the vector */
-            {
-                char **new_vector = hi_s_realloc(vector,((*argc)+1)*sizeof(char*));
-                if (new_vector == NULL) {
-                    hi_s_free(vector);
-                    return NULL;
-                }
-
-                vector = new_vector;
-                vector[*argc] = current;
-                (*argc)++;
-                current = NULL;
-            }
-        } else {
-            /* Even on empty input string return something not NULL. */
-            if (vector == NULL) vector = hi_s_malloc(sizeof(void*));
-            return vector;
-        }
-    }
-
-err:
-    while((*argc)--)
-        hi_sdsfree(vector[*argc]);
-    hi_s_free(vector);
-    if (current) hi_sdsfree(current);
-    *argc = 0;
-    return NULL;
-}
-
-/* Modify the string substituting all the occurrences of the set of
- * characters specified in the 'from' string to the corresponding character
- * in the 'to' array.
- *
- * For instance: hi_sdsmapchars(mystring, "ho", "01", 2)
- * will have the effect of turning the string "hello" into "0ell1".
- *
- * The function returns the hisds string pointer, that is always the same
- * as the input pointer since no resize is needed. */
-hisds hi_sdsmapchars(hisds s, const char *from, const char *to, size_t setlen) {
-    size_t j, i, l = hi_sdslen(s);
-
-    for (j = 0; j < l; j++) {
-        for (i = 0; i < setlen; i++) {
-            if (s[j] == from[i]) {
-                s[j] = to[i];
-                break;
-            }
-        }
-    }
-    return s;
-}
-
-/* Join an array of C strings using the specified separator (also a C string).
- * Returns the result as an hisds string. */
-hisds hi_sdsjoin(char **argv, int argc, char *sep) {
-    hisds join = hi_sdsempty();
-    int j;
-
-    for (j = 0; j < argc; j++) {
-        join = hi_sdscat(join, argv[j]);
-        if (j != argc-1) join = hi_sdscat(join,sep);
-    }
-    return join;
-}
-
-/* Like hi_sdsjoin, but joins an array of SDS strings. */
-hisds hi_sdsjoinsds(hisds *argv, int argc, const char *sep, size_t seplen) {
-    hisds join = hi_sdsempty();
-    int j;
-
-    for (j = 0; j < argc; j++) {
-        join = hi_sdscatsds(join, argv[j]);
-        if (j != argc-1) join = hi_sdscatlen(join,sep,seplen);
-    }
-    return join;
-}
-
-/* Wrappers to the allocators used by SDS. Note that SDS will actually
- * just use the macros defined into sdsalloc.h in order to avoid to pay
- * the overhead of function calls. Here we define these wrappers only for
- * the programs SDS is linked to, if they want to touch the SDS internals
- * even if they use a different allocator. */
-void *hi_sds_malloc(size_t size) { return hi_s_malloc(size); }
-void *hi_sds_realloc(void *ptr, size_t size) { return hi_s_realloc(ptr,size); }
-void hi_sds_free(void *ptr) { hi_s_free(ptr); }
-
-#if defined(HI_SDS_TEST_MAIN)
-#include <stdio.h>
-#include "testhelp.h"
-#include "limits.h"
-
-#define UNUSED(x) (void)(x)
-int hi_sdsTest(void) {
-    {
-        hisds x = hi_sdsnew("foo"), y;
-
-        test_cond("Create a string and obtain the length",
-            hi_sdslen(x) == 3 && memcmp(x,"foo\0",4) == 0)
-
-        hi_sdsfree(x);
-        x = hi_sdsnewlen("foo",2);
-        test_cond("Create a string with specified length",
-            hi_sdslen(x) == 2 && memcmp(x,"fo\0",3) == 0)
-
-        x = hi_sdscat(x,"bar");
-        test_cond("Strings concatenation",
-            hi_sdslen(x) == 5 && memcmp(x,"fobar\0",6) == 0);
-
-        x = hi_sdscpy(x,"a");
-        test_cond("hi_sdscpy() against an originally longer string",
-            hi_sdslen(x) == 1 && memcmp(x,"a\0",2) == 0)
-
-        x = hi_sdscpy(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk");
-        test_cond("hi_sdscpy() against an originally shorter string",
-            hi_sdslen(x) == 33 &&
-            memcmp(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\0",33) == 0)
-
-        hi_sdsfree(x);
-        x = hi_sdscatprintf(hi_sdsempty(),"%d",123);
-        test_cond("hi_sdscatprintf() seems working in the base case",
-            hi_sdslen(x) == 3 && memcmp(x,"123\0",4) == 0)
-
-        hi_sdsfree(x);
-        x = hi_sdsnew("--");
-        x = hi_sdscatfmt(x, "Hello %s World %I,%I--", "Hi!", LLONG_MIN,LLONG_MAX);
-        test_cond("hi_sdscatfmt() seems working in the base case",
-            hi_sdslen(x) == 60 &&
-            memcmp(x,"--Hello Hi! World -9223372036854775808,"
-                     "9223372036854775807--",60) == 0)
-        printf("[%s]\n",x);
-
-        hi_sdsfree(x);
-        x = hi_sdsnew("--");
-        x = hi_sdscatfmt(x, "%u,%U--", UINT_MAX, ULLONG_MAX);
-        test_cond("hi_sdscatfmt() seems working with unsigned numbers",
-            hi_sdslen(x) == 35 &&
-            memcmp(x,"--4294967295,18446744073709551615--",35) == 0)
-
-        hi_sdsfree(x);
-        x = hi_sdsnew(" x ");
-        hi_sdstrim(x," x");
-        test_cond("hi_sdstrim() works when all chars match",
-            hi_sdslen(x) == 0)
-
-        hi_sdsfree(x);
-        x = hi_sdsnew(" x ");
-        hi_sdstrim(x," ");
-        test_cond("hi_sdstrim() works when a single char remains",
-            hi_sdslen(x) == 1 && x[0] == 'x')
-
-        hi_sdsfree(x);
-        x = hi_sdsnew("xxciaoyyy");
-        hi_sdstrim(x,"xy");
-        test_cond("hi_sdstrim() correctly trims characters",
-            hi_sdslen(x) == 4 && memcmp(x,"ciao\0",5) == 0)
-
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,1,1);
-        test_cond("hi_sdsrange(...,1,1)",
-            hi_sdslen(y) == 1 && memcmp(y,"i\0",2) == 0)
-
-        hi_sdsfree(y);
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,1,-1);
-        test_cond("hi_sdsrange(...,1,-1)",
-            hi_sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0)
-
-        hi_sdsfree(y);
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,-2,-1);
-        test_cond("hi_sdsrange(...,-2,-1)",
-            hi_sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0)
-
-        hi_sdsfree(y);
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,2,1);
-        test_cond("hi_sdsrange(...,2,1)",
-            hi_sdslen(y) == 0 && memcmp(y,"\0",1) == 0)
-
-        hi_sdsfree(y);
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,1,100);
-        test_cond("hi_sdsrange(...,1,100)",
-            hi_sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0)
-
-        hi_sdsfree(y);
-        y = hi_sdsdup(x);
-        hi_sdsrange(y,100,100);
-        test_cond("hi_sdsrange(...,100,100)",
-            hi_sdslen(y) == 0 && memcmp(y,"\0",1) == 0)
-
-        hi_sdsfree(y);
-        hi_sdsfree(x);
-        x = hi_sdsnew("foo");
-        y = hi_sdsnew("foa");
-        test_cond("hi_sdscmp(foo,foa)", hi_sdscmp(x,y) > 0)
-
-        hi_sdsfree(y);
-        hi_sdsfree(x);
-        x = hi_sdsnew("bar");
-        y = hi_sdsnew("bar");
-        test_cond("hi_sdscmp(bar,bar)", hi_sdscmp(x,y) == 0)
-
-        hi_sdsfree(y);
-        hi_sdsfree(x);
-        x = hi_sdsnew("aar");
-        y = hi_sdsnew("bar");
-        test_cond("hi_sdscmp(bar,bar)", hi_sdscmp(x,y) < 0)
-
-        hi_sdsfree(y);
-        hi_sdsfree(x);
-        x = hi_sdsnewlen("\a\n\0foo\r",7);
-        y = hi_sdscatrepr(hi_sdsempty(),x,hi_sdslen(x));
-        test_cond("hi_sdscatrepr(...data...)",
-            memcmp(y,"\"\\a\\n\\x00foo\\r\"",15) == 0)
-
-        {
-            unsigned int oldfree;
-            char *p;
-            int step = 10, j, i;
-
-            hi_sdsfree(x);
-            hi_sdsfree(y);
-            x = hi_sdsnew("0");
-            test_cond("hi_sdsnew() free/len buffers", hi_sdslen(x) == 1 && hi_sdsavail(x) == 0);
-
-            /* Run the test a few times in order to hit the first two
-             * SDS header types. */
-            for (i = 0; i < 10; i++) {
-                int oldlen = hi_sdslen(x);
-                x = hi_sdsMakeRoomFor(x,step);
-                int type = x[-1]&HI_SDS_TYPE_MASK;
-
-                test_cond("sdsMakeRoomFor() len", hi_sdslen(x) == oldlen);
-                if (type != HI_SDS_TYPE_5) {
-                    test_cond("hi_sdsMakeRoomFor() free", hi_sdsavail(x) >= step);
-                    oldfree = hi_sdsavail(x);
-                }
-                p = x+oldlen;
-                for (j = 0; j < step; j++) {
-                    p[j] = 'A'+j;
-                }
-                hi_sdsIncrLen(x,step);
-            }
-            test_cond("hi_sdsMakeRoomFor() content",
-                memcmp("0ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ",x,101) == 0);
-            test_cond("sdsMakeRoomFor() final length",hi_sdslen(x)==101);
-
-            hi_sdsfree(x);
-        }
-    }
-    test_report();
-    return 0;
-}
-#endif
-
-#ifdef HI_SDS_TEST_MAIN
-int main(void) {
-    return hi_sdsTest();
-}
-#endif
diff --git a/redis-stable/deps/hiredis/sds.h b/redis-stable/deps/hiredis/sds.h
deleted file mode 100644
index 573d6dd1..00000000
--- a/redis-stable/deps/hiredis/sds.h
+++ /dev/null
@@ -1,278 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Oran Agra
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef HIREDIS_SDS_H
-#define HIREDIS_SDS_H
-
-#define HI_SDS_MAX_PREALLOC (1024*1024)
-#ifdef _MSC_VER
-#define __attribute__(x)
-typedef long long ssize_t;
-#define SSIZE_MAX (LLONG_MAX >> 1)
-#endif
-
-#include <sys/types.h>
-#include <stdarg.h>
-#include <stdint.h>
-
-typedef char *hisds;
-
-/* Note: sdshdr5 is never used, we just access the flags byte directly.
- * However is here to document the layout of type 5 SDS strings. */
-struct __attribute__ ((__packed__)) hisdshdr5 {
-    unsigned char flags; /* 3 lsb of type, and 5 msb of string length */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) hisdshdr8 {
-    uint8_t len; /* used */
-    uint8_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) hisdshdr16 {
-    uint16_t len; /* used */
-    uint16_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) hisdshdr32 {
-    uint32_t len; /* used */
-    uint32_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) hisdshdr64 {
-    uint64_t len; /* used */
-    uint64_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-
-#define HI_SDS_TYPE_5  0
-#define HI_SDS_TYPE_8  1
-#define HI_SDS_TYPE_16 2
-#define HI_SDS_TYPE_32 3
-#define HI_SDS_TYPE_64 4
-#define HI_SDS_TYPE_MASK 7
-#define HI_SDS_TYPE_BITS 3
-#define HI_SDS_HDR_VAR(T,s) struct hisdshdr##T *sh = (struct hisdshdr##T *)((s)-(sizeof(struct hisdshdr##T)));
-#define HI_SDS_HDR(T,s) ((struct hisdshdr##T *)((s)-(sizeof(struct hisdshdr##T))))
-#define HI_SDS_TYPE_5_LEN(f) ((f)>>HI_SDS_TYPE_BITS)
-
-static inline size_t hi_sdslen(const hisds s) {
-    unsigned char flags = s[-1];
-    switch(flags & HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            return HI_SDS_TYPE_5_LEN(flags);
-        case HI_SDS_TYPE_8:
-            return HI_SDS_HDR(8,s)->len;
-        case HI_SDS_TYPE_16:
-            return HI_SDS_HDR(16,s)->len;
-        case HI_SDS_TYPE_32:
-            return HI_SDS_HDR(32,s)->len;
-        case HI_SDS_TYPE_64:
-            return HI_SDS_HDR(64,s)->len;
-    }
-    return 0;
-}
-
-static inline size_t hi_sdsavail(const hisds s) {
-    unsigned char flags = s[-1];
-    switch(flags&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5: {
-            return 0;
-        }
-        case HI_SDS_TYPE_8: {
-            HI_SDS_HDR_VAR(8,s);
-            return sh->alloc - sh->len;
-        }
-        case HI_SDS_TYPE_16: {
-            HI_SDS_HDR_VAR(16,s);
-            return sh->alloc - sh->len;
-        }
-        case HI_SDS_TYPE_32: {
-            HI_SDS_HDR_VAR(32,s);
-            return sh->alloc - sh->len;
-        }
-        case HI_SDS_TYPE_64: {
-            HI_SDS_HDR_VAR(64,s);
-            return sh->alloc - sh->len;
-        }
-    }
-    return 0;
-}
-
-static inline void hi_sdssetlen(hisds s, size_t newlen) {
-    unsigned char flags = s[-1];
-    switch(flags&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            {
-                unsigned char *fp = ((unsigned char*)s)-1;
-                *fp = (unsigned char)(HI_SDS_TYPE_5 | (newlen << HI_SDS_TYPE_BITS));
-            }
-            break;
-        case HI_SDS_TYPE_8:
-            HI_SDS_HDR(8,s)->len = (uint8_t)newlen;
-            break;
-        case HI_SDS_TYPE_16:
-            HI_SDS_HDR(16,s)->len = (uint16_t)newlen;
-            break;
-        case HI_SDS_TYPE_32:
-            HI_SDS_HDR(32,s)->len = (uint32_t)newlen;
-            break;
-        case HI_SDS_TYPE_64:
-            HI_SDS_HDR(64,s)->len = (uint64_t)newlen;
-            break;
-    }
-}
-
-static inline void hi_sdsinclen(hisds s, size_t inc) {
-    unsigned char flags = s[-1];
-    switch(flags&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            {
-                unsigned char *fp = ((unsigned char*)s)-1;
-                unsigned char newlen = HI_SDS_TYPE_5_LEN(flags)+(unsigned char)inc;
-                *fp = HI_SDS_TYPE_5 | (newlen << HI_SDS_TYPE_BITS);
-            }
-            break;
-        case HI_SDS_TYPE_8:
-            HI_SDS_HDR(8,s)->len += (uint8_t)inc;
-            break;
-        case HI_SDS_TYPE_16:
-            HI_SDS_HDR(16,s)->len += (uint16_t)inc;
-            break;
-        case HI_SDS_TYPE_32:
-            HI_SDS_HDR(32,s)->len += (uint32_t)inc;
-            break;
-        case HI_SDS_TYPE_64:
-            HI_SDS_HDR(64,s)->len += (uint64_t)inc;
-            break;
-    }
-}
-
-/* hi_sdsalloc() = hi_sdsavail() + hi_sdslen() */
-static inline size_t hi_sdsalloc(const hisds s) {
-    unsigned char flags = s[-1];
-    switch(flags & HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            return HI_SDS_TYPE_5_LEN(flags);
-        case HI_SDS_TYPE_8:
-            return HI_SDS_HDR(8,s)->alloc;
-        case HI_SDS_TYPE_16:
-            return HI_SDS_HDR(16,s)->alloc;
-        case HI_SDS_TYPE_32:
-            return HI_SDS_HDR(32,s)->alloc;
-        case HI_SDS_TYPE_64:
-            return HI_SDS_HDR(64,s)->alloc;
-    }
-    return 0;
-}
-
-static inline void hi_sdssetalloc(hisds s, size_t newlen) {
-    unsigned char flags = s[-1];
-    switch(flags&HI_SDS_TYPE_MASK) {
-        case HI_SDS_TYPE_5:
-            /* Nothing to do, this type has no total allocation info. */
-            break;
-        case HI_SDS_TYPE_8:
-            HI_SDS_HDR(8,s)->alloc = (uint8_t)newlen;
-            break;
-        case HI_SDS_TYPE_16:
-            HI_SDS_HDR(16,s)->alloc = (uint16_t)newlen;
-            break;
-        case HI_SDS_TYPE_32:
-            HI_SDS_HDR(32,s)->alloc = (uint32_t)newlen;
-            break;
-        case HI_SDS_TYPE_64:
-            HI_SDS_HDR(64,s)->alloc = (uint64_t)newlen;
-            break;
-    }
-}
-
-hisds hi_sdsnewlen(const void *init, size_t initlen);
-hisds hi_sdsnew(const char *init);
-hisds hi_sdsempty(void);
-hisds hi_sdsdup(const hisds s);
-void  hi_sdsfree(hisds s);
-hisds hi_sdsgrowzero(hisds s, size_t len);
-hisds hi_sdscatlen(hisds s, const void *t, size_t len);
-hisds hi_sdscat(hisds s, const char *t);
-hisds hi_sdscatsds(hisds s, const hisds t);
-hisds hi_sdscpylen(hisds s, const char *t, size_t len);
-hisds hi_sdscpy(hisds s, const char *t);
-
-hisds hi_sdscatvprintf(hisds s, const char *fmt, va_list ap);
-#ifdef __GNUC__
-hisds hi_sdscatprintf(hisds s, const char *fmt, ...)
-    __attribute__((format(printf, 2, 3)));
-#else
-hisds hi_sdscatprintf(hisds s, const char *fmt, ...);
-#endif
-
-hisds hi_sdscatfmt(hisds s, char const *fmt, ...);
-hisds hi_sdstrim(hisds s, const char *cset);
-int hi_sdsrange(hisds s, ssize_t start, ssize_t end);
-void hi_sdsupdatelen(hisds s);
-void hi_sdsclear(hisds s);
-int hi_sdscmp(const hisds s1, const hisds s2);
-hisds *hi_sdssplitlen(const char *s, int len, const char *sep, int seplen, int *count);
-void hi_sdsfreesplitres(hisds *tokens, int count);
-void hi_sdstolower(hisds s);
-void hi_sdstoupper(hisds s);
-hisds hi_sdsfromlonglong(long long value);
-hisds hi_sdscatrepr(hisds s, const char *p, size_t len);
-hisds *hi_sdssplitargs(const char *line, int *argc);
-hisds hi_sdsmapchars(hisds s, const char *from, const char *to, size_t setlen);
-hisds hi_sdsjoin(char **argv, int argc, char *sep);
-hisds hi_sdsjoinsds(hisds *argv, int argc, const char *sep, size_t seplen);
-
-/* Low level functions exposed to the user API */
-hisds hi_sdsMakeRoomFor(hisds s, size_t addlen);
-void hi_sdsIncrLen(hisds s, int incr);
-hisds hi_sdsRemoveFreeSpace(hisds s);
-size_t hi_sdsAllocSize(hisds s);
-void *hi_sdsAllocPtr(hisds s);
-
-/* Export the allocator used by SDS to the program using SDS.
- * Sometimes the program SDS is linked to, may use a different set of
- * allocators, but may want to allocate or free things that SDS will
- * respectively free or allocate. */
-void *hi_sds_malloc(size_t size);
-void *hi_sds_realloc(void *ptr, size_t size);
-void hi_sds_free(void *ptr);
-
-#ifdef REDIS_TEST
-int hi_sdsTest(int argc, char *argv[]);
-#endif
-
-#endif /* HIREDIS_SDS_H */
diff --git a/redis-stable/deps/hiredis/sdsalloc.h b/redis-stable/deps/hiredis/sdsalloc.h
deleted file mode 100644
index c9dcc3df..00000000
--- a/redis-stable/deps/hiredis/sdsalloc.h
+++ /dev/null
@@ -1,44 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Oran Agra
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* SDS allocator selection.
- *
- * This file is used in order to change the SDS allocator at compile time.
- * Just define the following defines to what you want to use. Also add
- * the include of your alternate allocator if needed (not needed in order
- * to use the default libc allocator). */
-
-#include "alloc.h"
-
-#define hi_s_malloc hi_malloc
-#define hi_s_realloc hi_realloc
-#define hi_s_free hi_free
diff --git a/redis-stable/deps/hiredis/sdscompat.h b/redis-stable/deps/hiredis/sdscompat.h
deleted file mode 100644
index e5a2574f..00000000
--- a/redis-stable/deps/hiredis/sdscompat.h
+++ /dev/null
@@ -1,94 +0,0 @@
-/*
- * Copyright (c) 2020, Michael Grunder <michael dot grunder at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/*
- * SDS compatibility header.
- *
- * This simple file maps sds types and calls to their unique hiredis symbol names.
- * It's useful when we build Hiredis as a dependency of Redis and want to call
- * Hiredis' sds symbols rather than the ones built into Redis, as the libraries
- * have slightly diverged and could cause hard to track down ABI incompatibility
- * bugs.
- *
- */
-
-#ifndef HIREDIS_SDS_COMPAT
-#define HIREDIS_SDS_COMPAT
-
-#define sds hisds
-
-#define sdslen hi_sdslen
-#define sdsavail hi_sdsavail
-#define sdssetlen hi_sdssetlen
-#define sdsinclen hi_sdsinclen
-#define sdsalloc hi_sdsalloc
-#define sdssetalloc hi_sdssetalloc
-
-#define sdsAllocPtr hi_sdsAllocPtr
-#define sdsAllocSize hi_sdsAllocSize
-#define sdscat hi_sdscat
-#define sdscatfmt hi_sdscatfmt
-#define sdscatlen hi_sdscatlen
-#define sdscatprintf hi_sdscatprintf
-#define sdscatrepr hi_sdscatrepr
-#define sdscatsds hi_sdscatsds
-#define sdscatvprintf hi_sdscatvprintf
-#define sdsclear hi_sdsclear
-#define sdscmp hi_sdscmp
-#define sdscpy hi_sdscpy
-#define sdscpylen hi_sdscpylen
-#define sdsdup hi_sdsdup
-#define sdsempty hi_sdsempty
-#define sds_free hi_sds_free
-#define sdsfree hi_sdsfree
-#define sdsfreesplitres hi_sdsfreesplitres
-#define sdsfromlonglong hi_sdsfromlonglong
-#define sdsgrowzero hi_sdsgrowzero
-#define sdsIncrLen hi_sdsIncrLen
-#define sdsjoin hi_sdsjoin
-#define sdsjoinsds hi_sdsjoinsds
-#define sdsll2str hi_sdsll2str
-#define sdsMakeRoomFor hi_sdsMakeRoomFor
-#define sds_malloc hi_sds_malloc
-#define sdsmapchars hi_sdsmapchars
-#define sdsnew hi_sdsnew
-#define sdsnewlen hi_sdsnewlen
-#define sdsrange hi_sdsrange
-#define sds_realloc hi_sds_realloc
-#define sdsRemoveFreeSpace hi_sdsRemoveFreeSpace
-#define sdssplitargs hi_sdssplitargs
-#define sdssplitlen hi_sdssplitlen
-#define sdstolower hi_sdstolower
-#define sdstoupper hi_sdstoupper
-#define sdstrim hi_sdstrim
-#define sdsull2str hi_sdsull2str
-#define sdsupdatelen hi_sdsupdatelen
-
-#endif /* HIREDIS_SDS_COMPAT */
diff --git a/redis-stable/deps/hiredis/sockcompat.c b/redis-stable/deps/hiredis/sockcompat.c
deleted file mode 100644
index f99d14b0..00000000
--- a/redis-stable/deps/hiredis/sockcompat.c
+++ /dev/null
@@ -1,248 +0,0 @@
-/*
- * Copyright (c) 2019, Marcus Geelnard <m at bitsnbites dot eu>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDIS_SOCKCOMPAT_IMPLEMENTATION
-#include "sockcompat.h"
-
-#ifdef _WIN32
-static int _wsaErrorToErrno(int err) {
-    switch (err) {
-        case WSAEWOULDBLOCK:
-            return EWOULDBLOCK;
-        case WSAEINPROGRESS:
-            return EINPROGRESS;
-        case WSAEALREADY:
-            return EALREADY;
-        case WSAENOTSOCK:
-            return ENOTSOCK;
-        case WSAEDESTADDRREQ:
-            return EDESTADDRREQ;
-        case WSAEMSGSIZE:
-            return EMSGSIZE;
-        case WSAEPROTOTYPE:
-            return EPROTOTYPE;
-        case WSAENOPROTOOPT:
-            return ENOPROTOOPT;
-        case WSAEPROTONOSUPPORT:
-            return EPROTONOSUPPORT;
-        case WSAEOPNOTSUPP:
-            return EOPNOTSUPP;
-        case WSAEAFNOSUPPORT:
-            return EAFNOSUPPORT;
-        case WSAEADDRINUSE:
-            return EADDRINUSE;
-        case WSAEADDRNOTAVAIL:
-            return EADDRNOTAVAIL;
-        case WSAENETDOWN:
-            return ENETDOWN;
-        case WSAENETUNREACH:
-            return ENETUNREACH;
-        case WSAENETRESET:
-            return ENETRESET;
-        case WSAECONNABORTED:
-            return ECONNABORTED;
-        case WSAECONNRESET:
-            return ECONNRESET;
-        case WSAENOBUFS:
-            return ENOBUFS;
-        case WSAEISCONN:
-            return EISCONN;
-        case WSAENOTCONN:
-            return ENOTCONN;
-        case WSAETIMEDOUT:
-            return ETIMEDOUT;
-        case WSAECONNREFUSED:
-            return ECONNREFUSED;
-        case WSAELOOP:
-            return ELOOP;
-        case WSAENAMETOOLONG:
-            return ENAMETOOLONG;
-        case WSAEHOSTUNREACH:
-            return EHOSTUNREACH;
-        case WSAENOTEMPTY:
-            return ENOTEMPTY;
-        default:
-            /* We just return a generic I/O error if we could not find a relevant error. */
-            return EIO;
-    }
-}
-
-static void _updateErrno(int success) {
-    errno = success ? 0 : _wsaErrorToErrno(WSAGetLastError());
-}
-
-static int _initWinsock() {
-    static int s_initialized = 0;
-    if (!s_initialized) {
-        static WSADATA wsadata;
-        int err = WSAStartup(MAKEWORD(2,2), &wsadata);
-        if (err != 0) {
-            errno = _wsaErrorToErrno(err);
-            return 0;
-        }
-        s_initialized = 1;
-    }
-    return 1;
-}
-
-int win32_getaddrinfo(const char *node, const char *service, const struct addrinfo *hints, struct addrinfo **res) {
-    /* Note: This function is likely to be called before other functions, so run init here. */
-    if (!_initWinsock()) {
-        return EAI_FAIL;
-    }
-
-    switch (getaddrinfo(node, service, hints, res)) {
-        case 0:                     return 0;
-        case WSATRY_AGAIN:          return EAI_AGAIN;
-        case WSAEINVAL:             return EAI_BADFLAGS;
-        case WSAEAFNOSUPPORT:       return EAI_FAMILY;
-        case WSA_NOT_ENOUGH_MEMORY: return EAI_MEMORY;
-        case WSAHOST_NOT_FOUND:     return EAI_NONAME;
-        case WSATYPE_NOT_FOUND:     return EAI_SERVICE;
-        case WSAESOCKTNOSUPPORT:    return EAI_SOCKTYPE;
-        default:                    return EAI_FAIL;     /* Including WSANO_RECOVERY */
-    }
-}
-
-const char *win32_gai_strerror(int errcode) {
-    switch (errcode) {
-        case 0:            errcode = 0;                     break;
-        case EAI_AGAIN:    errcode = WSATRY_AGAIN;          break;
-        case EAI_BADFLAGS: errcode = WSAEINVAL;             break;
-        case EAI_FAMILY:   errcode = WSAEAFNOSUPPORT;       break;
-        case EAI_MEMORY:   errcode = WSA_NOT_ENOUGH_MEMORY; break;
-        case EAI_NONAME:   errcode = WSAHOST_NOT_FOUND;     break;
-        case EAI_SERVICE:  errcode = WSATYPE_NOT_FOUND;     break;
-        case EAI_SOCKTYPE: errcode = WSAESOCKTNOSUPPORT;    break;
-        default:           errcode = WSANO_RECOVERY;        break; /* Including EAI_FAIL */
-    }
-    return gai_strerror(errcode);
-}
-
-void win32_freeaddrinfo(struct addrinfo *res) {
-    freeaddrinfo(res);
-}
-
-SOCKET win32_socket(int domain, int type, int protocol) {
-    SOCKET s;
-
-    /* Note: This function is likely to be called before other functions, so run init here. */
-    if (!_initWinsock()) {
-        return INVALID_SOCKET;
-    }
-
-    _updateErrno((s = socket(domain, type, protocol)) != INVALID_SOCKET);
-    return s;
-}
-
-int win32_ioctl(SOCKET fd, unsigned long request, unsigned long *argp) {
-    int ret = ioctlsocket(fd, (long)request, argp);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_bind(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen) {
-    int ret = bind(sockfd, addr, addrlen);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_connect(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen) {
-    int ret = connect(sockfd, addr, addrlen);
-    _updateErrno(ret != SOCKET_ERROR);
-
-    /* For Winsock connect(), the WSAEWOULDBLOCK error means the same thing as
-     * EINPROGRESS for POSIX connect(), so we do that translation to keep POSIX
-     * logic consistent. */
-    if (errno == EWOULDBLOCK) {
-        errno = EINPROGRESS;
-    }
-
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_getsockopt(SOCKET sockfd, int level, int optname, void *optval, socklen_t *optlen) {
-    int ret = 0;
-    if ((level == SOL_SOCKET) && ((optname == SO_RCVTIMEO) || (optname == SO_SNDTIMEO))) {
-        if (*optlen >= sizeof (struct timeval)) {
-            struct timeval *tv = optval;
-            DWORD timeout = 0;
-            socklen_t dwlen = 0;
-            ret = getsockopt(sockfd, level, optname, (char *)&timeout, &dwlen);
-            tv->tv_sec = timeout / 1000;
-            tv->tv_usec = (timeout * 1000) % 1000000;
-        } else {
-            ret = WSAEFAULT;
-        }
-        *optlen = sizeof (struct timeval);
-    } else {
-        ret = getsockopt(sockfd, level, optname, (char*)optval, optlen);
-    }
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_setsockopt(SOCKET sockfd, int level, int optname, const void *optval, socklen_t optlen) {
-    int ret = 0;
-    if ((level == SOL_SOCKET) && ((optname == SO_RCVTIMEO) || (optname == SO_SNDTIMEO))) {
-        const struct timeval *tv = optval;
-        DWORD timeout = tv->tv_sec * 1000 + tv->tv_usec / 1000;
-        ret = setsockopt(sockfd, level, optname, (const char*)&timeout, sizeof(DWORD));
-    } else {
-        ret = setsockopt(sockfd, level, optname, (const char*)optval, optlen);
-    }
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_close(SOCKET fd) {
-    int ret = closesocket(fd);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-ssize_t win32_recv(SOCKET sockfd, void *buf, size_t len, int flags) {
-    int ret = recv(sockfd, (char*)buf, (int)len, flags);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-ssize_t win32_send(SOCKET sockfd, const void *buf, size_t len, int flags) {
-    int ret = send(sockfd, (const char*)buf, (int)len, flags);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-
-int win32_poll(struct pollfd *fds, nfds_t nfds, int timeout) {
-    int ret = WSAPoll(fds, nfds, timeout);
-    _updateErrno(ret != SOCKET_ERROR);
-    return ret != SOCKET_ERROR ? ret : -1;
-}
-#endif /* _WIN32 */
diff --git a/redis-stable/deps/hiredis/sockcompat.h b/redis-stable/deps/hiredis/sockcompat.h
deleted file mode 100644
index 85810e84..00000000
--- a/redis-stable/deps/hiredis/sockcompat.h
+++ /dev/null
@@ -1,92 +0,0 @@
-/*
- * Copyright (c) 2019, Marcus Geelnard <m at bitsnbites dot eu>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __SOCKCOMPAT_H
-#define __SOCKCOMPAT_H
-
-#ifndef _WIN32
-/* For POSIX systems we use the standard BSD socket API. */
-#include <unistd.h>
-#include <sys/socket.h>
-#include <sys/select.h>
-#include <sys/un.h>
-#include <netinet/in.h>
-#include <netinet/tcp.h>
-#include <arpa/inet.h>
-#include <netdb.h>
-#include <poll.h>
-#else
-/* For Windows we use winsock. */
-#undef _WIN32_WINNT
-#define _WIN32_WINNT 0x0600 /* To get WSAPoll etc. */
-#include <winsock2.h>
-#include <ws2tcpip.h>
-#include <stddef.h>
-#include <errno.h>
-
-#ifdef _MSC_VER
-typedef long long ssize_t;
-#endif
-
-/* Emulate the parts of the BSD socket API that we need (override the winsock signatures). */
-int win32_getaddrinfo(const char *node, const char *service, const struct addrinfo *hints, struct addrinfo **res);
-const char *win32_gai_strerror(int errcode);
-void win32_freeaddrinfo(struct addrinfo *res);
-SOCKET win32_socket(int domain, int type, int protocol);
-int win32_ioctl(SOCKET fd, unsigned long request, unsigned long *argp);
-int win32_bind(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen);
-int win32_connect(SOCKET sockfd, const struct sockaddr *addr, socklen_t addrlen);
-int win32_getsockopt(SOCKET sockfd, int level, int optname, void *optval, socklen_t *optlen);
-int win32_setsockopt(SOCKET sockfd, int level, int optname, const void *optval, socklen_t optlen);
-int win32_close(SOCKET fd);
-ssize_t win32_recv(SOCKET sockfd, void *buf, size_t len, int flags);
-ssize_t win32_send(SOCKET sockfd, const void *buf, size_t len, int flags);
-typedef ULONG nfds_t;
-int win32_poll(struct pollfd *fds, nfds_t nfds, int timeout);
-
-#ifndef REDIS_SOCKCOMPAT_IMPLEMENTATION
-#define getaddrinfo(node, service, hints, res) win32_getaddrinfo(node, service, hints, res)
-#undef gai_strerror
-#define gai_strerror(errcode) win32_gai_strerror(errcode)
-#define freeaddrinfo(res) win32_freeaddrinfo(res)
-#define socket(domain, type, protocol) win32_socket(domain, type, protocol)
-#define ioctl(fd, request, argp) win32_ioctl(fd, request, argp)
-#define bind(sockfd, addr, addrlen) win32_bind(sockfd, addr, addrlen)
-#define connect(sockfd, addr, addrlen) win32_connect(sockfd, addr, addrlen)
-#define getsockopt(sockfd, level, optname, optval, optlen) win32_getsockopt(sockfd, level, optname, optval, optlen)
-#define setsockopt(sockfd, level, optname, optval, optlen) win32_setsockopt(sockfd, level, optname, optval, optlen)
-#define close(fd) win32_close(fd)
-#define recv(sockfd, buf, len, flags) win32_recv(sockfd, buf, len, flags)
-#define send(sockfd, buf, len, flags) win32_send(sockfd, buf, len, flags)
-#define poll(fds, nfds, timeout) win32_poll(fds, nfds, timeout)
-#endif /* REDIS_SOCKCOMPAT_IMPLEMENTATION */
-#endif /* _WIN32 */
-
-#endif /* __SOCKCOMPAT_H */
diff --git a/redis-stable/deps/hiredis/ssl.c b/redis-stable/deps/hiredis/ssl.c
deleted file mode 100644
index fe9a2fdc..00000000
--- a/redis-stable/deps/hiredis/ssl.c
+++ /dev/null
@@ -1,526 +0,0 @@
-/*
- * Copyright (c) 2009-2011, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2011, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2019, Redis Labs
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "hiredis.h"
-#include "async.h"
-
-#include <assert.h>
-#include <errno.h>
-#include <string.h>
-#ifdef _WIN32
-#include <windows.h>
-#else
-#include <pthread.h>
-#endif
-
-#include <openssl/ssl.h>
-#include <openssl/err.h>
-
-#include "win32.h"
-#include "async_private.h"
-#include "hiredis_ssl.h"
-
-void __redisSetError(redisContext *c, int type, const char *str);
-
-struct redisSSLContext {
-    /* Associated OpenSSL SSL_CTX as created by redisCreateSSLContext() */
-    SSL_CTX *ssl_ctx;
-
-    /* Requested SNI, or NULL */
-    char *server_name;
-};
-
-/* The SSL connection context is attached to SSL/TLS connections as a privdata. */
-typedef struct redisSSL {
-    /**
-     * OpenSSL SSL object.
-     */
-    SSL *ssl;
-
-    /**
-     * SSL_write() requires to be called again with the same arguments it was
-     * previously called with in the event of an SSL_read/SSL_write situation
-     */
-    size_t lastLen;
-
-    /** Whether the SSL layer requires read (possibly before a write) */
-    int wantRead;
-
-    /**
-     * Whether a write was requested prior to a read. If set, the write()
-     * should resume whenever a read takes place, if possible
-     */
-    int pendingWrite;
-} redisSSL;
-
-/* Forward declaration */
-redisContextFuncs redisContextSSLFuncs;
-
-/**
- * OpenSSL global initialization and locking handling callbacks.
- * Note that this is only required for OpenSSL < 1.1.0.
- */
-
-#if OPENSSL_VERSION_NUMBER < 0x10100000L
-#define HIREDIS_USE_CRYPTO_LOCKS
-#endif
-
-#ifdef HIREDIS_USE_CRYPTO_LOCKS
-#ifdef _WIN32
-typedef CRITICAL_SECTION sslLockType;
-static void sslLockInit(sslLockType* l) {
-    InitializeCriticalSection(l);
-}
-static void sslLockAcquire(sslLockType* l) {
-    EnterCriticalSection(l);
-}
-static void sslLockRelease(sslLockType* l) {
-    LeaveCriticalSection(l);
-}
-#else
-typedef pthread_mutex_t sslLockType;
-static void sslLockInit(sslLockType *l) {
-    pthread_mutex_init(l, NULL);
-}
-static void sslLockAcquire(sslLockType *l) {
-    pthread_mutex_lock(l);
-}
-static void sslLockRelease(sslLockType *l) {
-    pthread_mutex_unlock(l);
-}
-#endif
-
-static sslLockType* ossl_locks;
-
-static void opensslDoLock(int mode, int lkid, const char *f, int line) {
-    sslLockType *l = ossl_locks + lkid;
-
-    if (mode & CRYPTO_LOCK) {
-        sslLockAcquire(l);
-    } else {
-        sslLockRelease(l);
-    }
-
-    (void)f;
-    (void)line;
-}
-
-static int initOpensslLocks(void) {
-    unsigned ii, nlocks;
-    if (CRYPTO_get_locking_callback() != NULL) {
-        /* Someone already set the callback before us. Don't destroy it! */
-        return REDIS_OK;
-    }
-    nlocks = CRYPTO_num_locks();
-    ossl_locks = hi_malloc(sizeof(*ossl_locks) * nlocks);
-    if (ossl_locks == NULL)
-        return REDIS_ERR;
-
-    for (ii = 0; ii < nlocks; ii++) {
-        sslLockInit(ossl_locks + ii);
-    }
-    CRYPTO_set_locking_callback(opensslDoLock);
-    return REDIS_OK;
-}
-#endif /* HIREDIS_USE_CRYPTO_LOCKS */
-
-int redisInitOpenSSL(void)
-{
-    SSL_library_init();
-#ifdef HIREDIS_USE_CRYPTO_LOCKS
-    initOpensslLocks();
-#endif
-
-    return REDIS_OK;
-}
-
-/**
- * redisSSLContext helper context destruction.
- */
-
-const char *redisSSLContextGetError(redisSSLContextError error)
-{
-    switch (error) {
-        case REDIS_SSL_CTX_NONE:
-            return "No Error";
-        case REDIS_SSL_CTX_CREATE_FAILED:
-            return "Failed to create OpenSSL SSL_CTX";
-        case REDIS_SSL_CTX_CERT_KEY_REQUIRED:
-            return "Client cert and key must both be specified or skipped";
-        case REDIS_SSL_CTX_CA_CERT_LOAD_FAILED:
-            return "Failed to load CA Certificate or CA Path";
-        case REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED:
-            return "Failed to load client certificate";
-        case REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED:
-            return "Failed to load private key";
-        default:
-            return "Unknown error code";
-    }
-}
-
-void redisFreeSSLContext(redisSSLContext *ctx)
-{
-    if (!ctx)
-        return;
-
-    if (ctx->server_name) {
-        hi_free(ctx->server_name);
-        ctx->server_name = NULL;
-    }
-
-    if (ctx->ssl_ctx) {
-        SSL_CTX_free(ctx->ssl_ctx);
-        ctx->ssl_ctx = NULL;
-    }
-
-    hi_free(ctx);
-}
-
-
-/**
- * redisSSLContext helper context initialization.
- */
-
-redisSSLContext *redisCreateSSLContext(const char *cacert_filename, const char *capath,
-        const char *cert_filename, const char *private_key_filename,
-        const char *server_name, redisSSLContextError *error)
-{
-    redisSSLContext *ctx = hi_calloc(1, sizeof(redisSSLContext));
-    if (ctx == NULL)
-        goto error;
-
-    ctx->ssl_ctx = SSL_CTX_new(SSLv23_client_method());
-    if (!ctx->ssl_ctx) {
-        if (error) *error = REDIS_SSL_CTX_CREATE_FAILED;
-        goto error;
-    }
-
-    SSL_CTX_set_options(ctx->ssl_ctx, SSL_OP_NO_SSLv2 | SSL_OP_NO_SSLv3);
-    SSL_CTX_set_verify(ctx->ssl_ctx, SSL_VERIFY_PEER, NULL);
-
-    if ((cert_filename != NULL && private_key_filename == NULL) ||
-            (private_key_filename != NULL && cert_filename == NULL)) {
-        if (error) *error = REDIS_SSL_CTX_CERT_KEY_REQUIRED;
-        goto error;
-    }
-
-    if (capath || cacert_filename) {
-        if (!SSL_CTX_load_verify_locations(ctx->ssl_ctx, cacert_filename, capath)) {
-            if (error) *error = REDIS_SSL_CTX_CA_CERT_LOAD_FAILED;
-            goto error;
-        }
-    }
-
-    if (cert_filename) {
-        if (!SSL_CTX_use_certificate_chain_file(ctx->ssl_ctx, cert_filename)) {
-            if (error) *error = REDIS_SSL_CTX_CLIENT_CERT_LOAD_FAILED;
-            goto error;
-        }
-        if (!SSL_CTX_use_PrivateKey_file(ctx->ssl_ctx, private_key_filename, SSL_FILETYPE_PEM)) {
-            if (error) *error = REDIS_SSL_CTX_PRIVATE_KEY_LOAD_FAILED;
-            goto error;
-        }
-    }
-
-    if (server_name)
-        ctx->server_name = hi_strdup(server_name);
-
-    return ctx;
-
-error:
-    redisFreeSSLContext(ctx);
-    return NULL;
-}
-
-/**
- * SSL Connection initialization.
- */
-
-
-static int redisSSLConnect(redisContext *c, SSL *ssl) {
-    if (c->privctx) {
-        __redisSetError(c, REDIS_ERR_OTHER, "redisContext was already associated");
-        return REDIS_ERR;
-    }
-
-    redisSSL *rssl = hi_calloc(1, sizeof(redisSSL));
-    if (rssl == NULL) {
-        __redisSetError(c, REDIS_ERR_OOM, "Out of memory");
-        return REDIS_ERR;
-    }
-
-    c->funcs = &redisContextSSLFuncs;
-    rssl->ssl = ssl;
-
-    SSL_set_mode(rssl->ssl, SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
-    SSL_set_fd(rssl->ssl, c->fd);
-    SSL_set_connect_state(rssl->ssl);
-
-    ERR_clear_error();
-    int rv = SSL_connect(rssl->ssl);
-    if (rv == 1) {
-        c->privctx = rssl;
-        return REDIS_OK;
-    }
-
-    rv = SSL_get_error(rssl->ssl, rv);
-    if (((c->flags & REDIS_BLOCK) == 0) &&
-        (rv == SSL_ERROR_WANT_READ || rv == SSL_ERROR_WANT_WRITE)) {
-        c->privctx = rssl;
-        return REDIS_OK;
-    }
-
-    if (c->err == 0) {
-        char err[512];
-        if (rv == SSL_ERROR_SYSCALL)
-            snprintf(err,sizeof(err)-1,"SSL_connect failed: %s",strerror(errno));
-        else {
-            unsigned long e = ERR_peek_last_error();
-            snprintf(err,sizeof(err)-1,"SSL_connect failed: %s",
-                    ERR_reason_error_string(e));
-        }
-        __redisSetError(c, REDIS_ERR_IO, err);
-    }
-
-    hi_free(rssl);
-    return REDIS_ERR;
-}
-
-/**
- * A wrapper around redisSSLConnect() for users who manage their own context and
- * create their own SSL object.
- */
-
-int redisInitiateSSL(redisContext *c, SSL *ssl) {
-    return redisSSLConnect(c, ssl);
-}
-
-/**
- * A wrapper around redisSSLConnect() for users who use redisSSLContext and don't
- * manage their own SSL objects.
- */
-
-int redisInitiateSSLWithContext(redisContext *c, redisSSLContext *redis_ssl_ctx)
-{
-    if (!c || !redis_ssl_ctx)
-        return REDIS_ERR;
-
-    /* We want to verify that redisSSLConnect() won't fail on this, as it will
-     * not own the SSL object in that case and we'll end up leaking.
-     */
-    if (c->privctx)
-        return REDIS_ERR;
-
-    SSL *ssl = SSL_new(redis_ssl_ctx->ssl_ctx);
-    if (!ssl) {
-        __redisSetError(c, REDIS_ERR_OTHER, "Couldn't create new SSL instance");
-        goto error;
-    }
-
-    if (redis_ssl_ctx->server_name) {
-        if (!SSL_set_tlsext_host_name(ssl, redis_ssl_ctx->server_name)) {
-            __redisSetError(c, REDIS_ERR_OTHER, "Failed to set server_name/SNI");
-            goto error;
-        }
-    }
-
-    return redisSSLConnect(c, ssl);
-
-error:
-    if (ssl)
-        SSL_free(ssl);
-    return REDIS_ERR;
-}
-
-static int maybeCheckWant(redisSSL *rssl, int rv) {
-    /**
-     * If the error is WANT_READ or WANT_WRITE, the appropriate flags are set
-     * and true is returned. False is returned otherwise
-     */
-    if (rv == SSL_ERROR_WANT_READ) {
-        rssl->wantRead = 1;
-        return 1;
-    } else if (rv == SSL_ERROR_WANT_WRITE) {
-        rssl->pendingWrite = 1;
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/**
- * Implementation of redisContextFuncs for SSL connections.
- */
-
-static void redisSSLFree(void *privctx){
-    redisSSL *rsc = privctx;
-
-    if (!rsc) return;
-    if (rsc->ssl) {
-        SSL_free(rsc->ssl);
-        rsc->ssl = NULL;
-    }
-    hi_free(rsc);
-}
-
-static ssize_t redisSSLRead(redisContext *c, char *buf, size_t bufcap) {
-    redisSSL *rssl = c->privctx;
-
-    int nread = SSL_read(rssl->ssl, buf, bufcap);
-    if (nread > 0) {
-        return nread;
-    } else if (nread == 0) {
-        __redisSetError(c, REDIS_ERR_EOF, "Server closed the connection");
-        return -1;
-    } else {
-        int err = SSL_get_error(rssl->ssl, nread);
-        if (c->flags & REDIS_BLOCK) {
-            /**
-             * In blocking mode, we should never end up in a situation where
-             * we get an error without it being an actual error, except
-             * in the case of EINTR, which can be spuriously received from
-             * debuggers or whatever.
-             */
-            if (errno == EINTR) {
-                return 0;
-            } else {
-                const char *msg = NULL;
-                if (errno == EAGAIN) {
-                    msg = "Resource temporarily unavailable";
-                }
-                __redisSetError(c, REDIS_ERR_IO, msg);
-                return -1;
-            }
-        }
-
-        /**
-         * We can very well get an EWOULDBLOCK/EAGAIN, however
-         */
-        if (maybeCheckWant(rssl, err)) {
-            return 0;
-        } else {
-            __redisSetError(c, REDIS_ERR_IO, NULL);
-            return -1;
-        }
-    }
-}
-
-static ssize_t redisSSLWrite(redisContext *c) {
-    redisSSL *rssl = c->privctx;
-
-    size_t len = rssl->lastLen ? rssl->lastLen : hi_sdslen(c->obuf);
-    int rv = SSL_write(rssl->ssl, c->obuf, len);
-
-    if (rv > 0) {
-        rssl->lastLen = 0;
-    } else if (rv < 0) {
-        rssl->lastLen = len;
-
-        int err = SSL_get_error(rssl->ssl, rv);
-        if ((c->flags & REDIS_BLOCK) == 0 && maybeCheckWant(rssl, err)) {
-            return 0;
-        } else {
-            __redisSetError(c, REDIS_ERR_IO, NULL);
-            return -1;
-        }
-    }
-    return rv;
-}
-
-static void redisSSLAsyncRead(redisAsyncContext *ac) {
-    int rv;
-    redisSSL *rssl = ac->c.privctx;
-    redisContext *c = &ac->c;
-
-    rssl->wantRead = 0;
-
-    if (rssl->pendingWrite) {
-        int done;
-
-        /* This is probably just a write event */
-        rssl->pendingWrite = 0;
-        rv = redisBufferWrite(c, &done);
-        if (rv == REDIS_ERR) {
-            __redisAsyncDisconnect(ac);
-            return;
-        } else if (!done) {
-            _EL_ADD_WRITE(ac);
-        }
-    }
-
-    rv = redisBufferRead(c);
-    if (rv == REDIS_ERR) {
-        __redisAsyncDisconnect(ac);
-    } else {
-        _EL_ADD_READ(ac);
-        redisProcessCallbacks(ac);
-    }
-}
-
-static void redisSSLAsyncWrite(redisAsyncContext *ac) {
-    int rv, done = 0;
-    redisSSL *rssl = ac->c.privctx;
-    redisContext *c = &ac->c;
-
-    rssl->pendingWrite = 0;
-    rv = redisBufferWrite(c, &done);
-    if (rv == REDIS_ERR) {
-        __redisAsyncDisconnect(ac);
-        return;
-    }
-
-    if (!done) {
-        if (rssl->wantRead) {
-            /* Need to read-before-write */
-            rssl->pendingWrite = 1;
-            _EL_DEL_WRITE(ac);
-        } else {
-            /* No extra reads needed, just need to write more */
-            _EL_ADD_WRITE(ac);
-        }
-    } else {
-        /* Already done! */
-        _EL_DEL_WRITE(ac);
-    }
-
-    /* Always reschedule a read */
-    _EL_ADD_READ(ac);
-}
-
-redisContextFuncs redisContextSSLFuncs = {
-    .free_privctx = redisSSLFree,
-    .async_read = redisSSLAsyncRead,
-    .async_write = redisSSLAsyncWrite,
-    .read = redisSSLRead,
-    .write = redisSSLWrite
-};
-
diff --git a/redis-stable/deps/hiredis/test.c b/redis-stable/deps/hiredis/test.c
deleted file mode 100644
index bdff74e8..00000000
--- a/redis-stable/deps/hiredis/test.c
+++ /dev/null
@@ -1,1425 +0,0 @@
-#include "fmacros.h"
-#include "sockcompat.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#ifndef _WIN32
-#include <strings.h>
-#include <sys/time.h>
-#endif
-#include <assert.h>
-#include <signal.h>
-#include <errno.h>
-#include <limits.h>
-
-#include "hiredis.h"
-#include "async.h"
-#ifdef HIREDIS_TEST_SSL
-#include "hiredis_ssl.h"
-#endif
-#include "net.h"
-#include "win32.h"
-
-enum connection_type {
-    CONN_TCP,
-    CONN_UNIX,
-    CONN_FD,
-    CONN_SSL
-};
-
-struct config {
-    enum connection_type type;
-
-    struct {
-        const char *host;
-        int port;
-        struct timeval timeout;
-    } tcp;
-
-    struct {
-        const char *path;
-    } unix_sock;
-
-    struct {
-        const char *host;
-        int port;
-        const char *ca_cert;
-        const char *cert;
-        const char *key;
-    } ssl;
-};
-
-struct privdata {
-    int dtor_counter;
-};
-
-struct pushCounters {
-    int nil;
-    int str;
-};
-
-#ifdef HIREDIS_TEST_SSL
-redisSSLContext *_ssl_ctx = NULL;
-#endif
-
-/* The following lines make up our testing "framework" :) */
-static int tests = 0, fails = 0, skips = 0;
-#define test(_s) { printf("#%02d ", ++tests); printf(_s); }
-#define test_cond(_c) if(_c) printf("\033[0;32mPASSED\033[0;0m\n"); else {printf("\033[0;31mFAILED\033[0;0m\n"); fails++;}
-#define test_skipped() { printf("\033[01;33mSKIPPED\033[0;0m\n"); skips++; }
-
-static long long usec(void) {
-#ifndef _MSC_VER
-    struct timeval tv;
-    gettimeofday(&tv,NULL);
-    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
-#else
-    FILETIME ft;
-    GetSystemTimeAsFileTime(&ft);
-    return (((long long)ft.dwHighDateTime << 32) | ft.dwLowDateTime) / 10;
-#endif
-}
-
-/* The assert() calls below have side effects, so we need assert()
- * even if we are compiling without asserts (-DNDEBUG). */
-#ifdef NDEBUG
-#undef assert
-#define assert(e) (void)(e)
-#endif
-
-/* Helper to extract Redis version information.  Aborts on any failure. */
-#define REDIS_VERSION_FIELD "redis_version:"
-void get_redis_version(redisContext *c, int *majorptr, int *minorptr) {
-    redisReply *reply;
-    char *eptr, *s, *e;
-    int major, minor;
-
-    reply = redisCommand(c, "INFO");
-    if (reply == NULL || c->err || reply->type != REDIS_REPLY_STRING)
-        goto abort;
-    if ((s = strstr(reply->str, REDIS_VERSION_FIELD)) == NULL)
-        goto abort;
-
-    s += strlen(REDIS_VERSION_FIELD);
-
-    /* We need a field terminator and at least 'x.y.z' (5) bytes of data */
-    if ((e = strstr(s, "\r\n")) == NULL || (e - s) < 5)
-        goto abort;
-
-    /* Extract version info */
-    major = strtol(s, &eptr, 10);
-    if (*eptr != '.') goto abort;
-    minor = strtol(eptr+1, NULL, 10);
-
-    /* Push info the caller wants */
-    if (majorptr) *majorptr = major;
-    if (minorptr) *minorptr = minor;
-
-    freeReplyObject(reply);
-    return;
-
-abort:
-    freeReplyObject(reply);
-    fprintf(stderr, "Error:  Cannot determine Redis version, aborting\n");
-    exit(1);
-}
-
-static redisContext *select_database(redisContext *c) {
-    redisReply *reply;
-
-    /* Switch to DB 9 for testing, now that we know we can chat. */
-    reply = redisCommand(c,"SELECT 9");
-    assert(reply != NULL);
-    freeReplyObject(reply);
-
-    /* Make sure the DB is emtpy */
-    reply = redisCommand(c,"DBSIZE");
-    assert(reply != NULL);
-    if (reply->type == REDIS_REPLY_INTEGER && reply->integer == 0) {
-        /* Awesome, DB 9 is empty and we can continue. */
-        freeReplyObject(reply);
-    } else {
-        printf("Database #9 is not empty, test can not continue\n");
-        exit(1);
-    }
-
-    return c;
-}
-
-/* Switch protocol */
-static void send_hello(redisContext *c, int version) {
-    redisReply *reply;
-    int expected;
-
-    reply = redisCommand(c, "HELLO %d", version);
-    expected = version == 3 ? REDIS_REPLY_MAP : REDIS_REPLY_ARRAY;
-    assert(reply != NULL && reply->type == expected);
-    freeReplyObject(reply);
-}
-
-/* Togggle client tracking */
-static void send_client_tracking(redisContext *c, const char *str) {
-    redisReply *reply;
-
-    reply = redisCommand(c, "CLIENT TRACKING %s", str);
-    assert(reply != NULL && reply->type == REDIS_REPLY_STATUS);
-    freeReplyObject(reply);
-}
-
-static int disconnect(redisContext *c, int keep_fd) {
-    redisReply *reply;
-
-    /* Make sure we're on DB 9. */
-    reply = redisCommand(c,"SELECT 9");
-    assert(reply != NULL);
-    freeReplyObject(reply);
-    reply = redisCommand(c,"FLUSHDB");
-    assert(reply != NULL);
-    freeReplyObject(reply);
-
-    /* Free the context as well, but keep the fd if requested. */
-    if (keep_fd)
-        return redisFreeKeepFd(c);
-    redisFree(c);
-    return -1;
-}
-
-static void do_ssl_handshake(redisContext *c) {
-#ifdef HIREDIS_TEST_SSL
-    redisInitiateSSLWithContext(c, _ssl_ctx);
-    if (c->err) {
-        printf("SSL error: %s\n", c->errstr);
-        redisFree(c);
-        exit(1);
-    }
-#else
-    (void) c;
-#endif
-}
-
-static redisContext *do_connect(struct config config) {
-    redisContext *c = NULL;
-
-    if (config.type == CONN_TCP) {
-        c = redisConnect(config.tcp.host, config.tcp.port);
-    } else if (config.type == CONN_SSL) {
-        c = redisConnect(config.ssl.host, config.ssl.port);
-    } else if (config.type == CONN_UNIX) {
-        c = redisConnectUnix(config.unix_sock.path);
-    } else if (config.type == CONN_FD) {
-        /* Create a dummy connection just to get an fd to inherit */
-        redisContext *dummy_ctx = redisConnectUnix(config.unix_sock.path);
-        if (dummy_ctx) {
-            int fd = disconnect(dummy_ctx, 1);
-            printf("Connecting to inherited fd %d\n", fd);
-            c = redisConnectFd(fd);
-        }
-    } else {
-        assert(NULL);
-    }
-
-    if (c == NULL) {
-        printf("Connection error: can't allocate redis context\n");
-        exit(1);
-    } else if (c->err) {
-        printf("Connection error: %s\n", c->errstr);
-        redisFree(c);
-        exit(1);
-    }
-
-    if (config.type == CONN_SSL) {
-        do_ssl_handshake(c);
-    }
-
-    return select_database(c);
-}
-
-static void do_reconnect(redisContext *c, struct config config) {
-    redisReconnect(c);
-
-    if (config.type == CONN_SSL) {
-        do_ssl_handshake(c);
-    }
-}
-
-static void test_format_commands(void) {
-    char *cmd;
-    int len;
-
-    test("Format command without interpolation: ");
-    len = redisFormatCommand(&cmd,"SET foo bar");
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
-    hi_free(cmd);
-
-    test("Format command with %%s string interpolation: ");
-    len = redisFormatCommand(&cmd,"SET %s %s","foo","bar");
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
-    hi_free(cmd);
-
-    test("Format command with %%s and an empty string: ");
-    len = redisFormatCommand(&cmd,"SET %s %s","foo","");
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$0\r\n\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(0+2));
-    hi_free(cmd);
-
-    test("Format command with an empty string in between proper interpolations: ");
-    len = redisFormatCommand(&cmd,"SET %s %s","","foo");
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$0\r\n\r\n$3\r\nfoo\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(0+2)+4+(3+2));
-    hi_free(cmd);
-
-    test("Format command with %%b string interpolation: ");
-    len = redisFormatCommand(&cmd,"SET %b %b","foo",(size_t)3,"b\0r",(size_t)3);
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nb\0r\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
-    hi_free(cmd);
-
-    test("Format command with %%b and an empty string: ");
-    len = redisFormatCommand(&cmd,"SET %b %b","foo",(size_t)3,"",(size_t)0);
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$0\r\n\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(0+2));
-    hi_free(cmd);
-
-    test("Format command with literal %%: ");
-    len = redisFormatCommand(&cmd,"SET %% %%");
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$1\r\n%\r\n$1\r\n%\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(1+2)+4+(1+2));
-    hi_free(cmd);
-
-    /* Vararg width depends on the type. These tests make sure that the
-     * width is correctly determined using the format and subsequent varargs
-     * can correctly be interpolated. */
-#define INTEGER_WIDTH_TEST(fmt, type) do {                                                \
-    type value = 123;                                                                     \
-    test("Format command with printf-delegation (" #type "): ");                          \
-    len = redisFormatCommand(&cmd,"key:%08" fmt " str:%s", value, "hello");               \
-    test_cond(strncmp(cmd,"*2\r\n$12\r\nkey:00000123\r\n$9\r\nstr:hello\r\n",len) == 0 && \
-        len == 4+5+(12+2)+4+(9+2));                                                       \
-    hi_free(cmd);                                                                         \
-} while(0)
-
-#define FLOAT_WIDTH_TEST(type) do {                                                       \
-    type value = 123.0;                                                                   \
-    test("Format command with printf-delegation (" #type "): ");                          \
-    len = redisFormatCommand(&cmd,"key:%08.3f str:%s", value, "hello");                   \
-    test_cond(strncmp(cmd,"*2\r\n$12\r\nkey:0123.000\r\n$9\r\nstr:hello\r\n",len) == 0 && \
-        len == 4+5+(12+2)+4+(9+2));                                                       \
-    hi_free(cmd);                                                                         \
-} while(0)
-
-    INTEGER_WIDTH_TEST("d", int);
-    INTEGER_WIDTH_TEST("hhd", char);
-    INTEGER_WIDTH_TEST("hd", short);
-    INTEGER_WIDTH_TEST("ld", long);
-    INTEGER_WIDTH_TEST("lld", long long);
-    INTEGER_WIDTH_TEST("u", unsigned int);
-    INTEGER_WIDTH_TEST("hhu", unsigned char);
-    INTEGER_WIDTH_TEST("hu", unsigned short);
-    INTEGER_WIDTH_TEST("lu", unsigned long);
-    INTEGER_WIDTH_TEST("llu", unsigned long long);
-    FLOAT_WIDTH_TEST(float);
-    FLOAT_WIDTH_TEST(double);
-
-    test("Format command with invalid printf format: ");
-    len = redisFormatCommand(&cmd,"key:%08p %b",(void*)1234,"foo",(size_t)3);
-    test_cond(len == -1);
-
-    const char *argv[3];
-    argv[0] = "SET";
-    argv[1] = "foo\0xxx";
-    argv[2] = "bar";
-    size_t lens[3] = { 3, 7, 3 };
-    int argc = 3;
-
-    test("Format command by passing argc/argv without lengths: ");
-    len = redisFormatCommandArgv(&cmd,argc,argv,NULL);
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
-    hi_free(cmd);
-
-    test("Format command by passing argc/argv with lengths: ");
-    len = redisFormatCommandArgv(&cmd,argc,argv,lens);
-    test_cond(strncmp(cmd,"*3\r\n$3\r\nSET\r\n$7\r\nfoo\0xxx\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(7+2)+4+(3+2));
-    hi_free(cmd);
-
-    hisds sds_cmd;
-
-    sds_cmd = NULL;
-    test("Format command into hisds by passing argc/argv without lengths: ");
-    len = redisFormatSdsCommandArgv(&sds_cmd,argc,argv,NULL);
-    test_cond(strncmp(sds_cmd,"*3\r\n$3\r\nSET\r\n$3\r\nfoo\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(3+2)+4+(3+2));
-    hi_sdsfree(sds_cmd);
-
-    sds_cmd = NULL;
-    test("Format command into hisds by passing argc/argv with lengths: ");
-    len = redisFormatSdsCommandArgv(&sds_cmd,argc,argv,lens);
-    test_cond(strncmp(sds_cmd,"*3\r\n$3\r\nSET\r\n$7\r\nfoo\0xxx\r\n$3\r\nbar\r\n",len) == 0 &&
-        len == 4+4+(3+2)+4+(7+2)+4+(3+2));
-    hi_sdsfree(sds_cmd);
-}
-
-static void test_append_formatted_commands(struct config config) {
-    redisContext *c;
-    redisReply *reply;
-    char *cmd;
-    int len;
-
-    c = do_connect(config);
-
-    test("Append format command: ");
-
-    len = redisFormatCommand(&cmd, "SET foo bar");
-
-    test_cond(redisAppendFormattedCommand(c, cmd, len) == REDIS_OK);
-
-    assert(redisGetReply(c, (void*)&reply) == REDIS_OK);
-
-    hi_free(cmd);
-    freeReplyObject(reply);
-
-    disconnect(c, 0);
-}
-
-static void test_reply_reader(void) {
-    redisReader *reader;
-    void *reply, *root;
-    int ret;
-    int i;
-
-    test("Error handling in reply parser: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader,(char*)"@foo\r\n",6);
-    ret = redisReaderGetReply(reader,NULL);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Protocol error, got \"@\" as reply type byte") == 0);
-    redisReaderFree(reader);
-
-    /* when the reply already contains multiple items, they must be free'd
-     * on an error. valgrind will bark when this doesn't happen. */
-    test("Memory cleanup in reply parser: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader,(char*)"*2\r\n",4);
-    redisReaderFeed(reader,(char*)"$5\r\nhello\r\n",11);
-    redisReaderFeed(reader,(char*)"@foo\r\n",6);
-    ret = redisReaderGetReply(reader,NULL);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Protocol error, got \"@\" as reply type byte") == 0);
-    redisReaderFree(reader);
-
-    reader = redisReaderCreate();
-    test("Can handle arbitrarily nested multi-bulks: ");
-    for (i = 0; i < 128; i++) {
-        redisReaderFeed(reader,(char*)"*1\r\n", 4);
-    }
-    redisReaderFeed(reader,(char*)"$6\r\nLOLWUT\r\n",12);
-    ret = redisReaderGetReply(reader,&reply);
-    root = reply; /* Keep track of the root reply */
-    test_cond(ret == REDIS_OK &&
-        ((redisReply*)reply)->type == REDIS_REPLY_ARRAY &&
-        ((redisReply*)reply)->elements == 1);
-
-    test("Can parse arbitrarily nested multi-bulks correctly: ");
-    while(i--) {
-        assert(reply != NULL && ((redisReply*)reply)->type == REDIS_REPLY_ARRAY);
-        reply = ((redisReply*)reply)->element[0];
-    }
-    test_cond(((redisReply*)reply)->type == REDIS_REPLY_STRING &&
-        !memcmp(((redisReply*)reply)->str, "LOLWUT", 6));
-    freeReplyObject(root);
-    redisReaderFree(reader);
-
-    test("Correctly parses LLONG_MAX: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, ":9223372036854775807\r\n",22);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK &&
-            ((redisReply*)reply)->type == REDIS_REPLY_INTEGER &&
-            ((redisReply*)reply)->integer == LLONG_MAX);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Set error when > LLONG_MAX: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, ":9223372036854775808\r\n",22);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Bad integer value") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Correctly parses LLONG_MIN: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, ":-9223372036854775808\r\n",23);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK &&
-            ((redisReply*)reply)->type == REDIS_REPLY_INTEGER &&
-            ((redisReply*)reply)->integer == LLONG_MIN);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Set error when < LLONG_MIN: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, ":-9223372036854775809\r\n",23);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Bad integer value") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Set error when array < -1: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, "*-2\r\n+asdf\r\n",12);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Multi-bulk length out of range") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Set error when bulk < -1: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, "$-2\r\nasdf\r\n",11);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr,"Bulk string length out of range") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Can configure maximum multi-bulk elements: ");
-    reader = redisReaderCreate();
-    reader->maxelements = 1024;
-    redisReaderFeed(reader, "*1025\r\n", 7);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-              strcasecmp(reader->errstr, "Multi-bulk length out of range") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Multi-bulk never overflows regardless of maxelements: ");
-    size_t bad_mbulk_len = (SIZE_MAX / sizeof(void *)) + 3;
-    char bad_mbulk_reply[100];
-    snprintf(bad_mbulk_reply, sizeof(bad_mbulk_reply), "*%llu\r\n+asdf\r\n",
-        (unsigned long long) bad_mbulk_len);
-
-    reader = redisReaderCreate();
-    reader->maxelements = 0;    /* Don't rely on default limit */
-    redisReaderFeed(reader, bad_mbulk_reply, strlen(bad_mbulk_reply));
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR && strcasecmp(reader->errstr, "Out of memory") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-#if LLONG_MAX > SIZE_MAX
-    test("Set error when array > SIZE_MAX: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, "*9223372036854775807\r\n+asdf\r\n",29);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-            strcasecmp(reader->errstr,"Multi-bulk length out of range") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    test("Set error when bulk > SIZE_MAX: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader, "$9223372036854775807\r\nasdf\r\n",28);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR &&
-            strcasecmp(reader->errstr,"Bulk string length out of range") == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-#endif
-
-    test("Works with NULL functions for reply: ");
-    reader = redisReaderCreate();
-    reader->fn = NULL;
-    redisReaderFeed(reader,(char*)"+OK\r\n",5);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK && reply == (void*)REDIS_REPLY_STATUS);
-    redisReaderFree(reader);
-
-    test("Works when a single newline (\\r\\n) covers two calls to feed: ");
-    reader = redisReaderCreate();
-    reader->fn = NULL;
-    redisReaderFeed(reader,(char*)"+OK\r",4);
-    ret = redisReaderGetReply(reader,&reply);
-    assert(ret == REDIS_OK && reply == NULL);
-    redisReaderFeed(reader,(char*)"\n",1);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK && reply == (void*)REDIS_REPLY_STATUS);
-    redisReaderFree(reader);
-
-    test("Don't reset state after protocol error: ");
-    reader = redisReaderCreate();
-    reader->fn = NULL;
-    redisReaderFeed(reader,(char*)"x",1);
-    ret = redisReaderGetReply(reader,&reply);
-    assert(ret == REDIS_ERR);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_ERR && reply == NULL);
-    redisReaderFree(reader);
-
-    /* Regression test for issue #45 on GitHub. */
-    test("Don't do empty allocation for empty multi bulk: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader,(char*)"*0\r\n",4);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK &&
-        ((redisReply*)reply)->type == REDIS_REPLY_ARRAY &&
-        ((redisReply*)reply)->elements == 0);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    /* RESP3 verbatim strings (GitHub issue #802) */
-    test("Can parse RESP3 verbatim strings: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader,(char*)"=10\r\ntxt:LOLWUT\r\n",17);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK &&
-        ((redisReply*)reply)->type == REDIS_REPLY_VERB &&
-         !memcmp(((redisReply*)reply)->str,"LOLWUT", 6));
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-
-    /* RESP3 push messages (Github issue #815) */
-    test("Can parse RESP3 push messages: ");
-    reader = redisReaderCreate();
-    redisReaderFeed(reader,(char*)">2\r\n$6\r\nLOLWUT\r\n:42\r\n",21);
-    ret = redisReaderGetReply(reader,&reply);
-    test_cond(ret == REDIS_OK &&
-        ((redisReply*)reply)->type == REDIS_REPLY_PUSH &&
-        ((redisReply*)reply)->elements == 2 &&
-        ((redisReply*)reply)->element[0]->type == REDIS_REPLY_STRING &&
-        !memcmp(((redisReply*)reply)->element[0]->str,"LOLWUT",6) &&
-        ((redisReply*)reply)->element[1]->type == REDIS_REPLY_INTEGER &&
-        ((redisReply*)reply)->element[1]->integer == 42);
-    freeReplyObject(reply);
-    redisReaderFree(reader);
-}
-
-static void test_free_null(void) {
-    void *redisCtx = NULL;
-    void *reply = NULL;
-
-    test("Don't fail when redisFree is passed a NULL value: ");
-    redisFree(redisCtx);
-    test_cond(redisCtx == NULL);
-
-    test("Don't fail when freeReplyObject is passed a NULL value: ");
-    freeReplyObject(reply);
-    test_cond(reply == NULL);
-}
-
-static void *hi_malloc_fail(size_t size) {
-    (void)size;
-    return NULL;
-}
-
-static void *hi_calloc_fail(size_t nmemb, size_t size) {
-    (void)nmemb;
-    (void)size;
-    return NULL;
-}
-
-static void *hi_realloc_fail(void *ptr, size_t size) {
-    (void)ptr;
-    (void)size;
-    return NULL;
-}
-
-static void test_allocator_injection(void) {
-    hiredisAllocFuncs ha = {
-        .mallocFn = hi_malloc_fail,
-        .callocFn = hi_calloc_fail,
-        .reallocFn = hi_realloc_fail,
-        .strdupFn = strdup,
-        .freeFn = free,
-    };
-
-    // Override hiredis allocators
-    hiredisSetAllocators(&ha);
-
-    test("redisContext uses injected allocators: ");
-    redisContext *c = redisConnect("localhost", 6379);
-    test_cond(c == NULL);
-
-    test("redisReader uses injected allocators: ");
-    redisReader *reader = redisReaderCreate();
-    test_cond(reader == NULL);
-
-    // Return allocators to default
-    hiredisResetAllocators();
-}
-
-#define HIREDIS_BAD_DOMAIN "idontexist-noreally.com"
-static void test_blocking_connection_errors(void) {
-    redisContext *c;
-    struct addrinfo hints = {.ai_family = AF_INET};
-    struct addrinfo *ai_tmp = NULL;
-
-    int rv = getaddrinfo(HIREDIS_BAD_DOMAIN, "6379", &hints, &ai_tmp);
-    if (rv != 0) {
-        // Address does *not* exist
-        test("Returns error when host cannot be resolved: ");
-        // First see if this domain name *actually* resolves to NXDOMAIN
-        c = redisConnect(HIREDIS_BAD_DOMAIN, 6379);
-        test_cond(
-            c->err == REDIS_ERR_OTHER &&
-            (strcmp(c->errstr, "Name or service not known") == 0 ||
-             strcmp(c->errstr, "Can't resolve: " HIREDIS_BAD_DOMAIN) == 0 ||
-             strcmp(c->errstr, "Name does not resolve") == 0 ||
-             strcmp(c->errstr, "nodename nor servname provided, or not known") == 0 ||
-             strcmp(c->errstr, "No address associated with hostname") == 0 ||
-             strcmp(c->errstr, "Temporary failure in name resolution") == 0 ||
-             strcmp(c->errstr, "hostname nor servname provided, or not known") == 0 ||
-             strcmp(c->errstr, "no address associated with name") == 0 ||
-             strcmp(c->errstr, "No such host is known. ") == 0));
-        redisFree(c);
-    } else {
-        printf("Skipping NXDOMAIN test. Found evil ISP!\n");
-        freeaddrinfo(ai_tmp);
-    }
-
-#ifndef _WIN32
-    test("Returns error when the port is not open: ");
-    c = redisConnect((char*)"localhost", 1);
-    test_cond(c->err == REDIS_ERR_IO &&
-        strcmp(c->errstr,"Connection refused") == 0);
-    redisFree(c);
-
-    test("Returns error when the unix_sock socket path doesn't accept connections: ");
-    c = redisConnectUnix((char*)"/tmp/idontexist.sock");
-    test_cond(c->err == REDIS_ERR_IO); /* Don't care about the message... */
-    redisFree(c);
-#endif
-}
-
-/* Test push handler */
-void push_handler(void *privdata, void *r) {
-    struct pushCounters *pcounts = privdata;
-    redisReply *reply = r, *payload;
-
-    assert(reply && reply->type == REDIS_REPLY_PUSH && reply->elements == 2);
-
-    payload = reply->element[1];
-    if (payload->type == REDIS_REPLY_ARRAY) {
-        payload = payload->element[0];
-    }
-
-    if (payload->type == REDIS_REPLY_STRING) {
-        pcounts->str++;
-    } else if (payload->type == REDIS_REPLY_NIL) {
-        pcounts->nil++;
-    }
-
-    freeReplyObject(reply);
-}
-
-/* Dummy function just to test setting a callback with redisOptions */
-void push_handler_async(redisAsyncContext *ac, void *reply) {
-    (void)ac;
-    (void)reply;
-}
-
-static void test_resp3_push_handler(redisContext *c) {
-    struct pushCounters pc = {0};
-    redisPushFn *old = NULL;
-    redisReply *reply;
-    void *privdata;
-
-    /* Switch to RESP3 and turn on client tracking */
-    send_hello(c, 3);
-    send_client_tracking(c, "ON");
-    privdata = c->privdata;
-    c->privdata = &pc;
-
-    reply = redisCommand(c, "GET key:0");
-    assert(reply != NULL);
-    freeReplyObject(reply);
-
-    test("RESP3 PUSH messages are handled out of band by default: ");
-    reply = redisCommand(c, "SET key:0 val:0");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS);
-    freeReplyObject(reply);
-
-    assert((reply = redisCommand(c, "GET key:0")) != NULL);
-    freeReplyObject(reply);
-
-    old = redisSetPushCallback(c, push_handler);
-    test("We can set a custom RESP3 PUSH handler: ");
-    reply = redisCommand(c, "SET key:0 val:0");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && pc.str == 1);
-    freeReplyObject(reply);
-
-    test("We properly handle a NIL invalidation payload: ");
-    reply = redisCommand(c, "FLUSHDB");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && pc.nil == 1);
-    freeReplyObject(reply);
-
-    /* Unset the push callback and generate an invalidate message making
-     * sure it is not handled out of band. */
-    test("With no handler, PUSH replies come in-band: ");
-    redisSetPushCallback(c, NULL);
-    assert((reply = redisCommand(c, "GET key:0")) != NULL);
-    freeReplyObject(reply);
-    assert((reply = redisCommand(c, "SET key:0 invalid")) != NULL);
-    test_cond(reply->type == REDIS_REPLY_PUSH);
-    freeReplyObject(reply);
-
-    test("With no PUSH handler, no replies are lost: ");
-    assert(redisGetReply(c, (void**)&reply) == REDIS_OK);
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS);
-    freeReplyObject(reply);
-
-    /* Return to the originally set PUSH handler */
-    assert(old != NULL);
-    redisSetPushCallback(c, old);
-
-    /* Switch back to RESP2 and disable tracking */
-    c->privdata = privdata;
-    send_client_tracking(c, "OFF");
-    send_hello(c, 2);
-}
-
-redisOptions get_redis_tcp_options(struct config config) {
-    redisOptions options = {0};
-    REDIS_OPTIONS_SET_TCP(&options, config.tcp.host, config.tcp.port);
-    return options;
-}
-
-static void test_resp3_push_options(struct config config) {
-    redisAsyncContext *ac;
-    redisContext *c;
-    redisOptions options;
-
-    test("We set a default RESP3 handler for redisContext: ");
-    options = get_redis_tcp_options(config);
-    assert((c = redisConnectWithOptions(&options)) != NULL);
-    test_cond(c->push_cb != NULL);
-    redisFree(c);
-
-    test("We don't set a default RESP3 push handler for redisAsyncContext: ");
-    options = get_redis_tcp_options(config);
-    assert((ac = redisAsyncConnectWithOptions(&options)) != NULL);
-    test_cond(ac->c.push_cb == NULL);
-    redisAsyncFree(ac);
-
-    test("Our REDIS_OPT_NO_PUSH_AUTOFREE flag works: ");
-    options = get_redis_tcp_options(config);
-    options.options |= REDIS_OPT_NO_PUSH_AUTOFREE;
-    assert((c = redisConnectWithOptions(&options)) != NULL);
-    test_cond(c->push_cb == NULL);
-    redisFree(c);
-
-    test("We can use redisOptions to set a custom PUSH handler for redisContext: ");
-    options = get_redis_tcp_options(config);
-    options.push_cb = push_handler;
-    assert((c = redisConnectWithOptions(&options)) != NULL);
-    test_cond(c->push_cb == push_handler);
-    redisFree(c);
-
-    test("We can use redisOptions to set a custom PUSH handler for redisAsyncContext: ");
-    options = get_redis_tcp_options(config);
-    options.async_push_cb = push_handler_async;
-    assert((ac = redisAsyncConnectWithOptions(&options)) != NULL);
-    test_cond(ac->push_cb == push_handler_async);
-    redisAsyncFree(ac);
-}
-
-void free_privdata(void *privdata) {
-    struct privdata *data = privdata;
-    data->dtor_counter++;
-}
-
-static void test_privdata_hooks(struct config config) {
-    struct privdata data = {0};
-    redisOptions options;
-    redisContext *c;
-
-    test("We can use redisOptions to set privdata: ");
-    options = get_redis_tcp_options(config);
-    REDIS_OPTIONS_SET_PRIVDATA(&options, &data, free_privdata);
-    assert((c = redisConnectWithOptions(&options)) != NULL);
-    test_cond(c->privdata == &data);
-
-    test("Our privdata destructor fires when we free the context: ");
-    redisFree(c);
-    test_cond(data.dtor_counter == 1);
-}
-
-static void test_blocking_connection(struct config config) {
-    redisContext *c;
-    redisReply *reply;
-    int major;
-
-    c = do_connect(config);
-
-    test("Is able to deliver commands: ");
-    reply = redisCommand(c,"PING");
-    test_cond(reply->type == REDIS_REPLY_STATUS &&
-        strcasecmp(reply->str,"pong") == 0)
-    freeReplyObject(reply);
-
-    test("Is a able to send commands verbatim: ");
-    reply = redisCommand(c,"SET foo bar");
-    test_cond (reply->type == REDIS_REPLY_STATUS &&
-        strcasecmp(reply->str,"ok") == 0)
-    freeReplyObject(reply);
-
-    test("%%s String interpolation works: ");
-    reply = redisCommand(c,"SET %s %s","foo","hello world");
-    freeReplyObject(reply);
-    reply = redisCommand(c,"GET foo");
-    test_cond(reply->type == REDIS_REPLY_STRING &&
-        strcmp(reply->str,"hello world") == 0);
-    freeReplyObject(reply);
-
-    test("%%b String interpolation works: ");
-    reply = redisCommand(c,"SET %b %b","foo",(size_t)3,"hello\x00world",(size_t)11);
-    freeReplyObject(reply);
-    reply = redisCommand(c,"GET foo");
-    test_cond(reply->type == REDIS_REPLY_STRING &&
-        memcmp(reply->str,"hello\x00world",11) == 0)
-
-    test("Binary reply length is correct: ");
-    test_cond(reply->len == 11)
-    freeReplyObject(reply);
-
-    test("Can parse nil replies: ");
-    reply = redisCommand(c,"GET nokey");
-    test_cond(reply->type == REDIS_REPLY_NIL)
-    freeReplyObject(reply);
-
-    /* test 7 */
-    test("Can parse integer replies: ");
-    reply = redisCommand(c,"INCR mycounter");
-    test_cond(reply->type == REDIS_REPLY_INTEGER && reply->integer == 1)
-    freeReplyObject(reply);
-
-    test("Can parse multi bulk replies: ");
-    freeReplyObject(redisCommand(c,"LPUSH mylist foo"));
-    freeReplyObject(redisCommand(c,"LPUSH mylist bar"));
-    reply = redisCommand(c,"LRANGE mylist 0 -1");
-    test_cond(reply->type == REDIS_REPLY_ARRAY &&
-              reply->elements == 2 &&
-              !memcmp(reply->element[0]->str,"bar",3) &&
-              !memcmp(reply->element[1]->str,"foo",3))
-    freeReplyObject(reply);
-
-    /* m/e with multi bulk reply *before* other reply.
-     * specifically test ordering of reply items to parse. */
-    test("Can handle nested multi bulk replies: ");
-    freeReplyObject(redisCommand(c,"MULTI"));
-    freeReplyObject(redisCommand(c,"LRANGE mylist 0 -1"));
-    freeReplyObject(redisCommand(c,"PING"));
-    reply = (redisCommand(c,"EXEC"));
-    test_cond(reply->type == REDIS_REPLY_ARRAY &&
-              reply->elements == 2 &&
-              reply->element[0]->type == REDIS_REPLY_ARRAY &&
-              reply->element[0]->elements == 2 &&
-              !memcmp(reply->element[0]->element[0]->str,"bar",3) &&
-              !memcmp(reply->element[0]->element[1]->str,"foo",3) &&
-              reply->element[1]->type == REDIS_REPLY_STATUS &&
-              strcasecmp(reply->element[1]->str,"pong") == 0);
-    freeReplyObject(reply);
-
-    /* Make sure passing NULL to redisGetReply is safe */
-    test("Can pass NULL to redisGetReply: ");
-    assert(redisAppendCommand(c, "PING") == REDIS_OK);
-    test_cond(redisGetReply(c, NULL) == REDIS_OK);
-
-    get_redis_version(c, &major, NULL);
-    if (major >= 6) test_resp3_push_handler(c);
-    test_resp3_push_options(config);
-
-    test_privdata_hooks(config);
-
-    disconnect(c, 0);
-}
-
-/* Send DEBUG SLEEP 0 to detect if we have this command */
-static int detect_debug_sleep(redisContext *c) {
-    int detected;
-    redisReply *reply = redisCommand(c, "DEBUG SLEEP 0\r\n");
-
-    if (reply == NULL || c->err) {
-        const char *cause = c->err ? c->errstr : "(none)";
-        fprintf(stderr, "Error testing for DEBUG SLEEP (Redis error: %s), exiting\n", cause);
-        exit(-1);
-    }
-
-    detected = reply->type == REDIS_REPLY_STATUS;
-    freeReplyObject(reply);
-
-    return detected;
-}
-
-static void test_blocking_connection_timeouts(struct config config) {
-    redisContext *c;
-    redisReply *reply;
-    ssize_t s;
-    const char *sleep_cmd = "DEBUG SLEEP 3\r\n";
-    struct timeval tv;
-
-    c = do_connect(config);
-    test("Successfully completes a command when the timeout is not exceeded: ");
-    reply = redisCommand(c,"SET foo fast");
-    freeReplyObject(reply);
-    tv.tv_sec = 0;
-    tv.tv_usec = 10000;
-    redisSetTimeout(c, tv);
-    reply = redisCommand(c, "GET foo");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STRING && memcmp(reply->str, "fast", 4) == 0);
-    freeReplyObject(reply);
-    disconnect(c, 0);
-
-    c = do_connect(config);
-    test("Does not return a reply when the command times out: ");
-    if (detect_debug_sleep(c)) {
-        redisAppendFormattedCommand(c, sleep_cmd, strlen(sleep_cmd));
-        s = c->funcs->write(c);
-        tv.tv_sec = 0;
-        tv.tv_usec = 10000;
-        redisSetTimeout(c, tv);
-        reply = redisCommand(c, "GET foo");
-#ifndef _WIN32
-        test_cond(s > 0 && reply == NULL && c->err == REDIS_ERR_IO &&
-                  strcmp(c->errstr, "Resource temporarily unavailable") == 0);
-#else
-        test_cond(s > 0 && reply == NULL && c->err == REDIS_ERR_TIMEOUT &&
-                  strcmp(c->errstr, "recv timeout") == 0);
-#endif
-        freeReplyObject(reply);
-    } else {
-        test_skipped();
-    }
-
-    test("Reconnect properly reconnects after a timeout: ");
-    do_reconnect(c, config);
-    reply = redisCommand(c, "PING");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && strcmp(reply->str, "PONG") == 0);
-    freeReplyObject(reply);
-
-    test("Reconnect properly uses owned parameters: ");
-    config.tcp.host = "foo";
-    config.unix_sock.path = "foo";
-    do_reconnect(c, config);
-    reply = redisCommand(c, "PING");
-    test_cond(reply != NULL && reply->type == REDIS_REPLY_STATUS && strcmp(reply->str, "PONG") == 0);
-    freeReplyObject(reply);
-
-    disconnect(c, 0);
-}
-
-static void test_blocking_io_errors(struct config config) {
-    redisContext *c;
-    redisReply *reply;
-    void *_reply;
-    int major, minor;
-
-    /* Connect to target given by config. */
-    c = do_connect(config);
-    get_redis_version(c, &major, &minor);
-
-    test("Returns I/O error when the connection is lost: ");
-    reply = redisCommand(c,"QUIT");
-    if (major > 2 || (major == 2 && minor > 0)) {
-        /* > 2.0 returns OK on QUIT and read() should be issued once more
-         * to know the descriptor is at EOF. */
-        test_cond(strcasecmp(reply->str,"OK") == 0 &&
-            redisGetReply(c,&_reply) == REDIS_ERR);
-        freeReplyObject(reply);
-    } else {
-        test_cond(reply == NULL);
-    }
-
-#ifndef _WIN32
-    /* On 2.0, QUIT will cause the connection to be closed immediately and
-     * the read(2) for the reply on QUIT will set the error to EOF.
-     * On >2.0, QUIT will return with OK and another read(2) needed to be
-     * issued to find out the socket was closed by the server. In both
-     * conditions, the error will be set to EOF. */
-    assert(c->err == REDIS_ERR_EOF &&
-        strcmp(c->errstr,"Server closed the connection") == 0);
-#endif
-    redisFree(c);
-
-    c = do_connect(config);
-    test("Returns I/O error on socket timeout: ");
-    struct timeval tv = { 0, 1000 };
-    assert(redisSetTimeout(c,tv) == REDIS_OK);
-    int respcode = redisGetReply(c,&_reply);
-#ifndef _WIN32
-    test_cond(respcode == REDIS_ERR && c->err == REDIS_ERR_IO && errno == EAGAIN);
-#else
-    test_cond(respcode == REDIS_ERR && c->err == REDIS_ERR_TIMEOUT);
-#endif
-    redisFree(c);
-}
-
-static void test_invalid_timeout_errors(struct config config) {
-    redisContext *c;
-
-    test("Set error when an invalid timeout usec value is given to redisConnectWithTimeout: ");
-
-    config.tcp.timeout.tv_sec = 0;
-    config.tcp.timeout.tv_usec = 10000001;
-
-    c = redisConnectWithTimeout(config.tcp.host, config.tcp.port, config.tcp.timeout);
-
-    test_cond(c->err == REDIS_ERR_IO && strcmp(c->errstr, "Invalid timeout specified") == 0);
-    redisFree(c);
-
-    test("Set error when an invalid timeout sec value is given to redisConnectWithTimeout: ");
-
-    config.tcp.timeout.tv_sec = (((LONG_MAX) - 999) / 1000) + 1;
-    config.tcp.timeout.tv_usec = 0;
-
-    c = redisConnectWithTimeout(config.tcp.host, config.tcp.port, config.tcp.timeout);
-
-    test_cond(c->err == REDIS_ERR_IO && strcmp(c->errstr, "Invalid timeout specified") == 0);
-    redisFree(c);
-}
-
-/* Wrap malloc to abort on failure so OOM checks don't make the test logic
- * harder to follow. */
-void *hi_malloc_safe(size_t size) {
-    void *ptr = hi_malloc(size);
-    if (ptr == NULL) {
-        fprintf(stderr, "Error:  Out of memory\n");
-        exit(-1);
-    }
-
-    return ptr;
-}
-
-static void test_throughput(struct config config) {
-    redisContext *c = do_connect(config);
-    redisReply **replies;
-    int i, num;
-    long long t1, t2;
-
-    test("Throughput:\n");
-    for (i = 0; i < 500; i++)
-        freeReplyObject(redisCommand(c,"LPUSH mylist foo"));
-
-    num = 1000;
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        replies[i] = redisCommand(c,"PING");
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_STATUS);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx PING: %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        replies[i] = redisCommand(c,"LRANGE mylist 0 499");
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_ARRAY);
-        assert(replies[i] != NULL && replies[i]->elements == 500);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx LRANGE with 500 elements: %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        replies[i] = redisCommand(c, "INCRBY incrkey %d", 1000000);
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_INTEGER);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx INCRBY: %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    num = 10000;
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    for (i = 0; i < num; i++)
-        redisAppendCommand(c,"PING");
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_STATUS);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx PING (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    for (i = 0; i < num; i++)
-        redisAppendCommand(c,"LRANGE mylist 0 499");
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_ARRAY);
-        assert(replies[i] != NULL && replies[i]->elements == 500);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx LRANGE with 500 elements (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    replies = hi_malloc_safe(sizeof(redisReply*)*num);
-    for (i = 0; i < num; i++)
-        redisAppendCommand(c,"INCRBY incrkey %d", 1000000);
-    t1 = usec();
-    for (i = 0; i < num; i++) {
-        assert(redisGetReply(c, (void*)&replies[i]) == REDIS_OK);
-        assert(replies[i] != NULL && replies[i]->type == REDIS_REPLY_INTEGER);
-    }
-    t2 = usec();
-    for (i = 0; i < num; i++) freeReplyObject(replies[i]);
-    hi_free(replies);
-    printf("\t(%dx INCRBY (pipelined): %.3fs)\n", num, (t2-t1)/1000000.0);
-
-    disconnect(c, 0);
-}
-
-// static long __test_callback_flags = 0;
-// static void __test_callback(redisContext *c, void *privdata) {
-//     ((void)c);
-//     /* Shift to detect execution order */
-//     __test_callback_flags <<= 8;
-//     __test_callback_flags |= (long)privdata;
-// }
-//
-// static void __test_reply_callback(redisContext *c, redisReply *reply, void *privdata) {
-//     ((void)c);
-//     /* Shift to detect execution order */
-//     __test_callback_flags <<= 8;
-//     __test_callback_flags |= (long)privdata;
-//     if (reply) freeReplyObject(reply);
-// }
-//
-// static redisContext *__connect_nonblock() {
-//     /* Reset callback flags */
-//     __test_callback_flags = 0;
-//     return redisConnectNonBlock("127.0.0.1", port, NULL);
-// }
-//
-// static void test_nonblocking_connection() {
-//     redisContext *c;
-//     int wdone = 0;
-//
-//     test("Calls command callback when command is issued: ");
-//     c = __connect_nonblock();
-//     redisSetCommandCallback(c,__test_callback,(void*)1);
-//     redisCommand(c,"PING");
-//     test_cond(__test_callback_flags == 1);
-//     redisFree(c);
-//
-//     test("Calls disconnect callback on redisDisconnect: ");
-//     c = __connect_nonblock();
-//     redisSetDisconnectCallback(c,__test_callback,(void*)2);
-//     redisDisconnect(c);
-//     test_cond(__test_callback_flags == 2);
-//     redisFree(c);
-//
-//     test("Calls disconnect callback and free callback on redisFree: ");
-//     c = __connect_nonblock();
-//     redisSetDisconnectCallback(c,__test_callback,(void*)2);
-//     redisSetFreeCallback(c,__test_callback,(void*)4);
-//     redisFree(c);
-//     test_cond(__test_callback_flags == ((2 << 8) | 4));
-//
-//     test("redisBufferWrite against empty write buffer: ");
-//     c = __connect_nonblock();
-//     test_cond(redisBufferWrite(c,&wdone) == REDIS_OK && wdone == 1);
-//     redisFree(c);
-//
-//     test("redisBufferWrite against not yet connected fd: ");
-//     c = __connect_nonblock();
-//     redisCommand(c,"PING");
-//     test_cond(redisBufferWrite(c,NULL) == REDIS_ERR &&
-//               strncmp(c->error,"write:",6) == 0);
-//     redisFree(c);
-//
-//     test("redisBufferWrite against closed fd: ");
-//     c = __connect_nonblock();
-//     redisCommand(c,"PING");
-//     redisDisconnect(c);
-//     test_cond(redisBufferWrite(c,NULL) == REDIS_ERR &&
-//               strncmp(c->error,"write:",6) == 0);
-//     redisFree(c);
-//
-//     test("Process callbacks in the right sequence: ");
-//     c = __connect_nonblock();
-//     redisCommandWithCallback(c,__test_reply_callback,(void*)1,"PING");
-//     redisCommandWithCallback(c,__test_reply_callback,(void*)2,"PING");
-//     redisCommandWithCallback(c,__test_reply_callback,(void*)3,"PING");
-//
-//     /* Write output buffer */
-//     wdone = 0;
-//     while(!wdone) {
-//         usleep(500);
-//         redisBufferWrite(c,&wdone);
-//     }
-//
-//     /* Read until at least one callback is executed (the 3 replies will
-//      * arrive in a single packet, causing all callbacks to be executed in
-//      * a single pass). */
-//     while(__test_callback_flags == 0) {
-//         assert(redisBufferRead(c) == REDIS_OK);
-//         redisProcessCallbacks(c);
-//     }
-//     test_cond(__test_callback_flags == 0x010203);
-//     redisFree(c);
-//
-//     test("redisDisconnect executes pending callbacks with NULL reply: ");
-//     c = __connect_nonblock();
-//     redisSetDisconnectCallback(c,__test_callback,(void*)1);
-//     redisCommandWithCallback(c,__test_reply_callback,(void*)2,"PING");
-//     redisDisconnect(c);
-//     test_cond(__test_callback_flags == 0x0201);
-//     redisFree(c);
-// }
-
-int main(int argc, char **argv) {
-    struct config cfg = {
-        .tcp = {
-            .host = "127.0.0.1",
-            .port = 6379
-        },
-        .unix_sock = {
-            .path = "/tmp/redis.sock"
-        }
-    };
-    int throughput = 1;
-    int test_inherit_fd = 1;
-    int skips_as_fails = 0;
-    int test_unix_socket;
-
-    /* Parse command line options. */
-    argv++; argc--;
-    while (argc) {
-        if (argc >= 2 && !strcmp(argv[0],"-h")) {
-            argv++; argc--;
-            cfg.tcp.host = argv[0];
-        } else if (argc >= 2 && !strcmp(argv[0],"-p")) {
-            argv++; argc--;
-            cfg.tcp.port = atoi(argv[0]);
-        } else if (argc >= 2 && !strcmp(argv[0],"-s")) {
-            argv++; argc--;
-            cfg.unix_sock.path = argv[0];
-        } else if (argc >= 1 && !strcmp(argv[0],"--skip-throughput")) {
-            throughput = 0;
-        } else if (argc >= 1 && !strcmp(argv[0],"--skip-inherit-fd")) {
-            test_inherit_fd = 0;
-        } else if (argc >= 1 && !strcmp(argv[0],"--skips-as-fails")) {
-            skips_as_fails = 1;
-#ifdef HIREDIS_TEST_SSL
-        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-port")) {
-            argv++; argc--;
-            cfg.ssl.port = atoi(argv[0]);
-        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-host")) {
-            argv++; argc--;
-            cfg.ssl.host = argv[0];
-        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-ca-cert")) {
-            argv++; argc--;
-            cfg.ssl.ca_cert  = argv[0];
-        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-cert")) {
-            argv++; argc--;
-            cfg.ssl.cert = argv[0];
-        } else if (argc >= 2 && !strcmp(argv[0],"--ssl-key")) {
-            argv++; argc--;
-            cfg.ssl.key = argv[0];
-#endif
-        } else {
-            fprintf(stderr, "Invalid argument: %s\n", argv[0]);
-            exit(1);
-        }
-        argv++; argc--;
-    }
-
-#ifndef _WIN32
-    /* Ignore broken pipe signal (for I/O error tests). */
-    signal(SIGPIPE, SIG_IGN);
-
-    test_unix_socket = access(cfg.unix_sock.path, F_OK) == 0;
-
-#else
-    /* Unix sockets don't exist in Windows */
-    test_unix_socket = 0;
-#endif
-
-    test_allocator_injection();
-
-    test_format_commands();
-    test_reply_reader();
-    test_blocking_connection_errors();
-    test_free_null();
-
-    printf("\nTesting against TCP connection (%s:%d):\n", cfg.tcp.host, cfg.tcp.port);
-    cfg.type = CONN_TCP;
-    test_blocking_connection(cfg);
-    test_blocking_connection_timeouts(cfg);
-    test_blocking_io_errors(cfg);
-    test_invalid_timeout_errors(cfg);
-    test_append_formatted_commands(cfg);
-    if (throughput) test_throughput(cfg);
-
-    printf("\nTesting against Unix socket connection (%s): ", cfg.unix_sock.path);
-    if (test_unix_socket) {
-        printf("\n");
-        cfg.type = CONN_UNIX;
-        test_blocking_connection(cfg);
-        test_blocking_connection_timeouts(cfg);
-        test_blocking_io_errors(cfg);
-        if (throughput) test_throughput(cfg);
-    } else {
-        test_skipped();
-    }
-
-#ifdef HIREDIS_TEST_SSL
-    if (cfg.ssl.port && cfg.ssl.host) {
-
-        redisInitOpenSSL();
-        _ssl_ctx = redisCreateSSLContext(cfg.ssl.ca_cert, NULL, cfg.ssl.cert, cfg.ssl.key, NULL, NULL);
-        assert(_ssl_ctx != NULL);
-
-        printf("\nTesting against SSL connection (%s:%d):\n", cfg.ssl.host, cfg.ssl.port);
-        cfg.type = CONN_SSL;
-
-        test_blocking_connection(cfg);
-        test_blocking_connection_timeouts(cfg);
-        test_blocking_io_errors(cfg);
-        test_invalid_timeout_errors(cfg);
-        test_append_formatted_commands(cfg);
-        if (throughput) test_throughput(cfg);
-
-        redisFreeSSLContext(_ssl_ctx);
-        _ssl_ctx = NULL;
-    }
-#endif
-
-    if (test_inherit_fd) {
-        printf("\nTesting against inherited fd (%s): ", cfg.unix_sock.path);
-        if (test_unix_socket) {
-            printf("\n");
-            cfg.type = CONN_FD;
-            test_blocking_connection(cfg);
-        } else {
-            test_skipped();
-        }
-    }
-
-    if (fails || (skips_as_fails && skips)) {
-        printf("*** %d TESTS FAILED ***\n", fails);
-        if (skips) {
-            printf("*** %d TESTS SKIPPED ***\n", skips);
-        }
-        return 1;
-    }
-
-    printf("ALL TESTS PASSED (%d skipped)\n", skips);
-    return 0;
-}
diff --git a/redis-stable/deps/hiredis/test.sh b/redis-stable/deps/hiredis/test.sh
deleted file mode 100755
index c72bcb0d..00000000
--- a/redis-stable/deps/hiredis/test.sh
+++ /dev/null
@@ -1,78 +0,0 @@
-#!/bin/sh -ue
-
-REDIS_SERVER=${REDIS_SERVER:-redis-server}
-REDIS_PORT=${REDIS_PORT:-56379}
-REDIS_SSL_PORT=${REDIS_SSL_PORT:-56443}
-TEST_SSL=${TEST_SSL:-0}
-SKIPS_AS_FAILS=${SKIPS_AS_FAILS-:0}
-SSL_TEST_ARGS=
-SKIPS_ARG=
-
-tmpdir=$(mktemp -d)
-PID_FILE=${tmpdir}/hiredis-test-redis.pid
-SOCK_FILE=${tmpdir}/hiredis-test-redis.sock
-
-if [ "$TEST_SSL" = "1" ]; then
-    SSL_CA_CERT=${tmpdir}/ca.crt
-    SSL_CA_KEY=${tmpdir}/ca.key
-    SSL_CERT=${tmpdir}/redis.crt
-    SSL_KEY=${tmpdir}/redis.key
-
-    openssl genrsa -out ${tmpdir}/ca.key 4096
-    openssl req \
-        -x509 -new -nodes -sha256 \
-        -key ${SSL_CA_KEY} \
-        -days 3650 \
-        -subj '/CN=Hiredis Test CA' \
-        -out ${SSL_CA_CERT}
-    openssl genrsa -out ${SSL_KEY} 2048
-    openssl req \
-        -new -sha256 \
-        -key ${SSL_KEY} \
-        -subj '/CN=Hiredis Test Cert' | \
-        openssl x509 \
-            -req -sha256 \
-            -CA ${SSL_CA_CERT} \
-            -CAkey ${SSL_CA_KEY} \
-            -CAserial ${tmpdir}/ca.txt \
-            -CAcreateserial \
-            -days 365 \
-            -out ${SSL_CERT}
-
-    SSL_TEST_ARGS="--ssl-host 127.0.0.1 --ssl-port ${REDIS_SSL_PORT} --ssl-ca-cert ${SSL_CA_CERT} --ssl-cert ${SSL_CERT} --ssl-key ${SSL_KEY}"
-fi
-
-cleanup() {
-  set +e
-  kill $(cat ${PID_FILE})
-  rm -rf ${tmpdir}
-}
-trap cleanup INT TERM EXIT
-
-cat > ${tmpdir}/redis.conf <<EOF
-daemonize yes
-pidfile ${PID_FILE}
-port ${REDIS_PORT}
-bind 127.0.0.1
-unixsocket ${SOCK_FILE}
-EOF
-
-if [ "$TEST_SSL" = "1" ]; then
-    cat >> ${tmpdir}/redis.conf <<EOF
-tls-port ${REDIS_SSL_PORT}
-tls-ca-cert-file ${SSL_CA_CERT}
-tls-cert-file ${SSL_CERT}
-tls-key-file ${SSL_KEY}
-EOF
-fi
-
-cat ${tmpdir}/redis.conf
-${REDIS_SERVER} ${tmpdir}/redis.conf
-
-# Wait until we detect the unix socket
-while [ ! -S "${SOCK_FILE}" ]; do sleep 1; done
-
-# Treat skips as failures if directed
-[ "$SKIPS_AS_FAILS" = 1 ] && SKIPS_ARG="--skips-as-fails"
-
-${TEST_PREFIX:-} ./hiredis-test -h 127.0.0.1 -p ${REDIS_PORT} -s ${SOCK_FILE} ${SSL_TEST_ARGS} ${SKIPS_ARG}
diff --git a/redis-stable/deps/hiredis/win32.h b/redis-stable/deps/hiredis/win32.h
deleted file mode 100644
index 04289c69..00000000
--- a/redis-stable/deps/hiredis/win32.h
+++ /dev/null
@@ -1,56 +0,0 @@
-#ifndef _WIN32_HELPER_INCLUDE
-#define _WIN32_HELPER_INCLUDE
-#ifdef _MSC_VER
-
-#include <winsock2.h> /* for struct timeval */
-
-#ifndef inline
-#define inline __inline
-#endif
-
-#ifndef strcasecmp
-#define strcasecmp stricmp
-#endif
-
-#ifndef strncasecmp
-#define strncasecmp strnicmp
-#endif
-
-#ifndef va_copy
-#define va_copy(d,s) ((d) = (s))
-#endif
-
-#ifndef snprintf
-#define snprintf c99_snprintf
-
-__inline int c99_vsnprintf(char* str, size_t size, const char* format, va_list ap)
-{
-    int count = -1;
-
-    if (size != 0)
-        count = _vsnprintf_s(str, size, _TRUNCATE, format, ap);
-    if (count == -1)
-        count = _vscprintf(format, ap);
-
-    return count;
-}
-
-__inline int c99_snprintf(char* str, size_t size, const char* format, ...)
-{
-    int count;
-    va_list ap;
-
-    va_start(ap, format);
-    count = c99_vsnprintf(str, size, format, ap);
-    va_end(ap);
-
-    return count;
-}
-#endif
-#endif /* _MSC_VER */
-
-#ifdef _WIN32
-#define strerror_r(errno,buf,len) strerror_s(buf,len,errno)
-#endif /* _WIN32 */
-
-#endif /* _WIN32_HELPER_INCLUDE */
diff --git a/redis-stable/deps/jemalloc/.appveyor.yml b/redis-stable/deps/jemalloc/.appveyor.yml
deleted file mode 100644
index 9a7d00a9..00000000
--- a/redis-stable/deps/jemalloc/.appveyor.yml
+++ /dev/null
@@ -1,42 +0,0 @@
-version: '{build}'
-
-environment:
-  matrix:
-  - MSYSTEM: MINGW64
-    CPU: x86_64
-    MSVC: amd64
-  - MSYSTEM: MINGW32
-    CPU: i686
-    MSVC: x86
-  - MSYSTEM: MINGW64
-    CPU: x86_64
-  - MSYSTEM: MINGW32
-    CPU: i686
-  - MSYSTEM: MINGW64
-    CPU: x86_64
-    MSVC: amd64
-    CONFIG_FLAGS: --enable-debug
-  - MSYSTEM: MINGW32
-    CPU: i686
-    MSVC: x86
-    CONFIG_FLAGS: --enable-debug
-  - MSYSTEM: MINGW64
-    CPU: x86_64
-    CONFIG_FLAGS: --enable-debug
-  - MSYSTEM: MINGW32
-    CPU: i686
-    CONFIG_FLAGS: --enable-debug
-
-install:
-  - set PATH=c:\msys64\%MSYSTEM%\bin;c:\msys64\usr\bin;%PATH%
-  - if defined MSVC call "c:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\vcvarsall.bat" %MSVC%
-  - if defined MSVC pacman --noconfirm -Rsc mingw-w64-%CPU%-gcc gcc
-  - pacman --noconfirm -Suy mingw-w64-%CPU%-make
-
-build_script:
-  - bash -c "autoconf"
-  - bash -c "./configure $CONFIG_FLAGS"
-  - mingw32-make
-  - file lib/jemalloc.dll
-  - mingw32-make tests
-  - mingw32-make -k check
diff --git a/redis-stable/deps/jemalloc/.autom4te.cfg b/redis-stable/deps/jemalloc/.autom4te.cfg
deleted file mode 100644
index fe2424db..00000000
--- a/redis-stable/deps/jemalloc/.autom4te.cfg
+++ /dev/null
@@ -1,3 +0,0 @@
-begin-language: "Autoconf-without-aclocal-m4"
-args: --no-cache
-end-language: "Autoconf-without-aclocal-m4"
diff --git a/redis-stable/deps/jemalloc/.gitattributes b/redis-stable/deps/jemalloc/.gitattributes
deleted file mode 100644
index 6313b56c..00000000
--- a/redis-stable/deps/jemalloc/.gitattributes
+++ /dev/null
@@ -1 +0,0 @@
-* text=auto eol=lf
diff --git a/redis-stable/deps/jemalloc/.gitignore b/redis-stable/deps/jemalloc/.gitignore
deleted file mode 100644
index 19199ccb..00000000
--- a/redis-stable/deps/jemalloc/.gitignore
+++ /dev/null
@@ -1,93 +0,0 @@
-/bin/jemalloc-config
-/bin/jemalloc.sh
-/bin/jeprof
-
-/config.stamp
-/config.log
-/config.status
-/configure
-
-/doc/html.xsl
-/doc/manpages.xsl
-/doc/jemalloc.xml
-/doc/jemalloc.html
-/doc/jemalloc.3
-
-/jemalloc.pc
-
-/lib/
-
-/Makefile
-
-/include/jemalloc/internal/jemalloc_preamble.h
-/include/jemalloc/internal/jemalloc_internal_defs.h
-/include/jemalloc/internal/private_namespace.gen.h
-/include/jemalloc/internal/private_namespace.h
-/include/jemalloc/internal/private_namespace_jet.gen.h
-/include/jemalloc/internal/private_namespace_jet.h
-/include/jemalloc/internal/private_symbols.awk
-/include/jemalloc/internal/private_symbols_jet.awk
-/include/jemalloc/internal/public_namespace.h
-/include/jemalloc/internal/public_symbols.txt
-/include/jemalloc/internal/public_unnamespace.h
-/include/jemalloc/internal/size_classes.h
-/include/jemalloc/jemalloc.h
-/include/jemalloc/jemalloc_defs.h
-/include/jemalloc/jemalloc_macros.h
-/include/jemalloc/jemalloc_mangle.h
-/include/jemalloc/jemalloc_mangle_jet.h
-/include/jemalloc/jemalloc_protos.h
-/include/jemalloc/jemalloc_protos_jet.h
-/include/jemalloc/jemalloc_rename.h
-/include/jemalloc/jemalloc_typedefs.h
-
-/src/*.[od]
-/src/*.sym
-
-/run_tests.out/
-
-/test/test.sh
-test/include/test/jemalloc_test.h
-test/include/test/jemalloc_test_defs.h
-
-/test/integration/[A-Za-z]*
-!/test/integration/[A-Za-z]*.*
-/test/integration/*.[od]
-/test/integration/*.out
-
-/test/integration/cpp/[A-Za-z]*
-!/test/integration/cpp/[A-Za-z]*.*
-/test/integration/cpp/*.[od]
-/test/integration/cpp/*.out
-
-/test/src/*.[od]
-
-/test/stress/[A-Za-z]*
-!/test/stress/[A-Za-z]*.*
-/test/stress/*.[od]
-/test/stress/*.out
-
-/test/unit/[A-Za-z]*
-!/test/unit/[A-Za-z]*.*
-/test/unit/*.[od]
-/test/unit/*.out
-
-/VERSION
-
-*.pdb
-*.sdf
-*.opendb
-*.VC.db
-*.opensdf
-*.cachefile
-*.suo
-*.user
-*.sln.docstates
-*.tmp
-.vs/
-/msvc/Win32/
-/msvc/x64/
-/msvc/projects/*/*/Debug*/
-/msvc/projects/*/*/Release*/
-/msvc/projects/*/*/Win32/
-/msvc/projects/*/*/x64/
diff --git a/redis-stable/deps/jemalloc/.travis.yml b/redis-stable/deps/jemalloc/.travis.yml
deleted file mode 100644
index 4cc116e5..00000000
--- a/redis-stable/deps/jemalloc/.travis.yml
+++ /dev/null
@@ -1,156 +0,0 @@
-language: generic
-dist: precise
-
-matrix:
-  include:
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: osx
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--enable-debug" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="--with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-      addons:
-        apt:
-          packages:
-            - gcc-multilib
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --enable-prof" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-debug --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --disable-stats" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--enable-prof --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=tcache:false" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--disable-stats --with-malloc-conf=background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,dss:primary" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=tcache:false,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary,percpu_arena:percpu" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=dss:primary,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-    - os: linux
-      env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="--with-malloc-conf=percpu_arena:percpu,background_thread:true" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
-
-
-before_script:
-  - autoconf
-  - ./configure ${COMPILER_FLAGS:+       CC="$CC $COMPILER_FLAGS"       CXX="$CXX $COMPILER_FLAGS" }       $CONFIGURE_FLAGS
-  - make -j3
-  - make -j3 tests
-
-script:
-  - make check
-
diff --git a/redis-stable/deps/jemalloc/COPYING b/redis-stable/deps/jemalloc/COPYING
deleted file mode 100644
index 98458d97..00000000
--- a/redis-stable/deps/jemalloc/COPYING
+++ /dev/null
@@ -1,27 +0,0 @@
-Unless otherwise specified, files in the jemalloc source distribution are
-subject to the following license:
---------------------------------------------------------------------------------
-Copyright (C) 2002-2018 Jason Evans <jasone@canonware.com>.
-All rights reserved.
-Copyright (C) 2007-2012 Mozilla Foundation.  All rights reserved.
-Copyright (C) 2009-2018 Facebook, Inc.  All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-1. Redistributions of source code must retain the above copyright notice(s),
-   this list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the above copyright notice(s),
-   this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS
-OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
-EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
-OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------------------
diff --git a/redis-stable/deps/jemalloc/ChangeLog b/redis-stable/deps/jemalloc/ChangeLog
deleted file mode 100644
index 29a00fb7..00000000
--- a/redis-stable/deps/jemalloc/ChangeLog
+++ /dev/null
@@ -1,1382 +0,0 @@
-Following are change highlights associated with official releases.  Important
-bug fixes are all mentioned, but some internal enhancements are omitted here for
-brevity.  Much more detail can be found in the git revision history:
-
-    https://github.com/jemalloc/jemalloc
-
-* 5.1.0 (May 4th, 2018)
-
-  This release is primarily about fine-tuning, ranging from several new features
-  to numerous notable performance and portability enhancements.  The release and
-  prior dev versions have been running in multiple large scale applications for
-  months, and the cumulative improvements are substantial in many cases.
-
-  Given the long and successful production runs, this release is likely a good
-  candidate for applications to upgrade, from both jemalloc 5.0 and before.  For
-  performance-critical applications, the newly added TUNING.md provides
-  guidelines on jemalloc tuning.
-
-  New features:
-  - Implement transparent huge page support for internal metadata.  (@interwq)
-  - Add opt.thp to allow enabling / disabling transparent huge pages for all
-    mappings.  (@interwq)
-  - Add maximum background thread count option.  (@djwatson)
-  - Allow prof_active to control opt.lg_prof_interval and prof.gdump.
-    (@interwq)
-  - Allow arena index lookup based on allocation addresses via mallctl.
-    (@lionkov)
-  - Allow disabling initial-exec TLS model.  (@davidtgoldblatt, @KenMacD)
-  - Add opt.lg_extent_max_active_fit to set the max ratio between the size of
-    the active extent selected (to split off from) and the size of the requested
-    allocation.  (@interwq, @davidtgoldblatt)
-  - Add retain_grow_limit to set the max size when growing virtual address
-    space.  (@interwq)
-  - Add mallctl interfaces:
-    + arena.<i>.retain_grow_limit  (@interwq)
-    + arenas.lookup  (@lionkov)
-    + max_background_threads  (@djwatson)
-    + opt.lg_extent_max_active_fit  (@interwq)
-    + opt.max_background_threads  (@djwatson)
-    + opt.metadata_thp  (@interwq)
-    + opt.thp  (@interwq)
-    + stats.metadata_thp  (@interwq)
-
-  Portability improvements:
-  - Support GNU/kFreeBSD configuration.  (@paravoid)
-  - Support m68k, nios2 and SH3 architectures.  (@paravoid)
-  - Fall back to FD_CLOEXEC when O_CLOEXEC is unavailable.  (@zonyitoo)
-  - Fix symbol listing for cross-compiling.  (@tamird)
-  - Fix high bits computation on ARM.  (@davidtgoldblatt, @paravoid)
-  - Disable the CPU_SPINWAIT macro for Power.  (@davidtgoldblatt, @marxin)
-  - Fix MSVC 2015 & 2017 builds.  (@rustyx)
-  - Improve RISC-V support.  (@EdSchouten)
-  - Set name mangling script in strict mode.  (@nicolov)
-  - Avoid MADV_HUGEPAGE on ARM.  (@marxin)
-  - Modify configure to determine return value of strerror_r.
-    (@davidtgoldblatt, @cferris1000)
-  - Make sure CXXFLAGS is tested with CPP compiler.  (@nehaljwani)
-  - Fix 32-bit build on MSVC.  (@rustyx)
-  - Fix external symbol on MSVC.  (@maksqwe)
-  - Avoid a printf format specifier warning.  (@jasone)
-  - Add configure option --disable-initial-exec-tls which can allow jemalloc to
-    be dynamically loaded after program startup.  (@davidtgoldblatt, @KenMacD)
-  - AArch64: Add ILP32 support.  (@cmuellner)
-  - Add --with-lg-vaddr configure option to support cross compiling.
-    (@cmuellner, @davidtgoldblatt)
-
-  Optimizations and refactors:
-  - Improve active extent fit with extent_max_active_fit.  This considerably
-    reduces fragmentation over time and improves virtual memory and metadata
-    usage.  (@davidtgoldblatt, @interwq)
-  - Eagerly coalesce large extents to reduce fragmentation.  (@interwq)
-  - sdallocx: only read size info when page aligned (i.e. possibly sampled),
-    which speeds up the sized deallocation path significantly.  (@interwq)
-  - Avoid attempting new mappings for in place expansion with retain, since
-    it rarely succeeds in practice and causes high overhead.  (@interwq)
-  - Refactor OOM handling in newImpl.  (@wqfish)
-  - Add internal fine-grained logging functionality for debugging use.
-    (@davidtgoldblatt)
-  - Refactor arena / tcache interactions.  (@davidtgoldblatt)
-  - Refactor extent management with dumpable flag.  (@davidtgoldblatt)
-  - Add runtime detection of lazy purging.  (@interwq)
-  - Use pairing heap instead of red-black tree for extents_avail.  (@djwatson)
-  - Use sysctl on startup in FreeBSD.  (@trasz)
-  - Use thread local prng state instead of atomic.  (@djwatson)
-  - Make decay to always purge one more extent than before, because in
-    practice large extents are usually the ones that cross the decay threshold.
-    Purging the additional extent helps save memory as well as reduce VM
-    fragmentation.  (@interwq)
-  - Fast division by dynamic values.  (@davidtgoldblatt)
-  - Improve the fit for aligned allocation.  (@interwq, @edwinsmith)
-  - Refactor extent_t bitpacking.  (@rkmisra)
-  - Optimize the generated assembly for ticker operations.  (@davidtgoldblatt)
-  - Convert stats printing to use a structured text emitter.  (@davidtgoldblatt)
-  - Remove preserve_lru feature for extents management.  (@djwatson)
-  - Consolidate two memory loads into one on the fast deallocation path.
-    (@davidtgoldblatt, @interwq)
-
-  Bug fixes (most of the issues are only relevant to jemalloc 5.0):
-  - Fix deadlock with multithreaded fork in OS X.  (@davidtgoldblatt)
-  - Validate returned file descriptor before use.  (@zonyitoo)
-  - Fix a few background thread initialization and shutdown issues.  (@interwq)
-  - Fix an extent coalesce + decay race by taking both coalescing extents off
-    the LRU list.  (@interwq)
-  - Fix potentially unbound increase during decay, caused by one thread keep
-    stashing memory to purge while other threads generating new pages.  The
-    number of pages to purge is checked to prevent this.  (@interwq)
-  - Fix a FreeBSD bootstrap assertion.  (@strejda, @interwq)
-  - Handle 32 bit mutex counters.  (@rkmisra)
-  - Fix a indexing bug when creating background threads.  (@davidtgoldblatt,
-    @binliu19)
-  - Fix arguments passed to extent_init.  (@yuleniwo, @interwq)
-  - Fix addresses used for ordering mutexes.  (@rkmisra)
-  - Fix abort_conf processing during bootstrap.  (@interwq)
-  - Fix include path order for out-of-tree builds.  (@cmuellner)
-
-  Incompatible changes:
-  - Remove --disable-thp.  (@interwq)
-  - Remove mallctl interfaces:
-    + config.thp  (@interwq)
-
-  Documentation:
-  - Add TUNING.md.  (@interwq, @davidtgoldblatt, @djwatson)
-
-* 5.0.1 (July 1, 2017)
-
-  This bugfix release fixes several issues, most of which are obscure enough
-  that typical applications are not impacted.
-
-  Bug fixes:
-  - Update decay->nunpurged before purging, in order to avoid potential update
-    races and subsequent incorrect purging volume.  (@interwq)
-  - Only abort on dlsym(3) error if the failure impacts an enabled feature (lazy
-    locking and/or background threads).  This mitigates an initialization
-    failure bug for which we still do not have a clear reproduction test case.
-    (@interwq)
-  - Modify tsd management so that it neither crashes nor leaks if a thread's
-    only allocation activity is to call free() after TLS destructors have been
-    executed.  This behavior was observed when operating with GNU libc, and is
-    unlikely to be an issue with other libc implementations.  (@interwq)
-  - Mask signals during background thread creation.  This prevents signals from
-    being inadvertently delivered to background threads.  (@jasone,
-    @davidtgoldblatt, @interwq)
-  - Avoid inactivity checks within background threads, in order to prevent
-    recursive mutex acquisition.  (@interwq)
-  - Fix extent_grow_retained() to use the specified hooks when the
-    arena.<i>.extent_hooks mallctl is used to override the default hooks.
-    (@interwq)
-  - Add missing reentrancy support for custom extent hooks which allocate.
-    (@interwq)
-  - Post-fork(2), re-initialize the list of tcaches associated with each arena
-    to contain no tcaches except the forking thread's.  (@interwq)
-  - Add missing post-fork(2) mutex reinitialization for extent_grow_mtx.  This
-    fixes potential deadlocks after fork(2).  (@interwq)
-  - Enforce minimum autoconf version (currently 2.68), since 2.63 is known to
-    generate corrupt configure scripts.  (@jasone)
-  - Ensure that the configured page size (--with-lg-page) is no larger than the
-    configured huge page size (--with-lg-hugepage).  (@jasone)
-
-* 5.0.0 (June 13, 2017)
-
-  Unlike all previous jemalloc releases, this release does not use naturally
-  aligned "chunks" for virtual memory management, and instead uses page-aligned
-  "extents".  This change has few externally visible effects, but the internal
-  impacts are... extensive.  Many other internal changes combine to make this
-  the most cohesively designed version of jemalloc so far, with ample
-  opportunity for further enhancements.
-
-  Continuous integration is now an integral aspect of development thanks to the
-  efforts of @davidtgoldblatt, and the dev branch tends to remain reasonably
-  stable on the tested platforms (Linux, FreeBSD, macOS, and Windows).  As a
-  side effect the official release frequency may decrease over time.
-
-  New features:
-  - Implement optional per-CPU arena support; threads choose which arena to use
-    based on current CPU rather than on fixed thread-->arena associations.
-    (@interwq)
-  - Implement two-phase decay of unused dirty pages.  Pages transition from
-    dirty-->muzzy-->clean, where the first phase transition relies on
-    madvise(... MADV_FREE) semantics, and the second phase transition discards
-    pages such that they are replaced with demand-zeroed pages on next access.
-    (@jasone)
-  - Increase decay time resolution from seconds to milliseconds.  (@jasone)
-  - Implement opt-in per CPU background threads, and use them for asynchronous
-    decay-driven unused dirty page purging.  (@interwq)
-  - Add mutex profiling, which collects a variety of statistics useful for
-    diagnosing overhead/contention issues.  (@interwq)
-  - Add C++ new/delete operator bindings.  (@djwatson)
-  - Support manually created arena destruction, such that all data and metadata
-    are discarded.  Add MALLCTL_ARENAS_DESTROYED for accessing merged stats
-    associated with destroyed arenas.  (@jasone)
-  - Add MALLCTL_ARENAS_ALL as a fixed index for use in accessing
-    merged/destroyed arena statistics via mallctl.  (@jasone)
-  - Add opt.abort_conf to optionally abort if invalid configuration options are
-    detected during initialization.  (@interwq)
-  - Add opt.stats_print_opts, so that e.g. JSON output can be selected for the
-    stats dumped during exit if opt.stats_print is true.  (@jasone)
-  - Add --with-version=VERSION for use when embedding jemalloc into another
-    project's git repository.  (@jasone)
-  - Add --disable-thp to support cross compiling.  (@jasone)
-  - Add --with-lg-hugepage to support cross compiling.  (@jasone)
-  - Add mallctl interfaces (various authors):
-    + background_thread
-    + opt.abort_conf
-    + opt.retain
-    + opt.percpu_arena
-    + opt.background_thread
-    + opt.{dirty,muzzy}_decay_ms
-    + opt.stats_print_opts
-    + arena.<i>.initialized
-    + arena.<i>.destroy
-    + arena.<i>.{dirty,muzzy}_decay_ms
-    + arena.<i>.extent_hooks
-    + arenas.{dirty,muzzy}_decay_ms
-    + arenas.bin.<i>.slab_size
-    + arenas.nlextents
-    + arenas.lextent.<i>.size
-    + arenas.create
-    + stats.background_thread.{num_threads,num_runs,run_interval}
-    + stats.mutexes.{ctl,background_thread,prof,reset}.
-      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
-      num_owner_switch}
-    + stats.arenas.<i>.{dirty,muzzy}_decay_ms
-    + stats.arenas.<i>.uptime
-    + stats.arenas.<i>.{pmuzzy,base,internal,resident}
-    + stats.arenas.<i>.{dirty,muzzy}_{npurge,nmadvise,purged}
-    + stats.arenas.<i>.bins.<j>.{nslabs,reslabs,curslabs}
-    + stats.arenas.<i>.bins.<j>.mutex.
-      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
-      num_owner_switch}
-    + stats.arenas.<i>.lextents.<j>.{nmalloc,ndalloc,nrequests,curlextents}
-    + stats.arenas.i.mutexes.{large,extent_avail,extents_dirty,extents_muzzy,
-      extents_retained,decay_dirty,decay_muzzy,base,tcache_list}.
-      {num_ops,num_spin_acq,num_wait,max_wait_time,total_wait_time,max_num_thds,
-      num_owner_switch}
-
-  Portability improvements:
-  - Improve reentrant allocation support, such that deadlock is less likely if
-    e.g. a system library call in turn allocates memory.  (@davidtgoldblatt,
-    @interwq)
-  - Support static linking of jemalloc with glibc.  (@djwatson)
-
-  Optimizations and refactors:
-  - Organize virtual memory as "extents" of virtual memory pages, rather than as
-    naturally aligned "chunks", and store all metadata in arbitrarily distant
-    locations.  This reduces virtual memory external fragmentation, and will
-    interact better with huge pages (not yet explicitly supported).  (@jasone)
-  - Fold large and huge size classes together; only small and large size classes
-    remain.  (@jasone)
-  - Unify the allocation paths, and merge most fast-path branching decisions.
-    (@davidtgoldblatt, @interwq)
-  - Embed per thread automatic tcache into thread-specific data, which reduces
-    conditional branches and dereferences.  Also reorganize tcache to increase
-    fast-path data locality.  (@interwq)
-  - Rewrite atomics to closely model the C11 API, convert various
-    synchronization from mutex-based to atomic, and use the explicit memory
-    ordering control to resolve various hypothetical races without increasing
-    synchronization overhead.  (@davidtgoldblatt)
-  - Extensively optimize rtree via various methods:
-    + Add multiple layers of rtree lookup caching, since rtree lookups are now
-      part of fast-path deallocation.  (@interwq)
-    + Determine rtree layout at compile time.  (@jasone)
-    + Make the tree shallower for common configurations.  (@jasone)
-    + Embed the root node in the top-level rtree data structure, thus avoiding
-      one level of indirection.  (@jasone)
-    + Further specialize leaf elements as compared to internal node elements,
-      and directly embed extent metadata needed for fast-path deallocation.
-      (@jasone)
-    + Ignore leading always-zero address bits (architecture-specific).
-      (@jasone)
-  - Reorganize headers (ongoing work) to make them hermetic, and disentangle
-    various module dependencies.  (@davidtgoldblatt)
-  - Convert various internal data structures such as size class metadata from
-    boot-time-initialized to compile-time-initialized.  Propagate resulting data
-    structure simplifications, such as making arena metadata fixed-size.
-    (@jasone)
-  - Simplify size class lookups when constrained to size classes that are
-    multiples of the page size.  This speeds lookups, but the primary benefit is
-    complexity reduction in code that was the source of numerous regressions.
-    (@jasone)
-  - Lock individual extents when possible for localized extent operations,
-    rather than relying on a top-level arena lock.  (@davidtgoldblatt, @jasone)
-  - Use first fit layout policy instead of best fit, in order to improve
-    packing.  (@jasone)
-  - If munmap(2) is not in use, use an exponential series to grow each arena's
-    virtual memory, so that the number of disjoint virtual memory mappings
-    remains low.  (@jasone)
-  - Implement per arena base allocators, so that arenas never share any virtual
-    memory pages.  (@jasone)
-  - Automatically generate private symbol name mangling macros.  (@jasone)
-
-  Incompatible changes:
-  - Replace chunk hooks with an expanded/normalized set of extent hooks.
-    (@jasone)
-  - Remove ratio-based purging.  (@jasone)
-  - Remove --disable-tcache.  (@jasone)
-  - Remove --disable-tls.  (@jasone)
-  - Remove --enable-ivsalloc.  (@jasone)
-  - Remove --with-lg-size-class-group.  (@jasone)
-  - Remove --with-lg-tiny-min.  (@jasone)
-  - Remove --disable-cc-silence.  (@jasone)
-  - Remove --enable-code-coverage.  (@jasone)
-  - Remove --disable-munmap (replaced by opt.retain).  (@jasone)
-  - Remove Valgrind support.  (@jasone)
-  - Remove quarantine support.  (@jasone)
-  - Remove redzone support.  (@jasone)
-  - Remove mallctl interfaces (various authors):
-    + config.munmap
-    + config.tcache
-    + config.tls
-    + config.valgrind
-    + opt.lg_chunk
-    + opt.purge
-    + opt.lg_dirty_mult
-    + opt.decay_time
-    + opt.quarantine
-    + opt.redzone
-    + opt.thp
-    + arena.<i>.lg_dirty_mult
-    + arena.<i>.decay_time
-    + arena.<i>.chunk_hooks
-    + arenas.initialized
-    + arenas.lg_dirty_mult
-    + arenas.decay_time
-    + arenas.bin.<i>.run_size
-    + arenas.nlruns
-    + arenas.lrun.<i>.size
-    + arenas.nhchunks
-    + arenas.hchunk.<i>.size
-    + arenas.extend
-    + stats.cactive
-    + stats.arenas.<i>.lg_dirty_mult
-    + stats.arenas.<i>.decay_time
-    + stats.arenas.<i>.metadata.{mapped,allocated}
-    + stats.arenas.<i>.{npurge,nmadvise,purged}
-    + stats.arenas.<i>.huge.{allocated,nmalloc,ndalloc,nrequests}
-    + stats.arenas.<i>.bins.<j>.{nruns,reruns,curruns}
-    + stats.arenas.<i>.lruns.<j>.{nmalloc,ndalloc,nrequests,curruns}
-    + stats.arenas.<i>.hchunks.<j>.{nmalloc,ndalloc,nrequests,curhchunks}
-
-  Bug fixes:
-  - Improve interval-based profile dump triggering to dump only one profile when
-    a single allocation's size exceeds the interval.  (@jasone)
-  - Use prefixed function names (as controlled by --with-jemalloc-prefix) when
-    pruning backtrace frames in jeprof.  (@jasone)
-
-* 4.5.0 (February 28, 2017)
-
-  This is the first release to benefit from much broader continuous integration
-  testing, thanks to @davidtgoldblatt.  Had we had this testing infrastructure
-  in place for prior releases, it would have caught all of the most serious
-  regressions fixed by this release.
-
-  New features:
-  - Add --disable-thp and the opt.thp mallctl to provide opt-out mechanisms for
-    transparent huge page integration.  (@jasone)
-  - Update zone allocator integration to work with macOS 10.12.  (@glandium)
-  - Restructure *CFLAGS configuration, so that CFLAGS behaves typically, and
-    EXTRA_CFLAGS provides a way to specify e.g. -Werror during building, but not
-    during configuration.  (@jasone, @ronawho)
-
-  Bug fixes:
-  - Fix DSS (sbrk(2)-based) allocation.  This regression was first released in
-    4.3.0.  (@jasone)
-  - Handle race in per size class utilization computation.  This functionality
-    was first released in 4.0.0.  (@interwq)
-  - Fix lock order reversal during gdump.  (@jasone)
-  - Fix/refactor tcache synchronization.  This regression was first released in
-    4.0.0.  (@jasone)
-  - Fix various JSON-formatted malloc_stats_print() bugs.  This functionality
-    was first released in 4.3.0.  (@jasone)
-  - Fix huge-aligned allocation.  This regression was first released in 4.4.0.
-    (@jasone)
-  - When transparent huge page integration is enabled, detect what state pages
-    start in according to the kernel's current operating mode, and only convert
-    arena chunks to non-huge during purging if that is not their initial state.
-    This functionality was first released in 4.4.0.  (@jasone)
-  - Fix lg_chunk clamping for the --enable-cache-oblivious --disable-fill case.
-    This regression was first released in 4.0.0.  (@jasone, @428desmo)
-  - Properly detect sparc64 when building for Linux.  (@glaubitz)
-
-* 4.4.0 (December 3, 2016)
-
-  New features:
-  - Add configure support for *-*-linux-android.  (@cferris1000, @jasone)
-  - Add the --disable-syscall configure option, for use on systems that place
-    security-motivated limitations on syscall(2).  (@jasone)
-  - Add support for Debian GNU/kFreeBSD.  (@thesam)
-
-  Optimizations:
-  - Add extent serial numbers and use them where appropriate as a sort key that
-    is higher priority than address, so that the allocation policy prefers older
-    extents.  This tends to improve locality (decrease fragmentation) when
-    memory grows downward.  (@jasone)
-  - Refactor madvise(2) configuration so that MADV_FREE is detected and utilized
-    on Linux 4.5 and newer.  (@jasone)
-  - Mark partially purged arena chunks as non-huge-page.  This improves
-    interaction with Linux's transparent huge page functionality.  (@jasone)
-
-  Bug fixes:
-  - Fix size class computations for edge conditions involving extremely large
-    allocations.  This regression was first released in 4.0.0.  (@jasone,
-    @ingvarha)
-  - Remove overly restrictive assertions related to the cactive statistic.  This
-    regression was first released in 4.1.0.  (@jasone)
-  - Implement a more reliable detection scheme for os_unfair_lock on macOS.
-    (@jszakmeister)
-
-* 4.3.1 (November 7, 2016)
-
-  Bug fixes:
-  - Fix a severe virtual memory leak.  This regression was first released in
-    4.3.0.  (@interwq, @jasone)
-  - Refactor atomic and prng APIs to restore support for 32-bit platforms that
-    use pre-C11 toolchains, e.g. FreeBSD's mips.  (@jasone)
-
-* 4.3.0 (November 4, 2016)
-
-  This is the first release that passes the test suite for multiple Windows
-  configurations, thanks in large part to @glandium setting up continuous
-  integration via AppVeyor (and Travis CI for Linux and OS X).
-
-  New features:
-  - Add "J" (JSON) support to malloc_stats_print().  (@jasone)
-  - Add Cray compiler support.  (@ronawho)
-
-  Optimizations:
-  - Add/use adaptive spinning for bootstrapping and radix tree node
-    initialization.  (@jasone)
-
-  Bug fixes:
-  - Fix large allocation to search starting in the optimal size class heap,
-    which can substantially reduce virtual memory churn and fragmentation.  This
-    regression was first released in 4.0.0.  (@mjp41, @jasone)
-  - Fix stats.arenas.<i>.nthreads accounting.  (@interwq)
-  - Fix and simplify decay-based purging.  (@jasone)
-  - Make DSS (sbrk(2)-related) operations lockless, which resolves potential
-    deadlocks during thread exit.  (@jasone)
-  - Fix over-sized allocation of radix tree leaf nodes.  (@mjp41, @ogaun,
-    @jasone)
-  - Fix over-sized allocation of arena_t (plus associated stats) data
-    structures.  (@jasone, @interwq)
-  - Fix EXTRA_CFLAGS to not affect configuration.  (@jasone)
-  - Fix a Valgrind integration bug.  (@ronawho)
-  - Disallow 0x5a junk filling when running in Valgrind.  (@jasone)
-  - Fix a file descriptor leak on Linux.  This regression was first released in
-    4.2.0.  (@vsarunas, @jasone)
-  - Fix static linking of jemalloc with glibc.  (@djwatson)
-  - Use syscall(2) rather than {open,read,close}(2) during boot on Linux.  This
-    works around other libraries' system call wrappers performing reentrant
-    allocation.  (@kspinka, @Whissi, @jasone)
-  - Fix OS X default zone replacement to work with OS X 10.12.  (@glandium,
-    @jasone)
-  - Fix cached memory management to avoid needless commit/decommit operations
-    during purging, which resolves permanent virtual memory map fragmentation
-    issues on Windows.  (@mjp41, @jasone)
-  - Fix TSD fetches to avoid (recursive) allocation.  This is relevant to
-    non-TLS and Windows configurations.  (@jasone)
-  - Fix malloc_conf overriding to work on Windows.  (@jasone)
-  - Forcibly disable lazy-lock on Windows (was forcibly *enabled*).  (@jasone)
-
-* 4.2.1 (June 8, 2016)
-
-  Bug fixes:
-  - Fix bootstrapping issues for configurations that require allocation during
-    tsd initialization (e.g. --disable-tls).  (@cferris1000, @jasone)
-  - Fix gettimeofday() version of nstime_update().  (@ronawho)
-  - Fix Valgrind regressions in calloc() and chunk_alloc_wrapper().  (@ronawho)
-  - Fix potential VM map fragmentation regression.  (@jasone)
-  - Fix opt_zero-triggered in-place huge reallocation zeroing.  (@jasone)
-  - Fix heap profiling context leaks in reallocation edge cases.  (@jasone)
-
-* 4.2.0 (May 12, 2016)
-
-  New features:
-  - Add the arena.<i>.reset mallctl, which makes it possible to discard all of
-    an arena's allocations in a single operation.  (@jasone)
-  - Add the stats.retained and stats.arenas.<i>.retained statistics.  (@jasone)
-  - Add the --with-version configure option.  (@jasone)
-  - Support --with-lg-page values larger than actual page size.  (@jasone)
-
-  Optimizations:
-  - Use pairing heaps rather than red-black trees for various hot data
-    structures.  (@djwatson, @jasone)
-  - Streamline fast paths of rtree operations.  (@jasone)
-  - Optimize the fast paths of calloc() and [m,d,sd]allocx().  (@jasone)
-  - Decommit unused virtual memory if the OS does not overcommit.  (@jasone)
-  - Specify MAP_NORESERVE on Linux if [heuristic] overcommit is active, in order
-    to avoid unfortunate interactions during fork(2).  (@jasone)
-
-  Bug fixes:
-  - Fix chunk accounting related to triggering gdump profiles.  (@jasone)
-  - Link against librt for clock_gettime(2) if glibc < 2.17.  (@jasone)
-  - Scale leak report summary according to sampling probability.  (@jasone)
-
-* 4.1.1 (May 3, 2016)
-
-  This bugfix release resolves a variety of mostly minor issues, though the
-  bitmap fix is critical for 64-bit Windows.
-
-  Bug fixes:
-  - Fix the linear scan version of bitmap_sfu() to shift by the proper amount
-    even when sizeof(long) is not the same as sizeof(void *), as on 64-bit
-    Windows.  (@jasone)
-  - Fix hashing functions to avoid unaligned memory accesses (and resulting
-    crashes).  This is relevant at least to some ARM-based platforms.
-    (@rkmisra)
-  - Fix fork()-related lock rank ordering reversals.  These reversals were
-    unlikely to cause deadlocks in practice except when heap profiling was
-    enabled and active.  (@jasone)
-  - Fix various chunk leaks in OOM code paths.  (@jasone)
-  - Fix malloc_stats_print() to print opt.narenas correctly.  (@jasone)
-  - Fix MSVC-specific build/test issues.  (@rustyx, @yuslepukhin)
-  - Fix a variety of test failures that were due to test fragility rather than
-    core bugs.  (@jasone)
-
-* 4.1.0 (February 28, 2016)
-
-  This release is primarily about optimizations, but it also incorporates a lot
-  of portability-motivated refactoring and enhancements.  Many people worked on
-  this release, to an extent that even with the omission here of minor changes
-  (see git revision history), and of the people who reported and diagnosed
-  issues, so much of the work was contributed that starting with this release,
-  changes are annotated with author credits to help reflect the collaborative
-  effort involved.
-
-  New features:
-  - Implement decay-based unused dirty page purging, a major optimization with
-    mallctl API impact.  This is an alternative to the existing ratio-based
-    unused dirty page purging, and is intended to eventually become the sole
-    purging mechanism.  New mallctls:
-    + opt.purge
-    + opt.decay_time
-    + arena.<i>.decay
-    + arena.<i>.decay_time
-    + arenas.decay_time
-    + stats.arenas.<i>.decay_time
-    (@jasone, @cevans87)
-  - Add --with-malloc-conf, which makes it possible to embed a default
-    options string during configuration.  This was motivated by the desire to
-    specify --with-malloc-conf=purge:decay , since the default must remain
-    purge:ratio until the 5.0.0 release.  (@jasone)
-  - Add MS Visual Studio 2015 support.  (@rustyx, @yuslepukhin)
-  - Make *allocx() size class overflow behavior defined.  The maximum
-    size class is now less than PTRDIFF_MAX to protect applications against
-    numerical overflow, and all allocation functions are guaranteed to indicate
-    errors rather than potentially crashing if the request size exceeds the
-    maximum size class.  (@jasone)
-  - jeprof:
-    + Add raw heap profile support.  (@jasone)
-    + Add --retain and --exclude for backtrace symbol filtering.  (@jasone)
-
-  Optimizations:
-  - Optimize the fast path to combine various bootstrapping and configuration
-    checks and execute more streamlined code in the common case.  (@interwq)
-  - Use linear scan for small bitmaps (used for small object tracking).  In
-    addition to speeding up bitmap operations on 64-bit systems, this reduces
-    allocator metadata overhead by approximately 0.2%.  (@djwatson)
-  - Separate arena_avail trees, which substantially speeds up run tree
-    operations.  (@djwatson)
-  - Use memoization (boot-time-computed table) for run quantization.  Separate
-    arena_avail trees reduced the importance of this optimization.  (@jasone)
-  - Attempt mmap-based in-place huge reallocation.  This can dramatically speed
-    up incremental huge reallocation.  (@jasone)
-
-  Incompatible changes:
-  - Make opt.narenas unsigned rather than size_t.  (@jasone)
-
-  Bug fixes:
-  - Fix stats.cactive accounting regression.  (@rustyx, @jasone)
-  - Handle unaligned keys in hash().  This caused problems for some ARM systems.
-    (@jasone, @cferris1000)
-  - Refactor arenas array.  In addition to fixing a fork-related deadlock, this
-    makes arena lookups faster and simpler.  (@jasone)
-  - Move retained memory allocation out of the default chunk allocation
-    function, to a location that gets executed even if the application installs
-    a custom chunk allocation function.  This resolves a virtual memory leak.
-    (@buchgr)
-  - Fix a potential tsd cleanup leak.  (@cferris1000, @jasone)
-  - Fix run quantization.  In practice this bug had no impact unless
-    applications requested memory with alignment exceeding one page.
-    (@jasone, @djwatson)
-  - Fix LinuxThreads-specific bootstrapping deadlock.  (Cosmin Paraschiv)
-  - jeprof:
-    + Don't discard curl options if timeout is not defined.  (@djwatson)
-    + Detect failed profile fetches.  (@djwatson)
-  - Fix stats.arenas.<i>.{dss,lg_dirty_mult,decay_time,pactive,pdirty} for
-    --disable-stats case.  (@jasone)
-
-* 4.0.4 (October 24, 2015)
-
-  This bugfix release fixes another xallocx() regression.  No other regressions
-  have come to light in over a month, so this is likely a good starting point
-  for people who prefer to wait for "dot one" releases with all the major issues
-  shaken out.
-
-  Bug fixes:
-  - Fix xallocx(..., MALLOCX_ZERO to zero the last full trailing page of large
-    allocations that have been randomly assigned an offset of 0 when
-    --enable-cache-oblivious configure option is enabled.
-
-* 4.0.3 (September 24, 2015)
-
-  This bugfix release continues the trend of xallocx() and heap profiling fixes.
-
-  Bug fixes:
-  - Fix xallocx(..., MALLOCX_ZERO) to zero all trailing bytes of large
-    allocations when --enable-cache-oblivious configure option is enabled.
-  - Fix xallocx(..., MALLOCX_ZERO) to zero trailing bytes of huge allocations
-    when resizing from/to a size class that is not a multiple of the chunk size.
-  - Fix prof_tctx_dump_iter() to filter out nodes that were created after heap
-    profile dumping started.
-  - Work around a potentially bad thread-specific data initialization
-    interaction with NPTL (glibc's pthreads implementation).
-
-* 4.0.2 (September 21, 2015)
-
-  This bugfix release addresses a few bugs specific to heap profiling.
-
-  Bug fixes:
-  - Fix ixallocx_prof_sample() to never modify nor create sampled small
-    allocations.  xallocx() is in general incapable of moving small allocations,
-    so this fix removes buggy code without loss of generality.
-  - Fix irallocx_prof_sample() to always allocate large regions, even when
-    alignment is non-zero.
-  - Fix prof_alloc_rollback() to read tdata from thread-specific data rather
-    than dereferencing a potentially invalid tctx.
-
-* 4.0.1 (September 15, 2015)
-
-  This is a bugfix release that is somewhat high risk due to the amount of
-  refactoring required to address deep xallocx() problems.  As a side effect of
-  these fixes, xallocx() now tries harder to partially fulfill requests for
-  optional extra space.  Note that a couple of minor heap profiling
-  optimizations are included, but these are better thought of as performance
-  fixes that were integral to discovering most of the other bugs.
-
-  Optimizations:
-  - Avoid a chunk metadata read in arena_prof_tctx_set(), since it is in the
-    fast path when heap profiling is enabled.  Additionally, split a special
-    case out into arena_prof_tctx_reset(), which also avoids chunk metadata
-    reads.
-  - Optimize irallocx_prof() to optimistically update the sampler state.  The
-    prior implementation appears to have been a holdover from when
-    rallocx()/xallocx() functionality was combined as rallocm().
-
-  Bug fixes:
-  - Fix TLS configuration such that it is enabled by default for platforms on
-    which it works correctly.
-  - Fix arenas_cache_cleanup() and arena_get_hard() to handle
-    allocation/deallocation within the application's thread-specific data
-    cleanup functions even after arenas_cache is torn down.
-  - Fix xallocx() bugs related to size+extra exceeding HUGE_MAXCLASS.
-  - Fix chunk purge hook calls for in-place huge shrinking reallocation to
-    specify the old chunk size rather than the new chunk size.  This bug caused
-    no correctness issues for the default chunk purge function, but was
-    visible to custom functions set via the "arena.<i>.chunk_hooks" mallctl.
-  - Fix heap profiling bugs:
-    + Fix heap profiling to distinguish among otherwise identical sample sites
-      with interposed resets (triggered via the "prof.reset" mallctl).  This bug
-      could cause data structure corruption that would most likely result in a
-      segfault.
-    + Fix irealloc_prof() to prof_alloc_rollback() on OOM.
-    + Make one call to prof_active_get_unlocked() per allocation event, and use
-      the result throughout the relevant functions that handle an allocation
-      event.  Also add a missing check in prof_realloc().  These fixes protect
-      allocation events against concurrent prof_active changes.
-    + Fix ixallocx_prof() to pass usize_max and zero to ixallocx_prof_sample()
-      in the correct order.
-    + Fix prof_realloc() to call prof_free_sampled_object() after calling
-      prof_malloc_sample_object().  Prior to this fix, if tctx and old_tctx were
-      the same, the tctx could have been prematurely destroyed.
-  - Fix portability bugs:
-    + Don't bitshift by negative amounts when encoding/decoding run sizes in
-      chunk header maps.  This affected systems with page sizes greater than 8
-      KiB.
-    + Rename index_t to szind_t to avoid an existing type on Solaris.
-    + Add JEMALLOC_CXX_THROW to the memalign() function prototype, in order to
-      match glibc and avoid compilation errors when including both
-      jemalloc/jemalloc.h and malloc.h in C++ code.
-    + Don't assume that /bin/sh is appropriate when running size_classes.sh
-      during configuration.
-    + Consider __sparcv9 a synonym for __sparc64__ when defining LG_QUANTUM.
-    + Link tests to librt if it contains clock_gettime(2).
-
-* 4.0.0 (August 17, 2015)
-
-  This version contains many speed and space optimizations, both minor and
-  major.  The major themes are generalization, unification, and simplification.
-  Although many of these optimizations cause no visible behavior change, their
-  cumulative effect is substantial.
-
-  New features:
-  - Normalize size class spacing to be consistent across the complete size
-    range.  By default there are four size classes per size doubling, but this
-    is now configurable via the --with-lg-size-class-group option.  Also add the
-    --with-lg-page, --with-lg-page-sizes, --with-lg-quantum, and
-    --with-lg-tiny-min options, which can be used to tweak page and size class
-    settings.  Impacts:
-    + Worst case performance for incrementally growing/shrinking reallocation
-      is improved because there are far fewer size classes, and therefore
-      copying happens less often.
-    + Internal fragmentation is limited to 20% for all but the smallest size
-      classes (those less than four times the quantum).  (1B + 4 KiB)
-      and (1B + 4 MiB) previously suffered nearly 50% internal fragmentation.
-    + Chunk fragmentation tends to be lower because there are fewer distinct run
-      sizes to pack.
-  - Add support for explicit tcaches.  The "tcache.create", "tcache.flush", and
-    "tcache.destroy" mallctls control tcache lifetime and flushing, and the
-    MALLOCX_TCACHE(tc) and MALLOCX_TCACHE_NONE flags to the *allocx() API
-    control which tcache is used for each operation.
-  - Implement per thread heap profiling, as well as the ability to
-    enable/disable heap profiling on a per thread basis.  Add the "prof.reset",
-    "prof.lg_sample", "thread.prof.name", "thread.prof.active",
-    "opt.prof_thread_active_init", "prof.thread_active_init", and
-    "thread.prof.active" mallctls.
-  - Add support for per arena application-specified chunk allocators, configured
-    via the "arena.<i>.chunk_hooks" mallctl.
-  - Refactor huge allocation to be managed by arenas, so that arenas now
-    function as general purpose independent allocators.  This is important in
-    the context of user-specified chunk allocators, aside from the scalability
-    benefits.  Related new statistics:
-    + The "stats.arenas.<i>.huge.allocated", "stats.arenas.<i>.huge.nmalloc",
-      "stats.arenas.<i>.huge.ndalloc", and "stats.arenas.<i>.huge.nrequests"
-      mallctls provide high level per arena huge allocation statistics.
-    + The "arenas.nhchunks", "arenas.hchunk.<i>.size",
-      "stats.arenas.<i>.hchunks.<j>.nmalloc",
-      "stats.arenas.<i>.hchunks.<j>.ndalloc",
-      "stats.arenas.<i>.hchunks.<j>.nrequests", and
-      "stats.arenas.<i>.hchunks.<j>.curhchunks" mallctls provide per size class
-      statistics.
-  - Add the 'util' column to malloc_stats_print() output, which reports the
-    proportion of available regions that are currently in use for each small
-    size class.
-  - Add "alloc" and "free" modes for for junk filling (see the "opt.junk"
-    mallctl), so that it is possible to separately enable junk filling for
-    allocation versus deallocation.
-  - Add the jemalloc-config script, which provides information about how
-    jemalloc was configured, and how to integrate it into application builds.
-  - Add metadata statistics, which are accessible via the "stats.metadata",
-    "stats.arenas.<i>.metadata.mapped", and
-    "stats.arenas.<i>.metadata.allocated" mallctls.
-  - Add the "stats.resident" mallctl, which reports the upper limit of
-    physically resident memory mapped by the allocator.
-  - Add per arena control over unused dirty page purging, via the
-    "arenas.lg_dirty_mult", "arena.<i>.lg_dirty_mult", and
-    "stats.arenas.<i>.lg_dirty_mult" mallctls.
-  - Add the "prof.gdump" mallctl, which makes it possible to toggle the gdump
-    feature on/off during program execution.
-  - Add sdallocx(), which implements sized deallocation.  The primary
-    optimization over dallocx() is the removal of a metadata read, which often
-    suffers an L1 cache miss.
-  - Add missing header includes in jemalloc/jemalloc.h, so that applications
-    only have to #include <jemalloc/jemalloc.h>.
-  - Add support for additional platforms:
-    + Bitrig
-    + Cygwin
-    + DragonFlyBSD
-    + iOS
-    + OpenBSD
-    + OpenRISC/or1k
-
-  Optimizations:
-  - Maintain dirty runs in per arena LRUs rather than in per arena trees of
-    dirty-run-containing chunks.  In practice this change significantly reduces
-    dirty page purging volume.
-  - Integrate whole chunks into the unused dirty page purging machinery.  This
-    reduces the cost of repeated huge allocation/deallocation, because it
-    effectively introduces a cache of chunks.
-  - Split the arena chunk map into two separate arrays, in order to increase
-    cache locality for the frequently accessed bits.
-  - Move small run metadata out of runs, into arena chunk headers.  This reduces
-    run fragmentation, smaller runs reduce external fragmentation for small size
-    classes, and packed (less uniformly aligned) metadata layout improves CPU
-    cache set distribution.
-  - Randomly distribute large allocation base pointer alignment relative to page
-    boundaries in order to more uniformly utilize CPU cache sets.  This can be
-    disabled via the --disable-cache-oblivious configure option, and queried via
-    the "config.cache_oblivious" mallctl.
-  - Micro-optimize the fast paths for the public API functions.
-  - Refactor thread-specific data to reside in a single structure.  This assures
-    that only a single TLS read is necessary per call into the public API.
-  - Implement in-place huge allocation growing and shrinking.
-  - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
-    additional optimizations that reduce maximum lookup depth to one or two
-    levels.  This resolves what was a concurrency bottleneck for per arena huge
-    allocation, because a global data structure is critical for determining
-    which arenas own which huge allocations.
-
-  Incompatible changes:
-  - Replace --enable-cc-silence with --disable-cc-silence to suppress spurious
-    warnings by default.
-  - Assure that the constness of malloc_usable_size()'s return type matches that
-    of the system implementation.
-  - Change the heap profile dump format to support per thread heap profiling,
-    rename pprof to jeprof, and enhance it with the --thread=<n> option.  As a
-    result, the bundled jeprof must now be used rather than the upstream
-    (gperftools) pprof.
-  - Disable "opt.prof_final" by default, in order to avoid atexit(3), which can
-    internally deadlock on some platforms.
-  - Change the "arenas.nlruns" mallctl type from size_t to unsigned.
-  - Replace the "stats.arenas.<i>.bins.<j>.allocated" mallctl with
-    "stats.arenas.<i>.bins.<j>.curregs".
-  - Ignore MALLOC_CONF in set{uid,gid,cap} binaries.
-  - Ignore MALLOCX_ARENA(a) in dallocx(), in favor of using the
-    MALLOCX_TCACHE(tc) and MALLOCX_TCACHE_NONE flags to control tcache usage.
-
-  Removed features:
-  - Remove the *allocm() API, which is superseded by the *allocx() API.
-  - Remove the --enable-dss options, and make dss non-optional on all platforms
-    which support sbrk(2).
-  - Remove the "arenas.purge" mallctl, which was obsoleted by the
-    "arena.<i>.purge" mallctl in 3.1.0.
-  - Remove the unnecessary "opt.valgrind" mallctl; jemalloc automatically
-    detects whether it is running inside Valgrind.
-  - Remove the "stats.huge.allocated", "stats.huge.nmalloc", and
-    "stats.huge.ndalloc" mallctls.
-  - Remove the --enable-mremap option.
-  - Remove the "stats.chunks.current", "stats.chunks.total", and
-    "stats.chunks.high" mallctls.
-
-  Bug fixes:
-  - Fix the cactive statistic to decrease (rather than increase) when active
-    memory decreases.  This regression was first released in 3.5.0.
-  - Fix OOM handling in memalign() and valloc().  A variant of this bug existed
-    in all releases since 2.0.0, which introduced these functions.
-  - Fix an OOM-related regression in arena_tcache_fill_small(), which could
-    cause cache corruption on OOM.  This regression was present in all releases
-    from 2.2.0 through 3.6.0.
-  - Fix size class overflow handling for malloc(), posix_memalign(), memalign(),
-    calloc(), and realloc() when profiling is enabled.
-  - Fix the "arena.<i>.dss" mallctl to return an error if "primary" or
-    "secondary" precedence is specified, but sbrk(2) is not supported.
-  - Fix fallback lg_floor() implementations to handle extremely large inputs.
-  - Ensure the default purgeable zone is after the default zone on OS X.
-  - Fix latent bugs in atomic_*().
-  - Fix the "arena.<i>.dss" mallctl to handle read-only calls.
-  - Fix tls_model configuration to enable the initial-exec model when possible.
-  - Mark malloc_conf as a weak symbol so that the application can override it.
-  - Correctly detect glibc's adaptive pthread mutexes.
-  - Fix the --without-export configure option.
-
-* 3.6.0 (March 31, 2014)
-
-  This version contains a critical bug fix for a regression present in 3.5.0 and
-  3.5.1.
-
-  Bug fixes:
-  - Fix a regression in arena_chunk_alloc() that caused crashes during
-    small/large allocation if chunk allocation failed.  In the absence of this
-    bug, chunk allocation failure would result in allocation failure, e.g.  NULL
-    return from malloc().  This regression was introduced in 3.5.0.
-  - Fix backtracing for gcc intrinsics-based backtracing by specifying
-    -fno-omit-frame-pointer to gcc.  Note that the application (and all the
-    libraries it links to) must also be compiled with this option for
-    backtracing to be reliable.
-  - Use dss allocation precedence for huge allocations as well as small/large
-    allocations.
-  - Fix test assertion failure message formatting.  This bug did not manifest on
-    x86_64 systems because of implementation subtleties in va_list.
-  - Fix inconsequential test failures for hash and SFMT code.
-
-  New features:
-  - Support heap profiling on FreeBSD.  This feature depends on the proc
-    filesystem being mounted during heap profile dumping.
-
-* 3.5.1 (February 25, 2014)
-
-  This version primarily addresses minor bugs in test code.
-
-  Bug fixes:
-  - Configure Solaris/Illumos to use MADV_FREE.
-  - Fix junk filling for mremap(2)-based huge reallocation.  This is only
-    relevant if configuring with the --enable-mremap option specified.
-  - Avoid compilation failure if 'restrict' C99 keyword is not supported by the
-    compiler.
-  - Add a configure test for SSE2 rather than assuming it is usable on i686
-    systems.  This fixes test compilation errors, especially on 32-bit Linux
-    systems.
-  - Fix mallctl argument size mismatches (size_t vs. uint64_t) in the stats unit
-    test.
-  - Fix/remove flawed alignment-related overflow tests.
-  - Prevent compiler optimizations that could change backtraces in the
-    prof_accum unit test.
-
-* 3.5.0 (January 22, 2014)
-
-  This version focuses on refactoring and automated testing, though it also
-  includes some non-trivial heap profiling optimizations not mentioned below.
-
-  New features:
-  - Add the *allocx() API, which is a successor to the experimental *allocm()
-    API.  The *allocx() functions are slightly simpler to use because they have
-    fewer parameters, they directly return the results of primary interest, and
-    mallocx()/rallocx() avoid the strict aliasing pitfall that
-    allocm()/rallocm() share with posix_memalign().  Note that *allocm() is
-    slated for removal in the next non-bugfix release.
-  - Add support for LinuxThreads.
-
-  Bug fixes:
-  - Unless heap profiling is enabled, disable floating point code and don't link
-    with libm.  This, in combination with e.g. EXTRA_CFLAGS=-mno-sse on x64
-    systems, makes it possible to completely disable floating point register
-    use.  Some versions of glibc neglect to save/restore caller-saved floating
-    point registers during dynamic lazy symbol loading, and the symbol loading
-    code uses whatever malloc the application happens to have linked/loaded
-    with, the result being potential floating point register corruption.
-  - Report ENOMEM rather than EINVAL if an OOM occurs during heap profiling
-    backtrace creation in imemalign().  This bug impacted posix_memalign() and
-    aligned_alloc().
-  - Fix a file descriptor leak in a prof_dump_maps() error path.
-  - Fix prof_dump() to close the dump file descriptor for all relevant error
-    paths.
-  - Fix rallocm() to use the arena specified by the ALLOCM_ARENA(s) flag for
-    allocation, not just deallocation.
-  - Fix a data race for large allocation stats counters.
-  - Fix a potential infinite loop during thread exit.  This bug occurred on
-    Solaris, and could affect other platforms with similar pthreads TSD
-    implementations.
-  - Don't junk-fill reallocations unless usable size changes.  This fixes a
-    violation of the *allocx()/*allocm() semantics.
-  - Fix growing large reallocation to junk fill new space.
-  - Fix huge deallocation to junk fill when munmap is disabled.
-  - Change the default private namespace prefix from empty to je_, and change
-    --with-private-namespace-prefix so that it prepends an additional prefix
-    rather than replacing je_.  This reduces the likelihood of applications
-    which statically link jemalloc experiencing symbol name collisions.
-  - Add missing private namespace mangling (relevant when
-    --with-private-namespace is specified).
-  - Add and use JEMALLOC_INLINE_C so that static inline functions are marked as
-    static even for debug builds.
-  - Add a missing mutex unlock in a malloc_init_hard() error path.  In practice
-    this error path is never executed.
-  - Fix numerous bugs in malloc_strotumax() error handling/reporting.  These
-    bugs had no impact except for malformed inputs.
-  - Fix numerous bugs in malloc_snprintf().  These bugs were not exercised by
-    existing calls, so they had no impact.
-
-* 3.4.1 (October 20, 2013)
-
-  Bug fixes:
-  - Fix a race in the "arenas.extend" mallctl that could cause memory corruption
-    of internal data structures and subsequent crashes.
-  - Fix Valgrind integration flaws that caused Valgrind warnings about reads of
-    uninitialized memory in:
-    + arena chunk headers
-    + internal zero-initialized data structures (relevant to tcache and prof
-      code)
-  - Preserve errno during the first allocation.  A readlink(2) call during
-    initialization fails unless /etc/malloc.conf exists, so errno was typically
-    set during the first allocation prior to this fix.
-  - Fix compilation warnings reported by gcc 4.8.1.
-
-* 3.4.0 (June 2, 2013)
-
-  This version is essentially a small bugfix release, but the addition of
-  aarch64 support requires that the minor version be incremented.
-
-  Bug fixes:
-  - Fix race-triggered deadlocks in chunk_record().  These deadlocks were
-    typically triggered by multiple threads concurrently deallocating huge
-    objects.
-
-  New features:
-  - Add support for the aarch64 architecture.
-
-* 3.3.1 (March 6, 2013)
-
-  This version fixes bugs that are typically encountered only when utilizing
-  custom run-time options.
-
-  Bug fixes:
-  - Fix a locking order bug that could cause deadlock during fork if heap
-    profiling were enabled.
-  - Fix a chunk recycling bug that could cause the allocator to lose track of
-    whether a chunk was zeroed.  On FreeBSD, NetBSD, and OS X, it could cause
-    corruption if allocating via sbrk(2) (unlikely unless running with the
-    "dss:primary" option specified).  This was completely harmless on Linux
-    unless using mlockall(2) (and unlikely even then, unless the
-    --disable-munmap configure option or the "dss:primary" option was
-    specified).  This regression was introduced in 3.1.0 by the
-    mlockall(2)/madvise(2) interaction fix.
-  - Fix TLS-related memory corruption that could occur during thread exit if the
-    thread never allocated memory.  Only the quarantine and prof facilities were
-    susceptible.
-  - Fix two quarantine bugs:
-    + Internal reallocation of the quarantined object array leaked the old
-      array.
-    + Reallocation failure for internal reallocation of the quarantined object
-      array (very unlikely) resulted in memory corruption.
-  - Fix Valgrind integration to annotate all internally allocated memory in a
-    way that keeps Valgrind happy about internal data structure access.
-  - Fix building for s390 systems.
-
-* 3.3.0 (January 23, 2013)
-
-  This version includes a few minor performance improvements in addition to the
-  listed new features and bug fixes.
-
-  New features:
-  - Add clipping support to lg_chunk option processing.
-  - Add the --enable-ivsalloc option.
-  - Add the --without-export option.
-  - Add the --disable-zone-allocator option.
-
-  Bug fixes:
-  - Fix "arenas.extend" mallctl to output the number of arenas.
-  - Fix chunk_recycle() to unconditionally inform Valgrind that returned memory
-    is undefined.
-  - Fix build break on FreeBSD related to alloca.h.
-
-* 3.2.0 (November 9, 2012)
-
-  In addition to a couple of bug fixes, this version modifies page run
-  allocation and dirty page purging algorithms in order to better control
-  page-level virtual memory fragmentation.
-
-  Incompatible changes:
-  - Change the "opt.lg_dirty_mult" default from 5 to 3 (32:1 to 8:1).
-
-  Bug fixes:
-  - Fix dss/mmap allocation precedence code to use recyclable mmap memory only
-    after primary dss allocation fails.
-  - Fix deadlock in the "arenas.purge" mallctl.  This regression was introduced
-    in 3.1.0 by the addition of the "arena.<i>.purge" mallctl.
-
-* 3.1.0 (October 16, 2012)
-
-  New features:
-  - Auto-detect whether running inside Valgrind, thus removing the need to
-    manually specify MALLOC_CONF=valgrind:true.
-  - Add the "arenas.extend" mallctl, which allows applications to create
-    manually managed arenas.
-  - Add the ALLOCM_ARENA() flag for {,r,d}allocm().
-  - Add the "opt.dss", "arena.<i>.dss", and "stats.arenas.<i>.dss" mallctls,
-    which provide control over dss/mmap precedence.
-  - Add the "arena.<i>.purge" mallctl, which obsoletes "arenas.purge".
-  - Define LG_QUANTUM for hppa.
-
-  Incompatible changes:
-  - Disable tcache by default if running inside Valgrind, in order to avoid
-    making unallocated objects appear reachable to Valgrind.
-  - Drop const from malloc_usable_size() argument on Linux.
-
-  Bug fixes:
-  - Fix heap profiling crash if sampled object is freed via realloc(p, 0).
-  - Remove const from __*_hook variable declarations, so that glibc can modify
-    them during process forking.
-  - Fix mlockall(2)/madvise(2) interaction.
-  - Fix fork(2)-related deadlocks.
-  - Fix error return value for "thread.tcache.enabled" mallctl.
-
-* 3.0.0 (May 11, 2012)
-
-  Although this version adds some major new features, the primary focus is on
-  internal code cleanup that facilitates maintainability and portability, most
-  of which is not reflected in the ChangeLog.  This is the first release to
-  incorporate substantial contributions from numerous other developers, and the
-  result is a more broadly useful allocator (see the git revision history for
-  contribution details).  Note that the license has been unified, thanks to
-  Facebook granting a license under the same terms as the other copyright
-  holders (see COPYING).
-
-  New features:
-  - Implement Valgrind support, redzones, and quarantine.
-  - Add support for additional platforms:
-    + FreeBSD
-    + Mac OS X Lion
-    + MinGW
-    + Windows (no support yet for replacing the system malloc)
-  - Add support for additional architectures:
-    + MIPS
-    + SH4
-    + Tilera
-  - Add support for cross compiling.
-  - Add nallocm(), which rounds a request size up to the nearest size class
-    without actually allocating.
-  - Implement aligned_alloc() (blame C11).
-  - Add the "thread.tcache.enabled" mallctl.
-  - Add the "opt.prof_final" mallctl.
-  - Update pprof (from gperftools 2.0).
-  - Add the --with-mangling option.
-  - Add the --disable-experimental option.
-  - Add the --disable-munmap option, and make it the default on Linux.
-  - Add the --enable-mremap option, which disables use of mremap(2) by default.
-
-  Incompatible changes:
-  - Enable stats by default.
-  - Enable fill by default.
-  - Disable lazy locking by default.
-  - Rename the "tcache.flush" mallctl to "thread.tcache.flush".
-  - Rename the "arenas.pagesize" mallctl to "arenas.page".
-  - Change the "opt.lg_prof_sample" default from 0 to 19 (1 B to 512 KiB).
-  - Change the "opt.prof_accum" default from true to false.
-
-  Removed features:
-  - Remove the swap feature, including the "config.swap", "swap.avail",
-    "swap.prezeroed", "swap.nfds", and "swap.fds" mallctls.
-  - Remove highruns statistics, including the
-    "stats.arenas.<i>.bins.<j>.highruns" and
-    "stats.arenas.<i>.lruns.<j>.highruns" mallctls.
-  - As part of small size class refactoring, remove the "opt.lg_[qc]space_max",
-    "arenas.cacheline", "arenas.subpage", "arenas.[tqcs]space_{min,max}", and
-    "arenas.[tqcs]bins" mallctls.
-  - Remove the "arenas.chunksize" mallctl.
-  - Remove the "opt.lg_prof_tcmax" option.
-  - Remove the "opt.lg_prof_bt_max" option.
-  - Remove the "opt.lg_tcache_gc_sweep" option.
-  - Remove the --disable-tiny option, including the "config.tiny" mallctl.
-  - Remove the --enable-dynamic-page-shift configure option.
-  - Remove the --enable-sysv configure option.
-
-  Bug fixes:
-  - Fix a statistics-related bug in the "thread.arena" mallctl that could cause
-    invalid statistics and crashes.
-  - Work around TLS deallocation via free() on Linux.  This bug could cause
-    write-after-free memory corruption.
-  - Fix a potential deadlock that could occur during interval- and
-    growth-triggered heap profile dumps.
-  - Fix large calloc() zeroing bugs due to dropping chunk map unzeroed flags.
-  - Fix chunk_alloc_dss() to stop claiming memory is zeroed.  This bug could
-    cause memory corruption and crashes with --enable-dss specified.
-  - Fix fork-related bugs that could cause deadlock in children between fork
-    and exec.
-  - Fix malloc_stats_print() to honor 'b' and 'l' in the opts parameter.
-  - Fix realloc(p, 0) to act like free(p).
-  - Do not enforce minimum alignment in memalign().
-  - Check for NULL pointer in malloc_usable_size().
-  - Fix an off-by-one heap profile statistics bug that could be observed in
-    interval- and growth-triggered heap profiles.
-  - Fix the "epoch" mallctl to update cached stats even if the passed in epoch
-    is 0.
-  - Fix bin->runcur management to fix a layout policy bug.  This bug did not
-    affect correctness.
-  - Fix a bug in choose_arena_hard() that potentially caused more arenas to be
-    initialized than necessary.
-  - Add missing "opt.lg_tcache_max" mallctl implementation.
-  - Use glibc allocator hooks to make mixed allocator usage less likely.
-  - Fix build issues for --disable-tcache.
-  - Don't mangle pthread_create() when --with-private-namespace is specified.
-
-* 2.2.5 (November 14, 2011)
-
-  Bug fixes:
-  - Fix huge_ralloc() race when using mremap(2).  This is a serious bug that
-    could cause memory corruption and/or crashes.
-  - Fix huge_ralloc() to maintain chunk statistics.
-  - Fix malloc_stats_print(..., "a") output.
-
-* 2.2.4 (November 5, 2011)
-
-  Bug fixes:
-  - Initialize arenas_tsd before using it.  This bug existed for 2.2.[0-3], as
-    well as for --disable-tls builds in earlier releases.
-  - Do not assume a 4 KiB page size in test/rallocm.c.
-
-* 2.2.3 (August 31, 2011)
-
-  This version fixes numerous bugs related to heap profiling.
-
-  Bug fixes:
-  - Fix a prof-related race condition.  This bug could cause memory corruption,
-    but only occurred in non-default configurations (prof_accum:false).
-  - Fix off-by-one backtracing issues (make sure that prof_alloc_prep() is
-    excluded from backtraces).
-  - Fix a prof-related bug in realloc() (only triggered by OOM errors).
-  - Fix prof-related bugs in allocm() and rallocm().
-  - Fix prof_tdata_cleanup() for --disable-tls builds.
-  - Fix a relative include path, to fix objdir builds.
-
-* 2.2.2 (July 30, 2011)
-
-  Bug fixes:
-  - Fix a build error for --disable-tcache.
-  - Fix assertions in arena_purge() (for real this time).
-  - Add the --with-private-namespace option.  This is a workaround for symbol
-    conflicts that can inadvertently arise when using static libraries.
-
-* 2.2.1 (March 30, 2011)
-
-  Bug fixes:
-  - Implement atomic operations for x86/x64.  This fixes compilation failures
-    for versions of gcc that are still in wide use.
-  - Fix an assertion in arena_purge().
-
-* 2.2.0 (March 22, 2011)
-
-  This version incorporates several improvements to algorithms and data
-  structures that tend to reduce fragmentation and increase speed.
-
-  New features:
-  - Add the "stats.cactive" mallctl.
-  - Update pprof (from google-perftools 1.7).
-  - Improve backtracing-related configuration logic, and add the
-    --disable-prof-libgcc option.
-
-  Bug fixes:
-  - Change default symbol visibility from "internal", to "hidden", which
-    decreases the overhead of library-internal function calls.
-  - Fix symbol visibility so that it is also set on OS X.
-  - Fix a build dependency regression caused by the introduction of the .pic.o
-    suffix for PIC object files.
-  - Add missing checks for mutex initialization failures.
-  - Don't use libgcc-based backtracing except on x64, where it is known to work.
-  - Fix deadlocks on OS X that were due to memory allocation in
-    pthread_mutex_lock().
-  - Heap profiling-specific fixes:
-    + Fix memory corruption due to integer overflow in small region index
-      computation, when using a small enough sample interval that profiling
-      context pointers are stored in small run headers.
-    + Fix a bootstrap ordering bug that only occurred with TLS disabled.
-    + Fix a rallocm() rsize bug.
-    + Fix error detection bugs for aligned memory allocation.
-
-* 2.1.3 (March 14, 2011)
-
-  Bug fixes:
-  - Fix a cpp logic regression (due to the "thread.{de,}allocatedp" mallctl fix
-    for OS X in 2.1.2).
-  - Fix a "thread.arena" mallctl bug.
-  - Fix a thread cache stats merging bug.
-
-* 2.1.2 (March 2, 2011)
-
-  Bug fixes:
-  - Fix "thread.{de,}allocatedp" mallctl for OS X.
-  - Add missing jemalloc.a to build system.
-
-* 2.1.1 (January 31, 2011)
-
-  Bug fixes:
-  - Fix aligned huge reallocation (affected allocm()).
-  - Fix the ALLOCM_LG_ALIGN macro definition.
-  - Fix a heap dumping deadlock.
-  - Fix a "thread.arena" mallctl bug.
-
-* 2.1.0 (December 3, 2010)
-
-  This version incorporates some optimizations that can't quite be considered
-  bug fixes.
-
-  New features:
-  - Use Linux's mremap(2) for huge object reallocation when possible.
-  - Avoid locking in mallctl*() when possible.
-  - Add the "thread.[de]allocatedp" mallctl's.
-  - Convert the manual page source from roff to DocBook, and generate both roff
-    and HTML manuals.
-
-  Bug fixes:
-  - Fix a crash due to incorrect bootstrap ordering.  This only impacted
-    --enable-debug --enable-dss configurations.
-  - Fix a minor statistics bug for mallctl("swap.avail", ...).
-
-* 2.0.1 (October 29, 2010)
-
-  Bug fixes:
-  - Fix a race condition in heap profiling that could cause undefined behavior
-    if "opt.prof_accum" were disabled.
-  - Add missing mutex unlocks for some OOM error paths in the heap profiling
-    code.
-  - Fix a compilation error for non-C99 builds.
-
-* 2.0.0 (October 24, 2010)
-
-  This version focuses on the experimental *allocm() API, and on improved
-  run-time configuration/introspection.  Nonetheless, numerous performance
-  improvements are also included.
-
-  New features:
-  - Implement the experimental {,r,s,d}allocm() API, which provides a superset
-    of the functionality available via malloc(), calloc(), posix_memalign(),
-    realloc(), malloc_usable_size(), and free().  These functions can be used to
-    allocate/reallocate aligned zeroed memory, ask for optional extra memory
-    during reallocation, prevent object movement during reallocation, etc.
-  - Replace JEMALLOC_OPTIONS/JEMALLOC_PROF_PREFIX with MALLOC_CONF, which is
-    more human-readable, and more flexible.  For example:
-      JEMALLOC_OPTIONS=AJP
-    is now:
-      MALLOC_CONF=abort:true,fill:true,stats_print:true
-  - Port to Apple OS X.  Sponsored by Mozilla.
-  - Make it possible for the application to control thread-->arena mappings via
-    the "thread.arena" mallctl.
-  - Add compile-time support for all TLS-related functionality via pthreads TSD.
-    This is mainly of interest for OS X, which does not support TLS, but has a
-    TSD implementation with similar performance.
-  - Override memalign() and valloc() if they are provided by the system.
-  - Add the "arenas.purge" mallctl, which can be used to synchronously purge all
-    dirty unused pages.
-  - Make cumulative heap profiling data optional, so that it is possible to
-    limit the amount of memory consumed by heap profiling data structures.
-  - Add per thread allocation counters that can be accessed via the
-    "thread.allocated" and "thread.deallocated" mallctls.
-
-  Incompatible changes:
-  - Remove JEMALLOC_OPTIONS and malloc_options (see MALLOC_CONF above).
-  - Increase default backtrace depth from 4 to 128 for heap profiling.
-  - Disable interval-based profile dumps by default.
-
-  Bug fixes:
-  - Remove bad assertions in fork handler functions.  These assertions could
-    cause aborts for some combinations of configure settings.
-  - Fix strerror_r() usage to deal with non-standard semantics in GNU libc.
-  - Fix leak context reporting.  This bug tended to cause the number of contexts
-    to be underreported (though the reported number of objects and bytes were
-    correct).
-  - Fix a realloc() bug for large in-place growing reallocation.  This bug could
-    cause memory corruption, but it was hard to trigger.
-  - Fix an allocation bug for small allocations that could be triggered if
-    multiple threads raced to create a new run of backing pages.
-  - Enhance the heap profiler to trigger samples based on usable size, rather
-    than request size.
-  - Fix a heap profiling bug due to sometimes losing track of requested object
-    size for sampled objects.
-
-* 1.0.3 (August 12, 2010)
-
-  Bug fixes:
-  - Fix the libunwind-based implementation of stack backtracing (used for heap
-    profiling).  This bug could cause zero-length backtraces to be reported.
-  - Add a missing mutex unlock in library initialization code.  If multiple
-    threads raced to initialize malloc, some of them could end up permanently
-    blocked.
-
-* 1.0.2 (May 11, 2010)
-
-  Bug fixes:
-  - Fix junk filling of large objects, which could cause memory corruption.
-  - Add MAP_NORESERVE support for chunk mapping, because otherwise virtual
-    memory limits could cause swap file configuration to fail.  Contributed by
-    Jordan DeLong.
-
-* 1.0.1 (April 14, 2010)
-
-  Bug fixes:
-  - Fix compilation when --enable-fill is specified.
-  - Fix threads-related profiling bugs that affected accuracy and caused memory
-    to be leaked during thread exit.
-  - Fix dirty page purging race conditions that could cause crashes.
-  - Fix crash in tcache flushing code during thread destruction.
-
-* 1.0.0 (April 11, 2010)
-
-  This release focuses on speed and run-time introspection.  Numerous
-  algorithmic improvements make this release substantially faster than its
-  predecessors.
-
-  New features:
-  - Implement autoconf-based configuration system.
-  - Add mallctl*(), for the purposes of introspection and run-time
-    configuration.
-  - Make it possible for the application to manually flush a thread's cache, via
-    the "tcache.flush" mallctl.
-  - Base maximum dirty page count on proportion of active memory.
-  - Compute various additional run-time statistics, including per size class
-    statistics for large objects.
-  - Expose malloc_stats_print(), which can be called repeatedly by the
-    application.
-  - Simplify the malloc_message() signature to only take one string argument,
-    and incorporate an opaque data pointer argument for use by the application
-    in combination with malloc_stats_print().
-  - Add support for allocation backed by one or more swap files, and allow the
-    application to disable over-commit if swap files are in use.
-  - Implement allocation profiling and leak checking.
-
-  Removed features:
-  - Remove the dynamic arena rebalancing code, since thread-specific caching
-    reduces its utility.
-
-  Bug fixes:
-  - Modify chunk allocation to work when address space layout randomization
-    (ASLR) is in use.
-  - Fix thread cleanup bugs related to TLS destruction.
-  - Handle 0-size allocation requests in posix_memalign().
-  - Fix a chunk leak.  The leaked chunks were never touched, so this impacted
-    virtual memory usage, but not physical memory usage.
-
-* linux_2008082[78]a (August 27/28, 2008)
-
-  These snapshot releases are the simple result of incorporating Linux-specific
-  support into the FreeBSD malloc sources.
-
---------------------------------------------------------------------------------
-vim:filetype=text:textwidth=80
diff --git a/redis-stable/deps/jemalloc/INSTALL.md b/redis-stable/deps/jemalloc/INSTALL.md
deleted file mode 100644
index ef328c60..00000000
--- a/redis-stable/deps/jemalloc/INSTALL.md
+++ /dev/null
@@ -1,423 +0,0 @@
-Building and installing a packaged release of jemalloc can be as simple as
-typing the following while in the root directory of the source tree:
-
-    ./configure
-    make
-    make install
-
-If building from unpackaged developer sources, the simplest command sequence
-that might work is:
-
-    ./autogen.sh
-    make dist
-    make
-    make install
-
-Note that documentation is not built by the default target because doing so
-would create a dependency on xsltproc in packaged releases, hence the
-requirement to either run 'make dist' or avoid installing docs via the various
-install_* targets documented below.
-
-
-## Advanced configuration
-
-The 'configure' script supports numerous options that allow control of which
-functionality is enabled, where jemalloc is installed, etc.  Optionally, pass
-any of the following arguments (not a definitive list) to 'configure':
-
-* `--help`
-
-    Print a definitive list of options.
-
-* `--prefix=<install-root-dir>`
-
-    Set the base directory in which to install.  For example:
-
-        ./configure --prefix=/usr/local
-
-    will cause files to be installed into /usr/local/include, /usr/local/lib,
-    and /usr/local/man.
-
-* `--with-version=(<major>.<minor>.<bugfix>-<nrev>-g<gid>|VERSION)`
-
-    The VERSION file is mandatory for successful configuration, and the
-    following steps are taken to assure its presence:
-    1) If --with-version=<major>.<minor>.<bugfix>-<nrev>-g<gid> is specified,
-       generate VERSION using the specified value.
-    2) If --with-version is not specified in either form and the source
-       directory is inside a git repository, try to generate VERSION via 'git
-       describe' invocations that pattern-match release tags.
-    3) If VERSION is missing, generate it with a bogus version:
-       0.0.0-0-g0000000000000000000000000000000000000000
-
-    Note that --with-version=VERSION bypasses (1) and (2), which simplifies
-    VERSION configuration when embedding a jemalloc release into another
-    project's git repository.
-
-* `--with-rpath=<colon-separated-rpath>`
-
-    Embed one or more library paths, so that libjemalloc can find the libraries
-    it is linked to.  This works only on ELF-based systems.
-
-* `--with-mangling=<map>`
-
-    Mangle public symbols specified in <map> which is a comma-separated list of
-    name:mangled pairs.
-
-    For example, to use ld's --wrap option as an alternative method for
-    overriding libc's malloc implementation, specify something like:
-
-      --with-mangling=malloc:__wrap_malloc,free:__wrap_free[...]
-
-    Note that mangling happens prior to application of the prefix specified by
-    --with-jemalloc-prefix, and mangled symbols are then ignored when applying
-    the prefix.
-
-* `--with-jemalloc-prefix=<prefix>`
-
-    Prefix all public APIs with <prefix>.  For example, if <prefix> is
-    "prefix_", API changes like the following occur:
-
-      malloc()         --> prefix_malloc()
-      malloc_conf      --> prefix_malloc_conf
-      /etc/malloc.conf --> /etc/prefix_malloc.conf
-      MALLOC_CONF      --> PREFIX_MALLOC_CONF
-
-    This makes it possible to use jemalloc at the same time as the system
-    allocator, or even to use multiple copies of jemalloc simultaneously.
-
-    By default, the prefix is "", except on OS X, where it is "je_".  On OS X,
-    jemalloc overlays the default malloc zone, but makes no attempt to actually
-    replace the "malloc", "calloc", etc. symbols.
-
-* `--without-export`
-
-    Don't export public APIs.  This can be useful when building jemalloc as a
-    static library, or to avoid exporting public APIs when using the zone
-    allocator on OSX.
-
-* `--with-private-namespace=<prefix>`
-
-    Prefix all library-private APIs with <prefix>je_.  For shared libraries,
-    symbol visibility mechanisms prevent these symbols from being exported, but
-    for static libraries, naming collisions are a real possibility.  By
-    default, <prefix> is empty, which results in a symbol prefix of je_ .
-
-* `--with-install-suffix=<suffix>`
-
-    Append <suffix> to the base name of all installed files, such that multiple
-    versions of jemalloc can coexist in the same installation directory.  For
-    example, libjemalloc.so.0 becomes libjemalloc<suffix>.so.0.
-
-* `--with-malloc-conf=<malloc_conf>`
-
-    Embed `<malloc_conf>` as a run-time options string that is processed prior to
-    the malloc_conf global variable, the /etc/malloc.conf symlink, and the
-    MALLOC_CONF environment variable.  For example, to change the default decay
-    time to 30 seconds:
-
-      --with-malloc-conf=decay_ms:30000
-
-* `--enable-debug`
-
-    Enable assertions and validation code.  This incurs a substantial
-    performance hit, but is very useful during application development.
-
-* `--disable-stats`
-
-    Disable statistics gathering functionality.  See the "opt.stats_print"
-    option documentation for usage details.
-
-* `--enable-prof`
-
-    Enable heap profiling and leak detection functionality.  See the "opt.prof"
-    option documentation for usage details.  When enabled, there are several
-    approaches to backtracing, and the configure script chooses the first one
-    in the following list that appears to function correctly:
-
-    + libunwind      (requires --enable-prof-libunwind)
-    + libgcc         (unless --disable-prof-libgcc)
-    + gcc intrinsics (unless --disable-prof-gcc)
-
-* `--enable-prof-libunwind`
-
-    Use the libunwind library (http://www.nongnu.org/libunwind/) for stack
-    backtracing.
-
-* `--disable-prof-libgcc`
-
-    Disable the use of libgcc's backtracing functionality.
-
-* `--disable-prof-gcc`
-
-    Disable the use of gcc intrinsics for backtracing.
-
-* `--with-static-libunwind=<libunwind.a>`
-
-    Statically link against the specified libunwind.a rather than dynamically
-    linking with -lunwind.
-
-* `--disable-fill`
-
-    Disable support for junk/zero filling of memory.  See the "opt.junk" and
-    "opt.zero" option documentation for usage details.
-
-* `--disable-zone-allocator`
-
-    Disable zone allocator for Darwin.  This means jemalloc won't be hooked as
-    the default allocator on OSX/iOS.
-
-* `--enable-utrace`
-
-    Enable utrace(2)-based allocation tracing.  This feature is not broadly
-    portable (FreeBSD has it, but Linux and OS X do not).
-
-* `--enable-xmalloc`
-
-    Enable support for optional immediate termination due to out-of-memory
-    errors, as is commonly implemented by "xmalloc" wrapper function for malloc.
-    See the "opt.xmalloc" option documentation for usage details.
-
-* `--enable-lazy-lock`
-
-    Enable code that wraps pthread_create() to detect when an application
-    switches from single-threaded to multi-threaded mode, so that it can avoid
-    mutex locking/unlocking operations while in single-threaded mode.  In
-    practice, this feature usually has little impact on performance unless
-    thread-specific caching is disabled.
-
-* `--disable-cache-oblivious`
-
-    Disable cache-oblivious large allocation alignment for large allocation
-    requests with no alignment constraints.  If this feature is disabled, all
-    large allocations are page-aligned as an implementation artifact, which can
-    severely harm CPU cache utilization.  However, the cache-oblivious layout
-    comes at the cost of one extra page per large allocation, which in the
-    most extreme case increases physical memory usage for the 16 KiB size class
-    to 20 KiB.
-
-* `--disable-syscall`
-
-    Disable use of syscall(2) rather than {open,read,write,close}(2).  This is
-    intended as a workaround for systems that place security limitations on
-    syscall(2).
-
-* `--disable-cxx`
-
-    Disable C++ integration.  This will cause new and delete operator
-    implementations to be omitted.
-
-* `--with-xslroot=<path>`
-
-    Specify where to find DocBook XSL stylesheets when building the
-    documentation.
-
-* `--with-lg-page=<lg-page>`
-
-    Specify the base 2 log of the allocator page size, which must in turn be at
-    least as large as the system page size.  By default the configure script
-    determines the host's page size and sets the allocator page size equal to
-    the system page size, so this option need not be specified unless the
-    system page size may change between configuration and execution, e.g. when
-    cross compiling.
-
-* `--with-lg-page-sizes=<lg-page-sizes>`
-
-    Specify the comma-separated base 2 logs of the page sizes to support.  This
-    option may be useful when cross compiling in combination with
-    `--with-lg-page`, but its primary use case is for integration with FreeBSD's
-    libc, wherein jemalloc is embedded.
-
-* `--with-lg-hugepage=<lg-hugepage>`
-
-    Specify the base 2 log of the system huge page size.  This option is useful
-    when cross compiling, or when overriding the default for systems that do
-    not explicitly support huge pages.
-
-* `--with-lg-quantum=<lg-quantum>`
-
-    Specify the base 2 log of the minimum allocation alignment.  jemalloc needs
-    to know the minimum alignment that meets the following C standard
-    requirement (quoted from the April 12, 2011 draft of the C11 standard):
-
-    >  The pointer returned if the allocation succeeds is suitably aligned so
-      that it may be assigned to a pointer to any type of object with a
-      fundamental alignment requirement and then used to access such an object
-      or an array of such objects in the space allocated [...]
-
-    This setting is architecture-specific, and although jemalloc includes known
-    safe values for the most commonly used modern architectures, there is a
-    wrinkle related to GNU libc (glibc) that may impact your choice of
-    <lg-quantum>.  On most modern architectures, this mandates 16-byte
-    alignment (<lg-quantum>=4), but the glibc developers chose not to meet this
-    requirement for performance reasons.  An old discussion can be found at
-    <https://sourceware.org/bugzilla/show_bug.cgi?id=206> .  Unlike glibc,
-    jemalloc does follow the C standard by default (caveat: jemalloc
-    technically cheats for size classes smaller than the quantum), but the fact
-    that Linux systems already work around this allocator noncompliance means
-    that it is generally safe in practice to let jemalloc's minimum alignment
-    follow glibc's lead.  If you specify `--with-lg-quantum=3` during
-    configuration, jemalloc will provide additional size classes that are not
-    16-byte-aligned (24, 40, and 56).
-
-* `--with-lg-vaddr=<lg-vaddr>`
-
-    Specify the number of significant virtual address bits.  By default, the
-    configure script attempts to detect virtual address size on those platforms
-    where it knows how, and picks a default otherwise.  This option may be
-    useful when cross-compiling.
-
-* `--disable-initial-exec-tls`
-
-    Disable the initial-exec TLS model for jemalloc's internal thread-local
-    storage (on those platforms that support explicit settings).  This can allow
-    jemalloc to be dynamically loaded after program startup (e.g. using dlopen).
-    Note that in this case, there will be two malloc implementations operating
-    in the same process, which will almost certainly result in confusing runtime
-    crashes if pointers leak from one implementation to the other.
-
-The following environment variables (not a definitive list) impact configure's
-behavior:
-
-* `CFLAGS="?"`
-* `CXXFLAGS="?"`
-
-    Pass these flags to the C/C++ compiler.  Any flags set by the configure
-    script are prepended, which means explicitly set flags generally take
-    precedence.  Take care when specifying flags such as -Werror, because
-    configure tests may be affected in undesirable ways.
-
-* `EXTRA_CFLAGS="?"`
-* `EXTRA_CXXFLAGS="?"`
-
-    Append these flags to CFLAGS/CXXFLAGS, without passing them to the
-    compiler(s) during configuration.  This makes it possible to add flags such
-    as -Werror, while allowing the configure script to determine what other
-    flags are appropriate for the specified configuration.
-
-* `CPPFLAGS="?"`
-
-    Pass these flags to the C preprocessor.  Note that CFLAGS is not passed to
-    'cpp' when 'configure' is looking for include files, so you must use
-    CPPFLAGS instead if you need to help 'configure' find header files.
-
-* `LD_LIBRARY_PATH="?"`
-
-    'ld' uses this colon-separated list to find libraries.
-
-* `LDFLAGS="?"`
-
-    Pass these flags when linking.
-
-* `PATH="?"`
-
-    'configure' uses this to find programs.
-
-In some cases it may be necessary to work around configuration results that do
-not match reality.  For example, Linux 4.5 added support for the MADV_FREE flag
-to madvise(2), which can cause problems if building on a host with MADV_FREE
-support and deploying to a target without.  To work around this, use a cache
-file to override the relevant configuration variable defined in configure.ac,
-e.g.:
-
-    echo "je_cv_madv_free=no" > config.cache && ./configure -C
-
-
-## Advanced compilation
-
-To build only parts of jemalloc, use the following targets:
-
-    build_lib_shared
-    build_lib_static
-    build_lib
-    build_doc_html
-    build_doc_man
-    build_doc
-
-To install only parts of jemalloc, use the following targets:
-
-    install_bin
-    install_include
-    install_lib_shared
-    install_lib_static
-    install_lib_pc
-    install_lib
-    install_doc_html
-    install_doc_man
-    install_doc
-
-To clean up build results to varying degrees, use the following make targets:
-
-    clean
-    distclean
-    relclean
-
-
-## Advanced installation
-
-Optionally, define make variables when invoking make, including (not
-exclusively):
-
-* `INCLUDEDIR="?"`
-
-    Use this as the installation prefix for header files.
-
-* `LIBDIR="?"`
-
-    Use this as the installation prefix for libraries.
-
-* `MANDIR="?"`
-
-    Use this as the installation prefix for man pages.
-
-* `DESTDIR="?"`
-
-    Prepend DESTDIR to INCLUDEDIR, LIBDIR, DATADIR, and MANDIR.  This is useful
-    when installing to a different path than was specified via --prefix.
-
-* `CC="?"`
-
-    Use this to invoke the C compiler.
-
-* `CFLAGS="?"`
-
-    Pass these flags to the compiler.
-
-* `CPPFLAGS="?"`
-
-    Pass these flags to the C preprocessor.
-
-* `LDFLAGS="?"`
-
-    Pass these flags when linking.
-
-* `PATH="?"`
-
-    Use this to search for programs used during configuration and building.
-
-
-## Development
-
-If you intend to make non-trivial changes to jemalloc, use the 'autogen.sh'
-script rather than 'configure'.  This re-generates 'configure', enables
-configuration dependency rules, and enables re-generation of automatically
-generated source files.
-
-The build system supports using an object directory separate from the source
-tree.  For example, you can create an 'obj' directory, and from within that
-directory, issue configuration and build commands:
-
-    autoconf
-    mkdir obj
-    cd obj
-    ../configure --enable-autogen
-    make
-
-
-## Documentation
-
-The manual page is generated in both html and roff formats.  Any web browser
-can be used to view the html manual.  The roff manual page can be formatted
-prior to installation via the following command:
-
-    nroff -man -t doc/jemalloc.3
diff --git a/redis-stable/deps/jemalloc/Makefile.in b/redis-stable/deps/jemalloc/Makefile.in
deleted file mode 100644
index 9b9347ff..00000000
--- a/redis-stable/deps/jemalloc/Makefile.in
+++ /dev/null
@@ -1,569 +0,0 @@
-# Clear out all vpaths, then set just one (default vpath) for the main build
-# directory.
-vpath
-vpath % .
-
-# Clear the default suffixes, so that built-in rules are not used.
-.SUFFIXES :
-
-SHELL := /bin/sh
-
-CC := @CC@
-CXX := @CXX@
-
-# Configuration parameters.
-DESTDIR =
-BINDIR := $(DESTDIR)@BINDIR@
-INCLUDEDIR := $(DESTDIR)@INCLUDEDIR@
-LIBDIR := $(DESTDIR)@LIBDIR@
-DATADIR := $(DESTDIR)@DATADIR@
-MANDIR := $(DESTDIR)@MANDIR@
-srcroot := @srcroot@
-objroot := @objroot@
-abs_srcroot := @abs_srcroot@
-abs_objroot := @abs_objroot@
-
-# Build parameters.
-CPPFLAGS := @CPPFLAGS@ -I$(objroot)include -I$(srcroot)include
-CONFIGURE_CFLAGS := @CONFIGURE_CFLAGS@
-SPECIFIED_CFLAGS := @SPECIFIED_CFLAGS@
-EXTRA_CFLAGS := @EXTRA_CFLAGS@
-CFLAGS := $(strip $(CONFIGURE_CFLAGS) $(SPECIFIED_CFLAGS) $(EXTRA_CFLAGS))
-CONFIGURE_CXXFLAGS := @CONFIGURE_CXXFLAGS@
-SPECIFIED_CXXFLAGS := @SPECIFIED_CXXFLAGS@
-EXTRA_CXXFLAGS := @EXTRA_CXXFLAGS@
-CXXFLAGS := $(strip $(CONFIGURE_CXXFLAGS) $(SPECIFIED_CXXFLAGS) $(EXTRA_CXXFLAGS))
-LDFLAGS := @LDFLAGS@
-EXTRA_LDFLAGS := @EXTRA_LDFLAGS@
-LIBS := @LIBS@
-RPATH_EXTRA := @RPATH_EXTRA@
-SO := @so@
-IMPORTLIB := @importlib@
-O := @o@
-A := @a@
-EXE := @exe@
-LIBPREFIX := @libprefix@
-REV := @rev@
-install_suffix := @install_suffix@
-ABI := @abi@
-XSLTPROC := @XSLTPROC@
-AUTOCONF := @AUTOCONF@
-_RPATH = @RPATH@
-RPATH = $(if $(1),$(call _RPATH,$(1)))
-cfghdrs_in := $(addprefix $(srcroot),@cfghdrs_in@)
-cfghdrs_out := @cfghdrs_out@
-cfgoutputs_in := $(addprefix $(srcroot),@cfgoutputs_in@)
-cfgoutputs_out := @cfgoutputs_out@
-enable_autogen := @enable_autogen@
-enable_prof := @enable_prof@
-enable_zone_allocator := @enable_zone_allocator@
-MALLOC_CONF := @JEMALLOC_CPREFIX@MALLOC_CONF
-link_whole_archive := @link_whole_archive@
-DSO_LDFLAGS = @DSO_LDFLAGS@
-SOREV = @SOREV@
-PIC_CFLAGS = @PIC_CFLAGS@
-CTARGET = @CTARGET@
-LDTARGET = @LDTARGET@
-TEST_LD_MODE = @TEST_LD_MODE@
-MKLIB = @MKLIB@
-AR = @AR@
-ARFLAGS = @ARFLAGS@
-DUMP_SYMS = @DUMP_SYMS@
-AWK := @AWK@
-CC_MM = @CC_MM@
-LM := @LM@
-INSTALL = @INSTALL@
-
-ifeq (macho, $(ABI))
-TEST_LIBRARY_PATH := DYLD_FALLBACK_LIBRARY_PATH="$(objroot)lib"
-else
-ifeq (pecoff, $(ABI))
-TEST_LIBRARY_PATH := PATH="$(PATH):$(objroot)lib"
-else
-TEST_LIBRARY_PATH :=
-endif
-endif
-
-LIBJEMALLOC := $(LIBPREFIX)jemalloc$(install_suffix)
-
-# Lists of files.
-BINS := $(objroot)bin/jemalloc-config $(objroot)bin/jemalloc.sh $(objroot)bin/jeprof
-C_HDRS := $(objroot)include/jemalloc/jemalloc$(install_suffix).h
-C_SRCS := $(srcroot)src/jemalloc.c \
-	$(srcroot)src/arena.c \
-	$(srcroot)src/background_thread.c \
-	$(srcroot)src/base.c \
-	$(srcroot)src/bin.c \
-	$(srcroot)src/bitmap.c \
-	$(srcroot)src/ckh.c \
-	$(srcroot)src/ctl.c \
-	$(srcroot)src/div.c \
-	$(srcroot)src/extent.c \
-	$(srcroot)src/extent_dss.c \
-	$(srcroot)src/extent_mmap.c \
-	$(srcroot)src/hash.c \
-	$(srcroot)src/hooks.c \
-	$(srcroot)src/large.c \
-	$(srcroot)src/log.c \
-	$(srcroot)src/malloc_io.c \
-	$(srcroot)src/mutex.c \
-	$(srcroot)src/mutex_pool.c \
-	$(srcroot)src/nstime.c \
-	$(srcroot)src/pages.c \
-	$(srcroot)src/prng.c \
-	$(srcroot)src/prof.c \
-	$(srcroot)src/rtree.c \
-	$(srcroot)src/stats.c \
-	$(srcroot)src/sz.c \
-	$(srcroot)src/tcache.c \
-	$(srcroot)src/ticker.c \
-	$(srcroot)src/tsd.c \
-	$(srcroot)src/witness.c
-ifeq ($(enable_zone_allocator), 1)
-C_SRCS += $(srcroot)src/zone.c
-endif
-ifeq ($(IMPORTLIB),$(SO))
-STATIC_LIBS := $(objroot)lib/$(LIBJEMALLOC).$(A)
-endif
-ifdef PIC_CFLAGS
-STATIC_LIBS += $(objroot)lib/$(LIBJEMALLOC)_pic.$(A)
-else
-STATIC_LIBS += $(objroot)lib/$(LIBJEMALLOC)_s.$(A)
-endif
-DSOS := $(objroot)lib/$(LIBJEMALLOC).$(SOREV)
-ifneq ($(SOREV),$(SO))
-DSOS += $(objroot)lib/$(LIBJEMALLOC).$(SO)
-endif
-ifeq (1, $(link_whole_archive))
-LJEMALLOC := -Wl,--whole-archive -L$(objroot)lib -l$(LIBJEMALLOC) -Wl,--no-whole-archive
-else
-LJEMALLOC := $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
-endif
-PC := $(objroot)jemalloc.pc
-MAN3 := $(objroot)doc/jemalloc$(install_suffix).3
-DOCS_XML := $(objroot)doc/jemalloc$(install_suffix).xml
-DOCS_HTML := $(DOCS_XML:$(objroot)%.xml=$(objroot)%.html)
-DOCS_MAN3 := $(DOCS_XML:$(objroot)%.xml=$(objroot)%.3)
-DOCS := $(DOCS_HTML) $(DOCS_MAN3)
-C_TESTLIB_SRCS := $(srcroot)test/src/btalloc.c $(srcroot)test/src/btalloc_0.c \
-	$(srcroot)test/src/btalloc_1.c $(srcroot)test/src/math.c \
-	$(srcroot)test/src/mtx.c $(srcroot)test/src/mq.c \
-	$(srcroot)test/src/SFMT.c $(srcroot)test/src/test.c \
-	$(srcroot)test/src/thd.c $(srcroot)test/src/timer.c
-ifeq (1, $(link_whole_archive))
-C_UTIL_INTEGRATION_SRCS :=
-C_UTIL_CPP_SRCS :=
-else
-C_UTIL_INTEGRATION_SRCS := $(srcroot)src/nstime.c $(srcroot)src/malloc_io.c
-C_UTIL_CPP_SRCS := $(srcroot)src/nstime.c $(srcroot)src/malloc_io.c
-endif
-TESTS_UNIT := \
-	$(srcroot)test/unit/a0.c \
-	$(srcroot)test/unit/arena_reset.c \
-	$(srcroot)test/unit/atomic.c \
-	$(srcroot)test/unit/background_thread.c \
-	$(srcroot)test/unit/background_thread_enable.c \
-	$(srcroot)test/unit/base.c \
-	$(srcroot)test/unit/bitmap.c \
-	$(srcroot)test/unit/ckh.c \
-	$(srcroot)test/unit/decay.c \
-	$(srcroot)test/unit/div.c \
-	$(srcroot)test/unit/emitter.c \
-	$(srcroot)test/unit/extent_quantize.c \
-	$(srcroot)test/unit/fork.c \
-	$(srcroot)test/unit/hash.c \
-	$(srcroot)test/unit/hooks.c \
-	$(srcroot)test/unit/junk.c \
-	$(srcroot)test/unit/junk_alloc.c \
-	$(srcroot)test/unit/junk_free.c \
-	$(srcroot)test/unit/log.c \
-	$(srcroot)test/unit/mallctl.c \
-	$(srcroot)test/unit/malloc_io.c \
-	$(srcroot)test/unit/math.c \
-	$(srcroot)test/unit/mq.c \
-	$(srcroot)test/unit/mtx.c \
-	$(srcroot)test/unit/pack.c \
-	$(srcroot)test/unit/pages.c \
-	$(srcroot)test/unit/ph.c \
-	$(srcroot)test/unit/prng.c \
-	$(srcroot)test/unit/prof_accum.c \
-	$(srcroot)test/unit/prof_active.c \
-	$(srcroot)test/unit/prof_gdump.c \
-	$(srcroot)test/unit/prof_idump.c \
-	$(srcroot)test/unit/prof_reset.c \
-	$(srcroot)test/unit/prof_tctx.c \
-	$(srcroot)test/unit/prof_thread_name.c \
-	$(srcroot)test/unit/ql.c \
-	$(srcroot)test/unit/qr.c \
-	$(srcroot)test/unit/rb.c \
-	$(srcroot)test/unit/retained.c \
-	$(srcroot)test/unit/rtree.c \
-	$(srcroot)test/unit/SFMT.c \
-	$(srcroot)test/unit/size_classes.c \
-	$(srcroot)test/unit/slab.c \
-	$(srcroot)test/unit/smoothstep.c \
-	$(srcroot)test/unit/spin.c \
-	$(srcroot)test/unit/stats.c \
-	$(srcroot)test/unit/stats_print.c \
-	$(srcroot)test/unit/ticker.c \
-	$(srcroot)test/unit/nstime.c \
-	$(srcroot)test/unit/tsd.c \
-	$(srcroot)test/unit/witness.c \
-	$(srcroot)test/unit/zero.c
-ifeq (@enable_prof@, 1)
-TESTS_UNIT += \
-	$(srcroot)test/unit/arena_reset_prof.c
-endif
-TESTS_INTEGRATION := $(srcroot)test/integration/aligned_alloc.c \
-	$(srcroot)test/integration/allocated.c \
-	$(srcroot)test/integration/extent.c \
-	$(srcroot)test/integration/mallocx.c \
-	$(srcroot)test/integration/MALLOCX_ARENA.c \
-	$(srcroot)test/integration/overflow.c \
-	$(srcroot)test/integration/posix_memalign.c \
-	$(srcroot)test/integration/rallocx.c \
-	$(srcroot)test/integration/sdallocx.c \
-	$(srcroot)test/integration/thread_arena.c \
-	$(srcroot)test/integration/thread_tcache_enabled.c \
-	$(srcroot)test/integration/xallocx.c
-ifeq (@enable_cxx@, 1)
-CPP_SRCS := $(srcroot)src/jemalloc_cpp.cpp
-TESTS_INTEGRATION_CPP := $(srcroot)test/integration/cpp/basic.cpp
-else
-CPP_SRCS :=
-TESTS_INTEGRATION_CPP :=
-endif
-TESTS_STRESS := $(srcroot)test/stress/microbench.c
-
-TESTS := $(TESTS_UNIT) $(TESTS_INTEGRATION) $(TESTS_INTEGRATION_CPP) $(TESTS_STRESS)
-
-PRIVATE_NAMESPACE_HDRS := $(objroot)include/jemalloc/internal/private_namespace.h $(objroot)include/jemalloc/internal/private_namespace_jet.h
-PRIVATE_NAMESPACE_GEN_HDRS := $(PRIVATE_NAMESPACE_HDRS:%.h=%.gen.h)
-C_SYM_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.sym.$(O))
-C_SYMS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.sym)
-C_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.$(O))
-CPP_OBJS := $(CPP_SRCS:$(srcroot)%.cpp=$(objroot)%.$(O))
-C_PIC_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.pic.$(O))
-CPP_PIC_OBJS := $(CPP_SRCS:$(srcroot)%.cpp=$(objroot)%.pic.$(O))
-C_JET_SYM_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.sym.$(O))
-C_JET_SYMS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.sym)
-C_JET_OBJS := $(C_SRCS:$(srcroot)%.c=$(objroot)%.jet.$(O))
-C_TESTLIB_UNIT_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.unit.$(O))
-C_TESTLIB_INTEGRATION_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.integration.$(O))
-C_UTIL_INTEGRATION_OBJS := $(C_UTIL_INTEGRATION_SRCS:$(srcroot)%.c=$(objroot)%.integration.$(O))
-C_TESTLIB_STRESS_OBJS := $(C_TESTLIB_SRCS:$(srcroot)%.c=$(objroot)%.stress.$(O))
-C_TESTLIB_OBJS := $(C_TESTLIB_UNIT_OBJS) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(C_TESTLIB_STRESS_OBJS)
-
-TESTS_UNIT_OBJS := $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%.$(O))
-TESTS_INTEGRATION_OBJS := $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%.$(O))
-TESTS_INTEGRATION_CPP_OBJS := $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%.$(O))
-TESTS_STRESS_OBJS := $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%.$(O))
-TESTS_OBJS := $(TESTS_UNIT_OBJS) $(TESTS_INTEGRATION_OBJS) $(TESTS_STRESS_OBJS)
-TESTS_CPP_OBJS := $(TESTS_INTEGRATION_CPP_OBJS)
-
-.PHONY: all dist build_doc_html build_doc_man build_doc
-.PHONY: install_bin install_include install_lib
-.PHONY: install_doc_html install_doc_man install_doc install
-.PHONY: tests check clean distclean relclean
-
-.SECONDARY : $(PRIVATE_NAMESPACE_GEN_HDRS) $(TESTS_OBJS) $(TESTS_CPP_OBJS)
-
-# Default target.
-all: build_lib
-
-dist: build_doc
-
-$(objroot)doc/%.html : $(objroot)doc/%.xml $(srcroot)doc/stylesheet.xsl $(objroot)doc/html.xsl
-	$(XSLTPROC) -o $@ $(objroot)doc/html.xsl $<
-
-$(objroot)doc/%.3 : $(objroot)doc/%.xml $(srcroot)doc/stylesheet.xsl $(objroot)doc/manpages.xsl
-	$(XSLTPROC) -o $@ $(objroot)doc/manpages.xsl $<
-
-build_doc_html: $(DOCS_HTML)
-build_doc_man: $(DOCS_MAN3)
-build_doc: $(DOCS)
-
-#
-# Include generated dependency files.
-#
-ifdef CC_MM
--include $(C_SYM_OBJS:%.$(O)=%.d)
--include $(C_OBJS:%.$(O)=%.d)
--include $(CPP_OBJS:%.$(O)=%.d)
--include $(C_PIC_OBJS:%.$(O)=%.d)
--include $(CPP_PIC_OBJS:%.$(O)=%.d)
--include $(C_JET_SYM_OBJS:%.$(O)=%.d)
--include $(C_JET_OBJS:%.$(O)=%.d)
--include $(C_TESTLIB_OBJS:%.$(O)=%.d)
--include $(TESTS_OBJS:%.$(O)=%.d)
--include $(TESTS_CPP_OBJS:%.$(O)=%.d)
-endif
-
-$(C_SYM_OBJS): $(objroot)src/%.sym.$(O): $(srcroot)src/%.c
-$(C_SYM_OBJS): CPPFLAGS += -DJEMALLOC_NO_PRIVATE_NAMESPACE
-$(C_SYMS): $(objroot)src/%.sym: $(objroot)src/%.sym.$(O)
-$(C_OBJS): $(objroot)src/%.$(O): $(srcroot)src/%.c
-$(CPP_OBJS): $(objroot)src/%.$(O): $(srcroot)src/%.cpp
-$(C_PIC_OBJS): $(objroot)src/%.pic.$(O): $(srcroot)src/%.c
-$(C_PIC_OBJS): CFLAGS += $(PIC_CFLAGS)
-$(CPP_PIC_OBJS): $(objroot)src/%.pic.$(O): $(srcroot)src/%.cpp
-$(CPP_PIC_OBJS): CXXFLAGS += $(PIC_CFLAGS)
-$(C_JET_SYM_OBJS): $(objroot)src/%.jet.sym.$(O): $(srcroot)src/%.c
-$(C_JET_SYM_OBJS): CPPFLAGS += -DJEMALLOC_JET -DJEMALLOC_NO_PRIVATE_NAMESPACE
-$(C_JET_SYMS): $(objroot)src/%.jet.sym: $(objroot)src/%.jet.sym.$(O)
-$(C_JET_OBJS): $(objroot)src/%.jet.$(O): $(srcroot)src/%.c
-$(C_JET_OBJS): CPPFLAGS += -DJEMALLOC_JET
-$(C_TESTLIB_UNIT_OBJS): $(objroot)test/src/%.unit.$(O): $(srcroot)test/src/%.c
-$(C_TESTLIB_UNIT_OBJS): CPPFLAGS += -DJEMALLOC_UNIT_TEST
-$(C_TESTLIB_INTEGRATION_OBJS): $(objroot)test/src/%.integration.$(O): $(srcroot)test/src/%.c
-$(C_TESTLIB_INTEGRATION_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_TEST
-$(C_UTIL_INTEGRATION_OBJS): $(objroot)src/%.integration.$(O): $(srcroot)src/%.c
-$(C_TESTLIB_STRESS_OBJS): $(objroot)test/src/%.stress.$(O): $(srcroot)test/src/%.c
-$(C_TESTLIB_STRESS_OBJS): CPPFLAGS += -DJEMALLOC_STRESS_TEST -DJEMALLOC_STRESS_TESTLIB
-$(C_TESTLIB_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
-$(TESTS_UNIT_OBJS): CPPFLAGS += -DJEMALLOC_UNIT_TEST
-$(TESTS_INTEGRATION_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_TEST
-$(TESTS_INTEGRATION_CPP_OBJS): CPPFLAGS += -DJEMALLOC_INTEGRATION_CPP_TEST
-$(TESTS_STRESS_OBJS): CPPFLAGS += -DJEMALLOC_STRESS_TEST
-$(TESTS_OBJS): $(objroot)test/%.$(O): $(srcroot)test/%.c
-$(TESTS_CPP_OBJS): $(objroot)test/%.$(O): $(srcroot)test/%.cpp
-$(TESTS_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
-$(TESTS_CPP_OBJS): CPPFLAGS += -I$(srcroot)test/include -I$(objroot)test/include
-ifneq ($(IMPORTLIB),$(SO))
-$(CPP_OBJS) $(C_SYM_OBJS) $(C_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS): CPPFLAGS += -DDLLEXPORT
-endif
-
-# Dependencies.
-ifndef CC_MM
-HEADER_DIRS = $(srcroot)include/jemalloc/internal \
-	$(objroot)include/jemalloc $(objroot)include/jemalloc/internal
-HEADERS = $(filter-out $(PRIVATE_NAMESPACE_HDRS),$(wildcard $(foreach dir,$(HEADER_DIRS),$(dir)/*.h)))
-$(C_SYM_OBJS) $(C_OBJS) $(CPP_OBJS) $(C_PIC_OBJS) $(CPP_PIC_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS) $(C_TESTLIB_OBJS) $(TESTS_OBJS) $(TESTS_CPP_OBJS): $(HEADERS)
-$(TESTS_OBJS) $(TESTS_CPP_OBJS): $(objroot)test/include/test/jemalloc_test.h
-endif
-
-$(C_OBJS) $(CPP_OBJS) $(C_PIC_OBJS) $(CPP_PIC_OBJS) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(TESTS_INTEGRATION_OBJS) $(TESTS_INTEGRATION_CPP_OBJS): $(objroot)include/jemalloc/internal/private_namespace.h
-$(C_JET_OBJS) $(C_TESTLIB_UNIT_OBJS) $(C_TESTLIB_STRESS_OBJS) $(TESTS_UNIT_OBJS) $(TESTS_STRESS_OBJS): $(objroot)include/jemalloc/internal/private_namespace_jet.h
-
-$(C_SYM_OBJS) $(C_OBJS) $(C_PIC_OBJS) $(C_JET_SYM_OBJS) $(C_JET_OBJS) $(C_TESTLIB_OBJS) $(TESTS_OBJS): %.$(O):
-	@mkdir -p $(@D)
-	$(CC) $(CFLAGS) -c $(CPPFLAGS) $(CTARGET) $<
-ifdef CC_MM
-	@$(CC) -MM $(CPPFLAGS) -MT $@ -o $(@:%.$(O)=%.d) $<
-endif
-
-$(C_SYMS): %.sym:
-	@mkdir -p $(@D)
-	$(DUMP_SYMS) $< | $(AWK) -f $(objroot)include/jemalloc/internal/private_symbols.awk > $@
-
-$(C_JET_SYMS): %.sym:
-	@mkdir -p $(@D)
-	$(DUMP_SYMS) $< | $(AWK) -f $(objroot)include/jemalloc/internal/private_symbols_jet.awk > $@
-
-$(objroot)include/jemalloc/internal/private_namespace.gen.h: $(C_SYMS)
-	$(SHELL) $(srcroot)include/jemalloc/internal/private_namespace.sh $^ > $@
-
-$(objroot)include/jemalloc/internal/private_namespace_jet.gen.h: $(C_JET_SYMS)
-	$(SHELL) $(srcroot)include/jemalloc/internal/private_namespace.sh $^ > $@
-
-%.h: %.gen.h
-	@if ! `cmp -s $< $@` ; then echo "cp $< $<"; cp $< $@ ; fi
-
-$(CPP_OBJS) $(CPP_PIC_OBJS) $(TESTS_CPP_OBJS): %.$(O):
-	@mkdir -p $(@D)
-	$(CXX) $(CXXFLAGS) -c $(CPPFLAGS) $(CTARGET) $<
-ifdef CC_MM
-	@$(CXX) -MM $(CPPFLAGS) -MT $@ -o $(@:%.$(O)=%.d) $<
-endif
-
-ifneq ($(SOREV),$(SO))
-%.$(SO) : %.$(SOREV)
-	@mkdir -p $(@D)
-	ln -sf $(<F) $@
-endif
-
-$(objroot)lib/$(LIBJEMALLOC).$(SOREV) : $(if $(PIC_CFLAGS),$(C_PIC_OBJS),$(C_OBJS)) $(if $(PIC_CFLAGS),$(CPP_PIC_OBJS),$(CPP_OBJS))
-	@mkdir -p $(@D)
-	$(CC) $(DSO_LDFLAGS) $(call RPATH,$(RPATH_EXTRA)) $(LDTARGET) $+ $(LDFLAGS) $(LIBS) $(EXTRA_LDFLAGS)
-
-$(objroot)lib/$(LIBJEMALLOC)_pic.$(A) : $(C_PIC_OBJS) $(CPP_PIC_OBJS)
-$(objroot)lib/$(LIBJEMALLOC).$(A) : $(C_OBJS) $(CPP_OBJS)
-$(objroot)lib/$(LIBJEMALLOC)_s.$(A) : $(C_OBJS) $(CPP_OBJS)
-
-$(STATIC_LIBS):
-	@mkdir -p $(@D)
-	$(AR) $(ARFLAGS)@AROUT@ $+
-
-$(objroot)test/unit/%$(EXE): $(objroot)test/unit/%.$(O) $(C_JET_OBJS) $(C_TESTLIB_UNIT_OBJS)
-	@mkdir -p $(@D)
-	$(CC) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(LDFLAGS) $(filter-out -lm,$(LIBS)) $(LM) $(EXTRA_LDFLAGS)
-
-$(objroot)test/integration/%$(EXE): $(objroot)test/integration/%.$(O) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
-	@mkdir -p $(@D)
-	$(CC) $(TEST_LD_MODE) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(LJEMALLOC) $(LDFLAGS) $(filter-out -lm,$(filter -lrt -lpthread -lstdc++,$(LIBS))) $(LM) $(EXTRA_LDFLAGS)
-
-$(objroot)test/integration/cpp/%$(EXE): $(objroot)test/integration/cpp/%.$(O) $(C_TESTLIB_INTEGRATION_OBJS) $(C_UTIL_INTEGRATION_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
-	@mkdir -p $(@D)
-	$(CXX) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB) $(LDFLAGS) $(filter-out -lm,$(LIBS)) -lm $(EXTRA_LDFLAGS)
-
-$(objroot)test/stress/%$(EXE): $(objroot)test/stress/%.$(O) $(C_JET_OBJS) $(C_TESTLIB_STRESS_OBJS) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB)
-	@mkdir -p $(@D)
-	$(CC) $(TEST_LD_MODE) $(LDTARGET) $(filter %.$(O),$^) $(call RPATH,$(objroot)lib) $(objroot)lib/$(LIBJEMALLOC).$(IMPORTLIB) $(LDFLAGS) $(filter-out -lm,$(LIBS)) $(LM) $(EXTRA_LDFLAGS)
-
-build_lib_shared: $(DSOS)
-build_lib_static: $(STATIC_LIBS)
-build_lib: build_lib_shared build_lib_static
-
-install_bin:
-	$(INSTALL) -d $(BINDIR)
-	@for b in $(BINS); do \
-	echo "$(INSTALL) -m 755 $$b $(BINDIR)"; \
-	$(INSTALL) -m 755 $$b $(BINDIR); \
-done
-
-install_include:
-	$(INSTALL) -d $(INCLUDEDIR)/jemalloc
-	@for h in $(C_HDRS); do \
-	echo "$(INSTALL) -m 644 $$h $(INCLUDEDIR)/jemalloc"; \
-	$(INSTALL) -m 644 $$h $(INCLUDEDIR)/jemalloc; \
-done
-
-install_lib_shared: $(DSOS)
-	$(INSTALL) -d $(LIBDIR)
-	$(INSTALL) -m 755 $(objroot)lib/$(LIBJEMALLOC).$(SOREV) $(LIBDIR)
-ifneq ($(SOREV),$(SO))
-	ln -sf $(LIBJEMALLOC).$(SOREV) $(LIBDIR)/$(LIBJEMALLOC).$(SO)
-endif
-
-install_lib_static: $(STATIC_LIBS)
-	$(INSTALL) -d $(LIBDIR)
-	@for l in $(STATIC_LIBS); do \
-	echo "$(INSTALL) -m 755 $$l $(LIBDIR)"; \
-	$(INSTALL) -m 755 $$l $(LIBDIR); \
-done
-
-install_lib_pc: $(PC)
-	$(INSTALL) -d $(LIBDIR)/pkgconfig
-	@for l in $(PC); do \
-	echo "$(INSTALL) -m 644 $$l $(LIBDIR)/pkgconfig"; \
-	$(INSTALL) -m 644 $$l $(LIBDIR)/pkgconfig; \
-done
-
-install_lib: install_lib_shared install_lib_static install_lib_pc
-
-install_doc_html:
-	$(INSTALL) -d $(DATADIR)/doc/jemalloc$(install_suffix)
-	@for d in $(DOCS_HTML); do \
-	echo "$(INSTALL) -m 644 $$d $(DATADIR)/doc/jemalloc$(install_suffix)"; \
-	$(INSTALL) -m 644 $$d $(DATADIR)/doc/jemalloc$(install_suffix); \
-done
-
-install_doc_man:
-	$(INSTALL) -d $(MANDIR)/man3
-	@for d in $(DOCS_MAN3); do \
-	echo "$(INSTALL) -m 644 $$d $(MANDIR)/man3"; \
-	$(INSTALL) -m 644 $$d $(MANDIR)/man3; \
-done
-
-install_doc: install_doc_html install_doc_man
-
-install: install_bin install_include install_lib install_doc
-
-tests_unit: $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%$(EXE))
-tests_integration: $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%$(EXE)) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%$(EXE))
-tests_stress: $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%$(EXE))
-tests: tests_unit tests_integration tests_stress
-
-check_unit_dir:
-	@mkdir -p $(objroot)test/unit
-check_integration_dir:
-	@mkdir -p $(objroot)test/integration
-stress_dir:
-	@mkdir -p $(objroot)test/stress
-check_dir: check_unit_dir check_integration_dir
-
-check_unit: tests_unit check_unit_dir
-	$(SHELL) $(objroot)test/test.sh $(TESTS_UNIT:$(srcroot)%.c=$(objroot)%)
-check_integration_prof: tests_integration check_integration_dir
-ifeq ($(enable_prof), 1)
-	$(MALLOC_CONF)="prof:true" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
-	$(MALLOC_CONF)="prof:true,prof_active:false" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
-endif
-check_integration_decay: tests_integration check_integration_dir
-	$(MALLOC_CONF)="dirty_decay_ms:-1,muzzy_decay_ms:-1" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
-	$(MALLOC_CONF)="dirty_decay_ms:0,muzzy_decay_ms:0" $(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
-check_integration: tests_integration check_integration_dir
-	$(SHELL) $(objroot)test/test.sh $(TESTS_INTEGRATION:$(srcroot)%.c=$(objroot)%) $(TESTS_INTEGRATION_CPP:$(srcroot)%.cpp=$(objroot)%)
-stress: tests_stress stress_dir
-	$(SHELL) $(objroot)test/test.sh $(TESTS_STRESS:$(srcroot)%.c=$(objroot)%)
-check: check_unit check_integration check_integration_decay check_integration_prof
-
-clean:
-	rm -f $(PRIVATE_NAMESPACE_HDRS)
-	rm -f $(PRIVATE_NAMESPACE_GEN_HDRS)
-	rm -f $(C_SYM_OBJS)
-	rm -f $(C_SYMS)
-	rm -f $(C_OBJS)
-	rm -f $(CPP_OBJS)
-	rm -f $(C_PIC_OBJS)
-	rm -f $(CPP_PIC_OBJS)
-	rm -f $(C_JET_SYM_OBJS)
-	rm -f $(C_JET_SYMS)
-	rm -f $(C_JET_OBJS)
-	rm -f $(C_TESTLIB_OBJS)
-	rm -f $(C_SYM_OBJS:%.$(O)=%.d)
-	rm -f $(C_OBJS:%.$(O)=%.d)
-	rm -f $(CPP_OBJS:%.$(O)=%.d)
-	rm -f $(C_PIC_OBJS:%.$(O)=%.d)
-	rm -f $(CPP_PIC_OBJS:%.$(O)=%.d)
-	rm -f $(C_JET_SYM_OBJS:%.$(O)=%.d)
-	rm -f $(C_JET_OBJS:%.$(O)=%.d)
-	rm -f $(C_TESTLIB_OBJS:%.$(O)=%.d)
-	rm -f $(TESTS_OBJS:%.$(O)=%$(EXE))
-	rm -f $(TESTS_OBJS)
-	rm -f $(TESTS_OBJS:%.$(O)=%.d)
-	rm -f $(TESTS_OBJS:%.$(O)=%.out)
-	rm -f $(TESTS_CPP_OBJS:%.$(O)=%$(EXE))
-	rm -f $(TESTS_CPP_OBJS)
-	rm -f $(TESTS_CPP_OBJS:%.$(O)=%.d)
-	rm -f $(TESTS_CPP_OBJS:%.$(O)=%.out)
-	rm -f $(DSOS) $(STATIC_LIBS)
-
-distclean: clean
-	rm -f $(objroot)bin/jemalloc-config
-	rm -f $(objroot)bin/jemalloc.sh
-	rm -f $(objroot)bin/jeprof
-	rm -f $(objroot)config.log
-	rm -f $(objroot)config.status
-	rm -f $(objroot)config.stamp
-	rm -f $(cfghdrs_out)
-	rm -f $(cfgoutputs_out)
-
-relclean: distclean
-	rm -f $(objroot)configure
-	rm -f $(objroot)VERSION
-	rm -f $(DOCS_HTML)
-	rm -f $(DOCS_MAN3)
-
-#===============================================================================
-# Re-configuration rules.
-
-ifeq ($(enable_autogen), 1)
-$(srcroot)configure : $(srcroot)configure.ac
-	cd ./$(srcroot) && $(AUTOCONF)
-
-$(objroot)config.status : $(srcroot)configure
-	./$(objroot)config.status --recheck
-
-$(srcroot)config.stamp.in : $(srcroot)configure.ac
-	echo stamp > $(srcroot)config.stamp.in
-
-$(objroot)config.stamp : $(cfgoutputs_in) $(cfghdrs_in) $(srcroot)configure
-	./$(objroot)config.status
-	@touch $@
-
-# There must be some action in order for make to re-read Makefile when it is
-# out of date.
-$(cfgoutputs_out) $(cfghdrs_out) : $(objroot)config.stamp
-	@true
-endif
diff --git a/redis-stable/deps/jemalloc/README b/redis-stable/deps/jemalloc/README
deleted file mode 100644
index 3a6e0d27..00000000
--- a/redis-stable/deps/jemalloc/README
+++ /dev/null
@@ -1,20 +0,0 @@
-jemalloc is a general purpose malloc(3) implementation that emphasizes
-fragmentation avoidance and scalable concurrency support.  jemalloc first came
-into use as the FreeBSD libc allocator in 2005, and since then it has found its
-way into numerous applications that rely on its predictable behavior.  In 2010
-jemalloc development efforts broadened to include developer support features
-such as heap profiling and extensive monitoring/tuning hooks.  Modern jemalloc
-releases continue to be integrated back into FreeBSD, and therefore versatility
-remains critical.  Ongoing development efforts trend toward making jemalloc
-among the best allocators for a broad range of demanding applications, and
-eliminating/mitigating weaknesses that have practical repercussions for real
-world applications.
-
-The COPYING file contains copyright and licensing information.
-
-The INSTALL file contains information on how to configure, build, and install
-jemalloc.
-
-The ChangeLog file contains a brief summary of changes for each release.
-
-URL: http://jemalloc.net/
diff --git a/redis-stable/deps/jemalloc/TUNING.md b/redis-stable/deps/jemalloc/TUNING.md
deleted file mode 100644
index 34fca05b..00000000
--- a/redis-stable/deps/jemalloc/TUNING.md
+++ /dev/null
@@ -1,129 +0,0 @@
-This document summarizes the common approaches for performance fine tuning with
-jemalloc (as of 5.1.0).  The default configuration of jemalloc tends to work
-reasonably well in practice, and most applications should not have to tune any
-options. However, in order to cover a wide range of applications and avoid
-pathological cases, the default setting is sometimes kept conservative and
-suboptimal, even for many common workloads.  When jemalloc is properly tuned for
-a specific application / workload, it is common to improve system level metrics
-by a few percent, or make favorable trade-offs.
-
-
-## Notable runtime options for performance tuning
-
-Runtime options can be set via
-[malloc_conf](http://jemalloc.net/jemalloc.3.html#tuning).
-
-* [background_thread](http://jemalloc.net/jemalloc.3.html#background_thread)
-
-    Enabling jemalloc background threads generally improves the tail latency for
-    application threads, since unused memory purging is shifted to the dedicated
-    background threads.  In addition, unintended purging delay caused by
-    application inactivity is avoided with background threads.
-
-    Suggested: `background_thread:true` when jemalloc managed threads can be
-    allowed.
-
-* [metadata_thp](http://jemalloc.net/jemalloc.3.html#opt.metadata_thp)
-
-    Allowing jemalloc to utilize transparent huge pages for its internal
-    metadata usually reduces TLB misses significantly, especially for programs
-    with large memory footprint and frequent allocation / deallocation
-    activities.  Metadata memory usage may increase due to the use of huge
-    pages.
-
-    Suggested for allocation intensive programs: `metadata_thp:auto` or
-    `metadata_thp:always`, which is expected to improve CPU utilization at a
-    small memory cost.
-
-* [dirty_decay_ms](http://jemalloc.net/jemalloc.3.html#opt.dirty_decay_ms) and
-  [muzzy_decay_ms](http://jemalloc.net/jemalloc.3.html#opt.muzzy_decay_ms)
-
-    Decay time determines how fast jemalloc returns unused pages back to the
-    operating system, and therefore provides a fairly straightforward trade-off
-    between CPU and memory usage.  Shorter decay time purges unused pages faster
-    to reduces memory usage (usually at the cost of more CPU cycles spent on
-    purging), and vice versa.
-
-    Suggested: tune the values based on the desired trade-offs.
-
-* [narenas](http://jemalloc.net/jemalloc.3.html#opt.narenas)
-
-    By default jemalloc uses multiple arenas to reduce internal lock contention.
-    However high arena count may also increase overall memory fragmentation,
-    since arenas manage memory independently.  When high degree of parallelism
-    is not expected at the allocator level, lower number of arenas often
-    improves memory usage.
-
-    Suggested: if low parallelism is expected, try lower arena count while
-    monitoring CPU and memory usage.
-
-* [percpu_arena](http://jemalloc.net/jemalloc.3.html#opt.percpu_arena)
-
-    Enable dynamic thread to arena association based on running CPU.  This has
-    the potential to improve locality, e.g. when thread to CPU affinity is
-    present.
-    
-    Suggested: try `percpu_arena:percpu` or `percpu_arena:phycpu` if
-    thread migration between processors is expected to be infrequent.
-
-Examples:
-
-* High resource consumption application, prioritizing CPU utilization:
-
-    `background_thread:true,metadata_thp:auto` combined with relaxed decay time
-    (increased `dirty_decay_ms` and / or `muzzy_decay_ms`,
-    e.g. `dirty_decay_ms:30000,muzzy_decay_ms:30000`).
-
-* High resource consumption application, prioritizing memory usage:
-
-    `background_thread:true` combined with shorter decay time (decreased
-    `dirty_decay_ms` and / or `muzzy_decay_ms`,
-    e.g. `dirty_decay_ms:5000,muzzy_decay_ms:5000`), and lower arena count
-    (e.g. number of CPUs).
-
-* Low resource consumption application:
-
-    `narenas:1,lg_tcache_max:13` combined with shorter decay time (decreased
-    `dirty_decay_ms` and / or `muzzy_decay_ms`,e.g.
-    `dirty_decay_ms:1000,muzzy_decay_ms:0`).
-
-* Extremely conservative -- minimize memory usage at all costs, only suitable when
-allocation activity is very rare:
-
-    `narenas:1,tcache:false,dirty_decay_ms:0,muzzy_decay_ms:0`
-
-Note that it is recommended to combine the options with `abort_conf:true` which
-aborts immediately on illegal options.
-
-## Beyond runtime options
-
-In addition to the runtime options, there are a number of programmatic ways to
-improve application performance with jemalloc.
-
-* [Explicit arenas](http://jemalloc.net/jemalloc.3.html#arenas.create)
-
-    Manually created arenas can help performance in various ways, e.g. by
-    managing locality and contention for specific usages.  For example,
-    applications can explicitly allocate frequently accessed objects from a
-    dedicated arena with
-    [mallocx()](http://jemalloc.net/jemalloc.3.html#MALLOCX_ARENA) to improve
-    locality.  In addition, explicit arenas often benefit from individually
-    tuned options, e.g. relaxed [decay
-    time](http://jemalloc.net/jemalloc.3.html#arena.i.dirty_decay_ms) if
-    frequent reuse is expected.
-
-* [Extent hooks](http://jemalloc.net/jemalloc.3.html#arena.i.extent_hooks)
-
-    Extent hooks allow customization for managing underlying memory.  One use
-    case for performance purpose is to utilize huge pages -- for example,
-    [HHVM](https://github.com/facebook/hhvm/blob/master/hphp/util/alloc.cpp)
-    uses explicit arenas with customized extent hooks to manage 1GB huge pages
-    for frequently accessed data, which reduces TLB misses significantly.
-
-* [Explicit thread-to-arena
-  binding](http://jemalloc.net/jemalloc.3.html#thread.arena)
-
-    It is common for some threads in an application to have different memory
-    access / allocation patterns.  Threads with heavy workloads often benefit
-    from explicit binding, e.g. binding very active threads to dedicated arenas
-    may reduce contention at the allocator level.
diff --git a/redis-stable/deps/jemalloc/autogen.sh b/redis-stable/deps/jemalloc/autogen.sh
deleted file mode 100755
index 75f32da6..00000000
--- a/redis-stable/deps/jemalloc/autogen.sh
+++ /dev/null
@@ -1,17 +0,0 @@
-#!/bin/sh
-
-for i in autoconf; do
-    echo "$i"
-    $i
-    if [ $? -ne 0 ]; then
-	echo "Error $? in $i"
-	exit 1
-    fi
-done
-
-echo "./configure --enable-autogen $@"
-./configure --enable-autogen $@
-if [ $? -ne 0 ]; then
-    echo "Error $? in ./configure"
-    exit 1
-fi
diff --git a/redis-stable/deps/jemalloc/bin/jemalloc-config.in b/redis-stable/deps/jemalloc/bin/jemalloc-config.in
deleted file mode 100644
index 80eca2e6..00000000
--- a/redis-stable/deps/jemalloc/bin/jemalloc-config.in
+++ /dev/null
@@ -1,83 +0,0 @@
-#!/bin/sh
-
-usage() {
-	cat <<EOF
-Usage:
-  @BINDIR@/jemalloc-config <option>
-Options:
-  --help | -h  : Print usage.
-  --version    : Print jemalloc version.
-  --revision   : Print shared library revision number.
-  --config     : Print configure options used to build jemalloc.
-  --prefix     : Print installation directory prefix.
-  --bindir     : Print binary installation directory.
-  --datadir    : Print data installation directory.
-  --includedir : Print include installation directory.
-  --libdir     : Print library installation directory.
-  --mandir     : Print manual page installation directory.
-  --cc         : Print compiler used to build jemalloc.
-  --cflags     : Print compiler flags used to build jemalloc.
-  --cppflags   : Print preprocessor flags used to build jemalloc.
-  --cxxflags   : Print C++ compiler flags used to build jemalloc.
-  --ldflags    : Print library flags used to build jemalloc.
-  --libs       : Print libraries jemalloc was linked against.
-EOF
-}
-
-prefix="@prefix@"
-exec_prefix="@exec_prefix@"
-
-case "$1" in
---help | -h)
-	usage
-	exit 0
-	;;
---version)
-	echo "@jemalloc_version@"
-	;;
---revision)
-	echo "@rev@"
-	;;
---config)
-	echo "@CONFIG@"
-	;;
---prefix)
-	echo "@PREFIX@"
-	;;
---bindir)
-	echo "@BINDIR@"
-	;;
---datadir)
-	echo "@DATADIR@"
-	;;
---includedir)
-	echo "@INCLUDEDIR@"
-	;;
---libdir)
-	echo "@LIBDIR@"
-	;;
---mandir)
-	echo "@MANDIR@"
-	;;
---cc)
-	echo "@CC@"
-	;;
---cflags)
-	echo "@CFLAGS@"
-	;;
---cppflags)
-	echo "@CPPFLAGS@"
-	;;
---cxxflags)
-	echo "@CXXFLAGS@"
-	;;
---ldflags)
-	echo "@LDFLAGS@ @EXTRA_LDFLAGS@"
-	;;
---libs)
-	echo "@LIBS@"
-	;;
-*)
-	usage
-	exit 1
-esac
diff --git a/redis-stable/deps/jemalloc/bin/jemalloc.sh.in b/redis-stable/deps/jemalloc/bin/jemalloc.sh.in
deleted file mode 100644
index cdf36737..00000000
--- a/redis-stable/deps/jemalloc/bin/jemalloc.sh.in
+++ /dev/null
@@ -1,9 +0,0 @@
-#!/bin/sh
-
-prefix=@prefix@
-exec_prefix=@exec_prefix@
-libdir=@libdir@
-
-@LD_PRELOAD_VAR@=${libdir}/libjemalloc.@SOREV@
-export @LD_PRELOAD_VAR@
-exec "$@"
diff --git a/redis-stable/deps/jemalloc/bin/jeprof.in b/redis-stable/deps/jemalloc/bin/jeprof.in
deleted file mode 100644
index 588c6b43..00000000
--- a/redis-stable/deps/jemalloc/bin/jeprof.in
+++ /dev/null
@@ -1,5624 +0,0 @@
-#! /usr/bin/env perl
-
-# Copyright (c) 1998-2007, Google Inc.
-# All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions are
-# met:
-#
-#     * Redistributions of source code must retain the above copyright
-# notice, this list of conditions and the following disclaimer.
-#     * Redistributions in binary form must reproduce the above
-# copyright notice, this list of conditions and the following disclaimer
-# in the documentation and/or other materials provided with the
-# distribution.
-#     * Neither the name of Google Inc. nor the names of its
-# contributors may be used to endorse or promote products derived from
-# this software without specific prior written permission.
-#
-# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-# ---
-# Program for printing the profile generated by common/profiler.cc,
-# or by the heap profiler (common/debugallocation.cc)
-#
-# The profile contains a sequence of entries of the form:
-#       <count> <stack trace>
-# This program parses the profile, and generates user-readable
-# output.
-#
-# Examples:
-#
-# % tools/jeprof "program" "profile"
-#   Enters "interactive" mode
-#
-# % tools/jeprof --text "program" "profile"
-#   Generates one line per procedure
-#
-# % tools/jeprof --gv "program" "profile"
-#   Generates annotated call-graph and displays via "gv"
-#
-# % tools/jeprof --gv --focus=Mutex "program" "profile"
-#   Restrict to code paths that involve an entry that matches "Mutex"
-#
-# % tools/jeprof --gv --focus=Mutex --ignore=string "program" "profile"
-#   Restrict to code paths that involve an entry that matches "Mutex"
-#   and does not match "string"
-#
-# % tools/jeprof --list=IBF_CheckDocid "program" "profile"
-#   Generates disassembly listing of all routines with at least one
-#   sample that match the --list=<regexp> pattern.  The listing is
-#   annotated with the flat and cumulative sample counts at each line.
-#
-# % tools/jeprof --disasm=IBF_CheckDocid "program" "profile"
-#   Generates disassembly listing of all routines with at least one
-#   sample that match the --disasm=<regexp> pattern.  The listing is
-#   annotated with the flat and cumulative sample counts at each PC value.
-#
-# TODO: Use color to indicate files?
-
-use strict;
-use warnings;
-use Getopt::Long;
-use Cwd;
-
-my $JEPROF_VERSION = "@jemalloc_version@";
-my $PPROF_VERSION = "2.0";
-
-# These are the object tools we use which can come from a
-# user-specified location using --tools, from the JEPROF_TOOLS
-# environment variable, or from the environment.
-my %obj_tool_map = (
-  "objdump" => "objdump",
-  "nm" => "nm",
-  "addr2line" => "addr2line",
-  "c++filt" => "c++filt",
-  ## ConfigureObjTools may add architecture-specific entries:
-  #"nm_pdb" => "nm-pdb",       # for reading windows (PDB-format) executables
-  #"addr2line_pdb" => "addr2line-pdb",                                # ditto
-  #"otool" => "otool",         # equivalent of objdump on OS X
-);
-# NOTE: these are lists, so you can put in commandline flags if you want.
-my @DOT = ("dot");          # leave non-absolute, since it may be in /usr/local
-my @GV = ("gv");
-my @EVINCE = ("evince");    # could also be xpdf or perhaps acroread
-my @KCACHEGRIND = ("kcachegrind");
-my @PS2PDF = ("ps2pdf");
-# These are used for dynamic profiles
-my @URL_FETCHER = ("curl", "-s", "--fail");
-
-# These are the web pages that servers need to support for dynamic profiles
-my $HEAP_PAGE = "/pprof/heap";
-my $PROFILE_PAGE = "/pprof/profile";   # must support cgi-param "?seconds=#"
-my $PMUPROFILE_PAGE = "/pprof/pmuprofile(?:\\?.*)?"; # must support cgi-param
-                                                # ?seconds=#&event=x&period=n
-my $GROWTH_PAGE = "/pprof/growth";
-my $CONTENTION_PAGE = "/pprof/contention";
-my $WALL_PAGE = "/pprof/wall(?:\\?.*)?";  # accepts options like namefilter
-my $FILTEREDPROFILE_PAGE = "/pprof/filteredprofile(?:\\?.*)?";
-my $CENSUSPROFILE_PAGE = "/pprof/censusprofile(?:\\?.*)?"; # must support cgi-param
-                                                       # "?seconds=#",
-                                                       # "?tags_regexp=#" and
-                                                       # "?type=#".
-my $SYMBOL_PAGE = "/pprof/symbol";     # must support symbol lookup via POST
-my $PROGRAM_NAME_PAGE = "/pprof/cmdline";
-
-# These are the web pages that can be named on the command line.
-# All the alternatives must begin with /.
-my $PROFILES = "($HEAP_PAGE|$PROFILE_PAGE|$PMUPROFILE_PAGE|" .
-               "$GROWTH_PAGE|$CONTENTION_PAGE|$WALL_PAGE|" .
-               "$FILTEREDPROFILE_PAGE|$CENSUSPROFILE_PAGE)";
-
-# default binary name
-my $UNKNOWN_BINARY = "(unknown)";
-
-# There is a pervasive dependency on the length (in hex characters,
-# i.e., nibbles) of an address, distinguishing between 32-bit and
-# 64-bit profiles.  To err on the safe size, default to 64-bit here:
-my $address_length = 16;
-
-my $dev_null = "/dev/null";
-if (! -e $dev_null && $^O =~ /MSWin/) {    # $^O is the OS perl was built for
-  $dev_null = "nul";
-}
-
-# A list of paths to search for shared object files
-my @prefix_list = ();
-
-# Special routine name that should not have any symbols.
-# Used as separator to parse "addr2line -i" output.
-my $sep_symbol = '_fini';
-my $sep_address = undef;
-
-##### Argument parsing #####
-
-sub usage_string {
-  return <<EOF;
-Usage:
-jeprof [options] <program> <profiles>
-   <profiles> is a space separated list of profile names.
-jeprof [options] <symbolized-profiles>
-   <symbolized-profiles> is a list of profile files where each file contains
-   the necessary symbol mappings  as well as profile data (likely generated
-   with --raw).
-jeprof [options] <profile>
-   <profile> is a remote form.  Symbols are obtained from host:port$SYMBOL_PAGE
-
-   Each name can be:
-   /path/to/profile        - a path to a profile file
-   host:port[/<service>]   - a location of a service to get profile from
-
-   The /<service> can be $HEAP_PAGE, $PROFILE_PAGE, /pprof/pmuprofile,
-                         $GROWTH_PAGE, $CONTENTION_PAGE, /pprof/wall,
-                         $CENSUSPROFILE_PAGE, or /pprof/filteredprofile.
-   For instance:
-     jeprof http://myserver.com:80$HEAP_PAGE
-   If /<service> is omitted, the service defaults to $PROFILE_PAGE (cpu profiling).
-jeprof --symbols <program>
-   Maps addresses to symbol names.  In this mode, stdin should be a
-   list of library mappings, in the same format as is found in the heap-
-   and cpu-profile files (this loosely matches that of /proc/self/maps
-   on linux), followed by a list of hex addresses to map, one per line.
-
-   For more help with querying remote servers, including how to add the
-   necessary server-side support code, see this filename (or one like it):
-
-   /usr/doc/gperftools-$PPROF_VERSION/pprof_remote_servers.html
-
-Options:
-   --cum               Sort by cumulative data
-   --base=<base>       Subtract <base> from <profile> before display
-   --interactive       Run in interactive mode (interactive "help" gives help) [default]
-   --seconds=<n>       Length of time for dynamic profiles [default=30 secs]
-   --add_lib=<file>    Read additional symbols and line info from the given library
-   --lib_prefix=<dir>  Comma separated list of library path prefixes
-
-Reporting Granularity:
-   --addresses         Report at address level
-   --lines             Report at source line level
-   --functions         Report at function level [default]
-   --files             Report at source file level
-
-Output type:
-   --text              Generate text report
-   --callgrind         Generate callgrind format to stdout
-   --gv                Generate Postscript and display
-   --evince            Generate PDF and display
-   --web               Generate SVG and display
-   --list=<regexp>     Generate source listing of matching routines
-   --disasm=<regexp>   Generate disassembly of matching routines
-   --symbols           Print demangled symbol names found at given addresses
-   --dot               Generate DOT file to stdout
-   --ps                Generate Postcript to stdout
-   --pdf               Generate PDF to stdout
-   --svg               Generate SVG to stdout
-   --gif               Generate GIF to stdout
-   --raw               Generate symbolized jeprof data (useful with remote fetch)
-
-Heap-Profile Options:
-   --inuse_space       Display in-use (mega)bytes [default]
-   --inuse_objects     Display in-use objects
-   --alloc_space       Display allocated (mega)bytes
-   --alloc_objects     Display allocated objects
-   --show_bytes        Display space in bytes
-   --drop_negative     Ignore negative differences
-
-Contention-profile options:
-   --total_delay       Display total delay at each region [default]
-   --contentions       Display number of delays at each region
-   --mean_delay        Display mean delay at each region
-
-Call-graph Options:
-   --nodecount=<n>     Show at most so many nodes [default=80]
-   --nodefraction=<f>  Hide nodes below <f>*total [default=.005]
-   --edgefraction=<f>  Hide edges below <f>*total [default=.001]
-   --maxdegree=<n>     Max incoming/outgoing edges per node [default=8]
-   --focus=<regexp>    Focus on backtraces with nodes matching <regexp>
-   --thread=<n>        Show profile for thread <n>
-   --ignore=<regexp>   Ignore backtraces with nodes matching <regexp>
-   --scale=<n>         Set GV scaling [default=0]
-   --heapcheck         Make nodes with non-0 object counts
-                       (i.e. direct leak generators) more visible
-   --retain=<regexp>   Retain only nodes that match <regexp>
-   --exclude=<regexp>  Exclude all nodes that match <regexp>
-
-Miscellaneous:
-   --tools=<prefix or binary:fullpath>[,...]   \$PATH for object tool pathnames
-   --test              Run unit tests
-   --help              This message
-   --version           Version information
-
-Environment Variables:
-   JEPROF_TMPDIR        Profiles directory. Defaults to \$HOME/jeprof
-   JEPROF_TOOLS         Prefix for object tools pathnames
-
-Examples:
-
-jeprof /bin/ls ls.prof
-                       Enters "interactive" mode
-jeprof --text /bin/ls ls.prof
-                       Outputs one line per procedure
-jeprof --web /bin/ls ls.prof
-                       Displays annotated call-graph in web browser
-jeprof --gv /bin/ls ls.prof
-                       Displays annotated call-graph via 'gv'
-jeprof --gv --focus=Mutex /bin/ls ls.prof
-                       Restricts to code paths including a .*Mutex.* entry
-jeprof --gv --focus=Mutex --ignore=string /bin/ls ls.prof
-                       Code paths including Mutex but not string
-jeprof --list=getdir /bin/ls ls.prof
-                       (Per-line) annotated source listing for getdir()
-jeprof --disasm=getdir /bin/ls ls.prof
-                       (Per-PC) annotated disassembly for getdir()
-
-jeprof http://localhost:1234/
-                       Enters "interactive" mode
-jeprof --text localhost:1234
-                       Outputs one line per procedure for localhost:1234
-jeprof --raw localhost:1234 > ./local.raw
-jeprof --text ./local.raw
-                       Fetches a remote profile for later analysis and then
-                       analyzes it in text mode.
-EOF
-}
-
-sub version_string {
-  return <<EOF
-jeprof (part of jemalloc $JEPROF_VERSION)
-based on pprof (part of gperftools $PPROF_VERSION)
-
-Copyright 1998-2007 Google Inc.
-
-This is BSD licensed software; see the source for copying conditions
-and license information.
-There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A
-PARTICULAR PURPOSE.
-EOF
-}
-
-sub usage {
-  my $msg = shift;
-  print STDERR "$msg\n\n";
-  print STDERR usage_string();
-  print STDERR "\nFATAL ERROR: $msg\n";    # just as a reminder
-  exit(1);
-}
-
-sub Init() {
-  # Setup tmp-file name and handler to clean it up.
-  # We do this in the very beginning so that we can use
-  # error() and cleanup() function anytime here after.
-  $main::tmpfile_sym = "/tmp/jeprof$$.sym";
-  $main::tmpfile_ps = "/tmp/jeprof$$";
-  $main::next_tmpfile = 0;
-  $SIG{'INT'} = \&sighandler;
-
-  # Cache from filename/linenumber to source code
-  $main::source_cache = ();
-
-  $main::opt_help = 0;
-  $main::opt_version = 0;
-
-  $main::opt_cum = 0;
-  $main::opt_base = '';
-  $main::opt_addresses = 0;
-  $main::opt_lines = 0;
-  $main::opt_functions = 0;
-  $main::opt_files = 0;
-  $main::opt_lib_prefix = "";
-
-  $main::opt_text = 0;
-  $main::opt_callgrind = 0;
-  $main::opt_list = "";
-  $main::opt_disasm = "";
-  $main::opt_symbols = 0;
-  $main::opt_gv = 0;
-  $main::opt_evince = 0;
-  $main::opt_web = 0;
-  $main::opt_dot = 0;
-  $main::opt_ps = 0;
-  $main::opt_pdf = 0;
-  $main::opt_gif = 0;
-  $main::opt_svg = 0;
-  $main::opt_raw = 0;
-
-  $main::opt_nodecount = 80;
-  $main::opt_nodefraction = 0.005;
-  $main::opt_edgefraction = 0.001;
-  $main::opt_maxdegree = 8;
-  $main::opt_focus = '';
-  $main::opt_thread = undef;
-  $main::opt_ignore = '';
-  $main::opt_scale = 0;
-  $main::opt_heapcheck = 0;
-  $main::opt_retain = '';
-  $main::opt_exclude = '';
-  $main::opt_seconds = 30;
-  $main::opt_lib = "";
-
-  $main::opt_inuse_space   = 0;
-  $main::opt_inuse_objects = 0;
-  $main::opt_alloc_space   = 0;
-  $main::opt_alloc_objects = 0;
-  $main::opt_show_bytes    = 0;
-  $main::opt_drop_negative = 0;
-  $main::opt_interactive   = 0;
-
-  $main::opt_total_delay = 0;
-  $main::opt_contentions = 0;
-  $main::opt_mean_delay = 0;
-
-  $main::opt_tools   = "";
-  $main::opt_debug   = 0;
-  $main::opt_test    = 0;
-
-  # These are undocumented flags used only by unittests.
-  $main::opt_test_stride = 0;
-
-  # Are we using $SYMBOL_PAGE?
-  $main::use_symbol_page = 0;
-
-  # Files returned by TempName.
-  %main::tempnames = ();
-
-  # Type of profile we are dealing with
-  # Supported types:
-  #     cpu
-  #     heap
-  #     growth
-  #     contention
-  $main::profile_type = '';     # Empty type means "unknown"
-
-  GetOptions("help!"          => \$main::opt_help,
-             "version!"       => \$main::opt_version,
-             "cum!"           => \$main::opt_cum,
-             "base=s"         => \$main::opt_base,
-             "seconds=i"      => \$main::opt_seconds,
-             "add_lib=s"      => \$main::opt_lib,
-             "lib_prefix=s"   => \$main::opt_lib_prefix,
-             "functions!"     => \$main::opt_functions,
-             "lines!"         => \$main::opt_lines,
-             "addresses!"     => \$main::opt_addresses,
-             "files!"         => \$main::opt_files,
-             "text!"          => \$main::opt_text,
-             "callgrind!"     => \$main::opt_callgrind,
-             "list=s"         => \$main::opt_list,
-             "disasm=s"       => \$main::opt_disasm,
-             "symbols!"       => \$main::opt_symbols,
-             "gv!"            => \$main::opt_gv,
-             "evince!"        => \$main::opt_evince,
-             "web!"           => \$main::opt_web,
-             "dot!"           => \$main::opt_dot,
-             "ps!"            => \$main::opt_ps,
-             "pdf!"           => \$main::opt_pdf,
-             "svg!"           => \$main::opt_svg,
-             "gif!"           => \$main::opt_gif,
-             "raw!"           => \$main::opt_raw,
-             "interactive!"   => \$main::opt_interactive,
-             "nodecount=i"    => \$main::opt_nodecount,
-             "nodefraction=f" => \$main::opt_nodefraction,
-             "edgefraction=f" => \$main::opt_edgefraction,
-             "maxdegree=i"    => \$main::opt_maxdegree,
-             "focus=s"        => \$main::opt_focus,
-             "thread=s"       => \$main::opt_thread,
-             "ignore=s"       => \$main::opt_ignore,
-             "scale=i"        => \$main::opt_scale,
-             "heapcheck"      => \$main::opt_heapcheck,
-             "retain=s"       => \$main::opt_retain,
-             "exclude=s"      => \$main::opt_exclude,
-             "inuse_space!"   => \$main::opt_inuse_space,
-             "inuse_objects!" => \$main::opt_inuse_objects,
-             "alloc_space!"   => \$main::opt_alloc_space,
-             "alloc_objects!" => \$main::opt_alloc_objects,
-             "show_bytes!"    => \$main::opt_show_bytes,
-             "drop_negative!" => \$main::opt_drop_negative,
-             "total_delay!"   => \$main::opt_total_delay,
-             "contentions!"   => \$main::opt_contentions,
-             "mean_delay!"    => \$main::opt_mean_delay,
-             "tools=s"        => \$main::opt_tools,
-             "test!"          => \$main::opt_test,
-             "debug!"         => \$main::opt_debug,
-             # Undocumented flags used only by unittests:
-             "test_stride=i"  => \$main::opt_test_stride,
-      ) || usage("Invalid option(s)");
-
-  # Deal with the standard --help and --version
-  if ($main::opt_help) {
-    print usage_string();
-    exit(0);
-  }
-
-  if ($main::opt_version) {
-    print version_string();
-    exit(0);
-  }
-
-  # Disassembly/listing/symbols mode requires address-level info
-  if ($main::opt_disasm || $main::opt_list || $main::opt_symbols) {
-    $main::opt_functions = 0;
-    $main::opt_lines = 0;
-    $main::opt_addresses = 1;
-    $main::opt_files = 0;
-  }
-
-  # Check heap-profiling flags
-  if ($main::opt_inuse_space +
-      $main::opt_inuse_objects +
-      $main::opt_alloc_space +
-      $main::opt_alloc_objects > 1) {
-    usage("Specify at most on of --inuse/--alloc options");
-  }
-
-  # Check output granularities
-  my $grains =
-      $main::opt_functions +
-      $main::opt_lines +
-      $main::opt_addresses +
-      $main::opt_files +
-      0;
-  if ($grains > 1) {
-    usage("Only specify one output granularity option");
-  }
-  if ($grains == 0) {
-    $main::opt_functions = 1;
-  }
-
-  # Check output modes
-  my $modes =
-      $main::opt_text +
-      $main::opt_callgrind +
-      ($main::opt_list eq '' ? 0 : 1) +
-      ($main::opt_disasm eq '' ? 0 : 1) +
-      ($main::opt_symbols == 0 ? 0 : 1) +
-      $main::opt_gv +
-      $main::opt_evince +
-      $main::opt_web +
-      $main::opt_dot +
-      $main::opt_ps +
-      $main::opt_pdf +
-      $main::opt_svg +
-      $main::opt_gif +
-      $main::opt_raw +
-      $main::opt_interactive +
-      0;
-  if ($modes > 1) {
-    usage("Only specify one output mode");
-  }
-  if ($modes == 0) {
-    if (-t STDOUT) {  # If STDOUT is a tty, activate interactive mode
-      $main::opt_interactive = 1;
-    } else {
-      $main::opt_text = 1;
-    }
-  }
-
-  if ($main::opt_test) {
-    RunUnitTests();
-    # Should not return
-    exit(1);
-  }
-
-  # Binary name and profile arguments list
-  $main::prog = "";
-  @main::pfile_args = ();
-
-  # Remote profiling without a binary (using $SYMBOL_PAGE instead)
-  if (@ARGV > 0) {
-    if (IsProfileURL($ARGV[0])) {
-      $main::use_symbol_page = 1;
-    } elsif (IsSymbolizedProfileFile($ARGV[0])) {
-      $main::use_symbolized_profile = 1;
-      $main::prog = $UNKNOWN_BINARY;  # will be set later from the profile file
-    }
-  }
-
-  if ($main::use_symbol_page || $main::use_symbolized_profile) {
-    # We don't need a binary!
-    my %disabled = ('--lines' => $main::opt_lines,
-                    '--disasm' => $main::opt_disasm);
-    for my $option (keys %disabled) {
-      usage("$option cannot be used without a binary") if $disabled{$option};
-    }
-    # Set $main::prog later...
-    scalar(@ARGV) || usage("Did not specify profile file");
-  } elsif ($main::opt_symbols) {
-    # --symbols needs a binary-name (to run nm on, etc) but not profiles
-    $main::prog = shift(@ARGV) || usage("Did not specify program");
-  } else {
-    $main::prog = shift(@ARGV) || usage("Did not specify program");
-    scalar(@ARGV) || usage("Did not specify profile file");
-  }
-
-  # Parse profile file/location arguments
-  foreach my $farg (@ARGV) {
-    if ($farg =~ m/(.*)\@([0-9]+)(|\/.*)$/ ) {
-      my $machine = $1;
-      my $num_machines = $2;
-      my $path = $3;
-      for (my $i = 0; $i < $num_machines; $i++) {
-        unshift(@main::pfile_args, "$i.$machine$path");
-      }
-    } else {
-      unshift(@main::pfile_args, $farg);
-    }
-  }
-
-  if ($main::use_symbol_page) {
-    unless (IsProfileURL($main::pfile_args[0])) {
-      error("The first profile should be a remote form to use $SYMBOL_PAGE\n");
-    }
-    CheckSymbolPage();
-    $main::prog = FetchProgramName();
-  } elsif (!$main::use_symbolized_profile) {  # may not need objtools!
-    ConfigureObjTools($main::prog)
-  }
-
-  # Break the opt_lib_prefix into the prefix_list array
-  @prefix_list = split (',', $main::opt_lib_prefix);
-
-  # Remove trailing / from the prefixes, in the list to prevent
-  # searching things like /my/path//lib/mylib.so
-  foreach (@prefix_list) {
-    s|/+$||;
-  }
-}
-
-sub FilterAndPrint {
-  my ($profile, $symbols, $libs, $thread) = @_;
-
-  # Get total data in profile
-  my $total = TotalProfile($profile);
-
-  # Remove uniniteresting stack items
-  $profile = RemoveUninterestingFrames($symbols, $profile);
-
-  # Focus?
-  if ($main::opt_focus ne '') {
-    $profile = FocusProfile($symbols, $profile, $main::opt_focus);
-  }
-
-  # Ignore?
-  if ($main::opt_ignore ne '') {
-    $profile = IgnoreProfile($symbols, $profile, $main::opt_ignore);
-  }
-
-  my $calls = ExtractCalls($symbols, $profile);
-
-  # Reduce profiles to required output granularity, and also clean
-  # each stack trace so a given entry exists at most once.
-  my $reduced = ReduceProfile($symbols, $profile);
-
-  # Get derived profiles
-  my $flat = FlatProfile($reduced);
-  my $cumulative = CumulativeProfile($reduced);
-
-  # Print
-  if (!$main::opt_interactive) {
-    if ($main::opt_disasm) {
-      PrintDisassembly($libs, $flat, $cumulative, $main::opt_disasm);
-    } elsif ($main::opt_list) {
-      PrintListing($total, $libs, $flat, $cumulative, $main::opt_list, 0);
-    } elsif ($main::opt_text) {
-      # Make sure the output is empty when have nothing to report
-      # (only matters when --heapcheck is given but we must be
-      # compatible with old branches that did not pass --heapcheck always):
-      if ($total != 0) {
-        printf("Total%s: %s %s\n",
-               (defined($thread) ? " (t$thread)" : ""),
-               Unparse($total), Units());
-      }
-      PrintText($symbols, $flat, $cumulative, -1);
-    } elsif ($main::opt_raw) {
-      PrintSymbolizedProfile($symbols, $profile, $main::prog);
-    } elsif ($main::opt_callgrind) {
-      PrintCallgrind($calls);
-    } else {
-      if (PrintDot($main::prog, $symbols, $profile, $flat, $cumulative, $total)) {
-        if ($main::opt_gv) {
-          RunGV(TempName($main::next_tmpfile, "ps"), "");
-        } elsif ($main::opt_evince) {
-          RunEvince(TempName($main::next_tmpfile, "pdf"), "");
-        } elsif ($main::opt_web) {
-          my $tmp = TempName($main::next_tmpfile, "svg");
-          RunWeb($tmp);
-          # The command we run might hand the file name off
-          # to an already running browser instance and then exit.
-          # Normally, we'd remove $tmp on exit (right now),
-          # but fork a child to remove $tmp a little later, so that the
-          # browser has time to load it first.
-          delete $main::tempnames{$tmp};
-          if (fork() == 0) {
-            sleep 5;
-            unlink($tmp);
-            exit(0);
-          }
-        }
-      } else {
-        cleanup();
-        exit(1);
-      }
-    }
-  } else {
-    InteractiveMode($profile, $symbols, $libs, $total);
-  }
-}
-
-sub Main() {
-  Init();
-  $main::collected_profile = undef;
-  @main::profile_files = ();
-  $main::op_time = time();
-
-  # Printing symbols is special and requires a lot less info that most.
-  if ($main::opt_symbols) {
-    PrintSymbols(*STDIN);   # Get /proc/maps and symbols output from stdin
-    return;
-  }
-
-  # Fetch all profile data
-  FetchDynamicProfiles();
-
-  # this will hold symbols that we read from the profile files
-  my $symbol_map = {};
-
-  # Read one profile, pick the last item on the list
-  my $data = ReadProfile($main::prog, pop(@main::profile_files));
-  my $profile = $data->{profile};
-  my $pcs = $data->{pcs};
-  my $libs = $data->{libs};   # Info about main program and shared libraries
-  $symbol_map = MergeSymbols($symbol_map, $data->{symbols});
-
-  # Add additional profiles, if available.
-  if (scalar(@main::profile_files) > 0) {
-    foreach my $pname (@main::profile_files) {
-      my $data2 = ReadProfile($main::prog, $pname);
-      $profile = AddProfile($profile, $data2->{profile});
-      $pcs = AddPcs($pcs, $data2->{pcs});
-      $symbol_map = MergeSymbols($symbol_map, $data2->{symbols});
-    }
-  }
-
-  # Subtract base from profile, if specified
-  if ($main::opt_base ne '') {
-    my $base = ReadProfile($main::prog, $main::opt_base);
-    $profile = SubtractProfile($profile, $base->{profile});
-    $pcs = AddPcs($pcs, $base->{pcs});
-    $symbol_map = MergeSymbols($symbol_map, $base->{symbols});
-  }
-
-  # Collect symbols
-  my $symbols;
-  if ($main::use_symbolized_profile) {
-    $symbols = FetchSymbols($pcs, $symbol_map);
-  } elsif ($main::use_symbol_page) {
-    $symbols = FetchSymbols($pcs);
-  } else {
-    # TODO(csilvers): $libs uses the /proc/self/maps data from profile1,
-    # which may differ from the data from subsequent profiles, especially
-    # if they were run on different machines.  Use appropriate libs for
-    # each pc somehow.
-    $symbols = ExtractSymbols($libs, $pcs);
-  }
-
-  if (!defined($main::opt_thread)) {
-    FilterAndPrint($profile, $symbols, $libs);
-  }
-  if (defined($data->{threads})) {
-    foreach my $thread (sort { $a <=> $b } keys(%{$data->{threads}})) {
-      if (defined($main::opt_thread) &&
-          ($main::opt_thread eq '*' || $main::opt_thread == $thread)) {
-        my $thread_profile = $data->{threads}{$thread};
-        FilterAndPrint($thread_profile, $symbols, $libs, $thread);
-      }
-    }
-  }
-
-  cleanup();
-  exit(0);
-}
-
-##### Entry Point #####
-
-Main();
-
-# Temporary code to detect if we're running on a Goobuntu system.
-# These systems don't have the right stuff installed for the special
-# Readline libraries to work, so as a temporary workaround, we default
-# to using the normal stdio code, rather than the fancier readline-based
-# code
-sub ReadlineMightFail {
-  if (-e '/lib/libtermcap.so.2') {
-    return 0;  # libtermcap exists, so readline should be okay
-  } else {
-    return 1;
-  }
-}
-
-sub RunGV {
-  my $fname = shift;
-  my $bg = shift;       # "" or " &" if we should run in background
-  if (!system(ShellEscape(@GV, "--version") . " >$dev_null 2>&1")) {
-    # Options using double dash are supported by this gv version.
-    # Also, turn on noantialias to better handle bug in gv for
-    # postscript files with large dimensions.
-    # TODO: Maybe we should not pass the --noantialias flag
-    # if the gv version is known to work properly without the flag.
-    system(ShellEscape(@GV, "--scale=$main::opt_scale", "--noantialias", $fname)
-           . $bg);
-  } else {
-    # Old gv version - only supports options that use single dash.
-    print STDERR ShellEscape(@GV, "-scale", $main::opt_scale) . "\n";
-    system(ShellEscape(@GV, "-scale", "$main::opt_scale", $fname) . $bg);
-  }
-}
-
-sub RunEvince {
-  my $fname = shift;
-  my $bg = shift;       # "" or " &" if we should run in background
-  system(ShellEscape(@EVINCE, $fname) . $bg);
-}
-
-sub RunWeb {
-  my $fname = shift;
-  print STDERR "Loading web page file:///$fname\n";
-
-  if (`uname` =~ /Darwin/) {
-    # OS X: open will use standard preference for SVG files.
-    system("/usr/bin/open", $fname);
-    return;
-  }
-
-  # Some kind of Unix; try generic symlinks, then specific browsers.
-  # (Stop once we find one.)
-  # Works best if the browser is already running.
-  my @alt = (
-    "/etc/alternatives/gnome-www-browser",
-    "/etc/alternatives/x-www-browser",
-    "google-chrome",
-    "firefox",
-  );
-  foreach my $b (@alt) {
-    if (system($b, $fname) == 0) {
-      return;
-    }
-  }
-
-  print STDERR "Could not load web browser.\n";
-}
-
-sub RunKcachegrind {
-  my $fname = shift;
-  my $bg = shift;       # "" or " &" if we should run in background
-  print STDERR "Starting '@KCACHEGRIND " . $fname . $bg . "'\n";
-  system(ShellEscape(@KCACHEGRIND, $fname) . $bg);
-}
-
-
-##### Interactive helper routines #####
-
-sub InteractiveMode {
-  $| = 1;  # Make output unbuffered for interactive mode
-  my ($orig_profile, $symbols, $libs, $total) = @_;
-
-  print STDERR "Welcome to jeprof!  For help, type 'help'.\n";
-
-  # Use ReadLine if it's installed and input comes from a console.
-  if ( -t STDIN &&
-       !ReadlineMightFail() &&
-       defined(eval {require Term::ReadLine}) ) {
-    my $term = new Term::ReadLine 'jeprof';
-    while ( defined ($_ = $term->readline('(jeprof) '))) {
-      $term->addhistory($_) if /\S/;
-      if (!InteractiveCommand($orig_profile, $symbols, $libs, $total, $_)) {
-        last;    # exit when we get an interactive command to quit
-      }
-    }
-  } else {       # don't have readline
-    while (1) {
-      print STDERR "(jeprof) ";
-      $_ = <STDIN>;
-      last if ! defined $_ ;
-      s/\r//g;         # turn windows-looking lines into unix-looking lines
-
-      # Save some flags that might be reset by InteractiveCommand()
-      my $save_opt_lines = $main::opt_lines;
-
-      if (!InteractiveCommand($orig_profile, $symbols, $libs, $total, $_)) {
-        last;    # exit when we get an interactive command to quit
-      }
-
-      # Restore flags
-      $main::opt_lines = $save_opt_lines;
-    }
-  }
-}
-
-# Takes two args: orig profile, and command to run.
-# Returns 1 if we should keep going, or 0 if we were asked to quit
-sub InteractiveCommand {
-  my($orig_profile, $symbols, $libs, $total, $command) = @_;
-  $_ = $command;                # just to make future m//'s easier
-  if (!defined($_)) {
-    print STDERR "\n";
-    return 0;
-  }
-  if (m/^\s*quit/) {
-    return 0;
-  }
-  if (m/^\s*help/) {
-    InteractiveHelpMessage();
-    return 1;
-  }
-  # Clear all the mode options -- mode is controlled by "$command"
-  $main::opt_text = 0;
-  $main::opt_callgrind = 0;
-  $main::opt_disasm = 0;
-  $main::opt_list = 0;
-  $main::opt_gv = 0;
-  $main::opt_evince = 0;
-  $main::opt_cum = 0;
-
-  if (m/^\s*(text|top)(\d*)\s*(.*)/) {
-    $main::opt_text = 1;
-
-    my $line_limit = ($2 ne "") ? int($2) : 10;
-
-    my $routine;
-    my $ignore;
-    ($routine, $ignore) = ParseInteractiveArgs($3);
-
-    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
-    my $reduced = ReduceProfile($symbols, $profile);
-
-    # Get derived profiles
-    my $flat = FlatProfile($reduced);
-    my $cumulative = CumulativeProfile($reduced);
-
-    PrintText($symbols, $flat, $cumulative, $line_limit);
-    return 1;
-  }
-  if (m/^\s*callgrind\s*([^ \n]*)/) {
-    $main::opt_callgrind = 1;
-
-    # Get derived profiles
-    my $calls = ExtractCalls($symbols, $orig_profile);
-    my $filename = $1;
-    if ( $1 eq '' ) {
-      $filename = TempName($main::next_tmpfile, "callgrind");
-    }
-    PrintCallgrind($calls, $filename);
-    if ( $1 eq '' ) {
-      RunKcachegrind($filename, " & ");
-      $main::next_tmpfile++;
-    }
-
-    return 1;
-  }
-  if (m/^\s*(web)?list\s*(.+)/) {
-    my $html = (defined($1) && ($1 eq "web"));
-    $main::opt_list = 1;
-
-    my $routine;
-    my $ignore;
-    ($routine, $ignore) = ParseInteractiveArgs($2);
-
-    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
-    my $reduced = ReduceProfile($symbols, $profile);
-
-    # Get derived profiles
-    my $flat = FlatProfile($reduced);
-    my $cumulative = CumulativeProfile($reduced);
-
-    PrintListing($total, $libs, $flat, $cumulative, $routine, $html);
-    return 1;
-  }
-  if (m/^\s*disasm\s*(.+)/) {
-    $main::opt_disasm = 1;
-
-    my $routine;
-    my $ignore;
-    ($routine, $ignore) = ParseInteractiveArgs($1);
-
-    # Process current profile to account for various settings
-    my $profile = ProcessProfile($total, $orig_profile, $symbols, "", $ignore);
-    my $reduced = ReduceProfile($symbols, $profile);
-
-    # Get derived profiles
-    my $flat = FlatProfile($reduced);
-    my $cumulative = CumulativeProfile($reduced);
-
-    PrintDisassembly($libs, $flat, $cumulative, $routine);
-    return 1;
-  }
-  if (m/^\s*(gv|web|evince)\s*(.*)/) {
-    $main::opt_gv = 0;
-    $main::opt_evince = 0;
-    $main::opt_web = 0;
-    if ($1 eq "gv") {
-      $main::opt_gv = 1;
-    } elsif ($1 eq "evince") {
-      $main::opt_evince = 1;
-    } elsif ($1 eq "web") {
-      $main::opt_web = 1;
-    }
-
-    my $focus;
-    my $ignore;
-    ($focus, $ignore) = ParseInteractiveArgs($2);
-
-    # Process current profile to account for various settings
-    my $profile = ProcessProfile($total, $orig_profile, $symbols,
-                                 $focus, $ignore);
-    my $reduced = ReduceProfile($symbols, $profile);
-
-    # Get derived profiles
-    my $flat = FlatProfile($reduced);
-    my $cumulative = CumulativeProfile($reduced);
-
-    if (PrintDot($main::prog, $symbols, $profile, $flat, $cumulative, $total)) {
-      if ($main::opt_gv) {
-        RunGV(TempName($main::next_tmpfile, "ps"), " &");
-      } elsif ($main::opt_evince) {
-        RunEvince(TempName($main::next_tmpfile, "pdf"), " &");
-      } elsif ($main::opt_web) {
-        RunWeb(TempName($main::next_tmpfile, "svg"));
-      }
-      $main::next_tmpfile++;
-    }
-    return 1;
-  }
-  if (m/^\s*$/) {
-    return 1;
-  }
-  print STDERR "Unknown command: try 'help'.\n";
-  return 1;
-}
-
-
-sub ProcessProfile {
-  my $total_count = shift;
-  my $orig_profile = shift;
-  my $symbols = shift;
-  my $focus = shift;
-  my $ignore = shift;
-
-  # Process current profile to account for various settings
-  my $profile = $orig_profile;
-  printf("Total: %s %s\n", Unparse($total_count), Units());
-  if ($focus ne '') {
-    $profile = FocusProfile($symbols, $profile, $focus);
-    my $focus_count = TotalProfile($profile);
-    printf("After focusing on '%s': %s %s of %s (%0.1f%%)\n",
-           $focus,
-           Unparse($focus_count), Units(),
-           Unparse($total_count), ($focus_count*100.0) / $total_count);
-  }
-  if ($ignore ne '') {
-    $profile = IgnoreProfile($symbols, $profile, $ignore);
-    my $ignore_count = TotalProfile($profile);
-    printf("After ignoring '%s': %s %s of %s (%0.1f%%)\n",
-           $ignore,
-           Unparse($ignore_count), Units(),
-           Unparse($total_count),
-           ($ignore_count*100.0) / $total_count);
-  }
-
-  return $profile;
-}
-
-sub InteractiveHelpMessage {
-  print STDERR <<ENDOFHELP;
-Interactive jeprof mode
-
-Commands:
-  gv
-  gv [focus] [-ignore1] [-ignore2]
-      Show graphical hierarchical display of current profile.  Without
-      any arguments, shows all samples in the profile.  With the optional
-      "focus" argument, restricts the samples shown to just those where
-      the "focus" regular expression matches a routine name on the stack
-      trace.
-
-  web
-  web [focus] [-ignore1] [-ignore2]
-      Like GV, but displays profile in your web browser instead of using
-      Ghostview. Works best if your web browser is already running.
-      To change the browser that gets used:
-      On Linux, set the /etc/alternatives/gnome-www-browser symlink.
-      On OS X, change the Finder association for SVG files.
-
-  list [routine_regexp] [-ignore1] [-ignore2]
-      Show source listing of routines whose names match "routine_regexp"
-
-  weblist [routine_regexp] [-ignore1] [-ignore2]
-     Displays a source listing of routines whose names match "routine_regexp"
-     in a web browser.  You can click on source lines to view the
-     corresponding disassembly.
-
-  top [--cum] [-ignore1] [-ignore2]
-  top20 [--cum] [-ignore1] [-ignore2]
-  top37 [--cum] [-ignore1] [-ignore2]
-      Show top lines ordered by flat profile count, or cumulative count
-      if --cum is specified.  If a number is present after 'top', the
-      top K routines will be shown (defaults to showing the top 10)
-
-  disasm [routine_regexp] [-ignore1] [-ignore2]
-      Show disassembly of routines whose names match "routine_regexp",
-      annotated with sample counts.
-
-  callgrind
-  callgrind [filename]
-      Generates callgrind file. If no filename is given, kcachegrind is called.
-
-  help - This listing
-  quit or ^D - End jeprof
-
-For commands that accept optional -ignore tags, samples where any routine in
-the stack trace matches the regular expression in any of the -ignore
-parameters will be ignored.
-
-Further pprof details are available at this location (or one similar):
-
- /usr/doc/gperftools-$PPROF_VERSION/cpu_profiler.html
- /usr/doc/gperftools-$PPROF_VERSION/heap_profiler.html
-
-ENDOFHELP
-}
-sub ParseInteractiveArgs {
-  my $args = shift;
-  my $focus = "";
-  my $ignore = "";
-  my @x = split(/ +/, $args);
-  foreach $a (@x) {
-    if ($a =~ m/^(--|-)lines$/) {
-      $main::opt_lines = 1;
-    } elsif ($a =~ m/^(--|-)cum$/) {
-      $main::opt_cum = 1;
-    } elsif ($a =~ m/^-(.*)/) {
-      $ignore .= (($ignore ne "") ? "|" : "" ) . $1;
-    } else {
-      $focus .= (($focus ne "") ? "|" : "" ) . $a;
-    }
-  }
-  if ($ignore ne "") {
-    print STDERR "Ignoring samples in call stacks that match '$ignore'\n";
-  }
-  return ($focus, $ignore);
-}
-
-##### Output code #####
-
-sub TempName {
-  my $fnum = shift;
-  my $ext = shift;
-  my $file = "$main::tmpfile_ps.$fnum.$ext";
-  $main::tempnames{$file} = 1;
-  return $file;
-}
-
-# Print profile data in packed binary format (64-bit) to standard out
-sub PrintProfileData {
-  my $profile = shift;
-
-  # print header (64-bit style)
-  # (zero) (header-size) (version) (sample-period) (zero)
-  print pack('L*', 0, 0, 3, 0, 0, 0, 1, 0, 0, 0);
-
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    if ($#addrs >= 0) {
-      my $depth = $#addrs + 1;
-      # int(foo / 2**32) is the only reliable way to get rid of bottom
-      # 32 bits on both 32- and 64-bit systems.
-      print pack('L*', $count & 0xFFFFFFFF, int($count / 2**32));
-      print pack('L*', $depth & 0xFFFFFFFF, int($depth / 2**32));
-
-      foreach my $full_addr (@addrs) {
-        my $addr = $full_addr;
-        $addr =~ s/0x0*//;  # strip off leading 0x, zeroes
-        if (length($addr) > 16) {
-          print STDERR "Invalid address in profile: $full_addr\n";
-          next;
-        }
-        my $low_addr = substr($addr, -8);       # get last 8 hex chars
-        my $high_addr = substr($addr, -16, 8);  # get up to 8 more hex chars
-        print pack('L*', hex('0x' . $low_addr), hex('0x' . $high_addr));
-      }
-    }
-  }
-}
-
-# Print symbols and profile data
-sub PrintSymbolizedProfile {
-  my $symbols = shift;
-  my $profile = shift;
-  my $prog = shift;
-
-  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $symbol_marker = $&;
-
-  print '--- ', $symbol_marker, "\n";
-  if (defined($prog)) {
-    print 'binary=', $prog, "\n";
-  }
-  while (my ($pc, $name) = each(%{$symbols})) {
-    my $sep = ' ';
-    print '0x', $pc;
-    # We have a list of function names, which include the inlined
-    # calls.  They are separated (and terminated) by --, which is
-    # illegal in function names.
-    for (my $j = 2; $j <= $#{$name}; $j += 3) {
-      print $sep, $name->[$j];
-      $sep = '--';
-    }
-    print "\n";
-  }
-  print '---', "\n";
-
-  my $profile_marker;
-  if ($main::profile_type eq 'heap') {
-    $HEAP_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-    $profile_marker = $&;
-  } elsif ($main::profile_type eq 'growth') {
-    $GROWTH_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-    $profile_marker = $&;
-  } elsif ($main::profile_type eq 'contention') {
-    $CONTENTION_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-    $profile_marker = $&;
-  } else { # elsif ($main::profile_type eq 'cpu')
-    $PROFILE_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-    $profile_marker = $&;
-  }
-
-  print '--- ', $profile_marker, "\n";
-  if (defined($main::collected_profile)) {
-    # if used with remote fetch, simply dump the collected profile to output.
-    open(SRC, "<$main::collected_profile");
-    while (<SRC>) {
-      print $_;
-    }
-    close(SRC);
-  } else {
-    # --raw/http: For everything to work correctly for non-remote profiles, we
-    # would need to extend PrintProfileData() to handle all possible profile
-    # types, re-enable the code that is currently disabled in ReadCPUProfile()
-    # and FixCallerAddresses(), and remove the remote profile dumping code in
-    # the block above.
-    die "--raw/http: jeprof can only dump remote profiles for --raw\n";
-    # dump a cpu-format profile to standard out
-    PrintProfileData($profile);
-  }
-}
-
-# Print text output
-sub PrintText {
-  my $symbols = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $line_limit = shift;
-
-  my $total = TotalProfile($flat);
-
-  # Which profile to sort by?
-  my $s = $main::opt_cum ? $cumulative : $flat;
-
-  my $running_sum = 0;
-  my $lines = 0;
-  foreach my $k (sort { GetEntry($s, $b) <=> GetEntry($s, $a) || $a cmp $b }
-                 keys(%{$cumulative})) {
-    my $f = GetEntry($flat, $k);
-    my $c = GetEntry($cumulative, $k);
-    $running_sum += $f;
-
-    my $sym = $k;
-    if (exists($symbols->{$k})) {
-      $sym = $symbols->{$k}->[0] . " " . $symbols->{$k}->[1];
-      if ($main::opt_addresses) {
-        $sym = $k . " " . $sym;
-      }
-    }
-
-    if ($f != 0 || $c != 0) {
-      printf("%8s %6s %6s %8s %6s %s\n",
-             Unparse($f),
-             Percent($f, $total),
-             Percent($running_sum, $total),
-             Unparse($c),
-             Percent($c, $total),
-             $sym);
-    }
-    $lines++;
-    last if ($line_limit >= 0 && $lines >= $line_limit);
-  }
-}
-
-# Callgrind format has a compression for repeated function and file
-# names.  You show the name the first time, and just use its number
-# subsequently.  This can cut down the file to about a third or a
-# quarter of its uncompressed size.  $key and $val are the key/value
-# pair that would normally be printed by callgrind; $map is a map from
-# value to number.
-sub CompressedCGName {
-  my($key, $val, $map) = @_;
-  my $idx = $map->{$val};
-  # For very short keys, providing an index hurts rather than helps.
-  if (length($val) <= 3) {
-    return "$key=$val\n";
-  } elsif (defined($idx)) {
-    return "$key=($idx)\n";
-  } else {
-    # scalar(keys $map) gives the number of items in the map.
-    $idx = scalar(keys(%{$map})) + 1;
-    $map->{$val} = $idx;
-    return "$key=($idx) $val\n";
-  }
-}
-
-# Print the call graph in a way that's suiteable for callgrind.
-sub PrintCallgrind {
-  my $calls = shift;
-  my $filename;
-  my %filename_to_index_map;
-  my %fnname_to_index_map;
-
-  if ($main::opt_interactive) {
-    $filename = shift;
-    print STDERR "Writing callgrind file to '$filename'.\n"
-  } else {
-    $filename = "&STDOUT";
-  }
-  open(CG, ">$filename");
-  printf CG ("events: Hits\n\n");
-  foreach my $call ( map { $_->[0] }
-                     sort { $a->[1] cmp $b ->[1] ||
-                            $a->[2] <=> $b->[2] }
-                     map { /([^:]+):(\d+):([^ ]+)( -> ([^:]+):(\d+):(.+))?/;
-                           [$_, $1, $2] }
-                     keys %$calls ) {
-    my $count = int($calls->{$call});
-    $call =~ /([^:]+):(\d+):([^ ]+)( -> ([^:]+):(\d+):(.+))?/;
-    my ( $caller_file, $caller_line, $caller_function,
-         $callee_file, $callee_line, $callee_function ) =
-       ( $1, $2, $3, $5, $6, $7 );
-
-    # TODO(csilvers): for better compression, collect all the
-    # caller/callee_files and functions first, before printing
-    # anything, and only compress those referenced more than once.
-    printf CG CompressedCGName("fl", $caller_file, \%filename_to_index_map);
-    printf CG CompressedCGName("fn", $caller_function, \%fnname_to_index_map);
-    if (defined $6) {
-      printf CG CompressedCGName("cfl", $callee_file, \%filename_to_index_map);
-      printf CG CompressedCGName("cfn", $callee_function, \%fnname_to_index_map);
-      printf CG ("calls=$count $callee_line\n");
-    }
-    printf CG ("$caller_line $count\n\n");
-  }
-}
-
-# Print disassembly for all all routines that match $main::opt_disasm
-sub PrintDisassembly {
-  my $libs = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $disasm_opts = shift;
-
-  my $total = TotalProfile($flat);
-
-  foreach my $lib (@{$libs}) {
-    my $symbol_table = GetProcedureBoundaries($lib->[0], $disasm_opts);
-    my $offset = AddressSub($lib->[1], $lib->[3]);
-    foreach my $routine (sort ByName keys(%{$symbol_table})) {
-      my $start_addr = $symbol_table->{$routine}->[0];
-      my $end_addr = $symbol_table->{$routine}->[1];
-      # See if there are any samples in this routine
-      my $length = hex(AddressSub($end_addr, $start_addr));
-      my $addr = AddressAdd($start_addr, $offset);
-      for (my $i = 0; $i < $length; $i++) {
-        if (defined($cumulative->{$addr})) {
-          PrintDisassembledFunction($lib->[0], $offset,
-                                    $routine, $flat, $cumulative,
-                                    $start_addr, $end_addr, $total);
-          last;
-        }
-        $addr = AddressInc($addr);
-      }
-    }
-  }
-}
-
-# Return reference to array of tuples of the form:
-#       [start_address, filename, linenumber, instruction, limit_address]
-# E.g.,
-#       ["0x806c43d", "/foo/bar.cc", 131, "ret", "0x806c440"]
-sub Disassemble {
-  my $prog = shift;
-  my $offset = shift;
-  my $start_addr = shift;
-  my $end_addr = shift;
-
-  my $objdump = $obj_tool_map{"objdump"};
-  my $cmd = ShellEscape($objdump, "-C", "-d", "-l", "--no-show-raw-insn",
-                        "--start-address=0x$start_addr",
-                        "--stop-address=0x$end_addr", $prog);
-  open(OBJDUMP, "$cmd |") || error("$cmd: $!\n");
-  my @result = ();
-  my $filename = "";
-  my $linenumber = -1;
-  my $last = ["", "", "", ""];
-  while (<OBJDUMP>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    chop;
-    if (m|\s*([^:\s]+):(\d+)\s*$|) {
-      # Location line of the form:
-      #   <filename>:<linenumber>
-      $filename = $1;
-      $linenumber = $2;
-    } elsif (m/^ +([0-9a-f]+):\s*(.*)/) {
-      # Disassembly line -- zero-extend address to full length
-      my $addr = HexExtend($1);
-      my $k = AddressAdd($addr, $offset);
-      $last->[4] = $k;   # Store ending address for previous instruction
-      $last = [$k, $filename, $linenumber, $2, $end_addr];
-      push(@result, $last);
-    }
-  }
-  close(OBJDUMP);
-  return @result;
-}
-
-# The input file should contain lines of the form /proc/maps-like
-# output (same format as expected from the profiles) or that looks
-# like hex addresses (like "0xDEADBEEF").  We will parse all
-# /proc/maps output, and for all the hex addresses, we will output
-# "short" symbol names, one per line, in the same order as the input.
-sub PrintSymbols {
-  my $maps_and_symbols_file = shift;
-
-  # ParseLibraries expects pcs to be in a set.  Fine by us...
-  my @pclist = ();   # pcs in sorted order
-  my $pcs = {};
-  my $map = "";
-  foreach my $line (<$maps_and_symbols_file>) {
-    $line =~ s/\r//g;    # turn windows-looking lines into unix-looking lines
-    if ($line =~ /\b(0x[0-9a-f]+)\b/i) {
-      push(@pclist, HexExtend($1));
-      $pcs->{$pclist[-1]} = 1;
-    } else {
-      $map .= $line;
-    }
-  }
-
-  my $libs = ParseLibraries($main::prog, $map, $pcs);
-  my $symbols = ExtractSymbols($libs, $pcs);
-
-  foreach my $pc (@pclist) {
-    # ->[0] is the shortname, ->[2] is the full name
-    print(($symbols->{$pc}->[0] || "??") . "\n");
-  }
-}
-
-
-# For sorting functions by name
-sub ByName {
-  return ShortFunctionName($a) cmp ShortFunctionName($b);
-}
-
-# Print source-listing for all all routines that match $list_opts
-sub PrintListing {
-  my $total = shift;
-  my $libs = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $list_opts = shift;
-  my $html = shift;
-
-  my $output = \*STDOUT;
-  my $fname = "";
-
-  if ($html) {
-    # Arrange to write the output to a temporary file
-    $fname = TempName($main::next_tmpfile, "html");
-    $main::next_tmpfile++;
-    if (!open(TEMP, ">$fname")) {
-      print STDERR "$fname: $!\n";
-      return;
-    }
-    $output = \*TEMP;
-    print $output HtmlListingHeader();
-    printf $output ("<div class=\"legend\">%s<br>Total: %s %s</div>\n",
-                    $main::prog, Unparse($total), Units());
-  }
-
-  my $listed = 0;
-  foreach my $lib (@{$libs}) {
-    my $symbol_table = GetProcedureBoundaries($lib->[0], $list_opts);
-    my $offset = AddressSub($lib->[1], $lib->[3]);
-    foreach my $routine (sort ByName keys(%{$symbol_table})) {
-      # Print if there are any samples in this routine
-      my $start_addr = $symbol_table->{$routine}->[0];
-      my $end_addr = $symbol_table->{$routine}->[1];
-      my $length = hex(AddressSub($end_addr, $start_addr));
-      my $addr = AddressAdd($start_addr, $offset);
-      for (my $i = 0; $i < $length; $i++) {
-        if (defined($cumulative->{$addr})) {
-          $listed += PrintSource(
-            $lib->[0], $offset,
-            $routine, $flat, $cumulative,
-            $start_addr, $end_addr,
-            $html,
-            $output);
-          last;
-        }
-        $addr = AddressInc($addr);
-      }
-    }
-  }
-
-  if ($html) {
-    if ($listed > 0) {
-      print $output HtmlListingFooter();
-      close($output);
-      RunWeb($fname);
-    } else {
-      close($output);
-      unlink($fname);
-    }
-  }
-}
-
-sub HtmlListingHeader {
-  return <<'EOF';
-<DOCTYPE html>
-<html>
-<head>
-<title>Pprof listing</title>
-<style type="text/css">
-body {
-  font-family: sans-serif;
-}
-h1 {
-  font-size: 1.5em;
-  margin-bottom: 4px;
-}
-.legend {
-  font-size: 1.25em;
-}
-.line {
-  color: #aaaaaa;
-}
-.nop {
-  color: #aaaaaa;
-}
-.unimportant {
-  color: #cccccc;
-}
-.disasmloc {
-  color: #000000;
-}
-.deadsrc {
-  cursor: pointer;
-}
-.deadsrc:hover {
-  background-color: #eeeeee;
-}
-.livesrc {
-  color: #0000ff;
-  cursor: pointer;
-}
-.livesrc:hover {
-  background-color: #eeeeee;
-}
-.asm {
-  color: #008800;
-  display: none;
-}
-</style>
-<script type="text/javascript">
-function jeprof_toggle_asm(e) {
-  var target;
-  if (!e) e = window.event;
-  if (e.target) target = e.target;
-  else if (e.srcElement) target = e.srcElement;
-
-  if (target) {
-    var asm = target.nextSibling;
-    if (asm && asm.className == "asm") {
-      asm.style.display = (asm.style.display == "block" ? "" : "block");
-      e.preventDefault();
-      return false;
-    }
-  }
-}
-</script>
-</head>
-<body>
-EOF
-}
-
-sub HtmlListingFooter {
-  return <<'EOF';
-</body>
-</html>
-EOF
-}
-
-sub HtmlEscape {
-  my $text = shift;
-  $text =~ s/&/&amp;/g;
-  $text =~ s/</&lt;/g;
-  $text =~ s/>/&gt;/g;
-  return $text;
-}
-
-# Returns the indentation of the line, if it has any non-whitespace
-# characters.  Otherwise, returns -1.
-sub Indentation {
-  my $line = shift;
-  if (m/^(\s*)\S/) {
-    return length($1);
-  } else {
-    return -1;
-  }
-}
-
-# If the symbol table contains inlining info, Disassemble() may tag an
-# instruction with a location inside an inlined function.  But for
-# source listings, we prefer to use the location in the function we
-# are listing.  So use MapToSymbols() to fetch full location
-# information for each instruction and then pick out the first
-# location from a location list (location list contains callers before
-# callees in case of inlining).
-#
-# After this routine has run, each entry in $instructions contains:
-#   [0] start address
-#   [1] filename for function we are listing
-#   [2] line number for function we are listing
-#   [3] disassembly
-#   [4] limit address
-#   [5] most specific filename (may be different from [1] due to inlining)
-#   [6] most specific line number (may be different from [2] due to inlining)
-sub GetTopLevelLineNumbers {
-  my ($lib, $offset, $instructions) = @_;
-  my $pcs = [];
-  for (my $i = 0; $i <= $#{$instructions}; $i++) {
-    push(@{$pcs}, $instructions->[$i]->[0]);
-  }
-  my $symbols = {};
-  MapToSymbols($lib, $offset, $pcs, $symbols);
-  for (my $i = 0; $i <= $#{$instructions}; $i++) {
-    my $e = $instructions->[$i];
-    push(@{$e}, $e->[1]);
-    push(@{$e}, $e->[2]);
-    my $addr = $e->[0];
-    my $sym = $symbols->{$addr};
-    if (defined($sym)) {
-      if ($#{$sym} >= 2 && $sym->[1] =~ m/^(.*):(\d+)$/) {
-        $e->[1] = $1;  # File name
-        $e->[2] = $2;  # Line number
-      }
-    }
-  }
-}
-
-# Print source-listing for one routine
-sub PrintSource {
-  my $prog = shift;
-  my $offset = shift;
-  my $routine = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $start_addr = shift;
-  my $end_addr = shift;
-  my $html = shift;
-  my $output = shift;
-
-  # Disassemble all instructions (just to get line numbers)
-  my @instructions = Disassemble($prog, $offset, $start_addr, $end_addr);
-  GetTopLevelLineNumbers($prog, $offset, \@instructions);
-
-  # Hack 1: assume that the first source file encountered in the
-  # disassembly contains the routine
-  my $filename = undef;
-  for (my $i = 0; $i <= $#instructions; $i++) {
-    if ($instructions[$i]->[2] >= 0) {
-      $filename = $instructions[$i]->[1];
-      last;
-    }
-  }
-  if (!defined($filename)) {
-    print STDERR "no filename found in $routine\n";
-    return 0;
-  }
-
-  # Hack 2: assume that the largest line number from $filename is the
-  # end of the procedure.  This is typically safe since if P1 contains
-  # an inlined call to P2, then P2 usually occurs earlier in the
-  # source file.  If this does not work, we might have to compute a
-  # density profile or just print all regions we find.
-  my $lastline = 0;
-  for (my $i = 0; $i <= $#instructions; $i++) {
-    my $f = $instructions[$i]->[1];
-    my $l = $instructions[$i]->[2];
-    if (($f eq $filename) && ($l > $lastline)) {
-      $lastline = $l;
-    }
-  }
-
-  # Hack 3: assume the first source location from "filename" is the start of
-  # the source code.
-  my $firstline = 1;
-  for (my $i = 0; $i <= $#instructions; $i++) {
-    if ($instructions[$i]->[1] eq $filename) {
-      $firstline = $instructions[$i]->[2];
-      last;
-    }
-  }
-
-  # Hack 4: Extend last line forward until its indentation is less than
-  # the indentation we saw on $firstline
-  my $oldlastline = $lastline;
-  {
-    if (!open(FILE, "<$filename")) {
-      print STDERR "$filename: $!\n";
-      return 0;
-    }
-    my $l = 0;
-    my $first_indentation = -1;
-    while (<FILE>) {
-      s/\r//g;         # turn windows-looking lines into unix-looking lines
-      $l++;
-      my $indent = Indentation($_);
-      if ($l >= $firstline) {
-        if ($first_indentation < 0 && $indent >= 0) {
-          $first_indentation = $indent;
-          last if ($first_indentation == 0);
-        }
-      }
-      if ($l >= $lastline && $indent >= 0) {
-        if ($indent >= $first_indentation) {
-          $lastline = $l+1;
-        } else {
-          last;
-        }
-      }
-    }
-    close(FILE);
-  }
-
-  # Assign all samples to the range $firstline,$lastline,
-  # Hack 4: If an instruction does not occur in the range, its samples
-  # are moved to the next instruction that occurs in the range.
-  my $samples1 = {};        # Map from line number to flat count
-  my $samples2 = {};        # Map from line number to cumulative count
-  my $running1 = 0;         # Unassigned flat counts
-  my $running2 = 0;         # Unassigned cumulative counts
-  my $total1 = 0;           # Total flat counts
-  my $total2 = 0;           # Total cumulative counts
-  my %disasm = ();          # Map from line number to disassembly
-  my $running_disasm = "";  # Unassigned disassembly
-  my $skip_marker = "---\n";
-  if ($html) {
-    $skip_marker = "";
-    for (my $l = $firstline; $l <= $lastline; $l++) {
-      $disasm{$l} = "";
-    }
-  }
-  my $last_dis_filename = '';
-  my $last_dis_linenum = -1;
-  my $last_touched_line = -1;  # To detect gaps in disassembly for a line
-  foreach my $e (@instructions) {
-    # Add up counts for all address that fall inside this instruction
-    my $c1 = 0;
-    my $c2 = 0;
-    for (my $a = $e->[0]; $a lt $e->[4]; $a = AddressInc($a)) {
-      $c1 += GetEntry($flat, $a);
-      $c2 += GetEntry($cumulative, $a);
-    }
-
-    if ($html) {
-      my $dis = sprintf("      %6s %6s \t\t%8s: %s ",
-                        HtmlPrintNumber($c1),
-                        HtmlPrintNumber($c2),
-                        UnparseAddress($offset, $e->[0]),
-                        CleanDisassembly($e->[3]));
-
-      # Append the most specific source line associated with this instruction
-      if (length($dis) < 80) { $dis .= (' ' x (80 - length($dis))) };
-      $dis = HtmlEscape($dis);
-      my $f = $e->[5];
-      my $l = $e->[6];
-      if ($f ne $last_dis_filename) {
-        $dis .= sprintf("<span class=disasmloc>%s:%d</span>",
-                        HtmlEscape(CleanFileName($f)), $l);
-      } elsif ($l ne $last_dis_linenum) {
-        # De-emphasize the unchanged file name portion
-        $dis .= sprintf("<span class=unimportant>%s</span>" .
-                        "<span class=disasmloc>:%d</span>",
-                        HtmlEscape(CleanFileName($f)), $l);
-      } else {
-        # De-emphasize the entire location
-        $dis .= sprintf("<span class=unimportant>%s:%d</span>",
-                        HtmlEscape(CleanFileName($f)), $l);
-      }
-      $last_dis_filename = $f;
-      $last_dis_linenum = $l;
-      $running_disasm .= $dis;
-      $running_disasm .= "\n";
-    }
-
-    $running1 += $c1;
-    $running2 += $c2;
-    $total1 += $c1;
-    $total2 += $c2;
-    my $file = $e->[1];
-    my $line = $e->[2];
-    if (($file eq $filename) &&
-        ($line >= $firstline) &&
-        ($line <= $lastline)) {
-      # Assign all accumulated samples to this line
-      AddEntry($samples1, $line, $running1);
-      AddEntry($samples2, $line, $running2);
-      $running1 = 0;
-      $running2 = 0;
-      if ($html) {
-        if ($line != $last_touched_line && $disasm{$line} ne '') {
-          $disasm{$line} .= "\n";
-        }
-        $disasm{$line} .= $running_disasm;
-        $running_disasm = '';
-        $last_touched_line = $line;
-      }
-    }
-  }
-
-  # Assign any leftover samples to $lastline
-  AddEntry($samples1, $lastline, $running1);
-  AddEntry($samples2, $lastline, $running2);
-  if ($html) {
-    if ($lastline != $last_touched_line && $disasm{$lastline} ne '') {
-      $disasm{$lastline} .= "\n";
-    }
-    $disasm{$lastline} .= $running_disasm;
-  }
-
-  if ($html) {
-    printf $output (
-      "<h1>%s</h1>%s\n<pre onClick=\"jeprof_toggle_asm()\">\n" .
-      "Total:%6s %6s (flat / cumulative %s)\n",
-      HtmlEscape(ShortFunctionName($routine)),
-      HtmlEscape(CleanFileName($filename)),
-      Unparse($total1),
-      Unparse($total2),
-      Units());
-  } else {
-    printf $output (
-      "ROUTINE ====================== %s in %s\n" .
-      "%6s %6s Total %s (flat / cumulative)\n",
-      ShortFunctionName($routine),
-      CleanFileName($filename),
-      Unparse($total1),
-      Unparse($total2),
-      Units());
-  }
-  if (!open(FILE, "<$filename")) {
-    print STDERR "$filename: $!\n";
-    return 0;
-  }
-  my $l = 0;
-  while (<FILE>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    $l++;
-    if ($l >= $firstline - 5 &&
-        (($l <= $oldlastline + 5) || ($l <= $lastline))) {
-      chop;
-      my $text = $_;
-      if ($l == $firstline) { print $output $skip_marker; }
-      my $n1 = GetEntry($samples1, $l);
-      my $n2 = GetEntry($samples2, $l);
-      if ($html) {
-        # Emit a span that has one of the following classes:
-        #    livesrc -- has samples
-        #    deadsrc -- has disassembly, but with no samples
-        #    nop     -- has no matching disasembly
-        # Also emit an optional span containing disassembly.
-        my $dis = $disasm{$l};
-        my $asm = "";
-        if (defined($dis) && $dis ne '') {
-          $asm = "<span class=\"asm\">" . $dis . "</span>";
-        }
-        my $source_class = (($n1 + $n2 > 0)
-                            ? "livesrc"
-                            : (($asm ne "") ? "deadsrc" : "nop"));
-        printf $output (
-          "<span class=\"line\">%5d</span> " .
-          "<span class=\"%s\">%6s %6s %s</span>%s\n",
-          $l, $source_class,
-          HtmlPrintNumber($n1),
-          HtmlPrintNumber($n2),
-          HtmlEscape($text),
-          $asm);
-      } else {
-        printf $output(
-          "%6s %6s %4d: %s\n",
-          UnparseAlt($n1),
-          UnparseAlt($n2),
-          $l,
-          $text);
-      }
-      if ($l == $lastline)  { print $output $skip_marker; }
-    };
-  }
-  close(FILE);
-  if ($html) {
-    print $output "</pre>\n";
-  }
-  return 1;
-}
-
-# Return the source line for the specified file/linenumber.
-# Returns undef if not found.
-sub SourceLine {
-  my $file = shift;
-  my $line = shift;
-
-  # Look in cache
-  if (!defined($main::source_cache{$file})) {
-    if (100 < scalar keys(%main::source_cache)) {
-      # Clear the cache when it gets too big
-      $main::source_cache = ();
-    }
-
-    # Read all lines from the file
-    if (!open(FILE, "<$file")) {
-      print STDERR "$file: $!\n";
-      $main::source_cache{$file} = [];  # Cache the negative result
-      return undef;
-    }
-    my $lines = [];
-    push(@{$lines}, "");        # So we can use 1-based line numbers as indices
-    while (<FILE>) {
-      push(@{$lines}, $_);
-    }
-    close(FILE);
-
-    # Save the lines in the cache
-    $main::source_cache{$file} = $lines;
-  }
-
-  my $lines = $main::source_cache{$file};
-  if (($line < 0) || ($line > $#{$lines})) {
-    return undef;
-  } else {
-    return $lines->[$line];
-  }
-}
-
-# Print disassembly for one routine with interspersed source if available
-sub PrintDisassembledFunction {
-  my $prog = shift;
-  my $offset = shift;
-  my $routine = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $start_addr = shift;
-  my $end_addr = shift;
-  my $total = shift;
-
-  # Disassemble all instructions
-  my @instructions = Disassemble($prog, $offset, $start_addr, $end_addr);
-
-  # Make array of counts per instruction
-  my @flat_count = ();
-  my @cum_count = ();
-  my $flat_total = 0;
-  my $cum_total = 0;
-  foreach my $e (@instructions) {
-    # Add up counts for all address that fall inside this instruction
-    my $c1 = 0;
-    my $c2 = 0;
-    for (my $a = $e->[0]; $a lt $e->[4]; $a = AddressInc($a)) {
-      $c1 += GetEntry($flat, $a);
-      $c2 += GetEntry($cumulative, $a);
-    }
-    push(@flat_count, $c1);
-    push(@cum_count, $c2);
-    $flat_total += $c1;
-    $cum_total += $c2;
-  }
-
-  # Print header with total counts
-  printf("ROUTINE ====================== %s\n" .
-         "%6s %6s %s (flat, cumulative) %.1f%% of total\n",
-         ShortFunctionName($routine),
-         Unparse($flat_total),
-         Unparse($cum_total),
-         Units(),
-         ($cum_total * 100.0) / $total);
-
-  # Process instructions in order
-  my $current_file = "";
-  for (my $i = 0; $i <= $#instructions; ) {
-    my $e = $instructions[$i];
-
-    # Print the new file name whenever we switch files
-    if ($e->[1] ne $current_file) {
-      $current_file = $e->[1];
-      my $fname = $current_file;
-      $fname =~ s|^\./||;   # Trim leading "./"
-
-      # Shorten long file names
-      if (length($fname) >= 58) {
-        $fname = "..." . substr($fname, -55);
-      }
-      printf("-------------------- %s\n", $fname);
-    }
-
-    # TODO: Compute range of lines to print together to deal with
-    # small reorderings.
-    my $first_line = $e->[2];
-    my $last_line = $first_line;
-    my %flat_sum = ();
-    my %cum_sum = ();
-    for (my $l = $first_line; $l <= $last_line; $l++) {
-      $flat_sum{$l} = 0;
-      $cum_sum{$l} = 0;
-    }
-
-    # Find run of instructions for this range of source lines
-    my $first_inst = $i;
-    while (($i <= $#instructions) &&
-           ($instructions[$i]->[2] >= $first_line) &&
-           ($instructions[$i]->[2] <= $last_line)) {
-      $e = $instructions[$i];
-      $flat_sum{$e->[2]} += $flat_count[$i];
-      $cum_sum{$e->[2]} += $cum_count[$i];
-      $i++;
-    }
-    my $last_inst = $i - 1;
-
-    # Print source lines
-    for (my $l = $first_line; $l <= $last_line; $l++) {
-      my $line = SourceLine($current_file, $l);
-      if (!defined($line)) {
-        $line = "?\n";
-        next;
-      } else {
-        $line =~ s/^\s+//;
-      }
-      printf("%6s %6s %5d: %s",
-             UnparseAlt($flat_sum{$l}),
-             UnparseAlt($cum_sum{$l}),
-             $l,
-             $line);
-    }
-
-    # Print disassembly
-    for (my $x = $first_inst; $x <= $last_inst; $x++) {
-      my $e = $instructions[$x];
-      printf("%6s %6s    %8s: %6s\n",
-             UnparseAlt($flat_count[$x]),
-             UnparseAlt($cum_count[$x]),
-             UnparseAddress($offset, $e->[0]),
-             CleanDisassembly($e->[3]));
-    }
-  }
-}
-
-# Print DOT graph
-sub PrintDot {
-  my $prog = shift;
-  my $symbols = shift;
-  my $raw = shift;
-  my $flat = shift;
-  my $cumulative = shift;
-  my $overall_total = shift;
-
-  # Get total
-  my $local_total = TotalProfile($flat);
-  my $nodelimit = int($main::opt_nodefraction * $local_total);
-  my $edgelimit = int($main::opt_edgefraction * $local_total);
-  my $nodecount = $main::opt_nodecount;
-
-  # Find nodes to include
-  my @list = (sort { abs(GetEntry($cumulative, $b)) <=>
-                     abs(GetEntry($cumulative, $a))
-                     || $a cmp $b }
-              keys(%{$cumulative}));
-  my $last = $nodecount - 1;
-  if ($last > $#list) {
-    $last = $#list;
-  }
-  while (($last >= 0) &&
-         (abs(GetEntry($cumulative, $list[$last])) <= $nodelimit)) {
-    $last--;
-  }
-  if ($last < 0) {
-    print STDERR "No nodes to print\n";
-    return 0;
-  }
-
-  if ($nodelimit > 0 || $edgelimit > 0) {
-    printf STDERR ("Dropping nodes with <= %s %s; edges with <= %s abs(%s)\n",
-                   Unparse($nodelimit), Units(),
-                   Unparse($edgelimit), Units());
-  }
-
-  # Open DOT output file
-  my $output;
-  my $escaped_dot = ShellEscape(@DOT);
-  my $escaped_ps2pdf = ShellEscape(@PS2PDF);
-  if ($main::opt_gv) {
-    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "ps"));
-    $output = "| $escaped_dot -Tps2 >$escaped_outfile";
-  } elsif ($main::opt_evince) {
-    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "pdf"));
-    $output = "| $escaped_dot -Tps2 | $escaped_ps2pdf - $escaped_outfile";
-  } elsif ($main::opt_ps) {
-    $output = "| $escaped_dot -Tps2";
-  } elsif ($main::opt_pdf) {
-    $output = "| $escaped_dot -Tps2 | $escaped_ps2pdf - -";
-  } elsif ($main::opt_web || $main::opt_svg) {
-    # We need to post-process the SVG, so write to a temporary file always.
-    my $escaped_outfile = ShellEscape(TempName($main::next_tmpfile, "svg"));
-    $output = "| $escaped_dot -Tsvg >$escaped_outfile";
-  } elsif ($main::opt_gif) {
-    $output = "| $escaped_dot -Tgif";
-  } else {
-    $output = ">&STDOUT";
-  }
-  open(DOT, $output) || error("$output: $!\n");
-
-  # Title
-  printf DOT ("digraph \"%s; %s %s\" {\n",
-              $prog,
-              Unparse($overall_total),
-              Units());
-  if ($main::opt_pdf) {
-    # The output is more printable if we set the page size for dot.
-    printf DOT ("size=\"8,11\"\n");
-  }
-  printf DOT ("node [width=0.375,height=0.25];\n");
-
-  # Print legend
-  printf DOT ("Legend [shape=box,fontsize=24,shape=plaintext," .
-              "label=\"%s\\l%s\\l%s\\l%s\\l%s\\l\"];\n",
-              $prog,
-              sprintf("Total %s: %s", Units(), Unparse($overall_total)),
-              sprintf("Focusing on: %s", Unparse($local_total)),
-              sprintf("Dropped nodes with <= %s abs(%s)",
-                      Unparse($nodelimit), Units()),
-              sprintf("Dropped edges with <= %s %s",
-                      Unparse($edgelimit), Units())
-              );
-
-  # Print nodes
-  my %node = ();
-  my $nextnode = 1;
-  foreach my $a (@list[0..$last]) {
-    # Pick font size
-    my $f = GetEntry($flat, $a);
-    my $c = GetEntry($cumulative, $a);
-
-    my $fs = 8;
-    if ($local_total > 0) {
-      $fs = 8 + (50.0 * sqrt(abs($f * 1.0 / $local_total)));
-    }
-
-    $node{$a} = $nextnode++;
-    my $sym = $a;
-    $sym =~ s/\s+/\\n/g;
-    $sym =~ s/::/\\n/g;
-
-    # Extra cumulative info to print for non-leaves
-    my $extra = "";
-    if ($f != $c) {
-      $extra = sprintf("\\rof %s (%s)",
-                       Unparse($c),
-                       Percent($c, $local_total));
-    }
-    my $style = "";
-    if ($main::opt_heapcheck) {
-      if ($f > 0) {
-        # make leak-causing nodes more visible (add a background)
-        $style = ",style=filled,fillcolor=gray"
-      } elsif ($f < 0) {
-        # make anti-leak-causing nodes (which almost never occur)
-        # stand out as well (triple border)
-        $style = ",peripheries=3"
-      }
-    }
-
-    printf DOT ("N%d [label=\"%s\\n%s (%s)%s\\r" .
-                "\",shape=box,fontsize=%.1f%s];\n",
-                $node{$a},
-                $sym,
-                Unparse($f),
-                Percent($f, $local_total),
-                $extra,
-                $fs,
-                $style,
-               );
-  }
-
-  # Get edges and counts per edge
-  my %edge = ();
-  my $n;
-  my $fullname_to_shortname_map = {};
-  FillFullnameToShortnameMap($symbols, $fullname_to_shortname_map);
-  foreach my $k (keys(%{$raw})) {
-    # TODO: omit low %age edges
-    $n = $raw->{$k};
-    my @translated = TranslateStack($symbols, $fullname_to_shortname_map, $k);
-    for (my $i = 1; $i <= $#translated; $i++) {
-      my $src = $translated[$i];
-      my $dst = $translated[$i-1];
-      #next if ($src eq $dst);  # Avoid self-edges?
-      if (exists($node{$src}) && exists($node{$dst})) {
-        my $edge_label = "$src\001$dst";
-        if (!exists($edge{$edge_label})) {
-          $edge{$edge_label} = 0;
-        }
-        $edge{$edge_label} += $n;
-      }
-    }
-  }
-
-  # Print edges (process in order of decreasing counts)
-  my %indegree = ();   # Number of incoming edges added per node so far
-  my %outdegree = ();  # Number of outgoing edges added per node so far
-  foreach my $e (sort { $edge{$b} <=> $edge{$a} } keys(%edge)) {
-    my @x = split(/\001/, $e);
-    $n = $edge{$e};
-
-    # Initialize degree of kept incoming and outgoing edges if necessary
-    my $src = $x[0];
-    my $dst = $x[1];
-    if (!exists($outdegree{$src})) { $outdegree{$src} = 0; }
-    if (!exists($indegree{$dst})) { $indegree{$dst} = 0; }
-
-    my $keep;
-    if ($indegree{$dst} == 0) {
-      # Keep edge if needed for reachability
-      $keep = 1;
-    } elsif (abs($n) <= $edgelimit) {
-      # Drop if we are below --edgefraction
-      $keep = 0;
-    } elsif ($outdegree{$src} >= $main::opt_maxdegree ||
-             $indegree{$dst} >= $main::opt_maxdegree) {
-      # Keep limited number of in/out edges per node
-      $keep = 0;
-    } else {
-      $keep = 1;
-    }
-
-    if ($keep) {
-      $outdegree{$src}++;
-      $indegree{$dst}++;
-
-      # Compute line width based on edge count
-      my $fraction = abs($local_total ? (3 * ($n / $local_total)) : 0);
-      if ($fraction > 1) { $fraction = 1; }
-      my $w = $fraction * 2;
-      if ($w < 1 && ($main::opt_web || $main::opt_svg)) {
-        # SVG output treats line widths < 1 poorly.
-        $w = 1;
-      }
-
-      # Dot sometimes segfaults if given edge weights that are too large, so
-      # we cap the weights at a large value
-      my $edgeweight = abs($n) ** 0.7;
-      if ($edgeweight > 100000) { $edgeweight = 100000; }
-      $edgeweight = int($edgeweight);
-
-      my $style = sprintf("setlinewidth(%f)", $w);
-      if ($x[1] =~ m/\(inline\)/) {
-        $style .= ",dashed";
-      }
-
-      # Use a slightly squashed function of the edge count as the weight
-      printf DOT ("N%s -> N%s [label=%s, weight=%d, style=\"%s\"];\n",
-                  $node{$x[0]},
-                  $node{$x[1]},
-                  Unparse($n),
-                  $edgeweight,
-                  $style);
-    }
-  }
-
-  print DOT ("}\n");
-  close(DOT);
-
-  if ($main::opt_web || $main::opt_svg) {
-    # Rewrite SVG to be more usable inside web browser.
-    RewriteSvg(TempName($main::next_tmpfile, "svg"));
-  }
-
-  return 1;
-}
-
-sub RewriteSvg {
-  my $svgfile = shift;
-
-  open(SVG, $svgfile) || die "open temp svg: $!";
-  my @svg = <SVG>;
-  close(SVG);
-  unlink $svgfile;
-  my $svg = join('', @svg);
-
-  # Dot's SVG output is
-  #
-  #    <svg width="___" height="___"
-  #     viewBox="___" xmlns=...>
-  #    <g id="graph0" transform="...">
-  #    ...
-  #    </g>
-  #    </svg>
-  #
-  # Change it to
-  #
-  #    <svg width="100%" height="100%"
-  #     xmlns=...>
-  #    $svg_javascript
-  #    <g id="viewport" transform="translate(0,0)">
-  #    <g id="graph0" transform="...">
-  #    ...
-  #    </g>
-  #    </g>
-  #    </svg>
-
-  # Fix width, height; drop viewBox.
-  $svg =~ s/(?s)<svg width="[^"]+" height="[^"]+"(.*?)viewBox="[^"]+"/<svg width="100%" height="100%"$1/;
-
-  # Insert script, viewport <g> above first <g>
-  my $svg_javascript = SvgJavascript();
-  my $viewport = "<g id=\"viewport\" transform=\"translate(0,0)\">\n";
-  $svg =~ s/<g id="graph\d"/$svg_javascript$viewport$&/;
-
-  # Insert final </g> above </svg>.
-  $svg =~ s/(.*)(<\/svg>)/$1<\/g>$2/;
-  $svg =~ s/<g id="graph\d"(.*?)/<g id="viewport"$1/;
-
-  if ($main::opt_svg) {
-    # --svg: write to standard output.
-    print $svg;
-  } else {
-    # Write back to temporary file.
-    open(SVG, ">$svgfile") || die "open $svgfile: $!";
-    print SVG $svg;
-    close(SVG);
-  }
-}
-
-sub SvgJavascript {
-  return <<'EOF';
-<script type="text/ecmascript"><![CDATA[
-// SVGPan
-// http://www.cyberz.org/blog/2009/12/08/svgpan-a-javascript-svg-panzoomdrag-library/
-// Local modification: if(true || ...) below to force panning, never moving.
-
-/**
- *  SVGPan library 1.2
- * ====================
- *
- * Given an unique existing element with id "viewport", including the
- * the library into any SVG adds the following capabilities:
- *
- *  - Mouse panning
- *  - Mouse zooming (using the wheel)
- *  - Object dargging
- *
- * Known issues:
- *
- *  - Zooming (while panning) on Safari has still some issues
- *
- * Releases:
- *
- * 1.2, Sat Mar 20 08:42:50 GMT 2010, Zeng Xiaohui
- *	Fixed a bug with browser mouse handler interaction
- *
- * 1.1, Wed Feb  3 17:39:33 GMT 2010, Zeng Xiaohui
- *	Updated the zoom code to support the mouse wheel on Safari/Chrome
- *
- * 1.0, Andrea Leofreddi
- *	First release
- *
- * This code is licensed under the following BSD license:
- *
- * Copyright 2009-2010 Andrea Leofreddi <a.leofreddi@itcharm.com>. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without modification, are
- * permitted provided that the following conditions are met:
- *
- *    1. Redistributions of source code must retain the above copyright notice, this list of
- *       conditions and the following disclaimer.
- *
- *    2. Redistributions in binary form must reproduce the above copyright notice, this list
- *       of conditions and the following disclaimer in the documentation and/or other materials
- *       provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY Andrea Leofreddi ``AS IS'' AND ANY EXPRESS OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
- * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Andrea Leofreddi OR
- * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
- * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
- * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * The views and conclusions contained in the software and documentation are those of the
- * authors and should not be interpreted as representing official policies, either expressed
- * or implied, of Andrea Leofreddi.
- */
-
-var root = document.documentElement;
-
-var state = 'none', stateTarget, stateOrigin, stateTf;
-
-setupHandlers(root);
-
-/**
- * Register handlers
- */
-function setupHandlers(root){
-	setAttributes(root, {
-		"onmouseup" : "add(evt)",
-		"onmousedown" : "handleMouseDown(evt)",
-		"onmousemove" : "handleMouseMove(evt)",
-		"onmouseup" : "handleMouseUp(evt)",
-		//"onmouseout" : "handleMouseUp(evt)", // Decomment this to stop the pan functionality when dragging out of the SVG element
-	});
-
-	if(navigator.userAgent.toLowerCase().indexOf('webkit') >= 0)
-		window.addEventListener('mousewheel', handleMouseWheel, false); // Chrome/Safari
-	else
-		window.addEventListener('DOMMouseScroll', handleMouseWheel, false); // Others
-
-	var g = svgDoc.getElementById("svg");
-	g.width = "100%";
-	g.height = "100%";
-}
-
-/**
- * Instance an SVGPoint object with given event coordinates.
- */
-function getEventPoint(evt) {
-	var p = root.createSVGPoint();
-
-	p.x = evt.clientX;
-	p.y = evt.clientY;
-
-	return p;
-}
-
-/**
- * Sets the current transform matrix of an element.
- */
-function setCTM(element, matrix) {
-	var s = "matrix(" + matrix.a + "," + matrix.b + "," + matrix.c + "," + matrix.d + "," + matrix.e + "," + matrix.f + ")";
-
-	element.setAttribute("transform", s);
-}
-
-/**
- * Dumps a matrix to a string (useful for debug).
- */
-function dumpMatrix(matrix) {
-	var s = "[ " + matrix.a + ", " + matrix.c + ", " + matrix.e + "\n  " + matrix.b + ", " + matrix.d + ", " + matrix.f + "\n  0, 0, 1 ]";
-
-	return s;
-}
-
-/**
- * Sets attributes of an element.
- */
-function setAttributes(element, attributes){
-	for (i in attributes)
-		element.setAttributeNS(null, i, attributes[i]);
-}
-
-/**
- * Handle mouse move event.
- */
-function handleMouseWheel(evt) {
-	if(evt.preventDefault)
-		evt.preventDefault();
-
-	evt.returnValue = false;
-
-	var svgDoc = evt.target.ownerDocument;
-
-	var delta;
-
-	if(evt.wheelDelta)
-		delta = evt.wheelDelta / 3600; // Chrome/Safari
-	else
-		delta = evt.detail / -90; // Mozilla
-
-	var z = 1 + delta; // Zoom factor: 0.9/1.1
-
-	var g = svgDoc.getElementById("viewport");
-
-	var p = getEventPoint(evt);
-
-	p = p.matrixTransform(g.getCTM().inverse());
-
-	// Compute new scale matrix in current mouse position
-	var k = root.createSVGMatrix().translate(p.x, p.y).scale(z).translate(-p.x, -p.y);
-
-        setCTM(g, g.getCTM().multiply(k));
-
-	stateTf = stateTf.multiply(k.inverse());
-}
-
-/**
- * Handle mouse move event.
- */
-function handleMouseMove(evt) {
-	if(evt.preventDefault)
-		evt.preventDefault();
-
-	evt.returnValue = false;
-
-	var svgDoc = evt.target.ownerDocument;
-
-	var g = svgDoc.getElementById("viewport");
-
-	if(state == 'pan') {
-		// Pan mode
-		var p = getEventPoint(evt).matrixTransform(stateTf);
-
-		setCTM(g, stateTf.inverse().translate(p.x - stateOrigin.x, p.y - stateOrigin.y));
-	} else if(state == 'move') {
-		// Move mode
-		var p = getEventPoint(evt).matrixTransform(g.getCTM().inverse());
-
-		setCTM(stateTarget, root.createSVGMatrix().translate(p.x - stateOrigin.x, p.y - stateOrigin.y).multiply(g.getCTM().inverse()).multiply(stateTarget.getCTM()));
-
-		stateOrigin = p;
-	}
-}
-
-/**
- * Handle click event.
- */
-function handleMouseDown(evt) {
-	if(evt.preventDefault)
-		evt.preventDefault();
-
-	evt.returnValue = false;
-
-	var svgDoc = evt.target.ownerDocument;
-
-	var g = svgDoc.getElementById("viewport");
-
-	if(true || evt.target.tagName == "svg") {
-		// Pan mode
-		state = 'pan';
-
-		stateTf = g.getCTM().inverse();
-
-		stateOrigin = getEventPoint(evt).matrixTransform(stateTf);
-	} else {
-		// Move mode
-		state = 'move';
-
-		stateTarget = evt.target;
-
-		stateTf = g.getCTM().inverse();
-
-		stateOrigin = getEventPoint(evt).matrixTransform(stateTf);
-	}
-}
-
-/**
- * Handle mouse button release event.
- */
-function handleMouseUp(evt) {
-	if(evt.preventDefault)
-		evt.preventDefault();
-
-	evt.returnValue = false;
-
-	var svgDoc = evt.target.ownerDocument;
-
-	if(state == 'pan' || state == 'move') {
-		// Quit pan mode
-		state = '';
-	}
-}
-
-]]></script>
-EOF
-}
-
-# Provides a map from fullname to shortname for cases where the
-# shortname is ambiguous.  The symlist has both the fullname and
-# shortname for all symbols, which is usually fine, but sometimes --
-# such as overloaded functions -- two different fullnames can map to
-# the same shortname.  In that case, we use the address of the
-# function to disambiguate the two.  This function fills in a map that
-# maps fullnames to modified shortnames in such cases.  If a fullname
-# is not present in the map, the 'normal' shortname provided by the
-# symlist is the appropriate one to use.
-sub FillFullnameToShortnameMap {
-  my $symbols = shift;
-  my $fullname_to_shortname_map = shift;
-  my $shortnames_seen_once = {};
-  my $shortnames_seen_more_than_once = {};
-
-  foreach my $symlist (values(%{$symbols})) {
-    # TODO(csilvers): deal with inlined symbols too.
-    my $shortname = $symlist->[0];
-    my $fullname = $symlist->[2];
-    if ($fullname !~ /<[0-9a-fA-F]+>$/) {  # fullname doesn't end in an address
-      next;       # the only collisions we care about are when addresses differ
-    }
-    if (defined($shortnames_seen_once->{$shortname}) &&
-        $shortnames_seen_once->{$shortname} ne $fullname) {
-      $shortnames_seen_more_than_once->{$shortname} = 1;
-    } else {
-      $shortnames_seen_once->{$shortname} = $fullname;
-    }
-  }
-
-  foreach my $symlist (values(%{$symbols})) {
-    my $shortname = $symlist->[0];
-    my $fullname = $symlist->[2];
-    # TODO(csilvers): take in a list of addresses we care about, and only
-    # store in the map if $symlist->[1] is in that list.  Saves space.
-    next if defined($fullname_to_shortname_map->{$fullname});
-    if (defined($shortnames_seen_more_than_once->{$shortname})) {
-      if ($fullname =~ /<0*([^>]*)>$/) {   # fullname has address at end of it
-        $fullname_to_shortname_map->{$fullname} = "$shortname\@$1";
-      }
-    }
-  }
-}
-
-# Return a small number that identifies the argument.
-# Multiple calls with the same argument will return the same number.
-# Calls with different arguments will return different numbers.
-sub ShortIdFor {
-  my $key = shift;
-  my $id = $main::uniqueid{$key};
-  if (!defined($id)) {
-    $id = keys(%main::uniqueid) + 1;
-    $main::uniqueid{$key} = $id;
-  }
-  return $id;
-}
-
-# Translate a stack of addresses into a stack of symbols
-sub TranslateStack {
-  my $symbols = shift;
-  my $fullname_to_shortname_map = shift;
-  my $k = shift;
-
-  my @addrs = split(/\n/, $k);
-  my @result = ();
-  for (my $i = 0; $i <= $#addrs; $i++) {
-    my $a = $addrs[$i];
-
-    # Skip large addresses since they sometimes show up as fake entries on RH9
-    if (length($a) > 8 && $a gt "7fffffffffffffff") {
-      next;
-    }
-
-    if ($main::opt_disasm || $main::opt_list) {
-      # We want just the address for the key
-      push(@result, $a);
-      next;
-    }
-
-    my $symlist = $symbols->{$a};
-    if (!defined($symlist)) {
-      $symlist = [$a, "", $a];
-    }
-
-    # We can have a sequence of symbols for a particular entry
-    # (more than one symbol in the case of inlining).  Callers
-    # come before callees in symlist, so walk backwards since
-    # the translated stack should contain callees before callers.
-    for (my $j = $#{$symlist}; $j >= 2; $j -= 3) {
-      my $func = $symlist->[$j-2];
-      my $fileline = $symlist->[$j-1];
-      my $fullfunc = $symlist->[$j];
-      if (defined($fullname_to_shortname_map->{$fullfunc})) {
-        $func = $fullname_to_shortname_map->{$fullfunc};
-      }
-      if ($j > 2) {
-        $func = "$func (inline)";
-      }
-
-      # Do not merge nodes corresponding to Callback::Run since that
-      # causes confusing cycles in dot display.  Instead, we synthesize
-      # a unique name for this frame per caller.
-      if ($func =~ m/Callback.*::Run$/) {
-        my $caller = ($i > 0) ? $addrs[$i-1] : 0;
-        $func = "Run#" . ShortIdFor($caller);
-      }
-
-      if ($main::opt_addresses) {
-        push(@result, "$a $func $fileline");
-      } elsif ($main::opt_lines) {
-        if ($func eq '??' && $fileline eq '??:0') {
-          push(@result, "$a");
-        } else {
-          push(@result, "$func $fileline");
-        }
-      } elsif ($main::opt_functions) {
-        if ($func eq '??') {
-          push(@result, "$a");
-        } else {
-          push(@result, $func);
-        }
-      } elsif ($main::opt_files) {
-        if ($fileline eq '??:0' || $fileline eq '') {
-          push(@result, "$a");
-        } else {
-          my $f = $fileline;
-          $f =~ s/:\d+$//;
-          push(@result, $f);
-        }
-      } else {
-        push(@result, $a);
-        last;  # Do not print inlined info
-      }
-    }
-  }
-
-  # print join(",", @addrs), " => ", join(",", @result), "\n";
-  return @result;
-}
-
-# Generate percent string for a number and a total
-sub Percent {
-  my $num = shift;
-  my $tot = shift;
-  if ($tot != 0) {
-    return sprintf("%.1f%%", $num * 100.0 / $tot);
-  } else {
-    return ($num == 0) ? "nan" : (($num > 0) ? "+inf" : "-inf");
-  }
-}
-
-# Generate pretty-printed form of number
-sub Unparse {
-  my $num = shift;
-  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
-    if ($main::opt_inuse_objects || $main::opt_alloc_objects) {
-      return sprintf("%d", $num);
-    } else {
-      if ($main::opt_show_bytes) {
-        return sprintf("%d", $num);
-      } else {
-        return sprintf("%.1f", $num / 1048576.0);
-      }
-    }
-  } elsif ($main::profile_type eq 'contention' && !$main::opt_contentions) {
-    return sprintf("%.3f", $num / 1e9); # Convert nanoseconds to seconds
-  } else {
-    return sprintf("%d", $num);
-  }
-}
-
-# Alternate pretty-printed form: 0 maps to "."
-sub UnparseAlt {
-  my $num = shift;
-  if ($num == 0) {
-    return ".";
-  } else {
-    return Unparse($num);
-  }
-}
-
-# Alternate pretty-printed form: 0 maps to ""
-sub HtmlPrintNumber {
-  my $num = shift;
-  if ($num == 0) {
-    return "";
-  } else {
-    return Unparse($num);
-  }
-}
-
-# Return output units
-sub Units {
-  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
-    if ($main::opt_inuse_objects || $main::opt_alloc_objects) {
-      return "objects";
-    } else {
-      if ($main::opt_show_bytes) {
-        return "B";
-      } else {
-        return "MB";
-      }
-    }
-  } elsif ($main::profile_type eq 'contention' && !$main::opt_contentions) {
-    return "seconds";
-  } else {
-    return "samples";
-  }
-}
-
-##### Profile manipulation code #####
-
-# Generate flattened profile:
-# If count is charged to stack [a,b,c,d], in generated profile,
-# it will be charged to [a]
-sub FlatProfile {
-  my $profile = shift;
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    if ($#addrs >= 0) {
-      AddEntry($result, $addrs[0], $count);
-    }
-  }
-  return $result;
-}
-
-# Generate cumulative profile:
-# If count is charged to stack [a,b,c,d], in generated profile,
-# it will be charged to [a], [b], [c], [d]
-sub CumulativeProfile {
-  my $profile = shift;
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    foreach my $a (@addrs) {
-      AddEntry($result, $a, $count);
-    }
-  }
-  return $result;
-}
-
-# If the second-youngest PC on the stack is always the same, returns
-# that pc.  Otherwise, returns undef.
-sub IsSecondPcAlwaysTheSame {
-  my $profile = shift;
-
-  my $second_pc = undef;
-  foreach my $k (keys(%{$profile})) {
-    my @addrs = split(/\n/, $k);
-    if ($#addrs < 1) {
-      return undef;
-    }
-    if (not defined $second_pc) {
-      $second_pc = $addrs[1];
-    } else {
-      if ($second_pc ne $addrs[1]) {
-        return undef;
-      }
-    }
-  }
-  return $second_pc;
-}
-
-sub ExtractSymbolLocation {
-  my $symbols = shift;
-  my $address = shift;
-  # 'addr2line' outputs "??:0" for unknown locations; we do the
-  # same to be consistent.
-  my $location = "??:0:unknown";
-  if (exists $symbols->{$address}) {
-    my $file = $symbols->{$address}->[1];
-    if ($file eq "?") {
-      $file = "??:0"
-    }
-    $location = $file . ":" . $symbols->{$address}->[0];
-  }
-  return $location;
-}
-
-# Extracts a graph of calls.
-sub ExtractCalls {
-  my $symbols = shift;
-  my $profile = shift;
-
-  my $calls = {};
-  while( my ($stack_trace, $count) = each %$profile ) {
-    my @address = split(/\n/, $stack_trace);
-    my $destination = ExtractSymbolLocation($symbols, $address[0]);
-    AddEntry($calls, $destination, $count);
-    for (my $i = 1; $i <= $#address; $i++) {
-      my $source = ExtractSymbolLocation($symbols, $address[$i]);
-      my $call = "$source -> $destination";
-      AddEntry($calls, $call, $count);
-      $destination = $source;
-    }
-  }
-
-  return $calls;
-}
-
-sub FilterFrames {
-  my $symbols = shift;
-  my $profile = shift;
-
-  if ($main::opt_retain eq '' && $main::opt_exclude eq '') {
-    return $profile;
-  }
-
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    my @path = ();
-    foreach my $a (@addrs) {
-      my $sym;
-      if (exists($symbols->{$a})) {
-        $sym = $symbols->{$a}->[0];
-      } else {
-        $sym = $a;
-      }
-      if ($main::opt_retain ne '' && $sym !~ m/$main::opt_retain/) {
-        next;
-      }
-      if ($main::opt_exclude ne '' && $sym =~ m/$main::opt_exclude/) {
-        next;
-      }
-      push(@path, $a);
-    }
-    if (scalar(@path) > 0) {
-      my $reduced_path = join("\n", @path);
-      AddEntry($result, $reduced_path, $count);
-    }
-  }
-
-  return $result;
-}
-
-sub RemoveUninterestingFrames {
-  my $symbols = shift;
-  my $profile = shift;
-
-  # List of function names to skip
-  my %skip = ();
-  my $skip_regexp = 'NOMATCH';
-  if ($main::profile_type eq 'heap' || $main::profile_type eq 'growth') {
-    foreach my $name ('@JEMALLOC_PREFIX@calloc',
-                      'cfree',
-                      '@JEMALLOC_PREFIX@malloc',
-                      'newImpl',
-                      'void* newImpl',
-                      '@JEMALLOC_PREFIX@free',
-                      '@JEMALLOC_PREFIX@memalign',
-                      '@JEMALLOC_PREFIX@posix_memalign',
-                      '@JEMALLOC_PREFIX@aligned_alloc',
-                      'pvalloc',
-                      '@JEMALLOC_PREFIX@valloc',
-                      '@JEMALLOC_PREFIX@realloc',
-                      '@JEMALLOC_PREFIX@mallocx',
-                      '@JEMALLOC_PREFIX@rallocx',
-                      '@JEMALLOC_PREFIX@xallocx',
-                      '@JEMALLOC_PREFIX@dallocx',
-                      '@JEMALLOC_PREFIX@sdallocx',
-                      'tc_calloc',
-                      'tc_cfree',
-                      'tc_malloc',
-                      'tc_free',
-                      'tc_memalign',
-                      'tc_posix_memalign',
-                      'tc_pvalloc',
-                      'tc_valloc',
-                      'tc_realloc',
-                      'tc_new',
-                      'tc_delete',
-                      'tc_newarray',
-                      'tc_deletearray',
-                      'tc_new_nothrow',
-                      'tc_newarray_nothrow',
-                      'do_malloc',
-                      '::do_malloc',   # new name -- got moved to an unnamed ns
-                      '::do_malloc_or_cpp_alloc',
-                      'DoSampledAllocation',
-                      'simple_alloc::allocate',
-                      '__malloc_alloc_template::allocate',
-                      '__builtin_delete',
-                      '__builtin_new',
-                      '__builtin_vec_delete',
-                      '__builtin_vec_new',
-                      'operator new',
-                      'operator new[]',
-                      # The entry to our memory-allocation routines on OS X
-                      'malloc_zone_malloc',
-                      'malloc_zone_calloc',
-                      'malloc_zone_valloc',
-                      'malloc_zone_realloc',
-                      'malloc_zone_memalign',
-                      'malloc_zone_free',
-                      # These mark the beginning/end of our custom sections
-                      '__start_google_malloc',
-                      '__stop_google_malloc',
-                      '__start_malloc_hook',
-                      '__stop_malloc_hook') {
-      $skip{$name} = 1;
-      $skip{"_" . $name} = 1;   # Mach (OS X) adds a _ prefix to everything
-    }
-    # TODO: Remove TCMalloc once everything has been
-    # moved into the tcmalloc:: namespace and we have flushed
-    # old code out of the system.
-    $skip_regexp = "TCMalloc|^tcmalloc::";
-  } elsif ($main::profile_type eq 'contention') {
-    foreach my $vname ('base::RecordLockProfileData',
-                       'base::SubmitMutexProfileData',
-                       'base::SubmitSpinLockProfileData',
-                       'Mutex::Unlock',
-                       'Mutex::UnlockSlow',
-                       'Mutex::ReaderUnlock',
-                       'MutexLock::~MutexLock',
-                       'SpinLock::Unlock',
-                       'SpinLock::SlowUnlock',
-                       'SpinLockHolder::~SpinLockHolder') {
-      $skip{$vname} = 1;
-    }
-  } elsif ($main::profile_type eq 'cpu') {
-    # Drop signal handlers used for CPU profile collection
-    # TODO(dpeng): this should not be necessary; it's taken
-    # care of by the general 2nd-pc mechanism below.
-    foreach my $name ('ProfileData::Add',           # historical
-                      'ProfileData::prof_handler',  # historical
-                      'CpuProfiler::prof_handler',
-                      '__FRAME_END__',
-                      '__pthread_sighandler',
-                      '__restore') {
-      $skip{$name} = 1;
-    }
-  } else {
-    # Nothing skipped for unknown types
-  }
-
-  if ($main::profile_type eq 'cpu') {
-    # If all the second-youngest program counters are the same,
-    # this STRONGLY suggests that it is an artifact of measurement,
-    # i.e., stack frames pushed by the CPU profiler signal handler.
-    # Hence, we delete them.
-    # (The topmost PC is read from the signal structure, not from
-    # the stack, so it does not get involved.)
-    while (my $second_pc = IsSecondPcAlwaysTheSame($profile)) {
-      my $result = {};
-      my $func = '';
-      if (exists($symbols->{$second_pc})) {
-        $second_pc = $symbols->{$second_pc}->[0];
-      }
-      print STDERR "Removing $second_pc from all stack traces.\n";
-      foreach my $k (keys(%{$profile})) {
-        my $count = $profile->{$k};
-        my @addrs = split(/\n/, $k);
-        splice @addrs, 1, 1;
-        my $reduced_path = join("\n", @addrs);
-        AddEntry($result, $reduced_path, $count);
-      }
-      $profile = $result;
-    }
-  }
-
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    my @path = ();
-    foreach my $a (@addrs) {
-      if (exists($symbols->{$a})) {
-        my $func = $symbols->{$a}->[0];
-        if ($skip{$func} || ($func =~ m/$skip_regexp/)) {
-          # Throw away the portion of the backtrace seen so far, under the
-          # assumption that previous frames were for functions internal to the
-          # allocator.
-          @path = ();
-          next;
-        }
-      }
-      push(@path, $a);
-    }
-    my $reduced_path = join("\n", @path);
-    AddEntry($result, $reduced_path, $count);
-  }
-
-  $result = FilterFrames($symbols, $result);
-
-  return $result;
-}
-
-# Reduce profile to granularity given by user
-sub ReduceProfile {
-  my $symbols = shift;
-  my $profile = shift;
-  my $result = {};
-  my $fullname_to_shortname_map = {};
-  FillFullnameToShortnameMap($symbols, $fullname_to_shortname_map);
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @translated = TranslateStack($symbols, $fullname_to_shortname_map, $k);
-    my @path = ();
-    my %seen = ();
-    $seen{''} = 1;      # So that empty keys are skipped
-    foreach my $e (@translated) {
-      # To avoid double-counting due to recursion, skip a stack-trace
-      # entry if it has already been seen
-      if (!$seen{$e}) {
-        $seen{$e} = 1;
-        push(@path, $e);
-      }
-    }
-    my $reduced_path = join("\n", @path);
-    AddEntry($result, $reduced_path, $count);
-  }
-  return $result;
-}
-
-# Does the specified symbol array match the regexp?
-sub SymbolMatches {
-  my $sym = shift;
-  my $re = shift;
-  if (defined($sym)) {
-    for (my $i = 0; $i < $#{$sym}; $i += 3) {
-      if ($sym->[$i] =~ m/$re/ || $sym->[$i+1] =~ m/$re/) {
-        return 1;
-      }
-    }
-  }
-  return 0;
-}
-
-# Focus only on paths involving specified regexps
-sub FocusProfile {
-  my $symbols = shift;
-  my $profile = shift;
-  my $focus = shift;
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    foreach my $a (@addrs) {
-      # Reply if it matches either the address/shortname/fileline
-      if (($a =~ m/$focus/) || SymbolMatches($symbols->{$a}, $focus)) {
-        AddEntry($result, $k, $count);
-        last;
-      }
-    }
-  }
-  return $result;
-}
-
-# Focus only on paths not involving specified regexps
-sub IgnoreProfile {
-  my $symbols = shift;
-  my $profile = shift;
-  my $ignore = shift;
-  my $result = {};
-  foreach my $k (keys(%{$profile})) {
-    my $count = $profile->{$k};
-    my @addrs = split(/\n/, $k);
-    my $matched = 0;
-    foreach my $a (@addrs) {
-      # Reply if it matches either the address/shortname/fileline
-      if (($a =~ m/$ignore/) || SymbolMatches($symbols->{$a}, $ignore)) {
-        $matched = 1;
-        last;
-      }
-    }
-    if (!$matched) {
-      AddEntry($result, $k, $count);
-    }
-  }
-  return $result;
-}
-
-# Get total count in profile
-sub TotalProfile {
-  my $profile = shift;
-  my $result = 0;
-  foreach my $k (keys(%{$profile})) {
-    $result += $profile->{$k};
-  }
-  return $result;
-}
-
-# Add A to B
-sub AddProfile {
-  my $A = shift;
-  my $B = shift;
-
-  my $R = {};
-  # add all keys in A
-  foreach my $k (keys(%{$A})) {
-    my $v = $A->{$k};
-    AddEntry($R, $k, $v);
-  }
-  # add all keys in B
-  foreach my $k (keys(%{$B})) {
-    my $v = $B->{$k};
-    AddEntry($R, $k, $v);
-  }
-  return $R;
-}
-
-# Merges symbol maps
-sub MergeSymbols {
-  my $A = shift;
-  my $B = shift;
-
-  my $R = {};
-  foreach my $k (keys(%{$A})) {
-    $R->{$k} = $A->{$k};
-  }
-  if (defined($B)) {
-    foreach my $k (keys(%{$B})) {
-      $R->{$k} = $B->{$k};
-    }
-  }
-  return $R;
-}
-
-
-# Add A to B
-sub AddPcs {
-  my $A = shift;
-  my $B = shift;
-
-  my $R = {};
-  # add all keys in A
-  foreach my $k (keys(%{$A})) {
-    $R->{$k} = 1
-  }
-  # add all keys in B
-  foreach my $k (keys(%{$B})) {
-    $R->{$k} = 1
-  }
-  return $R;
-}
-
-# Subtract B from A
-sub SubtractProfile {
-  my $A = shift;
-  my $B = shift;
-
-  my $R = {};
-  foreach my $k (keys(%{$A})) {
-    my $v = $A->{$k} - GetEntry($B, $k);
-    if ($v < 0 && $main::opt_drop_negative) {
-      $v = 0;
-    }
-    AddEntry($R, $k, $v);
-  }
-  if (!$main::opt_drop_negative) {
-    # Take care of when subtracted profile has more entries
-    foreach my $k (keys(%{$B})) {
-      if (!exists($A->{$k})) {
-        AddEntry($R, $k, 0 - $B->{$k});
-      }
-    }
-  }
-  return $R;
-}
-
-# Get entry from profile; zero if not present
-sub GetEntry {
-  my $profile = shift;
-  my $k = shift;
-  if (exists($profile->{$k})) {
-    return $profile->{$k};
-  } else {
-    return 0;
-  }
-}
-
-# Add entry to specified profile
-sub AddEntry {
-  my $profile = shift;
-  my $k = shift;
-  my $n = shift;
-  if (!exists($profile->{$k})) {
-    $profile->{$k} = 0;
-  }
-  $profile->{$k} += $n;
-}
-
-# Add a stack of entries to specified profile, and add them to the $pcs
-# list.
-sub AddEntries {
-  my $profile = shift;
-  my $pcs = shift;
-  my $stack = shift;
-  my $count = shift;
-  my @k = ();
-
-  foreach my $e (split(/\s+/, $stack)) {
-    my $pc = HexExtend($e);
-    $pcs->{$pc} = 1;
-    push @k, $pc;
-  }
-  AddEntry($profile, (join "\n", @k), $count);
-}
-
-##### Code to profile a server dynamically #####
-
-sub CheckSymbolPage {
-  my $url = SymbolPageURL();
-  my $command = ShellEscape(@URL_FETCHER, $url);
-  open(SYMBOL, "$command |") or error($command);
-  my $line = <SYMBOL>;
-  $line =~ s/\r//g;         # turn windows-looking lines into unix-looking lines
-  close(SYMBOL);
-  unless (defined($line)) {
-    error("$url doesn't exist\n");
-  }
-
-  if ($line =~ /^num_symbols:\s+(\d+)$/) {
-    if ($1 == 0) {
-      error("Stripped binary. No symbols available.\n");
-    }
-  } else {
-    error("Failed to get the number of symbols from $url\n");
-  }
-}
-
-sub IsProfileURL {
-  my $profile_name = shift;
-  if (-f $profile_name) {
-    printf STDERR "Using local file $profile_name.\n";
-    return 0;
-  }
-  return 1;
-}
-
-sub ParseProfileURL {
-  my $profile_name = shift;
-
-  if (!defined($profile_name) || $profile_name eq "") {
-    return ();
-  }
-
-  # Split profile URL - matches all non-empty strings, so no test.
-  $profile_name =~ m,^(https?://)?([^/]+)(.*?)(/|$PROFILES)?$,;
-
-  my $proto = $1 || "http://";
-  my $hostport = $2;
-  my $prefix = $3;
-  my $profile = $4 || "/";
-
-  my $host = $hostport;
-  $host =~ s/:.*//;
-
-  my $baseurl = "$proto$hostport$prefix";
-  return ($host, $baseurl, $profile);
-}
-
-# We fetch symbols from the first profile argument.
-sub SymbolPageURL {
-  my ($host, $baseURL, $path) = ParseProfileURL($main::pfile_args[0]);
-  return "$baseURL$SYMBOL_PAGE";
-}
-
-sub FetchProgramName() {
-  my ($host, $baseURL, $path) = ParseProfileURL($main::pfile_args[0]);
-  my $url = "$baseURL$PROGRAM_NAME_PAGE";
-  my $command_line = ShellEscape(@URL_FETCHER, $url);
-  open(CMDLINE, "$command_line |") or error($command_line);
-  my $cmdline = <CMDLINE>;
-  $cmdline =~ s/\r//g;   # turn windows-looking lines into unix-looking lines
-  close(CMDLINE);
-  error("Failed to get program name from $url\n") unless defined($cmdline);
-  $cmdline =~ s/\x00.+//;  # Remove argv[1] and latters.
-  $cmdline =~ s!\n!!g;  # Remove LFs.
-  return $cmdline;
-}
-
-# Gee, curl's -L (--location) option isn't reliable at least
-# with its 7.12.3 version.  Curl will forget to post data if
-# there is a redirection.  This function is a workaround for
-# curl.  Redirection happens on borg hosts.
-sub ResolveRedirectionForCurl {
-  my $url = shift;
-  my $command_line = ShellEscape(@URL_FETCHER, "--head", $url);
-  open(CMDLINE, "$command_line |") or error($command_line);
-  while (<CMDLINE>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    if (/^Location: (.*)/) {
-      $url = $1;
-    }
-  }
-  close(CMDLINE);
-  return $url;
-}
-
-# Add a timeout flat to URL_FETCHER.  Returns a new list.
-sub AddFetchTimeout {
-  my $timeout = shift;
-  my @fetcher = @_;
-  if (defined($timeout)) {
-    if (join(" ", @fetcher) =~ m/\bcurl -s/) {
-      push(@fetcher, "--max-time", sprintf("%d", $timeout));
-    } elsif (join(" ", @fetcher) =~ m/\brpcget\b/) {
-      push(@fetcher, sprintf("--deadline=%d", $timeout));
-    }
-  }
-  return @fetcher;
-}
-
-# Reads a symbol map from the file handle name given as $1, returning
-# the resulting symbol map.  Also processes variables relating to symbols.
-# Currently, the only variable processed is 'binary=<value>' which updates
-# $main::prog to have the correct program name.
-sub ReadSymbols {
-  my $in = shift;
-  my $map = {};
-  while (<$in>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    # Removes all the leading zeroes from the symbols, see comment below.
-    if (m/^0x0*([0-9a-f]+)\s+(.+)/) {
-      $map->{$1} = $2;
-    } elsif (m/^---/) {
-      last;
-    } elsif (m/^([a-z][^=]*)=(.*)$/ ) {
-      my ($variable, $value) = ($1, $2);
-      for ($variable, $value) {
-        s/^\s+//;
-        s/\s+$//;
-      }
-      if ($variable eq "binary") {
-        if ($main::prog ne $UNKNOWN_BINARY && $main::prog ne $value) {
-          printf STDERR ("Warning: Mismatched binary name '%s', using '%s'.\n",
-                         $main::prog, $value);
-        }
-        $main::prog = $value;
-      } else {
-        printf STDERR ("Ignoring unknown variable in symbols list: " .
-            "'%s' = '%s'\n", $variable, $value);
-      }
-    }
-  }
-  return $map;
-}
-
-sub URLEncode {
-  my $str = shift;
-  $str =~ s/([^A-Za-z0-9\-_.!~*'()])/ sprintf "%%%02x", ord $1 /eg;
-  return $str;
-}
-
-sub AppendSymbolFilterParams {
-  my $url = shift;
-  my @params = ();
-  if ($main::opt_retain ne '') {
-    push(@params, sprintf("retain=%s", URLEncode($main::opt_retain)));
-  }
-  if ($main::opt_exclude ne '') {
-    push(@params, sprintf("exclude=%s", URLEncode($main::opt_exclude)));
-  }
-  if (scalar @params > 0) {
-    $url = sprintf("%s?%s", $url, join("&", @params));
-  }
-  return $url;
-}
-
-# Fetches and processes symbols to prepare them for use in the profile output
-# code.  If the optional 'symbol_map' arg is not given, fetches symbols from
-# $SYMBOL_PAGE for all PC values found in profile.  Otherwise, the raw symbols
-# are assumed to have already been fetched into 'symbol_map' and are simply
-# extracted and processed.
-sub FetchSymbols {
-  my $pcset = shift;
-  my $symbol_map = shift;
-
-  my %seen = ();
-  my @pcs = grep { !$seen{$_}++ } keys(%$pcset);  # uniq
-
-  if (!defined($symbol_map)) {
-    my $post_data = join("+", sort((map {"0x" . "$_"} @pcs)));
-
-    open(POSTFILE, ">$main::tmpfile_sym");
-    print POSTFILE $post_data;
-    close(POSTFILE);
-
-    my $url = SymbolPageURL();
-
-    my $command_line;
-    if (join(" ", @URL_FETCHER) =~ m/\bcurl -s/) {
-      $url = ResolveRedirectionForCurl($url);
-      $url = AppendSymbolFilterParams($url);
-      $command_line = ShellEscape(@URL_FETCHER, "-d", "\@$main::tmpfile_sym",
-                                  $url);
-    } else {
-      $url = AppendSymbolFilterParams($url);
-      $command_line = (ShellEscape(@URL_FETCHER, "--post", $url)
-                       . " < " . ShellEscape($main::tmpfile_sym));
-    }
-    # We use c++filt in case $SYMBOL_PAGE gives us mangled symbols.
-    my $escaped_cppfilt = ShellEscape($obj_tool_map{"c++filt"});
-    open(SYMBOL, "$command_line | $escaped_cppfilt |") or error($command_line);
-    $symbol_map = ReadSymbols(*SYMBOL{IO});
-    close(SYMBOL);
-  }
-
-  my $symbols = {};
-  foreach my $pc (@pcs) {
-    my $fullname;
-    # For 64 bits binaries, symbols are extracted with 8 leading zeroes.
-    # Then /symbol reads the long symbols in as uint64, and outputs
-    # the result with a "0x%08llx" format which get rid of the zeroes.
-    # By removing all the leading zeroes in both $pc and the symbols from
-    # /symbol, the symbols match and are retrievable from the map.
-    my $shortpc = $pc;
-    $shortpc =~ s/^0*//;
-    # Each line may have a list of names, which includes the function
-    # and also other functions it has inlined.  They are separated (in
-    # PrintSymbolizedProfile), by --, which is illegal in function names.
-    my $fullnames;
-    if (defined($symbol_map->{$shortpc})) {
-      $fullnames = $symbol_map->{$shortpc};
-    } else {
-      $fullnames = "0x" . $pc;  # Just use addresses
-    }
-    my $sym = [];
-    $symbols->{$pc} = $sym;
-    foreach my $fullname (split("--", $fullnames)) {
-      my $name = ShortFunctionName($fullname);
-      push(@{$sym}, $name, "?", $fullname);
-    }
-  }
-  return $symbols;
-}
-
-sub BaseName {
-  my $file_name = shift;
-  $file_name =~ s!^.*/!!;  # Remove directory name
-  return $file_name;
-}
-
-sub MakeProfileBaseName {
-  my ($binary_name, $profile_name) = @_;
-  my ($host, $baseURL, $path) = ParseProfileURL($profile_name);
-  my $binary_shortname = BaseName($binary_name);
-  return sprintf("%s.%s.%s",
-                 $binary_shortname, $main::op_time, $host);
-}
-
-sub FetchDynamicProfile {
-  my $binary_name = shift;
-  my $profile_name = shift;
-  my $fetch_name_only = shift;
-  my $encourage_patience = shift;
-
-  if (!IsProfileURL($profile_name)) {
-    return $profile_name;
-  } else {
-    my ($host, $baseURL, $path) = ParseProfileURL($profile_name);
-    if ($path eq "" || $path eq "/") {
-      # Missing type specifier defaults to cpu-profile
-      $path = $PROFILE_PAGE;
-    }
-
-    my $profile_file = MakeProfileBaseName($binary_name, $profile_name);
-
-    my $url = "$baseURL$path";
-    my $fetch_timeout = undef;
-    if ($path =~ m/$PROFILE_PAGE|$PMUPROFILE_PAGE/) {
-      if ($path =~ m/[?]/) {
-        $url .= "&";
-      } else {
-        $url .= "?";
-      }
-      $url .= sprintf("seconds=%d", $main::opt_seconds);
-      $fetch_timeout = $main::opt_seconds * 1.01 + 60;
-      # Set $profile_type for consumption by PrintSymbolizedProfile.
-      $main::profile_type = 'cpu';
-    } else {
-      # For non-CPU profiles, we add a type-extension to
-      # the target profile file name.
-      my $suffix = $path;
-      $suffix =~ s,/,.,g;
-      $profile_file .= $suffix;
-      # Set $profile_type for consumption by PrintSymbolizedProfile.
-      if ($path =~ m/$HEAP_PAGE/) {
-        $main::profile_type = 'heap';
-      } elsif ($path =~ m/$GROWTH_PAGE/) {
-        $main::profile_type = 'growth';
-      } elsif ($path =~ m/$CONTENTION_PAGE/) {
-        $main::profile_type = 'contention';
-      }
-    }
-
-    my $profile_dir = $ENV{"JEPROF_TMPDIR"} || ($ENV{HOME} . "/jeprof");
-    if (! -d $profile_dir) {
-      mkdir($profile_dir)
-          || die("Unable to create profile directory $profile_dir: $!\n");
-    }
-    my $tmp_profile = "$profile_dir/.tmp.$profile_file";
-    my $real_profile = "$profile_dir/$profile_file";
-
-    if ($fetch_name_only > 0) {
-      return $real_profile;
-    }
-
-    my @fetcher = AddFetchTimeout($fetch_timeout, @URL_FETCHER);
-    my $cmd = ShellEscape(@fetcher, $url) . " > " . ShellEscape($tmp_profile);
-    if ($path =~ m/$PROFILE_PAGE|$PMUPROFILE_PAGE|$CENSUSPROFILE_PAGE/){
-      print STDERR "Gathering CPU profile from $url for $main::opt_seconds seconds to\n  ${real_profile}\n";
-      if ($encourage_patience) {
-        print STDERR "Be patient...\n";
-      }
-    } else {
-      print STDERR "Fetching $path profile from $url to\n  ${real_profile}\n";
-    }
-
-    (system($cmd) == 0) || error("Failed to get profile: $cmd: $!\n");
-    (system("mv", $tmp_profile, $real_profile) == 0) || error("Unable to rename profile\n");
-    print STDERR "Wrote profile to $real_profile\n";
-    $main::collected_profile = $real_profile;
-    return $main::collected_profile;
-  }
-}
-
-# Collect profiles in parallel
-sub FetchDynamicProfiles {
-  my $items = scalar(@main::pfile_args);
-  my $levels = log($items) / log(2);
-
-  if ($items == 1) {
-    $main::profile_files[0] = FetchDynamicProfile($main::prog, $main::pfile_args[0], 0, 1);
-  } else {
-    # math rounding issues
-    if ((2 ** $levels) < $items) {
-     $levels++;
-    }
-    my $count = scalar(@main::pfile_args);
-    for (my $i = 0; $i < $count; $i++) {
-      $main::profile_files[$i] = FetchDynamicProfile($main::prog, $main::pfile_args[$i], 1, 0);
-    }
-    print STDERR "Fetching $count profiles, Be patient...\n";
-    FetchDynamicProfilesRecurse($levels, 0, 0);
-    $main::collected_profile = join(" \\\n    ", @main::profile_files);
-  }
-}
-
-# Recursively fork a process to get enough processes
-# collecting profiles
-sub FetchDynamicProfilesRecurse {
-  my $maxlevel = shift;
-  my $level = shift;
-  my $position = shift;
-
-  if (my $pid = fork()) {
-    $position = 0 | ($position << 1);
-    TryCollectProfile($maxlevel, $level, $position);
-    wait;
-  } else {
-    $position = 1 | ($position << 1);
-    TryCollectProfile($maxlevel, $level, $position);
-    cleanup();
-    exit(0);
-  }
-}
-
-# Collect a single profile
-sub TryCollectProfile {
-  my $maxlevel = shift;
-  my $level = shift;
-  my $position = shift;
-
-  if ($level >= ($maxlevel - 1)) {
-    if ($position < scalar(@main::pfile_args)) {
-      FetchDynamicProfile($main::prog, $main::pfile_args[$position], 0, 0);
-    }
-  } else {
-    FetchDynamicProfilesRecurse($maxlevel, $level+1, $position);
-  }
-}
-
-##### Parsing code #####
-
-# Provide a small streaming-read module to handle very large
-# cpu-profile files.  Stream in chunks along a sliding window.
-# Provides an interface to get one 'slot', correctly handling
-# endian-ness differences.  A slot is one 32-bit or 64-bit word
-# (depending on the input profile).  We tell endianness and bit-size
-# for the profile by looking at the first 8 bytes: in cpu profiles,
-# the second slot is always 3 (we'll accept anything that's not 0).
-BEGIN {
-  package CpuProfileStream;
-
-  sub new {
-    my ($class, $file, $fname) = @_;
-    my $self = { file        => $file,
-                 base        => 0,
-                 stride      => 512 * 1024,   # must be a multiple of bitsize/8
-                 slots       => [],
-                 unpack_code => "",           # N for big-endian, V for little
-                 perl_is_64bit => 1,          # matters if profile is 64-bit
-    };
-    bless $self, $class;
-    # Let unittests adjust the stride
-    if ($main::opt_test_stride > 0) {
-      $self->{stride} = $main::opt_test_stride;
-    }
-    # Read the first two slots to figure out bitsize and endianness.
-    my $slots = $self->{slots};
-    my $str;
-    read($self->{file}, $str, 8);
-    # Set the global $address_length based on what we see here.
-    # 8 is 32-bit (8 hexadecimal chars); 16 is 64-bit (16 hexadecimal chars).
-    $address_length = ($str eq (chr(0)x8)) ? 16 : 8;
-    if ($address_length == 8) {
-      if (substr($str, 6, 2) eq chr(0)x2) {
-        $self->{unpack_code} = 'V';  # Little-endian.
-      } elsif (substr($str, 4, 2) eq chr(0)x2) {
-        $self->{unpack_code} = 'N';  # Big-endian
-      } else {
-        ::error("$fname: header size >= 2**16\n");
-      }
-      @$slots = unpack($self->{unpack_code} . "*", $str);
-    } else {
-      # If we're a 64-bit profile, check if we're a 64-bit-capable
-      # perl.  Otherwise, each slot will be represented as a float
-      # instead of an int64, losing precision and making all the
-      # 64-bit addresses wrong.  We won't complain yet, but will
-      # later if we ever see a value that doesn't fit in 32 bits.
-      my $has_q = 0;
-      eval { $has_q = pack("Q", "1") ? 1 : 1; };
-      if (!$has_q) {
-        $self->{perl_is_64bit} = 0;
-      }
-      read($self->{file}, $str, 8);
-      if (substr($str, 4, 4) eq chr(0)x4) {
-        # We'd love to use 'Q', but it's a) not universal, b) not endian-proof.
-        $self->{unpack_code} = 'V';  # Little-endian.
-      } elsif (substr($str, 0, 4) eq chr(0)x4) {
-        $self->{unpack_code} = 'N';  # Big-endian
-      } else {
-        ::error("$fname: header size >= 2**32\n");
-      }
-      my @pair = unpack($self->{unpack_code} . "*", $str);
-      # Since we know one of the pair is 0, it's fine to just add them.
-      @$slots = (0, $pair[0] + $pair[1]);
-    }
-    return $self;
-  }
-
-  # Load more data when we access slots->get(X) which is not yet in memory.
-  sub overflow {
-    my ($self) = @_;
-    my $slots = $self->{slots};
-    $self->{base} += $#$slots + 1;   # skip over data we're replacing
-    my $str;
-    read($self->{file}, $str, $self->{stride});
-    if ($address_length == 8) {      # the 32-bit case
-      # This is the easy case: unpack provides 32-bit unpacking primitives.
-      @$slots = unpack($self->{unpack_code} . "*", $str);
-    } else {
-      # We need to unpack 32 bits at a time and combine.
-      my @b32_values = unpack($self->{unpack_code} . "*", $str);
-      my @b64_values = ();
-      for (my $i = 0; $i < $#b32_values; $i += 2) {
-        # TODO(csilvers): if this is a 32-bit perl, the math below
-        #    could end up in a too-large int, which perl will promote
-        #    to a double, losing necessary precision.  Deal with that.
-        #    Right now, we just die.
-        my ($lo, $hi) = ($b32_values[$i], $b32_values[$i+1]);
-        if ($self->{unpack_code} eq 'N') {    # big-endian
-          ($lo, $hi) = ($hi, $lo);
-        }
-        my $value = $lo + $hi * (2**32);
-        if (!$self->{perl_is_64bit} &&   # check value is exactly represented
-            (($value % (2**32)) != $lo || int($value / (2**32)) != $hi)) {
-          ::error("Need a 64-bit perl to process this 64-bit profile.\n");
-        }
-        push(@b64_values, $value);
-      }
-      @$slots = @b64_values;
-    }
-  }
-
-  # Access the i-th long in the file (logically), or -1 at EOF.
-  sub get {
-    my ($self, $idx) = @_;
-    my $slots = $self->{slots};
-    while ($#$slots >= 0) {
-      if ($idx < $self->{base}) {
-        # The only time we expect a reference to $slots[$i - something]
-        # after referencing $slots[$i] is reading the very first header.
-        # Since $stride > |header|, that shouldn't cause any lookback
-        # errors.  And everything after the header is sequential.
-        print STDERR "Unexpected look-back reading CPU profile";
-        return -1;   # shrug, don't know what better to return
-      } elsif ($idx > $self->{base} + $#$slots) {
-        $self->overflow();
-      } else {
-        return $slots->[$idx - $self->{base}];
-      }
-    }
-    # If we get here, $slots is [], which means we've reached EOF
-    return -1;  # unique since slots is supposed to hold unsigned numbers
-  }
-}
-
-# Reads the top, 'header' section of a profile, and returns the last
-# line of the header, commonly called a 'header line'.  The header
-# section of a profile consists of zero or more 'command' lines that
-# are instructions to jeprof, which jeprof executes when reading the
-# header.  All 'command' lines start with a %.  After the command
-# lines is the 'header line', which is a profile-specific line that
-# indicates what type of profile it is, and perhaps other global
-# information about the profile.  For instance, here's a header line
-# for a heap profile:
-#   heap profile:     53:    38236 [  5525:  1284029] @ heapprofile
-# For historical reasons, the CPU profile does not contain a text-
-# readable header line.  If the profile looks like a CPU profile,
-# this function returns "".  If no header line could be found, this
-# function returns undef.
-#
-# The following commands are recognized:
-#   %warn -- emit the rest of this line to stderr, prefixed by 'WARNING:'
-#
-# The input file should be in binmode.
-sub ReadProfileHeader {
-  local *PROFILE = shift;
-  my $firstchar = "";
-  my $line = "";
-  read(PROFILE, $firstchar, 1);
-  seek(PROFILE, -1, 1);                    # unread the firstchar
-  if ($firstchar !~ /[[:print:]]/) {       # is not a text character
-    return "";
-  }
-  while (defined($line = <PROFILE>)) {
-    $line =~ s/\r//g;   # turn windows-looking lines into unix-looking lines
-    if ($line =~ /^%warn\s+(.*)/) {        # 'warn' command
-      # Note this matches both '%warn blah\n' and '%warn\n'.
-      print STDERR "WARNING: $1\n";        # print the rest of the line
-    } elsif ($line =~ /^%/) {
-      print STDERR "Ignoring unknown command from profile header: $line";
-    } else {
-      # End of commands, must be the header line.
-      return $line;
-    }
-  }
-  return undef;     # got to EOF without seeing a header line
-}
-
-sub IsSymbolizedProfileFile {
-  my $file_name = shift;
-  if (!(-e $file_name) || !(-r $file_name)) {
-    return 0;
-  }
-  # Check if the file contains a symbol-section marker.
-  open(TFILE, "<$file_name");
-  binmode TFILE;
-  my $firstline = ReadProfileHeader(*TFILE);
-  close(TFILE);
-  if (!$firstline) {
-    return 0;
-  }
-  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $symbol_marker = $&;
-  return $firstline =~ /^--- *$symbol_marker/;
-}
-
-# Parse profile generated by common/profiler.cc and return a reference
-# to a map:
-#      $result->{version}     Version number of profile file
-#      $result->{period}      Sampling period (in microseconds)
-#      $result->{profile}     Profile object
-#      $result->{threads}     Map of thread IDs to profile objects
-#      $result->{map}         Memory map info from profile
-#      $result->{pcs}         Hash of all PC values seen, key is hex address
-sub ReadProfile {
-  my $prog = shift;
-  my $fname = shift;
-  my $result;            # return value
-
-  $CONTENTION_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $contention_marker = $&;
-  $GROWTH_PAGE  =~ m,[^/]+$,;    # matches everything after the last slash
-  my $growth_marker = $&;
-  $SYMBOL_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $symbol_marker = $&;
-  $PROFILE_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $profile_marker = $&;
-  $HEAP_PAGE =~ m,[^/]+$,;    # matches everything after the last slash
-  my $heap_marker = $&;
-
-  # Look at first line to see if it is a heap or a CPU profile.
-  # CPU profile may start with no header at all, and just binary data
-  # (starting with \0\0\0\0) -- in that case, don't try to read the
-  # whole firstline, since it may be gigabytes(!) of data.
-  open(PROFILE, "<$fname") || error("$fname: $!\n");
-  binmode PROFILE;      # New perls do UTF-8 processing
-  my $header = ReadProfileHeader(*PROFILE);
-  if (!defined($header)) {   # means "at EOF"
-    error("Profile is empty.\n");
-  }
-
-  my $symbols;
-  if ($header =~ m/^--- *$symbol_marker/o) {
-    # Verify that the user asked for a symbolized profile
-    if (!$main::use_symbolized_profile) {
-      # we have both a binary and symbolized profiles, abort
-      error("FATAL ERROR: Symbolized profile\n   $fname\ncannot be used with " .
-            "a binary arg. Try again without passing\n   $prog\n");
-    }
-    # Read the symbol section of the symbolized profile file.
-    $symbols = ReadSymbols(*PROFILE{IO});
-    # Read the next line to get the header for the remaining profile.
-    $header = ReadProfileHeader(*PROFILE) || "";
-  }
-
-  if ($header =~ m/^--- *($heap_marker|$growth_marker)/o) {
-    # Skip "--- ..." line for profile types that have their own headers.
-    $header = ReadProfileHeader(*PROFILE) || "";
-  }
-
-  $main::profile_type = '';
-
-  if ($header =~ m/^heap profile:.*$growth_marker/o) {
-    $main::profile_type = 'growth';
-    $result =  ReadHeapProfile($prog, *PROFILE, $header);
-  } elsif ($header =~ m/^heap profile:/) {
-    $main::profile_type = 'heap';
-    $result =  ReadHeapProfile($prog, *PROFILE, $header);
-  } elsif ($header =~ m/^heap/) {
-    $main::profile_type = 'heap';
-    $result = ReadThreadedHeapProfile($prog, $fname, $header);
-  } elsif ($header =~ m/^--- *$contention_marker/o) {
-    $main::profile_type = 'contention';
-    $result = ReadSynchProfile($prog, *PROFILE);
-  } elsif ($header =~ m/^--- *Stacks:/) {
-    print STDERR
-      "Old format contention profile: mistakenly reports " .
-      "condition variable signals as lock contentions.\n";
-    $main::profile_type = 'contention';
-    $result = ReadSynchProfile($prog, *PROFILE);
-  } elsif ($header =~ m/^--- *$profile_marker/) {
-    # the binary cpu profile data starts immediately after this line
-    $main::profile_type = 'cpu';
-    $result = ReadCPUProfile($prog, $fname, *PROFILE);
-  } else {
-    if (defined($symbols)) {
-      # a symbolized profile contains a format we don't recognize, bail out
-      error("$fname: Cannot recognize profile section after symbols.\n");
-    }
-    # no ascii header present -- must be a CPU profile
-    $main::profile_type = 'cpu';
-    $result = ReadCPUProfile($prog, $fname, *PROFILE);
-  }
-
-  close(PROFILE);
-
-  # if we got symbols along with the profile, return those as well
-  if (defined($symbols)) {
-    $result->{symbols} = $symbols;
-  }
-
-  return $result;
-}
-
-# Subtract one from caller pc so we map back to call instr.
-# However, don't do this if we're reading a symbolized profile
-# file, in which case the subtract-one was done when the file
-# was written.
-#
-# We apply the same logic to all readers, though ReadCPUProfile uses an
-# independent implementation.
-sub FixCallerAddresses {
-  my $stack = shift;
-  # --raw/http: Always subtract one from pc's, because PrintSymbolizedProfile()
-  # dumps unadjusted profiles.
-  {
-    $stack =~ /(\s)/;
-    my $delimiter = $1;
-    my @addrs = split(' ', $stack);
-    my @fixedaddrs;
-    $#fixedaddrs = $#addrs;
-    if ($#addrs >= 0) {
-      $fixedaddrs[0] = $addrs[0];
-    }
-    for (my $i = 1; $i <= $#addrs; $i++) {
-      $fixedaddrs[$i] = AddressSub($addrs[$i], "0x1");
-    }
-    return join $delimiter, @fixedaddrs;
-  }
-}
-
-# CPU profile reader
-sub ReadCPUProfile {
-  my $prog = shift;
-  my $fname = shift;       # just used for logging
-  local *PROFILE = shift;
-  my $version;
-  my $period;
-  my $i;
-  my $profile = {};
-  my $pcs = {};
-
-  # Parse string into array of slots.
-  my $slots = CpuProfileStream->new(*PROFILE, $fname);
-
-  # Read header.  The current header version is a 5-element structure
-  # containing:
-  #   0: header count (always 0)
-  #   1: header "words" (after this one: 3)
-  #   2: format version (0)
-  #   3: sampling period (usec)
-  #   4: unused padding (always 0)
-  if ($slots->get(0) != 0 ) {
-    error("$fname: not a profile file, or old format profile file\n");
-  }
-  $i = 2 + $slots->get(1);
-  $version = $slots->get(2);
-  $period = $slots->get(3);
-  # Do some sanity checking on these header values.
-  if ($version > (2**32) || $period > (2**32) || $i > (2**32) || $i < 5) {
-    error("$fname: not a profile file, or corrupted profile file\n");
-  }
-
-  # Parse profile
-  while ($slots->get($i) != -1) {
-    my $n = $slots->get($i++);
-    my $d = $slots->get($i++);
-    if ($d > (2**16)) {  # TODO(csilvers): what's a reasonable max-stack-depth?
-      my $addr = sprintf("0%o", $i * ($address_length == 8 ? 4 : 8));
-      print STDERR "At index $i (address $addr):\n";
-      error("$fname: stack trace depth >= 2**32\n");
-    }
-    if ($slots->get($i) == 0) {
-      # End of profile data marker
-      $i += $d;
-      last;
-    }
-
-    # Make key out of the stack entries
-    my @k = ();
-    for (my $j = 0; $j < $d; $j++) {
-      my $pc = $slots->get($i+$j);
-      # Subtract one from caller pc so we map back to call instr.
-      $pc--;
-      $pc = sprintf("%0*x", $address_length, $pc);
-      $pcs->{$pc} = 1;
-      push @k, $pc;
-    }
-
-    AddEntry($profile, (join "\n", @k), $n);
-    $i += $d;
-  }
-
-  # Parse map
-  my $map = '';
-  seek(PROFILE, $i * 4, 0);
-  read(PROFILE, $map, (stat PROFILE)[7]);
-
-  my $r = {};
-  $r->{version} = $version;
-  $r->{period} = $period;
-  $r->{profile} = $profile;
-  $r->{libs} = ParseLibraries($prog, $map, $pcs);
-  $r->{pcs} = $pcs;
-
-  return $r;
-}
-
-sub HeapProfileIndex {
-  my $index = 1;
-  if ($main::opt_inuse_space) {
-    $index = 1;
-  } elsif ($main::opt_inuse_objects) {
-    $index = 0;
-  } elsif ($main::opt_alloc_space) {
-    $index = 3;
-  } elsif ($main::opt_alloc_objects) {
-    $index = 2;
-  }
-  return $index;
-}
-
-sub ReadMappedLibraries {
-  my $fh = shift;
-  my $map = "";
-  # Read the /proc/self/maps data
-  while (<$fh>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    $map .= $_;
-  }
-  return $map;
-}
-
-sub ReadMemoryMap {
-  my $fh = shift;
-  my $map = "";
-  # Read /proc/self/maps data as formatted by DumpAddressMap()
-  my $buildvar = "";
-  while (<PROFILE>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    # Parse "build=<dir>" specification if supplied
-    if (m/^\s*build=(.*)\n/) {
-      $buildvar = $1;
-    }
-
-    # Expand "$build" variable if available
-    $_ =~ s/\$build\b/$buildvar/g;
-
-    $map .= $_;
-  }
-  return $map;
-}
-
-sub AdjustSamples {
-  my ($sample_adjustment, $sampling_algorithm, $n1, $s1, $n2, $s2) = @_;
-  if ($sample_adjustment) {
-    if ($sampling_algorithm == 2) {
-      # Remote-heap version 2
-      # The sampling frequency is the rate of a Poisson process.
-      # This means that the probability of sampling an allocation of
-      # size X with sampling rate Y is 1 - exp(-X/Y)
-      if ($n1 != 0) {
-        my $ratio = (($s1*1.0)/$n1)/($sample_adjustment);
-        my $scale_factor = 1/(1 - exp(-$ratio));
-        $n1 *= $scale_factor;
-        $s1 *= $scale_factor;
-      }
-      if ($n2 != 0) {
-        my $ratio = (($s2*1.0)/$n2)/($sample_adjustment);
-        my $scale_factor = 1/(1 - exp(-$ratio));
-        $n2 *= $scale_factor;
-        $s2 *= $scale_factor;
-      }
-    } else {
-      # Remote-heap version 1
-      my $ratio;
-      $ratio = (($s1*1.0)/$n1)/($sample_adjustment);
-      if ($ratio < 1) {
-        $n1 /= $ratio;
-        $s1 /= $ratio;
-      }
-      $ratio = (($s2*1.0)/$n2)/($sample_adjustment);
-      if ($ratio < 1) {
-        $n2 /= $ratio;
-        $s2 /= $ratio;
-      }
-    }
-  }
-  return ($n1, $s1, $n2, $s2);
-}
-
-sub ReadHeapProfile {
-  my $prog = shift;
-  local *PROFILE = shift;
-  my $header = shift;
-
-  my $index = HeapProfileIndex();
-
-  # Find the type of this profile.  The header line looks like:
-  #    heap profile:   1246:  8800744 [  1246:  8800744] @ <heap-url>/266053
-  # There are two pairs <count: size>, the first inuse objects/space, and the
-  # second allocated objects/space.  This is followed optionally by a profile
-  # type, and if that is present, optionally by a sampling frequency.
-  # For remote heap profiles (v1):
-  # The interpretation of the sampling frequency is that the profiler, for
-  # each sample, calculates a uniformly distributed random integer less than
-  # the given value, and records the next sample after that many bytes have
-  # been allocated.  Therefore, the expected sample interval is half of the
-  # given frequency.  By default, if not specified, the expected sample
-  # interval is 128KB.  Only remote-heap-page profiles are adjusted for
-  # sample size.
-  # For remote heap profiles (v2):
-  # The sampling frequency is the rate of a Poisson process. This means that
-  # the probability of sampling an allocation of size X with sampling rate Y
-  # is 1 - exp(-X/Y)
-  # For version 2, a typical header line might look like this:
-  # heap profile:   1922: 127792360 [  1922: 127792360] @ <heap-url>_v2/524288
-  # the trailing number (524288) is the sampling rate. (Version 1 showed
-  # double the 'rate' here)
-  my $sampling_algorithm = 0;
-  my $sample_adjustment = 0;
-  chomp($header);
-  my $type = "unknown";
-  if ($header =~ m"^heap profile:\s*(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\](\s*@\s*([^/]*)(/(\d+))?)?") {
-    if (defined($6) && ($6 ne '')) {
-      $type = $6;
-      my $sample_period = $8;
-      # $type is "heapprofile" for profiles generated by the
-      # heap-profiler, and either "heap" or "heap_v2" for profiles
-      # generated by sampling directly within tcmalloc.  It can also
-      # be "growth" for heap-growth profiles.  The first is typically
-      # found for profiles generated locally, and the others for
-      # remote profiles.
-      if (($type eq "heapprofile") || ($type !~ /heap/) ) {
-        # No need to adjust for the sampling rate with heap-profiler-derived data
-        $sampling_algorithm = 0;
-      } elsif ($type =~ /_v2/) {
-        $sampling_algorithm = 2;     # version 2 sampling
-        if (defined($sample_period) && ($sample_period ne '')) {
-          $sample_adjustment = int($sample_period);
-        }
-      } else {
-        $sampling_algorithm = 1;     # version 1 sampling
-        if (defined($sample_period) && ($sample_period ne '')) {
-          $sample_adjustment = int($sample_period)/2;
-        }
-      }
-    } else {
-      # We detect whether or not this is a remote-heap profile by checking
-      # that the total-allocated stats ($n2,$s2) are exactly the
-      # same as the in-use stats ($n1,$s1).  It is remotely conceivable
-      # that a non-remote-heap profile may pass this check, but it is hard
-      # to imagine how that could happen.
-      # In this case it's so old it's guaranteed to be remote-heap version 1.
-      my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4);
-      if (($n1 == $n2) && ($s1 == $s2)) {
-        # This is likely to be a remote-heap based sample profile
-        $sampling_algorithm = 1;
-      }
-    }
-  }
-
-  if ($sampling_algorithm > 0) {
-    # For remote-heap generated profiles, adjust the counts and sizes to
-    # account for the sample rate (we sample once every 128KB by default).
-    if ($sample_adjustment == 0) {
-      # Turn on profile adjustment.
-      $sample_adjustment = 128*1024;
-      print STDERR "Adjusting heap profiles for 1-in-128KB sampling rate\n";
-    } else {
-      printf STDERR ("Adjusting heap profiles for 1-in-%d sampling rate\n",
-                     $sample_adjustment);
-    }
-    if ($sampling_algorithm > 1) {
-      # We don't bother printing anything for the original version (version 1)
-      printf STDERR "Heap version $sampling_algorithm\n";
-    }
-  }
-
-  my $profile = {};
-  my $pcs = {};
-  my $map = "";
-
-  while (<PROFILE>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    if (/^MAPPED_LIBRARIES:/) {
-      $map .= ReadMappedLibraries(*PROFILE);
-      last;
-    }
-
-    if (/^--- Memory map:/) {
-      $map .= ReadMemoryMap(*PROFILE);
-      last;
-    }
-
-    # Read entry of the form:
-    #  <count1>: <bytes1> [<count2>: <bytes2>] @ a1 a2 a3 ... an
-    s/^\s*//;
-    s/\s*$//;
-    if (m/^\s*(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\]\s+@\s+(.*)$/) {
-      my $stack = $5;
-      my ($n1, $s1, $n2, $s2) = ($1, $2, $3, $4);
-      my @counts = AdjustSamples($sample_adjustment, $sampling_algorithm,
-                                 $n1, $s1, $n2, $s2);
-      AddEntries($profile, $pcs, FixCallerAddresses($stack), $counts[$index]);
-    }
-  }
-
-  my $r = {};
-  $r->{version} = "heap";
-  $r->{period} = 1;
-  $r->{profile} = $profile;
-  $r->{libs} = ParseLibraries($prog, $map, $pcs);
-  $r->{pcs} = $pcs;
-  return $r;
-}
-
-sub ReadThreadedHeapProfile {
-  my ($prog, $fname, $header) = @_;
-
-  my $index = HeapProfileIndex();
-  my $sampling_algorithm = 0;
-  my $sample_adjustment = 0;
-  chomp($header);
-  my $type = "unknown";
-  # Assuming a very specific type of header for now.
-  if ($header =~ m"^heap_v2/(\d+)") {
-    $type = "_v2";
-    $sampling_algorithm = 2;
-    $sample_adjustment = int($1);
-  }
-  if ($type ne "_v2" || !defined($sample_adjustment)) {
-    die "Threaded heap profiles require v2 sampling with a sample rate\n";
-  }
-
-  my $profile = {};
-  my $thread_profiles = {};
-  my $pcs = {};
-  my $map = "";
-  my $stack = "";
-
-  while (<PROFILE>) {
-    s/\r//g;
-    if (/^MAPPED_LIBRARIES:/) {
-      $map .= ReadMappedLibraries(*PROFILE);
-      last;
-    }
-
-    if (/^--- Memory map:/) {
-      $map .= ReadMemoryMap(*PROFILE);
-      last;
-    }
-
-    # Read entry of the form:
-    # @ a1 a2 ... an
-    #   t*: <count1>: <bytes1> [<count2>: <bytes2>]
-    #   t1: <count1>: <bytes1> [<count2>: <bytes2>]
-    #     ...
-    #   tn: <count1>: <bytes1> [<count2>: <bytes2>]
-    s/^\s*//;
-    s/\s*$//;
-    if (m/^@\s+(.*)$/) {
-      $stack = $1;
-    } elsif (m/^\s*(t(\*|\d+)):\s+(\d+):\s+(\d+)\s+\[\s*(\d+):\s+(\d+)\]$/) {
-      if ($stack eq "") {
-        # Still in the header, so this is just a per-thread summary.
-        next;
-      }
-      my $thread = $2;
-      my ($n1, $s1, $n2, $s2) = ($3, $4, $5, $6);
-      my @counts = AdjustSamples($sample_adjustment, $sampling_algorithm,
-                                 $n1, $s1, $n2, $s2);
-      if ($thread eq "*") {
-        AddEntries($profile, $pcs, FixCallerAddresses($stack), $counts[$index]);
-      } else {
-        if (!exists($thread_profiles->{$thread})) {
-          $thread_profiles->{$thread} = {};
-        }
-        AddEntries($thread_profiles->{$thread}, $pcs,
-                   FixCallerAddresses($stack), $counts[$index]);
-      }
-    }
-  }
-
-  my $r = {};
-  $r->{version} = "heap";
-  $r->{period} = 1;
-  $r->{profile} = $profile;
-  $r->{threads} = $thread_profiles;
-  $r->{libs} = ParseLibraries($prog, $map, $pcs);
-  $r->{pcs} = $pcs;
-  return $r;
-}
-
-sub ReadSynchProfile {
-  my $prog = shift;
-  local *PROFILE = shift;
-  my $header = shift;
-
-  my $map = '';
-  my $profile = {};
-  my $pcs = {};
-  my $sampling_period = 1;
-  my $cyclespernanosec = 2.8;   # Default assumption for old binaries
-  my $seen_clockrate = 0;
-  my $line;
-
-  my $index = 0;
-  if ($main::opt_total_delay) {
-    $index = 0;
-  } elsif ($main::opt_contentions) {
-    $index = 1;
-  } elsif ($main::opt_mean_delay) {
-    $index = 2;
-  }
-
-  while ( $line = <PROFILE> ) {
-    $line =~ s/\r//g;      # turn windows-looking lines into unix-looking lines
-    if ( $line =~ /^\s*(\d+)\s+(\d+) \@\s*(.*?)\s*$/ ) {
-      my ($cycles, $count, $stack) = ($1, $2, $3);
-
-      # Convert cycles to nanoseconds
-      $cycles /= $cyclespernanosec;
-
-      # Adjust for sampling done by application
-      $cycles *= $sampling_period;
-      $count *= $sampling_period;
-
-      my @values = ($cycles, $count, $cycles / $count);
-      AddEntries($profile, $pcs, FixCallerAddresses($stack), $values[$index]);
-
-    } elsif ( $line =~ /^(slow release).*thread \d+  \@\s*(.*?)\s*$/ ||
-              $line =~ /^\s*(\d+) \@\s*(.*?)\s*$/ ) {
-      my ($cycles, $stack) = ($1, $2);
-      if ($cycles !~ /^\d+$/) {
-        next;
-      }
-
-      # Convert cycles to nanoseconds
-      $cycles /= $cyclespernanosec;
-
-      # Adjust for sampling done by application
-      $cycles *= $sampling_period;
-
-      AddEntries($profile, $pcs, FixCallerAddresses($stack), $cycles);
-
-    } elsif ( $line =~ m/^([a-z][^=]*)=(.*)$/ ) {
-      my ($variable, $value) = ($1,$2);
-      for ($variable, $value) {
-        s/^\s+//;
-        s/\s+$//;
-      }
-      if ($variable eq "cycles/second") {
-        $cyclespernanosec = $value / 1e9;
-        $seen_clockrate = 1;
-      } elsif ($variable eq "sampling period") {
-        $sampling_period = $value;
-      } elsif ($variable eq "ms since reset") {
-        # Currently nothing is done with this value in jeprof
-        # So we just silently ignore it for now
-      } elsif ($variable eq "discarded samples") {
-        # Currently nothing is done with this value in jeprof
-        # So we just silently ignore it for now
-      } else {
-        printf STDERR ("Ignoring unnknown variable in /contention output: " .
-                       "'%s' = '%s'\n",$variable,$value);
-      }
-    } else {
-      # Memory map entry
-      $map .= $line;
-    }
-  }
-
-  if (!$seen_clockrate) {
-    printf STDERR ("No cycles/second entry in profile; Guessing %.1f GHz\n",
-                   $cyclespernanosec);
-  }
-
-  my $r = {};
-  $r->{version} = 0;
-  $r->{period} = $sampling_period;
-  $r->{profile} = $profile;
-  $r->{libs} = ParseLibraries($prog, $map, $pcs);
-  $r->{pcs} = $pcs;
-  return $r;
-}
-
-# Given a hex value in the form "0x1abcd" or "1abcd", return either
-# "0001abcd" or "000000000001abcd", depending on the current (global)
-# address length.
-sub HexExtend {
-  my $addr = shift;
-
-  $addr =~ s/^(0x)?0*//;
-  my $zeros_needed = $address_length - length($addr);
-  if ($zeros_needed < 0) {
-    printf STDERR "Warning: address $addr is longer than address length $address_length\n";
-    return $addr;
-  }
-  return ("0" x $zeros_needed) . $addr;
-}
-
-##### Symbol extraction #####
-
-# Aggressively search the lib_prefix values for the given library
-# If all else fails, just return the name of the library unmodified.
-# If the lib_prefix is "/my/path,/other/path" and $file is "/lib/dir/mylib.so"
-# it will search the following locations in this order, until it finds a file:
-#   /my/path/lib/dir/mylib.so
-#   /other/path/lib/dir/mylib.so
-#   /my/path/dir/mylib.so
-#   /other/path/dir/mylib.so
-#   /my/path/mylib.so
-#   /other/path/mylib.so
-#   /lib/dir/mylib.so              (returned as last resort)
-sub FindLibrary {
-  my $file = shift;
-  my $suffix = $file;
-
-  # Search for the library as described above
-  do {
-    foreach my $prefix (@prefix_list) {
-      my $fullpath = $prefix . $suffix;
-      if (-e $fullpath) {
-        return $fullpath;
-      }
-    }
-  } while ($suffix =~ s|^/[^/]+/|/|);
-  return $file;
-}
-
-# Return path to library with debugging symbols.
-# For libc libraries, the copy in /usr/lib/debug contains debugging symbols
-sub DebuggingLibrary {
-  my $file = shift;
-  if ($file =~ m|^/|) {
-      if (-f "/usr/lib/debug$file") {
-        return "/usr/lib/debug$file";
-      } elsif (-f "/usr/lib/debug$file.debug") {
-        return "/usr/lib/debug$file.debug";
-      }
-  }
-  return undef;
-}
-
-# Parse text section header of a library using objdump
-sub ParseTextSectionHeaderFromObjdump {
-  my $lib = shift;
-
-  my $size = undef;
-  my $vma;
-  my $file_offset;
-  # Get objdump output from the library file to figure out how to
-  # map between mapped addresses and addresses in the library.
-  my $cmd = ShellEscape($obj_tool_map{"objdump"}, "-h", $lib);
-  open(OBJDUMP, "$cmd |") || error("$cmd: $!\n");
-  while (<OBJDUMP>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    # Idx Name          Size      VMA       LMA       File off  Algn
-    #  10 .text         00104b2c  420156f0  420156f0  000156f0  2**4
-    # For 64-bit objects, VMA and LMA will be 16 hex digits, size and file
-    # offset may still be 8.  But AddressSub below will still handle that.
-    my @x = split;
-    if (($#x >= 6) && ($x[1] eq '.text')) {
-      $size = $x[2];
-      $vma = $x[3];
-      $file_offset = $x[5];
-      last;
-    }
-  }
-  close(OBJDUMP);
-
-  if (!defined($size)) {
-    return undef;
-  }
-
-  my $r = {};
-  $r->{size} = $size;
-  $r->{vma} = $vma;
-  $r->{file_offset} = $file_offset;
-
-  return $r;
-}
-
-# Parse text section header of a library using otool (on OS X)
-sub ParseTextSectionHeaderFromOtool {
-  my $lib = shift;
-
-  my $size = undef;
-  my $vma = undef;
-  my $file_offset = undef;
-  # Get otool output from the library file to figure out how to
-  # map between mapped addresses and addresses in the library.
-  my $command = ShellEscape($obj_tool_map{"otool"}, "-l", $lib);
-  open(OTOOL, "$command |") || error("$command: $!\n");
-  my $cmd = "";
-  my $sectname = "";
-  my $segname = "";
-  foreach my $line (<OTOOL>) {
-    $line =~ s/\r//g;      # turn windows-looking lines into unix-looking lines
-    # Load command <#>
-    #       cmd LC_SEGMENT
-    # [...]
-    # Section
-    #   sectname __text
-    #    segname __TEXT
-    #       addr 0x000009f8
-    #       size 0x00018b9e
-    #     offset 2552
-    #      align 2^2 (4)
-    # We will need to strip off the leading 0x from the hex addresses,
-    # and convert the offset into hex.
-    if ($line =~ /Load command/) {
-      $cmd = "";
-      $sectname = "";
-      $segname = "";
-    } elsif ($line =~ /Section/) {
-      $sectname = "";
-      $segname = "";
-    } elsif ($line =~ /cmd (\w+)/) {
-      $cmd = $1;
-    } elsif ($line =~ /sectname (\w+)/) {
-      $sectname = $1;
-    } elsif ($line =~ /segname (\w+)/) {
-      $segname = $1;
-    } elsif (!(($cmd eq "LC_SEGMENT" || $cmd eq "LC_SEGMENT_64") &&
-               $sectname eq "__text" &&
-               $segname eq "__TEXT")) {
-      next;
-    } elsif ($line =~ /\baddr 0x([0-9a-fA-F]+)/) {
-      $vma = $1;
-    } elsif ($line =~ /\bsize 0x([0-9a-fA-F]+)/) {
-      $size = $1;
-    } elsif ($line =~ /\boffset ([0-9]+)/) {
-      $file_offset = sprintf("%016x", $1);
-    }
-    if (defined($vma) && defined($size) && defined($file_offset)) {
-      last;
-    }
-  }
-  close(OTOOL);
-
-  if (!defined($vma) || !defined($size) || !defined($file_offset)) {
-     return undef;
-  }
-
-  my $r = {};
-  $r->{size} = $size;
-  $r->{vma} = $vma;
-  $r->{file_offset} = $file_offset;
-
-  return $r;
-}
-
-sub ParseTextSectionHeader {
-  # obj_tool_map("otool") is only defined if we're in a Mach-O environment
-  if (defined($obj_tool_map{"otool"})) {
-    my $r = ParseTextSectionHeaderFromOtool(@_);
-    if (defined($r)){
-      return $r;
-    }
-  }
-  # If otool doesn't work, or we don't have it, fall back to objdump
-  return ParseTextSectionHeaderFromObjdump(@_);
-}
-
-# Split /proc/pid/maps dump into a list of libraries
-sub ParseLibraries {
-  return if $main::use_symbol_page;  # We don't need libraries info.
-  my $prog = Cwd::abs_path(shift);
-  my $map = shift;
-  my $pcs = shift;
-
-  my $result = [];
-  my $h = "[a-f0-9]+";
-  my $zero_offset = HexExtend("0");
-
-  my $buildvar = "";
-  foreach my $l (split("\n", $map)) {
-    if ($l =~ m/^\s*build=(.*)$/) {
-      $buildvar = $1;
-    }
-
-    my $start;
-    my $finish;
-    my $offset;
-    my $lib;
-    if ($l =~ /^($h)-($h)\s+..x.\s+($h)\s+\S+:\S+\s+\d+\s+(\S+\.(so|dll|dylib|bundle)((\.\d+)+\w*(\.\d+){0,3})?)$/i) {
-      # Full line from /proc/self/maps.  Example:
-      #   40000000-40015000 r-xp 00000000 03:01 12845071   /lib/ld-2.3.2.so
-      $start = HexExtend($1);
-      $finish = HexExtend($2);
-      $offset = HexExtend($3);
-      $lib = $4;
-      $lib =~ s|\\|/|g;     # turn windows-style paths into unix-style paths
-    } elsif ($l =~ /^\s*($h)-($h):\s*(\S+\.so(\.\d+)*)/) {
-      # Cooked line from DumpAddressMap.  Example:
-      #   40000000-40015000: /lib/ld-2.3.2.so
-      $start = HexExtend($1);
-      $finish = HexExtend($2);
-      $offset = $zero_offset;
-      $lib = $3;
-    } elsif (($l =~ /^($h)-($h)\s+..x.\s+($h)\s+\S+:\S+\s+\d+\s+(\S+)$/i) && ($4 eq $prog)) {
-      # PIEs and address space randomization do not play well with our
-      # default assumption that main executable is at lowest
-      # addresses. So we're detecting main executable in
-      # /proc/self/maps as well.
-      $start = HexExtend($1);
-      $finish = HexExtend($2);
-      $offset = HexExtend($3);
-      $lib = $4;
-      $lib =~ s|\\|/|g;     # turn windows-style paths into unix-style paths
-    }
-    # FreeBSD 10.0 virtual memory map /proc/curproc/map as defined in
-    # function procfs_doprocmap (sys/fs/procfs/procfs_map.c)
-    #
-    # Example:
-    # 0x800600000 0x80061a000 26 0 0xfffff800035a0000 r-x 75 33 0x1004 COW NC vnode /libexec/ld-elf.s
-    # o.1 NCH -1
-    elsif ($l =~ /^(0x$h)\s(0x$h)\s\d+\s\d+\s0x$h\sr-x\s\d+\s\d+\s0x\d+\s(COW|NCO)\s(NC|NNC)\svnode\s(\S+\.so(\.\d+)*)/) {
-      $start = HexExtend($1);
-      $finish = HexExtend($2);
-      $offset = $zero_offset;
-      $lib = FindLibrary($5);
-
-    } else {
-      next;
-    }
-
-    # Expand "$build" variable if available
-    $lib =~ s/\$build\b/$buildvar/g;
-
-    $lib = FindLibrary($lib);
-
-    # Check for pre-relocated libraries, which use pre-relocated symbol tables
-    # and thus require adjusting the offset that we'll use to translate
-    # VM addresses into symbol table addresses.
-    # Only do this if we're not going to fetch the symbol table from a
-    # debugging copy of the library.
-    if (!DebuggingLibrary($lib)) {
-      my $text = ParseTextSectionHeader($lib);
-      if (defined($text)) {
-         my $vma_offset = AddressSub($text->{vma}, $text->{file_offset});
-         $offset = AddressAdd($offset, $vma_offset);
-      }
-    }
-
-    if($main::opt_debug) { printf STDERR "$start:$finish ($offset) $lib\n"; }
-    push(@{$result}, [$lib, $start, $finish, $offset]);
-  }
-
-  # Append special entry for additional library (not relocated)
-  if ($main::opt_lib ne "") {
-    my $text = ParseTextSectionHeader($main::opt_lib);
-    if (defined($text)) {
-       my $start = $text->{vma};
-       my $finish = AddressAdd($start, $text->{size});
-
-       push(@{$result}, [$main::opt_lib, $start, $finish, $start]);
-    }
-  }
-
-  # Append special entry for the main program.  This covers
-  # 0..max_pc_value_seen, so that we assume pc values not found in one
-  # of the library ranges will be treated as coming from the main
-  # program binary.
-  my $min_pc = HexExtend("0");
-  my $max_pc = $min_pc;          # find the maximal PC value in any sample
-  foreach my $pc (keys(%{$pcs})) {
-    if (HexExtend($pc) gt $max_pc) { $max_pc = HexExtend($pc); }
-  }
-  push(@{$result}, [$prog, $min_pc, $max_pc, $zero_offset]);
-
-  return $result;
-}
-
-# Add two hex addresses of length $address_length.
-# Run jeprof --test for unit test if this is changed.
-sub AddressAdd {
-  my $addr1 = shift;
-  my $addr2 = shift;
-  my $sum;
-
-  if ($address_length == 8) {
-    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
-    $sum = (hex($addr1)+hex($addr2)) % (0x10000000 * 16);
-    return sprintf("%08x", $sum);
-
-  } else {
-    # Do the addition in 7-nibble chunks to trivialize carry handling.
-
-    if ($main::opt_debug and $main::opt_test) {
-      print STDERR "AddressAdd $addr1 + $addr2 = ";
-    }
-
-    my $a1 = substr($addr1,-7);
-    $addr1 = substr($addr1,0,-7);
-    my $a2 = substr($addr2,-7);
-    $addr2 = substr($addr2,0,-7);
-    $sum = hex($a1) + hex($a2);
-    my $c = 0;
-    if ($sum > 0xfffffff) {
-      $c = 1;
-      $sum -= 0x10000000;
-    }
-    my $r = sprintf("%07x", $sum);
-
-    $a1 = substr($addr1,-7);
-    $addr1 = substr($addr1,0,-7);
-    $a2 = substr($addr2,-7);
-    $addr2 = substr($addr2,0,-7);
-    $sum = hex($a1) + hex($a2) + $c;
-    $c = 0;
-    if ($sum > 0xfffffff) {
-      $c = 1;
-      $sum -= 0x10000000;
-    }
-    $r = sprintf("%07x", $sum) . $r;
-
-    $sum = hex($addr1) + hex($addr2) + $c;
-    if ($sum > 0xff) { $sum -= 0x100; }
-    $r = sprintf("%02x", $sum) . $r;
-
-    if ($main::opt_debug and $main::opt_test) { print STDERR "$r\n"; }
-
-    return $r;
-  }
-}
-
-
-# Subtract two hex addresses of length $address_length.
-# Run jeprof --test for unit test if this is changed.
-sub AddressSub {
-  my $addr1 = shift;
-  my $addr2 = shift;
-  my $diff;
-
-  if ($address_length == 8) {
-    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
-    $diff = (hex($addr1)-hex($addr2)) % (0x10000000 * 16);
-    return sprintf("%08x", $diff);
-
-  } else {
-    # Do the addition in 7-nibble chunks to trivialize borrow handling.
-    # if ($main::opt_debug) { print STDERR "AddressSub $addr1 - $addr2 = "; }
-
-    my $a1 = hex(substr($addr1,-7));
-    $addr1 = substr($addr1,0,-7);
-    my $a2 = hex(substr($addr2,-7));
-    $addr2 = substr($addr2,0,-7);
-    my $b = 0;
-    if ($a2 > $a1) {
-      $b = 1;
-      $a1 += 0x10000000;
-    }
-    $diff = $a1 - $a2;
-    my $r = sprintf("%07x", $diff);
-
-    $a1 = hex(substr($addr1,-7));
-    $addr1 = substr($addr1,0,-7);
-    $a2 = hex(substr($addr2,-7)) + $b;
-    $addr2 = substr($addr2,0,-7);
-    $b = 0;
-    if ($a2 > $a1) {
-      $b = 1;
-      $a1 += 0x10000000;
-    }
-    $diff = $a1 - $a2;
-    $r = sprintf("%07x", $diff) . $r;
-
-    $a1 = hex($addr1);
-    $a2 = hex($addr2) + $b;
-    if ($a2 > $a1) { $a1 += 0x100; }
-    $diff = $a1 - $a2;
-    $r = sprintf("%02x", $diff) . $r;
-
-    # if ($main::opt_debug) { print STDERR "$r\n"; }
-
-    return $r;
-  }
-}
-
-# Increment a hex addresses of length $address_length.
-# Run jeprof --test for unit test if this is changed.
-sub AddressInc {
-  my $addr = shift;
-  my $sum;
-
-  if ($address_length == 8) {
-    # Perl doesn't cope with wraparound arithmetic, so do it explicitly:
-    $sum = (hex($addr)+1) % (0x10000000 * 16);
-    return sprintf("%08x", $sum);
-
-  } else {
-    # Do the addition in 7-nibble chunks to trivialize carry handling.
-    # We are always doing this to step through the addresses in a function,
-    # and will almost never overflow the first chunk, so we check for this
-    # case and exit early.
-
-    # if ($main::opt_debug) { print STDERR "AddressInc $addr1 = "; }
-
-    my $a1 = substr($addr,-7);
-    $addr = substr($addr,0,-7);
-    $sum = hex($a1) + 1;
-    my $r = sprintf("%07x", $sum);
-    if ($sum <= 0xfffffff) {
-      $r = $addr . $r;
-      # if ($main::opt_debug) { print STDERR "$r\n"; }
-      return HexExtend($r);
-    } else {
-      $r = "0000000";
-    }
-
-    $a1 = substr($addr,-7);
-    $addr = substr($addr,0,-7);
-    $sum = hex($a1) + 1;
-    $r = sprintf("%07x", $sum) . $r;
-    if ($sum <= 0xfffffff) {
-      $r = $addr . $r;
-      # if ($main::opt_debug) { print STDERR "$r\n"; }
-      return HexExtend($r);
-    } else {
-      $r = "00000000000000";
-    }
-
-    $sum = hex($addr) + 1;
-    if ($sum > 0xff) { $sum -= 0x100; }
-    $r = sprintf("%02x", $sum) . $r;
-
-    # if ($main::opt_debug) { print STDERR "$r\n"; }
-    return $r;
-  }
-}
-
-# Extract symbols for all PC values found in profile
-sub ExtractSymbols {
-  my $libs = shift;
-  my $pcset = shift;
-
-  my $symbols = {};
-
-  # Map each PC value to the containing library.  To make this faster,
-  # we sort libraries by their starting pc value (highest first), and
-  # advance through the libraries as we advance the pc.  Sometimes the
-  # addresses of libraries may overlap with the addresses of the main
-  # binary, so to make sure the libraries 'win', we iterate over the
-  # libraries in reverse order (which assumes the binary doesn't start
-  # in the middle of a library, which seems a fair assumption).
-  my @pcs = (sort { $a cmp $b } keys(%{$pcset}));  # pcset is 0-extended strings
-  foreach my $lib (sort {$b->[1] cmp $a->[1]} @{$libs}) {
-    my $libname = $lib->[0];
-    my $start = $lib->[1];
-    my $finish = $lib->[2];
-    my $offset = $lib->[3];
-
-    # Use debug library if it exists
-    my $debug_libname = DebuggingLibrary($libname);
-    if ($debug_libname) {
-        $libname = $debug_libname;
-    }
-
-    # Get list of pcs that belong in this library.
-    my $contained = [];
-    my ($start_pc_index, $finish_pc_index);
-    # Find smallest finish_pc_index such that $finish < $pc[$finish_pc_index].
-    for ($finish_pc_index = $#pcs + 1; $finish_pc_index > 0;
-         $finish_pc_index--) {
-      last if $pcs[$finish_pc_index - 1] le $finish;
-    }
-    # Find smallest start_pc_index such that $start <= $pc[$start_pc_index].
-    for ($start_pc_index = $finish_pc_index; $start_pc_index > 0;
-         $start_pc_index--) {
-      last if $pcs[$start_pc_index - 1] lt $start;
-    }
-    # This keeps PC values higher than $pc[$finish_pc_index] in @pcs,
-    # in case there are overlaps in libraries and the main binary.
-    @{$contained} = splice(@pcs, $start_pc_index,
-                           $finish_pc_index - $start_pc_index);
-    # Map to symbols
-    MapToSymbols($libname, AddressSub($start, $offset), $contained, $symbols);
-  }
-
-  return $symbols;
-}
-
-# Map list of PC values to symbols for a given image
-sub MapToSymbols {
-  my $image = shift;
-  my $offset = shift;
-  my $pclist = shift;
-  my $symbols = shift;
-
-  my $debug = 0;
-
-  # Ignore empty binaries
-  if ($#{$pclist} < 0) { return; }
-
-  # Figure out the addr2line command to use
-  my $addr2line = $obj_tool_map{"addr2line"};
-  my $cmd = ShellEscape($addr2line, "-f", "-C", "-e", $image);
-  if (exists $obj_tool_map{"addr2line_pdb"}) {
-    $addr2line = $obj_tool_map{"addr2line_pdb"};
-    $cmd = ShellEscape($addr2line, "--demangle", "-f", "-C", "-e", $image);
-  }
-
-  # If "addr2line" isn't installed on the system at all, just use
-  # nm to get what info we can (function names, but not line numbers).
-  if (system(ShellEscape($addr2line, "--help") . " >$dev_null 2>&1") != 0) {
-    MapSymbolsWithNM($image, $offset, $pclist, $symbols);
-    return;
-  }
-
-  # "addr2line -i" can produce a variable number of lines per input
-  # address, with no separator that allows us to tell when data for
-  # the next address starts.  So we find the address for a special
-  # symbol (_fini) and interleave this address between all real
-  # addresses passed to addr2line.  The name of this special symbol
-  # can then be used as a separator.
-  $sep_address = undef;  # May be filled in by MapSymbolsWithNM()
-  my $nm_symbols = {};
-  MapSymbolsWithNM($image, $offset, $pclist, $nm_symbols);
-  if (defined($sep_address)) {
-    # Only add " -i" to addr2line if the binary supports it.
-    # addr2line --help returns 0, but not if it sees an unknown flag first.
-    if (system("$cmd -i --help >$dev_null 2>&1") == 0) {
-      $cmd .= " -i";
-    } else {
-      $sep_address = undef;   # no need for sep_address if we don't support -i
-    }
-  }
-
-  # Make file with all PC values with intervening 'sep_address' so
-  # that we can reliably detect the end of inlined function list
-  open(ADDRESSES, ">$main::tmpfile_sym") || error("$main::tmpfile_sym: $!\n");
-  if ($debug) { print("---- $image ---\n"); }
-  for (my $i = 0; $i <= $#{$pclist}; $i++) {
-    # addr2line always reads hex addresses, and does not need '0x' prefix.
-    if ($debug) { printf STDERR ("%s\n", $pclist->[$i]); }
-    printf ADDRESSES ("%s\n", AddressSub($pclist->[$i], $offset));
-    if (defined($sep_address)) {
-      printf ADDRESSES ("%s\n", $sep_address);
-    }
-  }
-  close(ADDRESSES);
-  if ($debug) {
-    print("----\n");
-    system("cat", $main::tmpfile_sym);
-    print("----\n");
-    system("$cmd < " . ShellEscape($main::tmpfile_sym));
-    print("----\n");
-  }
-
-  open(SYMBOLS, "$cmd <" . ShellEscape($main::tmpfile_sym) . " |")
-      || error("$cmd: $!\n");
-  my $count = 0;   # Index in pclist
-  while (<SYMBOLS>) {
-    # Read fullfunction and filelineinfo from next pair of lines
-    s/\r?\n$//g;
-    my $fullfunction = $_;
-    $_ = <SYMBOLS>;
-    s/\r?\n$//g;
-    my $filelinenum = $_;
-
-    if (defined($sep_address) && $fullfunction eq $sep_symbol) {
-      # Terminating marker for data for this address
-      $count++;
-      next;
-    }
-
-    $filelinenum =~ s|\\|/|g; # turn windows-style paths into unix-style paths
-
-    my $pcstr = $pclist->[$count];
-    my $function = ShortFunctionName($fullfunction);
-    my $nms = $nm_symbols->{$pcstr};
-    if (defined($nms)) {
-      if ($fullfunction eq '??') {
-        # nm found a symbol for us.
-        $function = $nms->[0];
-        $fullfunction = $nms->[2];
-      } else {
-	# MapSymbolsWithNM tags each routine with its starting address,
-	# useful in case the image has multiple occurrences of this
-	# routine.  (It uses a syntax that resembles template paramters,
-	# that are automatically stripped out by ShortFunctionName().)
-	# addr2line does not provide the same information.  So we check
-	# if nm disambiguated our symbol, and if so take the annotated
-	# (nm) version of the routine-name.  TODO(csilvers): this won't
-	# catch overloaded, inlined symbols, which nm doesn't see.
-	# Better would be to do a check similar to nm's, in this fn.
-	if ($nms->[2] =~ m/^\Q$function\E/) {  # sanity check it's the right fn
-	  $function = $nms->[0];
-	  $fullfunction = $nms->[2];
-	}
-      }
-    }
-
-    # Prepend to accumulated symbols for pcstr
-    # (so that caller comes before callee)
-    my $sym = $symbols->{$pcstr};
-    if (!defined($sym)) {
-      $sym = [];
-      $symbols->{$pcstr} = $sym;
-    }
-    unshift(@{$sym}, $function, $filelinenum, $fullfunction);
-    if ($debug) { printf STDERR ("%s => [%s]\n", $pcstr, join(" ", @{$sym})); }
-    if (!defined($sep_address)) {
-      # Inlining is off, so this entry ends immediately
-      $count++;
-    }
-  }
-  close(SYMBOLS);
-}
-
-# Use nm to map the list of referenced PCs to symbols.  Return true iff we
-# are able to read procedure information via nm.
-sub MapSymbolsWithNM {
-  my $image = shift;
-  my $offset = shift;
-  my $pclist = shift;
-  my $symbols = shift;
-
-  # Get nm output sorted by increasing address
-  my $symbol_table = GetProcedureBoundaries($image, ".");
-  if (!%{$symbol_table}) {
-    return 0;
-  }
-  # Start addresses are already the right length (8 or 16 hex digits).
-  my @names = sort { $symbol_table->{$a}->[0] cmp $symbol_table->{$b}->[0] }
-    keys(%{$symbol_table});
-
-  if ($#names < 0) {
-    # No symbols: just use addresses
-    foreach my $pc (@{$pclist}) {
-      my $pcstr = "0x" . $pc;
-      $symbols->{$pc} = [$pcstr, "?", $pcstr];
-    }
-    return 0;
-  }
-
-  # Sort addresses so we can do a join against nm output
-  my $index = 0;
-  my $fullname = $names[0];
-  my $name = ShortFunctionName($fullname);
-  foreach my $pc (sort { $a cmp $b } @{$pclist}) {
-    # Adjust for mapped offset
-    my $mpc = AddressSub($pc, $offset);
-    while (($index < $#names) && ($mpc ge $symbol_table->{$fullname}->[1])){
-      $index++;
-      $fullname = $names[$index];
-      $name = ShortFunctionName($fullname);
-    }
-    if ($mpc lt $symbol_table->{$fullname}->[1]) {
-      $symbols->{$pc} = [$name, "?", $fullname];
-    } else {
-      my $pcstr = "0x" . $pc;
-      $symbols->{$pc} = [$pcstr, "?", $pcstr];
-    }
-  }
-  return 1;
-}
-
-sub ShortFunctionName {
-  my $function = shift;
-  while ($function =~ s/\([^()]*\)(\s*const)?//g) { }   # Argument types
-  while ($function =~ s/<[^<>]*>//g)  { }    # Remove template arguments
-  $function =~ s/^.*\s+(\w+::)/$1/;          # Remove leading type
-  return $function;
-}
-
-# Trim overly long symbols found in disassembler output
-sub CleanDisassembly {
-  my $d = shift;
-  while ($d =~ s/\([^()%]*\)(\s*const)?//g) { } # Argument types, not (%rax)
-  while ($d =~ s/(\w+)<[^<>]*>/$1/g)  { }       # Remove template arguments
-  return $d;
-}
-
-# Clean file name for display
-sub CleanFileName {
-  my ($f) = @_;
-  $f =~ s|^/proc/self/cwd/||;
-  $f =~ s|^\./||;
-  return $f;
-}
-
-# Make address relative to section and clean up for display
-sub UnparseAddress {
-  my ($offset, $address) = @_;
-  $address = AddressSub($address, $offset);
-  $address =~ s/^0x//;
-  $address =~ s/^0*//;
-  return $address;
-}
-
-##### Miscellaneous #####
-
-# Find the right versions of the above object tools to use.  The
-# argument is the program file being analyzed, and should be an ELF
-# 32-bit or ELF 64-bit executable file.  The location of the tools
-# is determined by considering the following options in this order:
-#   1) --tools option, if set
-#   2) JEPROF_TOOLS environment variable, if set
-#   3) the environment
-sub ConfigureObjTools {
-  my $prog_file = shift;
-
-  # Check for the existence of $prog_file because /usr/bin/file does not
-  # predictably return error status in prod.
-  (-e $prog_file)  || error("$prog_file does not exist.\n");
-
-  my $file_type = undef;
-  if (-e "/usr/bin/file") {
-    # Follow symlinks (at least for systems where "file" supports that).
-    my $escaped_prog_file = ShellEscape($prog_file);
-    $file_type = `/usr/bin/file -L $escaped_prog_file 2>$dev_null ||
-                  /usr/bin/file $escaped_prog_file`;
-  } elsif ($^O == "MSWin32") {
-    $file_type = "MS Windows";
-  } else {
-    print STDERR "WARNING: Can't determine the file type of $prog_file";
-  }
-
-  if ($file_type =~ /64-bit/) {
-    # Change $address_length to 16 if the program file is ELF 64-bit.
-    # We can't detect this from many (most?) heap or lock contention
-    # profiles, since the actual addresses referenced are generally in low
-    # memory even for 64-bit programs.
-    $address_length = 16;
-  }
-
-  if ($file_type =~ /MS Windows/) {
-    # For windows, we provide a version of nm and addr2line as part of
-    # the opensource release, which is capable of parsing
-    # Windows-style PDB executables.  It should live in the path, or
-    # in the same directory as jeprof.
-    $obj_tool_map{"nm_pdb"} = "nm-pdb";
-    $obj_tool_map{"addr2line_pdb"} = "addr2line-pdb";
-  }
-
-  if ($file_type =~ /Mach-O/) {
-    # OS X uses otool to examine Mach-O files, rather than objdump.
-    $obj_tool_map{"otool"} = "otool";
-    $obj_tool_map{"addr2line"} = "false";  # no addr2line
-    $obj_tool_map{"objdump"} = "false";  # no objdump
-  }
-
-  # Go fill in %obj_tool_map with the pathnames to use:
-  foreach my $tool (keys %obj_tool_map) {
-    $obj_tool_map{$tool} = ConfigureTool($obj_tool_map{$tool});
-  }
-}
-
-# Returns the path of a caller-specified object tool.  If --tools or
-# JEPROF_TOOLS are specified, then returns the full path to the tool
-# with that prefix.  Otherwise, returns the path unmodified (which
-# means we will look for it on PATH).
-sub ConfigureTool {
-  my $tool = shift;
-  my $path;
-
-  # --tools (or $JEPROF_TOOLS) is a comma separated list, where each
-  # item is either a) a pathname prefix, or b) a map of the form
-  # <tool>:<path>.  First we look for an entry of type (b) for our
-  # tool.  If one is found, we use it.  Otherwise, we consider all the
-  # pathname prefixes in turn, until one yields an existing file.  If
-  # none does, we use a default path.
-  my $tools = $main::opt_tools || $ENV{"JEPROF_TOOLS"} || "";
-  if ($tools =~ m/(,|^)\Q$tool\E:([^,]*)/) {
-    $path = $2;
-    # TODO(csilvers): sanity-check that $path exists?  Hard if it's relative.
-  } elsif ($tools ne '') {
-    foreach my $prefix (split(',', $tools)) {
-      next if ($prefix =~ /:/);    # ignore "tool:fullpath" entries in the list
-      if (-x $prefix . $tool) {
-        $path = $prefix . $tool;
-        last;
-      }
-    }
-    if (!$path) {
-      error("No '$tool' found with prefix specified by " .
-            "--tools (or \$JEPROF_TOOLS) '$tools'\n");
-    }
-  } else {
-    # ... otherwise use the version that exists in the same directory as
-    # jeprof.  If there's nothing there, use $PATH.
-    $0 =~ m,[^/]*$,;     # this is everything after the last slash
-    my $dirname = $`;    # this is everything up to and including the last slash
-    if (-x "$dirname$tool") {
-      $path = "$dirname$tool";
-    } else {
-      $path = $tool;
-    }
-  }
-  if ($main::opt_debug) { print STDERR "Using '$path' for '$tool'.\n"; }
-  return $path;
-}
-
-sub ShellEscape {
-  my @escaped_words = ();
-  foreach my $word (@_) {
-    my $escaped_word = $word;
-    if ($word =~ m![^a-zA-Z0-9/.,_=-]!) {  # check for anything not in whitelist
-      $escaped_word =~ s/'/'\\''/;
-      $escaped_word = "'$escaped_word'";
-    }
-    push(@escaped_words, $escaped_word);
-  }
-  return join(" ", @escaped_words);
-}
-
-sub cleanup {
-  unlink($main::tmpfile_sym);
-  unlink(keys %main::tempnames);
-
-  # We leave any collected profiles in $HOME/jeprof in case the user wants
-  # to look at them later.  We print a message informing them of this.
-  if ((scalar(@main::profile_files) > 0) &&
-      defined($main::collected_profile)) {
-    if (scalar(@main::profile_files) == 1) {
-      print STDERR "Dynamically gathered profile is in $main::collected_profile\n";
-    }
-    print STDERR "If you want to investigate this profile further, you can do:\n";
-    print STDERR "\n";
-    print STDERR "  jeprof \\\n";
-    print STDERR "    $main::prog \\\n";
-    print STDERR "    $main::collected_profile\n";
-    print STDERR "\n";
-  }
-}
-
-sub sighandler {
-  cleanup();
-  exit(1);
-}
-
-sub error {
-  my $msg = shift;
-  print STDERR $msg;
-  cleanup();
-  exit(1);
-}
-
-
-# Run $nm_command and get all the resulting procedure boundaries whose
-# names match "$regexp" and returns them in a hashtable mapping from
-# procedure name to a two-element vector of [start address, end address]
-sub GetProcedureBoundariesViaNm {
-  my $escaped_nm_command = shift;    # shell-escaped
-  my $regexp = shift;
-
-  my $symbol_table = {};
-  open(NM, "$escaped_nm_command |") || error("$escaped_nm_command: $!\n");
-  my $last_start = "0";
-  my $routine = "";
-  while (<NM>) {
-    s/\r//g;         # turn windows-looking lines into unix-looking lines
-    if (m/^\s*([0-9a-f]+) (.) (..*)/) {
-      my $start_val = $1;
-      my $type = $2;
-      my $this_routine = $3;
-
-      # It's possible for two symbols to share the same address, if
-      # one is a zero-length variable (like __start_google_malloc) or
-      # one symbol is a weak alias to another (like __libc_malloc).
-      # In such cases, we want to ignore all values except for the
-      # actual symbol, which in nm-speak has type "T".  The logic
-      # below does this, though it's a bit tricky: what happens when
-      # we have a series of lines with the same address, is the first
-      # one gets queued up to be processed.  However, it won't
-      # *actually* be processed until later, when we read a line with
-      # a different address.  That means that as long as we're reading
-      # lines with the same address, we have a chance to replace that
-      # item in the queue, which we do whenever we see a 'T' entry --
-      # that is, a line with type 'T'.  If we never see a 'T' entry,
-      # we'll just go ahead and process the first entry (which never
-      # got touched in the queue), and ignore the others.
-      if ($start_val eq $last_start && $type =~ /t/i) {
-        # We are the 'T' symbol at this address, replace previous symbol.
-        $routine = $this_routine;
-        next;
-      } elsif ($start_val eq $last_start) {
-        # We're not the 'T' symbol at this address, so ignore us.
-        next;
-      }
-
-      if ($this_routine eq $sep_symbol) {
-        $sep_address = HexExtend($start_val);
-      }
-
-      # Tag this routine with the starting address in case the image
-      # has multiple occurrences of this routine.  We use a syntax
-      # that resembles template parameters that are automatically
-      # stripped out by ShortFunctionName()
-      $this_routine .= "<$start_val>";
-
-      if (defined($routine) && $routine =~ m/$regexp/) {
-        $symbol_table->{$routine} = [HexExtend($last_start),
-                                     HexExtend($start_val)];
-      }
-      $last_start = $start_val;
-      $routine = $this_routine;
-    } elsif (m/^Loaded image name: (.+)/) {
-      # The win32 nm workalike emits information about the binary it is using.
-      if ($main::opt_debug) { print STDERR "Using Image $1\n"; }
-    } elsif (m/^PDB file name: (.+)/) {
-      # The win32 nm workalike emits information about the pdb it is using.
-      if ($main::opt_debug) { print STDERR "Using PDB $1\n"; }
-    }
-  }
-  close(NM);
-  # Handle the last line in the nm output.  Unfortunately, we don't know
-  # how big this last symbol is, because we don't know how big the file
-  # is.  For now, we just give it a size of 0.
-  # TODO(csilvers): do better here.
-  if (defined($routine) && $routine =~ m/$regexp/) {
-    $symbol_table->{$routine} = [HexExtend($last_start),
-                                 HexExtend($last_start)];
-  }
-  return $symbol_table;
-}
-
-# Gets the procedure boundaries for all routines in "$image" whose names
-# match "$regexp" and returns them in a hashtable mapping from procedure
-# name to a two-element vector of [start address, end address].
-# Will return an empty map if nm is not installed or not working properly.
-sub GetProcedureBoundaries {
-  my $image = shift;
-  my $regexp = shift;
-
-  # If $image doesn't start with /, then put ./ in front of it.  This works
-  # around an obnoxious bug in our probing of nm -f behavior.
-  # "nm -f $image" is supposed to fail on GNU nm, but if:
-  #
-  # a. $image starts with [BbSsPp] (for example, bin/foo/bar), AND
-  # b. you have a.out in your current directory (a not uncommon occurence)
-  #
-  # then "nm -f $image" succeeds because -f only looks at the first letter of
-  # the argument, which looks valid because it's [BbSsPp], and then since
-  # there's no image provided, it looks for a.out and finds it.
-  #
-  # This regex makes sure that $image starts with . or /, forcing the -f
-  # parsing to fail since . and / are not valid formats.
-  $image =~ s#^[^/]#./$&#;
-
-  # For libc libraries, the copy in /usr/lib/debug contains debugging symbols
-  my $debugging = DebuggingLibrary($image);
-  if ($debugging) {
-    $image = $debugging;
-  }
-
-  my $nm = $obj_tool_map{"nm"};
-  my $cppfilt = $obj_tool_map{"c++filt"};
-
-  # nm can fail for two reasons: 1) $image isn't a debug library; 2) nm
-  # binary doesn't support --demangle.  In addition, for OS X we need
-  # to use the -f flag to get 'flat' nm output (otherwise we don't sort
-  # properly and get incorrect results).  Unfortunately, GNU nm uses -f
-  # in an incompatible way.  So first we test whether our nm supports
-  # --demangle and -f.
-  my $demangle_flag = "";
-  my $cppfilt_flag = "";
-  my $to_devnull = ">$dev_null 2>&1";
-  if (system(ShellEscape($nm, "--demangle", "image") . $to_devnull) == 0) {
-    # In this mode, we do "nm --demangle <foo>"
-    $demangle_flag = "--demangle";
-    $cppfilt_flag = "";
-  } elsif (system(ShellEscape($cppfilt, $image) . $to_devnull) == 0) {
-    # In this mode, we do "nm <foo> | c++filt"
-    $cppfilt_flag = " | " . ShellEscape($cppfilt);
-  };
-  my $flatten_flag = "";
-  if (system(ShellEscape($nm, "-f", $image) . $to_devnull) == 0) {
-    $flatten_flag = "-f";
-  }
-
-  # Finally, in the case $imagie isn't a debug library, we try again with
-  # -D to at least get *exported* symbols.  If we can't use --demangle,
-  # we use c++filt instead, if it exists on this system.
-  my @nm_commands = (ShellEscape($nm, "-n", $flatten_flag, $demangle_flag,
-                                 $image) . " 2>$dev_null $cppfilt_flag",
-                     ShellEscape($nm, "-D", "-n", $flatten_flag, $demangle_flag,
-                                 $image) . " 2>$dev_null $cppfilt_flag",
-                     # 6nm is for Go binaries
-                     ShellEscape("6nm", "$image") . " 2>$dev_null | sort",
-                     );
-
-  # If the executable is an MS Windows PDB-format executable, we'll
-  # have set up obj_tool_map("nm_pdb").  In this case, we actually
-  # want to use both unix nm and windows-specific nm_pdb, since
-  # PDB-format executables can apparently include dwarf .o files.
-  if (exists $obj_tool_map{"nm_pdb"}) {
-    push(@nm_commands,
-         ShellEscape($obj_tool_map{"nm_pdb"}, "--demangle", $image)
-         . " 2>$dev_null");
-  }
-
-  foreach my $nm_command (@nm_commands) {
-    my $symbol_table = GetProcedureBoundariesViaNm($nm_command, $regexp);
-    return $symbol_table if (%{$symbol_table});
-  }
-  my $symbol_table = {};
-  return $symbol_table;
-}
-
-
-# The test vectors for AddressAdd/Sub/Inc are 8-16-nibble hex strings.
-# To make them more readable, we add underscores at interesting places.
-# This routine removes the underscores, producing the canonical representation
-# used by jeprof to represent addresses, particularly in the tested routines.
-sub CanonicalHex {
-  my $arg = shift;
-  return join '', (split '_',$arg);
-}
-
-
-# Unit test for AddressAdd:
-sub AddressAddUnitTest {
-  my $test_data_8 = shift;
-  my $test_data_16 = shift;
-  my $error_count = 0;
-  my $fail_count = 0;
-  my $pass_count = 0;
-  # print STDERR "AddressAddUnitTest: ", 1+$#{$test_data_8}, " tests\n";
-
-  # First a few 8-nibble addresses.  Note that this implementation uses
-  # plain old arithmetic, so a quick sanity check along with verifying what
-  # happens to overflow (we want it to wrap):
-  $address_length = 8;
-  foreach my $row (@{$test_data_8}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressAdd ($row->[0], $row->[1]);
-    if ($sum ne $row->[2]) {
-      printf STDERR "ERROR: %s != %s + %s = %s\n", $sum,
-             $row->[0], $row->[1], $row->[2];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressAdd 32-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count = $fail_count;
-  $fail_count = 0;
-  $pass_count = 0;
-
-  # Now 16-nibble addresses.
-  $address_length = 16;
-  foreach my $row (@{$test_data_16}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressAdd (CanonicalHex($row->[0]), CanonicalHex($row->[1]));
-    my $expected = join '', (split '_',$row->[2]);
-    if ($sum ne CanonicalHex($row->[2])) {
-      printf STDERR "ERROR: %s != %s + %s = %s\n", $sum,
-             $row->[0], $row->[1], $row->[2];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressAdd 64-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count += $fail_count;
-
-  return $error_count;
-}
-
-
-# Unit test for AddressSub:
-sub AddressSubUnitTest {
-  my $test_data_8 = shift;
-  my $test_data_16 = shift;
-  my $error_count = 0;
-  my $fail_count = 0;
-  my $pass_count = 0;
-  # print STDERR "AddressSubUnitTest: ", 1+$#{$test_data_8}, " tests\n";
-
-  # First a few 8-nibble addresses.  Note that this implementation uses
-  # plain old arithmetic, so a quick sanity check along with verifying what
-  # happens to overflow (we want it to wrap):
-  $address_length = 8;
-  foreach my $row (@{$test_data_8}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressSub ($row->[0], $row->[1]);
-    if ($sum ne $row->[3]) {
-      printf STDERR "ERROR: %s != %s - %s = %s\n", $sum,
-             $row->[0], $row->[1], $row->[3];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressSub 32-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count = $fail_count;
-  $fail_count = 0;
-  $pass_count = 0;
-
-  # Now 16-nibble addresses.
-  $address_length = 16;
-  foreach my $row (@{$test_data_16}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressSub (CanonicalHex($row->[0]), CanonicalHex($row->[1]));
-    if ($sum ne CanonicalHex($row->[3])) {
-      printf STDERR "ERROR: %s != %s - %s = %s\n", $sum,
-             $row->[0], $row->[1], $row->[3];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressSub 64-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count += $fail_count;
-
-  return $error_count;
-}
-
-
-# Unit test for AddressInc:
-sub AddressIncUnitTest {
-  my $test_data_8 = shift;
-  my $test_data_16 = shift;
-  my $error_count = 0;
-  my $fail_count = 0;
-  my $pass_count = 0;
-  # print STDERR "AddressIncUnitTest: ", 1+$#{$test_data_8}, " tests\n";
-
-  # First a few 8-nibble addresses.  Note that this implementation uses
-  # plain old arithmetic, so a quick sanity check along with verifying what
-  # happens to overflow (we want it to wrap):
-  $address_length = 8;
-  foreach my $row (@{$test_data_8}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressInc ($row->[0]);
-    if ($sum ne $row->[4]) {
-      printf STDERR "ERROR: %s != %s + 1 = %s\n", $sum,
-             $row->[0], $row->[4];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressInc 32-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count = $fail_count;
-  $fail_count = 0;
-  $pass_count = 0;
-
-  # Now 16-nibble addresses.
-  $address_length = 16;
-  foreach my $row (@{$test_data_16}) {
-    if ($main::opt_debug and $main::opt_test) { print STDERR "@{$row}\n"; }
-    my $sum = AddressInc (CanonicalHex($row->[0]));
-    if ($sum ne CanonicalHex($row->[4])) {
-      printf STDERR "ERROR: %s != %s + 1 = %s\n", $sum,
-             $row->[0], $row->[4];
-      ++$fail_count;
-    } else {
-      ++$pass_count;
-    }
-  }
-  printf STDERR "AddressInc 64-bit tests: %d passes, %d failures\n",
-         $pass_count, $fail_count;
-  $error_count += $fail_count;
-
-  return $error_count;
-}
-
-
-# Driver for unit tests.
-# Currently just the address add/subtract/increment routines for 64-bit.
-sub RunUnitTests {
-  my $error_count = 0;
-
-  # This is a list of tuples [a, b, a+b, a-b, a+1]
-  my $unit_test_data_8 = [
-    [qw(aaaaaaaa 50505050 fafafafa 5a5a5a5a aaaaaaab)],
-    [qw(50505050 aaaaaaaa fafafafa a5a5a5a6 50505051)],
-    [qw(ffffffff aaaaaaaa aaaaaaa9 55555555 00000000)],
-    [qw(00000001 ffffffff 00000000 00000002 00000002)],
-    [qw(00000001 fffffff0 fffffff1 00000011 00000002)],
-  ];
-  my $unit_test_data_16 = [
-    # The implementation handles data in 7-nibble chunks, so those are the
-    # interesting boundaries.
-    [qw(aaaaaaaa 50505050
-        00_000000f_afafafa 00_0000005_a5a5a5a 00_000000a_aaaaaab)],
-    [qw(50505050 aaaaaaaa
-        00_000000f_afafafa ff_ffffffa_5a5a5a6 00_0000005_0505051)],
-    [qw(ffffffff aaaaaaaa
-        00_000001a_aaaaaa9 00_0000005_5555555 00_0000010_0000000)],
-    [qw(00000001 ffffffff
-        00_0000010_0000000 ff_ffffff0_0000002 00_0000000_0000002)],
-    [qw(00000001 fffffff0
-        00_000000f_ffffff1 ff_ffffff0_0000011 00_0000000_0000002)],
-
-    [qw(00_a00000a_aaaaaaa 50505050
-        00_a00000f_afafafa 00_a000005_a5a5a5a 00_a00000a_aaaaaab)],
-    [qw(0f_fff0005_0505050 aaaaaaaa
-        0f_fff000f_afafafa 0f_ffefffa_5a5a5a6 0f_fff0005_0505051)],
-    [qw(00_000000f_fffffff 01_800000a_aaaaaaa
-        01_800001a_aaaaaa9 fe_8000005_5555555 00_0000010_0000000)],
-    [qw(00_0000000_0000001 ff_fffffff_fffffff
-        00_0000000_0000000 00_0000000_0000002 00_0000000_0000002)],
-    [qw(00_0000000_0000001 ff_fffffff_ffffff0
-        ff_fffffff_ffffff1 00_0000000_0000011 00_0000000_0000002)],
-  ];
-
-  $error_count += AddressAddUnitTest($unit_test_data_8, $unit_test_data_16);
-  $error_count += AddressSubUnitTest($unit_test_data_8, $unit_test_data_16);
-  $error_count += AddressIncUnitTest($unit_test_data_8, $unit_test_data_16);
-  if ($error_count > 0) {
-    print STDERR $error_count, " errors: FAILED\n";
-  } else {
-    print STDERR "PASS\n";
-  }
-  exit ($error_count);
-}
diff --git a/redis-stable/deps/jemalloc/build-aux/config.guess b/redis-stable/deps/jemalloc/build-aux/config.guess
deleted file mode 100755
index 2e9ad7fe..00000000
--- a/redis-stable/deps/jemalloc/build-aux/config.guess
+++ /dev/null
@@ -1,1462 +0,0 @@
-#! /bin/sh
-# Attempt to guess a canonical system name.
-#   Copyright 1992-2016 Free Software Foundation, Inc.
-
-timestamp='2016-10-02'
-
-# This file 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; either version 3 of the License, or
-# (at your option) any later version.
-#
-# 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, see <http://www.gnu.org/licenses/>.
-#
-# As a special exception to the GNU General Public License, if you
-# distribute this file as part of a program that contains a
-# configuration script generated by Autoconf, you may include it under
-# the same distribution terms that you use for the rest of that
-# program.  This Exception is an additional permission under section 7
-# of the GNU General Public License, version 3 ("GPLv3").
-#
-# Originally written by Per Bothner; maintained since 2000 by Ben Elliston.
-#
-# You can get the latest version of this script from:
-# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
-#
-# Please send patches to <config-patches@gnu.org>.
-
-
-me=`echo "$0" | sed -e 's,.*/,,'`
-
-usage="\
-Usage: $0 [OPTION]
-
-Output the configuration name of the system \`$me' is run on.
-
-Operation modes:
-  -h, --help         print this help, then exit
-  -t, --time-stamp   print date of last modification, then exit
-  -v, --version      print version number, then exit
-
-Report bugs and patches to <config-patches@gnu.org>."
-
-version="\
-GNU config.guess ($timestamp)
-
-Originally written by Per Bothner.
-Copyright 1992-2016 Free Software Foundation, Inc.
-
-This is free software; see the source for copying conditions.  There is NO
-warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
-
-help="
-Try \`$me --help' for more information."
-
-# Parse command line
-while test $# -gt 0 ; do
-  case $1 in
-    --time-stamp | --time* | -t )
-       echo "$timestamp" ; exit ;;
-    --version | -v )
-       echo "$version" ; exit ;;
-    --help | --h* | -h )
-       echo "$usage"; exit ;;
-    -- )     # Stop option processing
-       shift; break ;;
-    - )	# Use stdin as input.
-       break ;;
-    -* )
-       echo "$me: invalid option $1$help" >&2
-       exit 1 ;;
-    * )
-       break ;;
-  esac
-done
-
-if test $# != 0; then
-  echo "$me: too many arguments$help" >&2
-  exit 1
-fi
-
-trap 'exit 1' 1 2 15
-
-# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
-# compiler to aid in system detection is discouraged as it requires
-# temporary files to be created and, as you can see below, it is a
-# headache to deal with in a portable fashion.
-
-# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
-# use `HOST_CC' if defined, but it is deprecated.
-
-# Portable tmp directory creation inspired by the Autoconf team.
-
-set_cc_for_build='
-trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
-trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
-: ${TMPDIR=/tmp} ;
- { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
- { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||
- { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } ||
- { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
-dummy=$tmp/dummy ;
-tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
-case $CC_FOR_BUILD,$HOST_CC,$CC in
- ,,)    echo "int x;" > $dummy.c ;
-	for c in cc gcc c89 c99 ; do
-	  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
-	     CC_FOR_BUILD="$c"; break ;
-	  fi ;
-	done ;
-	if test x"$CC_FOR_BUILD" = x ; then
-	  CC_FOR_BUILD=no_compiler_found ;
-	fi
-	;;
- ,,*)   CC_FOR_BUILD=$CC ;;
- ,*,*)  CC_FOR_BUILD=$HOST_CC ;;
-esac ; set_cc_for_build= ;'
-
-# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
-# (ghazi@noc.rutgers.edu 1994-08-24)
-if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
-	PATH=$PATH:/.attbin ; export PATH
-fi
-
-UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
-UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
-UNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown
-UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown
-
-case "${UNAME_SYSTEM}" in
-Linux|GNU|GNU/*)
-	# If the system lacks a compiler, then just pick glibc.
-	# We could probably try harder.
-	LIBC=gnu
-
-	eval $set_cc_for_build
-	cat <<-EOF > $dummy.c
-	#include <features.h>
-	#if defined(__UCLIBC__)
-	LIBC=uclibc
-	#elif defined(__dietlibc__)
-	LIBC=dietlibc
-	#else
-	LIBC=gnu
-	#endif
-	EOF
-	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`
-	;;
-esac
-
-# Note: order is significant - the case branches are not exclusive.
-
-case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
-    *:NetBSD:*:*)
-	# NetBSD (nbsd) targets should (where applicable) match one or
-	# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,
-	# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently
-	# switched to ELF, *-*-netbsd* would select the old
-	# object file format.  This provides both forward
-	# compatibility and a consistent mechanism for selecting the
-	# object file format.
-	#
-	# Note: NetBSD doesn't particularly care about the vendor
-	# portion of the name.  We always set it to "unknown".
-	sysctl="sysctl -n hw.machine_arch"
-	UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \
-	    /sbin/$sysctl 2>/dev/null || \
-	    /usr/sbin/$sysctl 2>/dev/null || \
-	    echo unknown)`
-	case "${UNAME_MACHINE_ARCH}" in
-	    armeb) machine=armeb-unknown ;;
-	    arm*) machine=arm-unknown ;;
-	    sh3el) machine=shl-unknown ;;
-	    sh3eb) machine=sh-unknown ;;
-	    sh5el) machine=sh5le-unknown ;;
-	    earmv*)
-		arch=`echo ${UNAME_MACHINE_ARCH} | sed -e 's,^e\(armv[0-9]\).*$,\1,'`
-		endian=`echo ${UNAME_MACHINE_ARCH} | sed -ne 's,^.*\(eb\)$,\1,p'`
-		machine=${arch}${endian}-unknown
-		;;
-	    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
-	esac
-	# The Operating System including object format, if it has switched
-	# to ELF recently (or will in the future) and ABI.
-	case "${UNAME_MACHINE_ARCH}" in
-	    earm*)
-		os=netbsdelf
-		;;
-	    arm*|i386|m68k|ns32k|sh3*|sparc|vax)
-		eval $set_cc_for_build
-		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
-			| grep -q __ELF__
-		then
-		    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
-		    # Return netbsd for either.  FIX?
-		    os=netbsd
-		else
-		    os=netbsdelf
-		fi
-		;;
-	    *)
-		os=netbsd
-		;;
-	esac
-	# Determine ABI tags.
-	case "${UNAME_MACHINE_ARCH}" in
-	    earm*)
-		expr='s/^earmv[0-9]/-eabi/;s/eb$//'
-		abi=`echo ${UNAME_MACHINE_ARCH} | sed -e "$expr"`
-		;;
-	esac
-	# The OS release
-	# Debian GNU/NetBSD machines have a different userland, and
-	# thus, need a distinct triplet. However, they do not need
-	# kernel version information, so it can be replaced with a
-	# suitable tag, in the style of linux-gnu.
-	case "${UNAME_VERSION}" in
-	    Debian*)
-		release='-gnu'
-		;;
-	    *)
-		release=`echo ${UNAME_RELEASE} | sed -e 's/[-_].*//' | cut -d. -f1,2`
-		;;
-	esac
-	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
-	# contains redundant information, the shorter form:
-	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
-	echo "${machine}-${os}${release}${abi}"
-	exit ;;
-    *:Bitrig:*:*)
-	UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`
-	echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE}
-	exit ;;
-    *:OpenBSD:*:*)
-	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
-	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
-	exit ;;
-    *:LibertyBSD:*:*)
-	UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'`
-	echo ${UNAME_MACHINE_ARCH}-unknown-libertybsd${UNAME_RELEASE}
-	exit ;;
-    *:ekkoBSD:*:*)
-	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
-	exit ;;
-    *:SolidBSD:*:*)
-	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
-	exit ;;
-    macppc:MirBSD:*:*)
-	echo powerpc-unknown-mirbsd${UNAME_RELEASE}
-	exit ;;
-    *:MirBSD:*:*)
-	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
-	exit ;;
-    *:Sortix:*:*)
-	echo ${UNAME_MACHINE}-unknown-sortix
-	exit ;;
-    alpha:OSF1:*:*)
-	case $UNAME_RELEASE in
-	*4.0)
-		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
-		;;
-	*5.*)
-		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
-		;;
-	esac
-	# According to Compaq, /usr/sbin/psrinfo has been available on
-	# OSF/1 and Tru64 systems produced since 1995.  I hope that
-	# covers most systems running today.  This code pipes the CPU
-	# types through head -n 1, so we only detect the type of CPU 0.
-	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \(.*\) processor.*$/\1/p' | head -n 1`
-	case "$ALPHA_CPU_TYPE" in
-	    "EV4 (21064)")
-		UNAME_MACHINE=alpha ;;
-	    "EV4.5 (21064)")
-		UNAME_MACHINE=alpha ;;
-	    "LCA4 (21066/21068)")
-		UNAME_MACHINE=alpha ;;
-	    "EV5 (21164)")
-		UNAME_MACHINE=alphaev5 ;;
-	    "EV5.6 (21164A)")
-		UNAME_MACHINE=alphaev56 ;;
-	    "EV5.6 (21164PC)")
-		UNAME_MACHINE=alphapca56 ;;
-	    "EV5.7 (21164PC)")
-		UNAME_MACHINE=alphapca57 ;;
-	    "EV6 (21264)")
-		UNAME_MACHINE=alphaev6 ;;
-	    "EV6.7 (21264A)")
-		UNAME_MACHINE=alphaev67 ;;
-	    "EV6.8CB (21264C)")
-		UNAME_MACHINE=alphaev68 ;;
-	    "EV6.8AL (21264B)")
-		UNAME_MACHINE=alphaev68 ;;
-	    "EV6.8CX (21264D)")
-		UNAME_MACHINE=alphaev68 ;;
-	    "EV6.9A (21264/EV69A)")
-		UNAME_MACHINE=alphaev69 ;;
-	    "EV7 (21364)")
-		UNAME_MACHINE=alphaev7 ;;
-	    "EV7.9 (21364A)")
-		UNAME_MACHINE=alphaev79 ;;
-	esac
-	# A Pn.n version is a patched version.
-	# A Vn.n version is a released version.
-	# A Tn.n version is a released field test version.
-	# A Xn.n version is an unreleased experimental baselevel.
-	# 1.2 uses "1.2" for uname -r.
-	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
-	# Reset EXIT trap before exiting to avoid spurious non-zero exit code.
-	exitcode=$?
-	trap '' 0
-	exit $exitcode ;;
-    Alpha\ *:Windows_NT*:*)
-	# How do we know it's Interix rather than the generic POSIX subsystem?
-	# Should we change UNAME_MACHINE based on the output of uname instead
-	# of the specific Alpha model?
-	echo alpha-pc-interix
-	exit ;;
-    21064:Windows_NT:50:3)
-	echo alpha-dec-winnt3.5
-	exit ;;
-    Amiga*:UNIX_System_V:4.0:*)
-	echo m68k-unknown-sysv4
-	exit ;;
-    *:[Aa]miga[Oo][Ss]:*:*)
-	echo ${UNAME_MACHINE}-unknown-amigaos
-	exit ;;
-    *:[Mm]orph[Oo][Ss]:*:*)
-	echo ${UNAME_MACHINE}-unknown-morphos
-	exit ;;
-    *:OS/390:*:*)
-	echo i370-ibm-openedition
-	exit ;;
-    *:z/VM:*:*)
-	echo s390-ibm-zvmoe
-	exit ;;
-    *:OS400:*:*)
-	echo powerpc-ibm-os400
-	exit ;;
-    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
-	echo arm-acorn-riscix${UNAME_RELEASE}
-	exit ;;
-    arm*:riscos:*:*|arm*:RISCOS:*:*)
-	echo arm-unknown-riscos
-	exit ;;
-    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
-	echo hppa1.1-hitachi-hiuxmpp
-	exit ;;
-    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
-	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
-	if test "`(/bin/universe) 2>/dev/null`" = att ; then
-		echo pyramid-pyramid-sysv3
-	else
-		echo pyramid-pyramid-bsd
-	fi
-	exit ;;
-    NILE*:*:*:dcosx)
-	echo pyramid-pyramid-svr4
-	exit ;;
-    DRS?6000:unix:4.0:6*)
-	echo sparc-icl-nx6
-	exit ;;
-    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
-	case `/usr/bin/uname -p` in
-	    sparc) echo sparc-icl-nx7; exit ;;
-	esac ;;
-    s390x:SunOS:*:*)
-	echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    sun4H:SunOS:5.*:*)
-	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
-	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)
-	echo i386-pc-auroraux${UNAME_RELEASE}
-	exit ;;
-    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)
-	eval $set_cc_for_build
-	SUN_ARCH=i386
-	# If there is a compiler, see if it is configured for 64-bit objects.
-	# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.
-	# This test works for both compilers.
-	if [ "$CC_FOR_BUILD" != no_compiler_found ]; then
-	    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \
-		(CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
-		grep IS_64BIT_ARCH >/dev/null
-	    then
-		SUN_ARCH=x86_64
-	    fi
-	fi
-	echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    sun4*:SunOS:6*:*)
-	# According to config.sub, this is the proper way to canonicalize
-	# SunOS6.  Hard to guess exactly what SunOS6 will be like, but
-	# it's likely to be more like Solaris than SunOS4.
-	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    sun4*:SunOS:*:*)
-	case "`/usr/bin/arch -k`" in
-	    Series*|S4*)
-		UNAME_RELEASE=`uname -v`
-		;;
-	esac
-	# Japanese Language versions have a version number like `4.1.3-JL'.
-	echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`
-	exit ;;
-    sun3*:SunOS:*:*)
-	echo m68k-sun-sunos${UNAME_RELEASE}
-	exit ;;
-    sun*:*:4.2BSD:*)
-	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
-	test "x${UNAME_RELEASE}" = x && UNAME_RELEASE=3
-	case "`/bin/arch`" in
-	    sun3)
-		echo m68k-sun-sunos${UNAME_RELEASE}
-		;;
-	    sun4)
-		echo sparc-sun-sunos${UNAME_RELEASE}
-		;;
-	esac
-	exit ;;
-    aushp:SunOS:*:*)
-	echo sparc-auspex-sunos${UNAME_RELEASE}
-	exit ;;
-    # The situation for MiNT is a little confusing.  The machine name
-    # can be virtually everything (everything which is not
-    # "atarist" or "atariste" at least should have a processor
-    # > m68000).  The system name ranges from "MiNT" over "FreeMiNT"
-    # to the lowercase version "mint" (or "freemint").  Finally
-    # the system name "TOS" denotes a system which is actually not
-    # MiNT.  But MiNT is downward compatible to TOS, so this should
-    # be no problem.
-    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)
-	echo m68k-atari-mint${UNAME_RELEASE}
-	exit ;;
-    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)
-	echo m68k-atari-mint${UNAME_RELEASE}
-	exit ;;
-    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
-	echo m68k-atari-mint${UNAME_RELEASE}
-	exit ;;
-    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
-	echo m68k-milan-mint${UNAME_RELEASE}
-	exit ;;
-    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
-	echo m68k-hades-mint${UNAME_RELEASE}
-	exit ;;
-    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
-	echo m68k-unknown-mint${UNAME_RELEASE}
-	exit ;;
-    m68k:machten:*:*)
-	echo m68k-apple-machten${UNAME_RELEASE}
-	exit ;;
-    powerpc:machten:*:*)
-	echo powerpc-apple-machten${UNAME_RELEASE}
-	exit ;;
-    RISC*:Mach:*:*)
-	echo mips-dec-mach_bsd4.3
-	exit ;;
-    RISC*:ULTRIX:*:*)
-	echo mips-dec-ultrix${UNAME_RELEASE}
-	exit ;;
-    VAX*:ULTRIX*:*:*)
-	echo vax-dec-ultrix${UNAME_RELEASE}
-	exit ;;
-    2020:CLIX:*:* | 2430:CLIX:*:*)
-	echo clipper-intergraph-clix${UNAME_RELEASE}
-	exit ;;
-    mips:*:*:UMIPS | mips:*:*:RISCos)
-	eval $set_cc_for_build
-	sed 's/^	//' << EOF >$dummy.c
-#ifdef __cplusplus
-#include <stdio.h>  /* for printf() prototype */
-	int main (int argc, char *argv[]) {
-#else
-	int main (argc, argv) int argc; char *argv[]; {
-#endif
-	#if defined (host_mips) && defined (MIPSEB)
-	#if defined (SYSTYPE_SYSV)
-	  printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0);
-	#endif
-	#if defined (SYSTYPE_SVR4)
-	  printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0);
-	#endif
-	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
-	  printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0);
-	#endif
-	#endif
-	  exit (-1);
-	}
-EOF
-	$CC_FOR_BUILD -o $dummy $dummy.c &&
-	  dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` &&
-	  SYSTEM_NAME=`$dummy $dummyarg` &&
-	    { echo "$SYSTEM_NAME"; exit; }
-	echo mips-mips-riscos${UNAME_RELEASE}
-	exit ;;
-    Motorola:PowerMAX_OS:*:*)
-	echo powerpc-motorola-powermax
-	exit ;;
-    Motorola:*:4.3:PL8-*)
-	echo powerpc-harris-powermax
-	exit ;;
-    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
-	echo powerpc-harris-powermax
-	exit ;;
-    Night_Hawk:Power_UNIX:*:*)
-	echo powerpc-harris-powerunix
-	exit ;;
-    m88k:CX/UX:7*:*)
-	echo m88k-harris-cxux7
-	exit ;;
-    m88k:*:4*:R4*)
-	echo m88k-motorola-sysv4
-	exit ;;
-    m88k:*:3*:R3*)
-	echo m88k-motorola-sysv3
-	exit ;;
-    AViiON:dgux:*:*)
-	# DG/UX returns AViiON for all architectures
-	UNAME_PROCESSOR=`/usr/bin/uname -p`
-	if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]
-	then
-	    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \
-	       [ ${TARGET_BINARY_INTERFACE}x = x ]
-	    then
-		echo m88k-dg-dgux${UNAME_RELEASE}
-	    else
-		echo m88k-dg-dguxbcs${UNAME_RELEASE}
-	    fi
-	else
-	    echo i586-dg-dgux${UNAME_RELEASE}
-	fi
-	exit ;;
-    M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
-	echo m88k-dolphin-sysv3
-	exit ;;
-    M88*:*:R3*:*)
-	# Delta 88k system running SVR3
-	echo m88k-motorola-sysv3
-	exit ;;
-    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
-	echo m88k-tektronix-sysv3
-	exit ;;
-    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
-	echo m68k-tektronix-bsd
-	exit ;;
-    *:IRIX*:*:*)
-	echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`
-	exit ;;
-    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
-	echo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id
-	exit ;;               # Note that: echo "'`uname -s`'" gives 'AIX '
-    i*86:AIX:*:*)
-	echo i386-ibm-aix
-	exit ;;
-    ia64:AIX:*:*)
-	if [ -x /usr/bin/oslevel ] ; then
-		IBM_REV=`/usr/bin/oslevel`
-	else
-		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
-	fi
-	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
-	exit ;;
-    *:AIX:2:3)
-	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
-		eval $set_cc_for_build
-		sed 's/^		//' << EOF >$dummy.c
-		#include <sys/systemcfg.h>
-
-		main()
-			{
-			if (!__power_pc())
-				exit(1);
-			puts("powerpc-ibm-aix3.2.5");
-			exit(0);
-			}
-EOF
-		if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
-		then
-			echo "$SYSTEM_NAME"
-		else
-			echo rs6000-ibm-aix3.2.5
-		fi
-	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
-		echo rs6000-ibm-aix3.2.4
-	else
-		echo rs6000-ibm-aix3.2
-	fi
-	exit ;;
-    *:AIX:*:[4567])
-	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
-	if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then
-		IBM_ARCH=rs6000
-	else
-		IBM_ARCH=powerpc
-	fi
-	if [ -x /usr/bin/lslpp ] ; then
-		IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc |
-			   awk -F: '{ print $3 }' | sed s/[0-9]*$/0/`
-	else
-		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
-	fi
-	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
-	exit ;;
-    *:AIX:*:*)
-	echo rs6000-ibm-aix
-	exit ;;
-    ibmrt:4.4BSD:*|romp-ibm:BSD:*)
-	echo romp-ibm-bsd4.4
-	exit ;;
-    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and
-	echo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to
-	exit ;;                             # report: romp-ibm BSD 4.3
-    *:BOSX:*:*)
-	echo rs6000-bull-bosx
-	exit ;;
-    DPX/2?00:B.O.S.:*:*)
-	echo m68k-bull-sysv3
-	exit ;;
-    9000/[34]??:4.3bsd:1.*:*)
-	echo m68k-hp-bsd
-	exit ;;
-    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)
-	echo m68k-hp-bsd4.4
-	exit ;;
-    9000/[34678]??:HP-UX:*:*)
-	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
-	case "${UNAME_MACHINE}" in
-	    9000/31? )            HP_ARCH=m68000 ;;
-	    9000/[34]?? )         HP_ARCH=m68k ;;
-	    9000/[678][0-9][0-9])
-		if [ -x /usr/bin/getconf ]; then
-		    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
-		    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
-		    case "${sc_cpu_version}" in
-		      523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0
-		      528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1
-		      532)                      # CPU_PA_RISC2_0
-			case "${sc_kernel_bits}" in
-			  32) HP_ARCH=hppa2.0n ;;
-			  64) HP_ARCH=hppa2.0w ;;
-			  '') HP_ARCH=hppa2.0 ;;   # HP-UX 10.20
-			esac ;;
-		    esac
-		fi
-		if [ "${HP_ARCH}" = "" ]; then
-		    eval $set_cc_for_build
-		    sed 's/^		//' << EOF >$dummy.c
-
-		#define _HPUX_SOURCE
-		#include <stdlib.h>
-		#include <unistd.h>
-
-		int main ()
-		{
-		#if defined(_SC_KERNEL_BITS)
-		    long bits = sysconf(_SC_KERNEL_BITS);
-		#endif
-		    long cpu  = sysconf (_SC_CPU_VERSION);
-
-		    switch (cpu)
-			{
-			case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
-			case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
-			case CPU_PA_RISC2_0:
-		#if defined(_SC_KERNEL_BITS)
-			    switch (bits)
-				{
-				case 64: puts ("hppa2.0w"); break;
-				case 32: puts ("hppa2.0n"); break;
-				default: puts ("hppa2.0"); break;
-				} break;
-		#else  /* !defined(_SC_KERNEL_BITS) */
-			    puts ("hppa2.0"); break;
-		#endif
-			default: puts ("hppa1.0"); break;
-			}
-		    exit (0);
-		}
-EOF
-		    (CCOPTS="" $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
-		    test -z "$HP_ARCH" && HP_ARCH=hppa
-		fi ;;
-	esac
-	if [ ${HP_ARCH} = hppa2.0w ]
-	then
-	    eval $set_cc_for_build
-
-	    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
-	    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler
-	    # generating 64-bit code.  GNU and HP use different nomenclature:
-	    #
-	    # $ CC_FOR_BUILD=cc ./config.guess
-	    # => hppa2.0w-hp-hpux11.23
-	    # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
-	    # => hppa64-hp-hpux11.23
-
-	    if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) |
-		grep -q __LP64__
-	    then
-		HP_ARCH=hppa2.0w
-	    else
-		HP_ARCH=hppa64
-	    fi
-	fi
-	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
-	exit ;;
-    ia64:HP-UX:*:*)
-	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
-	echo ia64-hp-hpux${HPUX_REV}
-	exit ;;
-    3050*:HI-UX:*:*)
-	eval $set_cc_for_build
-	sed 's/^	//' << EOF >$dummy.c
-	#include <unistd.h>
-	int
-	main ()
-	{
-	  long cpu = sysconf (_SC_CPU_VERSION);
-	  /* The order matters, because CPU_IS_HP_MC68K erroneously returns
-	     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct
-	     results, however.  */
-	  if (CPU_IS_PA_RISC (cpu))
-	    {
-	      switch (cpu)
-		{
-		  case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
-		  case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
-		  case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
-		  default: puts ("hppa-hitachi-hiuxwe2"); break;
-		}
-	    }
-	  else if (CPU_IS_HP_MC68K (cpu))
-	    puts ("m68k-hitachi-hiuxwe2");
-	  else puts ("unknown-hitachi-hiuxwe2");
-	  exit (0);
-	}
-EOF
-	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
-		{ echo "$SYSTEM_NAME"; exit; }
-	echo unknown-hitachi-hiuxwe2
-	exit ;;
-    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* )
-	echo hppa1.1-hp-bsd
-	exit ;;
-    9000/8??:4.3bsd:*:*)
-	echo hppa1.0-hp-bsd
-	exit ;;
-    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
-	echo hppa1.0-hp-mpeix
-	exit ;;
-    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* )
-	echo hppa1.1-hp-osf
-	exit ;;
-    hp8??:OSF1:*:*)
-	echo hppa1.0-hp-osf
-	exit ;;
-    i*86:OSF1:*:*)
-	if [ -x /usr/sbin/sysversion ] ; then
-	    echo ${UNAME_MACHINE}-unknown-osf1mk
-	else
-	    echo ${UNAME_MACHINE}-unknown-osf1
-	fi
-	exit ;;
-    parisc*:Lites*:*:*)
-	echo hppa1.1-hp-lites
-	exit ;;
-    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
-	echo c1-convex-bsd
-	exit ;;
-    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
-	if getsysinfo -f scalar_acc
-	then echo c32-convex-bsd
-	else echo c2-convex-bsd
-	fi
-	exit ;;
-    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
-	echo c34-convex-bsd
-	exit ;;
-    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
-	echo c38-convex-bsd
-	exit ;;
-    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
-	echo c4-convex-bsd
-	exit ;;
-    CRAY*Y-MP:*:*:*)
-	echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
-	exit ;;
-    CRAY*[A-Z]90:*:*:*)
-	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
-	| sed -e 's/CRAY.*\([A-Z]90\)/\1/' \
-	      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
-	      -e 's/\.[^.]*$/.X/'
-	exit ;;
-    CRAY*TS:*:*:*)
-	echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
-	exit ;;
-    CRAY*T3E:*:*:*)
-	echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
-	exit ;;
-    CRAY*SV1:*:*:*)
-	echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
-	exit ;;
-    *:UNICOS/mp:*:*)
-	echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
-	exit ;;
-    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
-	FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
-	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
-	FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`
-	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
-	exit ;;
-    5000:UNIX_System_V:4.*:*)
-	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
-	FUJITSU_REL=`echo ${UNAME_RELEASE} | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'`
-	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
-	exit ;;
-    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
-	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
-	exit ;;
-    sparc*:BSD/OS:*:*)
-	echo sparc-unknown-bsdi${UNAME_RELEASE}
-	exit ;;
-    *:BSD/OS:*:*)
-	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
-	exit ;;
-    *:FreeBSD:*:*)
-	UNAME_PROCESSOR=`/usr/bin/uname -p`
-	case ${UNAME_PROCESSOR} in
-	    amd64)
-		echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
-	    *)
-		echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
-	esac
-	exit ;;
-    i*:CYGWIN*:*)
-	echo ${UNAME_MACHINE}-pc-cygwin
-	exit ;;
-    *:MINGW64*:*)
-	echo ${UNAME_MACHINE}-pc-mingw64
-	exit ;;
-    *:MINGW*:*)
-	echo ${UNAME_MACHINE}-pc-mingw32
-	exit ;;
-    *:MSYS*:*)
-	echo ${UNAME_MACHINE}-pc-msys
-	exit ;;
-    i*:windows32*:*)
-	# uname -m includes "-pc" on this system.
-	echo ${UNAME_MACHINE}-mingw32
-	exit ;;
-    i*:PW*:*)
-	echo ${UNAME_MACHINE}-pc-pw32
-	exit ;;
-    *:Interix*:*)
-	case ${UNAME_MACHINE} in
-	    x86)
-		echo i586-pc-interix${UNAME_RELEASE}
-		exit ;;
-	    authenticamd | genuineintel | EM64T)
-		echo x86_64-unknown-interix${UNAME_RELEASE}
-		exit ;;
-	    IA64)
-		echo ia64-unknown-interix${UNAME_RELEASE}
-		exit ;;
-	esac ;;
-    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)
-	echo i${UNAME_MACHINE}-pc-mks
-	exit ;;
-    8664:Windows_NT:*)
-	echo x86_64-pc-mks
-	exit ;;
-    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
-	# How do we know it's Interix rather than the generic POSIX subsystem?
-	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
-	# UNAME_MACHINE based on the output of uname instead of i386?
-	echo i586-pc-interix
-	exit ;;
-    i*:UWIN*:*)
-	echo ${UNAME_MACHINE}-pc-uwin
-	exit ;;
-    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
-	echo x86_64-unknown-cygwin
-	exit ;;
-    p*:CYGWIN*:*)
-	echo powerpcle-unknown-cygwin
-	exit ;;
-    prep*:SunOS:5.*:*)
-	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
-	exit ;;
-    *:GNU:*:*)
-	# the GNU system
-	echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`
-	exit ;;
-    *:GNU/*:*:*)
-	# other systems with GNU libc and userland
-	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr "[:upper:]" "[:lower:]"``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC}
-	exit ;;
-    i*86:Minix:*:*)
-	echo ${UNAME_MACHINE}-pc-minix
-	exit ;;
-    aarch64:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    aarch64_be:Linux:*:*)
-	UNAME_MACHINE=aarch64_be
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    alpha:Linux:*:*)
-	case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in
-	  EV5)   UNAME_MACHINE=alphaev5 ;;
-	  EV56)  UNAME_MACHINE=alphaev56 ;;
-	  PCA56) UNAME_MACHINE=alphapca56 ;;
-	  PCA57) UNAME_MACHINE=alphapca56 ;;
-	  EV6)   UNAME_MACHINE=alphaev6 ;;
-	  EV67)  UNAME_MACHINE=alphaev67 ;;
-	  EV68*) UNAME_MACHINE=alphaev68 ;;
-	esac
-	objdump --private-headers /bin/sh | grep -q ld.so.1
-	if test "$?" = 0 ; then LIBC=gnulibc1 ; fi
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    arc:Linux:*:* | arceb:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    arm*:Linux:*:*)
-	eval $set_cc_for_build
-	if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \
-	    | grep -q __ARM_EABI__
-	then
-	    echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	else
-	    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
-		| grep -q __ARM_PCS_VFP
-	    then
-		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi
-	    else
-		echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf
-	    fi
-	fi
-	exit ;;
-    avr32*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    cris:Linux:*:*)
-	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
-	exit ;;
-    crisv32:Linux:*:*)
-	echo ${UNAME_MACHINE}-axis-linux-${LIBC}
-	exit ;;
-    e2k:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    frv:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    hexagon:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    i*86:Linux:*:*)
-	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
-	exit ;;
-    ia64:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    k1om:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    m32r*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    m68*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    mips:Linux:*:* | mips64:Linux:*:*)
-	eval $set_cc_for_build
-	sed 's/^	//' << EOF >$dummy.c
-	#undef CPU
-	#undef ${UNAME_MACHINE}
-	#undef ${UNAME_MACHINE}el
-	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
-	CPU=${UNAME_MACHINE}el
-	#else
-	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
-	CPU=${UNAME_MACHINE}
-	#else
-	CPU=
-	#endif
-	#endif
-EOF
-	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`
-	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; }
-	;;
-    mips64el:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    openrisc*:Linux:*:*)
-	echo or1k-unknown-linux-${LIBC}
-	exit ;;
-    or32:Linux:*:* | or1k*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    padre:Linux:*:*)
-	echo sparc-unknown-linux-${LIBC}
-	exit ;;
-    parisc64:Linux:*:* | hppa64:Linux:*:*)
-	echo hppa64-unknown-linux-${LIBC}
-	exit ;;
-    parisc:Linux:*:* | hppa:Linux:*:*)
-	# Look for CPU level
-	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
-	  PA7*) echo hppa1.1-unknown-linux-${LIBC} ;;
-	  PA8*) echo hppa2.0-unknown-linux-${LIBC} ;;
-	  *)    echo hppa-unknown-linux-${LIBC} ;;
-	esac
-	exit ;;
-    ppc64:Linux:*:*)
-	echo powerpc64-unknown-linux-${LIBC}
-	exit ;;
-    ppc:Linux:*:*)
-	echo powerpc-unknown-linux-${LIBC}
-	exit ;;
-    ppc64le:Linux:*:*)
-	echo powerpc64le-unknown-linux-${LIBC}
-	exit ;;
-    ppcle:Linux:*:*)
-	echo powerpcle-unknown-linux-${LIBC}
-	exit ;;
-    riscv32:Linux:*:* | riscv64:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    s390:Linux:*:* | s390x:Linux:*:*)
-	echo ${UNAME_MACHINE}-ibm-linux-${LIBC}
-	exit ;;
-    sh64*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    sh*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    sparc:Linux:*:* | sparc64:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    tile*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    vax:Linux:*:*)
-	echo ${UNAME_MACHINE}-dec-linux-${LIBC}
-	exit ;;
-    x86_64:Linux:*:*)
-	echo ${UNAME_MACHINE}-pc-linux-${LIBC}
-	exit ;;
-    xtensa*:Linux:*:*)
-	echo ${UNAME_MACHINE}-unknown-linux-${LIBC}
-	exit ;;
-    i*86:DYNIX/ptx:4*:*)
-	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
-	# earlier versions are messed up and put the nodename in both
-	# sysname and nodename.
-	echo i386-sequent-sysv4
-	exit ;;
-    i*86:UNIX_SV:4.2MP:2.*)
-	# Unixware is an offshoot of SVR4, but it has its own version
-	# number series starting with 2...
-	# I am not positive that other SVR4 systems won't match this,
-	# I just have to hope.  -- rms.
-	# Use sysv4.2uw... so that sysv4* matches it.
-	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
-	exit ;;
-    i*86:OS/2:*:*)
-	# If we were able to find `uname', then EMX Unix compatibility
-	# is probably installed.
-	echo ${UNAME_MACHINE}-pc-os2-emx
-	exit ;;
-    i*86:XTS-300:*:STOP)
-	echo ${UNAME_MACHINE}-unknown-stop
-	exit ;;
-    i*86:atheos:*:*)
-	echo ${UNAME_MACHINE}-unknown-atheos
-	exit ;;
-    i*86:syllable:*:*)
-	echo ${UNAME_MACHINE}-pc-syllable
-	exit ;;
-    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)
-	echo i386-unknown-lynxos${UNAME_RELEASE}
-	exit ;;
-    i*86:*DOS:*:*)
-	echo ${UNAME_MACHINE}-pc-msdosdjgpp
-	exit ;;
-    i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)
-	UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'`
-	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
-		echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
-	else
-		echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
-	fi
-	exit ;;
-    i*86:*:5:[678]*)
-	# UnixWare 7.x, OpenUNIX and OpenServer 6.
-	case `/bin/uname -X | grep "^Machine"` in
-	    *486*)	     UNAME_MACHINE=i486 ;;
-	    *Pentium)	     UNAME_MACHINE=i586 ;;
-	    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
-	esac
-	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
-	exit ;;
-    i*86:*:3.2:*)
-	if test -f /usr/options/cb.name; then
-		UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
-		echo ${UNAME_MACHINE}-pc-isc$UNAME_REL
-	elif /bin/uname -X 2>/dev/null >/dev/null ; then
-		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
-		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
-		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
-			&& UNAME_MACHINE=i586
-		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
-			&& UNAME_MACHINE=i686
-		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
-			&& UNAME_MACHINE=i686
-		echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
-	else
-		echo ${UNAME_MACHINE}-pc-sysv32
-	fi
-	exit ;;
-    pc:*:*:*)
-	# Left here for compatibility:
-	# uname -m prints for DJGPP always 'pc', but it prints nothing about
-	# the processor, so we play safe by assuming i586.
-	# Note: whatever this is, it MUST be the same as what config.sub
-	# prints for the "djgpp" host, or else GDB configure will decide that
-	# this is a cross-build.
-	echo i586-pc-msdosdjgpp
-	exit ;;
-    Intel:Mach:3*:*)
-	echo i386-pc-mach3
-	exit ;;
-    paragon:*:*:*)
-	echo i860-intel-osf1
-	exit ;;
-    i860:*:4.*:*) # i860-SVR4
-	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
-	  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
-	else # Add other i860-SVR4 vendors below as they are discovered.
-	  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4
-	fi
-	exit ;;
-    mini*:CTIX:SYS*5:*)
-	# "miniframe"
-	echo m68010-convergent-sysv
-	exit ;;
-    mc68k:UNIX:SYSTEM5:3.51m)
-	echo m68k-convergent-sysv
-	exit ;;
-    M680?0:D-NIX:5.3:*)
-	echo m68k-diab-dnix
-	exit ;;
-    M68*:*:R3V[5678]*:*)
-	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
-    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
-	OS_REL=''
-	test -r /etc/.relid \
-	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
-	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
-	  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
-	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
-	  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
-    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)
-	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
-	  && { echo i486-ncr-sysv4; exit; } ;;
-    NCR*:*:4.2:* | MPRAS*:*:4.2:*)
-	OS_REL='.3'
-	test -r /etc/.relid \
-	    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
-	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
-	    && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
-	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
-	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; }
-	/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \
-	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
-    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
-	echo m68k-unknown-lynxos${UNAME_RELEASE}
-	exit ;;
-    mc68030:UNIX_System_V:4.*:*)
-	echo m68k-atari-sysv4
-	exit ;;
-    TSUNAMI:LynxOS:2.*:*)
-	echo sparc-unknown-lynxos${UNAME_RELEASE}
-	exit ;;
-    rs6000:LynxOS:2.*:*)
-	echo rs6000-unknown-lynxos${UNAME_RELEASE}
-	exit ;;
-    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)
-	echo powerpc-unknown-lynxos${UNAME_RELEASE}
-	exit ;;
-    SM[BE]S:UNIX_SV:*:*)
-	echo mips-dde-sysv${UNAME_RELEASE}
-	exit ;;
-    RM*:ReliantUNIX-*:*:*)
-	echo mips-sni-sysv4
-	exit ;;
-    RM*:SINIX-*:*:*)
-	echo mips-sni-sysv4
-	exit ;;
-    *:SINIX-*:*:*)
-	if uname -p 2>/dev/null >/dev/null ; then
-		UNAME_MACHINE=`(uname -p) 2>/dev/null`
-		echo ${UNAME_MACHINE}-sni-sysv4
-	else
-		echo ns32k-sni-sysv
-	fi
-	exit ;;
-    PENTIUM:*:4.0*:*)	# Unisys `ClearPath HMP IX 4000' SVR4/MP effort
-			# says <Richard.M.Bartel@ccMail.Census.GOV>
-	echo i586-unisys-sysv4
-	exit ;;
-    *:UNIX_System_V:4*:FTX*)
-	# From Gerald Hewes <hewes@openmarket.com>.
-	# How about differentiating between stratus architectures? -djm
-	echo hppa1.1-stratus-sysv4
-	exit ;;
-    *:*:*:FTX*)
-	# From seanf@swdc.stratus.com.
-	echo i860-stratus-sysv4
-	exit ;;
-    i*86:VOS:*:*)
-	# From Paul.Green@stratus.com.
-	echo ${UNAME_MACHINE}-stratus-vos
-	exit ;;
-    *:VOS:*:*)
-	# From Paul.Green@stratus.com.
-	echo hppa1.1-stratus-vos
-	exit ;;
-    mc68*:A/UX:*:*)
-	echo m68k-apple-aux${UNAME_RELEASE}
-	exit ;;
-    news*:NEWS-OS:6*:*)
-	echo mips-sony-newsos6
-	exit ;;
-    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
-	if [ -d /usr/nec ]; then
-		echo mips-nec-sysv${UNAME_RELEASE}
-	else
-		echo mips-unknown-sysv${UNAME_RELEASE}
-	fi
-	exit ;;
-    BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
-	echo powerpc-be-beos
-	exit ;;
-    BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
-	echo powerpc-apple-beos
-	exit ;;
-    BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
-	echo i586-pc-beos
-	exit ;;
-    BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
-	echo i586-pc-haiku
-	exit ;;
-    x86_64:Haiku:*:*)
-	echo x86_64-unknown-haiku
-	exit ;;
-    SX-4:SUPER-UX:*:*)
-	echo sx4-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-5:SUPER-UX:*:*)
-	echo sx5-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-6:SUPER-UX:*:*)
-	echo sx6-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-7:SUPER-UX:*:*)
-	echo sx7-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-8:SUPER-UX:*:*)
-	echo sx8-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-8R:SUPER-UX:*:*)
-	echo sx8r-nec-superux${UNAME_RELEASE}
-	exit ;;
-    SX-ACE:SUPER-UX:*:*)
-	echo sxace-nec-superux${UNAME_RELEASE}
-	exit ;;
-    Power*:Rhapsody:*:*)
-	echo powerpc-apple-rhapsody${UNAME_RELEASE}
-	exit ;;
-    *:Rhapsody:*:*)
-	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
-	exit ;;
-    *:Darwin:*:*)
-	UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown
-	eval $set_cc_for_build
-	if test "$UNAME_PROCESSOR" = unknown ; then
-	    UNAME_PROCESSOR=powerpc
-	fi
-	if test `echo "$UNAME_RELEASE" | sed -e 's/\..*//'` -le 10 ; then
-	    if [ "$CC_FOR_BUILD" != no_compiler_found ]; then
-		if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \
-		    (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
-		    grep IS_64BIT_ARCH >/dev/null
-		then
-		    case $UNAME_PROCESSOR in
-			i386) UNAME_PROCESSOR=x86_64 ;;
-			powerpc) UNAME_PROCESSOR=powerpc64 ;;
-		    esac
-		fi
-	    fi
-	elif test "$UNAME_PROCESSOR" = i386 ; then
-	    # Avoid executing cc on OS X 10.9, as it ships with a stub
-	    # that puts up a graphical alert prompting to install
-	    # developer tools.  Any system running Mac OS X 10.7 or
-	    # later (Darwin 11 and later) is required to have a 64-bit
-	    # processor. This is not true of the ARM version of Darwin
-	    # that Apple uses in portable devices.
-	    UNAME_PROCESSOR=x86_64
-	fi
-	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
-	exit ;;
-    *:procnto*:*:* | *:QNX:[0123456789]*:*)
-	UNAME_PROCESSOR=`uname -p`
-	if test "$UNAME_PROCESSOR" = x86; then
-		UNAME_PROCESSOR=i386
-		UNAME_MACHINE=pc
-	fi
-	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
-	exit ;;
-    *:QNX:*:4*)
-	echo i386-pc-qnx
-	exit ;;
-    NEO-?:NONSTOP_KERNEL:*:*)
-	echo neo-tandem-nsk${UNAME_RELEASE}
-	exit ;;
-    NSE-*:NONSTOP_KERNEL:*:*)
-	echo nse-tandem-nsk${UNAME_RELEASE}
-	exit ;;
-    NSR-?:NONSTOP_KERNEL:*:*)
-	echo nsr-tandem-nsk${UNAME_RELEASE}
-	exit ;;
-    *:NonStop-UX:*:*)
-	echo mips-compaq-nonstopux
-	exit ;;
-    BS2000:POSIX*:*:*)
-	echo bs2000-siemens-sysv
-	exit ;;
-    DS/*:UNIX_System_V:*:*)
-	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
-	exit ;;
-    *:Plan9:*:*)
-	# "uname -m" is not consistent, so use $cputype instead. 386
-	# is converted to i386 for consistency with other x86
-	# operating systems.
-	if test "$cputype" = 386; then
-	    UNAME_MACHINE=i386
-	else
-	    UNAME_MACHINE="$cputype"
-	fi
-	echo ${UNAME_MACHINE}-unknown-plan9
-	exit ;;
-    *:TOPS-10:*:*)
-	echo pdp10-unknown-tops10
-	exit ;;
-    *:TENEX:*:*)
-	echo pdp10-unknown-tenex
-	exit ;;
-    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
-	echo pdp10-dec-tops20
-	exit ;;
-    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
-	echo pdp10-xkl-tops20
-	exit ;;
-    *:TOPS-20:*:*)
-	echo pdp10-unknown-tops20
-	exit ;;
-    *:ITS:*:*)
-	echo pdp10-unknown-its
-	exit ;;
-    SEI:*:*:SEIUX)
-	echo mips-sei-seiux${UNAME_RELEASE}
-	exit ;;
-    *:DragonFly:*:*)
-	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`
-	exit ;;
-    *:*VMS:*:*)
-	UNAME_MACHINE=`(uname -p) 2>/dev/null`
-	case "${UNAME_MACHINE}" in
-	    A*) echo alpha-dec-vms ; exit ;;
-	    I*) echo ia64-dec-vms ; exit ;;
-	    V*) echo vax-dec-vms ; exit ;;
-	esac ;;
-    *:XENIX:*:SysV)
-	echo i386-pc-xenix
-	exit ;;
-    i*86:skyos:*:*)
-	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE} | sed -e 's/ .*$//'`
-	exit ;;
-    i*86:rdos:*:*)
-	echo ${UNAME_MACHINE}-pc-rdos
-	exit ;;
-    i*86:AROS:*:*)
-	echo ${UNAME_MACHINE}-pc-aros
-	exit ;;
-    x86_64:VMkernel:*:*)
-	echo ${UNAME_MACHINE}-unknown-esx
-	exit ;;
-    amd64:Isilon\ OneFS:*:*)
-	echo x86_64-unknown-onefs
-	exit ;;
-esac
-
-cat >&2 <<EOF
-$0: unable to guess system type
-
-This script (version $timestamp), has failed to recognize the
-operating system you are using. If your script is old, overwrite
-config.guess and config.sub with the latest versions from:
-
-  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
-and
-  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
-
-If $0 has already been updated, send the following data and any
-information you think might be pertinent to config-patches@gnu.org to
-provide the necessary information to handle your system.
-
-config.guess timestamp = $timestamp
-
-uname -m = `(uname -m) 2>/dev/null || echo unknown`
-uname -r = `(uname -r) 2>/dev/null || echo unknown`
-uname -s = `(uname -s) 2>/dev/null || echo unknown`
-uname -v = `(uname -v) 2>/dev/null || echo unknown`
-
-/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
-/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`
-
-hostinfo               = `(hostinfo) 2>/dev/null`
-/bin/universe          = `(/bin/universe) 2>/dev/null`
-/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`
-/bin/arch              = `(/bin/arch) 2>/dev/null`
-/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`
-/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
-
-UNAME_MACHINE = ${UNAME_MACHINE}
-UNAME_RELEASE = ${UNAME_RELEASE}
-UNAME_SYSTEM  = ${UNAME_SYSTEM}
-UNAME_VERSION = ${UNAME_VERSION}
-EOF
-
-exit 1
-
-# Local variables:
-# eval: (add-hook 'write-file-hooks 'time-stamp)
-# time-stamp-start: "timestamp='"
-# time-stamp-format: "%:y-%02m-%02d"
-# time-stamp-end: "'"
-# End:
diff --git a/redis-stable/deps/jemalloc/build-aux/config.sub b/redis-stable/deps/jemalloc/build-aux/config.sub
deleted file mode 100755
index dd2ca93c..00000000
--- a/redis-stable/deps/jemalloc/build-aux/config.sub
+++ /dev/null
@@ -1,1825 +0,0 @@
-#! /bin/sh
-# Configuration validation subroutine script.
-#   Copyright 1992-2016 Free Software Foundation, Inc.
-
-timestamp='2016-11-04'
-
-# This file 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; either version 3 of the License, or
-# (at your option) any later version.
-#
-# 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, see <http://www.gnu.org/licenses/>.
-#
-# As a special exception to the GNU General Public License, if you
-# distribute this file as part of a program that contains a
-# configuration script generated by Autoconf, you may include it under
-# the same distribution terms that you use for the rest of that
-# program.  This Exception is an additional permission under section 7
-# of the GNU General Public License, version 3 ("GPLv3").
-
-
-# Please send patches to <config-patches@gnu.org>.
-#
-# Configuration subroutine to validate and canonicalize a configuration type.
-# Supply the specified configuration type as an argument.
-# If it is invalid, we print an error message on stderr and exit with code 1.
-# Otherwise, we print the canonical config type on stdout and succeed.
-
-# You can get the latest version of this script from:
-# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
-
-# This file is supposed to be the same for all GNU packages
-# and recognize all the CPU types, system types and aliases
-# that are meaningful with *any* GNU software.
-# Each package is responsible for reporting which valid configurations
-# it does not support.  The user should be able to distinguish
-# a failure to support a valid configuration from a meaningless
-# configuration.
-
-# The goal of this file is to map all the various variations of a given
-# machine specification into a single specification in the form:
-#	CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
-# or in some cases, the newer four-part form:
-#	CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
-# It is wrong to echo any other type of specification.
-
-me=`echo "$0" | sed -e 's,.*/,,'`
-
-usage="\
-Usage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS
-
-Canonicalize a configuration name.
-
-Operation modes:
-  -h, --help         print this help, then exit
-  -t, --time-stamp   print date of last modification, then exit
-  -v, --version      print version number, then exit
-
-Report bugs and patches to <config-patches@gnu.org>."
-
-version="\
-GNU config.sub ($timestamp)
-
-Copyright 1992-2016 Free Software Foundation, Inc.
-
-This is free software; see the source for copying conditions.  There is NO
-warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
-
-help="
-Try \`$me --help' for more information."
-
-# Parse command line
-while test $# -gt 0 ; do
-  case $1 in
-    --time-stamp | --time* | -t )
-       echo "$timestamp" ; exit ;;
-    --version | -v )
-       echo "$version" ; exit ;;
-    --help | --h* | -h )
-       echo "$usage"; exit ;;
-    -- )     # Stop option processing
-       shift; break ;;
-    - )	# Use stdin as input.
-       break ;;
-    -* )
-       echo "$me: invalid option $1$help"
-       exit 1 ;;
-
-    *local*)
-       # First pass through any local machine types.
-       echo $1
-       exit ;;
-
-    * )
-       break ;;
-  esac
-done
-
-case $# in
- 0) echo "$me: missing argument$help" >&2
-    exit 1;;
- 1) ;;
- *) echo "$me: too many arguments$help" >&2
-    exit 1;;
-esac
-
-# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).
-# Here we must recognize all the valid KERNEL-OS combinations.
-maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'`
-case $maybe_os in
-  nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \
-  linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
-  knetbsd*-gnu* | netbsd*-gnu* | netbsd*-eabi* | \
-  kopensolaris*-gnu* | cloudabi*-eabi* | \
-  storm-chaos* | os2-emx* | rtmk-nova*)
-    os=-$maybe_os
-    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`
-    ;;
-  android-linux)
-    os=-linux-android
-    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown
-    ;;
-  *)
-    basic_machine=`echo $1 | sed 's/-[^-]*$//'`
-    if [ $basic_machine != $1 ]
-    then os=`echo $1 | sed 's/.*-/-/'`
-    else os=; fi
-    ;;
-esac
-
-### Let's recognize common machines as not being operating systems so
-### that things like config.sub decstation-3100 work.  We also
-### recognize some manufacturers as not being operating systems, so we
-### can provide default operating systems below.
-case $os in
-	-sun*os*)
-		# Prevent following clause from handling this invalid input.
-		;;
-	-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \
-	-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \
-	-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \
-	-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\
-	-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \
-	-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \
-	-apple | -axis | -knuth | -cray | -microblaze*)
-		os=
-		basic_machine=$1
-		;;
-	-bluegene*)
-		os=-cnk
-		;;
-	-sim | -cisco | -oki | -wec | -winbond)
-		os=
-		basic_machine=$1
-		;;
-	-scout)
-		;;
-	-wrs)
-		os=-vxworks
-		basic_machine=$1
-		;;
-	-chorusos*)
-		os=-chorusos
-		basic_machine=$1
-		;;
-	-chorusrdb)
-		os=-chorusrdb
-		basic_machine=$1
-		;;
-	-hiux*)
-		os=-hiuxwe2
-		;;
-	-sco6)
-		os=-sco5v6
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco5)
-		os=-sco3.2v5
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco4)
-		os=-sco3.2v4
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco3.2.[4-9]*)
-		os=`echo $os | sed -e 's/sco3.2./sco3.2v/'`
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco3.2v[4-9]*)
-		# Don't forget version if it is 3.2v4 or newer.
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco5v6*)
-		# Don't forget version if it is 3.2v4 or newer.
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-sco*)
-		os=-sco3.2v2
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-udk*)
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-isc)
-		os=-isc2.2
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-clix*)
-		basic_machine=clipper-intergraph
-		;;
-	-isc*)
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
-		;;
-	-lynx*178)
-		os=-lynxos178
-		;;
-	-lynx*5)
-		os=-lynxos5
-		;;
-	-lynx*)
-		os=-lynxos
-		;;
-	-ptx*)
-		basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`
-		;;
-	-windowsnt*)
-		os=`echo $os | sed -e 's/windowsnt/winnt/'`
-		;;
-	-psos*)
-		os=-psos
-		;;
-	-mint | -mint[0-9]*)
-		basic_machine=m68k-atari
-		os=-mint
-		;;
-esac
-
-# Decode aliases for certain CPU-COMPANY combinations.
-case $basic_machine in
-	# Recognize the basic CPU types without company name.
-	# Some are omitted here because they have special meanings below.
-	1750a | 580 \
-	| a29k \
-	| aarch64 | aarch64_be \
-	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
-	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
-	| am33_2.0 \
-	| arc | arceb \
-	| arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \
-	| avr | avr32 \
-	| ba \
-	| be32 | be64 \
-	| bfin \
-	| c4x | c8051 | clipper \
-	| d10v | d30v | dlx | dsp16xx \
-	| e2k | epiphany \
-	| fido | fr30 | frv | ft32 \
-	| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
-	| hexagon \
-	| i370 | i860 | i960 | ia64 \
-	| ip2k | iq2000 \
-	| k1om \
-	| le32 | le64 \
-	| lm32 \
-	| m32c | m32r | m32rle | m68000 | m68k | m88k \
-	| maxq | mb | microblaze | microblazeel | mcore | mep | metag \
-	| mips | mipsbe | mipseb | mipsel | mipsle \
-	| mips16 \
-	| mips64 | mips64el \
-	| mips64octeon | mips64octeonel \
-	| mips64orion | mips64orionel \
-	| mips64r5900 | mips64r5900el \
-	| mips64vr | mips64vrel \
-	| mips64vr4100 | mips64vr4100el \
-	| mips64vr4300 | mips64vr4300el \
-	| mips64vr5000 | mips64vr5000el \
-	| mips64vr5900 | mips64vr5900el \
-	| mipsisa32 | mipsisa32el \
-	| mipsisa32r2 | mipsisa32r2el \
-	| mipsisa32r6 | mipsisa32r6el \
-	| mipsisa64 | mipsisa64el \
-	| mipsisa64r2 | mipsisa64r2el \
-	| mipsisa64r6 | mipsisa64r6el \
-	| mipsisa64sb1 | mipsisa64sb1el \
-	| mipsisa64sr71k | mipsisa64sr71kel \
-	| mipsr5900 | mipsr5900el \
-	| mipstx39 | mipstx39el \
-	| mn10200 | mn10300 \
-	| moxie \
-	| mt \
-	| msp430 \
-	| nds32 | nds32le | nds32be \
-	| nios | nios2 | nios2eb | nios2el \
-	| ns16k | ns32k \
-	| open8 | or1k | or1knd | or32 \
-	| pdp10 | pdp11 | pj | pjl \
-	| powerpc | powerpc64 | powerpc64le | powerpcle \
-	| pru \
-	| pyramid \
-	| riscv32 | riscv64 \
-	| rl78 | rx \
-	| score \
-	| sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[234]eb | sheb | shbe | shle | sh[1234]le | sh3ele \
-	| sh64 | sh64le \
-	| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \
-	| sparcv8 | sparcv9 | sparcv9b | sparcv9v \
-	| spu \
-	| tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \
-	| ubicom32 \
-	| v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \
-	| visium \
-	| we32k \
-	| x86 | xc16x | xstormy16 | xtensa \
-	| z8k | z80)
-		basic_machine=$basic_machine-unknown
-		;;
-	c54x)
-		basic_machine=tic54x-unknown
-		;;
-	c55x)
-		basic_machine=tic55x-unknown
-		;;
-	c6x)
-		basic_machine=tic6x-unknown
-		;;
-	leon|leon[3-9])
-		basic_machine=sparc-$basic_machine
-		;;
-	m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip)
-		basic_machine=$basic_machine-unknown
-		os=-none
-		;;
-	m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)
-		;;
-	ms1)
-		basic_machine=mt-unknown
-		;;
-
-	strongarm | thumb | xscale)
-		basic_machine=arm-unknown
-		;;
-	xgate)
-		basic_machine=$basic_machine-unknown
-		os=-none
-		;;
-	xscaleeb)
-		basic_machine=armeb-unknown
-		;;
-
-	xscaleel)
-		basic_machine=armel-unknown
-		;;
-
-	# We use `pc' rather than `unknown'
-	# because (1) that's what they normally are, and
-	# (2) the word "unknown" tends to confuse beginning users.
-	i*86 | x86_64)
-	  basic_machine=$basic_machine-pc
-	  ;;
-	# Object if more than one company name word.
-	*-*-*)
-		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
-		exit 1
-		;;
-	# Recognize the basic CPU types with company name.
-	580-* \
-	| a29k-* \
-	| aarch64-* | aarch64_be-* \
-	| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \
-	| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \
-	| alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \
-	| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \
-	| avr-* | avr32-* \
-	| ba-* \
-	| be32-* | be64-* \
-	| bfin-* | bs2000-* \
-	| c[123]* | c30-* | [cjt]90-* | c4x-* \
-	| c8051-* | clipper-* | craynv-* | cydra-* \
-	| d10v-* | d30v-* | dlx-* \
-	| e2k-* | elxsi-* \
-	| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \
-	| h8300-* | h8500-* \
-	| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \
-	| hexagon-* \
-	| i*86-* | i860-* | i960-* | ia64-* \
-	| ip2k-* | iq2000-* \
-	| k1om-* \
-	| le32-* | le64-* \
-	| lm32-* \
-	| m32c-* | m32r-* | m32rle-* \
-	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
-	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* \
-	| microblaze-* | microblazeel-* \
-	| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \
-	| mips16-* \
-	| mips64-* | mips64el-* \
-	| mips64octeon-* | mips64octeonel-* \
-	| mips64orion-* | mips64orionel-* \
-	| mips64r5900-* | mips64r5900el-* \
-	| mips64vr-* | mips64vrel-* \
-	| mips64vr4100-* | mips64vr4100el-* \
-	| mips64vr4300-* | mips64vr4300el-* \
-	| mips64vr5000-* | mips64vr5000el-* \
-	| mips64vr5900-* | mips64vr5900el-* \
-	| mipsisa32-* | mipsisa32el-* \
-	| mipsisa32r2-* | mipsisa32r2el-* \
-	| mipsisa32r6-* | mipsisa32r6el-* \
-	| mipsisa64-* | mipsisa64el-* \
-	| mipsisa64r2-* | mipsisa64r2el-* \
-	| mipsisa64r6-* | mipsisa64r6el-* \
-	| mipsisa64sb1-* | mipsisa64sb1el-* \
-	| mipsisa64sr71k-* | mipsisa64sr71kel-* \
-	| mipsr5900-* | mipsr5900el-* \
-	| mipstx39-* | mipstx39el-* \
-	| mmix-* \
-	| mt-* \
-	| msp430-* \
-	| nds32-* | nds32le-* | nds32be-* \
-	| nios-* | nios2-* | nios2eb-* | nios2el-* \
-	| none-* | np1-* | ns16k-* | ns32k-* \
-	| open8-* \
-	| or1k*-* \
-	| orion-* \
-	| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \
-	| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \
-	| pru-* \
-	| pyramid-* \
-	| riscv32-* | riscv64-* \
-	| rl78-* | romp-* | rs6000-* | rx-* \
-	| sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \
-	| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \
-	| sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \
-	| sparclite-* \
-	| sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx*-* \
-	| tahoe-* \
-	| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \
-	| tile*-* \
-	| tron-* \
-	| ubicom32-* \
-	| v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \
-	| vax-* \
-	| visium-* \
-	| we32k-* \
-	| x86-* | x86_64-* | xc16x-* | xps100-* \
-	| xstormy16-* | xtensa*-* \
-	| ymp-* \
-	| z8k-* | z80-*)
-		;;
-	# Recognize the basic CPU types without company name, with glob match.
-	xtensa*)
-		basic_machine=$basic_machine-unknown
-		;;
-	# Recognize the various machine names and aliases which stand
-	# for a CPU type and a company and sometimes even an OS.
-	386bsd)
-		basic_machine=i386-unknown
-		os=-bsd
-		;;
-	3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)
-		basic_machine=m68000-att
-		;;
-	3b*)
-		basic_machine=we32k-att
-		;;
-	a29khif)
-		basic_machine=a29k-amd
-		os=-udi
-		;;
-	abacus)
-		basic_machine=abacus-unknown
-		;;
-	adobe68k)
-		basic_machine=m68010-adobe
-		os=-scout
-		;;
-	alliant | fx80)
-		basic_machine=fx80-alliant
-		;;
-	altos | altos3068)
-		basic_machine=m68k-altos
-		;;
-	am29k)
-		basic_machine=a29k-none
-		os=-bsd
-		;;
-	amd64)
-		basic_machine=x86_64-pc
-		;;
-	amd64-*)
-		basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	amdahl)
-		basic_machine=580-amdahl
-		os=-sysv
-		;;
-	amiga | amiga-*)
-		basic_machine=m68k-unknown
-		;;
-	amigaos | amigados)
-		basic_machine=m68k-unknown
-		os=-amigaos
-		;;
-	amigaunix | amix)
-		basic_machine=m68k-unknown
-		os=-sysv4
-		;;
-	apollo68)
-		basic_machine=m68k-apollo
-		os=-sysv
-		;;
-	apollo68bsd)
-		basic_machine=m68k-apollo
-		os=-bsd
-		;;
-	aros)
-		basic_machine=i386-pc
-		os=-aros
-		;;
-	asmjs)
-		basic_machine=asmjs-unknown
-		;;
-	aux)
-		basic_machine=m68k-apple
-		os=-aux
-		;;
-	balance)
-		basic_machine=ns32k-sequent
-		os=-dynix
-		;;
-	blackfin)
-		basic_machine=bfin-unknown
-		os=-linux
-		;;
-	blackfin-*)
-		basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'`
-		os=-linux
-		;;
-	bluegene*)
-		basic_machine=powerpc-ibm
-		os=-cnk
-		;;
-	c54x-*)
-		basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	c55x-*)
-		basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	c6x-*)
-		basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	c90)
-		basic_machine=c90-cray
-		os=-unicos
-		;;
-	cegcc)
-		basic_machine=arm-unknown
-		os=-cegcc
-		;;
-	convex-c1)
-		basic_machine=c1-convex
-		os=-bsd
-		;;
-	convex-c2)
-		basic_machine=c2-convex
-		os=-bsd
-		;;
-	convex-c32)
-		basic_machine=c32-convex
-		os=-bsd
-		;;
-	convex-c34)
-		basic_machine=c34-convex
-		os=-bsd
-		;;
-	convex-c38)
-		basic_machine=c38-convex
-		os=-bsd
-		;;
-	cray | j90)
-		basic_machine=j90-cray
-		os=-unicos
-		;;
-	craynv)
-		basic_machine=craynv-cray
-		os=-unicosmp
-		;;
-	cr16 | cr16-*)
-		basic_machine=cr16-unknown
-		os=-elf
-		;;
-	crds | unos)
-		basic_machine=m68k-crds
-		;;
-	crisv32 | crisv32-* | etraxfs*)
-		basic_machine=crisv32-axis
-		;;
-	cris | cris-* | etrax*)
-		basic_machine=cris-axis
-		;;
-	crx)
-		basic_machine=crx-unknown
-		os=-elf
-		;;
-	da30 | da30-*)
-		basic_machine=m68k-da30
-		;;
-	decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)
-		basic_machine=mips-dec
-		;;
-	decsystem10* | dec10*)
-		basic_machine=pdp10-dec
-		os=-tops10
-		;;
-	decsystem20* | dec20*)
-		basic_machine=pdp10-dec
-		os=-tops20
-		;;
-	delta | 3300 | motorola-3300 | motorola-delta \
-	      | 3300-motorola | delta-motorola)
-		basic_machine=m68k-motorola
-		;;
-	delta88)
-		basic_machine=m88k-motorola
-		os=-sysv3
-		;;
-	dicos)
-		basic_machine=i686-pc
-		os=-dicos
-		;;
-	djgpp)
-		basic_machine=i586-pc
-		os=-msdosdjgpp
-		;;
-	dpx20 | dpx20-*)
-		basic_machine=rs6000-bull
-		os=-bosx
-		;;
-	dpx2* | dpx2*-bull)
-		basic_machine=m68k-bull
-		os=-sysv3
-		;;
-	e500v[12])
-		basic_machine=powerpc-unknown
-		os=$os"spe"
-		;;
-	e500v[12]-*)
-		basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
-		os=$os"spe"
-		;;
-	ebmon29k)
-		basic_machine=a29k-amd
-		os=-ebmon
-		;;
-	elxsi)
-		basic_machine=elxsi-elxsi
-		os=-bsd
-		;;
-	encore | umax | mmax)
-		basic_machine=ns32k-encore
-		;;
-	es1800 | OSE68k | ose68k | ose | OSE)
-		basic_machine=m68k-ericsson
-		os=-ose
-		;;
-	fx2800)
-		basic_machine=i860-alliant
-		;;
-	genix)
-		basic_machine=ns32k-ns
-		;;
-	gmicro)
-		basic_machine=tron-gmicro
-		os=-sysv
-		;;
-	go32)
-		basic_machine=i386-pc
-		os=-go32
-		;;
-	h3050r* | hiux*)
-		basic_machine=hppa1.1-hitachi
-		os=-hiuxwe2
-		;;
-	h8300hms)
-		basic_machine=h8300-hitachi
-		os=-hms
-		;;
-	h8300xray)
-		basic_machine=h8300-hitachi
-		os=-xray
-		;;
-	h8500hms)
-		basic_machine=h8500-hitachi
-		os=-hms
-		;;
-	harris)
-		basic_machine=m88k-harris
-		os=-sysv3
-		;;
-	hp300-*)
-		basic_machine=m68k-hp
-		;;
-	hp300bsd)
-		basic_machine=m68k-hp
-		os=-bsd
-		;;
-	hp300hpux)
-		basic_machine=m68k-hp
-		os=-hpux
-		;;
-	hp3k9[0-9][0-9] | hp9[0-9][0-9])
-		basic_machine=hppa1.0-hp
-		;;
-	hp9k2[0-9][0-9] | hp9k31[0-9])
-		basic_machine=m68000-hp
-		;;
-	hp9k3[2-9][0-9])
-		basic_machine=m68k-hp
-		;;
-	hp9k6[0-9][0-9] | hp6[0-9][0-9])
-		basic_machine=hppa1.0-hp
-		;;
-	hp9k7[0-79][0-9] | hp7[0-79][0-9])
-		basic_machine=hppa1.1-hp
-		;;
-	hp9k78[0-9] | hp78[0-9])
-		# FIXME: really hppa2.0-hp
-		basic_machine=hppa1.1-hp
-		;;
-	hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)
-		# FIXME: really hppa2.0-hp
-		basic_machine=hppa1.1-hp
-		;;
-	hp9k8[0-9][13679] | hp8[0-9][13679])
-		basic_machine=hppa1.1-hp
-		;;
-	hp9k8[0-9][0-9] | hp8[0-9][0-9])
-		basic_machine=hppa1.0-hp
-		;;
-	hppa-next)
-		os=-nextstep3
-		;;
-	hppaosf)
-		basic_machine=hppa1.1-hp
-		os=-osf
-		;;
-	hppro)
-		basic_machine=hppa1.1-hp
-		os=-proelf
-		;;
-	i370-ibm* | ibm*)
-		basic_machine=i370-ibm
-		;;
-	i*86v32)
-		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
-		os=-sysv32
-		;;
-	i*86v4*)
-		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
-		os=-sysv4
-		;;
-	i*86v)
-		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
-		os=-sysv
-		;;
-	i*86sol2)
-		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
-		os=-solaris2
-		;;
-	i386mach)
-		basic_machine=i386-mach
-		os=-mach
-		;;
-	i386-vsta | vsta)
-		basic_machine=i386-unknown
-		os=-vsta
-		;;
-	iris | iris4d)
-		basic_machine=mips-sgi
-		case $os in
-		    -irix*)
-			;;
-		    *)
-			os=-irix4
-			;;
-		esac
-		;;
-	isi68 | isi)
-		basic_machine=m68k-isi
-		os=-sysv
-		;;
-	leon-*|leon[3-9]-*)
-		basic_machine=sparc-`echo $basic_machine | sed 's/-.*//'`
-		;;
-	m68knommu)
-		basic_machine=m68k-unknown
-		os=-linux
-		;;
-	m68knommu-*)
-		basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`
-		os=-linux
-		;;
-	m88k-omron*)
-		basic_machine=m88k-omron
-		;;
-	magnum | m3230)
-		basic_machine=mips-mips
-		os=-sysv
-		;;
-	merlin)
-		basic_machine=ns32k-utek
-		os=-sysv
-		;;
-	microblaze*)
-		basic_machine=microblaze-xilinx
-		;;
-	mingw64)
-		basic_machine=x86_64-pc
-		os=-mingw64
-		;;
-	mingw32)
-		basic_machine=i686-pc
-		os=-mingw32
-		;;
-	mingw32ce)
-		basic_machine=arm-unknown
-		os=-mingw32ce
-		;;
-	miniframe)
-		basic_machine=m68000-convergent
-		;;
-	*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)
-		basic_machine=m68k-atari
-		os=-mint
-		;;
-	mips3*-*)
-		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`
-		;;
-	mips3*)
-		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown
-		;;
-	monitor)
-		basic_machine=m68k-rom68k
-		os=-coff
-		;;
-	morphos)
-		basic_machine=powerpc-unknown
-		os=-morphos
-		;;
-	moxiebox)
-		basic_machine=moxie-unknown
-		os=-moxiebox
-		;;
-	msdos)
-		basic_machine=i386-pc
-		os=-msdos
-		;;
-	ms1-*)
-		basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`
-		;;
-	msys)
-		basic_machine=i686-pc
-		os=-msys
-		;;
-	mvs)
-		basic_machine=i370-ibm
-		os=-mvs
-		;;
-	nacl)
-		basic_machine=le32-unknown
-		os=-nacl
-		;;
-	ncr3000)
-		basic_machine=i486-ncr
-		os=-sysv4
-		;;
-	netbsd386)
-		basic_machine=i386-unknown
-		os=-netbsd
-		;;
-	netwinder)
-		basic_machine=armv4l-rebel
-		os=-linux
-		;;
-	news | news700 | news800 | news900)
-		basic_machine=m68k-sony
-		os=-newsos
-		;;
-	news1000)
-		basic_machine=m68030-sony
-		os=-newsos
-		;;
-	news-3600 | risc-news)
-		basic_machine=mips-sony
-		os=-newsos
-		;;
-	necv70)
-		basic_machine=v70-nec
-		os=-sysv
-		;;
-	next | m*-next )
-		basic_machine=m68k-next
-		case $os in
-		    -nextstep* )
-			;;
-		    -ns2*)
-		      os=-nextstep2
-			;;
-		    *)
-		      os=-nextstep3
-			;;
-		esac
-		;;
-	nh3000)
-		basic_machine=m68k-harris
-		os=-cxux
-		;;
-	nh[45]000)
-		basic_machine=m88k-harris
-		os=-cxux
-		;;
-	nindy960)
-		basic_machine=i960-intel
-		os=-nindy
-		;;
-	mon960)
-		basic_machine=i960-intel
-		os=-mon960
-		;;
-	nonstopux)
-		basic_machine=mips-compaq
-		os=-nonstopux
-		;;
-	np1)
-		basic_machine=np1-gould
-		;;
-	neo-tandem)
-		basic_machine=neo-tandem
-		;;
-	nse-tandem)
-		basic_machine=nse-tandem
-		;;
-	nsr-tandem)
-		basic_machine=nsr-tandem
-		;;
-	op50n-* | op60c-*)
-		basic_machine=hppa1.1-oki
-		os=-proelf
-		;;
-	openrisc | openrisc-*)
-		basic_machine=or32-unknown
-		;;
-	os400)
-		basic_machine=powerpc-ibm
-		os=-os400
-		;;
-	OSE68000 | ose68000)
-		basic_machine=m68000-ericsson
-		os=-ose
-		;;
-	os68k)
-		basic_machine=m68k-none
-		os=-os68k
-		;;
-	pa-hitachi)
-		basic_machine=hppa1.1-hitachi
-		os=-hiuxwe2
-		;;
-	paragon)
-		basic_machine=i860-intel
-		os=-osf
-		;;
-	parisc)
-		basic_machine=hppa-unknown
-		os=-linux
-		;;
-	parisc-*)
-		basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'`
-		os=-linux
-		;;
-	pbd)
-		basic_machine=sparc-tti
-		;;
-	pbb)
-		basic_machine=m68k-tti
-		;;
-	pc532 | pc532-*)
-		basic_machine=ns32k-pc532
-		;;
-	pc98)
-		basic_machine=i386-pc
-		;;
-	pc98-*)
-		basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	pentium | p5 | k5 | k6 | nexgen | viac3)
-		basic_machine=i586-pc
-		;;
-	pentiumpro | p6 | 6x86 | athlon | athlon_*)
-		basic_machine=i686-pc
-		;;
-	pentiumii | pentium2 | pentiumiii | pentium3)
-		basic_machine=i686-pc
-		;;
-	pentium4)
-		basic_machine=i786-pc
-		;;
-	pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)
-		basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	pentiumpro-* | p6-* | 6x86-* | athlon-*)
-		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)
-		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	pentium4-*)
-		basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	pn)
-		basic_machine=pn-gould
-		;;
-	power)	basic_machine=power-ibm
-		;;
-	ppc | ppcbe)	basic_machine=powerpc-unknown
-		;;
-	ppc-* | ppcbe-*)
-		basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	ppcle | powerpclittle)
-		basic_machine=powerpcle-unknown
-		;;
-	ppcle-* | powerpclittle-*)
-		basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	ppc64)	basic_machine=powerpc64-unknown
-		;;
-	ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	ppc64le | powerpc64little)
-		basic_machine=powerpc64le-unknown
-		;;
-	ppc64le-* | powerpc64little-*)
-		basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	ps2)
-		basic_machine=i386-ibm
-		;;
-	pw32)
-		basic_machine=i586-unknown
-		os=-pw32
-		;;
-	rdos | rdos64)
-		basic_machine=x86_64-pc
-		os=-rdos
-		;;
-	rdos32)
-		basic_machine=i386-pc
-		os=-rdos
-		;;
-	rom68k)
-		basic_machine=m68k-rom68k
-		os=-coff
-		;;
-	rm[46]00)
-		basic_machine=mips-siemens
-		;;
-	rtpc | rtpc-*)
-		basic_machine=romp-ibm
-		;;
-	s390 | s390-*)
-		basic_machine=s390-ibm
-		;;
-	s390x | s390x-*)
-		basic_machine=s390x-ibm
-		;;
-	sa29200)
-		basic_machine=a29k-amd
-		os=-udi
-		;;
-	sb1)
-		basic_machine=mipsisa64sb1-unknown
-		;;
-	sb1el)
-		basic_machine=mipsisa64sb1el-unknown
-		;;
-	sde)
-		basic_machine=mipsisa32-sde
-		os=-elf
-		;;
-	sei)
-		basic_machine=mips-sei
-		os=-seiux
-		;;
-	sequent)
-		basic_machine=i386-sequent
-		;;
-	sh)
-		basic_machine=sh-hitachi
-		os=-hms
-		;;
-	sh5el)
-		basic_machine=sh5le-unknown
-		;;
-	sh64)
-		basic_machine=sh64-unknown
-		;;
-	sparclite-wrs | simso-wrs)
-		basic_machine=sparclite-wrs
-		os=-vxworks
-		;;
-	sps7)
-		basic_machine=m68k-bull
-		os=-sysv2
-		;;
-	spur)
-		basic_machine=spur-unknown
-		;;
-	st2000)
-		basic_machine=m68k-tandem
-		;;
-	stratus)
-		basic_machine=i860-stratus
-		os=-sysv4
-		;;
-	strongarm-* | thumb-*)
-		basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'`
-		;;
-	sun2)
-		basic_machine=m68000-sun
-		;;
-	sun2os3)
-		basic_machine=m68000-sun
-		os=-sunos3
-		;;
-	sun2os4)
-		basic_machine=m68000-sun
-		os=-sunos4
-		;;
-	sun3os3)
-		basic_machine=m68k-sun
-		os=-sunos3
-		;;
-	sun3os4)
-		basic_machine=m68k-sun
-		os=-sunos4
-		;;
-	sun4os3)
-		basic_machine=sparc-sun
-		os=-sunos3
-		;;
-	sun4os4)
-		basic_machine=sparc-sun
-		os=-sunos4
-		;;
-	sun4sol2)
-		basic_machine=sparc-sun
-		os=-solaris2
-		;;
-	sun3 | sun3-*)
-		basic_machine=m68k-sun
-		;;
-	sun4)
-		basic_machine=sparc-sun
-		;;
-	sun386 | sun386i | roadrunner)
-		basic_machine=i386-sun
-		;;
-	sv1)
-		basic_machine=sv1-cray
-		os=-unicos
-		;;
-	symmetry)
-		basic_machine=i386-sequent
-		os=-dynix
-		;;
-	t3e)
-		basic_machine=alphaev5-cray
-		os=-unicos
-		;;
-	t90)
-		basic_machine=t90-cray
-		os=-unicos
-		;;
-	tile*)
-		basic_machine=$basic_machine-unknown
-		os=-linux-gnu
-		;;
-	tx39)
-		basic_machine=mipstx39-unknown
-		;;
-	tx39el)
-		basic_machine=mipstx39el-unknown
-		;;
-	toad1)
-		basic_machine=pdp10-xkl
-		os=-tops20
-		;;
-	tower | tower-32)
-		basic_machine=m68k-ncr
-		;;
-	tpf)
-		basic_machine=s390x-ibm
-		os=-tpf
-		;;
-	udi29k)
-		basic_machine=a29k-amd
-		os=-udi
-		;;
-	ultra3)
-		basic_machine=a29k-nyu
-		os=-sym1
-		;;
-	v810 | necv810)
-		basic_machine=v810-nec
-		os=-none
-		;;
-	vaxv)
-		basic_machine=vax-dec
-		os=-sysv
-		;;
-	vms)
-		basic_machine=vax-dec
-		os=-vms
-		;;
-	vpp*|vx|vx-*)
-		basic_machine=f301-fujitsu
-		;;
-	vxworks960)
-		basic_machine=i960-wrs
-		os=-vxworks
-		;;
-	vxworks68)
-		basic_machine=m68k-wrs
-		os=-vxworks
-		;;
-	vxworks29k)
-		basic_machine=a29k-wrs
-		os=-vxworks
-		;;
-	w65*)
-		basic_machine=w65-wdc
-		os=-none
-		;;
-	w89k-*)
-		basic_machine=hppa1.1-winbond
-		os=-proelf
-		;;
-	xbox)
-		basic_machine=i686-pc
-		os=-mingw32
-		;;
-	xps | xps100)
-		basic_machine=xps100-honeywell
-		;;
-	xscale-* | xscalee[bl]-*)
-		basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'`
-		;;
-	ymp)
-		basic_machine=ymp-cray
-		os=-unicos
-		;;
-	z8k-*-coff)
-		basic_machine=z8k-unknown
-		os=-sim
-		;;
-	z80-*-coff)
-		basic_machine=z80-unknown
-		os=-sim
-		;;
-	none)
-		basic_machine=none-none
-		os=-none
-		;;
-
-# Here we handle the default manufacturer of certain CPU types.  It is in
-# some cases the only manufacturer, in others, it is the most popular.
-	w89k)
-		basic_machine=hppa1.1-winbond
-		;;
-	op50n)
-		basic_machine=hppa1.1-oki
-		;;
-	op60c)
-		basic_machine=hppa1.1-oki
-		;;
-	romp)
-		basic_machine=romp-ibm
-		;;
-	mmix)
-		basic_machine=mmix-knuth
-		;;
-	rs6000)
-		basic_machine=rs6000-ibm
-		;;
-	vax)
-		basic_machine=vax-dec
-		;;
-	pdp10)
-		# there are many clones, so DEC is not a safe bet
-		basic_machine=pdp10-unknown
-		;;
-	pdp11)
-		basic_machine=pdp11-dec
-		;;
-	we32k)
-		basic_machine=we32k-att
-		;;
-	sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)
-		basic_machine=sh-unknown
-		;;
-	sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)
-		basic_machine=sparc-sun
-		;;
-	cydra)
-		basic_machine=cydra-cydrome
-		;;
-	orion)
-		basic_machine=orion-highlevel
-		;;
-	orion105)
-		basic_machine=clipper-highlevel
-		;;
-	mac | mpw | mac-mpw)
-		basic_machine=m68k-apple
-		;;
-	pmac | pmac-mpw)
-		basic_machine=powerpc-apple
-		;;
-	*-unknown)
-		# Make sure to match an already-canonicalized machine name.
-		;;
-	*)
-		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
-		exit 1
-		;;
-esac
-
-# Here we canonicalize certain aliases for manufacturers.
-case $basic_machine in
-	*-digital*)
-		basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`
-		;;
-	*-commodore*)
-		basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`
-		;;
-	*)
-		;;
-esac
-
-# Decode manufacturer-specific aliases for certain operating systems.
-
-if [ x"$os" != x"" ]
-then
-case $os in
-	# First match some system type aliases
-	# that might get confused with valid system types.
-	# -solaris* is a basic system type, with this one exception.
-	-auroraux)
-		os=-auroraux
-		;;
-	-solaris1 | -solaris1.*)
-		os=`echo $os | sed -e 's|solaris1|sunos4|'`
-		;;
-	-solaris)
-		os=-solaris2
-		;;
-	-svr4*)
-		os=-sysv4
-		;;
-	-unixware*)
-		os=-sysv4.2uw
-		;;
-	-gnu/linux*)
-		os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`
-		;;
-	# First accept the basic system types.
-	# The portable systems comes first.
-	# Each alternative MUST END IN A *, to match a version number.
-	# -sysv* is not here because it comes later, after sysvr4.
-	-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \
-	      | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\
-	      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \
-	      | -sym* | -kopensolaris* | -plan9* \
-	      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \
-	      | -aos* | -aros* | -cloudabi* | -sortix* \
-	      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \
-	      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \
-	      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \
-	      | -bitrig* | -openbsd* | -solidbsd* | -libertybsd* \
-	      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \
-	      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \
-	      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \
-	      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \
-	      | -chorusos* | -chorusrdb* | -cegcc* \
-	      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
-	      | -midipix* | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \
-	      | -linux-newlib* | -linux-musl* | -linux-uclibc* \
-	      | -uxpv* | -beos* | -mpeix* | -udk* | -moxiebox* \
-	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
-	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
-	      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \
-	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
-	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
-	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
-	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* \
-	      | -onefs* | -tirtos* | -phoenix* | -fuchsia*)
-	# Remember, each alternative MUST END IN *, to match a version number.
-		;;
-	-qnx*)
-		case $basic_machine in
-		    x86-* | i*86-*)
-			;;
-		    *)
-			os=-nto$os
-			;;
-		esac
-		;;
-	-nto-qnx*)
-		;;
-	-nto*)
-		os=`echo $os | sed -e 's|nto|nto-qnx|'`
-		;;
-	-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \
-	      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \
-	      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)
-		;;
-	-mac*)
-		os=`echo $os | sed -e 's|mac|macos|'`
-		;;
-	-linux-dietlibc)
-		os=-linux-dietlibc
-		;;
-	-linux*)
-		os=`echo $os | sed -e 's|linux|linux-gnu|'`
-		;;
-	-sunos5*)
-		os=`echo $os | sed -e 's|sunos5|solaris2|'`
-		;;
-	-sunos6*)
-		os=`echo $os | sed -e 's|sunos6|solaris3|'`
-		;;
-	-opened*)
-		os=-openedition
-		;;
-	-os400*)
-		os=-os400
-		;;
-	-wince*)
-		os=-wince
-		;;
-	-osfrose*)
-		os=-osfrose
-		;;
-	-osf*)
-		os=-osf
-		;;
-	-utek*)
-		os=-bsd
-		;;
-	-dynix*)
-		os=-bsd
-		;;
-	-acis*)
-		os=-aos
-		;;
-	-atheos*)
-		os=-atheos
-		;;
-	-syllable*)
-		os=-syllable
-		;;
-	-386bsd)
-		os=-bsd
-		;;
-	-ctix* | -uts*)
-		os=-sysv
-		;;
-	-nova*)
-		os=-rtmk-nova
-		;;
-	-ns2 )
-		os=-nextstep2
-		;;
-	-nsk*)
-		os=-nsk
-		;;
-	# Preserve the version number of sinix5.
-	-sinix5.*)
-		os=`echo $os | sed -e 's|sinix|sysv|'`
-		;;
-	-sinix*)
-		os=-sysv4
-		;;
-	-tpf*)
-		os=-tpf
-		;;
-	-triton*)
-		os=-sysv3
-		;;
-	-oss*)
-		os=-sysv3
-		;;
-	-svr4)
-		os=-sysv4
-		;;
-	-svr3)
-		os=-sysv3
-		;;
-	-sysvr4)
-		os=-sysv4
-		;;
-	# This must come after -sysvr4.
-	-sysv*)
-		;;
-	-ose*)
-		os=-ose
-		;;
-	-es1800*)
-		os=-ose
-		;;
-	-xenix)
-		os=-xenix
-		;;
-	-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
-		os=-mint
-		;;
-	-aros*)
-		os=-aros
-		;;
-	-zvmoe)
-		os=-zvmoe
-		;;
-	-dicos*)
-		os=-dicos
-		;;
-	-nacl*)
-		;;
-	-ios)
-		;;
-	-none)
-		;;
-	*)
-		# Get rid of the `-' at the beginning of $os.
-		os=`echo $os | sed 's/[^-]*-//'`
-		echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2
-		exit 1
-		;;
-esac
-else
-
-# Here we handle the default operating systems that come with various machines.
-# The value should be what the vendor currently ships out the door with their
-# machine or put another way, the most popular os provided with the machine.
-
-# Note that if you're going to try to match "-MANUFACTURER" here (say,
-# "-sun"), then you have to tell the case statement up towards the top
-# that MANUFACTURER isn't an operating system.  Otherwise, code above
-# will signal an error saying that MANUFACTURER isn't an operating
-# system, and we'll never get to this point.
-
-case $basic_machine in
-	score-*)
-		os=-elf
-		;;
-	spu-*)
-		os=-elf
-		;;
-	*-acorn)
-		os=-riscix1.2
-		;;
-	arm*-rebel)
-		os=-linux
-		;;
-	arm*-semi)
-		os=-aout
-		;;
-	c4x-* | tic4x-*)
-		os=-coff
-		;;
-	c8051-*)
-		os=-elf
-		;;
-	hexagon-*)
-		os=-elf
-		;;
-	tic54x-*)
-		os=-coff
-		;;
-	tic55x-*)
-		os=-coff
-		;;
-	tic6x-*)
-		os=-coff
-		;;
-	# This must come before the *-dec entry.
-	pdp10-*)
-		os=-tops20
-		;;
-	pdp11-*)
-		os=-none
-		;;
-	*-dec | vax-*)
-		os=-ultrix4.2
-		;;
-	m68*-apollo)
-		os=-domain
-		;;
-	i386-sun)
-		os=-sunos4.0.2
-		;;
-	m68000-sun)
-		os=-sunos3
-		;;
-	m68*-cisco)
-		os=-aout
-		;;
-	mep-*)
-		os=-elf
-		;;
-	mips*-cisco)
-		os=-elf
-		;;
-	mips*-*)
-		os=-elf
-		;;
-	or32-*)
-		os=-coff
-		;;
-	*-tti)	# must be before sparc entry or we get the wrong os.
-		os=-sysv3
-		;;
-	sparc-* | *-sun)
-		os=-sunos4.1.1
-		;;
-	*-be)
-		os=-beos
-		;;
-	*-haiku)
-		os=-haiku
-		;;
-	*-ibm)
-		os=-aix
-		;;
-	*-knuth)
-		os=-mmixware
-		;;
-	*-wec)
-		os=-proelf
-		;;
-	*-winbond)
-		os=-proelf
-		;;
-	*-oki)
-		os=-proelf
-		;;
-	*-hp)
-		os=-hpux
-		;;
-	*-hitachi)
-		os=-hiux
-		;;
-	i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)
-		os=-sysv
-		;;
-	*-cbm)
-		os=-amigaos
-		;;
-	*-dg)
-		os=-dgux
-		;;
-	*-dolphin)
-		os=-sysv3
-		;;
-	m68k-ccur)
-		os=-rtu
-		;;
-	m88k-omron*)
-		os=-luna
-		;;
-	*-next )
-		os=-nextstep
-		;;
-	*-sequent)
-		os=-ptx
-		;;
-	*-crds)
-		os=-unos
-		;;
-	*-ns)
-		os=-genix
-		;;
-	i370-*)
-		os=-mvs
-		;;
-	*-next)
-		os=-nextstep3
-		;;
-	*-gould)
-		os=-sysv
-		;;
-	*-highlevel)
-		os=-bsd
-		;;
-	*-encore)
-		os=-bsd
-		;;
-	*-sgi)
-		os=-irix
-		;;
-	*-siemens)
-		os=-sysv4
-		;;
-	*-masscomp)
-		os=-rtu
-		;;
-	f30[01]-fujitsu | f700-fujitsu)
-		os=-uxpv
-		;;
-	*-rom68k)
-		os=-coff
-		;;
-	*-*bug)
-		os=-coff
-		;;
-	*-apple)
-		os=-macos
-		;;
-	*-atari*)
-		os=-mint
-		;;
-	*)
-		os=-none
-		;;
-esac
-fi
-
-# Here we handle the case where we know the os, and the CPU type, but not the
-# manufacturer.  We pick the logical manufacturer.
-vendor=unknown
-case $basic_machine in
-	*-unknown)
-		case $os in
-			-riscix*)
-				vendor=acorn
-				;;
-			-sunos*)
-				vendor=sun
-				;;
-			-cnk*|-aix*)
-				vendor=ibm
-				;;
-			-beos*)
-				vendor=be
-				;;
-			-hpux*)
-				vendor=hp
-				;;
-			-mpeix*)
-				vendor=hp
-				;;
-			-hiux*)
-				vendor=hitachi
-				;;
-			-unos*)
-				vendor=crds
-				;;
-			-dgux*)
-				vendor=dg
-				;;
-			-luna*)
-				vendor=omron
-				;;
-			-genix*)
-				vendor=ns
-				;;
-			-mvs* | -opened*)
-				vendor=ibm
-				;;
-			-os400*)
-				vendor=ibm
-				;;
-			-ptx*)
-				vendor=sequent
-				;;
-			-tpf*)
-				vendor=ibm
-				;;
-			-vxsim* | -vxworks* | -windiss*)
-				vendor=wrs
-				;;
-			-aux*)
-				vendor=apple
-				;;
-			-hms*)
-				vendor=hitachi
-				;;
-			-mpw* | -macos*)
-				vendor=apple
-				;;
-			-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
-				vendor=atari
-				;;
-			-vos*)
-				vendor=stratus
-				;;
-		esac
-		basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"`
-		;;
-esac
-
-echo $basic_machine$os
-exit
-
-# Local variables:
-# eval: (add-hook 'write-file-hooks 'time-stamp)
-# time-stamp-start: "timestamp='"
-# time-stamp-format: "%:y-%02m-%02d"
-# time-stamp-end: "'"
-# End:
diff --git a/redis-stable/deps/jemalloc/build-aux/install-sh b/redis-stable/deps/jemalloc/build-aux/install-sh
deleted file mode 100755
index ebc66913..00000000
--- a/redis-stable/deps/jemalloc/build-aux/install-sh
+++ /dev/null
@@ -1,250 +0,0 @@
-#! /bin/sh
-#
-# install - install a program, script, or datafile
-# This comes from X11R5 (mit/util/scripts/install.sh).
-#
-# Copyright 1991 by the Massachusetts Institute of Technology
-#
-# Permission to use, copy, modify, distribute, and sell this software and its
-# documentation for any purpose is hereby granted without fee, provided that
-# the above copyright notice appear in all copies and that both that
-# copyright notice and this permission notice appear in supporting
-# documentation, and that the name of M.I.T. not be used in advertising or
-# publicity pertaining to distribution of the software without specific,
-# written prior permission.  M.I.T. makes no representations about the
-# suitability of this software for any purpose.  It is provided "as is"
-# without express or implied warranty.
-#
-# Calling this script install-sh is preferred over install.sh, to prevent
-# `make' implicit rules from creating a file called install from it
-# when there is no Makefile.
-#
-# This script is compatible with the BSD install script, but was written
-# from scratch.  It can only install one file at a time, a restriction
-# shared with many OS's install programs.
-
-
-# set DOITPROG to echo to test this script
-
-# Don't use :- since 4.3BSD and earlier shells don't like it.
-doit="${DOITPROG-}"
-
-
-# put in absolute paths if you don't have them in your path; or use env. vars.
-
-mvprog="${MVPROG-mv}"
-cpprog="${CPPROG-cp}"
-chmodprog="${CHMODPROG-chmod}"
-chownprog="${CHOWNPROG-chown}"
-chgrpprog="${CHGRPPROG-chgrp}"
-stripprog="${STRIPPROG-strip}"
-rmprog="${RMPROG-rm}"
-mkdirprog="${MKDIRPROG-mkdir}"
-
-transformbasename=""
-transform_arg=""
-instcmd="$mvprog"
-chmodcmd="$chmodprog 0755"
-chowncmd=""
-chgrpcmd=""
-stripcmd=""
-rmcmd="$rmprog -f"
-mvcmd="$mvprog"
-src=""
-dst=""
-dir_arg=""
-
-while [ x"$1" != x ]; do
-    case $1 in
-	-c) instcmd="$cpprog"
-	    shift
-	    continue;;
-
-	-d) dir_arg=true
-	    shift
-	    continue;;
-
-	-m) chmodcmd="$chmodprog $2"
-	    shift
-	    shift
-	    continue;;
-
-	-o) chowncmd="$chownprog $2"
-	    shift
-	    shift
-	    continue;;
-
-	-g) chgrpcmd="$chgrpprog $2"
-	    shift
-	    shift
-	    continue;;
-
-	-s) stripcmd="$stripprog"
-	    shift
-	    continue;;
-
-	-t=*) transformarg=`echo $1 | sed 's/-t=//'`
-	    shift
-	    continue;;
-
-	-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
-	    shift
-	    continue;;
-
-	*)  if [ x"$src" = x ]
-	    then
-		src=$1
-	    else
-		# this colon is to work around a 386BSD /bin/sh bug
-		:
-		dst=$1
-	    fi
-	    shift
-	    continue;;
-    esac
-done
-
-if [ x"$src" = x ]
-then
-	echo "install:	no input file specified"
-	exit 1
-else
-	true
-fi
-
-if [ x"$dir_arg" != x ]; then
-	dst=$src
-	src=""
-	
-	if [ -d $dst ]; then
-		instcmd=:
-	else
-		instcmd=mkdir
-	fi
-else
-
-# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
-# might cause directories to be created, which would be especially bad 
-# if $src (and thus $dsttmp) contains '*'.
-
-	if [ -f $src -o -d $src ]
-	then
-		true
-	else
-		echo "install:  $src does not exist"
-		exit 1
-	fi
-	
-	if [ x"$dst" = x ]
-	then
-		echo "install:	no destination specified"
-		exit 1
-	else
-		true
-	fi
-
-# If destination is a directory, append the input filename; if your system
-# does not like double slashes in filenames, you may need to add some logic
-
-	if [ -d $dst ]
-	then
-		dst="$dst"/`basename $src`
-	else
-		true
-	fi
-fi
-
-## this sed command emulates the dirname command
-dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`
-
-# Make sure that the destination directory exists.
-#  this part is taken from Noah Friedman's mkinstalldirs script
-
-# Skip lots of stat calls in the usual case.
-if [ ! -d "$dstdir" ]; then
-defaultIFS='	
-'
-IFS="${IFS-${defaultIFS}}"
-
-oIFS="${IFS}"
-# Some sh's can't handle IFS=/ for some reason.
-IFS='%'
-set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
-IFS="${oIFS}"
-
-pathcomp=''
-
-while [ $# -ne 0 ] ; do
-	pathcomp="${pathcomp}${1}"
-	shift
-
-	if [ ! -d "${pathcomp}" ] ;
-        then
-		$mkdirprog "${pathcomp}"
-	else
-		true
-	fi
-
-	pathcomp="${pathcomp}/"
-done
-fi
-
-if [ x"$dir_arg" != x ]
-then
-	$doit $instcmd $dst &&
-
-	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi &&
-	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi &&
-	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi &&
-	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi
-else
-
-# If we're going to rename the final executable, determine the name now.
-
-	if [ x"$transformarg" = x ] 
-	then
-		dstfile=`basename $dst`
-	else
-		dstfile=`basename $dst $transformbasename | 
-			sed $transformarg`$transformbasename
-	fi
-
-# don't allow the sed command to completely eliminate the filename
-
-	if [ x"$dstfile" = x ] 
-	then
-		dstfile=`basename $dst`
-	else
-		true
-	fi
-
-# Make a temp file name in the proper directory.
-
-	dsttmp=$dstdir/#inst.$$#
-
-# Move or copy the file name to the temp name
-
-	$doit $instcmd $src $dsttmp &&
-
-	trap "rm -f ${dsttmp}" 0 &&
-
-# and set any options; do chmod last to preserve setuid bits
-
-# If any of these fail, we abort the whole thing.  If we want to
-# ignore errors from any of these, just make sure not to ignore
-# errors from the above "$doit $instcmd $src $dsttmp" command.
-
-	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi &&
-	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi &&
-	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi &&
-	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi &&
-
-# Now rename the file to the real destination.
-
-	$doit $rmcmd -f $dstdir/$dstfile &&
-	$doit $mvcmd $dsttmp $dstdir/$dstfile 
-
-fi &&
-
-
-exit 0
diff --git a/redis-stable/deps/jemalloc/config.stamp.in b/redis-stable/deps/jemalloc/config.stamp.in
deleted file mode 100644
index e69de29b..00000000
diff --git a/redis-stable/deps/jemalloc/configure.ac b/redis-stable/deps/jemalloc/configure.ac
deleted file mode 100644
index afa5df80..00000000
--- a/redis-stable/deps/jemalloc/configure.ac
+++ /dev/null
@@ -1,2294 +0,0 @@
-dnl Process this file with autoconf to produce a configure script.
-AC_PREREQ(2.68)
-AC_INIT([Makefile.in])
-
-AC_CONFIG_AUX_DIR([build-aux])
-
-dnl ============================================================================
-dnl Custom macro definitions.
-
-dnl JE_CONCAT_VVV(r, a, b)
-dnl
-dnl Set $r to the concatenation of $a and $b, with a space separating them iff
-dnl both $a and $b are non-empty.
-AC_DEFUN([JE_CONCAT_VVV],
-if test "x[$]{$2}" = "x" -o "x[$]{$3}" = "x" ; then
-  $1="[$]{$2}[$]{$3}"
-else
-  $1="[$]{$2} [$]{$3}"
-fi
-)
-
-dnl JE_APPEND_VS(a, b)
-dnl
-dnl Set $a to the concatenation of $a and b, with a space separating them iff
-dnl both $a and b are non-empty.
-AC_DEFUN([JE_APPEND_VS],
-  T_APPEND_V=$2
-  JE_CONCAT_VVV($1, $1, T_APPEND_V)
-)
-
-CONFIGURE_CFLAGS=
-SPECIFIED_CFLAGS="${CFLAGS}"
-dnl JE_CFLAGS_ADD(cflag)
-dnl
-dnl CFLAGS is the concatenation of CONFIGURE_CFLAGS and SPECIFIED_CFLAGS
-dnl (ignoring EXTRA_CFLAGS, which does not impact configure tests.  This macro
-dnl appends to CONFIGURE_CFLAGS and regenerates CFLAGS.
-AC_DEFUN([JE_CFLAGS_ADD],
-[
-AC_MSG_CHECKING([whether compiler supports $1])
-T_CONFIGURE_CFLAGS="${CONFIGURE_CFLAGS}"
-JE_APPEND_VS(CONFIGURE_CFLAGS, $1)
-JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
-AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
-[[
-]], [[
-    return 0;
-]])],
-              [je_cv_cflags_added=$1]
-              AC_MSG_RESULT([yes]),
-              [je_cv_cflags_added=]
-              AC_MSG_RESULT([no])
-              [CONFIGURE_CFLAGS="${T_CONFIGURE_CFLAGS}"]
-)
-JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
-])
-
-dnl JE_CFLAGS_SAVE()
-dnl JE_CFLAGS_RESTORE()
-dnl
-dnl Save/restore CFLAGS.  Nesting is not supported.
-AC_DEFUN([JE_CFLAGS_SAVE],
-SAVED_CONFIGURE_CFLAGS="${CONFIGURE_CFLAGS}"
-)
-AC_DEFUN([JE_CFLAGS_RESTORE],
-CONFIGURE_CFLAGS="${SAVED_CONFIGURE_CFLAGS}"
-JE_CONCAT_VVV(CFLAGS, CONFIGURE_CFLAGS, SPECIFIED_CFLAGS)
-)
-
-CONFIGURE_CXXFLAGS=
-SPECIFIED_CXXFLAGS="${CXXFLAGS}"
-dnl JE_CXXFLAGS_ADD(cxxflag)
-AC_DEFUN([JE_CXXFLAGS_ADD],
-[
-AC_MSG_CHECKING([whether compiler supports $1])
-T_CONFIGURE_CXXFLAGS="${CONFIGURE_CXXFLAGS}"
-JE_APPEND_VS(CONFIGURE_CXXFLAGS, $1)
-JE_CONCAT_VVV(CXXFLAGS, CONFIGURE_CXXFLAGS, SPECIFIED_CXXFLAGS)
-AC_LANG_PUSH([C++])
-AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
-[[
-]], [[
-    return 0;
-]])],
-              [je_cv_cxxflags_added=$1]
-              AC_MSG_RESULT([yes]),
-              [je_cv_cxxflags_added=]
-              AC_MSG_RESULT([no])
-              [CONFIGURE_CXXFLAGS="${T_CONFIGURE_CXXFLAGS}"]
-)
-AC_LANG_POP([C++])
-JE_CONCAT_VVV(CXXFLAGS, CONFIGURE_CXXFLAGS, SPECIFIED_CXXFLAGS)
-])
-
-dnl JE_COMPILABLE(label, hcode, mcode, rvar)
-dnl
-dnl Use AC_LINK_IFELSE() rather than AC_COMPILE_IFELSE() so that linker errors
-dnl cause failure.
-AC_DEFUN([JE_COMPILABLE],
-[
-AC_CACHE_CHECK([whether $1 is compilable],
-               [$4],
-               [AC_LINK_IFELSE([AC_LANG_PROGRAM([$2],
-                                                [$3])],
-                               [$4=yes],
-                               [$4=no])])
-])
-
-dnl ============================================================================
-
-CONFIG=`echo ${ac_configure_args} | sed -e 's#'"'"'\([^ ]*\)'"'"'#\1#g'`
-AC_SUBST([CONFIG])
-
-dnl Library revision.
-rev=2
-AC_SUBST([rev])
-
-srcroot=$srcdir
-if test "x${srcroot}" = "x." ; then
-  srcroot=""
-else
-  srcroot="${srcroot}/"
-fi
-AC_SUBST([srcroot])
-abs_srcroot="`cd \"${srcdir}\"; pwd`/"
-AC_SUBST([abs_srcroot])
-
-objroot=""
-AC_SUBST([objroot])
-abs_objroot="`pwd`/"
-AC_SUBST([abs_objroot])
-
-dnl Munge install path variables.
-if test "x$prefix" = "xNONE" ; then
-  prefix="/usr/local"
-fi
-if test "x$exec_prefix" = "xNONE" ; then
-  exec_prefix=$prefix
-fi
-PREFIX=$prefix
-AC_SUBST([PREFIX])
-BINDIR=`eval echo $bindir`
-BINDIR=`eval echo $BINDIR`
-AC_SUBST([BINDIR])
-INCLUDEDIR=`eval echo $includedir`
-INCLUDEDIR=`eval echo $INCLUDEDIR`
-AC_SUBST([INCLUDEDIR])
-LIBDIR=`eval echo $libdir`
-LIBDIR=`eval echo $LIBDIR`
-AC_SUBST([LIBDIR])
-DATADIR=`eval echo $datadir`
-DATADIR=`eval echo $DATADIR`
-AC_SUBST([DATADIR])
-MANDIR=`eval echo $mandir`
-MANDIR=`eval echo $MANDIR`
-AC_SUBST([MANDIR])
-
-dnl Support for building documentation.
-AC_PATH_PROG([XSLTPROC], [xsltproc], [false], [$PATH])
-if test -d "/usr/share/xml/docbook/stylesheet/docbook-xsl" ; then
-  DEFAULT_XSLROOT="/usr/share/xml/docbook/stylesheet/docbook-xsl"
-elif test -d "/usr/share/sgml/docbook/xsl-stylesheets" ; then
-  DEFAULT_XSLROOT="/usr/share/sgml/docbook/xsl-stylesheets"
-else
-  dnl Documentation building will fail if this default gets used.
-  DEFAULT_XSLROOT=""
-fi
-AC_ARG_WITH([xslroot],
-  [AS_HELP_STRING([--with-xslroot=<path>], [XSL stylesheet root path])], [
-if test "x$with_xslroot" = "xno" ; then
-  XSLROOT="${DEFAULT_XSLROOT}"
-else
-  XSLROOT="${with_xslroot}"
-fi
-],
-  XSLROOT="${DEFAULT_XSLROOT}"
-)
-AC_SUBST([XSLROOT])
-
-dnl If CFLAGS isn't defined, set CFLAGS to something reasonable.  Otherwise,
-dnl just prevent autoconf from molesting CFLAGS.
-CFLAGS=$CFLAGS
-AC_PROG_CC
-
-if test "x$GCC" != "xyes" ; then
-  AC_CACHE_CHECK([whether compiler is MSVC],
-                 [je_cv_msvc],
-                 [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
-                                                     [
-#ifndef _MSC_VER
-  int fail[-1];
-#endif
-])],
-                               [je_cv_msvc=yes],
-                               [je_cv_msvc=no])])
-fi
-
-dnl check if a cray prgenv wrapper compiler is being used
-je_cv_cray_prgenv_wrapper=""
-if test "x${PE_ENV}" != "x" ; then
-  case "${CC}" in
-    CC|cc)
-	je_cv_cray_prgenv_wrapper="yes"
-	;;
-    *)
-       ;;
-  esac
-fi
-
-AC_CACHE_CHECK([whether compiler is cray],
-              [je_cv_cray],
-              [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
-                                                  [
-#ifndef _CRAYC
-  int fail[-1];
-#endif
-])],
-                            [je_cv_cray=yes],
-                            [je_cv_cray=no])])
-
-if test "x${je_cv_cray}" = "xyes" ; then
-  AC_CACHE_CHECK([whether cray compiler version is 8.4],
-                [je_cv_cray_84],
-                [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],
-                                                      [
-#if !(_RELEASE_MAJOR == 8 && _RELEASE_MINOR == 4)
-  int fail[-1];
-#endif
-])],
-                              [je_cv_cray_84=yes],
-                              [je_cv_cray_84=no])])
-fi
-
-if test "x$GCC" = "xyes" ; then
-  JE_CFLAGS_ADD([-std=gnu11])
-  if test "x$je_cv_cflags_added" = "x-std=gnu11" ; then
-    AC_DEFINE_UNQUOTED([JEMALLOC_HAS_RESTRICT])
-  else
-    JE_CFLAGS_ADD([-std=gnu99])
-    if test "x$je_cv_cflags_added" = "x-std=gnu99" ; then
-      AC_DEFINE_UNQUOTED([JEMALLOC_HAS_RESTRICT])
-    fi
-  fi
-  JE_CFLAGS_ADD([-Wall])
-  JE_CFLAGS_ADD([-Wshorten-64-to-32])
-  JE_CFLAGS_ADD([-Wsign-compare])
-  JE_CFLAGS_ADD([-Wundef])
-  JE_CFLAGS_ADD([-Wno-format-zero-length])
-  JE_CFLAGS_ADD([-pipe])
-  JE_CFLAGS_ADD([-g3])
-elif test "x$je_cv_msvc" = "xyes" ; then
-  CC="$CC -nologo"
-  JE_CFLAGS_ADD([-Zi])
-  JE_CFLAGS_ADD([-MT])
-  JE_CFLAGS_ADD([-W3])
-  JE_CFLAGS_ADD([-FS])
-  JE_APPEND_VS(CPPFLAGS, -I${srcdir}/include/msvc_compat)
-fi
-if test "x$je_cv_cray" = "xyes" ; then
-  dnl cray compiler 8.4 has an inlining bug
-  if test "x$je_cv_cray_84" = "xyes" ; then
-    JE_CFLAGS_ADD([-hipa2])
-    JE_CFLAGS_ADD([-hnognu])
-  fi
-  dnl ignore unreachable code warning
-  JE_CFLAGS_ADD([-hnomessage=128])
-  dnl ignore redefinition of "malloc", "free", etc warning
-  JE_CFLAGS_ADD([-hnomessage=1357])
-fi
-AC_SUBST([CONFIGURE_CFLAGS])
-AC_SUBST([SPECIFIED_CFLAGS])
-AC_SUBST([EXTRA_CFLAGS])
-AC_PROG_CPP
-
-AC_ARG_ENABLE([cxx],
-  [AS_HELP_STRING([--disable-cxx], [Disable C++ integration])],
-if test "x$enable_cxx" = "xno" ; then
-  enable_cxx="0"
-else
-  enable_cxx="1"
-fi
-,
-enable_cxx="1"
-)
-if test "x$enable_cxx" = "x1" ; then
-  dnl Require at least c++14, which is the first version to support sized
-  dnl deallocation.  C++ support is not compiled otherwise.
-  m4_include([m4/ax_cxx_compile_stdcxx.m4])
-  AX_CXX_COMPILE_STDCXX([14], [noext], [optional])
-  if test "x${HAVE_CXX14}" = "x1" ; then
-    JE_CXXFLAGS_ADD([-Wall])
-    JE_CXXFLAGS_ADD([-g3])
-
-    SAVED_LIBS="${LIBS}"
-    JE_APPEND_VS(LIBS, -lstdc++)
-    JE_COMPILABLE([libstdc++ linkage], [
-#include <stdlib.h>
-], [[
-	int *arr = (int *)malloc(sizeof(int) * 42);
-	if (arr == NULL)
-		return 1;
-]], [je_cv_libstdcxx])
-    if test "x${je_cv_libstdcxx}" = "xno" ; then
-      LIBS="${SAVED_LIBS}"
-    fi
-  else
-    enable_cxx="0"
-  fi
-fi
-AC_SUBST([enable_cxx])
-AC_SUBST([CONFIGURE_CXXFLAGS])
-AC_SUBST([SPECIFIED_CXXFLAGS])
-AC_SUBST([EXTRA_CXXFLAGS])
-
-AC_C_BIGENDIAN([ac_cv_big_endian=1], [ac_cv_big_endian=0])
-if test "x${ac_cv_big_endian}" = "x1" ; then
-  AC_DEFINE_UNQUOTED([JEMALLOC_BIG_ENDIAN], [ ])
-fi
-
-if test "x${je_cv_msvc}" = "xyes" -a "x${ac_cv_header_inttypes_h}" = "xno"; then
-  JE_APPEND_VS(CPPFLAGS, -I${srcdir}/include/msvc_compat/C99)
-fi
-
-if test "x${je_cv_msvc}" = "xyes" ; then
-  LG_SIZEOF_PTR=LG_SIZEOF_PTR_WIN
-  AC_MSG_RESULT([Using a predefined value for sizeof(void *): 4 for 32-bit, 8 for 64-bit])
-else
-  AC_CHECK_SIZEOF([void *])
-  if test "x${ac_cv_sizeof_void_p}" = "x8" ; then
-    LG_SIZEOF_PTR=3
-  elif test "x${ac_cv_sizeof_void_p}" = "x4" ; then
-    LG_SIZEOF_PTR=2
-  else
-    AC_MSG_ERROR([Unsupported pointer size: ${ac_cv_sizeof_void_p}])
-  fi
-fi
-AC_DEFINE_UNQUOTED([LG_SIZEOF_PTR], [$LG_SIZEOF_PTR])
-
-AC_CHECK_SIZEOF([int])
-if test "x${ac_cv_sizeof_int}" = "x8" ; then
-  LG_SIZEOF_INT=3
-elif test "x${ac_cv_sizeof_int}" = "x4" ; then
-  LG_SIZEOF_INT=2
-else
-  AC_MSG_ERROR([Unsupported int size: ${ac_cv_sizeof_int}])
-fi
-AC_DEFINE_UNQUOTED([LG_SIZEOF_INT], [$LG_SIZEOF_INT])
-
-AC_CHECK_SIZEOF([long])
-if test "x${ac_cv_sizeof_long}" = "x8" ; then
-  LG_SIZEOF_LONG=3
-elif test "x${ac_cv_sizeof_long}" = "x4" ; then
-  LG_SIZEOF_LONG=2
-else
-  AC_MSG_ERROR([Unsupported long size: ${ac_cv_sizeof_long}])
-fi
-AC_DEFINE_UNQUOTED([LG_SIZEOF_LONG], [$LG_SIZEOF_LONG])
-
-AC_CHECK_SIZEOF([long long])
-if test "x${ac_cv_sizeof_long_long}" = "x8" ; then
-  LG_SIZEOF_LONG_LONG=3
-elif test "x${ac_cv_sizeof_long_long}" = "x4" ; then
-  LG_SIZEOF_LONG_LONG=2
-else
-  AC_MSG_ERROR([Unsupported long long size: ${ac_cv_sizeof_long_long}])
-fi
-AC_DEFINE_UNQUOTED([LG_SIZEOF_LONG_LONG], [$LG_SIZEOF_LONG_LONG])
-
-AC_CHECK_SIZEOF([intmax_t])
-if test "x${ac_cv_sizeof_intmax_t}" = "x16" ; then
-  LG_SIZEOF_INTMAX_T=4
-elif test "x${ac_cv_sizeof_intmax_t}" = "x8" ; then
-  LG_SIZEOF_INTMAX_T=3
-elif test "x${ac_cv_sizeof_intmax_t}" = "x4" ; then
-  LG_SIZEOF_INTMAX_T=2
-else
-  AC_MSG_ERROR([Unsupported intmax_t size: ${ac_cv_sizeof_intmax_t}])
-fi
-AC_DEFINE_UNQUOTED([LG_SIZEOF_INTMAX_T], [$LG_SIZEOF_INTMAX_T])
-
-AC_CANONICAL_HOST
-dnl CPU-specific settings.
-CPU_SPINWAIT=""
-case "${host_cpu}" in
-  i686|x86_64)
-	HAVE_CPU_SPINWAIT=1
-	if test "x${je_cv_msvc}" = "xyes" ; then
-	    AC_CACHE_VAL([je_cv_pause_msvc],
-	      [JE_COMPILABLE([pause instruction MSVC], [],
-					[[_mm_pause(); return 0;]],
-					[je_cv_pause_msvc])])
-	    if test "x${je_cv_pause_msvc}" = "xyes" ; then
-		CPU_SPINWAIT='_mm_pause()'
-	    fi
-	else
-	    AC_CACHE_VAL([je_cv_pause],
-	      [JE_COMPILABLE([pause instruction], [],
-					[[__asm__ volatile("pause"); return 0;]],
-					[je_cv_pause])])
-	    if test "x${je_cv_pause}" = "xyes" ; then
-		CPU_SPINWAIT='__asm__ volatile("pause")'
-	    fi
-	fi
-	;;
-  *)
-	HAVE_CPU_SPINWAIT=0
-	;;
-esac
-AC_DEFINE_UNQUOTED([HAVE_CPU_SPINWAIT], [$HAVE_CPU_SPINWAIT])
-AC_DEFINE_UNQUOTED([CPU_SPINWAIT], [$CPU_SPINWAIT])
-
-AC_ARG_WITH([lg_vaddr],
-  [AS_HELP_STRING([--with-lg-vaddr=<lg-vaddr>], [Number of significant virtual address bits])],
-  [LG_VADDR="$with_lg_vaddr"], [LG_VADDR="detect"])
-
-case "${host_cpu}" in
-  aarch64)
-    if test "x$LG_VADDR" = "xdetect"; then
-      AC_MSG_CHECKING([number of significant virtual address bits])
-      if test "x${LG_SIZEOF_PTR}" = "x2" ; then
-        #aarch64 ILP32
-        LG_VADDR=32
-      else
-        #aarch64 LP64
-        LG_VADDR=48
-      fi
-      AC_MSG_RESULT([$LG_VADDR])
-    fi
-    ;;
-  x86_64)
-    if test "x$LG_VADDR" = "xdetect"; then
-      AC_CACHE_CHECK([number of significant virtual address bits],
-                     [je_cv_lg_vaddr],
-                     AC_RUN_IFELSE([AC_LANG_PROGRAM(
-[[
-#include <stdio.h>
-#ifdef _WIN32
-#include <limits.h>
-#include <intrin.h>
-typedef unsigned __int32 uint32_t;
-#else
-#include <stdint.h>
-#endif
-]], [[
-	uint32_t r[[4]];
-	uint32_t eax_in = 0x80000008U;
-#ifdef _WIN32
-	__cpuid((int *)r, (int)eax_in);
-#else
-	asm volatile ("cpuid"
-	    : "=a" (r[[0]]), "=b" (r[[1]]), "=c" (r[[2]]), "=d" (r[[3]])
-	    : "a" (eax_in), "c" (0)
-	);
-#endif
-	uint32_t eax_out = r[[0]];
-	uint32_t vaddr = ((eax_out & 0x0000ff00U) >> 8);
-	FILE *f = fopen("conftest.out", "w");
-	if (f == NULL) {
-		return 1;
-	}
-	if (vaddr > (sizeof(void *) << 3)) {
-		vaddr = sizeof(void *) << 3;
-	}
-	fprintf(f, "%u", vaddr);
-	fclose(f);
-	return 0;
-]])],
-                   [je_cv_lg_vaddr=`cat conftest.out`],
-                   [je_cv_lg_vaddr=error],
-                   [je_cv_lg_vaddr=57]))
-      if test "x${je_cv_lg_vaddr}" != "x" ; then
-        LG_VADDR="${je_cv_lg_vaddr}"
-      fi
-      if test "x${LG_VADDR}" != "xerror" ; then
-        AC_DEFINE_UNQUOTED([LG_VADDR], [$LG_VADDR])
-      else
-        AC_MSG_ERROR([cannot determine number of significant virtual address bits])
-      fi
-    fi
-    ;;
-  *)
-    if test "x$LG_VADDR" = "xdetect"; then
-      AC_MSG_CHECKING([number of significant virtual address bits])
-      if test "x${LG_SIZEOF_PTR}" = "x3" ; then
-        LG_VADDR=64
-      elif test "x${LG_SIZEOF_PTR}" = "x2" ; then
-        LG_VADDR=32
-      elif test "x${LG_SIZEOF_PTR}" = "xLG_SIZEOF_PTR_WIN" ; then
-        LG_VADDR="(1U << (LG_SIZEOF_PTR_WIN+3))"
-      else
-        AC_MSG_ERROR([Unsupported lg(pointer size): ${LG_SIZEOF_PTR}])
-      fi
-      AC_MSG_RESULT([$LG_VADDR])
-    fi
-    ;;
-esac
-AC_DEFINE_UNQUOTED([LG_VADDR], [$LG_VADDR])
-
-LD_PRELOAD_VAR="LD_PRELOAD"
-so="so"
-importlib="${so}"
-o="$ac_objext"
-a="a"
-exe="$ac_exeext"
-libprefix="lib"
-link_whole_archive="0"
-DSO_LDFLAGS='-shared -Wl,-soname,$(@F)'
-RPATH='-Wl,-rpath,$(1)'
-SOREV="${so}.${rev}"
-PIC_CFLAGS='-fPIC -DPIC'
-CTARGET='-o $@'
-LDTARGET='-o $@'
-TEST_LD_MODE=
-EXTRA_LDFLAGS=
-ARFLAGS='crs'
-AROUT=' $@'
-CC_MM=1
-
-if test "x$je_cv_cray_prgenv_wrapper" = "xyes" ; then
-  TEST_LD_MODE='-dynamic'
-fi
-
-if test "x${je_cv_cray}" = "xyes" ; then
-  CC_MM=
-fi
-
-AN_MAKEVAR([AR], [AC_PROG_AR])
-AN_PROGRAM([ar], [AC_PROG_AR])
-AC_DEFUN([AC_PROG_AR], [AC_CHECK_TOOL(AR, ar, :)])
-AC_PROG_AR
-
-AN_MAKEVAR([NM], [AC_PROG_NM])
-AN_PROGRAM([nm], [AC_PROG_NM])
-AC_DEFUN([AC_PROG_NM], [AC_CHECK_TOOL(NM, nm, :)])
-AC_PROG_NM
-
-AC_PROG_AWK
-
-dnl Platform-specific settings.  abi and RPATH can probably be determined
-dnl programmatically, but doing so is error-prone, which makes it generally
-dnl not worth the trouble.
-dnl
-dnl Define cpp macros in CPPFLAGS, rather than doing AC_DEFINE(macro), since the
-dnl definitions need to be seen before any headers are included, which is a pain
-dnl to make happen otherwise.
-default_retain="0"
-maps_coalesce="1"
-DUMP_SYMS="${NM} -a"
-SYM_PREFIX=""
-case "${host}" in
-  *-*-darwin* | *-*-ios*)
-	abi="macho"
-	RPATH=""
-	LD_PRELOAD_VAR="DYLD_INSERT_LIBRARIES"
-	so="dylib"
-	importlib="${so}"
-	force_tls="0"
-	DSO_LDFLAGS='-shared -Wl,-install_name,$(LIBDIR)/$(@F)'
-	SOREV="${rev}.${so}"
-	sbrk_deprecated="1"
-	SYM_PREFIX="_"
-	;;
-  *-*-freebsd*)
-	abi="elf"
-	AC_DEFINE([JEMALLOC_SYSCTL_VM_OVERCOMMIT], [ ])
-	force_lazy_lock="1"
-	;;
-  *-*-dragonfly*)
-	abi="elf"
-	;;
-  *-*-openbsd*)
-	abi="elf"
-	force_tls="0"
-	;;
-  *-*-bitrig*)
-	abi="elf"
-	;;
-  *-*-linux-android)
-	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
-	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
-	abi="elf"
-	AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS], [ ])
-	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
-	AC_DEFINE([JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY], [ ])
-	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
-	AC_DEFINE([JEMALLOC_C11_ATOMICS])
-	force_tls="0"
-	if test "${LG_SIZEOF_PTR}" = "3"; then
-	  default_retain="1"
-	fi
-	;;
-  *-*-linux*)
-	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
-	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
-	abi="elf"
-	AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS], [ ])
-	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
-	AC_DEFINE([JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY], [ ])
-	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
-	AC_DEFINE([JEMALLOC_USE_CXX_THROW], [ ])
-	if test "${LG_SIZEOF_PTR}" = "3"; then
-	  default_retain="1"
-	fi
-	;;
-  *-*-kfreebsd*)
-	dnl syscall(2) and secure_getenv(3) are exposed by _GNU_SOURCE.
-	JE_APPEND_VS(CPPFLAGS, -D_GNU_SOURCE)
-	abi="elf"
-	AC_DEFINE([JEMALLOC_HAS_ALLOCA_H])
-	AC_DEFINE([JEMALLOC_SYSCTL_VM_OVERCOMMIT], [ ])
-	AC_DEFINE([JEMALLOC_THREADED_INIT], [ ])
-	AC_DEFINE([JEMALLOC_USE_CXX_THROW], [ ])
-	;;
-  *-*-netbsd*)
-	AC_MSG_CHECKING([ABI])
-        AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
-[[#ifdef __ELF__
-/* ELF */
-#else
-#error aout
-#endif
-]])],
-                          [abi="elf"],
-                          [abi="aout"])
-	AC_MSG_RESULT([$abi])
-	;;
-  *-*-solaris2*)
-	abi="elf"
-	RPATH='-Wl,-R,$(1)'
-	dnl Solaris needs this for sigwait().
-	JE_APPEND_VS(CPPFLAGS, -D_POSIX_PTHREAD_SEMANTICS)
-	JE_APPEND_VS(LIBS, -lposix4 -lsocket -lnsl)
-	;;
-  *-ibm-aix*)
-	if test "${LG_SIZEOF_PTR}" = "3"; then
-	  dnl 64bit AIX
-	  LD_PRELOAD_VAR="LDR_PRELOAD64"
-	else
-	  dnl 32bit AIX
-	  LD_PRELOAD_VAR="LDR_PRELOAD"
-	fi
-	abi="xcoff"
-	;;
-  *-*-mingw* | *-*-cygwin*)
-	abi="pecoff"
-	force_tls="0"
-	maps_coalesce="0"
-	RPATH=""
-	so="dll"
-	if test "x$je_cv_msvc" = "xyes" ; then
-	  importlib="lib"
-	  DSO_LDFLAGS="-LD"
-	  EXTRA_LDFLAGS="-link -DEBUG"
-	  CTARGET='-Fo$@'
-	  LDTARGET='-Fe$@'
-	  AR='lib'
-	  ARFLAGS='-nologo -out:'
-	  AROUT='$@'
-	  CC_MM=
-        else
-	  importlib="${so}"
-	  DSO_LDFLAGS="-shared"
-	  link_whole_archive="1"
-	fi
-	case "${host}" in
-	  *-*-cygwin*)
-	    DUMP_SYMS="dumpbin /SYMBOLS"
-	    ;;
-	  *)
-	    ;;
-	esac
-	a="lib"
-	libprefix=""
-	SOREV="${so}"
-	PIC_CFLAGS=""
-	;;
-  *)
-	AC_MSG_RESULT([Unsupported operating system: ${host}])
-	abi="elf"
-	;;
-esac
-
-JEMALLOC_USABLE_SIZE_CONST=const
-AC_CHECK_HEADERS([malloc.h], [
-  AC_MSG_CHECKING([whether malloc_usable_size definition can use const argument])
-  AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
-    [#include <malloc.h>
-     #include <stddef.h>
-    size_t malloc_usable_size(const void *ptr);
-    ],
-    [])],[
-                AC_MSG_RESULT([yes])
-         ],[
-                JEMALLOC_USABLE_SIZE_CONST=
-                AC_MSG_RESULT([no])
-         ])
-])
-AC_DEFINE_UNQUOTED([JEMALLOC_USABLE_SIZE_CONST], [$JEMALLOC_USABLE_SIZE_CONST])
-AC_SUBST([abi])
-AC_SUBST([RPATH])
-AC_SUBST([LD_PRELOAD_VAR])
-AC_SUBST([so])
-AC_SUBST([importlib])
-AC_SUBST([o])
-AC_SUBST([a])
-AC_SUBST([exe])
-AC_SUBST([libprefix])
-AC_SUBST([link_whole_archive])
-AC_SUBST([DSO_LDFLAGS])
-AC_SUBST([EXTRA_LDFLAGS])
-AC_SUBST([SOREV])
-AC_SUBST([PIC_CFLAGS])
-AC_SUBST([CTARGET])
-AC_SUBST([LDTARGET])
-AC_SUBST([TEST_LD_MODE])
-AC_SUBST([MKLIB])
-AC_SUBST([ARFLAGS])
-AC_SUBST([AROUT])
-AC_SUBST([DUMP_SYMS])
-AC_SUBST([CC_MM])
-
-dnl Determine whether libm must be linked to use e.g. log(3).
-AC_SEARCH_LIBS([log], [m], , [AC_MSG_ERROR([Missing math functions])])
-if test "x$ac_cv_search_log" != "xnone required" ; then
-  LM="$ac_cv_search_log"
-else
-  LM=
-fi
-AC_SUBST(LM)
-
-JE_COMPILABLE([__attribute__ syntax],
-              [static __attribute__((unused)) void foo(void){}],
-              [],
-              [je_cv_attribute])
-if test "x${je_cv_attribute}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_ATTR], [ ])
-  if test "x${GCC}" = "xyes" -a "x${abi}" = "xelf"; then
-    JE_CFLAGS_ADD([-fvisibility=hidden])
-    JE_CXXFLAGS_ADD([-fvisibility=hidden])
-  fi
-fi
-dnl Check for tls_model attribute support (clang 3.0 still lacks support).
-JE_CFLAGS_SAVE()
-JE_CFLAGS_ADD([-Werror])
-JE_CFLAGS_ADD([-herror_on_warning])
-JE_COMPILABLE([tls_model attribute], [],
-              [static __thread int
-               __attribute__((tls_model("initial-exec"), unused)) foo;
-               foo = 0;],
-              [je_cv_tls_model])
-JE_CFLAGS_RESTORE()
-dnl (Setting of JEMALLOC_TLS_MODEL is done later, after we've checked for
-dnl --disable-initial-exec-tls)
-
-dnl Check for alloc_size attribute support.
-JE_CFLAGS_SAVE()
-JE_CFLAGS_ADD([-Werror])
-JE_CFLAGS_ADD([-herror_on_warning])
-JE_COMPILABLE([alloc_size attribute], [#include <stdlib.h>],
-              [void *foo(size_t size) __attribute__((alloc_size(1)));],
-              [je_cv_alloc_size])
-JE_CFLAGS_RESTORE()
-if test "x${je_cv_alloc_size}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_ATTR_ALLOC_SIZE], [ ])
-fi
-dnl Check for format(gnu_printf, ...) attribute support.
-JE_CFLAGS_SAVE()
-JE_CFLAGS_ADD([-Werror])
-JE_CFLAGS_ADD([-herror_on_warning])
-JE_COMPILABLE([format(gnu_printf, ...) attribute], [#include <stdlib.h>],
-              [void *foo(const char *format, ...) __attribute__((format(gnu_printf, 1, 2)));],
-              [je_cv_format_gnu_printf])
-JE_CFLAGS_RESTORE()
-if test "x${je_cv_format_gnu_printf}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF], [ ])
-fi
-dnl Check for format(printf, ...) attribute support.
-JE_CFLAGS_SAVE()
-JE_CFLAGS_ADD([-Werror])
-JE_CFLAGS_ADD([-herror_on_warning])
-JE_COMPILABLE([format(printf, ...) attribute], [#include <stdlib.h>],
-              [void *foo(const char *format, ...) __attribute__((format(printf, 1, 2)));],
-              [je_cv_format_printf])
-JE_CFLAGS_RESTORE()
-if test "x${je_cv_format_printf}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_ATTR_FORMAT_PRINTF], [ ])
-fi
-
-dnl Support optional additions to rpath.
-AC_ARG_WITH([rpath],
-  [AS_HELP_STRING([--with-rpath=<rpath>], [Colon-separated rpath (ELF systems only)])],
-if test "x$with_rpath" = "xno" ; then
-  RPATH_EXTRA=
-else
-  RPATH_EXTRA="`echo $with_rpath | tr \":\" \" \"`"
-fi,
-  RPATH_EXTRA=
-)
-AC_SUBST([RPATH_EXTRA])
-
-dnl Disable rules that do automatic regeneration of configure output by default.
-AC_ARG_ENABLE([autogen],
-  [AS_HELP_STRING([--enable-autogen], [Automatically regenerate configure output])],
-if test "x$enable_autogen" = "xno" ; then
-  enable_autogen="0"
-else
-  enable_autogen="1"
-fi
-,
-enable_autogen="0"
-)
-AC_SUBST([enable_autogen])
-
-AC_PROG_INSTALL
-AC_PROG_RANLIB
-AC_PATH_PROG([LD], [ld], [false], [$PATH])
-AC_PATH_PROG([AUTOCONF], [autoconf], [false], [$PATH])
-
-dnl Perform no name mangling by default.
-AC_ARG_WITH([mangling],
-  [AS_HELP_STRING([--with-mangling=<map>], [Mangle symbols in <map>])],
-  [mangling_map="$with_mangling"], [mangling_map=""])
-
-dnl Do not prefix public APIs by default.
-AC_ARG_WITH([jemalloc_prefix],
-  [AS_HELP_STRING([--with-jemalloc-prefix=<prefix>], [Prefix to prepend to all public APIs])],
-  [JEMALLOC_PREFIX="$with_jemalloc_prefix"],
-  [if test "x$abi" != "xmacho" -a "x$abi" != "xpecoff"; then
-  JEMALLOC_PREFIX=""
-else
-  JEMALLOC_PREFIX="je_"
-fi]
-)
-if test "x$JEMALLOC_PREFIX" = "x" ; then
-  AC_DEFINE([JEMALLOC_IS_MALLOC])
-else
-  JEMALLOC_CPREFIX=`echo ${JEMALLOC_PREFIX} | tr "a-z" "A-Z"`
-  AC_DEFINE_UNQUOTED([JEMALLOC_PREFIX], ["$JEMALLOC_PREFIX"])
-  AC_DEFINE_UNQUOTED([JEMALLOC_CPREFIX], ["$JEMALLOC_CPREFIX"])
-fi
-AC_SUBST([JEMALLOC_PREFIX])
-AC_SUBST([JEMALLOC_CPREFIX])
-
-AC_ARG_WITH([export],
-  [AS_HELP_STRING([--without-export], [disable exporting jemalloc public APIs])],
-  [if test "x$with_export" = "xno"; then
-  AC_DEFINE([JEMALLOC_EXPORT],[])
-fi]
-)
-
-public_syms="aligned_alloc calloc dallocx free mallctl mallctlbymib mallctlnametomib malloc malloc_conf malloc_message malloc_stats_print malloc_usable_size mallocx nallocx posix_memalign rallocx realloc sallocx sdallocx xallocx"
-dnl Check for additional platform-specific public API functions.
-AC_CHECK_FUNC([memalign],
-	      [AC_DEFINE([JEMALLOC_OVERRIDE_MEMALIGN], [ ])
-	       public_syms="${public_syms} memalign"])
-AC_CHECK_FUNC([valloc],
-	      [AC_DEFINE([JEMALLOC_OVERRIDE_VALLOC], [ ])
-	       public_syms="${public_syms} valloc"])
-
-dnl Check for allocator-related functions that should be wrapped.
-wrap_syms=
-if test "x${JEMALLOC_PREFIX}" = "x" ; then
-  AC_CHECK_FUNC([__libc_calloc],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_CALLOC], [ ])
-		 wrap_syms="${wrap_syms} __libc_calloc"])
-  AC_CHECK_FUNC([__libc_free],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_FREE], [ ])
-		 wrap_syms="${wrap_syms} __libc_free"])
-  AC_CHECK_FUNC([__libc_malloc],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_MALLOC], [ ])
-		 wrap_syms="${wrap_syms} __libc_malloc"])
-  AC_CHECK_FUNC([__libc_memalign],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_MEMALIGN], [ ])
-		 wrap_syms="${wrap_syms} __libc_memalign"])
-  AC_CHECK_FUNC([__libc_realloc],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_REALLOC], [ ])
-		 wrap_syms="${wrap_syms} __libc_realloc"])
-  AC_CHECK_FUNC([__libc_valloc],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___LIBC_VALLOC], [ ])
-		 wrap_syms="${wrap_syms} __libc_valloc"])
-  AC_CHECK_FUNC([__posix_memalign],
-		[AC_DEFINE([JEMALLOC_OVERRIDE___POSIX_MEMALIGN], [ ])
-		 wrap_syms="${wrap_syms} __posix_memalign"])
-fi
-
-case "${host}" in
-  *-*-mingw* | *-*-cygwin*)
-    wrap_syms="${wrap_syms} tls_callback"
-    ;;
-  *)
-    ;;
-esac
-
-dnl Mangle library-private APIs.
-AC_ARG_WITH([private_namespace],
-  [AS_HELP_STRING([--with-private-namespace=<prefix>], [Prefix to prepend to all library-private APIs])],
-  [JEMALLOC_PRIVATE_NAMESPACE="${with_private_namespace}je_"],
-  [JEMALLOC_PRIVATE_NAMESPACE="je_"]
-)
-AC_DEFINE_UNQUOTED([JEMALLOC_PRIVATE_NAMESPACE], [$JEMALLOC_PRIVATE_NAMESPACE])
-private_namespace="$JEMALLOC_PRIVATE_NAMESPACE"
-AC_SUBST([private_namespace])
-
-dnl Do not add suffix to installed files by default.
-AC_ARG_WITH([install_suffix],
-  [AS_HELP_STRING([--with-install-suffix=<suffix>], [Suffix to append to all installed files])],
-  [INSTALL_SUFFIX="$with_install_suffix"],
-  [INSTALL_SUFFIX=]
-)
-install_suffix="$INSTALL_SUFFIX"
-AC_SUBST([install_suffix])
-
-dnl Specify default malloc_conf.
-AC_ARG_WITH([malloc_conf],
-  [AS_HELP_STRING([--with-malloc-conf=<malloc_conf>], [config.malloc_conf options string])],
-  [JEMALLOC_CONFIG_MALLOC_CONF="$with_malloc_conf"],
-  [JEMALLOC_CONFIG_MALLOC_CONF=""]
-)
-config_malloc_conf="$JEMALLOC_CONFIG_MALLOC_CONF"
-AC_DEFINE_UNQUOTED([JEMALLOC_CONFIG_MALLOC_CONF], ["$config_malloc_conf"])
-
-dnl Substitute @je_@ in jemalloc_protos.h.in, primarily to make generation of
-dnl jemalloc_protos_jet.h easy.
-je_="je_"
-AC_SUBST([je_])
-
-cfgoutputs_in="Makefile.in"
-cfgoutputs_in="${cfgoutputs_in} jemalloc.pc.in"
-cfgoutputs_in="${cfgoutputs_in} doc/html.xsl.in"
-cfgoutputs_in="${cfgoutputs_in} doc/manpages.xsl.in"
-cfgoutputs_in="${cfgoutputs_in} doc/jemalloc.xml.in"
-cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_macros.h.in"
-cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_protos.h.in"
-cfgoutputs_in="${cfgoutputs_in} include/jemalloc/jemalloc_typedefs.h.in"
-cfgoutputs_in="${cfgoutputs_in} include/jemalloc/internal/jemalloc_preamble.h.in"
-cfgoutputs_in="${cfgoutputs_in} test/test.sh.in"
-cfgoutputs_in="${cfgoutputs_in} test/include/test/jemalloc_test.h.in"
-
-cfgoutputs_out="Makefile"
-cfgoutputs_out="${cfgoutputs_out} jemalloc.pc"
-cfgoutputs_out="${cfgoutputs_out} doc/html.xsl"
-cfgoutputs_out="${cfgoutputs_out} doc/manpages.xsl"
-cfgoutputs_out="${cfgoutputs_out} doc/jemalloc.xml"
-cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_macros.h"
-cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_protos.h"
-cfgoutputs_out="${cfgoutputs_out} include/jemalloc/jemalloc_typedefs.h"
-cfgoutputs_out="${cfgoutputs_out} include/jemalloc/internal/jemalloc_preamble.h"
-cfgoutputs_out="${cfgoutputs_out} test/test.sh"
-cfgoutputs_out="${cfgoutputs_out} test/include/test/jemalloc_test.h"
-
-cfgoutputs_tup="Makefile"
-cfgoutputs_tup="${cfgoutputs_tup} jemalloc.pc:jemalloc.pc.in"
-cfgoutputs_tup="${cfgoutputs_tup} doc/html.xsl:doc/html.xsl.in"
-cfgoutputs_tup="${cfgoutputs_tup} doc/manpages.xsl:doc/manpages.xsl.in"
-cfgoutputs_tup="${cfgoutputs_tup} doc/jemalloc.xml:doc/jemalloc.xml.in"
-cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_macros.h:include/jemalloc/jemalloc_macros.h.in"
-cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_protos.h:include/jemalloc/jemalloc_protos.h.in"
-cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/jemalloc_typedefs.h:include/jemalloc/jemalloc_typedefs.h.in"
-cfgoutputs_tup="${cfgoutputs_tup} include/jemalloc/internal/jemalloc_preamble.h"
-cfgoutputs_tup="${cfgoutputs_tup} test/test.sh:test/test.sh.in"
-cfgoutputs_tup="${cfgoutputs_tup} test/include/test/jemalloc_test.h:test/include/test/jemalloc_test.h.in"
-
-cfghdrs_in="include/jemalloc/jemalloc_defs.h.in"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/jemalloc_internal_defs.h.in"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/private_symbols.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/private_namespace.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/public_namespace.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/public_unnamespace.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/internal/size_classes.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc_rename.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc_mangle.sh"
-cfghdrs_in="${cfghdrs_in} include/jemalloc/jemalloc.sh"
-cfghdrs_in="${cfghdrs_in} test/include/test/jemalloc_test_defs.h.in"
-
-cfghdrs_out="include/jemalloc/jemalloc_defs.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc${install_suffix}.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/private_symbols.awk"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/private_symbols_jet.awk"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_symbols.txt"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_namespace.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/public_unnamespace.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/size_classes.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_protos_jet.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_rename.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_mangle.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/jemalloc_mangle_jet.h"
-cfghdrs_out="${cfghdrs_out} include/jemalloc/internal/jemalloc_internal_defs.h"
-cfghdrs_out="${cfghdrs_out} test/include/test/jemalloc_test_defs.h"
-
-cfghdrs_tup="include/jemalloc/jemalloc_defs.h:include/jemalloc/jemalloc_defs.h.in"
-cfghdrs_tup="${cfghdrs_tup} include/jemalloc/internal/jemalloc_internal_defs.h:include/jemalloc/internal/jemalloc_internal_defs.h.in"
-cfghdrs_tup="${cfghdrs_tup} test/include/test/jemalloc_test_defs.h:test/include/test/jemalloc_test_defs.h.in"
-
-dnl Do not compile with debugging by default.
-AC_ARG_ENABLE([debug],
-  [AS_HELP_STRING([--enable-debug],
-                  [Build debugging code])],
-[if test "x$enable_debug" = "xno" ; then
-  enable_debug="0"
-else
-  enable_debug="1"
-fi
-],
-[enable_debug="0"]
-)
-if test "x$enable_debug" = "x1" ; then
-  AC_DEFINE([JEMALLOC_DEBUG], [ ])
-fi
-if test "x$enable_debug" = "x1" ; then
-  AC_DEFINE([JEMALLOC_DEBUG], [ ])
-fi
-AC_SUBST([enable_debug])
-
-dnl Only optimize if not debugging.
-if test "x$enable_debug" = "x0" ; then
-  if test "x$GCC" = "xyes" ; then
-    JE_CFLAGS_ADD([-O3])
-    JE_CXXFLAGS_ADD([-O3])
-    JE_CFLAGS_ADD([-funroll-loops])
-  elif test "x$je_cv_msvc" = "xyes" ; then
-    JE_CFLAGS_ADD([-O2])
-    JE_CXXFLAGS_ADD([-O2])
-  else
-    JE_CFLAGS_ADD([-O])
-    JE_CXXFLAGS_ADD([-O])
-  fi
-fi
-
-dnl Enable statistics calculation by default.
-AC_ARG_ENABLE([stats],
-  [AS_HELP_STRING([--disable-stats],
-                  [Disable statistics calculation/reporting])],
-[if test "x$enable_stats" = "xno" ; then
-  enable_stats="0"
-else
-  enable_stats="1"
-fi
-],
-[enable_stats="1"]
-)
-if test "x$enable_stats" = "x1" ; then
-  AC_DEFINE([JEMALLOC_STATS], [ ])
-fi
-AC_SUBST([enable_stats])
-
-dnl Do not enable profiling by default.
-AC_ARG_ENABLE([prof],
-  [AS_HELP_STRING([--enable-prof], [Enable allocation profiling])],
-[if test "x$enable_prof" = "xno" ; then
-  enable_prof="0"
-else
-  enable_prof="1"
-fi
-],
-[enable_prof="0"]
-)
-if test "x$enable_prof" = "x1" ; then
-  backtrace_method=""
-else
-  backtrace_method="N/A"
-fi
-
-AC_ARG_ENABLE([prof-libunwind],
-  [AS_HELP_STRING([--enable-prof-libunwind], [Use libunwind for backtracing])],
-[if test "x$enable_prof_libunwind" = "xno" ; then
-  enable_prof_libunwind="0"
-else
-  enable_prof_libunwind="1"
-fi
-],
-[enable_prof_libunwind="0"]
-)
-AC_ARG_WITH([static_libunwind],
-  [AS_HELP_STRING([--with-static-libunwind=<libunwind.a>],
-  [Path to static libunwind library; use rather than dynamically linking])],
-if test "x$with_static_libunwind" = "xno" ; then
-  LUNWIND="-lunwind"
-else
-  if test ! -f "$with_static_libunwind" ; then
-    AC_MSG_ERROR([Static libunwind not found: $with_static_libunwind])
-  fi
-  LUNWIND="$with_static_libunwind"
-fi,
-  LUNWIND="-lunwind"
-)
-if test "x$backtrace_method" = "x" -a "x$enable_prof_libunwind" = "x1" ; then
-  AC_CHECK_HEADERS([libunwind.h], , [enable_prof_libunwind="0"])
-  if test "x$LUNWIND" = "x-lunwind" ; then
-    AC_CHECK_LIB([unwind], [unw_backtrace], [JE_APPEND_VS(LIBS, $LUNWIND)],
-                 [enable_prof_libunwind="0"])
-  else
-    JE_APPEND_VS(LIBS, $LUNWIND)
-  fi
-  if test "x${enable_prof_libunwind}" = "x1" ; then
-    backtrace_method="libunwind"
-    AC_DEFINE([JEMALLOC_PROF_LIBUNWIND], [ ])
-  fi
-fi
-
-AC_ARG_ENABLE([prof-libgcc],
-  [AS_HELP_STRING([--disable-prof-libgcc],
-  [Do not use libgcc for backtracing])],
-[if test "x$enable_prof_libgcc" = "xno" ; then
-  enable_prof_libgcc="0"
-else
-  enable_prof_libgcc="1"
-fi
-],
-[enable_prof_libgcc="1"]
-)
-if test "x$backtrace_method" = "x" -a "x$enable_prof_libgcc" = "x1" \
-     -a "x$GCC" = "xyes" ; then
-  AC_CHECK_HEADERS([unwind.h], , [enable_prof_libgcc="0"])
-  if test "x${enable_prof_libgcc}" = "x1" ; then
-    AC_CHECK_LIB([gcc], [_Unwind_Backtrace], [JE_APPEND_VS(LIBS, -lgcc)], [enable_prof_libgcc="0"])
-  fi
-  if test "x${enable_prof_libgcc}" = "x1" ; then
-    backtrace_method="libgcc"
-    AC_DEFINE([JEMALLOC_PROF_LIBGCC], [ ])
-  fi
-else
-  enable_prof_libgcc="0"
-fi
-
-AC_ARG_ENABLE([prof-gcc],
-  [AS_HELP_STRING([--disable-prof-gcc],
-  [Do not use gcc intrinsics for backtracing])],
-[if test "x$enable_prof_gcc" = "xno" ; then
-  enable_prof_gcc="0"
-else
-  enable_prof_gcc="1"
-fi
-],
-[enable_prof_gcc="1"]
-)
-if test "x$backtrace_method" = "x" -a "x$enable_prof_gcc" = "x1" \
-     -a "x$GCC" = "xyes" ; then
-  JE_CFLAGS_ADD([-fno-omit-frame-pointer])
-  backtrace_method="gcc intrinsics"
-  AC_DEFINE([JEMALLOC_PROF_GCC], [ ])
-else
-  enable_prof_gcc="0"
-fi
-
-if test "x$backtrace_method" = "x" ; then
-  backtrace_method="none (disabling profiling)"
-  enable_prof="0"
-fi
-AC_MSG_CHECKING([configured backtracing method])
-AC_MSG_RESULT([$backtrace_method])
-if test "x$enable_prof" = "x1" ; then
-  dnl Heap profiling uses the log(3) function.
-  JE_APPEND_VS(LIBS, $LM)
-
-  AC_DEFINE([JEMALLOC_PROF], [ ])
-fi
-AC_SUBST([enable_prof])
-
-dnl Indicate whether adjacent virtual memory mappings automatically coalesce
-dnl (and fragment on demand).
-if test "x${maps_coalesce}" = "x1" ; then
-  AC_DEFINE([JEMALLOC_MAPS_COALESCE], [ ])
-fi
-
-dnl Indicate whether to retain memory (rather than using munmap()) by default.
-if test "x$default_retain" = "x1" ; then
-  AC_DEFINE([JEMALLOC_RETAIN], [ ])
-fi
-
-dnl Enable allocation from DSS if supported by the OS.
-have_dss="1"
-dnl Check whether the BSD/SUSv1 sbrk() exists.  If not, disable DSS support.
-AC_CHECK_FUNC([sbrk], [have_sbrk="1"], [have_sbrk="0"])
-if test "x$have_sbrk" = "x1" ; then
-  if test "x$sbrk_deprecated" = "x1" ; then
-    AC_MSG_RESULT([Disabling dss allocation because sbrk is deprecated])
-    have_dss="0"
-  fi
-else
-  have_dss="0"
-fi
-
-if test "x$have_dss" = "x1" ; then
-  AC_DEFINE([JEMALLOC_DSS], [ ])
-fi
-
-dnl Support the junk/zero filling option by default.
-AC_ARG_ENABLE([fill],
-  [AS_HELP_STRING([--disable-fill], [Disable support for junk/zero filling])],
-[if test "x$enable_fill" = "xno" ; then
-  enable_fill="0"
-else
-  enable_fill="1"
-fi
-],
-[enable_fill="1"]
-)
-if test "x$enable_fill" = "x1" ; then
-  AC_DEFINE([JEMALLOC_FILL], [ ])
-fi
-AC_SUBST([enable_fill])
-
-dnl Disable utrace(2)-based tracing by default.
-AC_ARG_ENABLE([utrace],
-  [AS_HELP_STRING([--enable-utrace], [Enable utrace(2)-based tracing])],
-[if test "x$enable_utrace" = "xno" ; then
-  enable_utrace="0"
-else
-  enable_utrace="1"
-fi
-],
-[enable_utrace="0"]
-)
-JE_COMPILABLE([utrace(2)], [
-#include <sys/types.h>
-#include <sys/param.h>
-#include <sys/time.h>
-#include <sys/uio.h>
-#include <sys/ktrace.h>
-], [
-	utrace((void *)0, 0);
-], [je_cv_utrace])
-if test "x${je_cv_utrace}" = "xno" ; then
-  enable_utrace="0"
-fi
-if test "x$enable_utrace" = "x1" ; then
-  AC_DEFINE([JEMALLOC_UTRACE], [ ])
-fi
-AC_SUBST([enable_utrace])
-
-dnl Do not support the xmalloc option by default.
-AC_ARG_ENABLE([xmalloc],
-  [AS_HELP_STRING([--enable-xmalloc], [Support xmalloc option])],
-[if test "x$enable_xmalloc" = "xno" ; then
-  enable_xmalloc="0"
-else
-  enable_xmalloc="1"
-fi
-],
-[enable_xmalloc="0"]
-)
-if test "x$enable_xmalloc" = "x1" ; then
-  AC_DEFINE([JEMALLOC_XMALLOC], [ ])
-fi
-AC_SUBST([enable_xmalloc])
-
-dnl Support cache-oblivious allocation alignment by default.
-AC_ARG_ENABLE([cache-oblivious],
-  [AS_HELP_STRING([--disable-cache-oblivious],
-                  [Disable support for cache-oblivious allocation alignment])],
-[if test "x$enable_cache_oblivious" = "xno" ; then
-  enable_cache_oblivious="0"
-else
-  enable_cache_oblivious="1"
-fi
-],
-[enable_cache_oblivious="1"]
-)
-if test "x$enable_cache_oblivious" = "x1" ; then
-  AC_DEFINE([JEMALLOC_CACHE_OBLIVIOUS], [ ])
-fi
-AC_SUBST([enable_cache_oblivious])
-
-dnl Do not log by default.
-AC_ARG_ENABLE([log],
-  [AS_HELP_STRING([--enable-log], [Support debug logging])],
-[if test "x$enable_log" = "xno" ; then
-  enable_log="0"
-else
-  enable_log="1"
-fi
-],
-[enable_log="0"]
-)
-if test "x$enable_log" = "x1" ; then
-  AC_DEFINE([JEMALLOC_LOG], [ ])
-fi
-AC_SUBST([enable_log])
-
-
-JE_COMPILABLE([a program using __builtin_unreachable], [
-void foo (void) {
-  __builtin_unreachable();
-}
-], [
-	{
-		foo();
-	}
-], [je_cv_gcc_builtin_unreachable])
-if test "x${je_cv_gcc_builtin_unreachable}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_INTERNAL_UNREACHABLE], [__builtin_unreachable])
-else
-  AC_DEFINE([JEMALLOC_INTERNAL_UNREACHABLE], [abort])
-fi
-
-dnl ============================================================================
-dnl Check for  __builtin_ffsl(), then ffsl(3), and fail if neither are found.
-dnl One of those two functions should (theoretically) exist on all platforms
-dnl that jemalloc currently has a chance of functioning on without modification.
-dnl We additionally assume ffs[ll]() or __builtin_ffs[ll]() are defined if
-dnl ffsl() or __builtin_ffsl() are defined, respectively.
-JE_COMPILABLE([a program using __builtin_ffsl], [
-#include <stdio.h>
-#include <strings.h>
-#include <string.h>
-], [
-	{
-		int rv = __builtin_ffsl(0x08);
-		printf("%d\n", rv);
-	}
-], [je_cv_gcc_builtin_ffsl])
-if test "x${je_cv_gcc_builtin_ffsl}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_INTERNAL_FFSLL], [__builtin_ffsll])
-  AC_DEFINE([JEMALLOC_INTERNAL_FFSL], [__builtin_ffsl])
-  AC_DEFINE([JEMALLOC_INTERNAL_FFS], [__builtin_ffs])
-else
-  JE_COMPILABLE([a program using ffsl], [
-  #include <stdio.h>
-  #include <strings.h>
-  #include <string.h>
-  ], [
-	{
-		int rv = ffsl(0x08);
-		printf("%d\n", rv);
-	}
-  ], [je_cv_function_ffsl])
-  if test "x${je_cv_function_ffsl}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_INTERNAL_FFSLL], [ffsll])
-    AC_DEFINE([JEMALLOC_INTERNAL_FFSL], [ffsl])
-    AC_DEFINE([JEMALLOC_INTERNAL_FFS], [ffs])
-  else
-    AC_MSG_ERROR([Cannot build without ffsl(3) or __builtin_ffsl()])
-  fi
-fi
-
-AC_ARG_WITH([lg_quantum],
-  [AS_HELP_STRING([--with-lg-quantum=<lg-quantum>],
-   [Base 2 log of minimum allocation alignment])],
-  [LG_QUANTA="$with_lg_quantum"],
-  [LG_QUANTA="3 4"])
-if test "x$with_lg_quantum" != "x" ; then
-  AC_DEFINE_UNQUOTED([LG_QUANTUM], [$with_lg_quantum])
-fi
-
-AC_ARG_WITH([lg_page],
-  [AS_HELP_STRING([--with-lg-page=<lg-page>], [Base 2 log of system page size])],
-  [LG_PAGE="$with_lg_page"], [LG_PAGE="detect"])
-if test "x$LG_PAGE" = "xdetect"; then
-  AC_CACHE_CHECK([LG_PAGE],
-               [je_cv_lg_page],
-               AC_RUN_IFELSE([AC_LANG_PROGRAM(
-[[
-#include <strings.h>
-#ifdef _WIN32
-#include <windows.h>
-#else
-#include <unistd.h>
-#endif
-#include <stdio.h>
-]],
-[[
-    int result;
-    FILE *f;
-
-#ifdef _WIN32
-    SYSTEM_INFO si;
-    GetSystemInfo(&si);
-    result = si.dwPageSize;
-#else
-    result = sysconf(_SC_PAGESIZE);
-#endif
-    if (result == -1) {
-	return 1;
-    }
-    result = JEMALLOC_INTERNAL_FFSL(result) - 1;
-
-    f = fopen("conftest.out", "w");
-    if (f == NULL) {
-	return 1;
-    }
-    fprintf(f, "%d", result);
-    fclose(f);
-
-    return 0;
-]])],
-                             [je_cv_lg_page=`cat conftest.out`],
-                             [je_cv_lg_page=undefined],
-                             [je_cv_lg_page=12]))
-fi
-if test "x${je_cv_lg_page}" != "x" ; then
-  LG_PAGE="${je_cv_lg_page}"
-fi
-if test "x${LG_PAGE}" != "xundefined" ; then
-   AC_DEFINE_UNQUOTED([LG_PAGE], [$LG_PAGE])
-else
-   AC_MSG_ERROR([cannot determine value for LG_PAGE])
-fi
-
-AC_ARG_WITH([lg_hugepage],
-  [AS_HELP_STRING([--with-lg-hugepage=<lg-hugepage>],
-   [Base 2 log of system huge page size])],
-  [je_cv_lg_hugepage="${with_lg_hugepage}"],
-  [je_cv_lg_hugepage=""])
-if test "x${je_cv_lg_hugepage}" = "x" ; then
-  dnl Look in /proc/meminfo (Linux-specific) for information on the default huge
-  dnl page size, if any.  The relevant line looks like:
-  dnl
-  dnl   Hugepagesize:       2048 kB
-  if test -e "/proc/meminfo" ; then
-    hpsk=[`cat /proc/meminfo 2>/dev/null | \
-          grep -e '^Hugepagesize:[[:space:]]\+[0-9]\+[[:space:]]kB$' | \
-          awk '{print $2}'`]
-    if test "x${hpsk}" != "x" ; then
-      je_cv_lg_hugepage=10
-      while test "${hpsk}" -gt 1 ; do
-        hpsk="$((hpsk / 2))"
-        je_cv_lg_hugepage="$((je_cv_lg_hugepage + 1))"
-      done
-    fi
-  fi
-
-  dnl Set default if unable to automatically configure.
-  if test "x${je_cv_lg_hugepage}" = "x" ; then
-    je_cv_lg_hugepage=21
-  fi
-fi
-if test "x${LG_PAGE}" != "xundefined" -a \
-        "${je_cv_lg_hugepage}" -lt "${LG_PAGE}" ; then
-  AC_MSG_ERROR([Huge page size (2^${je_cv_lg_hugepage}) must be at least page size (2^${LG_PAGE})])
-fi
-AC_DEFINE_UNQUOTED([LG_HUGEPAGE], [${je_cv_lg_hugepage}])
-
-AC_ARG_WITH([lg_page_sizes],
-  [AS_HELP_STRING([--with-lg-page-sizes=<lg-page-sizes>],
-   [Base 2 logs of system page sizes to support])],
-  [LG_PAGE_SIZES="$with_lg_page_sizes"], [LG_PAGE_SIZES="$LG_PAGE"])
-
-dnl ============================================================================
-dnl jemalloc configuration.
-dnl
-
-AC_ARG_WITH([version],
-  [AS_HELP_STRING([--with-version=<major>.<minor>.<bugfix>-<nrev>-g<gid>],
-   [Version string])],
-  [
-    echo "${with_version}" | grep ['^[0-9]\+\.[0-9]\+\.[0-9]\+-[0-9]\+-g[0-9a-f]\+$'] 2>&1 1>/dev/null
-    if test $? -eq 0 ; then
-      echo "$with_version" > "${objroot}VERSION"
-    else
-      echo "${with_version}" | grep ['^VERSION$'] 2>&1 1>/dev/null
-      if test $? -ne 0 ; then
-        AC_MSG_ERROR([${with_version} does not match <major>.<minor>.<bugfix>-<nrev>-g<gid> or VERSION])
-      fi
-    fi
-  ], [
-    dnl Set VERSION if source directory is inside a git repository.
-    if test "x`test ! \"${srcroot}\" && cd \"${srcroot}\"; git rev-parse --is-inside-work-tree 2>/dev/null`" = "xtrue" ; then
-      dnl Pattern globs aren't powerful enough to match both single- and
-      dnl double-digit version numbers, so iterate over patterns to support up
-      dnl to version 99.99.99 without any accidental matches.
-      for pattern in ['[0-9].[0-9].[0-9]' '[0-9].[0-9].[0-9][0-9]' \
-                     '[0-9].[0-9][0-9].[0-9]' '[0-9].[0-9][0-9].[0-9][0-9]' \
-                     '[0-9][0-9].[0-9].[0-9]' '[0-9][0-9].[0-9].[0-9][0-9]' \
-                     '[0-9][0-9].[0-9][0-9].[0-9]' \
-                     '[0-9][0-9].[0-9][0-9].[0-9][0-9]']; do
-        (test ! "${srcroot}" && cd "${srcroot}"; git describe --long --abbrev=40 --match="${pattern}") > "${objroot}VERSION.tmp" 2>/dev/null
-        if test $? -eq 0 ; then
-          mv "${objroot}VERSION.tmp" "${objroot}VERSION"
-          break
-        fi
-      done
-    fi
-    rm -f "${objroot}VERSION.tmp"
-  ])
-
-if test ! -e "${objroot}VERSION" ; then
-  if test ! -e "${srcroot}VERSION" ; then
-    AC_MSG_RESULT(
-      [Missing VERSION file, and unable to generate it; creating bogus VERSION])
-    echo "0.0.0-0-g0000000000000000000000000000000000000000" > "${objroot}VERSION"
-  else
-    cp ${srcroot}VERSION ${objroot}VERSION
-  fi
-fi
-jemalloc_version=`cat "${objroot}VERSION"`
-jemalloc_version_major=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]1}'`
-jemalloc_version_minor=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]2}'`
-jemalloc_version_bugfix=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]3}'`
-jemalloc_version_nrev=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]4}'`
-jemalloc_version_gid=`echo ${jemalloc_version} | tr ".g-" " " | awk '{print [$]5}'`
-AC_SUBST([jemalloc_version])
-AC_SUBST([jemalloc_version_major])
-AC_SUBST([jemalloc_version_minor])
-AC_SUBST([jemalloc_version_bugfix])
-AC_SUBST([jemalloc_version_nrev])
-AC_SUBST([jemalloc_version_gid])
-
-dnl ============================================================================
-dnl Configure pthreads.
-
-if test "x$abi" != "xpecoff" ; then
-  AC_DEFINE([JEMALLOC_HAVE_PTHREAD], [ ])
-  AC_CHECK_HEADERS([pthread.h], , [AC_MSG_ERROR([pthread.h is missing])])
-  dnl Some systems may embed pthreads functionality in libc; check for libpthread
-  dnl first, but try libc too before failing.
-  AC_CHECK_LIB([pthread], [pthread_create], [JE_APPEND_VS(LIBS, -lpthread)],
-               [AC_SEARCH_LIBS([pthread_create], , ,
-                               AC_MSG_ERROR([libpthread is missing]))])
-  wrap_syms="${wrap_syms} pthread_create"
-  have_pthread="1"
-  dnl Check if we have dlsym support.
-  have_dlsym="1"
-  AC_CHECK_HEADERS([dlfcn.h],
-    AC_CHECK_FUNC([dlsym], [],
-      [AC_CHECK_LIB([dl], [dlsym], [LIBS="$LIBS -ldl"], [have_dlsym="0"])]),
-    [have_dlsym="0"])
-  if test "x$have_dlsym" = "x1" ; then
-    AC_DEFINE([JEMALLOC_HAVE_DLSYM], [ ])
-  fi
-  JE_COMPILABLE([pthread_atfork(3)], [
-#include <pthread.h>
-], [
-  pthread_atfork((void *)0, (void *)0, (void *)0);
-], [je_cv_pthread_atfork])
-  if test "x${je_cv_pthread_atfork}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_HAVE_PTHREAD_ATFORK], [ ])
-  fi
-  dnl Check if pthread_setname_np is available with the expected API.
-  JE_COMPILABLE([pthread_setname_np(3)], [
-#include <pthread.h>
-], [
-  pthread_setname_np(pthread_self(), "setname_test");
-], [je_cv_pthread_setname_np])
-  if test "x${je_cv_pthread_setname_np}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_HAVE_PTHREAD_SETNAME_NP], [ ])
-  fi
-fi
-
-JE_APPEND_VS(CPPFLAGS, -D_REENTRANT)
-
-dnl Check whether clock_gettime(2) is in libc or librt.
-AC_SEARCH_LIBS([clock_gettime], [rt])
-
-dnl Cray wrapper compiler often adds `-lrt` when using `-static`. Check with
-dnl `-dynamic` as well in case a user tries to dynamically link in jemalloc
-if test "x$je_cv_cray_prgenv_wrapper" = "xyes" ; then
-  if test "$ac_cv_search_clock_gettime" != "-lrt"; then
-    JE_CFLAGS_SAVE()
-
-    unset ac_cv_search_clock_gettime
-    JE_CFLAGS_ADD([-dynamic])
-    AC_SEARCH_LIBS([clock_gettime], [rt])
-
-    JE_CFLAGS_RESTORE()
-  fi
-fi
-
-dnl check for CLOCK_MONOTONIC_COARSE (Linux-specific).
-JE_COMPILABLE([clock_gettime(CLOCK_MONOTONIC_COARSE, ...)], [
-#include <time.h>
-], [
-	struct timespec ts;
-
-	clock_gettime(CLOCK_MONOTONIC_COARSE, &ts);
-], [je_cv_clock_monotonic_coarse])
-if test "x${je_cv_clock_monotonic_coarse}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE])
-fi
-
-dnl check for CLOCK_MONOTONIC.
-JE_COMPILABLE([clock_gettime(CLOCK_MONOTONIC, ...)], [
-#include <unistd.h>
-#include <time.h>
-], [
-	struct timespec ts;
-
-	clock_gettime(CLOCK_MONOTONIC, &ts);
-#if !defined(_POSIX_MONOTONIC_CLOCK) || _POSIX_MONOTONIC_CLOCK < 0
-#  error _POSIX_MONOTONIC_CLOCK missing/invalid
-#endif
-], [je_cv_clock_monotonic])
-if test "x${je_cv_clock_monotonic}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_CLOCK_MONOTONIC])
-fi
-
-dnl Check for mach_absolute_time().
-JE_COMPILABLE([mach_absolute_time()], [
-#include <mach/mach_time.h>
-], [
-	mach_absolute_time();
-], [je_cv_mach_absolute_time])
-if test "x${je_cv_mach_absolute_time}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_MACH_ABSOLUTE_TIME])
-fi
-
-dnl Use syscall(2) (if available) by default.
-AC_ARG_ENABLE([syscall],
-  [AS_HELP_STRING([--disable-syscall], [Disable use of syscall(2)])],
-[if test "x$enable_syscall" = "xno" ; then
-  enable_syscall="0"
-else
-  enable_syscall="1"
-fi
-],
-[enable_syscall="1"]
-)
-if test "x$enable_syscall" = "x1" ; then
-  dnl Check if syscall(2) is usable.  Treat warnings as errors, so that e.g. OS
-  dnl X 10.12's deprecation warning prevents use.
-  JE_CFLAGS_SAVE()
-  JE_CFLAGS_ADD([-Werror])
-  JE_COMPILABLE([syscall(2)], [
-#include <sys/syscall.h>
-#include <unistd.h>
-], [
-	syscall(SYS_write, 2, "hello", 5);
-],
-                [je_cv_syscall])
-  JE_CFLAGS_RESTORE()
-  if test "x$je_cv_syscall" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_USE_SYSCALL], [ ])
-  fi
-fi
-
-dnl Check if the GNU-specific secure_getenv function exists.
-AC_CHECK_FUNC([secure_getenv],
-              [have_secure_getenv="1"],
-              [have_secure_getenv="0"]
-             )
-if test "x$have_secure_getenv" = "x1" ; then
-  AC_DEFINE([JEMALLOC_HAVE_SECURE_GETENV], [ ])
-fi
-
-dnl Check if the GNU-specific sched_getcpu function exists.
-AC_CHECK_FUNC([sched_getcpu],
-              [have_sched_getcpu="1"],
-              [have_sched_getcpu="0"]
-             )
-if test "x$have_sched_getcpu" = "x1" ; then
-  AC_DEFINE([JEMALLOC_HAVE_SCHED_GETCPU], [ ])
-fi
-
-dnl Check if the GNU-specific sched_setaffinity function exists.
-AC_CHECK_FUNC([sched_setaffinity],
-              [have_sched_setaffinity="1"],
-              [have_sched_setaffinity="0"]
-             )
-if test "x$have_sched_setaffinity" = "x1" ; then
-  AC_DEFINE([JEMALLOC_HAVE_SCHED_SETAFFINITY], [ ])
-fi
-
-dnl Check if the Solaris/BSD issetugid function exists.
-AC_CHECK_FUNC([issetugid],
-              [have_issetugid="1"],
-              [have_issetugid="0"]
-             )
-if test "x$have_issetugid" = "x1" ; then
-  AC_DEFINE([JEMALLOC_HAVE_ISSETUGID], [ ])
-fi
-
-dnl Check whether the BSD-specific _malloc_thread_cleanup() exists.  If so, use
-dnl it rather than pthreads TSD cleanup functions to support cleanup during
-dnl thread exit, in order to avoid pthreads library recursion during
-dnl bootstrapping.
-AC_CHECK_FUNC([_malloc_thread_cleanup],
-              [have__malloc_thread_cleanup="1"],
-              [have__malloc_thread_cleanup="0"]
-             )
-if test "x$have__malloc_thread_cleanup" = "x1" ; then
-  AC_DEFINE([JEMALLOC_MALLOC_THREAD_CLEANUP], [ ])
-  wrap_syms="${wrap_syms} _malloc_thread_cleanup"
-  force_tls="1"
-fi
-
-dnl Check whether the BSD-specific _pthread_mutex_init_calloc_cb() exists.  If
-dnl so, mutex initialization causes allocation, and we need to implement this
-dnl callback function in order to prevent recursive allocation.
-AC_CHECK_FUNC([_pthread_mutex_init_calloc_cb],
-              [have__pthread_mutex_init_calloc_cb="1"],
-              [have__pthread_mutex_init_calloc_cb="0"]
-             )
-if test "x$have__pthread_mutex_init_calloc_cb" = "x1" ; then
-  AC_DEFINE([JEMALLOC_MUTEX_INIT_CB])
-  wrap_syms="${wrap_syms} _malloc_prefork _malloc_postfork"
-fi
-
-dnl Disable lazy locking by default.
-AC_ARG_ENABLE([lazy_lock],
-  [AS_HELP_STRING([--enable-lazy-lock],
-  [Enable lazy locking (only lock when multi-threaded)])],
-[if test "x$enable_lazy_lock" = "xno" ; then
-  enable_lazy_lock="0"
-else
-  enable_lazy_lock="1"
-fi
-],
-[enable_lazy_lock=""]
-)
-if test "x${enable_lazy_lock}" = "x" ; then
-  if test "x${force_lazy_lock}" = "x1" ; then
-    AC_MSG_RESULT([Forcing lazy-lock to avoid allocator/threading bootstrap issues])
-    enable_lazy_lock="1"
-  else
-    enable_lazy_lock="0"
-  fi
-fi
-if test "x${enable_lazy_lock}" = "x1" -a "x${abi}" = "xpecoff" ; then
-  AC_MSG_RESULT([Forcing no lazy-lock because thread creation monitoring is unimplemented])
-  enable_lazy_lock="0"
-fi
-if test "x$enable_lazy_lock" = "x1" ; then
-  if test "x$have_dlsym" = "x1" ; then
-    AC_DEFINE([JEMALLOC_LAZY_LOCK], [ ])
-  else
-    AC_MSG_ERROR([Missing dlsym support: lazy-lock cannot be enabled.])
-  fi
-fi
-AC_SUBST([enable_lazy_lock])
-
-dnl Automatically configure TLS.
-if test "x${force_tls}" = "x1" ; then
-  enable_tls="1"
-elif test "x${force_tls}" = "x0" ; then
-  enable_tls="0"
-else
-  enable_tls="1"
-fi
-if test "x${enable_tls}" = "x1" ; then
-AC_MSG_CHECKING([for TLS])
-AC_COMPILE_IFELSE([AC_LANG_PROGRAM(
-[[
-    __thread int x;
-]], [[
-    x = 42;
-
-    return 0;
-]])],
-              AC_MSG_RESULT([yes]),
-              AC_MSG_RESULT([no])
-              enable_tls="0")
-else
-  enable_tls="0"
-fi
-AC_SUBST([enable_tls])
-if test "x${enable_tls}" = "x1" ; then
-  AC_DEFINE_UNQUOTED([JEMALLOC_TLS], [ ])
-fi
-
-dnl ============================================================================
-dnl Check for C11 atomics.
-
-JE_COMPILABLE([C11 atomics], [
-#include <stdint.h>
-#if (__STDC_VERSION__ >= 201112L) && !defined(__STDC_NO_ATOMICS__)
-#include <stdatomic.h>
-#else
-#error Atomics not available
-#endif
-], [
-    uint64_t *p = (uint64_t *)0;
-    uint64_t x = 1;
-    volatile atomic_uint_least64_t *a = (volatile atomic_uint_least64_t *)p;
-    uint64_t r = atomic_fetch_add(a, x) + x;
-    return r == 0;
-], [je_cv_c11_atomics])
-if test "x${je_cv_c11_atomics}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_C11_ATOMICS])
-fi
-
-dnl ============================================================================
-dnl Check for GCC-style __atomic atomics.
-
-JE_COMPILABLE([GCC __atomic atomics], [
-], [
-    int x = 0;
-    int val = 1;
-    int y = __atomic_fetch_add(&x, val, __ATOMIC_RELAXED);
-    int after_add = x;
-    return after_add == 1;
-], [je_cv_gcc_atomic_atomics])
-if test "x${je_cv_gcc_atomic_atomics}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_GCC_ATOMIC_ATOMICS])
-fi
-
-dnl ============================================================================
-dnl Check for GCC-style __sync atomics.
-
-JE_COMPILABLE([GCC __sync atomics], [
-], [
-    int x = 0;
-    int before_add = __sync_fetch_and_add(&x, 1);
-    int after_add = x;
-    return (before_add == 0) && (after_add == 1);
-], [je_cv_gcc_sync_atomics])
-if test "x${je_cv_gcc_sync_atomics}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_GCC_SYNC_ATOMICS])
-fi
-
-dnl ============================================================================
-dnl Check for atomic(3) operations as provided on Darwin.
-dnl We need this not for the atomic operations (which are provided above), but
-dnl rather for the OSSpinLock type it exposes.
-
-JE_COMPILABLE([Darwin OSAtomic*()], [
-#include <libkern/OSAtomic.h>
-#include <inttypes.h>
-], [
-	{
-		int32_t x32 = 0;
-		volatile int32_t *x32p = &x32;
-		OSAtomicAdd32(1, x32p);
-	}
-	{
-		int64_t x64 = 0;
-		volatile int64_t *x64p = &x64;
-		OSAtomicAdd64(1, x64p);
-	}
-], [je_cv_osatomic])
-if test "x${je_cv_osatomic}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_OSATOMIC], [ ])
-fi
-
-dnl ============================================================================
-dnl Check for madvise(2).
-
-JE_COMPILABLE([madvise(2)], [
-#include <sys/mman.h>
-], [
-	madvise((void *)0, 0, 0);
-], [je_cv_madvise])
-if test "x${je_cv_madvise}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_MADVISE], [ ])
-
-  dnl Check for madvise(..., MADV_FREE).
-  JE_COMPILABLE([madvise(..., MADV_FREE)], [
-#include <sys/mman.h>
-], [
-	madvise((void *)0, 0, MADV_FREE);
-], [je_cv_madv_free])
-  if test "x${je_cv_madv_free}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_PURGE_MADVISE_FREE], [ ])
-  elif test "x${je_cv_madvise}" = "xyes" ; then
-    case "${host_cpu}" in i686|x86_64)
-        case "${host}" in *-*-linux*)
-            AC_DEFINE([JEMALLOC_PURGE_MADVISE_FREE], [ ])
-            AC_DEFINE([JEMALLOC_DEFINE_MADVISE_FREE], [ ])
-	    ;;
-        esac
-        ;;
-    esac
-  fi
-
-  dnl Check for madvise(..., MADV_DONTNEED).
-  JE_COMPILABLE([madvise(..., MADV_DONTNEED)], [
-#include <sys/mman.h>
-], [
-	madvise((void *)0, 0, MADV_DONTNEED);
-], [je_cv_madv_dontneed])
-  if test "x${je_cv_madv_dontneed}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_PURGE_MADVISE_DONTNEED], [ ])
-  fi
-
-  dnl Check for madvise(..., MADV_DO[NT]DUMP).
-  JE_COMPILABLE([madvise(..., MADV_DO[[NT]]DUMP)], [
-#include <sys/mman.h>
-], [
-	madvise((void *)0, 0, MADV_DONTDUMP);
-	madvise((void *)0, 0, MADV_DODUMP);
-], [je_cv_madv_dontdump])
-  if test "x${je_cv_madv_dontdump}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_MADVISE_DONTDUMP], [ ])
-  fi
- 
-  dnl Check for madvise(..., MADV_[NO]HUGEPAGE).
-  JE_COMPILABLE([madvise(..., MADV_[[NO]]HUGEPAGE)], [
-#include <sys/mman.h>
-], [
-	madvise((void *)0, 0, MADV_HUGEPAGE);
-	madvise((void *)0, 0, MADV_NOHUGEPAGE);
-], [je_cv_thp])
-case "${host_cpu}" in
-  arm*)
-    ;;
-  *)
-  if test "x${je_cv_thp}" = "xyes" ; then
-    AC_DEFINE([JEMALLOC_HAVE_MADVISE_HUGE], [ ])
-  fi
-  ;;
-esac
-fi
-
-dnl ============================================================================
-dnl Check whether __sync_{add,sub}_and_fetch() are available despite
-dnl __GCC_HAVE_SYNC_COMPARE_AND_SWAP_n macros being undefined.
-
-AC_DEFUN([JE_SYNC_COMPARE_AND_SWAP_CHECK],[
-  AC_CACHE_CHECK([whether to force $1-bit __sync_{add,sub}_and_fetch()],
-               [je_cv_sync_compare_and_swap_$2],
-               [AC_LINK_IFELSE([AC_LANG_PROGRAM([
-                                                 #include <stdint.h>
-                                                ],
-                                                [
-                                                 #ifndef __GCC_HAVE_SYNC_COMPARE_AND_SWAP_$2
-                                                 {
-                                                    uint$1_t x$1 = 0;
-                                                    __sync_add_and_fetch(&x$1, 42);
-                                                    __sync_sub_and_fetch(&x$1, 1);
-                                                 }
-                                                 #else
-                                                 #error __GCC_HAVE_SYNC_COMPARE_AND_SWAP_$2 is defined, no need to force
-                                                 #endif
-                                                ])],
-                               [je_cv_sync_compare_and_swap_$2=yes],
-                               [je_cv_sync_compare_and_swap_$2=no])])
-
-  if test "x${je_cv_sync_compare_and_swap_$2}" = "xyes" ; then
-    AC_DEFINE([JE_FORCE_SYNC_COMPARE_AND_SWAP_$2], [ ])
-  fi
-])
-
-if test "x${je_cv_atomic9}" != "xyes" -a "x${je_cv_osatomic}" != "xyes" ; then
-  JE_SYNC_COMPARE_AND_SWAP_CHECK(32, 4)
-  JE_SYNC_COMPARE_AND_SWAP_CHECK(64, 8)
-fi
-
-dnl ============================================================================
-dnl Check for __builtin_clz() and __builtin_clzl().
-
-AC_CACHE_CHECK([for __builtin_clz],
-               [je_cv_builtin_clz],
-               [AC_LINK_IFELSE([AC_LANG_PROGRAM([],
-                                                [
-                                                {
-                                                        unsigned x = 0;
-                                                        int y = __builtin_clz(x);
-                                                }
-                                                {
-                                                        unsigned long x = 0;
-                                                        int y = __builtin_clzl(x);
-                                                }
-                                                ])],
-                               [je_cv_builtin_clz=yes],
-                               [je_cv_builtin_clz=no])])
-
-if test "x${je_cv_builtin_clz}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_BUILTIN_CLZ], [ ])
-fi
-
-dnl ============================================================================
-dnl Check for os_unfair_lock operations as provided on Darwin.
-
-JE_COMPILABLE([Darwin os_unfair_lock_*()], [
-#include <os/lock.h>
-#include <AvailabilityMacros.h>
-], [
-	#if MAC_OS_X_VERSION_MIN_REQUIRED < 101200
-	#error "os_unfair_lock is not supported"
-	#else
-	os_unfair_lock lock = OS_UNFAIR_LOCK_INIT;
-	os_unfair_lock_lock(&lock);
-	os_unfair_lock_unlock(&lock);
-	#endif
-], [je_cv_os_unfair_lock])
-if test "x${je_cv_os_unfair_lock}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_OS_UNFAIR_LOCK], [ ])
-fi
-
-dnl ============================================================================
-dnl Check for spinlock(3) operations as provided on Darwin.
-
-JE_COMPILABLE([Darwin OSSpin*()], [
-#include <libkern/OSAtomic.h>
-#include <inttypes.h>
-], [
-	OSSpinLock lock = 0;
-	OSSpinLockLock(&lock);
-	OSSpinLockUnlock(&lock);
-], [je_cv_osspin])
-if test "x${je_cv_osspin}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_OSSPIN], [ ])
-fi
-
-dnl ============================================================================
-dnl Darwin-related configuration.
-
-AC_ARG_ENABLE([zone-allocator],
-  [AS_HELP_STRING([--disable-zone-allocator],
-                  [Disable zone allocator for Darwin])],
-[if test "x$enable_zone_allocator" = "xno" ; then
-  enable_zone_allocator="0"
-else
-  enable_zone_allocator="1"
-fi
-],
-[if test "x${abi}" = "xmacho"; then
-  enable_zone_allocator="1"
-fi
-]
-)
-AC_SUBST([enable_zone_allocator])
-
-if test "x${enable_zone_allocator}" = "x1" ; then
-  if test "x${abi}" != "xmacho"; then
-    AC_MSG_ERROR([--enable-zone-allocator is only supported on Darwin])
-  fi
-  AC_DEFINE([JEMALLOC_ZONE], [ ])
-fi
-
-dnl ============================================================================
-dnl Use initial-exec TLS by default.
-AC_ARG_ENABLE([initial-exec-tls],
-  [AS_HELP_STRING([--disable-initial-exec-tls],
-                  [Disable the initial-exec tls model])],
-[if test "x$enable_initial_exec_tls" = "xno" ; then
-  enable_initial_exec_tls="0"
-else
-  enable_initial_exec_tls="1"
-fi
-],
-[enable_initial_exec_tls="1"]
-)
-AC_SUBST([enable_initial_exec_tls])
-
-if test "x${je_cv_tls_model}" = "xyes" -a \
-       "x${enable_initial_exec_tls}" = "x1" ; then
-  AC_DEFINE([JEMALLOC_TLS_MODEL],
-            [__attribute__((tls_model("initial-exec")))])
-else
-  AC_DEFINE([JEMALLOC_TLS_MODEL], [ ])
-fi
-
-dnl ============================================================================
-dnl Enable background threads if possible.
-
-if test "x${have_pthread}" = "x1" -a "x${have_dlsym}" = "x1" \
-    -a "x${je_cv_os_unfair_lock}" != "xyes" \
-    -a "x${je_cv_osspin}" != "xyes" ; then
-  AC_DEFINE([JEMALLOC_BACKGROUND_THREAD])
-fi
-
-dnl ============================================================================
-dnl Check for glibc malloc hooks
-
-JE_COMPILABLE([glibc malloc hook], [
-#include <stddef.h>
-
-extern void (* __free_hook)(void *ptr);
-extern void *(* __malloc_hook)(size_t size);
-extern void *(* __realloc_hook)(void *ptr, size_t size);
-], [
-  void *ptr = 0L;
-  if (__malloc_hook) ptr = __malloc_hook(1);
-  if (__realloc_hook) ptr = __realloc_hook(ptr, 2);
-  if (__free_hook && ptr) __free_hook(ptr);
-], [je_cv_glibc_malloc_hook])
-if test "x${je_cv_glibc_malloc_hook}" = "xyes" ; then
-  if test "x${JEMALLOC_PREFIX}" = "x" ; then
-    AC_DEFINE([JEMALLOC_GLIBC_MALLOC_HOOK], [ ])
-    wrap_syms="${wrap_syms} __free_hook __malloc_hook __realloc_hook"
-  fi
-fi
-
-JE_COMPILABLE([glibc memalign hook], [
-#include <stddef.h>
-
-extern void *(* __memalign_hook)(size_t alignment, size_t size);
-], [
-  void *ptr = 0L;
-  if (__memalign_hook) ptr = __memalign_hook(16, 7);
-], [je_cv_glibc_memalign_hook])
-if test "x${je_cv_glibc_memalign_hook}" = "xyes" ; then
-  if test "x${JEMALLOC_PREFIX}" = "x" ; then
-    AC_DEFINE([JEMALLOC_GLIBC_MEMALIGN_HOOK], [ ])
-    wrap_syms="${wrap_syms} __memalign_hook"
-  fi
-fi
-
-JE_COMPILABLE([pthreads adaptive mutexes], [
-#include <pthread.h>
-], [
-  pthread_mutexattr_t attr;
-  pthread_mutexattr_init(&attr);
-  pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_ADAPTIVE_NP);
-  pthread_mutexattr_destroy(&attr);
-], [je_cv_pthread_mutex_adaptive_np])
-if test "x${je_cv_pthread_mutex_adaptive_np}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_HAVE_PTHREAD_MUTEX_ADAPTIVE_NP], [ ])
-fi
-
-JE_CFLAGS_SAVE()
-JE_CFLAGS_ADD([-D_GNU_SOURCE])
-JE_CFLAGS_ADD([-Werror])
-JE_CFLAGS_ADD([-herror_on_warning])
-JE_COMPILABLE([strerror_r returns char with gnu source], [
-#include <errno.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-], [
-  char *buffer = (char *) malloc(100);
-  char *error = strerror_r(EINVAL, buffer, 100);
-  printf("%s\n", error);
-], [je_cv_strerror_r_returns_char_with_gnu_source])
-JE_CFLAGS_RESTORE()
-if test "x${je_cv_strerror_r_returns_char_with_gnu_source}" = "xyes" ; then
-  AC_DEFINE([JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE], [ ])
-fi
-
-dnl ============================================================================
-dnl Check for typedefs, structures, and compiler characteristics.
-AC_HEADER_STDBOOL
-
-dnl ============================================================================
-dnl Define commands that generate output files.
-
-AC_CONFIG_COMMANDS([include/jemalloc/internal/public_symbols.txt], [
-  f="${objroot}include/jemalloc/internal/public_symbols.txt"
-  mkdir -p "${objroot}include/jemalloc/internal"
-  cp /dev/null "${f}"
-  for nm in `echo ${mangling_map} |tr ',' ' '` ; do
-    n=`echo ${nm} |tr ':' ' ' |awk '{print $[]1}'`
-    m=`echo ${nm} |tr ':' ' ' |awk '{print $[]2}'`
-    echo "${n}:${m}" >> "${f}"
-    dnl Remove name from public_syms so that it isn't redefined later.
-    public_syms=`for sym in ${public_syms}; do echo "${sym}"; done |grep -v "^${n}\$" |tr '\n' ' '`
-  done
-  for sym in ${public_syms} ; do
-    n="${sym}"
-    m="${JEMALLOC_PREFIX}${sym}"
-    echo "${n}:${m}" >> "${f}"
-  done
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-  mangling_map="${mangling_map}"
-  public_syms="${public_syms}"
-  JEMALLOC_PREFIX="${JEMALLOC_PREFIX}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/internal/private_symbols.awk], [
-  f="${objroot}include/jemalloc/internal/private_symbols.awk"
-  mkdir -p "${objroot}include/jemalloc/internal"
-  export_syms=`for sym in ${public_syms}; do echo "${JEMALLOC_PREFIX}${sym}"; done; for sym in ${wrap_syms}; do echo "${sym}"; done;`
-  "${srcdir}/include/jemalloc/internal/private_symbols.sh" "${SYM_PREFIX}" ${export_syms} > "${objroot}include/jemalloc/internal/private_symbols.awk"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-  public_syms="${public_syms}"
-  wrap_syms="${wrap_syms}"
-  SYM_PREFIX="${SYM_PREFIX}"
-  JEMALLOC_PREFIX="${JEMALLOC_PREFIX}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/internal/private_symbols_jet.awk], [
-  f="${objroot}include/jemalloc/internal/private_symbols_jet.awk"
-  mkdir -p "${objroot}include/jemalloc/internal"
-  export_syms=`for sym in ${public_syms}; do echo "jet_${sym}"; done; for sym in ${wrap_syms}; do echo "${sym}"; done;`
-  "${srcdir}/include/jemalloc/internal/private_symbols.sh" "${SYM_PREFIX}" ${export_syms} > "${objroot}include/jemalloc/internal/private_symbols_jet.awk"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-  public_syms="${public_syms}"
-  wrap_syms="${wrap_syms}"
-  SYM_PREFIX="${SYM_PREFIX}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/internal/public_namespace.h], [
-  mkdir -p "${objroot}include/jemalloc/internal"
-  "${srcdir}/include/jemalloc/internal/public_namespace.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/internal/public_namespace.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/internal/public_unnamespace.h], [
-  mkdir -p "${objroot}include/jemalloc/internal"
-  "${srcdir}/include/jemalloc/internal/public_unnamespace.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/internal/public_unnamespace.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/internal/size_classes.h], [
-  mkdir -p "${objroot}include/jemalloc/internal"
-  "${SHELL}" "${srcdir}/include/jemalloc/internal/size_classes.sh" "${LG_QUANTA}" 3 "${LG_PAGE_SIZES}" 2 > "${objroot}include/jemalloc/internal/size_classes.h"
-], [
-  SHELL="${SHELL}"
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-  LG_QUANTA="${LG_QUANTA}"
-  LG_PAGE_SIZES="${LG_PAGE_SIZES}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_protos_jet.h], [
-  mkdir -p "${objroot}include/jemalloc"
-  cat "${srcdir}/include/jemalloc/jemalloc_protos.h.in" | sed -e 's/@je_@/jet_/g' > "${objroot}include/jemalloc/jemalloc_protos_jet.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_rename.h], [
-  mkdir -p "${objroot}include/jemalloc"
-  "${srcdir}/include/jemalloc/jemalloc_rename.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" > "${objroot}include/jemalloc/jemalloc_rename.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_mangle.h], [
-  mkdir -p "${objroot}include/jemalloc"
-  "${srcdir}/include/jemalloc/jemalloc_mangle.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" je_ > "${objroot}include/jemalloc/jemalloc_mangle.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/jemalloc_mangle_jet.h], [
-  mkdir -p "${objroot}include/jemalloc"
-  "${srcdir}/include/jemalloc/jemalloc_mangle.sh" "${objroot}include/jemalloc/internal/public_symbols.txt" jet_ > "${objroot}include/jemalloc/jemalloc_mangle_jet.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-])
-AC_CONFIG_COMMANDS([include/jemalloc/jemalloc.h], [
-  mkdir -p "${objroot}include/jemalloc"
-  "${srcdir}/include/jemalloc/jemalloc.sh" "${objroot}" > "${objroot}include/jemalloc/jemalloc${install_suffix}.h"
-], [
-  srcdir="${srcdir}"
-  objroot="${objroot}"
-  install_suffix="${install_suffix}"
-])
-
-dnl Process .in files.
-AC_SUBST([cfghdrs_in])
-AC_SUBST([cfghdrs_out])
-AC_CONFIG_HEADERS([$cfghdrs_tup])
-
-dnl ============================================================================
-dnl Generate outputs.
-
-AC_CONFIG_FILES([$cfgoutputs_tup config.stamp bin/jemalloc-config bin/jemalloc.sh bin/jeprof])
-AC_SUBST([cfgoutputs_in])
-AC_SUBST([cfgoutputs_out])
-AC_OUTPUT
-
-dnl ============================================================================
-dnl Print out the results of configuration.
-AC_MSG_RESULT([===============================================================================])
-AC_MSG_RESULT([jemalloc version   : ${jemalloc_version}])
-AC_MSG_RESULT([library revision   : ${rev}])
-AC_MSG_RESULT([])
-AC_MSG_RESULT([CONFIG             : ${CONFIG}])
-AC_MSG_RESULT([CC                 : ${CC}])
-AC_MSG_RESULT([CONFIGURE_CFLAGS   : ${CONFIGURE_CFLAGS}])
-AC_MSG_RESULT([SPECIFIED_CFLAGS   : ${SPECIFIED_CFLAGS}])
-AC_MSG_RESULT([EXTRA_CFLAGS       : ${EXTRA_CFLAGS}])
-AC_MSG_RESULT([CPPFLAGS           : ${CPPFLAGS}])
-AC_MSG_RESULT([CXX                : ${CXX}])
-AC_MSG_RESULT([CONFIGURE_CXXFLAGS : ${CONFIGURE_CXXFLAGS}])
-AC_MSG_RESULT([SPECIFIED_CXXFLAGS : ${SPECIFIED_CXXFLAGS}])
-AC_MSG_RESULT([EXTRA_CXXFLAGS     : ${EXTRA_CXXFLAGS}])
-AC_MSG_RESULT([LDFLAGS            : ${LDFLAGS}])
-AC_MSG_RESULT([EXTRA_LDFLAGS      : ${EXTRA_LDFLAGS}])
-AC_MSG_RESULT([DSO_LDFLAGS        : ${DSO_LDFLAGS}])
-AC_MSG_RESULT([LIBS               : ${LIBS}])
-AC_MSG_RESULT([RPATH_EXTRA        : ${RPATH_EXTRA}])
-AC_MSG_RESULT([])
-AC_MSG_RESULT([XSLTPROC           : ${XSLTPROC}])
-AC_MSG_RESULT([XSLROOT            : ${XSLROOT}])
-AC_MSG_RESULT([])
-AC_MSG_RESULT([PREFIX             : ${PREFIX}])
-AC_MSG_RESULT([BINDIR             : ${BINDIR}])
-AC_MSG_RESULT([DATADIR            : ${DATADIR}])
-AC_MSG_RESULT([INCLUDEDIR         : ${INCLUDEDIR}])
-AC_MSG_RESULT([LIBDIR             : ${LIBDIR}])
-AC_MSG_RESULT([MANDIR             : ${MANDIR}])
-AC_MSG_RESULT([])
-AC_MSG_RESULT([srcroot            : ${srcroot}])
-AC_MSG_RESULT([abs_srcroot        : ${abs_srcroot}])
-AC_MSG_RESULT([objroot            : ${objroot}])
-AC_MSG_RESULT([abs_objroot        : ${abs_objroot}])
-AC_MSG_RESULT([])
-AC_MSG_RESULT([JEMALLOC_PREFIX    : ${JEMALLOC_PREFIX}])
-AC_MSG_RESULT([JEMALLOC_PRIVATE_NAMESPACE])
-AC_MSG_RESULT([                   : ${JEMALLOC_PRIVATE_NAMESPACE}])
-AC_MSG_RESULT([install_suffix     : ${install_suffix}])
-AC_MSG_RESULT([malloc_conf        : ${config_malloc_conf}])
-AC_MSG_RESULT([autogen            : ${enable_autogen}])
-AC_MSG_RESULT([debug              : ${enable_debug}])
-AC_MSG_RESULT([stats              : ${enable_stats}])
-AC_MSG_RESULT([prof               : ${enable_prof}])
-AC_MSG_RESULT([prof-libunwind     : ${enable_prof_libunwind}])
-AC_MSG_RESULT([prof-libgcc        : ${enable_prof_libgcc}])
-AC_MSG_RESULT([prof-gcc           : ${enable_prof_gcc}])
-AC_MSG_RESULT([fill               : ${enable_fill}])
-AC_MSG_RESULT([utrace             : ${enable_utrace}])
-AC_MSG_RESULT([xmalloc            : ${enable_xmalloc}])
-AC_MSG_RESULT([log                : ${enable_log}])
-AC_MSG_RESULT([lazy_lock          : ${enable_lazy_lock}])
-AC_MSG_RESULT([cache-oblivious    : ${enable_cache_oblivious}])
-AC_MSG_RESULT([cxx                : ${enable_cxx}])
-AC_MSG_RESULT([===============================================================================])
diff --git a/redis-stable/deps/jemalloc/doc/html.xsl.in b/redis-stable/deps/jemalloc/doc/html.xsl.in
deleted file mode 100644
index ec4fa655..00000000
--- a/redis-stable/deps/jemalloc/doc/html.xsl.in
+++ /dev/null
@@ -1,5 +0,0 @@
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
-  <xsl:import href="@XSLROOT@/html/docbook.xsl"/>
-  <xsl:import href="@abs_srcroot@doc/stylesheet.xsl"/>
-  <xsl:output method="xml" encoding="utf-8"/>
-</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/doc/jemalloc.xml.in b/redis-stable/deps/jemalloc/doc/jemalloc.xml.in
deleted file mode 100644
index 1e12fd3a..00000000
--- a/redis-stable/deps/jemalloc/doc/jemalloc.xml.in
+++ /dev/null
@@ -1,3379 +0,0 @@
-<?xml version='1.0' encoding='UTF-8'?>
-<?xml-stylesheet type="text/xsl"
-        href="http://docbook.sourceforge.net/release/xsl/current/manpages/docbook.xsl"?>
-<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.4//EN"
-        "http://www.oasis-open.org/docbook/xml/4.4/docbookx.dtd" [
-]>
-
-<refentry>
-  <refentryinfo>
-    <title>User Manual</title>
-    <productname>jemalloc</productname>
-    <releaseinfo role="version">@jemalloc_version@</releaseinfo>
-    <authorgroup>
-      <author>
-        <firstname>Jason</firstname>
-        <surname>Evans</surname>
-        <personblurb>Author</personblurb>
-      </author>
-    </authorgroup>
-  </refentryinfo>
-  <refmeta>
-    <refentrytitle>JEMALLOC</refentrytitle>
-    <manvolnum>3</manvolnum>
-  </refmeta>
-  <refnamediv>
-    <refdescriptor>jemalloc</refdescriptor>
-    <refname>jemalloc</refname>
-    <!-- Each refname causes a man page file to be created.  Only if this were
-         the system malloc(3) implementation would these files be appropriate.
-    <refname>malloc</refname>
-    <refname>calloc</refname>
-    <refname>posix_memalign</refname>
-    <refname>aligned_alloc</refname>
-    <refname>realloc</refname>
-    <refname>free</refname>
-    <refname>mallocx</refname>
-    <refname>rallocx</refname>
-    <refname>xallocx</refname>
-    <refname>sallocx</refname>
-    <refname>dallocx</refname>
-    <refname>sdallocx</refname>
-    <refname>nallocx</refname>
-    <refname>mallctl</refname>
-    <refname>mallctlnametomib</refname>
-    <refname>mallctlbymib</refname>
-    <refname>malloc_stats_print</refname>
-    <refname>malloc_usable_size</refname>
-    -->
-    <refpurpose>general purpose memory allocation functions</refpurpose>
-  </refnamediv>
-  <refsect1 id="library">
-    <title>LIBRARY</title>
-    <para>This manual describes jemalloc @jemalloc_version@.  More information
-    can be found at the <ulink
-    url="http://jemalloc.net/">jemalloc website</ulink>.</para>
-  </refsect1>
-  <refsynopsisdiv>
-    <title>SYNOPSIS</title>
-    <funcsynopsis>
-      <funcsynopsisinfo>#include &lt;<filename class="headerfile">jemalloc/jemalloc.h</filename>&gt;</funcsynopsisinfo>
-      <refsect2>
-        <title>Standard API</title>
-        <funcprototype>
-          <funcdef>void *<function>malloc</function></funcdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void *<function>calloc</function></funcdef>
-          <paramdef>size_t <parameter>number</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>int <function>posix_memalign</function></funcdef>
-          <paramdef>void **<parameter>ptr</parameter></paramdef>
-          <paramdef>size_t <parameter>alignment</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void *<function>aligned_alloc</function></funcdef>
-          <paramdef>size_t <parameter>alignment</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void *<function>realloc</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void <function>free</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-        </funcprototype>
-      </refsect2>
-      <refsect2>
-        <title>Non-standard API</title>
-        <funcprototype>
-          <funcdef>void *<function>mallocx</function></funcdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void *<function>rallocx</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>size_t <function>xallocx</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>extra</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>size_t <function>sallocx</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void <function>dallocx</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void <function>sdallocx</function></funcdef>
-          <paramdef>void *<parameter>ptr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>size_t <function>nallocx</function></funcdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>int <parameter>flags</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>int <function>mallctl</function></funcdef>
-          <paramdef>const char *<parameter>name</parameter></paramdef>
-          <paramdef>void *<parameter>oldp</parameter></paramdef>
-          <paramdef>size_t *<parameter>oldlenp</parameter></paramdef>
-          <paramdef>void *<parameter>newp</parameter></paramdef>
-          <paramdef>size_t <parameter>newlen</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>int <function>mallctlnametomib</function></funcdef>
-          <paramdef>const char *<parameter>name</parameter></paramdef>
-          <paramdef>size_t *<parameter>mibp</parameter></paramdef>
-          <paramdef>size_t *<parameter>miblenp</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>int <function>mallctlbymib</function></funcdef>
-          <paramdef>const size_t *<parameter>mib</parameter></paramdef>
-          <paramdef>size_t <parameter>miblen</parameter></paramdef>
-          <paramdef>void *<parameter>oldp</parameter></paramdef>
-          <paramdef>size_t *<parameter>oldlenp</parameter></paramdef>
-          <paramdef>void *<parameter>newp</parameter></paramdef>
-          <paramdef>size_t <parameter>newlen</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void <function>malloc_stats_print</function></funcdef>
-          <paramdef>void <parameter>(*write_cb)</parameter>
-            <funcparams>void *, const char *</funcparams>
-          </paramdef>
-          <paramdef>void *<parameter>cbopaque</parameter></paramdef>
-          <paramdef>const char *<parameter>opts</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>size_t <function>malloc_usable_size</function></funcdef>
-          <paramdef>const void *<parameter>ptr</parameter></paramdef>
-        </funcprototype>
-        <funcprototype>
-          <funcdef>void <function>(*malloc_message)</function></funcdef>
-          <paramdef>void *<parameter>cbopaque</parameter></paramdef>
-          <paramdef>const char *<parameter>s</parameter></paramdef>
-        </funcprototype>
-        <para><type>const char *</type><varname>malloc_conf</varname>;</para>
-      </refsect2>
-    </funcsynopsis>
-  </refsynopsisdiv>
-  <refsect1 id="description">
-    <title>DESCRIPTION</title>
-    <refsect2>
-      <title>Standard API</title>
-
-      <para>The <function>malloc()</function> function allocates
-      <parameter>size</parameter> bytes of uninitialized memory.  The allocated
-      space is suitably aligned (after possible pointer coercion) for storage
-      of any type of object.</para>
-
-      <para>The <function>calloc()</function> function allocates
-      space for <parameter>number</parameter> objects, each
-      <parameter>size</parameter> bytes in length.  The result is identical to
-      calling <function>malloc()</function> with an argument of
-      <parameter>number</parameter> * <parameter>size</parameter>, with the
-      exception that the allocated memory is explicitly initialized to zero
-      bytes.</para>
-
-      <para>The <function>posix_memalign()</function> function
-      allocates <parameter>size</parameter> bytes of memory such that the
-      allocation's base address is a multiple of
-      <parameter>alignment</parameter>, and returns the allocation in the value
-      pointed to by <parameter>ptr</parameter>.  The requested
-      <parameter>alignment</parameter> must be a power of 2 at least as large as
-      <code language="C">sizeof(<type>void *</type>)</code>.</para>
-
-      <para>The <function>aligned_alloc()</function> function
-      allocates <parameter>size</parameter> bytes of memory such that the
-      allocation's base address is a multiple of
-      <parameter>alignment</parameter>.  The requested
-      <parameter>alignment</parameter> must be a power of 2.  Behavior is
-      undefined if <parameter>size</parameter> is not an integral multiple of
-      <parameter>alignment</parameter>.</para>
-
-      <para>The <function>realloc()</function> function changes the
-      size of the previously allocated memory referenced by
-      <parameter>ptr</parameter> to <parameter>size</parameter> bytes.  The
-      contents of the memory are unchanged up to the lesser of the new and old
-      sizes.  If the new size is larger, the contents of the newly allocated
-      portion of the memory are undefined.  Upon success, the memory referenced
-      by <parameter>ptr</parameter> is freed and a pointer to the newly
-      allocated memory is returned.  Note that
-      <function>realloc()</function> may move the memory allocation,
-      resulting in a different return value than <parameter>ptr</parameter>.
-      If <parameter>ptr</parameter> is <constant>NULL</constant>, the
-      <function>realloc()</function> function behaves identically to
-      <function>malloc()</function> for the specified size.</para>
-
-      <para>The <function>free()</function> function causes the
-      allocated memory referenced by <parameter>ptr</parameter> to be made
-      available for future allocations.  If <parameter>ptr</parameter> is
-      <constant>NULL</constant>, no action occurs.</para>
-    </refsect2>
-    <refsect2>
-      <title>Non-standard API</title>
-      <para>The <function>mallocx()</function>,
-      <function>rallocx()</function>,
-      <function>xallocx()</function>,
-      <function>sallocx()</function>,
-      <function>dallocx()</function>,
-      <function>sdallocx()</function>, and
-      <function>nallocx()</function> functions all have a
-      <parameter>flags</parameter> argument that can be used to specify
-      options.  The functions only check the options that are contextually
-      relevant.  Use bitwise or (<code language="C">|</code>) operations to
-      specify one or more of the following:
-        <variablelist>
-          <varlistentry id="MALLOCX_LG_ALIGN">
-            <term><constant>MALLOCX_LG_ALIGN(<parameter>la</parameter>)
-            </constant></term>
-
-            <listitem><para>Align the memory allocation to start at an address
-            that is a multiple of <code language="C">(1 &lt;&lt;
-            <parameter>la</parameter>)</code>.  This macro does not validate
-            that <parameter>la</parameter> is within the valid
-            range.</para></listitem>
-          </varlistentry>
-          <varlistentry id="MALLOCX_ALIGN">
-            <term><constant>MALLOCX_ALIGN(<parameter>a</parameter>)
-            </constant></term>
-
-            <listitem><para>Align the memory allocation to start at an address
-            that is a multiple of <parameter>a</parameter>, where
-            <parameter>a</parameter> is a power of two.  This macro does not
-            validate that <parameter>a</parameter> is a power of 2.
-            </para></listitem>
-          </varlistentry>
-          <varlistentry id="MALLOCX_ZERO">
-            <term><constant>MALLOCX_ZERO</constant></term>
-
-            <listitem><para>Initialize newly allocated memory to contain zero
-            bytes.  In the growing reallocation case, the real size prior to
-            reallocation defines the boundary between untouched bytes and those
-            that are initialized to contain zero bytes.  If this macro is
-            absent, newly allocated memory is uninitialized.</para></listitem>
-          </varlistentry>
-          <varlistentry id="MALLOCX_TCACHE">
-            <term><constant>MALLOCX_TCACHE(<parameter>tc</parameter>)
-            </constant></term>
-
-            <listitem><para>Use the thread-specific cache (tcache) specified by
-            the identifier <parameter>tc</parameter>, which must have been
-            acquired via the <link
-            linkend="tcache.create"><mallctl>tcache.create</mallctl></link>
-            mallctl.  This macro does not validate that
-            <parameter>tc</parameter> specifies a valid
-            identifier.</para></listitem>
-          </varlistentry>
-          <varlistentry id="MALLOC_TCACHE_NONE">
-            <term><constant>MALLOCX_TCACHE_NONE</constant></term>
-
-            <listitem><para>Do not use a thread-specific cache (tcache).  Unless
-            <constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant> or
-            <constant>MALLOCX_TCACHE_NONE</constant> is specified, an
-            automatically managed tcache will be used under many circumstances.
-            This macro cannot be used in the same <parameter>flags</parameter>
-            argument as
-            <constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant>.</para></listitem>
-          </varlistentry>
-          <varlistentry id="MALLOCX_ARENA">
-            <term><constant>MALLOCX_ARENA(<parameter>a</parameter>)
-            </constant></term>
-
-            <listitem><para>Use the arena specified by the index
-            <parameter>a</parameter>.  This macro has no effect for regions that
-            were allocated via an arena other than the one specified.  This
-            macro does not validate that <parameter>a</parameter> specifies an
-            arena index in the valid range.</para></listitem>
-          </varlistentry>
-        </variablelist>
-      </para>
-
-      <para>The <function>mallocx()</function> function allocates at
-      least <parameter>size</parameter> bytes of memory, and returns a pointer
-      to the base address of the allocation.  Behavior is undefined if
-      <parameter>size</parameter> is <constant>0</constant>.</para>
-
-      <para>The <function>rallocx()</function> function resizes the
-      allocation at <parameter>ptr</parameter> to be at least
-      <parameter>size</parameter> bytes, and returns a pointer to the base
-      address of the resulting allocation, which may or may not have moved from
-      its original location.  Behavior is undefined if
-      <parameter>size</parameter> is <constant>0</constant>.</para>
-
-      <para>The <function>xallocx()</function> function resizes the
-      allocation at <parameter>ptr</parameter> in place to be at least
-      <parameter>size</parameter> bytes, and returns the real size of the
-      allocation.  If <parameter>extra</parameter> is non-zero, an attempt is
-      made to resize the allocation to be at least <code
-      language="C">(<parameter>size</parameter> +
-      <parameter>extra</parameter>)</code> bytes, though inability to allocate
-      the extra byte(s) will not by itself result in failure to resize.
-      Behavior is undefined if <parameter>size</parameter> is
-      <constant>0</constant>, or if <code
-      language="C">(<parameter>size</parameter> + <parameter>extra</parameter>
-      &gt; <constant>SIZE_T_MAX</constant>)</code>.</para>
-
-      <para>The <function>sallocx()</function> function returns the
-      real size of the allocation at <parameter>ptr</parameter>.</para>
-
-      <para>The <function>dallocx()</function> function causes the
-      memory referenced by <parameter>ptr</parameter> to be made available for
-      future allocations.</para>
-
-      <para>The <function>sdallocx()</function> function is an
-      extension of <function>dallocx()</function> with a
-      <parameter>size</parameter> parameter to allow the caller to pass in the
-      allocation size as an optimization.  The minimum valid input size is the
-      original requested size of the allocation, and the maximum valid input
-      size is the corresponding value returned by
-      <function>nallocx()</function> or
-      <function>sallocx()</function>.</para>
-
-      <para>The <function>nallocx()</function> function allocates no
-      memory, but it performs the same size computation as the
-      <function>mallocx()</function> function, and returns the real
-      size of the allocation that would result from the equivalent
-      <function>mallocx()</function> function call, or
-      <constant>0</constant> if the inputs exceed the maximum supported size
-      class and/or alignment.  Behavior is undefined if
-      <parameter>size</parameter> is <constant>0</constant>.</para>
-
-      <para>The <function>mallctl()</function> function provides a
-      general interface for introspecting the memory allocator, as well as
-      setting modifiable parameters and triggering actions.  The
-      period-separated <parameter>name</parameter> argument specifies a
-      location in a tree-structured namespace; see the <xref
-      linkend="mallctl_namespace" xrefstyle="template:%t"/> section for
-      documentation on the tree contents.  To read a value, pass a pointer via
-      <parameter>oldp</parameter> to adequate space to contain the value, and a
-      pointer to its length via <parameter>oldlenp</parameter>; otherwise pass
-      <constant>NULL</constant> and <constant>NULL</constant>.  Similarly, to
-      write a value, pass a pointer to the value via
-      <parameter>newp</parameter>, and its length via
-      <parameter>newlen</parameter>; otherwise pass <constant>NULL</constant>
-      and <constant>0</constant>.</para>
-
-      <para>The <function>mallctlnametomib()</function> function
-      provides a way to avoid repeated name lookups for applications that
-      repeatedly query the same portion of the namespace, by translating a name
-      to a <quote>Management Information Base</quote> (MIB) that can be passed
-      repeatedly to <function>mallctlbymib()</function>.  Upon
-      successful return from <function>mallctlnametomib()</function>,
-      <parameter>mibp</parameter> contains an array of
-      <parameter>*miblenp</parameter> integers, where
-      <parameter>*miblenp</parameter> is the lesser of the number of components
-      in <parameter>name</parameter> and the input value of
-      <parameter>*miblenp</parameter>.  Thus it is possible to pass a
-      <parameter>*miblenp</parameter> that is smaller than the number of
-      period-separated name components, which results in a partial MIB that can
-      be used as the basis for constructing a complete MIB.  For name
-      components that are integers (e.g. the 2 in
-      <link
-      linkend="arenas.bin.i.size"><mallctl>arenas.bin.2.size</mallctl></link>),
-      the corresponding MIB component will always be that integer.  Therefore,
-      it is legitimate to construct code like the following: <programlisting
-      language="C"><![CDATA[
-unsigned nbins, i;
-size_t mib[4];
-size_t len, miblen;
-
-len = sizeof(nbins);
-mallctl("arenas.nbins", &nbins, &len, NULL, 0);
-
-miblen = 4;
-mallctlnametomib("arenas.bin.0.size", mib, &miblen);
-for (i = 0; i < nbins; i++) {
-	size_t bin_size;
-
-	mib[2] = i;
-	len = sizeof(bin_size);
-	mallctlbymib(mib, miblen, (void *)&bin_size, &len, NULL, 0);
-	/* Do something with bin_size... */
-}]]></programlisting></para>
-
-      <varlistentry id="malloc_stats_print_opts">
-      </varlistentry>
-      <para>The <function>malloc_stats_print()</function> function writes
-      summary statistics via the <parameter>write_cb</parameter> callback
-      function pointer and <parameter>cbopaque</parameter> data passed to
-      <parameter>write_cb</parameter>, or <function>malloc_message()</function>
-      if <parameter>write_cb</parameter> is <constant>NULL</constant>.  The
-      statistics are presented in human-readable form unless <quote>J</quote> is
-      specified as a character within the <parameter>opts</parameter> string, in
-      which case the statistics are presented in <ulink
-      url="http://www.json.org/">JSON format</ulink>.  This function can be
-      called repeatedly.  General information that never changes during
-      execution can be omitted by specifying <quote>g</quote> as a character
-      within the <parameter>opts</parameter> string.  Note that
-      <function>malloc_message()</function> uses the
-      <function>mallctl*()</function> functions internally, so inconsistent
-      statistics can be reported if multiple threads use these functions
-      simultaneously.  If <option>--enable-stats</option> is specified during
-      configuration, <quote>m</quote>, <quote>d</quote>, and <quote>a</quote>
-      can be specified to omit merged arena, destroyed merged arena, and per
-      arena statistics, respectively; <quote>b</quote> and <quote>l</quote> can
-      be specified to omit per size class statistics for bins and large objects,
-      respectively; <quote>x</quote> can be specified to omit all mutex
-      statistics.  Unrecognized characters are silently ignored.  Note that
-      thread caching may prevent some statistics from being completely up to
-      date, since extra locking would be required to merge counters that track
-      thread cache operations.</para>
-
-      <para>The <function>malloc_usable_size()</function> function
-      returns the usable size of the allocation pointed to by
-      <parameter>ptr</parameter>.  The return value may be larger than the size
-      that was requested during allocation.  The
-      <function>malloc_usable_size()</function> function is not a
-      mechanism for in-place <function>realloc()</function>; rather
-      it is provided solely as a tool for introspection purposes.  Any
-      discrepancy between the requested allocation size and the size reported
-      by <function>malloc_usable_size()</function> should not be
-      depended on, since such behavior is entirely implementation-dependent.
-      </para>
-    </refsect2>
-  </refsect1>
-  <refsect1 id="tuning">
-    <title>TUNING</title>
-    <para>Once, when the first call is made to one of the memory allocation
-    routines, the allocator initializes its internals based in part on various
-    options that can be specified at compile- or run-time.</para>
-
-    <para>The string specified via <option>--with-malloc-conf</option>, the
-    string pointed to by the global variable <varname>malloc_conf</varname>, the
-    <quote>name</quote> of the file referenced by the symbolic link named
-    <filename class="symlink">/etc/malloc.conf</filename>, and the value of the
-    environment variable <envar>MALLOC_CONF</envar>, will be interpreted, in
-    that order, from left to right as options.  Note that
-    <varname>malloc_conf</varname> may be read before
-    <function>main()</function> is entered, so the declaration of
-    <varname>malloc_conf</varname> should specify an initializer that contains
-    the final value to be read by jemalloc.  <option>--with-malloc-conf</option>
-    and <varname>malloc_conf</varname> are compile-time mechanisms, whereas
-    <filename class="symlink">/etc/malloc.conf</filename> and
-    <envar>MALLOC_CONF</envar> can be safely set any time prior to program
-    invocation.</para>
-
-    <para>An options string is a comma-separated list of option:value pairs.
-    There is one key corresponding to each <link
-    linkend="opt.abort"><mallctl>opt.*</mallctl></link> mallctl (see the <xref
-    linkend="mallctl_namespace" xrefstyle="template:%t"/> section for options
-    documentation).  For example, <literal>abort:true,narenas:1</literal> sets
-    the <link linkend="opt.abort"><mallctl>opt.abort</mallctl></link> and <link
-    linkend="opt.narenas"><mallctl>opt.narenas</mallctl></link> options.  Some
-    options have boolean values (true/false), others have integer values (base
-    8, 10, or 16, depending on prefix), and yet others have raw string
-    values.</para>
-  </refsect1>
-  <refsect1 id="implementation_notes">
-    <title>IMPLEMENTATION NOTES</title>
-    <para>Traditionally, allocators have used
-    <citerefentry><refentrytitle>sbrk</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry> to obtain memory, which is
-    suboptimal for several reasons, including race conditions, increased
-    fragmentation, and artificial limitations on maximum usable memory.  If
-    <citerefentry><refentrytitle>sbrk</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry> is supported by the operating
-    system, this allocator uses both
-    <citerefentry><refentrytitle>mmap</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry> and
-    <citerefentry><refentrytitle>sbrk</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry>, in that order of preference;
-    otherwise only <citerefentry><refentrytitle>mmap</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry> is used.</para>
-
-    <para>This allocator uses multiple arenas in order to reduce lock
-    contention for threaded programs on multi-processor systems.  This works
-    well with regard to threading scalability, but incurs some costs.  There is
-    a small fixed per-arena overhead, and additionally, arenas manage memory
-    completely independently of each other, which means a small fixed increase
-    in overall memory fragmentation.  These overheads are not generally an
-    issue, given the number of arenas normally used.  Note that using
-    substantially more arenas than the default is not likely to improve
-    performance, mainly due to reduced cache performance.  However, it may make
-    sense to reduce the number of arenas if an application does not make much
-    use of the allocation functions.</para>
-
-    <para>In addition to multiple arenas, this allocator supports
-    thread-specific caching, in order to make it possible to completely avoid
-    synchronization for most allocation requests.  Such caching allows very fast
-    allocation in the common case, but it increases memory usage and
-    fragmentation, since a bounded number of objects can remain allocated in
-    each thread cache.</para>
-
-    <para>Memory is conceptually broken into extents.  Extents are always
-    aligned to multiples of the page size.  This alignment makes it possible to
-    find metadata for user objects quickly.  User objects are broken into two
-    categories according to size: small and large.  Contiguous small objects
-    comprise a slab, which resides within a single extent, whereas large objects
-    each have their own extents backing them.</para>
-
-    <para>Small objects are managed in groups by slabs.  Each slab maintains
-    a bitmap to track which regions are in use.  Allocation requests that are no
-    more than half the quantum (8 or 16, depending on architecture) are rounded
-    up to the nearest power of two that is at least <code
-    language="C">sizeof(<type>double</type>)</code>.  All other object size
-    classes are multiples of the quantum, spaced such that there are four size
-    classes for each doubling in size, which limits internal fragmentation to
-    approximately 20% for all but the smallest size classes.  Small size classes
-    are smaller than four times the page size, and large size classes extend
-    from four times the page size up to the largest size class that does not
-    exceed <constant>PTRDIFF_MAX</constant>.</para>
-
-    <para>Allocations are packed tightly together, which can be an issue for
-    multi-threaded applications.  If you need to assure that allocations do not
-    suffer from cacheline sharing, round your allocation requests up to the
-    nearest multiple of the cacheline size, or specify cacheline alignment when
-    allocating.</para>
-
-    <para>The <function>realloc()</function>,
-    <function>rallocx()</function>, and
-    <function>xallocx()</function> functions may resize allocations
-    without moving them under limited circumstances.  Unlike the
-    <function>*allocx()</function> API, the standard API does not
-    officially round up the usable size of an allocation to the nearest size
-    class, so technically it is necessary to call
-    <function>realloc()</function> to grow e.g. a 9-byte allocation to
-    16 bytes, or shrink a 16-byte allocation to 9 bytes.  Growth and shrinkage
-    trivially succeeds in place as long as the pre-size and post-size both round
-    up to the same size class.  No other API guarantees are made regarding
-    in-place resizing, but the current implementation also tries to resize large
-    allocations in place, as long as the pre-size and post-size are both large.
-    For shrinkage to succeed, the extent allocator must support splitting (see
-    <link
-    linkend="arena.i.extent_hooks"><mallctl>arena.&lt;i&gt;.extent_hooks</mallctl></link>).
-    Growth only succeeds if the trailing memory is currently available, and the
-    extent allocator supports merging.</para>
-
-    <para>Assuming 4 KiB pages and a 16-byte quantum on a 64-bit system, the
-    size classes in each category are as shown in <xref linkend="size_classes"
-    xrefstyle="template:Table %n"/>.</para>
-
-    <table xml:id="size_classes" frame="all">
-      <title>Size classes</title>
-      <tgroup cols="3" colsep="1" rowsep="1">
-      <colspec colname="c1" align="left"/>
-      <colspec colname="c2" align="right"/>
-      <colspec colname="c3" align="left"/>
-      <thead>
-        <row>
-          <entry>Category</entry>
-          <entry>Spacing</entry>
-          <entry>Size</entry>
-        </row>
-      </thead>
-      <tbody>
-        <row>
-          <entry morerows="8">Small</entry>
-          <entry>lg</entry>
-          <entry>[8]</entry>
-        </row>
-        <row>
-          <entry>16</entry>
-          <entry>[16, 32, 48, 64, 80, 96, 112, 128]</entry>
-        </row>
-        <row>
-          <entry>32</entry>
-          <entry>[160, 192, 224, 256]</entry>
-        </row>
-        <row>
-          <entry>64</entry>
-          <entry>[320, 384, 448, 512]</entry>
-        </row>
-        <row>
-          <entry>128</entry>
-          <entry>[640, 768, 896, 1024]</entry>
-        </row>
-        <row>
-          <entry>256</entry>
-          <entry>[1280, 1536, 1792, 2048]</entry>
-        </row>
-        <row>
-          <entry>512</entry>
-          <entry>[2560, 3072, 3584, 4096]</entry>
-        </row>
-        <row>
-          <entry>1 KiB</entry>
-          <entry>[5 KiB, 6 KiB, 7 KiB, 8 KiB]</entry>
-        </row>
-        <row>
-          <entry>2 KiB</entry>
-          <entry>[10 KiB, 12 KiB, 14 KiB]</entry>
-        </row>
-        <row>
-          <entry morerows="15">Large</entry>
-          <entry>2 KiB</entry>
-          <entry>[16 KiB]</entry>
-        </row>
-        <row>
-          <entry>4 KiB</entry>
-          <entry>[20 KiB, 24 KiB, 28 KiB, 32 KiB]</entry>
-        </row>
-        <row>
-          <entry>8 KiB</entry>
-          <entry>[40 KiB, 48 KiB, 54 KiB, 64 KiB]</entry>
-        </row>
-        <row>
-          <entry>16 KiB</entry>
-          <entry>[80 KiB, 96 KiB, 112 KiB, 128 KiB]</entry>
-        </row>
-        <row>
-          <entry>32 KiB</entry>
-          <entry>[160 KiB, 192 KiB, 224 KiB, 256 KiB]</entry>
-        </row>
-        <row>
-          <entry>64 KiB</entry>
-          <entry>[320 KiB, 384 KiB, 448 KiB, 512 KiB]</entry>
-        </row>
-        <row>
-          <entry>128 KiB</entry>
-          <entry>[640 KiB, 768 KiB, 896 KiB, 1 MiB]</entry>
-        </row>
-        <row>
-          <entry>256 KiB</entry>
-          <entry>[1280 KiB, 1536 KiB, 1792 KiB, 2 MiB]</entry>
-        </row>
-        <row>
-          <entry>512 KiB</entry>
-          <entry>[2560 KiB, 3 MiB, 3584 KiB, 4 MiB]</entry>
-        </row>
-        <row>
-          <entry>1 MiB</entry>
-          <entry>[5 MiB, 6 MiB, 7 MiB, 8 MiB]</entry>
-        </row>
-        <row>
-          <entry>2 MiB</entry>
-          <entry>[10 MiB, 12 MiB, 14 MiB, 16 MiB]</entry>
-        </row>
-        <row>
-          <entry>4 MiB</entry>
-          <entry>[20 MiB, 24 MiB, 28 MiB, 32 MiB]</entry>
-        </row>
-        <row>
-          <entry>8 MiB</entry>
-          <entry>[40 MiB, 48 MiB, 56 MiB, 64 MiB]</entry>
-        </row>
-        <row>
-          <entry>...</entry>
-          <entry>...</entry>
-        </row>
-        <row>
-          <entry>512 PiB</entry>
-          <entry>[2560 PiB, 3 EiB, 3584 PiB, 4 EiB]</entry>
-        </row>
-        <row>
-          <entry>1 EiB</entry>
-          <entry>[5 EiB, 6 EiB, 7 EiB]</entry>
-        </row>
-      </tbody>
-      </tgroup>
-    </table>
-  </refsect1>
-  <refsect1 id="mallctl_namespace">
-    <title>MALLCTL NAMESPACE</title>
-    <para>The following names are defined in the namespace accessible via the
-    <function>mallctl*()</function> functions.  Value types are specified in
-    parentheses, their readable/writable statuses are encoded as
-    <literal>rw</literal>, <literal>r-</literal>, <literal>-w</literal>, or
-    <literal>--</literal>, and required build configuration flags follow, if
-    any.  A name element encoded as <literal>&lt;i&gt;</literal> or
-    <literal>&lt;j&gt;</literal> indicates an integer component, where the
-    integer varies from 0 to some upper value that must be determined via
-    introspection.  In the case of <mallctl>stats.arenas.&lt;i&gt;.*</mallctl>
-    and <mallctl>arena.&lt;i&gt;.{initialized,purge,decay,dss}</mallctl>,
-    <literal>&lt;i&gt;</literal> equal to
-    <constant>MALLCTL_ARENAS_ALL</constant> can be used to operate on all arenas
-    or access the summation of statistics from all arenas; similarly
-    <literal>&lt;i&gt;</literal> equal to
-    <constant>MALLCTL_ARENAS_DESTROYED</constant> can be used to access the
-    summation of statistics from all destroyed arenas.  These constants can be
-    utilized either via <function>mallctlnametomib()</function> followed by
-    <function>mallctlbymib()</function>, or via code such as the following:
-    <programlisting language="C"><![CDATA[
-#define STRINGIFY_HELPER(x) #x
-#define STRINGIFY(x) STRINGIFY_HELPER(x)
-
-mallctl("arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".decay",
-    NULL, NULL, NULL, 0);]]></programlisting>
-    Take special note of the <link
-    linkend="epoch"><mallctl>epoch</mallctl></link> mallctl, which controls
-    refreshing of cached dynamic statistics.</para>
-
-    <variablelist>
-      <varlistentry id="version">
-        <term>
-          <mallctl>version</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Return the jemalloc version string.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="epoch">
-        <term>
-          <mallctl>epoch</mallctl>
-          (<type>uint64_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>If a value is passed in, refresh the data from which
-        the <function>mallctl*()</function> functions report values,
-        and increment the epoch.  Return the current epoch.  This is useful for
-        detecting whether another thread caused a refresh.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="background_thread">
-        <term>
-          <mallctl>background_thread</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Enable/disable internal background worker threads.  When
-        set to true, background threads are created on demand (the number of
-        background threads will be no more than the number of CPUs or active
-        arenas).  Threads run periodically, and handle <link
-        linkend="arena.i.decay">purging</link> asynchronously.  When switching
-        off, background threads are terminated synchronously.  Note that after
-        <citerefentry><refentrytitle>fork</refentrytitle><manvolnum>2</manvolnum></citerefentry>
-        function, the state in the child process will be disabled regardless
-        the state in parent process. See <link
-        linkend="stats.background_thread.num_threads"><mallctl>stats.background_thread</mallctl></link>
-        for related stats.  <link
-        linkend="opt.background_thread"><mallctl>opt.background_thread</mallctl></link>
-        can be used to set the default option.  This option is only available on
-        selected pthread-based platforms.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="max_background_threads">
-        <term>
-          <mallctl>max_background_threads</mallctl>
-          (<type>size_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Maximum number of background worker threads that will
-        be created.  This value is capped at <link
-        linkend="opt.max_background_threads"><mallctl>opt.max_background_threads</mallctl></link> at
-        startup.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.cache_oblivious">
-        <term>
-          <mallctl>config.cache_oblivious</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-cache-oblivious</option> was specified
-        during build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.debug">
-        <term>
-          <mallctl>config.debug</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-debug</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.fill">
-        <term>
-          <mallctl>config.fill</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-fill</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.lazy_lock">
-        <term>
-          <mallctl>config.lazy_lock</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-lazy-lock</option> was specified
-        during build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.malloc_conf">
-        <term>
-          <mallctl>config.malloc_conf</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Embedded configure-time-specified run-time options
-        string, empty unless <option>--with-malloc-conf</option> was specified
-        during build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.prof">
-        <term>
-          <mallctl>config.prof</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-prof</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.prof_libgcc">
-        <term>
-          <mallctl>config.prof_libgcc</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--disable-prof-libgcc</option> was not
-        specified during build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.prof_libunwind">
-        <term>
-          <mallctl>config.prof_libunwind</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-prof-libunwind</option> was specified
-        during build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.stats">
-        <term>
-          <mallctl>config.stats</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-stats</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-
-      <varlistentry id="config.utrace">
-        <term>
-          <mallctl>config.utrace</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-utrace</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="config.xmalloc">
-        <term>
-          <mallctl>config.xmalloc</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para><option>--enable-xmalloc</option> was specified during
-        build configuration.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.abort">
-        <term>
-          <mallctl>opt.abort</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Abort-on-warning enabled/disabled.  If true, most
-        warnings are fatal.  Note that runtime option warnings are not included
-        (see <link
-        linkend="opt.abort_conf"><mallctl>opt.abort_conf</mallctl></link> for
-        that). The process will call
-        <citerefentry><refentrytitle>abort</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> in these cases.  This option is
-        disabled by default unless <option>--enable-debug</option> is
-        specified during configuration, in which case it is enabled by default.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.abort_conf">
-        <term>
-          <mallctl>opt.abort_conf</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Abort-on-invalid-configuration enabled/disabled.  If
-        true, invalid runtime options are fatal.  The process will call
-        <citerefentry><refentrytitle>abort</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> in these cases.  This option is
-        disabled by default unless <option>--enable-debug</option> is
-        specified during configuration, in which case it is enabled by default.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.metadata_thp">
-        <term>
-          <mallctl>opt.metadata_thp</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Controls whether to allow jemalloc to use transparent
-        huge page (THP) for internal metadata (see <link
-        linkend="stats.metadata">stats.metadata</link>).  <quote>always</quote>
-        allows such usage.  <quote>auto</quote> uses no THP initially, but may
-        begin to do so when metadata usage reaches certain level.  The default
-        is <quote>disabled</quote>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.retain">
-        <term>
-          <mallctl>opt.retain</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>If true, retain unused virtual memory for later reuse
-        rather than discarding it by calling
-        <citerefentry><refentrytitle>munmap</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> or equivalent (see <link
-        linkend="stats.retained">stats.retained</link> for related details).
-        This option is disabled by default unless discarding virtual memory is
-        known to trigger
-        platform-specific performance problems, e.g. for [64-bit] Linux, which
-        has a quirk in its virtual memory allocation algorithm that causes
-        semi-permanent VM map holes under normal jemalloc operation.  Although
-        <citerefentry><refentrytitle>munmap</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> causes issues on 32-bit Linux as
-        well, retaining virtual memory for 32-bit Linux is disabled by default
-        due to the practical possibility of address space exhaustion.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.dss">
-        <term>
-          <mallctl>opt.dss</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>dss (<citerefentry><refentrytitle>sbrk</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry>) allocation precedence as
-        related to <citerefentry><refentrytitle>mmap</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> allocation.  The following
-        settings are supported if
-        <citerefentry><refentrytitle>sbrk</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> is supported by the operating
-        system: <quote>disabled</quote>, <quote>primary</quote>, and
-        <quote>secondary</quote>; otherwise only <quote>disabled</quote> is
-        supported.  The default is <quote>secondary</quote> if
-        <citerefentry><refentrytitle>sbrk</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> is supported by the operating
-        system; <quote>disabled</quote> otherwise.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.narenas">
-        <term>
-          <mallctl>opt.narenas</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum number of arenas to use for automatic
-        multiplexing of threads and arenas.  The default is four times the
-        number of CPUs, or one if there is a single CPU.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.percpu_arena">
-        <term>
-          <mallctl>opt.percpu_arena</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Per CPU arena mode.  Use the <quote>percpu</quote>
-        setting to enable this feature, which uses number of CPUs to determine
-        number of arenas, and bind threads to arenas dynamically based on the
-        CPU the thread runs on currently.  <quote>phycpu</quote> setting uses
-        one arena per physical CPU, which means the two hyper threads on the
-        same CPU share one arena.  Note that no runtime checking regarding the
-        availability of hyper threading is done at the moment.  When set to
-        <quote>disabled</quote>, narenas and thread to arena association will
-        not be impacted by this option.  The default is <quote>disabled</quote>.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.background_thread">
-        <term>
-          <mallctl>opt.background_thread</mallctl>
-          (<type>const bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Internal background worker threads enabled/disabled.
-        Because of potential circular dependencies, enabling background thread
-        using this option may cause crash or deadlock during initialization. For
-        a reliable way to use this feature, see <link
-        linkend="background_thread">background_thread</link> for dynamic control
-        options and details.  This option is disabled by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.max_background_threads">
-        <term>
-          <mallctl>opt.max_background_threads</mallctl>
-          (<type>const size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum number of background threads that will be created
-        if <link linkend="background_thread">background_thread</link> is set.
-        Defaults to number of cpus.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.dirty_decay_ms">
-        <term>
-          <mallctl>opt.dirty_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Approximate time in milliseconds from the creation of a
-        set of unused dirty pages until an equivalent set of unused dirty pages
-        is purged (i.e. converted to muzzy via e.g.
-        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>
-        if supported by the operating system, or converted to clean otherwise)
-        and/or reused.  Dirty pages are defined as previously having been
-        potentially written to by the application, and therefore consuming
-        physical memory, yet having no current use.  The pages are incrementally
-        purged according to a sigmoidal decay curve that starts and ends with
-        zero purge rate.  A decay time of 0 causes all unused dirty pages to be
-        purged immediately upon creation.  A decay time of -1 disables purging.
-        The default decay time is 10 seconds.  See <link
-        linkend="arenas.dirty_decay_ms"><mallctl>arenas.dirty_decay_ms</mallctl></link>
-        and <link
-        linkend="arena.i.dirty_decay_ms"><mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl></link>
-        for related dynamic control options.  See <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
-        for a description of muzzy pages.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.muzzy_decay_ms">
-        <term>
-          <mallctl>opt.muzzy_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Approximate time in milliseconds from the creation of a
-        set of unused muzzy pages until an equivalent set of unused muzzy pages
-        is purged (i.e. converted to clean) and/or reused.  Muzzy pages are
-        defined as previously having been unused dirty pages that were
-        subsequently purged in a manner that left them subject to the
-        reclamation whims of the operating system (e.g.
-        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>),
-        and therefore in an indeterminate state.  The pages are incrementally
-        purged according to a sigmoidal decay curve that starts and ends with
-        zero purge rate.  A decay time of 0 causes all unused muzzy pages to be
-        purged immediately upon creation.  A decay time of -1 disables purging.
-        The default decay time is 10 seconds.  See <link
-        linkend="arenas.muzzy_decay_ms"><mallctl>arenas.muzzy_decay_ms</mallctl></link>
-        and <link
-        linkend="arena.i.muzzy_decay_ms"><mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl></link>
-        for related dynamic control options.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.lg_extent_max_active_fit">
-        <term>
-          <mallctl>opt.lg_extent_max_active_fit</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>When reusing dirty extents, this determines the (log
-        base 2 of the) maximum ratio between the size of the active extent
-        selected (to split off from) and the size of the requested allocation.
-        This prevents the splitting of large active extents for smaller
-        allocations, which can reduce fragmentation over the long run
-        (especially for non-active extents).  Lower value may reduce
-        fragmentation, at the cost of extra active extents.  The default value
-        is 6, which gives a maximum ratio of 64 (2^6).</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.stats_print">
-        <term>
-          <mallctl>opt.stats_print</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Enable/disable statistics printing at exit.  If
-        enabled, the <function>malloc_stats_print()</function>
-        function is called at program exit via an
-        <citerefentry><refentrytitle>atexit</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> function.  <link
-        linkend="opt.stats_print_opts"><mallctl>opt.stats_print_opts</mallctl></link>
-        can be combined to specify output options. If
-        <option>--enable-stats</option> is specified during configuration, this
-        has the potential to cause deadlock for a multi-threaded process that
-        exits while one or more threads are executing in the memory allocation
-        functions.  Furthermore, <function>atexit()</function> may
-        allocate memory during application initialization and then deadlock
-        internally when jemalloc in turn calls
-        <function>atexit()</function>, so this option is not
-        universally usable (though the application can register its own
-        <function>atexit()</function> function with equivalent
-        functionality).  Therefore, this option should only be used with care;
-        it is primarily intended as a performance tuning aid during application
-        development.  This option is disabled by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.stats_print_opts">
-        <term>
-          <mallctl>opt.stats_print_opts</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Options (the <parameter>opts</parameter> string) to pass
-        to the <function>malloc_stats_print()</function> at exit (enabled
-        through <link
-        linkend="opt.stats_print"><mallctl>opt.stats_print</mallctl></link>). See
-        available options in <link
-        linkend="malloc_stats_print_opts"><function>malloc_stats_print()</function></link>.
-        Has no effect unless <link
-        linkend="opt.stats_print"><mallctl>opt.stats_print</mallctl></link> is
-        enabled.  The default is <quote></quote>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.junk">
-        <term>
-          <mallctl>opt.junk</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-          [<option>--enable-fill</option>]
-        </term>
-        <listitem><para>Junk filling.  If set to <quote>alloc</quote>, each byte
-        of uninitialized allocated memory will be initialized to
-        <literal>0xa5</literal>.  If set to <quote>free</quote>, all deallocated
-        memory will be initialized to <literal>0x5a</literal>.  If set to
-        <quote>true</quote>, both allocated and deallocated memory will be
-        initialized, and if set to <quote>false</quote>, junk filling be
-        disabled entirely.  This is intended for debugging and will impact
-        performance negatively.  This option is <quote>false</quote> by default
-        unless <option>--enable-debug</option> is specified during
-        configuration, in which case it is <quote>true</quote> by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.zero">
-        <term>
-          <mallctl>opt.zero</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-fill</option>]
-        </term>
-        <listitem><para>Zero filling enabled/disabled.  If enabled, each byte
-        of uninitialized allocated memory will be initialized to 0.  Note that
-        this initialization only happens once for each byte, so
-        <function>realloc()</function> and
-        <function>rallocx()</function> calls do not zero memory that
-        was previously allocated.  This is intended for debugging and will
-        impact performance negatively.  This option is disabled by default.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.utrace">
-        <term>
-          <mallctl>opt.utrace</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-utrace</option>]
-        </term>
-        <listitem><para>Allocation tracing based on
-        <citerefentry><refentrytitle>utrace</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> enabled/disabled.  This option
-        is disabled by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.xmalloc">
-        <term>
-          <mallctl>opt.xmalloc</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-xmalloc</option>]
-        </term>
-        <listitem><para>Abort-on-out-of-memory enabled/disabled.  If enabled,
-        rather than returning failure for any allocation function, display a
-        diagnostic message on <constant>STDERR_FILENO</constant> and cause the
-        program to drop core (using
-        <citerefentry><refentrytitle>abort</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry>).  If an application is
-        designed to depend on this behavior, set the option at compile time by
-        including the following in the source code:
-        <programlisting language="C"><![CDATA[
-malloc_conf = "xmalloc:true";]]></programlisting>
-        This option is disabled by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.tcache">
-        <term>
-          <mallctl>opt.tcache</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Thread-specific caching (tcache) enabled/disabled.  When
-        there are multiple threads, each thread uses a tcache for objects up to
-        a certain size.  Thread-specific caching allows many allocations to be
-        satisfied without performing any thread synchronization, at the cost of
-        increased memory use.  See the <link
-        linkend="opt.lg_tcache_max"><mallctl>opt.lg_tcache_max</mallctl></link>
-        option for related tuning information.  This option is enabled by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.lg_tcache_max">
-        <term>
-          <mallctl>opt.lg_tcache_max</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum size class (log base 2) to cache in the
-        thread-specific cache (tcache).  At a minimum, all small size classes
-        are cached, and at a maximum all large size classes are cached.  The
-        default maximum is 32 KiB (2^15).</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.thp">
-        <term>
-          <mallctl>opt.thp</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Transparent hugepage (THP) mode. Settings "always",
-        "never" and "default" are available if THP is supported by the operating
-        system.  The "always" setting enables transparent hugepage for all user
-        memory mappings with
-        <parameter><constant>MADV_HUGEPAGE</constant></parameter>; "never"
-        ensures no transparent hugepage with
-        <parameter><constant>MADV_NOHUGEPAGE</constant></parameter>; the default
-        setting "default" makes no changes.  Note that: this option does not
-        affect THP for jemalloc internal metadata (see <link
-        linkend="opt.metadata_thp"><mallctl>opt.metadata_thp</mallctl></link>);
-        in addition, for arenas with customized <link
-        linkend="arena.i.extent_hooks"><mallctl>extent_hooks</mallctl></link>,
-        this option is bypassed as it is implemented as part of the default
-        extent hooks.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof">
-        <term>
-          <mallctl>opt.prof</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Memory profiling enabled/disabled.  If enabled, profile
-        memory allocation activity.  See the <link
-        linkend="opt.prof_active"><mallctl>opt.prof_active</mallctl></link>
-        option for on-the-fly activation/deactivation.  See the <link
-        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>
-        option for probabilistic sampling control.  See the <link
-        linkend="opt.prof_accum"><mallctl>opt.prof_accum</mallctl></link>
-        option for control of cumulative sample reporting.  See the <link
-        linkend="opt.lg_prof_interval"><mallctl>opt.lg_prof_interval</mallctl></link>
-        option for information on interval-triggered profile dumping, the <link
-        linkend="opt.prof_gdump"><mallctl>opt.prof_gdump</mallctl></link>
-        option for information on high-water-triggered profile dumping, and the
-        <link linkend="opt.prof_final"><mallctl>opt.prof_final</mallctl></link>
-        option for final profile dumping.  Profile output is compatible with
-        the <command>jeprof</command> command, which is based on the
-        <command>pprof</command> that is developed as part of the <ulink
-        url="http://code.google.com/p/gperftools/">gperftools
-        package</ulink>.  See <link linkend="heap_profile_format">HEAP PROFILE
-        FORMAT</link> for heap profile format documentation.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_prefix">
-        <term>
-          <mallctl>opt.prof_prefix</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Filename prefix for profile dumps.  If the prefix is
-        set to the empty string, no automatic dumps will occur; this is
-        primarily useful for disabling the automatic final heap dump (which
-        also disables leak reporting, if enabled).  The default prefix is
-        <filename>jeprof</filename>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_active">
-        <term>
-          <mallctl>opt.prof_active</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Profiling activated/deactivated.  This is a secondary
-        control mechanism that makes it possible to start the application with
-        profiling enabled (see the <link
-        linkend="opt.prof"><mallctl>opt.prof</mallctl></link> option) but
-        inactive, then toggle profiling at any time during program execution
-        with the <link
-        linkend="prof.active"><mallctl>prof.active</mallctl></link> mallctl.
-        This option is enabled by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_thread_active_init">
-        <term>
-          <mallctl>opt.prof_thread_active_init</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Initial setting for <link
-        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
-        in newly created threads.  The initial setting for newly created threads
-        can also be changed during execution via the <link
-        linkend="prof.thread_active_init"><mallctl>prof.thread_active_init</mallctl></link>
-        mallctl.  This option is enabled by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.lg_prof_sample">
-        <term>
-          <mallctl>opt.lg_prof_sample</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Average interval (log base 2) between allocation
-        samples, as measured in bytes of allocation activity.  Increasing the
-        sampling interval decreases profile fidelity, but also decreases the
-        computational overhead.  The default sample interval is 512 KiB (2^19
-        B).</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_accum">
-        <term>
-          <mallctl>opt.prof_accum</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Reporting of cumulative object/byte counts in profile
-        dumps enabled/disabled.  If this option is enabled, every unique
-        backtrace must be stored for the duration of execution.  Depending on
-        the application, this can impose a large memory overhead, and the
-        cumulative counts are not always of interest.  This option is disabled
-        by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.lg_prof_interval">
-        <term>
-          <mallctl>opt.lg_prof_interval</mallctl>
-          (<type>ssize_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Average interval (log base 2) between memory profile
-        dumps, as measured in bytes of allocation activity.  The actual
-        interval between dumps may be sporadic because decentralized allocation
-        counters are used to avoid synchronization bottlenecks.  Profiles are
-        dumped to files named according to the pattern
-        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.i&lt;iseq&gt;.heap</filename>,
-        where <literal>&lt;prefix&gt;</literal> is controlled by the
-        <link
-        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
-        option.  By default, interval-triggered profile dumping is disabled
-        (encoded as -1).
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_gdump">
-        <term>
-          <mallctl>opt.prof_gdump</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Set the initial state of <link
-        linkend="prof.gdump"><mallctl>prof.gdump</mallctl></link>, which when
-        enabled triggers a memory profile dump every time the total virtual
-        memory exceeds the previous maximum.  This option is disabled by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_final">
-        <term>
-          <mallctl>opt.prof_final</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Use an
-        <citerefentry><refentrytitle>atexit</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> function to dump final memory
-        usage to a file named according to the pattern
-        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.f.heap</filename>,
-        where <literal>&lt;prefix&gt;</literal> is controlled by the <link
-        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
-        option.  Note that <function>atexit()</function> may allocate
-        memory during application initialization and then deadlock internally
-        when jemalloc in turn calls <function>atexit()</function>, so
-        this option is not universally usable (though the application can
-        register its own <function>atexit()</function> function with
-        equivalent functionality).  This option is disabled by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="opt.prof_leak">
-        <term>
-          <mallctl>opt.prof_leak</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Leak reporting enabled/disabled.  If enabled, use an
-        <citerefentry><refentrytitle>atexit</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> function to report memory leaks
-        detected by allocation sampling.  See the
-        <link linkend="opt.prof"><mallctl>opt.prof</mallctl></link> option for
-        information on analyzing heap profile output.  This option is disabled
-        by default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.arena">
-        <term>
-          <mallctl>thread.arena</mallctl>
-          (<type>unsigned</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Get or set the arena associated with the calling
-        thread.  If the specified arena was not initialized beforehand (see the
-        <link
-        linkend="arena.i.initialized"><mallctl>arena.i.initialized</mallctl></link>
-        mallctl), it will be automatically initialized as a side effect of
-        calling this interface.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.allocated">
-        <term>
-          <mallctl>thread.allocated</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Get the total number of bytes ever allocated by the
-        calling thread.  This counter has the potential to wrap around; it is
-        up to the application to appropriately interpret the counter in such
-        cases.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.allocatedp">
-        <term>
-          <mallctl>thread.allocatedp</mallctl>
-          (<type>uint64_t *</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Get a pointer to the the value that is returned by the
-        <link
-        linkend="thread.allocated"><mallctl>thread.allocated</mallctl></link>
-        mallctl.  This is useful for avoiding the overhead of repeated
-        <function>mallctl*()</function> calls.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.deallocated">
-        <term>
-          <mallctl>thread.deallocated</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Get the total number of bytes ever deallocated by the
-        calling thread.  This counter has the potential to wrap around; it is
-        up to the application to appropriately interpret the counter in such
-        cases.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.deallocatedp">
-        <term>
-          <mallctl>thread.deallocatedp</mallctl>
-          (<type>uint64_t *</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Get a pointer to the the value that is returned by the
-        <link
-        linkend="thread.deallocated"><mallctl>thread.deallocated</mallctl></link>
-        mallctl.  This is useful for avoiding the overhead of repeated
-        <function>mallctl*()</function> calls.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.tcache.enabled">
-        <term>
-          <mallctl>thread.tcache.enabled</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Enable/disable calling thread's tcache.  The tcache is
-        implicitly flushed as a side effect of becoming
-        disabled (see <link
-        linkend="thread.tcache.flush"><mallctl>thread.tcache.flush</mallctl></link>).
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.tcache.flush">
-        <term>
-          <mallctl>thread.tcache.flush</mallctl>
-          (<type>void</type>)
-          <literal>--</literal>
-        </term>
-        <listitem><para>Flush calling thread's thread-specific cache (tcache).
-        This interface releases all cached objects and internal data structures
-        associated with the calling thread's tcache.  Ordinarily, this interface
-        need not be called, since automatic periodic incremental garbage
-        collection occurs, and the thread cache is automatically discarded when
-        a thread exits.  However, garbage collection is triggered by allocation
-        activity, so it is possible for a thread that stops
-        allocating/deallocating to retain its cache indefinitely, in which case
-        the developer may find manual flushing useful.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.prof.name">
-        <term>
-          <mallctl>thread.prof.name</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal> or
-          <literal>-w</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Get/set the descriptive name associated with the calling
-        thread in memory profile dumps.  An internal copy of the name string is
-        created, so the input string need not be maintained after this interface
-        completes execution.  The output string of this interface should be
-        copied for non-ephemeral uses, because multiple implementation details
-        can cause asynchronous string deallocation.  Furthermore, each
-        invocation of this interface can only read or write; simultaneous
-        read/write is not supported due to string lifetime limitations.  The
-        name string must be nil-terminated and comprised only of characters in
-        the sets recognized
-        by <citerefentry><refentrytitle>isgraph</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry> and
-        <citerefentry><refentrytitle>isblank</refentrytitle>
-        <manvolnum>3</manvolnum></citerefentry>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="thread.prof.active">
-        <term>
-          <mallctl>thread.prof.active</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Control whether sampling is currently active for the
-        calling thread.  This is an activation mechanism in addition to <link
-        linkend="prof.active"><mallctl>prof.active</mallctl></link>; both must
-        be active for the calling thread to sample.  This flag is enabled by
-        default.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="tcache.create">
-        <term>
-          <mallctl>tcache.create</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Create an explicit thread-specific cache (tcache) and
-        return an identifier that can be passed to the <link
-        linkend="MALLOCX_TCACHE"><constant>MALLOCX_TCACHE(<parameter>tc</parameter>)</constant></link>
-        macro to explicitly use the specified cache rather than the
-        automatically managed one that is used by default.  Each explicit cache
-        can be used by only one thread at a time; the application must assure
-        that this constraint holds.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="tcache.flush">
-        <term>
-          <mallctl>tcache.flush</mallctl>
-          (<type>unsigned</type>)
-          <literal>-w</literal>
-        </term>
-        <listitem><para>Flush the specified thread-specific cache (tcache).  The
-        same considerations apply to this interface as to <link
-        linkend="thread.tcache.flush"><mallctl>thread.tcache.flush</mallctl></link>,
-        except that the tcache will never be automatically discarded.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="tcache.destroy">
-        <term>
-          <mallctl>tcache.destroy</mallctl>
-          (<type>unsigned</type>)
-          <literal>-w</literal>
-        </term>
-        <listitem><para>Flush the specified thread-specific cache (tcache) and
-        make the identifier available for use during a future tcache creation.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.initialized">
-        <term>
-          <mallctl>arena.&lt;i&gt;.initialized</mallctl>
-          (<type>bool</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Get whether the specified arena's statistics are
-        initialized (i.e. the arena was initialized prior to the current epoch).
-        This interface can also be nominally used to query whether the merged
-        statistics corresponding to <constant>MALLCTL_ARENAS_ALL</constant> are
-        initialized (always true).</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.decay">
-        <term>
-          <mallctl>arena.&lt;i&gt;.decay</mallctl>
-          (<type>void</type>)
-          <literal>--</literal>
-        </term>
-        <listitem><para>Trigger decay-based purging of unused dirty/muzzy pages
-        for arena &lt;i&gt;, or for all arenas if &lt;i&gt; equals
-        <constant>MALLCTL_ARENAS_ALL</constant>.  The proportion of unused
-        dirty/muzzy pages to be purged depends on the current time; see <link
-        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
-        and <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzy_decay_ms</mallctl></link>
-        for details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.purge">
-        <term>
-          <mallctl>arena.&lt;i&gt;.purge</mallctl>
-          (<type>void</type>)
-          <literal>--</literal>
-        </term>
-        <listitem><para>Purge all unused dirty pages for arena &lt;i&gt;, or for
-        all arenas if &lt;i&gt; equals <constant>MALLCTL_ARENAS_ALL</constant>.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.reset">
-        <term>
-          <mallctl>arena.&lt;i&gt;.reset</mallctl>
-          (<type>void</type>)
-          <literal>--</literal>
-        </term>
-        <listitem><para>Discard all of the arena's extant allocations.  This
-        interface can only be used with arenas explicitly created via <link
-        linkend="arenas.create"><mallctl>arenas.create</mallctl></link>.  None
-        of the arena's discarded/cached allocations may accessed afterward.  As
-        part of this requirement, all thread caches which were used to
-        allocate/deallocate in conjunction with the arena must be flushed
-        beforehand.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.destroy">
-        <term>
-          <mallctl>arena.&lt;i&gt;.destroy</mallctl>
-          (<type>void</type>)
-          <literal>--</literal>
-        </term>
-        <listitem><para>Destroy the arena.  Discard all of the arena's extant
-        allocations using the same mechanism as for <link
-        linkend="arena.i.reset"><mallctl>arena.&lt;i&gt;.reset</mallctl></link>
-        (with all the same constraints and side effects), merge the arena stats
-        into those accessible at arena index
-        <constant>MALLCTL_ARENAS_DESTROYED</constant>, and then completely
-        discard all metadata associated with the arena.  Future calls to <link
-        linkend="arenas.create"><mallctl>arenas.create</mallctl></link> may
-        recycle the arena index.  Destruction will fail if any threads are
-        currently associated with the arena as a result of calls to <link
-        linkend="thread.arena"><mallctl>thread.arena</mallctl></link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.dss">
-        <term>
-          <mallctl>arena.&lt;i&gt;.dss</mallctl>
-          (<type>const char *</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Set the precedence of dss allocation as related to mmap
-        allocation for arena &lt;i&gt;, or for all arenas if &lt;i&gt; equals
-        <constant>MALLCTL_ARENAS_ALL</constant>.  See <link
-        linkend="opt.dss"><mallctl>opt.dss</mallctl></link> for supported
-        settings.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.dirty_decay_ms">
-        <term>
-          <mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Current per-arena approximate time in milliseconds from
-        the creation of a set of unused dirty pages until an equivalent set of
-        unused dirty pages is purged and/or reused.  Each time this interface is
-        set, all currently unused dirty pages are considered to have fully
-        decayed, which causes immediate purging of all unused dirty pages unless
-        the decay time is set to -1 (i.e. purging disabled).  See <link
-        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
-        for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.muzzy_decay_ms">
-        <term>
-          <mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Current per-arena approximate time in milliseconds from
-        the creation of a set of unused muzzy pages until an equivalent set of
-        unused muzzy pages is purged and/or reused.  Each time this interface is
-        set, all currently unused muzzy pages are considered to have fully
-        decayed, which causes immediate purging of all unused muzzy pages unless
-        the decay time is set to -1 (i.e. purging disabled).  See <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
-        for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.retain_grow_limit">
-        <term>
-          <mallctl>arena.&lt;i&gt;.retain_grow_limit</mallctl>
-          (<type>size_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Maximum size to grow retained region (only relevant when
-        <link linkend="opt.retain"><mallctl>opt.retain</mallctl></link> is
-        enabled).  This controls the maximum increment to expand virtual memory,
-        or allocation through <link
-        linkend="arena.i.extent_hooks"><mallctl>arena.&lt;i&gt;extent_hooks</mallctl></link>.
-        In particular, if customized extent hooks reserve physical memory
-        (e.g. 1G huge pages), this is useful to control the allocation hook's
-        input size.  The default is no limit.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arena.i.extent_hooks">
-        <term>
-          <mallctl>arena.&lt;i&gt;.extent_hooks</mallctl>
-          (<type>extent_hooks_t *</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Get or set the extent management hook functions for
-        arena &lt;i&gt;.  The functions must be capable of operating on all
-        extant extents associated with arena &lt;i&gt;, usually by passing
-        unknown extents to the replaced functions.  In practice, it is feasible
-        to control allocation for arenas explicitly created via <link
-        linkend="arenas.create"><mallctl>arenas.create</mallctl></link> such
-        that all extents originate from an application-supplied extent allocator
-        (by specifying the custom extent hook functions during arena creation),
-        but the automatically created arenas will have already created extents
-        prior to the application having an opportunity to take over extent
-        allocation.</para>
-
-        <programlisting language="C"><![CDATA[
-typedef extent_hooks_s extent_hooks_t;
-struct extent_hooks_s {
-	extent_alloc_t		*alloc;
-	extent_dalloc_t		*dalloc;
-	extent_destroy_t	*destroy;
-	extent_commit_t		*commit;
-	extent_decommit_t	*decommit;
-	extent_purge_t		*purge_lazy;
-	extent_purge_t		*purge_forced;
-	extent_split_t		*split;
-	extent_merge_t		*merge;
-};]]></programlisting>
-        <para>The <type>extent_hooks_t</type> structure comprises function
-        pointers which are described individually below.  jemalloc uses these
-        functions to manage extent lifetime, which starts off with allocation of
-        mapped committed memory, in the simplest case followed by deallocation.
-        However, there are performance and platform reasons to retain extents
-        for later reuse.  Cleanup attempts cascade from deallocation to decommit
-        to forced purging to lazy purging, which gives the extent management
-        functions opportunities to reject the most permanent cleanup operations
-        in favor of less permanent (and often less costly) operations.  All
-        operations except allocation can be universally opted out of by setting
-        the hook pointers to <constant>NULL</constant>, or selectively opted out
-        of by returning failure.  Note that once the extent hook is set, the
-        structure is accessed directly by the associated arenas, so it must
-        remain valid for the entire lifetime of the arenas.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef void *<function>(extent_alloc_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>new_addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>alignment</parameter></paramdef>
-          <paramdef>bool *<parameter>zero</parameter></paramdef>
-          <paramdef>bool *<parameter>commit</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent allocation function conforms to the
-        <type>extent_alloc_t</type> type and upon success returns a pointer to
-        <parameter>size</parameter> bytes of mapped memory on behalf of arena
-        <parameter>arena_ind</parameter> such that the extent's base address is
-        a multiple of <parameter>alignment</parameter>, as well as setting
-        <parameter>*zero</parameter> to indicate whether the extent is zeroed
-        and <parameter>*commit</parameter> to indicate whether the extent is
-        committed.  Upon error the function returns <constant>NULL</constant>
-        and leaves <parameter>*zero</parameter> and
-        <parameter>*commit</parameter> unmodified.  The
-        <parameter>size</parameter> parameter is always a multiple of the page
-        size.  The <parameter>alignment</parameter> parameter is always a power
-        of two at least as large as the page size.  Zeroing is mandatory if
-        <parameter>*zero</parameter> is true upon function entry.  Committing is
-        mandatory if <parameter>*commit</parameter> is true upon function entry.
-        If <parameter>new_addr</parameter> is not <constant>NULL</constant>, the
-        returned pointer must be <parameter>new_addr</parameter> on success or
-        <constant>NULL</constant> on error.  Committed memory may be committed
-        in absolute terms as on a system that does not overcommit, or in
-        implicit terms as on a system that overcommits and satisfies physical
-        memory needs on demand via soft page faults.  Note that replacing the
-        default extent allocation function makes the arena's <link
-        linkend="arena.i.dss"><mallctl>arena.&lt;i&gt;.dss</mallctl></link>
-        setting irrelevant.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_dalloc_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>bool <parameter>committed</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>
-        An extent deallocation function conforms to the
-        <type>extent_dalloc_t</type> type and deallocates an extent at given
-        <parameter>addr</parameter> and <parameter>size</parameter> with
-        <parameter>committed</parameter>/decommited memory as indicated, on
-        behalf of arena <parameter>arena_ind</parameter>, returning false upon
-        success.  If the function returns true, this indicates opt-out from
-        deallocation; the virtual memory mapping associated with the extent
-        remains mapped, in the same commit state, and available for future use,
-        in which case it will be automatically retained for later reuse.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef void <function>(extent_destroy_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>bool <parameter>committed</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>
-        An extent destruction function conforms to the
-        <type>extent_destroy_t</type> type and unconditionally destroys an
-        extent at given <parameter>addr</parameter> and
-        <parameter>size</parameter> with
-        <parameter>committed</parameter>/decommited memory as indicated, on
-        behalf of arena <parameter>arena_ind</parameter>.  This function may be
-        called to destroy retained extents during arena destruction (see <link
-        linkend="arena.i.destroy"><mallctl>arena.&lt;i&gt;.destroy</mallctl></link>).</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_commit_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>offset</parameter></paramdef>
-          <paramdef>size_t <parameter>length</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent commit function conforms to the
-        <type>extent_commit_t</type> type and commits zeroed physical memory to
-        back pages within an extent at given <parameter>addr</parameter> and
-        <parameter>size</parameter> at <parameter>offset</parameter> bytes,
-        extending for <parameter>length</parameter> on behalf of arena
-        <parameter>arena_ind</parameter>, returning false upon success.
-        Committed memory may be committed in absolute terms as on a system that
-        does not overcommit, or in implicit terms as on a system that
-        overcommits and satisfies physical memory needs on demand via soft page
-        faults. If the function returns true, this indicates insufficient
-        physical memory to satisfy the request.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_decommit_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>offset</parameter></paramdef>
-          <paramdef>size_t <parameter>length</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent decommit function conforms to the
-        <type>extent_decommit_t</type> type and decommits any physical memory
-        that is backing pages within an extent at given
-        <parameter>addr</parameter> and <parameter>size</parameter> at
-        <parameter>offset</parameter> bytes, extending for
-        <parameter>length</parameter> on behalf of arena
-        <parameter>arena_ind</parameter>, returning false upon success, in which
-        case the pages will be committed via the extent commit function before
-        being reused.  If the function returns true, this indicates opt-out from
-        decommit; the memory remains committed and available for future use, in
-        which case it will be automatically retained for later reuse.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_purge_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>offset</parameter></paramdef>
-          <paramdef>size_t <parameter>length</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent purge function conforms to the
-        <type>extent_purge_t</type> type and discards physical pages
-        within the virtual memory mapping associated with an extent at given
-        <parameter>addr</parameter> and <parameter>size</parameter> at
-        <parameter>offset</parameter> bytes, extending for
-        <parameter>length</parameter> on behalf of arena
-        <parameter>arena_ind</parameter>.  A lazy extent purge function (e.g.
-        implemented via
-        <function>madvise(<parameter>...</parameter><parameter><constant>MADV_FREE</constant></parameter>)</function>)
-        can delay purging indefinitely and leave the pages within the purged
-        virtual memory range in an indeterminite state, whereas a forced extent
-        purge function immediately purges, and the pages within the virtual
-        memory range will be zero-filled the next time they are accessed.  If
-        the function returns true, this indicates failure to purge.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_split_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr</parameter></paramdef>
-          <paramdef>size_t <parameter>size</parameter></paramdef>
-          <paramdef>size_t <parameter>size_a</parameter></paramdef>
-          <paramdef>size_t <parameter>size_b</parameter></paramdef>
-          <paramdef>bool <parameter>committed</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent split function conforms to the
-        <type>extent_split_t</type> type and optionally splits an extent at
-        given <parameter>addr</parameter> and <parameter>size</parameter> into
-        two adjacent extents, the first of <parameter>size_a</parameter> bytes,
-        and the second of <parameter>size_b</parameter> bytes, operating on
-        <parameter>committed</parameter>/decommitted memory as indicated, on
-        behalf of arena <parameter>arena_ind</parameter>, returning false upon
-        success.  If the function returns true, this indicates that the extent
-        remains unsplit and therefore should continue to be operated on as a
-        whole.</para>
-
-        <funcsynopsis><funcprototype>
-          <funcdef>typedef bool <function>(extent_merge_t)</function></funcdef>
-          <paramdef>extent_hooks_t *<parameter>extent_hooks</parameter></paramdef>
-          <paramdef>void *<parameter>addr_a</parameter></paramdef>
-          <paramdef>size_t <parameter>size_a</parameter></paramdef>
-          <paramdef>void *<parameter>addr_b</parameter></paramdef>
-          <paramdef>size_t <parameter>size_b</parameter></paramdef>
-          <paramdef>bool <parameter>committed</parameter></paramdef>
-          <paramdef>unsigned <parameter>arena_ind</parameter></paramdef>
-        </funcprototype></funcsynopsis>
-        <literallayout></literallayout>
-        <para>An extent merge function conforms to the
-        <type>extent_merge_t</type> type and optionally merges adjacent extents,
-        at given <parameter>addr_a</parameter> and <parameter>size_a</parameter>
-        with given <parameter>addr_b</parameter> and
-        <parameter>size_b</parameter> into one contiguous extent, operating on
-        <parameter>committed</parameter>/decommitted memory as indicated, on
-        behalf of arena <parameter>arena_ind</parameter>, returning false upon
-        success.  If the function returns true, this indicates that the extents
-        remain distinct mappings and therefore should continue to be operated on
-        independently.</para>
-        </listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.narenas">
-        <term>
-          <mallctl>arenas.narenas</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Current limit on number of arenas.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.dirty_decay_ms">
-        <term>
-          <mallctl>arenas.dirty_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Current default per-arena approximate time in
-        milliseconds from the creation of a set of unused dirty pages until an
-        equivalent set of unused dirty pages is purged and/or reused, used to
-        initialize <link
-        linkend="arena.i.dirty_decay_ms"><mallctl>arena.&lt;i&gt;.dirty_decay_ms</mallctl></link>
-        during arena creation.  See <link
-        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
-        for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.muzzy_decay_ms">
-        <term>
-          <mallctl>arenas.muzzy_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Current default per-arena approximate time in
-        milliseconds from the creation of a set of unused muzzy pages until an
-        equivalent set of unused muzzy pages is purged and/or reused, used to
-        initialize <link
-        linkend="arena.i.muzzy_decay_ms"><mallctl>arena.&lt;i&gt;.muzzy_decay_ms</mallctl></link>
-        during arena creation.  See <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
-        for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.quantum">
-        <term>
-          <mallctl>arenas.quantum</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Quantum size.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.page">
-        <term>
-          <mallctl>arenas.page</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Page size.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.tcache_max">
-        <term>
-          <mallctl>arenas.tcache_max</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum thread-cached size class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.nbins">
-        <term>
-          <mallctl>arenas.nbins</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of bin size classes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.nhbins">
-        <term>
-          <mallctl>arenas.nhbins</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Total number of thread cache bin size
-        classes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.bin.i.size">
-        <term>
-          <mallctl>arenas.bin.&lt;i&gt;.size</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum size supported by size class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.bin.i.nregs">
-        <term>
-          <mallctl>arenas.bin.&lt;i&gt;.nregs</mallctl>
-          (<type>uint32_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of regions per slab.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.bin.i.slab_size">
-        <term>
-          <mallctl>arenas.bin.&lt;i&gt;.slab_size</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of bytes per slab.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.nlextents">
-        <term>
-          <mallctl>arenas.nlextents</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Total number of large size classes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.lextent.i.size">
-        <term>
-          <mallctl>arenas.lextent.&lt;i&gt;.size</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Maximum size supported by this large size
-        class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.create">
-        <term>
-          <mallctl>arenas.create</mallctl>
-          (<type>unsigned</type>, <type>extent_hooks_t *</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Explicitly create a new arena outside the range of
-        automatically managed arenas, with optionally specified extent hooks,
-        and return the new arena index.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="arenas.lookup">
-        <term>
-          <mallctl>arenas.lookup</mallctl>
-          (<type>unsigned</type>, <type>void*</type>)
-          <literal>rw</literal>
-        </term>
-        <listitem><para>Index of the arena to which an allocation belongs to.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.thread_active_init">
-        <term>
-          <mallctl>prof.thread_active_init</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Control the initial setting for <link
-        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
-        in newly created threads.  See the <link
-        linkend="opt.prof_thread_active_init"><mallctl>opt.prof_thread_active_init</mallctl></link>
-        option for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.active">
-        <term>
-          <mallctl>prof.active</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Control whether sampling is currently active.  See the
-        <link
-        linkend="opt.prof_active"><mallctl>opt.prof_active</mallctl></link>
-        option for additional information, as well as the interrelated <link
-        linkend="thread.prof.active"><mallctl>thread.prof.active</mallctl></link>
-        mallctl.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.dump">
-        <term>
-          <mallctl>prof.dump</mallctl>
-          (<type>const char *</type>)
-          <literal>-w</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Dump a memory profile to the specified file, or if NULL
-        is specified, to a file according to the pattern
-        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.m&lt;mseq&gt;.heap</filename>,
-        where <literal>&lt;prefix&gt;</literal> is controlled by the
-        <link
-        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
-        option.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.gdump">
-        <term>
-          <mallctl>prof.gdump</mallctl>
-          (<type>bool</type>)
-          <literal>rw</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>When enabled, trigger a memory profile dump every time
-        the total virtual memory exceeds the previous maximum.  Profiles are
-        dumped to files named according to the pattern
-        <filename>&lt;prefix&gt;.&lt;pid&gt;.&lt;seq&gt;.u&lt;useq&gt;.heap</filename>,
-        where <literal>&lt;prefix&gt;</literal> is controlled by the <link
-        linkend="opt.prof_prefix"><mallctl>opt.prof_prefix</mallctl></link>
-        option.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.reset">
-        <term>
-          <mallctl>prof.reset</mallctl>
-          (<type>size_t</type>)
-          <literal>-w</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Reset all memory profile statistics, and optionally
-        update the sample rate (see <link
-        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>
-        and <link
-        linkend="prof.lg_sample"><mallctl>prof.lg_sample</mallctl></link>).
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.lg_sample">
-        <term>
-          <mallctl>prof.lg_sample</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Get the current sample rate (see <link
-        linkend="opt.lg_prof_sample"><mallctl>opt.lg_prof_sample</mallctl></link>).
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="prof.interval">
-        <term>
-          <mallctl>prof.interval</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-prof</option>]
-        </term>
-        <listitem><para>Average number of bytes allocated between
-        interval-based profile dumps.  See the
-        <link
-        linkend="opt.lg_prof_interval"><mallctl>opt.lg_prof_interval</mallctl></link>
-        option for additional information.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.allocated">
-        <term>
-          <mallctl>stats.allocated</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Total number of bytes allocated by the
-        application.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.active">
-        <term>
-          <mallctl>stats.active</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Total number of bytes in active pages allocated by the
-        application.  This is a multiple of the page size, and greater than or
-        equal to <link
-        linkend="stats.allocated"><mallctl>stats.allocated</mallctl></link>.
-        This does not include <link linkend="stats.arenas.i.pdirty">
-        <mallctl>stats.arenas.&lt;i&gt;.pdirty</mallctl></link>,
-        <link linkend="stats.arenas.i.pmuzzy">
-        <mallctl>stats.arenas.&lt;i&gt;.pmuzzy</mallctl></link>, nor pages
-        entirely devoted to allocator metadata.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.metadata">
-        <term>
-          <mallctl>stats.metadata</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Total number of bytes dedicated to metadata, which
-        comprise base allocations used for bootstrap-sensitive allocator
-        metadata structures (see <link
-        linkend="stats.arenas.i.base"><mallctl>stats.arenas.&lt;i&gt;.base</mallctl></link>)
-        and internal allocations (see <link
-        linkend="stats.arenas.i.internal"><mallctl>stats.arenas.&lt;i&gt;.internal</mallctl></link>).
-        Transparent huge page (enabled with <link
-        linkend="opt.metadata_thp">opt.metadata_thp</link>) usage is not
-        considered.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.metadata_thp">
-        <term>
-          <mallctl>stats.metadata_thp</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of transparent huge pages (THP) used for
-        metadata.  See <link
-        linkend="stats.metadata"><mallctl>stats.metadata</mallctl></link> and
-        <link linkend="opt.metadata_thp">opt.metadata_thp</link>) for
-        details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.resident">
-        <term>
-          <mallctl>stats.resident</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Maximum number of bytes in physically resident data
-        pages mapped by the allocator, comprising all pages dedicated to
-        allocator metadata, pages backing active allocations, and unused dirty
-        pages.  This is a maximum rather than precise because pages may not
-        actually be physically resident if they correspond to demand-zeroed
-        virtual memory that has not yet been touched.  This is a multiple of the
-        page size, and is larger than <link
-        linkend="stats.active"><mallctl>stats.active</mallctl></link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.mapped">
-        <term>
-          <mallctl>stats.mapped</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Total number of bytes in active extents mapped by the
-        allocator.  This is larger than <link
-        linkend="stats.active"><mallctl>stats.active</mallctl></link>.  This
-        does not include inactive extents, even those that contain unused dirty
-        pages, which means that there is no strict ordering between this and
-        <link
-        linkend="stats.resident"><mallctl>stats.resident</mallctl></link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.retained">
-        <term>
-          <mallctl>stats.retained</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Total number of bytes in virtual memory mappings that
-        were retained rather than being returned to the operating system via
-        e.g. <citerefentry><refentrytitle>munmap</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> or similar.  Retained virtual
-        memory is typically untouched, decommitted, or purged, so it has no
-        strongly associated physical memory (see <link
-        linkend="arena.i.extent_hooks">extent hooks</link> for details).
-        Retained memory is excluded from mapped memory statistics, e.g. <link
-        linkend="stats.mapped"><mallctl>stats.mapped</mallctl></link>.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.background_thread.num_threads">
-        <term>
-          <mallctl>stats.background_thread.num_threads</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para> Number of <link linkend="background_thread">background
-        threads</link> running currently.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.background_thread.num_runs">
-        <term>
-          <mallctl>stats.background_thread.num_runs</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para> Total number of runs from all <link
-        linkend="background_thread">background threads</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.background_thread.run_interval">
-        <term>
-          <mallctl>stats.background_thread.run_interval</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para> Average run interval in nanoseconds of <link
-        linkend="background_thread">background threads</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.mutexes.ctl">
-        <term>
-          <mallctl>stats.mutexes.ctl.{counter};</mallctl>
-          (<type>counter specific type</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>ctl</varname> mutex (global
-        scope; mallctl related).  <mallctl>{counter}</mallctl> is one of the
-        counters below:</para>
-        <varlistentry id="mutex_counters">
-          <listitem><para><varname>num_ops</varname> (<type>uint64_t</type>):
-          Total number of lock acquisition operations on this mutex.</para>
-
-	  <para><varname>num_spin_acq</varname> (<type>uint64_t</type>): Number
-	  of times the mutex was spin-acquired.  When the mutex is currently
-	  locked and cannot be acquired immediately, a short period of
-	  spin-retry within jemalloc will be performed.  Acquired through spin
-	  generally means the contention was lightweight and not causing context
-	  switches.</para>
-
-	  <para><varname>num_wait</varname> (<type>uint64_t</type>): Number of
-	  times the mutex was wait-acquired, which means the mutex contention
-	  was not solved by spin-retry, and blocking operation was likely
-	  involved in order to acquire the mutex.  This event generally implies
-	  higher cost / longer delay, and should be investigated if it happens
-	  often.</para>
-
-	  <para><varname>max_wait_time</varname> (<type>uint64_t</type>):
-	  Maximum length of time in nanoseconds spent on a single wait-acquired
-	  lock operation.  Note that to avoid profiling overhead on the common
-	  path, this does not consider spin-acquired cases.</para>
-
-	  <para><varname>total_wait_time</varname> (<type>uint64_t</type>):
-	  Cumulative time in nanoseconds spent on wait-acquired lock operations.
-	  Similarly, spin-acquired cases are not considered.</para>
-
-	  <para><varname>max_num_thds</varname> (<type>uint32_t</type>): Maximum
-	  number of threads waiting on this mutex simultaneously.  Similarly,
-	  spin-acquired cases are not considered.</para>
-
-	  <para><varname>num_owner_switch</varname> (<type>uint64_t</type>):
-	  Number of times the current mutex owner is different from the previous
-	  one.  This event does not generally imply an issue; rather it is an
-	  indicator of how often the protected data are accessed by different
-	  threads.
-	  </para>
-	  </listitem>
-	</varlistentry>
-	</listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.mutexes.background_thread">
-        <term>
-          <mallctl>stats.mutexes.background_thread.{counter}</mallctl>
-	  (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>background_thread</varname> mutex
-        (global scope; <link
-        linkend="background_thread"><mallctl>background_thread</mallctl></link>
-        related).  <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.mutexes.prof">
-        <term>
-          <mallctl>stats.mutexes.prof.{counter}</mallctl>
-	  (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>prof</varname> mutex (global
-        scope; profiling related).  <mallctl>{counter}</mallctl> is one of the
-        counters in <link linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.mutexes.reset">
-        <term>
-          <mallctl>stats.mutexes.reset</mallctl>
-	  (<type>void</type>) <literal>--</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Reset all mutex profile statistics, including global
-        mutexes, arena mutexes and bin mutexes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.dss">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.dss</mallctl>
-          (<type>const char *</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>dss (<citerefentry><refentrytitle>sbrk</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry>) allocation precedence as
-        related to <citerefentry><refentrytitle>mmap</refentrytitle>
-        <manvolnum>2</manvolnum></citerefentry> allocation.  See <link
-        linkend="opt.dss"><mallctl>opt.dss</mallctl></link> for details.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.dirty_decay_ms">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.dirty_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Approximate time in milliseconds from the creation of a
-        set of unused dirty pages until an equivalent set of unused dirty pages
-        is purged and/or reused.  See <link
-        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
-        for details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.muzzy_decay_ms">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.muzzy_decay_ms</mallctl>
-          (<type>ssize_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Approximate time in milliseconds from the creation of a
-        set of unused muzzy pages until an equivalent set of unused muzzy pages
-        is purged and/or reused.  See <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
-        for details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.nthreads">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.nthreads</mallctl>
-          (<type>unsigned</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of threads currently assigned to
-        arena.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.uptime">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.uptime</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Time elapsed (in nanoseconds) since the arena was
-        created.  If &lt;i&gt; equals <constant>0</constant> or
-        <constant>MALLCTL_ARENAS_ALL</constant>, this is the uptime since malloc
-        initialization.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.pactive">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.pactive</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of pages in active extents.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.pdirty">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.pdirty</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of pages within unused extents that are
-        potentially dirty, and for which <function>madvise()</function> or
-        similar has not been called.  See <link
-        linkend="opt.dirty_decay_ms"><mallctl>opt.dirty_decay_ms</mallctl></link>
-        for a description of dirty pages.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.pmuzzy">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.pmuzzy</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Number of pages within unused extents that are muzzy.
-        See <link
-        linkend="opt.muzzy_decay_ms"><mallctl>opt.muzzy_decay_ms</mallctl></link>
-        for a description of muzzy pages.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mapped">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mapped</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of mapped bytes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.retained">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.retained</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of retained bytes.  See <link
-        linkend="stats.retained"><mallctl>stats.retained</mallctl></link> for
-        details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.base">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.base</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>
-        Number of bytes dedicated to bootstrap-sensitive allocator metadata
-        structures.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.internal">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.internal</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of bytes dedicated to internal allocations.
-        Internal allocations differ from application-originated allocations in
-        that they are for internal use, and that they are omitted from heap
-        profiles.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.metadata_thp">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.metadata_thp</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of transparent huge pages (THP) used for
-        metadata.  See <link linkend="opt.metadata_thp">opt.metadata_thp</link>
-        for details.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.resident">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.resident</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Maximum number of bytes in physically resident data
-        pages mapped by the arena, comprising all pages dedicated to allocator
-        metadata, pages backing active allocations, and unused dirty pages.
-        This is a maximum rather than precise because pages may not actually be
-        physically resident if they correspond to demand-zeroed virtual memory
-        that has not yet been touched.  This is a multiple of the page
-        size.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.dirty_npurge">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.dirty_npurge</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of dirty page purge sweeps performed.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.dirty_nmadvise">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.dirty_nmadvise</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of <function>madvise()</function> or similar
-        calls made to purge dirty pages.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.dirty_purged">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.dirty_purged</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of dirty pages purged.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.muzzy_npurge">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.muzzy_npurge</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of muzzy page purge sweeps performed.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.muzzy_nmadvise">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.muzzy_nmadvise</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of <function>madvise()</function> or similar
-        calls made to purge muzzy pages.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.muzzy_purged">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.muzzy_purged</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of muzzy pages purged.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.small.allocated">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.small.allocated</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of bytes currently allocated by small objects.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.small.nmalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.small.nmalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a small allocation was
-        requested from the arena's bins, whether to fill the relevant tcache if
-        <link linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is
-        enabled, or to directly satisfy an allocation request
-        otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.small.ndalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.small.ndalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a small allocation was
-        returned to the arena's bins, whether to flush the relevant tcache if
-        <link linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is
-        enabled, or to directly deallocate an allocation
-        otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.small.nrequests">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.small.nrequests</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of allocation requests satisfied by
-        all bin size classes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.large.allocated">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.large.allocated</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Number of bytes currently allocated by large objects.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.large.nmalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.large.nmalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a large extent was allocated
-        from the arena, whether to fill the relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
-        the size class is within the range being cached, or to directly satisfy
-        an allocation request otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.large.ndalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.large.ndalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a large extent was returned
-        to the arena, whether to flush the relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
-        the size class is within the range being cached, or to directly
-        deallocate an allocation otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.large.nrequests">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.large.nrequests</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of allocation requests satisfied by
-        all large size classes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nmalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nmalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a bin region of the
-        corresponding size class was allocated from the arena, whether to fill
-        the relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled, or
-        to directly satisfy an allocation request otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.ndalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.ndalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a bin region of the
-        corresponding size class was returned to the arena, whether to flush the
-        relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled, or
-        to directly deallocate an allocation otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nrequests">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nrequests</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of allocation requests satisfied by
-        bin regions of the corresponding size class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.curregs">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.curregs</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Current number of regions for this size
-        class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nfills">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nfills</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Cumulative number of tcache fills.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nflushes">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nflushes</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-        </term>
-        <listitem><para>Cumulative number of tcache flushes.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nslabs">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nslabs</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of slabs created.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.nreslabs">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.nreslabs</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times the current slab from which
-        to allocate changed.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.j.curslabs">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.curslabs</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Current number of slabs.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.bins.mutex">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.bins.&lt;j&gt;.mutex.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on
-        <varname>arena.&lt;i&gt;.bins.&lt;j&gt;</varname> mutex (arena bin
-        scope; bin operation related).  <mallctl>{counter}</mallctl> is one of
-        the counters in <link linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.lextents.j.nmalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.nmalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a large extent of the
-        corresponding size class was allocated from the arena, whether to fill
-        the relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
-        the size class is within the range being cached, or to directly satisfy
-        an allocation request otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.lextents.j.ndalloc">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.ndalloc</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of times a large extent of the
-        corresponding size class was returned to the arena, whether to flush the
-        relevant tcache if <link
-        linkend="opt.tcache"><mallctl>opt.tcache</mallctl></link> is enabled and
-        the size class is within the range being cached, or to directly
-        deallocate an allocation otherwise.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.lextents.j.nrequests">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.nrequests</mallctl>
-          (<type>uint64_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Cumulative number of allocation requests satisfied by
-        large extents of the corresponding size class.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.lextents.j.curlextents">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.lextents.&lt;j&gt;.curlextents</mallctl>
-          (<type>size_t</type>)
-          <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Current number of large allocations for this size class.
-        </para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.large">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.large.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.large</varname>
-        mutex (arena scope; large allocation related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.extent_avail">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extent_avail.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extent_avail
-        </varname> mutex (arena scope; extent avail related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.extents_dirty">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_dirty.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_dirty
-        </varname> mutex (arena scope; dirty extents related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.extents_muzzy">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_muzzy.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_muzzy
-        </varname> mutex (arena scope; muzzy extents related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.extents_retained">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.extents_retained.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.extents_retained
-        </varname> mutex (arena scope; retained extents related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.decay_dirty">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.decay_dirty.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.decay_dirty
-        </varname> mutex (arena scope; decay for dirty pages related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.decay_muzzy">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.decay_muzzy.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.decay_muzzy
-        </varname> mutex (arena scope; decay for muzzy pages related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.base">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.base.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on <varname>arena.&lt;i&gt;.base</varname>
-        mutex (arena scope; base allocator related).
-        <mallctl>{counter}</mallctl> is one of the counters in <link
-        linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-      <varlistentry id="stats.arenas.i.mutexes.tcache_list">
-        <term>
-          <mallctl>stats.arenas.&lt;i&gt;.mutexes.tcache_list.{counter}</mallctl>
-          (<type>counter specific type</type>) <literal>r-</literal>
-          [<option>--enable-stats</option>]
-        </term>
-        <listitem><para>Statistics on
-        <varname>arena.&lt;i&gt;.tcache_list</varname> mutex (arena scope;
-        tcache to arena association related).  This mutex is expected to be
-        accessed less often.  <mallctl>{counter}</mallctl> is one of the
-        counters in <link linkend="mutex_counters">mutex profiling
-        counters</link>.</para></listitem>
-      </varlistentry>
-
-    </variablelist>
-  </refsect1>
-  <refsect1 id="heap_profile_format">
-    <title>HEAP PROFILE FORMAT</title>
-    <para>Although the heap profiling functionality was originally designed to
-    be compatible with the
-    <command>pprof</command> command that is developed as part of the <ulink
-    url="http://code.google.com/p/gperftools/">gperftools
-    package</ulink>, the addition of per thread heap profiling functionality
-    required a different heap profile format.  The <command>jeprof</command>
-    command is derived from <command>pprof</command>, with enhancements to
-    support the heap profile format described here.</para>
-
-    <para>In the following hypothetical heap profile, <constant>[...]</constant>
-    indicates elision for the sake of compactness.  <programlisting><![CDATA[
-heap_v2/524288
-  t*: 28106: 56637512 [0: 0]
-  [...]
-  t3: 352: 16777344 [0: 0]
-  [...]
-  t99: 17754: 29341640 [0: 0]
-  [...]
-@ 0x5f86da8 0x5f5a1dc [...] 0x29e4d4e 0xa200316 0xabb2988 [...]
-  t*: 13: 6688 [0: 0]
-  t3: 12: 6496 [0: ]
-  t99: 1: 192 [0: 0]
-[...]
-
-MAPPED_LIBRARIES:
-[...]]]></programlisting> The following matches the above heap profile, but most
-tokens are replaced with <constant>&lt;description&gt;</constant> to indicate
-descriptions of the corresponding fields.  <programlisting><![CDATA[
-<heap_profile_format_version>/<mean_sample_interval>
-  <aggregate>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
-  [...]
-  <thread_3_aggregate>: <curobjs>: <curbytes>[<cumobjs>: <cumbytes>]
-  [...]
-  <thread_99_aggregate>: <curobjs>: <curbytes>[<cumobjs>: <cumbytes>]
-  [...]
-@ <top_frame> <frame> [...] <frame> <frame> <frame> [...]
-  <backtrace_aggregate>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
-  <backtrace_thread_3>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
-  <backtrace_thread_99>: <curobjs>: <curbytes> [<cumobjs>: <cumbytes>]
-[...]
-
-MAPPED_LIBRARIES:
-</proc/<pid>/maps>]]></programlisting></para>
-  </refsect1>
-
-  <refsect1 id="debugging_malloc_problems">
-    <title>DEBUGGING MALLOC PROBLEMS</title>
-    <para>When debugging, it is a good idea to configure/build jemalloc with
-    the <option>--enable-debug</option> and <option>--enable-fill</option>
-    options, and recompile the program with suitable options and symbols for
-    debugger support.  When so configured, jemalloc incorporates a wide variety
-    of run-time assertions that catch application errors such as double-free,
-    write-after-free, etc.</para>
-
-    <para>Programs often accidentally depend on <quote>uninitialized</quote>
-    memory actually being filled with zero bytes.  Junk filling
-    (see the <link linkend="opt.junk"><mallctl>opt.junk</mallctl></link>
-    option) tends to expose such bugs in the form of obviously incorrect
-    results and/or coredumps.  Conversely, zero
-    filling (see the <link
-    linkend="opt.zero"><mallctl>opt.zero</mallctl></link> option) eliminates
-    the symptoms of such bugs.  Between these two options, it is usually
-    possible to quickly detect, diagnose, and eliminate such bugs.</para>
-
-    <para>This implementation does not provide much detail about the problems
-    it detects, because the performance impact for storing such information
-    would be prohibitive.</para>
-  </refsect1>
-  <refsect1 id="diagnostic_messages">
-    <title>DIAGNOSTIC MESSAGES</title>
-    <para>If any of the memory allocation/deallocation functions detect an
-    error or warning condition, a message will be printed to file descriptor
-    <constant>STDERR_FILENO</constant>.  Errors will result in the process
-    dumping core.  If the <link
-    linkend="opt.abort"><mallctl>opt.abort</mallctl></link> option is set, most
-    warnings are treated as errors.</para>
-
-    <para>The <varname>malloc_message</varname> variable allows the programmer
-    to override the function which emits the text strings forming the errors
-    and warnings if for some reason the <constant>STDERR_FILENO</constant> file
-    descriptor is not suitable for this.
-    <function>malloc_message()</function> takes the
-    <parameter>cbopaque</parameter> pointer argument that is
-    <constant>NULL</constant> unless overridden by the arguments in a call to
-    <function>malloc_stats_print()</function>, followed by a string
-    pointer.  Please note that doing anything which tries to allocate memory in
-    this function is likely to result in a crash or deadlock.</para>
-
-    <para>All messages are prefixed by
-    <quote><computeroutput>&lt;jemalloc&gt;: </computeroutput></quote>.</para>
-  </refsect1>
-  <refsect1 id="return_values">
-    <title>RETURN VALUES</title>
-    <refsect2>
-      <title>Standard API</title>
-      <para>The <function>malloc()</function> and
-      <function>calloc()</function> functions return a pointer to the
-      allocated memory if successful; otherwise a <constant>NULL</constant>
-      pointer is returned and <varname>errno</varname> is set to
-      <errorname>ENOMEM</errorname>.</para>
-
-      <para>The <function>posix_memalign()</function> function
-      returns the value 0 if successful; otherwise it returns an error value.
-      The <function>posix_memalign()</function> function will fail
-      if:
-        <variablelist>
-          <varlistentry>
-            <term><errorname>EINVAL</errorname></term>
-
-            <listitem><para>The <parameter>alignment</parameter> parameter is
-            not a power of 2 at least as large as
-            <code language="C">sizeof(<type>void *</type>)</code>.
-            </para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>ENOMEM</errorname></term>
-
-            <listitem><para>Memory allocation error.</para></listitem>
-          </varlistentry>
-        </variablelist>
-      </para>
-
-      <para>The <function>aligned_alloc()</function> function returns
-      a pointer to the allocated memory if successful; otherwise a
-      <constant>NULL</constant> pointer is returned and
-      <varname>errno</varname> is set.  The
-      <function>aligned_alloc()</function> function will fail if:
-        <variablelist>
-          <varlistentry>
-            <term><errorname>EINVAL</errorname></term>
-
-            <listitem><para>The <parameter>alignment</parameter> parameter is
-            not a power of 2.
-            </para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>ENOMEM</errorname></term>
-
-            <listitem><para>Memory allocation error.</para></listitem>
-          </varlistentry>
-        </variablelist>
-      </para>
-
-      <para>The <function>realloc()</function> function returns a
-      pointer, possibly identical to <parameter>ptr</parameter>, to the
-      allocated memory if successful; otherwise a <constant>NULL</constant>
-      pointer is returned, and <varname>errno</varname> is set to
-      <errorname>ENOMEM</errorname> if the error was the result of an
-      allocation failure.  The <function>realloc()</function>
-      function always leaves the original buffer intact when an error occurs.
-      </para>
-
-      <para>The <function>free()</function> function returns no
-      value.</para>
-    </refsect2>
-    <refsect2>
-      <title>Non-standard API</title>
-      <para>The <function>mallocx()</function> and
-      <function>rallocx()</function> functions return a pointer to
-      the allocated memory if successful; otherwise a <constant>NULL</constant>
-      pointer is returned to indicate insufficient contiguous memory was
-      available to service the allocation request.  </para>
-
-      <para>The <function>xallocx()</function> function returns the
-      real size of the resulting resized allocation pointed to by
-      <parameter>ptr</parameter>, which is a value less than
-      <parameter>size</parameter> if the allocation could not be adequately
-      grown in place.  </para>
-
-      <para>The <function>sallocx()</function> function returns the
-      real size of the allocation pointed to by <parameter>ptr</parameter>.
-      </para>
-
-      <para>The <function>nallocx()</function> returns the real size
-      that would result from a successful equivalent
-      <function>mallocx()</function> function call, or zero if
-      insufficient memory is available to perform the size computation.  </para>
-
-      <para>The <function>mallctl()</function>,
-      <function>mallctlnametomib()</function>, and
-      <function>mallctlbymib()</function> functions return 0 on
-      success; otherwise they return an error value.  The functions will fail
-      if:
-        <variablelist>
-          <varlistentry>
-            <term><errorname>EINVAL</errorname></term>
-
-            <listitem><para><parameter>newp</parameter> is not
-            <constant>NULL</constant>, and <parameter>newlen</parameter> is too
-            large or too small.  Alternatively, <parameter>*oldlenp</parameter>
-            is too large or too small; in this case as much data as possible
-            are read despite the error.</para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>ENOENT</errorname></term>
-
-            <listitem><para><parameter>name</parameter> or
-            <parameter>mib</parameter> specifies an unknown/invalid
-            value.</para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>EPERM</errorname></term>
-
-            <listitem><para>Attempt to read or write void value, or attempt to
-            write read-only value.</para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>EAGAIN</errorname></term>
-
-            <listitem><para>A memory allocation failure
-            occurred.</para></listitem>
-          </varlistentry>
-          <varlistentry>
-            <term><errorname>EFAULT</errorname></term>
-
-            <listitem><para>An interface with side effects failed in some way
-            not directly related to <function>mallctl*()</function>
-            read/write processing.</para></listitem>
-          </varlistentry>
-        </variablelist>
-      </para>
-
-      <para>The <function>malloc_usable_size()</function> function
-      returns the usable size of the allocation pointed to by
-      <parameter>ptr</parameter>.  </para>
-    </refsect2>
-  </refsect1>
-  <refsect1 id="environment">
-    <title>ENVIRONMENT</title>
-    <para>The following environment variable affects the execution of the
-    allocation functions:
-      <variablelist>
-        <varlistentry>
-          <term><envar>MALLOC_CONF</envar></term>
-
-          <listitem><para>If the environment variable
-          <envar>MALLOC_CONF</envar> is set, the characters it contains
-          will be interpreted as options.</para></listitem>
-        </varlistentry>
-      </variablelist>
-    </para>
-  </refsect1>
-  <refsect1 id="examples">
-    <title>EXAMPLES</title>
-    <para>To dump core whenever a problem occurs:
-      <screen>ln -s 'abort:true' /etc/malloc.conf</screen>
-    </para>
-    <para>To specify in the source that only one arena should be automatically
-    created:
-      <programlisting language="C"><![CDATA[
-malloc_conf = "narenas:1";]]></programlisting></para>
-  </refsect1>
-  <refsect1 id="see_also">
-    <title>SEE ALSO</title>
-    <para><citerefentry><refentrytitle>madvise</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>mmap</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>sbrk</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>utrace</refentrytitle>
-    <manvolnum>2</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>alloca</refentrytitle>
-    <manvolnum>3</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>atexit</refentrytitle>
-    <manvolnum>3</manvolnum></citerefentry>,
-    <citerefentry><refentrytitle>getpagesize</refentrytitle>
-    <manvolnum>3</manvolnum></citerefentry></para>
-  </refsect1>
-  <refsect1 id="standards">
-    <title>STANDARDS</title>
-    <para>The <function>malloc()</function>,
-    <function>calloc()</function>,
-    <function>realloc()</function>, and
-    <function>free()</function> functions conform to ISO/IEC
-    9899:1990 (<quote>ISO C90</quote>).</para>
-
-    <para>The <function>posix_memalign()</function> function conforms
-    to IEEE Std 1003.1-2001 (<quote>POSIX.1</quote>).</para>
-  </refsect1>
-</refentry>
diff --git a/redis-stable/deps/jemalloc/doc/manpages.xsl.in b/redis-stable/deps/jemalloc/doc/manpages.xsl.in
deleted file mode 100644
index 88b2626b..00000000
--- a/redis-stable/deps/jemalloc/doc/manpages.xsl.in
+++ /dev/null
@@ -1,4 +0,0 @@
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
-  <xsl:import href="@XSLROOT@/manpages/docbook.xsl"/>
-  <xsl:import href="@abs_srcroot@doc/stylesheet.xsl"/>
-</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/doc/stylesheet.xsl b/redis-stable/deps/jemalloc/doc/stylesheet.xsl
deleted file mode 100644
index 619365d8..00000000
--- a/redis-stable/deps/jemalloc/doc/stylesheet.xsl
+++ /dev/null
@@ -1,10 +0,0 @@
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
-  <xsl:param name="funcsynopsis.style">ansi</xsl:param>
-  <xsl:param name="function.parens" select="0"/>
-  <xsl:template match="function">
-    <xsl:call-template name="inline.monoseq"/>
-  </xsl:template>
-  <xsl:template match="mallctl">
-    <quote><xsl:call-template name="inline.monoseq"/></quote>
-  </xsl:template>
-</xsl:stylesheet>
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
deleted file mode 100644
index 4b3732b4..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_externs.h
+++ /dev/null
@@ -1,94 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_EXTERNS_H
-#define JEMALLOC_INTERNAL_ARENA_EXTERNS_H
-
-#include "jemalloc/internal/bin.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/pages.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/stats.h"
-
-extern ssize_t opt_dirty_decay_ms;
-extern ssize_t opt_muzzy_decay_ms;
-
-extern percpu_arena_mode_t opt_percpu_arena;
-extern const char *percpu_arena_mode_names[];
-
-extern const uint64_t h_steps[SMOOTHSTEP_NSTEPS];
-extern malloc_mutex_t arenas_lock;
-
-void arena_basic_stats_merge(tsdn_t *tsdn, arena_t *arena,
-    unsigned *nthreads, const char **dss, ssize_t *dirty_decay_ms,
-    ssize_t *muzzy_decay_ms, size_t *nactive, size_t *ndirty, size_t *nmuzzy);
-void arena_stats_merge(tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
-    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
-    size_t *nactive, size_t *ndirty, size_t *nmuzzy, arena_stats_t *astats,
-    bin_stats_t *bstats, arena_stats_large_t *lstats);
-void arena_extents_dirty_dalloc(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent);
-#ifdef JEMALLOC_JET
-size_t arena_slab_regind(extent_t *slab, szind_t binind, const void *ptr);
-#endif
-extent_t *arena_extent_alloc_large(tsdn_t *tsdn, arena_t *arena,
-    size_t usize, size_t alignment, bool *zero);
-void arena_extent_dalloc_large_prep(tsdn_t *tsdn, arena_t *arena,
-    extent_t *extent);
-void arena_extent_ralloc_large_shrink(tsdn_t *tsdn, arena_t *arena,
-    extent_t *extent, size_t oldsize);
-void arena_extent_ralloc_large_expand(tsdn_t *tsdn, arena_t *arena,
-    extent_t *extent, size_t oldsize);
-ssize_t arena_dirty_decay_ms_get(arena_t *arena);
-bool arena_dirty_decay_ms_set(tsdn_t *tsdn, arena_t *arena, ssize_t decay_ms);
-ssize_t arena_muzzy_decay_ms_get(arena_t *arena);
-bool arena_muzzy_decay_ms_set(tsdn_t *tsdn, arena_t *arena, ssize_t decay_ms);
-void arena_decay(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
-    bool all);
-void arena_reset(tsd_t *tsd, arena_t *arena);
-void arena_destroy(tsd_t *tsd, arena_t *arena);
-void arena_tcache_fill_small(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
-    cache_bin_t *tbin, szind_t binind, uint64_t prof_accumbytes);
-void arena_alloc_junk_small(void *ptr, const bin_info_t *bin_info,
-    bool zero);
-
-typedef void (arena_dalloc_junk_small_t)(void *, const bin_info_t *);
-extern arena_dalloc_junk_small_t *JET_MUTABLE arena_dalloc_junk_small;
-
-void *arena_malloc_hard(tsdn_t *tsdn, arena_t *arena, size_t size,
-    szind_t ind, bool zero);
-void *arena_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize,
-    size_t alignment, bool zero, tcache_t *tcache);
-void arena_prof_promote(tsdn_t *tsdn, const void *ptr, size_t usize);
-void arena_dalloc_promoted(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
-    bool slow_path);
-void arena_dalloc_bin_junked_locked(tsdn_t *tsdn, arena_t *arena,
-    extent_t *extent, void *ptr);
-void arena_dalloc_small(tsdn_t *tsdn, void *ptr);
-bool arena_ralloc_no_move(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
-    size_t extra, bool zero);
-void *arena_ralloc(tsdn_t *tsdn, arena_t *arena, void *ptr, size_t oldsize,
-    size_t size, size_t alignment, bool zero, tcache_t *tcache);
-dss_prec_t arena_dss_prec_get(arena_t *arena);
-bool arena_dss_prec_set(arena_t *arena, dss_prec_t dss_prec);
-ssize_t arena_dirty_decay_ms_default_get(void);
-bool arena_dirty_decay_ms_default_set(ssize_t decay_ms);
-ssize_t arena_muzzy_decay_ms_default_get(void);
-bool arena_muzzy_decay_ms_default_set(ssize_t decay_ms);
-bool arena_retain_grow_limit_get_set(tsd_t *tsd, arena_t *arena,
-    size_t *old_limit, size_t *new_limit);
-unsigned arena_nthreads_get(arena_t *arena, bool internal);
-void arena_nthreads_inc(arena_t *arena, bool internal);
-void arena_nthreads_dec(arena_t *arena, bool internal);
-size_t arena_extent_sn_next(arena_t *arena);
-arena_t *arena_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
-void arena_boot(void);
-void arena_prefork0(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork1(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork2(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork3(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork4(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork5(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork6(tsdn_t *tsdn, arena_t *arena);
-void arena_prefork7(tsdn_t *tsdn, arena_t *arena);
-void arena_postfork_parent(tsdn_t *tsdn, arena_t *arena);
-void arena_postfork_child(tsdn_t *tsdn, arena_t *arena);
-
-#endif /* JEMALLOC_INTERNAL_ARENA_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
deleted file mode 100644
index 9abf7f6a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_a.h
+++ /dev/null
@@ -1,57 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_INLINES_A_H
-#define JEMALLOC_INTERNAL_ARENA_INLINES_A_H
-
-static inline unsigned
-arena_ind_get(const arena_t *arena) {
-	return base_ind_get(arena->base);
-}
-
-static inline void
-arena_internal_add(arena_t *arena, size_t size) {
-	atomic_fetch_add_zu(&arena->stats.internal, size, ATOMIC_RELAXED);
-}
-
-static inline void
-arena_internal_sub(arena_t *arena, size_t size) {
-	atomic_fetch_sub_zu(&arena->stats.internal, size, ATOMIC_RELAXED);
-}
-
-static inline size_t
-arena_internal_get(arena_t *arena) {
-	return atomic_load_zu(&arena->stats.internal, ATOMIC_RELAXED);
-}
-
-static inline bool
-arena_prof_accum(tsdn_t *tsdn, arena_t *arena, uint64_t accumbytes) {
-	cassert(config_prof);
-
-	if (likely(prof_interval == 0 || !prof_active_get_unlocked())) {
-		return false;
-	}
-
-	return prof_accum_add(tsdn, &arena->prof_accum, accumbytes);
-}
-
-static inline void
-percpu_arena_update(tsd_t *tsd, unsigned cpu) {
-	assert(have_percpu_arena);
-	arena_t *oldarena = tsd_arena_get(tsd);
-	assert(oldarena != NULL);
-	unsigned oldind = arena_ind_get(oldarena);
-
-	if (oldind != cpu) {
-		unsigned newind = cpu;
-		arena_t *newarena = arena_get(tsd_tsdn(tsd), newind, true);
-		assert(newarena != NULL);
-
-		/* Set new arena/tcache associations. */
-		arena_migrate(tsd, oldind, newind);
-		tcache_t *tcache = tcache_get(tsd);
-		if (tcache != NULL) {
-			tcache_arena_reassociate(tsd_tsdn(tsd), tcache,
-			    newarena);
-		}
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_ARENA_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
deleted file mode 100644
index 2b7e77e7..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_inlines_b.h
+++ /dev/null
@@ -1,354 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_INLINES_B_H
-#define JEMALLOC_INTERNAL_ARENA_INLINES_B_H
-
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/sz.h"
-#include "jemalloc/internal/ticker.h"
-
-JEMALLOC_ALWAYS_INLINE prof_tctx_t *
-arena_prof_tctx_get(tsdn_t *tsdn, const void *ptr, alloc_ctx_t *alloc_ctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	/* Static check. */
-	if (alloc_ctx == NULL) {
-		const extent_t *extent = iealloc(tsdn, ptr);
-		if (unlikely(!extent_slab_get(extent))) {
-			return large_prof_tctx_get(tsdn, extent);
-		}
-	} else {
-		if (unlikely(!alloc_ctx->slab)) {
-			return large_prof_tctx_get(tsdn, iealloc(tsdn, ptr));
-		}
-	}
-	return (prof_tctx_t *)(uintptr_t)1U;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_prof_tctx_set(tsdn_t *tsdn, const void *ptr, UNUSED size_t usize,
-    alloc_ctx_t *alloc_ctx, prof_tctx_t *tctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	/* Static check. */
-	if (alloc_ctx == NULL) {
-		extent_t *extent = iealloc(tsdn, ptr);
-		if (unlikely(!extent_slab_get(extent))) {
-			large_prof_tctx_set(tsdn, extent, tctx);
-		}
-	} else {
-		if (unlikely(!alloc_ctx->slab)) {
-			large_prof_tctx_set(tsdn, iealloc(tsdn, ptr), tctx);
-		}
-	}
-}
-
-static inline void
-arena_prof_tctx_reset(tsdn_t *tsdn, const void *ptr, UNUSED prof_tctx_t *tctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	extent_t *extent = iealloc(tsdn, ptr);
-	assert(!extent_slab_get(extent));
-
-	large_prof_tctx_reset(tsdn, extent);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_decay_ticks(tsdn_t *tsdn, arena_t *arena, unsigned nticks) {
-	tsd_t *tsd;
-	ticker_t *decay_ticker;
-
-	if (unlikely(tsdn_null(tsdn))) {
-		return;
-	}
-	tsd = tsdn_tsd(tsdn);
-	decay_ticker = decay_ticker_get(tsd, arena_ind_get(arena));
-	if (unlikely(decay_ticker == NULL)) {
-		return;
-	}
-	if (unlikely(ticker_ticks(decay_ticker, nticks))) {
-		arena_decay(tsdn, arena, false, false);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_decay_tick(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_assert_not_owner(tsdn, &arena->decay_dirty.mtx);
-	malloc_mutex_assert_not_owner(tsdn, &arena->decay_muzzy.mtx);
-
-	arena_decay_ticks(tsdn, arena, 1);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-arena_malloc(tsdn_t *tsdn, arena_t *arena, size_t size, szind_t ind, bool zero,
-    tcache_t *tcache, bool slow_path) {
-	assert(!tsdn_null(tsdn) || tcache == NULL);
-	assert(size != 0);
-
-	if (likely(tcache != NULL)) {
-		if (likely(size <= SMALL_MAXCLASS)) {
-			return tcache_alloc_small(tsdn_tsd(tsdn), arena,
-			    tcache, size, ind, zero, slow_path);
-		}
-		if (likely(size <= tcache_maxclass)) {
-			return tcache_alloc_large(tsdn_tsd(tsdn), arena,
-			    tcache, size, ind, zero, slow_path);
-		}
-		/* (size > tcache_maxclass) case falls through. */
-		assert(size > tcache_maxclass);
-	}
-
-	return arena_malloc_hard(tsdn, arena, size, ind, zero);
-}
-
-JEMALLOC_ALWAYS_INLINE arena_t *
-arena_aalloc(tsdn_t *tsdn, const void *ptr) {
-	return extent_arena_get(iealloc(tsdn, ptr));
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-arena_salloc(tsdn_t *tsdn, const void *ptr) {
-	assert(ptr != NULL);
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	szind_t szind = rtree_szind_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true);
-	assert(szind != NSIZES);
-
-	return sz_index2size(szind);
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-arena_vsalloc(tsdn_t *tsdn, const void *ptr) {
-	/*
-	 * Return 0 if ptr is not within an extent managed by jemalloc.  This
-	 * function has two extra costs relative to isalloc():
-	 * - The rtree calls cannot claim to be dependent lookups, which induces
-	 *   rtree lookup load dependencies.
-	 * - The lookup may fail, so there is an extra branch to check for
-	 *   failure.
-	 */
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	extent_t *extent;
-	szind_t szind;
-	if (rtree_extent_szind_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, false, &extent, &szind)) {
-		return 0;
-	}
-
-	if (extent == NULL) {
-		return 0;
-	}
-	assert(extent_state_get(extent) == extent_state_active);
-	/* Only slab members should be looked up via interior pointers. */
-	assert(extent_addr_get(extent) == ptr || extent_slab_get(extent));
-
-	assert(szind != NSIZES);
-
-	return sz_index2size(szind);
-}
-
-static inline void
-arena_dalloc_no_tcache(tsdn_t *tsdn, void *ptr) {
-	assert(ptr != NULL);
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	szind_t szind;
-	bool slab;
-	rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
-	    true, &szind, &slab);
-
-	if (config_debug) {
-		extent_t *extent = rtree_extent_read(tsdn, &extents_rtree,
-		    rtree_ctx, (uintptr_t)ptr, true);
-		assert(szind == extent_szind_get(extent));
-		assert(szind < NSIZES);
-		assert(slab == extent_slab_get(extent));
-	}
-
-	if (likely(slab)) {
-		/* Small allocation. */
-		arena_dalloc_small(tsdn, ptr);
-	} else {
-		extent_t *extent = iealloc(tsdn, ptr);
-		large_dalloc(tsdn, extent);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_dalloc(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
-    alloc_ctx_t *alloc_ctx, bool slow_path) {
-	assert(!tsdn_null(tsdn) || tcache == NULL);
-	assert(ptr != NULL);
-
-	if (unlikely(tcache == NULL)) {
-		arena_dalloc_no_tcache(tsdn, ptr);
-		return;
-	}
-
-	szind_t szind;
-	bool slab;
-	rtree_ctx_t *rtree_ctx;
-	if (alloc_ctx != NULL) {
-		szind = alloc_ctx->szind;
-		slab = alloc_ctx->slab;
-		assert(szind != NSIZES);
-	} else {
-		rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
-		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &szind, &slab);
-	}
-
-	if (config_debug) {
-		rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
-		extent_t *extent = rtree_extent_read(tsdn, &extents_rtree,
-		    rtree_ctx, (uintptr_t)ptr, true);
-		assert(szind == extent_szind_get(extent));
-		assert(szind < NSIZES);
-		assert(slab == extent_slab_get(extent));
-	}
-
-	if (likely(slab)) {
-		/* Small allocation. */
-		tcache_dalloc_small(tsdn_tsd(tsdn), tcache, ptr, szind,
-		    slow_path);
-	} else {
-		if (szind < nhbins) {
-			if (config_prof && unlikely(szind < NBINS)) {
-				arena_dalloc_promoted(tsdn, ptr, tcache,
-				    slow_path);
-			} else {
-				tcache_dalloc_large(tsdn_tsd(tsdn), tcache, ptr,
-				    szind, slow_path);
-			}
-		} else {
-			extent_t *extent = iealloc(tsdn, ptr);
-			large_dalloc(tsdn, extent);
-		}
-	}
-}
-
-static inline void
-arena_sdalloc_no_tcache(tsdn_t *tsdn, void *ptr, size_t size) {
-	assert(ptr != NULL);
-	assert(size <= LARGE_MAXCLASS);
-
-	szind_t szind;
-	bool slab;
-	if (!config_prof || !opt_prof) {
-		/*
-		 * There is no risk of being confused by a promoted sampled
-		 * object, so base szind and slab on the given size.
-		 */
-		szind = sz_size2index(size);
-		slab = (szind < NBINS);
-	}
-
-	if ((config_prof && opt_prof) || config_debug) {
-		rtree_ctx_t rtree_ctx_fallback;
-		rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
-		    &rtree_ctx_fallback);
-
-		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &szind, &slab);
-
-		assert(szind == sz_size2index(size));
-		assert((config_prof && opt_prof) || slab == (szind < NBINS));
-
-		if (config_debug) {
-			extent_t *extent = rtree_extent_read(tsdn,
-			    &extents_rtree, rtree_ctx, (uintptr_t)ptr, true);
-			assert(szind == extent_szind_get(extent));
-			assert(slab == extent_slab_get(extent));
-		}
-	}
-
-	if (likely(slab)) {
-		/* Small allocation. */
-		arena_dalloc_small(tsdn, ptr);
-	} else {
-		extent_t *extent = iealloc(tsdn, ptr);
-		large_dalloc(tsdn, extent);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_sdalloc(tsdn_t *tsdn, void *ptr, size_t size, tcache_t *tcache,
-    alloc_ctx_t *alloc_ctx, bool slow_path) {
-	assert(!tsdn_null(tsdn) || tcache == NULL);
-	assert(ptr != NULL);
-	assert(size <= LARGE_MAXCLASS);
-
-	if (unlikely(tcache == NULL)) {
-		arena_sdalloc_no_tcache(tsdn, ptr, size);
-		return;
-	}
-
-	szind_t szind;
-	bool slab;
-	UNUSED alloc_ctx_t local_ctx;
-	if (config_prof && opt_prof) {
-		if (alloc_ctx == NULL) {
-			/* Uncommon case and should be a static check. */
-			rtree_ctx_t rtree_ctx_fallback;
-			rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
-			    &rtree_ctx_fallback);
-			rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
-			    (uintptr_t)ptr, true, &local_ctx.szind,
-			    &local_ctx.slab);
-			assert(local_ctx.szind == sz_size2index(size));
-			alloc_ctx = &local_ctx;
-		}
-		slab = alloc_ctx->slab;
-		szind = alloc_ctx->szind;
-	} else {
-		/*
-		 * There is no risk of being confused by a promoted sampled
-		 * object, so base szind and slab on the given size.
-		 */
-		szind = sz_size2index(size);
-		slab = (szind < NBINS);
-	}
-
-	if (config_debug) {
-		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsdn_tsd(tsdn));
-		rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &szind, &slab);
-		extent_t *extent = rtree_extent_read(tsdn,
-		    &extents_rtree, rtree_ctx, (uintptr_t)ptr, true);
-		assert(szind == extent_szind_get(extent));
-		assert(slab == extent_slab_get(extent));
-	}
-
-	if (likely(slab)) {
-		/* Small allocation. */
-		tcache_dalloc_small(tsdn_tsd(tsdn), tcache, ptr, szind,
-		    slow_path);
-	} else {
-		if (szind < nhbins) {
-			if (config_prof && unlikely(szind < NBINS)) {
-				arena_dalloc_promoted(tsdn, ptr, tcache,
-				    slow_path);
-			} else {
-				tcache_dalloc_large(tsdn_tsd(tsdn),
-				    tcache, ptr, szind, slow_path);
-			}
-		} else {
-			extent_t *extent = iealloc(tsdn, ptr);
-			large_dalloc(tsdn, extent);
-		}
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_ARENA_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
deleted file mode 100644
index 5f3dca8b..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_stats.h
+++ /dev/null
@@ -1,237 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_STATS_H
-#define JEMALLOC_INTERNAL_ARENA_STATS_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_prof.h"
-#include "jemalloc/internal/size_classes.h"
-
-/*
- * In those architectures that support 64-bit atomics, we use atomic updates for
- * our 64-bit values.  Otherwise, we use a plain uint64_t and synchronize
- * externally.
- */
-#ifdef JEMALLOC_ATOMIC_U64
-typedef atomic_u64_t arena_stats_u64_t;
-#else
-/* Must hold the arena stats mutex while reading atomically. */
-typedef uint64_t arena_stats_u64_t;
-#endif
-
-typedef struct arena_stats_large_s arena_stats_large_t;
-struct arena_stats_large_s {
-	/*
-	 * Total number of allocation/deallocation requests served directly by
-	 * the arena.
-	 */
-	arena_stats_u64_t	nmalloc;
-	arena_stats_u64_t	ndalloc;
-
-	/*
-	 * Number of allocation requests that correspond to this size class.
-	 * This includes requests served by tcache, though tcache only
-	 * periodically merges into this counter.
-	 */
-	arena_stats_u64_t	nrequests; /* Partially derived. */
-
-	/* Current number of allocations of this size class. */
-	size_t		curlextents; /* Derived. */
-};
-
-typedef struct arena_stats_decay_s arena_stats_decay_t;
-struct arena_stats_decay_s {
-	/* Total number of purge sweeps. */
-	arena_stats_u64_t	npurge;
-	/* Total number of madvise calls made. */
-	arena_stats_u64_t	nmadvise;
-	/* Total number of pages purged. */
-	arena_stats_u64_t	purged;
-};
-
-/*
- * Arena stats.  Note that fields marked "derived" are not directly maintained
- * within the arena code; rather their values are derived during stats merge
- * requests.
- */
-typedef struct arena_stats_s arena_stats_t;
-struct arena_stats_s {
-#ifndef JEMALLOC_ATOMIC_U64
-	malloc_mutex_t		mtx;
-#endif
-
-	/* Number of bytes currently mapped, excluding retained memory. */
-	atomic_zu_t		mapped; /* Partially derived. */
-
-	/*
-	 * Number of unused virtual memory bytes currently retained.  Retained
-	 * bytes are technically mapped (though always decommitted or purged),
-	 * but they are excluded from the mapped statistic (above).
-	 */
-	atomic_zu_t		retained; /* Derived. */
-
-	arena_stats_decay_t	decay_dirty;
-	arena_stats_decay_t	decay_muzzy;
-
-	atomic_zu_t		base; /* Derived. */
-	atomic_zu_t		internal;
-	atomic_zu_t		resident; /* Derived. */
-	atomic_zu_t		metadata_thp;
-
-	atomic_zu_t		allocated_large; /* Derived. */
-	arena_stats_u64_t	nmalloc_large; /* Derived. */
-	arena_stats_u64_t	ndalloc_large; /* Derived. */
-	arena_stats_u64_t	nrequests_large; /* Derived. */
-
-	/* Number of bytes cached in tcache associated with this arena. */
-	atomic_zu_t		tcache_bytes; /* Derived. */
-
-	mutex_prof_data_t mutex_prof_data[mutex_prof_num_arena_mutexes];
-
-	/* One element for each large size class. */
-	arena_stats_large_t	lstats[NSIZES - NBINS];
-
-	/* Arena uptime. */
-	nstime_t		uptime;
-};
-
-static inline bool
-arena_stats_init(UNUSED tsdn_t *tsdn, arena_stats_t *arena_stats) {
-	if (config_debug) {
-		for (size_t i = 0; i < sizeof(arena_stats_t); i++) {
-			assert(((char *)arena_stats)[i] == 0);
-		}
-	}
-#ifndef JEMALLOC_ATOMIC_U64
-	if (malloc_mutex_init(&arena_stats->mtx, "arena_stats",
-	    WITNESS_RANK_ARENA_STATS, malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-#endif
-	/* Memory is zeroed, so there is no need to clear stats. */
-	return false;
-}
-
-static inline void
-arena_stats_lock(tsdn_t *tsdn, arena_stats_t *arena_stats) {
-#ifndef JEMALLOC_ATOMIC_U64
-	malloc_mutex_lock(tsdn, &arena_stats->mtx);
-#endif
-}
-
-static inline void
-arena_stats_unlock(tsdn_t *tsdn, arena_stats_t *arena_stats) {
-#ifndef JEMALLOC_ATOMIC_U64
-	malloc_mutex_unlock(tsdn, &arena_stats->mtx);
-#endif
-}
-
-static inline uint64_t
-arena_stats_read_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
-    arena_stats_u64_t *p) {
-#ifdef JEMALLOC_ATOMIC_U64
-	return atomic_load_u64(p, ATOMIC_RELAXED);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	return *p;
-#endif
-}
-
-static inline void
-arena_stats_add_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
-    arena_stats_u64_t *p, uint64_t x) {
-#ifdef JEMALLOC_ATOMIC_U64
-	atomic_fetch_add_u64(p, x, ATOMIC_RELAXED);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	*p += x;
-#endif
-}
-
-UNUSED static inline void
-arena_stats_sub_u64(tsdn_t *tsdn, arena_stats_t *arena_stats,
-    arena_stats_u64_t *p, uint64_t x) {
-#ifdef JEMALLOC_ATOMIC_U64
-	UNUSED uint64_t r = atomic_fetch_sub_u64(p, x, ATOMIC_RELAXED);
-	assert(r - x <= r);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	*p -= x;
-	assert(*p + x >= *p);
-#endif
-}
-
-/*
- * Non-atomically sets *dst += src.  *dst needs external synchronization.
- * This lets us avoid the cost of a fetch_add when its unnecessary (note that
- * the types here are atomic).
- */
-static inline void
-arena_stats_accum_u64(arena_stats_u64_t *dst, uint64_t src) {
-#ifdef JEMALLOC_ATOMIC_U64
-	uint64_t cur_dst = atomic_load_u64(dst, ATOMIC_RELAXED);
-	atomic_store_u64(dst, src + cur_dst, ATOMIC_RELAXED);
-#else
-	*dst += src;
-#endif
-}
-
-static inline size_t
-arena_stats_read_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p) {
-#ifdef JEMALLOC_ATOMIC_U64
-	return atomic_load_zu(p, ATOMIC_RELAXED);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	return atomic_load_zu(p, ATOMIC_RELAXED);
-#endif
-}
-
-static inline void
-arena_stats_add_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p,
-    size_t x) {
-#ifdef JEMALLOC_ATOMIC_U64
-	atomic_fetch_add_zu(p, x, ATOMIC_RELAXED);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	size_t cur = atomic_load_zu(p, ATOMIC_RELAXED);
-	atomic_store_zu(p, cur + x, ATOMIC_RELAXED);
-#endif
-}
-
-static inline void
-arena_stats_sub_zu(tsdn_t *tsdn, arena_stats_t *arena_stats, atomic_zu_t *p,
-    size_t x) {
-#ifdef JEMALLOC_ATOMIC_U64
-	UNUSED size_t r = atomic_fetch_sub_zu(p, x, ATOMIC_RELAXED);
-	assert(r - x <= r);
-#else
-	malloc_mutex_assert_owner(tsdn, &arena_stats->mtx);
-	size_t cur = atomic_load_zu(p, ATOMIC_RELAXED);
-	atomic_store_zu(p, cur - x, ATOMIC_RELAXED);
-#endif
-}
-
-/* Like the _u64 variant, needs an externally synchronized *dst. */
-static inline void
-arena_stats_accum_zu(atomic_zu_t *dst, size_t src) {
-	size_t cur_dst = atomic_load_zu(dst, ATOMIC_RELAXED);
-	atomic_store_zu(dst, src + cur_dst, ATOMIC_RELAXED);
-}
-
-static inline void
-arena_stats_large_nrequests_add(tsdn_t *tsdn, arena_stats_t *arena_stats,
-    szind_t szind, uint64_t nrequests) {
-	arena_stats_lock(tsdn, arena_stats);
-	arena_stats_add_u64(tsdn, arena_stats, &arena_stats->lstats[szind -
-	    NBINS].nrequests, nrequests);
-	arena_stats_unlock(tsdn, arena_stats);
-}
-
-static inline void
-arena_stats_mapped_add(tsdn_t *tsdn, arena_stats_t *arena_stats, size_t size) {
-	arena_stats_lock(tsdn, arena_stats);
-	arena_stats_add_zu(tsdn, arena_stats, &arena_stats->mapped, size);
-	arena_stats_unlock(tsdn, arena_stats);
-}
-
-
-#endif /* JEMALLOC_INTERNAL_ARENA_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
deleted file mode 100644
index 46aa77c8..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_a.h
+++ /dev/null
@@ -1,11 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H
-#define JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H
-
-#include "jemalloc/internal/bitmap.h"
-
-struct arena_slab_data_s {
-	/* Per region allocated/deallocated bitmap. */
-	bitmap_t	bitmap[BITMAP_GROUPS_MAX];
-};
-
-#endif /* JEMALLOC_INTERNAL_ARENA_STRUCTS_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
deleted file mode 100644
index 38bc9596..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_structs_b.h
+++ /dev/null
@@ -1,229 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H
-#define JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H
-
-#include "jemalloc/internal/arena_stats.h"
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/bin.h"
-#include "jemalloc/internal/bitmap.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/nstime.h"
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/smoothstep.h"
-#include "jemalloc/internal/ticker.h"
-
-struct arena_decay_s {
-	/* Synchronizes all non-atomic fields. */
-	malloc_mutex_t		mtx;
-	/*
-	 * True if a thread is currently purging the extents associated with
-	 * this decay structure.
-	 */
-	bool			purging;
-	/*
-	 * Approximate time in milliseconds from the creation of a set of unused
-	 * dirty pages until an equivalent set of unused dirty pages is purged
-	 * and/or reused.
-	 */
-	atomic_zd_t		time_ms;
-	/* time / SMOOTHSTEP_NSTEPS. */
-	nstime_t		interval;
-	/*
-	 * Time at which the current decay interval logically started.  We do
-	 * not actually advance to a new epoch until sometime after it starts
-	 * because of scheduling and computation delays, and it is even possible
-	 * to completely skip epochs.  In all cases, during epoch advancement we
-	 * merge all relevant activity into the most recently recorded epoch.
-	 */
-	nstime_t		epoch;
-	/* Deadline randomness generator. */
-	uint64_t		jitter_state;
-	/*
-	 * Deadline for current epoch.  This is the sum of interval and per
-	 * epoch jitter which is a uniform random variable in [0..interval).
-	 * Epochs always advance by precise multiples of interval, but we
-	 * randomize the deadline to reduce the likelihood of arenas purging in
-	 * lockstep.
-	 */
-	nstime_t		deadline;
-	/*
-	 * Number of unpurged pages at beginning of current epoch.  During epoch
-	 * advancement we use the delta between arena->decay_*.nunpurged and
-	 * extents_npages_get(&arena->extents_*) to determine how many dirty
-	 * pages, if any, were generated.
-	 */
-	size_t			nunpurged;
-	/*
-	 * Trailing log of how many unused dirty pages were generated during
-	 * each of the past SMOOTHSTEP_NSTEPS decay epochs, where the last
-	 * element is the most recent epoch.  Corresponding epoch times are
-	 * relative to epoch.
-	 */
-	size_t			backlog[SMOOTHSTEP_NSTEPS];
-
-	/*
-	 * Pointer to associated stats.  These stats are embedded directly in
-	 * the arena's stats due to how stats structures are shared between the
-	 * arena and ctl code.
-	 *
-	 * Synchronization: Same as associated arena's stats field. */
-	arena_stats_decay_t	*stats;
-	/* Peak number of pages in associated extents.  Used for debug only. */
-	uint64_t		ceil_npages;
-};
-
-struct arena_s {
-	/*
-	 * Number of threads currently assigned to this arena.  Each thread has
-	 * two distinct assignments, one for application-serving allocation, and
-	 * the other for internal metadata allocation.  Internal metadata must
-	 * not be allocated from arenas explicitly created via the arenas.create
-	 * mallctl, because the arena.<i>.reset mallctl indiscriminately
-	 * discards all allocations for the affected arena.
-	 *
-	 *   0: Application allocation.
-	 *   1: Internal metadata allocation.
-	 *
-	 * Synchronization: atomic.
-	 */
-	atomic_u_t		nthreads[2];
-
-	/*
-	 * When percpu_arena is enabled, to amortize the cost of reading /
-	 * updating the current CPU id, track the most recent thread accessing
-	 * this arena, and only read CPU if there is a mismatch.
-	 */
-	tsdn_t		*last_thd;
-
-	/* Synchronization: internal. */
-	arena_stats_t		stats;
-
-	/*
-	 * Lists of tcaches and cache_bin_array_descriptors for extant threads
-	 * associated with this arena.  Stats from these are merged
-	 * incrementally, and at exit if opt_stats_print is enabled.
-	 *
-	 * Synchronization: tcache_ql_mtx.
-	 */
-	ql_head(tcache_t)			tcache_ql;
-	ql_head(cache_bin_array_descriptor_t)	cache_bin_array_descriptor_ql;
-	malloc_mutex_t				tcache_ql_mtx;
-
-	/* Synchronization: internal. */
-	prof_accum_t		prof_accum;
-	uint64_t		prof_accumbytes;
-
-	/*
-	 * PRNG state for cache index randomization of large allocation base
-	 * pointers.
-	 *
-	 * Synchronization: atomic.
-	 */
-	atomic_zu_t		offset_state;
-
-	/*
-	 * Extent serial number generator state.
-	 *
-	 * Synchronization: atomic.
-	 */
-	atomic_zu_t		extent_sn_next;
-
-	/*
-	 * Represents a dss_prec_t, but atomically.
-	 *
-	 * Synchronization: atomic.
-	 */
-	atomic_u_t		dss_prec;
-
-	/*
-	 * Number of pages in active extents.
-	 *
-	 * Synchronization: atomic.
-	 */
-	atomic_zu_t		nactive;
-
-	/*
-	 * Extant large allocations.
-	 *
-	 * Synchronization: large_mtx.
-	 */
-	extent_list_t		large;
-	/* Synchronizes all large allocation/update/deallocation. */
-	malloc_mutex_t		large_mtx;
-
-	/*
-	 * Collections of extents that were previously allocated.  These are
-	 * used when allocating extents, in an attempt to re-use address space.
-	 *
-	 * Synchronization: internal.
-	 */
-	extents_t		extents_dirty;
-	extents_t		extents_muzzy;
-	extents_t		extents_retained;
-
-	/*
-	 * Decay-based purging state, responsible for scheduling extent state
-	 * transitions.
-	 *
-	 * Synchronization: internal.
-	 */
-	arena_decay_t		decay_dirty; /* dirty --> muzzy */
-	arena_decay_t		decay_muzzy; /* muzzy --> retained */
-
-	/*
-	 * Next extent size class in a growing series to use when satisfying a
-	 * request via the extent hooks (only if opt_retain).  This limits the
-	 * number of disjoint virtual memory ranges so that extent merging can
-	 * be effective even if multiple arenas' extent allocation requests are
-	 * highly interleaved.
-	 *
-	 * retain_grow_limit is the max allowed size ind to expand (unless the
-	 * required size is greater).  Default is no limit, and controlled
-	 * through mallctl only.
-	 *
-	 * Synchronization: extent_grow_mtx
-	 */
-	pszind_t		extent_grow_next;
-	pszind_t		retain_grow_limit;
-	malloc_mutex_t		extent_grow_mtx;
-
-	/*
-	 * Available extent structures that were allocated via
-	 * base_alloc_extent().
-	 *
-	 * Synchronization: extent_avail_mtx.
-	 */
-	extent_tree_t		extent_avail;
-	malloc_mutex_t		extent_avail_mtx;
-
-	/*
-	 * bins is used to store heaps of free regions.
-	 *
-	 * Synchronization: internal.
-	 */
-	bin_t			bins[NBINS];
-
-	/*
-	 * Base allocator, from which arena metadata are allocated.
-	 *
-	 * Synchronization: internal.
-	 */
-	base_t			*base;
-	/* Used to determine uptime.  Read-only after initialization. */
-	nstime_t		create_time;
-};
-
-/* Used in conjunction with tsd for fast arena-related context lookup. */
-struct arena_tdata_s {
-	ticker_t		decay_ticker;
-};
-
-/* Used to pass rtree lookup context down the path. */
-struct alloc_ctx_s {
-	szind_t szind;
-	bool slab;
-};
-
-#endif /* JEMALLOC_INTERNAL_ARENA_STRUCTS_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
deleted file mode 100644
index 70001b5f..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/arena_types.h
+++ /dev/null
@@ -1,43 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ARENA_TYPES_H
-#define JEMALLOC_INTERNAL_ARENA_TYPES_H
-
-/* Maximum number of regions in one slab. */
-#define LG_SLAB_MAXREGS		(LG_PAGE - LG_TINY_MIN)
-#define SLAB_MAXREGS		(1U << LG_SLAB_MAXREGS)
-
-/* Default decay times in milliseconds. */
-#define DIRTY_DECAY_MS_DEFAULT	ZD(10 * 1000)
-#define MUZZY_DECAY_MS_DEFAULT	ZD(10 * 1000)
-/* Number of event ticks between time checks. */
-#define DECAY_NTICKS_PER_UPDATE	1000
-
-typedef struct arena_slab_data_s arena_slab_data_t;
-typedef struct arena_decay_s arena_decay_t;
-typedef struct arena_s arena_t;
-typedef struct arena_tdata_s arena_tdata_t;
-typedef struct alloc_ctx_s alloc_ctx_t;
-
-typedef enum {
-	percpu_arena_mode_names_base   = 0, /* Used for options processing. */
-
-	/*
-	 * *_uninit are used only during bootstrapping, and must correspond
-	 * to initialized variant plus percpu_arena_mode_enabled_base.
-	 */
-	percpu_arena_uninit            = 0,
-	per_phycpu_arena_uninit        = 1,
-
-	/* All non-disabled modes must come after percpu_arena_disabled. */
-	percpu_arena_disabled          = 2,
-
-	percpu_arena_mode_names_limit  = 3, /* Used for options processing. */
-	percpu_arena_mode_enabled_base = 3,
-
-	percpu_arena                   = 3,
-	per_phycpu_arena               = 4  /* Hyper threads share arena. */
-} percpu_arena_mode_t;
-
-#define PERCPU_ARENA_ENABLED(m)	((m) >= percpu_arena_mode_enabled_base)
-#define PERCPU_ARENA_DEFAULT	percpu_arena_disabled
-
-#endif /* JEMALLOC_INTERNAL_ARENA_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
deleted file mode 100644
index be4d45b3..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/assert.h
+++ /dev/null
@@ -1,56 +0,0 @@
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/util.h"
-
-/*
- * Define a custom assert() in order to reduce the chances of deadlock during
- * assertion failure.
- */
-#ifndef assert
-#define assert(e) do {							\
-	if (unlikely(config_debug && !(e))) {				\
-		malloc_printf(						\
-		    "<jemalloc>: %s:%d: Failed assertion: \"%s\"\n",	\
-		    __FILE__, __LINE__, #e);				\
-		abort();						\
-	}								\
-} while (0)
-#endif
-
-#ifndef not_reached
-#define not_reached() do {						\
-	if (config_debug) {						\
-		malloc_printf(						\
-		    "<jemalloc>: %s:%d: Unreachable code reached\n",	\
-		    __FILE__, __LINE__);				\
-		abort();						\
-	}								\
-	unreachable();							\
-} while (0)
-#endif
-
-#ifndef not_implemented
-#define not_implemented() do {						\
-	if (config_debug) {						\
-		malloc_printf("<jemalloc>: %s:%d: Not implemented\n",	\
-		    __FILE__, __LINE__);				\
-		abort();						\
-	}								\
-} while (0)
-#endif
-
-#ifndef assert_not_implemented
-#define assert_not_implemented(e) do {					\
-	if (unlikely(config_debug && !(e))) {				\
-		not_implemented();					\
-	}								\
-} while (0)
-#endif
-
-/* Use to assert a particular configuration, e.g., cassert(config_debug). */
-#ifndef cassert
-#define cassert(c) do {							\
-	if (unlikely(!(c))) {						\
-		not_reached();						\
-	}								\
-} while (0)
-#endif
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
deleted file mode 100644
index adadb1a3..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic.h
+++ /dev/null
@@ -1,77 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ATOMIC_H
-#define JEMALLOC_INTERNAL_ATOMIC_H
-
-#define ATOMIC_INLINE static inline
-
-#if defined(JEMALLOC_GCC_ATOMIC_ATOMICS)
-#  include "jemalloc/internal/atomic_gcc_atomic.h"
-#elif defined(JEMALLOC_GCC_SYNC_ATOMICS)
-#  include "jemalloc/internal/atomic_gcc_sync.h"
-#elif defined(_MSC_VER)
-#  include "jemalloc/internal/atomic_msvc.h"
-#elif defined(JEMALLOC_C11_ATOMICS)
-#  include "jemalloc/internal/atomic_c11.h"
-#else
-#  error "Don't have atomics implemented on this platform."
-#endif
-
-/*
- * This header gives more or less a backport of C11 atomics. The user can write
- * JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_sizeof_type); to generate
- * counterparts of the C11 atomic functions for type, as so:
- *   JEMALLOC_GENERATE_ATOMICS(int *, pi, 3);
- * and then write things like:
- *   int *some_ptr;
- *   atomic_pi_t atomic_ptr_to_int;
- *   atomic_store_pi(&atomic_ptr_to_int, some_ptr, ATOMIC_RELAXED);
- *   int *prev_value = atomic_exchange_pi(&ptr_to_int, NULL, ATOMIC_ACQ_REL);
- *   assert(some_ptr == prev_value);
- * and expect things to work in the obvious way.
- *
- * Also included (with naming differences to avoid conflicts with the standard
- * library):
- *   atomic_fence(atomic_memory_order_t) (mimics C11's atomic_thread_fence).
- *   ATOMIC_INIT (mimics C11's ATOMIC_VAR_INIT).
- */
-
-/*
- * Pure convenience, so that we don't have to type "atomic_memory_order_"
- * quite so often.
- */
-#define ATOMIC_RELAXED atomic_memory_order_relaxed
-#define ATOMIC_ACQUIRE atomic_memory_order_acquire
-#define ATOMIC_RELEASE atomic_memory_order_release
-#define ATOMIC_ACQ_REL atomic_memory_order_acq_rel
-#define ATOMIC_SEQ_CST atomic_memory_order_seq_cst
-
-/*
- * Not all platforms have 64-bit atomics.  If we do, this #define exposes that
- * fact.
- */
-#if (LG_SIZEOF_PTR == 3 || LG_SIZEOF_INT == 3)
-#  define JEMALLOC_ATOMIC_U64
-#endif
-
-JEMALLOC_GENERATE_ATOMICS(void *, p, LG_SIZEOF_PTR)
-
-/*
- * There's no actual guarantee that sizeof(bool) == 1, but it's true on the only
- * platform that actually needs to know the size, MSVC.
- */
-JEMALLOC_GENERATE_ATOMICS(bool, b, 0)
-
-JEMALLOC_GENERATE_INT_ATOMICS(unsigned, u, LG_SIZEOF_INT)
-
-JEMALLOC_GENERATE_INT_ATOMICS(size_t, zu, LG_SIZEOF_PTR)
-
-JEMALLOC_GENERATE_INT_ATOMICS(ssize_t, zd, LG_SIZEOF_PTR)
-
-JEMALLOC_GENERATE_INT_ATOMICS(uint32_t, u32, 2)
-
-#ifdef JEMALLOC_ATOMIC_U64
-JEMALLOC_GENERATE_INT_ATOMICS(uint64_t, u64, 3)
-#endif
-
-#undef ATOMIC_INLINE
-
-#endif /* JEMALLOC_INTERNAL_ATOMIC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
deleted file mode 100644
index a5f9313a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_c11.h
+++ /dev/null
@@ -1,97 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ATOMIC_C11_H
-#define JEMALLOC_INTERNAL_ATOMIC_C11_H
-
-#include <stdatomic.h>
-
-#define ATOMIC_INIT(...) ATOMIC_VAR_INIT(__VA_ARGS__)
-
-#define atomic_memory_order_t memory_order
-#define atomic_memory_order_relaxed memory_order_relaxed
-#define atomic_memory_order_acquire memory_order_acquire
-#define atomic_memory_order_release memory_order_release
-#define atomic_memory_order_acq_rel memory_order_acq_rel
-#define atomic_memory_order_seq_cst memory_order_seq_cst
-
-#define atomic_fence atomic_thread_fence
-
-#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
-    /* unused */ lg_size)						\
-typedef _Atomic(type) atomic_##short_type##_t;				\
-									\
-ATOMIC_INLINE type							\
-atomic_load_##short_type(const atomic_##short_type##_t *a,		\
-    atomic_memory_order_t mo) {						\
-	/*								\
-	 * A strict interpretation of the C standard prevents		\
-	 * atomic_load from taking a const argument, but it's		\
-	 * convenient for our purposes. This cast is a workaround.	\
-	 */								\
-	atomic_##short_type##_t* a_nonconst =				\
-	    (atomic_##short_type##_t*)a;				\
-	return atomic_load_explicit(a_nonconst, mo);			\
-}									\
-									\
-ATOMIC_INLINE void							\
-atomic_store_##short_type(atomic_##short_type##_t *a,			\
-    type val, atomic_memory_order_t mo) {				\
-	atomic_store_explicit(a, val, mo);				\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return atomic_exchange_explicit(a, val, mo);			\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	return atomic_compare_exchange_weak_explicit(a, expected,	\
-	    desired, success_mo, failure_mo);				\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	return atomic_compare_exchange_strong_explicit(a, expected,	\
-	    desired, success_mo, failure_mo);				\
-}
-
-/*
- * Integral types have some special operations available that non-integral ones
- * lack.
- */
-#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type, 		\
-    /* unused */ lg_size)						\
-JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_add_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return atomic_fetch_add_explicit(a, val, mo);			\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_sub_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return atomic_fetch_sub_explicit(a, val, mo);			\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_and_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return atomic_fetch_and_explicit(a, val, mo);			\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_or_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return atomic_fetch_or_explicit(a, val, mo);			\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_xor_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return atomic_fetch_xor_explicit(a, val, mo);			\
-}
-
-#endif /* JEMALLOC_INTERNAL_ATOMIC_C11_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
deleted file mode 100644
index 6b73a14f..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_atomic.h
+++ /dev/null
@@ -1,127 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H
-#define JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H
-
-#include "jemalloc/internal/assert.h"
-
-#define ATOMIC_INIT(...) {__VA_ARGS__}
-
-typedef enum {
-	atomic_memory_order_relaxed,
-	atomic_memory_order_acquire,
-	atomic_memory_order_release,
-	atomic_memory_order_acq_rel,
-	atomic_memory_order_seq_cst
-} atomic_memory_order_t;
-
-ATOMIC_INLINE int
-atomic_enum_to_builtin(atomic_memory_order_t mo) {
-	switch (mo) {
-	case atomic_memory_order_relaxed:
-		return __ATOMIC_RELAXED;
-	case atomic_memory_order_acquire:
-		return __ATOMIC_ACQUIRE;
-	case atomic_memory_order_release:
-		return __ATOMIC_RELEASE;
-	case atomic_memory_order_acq_rel:
-		return __ATOMIC_ACQ_REL;
-	case atomic_memory_order_seq_cst:
-		return __ATOMIC_SEQ_CST;
-	}
-	/* Can't happen; the switch is exhaustive. */
-	not_reached();
-}
-
-ATOMIC_INLINE void
-atomic_fence(atomic_memory_order_t mo) {
-	__atomic_thread_fence(atomic_enum_to_builtin(mo));
-}
-
-#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
-    /* unused */ lg_size)						\
-typedef struct {							\
-	type repr;							\
-} atomic_##short_type##_t;						\
-									\
-ATOMIC_INLINE type							\
-atomic_load_##short_type(const atomic_##short_type##_t *a,		\
-    atomic_memory_order_t mo) {						\
-	type result;							\
-	__atomic_load(&a->repr, &result, atomic_enum_to_builtin(mo));	\
-	return result;							\
-}									\
-									\
-ATOMIC_INLINE void							\
-atomic_store_##short_type(atomic_##short_type##_t *a, type val,		\
-    atomic_memory_order_t mo) {						\
-	__atomic_store(&a->repr, &val, atomic_enum_to_builtin(mo));	\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	type result;							\
-	__atomic_exchange(&a->repr, &val, &result,			\
-	    atomic_enum_to_builtin(mo));				\
-	return result;							\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	return __atomic_compare_exchange(&a->repr, expected, &desired,	\
-	    true, atomic_enum_to_builtin(success_mo),			\
-	    atomic_enum_to_builtin(failure_mo));			\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	return __atomic_compare_exchange(&a->repr, expected, &desired,	\
-	    false,							\
-	    atomic_enum_to_builtin(success_mo),				\
-	    atomic_enum_to_builtin(failure_mo));			\
-}
-
-
-#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type,			\
-    /* unused */ lg_size)						\
-JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_add_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __atomic_fetch_add(&a->repr, val,			\
-	    atomic_enum_to_builtin(mo));				\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_sub_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __atomic_fetch_sub(&a->repr, val,			\
-	    atomic_enum_to_builtin(mo));				\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_and_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __atomic_fetch_and(&a->repr, val,			\
-	    atomic_enum_to_builtin(mo));				\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_or_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __atomic_fetch_or(&a->repr, val,				\
-	    atomic_enum_to_builtin(mo));				\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_xor_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __atomic_fetch_xor(&a->repr, val,			\
-	    atomic_enum_to_builtin(mo));				\
-}
-
-#endif /* JEMALLOC_INTERNAL_ATOMIC_GCC_ATOMIC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
deleted file mode 100644
index 30846e4d..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_gcc_sync.h
+++ /dev/null
@@ -1,191 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H
-#define JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H
-
-#define ATOMIC_INIT(...) {__VA_ARGS__}
-
-typedef enum {
-	atomic_memory_order_relaxed,
-	atomic_memory_order_acquire,
-	atomic_memory_order_release,
-	atomic_memory_order_acq_rel,
-	atomic_memory_order_seq_cst
-} atomic_memory_order_t;
-
-ATOMIC_INLINE void
-atomic_fence(atomic_memory_order_t mo) {
-	/* Easy cases first: no barrier, and full barrier. */
-	if (mo == atomic_memory_order_relaxed) {
-		asm volatile("" ::: "memory");
-		return;
-	}
-	if (mo == atomic_memory_order_seq_cst) {
-		asm volatile("" ::: "memory");
-		__sync_synchronize();
-		asm volatile("" ::: "memory");
-		return;
-	}
-	asm volatile("" ::: "memory");
-#  if defined(__i386__) || defined(__x86_64__)
-	/* This is implicit on x86. */
-#  elif defined(__ppc__)
-	asm volatile("lwsync");
-#  elif defined(__sparc__) && defined(__arch64__)
-	if (mo == atomic_memory_order_acquire) {
-		asm volatile("membar #LoadLoad | #LoadStore");
-	} else if (mo == atomic_memory_order_release) {
-		asm volatile("membar #LoadStore | #StoreStore");
-	} else {
-		asm volatile("membar #LoadLoad | #LoadStore | #StoreStore");
-	}
-#  else
-	__sync_synchronize();
-#  endif
-	asm volatile("" ::: "memory");
-}
-
-/*
- * A correct implementation of seq_cst loads and stores on weakly ordered
- * architectures could do either of the following:
- *   1. store() is weak-fence -> store -> strong fence, load() is load ->
- *      strong-fence.
- *   2. store() is strong-fence -> store, load() is strong-fence -> load ->
- *      weak-fence.
- * The tricky thing is, load() and store() above can be the load or store
- * portions of a gcc __sync builtin, so we have to follow GCC's lead, which
- * means going with strategy 2.
- * On strongly ordered architectures, the natural strategy is to stick a strong
- * fence after seq_cst stores, and have naked loads.  So we want the strong
- * fences in different places on different architectures.
- * atomic_pre_sc_load_fence and atomic_post_sc_store_fence allow us to
- * accomplish this.
- */
-
-ATOMIC_INLINE void
-atomic_pre_sc_load_fence() {
-#  if defined(__i386__) || defined(__x86_64__) ||			\
-    (defined(__sparc__) && defined(__arch64__))
-	atomic_fence(atomic_memory_order_relaxed);
-#  else
-	atomic_fence(atomic_memory_order_seq_cst);
-#  endif
-}
-
-ATOMIC_INLINE void
-atomic_post_sc_store_fence() {
-#  if defined(__i386__) || defined(__x86_64__) ||			\
-    (defined(__sparc__) && defined(__arch64__))
-	atomic_fence(atomic_memory_order_seq_cst);
-#  else
-	atomic_fence(atomic_memory_order_relaxed);
-#  endif
-
-}
-
-#define JEMALLOC_GENERATE_ATOMICS(type, short_type,			\
-    /* unused */ lg_size)						\
-typedef struct {							\
-	type volatile repr;						\
-} atomic_##short_type##_t;						\
-									\
-ATOMIC_INLINE type							\
-atomic_load_##short_type(const atomic_##short_type##_t *a,		\
-    atomic_memory_order_t mo) {						\
-	if (mo == atomic_memory_order_seq_cst) {			\
-		atomic_pre_sc_load_fence();				\
-	}								\
-	type result = a->repr;						\
-	if (mo != atomic_memory_order_relaxed) {			\
-		atomic_fence(atomic_memory_order_acquire);		\
-	}								\
-	return result;							\
-}									\
-									\
-ATOMIC_INLINE void							\
-atomic_store_##short_type(atomic_##short_type##_t *a,			\
-    type val, atomic_memory_order_t mo) {				\
-	if (mo != atomic_memory_order_relaxed) {			\
-		atomic_fence(atomic_memory_order_release);		\
-	}								\
-	a->repr = val;							\
-	if (mo == atomic_memory_order_seq_cst) {			\
-		atomic_post_sc_store_fence();				\
-	}								\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	/*								\
-	 * Because of FreeBSD, we care about gcc 4.2, which doesn't have\
-	 * an atomic exchange builtin.  We fake it with a CAS loop.	\
-	 */								\
-	while (true) {							\
-		type old = a->repr;					\
-		if (__sync_bool_compare_and_swap(&a->repr, old, val)) {	\
-			return old;					\
-		}							\
-	}								\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	type prev = __sync_val_compare_and_swap(&a->repr, *expected,	\
-	    desired);							\
-	if (prev == *expected) {					\
-		return true;						\
-	} else {							\
-		*expected = prev;					\
-		return false;						\
-	}								\
-}									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	type prev = __sync_val_compare_and_swap(&a->repr, *expected,	\
-	    desired);							\
-	if (prev == *expected) {					\
-		return true;						\
-	} else {							\
-		*expected = prev;					\
-		return false;						\
-	}								\
-}
-
-#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type,			\
-    /* unused */ lg_size)						\
-JEMALLOC_GENERATE_ATOMICS(type, short_type, /* unused */ lg_size)	\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_add_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __sync_fetch_and_add(&a->repr, val);			\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_sub_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __sync_fetch_and_sub(&a->repr, val);			\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_and_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __sync_fetch_and_and(&a->repr, val);			\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_or_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __sync_fetch_and_or(&a->repr, val);			\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_xor_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return __sync_fetch_and_xor(&a->repr, val);			\
-}
-
-#endif /* JEMALLOC_INTERNAL_ATOMIC_GCC_SYNC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
deleted file mode 100644
index 67057ce5..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/atomic_msvc.h
+++ /dev/null
@@ -1,158 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_ATOMIC_MSVC_H
-#define JEMALLOC_INTERNAL_ATOMIC_MSVC_H
-
-#define ATOMIC_INIT(...) {__VA_ARGS__}
-
-typedef enum {
-	atomic_memory_order_relaxed,
-	atomic_memory_order_acquire,
-	atomic_memory_order_release,
-	atomic_memory_order_acq_rel,
-	atomic_memory_order_seq_cst
-} atomic_memory_order_t;
-
-typedef char atomic_repr_0_t;
-typedef short atomic_repr_1_t;
-typedef long atomic_repr_2_t;
-typedef __int64 atomic_repr_3_t;
-
-ATOMIC_INLINE void
-atomic_fence(atomic_memory_order_t mo) {
-	_ReadWriteBarrier();
-#  if defined(_M_ARM) || defined(_M_ARM64)
-	/* ARM needs a barrier for everything but relaxed. */
-	if (mo != atomic_memory_order_relaxed) {
-		MemoryBarrier();
-	}
-#  elif defined(_M_IX86) || defined (_M_X64)
-	/* x86 needs a barrier only for seq_cst. */
-	if (mo == atomic_memory_order_seq_cst) {
-		MemoryBarrier();
-	}
-#  else
-#  error "Don't know how to create atomics for this platform for MSVC."
-#  endif
-	_ReadWriteBarrier();
-}
-
-#define ATOMIC_INTERLOCKED_REPR(lg_size) atomic_repr_ ## lg_size ## _t
-
-#define ATOMIC_CONCAT(a, b) ATOMIC_RAW_CONCAT(a, b)
-#define ATOMIC_RAW_CONCAT(a, b) a ## b
-
-#define ATOMIC_INTERLOCKED_NAME(base_name, lg_size) ATOMIC_CONCAT(	\
-    base_name, ATOMIC_INTERLOCKED_SUFFIX(lg_size))
-
-#define ATOMIC_INTERLOCKED_SUFFIX(lg_size)				\
-    ATOMIC_CONCAT(ATOMIC_INTERLOCKED_SUFFIX_, lg_size)
-
-#define ATOMIC_INTERLOCKED_SUFFIX_0 8
-#define ATOMIC_INTERLOCKED_SUFFIX_1 16
-#define ATOMIC_INTERLOCKED_SUFFIX_2
-#define ATOMIC_INTERLOCKED_SUFFIX_3 64
-
-#define JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_size)		\
-typedef struct {							\
-	ATOMIC_INTERLOCKED_REPR(lg_size) repr;				\
-} atomic_##short_type##_t;						\
-									\
-ATOMIC_INLINE type							\
-atomic_load_##short_type(const atomic_##short_type##_t *a,		\
-    atomic_memory_order_t mo) {						\
-	ATOMIC_INTERLOCKED_REPR(lg_size) ret = a->repr;			\
-	if (mo != atomic_memory_order_relaxed) {			\
-		atomic_fence(atomic_memory_order_acquire);		\
-	}								\
-	return (type) ret;						\
-}									\
-									\
-ATOMIC_INLINE void							\
-atomic_store_##short_type(atomic_##short_type##_t *a,			\
-    type val, atomic_memory_order_t mo) {				\
-	if (mo != atomic_memory_order_relaxed) {			\
-		atomic_fence(atomic_memory_order_release);		\
-	}								\
-	a->repr = (ATOMIC_INTERLOCKED_REPR(lg_size)) val;		\
-	if (mo == atomic_memory_order_seq_cst) {			\
-		atomic_fence(atomic_memory_order_seq_cst);		\
-	}								\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_exchange_##short_type(atomic_##short_type##_t *a, type val,	\
-    atomic_memory_order_t mo) {						\
-	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedExchange,	\
-	    lg_size)(&a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);	\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_weak_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	ATOMIC_INTERLOCKED_REPR(lg_size) e =				\
-	    (ATOMIC_INTERLOCKED_REPR(lg_size))*expected;		\
-	ATOMIC_INTERLOCKED_REPR(lg_size) d =				\
-	    (ATOMIC_INTERLOCKED_REPR(lg_size))desired;			\
-	ATOMIC_INTERLOCKED_REPR(lg_size) old =				\
-	    ATOMIC_INTERLOCKED_NAME(_InterlockedCompareExchange, 	\
-		lg_size)(&a->repr, d, e);				\
-	if (old == e) {							\
-		return true;						\
-	} else {							\
-		*expected = (type)old;					\
-		return false;						\
-	}								\
-}									\
-									\
-ATOMIC_INLINE bool							\
-atomic_compare_exchange_strong_##short_type(atomic_##short_type##_t *a,	\
-    type *expected, type desired, atomic_memory_order_t success_mo,	\
-    atomic_memory_order_t failure_mo) {					\
-	/* We implement the weak version with strong semantics. */	\
-	return atomic_compare_exchange_weak_##short_type(a, expected,	\
-	    desired, success_mo, failure_mo);				\
-}
-
-
-#define JEMALLOC_GENERATE_INT_ATOMICS(type, short_type, lg_size)	\
-JEMALLOC_GENERATE_ATOMICS(type, short_type, lg_size)			\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_add_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedExchangeAdd,	\
-	    lg_size)(&a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);	\
-}									\
-									\
-ATOMIC_INLINE type							\
-atomic_fetch_sub_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	/*								\
-	 * MSVC warns on negation of unsigned operands, but for us it	\
-	 * gives exactly the right semantics (MAX_TYPE + 1 - operand).	\
-	 */								\
-	__pragma(warning(push))						\
-	__pragma(warning(disable: 4146))				\
-	return atomic_fetch_add_##short_type(a, -val, mo);		\
-	__pragma(warning(pop))						\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_and_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedAnd, lg_size)(	\
-	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_or_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedOr, lg_size)(	\
-	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
-}									\
-ATOMIC_INLINE type							\
-atomic_fetch_xor_##short_type(atomic_##short_type##_t *a,		\
-    type val, atomic_memory_order_t mo) {				\
-	return (type)ATOMIC_INTERLOCKED_NAME(_InterlockedXor, lg_size)(	\
-	    &a->repr, (ATOMIC_INTERLOCKED_REPR(lg_size))val);		\
-}
-
-#endif /* JEMALLOC_INTERNAL_ATOMIC_MSVC_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
deleted file mode 100644
index 3209aa49..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_externs.h
+++ /dev/null
@@ -1,33 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H
-#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H
-
-extern bool opt_background_thread;
-extern size_t opt_max_background_threads;
-extern malloc_mutex_t background_thread_lock;
-extern atomic_b_t background_thread_enabled_state;
-extern size_t n_background_threads;
-extern size_t max_background_threads;
-extern background_thread_info_t *background_thread_info;
-extern bool can_enable_background_thread;
-
-bool background_thread_create(tsd_t *tsd, unsigned arena_ind);
-bool background_threads_enable(tsd_t *tsd);
-bool background_threads_disable(tsd_t *tsd);
-void background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
-    arena_decay_t *decay, size_t npages_new);
-void background_thread_prefork0(tsdn_t *tsdn);
-void background_thread_prefork1(tsdn_t *tsdn);
-void background_thread_postfork_parent(tsdn_t *tsdn);
-void background_thread_postfork_child(tsdn_t *tsdn);
-bool background_thread_stats_read(tsdn_t *tsdn,
-    background_thread_stats_t *stats);
-void background_thread_ctl_init(tsdn_t *tsdn);
-
-#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
-extern int pthread_create_wrapper(pthread_t *__restrict, const pthread_attr_t *,
-    void *(*)(void *), void *__restrict);
-#endif
-bool background_thread_boot0(void);
-bool background_thread_boot1(tsdn_t *tsdn);
-
-#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
deleted file mode 100644
index ef50231e..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_inlines.h
+++ /dev/null
@@ -1,57 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H
-#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H
-
-JEMALLOC_ALWAYS_INLINE bool
-background_thread_enabled(void) {
-	return atomic_load_b(&background_thread_enabled_state, ATOMIC_RELAXED);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-background_thread_enabled_set(tsdn_t *tsdn, bool state) {
-	malloc_mutex_assert_owner(tsdn, &background_thread_lock);
-	atomic_store_b(&background_thread_enabled_state, state, ATOMIC_RELAXED);
-}
-
-JEMALLOC_ALWAYS_INLINE background_thread_info_t *
-arena_background_thread_info_get(arena_t *arena) {
-	unsigned arena_ind = arena_ind_get(arena);
-	return &background_thread_info[arena_ind % ncpus];
-}
-
-JEMALLOC_ALWAYS_INLINE uint64_t
-background_thread_wakeup_time_get(background_thread_info_t *info) {
-	uint64_t next_wakeup = nstime_ns(&info->next_wakeup);
-	assert(atomic_load_b(&info->indefinite_sleep, ATOMIC_ACQUIRE) ==
-	    (next_wakeup == BACKGROUND_THREAD_INDEFINITE_SLEEP));
-	return next_wakeup;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-background_thread_wakeup_time_set(tsdn_t *tsdn, background_thread_info_t *info,
-    uint64_t wakeup_time) {
-	malloc_mutex_assert_owner(tsdn, &info->mtx);
-	atomic_store_b(&info->indefinite_sleep,
-	    wakeup_time == BACKGROUND_THREAD_INDEFINITE_SLEEP, ATOMIC_RELEASE);
-	nstime_init(&info->next_wakeup, wakeup_time);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-background_thread_indefinite_sleep(background_thread_info_t *info) {
-	return atomic_load_b(&info->indefinite_sleep, ATOMIC_ACQUIRE);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-arena_background_thread_inactivity_check(tsdn_t *tsdn, arena_t *arena,
-    bool is_background_thread) {
-	if (!background_thread_enabled() || is_background_thread) {
-		return;
-	}
-	background_thread_info_t *info =
-	    arena_background_thread_info_get(arena);
-	if (background_thread_indefinite_sleep(info)) {
-		background_thread_interval_check(tsdn, arena,
-		    &arena->decay_dirty, 0);
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
deleted file mode 100644
index c1107dfe..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/background_thread_structs.h
+++ /dev/null
@@ -1,53 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H
-#define JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H
-
-/* This file really combines "structs" and "types", but only transitionally. */
-
-#if defined(JEMALLOC_BACKGROUND_THREAD) || defined(JEMALLOC_LAZY_LOCK)
-#  define JEMALLOC_PTHREAD_CREATE_WRAPPER
-#endif
-
-#define BACKGROUND_THREAD_INDEFINITE_SLEEP UINT64_MAX
-#define MAX_BACKGROUND_THREAD_LIMIT MALLOCX_ARENA_LIMIT
-
-typedef enum {
-	background_thread_stopped,
-	background_thread_started,
-	/* Thread waits on the global lock when paused (for arena_reset). */
-	background_thread_paused,
-} background_thread_state_t;
-
-struct background_thread_info_s {
-#ifdef JEMALLOC_BACKGROUND_THREAD
-	/* Background thread is pthread specific. */
-	pthread_t		thread;
-	pthread_cond_t		cond;
-#endif
-	malloc_mutex_t		mtx;
-	background_thread_state_t	state;
-	/* When true, it means no wakeup scheduled. */
-	atomic_b_t		indefinite_sleep;
-	/* Next scheduled wakeup time (absolute time in ns). */
-	nstime_t		next_wakeup;
-	/*
-	 *  Since the last background thread run, newly added number of pages
-	 *  that need to be purged by the next wakeup.  This is adjusted on
-	 *  epoch advance, and is used to determine whether we should signal the
-	 *  background thread to wake up earlier.
-	 */
-	size_t			npages_to_purge_new;
-	/* Stats: total number of runs since started. */
-	uint64_t		tot_n_runs;
-	/* Stats: total sleep time since started. */
-	nstime_t		tot_sleep_time;
-};
-typedef struct background_thread_info_s background_thread_info_t;
-
-struct background_thread_stats_s {
-	size_t num_threads;
-	uint64_t num_runs;
-	nstime_t run_interval;
-};
-typedef struct background_thread_stats_s background_thread_stats_t;
-
-#endif /* JEMALLOC_INTERNAL_BACKGROUND_THREAD_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
deleted file mode 100644
index 7b705c9b..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_externs.h
+++ /dev/null
@@ -1,22 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BASE_EXTERNS_H
-#define JEMALLOC_INTERNAL_BASE_EXTERNS_H
-
-extern metadata_thp_mode_t opt_metadata_thp;
-extern const char *metadata_thp_mode_names[];
-
-base_t *b0get(void);
-base_t *base_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
-void base_delete(tsdn_t *tsdn, base_t *base);
-extent_hooks_t *base_extent_hooks_get(base_t *base);
-extent_hooks_t *base_extent_hooks_set(base_t *base,
-    extent_hooks_t *extent_hooks);
-void *base_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment);
-extent_t *base_alloc_extent(tsdn_t *tsdn, base_t *base);
-void base_stats_get(tsdn_t *tsdn, base_t *base, size_t *allocated,
-    size_t *resident, size_t *mapped, size_t *n_thp);
-void base_prefork(tsdn_t *tsdn, base_t *base);
-void base_postfork_parent(tsdn_t *tsdn, base_t *base);
-void base_postfork_child(tsdn_t *tsdn, base_t *base);
-bool base_boot(tsdn_t *tsdn);
-
-#endif /* JEMALLOC_INTERNAL_BASE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
deleted file mode 100644
index aec0e2e1..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_inlines.h
+++ /dev/null
@@ -1,13 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BASE_INLINES_H
-#define JEMALLOC_INTERNAL_BASE_INLINES_H
-
-static inline unsigned
-base_ind_get(const base_t *base) {
-	return base->ind;
-}
-
-static inline bool
-metadata_thp_enabled(void) {
-	return (opt_metadata_thp != metadata_thp_disabled);
-}
-#endif /* JEMALLOC_INTERNAL_BASE_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
deleted file mode 100644
index 2102247a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_structs.h
+++ /dev/null
@@ -1,59 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BASE_STRUCTS_H
-#define JEMALLOC_INTERNAL_BASE_STRUCTS_H
-
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/size_classes.h"
-
-/* Embedded at the beginning of every block of base-managed virtual memory. */
-struct base_block_s {
-	/* Total size of block's virtual memory mapping. */
-	size_t		size;
-
-	/* Next block in list of base's blocks. */
-	base_block_t	*next;
-
-	/* Tracks unused trailing space. */
-	extent_t	extent;
-};
-
-struct base_s {
-	/* Associated arena's index within the arenas array. */
-	unsigned	ind;
-
-	/*
-	 * User-configurable extent hook functions.  Points to an
-	 * extent_hooks_t.
-	 */
-	atomic_p_t	extent_hooks;
-
-	/* Protects base_alloc() and base_stats_get() operations. */
-	malloc_mutex_t	mtx;
-
-	/* Using THP when true (metadata_thp auto mode). */
-	bool		auto_thp_switched;
-	/*
-	 * Most recent size class in the series of increasingly large base
-	 * extents.  Logarithmic spacing between subsequent allocations ensures
-	 * that the total number of distinct mappings remains small.
-	 */
-	pszind_t	pind_last;
-
-	/* Serial number generation state. */
-	size_t		extent_sn_next;
-
-	/* Chain of all blocks associated with base. */
-	base_block_t	*blocks;
-
-	/* Heap of extents that track unused trailing space within blocks. */
-	extent_heap_t	avail[NSIZES];
-
-	/* Stats, only maintained if config_stats. */
-	size_t		allocated;
-	size_t		resident;
-	size_t		mapped;
-	/* Number of THP regions touched. */
-	size_t		n_thp;
-};
-
-#endif /* JEMALLOC_INTERNAL_BASE_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
deleted file mode 100644
index b6db77df..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/base_types.h
+++ /dev/null
@@ -1,33 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BASE_TYPES_H
-#define JEMALLOC_INTERNAL_BASE_TYPES_H
-
-typedef struct base_block_s base_block_t;
-typedef struct base_s base_t;
-
-#define METADATA_THP_DEFAULT metadata_thp_disabled
-
-/*
- * In auto mode, arenas switch to huge pages for the base allocator on the
- * second base block.  a0 switches to thp on the 5th block (after 20 megabytes
- * of metadata), since more metadata (e.g. rtree nodes) come from a0's base.
- */
-
-#define BASE_AUTO_THP_THRESHOLD    2
-#define BASE_AUTO_THP_THRESHOLD_A0 5
-
-typedef enum {
-	metadata_thp_disabled   = 0,
-	/*
-	 * Lazily enable hugepage for metadata. To avoid high RSS caused by THP
-	 * + low usage arena (i.e. THP becomes a significant percentage), the
-	 * "auto" option only starts using THP after a base allocator used up
-	 * the first THP region.  Starting from the second hugepage (in a single
-	 * arena), "auto" behaves the same as "always", i.e. madvise hugepage
-	 * right away.
-	 */
-	metadata_thp_auto       = 1,
-	metadata_thp_always     = 2,
-	metadata_thp_mode_limit = 3
-} metadata_thp_mode_t;
-
-#endif /* JEMALLOC_INTERNAL_BASE_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
deleted file mode 100644
index 9b416ada..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin.h
+++ /dev/null
@@ -1,106 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BIN_H
-#define JEMALLOC_INTERNAL_BIN_H
-
-#include "jemalloc/internal/extent_types.h"
-#include "jemalloc/internal/extent_structs.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/bin_stats.h"
-
-/*
- * A bin contains a set of extents that are currently being used for slab
- * allocations.
- */
-
-/*
- * Read-only information associated with each element of arena_t's bins array
- * is stored separately, partly to reduce memory usage (only one copy, rather
- * than one per arena), but mainly to avoid false cacheline sharing.
- *
- * Each slab has the following layout:
- *
- *   /--------------------\
- *   | region 0           |
- *   |--------------------|
- *   | region 1           |
- *   |--------------------|
- *   | ...                |
- *   | ...                |
- *   | ...                |
- *   |--------------------|
- *   | region nregs-1     |
- *   \--------------------/
- */
-typedef struct bin_info_s bin_info_t;
-struct bin_info_s {
-	/* Size of regions in a slab for this bin's size class. */
-	size_t			reg_size;
-
-	/* Total size of a slab for this bin's size class. */
-	size_t			slab_size;
-
-	/* Total number of regions in a slab for this bin's size class. */
-	uint32_t		nregs;
-
-	/*
-	 * Metadata used to manipulate bitmaps for slabs associated with this
-	 * bin.
-	 */
-	bitmap_info_t		bitmap_info;
-};
-
-extern const bin_info_t bin_infos[NBINS];
-
-
-typedef struct bin_s bin_t;
-struct bin_s {
-	/* All operations on bin_t fields require lock ownership. */
-	malloc_mutex_t		lock;
-
-	/*
-	 * Current slab being used to service allocations of this bin's size
-	 * class.  slabcur is independent of slabs_{nonfull,full}; whenever
-	 * slabcur is reassigned, the previous slab must be deallocated or
-	 * inserted into slabs_{nonfull,full}.
-	 */
-	extent_t		*slabcur;
-
-	/*
-	 * Heap of non-full slabs.  This heap is used to assure that new
-	 * allocations come from the non-full slab that is oldest/lowest in
-	 * memory.
-	 */
-	extent_heap_t		slabs_nonfull;
-
-	/* List used to track full slabs. */
-	extent_list_t		slabs_full;
-
-	/* Bin statistics. */
-	bin_stats_t	stats;
-};
-
-/* Initializes a bin to empty.  Returns true on error. */
-bool bin_init(bin_t *bin);
-
-/* Forking. */
-void bin_prefork(tsdn_t *tsdn, bin_t *bin);
-void bin_postfork_parent(tsdn_t *tsdn, bin_t *bin);
-void bin_postfork_child(tsdn_t *tsdn, bin_t *bin);
-
-/* Stats. */
-static inline void
-bin_stats_merge(tsdn_t *tsdn, bin_stats_t *dst_bin_stats, bin_t *bin) {
-	malloc_mutex_lock(tsdn, &bin->lock);
-	malloc_mutex_prof_read(tsdn, &dst_bin_stats->mutex_data, &bin->lock);
-	dst_bin_stats->nmalloc += bin->stats.nmalloc;
-	dst_bin_stats->ndalloc += bin->stats.ndalloc;
-	dst_bin_stats->nrequests += bin->stats.nrequests;
-	dst_bin_stats->curregs += bin->stats.curregs;
-	dst_bin_stats->nfills += bin->stats.nfills;
-	dst_bin_stats->nflushes += bin->stats.nflushes;
-	dst_bin_stats->nslabs += bin->stats.nslabs;
-	dst_bin_stats->reslabs += bin->stats.reslabs;
-	dst_bin_stats->curslabs += bin->stats.curslabs;
-	malloc_mutex_unlock(tsdn, &bin->lock);
-}
-
-#endif /* JEMALLOC_INTERNAL_BIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
deleted file mode 100644
index 86e673ec..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/bin_stats.h
+++ /dev/null
@@ -1,51 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BIN_STATS_H
-#define JEMALLOC_INTERNAL_BIN_STATS_H
-
-#include "jemalloc/internal/mutex_prof.h"
-
-typedef struct bin_stats_s bin_stats_t;
-struct bin_stats_s {
-	/*
-	 * Total number of allocation/deallocation requests served directly by
-	 * the bin.  Note that tcache may allocate an object, then recycle it
-	 * many times, resulting many increments to nrequests, but only one
-	 * each to nmalloc and ndalloc.
-	 */
-	uint64_t	nmalloc;
-	uint64_t	ndalloc;
-
-	/*
-	 * Number of allocation requests that correspond to the size of this
-	 * bin.  This includes requests served by tcache, though tcache only
-	 * periodically merges into this counter.
-	 */
-	uint64_t	nrequests;
-
-	/*
-	 * Current number of regions of this size class, including regions
-	 * currently cached by tcache.
-	 */
-	size_t		curregs;
-
-	/* Number of tcache fills from this bin. */
-	uint64_t	nfills;
-
-	/* Number of tcache flushes to this bin. */
-	uint64_t	nflushes;
-
-	/* Total number of slabs created for this bin's size class. */
-	uint64_t	nslabs;
-
-	/*
-	 * Total number of slabs reused by extracting them from the slabs heap
-	 * for this bin's size class.
-	 */
-	uint64_t	reslabs;
-
-	/* Current number of slabs in this bin. */
-	size_t		curslabs;
-
-	mutex_prof_data_t mutex_data;
-};
-
-#endif /* JEMALLOC_INTERNAL_BIN_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
deleted file mode 100644
index 8d078a8a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/bit_util.h
+++ /dev/null
@@ -1,165 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BIT_UTIL_H
-#define JEMALLOC_INTERNAL_BIT_UTIL_H
-
-#include "jemalloc/internal/assert.h"
-
-#define BIT_UTIL_INLINE static inline
-
-/* Sanity check. */
-#if !defined(JEMALLOC_INTERNAL_FFSLL) || !defined(JEMALLOC_INTERNAL_FFSL) \
-    || !defined(JEMALLOC_INTERNAL_FFS)
-#  error JEMALLOC_INTERNAL_FFS{,L,LL} should have been defined by configure
-#endif
-
-
-BIT_UTIL_INLINE unsigned
-ffs_llu(unsigned long long bitmap) {
-	return JEMALLOC_INTERNAL_FFSLL(bitmap);
-}
-
-BIT_UTIL_INLINE unsigned
-ffs_lu(unsigned long bitmap) {
-	return JEMALLOC_INTERNAL_FFSL(bitmap);
-}
-
-BIT_UTIL_INLINE unsigned
-ffs_u(unsigned bitmap) {
-	return JEMALLOC_INTERNAL_FFS(bitmap);
-}
-
-BIT_UTIL_INLINE unsigned
-ffs_zu(size_t bitmap) {
-#if LG_SIZEOF_PTR == LG_SIZEOF_INT
-	return ffs_u(bitmap);
-#elif LG_SIZEOF_PTR == LG_SIZEOF_LONG
-	return ffs_lu(bitmap);
-#elif LG_SIZEOF_PTR == LG_SIZEOF_LONG_LONG
-	return ffs_llu(bitmap);
-#else
-#error No implementation for size_t ffs()
-#endif
-}
-
-BIT_UTIL_INLINE unsigned
-ffs_u64(uint64_t bitmap) {
-#if LG_SIZEOF_LONG == 3
-	return ffs_lu(bitmap);
-#elif LG_SIZEOF_LONG_LONG == 3
-	return ffs_llu(bitmap);
-#else
-#error No implementation for 64-bit ffs()
-#endif
-}
-
-BIT_UTIL_INLINE unsigned
-ffs_u32(uint32_t bitmap) {
-#if LG_SIZEOF_INT == 2
-	return ffs_u(bitmap);
-#else
-#error No implementation for 32-bit ffs()
-#endif
-	return ffs_u(bitmap);
-}
-
-BIT_UTIL_INLINE uint64_t
-pow2_ceil_u64(uint64_t x) {
-	x--;
-	x |= x >> 1;
-	x |= x >> 2;
-	x |= x >> 4;
-	x |= x >> 8;
-	x |= x >> 16;
-	x |= x >> 32;
-	x++;
-	return x;
-}
-
-BIT_UTIL_INLINE uint32_t
-pow2_ceil_u32(uint32_t x) {
-	x--;
-	x |= x >> 1;
-	x |= x >> 2;
-	x |= x >> 4;
-	x |= x >> 8;
-	x |= x >> 16;
-	x++;
-	return x;
-}
-
-/* Compute the smallest power of 2 that is >= x. */
-BIT_UTIL_INLINE size_t
-pow2_ceil_zu(size_t x) {
-#if (LG_SIZEOF_PTR == 3)
-	return pow2_ceil_u64(x);
-#else
-	return pow2_ceil_u32(x);
-#endif
-}
-
-#if (defined(__i386__) || defined(__amd64__) || defined(__x86_64__))
-BIT_UTIL_INLINE unsigned
-lg_floor(size_t x) {
-	size_t ret;
-	assert(x != 0);
-
-	asm ("bsr %1, %0"
-	    : "=r"(ret) // Outputs.
-	    : "r"(x)    // Inputs.
-	    );
-	assert(ret < UINT_MAX);
-	return (unsigned)ret;
-}
-#elif (defined(_MSC_VER))
-BIT_UTIL_INLINE unsigned
-lg_floor(size_t x) {
-	unsigned long ret;
-
-	assert(x != 0);
-
-#if (LG_SIZEOF_PTR == 3)
-	_BitScanReverse64(&ret, x);
-#elif (LG_SIZEOF_PTR == 2)
-	_BitScanReverse(&ret, x);
-#else
-#  error "Unsupported type size for lg_floor()"
-#endif
-	assert(ret < UINT_MAX);
-	return (unsigned)ret;
-}
-#elif (defined(JEMALLOC_HAVE_BUILTIN_CLZ))
-BIT_UTIL_INLINE unsigned
-lg_floor(size_t x) {
-	assert(x != 0);
-
-#if (LG_SIZEOF_PTR == LG_SIZEOF_INT)
-	return ((8 << LG_SIZEOF_PTR) - 1) - __builtin_clz(x);
-#elif (LG_SIZEOF_PTR == LG_SIZEOF_LONG)
-	return ((8 << LG_SIZEOF_PTR) - 1) - __builtin_clzl(x);
-#else
-#  error "Unsupported type size for lg_floor()"
-#endif
-}
-#else
-BIT_UTIL_INLINE unsigned
-lg_floor(size_t x) {
-	assert(x != 0);
-
-	x |= (x >> 1);
-	x |= (x >> 2);
-	x |= (x >> 4);
-	x |= (x >> 8);
-	x |= (x >> 16);
-#if (LG_SIZEOF_PTR == 3)
-	x |= (x >> 32);
-#endif
-	if (x == SIZE_T_MAX) {
-		return (8 << LG_SIZEOF_PTR) - 1;
-	}
-	x++;
-	return ffs_zu(x) - 2;
-}
-#endif
-
-#undef BIT_UTIL_INLINE
-
-#endif /* JEMALLOC_INTERNAL_BIT_UTIL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
deleted file mode 100644
index ac990290..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/bitmap.h
+++ /dev/null
@@ -1,369 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_BITMAP_H
-#define JEMALLOC_INTERNAL_BITMAP_H
-
-#include "jemalloc/internal/arena_types.h"
-#include "jemalloc/internal/bit_util.h"
-#include "jemalloc/internal/size_classes.h"
-
-typedef unsigned long bitmap_t;
-#define LG_SIZEOF_BITMAP	LG_SIZEOF_LONG
-
-/* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
-#if LG_SLAB_MAXREGS > LG_CEIL_NSIZES
-/* Maximum bitmap bit count is determined by maximum regions per slab. */
-#  define LG_BITMAP_MAXBITS	LG_SLAB_MAXREGS
-#else
-/* Maximum bitmap bit count is determined by number of extent size classes. */
-#  define LG_BITMAP_MAXBITS	LG_CEIL_NSIZES
-#endif
-#define BITMAP_MAXBITS		(ZU(1) << LG_BITMAP_MAXBITS)
-
-/* Number of bits per group. */
-#define LG_BITMAP_GROUP_NBITS		(LG_SIZEOF_BITMAP + 3)
-#define BITMAP_GROUP_NBITS		(1U << LG_BITMAP_GROUP_NBITS)
-#define BITMAP_GROUP_NBITS_MASK		(BITMAP_GROUP_NBITS-1)
-
-/*
- * Do some analysis on how big the bitmap is before we use a tree.  For a brute
- * force linear search, if we would have to call ffs_lu() more than 2^3 times,
- * use a tree instead.
- */
-#if LG_BITMAP_MAXBITS - LG_BITMAP_GROUP_NBITS > 3
-#  define BITMAP_USE_TREE
-#endif
-
-/* Number of groups required to store a given number of bits. */
-#define BITMAP_BITS2GROUPS(nbits)					\
-    (((nbits) + BITMAP_GROUP_NBITS_MASK) >> LG_BITMAP_GROUP_NBITS)
-
-/*
- * Number of groups required at a particular level for a given number of bits.
- */
-#define BITMAP_GROUPS_L0(nbits)						\
-    BITMAP_BITS2GROUPS(nbits)
-#define BITMAP_GROUPS_L1(nbits)						\
-    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(nbits))
-#define BITMAP_GROUPS_L2(nbits)						\
-    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS((nbits))))
-#define BITMAP_GROUPS_L3(nbits)						\
-    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(		\
-	BITMAP_BITS2GROUPS((nbits)))))
-#define BITMAP_GROUPS_L4(nbits)						\
-    BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(		\
-	BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS((nbits))))))
-
-/*
- * Assuming the number of levels, number of groups required for a given number
- * of bits.
- */
-#define BITMAP_GROUPS_1_LEVEL(nbits)					\
-    BITMAP_GROUPS_L0(nbits)
-#define BITMAP_GROUPS_2_LEVEL(nbits)					\
-    (BITMAP_GROUPS_1_LEVEL(nbits) + BITMAP_GROUPS_L1(nbits))
-#define BITMAP_GROUPS_3_LEVEL(nbits)					\
-    (BITMAP_GROUPS_2_LEVEL(nbits) + BITMAP_GROUPS_L2(nbits))
-#define BITMAP_GROUPS_4_LEVEL(nbits)					\
-    (BITMAP_GROUPS_3_LEVEL(nbits) + BITMAP_GROUPS_L3(nbits))
-#define BITMAP_GROUPS_5_LEVEL(nbits)					\
-    (BITMAP_GROUPS_4_LEVEL(nbits) + BITMAP_GROUPS_L4(nbits))
-
-/*
- * Maximum number of groups required to support LG_BITMAP_MAXBITS.
- */
-#ifdef BITMAP_USE_TREE
-
-#if LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS
-#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_1_LEVEL(nbits)
-#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_1_LEVEL(BITMAP_MAXBITS)
-#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 2
-#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_2_LEVEL(nbits)
-#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_2_LEVEL(BITMAP_MAXBITS)
-#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 3
-#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_3_LEVEL(nbits)
-#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_3_LEVEL(BITMAP_MAXBITS)
-#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 4
-#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_4_LEVEL(nbits)
-#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_4_LEVEL(BITMAP_MAXBITS)
-#elif LG_BITMAP_MAXBITS <= LG_BITMAP_GROUP_NBITS * 5
-#  define BITMAP_GROUPS(nbits)	BITMAP_GROUPS_5_LEVEL(nbits)
-#  define BITMAP_GROUPS_MAX	BITMAP_GROUPS_5_LEVEL(BITMAP_MAXBITS)
-#else
-#  error "Unsupported bitmap size"
-#endif
-
-/*
- * Maximum number of levels possible.  This could be statically computed based
- * on LG_BITMAP_MAXBITS:
- *
- * #define BITMAP_MAX_LEVELS \
- *     (LG_BITMAP_MAXBITS / LG_SIZEOF_BITMAP) \
- *     + !!(LG_BITMAP_MAXBITS % LG_SIZEOF_BITMAP)
- *
- * However, that would not allow the generic BITMAP_INFO_INITIALIZER() macro, so
- * instead hardcode BITMAP_MAX_LEVELS to the largest number supported by the
- * various cascading macros.  The only additional cost this incurs is some
- * unused trailing entries in bitmap_info_t structures; the bitmaps themselves
- * are not impacted.
- */
-#define BITMAP_MAX_LEVELS	5
-
-#define BITMAP_INFO_INITIALIZER(nbits) {				\
-	/* nbits. */							\
-	nbits,								\
-	/* nlevels. */							\
-	(BITMAP_GROUPS_L0(nbits) > BITMAP_GROUPS_L1(nbits)) +		\
-	    (BITMAP_GROUPS_L1(nbits) > BITMAP_GROUPS_L2(nbits)) +	\
-	    (BITMAP_GROUPS_L2(nbits) > BITMAP_GROUPS_L3(nbits)) +	\
-	    (BITMAP_GROUPS_L3(nbits) > BITMAP_GROUPS_L4(nbits)) + 1,	\
-	/* levels. */							\
-	{								\
-		{0},							\
-		{BITMAP_GROUPS_L0(nbits)},				\
-		{BITMAP_GROUPS_L1(nbits) + BITMAP_GROUPS_L0(nbits)},	\
-		{BITMAP_GROUPS_L2(nbits) + BITMAP_GROUPS_L1(nbits) +	\
-		    BITMAP_GROUPS_L0(nbits)},				\
-		{BITMAP_GROUPS_L3(nbits) + BITMAP_GROUPS_L2(nbits) +	\
-		    BITMAP_GROUPS_L1(nbits) + BITMAP_GROUPS_L0(nbits)},	\
-		{BITMAP_GROUPS_L4(nbits) + BITMAP_GROUPS_L3(nbits) +	\
-		     BITMAP_GROUPS_L2(nbits) + BITMAP_GROUPS_L1(nbits)	\
-		     + BITMAP_GROUPS_L0(nbits)}				\
-	}								\
-}
-
-#else /* BITMAP_USE_TREE */
-
-#define BITMAP_GROUPS(nbits)	BITMAP_BITS2GROUPS(nbits)
-#define BITMAP_GROUPS_MAX	BITMAP_BITS2GROUPS(BITMAP_MAXBITS)
-
-#define BITMAP_INFO_INITIALIZER(nbits) {				\
-	/* nbits. */							\
-	nbits,								\
-	/* ngroups. */							\
-	BITMAP_BITS2GROUPS(nbits)					\
-}
-
-#endif /* BITMAP_USE_TREE */
-
-typedef struct bitmap_level_s {
-	/* Offset of this level's groups within the array of groups. */
-	size_t group_offset;
-} bitmap_level_t;
-
-typedef struct bitmap_info_s {
-	/* Logical number of bits in bitmap (stored at bottom level). */
-	size_t nbits;
-
-#ifdef BITMAP_USE_TREE
-	/* Number of levels necessary for nbits. */
-	unsigned nlevels;
-
-	/*
-	 * Only the first (nlevels+1) elements are used, and levels are ordered
-	 * bottom to top (e.g. the bottom level is stored in levels[0]).
-	 */
-	bitmap_level_t levels[BITMAP_MAX_LEVELS+1];
-#else /* BITMAP_USE_TREE */
-	/* Number of groups necessary for nbits. */
-	size_t ngroups;
-#endif /* BITMAP_USE_TREE */
-} bitmap_info_t;
-
-void bitmap_info_init(bitmap_info_t *binfo, size_t nbits);
-void bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill);
-size_t bitmap_size(const bitmap_info_t *binfo);
-
-static inline bool
-bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo) {
-#ifdef BITMAP_USE_TREE
-	size_t rgoff = binfo->levels[binfo->nlevels].group_offset - 1;
-	bitmap_t rg = bitmap[rgoff];
-	/* The bitmap is full iff the root group is 0. */
-	return (rg == 0);
-#else
-	size_t i;
-
-	for (i = 0; i < binfo->ngroups; i++) {
-		if (bitmap[i] != 0) {
-			return false;
-		}
-	}
-	return true;
-#endif
-}
-
-static inline bool
-bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
-	size_t goff;
-	bitmap_t g;
-
-	assert(bit < binfo->nbits);
-	goff = bit >> LG_BITMAP_GROUP_NBITS;
-	g = bitmap[goff];
-	return !(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
-}
-
-static inline void
-bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
-	size_t goff;
-	bitmap_t *gp;
-	bitmap_t g;
-
-	assert(bit < binfo->nbits);
-	assert(!bitmap_get(bitmap, binfo, bit));
-	goff = bit >> LG_BITMAP_GROUP_NBITS;
-	gp = &bitmap[goff];
-	g = *gp;
-	assert(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
-	g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
-	*gp = g;
-	assert(bitmap_get(bitmap, binfo, bit));
-#ifdef BITMAP_USE_TREE
-	/* Propagate group state transitions up the tree. */
-	if (g == 0) {
-		unsigned i;
-		for (i = 1; i < binfo->nlevels; i++) {
-			bit = goff;
-			goff = bit >> LG_BITMAP_GROUP_NBITS;
-			gp = &bitmap[binfo->levels[i].group_offset + goff];
-			g = *gp;
-			assert(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)));
-			g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
-			*gp = g;
-			if (g != 0) {
-				break;
-			}
-		}
-	}
-#endif
-}
-
-/* ffu: find first unset >= bit. */
-static inline size_t
-bitmap_ffu(const bitmap_t *bitmap, const bitmap_info_t *binfo, size_t min_bit) {
-	assert(min_bit < binfo->nbits);
-
-#ifdef BITMAP_USE_TREE
-	size_t bit = 0;
-	for (unsigned level = binfo->nlevels; level--;) {
-		size_t lg_bits_per_group = (LG_BITMAP_GROUP_NBITS * (level +
-		    1));
-		bitmap_t group = bitmap[binfo->levels[level].group_offset + (bit
-		    >> lg_bits_per_group)];
-		unsigned group_nmask = (unsigned)(((min_bit > bit) ? (min_bit -
-		    bit) : 0) >> (lg_bits_per_group - LG_BITMAP_GROUP_NBITS));
-		assert(group_nmask <= BITMAP_GROUP_NBITS);
-		bitmap_t group_mask = ~((1LU << group_nmask) - 1);
-		bitmap_t group_masked = group & group_mask;
-		if (group_masked == 0LU) {
-			if (group == 0LU) {
-				return binfo->nbits;
-			}
-			/*
-			 * min_bit was preceded by one or more unset bits in
-			 * this group, but there are no other unset bits in this
-			 * group.  Try again starting at the first bit of the
-			 * next sibling.  This will recurse at most once per
-			 * non-root level.
-			 */
-			size_t sib_base = bit + (ZU(1) << lg_bits_per_group);
-			assert(sib_base > min_bit);
-			assert(sib_base > bit);
-			if (sib_base >= binfo->nbits) {
-				return binfo->nbits;
-			}
-			return bitmap_ffu(bitmap, binfo, sib_base);
-		}
-		bit += ((size_t)(ffs_lu(group_masked) - 1)) <<
-		    (lg_bits_per_group - LG_BITMAP_GROUP_NBITS);
-	}
-	assert(bit >= min_bit);
-	assert(bit < binfo->nbits);
-	return bit;
-#else
-	size_t i = min_bit >> LG_BITMAP_GROUP_NBITS;
-	bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
-	    - 1);
-	size_t bit;
-	do {
-		bit = ffs_lu(g);
-		if (bit != 0) {
-			return (i << LG_BITMAP_GROUP_NBITS) + (bit - 1);
-		}
-		i++;
-		g = bitmap[i];
-	} while (i < binfo->ngroups);
-	return binfo->nbits;
-#endif
-}
-
-/* sfu: set first unset. */
-static inline size_t
-bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo) {
-	size_t bit;
-	bitmap_t g;
-	unsigned i;
-
-	assert(!bitmap_full(bitmap, binfo));
-
-#ifdef BITMAP_USE_TREE
-	i = binfo->nlevels - 1;
-	g = bitmap[binfo->levels[i].group_offset];
-	bit = ffs_lu(g) - 1;
-	while (i > 0) {
-		i--;
-		g = bitmap[binfo->levels[i].group_offset + bit];
-		bit = (bit << LG_BITMAP_GROUP_NBITS) + (ffs_lu(g) - 1);
-	}
-#else
-	i = 0;
-	g = bitmap[0];
-	while ((bit = ffs_lu(g)) == 0) {
-		i++;
-		g = bitmap[i];
-	}
-	bit = (i << LG_BITMAP_GROUP_NBITS) + (bit - 1);
-#endif
-	bitmap_set(bitmap, binfo, bit);
-	return bit;
-}
-
-static inline void
-bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit) {
-	size_t goff;
-	bitmap_t *gp;
-	bitmap_t g;
-	UNUSED bool propagate;
-
-	assert(bit < binfo->nbits);
-	assert(bitmap_get(bitmap, binfo, bit));
-	goff = bit >> LG_BITMAP_GROUP_NBITS;
-	gp = &bitmap[goff];
-	g = *gp;
-	propagate = (g == 0);
-	assert((g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK))) == 0);
-	g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
-	*gp = g;
-	assert(!bitmap_get(bitmap, binfo, bit));
-#ifdef BITMAP_USE_TREE
-	/* Propagate group state transitions up the tree. */
-	if (propagate) {
-		unsigned i;
-		for (i = 1; i < binfo->nlevels; i++) {
-			bit = goff;
-			goff = bit >> LG_BITMAP_GROUP_NBITS;
-			gp = &bitmap[binfo->levels[i].group_offset + goff];
-			g = *gp;
-			propagate = (g == 0);
-			assert((g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK)))
-			    == 0);
-			g ^= ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK);
-			*gp = g;
-			if (!propagate) {
-				break;
-			}
-		}
-	}
-#endif /* BITMAP_USE_TREE */
-}
-
-#endif /* JEMALLOC_INTERNAL_BITMAP_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
deleted file mode 100644
index 12f3ef2d..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/cache_bin.h
+++ /dev/null
@@ -1,114 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_CACHE_BIN_H
-#define JEMALLOC_INTERNAL_CACHE_BIN_H
-
-#include "jemalloc/internal/ql.h"
-
-/*
- * The cache_bins are the mechanism that the tcache and the arena use to
- * communicate.  The tcache fills from and flushes to the arena by passing a
- * cache_bin_t to fill/flush.  When the arena needs to pull stats from the
- * tcaches associated with it, it does so by iterating over its
- * cache_bin_array_descriptor_t objects and reading out per-bin stats it
- * contains.  This makes it so that the arena need not know about the existence
- * of the tcache at all.
- */
-
-
-/*
- * The count of the number of cached allocations in a bin.  We make this signed
- * so that negative numbers can encode "invalid" states (e.g. a low water mark
- * of -1 for a cache that has been depleted).
- */
-typedef int32_t cache_bin_sz_t;
-
-typedef struct cache_bin_stats_s cache_bin_stats_t;
-struct cache_bin_stats_s {
-	/*
-	 * Number of allocation requests that corresponded to the size of this
-	 * bin.
-	 */
-	uint64_t nrequests;
-};
-
-/*
- * Read-only information associated with each element of tcache_t's tbins array
- * is stored separately, mainly to reduce memory usage.
- */
-typedef struct cache_bin_info_s cache_bin_info_t;
-struct cache_bin_info_s {
-	/* Upper limit on ncached. */
-	cache_bin_sz_t ncached_max;
-};
-
-typedef struct cache_bin_s cache_bin_t;
-struct cache_bin_s {
-	/* Min # cached since last GC. */
-	cache_bin_sz_t low_water;
-	/* # of cached objects. */
-	cache_bin_sz_t ncached;
-	/*
-	 * ncached and stats are both modified frequently.  Let's keep them
-	 * close so that they have a higher chance of being on the same
-	 * cacheline, thus less write-backs.
-	 */
-	cache_bin_stats_t tstats;
-	/*
-	 * Stack of available objects.
-	 *
-	 * To make use of adjacent cacheline prefetch, the items in the avail
-	 * stack goes to higher address for newer allocations.  avail points
-	 * just above the available space, which means that
-	 * avail[-ncached, ... -1] are available items and the lowest item will
-	 * be allocated first.
-	 */
-	void **avail;
-};
-
-typedef struct cache_bin_array_descriptor_s cache_bin_array_descriptor_t;
-struct cache_bin_array_descriptor_s {
-	/*
-	 * The arena keeps a list of the cache bins associated with it, for
-	 * stats collection.
-	 */
-	ql_elm(cache_bin_array_descriptor_t) link;
-	/* Pointers to the tcache bins. */
-	cache_bin_t *bins_small;
-	cache_bin_t *bins_large;
-};
-
-static inline void
-cache_bin_array_descriptor_init(cache_bin_array_descriptor_t *descriptor,
-    cache_bin_t *bins_small, cache_bin_t *bins_large) {
-	ql_elm_new(descriptor, link);
-	descriptor->bins_small = bins_small;
-	descriptor->bins_large = bins_large;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-cache_bin_alloc_easy(cache_bin_t *bin, bool *success) {
-	void *ret;
-
-	if (unlikely(bin->ncached == 0)) {
-		bin->low_water = -1;
-		*success = false;
-		return NULL;
-	}
-	/*
-	 * success (instead of ret) should be checked upon the return of this
-	 * function.  We avoid checking (ret == NULL) because there is never a
-	 * null stored on the avail stack (which is unknown to the compiler),
-	 * and eagerly checking ret would cause pipeline stall (waiting for the
-	 * cacheline).
-	 */
-	*success = true;
-	ret = *(bin->avail - bin->ncached);
-	bin->ncached--;
-
-	if (unlikely(bin->ncached < bin->low_water)) {
-		bin->low_water = bin->ncached;
-	}
-
-	return ret;
-}
-
-#endif /* JEMALLOC_INTERNAL_CACHE_BIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
deleted file mode 100644
index 7b3850bc..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/ckh.h
+++ /dev/null
@@ -1,101 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_CKH_H
-#define JEMALLOC_INTERNAL_CKH_H
-
-#include "jemalloc/internal/tsd.h"
-
-/* Cuckoo hashing implementation.  Skip to the end for the interface. */
-
-/******************************************************************************/
-/* INTERNAL DEFINITIONS -- IGNORE */
-/******************************************************************************/
-
-/* Maintain counters used to get an idea of performance. */
-/* #define CKH_COUNT */
-/* Print counter values in ckh_delete() (requires CKH_COUNT). */
-/* #define CKH_VERBOSE */
-
-/*
- * There are 2^LG_CKH_BUCKET_CELLS cells in each hash table bucket.  Try to fit
- * one bucket per L1 cache line.
- */
-#define LG_CKH_BUCKET_CELLS (LG_CACHELINE - LG_SIZEOF_PTR - 1)
-
-/* Typedefs to allow easy function pointer passing. */
-typedef void ckh_hash_t (const void *, size_t[2]);
-typedef bool ckh_keycomp_t (const void *, const void *);
-
-/* Hash table cell. */
-typedef struct {
-	const void *key;
-	const void *data;
-} ckhc_t;
-
-/* The hash table itself. */
-typedef struct {
-#ifdef CKH_COUNT
-	/* Counters used to get an idea of performance. */
-	uint64_t ngrows;
-	uint64_t nshrinks;
-	uint64_t nshrinkfails;
-	uint64_t ninserts;
-	uint64_t nrelocs;
-#endif
-
-	/* Used for pseudo-random number generation. */
-	uint64_t prng_state;
-
-	/* Total number of items. */
-	size_t count;
-
-	/*
-	 * Minimum and current number of hash table buckets.  There are
-	 * 2^LG_CKH_BUCKET_CELLS cells per bucket.
-	 */
-	unsigned lg_minbuckets;
-	unsigned lg_curbuckets;
-
-	/* Hash and comparison functions. */
-	ckh_hash_t *hash;
-	ckh_keycomp_t *keycomp;
-
-	/* Hash table with 2^lg_curbuckets buckets. */
-	ckhc_t *tab;
-} ckh_t;
-
-/******************************************************************************/
-/* BEGIN PUBLIC API */
-/******************************************************************************/
-
-/* Lifetime management.  Minitems is the initial capacity. */
-bool ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
-    ckh_keycomp_t *keycomp);
-void ckh_delete(tsd_t *tsd, ckh_t *ckh);
-
-/* Get the number of elements in the set. */
-size_t ckh_count(ckh_t *ckh);
-
-/*
- * To iterate over the elements in the table, initialize *tabind to 0 and call
- * this function until it returns true.  Each call that returns false will
- * update *key and *data to the next element in the table, assuming the pointers
- * are non-NULL.
- */
-bool ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data);
-
-/*
- * Basic hash table operations -- insert, removal, lookup.  For ckh_remove and
- * ckh_search, key or data can be NULL.  The hash-table only stores pointers to
- * the key and value, and doesn't do any lifetime management.
- */
-bool ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data);
-bool ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key,
-    void **data);
-bool ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data);
-
-/* Some useful hash and comparison functions for strings and pointers. */
-void ckh_string_hash(const void *key, size_t r_hash[2]);
-bool ckh_string_keycomp(const void *k1, const void *k2);
-void ckh_pointer_hash(const void *key, size_t r_hash[2]);
-bool ckh_pointer_keycomp(const void *k1, const void *k2);
-
-#endif /* JEMALLOC_INTERNAL_CKH_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
deleted file mode 100644
index d927d948..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/ctl.h
+++ /dev/null
@@ -1,131 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_CTL_H
-#define JEMALLOC_INTERNAL_CTL_H
-
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/mutex_prof.h"
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/stats.h"
-
-/* Maximum ctl tree depth. */
-#define CTL_MAX_DEPTH	7
-
-typedef struct ctl_node_s {
-	bool named;
-} ctl_node_t;
-
-typedef struct ctl_named_node_s {
-	ctl_node_t node;
-	const char *name;
-	/* If (nchildren == 0), this is a terminal node. */
-	size_t nchildren;
-	const ctl_node_t *children;
-	int (*ctl)(tsd_t *, const size_t *, size_t, void *, size_t *, void *,
-	    size_t);
-} ctl_named_node_t;
-
-typedef struct ctl_indexed_node_s {
-	struct ctl_node_s node;
-	const ctl_named_node_t *(*index)(tsdn_t *, const size_t *, size_t,
-	    size_t);
-} ctl_indexed_node_t;
-
-typedef struct ctl_arena_stats_s {
-	arena_stats_t astats;
-
-	/* Aggregate stats for small size classes, based on bin stats. */
-	size_t allocated_small;
-	uint64_t nmalloc_small;
-	uint64_t ndalloc_small;
-	uint64_t nrequests_small;
-
-	bin_stats_t bstats[NBINS];
-	arena_stats_large_t lstats[NSIZES - NBINS];
-} ctl_arena_stats_t;
-
-typedef struct ctl_stats_s {
-	size_t allocated;
-	size_t active;
-	size_t metadata;
-	size_t metadata_thp;
-	size_t resident;
-	size_t mapped;
-	size_t retained;
-
-	background_thread_stats_t background_thread;
-	mutex_prof_data_t mutex_prof_data[mutex_prof_num_global_mutexes];
-} ctl_stats_t;
-
-typedef struct ctl_arena_s ctl_arena_t;
-struct ctl_arena_s {
-	unsigned arena_ind;
-	bool initialized;
-	ql_elm(ctl_arena_t) destroyed_link;
-
-	/* Basic stats, supported even if !config_stats. */
-	unsigned nthreads;
-	const char *dss;
-	ssize_t dirty_decay_ms;
-	ssize_t muzzy_decay_ms;
-	size_t pactive;
-	size_t pdirty;
-	size_t pmuzzy;
-
-	/* NULL if !config_stats. */
-	ctl_arena_stats_t *astats;
-};
-
-typedef struct ctl_arenas_s {
-	uint64_t epoch;
-	unsigned narenas;
-	ql_head(ctl_arena_t) destroyed;
-
-	/*
-	 * Element 0 corresponds to merged stats for extant arenas (accessed via
-	 * MALLCTL_ARENAS_ALL), element 1 corresponds to merged stats for
-	 * destroyed arenas (accessed via MALLCTL_ARENAS_DESTROYED), and the
-	 * remaining MALLOCX_ARENA_LIMIT elements correspond to arenas.
-	 */
-	ctl_arena_t *arenas[2 + MALLOCX_ARENA_LIMIT];
-} ctl_arenas_t;
-
-int ctl_byname(tsd_t *tsd, const char *name, void *oldp, size_t *oldlenp,
-    void *newp, size_t newlen);
-int ctl_nametomib(tsd_t *tsd, const char *name, size_t *mibp, size_t *miblenp);
-
-int ctl_bymib(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen);
-bool ctl_boot(void);
-void ctl_prefork(tsdn_t *tsdn);
-void ctl_postfork_parent(tsdn_t *tsdn);
-void ctl_postfork_child(tsdn_t *tsdn);
-
-#define xmallctl(name, oldp, oldlenp, newp, newlen) do {		\
-	if (je_mallctl(name, oldp, oldlenp, newp, newlen)		\
-	    != 0) {							\
-		malloc_printf(						\
-		    "<jemalloc>: Failure in xmallctl(\"%s\", ...)\n",	\
-		    name);						\
-		abort();						\
-	}								\
-} while (0)
-
-#define xmallctlnametomib(name, mibp, miblenp) do {			\
-	if (je_mallctlnametomib(name, mibp, miblenp) != 0) {		\
-		malloc_printf("<jemalloc>: Failure in "			\
-		    "xmallctlnametomib(\"%s\", ...)\n", name);		\
-		abort();						\
-	}								\
-} while (0)
-
-#define xmallctlbymib(mib, miblen, oldp, oldlenp, newp, newlen) do {	\
-	if (je_mallctlbymib(mib, miblen, oldp, oldlenp, newp,		\
-	    newlen) != 0) {						\
-		malloc_write(						\
-		    "<jemalloc>: Failure in xmallctlbymib()\n");	\
-		abort();						\
-	}								\
-} while (0)
-
-#endif /* JEMALLOC_INTERNAL_CTL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
deleted file mode 100644
index aebae939..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/div.h
+++ /dev/null
@@ -1,41 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_DIV_H
-#define JEMALLOC_INTERNAL_DIV_H
-
-#include "jemalloc/internal/assert.h"
-
-/*
- * This module does the division that computes the index of a region in a slab,
- * given its offset relative to the base.
- * That is, given a divisor d, an n = i * d (all integers), we'll return i.
- * We do some pre-computation to do this more quickly than a CPU division
- * instruction.
- * We bound n < 2^32, and don't support dividing by one.
- */
-
-typedef struct div_info_s div_info_t;
-struct div_info_s {
-	uint32_t magic;
-#ifdef JEMALLOC_DEBUG
-	size_t d;
-#endif
-};
-
-void div_init(div_info_t *div_info, size_t divisor);
-
-static inline size_t
-div_compute(div_info_t *div_info, size_t n) {
-	assert(n <= (uint32_t)-1);
-	/*
-	 * This generates, e.g. mov; imul; shr on x86-64. On a 32-bit machine,
-	 * the compilers I tried were all smart enough to turn this into the
-	 * appropriate "get the high 32 bits of the result of a multiply" (e.g.
-	 * mul; mov edx eax; on x86, umull on arm, etc.).
-	 */
-	size_t i = ((uint64_t)n * (uint64_t)div_info->magic) >> 32;
-#ifdef JEMALLOC_DEBUG
-	assert(i * div_info->d == n);
-#endif
-	return i;
-}
-
-#endif /* JEMALLOC_INTERNAL_DIV_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
deleted file mode 100644
index 3a2b2f7f..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/emitter.h
+++ /dev/null
@@ -1,435 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EMITTER_H
-#define JEMALLOC_INTERNAL_EMITTER_H
-
-#include "jemalloc/internal/ql.h"
-
-typedef enum emitter_output_e emitter_output_t;
-enum emitter_output_e {
-	emitter_output_json,
-	emitter_output_table
-};
-
-typedef enum emitter_justify_e emitter_justify_t;
-enum emitter_justify_e {
-	emitter_justify_left,
-	emitter_justify_right,
-	/* Not for users; just to pass to internal functions. */
-	emitter_justify_none
-};
-
-typedef enum emitter_type_e emitter_type_t;
-enum emitter_type_e {
-	emitter_type_bool,
-	emitter_type_int,
-	emitter_type_unsigned,
-	emitter_type_uint32,
-	emitter_type_uint64,
-	emitter_type_size,
-	emitter_type_ssize,
-	emitter_type_string,
-	/*
-	 * A title is a column title in a table; it's just a string, but it's
-	 * not quoted.
-	 */
-	emitter_type_title,
-};
-
-typedef struct emitter_col_s emitter_col_t;
-struct emitter_col_s {
-	/* Filled in by the user. */
-	emitter_justify_t justify;
-	int width;
-	emitter_type_t type;
-	union {
-		bool bool_val;
-		int int_val;
-		unsigned unsigned_val;
-		uint32_t uint32_val;
-		uint64_t uint64_val;
-		size_t size_val;
-		ssize_t ssize_val;
-		const char *str_val;
-	};
-
-	/* Filled in by initialization. */
-	ql_elm(emitter_col_t) link;
-};
-
-typedef struct emitter_row_s emitter_row_t;
-struct emitter_row_s {
-	ql_head(emitter_col_t) cols;
-};
-
-static inline void
-emitter_row_init(emitter_row_t *row) {
-	ql_new(&row->cols);
-}
-
-static inline void
-emitter_col_init(emitter_col_t *col, emitter_row_t *row) {
-	ql_elm_new(col, link);
-	ql_tail_insert(&row->cols, col, link);
-}
-
-typedef struct emitter_s emitter_t;
-struct emitter_s {
-	emitter_output_t output;
-	/* The output information. */
-	void (*write_cb)(void *, const char *);
-	void *cbopaque;
-	int nesting_depth;
-	/* True if we've already emitted a value at the given depth. */
-	bool item_at_depth;
-};
-
-static inline void
-emitter_init(emitter_t *emitter, emitter_output_t emitter_output,
-    void (*write_cb)(void *, const char *), void *cbopaque) {
-	emitter->output = emitter_output;
-	emitter->write_cb = write_cb;
-	emitter->cbopaque = cbopaque;
-	emitter->item_at_depth = false;
-	emitter->nesting_depth = 0;
-}
-
-/* Internal convenience function.  Write to the emitter the given string. */
-JEMALLOC_FORMAT_PRINTF(2, 3)
-static inline void
-emitter_printf(emitter_t *emitter, const char *format, ...) {
-	va_list ap;
-
-	va_start(ap, format);
-	malloc_vcprintf(emitter->write_cb, emitter->cbopaque, format, ap);
-	va_end(ap);
-}
-
-/* Write to the emitter the given string, but only in table mode. */
-JEMALLOC_FORMAT_PRINTF(2, 3)
-static inline void
-emitter_table_printf(emitter_t *emitter, const char *format, ...) {
-	if (emitter->output == emitter_output_table) {
-		va_list ap;
-		va_start(ap, format);
-		malloc_vcprintf(emitter->write_cb, emitter->cbopaque, format, ap);
-		va_end(ap);
-	}
-}
-
-static inline void
-emitter_gen_fmt(char *out_fmt, size_t out_size, const char *fmt_specifier,
-    emitter_justify_t justify, int width) {
-	size_t written;
-	if (justify == emitter_justify_none) {
-		written = malloc_snprintf(out_fmt, out_size,
-		    "%%%s", fmt_specifier);
-	} else if (justify == emitter_justify_left) {
-		written = malloc_snprintf(out_fmt, out_size,
-		    "%%-%d%s", width, fmt_specifier);
-	} else {
-		written = malloc_snprintf(out_fmt, out_size,
-		    "%%%d%s", width, fmt_specifier);
-	}
-	/* Only happens in case of bad format string, which *we* choose. */
-	assert(written <  out_size);
-}
-
-/*
- * Internal.  Emit the given value type in the relevant encoding (so that the
- * bool true gets mapped to json "true", but the string "true" gets mapped to
- * json "\"true\"", for instance.
- *
- * Width is ignored if justify is emitter_justify_none.
- */
-static inline void
-emitter_print_value(emitter_t *emitter, emitter_justify_t justify, int width,
-    emitter_type_t value_type, const void *value) {
-	size_t str_written;
-#define BUF_SIZE 256
-#define FMT_SIZE 10
-	/*
-	 * We dynamically generate a format string to emit, to let us use the
-	 * snprintf machinery.  This is kinda hacky, but gets the job done
-	 * quickly without having to think about the various snprintf edge
-	 * cases.
-	 */
-	char fmt[FMT_SIZE];
-	char buf[BUF_SIZE];
-
-#define EMIT_SIMPLE(type, format)					\
-	emitter_gen_fmt(fmt, FMT_SIZE, format, justify, width);		\
-	emitter_printf(emitter, fmt, *(const type *)value);		\
-
-	switch (value_type) {
-	case emitter_type_bool:
-		emitter_gen_fmt(fmt, FMT_SIZE, "s", justify, width);
-		emitter_printf(emitter, fmt, *(const bool *)value ?
-		    "true" : "false");
-		break;
-	case emitter_type_int:
-		EMIT_SIMPLE(int, "d")
-		break;
-	case emitter_type_unsigned:
-		EMIT_SIMPLE(unsigned, "u")
-		break;
-	case emitter_type_ssize:
-		EMIT_SIMPLE(ssize_t, "zd")
-		break;
-	case emitter_type_size:
-		EMIT_SIMPLE(size_t, "zu")
-		break;
-	case emitter_type_string:
-		str_written = malloc_snprintf(buf, BUF_SIZE, "\"%s\"",
-		    *(const char *const *)value);
-		/*
-		 * We control the strings we output; we shouldn't get anything
-		 * anywhere near the fmt size.
-		 */
-		assert(str_written < BUF_SIZE);
-		emitter_gen_fmt(fmt, FMT_SIZE, "s", justify, width);
-		emitter_printf(emitter, fmt, buf);
-		break;
-	case emitter_type_uint32:
-		EMIT_SIMPLE(uint32_t, FMTu32)
-		break;
-	case emitter_type_uint64:
-		EMIT_SIMPLE(uint64_t, FMTu64)
-		break;
-	case emitter_type_title:
-		EMIT_SIMPLE(char *const, "s");
-		break;
-	default:
-		unreachable();
-	}
-#undef BUF_SIZE
-#undef FMT_SIZE
-}
-
-
-/* Internal functions.  In json mode, tracks nesting state. */
-static inline void
-emitter_nest_inc(emitter_t *emitter) {
-	emitter->nesting_depth++;
-	emitter->item_at_depth = false;
-}
-
-static inline void
-emitter_nest_dec(emitter_t *emitter) {
-	emitter->nesting_depth--;
-	emitter->item_at_depth = true;
-}
-
-static inline void
-emitter_indent(emitter_t *emitter) {
-	int amount = emitter->nesting_depth;
-	const char *indent_str;
-	if (emitter->output == emitter_output_json) {
-		indent_str = "\t";
-	} else {
-		amount *= 2;
-		indent_str = " ";
-	}
-	for (int i = 0; i < amount; i++) {
-		emitter_printf(emitter, "%s", indent_str);
-	}
-}
-
-static inline void
-emitter_json_key_prefix(emitter_t *emitter) {
-	emitter_printf(emitter, "%s\n", emitter->item_at_depth ? "," : "");
-	emitter_indent(emitter);
-}
-
-static inline void
-emitter_begin(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth == 0);
-		emitter_printf(emitter, "{");
-		emitter_nest_inc(emitter);
-	} else {
-		// tabular init
-		emitter_printf(emitter, "%s", "");
-	}
-}
-
-static inline void
-emitter_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth == 1);
-		emitter_nest_dec(emitter);
-		emitter_printf(emitter, "\n}\n");
-	}
-}
-
-/*
- * Note emits a different kv pair as well, but only in table mode.  Omits the
- * note if table_note_key is NULL.
- */
-static inline void
-emitter_kv_note(emitter_t *emitter, const char *json_key, const char *table_key,
-    emitter_type_t value_type, const void *value,
-    const char *table_note_key, emitter_type_t table_note_value_type,
-    const void *table_note_value) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth > 0);
-		emitter_json_key_prefix(emitter);
-		emitter_printf(emitter, "\"%s\": ", json_key);
-		emitter_print_value(emitter, emitter_justify_none, -1,
-		    value_type, value);
-	} else {
-		emitter_indent(emitter);
-		emitter_printf(emitter, "%s: ", table_key);
-		emitter_print_value(emitter, emitter_justify_none, -1,
-		    value_type, value);
-		if (table_note_key != NULL) {
-			emitter_printf(emitter, " (%s: ", table_note_key);
-			emitter_print_value(emitter, emitter_justify_none, -1,
-			    table_note_value_type, table_note_value);
-			emitter_printf(emitter, ")");
-		}
-		emitter_printf(emitter, "\n");
-	}
-	emitter->item_at_depth = true;
-}
-
-static inline void
-emitter_kv(emitter_t *emitter, const char *json_key, const char *table_key,
-    emitter_type_t value_type, const void *value) {
-	emitter_kv_note(emitter, json_key, table_key, value_type, value, NULL,
-	    emitter_type_bool, NULL);
-}
-
-static inline void
-emitter_json_kv(emitter_t *emitter, const char *json_key,
-    emitter_type_t value_type, const void *value) {
-	if (emitter->output == emitter_output_json) {
-		emitter_kv(emitter, json_key, NULL, value_type, value);
-	}
-}
-
-static inline void
-emitter_table_kv(emitter_t *emitter, const char *table_key,
-    emitter_type_t value_type, const void *value) {
-	if (emitter->output == emitter_output_table) {
-		emitter_kv(emitter, NULL, table_key, value_type, value);
-	}
-}
-
-static inline void
-emitter_dict_begin(emitter_t *emitter, const char *json_key,
-    const char *table_header) {
-	if (emitter->output == emitter_output_json) {
-		emitter_json_key_prefix(emitter);
-		emitter_printf(emitter, "\"%s\": {", json_key);
-		emitter_nest_inc(emitter);
-	} else {
-		emitter_indent(emitter);
-		emitter_printf(emitter, "%s\n", table_header);
-		emitter_nest_inc(emitter);
-	}
-}
-
-static inline void
-emitter_dict_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth > 0);
-		emitter_nest_dec(emitter);
-		emitter_printf(emitter, "\n");
-		emitter_indent(emitter);
-		emitter_printf(emitter, "}");
-	} else {
-		emitter_nest_dec(emitter);
-	}
-}
-
-static inline void
-emitter_json_dict_begin(emitter_t *emitter, const char *json_key) {
-	if (emitter->output == emitter_output_json) {
-		emitter_dict_begin(emitter, json_key, NULL);
-	}
-}
-
-static inline void
-emitter_json_dict_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		emitter_dict_end(emitter);
-	}
-}
-
-static inline void
-emitter_table_dict_begin(emitter_t *emitter, const char *table_key) {
-	if (emitter->output == emitter_output_table) {
-		emitter_dict_begin(emitter, NULL, table_key);
-	}
-}
-
-static inline void
-emitter_table_dict_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_table) {
-		emitter_dict_end(emitter);
-	}
-}
-
-static inline void
-emitter_json_arr_begin(emitter_t *emitter, const char *json_key) {
-	if (emitter->output == emitter_output_json) {
-		emitter_json_key_prefix(emitter);
-		emitter_printf(emitter, "\"%s\": [", json_key);
-		emitter_nest_inc(emitter);
-	}
-}
-
-static inline void
-emitter_json_arr_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth > 0);
-		emitter_nest_dec(emitter);
-		emitter_printf(emitter, "\n");
-		emitter_indent(emitter);
-		emitter_printf(emitter, "]");
-	}
-}
-
-static inline void
-emitter_json_arr_obj_begin(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		emitter_json_key_prefix(emitter);
-		emitter_printf(emitter, "{");
-		emitter_nest_inc(emitter);
-	}
-}
-
-static inline void
-emitter_json_arr_obj_end(emitter_t *emitter) {
-	if (emitter->output == emitter_output_json) {
-		assert(emitter->nesting_depth > 0);
-		emitter_nest_dec(emitter);
-		emitter_printf(emitter, "\n");
-		emitter_indent(emitter);
-		emitter_printf(emitter, "}");
-	}
-}
-
-static inline void
-emitter_json_arr_value(emitter_t *emitter, emitter_type_t value_type,
-    const void *value) {
-	if (emitter->output == emitter_output_json) {
-		emitter_json_key_prefix(emitter);
-		emitter_print_value(emitter, emitter_justify_none, -1,
-		    value_type, value);
-	}
-}
-
-static inline void
-emitter_table_row(emitter_t *emitter, emitter_row_t *row) {
-	if (emitter->output != emitter_output_table) {
-		return;
-	}
-	emitter_col_t *col;
-	ql_foreach(col, &row->cols, link) {
-		emitter_print_value(emitter, col->justify, col->width,
-		    col->type, (const void *)&col->bool_val);
-	}
-	emitter_table_printf(emitter, "\n");
-}
-
-#endif /* JEMALLOC_INTERNAL_EMITTER_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
deleted file mode 100644
index e8f02ce2..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_dss.h
+++ /dev/null
@@ -1,26 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_DSS_H
-#define JEMALLOC_INTERNAL_EXTENT_DSS_H
-
-typedef enum {
-	dss_prec_disabled  = 0,
-	dss_prec_primary   = 1,
-	dss_prec_secondary = 2,
-
-	dss_prec_limit     = 3
-} dss_prec_t;
-#define DSS_PREC_DEFAULT dss_prec_secondary
-#define DSS_DEFAULT "secondary"
-
-extern const char *dss_prec_names[];
-
-extern const char *opt_dss;
-
-dss_prec_t extent_dss_prec_get(void);
-bool extent_dss_prec_set(dss_prec_t dss_prec);
-void *extent_alloc_dss(tsdn_t *tsdn, arena_t *arena, void *new_addr,
-    size_t size, size_t alignment, bool *zero, bool *commit);
-bool extent_in_dss(void *addr);
-bool extent_dss_mergeable(void *addr_a, void *addr_b);
-void extent_dss_boot(void);
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_DSS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
deleted file mode 100644
index b8a4d026..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_externs.h
+++ /dev/null
@@ -1,73 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_EXTERNS_H
-#define JEMALLOC_INTERNAL_EXTENT_EXTERNS_H
-
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_pool.h"
-#include "jemalloc/internal/ph.h"
-#include "jemalloc/internal/rtree.h"
-
-extern size_t opt_lg_extent_max_active_fit;
-
-extern rtree_t extents_rtree;
-extern const extent_hooks_t extent_hooks_default;
-extern mutex_pool_t extent_mutex_pool;
-
-extent_t *extent_alloc(tsdn_t *tsdn, arena_t *arena);
-void extent_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent);
-
-extent_hooks_t *extent_hooks_get(arena_t *arena);
-extent_hooks_t *extent_hooks_set(tsd_t *tsd, arena_t *arena,
-    extent_hooks_t *extent_hooks);
-
-#ifdef JEMALLOC_JET
-size_t extent_size_quantize_floor(size_t size);
-size_t extent_size_quantize_ceil(size_t size);
-#endif
-
-rb_proto(, extent_avail_, extent_tree_t, extent_t)
-ph_proto(, extent_heap_, extent_heap_t, extent_t)
-
-bool extents_init(tsdn_t *tsdn, extents_t *extents, extent_state_t state,
-    bool delay_coalesce);
-extent_state_t extents_state_get(const extents_t *extents);
-size_t extents_npages_get(extents_t *extents);
-extent_t *extents_alloc(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, void *new_addr,
-    size_t size, size_t pad, size_t alignment, bool slab, szind_t szind,
-    bool *zero, bool *commit);
-void extents_dalloc(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, extent_t *extent);
-extent_t *extents_evict(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, size_t npages_min);
-void extents_prefork(tsdn_t *tsdn, extents_t *extents);
-void extents_postfork_parent(tsdn_t *tsdn, extents_t *extents);
-void extents_postfork_child(tsdn_t *tsdn, extents_t *extents);
-extent_t *extent_alloc_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit);
-void extent_dalloc_gap(tsdn_t *tsdn, arena_t *arena, extent_t *extent);
-void extent_dalloc_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent);
-void extent_destroy_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent);
-bool extent_commit_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length);
-bool extent_decommit_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length);
-bool extent_purge_lazy_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length);
-bool extent_purge_forced_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length);
-extent_t *extent_split_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
-    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b);
-bool extent_merge_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b);
-
-bool extent_boot(void);
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
deleted file mode 100644
index 77181df8..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_inlines.h
+++ /dev/null
@@ -1,433 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_INLINES_H
-#define JEMALLOC_INTERNAL_EXTENT_INLINES_H
-
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_pool.h"
-#include "jemalloc/internal/pages.h"
-#include "jemalloc/internal/prng.h"
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/sz.h"
-
-static inline void
-extent_lock(tsdn_t *tsdn, extent_t *extent) {
-	assert(extent != NULL);
-	mutex_pool_lock(tsdn, &extent_mutex_pool, (uintptr_t)extent);
-}
-
-static inline void
-extent_unlock(tsdn_t *tsdn, extent_t *extent) {
-	assert(extent != NULL);
-	mutex_pool_unlock(tsdn, &extent_mutex_pool, (uintptr_t)extent);
-}
-
-static inline void
-extent_lock2(tsdn_t *tsdn, extent_t *extent1, extent_t *extent2) {
-	assert(extent1 != NULL && extent2 != NULL);
-	mutex_pool_lock2(tsdn, &extent_mutex_pool, (uintptr_t)extent1,
-	    (uintptr_t)extent2);
-}
-
-static inline void
-extent_unlock2(tsdn_t *tsdn, extent_t *extent1, extent_t *extent2) {
-	assert(extent1 != NULL && extent2 != NULL);
-	mutex_pool_unlock2(tsdn, &extent_mutex_pool, (uintptr_t)extent1,
-	    (uintptr_t)extent2);
-}
-
-static inline arena_t *
-extent_arena_get(const extent_t *extent) {
-	unsigned arena_ind = (unsigned)((extent->e_bits &
-	    EXTENT_BITS_ARENA_MASK) >> EXTENT_BITS_ARENA_SHIFT);
-	/*
-	 * The following check is omitted because we should never actually read
-	 * a NULL arena pointer.
-	 */
-	if (false && arena_ind >= MALLOCX_ARENA_LIMIT) {
-		return NULL;
-	}
-	assert(arena_ind < MALLOCX_ARENA_LIMIT);
-	return (arena_t *)atomic_load_p(&arenas[arena_ind], ATOMIC_ACQUIRE);
-}
-
-static inline szind_t
-extent_szind_get_maybe_invalid(const extent_t *extent) {
-	szind_t szind = (szind_t)((extent->e_bits & EXTENT_BITS_SZIND_MASK) >>
-	    EXTENT_BITS_SZIND_SHIFT);
-	assert(szind <= NSIZES);
-	return szind;
-}
-
-static inline szind_t
-extent_szind_get(const extent_t *extent) {
-	szind_t szind = extent_szind_get_maybe_invalid(extent);
-	assert(szind < NSIZES); /* Never call when "invalid". */
-	return szind;
-}
-
-static inline size_t
-extent_usize_get(const extent_t *extent) {
-	return sz_index2size(extent_szind_get(extent));
-}
-
-static inline size_t
-extent_sn_get(const extent_t *extent) {
-	return (size_t)((extent->e_bits & EXTENT_BITS_SN_MASK) >>
-	    EXTENT_BITS_SN_SHIFT);
-}
-
-static inline extent_state_t
-extent_state_get(const extent_t *extent) {
-	return (extent_state_t)((extent->e_bits & EXTENT_BITS_STATE_MASK) >>
-	    EXTENT_BITS_STATE_SHIFT);
-}
-
-static inline bool
-extent_zeroed_get(const extent_t *extent) {
-	return (bool)((extent->e_bits & EXTENT_BITS_ZEROED_MASK) >>
-	    EXTENT_BITS_ZEROED_SHIFT);
-}
-
-static inline bool
-extent_committed_get(const extent_t *extent) {
-	return (bool)((extent->e_bits & EXTENT_BITS_COMMITTED_MASK) >>
-	    EXTENT_BITS_COMMITTED_SHIFT);
-}
-
-static inline bool
-extent_dumpable_get(const extent_t *extent) {
-	return (bool)((extent->e_bits & EXTENT_BITS_DUMPABLE_MASK) >>
-	    EXTENT_BITS_DUMPABLE_SHIFT);
-}
-
-static inline bool
-extent_slab_get(const extent_t *extent) {
-	return (bool)((extent->e_bits & EXTENT_BITS_SLAB_MASK) >>
-	    EXTENT_BITS_SLAB_SHIFT);
-}
-
-static inline unsigned
-extent_nfree_get(const extent_t *extent) {
-	assert(extent_slab_get(extent));
-	return (unsigned)((extent->e_bits & EXTENT_BITS_NFREE_MASK) >>
-	    EXTENT_BITS_NFREE_SHIFT);
-}
-
-static inline void *
-extent_base_get(const extent_t *extent) {
-	assert(extent->e_addr == PAGE_ADDR2BASE(extent->e_addr) ||
-	    !extent_slab_get(extent));
-	return PAGE_ADDR2BASE(extent->e_addr);
-}
-
-static inline void *
-extent_addr_get(const extent_t *extent) {
-	assert(extent->e_addr == PAGE_ADDR2BASE(extent->e_addr) ||
-	    !extent_slab_get(extent));
-	return extent->e_addr;
-}
-
-static inline size_t
-extent_size_get(const extent_t *extent) {
-	return (extent->e_size_esn & EXTENT_SIZE_MASK);
-}
-
-static inline size_t
-extent_esn_get(const extent_t *extent) {
-	return (extent->e_size_esn & EXTENT_ESN_MASK);
-}
-
-static inline size_t
-extent_bsize_get(const extent_t *extent) {
-	return extent->e_bsize;
-}
-
-static inline void *
-extent_before_get(const extent_t *extent) {
-	return (void *)((uintptr_t)extent_base_get(extent) - PAGE);
-}
-
-static inline void *
-extent_last_get(const extent_t *extent) {
-	return (void *)((uintptr_t)extent_base_get(extent) +
-	    extent_size_get(extent) - PAGE);
-}
-
-static inline void *
-extent_past_get(const extent_t *extent) {
-	return (void *)((uintptr_t)extent_base_get(extent) +
-	    extent_size_get(extent));
-}
-
-static inline arena_slab_data_t *
-extent_slab_data_get(extent_t *extent) {
-	assert(extent_slab_get(extent));
-	return &extent->e_slab_data;
-}
-
-static inline const arena_slab_data_t *
-extent_slab_data_get_const(const extent_t *extent) {
-	assert(extent_slab_get(extent));
-	return &extent->e_slab_data;
-}
-
-static inline prof_tctx_t *
-extent_prof_tctx_get(const extent_t *extent) {
-	return (prof_tctx_t *)atomic_load_p(&extent->e_prof_tctx,
-	    ATOMIC_ACQUIRE);
-}
-
-static inline void
-extent_arena_set(extent_t *extent, arena_t *arena) {
-	unsigned arena_ind = (arena != NULL) ? arena_ind_get(arena) : ((1U <<
-	    MALLOCX_ARENA_BITS) - 1);
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_ARENA_MASK) |
-	    ((uint64_t)arena_ind << EXTENT_BITS_ARENA_SHIFT);
-}
-
-static inline void
-extent_addr_set(extent_t *extent, void *addr) {
-	extent->e_addr = addr;
-}
-
-static inline void
-extent_addr_randomize(UNUSED tsdn_t *tsdn, extent_t *extent, size_t alignment) {
-	assert(extent_base_get(extent) == extent_addr_get(extent));
-
-	if (alignment < PAGE) {
-		unsigned lg_range = LG_PAGE -
-		    lg_floor(CACHELINE_CEILING(alignment));
-		size_t r;
-		if (!tsdn_null(tsdn)) {
-			tsd_t *tsd = tsdn_tsd(tsdn);
-			r = (size_t)prng_lg_range_u64(
-			    tsd_offset_statep_get(tsd), lg_range);
-		} else {
-			r = prng_lg_range_zu(
-			    &extent_arena_get(extent)->offset_state,
-			    lg_range, true);
-		}
-		uintptr_t random_offset = ((uintptr_t)r) << (LG_PAGE -
-		    lg_range);
-		extent->e_addr = (void *)((uintptr_t)extent->e_addr +
-		    random_offset);
-		assert(ALIGNMENT_ADDR2BASE(extent->e_addr, alignment) ==
-		    extent->e_addr);
-	}
-}
-
-static inline void
-extent_size_set(extent_t *extent, size_t size) {
-	assert((size & ~EXTENT_SIZE_MASK) == 0);
-	extent->e_size_esn = size | (extent->e_size_esn & ~EXTENT_SIZE_MASK);
-}
-
-static inline void
-extent_esn_set(extent_t *extent, size_t esn) {
-	extent->e_size_esn = (extent->e_size_esn & ~EXTENT_ESN_MASK) | (esn &
-	    EXTENT_ESN_MASK);
-}
-
-static inline void
-extent_bsize_set(extent_t *extent, size_t bsize) {
-	extent->e_bsize = bsize;
-}
-
-static inline void
-extent_szind_set(extent_t *extent, szind_t szind) {
-	assert(szind <= NSIZES); /* NSIZES means "invalid". */
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SZIND_MASK) |
-	    ((uint64_t)szind << EXTENT_BITS_SZIND_SHIFT);
-}
-
-static inline void
-extent_nfree_set(extent_t *extent, unsigned nfree) {
-	assert(extent_slab_get(extent));
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_NFREE_MASK) |
-	    ((uint64_t)nfree << EXTENT_BITS_NFREE_SHIFT);
-}
-
-static inline void
-extent_nfree_inc(extent_t *extent) {
-	assert(extent_slab_get(extent));
-	extent->e_bits += ((uint64_t)1U << EXTENT_BITS_NFREE_SHIFT);
-}
-
-static inline void
-extent_nfree_dec(extent_t *extent) {
-	assert(extent_slab_get(extent));
-	extent->e_bits -= ((uint64_t)1U << EXTENT_BITS_NFREE_SHIFT);
-}
-
-static inline void
-extent_sn_set(extent_t *extent, size_t sn) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SN_MASK) |
-	    ((uint64_t)sn << EXTENT_BITS_SN_SHIFT);
-}
-
-static inline void
-extent_state_set(extent_t *extent, extent_state_t state) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_STATE_MASK) |
-	    ((uint64_t)state << EXTENT_BITS_STATE_SHIFT);
-}
-
-static inline void
-extent_zeroed_set(extent_t *extent, bool zeroed) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_ZEROED_MASK) |
-	    ((uint64_t)zeroed << EXTENT_BITS_ZEROED_SHIFT);
-}
-
-static inline void
-extent_committed_set(extent_t *extent, bool committed) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_COMMITTED_MASK) |
-	    ((uint64_t)committed << EXTENT_BITS_COMMITTED_SHIFT);
-}
-
-static inline void
-extent_dumpable_set(extent_t *extent, bool dumpable) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_DUMPABLE_MASK) |
-	    ((uint64_t)dumpable << EXTENT_BITS_DUMPABLE_SHIFT);
-}
-
-static inline void
-extent_slab_set(extent_t *extent, bool slab) {
-	extent->e_bits = (extent->e_bits & ~EXTENT_BITS_SLAB_MASK) |
-	    ((uint64_t)slab << EXTENT_BITS_SLAB_SHIFT);
-}
-
-static inline void
-extent_prof_tctx_set(extent_t *extent, prof_tctx_t *tctx) {
-	atomic_store_p(&extent->e_prof_tctx, tctx, ATOMIC_RELEASE);
-}
-
-static inline void
-extent_init(extent_t *extent, arena_t *arena, void *addr, size_t size,
-    bool slab, szind_t szind, size_t sn, extent_state_t state, bool zeroed,
-    bool committed, bool dumpable) {
-	assert(addr == PAGE_ADDR2BASE(addr) || !slab);
-
-	extent_arena_set(extent, arena);
-	extent_addr_set(extent, addr);
-	extent_size_set(extent, size);
-	extent_slab_set(extent, slab);
-	extent_szind_set(extent, szind);
-	extent_sn_set(extent, sn);
-	extent_state_set(extent, state);
-	extent_zeroed_set(extent, zeroed);
-	extent_committed_set(extent, committed);
-	extent_dumpable_set(extent, dumpable);
-	ql_elm_new(extent, ql_link);
-	if (config_prof) {
-		extent_prof_tctx_set(extent, NULL);
-	}
-}
-
-static inline void
-extent_binit(extent_t *extent, void *addr, size_t bsize, size_t sn) {
-	extent_arena_set(extent, NULL);
-	extent_addr_set(extent, addr);
-	extent_bsize_set(extent, bsize);
-	extent_slab_set(extent, false);
-	extent_szind_set(extent, NSIZES);
-	extent_sn_set(extent, sn);
-	extent_state_set(extent, extent_state_active);
-	extent_zeroed_set(extent, true);
-	extent_committed_set(extent, true);
-	extent_dumpable_set(extent, true);
-}
-
-static inline void
-extent_list_init(extent_list_t *list) {
-	ql_new(list);
-}
-
-static inline extent_t *
-extent_list_first(const extent_list_t *list) {
-	return ql_first(list);
-}
-
-static inline extent_t *
-extent_list_last(const extent_list_t *list) {
-	return ql_last(list, ql_link);
-}
-
-static inline void
-extent_list_append(extent_list_t *list, extent_t *extent) {
-	ql_tail_insert(list, extent, ql_link);
-}
-
-static inline void
-extent_list_prepend(extent_list_t *list, extent_t *extent) {
-	ql_head_insert(list, extent, ql_link);
-}
-
-static inline void
-extent_list_replace(extent_list_t *list, extent_t *to_remove,
-    extent_t *to_insert) {
-	ql_after_insert(to_remove, to_insert, ql_link);
-	ql_remove(list, to_remove, ql_link);
-}
-
-static inline void
-extent_list_remove(extent_list_t *list, extent_t *extent) {
-	ql_remove(list, extent, ql_link);
-}
-
-static inline int
-extent_sn_comp(const extent_t *a, const extent_t *b) {
-	size_t a_sn = extent_sn_get(a);
-	size_t b_sn = extent_sn_get(b);
-
-	return (a_sn > b_sn) - (a_sn < b_sn);
-}
-
-static inline int
-extent_esn_comp(const extent_t *a, const extent_t *b) {
-	size_t a_esn = extent_esn_get(a);
-	size_t b_esn = extent_esn_get(b);
-
-	return (a_esn > b_esn) - (a_esn < b_esn);
-}
-
-static inline int
-extent_ad_comp(const extent_t *a, const extent_t *b) {
-	uintptr_t a_addr = (uintptr_t)extent_addr_get(a);
-	uintptr_t b_addr = (uintptr_t)extent_addr_get(b);
-
-	return (a_addr > b_addr) - (a_addr < b_addr);
-}
-
-static inline int
-extent_ead_comp(const extent_t *a, const extent_t *b) {
-	uintptr_t a_eaddr = (uintptr_t)a;
-	uintptr_t b_eaddr = (uintptr_t)b;
-
-	return (a_eaddr > b_eaddr) - (a_eaddr < b_eaddr);
-}
-
-static inline int
-extent_snad_comp(const extent_t *a, const extent_t *b) {
-	int ret;
-
-	ret = extent_sn_comp(a, b);
-	if (ret != 0) {
-		return ret;
-	}
-
-	ret = extent_ad_comp(a, b);
-	return ret;
-}
-
-static inline int
-extent_esnead_comp(const extent_t *a, const extent_t *b) {
-	int ret;
-
-	ret = extent_esn_comp(a, b);
-	if (ret != 0) {
-		return ret;
-	}
-
-	ret = extent_ead_comp(a, b);
-	return ret;
-}
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
deleted file mode 100644
index 55f17ee4..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_mmap.h
+++ /dev/null
@@ -1,10 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H
-#define JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H
-
-extern bool opt_retain;
-
-void *extent_alloc_mmap(void *new_addr, size_t size, size_t alignment,
-    bool *zero, bool *commit);
-bool extent_dalloc_mmap(void *addr, size_t size);
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_MMAP_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
deleted file mode 100644
index 4873b9e9..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_structs.h
+++ /dev/null
@@ -1,219 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_STRUCTS_H
-#define JEMALLOC_INTERNAL_EXTENT_STRUCTS_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/bitmap.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/ph.h"
-#include "jemalloc/internal/size_classes.h"
-
-typedef enum {
-	extent_state_active   = 0,
-	extent_state_dirty    = 1,
-	extent_state_muzzy    = 2,
-	extent_state_retained = 3
-} extent_state_t;
-
-/* Extent (span of pages).  Use accessor functions for e_* fields. */
-struct extent_s {
-	/*
-	 * Bitfield containing several fields:
-	 *
-	 * a: arena_ind
-	 * b: slab
-	 * c: committed
-	 * d: dumpable
-	 * z: zeroed
-	 * t: state
-	 * i: szind
-	 * f: nfree
-	 * n: sn
-	 *
-	 * nnnnnnnn ... nnnnffff ffffffii iiiiiitt zdcbaaaa aaaaaaaa
-	 *
-	 * arena_ind: Arena from which this extent came, or all 1 bits if
-	 *            unassociated.
-	 *
-	 * slab: The slab flag indicates whether the extent is used for a slab
-	 *       of small regions.  This helps differentiate small size classes,
-	 *       and it indicates whether interior pointers can be looked up via
-	 *       iealloc().
-	 *
-	 * committed: The committed flag indicates whether physical memory is
-	 *            committed to the extent, whether explicitly or implicitly
-	 *            as on a system that overcommits and satisfies physical
-	 *            memory needs on demand via soft page faults.
-	 *
-	 * dumpable: The dumpable flag indicates whether or not we've set the
-	 *           memory in question to be dumpable.  Note that this
-	 *           interacts somewhat subtly with user-specified extent hooks,
-	 *           since we don't know if *they* are fiddling with
-	 *           dumpability (in which case, we don't want to undo whatever
-	 *           they're doing).  To deal with this scenario, we:
-	 *             - Make dumpable false only for memory allocated with the
-	 *               default hooks.
-	 *             - Only allow memory to go from non-dumpable to dumpable,
-	 *               and only once.
-	 *             - Never make the OS call to allow dumping when the
-	 *               dumpable bit is already set.
-	 *           These three constraints mean that we will never
-	 *           accidentally dump user memory that the user meant to set
-	 *           nondumpable with their extent hooks.
-	 *
-	 *
-	 * zeroed: The zeroed flag is used by extent recycling code to track
-	 *         whether memory is zero-filled.
-	 *
-	 * state: The state flag is an extent_state_t.
-	 *
-	 * szind: The szind flag indicates usable size class index for
-	 *        allocations residing in this extent, regardless of whether the
-	 *        extent is a slab.  Extent size and usable size often differ
-	 *        even for non-slabs, either due to sz_large_pad or promotion of
-	 *        sampled small regions.
-	 *
-	 * nfree: Number of free regions in slab.
-	 *
-	 * sn: Serial number (potentially non-unique).
-	 *
-	 *     Serial numbers may wrap around if !opt_retain, but as long as
-	 *     comparison functions fall back on address comparison for equal
-	 *     serial numbers, stable (if imperfect) ordering is maintained.
-	 *
-	 *     Serial numbers may not be unique even in the absence of
-	 *     wrap-around, e.g. when splitting an extent and assigning the same
-	 *     serial number to both resulting adjacent extents.
-	 */
-	uint64_t		e_bits;
-#define MASK(CURRENT_FIELD_WIDTH, CURRENT_FIELD_SHIFT) ((((((uint64_t)0x1U) << (CURRENT_FIELD_WIDTH)) - 1)) << (CURRENT_FIELD_SHIFT))
-
-#define EXTENT_BITS_ARENA_WIDTH  MALLOCX_ARENA_BITS
-#define EXTENT_BITS_ARENA_SHIFT  0
-#define EXTENT_BITS_ARENA_MASK  MASK(EXTENT_BITS_ARENA_WIDTH, EXTENT_BITS_ARENA_SHIFT)
-
-#define EXTENT_BITS_SLAB_WIDTH  1
-#define EXTENT_BITS_SLAB_SHIFT  (EXTENT_BITS_ARENA_WIDTH + EXTENT_BITS_ARENA_SHIFT)
-#define EXTENT_BITS_SLAB_MASK  MASK(EXTENT_BITS_SLAB_WIDTH, EXTENT_BITS_SLAB_SHIFT)
-
-#define EXTENT_BITS_COMMITTED_WIDTH  1
-#define EXTENT_BITS_COMMITTED_SHIFT  (EXTENT_BITS_SLAB_WIDTH + EXTENT_BITS_SLAB_SHIFT)
-#define EXTENT_BITS_COMMITTED_MASK  MASK(EXTENT_BITS_COMMITTED_WIDTH, EXTENT_BITS_COMMITTED_SHIFT)
-
-#define EXTENT_BITS_DUMPABLE_WIDTH  1
-#define EXTENT_BITS_DUMPABLE_SHIFT  (EXTENT_BITS_COMMITTED_WIDTH + EXTENT_BITS_COMMITTED_SHIFT)
-#define EXTENT_BITS_DUMPABLE_MASK  MASK(EXTENT_BITS_DUMPABLE_WIDTH, EXTENT_BITS_DUMPABLE_SHIFT)
-
-#define EXTENT_BITS_ZEROED_WIDTH  1
-#define EXTENT_BITS_ZEROED_SHIFT  (EXTENT_BITS_DUMPABLE_WIDTH + EXTENT_BITS_DUMPABLE_SHIFT)
-#define EXTENT_BITS_ZEROED_MASK  MASK(EXTENT_BITS_ZEROED_WIDTH, EXTENT_BITS_ZEROED_SHIFT)
-
-#define EXTENT_BITS_STATE_WIDTH  2
-#define EXTENT_BITS_STATE_SHIFT  (EXTENT_BITS_ZEROED_WIDTH + EXTENT_BITS_ZEROED_SHIFT)
-#define EXTENT_BITS_STATE_MASK  MASK(EXTENT_BITS_STATE_WIDTH, EXTENT_BITS_STATE_SHIFT)
-
-#define EXTENT_BITS_SZIND_WIDTH  LG_CEIL_NSIZES
-#define EXTENT_BITS_SZIND_SHIFT  (EXTENT_BITS_STATE_WIDTH + EXTENT_BITS_STATE_SHIFT)
-#define EXTENT_BITS_SZIND_MASK  MASK(EXTENT_BITS_SZIND_WIDTH, EXTENT_BITS_SZIND_SHIFT)
-
-#define EXTENT_BITS_NFREE_WIDTH  (LG_SLAB_MAXREGS + 1)
-#define EXTENT_BITS_NFREE_SHIFT  (EXTENT_BITS_SZIND_WIDTH + EXTENT_BITS_SZIND_SHIFT)
-#define EXTENT_BITS_NFREE_MASK  MASK(EXTENT_BITS_NFREE_WIDTH, EXTENT_BITS_NFREE_SHIFT)
-
-#define EXTENT_BITS_SN_SHIFT  (EXTENT_BITS_NFREE_WIDTH + EXTENT_BITS_NFREE_SHIFT)
-#define EXTENT_BITS_SN_MASK  (UINT64_MAX << EXTENT_BITS_SN_SHIFT)
-
-	/* Pointer to the extent that this structure is responsible for. */
-	void			*e_addr;
-
-	union {
-		/*
-		 * Extent size and serial number associated with the extent
-		 * structure (different than the serial number for the extent at
-		 * e_addr).
-		 *
-		 * ssssssss [...] ssssssss ssssnnnn nnnnnnnn
-		 */
-		size_t			e_size_esn;
-	#define EXTENT_SIZE_MASK	((size_t)~(PAGE-1))
-	#define EXTENT_ESN_MASK		((size_t)PAGE-1)
-		/* Base extent size, which may not be a multiple of PAGE. */
-		size_t			e_bsize;
-	};
-
-	/*
-	 * List linkage, used by a variety of lists:
-	 * - bin_t's slabs_full
-	 * - extents_t's LRU
-	 * - stashed dirty extents
-	 * - arena's large allocations
-	 */
-	ql_elm(extent_t)	ql_link;
-
-	/*
-	 * Linkage for per size class sn/address-ordered heaps, and
-	 * for extent_avail
-	 */
-	phn(extent_t)		ph_link;
-
-	union {
-		/* Small region slab metadata. */
-		arena_slab_data_t	e_slab_data;
-
-		/*
-		 * Profile counters, used for large objects.  Points to a
-		 * prof_tctx_t.
-		 */
-		atomic_p_t		e_prof_tctx;
-	};
-};
-typedef ql_head(extent_t) extent_list_t;
-typedef ph(extent_t) extent_tree_t;
-typedef ph(extent_t) extent_heap_t;
-
-/* Quantized collection of extents, with built-in LRU queue. */
-struct extents_s {
-	malloc_mutex_t		mtx;
-
-	/*
-	 * Quantized per size class heaps of extents.
-	 *
-	 * Synchronization: mtx.
-	 */
-	extent_heap_t		heaps[NPSIZES+1];
-
-	/*
-	 * Bitmap for which set bits correspond to non-empty heaps.
-	 *
-	 * Synchronization: mtx.
-	 */
-	bitmap_t		bitmap[BITMAP_GROUPS(NPSIZES+1)];
-
-	/*
-	 * LRU of all extents in heaps.
-	 *
-	 * Synchronization: mtx.
-	 */
-	extent_list_t		lru;
-
-	/*
-	 * Page sum for all extents in heaps.
-	 *
-	 * The synchronization here is a little tricky.  Modifications to npages
-	 * must hold mtx, but reads need not (though, a reader who sees npages
-	 * without holding the mutex can't assume anything about the rest of the
-	 * state of the extents_t).
-	 */
-	atomic_zu_t		npages;
-
-	/* All stored extents must be in the same state. */
-	extent_state_t		state;
-
-	/*
-	 * If true, delay coalescing until eviction; otherwise coalesce during
-	 * deallocation.
-	 */
-	bool			delay_coalesce;
-};
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
deleted file mode 100644
index c0561d99..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/extent_types.h
+++ /dev/null
@@ -1,17 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTENT_TYPES_H
-#define JEMALLOC_INTERNAL_EXTENT_TYPES_H
-
-typedef struct extent_s extent_t;
-typedef struct extents_s extents_t;
-
-#define EXTENT_HOOKS_INITIALIZER	NULL
-
-#define EXTENT_GROW_MAX_PIND (NPSIZES - 1)
-
-/*
- * When reuse (and split) an active extent, (1U << opt_lg_extent_max_active_fit)
- * is the max ratio between the size of the active extent and the new extent.
- */
-#define LG_EXTENT_MAX_ACTIVE_FIT_DEFAULT 6
-
-#endif /* JEMALLOC_INTERNAL_EXTENT_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
deleted file mode 100644
index dcfc992d..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/hash.h
+++ /dev/null
@@ -1,318 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_HASH_H
-#define JEMALLOC_INTERNAL_HASH_H
-
-#include "jemalloc/internal/assert.h"
-
-/*
- * The following hash function is based on MurmurHash3, placed into the public
- * domain by Austin Appleby.  See https://github.com/aappleby/smhasher for
- * details.
- */
-
-/******************************************************************************/
-/* Internal implementation. */
-static inline uint32_t
-hash_rotl_32(uint32_t x, int8_t r) {
-	return ((x << r) | (x >> (32 - r)));
-}
-
-static inline uint64_t
-hash_rotl_64(uint64_t x, int8_t r) {
-	return ((x << r) | (x >> (64 - r)));
-}
-
-static inline uint32_t
-hash_get_block_32(const uint32_t *p, int i) {
-	/* Handle unaligned read. */
-	if (unlikely((uintptr_t)p & (sizeof(uint32_t)-1)) != 0) {
-		uint32_t ret;
-
-		memcpy(&ret, (uint8_t *)(p + i), sizeof(uint32_t));
-		return ret;
-	}
-
-	return p[i];
-}
-
-static inline uint64_t
-hash_get_block_64(const uint64_t *p, int i) {
-	/* Handle unaligned read. */
-	if (unlikely((uintptr_t)p & (sizeof(uint64_t)-1)) != 0) {
-		uint64_t ret;
-
-		memcpy(&ret, (uint8_t *)(p + i), sizeof(uint64_t));
-		return ret;
-	}
-
-	return p[i];
-}
-
-static inline uint32_t
-hash_fmix_32(uint32_t h) {
-	h ^= h >> 16;
-	h *= 0x85ebca6b;
-	h ^= h >> 13;
-	h *= 0xc2b2ae35;
-	h ^= h >> 16;
-
-	return h;
-}
-
-static inline uint64_t
-hash_fmix_64(uint64_t k) {
-	k ^= k >> 33;
-	k *= KQU(0xff51afd7ed558ccd);
-	k ^= k >> 33;
-	k *= KQU(0xc4ceb9fe1a85ec53);
-	k ^= k >> 33;
-
-	return k;
-}
-
-static inline uint32_t
-hash_x86_32(const void *key, int len, uint32_t seed) {
-	const uint8_t *data = (const uint8_t *) key;
-	const int nblocks = len / 4;
-
-	uint32_t h1 = seed;
-
-	const uint32_t c1 = 0xcc9e2d51;
-	const uint32_t c2 = 0x1b873593;
-
-	/* body */
-	{
-		const uint32_t *blocks = (const uint32_t *) (data + nblocks*4);
-		int i;
-
-		for (i = -nblocks; i; i++) {
-			uint32_t k1 = hash_get_block_32(blocks, i);
-
-			k1 *= c1;
-			k1 = hash_rotl_32(k1, 15);
-			k1 *= c2;
-
-			h1 ^= k1;
-			h1 = hash_rotl_32(h1, 13);
-			h1 = h1*5 + 0xe6546b64;
-		}
-	}
-
-	/* tail */
-	{
-		const uint8_t *tail = (const uint8_t *) (data + nblocks*4);
-
-		uint32_t k1 = 0;
-
-		switch (len & 3) {
-		case 3: k1 ^= tail[2] << 16;
-		case 2: k1 ^= tail[1] << 8;
-		case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
-			k1 *= c2; h1 ^= k1;
-		}
-	}
-
-	/* finalization */
-	h1 ^= len;
-
-	h1 = hash_fmix_32(h1);
-
-	return h1;
-}
-
-UNUSED static inline void
-hash_x86_128(const void *key, const int len, uint32_t seed,
-    uint64_t r_out[2]) {
-	const uint8_t * data = (const uint8_t *) key;
-	const int nblocks = len / 16;
-
-	uint32_t h1 = seed;
-	uint32_t h2 = seed;
-	uint32_t h3 = seed;
-	uint32_t h4 = seed;
-
-	const uint32_t c1 = 0x239b961b;
-	const uint32_t c2 = 0xab0e9789;
-	const uint32_t c3 = 0x38b34ae5;
-	const uint32_t c4 = 0xa1e38b93;
-
-	/* body */
-	{
-		const uint32_t *blocks = (const uint32_t *) (data + nblocks*16);
-		int i;
-
-		for (i = -nblocks; i; i++) {
-			uint32_t k1 = hash_get_block_32(blocks, i*4 + 0);
-			uint32_t k2 = hash_get_block_32(blocks, i*4 + 1);
-			uint32_t k3 = hash_get_block_32(blocks, i*4 + 2);
-			uint32_t k4 = hash_get_block_32(blocks, i*4 + 3);
-
-			k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
-
-			h1 = hash_rotl_32(h1, 19); h1 += h2;
-			h1 = h1*5 + 0x561ccd1b;
-
-			k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;
-
-			h2 = hash_rotl_32(h2, 17); h2 += h3;
-			h2 = h2*5 + 0x0bcaa747;
-
-			k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;
-
-			h3 = hash_rotl_32(h3, 15); h3 += h4;
-			h3 = h3*5 + 0x96cd1c35;
-
-			k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
-
-			h4 = hash_rotl_32(h4, 13); h4 += h1;
-			h4 = h4*5 + 0x32ac3b17;
-		}
-	}
-
-	/* tail */
-	{
-		const uint8_t *tail = (const uint8_t *) (data + nblocks*16);
-		uint32_t k1 = 0;
-		uint32_t k2 = 0;
-		uint32_t k3 = 0;
-		uint32_t k4 = 0;
-
-		switch (len & 15) {
-		case 15: k4 ^= tail[14] << 16;
-		case 14: k4 ^= tail[13] << 8;
-		case 13: k4 ^= tail[12] << 0;
-			k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
-
-		case 12: k3 ^= tail[11] << 24;
-		case 11: k3 ^= tail[10] << 16;
-		case 10: k3 ^= tail[ 9] << 8;
-		case  9: k3 ^= tail[ 8] << 0;
-		     k3 *= c3; k3 = hash_rotl_32(k3, 17); k3 *= c4; h3 ^= k3;
-
-		case  8: k2 ^= tail[ 7] << 24;
-		case  7: k2 ^= tail[ 6] << 16;
-		case  6: k2 ^= tail[ 5] << 8;
-		case  5: k2 ^= tail[ 4] << 0;
-			k2 *= c2; k2 = hash_rotl_32(k2, 16); k2 *= c3; h2 ^= k2;
-
-		case  4: k1 ^= tail[ 3] << 24;
-		case  3: k1 ^= tail[ 2] << 16;
-		case  2: k1 ^= tail[ 1] << 8;
-		case  1: k1 ^= tail[ 0] << 0;
-			k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
-		}
-	}
-
-	/* finalization */
-	h1 ^= len; h2 ^= len; h3 ^= len; h4 ^= len;
-
-	h1 += h2; h1 += h3; h1 += h4;
-	h2 += h1; h3 += h1; h4 += h1;
-
-	h1 = hash_fmix_32(h1);
-	h2 = hash_fmix_32(h2);
-	h3 = hash_fmix_32(h3);
-	h4 = hash_fmix_32(h4);
-
-	h1 += h2; h1 += h3; h1 += h4;
-	h2 += h1; h3 += h1; h4 += h1;
-
-	r_out[0] = (((uint64_t) h2) << 32) | h1;
-	r_out[1] = (((uint64_t) h4) << 32) | h3;
-}
-
-UNUSED static inline void
-hash_x64_128(const void *key, const int len, const uint32_t seed,
-    uint64_t r_out[2]) {
-	const uint8_t *data = (const uint8_t *) key;
-	const int nblocks = len / 16;
-
-	uint64_t h1 = seed;
-	uint64_t h2 = seed;
-
-	const uint64_t c1 = KQU(0x87c37b91114253d5);
-	const uint64_t c2 = KQU(0x4cf5ad432745937f);
-
-	/* body */
-	{
-		const uint64_t *blocks = (const uint64_t *) (data);
-		int i;
-
-		for (i = 0; i < nblocks; i++) {
-			uint64_t k1 = hash_get_block_64(blocks, i*2 + 0);
-			uint64_t k2 = hash_get_block_64(blocks, i*2 + 1);
-
-			k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;
-
-			h1 = hash_rotl_64(h1, 27); h1 += h2;
-			h1 = h1*5 + 0x52dce729;
-
-			k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;
-
-			h2 = hash_rotl_64(h2, 31); h2 += h1;
-			h2 = h2*5 + 0x38495ab5;
-		}
-	}
-
-	/* tail */
-	{
-		const uint8_t *tail = (const uint8_t*)(data + nblocks*16);
-		uint64_t k1 = 0;
-		uint64_t k2 = 0;
-
-		switch (len & 15) {
-		case 15: k2 ^= ((uint64_t)(tail[14])) << 48; /* falls through */
-		case 14: k2 ^= ((uint64_t)(tail[13])) << 40; /* falls through */
-		case 13: k2 ^= ((uint64_t)(tail[12])) << 32; /* falls through */
-		case 12: k2 ^= ((uint64_t)(tail[11])) << 24; /* falls through */
-		case 11: k2 ^= ((uint64_t)(tail[10])) << 16; /* falls through */
-		case 10: k2 ^= ((uint64_t)(tail[ 9])) << 8;  /* falls through */
-		case  9: k2 ^= ((uint64_t)(tail[ 8])) << 0;
-			k2 *= c2; k2 = hash_rotl_64(k2, 33); k2 *= c1; h2 ^= k2;
-			/* falls through */
-		case  8: k1 ^= ((uint64_t)(tail[ 7])) << 56; /* falls through */
-		case  7: k1 ^= ((uint64_t)(tail[ 6])) << 48; /* falls through */
-		case  6: k1 ^= ((uint64_t)(tail[ 5])) << 40; /* falls through */
-		case  5: k1 ^= ((uint64_t)(tail[ 4])) << 32; /* falls through */
-		case  4: k1 ^= ((uint64_t)(tail[ 3])) << 24; /* falls through */
-		case  3: k1 ^= ((uint64_t)(tail[ 2])) << 16; /* falls through */
-		case  2: k1 ^= ((uint64_t)(tail[ 1])) << 8;  /* falls through */
-		case  1: k1 ^= ((uint64_t)(tail[ 0])) << 0;
-			k1 *= c1; k1 = hash_rotl_64(k1, 31); k1 *= c2; h1 ^= k1;
-		}
-	}
-
-	/* finalization */
-	h1 ^= len; h2 ^= len;
-
-	h1 += h2;
-	h2 += h1;
-
-	h1 = hash_fmix_64(h1);
-	h2 = hash_fmix_64(h2);
-
-	h1 += h2;
-	h2 += h1;
-
-	r_out[0] = h1;
-	r_out[1] = h2;
-}
-
-/******************************************************************************/
-/* API. */
-static inline void
-hash(const void *key, size_t len, const uint32_t seed, size_t r_hash[2]) {
-	assert(len <= INT_MAX); /* Unfortunate implementation limitation. */
-
-#if (LG_SIZEOF_PTR == 3 && !defined(JEMALLOC_BIG_ENDIAN))
-	hash_x64_128(key, (int)len, seed, (uint64_t *)r_hash);
-#else
-	{
-		uint64_t hashes[2];
-		hash_x86_128(key, (int)len, seed, hashes);
-		r_hash[0] = (size_t)hashes[0];
-		r_hash[1] = (size_t)hashes[1];
-	}
-#endif
-}
-
-#endif /* JEMALLOC_INTERNAL_HASH_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
deleted file mode 100644
index cd49afcb..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/hooks.h
+++ /dev/null
@@ -1,19 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_HOOKS_H
-#define JEMALLOC_INTERNAL_HOOKS_H
-
-extern JEMALLOC_EXPORT void (*hooks_arena_new_hook)();
-extern JEMALLOC_EXPORT void (*hooks_libc_hook)();
-
-#define JEMALLOC_HOOK(fn, hook) ((void)(hook != NULL && (hook(), 0)), fn)
-
-#define open JEMALLOC_HOOK(open, hooks_libc_hook)
-#define read JEMALLOC_HOOK(read, hooks_libc_hook)
-#define write JEMALLOC_HOOK(write, hooks_libc_hook)
-#define readlink JEMALLOC_HOOK(readlink, hooks_libc_hook)
-#define close JEMALLOC_HOOK(close, hooks_libc_hook)
-#define creat JEMALLOC_HOOK(creat, hooks_libc_hook)
-#define secure_getenv JEMALLOC_HOOK(secure_getenv, hooks_libc_hook)
-/* Note that this is undef'd and re-define'd in src/prof.c. */
-#define _Unwind_Backtrace JEMALLOC_HOOK(_Unwind_Backtrace, hooks_libc_hook)
-
-#endif /* JEMALLOC_INTERNAL_HOOKS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
deleted file mode 100644
index be70df51..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_decls.h
+++ /dev/null
@@ -1,91 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_DECLS_H
-#define JEMALLOC_INTERNAL_DECLS_H
-
-#include <math.h>
-#ifdef _WIN32
-#  include <windows.h>
-#  include "msvc_compat/windows_extra.h"
-#  ifdef _WIN64
-#    if LG_VADDR <= 32
-#      error Generate the headers using x64 vcargs
-#    endif
-#  else
-#    if LG_VADDR > 32
-#      undef LG_VADDR
-#      define LG_VADDR 32
-#    endif
-#  endif
-#else
-#  include <sys/param.h>
-#  include <sys/mman.h>
-#  if !defined(__pnacl__) && !defined(__native_client__)
-#    include <sys/syscall.h>
-#    if !defined(SYS_write) && defined(__NR_write)
-#      define SYS_write __NR_write
-#    endif
-#    if defined(SYS_open) && defined(__aarch64__)
-       /* Android headers may define SYS_open to __NR_open even though
-        * __NR_open may not exist on AArch64 (superseded by __NR_openat). */
-#      undef SYS_open
-#    endif
-#    include <sys/uio.h>
-#  endif
-#  include <pthread.h>
-#  include <signal.h>
-#  ifdef JEMALLOC_OS_UNFAIR_LOCK
-#    include <os/lock.h>
-#  endif
-#  ifdef JEMALLOC_GLIBC_MALLOC_HOOK
-#    include <sched.h>
-#  endif
-#  include <errno.h>
-#  include <sys/time.h>
-#  include <time.h>
-#  ifdef JEMALLOC_HAVE_MACH_ABSOLUTE_TIME
-#    include <mach/mach_time.h>
-#  endif
-#endif
-#include <sys/types.h>
-
-#include <limits.h>
-#ifndef SIZE_T_MAX
-#  define SIZE_T_MAX	SIZE_MAX
-#endif
-#ifndef SSIZE_MAX
-#  define SSIZE_MAX	((ssize_t)(SIZE_T_MAX >> 1))
-#endif
-#include <stdarg.h>
-#include <stdbool.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <stddef.h>
-#ifndef offsetof
-#  define offsetof(type, member)	((size_t)&(((type *)NULL)->member))
-#endif
-#include <string.h>
-#include <strings.h>
-#include <ctype.h>
-#ifdef _MSC_VER
-#  include <io.h>
-typedef intptr_t ssize_t;
-#  define PATH_MAX 1024
-#  define STDERR_FILENO 2
-#  define __func__ __FUNCTION__
-#  ifdef JEMALLOC_HAS_RESTRICT
-#    define restrict __restrict
-#  endif
-/* Disable warnings about deprecated system functions. */
-#  pragma warning(disable: 4996)
-#if _MSC_VER < 1800
-static int
-isblank(int c) {
-	return (c == '\t' || c == ' ');
-}
-#endif
-#else
-#  include <unistd.h>
-#endif
-#include <fcntl.h>
-
-#endif /* JEMALLOC_INTERNAL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
deleted file mode 100644
index 8dad9a1d..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_defs.h.in
+++ /dev/null
@@ -1,366 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_DEFS_H_
-#define JEMALLOC_INTERNAL_DEFS_H_
-/*
- * If JEMALLOC_PREFIX is defined via --with-jemalloc-prefix, it will cause all
- * public APIs to be prefixed.  This makes it possible, with some care, to use
- * multiple allocators simultaneously.
- */
-#undef JEMALLOC_PREFIX
-#undef JEMALLOC_CPREFIX
-
-/*
- * Define overrides for non-standard allocator-related functions if they are
- * present on the system.
- */
-#undef JEMALLOC_OVERRIDE___LIBC_CALLOC
-#undef JEMALLOC_OVERRIDE___LIBC_FREE
-#undef JEMALLOC_OVERRIDE___LIBC_MALLOC
-#undef JEMALLOC_OVERRIDE___LIBC_MEMALIGN
-#undef JEMALLOC_OVERRIDE___LIBC_REALLOC
-#undef JEMALLOC_OVERRIDE___LIBC_VALLOC
-#undef JEMALLOC_OVERRIDE___POSIX_MEMALIGN
-
-/*
- * JEMALLOC_PRIVATE_NAMESPACE is used as a prefix for all library-private APIs.
- * For shared libraries, symbol visibility mechanisms prevent these symbols
- * from being exported, but for static libraries, naming collisions are a real
- * possibility.
- */
-#undef JEMALLOC_PRIVATE_NAMESPACE
-
-/*
- * Hyper-threaded CPUs may need a special instruction inside spin loops in
- * order to yield to another virtual CPU.
- */
-#undef CPU_SPINWAIT
-/* 1 if CPU_SPINWAIT is defined, 0 otherwise. */
-#undef HAVE_CPU_SPINWAIT
-
-/*
- * Number of significant bits in virtual addresses.  This may be less than the
- * total number of bits in a pointer, e.g. on x64, for which the uppermost 16
- * bits are the same as bit 47.
- */
-#undef LG_VADDR
-
-/* Defined if C11 atomics are available. */
-#undef JEMALLOC_C11_ATOMICS
-
-/* Defined if GCC __atomic atomics are available. */
-#undef JEMALLOC_GCC_ATOMIC_ATOMICS
-
-/* Defined if GCC __sync atomics are available. */
-#undef JEMALLOC_GCC_SYNC_ATOMICS
-
-/*
- * Defined if __sync_add_and_fetch(uint32_t *, uint32_t) and
- * __sync_sub_and_fetch(uint32_t *, uint32_t) are available, despite
- * __GCC_HAVE_SYNC_COMPARE_AND_SWAP_4 not being defined (which means the
- * functions are defined in libgcc instead of being inlines).
- */
-#undef JE_FORCE_SYNC_COMPARE_AND_SWAP_4
-
-/*
- * Defined if __sync_add_and_fetch(uint64_t *, uint64_t) and
- * __sync_sub_and_fetch(uint64_t *, uint64_t) are available, despite
- * __GCC_HAVE_SYNC_COMPARE_AND_SWAP_8 not being defined (which means the
- * functions are defined in libgcc instead of being inlines).
- */
-#undef JE_FORCE_SYNC_COMPARE_AND_SWAP_8
-
-/*
- * Defined if __builtin_clz() and __builtin_clzl() are available.
- */
-#undef JEMALLOC_HAVE_BUILTIN_CLZ
-
-/*
- * Defined if os_unfair_lock_*() functions are available, as provided by Darwin.
- */
-#undef JEMALLOC_OS_UNFAIR_LOCK
-
-/*
- * Defined if OSSpin*() functions are available, as provided by Darwin, and
- * documented in the spinlock(3) manual page.
- */
-#undef JEMALLOC_OSSPIN
-
-/* Defined if syscall(2) is usable. */
-#undef JEMALLOC_USE_SYSCALL
-
-/*
- * Defined if secure_getenv(3) is available.
- */
-#undef JEMALLOC_HAVE_SECURE_GETENV
-
-/*
- * Defined if issetugid(2) is available.
- */
-#undef JEMALLOC_HAVE_ISSETUGID
-
-/* Defined if pthread_atfork(3) is available. */
-#undef JEMALLOC_HAVE_PTHREAD_ATFORK
-
-/* Defined if pthread_setname_np(3) is available. */
-#undef JEMALLOC_HAVE_PTHREAD_SETNAME_NP
-
-/*
- * Defined if clock_gettime(CLOCK_MONOTONIC_COARSE, ...) is available.
- */
-#undef JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE
-
-/*
- * Defined if clock_gettime(CLOCK_MONOTONIC, ...) is available.
- */
-#undef JEMALLOC_HAVE_CLOCK_MONOTONIC
-
-/*
- * Defined if mach_absolute_time() is available.
- */
-#undef JEMALLOC_HAVE_MACH_ABSOLUTE_TIME
-
-/*
- * Defined if _malloc_thread_cleanup() exists.  At least in the case of
- * FreeBSD, pthread_key_create() allocates, which if used during malloc
- * bootstrapping will cause recursion into the pthreads library.  Therefore, if
- * _malloc_thread_cleanup() exists, use it as the basis for thread cleanup in
- * malloc_tsd.
- */
-#undef JEMALLOC_MALLOC_THREAD_CLEANUP
-
-/*
- * Defined if threaded initialization is known to be safe on this platform.
- * Among other things, it must be possible to initialize a mutex without
- * triggering allocation in order for threaded allocation to be safe.
- */
-#undef JEMALLOC_THREADED_INIT
-
-/*
- * Defined if the pthreads implementation defines
- * _pthread_mutex_init_calloc_cb(), in which case the function is used in order
- * to avoid recursive allocation during mutex initialization.
- */
-#undef JEMALLOC_MUTEX_INIT_CB
-
-/* Non-empty if the tls_model attribute is supported. */
-#undef JEMALLOC_TLS_MODEL
-
-/*
- * JEMALLOC_DEBUG enables assertions and other sanity checks, and disables
- * inline functions.
- */
-#undef JEMALLOC_DEBUG
-
-/* JEMALLOC_STATS enables statistics calculation. */
-#undef JEMALLOC_STATS
-
-/* JEMALLOC_PROF enables allocation profiling. */
-#undef JEMALLOC_PROF
-
-/* Use libunwind for profile backtracing if defined. */
-#undef JEMALLOC_PROF_LIBUNWIND
-
-/* Use libgcc for profile backtracing if defined. */
-#undef JEMALLOC_PROF_LIBGCC
-
-/* Use gcc intrinsics for profile backtracing if defined. */
-#undef JEMALLOC_PROF_GCC
-
-/*
- * JEMALLOC_DSS enables use of sbrk(2) to allocate extents from the data storage
- * segment (DSS).
- */
-#undef JEMALLOC_DSS
-
-/* Support memory filling (junk/zero). */
-#undef JEMALLOC_FILL
-
-/* Support utrace(2)-based tracing. */
-#undef JEMALLOC_UTRACE
-
-/* Support optional abort() on OOM. */
-#undef JEMALLOC_XMALLOC
-
-/* Support lazy locking (avoid locking unless a second thread is launched). */
-#undef JEMALLOC_LAZY_LOCK
-
-/*
- * Minimum allocation alignment is 2^LG_QUANTUM bytes (ignoring tiny size
- * classes).
- */
-#undef LG_QUANTUM
-
-/* One page is 2^LG_PAGE bytes. */
-#undef LG_PAGE
-
-/*
- * One huge page is 2^LG_HUGEPAGE bytes.  Note that this is defined even if the
- * system does not explicitly support huge pages; system calls that require
- * explicit huge page support are separately configured.
- */
-#undef LG_HUGEPAGE
-
-/*
- * If defined, adjacent virtual memory mappings with identical attributes
- * automatically coalesce, and they fragment when changes are made to subranges.
- * This is the normal order of things for mmap()/munmap(), but on Windows
- * VirtualAlloc()/VirtualFree() operations must be precisely matched, i.e.
- * mappings do *not* coalesce/fragment.
- */
-#undef JEMALLOC_MAPS_COALESCE
-
-/*
- * If defined, retain memory for later reuse by default rather than using e.g.
- * munmap() to unmap freed extents.  This is enabled on 64-bit Linux because
- * common sequences of mmap()/munmap() calls will cause virtual memory map
- * holes.
- */
-#undef JEMALLOC_RETAIN
-
-/* TLS is used to map arenas and magazine caches to threads. */
-#undef JEMALLOC_TLS
-
-/*
- * Used to mark unreachable code to quiet "end of non-void" compiler warnings.
- * Don't use this directly; instead use unreachable() from util.h
- */
-#undef JEMALLOC_INTERNAL_UNREACHABLE
-
-/*
- * ffs*() functions to use for bitmapping.  Don't use these directly; instead,
- * use ffs_*() from util.h.
- */
-#undef JEMALLOC_INTERNAL_FFSLL
-#undef JEMALLOC_INTERNAL_FFSL
-#undef JEMALLOC_INTERNAL_FFS
-
-/*
- * If defined, explicitly attempt to more uniformly distribute large allocation
- * pointer alignments across all cache indices.
- */
-#undef JEMALLOC_CACHE_OBLIVIOUS
-
-/*
- * If defined, enable logging facilities.  We make this a configure option to
- * avoid taking extra branches everywhere.
- */
-#undef JEMALLOC_LOG
-
-/*
- * Darwin (OS X) uses zones to work around Mach-O symbol override shortcomings.
- */
-#undef JEMALLOC_ZONE
-
-/*
- * Methods for determining whether the OS overcommits.
- * JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY: Linux's
- *                                         /proc/sys/vm.overcommit_memory file.
- * JEMALLOC_SYSCTL_VM_OVERCOMMIT: FreeBSD's vm.overcommit sysctl.
- */
-#undef JEMALLOC_SYSCTL_VM_OVERCOMMIT
-#undef JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY
-
-/* Defined if madvise(2) is available. */
-#undef JEMALLOC_HAVE_MADVISE
-
-/*
- * Defined if transparent huge pages are supported via the MADV_[NO]HUGEPAGE
- * arguments to madvise(2).
- */
-#undef JEMALLOC_HAVE_MADVISE_HUGE
-
-/*
- * Methods for purging unused pages differ between operating systems.
- *
- *   madvise(..., MADV_FREE) : This marks pages as being unused, such that they
- *                             will be discarded rather than swapped out.
- *   madvise(..., MADV_DONTNEED) : If JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS is
- *                                 defined, this immediately discards pages,
- *                                 such that new pages will be demand-zeroed if
- *                                 the address region is later touched;
- *                                 otherwise this behaves similarly to
- *                                 MADV_FREE, though typically with higher
- *                                 system overhead.
- */
-#undef JEMALLOC_PURGE_MADVISE_FREE
-#undef JEMALLOC_PURGE_MADVISE_DONTNEED
-#undef JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS
-
-/* Defined if madvise(2) is available but MADV_FREE is not (x86 Linux only). */
-#undef JEMALLOC_DEFINE_MADVISE_FREE
-
-/*
- * Defined if MADV_DO[NT]DUMP is supported as an argument to madvise.
- */
-#undef JEMALLOC_MADVISE_DONTDUMP
-
-/*
- * Defined if transparent huge pages (THPs) are supported via the
- * MADV_[NO]HUGEPAGE arguments to madvise(2), and THP support is enabled.
- */
-#undef JEMALLOC_THP
-
-/* Define if operating system has alloca.h header. */
-#undef JEMALLOC_HAS_ALLOCA_H
-
-/* C99 restrict keyword supported. */
-#undef JEMALLOC_HAS_RESTRICT
-
-/* For use by hash code. */
-#undef JEMALLOC_BIG_ENDIAN
-
-/* sizeof(int) == 2^LG_SIZEOF_INT. */
-#undef LG_SIZEOF_INT
-
-/* sizeof(long) == 2^LG_SIZEOF_LONG. */
-#undef LG_SIZEOF_LONG
-
-/* sizeof(long long) == 2^LG_SIZEOF_LONG_LONG. */
-#undef LG_SIZEOF_LONG_LONG
-
-/* sizeof(intmax_t) == 2^LG_SIZEOF_INTMAX_T. */
-#undef LG_SIZEOF_INTMAX_T
-
-/* glibc malloc hooks (__malloc_hook, __realloc_hook, __free_hook). */
-#undef JEMALLOC_GLIBC_MALLOC_HOOK
-
-/* glibc memalign hook. */
-#undef JEMALLOC_GLIBC_MEMALIGN_HOOK
-
-/* pthread support */
-#undef JEMALLOC_HAVE_PTHREAD
-
-/* dlsym() support */
-#undef JEMALLOC_HAVE_DLSYM
-
-/* Adaptive mutex support in pthreads. */
-#undef JEMALLOC_HAVE_PTHREAD_MUTEX_ADAPTIVE_NP
-
-/* GNU specific sched_getcpu support */
-#undef JEMALLOC_HAVE_SCHED_GETCPU
-
-/* GNU specific sched_setaffinity support */
-#undef JEMALLOC_HAVE_SCHED_SETAFFINITY
-
-/*
- * If defined, all the features necessary for background threads are present.
- */
-#undef JEMALLOC_BACKGROUND_THREAD
-
-/*
- * If defined, jemalloc symbols are not exported (doesn't work when
- * JEMALLOC_PREFIX is not defined).
- */
-#undef JEMALLOC_EXPORT
-
-/* config.malloc_conf options string. */
-#undef JEMALLOC_CONFIG_MALLOC_CONF
-
-/* If defined, jemalloc takes the malloc/free/etc. symbol names. */
-#undef JEMALLOC_IS_MALLOC
-
-/*
- * Defined if strerror_r returns char * if _GNU_SOURCE is defined.
- */
-#undef JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE
-
-#endif /* JEMALLOC_INTERNAL_DEFS_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
deleted file mode 100644
index e10fb275..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_externs.h
+++ /dev/null
@@ -1,53 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_EXTERNS_H
-#define JEMALLOC_INTERNAL_EXTERNS_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/tsd_types.h"
-
-/* TSD checks this to set thread local slow state accordingly. */
-extern bool malloc_slow;
-
-/* Run-time options. */
-extern bool opt_abort;
-extern bool opt_abort_conf;
-extern const char *opt_junk;
-extern bool opt_junk_alloc;
-extern bool opt_junk_free;
-extern bool opt_utrace;
-extern bool opt_xmalloc;
-extern bool opt_zero;
-extern unsigned opt_narenas;
-
-/* Number of CPUs. */
-extern unsigned ncpus;
-
-/* Number of arenas used for automatic multiplexing of threads and arenas. */
-extern unsigned narenas_auto;
-
-/*
- * Arenas that are used to service external requests.  Not all elements of the
- * arenas array are necessarily used; arenas are created lazily as needed.
- */
-extern atomic_p_t arenas[];
-
-void *a0malloc(size_t size);
-void a0dalloc(void *ptr);
-void *bootstrap_malloc(size_t size);
-void *bootstrap_calloc(size_t num, size_t size);
-void bootstrap_free(void *ptr);
-void arena_set(unsigned ind, arena_t *arena);
-unsigned narenas_total_get(void);
-arena_t *arena_init(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks);
-arena_tdata_t *arena_tdata_get_hard(tsd_t *tsd, unsigned ind);
-arena_t *arena_choose_hard(tsd_t *tsd, bool internal);
-void arena_migrate(tsd_t *tsd, unsigned oldind, unsigned newind);
-void iarena_cleanup(tsd_t *tsd);
-void arena_cleanup(tsd_t *tsd);
-void arenas_tdata_cleanup(tsd_t *tsd);
-void jemalloc_prefork(void);
-void jemalloc_postfork_parent(void);
-void jemalloc_postfork_child(void);
-bool malloc_initialized(void);
-
-#endif /* JEMALLOC_INTERNAL_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
deleted file mode 100644
index 437eaa40..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_includes.h
+++ /dev/null
@@ -1,94 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_INCLUDES_H
-#define JEMALLOC_INTERNAL_INCLUDES_H
-
-/*
- * jemalloc can conceptually be broken into components (arena, tcache, etc.),
- * but there are circular dependencies that cannot be broken without
- * substantial performance degradation.
- *
- * Historically, we dealt with this by each header into four sections (types,
- * structs, externs, and inlines), and included each header file multiple times
- * in this file, picking out the portion we want on each pass using the
- * following #defines:
- *   JEMALLOC_H_TYPES   : Preprocessor-defined constants and psuedo-opaque data
- *                        types.
- *   JEMALLOC_H_STRUCTS : Data structures.
- *   JEMALLOC_H_EXTERNS : Extern data declarations and function prototypes.
- *   JEMALLOC_H_INLINES : Inline functions.
- *
- * We're moving toward a world in which the dependencies are explicit; each file
- * will #include the headers it depends on (rather than relying on them being
- * implicitly available via this file including every header file in the
- * project).
- *
- * We're now in an intermediate state: we've broken up the header files to avoid
- * having to include each one multiple times, but have not yet moved the
- * dependency information into the header files (i.e. we still rely on the
- * ordering in this file to ensure all a header's dependencies are available in
- * its translation unit).  Each component is now broken up into multiple header
- * files, corresponding to the sections above (e.g. instead of "foo.h", we now
- * have "foo_types.h", "foo_structs.h", "foo_externs.h", "foo_inlines.h").
- *
- * Those files which have been converted to explicitly include their
- * inter-component dependencies are now in the initial HERMETIC HEADERS
- * section.  All headers may still rely on jemalloc_preamble.h (which, by fiat,
- * must be included first in every translation unit) for system headers and
- * global jemalloc definitions, however.
- */
-
-/******************************************************************************/
-/* TYPES */
-/******************************************************************************/
-
-#include "jemalloc/internal/extent_types.h"
-#include "jemalloc/internal/base_types.h"
-#include "jemalloc/internal/arena_types.h"
-#include "jemalloc/internal/tcache_types.h"
-#include "jemalloc/internal/prof_types.h"
-
-/******************************************************************************/
-/* STRUCTS */
-/******************************************************************************/
-
-#include "jemalloc/internal/arena_structs_a.h"
-#include "jemalloc/internal/extent_structs.h"
-#include "jemalloc/internal/base_structs.h"
-#include "jemalloc/internal/prof_structs.h"
-#include "jemalloc/internal/arena_structs_b.h"
-#include "jemalloc/internal/tcache_structs.h"
-#include "jemalloc/internal/background_thread_structs.h"
-
-/******************************************************************************/
-/* EXTERNS */
-/******************************************************************************/
-
-#include "jemalloc/internal/jemalloc_internal_externs.h"
-#include "jemalloc/internal/extent_externs.h"
-#include "jemalloc/internal/base_externs.h"
-#include "jemalloc/internal/arena_externs.h"
-#include "jemalloc/internal/large_externs.h"
-#include "jemalloc/internal/tcache_externs.h"
-#include "jemalloc/internal/prof_externs.h"
-#include "jemalloc/internal/background_thread_externs.h"
-
-/******************************************************************************/
-/* INLINES */
-/******************************************************************************/
-
-#include "jemalloc/internal/jemalloc_internal_inlines_a.h"
-#include "jemalloc/internal/base_inlines.h"
-/*
- * Include portions of arena code interleaved with tcache code in order to
- * resolve circular dependencies.
- */
-#include "jemalloc/internal/prof_inlines_a.h"
-#include "jemalloc/internal/arena_inlines_a.h"
-#include "jemalloc/internal/extent_inlines.h"
-#include "jemalloc/internal/jemalloc_internal_inlines_b.h"
-#include "jemalloc/internal/tcache_inlines.h"
-#include "jemalloc/internal/arena_inlines_b.h"
-#include "jemalloc/internal/jemalloc_internal_inlines_c.h"
-#include "jemalloc/internal/prof_inlines_b.h"
-#include "jemalloc/internal/background_thread_inlines.h"
-
-#endif /* JEMALLOC_INTERNAL_INCLUDES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
deleted file mode 100644
index c6a1f7eb..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_a.h
+++ /dev/null
@@ -1,172 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_INLINES_A_H
-#define JEMALLOC_INTERNAL_INLINES_A_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/bit_util.h"
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/ticker.h"
-
-JEMALLOC_ALWAYS_INLINE malloc_cpuid_t
-malloc_getcpu(void) {
-	assert(have_percpu_arena);
-#if defined(JEMALLOC_HAVE_SCHED_GETCPU)
-	return (malloc_cpuid_t)sched_getcpu();
-#else
-	not_reached();
-	return -1;
-#endif
-}
-
-/* Return the chosen arena index based on current cpu. */
-JEMALLOC_ALWAYS_INLINE unsigned
-percpu_arena_choose(void) {
-	assert(have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena));
-
-	malloc_cpuid_t cpuid = malloc_getcpu();
-	assert(cpuid >= 0);
-
-	unsigned arena_ind;
-	if ((opt_percpu_arena == percpu_arena) || ((unsigned)cpuid < ncpus /
-	    2)) {
-		arena_ind = cpuid;
-	} else {
-		assert(opt_percpu_arena == per_phycpu_arena);
-		/* Hyper threads on the same physical CPU share arena. */
-		arena_ind = cpuid - ncpus / 2;
-	}
-
-	return arena_ind;
-}
-
-/* Return the limit of percpu auto arena range, i.e. arenas[0...ind_limit). */
-JEMALLOC_ALWAYS_INLINE unsigned
-percpu_arena_ind_limit(percpu_arena_mode_t mode) {
-	assert(have_percpu_arena && PERCPU_ARENA_ENABLED(mode));
-	if (mode == per_phycpu_arena && ncpus > 1) {
-		if (ncpus % 2) {
-			/* This likely means a misconfig. */
-			return ncpus / 2 + 1;
-		}
-		return ncpus / 2;
-	} else {
-		return ncpus;
-	}
-}
-
-static inline arena_tdata_t *
-arena_tdata_get(tsd_t *tsd, unsigned ind, bool refresh_if_missing) {
-	arena_tdata_t *tdata;
-	arena_tdata_t *arenas_tdata = tsd_arenas_tdata_get(tsd);
-
-	if (unlikely(arenas_tdata == NULL)) {
-		/* arenas_tdata hasn't been initialized yet. */
-		return arena_tdata_get_hard(tsd, ind);
-	}
-	if (unlikely(ind >= tsd_narenas_tdata_get(tsd))) {
-		/*
-		 * ind is invalid, cache is old (too small), or tdata to be
-		 * initialized.
-		 */
-		return (refresh_if_missing ? arena_tdata_get_hard(tsd, ind) :
-		    NULL);
-	}
-
-	tdata = &arenas_tdata[ind];
-	if (likely(tdata != NULL) || !refresh_if_missing) {
-		return tdata;
-	}
-	return arena_tdata_get_hard(tsd, ind);
-}
-
-static inline arena_t *
-arena_get(tsdn_t *tsdn, unsigned ind, bool init_if_missing) {
-	arena_t *ret;
-
-	assert(ind < MALLOCX_ARENA_LIMIT);
-
-	ret = (arena_t *)atomic_load_p(&arenas[ind], ATOMIC_ACQUIRE);
-	if (unlikely(ret == NULL)) {
-		if (init_if_missing) {
-			ret = arena_init(tsdn, ind,
-			    (extent_hooks_t *)&extent_hooks_default);
-		}
-	}
-	return ret;
-}
-
-static inline ticker_t *
-decay_ticker_get(tsd_t *tsd, unsigned ind) {
-	arena_tdata_t *tdata;
-
-	tdata = arena_tdata_get(tsd, ind, true);
-	if (unlikely(tdata == NULL)) {
-		return NULL;
-	}
-	return &tdata->decay_ticker;
-}
-
-JEMALLOC_ALWAYS_INLINE cache_bin_t *
-tcache_small_bin_get(tcache_t *tcache, szind_t binind) {
-	assert(binind < NBINS);
-	return &tcache->bins_small[binind];
-}
-
-JEMALLOC_ALWAYS_INLINE cache_bin_t *
-tcache_large_bin_get(tcache_t *tcache, szind_t binind) {
-	assert(binind >= NBINS &&binind < nhbins);
-	return &tcache->bins_large[binind - NBINS];
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tcache_available(tsd_t *tsd) {
-	/*
-	 * Thread specific auto tcache might be unavailable if: 1) during tcache
-	 * initialization, or 2) disabled through thread.tcache.enabled mallctl
-	 * or config options.  This check covers all cases.
-	 */
-	if (likely(tsd_tcache_enabled_get(tsd))) {
-		/* Associated arena == NULL implies tcache init in progress. */
-		assert(tsd_tcachep_get(tsd)->arena == NULL ||
-		    tcache_small_bin_get(tsd_tcachep_get(tsd), 0)->avail !=
-		    NULL);
-		return true;
-	}
-
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE tcache_t *
-tcache_get(tsd_t *tsd) {
-	if (!tcache_available(tsd)) {
-		return NULL;
-	}
-
-	return tsd_tcachep_get(tsd);
-}
-
-static inline void
-pre_reentrancy(tsd_t *tsd, arena_t *arena) {
-	/* arena is the current context.  Reentry from a0 is not allowed. */
-	assert(arena != arena_get(tsd_tsdn(tsd), 0, false));
-
-	bool fast = tsd_fast(tsd);
-	assert(tsd_reentrancy_level_get(tsd) < INT8_MAX);
-	++*tsd_reentrancy_levelp_get(tsd);
-	if (fast) {
-		/* Prepare slow path for reentrancy. */
-		tsd_slow_update(tsd);
-		assert(tsd->state == tsd_state_nominal_slow);
-	}
-}
-
-static inline void
-post_reentrancy(tsd_t *tsd) {
-	int8_t *reentrancy_level = tsd_reentrancy_levelp_get(tsd);
-	assert(*reentrancy_level > 0);
-	if (--*reentrancy_level == 0) {
-		tsd_slow_update(tsd);
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
deleted file mode 100644
index 2e76e5d8..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_b.h
+++ /dev/null
@@ -1,86 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_INLINES_B_H
-#define JEMALLOC_INTERNAL_INLINES_B_H
-
-#include "jemalloc/internal/rtree.h"
-
-/* Choose an arena based on a per-thread value. */
-static inline arena_t *
-arena_choose_impl(tsd_t *tsd, arena_t *arena, bool internal) {
-	arena_t *ret;
-
-	if (arena != NULL) {
-		return arena;
-	}
-
-	/* During reentrancy, arena 0 is the safest bet. */
-	if (unlikely(tsd_reentrancy_level_get(tsd) > 0)) {
-		return arena_get(tsd_tsdn(tsd), 0, true);
-	}
-
-	ret = internal ? tsd_iarena_get(tsd) : tsd_arena_get(tsd);
-	if (unlikely(ret == NULL)) {
-		ret = arena_choose_hard(tsd, internal);
-		assert(ret);
-		if (tcache_available(tsd)) {
-			tcache_t *tcache = tcache_get(tsd);
-			if (tcache->arena != NULL) {
-				/* See comments in tcache_data_init().*/
-				assert(tcache->arena ==
-				    arena_get(tsd_tsdn(tsd), 0, false));
-				if (tcache->arena != ret) {
-					tcache_arena_reassociate(tsd_tsdn(tsd),
-					    tcache, ret);
-				}
-			} else {
-				tcache_arena_associate(tsd_tsdn(tsd), tcache,
-				    ret);
-			}
-		}
-	}
-
-	/*
-	 * Note that for percpu arena, if the current arena is outside of the
-	 * auto percpu arena range, (i.e. thread is assigned to a manually
-	 * managed arena), then percpu arena is skipped.
-	 */
-	if (have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena) &&
-	    !internal && (arena_ind_get(ret) <
-	    percpu_arena_ind_limit(opt_percpu_arena)) && (ret->last_thd !=
-	    tsd_tsdn(tsd))) {
-		unsigned ind = percpu_arena_choose();
-		if (arena_ind_get(ret) != ind) {
-			percpu_arena_update(tsd, ind);
-			ret = tsd_arena_get(tsd);
-		}
-		ret->last_thd = tsd_tsdn(tsd);
-	}
-
-	return ret;
-}
-
-static inline arena_t *
-arena_choose(tsd_t *tsd, arena_t *arena) {
-	return arena_choose_impl(tsd, arena, false);
-}
-
-static inline arena_t *
-arena_ichoose(tsd_t *tsd, arena_t *arena) {
-	return arena_choose_impl(tsd, arena, true);
-}
-
-static inline bool
-arena_is_auto(arena_t *arena) {
-	assert(narenas_auto > 0);
-	return (arena_ind_get(arena) < narenas_auto);
-}
-
-JEMALLOC_ALWAYS_INLINE extent_t *
-iealloc(tsdn_t *tsdn, const void *ptr) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	return rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true);
-}
-
-#endif /* JEMALLOC_INTERNAL_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
deleted file mode 100644
index b19a9420..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_inlines_c.h
+++ /dev/null
@@ -1,257 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_INLINES_C_H
-#define JEMALLOC_INTERNAL_INLINES_C_H
-
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/sz.h"
-#include "jemalloc/internal/witness.h"
-
-/*
- * Translating the names of the 'i' functions:
- *   Abbreviations used in the first part of the function name (before
- *   alloc/dalloc) describe what that function accomplishes:
- *     a: arena (query)
- *     s: size (query, or sized deallocation)
- *     e: extent (query)
- *     p: aligned (allocates)
- *     vs: size (query, without knowing that the pointer is into the heap)
- *     r: rallocx implementation
- *     x: xallocx implementation
- *   Abbreviations used in the second part of the function name (after
- *   alloc/dalloc) describe the arguments it takes
- *     z: whether to return zeroed memory
- *     t: accepts a tcache_t * parameter
- *     m: accepts an arena_t * parameter
- */
-
-JEMALLOC_ALWAYS_INLINE arena_t *
-iaalloc(tsdn_t *tsdn, const void *ptr) {
-	assert(ptr != NULL);
-
-	return arena_aalloc(tsdn, ptr);
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-isalloc(tsdn_t *tsdn, const void *ptr) {
-	assert(ptr != NULL);
-
-	return arena_salloc(tsdn, ptr);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-iallocztm(tsdn_t *tsdn, size_t size, szind_t ind, bool zero, tcache_t *tcache,
-    bool is_internal, arena_t *arena, bool slow_path) {
-	void *ret;
-
-	assert(size != 0);
-	assert(!is_internal || tcache == NULL);
-	assert(!is_internal || arena == NULL || arena_is_auto(arena));
-	if (!tsdn_null(tsdn) && tsd_reentrancy_level_get(tsdn_tsd(tsdn)) == 0) {
-		witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-		    WITNESS_RANK_CORE, 0);
-	}
-
-	ret = arena_malloc(tsdn, arena, size, ind, zero, tcache, slow_path);
-	if (config_stats && is_internal && likely(ret != NULL)) {
-		arena_internal_add(iaalloc(tsdn, ret), isalloc(tsdn, ret));
-	}
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-ialloc(tsd_t *tsd, size_t size, szind_t ind, bool zero, bool slow_path) {
-	return iallocztm(tsd_tsdn(tsd), size, ind, zero, tcache_get(tsd), false,
-	    NULL, slow_path);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-ipallocztm(tsdn_t *tsdn, size_t usize, size_t alignment, bool zero,
-    tcache_t *tcache, bool is_internal, arena_t *arena) {
-	void *ret;
-
-	assert(usize != 0);
-	assert(usize == sz_sa2u(usize, alignment));
-	assert(!is_internal || tcache == NULL);
-	assert(!is_internal || arena == NULL || arena_is_auto(arena));
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	ret = arena_palloc(tsdn, arena, usize, alignment, zero, tcache);
-	assert(ALIGNMENT_ADDR2BASE(ret, alignment) == ret);
-	if (config_stats && is_internal && likely(ret != NULL)) {
-		arena_internal_add(iaalloc(tsdn, ret), isalloc(tsdn, ret));
-	}
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-ipalloct(tsdn_t *tsdn, size_t usize, size_t alignment, bool zero,
-    tcache_t *tcache, arena_t *arena) {
-	return ipallocztm(tsdn, usize, alignment, zero, tcache, false, arena);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-ipalloc(tsd_t *tsd, size_t usize, size_t alignment, bool zero) {
-	return ipallocztm(tsd_tsdn(tsd), usize, alignment, zero,
-	    tcache_get(tsd), false, NULL);
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-ivsalloc(tsdn_t *tsdn, const void *ptr) {
-	return arena_vsalloc(tsdn, ptr);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-idalloctm(tsdn_t *tsdn, void *ptr, tcache_t *tcache, alloc_ctx_t *alloc_ctx,
-    bool is_internal, bool slow_path) {
-	assert(ptr != NULL);
-	assert(!is_internal || tcache == NULL);
-	assert(!is_internal || arena_is_auto(iaalloc(tsdn, ptr)));
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-	if (config_stats && is_internal) {
-		arena_internal_sub(iaalloc(tsdn, ptr), isalloc(tsdn, ptr));
-	}
-	if (!is_internal && !tsdn_null(tsdn) &&
-	    tsd_reentrancy_level_get(tsdn_tsd(tsdn)) != 0) {
-		assert(tcache == NULL);
-	}
-	arena_dalloc(tsdn, ptr, tcache, alloc_ctx, slow_path);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-idalloc(tsd_t *tsd, void *ptr) {
-	idalloctm(tsd_tsdn(tsd), ptr, tcache_get(tsd), NULL, false, true);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-isdalloct(tsdn_t *tsdn, void *ptr, size_t size, tcache_t *tcache,
-    alloc_ctx_t *alloc_ctx, bool slow_path) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-	arena_sdalloc(tsdn, ptr, size, tcache, alloc_ctx, slow_path);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-iralloct_realign(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
-    size_t extra, size_t alignment, bool zero, tcache_t *tcache,
-    arena_t *arena) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-	void *p;
-	size_t usize, copysize;
-
-	usize = sz_sa2u(size + extra, alignment);
-	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-		return NULL;
-	}
-	p = ipalloct(tsdn, usize, alignment, zero, tcache, arena);
-	if (p == NULL) {
-		if (extra == 0) {
-			return NULL;
-		}
-		/* Try again, without extra this time. */
-		usize = sz_sa2u(size, alignment);
-		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-			return NULL;
-		}
-		p = ipalloct(tsdn, usize, alignment, zero, tcache, arena);
-		if (p == NULL) {
-			return NULL;
-		}
-	}
-	/*
-	 * Copy at most size bytes (not size+extra), since the caller has no
-	 * expectation that the extra bytes will be reliably preserved.
-	 */
-	copysize = (size < oldsize) ? size : oldsize;
-	memcpy(p, ptr, copysize);
-	isdalloct(tsdn, ptr, oldsize, tcache, NULL, true);
-	return p;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-iralloct(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size, size_t alignment,
-    bool zero, tcache_t *tcache, arena_t *arena) {
-	assert(ptr != NULL);
-	assert(size != 0);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	if (alignment != 0 && ((uintptr_t)ptr & ((uintptr_t)alignment-1))
-	    != 0) {
-		/*
-		 * Existing object alignment is inadequate; allocate new space
-		 * and copy.
-		 */
-		return iralloct_realign(tsdn, ptr, oldsize, size, 0, alignment,
-		    zero, tcache, arena);
-	}
-
-	return arena_ralloc(tsdn, arena, ptr, oldsize, size, alignment, zero,
-	    tcache);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-iralloc(tsd_t *tsd, void *ptr, size_t oldsize, size_t size, size_t alignment,
-    bool zero) {
-	return iralloct(tsd_tsdn(tsd), ptr, oldsize, size, alignment, zero,
-	    tcache_get(tsd), NULL);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-ixalloc(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size, size_t extra,
-    size_t alignment, bool zero) {
-	assert(ptr != NULL);
-	assert(size != 0);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	if (alignment != 0 && ((uintptr_t)ptr & ((uintptr_t)alignment-1))
-	    != 0) {
-		/* Existing object alignment is inadequate. */
-		return true;
-	}
-
-	return arena_ralloc_no_move(tsdn, ptr, oldsize, size, extra, zero);
-}
-
-JEMALLOC_ALWAYS_INLINE int
-iget_defrag_hint(tsdn_t *tsdn, void* ptr) {
-	int defrag = 0;
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	szind_t szind;
-	bool is_slab;
-	rtree_szind_slab_read(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr, true, &szind, &is_slab);
-	if (likely(is_slab)) {
-		/* Small allocation. */
-		extent_t *slab = iealloc(tsdn, ptr);
-		arena_t *arena = extent_arena_get(slab);
-		szind_t binind = extent_szind_get(slab);
-		bin_t *bin = &arena->bins[binind];
-		malloc_mutex_lock(tsdn, &bin->lock);
-		/* don't bother moving allocations from the slab currently used for new allocations */
-		if (slab != bin->slabcur) {
-			int free_in_slab = extent_nfree_get(slab);
-			if (free_in_slab) {
-				const bin_info_t *bin_info = &bin_infos[binind];
-				unsigned long curslabs = bin->stats.curslabs;
-				size_t curregs = bin->stats.curregs;
-				if (bin->slabcur) {
-					/* remove slabcur from the overall utilization */
-					curregs -= bin_info->nregs - extent_nfree_get(bin->slabcur);
-					curslabs -= 1;
-				}
-				/* Compare the utilization ratio of the slab in question to the total average,
-				 * to avoid precision lost and division, we do that by extrapolating the usage
-				 * of the slab as if all slabs have the same usage. If this slab is less used 
-				 * than the average, we'll prefer to evict the data to hopefully more used ones */
-				defrag = (bin_info->nregs - free_in_slab) * curslabs <= curregs;
-			}
-		}
-		malloc_mutex_unlock(tsdn, &bin->lock);
-	}
-	return defrag;
-}
-
-#endif /* JEMALLOC_INTERNAL_INLINES_C_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
deleted file mode 100644
index ed75d376..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_macros.h
+++ /dev/null
@@ -1,43 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_MACROS_H
-#define JEMALLOC_INTERNAL_MACROS_H
-
-#ifdef JEMALLOC_DEBUG
-#  define JEMALLOC_ALWAYS_INLINE static inline
-#else
-#  define JEMALLOC_ALWAYS_INLINE JEMALLOC_ATTR(always_inline) static inline
-#endif
-#ifdef _MSC_VER
-#  define inline _inline
-#endif
-
-#define UNUSED JEMALLOC_ATTR(unused)
-
-#define ZU(z)	((size_t)z)
-#define ZD(z)	((ssize_t)z)
-#define QU(q)	((uint64_t)q)
-#define QD(q)	((int64_t)q)
-
-#define KZU(z)	ZU(z##ULL)
-#define KZD(z)	ZD(z##LL)
-#define KQU(q)	QU(q##ULL)
-#define KQD(q)	QI(q##LL)
-
-#ifndef __DECONST
-#  define	__DECONST(type, var)	((type)(uintptr_t)(const void *)(var))
-#endif
-
-#if !defined(JEMALLOC_HAS_RESTRICT) || defined(__cplusplus)
-#  define restrict
-#endif
-
-/* Various function pointers are statick and immutable except during testing. */
-#ifdef JEMALLOC_JET
-#  define JET_MUTABLE
-#else
-#  define JET_MUTABLE const
-#endif
-
-#define JEMALLOC_VA_ARGS_HEAD(head, ...) head
-#define JEMALLOC_VA_ARGS_TAIL(head, ...) __VA_ARGS__
-
-#endif /* JEMALLOC_INTERNAL_MACROS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
deleted file mode 100644
index 1b750b12..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_internal_types.h
+++ /dev/null
@@ -1,185 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TYPES_H
-#define JEMALLOC_INTERNAL_TYPES_H
-
-/* Page size index type. */
-typedef unsigned pszind_t;
-
-/* Size class index type. */
-typedef unsigned szind_t;
-
-/* Processor / core id type. */
-typedef int malloc_cpuid_t;
-
-/*
- * Flags bits:
- *
- * a: arena
- * t: tcache
- * 0: unused
- * z: zero
- * n: alignment
- *
- * aaaaaaaa aaaatttt tttttttt 0znnnnnn
- */
-#define MALLOCX_ARENA_BITS	12
-#define MALLOCX_TCACHE_BITS	12
-#define MALLOCX_LG_ALIGN_BITS	6
-#define MALLOCX_ARENA_SHIFT	20
-#define MALLOCX_TCACHE_SHIFT	8
-#define MALLOCX_ARENA_MASK \
-    (((1 << MALLOCX_ARENA_BITS) - 1) << MALLOCX_ARENA_SHIFT)
-/* NB: Arena index bias decreases the maximum number of arenas by 1. */
-#define MALLOCX_ARENA_LIMIT	((1 << MALLOCX_ARENA_BITS) - 1)
-#define MALLOCX_TCACHE_MASK \
-    (((1 << MALLOCX_TCACHE_BITS) - 1) << MALLOCX_TCACHE_SHIFT)
-#define MALLOCX_TCACHE_MAX	((1 << MALLOCX_TCACHE_BITS) - 3)
-#define MALLOCX_LG_ALIGN_MASK	((1 << MALLOCX_LG_ALIGN_BITS) - 1)
-/* Use MALLOCX_ALIGN_GET() if alignment may not be specified in flags. */
-#define MALLOCX_ALIGN_GET_SPECIFIED(flags)				\
-    (ZU(1) << (flags & MALLOCX_LG_ALIGN_MASK))
-#define MALLOCX_ALIGN_GET(flags)					\
-    (MALLOCX_ALIGN_GET_SPECIFIED(flags) & (SIZE_T_MAX-1))
-#define MALLOCX_ZERO_GET(flags)						\
-    ((bool)(flags & MALLOCX_ZERO))
-
-#define MALLOCX_TCACHE_GET(flags)					\
-    (((unsigned)((flags & MALLOCX_TCACHE_MASK) >> MALLOCX_TCACHE_SHIFT)) - 2)
-#define MALLOCX_ARENA_GET(flags)					\
-    (((unsigned)(((unsigned)flags) >> MALLOCX_ARENA_SHIFT)) - 1)
-
-/* Smallest size class to support. */
-#define TINY_MIN		(1U << LG_TINY_MIN)
-
-/*
- * Minimum allocation alignment is 2^LG_QUANTUM bytes (ignoring tiny size
- * classes).
- */
-#ifndef LG_QUANTUM
-#  if (defined(__i386__) || defined(_M_IX86))
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __ia64__
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __alpha__
-#    define LG_QUANTUM		4
-#  endif
-#  if (defined(__sparc64__) || defined(__sparcv9) || defined(__sparc_v9__))
-#    define LG_QUANTUM		4
-#  endif
-#  if (defined(__amd64__) || defined(__x86_64__) || defined(_M_X64))
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __arm__
-#    define LG_QUANTUM		3
-#  endif
-#  ifdef __aarch64__
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __hppa__
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __m68k__
-#    define LG_QUANTUM		3
-#  endif
-#  ifdef __mips__
-#    define LG_QUANTUM		3
-#  endif
-#  ifdef __nios2__
-#    define LG_QUANTUM		3
-#  endif
-#  ifdef __or1k__
-#    define LG_QUANTUM		3
-#  endif
-#  ifdef __powerpc__
-#    define LG_QUANTUM		4
-#  endif
-#  if defined(__riscv) || defined(__riscv__)
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __s390__
-#    define LG_QUANTUM		4
-#  endif
-#  if (defined (__SH3E__) || defined(__SH4_SINGLE__) || defined(__SH4__) || \
-	defined(__SH4_SINGLE_ONLY__))
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __tile__
-#    define LG_QUANTUM		4
-#  endif
-#  ifdef __le32__
-#    define LG_QUANTUM		4
-#  endif
-#  ifndef LG_QUANTUM
-#    error "Unknown minimum alignment for architecture; specify via "
-	 "--with-lg-quantum"
-#  endif
-#endif
-
-#define QUANTUM			((size_t)(1U << LG_QUANTUM))
-#define QUANTUM_MASK		(QUANTUM - 1)
-
-/* Return the smallest quantum multiple that is >= a. */
-#define QUANTUM_CEILING(a)						\
-	(((a) + QUANTUM_MASK) & ~QUANTUM_MASK)
-
-#define LONG			((size_t)(1U << LG_SIZEOF_LONG))
-#define LONG_MASK		(LONG - 1)
-
-/* Return the smallest long multiple that is >= a. */
-#define LONG_CEILING(a)							\
-	(((a) + LONG_MASK) & ~LONG_MASK)
-
-#define SIZEOF_PTR		(1U << LG_SIZEOF_PTR)
-#define PTR_MASK		(SIZEOF_PTR - 1)
-
-/* Return the smallest (void *) multiple that is >= a. */
-#define PTR_CEILING(a)							\
-	(((a) + PTR_MASK) & ~PTR_MASK)
-
-/*
- * Maximum size of L1 cache line.  This is used to avoid cache line aliasing.
- * In addition, this controls the spacing of cacheline-spaced size classes.
- *
- * CACHELINE cannot be based on LG_CACHELINE because __declspec(align()) can
- * only handle raw constants.
- */
-#define LG_CACHELINE		6
-#define CACHELINE		64
-#define CACHELINE_MASK		(CACHELINE - 1)
-
-/* Return the smallest cacheline multiple that is >= s. */
-#define CACHELINE_CEILING(s)						\
-	(((s) + CACHELINE_MASK) & ~CACHELINE_MASK)
-
-/* Return the nearest aligned address at or below a. */
-#define ALIGNMENT_ADDR2BASE(a, alignment)				\
-	((void *)((uintptr_t)(a) & ((~(alignment)) + 1)))
-
-/* Return the offset between a and the nearest aligned address at or below a. */
-#define ALIGNMENT_ADDR2OFFSET(a, alignment)				\
-	((size_t)((uintptr_t)(a) & (alignment - 1)))
-
-/* Return the smallest alignment multiple that is >= s. */
-#define ALIGNMENT_CEILING(s, alignment)					\
-	(((s) + (alignment - 1)) & ((~(alignment)) + 1))
-
-/* Declare a variable-length array. */
-#if __STDC_VERSION__ < 199901L
-#  ifdef _MSC_VER
-#    include <malloc.h>
-#    define alloca _alloca
-#  else
-#    ifdef JEMALLOC_HAS_ALLOCA_H
-#      include <alloca.h>
-#    else
-#      include <stdlib.h>
-#    endif
-#  endif
-#  define VARIABLE_ARRAY(type, name, count) \
-	type *name = alloca(sizeof(type) * (count))
-#else
-#  define VARIABLE_ARRAY(type, name, count) type name[(count)]
-#endif
-
-#endif /* JEMALLOC_INTERNAL_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in b/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
deleted file mode 100644
index e621fbc8..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/jemalloc_preamble.h.in
+++ /dev/null
@@ -1,194 +0,0 @@
-#ifndef JEMALLOC_PREAMBLE_H
-#define JEMALLOC_PREAMBLE_H
-
-#include "jemalloc_internal_defs.h"
-#include "jemalloc/internal/jemalloc_internal_decls.h"
-
-#ifdef JEMALLOC_UTRACE
-#include <sys/ktrace.h>
-#endif
-
-#define JEMALLOC_NO_DEMANGLE
-#ifdef JEMALLOC_JET
-#  undef JEMALLOC_IS_MALLOC
-#  define JEMALLOC_N(n) jet_##n
-#  include "jemalloc/internal/public_namespace.h"
-#  define JEMALLOC_NO_RENAME
-#  include "../jemalloc@install_suffix@.h"
-#  undef JEMALLOC_NO_RENAME
-#else
-#  define JEMALLOC_N(n) @private_namespace@##n
-#  include "../jemalloc@install_suffix@.h"
-#endif
-
-#if (defined(JEMALLOC_OSATOMIC) || defined(JEMALLOC_OSSPIN))
-#include <libkern/OSAtomic.h>
-#endif
-
-#ifdef JEMALLOC_ZONE
-#include <mach/mach_error.h>
-#include <mach/mach_init.h>
-#include <mach/vm_map.h>
-#endif
-
-#include "jemalloc/internal/jemalloc_internal_macros.h"
-
-/*
- * Note that the ordering matters here; the hook itself is name-mangled.  We
- * want the inclusion of hooks to happen early, so that we hook as much as
- * possible.
- */
-#ifndef JEMALLOC_NO_PRIVATE_NAMESPACE
-#  ifndef JEMALLOC_JET
-#    include "jemalloc/internal/private_namespace.h"
-#  else
-#    include "jemalloc/internal/private_namespace_jet.h"
-#  endif
-#endif
-#include "jemalloc/internal/hooks.h"
-
-#ifdef JEMALLOC_DEFINE_MADVISE_FREE
-#  define JEMALLOC_MADV_FREE 8
-#endif
-
-static const bool config_debug =
-#ifdef JEMALLOC_DEBUG
-    true
-#else
-    false
-#endif
-    ;
-static const bool have_dss =
-#ifdef JEMALLOC_DSS
-    true
-#else
-    false
-#endif
-    ;
-static const bool have_madvise_huge =
-#ifdef JEMALLOC_HAVE_MADVISE_HUGE
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_fill =
-#ifdef JEMALLOC_FILL
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_lazy_lock =
-#ifdef JEMALLOC_LAZY_LOCK
-    true
-#else
-    false
-#endif
-    ;
-static const char * const config_malloc_conf = JEMALLOC_CONFIG_MALLOC_CONF;
-static const bool config_prof =
-#ifdef JEMALLOC_PROF
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_prof_libgcc =
-#ifdef JEMALLOC_PROF_LIBGCC
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_prof_libunwind =
-#ifdef JEMALLOC_PROF_LIBUNWIND
-    true
-#else
-    false
-#endif
-    ;
-static const bool maps_coalesce =
-#ifdef JEMALLOC_MAPS_COALESCE
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_stats =
-#ifdef JEMALLOC_STATS
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_tls =
-#ifdef JEMALLOC_TLS
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_utrace =
-#ifdef JEMALLOC_UTRACE
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_xmalloc =
-#ifdef JEMALLOC_XMALLOC
-    true
-#else
-    false
-#endif
-    ;
-static const bool config_cache_oblivious =
-#ifdef JEMALLOC_CACHE_OBLIVIOUS
-    true
-#else
-    false
-#endif
-    ;
-/*
- * Undocumented, for jemalloc development use only at the moment.  See the note
- * in jemalloc/internal/log.h.
- */
-static const bool config_log =
-#ifdef JEMALLOC_LOG
-    true
-#else
-    false
-#endif
-    ;
-#ifdef JEMALLOC_HAVE_SCHED_GETCPU
-/* Currently percpu_arena depends on sched_getcpu. */
-#define JEMALLOC_PERCPU_ARENA
-#endif
-static const bool have_percpu_arena =
-#ifdef JEMALLOC_PERCPU_ARENA
-    true
-#else
-    false
-#endif
-    ;
-/*
- * Undocumented, and not recommended; the application should take full
- * responsibility for tracking provenance.
- */
-static const bool force_ivsalloc =
-#ifdef JEMALLOC_FORCE_IVSALLOC
-    true
-#else
-    false
-#endif
-    ;
-static const bool have_background_thread =
-#ifdef JEMALLOC_BACKGROUND_THREAD
-    true
-#else
-    false
-#endif
-    ;
-
-#endif /* JEMALLOC_PREAMBLE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
deleted file mode 100644
index 3f36282c..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/large_externs.h
+++ /dev/null
@@ -1,26 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_LARGE_EXTERNS_H
-#define JEMALLOC_INTERNAL_LARGE_EXTERNS_H
-
-void *large_malloc(tsdn_t *tsdn, arena_t *arena, size_t usize, bool zero);
-void *large_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
-    bool zero);
-bool large_ralloc_no_move(tsdn_t *tsdn, extent_t *extent, size_t usize_min,
-    size_t usize_max, bool zero);
-void *large_ralloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent, size_t usize,
-    size_t alignment, bool zero, tcache_t *tcache);
-
-typedef void (large_dalloc_junk_t)(void *, size_t);
-extern large_dalloc_junk_t *JET_MUTABLE large_dalloc_junk;
-
-typedef void (large_dalloc_maybe_junk_t)(void *, size_t);
-extern large_dalloc_maybe_junk_t *JET_MUTABLE large_dalloc_maybe_junk;
-
-void large_dalloc_prep_junked_locked(tsdn_t *tsdn, extent_t *extent);
-void large_dalloc_finish(tsdn_t *tsdn, extent_t *extent);
-void large_dalloc(tsdn_t *tsdn, extent_t *extent);
-size_t large_salloc(tsdn_t *tsdn, const extent_t *extent);
-prof_tctx_t *large_prof_tctx_get(tsdn_t *tsdn, const extent_t *extent);
-void large_prof_tctx_set(tsdn_t *tsdn, extent_t *extent, prof_tctx_t *tctx);
-void large_prof_tctx_reset(tsdn_t *tsdn, extent_t *extent);
-
-#endif /* JEMALLOC_INTERNAL_LARGE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
deleted file mode 100644
index 64208586..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/log.h
+++ /dev/null
@@ -1,115 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_LOG_H
-#define JEMALLOC_INTERNAL_LOG_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/mutex.h"
-
-#ifdef JEMALLOC_LOG
-#  define JEMALLOC_LOG_VAR_BUFSIZE 1000
-#else
-#  define JEMALLOC_LOG_VAR_BUFSIZE 1
-#endif
-
-#define JEMALLOC_LOG_BUFSIZE 4096
-
-/*
- * The log malloc_conf option is a '|'-delimited list of log_var name segments
- * which should be logged.  The names are themselves hierarchical, with '.' as
- * the delimiter (a "segment" is just a prefix in the log namespace).  So, if
- * you have:
- *
- * log("arena", "log msg for arena"); // 1
- * log("arena.a", "log msg for arena.a"); // 2
- * log("arena.b", "log msg for arena.b"); // 3
- * log("arena.a.a", "log msg for arena.a.a"); // 4
- * log("extent.a", "log msg for extent.a"); // 5
- * log("extent.b", "log msg for extent.b"); // 6
- *
- * And your malloc_conf option is "log=arena.a|extent", then lines 2, 4, 5, and
- * 6 will print at runtime.  You can enable logging from all log vars by
- * writing "log=.".
- *
- * None of this should be regarded as a stable API for right now.  It's intended
- * as a debugging interface, to let us keep around some of our printf-debugging
- * statements.
- */
-
-extern char log_var_names[JEMALLOC_LOG_VAR_BUFSIZE];
-extern atomic_b_t log_init_done;
-
-typedef struct log_var_s log_var_t;
-struct log_var_s {
-	/*
-	 * Lowest bit is "inited", second lowest is "enabled".  Putting them in
-	 * a single word lets us avoid any fences on weak architectures.
-	 */
-	atomic_u_t state;
-	const char *name;
-};
-
-#define LOG_NOT_INITIALIZED 0U
-#define LOG_INITIALIZED_NOT_ENABLED 1U
-#define LOG_ENABLED 2U
-
-#define LOG_VAR_INIT(name_str) {ATOMIC_INIT(LOG_NOT_INITIALIZED), name_str}
-
-/*
- * Returns the value we should assume for state (which is not necessarily
- * accurate; if logging is done before logging has finished initializing, then
- * we default to doing the safe thing by logging everything).
- */
-unsigned log_var_update_state(log_var_t *log_var);
-
-/* We factor out the metadata management to allow us to test more easily. */
-#define log_do_begin(log_var)						\
-if (config_log) {							\
-	unsigned log_state = atomic_load_u(&(log_var).state,		\
-	    ATOMIC_RELAXED);						\
-	if (unlikely(log_state == LOG_NOT_INITIALIZED)) {		\
-		log_state = log_var_update_state(&(log_var));		\
-		assert(log_state != LOG_NOT_INITIALIZED);		\
-	}								\
-	if (log_state == LOG_ENABLED) {					\
-		{
-			/* User code executes here. */
-#define log_do_end(log_var)						\
-		}							\
-	}								\
-}
-
-/*
- * MSVC has some preprocessor bugs in its expansion of __VA_ARGS__ during
- * preprocessing.  To work around this, we take all potential extra arguments in
- * a var-args functions.  Since a varargs macro needs at least one argument in
- * the "...", we accept the format string there, and require that the first
- * argument in this "..." is a const char *.
- */
-static inline void
-log_impl_varargs(const char *name, ...) {
-	char buf[JEMALLOC_LOG_BUFSIZE];
-	va_list ap;
-
-	va_start(ap, name);
-	const char *format = va_arg(ap, const char *);
-	size_t dst_offset = 0;
-	dst_offset += malloc_snprintf(buf, JEMALLOC_LOG_BUFSIZE, "%s: ", name);
-	dst_offset += malloc_vsnprintf(buf + dst_offset,
-	    JEMALLOC_LOG_BUFSIZE - dst_offset, format, ap);
-	dst_offset += malloc_snprintf(buf + dst_offset,
-	    JEMALLOC_LOG_BUFSIZE - dst_offset, "\n");
-	va_end(ap);
-
-	malloc_write(buf);
-}
-
-/* Call as log("log.var.str", "format_string %d", arg_for_format_string); */
-#define LOG(log_var_str, ...)						\
-do {									\
-	static log_var_t log_var = LOG_VAR_INIT(log_var_str);		\
-	log_do_begin(log_var)						\
-		log_impl_varargs((log_var).name, __VA_ARGS__);		\
-	log_do_end(log_var)						\
-} while (0)
-
-#endif /* JEMALLOC_INTERNAL_LOG_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
deleted file mode 100644
index bfe556b5..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/malloc_io.h
+++ /dev/null
@@ -1,102 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_MALLOC_IO_H
-#define JEMALLOC_INTERNAL_MALLOC_IO_H
-
-#ifdef _WIN32
-#  ifdef _WIN64
-#    define FMT64_PREFIX "ll"
-#    define FMTPTR_PREFIX "ll"
-#  else
-#    define FMT64_PREFIX "ll"
-#    define FMTPTR_PREFIX ""
-#  endif
-#  define FMTd32 "d"
-#  define FMTu32 "u"
-#  define FMTx32 "x"
-#  define FMTd64 FMT64_PREFIX "d"
-#  define FMTu64 FMT64_PREFIX "u"
-#  define FMTx64 FMT64_PREFIX "x"
-#  define FMTdPTR FMTPTR_PREFIX "d"
-#  define FMTuPTR FMTPTR_PREFIX "u"
-#  define FMTxPTR FMTPTR_PREFIX "x"
-#else
-#  include <inttypes.h>
-#  define FMTd32 PRId32
-#  define FMTu32 PRIu32
-#  define FMTx32 PRIx32
-#  define FMTd64 PRId64
-#  define FMTu64 PRIu64
-#  define FMTx64 PRIx64
-#  define FMTdPTR PRIdPTR
-#  define FMTuPTR PRIuPTR
-#  define FMTxPTR PRIxPTR
-#endif
-
-/* Size of stack-allocated buffer passed to buferror(). */
-#define BUFERROR_BUF		64
-
-/*
- * Size of stack-allocated buffer used by malloc_{,v,vc}printf().  This must be
- * large enough for all possible uses within jemalloc.
- */
-#define MALLOC_PRINTF_BUFSIZE	4096
-
-int buferror(int err, char *buf, size_t buflen);
-uintmax_t malloc_strtoumax(const char *restrict nptr, char **restrict endptr,
-    int base);
-void malloc_write(const char *s);
-
-/*
- * malloc_vsnprintf() supports a subset of snprintf(3) that avoids floating
- * point math.
- */
-size_t malloc_vsnprintf(char *str, size_t size, const char *format,
-    va_list ap);
-size_t malloc_snprintf(char *str, size_t size, const char *format, ...)
-    JEMALLOC_FORMAT_PRINTF(3, 4);
-/*
- * The caller can set write_cb and cbopaque to null to choose to print with the
- * je_malloc_message hook.
- */
-void malloc_vcprintf(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *format, va_list ap);
-void malloc_cprintf(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *format, ...) JEMALLOC_FORMAT_PRINTF(3, 4);
-void malloc_printf(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
-
-static inline ssize_t
-malloc_write_fd(int fd, const void *buf, size_t count) {
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_write)
-	/*
-	 * Use syscall(2) rather than write(2) when possible in order to avoid
-	 * the possibility of memory allocation within libc.  This is necessary
-	 * on FreeBSD; most operating systems do not have this problem though.
-	 *
-	 * syscall() returns long or int, depending on platform, so capture the
-	 * result in the widest plausible type to avoid compiler warnings.
-	 */
-	long result = syscall(SYS_write, fd, buf, count);
-#else
-	ssize_t result = (ssize_t)write(fd, buf,
-#ifdef _WIN32
-	    (unsigned int)
-#endif
-	    count);
-#endif
-	return (ssize_t)result;
-}
-
-static inline ssize_t
-malloc_read_fd(int fd, void *buf, size_t count) {
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_read)
-	long result = syscall(SYS_read, fd, buf, count);
-#else
-	ssize_t result = read(fd, buf,
-#ifdef _WIN32
-	    (unsigned int)
-#endif
-	    count);
-#endif
-	return (ssize_t)result;
-}
-
-#endif /* JEMALLOC_INTERNAL_MALLOC_IO_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
deleted file mode 100644
index 6520c251..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex.h
+++ /dev/null
@@ -1,248 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_MUTEX_H
-#define JEMALLOC_INTERNAL_MUTEX_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/mutex_prof.h"
-#include "jemalloc/internal/tsd.h"
-#include "jemalloc/internal/witness.h"
-
-typedef enum {
-	/* Can only acquire one mutex of a given witness rank at a time. */
-	malloc_mutex_rank_exclusive,
-	/*
-	 * Can acquire multiple mutexes of the same witness rank, but in
-	 * address-ascending order only.
-	 */
-	malloc_mutex_address_ordered
-} malloc_mutex_lock_order_t;
-
-typedef struct malloc_mutex_s malloc_mutex_t;
-struct malloc_mutex_s {
-	union {
-		struct {
-			/*
-			 * prof_data is defined first to reduce cacheline
-			 * bouncing: the data is not touched by the mutex holder
-			 * during unlocking, while might be modified by
-			 * contenders.  Having it before the mutex itself could
-			 * avoid prefetching a modified cacheline (for the
-			 * unlocking thread).
-			 */
-			mutex_prof_data_t	prof_data;
-#ifdef _WIN32
-#  if _WIN32_WINNT >= 0x0600
-			SRWLOCK         	lock;
-#  else
-			CRITICAL_SECTION	lock;
-#  endif
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-			os_unfair_lock		lock;
-#elif (defined(JEMALLOC_OSSPIN))
-			OSSpinLock		lock;
-#elif (defined(JEMALLOC_MUTEX_INIT_CB))
-			pthread_mutex_t		lock;
-			malloc_mutex_t		*postponed_next;
-#else
-			pthread_mutex_t		lock;
-#endif
-		};
-		/*
-		 * We only touch witness when configured w/ debug.  However we
-		 * keep the field in a union when !debug so that we don't have
-		 * to pollute the code base with #ifdefs, while avoid paying the
-		 * memory cost.
-		 */
-#if !defined(JEMALLOC_DEBUG)
-		witness_t			witness;
-		malloc_mutex_lock_order_t	lock_order;
-#endif
-	};
-
-#if defined(JEMALLOC_DEBUG)
-	witness_t			witness;
-	malloc_mutex_lock_order_t	lock_order;
-#endif
-};
-
-/*
- * Based on benchmark results, a fixed spin with this amount of retries works
- * well for our critical sections.
- */
-#define MALLOC_MUTEX_MAX_SPIN 250
-
-#ifdef _WIN32
-#  if _WIN32_WINNT >= 0x0600
-#    define MALLOC_MUTEX_LOCK(m)    AcquireSRWLockExclusive(&(m)->lock)
-#    define MALLOC_MUTEX_UNLOCK(m)  ReleaseSRWLockExclusive(&(m)->lock)
-#    define MALLOC_MUTEX_TRYLOCK(m) (!TryAcquireSRWLockExclusive(&(m)->lock))
-#  else
-#    define MALLOC_MUTEX_LOCK(m)    EnterCriticalSection(&(m)->lock)
-#    define MALLOC_MUTEX_UNLOCK(m)  LeaveCriticalSection(&(m)->lock)
-#    define MALLOC_MUTEX_TRYLOCK(m) (!TryEnterCriticalSection(&(m)->lock))
-#  endif
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-#    define MALLOC_MUTEX_LOCK(m)    os_unfair_lock_lock(&(m)->lock)
-#    define MALLOC_MUTEX_UNLOCK(m)  os_unfair_lock_unlock(&(m)->lock)
-#    define MALLOC_MUTEX_TRYLOCK(m) (!os_unfair_lock_trylock(&(m)->lock))
-#elif (defined(JEMALLOC_OSSPIN))
-#    define MALLOC_MUTEX_LOCK(m)    OSSpinLockLock(&(m)->lock)
-#    define MALLOC_MUTEX_UNLOCK(m)  OSSpinLockUnlock(&(m)->lock)
-#    define MALLOC_MUTEX_TRYLOCK(m) (!OSSpinLockTry(&(m)->lock))
-#else
-#    define MALLOC_MUTEX_LOCK(m)    pthread_mutex_lock(&(m)->lock)
-#    define MALLOC_MUTEX_UNLOCK(m)  pthread_mutex_unlock(&(m)->lock)
-#    define MALLOC_MUTEX_TRYLOCK(m) (pthread_mutex_trylock(&(m)->lock) != 0)
-#endif
-
-#define LOCK_PROF_DATA_INITIALIZER					\
-    {NSTIME_ZERO_INITIALIZER, NSTIME_ZERO_INITIALIZER, 0, 0, 0,		\
-	    ATOMIC_INIT(0), 0, NULL, 0}
-
-#ifdef _WIN32
-#  define MALLOC_MUTEX_INITIALIZER
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-#  define MALLOC_MUTEX_INITIALIZER					\
-     {{{LOCK_PROF_DATA_INITIALIZER, OS_UNFAIR_LOCK_INIT}},		\
-      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
-#elif (defined(JEMALLOC_OSSPIN))
-#  define MALLOC_MUTEX_INITIALIZER					\
-     {{{LOCK_PROF_DATA_INITIALIZER, 0}},				\
-      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
-#elif (defined(JEMALLOC_MUTEX_INIT_CB))
-#  define MALLOC_MUTEX_INITIALIZER					\
-     {{{LOCK_PROF_DATA_INITIALIZER, PTHREAD_MUTEX_INITIALIZER, NULL}},	\
-      WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
-#else
-#    define MALLOC_MUTEX_TYPE PTHREAD_MUTEX_DEFAULT
-#    define MALLOC_MUTEX_INITIALIZER					\
-       {{{LOCK_PROF_DATA_INITIALIZER, PTHREAD_MUTEX_INITIALIZER}},	\
-        WITNESS_INITIALIZER("mutex", WITNESS_RANK_OMIT)}
-#endif
-
-#ifdef JEMALLOC_LAZY_LOCK
-extern bool isthreaded;
-#else
-#  undef isthreaded /* Undo private_namespace.h definition. */
-#  define isthreaded true
-#endif
-
-bool malloc_mutex_init(malloc_mutex_t *mutex, const char *name,
-    witness_rank_t rank, malloc_mutex_lock_order_t lock_order);
-void malloc_mutex_prefork(tsdn_t *tsdn, malloc_mutex_t *mutex);
-void malloc_mutex_postfork_parent(tsdn_t *tsdn, malloc_mutex_t *mutex);
-void malloc_mutex_postfork_child(tsdn_t *tsdn, malloc_mutex_t *mutex);
-bool malloc_mutex_boot(void);
-void malloc_mutex_prof_data_reset(tsdn_t *tsdn, malloc_mutex_t *mutex);
-
-void malloc_mutex_lock_slow(malloc_mutex_t *mutex);
-
-static inline void
-malloc_mutex_lock_final(malloc_mutex_t *mutex) {
-	MALLOC_MUTEX_LOCK(mutex);
-}
-
-static inline bool
-malloc_mutex_trylock_final(malloc_mutex_t *mutex) {
-	return MALLOC_MUTEX_TRYLOCK(mutex);
-}
-
-static inline void
-mutex_owner_stats_update(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	if (config_stats) {
-		mutex_prof_data_t *data = &mutex->prof_data;
-		data->n_lock_ops++;
-		if (data->prev_owner != tsdn) {
-			data->prev_owner = tsdn;
-			data->n_owner_switches++;
-		}
-	}
-}
-
-/* Trylock: return false if the lock is successfully acquired. */
-static inline bool
-malloc_mutex_trylock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-	if (isthreaded) {
-		if (malloc_mutex_trylock_final(mutex)) {
-			return true;
-		}
-		mutex_owner_stats_update(tsdn, mutex);
-	}
-	witness_lock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-
-	return false;
-}
-
-/* Aggregate lock prof data. */
-static inline void
-malloc_mutex_prof_merge(mutex_prof_data_t *sum, mutex_prof_data_t *data) {
-	nstime_add(&sum->tot_wait_time, &data->tot_wait_time);
-	if (nstime_compare(&sum->max_wait_time, &data->max_wait_time) < 0) {
-		nstime_copy(&sum->max_wait_time, &data->max_wait_time);
-	}
-
-	sum->n_wait_times += data->n_wait_times;
-	sum->n_spin_acquired += data->n_spin_acquired;
-
-	if (sum->max_n_thds < data->max_n_thds) {
-		sum->max_n_thds = data->max_n_thds;
-	}
-	uint32_t cur_n_waiting_thds = atomic_load_u32(&sum->n_waiting_thds,
-	    ATOMIC_RELAXED);
-	uint32_t new_n_waiting_thds = cur_n_waiting_thds + atomic_load_u32(
-	    &data->n_waiting_thds, ATOMIC_RELAXED);
-	atomic_store_u32(&sum->n_waiting_thds, new_n_waiting_thds,
-	    ATOMIC_RELAXED);
-	sum->n_owner_switches += data->n_owner_switches;
-	sum->n_lock_ops += data->n_lock_ops;
-}
-
-static inline void
-malloc_mutex_lock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-	if (isthreaded) {
-		if (malloc_mutex_trylock_final(mutex)) {
-			malloc_mutex_lock_slow(mutex);
-		}
-		mutex_owner_stats_update(tsdn, mutex);
-	}
-	witness_lock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-}
-
-static inline void
-malloc_mutex_unlock(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	witness_unlock(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-	if (isthreaded) {
-		MALLOC_MUTEX_UNLOCK(mutex);
-	}
-}
-
-static inline void
-malloc_mutex_assert_owner(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	witness_assert_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-}
-
-static inline void
-malloc_mutex_assert_not_owner(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	witness_assert_not_owner(tsdn_witness_tsdp_get(tsdn), &mutex->witness);
-}
-
-/* Copy the prof data from mutex for processing. */
-static inline void
-malloc_mutex_prof_read(tsdn_t *tsdn, mutex_prof_data_t *data,
-    malloc_mutex_t *mutex) {
-	mutex_prof_data_t *source = &mutex->prof_data;
-	/* Can only read holding the mutex. */
-	malloc_mutex_assert_owner(tsdn, mutex);
-
-	/*
-	 * Not *really* allowed (we shouldn't be doing non-atomic loads of
-	 * atomic data), but the mutex protection makes this safe, and writing
-	 * a member-for-member copy is tedious for this situation.
-	 */
-	*data = *source;
-	/* n_wait_thds is not reported (modified w/o locking). */
-	atomic_store_u32(&data->n_waiting_thds, 0, ATOMIC_RELAXED);
-}
-
-#endif /* JEMALLOC_INTERNAL_MUTEX_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
deleted file mode 100644
index 726cece9..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_pool.h
+++ /dev/null
@@ -1,94 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_MUTEX_POOL_H
-#define JEMALLOC_INTERNAL_MUTEX_POOL_H
-
-#include "jemalloc/internal/hash.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/witness.h"
-
-/* We do mod reductions by this value, so it should be kept a power of 2. */
-#define MUTEX_POOL_SIZE 256
-
-typedef struct mutex_pool_s mutex_pool_t;
-struct mutex_pool_s {
-	malloc_mutex_t mutexes[MUTEX_POOL_SIZE];
-};
-
-bool mutex_pool_init(mutex_pool_t *pool, const char *name, witness_rank_t rank);
-
-/* Internal helper - not meant to be called outside this module. */
-static inline malloc_mutex_t *
-mutex_pool_mutex(mutex_pool_t *pool, uintptr_t key) {
-	size_t hash_result[2];
-	hash(&key, sizeof(key), 0xd50dcc1b, hash_result);
-	return &pool->mutexes[hash_result[0] % MUTEX_POOL_SIZE];
-}
-
-static inline void
-mutex_pool_assert_not_held(tsdn_t *tsdn, mutex_pool_t *pool) {
-	for (int i = 0; i < MUTEX_POOL_SIZE; i++) {
-		malloc_mutex_assert_not_owner(tsdn, &pool->mutexes[i]);
-	}
-}
-
-/*
- * Note that a mutex pool doesn't work exactly the way an embdedded mutex would.
- * You're not allowed to acquire mutexes in the pool one at a time.  You have to
- * acquire all the mutexes you'll need in a single function call, and then
- * release them all in a single function call.
- */
-
-static inline void
-mutex_pool_lock(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
-	mutex_pool_assert_not_held(tsdn, pool);
-
-	malloc_mutex_t *mutex = mutex_pool_mutex(pool, key);
-	malloc_mutex_lock(tsdn, mutex);
-}
-
-static inline void
-mutex_pool_unlock(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
-	malloc_mutex_t *mutex = mutex_pool_mutex(pool, key);
-	malloc_mutex_unlock(tsdn, mutex);
-
-	mutex_pool_assert_not_held(tsdn, pool);
-}
-
-static inline void
-mutex_pool_lock2(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key1,
-    uintptr_t key2) {
-	mutex_pool_assert_not_held(tsdn, pool);
-
-	malloc_mutex_t *mutex1 = mutex_pool_mutex(pool, key1);
-	malloc_mutex_t *mutex2 = mutex_pool_mutex(pool, key2);
-	if ((uintptr_t)mutex1 < (uintptr_t)mutex2) {
-		malloc_mutex_lock(tsdn, mutex1);
-		malloc_mutex_lock(tsdn, mutex2);
-	} else if ((uintptr_t)mutex1 == (uintptr_t)mutex2) {
-		malloc_mutex_lock(tsdn, mutex1);
-	} else {
-		malloc_mutex_lock(tsdn, mutex2);
-		malloc_mutex_lock(tsdn, mutex1);
-	}
-}
-
-static inline void
-mutex_pool_unlock2(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key1,
-    uintptr_t key2) {
-	malloc_mutex_t *mutex1 = mutex_pool_mutex(pool, key1);
-	malloc_mutex_t *mutex2 = mutex_pool_mutex(pool, key2);
-	if (mutex1 == mutex2) {
-		malloc_mutex_unlock(tsdn, mutex1);
-	} else {
-		malloc_mutex_unlock(tsdn, mutex1);
-		malloc_mutex_unlock(tsdn, mutex2);
-	}
-
-	mutex_pool_assert_not_held(tsdn, pool);
-}
-
-static inline void
-mutex_pool_assert_owner(tsdn_t *tsdn, mutex_pool_t *pool, uintptr_t key) {
-	malloc_mutex_assert_owner(tsdn, mutex_pool_mutex(pool, key));
-}
-
-#endif /* JEMALLOC_INTERNAL_MUTEX_POOL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
deleted file mode 100644
index ce183d33..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/mutex_prof.h
+++ /dev/null
@@ -1,99 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_MUTEX_PROF_H
-#define JEMALLOC_INTERNAL_MUTEX_PROF_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/nstime.h"
-#include "jemalloc/internal/tsd_types.h"
-
-#define MUTEX_PROF_GLOBAL_MUTEXES					\
-    OP(background_thread)						\
-    OP(ctl)								\
-    OP(prof)
-
-typedef enum {
-#define OP(mtx) global_prof_mutex_##mtx,
-	MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-	mutex_prof_num_global_mutexes
-} mutex_prof_global_ind_t;
-
-#define MUTEX_PROF_ARENA_MUTEXES					\
-    OP(large)								\
-    OP(extent_avail)							\
-    OP(extents_dirty)							\
-    OP(extents_muzzy)							\
-    OP(extents_retained)						\
-    OP(decay_dirty)							\
-    OP(decay_muzzy)							\
-    OP(base)								\
-    OP(tcache_list)
-
-typedef enum {
-#define OP(mtx) arena_prof_mutex_##mtx,
-	MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-	mutex_prof_num_arena_mutexes
-} mutex_prof_arena_ind_t;
-
-#define MUTEX_PROF_UINT64_COUNTERS					\
-    OP(num_ops, uint64_t, "n_lock_ops")					\
-    OP(num_wait, uint64_t, "n_waiting")					\
-    OP(num_spin_acq, uint64_t, "n_spin_acq")				\
-    OP(num_owner_switch, uint64_t, "n_owner_switch")			\
-    OP(total_wait_time, uint64_t, "total_wait_ns")			\
-    OP(max_wait_time, uint64_t, "max_wait_ns")
-
-#define MUTEX_PROF_UINT32_COUNTERS					\
-    OP(max_num_thds, uint32_t, "max_n_thds")
-
-#define MUTEX_PROF_COUNTERS						\
-		MUTEX_PROF_UINT64_COUNTERS				\
-		MUTEX_PROF_UINT32_COUNTERS
-
-#define OP(counter, type, human) mutex_counter_##counter,
-
-#define COUNTER_ENUM(counter_list, t)					\
-		typedef enum {						\
-			counter_list					\
-			mutex_prof_num_##t##_counters			\
-		} mutex_prof_##t##_counter_ind_t;
-
-COUNTER_ENUM(MUTEX_PROF_UINT64_COUNTERS, uint64_t)
-COUNTER_ENUM(MUTEX_PROF_UINT32_COUNTERS, uint32_t)
-
-#undef COUNTER_ENUM
-#undef OP
-
-typedef struct {
-	/*
-	 * Counters touched on the slow path, i.e. when there is lock
-	 * contention.  We update them once we have the lock.
-	 */
-	/* Total time (in nano seconds) spent waiting on this mutex. */
-	nstime_t		tot_wait_time;
-	/* Max time (in nano seconds) spent on a single lock operation. */
-	nstime_t		max_wait_time;
-	/* # of times have to wait for this mutex (after spinning). */
-	uint64_t		n_wait_times;
-	/* # of times acquired the mutex through local spinning. */
-	uint64_t		n_spin_acquired;
-	/* Max # of threads waiting for the mutex at the same time. */
-	uint32_t		max_n_thds;
-	/* Current # of threads waiting on the lock.  Atomic synced. */
-	atomic_u32_t		n_waiting_thds;
-
-	/*
-	 * Data touched on the fast path.  These are modified right after we
-	 * grab the lock, so it's placed closest to the end (i.e. right before
-	 * the lock) so that we have a higher chance of them being on the same
-	 * cacheline.
-	 */
-	/* # of times the mutex holder is different than the previous one. */
-	uint64_t		n_owner_switches;
-	/* Previous mutex holder, to facilitate n_owner_switches. */
-	tsdn_t			*prev_owner;
-	/* # of lock() operations in total. */
-	uint64_t		n_lock_ops;
-} mutex_prof_data_t;
-
-#endif /* JEMALLOC_INTERNAL_MUTEX_PROF_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
deleted file mode 100644
index 17c177c7..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/nstime.h
+++ /dev/null
@@ -1,34 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_NSTIME_H
-#define JEMALLOC_INTERNAL_NSTIME_H
-
-/* Maximum supported number of seconds (~584 years). */
-#define NSTIME_SEC_MAX KQU(18446744072)
-#define NSTIME_ZERO_INITIALIZER {0}
-
-typedef struct {
-	uint64_t ns;
-} nstime_t;
-
-void nstime_init(nstime_t *time, uint64_t ns);
-void nstime_init2(nstime_t *time, uint64_t sec, uint64_t nsec);
-uint64_t nstime_ns(const nstime_t *time);
-uint64_t nstime_sec(const nstime_t *time);
-uint64_t nstime_msec(const nstime_t *time);
-uint64_t nstime_nsec(const nstime_t *time);
-void nstime_copy(nstime_t *time, const nstime_t *source);
-int nstime_compare(const nstime_t *a, const nstime_t *b);
-void nstime_add(nstime_t *time, const nstime_t *addend);
-void nstime_iadd(nstime_t *time, uint64_t addend);
-void nstime_subtract(nstime_t *time, const nstime_t *subtrahend);
-void nstime_isubtract(nstime_t *time, uint64_t subtrahend);
-void nstime_imultiply(nstime_t *time, uint64_t multiplier);
-void nstime_idivide(nstime_t *time, uint64_t divisor);
-uint64_t nstime_divide(const nstime_t *time, const nstime_t *divisor);
-
-typedef bool (nstime_monotonic_t)(void);
-extern nstime_monotonic_t *JET_MUTABLE nstime_monotonic;
-
-typedef bool (nstime_update_t)(nstime_t *);
-extern nstime_update_t *JET_MUTABLE nstime_update;
-
-#endif /* JEMALLOC_INTERNAL_NSTIME_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
deleted file mode 100644
index 7dae633a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/pages.h
+++ /dev/null
@@ -1,88 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PAGES_EXTERNS_H
-#define JEMALLOC_INTERNAL_PAGES_EXTERNS_H
-
-/* Page size.  LG_PAGE is determined by the configure script. */
-#ifdef PAGE_MASK
-#  undef PAGE_MASK
-#endif
-#define PAGE		((size_t)(1U << LG_PAGE))
-#define PAGE_MASK	((size_t)(PAGE - 1))
-/* Return the page base address for the page containing address a. */
-#define PAGE_ADDR2BASE(a)						\
-	((void *)((uintptr_t)(a) & ~PAGE_MASK))
-/* Return the smallest pagesize multiple that is >= s. */
-#define PAGE_CEILING(s)							\
-	(((s) + PAGE_MASK) & ~PAGE_MASK)
-
-/* Huge page size.  LG_HUGEPAGE is determined by the configure script. */
-#define HUGEPAGE	((size_t)(1U << LG_HUGEPAGE))
-#define HUGEPAGE_MASK	((size_t)(HUGEPAGE - 1))
-/* Return the huge page base address for the huge page containing address a. */
-#define HUGEPAGE_ADDR2BASE(a)						\
-	((void *)((uintptr_t)(a) & ~HUGEPAGE_MASK))
-/* Return the smallest pagesize multiple that is >= s. */
-#define HUGEPAGE_CEILING(s)						\
-	(((s) + HUGEPAGE_MASK) & ~HUGEPAGE_MASK)
-
-/* PAGES_CAN_PURGE_LAZY is defined if lazy purging is supported. */
-#if defined(_WIN32) || defined(JEMALLOC_PURGE_MADVISE_FREE)
-#  define PAGES_CAN_PURGE_LAZY
-#endif
-/*
- * PAGES_CAN_PURGE_FORCED is defined if forced purging is supported.
- *
- * The only supported way to hard-purge on Windows is to decommit and then
- * re-commit, but doing so is racy, and if re-commit fails it's a pain to
- * propagate the "poisoned" memory state.  Since we typically decommit as the
- * next step after purging on Windows anyway, there's no point in adding such
- * complexity.
- */
-#if !defined(_WIN32) && ((defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
-    defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)) || \
-    defined(JEMALLOC_MAPS_COALESCE))
-#  define PAGES_CAN_PURGE_FORCED
-#endif
-
-static const bool pages_can_purge_lazy =
-#ifdef PAGES_CAN_PURGE_LAZY
-    true
-#else
-    false
-#endif
-    ;
-static const bool pages_can_purge_forced =
-#ifdef PAGES_CAN_PURGE_FORCED
-    true
-#else
-    false
-#endif
-    ;
-
-typedef enum {
-	thp_mode_default       = 0, /* Do not change hugepage settings. */
-	thp_mode_always        = 1, /* Always set MADV_HUGEPAGE. */
-	thp_mode_never         = 2, /* Always set MADV_NOHUGEPAGE. */
-
-	thp_mode_names_limit   = 3, /* Used for option processing. */
-	thp_mode_not_supported = 3  /* No THP support detected. */
-} thp_mode_t;
-
-#define THP_MODE_DEFAULT thp_mode_default
-extern thp_mode_t opt_thp;
-extern thp_mode_t init_system_thp_mode; /* Initial system wide state. */
-extern const char *thp_mode_names[];
-
-void *pages_map(void *addr, size_t size, size_t alignment, bool *commit);
-void pages_unmap(void *addr, size_t size);
-bool pages_commit(void *addr, size_t size);
-bool pages_decommit(void *addr, size_t size);
-bool pages_purge_lazy(void *addr, size_t size);
-bool pages_purge_forced(void *addr, size_t size);
-bool pages_huge(void *addr, size_t size);
-bool pages_nohuge(void *addr, size_t size);
-bool pages_dontdump(void *addr, size_t size);
-bool pages_dodump(void *addr, size_t size);
-bool pages_boot(void);
-void pages_set_thp_state (void *ptr, size_t size);
-
-#endif /* JEMALLOC_INTERNAL_PAGES_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
deleted file mode 100644
index 84d6778a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/ph.h
+++ /dev/null
@@ -1,391 +0,0 @@
-/*
- * A Pairing Heap implementation.
- *
- * "The Pairing Heap: A New Form of Self-Adjusting Heap"
- * https://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf
- *
- * With auxiliary twopass list, described in a follow on paper.
- *
- * "Pairing Heaps: Experiments and Analysis"
- * http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.2988&rep=rep1&type=pdf
- *
- *******************************************************************************
- */
-
-#ifndef PH_H_
-#define PH_H_
-
-/* Node structure. */
-#define phn(a_type)							\
-struct {								\
-	a_type	*phn_prev;						\
-	a_type	*phn_next;						\
-	a_type	*phn_lchild;						\
-}
-
-/* Root structure. */
-#define ph(a_type)							\
-struct {								\
-	a_type	*ph_root;						\
-}
-
-/* Internal utility macros. */
-#define phn_lchild_get(a_type, a_field, a_phn)				\
-	(a_phn->a_field.phn_lchild)
-#define phn_lchild_set(a_type, a_field, a_phn, a_lchild) do {		\
-	a_phn->a_field.phn_lchild = a_lchild;				\
-} while (0)
-
-#define phn_next_get(a_type, a_field, a_phn)				\
-	(a_phn->a_field.phn_next)
-#define phn_prev_set(a_type, a_field, a_phn, a_prev) do {		\
-	a_phn->a_field.phn_prev = a_prev;				\
-} while (0)
-
-#define phn_prev_get(a_type, a_field, a_phn)				\
-	(a_phn->a_field.phn_prev)
-#define phn_next_set(a_type, a_field, a_phn, a_next) do {		\
-	a_phn->a_field.phn_next = a_next;				\
-} while (0)
-
-#define phn_merge_ordered(a_type, a_field, a_phn0, a_phn1, a_cmp) do {	\
-	a_type *phn0child;						\
-									\
-	assert(a_phn0 != NULL);						\
-	assert(a_phn1 != NULL);						\
-	assert(a_cmp(a_phn0, a_phn1) <= 0);				\
-									\
-	phn_prev_set(a_type, a_field, a_phn1, a_phn0);			\
-	phn0child = phn_lchild_get(a_type, a_field, a_phn0);		\
-	phn_next_set(a_type, a_field, a_phn1, phn0child);		\
-	if (phn0child != NULL) {					\
-		phn_prev_set(a_type, a_field, phn0child, a_phn1);	\
-	}								\
-	phn_lchild_set(a_type, a_field, a_phn0, a_phn1);		\
-} while (0)
-
-#define phn_merge(a_type, a_field, a_phn0, a_phn1, a_cmp, r_phn) do {	\
-	if (a_phn0 == NULL) {						\
-		r_phn = a_phn1;						\
-	} else if (a_phn1 == NULL) {					\
-		r_phn = a_phn0;						\
-	} else if (a_cmp(a_phn0, a_phn1) < 0) {				\
-		phn_merge_ordered(a_type, a_field, a_phn0, a_phn1,	\
-		    a_cmp);						\
-		r_phn = a_phn0;						\
-	} else {							\
-		phn_merge_ordered(a_type, a_field, a_phn1, a_phn0,	\
-		    a_cmp);						\
-		r_phn = a_phn1;						\
-	}								\
-} while (0)
-
-#define ph_merge_siblings(a_type, a_field, a_phn, a_cmp, r_phn) do {	\
-	a_type *head = NULL;						\
-	a_type *tail = NULL;						\
-	a_type *phn0 = a_phn;						\
-	a_type *phn1 = phn_next_get(a_type, a_field, phn0);		\
-									\
-	/*								\
-	 * Multipass merge, wherein the first two elements of a FIFO	\
-	 * are repeatedly merged, and each result is appended to the	\
-	 * singly linked FIFO, until the FIFO contains only a single	\
-	 * element.  We start with a sibling list but no reference to	\
-	 * its tail, so we do a single pass over the sibling list to	\
-	 * populate the FIFO.						\
-	 */								\
-	if (phn1 != NULL) {						\
-		a_type *phnrest = phn_next_get(a_type, a_field, phn1);	\
-		if (phnrest != NULL) {					\
-			phn_prev_set(a_type, a_field, phnrest, NULL);	\
-		}							\
-		phn_prev_set(a_type, a_field, phn0, NULL);		\
-		phn_next_set(a_type, a_field, phn0, NULL);		\
-		phn_prev_set(a_type, a_field, phn1, NULL);		\
-		phn_next_set(a_type, a_field, phn1, NULL);		\
-		phn_merge(a_type, a_field, phn0, phn1, a_cmp, phn0);	\
-		head = tail = phn0;					\
-		phn0 = phnrest;						\
-		while (phn0 != NULL) {					\
-			phn1 = phn_next_get(a_type, a_field, phn0);	\
-			if (phn1 != NULL) {				\
-				phnrest = phn_next_get(a_type, a_field,	\
-				    phn1);				\
-				if (phnrest != NULL) {			\
-					phn_prev_set(a_type, a_field,	\
-					    phnrest, NULL);		\
-				}					\
-				phn_prev_set(a_type, a_field, phn0,	\
-				    NULL);				\
-				phn_next_set(a_type, a_field, phn0,	\
-				    NULL);				\
-				phn_prev_set(a_type, a_field, phn1,	\
-				    NULL);				\
-				phn_next_set(a_type, a_field, phn1,	\
-				    NULL);				\
-				phn_merge(a_type, a_field, phn0, phn1,	\
-				    a_cmp, phn0);			\
-				phn_next_set(a_type, a_field, tail,	\
-				    phn0);				\
-				tail = phn0;				\
-				phn0 = phnrest;				\
-			} else {					\
-				phn_next_set(a_type, a_field, tail,	\
-				    phn0);				\
-				tail = phn0;				\
-				phn0 = NULL;				\
-			}						\
-		}							\
-		phn0 = head;						\
-		phn1 = phn_next_get(a_type, a_field, phn0);		\
-		if (phn1 != NULL) {					\
-			while (true) {					\
-				head = phn_next_get(a_type, a_field,	\
-				    phn1);				\
-				assert(phn_prev_get(a_type, a_field,	\
-				    phn0) == NULL);			\
-				phn_next_set(a_type, a_field, phn0,	\
-				    NULL);				\
-				assert(phn_prev_get(a_type, a_field,	\
-				    phn1) == NULL);			\
-				phn_next_set(a_type, a_field, phn1,	\
-				    NULL);				\
-				phn_merge(a_type, a_field, phn0, phn1,	\
-				    a_cmp, phn0);			\
-				if (head == NULL) {			\
-					break;				\
-				}					\
-				phn_next_set(a_type, a_field, tail,	\
-				    phn0);				\
-				tail = phn0;				\
-				phn0 = head;				\
-				phn1 = phn_next_get(a_type, a_field,	\
-				    phn0);				\
-			}						\
-		}							\
-	}								\
-	r_phn = phn0;							\
-} while (0)
-
-#define ph_merge_aux(a_type, a_field, a_ph, a_cmp) do {			\
-	a_type *phn = phn_next_get(a_type, a_field, a_ph->ph_root);	\
-	if (phn != NULL) {						\
-		phn_prev_set(a_type, a_field, a_ph->ph_root, NULL);	\
-		phn_next_set(a_type, a_field, a_ph->ph_root, NULL);	\
-		phn_prev_set(a_type, a_field, phn, NULL);		\
-		ph_merge_siblings(a_type, a_field, phn, a_cmp, phn);	\
-		assert(phn_next_get(a_type, a_field, phn) == NULL);	\
-		phn_merge(a_type, a_field, a_ph->ph_root, phn, a_cmp,	\
-		    a_ph->ph_root);					\
-	}								\
-} while (0)
-
-#define ph_merge_children(a_type, a_field, a_phn, a_cmp, r_phn) do {	\
-	a_type *lchild = phn_lchild_get(a_type, a_field, a_phn);	\
-	if (lchild == NULL) {						\
-		r_phn = NULL;						\
-	} else {							\
-		ph_merge_siblings(a_type, a_field, lchild, a_cmp,	\
-		    r_phn);						\
-	}								\
-} while (0)
-
-/*
- * The ph_proto() macro generates function prototypes that correspond to the
- * functions generated by an equivalently parameterized call to ph_gen().
- */
-#define ph_proto(a_attr, a_prefix, a_ph_type, a_type)			\
-a_attr void	a_prefix##new(a_ph_type *ph);				\
-a_attr bool	a_prefix##empty(a_ph_type *ph);				\
-a_attr a_type	*a_prefix##first(a_ph_type *ph);			\
-a_attr a_type	*a_prefix##any(a_ph_type *ph);				\
-a_attr void	a_prefix##insert(a_ph_type *ph, a_type *phn);		\
-a_attr a_type	*a_prefix##remove_first(a_ph_type *ph);			\
-a_attr a_type	*a_prefix##remove_any(a_ph_type *ph);			\
-a_attr void	a_prefix##remove(a_ph_type *ph, a_type *phn);
-
-/*
- * The ph_gen() macro generates a type-specific pairing heap implementation,
- * based on the above cpp macros.
- */
-#define ph_gen(a_attr, a_prefix, a_ph_type, a_type, a_field, a_cmp)	\
-a_attr void								\
-a_prefix##new(a_ph_type *ph) {						\
-	memset(ph, 0, sizeof(ph(a_type)));				\
-}									\
-a_attr bool								\
-a_prefix##empty(a_ph_type *ph) {					\
-	return (ph->ph_root == NULL);					\
-}									\
-a_attr a_type *								\
-a_prefix##first(a_ph_type *ph) {					\
-	if (ph->ph_root == NULL) {					\
-		return NULL;						\
-	}								\
-	ph_merge_aux(a_type, a_field, ph, a_cmp);			\
-	return ph->ph_root;						\
-}									\
-a_attr a_type *								\
-a_prefix##any(a_ph_type *ph) {						\
-	if (ph->ph_root == NULL) {					\
-		return NULL;						\
-	}								\
-	a_type *aux = phn_next_get(a_type, a_field, ph->ph_root);	\
-	if (aux != NULL) {						\
-		return aux;						\
-	}								\
-	return ph->ph_root;						\
-}									\
-a_attr void								\
-a_prefix##insert(a_ph_type *ph, a_type *phn) {				\
-	memset(&phn->a_field, 0, sizeof(phn(a_type)));			\
-									\
-	/*								\
-	 * Treat the root as an aux list during insertion, and lazily	\
-	 * merge during a_prefix##remove_first().  For elements that	\
-	 * are inserted, then removed via a_prefix##remove() before the	\
-	 * aux list is ever processed, this makes insert/remove		\
-	 * constant-time, whereas eager merging would make insert	\
-	 * O(log n).							\
-	 */								\
-	if (ph->ph_root == NULL) {					\
-		ph->ph_root = phn;					\
-	} else {							\
-		phn_next_set(a_type, a_field, phn, phn_next_get(a_type,	\
-		    a_field, ph->ph_root));				\
-		if (phn_next_get(a_type, a_field, ph->ph_root) !=	\
-		    NULL) {						\
-			phn_prev_set(a_type, a_field,			\
-			    phn_next_get(a_type, a_field, ph->ph_root),	\
-			    phn);					\
-		}							\
-		phn_prev_set(a_type, a_field, phn, ph->ph_root);	\
-		phn_next_set(a_type, a_field, ph->ph_root, phn);	\
-	}								\
-}									\
-a_attr a_type *								\
-a_prefix##remove_first(a_ph_type *ph) {					\
-	a_type *ret;							\
-									\
-	if (ph->ph_root == NULL) {					\
-		return NULL;						\
-	}								\
-	ph_merge_aux(a_type, a_field, ph, a_cmp);			\
-									\
-	ret = ph->ph_root;						\
-									\
-	ph_merge_children(a_type, a_field, ph->ph_root, a_cmp,		\
-	    ph->ph_root);						\
-									\
-	return ret;							\
-}									\
-a_attr a_type *								\
-a_prefix##remove_any(a_ph_type *ph) {					\
-	/*								\
-	 * Remove the most recently inserted aux list element, or the	\
-	 * root if the aux list is empty.  This has the effect of	\
-	 * behaving as a LIFO (and insertion/removal is therefore	\
-	 * constant-time) if a_prefix##[remove_]first() are never	\
-	 * called.							\
-	 */								\
-	if (ph->ph_root == NULL) {					\
-		return NULL;						\
-	}								\
-	a_type *ret = phn_next_get(a_type, a_field, ph->ph_root);	\
-	if (ret != NULL) {						\
-		a_type *aux = phn_next_get(a_type, a_field, ret);	\
-		phn_next_set(a_type, a_field, ph->ph_root, aux);	\
-		if (aux != NULL) {					\
-			phn_prev_set(a_type, a_field, aux,		\
-			    ph->ph_root);				\
-		}							\
-		return ret;						\
-	}								\
-	ret = ph->ph_root;						\
-	ph_merge_children(a_type, a_field, ph->ph_root, a_cmp,		\
-	    ph->ph_root);						\
-	return ret;							\
-}									\
-a_attr void								\
-a_prefix##remove(a_ph_type *ph, a_type *phn) {				\
-	a_type *replace, *parent;					\
-									\
-	if (ph->ph_root == phn) {					\
-		/*							\
-		 * We can delete from aux list without merging it, but	\
-		 * we need to merge if we are dealing with the root	\
-		 * node and it has children.				\
-		 */							\
-		if (phn_lchild_get(a_type, a_field, phn) == NULL) {	\
-			ph->ph_root = phn_next_get(a_type, a_field,	\
-			    phn);					\
-			if (ph->ph_root != NULL) {			\
-				phn_prev_set(a_type, a_field,		\
-				    ph->ph_root, NULL);			\
-			}						\
-			return;						\
-		}							\
-		ph_merge_aux(a_type, a_field, ph, a_cmp);		\
-		if (ph->ph_root == phn) {				\
-			ph_merge_children(a_type, a_field, ph->ph_root,	\
-			    a_cmp, ph->ph_root);			\
-			return;						\
-		}							\
-	}								\
-									\
-	/* Get parent (if phn is leftmost child) before mutating. */	\
-	if ((parent = phn_prev_get(a_type, a_field, phn)) != NULL) {	\
-		if (phn_lchild_get(a_type, a_field, parent) != phn) {	\
-			parent = NULL;					\
-		}							\
-	}								\
-	/* Find a possible replacement node, and link to parent. */	\
-	ph_merge_children(a_type, a_field, phn, a_cmp, replace);	\
-	/* Set next/prev for sibling linked list. */			\
-	if (replace != NULL) {						\
-		if (parent != NULL) {					\
-			phn_prev_set(a_type, a_field, replace, parent);	\
-			phn_lchild_set(a_type, a_field, parent,		\
-			    replace);					\
-		} else {						\
-			phn_prev_set(a_type, a_field, replace,		\
-			    phn_prev_get(a_type, a_field, phn));	\
-			if (phn_prev_get(a_type, a_field, phn) !=	\
-			    NULL) {					\
-				phn_next_set(a_type, a_field,		\
-				    phn_prev_get(a_type, a_field, phn),	\
-				    replace);				\
-			}						\
-		}							\
-		phn_next_set(a_type, a_field, replace,			\
-		    phn_next_get(a_type, a_field, phn));		\
-		if (phn_next_get(a_type, a_field, phn) != NULL) {	\
-			phn_prev_set(a_type, a_field,			\
-			    phn_next_get(a_type, a_field, phn),		\
-			    replace);					\
-		}							\
-	} else {							\
-		if (parent != NULL) {					\
-			a_type *next = phn_next_get(a_type, a_field,	\
-			    phn);					\
-			phn_lchild_set(a_type, a_field, parent, next);	\
-			if (next != NULL) {				\
-				phn_prev_set(a_type, a_field, next,	\
-				    parent);				\
-			}						\
-		} else {						\
-			assert(phn_prev_get(a_type, a_field, phn) !=	\
-			    NULL);					\
-			phn_next_set(a_type, a_field,			\
-			    phn_prev_get(a_type, a_field, phn),		\
-			    phn_next_get(a_type, a_field, phn));	\
-		}							\
-		if (phn_next_get(a_type, a_field, phn) != NULL) {	\
-			phn_prev_set(a_type, a_field,			\
-			    phn_next_get(a_type, a_field, phn),		\
-			    phn_prev_get(a_type, a_field, phn));	\
-		}							\
-	}								\
-}
-
-#endif /* PH_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
deleted file mode 100755
index 6ef1346a..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_namespace.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-for symbol in `cat "$@"` ; do
-  echo "#define ${symbol} JEMALLOC_N(${symbol})"
-done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
deleted file mode 100755
index 442a259f..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/private_symbols.sh
+++ /dev/null
@@ -1,51 +0,0 @@
-#!/bin/sh
-#
-# Generate private_symbols[_jet].awk.
-#
-# Usage: private_symbols.sh <sym_prefix> <sym>*
-#
-# <sym_prefix> is typically "" or "_".
-
-sym_prefix=$1
-shift
-
-cat <<EOF
-#!/usr/bin/env awk -f
-
-BEGIN {
-  sym_prefix = "${sym_prefix}"
-  split("\\
-EOF
-
-for public_sym in "$@" ; do
-  cat <<EOF
-        ${sym_prefix}${public_sym} \\
-EOF
-done
-
-cat <<"EOF"
-        ", exported_symbol_names)
-  # Store exported symbol names as keys in exported_symbols.
-  for (i in exported_symbol_names) {
-    exported_symbols[exported_symbol_names[i]] = 1
-  }
-}
-
-# Process 'nm -a <c_source.o>' output.
-#
-# Handle lines like:
-#   0000000000000008 D opt_junk
-#   0000000000007574 T malloc_initialized
-(NF == 3 && $2 ~ /^[ABCDGRSTVW]$/ && !($3 in exported_symbols) && $3 ~ /^[A-Za-z0-9_]+$/) {
-  print substr($3, 1+length(sym_prefix), length($3)-length(sym_prefix))
-}
-
-# Process 'dumpbin /SYMBOLS <c_source.obj>' output.
-#
-# Handle lines like:
-#   353 00008098 SECT4  notype       External     | opt_junk
-#   3F1 00000000 SECT7  notype ()    External     | malloc_initialized
-($3 ~ /^SECT[0-9]+/ && $(NF-2) == "External" && !($NF in exported_symbols)) {
-  print $NF
-}
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
deleted file mode 100644
index 15cc2d18..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prng.h
+++ /dev/null
@@ -1,185 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PRNG_H
-#define JEMALLOC_INTERNAL_PRNG_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/bit_util.h"
-
-/*
- * Simple linear congruential pseudo-random number generator:
- *
- *   prng(y) = (a*x + c) % m
- *
- * where the following constants ensure maximal period:
- *
- *   a == Odd number (relatively prime to 2^n), and (a-1) is a multiple of 4.
- *   c == Odd number (relatively prime to 2^n).
- *   m == 2^32
- *
- * See Knuth's TAOCP 3rd Ed., Vol. 2, pg. 17 for details on these constraints.
- *
- * This choice of m has the disadvantage that the quality of the bits is
- * proportional to bit position.  For example, the lowest bit has a cycle of 2,
- * the next has a cycle of 4, etc.  For this reason, we prefer to use the upper
- * bits.
- */
-
-/******************************************************************************/
-/* INTERNAL DEFINITIONS -- IGNORE */
-/******************************************************************************/
-#define PRNG_A_32	UINT32_C(1103515241)
-#define PRNG_C_32	UINT32_C(12347)
-
-#define PRNG_A_64	UINT64_C(6364136223846793005)
-#define PRNG_C_64	UINT64_C(1442695040888963407)
-
-JEMALLOC_ALWAYS_INLINE uint32_t
-prng_state_next_u32(uint32_t state) {
-	return (state * PRNG_A_32) + PRNG_C_32;
-}
-
-JEMALLOC_ALWAYS_INLINE uint64_t
-prng_state_next_u64(uint64_t state) {
-	return (state * PRNG_A_64) + PRNG_C_64;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-prng_state_next_zu(size_t state) {
-#if LG_SIZEOF_PTR == 2
-	return (state * PRNG_A_32) + PRNG_C_32;
-#elif LG_SIZEOF_PTR == 3
-	return (state * PRNG_A_64) + PRNG_C_64;
-#else
-#error Unsupported pointer size
-#endif
-}
-
-/******************************************************************************/
-/* BEGIN PUBLIC API */
-/******************************************************************************/
-
-/*
- * The prng_lg_range functions give a uniform int in the half-open range [0,
- * 2**lg_range).  If atomic is true, they do so safely from multiple threads.
- * Multithreaded 64-bit prngs aren't supported.
- */
-
-JEMALLOC_ALWAYS_INLINE uint32_t
-prng_lg_range_u32(atomic_u32_t *state, unsigned lg_range, bool atomic) {
-	uint32_t ret, state0, state1;
-
-	assert(lg_range > 0);
-	assert(lg_range <= 32);
-
-	state0 = atomic_load_u32(state, ATOMIC_RELAXED);
-
-	if (atomic) {
-		do {
-			state1 = prng_state_next_u32(state0);
-		} while (!atomic_compare_exchange_weak_u32(state, &state0,
-		    state1, ATOMIC_RELAXED, ATOMIC_RELAXED));
-	} else {
-		state1 = prng_state_next_u32(state0);
-		atomic_store_u32(state, state1, ATOMIC_RELAXED);
-	}
-	ret = state1 >> (32 - lg_range);
-
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE uint64_t
-prng_lg_range_u64(uint64_t *state, unsigned lg_range) {
-	uint64_t ret, state1;
-
-	assert(lg_range > 0);
-	assert(lg_range <= 64);
-
-	state1 = prng_state_next_u64(*state);
-	*state = state1;
-	ret = state1 >> (64 - lg_range);
-
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-prng_lg_range_zu(atomic_zu_t *state, unsigned lg_range, bool atomic) {
-	size_t ret, state0, state1;
-
-	assert(lg_range > 0);
-	assert(lg_range <= ZU(1) << (3 + LG_SIZEOF_PTR));
-
-	state0 = atomic_load_zu(state, ATOMIC_RELAXED);
-
-	if (atomic) {
-		do {
-			state1 = prng_state_next_zu(state0);
-		} while (atomic_compare_exchange_weak_zu(state, &state0,
-		    state1, ATOMIC_RELAXED, ATOMIC_RELAXED));
-	} else {
-		state1 = prng_state_next_zu(state0);
-		atomic_store_zu(state, state1, ATOMIC_RELAXED);
-	}
-	ret = state1 >> ((ZU(1) << (3 + LG_SIZEOF_PTR)) - lg_range);
-
-	return ret;
-}
-
-/*
- * The prng_range functions behave like the prng_lg_range, but return a result
- * in [0, range) instead of [0, 2**lg_range).
- */
-
-JEMALLOC_ALWAYS_INLINE uint32_t
-prng_range_u32(atomic_u32_t *state, uint32_t range, bool atomic) {
-	uint32_t ret;
-	unsigned lg_range;
-
-	assert(range > 1);
-
-	/* Compute the ceiling of lg(range). */
-	lg_range = ffs_u32(pow2_ceil_u32(range)) - 1;
-
-	/* Generate a result in [0..range) via repeated trial. */
-	do {
-		ret = prng_lg_range_u32(state, lg_range, atomic);
-	} while (ret >= range);
-
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE uint64_t
-prng_range_u64(uint64_t *state, uint64_t range) {
-	uint64_t ret;
-	unsigned lg_range;
-
-	assert(range > 1);
-
-	/* Compute the ceiling of lg(range). */
-	lg_range = ffs_u64(pow2_ceil_u64(range)) - 1;
-
-	/* Generate a result in [0..range) via repeated trial. */
-	do {
-		ret = prng_lg_range_u64(state, lg_range);
-	} while (ret >= range);
-
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-prng_range_zu(atomic_zu_t *state, size_t range, bool atomic) {
-	size_t ret;
-	unsigned lg_range;
-
-	assert(range > 1);
-
-	/* Compute the ceiling of lg(range). */
-	lg_range = ffs_u64(pow2_ceil_u64(range)) - 1;
-
-	/* Generate a result in [0..range) via repeated trial. */
-	do {
-		ret = prng_lg_range_zu(state, lg_range, atomic);
-	} while (ret >= range);
-
-	return ret;
-}
-
-#endif /* JEMALLOC_INTERNAL_PRNG_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
deleted file mode 100644
index 04348696..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_externs.h
+++ /dev/null
@@ -1,92 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PROF_EXTERNS_H
-#define JEMALLOC_INTERNAL_PROF_EXTERNS_H
-
-#include "jemalloc/internal/mutex.h"
-
-extern malloc_mutex_t	bt2gctx_mtx;
-
-extern bool	opt_prof;
-extern bool	opt_prof_active;
-extern bool	opt_prof_thread_active_init;
-extern size_t	opt_lg_prof_sample;   /* Mean bytes between samples. */
-extern ssize_t	opt_lg_prof_interval; /* lg(prof_interval). */
-extern bool	opt_prof_gdump;       /* High-water memory dumping. */
-extern bool	opt_prof_final;       /* Final profile dumping. */
-extern bool	opt_prof_leak;        /* Dump leak summary at exit. */
-extern bool	opt_prof_accum;       /* Report cumulative bytes. */
-extern char	opt_prof_prefix[
-    /* Minimize memory bloat for non-prof builds. */
-#ifdef JEMALLOC_PROF
-    PATH_MAX +
-#endif
-    1];
-
-/* Accessed via prof_active_[gs]et{_unlocked,}(). */
-extern bool	prof_active;
-
-/* Accessed via prof_gdump_[gs]et{_unlocked,}(). */
-extern bool	prof_gdump_val;
-
-/*
- * Profile dump interval, measured in bytes allocated.  Each arena triggers a
- * profile dump when it reaches this threshold.  The effect is that the
- * interval between profile dumps averages prof_interval, though the actual
- * interval between dumps will tend to be sporadic, and the interval will be a
- * maximum of approximately (prof_interval * narenas).
- */
-extern uint64_t	prof_interval;
-
-/*
- * Initialized as opt_lg_prof_sample, and potentially modified during profiling
- * resets.
- */
-extern size_t	lg_prof_sample;
-
-void prof_alloc_rollback(tsd_t *tsd, prof_tctx_t *tctx, bool updated);
-void prof_malloc_sample_object(tsdn_t *tsdn, const void *ptr, size_t usize,
-    prof_tctx_t *tctx);
-void prof_free_sampled_object(tsd_t *tsd, size_t usize, prof_tctx_t *tctx);
-void bt_init(prof_bt_t *bt, void **vec);
-void prof_backtrace(prof_bt_t *bt);
-prof_tctx_t *prof_lookup(tsd_t *tsd, prof_bt_t *bt);
-#ifdef JEMALLOC_JET
-size_t prof_tdata_count(void);
-size_t prof_bt_count(void);
-#endif
-typedef int (prof_dump_open_t)(bool, const char *);
-extern prof_dump_open_t *JET_MUTABLE prof_dump_open;
-
-typedef bool (prof_dump_header_t)(tsdn_t *, bool, const prof_cnt_t *);
-extern prof_dump_header_t *JET_MUTABLE prof_dump_header;
-#ifdef JEMALLOC_JET
-void prof_cnt_all(uint64_t *curobjs, uint64_t *curbytes, uint64_t *accumobjs,
-    uint64_t *accumbytes);
-#endif
-bool prof_accum_init(tsdn_t *tsdn, prof_accum_t *prof_accum);
-void prof_idump(tsdn_t *tsdn);
-bool prof_mdump(tsd_t *tsd, const char *filename);
-void prof_gdump(tsdn_t *tsdn);
-prof_tdata_t *prof_tdata_init(tsd_t *tsd);
-prof_tdata_t *prof_tdata_reinit(tsd_t *tsd, prof_tdata_t *tdata);
-void prof_reset(tsd_t *tsd, size_t lg_sample);
-void prof_tdata_cleanup(tsd_t *tsd);
-bool prof_active_get(tsdn_t *tsdn);
-bool prof_active_set(tsdn_t *tsdn, bool active);
-const char *prof_thread_name_get(tsd_t *tsd);
-int prof_thread_name_set(tsd_t *tsd, const char *thread_name);
-bool prof_thread_active_get(tsd_t *tsd);
-bool prof_thread_active_set(tsd_t *tsd, bool active);
-bool prof_thread_active_init_get(tsdn_t *tsdn);
-bool prof_thread_active_init_set(tsdn_t *tsdn, bool active_init);
-bool prof_gdump_get(tsdn_t *tsdn);
-bool prof_gdump_set(tsdn_t *tsdn, bool active);
-void prof_boot0(void);
-void prof_boot1(void);
-bool prof_boot2(tsd_t *tsd);
-void prof_prefork0(tsdn_t *tsdn);
-void prof_prefork1(tsdn_t *tsdn);
-void prof_postfork_parent(tsdn_t *tsdn);
-void prof_postfork_child(tsdn_t *tsdn);
-void prof_sample_threshold_update(prof_tdata_t *tdata);
-
-#endif /* JEMALLOC_INTERNAL_PROF_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
deleted file mode 100644
index a6efb485..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_a.h
+++ /dev/null
@@ -1,83 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PROF_INLINES_A_H
-#define JEMALLOC_INTERNAL_PROF_INLINES_A_H
-
-#include "jemalloc/internal/mutex.h"
-
-static inline bool
-prof_accum_add(tsdn_t *tsdn, prof_accum_t *prof_accum, uint64_t accumbytes) {
-	cassert(config_prof);
-
-	bool overflow;
-	uint64_t a0, a1;
-
-	/*
-	 * If the application allocates fast enough (and/or if idump is slow
-	 * enough), extreme overflow here (a1 >= prof_interval * 2) can cause
-	 * idump trigger coalescing.  This is an intentional mechanism that
-	 * avoids rate-limiting allocation.
-	 */
-#ifdef JEMALLOC_ATOMIC_U64
-	a0 = atomic_load_u64(&prof_accum->accumbytes, ATOMIC_RELAXED);
-	do {
-		a1 = a0 + accumbytes;
-		assert(a1 >= a0);
-		overflow = (a1 >= prof_interval);
-		if (overflow) {
-			a1 %= prof_interval;
-		}
-	} while (!atomic_compare_exchange_weak_u64(&prof_accum->accumbytes, &a0,
-	    a1, ATOMIC_RELAXED, ATOMIC_RELAXED));
-#else
-	malloc_mutex_lock(tsdn, &prof_accum->mtx);
-	a0 = prof_accum->accumbytes;
-	a1 = a0 + accumbytes;
-	overflow = (a1 >= prof_interval);
-	if (overflow) {
-		a1 %= prof_interval;
-	}
-	prof_accum->accumbytes = a1;
-	malloc_mutex_unlock(tsdn, &prof_accum->mtx);
-#endif
-	return overflow;
-}
-
-static inline void
-prof_accum_cancel(tsdn_t *tsdn, prof_accum_t *prof_accum, size_t usize) {
-	cassert(config_prof);
-
-	/*
-	 * Cancel out as much of the excessive prof_accumbytes increase as
-	 * possible without underflowing.  Interval-triggered dumps occur
-	 * slightly more often than intended as a result of incomplete
-	 * canceling.
-	 */
-	uint64_t a0, a1;
-#ifdef JEMALLOC_ATOMIC_U64
-	a0 = atomic_load_u64(&prof_accum->accumbytes, ATOMIC_RELAXED);
-	do {
-		a1 = (a0 >= LARGE_MINCLASS - usize) ?  a0 - (LARGE_MINCLASS -
-		    usize) : 0;
-	} while (!atomic_compare_exchange_weak_u64(&prof_accum->accumbytes, &a0,
-	    a1, ATOMIC_RELAXED, ATOMIC_RELAXED));
-#else
-	malloc_mutex_lock(tsdn, &prof_accum->mtx);
-	a0 = prof_accum->accumbytes;
-	a1 = (a0 >= LARGE_MINCLASS - usize) ?  a0 - (LARGE_MINCLASS - usize) :
-	    0;
-	prof_accum->accumbytes = a1;
-	malloc_mutex_unlock(tsdn, &prof_accum->mtx);
-#endif
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-prof_active_get_unlocked(void) {
-	/*
-	 * Even if opt_prof is true, sampling can be temporarily disabled by
-	 * setting prof_active to false.  No locking is used when reading
-	 * prof_active in the fast path, so there are no guarantees regarding
-	 * how long it will take for all threads to notice state changes.
-	 */
-	return prof_active;
-}
-
-#endif /* JEMALLOC_INTERNAL_PROF_INLINES_A_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
deleted file mode 100644
index 6ff465ad..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_inlines_b.h
+++ /dev/null
@@ -1,206 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PROF_INLINES_B_H
-#define JEMALLOC_INTERNAL_PROF_INLINES_B_H
-
-#include "jemalloc/internal/sz.h"
-
-JEMALLOC_ALWAYS_INLINE bool
-prof_gdump_get_unlocked(void) {
-	/*
-	 * No locking is used when reading prof_gdump_val in the fast path, so
-	 * there are no guarantees regarding how long it will take for all
-	 * threads to notice state changes.
-	 */
-	return prof_gdump_val;
-}
-
-JEMALLOC_ALWAYS_INLINE prof_tdata_t *
-prof_tdata_get(tsd_t *tsd, bool create) {
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	tdata = tsd_prof_tdata_get(tsd);
-	if (create) {
-		if (unlikely(tdata == NULL)) {
-			if (tsd_nominal(tsd)) {
-				tdata = prof_tdata_init(tsd);
-				tsd_prof_tdata_set(tsd, tdata);
-			}
-		} else if (unlikely(tdata->expired)) {
-			tdata = prof_tdata_reinit(tsd, tdata);
-			tsd_prof_tdata_set(tsd, tdata);
-		}
-		assert(tdata == NULL || tdata->attached);
-	}
-
-	return tdata;
-}
-
-JEMALLOC_ALWAYS_INLINE prof_tctx_t *
-prof_tctx_get(tsdn_t *tsdn, const void *ptr, alloc_ctx_t *alloc_ctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	return arena_prof_tctx_get(tsdn, ptr, alloc_ctx);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-prof_tctx_set(tsdn_t *tsdn, const void *ptr, size_t usize,
-    alloc_ctx_t *alloc_ctx, prof_tctx_t *tctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	arena_prof_tctx_set(tsdn, ptr, usize, alloc_ctx, tctx);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-prof_tctx_reset(tsdn_t *tsdn, const void *ptr, prof_tctx_t *tctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	arena_prof_tctx_reset(tsdn, ptr, tctx);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-prof_sample_accum_update(tsd_t *tsd, size_t usize, bool update,
-    prof_tdata_t **tdata_out) {
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	tdata = prof_tdata_get(tsd, true);
-	if (unlikely((uintptr_t)tdata <= (uintptr_t)PROF_TDATA_STATE_MAX)) {
-		tdata = NULL;
-	}
-
-	if (tdata_out != NULL) {
-		*tdata_out = tdata;
-	}
-
-	if (unlikely(tdata == NULL)) {
-		return true;
-	}
-
-	if (likely(tdata->bytes_until_sample >= usize)) {
-		if (update) {
-			tdata->bytes_until_sample -= usize;
-		}
-		return true;
-	} else {
-		if (tsd_reentrancy_level_get(tsd) > 0) {
-			return true;
-		}
-		/* Compute new sample threshold. */
-		if (update) {
-			prof_sample_threshold_update(tdata);
-		}
-		return !tdata->active;
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE prof_tctx_t *
-prof_alloc_prep(tsd_t *tsd, size_t usize, bool prof_active, bool update) {
-	prof_tctx_t *ret;
-	prof_tdata_t *tdata;
-	prof_bt_t bt;
-
-	assert(usize == sz_s2u(usize));
-
-	if (!prof_active || likely(prof_sample_accum_update(tsd, usize, update,
-	    &tdata))) {
-		ret = (prof_tctx_t *)(uintptr_t)1U;
-	} else {
-		bt_init(&bt, tdata->vec);
-		prof_backtrace(&bt);
-		ret = prof_lookup(tsd, &bt);
-	}
-
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-prof_malloc(tsdn_t *tsdn, const void *ptr, size_t usize, alloc_ctx_t *alloc_ctx,
-    prof_tctx_t *tctx) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-	assert(usize == isalloc(tsdn, ptr));
-
-	if (unlikely((uintptr_t)tctx > (uintptr_t)1U)) {
-		prof_malloc_sample_object(tsdn, ptr, usize, tctx);
-	} else {
-		prof_tctx_set(tsdn, ptr, usize, alloc_ctx,
-		    (prof_tctx_t *)(uintptr_t)1U);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-prof_realloc(tsd_t *tsd, const void *ptr, size_t usize, prof_tctx_t *tctx,
-    bool prof_active, bool updated, const void *old_ptr, size_t old_usize,
-    prof_tctx_t *old_tctx) {
-	bool sampled, old_sampled, moved;
-
-	cassert(config_prof);
-	assert(ptr != NULL || (uintptr_t)tctx <= (uintptr_t)1U);
-
-	if (prof_active && !updated && ptr != NULL) {
-		assert(usize == isalloc(tsd_tsdn(tsd), ptr));
-		if (prof_sample_accum_update(tsd, usize, true, NULL)) {
-			/*
-			 * Don't sample.  The usize passed to prof_alloc_prep()
-			 * was larger than what actually got allocated, so a
-			 * backtrace was captured for this allocation, even
-			 * though its actual usize was insufficient to cross the
-			 * sample threshold.
-			 */
-			prof_alloc_rollback(tsd, tctx, true);
-			tctx = (prof_tctx_t *)(uintptr_t)1U;
-		}
-	}
-
-	sampled = ((uintptr_t)tctx > (uintptr_t)1U);
-	old_sampled = ((uintptr_t)old_tctx > (uintptr_t)1U);
-	moved = (ptr != old_ptr);
-
-	if (unlikely(sampled)) {
-		prof_malloc_sample_object(tsd_tsdn(tsd), ptr, usize, tctx);
-	} else if (moved) {
-		prof_tctx_set(tsd_tsdn(tsd), ptr, usize, NULL,
-		    (prof_tctx_t *)(uintptr_t)1U);
-	} else if (unlikely(old_sampled)) {
-		/*
-		 * prof_tctx_set() would work for the !moved case as well, but
-		 * prof_tctx_reset() is slightly cheaper, and the proper thing
-		 * to do here in the presence of explicit knowledge re: moved
-		 * state.
-		 */
-		prof_tctx_reset(tsd_tsdn(tsd), ptr, tctx);
-	} else {
-		assert((uintptr_t)prof_tctx_get(tsd_tsdn(tsd), ptr, NULL) ==
-		    (uintptr_t)1U);
-	}
-
-	/*
-	 * The prof_free_sampled_object() call must come after the
-	 * prof_malloc_sample_object() call, because tctx and old_tctx may be
-	 * the same, in which case reversing the call order could cause the tctx
-	 * to be prematurely destroyed as a side effect of momentarily zeroed
-	 * counters.
-	 */
-	if (unlikely(old_sampled)) {
-		prof_free_sampled_object(tsd, old_usize, old_tctx);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-prof_free(tsd_t *tsd, const void *ptr, size_t usize, alloc_ctx_t *alloc_ctx) {
-	prof_tctx_t *tctx = prof_tctx_get(tsd_tsdn(tsd), ptr, alloc_ctx);
-
-	cassert(config_prof);
-	assert(usize == isalloc(tsd_tsdn(tsd), ptr));
-
-	if (unlikely((uintptr_t)tctx > (uintptr_t)1U)) {
-		prof_free_sampled_object(tsd, usize, tctx);
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_PROF_INLINES_B_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
deleted file mode 100644
index 0d58ae10..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_structs.h
+++ /dev/null
@@ -1,201 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PROF_STRUCTS_H
-#define JEMALLOC_INTERNAL_PROF_STRUCTS_H
-
-#include "jemalloc/internal/ckh.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/prng.h"
-#include "jemalloc/internal/rb.h"
-
-struct prof_bt_s {
-	/* Backtrace, stored as len program counters. */
-	void		**vec;
-	unsigned	len;
-};
-
-#ifdef JEMALLOC_PROF_LIBGCC
-/* Data structure passed to libgcc _Unwind_Backtrace() callback functions. */
-typedef struct {
-	prof_bt_t	*bt;
-	unsigned	max;
-} prof_unwind_data_t;
-#endif
-
-struct prof_accum_s {
-#ifndef JEMALLOC_ATOMIC_U64
-	malloc_mutex_t	mtx;
-	uint64_t	accumbytes;
-#else
-	atomic_u64_t	accumbytes;
-#endif
-};
-
-struct prof_cnt_s {
-	/* Profiling counters. */
-	uint64_t	curobjs;
-	uint64_t	curbytes;
-	uint64_t	accumobjs;
-	uint64_t	accumbytes;
-};
-
-typedef enum {
-	prof_tctx_state_initializing,
-	prof_tctx_state_nominal,
-	prof_tctx_state_dumping,
-	prof_tctx_state_purgatory /* Dumper must finish destroying. */
-} prof_tctx_state_t;
-
-struct prof_tctx_s {
-	/* Thread data for thread that performed the allocation. */
-	prof_tdata_t		*tdata;
-
-	/*
-	 * Copy of tdata->thr_{uid,discrim}, necessary because tdata may be
-	 * defunct during teardown.
-	 */
-	uint64_t		thr_uid;
-	uint64_t		thr_discrim;
-
-	/* Profiling counters, protected by tdata->lock. */
-	prof_cnt_t		cnts;
-
-	/* Associated global context. */
-	prof_gctx_t		*gctx;
-
-	/*
-	 * UID that distinguishes multiple tctx's created by the same thread,
-	 * but coexisting in gctx->tctxs.  There are two ways that such
-	 * coexistence can occur:
-	 * - A dumper thread can cause a tctx to be retained in the purgatory
-	 *   state.
-	 * - Although a single "producer" thread must create all tctx's which
-	 *   share the same thr_uid, multiple "consumers" can each concurrently
-	 *   execute portions of prof_tctx_destroy().  prof_tctx_destroy() only
-	 *   gets called once each time cnts.cur{objs,bytes} drop to 0, but this
-	 *   threshold can be hit again before the first consumer finishes
-	 *   executing prof_tctx_destroy().
-	 */
-	uint64_t		tctx_uid;
-
-	/* Linkage into gctx's tctxs. */
-	rb_node(prof_tctx_t)	tctx_link;
-
-	/*
-	 * True during prof_alloc_prep()..prof_malloc_sample_object(), prevents
-	 * sample vs destroy race.
-	 */
-	bool			prepared;
-
-	/* Current dump-related state, protected by gctx->lock. */
-	prof_tctx_state_t	state;
-
-	/*
-	 * Copy of cnts snapshotted during early dump phase, protected by
-	 * dump_mtx.
-	 */
-	prof_cnt_t		dump_cnts;
-};
-typedef rb_tree(prof_tctx_t) prof_tctx_tree_t;
-
-struct prof_gctx_s {
-	/* Protects nlimbo, cnt_summed, and tctxs. */
-	malloc_mutex_t		*lock;
-
-	/*
-	 * Number of threads that currently cause this gctx to be in a state of
-	 * limbo due to one of:
-	 *   - Initializing this gctx.
-	 *   - Initializing per thread counters associated with this gctx.
-	 *   - Preparing to destroy this gctx.
-	 *   - Dumping a heap profile that includes this gctx.
-	 * nlimbo must be 1 (single destroyer) in order to safely destroy the
-	 * gctx.
-	 */
-	unsigned		nlimbo;
-
-	/*
-	 * Tree of profile counters, one for each thread that has allocated in
-	 * this context.
-	 */
-	prof_tctx_tree_t	tctxs;
-
-	/* Linkage for tree of contexts to be dumped. */
-	rb_node(prof_gctx_t)	dump_link;
-
-	/* Temporary storage for summation during dump. */
-	prof_cnt_t		cnt_summed;
-
-	/* Associated backtrace. */
-	prof_bt_t		bt;
-
-	/* Backtrace vector, variable size, referred to by bt. */
-	void			*vec[1];
-};
-typedef rb_tree(prof_gctx_t) prof_gctx_tree_t;
-
-struct prof_tdata_s {
-	malloc_mutex_t		*lock;
-
-	/* Monotonically increasing unique thread identifier. */
-	uint64_t		thr_uid;
-
-	/*
-	 * Monotonically increasing discriminator among tdata structures
-	 * associated with the same thr_uid.
-	 */
-	uint64_t		thr_discrim;
-
-	/* Included in heap profile dumps if non-NULL. */
-	char			*thread_name;
-
-	bool			attached;
-	bool			expired;
-
-	rb_node(prof_tdata_t)	tdata_link;
-
-	/*
-	 * Counter used to initialize prof_tctx_t's tctx_uid.  No locking is
-	 * necessary when incrementing this field, because only one thread ever
-	 * does so.
-	 */
-	uint64_t		tctx_uid_next;
-
-	/*
-	 * Hash of (prof_bt_t *)-->(prof_tctx_t *).  Each thread tracks
-	 * backtraces for which it has non-zero allocation/deallocation counters
-	 * associated with thread-specific prof_tctx_t objects.  Other threads
-	 * may write to prof_tctx_t contents when freeing associated objects.
-	 */
-	ckh_t			bt2tctx;
-
-	/* Sampling state. */
-	uint64_t		prng_state;
-	uint64_t		bytes_until_sample;
-
-	/* State used to avoid dumping while operating on prof internals. */
-	bool			enq;
-	bool			enq_idump;
-	bool			enq_gdump;
-
-	/*
-	 * Set to true during an early dump phase for tdata's which are
-	 * currently being dumped.  New threads' tdata's have this initialized
-	 * to false so that they aren't accidentally included in later dump
-	 * phases.
-	 */
-	bool			dumping;
-
-	/*
-	 * True if profiling is active for this tdata's thread
-	 * (thread.prof.active mallctl).
-	 */
-	bool			active;
-
-	/* Temporary storage for summation during dump. */
-	prof_cnt_t		cnt_summed;
-
-	/* Backtrace vector, used for calls to prof_backtrace(). */
-	void			*vec[PROF_BT_MAX];
-};
-typedef rb_tree(prof_tdata_t) prof_tdata_tree_t;
-
-#endif /* JEMALLOC_INTERNAL_PROF_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
deleted file mode 100644
index 1eff995e..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/prof_types.h
+++ /dev/null
@@ -1,56 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_PROF_TYPES_H
-#define JEMALLOC_INTERNAL_PROF_TYPES_H
-
-typedef struct prof_bt_s prof_bt_t;
-typedef struct prof_accum_s prof_accum_t;
-typedef struct prof_cnt_s prof_cnt_t;
-typedef struct prof_tctx_s prof_tctx_t;
-typedef struct prof_gctx_s prof_gctx_t;
-typedef struct prof_tdata_s prof_tdata_t;
-
-/* Option defaults. */
-#ifdef JEMALLOC_PROF
-#  define PROF_PREFIX_DEFAULT		"jeprof"
-#else
-#  define PROF_PREFIX_DEFAULT		""
-#endif
-#define LG_PROF_SAMPLE_DEFAULT		19
-#define LG_PROF_INTERVAL_DEFAULT	-1
-
-/*
- * Hard limit on stack backtrace depth.  The version of prof_backtrace() that
- * is based on __builtin_return_address() necessarily has a hard-coded number
- * of backtrace frame handlers, and should be kept in sync with this setting.
- */
-#define PROF_BT_MAX			128
-
-/* Initial hash table size. */
-#define PROF_CKH_MINITEMS		64
-
-/* Size of memory buffer to use when writing dump files. */
-#define PROF_DUMP_BUFSIZE		65536
-
-/* Size of stack-allocated buffer used by prof_printf(). */
-#define PROF_PRINTF_BUFSIZE		128
-
-/*
- * Number of mutexes shared among all gctx's.  No space is allocated for these
- * unless profiling is enabled, so it's okay to over-provision.
- */
-#define PROF_NCTX_LOCKS			1024
-
-/*
- * Number of mutexes shared among all tdata's.  No space is allocated for these
- * unless profiling is enabled, so it's okay to over-provision.
- */
-#define PROF_NTDATA_LOCKS		256
-
-/*
- * prof_tdata pointers close to NULL are used to encode state information that
- * is used for cleaning up during thread shutdown.
- */
-#define PROF_TDATA_STATE_REINCARNATED	((prof_tdata_t *)(uintptr_t)1)
-#define PROF_TDATA_STATE_PURGATORY	((prof_tdata_t *)(uintptr_t)2)
-#define PROF_TDATA_STATE_MAX		PROF_TDATA_STATE_PURGATORY
-
-#endif /* JEMALLOC_INTERNAL_PROF_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
deleted file mode 100755
index 4d415ba0..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_namespace.sh
+++ /dev/null
@@ -1,6 +0,0 @@
-#!/bin/sh
-
-for nm in `cat $1` ; do
-  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
-  echo "#define je_${n} JEMALLOC_N(${n})"
-done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
deleted file mode 100755
index 4239d177..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/public_unnamespace.sh
+++ /dev/null
@@ -1,6 +0,0 @@
-#!/bin/sh
-
-for nm in `cat $1` ; do
-  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
-  echo "#undef je_${n}"
-done
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
deleted file mode 100644
index 80290407..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/ql.h
+++ /dev/null
@@ -1,88 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_QL_H
-#define JEMALLOC_INTERNAL_QL_H
-
-#include "jemalloc/internal/qr.h"
-
-/* List definitions. */
-#define ql_head(a_type)							\
-struct {								\
-	a_type *qlh_first;						\
-}
-
-#define ql_head_initializer(a_head) {NULL}
-
-#define ql_elm(a_type)	qr(a_type)
-
-/* List functions. */
-#define ql_new(a_head) do {						\
-	(a_head)->qlh_first = NULL;					\
-} while (0)
-
-#define ql_elm_new(a_elm, a_field) qr_new((a_elm), a_field)
-
-#define ql_first(a_head) ((a_head)->qlh_first)
-
-#define ql_last(a_head, a_field)					\
-	((ql_first(a_head) != NULL)					\
-	    ? qr_prev(ql_first(a_head), a_field) : NULL)
-
-#define ql_next(a_head, a_elm, a_field)					\
-	((ql_last(a_head, a_field) != (a_elm))				\
-	    ? qr_next((a_elm), a_field)	: NULL)
-
-#define ql_prev(a_head, a_elm, a_field)					\
-	((ql_first(a_head) != (a_elm)) ? qr_prev((a_elm), a_field)	\
-				       : NULL)
-
-#define ql_before_insert(a_head, a_qlelm, a_elm, a_field) do {		\
-	qr_before_insert((a_qlelm), (a_elm), a_field);			\
-	if (ql_first(a_head) == (a_qlelm)) {				\
-		ql_first(a_head) = (a_elm);				\
-	}								\
-} while (0)
-
-#define ql_after_insert(a_qlelm, a_elm, a_field)			\
-	qr_after_insert((a_qlelm), (a_elm), a_field)
-
-#define ql_head_insert(a_head, a_elm, a_field) do {			\
-	if (ql_first(a_head) != NULL) {					\
-		qr_before_insert(ql_first(a_head), (a_elm), a_field);	\
-	}								\
-	ql_first(a_head) = (a_elm);					\
-} while (0)
-
-#define ql_tail_insert(a_head, a_elm, a_field) do {			\
-	if (ql_first(a_head) != NULL) {					\
-		qr_before_insert(ql_first(a_head), (a_elm), a_field);	\
-	}								\
-	ql_first(a_head) = qr_next((a_elm), a_field);			\
-} while (0)
-
-#define ql_remove(a_head, a_elm, a_field) do {				\
-	if (ql_first(a_head) == (a_elm)) {				\
-		ql_first(a_head) = qr_next(ql_first(a_head), a_field);	\
-	}								\
-	if (ql_first(a_head) != (a_elm)) {				\
-		qr_remove((a_elm), a_field);				\
-	} else {							\
-		ql_first(a_head) = NULL;				\
-	}								\
-} while (0)
-
-#define ql_head_remove(a_head, a_type, a_field) do {			\
-	a_type *t = ql_first(a_head);					\
-	ql_remove((a_head), t, a_field);				\
-} while (0)
-
-#define ql_tail_remove(a_head, a_type, a_field) do {			\
-	a_type *t = ql_last(a_head, a_field);				\
-	ql_remove((a_head), t, a_field);				\
-} while (0)
-
-#define ql_foreach(a_var, a_head, a_field)				\
-	qr_foreach((a_var), ql_first(a_head), a_field)
-
-#define ql_reverse_foreach(a_var, a_head, a_field)			\
-	qr_reverse_foreach((a_var), ql_first(a_head), a_field)
-
-#endif /* JEMALLOC_INTERNAL_QL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
deleted file mode 100644
index 1e1056b3..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/qr.h
+++ /dev/null
@@ -1,72 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_QR_H
-#define JEMALLOC_INTERNAL_QR_H
-
-/* Ring definitions. */
-#define qr(a_type)							\
-struct {								\
-	a_type	*qre_next;						\
-	a_type	*qre_prev;						\
-}
-
-/* Ring functions. */
-#define qr_new(a_qr, a_field) do {					\
-	(a_qr)->a_field.qre_next = (a_qr);				\
-	(a_qr)->a_field.qre_prev = (a_qr);				\
-} while (0)
-
-#define qr_next(a_qr, a_field) ((a_qr)->a_field.qre_next)
-
-#define qr_prev(a_qr, a_field) ((a_qr)->a_field.qre_prev)
-
-#define qr_before_insert(a_qrelm, a_qr, a_field) do {			\
-	(a_qr)->a_field.qre_prev = (a_qrelm)->a_field.qre_prev;		\
-	(a_qr)->a_field.qre_next = (a_qrelm);				\
-	(a_qr)->a_field.qre_prev->a_field.qre_next = (a_qr);		\
-	(a_qrelm)->a_field.qre_prev = (a_qr);				\
-} while (0)
-
-#define qr_after_insert(a_qrelm, a_qr, a_field) do {			\
-	(a_qr)->a_field.qre_next = (a_qrelm)->a_field.qre_next;		\
-	(a_qr)->a_field.qre_prev = (a_qrelm);				\
-	(a_qr)->a_field.qre_next->a_field.qre_prev = (a_qr);		\
-	(a_qrelm)->a_field.qre_next = (a_qr);				\
-} while (0)
-
-#define qr_meld(a_qr_a, a_qr_b, a_type, a_field) do {			\
-	a_type *t;							\
-	(a_qr_a)->a_field.qre_prev->a_field.qre_next = (a_qr_b);	\
-	(a_qr_b)->a_field.qre_prev->a_field.qre_next = (a_qr_a);	\
-	t = (a_qr_a)->a_field.qre_prev;					\
-	(a_qr_a)->a_field.qre_prev = (a_qr_b)->a_field.qre_prev;	\
-	(a_qr_b)->a_field.qre_prev = t;					\
-} while (0)
-
-/*
- * qr_meld() and qr_split() are functionally equivalent, so there's no need to
- * have two copies of the code.
- */
-#define qr_split(a_qr_a, a_qr_b, a_type, a_field)			\
-	qr_meld((a_qr_a), (a_qr_b), a_type, a_field)
-
-#define qr_remove(a_qr, a_field) do {					\
-	(a_qr)->a_field.qre_prev->a_field.qre_next			\
-	    = (a_qr)->a_field.qre_next;					\
-	(a_qr)->a_field.qre_next->a_field.qre_prev			\
-	    = (a_qr)->a_field.qre_prev;					\
-	(a_qr)->a_field.qre_next = (a_qr);				\
-	(a_qr)->a_field.qre_prev = (a_qr);				\
-} while (0)
-
-#define qr_foreach(var, a_qr, a_field)					\
-	for ((var) = (a_qr);						\
-	    (var) != NULL;						\
-	    (var) = (((var)->a_field.qre_next != (a_qr))		\
-	    ? (var)->a_field.qre_next : NULL))
-
-#define qr_reverse_foreach(var, a_qr, a_field)				\
-	for ((var) = ((a_qr) != NULL) ? qr_prev(a_qr, a_field) : NULL;	\
-	    (var) != NULL;						\
-	    (var) = (((var) != (a_qr))					\
-	    ? (var)->a_field.qre_prev : NULL))
-
-#endif /* JEMALLOC_INTERNAL_QR_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
deleted file mode 100644
index 47fa5ca9..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/rb.h
+++ /dev/null
@@ -1,1006 +0,0 @@
-/*-
- *******************************************************************************
- *
- * cpp macro implementation of left-leaning 2-3 red-black trees.  Parent
- * pointers are not used, and color bits are stored in the least significant
- * bit of right-child pointers (if RB_COMPACT is defined), thus making node
- * linkage as compact as is possible for red-black trees.
- *
- * Usage:
- *
- *   #include <stdint.h>
- *   #include <stdbool.h>
- *   #define NDEBUG // (Optional, see assert(3).)
- *   #include <assert.h>
- *   #define RB_COMPACT // (Optional, embed color bits in right-child pointers.)
- *   #include <rb.h>
- *   ...
- *
- *******************************************************************************
- */
-
-#ifndef RB_H_
-#define RB_H_
-
-#ifndef __PGI
-#define RB_COMPACT
-#endif
-
-#ifdef RB_COMPACT
-/* Node structure. */
-#define rb_node(a_type)							\
-struct {								\
-    a_type *rbn_left;							\
-    a_type *rbn_right_red;						\
-}
-#else
-#define rb_node(a_type)							\
-struct {								\
-    a_type *rbn_left;							\
-    a_type *rbn_right;							\
-    bool rbn_red;							\
-}
-#endif
-
-/* Root structure. */
-#define rb_tree(a_type)							\
-struct {								\
-    a_type *rbt_root;							\
-}
-
-/* Left accessors. */
-#define rbtn_left_get(a_type, a_field, a_node)				\
-    ((a_node)->a_field.rbn_left)
-#define rbtn_left_set(a_type, a_field, a_node, a_left) do {		\
-    (a_node)->a_field.rbn_left = a_left;				\
-} while (0)
-
-#ifdef RB_COMPACT
-/* Right accessors. */
-#define rbtn_right_get(a_type, a_field, a_node)				\
-    ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red)		\
-      & ((ssize_t)-2)))
-#define rbtn_right_set(a_type, a_field, a_node, a_right) do {		\
-    (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right)	\
-      | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1)));	\
-} while (0)
-
-/* Color accessors. */
-#define rbtn_red_get(a_type, a_field, a_node)				\
-    ((bool) (((uintptr_t) (a_node)->a_field.rbn_right_red)		\
-      & ((size_t)1)))
-#define rbtn_color_set(a_type, a_field, a_node, a_red) do {		\
-    (a_node)->a_field.rbn_right_red = (a_type *) ((((intptr_t)		\
-      (a_node)->a_field.rbn_right_red) & ((ssize_t)-2))			\
-      | ((ssize_t)a_red));						\
-} while (0)
-#define rbtn_red_set(a_type, a_field, a_node) do {			\
-    (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t)		\
-      (a_node)->a_field.rbn_right_red) | ((size_t)1));			\
-} while (0)
-#define rbtn_black_set(a_type, a_field, a_node) do {			\
-    (a_node)->a_field.rbn_right_red = (a_type *) (((intptr_t)		\
-      (a_node)->a_field.rbn_right_red) & ((ssize_t)-2));		\
-} while (0)
-
-/* Node initializer. */
-#define rbt_node_new(a_type, a_field, a_rbt, a_node) do {		\
-    /* Bookkeeping bit cannot be used by node pointer. */		\
-    assert(((uintptr_t)(a_node) & 0x1) == 0);				\
-    rbtn_left_set(a_type, a_field, (a_node), NULL);	\
-    rbtn_right_set(a_type, a_field, (a_node), NULL);	\
-    rbtn_red_set(a_type, a_field, (a_node));				\
-} while (0)
-#else
-/* Right accessors. */
-#define rbtn_right_get(a_type, a_field, a_node)				\
-    ((a_node)->a_field.rbn_right)
-#define rbtn_right_set(a_type, a_field, a_node, a_right) do {		\
-    (a_node)->a_field.rbn_right = a_right;				\
-} while (0)
-
-/* Color accessors. */
-#define rbtn_red_get(a_type, a_field, a_node)				\
-    ((a_node)->a_field.rbn_red)
-#define rbtn_color_set(a_type, a_field, a_node, a_red) do {		\
-    (a_node)->a_field.rbn_red = (a_red);				\
-} while (0)
-#define rbtn_red_set(a_type, a_field, a_node) do {			\
-    (a_node)->a_field.rbn_red = true;					\
-} while (0)
-#define rbtn_black_set(a_type, a_field, a_node) do {			\
-    (a_node)->a_field.rbn_red = false;					\
-} while (0)
-
-/* Node initializer. */
-#define rbt_node_new(a_type, a_field, a_rbt, a_node) do {		\
-    rbtn_left_set(a_type, a_field, (a_node), NULL);	\
-    rbtn_right_set(a_type, a_field, (a_node), NULL);	\
-    rbtn_red_set(a_type, a_field, (a_node));				\
-} while (0)
-#endif
-
-/* Tree initializer. */
-#define rb_new(a_type, a_field, a_rbt) do {				\
-    (a_rbt)->rbt_root = NULL;						\
-} while (0)
-
-/* Internal utility macros. */
-#define rbtn_first(a_type, a_field, a_rbt, a_root, r_node) do {		\
-    (r_node) = (a_root);						\
-    if ((r_node) != NULL) {						\
-	for (;								\
-	  rbtn_left_get(a_type, a_field, (r_node)) != NULL;		\
-	  (r_node) = rbtn_left_get(a_type, a_field, (r_node))) {	\
-	}								\
-    }									\
-} while (0)
-
-#define rbtn_last(a_type, a_field, a_rbt, a_root, r_node) do {		\
-    (r_node) = (a_root);						\
-    if ((r_node) != NULL) {						\
-	for (; rbtn_right_get(a_type, a_field, (r_node)) != NULL;	\
-	  (r_node) = rbtn_right_get(a_type, a_field, (r_node))) {	\
-	}								\
-    }									\
-} while (0)
-
-#define rbtn_rotate_left(a_type, a_field, a_node, r_node) do {		\
-    (r_node) = rbtn_right_get(a_type, a_field, (a_node));		\
-    rbtn_right_set(a_type, a_field, (a_node),				\
-      rbtn_left_get(a_type, a_field, (r_node)));			\
-    rbtn_left_set(a_type, a_field, (r_node), (a_node));			\
-} while (0)
-
-#define rbtn_rotate_right(a_type, a_field, a_node, r_node) do {		\
-    (r_node) = rbtn_left_get(a_type, a_field, (a_node));		\
-    rbtn_left_set(a_type, a_field, (a_node),				\
-      rbtn_right_get(a_type, a_field, (r_node)));			\
-    rbtn_right_set(a_type, a_field, (r_node), (a_node));		\
-} while (0)
-
-/*
- * The rb_proto() macro generates function prototypes that correspond to the
- * functions generated by an equivalently parameterized call to rb_gen().
- */
-
-#define rb_proto(a_attr, a_prefix, a_rbt_type, a_type)			\
-a_attr void								\
-a_prefix##new(a_rbt_type *rbtree);					\
-a_attr bool								\
-a_prefix##empty(a_rbt_type *rbtree);					\
-a_attr a_type *								\
-a_prefix##first(a_rbt_type *rbtree);					\
-a_attr a_type *								\
-a_prefix##last(a_rbt_type *rbtree);					\
-a_attr a_type *								\
-a_prefix##next(a_rbt_type *rbtree, a_type *node);			\
-a_attr a_type *								\
-a_prefix##prev(a_rbt_type *rbtree, a_type *node);			\
-a_attr a_type *								\
-a_prefix##search(a_rbt_type *rbtree, const a_type *key);		\
-a_attr a_type *								\
-a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key);		\
-a_attr a_type *								\
-a_prefix##psearch(a_rbt_type *rbtree, const a_type *key);		\
-a_attr void								\
-a_prefix##insert(a_rbt_type *rbtree, a_type *node);			\
-a_attr void								\
-a_prefix##remove(a_rbt_type *rbtree, a_type *node);			\
-a_attr a_type *								\
-a_prefix##iter(a_rbt_type *rbtree, a_type *start, a_type *(*cb)(	\
-  a_rbt_type *, a_type *, void *), void *arg);				\
-a_attr a_type *								\
-a_prefix##reverse_iter(a_rbt_type *rbtree, a_type *start,		\
-  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg);		\
-a_attr void								\
-a_prefix##destroy(a_rbt_type *rbtree, void (*cb)(a_type *, void *),	\
-  void *arg);
-
-/*
- * The rb_gen() macro generates a type-specific red-black tree implementation,
- * based on the above cpp macros.
- *
- * Arguments:
- *
- *   a_attr    : Function attribute for generated functions (ex: static).
- *   a_prefix  : Prefix for generated functions (ex: ex_).
- *   a_rb_type : Type for red-black tree data structure (ex: ex_t).
- *   a_type    : Type for red-black tree node data structure (ex: ex_node_t).
- *   a_field   : Name of red-black tree node linkage (ex: ex_link).
- *   a_cmp     : Node comparison function name, with the following prototype:
- *                 int (a_cmp *)(a_type *a_node, a_type *a_other);
- *                                       ^^^^^^
- *                                    or a_key
- *               Interpretation of comparison function return values:
- *                 -1 : a_node <  a_other
- *                  0 : a_node == a_other
- *                  1 : a_node >  a_other
- *               In all cases, the a_node or a_key macro argument is the first
- *               argument to the comparison function, which makes it possible
- *               to write comparison functions that treat the first argument
- *               specially.
- *
- * Assuming the following setup:
- *
- *   typedef struct ex_node_s ex_node_t;
- *   struct ex_node_s {
- *       rb_node(ex_node_t) ex_link;
- *   };
- *   typedef rb_tree(ex_node_t) ex_t;
- *   rb_gen(static, ex_, ex_t, ex_node_t, ex_link, ex_cmp)
- *
- * The following API is generated:
- *
- *   static void
- *   ex_new(ex_t *tree);
- *       Description: Initialize a red-black tree structure.
- *       Args:
- *         tree: Pointer to an uninitialized red-black tree object.
- *
- *   static bool
- *   ex_empty(ex_t *tree);
- *       Description: Determine whether tree is empty.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *       Ret: True if tree is empty, false otherwise.
- *
- *   static ex_node_t *
- *   ex_first(ex_t *tree);
- *   static ex_node_t *
- *   ex_last(ex_t *tree);
- *       Description: Get the first/last node in tree.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *       Ret: First/last node in tree, or NULL if tree is empty.
- *
- *   static ex_node_t *
- *   ex_next(ex_t *tree, ex_node_t *node);
- *   static ex_node_t *
- *   ex_prev(ex_t *tree, ex_node_t *node);
- *       Description: Get node's successor/predecessor.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         node: A node in tree.
- *       Ret: node's successor/predecessor in tree, or NULL if node is
- *            last/first.
- *
- *   static ex_node_t *
- *   ex_search(ex_t *tree, const ex_node_t *key);
- *       Description: Search for node that matches key.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         key : Search key.
- *       Ret: Node in tree that matches key, or NULL if no match.
- *
- *   static ex_node_t *
- *   ex_nsearch(ex_t *tree, const ex_node_t *key);
- *   static ex_node_t *
- *   ex_psearch(ex_t *tree, const ex_node_t *key);
- *       Description: Search for node that matches key.  If no match is found,
- *                    return what would be key's successor/predecessor, were
- *                    key in tree.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         key : Search key.
- *       Ret: Node in tree that matches key, or if no match, hypothetical node's
- *            successor/predecessor (NULL if no successor/predecessor).
- *
- *   static void
- *   ex_insert(ex_t *tree, ex_node_t *node);
- *       Description: Insert node into tree.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         node: Node to be inserted into tree.
- *
- *   static void
- *   ex_remove(ex_t *tree, ex_node_t *node);
- *       Description: Remove node from tree.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         node: Node in tree to be removed.
- *
- *   static ex_node_t *
- *   ex_iter(ex_t *tree, ex_node_t *start, ex_node_t *(*cb)(ex_t *,
- *     ex_node_t *, void *), void *arg);
- *   static ex_node_t *
- *   ex_reverse_iter(ex_t *tree, ex_node_t *start, ex_node *(*cb)(ex_t *,
- *     ex_node_t *, void *), void *arg);
- *       Description: Iterate forward/backward over tree, starting at node.  If
- *                    tree is modified, iteration must be immediately
- *                    terminated by the callback function that causes the
- *                    modification.
- *       Args:
- *         tree : Pointer to an initialized red-black tree object.
- *         start: Node at which to start iteration, or NULL to start at
- *                first/last node.
- *         cb   : Callback function, which is called for each node during
- *                iteration.  Under normal circumstances the callback function
- *                should return NULL, which causes iteration to continue.  If a
- *                callback function returns non-NULL, iteration is immediately
- *                terminated and the non-NULL return value is returned by the
- *                iterator.  This is useful for re-starting iteration after
- *                modifying tree.
- *         arg  : Opaque pointer passed to cb().
- *       Ret: NULL if iteration completed, or the non-NULL callback return value
- *            that caused termination of the iteration.
- *
- *   static void
- *   ex_destroy(ex_t *tree, void (*cb)(ex_node_t *, void *), void *arg);
- *       Description: Iterate over the tree with post-order traversal, remove
- *                    each node, and run the callback if non-null.  This is
- *                    used for destroying a tree without paying the cost to
- *                    rebalance it.  The tree must not be otherwise altered
- *                    during traversal.
- *       Args:
- *         tree: Pointer to an initialized red-black tree object.
- *         cb  : Callback function, which, if non-null, is called for each node
- *               during iteration.  There is no way to stop iteration once it
- *               has begun.
- *         arg : Opaque pointer passed to cb().
- */
-#define rb_gen(a_attr, a_prefix, a_rbt_type, a_type, a_field, a_cmp)	\
-a_attr void								\
-a_prefix##new(a_rbt_type *rbtree) {					\
-    rb_new(a_type, a_field, rbtree);					\
-}									\
-a_attr bool								\
-a_prefix##empty(a_rbt_type *rbtree) {					\
-    return (rbtree->rbt_root == NULL);					\
-}									\
-a_attr a_type *								\
-a_prefix##first(a_rbt_type *rbtree) {					\
-    a_type *ret;							\
-    rbtn_first(a_type, a_field, rbtree, rbtree->rbt_root, ret);		\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##last(a_rbt_type *rbtree) {					\
-    a_type *ret;							\
-    rbtn_last(a_type, a_field, rbtree, rbtree->rbt_root, ret);		\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##next(a_rbt_type *rbtree, a_type *node) {			\
-    a_type *ret;							\
-    if (rbtn_right_get(a_type, a_field, node) != NULL) {		\
-	rbtn_first(a_type, a_field, rbtree, rbtn_right_get(a_type,	\
-	  a_field, node), ret);						\
-    } else {								\
-	a_type *tnode = rbtree->rbt_root;				\
-	assert(tnode != NULL);						\
-	ret = NULL;							\
-	while (true) {							\
-	    int cmp = (a_cmp)(node, tnode);				\
-	    if (cmp < 0) {						\
-		ret = tnode;						\
-		tnode = rbtn_left_get(a_type, a_field, tnode);		\
-	    } else if (cmp > 0) {					\
-		tnode = rbtn_right_get(a_type, a_field, tnode);		\
-	    } else {							\
-		break;							\
-	    }								\
-	    assert(tnode != NULL);					\
-	}								\
-    }									\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##prev(a_rbt_type *rbtree, a_type *node) {			\
-    a_type *ret;							\
-    if (rbtn_left_get(a_type, a_field, node) != NULL) {			\
-	rbtn_last(a_type, a_field, rbtree, rbtn_left_get(a_type,	\
-	  a_field, node), ret);						\
-    } else {								\
-	a_type *tnode = rbtree->rbt_root;				\
-	assert(tnode != NULL);						\
-	ret = NULL;							\
-	while (true) {							\
-	    int cmp = (a_cmp)(node, tnode);				\
-	    if (cmp < 0) {						\
-		tnode = rbtn_left_get(a_type, a_field, tnode);		\
-	    } else if (cmp > 0) {					\
-		ret = tnode;						\
-		tnode = rbtn_right_get(a_type, a_field, tnode);		\
-	    } else {							\
-		break;							\
-	    }								\
-	    assert(tnode != NULL);					\
-	}								\
-    }									\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##search(a_rbt_type *rbtree, const a_type *key) {		\
-    a_type *ret;							\
-    int cmp;								\
-    ret = rbtree->rbt_root;						\
-    while (ret != NULL							\
-      && (cmp = (a_cmp)(key, ret)) != 0) {				\
-	if (cmp < 0) {							\
-	    ret = rbtn_left_get(a_type, a_field, ret);			\
-	} else {							\
-	    ret = rbtn_right_get(a_type, a_field, ret);			\
-	}								\
-    }									\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##nsearch(a_rbt_type *rbtree, const a_type *key) {		\
-    a_type *ret;							\
-    a_type *tnode = rbtree->rbt_root;					\
-    ret = NULL;								\
-    while (tnode != NULL) {						\
-	int cmp = (a_cmp)(key, tnode);					\
-	if (cmp < 0) {							\
-	    ret = tnode;						\
-	    tnode = rbtn_left_get(a_type, a_field, tnode);		\
-	} else if (cmp > 0) {						\
-	    tnode = rbtn_right_get(a_type, a_field, tnode);		\
-	} else {							\
-	    ret = tnode;						\
-	    break;							\
-	}								\
-    }									\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##psearch(a_rbt_type *rbtree, const a_type *key) {		\
-    a_type *ret;							\
-    a_type *tnode = rbtree->rbt_root;					\
-    ret = NULL;								\
-    while (tnode != NULL) {						\
-	int cmp = (a_cmp)(key, tnode);					\
-	if (cmp < 0) {							\
-	    tnode = rbtn_left_get(a_type, a_field, tnode);		\
-	} else if (cmp > 0) {						\
-	    ret = tnode;						\
-	    tnode = rbtn_right_get(a_type, a_field, tnode);		\
-	} else {							\
-	    ret = tnode;						\
-	    break;							\
-	}								\
-    }									\
-    return ret;								\
-}									\
-a_attr void								\
-a_prefix##insert(a_rbt_type *rbtree, a_type *node) {			\
-    struct {								\
-	a_type *node;							\
-	int cmp;							\
-    } path[sizeof(void *) << 4], *pathp;				\
-    rbt_node_new(a_type, a_field, rbtree, node);			\
-    /* Wind. */								\
-    path->node = rbtree->rbt_root;					\
-    for (pathp = path; pathp->node != NULL; pathp++) {			\
-	int cmp = pathp->cmp = a_cmp(node, pathp->node);		\
-	assert(cmp != 0);						\
-	if (cmp < 0) {							\
-	    pathp[1].node = rbtn_left_get(a_type, a_field,		\
-	      pathp->node);						\
-	} else {							\
-	    pathp[1].node = rbtn_right_get(a_type, a_field,		\
-	      pathp->node);						\
-	}								\
-    }									\
-    pathp->node = node;							\
-    /* Unwind. */							\
-    for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) {	\
-	a_type *cnode = pathp->node;					\
-	if (pathp->cmp < 0) {						\
-	    a_type *left = pathp[1].node;				\
-	    rbtn_left_set(a_type, a_field, cnode, left);		\
-	    if (rbtn_red_get(a_type, a_field, left)) {			\
-		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
-		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
-		  leftleft)) {						\
-		    /* Fix up 4-node. */				\
-		    a_type *tnode;					\
-		    rbtn_black_set(a_type, a_field, leftleft);		\
-		    rbtn_rotate_right(a_type, a_field, cnode, tnode);	\
-		    cnode = tnode;					\
-		}							\
-	    } else {							\
-		return;							\
-	    }								\
-	} else {							\
-	    a_type *right = pathp[1].node;				\
-	    rbtn_right_set(a_type, a_field, cnode, right);		\
-	    if (rbtn_red_get(a_type, a_field, right)) {			\
-		a_type *left = rbtn_left_get(a_type, a_field, cnode);	\
-		if (left != NULL && rbtn_red_get(a_type, a_field,	\
-		  left)) {						\
-		    /* Split 4-node. */					\
-		    rbtn_black_set(a_type, a_field, left);		\
-		    rbtn_black_set(a_type, a_field, right);		\
-		    rbtn_red_set(a_type, a_field, cnode);		\
-		} else {						\
-		    /* Lean left. */					\
-		    a_type *tnode;					\
-		    bool tred = rbtn_red_get(a_type, a_field, cnode);	\
-		    rbtn_rotate_left(a_type, a_field, cnode, tnode);	\
-		    rbtn_color_set(a_type, a_field, tnode, tred);	\
-		    rbtn_red_set(a_type, a_field, cnode);		\
-		    cnode = tnode;					\
-		}							\
-	    } else {							\
-		return;							\
-	    }								\
-	}								\
-	pathp->node = cnode;						\
-    }									\
-    /* Set root, and make it black. */					\
-    rbtree->rbt_root = path->node;					\
-    rbtn_black_set(a_type, a_field, rbtree->rbt_root);			\
-}									\
-a_attr void								\
-a_prefix##remove(a_rbt_type *rbtree, a_type *node) {			\
-    struct {								\
-	a_type *node;							\
-	int cmp;							\
-    } *pathp, *nodep, path[sizeof(void *) << 4];			\
-    /* Wind. */								\
-    nodep = NULL; /* Silence compiler warning. */			\
-    path->node = rbtree->rbt_root;					\
-    for (pathp = path; pathp->node != NULL; pathp++) {			\
-	int cmp = pathp->cmp = a_cmp(node, pathp->node);		\
-	if (cmp < 0) {							\
-	    pathp[1].node = rbtn_left_get(a_type, a_field,		\
-	      pathp->node);						\
-	} else {							\
-	    pathp[1].node = rbtn_right_get(a_type, a_field,		\
-	      pathp->node);						\
-	    if (cmp == 0) {						\
-	        /* Find node's successor, in preparation for swap. */	\
-		pathp->cmp = 1;						\
-		nodep = pathp;						\
-		for (pathp++; pathp->node != NULL; pathp++) {		\
-		    pathp->cmp = -1;					\
-		    pathp[1].node = rbtn_left_get(a_type, a_field,	\
-		      pathp->node);					\
-		}							\
-		break;							\
-	    }								\
-	}								\
-    }									\
-    assert(nodep->node == node);					\
-    pathp--;								\
-    if (pathp->node != node) {						\
-	/* Swap node with its successor. */				\
-	bool tred = rbtn_red_get(a_type, a_field, pathp->node);		\
-	rbtn_color_set(a_type, a_field, pathp->node,			\
-	  rbtn_red_get(a_type, a_field, node));				\
-	rbtn_left_set(a_type, a_field, pathp->node,			\
-	  rbtn_left_get(a_type, a_field, node));			\
-	/* If node's successor is its right child, the following code */\
-	/* will do the wrong thing for the right child pointer.       */\
-	/* However, it doesn't matter, because the pointer will be    */\
-	/* properly set when the successor is pruned.                 */\
-	rbtn_right_set(a_type, a_field, pathp->node,			\
-	  rbtn_right_get(a_type, a_field, node));			\
-	rbtn_color_set(a_type, a_field, node, tred);			\
-	/* The pruned leaf node's child pointers are never accessed   */\
-	/* again, so don't bother setting them to nil.                */\
-	nodep->node = pathp->node;					\
-	pathp->node = node;						\
-	if (nodep == path) {						\
-	    rbtree->rbt_root = nodep->node;				\
-	} else {							\
-	    if (nodep[-1].cmp < 0) {					\
-		rbtn_left_set(a_type, a_field, nodep[-1].node,		\
-		  nodep->node);						\
-	    } else {							\
-		rbtn_right_set(a_type, a_field, nodep[-1].node,		\
-		  nodep->node);						\
-	    }								\
-	}								\
-    } else {								\
-	a_type *left = rbtn_left_get(a_type, a_field, node);		\
-	if (left != NULL) {						\
-	    /* node has no successor, but it has a left child.        */\
-	    /* Splice node out, without losing the left child.        */\
-	    assert(!rbtn_red_get(a_type, a_field, node));		\
-	    assert(rbtn_red_get(a_type, a_field, left));		\
-	    rbtn_black_set(a_type, a_field, left);			\
-	    if (pathp == path) {					\
-		rbtree->rbt_root = left;				\
-	    } else {							\
-		if (pathp[-1].cmp < 0) {				\
-		    rbtn_left_set(a_type, a_field, pathp[-1].node,	\
-		      left);						\
-		} else {						\
-		    rbtn_right_set(a_type, a_field, pathp[-1].node,	\
-		      left);						\
-		}							\
-	    }								\
-	    return;							\
-	} else if (pathp == path) {					\
-	    /* The tree only contained one node. */			\
-	    rbtree->rbt_root = NULL;					\
-	    return;							\
-	}								\
-    }									\
-    if (rbtn_red_get(a_type, a_field, pathp->node)) {			\
-	/* Prune red node, which requires no fixup. */			\
-	assert(pathp[-1].cmp < 0);					\
-	rbtn_left_set(a_type, a_field, pathp[-1].node, NULL);		\
-	return;								\
-    }									\
-    /* The node to be pruned is black, so unwind until balance is     */\
-    /* restored.                                                      */\
-    pathp->node = NULL;							\
-    for (pathp--; (uintptr_t)pathp >= (uintptr_t)path; pathp--) {	\
-	assert(pathp->cmp != 0);					\
-	if (pathp->cmp < 0) {						\
-	    rbtn_left_set(a_type, a_field, pathp->node,			\
-	      pathp[1].node);						\
-	    if (rbtn_red_get(a_type, a_field, pathp->node)) {		\
-		a_type *right = rbtn_right_get(a_type, a_field,		\
-		  pathp->node);						\
-		a_type *rightleft = rbtn_left_get(a_type, a_field,	\
-		  right);						\
-		a_type *tnode;						\
-		if (rightleft != NULL && rbtn_red_get(a_type, a_field,	\
-		  rightleft)) {						\
-		    /* In the following diagrams, ||, //, and \\      */\
-		    /* indicate the path to the removed node.         */\
-		    /*                                                */\
-		    /*      ||                                        */\
-		    /*    pathp(r)                                    */\
-		    /*  //        \                                   */\
-		    /* (b)        (b)                                 */\
-		    /*           /                                    */\
-		    /*          (r)                                   */\
-		    /*                                                */\
-		    rbtn_black_set(a_type, a_field, pathp->node);	\
-		    rbtn_rotate_right(a_type, a_field, right, tnode);	\
-		    rbtn_right_set(a_type, a_field, pathp->node, tnode);\
-		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		} else {						\
-		    /*      ||                                        */\
-		    /*    pathp(r)                                    */\
-		    /*  //        \                                   */\
-		    /* (b)        (b)                                 */\
-		    /*           /                                    */\
-		    /*          (b)                                   */\
-		    /*                                                */\
-		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		}							\
-		/* Balance restored, but rotation modified subtree    */\
-		/* root.                                              */\
-		assert((uintptr_t)pathp > (uintptr_t)path);		\
-		if (pathp[-1].cmp < 0) {				\
-		    rbtn_left_set(a_type, a_field, pathp[-1].node,	\
-		      tnode);						\
-		} else {						\
-		    rbtn_right_set(a_type, a_field, pathp[-1].node,	\
-		      tnode);						\
-		}							\
-		return;							\
-	    } else {							\
-		a_type *right = rbtn_right_get(a_type, a_field,		\
-		  pathp->node);						\
-		a_type *rightleft = rbtn_left_get(a_type, a_field,	\
-		  right);						\
-		if (rightleft != NULL && rbtn_red_get(a_type, a_field,	\
-		  rightleft)) {						\
-		    /*      ||                                        */\
-		    /*    pathp(b)                                    */\
-		    /*  //        \                                   */\
-		    /* (b)        (b)                                 */\
-		    /*           /                                    */\
-		    /*          (r)                                   */\
-		    a_type *tnode;					\
-		    rbtn_black_set(a_type, a_field, rightleft);		\
-		    rbtn_rotate_right(a_type, a_field, right, tnode);	\
-		    rbtn_right_set(a_type, a_field, pathp->node, tnode);\
-		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    /* Balance restored, but rotation modified        */\
-		    /* subtree root, which may actually be the tree   */\
-		    /* root.                                          */\
-		    if (pathp == path) {				\
-			/* Set root. */					\
-			rbtree->rbt_root = tnode;			\
-		    } else {						\
-			if (pathp[-1].cmp < 0) {			\
-			    rbtn_left_set(a_type, a_field,		\
-			      pathp[-1].node, tnode);			\
-			} else {					\
-			    rbtn_right_set(a_type, a_field,		\
-			      pathp[-1].node, tnode);			\
-			}						\
-		    }							\
-		    return;						\
-		} else {						\
-		    /*      ||                                        */\
-		    /*    pathp(b)                                    */\
-		    /*  //        \                                   */\
-		    /* (b)        (b)                                 */\
-		    /*           /                                    */\
-		    /*          (b)                                   */\
-		    a_type *tnode;					\
-		    rbtn_red_set(a_type, a_field, pathp->node);		\
-		    rbtn_rotate_left(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    pathp->node = tnode;				\
-		}							\
-	    }								\
-	} else {							\
-	    a_type *left;						\
-	    rbtn_right_set(a_type, a_field, pathp->node,		\
-	      pathp[1].node);						\
-	    left = rbtn_left_get(a_type, a_field, pathp->node);		\
-	    if (rbtn_red_get(a_type, a_field, left)) {			\
-		a_type *tnode;						\
-		a_type *leftright = rbtn_right_get(a_type, a_field,	\
-		  left);						\
-		a_type *leftrightleft = rbtn_left_get(a_type, a_field,	\
-		  leftright);						\
-		if (leftrightleft != NULL && rbtn_red_get(a_type,	\
-		  a_field, leftrightleft)) {				\
-		    /*      ||                                        */\
-		    /*    pathp(b)                                    */\
-		    /*   /        \\                                  */\
-		    /* (r)        (b)                                 */\
-		    /*   \                                            */\
-		    /*   (b)                                          */\
-		    /*   /                                            */\
-		    /* (r)                                            */\
-		    a_type *unode;					\
-		    rbtn_black_set(a_type, a_field, leftrightleft);	\
-		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
-		      unode);						\
-		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    rbtn_right_set(a_type, a_field, unode, tnode);	\
-		    rbtn_rotate_left(a_type, a_field, unode, tnode);	\
-		} else {						\
-		    /*      ||                                        */\
-		    /*    pathp(b)                                    */\
-		    /*   /        \\                                  */\
-		    /* (r)        (b)                                 */\
-		    /*   \                                            */\
-		    /*   (b)                                          */\
-		    /*   /                                            */\
-		    /* (b)                                            */\
-		    assert(leftright != NULL);				\
-		    rbtn_red_set(a_type, a_field, leftright);		\
-		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    rbtn_black_set(a_type, a_field, tnode);		\
-		}							\
-		/* Balance restored, but rotation modified subtree    */\
-		/* root, which may actually be the tree root.         */\
-		if (pathp == path) {					\
-		    /* Set root. */					\
-		    rbtree->rbt_root = tnode;				\
-		} else {						\
-		    if (pathp[-1].cmp < 0) {				\
-			rbtn_left_set(a_type, a_field, pathp[-1].node,	\
-			  tnode);					\
-		    } else {						\
-			rbtn_right_set(a_type, a_field, pathp[-1].node,	\
-			  tnode);					\
-		    }							\
-		}							\
-		return;							\
-	    } else if (rbtn_red_get(a_type, a_field, pathp->node)) {	\
-		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
-		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
-		  leftleft)) {						\
-		    /*        ||                                      */\
-		    /*      pathp(r)                                  */\
-		    /*     /        \\                                */\
-		    /*   (b)        (b)                               */\
-		    /*   /                                            */\
-		    /* (r)                                            */\
-		    a_type *tnode;					\
-		    rbtn_black_set(a_type, a_field, pathp->node);	\
-		    rbtn_red_set(a_type, a_field, left);		\
-		    rbtn_black_set(a_type, a_field, leftleft);		\
-		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    /* Balance restored, but rotation modified        */\
-		    /* subtree root.                                  */\
-		    assert((uintptr_t)pathp > (uintptr_t)path);		\
-		    if (pathp[-1].cmp < 0) {				\
-			rbtn_left_set(a_type, a_field, pathp[-1].node,	\
-			  tnode);					\
-		    } else {						\
-			rbtn_right_set(a_type, a_field, pathp[-1].node,	\
-			  tnode);					\
-		    }							\
-		    return;						\
-		} else {						\
-		    /*        ||                                      */\
-		    /*      pathp(r)                                  */\
-		    /*     /        \\                                */\
-		    /*   (b)        (b)                               */\
-		    /*   /                                            */\
-		    /* (b)                                            */\
-		    rbtn_red_set(a_type, a_field, left);		\
-		    rbtn_black_set(a_type, a_field, pathp->node);	\
-		    /* Balance restored. */				\
-		    return;						\
-		}							\
-	    } else {							\
-		a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
-		if (leftleft != NULL && rbtn_red_get(a_type, a_field,	\
-		  leftleft)) {						\
-		    /*               ||                               */\
-		    /*             pathp(b)                           */\
-		    /*            /        \\                         */\
-		    /*          (b)        (b)                        */\
-		    /*          /                                     */\
-		    /*        (r)                                     */\
-		    a_type *tnode;					\
-		    rbtn_black_set(a_type, a_field, leftleft);		\
-		    rbtn_rotate_right(a_type, a_field, pathp->node,	\
-		      tnode);						\
-		    /* Balance restored, but rotation modified        */\
-		    /* subtree root, which may actually be the tree   */\
-		    /* root.                                          */\
-		    if (pathp == path) {				\
-			/* Set root. */					\
-			rbtree->rbt_root = tnode;			\
-		    } else {						\
-			if (pathp[-1].cmp < 0) {			\
-			    rbtn_left_set(a_type, a_field,		\
-			      pathp[-1].node, tnode);			\
-			} else {					\
-			    rbtn_right_set(a_type, a_field,		\
-			      pathp[-1].node, tnode);			\
-			}						\
-		    }							\
-		    return;						\
-		} else {						\
-		    /*               ||                               */\
-		    /*             pathp(b)                           */\
-		    /*            /        \\                         */\
-		    /*          (b)        (b)                        */\
-		    /*          /                                     */\
-		    /*        (b)                                     */\
-		    rbtn_red_set(a_type, a_field, left);		\
-		}							\
-	    }								\
-	}								\
-    }									\
-    /* Set root. */							\
-    rbtree->rbt_root = path->node;					\
-    assert(!rbtn_red_get(a_type, a_field, rbtree->rbt_root));		\
-}									\
-a_attr a_type *								\
-a_prefix##iter_recurse(a_rbt_type *rbtree, a_type *node,		\
-  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
-    if (node == NULL) {							\
-	return NULL;							\
-    } else {								\
-	a_type *ret;							\
-	if ((ret = a_prefix##iter_recurse(rbtree, rbtn_left_get(a_type,	\
-	  a_field, node), cb, arg)) != NULL || (ret = cb(rbtree, node,	\
-	  arg)) != NULL) {						\
-	    return ret;							\
-	}								\
-	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
-	  a_field, node), cb, arg);					\
-    }									\
-}									\
-a_attr a_type *								\
-a_prefix##iter_start(a_rbt_type *rbtree, a_type *start, a_type *node,	\
-  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
-    int cmp = a_cmp(start, node);					\
-    if (cmp < 0) {							\
-	a_type *ret;							\
-	if ((ret = a_prefix##iter_start(rbtree, start,			\
-	  rbtn_left_get(a_type, a_field, node), cb, arg)) != NULL ||	\
-	  (ret = cb(rbtree, node, arg)) != NULL) {			\
-	    return ret;							\
-	}								\
-	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
-	  a_field, node), cb, arg);					\
-    } else if (cmp > 0) {						\
-	return a_prefix##iter_start(rbtree, start,			\
-	  rbtn_right_get(a_type, a_field, node), cb, arg);		\
-    } else {								\
-	a_type *ret;							\
-	if ((ret = cb(rbtree, node, arg)) != NULL) {			\
-	    return ret;							\
-	}								\
-	return a_prefix##iter_recurse(rbtree, rbtn_right_get(a_type,	\
-	  a_field, node), cb, arg);					\
-    }									\
-}									\
-a_attr a_type *								\
-a_prefix##iter(a_rbt_type *rbtree, a_type *start, a_type *(*cb)(	\
-  a_rbt_type *, a_type *, void *), void *arg) {				\
-    a_type *ret;							\
-    if (start != NULL) {						\
-	ret = a_prefix##iter_start(rbtree, start, rbtree->rbt_root,	\
-	  cb, arg);							\
-    } else {								\
-	ret = a_prefix##iter_recurse(rbtree, rbtree->rbt_root, cb, arg);\
-    }									\
-    return ret;								\
-}									\
-a_attr a_type *								\
-a_prefix##reverse_iter_recurse(a_rbt_type *rbtree, a_type *node,	\
-  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
-    if (node == NULL) {							\
-	return NULL;							\
-    } else {								\
-	a_type *ret;							\
-	if ((ret = a_prefix##reverse_iter_recurse(rbtree,		\
-	  rbtn_right_get(a_type, a_field, node), cb, arg)) != NULL ||	\
-	  (ret = cb(rbtree, node, arg)) != NULL) {			\
-	    return ret;							\
-	}								\
-	return a_prefix##reverse_iter_recurse(rbtree,			\
-	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
-    }									\
-}									\
-a_attr a_type *								\
-a_prefix##reverse_iter_start(a_rbt_type *rbtree, a_type *start,		\
-  a_type *node, a_type *(*cb)(a_rbt_type *, a_type *, void *),		\
-  void *arg) {								\
-    int cmp = a_cmp(start, node);					\
-    if (cmp > 0) {							\
-	a_type *ret;							\
-	if ((ret = a_prefix##reverse_iter_start(rbtree, start,		\
-	  rbtn_right_get(a_type, a_field, node), cb, arg)) != NULL ||	\
-	  (ret = cb(rbtree, node, arg)) != NULL) {			\
-	    return ret;							\
-	}								\
-	return a_prefix##reverse_iter_recurse(rbtree,			\
-	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
-    } else if (cmp < 0) {						\
-	return a_prefix##reverse_iter_start(rbtree, start,		\
-	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
-    } else {								\
-	a_type *ret;							\
-	if ((ret = cb(rbtree, node, arg)) != NULL) {			\
-	    return ret;							\
-	}								\
-	return a_prefix##reverse_iter_recurse(rbtree,			\
-	  rbtn_left_get(a_type, a_field, node), cb, arg);		\
-    }									\
-}									\
-a_attr a_type *								\
-a_prefix##reverse_iter(a_rbt_type *rbtree, a_type *start,		\
-  a_type *(*cb)(a_rbt_type *, a_type *, void *), void *arg) {		\
-    a_type *ret;							\
-    if (start != NULL) {						\
-	ret = a_prefix##reverse_iter_start(rbtree, start,		\
-	  rbtree->rbt_root, cb, arg);					\
-    } else {								\
-	ret = a_prefix##reverse_iter_recurse(rbtree, rbtree->rbt_root,	\
-	  cb, arg);							\
-    }									\
-    return ret;								\
-}									\
-a_attr void								\
-a_prefix##destroy_recurse(a_rbt_type *rbtree, a_type *node, void (*cb)(	\
-  a_type *, void *), void *arg) {					\
-    if (node == NULL) {							\
-	return;								\
-    }									\
-    a_prefix##destroy_recurse(rbtree, rbtn_left_get(a_type, a_field,	\
-      node), cb, arg);							\
-    rbtn_left_set(a_type, a_field, (node), NULL);			\
-    a_prefix##destroy_recurse(rbtree, rbtn_right_get(a_type, a_field,	\
-      node), cb, arg);							\
-    rbtn_right_set(a_type, a_field, (node), NULL);			\
-    if (cb) {								\
-	cb(node, arg);							\
-    }									\
-}									\
-a_attr void								\
-a_prefix##destroy(a_rbt_type *rbtree, void (*cb)(a_type *, void *),	\
-  void *arg) {								\
-    a_prefix##destroy_recurse(rbtree, rbtree->rbt_root, cb, arg);	\
-    rbtree->rbt_root = NULL;						\
-}
-
-#endif /* RB_H_ */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
deleted file mode 100644
index b59d33a8..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree.h
+++ /dev/null
@@ -1,492 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_RTREE_H
-#define JEMALLOC_INTERNAL_RTREE_H
-
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree_tsd.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/tsd.h"
-
-/*
- * This radix tree implementation is tailored to the singular purpose of
- * associating metadata with extents that are currently owned by jemalloc.
- *
- *******************************************************************************
- */
-
-/* Number of high insignificant bits. */
-#define RTREE_NHIB ((1U << (LG_SIZEOF_PTR+3)) - LG_VADDR)
-/* Number of low insigificant bits. */
-#define RTREE_NLIB LG_PAGE
-/* Number of significant bits. */
-#define RTREE_NSB (LG_VADDR - RTREE_NLIB)
-/* Number of levels in radix tree. */
-#if RTREE_NSB <= 10
-#  define RTREE_HEIGHT 1
-#elif RTREE_NSB <= 36
-#  define RTREE_HEIGHT 2
-#elif RTREE_NSB <= 52
-#  define RTREE_HEIGHT 3
-#else
-#  error Unsupported number of significant virtual address bits
-#endif
-/* Use compact leaf representation if virtual address encoding allows. */
-#if RTREE_NHIB >= LG_CEIL_NSIZES
-#  define RTREE_LEAF_COMPACT
-#endif
-
-/* Needed for initialization only. */
-#define RTREE_LEAFKEY_INVALID ((uintptr_t)1)
-
-typedef struct rtree_node_elm_s rtree_node_elm_t;
-struct rtree_node_elm_s {
-	atomic_p_t	child; /* (rtree_{node,leaf}_elm_t *) */
-};
-
-struct rtree_leaf_elm_s {
-#ifdef RTREE_LEAF_COMPACT
-	/*
-	 * Single pointer-width field containing all three leaf element fields.
-	 * For example, on a 64-bit x64 system with 48 significant virtual
-	 * memory address bits, the index, extent, and slab fields are packed as
-	 * such:
-	 *
-	 * x: index
-	 * e: extent
-	 * b: slab
-	 *
-	 *   00000000 xxxxxxxx eeeeeeee [...] eeeeeeee eeee000b
-	 */
-	atomic_p_t	le_bits;
-#else
-	atomic_p_t	le_extent; /* (extent_t *) */
-	atomic_u_t	le_szind; /* (szind_t) */
-	atomic_b_t	le_slab; /* (bool) */
-#endif
-};
-
-typedef struct rtree_level_s rtree_level_t;
-struct rtree_level_s {
-	/* Number of key bits distinguished by this level. */
-	unsigned		bits;
-	/*
-	 * Cumulative number of key bits distinguished by traversing to
-	 * corresponding tree level.
-	 */
-	unsigned		cumbits;
-};
-
-typedef struct rtree_s rtree_t;
-struct rtree_s {
-	malloc_mutex_t		init_lock;
-	/* Number of elements based on rtree_levels[0].bits. */
-#if RTREE_HEIGHT > 1
-	rtree_node_elm_t	root[1U << (RTREE_NSB/RTREE_HEIGHT)];
-#else
-	rtree_leaf_elm_t	root[1U << (RTREE_NSB/RTREE_HEIGHT)];
-#endif
-};
-
-/*
- * Split the bits into one to three partitions depending on number of
- * significant bits.  It the number of bits does not divide evenly into the
- * number of levels, place one remainder bit per level starting at the leaf
- * level.
- */
-static const rtree_level_t rtree_levels[] = {
-#if RTREE_HEIGHT == 1
-	{RTREE_NSB, RTREE_NHIB + RTREE_NSB}
-#elif RTREE_HEIGHT == 2
-	{RTREE_NSB/2, RTREE_NHIB + RTREE_NSB/2},
-	{RTREE_NSB/2 + RTREE_NSB%2, RTREE_NHIB + RTREE_NSB}
-#elif RTREE_HEIGHT == 3
-	{RTREE_NSB/3, RTREE_NHIB + RTREE_NSB/3},
-	{RTREE_NSB/3 + RTREE_NSB%3/2,
-	    RTREE_NHIB + RTREE_NSB/3*2 + RTREE_NSB%3/2},
-	{RTREE_NSB/3 + RTREE_NSB%3 - RTREE_NSB%3/2, RTREE_NHIB + RTREE_NSB}
-#else
-#  error Unsupported rtree height
-#endif
-};
-
-bool rtree_new(rtree_t *rtree, bool zeroed);
-
-typedef rtree_node_elm_t *(rtree_node_alloc_t)(tsdn_t *, rtree_t *, size_t);
-extern rtree_node_alloc_t *JET_MUTABLE rtree_node_alloc;
-
-typedef rtree_leaf_elm_t *(rtree_leaf_alloc_t)(tsdn_t *, rtree_t *, size_t);
-extern rtree_leaf_alloc_t *JET_MUTABLE rtree_leaf_alloc;
-
-typedef void (rtree_node_dalloc_t)(tsdn_t *, rtree_t *, rtree_node_elm_t *);
-extern rtree_node_dalloc_t *JET_MUTABLE rtree_node_dalloc;
-
-typedef void (rtree_leaf_dalloc_t)(tsdn_t *, rtree_t *, rtree_leaf_elm_t *);
-extern rtree_leaf_dalloc_t *JET_MUTABLE rtree_leaf_dalloc;
-#ifdef JEMALLOC_JET
-void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
-#endif
-rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
-    rtree_ctx_t *rtree_ctx, uintptr_t key, bool dependent, bool init_missing);
-
-JEMALLOC_ALWAYS_INLINE uintptr_t
-rtree_leafkey(uintptr_t key) {
-	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
-	unsigned cumbits = (rtree_levels[RTREE_HEIGHT-1].cumbits -
-	    rtree_levels[RTREE_HEIGHT-1].bits);
-	unsigned maskbits = ptrbits - cumbits;
-	uintptr_t mask = ~((ZU(1) << maskbits) - 1);
-	return (key & mask);
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-rtree_cache_direct_map(uintptr_t key) {
-	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
-	unsigned cumbits = (rtree_levels[RTREE_HEIGHT-1].cumbits -
-	    rtree_levels[RTREE_HEIGHT-1].bits);
-	unsigned maskbits = ptrbits - cumbits;
-	return (size_t)((key >> maskbits) & (RTREE_CTX_NCACHE - 1));
-}
-
-JEMALLOC_ALWAYS_INLINE uintptr_t
-rtree_subkey(uintptr_t key, unsigned level) {
-	unsigned ptrbits = ZU(1) << (LG_SIZEOF_PTR+3);
-	unsigned cumbits = rtree_levels[level].cumbits;
-	unsigned shiftbits = ptrbits - cumbits;
-	unsigned maskbits = rtree_levels[level].bits;
-	uintptr_t mask = (ZU(1) << maskbits) - 1;
-	return ((key >> shiftbits) & mask);
-}
-
-/*
- * Atomic getters.
- *
- * dependent: Reading a value on behalf of a pointer to a valid allocation
- *            is guaranteed to be a clean read even without synchronization,
- *            because the rtree update became visible in memory before the
- *            pointer came into existence.
- * !dependent: An arbitrary read, e.g. on behalf of ivsalloc(), may not be
- *             dependent on a previous rtree write, which means a stale read
- *             could result if synchronization were omitted here.
- */
-#  ifdef RTREE_LEAF_COMPACT
-JEMALLOC_ALWAYS_INLINE uintptr_t
-rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
-    bool dependent) {
-	return (uintptr_t)atomic_load_p(&elm->le_bits, dependent
-	    ? ATOMIC_RELAXED : ATOMIC_ACQUIRE);
-}
-
-JEMALLOC_ALWAYS_INLINE extent_t *
-rtree_leaf_elm_bits_extent_get(uintptr_t bits) {
-#    ifdef __aarch64__
-	/*
-	 * aarch64 doesn't sign extend the highest virtual address bit to set
-	 * the higher ones.  Instead, the high bits gets zeroed.
-	 */
-	uintptr_t high_bit_mask = ((uintptr_t)1 << LG_VADDR) - 1;
-	/* Mask off the slab bit. */
-	uintptr_t low_bit_mask = ~(uintptr_t)1;
-	uintptr_t mask = high_bit_mask & low_bit_mask;
-	return (extent_t *)(bits & mask);
-#    else
-	/* Restore sign-extended high bits, mask slab bit. */
-	return (extent_t *)((uintptr_t)((intptr_t)(bits << RTREE_NHIB) >>
-	    RTREE_NHIB) & ~((uintptr_t)0x1));
-#    endif
-}
-
-JEMALLOC_ALWAYS_INLINE szind_t
-rtree_leaf_elm_bits_szind_get(uintptr_t bits) {
-	return (szind_t)(bits >> LG_VADDR);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-rtree_leaf_elm_bits_slab_get(uintptr_t bits) {
-	return (bool)(bits & (uintptr_t)0x1);
-}
-
-#  endif
-
-JEMALLOC_ALWAYS_INLINE extent_t *
-rtree_leaf_elm_extent_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, bool dependent) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
-	return rtree_leaf_elm_bits_extent_get(bits);
-#else
-	extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent
-	    ? ATOMIC_RELAXED : ATOMIC_ACQUIRE);
-	return extent;
-#endif
-}
-
-JEMALLOC_ALWAYS_INLINE szind_t
-rtree_leaf_elm_szind_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, bool dependent) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
-	return rtree_leaf_elm_bits_szind_get(bits);
-#else
-	return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED
-	    : ATOMIC_ACQUIRE);
-#endif
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-rtree_leaf_elm_slab_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, bool dependent) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
-	return rtree_leaf_elm_bits_slab_get(bits);
-#else
-	return atomic_load_b(&elm->le_slab, dependent ? ATOMIC_RELAXED :
-	    ATOMIC_ACQUIRE);
-#endif
-}
-
-static inline void
-rtree_leaf_elm_extent_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, extent_t *extent) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, true);
-	uintptr_t bits = ((uintptr_t)rtree_leaf_elm_bits_szind_get(old_bits) <<
-	    LG_VADDR) | ((uintptr_t)extent & (((uintptr_t)0x1 << LG_VADDR) - 1))
-	    | ((uintptr_t)rtree_leaf_elm_bits_slab_get(old_bits));
-	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
-#else
-	atomic_store_p(&elm->le_extent, extent, ATOMIC_RELEASE);
-#endif
-}
-
-static inline void
-rtree_leaf_elm_szind_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, szind_t szind) {
-	assert(szind <= NSIZES);
-
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm,
-	    true);
-	uintptr_t bits = ((uintptr_t)szind << LG_VADDR) |
-	    ((uintptr_t)rtree_leaf_elm_bits_extent_get(old_bits) &
-	    (((uintptr_t)0x1 << LG_VADDR) - 1)) |
-	    ((uintptr_t)rtree_leaf_elm_bits_slab_get(old_bits));
-	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
-#else
-	atomic_store_u(&elm->le_szind, szind, ATOMIC_RELEASE);
-#endif
-}
-
-static inline void
-rtree_leaf_elm_slab_write(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree,
-    rtree_leaf_elm_t *elm, bool slab) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t old_bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm,
-	    true);
-	uintptr_t bits = ((uintptr_t)rtree_leaf_elm_bits_szind_get(old_bits) <<
-	    LG_VADDR) | ((uintptr_t)rtree_leaf_elm_bits_extent_get(old_bits) &
-	    (((uintptr_t)0x1 << LG_VADDR) - 1)) | ((uintptr_t)slab);
-	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
-#else
-	atomic_store_b(&elm->le_slab, slab, ATOMIC_RELEASE);
-#endif
-}
-
-static inline void
-rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
-    extent_t *extent, szind_t szind, bool slab) {
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t bits = ((uintptr_t)szind << LG_VADDR) |
-	    ((uintptr_t)extent & (((uintptr_t)0x1 << LG_VADDR) - 1)) |
-	    ((uintptr_t)slab);
-	atomic_store_p(&elm->le_bits, (void *)bits, ATOMIC_RELEASE);
-#else
-	rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab);
-	rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind);
-	/*
-	 * Write extent last, since the element is atomically considered valid
-	 * as soon as the extent field is non-NULL.
-	 */
-	rtree_leaf_elm_extent_write(tsdn, rtree, elm, extent);
-#endif
-}
-
-static inline void
-rtree_leaf_elm_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree,
-    rtree_leaf_elm_t *elm, szind_t szind, bool slab) {
-	assert(!slab || szind < NBINS);
-
-	/*
-	 * The caller implicitly assures that it is the only writer to the szind
-	 * and slab fields, and that the extent field cannot currently change.
-	 */
-	rtree_leaf_elm_slab_write(tsdn, rtree, elm, slab);
-	rtree_leaf_elm_szind_write(tsdn, rtree, elm, szind);
-}
-
-JEMALLOC_ALWAYS_INLINE rtree_leaf_elm_t *
-rtree_leaf_elm_lookup(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent, bool init_missing) {
-	assert(key != 0);
-	assert(!dependent || !init_missing);
-
-	size_t slot = rtree_cache_direct_map(key);
-	uintptr_t leafkey = rtree_leafkey(key);
-	assert(leafkey != RTREE_LEAFKEY_INVALID);
-
-	/* Fast path: L1 direct mapped cache. */
-	if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
-		rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf;
-		assert(leaf != NULL);
-		uintptr_t subkey = rtree_subkey(key, RTREE_HEIGHT-1);
-		return &leaf[subkey];
-	}
-	/*
-	 * Search the L2 LRU cache.  On hit, swap the matching element into the
-	 * slot in L1 cache, and move the position in L2 up by 1.
-	 */
-#define RTREE_CACHE_CHECK_L2(i) do {					\
-	if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) {	\
-		rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf;	\
-		assert(leaf != NULL);					\
-		if (i > 0) {						\
-			/* Bubble up by one. */				\
-			rtree_ctx->l2_cache[i].leafkey =		\
-				rtree_ctx->l2_cache[i - 1].leafkey;	\
-			rtree_ctx->l2_cache[i].leaf =			\
-				rtree_ctx->l2_cache[i - 1].leaf;	\
-			rtree_ctx->l2_cache[i - 1].leafkey =		\
-			    rtree_ctx->cache[slot].leafkey;		\
-			rtree_ctx->l2_cache[i - 1].leaf =		\
-			    rtree_ctx->cache[slot].leaf;		\
-		} else {						\
-			rtree_ctx->l2_cache[0].leafkey =		\
-			    rtree_ctx->cache[slot].leafkey;		\
-			rtree_ctx->l2_cache[0].leaf =			\
-			    rtree_ctx->cache[slot].leaf;		\
-		}							\
-		rtree_ctx->cache[slot].leafkey = leafkey;		\
-		rtree_ctx->cache[slot].leaf = leaf;			\
-		uintptr_t subkey = rtree_subkey(key, RTREE_HEIGHT-1);	\
-		return &leaf[subkey];					\
-	}								\
-} while (0)
-	/* Check the first cache entry. */
-	RTREE_CACHE_CHECK_L2(0);
-	/* Search the remaining cache elements. */
-	for (unsigned i = 1; i < RTREE_CTX_NCACHE_L2; i++) {
-		RTREE_CACHE_CHECK_L2(i);
-	}
-#undef RTREE_CACHE_CHECK_L2
-
-	return rtree_leaf_elm_lookup_hard(tsdn, rtree, rtree_ctx, key,
-	    dependent, init_missing);
-}
-
-static inline bool
-rtree_write(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx, uintptr_t key,
-    extent_t *extent, szind_t szind, bool slab) {
-	/* Use rtree_clear() to set the extent to NULL. */
-	assert(extent != NULL);
-
-	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx,
-	    key, false, true);
-	if (elm == NULL) {
-		return true;
-	}
-
-	assert(rtree_leaf_elm_extent_read(tsdn, rtree, elm, false) == NULL);
-	rtree_leaf_elm_write(tsdn, rtree, elm, extent, szind, slab);
-
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE rtree_leaf_elm_t *
-rtree_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx, uintptr_t key,
-    bool dependent) {
-	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx,
-	    key, dependent, false);
-	if (!dependent && elm == NULL) {
-		return NULL;
-	}
-	assert(elm != NULL);
-	return elm;
-}
-
-JEMALLOC_ALWAYS_INLINE extent_t *
-rtree_extent_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent) {
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
-	    dependent);
-	if (!dependent && elm == NULL) {
-		return NULL;
-	}
-	return rtree_leaf_elm_extent_read(tsdn, rtree, elm, dependent);
-}
-
-JEMALLOC_ALWAYS_INLINE szind_t
-rtree_szind_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent) {
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
-	    dependent);
-	if (!dependent && elm == NULL) {
-		return NSIZES;
-	}
-	return rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
-}
-
-/*
- * rtree_slab_read() is intentionally omitted because slab is always read in
- * conjunction with szind, which makes rtree_szind_slab_read() a better choice.
- */
-
-JEMALLOC_ALWAYS_INLINE bool
-rtree_extent_szind_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent, extent_t **r_extent, szind_t *r_szind) {
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
-	    dependent);
-	if (!dependent && elm == NULL) {
-		return true;
-	}
-	*r_extent = rtree_leaf_elm_extent_read(tsdn, rtree, elm, dependent);
-	*r_szind = rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-rtree_szind_slab_read(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent, szind_t *r_szind, bool *r_slab) {
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key,
-	    dependent);
-	if (!dependent && elm == NULL) {
-		return true;
-	}
-#ifdef RTREE_LEAF_COMPACT
-	uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
-	*r_szind = rtree_leaf_elm_bits_szind_get(bits);
-	*r_slab = rtree_leaf_elm_bits_slab_get(bits);
-#else
-	*r_szind = rtree_leaf_elm_szind_read(tsdn, rtree, elm, dependent);
-	*r_slab = rtree_leaf_elm_slab_read(tsdn, rtree, elm, dependent);
-#endif
-	return false;
-}
-
-static inline void
-rtree_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, szind_t szind, bool slab) {
-	assert(!slab || szind < NBINS);
-
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true);
-	rtree_leaf_elm_szind_slab_update(tsdn, rtree, elm, szind, slab);
-}
-
-static inline void
-rtree_clear(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key) {
-	rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true);
-	assert(rtree_leaf_elm_extent_read(tsdn, rtree, elm, false) !=
-	    NULL);
-	rtree_leaf_elm_write(tsdn, rtree, elm, NULL, NSIZES, false);
-}
-
-#endif /* JEMALLOC_INTERNAL_RTREE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
deleted file mode 100644
index 93a75173..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/rtree_tsd.h
+++ /dev/null
@@ -1,50 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_RTREE_CTX_H
-#define JEMALLOC_INTERNAL_RTREE_CTX_H
-
-/*
- * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively.  Each
- * entry supports an entire leaf, so the cache hit rate is typically high even
- * with a small number of entries.  In rare cases extent activity will straddle
- * the boundary between two leaf nodes.  Furthermore, an arena may use a
- * combination of dss and mmap.  Note that as memory usage grows past the amount
- * that this cache can directly cover, the cache will become less effective if
- * locality of reference is low, but the consequence is merely cache misses
- * while traversing the tree nodes.
- *
- * The L1 direct mapped cache offers consistent and low cost on cache hit.
- * However collision could affect hit rate negatively.  This is resolved by
- * combining with a L2 LRU cache, which requires linear search and re-ordering
- * on access but suffers no collision.  Note that, the cache will itself suffer
- * cache misses if made overly large, plus the cost of linear search in the LRU
- * cache.
- */
-#define RTREE_CTX_LG_NCACHE 4
-#define RTREE_CTX_NCACHE (1 << RTREE_CTX_LG_NCACHE)
-#define RTREE_CTX_NCACHE_L2 8
-
-/*
- * Zero initializer required for tsd initialization only.  Proper initialization
- * done via rtree_ctx_data_init().
- */
-#define RTREE_CTX_ZERO_INITIALIZER {{{0}}, {{0}}}
-
-
-typedef struct rtree_leaf_elm_s rtree_leaf_elm_t;
-
-typedef struct rtree_ctx_cache_elm_s rtree_ctx_cache_elm_t;
-struct rtree_ctx_cache_elm_s {
-	uintptr_t		leafkey;
-	rtree_leaf_elm_t	*leaf;
-};
-
-typedef struct rtree_ctx_s rtree_ctx_t;
-struct rtree_ctx_s {
-	/* Direct mapped cache. */
-	rtree_ctx_cache_elm_t	cache[RTREE_CTX_NCACHE];
-	/* L2 LRU cache. */
-	rtree_ctx_cache_elm_t	l2_cache[RTREE_CTX_NCACHE_L2];
-};
-
-void rtree_ctx_data_init(rtree_ctx_t *ctx);
-
-#endif /* JEMALLOC_INTERNAL_RTREE_CTX_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
deleted file mode 100755
index 998994d0..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/size_classes.sh
+++ /dev/null
@@ -1,361 +0,0 @@
-#!/bin/sh
-#
-# Usage: size_classes.sh <lg_qarr> <lg_tmin> <lg_parr> <lg_g>
-
-# The following limits are chosen such that they cover all supported platforms.
-
-# Pointer sizes.
-lg_zarr="2 3"
-
-# Quanta.
-lg_qarr=$1
-
-# The range of tiny size classes is [2^lg_tmin..2^(lg_q-1)].
-lg_tmin=$2
-
-# Maximum lookup size.
-lg_kmax=12
-
-# Page sizes.
-lg_parr=`echo $3 | tr ',' ' '`
-
-# Size class group size (number of size classes for each size doubling).
-lg_g=$4
-
-pow2() {
-  e=$1
-  pow2_result=1
-  while [ ${e} -gt 0 ] ; do
-    pow2_result=$((${pow2_result} + ${pow2_result}))
-    e=$((${e} - 1))
-  done
-}
-
-lg() {
-  x=$1
-  lg_result=0
-  while [ ${x} -gt 1 ] ; do
-    lg_result=$((${lg_result} + 1))
-    x=$((${x} / 2))
-  done
-}
-
-lg_ceil() {
-  y=$1
-  lg ${y}; lg_floor=${lg_result}
-  pow2 ${lg_floor}; pow2_floor=${pow2_result}
-  if [ ${pow2_floor} -lt ${y} ] ; then
-    lg_ceil_result=$((${lg_floor} + 1))
-  else
-    lg_ceil_result=${lg_floor}
-  fi
-}
-
-reg_size_compute() {
-  lg_grp=$1
-  lg_delta=$2
-  ndelta=$3
-
-  pow2 ${lg_grp}; grp=${pow2_result}
-  pow2 ${lg_delta}; delta=${pow2_result}
-  reg_size=$((${grp} + ${delta}*${ndelta}))
-}
-
-slab_size() {
-  lg_p=$1
-  lg_grp=$2
-  lg_delta=$3
-  ndelta=$4
-
-  pow2 ${lg_p}; p=${pow2_result}
-  reg_size_compute ${lg_grp} ${lg_delta} ${ndelta}
-
-  # Compute smallest slab size that is an integer multiple of reg_size.
-  try_slab_size=${p}
-  try_nregs=$((${try_slab_size} / ${reg_size}))
-  perfect=0
-  while [ ${perfect} -eq 0 ] ; do
-    perfect_slab_size=${try_slab_size}
-    perfect_nregs=${try_nregs}
-
-    try_slab_size=$((${try_slab_size} + ${p}))
-    try_nregs=$((${try_slab_size} / ${reg_size}))
-    if [ ${perfect_slab_size} -eq $((${perfect_nregs} * ${reg_size})) ] ; then
-      perfect=1
-    fi
-  done
-
-  slab_size_pgs=$((${perfect_slab_size} / ${p}))
-}
-
-size_class() {
-  index=$1
-  lg_grp=$2
-  lg_delta=$3
-  ndelta=$4
-  lg_p=$5
-  lg_kmax=$6
-
-  if [ ${lg_delta} -ge ${lg_p} ] ; then
-    psz="yes"
-  else
-    pow2 ${lg_p}; p=${pow2_result}
-    pow2 ${lg_grp}; grp=${pow2_result}
-    pow2 ${lg_delta}; delta=${pow2_result}
-    sz=$((${grp} + ${delta} * ${ndelta}))
-    npgs=$((${sz} / ${p}))
-    if [ ${sz} -eq $((${npgs} * ${p})) ] ; then
-      psz="yes"
-    else
-      psz="no"
-    fi
-  fi
-
-  lg ${ndelta}; lg_ndelta=${lg_result}; pow2 ${lg_ndelta}
-  if [ ${pow2_result} -lt ${ndelta} ] ; then
-    rem="yes"
-  else
-    rem="no"
-  fi
-
-  lg_size=${lg_grp}
-  if [ $((${lg_delta} + ${lg_ndelta})) -eq ${lg_grp} ] ; then
-    lg_size=$((${lg_grp} + 1))
-  else
-    lg_size=${lg_grp}
-    rem="yes"
-  fi
-
-  if [ ${lg_size} -lt $((${lg_p} + ${lg_g})) ] ; then
-    bin="yes"
-    slab_size ${lg_p} ${lg_grp} ${lg_delta} ${ndelta}; pgs=${slab_size_pgs}
-  else
-    bin="no"
-    pgs=0
-  fi
-  if [ ${lg_size} -lt ${lg_kmax} \
-      -o ${lg_size} -eq ${lg_kmax} -a ${rem} = "no" ] ; then
-    lg_delta_lookup=${lg_delta}
-  else
-    lg_delta_lookup="no"
-  fi
-  printf '    SC(%3d, %6d, %8d, %6d, %3s, %3s, %3d, %2s) \\\n' ${index} ${lg_grp} ${lg_delta} ${ndelta} ${psz} ${bin} ${pgs} ${lg_delta_lookup}
-  # Defined upon return:
-  # - psz ("yes" or "no")
-  # - bin ("yes" or "no")
-  # - pgs
-  # - lg_delta_lookup (${lg_delta} or "no")
-}
-
-sep_line() {
-  echo "                                                         \\"
-}
-
-size_classes() {
-  lg_z=$1
-  lg_q=$2
-  lg_t=$3
-  lg_p=$4
-  lg_g=$5
-
-  pow2 $((${lg_z} + 3)); ptr_bits=${pow2_result}
-  pow2 ${lg_g}; g=${pow2_result}
-
-  echo "#define SIZE_CLASSES \\"
-  echo "  /* index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup */ \\"
-
-  ntbins=0
-  nlbins=0
-  lg_tiny_maxclass='"NA"'
-  nbins=0
-  npsizes=0
-
-  # Tiny size classes.
-  ndelta=0
-  index=0
-  lg_grp=${lg_t}
-  lg_delta=${lg_grp}
-  while [ ${lg_grp} -lt ${lg_q} ] ; do
-    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
-    if [ ${lg_delta_lookup} != "no" ] ; then
-      nlbins=$((${index} + 1))
-    fi
-    if [ ${psz} = "yes" ] ; then
-      npsizes=$((${npsizes} + 1))
-    fi
-    if [ ${bin} != "no" ] ; then
-      nbins=$((${index} + 1))
-    fi
-    ntbins=$((${ntbins} + 1))
-    lg_tiny_maxclass=${lg_grp} # Final written value is correct.
-    index=$((${index} + 1))
-    lg_delta=${lg_grp}
-    lg_grp=$((${lg_grp} + 1))
-  done
-
-  # First non-tiny group.
-  if [ ${ntbins} -gt 0 ] ; then
-    sep_line
-    # The first size class has an unusual encoding, because the size has to be
-    # split between grp and delta*ndelta.
-    lg_grp=$((${lg_grp} - 1))
-    ndelta=1
-    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
-    index=$((${index} + 1))
-    lg_grp=$((${lg_grp} + 1))
-    lg_delta=$((${lg_delta} + 1))
-    if [ ${psz} = "yes" ] ; then
-      npsizes=$((${npsizes} + 1))
-    fi
-  fi
-  while [ ${ndelta} -lt ${g} ] ; do
-    size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
-    index=$((${index} + 1))
-    ndelta=$((${ndelta} + 1))
-    if [ ${psz} = "yes" ] ; then
-      npsizes=$((${npsizes} + 1))
-    fi
-  done
-
-  # All remaining groups.
-  lg_grp=$((${lg_grp} + ${lg_g}))
-  while [ ${lg_grp} -lt $((${ptr_bits} - 1)) ] ; do
-    sep_line
-    ndelta=1
-    if [ ${lg_grp} -eq $((${ptr_bits} - 2)) ] ; then
-      ndelta_limit=$((${g} - 1))
-    else
-      ndelta_limit=${g}
-    fi
-    while [ ${ndelta} -le ${ndelta_limit} ] ; do
-      size_class ${index} ${lg_grp} ${lg_delta} ${ndelta} ${lg_p} ${lg_kmax}
-      if [ ${lg_delta_lookup} != "no" ] ; then
-        nlbins=$((${index} + 1))
-        # Final written value is correct:
-        lookup_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
-      fi
-      if [ ${psz} = "yes" ] ; then
-        npsizes=$((${npsizes} + 1))
-      fi
-      if [ ${bin} != "no" ] ; then
-        nbins=$((${index} + 1))
-        # Final written value is correct:
-        small_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
-        if [ ${lg_g} -gt 0 ] ; then
-          lg_large_minclass=$((${lg_grp} + 1))
-        else
-          lg_large_minclass=$((${lg_grp} + 2))
-        fi
-      fi
-      # Final written value is correct:
-      large_maxclass="((((size_t)1) << ${lg_grp}) + (((size_t)${ndelta}) << ${lg_delta}))"
-      index=$((${index} + 1))
-      ndelta=$((${ndelta} + 1))
-    done
-    lg_grp=$((${lg_grp} + 1))
-    lg_delta=$((${lg_delta} + 1))
-  done
-  echo
-  nsizes=${index}
-  lg_ceil ${nsizes}; lg_ceil_nsizes=${lg_ceil_result}
-
-  # Defined upon completion:
-  # - ntbins
-  # - nlbins
-  # - nbins
-  # - nsizes
-  # - lg_ceil_nsizes
-  # - npsizes
-  # - lg_tiny_maxclass
-  # - lookup_maxclass
-  # - small_maxclass
-  # - lg_large_minclass
-  # - large_maxclass
-}
-
-cat <<EOF
-#ifndef JEMALLOC_INTERNAL_SIZE_CLASSES_H
-#define JEMALLOC_INTERNAL_SIZE_CLASSES_H
-
-/* This file was automatically generated by size_classes.sh. */
-
-#include "jemalloc/internal/jemalloc_internal_types.h"
-
-/*
- * This header file defines:
- *
- *   LG_SIZE_CLASS_GROUP: Lg of size class count for each size doubling.
- *   LG_TINY_MIN: Lg of minimum size class to support.
- *   SIZE_CLASSES: Complete table of SC(index, lg_grp, lg_delta, ndelta, psz,
- *                 bin, pgs, lg_delta_lookup) tuples.
- *     index: Size class index.
- *     lg_grp: Lg group base size (no deltas added).
- *     lg_delta: Lg delta to previous size class.
- *     ndelta: Delta multiplier.  size == 1<<lg_grp + ndelta<<lg_delta
- *     psz: 'yes' if a multiple of the page size, 'no' otherwise.
- *     bin: 'yes' if a small bin size class, 'no' otherwise.
- *     pgs: Slab page count if a small bin size class, 0 otherwise.
- *     lg_delta_lookup: Same as lg_delta if a lookup table size class, 'no'
- *                      otherwise.
- *   NTBINS: Number of tiny bins.
- *   NLBINS: Number of bins supported by the lookup table.
- *   NBINS: Number of small size class bins.
- *   NSIZES: Number of size classes.
- *   LG_CEIL_NSIZES: Number of bits required to store NSIZES.
- *   NPSIZES: Number of size classes that are a multiple of (1U << LG_PAGE).
- *   LG_TINY_MAXCLASS: Lg of maximum tiny size class.
- *   LOOKUP_MAXCLASS: Maximum size class included in lookup table.
- *   SMALL_MAXCLASS: Maximum small size class.
- *   LG_LARGE_MINCLASS: Lg of minimum large size class.
- *   LARGE_MAXCLASS: Maximum (large) size class.
- */
-
-#define LG_SIZE_CLASS_GROUP	${lg_g}
-#define LG_TINY_MIN		${lg_tmin}
-
-EOF
-
-for lg_z in ${lg_zarr} ; do
-  for lg_q in ${lg_qarr} ; do
-    lg_t=${lg_tmin}
-    while [ ${lg_t} -le ${lg_q} ] ; do
-      # Iterate through page sizes and compute how many bins there are.
-      for lg_p in ${lg_parr} ; do
-        echo "#if (LG_SIZEOF_PTR == ${lg_z} && LG_TINY_MIN == ${lg_t} && LG_QUANTUM == ${lg_q} && LG_PAGE == ${lg_p})"
-        size_classes ${lg_z} ${lg_q} ${lg_t} ${lg_p} ${lg_g}
-        echo "#define SIZE_CLASSES_DEFINED"
-        echo "#define NTBINS			${ntbins}"
-        echo "#define NLBINS			${nlbins}"
-        echo "#define NBINS			${nbins}"
-        echo "#define NSIZES			${nsizes}"
-        echo "#define LG_CEIL_NSIZES		${lg_ceil_nsizes}"
-        echo "#define NPSIZES			${npsizes}"
-        echo "#define LG_TINY_MAXCLASS	${lg_tiny_maxclass}"
-        echo "#define LOOKUP_MAXCLASS		${lookup_maxclass}"
-        echo "#define SMALL_MAXCLASS		${small_maxclass}"
-        echo "#define LG_LARGE_MINCLASS	${lg_large_minclass}"
-        echo "#define LARGE_MINCLASS		(ZU(1) << LG_LARGE_MINCLASS)"
-        echo "#define LARGE_MAXCLASS		${large_maxclass}"
-        echo "#endif"
-        echo
-      done
-      lg_t=$((${lg_t} + 1))
-    done
-  done
-done
-
-cat <<EOF
-#ifndef SIZE_CLASSES_DEFINED
-#  error "No size class definitions match configuration"
-#endif
-#undef SIZE_CLASSES_DEFINED
-/*
- * The size2index_tab lookup table uses uint8_t to encode each bin index, so we
- * cannot support more than 256 small size classes.
- */
-#if (NBINS > 256)
-#  error "Too many small size classes"
-#endif
-
-#endif /* JEMALLOC_INTERNAL_SIZE_CLASSES_H */
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
deleted file mode 100644
index 2e14430f..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.h
+++ /dev/null
@@ -1,232 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_SMOOTHSTEP_H
-#define JEMALLOC_INTERNAL_SMOOTHSTEP_H
-
-/*
- * This file was generated by the following command:
- *   sh smoothstep.sh smoother 200 24 3 15
- */
-/******************************************************************************/
-
-/*
- * This header defines a precomputed table based on the smoothstep family of
- * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
- * to 1 in 0 <= x <= 1.  The table is stored as integer fixed point values so
- * that floating point math can be avoided.
- *
- *                      3     2
- *   smoothstep(x) = -2x  + 3x
- *
- *                       5      4      3
- *   smootherstep(x) = 6x  - 15x  + 10x
- *
- *                          7      6      5      4
- *   smootheststep(x) = -20x  + 70x  - 84x  + 35x
- */
-
-#define SMOOTHSTEP_VARIANT	"smoother"
-#define SMOOTHSTEP_NSTEPS	200
-#define SMOOTHSTEP_BFP		24
-#define SMOOTHSTEP \
- /* STEP(step, h,                            x,     y) */ \
-    STEP(   1, UINT64_C(0x0000000000000014), 0.005, 0.000001240643750) \
-    STEP(   2, UINT64_C(0x00000000000000a5), 0.010, 0.000009850600000) \
-    STEP(   3, UINT64_C(0x0000000000000229), 0.015, 0.000032995181250) \
-    STEP(   4, UINT64_C(0x0000000000000516), 0.020, 0.000077619200000) \
-    STEP(   5, UINT64_C(0x00000000000009dc), 0.025, 0.000150449218750) \
-    STEP(   6, UINT64_C(0x00000000000010e8), 0.030, 0.000257995800000) \
-    STEP(   7, UINT64_C(0x0000000000001aa4), 0.035, 0.000406555756250) \
-    STEP(   8, UINT64_C(0x0000000000002777), 0.040, 0.000602214400000) \
-    STEP(   9, UINT64_C(0x00000000000037c2), 0.045, 0.000850847793750) \
-    STEP(  10, UINT64_C(0x0000000000004be6), 0.050, 0.001158125000000) \
-    STEP(  11, UINT64_C(0x000000000000643c), 0.055, 0.001529510331250) \
-    STEP(  12, UINT64_C(0x000000000000811f), 0.060, 0.001970265600000) \
-    STEP(  13, UINT64_C(0x000000000000a2e2), 0.065, 0.002485452368750) \
-    STEP(  14, UINT64_C(0x000000000000c9d8), 0.070, 0.003079934200000) \
-    STEP(  15, UINT64_C(0x000000000000f64f), 0.075, 0.003758378906250) \
-    STEP(  16, UINT64_C(0x0000000000012891), 0.080, 0.004525260800000) \
-    STEP(  17, UINT64_C(0x00000000000160e7), 0.085, 0.005384862943750) \
-    STEP(  18, UINT64_C(0x0000000000019f95), 0.090, 0.006341279400000) \
-    STEP(  19, UINT64_C(0x000000000001e4dc), 0.095, 0.007398417481250) \
-    STEP(  20, UINT64_C(0x00000000000230fc), 0.100, 0.008560000000000) \
-    STEP(  21, UINT64_C(0x0000000000028430), 0.105, 0.009829567518750) \
-    STEP(  22, UINT64_C(0x000000000002deb0), 0.110, 0.011210480600000) \
-    STEP(  23, UINT64_C(0x00000000000340b1), 0.115, 0.012705922056250) \
-    STEP(  24, UINT64_C(0x000000000003aa67), 0.120, 0.014318899200000) \
-    STEP(  25, UINT64_C(0x0000000000041c00), 0.125, 0.016052246093750) \
-    STEP(  26, UINT64_C(0x00000000000495a8), 0.130, 0.017908625800000) \
-    STEP(  27, UINT64_C(0x000000000005178b), 0.135, 0.019890532631250) \
-    STEP(  28, UINT64_C(0x000000000005a1cf), 0.140, 0.022000294400000) \
-    STEP(  29, UINT64_C(0x0000000000063498), 0.145, 0.024240074668750) \
-    STEP(  30, UINT64_C(0x000000000006d009), 0.150, 0.026611875000000) \
-    STEP(  31, UINT64_C(0x000000000007743f), 0.155, 0.029117537206250) \
-    STEP(  32, UINT64_C(0x0000000000082157), 0.160, 0.031758745600000) \
-    STEP(  33, UINT64_C(0x000000000008d76b), 0.165, 0.034537029243750) \
-    STEP(  34, UINT64_C(0x0000000000099691), 0.170, 0.037453764200000) \
-    STEP(  35, UINT64_C(0x00000000000a5edf), 0.175, 0.040510175781250) \
-    STEP(  36, UINT64_C(0x00000000000b3067), 0.180, 0.043707340800000) \
-    STEP(  37, UINT64_C(0x00000000000c0b38), 0.185, 0.047046189818750) \
-    STEP(  38, UINT64_C(0x00000000000cef5e), 0.190, 0.050527509400000) \
-    STEP(  39, UINT64_C(0x00000000000ddce6), 0.195, 0.054151944356250) \
-    STEP(  40, UINT64_C(0x00000000000ed3d8), 0.200, 0.057920000000000) \
-    STEP(  41, UINT64_C(0x00000000000fd439), 0.205, 0.061832044393750) \
-    STEP(  42, UINT64_C(0x000000000010de0e), 0.210, 0.065888310600000) \
-    STEP(  43, UINT64_C(0x000000000011f158), 0.215, 0.070088898931250) \
-    STEP(  44, UINT64_C(0x0000000000130e17), 0.220, 0.074433779200000) \
-    STEP(  45, UINT64_C(0x0000000000143448), 0.225, 0.078922792968750) \
-    STEP(  46, UINT64_C(0x00000000001563e7), 0.230, 0.083555655800000) \
-    STEP(  47, UINT64_C(0x0000000000169cec), 0.235, 0.088331959506250) \
-    STEP(  48, UINT64_C(0x000000000017df4f), 0.240, 0.093251174400000) \
-    STEP(  49, UINT64_C(0x0000000000192b04), 0.245, 0.098312651543750) \
-    STEP(  50, UINT64_C(0x00000000001a8000), 0.250, 0.103515625000000) \
-    STEP(  51, UINT64_C(0x00000000001bde32), 0.255, 0.108859214081250) \
-    STEP(  52, UINT64_C(0x00000000001d458b), 0.260, 0.114342425600000) \
-    STEP(  53, UINT64_C(0x00000000001eb5f8), 0.265, 0.119964156118750) \
-    STEP(  54, UINT64_C(0x0000000000202f65), 0.270, 0.125723194200000) \
-    STEP(  55, UINT64_C(0x000000000021b1bb), 0.275, 0.131618222656250) \
-    STEP(  56, UINT64_C(0x0000000000233ce3), 0.280, 0.137647820800000) \
-    STEP(  57, UINT64_C(0x000000000024d0c3), 0.285, 0.143810466693750) \
-    STEP(  58, UINT64_C(0x0000000000266d40), 0.290, 0.150104539400000) \
-    STEP(  59, UINT64_C(0x000000000028123d), 0.295, 0.156528321231250) \
-    STEP(  60, UINT64_C(0x000000000029bf9c), 0.300, 0.163080000000000) \
-    STEP(  61, UINT64_C(0x00000000002b753d), 0.305, 0.169757671268750) \
-    STEP(  62, UINT64_C(0x00000000002d32fe), 0.310, 0.176559340600000) \
-    STEP(  63, UINT64_C(0x00000000002ef8bc), 0.315, 0.183482925806250) \
-    STEP(  64, UINT64_C(0x000000000030c654), 0.320, 0.190526259200000) \
-    STEP(  65, UINT64_C(0x0000000000329b9f), 0.325, 0.197687089843750) \
-    STEP(  66, UINT64_C(0x0000000000347875), 0.330, 0.204963085800000) \
-    STEP(  67, UINT64_C(0x0000000000365cb0), 0.335, 0.212351836381250) \
-    STEP(  68, UINT64_C(0x0000000000384825), 0.340, 0.219850854400000) \
-    STEP(  69, UINT64_C(0x00000000003a3aa8), 0.345, 0.227457578418750) \
-    STEP(  70, UINT64_C(0x00000000003c340f), 0.350, 0.235169375000000) \
-    STEP(  71, UINT64_C(0x00000000003e342b), 0.355, 0.242983540956250) \
-    STEP(  72, UINT64_C(0x0000000000403ace), 0.360, 0.250897305600000) \
-    STEP(  73, UINT64_C(0x00000000004247c8), 0.365, 0.258907832993750) \
-    STEP(  74, UINT64_C(0x0000000000445ae9), 0.370, 0.267012224200000) \
-    STEP(  75, UINT64_C(0x0000000000467400), 0.375, 0.275207519531250) \
-    STEP(  76, UINT64_C(0x00000000004892d8), 0.380, 0.283490700800000) \
-    STEP(  77, UINT64_C(0x00000000004ab740), 0.385, 0.291858693568750) \
-    STEP(  78, UINT64_C(0x00000000004ce102), 0.390, 0.300308369400000) \
-    STEP(  79, UINT64_C(0x00000000004f0fe9), 0.395, 0.308836548106250) \
-    STEP(  80, UINT64_C(0x00000000005143bf), 0.400, 0.317440000000000) \
-    STEP(  81, UINT64_C(0x0000000000537c4d), 0.405, 0.326115448143750) \
-    STEP(  82, UINT64_C(0x000000000055b95b), 0.410, 0.334859570600000) \
-    STEP(  83, UINT64_C(0x000000000057fab1), 0.415, 0.343669002681250) \
-    STEP(  84, UINT64_C(0x00000000005a4015), 0.420, 0.352540339200000) \
-    STEP(  85, UINT64_C(0x00000000005c894e), 0.425, 0.361470136718750) \
-    STEP(  86, UINT64_C(0x00000000005ed622), 0.430, 0.370454915800000) \
-    STEP(  87, UINT64_C(0x0000000000612655), 0.435, 0.379491163256250) \
-    STEP(  88, UINT64_C(0x00000000006379ac), 0.440, 0.388575334400000) \
-    STEP(  89, UINT64_C(0x000000000065cfeb), 0.445, 0.397703855293750) \
-    STEP(  90, UINT64_C(0x00000000006828d6), 0.450, 0.406873125000000) \
-    STEP(  91, UINT64_C(0x00000000006a842f), 0.455, 0.416079517831250) \
-    STEP(  92, UINT64_C(0x00000000006ce1bb), 0.460, 0.425319385600000) \
-    STEP(  93, UINT64_C(0x00000000006f413a), 0.465, 0.434589059868750) \
-    STEP(  94, UINT64_C(0x000000000071a270), 0.470, 0.443884854200000) \
-    STEP(  95, UINT64_C(0x000000000074051d), 0.475, 0.453203066406250) \
-    STEP(  96, UINT64_C(0x0000000000766905), 0.480, 0.462539980800000) \
-    STEP(  97, UINT64_C(0x000000000078cde7), 0.485, 0.471891870443750) \
-    STEP(  98, UINT64_C(0x00000000007b3387), 0.490, 0.481254999400000) \
-    STEP(  99, UINT64_C(0x00000000007d99a4), 0.495, 0.490625624981250) \
-    STEP( 100, UINT64_C(0x0000000000800000), 0.500, 0.500000000000000) \
-    STEP( 101, UINT64_C(0x000000000082665b), 0.505, 0.509374375018750) \
-    STEP( 102, UINT64_C(0x000000000084cc78), 0.510, 0.518745000600000) \
-    STEP( 103, UINT64_C(0x0000000000873218), 0.515, 0.528108129556250) \
-    STEP( 104, UINT64_C(0x00000000008996fa), 0.520, 0.537460019200000) \
-    STEP( 105, UINT64_C(0x00000000008bfae2), 0.525, 0.546796933593750) \
-    STEP( 106, UINT64_C(0x00000000008e5d8f), 0.530, 0.556115145800000) \
-    STEP( 107, UINT64_C(0x000000000090bec5), 0.535, 0.565410940131250) \
-    STEP( 108, UINT64_C(0x0000000000931e44), 0.540, 0.574680614400000) \
-    STEP( 109, UINT64_C(0x0000000000957bd0), 0.545, 0.583920482168750) \
-    STEP( 110, UINT64_C(0x000000000097d729), 0.550, 0.593126875000000) \
-    STEP( 111, UINT64_C(0x00000000009a3014), 0.555, 0.602296144706250) \
-    STEP( 112, UINT64_C(0x00000000009c8653), 0.560, 0.611424665600000) \
-    STEP( 113, UINT64_C(0x00000000009ed9aa), 0.565, 0.620508836743750) \
-    STEP( 114, UINT64_C(0x0000000000a129dd), 0.570, 0.629545084200000) \
-    STEP( 115, UINT64_C(0x0000000000a376b1), 0.575, 0.638529863281250) \
-    STEP( 116, UINT64_C(0x0000000000a5bfea), 0.580, 0.647459660800000) \
-    STEP( 117, UINT64_C(0x0000000000a8054e), 0.585, 0.656330997318750) \
-    STEP( 118, UINT64_C(0x0000000000aa46a4), 0.590, 0.665140429400000) \
-    STEP( 119, UINT64_C(0x0000000000ac83b2), 0.595, 0.673884551856250) \
-    STEP( 120, UINT64_C(0x0000000000aebc40), 0.600, 0.682560000000000) \
-    STEP( 121, UINT64_C(0x0000000000b0f016), 0.605, 0.691163451893750) \
-    STEP( 122, UINT64_C(0x0000000000b31efd), 0.610, 0.699691630600000) \
-    STEP( 123, UINT64_C(0x0000000000b548bf), 0.615, 0.708141306431250) \
-    STEP( 124, UINT64_C(0x0000000000b76d27), 0.620, 0.716509299200000) \
-    STEP( 125, UINT64_C(0x0000000000b98c00), 0.625, 0.724792480468750) \
-    STEP( 126, UINT64_C(0x0000000000bba516), 0.630, 0.732987775800000) \
-    STEP( 127, UINT64_C(0x0000000000bdb837), 0.635, 0.741092167006250) \
-    STEP( 128, UINT64_C(0x0000000000bfc531), 0.640, 0.749102694400000) \
-    STEP( 129, UINT64_C(0x0000000000c1cbd4), 0.645, 0.757016459043750) \
-    STEP( 130, UINT64_C(0x0000000000c3cbf0), 0.650, 0.764830625000000) \
-    STEP( 131, UINT64_C(0x0000000000c5c557), 0.655, 0.772542421581250) \
-    STEP( 132, UINT64_C(0x0000000000c7b7da), 0.660, 0.780149145600000) \
-    STEP( 133, UINT64_C(0x0000000000c9a34f), 0.665, 0.787648163618750) \
-    STEP( 134, UINT64_C(0x0000000000cb878a), 0.670, 0.795036914200000) \
-    STEP( 135, UINT64_C(0x0000000000cd6460), 0.675, 0.802312910156250) \
-    STEP( 136, UINT64_C(0x0000000000cf39ab), 0.680, 0.809473740800000) \
-    STEP( 137, UINT64_C(0x0000000000d10743), 0.685, 0.816517074193750) \
-    STEP( 138, UINT64_C(0x0000000000d2cd01), 0.690, 0.823440659400000) \
-    STEP( 139, UINT64_C(0x0000000000d48ac2), 0.695, 0.830242328731250) \
-    STEP( 140, UINT64_C(0x0000000000d64063), 0.700, 0.836920000000000) \
-    STEP( 141, UINT64_C(0x0000000000d7edc2), 0.705, 0.843471678768750) \
-    STEP( 142, UINT64_C(0x0000000000d992bf), 0.710, 0.849895460600000) \
-    STEP( 143, UINT64_C(0x0000000000db2f3c), 0.715, 0.856189533306250) \
-    STEP( 144, UINT64_C(0x0000000000dcc31c), 0.720, 0.862352179200000) \
-    STEP( 145, UINT64_C(0x0000000000de4e44), 0.725, 0.868381777343750) \
-    STEP( 146, UINT64_C(0x0000000000dfd09a), 0.730, 0.874276805800000) \
-    STEP( 147, UINT64_C(0x0000000000e14a07), 0.735, 0.880035843881250) \
-    STEP( 148, UINT64_C(0x0000000000e2ba74), 0.740, 0.885657574400000) \
-    STEP( 149, UINT64_C(0x0000000000e421cd), 0.745, 0.891140785918750) \
-    STEP( 150, UINT64_C(0x0000000000e58000), 0.750, 0.896484375000000) \
-    STEP( 151, UINT64_C(0x0000000000e6d4fb), 0.755, 0.901687348456250) \
-    STEP( 152, UINT64_C(0x0000000000e820b0), 0.760, 0.906748825600000) \
-    STEP( 153, UINT64_C(0x0000000000e96313), 0.765, 0.911668040493750) \
-    STEP( 154, UINT64_C(0x0000000000ea9c18), 0.770, 0.916444344200000) \
-    STEP( 155, UINT64_C(0x0000000000ebcbb7), 0.775, 0.921077207031250) \
-    STEP( 156, UINT64_C(0x0000000000ecf1e8), 0.780, 0.925566220800000) \
-    STEP( 157, UINT64_C(0x0000000000ee0ea7), 0.785, 0.929911101068750) \
-    STEP( 158, UINT64_C(0x0000000000ef21f1), 0.790, 0.934111689400000) \
-    STEP( 159, UINT64_C(0x0000000000f02bc6), 0.795, 0.938167955606250) \
-    STEP( 160, UINT64_C(0x0000000000f12c27), 0.800, 0.942080000000000) \
-    STEP( 161, UINT64_C(0x0000000000f22319), 0.805, 0.945848055643750) \
-    STEP( 162, UINT64_C(0x0000000000f310a1), 0.810, 0.949472490600000) \
-    STEP( 163, UINT64_C(0x0000000000f3f4c7), 0.815, 0.952953810181250) \
-    STEP( 164, UINT64_C(0x0000000000f4cf98), 0.820, 0.956292659200000) \
-    STEP( 165, UINT64_C(0x0000000000f5a120), 0.825, 0.959489824218750) \
-    STEP( 166, UINT64_C(0x0000000000f6696e), 0.830, 0.962546235800000) \
-    STEP( 167, UINT64_C(0x0000000000f72894), 0.835, 0.965462970756250) \
-    STEP( 168, UINT64_C(0x0000000000f7dea8), 0.840, 0.968241254400000) \
-    STEP( 169, UINT64_C(0x0000000000f88bc0), 0.845, 0.970882462793750) \
-    STEP( 170, UINT64_C(0x0000000000f92ff6), 0.850, 0.973388125000000) \
-    STEP( 171, UINT64_C(0x0000000000f9cb67), 0.855, 0.975759925331250) \
-    STEP( 172, UINT64_C(0x0000000000fa5e30), 0.860, 0.977999705600000) \
-    STEP( 173, UINT64_C(0x0000000000fae874), 0.865, 0.980109467368750) \
-    STEP( 174, UINT64_C(0x0000000000fb6a57), 0.870, 0.982091374200000) \
-    STEP( 175, UINT64_C(0x0000000000fbe400), 0.875, 0.983947753906250) \
-    STEP( 176, UINT64_C(0x0000000000fc5598), 0.880, 0.985681100800000) \
-    STEP( 177, UINT64_C(0x0000000000fcbf4e), 0.885, 0.987294077943750) \
-    STEP( 178, UINT64_C(0x0000000000fd214f), 0.890, 0.988789519400000) \
-    STEP( 179, UINT64_C(0x0000000000fd7bcf), 0.895, 0.990170432481250) \
-    STEP( 180, UINT64_C(0x0000000000fdcf03), 0.900, 0.991440000000000) \
-    STEP( 181, UINT64_C(0x0000000000fe1b23), 0.905, 0.992601582518750) \
-    STEP( 182, UINT64_C(0x0000000000fe606a), 0.910, 0.993658720600000) \
-    STEP( 183, UINT64_C(0x0000000000fe9f18), 0.915, 0.994615137056250) \
-    STEP( 184, UINT64_C(0x0000000000fed76e), 0.920, 0.995474739200000) \
-    STEP( 185, UINT64_C(0x0000000000ff09b0), 0.925, 0.996241621093750) \
-    STEP( 186, UINT64_C(0x0000000000ff3627), 0.930, 0.996920065800000) \
-    STEP( 187, UINT64_C(0x0000000000ff5d1d), 0.935, 0.997514547631250) \
-    STEP( 188, UINT64_C(0x0000000000ff7ee0), 0.940, 0.998029734400000) \
-    STEP( 189, UINT64_C(0x0000000000ff9bc3), 0.945, 0.998470489668750) \
-    STEP( 190, UINT64_C(0x0000000000ffb419), 0.950, 0.998841875000000) \
-    STEP( 191, UINT64_C(0x0000000000ffc83d), 0.955, 0.999149152206250) \
-    STEP( 192, UINT64_C(0x0000000000ffd888), 0.960, 0.999397785600000) \
-    STEP( 193, UINT64_C(0x0000000000ffe55b), 0.965, 0.999593444243750) \
-    STEP( 194, UINT64_C(0x0000000000ffef17), 0.970, 0.999742004200000) \
-    STEP( 195, UINT64_C(0x0000000000fff623), 0.975, 0.999849550781250) \
-    STEP( 196, UINT64_C(0x0000000000fffae9), 0.980, 0.999922380800000) \
-    STEP( 197, UINT64_C(0x0000000000fffdd6), 0.985, 0.999967004818750) \
-    STEP( 198, UINT64_C(0x0000000000ffff5a), 0.990, 0.999990149400000) \
-    STEP( 199, UINT64_C(0x0000000000ffffeb), 0.995, 0.999998759356250) \
-    STEP( 200, UINT64_C(0x0000000001000000), 1.000, 1.000000000000000) \
-
-#endif /* JEMALLOC_INTERNAL_SMOOTHSTEP_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh b/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
deleted file mode 100755
index 65de97bf..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/smoothstep.sh
+++ /dev/null
@@ -1,101 +0,0 @@
-#!/bin/sh
-#
-# Generate a discrete lookup table for a sigmoid function in the smoothstep
-# family (https://en.wikipedia.org/wiki/Smoothstep), where the lookup table
-# entries correspond to x in [1/nsteps, 2/nsteps, ..., nsteps/nsteps].  Encode
-# the entries using a binary fixed point representation.
-#
-# Usage: smoothstep.sh <variant> <nsteps> <bfp> <xprec> <yprec>
-#
-#        <variant> is in {smooth, smoother, smoothest}.
-#        <nsteps> must be greater than zero.
-#        <bfp> must be in [0..62]; reasonable values are roughly [10..30].
-#        <xprec> is x decimal precision.
-#        <yprec> is y decimal precision.
-
-#set -x
-
-cmd="sh smoothstep.sh $*"
-variant=$1
-nsteps=$2
-bfp=$3
-xprec=$4
-yprec=$5
-
-case "${variant}" in
-  smooth)
-    ;;
-  smoother)
-    ;;
-  smoothest)
-    ;;
-  *)
-    echo "Unsupported variant"
-    exit 1
-    ;;
-esac
-
-smooth() {
-  step=$1
-  y=`echo ${yprec} k ${step} ${nsteps} / sx _2 lx 3 ^ '*' 3 lx 2 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
-  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
-}
-
-smoother() {
-  step=$1
-  y=`echo ${yprec} k ${step} ${nsteps} / sx 6 lx 5 ^ '*' _15 lx 4 ^ '*' + 10 lx 3 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
-  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
-}
-
-smoothest() {
-  step=$1
-  y=`echo ${yprec} k ${step} ${nsteps} / sx _20 lx 7 ^ '*' 70 lx 6 ^ '*' + _84 lx 5 ^ '*' + 35 lx 4 ^ '*' + p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
-  h=`echo ${yprec} k 2 ${bfp} ^ ${y} '*' p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g' | tr '.' ' ' | awk '{print $1}' `
-}
-
-cat <<EOF
-#ifndef JEMALLOC_INTERNAL_SMOOTHSTEP_H
-#define JEMALLOC_INTERNAL_SMOOTHSTEP_H
-
-/*
- * This file was generated by the following command:
- *   $cmd
- */
-/******************************************************************************/
-
-/*
- * This header defines a precomputed table based on the smoothstep family of
- * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
- * to 1 in 0 <= x <= 1.  The table is stored as integer fixed point values so
- * that floating point math can be avoided.
- *
- *                      3     2
- *   smoothstep(x) = -2x  + 3x
- *
- *                       5      4      3
- *   smootherstep(x) = 6x  - 15x  + 10x
- *
- *                          7      6      5      4
- *   smootheststep(x) = -20x  + 70x  - 84x  + 35x
- */
-
-#define SMOOTHSTEP_VARIANT	"${variant}"
-#define SMOOTHSTEP_NSTEPS	${nsteps}
-#define SMOOTHSTEP_BFP		${bfp}
-#define SMOOTHSTEP \\
- /* STEP(step, h,                            x,     y) */ \\
-EOF
-
-s=1
-while [ $s -le $nsteps ] ; do
-  $variant ${s}
-  x=`echo ${xprec} k ${s} ${nsteps} / p | dc | tr -d '\\\\\n' | sed -e 's#^\.#0.#g'`
-  printf '    STEP(%4d, UINT64_C(0x%016x), %s, %s) \\\n' ${s} ${h} ${x} ${y}
-
-  s=$((s+1))
-done
-echo
-
-cat <<EOF
-#endif /* JEMALLOC_INTERNAL_SMOOTHSTEP_H */
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
deleted file mode 100644
index 22804c68..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/spin.h
+++ /dev/null
@@ -1,40 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_SPIN_H
-#define JEMALLOC_INTERNAL_SPIN_H
-
-#define SPIN_INITIALIZER {0U}
-
-typedef struct {
-	unsigned iteration;
-} spin_t;
-
-static inline void
-spin_cpu_spinwait() {
-#  if HAVE_CPU_SPINWAIT
-	CPU_SPINWAIT;
-#  else
-	volatile int x = 0;
-	x = x;
-#  endif
-}
-
-static inline void
-spin_adaptive(spin_t *spin) {
-	volatile uint32_t i;
-
-	if (spin->iteration < 5) {
-		for (i = 0; i < (1U << spin->iteration); i++) {
-			spin_cpu_spinwait();
-		}
-		spin->iteration++;
-	} else {
-#ifdef _WIN32
-		SwitchToThread();
-#else
-		sched_yield();
-#endif
-	}
-}
-
-#undef SPIN_INLINE
-
-#endif /* JEMALLOC_INTERNAL_SPIN_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
deleted file mode 100644
index 852e3426..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/stats.h
+++ /dev/null
@@ -1,30 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_STATS_H
-#define JEMALLOC_INTERNAL_STATS_H
-
-/*  OPTION(opt,		var_name,	default,	set_value_to) */
-#define STATS_PRINT_OPTIONS						\
-    OPTION('J',		json,		false,		true)		\
-    OPTION('g',		general,	true,		false)		\
-    OPTION('m',		merged,		config_stats,	false)		\
-    OPTION('d',		destroyed,	config_stats,	false)		\
-    OPTION('a',		unmerged,	config_stats,	false)		\
-    OPTION('b',		bins,		true,		false)		\
-    OPTION('l',		large,		true,		false)		\
-    OPTION('x',		mutex,		true,		false)
-
-enum {
-#define OPTION(o, v, d, s) stats_print_option_num_##v,
-    STATS_PRINT_OPTIONS
-#undef OPTION
-    stats_print_tot_num_options
-};
-
-/* Options for stats_print. */
-extern bool opt_stats_print;
-extern char opt_stats_print_opts[stats_print_tot_num_options+1];
-
-/* Implements je_malloc_stats_print. */
-void stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *opts);
-
-#endif /* JEMALLOC_INTERNAL_STATS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
deleted file mode 100644
index 97946289..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/sz.h
+++ /dev/null
@@ -1,317 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_SIZE_H
-#define JEMALLOC_INTERNAL_SIZE_H
-
-#include "jemalloc/internal/bit_util.h"
-#include "jemalloc/internal/pages.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/util.h"
-
-/*
- * sz module: Size computations.
- *
- * Some abbreviations used here:
- *   p: Page
- *   ind: Index
- *   s, sz: Size
- *   u: Usable size
- *   a: Aligned
- *
- * These are not always used completely consistently, but should be enough to
- * interpret function names.  E.g. sz_psz2ind converts page size to page size
- * index; sz_sa2u converts a (size, alignment) allocation request to the usable
- * size that would result from such an allocation.
- */
-
-/*
- * sz_pind2sz_tab encodes the same information as could be computed by
- * sz_pind2sz_compute().
- */
-extern size_t const sz_pind2sz_tab[NPSIZES+1];
-/*
- * sz_index2size_tab encodes the same information as could be computed (at
- * unacceptable cost in some code paths) by sz_index2size_compute().
- */
-extern size_t const sz_index2size_tab[NSIZES];
-/*
- * sz_size2index_tab is a compact lookup table that rounds request sizes up to
- * size classes.  In order to reduce cache footprint, the table is compressed,
- * and all accesses are via sz_size2index().
- */
-extern uint8_t const sz_size2index_tab[];
-
-static const size_t sz_large_pad =
-#ifdef JEMALLOC_CACHE_OBLIVIOUS
-    PAGE
-#else
-    0
-#endif
-    ;
-
-JEMALLOC_ALWAYS_INLINE pszind_t
-sz_psz2ind(size_t psz) {
-	if (unlikely(psz > LARGE_MAXCLASS)) {
-		return NPSIZES;
-	}
-	{
-		pszind_t x = lg_floor((psz<<1)-1);
-		pszind_t shift = (x < LG_SIZE_CLASS_GROUP + LG_PAGE) ? 0 : x -
-		    (LG_SIZE_CLASS_GROUP + LG_PAGE);
-		pszind_t grp = shift << LG_SIZE_CLASS_GROUP;
-
-		pszind_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_PAGE + 1) ?
-		    LG_PAGE : x - LG_SIZE_CLASS_GROUP - 1;
-
-		size_t delta_inverse_mask = ZU(-1) << lg_delta;
-		pszind_t mod = ((((psz-1) & delta_inverse_mask) >> lg_delta)) &
-		    ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
-
-		pszind_t ind = grp + mod;
-		return ind;
-	}
-}
-
-static inline size_t
-sz_pind2sz_compute(pszind_t pind) {
-	if (unlikely(pind == NPSIZES)) {
-		return LARGE_MAXCLASS + PAGE;
-	}
-	{
-		size_t grp = pind >> LG_SIZE_CLASS_GROUP;
-		size_t mod = pind & ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
-
-		size_t grp_size_mask = ~((!!grp)-1);
-		size_t grp_size = ((ZU(1) << (LG_PAGE +
-		    (LG_SIZE_CLASS_GROUP-1))) << grp) & grp_size_mask;
-
-		size_t shift = (grp == 0) ? 1 : grp;
-		size_t lg_delta = shift + (LG_PAGE-1);
-		size_t mod_size = (mod+1) << lg_delta;
-
-		size_t sz = grp_size + mod_size;
-		return sz;
-	}
-}
-
-static inline size_t
-sz_pind2sz_lookup(pszind_t pind) {
-	size_t ret = (size_t)sz_pind2sz_tab[pind];
-	assert(ret == sz_pind2sz_compute(pind));
-	return ret;
-}
-
-static inline size_t
-sz_pind2sz(pszind_t pind) {
-	assert(pind < NPSIZES+1);
-	return sz_pind2sz_lookup(pind);
-}
-
-static inline size_t
-sz_psz2u(size_t psz) {
-	if (unlikely(psz > LARGE_MAXCLASS)) {
-		return LARGE_MAXCLASS + PAGE;
-	}
-	{
-		size_t x = lg_floor((psz<<1)-1);
-		size_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_PAGE + 1) ?
-		    LG_PAGE : x - LG_SIZE_CLASS_GROUP - 1;
-		size_t delta = ZU(1) << lg_delta;
-		size_t delta_mask = delta - 1;
-		size_t usize = (psz + delta_mask) & ~delta_mask;
-		return usize;
-	}
-}
-
-static inline szind_t
-sz_size2index_compute(size_t size) {
-	if (unlikely(size > LARGE_MAXCLASS)) {
-		return NSIZES;
-	}
-#if (NTBINS != 0)
-	if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
-		szind_t lg_tmin = LG_TINY_MAXCLASS - NTBINS + 1;
-		szind_t lg_ceil = lg_floor(pow2_ceil_zu(size));
-		return (lg_ceil < lg_tmin ? 0 : lg_ceil - lg_tmin);
-	}
-#endif
-	{
-		szind_t x = lg_floor((size<<1)-1);
-		szind_t shift = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM) ? 0 :
-		    x - (LG_SIZE_CLASS_GROUP + LG_QUANTUM);
-		szind_t grp = shift << LG_SIZE_CLASS_GROUP;
-
-		szind_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM + 1)
-		    ? LG_QUANTUM : x - LG_SIZE_CLASS_GROUP - 1;
-
-		size_t delta_inverse_mask = ZU(-1) << lg_delta;
-		szind_t mod = ((((size-1) & delta_inverse_mask) >> lg_delta)) &
-		    ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
-
-		szind_t index = NTBINS + grp + mod;
-		return index;
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE szind_t
-sz_size2index_lookup(size_t size) {
-	assert(size <= LOOKUP_MAXCLASS);
-	{
-		szind_t ret = (sz_size2index_tab[(size-1) >> LG_TINY_MIN]);
-		assert(ret == sz_size2index_compute(size));
-		return ret;
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE szind_t
-sz_size2index(size_t size) {
-	assert(size > 0);
-	if (likely(size <= LOOKUP_MAXCLASS)) {
-		return sz_size2index_lookup(size);
-	}
-	return sz_size2index_compute(size);
-}
-
-static inline size_t
-sz_index2size_compute(szind_t index) {
-#if (NTBINS > 0)
-	if (index < NTBINS) {
-		return (ZU(1) << (LG_TINY_MAXCLASS - NTBINS + 1 + index));
-	}
-#endif
-	{
-		size_t reduced_index = index - NTBINS;
-		size_t grp = reduced_index >> LG_SIZE_CLASS_GROUP;
-		size_t mod = reduced_index & ((ZU(1) << LG_SIZE_CLASS_GROUP) -
-		    1);
-
-		size_t grp_size_mask = ~((!!grp)-1);
-		size_t grp_size = ((ZU(1) << (LG_QUANTUM +
-		    (LG_SIZE_CLASS_GROUP-1))) << grp) & grp_size_mask;
-
-		size_t shift = (grp == 0) ? 1 : grp;
-		size_t lg_delta = shift + (LG_QUANTUM-1);
-		size_t mod_size = (mod+1) << lg_delta;
-
-		size_t usize = grp_size + mod_size;
-		return usize;
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-sz_index2size_lookup(szind_t index) {
-	size_t ret = (size_t)sz_index2size_tab[index];
-	assert(ret == sz_index2size_compute(index));
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-sz_index2size(szind_t index) {
-	assert(index < NSIZES);
-	return sz_index2size_lookup(index);
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-sz_s2u_compute(size_t size) {
-	if (unlikely(size > LARGE_MAXCLASS)) {
-		return 0;
-	}
-#if (NTBINS > 0)
-	if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
-		size_t lg_tmin = LG_TINY_MAXCLASS - NTBINS + 1;
-		size_t lg_ceil = lg_floor(pow2_ceil_zu(size));
-		return (lg_ceil < lg_tmin ? (ZU(1) << lg_tmin) :
-		    (ZU(1) << lg_ceil));
-	}
-#endif
-	{
-		size_t x = lg_floor((size<<1)-1);
-		size_t lg_delta = (x < LG_SIZE_CLASS_GROUP + LG_QUANTUM + 1)
-		    ?  LG_QUANTUM : x - LG_SIZE_CLASS_GROUP - 1;
-		size_t delta = ZU(1) << lg_delta;
-		size_t delta_mask = delta - 1;
-		size_t usize = (size + delta_mask) & ~delta_mask;
-		return usize;
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-sz_s2u_lookup(size_t size) {
-	size_t ret = sz_index2size_lookup(sz_size2index_lookup(size));
-
-	assert(ret == sz_s2u_compute(size));
-	return ret;
-}
-
-/*
- * Compute usable size that would result from allocating an object with the
- * specified size.
- */
-JEMALLOC_ALWAYS_INLINE size_t
-sz_s2u(size_t size) {
-	assert(size > 0);
-	if (likely(size <= LOOKUP_MAXCLASS)) {
-		return sz_s2u_lookup(size);
-	}
-	return sz_s2u_compute(size);
-}
-
-/*
- * Compute usable size that would result from allocating an object with the
- * specified size and alignment.
- */
-JEMALLOC_ALWAYS_INLINE size_t
-sz_sa2u(size_t size, size_t alignment) {
-	size_t usize;
-
-	assert(alignment != 0 && ((alignment - 1) & alignment) == 0);
-
-	/* Try for a small size class. */
-	if (size <= SMALL_MAXCLASS && alignment < PAGE) {
-		/*
-		 * Round size up to the nearest multiple of alignment.
-		 *
-		 * This done, we can take advantage of the fact that for each
-		 * small size class, every object is aligned at the smallest
-		 * power of two that is non-zero in the base two representation
-		 * of the size.  For example:
-		 *
-		 *   Size |   Base 2 | Minimum alignment
-		 *   -----+----------+------------------
-		 *     96 |  1100000 |  32
-		 *    144 | 10100000 |  32
-		 *    192 | 11000000 |  64
-		 */
-		usize = sz_s2u(ALIGNMENT_CEILING(size, alignment));
-		if (usize < LARGE_MINCLASS) {
-			return usize;
-		}
-	}
-
-	/* Large size class.  Beware of overflow. */
-
-	if (unlikely(alignment > LARGE_MAXCLASS)) {
-		return 0;
-	}
-
-	/* Make sure result is a large size class. */
-	if (size <= LARGE_MINCLASS) {
-		usize = LARGE_MINCLASS;
-	} else {
-		usize = sz_s2u(size);
-		if (usize < size) {
-			/* size_t overflow. */
-			return 0;
-		}
-	}
-
-	/*
-	 * Calculate the multi-page mapping that large_palloc() would need in
-	 * order to guarantee the alignment.
-	 */
-	if (usize + sz_large_pad + PAGE_CEILING(alignment) - PAGE < usize) {
-		/* size_t overflow. */
-		return 0;
-	}
-	return usize;
-}
-
-#endif /* JEMALLOC_INTERNAL_SIZE_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
deleted file mode 100644
index 790367bd..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_externs.h
+++ /dev/null
@@ -1,55 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TCACHE_EXTERNS_H
-#define JEMALLOC_INTERNAL_TCACHE_EXTERNS_H
-
-#include "jemalloc/internal/size_classes.h"
-
-extern bool	opt_tcache;
-extern ssize_t	opt_lg_tcache_max;
-
-extern cache_bin_info_t	*tcache_bin_info;
-
-/*
- * Number of tcache bins.  There are NBINS small-object bins, plus 0 or more
- * large-object bins.
- */
-extern unsigned	nhbins;
-
-/* Maximum cached size class. */
-extern size_t	tcache_maxclass;
-
-/*
- * Explicit tcaches, managed via the tcache.{create,flush,destroy} mallctls and
- * usable via the MALLOCX_TCACHE() flag.  The automatic per thread tcaches are
- * completely disjoint from this data structure.  tcaches starts off as a sparse
- * array, so it has no physical memory footprint until individual pages are
- * touched.  This allows the entire array to be allocated the first time an
- * explicit tcache is created without a disproportionate impact on memory usage.
- */
-extern tcaches_t	*tcaches;
-
-size_t	tcache_salloc(tsdn_t *tsdn, const void *ptr);
-void	tcache_event_hard(tsd_t *tsd, tcache_t *tcache);
-void	*tcache_alloc_small_hard(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
-    cache_bin_t *tbin, szind_t binind, bool *tcache_success);
-void	tcache_bin_flush_small(tsd_t *tsd, tcache_t *tcache, cache_bin_t *tbin,
-    szind_t binind, unsigned rem);
-void	tcache_bin_flush_large(tsd_t *tsd, cache_bin_t *tbin, szind_t binind,
-    unsigned rem, tcache_t *tcache);
-void	tcache_arena_reassociate(tsdn_t *tsdn, tcache_t *tcache,
-    arena_t *arena);
-tcache_t *tcache_create_explicit(tsd_t *tsd);
-void	tcache_cleanup(tsd_t *tsd);
-void	tcache_stats_merge(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena);
-bool	tcaches_create(tsd_t *tsd, unsigned *r_ind);
-void	tcaches_flush(tsd_t *tsd, unsigned ind);
-void	tcaches_destroy(tsd_t *tsd, unsigned ind);
-bool	tcache_boot(tsdn_t *tsdn);
-void tcache_arena_associate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena);
-void tcache_prefork(tsdn_t *tsdn);
-void tcache_postfork_parent(tsdn_t *tsdn);
-void tcache_postfork_child(tsdn_t *tsdn);
-void tcache_flush(tsd_t *tsd);
-bool tsd_tcache_data_init(tsd_t *tsd);
-bool tsd_tcache_enabled_data_init(tsd_t *tsd);
-
-#endif /* JEMALLOC_INTERNAL_TCACHE_EXTERNS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
deleted file mode 100644
index 0f6ab8cb..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_inlines.h
+++ /dev/null
@@ -1,223 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TCACHE_INLINES_H
-#define JEMALLOC_INTERNAL_TCACHE_INLINES_H
-
-#include "jemalloc/internal/bin.h"
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/sz.h"
-#include "jemalloc/internal/ticker.h"
-#include "jemalloc/internal/util.h"
-
-static inline bool
-tcache_enabled_get(tsd_t *tsd) {
-	return tsd_tcache_enabled_get(tsd);
-}
-
-static inline void
-tcache_enabled_set(tsd_t *tsd, bool enabled) {
-	bool was_enabled = tsd_tcache_enabled_get(tsd);
-
-	if (!was_enabled && enabled) {
-		tsd_tcache_data_init(tsd);
-	} else if (was_enabled && !enabled) {
-		tcache_cleanup(tsd);
-	}
-	/* Commit the state last.  Above calls check current state. */
-	tsd_tcache_enabled_set(tsd, enabled);
-	tsd_slow_update(tsd);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tcache_event(tsd_t *tsd, tcache_t *tcache) {
-	if (TCACHE_GC_INCR == 0) {
-		return;
-	}
-
-	if (unlikely(ticker_tick(&tcache->gc_ticker))) {
-		tcache_event_hard(tsd, tcache);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-tcache_alloc_small(tsd_t *tsd, arena_t *arena, tcache_t *tcache,
-    UNUSED size_t size, szind_t binind, bool zero, bool slow_path) {
-	void *ret;
-	cache_bin_t *bin;
-	bool tcache_success;
-	size_t usize JEMALLOC_CC_SILENCE_INIT(0);
-
-	assert(binind < NBINS);
-	bin = tcache_small_bin_get(tcache, binind);
-	ret = cache_bin_alloc_easy(bin, &tcache_success);
-	assert(tcache_success == (ret != NULL));
-	if (unlikely(!tcache_success)) {
-		bool tcache_hard_success;
-		arena = arena_choose(tsd, arena);
-		if (unlikely(arena == NULL)) {
-			return NULL;
-		}
-
-		ret = tcache_alloc_small_hard(tsd_tsdn(tsd), arena, tcache,
-		    bin, binind, &tcache_hard_success);
-		if (tcache_hard_success == false) {
-			return NULL;
-		}
-	}
-
-	assert(ret);
-	/*
-	 * Only compute usize if required.  The checks in the following if
-	 * statement are all static.
-	 */
-	if (config_prof || (slow_path && config_fill) || unlikely(zero)) {
-		usize = sz_index2size(binind);
-		assert(tcache_salloc(tsd_tsdn(tsd), ret) == usize);
-	}
-
-	if (likely(!zero)) {
-		if (slow_path && config_fill) {
-			if (unlikely(opt_junk_alloc)) {
-				arena_alloc_junk_small(ret, &bin_infos[binind],
-				    false);
-			} else if (unlikely(opt_zero)) {
-				memset(ret, 0, usize);
-			}
-		}
-	} else {
-		if (slow_path && config_fill && unlikely(opt_junk_alloc)) {
-			arena_alloc_junk_small(ret, &bin_infos[binind], true);
-		}
-		memset(ret, 0, usize);
-	}
-
-	if (config_stats) {
-		bin->tstats.nrequests++;
-	}
-	if (config_prof) {
-		tcache->prof_accumbytes += usize;
-	}
-	tcache_event(tsd, tcache);
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-tcache_alloc_large(tsd_t *tsd, arena_t *arena, tcache_t *tcache, size_t size,
-    szind_t binind, bool zero, bool slow_path) {
-	void *ret;
-	cache_bin_t *bin;
-	bool tcache_success;
-
-	assert(binind >= NBINS &&binind < nhbins);
-	bin = tcache_large_bin_get(tcache, binind);
-	ret = cache_bin_alloc_easy(bin, &tcache_success);
-	assert(tcache_success == (ret != NULL));
-	if (unlikely(!tcache_success)) {
-		/*
-		 * Only allocate one large object at a time, because it's quite
-		 * expensive to create one and not use it.
-		 */
-		arena = arena_choose(tsd, arena);
-		if (unlikely(arena == NULL)) {
-			return NULL;
-		}
-
-		ret = large_malloc(tsd_tsdn(tsd), arena, sz_s2u(size), zero);
-		if (ret == NULL) {
-			return NULL;
-		}
-	} else {
-		size_t usize JEMALLOC_CC_SILENCE_INIT(0);
-
-		/* Only compute usize on demand */
-		if (config_prof || (slow_path && config_fill) ||
-		    unlikely(zero)) {
-			usize = sz_index2size(binind);
-			assert(usize <= tcache_maxclass);
-		}
-
-		if (likely(!zero)) {
-			if (slow_path && config_fill) {
-				if (unlikely(opt_junk_alloc)) {
-					memset(ret, JEMALLOC_ALLOC_JUNK,
-					    usize);
-				} else if (unlikely(opt_zero)) {
-					memset(ret, 0, usize);
-				}
-			}
-		} else {
-			memset(ret, 0, usize);
-		}
-
-		if (config_stats) {
-			bin->tstats.nrequests++;
-		}
-		if (config_prof) {
-			tcache->prof_accumbytes += usize;
-		}
-	}
-
-	tcache_event(tsd, tcache);
-	return ret;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tcache_dalloc_small(tsd_t *tsd, tcache_t *tcache, void *ptr, szind_t binind,
-    bool slow_path) {
-	cache_bin_t *bin;
-	cache_bin_info_t *bin_info;
-
-	assert(tcache_salloc(tsd_tsdn(tsd), ptr) <= SMALL_MAXCLASS);
-
-	if (slow_path && config_fill && unlikely(opt_junk_free)) {
-		arena_dalloc_junk_small(ptr, &bin_infos[binind]);
-	}
-
-	bin = tcache_small_bin_get(tcache, binind);
-	bin_info = &tcache_bin_info[binind];
-	if (unlikely(bin->ncached == bin_info->ncached_max)) {
-		tcache_bin_flush_small(tsd, tcache, bin, binind,
-		    (bin_info->ncached_max >> 1));
-	}
-	assert(bin->ncached < bin_info->ncached_max);
-	bin->ncached++;
-	*(bin->avail - bin->ncached) = ptr;
-
-	tcache_event(tsd, tcache);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tcache_dalloc_large(tsd_t *tsd, tcache_t *tcache, void *ptr, szind_t binind,
-    bool slow_path) {
-	cache_bin_t *bin;
-	cache_bin_info_t *bin_info;
-
-	assert(tcache_salloc(tsd_tsdn(tsd), ptr) > SMALL_MAXCLASS);
-	assert(tcache_salloc(tsd_tsdn(tsd), ptr) <= tcache_maxclass);
-
-	if (slow_path && config_fill && unlikely(opt_junk_free)) {
-		large_dalloc_junk(ptr, sz_index2size(binind));
-	}
-
-	bin = tcache_large_bin_get(tcache, binind);
-	bin_info = &tcache_bin_info[binind];
-	if (unlikely(bin->ncached == bin_info->ncached_max)) {
-		tcache_bin_flush_large(tsd, bin, binind,
-		    (bin_info->ncached_max >> 1), tcache);
-	}
-	assert(bin->ncached < bin_info->ncached_max);
-	bin->ncached++;
-	*(bin->avail - bin->ncached) = ptr;
-
-	tcache_event(tsd, tcache);
-}
-
-JEMALLOC_ALWAYS_INLINE tcache_t *
-tcaches_get(tsd_t *tsd, unsigned ind) {
-	tcaches_t *elm = &tcaches[ind];
-	if (unlikely(elm->tcache == NULL)) {
-		elm->tcache = tcache_create_explicit(tsd);
-	}
-	return elm->tcache;
-}
-
-#endif /* JEMALLOC_INTERNAL_TCACHE_INLINES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
deleted file mode 100644
index 07b73870..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_structs.h
+++ /dev/null
@@ -1,61 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TCACHE_STRUCTS_H
-#define JEMALLOC_INTERNAL_TCACHE_STRUCTS_H
-
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/cache_bin.h"
-#include "jemalloc/internal/ticker.h"
-
-struct tcache_s {
-	/*
-	 * To minimize our cache-footprint, we put the frequently accessed data
-	 * together at the start of this struct.
-	 */
-
-	/* Cleared after arena_prof_accum(). */
-	uint64_t	prof_accumbytes;
-	/* Drives incremental GC. */
-	ticker_t	gc_ticker;
-	/*
-	 * The pointer stacks associated with bins follow as a contiguous array.
-	 * During tcache initialization, the avail pointer in each element of
-	 * tbins is initialized to point to the proper offset within this array.
-	 */
-	cache_bin_t	bins_small[NBINS];
-
-	/*
-	 * This data is less hot; we can be a little less careful with our
-	 * footprint here.
-	 */
-	/* Lets us track all the tcaches in an arena. */
-	ql_elm(tcache_t) link;
-	/*
-	 * The descriptor lets the arena find our cache bins without seeing the
-	 * tcache definition.  This enables arenas to aggregate stats across
-	 * tcaches without having a tcache dependency.
-	 */
-	cache_bin_array_descriptor_t cache_bin_array_descriptor;
-
-	/* The arena this tcache is associated with. */
-	arena_t		*arena;
-	/* Next bin to GC. */
-	szind_t		next_gc_bin;
-	/* For small bins, fill (ncached_max >> lg_fill_div). */
-	uint8_t		lg_fill_div[NBINS];
-	/*
-	 * We put the cache bins for large size classes at the end of the
-	 * struct, since some of them might not get used.  This might end up
-	 * letting us avoid touching an extra page if we don't have to.
-	 */
-	cache_bin_t	bins_large[NSIZES-NBINS];
-};
-
-/* Linkage for list of available (previously used) explicit tcache IDs. */
-struct tcaches_s {
-	union {
-		tcache_t	*tcache;
-		tcaches_t	*next;
-	};
-};
-
-#endif /* JEMALLOC_INTERNAL_TCACHE_STRUCTS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
deleted file mode 100644
index e49bc9d7..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tcache_types.h
+++ /dev/null
@@ -1,56 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TCACHE_TYPES_H
-#define JEMALLOC_INTERNAL_TCACHE_TYPES_H
-
-#include "jemalloc/internal/size_classes.h"
-
-typedef struct tcache_s tcache_t;
-typedef struct tcaches_s tcaches_t;
-
-/*
- * tcache pointers close to NULL are used to encode state information that is
- * used for two purposes: preventing thread caching on a per thread basis and
- * cleaning up during thread shutdown.
- */
-#define TCACHE_STATE_DISABLED		((tcache_t *)(uintptr_t)1)
-#define TCACHE_STATE_REINCARNATED	((tcache_t *)(uintptr_t)2)
-#define TCACHE_STATE_PURGATORY		((tcache_t *)(uintptr_t)3)
-#define TCACHE_STATE_MAX		TCACHE_STATE_PURGATORY
-
-/*
- * Absolute minimum number of cache slots for each small bin.
- */
-#define TCACHE_NSLOTS_SMALL_MIN		20
-
-/*
- * Absolute maximum number of cache slots for each small bin in the thread
- * cache.  This is an additional constraint beyond that imposed as: twice the
- * number of regions per slab for this size class.
- *
- * This constant must be an even number.
- */
-#define TCACHE_NSLOTS_SMALL_MAX		200
-
-/* Number of cache slots for large size classes. */
-#define TCACHE_NSLOTS_LARGE		20
-
-/* (1U << opt_lg_tcache_max) is used to compute tcache_maxclass. */
-#define LG_TCACHE_MAXCLASS_DEFAULT	15
-
-/*
- * TCACHE_GC_SWEEP is the approximate number of allocation events between
- * full GC sweeps.  Integer rounding may cause the actual number to be
- * slightly higher, since GC is performed incrementally.
- */
-#define TCACHE_GC_SWEEP			8192
-
-/* Number of tcache allocation/deallocation events between incremental GCs. */
-#define TCACHE_GC_INCR							\
-    ((TCACHE_GC_SWEEP / NBINS) + ((TCACHE_GC_SWEEP / NBINS == 0) ? 0 : 1))
-
-/* Used in TSD static initializer only. Real init in tcache_data_init(). */
-#define TCACHE_ZERO_INITIALIZER {0}
-
-/* Used in TSD static initializer only. Will be initialized to opt_tcache. */
-#define TCACHE_ENABLED_ZERO_INITIALIZER false
-
-#endif /* JEMALLOC_INTERNAL_TCACHE_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
deleted file mode 100644
index 4b360470..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/ticker.h
+++ /dev/null
@@ -1,78 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TICKER_H
-#define JEMALLOC_INTERNAL_TICKER_H
-
-#include "jemalloc/internal/util.h"
-
-/**
- * A ticker makes it easy to count-down events until some limit.  You
- * ticker_init the ticker to trigger every nticks events.  You then notify it
- * that an event has occurred with calls to ticker_tick (or that nticks events
- * have occurred with a call to ticker_ticks), which will return true (and reset
- * the counter) if the countdown hit zero.
- */
-
-typedef struct {
-	int32_t tick;
-	int32_t nticks;
-} ticker_t;
-
-static inline void
-ticker_init(ticker_t *ticker, int32_t nticks) {
-	ticker->tick = nticks;
-	ticker->nticks = nticks;
-}
-
-static inline void
-ticker_copy(ticker_t *ticker, const ticker_t *other) {
-	*ticker = *other;
-}
-
-static inline int32_t
-ticker_read(const ticker_t *ticker) {
-	return ticker->tick;
-}
-
-/*
- * Not intended to be a public API.  Unfortunately, on x86, neither gcc nor
- * clang seems smart enough to turn
- *   ticker->tick -= nticks;
- *   if (unlikely(ticker->tick < 0)) {
- *     fixup ticker
- *     return true;
- *   }
- *   return false;
- * into
- *   subq %nticks_reg, (%ticker_reg)
- *   js fixup ticker
- *
- * unless we force "fixup ticker" out of line.  In that case, gcc gets it right,
- * but clang now does worse than before.  So, on x86 with gcc, we force it out
- * of line, but otherwise let the inlining occur.  Ordinarily this wouldn't be
- * worth the hassle, but this is on the fast path of both malloc and free (via
- * tcache_event).
- */
-#if defined(__GNUC__) && !defined(__clang__)				\
-    && (defined(__x86_64__) || defined(__i386__))
-JEMALLOC_NOINLINE
-#endif
-static bool
-ticker_fixup(ticker_t *ticker) {
-	ticker->tick = ticker->nticks;
-	return true;
-}
-
-static inline bool
-ticker_ticks(ticker_t *ticker, int32_t nticks) {
-	ticker->tick -= nticks;
-	if (unlikely(ticker->tick < 0)) {
-		return ticker_fixup(ticker);
-	}
-	return false;
-}
-
-static inline bool
-ticker_tick(ticker_t *ticker) {
-	return ticker_ticks(ticker, 1);
-}
-
-#endif /* JEMALLOC_INTERNAL_TICKER_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
deleted file mode 100644
index 0b9841aa..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd.h
+++ /dev/null
@@ -1,326 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TSD_H
-#define JEMALLOC_INTERNAL_TSD_H
-
-#include "jemalloc/internal/arena_types.h"
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/jemalloc_internal_externs.h"
-#include "jemalloc/internal/prof_types.h"
-#include "jemalloc/internal/ql.h"
-#include "jemalloc/internal/rtree_tsd.h"
-#include "jemalloc/internal/tcache_types.h"
-#include "jemalloc/internal/tcache_structs.h"
-#include "jemalloc/internal/util.h"
-#include "jemalloc/internal/witness.h"
-
-/*
- * Thread-Specific-Data layout
- * --- data accessed on tcache fast path: state, rtree_ctx, stats, prof ---
- * s: state
- * e: tcache_enabled
- * m: thread_allocated (config_stats)
- * f: thread_deallocated (config_stats)
- * p: prof_tdata (config_prof)
- * c: rtree_ctx (rtree cache accessed on deallocation)
- * t: tcache
- * --- data not accessed on tcache fast path: arena-related fields ---
- * d: arenas_tdata_bypass
- * r: reentrancy_level
- * x: narenas_tdata
- * i: iarena
- * a: arena
- * o: arenas_tdata
- * Loading TSD data is on the critical path of basically all malloc operations.
- * In particular, tcache and rtree_ctx rely on hot CPU cache to be effective.
- * Use a compact layout to reduce cache footprint.
- * +--- 64-bit and 64B cacheline; 1B each letter; First byte on the left. ---+
- * |----------------------------  1st cacheline  ----------------------------|
- * | sedrxxxx mmmmmmmm ffffffff pppppppp [c * 32  ........ ........ .......] |
- * |----------------------------  2nd cacheline  ----------------------------|
- * | [c * 64  ........ ........ ........ ........ ........ ........ .......] |
- * |----------------------------  3nd cacheline  ----------------------------|
- * | [c * 32  ........ ........ .......] iiiiiiii aaaaaaaa oooooooo [t...... |
- * +-------------------------------------------------------------------------+
- * Note: the entire tcache is embedded into TSD and spans multiple cachelines.
- *
- * The last 3 members (i, a and o) before tcache isn't really needed on tcache
- * fast path.  However we have a number of unused tcache bins and witnesses
- * (never touched unless config_debug) at the end of tcache, so we place them
- * there to avoid breaking the cachelines and possibly paging in an extra page.
- */
-#ifdef JEMALLOC_JET
-typedef void (*test_callback_t)(int *);
-#  define MALLOC_TSD_TEST_DATA_INIT 0x72b65c10
-#  define MALLOC_TEST_TSD \
-    O(test_data,		int,			int)		\
-    O(test_callback,		test_callback_t,	int)
-#  define MALLOC_TEST_TSD_INITIALIZER , MALLOC_TSD_TEST_DATA_INIT, NULL
-#else
-#  define MALLOC_TEST_TSD
-#  define MALLOC_TEST_TSD_INITIALIZER
-#endif
-
-/*  O(name,			type,			nullable type */
-#define MALLOC_TSD							\
-    O(tcache_enabled,		bool,			bool)		\
-    O(arenas_tdata_bypass,	bool,			bool)		\
-    O(reentrancy_level,		int8_t,			int8_t)		\
-    O(narenas_tdata,		uint32_t,		uint32_t)	\
-    O(offset_state,		uint64_t,		uint64_t)	\
-    O(thread_allocated,		uint64_t,		uint64_t)	\
-    O(thread_deallocated,	uint64_t,		uint64_t)	\
-    O(prof_tdata,		prof_tdata_t *,		prof_tdata_t *)	\
-    O(rtree_ctx,		rtree_ctx_t,		rtree_ctx_t)	\
-    O(iarena,			arena_t *,		arena_t *)	\
-    O(arena,			arena_t *,		arena_t *)	\
-    O(arenas_tdata,		arena_tdata_t *,	arena_tdata_t *)\
-    O(tcache,			tcache_t,		tcache_t)	\
-    O(witness_tsd,              witness_tsd_t,		witness_tsdn_t)	\
-    MALLOC_TEST_TSD
-
-#define TSD_INITIALIZER {						\
-    tsd_state_uninitialized,						\
-    TCACHE_ENABLED_ZERO_INITIALIZER,					\
-    false,								\
-    0,									\
-    0,									\
-    0,									\
-    0,									\
-    0,									\
-    NULL,								\
-    RTREE_CTX_ZERO_INITIALIZER,						\
-    NULL,								\
-    NULL,								\
-    NULL,								\
-    TCACHE_ZERO_INITIALIZER,						\
-    WITNESS_TSD_INITIALIZER						\
-    MALLOC_TEST_TSD_INITIALIZER						\
-}
-
-enum {
-	tsd_state_nominal = 0, /* Common case --> jnz. */
-	tsd_state_nominal_slow = 1, /* Initialized but on slow path. */
-	/* the above 2 nominal states should be lower values. */
-	tsd_state_nominal_max = 1, /* used for comparison only. */
-	tsd_state_minimal_initialized = 2,
-	tsd_state_purgatory = 3,
-	tsd_state_reincarnated = 4,
-	tsd_state_uninitialized = 5
-};
-
-/* Manually limit tsd_state_t to a single byte. */
-typedef uint8_t tsd_state_t;
-
-/* The actual tsd. */
-struct tsd_s {
-	/*
-	 * The contents should be treated as totally opaque outside the tsd
-	 * module.  Access any thread-local state through the getters and
-	 * setters below.
-	 */
-	tsd_state_t	state;
-#define O(n, t, nt)							\
-	t use_a_getter_or_setter_instead_##n;
-MALLOC_TSD
-#undef O
-};
-
-/*
- * Wrapper around tsd_t that makes it possible to avoid implicit conversion
- * between tsd_t and tsdn_t, where tsdn_t is "nullable" and has to be
- * explicitly converted to tsd_t, which is non-nullable.
- */
-struct tsdn_s {
-	tsd_t tsd;
-};
-#define TSDN_NULL ((tsdn_t *)0)
-JEMALLOC_ALWAYS_INLINE tsdn_t *
-tsd_tsdn(tsd_t *tsd) {
-	return (tsdn_t *)tsd;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsdn_null(const tsdn_t *tsdn) {
-	return tsdn == NULL;
-}
-
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsdn_tsd(tsdn_t *tsdn) {
-	assert(!tsdn_null(tsdn));
-
-	return &tsdn->tsd;
-}
-
-void *malloc_tsd_malloc(size_t size);
-void malloc_tsd_dalloc(void *wrapper);
-void malloc_tsd_cleanup_register(bool (*f)(void));
-tsd_t *malloc_tsd_boot0(void);
-void malloc_tsd_boot1(void);
-void tsd_cleanup(void *arg);
-tsd_t *tsd_fetch_slow(tsd_t *tsd, bool internal);
-void tsd_slow_update(tsd_t *tsd);
-
-/*
- * We put the platform-specific data declarations and inlines into their own
- * header files to avoid cluttering this file.  They define tsd_boot0,
- * tsd_boot1, tsd_boot, tsd_booted_get, tsd_get_allocates, tsd_get, and tsd_set.
- */
-#ifdef JEMALLOC_MALLOC_THREAD_CLEANUP
-#include "jemalloc/internal/tsd_malloc_thread_cleanup.h"
-#elif (defined(JEMALLOC_TLS))
-#include "jemalloc/internal/tsd_tls.h"
-#elif (defined(_WIN32))
-#include "jemalloc/internal/tsd_win.h"
-#else
-#include "jemalloc/internal/tsd_generic.h"
-#endif
-
-/*
- * tsd_foop_get_unsafe(tsd) returns a pointer to the thread-local instance of
- * foo.  This omits some safety checks, and so can be used during tsd
- * initialization and cleanup.
- */
-#define O(n, t, nt)							\
-JEMALLOC_ALWAYS_INLINE t *						\
-tsd_##n##p_get_unsafe(tsd_t *tsd) {					\
-	return &tsd->use_a_getter_or_setter_instead_##n;		\
-}
-MALLOC_TSD
-#undef O
-
-/* tsd_foop_get(tsd) returns a pointer to the thread-local instance of foo. */
-#define O(n, t, nt)							\
-JEMALLOC_ALWAYS_INLINE t *						\
-tsd_##n##p_get(tsd_t *tsd) {						\
-	assert(tsd->state == tsd_state_nominal ||			\
-	    tsd->state == tsd_state_nominal_slow ||			\
-	    tsd->state == tsd_state_reincarnated ||			\
-	    tsd->state == tsd_state_minimal_initialized);		\
-	return tsd_##n##p_get_unsafe(tsd);				\
-}
-MALLOC_TSD
-#undef O
-
-/*
- * tsdn_foop_get(tsdn) returns either the thread-local instance of foo (if tsdn
- * isn't NULL), or NULL (if tsdn is NULL), cast to the nullable pointer type.
- */
-#define O(n, t, nt)							\
-JEMALLOC_ALWAYS_INLINE nt *						\
-tsdn_##n##p_get(tsdn_t *tsdn) {						\
-	if (tsdn_null(tsdn)) {						\
-		return NULL;						\
-	}								\
-	tsd_t *tsd = tsdn_tsd(tsdn);					\
-	return (nt *)tsd_##n##p_get(tsd);				\
-}
-MALLOC_TSD
-#undef O
-
-/* tsd_foo_get(tsd) returns the value of the thread-local instance of foo. */
-#define O(n, t, nt)							\
-JEMALLOC_ALWAYS_INLINE t						\
-tsd_##n##_get(tsd_t *tsd) {						\
-	return *tsd_##n##p_get(tsd);					\
-}
-MALLOC_TSD
-#undef O
-
-/* tsd_foo_set(tsd, val) updates the thread-local instance of foo to be val. */
-#define O(n, t, nt)							\
-JEMALLOC_ALWAYS_INLINE void						\
-tsd_##n##_set(tsd_t *tsd, t val) {					\
-	assert(tsd->state != tsd_state_reincarnated &&			\
-	    tsd->state != tsd_state_minimal_initialized);		\
-	*tsd_##n##p_get(tsd) = val;					\
-}
-MALLOC_TSD
-#undef O
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_assert_fast(tsd_t *tsd) {
-	assert(!malloc_slow && tsd_tcache_enabled_get(tsd) &&
-	    tsd_reentrancy_level_get(tsd) == 0);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_fast(tsd_t *tsd) {
-	bool fast = (tsd->state == tsd_state_nominal);
-	if (fast) {
-		tsd_assert_fast(tsd);
-	}
-
-	return fast;
-}
-
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_fetch_impl(bool init, bool minimal) {
-	tsd_t *tsd = tsd_get(init);
-
-	if (!init && tsd_get_allocates() && tsd == NULL) {
-		return NULL;
-	}
-	assert(tsd != NULL);
-
-	if (unlikely(tsd->state != tsd_state_nominal)) {
-		return tsd_fetch_slow(tsd, minimal);
-	}
-	assert(tsd_fast(tsd));
-	tsd_assert_fast(tsd);
-
-	return tsd;
-}
-
-/* Get a minimal TSD that requires no cleanup.  See comments in free(). */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_fetch_min(void) {
-	return tsd_fetch_impl(true, true);
-}
-
-/* For internal background threads use only. */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_internal_fetch(void) {
-	tsd_t *tsd = tsd_fetch_min();
-	/* Use reincarnated state to prevent full initialization. */
-	tsd->state = tsd_state_reincarnated;
-
-	return tsd;
-}
-
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_fetch(void) {
-	return tsd_fetch_impl(true, false);
-}
-
-static inline bool
-tsd_nominal(tsd_t *tsd) {
-	return (tsd->state <= tsd_state_nominal_max);
-}
-
-JEMALLOC_ALWAYS_INLINE tsdn_t *
-tsdn_fetch(void) {
-	if (!tsd_booted_get()) {
-		return NULL;
-	}
-
-	return tsd_tsdn(tsd_fetch_impl(false, false));
-}
-
-JEMALLOC_ALWAYS_INLINE rtree_ctx_t *
-tsd_rtree_ctx(tsd_t *tsd) {
-	return tsd_rtree_ctxp_get(tsd);
-}
-
-JEMALLOC_ALWAYS_INLINE rtree_ctx_t *
-tsdn_rtree_ctx(tsdn_t *tsdn, rtree_ctx_t *fallback) {
-	/*
-	 * If tsd cannot be accessed, initialize the fallback rtree_ctx and
-	 * return a pointer to it.
-	 */
-	if (unlikely(tsdn_null(tsdn))) {
-		rtree_ctx_data_init(fallback);
-		return fallback;
-	}
-	return tsd_rtree_ctx(tsdn_tsd(tsdn));
-}
-
-#endif /* JEMALLOC_INTERNAL_TSD_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
deleted file mode 100644
index 1e52ef76..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_generic.h
+++ /dev/null
@@ -1,157 +0,0 @@
-#ifdef JEMALLOC_INTERNAL_TSD_GENERIC_H
-#error This file should be included only once, by tsd.h.
-#endif
-#define JEMALLOC_INTERNAL_TSD_GENERIC_H
-
-typedef struct tsd_init_block_s tsd_init_block_t;
-struct tsd_init_block_s {
-	ql_elm(tsd_init_block_t) link;
-	pthread_t thread;
-	void *data;
-};
-
-/* Defined in tsd.c, to allow the mutex headers to have tsd dependencies. */
-typedef struct tsd_init_head_s tsd_init_head_t;
-
-typedef struct {
-	bool initialized;
-	tsd_t val;
-} tsd_wrapper_t;
-
-void *tsd_init_check_recursion(tsd_init_head_t *head,
-    tsd_init_block_t *block);
-void tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block);
-
-extern pthread_key_t tsd_tsd;
-extern tsd_init_head_t tsd_init_head;
-extern tsd_wrapper_t tsd_boot_wrapper;
-extern bool tsd_booted;
-
-/* Initialization/cleanup. */
-JEMALLOC_ALWAYS_INLINE void
-tsd_cleanup_wrapper(void *arg) {
-	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)arg;
-
-	if (wrapper->initialized) {
-		wrapper->initialized = false;
-		tsd_cleanup(&wrapper->val);
-		if (wrapper->initialized) {
-			/* Trigger another cleanup round. */
-			if (pthread_setspecific(tsd_tsd, (void *)wrapper) != 0)
-			{
-				malloc_write("<jemalloc>: Error setting TSD\n");
-				if (opt_abort) {
-					abort();
-				}
-			}
-			return;
-		}
-	}
-	malloc_tsd_dalloc(wrapper);
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_wrapper_set(tsd_wrapper_t *wrapper) {
-	if (pthread_setspecific(tsd_tsd, (void *)wrapper) != 0) {
-		malloc_write("<jemalloc>: Error setting TSD\n");
-		abort();
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE tsd_wrapper_t *
-tsd_wrapper_get(bool init) {
-	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)pthread_getspecific(tsd_tsd);
-
-	if (init && unlikely(wrapper == NULL)) {
-		tsd_init_block_t block;
-		wrapper = (tsd_wrapper_t *)
-		    tsd_init_check_recursion(&tsd_init_head, &block);
-		if (wrapper) {
-			return wrapper;
-		}
-		wrapper = (tsd_wrapper_t *)
-		    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
-		block.data = (void *)wrapper;
-		if (wrapper == NULL) {
-			malloc_write("<jemalloc>: Error allocating TSD\n");
-			abort();
-		} else {
-			wrapper->initialized = false;
-			tsd_t initializer = TSD_INITIALIZER;
-			wrapper->val = initializer;
-		}
-		tsd_wrapper_set(wrapper);
-		tsd_init_finish(&tsd_init_head, &block);
-	}
-	return wrapper;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot0(void) {
-	if (pthread_key_create(&tsd_tsd, tsd_cleanup_wrapper) != 0) {
-		return true;
-	}
-	tsd_wrapper_set(&tsd_boot_wrapper);
-	tsd_booted = true;
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_boot1(void) {
-	tsd_wrapper_t *wrapper;
-	wrapper = (tsd_wrapper_t *)malloc_tsd_malloc(sizeof(tsd_wrapper_t));
-	if (wrapper == NULL) {
-		malloc_write("<jemalloc>: Error allocating TSD\n");
-		abort();
-	}
-	tsd_boot_wrapper.initialized = false;
-	tsd_cleanup(&tsd_boot_wrapper.val);
-	wrapper->initialized = false;
-	tsd_t initializer = TSD_INITIALIZER;
-	wrapper->val = initializer;
-	tsd_wrapper_set(wrapper);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot(void) {
-	if (tsd_boot0()) {
-		return true;
-	}
-	tsd_boot1();
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_booted_get(void) {
-	return tsd_booted;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_get_allocates(void) {
-	return true;
-}
-
-/* Get/set. */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_get(bool init) {
-	tsd_wrapper_t *wrapper;
-
-	assert(tsd_booted);
-	wrapper = tsd_wrapper_get(init);
-	if (tsd_get_allocates() && !init && wrapper == NULL) {
-		return NULL;
-	}
-	return &wrapper->val;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_set(tsd_t *val) {
-	tsd_wrapper_t *wrapper;
-
-	assert(tsd_booted);
-	wrapper = tsd_wrapper_get(true);
-	if (likely(&wrapper->val != val)) {
-		wrapper->val = *(val);
-	}
-	wrapper->initialized = true;
-}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
deleted file mode 100644
index beb467a6..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_malloc_thread_cleanup.h
+++ /dev/null
@@ -1,60 +0,0 @@
-#ifdef JEMALLOC_INTERNAL_TSD_MALLOC_THREAD_CLEANUP_H
-#error This file should be included only once, by tsd.h.
-#endif
-#define JEMALLOC_INTERNAL_TSD_MALLOC_THREAD_CLEANUP_H
-
-extern __thread tsd_t tsd_tls;
-extern __thread bool tsd_initialized;
-extern bool tsd_booted;
-
-/* Initialization/cleanup. */
-JEMALLOC_ALWAYS_INLINE bool
-tsd_cleanup_wrapper(void) {
-	if (tsd_initialized) {
-		tsd_initialized = false;
-		tsd_cleanup(&tsd_tls);
-	}
-	return tsd_initialized;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot0(void) {
-	malloc_tsd_cleanup_register(&tsd_cleanup_wrapper);
-	tsd_booted = true;
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_boot1(void) {
-	/* Do nothing. */
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot(void) {
-	return tsd_boot0();
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_booted_get(void) {
-	return tsd_booted;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_get_allocates(void) {
-	return false;
-}
-
-/* Get/set. */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_get(bool init) {
-	assert(tsd_booted);
-	return &tsd_tls;
-}
-JEMALLOC_ALWAYS_INLINE void
-tsd_set(tsd_t *val) {
-	assert(tsd_booted);
-	if (likely(&tsd_tls != val)) {
-		tsd_tls = (*val);
-	}
-	tsd_initialized = true;
-}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
deleted file mode 100644
index 0de64b7b..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_tls.h
+++ /dev/null
@@ -1,59 +0,0 @@
-#ifdef JEMALLOC_INTERNAL_TSD_TLS_H
-#error This file should be included only once, by tsd.h.
-#endif
-#define JEMALLOC_INTERNAL_TSD_TLS_H
-
-extern __thread tsd_t tsd_tls;
-extern pthread_key_t tsd_tsd;
-extern bool tsd_booted;
-
-/* Initialization/cleanup. */
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot0(void) {
-	if (pthread_key_create(&tsd_tsd, &tsd_cleanup) != 0) {
-		return true;
-	}
-	tsd_booted = true;
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_boot1(void) {
-	/* Do nothing. */
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot(void) {
-	return tsd_boot0();
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_booted_get(void) {
-	return tsd_booted;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_get_allocates(void) {
-	return false;
-}
-
-/* Get/set. */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_get(UNUSED bool init) {
-	assert(tsd_booted);
-	return &tsd_tls;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_set(tsd_t *val) {
-	assert(tsd_booted);
-	if (likely(&tsd_tls != val)) {
-		tsd_tls = (*val);
-	}
-	if (pthread_setspecific(tsd_tsd, (void *)(&tsd_tls)) != 0) {
-		malloc_write("<jemalloc>: Error setting tsd.\n");
-		if (opt_abort) {
-			abort();
-		}
-	}
-}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
deleted file mode 100644
index 6200af61..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_types.h
+++ /dev/null
@@ -1,10 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_TSD_TYPES_H
-#define JEMALLOC_INTERNAL_TSD_TYPES_H
-
-#define MALLOC_TSD_CLEANUPS_MAX	2
-
-typedef struct tsd_s tsd_t;
-typedef struct tsdn_s tsdn_t;
-typedef bool (*malloc_tsd_cleanup_t)(void);
-
-#endif /* JEMALLOC_INTERNAL_TSD_TYPES_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
deleted file mode 100644
index cf30d18e..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/tsd_win.h
+++ /dev/null
@@ -1,139 +0,0 @@
-#ifdef JEMALLOC_INTERNAL_TSD_WIN_H
-#error This file should be included only once, by tsd.h.
-#endif
-#define JEMALLOC_INTERNAL_TSD_WIN_H
-
-typedef struct {
-	bool initialized;
-	tsd_t val;
-} tsd_wrapper_t;
-
-extern DWORD tsd_tsd;
-extern tsd_wrapper_t tsd_boot_wrapper;
-extern bool tsd_booted;
-
-/* Initialization/cleanup. */
-JEMALLOC_ALWAYS_INLINE bool
-tsd_cleanup_wrapper(void) {
-	DWORD error = GetLastError();
-	tsd_wrapper_t *wrapper = (tsd_wrapper_t *)TlsGetValue(tsd_tsd);
-	SetLastError(error);
-
-	if (wrapper == NULL) {
-		return false;
-	}
-
-	if (wrapper->initialized) {
-		wrapper->initialized = false;
-		tsd_cleanup(&wrapper->val);
-		if (wrapper->initialized) {
-			/* Trigger another cleanup round. */
-			return true;
-		}
-	}
-	malloc_tsd_dalloc(wrapper);
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_wrapper_set(tsd_wrapper_t *wrapper) {
-	if (!TlsSetValue(tsd_tsd, (void *)wrapper)) {
-		malloc_write("<jemalloc>: Error setting TSD\n");
-		abort();
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE tsd_wrapper_t *
-tsd_wrapper_get(bool init) {
-	DWORD error = GetLastError();
-	tsd_wrapper_t *wrapper = (tsd_wrapper_t *) TlsGetValue(tsd_tsd);
-	SetLastError(error);
-
-	if (init && unlikely(wrapper == NULL)) {
-		wrapper = (tsd_wrapper_t *)
-		    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
-		if (wrapper == NULL) {
-			malloc_write("<jemalloc>: Error allocating TSD\n");
-			abort();
-		} else {
-			wrapper->initialized = false;
-			/* MSVC is finicky about aggregate initialization. */
-			tsd_t tsd_initializer = TSD_INITIALIZER;
-			wrapper->val = tsd_initializer;
-		}
-		tsd_wrapper_set(wrapper);
-	}
-	return wrapper;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot0(void) {
-	tsd_tsd = TlsAlloc();
-	if (tsd_tsd == TLS_OUT_OF_INDEXES) {
-		return true;
-	}
-	malloc_tsd_cleanup_register(&tsd_cleanup_wrapper);
-	tsd_wrapper_set(&tsd_boot_wrapper);
-	tsd_booted = true;
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_boot1(void) {
-	tsd_wrapper_t *wrapper;
-	wrapper = (tsd_wrapper_t *)
-	    malloc_tsd_malloc(sizeof(tsd_wrapper_t));
-	if (wrapper == NULL) {
-		malloc_write("<jemalloc>: Error allocating TSD\n");
-		abort();
-	}
-	tsd_boot_wrapper.initialized = false;
-	tsd_cleanup(&tsd_boot_wrapper.val);
-	wrapper->initialized = false;
-	tsd_t initializer = TSD_INITIALIZER;
-	wrapper->val = initializer;
-	tsd_wrapper_set(wrapper);
-}
-JEMALLOC_ALWAYS_INLINE bool
-tsd_boot(void) {
-	if (tsd_boot0()) {
-		return true;
-	}
-	tsd_boot1();
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_booted_get(void) {
-	return tsd_booted;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-tsd_get_allocates(void) {
-	return true;
-}
-
-/* Get/set. */
-JEMALLOC_ALWAYS_INLINE tsd_t *
-tsd_get(bool init) {
-	tsd_wrapper_t *wrapper;
-
-	assert(tsd_booted);
-	wrapper = tsd_wrapper_get(init);
-	if (tsd_get_allocates() && !init && wrapper == NULL) {
-		return NULL;
-	}
-	return &wrapper->val;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-tsd_set(tsd_t *val) {
-	tsd_wrapper_t *wrapper;
-
-	assert(tsd_booted);
-	wrapper = tsd_wrapper_get(true);
-	if (likely(&wrapper->val != val)) {
-		wrapper->val = *(val);
-	}
-	wrapper->initialized = true;
-}
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
deleted file mode 100644
index 304cb545..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/util.h
+++ /dev/null
@@ -1,67 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_UTIL_H
-#define JEMALLOC_INTERNAL_UTIL_H
-
-#define UTIL_INLINE static inline
-
-/* Junk fill patterns. */
-#ifndef JEMALLOC_ALLOC_JUNK
-#  define JEMALLOC_ALLOC_JUNK	((uint8_t)0xa5)
-#endif
-#ifndef JEMALLOC_FREE_JUNK
-#  define JEMALLOC_FREE_JUNK	((uint8_t)0x5a)
-#endif
-
-/*
- * Wrap a cpp argument that contains commas such that it isn't broken up into
- * multiple arguments.
- */
-#define JEMALLOC_ARG_CONCAT(...) __VA_ARGS__
-
-/* cpp macro definition stringification. */
-#define STRINGIFY_HELPER(x) #x
-#define STRINGIFY(x) STRINGIFY_HELPER(x)
-
-/*
- * Silence compiler warnings due to uninitialized values.  This is used
- * wherever the compiler fails to recognize that the variable is never used
- * uninitialized.
- */
-#define JEMALLOC_CC_SILENCE_INIT(v) = v
-
-#ifdef __GNUC__
-#  define likely(x)   __builtin_expect(!!(x), 1)
-#  define unlikely(x) __builtin_expect(!!(x), 0)
-#else
-#  define likely(x)   !!(x)
-#  define unlikely(x) !!(x)
-#endif
-
-#if !defined(JEMALLOC_INTERNAL_UNREACHABLE)
-#  error JEMALLOC_INTERNAL_UNREACHABLE should have been defined by configure
-#endif
-
-#define unreachable() JEMALLOC_INTERNAL_UNREACHABLE()
-
-/* Set error code. */
-UTIL_INLINE void
-set_errno(int errnum) {
-#ifdef _WIN32
-	SetLastError(errnum);
-#else
-	errno = errnum;
-#endif
-}
-
-/* Get last error code. */
-UTIL_INLINE int
-get_errno(void) {
-#ifdef _WIN32
-	return GetLastError();
-#else
-	return errno;
-#endif
-}
-
-#undef UTIL_INLINE
-
-#endif /* JEMALLOC_INTERNAL_UTIL_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h b/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
deleted file mode 100644
index 7ace8ae4..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/internal/witness.h
+++ /dev/null
@@ -1,346 +0,0 @@
-#ifndef JEMALLOC_INTERNAL_WITNESS_H
-#define JEMALLOC_INTERNAL_WITNESS_H
-
-#include "jemalloc/internal/ql.h"
-
-/******************************************************************************/
-/* LOCK RANKS */
-/******************************************************************************/
-
-/*
- * Witnesses with rank WITNESS_RANK_OMIT are completely ignored by the witness
- * machinery.
- */
-
-#define WITNESS_RANK_OMIT		0U
-
-#define WITNESS_RANK_MIN		1U
-
-#define WITNESS_RANK_INIT		1U
-#define WITNESS_RANK_CTL		1U
-#define WITNESS_RANK_TCACHES		2U
-#define WITNESS_RANK_ARENAS		3U
-
-#define WITNESS_RANK_BACKGROUND_THREAD_GLOBAL	4U
-
-#define WITNESS_RANK_PROF_DUMP		5U
-#define WITNESS_RANK_PROF_BT2GCTX	6U
-#define WITNESS_RANK_PROF_TDATAS	7U
-#define WITNESS_RANK_PROF_TDATA		8U
-#define WITNESS_RANK_PROF_GCTX		9U
-
-#define WITNESS_RANK_BACKGROUND_THREAD	10U
-
-/*
- * Used as an argument to witness_assert_depth_to_rank() in order to validate
- * depth excluding non-core locks with lower ranks.  Since the rank argument to
- * witness_assert_depth_to_rank() is inclusive rather than exclusive, this
- * definition can have the same value as the minimally ranked core lock.
- */
-#define WITNESS_RANK_CORE		11U
-
-#define WITNESS_RANK_DECAY		11U
-#define WITNESS_RANK_TCACHE_QL		12U
-#define WITNESS_RANK_EXTENT_GROW	13U
-#define WITNESS_RANK_EXTENTS		14U
-#define WITNESS_RANK_EXTENT_AVAIL	15U
-
-#define WITNESS_RANK_EXTENT_POOL	16U
-#define WITNESS_RANK_RTREE		17U
-#define WITNESS_RANK_BASE		18U
-#define WITNESS_RANK_ARENA_LARGE	19U
-
-#define WITNESS_RANK_LEAF		0xffffffffU
-#define WITNESS_RANK_BIN		WITNESS_RANK_LEAF
-#define WITNESS_RANK_ARENA_STATS	WITNESS_RANK_LEAF
-#define WITNESS_RANK_DSS		WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_ACTIVE	WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_ACCUM		WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_DUMP_SEQ	WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_GDUMP		WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_NEXT_THR_UID	WITNESS_RANK_LEAF
-#define WITNESS_RANK_PROF_THREAD_ACTIVE_INIT	WITNESS_RANK_LEAF
-
-/******************************************************************************/
-/* PER-WITNESS DATA */
-/******************************************************************************/
-#if defined(JEMALLOC_DEBUG)
-#  define WITNESS_INITIALIZER(name, rank) {name, rank, NULL, NULL, {NULL, NULL}}
-#else
-#  define WITNESS_INITIALIZER(name, rank)
-#endif
-
-typedef struct witness_s witness_t;
-typedef unsigned witness_rank_t;
-typedef ql_head(witness_t) witness_list_t;
-typedef int witness_comp_t (const witness_t *, void *, const witness_t *,
-    void *);
-
-struct witness_s {
-	/* Name, used for printing lock order reversal messages. */
-	const char		*name;
-
-	/*
-	 * Witness rank, where 0 is lowest and UINT_MAX is highest.  Witnesses
-	 * must be acquired in order of increasing rank.
-	 */
-	witness_rank_t		rank;
-
-	/*
-	 * If two witnesses are of equal rank and they have the samp comp
-	 * function pointer, it is called as a last attempt to differentiate
-	 * between witnesses of equal rank.
-	 */
-	witness_comp_t		*comp;
-
-	/* Opaque data, passed to comp(). */
-	void			*opaque;
-
-	/* Linkage for thread's currently owned locks. */
-	ql_elm(witness_t)	link;
-};
-
-/******************************************************************************/
-/* PER-THREAD DATA */
-/******************************************************************************/
-typedef struct witness_tsd_s witness_tsd_t;
-struct witness_tsd_s {
-	witness_list_t witnesses;
-	bool forking;
-};
-
-#define WITNESS_TSD_INITIALIZER { ql_head_initializer(witnesses), false }
-#define WITNESS_TSDN_NULL ((witness_tsdn_t *)0)
-
-/******************************************************************************/
-/* (PER-THREAD) NULLABILITY HELPERS */
-/******************************************************************************/
-typedef struct witness_tsdn_s witness_tsdn_t;
-struct witness_tsdn_s {
-	witness_tsd_t witness_tsd;
-};
-
-JEMALLOC_ALWAYS_INLINE witness_tsdn_t *
-witness_tsd_tsdn(witness_tsd_t *witness_tsd) {
-	return (witness_tsdn_t *)witness_tsd;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-witness_tsdn_null(witness_tsdn_t *witness_tsdn) {
-	return witness_tsdn == NULL;
-}
-
-JEMALLOC_ALWAYS_INLINE witness_tsd_t *
-witness_tsdn_tsd(witness_tsdn_t *witness_tsdn) {
-	assert(!witness_tsdn_null(witness_tsdn));
-	return &witness_tsdn->witness_tsd;
-}
-
-/******************************************************************************/
-/* API */
-/******************************************************************************/
-void witness_init(witness_t *witness, const char *name, witness_rank_t rank,
-    witness_comp_t *comp, void *opaque);
-
-typedef void (witness_lock_error_t)(const witness_list_t *, const witness_t *);
-extern witness_lock_error_t *JET_MUTABLE witness_lock_error;
-
-typedef void (witness_owner_error_t)(const witness_t *);
-extern witness_owner_error_t *JET_MUTABLE witness_owner_error;
-
-typedef void (witness_not_owner_error_t)(const witness_t *);
-extern witness_not_owner_error_t *JET_MUTABLE witness_not_owner_error;
-
-typedef void (witness_depth_error_t)(const witness_list_t *,
-    witness_rank_t rank_inclusive, unsigned depth);
-extern witness_depth_error_t *JET_MUTABLE witness_depth_error;
-
-void witnesses_cleanup(witness_tsd_t *witness_tsd);
-void witness_prefork(witness_tsd_t *witness_tsd);
-void witness_postfork_parent(witness_tsd_t *witness_tsd);
-void witness_postfork_child(witness_tsd_t *witness_tsd);
-
-/* Helper, not intended for direct use. */
-static inline bool
-witness_owner(witness_tsd_t *witness_tsd, const witness_t *witness) {
-	witness_list_t *witnesses;
-	witness_t *w;
-
-	cassert(config_debug);
-
-	witnesses = &witness_tsd->witnesses;
-	ql_foreach(w, witnesses, link) {
-		if (w == witness) {
-			return true;
-		}
-	}
-
-	return false;
-}
-
-static inline void
-witness_assert_owner(witness_tsdn_t *witness_tsdn, const witness_t *witness) {
-	witness_tsd_t *witness_tsd;
-
-	if (!config_debug) {
-		return;
-	}
-
-	if (witness_tsdn_null(witness_tsdn)) {
-		return;
-	}
-	witness_tsd = witness_tsdn_tsd(witness_tsdn);
-	if (witness->rank == WITNESS_RANK_OMIT) {
-		return;
-	}
-
-	if (witness_owner(witness_tsd, witness)) {
-		return;
-	}
-	witness_owner_error(witness);
-}
-
-static inline void
-witness_assert_not_owner(witness_tsdn_t *witness_tsdn,
-    const witness_t *witness) {
-	witness_tsd_t *witness_tsd;
-	witness_list_t *witnesses;
-	witness_t *w;
-
-	if (!config_debug) {
-		return;
-	}
-
-	if (witness_tsdn_null(witness_tsdn)) {
-		return;
-	}
-	witness_tsd = witness_tsdn_tsd(witness_tsdn);
-	if (witness->rank == WITNESS_RANK_OMIT) {
-		return;
-	}
-
-	witnesses = &witness_tsd->witnesses;
-	ql_foreach(w, witnesses, link) {
-		if (w == witness) {
-			witness_not_owner_error(witness);
-		}
-	}
-}
-
-static inline void
-witness_assert_depth_to_rank(witness_tsdn_t *witness_tsdn,
-    witness_rank_t rank_inclusive, unsigned depth) {
-	witness_tsd_t *witness_tsd;
-	unsigned d;
-	witness_list_t *witnesses;
-	witness_t *w;
-
-	if (!config_debug) {
-		return;
-	}
-
-	if (witness_tsdn_null(witness_tsdn)) {
-		return;
-	}
-	witness_tsd = witness_tsdn_tsd(witness_tsdn);
-
-	d = 0;
-	witnesses = &witness_tsd->witnesses;
-	w = ql_last(witnesses, link);
-	if (w != NULL) {
-		ql_reverse_foreach(w, witnesses, link) {
-			if (w->rank < rank_inclusive) {
-				break;
-			}
-			d++;
-		}
-	}
-	if (d != depth) {
-		witness_depth_error(witnesses, rank_inclusive, depth);
-	}
-}
-
-static inline void
-witness_assert_depth(witness_tsdn_t *witness_tsdn, unsigned depth) {
-	witness_assert_depth_to_rank(witness_tsdn, WITNESS_RANK_MIN, depth);
-}
-
-static inline void
-witness_assert_lockless(witness_tsdn_t *witness_tsdn) {
-	witness_assert_depth(witness_tsdn, 0);
-}
-
-static inline void
-witness_lock(witness_tsdn_t *witness_tsdn, witness_t *witness) {
-	witness_tsd_t *witness_tsd;
-	witness_list_t *witnesses;
-	witness_t *w;
-
-	if (!config_debug) {
-		return;
-	}
-
-	if (witness_tsdn_null(witness_tsdn)) {
-		return;
-	}
-	witness_tsd = witness_tsdn_tsd(witness_tsdn);
-	if (witness->rank == WITNESS_RANK_OMIT) {
-		return;
-	}
-
-	witness_assert_not_owner(witness_tsdn, witness);
-
-	witnesses = &witness_tsd->witnesses;
-	w = ql_last(witnesses, link);
-	if (w == NULL) {
-		/* No other locks; do nothing. */
-	} else if (witness_tsd->forking && w->rank <= witness->rank) {
-		/* Forking, and relaxed ranking satisfied. */
-	} else if (w->rank > witness->rank) {
-		/* Not forking, rank order reversal. */
-		witness_lock_error(witnesses, witness);
-	} else if (w->rank == witness->rank && (w->comp == NULL || w->comp !=
-	    witness->comp || w->comp(w, w->opaque, witness, witness->opaque) >
-	    0)) {
-		/*
-		 * Missing/incompatible comparison function, or comparison
-		 * function indicates rank order reversal.
-		 */
-		witness_lock_error(witnesses, witness);
-	}
-
-	ql_elm_new(witness, link);
-	ql_tail_insert(witnesses, witness, link);
-}
-
-static inline void
-witness_unlock(witness_tsdn_t *witness_tsdn, witness_t *witness) {
-	witness_tsd_t *witness_tsd;
-	witness_list_t *witnesses;
-
-	if (!config_debug) {
-		return;
-	}
-
-	if (witness_tsdn_null(witness_tsdn)) {
-		return;
-	}
-	witness_tsd = witness_tsdn_tsd(witness_tsdn);
-	if (witness->rank == WITNESS_RANK_OMIT) {
-		return;
-	}
-
-	/*
-	 * Check whether owner before removal, rather than relying on
-	 * witness_assert_owner() to abort, so that unit tests can test this
-	 * function's failure mode without causing undefined behavior.
-	 */
-	if (witness_owner(witness_tsd, witness)) {
-		witnesses = &witness_tsd->witnesses;
-		ql_remove(witnesses, witness, link);
-	} else {
-		witness_assert_owner(witness_tsdn, witness);
-	}
-}
-
-#endif /* JEMALLOC_INTERNAL_WITNESS_H */
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
deleted file mode 100755
index b19b1548..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc.sh
+++ /dev/null
@@ -1,27 +0,0 @@
-#!/bin/sh
-
-objroot=$1
-
-cat <<EOF
-#ifndef JEMALLOC_H_
-#define JEMALLOC_H_
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-EOF
-
-for hdr in jemalloc_defs.h jemalloc_rename.h jemalloc_macros.h \
-           jemalloc_protos.h jemalloc_typedefs.h jemalloc_mangle.h ; do
-  cat "${objroot}include/jemalloc/${hdr}" \
-      | grep -v 'Generated from .* by configure\.' \
-      | sed -e 's/ $//g'
-  echo
-done
-
-cat <<EOF
-#ifdef __cplusplus
-}
-#endif
-#endif /* JEMALLOC_H_ */
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
deleted file mode 100644
index 6d89435c..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_defs.h.in
+++ /dev/null
@@ -1,45 +0,0 @@
-/* Defined if __attribute__((...)) syntax is supported. */
-#undef JEMALLOC_HAVE_ATTR
-
-/* Defined if alloc_size attribute is supported. */
-#undef JEMALLOC_HAVE_ATTR_ALLOC_SIZE
-
-/* Defined if format(gnu_printf, ...) attribute is supported. */
-#undef JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF
-
-/* Defined if format(printf, ...) attribute is supported. */
-#undef JEMALLOC_HAVE_ATTR_FORMAT_PRINTF
-
-/*
- * Define overrides for non-standard allocator-related functions if they are
- * present on the system.
- */
-#undef JEMALLOC_OVERRIDE_MEMALIGN
-#undef JEMALLOC_OVERRIDE_VALLOC
-
-/*
- * At least Linux omits the "const" in:
- *
- *   size_t malloc_usable_size(const void *ptr);
- *
- * Match the operating system's prototype.
- */
-#undef JEMALLOC_USABLE_SIZE_CONST
-
-/*
- * If defined, specify throw() for the public function prototypes when compiling
- * with C++.  The only justification for this is to match the prototypes that
- * glibc defines.
- */
-#undef JEMALLOC_USE_CXX_THROW
-
-#ifdef _MSC_VER
-#  ifdef _WIN64
-#    define LG_SIZEOF_PTR_WIN 3
-#  else
-#    define LG_SIZEOF_PTR_WIN 2
-#  endif
-#endif
-
-/* sizeof(void *) == 2^LG_SIZEOF_PTR. */
-#undef LG_SIZEOF_PTR
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
deleted file mode 100644
index daf9e571..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_macros.h.in
+++ /dev/null
@@ -1,126 +0,0 @@
-#include <stdlib.h>
-#include <stdbool.h>
-#include <stdint.h>
-#include <limits.h>
-#include <strings.h>
-
-#define JEMALLOC_VERSION "@jemalloc_version@"
-#define JEMALLOC_VERSION_MAJOR @jemalloc_version_major@
-#define JEMALLOC_VERSION_MINOR @jemalloc_version_minor@
-#define JEMALLOC_VERSION_BUGFIX @jemalloc_version_bugfix@
-#define JEMALLOC_VERSION_NREV @jemalloc_version_nrev@
-#define JEMALLOC_VERSION_GID "@jemalloc_version_gid@"
-
-#define MALLOCX_LG_ALIGN(la)	((int)(la))
-#if LG_SIZEOF_PTR == 2
-#  define MALLOCX_ALIGN(a)	((int)(ffs((int)(a))-1))
-#else
-#  define MALLOCX_ALIGN(a)						\
-     ((int)(((size_t)(a) < (size_t)INT_MAX) ? ffs((int)(a))-1 :	\
-     ffs((int)(((size_t)(a))>>32))+31))
-#endif
-#define MALLOCX_ZERO	((int)0x40)
-/*
- * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
- * encodes MALLOCX_TCACHE_NONE.
- */
-#define MALLOCX_TCACHE(tc)	((int)(((tc)+2) << 8))
-#define MALLOCX_TCACHE_NONE	MALLOCX_TCACHE(-1)
-/*
- * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
- */
-#define MALLOCX_ARENA(a)	((((int)(a))+1) << 20)
-
-/*
- * Use as arena index in "arena.<i>.{purge,decay,dss}" and
- * "stats.arenas.<i>.*" mallctl interfaces to select all arenas.  This
- * definition is intentionally specified in raw decimal format to support
- * cpp-based string concatenation, e.g.
- *
- *   #define STRINGIFY_HELPER(x) #x
- *   #define STRINGIFY(x) STRINGIFY_HELPER(x)
- *
- *   mallctl("arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".purge", NULL, NULL, NULL,
- *       0);
- */
-#define MALLCTL_ARENAS_ALL	4096
-/*
- * Use as arena index in "stats.arenas.<i>.*" mallctl interfaces to select
- * destroyed arenas.
- */
-#define MALLCTL_ARENAS_DESTROYED	4097
-
-#if defined(__cplusplus) && defined(JEMALLOC_USE_CXX_THROW)
-#  define JEMALLOC_CXX_THROW throw()
-#else
-#  define JEMALLOC_CXX_THROW
-#endif
-
-#if defined(_MSC_VER)
-#  define JEMALLOC_ATTR(s)
-#  define JEMALLOC_ALIGNED(s) __declspec(align(s))
-#  define JEMALLOC_ALLOC_SIZE(s)
-#  define JEMALLOC_ALLOC_SIZE2(s1, s2)
-#  ifndef JEMALLOC_EXPORT
-#    ifdef DLLEXPORT
-#      define JEMALLOC_EXPORT __declspec(dllexport)
-#    else
-#      define JEMALLOC_EXPORT __declspec(dllimport)
-#    endif
-#  endif
-#  define JEMALLOC_FORMAT_PRINTF(s, i)
-#  define JEMALLOC_NOINLINE __declspec(noinline)
-#  ifdef __cplusplus
-#    define JEMALLOC_NOTHROW __declspec(nothrow)
-#  else
-#    define JEMALLOC_NOTHROW
-#  endif
-#  define JEMALLOC_SECTION(s) __declspec(allocate(s))
-#  define JEMALLOC_RESTRICT_RETURN __declspec(restrict)
-#  if _MSC_VER >= 1900 && !defined(__EDG__)
-#    define JEMALLOC_ALLOCATOR __declspec(allocator)
-#  else
-#    define JEMALLOC_ALLOCATOR
-#  endif
-#elif defined(JEMALLOC_HAVE_ATTR)
-#  define JEMALLOC_ATTR(s) __attribute__((s))
-#  define JEMALLOC_ALIGNED(s) JEMALLOC_ATTR(aligned(s))
-#  ifdef JEMALLOC_HAVE_ATTR_ALLOC_SIZE
-#    define JEMALLOC_ALLOC_SIZE(s) JEMALLOC_ATTR(alloc_size(s))
-#    define JEMALLOC_ALLOC_SIZE2(s1, s2) JEMALLOC_ATTR(alloc_size(s1, s2))
-#  else
-#    define JEMALLOC_ALLOC_SIZE(s)
-#    define JEMALLOC_ALLOC_SIZE2(s1, s2)
-#  endif
-#  ifndef JEMALLOC_EXPORT
-#    define JEMALLOC_EXPORT JEMALLOC_ATTR(visibility("default"))
-#  endif
-#  ifdef JEMALLOC_HAVE_ATTR_FORMAT_GNU_PRINTF
-#    define JEMALLOC_FORMAT_PRINTF(s, i) JEMALLOC_ATTR(format(gnu_printf, s, i))
-#  elif defined(JEMALLOC_HAVE_ATTR_FORMAT_PRINTF)
-#    define JEMALLOC_FORMAT_PRINTF(s, i) JEMALLOC_ATTR(format(printf, s, i))
-#  else
-#    define JEMALLOC_FORMAT_PRINTF(s, i)
-#  endif
-#  define JEMALLOC_NOINLINE JEMALLOC_ATTR(noinline)
-#  define JEMALLOC_NOTHROW JEMALLOC_ATTR(nothrow)
-#  define JEMALLOC_SECTION(s) JEMALLOC_ATTR(section(s))
-#  define JEMALLOC_RESTRICT_RETURN
-#  define JEMALLOC_ALLOCATOR
-#else
-#  define JEMALLOC_ATTR(s)
-#  define JEMALLOC_ALIGNED(s)
-#  define JEMALLOC_ALLOC_SIZE(s)
-#  define JEMALLOC_ALLOC_SIZE2(s1, s2)
-#  define JEMALLOC_EXPORT
-#  define JEMALLOC_FORMAT_PRINTF(s, i)
-#  define JEMALLOC_NOINLINE
-#  define JEMALLOC_NOTHROW
-#  define JEMALLOC_SECTION(s)
-#  define JEMALLOC_RESTRICT_RETURN
-#  define JEMALLOC_ALLOCATOR
-#endif
-
-/* This version of Jemalloc, modified for Redis, has the je_get_defrag_hint()
- * function. */
-#define JEMALLOC_FRAG_HINT
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
deleted file mode 100755
index c675bb46..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_mangle.sh
+++ /dev/null
@@ -1,45 +0,0 @@
-#!/bin/sh -eu
-
-public_symbols_txt=$1
-symbol_prefix=$2
-
-cat <<EOF
-/*
- * By default application code must explicitly refer to mangled symbol names,
- * so that it is possible to use jemalloc in conjunction with another allocator
- * in the same application.  Define JEMALLOC_MANGLE in order to cause automatic
- * name mangling that matches the API prefixing that happened as a result of
- * --with-mangling and/or --with-jemalloc-prefix configuration settings.
- */
-#ifdef JEMALLOC_MANGLE
-#  ifndef JEMALLOC_NO_DEMANGLE
-#    define JEMALLOC_NO_DEMANGLE
-#  endif
-EOF
-
-for nm in `cat ${public_symbols_txt}` ; do
-  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
-  echo "#  define ${n} ${symbol_prefix}${n}"
-done
-
-cat <<EOF
-#endif
-
-/*
- * The ${symbol_prefix}* macros can be used as stable alternative names for the
- * public jemalloc API if JEMALLOC_NO_DEMANGLE is defined.  This is primarily
- * meant for use in jemalloc itself, but it can be used by application code to
- * provide isolation from the name mangling specified via --with-mangling
- * and/or --with-jemalloc-prefix.
- */
-#ifndef JEMALLOC_NO_DEMANGLE
-EOF
-
-for nm in `cat ${public_symbols_txt}` ; do
-  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
-  echo "#  undef ${symbol_prefix}${n}"
-done
-
-cat <<EOF
-#endif
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
deleted file mode 100644
index a78414b1..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_protos.h.in
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
- * The @je_@ prefix on the following public symbol declarations is an artifact
- * of namespace management, and should be omitted in application code unless
- * JEMALLOC_NO_DEMANGLE is defined (see jemalloc_mangle@install_suffix@.h).
- */
-extern JEMALLOC_EXPORT const char	*@je_@malloc_conf;
-extern JEMALLOC_EXPORT void		(*@je_@malloc_message)(void *cbopaque,
-    const char *s);
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@malloc(size_t size)
-    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1);
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@calloc(size_t num, size_t size)
-    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE2(1, 2);
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@posix_memalign(void **memptr,
-    size_t alignment, size_t size) JEMALLOC_CXX_THROW JEMALLOC_ATTR(nonnull(1));
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@aligned_alloc(size_t alignment,
-    size_t size) JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc)
-    JEMALLOC_ALLOC_SIZE(2);
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@realloc(void *ptr, size_t size)
-    JEMALLOC_CXX_THROW JEMALLOC_ALLOC_SIZE(2);
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@free(void *ptr)
-    JEMALLOC_CXX_THROW;
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@mallocx(size_t size, int flags)
-    JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1);
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@rallocx(void *ptr, size_t size,
-    int flags) JEMALLOC_ALLOC_SIZE(2);
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@xallocx(void *ptr, size_t size,
-    size_t extra, int flags);
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@sallocx(const void *ptr,
-    int flags) JEMALLOC_ATTR(pure);
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@dallocx(void *ptr, int flags);
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@sdallocx(void *ptr, size_t size,
-    int flags);
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@nallocx(size_t size, int flags)
-    JEMALLOC_ATTR(pure);
-
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctl(const char *name,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen);
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctlnametomib(const char *name,
-    size_t *mibp, size_t *miblenp);
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW	@je_@mallctlbymib(const size_t *mib,
-    size_t miblen, void *oldp, size_t *oldlenp, void *newp, size_t newlen);
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW	@je_@malloc_stats_print(
-    void (*write_cb)(void *, const char *), void *@je_@cbopaque,
-    const char *opts);
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW	@je_@malloc_usable_size(
-    JEMALLOC_USABLE_SIZE_CONST void *ptr) JEMALLOC_CXX_THROW;
-
-#ifdef JEMALLOC_OVERRIDE_MEMALIGN
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@memalign(size_t alignment, size_t size)
-    JEMALLOC_CXX_THROW JEMALLOC_ATTR(malloc);
-#endif
-
-#ifdef JEMALLOC_OVERRIDE_VALLOC
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-    void JEMALLOC_NOTHROW	*@je_@valloc(size_t size) JEMALLOC_CXX_THROW
-    JEMALLOC_ATTR(malloc);
-#endif
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
deleted file mode 100755
index f9438912..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_rename.sh
+++ /dev/null
@@ -1,22 +0,0 @@
-#!/bin/sh
-
-public_symbols_txt=$1
-
-cat <<EOF
-/*
- * Name mangling for public symbols is controlled by --with-mangling and
- * --with-jemalloc-prefix.  With default settings the je_ prefix is stripped by
- * these macro definitions.
- */
-#ifndef JEMALLOC_NO_RENAME
-EOF
-
-for nm in `cat ${public_symbols_txt}` ; do
-  n=`echo ${nm} |tr ':' ' ' |awk '{print $1}'`
-  m=`echo ${nm} |tr ':' ' ' |awk '{print $2}'`
-  echo "#  define je_${n} ${m}"
-done
-
-cat <<EOF
-#endif
-EOF
diff --git a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in b/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
deleted file mode 100644
index 1a588743..00000000
--- a/redis-stable/deps/jemalloc/include/jemalloc/jemalloc_typedefs.h.in
+++ /dev/null
@@ -1,77 +0,0 @@
-typedef struct extent_hooks_s extent_hooks_t;
-
-/*
- * void *
- * extent_alloc(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
- *     size_t alignment, bool *zero, bool *commit, unsigned arena_ind);
- */
-typedef void *(extent_alloc_t)(extent_hooks_t *, void *, size_t, size_t, bool *,
-    bool *, unsigned);
-
-/*
- * bool
- * extent_dalloc(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     bool committed, unsigned arena_ind);
- */
-typedef bool (extent_dalloc_t)(extent_hooks_t *, void *, size_t, bool,
-    unsigned);
-
-/*
- * void
- * extent_destroy(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     bool committed, unsigned arena_ind);
- */
-typedef void (extent_destroy_t)(extent_hooks_t *, void *, size_t, bool,
-    unsigned);
-
-/*
- * bool
- * extent_commit(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     size_t offset, size_t length, unsigned arena_ind);
- */
-typedef bool (extent_commit_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
-    unsigned);
-
-/*
- * bool
- * extent_decommit(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     size_t offset, size_t length, unsigned arena_ind);
- */
-typedef bool (extent_decommit_t)(extent_hooks_t *, void *, size_t, size_t,
-    size_t, unsigned);
-
-/*
- * bool
- * extent_purge(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     size_t offset, size_t length, unsigned arena_ind);
- */
-typedef bool (extent_purge_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
-    unsigned);
-
-/*
- * bool
- * extent_split(extent_hooks_t *extent_hooks, void *addr, size_t size,
- *     size_t size_a, size_t size_b, bool committed, unsigned arena_ind);
- */
-typedef bool (extent_split_t)(extent_hooks_t *, void *, size_t, size_t, size_t,
-    bool, unsigned);
-
-/*
- * bool
- * extent_merge(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
- *     void *addr_b, size_t size_b, bool committed, unsigned arena_ind);
- */
-typedef bool (extent_merge_t)(extent_hooks_t *, void *, size_t, void *, size_t,
-    bool, unsigned);
-
-struct extent_hooks_s {
-	extent_alloc_t		*alloc;
-	extent_dalloc_t		*dalloc;
-	extent_destroy_t	*destroy;
-	extent_commit_t		*commit;
-	extent_decommit_t	*decommit;
-	extent_purge_t		*purge_lazy;
-	extent_purge_t		*purge_forced;
-	extent_split_t		*split;
-	extent_merge_t		*merge;
-};
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
deleted file mode 100644
index d92160eb..00000000
--- a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdbool.h
+++ /dev/null
@@ -1,20 +0,0 @@
-#ifndef stdbool_h
-#define stdbool_h
-
-#include <wtypes.h>
-
-/* MSVC doesn't define _Bool or bool in C, but does have BOOL */
-/* Note this doesn't pass autoconf's test because (bool) 0.5 != true */
-/* Clang-cl uses MSVC headers, so needs msvc_compat, but has _Bool as
- * a built-in type. */
-#ifndef __clang__
-typedef BOOL _Bool;
-#endif
-
-#define bool _Bool
-#define true 1
-#define false 0
-
-#define __bool_true_false_are_defined 1
-
-#endif /* stdbool_h */
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h b/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
deleted file mode 100644
index d02608a5..00000000
--- a/redis-stable/deps/jemalloc/include/msvc_compat/C99/stdint.h
+++ /dev/null
@@ -1,247 +0,0 @@
-// ISO C9x  compliant stdint.h for Microsoft Visual Studio
-// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124 
-// 
-//  Copyright (c) 2006-2008 Alexander Chemeris
-// 
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are met:
-// 
-//   1. Redistributions of source code must retain the above copyright notice,
-//      this list of conditions and the following disclaimer.
-// 
-//   2. Redistributions in binary form must reproduce the above copyright
-//      notice, this list of conditions and the following disclaimer in the
-//      documentation and/or other materials provided with the distribution.
-// 
-//   3. The name of the author may be used to endorse or promote products
-//      derived from this software without specific prior written permission.
-// 
-// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
-// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
-// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
-// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 
-// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
-// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef _MSC_VER // [
-#error "Use this header only with Microsoft Visual C++ compilers!"
-#endif // _MSC_VER ]
-
-#ifndef _MSC_STDINT_H_ // [
-#define _MSC_STDINT_H_
-
-#if _MSC_VER > 1000
-#pragma once
-#endif
-
-#include <limits.h>
-
-// For Visual Studio 6 in C++ mode and for many Visual Studio versions when
-// compiling for ARM we should wrap <wchar.h> include with 'extern "C++" {}'
-// or compiler give many errors like this:
-//   error C2733: second C linkage of overloaded function 'wmemchr' not allowed
-#ifdef __cplusplus
-extern "C" {
-#endif
-#  include <wchar.h>
-#ifdef __cplusplus
-}
-#endif
-
-// Define _W64 macros to mark types changing their size, like intptr_t.
-#ifndef _W64
-#  if !defined(__midl) && (defined(_X86_) || defined(_M_IX86)) && _MSC_VER >= 1300
-#     define _W64 __w64
-#  else
-#     define _W64
-#  endif
-#endif
-
-
-// 7.18.1 Integer types
-
-// 7.18.1.1 Exact-width integer types
-
-// Visual Studio 6 and Embedded Visual C++ 4 doesn't
-// realize that, e.g. char has the same size as __int8
-// so we give up on __intX for them.
-#if (_MSC_VER < 1300)
-   typedef signed char       int8_t;
-   typedef signed short      int16_t;
-   typedef signed int        int32_t;
-   typedef unsigned char     uint8_t;
-   typedef unsigned short    uint16_t;
-   typedef unsigned int      uint32_t;
-#else
-   typedef signed __int8     int8_t;
-   typedef signed __int16    int16_t;
-   typedef signed __int32    int32_t;
-   typedef unsigned __int8   uint8_t;
-   typedef unsigned __int16  uint16_t;
-   typedef unsigned __int32  uint32_t;
-#endif
-typedef signed __int64       int64_t;
-typedef unsigned __int64     uint64_t;
-
-
-// 7.18.1.2 Minimum-width integer types
-typedef int8_t    int_least8_t;
-typedef int16_t   int_least16_t;
-typedef int32_t   int_least32_t;
-typedef int64_t   int_least64_t;
-typedef uint8_t   uint_least8_t;
-typedef uint16_t  uint_least16_t;
-typedef uint32_t  uint_least32_t;
-typedef uint64_t  uint_least64_t;
-
-// 7.18.1.3 Fastest minimum-width integer types
-typedef int8_t    int_fast8_t;
-typedef int16_t   int_fast16_t;
-typedef int32_t   int_fast32_t;
-typedef int64_t   int_fast64_t;
-typedef uint8_t   uint_fast8_t;
-typedef uint16_t  uint_fast16_t;
-typedef uint32_t  uint_fast32_t;
-typedef uint64_t  uint_fast64_t;
-
-// 7.18.1.4 Integer types capable of holding object pointers
-#ifdef _WIN64 // [
-   typedef signed __int64    intptr_t;
-   typedef unsigned __int64  uintptr_t;
-#else // _WIN64 ][
-   typedef _W64 signed int   intptr_t;
-   typedef _W64 unsigned int uintptr_t;
-#endif // _WIN64 ]
-
-// 7.18.1.5 Greatest-width integer types
-typedef int64_t   intmax_t;
-typedef uint64_t  uintmax_t;
-
-
-// 7.18.2 Limits of specified-width integer types
-
-#if !defined(__cplusplus) || defined(__STDC_LIMIT_MACROS) // [   See footnote 220 at page 257 and footnote 221 at page 259
-
-// 7.18.2.1 Limits of exact-width integer types
-#define INT8_MIN     ((int8_t)_I8_MIN)
-#define INT8_MAX     _I8_MAX
-#define INT16_MIN    ((int16_t)_I16_MIN)
-#define INT16_MAX    _I16_MAX
-#define INT32_MIN    ((int32_t)_I32_MIN)
-#define INT32_MAX    _I32_MAX
-#define INT64_MIN    ((int64_t)_I64_MIN)
-#define INT64_MAX    _I64_MAX
-#define UINT8_MAX    _UI8_MAX
-#define UINT16_MAX   _UI16_MAX
-#define UINT32_MAX   _UI32_MAX
-#define UINT64_MAX   _UI64_MAX
-
-// 7.18.2.2 Limits of minimum-width integer types
-#define INT_LEAST8_MIN    INT8_MIN
-#define INT_LEAST8_MAX    INT8_MAX
-#define INT_LEAST16_MIN   INT16_MIN
-#define INT_LEAST16_MAX   INT16_MAX
-#define INT_LEAST32_MIN   INT32_MIN
-#define INT_LEAST32_MAX   INT32_MAX
-#define INT_LEAST64_MIN   INT64_MIN
-#define INT_LEAST64_MAX   INT64_MAX
-#define UINT_LEAST8_MAX   UINT8_MAX
-#define UINT_LEAST16_MAX  UINT16_MAX
-#define UINT_LEAST32_MAX  UINT32_MAX
-#define UINT_LEAST64_MAX  UINT64_MAX
-
-// 7.18.2.3 Limits of fastest minimum-width integer types
-#define INT_FAST8_MIN    INT8_MIN
-#define INT_FAST8_MAX    INT8_MAX
-#define INT_FAST16_MIN   INT16_MIN
-#define INT_FAST16_MAX   INT16_MAX
-#define INT_FAST32_MIN   INT32_MIN
-#define INT_FAST32_MAX   INT32_MAX
-#define INT_FAST64_MIN   INT64_MIN
-#define INT_FAST64_MAX   INT64_MAX
-#define UINT_FAST8_MAX   UINT8_MAX
-#define UINT_FAST16_MAX  UINT16_MAX
-#define UINT_FAST32_MAX  UINT32_MAX
-#define UINT_FAST64_MAX  UINT64_MAX
-
-// 7.18.2.4 Limits of integer types capable of holding object pointers
-#ifdef _WIN64 // [
-#  define INTPTR_MIN   INT64_MIN
-#  define INTPTR_MAX   INT64_MAX
-#  define UINTPTR_MAX  UINT64_MAX
-#else // _WIN64 ][
-#  define INTPTR_MIN   INT32_MIN
-#  define INTPTR_MAX   INT32_MAX
-#  define UINTPTR_MAX  UINT32_MAX
-#endif // _WIN64 ]
-
-// 7.18.2.5 Limits of greatest-width integer types
-#define INTMAX_MIN   INT64_MIN
-#define INTMAX_MAX   INT64_MAX
-#define UINTMAX_MAX  UINT64_MAX
-
-// 7.18.3 Limits of other integer types
-
-#ifdef _WIN64 // [
-#  define PTRDIFF_MIN  _I64_MIN
-#  define PTRDIFF_MAX  _I64_MAX
-#else  // _WIN64 ][
-#  define PTRDIFF_MIN  _I32_MIN
-#  define PTRDIFF_MAX  _I32_MAX
-#endif  // _WIN64 ]
-
-#define SIG_ATOMIC_MIN  INT_MIN
-#define SIG_ATOMIC_MAX  INT_MAX
-
-#ifndef SIZE_MAX // [
-#  ifdef _WIN64 // [
-#     define SIZE_MAX  _UI64_MAX
-#  else // _WIN64 ][
-#     define SIZE_MAX  _UI32_MAX
-#  endif // _WIN64 ]
-#endif // SIZE_MAX ]
-
-// WCHAR_MIN and WCHAR_MAX are also defined in <wchar.h>
-#ifndef WCHAR_MIN // [
-#  define WCHAR_MIN  0
-#endif  // WCHAR_MIN ]
-#ifndef WCHAR_MAX // [
-#  define WCHAR_MAX  _UI16_MAX
-#endif  // WCHAR_MAX ]
-
-#define WINT_MIN  0
-#define WINT_MAX  _UI16_MAX
-
-#endif // __STDC_LIMIT_MACROS ]
-
-
-// 7.18.4 Limits of other integer types
-
-#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [   See footnote 224 at page 260
-
-// 7.18.4.1 Macros for minimum-width integer constants
-
-#define INT8_C(val)  val##i8
-#define INT16_C(val) val##i16
-#define INT32_C(val) val##i32
-#define INT64_C(val) val##i64
-
-#define UINT8_C(val)  val##ui8
-#define UINT16_C(val) val##ui16
-#define UINT32_C(val) val##ui32
-#define UINT64_C(val) val##ui64
-
-// 7.18.4.2 Macros for greatest-width integer constants
-#define INTMAX_C   INT64_C
-#define UINTMAX_C  UINT64_C
-
-#endif // __STDC_CONSTANT_MACROS ]
-
-
-#endif // _MSC_STDINT_H_ ]
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/strings.h b/redis-stable/deps/jemalloc/include/msvc_compat/strings.h
deleted file mode 100644
index 996f256c..00000000
--- a/redis-stable/deps/jemalloc/include/msvc_compat/strings.h
+++ /dev/null
@@ -1,58 +0,0 @@
-#ifndef strings_h
-#define strings_h
-
-/* MSVC doesn't define ffs/ffsl. This dummy strings.h header is provided
- * for both */
-#ifdef _MSC_VER
-#  include <intrin.h>
-#  pragma intrinsic(_BitScanForward)
-static __forceinline int ffsl(long x) {
-	unsigned long i;
-
-	if (_BitScanForward(&i, x)) {
-		return i + 1;
-	}
-	return 0;
-}
-
-static __forceinline int ffs(int x) {
-	return ffsl(x);
-}
-
-#  ifdef  _M_X64
-#    pragma intrinsic(_BitScanForward64)
-#  endif
-
-static __forceinline int ffsll(unsigned __int64 x) {
-	unsigned long i;
-#ifdef  _M_X64
-	if (_BitScanForward64(&i, x)) {
-		return i + 1;
-	}
-	return 0;
-#else
-// Fallback for 32-bit build where 64-bit version not available
-// assuming little endian
-	union {
-		unsigned __int64 ll;
-		unsigned   long l[2];
-	} s;
-
-	s.ll = x;
-
-	if (_BitScanForward(&i, s.l[0])) {
-		return i + 1;
-	} else if(_BitScanForward(&i, s.l[1])) {
-		return i + 33;
-	}
-	return 0;
-#endif
-}
-
-#else
-#  define ffsll(x) __builtin_ffsll(x)
-#  define ffsl(x) __builtin_ffsl(x)
-#  define ffs(x) __builtin_ffs(x)
-#endif
-
-#endif /* strings_h */
diff --git a/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h b/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
deleted file mode 100644
index a6ebb930..00000000
--- a/redis-stable/deps/jemalloc/include/msvc_compat/windows_extra.h
+++ /dev/null
@@ -1,6 +0,0 @@
-#ifndef MSVC_COMPAT_WINDOWS_EXTRA_H
-#define MSVC_COMPAT_WINDOWS_EXTRA_H
-
-#include <errno.h>
-
-#endif /* MSVC_COMPAT_WINDOWS_EXTRA_H */
diff --git a/redis-stable/deps/jemalloc/jemalloc.pc.in b/redis-stable/deps/jemalloc/jemalloc.pc.in
deleted file mode 100644
index c428a86d..00000000
--- a/redis-stable/deps/jemalloc/jemalloc.pc.in
+++ /dev/null
@@ -1,12 +0,0 @@
-prefix=@prefix@
-exec_prefix=@exec_prefix@
-libdir=@libdir@
-includedir=@includedir@
-install_suffix=@install_suffix@
-
-Name: jemalloc
-Description: A general purpose malloc(3) implementation that emphasizes fragmentation avoidance and scalable concurrency support.
-URL: http://jemalloc.net/
-Version: @jemalloc_version_major@.@jemalloc_version_minor@.@jemalloc_version_bugfix@_@jemalloc_version_nrev@
-Cflags: -I${includedir}
-Libs: -L${libdir} -ljemalloc${install_suffix}
diff --git a/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4 b/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
deleted file mode 100644
index 2c18e49c..00000000
--- a/redis-stable/deps/jemalloc/m4/ax_cxx_compile_stdcxx.m4
+++ /dev/null
@@ -1,562 +0,0 @@
-# ===========================================================================
-#   http://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html
-# ===========================================================================
-#
-# SYNOPSIS
-#
-#   AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional])
-#
-# DESCRIPTION
-#
-#   Check for baseline language coverage in the compiler for the specified
-#   version of the C++ standard.  If necessary, add switches to CXX and
-#   CXXCPP to enable support.  VERSION may be '11' (for the C++11 standard)
-#   or '14' (for the C++14 standard).
-#
-#   The second argument, if specified, indicates whether you insist on an
-#   extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g.
-#   -std=c++11).  If neither is specified, you get whatever works, with
-#   preference for an extended mode.
-#
-#   The third argument, if specified 'mandatory' or if left unspecified,
-#   indicates that baseline support for the specified C++ standard is
-#   required and that the macro should error out if no mode with that
-#   support is found.  If specified 'optional', then configuration proceeds
-#   regardless, after defining HAVE_CXX${VERSION} if and only if a
-#   supporting mode is found.
-#
-# LICENSE
-#
-#   Copyright (c) 2008 Benjamin Kosnik <bkoz@redhat.com>
-#   Copyright (c) 2012 Zack Weinberg <zackw@panix.com>
-#   Copyright (c) 2013 Roy Stogner <roystgnr@ices.utexas.edu>
-#   Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov <sokolov@google.com>
-#   Copyright (c) 2015 Paul Norman <penorman@mac.com>
-#   Copyright (c) 2015 Moritz Klammler <moritz@klammler.eu>
-#
-#   Copying and distribution of this file, with or without modification, are
-#   permitted in any medium without royalty provided the copyright notice
-#   and this notice are preserved.  This file is offered as-is, without any
-#   warranty.
-
-#serial 4
-
-dnl  This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro
-dnl  (serial version number 13).
-
-AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl
-  m4_if([$1], [11], [],
-        [$1], [14], [],
-        [$1], [17], [m4_fatal([support for C++17 not yet implemented in AX_CXX_COMPILE_STDCXX])],
-        [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl
-  m4_if([$2], [], [],
-        [$2], [ext], [],
-        [$2], [noext], [],
-        [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl
-  m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true],
-        [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true],
-        [$3], [optional], [ax_cxx_compile_cxx$1_required=false],
-        [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])])
-  AC_LANG_PUSH([C++])dnl
-  ac_success=no
-  AC_CACHE_CHECK(whether $CXX supports C++$1 features by default,
-  ax_cv_cxx_compile_cxx$1,
-  [AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
-    [ax_cv_cxx_compile_cxx$1=yes],
-    [ax_cv_cxx_compile_cxx$1=no])])
-  if test x$ax_cv_cxx_compile_cxx$1 = xyes; then
-    ac_success=yes
-  fi
-
-  m4_if([$2], [noext], [], [dnl
-  if test x$ac_success = xno; then
-    for switch in -std=gnu++$1 -std=gnu++0x; do
-      cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
-      AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
-                     $cachevar,
-        [ac_save_CXX="$CXX"
-         CXX="$CXX $switch"
-         AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
-          [eval $cachevar=yes],
-          [eval $cachevar=no])
-         CXX="$ac_save_CXX"])
-      if eval test x\$$cachevar = xyes; then
-        CXX="$CXX $switch"
-        if test -n "$CXXCPP" ; then
-          CXXCPP="$CXXCPP $switch"
-        fi
-        ac_success=yes
-        break
-      fi
-    done
-  fi])
-
-  m4_if([$2], [ext], [], [dnl
-  if test x$ac_success = xno; then
-    dnl HP's aCC needs +std=c++11 according to:
-    dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf
-    dnl Cray's crayCC needs "-h std=c++11"
-    for switch in -std=c++$1 -std=c++0x +std=c++$1 "-h std=c++$1"; do
-      cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
-      AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
-                     $cachevar,
-        [ac_save_CXX="$CXX"
-         CXX="$CXX $switch"
-         AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
-          [eval $cachevar=yes],
-          [eval $cachevar=no])
-         CXX="$ac_save_CXX"])
-      if eval test x\$$cachevar = xyes; then
-        CXX="$CXX $switch"
-        if test -n "$CXXCPP" ; then
-          CXXCPP="$CXXCPP $switch"
-        fi
-        ac_success=yes
-        break
-      fi
-    done
-  fi])
-  AC_LANG_POP([C++])
-  if test x$ax_cxx_compile_cxx$1_required = xtrue; then
-    if test x$ac_success = xno; then
-      AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.])
-    fi
-  fi
-  if test x$ac_success = xno; then
-    HAVE_CXX$1=0
-    AC_MSG_NOTICE([No compiler with C++$1 support was found])
-  else
-    HAVE_CXX$1=1
-    AC_DEFINE(HAVE_CXX$1,1,
-              [define if the compiler supports basic C++$1 syntax])
-  fi
-  AC_SUBST(HAVE_CXX$1)
-])
-
-
-dnl  Test body for checking C++11 support
-
-m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11],
-  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
-)
-
-
-dnl  Test body for checking C++14 support
-
-m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14],
-  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
-  _AX_CXX_COMPILE_STDCXX_testbody_new_in_14
-)
-
-
-dnl  Tests for new features in C++11
-
-m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[
-
-// If the compiler admits that it is not ready for C++11, why torture it?
-// Hopefully, this will speed up the test.
-
-#ifndef __cplusplus
-
-#error "This is not a C++ compiler"
-
-#elif __cplusplus < 201103L
-
-#error "This is not a C++11 compiler"
-
-#else
-
-namespace cxx11
-{
-
-  namespace test_static_assert
-  {
-
-    template <typename T>
-    struct check
-    {
-      static_assert(sizeof(int) <= sizeof(T), "not big enough");
-    };
-
-  }
-
-  namespace test_final_override
-  {
-
-    struct Base
-    {
-      virtual void f() {}
-    };
-
-    struct Derived : public Base
-    {
-      virtual void f() override {}
-    };
-
-  }
-
-  namespace test_double_right_angle_brackets
-  {
-
-    template < typename T >
-    struct check {};
-
-    typedef check<void> single_type;
-    typedef check<check<void>> double_type;
-    typedef check<check<check<void>>> triple_type;
-    typedef check<check<check<check<void>>>> quadruple_type;
-
-  }
-
-  namespace test_decltype
-  {
-
-    int
-    f()
-    {
-      int a = 1;
-      decltype(a) b = 2;
-      return a + b;
-    }
-
-  }
-
-  namespace test_type_deduction
-  {
-
-    template < typename T1, typename T2 >
-    struct is_same
-    {
-      static const bool value = false;
-    };
-
-    template < typename T >
-    struct is_same<T, T>
-    {
-      static const bool value = true;
-    };
-
-    template < typename T1, typename T2 >
-    auto
-    add(T1 a1, T2 a2) -> decltype(a1 + a2)
-    {
-      return a1 + a2;
-    }
-
-    int
-    test(const int c, volatile int v)
-    {
-      static_assert(is_same<int, decltype(0)>::value == true, "");
-      static_assert(is_same<int, decltype(c)>::value == false, "");
-      static_assert(is_same<int, decltype(v)>::value == false, "");
-      auto ac = c;
-      auto av = v;
-      auto sumi = ac + av + 'x';
-      auto sumf = ac + av + 1.0;
-      static_assert(is_same<int, decltype(ac)>::value == true, "");
-      static_assert(is_same<int, decltype(av)>::value == true, "");
-      static_assert(is_same<int, decltype(sumi)>::value == true, "");
-      static_assert(is_same<int, decltype(sumf)>::value == false, "");
-      static_assert(is_same<int, decltype(add(c, v))>::value == true, "");
-      return (sumf > 0.0) ? sumi : add(c, v);
-    }
-
-  }
-
-  namespace test_noexcept
-  {
-
-    int f() { return 0; }
-    int g() noexcept { return 0; }
-
-    static_assert(noexcept(f()) == false, "");
-    static_assert(noexcept(g()) == true, "");
-
-  }
-
-  namespace test_constexpr
-  {
-
-    template < typename CharT >
-    unsigned long constexpr
-    strlen_c_r(const CharT *const s, const unsigned long acc) noexcept
-    {
-      return *s ? strlen_c_r(s + 1, acc + 1) : acc;
-    }
-
-    template < typename CharT >
-    unsigned long constexpr
-    strlen_c(const CharT *const s) noexcept
-    {
-      return strlen_c_r(s, 0UL);
-    }
-
-    static_assert(strlen_c("") == 0UL, "");
-    static_assert(strlen_c("1") == 1UL, "");
-    static_assert(strlen_c("example") == 7UL, "");
-    static_assert(strlen_c("another\0example") == 7UL, "");
-
-  }
-
-  namespace test_rvalue_references
-  {
-
-    template < int N >
-    struct answer
-    {
-      static constexpr int value = N;
-    };
-
-    answer<1> f(int&)       { return answer<1>(); }
-    answer<2> f(const int&) { return answer<2>(); }
-    answer<3> f(int&&)      { return answer<3>(); }
-
-    void
-    test()
-    {
-      int i = 0;
-      const int c = 0;
-      static_assert(decltype(f(i))::value == 1, "");
-      static_assert(decltype(f(c))::value == 2, "");
-      static_assert(decltype(f(0))::value == 3, "");
-    }
-
-  }
-
-  namespace test_uniform_initialization
-  {
-
-    struct test
-    {
-      static const int zero {};
-      static const int one {1};
-    };
-
-    static_assert(test::zero == 0, "");
-    static_assert(test::one == 1, "");
-
-  }
-
-  namespace test_lambdas
-  {
-
-    void
-    test1()
-    {
-      auto lambda1 = [](){};
-      auto lambda2 = lambda1;
-      lambda1();
-      lambda2();
-    }
-
-    int
-    test2()
-    {
-      auto a = [](int i, int j){ return i + j; }(1, 2);
-      auto b = []() -> int { return '0'; }();
-      auto c = [=](){ return a + b; }();
-      auto d = [&](){ return c; }();
-      auto e = [a, &b](int x) mutable {
-        const auto identity = [](int y){ return y; };
-        for (auto i = 0; i < a; ++i)
-          a += b--;
-        return x + identity(a + b);
-      }(0);
-      return a + b + c + d + e;
-    }
-
-    int
-    test3()
-    {
-      const auto nullary = [](){ return 0; };
-      const auto unary = [](int x){ return x; };
-      using nullary_t = decltype(nullary);
-      using unary_t = decltype(unary);
-      const auto higher1st = [](nullary_t f){ return f(); };
-      const auto higher2nd = [unary](nullary_t f1){
-        return [unary, f1](unary_t f2){ return f2(unary(f1())); };
-      };
-      return higher1st(nullary) + higher2nd(nullary)(unary);
-    }
-
-  }
-
-  namespace test_variadic_templates
-  {
-
-    template <int...>
-    struct sum;
-
-    template <int N0, int... N1toN>
-    struct sum<N0, N1toN...>
-    {
-      static constexpr auto value = N0 + sum<N1toN...>::value;
-    };
-
-    template <>
-    struct sum<>
-    {
-      static constexpr auto value = 0;
-    };
-
-    static_assert(sum<>::value == 0, "");
-    static_assert(sum<1>::value == 1, "");
-    static_assert(sum<23>::value == 23, "");
-    static_assert(sum<1, 2>::value == 3, "");
-    static_assert(sum<5, 5, 11>::value == 21, "");
-    static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, "");
-
-  }
-
-  // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae
-  // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function
-  // because of this.
-  namespace test_template_alias_sfinae
-  {
-
-    struct foo {};
-
-    template<typename T>
-    using member = typename T::member_type;
-
-    template<typename T>
-    void func(...) {}
-
-    template<typename T>
-    void func(member<T>*) {}
-
-    void test();
-
-    void test() { func<foo>(0); }
-
-  }
-
-}  // namespace cxx11
-
-#endif  // __cplusplus >= 201103L
-
-]])
-
-
-dnl  Tests for new features in C++14
-
-m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[
-
-// If the compiler admits that it is not ready for C++14, why torture it?
-// Hopefully, this will speed up the test.
-
-#ifndef __cplusplus
-
-#error "This is not a C++ compiler"
-
-#elif __cplusplus < 201402L
-
-#error "This is not a C++14 compiler"
-
-#else
-
-namespace cxx14
-{
-
-  namespace test_polymorphic_lambdas
-  {
-
-    int
-    test()
-    {
-      const auto lambda = [](auto&&... args){
-        const auto istiny = [](auto x){
-          return (sizeof(x) == 1UL) ? 1 : 0;
-        };
-        const int aretiny[] = { istiny(args)... };
-        return aretiny[0];
-      };
-      return lambda(1, 1L, 1.0f, '1');
-    }
-
-  }
-
-  namespace test_binary_literals
-  {
-
-    constexpr auto ivii = 0b0000000000101010;
-    static_assert(ivii == 42, "wrong value");
-
-  }
-
-  namespace test_generalized_constexpr
-  {
-
-    template < typename CharT >
-    constexpr unsigned long
-    strlen_c(const CharT *const s) noexcept
-    {
-      auto length = 0UL;
-      for (auto p = s; *p; ++p)
-        ++length;
-      return length;
-    }
-
-    static_assert(strlen_c("") == 0UL, "");
-    static_assert(strlen_c("x") == 1UL, "");
-    static_assert(strlen_c("test") == 4UL, "");
-    static_assert(strlen_c("another\0test") == 7UL, "");
-
-  }
-
-  namespace test_lambda_init_capture
-  {
-
-    int
-    test()
-    {
-      auto x = 0;
-      const auto lambda1 = [a = x](int b){ return a + b; };
-      const auto lambda2 = [a = lambda1(x)](){ return a; };
-      return lambda2();
-    }
-
-  }
-
-  namespace test_digit_seperators
-  {
-
-    constexpr auto ten_million = 100'000'000;
-    static_assert(ten_million == 100000000, "");
-
-  }
-
-  namespace test_return_type_deduction
-  {
-
-    auto f(int& x) { return x; }
-    decltype(auto) g(int& x) { return x; }
-
-    template < typename T1, typename T2 >
-    struct is_same
-    {
-      static constexpr auto value = false;
-    };
-
-    template < typename T >
-    struct is_same<T, T>
-    {
-      static constexpr auto value = true;
-    };
-
-    int
-    test()
-    {
-      auto x = 0;
-      static_assert(is_same<int, decltype(f(x))>::value, "");
-      static_assert(is_same<int&, decltype(g(x))>::value, "");
-      return x;
-    }
-
-  }
-
-}  // namespace cxx14
-
-#endif  // __cplusplus >= 201402L
-
-]])
diff --git a/redis-stable/deps/jemalloc/msvc/ReadMe.txt b/redis-stable/deps/jemalloc/msvc/ReadMe.txt
deleted file mode 100644
index 633a7d49..00000000
--- a/redis-stable/deps/jemalloc/msvc/ReadMe.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-
-How to build jemalloc for Windows
-=================================
-
-1. Install Cygwin with at least the following packages:
-   * autoconf
-   * autogen
-   * gawk
-   * grep
-   * sed
-
-2. Install Visual Studio 2015 or 2017 with Visual C++
-
-3. Add Cygwin\bin to the PATH environment variable
-
-4. Open "x64 Native Tools Command Prompt for VS 2017"
-   (note: x86/x64 doesn't matter at this point)
-
-5. Generate header files:
-   sh -c "CC=cl ./autogen.sh"
-
-6. Now the project can be opened and built in Visual Studio:
-   msvc\jemalloc_vc2017.sln
diff --git a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
deleted file mode 100644
index aedd5e5e..00000000
--- a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2015.sln
+++ /dev/null
@@ -1,63 +0,0 @@
-
-Microsoft Visual Studio Solution File, Format Version 12.00
-# Visual Studio 14
-VisualStudioVersion = 14.0.24720.0
-MinimumVisualStudioVersion = 10.0.40219.1
-Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{70A99006-6DE9-472B-8F83-4CEE6C616DF3}"
-	ProjectSection(SolutionItems) = preProject
-		ReadMe.txt = ReadMe.txt
-	EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "jemalloc", "projects\vc2015\jemalloc\jemalloc.vcxproj", "{8D6BB292-9E1C-413D-9F98-4864BDC1514A}"
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_threads", "projects\vc2015\test_threads\test_threads.vcxproj", "{09028CFD-4EB7-491D-869C-0708DB97ED44}"
-EndProject
-Global
-	GlobalSection(SolutionConfigurationPlatforms) = preSolution
-		Debug|x64 = Debug|x64
-		Debug|x86 = Debug|x86
-		Debug-static|x64 = Debug-static|x64
-		Debug-static|x86 = Debug-static|x86
-		Release|x64 = Release|x64
-		Release|x86 = Release|x86
-		Release-static|x64 = Release-static|x64
-		Release-static|x86 = Release-static|x86
-	EndGlobalSection
-	GlobalSection(ProjectConfigurationPlatforms) = postSolution
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.ActiveCfg = Debug|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.Build.0 = Debug|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.ActiveCfg = Debug|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.Build.0 = Debug|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.ActiveCfg = Debug-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.Build.0 = Debug-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.ActiveCfg = Debug-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.Build.0 = Debug-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.ActiveCfg = Release|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.Build.0 = Release|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.ActiveCfg = Release|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.Build.0 = Release|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.ActiveCfg = Release-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.Build.0 = Release-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.ActiveCfg = Release-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.Build.0 = Release-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.ActiveCfg = Debug|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.Build.0 = Debug|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.ActiveCfg = Debug|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.Build.0 = Debug|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.ActiveCfg = Debug-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.Build.0 = Debug-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.ActiveCfg = Debug-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.Build.0 = Debug-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.ActiveCfg = Release|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.Build.0 = Release|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.ActiveCfg = Release|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.Build.0 = Release|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.ActiveCfg = Release-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.Build.0 = Release-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.ActiveCfg = Release-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.Build.0 = Release-static|Win32
-	EndGlobalSection
-	GlobalSection(SolutionProperties) = preSolution
-		HideSolutionNode = FALSE
-	EndGlobalSection
-EndGlobal
diff --git a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln b/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
deleted file mode 100644
index c22fcb43..00000000
--- a/redis-stable/deps/jemalloc/msvc/jemalloc_vc2017.sln
+++ /dev/null
@@ -1,63 +0,0 @@
-
-Microsoft Visual Studio Solution File, Format Version 12.00
-# Visual Studio 14
-VisualStudioVersion = 14.0.24720.0
-MinimumVisualStudioVersion = 10.0.40219.1
-Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{70A99006-6DE9-472B-8F83-4CEE6C616DF3}"
-	ProjectSection(SolutionItems) = preProject
-		ReadMe.txt = ReadMe.txt
-	EndProjectSection
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "jemalloc", "projects\vc2017\jemalloc\jemalloc.vcxproj", "{8D6BB292-9E1C-413D-9F98-4864BDC1514A}"
-EndProject
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "test_threads", "projects\vc2017\test_threads\test_threads.vcxproj", "{09028CFD-4EB7-491D-869C-0708DB97ED44}"
-EndProject
-Global
-	GlobalSection(SolutionConfigurationPlatforms) = preSolution
-		Debug|x64 = Debug|x64
-		Debug|x86 = Debug|x86
-		Debug-static|x64 = Debug-static|x64
-		Debug-static|x86 = Debug-static|x86
-		Release|x64 = Release|x64
-		Release|x86 = Release|x86
-		Release-static|x64 = Release-static|x64
-		Release-static|x86 = Release-static|x86
-	EndGlobalSection
-	GlobalSection(ProjectConfigurationPlatforms) = postSolution
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.ActiveCfg = Debug|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x64.Build.0 = Debug|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.ActiveCfg = Debug|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug|x86.Build.0 = Debug|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.ActiveCfg = Debug-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x64.Build.0 = Debug-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.ActiveCfg = Debug-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Debug-static|x86.Build.0 = Debug-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.ActiveCfg = Release|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x64.Build.0 = Release|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.ActiveCfg = Release|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release|x86.Build.0 = Release|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.ActiveCfg = Release-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x64.Build.0 = Release-static|x64
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.ActiveCfg = Release-static|Win32
-		{8D6BB292-9E1C-413D-9F98-4864BDC1514A}.Release-static|x86.Build.0 = Release-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.ActiveCfg = Debug|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x64.Build.0 = Debug|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.ActiveCfg = Debug|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug|x86.Build.0 = Debug|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.ActiveCfg = Debug-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x64.Build.0 = Debug-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.ActiveCfg = Debug-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Debug-static|x86.Build.0 = Debug-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.ActiveCfg = Release|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x64.Build.0 = Release|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.ActiveCfg = Release|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release|x86.Build.0 = Release|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.ActiveCfg = Release-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x64.Build.0 = Release-static|x64
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.ActiveCfg = Release-static|Win32
-		{09028CFD-4EB7-491D-869C-0708DB97ED44}.Release-static|x86.Build.0 = Release-static|Win32
-	EndGlobalSection
-	GlobalSection(SolutionProperties) = preSolution
-		HideSolutionNode = FALSE
-	EndGlobalSection
-EndGlobal
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
deleted file mode 100644
index f7b175b0..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj
+++ /dev/null
@@ -1,348 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project DefaultTargets="Build" ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup Label="ProjectConfigurations">
-    <ProjectConfiguration Include="Debug-static|Win32">
-      <Configuration>Debug-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug-static|x64">
-      <Configuration>Debug-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|Win32">
-      <Configuration>Debug</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|Win32">
-      <Configuration>Release-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|x64">
-      <Configuration>Release-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|Win32">
-      <Configuration>Release</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|x64">
-      <Configuration>Debug</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|x64">
-      <Configuration>Release</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\..\src\arena.c" />
-    <ClCompile Include="..\..\..\..\src\background_thread.c" />
-    <ClCompile Include="..\..\..\..\src\base.c" />
-    <ClCompile Include="..\..\..\..\src\bin.c" />
-    <ClCompile Include="..\..\..\..\src\bitmap.c" />
-    <ClCompile Include="..\..\..\..\src\ckh.c" />
-    <ClCompile Include="..\..\..\..\src\ctl.c" />
-    <ClCompile Include="..\..\..\..\src\div.c" />
-    <ClCompile Include="..\..\..\..\src\extent.c" />
-    <ClCompile Include="..\..\..\..\src\extent_dss.c" />
-    <ClCompile Include="..\..\..\..\src\extent_mmap.c" />
-    <ClCompile Include="..\..\..\..\src\hash.c" />
-    <ClCompile Include="..\..\..\..\src\hooks.c" />
-    <ClCompile Include="..\..\..\..\src\jemalloc.c" />
-    <ClCompile Include="..\..\..\..\src\large.c" />
-    <ClCompile Include="..\..\..\..\src\log.c" />
-    <ClCompile Include="..\..\..\..\src\malloc_io.c" />
-    <ClCompile Include="..\..\..\..\src\mutex.c" />
-    <ClCompile Include="..\..\..\..\src\mutex_pool.c" />
-    <ClCompile Include="..\..\..\..\src\nstime.c" />
-    <ClCompile Include="..\..\..\..\src\pages.c" />
-    <ClCompile Include="..\..\..\..\src\prng.c" />
-    <ClCompile Include="..\..\..\..\src\prof.c" />
-    <ClCompile Include="..\..\..\..\src\rtree.c" />
-    <ClCompile Include="..\..\..\..\src\stats.c" />
-    <ClCompile Include="..\..\..\..\src\sz.c" />
-    <ClCompile Include="..\..\..\..\src\tcache.c" />
-    <ClCompile Include="..\..\..\..\src\ticker.c" />
-    <ClCompile Include="..\..\..\..\src\tsd.c" />
-    <ClCompile Include="..\..\..\..\src\witness.c" />
-  </ItemGroup>
-  <PropertyGroup Label="Globals">
-    <ProjectGuid>{8D6BB292-9E1C-413D-9F98-4864BDC1514A}</ProjectGuid>
-    <Keyword>Win32Proj</Keyword>
-    <RootNamespace>jemalloc</RootNamespace>
-    <WindowsTargetPlatformVersion>8.1</WindowsTargetPlatformVersion>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
-  <ImportGroup Label="ExtensionSettings">
-  </ImportGroup>
-  <ImportGroup Label="Shared">
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <PropertyGroup Label="UserMacros" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)d</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)d</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <DebugInformationFormat>OldStyle</DebugInformationFormat>
-      <MinimalRebuild>false</MinimalRebuild>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <DebugInformationFormat>OldStyle</DebugInformationFormat>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
-  <ImportGroup Label="ExtensionTargets">
-  </ImportGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
deleted file mode 100644
index 11cfcd0b..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2015/jemalloc/jemalloc.vcxproj.filters
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup>
-    <Filter Include="Source Files">
-      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
-      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
-    </Filter>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\..\src\arena.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\background_thread.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\base.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\bitmap.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ckh.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ctl.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent_dss.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent_mmap.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\hash.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\hooks.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\jemalloc.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\large.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\malloc_io.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\mutex.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\mutex_pool.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\nstime.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\pages.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\prng.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\prof.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\rtree.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\stats.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\sz.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\tcache.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ticker.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\tsd.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\witness.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\log.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\bin.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\div.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-  </ItemGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
deleted file mode 100644
index 325876d6..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj
+++ /dev/null
@@ -1,327 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project DefaultTargets="Build" ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup Label="ProjectConfigurations">
-    <ProjectConfiguration Include="Debug-static|Win32">
-      <Configuration>Debug-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug-static|x64">
-      <Configuration>Debug-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|Win32">
-      <Configuration>Debug</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|Win32">
-      <Configuration>Release-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|x64">
-      <Configuration>Release-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|Win32">
-      <Configuration>Release</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|x64">
-      <Configuration>Debug</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|x64">
-      <Configuration>Release</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-  </ItemGroup>
-  <PropertyGroup Label="Globals">
-    <ProjectGuid>{09028CFD-4EB7-491D-869C-0708DB97ED44}</ProjectGuid>
-    <Keyword>Win32Proj</Keyword>
-    <RootNamespace>test_threads</RootNamespace>
-    <WindowsTargetPlatformVersion>8.1</WindowsTargetPlatformVersion>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v140</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
-  <ImportGroup Label="ExtensionSettings">
-  </ImportGroup>
-  <ImportGroup Label="Shared">
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <PropertyGroup Label="UserMacros" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>true</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>true</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <LinkIncremental>true</LinkIncremental>
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <LinkIncremental>true</LinkIncremental>
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\test_threads\test_threads.cpp" />
-    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp" />
-  </ItemGroup>
-  <ItemGroup>
-    <ProjectReference Include="..\jemalloc\jemalloc.vcxproj">
-      <Project>{8d6bb292-9e1c-413d-9f98-4864bdc1514a}</Project>
-    </ProjectReference>
-  </ItemGroup>
-  <ItemGroup>
-    <ClInclude Include="..\..\..\test_threads\test_threads.h" />
-  </ItemGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
-  <ImportGroup Label="ExtensionTargets">
-  </ImportGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
deleted file mode 100644
index fa4588fd..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2015/test_threads/test_threads.vcxproj.filters
+++ /dev/null
@@ -1,26 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup>
-    <Filter Include="Source Files">
-      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
-      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
-    </Filter>
-    <Filter Include="Header Files">
-      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
-      <Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
-    </Filter>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\test_threads\test_threads.cpp">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-  </ItemGroup>
-  <ItemGroup>
-    <ClInclude Include="..\..\..\test_threads\test_threads.h">
-      <Filter>Header Files</Filter>
-    </ClInclude>
-  </ItemGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
deleted file mode 100644
index ed71de8a..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj
+++ /dev/null
@@ -1,347 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup Label="ProjectConfigurations">
-    <ProjectConfiguration Include="Debug-static|Win32">
-      <Configuration>Debug-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug-static|x64">
-      <Configuration>Debug-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|Win32">
-      <Configuration>Debug</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|Win32">
-      <Configuration>Release-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|x64">
-      <Configuration>Release-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|Win32">
-      <Configuration>Release</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|x64">
-      <Configuration>Debug</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|x64">
-      <Configuration>Release</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\..\src\arena.c" />
-    <ClCompile Include="..\..\..\..\src\background_thread.c" />
-    <ClCompile Include="..\..\..\..\src\base.c" />
-    <ClCompile Include="..\..\..\..\src\bin.c" />
-    <ClCompile Include="..\..\..\..\src\bitmap.c" />
-    <ClCompile Include="..\..\..\..\src\ckh.c" />
-    <ClCompile Include="..\..\..\..\src\ctl.c" />
-    <ClCompile Include="..\..\..\..\src\div.c" />
-    <ClCompile Include="..\..\..\..\src\extent.c" />
-    <ClCompile Include="..\..\..\..\src\extent_dss.c" />
-    <ClCompile Include="..\..\..\..\src\extent_mmap.c" />
-    <ClCompile Include="..\..\..\..\src\hash.c" />
-    <ClCompile Include="..\..\..\..\src\hooks.c" />
-    <ClCompile Include="..\..\..\..\src\jemalloc.c" />
-    <ClCompile Include="..\..\..\..\src\large.c" />
-    <ClCompile Include="..\..\..\..\src\log.c" />
-    <ClCompile Include="..\..\..\..\src\malloc_io.c" />
-    <ClCompile Include="..\..\..\..\src\mutex.c" />
-    <ClCompile Include="..\..\..\..\src\mutex_pool.c" />
-    <ClCompile Include="..\..\..\..\src\nstime.c" />
-    <ClCompile Include="..\..\..\..\src\pages.c" />
-    <ClCompile Include="..\..\..\..\src\prng.c" />
-    <ClCompile Include="..\..\..\..\src\prof.c" />
-    <ClCompile Include="..\..\..\..\src\rtree.c" />
-    <ClCompile Include="..\..\..\..\src\stats.c" />
-    <ClCompile Include="..\..\..\..\src\sz.c" />
-    <ClCompile Include="..\..\..\..\src\tcache.c" />
-    <ClCompile Include="..\..\..\..\src\ticker.c" />
-    <ClCompile Include="..\..\..\..\src\tsd.c" />
-    <ClCompile Include="..\..\..\..\src\witness.c" />
-  </ItemGroup>
-  <PropertyGroup Label="Globals">
-    <ProjectGuid>{8D6BB292-9E1C-413D-9F98-4864BDC1514A}</ProjectGuid>
-    <Keyword>Win32Proj</Keyword>
-    <RootNamespace>jemalloc</RootNamespace>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
-    <ConfigurationType>DynamicLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
-    <ConfigurationType>StaticLibrary</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
-  <ImportGroup Label="ExtensionSettings">
-  </ImportGroup>
-  <ImportGroup Label="Shared">
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <PropertyGroup Label="UserMacros" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)d</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-$(PlatformToolset)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)d</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <TargetName>$(ProjectName)-vc$(PlatformToolsetVersion)-$(Configuration)</TargetName>
-  </PropertyGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;JEMALLOC_DEBUG;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;JEMALLOC_DEBUG;_REENTRANT;JEMALLOC_EXPORT=;_DEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <DebugInformationFormat>OldStyle</DebugInformationFormat>
-      <MinimalRebuild>false</MinimalRebuild>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;_WINDLL;DLLEXPORT;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <ProgramDataBaseFileName>$(OutputPath)$(TargetName).pdb</ProgramDataBaseFileName>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_NO_PRIVATE_NAMESPACE;_REENTRANT;JEMALLOC_EXPORT=;NDEBUG;_LIB;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-      <DisableSpecificWarnings>4090;4146;4267;4334</DisableSpecificWarnings>
-      <DebugInformationFormat>OldStyle</DebugInformationFormat>
-    </ClCompile>
-    <Link>
-      <SubSystem>Windows</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-    </Link>
-  </ItemDefinitionGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
-  <ImportGroup Label="ExtensionTargets">
-  </ImportGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
deleted file mode 100644
index 11cfcd0b..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2017/jemalloc/jemalloc.vcxproj.filters
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup>
-    <Filter Include="Source Files">
-      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
-      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
-    </Filter>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\..\src\arena.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\background_thread.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\base.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\bitmap.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ckh.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ctl.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent_dss.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\extent_mmap.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\hash.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\hooks.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\jemalloc.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\large.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\malloc_io.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\mutex.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\mutex_pool.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\nstime.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\pages.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\prng.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\prof.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\rtree.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\stats.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\sz.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\tcache.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\ticker.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\tsd.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\witness.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\log.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\bin.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\..\src\div.c">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-  </ItemGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
deleted file mode 100644
index c35b0f5a..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj
+++ /dev/null
@@ -1,326 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup Label="ProjectConfigurations">
-    <ProjectConfiguration Include="Debug-static|Win32">
-      <Configuration>Debug-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug-static|x64">
-      <Configuration>Debug-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|Win32">
-      <Configuration>Debug</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|Win32">
-      <Configuration>Release-static</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release-static|x64">
-      <Configuration>Release-static</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|Win32">
-      <Configuration>Release</Configuration>
-      <Platform>Win32</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Debug|x64">
-      <Configuration>Debug</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-    <ProjectConfiguration Include="Release|x64">
-      <Configuration>Release</Configuration>
-      <Platform>x64</Platform>
-    </ProjectConfiguration>
-  </ItemGroup>
-  <PropertyGroup Label="Globals">
-    <ProjectGuid>{09028CFD-4EB7-491D-869C-0708DB97ED44}</ProjectGuid>
-    <Keyword>Win32Proj</Keyword>
-    <RootNamespace>test_threads</RootNamespace>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>true</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="Configuration">
-    <ConfigurationType>Application</ConfigurationType>
-    <UseDebugLibraries>false</UseDebugLibraries>
-    <PlatformToolset>v141</PlatformToolset>
-    <WholeProgramOptimization>true</WholeProgramOptimization>
-    <CharacterSet>MultiByte</CharacterSet>
-  </PropertyGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
-  <ImportGroup Label="ExtensionSettings">
-  </ImportGroup>
-  <ImportGroup Label="Shared">
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'" Label="PropertySheets">
-    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
-  </ImportGroup>
-  <PropertyGroup Label="UserMacros" />
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>true</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>true</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <LinkIncremental>true</LinkIncremental>
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <LinkIncremental>true</LinkIncremental>
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <OutDir>$(SolutionDir)$(Platform)\$(Configuration)\</OutDir>
-    <IntDir>$(Platform)\$(Configuration)\</IntDir>
-    <LinkIncremental>false</LinkIncremental>
-  </PropertyGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|Win32'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalDependencies>jemallocd.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug-static|x64'">
-    <ClCompile>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <WarningLevel>Level3</WarningLevel>
-      <Optimization>Disabled</Optimization>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;_DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|Win32'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-$(PlatformToolset)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release-static|x64'">
-    <ClCompile>
-      <WarningLevel>Level3</WarningLevel>
-      <PrecompiledHeader>
-      </PrecompiledHeader>
-      <Optimization>MaxSpeed</Optimization>
-      <FunctionLevelLinking>true</FunctionLevelLinking>
-      <IntrinsicFunctions>true</IntrinsicFunctions>
-      <PreprocessorDefinitions>JEMALLOC_EXPORT=;JEMALLOC_STATIC;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
-      <AdditionalIncludeDirectories>..\..\..\..\test\include;..\..\..\..\include;..\..\..\..\include\msvc_compat;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
-      <RuntimeLibrary>MultiThreaded</RuntimeLibrary>
-    </ClCompile>
-    <Link>
-      <SubSystem>Console</SubSystem>
-      <GenerateDebugInformation>true</GenerateDebugInformation>
-      <EnableCOMDATFolding>true</EnableCOMDATFolding>
-      <OptimizeReferences>true</OptimizeReferences>
-      <AdditionalLibraryDirectories>$(SolutionDir)$(Platform)\$(Configuration)</AdditionalLibraryDirectories>
-      <AdditionalDependencies>jemalloc-vc$(PlatformToolsetVersion)-$(Configuration).lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies)</AdditionalDependencies>
-    </Link>
-  </ItemDefinitionGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\test_threads\test_threads.cpp" />
-    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp" />
-  </ItemGroup>
-  <ItemGroup>
-    <ProjectReference Include="..\jemalloc\jemalloc.vcxproj">
-      <Project>{8d6bb292-9e1c-413d-9f98-4864bdc1514a}</Project>
-    </ProjectReference>
-  </ItemGroup>
-  <ItemGroup>
-    <ClInclude Include="..\..\..\test_threads\test_threads.h" />
-  </ItemGroup>
-  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
-  <ImportGroup Label="ExtensionTargets">
-  </ImportGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters b/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
deleted file mode 100644
index fa4588fd..00000000
--- a/redis-stable/deps/jemalloc/msvc/projects/vc2017/test_threads/test_threads.vcxproj.filters
+++ /dev/null
@@ -1,26 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <ItemGroup>
-    <Filter Include="Source Files">
-      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
-      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
-    </Filter>
-    <Filter Include="Header Files">
-      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
-      <Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
-    </Filter>
-  </ItemGroup>
-  <ItemGroup>
-    <ClCompile Include="..\..\..\test_threads\test_threads.cpp">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-    <ClCompile Include="..\..\..\test_threads\test_threads_main.cpp">
-      <Filter>Source Files</Filter>
-    </ClCompile>
-  </ItemGroup>
-  <ItemGroup>
-    <ClInclude Include="..\..\..\test_threads\test_threads.h">
-      <Filter>Header Files</Filter>
-    </ClInclude>
-  </ItemGroup>
-</Project>
\ No newline at end of file
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
deleted file mode 100644
index 92e31624..00000000
--- a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.cpp
+++ /dev/null
@@ -1,88 +0,0 @@
-// jemalloc C++ threaded test
-// Author: Rustam Abdullaev
-// Public Domain
-
-#include <atomic>
-#include <functional>
-#include <future>
-#include <random>
-#include <thread>
-#include <vector>
-#include <stdio.h>
-#include <jemalloc/jemalloc.h>
-
-using std::vector;
-using std::thread;
-using std::uniform_int_distribution;
-using std::minstd_rand;
-
-int test_threads() {
-  je_malloc_conf = "narenas:3";
-  int narenas = 0;
-  size_t sz = sizeof(narenas);
-  je_mallctl("opt.narenas", (void *)&narenas, &sz, NULL, 0);
-  if (narenas != 3) {
-    printf("Error: unexpected number of arenas: %d\n", narenas);
-    return 1;
-  }
-  static const int sizes[] = { 7, 16, 32, 60, 91, 100, 120, 144, 169, 199, 255, 400, 670, 900, 917, 1025, 3333, 5190, 13131, 49192, 99999, 123123, 255265, 2333111 };
-  static const int numSizes = (int)(sizeof(sizes) / sizeof(sizes[0]));
-  vector<thread> workers;
-  static const int numThreads = narenas + 1, numAllocsMax = 25, numIter1 = 50, numIter2 = 50;
-  je_malloc_stats_print(NULL, NULL, NULL);
-  size_t allocated1;
-  size_t sz1 = sizeof(allocated1);
-  je_mallctl("stats.active", (void *)&allocated1, &sz1, NULL, 0);
-  printf("\nPress Enter to start threads...\n");
-  getchar();
-  printf("Starting %d threads x %d x %d iterations...\n", numThreads, numIter1, numIter2);
-  for (int i = 0; i < numThreads; i++) {
-    workers.emplace_back([tid=i]() {
-      uniform_int_distribution<int> sizeDist(0, numSizes - 1);
-      minstd_rand rnd(tid * 17);
-      uint8_t* ptrs[numAllocsMax];
-      int ptrsz[numAllocsMax];
-      for (int i = 0; i < numIter1; ++i) {
-        thread t([&]() {
-          for (int i = 0; i < numIter2; ++i) {
-            const int numAllocs = numAllocsMax - sizeDist(rnd);
-            for (int j = 0; j < numAllocs; j += 64) {
-              const int x = sizeDist(rnd);
-              const int sz = sizes[x];
-              ptrsz[j] = sz;
-              ptrs[j] = (uint8_t*)je_malloc(sz);
-              if (!ptrs[j]) {
-                printf("Unable to allocate %d bytes in thread %d, iter %d, alloc %d. %d\n", sz, tid, i, j, x);
-                exit(1);
-              }
-              for (int k = 0; k < sz; k++)
-                ptrs[j][k] = tid + k;
-            }
-            for (int j = 0; j < numAllocs; j += 64) {
-              for (int k = 0, sz = ptrsz[j]; k < sz; k++)
-                if (ptrs[j][k] != (uint8_t)(tid + k)) {
-                  printf("Memory error in thread %d, iter %d, alloc %d @ %d : %02X!=%02X\n", tid, i, j, k, ptrs[j][k], (uint8_t)(tid + k));
-                  exit(1);
-                }
-              je_free(ptrs[j]);
-            }
-          }
-        });
-        t.join();
-      }
-    });
-  }
-  for (thread& t : workers) {
-    t.join();
-  }
-  je_malloc_stats_print(NULL, NULL, NULL);
-  size_t allocated2;
-  je_mallctl("stats.active", (void *)&allocated2, &sz1, NULL, 0);
-  size_t leaked = allocated2 - allocated1;
-  printf("\nDone. Leaked: %zd bytes\n", leaked);
-  bool failed = leaked > 65536; // in case C++ runtime allocated something (e.g. iostream locale or facet)
-  printf("\nTest %s!\n", (failed ? "FAILED" : "successful"));
-  printf("\nPress Enter to continue...\n");
-  getchar();
-  return failed ? 1 : 0;
-}
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
deleted file mode 100644
index 64d0cdb3..00000000
--- a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads.h
+++ /dev/null
@@ -1,3 +0,0 @@
-#pragma once
-
-int test_threads();
diff --git a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp b/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
deleted file mode 100644
index 0a022fba..00000000
--- a/redis-stable/deps/jemalloc/msvc/test_threads/test_threads_main.cpp
+++ /dev/null
@@ -1,11 +0,0 @@
-#include "test_threads.h"
-#include <future>
-#include <functional>
-#include <chrono>
-
-using namespace std::chrono_literals;
-
-int main(int argc, char** argv) {
-  int rc = test_threads();
-  return rc;
-}
diff --git a/redis-stable/deps/jemalloc/run_tests.sh b/redis-stable/deps/jemalloc/run_tests.sh
deleted file mode 100755
index b434f15b..00000000
--- a/redis-stable/deps/jemalloc/run_tests.sh
+++ /dev/null
@@ -1 +0,0 @@
-$(dirname "$)")/scripts/gen_run_tests.py | bash
diff --git a/redis-stable/deps/jemalloc/scripts/gen_run_tests.py b/redis-stable/deps/jemalloc/scripts/gen_run_tests.py
deleted file mode 100755
index a87ecffb..00000000
--- a/redis-stable/deps/jemalloc/scripts/gen_run_tests.py
+++ /dev/null
@@ -1,112 +0,0 @@
-#!/usr/bin/env python
-
-import sys
-from itertools import combinations
-from os import uname
-from multiprocessing import cpu_count
-
-# Later, we want to test extended vaddr support.  Apparently, the "real" way of
-# checking this is flaky on OS X.
-bits_64 = sys.maxsize > 2**32
-
-nparallel = cpu_count() * 2
-
-uname = uname()[0]
-
-def powerset(items):
-    result = []
-    for i in xrange(len(items) + 1):
-        result += combinations(items, i)
-    return result
-
-possible_compilers = [('gcc', 'g++'), ('clang', 'clang++')]
-possible_compiler_opts = [
-    '-m32',
-]
-possible_config_opts = [
-    '--enable-debug',
-    '--enable-prof',
-    '--disable-stats',
-]
-if bits_64:
-    possible_config_opts.append('--with-lg-vaddr=56')
-
-possible_malloc_conf_opts = [
-    'tcache:false',
-    'dss:primary',
-    'percpu_arena:percpu',
-    'background_thread:true',
-]
-
-print 'set -e'
-print 'if [ -f Makefile ] ; then make relclean ; fi'
-print 'autoconf'
-print 'rm -rf run_tests.out'
-print 'mkdir run_tests.out'
-print 'cd run_tests.out'
-
-ind = 0
-for cc, cxx in possible_compilers:
-    for compiler_opts in powerset(possible_compiler_opts):
-        for config_opts in powerset(possible_config_opts):
-            for malloc_conf_opts in powerset(possible_malloc_conf_opts):
-                if cc is 'clang' \
-                  and '-m32' in possible_compiler_opts \
-                  and '--enable-prof' in config_opts:
-                    continue
-                config_line = (
-                    'EXTRA_CFLAGS=-Werror EXTRA_CXXFLAGS=-Werror '
-                    + 'CC="{} {}" '.format(cc, " ".join(compiler_opts))
-                    + 'CXX="{} {}" '.format(cxx, " ".join(compiler_opts))
-                    + '../../configure '
-                    + " ".join(config_opts) + (' --with-malloc-conf=' +
-                    ",".join(malloc_conf_opts) if len(malloc_conf_opts) > 0
-                    else '')
-                )
-
-                # We don't want to test large vaddr spaces in 32-bit mode.
-		if ('-m32' in compiler_opts and '--with-lg-vaddr=56' in
-                  config_opts):
-		    continue
-
-                # Per CPU arenas are only supported on Linux.
-                linux_supported = ('percpu_arena:percpu' in malloc_conf_opts \
-                  or 'background_thread:true' in malloc_conf_opts)
-                # Heap profiling and dss are not supported on OS X.
-                darwin_unsupported = ('--enable-prof' in config_opts or \
-                  'dss:primary' in malloc_conf_opts)
-                if (uname == 'Linux' and linux_supported) \
-                  or (not linux_supported and (uname != 'Darwin' or \
-                  not darwin_unsupported)):
-                    print """cat <<EOF > run_test_%(ind)d.sh
-#!/bin/sh
-
-set -e
-
-abort() {
-    echo "==> Error" >> run_test.log
-    echo "Error; see run_tests.out/run_test_%(ind)d.out/run_test.log"
-    exit 255 # Special exit code tells xargs to terminate.
-}
-
-# Environment variables are not supported.
-run_cmd() {
-    echo "==> \$@" >> run_test.log
-    \$@ >> run_test.log 2>&1 || abort
-}
-
-echo "=> run_test_%(ind)d: %(config_line)s"
-mkdir run_test_%(ind)d.out
-cd run_test_%(ind)d.out
-
-echo "==> %(config_line)s" >> run_test.log
-%(config_line)s >> run_test.log 2>&1 || abort
-
-run_cmd make all tests
-run_cmd make check
-run_cmd make distclean
-EOF
-chmod 755 run_test_%(ind)d.sh""" % {'ind': ind, 'config_line': config_line}
-                    ind += 1
-
-print 'for i in `seq 0 %(last_ind)d` ; do echo run_test_${i}.sh ; done | xargs -P %(nparallel)d -n 1 sh' % {'last_ind': ind-1, 'nparallel': nparallel}
diff --git a/redis-stable/deps/jemalloc/scripts/gen_travis.py b/redis-stable/deps/jemalloc/scripts/gen_travis.py
deleted file mode 100755
index 6dd39290..00000000
--- a/redis-stable/deps/jemalloc/scripts/gen_travis.py
+++ /dev/null
@@ -1,107 +0,0 @@
-#!/usr/bin/env python
-
-from itertools import combinations
-
-travis_template = """\
-language: generic
-
-matrix:
-  include:
-%s
-
-before_script:
-  - autoconf
-  - ./configure ${COMPILER_FLAGS:+ \
-      CC="$CC $COMPILER_FLAGS" \
-      CXX="$CXX $COMPILER_FLAGS" } \
-      $CONFIGURE_FLAGS
-  - make -j3
-  - make -j3 tests
-
-script:
-  - make check
-"""
-
-# The 'default' configuration is gcc, on linux, with no compiler or configure
-# flags.  We also test with clang, -m32, --enable-debug, --enable-prof,
-# --disable-stats, and --with-malloc-conf=tcache:false.  To avoid abusing
-# travis though, we don't test all 2**7 = 128 possible combinations of these;
-# instead, we only test combinations of up to 2 'unusual' settings, under the
-# hope that bugs involving interactions of such settings are rare.
-# Things at once, for C(7, 0) + C(7, 1) + C(7, 2) = 29
-MAX_UNUSUAL_OPTIONS = 2
-
-os_default = 'linux'
-os_unusual = 'osx'
-
-compilers_default = 'CC=gcc CXX=g++'
-compilers_unusual = 'CC=clang CXX=clang++'
-
-compiler_flag_unusuals = ['-m32']
-
-configure_flag_unusuals = [
-    '--enable-debug',
-    '--enable-prof',
-    '--disable-stats',
-]
-
-malloc_conf_unusuals = [
-    'tcache:false',
-    'dss:primary',
-    'percpu_arena:percpu',
-    'background_thread:true',
-]
-
-all_unusuals = (
-    [os_unusual] + [compilers_unusual] + compiler_flag_unusuals
-    + configure_flag_unusuals + malloc_conf_unusuals
-)
-
-unusual_combinations_to_test = []
-for i in xrange(MAX_UNUSUAL_OPTIONS + 1):
-    unusual_combinations_to_test += combinations(all_unusuals, i)
-
-include_rows = ""
-for unusual_combination in unusual_combinations_to_test:
-    os = os_default
-    if os_unusual in unusual_combination:
-        os = os_unusual
-
-    compilers = compilers_default
-    if compilers_unusual in unusual_combination:
-        compilers = compilers_unusual
-
-    compiler_flags = [
-        x for x in unusual_combination if x in compiler_flag_unusuals]
-
-    configure_flags = [
-        x for x in unusual_combination if x in configure_flag_unusuals]
-
-    malloc_conf = [
-        x for x in unusual_combination if x in malloc_conf_unusuals]
-    # Filter out unsupported configurations on OS X.
-    if os == 'osx' and ('dss:primary' in malloc_conf or \
-      'percpu_arena:percpu' in malloc_conf or 'background_thread:true' \
-      in malloc_conf):
-        continue
-    if len(malloc_conf) > 0:
-        configure_flags.append('--with-malloc-conf=' + ",".join(malloc_conf))
-
-    # Filter out an unsupported configuration - heap profiling on OS X.
-    if os == 'osx' and '--enable-prof' in configure_flags:
-        continue
-
-    # We get some spurious errors when -Warray-bounds is enabled.
-    env_string = ('{} COMPILER_FLAGS="{}" CONFIGURE_FLAGS="{}" '
-	'EXTRA_CFLAGS="-Werror -Wno-array-bounds"').format(
-        compilers, " ".join(compiler_flags), " ".join(configure_flags))
-
-    include_rows += '    - os: %s\n' % os
-    include_rows += '      env: %s\n' % env_string
-    if '-m32' in unusual_combination and os == 'linux':
-        include_rows += '      addons:\n'
-	include_rows += '        apt:\n'
-	include_rows += '          packages:\n'
-	include_rows += '            - gcc-multilib\n'
-
-print travis_template % include_rows
diff --git a/redis-stable/deps/jemalloc/src/arena.c b/redis-stable/deps/jemalloc/src/arena.c
deleted file mode 100644
index 5d55bf1a..00000000
--- a/redis-stable/deps/jemalloc/src/arena.c
+++ /dev/null
@@ -1,2043 +0,0 @@
-#define JEMALLOC_ARENA_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/div.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/util.h"
-
-/******************************************************************************/
-/* Data. */
-
-/*
- * Define names for both unininitialized and initialized phases, so that
- * options and mallctl processing are straightforward.
- */
-const char *percpu_arena_mode_names[] = {
-	"percpu",
-	"phycpu",
-	"disabled",
-	"percpu",
-	"phycpu"
-};
-percpu_arena_mode_t opt_percpu_arena = PERCPU_ARENA_DEFAULT;
-
-ssize_t opt_dirty_decay_ms = DIRTY_DECAY_MS_DEFAULT;
-ssize_t opt_muzzy_decay_ms = MUZZY_DECAY_MS_DEFAULT;
-
-static atomic_zd_t dirty_decay_ms_default;
-static atomic_zd_t muzzy_decay_ms_default;
-
-const uint64_t h_steps[SMOOTHSTEP_NSTEPS] = {
-#define STEP(step, h, x, y)			\
-		h,
-		SMOOTHSTEP
-#undef STEP
-};
-
-static div_info_t arena_binind_div_info[NBINS];
-
-/******************************************************************************/
-/*
- * Function prototypes for static functions that are referenced prior to
- * definition.
- */
-
-static void arena_decay_to_limit(tsdn_t *tsdn, arena_t *arena,
-    arena_decay_t *decay, extents_t *extents, bool all, size_t npages_limit,
-    size_t npages_decay_max, bool is_background_thread);
-static bool arena_decay_dirty(tsdn_t *tsdn, arena_t *arena,
-    bool is_background_thread, bool all);
-static void arena_dalloc_bin_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
-    bin_t *bin);
-static void arena_bin_lower_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
-    bin_t *bin);
-
-/******************************************************************************/
-
-void
-arena_basic_stats_merge(UNUSED tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
-    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
-    size_t *nactive, size_t *ndirty, size_t *nmuzzy) {
-	*nthreads += arena_nthreads_get(arena, false);
-	*dss = dss_prec_names[arena_dss_prec_get(arena)];
-	*dirty_decay_ms = arena_dirty_decay_ms_get(arena);
-	*muzzy_decay_ms = arena_muzzy_decay_ms_get(arena);
-	*nactive += atomic_load_zu(&arena->nactive, ATOMIC_RELAXED);
-	*ndirty += extents_npages_get(&arena->extents_dirty);
-	*nmuzzy += extents_npages_get(&arena->extents_muzzy);
-}
-
-void
-arena_stats_merge(tsdn_t *tsdn, arena_t *arena, unsigned *nthreads,
-    const char **dss, ssize_t *dirty_decay_ms, ssize_t *muzzy_decay_ms,
-    size_t *nactive, size_t *ndirty, size_t *nmuzzy, arena_stats_t *astats,
-    bin_stats_t *bstats, arena_stats_large_t *lstats) {
-	cassert(config_stats);
-
-	arena_basic_stats_merge(tsdn, arena, nthreads, dss, dirty_decay_ms,
-	    muzzy_decay_ms, nactive, ndirty, nmuzzy);
-
-	size_t base_allocated, base_resident, base_mapped, metadata_thp;
-	base_stats_get(tsdn, arena->base, &base_allocated, &base_resident,
-	    &base_mapped, &metadata_thp);
-
-	arena_stats_lock(tsdn, &arena->stats);
-
-	arena_stats_accum_zu(&astats->mapped, base_mapped
-	    + arena_stats_read_zu(tsdn, &arena->stats, &arena->stats.mapped));
-	arena_stats_accum_zu(&astats->retained,
-	    extents_npages_get(&arena->extents_retained) << LG_PAGE);
-
-	arena_stats_accum_u64(&astats->decay_dirty.npurge,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_dirty.npurge));
-	arena_stats_accum_u64(&astats->decay_dirty.nmadvise,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_dirty.nmadvise));
-	arena_stats_accum_u64(&astats->decay_dirty.purged,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_dirty.purged));
-
-	arena_stats_accum_u64(&astats->decay_muzzy.npurge,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_muzzy.npurge));
-	arena_stats_accum_u64(&astats->decay_muzzy.nmadvise,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_muzzy.nmadvise));
-	arena_stats_accum_u64(&astats->decay_muzzy.purged,
-	    arena_stats_read_u64(tsdn, &arena->stats,
-	    &arena->stats.decay_muzzy.purged));
-
-	arena_stats_accum_zu(&astats->base, base_allocated);
-	arena_stats_accum_zu(&astats->internal, arena_internal_get(arena));
-	arena_stats_accum_zu(&astats->metadata_thp, metadata_thp);
-	arena_stats_accum_zu(&astats->resident, base_resident +
-	    (((atomic_load_zu(&arena->nactive, ATOMIC_RELAXED) +
-	    extents_npages_get(&arena->extents_dirty) +
-	    extents_npages_get(&arena->extents_muzzy)) << LG_PAGE)));
-
-	for (szind_t i = 0; i < NSIZES - NBINS; i++) {
-		uint64_t nmalloc = arena_stats_read_u64(tsdn, &arena->stats,
-		    &arena->stats.lstats[i].nmalloc);
-		arena_stats_accum_u64(&lstats[i].nmalloc, nmalloc);
-		arena_stats_accum_u64(&astats->nmalloc_large, nmalloc);
-
-		uint64_t ndalloc = arena_stats_read_u64(tsdn, &arena->stats,
-		    &arena->stats.lstats[i].ndalloc);
-		arena_stats_accum_u64(&lstats[i].ndalloc, ndalloc);
-		arena_stats_accum_u64(&astats->ndalloc_large, ndalloc);
-
-		uint64_t nrequests = arena_stats_read_u64(tsdn, &arena->stats,
-		    &arena->stats.lstats[i].nrequests);
-		arena_stats_accum_u64(&lstats[i].nrequests,
-		    nmalloc + nrequests);
-		arena_stats_accum_u64(&astats->nrequests_large,
-		    nmalloc + nrequests);
-
-		assert(nmalloc >= ndalloc);
-		assert(nmalloc - ndalloc <= SIZE_T_MAX);
-		size_t curlextents = (size_t)(nmalloc - ndalloc);
-		lstats[i].curlextents += curlextents;
-		arena_stats_accum_zu(&astats->allocated_large,
-		    curlextents * sz_index2size(NBINS + i));
-	}
-
-	arena_stats_unlock(tsdn, &arena->stats);
-
-	/* tcache_bytes counts currently cached bytes. */
-	atomic_store_zu(&astats->tcache_bytes, 0, ATOMIC_RELAXED);
-	malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
-	cache_bin_array_descriptor_t *descriptor;
-	ql_foreach(descriptor, &arena->cache_bin_array_descriptor_ql, link) {
-		szind_t i = 0;
-		for (; i < NBINS; i++) {
-			cache_bin_t *tbin = &descriptor->bins_small[i];
-			arena_stats_accum_zu(&astats->tcache_bytes,
-			    tbin->ncached * sz_index2size(i));
-		}
-		for (; i < nhbins; i++) {
-			cache_bin_t *tbin = &descriptor->bins_large[i];
-			arena_stats_accum_zu(&astats->tcache_bytes,
-			    tbin->ncached * sz_index2size(i));
-		}
-	}
-	malloc_mutex_prof_read(tsdn,
-	    &astats->mutex_prof_data[arena_prof_mutex_tcache_list],
-	    &arena->tcache_ql_mtx);
-	malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
-
-#define READ_ARENA_MUTEX_PROF_DATA(mtx, ind)				\
-    malloc_mutex_lock(tsdn, &arena->mtx);				\
-    malloc_mutex_prof_read(tsdn, &astats->mutex_prof_data[ind],		\
-        &arena->mtx);							\
-    malloc_mutex_unlock(tsdn, &arena->mtx);
-
-	/* Gather per arena mutex profiling data. */
-	READ_ARENA_MUTEX_PROF_DATA(large_mtx, arena_prof_mutex_large);
-	READ_ARENA_MUTEX_PROF_DATA(extent_avail_mtx,
-	    arena_prof_mutex_extent_avail)
-	READ_ARENA_MUTEX_PROF_DATA(extents_dirty.mtx,
-	    arena_prof_mutex_extents_dirty)
-	READ_ARENA_MUTEX_PROF_DATA(extents_muzzy.mtx,
-	    arena_prof_mutex_extents_muzzy)
-	READ_ARENA_MUTEX_PROF_DATA(extents_retained.mtx,
-	    arena_prof_mutex_extents_retained)
-	READ_ARENA_MUTEX_PROF_DATA(decay_dirty.mtx,
-	    arena_prof_mutex_decay_dirty)
-	READ_ARENA_MUTEX_PROF_DATA(decay_muzzy.mtx,
-	    arena_prof_mutex_decay_muzzy)
-	READ_ARENA_MUTEX_PROF_DATA(base->mtx,
-	    arena_prof_mutex_base)
-#undef READ_ARENA_MUTEX_PROF_DATA
-
-	nstime_copy(&astats->uptime, &arena->create_time);
-	nstime_update(&astats->uptime);
-	nstime_subtract(&astats->uptime, &arena->create_time);
-
-	for (szind_t i = 0; i < NBINS; i++) {
-		bin_stats_merge(tsdn, &bstats[i], &arena->bins[i]);
-	}
-}
-
-void
-arena_extents_dirty_dalloc(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extents_dalloc(tsdn, arena, r_extent_hooks, &arena->extents_dirty,
-	    extent);
-	if (arena_dirty_decay_ms_get(arena) == 0) {
-		arena_decay_dirty(tsdn, arena, false, true);
-	} else {
-		arena_background_thread_inactivity_check(tsdn, arena, false);
-	}
-}
-
-static void *
-arena_slab_reg_alloc(extent_t *slab, const bin_info_t *bin_info) {
-	void *ret;
-	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
-	size_t regind;
-
-	assert(extent_nfree_get(slab) > 0);
-	assert(!bitmap_full(slab_data->bitmap, &bin_info->bitmap_info));
-
-	regind = bitmap_sfu(slab_data->bitmap, &bin_info->bitmap_info);
-	ret = (void *)((uintptr_t)extent_addr_get(slab) +
-	    (uintptr_t)(bin_info->reg_size * regind));
-	extent_nfree_dec(slab);
-	return ret;
-}
-
-#ifndef JEMALLOC_JET
-static
-#endif
-size_t
-arena_slab_regind(extent_t *slab, szind_t binind, const void *ptr) {
-	size_t diff, regind;
-
-	/* Freeing a pointer outside the slab can cause assertion failure. */
-	assert((uintptr_t)ptr >= (uintptr_t)extent_addr_get(slab));
-	assert((uintptr_t)ptr < (uintptr_t)extent_past_get(slab));
-	/* Freeing an interior pointer can cause assertion failure. */
-	assert(((uintptr_t)ptr - (uintptr_t)extent_addr_get(slab)) %
-	    (uintptr_t)bin_infos[binind].reg_size == 0);
-
-	diff = (size_t)((uintptr_t)ptr - (uintptr_t)extent_addr_get(slab));
-
-	/* Avoid doing division with a variable divisor. */
-	regind = div_compute(&arena_binind_div_info[binind], diff);
-
-	assert(regind < bin_infos[binind].nregs);
-
-	return regind;
-}
-
-static void
-arena_slab_reg_dalloc(extent_t *slab, arena_slab_data_t *slab_data, void *ptr) {
-	szind_t binind = extent_szind_get(slab);
-	const bin_info_t *bin_info = &bin_infos[binind];
-	size_t regind = arena_slab_regind(slab, binind, ptr);
-
-	assert(extent_nfree_get(slab) < bin_info->nregs);
-	/* Freeing an unallocated pointer can cause assertion failure. */
-	assert(bitmap_get(slab_data->bitmap, &bin_info->bitmap_info, regind));
-
-	bitmap_unset(slab_data->bitmap, &bin_info->bitmap_info, regind);
-	extent_nfree_inc(slab);
-}
-
-static void
-arena_nactive_add(arena_t *arena, size_t add_pages) {
-	atomic_fetch_add_zu(&arena->nactive, add_pages, ATOMIC_RELAXED);
-}
-
-static void
-arena_nactive_sub(arena_t *arena, size_t sub_pages) {
-	assert(atomic_load_zu(&arena->nactive, ATOMIC_RELAXED) >= sub_pages);
-	atomic_fetch_sub_zu(&arena->nactive, sub_pages, ATOMIC_RELAXED);
-}
-
-static void
-arena_large_malloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t usize) {
-	szind_t index, hindex;
-
-	cassert(config_stats);
-
-	if (usize < LARGE_MINCLASS) {
-		usize = LARGE_MINCLASS;
-	}
-	index = sz_size2index(usize);
-	hindex = (index >= NBINS) ? index - NBINS : 0;
-
-	arena_stats_add_u64(tsdn, &arena->stats,
-	    &arena->stats.lstats[hindex].nmalloc, 1);
-}
-
-static void
-arena_large_dalloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t usize) {
-	szind_t index, hindex;
-
-	cassert(config_stats);
-
-	if (usize < LARGE_MINCLASS) {
-		usize = LARGE_MINCLASS;
-	}
-	index = sz_size2index(usize);
-	hindex = (index >= NBINS) ? index - NBINS : 0;
-
-	arena_stats_add_u64(tsdn, &arena->stats,
-	    &arena->stats.lstats[hindex].ndalloc, 1);
-}
-
-static void
-arena_large_ralloc_stats_update(tsdn_t *tsdn, arena_t *arena, size_t oldusize,
-    size_t usize) {
-	arena_large_dalloc_stats_update(tsdn, arena, oldusize);
-	arena_large_malloc_stats_update(tsdn, arena, usize);
-}
-
-extent_t *
-arena_extent_alloc_large(tsdn_t *tsdn, arena_t *arena, size_t usize,
-    size_t alignment, bool *zero) {
-	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
-
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	szind_t szind = sz_size2index(usize);
-	size_t mapped_add;
-	bool commit = true;
-	extent_t *extent = extents_alloc(tsdn, arena, &extent_hooks,
-	    &arena->extents_dirty, NULL, usize, sz_large_pad, alignment, false,
-	    szind, zero, &commit);
-	if (extent == NULL) {
-		extent = extents_alloc(tsdn, arena, &extent_hooks,
-		    &arena->extents_muzzy, NULL, usize, sz_large_pad, alignment,
-		    false, szind, zero, &commit);
-	}
-	size_t size = usize + sz_large_pad;
-	if (extent == NULL) {
-		extent = extent_alloc_wrapper(tsdn, arena, &extent_hooks, NULL,
-		    usize, sz_large_pad, alignment, false, szind, zero,
-		    &commit);
-		if (config_stats) {
-			/*
-			 * extent may be NULL on OOM, but in that case
-			 * mapped_add isn't used below, so there's no need to
-			 * conditionlly set it to 0 here.
-			 */
-			mapped_add = size;
-		}
-	} else if (config_stats) {
-		mapped_add = 0;
-	}
-
-	if (extent != NULL) {
-		if (config_stats) {
-			arena_stats_lock(tsdn, &arena->stats);
-			arena_large_malloc_stats_update(tsdn, arena, usize);
-			if (mapped_add != 0) {
-				arena_stats_add_zu(tsdn, &arena->stats,
-				    &arena->stats.mapped, mapped_add);
-			}
-			arena_stats_unlock(tsdn, &arena->stats);
-		}
-		arena_nactive_add(arena, size >> LG_PAGE);
-	}
-
-	return extent;
-}
-
-void
-arena_extent_dalloc_large_prep(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
-	if (config_stats) {
-		arena_stats_lock(tsdn, &arena->stats);
-		arena_large_dalloc_stats_update(tsdn, arena,
-		    extent_usize_get(extent));
-		arena_stats_unlock(tsdn, &arena->stats);
-	}
-	arena_nactive_sub(arena, extent_size_get(extent) >> LG_PAGE);
-}
-
-void
-arena_extent_ralloc_large_shrink(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
-    size_t oldusize) {
-	size_t usize = extent_usize_get(extent);
-	size_t udiff = oldusize - usize;
-
-	if (config_stats) {
-		arena_stats_lock(tsdn, &arena->stats);
-		arena_large_ralloc_stats_update(tsdn, arena, oldusize, usize);
-		arena_stats_unlock(tsdn, &arena->stats);
-	}
-	arena_nactive_sub(arena, udiff >> LG_PAGE);
-}
-
-void
-arena_extent_ralloc_large_expand(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
-    size_t oldusize) {
-	size_t usize = extent_usize_get(extent);
-	size_t udiff = usize - oldusize;
-
-	if (config_stats) {
-		arena_stats_lock(tsdn, &arena->stats);
-		arena_large_ralloc_stats_update(tsdn, arena, oldusize, usize);
-		arena_stats_unlock(tsdn, &arena->stats);
-	}
-	arena_nactive_add(arena, udiff >> LG_PAGE);
-}
-
-static ssize_t
-arena_decay_ms_read(arena_decay_t *decay) {
-	return atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
-}
-
-static void
-arena_decay_ms_write(arena_decay_t *decay, ssize_t decay_ms) {
-	atomic_store_zd(&decay->time_ms, decay_ms, ATOMIC_RELAXED);
-}
-
-static void
-arena_decay_deadline_init(arena_decay_t *decay) {
-	/*
-	 * Generate a new deadline that is uniformly random within the next
-	 * epoch after the current one.
-	 */
-	nstime_copy(&decay->deadline, &decay->epoch);
-	nstime_add(&decay->deadline, &decay->interval);
-	if (arena_decay_ms_read(decay) > 0) {
-		nstime_t jitter;
-
-		nstime_init(&jitter, prng_range_u64(&decay->jitter_state,
-		    nstime_ns(&decay->interval)));
-		nstime_add(&decay->deadline, &jitter);
-	}
-}
-
-static bool
-arena_decay_deadline_reached(const arena_decay_t *decay, const nstime_t *time) {
-	return (nstime_compare(&decay->deadline, time) <= 0);
-}
-
-static size_t
-arena_decay_backlog_npages_limit(const arena_decay_t *decay) {
-	uint64_t sum;
-	size_t npages_limit_backlog;
-	unsigned i;
-
-	/*
-	 * For each element of decay_backlog, multiply by the corresponding
-	 * fixed-point smoothstep decay factor.  Sum the products, then divide
-	 * to round down to the nearest whole number of pages.
-	 */
-	sum = 0;
-	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
-		sum += decay->backlog[i] * h_steps[i];
-	}
-	npages_limit_backlog = (size_t)(sum >> SMOOTHSTEP_BFP);
-
-	return npages_limit_backlog;
-}
-
-static void
-arena_decay_backlog_update_last(arena_decay_t *decay, size_t current_npages) {
-	size_t npages_delta = (current_npages > decay->nunpurged) ?
-	    current_npages - decay->nunpurged : 0;
-	decay->backlog[SMOOTHSTEP_NSTEPS-1] = npages_delta;
-
-	if (config_debug) {
-		if (current_npages > decay->ceil_npages) {
-			decay->ceil_npages = current_npages;
-		}
-		size_t npages_limit = arena_decay_backlog_npages_limit(decay);
-		assert(decay->ceil_npages >= npages_limit);
-		if (decay->ceil_npages > npages_limit) {
-			decay->ceil_npages = npages_limit;
-		}
-	}
-}
-
-static void
-arena_decay_backlog_update(arena_decay_t *decay, uint64_t nadvance_u64,
-    size_t current_npages) {
-	if (nadvance_u64 >= SMOOTHSTEP_NSTEPS) {
-		memset(decay->backlog, 0, (SMOOTHSTEP_NSTEPS-1) *
-		    sizeof(size_t));
-	} else {
-		size_t nadvance_z = (size_t)nadvance_u64;
-
-		assert((uint64_t)nadvance_z == nadvance_u64);
-
-		memmove(decay->backlog, &decay->backlog[nadvance_z],
-		    (SMOOTHSTEP_NSTEPS - nadvance_z) * sizeof(size_t));
-		if (nadvance_z > 1) {
-			memset(&decay->backlog[SMOOTHSTEP_NSTEPS -
-			    nadvance_z], 0, (nadvance_z-1) * sizeof(size_t));
-		}
-	}
-
-	arena_decay_backlog_update_last(decay, current_npages);
-}
-
-static void
-arena_decay_try_purge(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, size_t current_npages, size_t npages_limit,
-    bool is_background_thread) {
-	if (current_npages > npages_limit) {
-		arena_decay_to_limit(tsdn, arena, decay, extents, false,
-		    npages_limit, current_npages - npages_limit,
-		    is_background_thread);
-	}
-}
-
-static void
-arena_decay_epoch_advance_helper(arena_decay_t *decay, const nstime_t *time,
-    size_t current_npages) {
-	assert(arena_decay_deadline_reached(decay, time));
-
-	nstime_t delta;
-	nstime_copy(&delta, time);
-	nstime_subtract(&delta, &decay->epoch);
-
-	uint64_t nadvance_u64 = nstime_divide(&delta, &decay->interval);
-	assert(nadvance_u64 > 0);
-
-	/* Add nadvance_u64 decay intervals to epoch. */
-	nstime_copy(&delta, &decay->interval);
-	nstime_imultiply(&delta, nadvance_u64);
-	nstime_add(&decay->epoch, &delta);
-
-	/* Set a new deadline. */
-	arena_decay_deadline_init(decay);
-
-	/* Update the backlog. */
-	arena_decay_backlog_update(decay, nadvance_u64, current_npages);
-}
-
-static void
-arena_decay_epoch_advance(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, const nstime_t *time, bool is_background_thread) {
-	size_t current_npages = extents_npages_get(extents);
-	arena_decay_epoch_advance_helper(decay, time, current_npages);
-
-	size_t npages_limit = arena_decay_backlog_npages_limit(decay);
-	/* We may unlock decay->mtx when try_purge(). Finish logging first. */
-	decay->nunpurged = (npages_limit > current_npages) ? npages_limit :
-	    current_npages;
-
-	if (!background_thread_enabled() || is_background_thread) {
-		arena_decay_try_purge(tsdn, arena, decay, extents,
-		    current_npages, npages_limit, is_background_thread);
-	}
-}
-
-static void
-arena_decay_reinit(arena_decay_t *decay, ssize_t decay_ms) {
-	arena_decay_ms_write(decay, decay_ms);
-	if (decay_ms > 0) {
-		nstime_init(&decay->interval, (uint64_t)decay_ms *
-		    KQU(1000000));
-		nstime_idivide(&decay->interval, SMOOTHSTEP_NSTEPS);
-	}
-
-	nstime_init(&decay->epoch, 0);
-	nstime_update(&decay->epoch);
-	decay->jitter_state = (uint64_t)(uintptr_t)decay;
-	arena_decay_deadline_init(decay);
-	decay->nunpurged = 0;
-	memset(decay->backlog, 0, SMOOTHSTEP_NSTEPS * sizeof(size_t));
-}
-
-static bool
-arena_decay_init(arena_decay_t *decay, ssize_t decay_ms,
-    arena_stats_decay_t *stats) {
-	if (config_debug) {
-		for (size_t i = 0; i < sizeof(arena_decay_t); i++) {
-			assert(((char *)decay)[i] == 0);
-		}
-		decay->ceil_npages = 0;
-	}
-	if (malloc_mutex_init(&decay->mtx, "decay", WITNESS_RANK_DECAY,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-	decay->purging = false;
-	arena_decay_reinit(decay, decay_ms);
-	/* Memory is zeroed, so there is no need to clear stats. */
-	if (config_stats) {
-		decay->stats = stats;
-	}
-	return false;
-}
-
-static bool
-arena_decay_ms_valid(ssize_t decay_ms) {
-	if (decay_ms < -1) {
-		return false;
-	}
-	if (decay_ms == -1 || (uint64_t)decay_ms <= NSTIME_SEC_MAX *
-	    KQU(1000)) {
-		return true;
-	}
-	return false;
-}
-
-static bool
-arena_maybe_decay(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, bool is_background_thread) {
-	malloc_mutex_assert_owner(tsdn, &decay->mtx);
-
-	/* Purge all or nothing if the option is disabled. */
-	ssize_t decay_ms = arena_decay_ms_read(decay);
-	if (decay_ms <= 0) {
-		if (decay_ms == 0) {
-			arena_decay_to_limit(tsdn, arena, decay, extents, false,
-			    0, extents_npages_get(extents),
-			    is_background_thread);
-		}
-		return false;
-	}
-
-	nstime_t time;
-	nstime_init(&time, 0);
-	nstime_update(&time);
-	if (unlikely(!nstime_monotonic() && nstime_compare(&decay->epoch, &time)
-	    > 0)) {
-		/*
-		 * Time went backwards.  Move the epoch back in time and
-		 * generate a new deadline, with the expectation that time
-		 * typically flows forward for long enough periods of time that
-		 * epochs complete.  Unfortunately, this strategy is susceptible
-		 * to clock jitter triggering premature epoch advances, but
-		 * clock jitter estimation and compensation isn't feasible here
-		 * because calls into this code are event-driven.
-		 */
-		nstime_copy(&decay->epoch, &time);
-		arena_decay_deadline_init(decay);
-	} else {
-		/* Verify that time does not go backwards. */
-		assert(nstime_compare(&decay->epoch, &time) <= 0);
-	}
-
-	/*
-	 * If the deadline has been reached, advance to the current epoch and
-	 * purge to the new limit if necessary.  Note that dirty pages created
-	 * during the current epoch are not subject to purge until a future
-	 * epoch, so as a result purging only happens during epoch advances, or
-	 * being triggered by background threads (scheduled event).
-	 */
-	bool advance_epoch = arena_decay_deadline_reached(decay, &time);
-	if (advance_epoch) {
-		arena_decay_epoch_advance(tsdn, arena, decay, extents, &time,
-		    is_background_thread);
-	} else if (is_background_thread) {
-		arena_decay_try_purge(tsdn, arena, decay, extents,
-		    extents_npages_get(extents),
-		    arena_decay_backlog_npages_limit(decay),
-		    is_background_thread);
-	}
-
-	return advance_epoch;
-}
-
-static ssize_t
-arena_decay_ms_get(arena_decay_t *decay) {
-	return arena_decay_ms_read(decay);
-}
-
-ssize_t
-arena_dirty_decay_ms_get(arena_t *arena) {
-	return arena_decay_ms_get(&arena->decay_dirty);
-}
-
-ssize_t
-arena_muzzy_decay_ms_get(arena_t *arena) {
-	return arena_decay_ms_get(&arena->decay_muzzy);
-}
-
-static bool
-arena_decay_ms_set(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, ssize_t decay_ms) {
-	if (!arena_decay_ms_valid(decay_ms)) {
-		return true;
-	}
-
-	malloc_mutex_lock(tsdn, &decay->mtx);
-	/*
-	 * Restart decay backlog from scratch, which may cause many dirty pages
-	 * to be immediately purged.  It would conceptually be possible to map
-	 * the old backlog onto the new backlog, but there is no justification
-	 * for such complexity since decay_ms changes are intended to be
-	 * infrequent, either between the {-1, 0, >0} states, or a one-time
-	 * arbitrary change during initial arena configuration.
-	 */
-	arena_decay_reinit(decay, decay_ms);
-	arena_maybe_decay(tsdn, arena, decay, extents, false);
-	malloc_mutex_unlock(tsdn, &decay->mtx);
-
-	return false;
-}
-
-bool
-arena_dirty_decay_ms_set(tsdn_t *tsdn, arena_t *arena,
-    ssize_t decay_ms) {
-	return arena_decay_ms_set(tsdn, arena, &arena->decay_dirty,
-	    &arena->extents_dirty, decay_ms);
-}
-
-bool
-arena_muzzy_decay_ms_set(tsdn_t *tsdn, arena_t *arena,
-    ssize_t decay_ms) {
-	return arena_decay_ms_set(tsdn, arena, &arena->decay_muzzy,
-	    &arena->extents_muzzy, decay_ms);
-}
-
-static size_t
-arena_stash_decayed(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, size_t npages_limit,
-	size_t npages_decay_max, extent_list_t *decay_extents) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	/* Stash extents according to npages_limit. */
-	size_t nstashed = 0;
-	extent_t *extent;
-	while (nstashed < npages_decay_max &&
-	    (extent = extents_evict(tsdn, arena, r_extent_hooks, extents,
-	    npages_limit)) != NULL) {
-		extent_list_append(decay_extents, extent);
-		nstashed += extent_size_get(extent) >> LG_PAGE;
-	}
-	return nstashed;
-}
-
-static size_t
-arena_decay_stashed(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, arena_decay_t *decay, extents_t *extents,
-    bool all, extent_list_t *decay_extents, bool is_background_thread) {
-	UNUSED size_t nmadvise, nunmapped;
-	size_t npurged;
-
-	if (config_stats) {
-		nmadvise = 0;
-		nunmapped = 0;
-	}
-	npurged = 0;
-
-	ssize_t muzzy_decay_ms = arena_muzzy_decay_ms_get(arena);
-	for (extent_t *extent = extent_list_first(decay_extents); extent !=
-	    NULL; extent = extent_list_first(decay_extents)) {
-		if (config_stats) {
-			nmadvise++;
-		}
-		size_t npages = extent_size_get(extent) >> LG_PAGE;
-		npurged += npages;
-		extent_list_remove(decay_extents, extent);
-		switch (extents_state_get(extents)) {
-		case extent_state_active:
-			not_reached();
-		case extent_state_dirty:
-			if (!all && muzzy_decay_ms != 0 &&
-			    !extent_purge_lazy_wrapper(tsdn, arena,
-			    r_extent_hooks, extent, 0,
-			    extent_size_get(extent))) {
-				extents_dalloc(tsdn, arena, r_extent_hooks,
-				    &arena->extents_muzzy, extent);
-				arena_background_thread_inactivity_check(tsdn,
-				    arena, is_background_thread);
-				break;
-			}
-			/* Fall through. */
-		case extent_state_muzzy:
-			extent_dalloc_wrapper(tsdn, arena, r_extent_hooks,
-			    extent);
-			if (config_stats) {
-				nunmapped += npages;
-			}
-			break;
-		case extent_state_retained:
-		default:
-			not_reached();
-		}
-	}
-
-	if (config_stats) {
-		arena_stats_lock(tsdn, &arena->stats);
-		arena_stats_add_u64(tsdn, &arena->stats, &decay->stats->npurge,
-		    1);
-		arena_stats_add_u64(tsdn, &arena->stats,
-		    &decay->stats->nmadvise, nmadvise);
-		arena_stats_add_u64(tsdn, &arena->stats, &decay->stats->purged,
-		    npurged);
-		arena_stats_sub_zu(tsdn, &arena->stats, &arena->stats.mapped,
-		    nunmapped << LG_PAGE);
-		arena_stats_unlock(tsdn, &arena->stats);
-	}
-
-	return npurged;
-}
-
-/*
- * npages_limit: Decay at most npages_decay_max pages without violating the
- * invariant: (extents_npages_get(extents) >= npages_limit).  We need an upper
- * bound on number of pages in order to prevent unbounded growth (namely in
- * stashed), otherwise unbounded new pages could be added to extents during the
- * current decay run, so that the purging thread never finishes.
- */
-static void
-arena_decay_to_limit(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, bool all, size_t npages_limit, size_t npages_decay_max,
-    bool is_background_thread) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 1);
-	malloc_mutex_assert_owner(tsdn, &decay->mtx);
-
-	if (decay->purging) {
-		return;
-	}
-	decay->purging = true;
-	malloc_mutex_unlock(tsdn, &decay->mtx);
-
-	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
-
-	extent_list_t decay_extents;
-	extent_list_init(&decay_extents);
-
-	size_t npurge = arena_stash_decayed(tsdn, arena, &extent_hooks, extents,
-	    npages_limit, npages_decay_max, &decay_extents);
-	if (npurge != 0) {
-		UNUSED size_t npurged = arena_decay_stashed(tsdn, arena,
-		    &extent_hooks, decay, extents, all, &decay_extents,
-		    is_background_thread);
-		assert(npurged == npurge);
-	}
-
-	malloc_mutex_lock(tsdn, &decay->mtx);
-	decay->purging = false;
-}
-
-static bool
-arena_decay_impl(tsdn_t *tsdn, arena_t *arena, arena_decay_t *decay,
-    extents_t *extents, bool is_background_thread, bool all) {
-	if (all) {
-		malloc_mutex_lock(tsdn, &decay->mtx);
-		arena_decay_to_limit(tsdn, arena, decay, extents, all, 0,
-		    extents_npages_get(extents), is_background_thread);
-		malloc_mutex_unlock(tsdn, &decay->mtx);
-
-		return false;
-	}
-
-	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
-		/* No need to wait if another thread is in progress. */
-		return true;
-	}
-
-	bool epoch_advanced = arena_maybe_decay(tsdn, arena, decay, extents,
-	    is_background_thread);
-	UNUSED size_t npages_new;
-	if (epoch_advanced) {
-		/* Backlog is updated on epoch advance. */
-		npages_new = decay->backlog[SMOOTHSTEP_NSTEPS-1];
-	}
-	malloc_mutex_unlock(tsdn, &decay->mtx);
-
-	if (have_background_thread && background_thread_enabled() &&
-	    epoch_advanced && !is_background_thread) {
-		background_thread_interval_check(tsdn, arena, decay,
-		    npages_new);
-	}
-
-	return false;
-}
-
-static bool
-arena_decay_dirty(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
-    bool all) {
-	return arena_decay_impl(tsdn, arena, &arena->decay_dirty,
-	    &arena->extents_dirty, is_background_thread, all);
-}
-
-static bool
-arena_decay_muzzy(tsdn_t *tsdn, arena_t *arena, bool is_background_thread,
-    bool all) {
-	return arena_decay_impl(tsdn, arena, &arena->decay_muzzy,
-	    &arena->extents_muzzy, is_background_thread, all);
-}
-
-void
-arena_decay(tsdn_t *tsdn, arena_t *arena, bool is_background_thread, bool all) {
-	if (arena_decay_dirty(tsdn, arena, is_background_thread, all)) {
-		return;
-	}
-	arena_decay_muzzy(tsdn, arena, is_background_thread, all);
-}
-
-static void
-arena_slab_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *slab) {
-	arena_nactive_sub(arena, extent_size_get(slab) >> LG_PAGE);
-
-	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
-	arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, slab);
-}
-
-static void
-arena_bin_slabs_nonfull_insert(bin_t *bin, extent_t *slab) {
-	assert(extent_nfree_get(slab) > 0);
-	extent_heap_insert(&bin->slabs_nonfull, slab);
-}
-
-static void
-arena_bin_slabs_nonfull_remove(bin_t *bin, extent_t *slab) {
-	extent_heap_remove(&bin->slabs_nonfull, slab);
-}
-
-static extent_t *
-arena_bin_slabs_nonfull_tryget(bin_t *bin) {
-	extent_t *slab = extent_heap_remove_first(&bin->slabs_nonfull);
-	if (slab == NULL) {
-		return NULL;
-	}
-	if (config_stats) {
-		bin->stats.reslabs++;
-	}
-	return slab;
-}
-
-static void
-arena_bin_slabs_full_insert(arena_t *arena, bin_t *bin, extent_t *slab) {
-	assert(extent_nfree_get(slab) == 0);
-	/*
-	 *  Tracking extents is required by arena_reset, which is not allowed
-	 *  for auto arenas.  Bypass this step to avoid touching the extent
-	 *  linkage (often results in cache misses) for auto arenas.
-	 */
-	if (arena_is_auto(arena)) {
-		return;
-	}
-	extent_list_append(&bin->slabs_full, slab);
-}
-
-static void
-arena_bin_slabs_full_remove(arena_t *arena, bin_t *bin, extent_t *slab) {
-	if (arena_is_auto(arena)) {
-		return;
-	}
-	extent_list_remove(&bin->slabs_full, slab);
-}
-
-void
-arena_reset(tsd_t *tsd, arena_t *arena) {
-	/*
-	 * Locking in this function is unintuitive.  The caller guarantees that
-	 * no concurrent operations are happening in this arena, but there are
-	 * still reasons that some locking is necessary:
-	 *
-	 * - Some of the functions in the transitive closure of calls assume
-	 *   appropriate locks are held, and in some cases these locks are
-	 *   temporarily dropped to avoid lock order reversal or deadlock due to
-	 *   reentry.
-	 * - mallctl("epoch", ...) may concurrently refresh stats.  While
-	 *   strictly speaking this is a "concurrent operation", disallowing
-	 *   stats refreshes would impose an inconvenient burden.
-	 */
-
-	/* Large allocations. */
-	malloc_mutex_lock(tsd_tsdn(tsd), &arena->large_mtx);
-
-	for (extent_t *extent = extent_list_first(&arena->large); extent !=
-	    NULL; extent = extent_list_first(&arena->large)) {
-		void *ptr = extent_base_get(extent);
-		size_t usize;
-
-		malloc_mutex_unlock(tsd_tsdn(tsd), &arena->large_mtx);
-		alloc_ctx_t alloc_ctx;
-		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-		assert(alloc_ctx.szind != NSIZES);
-
-		if (config_stats || (config_prof && opt_prof)) {
-			usize = sz_index2size(alloc_ctx.szind);
-			assert(usize == isalloc(tsd_tsdn(tsd), ptr));
-		}
-		/* Remove large allocation from prof sample set. */
-		if (config_prof && opt_prof) {
-			prof_free(tsd, ptr, usize, &alloc_ctx);
-		}
-		large_dalloc(tsd_tsdn(tsd), extent);
-		malloc_mutex_lock(tsd_tsdn(tsd), &arena->large_mtx);
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), &arena->large_mtx);
-
-	/* Bins. */
-	for (unsigned i = 0; i < NBINS; i++) {
-		extent_t *slab;
-		bin_t *bin = &arena->bins[i];
-		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		if (bin->slabcur != NULL) {
-			slab = bin->slabcur;
-			bin->slabcur = NULL;
-			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
-			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		}
-		while ((slab = extent_heap_remove_first(&bin->slabs_nonfull)) !=
-		    NULL) {
-			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
-			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		}
-		for (slab = extent_list_first(&bin->slabs_full); slab != NULL;
-		    slab = extent_list_first(&bin->slabs_full)) {
-			arena_bin_slabs_full_remove(arena, bin, slab);
-			malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-			arena_slab_dalloc(tsd_tsdn(tsd), arena, slab);
-			malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		}
-		if (config_stats) {
-			bin->stats.curregs = 0;
-			bin->stats.curslabs = 0;
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-	}
-
-	atomic_store_zu(&arena->nactive, 0, ATOMIC_RELAXED);
-}
-
-static void
-arena_destroy_retained(tsdn_t *tsdn, arena_t *arena) {
-	/*
-	 * Iterate over the retained extents and destroy them.  This gives the
-	 * extent allocator underlying the extent hooks an opportunity to unmap
-	 * all retained memory without having to keep its own metadata
-	 * structures.  In practice, virtual memory for dss-allocated extents is
-	 * leaked here, so best practice is to avoid dss for arenas to be
-	 * destroyed, or provide custom extent hooks that track retained
-	 * dss-based extents for later reuse.
-	 */
-	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
-	extent_t *extent;
-	while ((extent = extents_evict(tsdn, arena, &extent_hooks,
-	    &arena->extents_retained, 0)) != NULL) {
-		extent_destroy_wrapper(tsdn, arena, &extent_hooks, extent);
-	}
-}
-
-void
-arena_destroy(tsd_t *tsd, arena_t *arena) {
-	assert(base_ind_get(arena->base) >= narenas_auto);
-	assert(arena_nthreads_get(arena, false) == 0);
-	assert(arena_nthreads_get(arena, true) == 0);
-
-	/*
-	 * No allocations have occurred since arena_reset() was called.
-	 * Furthermore, the caller (arena_i_destroy_ctl()) purged all cached
-	 * extents, so only retained extents may remain.
-	 */
-	assert(extents_npages_get(&arena->extents_dirty) == 0);
-	assert(extents_npages_get(&arena->extents_muzzy) == 0);
-
-	/* Deallocate retained memory. */
-	arena_destroy_retained(tsd_tsdn(tsd), arena);
-
-	/*
-	 * Remove the arena pointer from the arenas array.  We rely on the fact
-	 * that there is no way for the application to get a dirty read from the
-	 * arenas array unless there is an inherent race in the application
-	 * involving access of an arena being concurrently destroyed.  The
-	 * application must synchronize knowledge of the arena's validity, so as
-	 * long as we use an atomic write to update the arenas array, the
-	 * application will get a clean read any time after it synchronizes
-	 * knowledge that the arena is no longer valid.
-	 */
-	arena_set(base_ind_get(arena->base), NULL);
-
-	/*
-	 * Destroy the base allocator, which manages all metadata ever mapped by
-	 * this arena.
-	 */
-	base_delete(tsd_tsdn(tsd), arena->base);
-}
-
-static extent_t *
-arena_slab_alloc_hard(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, const bin_info_t *bin_info,
-    szind_t szind) {
-	extent_t *slab;
-	bool zero, commit;
-
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	zero = false;
-	commit = true;
-	slab = extent_alloc_wrapper(tsdn, arena, r_extent_hooks, NULL,
-	    bin_info->slab_size, 0, PAGE, true, szind, &zero, &commit);
-
-	if (config_stats && slab != NULL) {
-		arena_stats_mapped_add(tsdn, &arena->stats,
-		    bin_info->slab_size);
-	}
-
-	return slab;
-}
-
-static extent_t *
-arena_slab_alloc(tsdn_t *tsdn, arena_t *arena, szind_t binind,
-    const bin_info_t *bin_info) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
-	szind_t szind = sz_size2index(bin_info->reg_size);
-	bool zero = false;
-	bool commit = true;
-	extent_t *slab = extents_alloc(tsdn, arena, &extent_hooks,
-	    &arena->extents_dirty, NULL, bin_info->slab_size, 0, PAGE, true,
-	    binind, &zero, &commit);
-	if (slab == NULL) {
-		slab = extents_alloc(tsdn, arena, &extent_hooks,
-		    &arena->extents_muzzy, NULL, bin_info->slab_size, 0, PAGE,
-		    true, binind, &zero, &commit);
-	}
-	if (slab == NULL) {
-		slab = arena_slab_alloc_hard(tsdn, arena, &extent_hooks,
-		    bin_info, szind);
-		if (slab == NULL) {
-			return NULL;
-		}
-	}
-	assert(extent_slab_get(slab));
-
-	/* Initialize slab internals. */
-	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
-	extent_nfree_set(slab, bin_info->nregs);
-	bitmap_init(slab_data->bitmap, &bin_info->bitmap_info, false);
-
-	arena_nactive_add(arena, extent_size_get(slab) >> LG_PAGE);
-
-	return slab;
-}
-
-static extent_t *
-arena_bin_nonfull_slab_get(tsdn_t *tsdn, arena_t *arena, bin_t *bin,
-    szind_t binind) {
-	extent_t *slab;
-	const bin_info_t *bin_info;
-
-	/* Look for a usable slab. */
-	slab = arena_bin_slabs_nonfull_tryget(bin);
-	if (slab != NULL) {
-		return slab;
-	}
-	/* No existing slabs have any space available. */
-
-	bin_info = &bin_infos[binind];
-
-	/* Allocate a new slab. */
-	malloc_mutex_unlock(tsdn, &bin->lock);
-	/******************************/
-	slab = arena_slab_alloc(tsdn, arena, binind, bin_info);
-	/********************************/
-	malloc_mutex_lock(tsdn, &bin->lock);
-	if (slab != NULL) {
-		if (config_stats) {
-			bin->stats.nslabs++;
-			bin->stats.curslabs++;
-		}
-		return slab;
-	}
-
-	/*
-	 * arena_slab_alloc() failed, but another thread may have made
-	 * sufficient memory available while this one dropped bin->lock above,
-	 * so search one more time.
-	 */
-	slab = arena_bin_slabs_nonfull_tryget(bin);
-	if (slab != NULL) {
-		return slab;
-	}
-
-	return NULL;
-}
-
-/* Re-fill bin->slabcur, then call arena_slab_reg_alloc(). */
-static void *
-arena_bin_malloc_hard(tsdn_t *tsdn, arena_t *arena, bin_t *bin,
-    szind_t binind) {
-	const bin_info_t *bin_info;
-	extent_t *slab;
-
-	bin_info = &bin_infos[binind];
-	if (!arena_is_auto(arena) && bin->slabcur != NULL) {
-		arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
-		bin->slabcur = NULL;
-	}
-	slab = arena_bin_nonfull_slab_get(tsdn, arena, bin, binind);
-	if (bin->slabcur != NULL) {
-		/*
-		 * Another thread updated slabcur while this one ran without the
-		 * bin lock in arena_bin_nonfull_slab_get().
-		 */
-		if (extent_nfree_get(bin->slabcur) > 0) {
-			void *ret = arena_slab_reg_alloc(bin->slabcur,
-			    bin_info);
-			if (slab != NULL) {
-				/*
-				 * arena_slab_alloc() may have allocated slab,
-				 * or it may have been pulled from
-				 * slabs_nonfull.  Therefore it is unsafe to
-				 * make any assumptions about how slab has
-				 * previously been used, and
-				 * arena_bin_lower_slab() must be called, as if
-				 * a region were just deallocated from the slab.
-				 */
-				if (extent_nfree_get(slab) == bin_info->nregs) {
-					arena_dalloc_bin_slab(tsdn, arena, slab,
-					    bin);
-				} else {
-					arena_bin_lower_slab(tsdn, arena, slab,
-					    bin);
-				}
-			}
-			return ret;
-		}
-
-		arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
-		bin->slabcur = NULL;
-	}
-
-	if (slab == NULL) {
-		return NULL;
-	}
-	bin->slabcur = slab;
-
-	assert(extent_nfree_get(bin->slabcur) > 0);
-
-	return arena_slab_reg_alloc(slab, bin_info);
-}
-
-void
-arena_tcache_fill_small(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
-    cache_bin_t *tbin, szind_t binind, uint64_t prof_accumbytes) {
-	unsigned i, nfill;
-	bin_t *bin;
-
-	assert(tbin->ncached == 0);
-
-	if (config_prof && arena_prof_accum(tsdn, arena, prof_accumbytes)) {
-		prof_idump(tsdn);
-	}
-	bin = &arena->bins[binind];
-	malloc_mutex_lock(tsdn, &bin->lock);
-	for (i = 0, nfill = (tcache_bin_info[binind].ncached_max >>
-	    tcache->lg_fill_div[binind]); i < nfill; i++) {
-		extent_t *slab;
-		void *ptr;
-		if ((slab = bin->slabcur) != NULL && extent_nfree_get(slab) >
-		    0) {
-			ptr = arena_slab_reg_alloc(slab, &bin_infos[binind]);
-		} else {
-			ptr = arena_bin_malloc_hard(tsdn, arena, bin, binind);
-		}
-		if (ptr == NULL) {
-			/*
-			 * OOM.  tbin->avail isn't yet filled down to its first
-			 * element, so the successful allocations (if any) must
-			 * be moved just before tbin->avail before bailing out.
-			 */
-			if (i > 0) {
-				memmove(tbin->avail - i, tbin->avail - nfill,
-				    i * sizeof(void *));
-			}
-			break;
-		}
-		if (config_fill && unlikely(opt_junk_alloc)) {
-			arena_alloc_junk_small(ptr, &bin_infos[binind], true);
-		}
-		/* Insert such that low regions get used first. */
-		*(tbin->avail - nfill + i) = ptr;
-	}
-	if (config_stats) {
-		bin->stats.nmalloc += i;
-		bin->stats.nrequests += tbin->tstats.nrequests;
-		bin->stats.curregs += i;
-		bin->stats.nfills++;
-		tbin->tstats.nrequests = 0;
-	}
-	malloc_mutex_unlock(tsdn, &bin->lock);
-	tbin->ncached = i;
-	arena_decay_tick(tsdn, arena);
-}
-
-void
-arena_alloc_junk_small(void *ptr, const bin_info_t *bin_info, bool zero) {
-	if (!zero) {
-		memset(ptr, JEMALLOC_ALLOC_JUNK, bin_info->reg_size);
-	}
-}
-
-static void
-arena_dalloc_junk_small_impl(void *ptr, const bin_info_t *bin_info) {
-	memset(ptr, JEMALLOC_FREE_JUNK, bin_info->reg_size);
-}
-arena_dalloc_junk_small_t *JET_MUTABLE arena_dalloc_junk_small =
-    arena_dalloc_junk_small_impl;
-
-static void *
-arena_malloc_small(tsdn_t *tsdn, arena_t *arena, szind_t binind, bool zero) {
-	void *ret;
-	bin_t *bin;
-	size_t usize;
-	extent_t *slab;
-
-	assert(binind < NBINS);
-	bin = &arena->bins[binind];
-	usize = sz_index2size(binind);
-
-	malloc_mutex_lock(tsdn, &bin->lock);
-	if ((slab = bin->slabcur) != NULL && extent_nfree_get(slab) > 0) {
-		ret = arena_slab_reg_alloc(slab, &bin_infos[binind]);
-	} else {
-		ret = arena_bin_malloc_hard(tsdn, arena, bin, binind);
-	}
-
-	if (ret == NULL) {
-		malloc_mutex_unlock(tsdn, &bin->lock);
-		return NULL;
-	}
-
-	if (config_stats) {
-		bin->stats.nmalloc++;
-		bin->stats.nrequests++;
-		bin->stats.curregs++;
-	}
-	malloc_mutex_unlock(tsdn, &bin->lock);
-	if (config_prof && arena_prof_accum(tsdn, arena, usize)) {
-		prof_idump(tsdn);
-	}
-
-	if (!zero) {
-		if (config_fill) {
-			if (unlikely(opt_junk_alloc)) {
-				arena_alloc_junk_small(ret,
-				    &bin_infos[binind], false);
-			} else if (unlikely(opt_zero)) {
-				memset(ret, 0, usize);
-			}
-		}
-	} else {
-		if (config_fill && unlikely(opt_junk_alloc)) {
-			arena_alloc_junk_small(ret, &bin_infos[binind],
-			    true);
-		}
-		memset(ret, 0, usize);
-	}
-
-	arena_decay_tick(tsdn, arena);
-	return ret;
-}
-
-void *
-arena_malloc_hard(tsdn_t *tsdn, arena_t *arena, size_t size, szind_t ind,
-    bool zero) {
-	assert(!tsdn_null(tsdn) || arena != NULL);
-
-	if (likely(!tsdn_null(tsdn))) {
-		arena = arena_choose(tsdn_tsd(tsdn), arena);
-	}
-	if (unlikely(arena == NULL)) {
-		return NULL;
-	}
-
-	if (likely(size <= SMALL_MAXCLASS)) {
-		return arena_malloc_small(tsdn, arena, ind, zero);
-	}
-	return large_malloc(tsdn, arena, sz_index2size(ind), zero);
-}
-
-void *
-arena_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
-    bool zero, tcache_t *tcache) {
-	void *ret;
-
-	if (usize <= SMALL_MAXCLASS && (alignment < PAGE || (alignment == PAGE
-	    && (usize & PAGE_MASK) == 0))) {
-		/* Small; alignment doesn't require special slab placement. */
-		ret = arena_malloc(tsdn, arena, usize, sz_size2index(usize),
-		    zero, tcache, true);
-	} else {
-		if (likely(alignment <= CACHELINE)) {
-			ret = large_malloc(tsdn, arena, usize, zero);
-		} else {
-			ret = large_palloc(tsdn, arena, usize, alignment, zero);
-		}
-	}
-	return ret;
-}
-
-void
-arena_prof_promote(tsdn_t *tsdn, const void *ptr, size_t usize) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-	assert(isalloc(tsdn, ptr) == LARGE_MINCLASS);
-	assert(usize <= SMALL_MAXCLASS);
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	extent_t *extent = rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true);
-	arena_t *arena = extent_arena_get(extent);
-
-	szind_t szind = sz_size2index(usize);
-	extent_szind_set(extent, szind);
-	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
-	    szind, false);
-
-	prof_accum_cancel(tsdn, &arena->prof_accum, usize);
-
-	assert(isalloc(tsdn, ptr) == usize);
-}
-
-static size_t
-arena_prof_demote(tsdn_t *tsdn, extent_t *extent, const void *ptr) {
-	cassert(config_prof);
-	assert(ptr != NULL);
-
-	extent_szind_set(extent, NBINS);
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx, (uintptr_t)ptr,
-	    NBINS, false);
-
-	assert(isalloc(tsdn, ptr) == LARGE_MINCLASS);
-
-	return LARGE_MINCLASS;
-}
-
-void
-arena_dalloc_promoted(tsdn_t *tsdn, void *ptr, tcache_t *tcache,
-    bool slow_path) {
-	cassert(config_prof);
-	assert(opt_prof);
-
-	extent_t *extent = iealloc(tsdn, ptr);
-	size_t usize = arena_prof_demote(tsdn, extent, ptr);
-	if (usize <= tcache_maxclass) {
-		tcache_dalloc_large(tsdn_tsd(tsdn), tcache, ptr,
-		    sz_size2index(usize), slow_path);
-	} else {
-		large_dalloc(tsdn, extent);
-	}
-}
-
-static void
-arena_dissociate_bin_slab(arena_t *arena, extent_t *slab, bin_t *bin) {
-	/* Dissociate slab from bin. */
-	if (slab == bin->slabcur) {
-		bin->slabcur = NULL;
-	} else {
-		szind_t binind = extent_szind_get(slab);
-		const bin_info_t *bin_info = &bin_infos[binind];
-
-		/*
-		 * The following block's conditional is necessary because if the
-		 * slab only contains one region, then it never gets inserted
-		 * into the non-full slabs heap.
-		 */
-		if (bin_info->nregs == 1) {
-			arena_bin_slabs_full_remove(arena, bin, slab);
-		} else {
-			arena_bin_slabs_nonfull_remove(bin, slab);
-		}
-	}
-}
-
-static void
-arena_dalloc_bin_slab(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
-    bin_t *bin) {
-	assert(slab != bin->slabcur);
-
-	malloc_mutex_unlock(tsdn, &bin->lock);
-	/******************************/
-	arena_slab_dalloc(tsdn, arena, slab);
-	/****************************/
-	malloc_mutex_lock(tsdn, &bin->lock);
-	if (config_stats) {
-		bin->stats.curslabs--;
-	}
-}
-
-static void
-arena_bin_lower_slab(UNUSED tsdn_t *tsdn, arena_t *arena, extent_t *slab,
-    bin_t *bin) {
-	assert(extent_nfree_get(slab) > 0);
-
-	/*
-	 * Make sure that if bin->slabcur is non-NULL, it refers to the
-	 * oldest/lowest non-full slab.  It is okay to NULL slabcur out rather
-	 * than proactively keeping it pointing at the oldest/lowest non-full
-	 * slab.
-	 */
-	if (bin->slabcur != NULL && extent_snad_comp(bin->slabcur, slab) > 0) {
-		/* Switch slabcur. */
-		if (extent_nfree_get(bin->slabcur) > 0) {
-			arena_bin_slabs_nonfull_insert(bin, bin->slabcur);
-		} else {
-			arena_bin_slabs_full_insert(arena, bin, bin->slabcur);
-		}
-		bin->slabcur = slab;
-		if (config_stats) {
-			bin->stats.reslabs++;
-		}
-	} else {
-		arena_bin_slabs_nonfull_insert(bin, slab);
-	}
-}
-
-static void
-arena_dalloc_bin_locked_impl(tsdn_t *tsdn, arena_t *arena, extent_t *slab,
-    void *ptr, bool junked) {
-	arena_slab_data_t *slab_data = extent_slab_data_get(slab);
-	szind_t binind = extent_szind_get(slab);
-	bin_t *bin = &arena->bins[binind];
-	const bin_info_t *bin_info = &bin_infos[binind];
-
-	if (!junked && config_fill && unlikely(opt_junk_free)) {
-		arena_dalloc_junk_small(ptr, bin_info);
-	}
-
-	arena_slab_reg_dalloc(slab, slab_data, ptr);
-	unsigned nfree = extent_nfree_get(slab);
-	if (nfree == bin_info->nregs) {
-		arena_dissociate_bin_slab(arena, slab, bin);
-		arena_dalloc_bin_slab(tsdn, arena, slab, bin);
-	} else if (nfree == 1 && slab != bin->slabcur) {
-		arena_bin_slabs_full_remove(arena, bin, slab);
-		arena_bin_lower_slab(tsdn, arena, slab, bin);
-	}
-
-	if (config_stats) {
-		bin->stats.ndalloc++;
-		bin->stats.curregs--;
-	}
-}
-
-void
-arena_dalloc_bin_junked_locked(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
-    void *ptr) {
-	arena_dalloc_bin_locked_impl(tsdn, arena, extent, ptr, true);
-}
-
-static void
-arena_dalloc_bin(tsdn_t *tsdn, arena_t *arena, extent_t *extent, void *ptr) {
-	szind_t binind = extent_szind_get(extent);
-	bin_t *bin = &arena->bins[binind];
-
-	malloc_mutex_lock(tsdn, &bin->lock);
-	arena_dalloc_bin_locked_impl(tsdn, arena, extent, ptr, false);
-	malloc_mutex_unlock(tsdn, &bin->lock);
-}
-
-void
-arena_dalloc_small(tsdn_t *tsdn, void *ptr) {
-	extent_t *extent = iealloc(tsdn, ptr);
-	arena_t *arena = extent_arena_get(extent);
-
-	arena_dalloc_bin(tsdn, arena, extent, ptr);
-	arena_decay_tick(tsdn, arena);
-}
-
-bool
-arena_ralloc_no_move(tsdn_t *tsdn, void *ptr, size_t oldsize, size_t size,
-    size_t extra, bool zero) {
-	/* Calls with non-zero extra had to clamp extra. */
-	assert(extra == 0 || size + extra <= LARGE_MAXCLASS);
-
-	if (unlikely(size > LARGE_MAXCLASS)) {
-		return true;
-	}
-
-	extent_t *extent = iealloc(tsdn, ptr);
-	size_t usize_min = sz_s2u(size);
-	size_t usize_max = sz_s2u(size + extra);
-	if (likely(oldsize <= SMALL_MAXCLASS && usize_min <= SMALL_MAXCLASS)) {
-		/*
-		 * Avoid moving the allocation if the size class can be left the
-		 * same.
-		 */
-		assert(bin_infos[sz_size2index(oldsize)].reg_size ==
-		    oldsize);
-		if ((usize_max > SMALL_MAXCLASS || sz_size2index(usize_max) !=
-		    sz_size2index(oldsize)) && (size > oldsize || usize_max <
-		    oldsize)) {
-			return true;
-		}
-
-		arena_decay_tick(tsdn, extent_arena_get(extent));
-		return false;
-	} else if (oldsize >= LARGE_MINCLASS && usize_max >= LARGE_MINCLASS) {
-		return large_ralloc_no_move(tsdn, extent, usize_min, usize_max,
-		    zero);
-	}
-
-	return true;
-}
-
-static void *
-arena_ralloc_move_helper(tsdn_t *tsdn, arena_t *arena, size_t usize,
-    size_t alignment, bool zero, tcache_t *tcache) {
-	if (alignment == 0) {
-		return arena_malloc(tsdn, arena, usize, sz_size2index(usize),
-		    zero, tcache, true);
-	}
-	usize = sz_sa2u(usize, alignment);
-	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-		return NULL;
-	}
-	return ipalloct(tsdn, usize, alignment, zero, tcache, arena);
-}
-
-void *
-arena_ralloc(tsdn_t *tsdn, arena_t *arena, void *ptr, size_t oldsize,
-    size_t size, size_t alignment, bool zero, tcache_t *tcache) {
-	size_t usize = sz_s2u(size);
-	if (unlikely(usize == 0 || size > LARGE_MAXCLASS)) {
-		return NULL;
-	}
-
-	if (likely(usize <= SMALL_MAXCLASS)) {
-		/* Try to avoid moving the allocation. */
-		if (!arena_ralloc_no_move(tsdn, ptr, oldsize, usize, 0, zero)) {
-			return ptr;
-		}
-	}
-
-	if (oldsize >= LARGE_MINCLASS && usize >= LARGE_MINCLASS) {
-		return large_ralloc(tsdn, arena, iealloc(tsdn, ptr), usize,
-		    alignment, zero, tcache);
-	}
-
-	/*
-	 * size and oldsize are different enough that we need to move the
-	 * object.  In that case, fall back to allocating new space and copying.
-	 */
-	void *ret = arena_ralloc_move_helper(tsdn, arena, usize, alignment,
-	    zero, tcache);
-	if (ret == NULL) {
-		return NULL;
-	}
-
-	/*
-	 * Junk/zero-filling were already done by
-	 * ipalloc()/arena_malloc().
-	 */
-
-	size_t copysize = (usize < oldsize) ? usize : oldsize;
-	memcpy(ret, ptr, copysize);
-	isdalloct(tsdn, ptr, oldsize, tcache, NULL, true);
-	return ret;
-}
-
-dss_prec_t
-arena_dss_prec_get(arena_t *arena) {
-	return (dss_prec_t)atomic_load_u(&arena->dss_prec, ATOMIC_ACQUIRE);
-}
-
-bool
-arena_dss_prec_set(arena_t *arena, dss_prec_t dss_prec) {
-	if (!have_dss) {
-		return (dss_prec != dss_prec_disabled);
-	}
-	atomic_store_u(&arena->dss_prec, (unsigned)dss_prec, ATOMIC_RELEASE);
-	return false;
-}
-
-ssize_t
-arena_dirty_decay_ms_default_get(void) {
-	return atomic_load_zd(&dirty_decay_ms_default, ATOMIC_RELAXED);
-}
-
-bool
-arena_dirty_decay_ms_default_set(ssize_t decay_ms) {
-	if (!arena_decay_ms_valid(decay_ms)) {
-		return true;
-	}
-	atomic_store_zd(&dirty_decay_ms_default, decay_ms, ATOMIC_RELAXED);
-	return false;
-}
-
-ssize_t
-arena_muzzy_decay_ms_default_get(void) {
-	return atomic_load_zd(&muzzy_decay_ms_default, ATOMIC_RELAXED);
-}
-
-bool
-arena_muzzy_decay_ms_default_set(ssize_t decay_ms) {
-	if (!arena_decay_ms_valid(decay_ms)) {
-		return true;
-	}
-	atomic_store_zd(&muzzy_decay_ms_default, decay_ms, ATOMIC_RELAXED);
-	return false;
-}
-
-bool
-arena_retain_grow_limit_get_set(tsd_t *tsd, arena_t *arena, size_t *old_limit,
-    size_t *new_limit) {
-	assert(opt_retain);
-
-	pszind_t new_ind JEMALLOC_CC_SILENCE_INIT(0);
-	if (new_limit != NULL) {
-		size_t limit = *new_limit;
-		/* Grow no more than the new limit. */
-		if ((new_ind = sz_psz2ind(limit + 1) - 1) >
-		     EXTENT_GROW_MAX_PIND) {
-			return true;
-		}
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &arena->extent_grow_mtx);
-	if (old_limit != NULL) {
-		*old_limit = sz_pind2sz(arena->retain_grow_limit);
-	}
-	if (new_limit != NULL) {
-		arena->retain_grow_limit = new_ind;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), &arena->extent_grow_mtx);
-
-	return false;
-}
-
-unsigned
-arena_nthreads_get(arena_t *arena, bool internal) {
-	return atomic_load_u(&arena->nthreads[internal], ATOMIC_RELAXED);
-}
-
-void
-arena_nthreads_inc(arena_t *arena, bool internal) {
-	atomic_fetch_add_u(&arena->nthreads[internal], 1, ATOMIC_RELAXED);
-}
-
-void
-arena_nthreads_dec(arena_t *arena, bool internal) {
-	atomic_fetch_sub_u(&arena->nthreads[internal], 1, ATOMIC_RELAXED);
-}
-
-size_t
-arena_extent_sn_next(arena_t *arena) {
-	return atomic_fetch_add_zu(&arena->extent_sn_next, 1, ATOMIC_RELAXED);
-}
-
-arena_t *
-arena_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
-	arena_t *arena;
-	base_t *base;
-	unsigned i;
-
-	if (ind == 0) {
-		base = b0get();
-	} else {
-		base = base_new(tsdn, ind, extent_hooks);
-		if (base == NULL) {
-			return NULL;
-		}
-	}
-
-	arena = (arena_t *)base_alloc(tsdn, base, sizeof(arena_t), CACHELINE);
-	if (arena == NULL) {
-		goto label_error;
-	}
-
-	atomic_store_u(&arena->nthreads[0], 0, ATOMIC_RELAXED);
-	atomic_store_u(&arena->nthreads[1], 0, ATOMIC_RELAXED);
-	arena->last_thd = NULL;
-
-	if (config_stats) {
-		if (arena_stats_init(tsdn, &arena->stats)) {
-			goto label_error;
-		}
-
-		ql_new(&arena->tcache_ql);
-		ql_new(&arena->cache_bin_array_descriptor_ql);
-		if (malloc_mutex_init(&arena->tcache_ql_mtx, "tcache_ql",
-		    WITNESS_RANK_TCACHE_QL, malloc_mutex_rank_exclusive)) {
-			goto label_error;
-		}
-	}
-
-	if (config_prof) {
-		if (prof_accum_init(tsdn, &arena->prof_accum)) {
-			goto label_error;
-		}
-	}
-
-	if (config_cache_oblivious) {
-		/*
-		 * A nondeterministic seed based on the address of arena reduces
-		 * the likelihood of lockstep non-uniform cache index
-		 * utilization among identical concurrent processes, but at the
-		 * cost of test repeatability.  For debug builds, instead use a
-		 * deterministic seed.
-		 */
-		atomic_store_zu(&arena->offset_state, config_debug ? ind :
-		    (size_t)(uintptr_t)arena, ATOMIC_RELAXED);
-	}
-
-	atomic_store_zu(&arena->extent_sn_next, 0, ATOMIC_RELAXED);
-
-	atomic_store_u(&arena->dss_prec, (unsigned)extent_dss_prec_get(),
-	    ATOMIC_RELAXED);
-
-	atomic_store_zu(&arena->nactive, 0, ATOMIC_RELAXED);
-
-	extent_list_init(&arena->large);
-	if (malloc_mutex_init(&arena->large_mtx, "arena_large",
-	    WITNESS_RANK_ARENA_LARGE, malloc_mutex_rank_exclusive)) {
-		goto label_error;
-	}
-
-	/*
-	 * Delay coalescing for dirty extents despite the disruptive effect on
-	 * memory layout for best-fit extent allocation, since cached extents
-	 * are likely to be reused soon after deallocation, and the cost of
-	 * merging/splitting extents is non-trivial.
-	 */
-	if (extents_init(tsdn, &arena->extents_dirty, extent_state_dirty,
-	    true)) {
-		goto label_error;
-	}
-	/*
-	 * Coalesce muzzy extents immediately, because operations on them are in
-	 * the critical path much less often than for dirty extents.
-	 */
-	if (extents_init(tsdn, &arena->extents_muzzy, extent_state_muzzy,
-	    false)) {
-		goto label_error;
-	}
-	/*
-	 * Coalesce retained extents immediately, in part because they will
-	 * never be evicted (and therefore there's no opportunity for delayed
-	 * coalescing), but also because operations on retained extents are not
-	 * in the critical path.
-	 */
-	if (extents_init(tsdn, &arena->extents_retained, extent_state_retained,
-	    false)) {
-		goto label_error;
-	}
-
-	if (arena_decay_init(&arena->decay_dirty,
-	    arena_dirty_decay_ms_default_get(), &arena->stats.decay_dirty)) {
-		goto label_error;
-	}
-	if (arena_decay_init(&arena->decay_muzzy,
-	    arena_muzzy_decay_ms_default_get(), &arena->stats.decay_muzzy)) {
-		goto label_error;
-	}
-
-	arena->extent_grow_next = sz_psz2ind(HUGEPAGE);
-	arena->retain_grow_limit = EXTENT_GROW_MAX_PIND;
-	if (malloc_mutex_init(&arena->extent_grow_mtx, "extent_grow",
-	    WITNESS_RANK_EXTENT_GROW, malloc_mutex_rank_exclusive)) {
-		goto label_error;
-	}
-
-	extent_avail_new(&arena->extent_avail);
-	if (malloc_mutex_init(&arena->extent_avail_mtx, "extent_avail",
-	    WITNESS_RANK_EXTENT_AVAIL, malloc_mutex_rank_exclusive)) {
-		goto label_error;
-	}
-
-	/* Initialize bins. */
-	for (i = 0; i < NBINS; i++) {
-		bool err = bin_init(&arena->bins[i]);
-		if (err) {
-			goto label_error;
-		}
-	}
-
-	arena->base = base;
-	/* Set arena before creating background threads. */
-	arena_set(ind, arena);
-
-	nstime_init(&arena->create_time, 0);
-	nstime_update(&arena->create_time);
-
-	/* We don't support reentrancy for arena 0 bootstrapping. */
-	if (ind != 0) {
-		/*
-		 * If we're here, then arena 0 already exists, so bootstrapping
-		 * is done enough that we should have tsd.
-		 */
-		assert(!tsdn_null(tsdn));
-		pre_reentrancy(tsdn_tsd(tsdn), arena);
-		if (hooks_arena_new_hook) {
-			hooks_arena_new_hook();
-		}
-		post_reentrancy(tsdn_tsd(tsdn));
-	}
-
-	return arena;
-label_error:
-	if (ind != 0) {
-		base_delete(tsdn, base);
-	}
-	return NULL;
-}
-
-void
-arena_boot(void) {
-	arena_dirty_decay_ms_default_set(opt_dirty_decay_ms);
-	arena_muzzy_decay_ms_default_set(opt_muzzy_decay_ms);
-#define REGIND_bin_yes(index, reg_size) 				\
-	div_init(&arena_binind_div_info[(index)], (reg_size));
-#define REGIND_bin_no(index, reg_size)
-#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs,		\
-    lg_delta_lookup)							\
-	REGIND_bin_##bin(index, (1U<<lg_grp) + (ndelta << lg_delta))
-	SIZE_CLASSES
-#undef REGIND_bin_yes
-#undef REGIND_bin_no
-#undef SC
-}
-
-void
-arena_prefork0(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_prefork(tsdn, &arena->decay_dirty.mtx);
-	malloc_mutex_prefork(tsdn, &arena->decay_muzzy.mtx);
-}
-
-void
-arena_prefork1(tsdn_t *tsdn, arena_t *arena) {
-	if (config_stats) {
-		malloc_mutex_prefork(tsdn, &arena->tcache_ql_mtx);
-	}
-}
-
-void
-arena_prefork2(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_prefork(tsdn, &arena->extent_grow_mtx);
-}
-
-void
-arena_prefork3(tsdn_t *tsdn, arena_t *arena) {
-	extents_prefork(tsdn, &arena->extents_dirty);
-	extents_prefork(tsdn, &arena->extents_muzzy);
-	extents_prefork(tsdn, &arena->extents_retained);
-}
-
-void
-arena_prefork4(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_prefork(tsdn, &arena->extent_avail_mtx);
-}
-
-void
-arena_prefork5(tsdn_t *tsdn, arena_t *arena) {
-	base_prefork(tsdn, arena->base);
-}
-
-void
-arena_prefork6(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_prefork(tsdn, &arena->large_mtx);
-}
-
-void
-arena_prefork7(tsdn_t *tsdn, arena_t *arena) {
-	for (unsigned i = 0; i < NBINS; i++) {
-		bin_prefork(tsdn, &arena->bins[i]);
-	}
-}
-
-void
-arena_postfork_parent(tsdn_t *tsdn, arena_t *arena) {
-	unsigned i;
-
-	for (i = 0; i < NBINS; i++) {
-		bin_postfork_parent(tsdn, &arena->bins[i]);
-	}
-	malloc_mutex_postfork_parent(tsdn, &arena->large_mtx);
-	base_postfork_parent(tsdn, arena->base);
-	malloc_mutex_postfork_parent(tsdn, &arena->extent_avail_mtx);
-	extents_postfork_parent(tsdn, &arena->extents_dirty);
-	extents_postfork_parent(tsdn, &arena->extents_muzzy);
-	extents_postfork_parent(tsdn, &arena->extents_retained);
-	malloc_mutex_postfork_parent(tsdn, &arena->extent_grow_mtx);
-	malloc_mutex_postfork_parent(tsdn, &arena->decay_dirty.mtx);
-	malloc_mutex_postfork_parent(tsdn, &arena->decay_muzzy.mtx);
-	if (config_stats) {
-		malloc_mutex_postfork_parent(tsdn, &arena->tcache_ql_mtx);
-	}
-}
-
-void
-arena_postfork_child(tsdn_t *tsdn, arena_t *arena) {
-	unsigned i;
-
-	atomic_store_u(&arena->nthreads[0], 0, ATOMIC_RELAXED);
-	atomic_store_u(&arena->nthreads[1], 0, ATOMIC_RELAXED);
-	if (tsd_arena_get(tsdn_tsd(tsdn)) == arena) {
-		arena_nthreads_inc(arena, false);
-	}
-	if (tsd_iarena_get(tsdn_tsd(tsdn)) == arena) {
-		arena_nthreads_inc(arena, true);
-	}
-	if (config_stats) {
-		ql_new(&arena->tcache_ql);
-		ql_new(&arena->cache_bin_array_descriptor_ql);
-		tcache_t *tcache = tcache_get(tsdn_tsd(tsdn));
-		if (tcache != NULL && tcache->arena == arena) {
-			ql_elm_new(tcache, link);
-			ql_tail_insert(&arena->tcache_ql, tcache, link);
-			cache_bin_array_descriptor_init(
-			    &tcache->cache_bin_array_descriptor,
-			    tcache->bins_small, tcache->bins_large);
-			ql_tail_insert(&arena->cache_bin_array_descriptor_ql,
-			    &tcache->cache_bin_array_descriptor, link);
-		}
-	}
-
-	for (i = 0; i < NBINS; i++) {
-		bin_postfork_child(tsdn, &arena->bins[i]);
-	}
-	malloc_mutex_postfork_child(tsdn, &arena->large_mtx);
-	base_postfork_child(tsdn, arena->base);
-	malloc_mutex_postfork_child(tsdn, &arena->extent_avail_mtx);
-	extents_postfork_child(tsdn, &arena->extents_dirty);
-	extents_postfork_child(tsdn, &arena->extents_muzzy);
-	extents_postfork_child(tsdn, &arena->extents_retained);
-	malloc_mutex_postfork_child(tsdn, &arena->extent_grow_mtx);
-	malloc_mutex_postfork_child(tsdn, &arena->decay_dirty.mtx);
-	malloc_mutex_postfork_child(tsdn, &arena->decay_muzzy.mtx);
-	if (config_stats) {
-		malloc_mutex_postfork_child(tsdn, &arena->tcache_ql_mtx);
-	}
-}
diff --git a/redis-stable/deps/jemalloc/src/background_thread.c b/redis-stable/deps/jemalloc/src/background_thread.c
deleted file mode 100644
index 457669c9..00000000
--- a/redis-stable/deps/jemalloc/src/background_thread.c
+++ /dev/null
@@ -1,915 +0,0 @@
-#define JEMALLOC_BACKGROUND_THREAD_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-
-/******************************************************************************/
-/* Data. */
-
-/* This option should be opt-in only. */
-#define BACKGROUND_THREAD_DEFAULT false
-/* Read-only after initialization. */
-bool opt_background_thread = BACKGROUND_THREAD_DEFAULT;
-size_t opt_max_background_threads = MAX_BACKGROUND_THREAD_LIMIT;
-
-/* Used for thread creation, termination and stats. */
-malloc_mutex_t background_thread_lock;
-/* Indicates global state.  Atomic because decay reads this w/o locking. */
-atomic_b_t background_thread_enabled_state;
-size_t n_background_threads;
-size_t max_background_threads;
-/* Thread info per-index. */
-background_thread_info_t *background_thread_info;
-
-/* False if no necessary runtime support. */
-bool can_enable_background_thread;
-
-/******************************************************************************/
-
-#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
-#include <dlfcn.h>
-
-static int (*pthread_create_fptr)(pthread_t *__restrict, const pthread_attr_t *,
-    void *(*)(void *), void *__restrict);
-
-static void
-pthread_create_wrapper_init(void) {
-#ifdef JEMALLOC_LAZY_LOCK
-	if (!isthreaded) {
-		isthreaded = true;
-	}
-#endif
-}
-
-int
-pthread_create_wrapper(pthread_t *__restrict thread, const pthread_attr_t *attr,
-    void *(*start_routine)(void *), void *__restrict arg) {
-	pthread_create_wrapper_init();
-
-	return pthread_create_fptr(thread, attr, start_routine, arg);
-}
-#endif /* JEMALLOC_PTHREAD_CREATE_WRAPPER */
-
-#ifndef JEMALLOC_BACKGROUND_THREAD
-#define NOT_REACHED { not_reached(); }
-bool background_thread_create(tsd_t *tsd, unsigned arena_ind) NOT_REACHED
-bool background_threads_enable(tsd_t *tsd) NOT_REACHED
-bool background_threads_disable(tsd_t *tsd) NOT_REACHED
-void background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
-    arena_decay_t *decay, size_t npages_new) NOT_REACHED
-void background_thread_prefork0(tsdn_t *tsdn) NOT_REACHED
-void background_thread_prefork1(tsdn_t *tsdn) NOT_REACHED
-void background_thread_postfork_parent(tsdn_t *tsdn) NOT_REACHED
-void background_thread_postfork_child(tsdn_t *tsdn) NOT_REACHED
-bool background_thread_stats_read(tsdn_t *tsdn,
-    background_thread_stats_t *stats) NOT_REACHED
-void background_thread_ctl_init(tsdn_t *tsdn) NOT_REACHED
-#undef NOT_REACHED
-#else
-
-static bool background_thread_enabled_at_fork;
-
-static void
-background_thread_info_init(tsdn_t *tsdn, background_thread_info_t *info) {
-	background_thread_wakeup_time_set(tsdn, info, 0);
-	info->npages_to_purge_new = 0;
-	if (config_stats) {
-		info->tot_n_runs = 0;
-		nstime_init(&info->tot_sleep_time, 0);
-	}
-}
-
-static inline bool
-set_current_thread_affinity(UNUSED int cpu) {
-#if defined(JEMALLOC_HAVE_SCHED_SETAFFINITY)
-	cpu_set_t cpuset;
-	CPU_ZERO(&cpuset);
-	CPU_SET(cpu, &cpuset);
-	int ret = sched_setaffinity(0, sizeof(cpu_set_t), &cpuset);
-
-	return (ret != 0);
-#else
-	return false;
-#endif
-}
-
-/* Threshold for determining when to wake up the background thread. */
-#define BACKGROUND_THREAD_NPAGES_THRESHOLD UINT64_C(1024)
-#define BILLION UINT64_C(1000000000)
-/* Minimal sleep interval 100 ms. */
-#define BACKGROUND_THREAD_MIN_INTERVAL_NS (BILLION / 10)
-
-static inline size_t
-decay_npurge_after_interval(arena_decay_t *decay, size_t interval) {
-	size_t i;
-	uint64_t sum = 0;
-	for (i = 0; i < interval; i++) {
-		sum += decay->backlog[i] * h_steps[i];
-	}
-	for (; i < SMOOTHSTEP_NSTEPS; i++) {
-		sum += decay->backlog[i] * (h_steps[i] - h_steps[i - interval]);
-	}
-
-	return (size_t)(sum >> SMOOTHSTEP_BFP);
-}
-
-static uint64_t
-arena_decay_compute_purge_interval_impl(tsdn_t *tsdn, arena_decay_t *decay,
-    extents_t *extents) {
-	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
-		/* Use minimal interval if decay is contended. */
-		return BACKGROUND_THREAD_MIN_INTERVAL_NS;
-	}
-
-	uint64_t interval;
-	ssize_t decay_time = atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
-	if (decay_time <= 0) {
-		/* Purging is eagerly done or disabled currently. */
-		interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
-		goto label_done;
-	}
-
-	uint64_t decay_interval_ns = nstime_ns(&decay->interval);
-	assert(decay_interval_ns > 0);
-	size_t npages = extents_npages_get(extents);
-	if (npages == 0) {
-		unsigned i;
-		for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
-			if (decay->backlog[i] > 0) {
-				break;
-			}
-		}
-		if (i == SMOOTHSTEP_NSTEPS) {
-			/* No dirty pages recorded.  Sleep indefinitely. */
-			interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
-			goto label_done;
-		}
-	}
-	if (npages <= BACKGROUND_THREAD_NPAGES_THRESHOLD) {
-		/* Use max interval. */
-		interval = decay_interval_ns * SMOOTHSTEP_NSTEPS;
-		goto label_done;
-	}
-
-	size_t lb = BACKGROUND_THREAD_MIN_INTERVAL_NS / decay_interval_ns;
-	size_t ub = SMOOTHSTEP_NSTEPS;
-	/* Minimal 2 intervals to ensure reaching next epoch deadline. */
-	lb = (lb < 2) ? 2 : lb;
-	if ((decay_interval_ns * ub <= BACKGROUND_THREAD_MIN_INTERVAL_NS) ||
-	    (lb + 2 > ub)) {
-		interval = BACKGROUND_THREAD_MIN_INTERVAL_NS;
-		goto label_done;
-	}
-
-	assert(lb + 2 <= ub);
-	size_t npurge_lb, npurge_ub;
-	npurge_lb = decay_npurge_after_interval(decay, lb);
-	if (npurge_lb > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
-		interval = decay_interval_ns * lb;
-		goto label_done;
-	}
-	npurge_ub = decay_npurge_after_interval(decay, ub);
-	if (npurge_ub < BACKGROUND_THREAD_NPAGES_THRESHOLD) {
-		interval = decay_interval_ns * ub;
-		goto label_done;
-	}
-
-	unsigned n_search = 0;
-	size_t target, npurge;
-	while ((npurge_lb + BACKGROUND_THREAD_NPAGES_THRESHOLD < npurge_ub)
-	    && (lb + 2 < ub)) {
-		target = (lb + ub) / 2;
-		npurge = decay_npurge_after_interval(decay, target);
-		if (npurge > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
-			ub = target;
-			npurge_ub = npurge;
-		} else {
-			lb = target;
-			npurge_lb = npurge;
-		}
-		assert(n_search++ < lg_floor(SMOOTHSTEP_NSTEPS) + 1);
-	}
-	interval = decay_interval_ns * (ub + lb) / 2;
-label_done:
-	interval = (interval < BACKGROUND_THREAD_MIN_INTERVAL_NS) ?
-	    BACKGROUND_THREAD_MIN_INTERVAL_NS : interval;
-	malloc_mutex_unlock(tsdn, &decay->mtx);
-
-	return interval;
-}
-
-/* Compute purge interval for background threads. */
-static uint64_t
-arena_decay_compute_purge_interval(tsdn_t *tsdn, arena_t *arena) {
-	uint64_t i1, i2;
-	i1 = arena_decay_compute_purge_interval_impl(tsdn, &arena->decay_dirty,
-	    &arena->extents_dirty);
-	if (i1 == BACKGROUND_THREAD_MIN_INTERVAL_NS) {
-		return i1;
-	}
-	i2 = arena_decay_compute_purge_interval_impl(tsdn, &arena->decay_muzzy,
-	    &arena->extents_muzzy);
-
-	return i1 < i2 ? i1 : i2;
-}
-
-static void
-background_thread_sleep(tsdn_t *tsdn, background_thread_info_t *info,
-    uint64_t interval) {
-	if (config_stats) {
-		info->tot_n_runs++;
-	}
-	info->npages_to_purge_new = 0;
-
-	struct timeval tv;
-	/* Specific clock required by timedwait. */
-	gettimeofday(&tv, NULL);
-	nstime_t before_sleep;
-	nstime_init2(&before_sleep, tv.tv_sec, tv.tv_usec * 1000);
-
-	int ret;
-	if (interval == BACKGROUND_THREAD_INDEFINITE_SLEEP) {
-		assert(background_thread_indefinite_sleep(info));
-		ret = pthread_cond_wait(&info->cond, &info->mtx.lock);
-		assert(ret == 0);
-	} else {
-		assert(interval >= BACKGROUND_THREAD_MIN_INTERVAL_NS &&
-		    interval <= BACKGROUND_THREAD_INDEFINITE_SLEEP);
-		/* We need malloc clock (can be different from tv). */
-		nstime_t next_wakeup;
-		nstime_init(&next_wakeup, 0);
-		nstime_update(&next_wakeup);
-		nstime_iadd(&next_wakeup, interval);
-		assert(nstime_ns(&next_wakeup) <
-		    BACKGROUND_THREAD_INDEFINITE_SLEEP);
-		background_thread_wakeup_time_set(tsdn, info,
-		    nstime_ns(&next_wakeup));
-
-		nstime_t ts_wakeup;
-		nstime_copy(&ts_wakeup, &before_sleep);
-		nstime_iadd(&ts_wakeup, interval);
-		struct timespec ts;
-		ts.tv_sec = (size_t)nstime_sec(&ts_wakeup);
-		ts.tv_nsec = (size_t)nstime_nsec(&ts_wakeup);
-
-		assert(!background_thread_indefinite_sleep(info));
-		ret = pthread_cond_timedwait(&info->cond, &info->mtx.lock, &ts);
-		assert(ret == ETIMEDOUT || ret == 0);
-		background_thread_wakeup_time_set(tsdn, info,
-		    BACKGROUND_THREAD_INDEFINITE_SLEEP);
-	}
-	if (config_stats) {
-		gettimeofday(&tv, NULL);
-		nstime_t after_sleep;
-		nstime_init2(&after_sleep, tv.tv_sec, tv.tv_usec * 1000);
-		if (nstime_compare(&after_sleep, &before_sleep) > 0) {
-			nstime_subtract(&after_sleep, &before_sleep);
-			nstime_add(&info->tot_sleep_time, &after_sleep);
-		}
-	}
-}
-
-static bool
-background_thread_pause_check(tsdn_t *tsdn, background_thread_info_t *info) {
-	if (unlikely(info->state == background_thread_paused)) {
-		malloc_mutex_unlock(tsdn, &info->mtx);
-		/* Wait on global lock to update status. */
-		malloc_mutex_lock(tsdn, &background_thread_lock);
-		malloc_mutex_unlock(tsdn, &background_thread_lock);
-		malloc_mutex_lock(tsdn, &info->mtx);
-		return true;
-	}
-
-	return false;
-}
-
-static inline void
-background_work_sleep_once(tsdn_t *tsdn, background_thread_info_t *info, unsigned ind) {
-	uint64_t min_interval = BACKGROUND_THREAD_INDEFINITE_SLEEP;
-	unsigned narenas = narenas_total_get();
-
-	for (unsigned i = ind; i < narenas; i += max_background_threads) {
-		arena_t *arena = arena_get(tsdn, i, false);
-		if (!arena) {
-			continue;
-		}
-		arena_decay(tsdn, arena, true, false);
-		if (min_interval == BACKGROUND_THREAD_MIN_INTERVAL_NS) {
-			/* Min interval will be used. */
-			continue;
-		}
-		uint64_t interval = arena_decay_compute_purge_interval(tsdn,
-		    arena);
-		assert(interval >= BACKGROUND_THREAD_MIN_INTERVAL_NS);
-		if (min_interval > interval) {
-			min_interval = interval;
-		}
-	}
-	background_thread_sleep(tsdn, info, min_interval);
-}
-
-static bool
-background_threads_disable_single(tsd_t *tsd, background_thread_info_t *info) {
-	if (info == &background_thread_info[0]) {
-		malloc_mutex_assert_owner(tsd_tsdn(tsd),
-		    &background_thread_lock);
-	} else {
-		malloc_mutex_assert_not_owner(tsd_tsdn(tsd),
-		    &background_thread_lock);
-	}
-
-	pre_reentrancy(tsd, NULL);
-	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-	bool has_thread;
-	assert(info->state != background_thread_paused);
-	if (info->state == background_thread_started) {
-		has_thread = true;
-		info->state = background_thread_stopped;
-		pthread_cond_signal(&info->cond);
-	} else {
-		has_thread = false;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-
-	if (!has_thread) {
-		post_reentrancy(tsd);
-		return false;
-	}
-	void *ret;
-	if (pthread_join(info->thread, &ret)) {
-		post_reentrancy(tsd);
-		return true;
-	}
-	assert(ret == NULL);
-	n_background_threads--;
-	post_reentrancy(tsd);
-
-	return false;
-}
-
-static void *background_thread_entry(void *ind_arg);
-
-static int
-background_thread_create_signals_masked(pthread_t *thread,
-    const pthread_attr_t *attr, void *(*start_routine)(void *), void *arg) {
-	/*
-	 * Mask signals during thread creation so that the thread inherits
-	 * an empty signal set.
-	 */
-	sigset_t set;
-	sigfillset(&set);
-	sigset_t oldset;
-	int mask_err = pthread_sigmask(SIG_SETMASK, &set, &oldset);
-	if (mask_err != 0) {
-		return mask_err;
-	}
-	int create_err = pthread_create_wrapper(thread, attr, start_routine,
-	    arg);
-	/*
-	 * Restore the signal mask.  Failure to restore the signal mask here
-	 * changes program behavior.
-	 */
-	int restore_err = pthread_sigmask(SIG_SETMASK, &oldset, NULL);
-	if (restore_err != 0) {
-		malloc_printf("<jemalloc>: background thread creation "
-		    "failed (%d), and signal mask restoration failed "
-		    "(%d)\n", create_err, restore_err);
-		if (opt_abort) {
-			abort();
-		}
-	}
-	return create_err;
-}
-
-static bool
-check_background_thread_creation(tsd_t *tsd, unsigned *n_created,
-    bool *created_threads) {
-	bool ret = false;
-	if (likely(*n_created == n_background_threads)) {
-		return ret;
-	}
-
-	tsdn_t *tsdn = tsd_tsdn(tsd);
-	malloc_mutex_unlock(tsdn, &background_thread_info[0].mtx);
-	for (unsigned i = 1; i < max_background_threads; i++) {
-		if (created_threads[i]) {
-			continue;
-		}
-		background_thread_info_t *info = &background_thread_info[i];
-		malloc_mutex_lock(tsdn, &info->mtx);
-		/*
-		 * In case of the background_thread_paused state because of
-		 * arena reset, delay the creation.
-		 */
-		bool create = (info->state == background_thread_started);
-		malloc_mutex_unlock(tsdn, &info->mtx);
-		if (!create) {
-			continue;
-		}
-
-		pre_reentrancy(tsd, NULL);
-		int err = background_thread_create_signals_masked(&info->thread,
-		    NULL, background_thread_entry, (void *)(uintptr_t)i);
-		post_reentrancy(tsd);
-
-		if (err == 0) {
-			(*n_created)++;
-			created_threads[i] = true;
-		} else {
-			malloc_printf("<jemalloc>: background thread "
-			    "creation failed (%d)\n", err);
-			if (opt_abort) {
-				abort();
-			}
-		}
-		/* Return to restart the loop since we unlocked. */
-		ret = true;
-		break;
-	}
-	malloc_mutex_lock(tsdn, &background_thread_info[0].mtx);
-
-	return ret;
-}
-
-static void
-background_thread0_work(tsd_t *tsd) {
-	/* Thread0 is also responsible for launching / terminating threads. */
-	VARIABLE_ARRAY(bool, created_threads, max_background_threads);
-	unsigned i;
-	for (i = 1; i < max_background_threads; i++) {
-		created_threads[i] = false;
-	}
-	/* Start working, and create more threads when asked. */
-	unsigned n_created = 1;
-	while (background_thread_info[0].state != background_thread_stopped) {
-		if (background_thread_pause_check(tsd_tsdn(tsd),
-		    &background_thread_info[0])) {
-			continue;
-		}
-		if (check_background_thread_creation(tsd, &n_created,
-		    (bool *)&created_threads)) {
-			continue;
-		}
-		background_work_sleep_once(tsd_tsdn(tsd),
-		    &background_thread_info[0], 0);
-	}
-
-	/*
-	 * Shut down other threads at exit.  Note that the ctl thread is holding
-	 * the global background_thread mutex (and is waiting) for us.
-	 */
-	assert(!background_thread_enabled());
-	for (i = 1; i < max_background_threads; i++) {
-		background_thread_info_t *info = &background_thread_info[i];
-		assert(info->state != background_thread_paused);
-		if (created_threads[i]) {
-			background_threads_disable_single(tsd, info);
-		} else {
-			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-			if (info->state != background_thread_stopped) {
-				/* The thread was not created. */
-				assert(info->state ==
-				    background_thread_started);
-				n_background_threads--;
-				info->state = background_thread_stopped;
-			}
-			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-		}
-	}
-	background_thread_info[0].state = background_thread_stopped;
-	assert(n_background_threads == 1);
-}
-
-static void
-background_work(tsd_t *tsd, unsigned ind) {
-	background_thread_info_t *info = &background_thread_info[ind];
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-	background_thread_wakeup_time_set(tsd_tsdn(tsd), info,
-	    BACKGROUND_THREAD_INDEFINITE_SLEEP);
-	if (ind == 0) {
-		background_thread0_work(tsd);
-	} else {
-		while (info->state != background_thread_stopped) {
-			if (background_thread_pause_check(tsd_tsdn(tsd),
-			    info)) {
-				continue;
-			}
-			background_work_sleep_once(tsd_tsdn(tsd), info, ind);
-		}
-	}
-	assert(info->state == background_thread_stopped);
-	background_thread_wakeup_time_set(tsd_tsdn(tsd), info, 0);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-}
-
-static void *
-background_thread_entry(void *ind_arg) {
-	unsigned thread_ind = (unsigned)(uintptr_t)ind_arg;
-	assert(thread_ind < max_background_threads);
-#ifdef JEMALLOC_HAVE_PTHREAD_SETNAME_NP
-	pthread_setname_np(pthread_self(), "jemalloc_bg_thd");
-#endif
-	if (opt_percpu_arena != percpu_arena_disabled) {
-		set_current_thread_affinity((int)thread_ind);
-	}
-	/*
-	 * Start periodic background work.  We use internal tsd which avoids
-	 * side effects, for example triggering new arena creation (which in
-	 * turn triggers another background thread creation).
-	 */
-	background_work(tsd_internal_fetch(), thread_ind);
-	assert(pthread_equal(pthread_self(),
-	    background_thread_info[thread_ind].thread));
-
-	return NULL;
-}
-
-static void
-background_thread_init(tsd_t *tsd, background_thread_info_t *info) {
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
-	info->state = background_thread_started;
-	background_thread_info_init(tsd_tsdn(tsd), info);
-	n_background_threads++;
-}
-
-/* Create a new background thread if needed. */
-bool
-background_thread_create(tsd_t *tsd, unsigned arena_ind) {
-	assert(have_background_thread);
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
-
-	/* We create at most NCPUs threads. */
-	size_t thread_ind = arena_ind % max_background_threads;
-	background_thread_info_t *info = &background_thread_info[thread_ind];
-
-	bool need_new_thread;
-	malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-	need_new_thread = background_thread_enabled() &&
-	    (info->state == background_thread_stopped);
-	if (need_new_thread) {
-		background_thread_init(tsd, info);
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-	if (!need_new_thread) {
-		return false;
-	}
-	if (arena_ind != 0) {
-		/* Threads are created asynchronously by Thread 0. */
-		background_thread_info_t *t0 = &background_thread_info[0];
-		malloc_mutex_lock(tsd_tsdn(tsd), &t0->mtx);
-		assert(t0->state == background_thread_started);
-		pthread_cond_signal(&t0->cond);
-		malloc_mutex_unlock(tsd_tsdn(tsd), &t0->mtx);
-
-		return false;
-	}
-
-	pre_reentrancy(tsd, NULL);
-	/*
-	 * To avoid complications (besides reentrancy), create internal
-	 * background threads with the underlying pthread_create.
-	 */
-	int err = background_thread_create_signals_masked(&info->thread, NULL,
-	    background_thread_entry, (void *)thread_ind);
-	post_reentrancy(tsd);
-
-	if (err != 0) {
-		malloc_printf("<jemalloc>: arena 0 background thread creation "
-		    "failed (%d)\n", err);
-		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-		info->state = background_thread_stopped;
-		n_background_threads--;
-		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-
-		return true;
-	}
-
-	return false;
-}
-
-bool
-background_threads_enable(tsd_t *tsd) {
-	assert(n_background_threads == 0);
-	assert(background_thread_enabled());
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
-
-	VARIABLE_ARRAY(bool, marked, max_background_threads);
-	unsigned i, nmarked;
-	for (i = 0; i < max_background_threads; i++) {
-		marked[i] = false;
-	}
-	nmarked = 0;
-	/* Thread 0 is required and created at the end. */
-	marked[0] = true;
-	/* Mark the threads we need to create for thread 0. */
-	unsigned n = narenas_total_get();
-	for (i = 1; i < n; i++) {
-		if (marked[i % max_background_threads] ||
-		    arena_get(tsd_tsdn(tsd), i, false) == NULL) {
-			continue;
-		}
-		background_thread_info_t *info = &background_thread_info[
-		    i % max_background_threads];
-		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-		assert(info->state == background_thread_stopped);
-		background_thread_init(tsd, info);
-		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-		marked[i % max_background_threads] = true;
-		if (++nmarked == max_background_threads) {
-			break;
-		}
-	}
-
-	return background_thread_create(tsd, 0);
-}
-
-bool
-background_threads_disable(tsd_t *tsd) {
-	assert(!background_thread_enabled());
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &background_thread_lock);
-
-	/* Thread 0 will be responsible for terminating other threads. */
-	if (background_threads_disable_single(tsd,
-	    &background_thread_info[0])) {
-		return true;
-	}
-	assert(n_background_threads == 0);
-
-	return false;
-}
-
-/* Check if we need to signal the background thread early. */
-void
-background_thread_interval_check(tsdn_t *tsdn, arena_t *arena,
-    arena_decay_t *decay, size_t npages_new) {
-	background_thread_info_t *info = arena_background_thread_info_get(
-	    arena);
-	if (malloc_mutex_trylock(tsdn, &info->mtx)) {
-		/*
-		 * Background thread may hold the mutex for a long period of
-		 * time.  We'd like to avoid the variance on application
-		 * threads.  So keep this non-blocking, and leave the work to a
-		 * future epoch.
-		 */
-		return;
-	}
-
-	if (info->state != background_thread_started) {
-		goto label_done;
-	}
-	if (malloc_mutex_trylock(tsdn, &decay->mtx)) {
-		goto label_done;
-	}
-
-	ssize_t decay_time = atomic_load_zd(&decay->time_ms, ATOMIC_RELAXED);
-	if (decay_time <= 0) {
-		/* Purging is eagerly done or disabled currently. */
-		goto label_done_unlock2;
-	}
-	uint64_t decay_interval_ns = nstime_ns(&decay->interval);
-	assert(decay_interval_ns > 0);
-
-	nstime_t diff;
-	nstime_init(&diff, background_thread_wakeup_time_get(info));
-	if (nstime_compare(&diff, &decay->epoch) <= 0) {
-		goto label_done_unlock2;
-	}
-	nstime_subtract(&diff, &decay->epoch);
-	if (nstime_ns(&diff) < BACKGROUND_THREAD_MIN_INTERVAL_NS) {
-		goto label_done_unlock2;
-	}
-
-	if (npages_new > 0) {
-		size_t n_epoch = (size_t)(nstime_ns(&diff) / decay_interval_ns);
-		/*
-		 * Compute how many new pages we would need to purge by the next
-		 * wakeup, which is used to determine if we should signal the
-		 * background thread.
-		 */
-		uint64_t npurge_new;
-		if (n_epoch >= SMOOTHSTEP_NSTEPS) {
-			npurge_new = npages_new;
-		} else {
-			uint64_t h_steps_max = h_steps[SMOOTHSTEP_NSTEPS - 1];
-			assert(h_steps_max >=
-			    h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
-			npurge_new = npages_new * (h_steps_max -
-			    h_steps[SMOOTHSTEP_NSTEPS - 1 - n_epoch]);
-			npurge_new >>= SMOOTHSTEP_BFP;
-		}
-		info->npages_to_purge_new += npurge_new;
-	}
-
-	bool should_signal;
-	if (info->npages_to_purge_new > BACKGROUND_THREAD_NPAGES_THRESHOLD) {
-		should_signal = true;
-	} else if (unlikely(background_thread_indefinite_sleep(info)) &&
-	    (extents_npages_get(&arena->extents_dirty) > 0 ||
-	    extents_npages_get(&arena->extents_muzzy) > 0 ||
-	    info->npages_to_purge_new > 0)) {
-		should_signal = true;
-	} else {
-		should_signal = false;
-	}
-
-	if (should_signal) {
-		info->npages_to_purge_new = 0;
-		pthread_cond_signal(&info->cond);
-	}
-label_done_unlock2:
-	malloc_mutex_unlock(tsdn, &decay->mtx);
-label_done:
-	malloc_mutex_unlock(tsdn, &info->mtx);
-}
-
-void
-background_thread_prefork0(tsdn_t *tsdn) {
-	malloc_mutex_prefork(tsdn, &background_thread_lock);
-	background_thread_enabled_at_fork = background_thread_enabled();
-}
-
-void
-background_thread_prefork1(tsdn_t *tsdn) {
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		malloc_mutex_prefork(tsdn, &background_thread_info[i].mtx);
-	}
-}
-
-void
-background_thread_postfork_parent(tsdn_t *tsdn) {
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		malloc_mutex_postfork_parent(tsdn,
-		    &background_thread_info[i].mtx);
-	}
-	malloc_mutex_postfork_parent(tsdn, &background_thread_lock);
-}
-
-void
-background_thread_postfork_child(tsdn_t *tsdn) {
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		malloc_mutex_postfork_child(tsdn,
-		    &background_thread_info[i].mtx);
-	}
-	malloc_mutex_postfork_child(tsdn, &background_thread_lock);
-	if (!background_thread_enabled_at_fork) {
-		return;
-	}
-
-	/* Clear background_thread state (reset to disabled for child). */
-	malloc_mutex_lock(tsdn, &background_thread_lock);
-	n_background_threads = 0;
-	background_thread_enabled_set(tsdn, false);
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		background_thread_info_t *info = &background_thread_info[i];
-		malloc_mutex_lock(tsdn, &info->mtx);
-		info->state = background_thread_stopped;
-		int ret = pthread_cond_init(&info->cond, NULL);
-		assert(ret == 0);
-		background_thread_info_init(tsdn, info);
-		malloc_mutex_unlock(tsdn, &info->mtx);
-	}
-	malloc_mutex_unlock(tsdn, &background_thread_lock);
-}
-
-bool
-background_thread_stats_read(tsdn_t *tsdn, background_thread_stats_t *stats) {
-	assert(config_stats);
-	malloc_mutex_lock(tsdn, &background_thread_lock);
-	if (!background_thread_enabled()) {
-		malloc_mutex_unlock(tsdn, &background_thread_lock);
-		return true;
-	}
-
-	stats->num_threads = n_background_threads;
-	uint64_t num_runs = 0;
-	nstime_init(&stats->run_interval, 0);
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		background_thread_info_t *info = &background_thread_info[i];
-		if (malloc_mutex_trylock(tsdn, &info->mtx)) {
-			/*
-			 * Each background thread run may take a long time;
-			 * avoid waiting on the stats if the thread is active.
-			 */
-			continue;
-		}
-		if (info->state != background_thread_stopped) {
-			num_runs += info->tot_n_runs;
-			nstime_add(&stats->run_interval, &info->tot_sleep_time);
-		}
-		malloc_mutex_unlock(tsdn, &info->mtx);
-	}
-	stats->num_runs = num_runs;
-	if (num_runs > 0) {
-		nstime_idivide(&stats->run_interval, num_runs);
-	}
-	malloc_mutex_unlock(tsdn, &background_thread_lock);
-
-	return false;
-}
-
-#undef BACKGROUND_THREAD_NPAGES_THRESHOLD
-#undef BILLION
-#undef BACKGROUND_THREAD_MIN_INTERVAL_NS
-
-static bool
-pthread_create_fptr_init(void) {
-	if (pthread_create_fptr != NULL) {
-		return false;
-	}
-	pthread_create_fptr = dlsym(RTLD_NEXT, "pthread_create");
-	if (pthread_create_fptr == NULL) {
-		can_enable_background_thread = false;
-		if (config_lazy_lock || opt_background_thread) {
-			malloc_write("<jemalloc>: Error in dlsym(RTLD_NEXT, "
-			    "\"pthread_create\")\n");
-			abort();
-		}
-	} else {
-		can_enable_background_thread = true;
-	}
-
-	return false;
-}
-
-/*
- * When lazy lock is enabled, we need to make sure setting isthreaded before
- * taking any background_thread locks.  This is called early in ctl (instead of
- * wait for the pthread_create calls to trigger) because the mutex is required
- * before creating background threads.
- */
-void
-background_thread_ctl_init(tsdn_t *tsdn) {
-	malloc_mutex_assert_not_owner(tsdn, &background_thread_lock);
-#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
-	pthread_create_fptr_init();
-	pthread_create_wrapper_init();
-#endif
-}
-
-#endif /* defined(JEMALLOC_BACKGROUND_THREAD) */
-
-bool
-background_thread_boot0(void) {
-	if (!have_background_thread && opt_background_thread) {
-		malloc_printf("<jemalloc>: option background_thread currently "
-		    "supports pthread only\n");
-		return true;
-	}
-#ifdef JEMALLOC_PTHREAD_CREATE_WRAPPER
-	if ((config_lazy_lock || opt_background_thread) &&
-	    pthread_create_fptr_init()) {
-		return true;
-	}
-#endif
-	return false;
-}
-
-bool
-background_thread_boot1(tsdn_t *tsdn) {
-#ifdef JEMALLOC_BACKGROUND_THREAD
-	assert(have_background_thread);
-	assert(narenas_total_get() > 0);
-
-	if (opt_max_background_threads == MAX_BACKGROUND_THREAD_LIMIT &&
-	    ncpus < MAX_BACKGROUND_THREAD_LIMIT) {
-		opt_max_background_threads = ncpus;
-	}
-	max_background_threads = opt_max_background_threads;
-
-	background_thread_enabled_set(tsdn, opt_background_thread);
-	if (malloc_mutex_init(&background_thread_lock,
-	    "background_thread_global",
-	    WITNESS_RANK_BACKGROUND_THREAD_GLOBAL,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-
-	background_thread_info = (background_thread_info_t *)base_alloc(tsdn,
-	    b0get(), opt_max_background_threads *
-	    sizeof(background_thread_info_t), CACHELINE);
-	if (background_thread_info == NULL) {
-		return true;
-	}
-
-	for (unsigned i = 0; i < max_background_threads; i++) {
-		background_thread_info_t *info = &background_thread_info[i];
-		/* Thread mutex is rank_inclusive because of thread0. */
-		if (malloc_mutex_init(&info->mtx, "background_thread",
-		    WITNESS_RANK_BACKGROUND_THREAD,
-		    malloc_mutex_address_ordered)) {
-			return true;
-		}
-		if (pthread_cond_init(&info->cond, NULL)) {
-			return true;
-		}
-		malloc_mutex_lock(tsdn, &info->mtx);
-		info->state = background_thread_stopped;
-		background_thread_info_init(tsdn, info);
-		malloc_mutex_unlock(tsdn, &info->mtx);
-	}
-#endif
-
-	return false;
-}
diff --git a/redis-stable/deps/jemalloc/src/base.c b/redis-stable/deps/jemalloc/src/base.c
deleted file mode 100644
index b0324b5d..00000000
--- a/redis-stable/deps/jemalloc/src/base.c
+++ /dev/null
@@ -1,514 +0,0 @@
-#define JEMALLOC_BASE_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/sz.h"
-
-/******************************************************************************/
-/* Data. */
-
-static base_t *b0;
-
-metadata_thp_mode_t opt_metadata_thp = METADATA_THP_DEFAULT;
-
-const char *metadata_thp_mode_names[] = {
-	"disabled",
-	"auto",
-	"always"
-};
-
-/******************************************************************************/
-
-static inline bool
-metadata_thp_madvise(void) {
-	return (metadata_thp_enabled() &&
-	    (init_system_thp_mode == thp_mode_default));
-}
-
-static void *
-base_map(tsdn_t *tsdn, extent_hooks_t *extent_hooks, unsigned ind, size_t size) {
-	void *addr;
-	bool zero = true;
-	bool commit = true;
-
-	/* Use huge page sizes and alignment regardless of opt_metadata_thp. */
-	assert(size == HUGEPAGE_CEILING(size));
-	size_t alignment = HUGEPAGE;
-	if (extent_hooks == &extent_hooks_default) {
-		addr = extent_alloc_mmap(NULL, size, alignment, &zero, &commit);
-	} else {
-		/* No arena context as we are creating new arenas. */
-		tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
-		pre_reentrancy(tsd, NULL);
-		addr = extent_hooks->alloc(extent_hooks, NULL, size, alignment,
-		    &zero, &commit, ind);
-		post_reentrancy(tsd);
-	}
-
-	return addr;
-}
-
-static void
-base_unmap(tsdn_t *tsdn, extent_hooks_t *extent_hooks, unsigned ind, void *addr,
-    size_t size) {
-	/*
-	 * Cascade through dalloc, decommit, purge_forced, and purge_lazy,
-	 * stopping at first success.  This cascade is performed for consistency
-	 * with the cascade in extent_dalloc_wrapper() because an application's
-	 * custom hooks may not support e.g. dalloc.  This function is only ever
-	 * called as a side effect of arena destruction, so although it might
-	 * seem pointless to do anything besides dalloc here, the application
-	 * may in fact want the end state of all associated virtual memory to be
-	 * in some consistent-but-allocated state.
-	 */
-	if (extent_hooks == &extent_hooks_default) {
-		if (!extent_dalloc_mmap(addr, size)) {
-			goto label_done;
-		}
-		if (!pages_decommit(addr, size)) {
-			goto label_done;
-		}
-		if (!pages_purge_forced(addr, size)) {
-			goto label_done;
-		}
-		if (!pages_purge_lazy(addr, size)) {
-			goto label_done;
-		}
-		/* Nothing worked.  This should never happen. */
-		not_reached();
-	} else {
-		tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
-		pre_reentrancy(tsd, NULL);
-		if (extent_hooks->dalloc != NULL &&
-		    !extent_hooks->dalloc(extent_hooks, addr, size, true,
-		    ind)) {
-			goto label_post_reentrancy;
-		}
-		if (extent_hooks->decommit != NULL &&
-		    !extent_hooks->decommit(extent_hooks, addr, size, 0, size,
-		    ind)) {
-			goto label_post_reentrancy;
-		}
-		if (extent_hooks->purge_forced != NULL &&
-		    !extent_hooks->purge_forced(extent_hooks, addr, size, 0,
-		    size, ind)) {
-			goto label_post_reentrancy;
-		}
-		if (extent_hooks->purge_lazy != NULL &&
-		    !extent_hooks->purge_lazy(extent_hooks, addr, size, 0, size,
-		    ind)) {
-			goto label_post_reentrancy;
-		}
-		/* Nothing worked.  That's the application's problem. */
-	label_post_reentrancy:
-		post_reentrancy(tsd);
-	}
-label_done:
-	if (metadata_thp_madvise()) {
-		/* Set NOHUGEPAGE after unmap to avoid kernel defrag. */
-		assert(((uintptr_t)addr & HUGEPAGE_MASK) == 0 &&
-		    (size & HUGEPAGE_MASK) == 0);
-		pages_nohuge(addr, size);
-	}
-}
-
-static void
-base_extent_init(size_t *extent_sn_next, extent_t *extent, void *addr,
-    size_t size) {
-	size_t sn;
-
-	sn = *extent_sn_next;
-	(*extent_sn_next)++;
-
-	extent_binit(extent, addr, size, sn);
-}
-
-static size_t
-base_get_num_blocks(base_t *base, bool with_new_block) {
-	base_block_t *b = base->blocks;
-	assert(b != NULL);
-
-	size_t n_blocks = with_new_block ? 2 : 1;
-	while (b->next != NULL) {
-		n_blocks++;
-		b = b->next;
-	}
-
-	return n_blocks;
-}
-
-static void
-base_auto_thp_switch(tsdn_t *tsdn, base_t *base) {
-	assert(opt_metadata_thp == metadata_thp_auto);
-	malloc_mutex_assert_owner(tsdn, &base->mtx);
-	if (base->auto_thp_switched) {
-		return;
-	}
-	/* Called when adding a new block. */
-	bool should_switch;
-	if (base_ind_get(base) != 0) {
-		should_switch = (base_get_num_blocks(base, true) ==
-		    BASE_AUTO_THP_THRESHOLD);
-	} else {
-		should_switch = (base_get_num_blocks(base, true) ==
-		    BASE_AUTO_THP_THRESHOLD_A0);
-	}
-	if (!should_switch) {
-		return;
-	}
-
-	base->auto_thp_switched = true;
-	assert(!config_stats || base->n_thp == 0);
-	/* Make the initial blocks THP lazily. */
-	base_block_t *block = base->blocks;
-	while (block != NULL) {
-		assert((block->size & HUGEPAGE_MASK) == 0);
-		pages_huge(block, block->size);
-		if (config_stats) {
-			base->n_thp += HUGEPAGE_CEILING(block->size -
-			    extent_bsize_get(&block->extent)) >> LG_HUGEPAGE;
-		}
-		block = block->next;
-		assert(block == NULL || (base_ind_get(base) == 0));
-	}
-}
-
-static void *
-base_extent_bump_alloc_helper(extent_t *extent, size_t *gap_size, size_t size,
-    size_t alignment) {
-	void *ret;
-
-	assert(alignment == ALIGNMENT_CEILING(alignment, QUANTUM));
-	assert(size == ALIGNMENT_CEILING(size, alignment));
-
-	*gap_size = ALIGNMENT_CEILING((uintptr_t)extent_addr_get(extent),
-	    alignment) - (uintptr_t)extent_addr_get(extent);
-	ret = (void *)((uintptr_t)extent_addr_get(extent) + *gap_size);
-	assert(extent_bsize_get(extent) >= *gap_size + size);
-	extent_binit(extent, (void *)((uintptr_t)extent_addr_get(extent) +
-	    *gap_size + size), extent_bsize_get(extent) - *gap_size - size,
-	    extent_sn_get(extent));
-	return ret;
-}
-
-static void
-base_extent_bump_alloc_post(base_t *base, extent_t *extent, size_t gap_size,
-    void *addr, size_t size) {
-	if (extent_bsize_get(extent) > 0) {
-		/*
-		 * Compute the index for the largest size class that does not
-		 * exceed extent's size.
-		 */
-		szind_t index_floor =
-		    sz_size2index(extent_bsize_get(extent) + 1) - 1;
-		extent_heap_insert(&base->avail[index_floor], extent);
-	}
-
-	if (config_stats) {
-		base->allocated += size;
-		/*
-		 * Add one PAGE to base_resident for every page boundary that is
-		 * crossed by the new allocation. Adjust n_thp similarly when
-		 * metadata_thp is enabled.
-		 */
-		base->resident += PAGE_CEILING((uintptr_t)addr + size) -
-		    PAGE_CEILING((uintptr_t)addr - gap_size);
-		assert(base->allocated <= base->resident);
-		assert(base->resident <= base->mapped);
-		if (metadata_thp_madvise() && (opt_metadata_thp ==
-		    metadata_thp_always || base->auto_thp_switched)) {
-			base->n_thp += (HUGEPAGE_CEILING((uintptr_t)addr + size)
-			    - HUGEPAGE_CEILING((uintptr_t)addr - gap_size)) >>
-			    LG_HUGEPAGE;
-			assert(base->mapped >= base->n_thp << LG_HUGEPAGE);
-		}
-	}
-}
-
-static void *
-base_extent_bump_alloc(base_t *base, extent_t *extent, size_t size,
-    size_t alignment) {
-	void *ret;
-	size_t gap_size;
-
-	ret = base_extent_bump_alloc_helper(extent, &gap_size, size, alignment);
-	base_extent_bump_alloc_post(base, extent, gap_size, ret, size);
-	return ret;
-}
-
-/*
- * Allocate a block of virtual memory that is large enough to start with a
- * base_block_t header, followed by an object of specified size and alignment.
- * On success a pointer to the initialized base_block_t header is returned.
- */
-static base_block_t *
-base_block_alloc(tsdn_t *tsdn, base_t *base, extent_hooks_t *extent_hooks,
-    unsigned ind, pszind_t *pind_last, size_t *extent_sn_next, size_t size,
-    size_t alignment) {
-	alignment = ALIGNMENT_CEILING(alignment, QUANTUM);
-	size_t usize = ALIGNMENT_CEILING(size, alignment);
-	size_t header_size = sizeof(base_block_t);
-	size_t gap_size = ALIGNMENT_CEILING(header_size, alignment) -
-	    header_size;
-	/*
-	 * Create increasingly larger blocks in order to limit the total number
-	 * of disjoint virtual memory ranges.  Choose the next size in the page
-	 * size class series (skipping size classes that are not a multiple of
-	 * HUGEPAGE), or a size large enough to satisfy the requested size and
-	 * alignment, whichever is larger.
-	 */
-	size_t min_block_size = HUGEPAGE_CEILING(sz_psz2u(header_size + gap_size
-	    + usize));
-	pszind_t pind_next = (*pind_last + 1 < NPSIZES) ? *pind_last + 1 :
-	    *pind_last;
-	size_t next_block_size = HUGEPAGE_CEILING(sz_pind2sz(pind_next));
-	size_t block_size = (min_block_size > next_block_size) ? min_block_size
-	    : next_block_size;
-	base_block_t *block = (base_block_t *)base_map(tsdn, extent_hooks, ind,
-	    block_size);
-	if (block == NULL) {
-		return NULL;
-	}
-
-	if (metadata_thp_madvise()) {
-		void *addr = (void *)block;
-		assert(((uintptr_t)addr & HUGEPAGE_MASK) == 0 &&
-		    (block_size & HUGEPAGE_MASK) == 0);
-		if (opt_metadata_thp == metadata_thp_always) {
-			pages_huge(addr, block_size);
-		} else if (opt_metadata_thp == metadata_thp_auto &&
-		    base != NULL) {
-			/* base != NULL indicates this is not a new base. */
-			malloc_mutex_lock(tsdn, &base->mtx);
-			base_auto_thp_switch(tsdn, base);
-			if (base->auto_thp_switched) {
-				pages_huge(addr, block_size);
-			}
-			malloc_mutex_unlock(tsdn, &base->mtx);
-		}
-	}
-
-	*pind_last = sz_psz2ind(block_size);
-	block->size = block_size;
-	block->next = NULL;
-	assert(block_size >= header_size);
-	base_extent_init(extent_sn_next, &block->extent,
-	    (void *)((uintptr_t)block + header_size), block_size - header_size);
-	return block;
-}
-
-/*
- * Allocate an extent that is at least as large as specified size, with
- * specified alignment.
- */
-static extent_t *
-base_extent_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment) {
-	malloc_mutex_assert_owner(tsdn, &base->mtx);
-
-	extent_hooks_t *extent_hooks = base_extent_hooks_get(base);
-	/*
-	 * Drop mutex during base_block_alloc(), because an extent hook will be
-	 * called.
-	 */
-	malloc_mutex_unlock(tsdn, &base->mtx);
-	base_block_t *block = base_block_alloc(tsdn, base, extent_hooks,
-	    base_ind_get(base), &base->pind_last, &base->extent_sn_next, size,
-	    alignment);
-	malloc_mutex_lock(tsdn, &base->mtx);
-	if (block == NULL) {
-		return NULL;
-	}
-	block->next = base->blocks;
-	base->blocks = block;
-	if (config_stats) {
-		base->allocated += sizeof(base_block_t);
-		base->resident += PAGE_CEILING(sizeof(base_block_t));
-		base->mapped += block->size;
-		if (metadata_thp_madvise() &&
-		    !(opt_metadata_thp == metadata_thp_auto
-		      && !base->auto_thp_switched)) {
-			assert(base->n_thp > 0);
-			base->n_thp += HUGEPAGE_CEILING(sizeof(base_block_t)) >>
-			    LG_HUGEPAGE;
-		}
-		assert(base->allocated <= base->resident);
-		assert(base->resident <= base->mapped);
-		assert(base->n_thp << LG_HUGEPAGE <= base->mapped);
-	}
-	return &block->extent;
-}
-
-base_t *
-b0get(void) {
-	return b0;
-}
-
-base_t *
-base_new(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
-	pszind_t pind_last = 0;
-	size_t extent_sn_next = 0;
-	base_block_t *block = base_block_alloc(tsdn, NULL, extent_hooks, ind,
-	    &pind_last, &extent_sn_next, sizeof(base_t), QUANTUM);
-	if (block == NULL) {
-		return NULL;
-	}
-
-	size_t gap_size;
-	size_t base_alignment = CACHELINE;
-	size_t base_size = ALIGNMENT_CEILING(sizeof(base_t), base_alignment);
-	base_t *base = (base_t *)base_extent_bump_alloc_helper(&block->extent,
-	    &gap_size, base_size, base_alignment);
-	base->ind = ind;
-	atomic_store_p(&base->extent_hooks, extent_hooks, ATOMIC_RELAXED);
-	if (malloc_mutex_init(&base->mtx, "base", WITNESS_RANK_BASE,
-	    malloc_mutex_rank_exclusive)) {
-		base_unmap(tsdn, extent_hooks, ind, block, block->size);
-		return NULL;
-	}
-	base->pind_last = pind_last;
-	base->extent_sn_next = extent_sn_next;
-	base->blocks = block;
-	base->auto_thp_switched = false;
-	for (szind_t i = 0; i < NSIZES; i++) {
-		extent_heap_new(&base->avail[i]);
-	}
-	if (config_stats) {
-		base->allocated = sizeof(base_block_t);
-		base->resident = PAGE_CEILING(sizeof(base_block_t));
-		base->mapped = block->size;
-		base->n_thp = (opt_metadata_thp == metadata_thp_always) &&
-		    metadata_thp_madvise() ? HUGEPAGE_CEILING(sizeof(base_block_t))
-		    >> LG_HUGEPAGE : 0;
-		assert(base->allocated <= base->resident);
-		assert(base->resident <= base->mapped);
-		assert(base->n_thp << LG_HUGEPAGE <= base->mapped);
-	}
-	base_extent_bump_alloc_post(base, &block->extent, gap_size, base,
-	    base_size);
-
-	return base;
-}
-
-void
-base_delete(tsdn_t *tsdn, base_t *base) {
-	extent_hooks_t *extent_hooks = base_extent_hooks_get(base);
-	base_block_t *next = base->blocks;
-	do {
-		base_block_t *block = next;
-		next = block->next;
-		base_unmap(tsdn, extent_hooks, base_ind_get(base), block,
-		    block->size);
-	} while (next != NULL);
-}
-
-extent_hooks_t *
-base_extent_hooks_get(base_t *base) {
-	return (extent_hooks_t *)atomic_load_p(&base->extent_hooks,
-	    ATOMIC_ACQUIRE);
-}
-
-extent_hooks_t *
-base_extent_hooks_set(base_t *base, extent_hooks_t *extent_hooks) {
-	extent_hooks_t *old_extent_hooks = base_extent_hooks_get(base);
-	atomic_store_p(&base->extent_hooks, extent_hooks, ATOMIC_RELEASE);
-	return old_extent_hooks;
-}
-
-static void *
-base_alloc_impl(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment,
-    size_t *esn) {
-	alignment = QUANTUM_CEILING(alignment);
-	size_t usize = ALIGNMENT_CEILING(size, alignment);
-	size_t asize = usize + alignment - QUANTUM;
-
-	extent_t *extent = NULL;
-	malloc_mutex_lock(tsdn, &base->mtx);
-	for (szind_t i = sz_size2index(asize); i < NSIZES; i++) {
-		extent = extent_heap_remove_first(&base->avail[i]);
-		if (extent != NULL) {
-			/* Use existing space. */
-			break;
-		}
-	}
-	if (extent == NULL) {
-		/* Try to allocate more space. */
-		extent = base_extent_alloc(tsdn, base, usize, alignment);
-	}
-	void *ret;
-	if (extent == NULL) {
-		ret = NULL;
-		goto label_return;
-	}
-
-	ret = base_extent_bump_alloc(base, extent, usize, alignment);
-	if (esn != NULL) {
-		*esn = extent_sn_get(extent);
-	}
-label_return:
-	malloc_mutex_unlock(tsdn, &base->mtx);
-	return ret;
-}
-
-/*
- * base_alloc() returns zeroed memory, which is always demand-zeroed for the
- * auto arenas, in order to make multi-page sparse data structures such as radix
- * tree nodes efficient with respect to physical memory usage.  Upon success a
- * pointer to at least size bytes with specified alignment is returned.  Note
- * that size is rounded up to the nearest multiple of alignment to avoid false
- * sharing.
- */
-void *
-base_alloc(tsdn_t *tsdn, base_t *base, size_t size, size_t alignment) {
-	return base_alloc_impl(tsdn, base, size, alignment, NULL);
-}
-
-extent_t *
-base_alloc_extent(tsdn_t *tsdn, base_t *base) {
-	size_t esn;
-	extent_t *extent = base_alloc_impl(tsdn, base, sizeof(extent_t),
-	    CACHELINE, &esn);
-	if (extent == NULL) {
-		return NULL;
-	}
-	extent_esn_set(extent, esn);
-	return extent;
-}
-
-void
-base_stats_get(tsdn_t *tsdn, base_t *base, size_t *allocated, size_t *resident,
-    size_t *mapped, size_t *n_thp) {
-	cassert(config_stats);
-
-	malloc_mutex_lock(tsdn, &base->mtx);
-	assert(base->allocated <= base->resident);
-	assert(base->resident <= base->mapped);
-	*allocated = base->allocated;
-	*resident = base->resident;
-	*mapped = base->mapped;
-	*n_thp = base->n_thp;
-	malloc_mutex_unlock(tsdn, &base->mtx);
-}
-
-void
-base_prefork(tsdn_t *tsdn, base_t *base) {
-	malloc_mutex_prefork(tsdn, &base->mtx);
-}
-
-void
-base_postfork_parent(tsdn_t *tsdn, base_t *base) {
-	malloc_mutex_postfork_parent(tsdn, &base->mtx);
-}
-
-void
-base_postfork_child(tsdn_t *tsdn, base_t *base) {
-	malloc_mutex_postfork_child(tsdn, &base->mtx);
-}
-
-bool
-base_boot(tsdn_t *tsdn) {
-	b0 = base_new(tsdn, 0, (extent_hooks_t *)&extent_hooks_default);
-	return (b0 == NULL);
-}
diff --git a/redis-stable/deps/jemalloc/src/bin.c b/redis-stable/deps/jemalloc/src/bin.c
deleted file mode 100644
index 0886bc4e..00000000
--- a/redis-stable/deps/jemalloc/src/bin.c
+++ /dev/null
@@ -1,50 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/bin.h"
-#include "jemalloc/internal/witness.h"
-
-const bin_info_t bin_infos[NBINS] = {
-#define BIN_INFO_bin_yes(reg_size, slab_size, nregs)			\
-	{reg_size, slab_size, nregs, BITMAP_INFO_INITIALIZER(nregs)},
-#define BIN_INFO_bin_no(reg_size, slab_size, nregs)
-#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs,		\
-    lg_delta_lookup)							\
-	BIN_INFO_bin_##bin((1U<<lg_grp) + (ndelta<<lg_delta),		\
-	    (pgs << LG_PAGE), (pgs << LG_PAGE) / ((1U<<lg_grp) +	\
-	    (ndelta<<lg_delta)))
-	SIZE_CLASSES
-#undef BIN_INFO_bin_yes
-#undef BIN_INFO_bin_no
-#undef SC
-};
-
-bool
-bin_init(bin_t *bin) {
-	if (malloc_mutex_init(&bin->lock, "bin", WITNESS_RANK_BIN,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-	bin->slabcur = NULL;
-	extent_heap_new(&bin->slabs_nonfull);
-	extent_list_init(&bin->slabs_full);
-	if (config_stats) {
-		memset(&bin->stats, 0, sizeof(bin_stats_t));
-	}
-	return false;
-}
-
-void
-bin_prefork(tsdn_t *tsdn, bin_t *bin) {
-	malloc_mutex_prefork(tsdn, &bin->lock);
-}
-
-void
-bin_postfork_parent(tsdn_t *tsdn, bin_t *bin) {
-	malloc_mutex_postfork_parent(tsdn, &bin->lock);
-}
-
-void
-bin_postfork_child(tsdn_t *tsdn, bin_t *bin) {
-	malloc_mutex_postfork_child(tsdn, &bin->lock);
-}
diff --git a/redis-stable/deps/jemalloc/src/bitmap.c b/redis-stable/deps/jemalloc/src/bitmap.c
deleted file mode 100644
index 468b3178..00000000
--- a/redis-stable/deps/jemalloc/src/bitmap.c
+++ /dev/null
@@ -1,121 +0,0 @@
-#define JEMALLOC_BITMAP_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-
-/******************************************************************************/
-
-#ifdef BITMAP_USE_TREE
-
-void
-bitmap_info_init(bitmap_info_t *binfo, size_t nbits) {
-	unsigned i;
-	size_t group_count;
-
-	assert(nbits > 0);
-	assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
-
-	/*
-	 * Compute the number of groups necessary to store nbits bits, and
-	 * progressively work upward through the levels until reaching a level
-	 * that requires only one group.
-	 */
-	binfo->levels[0].group_offset = 0;
-	group_count = BITMAP_BITS2GROUPS(nbits);
-	for (i = 1; group_count > 1; i++) {
-		assert(i < BITMAP_MAX_LEVELS);
-		binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
-		    + group_count;
-		group_count = BITMAP_BITS2GROUPS(group_count);
-	}
-	binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
-	    + group_count;
-	assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX);
-	binfo->nlevels = i;
-	binfo->nbits = nbits;
-}
-
-static size_t
-bitmap_info_ngroups(const bitmap_info_t *binfo) {
-	return binfo->levels[binfo->nlevels].group_offset;
-}
-
-void
-bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill) {
-	size_t extra;
-	unsigned i;
-
-	/*
-	 * Bits are actually inverted with regard to the external bitmap
-	 * interface.
-	 */
-
-	if (fill) {
-		/* The "filled" bitmap starts out with all 0 bits. */
-		memset(bitmap, 0, bitmap_size(binfo));
-		return;
-	}
-
-	/*
-	 * The "empty" bitmap starts out with all 1 bits, except for trailing
-	 * unused bits (if any).  Note that each group uses bit 0 to correspond
-	 * to the first logical bit in the group, so extra bits are the most
-	 * significant bits of the last group.
-	 */
-	memset(bitmap, 0xffU, bitmap_size(binfo));
-	extra = (BITMAP_GROUP_NBITS - (binfo->nbits & BITMAP_GROUP_NBITS_MASK))
-	    & BITMAP_GROUP_NBITS_MASK;
-	if (extra != 0) {
-		bitmap[binfo->levels[1].group_offset - 1] >>= extra;
-	}
-	for (i = 1; i < binfo->nlevels; i++) {
-		size_t group_count = binfo->levels[i].group_offset -
-		    binfo->levels[i-1].group_offset;
-		extra = (BITMAP_GROUP_NBITS - (group_count &
-		    BITMAP_GROUP_NBITS_MASK)) & BITMAP_GROUP_NBITS_MASK;
-		if (extra != 0) {
-			bitmap[binfo->levels[i+1].group_offset - 1] >>= extra;
-		}
-	}
-}
-
-#else /* BITMAP_USE_TREE */
-
-void
-bitmap_info_init(bitmap_info_t *binfo, size_t nbits) {
-	assert(nbits > 0);
-	assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
-
-	binfo->ngroups = BITMAP_BITS2GROUPS(nbits);
-	binfo->nbits = nbits;
-}
-
-static size_t
-bitmap_info_ngroups(const bitmap_info_t *binfo) {
-	return binfo->ngroups;
-}
-
-void
-bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo, bool fill) {
-	size_t extra;
-
-	if (fill) {
-		memset(bitmap, 0, bitmap_size(binfo));
-		return;
-	}
-
-	memset(bitmap, 0xffU, bitmap_size(binfo));
-	extra = (BITMAP_GROUP_NBITS - (binfo->nbits & BITMAP_GROUP_NBITS_MASK))
-	    & BITMAP_GROUP_NBITS_MASK;
-	if (extra != 0) {
-		bitmap[binfo->ngroups - 1] >>= extra;
-	}
-}
-
-#endif /* BITMAP_USE_TREE */
-
-size_t
-bitmap_size(const bitmap_info_t *binfo) {
-	return (bitmap_info_ngroups(binfo) << LG_SIZEOF_BITMAP);
-}
diff --git a/redis-stable/deps/jemalloc/src/ckh.c b/redis-stable/deps/jemalloc/src/ckh.c
deleted file mode 100644
index e95e0a3e..00000000
--- a/redis-stable/deps/jemalloc/src/ckh.c
+++ /dev/null
@@ -1,569 +0,0 @@
-/*
- *******************************************************************************
- * Implementation of (2^1+,2) cuckoo hashing, where 2^1+ indicates that each
- * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
- * functions are employed.  The original cuckoo hashing algorithm was described
- * in:
- *
- *   Pagh, R., F.F. Rodler (2004) Cuckoo Hashing.  Journal of Algorithms
- *     51(2):122-144.
- *
- * Generalization of cuckoo hashing was discussed in:
- *
- *   Erlingsson, U., M. Manasse, F. McSherry (2006) A cool and practical
- *     alternative to traditional hash tables.  In Proceedings of the 7th
- *     Workshop on Distributed Data and Structures (WDAS'06), Santa Clara, CA,
- *     January 2006.
- *
- * This implementation uses precisely two hash functions because that is the
- * fewest that can work, and supporting multiple hashes is an implementation
- * burden.  Here is a reproduction of Figure 1 from Erlingsson et al. (2006)
- * that shows approximate expected maximum load factors for various
- * configurations:
- *
- *           |         #cells/bucket         |
- *   #hashes |   1   |   2   |   4   |   8   |
- *   --------+-------+-------+-------+-------+
- *         1 | 0.006 | 0.006 | 0.03  | 0.12  |
- *         2 | 0.49  | 0.86  |>0.93< |>0.96< |
- *         3 | 0.91  | 0.97  | 0.98  | 0.999 |
- *         4 | 0.97  | 0.99  | 0.999 |       |
- *
- * The number of cells per bucket is chosen such that a bucket fits in one cache
- * line.  So, on 32- and 64-bit systems, we use (8,2) and (4,2) cuckoo hashing,
- * respectively.
- *
- ******************************************************************************/
-#define JEMALLOC_CKH_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-
-#include "jemalloc/internal/ckh.h"
-
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/hash.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/prng.h"
-#include "jemalloc/internal/util.h"
-
-/******************************************************************************/
-/* Function prototypes for non-inline static functions. */
-
-static bool	ckh_grow(tsd_t *tsd, ckh_t *ckh);
-static void	ckh_shrink(tsd_t *tsd, ckh_t *ckh);
-
-/******************************************************************************/
-
-/*
- * Search bucket for key and return the cell number if found; SIZE_T_MAX
- * otherwise.
- */
-static size_t
-ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
-	ckhc_t *cell;
-	unsigned i;
-
-	for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) {
-		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
-		if (cell->key != NULL && ckh->keycomp(key, cell->key)) {
-			return (bucket << LG_CKH_BUCKET_CELLS) + i;
-		}
-	}
-
-	return SIZE_T_MAX;
-}
-
-/*
- * Search table for key and return cell number if found; SIZE_T_MAX otherwise.
- */
-static size_t
-ckh_isearch(ckh_t *ckh, const void *key) {
-	size_t hashes[2], bucket, cell;
-
-	assert(ckh != NULL);
-
-	ckh->hash(key, hashes);
-
-	/* Search primary bucket. */
-	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
-	cell = ckh_bucket_search(ckh, bucket, key);
-	if (cell != SIZE_T_MAX) {
-		return cell;
-	}
-
-	/* Search secondary bucket. */
-	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
-	cell = ckh_bucket_search(ckh, bucket, key);
-	return cell;
-}
-
-static bool
-ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key,
-    const void *data) {
-	ckhc_t *cell;
-	unsigned offset, i;
-
-	/*
-	 * Cycle through the cells in the bucket, starting at a random position.
-	 * The randomness avoids worst-case search overhead as buckets fill up.
-	 */
-	offset = (unsigned)prng_lg_range_u64(&ckh->prng_state,
-	    LG_CKH_BUCKET_CELLS);
-	for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) {
-		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +
-		    ((i + offset) & ((ZU(1) << LG_CKH_BUCKET_CELLS) - 1))];
-		if (cell->key == NULL) {
-			cell->key = key;
-			cell->data = data;
-			ckh->count++;
-			return false;
-		}
-	}
-
-	return true;
-}
-
-/*
- * No space is available in bucket.  Randomly evict an item, then try to find an
- * alternate location for that item.  Iteratively repeat this
- * eviction/relocation procedure until either success or detection of an
- * eviction/relocation bucket cycle.
- */
-static bool
-ckh_evict_reloc_insert(ckh_t *ckh, size_t argbucket, void const **argkey,
-    void const **argdata) {
-	const void *key, *data, *tkey, *tdata;
-	ckhc_t *cell;
-	size_t hashes[2], bucket, tbucket;
-	unsigned i;
-
-	bucket = argbucket;
-	key = *argkey;
-	data = *argdata;
-	while (true) {
-		/*
-		 * Choose a random item within the bucket to evict.  This is
-		 * critical to correct function, because without (eventually)
-		 * evicting all items within a bucket during iteration, it
-		 * would be possible to get stuck in an infinite loop if there
-		 * were an item for which both hashes indicated the same
-		 * bucket.
-		 */
-		i = (unsigned)prng_lg_range_u64(&ckh->prng_state,
-		    LG_CKH_BUCKET_CELLS);
-		cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
-		assert(cell->key != NULL);
-
-		/* Swap cell->{key,data} and {key,data} (evict). */
-		tkey = cell->key; tdata = cell->data;
-		cell->key = key; cell->data = data;
-		key = tkey; data = tdata;
-
-#ifdef CKH_COUNT
-		ckh->nrelocs++;
-#endif
-
-		/* Find the alternate bucket for the evicted item. */
-		ckh->hash(key, hashes);
-		tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
-		if (tbucket == bucket) {
-			tbucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets)
-			    - 1);
-			/*
-			 * It may be that (tbucket == bucket) still, if the
-			 * item's hashes both indicate this bucket.  However,
-			 * we are guaranteed to eventually escape this bucket
-			 * during iteration, assuming pseudo-random item
-			 * selection (true randomness would make infinite
-			 * looping a remote possibility).  The reason we can
-			 * never get trapped forever is that there are two
-			 * cases:
-			 *
-			 * 1) This bucket == argbucket, so we will quickly
-			 *    detect an eviction cycle and terminate.
-			 * 2) An item was evicted to this bucket from another,
-			 *    which means that at least one item in this bucket
-			 *    has hashes that indicate distinct buckets.
-			 */
-		}
-		/* Check for a cycle. */
-		if (tbucket == argbucket) {
-			*argkey = key;
-			*argdata = data;
-			return true;
-		}
-
-		bucket = tbucket;
-		if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
-			return false;
-		}
-	}
-}
-
-static bool
-ckh_try_insert(ckh_t *ckh, void const**argkey, void const**argdata) {
-	size_t hashes[2], bucket;
-	const void *key = *argkey;
-	const void *data = *argdata;
-
-	ckh->hash(key, hashes);
-
-	/* Try to insert in primary bucket. */
-	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
-	if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
-		return false;
-	}
-
-	/* Try to insert in secondary bucket. */
-	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
-	if (!ckh_try_bucket_insert(ckh, bucket, key, data)) {
-		return false;
-	}
-
-	/*
-	 * Try to find a place for this item via iterative eviction/relocation.
-	 */
-	return ckh_evict_reloc_insert(ckh, bucket, argkey, argdata);
-}
-
-/*
- * Try to rebuild the hash table from scratch by inserting all items from the
- * old table into the new.
- */
-static bool
-ckh_rebuild(ckh_t *ckh, ckhc_t *aTab) {
-	size_t count, i, nins;
-	const void *key, *data;
-
-	count = ckh->count;
-	ckh->count = 0;
-	for (i = nins = 0; nins < count; i++) {
-		if (aTab[i].key != NULL) {
-			key = aTab[i].key;
-			data = aTab[i].data;
-			if (ckh_try_insert(ckh, &key, &data)) {
-				ckh->count = count;
-				return true;
-			}
-			nins++;
-		}
-	}
-
-	return false;
-}
-
-static bool
-ckh_grow(tsd_t *tsd, ckh_t *ckh) {
-	bool ret;
-	ckhc_t *tab, *ttab;
-	unsigned lg_prevbuckets, lg_curcells;
-
-#ifdef CKH_COUNT
-	ckh->ngrows++;
-#endif
-
-	/*
-	 * It is possible (though unlikely, given well behaved hashes) that the
-	 * table will have to be doubled more than once in order to create a
-	 * usable table.
-	 */
-	lg_prevbuckets = ckh->lg_curbuckets;
-	lg_curcells = ckh->lg_curbuckets + LG_CKH_BUCKET_CELLS;
-	while (true) {
-		size_t usize;
-
-		lg_curcells++;
-		usize = sz_sa2u(sizeof(ckhc_t) << lg_curcells, CACHELINE);
-		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-			ret = true;
-			goto label_return;
-		}
-		tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE,
-		    true, NULL, true, arena_ichoose(tsd, NULL));
-		if (tab == NULL) {
-			ret = true;
-			goto label_return;
-		}
-		/* Swap in new table. */
-		ttab = ckh->tab;
-		ckh->tab = tab;
-		tab = ttab;
-		ckh->lg_curbuckets = lg_curcells - LG_CKH_BUCKET_CELLS;
-
-		if (!ckh_rebuild(ckh, tab)) {
-			idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true);
-			break;
-		}
-
-		/* Rebuilding failed, so back out partially rebuilt table. */
-		idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
-		ckh->tab = tab;
-		ckh->lg_curbuckets = lg_prevbuckets;
-	}
-
-	ret = false;
-label_return:
-	return ret;
-}
-
-static void
-ckh_shrink(tsd_t *tsd, ckh_t *ckh) {
-	ckhc_t *tab, *ttab;
-	size_t usize;
-	unsigned lg_prevbuckets, lg_curcells;
-
-	/*
-	 * It is possible (though unlikely, given well behaved hashes) that the
-	 * table rebuild will fail.
-	 */
-	lg_prevbuckets = ckh->lg_curbuckets;
-	lg_curcells = ckh->lg_curbuckets + LG_CKH_BUCKET_CELLS - 1;
-	usize = sz_sa2u(sizeof(ckhc_t) << lg_curcells, CACHELINE);
-	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-		return;
-	}
-	tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE, true, NULL,
-	    true, arena_ichoose(tsd, NULL));
-	if (tab == NULL) {
-		/*
-		 * An OOM error isn't worth propagating, since it doesn't
-		 * prevent this or future operations from proceeding.
-		 */
-		return;
-	}
-	/* Swap in new table. */
-	ttab = ckh->tab;
-	ckh->tab = tab;
-	tab = ttab;
-	ckh->lg_curbuckets = lg_curcells - LG_CKH_BUCKET_CELLS;
-
-	if (!ckh_rebuild(ckh, tab)) {
-		idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true);
-#ifdef CKH_COUNT
-		ckh->nshrinks++;
-#endif
-		return;
-	}
-
-	/* Rebuilding failed, so back out partially rebuilt table. */
-	idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
-	ckh->tab = tab;
-	ckh->lg_curbuckets = lg_prevbuckets;
-#ifdef CKH_COUNT
-	ckh->nshrinkfails++;
-#endif
-}
-
-bool
-ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
-    ckh_keycomp_t *keycomp) {
-	bool ret;
-	size_t mincells, usize;
-	unsigned lg_mincells;
-
-	assert(minitems > 0);
-	assert(hash != NULL);
-	assert(keycomp != NULL);
-
-#ifdef CKH_COUNT
-	ckh->ngrows = 0;
-	ckh->nshrinks = 0;
-	ckh->nshrinkfails = 0;
-	ckh->ninserts = 0;
-	ckh->nrelocs = 0;
-#endif
-	ckh->prng_state = 42; /* Value doesn't really matter. */
-	ckh->count = 0;
-
-	/*
-	 * Find the minimum power of 2 that is large enough to fit minitems
-	 * entries.  We are using (2+,2) cuckoo hashing, which has an expected
-	 * maximum load factor of at least ~0.86, so 0.75 is a conservative load
-	 * factor that will typically allow mincells items to fit without ever
-	 * growing the table.
-	 */
-	assert(LG_CKH_BUCKET_CELLS > 0);
-	mincells = ((minitems + (3 - (minitems % 3))) / 3) << 2;
-	for (lg_mincells = LG_CKH_BUCKET_CELLS;
-	    (ZU(1) << lg_mincells) < mincells;
-	    lg_mincells++) {
-		/* Do nothing. */
-	}
-	ckh->lg_minbuckets = lg_mincells - LG_CKH_BUCKET_CELLS;
-	ckh->lg_curbuckets = lg_mincells - LG_CKH_BUCKET_CELLS;
-	ckh->hash = hash;
-	ckh->keycomp = keycomp;
-
-	usize = sz_sa2u(sizeof(ckhc_t) << lg_mincells, CACHELINE);
-	if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-		ret = true;
-		goto label_return;
-	}
-	ckh->tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE, true,
-	    NULL, true, arena_ichoose(tsd, NULL));
-	if (ckh->tab == NULL) {
-		ret = true;
-		goto label_return;
-	}
-
-	ret = false;
-label_return:
-	return ret;
-}
-
-void
-ckh_delete(tsd_t *tsd, ckh_t *ckh) {
-	assert(ckh != NULL);
-
-#ifdef CKH_VERBOSE
-	malloc_printf(
-	    "%s(%p): ngrows: %"FMTu64", nshrinks: %"FMTu64","
-	    " nshrinkfails: %"FMTu64", ninserts: %"FMTu64","
-	    " nrelocs: %"FMTu64"\n", __func__, ckh,
-	    (unsigned long long)ckh->ngrows,
-	    (unsigned long long)ckh->nshrinks,
-	    (unsigned long long)ckh->nshrinkfails,
-	    (unsigned long long)ckh->ninserts,
-	    (unsigned long long)ckh->nrelocs);
-#endif
-
-	idalloctm(tsd_tsdn(tsd), ckh->tab, NULL, NULL, true, true);
-	if (config_debug) {
-		memset(ckh, JEMALLOC_FREE_JUNK, sizeof(ckh_t));
-	}
-}
-
-size_t
-ckh_count(ckh_t *ckh) {
-	assert(ckh != NULL);
-
-	return ckh->count;
-}
-
-bool
-ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data) {
-	size_t i, ncells;
-
-	for (i = *tabind, ncells = (ZU(1) << (ckh->lg_curbuckets +
-	    LG_CKH_BUCKET_CELLS)); i < ncells; i++) {
-		if (ckh->tab[i].key != NULL) {
-			if (key != NULL) {
-				*key = (void *)ckh->tab[i].key;
-			}
-			if (data != NULL) {
-				*data = (void *)ckh->tab[i].data;
-			}
-			*tabind = i + 1;
-			return false;
-		}
-	}
-
-	return true;
-}
-
-bool
-ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data) {
-	bool ret;
-
-	assert(ckh != NULL);
-	assert(ckh_search(ckh, key, NULL, NULL));
-
-#ifdef CKH_COUNT
-	ckh->ninserts++;
-#endif
-
-	while (ckh_try_insert(ckh, &key, &data)) {
-		if (ckh_grow(tsd, ckh)) {
-			ret = true;
-			goto label_return;
-		}
-	}
-
-	ret = false;
-label_return:
-	return ret;
-}
-
-bool
-ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key,
-    void **data) {
-	size_t cell;
-
-	assert(ckh != NULL);
-
-	cell = ckh_isearch(ckh, searchkey);
-	if (cell != SIZE_T_MAX) {
-		if (key != NULL) {
-			*key = (void *)ckh->tab[cell].key;
-		}
-		if (data != NULL) {
-			*data = (void *)ckh->tab[cell].data;
-		}
-		ckh->tab[cell].key = NULL;
-		ckh->tab[cell].data = NULL; /* Not necessary. */
-
-		ckh->count--;
-		/* Try to halve the table if it is less than 1/4 full. */
-		if (ckh->count < (ZU(1) << (ckh->lg_curbuckets
-		    + LG_CKH_BUCKET_CELLS - 2)) && ckh->lg_curbuckets
-		    > ckh->lg_minbuckets) {
-			/* Ignore error due to OOM. */
-			ckh_shrink(tsd, ckh);
-		}
-
-		return false;
-	}
-
-	return true;
-}
-
-bool
-ckh_search(ckh_t *ckh, const void *searchkey, void **key, void **data) {
-	size_t cell;
-
-	assert(ckh != NULL);
-
-	cell = ckh_isearch(ckh, searchkey);
-	if (cell != SIZE_T_MAX) {
-		if (key != NULL) {
-			*key = (void *)ckh->tab[cell].key;
-		}
-		if (data != NULL) {
-			*data = (void *)ckh->tab[cell].data;
-		}
-		return false;
-	}
-
-	return true;
-}
-
-void
-ckh_string_hash(const void *key, size_t r_hash[2]) {
-	hash(key, strlen((const char *)key), 0x94122f33U, r_hash);
-}
-
-bool
-ckh_string_keycomp(const void *k1, const void *k2) {
-	assert(k1 != NULL);
-	assert(k2 != NULL);
-
-	return !strcmp((char *)k1, (char *)k2);
-}
-
-void
-ckh_pointer_hash(const void *key, size_t r_hash[2]) {
-	union {
-		const void	*v;
-		size_t		i;
-	} u;
-
-	assert(sizeof(u.v) == sizeof(u.i));
-	u.v = key;
-	hash(&u.i, sizeof(u.i), 0xd983396eU, r_hash);
-}
-
-bool
-ckh_pointer_keycomp(const void *k1, const void *k2) {
-	return (k1 == k2);
-}
diff --git a/redis-stable/deps/jemalloc/src/ctl.c b/redis-stable/deps/jemalloc/src/ctl.c
deleted file mode 100644
index 1e713a3d..00000000
--- a/redis-stable/deps/jemalloc/src/ctl.c
+++ /dev/null
@@ -1,2883 +0,0 @@
-#define JEMALLOC_CTL_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/ctl.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/nstime.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/util.h"
-
-/******************************************************************************/
-/* Data. */
-
-/*
- * ctl_mtx protects the following:
- * - ctl_stats->*
- */
-static malloc_mutex_t	ctl_mtx;
-static bool		ctl_initialized;
-static ctl_stats_t	*ctl_stats;
-static ctl_arenas_t	*ctl_arenas;
-
-/******************************************************************************/
-/* Helpers for named and indexed nodes. */
-
-static const ctl_named_node_t *
-ctl_named_node(const ctl_node_t *node) {
-	return ((node->named) ? (const ctl_named_node_t *)node : NULL);
-}
-
-static const ctl_named_node_t *
-ctl_named_children(const ctl_named_node_t *node, size_t index) {
-	const ctl_named_node_t *children = ctl_named_node(node->children);
-
-	return (children ? &children[index] : NULL);
-}
-
-static const ctl_indexed_node_t *
-ctl_indexed_node(const ctl_node_t *node) {
-	return (!node->named ? (const ctl_indexed_node_t *)node : NULL);
-}
-
-/******************************************************************************/
-/* Function prototypes for non-inline static functions. */
-
-#define CTL_PROTO(n)							\
-static int	n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,	\
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen);
-
-#define INDEX_PROTO(n)							\
-static const ctl_named_node_t	*n##_index(tsdn_t *tsdn,		\
-    const size_t *mib, size_t miblen, size_t i);
-
-CTL_PROTO(version)
-CTL_PROTO(epoch)
-CTL_PROTO(background_thread)
-CTL_PROTO(max_background_threads)
-CTL_PROTO(thread_tcache_enabled)
-CTL_PROTO(thread_tcache_flush)
-CTL_PROTO(thread_prof_name)
-CTL_PROTO(thread_prof_active)
-CTL_PROTO(thread_arena)
-CTL_PROTO(thread_allocated)
-CTL_PROTO(thread_allocatedp)
-CTL_PROTO(thread_deallocated)
-CTL_PROTO(thread_deallocatedp)
-CTL_PROTO(config_cache_oblivious)
-CTL_PROTO(config_debug)
-CTL_PROTO(config_fill)
-CTL_PROTO(config_lazy_lock)
-CTL_PROTO(config_malloc_conf)
-CTL_PROTO(config_prof)
-CTL_PROTO(config_prof_libgcc)
-CTL_PROTO(config_prof_libunwind)
-CTL_PROTO(config_stats)
-CTL_PROTO(config_utrace)
-CTL_PROTO(config_xmalloc)
-CTL_PROTO(opt_abort)
-CTL_PROTO(opt_abort_conf)
-CTL_PROTO(opt_metadata_thp)
-CTL_PROTO(opt_retain)
-CTL_PROTO(opt_dss)
-CTL_PROTO(opt_narenas)
-CTL_PROTO(opt_percpu_arena)
-CTL_PROTO(opt_background_thread)
-CTL_PROTO(opt_max_background_threads)
-CTL_PROTO(opt_dirty_decay_ms)
-CTL_PROTO(opt_muzzy_decay_ms)
-CTL_PROTO(opt_stats_print)
-CTL_PROTO(opt_stats_print_opts)
-CTL_PROTO(opt_junk)
-CTL_PROTO(opt_zero)
-CTL_PROTO(opt_utrace)
-CTL_PROTO(opt_xmalloc)
-CTL_PROTO(opt_tcache)
-CTL_PROTO(opt_thp)
-CTL_PROTO(opt_lg_extent_max_active_fit)
-CTL_PROTO(opt_lg_tcache_max)
-CTL_PROTO(opt_prof)
-CTL_PROTO(opt_prof_prefix)
-CTL_PROTO(opt_prof_active)
-CTL_PROTO(opt_prof_thread_active_init)
-CTL_PROTO(opt_lg_prof_sample)
-CTL_PROTO(opt_lg_prof_interval)
-CTL_PROTO(opt_prof_gdump)
-CTL_PROTO(opt_prof_final)
-CTL_PROTO(opt_prof_leak)
-CTL_PROTO(opt_prof_accum)
-CTL_PROTO(tcache_create)
-CTL_PROTO(tcache_flush)
-CTL_PROTO(tcache_destroy)
-CTL_PROTO(arena_i_initialized)
-CTL_PROTO(arena_i_decay)
-CTL_PROTO(arena_i_purge)
-CTL_PROTO(arena_i_reset)
-CTL_PROTO(arena_i_destroy)
-CTL_PROTO(arena_i_dss)
-CTL_PROTO(arena_i_dirty_decay_ms)
-CTL_PROTO(arena_i_muzzy_decay_ms)
-CTL_PROTO(arena_i_extent_hooks)
-CTL_PROTO(arena_i_retain_grow_limit)
-INDEX_PROTO(arena_i)
-CTL_PROTO(arenas_bin_i_size)
-CTL_PROTO(arenas_bin_i_nregs)
-CTL_PROTO(arenas_bin_i_slab_size)
-INDEX_PROTO(arenas_bin_i)
-CTL_PROTO(arenas_lextent_i_size)
-INDEX_PROTO(arenas_lextent_i)
-CTL_PROTO(arenas_narenas)
-CTL_PROTO(arenas_dirty_decay_ms)
-CTL_PROTO(arenas_muzzy_decay_ms)
-CTL_PROTO(arenas_quantum)
-CTL_PROTO(arenas_page)
-CTL_PROTO(arenas_tcache_max)
-CTL_PROTO(arenas_nbins)
-CTL_PROTO(arenas_nhbins)
-CTL_PROTO(arenas_nlextents)
-CTL_PROTO(arenas_create)
-CTL_PROTO(arenas_lookup)
-CTL_PROTO(prof_thread_active_init)
-CTL_PROTO(prof_active)
-CTL_PROTO(prof_dump)
-CTL_PROTO(prof_gdump)
-CTL_PROTO(prof_reset)
-CTL_PROTO(prof_interval)
-CTL_PROTO(lg_prof_sample)
-CTL_PROTO(stats_arenas_i_small_allocated)
-CTL_PROTO(stats_arenas_i_small_nmalloc)
-CTL_PROTO(stats_arenas_i_small_ndalloc)
-CTL_PROTO(stats_arenas_i_small_nrequests)
-CTL_PROTO(stats_arenas_i_large_allocated)
-CTL_PROTO(stats_arenas_i_large_nmalloc)
-CTL_PROTO(stats_arenas_i_large_ndalloc)
-CTL_PROTO(stats_arenas_i_large_nrequests)
-CTL_PROTO(stats_arenas_i_bins_j_nmalloc)
-CTL_PROTO(stats_arenas_i_bins_j_ndalloc)
-CTL_PROTO(stats_arenas_i_bins_j_nrequests)
-CTL_PROTO(stats_arenas_i_bins_j_curregs)
-CTL_PROTO(stats_arenas_i_bins_j_nfills)
-CTL_PROTO(stats_arenas_i_bins_j_nflushes)
-CTL_PROTO(stats_arenas_i_bins_j_nslabs)
-CTL_PROTO(stats_arenas_i_bins_j_nreslabs)
-CTL_PROTO(stats_arenas_i_bins_j_curslabs)
-INDEX_PROTO(stats_arenas_i_bins_j)
-CTL_PROTO(stats_arenas_i_lextents_j_nmalloc)
-CTL_PROTO(stats_arenas_i_lextents_j_ndalloc)
-CTL_PROTO(stats_arenas_i_lextents_j_nrequests)
-CTL_PROTO(stats_arenas_i_lextents_j_curlextents)
-INDEX_PROTO(stats_arenas_i_lextents_j)
-CTL_PROTO(stats_arenas_i_nthreads)
-CTL_PROTO(stats_arenas_i_uptime)
-CTL_PROTO(stats_arenas_i_dss)
-CTL_PROTO(stats_arenas_i_dirty_decay_ms)
-CTL_PROTO(stats_arenas_i_muzzy_decay_ms)
-CTL_PROTO(stats_arenas_i_pactive)
-CTL_PROTO(stats_arenas_i_pdirty)
-CTL_PROTO(stats_arenas_i_pmuzzy)
-CTL_PROTO(stats_arenas_i_mapped)
-CTL_PROTO(stats_arenas_i_retained)
-CTL_PROTO(stats_arenas_i_dirty_npurge)
-CTL_PROTO(stats_arenas_i_dirty_nmadvise)
-CTL_PROTO(stats_arenas_i_dirty_purged)
-CTL_PROTO(stats_arenas_i_muzzy_npurge)
-CTL_PROTO(stats_arenas_i_muzzy_nmadvise)
-CTL_PROTO(stats_arenas_i_muzzy_purged)
-CTL_PROTO(stats_arenas_i_base)
-CTL_PROTO(stats_arenas_i_internal)
-CTL_PROTO(stats_arenas_i_metadata_thp)
-CTL_PROTO(stats_arenas_i_tcache_bytes)
-CTL_PROTO(stats_arenas_i_resident)
-INDEX_PROTO(stats_arenas_i)
-CTL_PROTO(stats_allocated)
-CTL_PROTO(stats_active)
-CTL_PROTO(stats_background_thread_num_threads)
-CTL_PROTO(stats_background_thread_num_runs)
-CTL_PROTO(stats_background_thread_run_interval)
-CTL_PROTO(stats_metadata)
-CTL_PROTO(stats_metadata_thp)
-CTL_PROTO(stats_resident)
-CTL_PROTO(stats_mapped)
-CTL_PROTO(stats_retained)
-
-#define MUTEX_STATS_CTL_PROTO_GEN(n)					\
-CTL_PROTO(stats_##n##_num_ops)						\
-CTL_PROTO(stats_##n##_num_wait)						\
-CTL_PROTO(stats_##n##_num_spin_acq)					\
-CTL_PROTO(stats_##n##_num_owner_switch)					\
-CTL_PROTO(stats_##n##_total_wait_time)					\
-CTL_PROTO(stats_##n##_max_wait_time)					\
-CTL_PROTO(stats_##n##_max_num_thds)
-
-/* Global mutexes. */
-#define OP(mtx) MUTEX_STATS_CTL_PROTO_GEN(mutexes_##mtx)
-MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-
-/* Per arena mutexes. */
-#define OP(mtx) MUTEX_STATS_CTL_PROTO_GEN(arenas_i_mutexes_##mtx)
-MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-
-/* Arena bin mutexes. */
-MUTEX_STATS_CTL_PROTO_GEN(arenas_i_bins_j_mutex)
-#undef MUTEX_STATS_CTL_PROTO_GEN
-
-CTL_PROTO(stats_mutexes_reset)
-
-/******************************************************************************/
-/* mallctl tree. */
-
-#define NAME(n)	{true},	n
-#define CHILD(t, c)							\
-	sizeof(c##_node) / sizeof(ctl_##t##_node_t),			\
-	(ctl_node_t *)c##_node,						\
-	NULL
-#define CTL(c)	0, NULL, c##_ctl
-
-/*
- * Only handles internal indexed nodes, since there are currently no external
- * ones.
- */
-#define INDEX(i)	{false},	i##_index
-
-static const ctl_named_node_t	thread_tcache_node[] = {
-	{NAME("enabled"),	CTL(thread_tcache_enabled)},
-	{NAME("flush"),		CTL(thread_tcache_flush)}
-};
-
-static const ctl_named_node_t	thread_prof_node[] = {
-	{NAME("name"),		CTL(thread_prof_name)},
-	{NAME("active"),	CTL(thread_prof_active)}
-};
-
-static const ctl_named_node_t	thread_node[] = {
-	{NAME("arena"),		CTL(thread_arena)},
-	{NAME("allocated"),	CTL(thread_allocated)},
-	{NAME("allocatedp"),	CTL(thread_allocatedp)},
-	{NAME("deallocated"),	CTL(thread_deallocated)},
-	{NAME("deallocatedp"),	CTL(thread_deallocatedp)},
-	{NAME("tcache"),	CHILD(named, thread_tcache)},
-	{NAME("prof"),		CHILD(named, thread_prof)}
-};
-
-static const ctl_named_node_t	config_node[] = {
-	{NAME("cache_oblivious"), CTL(config_cache_oblivious)},
-	{NAME("debug"),		CTL(config_debug)},
-	{NAME("fill"),		CTL(config_fill)},
-	{NAME("lazy_lock"),	CTL(config_lazy_lock)},
-	{NAME("malloc_conf"),	CTL(config_malloc_conf)},
-	{NAME("prof"),		CTL(config_prof)},
-	{NAME("prof_libgcc"),	CTL(config_prof_libgcc)},
-	{NAME("prof_libunwind"), CTL(config_prof_libunwind)},
-	{NAME("stats"),		CTL(config_stats)},
-	{NAME("utrace"),	CTL(config_utrace)},
-	{NAME("xmalloc"),	CTL(config_xmalloc)}
-};
-
-static const ctl_named_node_t opt_node[] = {
-	{NAME("abort"),		CTL(opt_abort)},
-	{NAME("abort_conf"),	CTL(opt_abort_conf)},
-	{NAME("metadata_thp"),	CTL(opt_metadata_thp)},
-	{NAME("retain"),	CTL(opt_retain)},
-	{NAME("dss"),		CTL(opt_dss)},
-	{NAME("narenas"),	CTL(opt_narenas)},
-	{NAME("percpu_arena"),	CTL(opt_percpu_arena)},
-	{NAME("background_thread"),	CTL(opt_background_thread)},
-	{NAME("max_background_threads"),	CTL(opt_max_background_threads)},
-	{NAME("dirty_decay_ms"), CTL(opt_dirty_decay_ms)},
-	{NAME("muzzy_decay_ms"), CTL(opt_muzzy_decay_ms)},
-	{NAME("stats_print"),	CTL(opt_stats_print)},
-	{NAME("stats_print_opts"),	CTL(opt_stats_print_opts)},
-	{NAME("junk"),		CTL(opt_junk)},
-	{NAME("zero"),		CTL(opt_zero)},
-	{NAME("utrace"),	CTL(opt_utrace)},
-	{NAME("xmalloc"),	CTL(opt_xmalloc)},
-	{NAME("tcache"),	CTL(opt_tcache)},
-	{NAME("thp"),		CTL(opt_thp)},
-	{NAME("lg_extent_max_active_fit"), CTL(opt_lg_extent_max_active_fit)},
-	{NAME("lg_tcache_max"),	CTL(opt_lg_tcache_max)},
-	{NAME("prof"),		CTL(opt_prof)},
-	{NAME("prof_prefix"),	CTL(opt_prof_prefix)},
-	{NAME("prof_active"),	CTL(opt_prof_active)},
-	{NAME("prof_thread_active_init"), CTL(opt_prof_thread_active_init)},
-	{NAME("lg_prof_sample"), CTL(opt_lg_prof_sample)},
-	{NAME("lg_prof_interval"), CTL(opt_lg_prof_interval)},
-	{NAME("prof_gdump"),	CTL(opt_prof_gdump)},
-	{NAME("prof_final"),	CTL(opt_prof_final)},
-	{NAME("prof_leak"),	CTL(opt_prof_leak)},
-	{NAME("prof_accum"),	CTL(opt_prof_accum)}
-};
-
-static const ctl_named_node_t	tcache_node[] = {
-	{NAME("create"),	CTL(tcache_create)},
-	{NAME("flush"),		CTL(tcache_flush)},
-	{NAME("destroy"),	CTL(tcache_destroy)}
-};
-
-static const ctl_named_node_t arena_i_node[] = {
-	{NAME("initialized"),	CTL(arena_i_initialized)},
-	{NAME("decay"),		CTL(arena_i_decay)},
-	{NAME("purge"),		CTL(arena_i_purge)},
-	{NAME("reset"),		CTL(arena_i_reset)},
-	{NAME("destroy"),	CTL(arena_i_destroy)},
-	{NAME("dss"),		CTL(arena_i_dss)},
-	{NAME("dirty_decay_ms"), CTL(arena_i_dirty_decay_ms)},
-	{NAME("muzzy_decay_ms"), CTL(arena_i_muzzy_decay_ms)},
-	{NAME("extent_hooks"),	CTL(arena_i_extent_hooks)},
-	{NAME("retain_grow_limit"),	CTL(arena_i_retain_grow_limit)}
-};
-static const ctl_named_node_t super_arena_i_node[] = {
-	{NAME(""),		CHILD(named, arena_i)}
-};
-
-static const ctl_indexed_node_t arena_node[] = {
-	{INDEX(arena_i)}
-};
-
-static const ctl_named_node_t arenas_bin_i_node[] = {
-	{NAME("size"),		CTL(arenas_bin_i_size)},
-	{NAME("nregs"),		CTL(arenas_bin_i_nregs)},
-	{NAME("slab_size"),	CTL(arenas_bin_i_slab_size)}
-};
-static const ctl_named_node_t super_arenas_bin_i_node[] = {
-	{NAME(""),		CHILD(named, arenas_bin_i)}
-};
-
-static const ctl_indexed_node_t arenas_bin_node[] = {
-	{INDEX(arenas_bin_i)}
-};
-
-static const ctl_named_node_t arenas_lextent_i_node[] = {
-	{NAME("size"),		CTL(arenas_lextent_i_size)}
-};
-static const ctl_named_node_t super_arenas_lextent_i_node[] = {
-	{NAME(""),		CHILD(named, arenas_lextent_i)}
-};
-
-static const ctl_indexed_node_t arenas_lextent_node[] = {
-	{INDEX(arenas_lextent_i)}
-};
-
-static const ctl_named_node_t arenas_node[] = {
-	{NAME("narenas"),	CTL(arenas_narenas)},
-	{NAME("dirty_decay_ms"), CTL(arenas_dirty_decay_ms)},
-	{NAME("muzzy_decay_ms"), CTL(arenas_muzzy_decay_ms)},
-	{NAME("quantum"),	CTL(arenas_quantum)},
-	{NAME("page"),		CTL(arenas_page)},
-	{NAME("tcache_max"),	CTL(arenas_tcache_max)},
-	{NAME("nbins"),		CTL(arenas_nbins)},
-	{NAME("nhbins"),	CTL(arenas_nhbins)},
-	{NAME("bin"),		CHILD(indexed, arenas_bin)},
-	{NAME("nlextents"),	CTL(arenas_nlextents)},
-	{NAME("lextent"),	CHILD(indexed, arenas_lextent)},
-	{NAME("create"),	CTL(arenas_create)},
-	{NAME("lookup"),	CTL(arenas_lookup)}
-};
-
-static const ctl_named_node_t	prof_node[] = {
-	{NAME("thread_active_init"), CTL(prof_thread_active_init)},
-	{NAME("active"),	CTL(prof_active)},
-	{NAME("dump"),		CTL(prof_dump)},
-	{NAME("gdump"),		CTL(prof_gdump)},
-	{NAME("reset"),		CTL(prof_reset)},
-	{NAME("interval"),	CTL(prof_interval)},
-	{NAME("lg_sample"),	CTL(lg_prof_sample)}
-};
-
-static const ctl_named_node_t stats_arenas_i_small_node[] = {
-	{NAME("allocated"),	CTL(stats_arenas_i_small_allocated)},
-	{NAME("nmalloc"),	CTL(stats_arenas_i_small_nmalloc)},
-	{NAME("ndalloc"),	CTL(stats_arenas_i_small_ndalloc)},
-	{NAME("nrequests"),	CTL(stats_arenas_i_small_nrequests)}
-};
-
-static const ctl_named_node_t stats_arenas_i_large_node[] = {
-	{NAME("allocated"),	CTL(stats_arenas_i_large_allocated)},
-	{NAME("nmalloc"),	CTL(stats_arenas_i_large_nmalloc)},
-	{NAME("ndalloc"),	CTL(stats_arenas_i_large_ndalloc)},
-	{NAME("nrequests"),	CTL(stats_arenas_i_large_nrequests)}
-};
-
-#define MUTEX_PROF_DATA_NODE(prefix)					\
-static const ctl_named_node_t stats_##prefix##_node[] = {		\
-	{NAME("num_ops"),						\
-	 CTL(stats_##prefix##_num_ops)},				\
-	{NAME("num_wait"),						\
-	 CTL(stats_##prefix##_num_wait)},				\
-	{NAME("num_spin_acq"),						\
-	 CTL(stats_##prefix##_num_spin_acq)},				\
-	{NAME("num_owner_switch"),					\
-	 CTL(stats_##prefix##_num_owner_switch)},			\
-	{NAME("total_wait_time"),					\
-	 CTL(stats_##prefix##_total_wait_time)},			\
-	{NAME("max_wait_time"),						\
-	 CTL(stats_##prefix##_max_wait_time)},				\
-	{NAME("max_num_thds"),						\
-	 CTL(stats_##prefix##_max_num_thds)}				\
-	/* Note that # of current waiting thread not provided. */	\
-};
-
-MUTEX_PROF_DATA_NODE(arenas_i_bins_j_mutex)
-
-static const ctl_named_node_t stats_arenas_i_bins_j_node[] = {
-	{NAME("nmalloc"),	CTL(stats_arenas_i_bins_j_nmalloc)},
-	{NAME("ndalloc"),	CTL(stats_arenas_i_bins_j_ndalloc)},
-	{NAME("nrequests"),	CTL(stats_arenas_i_bins_j_nrequests)},
-	{NAME("curregs"),	CTL(stats_arenas_i_bins_j_curregs)},
-	{NAME("nfills"),	CTL(stats_arenas_i_bins_j_nfills)},
-	{NAME("nflushes"),	CTL(stats_arenas_i_bins_j_nflushes)},
-	{NAME("nslabs"),	CTL(stats_arenas_i_bins_j_nslabs)},
-	{NAME("nreslabs"),	CTL(stats_arenas_i_bins_j_nreslabs)},
-	{NAME("curslabs"),	CTL(stats_arenas_i_bins_j_curslabs)},
-	{NAME("mutex"),		CHILD(named, stats_arenas_i_bins_j_mutex)}
-};
-
-static const ctl_named_node_t super_stats_arenas_i_bins_j_node[] = {
-	{NAME(""),		CHILD(named, stats_arenas_i_bins_j)}
-};
-
-static const ctl_indexed_node_t stats_arenas_i_bins_node[] = {
-	{INDEX(stats_arenas_i_bins_j)}
-};
-
-static const ctl_named_node_t stats_arenas_i_lextents_j_node[] = {
-	{NAME("nmalloc"),	CTL(stats_arenas_i_lextents_j_nmalloc)},
-	{NAME("ndalloc"),	CTL(stats_arenas_i_lextents_j_ndalloc)},
-	{NAME("nrequests"),	CTL(stats_arenas_i_lextents_j_nrequests)},
-	{NAME("curlextents"),	CTL(stats_arenas_i_lextents_j_curlextents)}
-};
-static const ctl_named_node_t super_stats_arenas_i_lextents_j_node[] = {
-	{NAME(""),		CHILD(named, stats_arenas_i_lextents_j)}
-};
-
-static const ctl_indexed_node_t stats_arenas_i_lextents_node[] = {
-	{INDEX(stats_arenas_i_lextents_j)}
-};
-
-#define OP(mtx)  MUTEX_PROF_DATA_NODE(arenas_i_mutexes_##mtx)
-MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-
-static const ctl_named_node_t stats_arenas_i_mutexes_node[] = {
-#define OP(mtx) {NAME(#mtx), CHILD(named, stats_arenas_i_mutexes_##mtx)},
-MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-};
-
-static const ctl_named_node_t stats_arenas_i_node[] = {
-	{NAME("nthreads"),	CTL(stats_arenas_i_nthreads)},
-	{NAME("uptime"),	CTL(stats_arenas_i_uptime)},
-	{NAME("dss"),		CTL(stats_arenas_i_dss)},
-	{NAME("dirty_decay_ms"), CTL(stats_arenas_i_dirty_decay_ms)},
-	{NAME("muzzy_decay_ms"), CTL(stats_arenas_i_muzzy_decay_ms)},
-	{NAME("pactive"),	CTL(stats_arenas_i_pactive)},
-	{NAME("pdirty"),	CTL(stats_arenas_i_pdirty)},
-	{NAME("pmuzzy"),	CTL(stats_arenas_i_pmuzzy)},
-	{NAME("mapped"),	CTL(stats_arenas_i_mapped)},
-	{NAME("retained"),	CTL(stats_arenas_i_retained)},
-	{NAME("dirty_npurge"),	CTL(stats_arenas_i_dirty_npurge)},
-	{NAME("dirty_nmadvise"), CTL(stats_arenas_i_dirty_nmadvise)},
-	{NAME("dirty_purged"),	CTL(stats_arenas_i_dirty_purged)},
-	{NAME("muzzy_npurge"),	CTL(stats_arenas_i_muzzy_npurge)},
-	{NAME("muzzy_nmadvise"), CTL(stats_arenas_i_muzzy_nmadvise)},
-	{NAME("muzzy_purged"),	CTL(stats_arenas_i_muzzy_purged)},
-	{NAME("base"),		CTL(stats_arenas_i_base)},
-	{NAME("internal"),	CTL(stats_arenas_i_internal)},
-	{NAME("metadata_thp"),	CTL(stats_arenas_i_metadata_thp)},
-	{NAME("tcache_bytes"),	CTL(stats_arenas_i_tcache_bytes)},
-	{NAME("resident"),	CTL(stats_arenas_i_resident)},
-	{NAME("small"),		CHILD(named, stats_arenas_i_small)},
-	{NAME("large"),		CHILD(named, stats_arenas_i_large)},
-	{NAME("bins"),		CHILD(indexed, stats_arenas_i_bins)},
-	{NAME("lextents"),	CHILD(indexed, stats_arenas_i_lextents)},
-	{NAME("mutexes"),	CHILD(named, stats_arenas_i_mutexes)}
-};
-static const ctl_named_node_t super_stats_arenas_i_node[] = {
-	{NAME(""),		CHILD(named, stats_arenas_i)}
-};
-
-static const ctl_indexed_node_t stats_arenas_node[] = {
-	{INDEX(stats_arenas_i)}
-};
-
-static const ctl_named_node_t stats_background_thread_node[] = {
-	{NAME("num_threads"),	CTL(stats_background_thread_num_threads)},
-	{NAME("num_runs"),	CTL(stats_background_thread_num_runs)},
-	{NAME("run_interval"),	CTL(stats_background_thread_run_interval)}
-};
-
-#define OP(mtx) MUTEX_PROF_DATA_NODE(mutexes_##mtx)
-MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-
-static const ctl_named_node_t stats_mutexes_node[] = {
-#define OP(mtx) {NAME(#mtx), CHILD(named, stats_mutexes_##mtx)},
-MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-	{NAME("reset"),		CTL(stats_mutexes_reset)}
-};
-#undef MUTEX_PROF_DATA_NODE
-
-static const ctl_named_node_t stats_node[] = {
-	{NAME("allocated"),	CTL(stats_allocated)},
-	{NAME("active"),	CTL(stats_active)},
-	{NAME("metadata"),	CTL(stats_metadata)},
-	{NAME("metadata_thp"),	CTL(stats_metadata_thp)},
-	{NAME("resident"),	CTL(stats_resident)},
-	{NAME("mapped"),	CTL(stats_mapped)},
-	{NAME("retained"),	CTL(stats_retained)},
-	{NAME("background_thread"),
-	 CHILD(named, stats_background_thread)},
-	{NAME("mutexes"),	CHILD(named, stats_mutexes)},
-	{NAME("arenas"),	CHILD(indexed, stats_arenas)}
-};
-
-static const ctl_named_node_t	root_node[] = {
-	{NAME("version"),	CTL(version)},
-	{NAME("epoch"),		CTL(epoch)},
-	{NAME("background_thread"),	CTL(background_thread)},
-	{NAME("max_background_threads"),	CTL(max_background_threads)},
-	{NAME("thread"),	CHILD(named, thread)},
-	{NAME("config"),	CHILD(named, config)},
-	{NAME("opt"),		CHILD(named, opt)},
-	{NAME("tcache"),	CHILD(named, tcache)},
-	{NAME("arena"),		CHILD(indexed, arena)},
-	{NAME("arenas"),	CHILD(named, arenas)},
-	{NAME("prof"),		CHILD(named, prof)},
-	{NAME("stats"),		CHILD(named, stats)}
-};
-static const ctl_named_node_t super_root_node[] = {
-	{NAME(""),		CHILD(named, root)}
-};
-
-#undef NAME
-#undef CHILD
-#undef CTL
-#undef INDEX
-
-/******************************************************************************/
-
-/*
- * Sets *dst + *src non-atomically.  This is safe, since everything is
- * synchronized by the ctl mutex.
- */
-static void
-ctl_accum_arena_stats_u64(arena_stats_u64_t *dst, arena_stats_u64_t *src) {
-#ifdef JEMALLOC_ATOMIC_U64
-	uint64_t cur_dst = atomic_load_u64(dst, ATOMIC_RELAXED);
-	uint64_t cur_src = atomic_load_u64(src, ATOMIC_RELAXED);
-	atomic_store_u64(dst, cur_dst + cur_src, ATOMIC_RELAXED);
-#else
-	*dst += *src;
-#endif
-}
-
-/* Likewise: with ctl mutex synchronization, reading is simple. */
-static uint64_t
-ctl_arena_stats_read_u64(arena_stats_u64_t *p) {
-#ifdef JEMALLOC_ATOMIC_U64
-	return atomic_load_u64(p, ATOMIC_RELAXED);
-#else
-	return *p;
-#endif
-}
-
-static void
-accum_atomic_zu(atomic_zu_t *dst, atomic_zu_t *src) {
-	size_t cur_dst = atomic_load_zu(dst, ATOMIC_RELAXED);
-	size_t cur_src = atomic_load_zu(src, ATOMIC_RELAXED);
-	atomic_store_zu(dst, cur_dst + cur_src, ATOMIC_RELAXED);
-}
-
-/******************************************************************************/
-
-static unsigned
-arenas_i2a_impl(size_t i, bool compat, bool validate) {
-	unsigned a;
-
-	switch (i) {
-	case MALLCTL_ARENAS_ALL:
-		a = 0;
-		break;
-	case MALLCTL_ARENAS_DESTROYED:
-		a = 1;
-		break;
-	default:
-		if (compat && i == ctl_arenas->narenas) {
-			/*
-			 * Provide deprecated backward compatibility for
-			 * accessing the merged stats at index narenas rather
-			 * than via MALLCTL_ARENAS_ALL.  This is scheduled for
-			 * removal in 6.0.0.
-			 */
-			a = 0;
-		} else if (validate && i >= ctl_arenas->narenas) {
-			a = UINT_MAX;
-		} else {
-			/*
-			 * This function should never be called for an index
-			 * more than one past the range of indices that have
-			 * initialized ctl data.
-			 */
-			assert(i < ctl_arenas->narenas || (!validate && i ==
-			    ctl_arenas->narenas));
-			a = (unsigned)i + 2;
-		}
-		break;
-	}
-
-	return a;
-}
-
-static unsigned
-arenas_i2a(size_t i) {
-	return arenas_i2a_impl(i, true, false);
-}
-
-static ctl_arena_t *
-arenas_i_impl(tsd_t *tsd, size_t i, bool compat, bool init) {
-	ctl_arena_t *ret;
-
-	assert(!compat || !init);
-
-	ret = ctl_arenas->arenas[arenas_i2a_impl(i, compat, false)];
-	if (init && ret == NULL) {
-		if (config_stats) {
-			struct container_s {
-				ctl_arena_t		ctl_arena;
-				ctl_arena_stats_t	astats;
-			};
-			struct container_s *cont =
-			    (struct container_s *)base_alloc(tsd_tsdn(tsd),
-			    b0get(), sizeof(struct container_s), QUANTUM);
-			if (cont == NULL) {
-				return NULL;
-			}
-			ret = &cont->ctl_arena;
-			ret->astats = &cont->astats;
-		} else {
-			ret = (ctl_arena_t *)base_alloc(tsd_tsdn(tsd), b0get(),
-			    sizeof(ctl_arena_t), QUANTUM);
-			if (ret == NULL) {
-				return NULL;
-			}
-		}
-		ret->arena_ind = (unsigned)i;
-		ctl_arenas->arenas[arenas_i2a_impl(i, compat, false)] = ret;
-	}
-
-	assert(ret == NULL || arenas_i2a(ret->arena_ind) == arenas_i2a(i));
-	return ret;
-}
-
-static ctl_arena_t *
-arenas_i(size_t i) {
-	ctl_arena_t *ret = arenas_i_impl(tsd_fetch(), i, true, false);
-	assert(ret != NULL);
-	return ret;
-}
-
-static void
-ctl_arena_clear(ctl_arena_t *ctl_arena) {
-	ctl_arena->nthreads = 0;
-	ctl_arena->dss = dss_prec_names[dss_prec_limit];
-	ctl_arena->dirty_decay_ms = -1;
-	ctl_arena->muzzy_decay_ms = -1;
-	ctl_arena->pactive = 0;
-	ctl_arena->pdirty = 0;
-	ctl_arena->pmuzzy = 0;
-	if (config_stats) {
-		memset(&ctl_arena->astats->astats, 0, sizeof(arena_stats_t));
-		ctl_arena->astats->allocated_small = 0;
-		ctl_arena->astats->nmalloc_small = 0;
-		ctl_arena->astats->ndalloc_small = 0;
-		ctl_arena->astats->nrequests_small = 0;
-		memset(ctl_arena->astats->bstats, 0, NBINS *
-		    sizeof(bin_stats_t));
-		memset(ctl_arena->astats->lstats, 0, (NSIZES - NBINS) *
-		    sizeof(arena_stats_large_t));
-	}
-}
-
-static void
-ctl_arena_stats_amerge(tsdn_t *tsdn, ctl_arena_t *ctl_arena, arena_t *arena) {
-	unsigned i;
-
-	if (config_stats) {
-		arena_stats_merge(tsdn, arena, &ctl_arena->nthreads,
-		    &ctl_arena->dss, &ctl_arena->dirty_decay_ms,
-		    &ctl_arena->muzzy_decay_ms, &ctl_arena->pactive,
-		    &ctl_arena->pdirty, &ctl_arena->pmuzzy,
-		    &ctl_arena->astats->astats, ctl_arena->astats->bstats,
-		    ctl_arena->astats->lstats);
-
-		for (i = 0; i < NBINS; i++) {
-			ctl_arena->astats->allocated_small +=
-			    ctl_arena->astats->bstats[i].curregs *
-			    sz_index2size(i);
-			ctl_arena->astats->nmalloc_small +=
-			    ctl_arena->astats->bstats[i].nmalloc;
-			ctl_arena->astats->ndalloc_small +=
-			    ctl_arena->astats->bstats[i].ndalloc;
-			ctl_arena->astats->nrequests_small +=
-			    ctl_arena->astats->bstats[i].nrequests;
-		}
-	} else {
-		arena_basic_stats_merge(tsdn, arena, &ctl_arena->nthreads,
-		    &ctl_arena->dss, &ctl_arena->dirty_decay_ms,
-		    &ctl_arena->muzzy_decay_ms, &ctl_arena->pactive,
-		    &ctl_arena->pdirty, &ctl_arena->pmuzzy);
-	}
-}
-
-static void
-ctl_arena_stats_sdmerge(ctl_arena_t *ctl_sdarena, ctl_arena_t *ctl_arena,
-    bool destroyed) {
-	unsigned i;
-
-	if (!destroyed) {
-		ctl_sdarena->nthreads += ctl_arena->nthreads;
-		ctl_sdarena->pactive += ctl_arena->pactive;
-		ctl_sdarena->pdirty += ctl_arena->pdirty;
-		ctl_sdarena->pmuzzy += ctl_arena->pmuzzy;
-	} else {
-		assert(ctl_arena->nthreads == 0);
-		assert(ctl_arena->pactive == 0);
-		assert(ctl_arena->pdirty == 0);
-		assert(ctl_arena->pmuzzy == 0);
-	}
-
-	if (config_stats) {
-		ctl_arena_stats_t *sdstats = ctl_sdarena->astats;
-		ctl_arena_stats_t *astats = ctl_arena->astats;
-
-		if (!destroyed) {
-			accum_atomic_zu(&sdstats->astats.mapped,
-			    &astats->astats.mapped);
-			accum_atomic_zu(&sdstats->astats.retained,
-			    &astats->astats.retained);
-		}
-
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.npurge,
-		    &astats->astats.decay_dirty.npurge);
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.nmadvise,
-		    &astats->astats.decay_dirty.nmadvise);
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_dirty.purged,
-		    &astats->astats.decay_dirty.purged);
-
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.npurge,
-		    &astats->astats.decay_muzzy.npurge);
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.nmadvise,
-		    &astats->astats.decay_muzzy.nmadvise);
-		ctl_accum_arena_stats_u64(&sdstats->astats.decay_muzzy.purged,
-		    &astats->astats.decay_muzzy.purged);
-
-#define OP(mtx) malloc_mutex_prof_merge(				\
-		    &(sdstats->astats.mutex_prof_data[			\
-		        arena_prof_mutex_##mtx]),			\
-		    &(astats->astats.mutex_prof_data[			\
-		        arena_prof_mutex_##mtx]));
-MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-		if (!destroyed) {
-			accum_atomic_zu(&sdstats->astats.base,
-			    &astats->astats.base);
-			accum_atomic_zu(&sdstats->astats.internal,
-			    &astats->astats.internal);
-			accum_atomic_zu(&sdstats->astats.resident,
-			    &astats->astats.resident);
-			accum_atomic_zu(&sdstats->astats.metadata_thp,
-			    &astats->astats.metadata_thp);
-		} else {
-			assert(atomic_load_zu(
-			    &astats->astats.internal, ATOMIC_RELAXED) == 0);
-		}
-
-		if (!destroyed) {
-			sdstats->allocated_small += astats->allocated_small;
-		} else {
-			assert(astats->allocated_small == 0);
-		}
-		sdstats->nmalloc_small += astats->nmalloc_small;
-		sdstats->ndalloc_small += astats->ndalloc_small;
-		sdstats->nrequests_small += astats->nrequests_small;
-
-		if (!destroyed) {
-			accum_atomic_zu(&sdstats->astats.allocated_large,
-			    &astats->astats.allocated_large);
-		} else {
-			assert(atomic_load_zu(&astats->astats.allocated_large,
-			    ATOMIC_RELAXED) == 0);
-		}
-		ctl_accum_arena_stats_u64(&sdstats->astats.nmalloc_large,
-		    &astats->astats.nmalloc_large);
-		ctl_accum_arena_stats_u64(&sdstats->astats.ndalloc_large,
-		    &astats->astats.ndalloc_large);
-		ctl_accum_arena_stats_u64(&sdstats->astats.nrequests_large,
-		    &astats->astats.nrequests_large);
-
-		accum_atomic_zu(&sdstats->astats.tcache_bytes,
-		    &astats->astats.tcache_bytes);
-
-		if (ctl_arena->arena_ind == 0) {
-			sdstats->astats.uptime = astats->astats.uptime;
-		}
-
-		for (i = 0; i < NBINS; i++) {
-			sdstats->bstats[i].nmalloc += astats->bstats[i].nmalloc;
-			sdstats->bstats[i].ndalloc += astats->bstats[i].ndalloc;
-			sdstats->bstats[i].nrequests +=
-			    astats->bstats[i].nrequests;
-			if (!destroyed) {
-				sdstats->bstats[i].curregs +=
-				    astats->bstats[i].curregs;
-			} else {
-				assert(astats->bstats[i].curregs == 0);
-			}
-			sdstats->bstats[i].nfills += astats->bstats[i].nfills;
-			sdstats->bstats[i].nflushes +=
-			    astats->bstats[i].nflushes;
-			sdstats->bstats[i].nslabs += astats->bstats[i].nslabs;
-			sdstats->bstats[i].reslabs += astats->bstats[i].reslabs;
-			if (!destroyed) {
-				sdstats->bstats[i].curslabs +=
-				    astats->bstats[i].curslabs;
-			} else {
-				assert(astats->bstats[i].curslabs == 0);
-			}
-			malloc_mutex_prof_merge(&sdstats->bstats[i].mutex_data,
-			    &astats->bstats[i].mutex_data);
-		}
-
-		for (i = 0; i < NSIZES - NBINS; i++) {
-			ctl_accum_arena_stats_u64(&sdstats->lstats[i].nmalloc,
-			    &astats->lstats[i].nmalloc);
-			ctl_accum_arena_stats_u64(&sdstats->lstats[i].ndalloc,
-			    &astats->lstats[i].ndalloc);
-			ctl_accum_arena_stats_u64(&sdstats->lstats[i].nrequests,
-			    &astats->lstats[i].nrequests);
-			if (!destroyed) {
-				sdstats->lstats[i].curlextents +=
-				    astats->lstats[i].curlextents;
-			} else {
-				assert(astats->lstats[i].curlextents == 0);
-			}
-		}
-	}
-}
-
-static void
-ctl_arena_refresh(tsdn_t *tsdn, arena_t *arena, ctl_arena_t *ctl_sdarena,
-    unsigned i, bool destroyed) {
-	ctl_arena_t *ctl_arena = arenas_i(i);
-
-	ctl_arena_clear(ctl_arena);
-	ctl_arena_stats_amerge(tsdn, ctl_arena, arena);
-	/* Merge into sum stats as well. */
-	ctl_arena_stats_sdmerge(ctl_sdarena, ctl_arena, destroyed);
-}
-
-static unsigned
-ctl_arena_init(tsd_t *tsd, extent_hooks_t *extent_hooks) {
-	unsigned arena_ind;
-	ctl_arena_t *ctl_arena;
-
-	if ((ctl_arena = ql_last(&ctl_arenas->destroyed, destroyed_link)) !=
-	    NULL) {
-		ql_remove(&ctl_arenas->destroyed, ctl_arena, destroyed_link);
-		arena_ind = ctl_arena->arena_ind;
-	} else {
-		arena_ind = ctl_arenas->narenas;
-	}
-
-	/* Trigger stats allocation. */
-	if (arenas_i_impl(tsd, arena_ind, false, true) == NULL) {
-		return UINT_MAX;
-	}
-
-	/* Initialize new arena. */
-	if (arena_init(tsd_tsdn(tsd), arena_ind, extent_hooks) == NULL) {
-		return UINT_MAX;
-	}
-
-	if (arena_ind == ctl_arenas->narenas) {
-		ctl_arenas->narenas++;
-	}
-
-	return arena_ind;
-}
-
-static void
-ctl_background_thread_stats_read(tsdn_t *tsdn) {
-	background_thread_stats_t *stats = &ctl_stats->background_thread;
-	if (!have_background_thread ||
-	    background_thread_stats_read(tsdn, stats)) {
-		memset(stats, 0, sizeof(background_thread_stats_t));
-		nstime_init(&stats->run_interval, 0);
-	}
-}
-
-static void
-ctl_refresh(tsdn_t *tsdn) {
-	unsigned i;
-	ctl_arena_t *ctl_sarena = arenas_i(MALLCTL_ARENAS_ALL);
-	VARIABLE_ARRAY(arena_t *, tarenas, ctl_arenas->narenas);
-
-	/*
-	 * Clear sum stats, since they will be merged into by
-	 * ctl_arena_refresh().
-	 */
-	ctl_arena_clear(ctl_sarena);
-
-	for (i = 0; i < ctl_arenas->narenas; i++) {
-		tarenas[i] = arena_get(tsdn, i, false);
-	}
-
-	for (i = 0; i < ctl_arenas->narenas; i++) {
-		ctl_arena_t *ctl_arena = arenas_i(i);
-		bool initialized = (tarenas[i] != NULL);
-
-		ctl_arena->initialized = initialized;
-		if (initialized) {
-			ctl_arena_refresh(tsdn, tarenas[i], ctl_sarena, i,
-			    false);
-		}
-	}
-
-	if (config_stats) {
-		ctl_stats->allocated = ctl_sarena->astats->allocated_small +
-		    atomic_load_zu(&ctl_sarena->astats->astats.allocated_large,
-			ATOMIC_RELAXED);
-		ctl_stats->active = (ctl_sarena->pactive << LG_PAGE);
-		ctl_stats->metadata = atomic_load_zu(
-		    &ctl_sarena->astats->astats.base, ATOMIC_RELAXED) +
-		    atomic_load_zu(&ctl_sarena->astats->astats.internal,
-			ATOMIC_RELAXED);
-		ctl_stats->metadata_thp = atomic_load_zu(
-		    &ctl_sarena->astats->astats.metadata_thp, ATOMIC_RELAXED);
-		ctl_stats->resident = atomic_load_zu(
-		    &ctl_sarena->astats->astats.resident, ATOMIC_RELAXED);
-		ctl_stats->mapped = atomic_load_zu(
-		    &ctl_sarena->astats->astats.mapped, ATOMIC_RELAXED);
-		ctl_stats->retained = atomic_load_zu(
-		    &ctl_sarena->astats->astats.retained, ATOMIC_RELAXED);
-
-		ctl_background_thread_stats_read(tsdn);
-
-#define READ_GLOBAL_MUTEX_PROF_DATA(i, mtx)				\
-    malloc_mutex_lock(tsdn, &mtx);					\
-    malloc_mutex_prof_read(tsdn, &ctl_stats->mutex_prof_data[i], &mtx);	\
-    malloc_mutex_unlock(tsdn, &mtx);
-
-		if (config_prof && opt_prof) {
-			READ_GLOBAL_MUTEX_PROF_DATA(global_prof_mutex_prof,
-			    bt2gctx_mtx);
-		}
-		if (have_background_thread) {
-			READ_GLOBAL_MUTEX_PROF_DATA(
-			    global_prof_mutex_background_thread,
-			    background_thread_lock);
-		} else {
-			memset(&ctl_stats->mutex_prof_data[
-			    global_prof_mutex_background_thread], 0,
-			    sizeof(mutex_prof_data_t));
-		}
-		/* We own ctl mutex already. */
-		malloc_mutex_prof_read(tsdn,
-		    &ctl_stats->mutex_prof_data[global_prof_mutex_ctl],
-		    &ctl_mtx);
-#undef READ_GLOBAL_MUTEX_PROF_DATA
-	}
-	ctl_arenas->epoch++;
-}
-
-static bool
-ctl_init(tsd_t *tsd) {
-	bool ret;
-	tsdn_t *tsdn = tsd_tsdn(tsd);
-
-	malloc_mutex_lock(tsdn, &ctl_mtx);
-	if (!ctl_initialized) {
-		ctl_arena_t *ctl_sarena, *ctl_darena;
-		unsigned i;
-
-		/*
-		 * Allocate demand-zeroed space for pointers to the full
-		 * range of supported arena indices.
-		 */
-		if (ctl_arenas == NULL) {
-			ctl_arenas = (ctl_arenas_t *)base_alloc(tsdn,
-			    b0get(), sizeof(ctl_arenas_t), QUANTUM);
-			if (ctl_arenas == NULL) {
-				ret = true;
-				goto label_return;
-			}
-		}
-
-		if (config_stats && ctl_stats == NULL) {
-			ctl_stats = (ctl_stats_t *)base_alloc(tsdn, b0get(),
-			    sizeof(ctl_stats_t), QUANTUM);
-			if (ctl_stats == NULL) {
-				ret = true;
-				goto label_return;
-			}
-		}
-
-		/*
-		 * Allocate space for the current full range of arenas
-		 * here rather than doing it lazily elsewhere, in order
-		 * to limit when OOM-caused errors can occur.
-		 */
-		if ((ctl_sarena = arenas_i_impl(tsd, MALLCTL_ARENAS_ALL, false,
-		    true)) == NULL) {
-			ret = true;
-			goto label_return;
-		}
-		ctl_sarena->initialized = true;
-
-		if ((ctl_darena = arenas_i_impl(tsd, MALLCTL_ARENAS_DESTROYED,
-		    false, true)) == NULL) {
-			ret = true;
-			goto label_return;
-		}
-		ctl_arena_clear(ctl_darena);
-		/*
-		 * Don't toggle ctl_darena to initialized until an arena is
-		 * actually destroyed, so that arena.<i>.initialized can be used
-		 * to query whether the stats are relevant.
-		 */
-
-		ctl_arenas->narenas = narenas_total_get();
-		for (i = 0; i < ctl_arenas->narenas; i++) {
-			if (arenas_i_impl(tsd, i, false, true) == NULL) {
-				ret = true;
-				goto label_return;
-			}
-		}
-
-		ql_new(&ctl_arenas->destroyed);
-		ctl_refresh(tsdn);
-
-		ctl_initialized = true;
-	}
-
-	ret = false;
-label_return:
-	malloc_mutex_unlock(tsdn, &ctl_mtx);
-	return ret;
-}
-
-static int
-ctl_lookup(tsdn_t *tsdn, const char *name, ctl_node_t const **nodesp,
-    size_t *mibp, size_t *depthp) {
-	int ret;
-	const char *elm, *tdot, *dot;
-	size_t elen, i, j;
-	const ctl_named_node_t *node;
-
-	elm = name;
-	/* Equivalent to strchrnul(). */
-	dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot : strchr(elm, '\0');
-	elen = (size_t)((uintptr_t)dot - (uintptr_t)elm);
-	if (elen == 0) {
-		ret = ENOENT;
-		goto label_return;
-	}
-	node = super_root_node;
-	for (i = 0; i < *depthp; i++) {
-		assert(node);
-		assert(node->nchildren > 0);
-		if (ctl_named_node(node->children) != NULL) {
-			const ctl_named_node_t *pnode = node;
-
-			/* Children are named. */
-			for (j = 0; j < node->nchildren; j++) {
-				const ctl_named_node_t *child =
-				    ctl_named_children(node, j);
-				if (strlen(child->name) == elen &&
-				    strncmp(elm, child->name, elen) == 0) {
-					node = child;
-					if (nodesp != NULL) {
-						nodesp[i] =
-						    (const ctl_node_t *)node;
-					}
-					mibp[i] = j;
-					break;
-				}
-			}
-			if (node == pnode) {
-				ret = ENOENT;
-				goto label_return;
-			}
-		} else {
-			uintmax_t index;
-			const ctl_indexed_node_t *inode;
-
-			/* Children are indexed. */
-			index = malloc_strtoumax(elm, NULL, 10);
-			if (index == UINTMAX_MAX || index > SIZE_T_MAX) {
-				ret = ENOENT;
-				goto label_return;
-			}
-
-			inode = ctl_indexed_node(node->children);
-			node = inode->index(tsdn, mibp, *depthp, (size_t)index);
-			if (node == NULL) {
-				ret = ENOENT;
-				goto label_return;
-			}
-
-			if (nodesp != NULL) {
-				nodesp[i] = (const ctl_node_t *)node;
-			}
-			mibp[i] = (size_t)index;
-		}
-
-		if (node->ctl != NULL) {
-			/* Terminal node. */
-			if (*dot != '\0') {
-				/*
-				 * The name contains more elements than are
-				 * in this path through the tree.
-				 */
-				ret = ENOENT;
-				goto label_return;
-			}
-			/* Complete lookup successful. */
-			*depthp = i + 1;
-			break;
-		}
-
-		/* Update elm. */
-		if (*dot == '\0') {
-			/* No more elements. */
-			ret = ENOENT;
-			goto label_return;
-		}
-		elm = &dot[1];
-		dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot :
-		    strchr(elm, '\0');
-		elen = (size_t)((uintptr_t)dot - (uintptr_t)elm);
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-int
-ctl_byname(tsd_t *tsd, const char *name, void *oldp, size_t *oldlenp,
-    void *newp, size_t newlen) {
-	int ret;
-	size_t depth;
-	ctl_node_t const *nodes[CTL_MAX_DEPTH];
-	size_t mib[CTL_MAX_DEPTH];
-	const ctl_named_node_t *node;
-
-	if (!ctl_initialized && ctl_init(tsd)) {
-		ret = EAGAIN;
-		goto label_return;
-	}
-
-	depth = CTL_MAX_DEPTH;
-	ret = ctl_lookup(tsd_tsdn(tsd), name, nodes, mib, &depth);
-	if (ret != 0) {
-		goto label_return;
-	}
-
-	node = ctl_named_node(nodes[depth-1]);
-	if (node != NULL && node->ctl) {
-		ret = node->ctl(tsd, mib, depth, oldp, oldlenp, newp, newlen);
-	} else {
-		/* The name refers to a partial path through the ctl tree. */
-		ret = ENOENT;
-	}
-
-label_return:
-	return(ret);
-}
-
-int
-ctl_nametomib(tsd_t *tsd, const char *name, size_t *mibp, size_t *miblenp) {
-	int ret;
-
-	if (!ctl_initialized && ctl_init(tsd)) {
-		ret = EAGAIN;
-		goto label_return;
-	}
-
-	ret = ctl_lookup(tsd_tsdn(tsd), name, NULL, mibp, miblenp);
-label_return:
-	return(ret);
-}
-
-int
-ctl_bymib(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	const ctl_named_node_t *node;
-	size_t i;
-
-	if (!ctl_initialized && ctl_init(tsd)) {
-		ret = EAGAIN;
-		goto label_return;
-	}
-
-	/* Iterate down the tree. */
-	node = super_root_node;
-	for (i = 0; i < miblen; i++) {
-		assert(node);
-		assert(node->nchildren > 0);
-		if (ctl_named_node(node->children) != NULL) {
-			/* Children are named. */
-			if (node->nchildren <= mib[i]) {
-				ret = ENOENT;
-				goto label_return;
-			}
-			node = ctl_named_children(node, mib[i]);
-		} else {
-			const ctl_indexed_node_t *inode;
-
-			/* Indexed element. */
-			inode = ctl_indexed_node(node->children);
-			node = inode->index(tsd_tsdn(tsd), mib, miblen, mib[i]);
-			if (node == NULL) {
-				ret = ENOENT;
-				goto label_return;
-			}
-		}
-	}
-
-	/* Call the ctl function. */
-	if (node && node->ctl) {
-		ret = node->ctl(tsd, mib, miblen, oldp, oldlenp, newp, newlen);
-	} else {
-		/* Partial MIB. */
-		ret = ENOENT;
-	}
-
-label_return:
-	return(ret);
-}
-
-bool
-ctl_boot(void) {
-	if (malloc_mutex_init(&ctl_mtx, "ctl", WITNESS_RANK_CTL,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-
-	ctl_initialized = false;
-
-	return false;
-}
-
-void
-ctl_prefork(tsdn_t *tsdn) {
-	malloc_mutex_prefork(tsdn, &ctl_mtx);
-}
-
-void
-ctl_postfork_parent(tsdn_t *tsdn) {
-	malloc_mutex_postfork_parent(tsdn, &ctl_mtx);
-}
-
-void
-ctl_postfork_child(tsdn_t *tsdn) {
-	malloc_mutex_postfork_child(tsdn, &ctl_mtx);
-}
-
-/******************************************************************************/
-/* *_ctl() functions. */
-
-#define READONLY()	do {						\
-	if (newp != NULL || newlen != 0) {				\
-		ret = EPERM;						\
-		goto label_return;					\
-	}								\
-} while (0)
-
-#define WRITEONLY()	do {						\
-	if (oldp != NULL || oldlenp != NULL) {				\
-		ret = EPERM;						\
-		goto label_return;					\
-	}								\
-} while (0)
-
-#define READ_XOR_WRITE()	do {					\
-	if ((oldp != NULL && oldlenp != NULL) && (newp != NULL ||	\
-	    newlen != 0)) {						\
-		ret = EPERM;						\
-		goto label_return;					\
-	}								\
-} while (0)
-
-#define READ(v, t)	do {						\
-	if (oldp != NULL && oldlenp != NULL) {				\
-		if (*oldlenp != sizeof(t)) {				\
-			size_t	copylen = (sizeof(t) <= *oldlenp)	\
-			    ? sizeof(t) : *oldlenp;			\
-			memcpy(oldp, (void *)&(v), copylen);		\
-			ret = EINVAL;					\
-			goto label_return;				\
-		}							\
-		*(t *)oldp = (v);					\
-	}								\
-} while (0)
-
-#define WRITE(v, t)	do {						\
-	if (newp != NULL) {						\
-		if (newlen != sizeof(t)) {				\
-			ret = EINVAL;					\
-			goto label_return;				\
-		}							\
-		(v) = *(t *)newp;					\
-	}								\
-} while (0)
-
-#define MIB_UNSIGNED(v, i) do {						\
-	if (mib[i] > UINT_MAX) {					\
-		ret = EFAULT;						\
-		goto label_return;					\
-	}								\
-	v = (unsigned)mib[i];						\
-} while (0)
-
-/*
- * There's a lot of code duplication in the following macros due to limitations
- * in how nested cpp macros are expanded.
- */
-#define CTL_RO_CLGEN(c, l, n, v, t)					\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	if (!(c)) {							\
-		return ENOENT;						\
-	}								\
-	if (l) {							\
-		malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);		\
-	}								\
-	READONLY();							\
-	oldval = (v);							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	if (l) {							\
-		malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);		\
-	}								\
-	return ret;							\
-}
-
-#define CTL_RO_CGEN(c, n, v, t)						\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	if (!(c)) {							\
-		return ENOENT;						\
-	}								\
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);			\
-	READONLY();							\
-	oldval = (v);							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);			\
-	return ret;							\
-}
-
-#define CTL_RO_GEN(n, v, t)						\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);			\
-	READONLY();							\
-	oldval = (v);							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);			\
-	return ret;							\
-}
-
-/*
- * ctl_mtx is not acquired, under the assumption that no pertinent data will
- * mutate during the call.
- */
-#define CTL_RO_NL_CGEN(c, n, v, t)					\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	if (!(c)) {							\
-		return ENOENT;						\
-	}								\
-	READONLY();							\
-	oldval = (v);							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	return ret;							\
-}
-
-#define CTL_RO_NL_GEN(n, v, t)						\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	READONLY();							\
-	oldval = (v);							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	return ret;							\
-}
-
-#define CTL_TSD_RO_NL_CGEN(c, n, m, t)					\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	if (!(c)) {							\
-		return ENOENT;						\
-	}								\
-	READONLY();							\
-	oldval = (m(tsd));						\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	return ret;							\
-}
-
-#define CTL_RO_CONFIG_GEN(n, t)						\
-static int								\
-n##_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,	\
-    size_t *oldlenp, void *newp, size_t newlen) {			\
-	int ret;							\
-	t oldval;							\
-									\
-	READONLY();							\
-	oldval = n;							\
-	READ(oldval, t);						\
-									\
-	ret = 0;							\
-label_return:								\
-	return ret;							\
-}
-
-/******************************************************************************/
-
-CTL_RO_NL_GEN(version, JEMALLOC_VERSION, const char *)
-
-static int
-epoch_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	UNUSED uint64_t newval;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	WRITE(newval, uint64_t);
-	if (newp != NULL) {
-		ctl_refresh(tsd_tsdn(tsd));
-	}
-	READ(ctl_arenas->epoch, uint64_t);
-
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static int
-background_thread_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	if (!have_background_thread) {
-		return ENOENT;
-	}
-	background_thread_ctl_init(tsd_tsdn(tsd));
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
-	if (newp == NULL) {
-		oldval = background_thread_enabled();
-		READ(oldval, bool);
-	} else {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		oldval = background_thread_enabled();
-		READ(oldval, bool);
-
-		bool newval = *(bool *)newp;
-		if (newval == oldval) {
-			ret = 0;
-			goto label_return;
-		}
-
-		background_thread_enabled_set(tsd_tsdn(tsd), newval);
-		if (newval) {
-			if (!can_enable_background_thread) {
-				malloc_printf("<jemalloc>: Error in dlsym("
-			            "RTLD_NEXT, \"pthread_create\"). Cannot "
-				    "enable background_thread\n");
-				ret = EFAULT;
-				goto label_return;
-			}
-			if (background_threads_enable(tsd)) {
-				ret = EFAULT;
-				goto label_return;
-			}
-		} else {
-			if (background_threads_disable(tsd)) {
-				ret = EFAULT;
-				goto label_return;
-			}
-		}
-	}
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-
-	return ret;
-}
-
-static int
-max_background_threads_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	size_t oldval;
-
-	if (!have_background_thread) {
-		return ENOENT;
-	}
-	background_thread_ctl_init(tsd_tsdn(tsd));
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
-	if (newp == NULL) {
-		oldval = max_background_threads;
-		READ(oldval, size_t);
-	} else {
-		if (newlen != sizeof(size_t)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		oldval = max_background_threads;
-		READ(oldval, size_t);
-
-		size_t newval = *(size_t *)newp;
-		if (newval == oldval) {
-			ret = 0;
-			goto label_return;
-		}
-		if (newval > opt_max_background_threads) {
-			ret = EINVAL;
-			goto label_return;
-		}
-
-		if (background_thread_enabled()) {
-			if (!can_enable_background_thread) {
-				malloc_printf("<jemalloc>: Error in dlsym("
-			            "RTLD_NEXT, \"pthread_create\"). Cannot "
-				    "enable background_thread\n");
-				ret = EFAULT;
-				goto label_return;
-			}
-			background_thread_enabled_set(tsd_tsdn(tsd), false);
-			if (background_threads_disable(tsd)) {
-				ret = EFAULT;
-				goto label_return;
-			}
-			max_background_threads = newval;
-			background_thread_enabled_set(tsd_tsdn(tsd), true);
-			if (background_threads_enable(tsd)) {
-				ret = EFAULT;
-				goto label_return;
-			}
-		} else {
-			max_background_threads = newval;
-		}
-	}
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-
-	return ret;
-}
-
-/******************************************************************************/
-
-CTL_RO_CONFIG_GEN(config_cache_oblivious, bool)
-CTL_RO_CONFIG_GEN(config_debug, bool)
-CTL_RO_CONFIG_GEN(config_fill, bool)
-CTL_RO_CONFIG_GEN(config_lazy_lock, bool)
-CTL_RO_CONFIG_GEN(config_malloc_conf, const char *)
-CTL_RO_CONFIG_GEN(config_prof, bool)
-CTL_RO_CONFIG_GEN(config_prof_libgcc, bool)
-CTL_RO_CONFIG_GEN(config_prof_libunwind, bool)
-CTL_RO_CONFIG_GEN(config_stats, bool)
-CTL_RO_CONFIG_GEN(config_utrace, bool)
-CTL_RO_CONFIG_GEN(config_xmalloc, bool)
-
-/******************************************************************************/
-
-CTL_RO_NL_GEN(opt_abort, opt_abort, bool)
-CTL_RO_NL_GEN(opt_abort_conf, opt_abort_conf, bool)
-CTL_RO_NL_GEN(opt_metadata_thp, metadata_thp_mode_names[opt_metadata_thp],
-    const char *)
-CTL_RO_NL_GEN(opt_retain, opt_retain, bool)
-CTL_RO_NL_GEN(opt_dss, opt_dss, const char *)
-CTL_RO_NL_GEN(opt_narenas, opt_narenas, unsigned)
-CTL_RO_NL_GEN(opt_percpu_arena, percpu_arena_mode_names[opt_percpu_arena],
-    const char *)
-CTL_RO_NL_GEN(opt_background_thread, opt_background_thread, bool)
-CTL_RO_NL_GEN(opt_max_background_threads, opt_max_background_threads, size_t)
-CTL_RO_NL_GEN(opt_dirty_decay_ms, opt_dirty_decay_ms, ssize_t)
-CTL_RO_NL_GEN(opt_muzzy_decay_ms, opt_muzzy_decay_ms, ssize_t)
-CTL_RO_NL_GEN(opt_stats_print, opt_stats_print, bool)
-CTL_RO_NL_GEN(opt_stats_print_opts, opt_stats_print_opts, const char *)
-CTL_RO_NL_CGEN(config_fill, opt_junk, opt_junk, const char *)
-CTL_RO_NL_CGEN(config_fill, opt_zero, opt_zero, bool)
-CTL_RO_NL_CGEN(config_utrace, opt_utrace, opt_utrace, bool)
-CTL_RO_NL_CGEN(config_xmalloc, opt_xmalloc, opt_xmalloc, bool)
-CTL_RO_NL_GEN(opt_tcache, opt_tcache, bool)
-CTL_RO_NL_GEN(opt_thp, thp_mode_names[opt_thp], const char *)
-CTL_RO_NL_GEN(opt_lg_extent_max_active_fit, opt_lg_extent_max_active_fit,
-    size_t)
-CTL_RO_NL_GEN(opt_lg_tcache_max, opt_lg_tcache_max, ssize_t)
-CTL_RO_NL_CGEN(config_prof, opt_prof, opt_prof, bool)
-CTL_RO_NL_CGEN(config_prof, opt_prof_prefix, opt_prof_prefix, const char *)
-CTL_RO_NL_CGEN(config_prof, opt_prof_active, opt_prof_active, bool)
-CTL_RO_NL_CGEN(config_prof, opt_prof_thread_active_init,
-    opt_prof_thread_active_init, bool)
-CTL_RO_NL_CGEN(config_prof, opt_lg_prof_sample, opt_lg_prof_sample, size_t)
-CTL_RO_NL_CGEN(config_prof, opt_prof_accum, opt_prof_accum, bool)
-CTL_RO_NL_CGEN(config_prof, opt_lg_prof_interval, opt_lg_prof_interval, ssize_t)
-CTL_RO_NL_CGEN(config_prof, opt_prof_gdump, opt_prof_gdump, bool)
-CTL_RO_NL_CGEN(config_prof, opt_prof_final, opt_prof_final, bool)
-CTL_RO_NL_CGEN(config_prof, opt_prof_leak, opt_prof_leak, bool)
-
-/******************************************************************************/
-
-static int
-thread_arena_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	arena_t *oldarena;
-	unsigned newind, oldind;
-
-	oldarena = arena_choose(tsd, NULL);
-	if (oldarena == NULL) {
-		return EAGAIN;
-	}
-	newind = oldind = arena_ind_get(oldarena);
-	WRITE(newind, unsigned);
-	READ(oldind, unsigned);
-
-	if (newind != oldind) {
-		arena_t *newarena;
-
-		if (newind >= narenas_total_get()) {
-			/* New arena index is out of range. */
-			ret = EFAULT;
-			goto label_return;
-		}
-
-		if (have_percpu_arena &&
-		    PERCPU_ARENA_ENABLED(opt_percpu_arena)) {
-			if (newind < percpu_arena_ind_limit(opt_percpu_arena)) {
-				/*
-				 * If perCPU arena is enabled, thread_arena
-				 * control is not allowed for the auto arena
-				 * range.
-				 */
-				ret = EPERM;
-				goto label_return;
-			}
-		}
-
-		/* Initialize arena if necessary. */
-		newarena = arena_get(tsd_tsdn(tsd), newind, true);
-		if (newarena == NULL) {
-			ret = EAGAIN;
-			goto label_return;
-		}
-		/* Set new arena/tcache associations. */
-		arena_migrate(tsd, oldind, newind);
-		if (tcache_available(tsd)) {
-			tcache_arena_reassociate(tsd_tsdn(tsd),
-			    tsd_tcachep_get(tsd), newarena);
-		}
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-CTL_TSD_RO_NL_CGEN(config_stats, thread_allocated, tsd_thread_allocated_get,
-    uint64_t)
-CTL_TSD_RO_NL_CGEN(config_stats, thread_allocatedp, tsd_thread_allocatedp_get,
-    uint64_t *)
-CTL_TSD_RO_NL_CGEN(config_stats, thread_deallocated, tsd_thread_deallocated_get,
-    uint64_t)
-CTL_TSD_RO_NL_CGEN(config_stats, thread_deallocatedp,
-    tsd_thread_deallocatedp_get, uint64_t *)
-
-static int
-thread_tcache_enabled_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	oldval = tcache_enabled_get(tsd);
-	if (newp != NULL) {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		tcache_enabled_set(tsd, *(bool *)newp);
-	}
-	READ(oldval, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-thread_tcache_flush_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-
-	if (!tcache_available(tsd)) {
-		ret = EFAULT;
-		goto label_return;
-	}
-
-	READONLY();
-	WRITEONLY();
-
-	tcache_flush(tsd);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-thread_prof_name_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	READ_XOR_WRITE();
-
-	if (newp != NULL) {
-		if (newlen != sizeof(const char *)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-
-		if ((ret = prof_thread_name_set(tsd, *(const char **)newp)) !=
-		    0) {
-			goto label_return;
-		}
-	} else {
-		const char *oldname = prof_thread_name_get(tsd);
-		READ(oldname, const char *);
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-thread_prof_active_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	oldval = prof_thread_active_get(tsd);
-	if (newp != NULL) {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		if (prof_thread_active_set(tsd, *(bool *)newp)) {
-			ret = EAGAIN;
-			goto label_return;
-		}
-	}
-	READ(oldval, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-/******************************************************************************/
-
-static int
-tcache_create_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned tcache_ind;
-
-	READONLY();
-	if (tcaches_create(tsd, &tcache_ind)) {
-		ret = EFAULT;
-		goto label_return;
-	}
-	READ(tcache_ind, unsigned);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-tcache_flush_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned tcache_ind;
-
-	WRITEONLY();
-	tcache_ind = UINT_MAX;
-	WRITE(tcache_ind, unsigned);
-	if (tcache_ind == UINT_MAX) {
-		ret = EFAULT;
-		goto label_return;
-	}
-	tcaches_flush(tsd, tcache_ind);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-tcache_destroy_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned tcache_ind;
-
-	WRITEONLY();
-	tcache_ind = UINT_MAX;
-	WRITE(tcache_ind, unsigned);
-	if (tcache_ind == UINT_MAX) {
-		ret = EFAULT;
-		goto label_return;
-	}
-	tcaches_destroy(tsd, tcache_ind);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-/******************************************************************************/
-
-static int
-arena_i_initialized_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	tsdn_t *tsdn = tsd_tsdn(tsd);
-	unsigned arena_ind;
-	bool initialized;
-
-	READONLY();
-	MIB_UNSIGNED(arena_ind, 1);
-
-	malloc_mutex_lock(tsdn, &ctl_mtx);
-	initialized = arenas_i(arena_ind)->initialized;
-	malloc_mutex_unlock(tsdn, &ctl_mtx);
-
-	READ(initialized, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static void
-arena_i_decay(tsdn_t *tsdn, unsigned arena_ind, bool all) {
-	malloc_mutex_lock(tsdn, &ctl_mtx);
-	{
-		unsigned narenas = ctl_arenas->narenas;
-
-		/*
-		 * Access via index narenas is deprecated, and scheduled for
-		 * removal in 6.0.0.
-		 */
-		if (arena_ind == MALLCTL_ARENAS_ALL || arena_ind == narenas) {
-			unsigned i;
-			VARIABLE_ARRAY(arena_t *, tarenas, narenas);
-
-			for (i = 0; i < narenas; i++) {
-				tarenas[i] = arena_get(tsdn, i, false);
-			}
-
-			/*
-			 * No further need to hold ctl_mtx, since narenas and
-			 * tarenas contain everything needed below.
-			 */
-			malloc_mutex_unlock(tsdn, &ctl_mtx);
-
-			for (i = 0; i < narenas; i++) {
-				if (tarenas[i] != NULL) {
-					arena_decay(tsdn, tarenas[i], false,
-					    all);
-				}
-			}
-		} else {
-			arena_t *tarena;
-
-			assert(arena_ind < narenas);
-
-			tarena = arena_get(tsdn, arena_ind, false);
-
-			/* No further need to hold ctl_mtx. */
-			malloc_mutex_unlock(tsdn, &ctl_mtx);
-
-			if (tarena != NULL) {
-				arena_decay(tsdn, tarena, false, all);
-			}
-		}
-	}
-}
-
-static int
-arena_i_decay_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-
-	READONLY();
-	WRITEONLY();
-	MIB_UNSIGNED(arena_ind, 1);
-	arena_i_decay(tsd_tsdn(tsd), arena_ind, false);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-arena_i_purge_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-
-	READONLY();
-	WRITEONLY();
-	MIB_UNSIGNED(arena_ind, 1);
-	arena_i_decay(tsd_tsdn(tsd), arena_ind, true);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-arena_i_reset_destroy_helper(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen, unsigned *arena_ind,
-    arena_t **arena) {
-	int ret;
-
-	READONLY();
-	WRITEONLY();
-	MIB_UNSIGNED(*arena_ind, 1);
-
-	*arena = arena_get(tsd_tsdn(tsd), *arena_ind, false);
-	if (*arena == NULL || arena_is_auto(*arena)) {
-		ret = EFAULT;
-		goto label_return;
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static void
-arena_reset_prepare_background_thread(tsd_t *tsd, unsigned arena_ind) {
-	/* Temporarily disable the background thread during arena reset. */
-	if (have_background_thread) {
-		malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
-		if (background_thread_enabled()) {
-			unsigned ind = arena_ind % ncpus;
-			background_thread_info_t *info =
-			    &background_thread_info[ind];
-			assert(info->state == background_thread_started);
-			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-			info->state = background_thread_paused;
-			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-		}
-	}
-}
-
-static void
-arena_reset_finish_background_thread(tsd_t *tsd, unsigned arena_ind) {
-	if (have_background_thread) {
-		if (background_thread_enabled()) {
-			unsigned ind = arena_ind % ncpus;
-			background_thread_info_t *info =
-			    &background_thread_info[ind];
-			assert(info->state == background_thread_paused);
-			malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-			info->state = background_thread_started;
-			malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
-	}
-}
-
-static int
-arena_i_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-	arena_t *arena;
-
-	ret = arena_i_reset_destroy_helper(tsd, mib, miblen, oldp, oldlenp,
-	    newp, newlen, &arena_ind, &arena);
-	if (ret != 0) {
-		return ret;
-	}
-
-	arena_reset_prepare_background_thread(tsd, arena_ind);
-	arena_reset(tsd, arena);
-	arena_reset_finish_background_thread(tsd, arena_ind);
-
-	return ret;
-}
-
-static int
-arena_i_destroy_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-	arena_t *arena;
-	ctl_arena_t *ctl_darena, *ctl_arena;
-
-	ret = arena_i_reset_destroy_helper(tsd, mib, miblen, oldp, oldlenp,
-	    newp, newlen, &arena_ind, &arena);
-	if (ret != 0) {
-		goto label_return;
-	}
-
-	if (arena_nthreads_get(arena, false) != 0 || arena_nthreads_get(arena,
-	    true) != 0) {
-		ret = EFAULT;
-		goto label_return;
-	}
-
-	arena_reset_prepare_background_thread(tsd, arena_ind);
-	/* Merge stats after resetting and purging arena. */
-	arena_reset(tsd, arena);
-	arena_decay(tsd_tsdn(tsd), arena, false, true);
-	ctl_darena = arenas_i(MALLCTL_ARENAS_DESTROYED);
-	ctl_darena->initialized = true;
-	ctl_arena_refresh(tsd_tsdn(tsd), arena, ctl_darena, arena_ind, true);
-	/* Destroy arena. */
-	arena_destroy(tsd, arena);
-	ctl_arena = arenas_i(arena_ind);
-	ctl_arena->initialized = false;
-	/* Record arena index for later recycling via arenas.create. */
-	ql_elm_new(ctl_arena, destroyed_link);
-	ql_tail_insert(&ctl_arenas->destroyed, ctl_arena, destroyed_link);
-	arena_reset_finish_background_thread(tsd, arena_ind);
-
-	assert(ret == 0);
-label_return:
-	return ret;
-}
-
-static int
-arena_i_dss_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	const char *dss = NULL;
-	unsigned arena_ind;
-	dss_prec_t dss_prec_old = dss_prec_limit;
-	dss_prec_t dss_prec = dss_prec_limit;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	WRITE(dss, const char *);
-	MIB_UNSIGNED(arena_ind, 1);
-	if (dss != NULL) {
-		int i;
-		bool match = false;
-
-		for (i = 0; i < dss_prec_limit; i++) {
-			if (strcmp(dss_prec_names[i], dss) == 0) {
-				dss_prec = i;
-				match = true;
-				break;
-			}
-		}
-
-		if (!match) {
-			ret = EINVAL;
-			goto label_return;
-		}
-	}
-
-	/*
-	 * Access via index narenas is deprecated, and scheduled for removal in
-	 * 6.0.0.
-	 */
-	if (arena_ind == MALLCTL_ARENAS_ALL || arena_ind ==
-	    ctl_arenas->narenas) {
-		if (dss_prec != dss_prec_limit &&
-		    extent_dss_prec_set(dss_prec)) {
-			ret = EFAULT;
-			goto label_return;
-		}
-		dss_prec_old = extent_dss_prec_get();
-	} else {
-		arena_t *arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
-		if (arena == NULL || (dss_prec != dss_prec_limit &&
-		    arena_dss_prec_set(arena, dss_prec))) {
-			ret = EFAULT;
-			goto label_return;
-		}
-		dss_prec_old = arena_dss_prec_get(arena);
-	}
-
-	dss = dss_prec_names[dss_prec_old];
-	READ(dss, const char *);
-
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static int
-arena_i_decay_ms_ctl_impl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen, bool dirty) {
-	int ret;
-	unsigned arena_ind;
-	arena_t *arena;
-
-	MIB_UNSIGNED(arena_ind, 1);
-	arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
-	if (arena == NULL) {
-		ret = EFAULT;
-		goto label_return;
-	}
-
-	if (oldp != NULL && oldlenp != NULL) {
-		size_t oldval = dirty ? arena_dirty_decay_ms_get(arena) :
-		    arena_muzzy_decay_ms_get(arena);
-		READ(oldval, ssize_t);
-	}
-	if (newp != NULL) {
-		if (newlen != sizeof(ssize_t)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		if (dirty ? arena_dirty_decay_ms_set(tsd_tsdn(tsd), arena,
-		    *(ssize_t *)newp) : arena_muzzy_decay_ms_set(tsd_tsdn(tsd),
-		    arena, *(ssize_t *)newp)) {
-			ret = EFAULT;
-			goto label_return;
-		}
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-arena_i_dirty_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	return arena_i_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
-	    newlen, true);
-}
-
-static int
-arena_i_muzzy_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	return arena_i_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
-	    newlen, false);
-}
-
-static int
-arena_i_extent_hooks_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-	arena_t *arena;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	MIB_UNSIGNED(arena_ind, 1);
-	if (arena_ind < narenas_total_get()) {
-		extent_hooks_t *old_extent_hooks;
-		arena = arena_get(tsd_tsdn(tsd), arena_ind, false);
-		if (arena == NULL) {
-			if (arena_ind >= narenas_auto) {
-				ret = EFAULT;
-				goto label_return;
-			}
-			old_extent_hooks =
-			    (extent_hooks_t *)&extent_hooks_default;
-			READ(old_extent_hooks, extent_hooks_t *);
-			if (newp != NULL) {
-				/* Initialize a new arena as a side effect. */
-				extent_hooks_t *new_extent_hooks
-				    JEMALLOC_CC_SILENCE_INIT(NULL);
-				WRITE(new_extent_hooks, extent_hooks_t *);
-				arena = arena_init(tsd_tsdn(tsd), arena_ind,
-				    new_extent_hooks);
-				if (arena == NULL) {
-					ret = EFAULT;
-					goto label_return;
-				}
-			}
-		} else {
-			if (newp != NULL) {
-				extent_hooks_t *new_extent_hooks
-				    JEMALLOC_CC_SILENCE_INIT(NULL);
-				WRITE(new_extent_hooks, extent_hooks_t *);
-				old_extent_hooks = extent_hooks_set(tsd, arena,
-				    new_extent_hooks);
-				READ(old_extent_hooks, extent_hooks_t *);
-			} else {
-				old_extent_hooks = extent_hooks_get(arena);
-				READ(old_extent_hooks, extent_hooks_t *);
-			}
-		}
-	} else {
-		ret = EFAULT;
-		goto label_return;
-	}
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static int
-arena_i_retain_grow_limit_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-	arena_t *arena;
-
-	if (!opt_retain) {
-		/* Only relevant when retain is enabled. */
-		return ENOENT;
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	MIB_UNSIGNED(arena_ind, 1);
-	if (arena_ind < narenas_total_get() && (arena =
-	    arena_get(tsd_tsdn(tsd), arena_ind, false)) != NULL) {
-		size_t old_limit, new_limit;
-		if (newp != NULL) {
-			WRITE(new_limit, size_t);
-		}
-		bool err = arena_retain_grow_limit_get_set(tsd, arena,
-		    &old_limit, newp != NULL ? &new_limit : NULL);
-		if (!err) {
-			READ(old_limit, size_t);
-			ret = 0;
-		} else {
-			ret = EFAULT;
-		}
-	} else {
-		ret = EFAULT;
-	}
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static const ctl_named_node_t *
-arena_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
-	const ctl_named_node_t *ret;
-
-	malloc_mutex_lock(tsdn, &ctl_mtx);
-	switch (i) {
-	case MALLCTL_ARENAS_ALL:
-	case MALLCTL_ARENAS_DESTROYED:
-		break;
-	default:
-		if (i > ctl_arenas->narenas) {
-			ret = NULL;
-			goto label_return;
-		}
-		break;
-	}
-
-	ret = super_arena_i_node;
-label_return:
-	malloc_mutex_unlock(tsdn, &ctl_mtx);
-	return ret;
-}
-
-/******************************************************************************/
-
-static int
-arenas_narenas_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned narenas;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	READONLY();
-	if (*oldlenp != sizeof(unsigned)) {
-		ret = EINVAL;
-		goto label_return;
-	}
-	narenas = ctl_arenas->narenas;
-	READ(narenas, unsigned);
-
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static int
-arenas_decay_ms_ctl_impl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen, bool dirty) {
-	int ret;
-
-	if (oldp != NULL && oldlenp != NULL) {
-		size_t oldval = (dirty ? arena_dirty_decay_ms_default_get() :
-		    arena_muzzy_decay_ms_default_get());
-		READ(oldval, ssize_t);
-	}
-	if (newp != NULL) {
-		if (newlen != sizeof(ssize_t)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		if (dirty ? arena_dirty_decay_ms_default_set(*(ssize_t *)newp)
-		    : arena_muzzy_decay_ms_default_set(*(ssize_t *)newp)) {
-			ret = EFAULT;
-			goto label_return;
-		}
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-arenas_dirty_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	return arenas_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
-	    newlen, true);
-}
-
-static int
-arenas_muzzy_decay_ms_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	return arenas_decay_ms_ctl_impl(tsd, mib, miblen, oldp, oldlenp, newp,
-	    newlen, false);
-}
-
-CTL_RO_NL_GEN(arenas_quantum, QUANTUM, size_t)
-CTL_RO_NL_GEN(arenas_page, PAGE, size_t)
-CTL_RO_NL_GEN(arenas_tcache_max, tcache_maxclass, size_t)
-CTL_RO_NL_GEN(arenas_nbins, NBINS, unsigned)
-CTL_RO_NL_GEN(arenas_nhbins, nhbins, unsigned)
-CTL_RO_NL_GEN(arenas_bin_i_size, bin_infos[mib[2]].reg_size, size_t)
-CTL_RO_NL_GEN(arenas_bin_i_nregs, bin_infos[mib[2]].nregs, uint32_t)
-CTL_RO_NL_GEN(arenas_bin_i_slab_size, bin_infos[mib[2]].slab_size, size_t)
-static const ctl_named_node_t *
-arenas_bin_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
-	if (i > NBINS) {
-		return NULL;
-	}
-	return super_arenas_bin_i_node;
-}
-
-CTL_RO_NL_GEN(arenas_nlextents, NSIZES - NBINS, unsigned)
-CTL_RO_NL_GEN(arenas_lextent_i_size, sz_index2size(NBINS+(szind_t)mib[2]),
-    size_t)
-static const ctl_named_node_t *
-arenas_lextent_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
-    size_t i) {
-	if (i > NSIZES - NBINS) {
-		return NULL;
-	}
-	return super_arenas_lextent_i_node;
-}
-
-static int
-arenas_create_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	extent_hooks_t *extent_hooks;
-	unsigned arena_ind;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-
-	extent_hooks = (extent_hooks_t *)&extent_hooks_default;
-	WRITE(extent_hooks, extent_hooks_t *);
-	if ((arena_ind = ctl_arena_init(tsd, extent_hooks)) == UINT_MAX) {
-		ret = EAGAIN;
-		goto label_return;
-	}
-	READ(arena_ind, unsigned);
-
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-static int
-arenas_lookup_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	unsigned arena_ind;
-	void *ptr;
-	extent_t *extent;
-	arena_t *arena;
-
-	ptr = NULL;
-	ret = EINVAL;
-	malloc_mutex_lock(tsd_tsdn(tsd), &ctl_mtx);
-	WRITE(ptr, void *);
-	extent = iealloc(tsd_tsdn(tsd), ptr);
-	if (extent == NULL)
-		goto label_return;
-
-	arena = extent_arena_get(extent);
-	if (arena == NULL)
-		goto label_return;
-
-	arena_ind = arena_ind_get(arena);
-	READ(arena_ind, unsigned);
-
-	ret = 0;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &ctl_mtx);
-	return ret;
-}
-
-/******************************************************************************/
-
-static int
-prof_thread_active_init_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	if (newp != NULL) {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		oldval = prof_thread_active_init_set(tsd_tsdn(tsd),
-		    *(bool *)newp);
-	} else {
-		oldval = prof_thread_active_init_get(tsd_tsdn(tsd));
-	}
-	READ(oldval, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-prof_active_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	if (newp != NULL) {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		oldval = prof_active_set(tsd_tsdn(tsd), *(bool *)newp);
-	} else {
-		oldval = prof_active_get(tsd_tsdn(tsd));
-	}
-	READ(oldval, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-prof_dump_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	const char *filename = NULL;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	WRITEONLY();
-	WRITE(filename, const char *);
-
-	if (prof_mdump(tsd, filename)) {
-		ret = EFAULT;
-		goto label_return;
-	}
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-prof_gdump_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	bool oldval;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	if (newp != NULL) {
-		if (newlen != sizeof(bool)) {
-			ret = EINVAL;
-			goto label_return;
-		}
-		oldval = prof_gdump_set(tsd_tsdn(tsd), *(bool *)newp);
-	} else {
-		oldval = prof_gdump_get(tsd_tsdn(tsd));
-	}
-	READ(oldval, bool);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-static int
-prof_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen, void *oldp,
-    size_t *oldlenp, void *newp, size_t newlen) {
-	int ret;
-	size_t lg_sample = lg_prof_sample;
-
-	if (!config_prof) {
-		return ENOENT;
-	}
-
-	WRITEONLY();
-	WRITE(lg_sample, size_t);
-	if (lg_sample >= (sizeof(uint64_t) << 3)) {
-		lg_sample = (sizeof(uint64_t) << 3) - 1;
-	}
-
-	prof_reset(tsd, lg_sample);
-
-	ret = 0;
-label_return:
-	return ret;
-}
-
-CTL_RO_NL_CGEN(config_prof, prof_interval, prof_interval, uint64_t)
-CTL_RO_NL_CGEN(config_prof, lg_prof_sample, lg_prof_sample, size_t)
-
-/******************************************************************************/
-
-CTL_RO_CGEN(config_stats, stats_allocated, ctl_stats->allocated, size_t)
-CTL_RO_CGEN(config_stats, stats_active, ctl_stats->active, size_t)
-CTL_RO_CGEN(config_stats, stats_metadata, ctl_stats->metadata, size_t)
-CTL_RO_CGEN(config_stats, stats_metadata_thp, ctl_stats->metadata_thp, size_t)
-CTL_RO_CGEN(config_stats, stats_resident, ctl_stats->resident, size_t)
-CTL_RO_CGEN(config_stats, stats_mapped, ctl_stats->mapped, size_t)
-CTL_RO_CGEN(config_stats, stats_retained, ctl_stats->retained, size_t)
-
-CTL_RO_CGEN(config_stats, stats_background_thread_num_threads,
-    ctl_stats->background_thread.num_threads, size_t)
-CTL_RO_CGEN(config_stats, stats_background_thread_num_runs,
-    ctl_stats->background_thread.num_runs, uint64_t)
-CTL_RO_CGEN(config_stats, stats_background_thread_run_interval,
-    nstime_ns(&ctl_stats->background_thread.run_interval), uint64_t)
-
-CTL_RO_GEN(stats_arenas_i_dss, arenas_i(mib[2])->dss, const char *)
-CTL_RO_GEN(stats_arenas_i_dirty_decay_ms, arenas_i(mib[2])->dirty_decay_ms,
-    ssize_t)
-CTL_RO_GEN(stats_arenas_i_muzzy_decay_ms, arenas_i(mib[2])->muzzy_decay_ms,
-    ssize_t)
-CTL_RO_GEN(stats_arenas_i_nthreads, arenas_i(mib[2])->nthreads, unsigned)
-CTL_RO_GEN(stats_arenas_i_uptime,
-    nstime_ns(&arenas_i(mib[2])->astats->astats.uptime), uint64_t)
-CTL_RO_GEN(stats_arenas_i_pactive, arenas_i(mib[2])->pactive, size_t)
-CTL_RO_GEN(stats_arenas_i_pdirty, arenas_i(mib[2])->pdirty, size_t)
-CTL_RO_GEN(stats_arenas_i_pmuzzy, arenas_i(mib[2])->pmuzzy, size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_mapped,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.mapped, ATOMIC_RELAXED),
-    size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_retained,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.retained, ATOMIC_RELAXED),
-    size_t)
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_npurge,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_dirty.npurge), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_nmadvise,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_dirty.nmadvise), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_dirty_purged,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_dirty.purged), uint64_t)
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_npurge,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_muzzy.npurge), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_nmadvise,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_muzzy.nmadvise), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_muzzy_purged,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.decay_muzzy.purged), uint64_t)
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_base,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.base, ATOMIC_RELAXED),
-    size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_internal,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.internal, ATOMIC_RELAXED),
-    size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_metadata_thp,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.metadata_thp,
-    ATOMIC_RELAXED), size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_tcache_bytes,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.tcache_bytes,
-    ATOMIC_RELAXED), size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_resident,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.resident, ATOMIC_RELAXED),
-    size_t)
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_small_allocated,
-    arenas_i(mib[2])->astats->allocated_small, size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_small_nmalloc,
-    arenas_i(mib[2])->astats->nmalloc_small, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_small_ndalloc,
-    arenas_i(mib[2])->astats->ndalloc_small, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_small_nrequests,
-    arenas_i(mib[2])->astats->nrequests_small, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_large_allocated,
-    atomic_load_zu(&arenas_i(mib[2])->astats->astats.allocated_large,
-    ATOMIC_RELAXED), size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_large_nmalloc,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.nmalloc_large), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_large_ndalloc,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.ndalloc_large), uint64_t)
-/*
- * Note: "nmalloc" here instead of "nrequests" in the read.  This is intentional.
- */
-CTL_RO_CGEN(config_stats, stats_arenas_i_large_nrequests,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->astats.nmalloc_large), uint64_t) /* Intentional. */
-
-/* Lock profiling related APIs below. */
-#define RO_MUTEX_CTL_GEN(n, l)						\
-CTL_RO_CGEN(config_stats, stats_##n##_num_ops,				\
-    l.n_lock_ops, uint64_t)						\
-CTL_RO_CGEN(config_stats, stats_##n##_num_wait,				\
-    l.n_wait_times, uint64_t)						\
-CTL_RO_CGEN(config_stats, stats_##n##_num_spin_acq,			\
-    l.n_spin_acquired, uint64_t)					\
-CTL_RO_CGEN(config_stats, stats_##n##_num_owner_switch,			\
-    l.n_owner_switches, uint64_t) 					\
-CTL_RO_CGEN(config_stats, stats_##n##_total_wait_time,			\
-    nstime_ns(&l.tot_wait_time), uint64_t)				\
-CTL_RO_CGEN(config_stats, stats_##n##_max_wait_time,			\
-    nstime_ns(&l.max_wait_time), uint64_t)				\
-CTL_RO_CGEN(config_stats, stats_##n##_max_num_thds,			\
-    l.max_n_thds, uint32_t)
-
-/* Global mutexes. */
-#define OP(mtx)								\
-    RO_MUTEX_CTL_GEN(mutexes_##mtx,					\
-        ctl_stats->mutex_prof_data[global_prof_mutex_##mtx])
-MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-
-/* Per arena mutexes */
-#define OP(mtx) RO_MUTEX_CTL_GEN(arenas_i_mutexes_##mtx,		\
-    arenas_i(mib[2])->astats->astats.mutex_prof_data[arena_prof_mutex_##mtx])
-MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-
-/* tcache bin mutex */
-RO_MUTEX_CTL_GEN(arenas_i_bins_j_mutex,
-    arenas_i(mib[2])->astats->bstats[mib[4]].mutex_data)
-#undef RO_MUTEX_CTL_GEN
-
-/* Resets all mutex stats, including global, arena and bin mutexes. */
-static int
-stats_mutexes_reset_ctl(tsd_t *tsd, const size_t *mib, size_t miblen,
-    void *oldp, size_t *oldlenp, void *newp, size_t newlen) {
-	if (!config_stats) {
-		return ENOENT;
-	}
-
-	tsdn_t *tsdn = tsd_tsdn(tsd);
-
-#define MUTEX_PROF_RESET(mtx)						\
-    malloc_mutex_lock(tsdn, &mtx);					\
-    malloc_mutex_prof_data_reset(tsdn, &mtx);				\
-    malloc_mutex_unlock(tsdn, &mtx);
-
-	/* Global mutexes: ctl and prof. */
-	MUTEX_PROF_RESET(ctl_mtx);
-	if (have_background_thread) {
-		MUTEX_PROF_RESET(background_thread_lock);
-	}
-	if (config_prof && opt_prof) {
-		MUTEX_PROF_RESET(bt2gctx_mtx);
-	}
-
-
-	/* Per arena mutexes. */
-	unsigned n = narenas_total_get();
-
-	for (unsigned i = 0; i < n; i++) {
-		arena_t *arena = arena_get(tsdn, i, false);
-		if (!arena) {
-			continue;
-		}
-		MUTEX_PROF_RESET(arena->large_mtx);
-		MUTEX_PROF_RESET(arena->extent_avail_mtx);
-		MUTEX_PROF_RESET(arena->extents_dirty.mtx);
-		MUTEX_PROF_RESET(arena->extents_muzzy.mtx);
-		MUTEX_PROF_RESET(arena->extents_retained.mtx);
-		MUTEX_PROF_RESET(arena->decay_dirty.mtx);
-		MUTEX_PROF_RESET(arena->decay_muzzy.mtx);
-		MUTEX_PROF_RESET(arena->tcache_ql_mtx);
-		MUTEX_PROF_RESET(arena->base->mtx);
-
-		for (szind_t i = 0; i < NBINS; i++) {
-			bin_t *bin = &arena->bins[i];
-			MUTEX_PROF_RESET(bin->lock);
-		}
-	}
-#undef MUTEX_PROF_RESET
-	return 0;
-}
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nmalloc,
-    arenas_i(mib[2])->astats->bstats[mib[4]].nmalloc, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_ndalloc,
-    arenas_i(mib[2])->astats->bstats[mib[4]].ndalloc, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nrequests,
-    arenas_i(mib[2])->astats->bstats[mib[4]].nrequests, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_curregs,
-    arenas_i(mib[2])->astats->bstats[mib[4]].curregs, size_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nfills,
-    arenas_i(mib[2])->astats->bstats[mib[4]].nfills, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nflushes,
-    arenas_i(mib[2])->astats->bstats[mib[4]].nflushes, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nslabs,
-    arenas_i(mib[2])->astats->bstats[mib[4]].nslabs, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_nreslabs,
-    arenas_i(mib[2])->astats->bstats[mib[4]].reslabs, uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_bins_j_curslabs,
-    arenas_i(mib[2])->astats->bstats[mib[4]].curslabs, size_t)
-
-static const ctl_named_node_t *
-stats_arenas_i_bins_j_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
-    size_t j) {
-	if (j > NBINS) {
-		return NULL;
-	}
-	return super_stats_arenas_i_bins_j_node;
-}
-
-CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_nmalloc,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->lstats[mib[4]].nmalloc), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_ndalloc,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->lstats[mib[4]].ndalloc), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_nrequests,
-    ctl_arena_stats_read_u64(
-    &arenas_i(mib[2])->astats->lstats[mib[4]].nrequests), uint64_t)
-CTL_RO_CGEN(config_stats, stats_arenas_i_lextents_j_curlextents,
-    arenas_i(mib[2])->astats->lstats[mib[4]].curlextents, size_t)
-
-static const ctl_named_node_t *
-stats_arenas_i_lextents_j_index(tsdn_t *tsdn, const size_t *mib, size_t miblen,
-    size_t j) {
-	if (j > NSIZES - NBINS) {
-		return NULL;
-	}
-	return super_stats_arenas_i_lextents_j_node;
-}
-
-static const ctl_named_node_t *
-stats_arenas_i_index(tsdn_t *tsdn, const size_t *mib, size_t miblen, size_t i) {
-	const ctl_named_node_t *ret;
-	size_t a;
-
-	malloc_mutex_lock(tsdn, &ctl_mtx);
-	a = arenas_i2a_impl(i, true, true);
-	if (a == UINT_MAX || !ctl_arenas->arenas[a]->initialized) {
-		ret = NULL;
-		goto label_return;
-	}
-
-	ret = super_stats_arenas_i_node;
-label_return:
-	malloc_mutex_unlock(tsdn, &ctl_mtx);
-	return ret;
-}
diff --git a/redis-stable/deps/jemalloc/src/div.c b/redis-stable/deps/jemalloc/src/div.c
deleted file mode 100644
index 808892a1..00000000
--- a/redis-stable/deps/jemalloc/src/div.c
+++ /dev/null
@@ -1,55 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-
-#include "jemalloc/internal/div.h"
-
-#include "jemalloc/internal/assert.h"
-
-/*
- * Suppose we have n = q * d, all integers. We know n and d, and want q = n / d.
- *
- * For any k, we have (here, all division is exact; not C-style rounding):
- * floor(ceil(2^k / d) * n / 2^k) = floor((2^k + r) / d * n / 2^k), where
- * r = (-2^k) mod d.
- *
- * Expanding this out:
- * ... = floor(2^k / d * n / 2^k + r / d * n / 2^k)
- *     = floor(n / d + (r / d) * (n / 2^k)).
- *
- * The fractional part of n / d is 0 (because of the assumption that d divides n
- * exactly), so we have:
- * ... = n / d + floor((r / d) * (n / 2^k))
- *
- * So that our initial expression is equal to the quantity we seek, so long as
- * (r / d) * (n / 2^k) < 1.
- *
- * r is a remainder mod d, so r < d and r / d < 1 always. We can make
- * n / 2 ^ k < 1 by setting k = 32. This gets us a value of magic that works.
- */
-
-void
-div_init(div_info_t *div_info, size_t d) {
-	/* Nonsensical. */
-	assert(d != 0);
-	/*
-	 * This would make the value of magic too high to fit into a uint32_t
-	 * (we would want magic = 2^32 exactly). This would mess with code gen
-	 * on 32-bit machines.
-	 */
-	assert(d != 1);
-
-	uint64_t two_to_k = ((uint64_t)1 << 32);
-	uint32_t magic = (uint32_t)(two_to_k / d);
-
-	/*
-	 * We want magic = ceil(2^k / d), but C gives us floor. We have to
-	 * increment it unless the result was exact (i.e. unless d is a power of
-	 * two).
-	 */
-	if (two_to_k % d != 0) {
-		magic++;
-	}
-	div_info->magic = magic;
-#ifdef JEMALLOC_DEBUG
-	div_info->d = d;
-#endif
-}
diff --git a/redis-stable/deps/jemalloc/src/extent.c b/redis-stable/deps/jemalloc/src/extent.c
deleted file mode 100644
index 09d6d771..00000000
--- a/redis-stable/deps/jemalloc/src/extent.c
+++ /dev/null
@@ -1,2177 +0,0 @@
-#define JEMALLOC_EXTENT_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/ph.h"
-#include "jemalloc/internal/rtree.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_pool.h"
-
-/******************************************************************************/
-/* Data. */
-
-rtree_t		extents_rtree;
-/* Keyed by the address of the extent_t being protected. */
-mutex_pool_t	extent_mutex_pool;
-
-size_t opt_lg_extent_max_active_fit = LG_EXTENT_MAX_ACTIVE_FIT_DEFAULT;
-
-static const bitmap_info_t extents_bitmap_info =
-    BITMAP_INFO_INITIALIZER(NPSIZES+1);
-
-static void *extent_alloc_default(extent_hooks_t *extent_hooks, void *new_addr,
-    size_t size, size_t alignment, bool *zero, bool *commit,
-    unsigned arena_ind);
-static bool extent_dalloc_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, bool committed, unsigned arena_ind);
-static void extent_destroy_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, bool committed, unsigned arena_ind);
-static bool extent_commit_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind);
-static bool extent_commit_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained);
-static bool extent_decommit_default(extent_hooks_t *extent_hooks,
-    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
-#ifdef PAGES_CAN_PURGE_LAZY
-static bool extent_purge_lazy_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind);
-#endif
-static bool extent_purge_lazy_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained);
-#ifdef PAGES_CAN_PURGE_FORCED
-static bool extent_purge_forced_default(extent_hooks_t *extent_hooks,
-    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
-#endif
-static bool extent_purge_forced_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained);
-#ifdef JEMALLOC_MAPS_COALESCE
-static bool extent_split_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t size_a, size_t size_b, bool committed,
-    unsigned arena_ind);
-#endif
-static extent_t *extent_split_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
-    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b,
-    bool growing_retained);
-#ifdef JEMALLOC_MAPS_COALESCE
-static bool extent_merge_default(extent_hooks_t *extent_hooks, void *addr_a,
-    size_t size_a, void *addr_b, size_t size_b, bool committed,
-    unsigned arena_ind);
-#endif
-static bool extent_merge_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b,
-    bool growing_retained);
-
-const extent_hooks_t	extent_hooks_default = {
-	extent_alloc_default,
-	extent_dalloc_default,
-	extent_destroy_default,
-	extent_commit_default,
-	extent_decommit_default
-#ifdef PAGES_CAN_PURGE_LAZY
-	,
-	extent_purge_lazy_default
-#else
-	,
-	NULL
-#endif
-#ifdef PAGES_CAN_PURGE_FORCED
-	,
-	extent_purge_forced_default
-#else
-	,
-	NULL
-#endif
-#ifdef JEMALLOC_MAPS_COALESCE
-	,
-	extent_split_default,
-	extent_merge_default
-#endif
-};
-
-/* Used exclusively for gdump triggering. */
-static atomic_zu_t curpages;
-static atomic_zu_t highpages;
-
-/******************************************************************************/
-/*
- * Function prototypes for static functions that are referenced prior to
- * definition.
- */
-
-static void extent_deregister(tsdn_t *tsdn, extent_t *extent);
-static extent_t *extent_recycle(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, void *new_addr,
-    size_t usize, size_t pad, size_t alignment, bool slab, szind_t szind,
-    bool *zero, bool *commit, bool growing_retained);
-static extent_t *extent_try_coalesce(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
-    extent_t *extent, bool *coalesced, bool growing_retained);
-static void extent_record(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extents_t *extents, extent_t *extent,
-    bool growing_retained);
-
-/******************************************************************************/
-
-ph_gen(UNUSED, extent_avail_, extent_tree_t, extent_t, ph_link,
-    extent_esnead_comp)
-
-typedef enum {
-	lock_result_success,
-	lock_result_failure,
-	lock_result_no_extent
-} lock_result_t;
-
-static lock_result_t
-extent_rtree_leaf_elm_try_lock(tsdn_t *tsdn, rtree_leaf_elm_t *elm,
-    extent_t **result) {
-	extent_t *extent1 = rtree_leaf_elm_extent_read(tsdn, &extents_rtree,
-	    elm, true);
-
-	if (extent1 == NULL) {
-		return lock_result_no_extent;
-	}
-	/*
-	 * It's possible that the extent changed out from under us, and with it
-	 * the leaf->extent mapping.  We have to recheck while holding the lock.
-	 */
-	extent_lock(tsdn, extent1);
-	extent_t *extent2 = rtree_leaf_elm_extent_read(tsdn,
-	    &extents_rtree, elm, true);
-
-	if (extent1 == extent2) {
-		*result = extent1;
-		return lock_result_success;
-	} else {
-		extent_unlock(tsdn, extent1);
-		return lock_result_failure;
-	}
-}
-
-/*
- * Returns a pool-locked extent_t * if there's one associated with the given
- * address, and NULL otherwise.
- */
-static extent_t *
-extent_lock_from_addr(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx, void *addr) {
-	extent_t *ret = NULL;
-	rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, &extents_rtree,
-	    rtree_ctx, (uintptr_t)addr, false, false);
-	if (elm == NULL) {
-		return NULL;
-	}
-	lock_result_t lock_result;
-	do {
-		lock_result = extent_rtree_leaf_elm_try_lock(tsdn, elm, &ret);
-	} while (lock_result == lock_result_failure);
-	return ret;
-}
-
-extent_t *
-extent_alloc(tsdn_t *tsdn, arena_t *arena) {
-	malloc_mutex_lock(tsdn, &arena->extent_avail_mtx);
-	extent_t *extent = extent_avail_first(&arena->extent_avail);
-	if (extent == NULL) {
-		malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
-		return base_alloc_extent(tsdn, arena->base);
-	}
-	extent_avail_remove(&arena->extent_avail, extent);
-	malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
-	return extent;
-}
-
-void
-extent_dalloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
-	malloc_mutex_lock(tsdn, &arena->extent_avail_mtx);
-	extent_avail_insert(&arena->extent_avail, extent);
-	malloc_mutex_unlock(tsdn, &arena->extent_avail_mtx);
-}
-
-extent_hooks_t *
-extent_hooks_get(arena_t *arena) {
-	return base_extent_hooks_get(arena->base);
-}
-
-extent_hooks_t *
-extent_hooks_set(tsd_t *tsd, arena_t *arena, extent_hooks_t *extent_hooks) {
-	background_thread_info_t *info;
-	if (have_background_thread) {
-		info = arena_background_thread_info_get(arena);
-		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-	}
-	extent_hooks_t *ret = base_extent_hooks_set(arena->base, extent_hooks);
-	if (have_background_thread) {
-		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-	}
-
-	return ret;
-}
-
-static void
-extent_hooks_assure_initialized(arena_t *arena,
-    extent_hooks_t **r_extent_hooks) {
-	if (*r_extent_hooks == EXTENT_HOOKS_INITIALIZER) {
-		*r_extent_hooks = extent_hooks_get(arena);
-	}
-}
-
-#ifndef JEMALLOC_JET
-static
-#endif
-size_t
-extent_size_quantize_floor(size_t size) {
-	size_t ret;
-	pszind_t pind;
-
-	assert(size > 0);
-	assert((size & PAGE_MASK) == 0);
-
-	pind = sz_psz2ind(size - sz_large_pad + 1);
-	if (pind == 0) {
-		/*
-		 * Avoid underflow.  This short-circuit would also do the right
-		 * thing for all sizes in the range for which there are
-		 * PAGE-spaced size classes, but it's simplest to just handle
-		 * the one case that would cause erroneous results.
-		 */
-		return size;
-	}
-	ret = sz_pind2sz(pind - 1) + sz_large_pad;
-	assert(ret <= size);
-	return ret;
-}
-
-#ifndef JEMALLOC_JET
-static
-#endif
-size_t
-extent_size_quantize_ceil(size_t size) {
-	size_t ret;
-
-	assert(size > 0);
-	assert(size - sz_large_pad <= LARGE_MAXCLASS);
-	assert((size & PAGE_MASK) == 0);
-
-	ret = extent_size_quantize_floor(size);
-	if (ret < size) {
-		/*
-		 * Skip a quantization that may have an adequately large extent,
-		 * because under-sized extents may be mixed in.  This only
-		 * happens when an unusual size is requested, i.e. for aligned
-		 * allocation, and is just one of several places where linear
-		 * search would potentially find sufficiently aligned available
-		 * memory somewhere lower.
-		 */
-		ret = sz_pind2sz(sz_psz2ind(ret - sz_large_pad + 1)) +
-		    sz_large_pad;
-	}
-	return ret;
-}
-
-/* Generate pairing heap functions. */
-ph_gen(, extent_heap_, extent_heap_t, extent_t, ph_link, extent_snad_comp)
-
-bool
-extents_init(tsdn_t *tsdn, extents_t *extents, extent_state_t state,
-    bool delay_coalesce) {
-	if (malloc_mutex_init(&extents->mtx, "extents", WITNESS_RANK_EXTENTS,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-	for (unsigned i = 0; i < NPSIZES+1; i++) {
-		extent_heap_new(&extents->heaps[i]);
-	}
-	bitmap_init(extents->bitmap, &extents_bitmap_info, true);
-	extent_list_init(&extents->lru);
-	atomic_store_zu(&extents->npages, 0, ATOMIC_RELAXED);
-	extents->state = state;
-	extents->delay_coalesce = delay_coalesce;
-	return false;
-}
-
-extent_state_t
-extents_state_get(const extents_t *extents) {
-	return extents->state;
-}
-
-size_t
-extents_npages_get(extents_t *extents) {
-	return atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
-}
-
-static void
-extents_insert_locked(tsdn_t *tsdn, extents_t *extents, extent_t *extent) {
-	malloc_mutex_assert_owner(tsdn, &extents->mtx);
-	assert(extent_state_get(extent) == extents->state);
-
-	size_t size = extent_size_get(extent);
-	size_t psz = extent_size_quantize_floor(size);
-	pszind_t pind = sz_psz2ind(psz);
-	if (extent_heap_empty(&extents->heaps[pind])) {
-		bitmap_unset(extents->bitmap, &extents_bitmap_info,
-		    (size_t)pind);
-	}
-	extent_heap_insert(&extents->heaps[pind], extent);
-	extent_list_append(&extents->lru, extent);
-	size_t npages = size >> LG_PAGE;
-	/*
-	 * All modifications to npages hold the mutex (as asserted above), so we
-	 * don't need an atomic fetch-add; we can get by with a load followed by
-	 * a store.
-	 */
-	size_t cur_extents_npages =
-	    atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
-	atomic_store_zu(&extents->npages, cur_extents_npages + npages,
-	    ATOMIC_RELAXED);
-}
-
-static void
-extents_remove_locked(tsdn_t *tsdn, extents_t *extents, extent_t *extent) {
-	malloc_mutex_assert_owner(tsdn, &extents->mtx);
-	assert(extent_state_get(extent) == extents->state);
-
-	size_t size = extent_size_get(extent);
-	size_t psz = extent_size_quantize_floor(size);
-	pszind_t pind = sz_psz2ind(psz);
-	extent_heap_remove(&extents->heaps[pind], extent);
-	if (extent_heap_empty(&extents->heaps[pind])) {
-		bitmap_set(extents->bitmap, &extents_bitmap_info,
-		    (size_t)pind);
-	}
-	extent_list_remove(&extents->lru, extent);
-	size_t npages = size >> LG_PAGE;
-	/*
-	 * As in extents_insert_locked, we hold extents->mtx and so don't need
-	 * atomic operations for updating extents->npages.
-	 */
-	size_t cur_extents_npages =
-	    atomic_load_zu(&extents->npages, ATOMIC_RELAXED);
-	assert(cur_extents_npages >= npages);
-	atomic_store_zu(&extents->npages,
-	    cur_extents_npages - (size >> LG_PAGE), ATOMIC_RELAXED);
-}
-
-/*
- * Find an extent with size [min_size, max_size) to satisfy the alignment
- * requirement.  For each size, try only the first extent in the heap.
- */
-static extent_t *
-extents_fit_alignment(extents_t *extents, size_t min_size, size_t max_size,
-    size_t alignment) {
-        pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(min_size));
-        pszind_t pind_max = sz_psz2ind(extent_size_quantize_ceil(max_size));
-
-	for (pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap,
-	    &extents_bitmap_info, (size_t)pind); i < pind_max; i =
-	    (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
-	    (size_t)i+1)) {
-		assert(i < NPSIZES);
-		assert(!extent_heap_empty(&extents->heaps[i]));
-		extent_t *extent = extent_heap_first(&extents->heaps[i]);
-		uintptr_t base = (uintptr_t)extent_base_get(extent);
-		size_t candidate_size = extent_size_get(extent);
-		assert(candidate_size >= min_size);
-
-		uintptr_t next_align = ALIGNMENT_CEILING((uintptr_t)base,
-		    PAGE_CEILING(alignment));
-		if (base > next_align || base + candidate_size <= next_align) {
-			/* Overflow or not crossing the next alignment. */
-			continue;
-		}
-
-		size_t leadsize = next_align - base;
-		if (candidate_size - leadsize >= min_size) {
-			return extent;
-		}
-	}
-
-	return NULL;
-}
-
-/* Do any-best-fit extent selection, i.e. select any extent that best fits. */
-static extent_t *
-extents_best_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    size_t size) {
-	pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(size));
-	pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
-	    (size_t)pind);
-	if (i < NPSIZES+1) {
-		/*
-		 * In order to reduce fragmentation, avoid reusing and splitting
-		 * large extents for much smaller sizes.
-		 */
-		if ((sz_pind2sz(i) >> opt_lg_extent_max_active_fit) > size) {
-			return NULL;
-		}
-		assert(!extent_heap_empty(&extents->heaps[i]));
-		extent_t *extent = extent_heap_first(&extents->heaps[i]);
-		assert(extent_size_get(extent) >= size);
-		return extent;
-	}
-
-	return NULL;
-}
-
-/*
- * Do first-fit extent selection, i.e. select the oldest/lowest extent that is
- * large enough.
- */
-static extent_t *
-extents_first_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    size_t size) {
-	extent_t *ret = NULL;
-
-	pszind_t pind = sz_psz2ind(extent_size_quantize_ceil(size));
-	for (pszind_t i = (pszind_t)bitmap_ffu(extents->bitmap,
-	    &extents_bitmap_info, (size_t)pind); i < NPSIZES+1; i =
-	    (pszind_t)bitmap_ffu(extents->bitmap, &extents_bitmap_info,
-	    (size_t)i+1)) {
-		assert(!extent_heap_empty(&extents->heaps[i]));
-		extent_t *extent = extent_heap_first(&extents->heaps[i]);
-		assert(extent_size_get(extent) >= size);
-		if (ret == NULL || extent_snad_comp(extent, ret) < 0) {
-			ret = extent;
-		}
-		if (i == NPSIZES) {
-			break;
-		}
-		assert(i < NPSIZES);
-	}
-
-	return ret;
-}
-
-/*
- * Do {best,first}-fit extent selection, where the selection policy choice is
- * based on extents->delay_coalesce.  Best-fit selection requires less
- * searching, but its layout policy is less stable and may cause higher virtual
- * memory fragmentation as a side effect.
- */
-static extent_t *
-extents_fit_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    size_t esize, size_t alignment) {
-	malloc_mutex_assert_owner(tsdn, &extents->mtx);
-
-	size_t max_size = esize + PAGE_CEILING(alignment) - PAGE;
-	/* Beware size_t wrap-around. */
-	if (max_size < esize) {
-		return NULL;
-	}
-
-	extent_t *extent = extents->delay_coalesce ?
-	    extents_best_fit_locked(tsdn, arena, extents, max_size) :
-	    extents_first_fit_locked(tsdn, arena, extents, max_size);
-
-	if (alignment > PAGE && extent == NULL) {
-		/*
-		 * max_size guarantees the alignment requirement but is rather
-		 * pessimistic.  Next we try to satisfy the aligned allocation
-		 * with sizes in [esize, max_size).
-		 */
-		extent = extents_fit_alignment(extents, esize, max_size,
-		    alignment);
-	}
-
-	return extent;
-}
-
-static bool
-extent_try_delayed_coalesce(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
-    extent_t *extent) {
-	extent_state_set(extent, extent_state_active);
-	bool coalesced;
-	extent = extent_try_coalesce(tsdn, arena, r_extent_hooks, rtree_ctx,
-	    extents, extent, &coalesced, false);
-	extent_state_set(extent, extents_state_get(extents));
-
-	if (!coalesced) {
-		return true;
-	}
-	extents_insert_locked(tsdn, extents, extent);
-	return false;
-}
-
-extent_t *
-extents_alloc(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
-	assert(size + pad != 0);
-	assert(alignment != 0);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_t *extent = extent_recycle(tsdn, arena, r_extent_hooks, extents,
-	    new_addr, size, pad, alignment, slab, szind, zero, commit, false);
-	assert(extent == NULL || extent_dumpable_get(extent));
-	return extent;
-}
-
-void
-extents_dalloc(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, extent_t *extent) {
-	assert(extent_base_get(extent) != NULL);
-	assert(extent_size_get(extent) != 0);
-	assert(extent_dumpable_get(extent));
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_addr_set(extent, extent_base_get(extent));
-	extent_zeroed_set(extent, false);
-
-	extent_record(tsdn, arena, r_extent_hooks, extents, extent, false);
-}
-
-extent_t *
-extents_evict(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, size_t npages_min) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	malloc_mutex_lock(tsdn, &extents->mtx);
-
-	/*
-	 * Get the LRU coalesced extent, if any.  If coalescing was delayed,
-	 * the loop will iterate until the LRU extent is fully coalesced.
-	 */
-	extent_t *extent;
-	while (true) {
-		/* Get the LRU extent, if any. */
-		extent = extent_list_first(&extents->lru);
-		if (extent == NULL) {
-			goto label_return;
-		}
-		/* Check the eviction limit. */
-		size_t extents_npages = atomic_load_zu(&extents->npages,
-		    ATOMIC_RELAXED);
-		if (extents_npages <= npages_min) {
-			extent = NULL;
-			goto label_return;
-		}
-		extents_remove_locked(tsdn, extents, extent);
-		if (!extents->delay_coalesce) {
-			break;
-		}
-		/* Try to coalesce. */
-		if (extent_try_delayed_coalesce(tsdn, arena, r_extent_hooks,
-		    rtree_ctx, extents, extent)) {
-			break;
-		}
-		/*
-		 * The LRU extent was just coalesced and the result placed in
-		 * the LRU at its neighbor's position.  Start over.
-		 */
-	}
-
-	/*
-	 * Either mark the extent active or deregister it to protect against
-	 * concurrent operations.
-	 */
-	switch (extents_state_get(extents)) {
-	case extent_state_active:
-		not_reached();
-	case extent_state_dirty:
-	case extent_state_muzzy:
-		extent_state_set(extent, extent_state_active);
-		break;
-	case extent_state_retained:
-		extent_deregister(tsdn, extent);
-		break;
-	default:
-		not_reached();
-	}
-
-label_return:
-	malloc_mutex_unlock(tsdn, &extents->mtx);
-	return extent;
-}
-
-static void
-extents_leak(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, extent_t *extent, bool growing_retained) {
-	/*
-	 * Leak extent after making sure its pages have already been purged, so
-	 * that this is only a virtual memory leak.
-	 */
-	if (extents_state_get(extents) == extent_state_dirty) {
-		if (extent_purge_lazy_impl(tsdn, arena, r_extent_hooks,
-		    extent, 0, extent_size_get(extent), growing_retained)) {
-			extent_purge_forced_impl(tsdn, arena, r_extent_hooks,
-			    extent, 0, extent_size_get(extent),
-			    growing_retained);
-		}
-	}
-	extent_dalloc(tsdn, arena, extent);
-}
-
-void
-extents_prefork(tsdn_t *tsdn, extents_t *extents) {
-	malloc_mutex_prefork(tsdn, &extents->mtx);
-}
-
-void
-extents_postfork_parent(tsdn_t *tsdn, extents_t *extents) {
-	malloc_mutex_postfork_parent(tsdn, &extents->mtx);
-}
-
-void
-extents_postfork_child(tsdn_t *tsdn, extents_t *extents) {
-	malloc_mutex_postfork_child(tsdn, &extents->mtx);
-}
-
-static void
-extent_deactivate_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    extent_t *extent) {
-	assert(extent_arena_get(extent) == arena);
-	assert(extent_state_get(extent) == extent_state_active);
-
-	extent_state_set(extent, extents_state_get(extents));
-	extents_insert_locked(tsdn, extents, extent);
-}
-
-static void
-extent_deactivate(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    extent_t *extent) {
-	malloc_mutex_lock(tsdn, &extents->mtx);
-	extent_deactivate_locked(tsdn, arena, extents, extent);
-	malloc_mutex_unlock(tsdn, &extents->mtx);
-}
-
-static void
-extent_activate_locked(tsdn_t *tsdn, arena_t *arena, extents_t *extents,
-    extent_t *extent) {
-	assert(extent_arena_get(extent) == arena);
-	assert(extent_state_get(extent) == extents_state_get(extents));
-
-	extents_remove_locked(tsdn, extents, extent);
-	extent_state_set(extent, extent_state_active);
-}
-
-static bool
-extent_rtree_leaf_elms_lookup(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx,
-    const extent_t *extent, bool dependent, bool init_missing,
-    rtree_leaf_elm_t **r_elm_a, rtree_leaf_elm_t **r_elm_b) {
-	*r_elm_a = rtree_leaf_elm_lookup(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)extent_base_get(extent), dependent, init_missing);
-	if (!dependent && *r_elm_a == NULL) {
-		return true;
-	}
-	assert(*r_elm_a != NULL);
-
-	*r_elm_b = rtree_leaf_elm_lookup(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)extent_last_get(extent), dependent, init_missing);
-	if (!dependent && *r_elm_b == NULL) {
-		return true;
-	}
-	assert(*r_elm_b != NULL);
-
-	return false;
-}
-
-static void
-extent_rtree_write_acquired(tsdn_t *tsdn, rtree_leaf_elm_t *elm_a,
-    rtree_leaf_elm_t *elm_b, extent_t *extent, szind_t szind, bool slab) {
-	rtree_leaf_elm_write(tsdn, &extents_rtree, elm_a, extent, szind, slab);
-	if (elm_b != NULL) {
-		rtree_leaf_elm_write(tsdn, &extents_rtree, elm_b, extent, szind,
-		    slab);
-	}
-}
-
-static void
-extent_interior_register(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx, extent_t *extent,
-    szind_t szind) {
-	assert(extent_slab_get(extent));
-
-	/* Register interior. */
-	for (size_t i = 1; i < (extent_size_get(extent) >> LG_PAGE) - 1; i++) {
-		rtree_write(tsdn, &extents_rtree, rtree_ctx,
-		    (uintptr_t)extent_base_get(extent) + (uintptr_t)(i <<
-		    LG_PAGE), extent, szind, true);
-	}
-}
-
-static void
-extent_gdump_add(tsdn_t *tsdn, const extent_t *extent) {
-	cassert(config_prof);
-	/* prof_gdump() requirement. */
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	if (opt_prof && extent_state_get(extent) == extent_state_active) {
-		size_t nadd = extent_size_get(extent) >> LG_PAGE;
-		size_t cur = atomic_fetch_add_zu(&curpages, nadd,
-		    ATOMIC_RELAXED) + nadd;
-		size_t high = atomic_load_zu(&highpages, ATOMIC_RELAXED);
-		while (cur > high && !atomic_compare_exchange_weak_zu(
-		    &highpages, &high, cur, ATOMIC_RELAXED, ATOMIC_RELAXED)) {
-			/*
-			 * Don't refresh cur, because it may have decreased
-			 * since this thread lost the highpages update race.
-			 * Note that high is updated in case of CAS failure.
-			 */
-		}
-		if (cur > high && prof_gdump_get_unlocked()) {
-			prof_gdump(tsdn);
-		}
-	}
-}
-
-static void
-extent_gdump_sub(tsdn_t *tsdn, const extent_t *extent) {
-	cassert(config_prof);
-
-	if (opt_prof && extent_state_get(extent) == extent_state_active) {
-		size_t nsub = extent_size_get(extent) >> LG_PAGE;
-		assert(atomic_load_zu(&curpages, ATOMIC_RELAXED) >= nsub);
-		atomic_fetch_sub_zu(&curpages, nsub, ATOMIC_RELAXED);
-	}
-}
-
-static bool
-extent_register_impl(tsdn_t *tsdn, extent_t *extent, bool gdump_add) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	rtree_leaf_elm_t *elm_a, *elm_b;
-
-	/*
-	 * We need to hold the lock to protect against a concurrent coalesce
-	 * operation that sees us in a partial state.
-	 */
-	extent_lock(tsdn, extent);
-
-	if (extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, extent, false, true,
-	    &elm_a, &elm_b)) {
-		return true;
-	}
-
-	szind_t szind = extent_szind_get_maybe_invalid(extent);
-	bool slab = extent_slab_get(extent);
-	extent_rtree_write_acquired(tsdn, elm_a, elm_b, extent, szind, slab);
-	if (slab) {
-		extent_interior_register(tsdn, rtree_ctx, extent, szind);
-	}
-
-	extent_unlock(tsdn, extent);
-
-	if (config_prof && gdump_add) {
-		extent_gdump_add(tsdn, extent);
-	}
-
-	return false;
-}
-
-static bool
-extent_register(tsdn_t *tsdn, extent_t *extent) {
-	return extent_register_impl(tsdn, extent, true);
-}
-
-static bool
-extent_register_no_gdump_add(tsdn_t *tsdn, extent_t *extent) {
-	return extent_register_impl(tsdn, extent, false);
-}
-
-static void
-extent_reregister(tsdn_t *tsdn, extent_t *extent) {
-	bool err = extent_register(tsdn, extent);
-	assert(!err);
-}
-
-/*
- * Removes all pointers to the given extent from the global rtree indices for
- * its interior.  This is relevant for slab extents, for which we need to do
- * metadata lookups at places other than the head of the extent.  We deregister
- * on the interior, then, when an extent moves from being an active slab to an
- * inactive state.
- */
-static void
-extent_interior_deregister(tsdn_t *tsdn, rtree_ctx_t *rtree_ctx,
-    extent_t *extent) {
-	size_t i;
-
-	assert(extent_slab_get(extent));
-
-	for (i = 1; i < (extent_size_get(extent) >> LG_PAGE) - 1; i++) {
-		rtree_clear(tsdn, &extents_rtree, rtree_ctx,
-		    (uintptr_t)extent_base_get(extent) + (uintptr_t)(i <<
-		    LG_PAGE));
-	}
-}
-
-/*
- * Removes all pointers to the given extent from the global rtree.
- */
-static void
-extent_deregister_impl(tsdn_t *tsdn, extent_t *extent, bool gdump) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	rtree_leaf_elm_t *elm_a, *elm_b;
-	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, extent, true, false,
-	    &elm_a, &elm_b);
-
-	extent_lock(tsdn, extent);
-
-	extent_rtree_write_acquired(tsdn, elm_a, elm_b, NULL, NSIZES, false);
-	if (extent_slab_get(extent)) {
-		extent_interior_deregister(tsdn, rtree_ctx, extent);
-		extent_slab_set(extent, false);
-	}
-
-	extent_unlock(tsdn, extent);
-
-	if (config_prof && gdump) {
-		extent_gdump_sub(tsdn, extent);
-	}
-}
-
-static void
-extent_deregister(tsdn_t *tsdn, extent_t *extent) {
-	extent_deregister_impl(tsdn, extent, true);
-}
-
-static void
-extent_deregister_no_gdump_sub(tsdn_t *tsdn, extent_t *extent) {
-	extent_deregister_impl(tsdn, extent, false);
-}
-
-/*
- * Tries to find and remove an extent from extents that can be used for the
- * given allocation request.
- */
-static extent_t *
-extent_recycle_extract(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
-    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
-    bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-	assert(alignment > 0);
-	if (config_debug && new_addr != NULL) {
-		/*
-		 * Non-NULL new_addr has two use cases:
-		 *
-		 *   1) Recycle a known-extant extent, e.g. during purging.
-		 *   2) Perform in-place expanding reallocation.
-		 *
-		 * Regardless of use case, new_addr must either refer to a
-		 * non-existing extent, or to the base of an extant extent,
-		 * since only active slabs support interior lookups (which of
-		 * course cannot be recycled).
-		 */
-		assert(PAGE_ADDR2BASE(new_addr) == new_addr);
-		assert(pad == 0);
-		assert(alignment <= PAGE);
-	}
-
-	size_t esize = size + pad;
-	malloc_mutex_lock(tsdn, &extents->mtx);
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-	extent_t *extent;
-	if (new_addr != NULL) {
-		extent = extent_lock_from_addr(tsdn, rtree_ctx, new_addr);
-		if (extent != NULL) {
-			/*
-			 * We might null-out extent to report an error, but we
-			 * still need to unlock the associated mutex after.
-			 */
-			extent_t *unlock_extent = extent;
-			assert(extent_base_get(extent) == new_addr);
-			if (extent_arena_get(extent) != arena ||
-			    extent_size_get(extent) < esize ||
-			    extent_state_get(extent) !=
-			    extents_state_get(extents)) {
-				extent = NULL;
-			}
-			extent_unlock(tsdn, unlock_extent);
-		}
-	} else {
-		extent = extents_fit_locked(tsdn, arena, extents, esize,
-		    alignment);
-	}
-	if (extent == NULL) {
-		malloc_mutex_unlock(tsdn, &extents->mtx);
-		return NULL;
-	}
-
-	extent_activate_locked(tsdn, arena, extents, extent);
-	malloc_mutex_unlock(tsdn, &extents->mtx);
-
-	return extent;
-}
-
-/*
- * Given an allocation request and an extent guaranteed to be able to satisfy
- * it, this splits off lead and trail extents, leaving extent pointing to an
- * extent satisfying the allocation.
- * This function doesn't put lead or trail into any extents_t; it's the caller's
- * job to ensure that they can be reused.
- */
-typedef enum {
-	/*
-	 * Split successfully.  lead, extent, and trail, are modified to extents
-	 * describing the ranges before, in, and after the given allocation.
-	 */
-	extent_split_interior_ok,
-	/*
-	 * The extent can't satisfy the given allocation request.  None of the
-	 * input extent_t *s are touched.
-	 */
-	extent_split_interior_cant_alloc,
-	/*
-	 * In a potentially invalid state.  Must leak (if *to_leak is non-NULL),
-	 * and salvage what's still salvageable (if *to_salvage is non-NULL).
-	 * None of lead, extent, or trail are valid.
-	 */
-	extent_split_interior_error
-} extent_split_interior_result_t;
-
-static extent_split_interior_result_t
-extent_split_interior(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx,
-    /* The result of splitting, in case of success. */
-    extent_t **extent, extent_t **lead, extent_t **trail,
-    /* The mess to clean up, in case of error. */
-    extent_t **to_leak, extent_t **to_salvage,
-    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
-    szind_t szind, bool growing_retained) {
-	size_t esize = size + pad;
-	size_t leadsize = ALIGNMENT_CEILING((uintptr_t)extent_base_get(*extent),
-	    PAGE_CEILING(alignment)) - (uintptr_t)extent_base_get(*extent);
-	assert(new_addr == NULL || leadsize == 0);
-	if (extent_size_get(*extent) < leadsize + esize) {
-		return extent_split_interior_cant_alloc;
-	}
-	size_t trailsize = extent_size_get(*extent) - leadsize - esize;
-
-	*lead = NULL;
-	*trail = NULL;
-	*to_leak = NULL;
-	*to_salvage = NULL;
-
-	/* Split the lead. */
-	if (leadsize != 0) {
-		*lead = *extent;
-		*extent = extent_split_impl(tsdn, arena, r_extent_hooks,
-		    *lead, leadsize, NSIZES, false, esize + trailsize, szind,
-		    slab, growing_retained);
-		if (*extent == NULL) {
-			*to_leak = *lead;
-			*lead = NULL;
-			return extent_split_interior_error;
-		}
-	}
-
-	/* Split the trail. */
-	if (trailsize != 0) {
-		*trail = extent_split_impl(tsdn, arena, r_extent_hooks, *extent,
-		    esize, szind, slab, trailsize, NSIZES, false,
-		    growing_retained);
-		if (*trail == NULL) {
-			*to_leak = *extent;
-			*to_salvage = *lead;
-			*lead = NULL;
-			*extent = NULL;
-			return extent_split_interior_error;
-		}
-	}
-
-	if (leadsize == 0 && trailsize == 0) {
-		/*
-		 * Splitting causes szind to be set as a side effect, but no
-		 * splitting occurred.
-		 */
-		extent_szind_set(*extent, szind);
-		if (szind != NSIZES) {
-			rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx,
-			    (uintptr_t)extent_addr_get(*extent), szind, slab);
-			if (slab && extent_size_get(*extent) > PAGE) {
-				rtree_szind_slab_update(tsdn, &extents_rtree,
-				    rtree_ctx,
-				    (uintptr_t)extent_past_get(*extent) -
-				    (uintptr_t)PAGE, szind, slab);
-			}
-		}
-	}
-
-	return extent_split_interior_ok;
-}
-
-/*
- * This fulfills the indicated allocation request out of the given extent (which
- * the caller should have ensured was big enough).  If there's any unused space
- * before or after the resulting allocation, that space is given its own extent
- * and put back into extents.
- */
-static extent_t *
-extent_recycle_split(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
-    void *new_addr, size_t size, size_t pad, size_t alignment, bool slab,
-    szind_t szind, extent_t *extent, bool growing_retained) {
-	extent_t *lead;
-	extent_t *trail;
-	extent_t *to_leak;
-	extent_t *to_salvage;
-
-	extent_split_interior_result_t result = extent_split_interior(
-	    tsdn, arena, r_extent_hooks, rtree_ctx, &extent, &lead, &trail,
-	    &to_leak, &to_salvage, new_addr, size, pad, alignment, slab, szind,
-	    growing_retained);
-
-	if (result == extent_split_interior_ok) {
-		if (lead != NULL) {
-			extent_deactivate(tsdn, arena, extents, lead);
-		}
-		if (trail != NULL) {
-			extent_deactivate(tsdn, arena, extents, trail);
-		}
-		return extent;
-	} else {
-		/*
-		 * We should have picked an extent that was large enough to
-		 * fulfill our allocation request.
-		 */
-		assert(result == extent_split_interior_error);
-		if (to_salvage != NULL) {
-			extent_deregister(tsdn, to_salvage);
-		}
-		if (to_leak != NULL) {
-			void *leak = extent_base_get(to_leak);
-			extent_deregister_no_gdump_sub(tsdn, to_leak);
-			extents_leak(tsdn, arena, r_extent_hooks, extents,
-			    to_leak, growing_retained);
-			assert(extent_lock_from_addr(tsdn, rtree_ctx, leak)
-			    == NULL);
-		}
-		return NULL;
-	}
-	unreachable();
-}
-
-/*
- * Tries to satisfy the given allocation request by reusing one of the extents
- * in the given extents_t.
- */
-static extent_t *
-extent_recycle(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit,
-    bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-	assert(new_addr == NULL || !slab);
-	assert(pad == 0 || !slab);
-	assert(!*zero || !slab);
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	extent_t *extent = extent_recycle_extract(tsdn, arena, r_extent_hooks,
-	    rtree_ctx, extents, new_addr, size, pad, alignment, slab,
-	    growing_retained);
-	if (extent == NULL) {
-		return NULL;
-	}
-
-	extent = extent_recycle_split(tsdn, arena, r_extent_hooks, rtree_ctx,
-	    extents, new_addr, size, pad, alignment, slab, szind, extent,
-	    growing_retained);
-	if (extent == NULL) {
-		return NULL;
-	}
-
-	if (*commit && !extent_committed_get(extent)) {
-		if (extent_commit_impl(tsdn, arena, r_extent_hooks, extent,
-		    0, extent_size_get(extent), growing_retained)) {
-			extent_record(tsdn, arena, r_extent_hooks, extents,
-			    extent, growing_retained);
-			return NULL;
-		}
-		extent_zeroed_set(extent, true);
-	}
-
-	if (extent_committed_get(extent)) {
-		*commit = true;
-	}
-	if (extent_zeroed_get(extent)) {
-		*zero = true;
-	}
-
-	if (pad != 0) {
-		extent_addr_randomize(tsdn, extent, alignment);
-	}
-	assert(extent_state_get(extent) == extent_state_active);
-	if (slab) {
-		extent_slab_set(extent, slab);
-		extent_interior_register(tsdn, rtree_ctx, extent, szind);
-	}
-
-	if (*zero) {
-		void *addr = extent_base_get(extent);
-		size_t size = extent_size_get(extent);
-		if (!extent_zeroed_get(extent)) {
-			if (pages_purge_forced(addr, size)) {
-				memset(addr, 0, size);
-			}
-		} else if (config_debug) {
-			size_t *p = (size_t *)(uintptr_t)addr;
-			for (size_t i = 0; i < size / sizeof(size_t); i++) {
-				assert(p[i] == 0);
-			}
-		}
-	}
-	return extent;
-}
-
-/*
- * If the caller specifies (!*zero), it is still possible to receive zeroed
- * memory, in which case *zero is toggled to true.  arena_extent_alloc() takes
- * advantage of this to avoid demanding zeroed extents, but taking advantage of
- * them if they are returned.
- */
-static void *
-extent_alloc_core(tsdn_t *tsdn, arena_t *arena, void *new_addr, size_t size,
-    size_t alignment, bool *zero, bool *commit, dss_prec_t dss_prec) {
-	void *ret;
-
-	assert(size != 0);
-	assert(alignment != 0);
-
-	/* "primary" dss. */
-	if (have_dss && dss_prec == dss_prec_primary && (ret =
-	    extent_alloc_dss(tsdn, arena, new_addr, size, alignment, zero,
-	    commit)) != NULL) {
-		return ret;
-	}
-	/* mmap. */
-	if ((ret = extent_alloc_mmap(new_addr, size, alignment, zero, commit))
-	    != NULL) {
-		return ret;
-	}
-	/* "secondary" dss. */
-	if (have_dss && dss_prec == dss_prec_secondary && (ret =
-	    extent_alloc_dss(tsdn, arena, new_addr, size, alignment, zero,
-	    commit)) != NULL) {
-		return ret;
-	}
-
-	/* All strategies for allocation failed. */
-	return NULL;
-}
-
-static void *
-extent_alloc_default_impl(tsdn_t *tsdn, arena_t *arena, void *new_addr,
-    size_t size, size_t alignment, bool *zero, bool *commit) {
-	void *ret = extent_alloc_core(tsdn, arena, new_addr, size, alignment, zero,
-	    commit, (dss_prec_t)atomic_load_u(&arena->dss_prec,
-	    ATOMIC_RELAXED));
-	if (have_madvise_huge && ret) {
-		pages_set_thp_state(ret, size);
-	}
-	return ret;
-}
-
-static void *
-extent_alloc_default(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
-    size_t alignment, bool *zero, bool *commit, unsigned arena_ind) {
-	tsdn_t *tsdn;
-	arena_t *arena;
-
-	tsdn = tsdn_fetch();
-	arena = arena_get(tsdn, arena_ind, false);
-	/*
-	 * The arena we're allocating on behalf of must have been initialized
-	 * already.
-	 */
-	assert(arena != NULL);
-
-	return extent_alloc_default_impl(tsdn, arena, new_addr, size,
-	    alignment, zero, commit);
-}
-
-static void
-extent_hook_pre_reentrancy(tsdn_t *tsdn, arena_t *arena) {
-	tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
-	if (arena == arena_get(tsd_tsdn(tsd), 0, false)) {
-		/*
-		 * The only legitimate case of customized extent hooks for a0 is
-		 * hooks with no allocation activities.  One such example is to
-		 * place metadata on pre-allocated resources such as huge pages.
-		 * In that case, rely on reentrancy_level checks to catch
-		 * infinite recursions.
-		 */
-		pre_reentrancy(tsd, NULL);
-	} else {
-		pre_reentrancy(tsd, arena);
-	}
-}
-
-static void
-extent_hook_post_reentrancy(tsdn_t *tsdn) {
-	tsd_t *tsd = tsdn_null(tsdn) ? tsd_fetch() : tsdn_tsd(tsdn);
-	post_reentrancy(tsd);
-}
-
-/*
- * If virtual memory is retained, create increasingly larger extents from which
- * to split requested extents in order to limit the total number of disjoint
- * virtual memory ranges retained by each arena.
- */
-static extent_t *
-extent_grow_retained(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, size_t size, size_t pad, size_t alignment,
-    bool slab, szind_t szind, bool *zero, bool *commit) {
-	malloc_mutex_assert_owner(tsdn, &arena->extent_grow_mtx);
-	assert(pad == 0 || !slab);
-	assert(!*zero || !slab);
-
-	size_t esize = size + pad;
-	size_t alloc_size_min = esize + PAGE_CEILING(alignment) - PAGE;
-	/* Beware size_t wrap-around. */
-	if (alloc_size_min < esize) {
-		goto label_err;
-	}
-	/*
-	 * Find the next extent size in the series that would be large enough to
-	 * satisfy this request.
-	 */
-	pszind_t egn_skip = 0;
-	size_t alloc_size = sz_pind2sz(arena->extent_grow_next + egn_skip);
-	while (alloc_size < alloc_size_min) {
-		egn_skip++;
-		if (arena->extent_grow_next + egn_skip == NPSIZES) {
-			/* Outside legal range. */
-			goto label_err;
-		}
-		assert(arena->extent_grow_next + egn_skip < NPSIZES);
-		alloc_size = sz_pind2sz(arena->extent_grow_next + egn_skip);
-	}
-
-	extent_t *extent = extent_alloc(tsdn, arena);
-	if (extent == NULL) {
-		goto label_err;
-	}
-	bool zeroed = false;
-	bool committed = false;
-
-	void *ptr;
-	if (*r_extent_hooks == &extent_hooks_default) {
-		ptr = extent_alloc_default_impl(tsdn, arena, NULL,
-		    alloc_size, PAGE, &zeroed, &committed);
-	} else {
-		extent_hook_pre_reentrancy(tsdn, arena);
-		ptr = (*r_extent_hooks)->alloc(*r_extent_hooks, NULL,
-		    alloc_size, PAGE, &zeroed, &committed,
-		    arena_ind_get(arena));
-		extent_hook_post_reentrancy(tsdn);
-	}
-
-	extent_init(extent, arena, ptr, alloc_size, false, NSIZES,
-	    arena_extent_sn_next(arena), extent_state_active, zeroed,
-	    committed, true);
-	if (ptr == NULL) {
-		extent_dalloc(tsdn, arena, extent);
-		goto label_err;
-	}
-
-	if (extent_register_no_gdump_add(tsdn, extent)) {
-		extents_leak(tsdn, arena, r_extent_hooks,
-		    &arena->extents_retained, extent, true);
-		goto label_err;
-	}
-
-	if (extent_zeroed_get(extent) && extent_committed_get(extent)) {
-		*zero = true;
-	}
-	if (extent_committed_get(extent)) {
-		*commit = true;
-	}
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	extent_t *lead;
-	extent_t *trail;
-	extent_t *to_leak;
-	extent_t *to_salvage;
-	extent_split_interior_result_t result = extent_split_interior(
-	    tsdn, arena, r_extent_hooks, rtree_ctx, &extent, &lead, &trail,
-	    &to_leak, &to_salvage, NULL, size, pad, alignment, slab, szind,
-	    true);
-
-	if (result == extent_split_interior_ok) {
-		if (lead != NULL) {
-			extent_record(tsdn, arena, r_extent_hooks,
-			    &arena->extents_retained, lead, true);
-		}
-		if (trail != NULL) {
-			extent_record(tsdn, arena, r_extent_hooks,
-			    &arena->extents_retained, trail, true);
-		}
-	} else {
-		/*
-		 * We should have allocated a sufficiently large extent; the
-		 * cant_alloc case should not occur.
-		 */
-		assert(result == extent_split_interior_error);
-		if (to_salvage != NULL) {
-			if (config_prof) {
-				extent_gdump_add(tsdn, to_salvage);
-			}
-			extent_record(tsdn, arena, r_extent_hooks,
-			    &arena->extents_retained, to_salvage, true);
-		}
-		if (to_leak != NULL) {
-			extent_deregister_no_gdump_sub(tsdn, to_leak);
-			extents_leak(tsdn, arena, r_extent_hooks,
-			    &arena->extents_retained, to_leak, true);
-		}
-		goto label_err;
-	}
-
-	if (*commit && !extent_committed_get(extent)) {
-		if (extent_commit_impl(tsdn, arena, r_extent_hooks, extent, 0,
-		    extent_size_get(extent), true)) {
-			extent_record(tsdn, arena, r_extent_hooks,
-			    &arena->extents_retained, extent, true);
-			goto label_err;
-		}
-		extent_zeroed_set(extent, true);
-	}
-
-	/*
-	 * Increment extent_grow_next if doing so wouldn't exceed the allowed
-	 * range.
-	 */
-	if (arena->extent_grow_next + egn_skip + 1 <=
-	    arena->retain_grow_limit) {
-		arena->extent_grow_next += egn_skip + 1;
-	} else {
-		arena->extent_grow_next = arena->retain_grow_limit;
-	}
-	/* All opportunities for failure are past. */
-	malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
-
-	if (config_prof) {
-		/* Adjust gdump stats now that extent is final size. */
-		extent_gdump_add(tsdn, extent);
-	}
-	if (pad != 0) {
-		extent_addr_randomize(tsdn, extent, alignment);
-	}
-	if (slab) {
-		rtree_ctx_t rtree_ctx_fallback;
-		rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn,
-		    &rtree_ctx_fallback);
-
-		extent_slab_set(extent, true);
-		extent_interior_register(tsdn, rtree_ctx, extent, szind);
-	}
-	if (*zero && !extent_zeroed_get(extent)) {
-		void *addr = extent_base_get(extent);
-		size_t size = extent_size_get(extent);
-		if (pages_purge_forced(addr, size)) {
-			memset(addr, 0, size);
-		}
-	}
-
-	return extent;
-label_err:
-	malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
-	return NULL;
-}
-
-static extent_t *
-extent_alloc_retained(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
-	assert(size != 0);
-	assert(alignment != 0);
-
-	malloc_mutex_lock(tsdn, &arena->extent_grow_mtx);
-
-	extent_t *extent = extent_recycle(tsdn, arena, r_extent_hooks,
-	    &arena->extents_retained, new_addr, size, pad, alignment, slab,
-	    szind, zero, commit, true);
-	if (extent != NULL) {
-		malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
-		if (config_prof) {
-			extent_gdump_add(tsdn, extent);
-		}
-	} else if (opt_retain && new_addr == NULL) {
-		extent = extent_grow_retained(tsdn, arena, r_extent_hooks, size,
-		    pad, alignment, slab, szind, zero, commit);
-		/* extent_grow_retained() always releases extent_grow_mtx. */
-	} else {
-		malloc_mutex_unlock(tsdn, &arena->extent_grow_mtx);
-	}
-	malloc_mutex_assert_not_owner(tsdn, &arena->extent_grow_mtx);
-
-	return extent;
-}
-
-static extent_t *
-extent_alloc_wrapper_hard(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
-	size_t esize = size + pad;
-	extent_t *extent = extent_alloc(tsdn, arena);
-	if (extent == NULL) {
-		return NULL;
-	}
-	void *addr;
-	if (*r_extent_hooks == &extent_hooks_default) {
-		/* Call directly to propagate tsdn. */
-		addr = extent_alloc_default_impl(tsdn, arena, new_addr, esize,
-		    alignment, zero, commit);
-	} else {
-		extent_hook_pre_reentrancy(tsdn, arena);
-		addr = (*r_extent_hooks)->alloc(*r_extent_hooks, new_addr,
-		    esize, alignment, zero, commit, arena_ind_get(arena));
-		extent_hook_post_reentrancy(tsdn);
-	}
-	if (addr == NULL) {
-		extent_dalloc(tsdn, arena, extent);
-		return NULL;
-	}
-	extent_init(extent, arena, addr, esize, slab, szind,
-	    arena_extent_sn_next(arena), extent_state_active, *zero, *commit,
-	    true);
-	if (pad != 0) {
-		extent_addr_randomize(tsdn, extent, alignment);
-	}
-	if (extent_register(tsdn, extent)) {
-		extents_leak(tsdn, arena, r_extent_hooks,
-		    &arena->extents_retained, extent, false);
-		return NULL;
-	}
-
-	return extent;
-}
-
-extent_t *
-extent_alloc_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, void *new_addr, size_t size, size_t pad,
-    size_t alignment, bool slab, szind_t szind, bool *zero, bool *commit) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	extent_t *extent = extent_alloc_retained(tsdn, arena, r_extent_hooks,
-	    new_addr, size, pad, alignment, slab, szind, zero, commit);
-	if (extent == NULL) {
-		if (opt_retain && new_addr != NULL) {
-			/*
-			 * When retain is enabled and new_addr is set, we do not
-			 * attempt extent_alloc_wrapper_hard which does mmap
-			 * that is very unlikely to succeed (unless it happens
-			 * to be at the end).
-			 */
-			return NULL;
-		}
-		extent = extent_alloc_wrapper_hard(tsdn, arena, r_extent_hooks,
-		    new_addr, size, pad, alignment, slab, szind, zero, commit);
-	}
-
-	assert(extent == NULL || extent_dumpable_get(extent));
-	return extent;
-}
-
-static bool
-extent_can_coalesce(arena_t *arena, extents_t *extents, const extent_t *inner,
-    const extent_t *outer) {
-	assert(extent_arena_get(inner) == arena);
-	if (extent_arena_get(outer) != arena) {
-		return false;
-	}
-
-	assert(extent_state_get(inner) == extent_state_active);
-	if (extent_state_get(outer) != extents->state) {
-		return false;
-	}
-
-	if (extent_committed_get(inner) != extent_committed_get(outer)) {
-		return false;
-	}
-
-	return true;
-}
-
-static bool
-extent_coalesce(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, extent_t *inner, extent_t *outer, bool forward,
-    bool growing_retained) {
-	assert(extent_can_coalesce(arena, extents, inner, outer));
-
-	extent_activate_locked(tsdn, arena, extents, outer);
-
-	malloc_mutex_unlock(tsdn, &extents->mtx);
-	bool err = extent_merge_impl(tsdn, arena, r_extent_hooks,
-	    forward ? inner : outer, forward ? outer : inner, growing_retained);
-	malloc_mutex_lock(tsdn, &extents->mtx);
-
-	if (err) {
-		extent_deactivate_locked(tsdn, arena, extents, outer);
-	}
-
-	return err;
-}
-
-static extent_t *
-extent_try_coalesce(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, rtree_ctx_t *rtree_ctx, extents_t *extents,
-    extent_t *extent, bool *coalesced, bool growing_retained) {
-	/*
-	 * Continue attempting to coalesce until failure, to protect against
-	 * races with other threads that are thwarted by this one.
-	 */
-	bool again;
-	do {
-		again = false;
-
-		/* Try to coalesce forward. */
-		extent_t *next = extent_lock_from_addr(tsdn, rtree_ctx,
-		    extent_past_get(extent));
-		if (next != NULL) {
-			/*
-			 * extents->mtx only protects against races for
-			 * like-state extents, so call extent_can_coalesce()
-			 * before releasing next's pool lock.
-			 */
-			bool can_coalesce = extent_can_coalesce(arena, extents,
-			    extent, next);
-
-			extent_unlock(tsdn, next);
-
-			if (can_coalesce && !extent_coalesce(tsdn, arena,
-			    r_extent_hooks, extents, extent, next, true,
-			    growing_retained)) {
-				if (extents->delay_coalesce) {
-					/* Do minimal coalescing. */
-					*coalesced = true;
-					return extent;
-				}
-				again = true;
-			}
-		}
-
-		/* Try to coalesce backward. */
-		extent_t *prev = extent_lock_from_addr(tsdn, rtree_ctx,
-		    extent_before_get(extent));
-		if (prev != NULL) {
-			bool can_coalesce = extent_can_coalesce(arena, extents,
-			    extent, prev);
-			extent_unlock(tsdn, prev);
-
-			if (can_coalesce && !extent_coalesce(tsdn, arena,
-			    r_extent_hooks, extents, extent, prev, false,
-			    growing_retained)) {
-				extent = prev;
-				if (extents->delay_coalesce) {
-					/* Do minimal coalescing. */
-					*coalesced = true;
-					return extent;
-				}
-				again = true;
-			}
-		}
-	} while (again);
-
-	if (extents->delay_coalesce) {
-		*coalesced = false;
-	}
-	return extent;
-}
-
-/*
- * Does the metadata management portions of putting an unused extent into the
- * given extents_t (coalesces, deregisters slab interiors, the heap operations).
- */
-static void
-extent_record(tsdn_t *tsdn, arena_t *arena, extent_hooks_t **r_extent_hooks,
-    extents_t *extents, extent_t *extent, bool growing_retained) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	assert((extents_state_get(extents) != extent_state_dirty &&
-	    extents_state_get(extents) != extent_state_muzzy) ||
-	    !extent_zeroed_get(extent));
-
-	malloc_mutex_lock(tsdn, &extents->mtx);
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	extent_szind_set(extent, NSIZES);
-	if (extent_slab_get(extent)) {
-		extent_interior_deregister(tsdn, rtree_ctx, extent);
-		extent_slab_set(extent, false);
-	}
-
-	assert(rtree_extent_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)extent_base_get(extent), true) == extent);
-
-	if (!extents->delay_coalesce) {
-		extent = extent_try_coalesce(tsdn, arena, r_extent_hooks,
-		    rtree_ctx, extents, extent, NULL, growing_retained);
-	} else if (extent_size_get(extent) >= LARGE_MINCLASS) {
-		/* Always coalesce large extents eagerly. */
-		bool coalesced;
-		size_t prev_size;
-		do {
-			prev_size = extent_size_get(extent);
-			assert(extent_state_get(extent) == extent_state_active);
-			extent = extent_try_coalesce(tsdn, arena,
-			    r_extent_hooks, rtree_ctx, extents, extent,
-			    &coalesced, growing_retained);
-		} while (coalesced &&
-		    extent_size_get(extent) >= prev_size + LARGE_MINCLASS);
-	}
-	extent_deactivate_locked(tsdn, arena, extents, extent);
-
-	malloc_mutex_unlock(tsdn, &extents->mtx);
-}
-
-void
-extent_dalloc_gap(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
-	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
-
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	if (extent_register(tsdn, extent)) {
-		extents_leak(tsdn, arena, &extent_hooks,
-		    &arena->extents_retained, extent, false);
-		return;
-	}
-	extent_dalloc_wrapper(tsdn, arena, &extent_hooks, extent);
-}
-
-static bool
-extent_dalloc_default_impl(void *addr, size_t size) {
-	if (!have_dss || !extent_in_dss(addr)) {
-		return extent_dalloc_mmap(addr, size);
-	}
-	return true;
-}
-
-static bool
-extent_dalloc_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    bool committed, unsigned arena_ind) {
-	return extent_dalloc_default_impl(addr, size);
-}
-
-static bool
-extent_dalloc_wrapper_try(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent) {
-	bool err;
-
-	assert(extent_base_get(extent) != NULL);
-	assert(extent_size_get(extent) != 0);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_addr_set(extent, extent_base_get(extent));
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-	/* Try to deallocate. */
-	if (*r_extent_hooks == &extent_hooks_default) {
-		/* Call directly to propagate tsdn. */
-		err = extent_dalloc_default_impl(extent_base_get(extent),
-		    extent_size_get(extent));
-	} else {
-		extent_hook_pre_reentrancy(tsdn, arena);
-		err = ((*r_extent_hooks)->dalloc == NULL ||
-		    (*r_extent_hooks)->dalloc(*r_extent_hooks,
-		    extent_base_get(extent), extent_size_get(extent),
-		    extent_committed_get(extent), arena_ind_get(arena)));
-		extent_hook_post_reentrancy(tsdn);
-	}
-
-	if (!err) {
-		extent_dalloc(tsdn, arena, extent);
-	}
-
-	return err;
-}
-
-void
-extent_dalloc_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent) {
-	assert(extent_dumpable_get(extent));
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	/*
-	 * Deregister first to avoid a race with other allocating threads, and
-	 * reregister if deallocation fails.
-	 */
-	extent_deregister(tsdn, extent);
-	if (!extent_dalloc_wrapper_try(tsdn, arena, r_extent_hooks, extent)) {
-		return;
-	}
-
-	extent_reregister(tsdn, extent);
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	/* Try to decommit; purge if that fails. */
-	bool zeroed;
-	if (!extent_committed_get(extent)) {
-		zeroed = true;
-	} else if (!extent_decommit_wrapper(tsdn, arena, r_extent_hooks, extent,
-	    0, extent_size_get(extent))) {
-		zeroed = true;
-	} else if ((*r_extent_hooks)->purge_forced != NULL &&
-	    !(*r_extent_hooks)->purge_forced(*r_extent_hooks,
-	    extent_base_get(extent), extent_size_get(extent), 0,
-	    extent_size_get(extent), arena_ind_get(arena))) {
-		zeroed = true;
-	} else if (extent_state_get(extent) == extent_state_muzzy ||
-	    ((*r_extent_hooks)->purge_lazy != NULL &&
-	    !(*r_extent_hooks)->purge_lazy(*r_extent_hooks,
-	    extent_base_get(extent), extent_size_get(extent), 0,
-	    extent_size_get(extent), arena_ind_get(arena)))) {
-		zeroed = false;
-	} else {
-		zeroed = false;
-	}
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-	extent_zeroed_set(extent, zeroed);
-
-	if (config_prof) {
-		extent_gdump_sub(tsdn, extent);
-	}
-
-	extent_record(tsdn, arena, r_extent_hooks, &arena->extents_retained,
-	    extent, false);
-}
-
-static void
-extent_destroy_default_impl(void *addr, size_t size) {
-	if (!have_dss || !extent_in_dss(addr)) {
-		pages_unmap(addr, size);
-	}
-}
-
-static void
-extent_destroy_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    bool committed, unsigned arena_ind) {
-	extent_destroy_default_impl(addr, size);
-}
-
-void
-extent_destroy_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent) {
-	assert(extent_base_get(extent) != NULL);
-	assert(extent_size_get(extent) != 0);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	/* Deregister first to avoid a race with other allocating threads. */
-	extent_deregister(tsdn, extent);
-
-	extent_addr_set(extent, extent_base_get(extent));
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-	/* Try to destroy; silently fail otherwise. */
-	if (*r_extent_hooks == &extent_hooks_default) {
-		/* Call directly to propagate tsdn. */
-		extent_destroy_default_impl(extent_base_get(extent),
-		    extent_size_get(extent));
-	} else if ((*r_extent_hooks)->destroy != NULL) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-		(*r_extent_hooks)->destroy(*r_extent_hooks,
-		    extent_base_get(extent), extent_size_get(extent),
-		    extent_committed_get(extent), arena_ind_get(arena));
-		extent_hook_post_reentrancy(tsdn);
-	}
-
-	extent_dalloc(tsdn, arena, extent);
-}
-
-static bool
-extent_commit_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	return pages_commit((void *)((uintptr_t)addr + (uintptr_t)offset),
-	    length);
-}
-
-static bool
-extent_commit_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	bool err = ((*r_extent_hooks)->commit == NULL ||
-	    (*r_extent_hooks)->commit(*r_extent_hooks, extent_base_get(extent),
-	    extent_size_get(extent), offset, length, arena_ind_get(arena)));
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-	extent_committed_set(extent, extent_committed_get(extent) || !err);
-	return err;
-}
-
-bool
-extent_commit_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length) {
-	return extent_commit_impl(tsdn, arena, r_extent_hooks, extent, offset,
-	    length, false);
-}
-
-static bool
-extent_decommit_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	return pages_decommit((void *)((uintptr_t)addr + (uintptr_t)offset),
-	    length);
-}
-
-bool
-extent_decommit_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	bool err = ((*r_extent_hooks)->decommit == NULL ||
-	    (*r_extent_hooks)->decommit(*r_extent_hooks,
-	    extent_base_get(extent), extent_size_get(extent), offset, length,
-	    arena_ind_get(arena)));
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-	extent_committed_set(extent, extent_committed_get(extent) && err);
-	return err;
-}
-
-#ifdef PAGES_CAN_PURGE_LAZY
-static bool
-extent_purge_lazy_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	assert(addr != NULL);
-	assert((offset & PAGE_MASK) == 0);
-	assert(length != 0);
-	assert((length & PAGE_MASK) == 0);
-
-	return pages_purge_lazy((void *)((uintptr_t)addr + (uintptr_t)offset),
-	    length);
-}
-#endif
-
-static bool
-extent_purge_lazy_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	if ((*r_extent_hooks)->purge_lazy == NULL) {
-		return true;
-	}
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	bool err = (*r_extent_hooks)->purge_lazy(*r_extent_hooks,
-	    extent_base_get(extent), extent_size_get(extent), offset, length,
-	    arena_ind_get(arena));
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-
-	return err;
-}
-
-bool
-extent_purge_lazy_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length) {
-	return extent_purge_lazy_impl(tsdn, arena, r_extent_hooks, extent,
-	    offset, length, false);
-}
-
-#ifdef PAGES_CAN_PURGE_FORCED
-static bool
-extent_purge_forced_default(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind) {
-	assert(addr != NULL);
-	assert((offset & PAGE_MASK) == 0);
-	assert(length != 0);
-	assert((length & PAGE_MASK) == 0);
-
-	return pages_purge_forced((void *)((uintptr_t)addr +
-	    (uintptr_t)offset), length);
-}
-#endif
-
-static bool
-extent_purge_forced_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length, bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	if ((*r_extent_hooks)->purge_forced == NULL) {
-		return true;
-	}
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	bool err = (*r_extent_hooks)->purge_forced(*r_extent_hooks,
-	    extent_base_get(extent), extent_size_get(extent), offset, length,
-	    arena_ind_get(arena));
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-	return err;
-}
-
-bool
-extent_purge_forced_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t offset,
-    size_t length) {
-	return extent_purge_forced_impl(tsdn, arena, r_extent_hooks, extent,
-	    offset, length, false);
-}
-
-#ifdef JEMALLOC_MAPS_COALESCE
-static bool
-extent_split_default(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t size_a, size_t size_b, bool committed, unsigned arena_ind) {
-	return !maps_coalesce;
-}
-#endif
-
-/*
- * Accepts the extent to split, and the characteristics of each side of the
- * split.  The 'a' parameters go with the 'lead' of the resulting pair of
- * extents (the lower addressed portion of the split), and the 'b' parameters go
- * with the trail (the higher addressed portion).  This makes 'extent' the lead,
- * and returns the trail (except in case of error).
- */
-static extent_t *
-extent_split_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
-    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b,
-    bool growing_retained) {
-	assert(extent_size_get(extent) == size_a + size_b);
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	if ((*r_extent_hooks)->split == NULL) {
-		return NULL;
-	}
-
-	extent_t *trail = extent_alloc(tsdn, arena);
-	if (trail == NULL) {
-		goto label_error_a;
-	}
-
-	extent_init(trail, arena, (void *)((uintptr_t)extent_base_get(extent) +
-	    size_a), size_b, slab_b, szind_b, extent_sn_get(extent),
-	    extent_state_get(extent), extent_zeroed_get(extent),
-	    extent_committed_get(extent), extent_dumpable_get(extent));
-
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	rtree_leaf_elm_t *lead_elm_a, *lead_elm_b;
-	{
-		extent_t lead;
-
-		extent_init(&lead, arena, extent_addr_get(extent), size_a,
-		    slab_a, szind_a, extent_sn_get(extent),
-		    extent_state_get(extent), extent_zeroed_get(extent),
-		    extent_committed_get(extent), extent_dumpable_get(extent));
-
-		extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, &lead, false,
-		    true, &lead_elm_a, &lead_elm_b);
-	}
-	rtree_leaf_elm_t *trail_elm_a, *trail_elm_b;
-	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, trail, false, true,
-	    &trail_elm_a, &trail_elm_b);
-
-	if (lead_elm_a == NULL || lead_elm_b == NULL || trail_elm_a == NULL
-	    || trail_elm_b == NULL) {
-		goto label_error_b;
-	}
-
-	extent_lock2(tsdn, extent, trail);
-
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_pre_reentrancy(tsdn, arena);
-	}
-	bool err = (*r_extent_hooks)->split(*r_extent_hooks, extent_base_get(extent),
-	    size_a + size_b, size_a, size_b, extent_committed_get(extent),
-	    arena_ind_get(arena));
-	if (*r_extent_hooks != &extent_hooks_default) {
-		extent_hook_post_reentrancy(tsdn);
-	}
-	if (err) {
-		goto label_error_c;
-	}
-
-	extent_size_set(extent, size_a);
-	extent_szind_set(extent, szind_a);
-
-	extent_rtree_write_acquired(tsdn, lead_elm_a, lead_elm_b, extent,
-	    szind_a, slab_a);
-	extent_rtree_write_acquired(tsdn, trail_elm_a, trail_elm_b, trail,
-	    szind_b, slab_b);
-
-	extent_unlock2(tsdn, extent, trail);
-
-	return trail;
-label_error_c:
-	extent_unlock2(tsdn, extent, trail);
-label_error_b:
-	extent_dalloc(tsdn, arena, trail);
-label_error_a:
-	return NULL;
-}
-
-extent_t *
-extent_split_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *extent, size_t size_a,
-    szind_t szind_a, bool slab_a, size_t size_b, szind_t szind_b, bool slab_b) {
-	return extent_split_impl(tsdn, arena, r_extent_hooks, extent, size_a,
-	    szind_a, slab_a, size_b, szind_b, slab_b, false);
-}
-
-static bool
-extent_merge_default_impl(void *addr_a, void *addr_b) {
-	if (!maps_coalesce) {
-		return true;
-	}
-	if (have_dss && !extent_dss_mergeable(addr_a, addr_b)) {
-		return true;
-	}
-
-	return false;
-}
-
-#ifdef JEMALLOC_MAPS_COALESCE
-static bool
-extent_merge_default(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
-    void *addr_b, size_t size_b, bool committed, unsigned arena_ind) {
-	return extent_merge_default_impl(addr_a, addr_b);
-}
-#endif
-
-static bool
-extent_merge_impl(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b,
-    bool growing_retained) {
-	witness_assert_depth_to_rank(tsdn_witness_tsdp_get(tsdn),
-	    WITNESS_RANK_CORE, growing_retained ? 1 : 0);
-
-	extent_hooks_assure_initialized(arena, r_extent_hooks);
-
-	if ((*r_extent_hooks)->merge == NULL) {
-		return true;
-	}
-
-	bool err;
-	if (*r_extent_hooks == &extent_hooks_default) {
-		/* Call directly to propagate tsdn. */
-		err = extent_merge_default_impl(extent_base_get(a),
-		    extent_base_get(b));
-	} else {
-		extent_hook_pre_reentrancy(tsdn, arena);
-		err = (*r_extent_hooks)->merge(*r_extent_hooks,
-		    extent_base_get(a), extent_size_get(a), extent_base_get(b),
-		    extent_size_get(b), extent_committed_get(a),
-		    arena_ind_get(arena));
-		extent_hook_post_reentrancy(tsdn);
-	}
-
-	if (err) {
-		return true;
-	}
-
-	/*
-	 * The rtree writes must happen while all the relevant elements are
-	 * owned, so the following code uses decomposed helper functions rather
-	 * than extent_{,de}register() to do things in the right order.
-	 */
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	rtree_leaf_elm_t *a_elm_a, *a_elm_b, *b_elm_a, *b_elm_b;
-	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, a, true, false, &a_elm_a,
-	    &a_elm_b);
-	extent_rtree_leaf_elms_lookup(tsdn, rtree_ctx, b, true, false, &b_elm_a,
-	    &b_elm_b);
-
-	extent_lock2(tsdn, a, b);
-
-	if (a_elm_b != NULL) {
-		rtree_leaf_elm_write(tsdn, &extents_rtree, a_elm_b, NULL,
-		    NSIZES, false);
-	}
-	if (b_elm_b != NULL) {
-		rtree_leaf_elm_write(tsdn, &extents_rtree, b_elm_a, NULL,
-		    NSIZES, false);
-	} else {
-		b_elm_b = b_elm_a;
-	}
-
-	extent_size_set(a, extent_size_get(a) + extent_size_get(b));
-	extent_szind_set(a, NSIZES);
-	extent_sn_set(a, (extent_sn_get(a) < extent_sn_get(b)) ?
-	    extent_sn_get(a) : extent_sn_get(b));
-	extent_zeroed_set(a, extent_zeroed_get(a) && extent_zeroed_get(b));
-
-	extent_rtree_write_acquired(tsdn, a_elm_a, b_elm_b, a, NSIZES, false);
-
-	extent_unlock2(tsdn, a, b);
-
-	extent_dalloc(tsdn, extent_arena_get(b), b);
-
-	return false;
-}
-
-bool
-extent_merge_wrapper(tsdn_t *tsdn, arena_t *arena,
-    extent_hooks_t **r_extent_hooks, extent_t *a, extent_t *b) {
-	return extent_merge_impl(tsdn, arena, r_extent_hooks, a, b, false);
-}
-
-bool
-extent_boot(void) {
-	if (rtree_new(&extents_rtree, true)) {
-		return true;
-	}
-
-	if (mutex_pool_init(&extent_mutex_pool, "extent_mutex_pool",
-	    WITNESS_RANK_EXTENT_POOL)) {
-		return true;
-	}
-
-	if (have_dss) {
-		extent_dss_boot();
-	}
-
-	return false;
-}
diff --git a/redis-stable/deps/jemalloc/src/extent_dss.c b/redis-stable/deps/jemalloc/src/extent_dss.c
deleted file mode 100644
index 2b1ea9ca..00000000
--- a/redis-stable/deps/jemalloc/src/extent_dss.c
+++ /dev/null
@@ -1,270 +0,0 @@
-#define JEMALLOC_EXTENT_DSS_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/spin.h"
-
-/******************************************************************************/
-/* Data. */
-
-const char	*opt_dss = DSS_DEFAULT;
-
-const char	*dss_prec_names[] = {
-	"disabled",
-	"primary",
-	"secondary",
-	"N/A"
-};
-
-/*
- * Current dss precedence default, used when creating new arenas.  NB: This is
- * stored as unsigned rather than dss_prec_t because in principle there's no
- * guarantee that sizeof(dss_prec_t) is the same as sizeof(unsigned), and we use
- * atomic operations to synchronize the setting.
- */
-static atomic_u_t	dss_prec_default = ATOMIC_INIT(
-    (unsigned)DSS_PREC_DEFAULT);
-
-/* Base address of the DSS. */
-static void		*dss_base;
-/* Atomic boolean indicating whether a thread is currently extending DSS. */
-static atomic_b_t	dss_extending;
-/* Atomic boolean indicating whether the DSS is exhausted. */
-static atomic_b_t	dss_exhausted;
-/* Atomic current upper limit on DSS addresses. */
-static atomic_p_t	dss_max;
-
-/******************************************************************************/
-
-static void *
-extent_dss_sbrk(intptr_t increment) {
-#ifdef JEMALLOC_DSS
-	return sbrk(increment);
-#else
-	not_implemented();
-	return NULL;
-#endif
-}
-
-dss_prec_t
-extent_dss_prec_get(void) {
-	dss_prec_t ret;
-
-	if (!have_dss) {
-		return dss_prec_disabled;
-	}
-	ret = (dss_prec_t)atomic_load_u(&dss_prec_default, ATOMIC_ACQUIRE);
-	return ret;
-}
-
-bool
-extent_dss_prec_set(dss_prec_t dss_prec) {
-	if (!have_dss) {
-		return (dss_prec != dss_prec_disabled);
-	}
-	atomic_store_u(&dss_prec_default, (unsigned)dss_prec, ATOMIC_RELEASE);
-	return false;
-}
-
-static void
-extent_dss_extending_start(void) {
-	spin_t spinner = SPIN_INITIALIZER;
-	while (true) {
-		bool expected = false;
-		if (atomic_compare_exchange_weak_b(&dss_extending, &expected,
-		    true, ATOMIC_ACQ_REL, ATOMIC_RELAXED)) {
-			break;
-		}
-		spin_adaptive(&spinner);
-	}
-}
-
-static void
-extent_dss_extending_finish(void) {
-	assert(atomic_load_b(&dss_extending, ATOMIC_RELAXED));
-
-	atomic_store_b(&dss_extending, false, ATOMIC_RELEASE);
-}
-
-static void *
-extent_dss_max_update(void *new_addr) {
-	/*
-	 * Get the current end of the DSS as max_cur and assure that dss_max is
-	 * up to date.
-	 */
-	void *max_cur = extent_dss_sbrk(0);
-	if (max_cur == (void *)-1) {
-		return NULL;
-	}
-	atomic_store_p(&dss_max, max_cur, ATOMIC_RELEASE);
-	/* Fixed new_addr can only be supported if it is at the edge of DSS. */
-	if (new_addr != NULL && max_cur != new_addr) {
-		return NULL;
-	}
-	return max_cur;
-}
-
-void *
-extent_alloc_dss(tsdn_t *tsdn, arena_t *arena, void *new_addr, size_t size,
-    size_t alignment, bool *zero, bool *commit) {
-	extent_t *gap;
-
-	cassert(have_dss);
-	assert(size > 0);
-	assert(alignment > 0);
-
-	/*
-	 * sbrk() uses a signed increment argument, so take care not to
-	 * interpret a large allocation request as a negative increment.
-	 */
-	if ((intptr_t)size < 0) {
-		return NULL;
-	}
-
-	gap = extent_alloc(tsdn, arena);
-	if (gap == NULL) {
-		return NULL;
-	}
-
-	extent_dss_extending_start();
-	if (!atomic_load_b(&dss_exhausted, ATOMIC_ACQUIRE)) {
-		/*
-		 * The loop is necessary to recover from races with other
-		 * threads that are using the DSS for something other than
-		 * malloc.
-		 */
-		while (true) {
-			void *max_cur = extent_dss_max_update(new_addr);
-			if (max_cur == NULL) {
-				goto label_oom;
-			}
-
-			/*
-			 * Compute how much page-aligned gap space (if any) is
-			 * necessary to satisfy alignment.  This space can be
-			 * recycled for later use.
-			 */
-			void *gap_addr_page = (void *)(PAGE_CEILING(
-			    (uintptr_t)max_cur));
-			void *ret = (void *)ALIGNMENT_CEILING(
-			    (uintptr_t)gap_addr_page, alignment);
-			size_t gap_size_page = (uintptr_t)ret -
-			    (uintptr_t)gap_addr_page;
-			if (gap_size_page != 0) {
-				extent_init(gap, arena, gap_addr_page,
-				    gap_size_page, false, NSIZES,
-				    arena_extent_sn_next(arena),
-				    extent_state_active, false, true, true);
-			}
-			/*
-			 * Compute the address just past the end of the desired
-			 * allocation space.
-			 */
-			void *dss_next = (void *)((uintptr_t)ret + size);
-			if ((uintptr_t)ret < (uintptr_t)max_cur ||
-			    (uintptr_t)dss_next < (uintptr_t)max_cur) {
-				goto label_oom; /* Wrap-around. */
-			}
-			/* Compute the increment, including subpage bytes. */
-			void *gap_addr_subpage = max_cur;
-			size_t gap_size_subpage = (uintptr_t)ret -
-			    (uintptr_t)gap_addr_subpage;
-			intptr_t incr = gap_size_subpage + size;
-
-			assert((uintptr_t)max_cur + incr == (uintptr_t)ret +
-			    size);
-
-			/* Try to allocate. */
-			void *dss_prev = extent_dss_sbrk(incr);
-			if (dss_prev == max_cur) {
-				/* Success. */
-				atomic_store_p(&dss_max, dss_next,
-				    ATOMIC_RELEASE);
-				extent_dss_extending_finish();
-
-				if (gap_size_page != 0) {
-					extent_dalloc_gap(tsdn, arena, gap);
-				} else {
-					extent_dalloc(tsdn, arena, gap);
-				}
-				if (!*commit) {
-					*commit = pages_decommit(ret, size);
-				}
-				if (*zero && *commit) {
-					extent_hooks_t *extent_hooks =
-					    EXTENT_HOOKS_INITIALIZER;
-					extent_t extent;
-
-					extent_init(&extent, arena, ret, size,
-					    size, false, NSIZES,
-					    extent_state_active, false, true,
-					    true);
-					if (extent_purge_forced_wrapper(tsdn,
-					    arena, &extent_hooks, &extent, 0,
-					    size)) {
-						memset(ret, 0, size);
-					}
-				}
-				return ret;
-			}
-			/*
-			 * Failure, whether due to OOM or a race with a raw
-			 * sbrk() call from outside the allocator.
-			 */
-			if (dss_prev == (void *)-1) {
-				/* OOM. */
-				atomic_store_b(&dss_exhausted, true,
-				    ATOMIC_RELEASE);
-				goto label_oom;
-			}
-		}
-	}
-label_oom:
-	extent_dss_extending_finish();
-	extent_dalloc(tsdn, arena, gap);
-	return NULL;
-}
-
-static bool
-extent_in_dss_helper(void *addr, void *max) {
-	return ((uintptr_t)addr >= (uintptr_t)dss_base && (uintptr_t)addr <
-	    (uintptr_t)max);
-}
-
-bool
-extent_in_dss(void *addr) {
-	cassert(have_dss);
-
-	return extent_in_dss_helper(addr, atomic_load_p(&dss_max,
-	    ATOMIC_ACQUIRE));
-}
-
-bool
-extent_dss_mergeable(void *addr_a, void *addr_b) {
-	void *max;
-
-	cassert(have_dss);
-
-	if ((uintptr_t)addr_a < (uintptr_t)dss_base && (uintptr_t)addr_b <
-	    (uintptr_t)dss_base) {
-		return true;
-	}
-
-	max = atomic_load_p(&dss_max, ATOMIC_ACQUIRE);
-	return (extent_in_dss_helper(addr_a, max) ==
-	    extent_in_dss_helper(addr_b, max));
-}
-
-void
-extent_dss_boot(void) {
-	cassert(have_dss);
-
-	dss_base = extent_dss_sbrk(0);
-	atomic_store_b(&dss_extending, false, ATOMIC_RELAXED);
-	atomic_store_b(&dss_exhausted, dss_base == (void *)-1, ATOMIC_RELAXED);
-	atomic_store_p(&dss_max, dss_base, ATOMIC_RELAXED);
-}
-
-/******************************************************************************/
diff --git a/redis-stable/deps/jemalloc/src/extent_mmap.c b/redis-stable/deps/jemalloc/src/extent_mmap.c
deleted file mode 100644
index 8d607dc8..00000000
--- a/redis-stable/deps/jemalloc/src/extent_mmap.c
+++ /dev/null
@@ -1,42 +0,0 @@
-#define JEMALLOC_EXTENT_MMAP_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/extent_mmap.h"
-
-/******************************************************************************/
-/* Data. */
-
-bool	opt_retain =
-#ifdef JEMALLOC_RETAIN
-    true
-#else
-    false
-#endif
-    ;
-
-/******************************************************************************/
-
-void *
-extent_alloc_mmap(void *new_addr, size_t size, size_t alignment, bool *zero,
-    bool *commit) {
-	void *ret = pages_map(new_addr, size, ALIGNMENT_CEILING(alignment,
-	    PAGE), commit);
-	if (ret == NULL) {
-		return NULL;
-	}
-	assert(ret != NULL);
-	if (*commit) {
-		*zero = true;
-	}
-	return ret;
-}
-
-bool
-extent_dalloc_mmap(void *addr, size_t size) {
-	if (!opt_retain) {
-		pages_unmap(addr, size);
-	}
-	return opt_retain;
-}
diff --git a/redis-stable/deps/jemalloc/src/hash.c b/redis-stable/deps/jemalloc/src/hash.c
deleted file mode 100644
index 7b2bdc2b..00000000
--- a/redis-stable/deps/jemalloc/src/hash.c
+++ /dev/null
@@ -1,3 +0,0 @@
-#define JEMALLOC_HASH_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/hooks.c b/redis-stable/deps/jemalloc/src/hooks.c
deleted file mode 100644
index 6266ecd4..00000000
--- a/redis-stable/deps/jemalloc/src/hooks.c
+++ /dev/null
@@ -1,12 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-
-/*
- * The hooks are a little bit screwy -- they're not genuinely exported in the
- * sense that we want them available to end-users, but we do want them visible
- * from outside the generated library, so that we can use them in test code.
- */
-JEMALLOC_EXPORT
-void (*hooks_arena_new_hook)() = NULL;
-
-JEMALLOC_EXPORT
-void (*hooks_libc_hook)() = NULL;
diff --git a/redis-stable/deps/jemalloc/src/jemalloc.c b/redis-stable/deps/jemalloc/src/jemalloc.c
deleted file mode 100644
index 585645a2..00000000
--- a/redis-stable/deps/jemalloc/src/jemalloc.c
+++ /dev/null
@@ -1,3335 +0,0 @@
-#define JEMALLOC_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/atomic.h"
-#include "jemalloc/internal/ctl.h"
-#include "jemalloc/internal/extent_dss.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/jemalloc_internal_types.h"
-#include "jemalloc/internal/log.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree.h"
-#include "jemalloc/internal/size_classes.h"
-#include "jemalloc/internal/spin.h"
-#include "jemalloc/internal/sz.h"
-#include "jemalloc/internal/ticker.h"
-#include "jemalloc/internal/util.h"
-
-/******************************************************************************/
-/* Data. */
-
-/* Runtime configuration options. */
-const char	*je_malloc_conf
-#ifndef _WIN32
-    JEMALLOC_ATTR(weak)
-#endif
-    ;
-bool	opt_abort =
-#ifdef JEMALLOC_DEBUG
-    true
-#else
-    false
-#endif
-    ;
-bool	opt_abort_conf =
-#ifdef JEMALLOC_DEBUG
-    true
-#else
-    false
-#endif
-    ;
-const char	*opt_junk =
-#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
-    "true"
-#else
-    "false"
-#endif
-    ;
-bool	opt_junk_alloc =
-#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
-    true
-#else
-    false
-#endif
-    ;
-bool	opt_junk_free =
-#if (defined(JEMALLOC_DEBUG) && defined(JEMALLOC_FILL))
-    true
-#else
-    false
-#endif
-    ;
-
-bool	opt_utrace = false;
-bool	opt_xmalloc = false;
-bool	opt_zero = false;
-unsigned	opt_narenas = 0;
-
-unsigned	ncpus;
-
-/* Protects arenas initialization. */
-malloc_mutex_t arenas_lock;
-/*
- * Arenas that are used to service external requests.  Not all elements of the
- * arenas array are necessarily used; arenas are created lazily as needed.
- *
- * arenas[0..narenas_auto) are used for automatic multiplexing of threads and
- * arenas.  arenas[narenas_auto..narenas_total) are only used if the application
- * takes some action to create them and allocate from them.
- *
- * Points to an arena_t.
- */
-JEMALLOC_ALIGNED(CACHELINE)
-atomic_p_t		arenas[MALLOCX_ARENA_LIMIT];
-static atomic_u_t	narenas_total; /* Use narenas_total_*(). */
-static arena_t		*a0; /* arenas[0]; read-only after initialization. */
-unsigned		narenas_auto; /* Read-only after initialization. */
-
-typedef enum {
-	malloc_init_uninitialized	= 3,
-	malloc_init_a0_initialized	= 2,
-	malloc_init_recursible		= 1,
-	malloc_init_initialized		= 0 /* Common case --> jnz. */
-} malloc_init_t;
-static malloc_init_t	malloc_init_state = malloc_init_uninitialized;
-
-/* False should be the common case.  Set to true to trigger initialization. */
-bool			malloc_slow = true;
-
-/* When malloc_slow is true, set the corresponding bits for sanity check. */
-enum {
-	flag_opt_junk_alloc	= (1U),
-	flag_opt_junk_free	= (1U << 1),
-	flag_opt_zero		= (1U << 2),
-	flag_opt_utrace		= (1U << 3),
-	flag_opt_xmalloc	= (1U << 4)
-};
-static uint8_t	malloc_slow_flags;
-
-#ifdef JEMALLOC_THREADED_INIT
-/* Used to let the initializing thread recursively allocate. */
-#  define NO_INITIALIZER	((unsigned long)0)
-#  define INITIALIZER		pthread_self()
-#  define IS_INITIALIZER	(malloc_initializer == pthread_self())
-static pthread_t		malloc_initializer = NO_INITIALIZER;
-#else
-#  define NO_INITIALIZER	false
-#  define INITIALIZER		true
-#  define IS_INITIALIZER	malloc_initializer
-static bool			malloc_initializer = NO_INITIALIZER;
-#endif
-
-/* Used to avoid initialization races. */
-#ifdef _WIN32
-#if _WIN32_WINNT >= 0x0600
-static malloc_mutex_t	init_lock = SRWLOCK_INIT;
-#else
-static malloc_mutex_t	init_lock;
-static bool init_lock_initialized = false;
-
-JEMALLOC_ATTR(constructor)
-static void WINAPI
-_init_init_lock(void) {
-	/*
-	 * If another constructor in the same binary is using mallctl to e.g.
-	 * set up extent hooks, it may end up running before this one, and
-	 * malloc_init_hard will crash trying to lock the uninitialized lock. So
-	 * we force an initialization of the lock in malloc_init_hard as well.
-	 * We don't try to care about atomicity of the accessed to the
-	 * init_lock_initialized boolean, since it really only matters early in
-	 * the process creation, before any separate thread normally starts
-	 * doing anything.
-	 */
-	if (!init_lock_initialized) {
-		malloc_mutex_init(&init_lock, "init", WITNESS_RANK_INIT,
-		    malloc_mutex_rank_exclusive);
-	}
-	init_lock_initialized = true;
-}
-
-#ifdef _MSC_VER
-#  pragma section(".CRT$XCU", read)
-JEMALLOC_SECTION(".CRT$XCU") JEMALLOC_ATTR(used)
-static const void (WINAPI *init_init_lock)(void) = _init_init_lock;
-#endif
-#endif
-#else
-static malloc_mutex_t	init_lock = MALLOC_MUTEX_INITIALIZER;
-#endif
-
-typedef struct {
-	void	*p;	/* Input pointer (as in realloc(p, s)). */
-	size_t	s;	/* Request size. */
-	void	*r;	/* Result pointer. */
-} malloc_utrace_t;
-
-#ifdef JEMALLOC_UTRACE
-#  define UTRACE(a, b, c) do {						\
-	if (unlikely(opt_utrace)) {					\
-		int utrace_serrno = errno;				\
-		malloc_utrace_t ut;					\
-		ut.p = (a);						\
-		ut.s = (b);						\
-		ut.r = (c);						\
-		utrace(&ut, sizeof(ut));				\
-		errno = utrace_serrno;					\
-	}								\
-} while (0)
-#else
-#  define UTRACE(a, b, c)
-#endif
-
-/* Whether encountered any invalid config options. */
-static bool had_conf_error = false;
-
-/******************************************************************************/
-/*
- * Function prototypes for static functions that are referenced prior to
- * definition.
- */
-
-static bool	malloc_init_hard_a0(void);
-static bool	malloc_init_hard(void);
-
-/******************************************************************************/
-/*
- * Begin miscellaneous support functions.
- */
-
-bool
-malloc_initialized(void) {
-	return (malloc_init_state == malloc_init_initialized);
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-malloc_init_a0(void) {
-	if (unlikely(malloc_init_state == malloc_init_uninitialized)) {
-		return malloc_init_hard_a0();
-	}
-	return false;
-}
-
-JEMALLOC_ALWAYS_INLINE bool
-malloc_init(void) {
-	if (unlikely(!malloc_initialized()) && malloc_init_hard()) {
-		return true;
-	}
-	return false;
-}
-
-/*
- * The a0*() functions are used instead of i{d,}alloc() in situations that
- * cannot tolerate TLS variable access.
- */
-
-static void *
-a0ialloc(size_t size, bool zero, bool is_internal) {
-	if (unlikely(malloc_init_a0())) {
-		return NULL;
-	}
-
-	return iallocztm(TSDN_NULL, size, sz_size2index(size), zero, NULL,
-	    is_internal, arena_get(TSDN_NULL, 0, true), true);
-}
-
-static void
-a0idalloc(void *ptr, bool is_internal) {
-	idalloctm(TSDN_NULL, ptr, NULL, NULL, is_internal, true);
-}
-
-void *
-a0malloc(size_t size) {
-	return a0ialloc(size, false, true);
-}
-
-void
-a0dalloc(void *ptr) {
-	a0idalloc(ptr, true);
-}
-
-/*
- * FreeBSD's libc uses the bootstrap_*() functions in bootstrap-senstive
- * situations that cannot tolerate TLS variable access (TLS allocation and very
- * early internal data structure initialization).
- */
-
-void *
-bootstrap_malloc(size_t size) {
-	if (unlikely(size == 0)) {
-		size = 1;
-	}
-
-	return a0ialloc(size, false, false);
-}
-
-void *
-bootstrap_calloc(size_t num, size_t size) {
-	size_t num_size;
-
-	num_size = num * size;
-	if (unlikely(num_size == 0)) {
-		assert(num == 0 || size == 0);
-		num_size = 1;
-	}
-
-	return a0ialloc(num_size, true, false);
-}
-
-void
-bootstrap_free(void *ptr) {
-	if (unlikely(ptr == NULL)) {
-		return;
-	}
-
-	a0idalloc(ptr, false);
-}
-
-void
-arena_set(unsigned ind, arena_t *arena) {
-	atomic_store_p(&arenas[ind], arena, ATOMIC_RELEASE);
-}
-
-static void
-narenas_total_set(unsigned narenas) {
-	atomic_store_u(&narenas_total, narenas, ATOMIC_RELEASE);
-}
-
-static void
-narenas_total_inc(void) {
-	atomic_fetch_add_u(&narenas_total, 1, ATOMIC_RELEASE);
-}
-
-unsigned
-narenas_total_get(void) {
-	return atomic_load_u(&narenas_total, ATOMIC_ACQUIRE);
-}
-
-/* Create a new arena and insert it into the arenas array at index ind. */
-static arena_t *
-arena_init_locked(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
-	arena_t *arena;
-
-	assert(ind <= narenas_total_get());
-	if (ind >= MALLOCX_ARENA_LIMIT) {
-		return NULL;
-	}
-	if (ind == narenas_total_get()) {
-		narenas_total_inc();
-	}
-
-	/*
-	 * Another thread may have already initialized arenas[ind] if it's an
-	 * auto arena.
-	 */
-	arena = arena_get(tsdn, ind, false);
-	if (arena != NULL) {
-		assert(ind < narenas_auto);
-		return arena;
-	}
-
-	/* Actually initialize the arena. */
-	arena = arena_new(tsdn, ind, extent_hooks);
-
-	return arena;
-}
-
-static void
-arena_new_create_background_thread(tsdn_t *tsdn, unsigned ind) {
-	if (ind == 0) {
-		return;
-	}
-	if (have_background_thread) {
-		bool err;
-		malloc_mutex_lock(tsdn, &background_thread_lock);
-		err = background_thread_create(tsdn_tsd(tsdn), ind);
-		malloc_mutex_unlock(tsdn, &background_thread_lock);
-		if (err) {
-			malloc_printf("<jemalloc>: error in background thread "
-				      "creation for arena %u. Abort.\n", ind);
-			abort();
-		}
-	}
-}
-
-arena_t *
-arena_init(tsdn_t *tsdn, unsigned ind, extent_hooks_t *extent_hooks) {
-	arena_t *arena;
-
-	malloc_mutex_lock(tsdn, &arenas_lock);
-	arena = arena_init_locked(tsdn, ind, extent_hooks);
-	malloc_mutex_unlock(tsdn, &arenas_lock);
-
-	arena_new_create_background_thread(tsdn, ind);
-
-	return arena;
-}
-
-static void
-arena_bind(tsd_t *tsd, unsigned ind, bool internal) {
-	arena_t *arena = arena_get(tsd_tsdn(tsd), ind, false);
-	arena_nthreads_inc(arena, internal);
-
-	if (internal) {
-		tsd_iarena_set(tsd, arena);
-	} else {
-		tsd_arena_set(tsd, arena);
-	}
-}
-
-void
-arena_migrate(tsd_t *tsd, unsigned oldind, unsigned newind) {
-	arena_t *oldarena, *newarena;
-
-	oldarena = arena_get(tsd_tsdn(tsd), oldind, false);
-	newarena = arena_get(tsd_tsdn(tsd), newind, false);
-	arena_nthreads_dec(oldarena, false);
-	arena_nthreads_inc(newarena, false);
-	tsd_arena_set(tsd, newarena);
-}
-
-static void
-arena_unbind(tsd_t *tsd, unsigned ind, bool internal) {
-	arena_t *arena;
-
-	arena = arena_get(tsd_tsdn(tsd), ind, false);
-	arena_nthreads_dec(arena, internal);
-
-	if (internal) {
-		tsd_iarena_set(tsd, NULL);
-	} else {
-		tsd_arena_set(tsd, NULL);
-	}
-}
-
-arena_tdata_t *
-arena_tdata_get_hard(tsd_t *tsd, unsigned ind) {
-	arena_tdata_t *tdata, *arenas_tdata_old;
-	arena_tdata_t *arenas_tdata = tsd_arenas_tdata_get(tsd);
-	unsigned narenas_tdata_old, i;
-	unsigned narenas_tdata = tsd_narenas_tdata_get(tsd);
-	unsigned narenas_actual = narenas_total_get();
-
-	/*
-	 * Dissociate old tdata array (and set up for deallocation upon return)
-	 * if it's too small.
-	 */
-	if (arenas_tdata != NULL && narenas_tdata < narenas_actual) {
-		arenas_tdata_old = arenas_tdata;
-		narenas_tdata_old = narenas_tdata;
-		arenas_tdata = NULL;
-		narenas_tdata = 0;
-		tsd_arenas_tdata_set(tsd, arenas_tdata);
-		tsd_narenas_tdata_set(tsd, narenas_tdata);
-	} else {
-		arenas_tdata_old = NULL;
-		narenas_tdata_old = 0;
-	}
-
-	/* Allocate tdata array if it's missing. */
-	if (arenas_tdata == NULL) {
-		bool *arenas_tdata_bypassp = tsd_arenas_tdata_bypassp_get(tsd);
-		narenas_tdata = (ind < narenas_actual) ? narenas_actual : ind+1;
-
-		if (tsd_nominal(tsd) && !*arenas_tdata_bypassp) {
-			*arenas_tdata_bypassp = true;
-			arenas_tdata = (arena_tdata_t *)a0malloc(
-			    sizeof(arena_tdata_t) * narenas_tdata);
-			*arenas_tdata_bypassp = false;
-		}
-		if (arenas_tdata == NULL) {
-			tdata = NULL;
-			goto label_return;
-		}
-		assert(tsd_nominal(tsd) && !*arenas_tdata_bypassp);
-		tsd_arenas_tdata_set(tsd, arenas_tdata);
-		tsd_narenas_tdata_set(tsd, narenas_tdata);
-	}
-
-	/*
-	 * Copy to tdata array.  It's possible that the actual number of arenas
-	 * has increased since narenas_total_get() was called above, but that
-	 * causes no correctness issues unless two threads concurrently execute
-	 * the arenas.create mallctl, which we trust mallctl synchronization to
-	 * prevent.
-	 */
-
-	/* Copy/initialize tickers. */
-	for (i = 0; i < narenas_actual; i++) {
-		if (i < narenas_tdata_old) {
-			ticker_copy(&arenas_tdata[i].decay_ticker,
-			    &arenas_tdata_old[i].decay_ticker);
-		} else {
-			ticker_init(&arenas_tdata[i].decay_ticker,
-			    DECAY_NTICKS_PER_UPDATE);
-		}
-	}
-	if (narenas_tdata > narenas_actual) {
-		memset(&arenas_tdata[narenas_actual], 0, sizeof(arena_tdata_t)
-		    * (narenas_tdata - narenas_actual));
-	}
-
-	/* Read the refreshed tdata array. */
-	tdata = &arenas_tdata[ind];
-label_return:
-	if (arenas_tdata_old != NULL) {
-		a0dalloc(arenas_tdata_old);
-	}
-	return tdata;
-}
-
-/* Slow path, called only by arena_choose(). */
-arena_t *
-arena_choose_hard(tsd_t *tsd, bool internal) {
-	arena_t *ret JEMALLOC_CC_SILENCE_INIT(NULL);
-
-	if (have_percpu_arena && PERCPU_ARENA_ENABLED(opt_percpu_arena)) {
-		unsigned choose = percpu_arena_choose();
-		ret = arena_get(tsd_tsdn(tsd), choose, true);
-		assert(ret != NULL);
-		arena_bind(tsd, arena_ind_get(ret), false);
-		arena_bind(tsd, arena_ind_get(ret), true);
-
-		return ret;
-	}
-
-	if (narenas_auto > 1) {
-		unsigned i, j, choose[2], first_null;
-		bool is_new_arena[2];
-
-		/*
-		 * Determine binding for both non-internal and internal
-		 * allocation.
-		 *
-		 *   choose[0]: For application allocation.
-		 *   choose[1]: For internal metadata allocation.
-		 */
-
-		for (j = 0; j < 2; j++) {
-			choose[j] = 0;
-			is_new_arena[j] = false;
-		}
-
-		first_null = narenas_auto;
-		malloc_mutex_lock(tsd_tsdn(tsd), &arenas_lock);
-		assert(arena_get(tsd_tsdn(tsd), 0, false) != NULL);
-		for (i = 1; i < narenas_auto; i++) {
-			if (arena_get(tsd_tsdn(tsd), i, false) != NULL) {
-				/*
-				 * Choose the first arena that has the lowest
-				 * number of threads assigned to it.
-				 */
-				for (j = 0; j < 2; j++) {
-					if (arena_nthreads_get(arena_get(
-					    tsd_tsdn(tsd), i, false), !!j) <
-					    arena_nthreads_get(arena_get(
-					    tsd_tsdn(tsd), choose[j], false),
-					    !!j)) {
-						choose[j] = i;
-					}
-				}
-			} else if (first_null == narenas_auto) {
-				/*
-				 * Record the index of the first uninitialized
-				 * arena, in case all extant arenas are in use.
-				 *
-				 * NB: It is possible for there to be
-				 * discontinuities in terms of initialized
-				 * versus uninitialized arenas, due to the
-				 * "thread.arena" mallctl.
-				 */
-				first_null = i;
-			}
-		}
-
-		for (j = 0; j < 2; j++) {
-			if (arena_nthreads_get(arena_get(tsd_tsdn(tsd),
-			    choose[j], false), !!j) == 0 || first_null ==
-			    narenas_auto) {
-				/*
-				 * Use an unloaded arena, or the least loaded
-				 * arena if all arenas are already initialized.
-				 */
-				if (!!j == internal) {
-					ret = arena_get(tsd_tsdn(tsd),
-					    choose[j], false);
-				}
-			} else {
-				arena_t *arena;
-
-				/* Initialize a new arena. */
-				choose[j] = first_null;
-				arena = arena_init_locked(tsd_tsdn(tsd),
-				    choose[j],
-				    (extent_hooks_t *)&extent_hooks_default);
-				if (arena == NULL) {
-					malloc_mutex_unlock(tsd_tsdn(tsd),
-					    &arenas_lock);
-					return NULL;
-				}
-				is_new_arena[j] = true;
-				if (!!j == internal) {
-					ret = arena;
-				}
-			}
-			arena_bind(tsd, choose[j], !!j);
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &arenas_lock);
-
-		for (j = 0; j < 2; j++) {
-			if (is_new_arena[j]) {
-				assert(choose[j] > 0);
-				arena_new_create_background_thread(
-				    tsd_tsdn(tsd), choose[j]);
-			}
-		}
-
-	} else {
-		ret = arena_get(tsd_tsdn(tsd), 0, false);
-		arena_bind(tsd, 0, false);
-		arena_bind(tsd, 0, true);
-	}
-
-	return ret;
-}
-
-void
-iarena_cleanup(tsd_t *tsd) {
-	arena_t *iarena;
-
-	iarena = tsd_iarena_get(tsd);
-	if (iarena != NULL) {
-		arena_unbind(tsd, arena_ind_get(iarena), true);
-	}
-}
-
-void
-arena_cleanup(tsd_t *tsd) {
-	arena_t *arena;
-
-	arena = tsd_arena_get(tsd);
-	if (arena != NULL) {
-		arena_unbind(tsd, arena_ind_get(arena), false);
-	}
-}
-
-void
-arenas_tdata_cleanup(tsd_t *tsd) {
-	arena_tdata_t *arenas_tdata;
-
-	/* Prevent tsd->arenas_tdata from being (re)created. */
-	*tsd_arenas_tdata_bypassp_get(tsd) = true;
-
-	arenas_tdata = tsd_arenas_tdata_get(tsd);
-	if (arenas_tdata != NULL) {
-		tsd_arenas_tdata_set(tsd, NULL);
-		a0dalloc(arenas_tdata);
-	}
-}
-
-static void
-stats_print_atexit(void) {
-	if (config_stats) {
-		tsdn_t *tsdn;
-		unsigned narenas, i;
-
-		tsdn = tsdn_fetch();
-
-		/*
-		 * Merge stats from extant threads.  This is racy, since
-		 * individual threads do not lock when recording tcache stats
-		 * events.  As a consequence, the final stats may be slightly
-		 * out of date by the time they are reported, if other threads
-		 * continue to allocate.
-		 */
-		for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
-			arena_t *arena = arena_get(tsdn, i, false);
-			if (arena != NULL) {
-				tcache_t *tcache;
-
-				malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
-				ql_foreach(tcache, &arena->tcache_ql, link) {
-					tcache_stats_merge(tsdn, tcache, arena);
-				}
-				malloc_mutex_unlock(tsdn,
-				    &arena->tcache_ql_mtx);
-			}
-		}
-	}
-	je_malloc_stats_print(NULL, NULL, opt_stats_print_opts);
-}
-
-/*
- * Ensure that we don't hold any locks upon entry to or exit from allocator
- * code (in a "broad" sense that doesn't count a reentrant allocation as an
- * entrance or exit).
- */
-JEMALLOC_ALWAYS_INLINE void
-check_entry_exit_locking(tsdn_t *tsdn) {
-	if (!config_debug) {
-		return;
-	}
-	if (tsdn_null(tsdn)) {
-		return;
-	}
-	tsd_t *tsd = tsdn_tsd(tsdn);
-	/*
-	 * It's possible we hold locks at entry/exit if we're in a nested
-	 * allocation.
-	 */
-	int8_t reentrancy_level = tsd_reentrancy_level_get(tsd);
-	if (reentrancy_level != 0) {
-		return;
-	}
-	witness_assert_lockless(tsdn_witness_tsdp_get(tsdn));
-}
-
-/*
- * End miscellaneous support functions.
- */
-/******************************************************************************/
-/*
- * Begin initialization functions.
- */
-
-static char *
-jemalloc_secure_getenv(const char *name) {
-#ifdef JEMALLOC_HAVE_SECURE_GETENV
-	return secure_getenv(name);
-#else
-#  ifdef JEMALLOC_HAVE_ISSETUGID
-	if (issetugid() != 0) {
-		return NULL;
-	}
-#  endif
-	return getenv(name);
-#endif
-}
-
-static unsigned
-malloc_ncpus(void) {
-	long result;
-
-#ifdef _WIN32
-	SYSTEM_INFO si;
-	GetSystemInfo(&si);
-	result = si.dwNumberOfProcessors;
-#elif defined(JEMALLOC_GLIBC_MALLOC_HOOK) && defined(CPU_COUNT)
-	/*
-	 * glibc >= 2.6 has the CPU_COUNT macro.
-	 *
-	 * glibc's sysconf() uses isspace().  glibc allocates for the first time
-	 * *before* setting up the isspace tables.  Therefore we need a
-	 * different method to get the number of CPUs.
-	 */
-	{
-		cpu_set_t set;
-
-		pthread_getaffinity_np(pthread_self(), sizeof(set), &set);
-		result = CPU_COUNT(&set);
-	}
-#else
-	result = sysconf(_SC_NPROCESSORS_ONLN);
-#endif
-	return ((result == -1) ? 1 : (unsigned)result);
-}
-
-static void
-init_opt_stats_print_opts(const char *v, size_t vlen) {
-	size_t opts_len = strlen(opt_stats_print_opts);
-	assert(opts_len <= stats_print_tot_num_options);
-
-	for (size_t i = 0; i < vlen; i++) {
-		switch (v[i]) {
-#define OPTION(o, v, d, s) case o: break;
-			STATS_PRINT_OPTIONS
-#undef OPTION
-		default: continue;
-		}
-
-		if (strchr(opt_stats_print_opts, v[i]) != NULL) {
-			/* Ignore repeated. */
-			continue;
-		}
-
-		opt_stats_print_opts[opts_len++] = v[i];
-		opt_stats_print_opts[opts_len] = '\0';
-		assert(opts_len <= stats_print_tot_num_options);
-	}
-	assert(opts_len == strlen(opt_stats_print_opts));
-}
-
-static bool
-malloc_conf_next(char const **opts_p, char const **k_p, size_t *klen_p,
-    char const **v_p, size_t *vlen_p) {
-	bool accept;
-	const char *opts = *opts_p;
-
-	*k_p = opts;
-
-	for (accept = false; !accept;) {
-		switch (*opts) {
-		case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
-		case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
-		case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
-		case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
-		case 'Y': case 'Z':
-		case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
-		case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
-		case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
-		case 's': case 't': case 'u': case 'v': case 'w': case 'x':
-		case 'y': case 'z':
-		case '0': case '1': case '2': case '3': case '4': case '5':
-		case '6': case '7': case '8': case '9':
-		case '_':
-			opts++;
-			break;
-		case ':':
-			opts++;
-			*klen_p = (uintptr_t)opts - 1 - (uintptr_t)*k_p;
-			*v_p = opts;
-			accept = true;
-			break;
-		case '\0':
-			if (opts != *opts_p) {
-				malloc_write("<jemalloc>: Conf string ends "
-				    "with key\n");
-			}
-			return true;
-		default:
-			malloc_write("<jemalloc>: Malformed conf string\n");
-			return true;
-		}
-	}
-
-	for (accept = false; !accept;) {
-		switch (*opts) {
-		case ',':
-			opts++;
-			/*
-			 * Look ahead one character here, because the next time
-			 * this function is called, it will assume that end of
-			 * input has been cleanly reached if no input remains,
-			 * but we have optimistically already consumed the
-			 * comma if one exists.
-			 */
-			if (*opts == '\0') {
-				malloc_write("<jemalloc>: Conf string ends "
-				    "with comma\n");
-			}
-			*vlen_p = (uintptr_t)opts - 1 - (uintptr_t)*v_p;
-			accept = true;
-			break;
-		case '\0':
-			*vlen_p = (uintptr_t)opts - (uintptr_t)*v_p;
-			accept = true;
-			break;
-		default:
-			opts++;
-			break;
-		}
-	}
-
-	*opts_p = opts;
-	return false;
-}
-
-static void
-malloc_abort_invalid_conf(void) {
-	assert(opt_abort_conf);
-	malloc_printf("<jemalloc>: Abort (abort_conf:true) on invalid conf "
-	    "value (see above).\n");
-	abort();
-}
-
-static void
-malloc_conf_error(const char *msg, const char *k, size_t klen, const char *v,
-    size_t vlen) {
-	malloc_printf("<jemalloc>: %s: %.*s:%.*s\n", msg, (int)klen, k,
-	    (int)vlen, v);
-	/* If abort_conf is set, error out after processing all options. */
-	had_conf_error = true;
-}
-
-static void
-malloc_slow_flag_init(void) {
-	/*
-	 * Combine the runtime options into malloc_slow for fast path.  Called
-	 * after processing all the options.
-	 */
-	malloc_slow_flags |= (opt_junk_alloc ? flag_opt_junk_alloc : 0)
-	    | (opt_junk_free ? flag_opt_junk_free : 0)
-	    | (opt_zero ? flag_opt_zero : 0)
-	    | (opt_utrace ? flag_opt_utrace : 0)
-	    | (opt_xmalloc ? flag_opt_xmalloc : 0);
-
-	malloc_slow = (malloc_slow_flags != 0);
-}
-
-static void
-malloc_conf_init(void) {
-	unsigned i;
-	char buf[PATH_MAX + 1];
-	const char *opts, *k, *v;
-	size_t klen, vlen;
-
-	for (i = 0; i < 4; i++) {
-		/* Get runtime configuration. */
-		switch (i) {
-		case 0:
-			opts = config_malloc_conf;
-			break;
-		case 1:
-			if (je_malloc_conf != NULL) {
-				/*
-				 * Use options that were compiled into the
-				 * program.
-				 */
-				opts = je_malloc_conf;
-			} else {
-				/* No configuration specified. */
-				buf[0] = '\0';
-				opts = buf;
-			}
-			break;
-		case 2: {
-			ssize_t linklen = 0;
-#ifndef _WIN32
-			int saved_errno = errno;
-			const char *linkname =
-#  ifdef JEMALLOC_PREFIX
-			    "/etc/"JEMALLOC_PREFIX"malloc.conf"
-#  else
-			    "/etc/malloc.conf"
-#  endif
-			    ;
-
-			/*
-			 * Try to use the contents of the "/etc/malloc.conf"
-			 * symbolic link's name.
-			 */
-			linklen = readlink(linkname, buf, sizeof(buf) - 1);
-			if (linklen == -1) {
-				/* No configuration specified. */
-				linklen = 0;
-				/* Restore errno. */
-				set_errno(saved_errno);
-			}
-#endif
-			buf[linklen] = '\0';
-			opts = buf;
-			break;
-		} case 3: {
-			const char *envname =
-#ifdef JEMALLOC_PREFIX
-			    JEMALLOC_CPREFIX"MALLOC_CONF"
-#else
-			    "MALLOC_CONF"
-#endif
-			    ;
-
-			if ((opts = jemalloc_secure_getenv(envname)) != NULL) {
-				/*
-				 * Do nothing; opts is already initialized to
-				 * the value of the MALLOC_CONF environment
-				 * variable.
-				 */
-			} else {
-				/* No configuration specified. */
-				buf[0] = '\0';
-				opts = buf;
-			}
-			break;
-		} default:
-			not_reached();
-			buf[0] = '\0';
-			opts = buf;
-		}
-
-		while (*opts != '\0' && !malloc_conf_next(&opts, &k, &klen, &v,
-		    &vlen)) {
-#define CONF_MATCH(n)							\
-	(sizeof(n)-1 == klen && strncmp(n, k, klen) == 0)
-#define CONF_MATCH_VALUE(n)						\
-	(sizeof(n)-1 == vlen && strncmp(n, v, vlen) == 0)
-#define CONF_HANDLE_BOOL(o, n)						\
-			if (CONF_MATCH(n)) {				\
-				if (CONF_MATCH_VALUE("true")) {		\
-					o = true;			\
-				} else if (CONF_MATCH_VALUE("false")) {	\
-					o = false;			\
-				} else {				\
-					malloc_conf_error(		\
-					    "Invalid conf value",	\
-					    k, klen, v, vlen);		\
-				}					\
-				continue;				\
-			}
-#define CONF_MIN_no(um, min)	false
-#define CONF_MIN_yes(um, min)	((um) < (min))
-#define CONF_MAX_no(um, max)	false
-#define CONF_MAX_yes(um, max)	((um) > (max))
-#define CONF_HANDLE_T_U(t, o, n, min, max, check_min, check_max, clip)	\
-			if (CONF_MATCH(n)) {				\
-				uintmax_t um;				\
-				char *end;				\
-									\
-				set_errno(0);				\
-				um = malloc_strtoumax(v, &end, 0);	\
-				if (get_errno() != 0 || (uintptr_t)end -\
-				    (uintptr_t)v != vlen) {		\
-					malloc_conf_error(		\
-					    "Invalid conf value",	\
-					    k, klen, v, vlen);		\
-				} else if (clip) {			\
-					if (CONF_MIN_##check_min(um,	\
-					    (t)(min))) {		\
-						o = (t)(min);		\
-					} else if (			\
-					    CONF_MAX_##check_max(um,	\
-					    (t)(max))) {		\
-						o = (t)(max);		\
-					} else {			\
-						o = (t)um;		\
-					}				\
-				} else {				\
-					if (CONF_MIN_##check_min(um,	\
-					    (t)(min)) ||		\
-					    CONF_MAX_##check_max(um,	\
-					    (t)(max))) {		\
-						malloc_conf_error(	\
-						    "Out-of-range "	\
-						    "conf value",	\
-						    k, klen, v, vlen);	\
-					} else {			\
-						o = (t)um;		\
-					}				\
-				}					\
-				continue;				\
-			}
-#define CONF_HANDLE_UNSIGNED(o, n, min, max, check_min, check_max,	\
-    clip)								\
-			CONF_HANDLE_T_U(unsigned, o, n, min, max,	\
-			    check_min, check_max, clip)
-#define CONF_HANDLE_SIZE_T(o, n, min, max, check_min, check_max, clip)	\
-			CONF_HANDLE_T_U(size_t, o, n, min, max,		\
-			    check_min, check_max, clip)
-#define CONF_HANDLE_SSIZE_T(o, n, min, max)				\
-			if (CONF_MATCH(n)) {				\
-				long l;					\
-				char *end;				\
-									\
-				set_errno(0);				\
-				l = strtol(v, &end, 0);			\
-				if (get_errno() != 0 || (uintptr_t)end -\
-				    (uintptr_t)v != vlen) {		\
-					malloc_conf_error(		\
-					    "Invalid conf value",	\
-					    k, klen, v, vlen);		\
-				} else if (l < (ssize_t)(min) || l >	\
-				    (ssize_t)(max)) {			\
-					malloc_conf_error(		\
-					    "Out-of-range conf value",	\
-					    k, klen, v, vlen);		\
-				} else {				\
-					o = l;				\
-				}					\
-				continue;				\
-			}
-#define CONF_HANDLE_CHAR_P(o, n, d)					\
-			if (CONF_MATCH(n)) {				\
-				size_t cpylen = (vlen <=		\
-				    sizeof(o)-1) ? vlen :		\
-				    sizeof(o)-1;			\
-				strncpy(o, v, cpylen);			\
-				o[cpylen] = '\0';			\
-				continue;				\
-			}
-
-			CONF_HANDLE_BOOL(opt_abort, "abort")
-			CONF_HANDLE_BOOL(opt_abort_conf, "abort_conf")
-			if (strncmp("metadata_thp", k, klen) == 0) {
-				int i;
-				bool match = false;
-				for (i = 0; i < metadata_thp_mode_limit; i++) {
-					if (strncmp(metadata_thp_mode_names[i],
-					    v, vlen) == 0) {
-						opt_metadata_thp = i;
-						match = true;
-						break;
-					}
-				}
-				if (!match) {
-					malloc_conf_error("Invalid conf value",
-					    k, klen, v, vlen);
-				}
-				continue;
-			}
-			CONF_HANDLE_BOOL(opt_retain, "retain")
-			if (strncmp("dss", k, klen) == 0) {
-				int i;
-				bool match = false;
-				for (i = 0; i < dss_prec_limit; i++) {
-					if (strncmp(dss_prec_names[i], v, vlen)
-					    == 0) {
-						if (extent_dss_prec_set(i)) {
-							malloc_conf_error(
-							    "Error setting dss",
-							    k, klen, v, vlen);
-						} else {
-							opt_dss =
-							    dss_prec_names[i];
-							match = true;
-							break;
-						}
-					}
-				}
-				if (!match) {
-					malloc_conf_error("Invalid conf value",
-					    k, klen, v, vlen);
-				}
-				continue;
-			}
-			CONF_HANDLE_UNSIGNED(opt_narenas, "narenas", 1,
-			    UINT_MAX, yes, no, false)
-			CONF_HANDLE_SSIZE_T(opt_dirty_decay_ms,
-			    "dirty_decay_ms", -1, NSTIME_SEC_MAX * KQU(1000) <
-			    QU(SSIZE_MAX) ? NSTIME_SEC_MAX * KQU(1000) :
-			    SSIZE_MAX);
-			CONF_HANDLE_SSIZE_T(opt_muzzy_decay_ms,
-			    "muzzy_decay_ms", -1, NSTIME_SEC_MAX * KQU(1000) <
-			    QU(SSIZE_MAX) ? NSTIME_SEC_MAX * KQU(1000) :
-			    SSIZE_MAX);
-			CONF_HANDLE_BOOL(opt_stats_print, "stats_print")
-			if (CONF_MATCH("stats_print_opts")) {
-				init_opt_stats_print_opts(v, vlen);
-				continue;
-			}
-			if (config_fill) {
-				if (CONF_MATCH("junk")) {
-					if (CONF_MATCH_VALUE("true")) {
-						opt_junk = "true";
-						opt_junk_alloc = opt_junk_free =
-						    true;
-					} else if (CONF_MATCH_VALUE("false")) {
-						opt_junk = "false";
-						opt_junk_alloc = opt_junk_free =
-						    false;
-					} else if (CONF_MATCH_VALUE("alloc")) {
-						opt_junk = "alloc";
-						opt_junk_alloc = true;
-						opt_junk_free = false;
-					} else if (CONF_MATCH_VALUE("free")) {
-						opt_junk = "free";
-						opt_junk_alloc = false;
-						opt_junk_free = true;
-					} else {
-						malloc_conf_error(
-						    "Invalid conf value", k,
-						    klen, v, vlen);
-					}
-					continue;
-				}
-				CONF_HANDLE_BOOL(opt_zero, "zero")
-			}
-			if (config_utrace) {
-				CONF_HANDLE_BOOL(opt_utrace, "utrace")
-			}
-			if (config_xmalloc) {
-				CONF_HANDLE_BOOL(opt_xmalloc, "xmalloc")
-			}
-			CONF_HANDLE_BOOL(opt_tcache, "tcache")
-			CONF_HANDLE_SIZE_T(opt_lg_extent_max_active_fit,
-			    "lg_extent_max_active_fit", 0,
-			    (sizeof(size_t) << 3), yes, yes, false)
-			CONF_HANDLE_SSIZE_T(opt_lg_tcache_max, "lg_tcache_max",
-			    -1, (sizeof(size_t) << 3) - 1)
-			if (strncmp("percpu_arena", k, klen) == 0) {
-				bool match = false;
-				for (int i = percpu_arena_mode_names_base; i <
-				    percpu_arena_mode_names_limit; i++) {
-					if (strncmp(percpu_arena_mode_names[i],
-					    v, vlen) == 0) {
-						if (!have_percpu_arena) {
-							malloc_conf_error(
-							    "No getcpu support",
-							    k, klen, v, vlen);
-						}
-						opt_percpu_arena = i;
-						match = true;
-						break;
-					}
-				}
-				if (!match) {
-					malloc_conf_error("Invalid conf value",
-					    k, klen, v, vlen);
-				}
-				continue;
-			}
-			CONF_HANDLE_BOOL(opt_background_thread,
-			    "background_thread");
-			CONF_HANDLE_SIZE_T(opt_max_background_threads,
-					   "max_background_threads", 1,
-					   opt_max_background_threads, yes, yes,
-					   true);
-			if (config_prof) {
-				CONF_HANDLE_BOOL(opt_prof, "prof")
-				CONF_HANDLE_CHAR_P(opt_prof_prefix,
-				    "prof_prefix", "jeprof")
-				CONF_HANDLE_BOOL(opt_prof_active, "prof_active")
-				CONF_HANDLE_BOOL(opt_prof_thread_active_init,
-				    "prof_thread_active_init")
-				CONF_HANDLE_SIZE_T(opt_lg_prof_sample,
-				    "lg_prof_sample", 0, (sizeof(uint64_t) << 3)
-				    - 1, no, yes, true)
-				CONF_HANDLE_BOOL(opt_prof_accum, "prof_accum")
-				CONF_HANDLE_SSIZE_T(opt_lg_prof_interval,
-				    "lg_prof_interval", -1,
-				    (sizeof(uint64_t) << 3) - 1)
-				CONF_HANDLE_BOOL(opt_prof_gdump, "prof_gdump")
-				CONF_HANDLE_BOOL(opt_prof_final, "prof_final")
-				CONF_HANDLE_BOOL(opt_prof_leak, "prof_leak")
-			}
-			if (config_log) {
-				if (CONF_MATCH("log")) {
-					size_t cpylen = (
-					    vlen <= sizeof(log_var_names) ?
-					    vlen : sizeof(log_var_names) - 1);
-					strncpy(log_var_names, v, cpylen);
-					log_var_names[cpylen] = '\0';
-					continue;
-				}
-			}
-			if (CONF_MATCH("thp")) {
-				bool match = false;
-				for (int i = 0; i < thp_mode_names_limit; i++) {
-					if (strncmp(thp_mode_names[i],v, vlen)
-					    == 0) {
-						if (!have_madvise_huge) {
-							malloc_conf_error(
-							    "No THP support",
-							    k, klen, v, vlen);
-						}
-						opt_thp = i;
-						match = true;
-						break;
-					}
-				}
-				if (!match) {
-					malloc_conf_error("Invalid conf value",
-					    k, klen, v, vlen);
-				}
-				continue;
-			}
-			malloc_conf_error("Invalid conf pair", k, klen, v,
-			    vlen);
-#undef CONF_MATCH
-#undef CONF_MATCH_VALUE
-#undef CONF_HANDLE_BOOL
-#undef CONF_MIN_no
-#undef CONF_MIN_yes
-#undef CONF_MAX_no
-#undef CONF_MAX_yes
-#undef CONF_HANDLE_T_U
-#undef CONF_HANDLE_UNSIGNED
-#undef CONF_HANDLE_SIZE_T
-#undef CONF_HANDLE_SSIZE_T
-#undef CONF_HANDLE_CHAR_P
-		}
-		if (opt_abort_conf && had_conf_error) {
-			malloc_abort_invalid_conf();
-		}
-	}
-	atomic_store_b(&log_init_done, true, ATOMIC_RELEASE);
-}
-
-static bool
-malloc_init_hard_needed(void) {
-	if (malloc_initialized() || (IS_INITIALIZER && malloc_init_state ==
-	    malloc_init_recursible)) {
-		/*
-		 * Another thread initialized the allocator before this one
-		 * acquired init_lock, or this thread is the initializing
-		 * thread, and it is recursively allocating.
-		 */
-		return false;
-	}
-#ifdef JEMALLOC_THREADED_INIT
-	if (malloc_initializer != NO_INITIALIZER && !IS_INITIALIZER) {
-		/* Busy-wait until the initializing thread completes. */
-		spin_t spinner = SPIN_INITIALIZER;
-		do {
-			malloc_mutex_unlock(TSDN_NULL, &init_lock);
-			spin_adaptive(&spinner);
-			malloc_mutex_lock(TSDN_NULL, &init_lock);
-		} while (!malloc_initialized());
-		return false;
-	}
-#endif
-	return true;
-}
-
-static bool
-malloc_init_hard_a0_locked() {
-	malloc_initializer = INITIALIZER;
-
-	if (config_prof) {
-		prof_boot0();
-	}
-	malloc_conf_init();
-	if (opt_stats_print) {
-		/* Print statistics at exit. */
-		if (atexit(stats_print_atexit) != 0) {
-			malloc_write("<jemalloc>: Error in atexit()\n");
-			if (opt_abort) {
-				abort();
-			}
-		}
-	}
-	if (pages_boot()) {
-		return true;
-	}
-	if (base_boot(TSDN_NULL)) {
-		return true;
-	}
-	if (extent_boot()) {
-		return true;
-	}
-	if (ctl_boot()) {
-		return true;
-	}
-	if (config_prof) {
-		prof_boot1();
-	}
-	arena_boot();
-	if (tcache_boot(TSDN_NULL)) {
-		return true;
-	}
-	if (malloc_mutex_init(&arenas_lock, "arenas", WITNESS_RANK_ARENAS,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-	/*
-	 * Create enough scaffolding to allow recursive allocation in
-	 * malloc_ncpus().
-	 */
-	narenas_auto = 1;
-	memset(arenas, 0, sizeof(arena_t *) * narenas_auto);
-	/*
-	 * Initialize one arena here.  The rest are lazily created in
-	 * arena_choose_hard().
-	 */
-	if (arena_init(TSDN_NULL, 0, (extent_hooks_t *)&extent_hooks_default)
-	    == NULL) {
-		return true;
-	}
-	a0 = arena_get(TSDN_NULL, 0, false);
-	malloc_init_state = malloc_init_a0_initialized;
-
-	return false;
-}
-
-static bool
-malloc_init_hard_a0(void) {
-	bool ret;
-
-	malloc_mutex_lock(TSDN_NULL, &init_lock);
-	ret = malloc_init_hard_a0_locked();
-	malloc_mutex_unlock(TSDN_NULL, &init_lock);
-	return ret;
-}
-
-/* Initialize data structures which may trigger recursive allocation. */
-static bool
-malloc_init_hard_recursible(void) {
-	malloc_init_state = malloc_init_recursible;
-
-	ncpus = malloc_ncpus();
-
-#if (defined(JEMALLOC_HAVE_PTHREAD_ATFORK) && !defined(JEMALLOC_MUTEX_INIT_CB) \
-    && !defined(JEMALLOC_ZONE) && !defined(_WIN32) && \
-    !defined(__native_client__))
-	/* LinuxThreads' pthread_atfork() allocates. */
-	if (pthread_atfork(jemalloc_prefork, jemalloc_postfork_parent,
-	    jemalloc_postfork_child) != 0) {
-		malloc_write("<jemalloc>: Error in pthread_atfork()\n");
-		if (opt_abort) {
-			abort();
-		}
-		return true;
-	}
-#endif
-
-	if (background_thread_boot0()) {
-		return true;
-	}
-
-	return false;
-}
-
-static unsigned
-malloc_narenas_default(void) {
-	assert(ncpus > 0);
-	/*
-	 * For SMP systems, create more than one arena per CPU by
-	 * default.
-	 */
-	if (ncpus > 1) {
-		return ncpus << 2;
-	} else {
-		return 1;
-	}
-}
-
-static percpu_arena_mode_t
-percpu_arena_as_initialized(percpu_arena_mode_t mode) {
-	assert(!malloc_initialized());
-	assert(mode <= percpu_arena_disabled);
-
-	if (mode != percpu_arena_disabled) {
-		mode += percpu_arena_mode_enabled_base;
-	}
-
-	return mode;
-}
-
-static bool
-malloc_init_narenas(void) {
-	assert(ncpus > 0);
-
-	if (opt_percpu_arena != percpu_arena_disabled) {
-		if (!have_percpu_arena || malloc_getcpu() < 0) {
-			opt_percpu_arena = percpu_arena_disabled;
-			malloc_printf("<jemalloc>: perCPU arena getcpu() not "
-			    "available. Setting narenas to %u.\n", opt_narenas ?
-			    opt_narenas : malloc_narenas_default());
-			if (opt_abort) {
-				abort();
-			}
-		} else {
-			if (ncpus >= MALLOCX_ARENA_LIMIT) {
-				malloc_printf("<jemalloc>: narenas w/ percpu"
-				    "arena beyond limit (%d)\n", ncpus);
-				if (opt_abort) {
-					abort();
-				}
-				return true;
-			}
-			/* NB: opt_percpu_arena isn't fully initialized yet. */
-			if (percpu_arena_as_initialized(opt_percpu_arena) ==
-			    per_phycpu_arena && ncpus % 2 != 0) {
-				malloc_printf("<jemalloc>: invalid "
-				    "configuration -- per physical CPU arena "
-				    "with odd number (%u) of CPUs (no hyper "
-				    "threading?).\n", ncpus);
-				if (opt_abort)
-					abort();
-			}
-			unsigned n = percpu_arena_ind_limit(
-			    percpu_arena_as_initialized(opt_percpu_arena));
-			if (opt_narenas < n) {
-				/*
-				 * If narenas is specified with percpu_arena
-				 * enabled, actual narenas is set as the greater
-				 * of the two. percpu_arena_choose will be free
-				 * to use any of the arenas based on CPU
-				 * id. This is conservative (at a small cost)
-				 * but ensures correctness.
-				 *
-				 * If for some reason the ncpus determined at
-				 * boot is not the actual number (e.g. because
-				 * of affinity setting from numactl), reserving
-				 * narenas this way provides a workaround for
-				 * percpu_arena.
-				 */
-				opt_narenas = n;
-			}
-		}
-	}
-	if (opt_narenas == 0) {
-		opt_narenas = malloc_narenas_default();
-	}
-	assert(opt_narenas > 0);
-
-	narenas_auto = opt_narenas;
-	/*
-	 * Limit the number of arenas to the indexing range of MALLOCX_ARENA().
-	 */
-	if (narenas_auto >= MALLOCX_ARENA_LIMIT) {
-		narenas_auto = MALLOCX_ARENA_LIMIT - 1;
-		malloc_printf("<jemalloc>: Reducing narenas to limit (%d)\n",
-		    narenas_auto);
-	}
-	narenas_total_set(narenas_auto);
-
-	return false;
-}
-
-static void
-malloc_init_percpu(void) {
-	opt_percpu_arena = percpu_arena_as_initialized(opt_percpu_arena);
-}
-
-static bool
-malloc_init_hard_finish(void) {
-	if (malloc_mutex_boot()) {
-		return true;
-	}
-
-	malloc_init_state = malloc_init_initialized;
-	malloc_slow_flag_init();
-
-	return false;
-}
-
-static void
-malloc_init_hard_cleanup(tsdn_t *tsdn, bool reentrancy_set) {
-	malloc_mutex_assert_owner(tsdn, &init_lock);
-	malloc_mutex_unlock(tsdn, &init_lock);
-	if (reentrancy_set) {
-		assert(!tsdn_null(tsdn));
-		tsd_t *tsd = tsdn_tsd(tsdn);
-		assert(tsd_reentrancy_level_get(tsd) > 0);
-		post_reentrancy(tsd);
-	}
-}
-
-static bool
-malloc_init_hard(void) {
-	tsd_t *tsd;
-
-#if defined(_WIN32) && _WIN32_WINNT < 0x0600
-	_init_init_lock();
-#endif
-	malloc_mutex_lock(TSDN_NULL, &init_lock);
-
-#define UNLOCK_RETURN(tsdn, ret, reentrancy)		\
-	malloc_init_hard_cleanup(tsdn, reentrancy);	\
-	return ret;
-
-	if (!malloc_init_hard_needed()) {
-		UNLOCK_RETURN(TSDN_NULL, false, false)
-	}
-
-	if (malloc_init_state != malloc_init_a0_initialized &&
-	    malloc_init_hard_a0_locked()) {
-		UNLOCK_RETURN(TSDN_NULL, true, false)
-	}
-
-	malloc_mutex_unlock(TSDN_NULL, &init_lock);
-	/* Recursive allocation relies on functional tsd. */
-	tsd = malloc_tsd_boot0();
-	if (tsd == NULL) {
-		return true;
-	}
-	if (malloc_init_hard_recursible()) {
-		return true;
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &init_lock);
-	/* Set reentrancy level to 1 during init. */
-	pre_reentrancy(tsd, NULL);
-	/* Initialize narenas before prof_boot2 (for allocation). */
-	if (malloc_init_narenas() || background_thread_boot1(tsd_tsdn(tsd))) {
-		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
-	}
-	if (config_prof && prof_boot2(tsd)) {
-		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
-	}
-
-	malloc_init_percpu();
-
-	if (malloc_init_hard_finish()) {
-		UNLOCK_RETURN(tsd_tsdn(tsd), true, true)
-	}
-	post_reentrancy(tsd);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &init_lock);
-
-	witness_assert_lockless(witness_tsd_tsdn(
-	    tsd_witness_tsdp_get_unsafe(tsd)));
-	malloc_tsd_boot1();
-	/* Update TSD after tsd_boot1. */
-	tsd = tsd_fetch();
-	if (opt_background_thread) {
-		assert(have_background_thread);
-		/*
-		 * Need to finish init & unlock first before creating background
-		 * threads (pthread_create depends on malloc).  ctl_init (which
-		 * sets isthreaded) needs to be called without holding any lock.
-		 */
-		background_thread_ctl_init(tsd_tsdn(tsd));
-
-		malloc_mutex_lock(tsd_tsdn(tsd), &background_thread_lock);
-		bool err = background_thread_create(tsd, 0);
-		malloc_mutex_unlock(tsd_tsdn(tsd), &background_thread_lock);
-		if (err) {
-			return true;
-		}
-	}
-#undef UNLOCK_RETURN
-	return false;
-}
-
-/*
- * End initialization functions.
- */
-/******************************************************************************/
-/*
- * Begin allocation-path internal functions and data structures.
- */
-
-/*
- * Settings determined by the documented behavior of the allocation functions.
- */
-typedef struct static_opts_s static_opts_t;
-struct static_opts_s {
-	/* Whether or not allocation size may overflow. */
-	bool may_overflow;
-	/* Whether or not allocations of size 0 should be treated as size 1. */
-	bool bump_empty_alloc;
-	/*
-	 * Whether to assert that allocations are not of size 0 (after any
-	 * bumping).
-	 */
-	bool assert_nonempty_alloc;
-
-	/*
-	 * Whether or not to modify the 'result' argument to malloc in case of
-	 * error.
-	 */
-	bool null_out_result_on_error;
-	/* Whether to set errno when we encounter an error condition. */
-	bool set_errno_on_error;
-
-	/*
-	 * The minimum valid alignment for functions requesting aligned storage.
-	 */
-	size_t min_alignment;
-
-	/* The error string to use if we oom. */
-	const char *oom_string;
-	/* The error string to use if the passed-in alignment is invalid. */
-	const char *invalid_alignment_string;
-
-	/*
-	 * False if we're configured to skip some time-consuming operations.
-	 *
-	 * This isn't really a malloc "behavior", but it acts as a useful
-	 * summary of several other static (or at least, static after program
-	 * initialization) options.
-	 */
-	bool slow;
-};
-
-JEMALLOC_ALWAYS_INLINE void
-static_opts_init(static_opts_t *static_opts) {
-	static_opts->may_overflow = false;
-	static_opts->bump_empty_alloc = false;
-	static_opts->assert_nonempty_alloc = false;
-	static_opts->null_out_result_on_error = false;
-	static_opts->set_errno_on_error = false;
-	static_opts->min_alignment = 0;
-	static_opts->oom_string = "";
-	static_opts->invalid_alignment_string = "";
-	static_opts->slow = false;
-}
-
-/*
- * These correspond to the macros in jemalloc/jemalloc_macros.h.  Broadly, we
- * should have one constant here per magic value there.  Note however that the
- * representations need not be related.
- */
-#define TCACHE_IND_NONE ((unsigned)-1)
-#define TCACHE_IND_AUTOMATIC ((unsigned)-2)
-#define ARENA_IND_AUTOMATIC ((unsigned)-1)
-
-typedef struct dynamic_opts_s dynamic_opts_t;
-struct dynamic_opts_s {
-	void **result;
-	size_t num_items;
-	size_t item_size;
-	size_t alignment;
-	bool zero;
-	unsigned tcache_ind;
-	unsigned arena_ind;
-};
-
-JEMALLOC_ALWAYS_INLINE void
-dynamic_opts_init(dynamic_opts_t *dynamic_opts) {
-	dynamic_opts->result = NULL;
-	dynamic_opts->num_items = 0;
-	dynamic_opts->item_size = 0;
-	dynamic_opts->alignment = 0;
-	dynamic_opts->zero = false;
-	dynamic_opts->tcache_ind = TCACHE_IND_AUTOMATIC;
-	dynamic_opts->arena_ind = ARENA_IND_AUTOMATIC;
-}
-
-/* ind is ignored if dopts->alignment > 0. */
-JEMALLOC_ALWAYS_INLINE void *
-imalloc_no_sample(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd,
-    size_t size, size_t usize, szind_t ind) {
-	tcache_t *tcache;
-	arena_t *arena;
-
-	/* Fill in the tcache. */
-	if (dopts->tcache_ind == TCACHE_IND_AUTOMATIC) {
-		if (likely(!sopts->slow)) {
-			/* Getting tcache ptr unconditionally. */
-			tcache = tsd_tcachep_get(tsd);
-			assert(tcache == tcache_get(tsd));
-		} else {
-			tcache = tcache_get(tsd);
-		}
-	} else if (dopts->tcache_ind == TCACHE_IND_NONE) {
-		tcache = NULL;
-	} else {
-		tcache = tcaches_get(tsd, dopts->tcache_ind);
-	}
-
-	/* Fill in the arena. */
-	if (dopts->arena_ind == ARENA_IND_AUTOMATIC) {
-		/*
-		 * In case of automatic arena management, we defer arena
-		 * computation until as late as we can, hoping to fill the
-		 * allocation out of the tcache.
-		 */
-		arena = NULL;
-	} else {
-		arena = arena_get(tsd_tsdn(tsd), dopts->arena_ind, true);
-	}
-
-	if (unlikely(dopts->alignment != 0)) {
-		return ipalloct(tsd_tsdn(tsd), usize, dopts->alignment,
-		    dopts->zero, tcache, arena);
-	}
-
-	return iallocztm(tsd_tsdn(tsd), size, ind, dopts->zero, tcache, false,
-	    arena, sopts->slow);
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-imalloc_sample(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd,
-    size_t usize, szind_t ind) {
-	void *ret;
-
-	/*
-	 * For small allocations, sampling bumps the usize.  If so, we allocate
-	 * from the ind_large bucket.
-	 */
-	szind_t ind_large;
-	size_t bumped_usize = usize;
-
-	if (usize <= SMALL_MAXCLASS) {
-		assert(((dopts->alignment == 0) ? sz_s2u(LARGE_MINCLASS) :
-		    sz_sa2u(LARGE_MINCLASS, dopts->alignment))
-		    == LARGE_MINCLASS);
-		ind_large = sz_size2index(LARGE_MINCLASS);
-		bumped_usize = sz_s2u(LARGE_MINCLASS);
-		ret = imalloc_no_sample(sopts, dopts, tsd, bumped_usize,
-		    bumped_usize, ind_large);
-		if (unlikely(ret == NULL)) {
-			return NULL;
-		}
-		arena_prof_promote(tsd_tsdn(tsd), ret, usize);
-	} else {
-		ret = imalloc_no_sample(sopts, dopts, tsd, usize, usize, ind);
-	}
-
-	return ret;
-}
-
-/*
- * Returns true if the allocation will overflow, and false otherwise.  Sets
- * *size to the product either way.
- */
-JEMALLOC_ALWAYS_INLINE bool
-compute_size_with_overflow(bool may_overflow, dynamic_opts_t *dopts,
-    size_t *size) {
-	/*
-	 * This function is just num_items * item_size, except that we may have
-	 * to check for overflow.
-	 */
-
-	if (!may_overflow) {
-		assert(dopts->num_items == 1);
-		*size = dopts->item_size;
-		return false;
-	}
-
-	/* A size_t with its high-half bits all set to 1. */
-	static const size_t high_bits = SIZE_T_MAX << (sizeof(size_t) * 8 / 2);
-
-	*size = dopts->item_size * dopts->num_items;
-
-	if (unlikely(*size == 0)) {
-		return (dopts->num_items != 0 && dopts->item_size != 0);
-	}
-
-	/*
-	 * We got a non-zero size, but we don't know if we overflowed to get
-	 * there.  To avoid having to do a divide, we'll be clever and note that
-	 * if both A and B can be represented in N/2 bits, then their product
-	 * can be represented in N bits (without the possibility of overflow).
-	 */
-	if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
-		return false;
-	}
-	if (likely(*size / dopts->item_size == dopts->num_items)) {
-		return false;
-	}
-	return true;
-}
-
-JEMALLOC_ALWAYS_INLINE int
-imalloc_body(static_opts_t *sopts, dynamic_opts_t *dopts, tsd_t *tsd) {
-	/* Where the actual allocated memory will live. */
-	void *allocation = NULL;
-	/* Filled in by compute_size_with_overflow below. */
-	size_t size = 0;
-	/*
-	 * For unaligned allocations, we need only ind.  For aligned
-	 * allocations, or in case of stats or profiling we need usize.
-	 *
-	 * These are actually dead stores, in that their values are reset before
-	 * any branch on their value is taken.  Sometimes though, it's
-	 * convenient to pass them as arguments before this point.  To avoid
-	 * undefined behavior then, we initialize them with dummy stores.
-	 */
-	szind_t ind = 0;
-	size_t usize = 0;
-
-	/* Reentrancy is only checked on slow path. */
-	int8_t reentrancy_level;
-
-	/* Compute the amount of memory the user wants. */
-	if (unlikely(compute_size_with_overflow(sopts->may_overflow, dopts,
-	    &size))) {
-		goto label_oom;
-	}
-
-	/* Validate the user input. */
-	if (sopts->bump_empty_alloc) {
-		if (unlikely(size == 0)) {
-			size = 1;
-		}
-	}
-
-	if (sopts->assert_nonempty_alloc) {
-		assert (size != 0);
-	}
-
-	if (unlikely(dopts->alignment < sopts->min_alignment
-	    || (dopts->alignment & (dopts->alignment - 1)) != 0)) {
-		goto label_invalid_alignment;
-	}
-
-	/* This is the beginning of the "core" algorithm. */
-
-	if (dopts->alignment == 0) {
-		ind = sz_size2index(size);
-		if (unlikely(ind >= NSIZES)) {
-			goto label_oom;
-		}
-		if (config_stats || (config_prof && opt_prof)) {
-			usize = sz_index2size(ind);
-			assert(usize > 0 && usize <= LARGE_MAXCLASS);
-		}
-	} else {
-		usize = sz_sa2u(size, dopts->alignment);
-		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-			goto label_oom;
-		}
-	}
-
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	/*
-	 * If we need to handle reentrancy, we can do it out of a
-	 * known-initialized arena (i.e. arena 0).
-	 */
-	reentrancy_level = tsd_reentrancy_level_get(tsd);
-	if (sopts->slow && unlikely(reentrancy_level > 0)) {
-		/*
-		 * We should never specify particular arenas or tcaches from
-		 * within our internal allocations.
-		 */
-		assert(dopts->tcache_ind == TCACHE_IND_AUTOMATIC ||
-		    dopts->tcache_ind == TCACHE_IND_NONE);
-		assert(dopts->arena_ind == ARENA_IND_AUTOMATIC);
-		dopts->tcache_ind = TCACHE_IND_NONE;
-		/* We know that arena 0 has already been initialized. */
-		dopts->arena_ind = 0;
-	}
-
-	/* If profiling is on, get our profiling context. */
-	if (config_prof && opt_prof) {
-		/*
-		 * Note that if we're going down this path, usize must have been
-		 * initialized in the previous if statement.
-		 */
-		prof_tctx_t *tctx = prof_alloc_prep(
-		    tsd, usize, prof_active_get_unlocked(), true);
-
-		alloc_ctx_t alloc_ctx;
-		if (likely((uintptr_t)tctx == (uintptr_t)1U)) {
-			alloc_ctx.slab = (usize <= SMALL_MAXCLASS);
-			allocation = imalloc_no_sample(
-			    sopts, dopts, tsd, usize, usize, ind);
-		} else if ((uintptr_t)tctx > (uintptr_t)1U) {
-			/*
-			 * Note that ind might still be 0 here.  This is fine;
-			 * imalloc_sample ignores ind if dopts->alignment > 0.
-			 */
-			allocation = imalloc_sample(
-			    sopts, dopts, tsd, usize, ind);
-			alloc_ctx.slab = false;
-		} else {
-			allocation = NULL;
-		}
-
-		if (unlikely(allocation == NULL)) {
-			prof_alloc_rollback(tsd, tctx, true);
-			goto label_oom;
-		}
-		prof_malloc(tsd_tsdn(tsd), allocation, usize, &alloc_ctx, tctx);
-	} else {
-		/*
-		 * If dopts->alignment > 0, then ind is still 0, but usize was
-		 * computed in the previous if statement.  Down the positive
-		 * alignment path, imalloc_no_sample ignores ind and size
-		 * (relying only on usize).
-		 */
-		allocation = imalloc_no_sample(sopts, dopts, tsd, size, usize,
-		    ind);
-		if (unlikely(allocation == NULL)) {
-			goto label_oom;
-		}
-	}
-
-	/*
-	 * Allocation has been done at this point.  We still have some
-	 * post-allocation work to do though.
-	 */
-	assert(dopts->alignment == 0
-	    || ((uintptr_t)allocation & (dopts->alignment - 1)) == ZU(0));
-
-	if (config_stats) {
-		assert(usize == isalloc(tsd_tsdn(tsd), allocation));
-		*tsd_thread_allocatedp_get(tsd) += usize;
-	}
-
-	if (sopts->slow) {
-		UTRACE(0, size, allocation);
-	}
-
-	/* Success! */
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	*dopts->result = allocation;
-	return 0;
-
-label_oom:
-	if (unlikely(sopts->slow) && config_xmalloc && unlikely(opt_xmalloc)) {
-		malloc_write(sopts->oom_string);
-		abort();
-	}
-
-	if (sopts->slow) {
-		UTRACE(NULL, size, NULL);
-	}
-
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	if (sopts->set_errno_on_error) {
-		set_errno(ENOMEM);
-	}
-
-	if (sopts->null_out_result_on_error) {
-		*dopts->result = NULL;
-	}
-
-	return ENOMEM;
-
-	/*
-	 * This label is only jumped to by one goto; we move it out of line
-	 * anyways to avoid obscuring the non-error paths, and for symmetry with
-	 * the oom case.
-	 */
-label_invalid_alignment:
-	if (config_xmalloc && unlikely(opt_xmalloc)) {
-		malloc_write(sopts->invalid_alignment_string);
-		abort();
-	}
-
-	if (sopts->set_errno_on_error) {
-		set_errno(EINVAL);
-	}
-
-	if (sopts->slow) {
-		UTRACE(NULL, size, NULL);
-	}
-
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	if (sopts->null_out_result_on_error) {
-		*dopts->result = NULL;
-	}
-
-	return EINVAL;
-}
-
-/* Returns the errno-style error code of the allocation. */
-JEMALLOC_ALWAYS_INLINE int
-imalloc(static_opts_t *sopts, dynamic_opts_t *dopts) {
-	if (unlikely(!malloc_initialized()) && unlikely(malloc_init())) {
-		if (config_xmalloc && unlikely(opt_xmalloc)) {
-			malloc_write(sopts->oom_string);
-			abort();
-		}
-		UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
-		set_errno(ENOMEM);
-		*dopts->result = NULL;
-
-		return ENOMEM;
-	}
-
-	/* We always need the tsd.  Let's grab it right away. */
-	tsd_t *tsd = tsd_fetch();
-	assert(tsd);
-	if (likely(tsd_fast(tsd))) {
-		/* Fast and common path. */
-		tsd_assert_fast(tsd);
-		sopts->slow = false;
-		return imalloc_body(sopts, dopts, tsd);
-	} else {
-		sopts->slow = true;
-		return imalloc_body(sopts, dopts, tsd);
-	}
-}
-/******************************************************************************/
-/*
- * Begin malloc(3)-compatible functions.
- */
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1)
-je_malloc(size_t size) {
-	void *ret;
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.malloc.entry", "size: %zu", size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.bump_empty_alloc = true;
-	sopts.null_out_result_on_error = true;
-	sopts.set_errno_on_error = true;
-	sopts.oom_string = "<jemalloc>: Error in malloc(): out of memory\n";
-
-	dopts.result = &ret;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.malloc.exit", "result: %p", ret);
-
-	return ret;
-}
-
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW
-JEMALLOC_ATTR(nonnull(1))
-je_posix_memalign(void **memptr, size_t alignment, size_t size) {
-	int ret;
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.posix_memalign.entry", "mem ptr: %p, alignment: %zu, "
-	    "size: %zu", memptr, alignment, size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.bump_empty_alloc = true;
-	sopts.min_alignment = sizeof(void *);
-	sopts.oom_string =
-	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
-	sopts.invalid_alignment_string =
-	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
-
-	dopts.result = memptr;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-	dopts.alignment = alignment;
-
-	ret = imalloc(&sopts, &dopts);
-
-	LOG("core.posix_memalign.exit", "result: %d, alloc ptr: %p", ret,
-	    *memptr);
-
-	return ret;
-}
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(2)
-je_aligned_alloc(size_t alignment, size_t size) {
-	void *ret;
-
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.aligned_alloc.entry", "alignment: %zu, size: %zu\n",
-	    alignment, size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.bump_empty_alloc = true;
-	sopts.null_out_result_on_error = true;
-	sopts.set_errno_on_error = true;
-	sopts.min_alignment = 1;
-	sopts.oom_string =
-	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
-	sopts.invalid_alignment_string =
-	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
-
-	dopts.result = &ret;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-	dopts.alignment = alignment;
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.aligned_alloc.exit", "result: %p", ret);
-
-	return ret;
-}
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE2(1, 2)
-je_calloc(size_t num, size_t size) {
-	void *ret;
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.calloc.entry", "num: %zu, size: %zu\n", num, size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.may_overflow = true;
-	sopts.bump_empty_alloc = true;
-	sopts.null_out_result_on_error = true;
-	sopts.set_errno_on_error = true;
-	sopts.oom_string = "<jemalloc>: Error in calloc(): out of memory\n";
-
-	dopts.result = &ret;
-	dopts.num_items = num;
-	dopts.item_size = size;
-	dopts.zero = true;
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.calloc.exit", "result: %p", ret);
-
-	return ret;
-}
-
-static void *
-irealloc_prof_sample(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t usize,
-    prof_tctx_t *tctx) {
-	void *p;
-
-	if (tctx == NULL) {
-		return NULL;
-	}
-	if (usize <= SMALL_MAXCLASS) {
-		p = iralloc(tsd, old_ptr, old_usize, LARGE_MINCLASS, 0, false);
-		if (p == NULL) {
-			return NULL;
-		}
-		arena_prof_promote(tsd_tsdn(tsd), p, usize);
-	} else {
-		p = iralloc(tsd, old_ptr, old_usize, usize, 0, false);
-	}
-
-	return p;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-irealloc_prof(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t usize,
-   alloc_ctx_t *alloc_ctx) {
-	void *p;
-	bool prof_active;
-	prof_tctx_t *old_tctx, *tctx;
-
-	prof_active = prof_active_get_unlocked();
-	old_tctx = prof_tctx_get(tsd_tsdn(tsd), old_ptr, alloc_ctx);
-	tctx = prof_alloc_prep(tsd, usize, prof_active, true);
-	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
-		p = irealloc_prof_sample(tsd, old_ptr, old_usize, usize, tctx);
-	} else {
-		p = iralloc(tsd, old_ptr, old_usize, usize, 0, false);
-	}
-	if (unlikely(p == NULL)) {
-		prof_alloc_rollback(tsd, tctx, true);
-		return NULL;
-	}
-	prof_realloc(tsd, p, usize, tctx, prof_active, true, old_ptr, old_usize,
-	    old_tctx);
-
-	return p;
-}
-
-JEMALLOC_ALWAYS_INLINE void
-ifree(tsd_t *tsd, void *ptr, tcache_t *tcache, bool slow_path) {
-	if (!slow_path) {
-		tsd_assert_fast(tsd);
-	}
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	if (tsd_reentrancy_level_get(tsd) != 0) {
-		assert(slow_path);
-	}
-
-	assert(ptr != NULL);
-	assert(malloc_initialized() || IS_INITIALIZER);
-
-	alloc_ctx_t alloc_ctx;
-	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-	assert(alloc_ctx.szind != NSIZES);
-
-	size_t usize;
-	if (config_prof && opt_prof) {
-		usize = sz_index2size(alloc_ctx.szind);
-		prof_free(tsd, ptr, usize, &alloc_ctx);
-	} else if (config_stats) {
-		usize = sz_index2size(alloc_ctx.szind);
-	}
-	if (config_stats) {
-		*tsd_thread_deallocatedp_get(tsd) += usize;
-	}
-
-	if (likely(!slow_path)) {
-		idalloctm(tsd_tsdn(tsd), ptr, tcache, &alloc_ctx, false,
-		    false);
-	} else {
-		idalloctm(tsd_tsdn(tsd), ptr, tcache, &alloc_ctx, false,
-		    true);
-	}
-}
-
-JEMALLOC_ALWAYS_INLINE void
-isfree(tsd_t *tsd, void *ptr, size_t usize, tcache_t *tcache, bool slow_path) {
-	if (!slow_path) {
-		tsd_assert_fast(tsd);
-	}
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	if (tsd_reentrancy_level_get(tsd) != 0) {
-		assert(slow_path);
-	}
-
-	assert(ptr != NULL);
-	assert(malloc_initialized() || IS_INITIALIZER);
-
-	alloc_ctx_t alloc_ctx, *ctx;
-	if (!config_cache_oblivious && ((uintptr_t)ptr & PAGE_MASK) != 0) {
-		/*
-		 * When cache_oblivious is disabled and ptr is not page aligned,
-		 * the allocation was not sampled -- usize can be used to
-		 * determine szind directly.
-		 */
-		alloc_ctx.szind = sz_size2index(usize);
-		alloc_ctx.slab = true;
-		ctx = &alloc_ctx;
-		if (config_debug) {
-			alloc_ctx_t dbg_ctx;
-			rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-			rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree,
-			    rtree_ctx, (uintptr_t)ptr, true, &dbg_ctx.szind,
-			    &dbg_ctx.slab);
-			assert(dbg_ctx.szind == alloc_ctx.szind);
-			assert(dbg_ctx.slab == alloc_ctx.slab);
-		}
-	} else if (config_prof && opt_prof) {
-		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-		assert(alloc_ctx.szind == sz_size2index(usize));
-		ctx = &alloc_ctx;
-	} else {
-		ctx = NULL;
-	}
-
-	if (config_prof && opt_prof) {
-		prof_free(tsd, ptr, usize, ctx);
-	}
-	if (config_stats) {
-		*tsd_thread_deallocatedp_get(tsd) += usize;
-	}
-
-	if (likely(!slow_path)) {
-		isdalloct(tsd_tsdn(tsd), ptr, usize, tcache, ctx, false);
-	} else {
-		isdalloct(tsd_tsdn(tsd), ptr, usize, tcache, ctx, true);
-	}
-}
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ALLOC_SIZE(2)
-je_realloc(void *ptr, size_t size) {
-	void *ret;
-	tsdn_t *tsdn JEMALLOC_CC_SILENCE_INIT(NULL);
-	size_t usize JEMALLOC_CC_SILENCE_INIT(0);
-	size_t old_usize = 0;
-
-	LOG("core.realloc.entry", "ptr: %p, size: %zu\n", ptr, size);
-
-	if (unlikely(size == 0)) {
-		if (ptr != NULL) {
-			/* realloc(ptr, 0) is equivalent to free(ptr). */
-			UTRACE(ptr, 0, 0);
-			tcache_t *tcache;
-			tsd_t *tsd = tsd_fetch();
-			if (tsd_reentrancy_level_get(tsd) == 0) {
-				tcache = tcache_get(tsd);
-			} else {
-				tcache = NULL;
-			}
-			ifree(tsd, ptr, tcache, true);
-
-			LOG("core.realloc.exit", "result: %p", NULL);
-			return NULL;
-		}
-		size = 1;
-	}
-
-	if (likely(ptr != NULL)) {
-		assert(malloc_initialized() || IS_INITIALIZER);
-		tsd_t *tsd = tsd_fetch();
-
-		check_entry_exit_locking(tsd_tsdn(tsd));
-
-		alloc_ctx_t alloc_ctx;
-		rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-		rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-		    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-		assert(alloc_ctx.szind != NSIZES);
-		old_usize = sz_index2size(alloc_ctx.szind);
-		assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
-		if (config_prof && opt_prof) {
-			usize = sz_s2u(size);
-			ret = unlikely(usize == 0 || usize > LARGE_MAXCLASS) ?
-			    NULL : irealloc_prof(tsd, ptr, old_usize, usize,
-			    &alloc_ctx);
-		} else {
-			if (config_stats) {
-				usize = sz_s2u(size);
-			}
-			ret = iralloc(tsd, ptr, old_usize, size, 0, false);
-		}
-		tsdn = tsd_tsdn(tsd);
-	} else {
-		/* realloc(NULL, size) is equivalent to malloc(size). */
-		void *ret = je_malloc(size);
-		LOG("core.realloc.exit", "result: %p", ret);
-		return ret;
-	}
-
-	if (unlikely(ret == NULL)) {
-		if (config_xmalloc && unlikely(opt_xmalloc)) {
-			malloc_write("<jemalloc>: Error in realloc(): "
-			    "out of memory\n");
-			abort();
-		}
-		set_errno(ENOMEM);
-	}
-	if (config_stats && likely(ret != NULL)) {
-		tsd_t *tsd;
-
-		assert(usize == isalloc(tsdn, ret));
-		tsd = tsdn_tsd(tsdn);
-		*tsd_thread_allocatedp_get(tsd) += usize;
-		*tsd_thread_deallocatedp_get(tsd) += old_usize;
-	}
-	UTRACE(ptr, size, ret);
-	check_entry_exit_locking(tsdn);
-
-	LOG("core.realloc.exit", "result: %p", ret);
-	return ret;
-}
-
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW
-je_free(void *ptr) {
-	LOG("core.free.entry", "ptr: %p", ptr);
-
-	UTRACE(ptr, 0, 0);
-	if (likely(ptr != NULL)) {
-		/*
-		 * We avoid setting up tsd fully (e.g. tcache, arena binding)
-		 * based on only free() calls -- other activities trigger the
-		 * minimal to full transition.  This is because free() may
-		 * happen during thread shutdown after tls deallocation: if a
-		 * thread never had any malloc activities until then, a
-		 * fully-setup tsd won't be destructed properly.
-		 */
-		tsd_t *tsd = tsd_fetch_min();
-		check_entry_exit_locking(tsd_tsdn(tsd));
-
-		tcache_t *tcache;
-		if (likely(tsd_fast(tsd))) {
-			tsd_assert_fast(tsd);
-			/* Unconditionally get tcache ptr on fast path. */
-			tcache = tsd_tcachep_get(tsd);
-			ifree(tsd, ptr, tcache, false);
-		} else {
-			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
-				tcache = tcache_get(tsd);
-			} else {
-				tcache = NULL;
-			}
-			ifree(tsd, ptr, tcache, true);
-		}
-		check_entry_exit_locking(tsd_tsdn(tsd));
-	}
-	LOG("core.free.exit", "");
-}
-
-/*
- * End malloc(3)-compatible functions.
- */
-/******************************************************************************/
-/*
- * Begin non-standard override functions.
- */
-
-#ifdef JEMALLOC_OVERRIDE_MEMALIGN
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc)
-je_memalign(size_t alignment, size_t size) {
-	void *ret;
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.memalign.entry", "alignment: %zu, size: %zu\n", alignment,
-	    size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.bump_empty_alloc = true;
-	sopts.min_alignment = 1;
-	sopts.oom_string =
-	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
-	sopts.invalid_alignment_string =
-	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
-	sopts.null_out_result_on_error = true;
-
-	dopts.result = &ret;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-	dopts.alignment = alignment;
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.memalign.exit", "result: %p", ret);
-	return ret;
-}
-#endif
-
-#ifdef JEMALLOC_OVERRIDE_VALLOC
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc)
-je_valloc(size_t size) {
-	void *ret;
-
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.valloc.entry", "size: %zu\n", size);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.bump_empty_alloc = true;
-	sopts.null_out_result_on_error = true;
-	sopts.min_alignment = PAGE;
-	sopts.oom_string =
-	    "<jemalloc>: Error allocating aligned memory: out of memory\n";
-	sopts.invalid_alignment_string =
-	    "<jemalloc>: Error allocating aligned memory: invalid alignment\n";
-
-	dopts.result = &ret;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-	dopts.alignment = PAGE;
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.valloc.exit", "result: %p\n", ret);
-	return ret;
-}
-#endif
-
-#if defined(JEMALLOC_IS_MALLOC) && defined(JEMALLOC_GLIBC_MALLOC_HOOK)
-/*
- * glibc provides the RTLD_DEEPBIND flag for dlopen which can make it possible
- * to inconsistently reference libc's malloc(3)-compatible functions
- * (https://bugzilla.mozilla.org/show_bug.cgi?id=493541).
- *
- * These definitions interpose hooks in glibc.  The functions are actually
- * passed an extra argument for the caller return address, which will be
- * ignored.
- */
-JEMALLOC_EXPORT void (*__free_hook)(void *ptr) = je_free;
-JEMALLOC_EXPORT void *(*__malloc_hook)(size_t size) = je_malloc;
-JEMALLOC_EXPORT void *(*__realloc_hook)(void *ptr, size_t size) = je_realloc;
-#  ifdef JEMALLOC_GLIBC_MEMALIGN_HOOK
-JEMALLOC_EXPORT void *(*__memalign_hook)(size_t alignment, size_t size) =
-    je_memalign;
-#  endif
-
-#  ifdef CPU_COUNT
-/*
- * To enable static linking with glibc, the libc specific malloc interface must
- * be implemented also, so none of glibc's malloc.o functions are added to the
- * link.
- */
-#    define ALIAS(je_fn)	__attribute__((alias (#je_fn), used))
-/* To force macro expansion of je_ prefix before stringification. */
-#    define PREALIAS(je_fn)	ALIAS(je_fn)
-#    ifdef JEMALLOC_OVERRIDE___LIBC_CALLOC
-void *__libc_calloc(size_t n, size_t size) PREALIAS(je_calloc);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___LIBC_FREE
-void __libc_free(void* ptr) PREALIAS(je_free);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___LIBC_MALLOC
-void *__libc_malloc(size_t size) PREALIAS(je_malloc);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___LIBC_MEMALIGN
-void *__libc_memalign(size_t align, size_t s) PREALIAS(je_memalign);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___LIBC_REALLOC
-void *__libc_realloc(void* ptr, size_t size) PREALIAS(je_realloc);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___LIBC_VALLOC
-void *__libc_valloc(size_t size) PREALIAS(je_valloc);
-#    endif
-#    ifdef JEMALLOC_OVERRIDE___POSIX_MEMALIGN
-int __posix_memalign(void** r, size_t a, size_t s) PREALIAS(je_posix_memalign);
-#    endif
-#    undef PREALIAS
-#    undef ALIAS
-#  endif
-#endif
-
-/*
- * End non-standard override functions.
- */
-/******************************************************************************/
-/*
- * Begin non-standard functions.
- */
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ATTR(malloc) JEMALLOC_ALLOC_SIZE(1)
-je_mallocx(size_t size, int flags) {
-	void *ret;
-	static_opts_t sopts;
-	dynamic_opts_t dopts;
-
-	LOG("core.mallocx.entry", "size: %zu, flags: %d", size, flags);
-
-	static_opts_init(&sopts);
-	dynamic_opts_init(&dopts);
-
-	sopts.assert_nonempty_alloc = true;
-	sopts.null_out_result_on_error = true;
-	sopts.oom_string = "<jemalloc>: Error in mallocx(): out of memory\n";
-
-	dopts.result = &ret;
-	dopts.num_items = 1;
-	dopts.item_size = size;
-	if (unlikely(flags != 0)) {
-		if ((flags & MALLOCX_LG_ALIGN_MASK) != 0) {
-			dopts.alignment = MALLOCX_ALIGN_GET_SPECIFIED(flags);
-		}
-
-		dopts.zero = MALLOCX_ZERO_GET(flags);
-
-		if ((flags & MALLOCX_TCACHE_MASK) != 0) {
-			if ((flags & MALLOCX_TCACHE_MASK)
-			    == MALLOCX_TCACHE_NONE) {
-				dopts.tcache_ind = TCACHE_IND_NONE;
-			} else {
-				dopts.tcache_ind = MALLOCX_TCACHE_GET(flags);
-			}
-		} else {
-			dopts.tcache_ind = TCACHE_IND_AUTOMATIC;
-		}
-
-		if ((flags & MALLOCX_ARENA_MASK) != 0)
-			dopts.arena_ind = MALLOCX_ARENA_GET(flags);
-	}
-
-	imalloc(&sopts, &dopts);
-
-	LOG("core.mallocx.exit", "result: %p", ret);
-	return ret;
-}
-
-static void *
-irallocx_prof_sample(tsdn_t *tsdn, void *old_ptr, size_t old_usize,
-    size_t usize, size_t alignment, bool zero, tcache_t *tcache, arena_t *arena,
-    prof_tctx_t *tctx) {
-	void *p;
-
-	if (tctx == NULL) {
-		return NULL;
-	}
-	if (usize <= SMALL_MAXCLASS) {
-		p = iralloct(tsdn, old_ptr, old_usize, LARGE_MINCLASS,
-		    alignment, zero, tcache, arena);
-		if (p == NULL) {
-			return NULL;
-		}
-		arena_prof_promote(tsdn, p, usize);
-	} else {
-		p = iralloct(tsdn, old_ptr, old_usize, usize, alignment, zero,
-		    tcache, arena);
-	}
-
-	return p;
-}
-
-JEMALLOC_ALWAYS_INLINE void *
-irallocx_prof(tsd_t *tsd, void *old_ptr, size_t old_usize, size_t size,
-    size_t alignment, size_t *usize, bool zero, tcache_t *tcache,
-    arena_t *arena, alloc_ctx_t *alloc_ctx) {
-	void *p;
-	bool prof_active;
-	prof_tctx_t *old_tctx, *tctx;
-
-	prof_active = prof_active_get_unlocked();
-	old_tctx = prof_tctx_get(tsd_tsdn(tsd), old_ptr, alloc_ctx);
-	tctx = prof_alloc_prep(tsd, *usize, prof_active, false);
-	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
-		p = irallocx_prof_sample(tsd_tsdn(tsd), old_ptr, old_usize,
-		    *usize, alignment, zero, tcache, arena, tctx);
-	} else {
-		p = iralloct(tsd_tsdn(tsd), old_ptr, old_usize, size, alignment,
-		    zero, tcache, arena);
-	}
-	if (unlikely(p == NULL)) {
-		prof_alloc_rollback(tsd, tctx, false);
-		return NULL;
-	}
-
-	if (p == old_ptr && alignment != 0) {
-		/*
-		 * The allocation did not move, so it is possible that the size
-		 * class is smaller than would guarantee the requested
-		 * alignment, and that the alignment constraint was
-		 * serendipitously satisfied.  Additionally, old_usize may not
-		 * be the same as the current usize because of in-place large
-		 * reallocation.  Therefore, query the actual value of usize.
-		 */
-		*usize = isalloc(tsd_tsdn(tsd), p);
-	}
-	prof_realloc(tsd, p, *usize, tctx, prof_active, false, old_ptr,
-	    old_usize, old_tctx);
-
-	return p;
-}
-
-JEMALLOC_EXPORT JEMALLOC_ALLOCATOR JEMALLOC_RESTRICT_RETURN
-void JEMALLOC_NOTHROW *
-JEMALLOC_ALLOC_SIZE(2)
-je_rallocx(void *ptr, size_t size, int flags) {
-	void *p;
-	tsd_t *tsd;
-	size_t usize;
-	size_t old_usize;
-	size_t alignment = MALLOCX_ALIGN_GET(flags);
-	bool zero = flags & MALLOCX_ZERO;
-	arena_t *arena;
-	tcache_t *tcache;
-
-	LOG("core.rallocx.entry", "ptr: %p, size: %zu, flags: %d", ptr,
-	    size, flags);
-
-
-	assert(ptr != NULL);
-	assert(size != 0);
-	assert(malloc_initialized() || IS_INITIALIZER);
-	tsd = tsd_fetch();
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	if (unlikely((flags & MALLOCX_ARENA_MASK) != 0)) {
-		unsigned arena_ind = MALLOCX_ARENA_GET(flags);
-		arena = arena_get(tsd_tsdn(tsd), arena_ind, true);
-		if (unlikely(arena == NULL)) {
-			goto label_oom;
-		}
-	} else {
-		arena = NULL;
-	}
-
-	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
-		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
-			tcache = NULL;
-		} else {
-			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
-		}
-	} else {
-		tcache = tcache_get(tsd);
-	}
-
-	alloc_ctx_t alloc_ctx;
-	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-	assert(alloc_ctx.szind != NSIZES);
-	old_usize = sz_index2size(alloc_ctx.szind);
-	assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
-	if (config_prof && opt_prof) {
-		usize = (alignment == 0) ?
-		    sz_s2u(size) : sz_sa2u(size, alignment);
-		if (unlikely(usize == 0 || usize > LARGE_MAXCLASS)) {
-			goto label_oom;
-		}
-		p = irallocx_prof(tsd, ptr, old_usize, size, alignment, &usize,
-		    zero, tcache, arena, &alloc_ctx);
-		if (unlikely(p == NULL)) {
-			goto label_oom;
-		}
-	} else {
-		p = iralloct(tsd_tsdn(tsd), ptr, old_usize, size, alignment,
-		    zero, tcache, arena);
-		if (unlikely(p == NULL)) {
-			goto label_oom;
-		}
-		if (config_stats) {
-			usize = isalloc(tsd_tsdn(tsd), p);
-		}
-	}
-	assert(alignment == 0 || ((uintptr_t)p & (alignment - 1)) == ZU(0));
-
-	if (config_stats) {
-		*tsd_thread_allocatedp_get(tsd) += usize;
-		*tsd_thread_deallocatedp_get(tsd) += old_usize;
-	}
-	UTRACE(ptr, size, p);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.rallocx.exit", "result: %p", p);
-	return p;
-label_oom:
-	if (config_xmalloc && unlikely(opt_xmalloc)) {
-		malloc_write("<jemalloc>: Error in rallocx(): out of memory\n");
-		abort();
-	}
-	UTRACE(ptr, size, 0);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.rallocx.exit", "result: %p", NULL);
-	return NULL;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-ixallocx_helper(tsdn_t *tsdn, void *ptr, size_t old_usize, size_t size,
-    size_t extra, size_t alignment, bool zero) {
-	size_t usize;
-
-	if (ixalloc(tsdn, ptr, old_usize, size, extra, alignment, zero)) {
-		return old_usize;
-	}
-	usize = isalloc(tsdn, ptr);
-
-	return usize;
-}
-
-static size_t
-ixallocx_prof_sample(tsdn_t *tsdn, void *ptr, size_t old_usize, size_t size,
-    size_t extra, size_t alignment, bool zero, prof_tctx_t *tctx) {
-	size_t usize;
-
-	if (tctx == NULL) {
-		return old_usize;
-	}
-	usize = ixallocx_helper(tsdn, ptr, old_usize, size, extra, alignment,
-	    zero);
-
-	return usize;
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-ixallocx_prof(tsd_t *tsd, void *ptr, size_t old_usize, size_t size,
-    size_t extra, size_t alignment, bool zero, alloc_ctx_t *alloc_ctx) {
-	size_t usize_max, usize;
-	bool prof_active;
-	prof_tctx_t *old_tctx, *tctx;
-
-	prof_active = prof_active_get_unlocked();
-	old_tctx = prof_tctx_get(tsd_tsdn(tsd), ptr, alloc_ctx);
-	/*
-	 * usize isn't knowable before ixalloc() returns when extra is non-zero.
-	 * Therefore, compute its maximum possible value and use that in
-	 * prof_alloc_prep() to decide whether to capture a backtrace.
-	 * prof_realloc() will use the actual usize to decide whether to sample.
-	 */
-	if (alignment == 0) {
-		usize_max = sz_s2u(size+extra);
-		assert(usize_max > 0 && usize_max <= LARGE_MAXCLASS);
-	} else {
-		usize_max = sz_sa2u(size+extra, alignment);
-		if (unlikely(usize_max == 0 || usize_max > LARGE_MAXCLASS)) {
-			/*
-			 * usize_max is out of range, and chances are that
-			 * allocation will fail, but use the maximum possible
-			 * value and carry on with prof_alloc_prep(), just in
-			 * case allocation succeeds.
-			 */
-			usize_max = LARGE_MAXCLASS;
-		}
-	}
-	tctx = prof_alloc_prep(tsd, usize_max, prof_active, false);
-
-	if (unlikely((uintptr_t)tctx != (uintptr_t)1U)) {
-		usize = ixallocx_prof_sample(tsd_tsdn(tsd), ptr, old_usize,
-		    size, extra, alignment, zero, tctx);
-	} else {
-		usize = ixallocx_helper(tsd_tsdn(tsd), ptr, old_usize, size,
-		    extra, alignment, zero);
-	}
-	if (usize == old_usize) {
-		prof_alloc_rollback(tsd, tctx, false);
-		return usize;
-	}
-	prof_realloc(tsd, ptr, usize, tctx, prof_active, false, ptr, old_usize,
-	    old_tctx);
-
-	return usize;
-}
-
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
-je_xallocx(void *ptr, size_t size, size_t extra, int flags) {
-	tsd_t *tsd;
-	size_t usize, old_usize;
-	size_t alignment = MALLOCX_ALIGN_GET(flags);
-	bool zero = flags & MALLOCX_ZERO;
-
-	LOG("core.xallocx.entry", "ptr: %p, size: %zu, extra: %zu, "
-	    "flags: %d", ptr, size, extra, flags);
-
-	assert(ptr != NULL);
-	assert(size != 0);
-	assert(SIZE_T_MAX - size >= extra);
-	assert(malloc_initialized() || IS_INITIALIZER);
-	tsd = tsd_fetch();
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	alloc_ctx_t alloc_ctx;
-	rtree_ctx_t *rtree_ctx = tsd_rtree_ctx(tsd);
-	rtree_szind_slab_read(tsd_tsdn(tsd), &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, true, &alloc_ctx.szind, &alloc_ctx.slab);
-	assert(alloc_ctx.szind != NSIZES);
-	old_usize = sz_index2size(alloc_ctx.szind);
-	assert(old_usize == isalloc(tsd_tsdn(tsd), ptr));
-	/*
-	 * The API explicitly absolves itself of protecting against (size +
-	 * extra) numerical overflow, but we may need to clamp extra to avoid
-	 * exceeding LARGE_MAXCLASS.
-	 *
-	 * Ordinarily, size limit checking is handled deeper down, but here we
-	 * have to check as part of (size + extra) clamping, since we need the
-	 * clamped value in the above helper functions.
-	 */
-	if (unlikely(size > LARGE_MAXCLASS)) {
-		usize = old_usize;
-		goto label_not_resized;
-	}
-	if (unlikely(LARGE_MAXCLASS - size < extra)) {
-		extra = LARGE_MAXCLASS - size;
-	}
-
-	if (config_prof && opt_prof) {
-		usize = ixallocx_prof(tsd, ptr, old_usize, size, extra,
-		    alignment, zero, &alloc_ctx);
-	} else {
-		usize = ixallocx_helper(tsd_tsdn(tsd), ptr, old_usize, size,
-		    extra, alignment, zero);
-	}
-	if (unlikely(usize == old_usize)) {
-		goto label_not_resized;
-	}
-
-	if (config_stats) {
-		*tsd_thread_allocatedp_get(tsd) += usize;
-		*tsd_thread_deallocatedp_get(tsd) += old_usize;
-	}
-label_not_resized:
-	UTRACE(ptr, size, ptr);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.xallocx.exit", "result: %zu", usize);
-	return usize;
-}
-
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
-JEMALLOC_ATTR(pure)
-je_sallocx(const void *ptr, UNUSED int flags) {
-	size_t usize;
-	tsdn_t *tsdn;
-
-	LOG("core.sallocx.entry", "ptr: %p, flags: %d", ptr, flags);
-
-	assert(malloc_initialized() || IS_INITIALIZER);
-	assert(ptr != NULL);
-
-	tsdn = tsdn_fetch();
-	check_entry_exit_locking(tsdn);
-
-	if (config_debug || force_ivsalloc) {
-		usize = ivsalloc(tsdn, ptr);
-		assert(force_ivsalloc || usize != 0);
-	} else {
-		usize = isalloc(tsdn, ptr);
-	}
-
-	check_entry_exit_locking(tsdn);
-
-	LOG("core.sallocx.exit", "result: %zu", usize);
-	return usize;
-}
-
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW
-je_dallocx(void *ptr, int flags) {
-	LOG("core.dallocx.entry", "ptr: %p, flags: %d", ptr, flags);
-
-	assert(ptr != NULL);
-	assert(malloc_initialized() || IS_INITIALIZER);
-
-	tsd_t *tsd = tsd_fetch();
-	bool fast = tsd_fast(tsd);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	tcache_t *tcache;
-	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
-		/* Not allowed to be reentrant and specify a custom tcache. */
-		assert(tsd_reentrancy_level_get(tsd) == 0);
-		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
-			tcache = NULL;
-		} else {
-			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
-		}
-	} else {
-		if (likely(fast)) {
-			tcache = tsd_tcachep_get(tsd);
-			assert(tcache == tcache_get(tsd));
-		} else {
-			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
-				tcache = tcache_get(tsd);
-			}  else {
-				tcache = NULL;
-			}
-		}
-	}
-
-	UTRACE(ptr, 0, 0);
-	if (likely(fast)) {
-		tsd_assert_fast(tsd);
-		ifree(tsd, ptr, tcache, false);
-	} else {
-		ifree(tsd, ptr, tcache, true);
-	}
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.dallocx.exit", "");
-}
-
-JEMALLOC_ALWAYS_INLINE size_t
-inallocx(tsdn_t *tsdn, size_t size, int flags) {
-	check_entry_exit_locking(tsdn);
-
-	size_t usize;
-	if (likely((flags & MALLOCX_LG_ALIGN_MASK) == 0)) {
-		usize = sz_s2u(size);
-	} else {
-		usize = sz_sa2u(size, MALLOCX_ALIGN_GET_SPECIFIED(flags));
-	}
-	check_entry_exit_locking(tsdn);
-	return usize;
-}
-
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW
-je_sdallocx(void *ptr, size_t size, int flags) {
-	assert(ptr != NULL);
-	assert(malloc_initialized() || IS_INITIALIZER);
-
-	LOG("core.sdallocx.entry", "ptr: %p, size: %zu, flags: %d", ptr,
-	    size, flags);
-
-	tsd_t *tsd = tsd_fetch();
-	bool fast = tsd_fast(tsd);
-	size_t usize = inallocx(tsd_tsdn(tsd), size, flags);
-	assert(usize == isalloc(tsd_tsdn(tsd), ptr));
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	tcache_t *tcache;
-	if (unlikely((flags & MALLOCX_TCACHE_MASK) != 0)) {
-		/* Not allowed to be reentrant and specify a custom tcache. */
-		assert(tsd_reentrancy_level_get(tsd) == 0);
-		if ((flags & MALLOCX_TCACHE_MASK) == MALLOCX_TCACHE_NONE) {
-			tcache = NULL;
-		} else {
-			tcache = tcaches_get(tsd, MALLOCX_TCACHE_GET(flags));
-		}
-	} else {
-		if (likely(fast)) {
-			tcache = tsd_tcachep_get(tsd);
-			assert(tcache == tcache_get(tsd));
-		} else {
-			if (likely(tsd_reentrancy_level_get(tsd) == 0)) {
-				tcache = tcache_get(tsd);
-			} else {
-				tcache = NULL;
-			}
-		}
-	}
-
-	UTRACE(ptr, 0, 0);
-	if (likely(fast)) {
-		tsd_assert_fast(tsd);
-		isfree(tsd, ptr, usize, tcache, false);
-	} else {
-		isfree(tsd, ptr, usize, tcache, true);
-	}
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.sdallocx.exit", "");
-}
-
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
-JEMALLOC_ATTR(pure)
-je_nallocx(size_t size, int flags) {
-	size_t usize;
-	tsdn_t *tsdn;
-
-	assert(size != 0);
-
-	if (unlikely(malloc_init())) {
-		LOG("core.nallocx.exit", "result: %zu", ZU(0));
-		return 0;
-	}
-
-	tsdn = tsdn_fetch();
-	check_entry_exit_locking(tsdn);
-
-	usize = inallocx(tsdn, size, flags);
-	if (unlikely(usize > LARGE_MAXCLASS)) {
-		LOG("core.nallocx.exit", "result: %zu", ZU(0));
-		return 0;
-	}
-
-	check_entry_exit_locking(tsdn);
-	LOG("core.nallocx.exit", "result: %zu", usize);
-	return usize;
-}
-
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW
-je_mallctl(const char *name, void *oldp, size_t *oldlenp, void *newp,
-    size_t newlen) {
-	int ret;
-	tsd_t *tsd;
-
-	LOG("core.mallctl.entry", "name: %s", name);
-
-	if (unlikely(malloc_init())) {
-		LOG("core.mallctl.exit", "result: %d", EAGAIN);
-		return EAGAIN;
-	}
-
-	tsd = tsd_fetch();
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	ret = ctl_byname(tsd, name, oldp, oldlenp, newp, newlen);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.mallctl.exit", "result: %d", ret);
-	return ret;
-}
-
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW
-je_mallctlnametomib(const char *name, size_t *mibp, size_t *miblenp) {
-	int ret;
-
-	LOG("core.mallctlnametomib.entry", "name: %s", name);
-
-	if (unlikely(malloc_init())) {
-		LOG("core.mallctlnametomib.exit", "result: %d", EAGAIN);
-		return EAGAIN;
-	}
-
-	tsd_t *tsd = tsd_fetch();
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	ret = ctl_nametomib(tsd, name, mibp, miblenp);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-
-	LOG("core.mallctlnametomib.exit", "result: %d", ret);
-	return ret;
-}
-
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW
-je_mallctlbymib(const size_t *mib, size_t miblen, void *oldp, size_t *oldlenp,
-  void *newp, size_t newlen) {
-	int ret;
-	tsd_t *tsd;
-
-	LOG("core.mallctlbymib.entry", "");
-
-	if (unlikely(malloc_init())) {
-		LOG("core.mallctlbymib.exit", "result: %d", EAGAIN);
-		return EAGAIN;
-	}
-
-	tsd = tsd_fetch();
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	ret = ctl_bymib(tsd, mib, miblen, oldp, oldlenp, newp, newlen);
-	check_entry_exit_locking(tsd_tsdn(tsd));
-	LOG("core.mallctlbymib.exit", "result: %d", ret);
-	return ret;
-}
-
-JEMALLOC_EXPORT void JEMALLOC_NOTHROW
-je_malloc_stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *opts) {
-	tsdn_t *tsdn;
-
-	LOG("core.malloc_stats_print.entry", "");
-
-	tsdn = tsdn_fetch();
-	check_entry_exit_locking(tsdn);
-	stats_print(write_cb, cbopaque, opts);
-	check_entry_exit_locking(tsdn);
-	LOG("core.malloc_stats_print.exit", "");
-}
-
-JEMALLOC_EXPORT size_t JEMALLOC_NOTHROW
-je_malloc_usable_size(JEMALLOC_USABLE_SIZE_CONST void *ptr) {
-	size_t ret;
-	tsdn_t *tsdn;
-
-	LOG("core.malloc_usable_size.entry", "ptr: %p", ptr);
-
-	assert(malloc_initialized() || IS_INITIALIZER);
-
-	tsdn = tsdn_fetch();
-	check_entry_exit_locking(tsdn);
-
-	if (unlikely(ptr == NULL)) {
-		ret = 0;
-	} else {
-		if (config_debug || force_ivsalloc) {
-			ret = ivsalloc(tsdn, ptr);
-			assert(force_ivsalloc || ret != 0);
-		} else {
-			ret = isalloc(tsdn, ptr);
-		}
-	}
-
-	check_entry_exit_locking(tsdn);
-	LOG("core.malloc_usable_size.exit", "result: %zu", ret);
-	return ret;
-}
-
-/*
- * End non-standard functions.
- */
-/******************************************************************************/
-/*
- * The following functions are used by threading libraries for protection of
- * malloc during fork().
- */
-
-/*
- * If an application creates a thread before doing any allocation in the main
- * thread, then calls fork(2) in the main thread followed by memory allocation
- * in the child process, a race can occur that results in deadlock within the
- * child: the main thread may have forked while the created thread had
- * partially initialized the allocator.  Ordinarily jemalloc prevents
- * fork/malloc races via the following functions it registers during
- * initialization using pthread_atfork(), but of course that does no good if
- * the allocator isn't fully initialized at fork time.  The following library
- * constructor is a partial solution to this problem.  It may still be possible
- * to trigger the deadlock described above, but doing so would involve forking
- * via a library constructor that runs before jemalloc's runs.
- */
-#ifndef JEMALLOC_JET
-JEMALLOC_ATTR(constructor)
-static void
-jemalloc_constructor(void) {
-	malloc_init();
-}
-#endif
-
-#ifndef JEMALLOC_MUTEX_INIT_CB
-void
-jemalloc_prefork(void)
-#else
-JEMALLOC_EXPORT void
-_malloc_prefork(void)
-#endif
-{
-	tsd_t *tsd;
-	unsigned i, j, narenas;
-	arena_t *arena;
-
-#ifdef JEMALLOC_MUTEX_INIT_CB
-	if (!malloc_initialized()) {
-		return;
-	}
-#endif
-	assert(malloc_initialized());
-
-	tsd = tsd_fetch();
-
-	narenas = narenas_total_get();
-
-	witness_prefork(tsd_witness_tsdp_get(tsd));
-	/* Acquire all mutexes in a safe order. */
-	ctl_prefork(tsd_tsdn(tsd));
-	tcache_prefork(tsd_tsdn(tsd));
-	malloc_mutex_prefork(tsd_tsdn(tsd), &arenas_lock);
-	if (have_background_thread) {
-		background_thread_prefork0(tsd_tsdn(tsd));
-	}
-	prof_prefork0(tsd_tsdn(tsd));
-	if (have_background_thread) {
-		background_thread_prefork1(tsd_tsdn(tsd));
-	}
-	/* Break arena prefork into stages to preserve lock order. */
-	for (i = 0; i < 8; i++) {
-		for (j = 0; j < narenas; j++) {
-			if ((arena = arena_get(tsd_tsdn(tsd), j, false)) !=
-			    NULL) {
-				switch (i) {
-				case 0:
-					arena_prefork0(tsd_tsdn(tsd), arena);
-					break;
-				case 1:
-					arena_prefork1(tsd_tsdn(tsd), arena);
-					break;
-				case 2:
-					arena_prefork2(tsd_tsdn(tsd), arena);
-					break;
-				case 3:
-					arena_prefork3(tsd_tsdn(tsd), arena);
-					break;
-				case 4:
-					arena_prefork4(tsd_tsdn(tsd), arena);
-					break;
-				case 5:
-					arena_prefork5(tsd_tsdn(tsd), arena);
-					break;
-				case 6:
-					arena_prefork6(tsd_tsdn(tsd), arena);
-					break;
-				case 7:
-					arena_prefork7(tsd_tsdn(tsd), arena);
-					break;
-				default: not_reached();
-				}
-			}
-		}
-	}
-	prof_prefork1(tsd_tsdn(tsd));
-}
-
-#ifndef JEMALLOC_MUTEX_INIT_CB
-void
-jemalloc_postfork_parent(void)
-#else
-JEMALLOC_EXPORT void
-_malloc_postfork(void)
-#endif
-{
-	tsd_t *tsd;
-	unsigned i, narenas;
-
-#ifdef JEMALLOC_MUTEX_INIT_CB
-	if (!malloc_initialized()) {
-		return;
-	}
-#endif
-	assert(malloc_initialized());
-
-	tsd = tsd_fetch();
-
-	witness_postfork_parent(tsd_witness_tsdp_get(tsd));
-	/* Release all mutexes, now that fork() has completed. */
-	for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
-		arena_t *arena;
-
-		if ((arena = arena_get(tsd_tsdn(tsd), i, false)) != NULL) {
-			arena_postfork_parent(tsd_tsdn(tsd), arena);
-		}
-	}
-	prof_postfork_parent(tsd_tsdn(tsd));
-	if (have_background_thread) {
-		background_thread_postfork_parent(tsd_tsdn(tsd));
-	}
-	malloc_mutex_postfork_parent(tsd_tsdn(tsd), &arenas_lock);
-	tcache_postfork_parent(tsd_tsdn(tsd));
-	ctl_postfork_parent(tsd_tsdn(tsd));
-}
-
-void
-jemalloc_postfork_child(void) {
-	tsd_t *tsd;
-	unsigned i, narenas;
-
-	assert(malloc_initialized());
-
-	tsd = tsd_fetch();
-
-	witness_postfork_child(tsd_witness_tsdp_get(tsd));
-	/* Release all mutexes, now that fork() has completed. */
-	for (i = 0, narenas = narenas_total_get(); i < narenas; i++) {
-		arena_t *arena;
-
-		if ((arena = arena_get(tsd_tsdn(tsd), i, false)) != NULL) {
-			arena_postfork_child(tsd_tsdn(tsd), arena);
-		}
-	}
-	prof_postfork_child(tsd_tsdn(tsd));
-	if (have_background_thread) {
-		background_thread_postfork_child(tsd_tsdn(tsd));
-	}
-	malloc_mutex_postfork_child(tsd_tsdn(tsd), &arenas_lock);
-	tcache_postfork_child(tsd_tsdn(tsd));
-	ctl_postfork_child(tsd_tsdn(tsd));
-}
-
-/******************************************************************************/
-
-/* Helps the application decide if a pointer is worth re-allocating in order to reduce fragmentation.
- * returns 1 if the allocation should be moved, and 0 if the allocation be kept.
- * If the application decides to re-allocate it should use MALLOCX_TCACHE_NONE when doing so. */
-JEMALLOC_EXPORT int JEMALLOC_NOTHROW
-get_defrag_hint(void* ptr) {
-	assert(ptr != NULL);
-	return iget_defrag_hint(TSDN_NULL, ptr);
-}
diff --git a/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp b/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
deleted file mode 100644
index f0ceddae..00000000
--- a/redis-stable/deps/jemalloc/src/jemalloc_cpp.cpp
+++ /dev/null
@@ -1,141 +0,0 @@
-#include <mutex>
-#include <new>
-
-#define JEMALLOC_CPP_CPP_
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#ifdef __cplusplus
-}
-#endif
-
-// All operators in this file are exported.
-
-// Possibly alias hidden versions of malloc and sdallocx to avoid an extra plt
-// thunk?
-//
-// extern __typeof (sdallocx) sdallocx_int
-//  __attribute ((alias ("sdallocx"),
-//		visibility ("hidden")));
-//
-// ... but it needs to work with jemalloc namespaces.
-
-void	*operator new(std::size_t size);
-void	*operator new[](std::size_t size);
-void	*operator new(std::size_t size, const std::nothrow_t &) noexcept;
-void	*operator new[](std::size_t size, const std::nothrow_t &) noexcept;
-void	operator delete(void *ptr) noexcept;
-void	operator delete[](void *ptr) noexcept;
-void	operator delete(void *ptr, const std::nothrow_t &) noexcept;
-void	operator delete[](void *ptr, const std::nothrow_t &) noexcept;
-
-#if __cpp_sized_deallocation >= 201309
-/* C++14's sized-delete operators. */
-void	operator delete(void *ptr, std::size_t size) noexcept;
-void	operator delete[](void *ptr, std::size_t size) noexcept;
-#endif
-
-JEMALLOC_NOINLINE
-static void *
-handleOOM(std::size_t size, bool nothrow) {
-	void *ptr = nullptr;
-
-	while (ptr == nullptr) {
-		std::new_handler handler;
-		// GCC-4.8 and clang 4.0 do not have std::get_new_handler.
-		{
-			static std::mutex mtx;
-			std::lock_guard<std::mutex> lock(mtx);
-
-			handler = std::set_new_handler(nullptr);
-			std::set_new_handler(handler);
-		}
-		if (handler == nullptr)
-			break;
-
-		try {
-			handler();
-		} catch (const std::bad_alloc &) {
-			break;
-		}
-
-		ptr = je_malloc(size);
-	}
-
-	if (ptr == nullptr && !nothrow)
-		std::__throw_bad_alloc();
-	return ptr;
-}
-
-template <bool IsNoExcept>
-JEMALLOC_ALWAYS_INLINE
-void *
-newImpl(std::size_t size) noexcept(IsNoExcept) {
-	void *ptr = je_malloc(size);
-	if (likely(ptr != nullptr))
-		return ptr;
-
-	return handleOOM(size, IsNoExcept);
-}
-
-void *
-operator new(std::size_t size) {
-	return newImpl<false>(size);
-}
-
-void *
-operator new[](std::size_t size) {
-	return newImpl<false>(size);
-}
-
-void *
-operator new(std::size_t size, const std::nothrow_t &) noexcept {
-	return newImpl<true>(size);
-}
-
-void *
-operator new[](std::size_t size, const std::nothrow_t &) noexcept {
-	return newImpl<true>(size);
-}
-
-void
-operator delete(void *ptr) noexcept {
-	je_free(ptr);
-}
-
-void
-operator delete[](void *ptr) noexcept {
-	je_free(ptr);
-}
-
-void
-operator delete(void *ptr, const std::nothrow_t &) noexcept {
-	je_free(ptr);
-}
-
-void operator delete[](void *ptr, const std::nothrow_t &) noexcept {
-	je_free(ptr);
-}
-
-#if __cpp_sized_deallocation >= 201309
-
-void
-operator delete(void *ptr, std::size_t size) noexcept {
-	if (unlikely(ptr == nullptr)) {
-		return;
-	}
-	je_sdallocx(ptr, size, /*flags=*/0);
-}
-
-void operator delete[](void *ptr, std::size_t size) noexcept {
-	if (unlikely(ptr == nullptr)) {
-		return;
-	}
-	je_sdallocx(ptr, size, /*flags=*/0);
-}
-
-#endif  // __cpp_sized_deallocation
diff --git a/redis-stable/deps/jemalloc/src/large.c b/redis-stable/deps/jemalloc/src/large.c
deleted file mode 100644
index 27a2c679..00000000
--- a/redis-stable/deps/jemalloc/src/large.c
+++ /dev/null
@@ -1,371 +0,0 @@
-#define JEMALLOC_LARGE_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree.h"
-#include "jemalloc/internal/util.h"
-
-/******************************************************************************/
-
-void *
-large_malloc(tsdn_t *tsdn, arena_t *arena, size_t usize, bool zero) {
-	assert(usize == sz_s2u(usize));
-
-	return large_palloc(tsdn, arena, usize, CACHELINE, zero);
-}
-
-void *
-large_palloc(tsdn_t *tsdn, arena_t *arena, size_t usize, size_t alignment,
-    bool zero) {
-	size_t ausize;
-	extent_t *extent;
-	bool is_zeroed;
-	UNUSED bool idump JEMALLOC_CC_SILENCE_INIT(false);
-
-	assert(!tsdn_null(tsdn) || arena != NULL);
-
-	ausize = sz_sa2u(usize, alignment);
-	if (unlikely(ausize == 0 || ausize > LARGE_MAXCLASS)) {
-		return NULL;
-	}
-
-	if (config_fill && unlikely(opt_zero)) {
-		zero = true;
-	}
-	/*
-	 * Copy zero into is_zeroed and pass the copy when allocating the
-	 * extent, so that it is possible to make correct junk/zero fill
-	 * decisions below, even if is_zeroed ends up true when zero is false.
-	 */
-	is_zeroed = zero;
-	if (likely(!tsdn_null(tsdn))) {
-		arena = arena_choose(tsdn_tsd(tsdn), arena);
-	}
-	if (unlikely(arena == NULL) || (extent = arena_extent_alloc_large(tsdn,
-	    arena, usize, alignment, &is_zeroed)) == NULL) {
-		return NULL;
-	}
-
-	/* See comments in arena_bin_slabs_full_insert(). */
-	if (!arena_is_auto(arena)) {
-		/* Insert extent into large. */
-		malloc_mutex_lock(tsdn, &arena->large_mtx);
-		extent_list_append(&arena->large, extent);
-		malloc_mutex_unlock(tsdn, &arena->large_mtx);
-	}
-	if (config_prof && arena_prof_accum(tsdn, arena, usize)) {
-		prof_idump(tsdn);
-	}
-
-	if (zero) {
-		assert(is_zeroed);
-	} else if (config_fill && unlikely(opt_junk_alloc)) {
-		memset(extent_addr_get(extent), JEMALLOC_ALLOC_JUNK,
-		    extent_usize_get(extent));
-	}
-
-	arena_decay_tick(tsdn, arena);
-	return extent_addr_get(extent);
-}
-
-static void
-large_dalloc_junk_impl(void *ptr, size_t size) {
-	memset(ptr, JEMALLOC_FREE_JUNK, size);
-}
-large_dalloc_junk_t *JET_MUTABLE large_dalloc_junk = large_dalloc_junk_impl;
-
-static void
-large_dalloc_maybe_junk_impl(void *ptr, size_t size) {
-	if (config_fill && have_dss && unlikely(opt_junk_free)) {
-		/*
-		 * Only bother junk filling if the extent isn't about to be
-		 * unmapped.
-		 */
-		if (opt_retain || (have_dss && extent_in_dss(ptr))) {
-			large_dalloc_junk(ptr, size);
-		}
-	}
-}
-large_dalloc_maybe_junk_t *JET_MUTABLE large_dalloc_maybe_junk =
-    large_dalloc_maybe_junk_impl;
-
-static bool
-large_ralloc_no_move_shrink(tsdn_t *tsdn, extent_t *extent, size_t usize) {
-	arena_t *arena = extent_arena_get(extent);
-	size_t oldusize = extent_usize_get(extent);
-	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
-	size_t diff = extent_size_get(extent) - (usize + sz_large_pad);
-
-	assert(oldusize > usize);
-
-	if (extent_hooks->split == NULL) {
-		return true;
-	}
-
-	/* Split excess pages. */
-	if (diff != 0) {
-		extent_t *trail = extent_split_wrapper(tsdn, arena,
-		    &extent_hooks, extent, usize + sz_large_pad,
-		    sz_size2index(usize), false, diff, NSIZES, false);
-		if (trail == NULL) {
-			return true;
-		}
-
-		if (config_fill && unlikely(opt_junk_free)) {
-			large_dalloc_maybe_junk(extent_addr_get(trail),
-			    extent_size_get(trail));
-		}
-
-		arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, trail);
-	}
-
-	arena_extent_ralloc_large_shrink(tsdn, arena, extent, oldusize);
-
-	return false;
-}
-
-static bool
-large_ralloc_no_move_expand(tsdn_t *tsdn, extent_t *extent, size_t usize,
-    bool zero) {
-	arena_t *arena = extent_arena_get(extent);
-	size_t oldusize = extent_usize_get(extent);
-	extent_hooks_t *extent_hooks = extent_hooks_get(arena);
-	size_t trailsize = usize - oldusize;
-
-	if (extent_hooks->merge == NULL) {
-		return true;
-	}
-
-	if (config_fill && unlikely(opt_zero)) {
-		zero = true;
-	}
-	/*
-	 * Copy zero into is_zeroed_trail and pass the copy when allocating the
-	 * extent, so that it is possible to make correct junk/zero fill
-	 * decisions below, even if is_zeroed_trail ends up true when zero is
-	 * false.
-	 */
-	bool is_zeroed_trail = zero;
-	bool commit = true;
-	extent_t *trail;
-	bool new_mapping;
-	if ((trail = extents_alloc(tsdn, arena, &extent_hooks,
-	    &arena->extents_dirty, extent_past_get(extent), trailsize, 0,
-	    CACHELINE, false, NSIZES, &is_zeroed_trail, &commit)) != NULL
-	    || (trail = extents_alloc(tsdn, arena, &extent_hooks,
-	    &arena->extents_muzzy, extent_past_get(extent), trailsize, 0,
-	    CACHELINE, false, NSIZES, &is_zeroed_trail, &commit)) != NULL) {
-		if (config_stats) {
-			new_mapping = false;
-		}
-	} else {
-		if ((trail = extent_alloc_wrapper(tsdn, arena, &extent_hooks,
-		    extent_past_get(extent), trailsize, 0, CACHELINE, false,
-		    NSIZES, &is_zeroed_trail, &commit)) == NULL) {
-			return true;
-		}
-		if (config_stats) {
-			new_mapping = true;
-		}
-	}
-
-	if (extent_merge_wrapper(tsdn, arena, &extent_hooks, extent, trail)) {
-		extent_dalloc_wrapper(tsdn, arena, &extent_hooks, trail);
-		return true;
-	}
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-	szind_t szind = sz_size2index(usize);
-	extent_szind_set(extent, szind);
-	rtree_szind_slab_update(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)extent_addr_get(extent), szind, false);
-
-	if (config_stats && new_mapping) {
-		arena_stats_mapped_add(tsdn, &arena->stats, trailsize);
-	}
-
-	if (zero) {
-		if (config_cache_oblivious) {
-			/*
-			 * Zero the trailing bytes of the original allocation's
-			 * last page, since they are in an indeterminate state.
-			 * There will always be trailing bytes, because ptr's
-			 * offset from the beginning of the extent is a multiple
-			 * of CACHELINE in [0 .. PAGE).
-			 */
-			void *zbase = (void *)
-			    ((uintptr_t)extent_addr_get(extent) + oldusize);
-			void *zpast = PAGE_ADDR2BASE((void *)((uintptr_t)zbase +
-			    PAGE));
-			size_t nzero = (uintptr_t)zpast - (uintptr_t)zbase;
-			assert(nzero > 0);
-			memset(zbase, 0, nzero);
-		}
-		assert(is_zeroed_trail);
-	} else if (config_fill && unlikely(opt_junk_alloc)) {
-		memset((void *)((uintptr_t)extent_addr_get(extent) + oldusize),
-		    JEMALLOC_ALLOC_JUNK, usize - oldusize);
-	}
-
-	arena_extent_ralloc_large_expand(tsdn, arena, extent, oldusize);
-
-	return false;
-}
-
-bool
-large_ralloc_no_move(tsdn_t *tsdn, extent_t *extent, size_t usize_min,
-    size_t usize_max, bool zero) {
-	size_t oldusize = extent_usize_get(extent);
-
-	/* The following should have been caught by callers. */
-	assert(usize_min > 0 && usize_max <= LARGE_MAXCLASS);
-	/* Both allocation sizes must be large to avoid a move. */
-	assert(oldusize >= LARGE_MINCLASS && usize_max >= LARGE_MINCLASS);
-
-	if (usize_max > oldusize) {
-		/* Attempt to expand the allocation in-place. */
-		if (!large_ralloc_no_move_expand(tsdn, extent, usize_max,
-		    zero)) {
-			arena_decay_tick(tsdn, extent_arena_get(extent));
-			return false;
-		}
-		/* Try again, this time with usize_min. */
-		if (usize_min < usize_max && usize_min > oldusize &&
-		    large_ralloc_no_move_expand(tsdn, extent, usize_min,
-		    zero)) {
-			arena_decay_tick(tsdn, extent_arena_get(extent));
-			return false;
-		}
-	}
-
-	/*
-	 * Avoid moving the allocation if the existing extent size accommodates
-	 * the new size.
-	 */
-	if (oldusize >= usize_min && oldusize <= usize_max) {
-		arena_decay_tick(tsdn, extent_arena_get(extent));
-		return false;
-	}
-
-	/* Attempt to shrink the allocation in-place. */
-	if (oldusize > usize_max) {
-		if (!large_ralloc_no_move_shrink(tsdn, extent, usize_max)) {
-			arena_decay_tick(tsdn, extent_arena_get(extent));
-			return false;
-		}
-	}
-	return true;
-}
-
-static void *
-large_ralloc_move_helper(tsdn_t *tsdn, arena_t *arena, size_t usize,
-    size_t alignment, bool zero) {
-	if (alignment <= CACHELINE) {
-		return large_malloc(tsdn, arena, usize, zero);
-	}
-	return large_palloc(tsdn, arena, usize, alignment, zero);
-}
-
-void *
-large_ralloc(tsdn_t *tsdn, arena_t *arena, extent_t *extent, size_t usize,
-    size_t alignment, bool zero, tcache_t *tcache) {
-	size_t oldusize = extent_usize_get(extent);
-
-	/* The following should have been caught by callers. */
-	assert(usize > 0 && usize <= LARGE_MAXCLASS);
-	/* Both allocation sizes must be large to avoid a move. */
-	assert(oldusize >= LARGE_MINCLASS && usize >= LARGE_MINCLASS);
-
-	/* Try to avoid moving the allocation. */
-	if (!large_ralloc_no_move(tsdn, extent, usize, usize, zero)) {
-		return extent_addr_get(extent);
-	}
-
-	/*
-	 * usize and old size are different enough that we need to use a
-	 * different size class.  In that case, fall back to allocating new
-	 * space and copying.
-	 */
-	void *ret = large_ralloc_move_helper(tsdn, arena, usize, alignment,
-	    zero);
-	if (ret == NULL) {
-		return NULL;
-	}
-
-	size_t copysize = (usize < oldusize) ? usize : oldusize;
-	memcpy(ret, extent_addr_get(extent), copysize);
-	isdalloct(tsdn, extent_addr_get(extent), oldusize, tcache, NULL, true);
-	return ret;
-}
-
-/*
- * junked_locked indicates whether the extent's data have been junk-filled, and
- * whether the arena's large_mtx is currently held.
- */
-static void
-large_dalloc_prep_impl(tsdn_t *tsdn, arena_t *arena, extent_t *extent,
-    bool junked_locked) {
-	if (!junked_locked) {
-		/* See comments in arena_bin_slabs_full_insert(). */
-		if (!arena_is_auto(arena)) {
-			malloc_mutex_lock(tsdn, &arena->large_mtx);
-			extent_list_remove(&arena->large, extent);
-			malloc_mutex_unlock(tsdn, &arena->large_mtx);
-		}
-		large_dalloc_maybe_junk(extent_addr_get(extent),
-		    extent_usize_get(extent));
-	} else {
-		malloc_mutex_assert_owner(tsdn, &arena->large_mtx);
-		if (!arena_is_auto(arena)) {
-			extent_list_remove(&arena->large, extent);
-		}
-	}
-	arena_extent_dalloc_large_prep(tsdn, arena, extent);
-}
-
-static void
-large_dalloc_finish_impl(tsdn_t *tsdn, arena_t *arena, extent_t *extent) {
-	extent_hooks_t *extent_hooks = EXTENT_HOOKS_INITIALIZER;
-	arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, extent);
-}
-
-void
-large_dalloc_prep_junked_locked(tsdn_t *tsdn, extent_t *extent) {
-	large_dalloc_prep_impl(tsdn, extent_arena_get(extent), extent, true);
-}
-
-void
-large_dalloc_finish(tsdn_t *tsdn, extent_t *extent) {
-	large_dalloc_finish_impl(tsdn, extent_arena_get(extent), extent);
-}
-
-void
-large_dalloc(tsdn_t *tsdn, extent_t *extent) {
-	arena_t *arena = extent_arena_get(extent);
-	large_dalloc_prep_impl(tsdn, arena, extent, false);
-	large_dalloc_finish_impl(tsdn, arena, extent);
-	arena_decay_tick(tsdn, arena);
-}
-
-size_t
-large_salloc(tsdn_t *tsdn, const extent_t *extent) {
-	return extent_usize_get(extent);
-}
-
-prof_tctx_t *
-large_prof_tctx_get(tsdn_t *tsdn, const extent_t *extent) {
-	return extent_prof_tctx_get(extent);
-}
-
-void
-large_prof_tctx_set(tsdn_t *tsdn, extent_t *extent, prof_tctx_t *tctx) {
-	extent_prof_tctx_set(extent, tctx);
-}
-
-void
-large_prof_tctx_reset(tsdn_t *tsdn, extent_t *extent) {
-	large_prof_tctx_set(tsdn, extent, (prof_tctx_t *)(uintptr_t)1U);
-}
diff --git a/redis-stable/deps/jemalloc/src/log.c b/redis-stable/deps/jemalloc/src/log.c
deleted file mode 100644
index 778902fb..00000000
--- a/redis-stable/deps/jemalloc/src/log.c
+++ /dev/null
@@ -1,78 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/log.h"
-
-char log_var_names[JEMALLOC_LOG_VAR_BUFSIZE];
-atomic_b_t log_init_done = ATOMIC_INIT(false);
-
-/*
- * Returns true if we were able to pick out a segment.  Fills in r_segment_end
- * with a pointer to the first character after the end of the string.
- */
-static const char *
-log_var_extract_segment(const char* segment_begin) {
-	const char *end;
-	for (end = segment_begin; *end != '\0' && *end != '|'; end++) {
-	}
-	return end;
-}
-
-static bool
-log_var_matches_segment(const char *segment_begin, const char *segment_end,
-    const char *log_var_begin, const char *log_var_end) {
-	assert(segment_begin <= segment_end);
-	assert(log_var_begin < log_var_end);
-
-	ptrdiff_t segment_len = segment_end - segment_begin;
-	ptrdiff_t log_var_len = log_var_end - log_var_begin;
-	/* The special '.' segment matches everything. */
-	if (segment_len == 1 && *segment_begin == '.') {
-		return true;
-	}
-        if (segment_len == log_var_len) {
-		return strncmp(segment_begin, log_var_begin, segment_len) == 0;
-	} else if (segment_len < log_var_len) {
-		return strncmp(segment_begin, log_var_begin, segment_len) == 0
-		    && log_var_begin[segment_len] == '.';
-        } else {
-		return false;
-	}
-}
-
-unsigned
-log_var_update_state(log_var_t *log_var) {
-	const char *log_var_begin = log_var->name;
-	const char *log_var_end = log_var->name + strlen(log_var->name);
-
-	/* Pointer to one before the beginning of the current segment. */
-	const char *segment_begin = log_var_names;
-
-	/*
-	 * If log_init done is false, we haven't parsed the malloc conf yet.  To
-	 * avoid log-spew, we default to not displaying anything.
-	 */
-	if (!atomic_load_b(&log_init_done, ATOMIC_ACQUIRE)) {
-		return LOG_INITIALIZED_NOT_ENABLED;
-	}
-
-	while (true) {
-		const char *segment_end = log_var_extract_segment(
-		    segment_begin);
-		assert(segment_end < log_var_names + JEMALLOC_LOG_VAR_BUFSIZE);
-		if (log_var_matches_segment(segment_begin, segment_end,
-		    log_var_begin, log_var_end)) {
-			atomic_store_u(&log_var->state, LOG_ENABLED,
-			    ATOMIC_RELAXED);
-			return LOG_ENABLED;
-		}
-		if (*segment_end == '\0') {
-			/* Hit the end of the segment string with no match. */
-			atomic_store_u(&log_var->state,
-			    LOG_INITIALIZED_NOT_ENABLED, ATOMIC_RELAXED);
-			return LOG_INITIALIZED_NOT_ENABLED;
-		}
-		/* Otherwise, skip the delimiter and continue. */
-		segment_begin = segment_end + 1;
-	}
-}
diff --git a/redis-stable/deps/jemalloc/src/malloc_io.c b/redis-stable/deps/jemalloc/src/malloc_io.c
deleted file mode 100644
index dd882651..00000000
--- a/redis-stable/deps/jemalloc/src/malloc_io.c
+++ /dev/null
@@ -1,676 +0,0 @@
-#define JEMALLOC_MALLOC_IO_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/util.h"
-
-#ifdef assert
-#  undef assert
-#endif
-#ifdef not_reached
-#  undef not_reached
-#endif
-#ifdef not_implemented
-#  undef not_implemented
-#endif
-#ifdef assert_not_implemented
-#  undef assert_not_implemented
-#endif
-
-/*
- * Define simple versions of assertion macros that won't recurse in case
- * of assertion failures in malloc_*printf().
- */
-#define assert(e) do {							\
-	if (config_debug && !(e)) {					\
-		malloc_write("<jemalloc>: Failed assertion\n");		\
-		abort();						\
-	}								\
-} while (0)
-
-#define not_reached() do {						\
-	if (config_debug) {						\
-		malloc_write("<jemalloc>: Unreachable code reached\n");	\
-		abort();						\
-	}								\
-	unreachable();							\
-} while (0)
-
-#define not_implemented() do {						\
-	if (config_debug) {						\
-		malloc_write("<jemalloc>: Not implemented\n");		\
-		abort();						\
-	}								\
-} while (0)
-
-#define assert_not_implemented(e) do {					\
-	if (unlikely(config_debug && !(e))) {				\
-		not_implemented();					\
-	}								\
-} while (0)
-
-/******************************************************************************/
-/* Function prototypes for non-inline static functions. */
-
-static void wrtmessage(void *cbopaque, const char *s);
-#define U2S_BUFSIZE ((1U << (LG_SIZEOF_INTMAX_T + 3)) + 1)
-static char *u2s(uintmax_t x, unsigned base, bool uppercase, char *s,
-    size_t *slen_p);
-#define D2S_BUFSIZE (1 + U2S_BUFSIZE)
-static char *d2s(intmax_t x, char sign, char *s, size_t *slen_p);
-#define O2S_BUFSIZE (1 + U2S_BUFSIZE)
-static char *o2s(uintmax_t x, bool alt_form, char *s, size_t *slen_p);
-#define X2S_BUFSIZE (2 + U2S_BUFSIZE)
-static char *x2s(uintmax_t x, bool alt_form, bool uppercase, char *s,
-    size_t *slen_p);
-
-/******************************************************************************/
-
-/* malloc_message() setup. */
-static void
-wrtmessage(void *cbopaque, const char *s) {
-	malloc_write_fd(STDERR_FILENO, s, strlen(s));
-}
-
-JEMALLOC_EXPORT void	(*je_malloc_message)(void *, const char *s);
-
-/*
- * Wrapper around malloc_message() that avoids the need for
- * je_malloc_message(...) throughout the code.
- */
-void
-malloc_write(const char *s) {
-	if (je_malloc_message != NULL) {
-		je_malloc_message(NULL, s);
-	} else {
-		wrtmessage(NULL, s);
-	}
-}
-
-/*
- * glibc provides a non-standard strerror_r() when _GNU_SOURCE is defined, so
- * provide a wrapper.
- */
-int
-buferror(int err, char *buf, size_t buflen) {
-#ifdef _WIN32
-	FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM, NULL, err, 0,
-	    (LPSTR)buf, (DWORD)buflen, NULL);
-	return 0;
-#elif defined(JEMALLOC_STRERROR_R_RETURNS_CHAR_WITH_GNU_SOURCE) && defined(_GNU_SOURCE)
-	char *b = strerror_r(err, buf, buflen);
-	if (b != buf) {
-		strncpy(buf, b, buflen);
-		buf[buflen-1] = '\0';
-	}
-	return 0;
-#else
-	return strerror_r(err, buf, buflen);
-#endif
-}
-
-uintmax_t
-malloc_strtoumax(const char *restrict nptr, char **restrict endptr, int base) {
-	uintmax_t ret, digit;
-	unsigned b;
-	bool neg;
-	const char *p, *ns;
-
-	p = nptr;
-	if (base < 0 || base == 1 || base > 36) {
-		ns = p;
-		set_errno(EINVAL);
-		ret = UINTMAX_MAX;
-		goto label_return;
-	}
-	b = base;
-
-	/* Swallow leading whitespace and get sign, if any. */
-	neg = false;
-	while (true) {
-		switch (*p) {
-		case '\t': case '\n': case '\v': case '\f': case '\r': case ' ':
-			p++;
-			break;
-		case '-':
-			neg = true;
-			/* Fall through. */
-		case '+':
-			p++;
-			/* Fall through. */
-		default:
-			goto label_prefix;
-		}
-	}
-
-	/* Get prefix, if any. */
-	label_prefix:
-	/*
-	 * Note where the first non-whitespace/sign character is so that it is
-	 * possible to tell whether any digits are consumed (e.g., "  0" vs.
-	 * "  -x").
-	 */
-	ns = p;
-	if (*p == '0') {
-		switch (p[1]) {
-		case '0': case '1': case '2': case '3': case '4': case '5':
-		case '6': case '7':
-			if (b == 0) {
-				b = 8;
-			}
-			if (b == 8) {
-				p++;
-			}
-			break;
-		case 'X': case 'x':
-			switch (p[2]) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-			case 'A': case 'B': case 'C': case 'D': case 'E':
-			case 'F':
-			case 'a': case 'b': case 'c': case 'd': case 'e':
-			case 'f':
-				if (b == 0) {
-					b = 16;
-				}
-				if (b == 16) {
-					p += 2;
-				}
-				break;
-			default:
-				break;
-			}
-			break;
-		default:
-			p++;
-			ret = 0;
-			goto label_return;
-		}
-	}
-	if (b == 0) {
-		b = 10;
-	}
-
-	/* Convert. */
-	ret = 0;
-	while ((*p >= '0' && *p <= '9' && (digit = *p - '0') < b)
-	    || (*p >= 'A' && *p <= 'Z' && (digit = 10 + *p - 'A') < b)
-	    || (*p >= 'a' && *p <= 'z' && (digit = 10 + *p - 'a') < b)) {
-		uintmax_t pret = ret;
-		ret *= b;
-		ret += digit;
-		if (ret < pret) {
-			/* Overflow. */
-			set_errno(ERANGE);
-			ret = UINTMAX_MAX;
-			goto label_return;
-		}
-		p++;
-	}
-	if (neg) {
-		ret = (uintmax_t)(-((intmax_t)ret));
-	}
-
-	if (p == ns) {
-		/* No conversion performed. */
-		set_errno(EINVAL);
-		ret = UINTMAX_MAX;
-		goto label_return;
-	}
-
-label_return:
-	if (endptr != NULL) {
-		if (p == ns) {
-			/* No characters were converted. */
-			*endptr = (char *)nptr;
-		} else {
-			*endptr = (char *)p;
-		}
-	}
-	return ret;
-}
-
-static char *
-u2s(uintmax_t x, unsigned base, bool uppercase, char *s, size_t *slen_p) {
-	unsigned i;
-
-	i = U2S_BUFSIZE - 1;
-	s[i] = '\0';
-	switch (base) {
-	case 10:
-		do {
-			i--;
-			s[i] = "0123456789"[x % (uint64_t)10];
-			x /= (uint64_t)10;
-		} while (x > 0);
-		break;
-	case 16: {
-		const char *digits = (uppercase)
-		    ? "0123456789ABCDEF"
-		    : "0123456789abcdef";
-
-		do {
-			i--;
-			s[i] = digits[x & 0xf];
-			x >>= 4;
-		} while (x > 0);
-		break;
-	} default: {
-		const char *digits = (uppercase)
-		    ? "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
-		    : "0123456789abcdefghijklmnopqrstuvwxyz";
-
-		assert(base >= 2 && base <= 36);
-		do {
-			i--;
-			s[i] = digits[x % (uint64_t)base];
-			x /= (uint64_t)base;
-		} while (x > 0);
-	}}
-
-	*slen_p = U2S_BUFSIZE - 1 - i;
-	return &s[i];
-}
-
-static char *
-d2s(intmax_t x, char sign, char *s, size_t *slen_p) {
-	bool neg;
-
-	if ((neg = (x < 0))) {
-		x = -x;
-	}
-	s = u2s(x, 10, false, s, slen_p);
-	if (neg) {
-		sign = '-';
-	}
-	switch (sign) {
-	case '-':
-		if (!neg) {
-			break;
-		}
-		/* Fall through. */
-	case ' ':
-	case '+':
-		s--;
-		(*slen_p)++;
-		*s = sign;
-		break;
-	default: not_reached();
-	}
-	return s;
-}
-
-static char *
-o2s(uintmax_t x, bool alt_form, char *s, size_t *slen_p) {
-	s = u2s(x, 8, false, s, slen_p);
-	if (alt_form && *s != '0') {
-		s--;
-		(*slen_p)++;
-		*s = '0';
-	}
-	return s;
-}
-
-static char *
-x2s(uintmax_t x, bool alt_form, bool uppercase, char *s, size_t *slen_p) {
-	s = u2s(x, 16, uppercase, s, slen_p);
-	if (alt_form) {
-		s -= 2;
-		(*slen_p) += 2;
-		memcpy(s, uppercase ? "0X" : "0x", 2);
-	}
-	return s;
-}
-
-size_t
-malloc_vsnprintf(char *str, size_t size, const char *format, va_list ap) {
-	size_t i;
-	const char *f;
-
-#define APPEND_C(c) do {						\
-	if (i < size) {							\
-		str[i] = (c);						\
-	}								\
-	i++;								\
-} while (0)
-#define APPEND_S(s, slen) do {						\
-	if (i < size) {							\
-		size_t cpylen = (slen <= size - i) ? slen : size - i;	\
-		memcpy(&str[i], s, cpylen);				\
-	}								\
-	i += slen;							\
-} while (0)
-#define APPEND_PADDED_S(s, slen, width, left_justify) do {		\
-	/* Left padding. */						\
-	size_t pad_len = (width == -1) ? 0 : ((slen < (size_t)width) ?	\
-	    (size_t)width - slen : 0);					\
-	if (!left_justify && pad_len != 0) {				\
-		size_t j;						\
-		for (j = 0; j < pad_len; j++) {				\
-			APPEND_C(' ');					\
-		}							\
-	}								\
-	/* Value. */							\
-	APPEND_S(s, slen);						\
-	/* Right padding. */						\
-	if (left_justify && pad_len != 0) {				\
-		size_t j;						\
-		for (j = 0; j < pad_len; j++) {				\
-			APPEND_C(' ');					\
-		}							\
-	}								\
-} while (0)
-#define GET_ARG_NUMERIC(val, len) do {					\
-	switch ((unsigned char)len) {					\
-	case '?':							\
-		val = va_arg(ap, int);					\
-		break;							\
-	case '?' | 0x80:						\
-		val = va_arg(ap, unsigned int);				\
-		break;							\
-	case 'l':							\
-		val = va_arg(ap, long);					\
-		break;							\
-	case 'l' | 0x80:						\
-		val = va_arg(ap, unsigned long);			\
-		break;							\
-	case 'q':							\
-		val = va_arg(ap, long long);				\
-		break;							\
-	case 'q' | 0x80:						\
-		val = va_arg(ap, unsigned long long);			\
-		break;							\
-	case 'j':							\
-		val = va_arg(ap, intmax_t);				\
-		break;							\
-	case 'j' | 0x80:						\
-		val = va_arg(ap, uintmax_t);				\
-		break;							\
-	case 't':							\
-		val = va_arg(ap, ptrdiff_t);				\
-		break;							\
-	case 'z':							\
-		val = va_arg(ap, ssize_t);				\
-		break;							\
-	case 'z' | 0x80:						\
-		val = va_arg(ap, size_t);				\
-		break;							\
-	case 'p': /* Synthetic; used for %p. */				\
-		val = va_arg(ap, uintptr_t);				\
-		break;							\
-	default:							\
-		not_reached();						\
-		val = 0;						\
-	}								\
-} while (0)
-
-	i = 0;
-	f = format;
-	while (true) {
-		switch (*f) {
-		case '\0': goto label_out;
-		case '%': {
-			bool alt_form = false;
-			bool left_justify = false;
-			bool plus_space = false;
-			bool plus_plus = false;
-			int prec = -1;
-			int width = -1;
-			unsigned char len = '?';
-			char *s;
-			size_t slen;
-
-			f++;
-			/* Flags. */
-			while (true) {
-				switch (*f) {
-				case '#':
-					assert(!alt_form);
-					alt_form = true;
-					break;
-				case '-':
-					assert(!left_justify);
-					left_justify = true;
-					break;
-				case ' ':
-					assert(!plus_space);
-					plus_space = true;
-					break;
-				case '+':
-					assert(!plus_plus);
-					plus_plus = true;
-					break;
-				default: goto label_width;
-				}
-				f++;
-			}
-			/* Width. */
-			label_width:
-			switch (*f) {
-			case '*':
-				width = va_arg(ap, int);
-				f++;
-				if (width < 0) {
-					left_justify = true;
-					width = -width;
-				}
-				break;
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9': {
-				uintmax_t uwidth;
-				set_errno(0);
-				uwidth = malloc_strtoumax(f, (char **)&f, 10);
-				assert(uwidth != UINTMAX_MAX || get_errno() !=
-				    ERANGE);
-				width = (int)uwidth;
-				break;
-			} default:
-				break;
-			}
-			/* Width/precision separator. */
-			if (*f == '.') {
-				f++;
-			} else {
-				goto label_length;
-			}
-			/* Precision. */
-			switch (*f) {
-			case '*':
-				prec = va_arg(ap, int);
-				f++;
-				break;
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9': {
-				uintmax_t uprec;
-				set_errno(0);
-				uprec = malloc_strtoumax(f, (char **)&f, 10);
-				assert(uprec != UINTMAX_MAX || get_errno() !=
-				    ERANGE);
-				prec = (int)uprec;
-				break;
-			}
-			default: break;
-			}
-			/* Length. */
-			label_length:
-			switch (*f) {
-			case 'l':
-				f++;
-				if (*f == 'l') {
-					len = 'q';
-					f++;
-				} else {
-					len = 'l';
-				}
-				break;
-			case 'q': case 'j': case 't': case 'z':
-				len = *f;
-				f++;
-				break;
-			default: break;
-			}
-			/* Conversion specifier. */
-			switch (*f) {
-			case '%':
-				/* %% */
-				APPEND_C(*f);
-				f++;
-				break;
-			case 'd': case 'i': {
-				intmax_t val JEMALLOC_CC_SILENCE_INIT(0);
-				char buf[D2S_BUFSIZE];
-
-				GET_ARG_NUMERIC(val, len);
-				s = d2s(val, (plus_plus ? '+' : (plus_space ?
-				    ' ' : '-')), buf, &slen);
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			} case 'o': {
-				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
-				char buf[O2S_BUFSIZE];
-
-				GET_ARG_NUMERIC(val, len | 0x80);
-				s = o2s(val, alt_form, buf, &slen);
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			} case 'u': {
-				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
-				char buf[U2S_BUFSIZE];
-
-				GET_ARG_NUMERIC(val, len | 0x80);
-				s = u2s(val, 10, false, buf, &slen);
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			} case 'x': case 'X': {
-				uintmax_t val JEMALLOC_CC_SILENCE_INIT(0);
-				char buf[X2S_BUFSIZE];
-
-				GET_ARG_NUMERIC(val, len | 0x80);
-				s = x2s(val, alt_form, *f == 'X', buf, &slen);
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			} case 'c': {
-				unsigned char val;
-				char buf[2];
-
-				assert(len == '?' || len == 'l');
-				assert_not_implemented(len != 'l');
-				val = va_arg(ap, int);
-				buf[0] = val;
-				buf[1] = '\0';
-				APPEND_PADDED_S(buf, 1, width, left_justify);
-				f++;
-				break;
-			} case 's':
-				assert(len == '?' || len == 'l');
-				assert_not_implemented(len != 'l');
-				s = va_arg(ap, char *);
-				slen = (prec < 0) ? strlen(s) : (size_t)prec;
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			case 'p': {
-				uintmax_t val;
-				char buf[X2S_BUFSIZE];
-
-				GET_ARG_NUMERIC(val, 'p');
-				s = x2s(val, true, false, buf, &slen);
-				APPEND_PADDED_S(s, slen, width, left_justify);
-				f++;
-				break;
-			} default: not_reached();
-			}
-			break;
-		} default: {
-			APPEND_C(*f);
-			f++;
-			break;
-		}}
-	}
-	label_out:
-	if (i < size) {
-		str[i] = '\0';
-	} else {
-		str[size - 1] = '\0';
-	}
-
-#undef APPEND_C
-#undef APPEND_S
-#undef APPEND_PADDED_S
-#undef GET_ARG_NUMERIC
-	return i;
-}
-
-JEMALLOC_FORMAT_PRINTF(3, 4)
-size_t
-malloc_snprintf(char *str, size_t size, const char *format, ...) {
-	size_t ret;
-	va_list ap;
-
-	va_start(ap, format);
-	ret = malloc_vsnprintf(str, size, format, ap);
-	va_end(ap);
-
-	return ret;
-}
-
-void
-malloc_vcprintf(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *format, va_list ap) {
-	char buf[MALLOC_PRINTF_BUFSIZE];
-
-	if (write_cb == NULL) {
-		/*
-		 * The caller did not provide an alternate write_cb callback
-		 * function, so use the default one.  malloc_write() is an
-		 * inline function, so use malloc_message() directly here.
-		 */
-		write_cb = (je_malloc_message != NULL) ? je_malloc_message :
-		    wrtmessage;
-		cbopaque = NULL;
-	}
-
-	malloc_vsnprintf(buf, sizeof(buf), format, ap);
-	write_cb(cbopaque, buf);
-}
-
-/*
- * Print to a callback function in such a way as to (hopefully) avoid memory
- * allocation.
- */
-JEMALLOC_FORMAT_PRINTF(3, 4)
-void
-malloc_cprintf(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *format, ...) {
-	va_list ap;
-
-	va_start(ap, format);
-	malloc_vcprintf(write_cb, cbopaque, format, ap);
-	va_end(ap);
-}
-
-/* Print to stderr in such a way as to avoid memory allocation. */
-JEMALLOC_FORMAT_PRINTF(1, 2)
-void
-malloc_printf(const char *format, ...) {
-	va_list ap;
-
-	va_start(ap, format);
-	malloc_vcprintf(NULL, NULL, format, ap);
-	va_end(ap);
-}
-
-/*
- * Restore normal assertion macros, in order to make it possible to compile all
- * C files as a single concatenation.
- */
-#undef assert
-#undef not_reached
-#undef not_implemented
-#undef assert_not_implemented
-#include "jemalloc/internal/assert.h"
diff --git a/redis-stable/deps/jemalloc/src/mutex.c b/redis-stable/deps/jemalloc/src/mutex.c
deleted file mode 100644
index 30222b3e..00000000
--- a/redis-stable/deps/jemalloc/src/mutex.c
+++ /dev/null
@@ -1,224 +0,0 @@
-#define JEMALLOC_MUTEX_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/spin.h"
-
-#ifndef _CRT_SPINCOUNT
-#define _CRT_SPINCOUNT 4000
-#endif
-
-/******************************************************************************/
-/* Data. */
-
-#ifdef JEMALLOC_LAZY_LOCK
-bool isthreaded = false;
-#endif
-#ifdef JEMALLOC_MUTEX_INIT_CB
-static bool		postpone_init = true;
-static malloc_mutex_t	*postponed_mutexes = NULL;
-#endif
-
-/******************************************************************************/
-/*
- * We intercept pthread_create() calls in order to toggle isthreaded if the
- * process goes multi-threaded.
- */
-
-#if defined(JEMALLOC_LAZY_LOCK) && !defined(_WIN32)
-JEMALLOC_EXPORT int
-pthread_create(pthread_t *__restrict thread,
-    const pthread_attr_t *__restrict attr, void *(*start_routine)(void *),
-    void *__restrict arg) {
-	return pthread_create_wrapper(thread, attr, start_routine, arg);
-}
-#endif
-
-/******************************************************************************/
-
-#ifdef JEMALLOC_MUTEX_INIT_CB
-JEMALLOC_EXPORT int	_pthread_mutex_init_calloc_cb(pthread_mutex_t *mutex,
-    void *(calloc_cb)(size_t, size_t));
-#endif
-
-void
-malloc_mutex_lock_slow(malloc_mutex_t *mutex) {
-	mutex_prof_data_t *data = &mutex->prof_data;
-	UNUSED nstime_t before = NSTIME_ZERO_INITIALIZER;
-
-	if (ncpus == 1) {
-		goto label_spin_done;
-	}
-
-	int cnt = 0, max_cnt = MALLOC_MUTEX_MAX_SPIN;
-	do {
-		spin_cpu_spinwait();
-		if (!malloc_mutex_trylock_final(mutex)) {
-			data->n_spin_acquired++;
-			return;
-		}
-	} while (cnt++ < max_cnt);
-
-	if (!config_stats) {
-		/* Only spin is useful when stats is off. */
-		malloc_mutex_lock_final(mutex);
-		return;
-	}
-label_spin_done:
-	nstime_update(&before);
-	/* Copy before to after to avoid clock skews. */
-	nstime_t after;
-	nstime_copy(&after, &before);
-	uint32_t n_thds = atomic_fetch_add_u32(&data->n_waiting_thds, 1,
-	    ATOMIC_RELAXED) + 1;
-	/* One last try as above two calls may take quite some cycles. */
-	if (!malloc_mutex_trylock_final(mutex)) {
-		atomic_fetch_sub_u32(&data->n_waiting_thds, 1, ATOMIC_RELAXED);
-		data->n_spin_acquired++;
-		return;
-	}
-
-	/* True slow path. */
-	malloc_mutex_lock_final(mutex);
-	/* Update more slow-path only counters. */
-	atomic_fetch_sub_u32(&data->n_waiting_thds, 1, ATOMIC_RELAXED);
-	nstime_update(&after);
-
-	nstime_t delta;
-	nstime_copy(&delta, &after);
-	nstime_subtract(&delta, &before);
-
-	data->n_wait_times++;
-	nstime_add(&data->tot_wait_time, &delta);
-	if (nstime_compare(&data->max_wait_time, &delta) < 0) {
-		nstime_copy(&data->max_wait_time, &delta);
-	}
-	if (n_thds > data->max_n_thds) {
-		data->max_n_thds = n_thds;
-	}
-}
-
-static void
-mutex_prof_data_init(mutex_prof_data_t *data) {
-	memset(data, 0, sizeof(mutex_prof_data_t));
-	nstime_init(&data->max_wait_time, 0);
-	nstime_init(&data->tot_wait_time, 0);
-	data->prev_owner = NULL;
-}
-
-void
-malloc_mutex_prof_data_reset(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	malloc_mutex_assert_owner(tsdn, mutex);
-	mutex_prof_data_init(&mutex->prof_data);
-}
-
-static int
-mutex_addr_comp(const witness_t *witness1, void *mutex1,
-    const witness_t *witness2, void *mutex2) {
-	assert(mutex1 != NULL);
-	assert(mutex2 != NULL);
-	uintptr_t mu1int = (uintptr_t)mutex1;
-	uintptr_t mu2int = (uintptr_t)mutex2;
-	if (mu1int < mu2int) {
-		return -1;
-	} else if (mu1int == mu2int) {
-		return 0;
-	} else {
-		return 1;
-	}
-}
-
-bool
-malloc_mutex_init(malloc_mutex_t *mutex, const char *name,
-    witness_rank_t rank, malloc_mutex_lock_order_t lock_order) {
-	mutex_prof_data_init(&mutex->prof_data);
-#ifdef _WIN32
-#  if _WIN32_WINNT >= 0x0600
-	InitializeSRWLock(&mutex->lock);
-#  else
-	if (!InitializeCriticalSectionAndSpinCount(&mutex->lock,
-	    _CRT_SPINCOUNT)) {
-		return true;
-	}
-#  endif
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-	mutex->lock = OS_UNFAIR_LOCK_INIT;
-#elif (defined(JEMALLOC_OSSPIN))
-	mutex->lock = 0;
-#elif (defined(JEMALLOC_MUTEX_INIT_CB))
-	if (postpone_init) {
-		mutex->postponed_next = postponed_mutexes;
-		postponed_mutexes = mutex;
-	} else {
-		if (_pthread_mutex_init_calloc_cb(&mutex->lock,
-		    bootstrap_calloc) != 0) {
-			return true;
-		}
-	}
-#else
-	pthread_mutexattr_t attr;
-
-	if (pthread_mutexattr_init(&attr) != 0) {
-		return true;
-	}
-	pthread_mutexattr_settype(&attr, MALLOC_MUTEX_TYPE);
-	if (pthread_mutex_init(&mutex->lock, &attr) != 0) {
-		pthread_mutexattr_destroy(&attr);
-		return true;
-	}
-	pthread_mutexattr_destroy(&attr);
-#endif
-	if (config_debug) {
-		mutex->lock_order = lock_order;
-		if (lock_order == malloc_mutex_address_ordered) {
-			witness_init(&mutex->witness, name, rank,
-			    mutex_addr_comp, mutex);
-		} else {
-			witness_init(&mutex->witness, name, rank, NULL, NULL);
-		}
-	}
-	return false;
-}
-
-void
-malloc_mutex_prefork(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	malloc_mutex_lock(tsdn, mutex);
-}
-
-void
-malloc_mutex_postfork_parent(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-	malloc_mutex_unlock(tsdn, mutex);
-}
-
-void
-malloc_mutex_postfork_child(tsdn_t *tsdn, malloc_mutex_t *mutex) {
-#ifdef JEMALLOC_MUTEX_INIT_CB
-	malloc_mutex_unlock(tsdn, mutex);
-#else
-	if (malloc_mutex_init(mutex, mutex->witness.name,
-	    mutex->witness.rank, mutex->lock_order)) {
-		malloc_printf("<jemalloc>: Error re-initializing mutex in "
-		    "child\n");
-		if (opt_abort) {
-			abort();
-		}
-	}
-#endif
-}
-
-bool
-malloc_mutex_boot(void) {
-#ifdef JEMALLOC_MUTEX_INIT_CB
-	postpone_init = false;
-	while (postponed_mutexes != NULL) {
-		if (_pthread_mutex_init_calloc_cb(&postponed_mutexes->lock,
-		    bootstrap_calloc) != 0) {
-			return true;
-		}
-		postponed_mutexes = postponed_mutexes->postponed_next;
-	}
-#endif
-	return false;
-}
diff --git a/redis-stable/deps/jemalloc/src/mutex_pool.c b/redis-stable/deps/jemalloc/src/mutex_pool.c
deleted file mode 100644
index f24d10e4..00000000
--- a/redis-stable/deps/jemalloc/src/mutex_pool.c
+++ /dev/null
@@ -1,18 +0,0 @@
-#define JEMALLOC_MUTEX_POOL_C_
-
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_pool.h"
-
-bool
-mutex_pool_init(mutex_pool_t *pool, const char *name, witness_rank_t rank) {
-	for (int i = 0; i < MUTEX_POOL_SIZE; ++i) {
-		if (malloc_mutex_init(&pool->mutexes[i], name, rank,
-		    malloc_mutex_address_ordered)) {
-			return true;
-		}
-	}
-	return false;
-}
diff --git a/redis-stable/deps/jemalloc/src/nstime.c b/redis-stable/deps/jemalloc/src/nstime.c
deleted file mode 100644
index 71db3539..00000000
--- a/redis-stable/deps/jemalloc/src/nstime.c
+++ /dev/null
@@ -1,170 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/nstime.h"
-
-#include "jemalloc/internal/assert.h"
-
-#define BILLION	UINT64_C(1000000000)
-#define MILLION	UINT64_C(1000000)
-
-void
-nstime_init(nstime_t *time, uint64_t ns) {
-	time->ns = ns;
-}
-
-void
-nstime_init2(nstime_t *time, uint64_t sec, uint64_t nsec) {
-	time->ns = sec * BILLION + nsec;
-}
-
-uint64_t
-nstime_ns(const nstime_t *time) {
-	return time->ns;
-}
-
-uint64_t
-nstime_msec(const nstime_t *time) {
-	return time->ns / MILLION;
-}
-
-uint64_t
-nstime_sec(const nstime_t *time) {
-	return time->ns / BILLION;
-}
-
-uint64_t
-nstime_nsec(const nstime_t *time) {
-	return time->ns % BILLION;
-}
-
-void
-nstime_copy(nstime_t *time, const nstime_t *source) {
-	*time = *source;
-}
-
-int
-nstime_compare(const nstime_t *a, const nstime_t *b) {
-	return (a->ns > b->ns) - (a->ns < b->ns);
-}
-
-void
-nstime_add(nstime_t *time, const nstime_t *addend) {
-	assert(UINT64_MAX - time->ns >= addend->ns);
-
-	time->ns += addend->ns;
-}
-
-void
-nstime_iadd(nstime_t *time, uint64_t addend) {
-	assert(UINT64_MAX - time->ns >= addend);
-
-	time->ns += addend;
-}
-
-void
-nstime_subtract(nstime_t *time, const nstime_t *subtrahend) {
-	assert(nstime_compare(time, subtrahend) >= 0);
-
-	time->ns -= subtrahend->ns;
-}
-
-void
-nstime_isubtract(nstime_t *time, uint64_t subtrahend) {
-	assert(time->ns >= subtrahend);
-
-	time->ns -= subtrahend;
-}
-
-void
-nstime_imultiply(nstime_t *time, uint64_t multiplier) {
-	assert((((time->ns | multiplier) & (UINT64_MAX << (sizeof(uint64_t) <<
-	    2))) == 0) || ((time->ns * multiplier) / multiplier == time->ns));
-
-	time->ns *= multiplier;
-}
-
-void
-nstime_idivide(nstime_t *time, uint64_t divisor) {
-	assert(divisor != 0);
-
-	time->ns /= divisor;
-}
-
-uint64_t
-nstime_divide(const nstime_t *time, const nstime_t *divisor) {
-	assert(divisor->ns != 0);
-
-	return time->ns / divisor->ns;
-}
-
-#ifdef _WIN32
-#  define NSTIME_MONOTONIC true
-static void
-nstime_get(nstime_t *time) {
-	FILETIME ft;
-	uint64_t ticks_100ns;
-
-	GetSystemTimeAsFileTime(&ft);
-	ticks_100ns = (((uint64_t)ft.dwHighDateTime) << 32) | ft.dwLowDateTime;
-
-	nstime_init(time, ticks_100ns * 100);
-}
-#elif defined(JEMALLOC_HAVE_CLOCK_MONOTONIC_COARSE)
-#  define NSTIME_MONOTONIC true
-static void
-nstime_get(nstime_t *time) {
-	struct timespec ts;
-
-	clock_gettime(CLOCK_MONOTONIC_COARSE, &ts);
-	nstime_init2(time, ts.tv_sec, ts.tv_nsec);
-}
-#elif defined(JEMALLOC_HAVE_CLOCK_MONOTONIC)
-#  define NSTIME_MONOTONIC true
-static void
-nstime_get(nstime_t *time) {
-	struct timespec ts;
-
-	clock_gettime(CLOCK_MONOTONIC, &ts);
-	nstime_init2(time, ts.tv_sec, ts.tv_nsec);
-}
-#elif defined(JEMALLOC_HAVE_MACH_ABSOLUTE_TIME)
-#  define NSTIME_MONOTONIC true
-static void
-nstime_get(nstime_t *time) {
-	nstime_init(time, mach_absolute_time());
-}
-#else
-#  define NSTIME_MONOTONIC false
-static void
-nstime_get(nstime_t *time) {
-	struct timeval tv;
-
-	gettimeofday(&tv, NULL);
-	nstime_init2(time, tv.tv_sec, tv.tv_usec * 1000);
-}
-#endif
-
-static bool
-nstime_monotonic_impl(void) {
-	return NSTIME_MONOTONIC;
-#undef NSTIME_MONOTONIC
-}
-nstime_monotonic_t *JET_MUTABLE nstime_monotonic = nstime_monotonic_impl;
-
-static bool
-nstime_update_impl(nstime_t *time) {
-	nstime_t old_time;
-
-	nstime_copy(&old_time, time);
-	nstime_get(time);
-
-	/* Handle non-monotonic clocks. */
-	if (unlikely(nstime_compare(&old_time, time) > 0)) {
-		nstime_copy(time, &old_time);
-		return true;
-	}
-
-	return false;
-}
-nstime_update_t *JET_MUTABLE nstime_update = nstime_update_impl;
diff --git a/redis-stable/deps/jemalloc/src/pages.c b/redis-stable/deps/jemalloc/src/pages.c
deleted file mode 100644
index 26002692..00000000
--- a/redis-stable/deps/jemalloc/src/pages.c
+++ /dev/null
@@ -1,606 +0,0 @@
-#define JEMALLOC_PAGES_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-
-#include "jemalloc/internal/pages.h"
-
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/malloc_io.h"
-
-#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
-#include <sys/sysctl.h>
-#ifdef __FreeBSD__
-#include <vm/vm_param.h>
-#endif
-#endif
-
-/******************************************************************************/
-/* Data. */
-
-/* Actual operating system page size, detected during bootstrap, <= PAGE. */
-static size_t	os_page;
-
-#ifndef _WIN32
-#  define PAGES_PROT_COMMIT (PROT_READ | PROT_WRITE)
-#  define PAGES_PROT_DECOMMIT (PROT_NONE)
-static int	mmap_flags;
-#endif
-static bool	os_overcommits;
-
-const char *thp_mode_names[] = {
-	"default",
-	"always",
-	"never",
-	"not supported"
-};
-thp_mode_t opt_thp = THP_MODE_DEFAULT;
-thp_mode_t init_system_thp_mode;
-
-/* Runtime support for lazy purge. Irrelevant when !pages_can_purge_lazy. */
-static bool pages_can_purge_lazy_runtime = true;
-
-/******************************************************************************/
-/*
- * Function prototypes for static functions that are referenced prior to
- * definition.
- */
-
-static void os_pages_unmap(void *addr, size_t size);
-
-/******************************************************************************/
-
-static void *
-os_pages_map(void *addr, size_t size, size_t alignment, bool *commit) {
-	assert(ALIGNMENT_ADDR2BASE(addr, os_page) == addr);
-	assert(ALIGNMENT_CEILING(size, os_page) == size);
-	assert(size != 0);
-
-	if (os_overcommits) {
-		*commit = true;
-	}
-
-	void *ret;
-#ifdef _WIN32
-	/*
-	 * If VirtualAlloc can't allocate at the given address when one is
-	 * given, it fails and returns NULL.
-	 */
-	ret = VirtualAlloc(addr, size, MEM_RESERVE | (*commit ? MEM_COMMIT : 0),
-	    PAGE_READWRITE);
-#else
-	/*
-	 * We don't use MAP_FIXED here, because it can cause the *replacement*
-	 * of existing mappings, and we only want to create new mappings.
-	 */
-	{
-		int prot = *commit ? PAGES_PROT_COMMIT : PAGES_PROT_DECOMMIT;
-
-		ret = mmap(addr, size, prot, mmap_flags, -1, 0);
-	}
-	assert(ret != NULL);
-
-	if (ret == MAP_FAILED) {
-		ret = NULL;
-	} else if (addr != NULL && ret != addr) {
-		/*
-		 * We succeeded in mapping memory, but not in the right place.
-		 */
-		os_pages_unmap(ret, size);
-		ret = NULL;
-	}
-#endif
-	assert(ret == NULL || (addr == NULL && ret != addr) || (addr != NULL &&
-	    ret == addr));
-	return ret;
-}
-
-static void *
-os_pages_trim(void *addr, size_t alloc_size, size_t leadsize, size_t size,
-    bool *commit) {
-	void *ret = (void *)((uintptr_t)addr + leadsize);
-
-	assert(alloc_size >= leadsize + size);
-#ifdef _WIN32
-	os_pages_unmap(addr, alloc_size);
-	void *new_addr = os_pages_map(ret, size, PAGE, commit);
-	if (new_addr == ret) {
-		return ret;
-	}
-	if (new_addr != NULL) {
-		os_pages_unmap(new_addr, size);
-	}
-	return NULL;
-#else
-	size_t trailsize = alloc_size - leadsize - size;
-
-	if (leadsize != 0) {
-		os_pages_unmap(addr, leadsize);
-	}
-	if (trailsize != 0) {
-		os_pages_unmap((void *)((uintptr_t)ret + size), trailsize);
-	}
-	return ret;
-#endif
-}
-
-static void
-os_pages_unmap(void *addr, size_t size) {
-	assert(ALIGNMENT_ADDR2BASE(addr, os_page) == addr);
-	assert(ALIGNMENT_CEILING(size, os_page) == size);
-
-#ifdef _WIN32
-	if (VirtualFree(addr, 0, MEM_RELEASE) == 0)
-#else
-	if (munmap(addr, size) == -1)
-#endif
-	{
-		char buf[BUFERROR_BUF];
-
-		buferror(get_errno(), buf, sizeof(buf));
-		malloc_printf("<jemalloc>: Error in "
-#ifdef _WIN32
-		    "VirtualFree"
-#else
-		    "munmap"
-#endif
-		    "(): %s\n", buf);
-		if (opt_abort) {
-			abort();
-		}
-	}
-}
-
-static void *
-pages_map_slow(size_t size, size_t alignment, bool *commit) {
-	size_t alloc_size = size + alignment - os_page;
-	/* Beware size_t wrap-around. */
-	if (alloc_size < size) {
-		return NULL;
-	}
-
-	void *ret;
-	do {
-		void *pages = os_pages_map(NULL, alloc_size, alignment, commit);
-		if (pages == NULL) {
-			return NULL;
-		}
-		size_t leadsize = ALIGNMENT_CEILING((uintptr_t)pages, alignment)
-		    - (uintptr_t)pages;
-		ret = os_pages_trim(pages, alloc_size, leadsize, size, commit);
-	} while (ret == NULL);
-
-	assert(ret != NULL);
-	assert(PAGE_ADDR2BASE(ret) == ret);
-	return ret;
-}
-
-void *
-pages_map(void *addr, size_t size, size_t alignment, bool *commit) {
-	assert(alignment >= PAGE);
-	assert(ALIGNMENT_ADDR2BASE(addr, alignment) == addr);
-
-	/*
-	 * Ideally, there would be a way to specify alignment to mmap() (like
-	 * NetBSD has), but in the absence of such a feature, we have to work
-	 * hard to efficiently create aligned mappings.  The reliable, but
-	 * slow method is to create a mapping that is over-sized, then trim the
-	 * excess.  However, that always results in one or two calls to
-	 * os_pages_unmap(), and it can leave holes in the process's virtual
-	 * memory map if memory grows downward.
-	 *
-	 * Optimistically try mapping precisely the right amount before falling
-	 * back to the slow method, with the expectation that the optimistic
-	 * approach works most of the time.
-	 */
-
-	void *ret = os_pages_map(addr, size, os_page, commit);
-	if (ret == NULL || ret == addr) {
-		return ret;
-	}
-	assert(addr == NULL);
-	if (ALIGNMENT_ADDR2OFFSET(ret, alignment) != 0) {
-		os_pages_unmap(ret, size);
-		return pages_map_slow(size, alignment, commit);
-	}
-
-	assert(PAGE_ADDR2BASE(ret) == ret);
-	return ret;
-}
-
-void
-pages_unmap(void *addr, size_t size) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-
-	os_pages_unmap(addr, size);
-}
-
-static bool
-pages_commit_impl(void *addr, size_t size, bool commit) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-
-	if (os_overcommits) {
-		return true;
-	}
-
-#ifdef _WIN32
-	return (commit ? (addr != VirtualAlloc(addr, size, MEM_COMMIT,
-	    PAGE_READWRITE)) : (!VirtualFree(addr, size, MEM_DECOMMIT)));
-#else
-	{
-		int prot = commit ? PAGES_PROT_COMMIT : PAGES_PROT_DECOMMIT;
-		void *result = mmap(addr, size, prot, mmap_flags | MAP_FIXED,
-		    -1, 0);
-		if (result == MAP_FAILED) {
-			return true;
-		}
-		if (result != addr) {
-			/*
-			 * We succeeded in mapping memory, but not in the right
-			 * place.
-			 */
-			os_pages_unmap(result, size);
-			return true;
-		}
-		return false;
-	}
-#endif
-}
-
-bool
-pages_commit(void *addr, size_t size) {
-	return pages_commit_impl(addr, size, true);
-}
-
-bool
-pages_decommit(void *addr, size_t size) {
-	return pages_commit_impl(addr, size, false);
-}
-
-bool
-pages_purge_lazy(void *addr, size_t size) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-
-	if (!pages_can_purge_lazy) {
-		return true;
-	}
-	if (!pages_can_purge_lazy_runtime) {
-		/*
-		 * Built with lazy purge enabled, but detected it was not
-		 * supported on the current system.
-		 */
-		return true;
-	}
-
-#ifdef _WIN32
-	VirtualAlloc(addr, size, MEM_RESET, PAGE_READWRITE);
-	return false;
-#elif defined(JEMALLOC_PURGE_MADVISE_FREE)
-	return (madvise(addr, size,
-#  ifdef MADV_FREE
-	    MADV_FREE
-#  else
-	    JEMALLOC_MADV_FREE
-#  endif
-	    ) != 0);
-#elif defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
-    !defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)
-	return (madvise(addr, size, MADV_DONTNEED) != 0);
-#else
-	not_reached();
-#endif
-}
-
-bool
-pages_purge_forced(void *addr, size_t size) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-
-	if (!pages_can_purge_forced) {
-		return true;
-	}
-
-#if defined(JEMALLOC_PURGE_MADVISE_DONTNEED) && \
-    defined(JEMALLOC_PURGE_MADVISE_DONTNEED_ZEROS)
-	return (madvise(addr, size, MADV_DONTNEED) != 0);
-#elif defined(JEMALLOC_MAPS_COALESCE)
-	/* Try to overlay a new demand-zeroed mapping. */
-	return pages_commit(addr, size);
-#else
-	not_reached();
-#endif
-}
-
-static bool
-pages_huge_impl(void *addr, size_t size, bool aligned) {
-	if (aligned) {
-		assert(HUGEPAGE_ADDR2BASE(addr) == addr);
-		assert(HUGEPAGE_CEILING(size) == size);
-	}
-#ifdef JEMALLOC_HAVE_MADVISE_HUGE
-	return (madvise(addr, size, MADV_HUGEPAGE) != 0);
-#else
-	return true;
-#endif
-}
-
-bool
-pages_huge(void *addr, size_t size) {
-	return pages_huge_impl(addr, size, true);
-}
-
-static bool
-pages_huge_unaligned(void *addr, size_t size) {
-	return pages_huge_impl(addr, size, false);
-}
-
-static bool
-pages_nohuge_impl(void *addr, size_t size, bool aligned) {
-	if (aligned) {
-		assert(HUGEPAGE_ADDR2BASE(addr) == addr);
-		assert(HUGEPAGE_CEILING(size) == size);
-	}
-
-#ifdef JEMALLOC_HAVE_MADVISE_HUGE
-	return (madvise(addr, size, MADV_NOHUGEPAGE) != 0);
-#else
-	return false;
-#endif
-}
-
-bool
-pages_nohuge(void *addr, size_t size) {
-	return pages_nohuge_impl(addr, size, true);
-}
-
-static bool
-pages_nohuge_unaligned(void *addr, size_t size) {
-	return pages_nohuge_impl(addr, size, false);
-}
-
-bool
-pages_dontdump(void *addr, size_t size) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-#ifdef JEMALLOC_MADVISE_DONTDUMP
-	return madvise(addr, size, MADV_DONTDUMP) != 0;
-#else
-	return false;
-#endif
-}
-
-bool
-pages_dodump(void *addr, size_t size) {
-	assert(PAGE_ADDR2BASE(addr) == addr);
-	assert(PAGE_CEILING(size) == size);
-#ifdef JEMALLOC_MADVISE_DONTDUMP
-	return madvise(addr, size, MADV_DODUMP) != 0;
-#else
-	return false;
-#endif
-}
-
-
-static size_t
-os_page_detect(void) {
-#ifdef _WIN32
-	SYSTEM_INFO si;
-	GetSystemInfo(&si);
-	return si.dwPageSize;
-#elif defined(__FreeBSD__)
-	return getpagesize();
-#else
-	long result = sysconf(_SC_PAGESIZE);
-	if (result == -1) {
-		return LG_PAGE;
-	}
-	return (size_t)result;
-#endif
-}
-
-#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
-static bool
-os_overcommits_sysctl(void) {
-	int vm_overcommit;
-	size_t sz;
-
-	sz = sizeof(vm_overcommit);
-#if defined(__FreeBSD__) && defined(VM_OVERCOMMIT)
-	int mib[2];
-
-	mib[0] = CTL_VM;
-	mib[1] = VM_OVERCOMMIT;
-	if (sysctl(mib, 2, &vm_overcommit, &sz, NULL, 0) != 0) {
-		return false; /* Error. */
-	}
-#else
-	if (sysctlbyname("vm.overcommit", &vm_overcommit, &sz, NULL, 0) != 0) {
-		return false; /* Error. */
-	}
-#endif
-
-	return ((vm_overcommit & 0x3) == 0);
-}
-#endif
-
-#ifdef JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY
-/*
- * Use syscall(2) rather than {open,read,close}(2) when possible to avoid
- * reentry during bootstrapping if another library has interposed system call
- * wrappers.
- */
-static bool
-os_overcommits_proc(void) {
-	int fd;
-	char buf[1];
-
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_open)
-	#if defined(O_CLOEXEC)
-		fd = (int)syscall(SYS_open, "/proc/sys/vm/overcommit_memory", O_RDONLY |
-			O_CLOEXEC);
-	#else
-		fd = (int)syscall(SYS_open, "/proc/sys/vm/overcommit_memory", O_RDONLY);
-		if (fd != -1) {
-			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
-		}
-	#endif
-#elif defined(JEMALLOC_USE_SYSCALL) && defined(SYS_openat)
-	#if defined(O_CLOEXEC)
-		fd = (int)syscall(SYS_openat,
-			AT_FDCWD, "/proc/sys/vm/overcommit_memory", O_RDONLY | O_CLOEXEC);
-	#else
-		fd = (int)syscall(SYS_openat,
-			AT_FDCWD, "/proc/sys/vm/overcommit_memory", O_RDONLY);
-		if (fd != -1) {
-			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
-		}
-	#endif
-#else
-	#if defined(O_CLOEXEC)
-		fd = open("/proc/sys/vm/overcommit_memory", O_RDONLY | O_CLOEXEC);
-	#else
-		fd = open("/proc/sys/vm/overcommit_memory", O_RDONLY);
-		if (fd != -1) {
-			fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
-		}
-	#endif
-#endif
-
-	if (fd == -1) {
-		return false; /* Error. */
-	}
-
-	ssize_t nread = malloc_read_fd(fd, &buf, sizeof(buf));
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_close)
-	syscall(SYS_close, fd);
-#else
-	close(fd);
-#endif
-
-	if (nread < 1) {
-		return false; /* Error. */
-	}
-	/*
-	 * /proc/sys/vm/overcommit_memory meanings:
-	 * 0: Heuristic overcommit.
-	 * 1: Always overcommit.
-	 * 2: Never overcommit.
-	 */
-	return (buf[0] == '0' || buf[0] == '1');
-}
-#endif
-
-void
-pages_set_thp_state (void *ptr, size_t size) {
-	if (opt_thp == thp_mode_default || opt_thp == init_system_thp_mode) {
-		return;
-	}
-	assert(opt_thp != thp_mode_not_supported &&
-	    init_system_thp_mode != thp_mode_not_supported);
-
-	if (opt_thp == thp_mode_always
-	    && init_system_thp_mode != thp_mode_never) {
-		assert(init_system_thp_mode == thp_mode_default);
-		pages_huge_unaligned(ptr, size);
-	} else if (opt_thp == thp_mode_never) {
-		assert(init_system_thp_mode == thp_mode_default ||
-		    init_system_thp_mode == thp_mode_always);
-		pages_nohuge_unaligned(ptr, size);
-	}
-}
-
-static void
-init_thp_state(void) {
-	if (!have_madvise_huge) {
-		if (metadata_thp_enabled() && opt_abort) {
-			malloc_write("<jemalloc>: no MADV_HUGEPAGE support\n");
-			abort();
-		}
-		goto label_error;
-	}
-
-	static const char sys_state_madvise[] = "always [madvise] never\n";
-	static const char sys_state_always[] = "[always] madvise never\n";
-	static const char sys_state_never[] = "always madvise [never]\n";
-	char buf[sizeof(sys_state_madvise)];
-
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_open)
-	int fd = (int)syscall(SYS_open,
-	    "/sys/kernel/mm/transparent_hugepage/enabled", O_RDONLY);
-#else
-	int fd = open("/sys/kernel/mm/transparent_hugepage/enabled", O_RDONLY);
-#endif
-	if (fd == -1) {
-		goto label_error;
-	}
-
-	ssize_t nread = malloc_read_fd(fd, &buf, sizeof(buf));
-#if defined(JEMALLOC_USE_SYSCALL) && defined(SYS_close)
-	syscall(SYS_close, fd);
-#else
-	close(fd);
-#endif
-
-	if (strncmp(buf, sys_state_madvise, (size_t)nread) == 0) {
-		init_system_thp_mode = thp_mode_default;
-	} else if (strncmp(buf, sys_state_always, (size_t)nread) == 0) {
-		init_system_thp_mode = thp_mode_always;
-	} else if (strncmp(buf, sys_state_never, (size_t)nread) == 0) {
-		init_system_thp_mode = thp_mode_never;
-	} else {
-		goto label_error;
-	}
-	return;
-label_error:
-	opt_thp = init_system_thp_mode = thp_mode_not_supported;
-}
-
-bool
-pages_boot(void) {
-	os_page = os_page_detect();
-	if (os_page > PAGE) {
-		malloc_write("<jemalloc>: Unsupported system page size\n");
-		if (opt_abort) {
-			abort();
-		}
-		return true;
-	}
-
-#ifndef _WIN32
-	mmap_flags = MAP_PRIVATE | MAP_ANON;
-#endif
-
-#ifdef JEMALLOC_SYSCTL_VM_OVERCOMMIT
-	os_overcommits = os_overcommits_sysctl();
-#elif defined(JEMALLOC_PROC_SYS_VM_OVERCOMMIT_MEMORY)
-	os_overcommits = os_overcommits_proc();
-#  ifdef MAP_NORESERVE
-	if (os_overcommits) {
-		mmap_flags |= MAP_NORESERVE;
-	}
-#  endif
-#else
-	os_overcommits = false;
-#endif
-
-	init_thp_state();
-
-	/* Detect lazy purge runtime support. */
-	if (pages_can_purge_lazy) {
-		bool committed = false;
-		void *madv_free_page = os_pages_map(NULL, PAGE, PAGE, &committed);
-		if (madv_free_page == NULL) {
-			return true;
-		}
-		assert(pages_can_purge_lazy_runtime);
-		if (pages_purge_lazy(madv_free_page, PAGE)) {
-			pages_can_purge_lazy_runtime = false;
-		}
-		os_pages_unmap(madv_free_page, PAGE);
-	}
-
-	return false;
-}
diff --git a/redis-stable/deps/jemalloc/src/prng.c b/redis-stable/deps/jemalloc/src/prng.c
deleted file mode 100644
index 83c04bf9..00000000
--- a/redis-stable/deps/jemalloc/src/prng.c
+++ /dev/null
@@ -1,3 +0,0 @@
-#define JEMALLOC_PRNG_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/prof.c b/redis-stable/deps/jemalloc/src/prof.c
deleted file mode 100644
index 13df641a..00000000
--- a/redis-stable/deps/jemalloc/src/prof.c
+++ /dev/null
@@ -1,2473 +0,0 @@
-#define JEMALLOC_PROF_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/ckh.h"
-#include "jemalloc/internal/hash.h"
-#include "jemalloc/internal/malloc_io.h"
-#include "jemalloc/internal/mutex.h"
-
-/******************************************************************************/
-
-#ifdef JEMALLOC_PROF_LIBUNWIND
-#define UNW_LOCAL_ONLY
-#include <libunwind.h>
-#endif
-
-#ifdef JEMALLOC_PROF_LIBGCC
-/*
- * We have a circular dependency -- jemalloc_internal.h tells us if we should
- * use libgcc's unwinding functionality, but after we've included that, we've
- * already hooked _Unwind_Backtrace.  We'll temporarily disable hooking.
- */
-#undef _Unwind_Backtrace
-#include <unwind.h>
-#define _Unwind_Backtrace JEMALLOC_HOOK(_Unwind_Backtrace, hooks_libc_hook)
-#endif
-
-/******************************************************************************/
-/* Data. */
-
-bool		opt_prof = false;
-bool		opt_prof_active = true;
-bool		opt_prof_thread_active_init = true;
-size_t		opt_lg_prof_sample = LG_PROF_SAMPLE_DEFAULT;
-ssize_t		opt_lg_prof_interval = LG_PROF_INTERVAL_DEFAULT;
-bool		opt_prof_gdump = false;
-bool		opt_prof_final = false;
-bool		opt_prof_leak = false;
-bool		opt_prof_accum = false;
-char		opt_prof_prefix[
-    /* Minimize memory bloat for non-prof builds. */
-#ifdef JEMALLOC_PROF
-    PATH_MAX +
-#endif
-    1];
-
-/*
- * Initialized as opt_prof_active, and accessed via
- * prof_active_[gs]et{_unlocked,}().
- */
-bool			prof_active;
-static malloc_mutex_t	prof_active_mtx;
-
-/*
- * Initialized as opt_prof_thread_active_init, and accessed via
- * prof_thread_active_init_[gs]et().
- */
-static bool		prof_thread_active_init;
-static malloc_mutex_t	prof_thread_active_init_mtx;
-
-/*
- * Initialized as opt_prof_gdump, and accessed via
- * prof_gdump_[gs]et{_unlocked,}().
- */
-bool			prof_gdump_val;
-static malloc_mutex_t	prof_gdump_mtx;
-
-uint64_t	prof_interval = 0;
-
-size_t		lg_prof_sample;
-
-/*
- * Table of mutexes that are shared among gctx's.  These are leaf locks, so
- * there is no problem with using them for more than one gctx at the same time.
- * The primary motivation for this sharing though is that gctx's are ephemeral,
- * and destroying mutexes causes complications for systems that allocate when
- * creating/destroying mutexes.
- */
-static malloc_mutex_t	*gctx_locks;
-static atomic_u_t	cum_gctxs; /* Atomic counter. */
-
-/*
- * Table of mutexes that are shared among tdata's.  No operations require
- * holding multiple tdata locks, so there is no problem with using them for more
- * than one tdata at the same time, even though a gctx lock may be acquired
- * while holding a tdata lock.
- */
-static malloc_mutex_t	*tdata_locks;
-
-/*
- * Global hash of (prof_bt_t *)-->(prof_gctx_t *).  This is the master data
- * structure that knows about all backtraces currently captured.
- */
-static ckh_t		bt2gctx;
-/* Non static to enable profiling. */
-malloc_mutex_t		bt2gctx_mtx;
-
-/*
- * Tree of all extant prof_tdata_t structures, regardless of state,
- * {attached,detached,expired}.
- */
-static prof_tdata_tree_t	tdatas;
-static malloc_mutex_t	tdatas_mtx;
-
-static uint64_t		next_thr_uid;
-static malloc_mutex_t	next_thr_uid_mtx;
-
-static malloc_mutex_t	prof_dump_seq_mtx;
-static uint64_t		prof_dump_seq;
-static uint64_t		prof_dump_iseq;
-static uint64_t		prof_dump_mseq;
-static uint64_t		prof_dump_useq;
-
-/*
- * This buffer is rather large for stack allocation, so use a single buffer for
- * all profile dumps.
- */
-static malloc_mutex_t	prof_dump_mtx;
-static char		prof_dump_buf[
-    /* Minimize memory bloat for non-prof builds. */
-#ifdef JEMALLOC_PROF
-    PROF_DUMP_BUFSIZE
-#else
-    1
-#endif
-];
-static size_t		prof_dump_buf_end;
-static int		prof_dump_fd;
-
-/* Do not dump any profiles until bootstrapping is complete. */
-static bool		prof_booted = false;
-
-/******************************************************************************/
-/*
- * Function prototypes for static functions that are referenced prior to
- * definition.
- */
-
-static bool	prof_tctx_should_destroy(tsdn_t *tsdn, prof_tctx_t *tctx);
-static void	prof_tctx_destroy(tsd_t *tsd, prof_tctx_t *tctx);
-static bool	prof_tdata_should_destroy(tsdn_t *tsdn, prof_tdata_t *tdata,
-    bool even_if_attached);
-static void	prof_tdata_destroy(tsd_t *tsd, prof_tdata_t *tdata,
-    bool even_if_attached);
-static char	*prof_thread_name_alloc(tsdn_t *tsdn, const char *thread_name);
-
-/******************************************************************************/
-/* Red-black trees. */
-
-static int
-prof_tctx_comp(const prof_tctx_t *a, const prof_tctx_t *b) {
-	uint64_t a_thr_uid = a->thr_uid;
-	uint64_t b_thr_uid = b->thr_uid;
-	int ret = (a_thr_uid > b_thr_uid) - (a_thr_uid < b_thr_uid);
-	if (ret == 0) {
-		uint64_t a_thr_discrim = a->thr_discrim;
-		uint64_t b_thr_discrim = b->thr_discrim;
-		ret = (a_thr_discrim > b_thr_discrim) - (a_thr_discrim <
-		    b_thr_discrim);
-		if (ret == 0) {
-			uint64_t a_tctx_uid = a->tctx_uid;
-			uint64_t b_tctx_uid = b->tctx_uid;
-			ret = (a_tctx_uid > b_tctx_uid) - (a_tctx_uid <
-			    b_tctx_uid);
-		}
-	}
-	return ret;
-}
-
-rb_gen(static UNUSED, tctx_tree_, prof_tctx_tree_t, prof_tctx_t,
-    tctx_link, prof_tctx_comp)
-
-static int
-prof_gctx_comp(const prof_gctx_t *a, const prof_gctx_t *b) {
-	unsigned a_len = a->bt.len;
-	unsigned b_len = b->bt.len;
-	unsigned comp_len = (a_len < b_len) ? a_len : b_len;
-	int ret = memcmp(a->bt.vec, b->bt.vec, comp_len * sizeof(void *));
-	if (ret == 0) {
-		ret = (a_len > b_len) - (a_len < b_len);
-	}
-	return ret;
-}
-
-rb_gen(static UNUSED, gctx_tree_, prof_gctx_tree_t, prof_gctx_t, dump_link,
-    prof_gctx_comp)
-
-static int
-prof_tdata_comp(const prof_tdata_t *a, const prof_tdata_t *b) {
-	int ret;
-	uint64_t a_uid = a->thr_uid;
-	uint64_t b_uid = b->thr_uid;
-
-	ret = ((a_uid > b_uid) - (a_uid < b_uid));
-	if (ret == 0) {
-		uint64_t a_discrim = a->thr_discrim;
-		uint64_t b_discrim = b->thr_discrim;
-
-		ret = ((a_discrim > b_discrim) - (a_discrim < b_discrim));
-	}
-	return ret;
-}
-
-rb_gen(static UNUSED, tdata_tree_, prof_tdata_tree_t, prof_tdata_t, tdata_link,
-    prof_tdata_comp)
-
-/******************************************************************************/
-
-void
-prof_alloc_rollback(tsd_t *tsd, prof_tctx_t *tctx, bool updated) {
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	if (updated) {
-		/*
-		 * Compute a new sample threshold.  This isn't very important in
-		 * practice, because this function is rarely executed, so the
-		 * potential for sample bias is minimal except in contrived
-		 * programs.
-		 */
-		tdata = prof_tdata_get(tsd, true);
-		if (tdata != NULL) {
-			prof_sample_threshold_update(tdata);
-		}
-	}
-
-	if ((uintptr_t)tctx > (uintptr_t)1U) {
-		malloc_mutex_lock(tsd_tsdn(tsd), tctx->tdata->lock);
-		tctx->prepared = false;
-		if (prof_tctx_should_destroy(tsd_tsdn(tsd), tctx)) {
-			prof_tctx_destroy(tsd, tctx);
-		} else {
-			malloc_mutex_unlock(tsd_tsdn(tsd), tctx->tdata->lock);
-		}
-	}
-}
-
-void
-prof_malloc_sample_object(tsdn_t *tsdn, const void *ptr, size_t usize,
-    prof_tctx_t *tctx) {
-	prof_tctx_set(tsdn, ptr, usize, NULL, tctx);
-
-	malloc_mutex_lock(tsdn, tctx->tdata->lock);
-	tctx->cnts.curobjs++;
-	tctx->cnts.curbytes += usize;
-	if (opt_prof_accum) {
-		tctx->cnts.accumobjs++;
-		tctx->cnts.accumbytes += usize;
-	}
-	tctx->prepared = false;
-	malloc_mutex_unlock(tsdn, tctx->tdata->lock);
-}
-
-void
-prof_free_sampled_object(tsd_t *tsd, size_t usize, prof_tctx_t *tctx) {
-	malloc_mutex_lock(tsd_tsdn(tsd), tctx->tdata->lock);
-	assert(tctx->cnts.curobjs > 0);
-	assert(tctx->cnts.curbytes >= usize);
-	tctx->cnts.curobjs--;
-	tctx->cnts.curbytes -= usize;
-
-	if (prof_tctx_should_destroy(tsd_tsdn(tsd), tctx)) {
-		prof_tctx_destroy(tsd, tctx);
-	} else {
-		malloc_mutex_unlock(tsd_tsdn(tsd), tctx->tdata->lock);
-	}
-}
-
-void
-bt_init(prof_bt_t *bt, void **vec) {
-	cassert(config_prof);
-
-	bt->vec = vec;
-	bt->len = 0;
-}
-
-static void
-prof_enter(tsd_t *tsd, prof_tdata_t *tdata) {
-	cassert(config_prof);
-	assert(tdata == prof_tdata_get(tsd, false));
-
-	if (tdata != NULL) {
-		assert(!tdata->enq);
-		tdata->enq = true;
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &bt2gctx_mtx);
-}
-
-static void
-prof_leave(tsd_t *tsd, prof_tdata_t *tdata) {
-	cassert(config_prof);
-	assert(tdata == prof_tdata_get(tsd, false));
-
-	malloc_mutex_unlock(tsd_tsdn(tsd), &bt2gctx_mtx);
-
-	if (tdata != NULL) {
-		bool idump, gdump;
-
-		assert(tdata->enq);
-		tdata->enq = false;
-		idump = tdata->enq_idump;
-		tdata->enq_idump = false;
-		gdump = tdata->enq_gdump;
-		tdata->enq_gdump = false;
-
-		if (idump) {
-			prof_idump(tsd_tsdn(tsd));
-		}
-		if (gdump) {
-			prof_gdump(tsd_tsdn(tsd));
-		}
-	}
-}
-
-#ifdef JEMALLOC_PROF_LIBUNWIND
-void
-prof_backtrace(prof_bt_t *bt) {
-	int nframes;
-
-	cassert(config_prof);
-	assert(bt->len == 0);
-	assert(bt->vec != NULL);
-
-	nframes = unw_backtrace(bt->vec, PROF_BT_MAX);
-	if (nframes <= 0) {
-		return;
-	}
-	bt->len = nframes;
-}
-#elif (defined(JEMALLOC_PROF_LIBGCC))
-static _Unwind_Reason_Code
-prof_unwind_init_callback(struct _Unwind_Context *context, void *arg) {
-	cassert(config_prof);
-
-	return _URC_NO_REASON;
-}
-
-static _Unwind_Reason_Code
-prof_unwind_callback(struct _Unwind_Context *context, void *arg) {
-	prof_unwind_data_t *data = (prof_unwind_data_t *)arg;
-	void *ip;
-
-	cassert(config_prof);
-
-	ip = (void *)_Unwind_GetIP(context);
-	if (ip == NULL) {
-		return _URC_END_OF_STACK;
-	}
-	data->bt->vec[data->bt->len] = ip;
-	data->bt->len++;
-	if (data->bt->len == data->max) {
-		return _URC_END_OF_STACK;
-	}
-
-	return _URC_NO_REASON;
-}
-
-void
-prof_backtrace(prof_bt_t *bt) {
-	prof_unwind_data_t data = {bt, PROF_BT_MAX};
-
-	cassert(config_prof);
-
-	_Unwind_Backtrace(prof_unwind_callback, &data);
-}
-#elif (defined(JEMALLOC_PROF_GCC))
-void
-prof_backtrace(prof_bt_t *bt) {
-#define BT_FRAME(i)							\
-	if ((i) < PROF_BT_MAX) {					\
-		void *p;						\
-		if (__builtin_frame_address(i) == 0) {			\
-			return;						\
-		}							\
-		p = __builtin_return_address(i);			\
-		if (p == NULL) {					\
-			return;						\
-		}							\
-		bt->vec[(i)] = p;					\
-		bt->len = (i) + 1;					\
-	} else {							\
-		return;							\
-	}
-
-	cassert(config_prof);
-
-	BT_FRAME(0)
-	BT_FRAME(1)
-	BT_FRAME(2)
-	BT_FRAME(3)
-	BT_FRAME(4)
-	BT_FRAME(5)
-	BT_FRAME(6)
-	BT_FRAME(7)
-	BT_FRAME(8)
-	BT_FRAME(9)
-
-	BT_FRAME(10)
-	BT_FRAME(11)
-	BT_FRAME(12)
-	BT_FRAME(13)
-	BT_FRAME(14)
-	BT_FRAME(15)
-	BT_FRAME(16)
-	BT_FRAME(17)
-	BT_FRAME(18)
-	BT_FRAME(19)
-
-	BT_FRAME(20)
-	BT_FRAME(21)
-	BT_FRAME(22)
-	BT_FRAME(23)
-	BT_FRAME(24)
-	BT_FRAME(25)
-	BT_FRAME(26)
-	BT_FRAME(27)
-	BT_FRAME(28)
-	BT_FRAME(29)
-
-	BT_FRAME(30)
-	BT_FRAME(31)
-	BT_FRAME(32)
-	BT_FRAME(33)
-	BT_FRAME(34)
-	BT_FRAME(35)
-	BT_FRAME(36)
-	BT_FRAME(37)
-	BT_FRAME(38)
-	BT_FRAME(39)
-
-	BT_FRAME(40)
-	BT_FRAME(41)
-	BT_FRAME(42)
-	BT_FRAME(43)
-	BT_FRAME(44)
-	BT_FRAME(45)
-	BT_FRAME(46)
-	BT_FRAME(47)
-	BT_FRAME(48)
-	BT_FRAME(49)
-
-	BT_FRAME(50)
-	BT_FRAME(51)
-	BT_FRAME(52)
-	BT_FRAME(53)
-	BT_FRAME(54)
-	BT_FRAME(55)
-	BT_FRAME(56)
-	BT_FRAME(57)
-	BT_FRAME(58)
-	BT_FRAME(59)
-
-	BT_FRAME(60)
-	BT_FRAME(61)
-	BT_FRAME(62)
-	BT_FRAME(63)
-	BT_FRAME(64)
-	BT_FRAME(65)
-	BT_FRAME(66)
-	BT_FRAME(67)
-	BT_FRAME(68)
-	BT_FRAME(69)
-
-	BT_FRAME(70)
-	BT_FRAME(71)
-	BT_FRAME(72)
-	BT_FRAME(73)
-	BT_FRAME(74)
-	BT_FRAME(75)
-	BT_FRAME(76)
-	BT_FRAME(77)
-	BT_FRAME(78)
-	BT_FRAME(79)
-
-	BT_FRAME(80)
-	BT_FRAME(81)
-	BT_FRAME(82)
-	BT_FRAME(83)
-	BT_FRAME(84)
-	BT_FRAME(85)
-	BT_FRAME(86)
-	BT_FRAME(87)
-	BT_FRAME(88)
-	BT_FRAME(89)
-
-	BT_FRAME(90)
-	BT_FRAME(91)
-	BT_FRAME(92)
-	BT_FRAME(93)
-	BT_FRAME(94)
-	BT_FRAME(95)
-	BT_FRAME(96)
-	BT_FRAME(97)
-	BT_FRAME(98)
-	BT_FRAME(99)
-
-	BT_FRAME(100)
-	BT_FRAME(101)
-	BT_FRAME(102)
-	BT_FRAME(103)
-	BT_FRAME(104)
-	BT_FRAME(105)
-	BT_FRAME(106)
-	BT_FRAME(107)
-	BT_FRAME(108)
-	BT_FRAME(109)
-
-	BT_FRAME(110)
-	BT_FRAME(111)
-	BT_FRAME(112)
-	BT_FRAME(113)
-	BT_FRAME(114)
-	BT_FRAME(115)
-	BT_FRAME(116)
-	BT_FRAME(117)
-	BT_FRAME(118)
-	BT_FRAME(119)
-
-	BT_FRAME(120)
-	BT_FRAME(121)
-	BT_FRAME(122)
-	BT_FRAME(123)
-	BT_FRAME(124)
-	BT_FRAME(125)
-	BT_FRAME(126)
-	BT_FRAME(127)
-#undef BT_FRAME
-}
-#else
-void
-prof_backtrace(prof_bt_t *bt) {
-	cassert(config_prof);
-	not_reached();
-}
-#endif
-
-static malloc_mutex_t *
-prof_gctx_mutex_choose(void) {
-	unsigned ngctxs = atomic_fetch_add_u(&cum_gctxs, 1, ATOMIC_RELAXED);
-
-	return &gctx_locks[(ngctxs - 1) % PROF_NCTX_LOCKS];
-}
-
-static malloc_mutex_t *
-prof_tdata_mutex_choose(uint64_t thr_uid) {
-	return &tdata_locks[thr_uid % PROF_NTDATA_LOCKS];
-}
-
-static prof_gctx_t *
-prof_gctx_create(tsdn_t *tsdn, prof_bt_t *bt) {
-	/*
-	 * Create a single allocation that has space for vec of length bt->len.
-	 */
-	size_t size = offsetof(prof_gctx_t, vec) + (bt->len * sizeof(void *));
-	prof_gctx_t *gctx = (prof_gctx_t *)iallocztm(tsdn, size,
-	    sz_size2index(size), false, NULL, true, arena_get(TSDN_NULL, 0, true),
-	    true);
-	if (gctx == NULL) {
-		return NULL;
-	}
-	gctx->lock = prof_gctx_mutex_choose();
-	/*
-	 * Set nlimbo to 1, in order to avoid a race condition with
-	 * prof_tctx_destroy()/prof_gctx_try_destroy().
-	 */
-	gctx->nlimbo = 1;
-	tctx_tree_new(&gctx->tctxs);
-	/* Duplicate bt. */
-	memcpy(gctx->vec, bt->vec, bt->len * sizeof(void *));
-	gctx->bt.vec = gctx->vec;
-	gctx->bt.len = bt->len;
-	return gctx;
-}
-
-static void
-prof_gctx_try_destroy(tsd_t *tsd, prof_tdata_t *tdata_self, prof_gctx_t *gctx,
-    prof_tdata_t *tdata) {
-	cassert(config_prof);
-
-	/*
-	 * Check that gctx is still unused by any thread cache before destroying
-	 * it.  prof_lookup() increments gctx->nlimbo in order to avoid a race
-	 * condition with this function, as does prof_tctx_destroy() in order to
-	 * avoid a race between the main body of prof_tctx_destroy() and entry
-	 * into this function.
-	 */
-	prof_enter(tsd, tdata_self);
-	malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
-	assert(gctx->nlimbo != 0);
-	if (tctx_tree_empty(&gctx->tctxs) && gctx->nlimbo == 1) {
-		/* Remove gctx from bt2gctx. */
-		if (ckh_remove(tsd, &bt2gctx, &gctx->bt, NULL, NULL)) {
-			not_reached();
-		}
-		prof_leave(tsd, tdata_self);
-		/* Destroy gctx. */
-		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-		idalloctm(tsd_tsdn(tsd), gctx, NULL, NULL, true, true);
-	} else {
-		/*
-		 * Compensate for increment in prof_tctx_destroy() or
-		 * prof_lookup().
-		 */
-		gctx->nlimbo--;
-		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-		prof_leave(tsd, tdata_self);
-	}
-}
-
-static bool
-prof_tctx_should_destroy(tsdn_t *tsdn, prof_tctx_t *tctx) {
-	malloc_mutex_assert_owner(tsdn, tctx->tdata->lock);
-
-	if (opt_prof_accum) {
-		return false;
-	}
-	if (tctx->cnts.curobjs != 0) {
-		return false;
-	}
-	if (tctx->prepared) {
-		return false;
-	}
-	return true;
-}
-
-static bool
-prof_gctx_should_destroy(prof_gctx_t *gctx) {
-	if (opt_prof_accum) {
-		return false;
-	}
-	if (!tctx_tree_empty(&gctx->tctxs)) {
-		return false;
-	}
-	if (gctx->nlimbo != 0) {
-		return false;
-	}
-	return true;
-}
-
-static void
-prof_tctx_destroy(tsd_t *tsd, prof_tctx_t *tctx) {
-	prof_tdata_t *tdata = tctx->tdata;
-	prof_gctx_t *gctx = tctx->gctx;
-	bool destroy_tdata, destroy_tctx, destroy_gctx;
-
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), tctx->tdata->lock);
-
-	assert(tctx->cnts.curobjs == 0);
-	assert(tctx->cnts.curbytes == 0);
-	assert(!opt_prof_accum);
-	assert(tctx->cnts.accumobjs == 0);
-	assert(tctx->cnts.accumbytes == 0);
-
-	ckh_remove(tsd, &tdata->bt2tctx, &gctx->bt, NULL, NULL);
-	destroy_tdata = prof_tdata_should_destroy(tsd_tsdn(tsd), tdata, false);
-	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
-
-	malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
-	switch (tctx->state) {
-	case prof_tctx_state_nominal:
-		tctx_tree_remove(&gctx->tctxs, tctx);
-		destroy_tctx = true;
-		if (prof_gctx_should_destroy(gctx)) {
-			/*
-			 * Increment gctx->nlimbo in order to keep another
-			 * thread from winning the race to destroy gctx while
-			 * this one has gctx->lock dropped.  Without this, it
-			 * would be possible for another thread to:
-			 *
-			 * 1) Sample an allocation associated with gctx.
-			 * 2) Deallocate the sampled object.
-			 * 3) Successfully prof_gctx_try_destroy(gctx).
-			 *
-			 * The result would be that gctx no longer exists by the
-			 * time this thread accesses it in
-			 * prof_gctx_try_destroy().
-			 */
-			gctx->nlimbo++;
-			destroy_gctx = true;
-		} else {
-			destroy_gctx = false;
-		}
-		break;
-	case prof_tctx_state_dumping:
-		/*
-		 * A dumping thread needs tctx to remain valid until dumping
-		 * has finished.  Change state such that the dumping thread will
-		 * complete destruction during a late dump iteration phase.
-		 */
-		tctx->state = prof_tctx_state_purgatory;
-		destroy_tctx = false;
-		destroy_gctx = false;
-		break;
-	default:
-		not_reached();
-		destroy_tctx = false;
-		destroy_gctx = false;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-	if (destroy_gctx) {
-		prof_gctx_try_destroy(tsd, prof_tdata_get(tsd, false), gctx,
-		    tdata);
-	}
-
-	malloc_mutex_assert_not_owner(tsd_tsdn(tsd), tctx->tdata->lock);
-
-	if (destroy_tdata) {
-		prof_tdata_destroy(tsd, tdata, false);
-	}
-
-	if (destroy_tctx) {
-		idalloctm(tsd_tsdn(tsd), tctx, NULL, NULL, true, true);
-	}
-}
-
-static bool
-prof_lookup_global(tsd_t *tsd, prof_bt_t *bt, prof_tdata_t *tdata,
-    void **p_btkey, prof_gctx_t **p_gctx, bool *p_new_gctx) {
-	union {
-		prof_gctx_t	*p;
-		void		*v;
-	} gctx, tgctx;
-	union {
-		prof_bt_t	*p;
-		void		*v;
-	} btkey;
-	bool new_gctx;
-
-	prof_enter(tsd, tdata);
-	if (ckh_search(&bt2gctx, bt, &btkey.v, &gctx.v)) {
-		/* bt has never been seen before.  Insert it. */
-		prof_leave(tsd, tdata);
-		tgctx.p = prof_gctx_create(tsd_tsdn(tsd), bt);
-		if (tgctx.v == NULL) {
-			return true;
-		}
-		prof_enter(tsd, tdata);
-		if (ckh_search(&bt2gctx, bt, &btkey.v, &gctx.v)) {
-			gctx.p = tgctx.p;
-			btkey.p = &gctx.p->bt;
-			if (ckh_insert(tsd, &bt2gctx, btkey.v, gctx.v)) {
-				/* OOM. */
-				prof_leave(tsd, tdata);
-				idalloctm(tsd_tsdn(tsd), gctx.v, NULL, NULL,
-				    true, true);
-				return true;
-			}
-			new_gctx = true;
-		} else {
-			new_gctx = false;
-		}
-	} else {
-		tgctx.v = NULL;
-		new_gctx = false;
-	}
-
-	if (!new_gctx) {
-		/*
-		 * Increment nlimbo, in order to avoid a race condition with
-		 * prof_tctx_destroy()/prof_gctx_try_destroy().
-		 */
-		malloc_mutex_lock(tsd_tsdn(tsd), gctx.p->lock);
-		gctx.p->nlimbo++;
-		malloc_mutex_unlock(tsd_tsdn(tsd), gctx.p->lock);
-		new_gctx = false;
-
-		if (tgctx.v != NULL) {
-			/* Lost race to insert. */
-			idalloctm(tsd_tsdn(tsd), tgctx.v, NULL, NULL, true,
-			    true);
-		}
-	}
-	prof_leave(tsd, tdata);
-
-	*p_btkey = btkey.v;
-	*p_gctx = gctx.p;
-	*p_new_gctx = new_gctx;
-	return false;
-}
-
-prof_tctx_t *
-prof_lookup(tsd_t *tsd, prof_bt_t *bt) {
-	union {
-		prof_tctx_t	*p;
-		void		*v;
-	} ret;
-	prof_tdata_t *tdata;
-	bool not_found;
-
-	cassert(config_prof);
-
-	tdata = prof_tdata_get(tsd, false);
-	if (tdata == NULL) {
-		return NULL;
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
-	not_found = ckh_search(&tdata->bt2tctx, bt, NULL, &ret.v);
-	if (!not_found) { /* Note double negative! */
-		ret.p->prepared = true;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
-	if (not_found) {
-		void *btkey;
-		prof_gctx_t *gctx;
-		bool new_gctx, error;
-
-		/*
-		 * This thread's cache lacks bt.  Look for it in the global
-		 * cache.
-		 */
-		if (prof_lookup_global(tsd, bt, tdata, &btkey, &gctx,
-		    &new_gctx)) {
-			return NULL;
-		}
-
-		/* Link a prof_tctx_t into gctx for this thread. */
-		ret.v = iallocztm(tsd_tsdn(tsd), sizeof(prof_tctx_t),
-		    sz_size2index(sizeof(prof_tctx_t)), false, NULL, true,
-		    arena_ichoose(tsd, NULL), true);
-		if (ret.p == NULL) {
-			if (new_gctx) {
-				prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
-			}
-			return NULL;
-		}
-		ret.p->tdata = tdata;
-		ret.p->thr_uid = tdata->thr_uid;
-		ret.p->thr_discrim = tdata->thr_discrim;
-		memset(&ret.p->cnts, 0, sizeof(prof_cnt_t));
-		ret.p->gctx = gctx;
-		ret.p->tctx_uid = tdata->tctx_uid_next++;
-		ret.p->prepared = true;
-		ret.p->state = prof_tctx_state_initializing;
-		malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
-		error = ckh_insert(tsd, &tdata->bt2tctx, btkey, ret.v);
-		malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
-		if (error) {
-			if (new_gctx) {
-				prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
-			}
-			idalloctm(tsd_tsdn(tsd), ret.v, NULL, NULL, true, true);
-			return NULL;
-		}
-		malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
-		ret.p->state = prof_tctx_state_nominal;
-		tctx_tree_insert(&gctx->tctxs, ret.p);
-		gctx->nlimbo--;
-		malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-	}
-
-	return ret.p;
-}
-
-/*
- * The bodies of this function and prof_leakcheck() are compiled out unless heap
- * profiling is enabled, so that it is possible to compile jemalloc with
- * floating point support completely disabled.  Avoiding floating point code is
- * important on memory-constrained systems, but it also enables a workaround for
- * versions of glibc that don't properly save/restore floating point registers
- * during dynamic lazy symbol loading (which internally calls into whatever
- * malloc implementation happens to be integrated into the application).  Note
- * that some compilers (e.g.  gcc 4.8) may use floating point registers for fast
- * memory moves, so jemalloc must be compiled with such optimizations disabled
- * (e.g.
- * -mno-sse) in order for the workaround to be complete.
- */
-void
-prof_sample_threshold_update(prof_tdata_t *tdata) {
-#ifdef JEMALLOC_PROF
-	uint64_t r;
-	double u;
-
-	if (!config_prof) {
-		return;
-	}
-
-	if (lg_prof_sample == 0) {
-		tdata->bytes_until_sample = 0;
-		return;
-	}
-
-	/*
-	 * Compute sample interval as a geometrically distributed random
-	 * variable with mean (2^lg_prof_sample).
-	 *
-	 *                             __        __
-	 *                             |  log(u)  |                     1
-	 * tdata->bytes_until_sample = | -------- |, where p = ---------------
-	 *                             | log(1-p) |             lg_prof_sample
-	 *                                                     2
-	 *
-	 * For more information on the math, see:
-	 *
-	 *   Non-Uniform Random Variate Generation
-	 *   Luc Devroye
-	 *   Springer-Verlag, New York, 1986
-	 *   pp 500
-	 *   (http://luc.devroye.org/rnbookindex.html)
-	 */
-	r = prng_lg_range_u64(&tdata->prng_state, 53);
-	u = (double)r * (1.0/9007199254740992.0L);
-	tdata->bytes_until_sample = (uint64_t)(log(u) /
-	    log(1.0 - (1.0 / (double)((uint64_t)1U << lg_prof_sample))))
-	    + (uint64_t)1U;
-#endif
-}
-
-#ifdef JEMALLOC_JET
-static prof_tdata_t *
-prof_tdata_count_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
-    void *arg) {
-	size_t *tdata_count = (size_t *)arg;
-
-	(*tdata_count)++;
-
-	return NULL;
-}
-
-size_t
-prof_tdata_count(void) {
-	size_t tdata_count = 0;
-	tsdn_t *tsdn;
-
-	tsdn = tsdn_fetch();
-	malloc_mutex_lock(tsdn, &tdatas_mtx);
-	tdata_tree_iter(&tdatas, NULL, prof_tdata_count_iter,
-	    (void *)&tdata_count);
-	malloc_mutex_unlock(tsdn, &tdatas_mtx);
-
-	return tdata_count;
-}
-
-size_t
-prof_bt_count(void) {
-	size_t bt_count;
-	tsd_t *tsd;
-	prof_tdata_t *tdata;
-
-	tsd = tsd_fetch();
-	tdata = prof_tdata_get(tsd, false);
-	if (tdata == NULL) {
-		return 0;
-	}
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &bt2gctx_mtx);
-	bt_count = ckh_count(&bt2gctx);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &bt2gctx_mtx);
-
-	return bt_count;
-}
-#endif
-
-static int
-prof_dump_open_impl(bool propagate_err, const char *filename) {
-	int fd;
-
-	fd = creat(filename, 0644);
-	if (fd == -1 && !propagate_err) {
-		malloc_printf("<jemalloc>: creat(\"%s\"), 0644) failed\n",
-		    filename);
-		if (opt_abort) {
-			abort();
-		}
-	}
-
-	return fd;
-}
-prof_dump_open_t *JET_MUTABLE prof_dump_open = prof_dump_open_impl;
-
-static bool
-prof_dump_flush(bool propagate_err) {
-	bool ret = false;
-	ssize_t err;
-
-	cassert(config_prof);
-
-	err = malloc_write_fd(prof_dump_fd, prof_dump_buf, prof_dump_buf_end);
-	if (err == -1) {
-		if (!propagate_err) {
-			malloc_write("<jemalloc>: write() failed during heap "
-			    "profile flush\n");
-			if (opt_abort) {
-				abort();
-			}
-		}
-		ret = true;
-	}
-	prof_dump_buf_end = 0;
-
-	return ret;
-}
-
-static bool
-prof_dump_close(bool propagate_err) {
-	bool ret;
-
-	assert(prof_dump_fd != -1);
-	ret = prof_dump_flush(propagate_err);
-	close(prof_dump_fd);
-	prof_dump_fd = -1;
-
-	return ret;
-}
-
-static bool
-prof_dump_write(bool propagate_err, const char *s) {
-	size_t i, slen, n;
-
-	cassert(config_prof);
-
-	i = 0;
-	slen = strlen(s);
-	while (i < slen) {
-		/* Flush the buffer if it is full. */
-		if (prof_dump_buf_end == PROF_DUMP_BUFSIZE) {
-			if (prof_dump_flush(propagate_err) && propagate_err) {
-				return true;
-			}
-		}
-
-		if (prof_dump_buf_end + slen <= PROF_DUMP_BUFSIZE) {
-			/* Finish writing. */
-			n = slen - i;
-		} else {
-			/* Write as much of s as will fit. */
-			n = PROF_DUMP_BUFSIZE - prof_dump_buf_end;
-		}
-		memcpy(&prof_dump_buf[prof_dump_buf_end], &s[i], n);
-		prof_dump_buf_end += n;
-		i += n;
-	}
-
-	return false;
-}
-
-JEMALLOC_FORMAT_PRINTF(2, 3)
-static bool
-prof_dump_printf(bool propagate_err, const char *format, ...) {
-	bool ret;
-	va_list ap;
-	char buf[PROF_PRINTF_BUFSIZE];
-
-	va_start(ap, format);
-	malloc_vsnprintf(buf, sizeof(buf), format, ap);
-	va_end(ap);
-	ret = prof_dump_write(propagate_err, buf);
-
-	return ret;
-}
-
-static void
-prof_tctx_merge_tdata(tsdn_t *tsdn, prof_tctx_t *tctx, prof_tdata_t *tdata) {
-	malloc_mutex_assert_owner(tsdn, tctx->tdata->lock);
-
-	malloc_mutex_lock(tsdn, tctx->gctx->lock);
-
-	switch (tctx->state) {
-	case prof_tctx_state_initializing:
-		malloc_mutex_unlock(tsdn, tctx->gctx->lock);
-		return;
-	case prof_tctx_state_nominal:
-		tctx->state = prof_tctx_state_dumping;
-		malloc_mutex_unlock(tsdn, tctx->gctx->lock);
-
-		memcpy(&tctx->dump_cnts, &tctx->cnts, sizeof(prof_cnt_t));
-
-		tdata->cnt_summed.curobjs += tctx->dump_cnts.curobjs;
-		tdata->cnt_summed.curbytes += tctx->dump_cnts.curbytes;
-		if (opt_prof_accum) {
-			tdata->cnt_summed.accumobjs +=
-			    tctx->dump_cnts.accumobjs;
-			tdata->cnt_summed.accumbytes +=
-			    tctx->dump_cnts.accumbytes;
-		}
-		break;
-	case prof_tctx_state_dumping:
-	case prof_tctx_state_purgatory:
-		not_reached();
-	}
-}
-
-static void
-prof_tctx_merge_gctx(tsdn_t *tsdn, prof_tctx_t *tctx, prof_gctx_t *gctx) {
-	malloc_mutex_assert_owner(tsdn, gctx->lock);
-
-	gctx->cnt_summed.curobjs += tctx->dump_cnts.curobjs;
-	gctx->cnt_summed.curbytes += tctx->dump_cnts.curbytes;
-	if (opt_prof_accum) {
-		gctx->cnt_summed.accumobjs += tctx->dump_cnts.accumobjs;
-		gctx->cnt_summed.accumbytes += tctx->dump_cnts.accumbytes;
-	}
-}
-
-static prof_tctx_t *
-prof_tctx_merge_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *arg) {
-	tsdn_t *tsdn = (tsdn_t *)arg;
-
-	malloc_mutex_assert_owner(tsdn, tctx->gctx->lock);
-
-	switch (tctx->state) {
-	case prof_tctx_state_nominal:
-		/* New since dumping started; ignore. */
-		break;
-	case prof_tctx_state_dumping:
-	case prof_tctx_state_purgatory:
-		prof_tctx_merge_gctx(tsdn, tctx, tctx->gctx);
-		break;
-	default:
-		not_reached();
-	}
-
-	return NULL;
-}
-
-struct prof_tctx_dump_iter_arg_s {
-	tsdn_t	*tsdn;
-	bool	propagate_err;
-};
-
-static prof_tctx_t *
-prof_tctx_dump_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *opaque) {
-	struct prof_tctx_dump_iter_arg_s *arg =
-	    (struct prof_tctx_dump_iter_arg_s *)opaque;
-
-	malloc_mutex_assert_owner(arg->tsdn, tctx->gctx->lock);
-
-	switch (tctx->state) {
-	case prof_tctx_state_initializing:
-	case prof_tctx_state_nominal:
-		/* Not captured by this dump. */
-		break;
-	case prof_tctx_state_dumping:
-	case prof_tctx_state_purgatory:
-		if (prof_dump_printf(arg->propagate_err,
-		    "  t%"FMTu64": %"FMTu64": %"FMTu64" [%"FMTu64": "
-		    "%"FMTu64"]\n", tctx->thr_uid, tctx->dump_cnts.curobjs,
-		    tctx->dump_cnts.curbytes, tctx->dump_cnts.accumobjs,
-		    tctx->dump_cnts.accumbytes)) {
-			return tctx;
-		}
-		break;
-	default:
-		not_reached();
-	}
-	return NULL;
-}
-
-static prof_tctx_t *
-prof_tctx_finish_iter(prof_tctx_tree_t *tctxs, prof_tctx_t *tctx, void *arg) {
-	tsdn_t *tsdn = (tsdn_t *)arg;
-	prof_tctx_t *ret;
-
-	malloc_mutex_assert_owner(tsdn, tctx->gctx->lock);
-
-	switch (tctx->state) {
-	case prof_tctx_state_nominal:
-		/* New since dumping started; ignore. */
-		break;
-	case prof_tctx_state_dumping:
-		tctx->state = prof_tctx_state_nominal;
-		break;
-	case prof_tctx_state_purgatory:
-		ret = tctx;
-		goto label_return;
-	default:
-		not_reached();
-	}
-
-	ret = NULL;
-label_return:
-	return ret;
-}
-
-static void
-prof_dump_gctx_prep(tsdn_t *tsdn, prof_gctx_t *gctx, prof_gctx_tree_t *gctxs) {
-	cassert(config_prof);
-
-	malloc_mutex_lock(tsdn, gctx->lock);
-
-	/*
-	 * Increment nlimbo so that gctx won't go away before dump.
-	 * Additionally, link gctx into the dump list so that it is included in
-	 * prof_dump()'s second pass.
-	 */
-	gctx->nlimbo++;
-	gctx_tree_insert(gctxs, gctx);
-
-	memset(&gctx->cnt_summed, 0, sizeof(prof_cnt_t));
-
-	malloc_mutex_unlock(tsdn, gctx->lock);
-}
-
-struct prof_gctx_merge_iter_arg_s {
-	tsdn_t	*tsdn;
-	size_t	leak_ngctx;
-};
-
-static prof_gctx_t *
-prof_gctx_merge_iter(prof_gctx_tree_t *gctxs, prof_gctx_t *gctx, void *opaque) {
-	struct prof_gctx_merge_iter_arg_s *arg =
-	    (struct prof_gctx_merge_iter_arg_s *)opaque;
-
-	malloc_mutex_lock(arg->tsdn, gctx->lock);
-	tctx_tree_iter(&gctx->tctxs, NULL, prof_tctx_merge_iter,
-	    (void *)arg->tsdn);
-	if (gctx->cnt_summed.curobjs != 0) {
-		arg->leak_ngctx++;
-	}
-	malloc_mutex_unlock(arg->tsdn, gctx->lock);
-
-	return NULL;
-}
-
-static void
-prof_gctx_finish(tsd_t *tsd, prof_gctx_tree_t *gctxs) {
-	prof_tdata_t *tdata = prof_tdata_get(tsd, false);
-	prof_gctx_t *gctx;
-
-	/*
-	 * Standard tree iteration won't work here, because as soon as we
-	 * decrement gctx->nlimbo and unlock gctx, another thread can
-	 * concurrently destroy it, which will corrupt the tree.  Therefore,
-	 * tear down the tree one node at a time during iteration.
-	 */
-	while ((gctx = gctx_tree_first(gctxs)) != NULL) {
-		gctx_tree_remove(gctxs, gctx);
-		malloc_mutex_lock(tsd_tsdn(tsd), gctx->lock);
-		{
-			prof_tctx_t *next;
-
-			next = NULL;
-			do {
-				prof_tctx_t *to_destroy =
-				    tctx_tree_iter(&gctx->tctxs, next,
-				    prof_tctx_finish_iter,
-				    (void *)tsd_tsdn(tsd));
-				if (to_destroy != NULL) {
-					next = tctx_tree_next(&gctx->tctxs,
-					    to_destroy);
-					tctx_tree_remove(&gctx->tctxs,
-					    to_destroy);
-					idalloctm(tsd_tsdn(tsd), to_destroy,
-					    NULL, NULL, true, true);
-				} else {
-					next = NULL;
-				}
-			} while (next != NULL);
-		}
-		gctx->nlimbo--;
-		if (prof_gctx_should_destroy(gctx)) {
-			gctx->nlimbo++;
-			malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-			prof_gctx_try_destroy(tsd, tdata, gctx, tdata);
-		} else {
-			malloc_mutex_unlock(tsd_tsdn(tsd), gctx->lock);
-		}
-	}
-}
-
-struct prof_tdata_merge_iter_arg_s {
-	tsdn_t		*tsdn;
-	prof_cnt_t	cnt_all;
-};
-
-static prof_tdata_t *
-prof_tdata_merge_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
-    void *opaque) {
-	struct prof_tdata_merge_iter_arg_s *arg =
-	    (struct prof_tdata_merge_iter_arg_s *)opaque;
-
-	malloc_mutex_lock(arg->tsdn, tdata->lock);
-	if (!tdata->expired) {
-		size_t tabind;
-		union {
-			prof_tctx_t	*p;
-			void		*v;
-		} tctx;
-
-		tdata->dumping = true;
-		memset(&tdata->cnt_summed, 0, sizeof(prof_cnt_t));
-		for (tabind = 0; !ckh_iter(&tdata->bt2tctx, &tabind, NULL,
-		    &tctx.v);) {
-			prof_tctx_merge_tdata(arg->tsdn, tctx.p, tdata);
-		}
-
-		arg->cnt_all.curobjs += tdata->cnt_summed.curobjs;
-		arg->cnt_all.curbytes += tdata->cnt_summed.curbytes;
-		if (opt_prof_accum) {
-			arg->cnt_all.accumobjs += tdata->cnt_summed.accumobjs;
-			arg->cnt_all.accumbytes += tdata->cnt_summed.accumbytes;
-		}
-	} else {
-		tdata->dumping = false;
-	}
-	malloc_mutex_unlock(arg->tsdn, tdata->lock);
-
-	return NULL;
-}
-
-static prof_tdata_t *
-prof_tdata_dump_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
-    void *arg) {
-	bool propagate_err = *(bool *)arg;
-
-	if (!tdata->dumping) {
-		return NULL;
-	}
-
-	if (prof_dump_printf(propagate_err,
-	    "  t%"FMTu64": %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]%s%s\n",
-	    tdata->thr_uid, tdata->cnt_summed.curobjs,
-	    tdata->cnt_summed.curbytes, tdata->cnt_summed.accumobjs,
-	    tdata->cnt_summed.accumbytes,
-	    (tdata->thread_name != NULL) ? " " : "",
-	    (tdata->thread_name != NULL) ? tdata->thread_name : "")) {
-		return tdata;
-	}
-	return NULL;
-}
-
-static bool
-prof_dump_header_impl(tsdn_t *tsdn, bool propagate_err,
-    const prof_cnt_t *cnt_all) {
-	bool ret;
-
-	if (prof_dump_printf(propagate_err,
-	    "heap_v2/%"FMTu64"\n"
-	    "  t*: %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]\n",
-	    ((uint64_t)1U << lg_prof_sample), cnt_all->curobjs,
-	    cnt_all->curbytes, cnt_all->accumobjs, cnt_all->accumbytes)) {
-		return true;
-	}
-
-	malloc_mutex_lock(tsdn, &tdatas_mtx);
-	ret = (tdata_tree_iter(&tdatas, NULL, prof_tdata_dump_iter,
-	    (void *)&propagate_err) != NULL);
-	malloc_mutex_unlock(tsdn, &tdatas_mtx);
-	return ret;
-}
-prof_dump_header_t *JET_MUTABLE prof_dump_header = prof_dump_header_impl;
-
-static bool
-prof_dump_gctx(tsdn_t *tsdn, bool propagate_err, prof_gctx_t *gctx,
-    const prof_bt_t *bt, prof_gctx_tree_t *gctxs) {
-	bool ret;
-	unsigned i;
-	struct prof_tctx_dump_iter_arg_s prof_tctx_dump_iter_arg;
-
-	cassert(config_prof);
-	malloc_mutex_assert_owner(tsdn, gctx->lock);
-
-	/* Avoid dumping such gctx's that have no useful data. */
-	if ((!opt_prof_accum && gctx->cnt_summed.curobjs == 0) ||
-	    (opt_prof_accum && gctx->cnt_summed.accumobjs == 0)) {
-		assert(gctx->cnt_summed.curobjs == 0);
-		assert(gctx->cnt_summed.curbytes == 0);
-		assert(gctx->cnt_summed.accumobjs == 0);
-		assert(gctx->cnt_summed.accumbytes == 0);
-		ret = false;
-		goto label_return;
-	}
-
-	if (prof_dump_printf(propagate_err, "@")) {
-		ret = true;
-		goto label_return;
-	}
-	for (i = 0; i < bt->len; i++) {
-		if (prof_dump_printf(propagate_err, " %#"FMTxPTR,
-		    (uintptr_t)bt->vec[i])) {
-			ret = true;
-			goto label_return;
-		}
-	}
-
-	if (prof_dump_printf(propagate_err,
-	    "\n"
-	    "  t*: %"FMTu64": %"FMTu64" [%"FMTu64": %"FMTu64"]\n",
-	    gctx->cnt_summed.curobjs, gctx->cnt_summed.curbytes,
-	    gctx->cnt_summed.accumobjs, gctx->cnt_summed.accumbytes)) {
-		ret = true;
-		goto label_return;
-	}
-
-	prof_tctx_dump_iter_arg.tsdn = tsdn;
-	prof_tctx_dump_iter_arg.propagate_err = propagate_err;
-	if (tctx_tree_iter(&gctx->tctxs, NULL, prof_tctx_dump_iter,
-	    (void *)&prof_tctx_dump_iter_arg) != NULL) {
-		ret = true;
-		goto label_return;
-	}
-
-	ret = false;
-label_return:
-	return ret;
-}
-
-#ifndef _WIN32
-JEMALLOC_FORMAT_PRINTF(1, 2)
-static int
-prof_open_maps(const char *format, ...) {
-	int mfd;
-	va_list ap;
-	char filename[PATH_MAX + 1];
-
-	va_start(ap, format);
-	malloc_vsnprintf(filename, sizeof(filename), format, ap);
-	va_end(ap);
-
-#if defined(O_CLOEXEC)
-	mfd = open(filename, O_RDONLY | O_CLOEXEC);
-#else
-	mfd = open(filename, O_RDONLY);
-	if (mfd != -1) {
-		fcntl(mfd, F_SETFD, fcntl(mfd, F_GETFD) | FD_CLOEXEC);
-	}
-#endif
-
-	return mfd;
-}
-#endif
-
-static int
-prof_getpid(void) {
-#ifdef _WIN32
-	return GetCurrentProcessId();
-#else
-	return getpid();
-#endif
-}
-
-static bool
-prof_dump_maps(bool propagate_err) {
-	bool ret;
-	int mfd;
-
-	cassert(config_prof);
-#ifdef __FreeBSD__
-	mfd = prof_open_maps("/proc/curproc/map");
-#elif defined(_WIN32)
-	mfd = -1; // Not implemented
-#else
-	{
-		int pid = prof_getpid();
-
-		mfd = prof_open_maps("/proc/%d/task/%d/maps", pid, pid);
-		if (mfd == -1) {
-			mfd = prof_open_maps("/proc/%d/maps", pid);
-		}
-	}
-#endif
-	if (mfd != -1) {
-		ssize_t nread;
-
-		if (prof_dump_write(propagate_err, "\nMAPPED_LIBRARIES:\n") &&
-		    propagate_err) {
-			ret = true;
-			goto label_return;
-		}
-		nread = 0;
-		do {
-			prof_dump_buf_end += nread;
-			if (prof_dump_buf_end == PROF_DUMP_BUFSIZE) {
-				/* Make space in prof_dump_buf before read(). */
-				if (prof_dump_flush(propagate_err) &&
-				    propagate_err) {
-					ret = true;
-					goto label_return;
-				}
-			}
-			nread = malloc_read_fd(mfd,
-			    &prof_dump_buf[prof_dump_buf_end], PROF_DUMP_BUFSIZE
-			    - prof_dump_buf_end);
-		} while (nread > 0);
-	} else {
-		ret = true;
-		goto label_return;
-	}
-
-	ret = false;
-label_return:
-	if (mfd != -1) {
-		close(mfd);
-	}
-	return ret;
-}
-
-/*
- * See prof_sample_threshold_update() comment for why the body of this function
- * is conditionally compiled.
- */
-static void
-prof_leakcheck(const prof_cnt_t *cnt_all, size_t leak_ngctx,
-    const char *filename) {
-#ifdef JEMALLOC_PROF
-	/*
-	 * Scaling is equivalent AdjustSamples() in jeprof, but the result may
-	 * differ slightly from what jeprof reports, because here we scale the
-	 * summary values, whereas jeprof scales each context individually and
-	 * reports the sums of the scaled values.
-	 */
-	if (cnt_all->curbytes != 0) {
-		double sample_period = (double)((uint64_t)1 << lg_prof_sample);
-		double ratio = (((double)cnt_all->curbytes) /
-		    (double)cnt_all->curobjs) / sample_period;
-		double scale_factor = 1.0 / (1.0 - exp(-ratio));
-		uint64_t curbytes = (uint64_t)round(((double)cnt_all->curbytes)
-		    * scale_factor);
-		uint64_t curobjs = (uint64_t)round(((double)cnt_all->curobjs) *
-		    scale_factor);
-
-		malloc_printf("<jemalloc>: Leak approximation summary: ~%"FMTu64
-		    " byte%s, ~%"FMTu64" object%s, >= %zu context%s\n",
-		    curbytes, (curbytes != 1) ? "s" : "", curobjs, (curobjs !=
-		    1) ? "s" : "", leak_ngctx, (leak_ngctx != 1) ? "s" : "");
-		malloc_printf(
-		    "<jemalloc>: Run jeprof on \"%s\" for leak detail\n",
-		    filename);
-	}
-#endif
-}
-
-struct prof_gctx_dump_iter_arg_s {
-	tsdn_t	*tsdn;
-	bool	propagate_err;
-};
-
-static prof_gctx_t *
-prof_gctx_dump_iter(prof_gctx_tree_t *gctxs, prof_gctx_t *gctx, void *opaque) {
-	prof_gctx_t *ret;
-	struct prof_gctx_dump_iter_arg_s *arg =
-	    (struct prof_gctx_dump_iter_arg_s *)opaque;
-
-	malloc_mutex_lock(arg->tsdn, gctx->lock);
-
-	if (prof_dump_gctx(arg->tsdn, arg->propagate_err, gctx, &gctx->bt,
-	    gctxs)) {
-		ret = gctx;
-		goto label_return;
-	}
-
-	ret = NULL;
-label_return:
-	malloc_mutex_unlock(arg->tsdn, gctx->lock);
-	return ret;
-}
-
-static void
-prof_dump_prep(tsd_t *tsd, prof_tdata_t *tdata,
-    struct prof_tdata_merge_iter_arg_s *prof_tdata_merge_iter_arg,
-    struct prof_gctx_merge_iter_arg_s *prof_gctx_merge_iter_arg,
-    prof_gctx_tree_t *gctxs) {
-	size_t tabind;
-	union {
-		prof_gctx_t	*p;
-		void		*v;
-	} gctx;
-
-	prof_enter(tsd, tdata);
-
-	/*
-	 * Put gctx's in limbo and clear their counters in preparation for
-	 * summing.
-	 */
-	gctx_tree_new(gctxs);
-	for (tabind = 0; !ckh_iter(&bt2gctx, &tabind, NULL, &gctx.v);) {
-		prof_dump_gctx_prep(tsd_tsdn(tsd), gctx.p, gctxs);
-	}
-
-	/*
-	 * Iterate over tdatas, and for the non-expired ones snapshot their tctx
-	 * stats and merge them into the associated gctx's.
-	 */
-	prof_tdata_merge_iter_arg->tsdn = tsd_tsdn(tsd);
-	memset(&prof_tdata_merge_iter_arg->cnt_all, 0, sizeof(prof_cnt_t));
-	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
-	tdata_tree_iter(&tdatas, NULL, prof_tdata_merge_iter,
-	    (void *)prof_tdata_merge_iter_arg);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
-
-	/* Merge tctx stats into gctx's. */
-	prof_gctx_merge_iter_arg->tsdn = tsd_tsdn(tsd);
-	prof_gctx_merge_iter_arg->leak_ngctx = 0;
-	gctx_tree_iter(gctxs, NULL, prof_gctx_merge_iter,
-	    (void *)prof_gctx_merge_iter_arg);
-
-	prof_leave(tsd, tdata);
-}
-
-static bool
-prof_dump_file(tsd_t *tsd, bool propagate_err, const char *filename,
-    bool leakcheck, prof_tdata_t *tdata,
-    struct prof_tdata_merge_iter_arg_s *prof_tdata_merge_iter_arg,
-    struct prof_gctx_merge_iter_arg_s *prof_gctx_merge_iter_arg,
-    struct prof_gctx_dump_iter_arg_s *prof_gctx_dump_iter_arg,
-    prof_gctx_tree_t *gctxs) {
-	/* Create dump file. */
-	if ((prof_dump_fd = prof_dump_open(propagate_err, filename)) == -1) {
-		return true;
-	}
-
-	/* Dump profile header. */
-	if (prof_dump_header(tsd_tsdn(tsd), propagate_err,
-	    &prof_tdata_merge_iter_arg->cnt_all)) {
-		goto label_write_error;
-	}
-
-	/* Dump per gctx profile stats. */
-	prof_gctx_dump_iter_arg->tsdn = tsd_tsdn(tsd);
-	prof_gctx_dump_iter_arg->propagate_err = propagate_err;
-	if (gctx_tree_iter(gctxs, NULL, prof_gctx_dump_iter,
-	    (void *)prof_gctx_dump_iter_arg) != NULL) {
-		goto label_write_error;
-	}
-
-	/* Dump /proc/<pid>/maps if possible. */
-	if (prof_dump_maps(propagate_err)) {
-		goto label_write_error;
-	}
-
-	if (prof_dump_close(propagate_err)) {
-		return true;
-	}
-
-	return false;
-label_write_error:
-	prof_dump_close(propagate_err);
-	return true;
-}
-
-static bool
-prof_dump(tsd_t *tsd, bool propagate_err, const char *filename,
-    bool leakcheck) {
-	cassert(config_prof);
-	assert(tsd_reentrancy_level_get(tsd) == 0);
-
-	prof_tdata_t * tdata = prof_tdata_get(tsd, true);
-	if (tdata == NULL) {
-		return true;
-	}
-
-	pre_reentrancy(tsd, NULL);
-	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_mtx);
-
-	prof_gctx_tree_t gctxs;
-	struct prof_tdata_merge_iter_arg_s prof_tdata_merge_iter_arg;
-	struct prof_gctx_merge_iter_arg_s prof_gctx_merge_iter_arg;
-	struct prof_gctx_dump_iter_arg_s prof_gctx_dump_iter_arg;
-	prof_dump_prep(tsd, tdata, &prof_tdata_merge_iter_arg,
-	    &prof_gctx_merge_iter_arg, &gctxs);
-	bool err = prof_dump_file(tsd, propagate_err, filename, leakcheck, tdata,
-	    &prof_tdata_merge_iter_arg, &prof_gctx_merge_iter_arg,
-	    &prof_gctx_dump_iter_arg, &gctxs);
-	prof_gctx_finish(tsd, &gctxs);
-
-	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_mtx);
-	post_reentrancy(tsd);
-
-	if (err) {
-		return true;
-	}
-
-	if (leakcheck) {
-		prof_leakcheck(&prof_tdata_merge_iter_arg.cnt_all,
-		    prof_gctx_merge_iter_arg.leak_ngctx, filename);
-	}
-	return false;
-}
-
-#ifdef JEMALLOC_JET
-void
-prof_cnt_all(uint64_t *curobjs, uint64_t *curbytes, uint64_t *accumobjs,
-    uint64_t *accumbytes) {
-	tsd_t *tsd;
-	prof_tdata_t *tdata;
-	struct prof_tdata_merge_iter_arg_s prof_tdata_merge_iter_arg;
-	struct prof_gctx_merge_iter_arg_s prof_gctx_merge_iter_arg;
-	prof_gctx_tree_t gctxs;
-
-	tsd = tsd_fetch();
-	tdata = prof_tdata_get(tsd, false);
-	if (tdata == NULL) {
-		if (curobjs != NULL) {
-			*curobjs = 0;
-		}
-		if (curbytes != NULL) {
-			*curbytes = 0;
-		}
-		if (accumobjs != NULL) {
-			*accumobjs = 0;
-		}
-		if (accumbytes != NULL) {
-			*accumbytes = 0;
-		}
-		return;
-	}
-
-	prof_dump_prep(tsd, tdata, &prof_tdata_merge_iter_arg,
-	    &prof_gctx_merge_iter_arg, &gctxs);
-	prof_gctx_finish(tsd, &gctxs);
-
-	if (curobjs != NULL) {
-		*curobjs = prof_tdata_merge_iter_arg.cnt_all.curobjs;
-	}
-	if (curbytes != NULL) {
-		*curbytes = prof_tdata_merge_iter_arg.cnt_all.curbytes;
-	}
-	if (accumobjs != NULL) {
-		*accumobjs = prof_tdata_merge_iter_arg.cnt_all.accumobjs;
-	}
-	if (accumbytes != NULL) {
-		*accumbytes = prof_tdata_merge_iter_arg.cnt_all.accumbytes;
-	}
-}
-#endif
-
-#define DUMP_FILENAME_BUFSIZE	(PATH_MAX + 1)
-#define VSEQ_INVALID		UINT64_C(0xffffffffffffffff)
-static void
-prof_dump_filename(char *filename, char v, uint64_t vseq) {
-	cassert(config_prof);
-
-	if (vseq != VSEQ_INVALID) {
-	        /* "<prefix>.<pid>.<seq>.v<vseq>.heap" */
-		malloc_snprintf(filename, DUMP_FILENAME_BUFSIZE,
-		    "%s.%d.%"FMTu64".%c%"FMTu64".heap",
-		    opt_prof_prefix, prof_getpid(), prof_dump_seq, v, vseq);
-	} else {
-	        /* "<prefix>.<pid>.<seq>.<v>.heap" */
-		malloc_snprintf(filename, DUMP_FILENAME_BUFSIZE,
-		    "%s.%d.%"FMTu64".%c.heap",
-		    opt_prof_prefix, prof_getpid(), prof_dump_seq, v);
-	}
-	prof_dump_seq++;
-}
-
-static void
-prof_fdump(void) {
-	tsd_t *tsd;
-	char filename[DUMP_FILENAME_BUFSIZE];
-
-	cassert(config_prof);
-	assert(opt_prof_final);
-	assert(opt_prof_prefix[0] != '\0');
-
-	if (!prof_booted) {
-		return;
-	}
-	tsd = tsd_fetch();
-	assert(tsd_reentrancy_level_get(tsd) == 0);
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-	prof_dump_filename(filename, 'f', VSEQ_INVALID);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-	prof_dump(tsd, false, filename, opt_prof_leak);
-}
-
-bool
-prof_accum_init(tsdn_t *tsdn, prof_accum_t *prof_accum) {
-	cassert(config_prof);
-
-#ifndef JEMALLOC_ATOMIC_U64
-	if (malloc_mutex_init(&prof_accum->mtx, "prof_accum",
-	    WITNESS_RANK_PROF_ACCUM, malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-	prof_accum->accumbytes = 0;
-#else
-	atomic_store_u64(&prof_accum->accumbytes, 0, ATOMIC_RELAXED);
-#endif
-	return false;
-}
-
-void
-prof_idump(tsdn_t *tsdn) {
-	tsd_t *tsd;
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	if (!prof_booted || tsdn_null(tsdn) || !prof_active_get_unlocked()) {
-		return;
-	}
-	tsd = tsdn_tsd(tsdn);
-	if (tsd_reentrancy_level_get(tsd) > 0) {
-		return;
-	}
-
-	tdata = prof_tdata_get(tsd, false);
-	if (tdata == NULL) {
-		return;
-	}
-	if (tdata->enq) {
-		tdata->enq_idump = true;
-		return;
-	}
-
-	if (opt_prof_prefix[0] != '\0') {
-		char filename[PATH_MAX + 1];
-		malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-		prof_dump_filename(filename, 'i', prof_dump_iseq);
-		prof_dump_iseq++;
-		malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-		prof_dump(tsd, false, filename, false);
-	}
-}
-
-bool
-prof_mdump(tsd_t *tsd, const char *filename) {
-	cassert(config_prof);
-	assert(tsd_reentrancy_level_get(tsd) == 0);
-
-	if (!opt_prof || !prof_booted) {
-		return true;
-	}
-	char filename_buf[DUMP_FILENAME_BUFSIZE];
-	if (filename == NULL) {
-		/* No filename specified, so automatically generate one. */
-		if (opt_prof_prefix[0] == '\0') {
-			return true;
-		}
-		malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-		prof_dump_filename(filename_buf, 'm', prof_dump_mseq);
-		prof_dump_mseq++;
-		malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_seq_mtx);
-		filename = filename_buf;
-	}
-	return prof_dump(tsd, true, filename, false);
-}
-
-void
-prof_gdump(tsdn_t *tsdn) {
-	tsd_t *tsd;
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	if (!prof_booted || tsdn_null(tsdn) || !prof_active_get_unlocked()) {
-		return;
-	}
-	tsd = tsdn_tsd(tsdn);
-	if (tsd_reentrancy_level_get(tsd) > 0) {
-		return;
-	}
-
-	tdata = prof_tdata_get(tsd, false);
-	if (tdata == NULL) {
-		return;
-	}
-	if (tdata->enq) {
-		tdata->enq_gdump = true;
-		return;
-	}
-
-	if (opt_prof_prefix[0] != '\0') {
-		char filename[DUMP_FILENAME_BUFSIZE];
-		malloc_mutex_lock(tsdn, &prof_dump_seq_mtx);
-		prof_dump_filename(filename, 'u', prof_dump_useq);
-		prof_dump_useq++;
-		malloc_mutex_unlock(tsdn, &prof_dump_seq_mtx);
-		prof_dump(tsd, false, filename, false);
-	}
-}
-
-static void
-prof_bt_hash(const void *key, size_t r_hash[2]) {
-	prof_bt_t *bt = (prof_bt_t *)key;
-
-	cassert(config_prof);
-
-	hash(bt->vec, bt->len * sizeof(void *), 0x94122f33U, r_hash);
-}
-
-static bool
-prof_bt_keycomp(const void *k1, const void *k2) {
-	const prof_bt_t *bt1 = (prof_bt_t *)k1;
-	const prof_bt_t *bt2 = (prof_bt_t *)k2;
-
-	cassert(config_prof);
-
-	if (bt1->len != bt2->len) {
-		return false;
-	}
-	return (memcmp(bt1->vec, bt2->vec, bt1->len * sizeof(void *)) == 0);
-}
-
-static uint64_t
-prof_thr_uid_alloc(tsdn_t *tsdn) {
-	uint64_t thr_uid;
-
-	malloc_mutex_lock(tsdn, &next_thr_uid_mtx);
-	thr_uid = next_thr_uid;
-	next_thr_uid++;
-	malloc_mutex_unlock(tsdn, &next_thr_uid_mtx);
-
-	return thr_uid;
-}
-
-static prof_tdata_t *
-prof_tdata_init_impl(tsd_t *tsd, uint64_t thr_uid, uint64_t thr_discrim,
-    char *thread_name, bool active) {
-	prof_tdata_t *tdata;
-
-	cassert(config_prof);
-
-	/* Initialize an empty cache for this thread. */
-	tdata = (prof_tdata_t *)iallocztm(tsd_tsdn(tsd), sizeof(prof_tdata_t),
-	    sz_size2index(sizeof(prof_tdata_t)), false, NULL, true,
-	    arena_get(TSDN_NULL, 0, true), true);
-	if (tdata == NULL) {
-		return NULL;
-	}
-
-	tdata->lock = prof_tdata_mutex_choose(thr_uid);
-	tdata->thr_uid = thr_uid;
-	tdata->thr_discrim = thr_discrim;
-	tdata->thread_name = thread_name;
-	tdata->attached = true;
-	tdata->expired = false;
-	tdata->tctx_uid_next = 0;
-
-	if (ckh_new(tsd, &tdata->bt2tctx, PROF_CKH_MINITEMS, prof_bt_hash,
-	    prof_bt_keycomp)) {
-		idalloctm(tsd_tsdn(tsd), tdata, NULL, NULL, true, true);
-		return NULL;
-	}
-
-	tdata->prng_state = (uint64_t)(uintptr_t)tdata;
-	prof_sample_threshold_update(tdata);
-
-	tdata->enq = false;
-	tdata->enq_idump = false;
-	tdata->enq_gdump = false;
-
-	tdata->dumping = false;
-	tdata->active = active;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
-	tdata_tree_insert(&tdatas, tdata);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
-
-	return tdata;
-}
-
-prof_tdata_t *
-prof_tdata_init(tsd_t *tsd) {
-	return prof_tdata_init_impl(tsd, prof_thr_uid_alloc(tsd_tsdn(tsd)), 0,
-	    NULL, prof_thread_active_init_get(tsd_tsdn(tsd)));
-}
-
-static bool
-prof_tdata_should_destroy_unlocked(prof_tdata_t *tdata, bool even_if_attached) {
-	if (tdata->attached && !even_if_attached) {
-		return false;
-	}
-	if (ckh_count(&tdata->bt2tctx) != 0) {
-		return false;
-	}
-	return true;
-}
-
-static bool
-prof_tdata_should_destroy(tsdn_t *tsdn, prof_tdata_t *tdata,
-    bool even_if_attached) {
-	malloc_mutex_assert_owner(tsdn, tdata->lock);
-
-	return prof_tdata_should_destroy_unlocked(tdata, even_if_attached);
-}
-
-static void
-prof_tdata_destroy_locked(tsd_t *tsd, prof_tdata_t *tdata,
-    bool even_if_attached) {
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &tdatas_mtx);
-
-	tdata_tree_remove(&tdatas, tdata);
-
-	assert(prof_tdata_should_destroy_unlocked(tdata, even_if_attached));
-
-	if (tdata->thread_name != NULL) {
-		idalloctm(tsd_tsdn(tsd), tdata->thread_name, NULL, NULL, true,
-		    true);
-	}
-	ckh_delete(tsd, &tdata->bt2tctx);
-	idalloctm(tsd_tsdn(tsd), tdata, NULL, NULL, true, true);
-}
-
-static void
-prof_tdata_destroy(tsd_t *tsd, prof_tdata_t *tdata, bool even_if_attached) {
-	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
-	prof_tdata_destroy_locked(tsd, tdata, even_if_attached);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
-}
-
-static void
-prof_tdata_detach(tsd_t *tsd, prof_tdata_t *tdata) {
-	bool destroy_tdata;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), tdata->lock);
-	if (tdata->attached) {
-		destroy_tdata = prof_tdata_should_destroy(tsd_tsdn(tsd), tdata,
-		    true);
-		/*
-		 * Only detach if !destroy_tdata, because detaching would allow
-		 * another thread to win the race to destroy tdata.
-		 */
-		if (!destroy_tdata) {
-			tdata->attached = false;
-		}
-		tsd_prof_tdata_set(tsd, NULL);
-	} else {
-		destroy_tdata = false;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), tdata->lock);
-	if (destroy_tdata) {
-		prof_tdata_destroy(tsd, tdata, true);
-	}
-}
-
-prof_tdata_t *
-prof_tdata_reinit(tsd_t *tsd, prof_tdata_t *tdata) {
-	uint64_t thr_uid = tdata->thr_uid;
-	uint64_t thr_discrim = tdata->thr_discrim + 1;
-	char *thread_name = (tdata->thread_name != NULL) ?
-	    prof_thread_name_alloc(tsd_tsdn(tsd), tdata->thread_name) : NULL;
-	bool active = tdata->active;
-
-	prof_tdata_detach(tsd, tdata);
-	return prof_tdata_init_impl(tsd, thr_uid, thr_discrim, thread_name,
-	    active);
-}
-
-static bool
-prof_tdata_expire(tsdn_t *tsdn, prof_tdata_t *tdata) {
-	bool destroy_tdata;
-
-	malloc_mutex_lock(tsdn, tdata->lock);
-	if (!tdata->expired) {
-		tdata->expired = true;
-		destroy_tdata = tdata->attached ? false :
-		    prof_tdata_should_destroy(tsdn, tdata, false);
-	} else {
-		destroy_tdata = false;
-	}
-	malloc_mutex_unlock(tsdn, tdata->lock);
-
-	return destroy_tdata;
-}
-
-static prof_tdata_t *
-prof_tdata_reset_iter(prof_tdata_tree_t *tdatas, prof_tdata_t *tdata,
-    void *arg) {
-	tsdn_t *tsdn = (tsdn_t *)arg;
-
-	return (prof_tdata_expire(tsdn, tdata) ? tdata : NULL);
-}
-
-void
-prof_reset(tsd_t *tsd, size_t lg_sample) {
-	prof_tdata_t *next;
-
-	assert(lg_sample < (sizeof(uint64_t) << 3));
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &prof_dump_mtx);
-	malloc_mutex_lock(tsd_tsdn(tsd), &tdatas_mtx);
-
-	lg_prof_sample = lg_sample;
-
-	next = NULL;
-	do {
-		prof_tdata_t *to_destroy = tdata_tree_iter(&tdatas, next,
-		    prof_tdata_reset_iter, (void *)tsd);
-		if (to_destroy != NULL) {
-			next = tdata_tree_next(&tdatas, to_destroy);
-			prof_tdata_destroy_locked(tsd, to_destroy, false);
-		} else {
-			next = NULL;
-		}
-	} while (next != NULL);
-
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tdatas_mtx);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &prof_dump_mtx);
-}
-
-void
-prof_tdata_cleanup(tsd_t *tsd) {
-	prof_tdata_t *tdata;
-
-	if (!config_prof) {
-		return;
-	}
-
-	tdata = tsd_prof_tdata_get(tsd);
-	if (tdata != NULL) {
-		prof_tdata_detach(tsd, tdata);
-	}
-}
-
-bool
-prof_active_get(tsdn_t *tsdn) {
-	bool prof_active_current;
-
-	malloc_mutex_lock(tsdn, &prof_active_mtx);
-	prof_active_current = prof_active;
-	malloc_mutex_unlock(tsdn, &prof_active_mtx);
-	return prof_active_current;
-}
-
-bool
-prof_active_set(tsdn_t *tsdn, bool active) {
-	bool prof_active_old;
-
-	malloc_mutex_lock(tsdn, &prof_active_mtx);
-	prof_active_old = prof_active;
-	prof_active = active;
-	malloc_mutex_unlock(tsdn, &prof_active_mtx);
-	return prof_active_old;
-}
-
-const char *
-prof_thread_name_get(tsd_t *tsd) {
-	prof_tdata_t *tdata;
-
-	tdata = prof_tdata_get(tsd, true);
-	if (tdata == NULL) {
-		return "";
-	}
-	return (tdata->thread_name != NULL ? tdata->thread_name : "");
-}
-
-static char *
-prof_thread_name_alloc(tsdn_t *tsdn, const char *thread_name) {
-	char *ret;
-	size_t size;
-
-	if (thread_name == NULL) {
-		return NULL;
-	}
-
-	size = strlen(thread_name) + 1;
-	if (size == 1) {
-		return "";
-	}
-
-	ret = iallocztm(tsdn, size, sz_size2index(size), false, NULL, true,
-	    arena_get(TSDN_NULL, 0, true), true);
-	if (ret == NULL) {
-		return NULL;
-	}
-	memcpy(ret, thread_name, size);
-	return ret;
-}
-
-int
-prof_thread_name_set(tsd_t *tsd, const char *thread_name) {
-	prof_tdata_t *tdata;
-	unsigned i;
-	char *s;
-
-	tdata = prof_tdata_get(tsd, true);
-	if (tdata == NULL) {
-		return EAGAIN;
-	}
-
-	/* Validate input. */
-	if (thread_name == NULL) {
-		return EFAULT;
-	}
-	for (i = 0; thread_name[i] != '\0'; i++) {
-		char c = thread_name[i];
-		if (!isgraph(c) && !isblank(c)) {
-			return EFAULT;
-		}
-	}
-
-	s = prof_thread_name_alloc(tsd_tsdn(tsd), thread_name);
-	if (s == NULL) {
-		return EAGAIN;
-	}
-
-	if (tdata->thread_name != NULL) {
-		idalloctm(tsd_tsdn(tsd), tdata->thread_name, NULL, NULL, true,
-		    true);
-		tdata->thread_name = NULL;
-	}
-	if (strlen(s) > 0) {
-		tdata->thread_name = s;
-	}
-	return 0;
-}
-
-bool
-prof_thread_active_get(tsd_t *tsd) {
-	prof_tdata_t *tdata;
-
-	tdata = prof_tdata_get(tsd, true);
-	if (tdata == NULL) {
-		return false;
-	}
-	return tdata->active;
-}
-
-bool
-prof_thread_active_set(tsd_t *tsd, bool active) {
-	prof_tdata_t *tdata;
-
-	tdata = prof_tdata_get(tsd, true);
-	if (tdata == NULL) {
-		return true;
-	}
-	tdata->active = active;
-	return false;
-}
-
-bool
-prof_thread_active_init_get(tsdn_t *tsdn) {
-	bool active_init;
-
-	malloc_mutex_lock(tsdn, &prof_thread_active_init_mtx);
-	active_init = prof_thread_active_init;
-	malloc_mutex_unlock(tsdn, &prof_thread_active_init_mtx);
-	return active_init;
-}
-
-bool
-prof_thread_active_init_set(tsdn_t *tsdn, bool active_init) {
-	bool active_init_old;
-
-	malloc_mutex_lock(tsdn, &prof_thread_active_init_mtx);
-	active_init_old = prof_thread_active_init;
-	prof_thread_active_init = active_init;
-	malloc_mutex_unlock(tsdn, &prof_thread_active_init_mtx);
-	return active_init_old;
-}
-
-bool
-prof_gdump_get(tsdn_t *tsdn) {
-	bool prof_gdump_current;
-
-	malloc_mutex_lock(tsdn, &prof_gdump_mtx);
-	prof_gdump_current = prof_gdump_val;
-	malloc_mutex_unlock(tsdn, &prof_gdump_mtx);
-	return prof_gdump_current;
-}
-
-bool
-prof_gdump_set(tsdn_t *tsdn, bool gdump) {
-	bool prof_gdump_old;
-
-	malloc_mutex_lock(tsdn, &prof_gdump_mtx);
-	prof_gdump_old = prof_gdump_val;
-	prof_gdump_val = gdump;
-	malloc_mutex_unlock(tsdn, &prof_gdump_mtx);
-	return prof_gdump_old;
-}
-
-void
-prof_boot0(void) {
-	cassert(config_prof);
-
-	memcpy(opt_prof_prefix, PROF_PREFIX_DEFAULT,
-	    sizeof(PROF_PREFIX_DEFAULT));
-}
-
-void
-prof_boot1(void) {
-	cassert(config_prof);
-
-	/*
-	 * opt_prof must be in its final state before any arenas are
-	 * initialized, so this function must be executed early.
-	 */
-
-	if (opt_prof_leak && !opt_prof) {
-		/*
-		 * Enable opt_prof, but in such a way that profiles are never
-		 * automatically dumped.
-		 */
-		opt_prof = true;
-		opt_prof_gdump = false;
-	} else if (opt_prof) {
-		if (opt_lg_prof_interval >= 0) {
-			prof_interval = (((uint64_t)1U) <<
-			    opt_lg_prof_interval);
-		}
-	}
-}
-
-bool
-prof_boot2(tsd_t *tsd) {
-	cassert(config_prof);
-
-	if (opt_prof) {
-		unsigned i;
-
-		lg_prof_sample = opt_lg_prof_sample;
-
-		prof_active = opt_prof_active;
-		if (malloc_mutex_init(&prof_active_mtx, "prof_active",
-		    WITNESS_RANK_PROF_ACTIVE, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		prof_gdump_val = opt_prof_gdump;
-		if (malloc_mutex_init(&prof_gdump_mtx, "prof_gdump",
-		    WITNESS_RANK_PROF_GDUMP, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		prof_thread_active_init = opt_prof_thread_active_init;
-		if (malloc_mutex_init(&prof_thread_active_init_mtx,
-		    "prof_thread_active_init",
-		    WITNESS_RANK_PROF_THREAD_ACTIVE_INIT,
-		    malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		if (ckh_new(tsd, &bt2gctx, PROF_CKH_MINITEMS, prof_bt_hash,
-		    prof_bt_keycomp)) {
-			return true;
-		}
-		if (malloc_mutex_init(&bt2gctx_mtx, "prof_bt2gctx",
-		    WITNESS_RANK_PROF_BT2GCTX, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		tdata_tree_new(&tdatas);
-		if (malloc_mutex_init(&tdatas_mtx, "prof_tdatas",
-		    WITNESS_RANK_PROF_TDATAS, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		next_thr_uid = 0;
-		if (malloc_mutex_init(&next_thr_uid_mtx, "prof_next_thr_uid",
-		    WITNESS_RANK_PROF_NEXT_THR_UID, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		if (malloc_mutex_init(&prof_dump_seq_mtx, "prof_dump_seq",
-		    WITNESS_RANK_PROF_DUMP_SEQ, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-		if (malloc_mutex_init(&prof_dump_mtx, "prof_dump",
-		    WITNESS_RANK_PROF_DUMP, malloc_mutex_rank_exclusive)) {
-			return true;
-		}
-
-		if (opt_prof_final && opt_prof_prefix[0] != '\0' &&
-		    atexit(prof_fdump) != 0) {
-			malloc_write("<jemalloc>: Error in atexit()\n");
-			if (opt_abort) {
-				abort();
-			}
-		}
-
-		gctx_locks = (malloc_mutex_t *)base_alloc(tsd_tsdn(tsd),
-		    b0get(), PROF_NCTX_LOCKS * sizeof(malloc_mutex_t),
-		    CACHELINE);
-		if (gctx_locks == NULL) {
-			return true;
-		}
-		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
-			if (malloc_mutex_init(&gctx_locks[i], "prof_gctx",
-			    WITNESS_RANK_PROF_GCTX,
-			    malloc_mutex_rank_exclusive)) {
-				return true;
-			}
-		}
-
-		tdata_locks = (malloc_mutex_t *)base_alloc(tsd_tsdn(tsd),
-		    b0get(), PROF_NTDATA_LOCKS * sizeof(malloc_mutex_t),
-		    CACHELINE);
-		if (tdata_locks == NULL) {
-			return true;
-		}
-		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
-			if (malloc_mutex_init(&tdata_locks[i], "prof_tdata",
-			    WITNESS_RANK_PROF_TDATA,
-			    malloc_mutex_rank_exclusive)) {
-				return true;
-			}
-		}
-	}
-
-#ifdef JEMALLOC_PROF_LIBGCC
-	/*
-	 * Cause the backtracing machinery to allocate its internal state
-	 * before enabling profiling.
-	 */
-	_Unwind_Backtrace(prof_unwind_init_callback, NULL);
-#endif
-
-	prof_booted = true;
-
-	return false;
-}
-
-void
-prof_prefork0(tsdn_t *tsdn) {
-	if (config_prof && opt_prof) {
-		unsigned i;
-
-		malloc_mutex_prefork(tsdn, &prof_dump_mtx);
-		malloc_mutex_prefork(tsdn, &bt2gctx_mtx);
-		malloc_mutex_prefork(tsdn, &tdatas_mtx);
-		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
-			malloc_mutex_prefork(tsdn, &tdata_locks[i]);
-		}
-		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
-			malloc_mutex_prefork(tsdn, &gctx_locks[i]);
-		}
-	}
-}
-
-void
-prof_prefork1(tsdn_t *tsdn) {
-	if (config_prof && opt_prof) {
-		malloc_mutex_prefork(tsdn, &prof_active_mtx);
-		malloc_mutex_prefork(tsdn, &prof_dump_seq_mtx);
-		malloc_mutex_prefork(tsdn, &prof_gdump_mtx);
-		malloc_mutex_prefork(tsdn, &next_thr_uid_mtx);
-		malloc_mutex_prefork(tsdn, &prof_thread_active_init_mtx);
-	}
-}
-
-void
-prof_postfork_parent(tsdn_t *tsdn) {
-	if (config_prof && opt_prof) {
-		unsigned i;
-
-		malloc_mutex_postfork_parent(tsdn,
-		    &prof_thread_active_init_mtx);
-		malloc_mutex_postfork_parent(tsdn, &next_thr_uid_mtx);
-		malloc_mutex_postfork_parent(tsdn, &prof_gdump_mtx);
-		malloc_mutex_postfork_parent(tsdn, &prof_dump_seq_mtx);
-		malloc_mutex_postfork_parent(tsdn, &prof_active_mtx);
-		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
-			malloc_mutex_postfork_parent(tsdn, &gctx_locks[i]);
-		}
-		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
-			malloc_mutex_postfork_parent(tsdn, &tdata_locks[i]);
-		}
-		malloc_mutex_postfork_parent(tsdn, &tdatas_mtx);
-		malloc_mutex_postfork_parent(tsdn, &bt2gctx_mtx);
-		malloc_mutex_postfork_parent(tsdn, &prof_dump_mtx);
-	}
-}
-
-void
-prof_postfork_child(tsdn_t *tsdn) {
-	if (config_prof && opt_prof) {
-		unsigned i;
-
-		malloc_mutex_postfork_child(tsdn, &prof_thread_active_init_mtx);
-		malloc_mutex_postfork_child(tsdn, &next_thr_uid_mtx);
-		malloc_mutex_postfork_child(tsdn, &prof_gdump_mtx);
-		malloc_mutex_postfork_child(tsdn, &prof_dump_seq_mtx);
-		malloc_mutex_postfork_child(tsdn, &prof_active_mtx);
-		for (i = 0; i < PROF_NCTX_LOCKS; i++) {
-			malloc_mutex_postfork_child(tsdn, &gctx_locks[i]);
-		}
-		for (i = 0; i < PROF_NTDATA_LOCKS; i++) {
-			malloc_mutex_postfork_child(tsdn, &tdata_locks[i]);
-		}
-		malloc_mutex_postfork_child(tsdn, &tdatas_mtx);
-		malloc_mutex_postfork_child(tsdn, &bt2gctx_mtx);
-		malloc_mutex_postfork_child(tsdn, &prof_dump_mtx);
-	}
-}
-
-/******************************************************************************/
diff --git a/redis-stable/deps/jemalloc/src/rtree.c b/redis-stable/deps/jemalloc/src/rtree.c
deleted file mode 100644
index 53702cf7..00000000
--- a/redis-stable/deps/jemalloc/src/rtree.c
+++ /dev/null
@@ -1,320 +0,0 @@
-#define JEMALLOC_RTREE_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/mutex.h"
-
-/*
- * Only the most significant bits of keys passed to rtree_{read,write}() are
- * used.
- */
-bool
-rtree_new(rtree_t *rtree, bool zeroed) {
-#ifdef JEMALLOC_JET
-	if (!zeroed) {
-		memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */
-	}
-#else
-	assert(zeroed);
-#endif
-
-	if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-
-	return false;
-}
-
-static rtree_node_elm_t *
-rtree_node_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
-	return (rtree_node_elm_t *)base_alloc(tsdn, b0get(), nelms *
-	    sizeof(rtree_node_elm_t), CACHELINE);
-}
-rtree_node_alloc_t *JET_MUTABLE rtree_node_alloc = rtree_node_alloc_impl;
-
-static void
-rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) {
-	/* Nodes are never deleted during normal operation. */
-	not_reached();
-}
-UNUSED rtree_node_dalloc_t *JET_MUTABLE rtree_node_dalloc =
-    rtree_node_dalloc_impl;
-
-static rtree_leaf_elm_t *
-rtree_leaf_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
-	return (rtree_leaf_elm_t *)base_alloc(tsdn, b0get(), nelms *
-	    sizeof(rtree_leaf_elm_t), CACHELINE);
-}
-rtree_leaf_alloc_t *JET_MUTABLE rtree_leaf_alloc = rtree_leaf_alloc_impl;
-
-static void
-rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) {
-	/* Leaves are never deleted during normal operation. */
-	not_reached();
-}
-UNUSED rtree_leaf_dalloc_t *JET_MUTABLE rtree_leaf_dalloc =
-    rtree_leaf_dalloc_impl;
-
-#ifdef JEMALLOC_JET
-#  if RTREE_HEIGHT > 1
-static void
-rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree,
-    unsigned level) {
-	size_t nchildren = ZU(1) << rtree_levels[level].bits;
-	if (level + 2 < RTREE_HEIGHT) {
-		for (size_t i = 0; i < nchildren; i++) {
-			rtree_node_elm_t *node =
-			    (rtree_node_elm_t *)atomic_load_p(&subtree[i].child,
-			    ATOMIC_RELAXED);
-			if (node != NULL) {
-				rtree_delete_subtree(tsdn, rtree, node, level +
-				    1);
-			}
-		}
-	} else {
-		for (size_t i = 0; i < nchildren; i++) {
-			rtree_leaf_elm_t *leaf =
-			    (rtree_leaf_elm_t *)atomic_load_p(&subtree[i].child,
-			    ATOMIC_RELAXED);
-			if (leaf != NULL) {
-				rtree_leaf_dalloc(tsdn, rtree, leaf);
-			}
-		}
-	}
-
-	if (subtree != rtree->root) {
-		rtree_node_dalloc(tsdn, rtree, subtree);
-	}
-}
-#  endif
-
-void
-rtree_delete(tsdn_t *tsdn, rtree_t *rtree) {
-#  if RTREE_HEIGHT > 1
-	rtree_delete_subtree(tsdn, rtree, rtree->root, 0);
-#  endif
-}
-#endif
-
-static rtree_node_elm_t *
-rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigned level,
-    atomic_p_t *elmp) {
-	malloc_mutex_lock(tsdn, &rtree->init_lock);
-	/*
-	 * If *elmp is non-null, then it was initialized with the init lock
-	 * held, so we can get by with 'relaxed' here.
-	 */
-	rtree_node_elm_t *node = atomic_load_p(elmp, ATOMIC_RELAXED);
-	if (node == NULL) {
-		node = rtree_node_alloc(tsdn, rtree, ZU(1) <<
-		    rtree_levels[level].bits);
-		if (node == NULL) {
-			malloc_mutex_unlock(tsdn, &rtree->init_lock);
-			return NULL;
-		}
-		/*
-		 * Even though we hold the lock, a later reader might not; we
-		 * need release semantics.
-		 */
-		atomic_store_p(elmp, node, ATOMIC_RELEASE);
-	}
-	malloc_mutex_unlock(tsdn, &rtree->init_lock);
-
-	return node;
-}
-
-static rtree_leaf_elm_t *
-rtree_leaf_init(tsdn_t *tsdn, rtree_t *rtree, atomic_p_t *elmp) {
-	malloc_mutex_lock(tsdn, &rtree->init_lock);
-	/*
-	 * If *elmp is non-null, then it was initialized with the init lock
-	 * held, so we can get by with 'relaxed' here.
-	 */
-	rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED);
-	if (leaf == NULL) {
-		leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
-		    rtree_levels[RTREE_HEIGHT-1].bits);
-		if (leaf == NULL) {
-			malloc_mutex_unlock(tsdn, &rtree->init_lock);
-			return NULL;
-		}
-		/*
-		 * Even though we hold the lock, a later reader might not; we
-		 * need release semantics.
-		 */
-		atomic_store_p(elmp, leaf, ATOMIC_RELEASE);
-	}
-	malloc_mutex_unlock(tsdn, &rtree->init_lock);
-
-	return leaf;
-}
-
-static bool
-rtree_node_valid(rtree_node_elm_t *node) {
-	return ((uintptr_t)node != (uintptr_t)0);
-}
-
-static bool
-rtree_leaf_valid(rtree_leaf_elm_t *leaf) {
-	return ((uintptr_t)leaf != (uintptr_t)0);
-}
-
-static rtree_node_elm_t *
-rtree_child_node_tryread(rtree_node_elm_t *elm, bool dependent) {
-	rtree_node_elm_t *node;
-
-	if (dependent) {
-		node = (rtree_node_elm_t *)atomic_load_p(&elm->child,
-		    ATOMIC_RELAXED);
-	} else {
-		node = (rtree_node_elm_t *)atomic_load_p(&elm->child,
-		    ATOMIC_ACQUIRE);
-	}
-
-	assert(!dependent || node != NULL);
-	return node;
-}
-
-static rtree_node_elm_t *
-rtree_child_node_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
-    unsigned level, bool dependent) {
-	rtree_node_elm_t *node;
-
-	node = rtree_child_node_tryread(elm, dependent);
-	if (!dependent && unlikely(!rtree_node_valid(node))) {
-		node = rtree_node_init(tsdn, rtree, level + 1, &elm->child);
-	}
-	assert(!dependent || node != NULL);
-	return node;
-}
-
-static rtree_leaf_elm_t *
-rtree_child_leaf_tryread(rtree_node_elm_t *elm, bool dependent) {
-	rtree_leaf_elm_t *leaf;
-
-	if (dependent) {
-		leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child,
-		    ATOMIC_RELAXED);
-	} else {
-		leaf = (rtree_leaf_elm_t *)atomic_load_p(&elm->child,
-		    ATOMIC_ACQUIRE);
-	}
-
-	assert(!dependent || leaf != NULL);
-	return leaf;
-}
-
-static rtree_leaf_elm_t *
-rtree_child_leaf_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
-    unsigned level, bool dependent) {
-	rtree_leaf_elm_t *leaf;
-
-	leaf = rtree_child_leaf_tryread(elm, dependent);
-	if (!dependent && unlikely(!rtree_leaf_valid(leaf))) {
-		leaf = rtree_leaf_init(tsdn, rtree, &elm->child);
-	}
-	assert(!dependent || leaf != NULL);
-	return leaf;
-}
-
-rtree_leaf_elm_t *
-rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
-    uintptr_t key, bool dependent, bool init_missing) {
-	rtree_node_elm_t *node;
-	rtree_leaf_elm_t *leaf;
-#if RTREE_HEIGHT > 1
-	node = rtree->root;
-#else
-	leaf = rtree->root;
-#endif
-
-	if (config_debug) {
-		uintptr_t leafkey = rtree_leafkey(key);
-		for (unsigned i = 0; i < RTREE_CTX_NCACHE; i++) {
-			assert(rtree_ctx->cache[i].leafkey != leafkey);
-		}
-		for (unsigned i = 0; i < RTREE_CTX_NCACHE_L2; i++) {
-			assert(rtree_ctx->l2_cache[i].leafkey != leafkey);
-		}
-	}
-
-#define RTREE_GET_CHILD(level) {					\
-		assert(level < RTREE_HEIGHT-1);				\
-		if (level != 0 && !dependent &&				\
-		    unlikely(!rtree_node_valid(node))) {		\
-			return NULL;					\
-		}							\
-		uintptr_t subkey = rtree_subkey(key, level);		\
-		if (level + 2 < RTREE_HEIGHT) {				\
-			node = init_missing ?				\
-			    rtree_child_node_read(tsdn, rtree,		\
-			    &node[subkey], level, dependent) :		\
-			    rtree_child_node_tryread(&node[subkey],	\
-			    dependent);					\
-		} else {						\
-			leaf = init_missing ?				\
-			    rtree_child_leaf_read(tsdn, rtree,		\
-			    &node[subkey], level, dependent) :		\
-			    rtree_child_leaf_tryread(&node[subkey],	\
-			    dependent);					\
-		}							\
-	}
-	/*
-	 * Cache replacement upon hard lookup (i.e. L1 & L2 rtree cache miss):
-	 * (1) evict last entry in L2 cache; (2) move the collision slot from L1
-	 * cache down to L2; and 3) fill L1.
-	 */
-#define RTREE_GET_LEAF(level) {						\
-		assert(level == RTREE_HEIGHT-1);			\
-		if (!dependent && unlikely(!rtree_leaf_valid(leaf))) {	\
-			return NULL;					\
-		}							\
-		if (RTREE_CTX_NCACHE_L2 > 1) {				\
-			memmove(&rtree_ctx->l2_cache[1],		\
-			    &rtree_ctx->l2_cache[0],			\
-			    sizeof(rtree_ctx_cache_elm_t) *		\
-			    (RTREE_CTX_NCACHE_L2 - 1));			\
-		}							\
-		size_t slot = rtree_cache_direct_map(key);		\
-		rtree_ctx->l2_cache[0].leafkey =			\
-		    rtree_ctx->cache[slot].leafkey;			\
-		rtree_ctx->l2_cache[0].leaf =				\
-		    rtree_ctx->cache[slot].leaf;			\
-		uintptr_t leafkey = rtree_leafkey(key);			\
-		rtree_ctx->cache[slot].leafkey = leafkey;		\
-		rtree_ctx->cache[slot].leaf = leaf;			\
-		uintptr_t subkey = rtree_subkey(key, level);		\
-		return &leaf[subkey];					\
-	}
-	if (RTREE_HEIGHT > 1) {
-		RTREE_GET_CHILD(0)
-	}
-	if (RTREE_HEIGHT > 2) {
-		RTREE_GET_CHILD(1)
-	}
-	if (RTREE_HEIGHT > 3) {
-		for (unsigned i = 2; i < RTREE_HEIGHT-1; i++) {
-			RTREE_GET_CHILD(i)
-		}
-	}
-	RTREE_GET_LEAF(RTREE_HEIGHT-1)
-#undef RTREE_GET_CHILD
-#undef RTREE_GET_LEAF
-	not_reached();
-}
-
-void
-rtree_ctx_data_init(rtree_ctx_t *ctx) {
-	for (unsigned i = 0; i < RTREE_CTX_NCACHE; i++) {
-		rtree_ctx_cache_elm_t *cache = &ctx->cache[i];
-		cache->leafkey = RTREE_LEAFKEY_INVALID;
-		cache->leaf = NULL;
-	}
-	for (unsigned i = 0; i < RTREE_CTX_NCACHE_L2; i++) {
-		rtree_ctx_cache_elm_t *cache = &ctx->l2_cache[i];
-		cache->leafkey = RTREE_LEAFKEY_INVALID;
-		cache->leaf = NULL;
-	}
-}
diff --git a/redis-stable/deps/jemalloc/src/stats.c b/redis-stable/deps/jemalloc/src/stats.c
deleted file mode 100644
index 08b9507c..00000000
--- a/redis-stable/deps/jemalloc/src/stats.c
+++ /dev/null
@@ -1,1286 +0,0 @@
-#define JEMALLOC_STATS_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/ctl.h"
-#include "jemalloc/internal/emitter.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/mutex_prof.h"
-
-const char *global_mutex_names[mutex_prof_num_global_mutexes] = {
-#define OP(mtx) #mtx,
-	MUTEX_PROF_GLOBAL_MUTEXES
-#undef OP
-};
-
-const char *arena_mutex_names[mutex_prof_num_arena_mutexes] = {
-#define OP(mtx) #mtx,
-	MUTEX_PROF_ARENA_MUTEXES
-#undef OP
-};
-
-#define CTL_GET(n, v, t) do {						\
-	size_t sz = sizeof(t);						\
-	xmallctl(n, (void *)v, &sz, NULL, 0);				\
-} while (0)
-
-#define CTL_M2_GET(n, i, v, t) do {					\
-	size_t mib[CTL_MAX_DEPTH];					\
-	size_t miblen = sizeof(mib) / sizeof(size_t);			\
-	size_t sz = sizeof(t);						\
-	xmallctlnametomib(n, mib, &miblen);				\
-	mib[2] = (i);							\
-	xmallctlbymib(mib, miblen, (void *)v, &sz, NULL, 0);		\
-} while (0)
-
-#define CTL_M2_M4_GET(n, i, j, v, t) do {				\
-	size_t mib[CTL_MAX_DEPTH];					\
-	size_t miblen = sizeof(mib) / sizeof(size_t);			\
-	size_t sz = sizeof(t);						\
-	xmallctlnametomib(n, mib, &miblen);				\
-	mib[2] = (i);							\
-	mib[4] = (j);							\
-	xmallctlbymib(mib, miblen, (void *)v, &sz, NULL, 0);		\
-} while (0)
-
-/******************************************************************************/
-/* Data. */
-
-bool opt_stats_print = false;
-char opt_stats_print_opts[stats_print_tot_num_options+1] = "";
-
-/******************************************************************************/
-
-/* Calculate x.yyy and output a string (takes a fixed sized char array). */
-static bool
-get_rate_str(uint64_t dividend, uint64_t divisor, char str[6]) {
-	if (divisor == 0 || dividend > divisor) {
-		/* The rate is not supposed to be greater than 1. */
-		return true;
-	}
-	if (dividend > 0) {
-		assert(UINT64_MAX / dividend >= 1000);
-	}
-
-	unsigned n = (unsigned)((dividend * 1000) / divisor);
-	if (n < 10) {
-		malloc_snprintf(str, 6, "0.00%u", n);
-	} else if (n < 100) {
-		malloc_snprintf(str, 6, "0.0%u", n);
-	} else if (n < 1000) {
-		malloc_snprintf(str, 6, "0.%u", n);
-	} else {
-		malloc_snprintf(str, 6, "1");
-	}
-
-	return false;
-}
-
-#define MUTEX_CTL_STR_MAX_LENGTH 128
-static void
-gen_mutex_ctl_str(char *str, size_t buf_len, const char *prefix,
-    const char *mutex, const char *counter) {
-	malloc_snprintf(str, buf_len, "stats.%s.%s.%s", prefix, mutex, counter);
-}
-
-static void
-mutex_stats_init_cols(emitter_row_t *row, const char *table_name,
-    emitter_col_t *name,
-    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
-    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
-	mutex_prof_uint64_t_counter_ind_t k_uint64_t = 0;
-	mutex_prof_uint32_t_counter_ind_t k_uint32_t = 0;
-
-	emitter_col_t *col;
-
-	if (name != NULL) {
-		emitter_col_init(name, row);
-		name->justify = emitter_justify_left;
-		name->width = 21;
-		name->type = emitter_type_title;
-		name->str_val = table_name;
-	}
-
-#define WIDTH_uint32_t 12
-#define WIDTH_uint64_t 16
-#define OP(counter, counter_type, human)				\
-	col = &col_##counter_type[k_##counter_type];			\
-	++k_##counter_type;						\
-	emitter_col_init(col, row);					\
-	col->justify = emitter_justify_right;				\
-	col->width = WIDTH_##counter_type;				\
-	col->type = emitter_type_title;					\
-	col->str_val = human;
-	MUTEX_PROF_COUNTERS
-#undef OP
-#undef WIDTH_uint32_t
-#undef WIDTH_uint64_t
-}
-
-static void
-mutex_stats_read_global(const char *name, emitter_col_t *col_name,
-    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
-    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
-	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
-
-	col_name->str_val = name;
-
-	emitter_col_t *dst;
-#define EMITTER_TYPE_uint32_t emitter_type_uint32
-#define EMITTER_TYPE_uint64_t emitter_type_uint64
-#define OP(counter, counter_type, human)				\
-	dst = &col_##counter_type[mutex_counter_##counter];		\
-	dst->type = EMITTER_TYPE_##counter_type;			\
-	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
-	    "mutexes", name, #counter);					\
-	CTL_GET(cmd, (counter_type *)&dst->bool_val, counter_type);
-	MUTEX_PROF_COUNTERS
-#undef OP
-#undef EMITTER_TYPE_uint32_t
-#undef EMITTER_TYPE_uint64_t
-}
-
-static void
-mutex_stats_read_arena(unsigned arena_ind, mutex_prof_arena_ind_t mutex_ind,
-    const char *name, emitter_col_t *col_name,
-    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
-    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
-	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
-
-	col_name->str_val = name;
-
-	emitter_col_t *dst;
-#define EMITTER_TYPE_uint32_t emitter_type_uint32
-#define EMITTER_TYPE_uint64_t emitter_type_uint64
-#define OP(counter, counter_type, human)				\
-	dst = &col_##counter_type[mutex_counter_##counter];		\
-	dst->type = EMITTER_TYPE_##counter_type;			\
-	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
-	    "arenas.0.mutexes",	arena_mutex_names[mutex_ind], #counter);\
-	CTL_M2_GET(cmd, arena_ind,					\
-	    (counter_type *)&dst->bool_val, counter_type);
-	MUTEX_PROF_COUNTERS
-#undef OP
-#undef EMITTER_TYPE_uint32_t
-#undef EMITTER_TYPE_uint64_t
-}
-
-static void
-mutex_stats_read_arena_bin(unsigned arena_ind, unsigned bin_ind,
-    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
-    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
-	char cmd[MUTEX_CTL_STR_MAX_LENGTH];
-	emitter_col_t *dst;
-
-#define EMITTER_TYPE_uint32_t emitter_type_uint32
-#define EMITTER_TYPE_uint64_t emitter_type_uint64
-#define OP(counter, counter_type, human)				\
-	dst = &col_##counter_type[mutex_counter_##counter];		\
-	dst->type = EMITTER_TYPE_##counter_type;			\
-	gen_mutex_ctl_str(cmd, MUTEX_CTL_STR_MAX_LENGTH,		\
-	    "arenas.0.bins.0","mutex", #counter);			\
-	CTL_M2_M4_GET(cmd, arena_ind, bin_ind,				\
-	    (counter_type *)&dst->bool_val, counter_type);
-	MUTEX_PROF_COUNTERS
-#undef OP
-#undef EMITTER_TYPE_uint32_t
-#undef EMITTER_TYPE_uint64_t
-}
-
-/* "row" can be NULL to avoid emitting in table mode. */
-static void
-mutex_stats_emit(emitter_t *emitter, emitter_row_t *row,
-    emitter_col_t col_uint64_t[mutex_prof_num_uint64_t_counters],
-    emitter_col_t col_uint32_t[mutex_prof_num_uint32_t_counters]) {
-	if (row != NULL) {
-		emitter_table_row(emitter, row);
-	}
-
-	mutex_prof_uint64_t_counter_ind_t k_uint64_t = 0;
-	mutex_prof_uint32_t_counter_ind_t k_uint32_t = 0;
-
-	emitter_col_t *col;
-
-#define EMITTER_TYPE_uint32_t emitter_type_uint32
-#define EMITTER_TYPE_uint64_t emitter_type_uint64
-#define OP(counter, type, human)					\
-	col = &col_##type[k_##type];						\
-	++k_##type;							\
-	emitter_json_kv(emitter, #counter, EMITTER_TYPE_##type,		\
-	    (const void *)&col->bool_val);
-	MUTEX_PROF_COUNTERS;
-#undef OP
-#undef EMITTER_TYPE_uint32_t
-#undef EMITTER_TYPE_uint64_t
-}
-
-static void
-stats_arena_bins_print(emitter_t *emitter, bool mutex, unsigned i) {
-	size_t page;
-	bool in_gap, in_gap_prev;
-	unsigned nbins, j;
-
-	CTL_GET("arenas.page", &page, size_t);
-
-	CTL_GET("arenas.nbins", &nbins, unsigned);
-
-	emitter_row_t header_row;
-	emitter_row_init(&header_row);
-
-	emitter_row_t row;
-	emitter_row_init(&row);
-#define COL(name, left_or_right, col_width, etype)			\
-	emitter_col_t col_##name;					\
-	emitter_col_init(&col_##name, &row);				\
-	col_##name.justify = emitter_justify_##left_or_right;		\
-	col_##name.width = col_width;					\
-	col_##name.type = emitter_type_##etype;				\
-	emitter_col_t header_col_##name;				\
-	emitter_col_init(&header_col_##name, &header_row);		\
-	header_col_##name.justify = emitter_justify_##left_or_right;	\
-	header_col_##name.width = col_width;				\
-	header_col_##name.type = emitter_type_title;			\
-	header_col_##name.str_val = #name;
-
-	COL(size, right, 20, size)
-	COL(ind, right, 4, unsigned)
-	COL(allocated, right, 13, uint64)
-	COL(nmalloc, right, 13, uint64)
-	COL(ndalloc, right, 13, uint64)
-	COL(nrequests, right, 13, uint64)
-	COL(curregs, right, 13, size)
-	COL(curslabs, right, 13, size)
-	COL(regs, right, 5, unsigned)
-	COL(pgs, right, 4, size)
-	/* To buffer a right- and left-justified column. */
-	COL(justify_spacer, right, 1, title)
-	COL(util, right, 6, title)
-	COL(nfills, right, 13, uint64)
-	COL(nflushes, right, 13, uint64)
-	COL(nslabs, right, 13, uint64)
-	COL(nreslabs, right, 13, uint64)
-#undef COL
-
-	/* Don't want to actually print the name. */
-	header_col_justify_spacer.str_val = " ";
-	col_justify_spacer.str_val = " ";
-
-
-	emitter_col_t col_mutex64[mutex_prof_num_uint64_t_counters];
-	emitter_col_t col_mutex32[mutex_prof_num_uint32_t_counters];
-
-	emitter_col_t header_mutex64[mutex_prof_num_uint64_t_counters];
-	emitter_col_t header_mutex32[mutex_prof_num_uint32_t_counters];
-
-	if (mutex) {
-		mutex_stats_init_cols(&row, NULL, NULL, col_mutex64,
-		    col_mutex32);
-		mutex_stats_init_cols(&header_row, NULL, NULL, header_mutex64,
-		    header_mutex32);
-	}
-
-	/*
-	 * We print a "bins:" header as part of the table row; we need to adjust
-	 * the header size column to compensate.
-	 */
-	header_col_size.width -=5;
-	emitter_table_printf(emitter, "bins:");
-	emitter_table_row(emitter, &header_row);
-	emitter_json_arr_begin(emitter, "bins");
-
-	for (j = 0, in_gap = false; j < nbins; j++) {
-		uint64_t nslabs;
-		size_t reg_size, slab_size, curregs;
-		size_t curslabs;
-		uint32_t nregs;
-		uint64_t nmalloc, ndalloc, nrequests, nfills, nflushes;
-		uint64_t nreslabs;
-
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nslabs", i, j, &nslabs,
-		    uint64_t);
-		in_gap_prev = in_gap;
-		in_gap = (nslabs == 0);
-
-		if (in_gap_prev && !in_gap) {
-			emitter_table_printf(emitter,
-			    "                     ---\n");
-		}
-
-		CTL_M2_GET("arenas.bin.0.size", j, &reg_size, size_t);
-		CTL_M2_GET("arenas.bin.0.nregs", j, &nregs, uint32_t);
-		CTL_M2_GET("arenas.bin.0.slab_size", j, &slab_size, size_t);
-
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nmalloc", i, j, &nmalloc,
-		    uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.ndalloc", i, j, &ndalloc,
-		    uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.curregs", i, j, &curregs,
-		    size_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nrequests", i, j,
-		    &nrequests, uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nfills", i, j, &nfills,
-		    uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nflushes", i, j, &nflushes,
-		    uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.nreslabs", i, j, &nreslabs,
-		    uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.bins.0.curslabs", i, j, &curslabs,
-		    size_t);
-
-		if (mutex) {
-			mutex_stats_read_arena_bin(i, j, col_mutex64,
-			    col_mutex32);
-		}
-
-		emitter_json_arr_obj_begin(emitter);
-		emitter_json_kv(emitter, "nmalloc", emitter_type_uint64,
-		    &nmalloc);
-		emitter_json_kv(emitter, "ndalloc", emitter_type_uint64,
-		    &ndalloc);
-		emitter_json_kv(emitter, "curregs", emitter_type_size,
-		    &curregs);
-		emitter_json_kv(emitter, "nrequests", emitter_type_uint64,
-		    &nrequests);
-		emitter_json_kv(emitter, "nfills", emitter_type_uint64,
-		    &nfills);
-		emitter_json_kv(emitter, "nflushes", emitter_type_uint64,
-		    &nflushes);
-		emitter_json_kv(emitter, "nreslabs", emitter_type_uint64,
-		    &nreslabs);
-		emitter_json_kv(emitter, "curslabs", emitter_type_size,
-		    &curslabs);
-		if (mutex) {
-			emitter_json_dict_begin(emitter, "mutex");
-			mutex_stats_emit(emitter, NULL, col_mutex64,
-			    col_mutex32);
-			emitter_json_dict_end(emitter);
-		}
-		emitter_json_arr_obj_end(emitter);
-
-		size_t availregs = nregs * curslabs;
-		char util[6];
-		if (get_rate_str((uint64_t)curregs, (uint64_t)availregs, util))
-		{
-			if (availregs == 0) {
-				malloc_snprintf(util, sizeof(util), "1");
-			} else if (curregs > availregs) {
-				/*
-				 * Race detected: the counters were read in
-				 * separate mallctl calls and concurrent
-				 * operations happened in between.  In this case
-				 * no meaningful utilization can be computed.
-				 */
-				malloc_snprintf(util, sizeof(util), " race");
-			} else {
-				not_reached();
-			}
-		}
-
-		col_size.size_val = reg_size;
-		col_ind.unsigned_val = j;
-		col_allocated.size_val = curregs * reg_size;
-		col_nmalloc.uint64_val = nmalloc;
-		col_ndalloc.uint64_val = ndalloc;
-		col_nrequests.uint64_val = nrequests;
-		col_curregs.size_val = curregs;
-		col_curslabs.size_val = curslabs;
-		col_regs.unsigned_val = nregs;
-		col_pgs.size_val = slab_size / page;
-		col_util.str_val = util;
-		col_nfills.uint64_val = nfills;
-		col_nflushes.uint64_val = nflushes;
-		col_nslabs.uint64_val = nslabs;
-		col_nreslabs.uint64_val = nreslabs;
-
-		/*
-		 * Note that mutex columns were initialized above, if mutex ==
-		 * true.
-		 */
-
-		emitter_table_row(emitter, &row);
-	}
-	emitter_json_arr_end(emitter); /* Close "bins". */
-
-	if (in_gap) {
-		emitter_table_printf(emitter, "                     ---\n");
-	}
-}
-
-static void
-stats_arena_lextents_print(emitter_t *emitter, unsigned i) {
-	unsigned nbins, nlextents, j;
-	bool in_gap, in_gap_prev;
-
-	CTL_GET("arenas.nbins", &nbins, unsigned);
-	CTL_GET("arenas.nlextents", &nlextents, unsigned);
-
-	emitter_row_t header_row;
-	emitter_row_init(&header_row);
-	emitter_row_t row;
-	emitter_row_init(&row);
-
-#define COL(name, left_or_right, col_width, etype)			\
-	emitter_col_t header_##name;					\
-	emitter_col_init(&header_##name, &header_row);			\
-	header_##name.justify = emitter_justify_##left_or_right;	\
-	header_##name.width = col_width;				\
-	header_##name.type = emitter_type_title;			\
-	header_##name.str_val = #name;					\
-									\
-	emitter_col_t col_##name;					\
-	emitter_col_init(&col_##name, &row);				\
-	col_##name.justify = emitter_justify_##left_or_right;		\
-	col_##name.width = col_width;					\
-	col_##name.type = emitter_type_##etype;
-
-	COL(size, right, 20, size)
-	COL(ind, right, 4, unsigned)
-	COL(allocated, right, 13, size)
-	COL(nmalloc, right, 13, uint64)
-	COL(ndalloc, right, 13, uint64)
-	COL(nrequests, right, 13, uint64)
-	COL(curlextents, right, 13, size)
-#undef COL
-
-	/* As with bins, we label the large extents table. */
-	header_size.width -= 6;
-	emitter_table_printf(emitter, "large:");
-	emitter_table_row(emitter, &header_row);
-	emitter_json_arr_begin(emitter, "lextents");
-
-	for (j = 0, in_gap = false; j < nlextents; j++) {
-		uint64_t nmalloc, ndalloc, nrequests;
-		size_t lextent_size, curlextents;
-
-		CTL_M2_M4_GET("stats.arenas.0.lextents.0.nmalloc", i, j,
-		    &nmalloc, uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.lextents.0.ndalloc", i, j,
-		    &ndalloc, uint64_t);
-		CTL_M2_M4_GET("stats.arenas.0.lextents.0.nrequests", i, j,
-		    &nrequests, uint64_t);
-		in_gap_prev = in_gap;
-		in_gap = (nrequests == 0);
-
-		if (in_gap_prev && !in_gap) {
-			emitter_table_printf(emitter,
-			    "                     ---\n");
-		}
-
-		CTL_M2_GET("arenas.lextent.0.size", j, &lextent_size, size_t);
-		CTL_M2_M4_GET("stats.arenas.0.lextents.0.curlextents", i, j,
-		    &curlextents, size_t);
-
-		emitter_json_arr_obj_begin(emitter);
-		emitter_json_kv(emitter, "curlextents", emitter_type_size,
-		    &curlextents);
-		emitter_json_arr_obj_end(emitter);
-
-		col_size.size_val = lextent_size;
-		col_ind.unsigned_val = nbins + j;
-		col_allocated.size_val = curlextents * lextent_size;
-		col_nmalloc.uint64_val = nmalloc;
-		col_ndalloc.uint64_val = ndalloc;
-		col_nrequests.uint64_val = nrequests;
-		col_curlextents.size_val = curlextents;
-
-		if (!in_gap) {
-			emitter_table_row(emitter, &row);
-		}
-	}
-	emitter_json_arr_end(emitter); /* Close "lextents". */
-	if (in_gap) {
-		emitter_table_printf(emitter, "                     ---\n");
-	}
-}
-
-static void
-stats_arena_mutexes_print(emitter_t *emitter, unsigned arena_ind) {
-	emitter_row_t row;
-	emitter_col_t col_name;
-	emitter_col_t col64[mutex_prof_num_uint64_t_counters];
-	emitter_col_t col32[mutex_prof_num_uint32_t_counters];
-
-	emitter_row_init(&row);
-	mutex_stats_init_cols(&row, "", &col_name, col64, col32);
-
-	emitter_json_dict_begin(emitter, "mutexes");
-	emitter_table_row(emitter, &row);
-
-	for (mutex_prof_arena_ind_t i = 0; i < mutex_prof_num_arena_mutexes;
-	    i++) {
-		const char *name = arena_mutex_names[i];
-		emitter_json_dict_begin(emitter, name);
-		mutex_stats_read_arena(arena_ind, i, name, &col_name, col64,
-		    col32);
-		mutex_stats_emit(emitter, &row, col64, col32);
-		emitter_json_dict_end(emitter); /* Close the mutex dict. */
-	}
-	emitter_json_dict_end(emitter); /* End "mutexes". */
-}
-
-static void
-stats_arena_print(emitter_t *emitter, unsigned i, bool bins, bool large,
-    bool mutex) {
-	unsigned nthreads;
-	const char *dss;
-	ssize_t dirty_decay_ms, muzzy_decay_ms;
-	size_t page, pactive, pdirty, pmuzzy, mapped, retained;
-	size_t base, internal, resident, metadata_thp;
-	uint64_t dirty_npurge, dirty_nmadvise, dirty_purged;
-	uint64_t muzzy_npurge, muzzy_nmadvise, muzzy_purged;
-	size_t small_allocated;
-	uint64_t small_nmalloc, small_ndalloc, small_nrequests;
-	size_t large_allocated;
-	uint64_t large_nmalloc, large_ndalloc, large_nrequests;
-	size_t tcache_bytes;
-	uint64_t uptime;
-
-	CTL_GET("arenas.page", &page, size_t);
-
-	CTL_M2_GET("stats.arenas.0.nthreads", i, &nthreads, unsigned);
-	emitter_kv(emitter, "nthreads", "assigned threads",
-	    emitter_type_unsigned, &nthreads);
-
-	CTL_M2_GET("stats.arenas.0.uptime", i, &uptime, uint64_t);
-	emitter_kv(emitter, "uptime_ns", "uptime", emitter_type_uint64,
-	    &uptime);
-
-	CTL_M2_GET("stats.arenas.0.dss", i, &dss, const char *);
-	emitter_kv(emitter, "dss", "dss allocation precedence",
-	    emitter_type_string, &dss);
-
-	CTL_M2_GET("stats.arenas.0.dirty_decay_ms", i, &dirty_decay_ms,
-	    ssize_t);
-	CTL_M2_GET("stats.arenas.0.muzzy_decay_ms", i, &muzzy_decay_ms,
-	    ssize_t);
-	CTL_M2_GET("stats.arenas.0.pactive", i, &pactive, size_t);
-	CTL_M2_GET("stats.arenas.0.pdirty", i, &pdirty, size_t);
-	CTL_M2_GET("stats.arenas.0.pmuzzy", i, &pmuzzy, size_t);
-	CTL_M2_GET("stats.arenas.0.dirty_npurge", i, &dirty_npurge, uint64_t);
-	CTL_M2_GET("stats.arenas.0.dirty_nmadvise", i, &dirty_nmadvise,
-	    uint64_t);
-	CTL_M2_GET("stats.arenas.0.dirty_purged", i, &dirty_purged, uint64_t);
-	CTL_M2_GET("stats.arenas.0.muzzy_npurge", i, &muzzy_npurge, uint64_t);
-	CTL_M2_GET("stats.arenas.0.muzzy_nmadvise", i, &muzzy_nmadvise,
-	    uint64_t);
-	CTL_M2_GET("stats.arenas.0.muzzy_purged", i, &muzzy_purged, uint64_t);
-
-	emitter_row_t decay_row;
-	emitter_row_init(&decay_row);
-
-	/* JSON-style emission. */
-	emitter_json_kv(emitter, "dirty_decay_ms", emitter_type_ssize,
-	    &dirty_decay_ms);
-	emitter_json_kv(emitter, "muzzy_decay_ms", emitter_type_ssize,
-	    &muzzy_decay_ms);
-
-	emitter_json_kv(emitter, "pactive", emitter_type_size, &pactive);
-	emitter_json_kv(emitter, "pdirty", emitter_type_size, &pdirty);
-	emitter_json_kv(emitter, "pmuzzy", emitter_type_size, &pmuzzy);
-
-	emitter_json_kv(emitter, "dirty_npurge", emitter_type_uint64,
-	    &dirty_npurge);
-	emitter_json_kv(emitter, "dirty_nmadvise", emitter_type_uint64,
-	    &dirty_nmadvise);
-	emitter_json_kv(emitter, "dirty_purged", emitter_type_uint64,
-	    &dirty_purged);
-
-	emitter_json_kv(emitter, "muzzy_npurge", emitter_type_uint64,
-	    &muzzy_npurge);
-	emitter_json_kv(emitter, "muzzy_nmadvise", emitter_type_uint64,
-	    &muzzy_nmadvise);
-	emitter_json_kv(emitter, "muzzy_purged", emitter_type_uint64,
-	    &muzzy_purged);
-
-	/* Table-style emission. */
-	emitter_col_t decay_type;
-	emitter_col_init(&decay_type, &decay_row);
-	decay_type.justify = emitter_justify_right;
-	decay_type.width = 9;
-	decay_type.type = emitter_type_title;
-	decay_type.str_val = "decaying:";
-
-	emitter_col_t decay_time;
-	emitter_col_init(&decay_time, &decay_row);
-	decay_time.justify = emitter_justify_right;
-	decay_time.width = 6;
-	decay_time.type = emitter_type_title;
-	decay_time.str_val = "time";
-
-	emitter_col_t decay_npages;
-	emitter_col_init(&decay_npages, &decay_row);
-	decay_npages.justify = emitter_justify_right;
-	decay_npages.width = 13;
-	decay_npages.type = emitter_type_title;
-	decay_npages.str_val = "npages";
-
-	emitter_col_t decay_sweeps;
-	emitter_col_init(&decay_sweeps, &decay_row);
-	decay_sweeps.justify = emitter_justify_right;
-	decay_sweeps.width = 13;
-	decay_sweeps.type = emitter_type_title;
-	decay_sweeps.str_val = "sweeps";
-
-	emitter_col_t decay_madvises;
-	emitter_col_init(&decay_madvises, &decay_row);
-	decay_madvises.justify = emitter_justify_right;
-	decay_madvises.width = 13;
-	decay_madvises.type = emitter_type_title;
-	decay_madvises.str_val = "madvises";
-
-	emitter_col_t decay_purged;
-	emitter_col_init(&decay_purged, &decay_row);
-	decay_purged.justify = emitter_justify_right;
-	decay_purged.width = 13;
-	decay_purged.type = emitter_type_title;
-	decay_purged.str_val = "purged";
-
-	/* Title row. */
-	emitter_table_row(emitter, &decay_row);
-
-	/* Dirty row. */
-	decay_type.str_val = "dirty:";
-
-	if (dirty_decay_ms >= 0) {
-		decay_time.type = emitter_type_ssize;
-		decay_time.ssize_val = dirty_decay_ms;
-	} else {
-		decay_time.type = emitter_type_title;
-		decay_time.str_val = "N/A";
-	}
-
-	decay_npages.type = emitter_type_size;
-	decay_npages.size_val = pdirty;
-
-	decay_sweeps.type = emitter_type_uint64;
-	decay_sweeps.uint64_val = dirty_npurge;
-
-	decay_madvises.type = emitter_type_uint64;
-	decay_madvises.uint64_val = dirty_nmadvise;
-
-	decay_purged.type = emitter_type_uint64;
-	decay_purged.uint64_val = dirty_purged;
-
-	emitter_table_row(emitter, &decay_row);
-
-	/* Muzzy row. */
-	decay_type.str_val = "muzzy:";
-
-	if (muzzy_decay_ms >= 0) {
-		decay_time.type = emitter_type_ssize;
-		decay_time.ssize_val = muzzy_decay_ms;
-	} else {
-		decay_time.type = emitter_type_title;
-		decay_time.str_val = "N/A";
-	}
-
-	decay_npages.type = emitter_type_size;
-	decay_npages.size_val = pmuzzy;
-
-	decay_sweeps.type = emitter_type_uint64;
-	decay_sweeps.uint64_val = muzzy_npurge;
-
-	decay_madvises.type = emitter_type_uint64;
-	decay_madvises.uint64_val = muzzy_nmadvise;
-
-	decay_purged.type = emitter_type_uint64;
-	decay_purged.uint64_val = muzzy_purged;
-
-	emitter_table_row(emitter, &decay_row);
-
-	/* Small / large / total allocation counts. */
-	emitter_row_t alloc_count_row;
-	emitter_row_init(&alloc_count_row);
-
-	emitter_col_t alloc_count_title;
-	emitter_col_init(&alloc_count_title, &alloc_count_row);
-	alloc_count_title.justify = emitter_justify_left;
-	alloc_count_title.width = 25;
-	alloc_count_title.type = emitter_type_title;
-	alloc_count_title.str_val = "";
-
-	emitter_col_t alloc_count_allocated;
-	emitter_col_init(&alloc_count_allocated, &alloc_count_row);
-	alloc_count_allocated.justify = emitter_justify_right;
-	alloc_count_allocated.width = 12;
-	alloc_count_allocated.type = emitter_type_title;
-	alloc_count_allocated.str_val = "allocated";
-
-	emitter_col_t alloc_count_nmalloc;
-	emitter_col_init(&alloc_count_nmalloc, &alloc_count_row);
-	alloc_count_nmalloc.justify = emitter_justify_right;
-	alloc_count_nmalloc.width = 12;
-	alloc_count_nmalloc.type = emitter_type_title;
-	alloc_count_nmalloc.str_val = "nmalloc";
-
-	emitter_col_t alloc_count_ndalloc;
-	emitter_col_init(&alloc_count_ndalloc, &alloc_count_row);
-	alloc_count_ndalloc.justify = emitter_justify_right;
-	alloc_count_ndalloc.width = 12;
-	alloc_count_ndalloc.type = emitter_type_title;
-	alloc_count_ndalloc.str_val = "ndalloc";
-
-	emitter_col_t alloc_count_nrequests;
-	emitter_col_init(&alloc_count_nrequests, &alloc_count_row);
-	alloc_count_nrequests.justify = emitter_justify_right;
-	alloc_count_nrequests.width = 12;
-	alloc_count_nrequests.type = emitter_type_title;
-	alloc_count_nrequests.str_val = "nrequests";
-
-	emitter_table_row(emitter, &alloc_count_row);
-
-#define GET_AND_EMIT_ALLOC_STAT(small_or_large, name, valtype)		\
-	CTL_M2_GET("stats.arenas.0." #small_or_large "." #name, i,	\
-	    &small_or_large##_##name, valtype##_t);			\
-	emitter_json_kv(emitter, #name, emitter_type_##valtype,		\
-	    &small_or_large##_##name);					\
-	alloc_count_##name.type = emitter_type_##valtype;		\
-	alloc_count_##name.valtype##_val = small_or_large##_##name;
-
-	emitter_json_dict_begin(emitter, "small");
-	alloc_count_title.str_val = "small:";
-
-	GET_AND_EMIT_ALLOC_STAT(small, allocated, size)
-	GET_AND_EMIT_ALLOC_STAT(small, nmalloc, uint64)
-	GET_AND_EMIT_ALLOC_STAT(small, ndalloc, uint64)
-	GET_AND_EMIT_ALLOC_STAT(small, nrequests, uint64)
-
-	emitter_table_row(emitter, &alloc_count_row);
-	emitter_json_dict_end(emitter); /* Close "small". */
-
-	emitter_json_dict_begin(emitter, "large");
-	alloc_count_title.str_val = "large:";
-
-	GET_AND_EMIT_ALLOC_STAT(large, allocated, size)
-	GET_AND_EMIT_ALLOC_STAT(large, nmalloc, uint64)
-	GET_AND_EMIT_ALLOC_STAT(large, ndalloc, uint64)
-	GET_AND_EMIT_ALLOC_STAT(large, nrequests, uint64)
-
-	emitter_table_row(emitter, &alloc_count_row);
-	emitter_json_dict_end(emitter); /* Close "large". */
-
-#undef GET_AND_EMIT_ALLOC_STAT
-
-	/* Aggregated small + large stats are emitter only in table mode. */
-	alloc_count_title.str_val = "total:";
-	alloc_count_allocated.size_val = small_allocated + large_allocated;
-	alloc_count_nmalloc.uint64_val = small_nmalloc + large_nmalloc;
-	alloc_count_ndalloc.uint64_val = small_ndalloc + large_ndalloc;
-	alloc_count_nrequests.uint64_val = small_nrequests + large_nrequests;
-	emitter_table_row(emitter, &alloc_count_row);
-
-	emitter_row_t mem_count_row;
-	emitter_row_init(&mem_count_row);
-
-	emitter_col_t mem_count_title;
-	emitter_col_init(&mem_count_title, &mem_count_row);
-	mem_count_title.justify = emitter_justify_left;
-	mem_count_title.width = 25;
-	mem_count_title.type = emitter_type_title;
-	mem_count_title.str_val = "";
-
-	emitter_col_t mem_count_val;
-	emitter_col_init(&mem_count_val, &mem_count_row);
-	mem_count_val.justify = emitter_justify_right;
-	mem_count_val.width = 12;
-	mem_count_val.type = emitter_type_title;
-	mem_count_val.str_val = "";
-
-	emitter_table_row(emitter, &mem_count_row);
-	mem_count_val.type = emitter_type_size;
-
-	/* Active count in bytes is emitted only in table mode. */
-	mem_count_title.str_val = "active:";
-	mem_count_val.size_val = pactive * page;
-	emitter_table_row(emitter, &mem_count_row);
-
-#define GET_AND_EMIT_MEM_STAT(stat)					\
-	CTL_M2_GET("stats.arenas.0."#stat, i, &stat, size_t);		\
-	emitter_json_kv(emitter, #stat, emitter_type_size, &stat);	\
-	mem_count_title.str_val = #stat":";				\
-	mem_count_val.size_val = stat;					\
-	emitter_table_row(emitter, &mem_count_row);
-
-	GET_AND_EMIT_MEM_STAT(mapped)
-	GET_AND_EMIT_MEM_STAT(retained)
-	GET_AND_EMIT_MEM_STAT(base)
-	GET_AND_EMIT_MEM_STAT(internal)
-	GET_AND_EMIT_MEM_STAT(metadata_thp)
-	GET_AND_EMIT_MEM_STAT(tcache_bytes)
-	GET_AND_EMIT_MEM_STAT(resident)
-#undef GET_AND_EMIT_MEM_STAT
-
-	if (mutex) {
-		stats_arena_mutexes_print(emitter, i);
-	}
-	if (bins) {
-		stats_arena_bins_print(emitter, mutex, i);
-	}
-	if (large) {
-		stats_arena_lextents_print(emitter, i);
-	}
-}
-
-static void
-stats_general_print(emitter_t *emitter) {
-	const char *cpv;
-	bool bv, bv2;
-	unsigned uv;
-	uint32_t u32v;
-	uint64_t u64v;
-	ssize_t ssv, ssv2;
-	size_t sv, bsz, usz, ssz, sssz, cpsz;
-
-	bsz = sizeof(bool);
-	usz = sizeof(unsigned);
-	ssz = sizeof(size_t);
-	sssz = sizeof(ssize_t);
-	cpsz = sizeof(const char *);
-
-	CTL_GET("version", &cpv, const char *);
-	emitter_kv(emitter, "version", "Version", emitter_type_string, &cpv);
-
-	/* config. */
-	emitter_dict_begin(emitter, "config", "Build-time option settings");
-#define CONFIG_WRITE_BOOL(name)						\
-	do {								\
-		CTL_GET("config."#name, &bv, bool);			\
-		emitter_kv(emitter, #name, "config."#name,		\
-		    emitter_type_bool, &bv);				\
-	} while (0)
-
-	CONFIG_WRITE_BOOL(cache_oblivious);
-	CONFIG_WRITE_BOOL(debug);
-	CONFIG_WRITE_BOOL(fill);
-	CONFIG_WRITE_BOOL(lazy_lock);
-	emitter_kv(emitter, "malloc_conf", "config.malloc_conf",
-	    emitter_type_string, &config_malloc_conf);
-
-	CONFIG_WRITE_BOOL(prof);
-	CONFIG_WRITE_BOOL(prof_libgcc);
-	CONFIG_WRITE_BOOL(prof_libunwind);
-	CONFIG_WRITE_BOOL(stats);
-	CONFIG_WRITE_BOOL(utrace);
-	CONFIG_WRITE_BOOL(xmalloc);
-#undef CONFIG_WRITE_BOOL
-	emitter_dict_end(emitter); /* Close "config" dict. */
-
-	/* opt. */
-#define OPT_WRITE(name, var, size, emitter_type)			\
-	if (je_mallctl("opt."name, (void *)&var, &size, NULL, 0) ==	\
-	    0) {							\
-		emitter_kv(emitter, name, "opt."name, emitter_type,	\
-		    &var);						\
-	}
-
-#define OPT_WRITE_MUTABLE(name, var1, var2, size, emitter_type,		\
-    altname)								\
-	if (je_mallctl("opt."name, (void *)&var1, &size, NULL, 0) ==	\
-	    0 && je_mallctl(altname, (void *)&var2, &size, NULL, 0)	\
-	    == 0) {							\
-		emitter_kv_note(emitter, name, "opt."name,		\
-		    emitter_type, &var1, altname, emitter_type,		\
-		    &var2);						\
-	}
-
-#define OPT_WRITE_BOOL(name) OPT_WRITE(name, bv, bsz, emitter_type_bool)
-#define OPT_WRITE_BOOL_MUTABLE(name, altname)				\
-	OPT_WRITE_MUTABLE(name, bv, bv2, bsz, emitter_type_bool, altname)
-
-#define OPT_WRITE_UNSIGNED(name)					\
-	OPT_WRITE(name, uv, usz, emitter_type_unsigned)
-
-#define OPT_WRITE_SSIZE_T(name)						\
-	OPT_WRITE(name, ssv, sssz, emitter_type_ssize)
-#define OPT_WRITE_SSIZE_T_MUTABLE(name, altname)			\
-	OPT_WRITE_MUTABLE(name, ssv, ssv2, sssz, emitter_type_ssize,	\
-	    altname)
-
-#define OPT_WRITE_CHAR_P(name)						\
-	OPT_WRITE(name, cpv, cpsz, emitter_type_string)
-
-	emitter_dict_begin(emitter, "opt", "Run-time option settings");
-
-	OPT_WRITE_BOOL("abort")
-	OPT_WRITE_BOOL("abort_conf")
-	OPT_WRITE_BOOL("retain")
-	OPT_WRITE_CHAR_P("dss")
-	OPT_WRITE_UNSIGNED("narenas")
-	OPT_WRITE_CHAR_P("percpu_arena")
-	OPT_WRITE_CHAR_P("metadata_thp")
-	OPT_WRITE_BOOL_MUTABLE("background_thread", "background_thread")
-	OPT_WRITE_SSIZE_T_MUTABLE("dirty_decay_ms", "arenas.dirty_decay_ms")
-	OPT_WRITE_SSIZE_T_MUTABLE("muzzy_decay_ms", "arenas.muzzy_decay_ms")
-	OPT_WRITE_UNSIGNED("lg_extent_max_active_fit")
-	OPT_WRITE_CHAR_P("junk")
-	OPT_WRITE_BOOL("zero")
-	OPT_WRITE_BOOL("utrace")
-	OPT_WRITE_BOOL("xmalloc")
-	OPT_WRITE_BOOL("tcache")
-	OPT_WRITE_SSIZE_T("lg_tcache_max")
-	OPT_WRITE_CHAR_P("thp")
-	OPT_WRITE_BOOL("prof")
-	OPT_WRITE_CHAR_P("prof_prefix")
-	OPT_WRITE_BOOL_MUTABLE("prof_active", "prof.active")
-	OPT_WRITE_BOOL_MUTABLE("prof_thread_active_init",
-	    "prof.thread_active_init")
-	OPT_WRITE_SSIZE_T_MUTABLE("lg_prof_sample", "prof.lg_sample")
-	OPT_WRITE_BOOL("prof_accum")
-	OPT_WRITE_SSIZE_T("lg_prof_interval")
-	OPT_WRITE_BOOL("prof_gdump")
-	OPT_WRITE_BOOL("prof_final")
-	OPT_WRITE_BOOL("prof_leak")
-	OPT_WRITE_BOOL("stats_print")
-	OPT_WRITE_CHAR_P("stats_print_opts")
-
-	emitter_dict_end(emitter);
-
-#undef OPT_WRITE
-#undef OPT_WRITE_MUTABLE
-#undef OPT_WRITE_BOOL
-#undef OPT_WRITE_BOOL_MUTABLE
-#undef OPT_WRITE_UNSIGNED
-#undef OPT_WRITE_SSIZE_T
-#undef OPT_WRITE_SSIZE_T_MUTABLE
-#undef OPT_WRITE_CHAR_P
-
-	/* prof. */
-	if (config_prof) {
-		emitter_dict_begin(emitter, "prof", "Profiling settings");
-
-		CTL_GET("prof.thread_active_init", &bv, bool);
-		emitter_kv(emitter, "thread_active_init",
-		    "prof.thread_active_init", emitter_type_bool, &bv);
-
-		CTL_GET("prof.active", &bv, bool);
-		emitter_kv(emitter, "active", "prof.active", emitter_type_bool,
-		    &bv);
-
-		CTL_GET("prof.gdump", &bv, bool);
-		emitter_kv(emitter, "gdump", "prof.gdump", emitter_type_bool,
-		    &bv);
-
-		CTL_GET("prof.interval", &u64v, uint64_t);
-		emitter_kv(emitter, "interval", "prof.interval",
-		    emitter_type_uint64, &u64v);
-
-		CTL_GET("prof.lg_sample", &ssv, ssize_t);
-		emitter_kv(emitter, "lg_sample", "prof.lg_sample",
-		    emitter_type_ssize, &ssv);
-
-		emitter_dict_end(emitter); /* Close "prof". */
-	}
-
-	/* arenas. */
-	/*
-	 * The json output sticks arena info into an "arenas" dict; the table
-	 * output puts them at the top-level.
-	 */
-	emitter_json_dict_begin(emitter, "arenas");
-
-	CTL_GET("arenas.narenas", &uv, unsigned);
-	emitter_kv(emitter, "narenas", "Arenas", emitter_type_unsigned, &uv);
-
-	/*
-	 * Decay settings are emitted only in json mode; in table mode, they're
-	 * emitted as notes with the opt output, above.
-	 */
-	CTL_GET("arenas.dirty_decay_ms", &ssv, ssize_t);
-	emitter_json_kv(emitter, "dirty_decay_ms", emitter_type_ssize, &ssv);
-
-	CTL_GET("arenas.muzzy_decay_ms", &ssv, ssize_t);
-	emitter_json_kv(emitter, "muzzy_decay_ms", emitter_type_ssize, &ssv);
-
-	CTL_GET("arenas.quantum", &sv, size_t);
-	emitter_kv(emitter, "quantum", "Quantum size", emitter_type_size, &sv);
-
-	CTL_GET("arenas.page", &sv, size_t);
-	emitter_kv(emitter, "page", "Page size", emitter_type_size, &sv);
-
-	if (je_mallctl("arenas.tcache_max", (void *)&sv, &ssz, NULL, 0) == 0) {
-		emitter_kv(emitter, "tcache_max",
-		    "Maximum thread-cached size class", emitter_type_size, &sv);
-	}
-
-	unsigned nbins;
-	CTL_GET("arenas.nbins", &nbins, unsigned);
-	emitter_kv(emitter, "nbins", "Number of bin size classes",
-	    emitter_type_unsigned, &nbins);
-
-	unsigned nhbins;
-	CTL_GET("arenas.nhbins", &nhbins, unsigned);
-	emitter_kv(emitter, "nhbins", "Number of thread-cache bin size classes",
-	    emitter_type_unsigned, &nhbins);
-
-	/*
-	 * We do enough mallctls in a loop that we actually want to omit them
-	 * (not just omit the printing).
-	 */
-	if (emitter->output == emitter_output_json) {
-		emitter_json_arr_begin(emitter, "bin");
-		for (unsigned i = 0; i < nbins; i++) {
-			emitter_json_arr_obj_begin(emitter);
-
-			CTL_M2_GET("arenas.bin.0.size", i, &sv, size_t);
-			emitter_json_kv(emitter, "size", emitter_type_size,
-			    &sv);
-
-			CTL_M2_GET("arenas.bin.0.nregs", i, &u32v, uint32_t);
-			emitter_json_kv(emitter, "nregs", emitter_type_uint32,
-			    &u32v);
-
-			CTL_M2_GET("arenas.bin.0.slab_size", i, &sv, size_t);
-			emitter_json_kv(emitter, "slab_size", emitter_type_size,
-			    &sv);
-
-			emitter_json_arr_obj_end(emitter);
-		}
-		emitter_json_arr_end(emitter); /* Close "bin". */
-	}
-
-	unsigned nlextents;
-	CTL_GET("arenas.nlextents", &nlextents, unsigned);
-	emitter_kv(emitter, "nlextents", "Number of large size classes",
-	    emitter_type_unsigned, &nlextents);
-
-	if (emitter->output == emitter_output_json) {
-		emitter_json_arr_begin(emitter, "lextent");
-		for (unsigned i = 0; i < nlextents; i++) {
-			emitter_json_arr_obj_begin(emitter);
-
-			CTL_M2_GET("arenas.lextent.0.size", i, &sv, size_t);
-			emitter_json_kv(emitter, "size", emitter_type_size,
-			    &sv);
-
-			emitter_json_arr_obj_end(emitter);
-		}
-		emitter_json_arr_end(emitter); /* Close "lextent". */
-	}
-
-	emitter_json_dict_end(emitter); /* Close "arenas" */
-}
-
-static void
-stats_print_helper(emitter_t *emitter, bool merged, bool destroyed,
-    bool unmerged, bool bins, bool large, bool mutex) {
-	/*
-	 * These should be deleted.  We keep them around for a while, to aid in
-	 * the transition to the emitter code.
-	 */
-	size_t allocated, active, metadata, metadata_thp, resident, mapped,
-	    retained;
-	size_t num_background_threads;
-	uint64_t background_thread_num_runs, background_thread_run_interval;
-
-	CTL_GET("stats.allocated", &allocated, size_t);
-	CTL_GET("stats.active", &active, size_t);
-	CTL_GET("stats.metadata", &metadata, size_t);
-	CTL_GET("stats.metadata_thp", &metadata_thp, size_t);
-	CTL_GET("stats.resident", &resident, size_t);
-	CTL_GET("stats.mapped", &mapped, size_t);
-	CTL_GET("stats.retained", &retained, size_t);
-
-	if (have_background_thread) {
-		CTL_GET("stats.background_thread.num_threads",
-		    &num_background_threads, size_t);
-		CTL_GET("stats.background_thread.num_runs",
-		    &background_thread_num_runs, uint64_t);
-		CTL_GET("stats.background_thread.run_interval",
-		    &background_thread_run_interval, uint64_t);
-	} else {
-		num_background_threads = 0;
-		background_thread_num_runs = 0;
-		background_thread_run_interval = 0;
-	}
-
-	/* Generic global stats. */
-	emitter_json_dict_begin(emitter, "stats");
-	emitter_json_kv(emitter, "allocated", emitter_type_size, &allocated);
-	emitter_json_kv(emitter, "active", emitter_type_size, &active);
-	emitter_json_kv(emitter, "metadata", emitter_type_size, &metadata);
-	emitter_json_kv(emitter, "metadata_thp", emitter_type_size,
-	    &metadata_thp);
-	emitter_json_kv(emitter, "resident", emitter_type_size, &resident);
-	emitter_json_kv(emitter, "mapped", emitter_type_size, &mapped);
-	emitter_json_kv(emitter, "retained", emitter_type_size, &retained);
-
-	emitter_table_printf(emitter, "Allocated: %zu, active: %zu, "
-	    "metadata: %zu (n_thp %zu), resident: %zu, mapped: %zu, "
-	    "retained: %zu\n", allocated, active, metadata, metadata_thp,
-	    resident, mapped, retained);
-
-	/* Background thread stats. */
-	emitter_json_dict_begin(emitter, "background_thread");
-	emitter_json_kv(emitter, "num_threads", emitter_type_size,
-	    &num_background_threads);
-	emitter_json_kv(emitter, "num_runs", emitter_type_uint64,
-	    &background_thread_num_runs);
-	emitter_json_kv(emitter, "run_interval", emitter_type_uint64,
-	    &background_thread_run_interval);
-	emitter_json_dict_end(emitter); /* Close "background_thread". */
-
-	emitter_table_printf(emitter, "Background threads: %zu, "
-	    "num_runs: %"FMTu64", run_interval: %"FMTu64" ns\n",
-	    num_background_threads, background_thread_num_runs,
-	    background_thread_run_interval);
-
-	if (mutex) {
-		emitter_row_t row;
-		emitter_col_t name;
-		emitter_col_t col64[mutex_prof_num_uint64_t_counters];
-		emitter_col_t col32[mutex_prof_num_uint32_t_counters];
-
-		emitter_row_init(&row);
-		mutex_stats_init_cols(&row, "", &name, col64, col32);
-
-		emitter_table_row(emitter, &row);
-		emitter_json_dict_begin(emitter, "mutexes");
-
-		for (int i = 0; i < mutex_prof_num_global_mutexes; i++) {
-			mutex_stats_read_global(global_mutex_names[i], &name,
-			    col64, col32);
-			emitter_json_dict_begin(emitter, global_mutex_names[i]);
-			mutex_stats_emit(emitter, &row, col64, col32);
-			emitter_json_dict_end(emitter);
-		}
-
-		emitter_json_dict_end(emitter); /* Close "mutexes". */
-	}
-
-	emitter_json_dict_end(emitter); /* Close "stats". */
-
-	if (merged || destroyed || unmerged) {
-		unsigned narenas;
-
-		emitter_json_dict_begin(emitter, "stats.arenas");
-
-		CTL_GET("arenas.narenas", &narenas, unsigned);
-		size_t mib[3];
-		size_t miblen = sizeof(mib) / sizeof(size_t);
-		size_t sz;
-		VARIABLE_ARRAY(bool, initialized, narenas);
-		bool destroyed_initialized;
-		unsigned i, j, ninitialized;
-
-		xmallctlnametomib("arena.0.initialized", mib, &miblen);
-		for (i = ninitialized = 0; i < narenas; i++) {
-			mib[1] = i;
-			sz = sizeof(bool);
-			xmallctlbymib(mib, miblen, &initialized[i], &sz,
-			    NULL, 0);
-			if (initialized[i]) {
-				ninitialized++;
-			}
-		}
-		mib[1] = MALLCTL_ARENAS_DESTROYED;
-		sz = sizeof(bool);
-		xmallctlbymib(mib, miblen, &destroyed_initialized, &sz,
-		    NULL, 0);
-
-		/* Merged stats. */
-		if (merged && (ninitialized > 1 || !unmerged)) {
-			/* Print merged arena stats. */
-			emitter_table_printf(emitter, "Merged arenas stats:\n");
-			emitter_json_dict_begin(emitter, "merged");
-			stats_arena_print(emitter, MALLCTL_ARENAS_ALL, bins,
-			    large, mutex);
-			emitter_json_dict_end(emitter); /* Close "merged". */
-		}
-
-		/* Destroyed stats. */
-		if (destroyed_initialized && destroyed) {
-			/* Print destroyed arena stats. */
-			emitter_table_printf(emitter,
-			    "Destroyed arenas stats:\n");
-			emitter_json_dict_begin(emitter, "destroyed");
-			stats_arena_print(emitter, MALLCTL_ARENAS_DESTROYED,
-			    bins, large, mutex);
-			emitter_json_dict_end(emitter); /* Close "destroyed". */
-		}
-
-		/* Unmerged stats. */
-		if (unmerged) {
-			for (i = j = 0; i < narenas; i++) {
-				if (initialized[i]) {
-					char arena_ind_str[20];
-					malloc_snprintf(arena_ind_str,
-					    sizeof(arena_ind_str), "%u", i);
-					emitter_json_dict_begin(emitter,
-					    arena_ind_str);
-					emitter_table_printf(emitter,
-					    "arenas[%s]:\n", arena_ind_str);
-					stats_arena_print(emitter, i, bins,
-					    large, mutex);
-					/* Close "<arena-ind>". */
-					emitter_json_dict_end(emitter);
-				}
-			}
-		}
-		emitter_json_dict_end(emitter); /* Close "stats.arenas". */
-	}
-}
-
-void
-stats_print(void (*write_cb)(void *, const char *), void *cbopaque,
-    const char *opts) {
-	int err;
-	uint64_t epoch;
-	size_t u64sz;
-#define OPTION(o, v, d, s) bool v = d;
-	STATS_PRINT_OPTIONS
-#undef OPTION
-
-	/*
-	 * Refresh stats, in case mallctl() was called by the application.
-	 *
-	 * Check for OOM here, since refreshing the ctl cache can trigger
-	 * allocation.  In practice, none of the subsequent mallctl()-related
-	 * calls in this function will cause OOM if this one succeeds.
-	 * */
-	epoch = 1;
-	u64sz = sizeof(uint64_t);
-	err = je_mallctl("epoch", (void *)&epoch, &u64sz, (void *)&epoch,
-	    sizeof(uint64_t));
-	if (err != 0) {
-		if (err == EAGAIN) {
-			malloc_write("<jemalloc>: Memory allocation failure in "
-			    "mallctl(\"epoch\", ...)\n");
-			return;
-		}
-		malloc_write("<jemalloc>: Failure in mallctl(\"epoch\", "
-		    "...)\n");
-		abort();
-	}
-
-	if (opts != NULL) {
-		for (unsigned i = 0; opts[i] != '\0'; i++) {
-			switch (opts[i]) {
-#define OPTION(o, v, d, s) case o: v = s; break;
-				STATS_PRINT_OPTIONS
-#undef OPTION
-			default:;
-			}
-		}
-	}
-
-	emitter_t emitter;
-	emitter_init(&emitter,
-	    json ? emitter_output_json : emitter_output_table, write_cb,
-	    cbopaque);
-	emitter_begin(&emitter);
-	emitter_table_printf(&emitter, "___ Begin jemalloc statistics ___\n");
-	emitter_json_dict_begin(&emitter, "jemalloc");
-
-	if (general) {
-		stats_general_print(&emitter);
-	}
-	if (config_stats) {
-		stats_print_helper(&emitter, merged, destroyed, unmerged,
-		    bins, large, mutex);
-	}
-
-	emitter_json_dict_end(&emitter); /* Closes the "jemalloc" dict. */
-	emitter_table_printf(&emitter, "--- End jemalloc statistics ---\n");
-	emitter_end(&emitter);
-}
diff --git a/redis-stable/deps/jemalloc/src/sz.c b/redis-stable/deps/jemalloc/src/sz.c
deleted file mode 100644
index 9de77e45..00000000
--- a/redis-stable/deps/jemalloc/src/sz.c
+++ /dev/null
@@ -1,107 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/sz.h"
-
-JEMALLOC_ALIGNED(CACHELINE)
-const size_t sz_pind2sz_tab[NPSIZES+1] = {
-#define PSZ_yes(lg_grp, ndelta, lg_delta)				\
-	(((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta))),
-#define PSZ_no(lg_grp, ndelta, lg_delta)
-#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
-	PSZ_##psz(lg_grp, ndelta, lg_delta)
-	SIZE_CLASSES
-#undef PSZ_yes
-#undef PSZ_no
-#undef SC
-	(LARGE_MAXCLASS + PAGE)
-};
-
-JEMALLOC_ALIGNED(CACHELINE)
-const size_t sz_index2size_tab[NSIZES] = {
-#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
-	((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)),
-	SIZE_CLASSES
-#undef SC
-};
-
-JEMALLOC_ALIGNED(CACHELINE)
-const uint8_t sz_size2index_tab[] = {
-#if LG_TINY_MIN == 0
-/* The div module doesn't support division by 1. */
-#error "Unsupported LG_TINY_MIN"
-#define S2B_0(i)	i,
-#elif LG_TINY_MIN == 1
-#warning "Dangerous LG_TINY_MIN"
-#define S2B_1(i)	i,
-#elif LG_TINY_MIN == 2
-#warning "Dangerous LG_TINY_MIN"
-#define S2B_2(i)	i,
-#elif LG_TINY_MIN == 3
-#define S2B_3(i)	i,
-#elif LG_TINY_MIN == 4
-#define S2B_4(i)	i,
-#elif LG_TINY_MIN == 5
-#define S2B_5(i)	i,
-#elif LG_TINY_MIN == 6
-#define S2B_6(i)	i,
-#elif LG_TINY_MIN == 7
-#define S2B_7(i)	i,
-#elif LG_TINY_MIN == 8
-#define S2B_8(i)	i,
-#elif LG_TINY_MIN == 9
-#define S2B_9(i)	i,
-#elif LG_TINY_MIN == 10
-#define S2B_10(i)	i,
-#elif LG_TINY_MIN == 11
-#define S2B_11(i)	i,
-#else
-#error "Unsupported LG_TINY_MIN"
-#endif
-#if LG_TINY_MIN < 1
-#define S2B_1(i)	S2B_0(i) S2B_0(i)
-#endif
-#if LG_TINY_MIN < 2
-#define S2B_2(i)	S2B_1(i) S2B_1(i)
-#endif
-#if LG_TINY_MIN < 3
-#define S2B_3(i)	S2B_2(i) S2B_2(i)
-#endif
-#if LG_TINY_MIN < 4
-#define S2B_4(i)	S2B_3(i) S2B_3(i)
-#endif
-#if LG_TINY_MIN < 5
-#define S2B_5(i)	S2B_4(i) S2B_4(i)
-#endif
-#if LG_TINY_MIN < 6
-#define S2B_6(i)	S2B_5(i) S2B_5(i)
-#endif
-#if LG_TINY_MIN < 7
-#define S2B_7(i)	S2B_6(i) S2B_6(i)
-#endif
-#if LG_TINY_MIN < 8
-#define S2B_8(i)	S2B_7(i) S2B_7(i)
-#endif
-#if LG_TINY_MIN < 9
-#define S2B_9(i)	S2B_8(i) S2B_8(i)
-#endif
-#if LG_TINY_MIN < 10
-#define S2B_10(i)	S2B_9(i) S2B_9(i)
-#endif
-#if LG_TINY_MIN < 11
-#define S2B_11(i)	S2B_10(i) S2B_10(i)
-#endif
-#define S2B_no(i)
-#define SC(index, lg_grp, lg_delta, ndelta, psz, bin, pgs, lg_delta_lookup) \
-	S2B_##lg_delta_lookup(index)
-	SIZE_CLASSES
-#undef S2B_3
-#undef S2B_4
-#undef S2B_5
-#undef S2B_6
-#undef S2B_7
-#undef S2B_8
-#undef S2B_9
-#undef S2B_10
-#undef S2B_11
-#undef S2B_no
-#undef SC
-};
diff --git a/redis-stable/deps/jemalloc/src/tcache.c b/redis-stable/deps/jemalloc/src/tcache.c
deleted file mode 100644
index a769a6b1..00000000
--- a/redis-stable/deps/jemalloc/src/tcache.c
+++ /dev/null
@@ -1,717 +0,0 @@
-#define JEMALLOC_TCACHE_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/size_classes.h"
-
-/******************************************************************************/
-/* Data. */
-
-bool	opt_tcache = true;
-ssize_t	opt_lg_tcache_max = LG_TCACHE_MAXCLASS_DEFAULT;
-
-cache_bin_info_t	*tcache_bin_info;
-static unsigned		stack_nelms; /* Total stack elms per tcache. */
-
-unsigned		nhbins;
-size_t			tcache_maxclass;
-
-tcaches_t		*tcaches;
-
-/* Index of first element within tcaches that has never been used. */
-static unsigned		tcaches_past;
-
-/* Head of singly linked list tracking available tcaches elements. */
-static tcaches_t	*tcaches_avail;
-
-/* Protects tcaches{,_past,_avail}. */
-static malloc_mutex_t	tcaches_mtx;
-
-/******************************************************************************/
-
-size_t
-tcache_salloc(tsdn_t *tsdn, const void *ptr) {
-	return arena_salloc(tsdn, ptr);
-}
-
-void
-tcache_event_hard(tsd_t *tsd, tcache_t *tcache) {
-	szind_t binind = tcache->next_gc_bin;
-
-	cache_bin_t *tbin;
-	if (binind < NBINS) {
-		tbin = tcache_small_bin_get(tcache, binind);
-	} else {
-		tbin = tcache_large_bin_get(tcache, binind);
-	}
-	if (tbin->low_water > 0) {
-		/*
-		 * Flush (ceiling) 3/4 of the objects below the low water mark.
-		 */
-		if (binind < NBINS) {
-			tcache_bin_flush_small(tsd, tcache, tbin, binind,
-			    tbin->ncached - tbin->low_water + (tbin->low_water
-			    >> 2));
-			/*
-			 * Reduce fill count by 2X.  Limit lg_fill_div such that
-			 * the fill count is always at least 1.
-			 */
-			cache_bin_info_t *tbin_info = &tcache_bin_info[binind];
-			if ((tbin_info->ncached_max >>
-			     (tcache->lg_fill_div[binind] + 1)) >= 1) {
-				tcache->lg_fill_div[binind]++;
-			}
-		} else {
-			tcache_bin_flush_large(tsd, tbin, binind, tbin->ncached
-			    - tbin->low_water + (tbin->low_water >> 2), tcache);
-		}
-	} else if (tbin->low_water < 0) {
-		/*
-		 * Increase fill count by 2X for small bins.  Make sure
-		 * lg_fill_div stays greater than 0.
-		 */
-		if (binind < NBINS && tcache->lg_fill_div[binind] > 1) {
-			tcache->lg_fill_div[binind]--;
-		}
-	}
-	tbin->low_water = tbin->ncached;
-
-	tcache->next_gc_bin++;
-	if (tcache->next_gc_bin == nhbins) {
-		tcache->next_gc_bin = 0;
-	}
-}
-
-void *
-tcache_alloc_small_hard(tsdn_t *tsdn, arena_t *arena, tcache_t *tcache,
-    cache_bin_t *tbin, szind_t binind, bool *tcache_success) {
-	void *ret;
-
-	assert(tcache->arena != NULL);
-	arena_tcache_fill_small(tsdn, arena, tcache, tbin, binind,
-	    config_prof ? tcache->prof_accumbytes : 0);
-	if (config_prof) {
-		tcache->prof_accumbytes = 0;
-	}
-	ret = cache_bin_alloc_easy(tbin, tcache_success);
-
-	return ret;
-}
-
-void
-tcache_bin_flush_small(tsd_t *tsd, tcache_t *tcache, cache_bin_t *tbin,
-    szind_t binind, unsigned rem) {
-	bool merged_stats = false;
-
-	assert(binind < NBINS);
-	assert((cache_bin_sz_t)rem <= tbin->ncached);
-
-	arena_t *arena = tcache->arena;
-	assert(arena != NULL);
-	unsigned nflush = tbin->ncached - rem;
-	VARIABLE_ARRAY(extent_t *, item_extent, nflush);
-	/* Look up extent once per item. */
-	for (unsigned i = 0 ; i < nflush; i++) {
-		item_extent[i] = iealloc(tsd_tsdn(tsd), *(tbin->avail - 1 - i));
-	}
-
-	while (nflush > 0) {
-		/* Lock the arena bin associated with the first object. */
-		extent_t *extent = item_extent[0];
-		arena_t *bin_arena = extent_arena_get(extent);
-		bin_t *bin = &bin_arena->bins[binind];
-
-		if (config_prof && bin_arena == arena) {
-			if (arena_prof_accum(tsd_tsdn(tsd), arena,
-			    tcache->prof_accumbytes)) {
-				prof_idump(tsd_tsdn(tsd));
-			}
-			tcache->prof_accumbytes = 0;
-		}
-
-		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		if (config_stats && bin_arena == arena) {
-			assert(!merged_stats);
-			merged_stats = true;
-			bin->stats.nflushes++;
-			bin->stats.nrequests += tbin->tstats.nrequests;
-			tbin->tstats.nrequests = 0;
-		}
-		unsigned ndeferred = 0;
-		for (unsigned i = 0; i < nflush; i++) {
-			void *ptr = *(tbin->avail - 1 - i);
-			extent = item_extent[i];
-			assert(ptr != NULL && extent != NULL);
-
-			if (extent_arena_get(extent) == bin_arena) {
-				arena_dalloc_bin_junked_locked(tsd_tsdn(tsd),
-				    bin_arena, extent, ptr);
-			} else {
-				/*
-				 * This object was allocated via a different
-				 * arena bin than the one that is currently
-				 * locked.  Stash the object, so that it can be
-				 * handled in a future pass.
-				 */
-				*(tbin->avail - 1 - ndeferred) = ptr;
-				item_extent[ndeferred] = extent;
-				ndeferred++;
-			}
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-		arena_decay_ticks(tsd_tsdn(tsd), bin_arena, nflush - ndeferred);
-		nflush = ndeferred;
-	}
-	if (config_stats && !merged_stats) {
-		/*
-		 * The flush loop didn't happen to flush to this thread's
-		 * arena, so the stats didn't get merged.  Manually do so now.
-		 */
-		bin_t *bin = &arena->bins[binind];
-		malloc_mutex_lock(tsd_tsdn(tsd), &bin->lock);
-		bin->stats.nflushes++;
-		bin->stats.nrequests += tbin->tstats.nrequests;
-		tbin->tstats.nrequests = 0;
-		malloc_mutex_unlock(tsd_tsdn(tsd), &bin->lock);
-	}
-
-	memmove(tbin->avail - rem, tbin->avail - tbin->ncached, rem *
-	    sizeof(void *));
-	tbin->ncached = rem;
-	if (tbin->ncached < tbin->low_water) {
-		tbin->low_water = tbin->ncached;
-	}
-}
-
-void
-tcache_bin_flush_large(tsd_t *tsd, cache_bin_t *tbin, szind_t binind,
-    unsigned rem, tcache_t *tcache) {
-	bool merged_stats = false;
-
-	assert(binind < nhbins);
-	assert((cache_bin_sz_t)rem <= tbin->ncached);
-
-	arena_t *arena = tcache->arena;
-	assert(arena != NULL);
-	unsigned nflush = tbin->ncached - rem;
-	VARIABLE_ARRAY(extent_t *, item_extent, nflush);
-	/* Look up extent once per item. */
-	for (unsigned i = 0 ; i < nflush; i++) {
-		item_extent[i] = iealloc(tsd_tsdn(tsd), *(tbin->avail - 1 - i));
-	}
-
-	while (nflush > 0) {
-		/* Lock the arena associated with the first object. */
-		extent_t *extent = item_extent[0];
-		arena_t *locked_arena = extent_arena_get(extent);
-		UNUSED bool idump;
-
-		if (config_prof) {
-			idump = false;
-		}
-
-		malloc_mutex_lock(tsd_tsdn(tsd), &locked_arena->large_mtx);
-		for (unsigned i = 0; i < nflush; i++) {
-			void *ptr = *(tbin->avail - 1 - i);
-			assert(ptr != NULL);
-			extent = item_extent[i];
-			if (extent_arena_get(extent) == locked_arena) {
-				large_dalloc_prep_junked_locked(tsd_tsdn(tsd),
-				    extent);
-			}
-		}
-		if ((config_prof || config_stats) && locked_arena == arena) {
-			if (config_prof) {
-				idump = arena_prof_accum(tsd_tsdn(tsd), arena,
-				    tcache->prof_accumbytes);
-				tcache->prof_accumbytes = 0;
-			}
-			if (config_stats) {
-				merged_stats = true;
-				arena_stats_large_nrequests_add(tsd_tsdn(tsd),
-				    &arena->stats, binind,
-				    tbin->tstats.nrequests);
-				tbin->tstats.nrequests = 0;
-			}
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &locked_arena->large_mtx);
-
-		unsigned ndeferred = 0;
-		for (unsigned i = 0; i < nflush; i++) {
-			void *ptr = *(tbin->avail - 1 - i);
-			extent = item_extent[i];
-			assert(ptr != NULL && extent != NULL);
-
-			if (extent_arena_get(extent) == locked_arena) {
-				large_dalloc_finish(tsd_tsdn(tsd), extent);
-			} else {
-				/*
-				 * This object was allocated via a different
-				 * arena than the one that is currently locked.
-				 * Stash the object, so that it can be handled
-				 * in a future pass.
-				 */
-				*(tbin->avail - 1 - ndeferred) = ptr;
-				item_extent[ndeferred] = extent;
-				ndeferred++;
-			}
-		}
-		if (config_prof && idump) {
-			prof_idump(tsd_tsdn(tsd));
-		}
-		arena_decay_ticks(tsd_tsdn(tsd), locked_arena, nflush -
-		    ndeferred);
-		nflush = ndeferred;
-	}
-	if (config_stats && !merged_stats) {
-		/*
-		 * The flush loop didn't happen to flush to this thread's
-		 * arena, so the stats didn't get merged.  Manually do so now.
-		 */
-		arena_stats_large_nrequests_add(tsd_tsdn(tsd), &arena->stats,
-		    binind, tbin->tstats.nrequests);
-		tbin->tstats.nrequests = 0;
-	}
-
-	memmove(tbin->avail - rem, tbin->avail - tbin->ncached, rem *
-	    sizeof(void *));
-	tbin->ncached = rem;
-	if (tbin->ncached < tbin->low_water) {
-		tbin->low_water = tbin->ncached;
-	}
-}
-
-void
-tcache_arena_associate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
-	assert(tcache->arena == NULL);
-	tcache->arena = arena;
-
-	if (config_stats) {
-		/* Link into list of extant tcaches. */
-		malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
-
-		ql_elm_new(tcache, link);
-		ql_tail_insert(&arena->tcache_ql, tcache, link);
-		cache_bin_array_descriptor_init(
-		    &tcache->cache_bin_array_descriptor, tcache->bins_small,
-		    tcache->bins_large);
-		ql_tail_insert(&arena->cache_bin_array_descriptor_ql,
-		    &tcache->cache_bin_array_descriptor, link);
-
-		malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
-	}
-}
-
-static void
-tcache_arena_dissociate(tsdn_t *tsdn, tcache_t *tcache) {
-	arena_t *arena = tcache->arena;
-	assert(arena != NULL);
-	if (config_stats) {
-		/* Unlink from list of extant tcaches. */
-		malloc_mutex_lock(tsdn, &arena->tcache_ql_mtx);
-		if (config_debug) {
-			bool in_ql = false;
-			tcache_t *iter;
-			ql_foreach(iter, &arena->tcache_ql, link) {
-				if (iter == tcache) {
-					in_ql = true;
-					break;
-				}
-			}
-			assert(in_ql);
-		}
-		ql_remove(&arena->tcache_ql, tcache, link);
-		ql_remove(&arena->cache_bin_array_descriptor_ql,
-		    &tcache->cache_bin_array_descriptor, link);
-		tcache_stats_merge(tsdn, tcache, arena);
-		malloc_mutex_unlock(tsdn, &arena->tcache_ql_mtx);
-	}
-	tcache->arena = NULL;
-}
-
-void
-tcache_arena_reassociate(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
-	tcache_arena_dissociate(tsdn, tcache);
-	tcache_arena_associate(tsdn, tcache, arena);
-}
-
-bool
-tsd_tcache_enabled_data_init(tsd_t *tsd) {
-	/* Called upon tsd initialization. */
-	tsd_tcache_enabled_set(tsd, opt_tcache);
-	tsd_slow_update(tsd);
-
-	if (opt_tcache) {
-		/* Trigger tcache init. */
-		tsd_tcache_data_init(tsd);
-	}
-
-	return false;
-}
-
-/* Initialize auto tcache (embedded in TSD). */
-static void
-tcache_init(tsd_t *tsd, tcache_t *tcache, void *avail_stack) {
-	memset(&tcache->link, 0, sizeof(ql_elm(tcache_t)));
-	tcache->prof_accumbytes = 0;
-	tcache->next_gc_bin = 0;
-	tcache->arena = NULL;
-
-	ticker_init(&tcache->gc_ticker, TCACHE_GC_INCR);
-
-	size_t stack_offset = 0;
-	assert((TCACHE_NSLOTS_SMALL_MAX & 1U) == 0);
-	memset(tcache->bins_small, 0, sizeof(cache_bin_t) * NBINS);
-	memset(tcache->bins_large, 0, sizeof(cache_bin_t) * (nhbins - NBINS));
-	unsigned i = 0;
-	for (; i < NBINS; i++) {
-		tcache->lg_fill_div[i] = 1;
-		stack_offset += tcache_bin_info[i].ncached_max * sizeof(void *);
-		/*
-		 * avail points past the available space.  Allocations will
-		 * access the slots toward higher addresses (for the benefit of
-		 * prefetch).
-		 */
-		tcache_small_bin_get(tcache, i)->avail =
-		    (void **)((uintptr_t)avail_stack + (uintptr_t)stack_offset);
-	}
-	for (; i < nhbins; i++) {
-		stack_offset += tcache_bin_info[i].ncached_max * sizeof(void *);
-		tcache_large_bin_get(tcache, i)->avail =
-		    (void **)((uintptr_t)avail_stack + (uintptr_t)stack_offset);
-	}
-	assert(stack_offset == stack_nelms * sizeof(void *));
-}
-
-/* Initialize auto tcache (embedded in TSD). */
-bool
-tsd_tcache_data_init(tsd_t *tsd) {
-	tcache_t *tcache = tsd_tcachep_get_unsafe(tsd);
-	assert(tcache_small_bin_get(tcache, 0)->avail == NULL);
-	size_t size = stack_nelms * sizeof(void *);
-	/* Avoid false cacheline sharing. */
-	size = sz_sa2u(size, CACHELINE);
-
-	void *avail_array = ipallocztm(tsd_tsdn(tsd), size, CACHELINE, true,
-	    NULL, true, arena_get(TSDN_NULL, 0, true));
-	if (avail_array == NULL) {
-		return true;
-	}
-
-	tcache_init(tsd, tcache, avail_array);
-	/*
-	 * Initialization is a bit tricky here.  After malloc init is done, all
-	 * threads can rely on arena_choose and associate tcache accordingly.
-	 * However, the thread that does actual malloc bootstrapping relies on
-	 * functional tsd, and it can only rely on a0.  In that case, we
-	 * associate its tcache to a0 temporarily, and later on
-	 * arena_choose_hard() will re-associate properly.
-	 */
-	tcache->arena = NULL;
-	arena_t *arena;
-	if (!malloc_initialized()) {
-		/* If in initialization, assign to a0. */
-		arena = arena_get(tsd_tsdn(tsd), 0, false);
-		tcache_arena_associate(tsd_tsdn(tsd), tcache, arena);
-	} else {
-		arena = arena_choose(tsd, NULL);
-		/* This may happen if thread.tcache.enabled is used. */
-		if (tcache->arena == NULL) {
-			tcache_arena_associate(tsd_tsdn(tsd), tcache, arena);
-		}
-	}
-	assert(arena == tcache->arena);
-
-	return false;
-}
-
-/* Created manual tcache for tcache.create mallctl. */
-tcache_t *
-tcache_create_explicit(tsd_t *tsd) {
-	tcache_t *tcache;
-	size_t size, stack_offset;
-
-	size = sizeof(tcache_t);
-	/* Naturally align the pointer stacks. */
-	size = PTR_CEILING(size);
-	stack_offset = size;
-	size += stack_nelms * sizeof(void *);
-	/* Avoid false cacheline sharing. */
-	size = sz_sa2u(size, CACHELINE);
-
-	tcache = ipallocztm(tsd_tsdn(tsd), size, CACHELINE, true, NULL, true,
-	    arena_get(TSDN_NULL, 0, true));
-	if (tcache == NULL) {
-		return NULL;
-	}
-
-	tcache_init(tsd, tcache,
-	    (void *)((uintptr_t)tcache + (uintptr_t)stack_offset));
-	tcache_arena_associate(tsd_tsdn(tsd), tcache, arena_ichoose(tsd, NULL));
-
-	return tcache;
-}
-
-static void
-tcache_flush_cache(tsd_t *tsd, tcache_t *tcache) {
-	assert(tcache->arena != NULL);
-
-	for (unsigned i = 0; i < NBINS; i++) {
-		cache_bin_t *tbin = tcache_small_bin_get(tcache, i);
-		tcache_bin_flush_small(tsd, tcache, tbin, i, 0);
-
-		if (config_stats) {
-			assert(tbin->tstats.nrequests == 0);
-		}
-	}
-	for (unsigned i = NBINS; i < nhbins; i++) {
-		cache_bin_t *tbin = tcache_large_bin_get(tcache, i);
-		tcache_bin_flush_large(tsd, tbin, i, 0, tcache);
-
-		if (config_stats) {
-			assert(tbin->tstats.nrequests == 0);
-		}
-	}
-
-	if (config_prof && tcache->prof_accumbytes > 0 &&
-	    arena_prof_accum(tsd_tsdn(tsd), tcache->arena,
-	    tcache->prof_accumbytes)) {
-		prof_idump(tsd_tsdn(tsd));
-	}
-}
-
-void
-tcache_flush(tsd_t *tsd) {
-	assert(tcache_available(tsd));
-	tcache_flush_cache(tsd, tsd_tcachep_get(tsd));
-}
-
-static void
-tcache_destroy(tsd_t *tsd, tcache_t *tcache, bool tsd_tcache) {
-	tcache_flush_cache(tsd, tcache);
-	tcache_arena_dissociate(tsd_tsdn(tsd), tcache);
-
-	if (tsd_tcache) {
-		/* Release the avail array for the TSD embedded auto tcache. */
-		void *avail_array =
-		    (void *)((uintptr_t)tcache_small_bin_get(tcache, 0)->avail -
-		    (uintptr_t)tcache_bin_info[0].ncached_max * sizeof(void *));
-		idalloctm(tsd_tsdn(tsd), avail_array, NULL, NULL, true, true);
-	} else {
-		/* Release both the tcache struct and avail array. */
-		idalloctm(tsd_tsdn(tsd), tcache, NULL, NULL, true, true);
-	}
-}
-
-/* For auto tcache (embedded in TSD) only. */
-void
-tcache_cleanup(tsd_t *tsd) {
-	tcache_t *tcache = tsd_tcachep_get(tsd);
-	if (!tcache_available(tsd)) {
-		assert(tsd_tcache_enabled_get(tsd) == false);
-		if (config_debug) {
-			assert(tcache_small_bin_get(tcache, 0)->avail == NULL);
-		}
-		return;
-	}
-	assert(tsd_tcache_enabled_get(tsd));
-	assert(tcache_small_bin_get(tcache, 0)->avail != NULL);
-
-	tcache_destroy(tsd, tcache, true);
-	if (config_debug) {
-		tcache_small_bin_get(tcache, 0)->avail = NULL;
-	}
-}
-
-void
-tcache_stats_merge(tsdn_t *tsdn, tcache_t *tcache, arena_t *arena) {
-	unsigned i;
-
-	cassert(config_stats);
-
-	/* Merge and reset tcache stats. */
-	for (i = 0; i < NBINS; i++) {
-		bin_t *bin = &arena->bins[i];
-		cache_bin_t *tbin = tcache_small_bin_get(tcache, i);
-		malloc_mutex_lock(tsdn, &bin->lock);
-		bin->stats.nrequests += tbin->tstats.nrequests;
-		malloc_mutex_unlock(tsdn, &bin->lock);
-		tbin->tstats.nrequests = 0;
-	}
-
-	for (; i < nhbins; i++) {
-		cache_bin_t *tbin = tcache_large_bin_get(tcache, i);
-		arena_stats_large_nrequests_add(tsdn, &arena->stats, i,
-		    tbin->tstats.nrequests);
-		tbin->tstats.nrequests = 0;
-	}
-}
-
-static bool
-tcaches_create_prep(tsd_t *tsd) {
-	bool err;
-
-	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
-
-	if (tcaches == NULL) {
-		tcaches = base_alloc(tsd_tsdn(tsd), b0get(), sizeof(tcache_t *)
-		    * (MALLOCX_TCACHE_MAX+1), CACHELINE);
-		if (tcaches == NULL) {
-			err = true;
-			goto label_return;
-		}
-	}
-
-	if (tcaches_avail == NULL && tcaches_past > MALLOCX_TCACHE_MAX) {
-		err = true;
-		goto label_return;
-	}
-
-	err = false;
-label_return:
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
-	return err;
-}
-
-bool
-tcaches_create(tsd_t *tsd, unsigned *r_ind) {
-	witness_assert_depth(tsdn_witness_tsdp_get(tsd_tsdn(tsd)), 0);
-
-	bool err;
-
-	if (tcaches_create_prep(tsd)) {
-		err = true;
-		goto label_return;
-	}
-
-	tcache_t *tcache = tcache_create_explicit(tsd);
-	if (tcache == NULL) {
-		err = true;
-		goto label_return;
-	}
-
-	tcaches_t *elm;
-	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
-	if (tcaches_avail != NULL) {
-		elm = tcaches_avail;
-		tcaches_avail = tcaches_avail->next;
-		elm->tcache = tcache;
-		*r_ind = (unsigned)(elm - tcaches);
-	} else {
-		elm = &tcaches[tcaches_past];
-		elm->tcache = tcache;
-		*r_ind = tcaches_past;
-		tcaches_past++;
-	}
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
-
-	err = false;
-label_return:
-	witness_assert_depth(tsdn_witness_tsdp_get(tsd_tsdn(tsd)), 0);
-	return err;
-}
-
-static tcache_t *
-tcaches_elm_remove(tsd_t *tsd, tcaches_t *elm) {
-	malloc_mutex_assert_owner(tsd_tsdn(tsd), &tcaches_mtx);
-
-	if (elm->tcache == NULL) {
-		return NULL;
-	}
-	tcache_t *tcache = elm->tcache;
-	elm->tcache = NULL;
-	return tcache;
-}
-
-void
-tcaches_flush(tsd_t *tsd, unsigned ind) {
-	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
-	tcache_t *tcache = tcaches_elm_remove(tsd, &tcaches[ind]);
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
-	if (tcache != NULL) {
-		tcache_destroy(tsd, tcache, false);
-	}
-}
-
-void
-tcaches_destroy(tsd_t *tsd, unsigned ind) {
-	malloc_mutex_lock(tsd_tsdn(tsd), &tcaches_mtx);
-	tcaches_t *elm = &tcaches[ind];
-	tcache_t *tcache = tcaches_elm_remove(tsd, elm);
-	elm->next = tcaches_avail;
-	tcaches_avail = elm;
-	malloc_mutex_unlock(tsd_tsdn(tsd), &tcaches_mtx);
-	if (tcache != NULL) {
-		tcache_destroy(tsd, tcache, false);
-	}
-}
-
-bool
-tcache_boot(tsdn_t *tsdn) {
-	/* If necessary, clamp opt_lg_tcache_max. */
-	if (opt_lg_tcache_max < 0 || (ZU(1) << opt_lg_tcache_max) <
-	    SMALL_MAXCLASS) {
-		tcache_maxclass = SMALL_MAXCLASS;
-	} else {
-		tcache_maxclass = (ZU(1) << opt_lg_tcache_max);
-	}
-
-	if (malloc_mutex_init(&tcaches_mtx, "tcaches", WITNESS_RANK_TCACHES,
-	    malloc_mutex_rank_exclusive)) {
-		return true;
-	}
-
-	nhbins = sz_size2index(tcache_maxclass) + 1;
-
-	/* Initialize tcache_bin_info. */
-	tcache_bin_info = (cache_bin_info_t *)base_alloc(tsdn, b0get(), nhbins
-	    * sizeof(cache_bin_info_t), CACHELINE);
-	if (tcache_bin_info == NULL) {
-		return true;
-	}
-	stack_nelms = 0;
-	unsigned i;
-	for (i = 0; i < NBINS; i++) {
-		if ((bin_infos[i].nregs << 1) <= TCACHE_NSLOTS_SMALL_MIN) {
-			tcache_bin_info[i].ncached_max =
-			    TCACHE_NSLOTS_SMALL_MIN;
-		} else if ((bin_infos[i].nregs << 1) <=
-		    TCACHE_NSLOTS_SMALL_MAX) {
-			tcache_bin_info[i].ncached_max =
-			    (bin_infos[i].nregs << 1);
-		} else {
-			tcache_bin_info[i].ncached_max =
-			    TCACHE_NSLOTS_SMALL_MAX;
-		}
-		stack_nelms += tcache_bin_info[i].ncached_max;
-	}
-	for (; i < nhbins; i++) {
-		tcache_bin_info[i].ncached_max = TCACHE_NSLOTS_LARGE;
-		stack_nelms += tcache_bin_info[i].ncached_max;
-	}
-
-	return false;
-}
-
-void
-tcache_prefork(tsdn_t *tsdn) {
-	if (!config_prof && opt_tcache) {
-		malloc_mutex_prefork(tsdn, &tcaches_mtx);
-	}
-}
-
-void
-tcache_postfork_parent(tsdn_t *tsdn) {
-	if (!config_prof && opt_tcache) {
-		malloc_mutex_postfork_parent(tsdn, &tcaches_mtx);
-	}
-}
-
-void
-tcache_postfork_child(tsdn_t *tsdn) {
-	if (!config_prof && opt_tcache) {
-		malloc_mutex_postfork_child(tsdn, &tcaches_mtx);
-	}
-}
diff --git a/redis-stable/deps/jemalloc/src/ticker.c b/redis-stable/deps/jemalloc/src/ticker.c
deleted file mode 100644
index d7b8cd26..00000000
--- a/redis-stable/deps/jemalloc/src/ticker.c
+++ /dev/null
@@ -1,3 +0,0 @@
-#define JEMALLOC_TICKER_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
diff --git a/redis-stable/deps/jemalloc/src/tsd.c b/redis-stable/deps/jemalloc/src/tsd.c
deleted file mode 100644
index c1430682..00000000
--- a/redis-stable/deps/jemalloc/src/tsd.c
+++ /dev/null
@@ -1,351 +0,0 @@
-#define JEMALLOC_TSD_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/mutex.h"
-#include "jemalloc/internal/rtree.h"
-
-/******************************************************************************/
-/* Data. */
-
-static unsigned ncleanups;
-static malloc_tsd_cleanup_t cleanups[MALLOC_TSD_CLEANUPS_MAX];
-
-#ifdef JEMALLOC_MALLOC_THREAD_CLEANUP
-__thread tsd_t JEMALLOC_TLS_MODEL tsd_tls = TSD_INITIALIZER;
-__thread bool JEMALLOC_TLS_MODEL tsd_initialized = false;
-bool tsd_booted = false;
-#elif (defined(JEMALLOC_TLS))
-__thread tsd_t JEMALLOC_TLS_MODEL tsd_tls = TSD_INITIALIZER;
-pthread_key_t tsd_tsd;
-bool tsd_booted = false;
-#elif (defined(_WIN32))
-DWORD tsd_tsd;
-tsd_wrapper_t tsd_boot_wrapper = {false, TSD_INITIALIZER};
-bool tsd_booted = false;
-#else
-
-/*
- * This contains a mutex, but it's pretty convenient to allow the mutex code to
- * have a dependency on tsd.  So we define the struct here, and only refer to it
- * by pointer in the header.
- */
-struct tsd_init_head_s {
-	ql_head(tsd_init_block_t) blocks;
-	malloc_mutex_t lock;
-};
-
-pthread_key_t tsd_tsd;
-tsd_init_head_t	tsd_init_head = {
-	ql_head_initializer(blocks),
-	MALLOC_MUTEX_INITIALIZER
-};
-tsd_wrapper_t tsd_boot_wrapper = {
-	false,
-	TSD_INITIALIZER
-};
-bool tsd_booted = false;
-#endif
-
-
-/******************************************************************************/
-
-void
-tsd_slow_update(tsd_t *tsd) {
-	if (tsd_nominal(tsd)) {
-		if (malloc_slow || !tsd_tcache_enabled_get(tsd) ||
-		    tsd_reentrancy_level_get(tsd) > 0) {
-			tsd->state = tsd_state_nominal_slow;
-		} else {
-			tsd->state = tsd_state_nominal;
-		}
-	}
-}
-
-static bool
-tsd_data_init(tsd_t *tsd) {
-	/*
-	 * We initialize the rtree context first (before the tcache), since the
-	 * tcache initialization depends on it.
-	 */
-	rtree_ctx_data_init(tsd_rtree_ctxp_get_unsafe(tsd));
-
-	/*
-	 * A nondeterministic seed based on the address of tsd reduces
-	 * the likelihood of lockstep non-uniform cache index
-	 * utilization among identical concurrent processes, but at the
-	 * cost of test repeatability.  For debug builds, instead use a
-	 * deterministic seed.
-	 */
-	*tsd_offset_statep_get(tsd) = config_debug ? 0 :
-	    (uint64_t)(uintptr_t)tsd;
-
-	return tsd_tcache_enabled_data_init(tsd);
-}
-
-static void
-assert_tsd_data_cleanup_done(tsd_t *tsd) {
-	assert(!tsd_nominal(tsd));
-	assert(*tsd_arenap_get_unsafe(tsd) == NULL);
-	assert(*tsd_iarenap_get_unsafe(tsd) == NULL);
-	assert(*tsd_arenas_tdata_bypassp_get_unsafe(tsd) == true);
-	assert(*tsd_arenas_tdatap_get_unsafe(tsd) == NULL);
-	assert(*tsd_tcache_enabledp_get_unsafe(tsd) == false);
-	assert(*tsd_prof_tdatap_get_unsafe(tsd) == NULL);
-}
-
-static bool
-tsd_data_init_nocleanup(tsd_t *tsd) {
-	assert(tsd->state == tsd_state_reincarnated ||
-	    tsd->state == tsd_state_minimal_initialized);
-	/*
-	 * During reincarnation, there is no guarantee that the cleanup function
-	 * will be called (deallocation may happen after all tsd destructors).
-	 * We set up tsd in a way that no cleanup is needed.
-	 */
-	rtree_ctx_data_init(tsd_rtree_ctxp_get_unsafe(tsd));
-	*tsd_arenas_tdata_bypassp_get(tsd) = true;
-	*tsd_tcache_enabledp_get_unsafe(tsd) = false;
-	*tsd_reentrancy_levelp_get(tsd) = 1;
-	assert_tsd_data_cleanup_done(tsd);
-
-	return false;
-}
-
-tsd_t *
-tsd_fetch_slow(tsd_t *tsd, bool minimal) {
-	assert(!tsd_fast(tsd));
-
-	if (tsd->state == tsd_state_nominal_slow) {
-		/* On slow path but no work needed. */
-		assert(malloc_slow || !tsd_tcache_enabled_get(tsd) ||
-		    tsd_reentrancy_level_get(tsd) > 0 ||
-		    *tsd_arenas_tdata_bypassp_get(tsd));
-	} else if (tsd->state == tsd_state_uninitialized) {
-		if (!minimal) {
-			tsd->state = tsd_state_nominal;
-			tsd_slow_update(tsd);
-			/* Trigger cleanup handler registration. */
-			tsd_set(tsd);
-			tsd_data_init(tsd);
-		} else {
-			tsd->state = tsd_state_minimal_initialized;
-			tsd_set(tsd);
-			tsd_data_init_nocleanup(tsd);
-		}
-	} else if (tsd->state == tsd_state_minimal_initialized) {
-		if (!minimal) {
-			/* Switch to fully initialized. */
-			tsd->state = tsd_state_nominal;
-			assert(*tsd_reentrancy_levelp_get(tsd) >= 1);
-			(*tsd_reentrancy_levelp_get(tsd))--;
-			tsd_slow_update(tsd);
-			tsd_data_init(tsd);
-		} else {
-			assert_tsd_data_cleanup_done(tsd);
-		}
-	} else if (tsd->state == tsd_state_purgatory) {
-		tsd->state = tsd_state_reincarnated;
-		tsd_set(tsd);
-		tsd_data_init_nocleanup(tsd);
-	} else {
-		assert(tsd->state == tsd_state_reincarnated);
-	}
-
-	return tsd;
-}
-
-void *
-malloc_tsd_malloc(size_t size) {
-	return a0malloc(CACHELINE_CEILING(size));
-}
-
-void
-malloc_tsd_dalloc(void *wrapper) {
-	a0dalloc(wrapper);
-}
-
-#if defined(JEMALLOC_MALLOC_THREAD_CLEANUP) || defined(_WIN32)
-#ifndef _WIN32
-JEMALLOC_EXPORT
-#endif
-void
-_malloc_thread_cleanup(void) {
-	bool pending[MALLOC_TSD_CLEANUPS_MAX], again;
-	unsigned i;
-
-	for (i = 0; i < ncleanups; i++) {
-		pending[i] = true;
-	}
-
-	do {
-		again = false;
-		for (i = 0; i < ncleanups; i++) {
-			if (pending[i]) {
-				pending[i] = cleanups[i]();
-				if (pending[i]) {
-					again = true;
-				}
-			}
-		}
-	} while (again);
-}
-#endif
-
-void
-malloc_tsd_cleanup_register(bool (*f)(void)) {
-	assert(ncleanups < MALLOC_TSD_CLEANUPS_MAX);
-	cleanups[ncleanups] = f;
-	ncleanups++;
-}
-
-static void
-tsd_do_data_cleanup(tsd_t *tsd) {
-	prof_tdata_cleanup(tsd);
-	iarena_cleanup(tsd);
-	arena_cleanup(tsd);
-	arenas_tdata_cleanup(tsd);
-	tcache_cleanup(tsd);
-	witnesses_cleanup(tsd_witness_tsdp_get_unsafe(tsd));
-}
-
-void
-tsd_cleanup(void *arg) {
-	tsd_t *tsd = (tsd_t *)arg;
-
-	switch (tsd->state) {
-	case tsd_state_uninitialized:
-		/* Do nothing. */
-		break;
-	case tsd_state_minimal_initialized:
-		/* This implies the thread only did free() in its life time. */
-		/* Fall through. */
-	case tsd_state_reincarnated:
-		/*
-		 * Reincarnated means another destructor deallocated memory
-		 * after the destructor was called.  Cleanup isn't required but
-		 * is still called for testing and completeness.
-		 */
-		assert_tsd_data_cleanup_done(tsd);
-		/* Fall through. */
-	case tsd_state_nominal:
-	case tsd_state_nominal_slow:
-		tsd_do_data_cleanup(tsd);
-		tsd->state = tsd_state_purgatory;
-		tsd_set(tsd);
-		break;
-	case tsd_state_purgatory:
-		/*
-		 * The previous time this destructor was called, we set the
-		 * state to tsd_state_purgatory so that other destructors
-		 * wouldn't cause re-creation of the tsd.  This time, do
-		 * nothing, and do not request another callback.
-		 */
-		break;
-	default:
-		not_reached();
-	}
-#ifdef JEMALLOC_JET
-	test_callback_t test_callback = *tsd_test_callbackp_get_unsafe(tsd);
-	int *data = tsd_test_datap_get_unsafe(tsd);
-	if (test_callback != NULL) {
-		test_callback(data);
-	}
-#endif
-}
-
-tsd_t *
-malloc_tsd_boot0(void) {
-	tsd_t *tsd;
-
-	ncleanups = 0;
-	if (tsd_boot0()) {
-		return NULL;
-	}
-	tsd = tsd_fetch();
-	*tsd_arenas_tdata_bypassp_get(tsd) = true;
-	return tsd;
-}
-
-void
-malloc_tsd_boot1(void) {
-	tsd_boot1();
-	tsd_t *tsd = tsd_fetch();
-	/* malloc_slow has been set properly.  Update tsd_slow. */
-	tsd_slow_update(tsd);
-	*tsd_arenas_tdata_bypassp_get(tsd) = false;
-}
-
-#ifdef _WIN32
-static BOOL WINAPI
-_tls_callback(HINSTANCE hinstDLL, DWORD fdwReason, LPVOID lpvReserved) {
-	switch (fdwReason) {
-#ifdef JEMALLOC_LAZY_LOCK
-	case DLL_THREAD_ATTACH:
-		isthreaded = true;
-		break;
-#endif
-	case DLL_THREAD_DETACH:
-		_malloc_thread_cleanup();
-		break;
-	default:
-		break;
-	}
-	return true;
-}
-
-/*
- * We need to be able to say "read" here (in the "pragma section"), but have
- * hooked "read". We won't read for the rest of the file, so we can get away
- * with unhooking.
- */
-#ifdef read
-#  undef read
-#endif
-
-#ifdef _MSC_VER
-#  ifdef _M_IX86
-#    pragma comment(linker, "/INCLUDE:__tls_used")
-#    pragma comment(linker, "/INCLUDE:_tls_callback")
-#  else
-#    pragma comment(linker, "/INCLUDE:_tls_used")
-#    pragma comment(linker, "/INCLUDE:tls_callback")
-#  endif
-#  pragma section(".CRT$XLY",long,read)
-#endif
-JEMALLOC_SECTION(".CRT$XLY") JEMALLOC_ATTR(used)
-BOOL	(WINAPI *const tls_callback)(HINSTANCE hinstDLL,
-    DWORD fdwReason, LPVOID lpvReserved) = _tls_callback;
-#endif
-
-#if (!defined(JEMALLOC_MALLOC_THREAD_CLEANUP) && !defined(JEMALLOC_TLS) && \
-    !defined(_WIN32))
-void *
-tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block) {
-	pthread_t self = pthread_self();
-	tsd_init_block_t *iter;
-
-	/* Check whether this thread has already inserted into the list. */
-	malloc_mutex_lock(TSDN_NULL, &head->lock);
-	ql_foreach(iter, &head->blocks, link) {
-		if (iter->thread == self) {
-			malloc_mutex_unlock(TSDN_NULL, &head->lock);
-			return iter->data;
-		}
-	}
-	/* Insert block into list. */
-	ql_elm_new(block, link);
-	block->thread = self;
-	ql_tail_insert(&head->blocks, block, link);
-	malloc_mutex_unlock(TSDN_NULL, &head->lock);
-	return NULL;
-}
-
-void
-tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block) {
-	malloc_mutex_lock(TSDN_NULL, &head->lock);
-	ql_remove(&head->blocks, block, link);
-	malloc_mutex_unlock(TSDN_NULL, &head->lock);
-}
-#endif
diff --git a/redis-stable/deps/jemalloc/src/witness.c b/redis-stable/deps/jemalloc/src/witness.c
deleted file mode 100644
index f42b72ad..00000000
--- a/redis-stable/deps/jemalloc/src/witness.c
+++ /dev/null
@@ -1,100 +0,0 @@
-#define JEMALLOC_WITNESS_C_
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-#include "jemalloc/internal/malloc_io.h"
-
-void
-witness_init(witness_t *witness, const char *name, witness_rank_t rank,
-    witness_comp_t *comp, void *opaque) {
-	witness->name = name;
-	witness->rank = rank;
-	witness->comp = comp;
-	witness->opaque = opaque;
-}
-
-static void
-witness_lock_error_impl(const witness_list_t *witnesses,
-    const witness_t *witness) {
-	witness_t *w;
-
-	malloc_printf("<jemalloc>: Lock rank order reversal:");
-	ql_foreach(w, witnesses, link) {
-		malloc_printf(" %s(%u)", w->name, w->rank);
-	}
-	malloc_printf(" %s(%u)\n", witness->name, witness->rank);
-	abort();
-}
-witness_lock_error_t *JET_MUTABLE witness_lock_error = witness_lock_error_impl;
-
-static void
-witness_owner_error_impl(const witness_t *witness) {
-	malloc_printf("<jemalloc>: Should own %s(%u)\n", witness->name,
-	    witness->rank);
-	abort();
-}
-witness_owner_error_t *JET_MUTABLE witness_owner_error =
-    witness_owner_error_impl;
-
-static void
-witness_not_owner_error_impl(const witness_t *witness) {
-	malloc_printf("<jemalloc>: Should not own %s(%u)\n", witness->name,
-	    witness->rank);
-	abort();
-}
-witness_not_owner_error_t *JET_MUTABLE witness_not_owner_error =
-    witness_not_owner_error_impl;
-
-static void
-witness_depth_error_impl(const witness_list_t *witnesses,
-    witness_rank_t rank_inclusive, unsigned depth) {
-	witness_t *w;
-
-	malloc_printf("<jemalloc>: Should own %u lock%s of rank >= %u:", depth,
-	    (depth != 1) ?  "s" : "", rank_inclusive);
-	ql_foreach(w, witnesses, link) {
-		malloc_printf(" %s(%u)", w->name, w->rank);
-	}
-	malloc_printf("\n");
-	abort();
-}
-witness_depth_error_t *JET_MUTABLE witness_depth_error =
-    witness_depth_error_impl;
-
-void
-witnesses_cleanup(witness_tsd_t *witness_tsd) {
-	witness_assert_lockless(witness_tsd_tsdn(witness_tsd));
-
-	/* Do nothing. */
-}
-
-void
-witness_prefork(witness_tsd_t *witness_tsd) {
-	if (!config_debug) {
-		return;
-	}
-	witness_tsd->forking = true;
-}
-
-void
-witness_postfork_parent(witness_tsd_t *witness_tsd) {
-	if (!config_debug) {
-		return;
-	}
-	witness_tsd->forking = false;
-}
-
-void
-witness_postfork_child(witness_tsd_t *witness_tsd) {
-	if (!config_debug) {
-		return;
-	}
-#ifndef JEMALLOC_MUTEX_INIT_CB
-	witness_list_t *witnesses;
-
-	witnesses = &witness_tsd->witnesses;
-	ql_new(witnesses);
-#endif
-	witness_tsd->forking = false;
-}
diff --git a/redis-stable/deps/jemalloc/src/zone.c b/redis-stable/deps/jemalloc/src/zone.c
deleted file mode 100644
index 23dfdd04..00000000
--- a/redis-stable/deps/jemalloc/src/zone.c
+++ /dev/null
@@ -1,469 +0,0 @@
-#include "jemalloc/internal/jemalloc_preamble.h"
-#include "jemalloc/internal/jemalloc_internal_includes.h"
-
-#include "jemalloc/internal/assert.h"
-
-#ifndef JEMALLOC_ZONE
-#  error "This source file is for zones on Darwin (OS X)."
-#endif
-
-/* Definitions of the following structs in malloc/malloc.h might be too old
- * for the built binary to run on newer versions of OSX. So use the newest
- * possible version of those structs.
- */
-typedef struct _malloc_zone_t {
-	void *reserved1;
-	void *reserved2;
-	size_t (*size)(struct _malloc_zone_t *, const void *);
-	void *(*malloc)(struct _malloc_zone_t *, size_t);
-	void *(*calloc)(struct _malloc_zone_t *, size_t, size_t);
-	void *(*valloc)(struct _malloc_zone_t *, size_t);
-	void (*free)(struct _malloc_zone_t *, void *);
-	void *(*realloc)(struct _malloc_zone_t *, void *, size_t);
-	void (*destroy)(struct _malloc_zone_t *);
-	const char *zone_name;
-	unsigned (*batch_malloc)(struct _malloc_zone_t *, size_t, void **, unsigned);
-	void (*batch_free)(struct _malloc_zone_t *, void **, unsigned);
-	struct malloc_introspection_t *introspect;
-	unsigned version;
-	void *(*memalign)(struct _malloc_zone_t *, size_t, size_t);
-	void (*free_definite_size)(struct _malloc_zone_t *, void *, size_t);
-	size_t (*pressure_relief)(struct _malloc_zone_t *, size_t);
-} malloc_zone_t;
-
-typedef struct {
-	vm_address_t address;
-	vm_size_t size;
-} vm_range_t;
-
-typedef struct malloc_statistics_t {
-	unsigned blocks_in_use;
-	size_t size_in_use;
-	size_t max_size_in_use;
-	size_t size_allocated;
-} malloc_statistics_t;
-
-typedef kern_return_t memory_reader_t(task_t, vm_address_t, vm_size_t, void **);
-
-typedef void vm_range_recorder_t(task_t, void *, unsigned type, vm_range_t *, unsigned);
-
-typedef struct malloc_introspection_t {
-	kern_return_t (*enumerator)(task_t, void *, unsigned, vm_address_t, memory_reader_t, vm_range_recorder_t);
-	size_t (*good_size)(malloc_zone_t *, size_t);
-	boolean_t (*check)(malloc_zone_t *);
-	void (*print)(malloc_zone_t *, boolean_t);
-	void (*log)(malloc_zone_t *, void *);
-	void (*force_lock)(malloc_zone_t *);
-	void (*force_unlock)(malloc_zone_t *);
-	void (*statistics)(malloc_zone_t *, malloc_statistics_t *);
-	boolean_t (*zone_locked)(malloc_zone_t *);
-	boolean_t (*enable_discharge_checking)(malloc_zone_t *);
-	boolean_t (*disable_discharge_checking)(malloc_zone_t *);
-	void (*discharge)(malloc_zone_t *, void *);
-#ifdef __BLOCKS__
-	void (*enumerate_discharged_pointers)(malloc_zone_t *, void (^)(void *, void *));
-#else
-	void *enumerate_unavailable_without_blocks;
-#endif
-	void (*reinit_lock)(malloc_zone_t *);
-} malloc_introspection_t;
-
-extern kern_return_t malloc_get_all_zones(task_t, memory_reader_t, vm_address_t **, unsigned *);
-
-extern malloc_zone_t *malloc_default_zone(void);
-
-extern void malloc_zone_register(malloc_zone_t *zone);
-
-extern void malloc_zone_unregister(malloc_zone_t *zone);
-
-/*
- * The malloc_default_purgeable_zone() function is only available on >= 10.6.
- * We need to check whether it is present at runtime, thus the weak_import.
- */
-extern malloc_zone_t *malloc_default_purgeable_zone(void)
-JEMALLOC_ATTR(weak_import);
-
-/******************************************************************************/
-/* Data. */
-
-static malloc_zone_t *default_zone, *purgeable_zone;
-static malloc_zone_t jemalloc_zone;
-static struct malloc_introspection_t jemalloc_zone_introspect;
-static pid_t zone_force_lock_pid = -1;
-
-/******************************************************************************/
-/* Function prototypes for non-inline static functions. */
-
-static size_t	zone_size(malloc_zone_t *zone, const void *ptr);
-static void	*zone_malloc(malloc_zone_t *zone, size_t size);
-static void	*zone_calloc(malloc_zone_t *zone, size_t num, size_t size);
-static void	*zone_valloc(malloc_zone_t *zone, size_t size);
-static void	zone_free(malloc_zone_t *zone, void *ptr);
-static void	*zone_realloc(malloc_zone_t *zone, void *ptr, size_t size);
-static void	*zone_memalign(malloc_zone_t *zone, size_t alignment,
-    size_t size);
-static void	zone_free_definite_size(malloc_zone_t *zone, void *ptr,
-    size_t size);
-static void	zone_destroy(malloc_zone_t *zone);
-static unsigned	zone_batch_malloc(struct _malloc_zone_t *zone, size_t size,
-    void **results, unsigned num_requested);
-static void	zone_batch_free(struct _malloc_zone_t *zone,
-    void **to_be_freed, unsigned num_to_be_freed);
-static size_t	zone_pressure_relief(struct _malloc_zone_t *zone, size_t goal);
-static size_t	zone_good_size(malloc_zone_t *zone, size_t size);
-static kern_return_t	zone_enumerator(task_t task, void *data, unsigned type_mask,
-    vm_address_t zone_address, memory_reader_t reader,
-    vm_range_recorder_t recorder);
-static boolean_t	zone_check(malloc_zone_t *zone);
-static void	zone_print(malloc_zone_t *zone, boolean_t verbose);
-static void	zone_log(malloc_zone_t *zone, void *address);
-static void	zone_force_lock(malloc_zone_t *zone);
-static void	zone_force_unlock(malloc_zone_t *zone);
-static void	zone_statistics(malloc_zone_t *zone,
-    malloc_statistics_t *stats);
-static boolean_t	zone_locked(malloc_zone_t *zone);
-static void	zone_reinit_lock(malloc_zone_t *zone);
-
-/******************************************************************************/
-/*
- * Functions.
- */
-
-static size_t
-zone_size(malloc_zone_t *zone, const void *ptr) {
-	/*
-	 * There appear to be places within Darwin (such as setenv(3)) that
-	 * cause calls to this function with pointers that *no* zone owns.  If
-	 * we knew that all pointers were owned by *some* zone, we could split
-	 * our zone into two parts, and use one as the default allocator and
-	 * the other as the default deallocator/reallocator.  Since that will
-	 * not work in practice, we must check all pointers to assure that they
-	 * reside within a mapped extent before determining size.
-	 */
-	return ivsalloc(tsdn_fetch(), ptr);
-}
-
-static void *
-zone_malloc(malloc_zone_t *zone, size_t size) {
-	return je_malloc(size);
-}
-
-static void *
-zone_calloc(malloc_zone_t *zone, size_t num, size_t size) {
-	return je_calloc(num, size);
-}
-
-static void *
-zone_valloc(malloc_zone_t *zone, size_t size) {
-	void *ret = NULL; /* Assignment avoids useless compiler warning. */
-
-	je_posix_memalign(&ret, PAGE, size);
-
-	return ret;
-}
-
-static void
-zone_free(malloc_zone_t *zone, void *ptr) {
-	if (ivsalloc(tsdn_fetch(), ptr) != 0) {
-		je_free(ptr);
-		return;
-	}
-
-	free(ptr);
-}
-
-static void *
-zone_realloc(malloc_zone_t *zone, void *ptr, size_t size) {
-	if (ivsalloc(tsdn_fetch(), ptr) != 0) {
-		return je_realloc(ptr, size);
-	}
-
-	return realloc(ptr, size);
-}
-
-static void *
-zone_memalign(malloc_zone_t *zone, size_t alignment, size_t size) {
-	void *ret = NULL; /* Assignment avoids useless compiler warning. */
-
-	je_posix_memalign(&ret, alignment, size);
-
-	return ret;
-}
-
-static void
-zone_free_definite_size(malloc_zone_t *zone, void *ptr, size_t size) {
-	size_t alloc_size;
-
-	alloc_size = ivsalloc(tsdn_fetch(), ptr);
-	if (alloc_size != 0) {
-		assert(alloc_size == size);
-		je_free(ptr);
-		return;
-	}
-
-	free(ptr);
-}
-
-static void
-zone_destroy(malloc_zone_t *zone) {
-	/* This function should never be called. */
-	not_reached();
-}
-
-static unsigned
-zone_batch_malloc(struct _malloc_zone_t *zone, size_t size, void **results,
-    unsigned num_requested) {
-	unsigned i;
-
-	for (i = 0; i < num_requested; i++) {
-		results[i] = je_malloc(size);
-		if (!results[i])
-			break;
-	}
-
-	return i;
-}
-
-static void
-zone_batch_free(struct _malloc_zone_t *zone, void **to_be_freed,
-    unsigned num_to_be_freed) {
-	unsigned i;
-
-	for (i = 0; i < num_to_be_freed; i++) {
-		zone_free(zone, to_be_freed[i]);
-		to_be_freed[i] = NULL;
-	}
-}
-
-static size_t
-zone_pressure_relief(struct _malloc_zone_t *zone, size_t goal) {
-	return 0;
-}
-
-static size_t
-zone_good_size(malloc_zone_t *zone, size_t size) {
-	if (size == 0) {
-		size = 1;
-	}
-	return sz_s2u(size);
-}
-
-static kern_return_t
-zone_enumerator(task_t task, void *data, unsigned type_mask,
-    vm_address_t zone_address, memory_reader_t reader,
-    vm_range_recorder_t recorder) {
-	return KERN_SUCCESS;
-}
-
-static boolean_t
-zone_check(malloc_zone_t *zone) {
-	return true;
-}
-
-static void
-zone_print(malloc_zone_t *zone, boolean_t verbose) {
-}
-
-static void
-zone_log(malloc_zone_t *zone, void *address) {
-}
-
-static void
-zone_force_lock(malloc_zone_t *zone) {
-	if (isthreaded) {
-		/*
-		 * See the note in zone_force_unlock, below, to see why we need
-		 * this.
-		 */
-		assert(zone_force_lock_pid == -1);
-		zone_force_lock_pid = getpid();
-		jemalloc_prefork();
-	}
-}
-
-static void
-zone_force_unlock(malloc_zone_t *zone) {
-	/*
-	 * zone_force_lock and zone_force_unlock are the entry points to the
-	 * forking machinery on OS X.  The tricky thing is, the child is not
-	 * allowed to unlock mutexes locked in the parent, even if owned by the
-	 * forking thread (and the mutex type we use in OS X will fail an assert
-	 * if we try).  In the child, we can get away with reinitializing all
-	 * the mutexes, which has the effect of unlocking them.  In the parent,
-	 * doing this would mean we wouldn't wake any waiters blocked on the
-	 * mutexes we unlock.  So, we record the pid of the current thread in
-	 * zone_force_lock, and use that to detect if we're in the parent or
-	 * child here, to decide which unlock logic we need.
-	 */
-	if (isthreaded) {
-		assert(zone_force_lock_pid != -1);
-		if (getpid() == zone_force_lock_pid) {
-			jemalloc_postfork_parent();
-		} else {
-			jemalloc_postfork_child();
-		}
-		zone_force_lock_pid = -1;
-	}
-}
-
-static void
-zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats) {
-	/* We make no effort to actually fill the values */
-	stats->blocks_in_use = 0;
-	stats->size_in_use = 0;
-	stats->max_size_in_use = 0;
-	stats->size_allocated = 0;
-}
-
-static boolean_t
-zone_locked(malloc_zone_t *zone) {
-	/* Pretend no lock is being held */
-	return false;
-}
-
-static void
-zone_reinit_lock(malloc_zone_t *zone) {
-	/* As of OSX 10.12, this function is only used when force_unlock would
-	 * be used if the zone version were < 9. So just use force_unlock. */
-	zone_force_unlock(zone);
-}
-
-static void
-zone_init(void) {
-	jemalloc_zone.size = zone_size;
-	jemalloc_zone.malloc = zone_malloc;
-	jemalloc_zone.calloc = zone_calloc;
-	jemalloc_zone.valloc = zone_valloc;
-	jemalloc_zone.free = zone_free;
-	jemalloc_zone.realloc = zone_realloc;
-	jemalloc_zone.destroy = zone_destroy;
-	jemalloc_zone.zone_name = "jemalloc_zone";
-	jemalloc_zone.batch_malloc = zone_batch_malloc;
-	jemalloc_zone.batch_free = zone_batch_free;
-	jemalloc_zone.introspect = &jemalloc_zone_introspect;
-	jemalloc_zone.version = 9;
-	jemalloc_zone.memalign = zone_memalign;
-	jemalloc_zone.free_definite_size = zone_free_definite_size;
-	jemalloc_zone.pressure_relief = zone_pressure_relief;
-
-	jemalloc_zone_introspect.enumerator = zone_enumerator;
-	jemalloc_zone_introspect.good_size = zone_good_size;
-	jemalloc_zone_introspect.check = zone_check;
-	jemalloc_zone_introspect.print = zone_print;
-	jemalloc_zone_introspect.log = zone_log;
-	jemalloc_zone_introspect.force_lock = zone_force_lock;
-	jemalloc_zone_introspect.force_unlock = zone_force_unlock;
-	jemalloc_zone_introspect.statistics = zone_statistics;
-	jemalloc_zone_introspect.zone_locked = zone_locked;
-	jemalloc_zone_introspect.enable_discharge_checking = NULL;
-	jemalloc_zone_introspect.disable_discharge_checking = NULL;
-	jemalloc_zone_introspect.discharge = NULL;
-#ifdef __BLOCKS__
-	jemalloc_zone_introspect.enumerate_discharged_pointers = NULL;
-#else
-	jemalloc_zone_introspect.enumerate_unavailable_without_blocks = NULL;
-#endif
-	jemalloc_zone_introspect.reinit_lock = zone_reinit_lock;
-}
-
-static malloc_zone_t *
-zone_default_get(void) {
-	malloc_zone_t **zones = NULL;
-	unsigned int num_zones = 0;
-
-	/*
-	 * On OSX 10.12, malloc_default_zone returns a special zone that is not
-	 * present in the list of registered zones. That zone uses a "lite zone"
-	 * if one is present (apparently enabled when malloc stack logging is
-	 * enabled), or the first registered zone otherwise. In practice this
-	 * means unless malloc stack logging is enabled, the first registered
-	 * zone is the default.  So get the list of zones to get the first one,
-	 * instead of relying on malloc_default_zone.
-	 */
-	if (KERN_SUCCESS != malloc_get_all_zones(0, NULL,
-	    (vm_address_t**)&zones, &num_zones)) {
-		/*
-		 * Reset the value in case the failure happened after it was
-		 * set.
-		 */
-		num_zones = 0;
-	}
-
-	if (num_zones) {
-		return zones[0];
-	}
-
-	return malloc_default_zone();
-}
-
-/* As written, this function can only promote jemalloc_zone. */
-static void
-zone_promote(void) {
-	malloc_zone_t *zone;
-
-	do {
-		/*
-		 * Unregister and reregister the default zone.  On OSX >= 10.6,
-		 * unregistering takes the last registered zone and places it
-		 * at the location of the specified zone.  Unregistering the
-		 * default zone thus makes the last registered one the default.
-		 * On OSX < 10.6, unregistering shifts all registered zones.
-		 * The first registered zone then becomes the default.
-		 */
-		malloc_zone_unregister(default_zone);
-		malloc_zone_register(default_zone);
-
-		/*
-		 * On OSX 10.6, having the default purgeable zone appear before
-		 * the default zone makes some things crash because it thinks it
-		 * owns the default zone allocated pointers.  We thus
-		 * unregister/re-register it in order to ensure it's always
-		 * after the default zone.  On OSX < 10.6, there is no purgeable
-		 * zone, so this does nothing.  On OSX >= 10.6, unregistering
-		 * replaces the purgeable zone with the last registered zone
-		 * above, i.e. the default zone.  Registering it again then puts
-		 * it at the end, obviously after the default zone.
-		 */
-		if (purgeable_zone != NULL) {
-			malloc_zone_unregister(purgeable_zone);
-			malloc_zone_register(purgeable_zone);
-		}
-
-		zone = zone_default_get();
-	} while (zone != &jemalloc_zone);
-}
-
-JEMALLOC_ATTR(constructor)
-void
-zone_register(void) {
-	/*
-	 * If something else replaced the system default zone allocator, don't
-	 * register jemalloc's.
-	 */
-	default_zone = zone_default_get();
-	if (!default_zone->zone_name || strcmp(default_zone->zone_name,
-	    "DefaultMallocZone") != 0) {
-		return;
-	}
-
-	/*
-	 * The default purgeable zone is created lazily by OSX's libc.  It uses
-	 * the default zone when it is created for "small" allocations
-	 * (< 15 KiB), but assumes the default zone is a scalable_zone.  This
-	 * obviously fails when the default zone is the jemalloc zone, so
-	 * malloc_default_purgeable_zone() is called beforehand so that the
-	 * default purgeable zone is created when the default zone is still
-	 * a scalable_zone.  As purgeable zones only exist on >= 10.6, we need
-	 * to check for the existence of malloc_default_purgeable_zone() at
-	 * run time.
-	 */
-	purgeable_zone = (malloc_default_purgeable_zone == NULL) ? NULL :
-	    malloc_default_purgeable_zone();
-
-	/* Register the custom zone.  At this point it won't be the default. */
-	zone_init();
-	malloc_zone_register(&jemalloc_zone);
-
-	/* Promote the custom zone to be default. */
-	zone_promote();
-}
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
deleted file mode 100644
index a1885dbf..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-alti.h
+++ /dev/null
@@ -1,186 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/**
- * @file SFMT-alti.h
- *
- * @brief SIMD oriented Fast Mersenne Twister(SFMT)
- * pseudorandom number generator
- *
- * @author Mutsuo Saito (Hiroshima University)
- * @author Makoto Matsumoto (Hiroshima University)
- *
- * Copyright (C) 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- * University. All rights reserved.
- *
- * The new BSD License is applied to this software.
- * see LICENSE.txt
- */
-
-#ifndef SFMT_ALTI_H
-#define SFMT_ALTI_H
-
-/**
- * This function represents the recursion formula in AltiVec and BIG ENDIAN.
- * @param a a 128-bit part of the interal state array
- * @param b a 128-bit part of the interal state array
- * @param c a 128-bit part of the interal state array
- * @param d a 128-bit part of the interal state array
- * @return output
- */
-JEMALLOC_ALWAYS_INLINE
-vector unsigned int vec_recursion(vector unsigned int a,
-						vector unsigned int b,
-						vector unsigned int c,
-						vector unsigned int d) {
-
-    const vector unsigned int sl1 = ALTI_SL1;
-    const vector unsigned int sr1 = ALTI_SR1;
-#ifdef ONLY64
-    const vector unsigned int mask = ALTI_MSK64;
-    const vector unsigned char perm_sl = ALTI_SL2_PERM64;
-    const vector unsigned char perm_sr = ALTI_SR2_PERM64;
-#else
-    const vector unsigned int mask = ALTI_MSK;
-    const vector unsigned char perm_sl = ALTI_SL2_PERM;
-    const vector unsigned char perm_sr = ALTI_SR2_PERM;
-#endif
-    vector unsigned int v, w, x, y, z;
-    x = vec_perm(a, (vector unsigned int)perm_sl, perm_sl);
-    v = a;
-    y = vec_sr(b, sr1);
-    z = vec_perm(c, (vector unsigned int)perm_sr, perm_sr);
-    w = vec_sl(d, sl1);
-    z = vec_xor(z, w);
-    y = vec_and(y, mask);
-    v = vec_xor(v, x);
-    z = vec_xor(z, y);
-    z = vec_xor(z, v);
-    return z;
-}
-
-/**
- * This function fills the internal state array with pseudorandom
- * integers.
- */
-static inline void gen_rand_all(sfmt_t *ctx) {
-    int i;
-    vector unsigned int r, r1, r2;
-
-    r1 = ctx->sfmt[N - 2].s;
-    r2 = ctx->sfmt[N - 1].s;
-    for (i = 0; i < N - POS1; i++) {
-	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2);
-	ctx->sfmt[i].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-    for (; i < N; i++) {
-	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1 - N].s, r1, r2);
-	ctx->sfmt[i].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-}
-
-/**
- * This function fills the user-specified array with pseudorandom
- * integers.
- *
- * @param array an 128-bit array to be filled by pseudorandom numbers.
- * @param size number of 128-bit pesudorandom numbers to be generated.
- */
-static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
-    int i, j;
-    vector unsigned int r, r1, r2;
-
-    r1 = ctx->sfmt[N - 2].s;
-    r2 = ctx->sfmt[N - 1].s;
-    for (i = 0; i < N - POS1; i++) {
-	r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2);
-	array[i].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-    for (; i < N; i++) {
-	r = vec_recursion(ctx->sfmt[i].s, array[i + POS1 - N].s, r1, r2);
-	array[i].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-    /* main loop */
-    for (; i < size - N; i++) {
-	r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2);
-	array[i].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-    for (j = 0; j < 2 * N - size; j++) {
-	ctx->sfmt[j].s = array[j + size - N].s;
-    }
-    for (; i < size; i++) {
-	r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2);
-	array[i].s = r;
-	ctx->sfmt[j++].s = r;
-	r1 = r2;
-	r2 = r;
-    }
-}
-
-#ifndef ONLY64
-#if defined(__APPLE__)
-#define ALTI_SWAP (vector unsigned char) \
-	(4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11)
-#else
-#define ALTI_SWAP {4, 5, 6, 7, 0, 1, 2, 3, 12, 13, 14, 15, 8, 9, 10, 11}
-#endif
-/**
- * This function swaps high and low 32-bit of 64-bit integers in user
- * specified array.
- *
- * @param array an 128-bit array to be swaped.
- * @param size size of 128-bit array.
- */
-static inline void swap(w128_t *array, int size) {
-    int i;
-    const vector unsigned char perm = ALTI_SWAP;
-
-    for (i = 0; i < size; i++) {
-	array[i].s = vec_perm(array[i].s, (vector unsigned int)perm, perm);
-    }
-}
-#endif
-
-#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
deleted file mode 100644
index ade66222..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params.h
+++ /dev/null
@@ -1,132 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS_H
-#define SFMT_PARAMS_H
-
-#if !defined(MEXP)
-#ifdef __GNUC__
-  #warning "MEXP is not defined. I assume MEXP is 19937."
-#endif
-  #define MEXP 19937
-#endif
-/*-----------------
-  BASIC DEFINITIONS
-  -----------------*/
-/** Mersenne Exponent. The period of the sequence 
- *  is a multiple of 2^MEXP-1.
- * #define MEXP 19937 */
-/** SFMT generator has an internal state array of 128-bit integers,
- * and N is its size. */
-#define N (MEXP / 128 + 1)
-/** N32 is the size of internal state array when regarded as an array
- * of 32-bit integers.*/
-#define N32 (N * 4)
-/** N64 is the size of internal state array when regarded as an array
- * of 64-bit integers.*/
-#define N64 (N * 2)
-
-/*----------------------
-  the parameters of SFMT
-  following definitions are in paramsXXXX.h file.
-  ----------------------*/
-/** the pick up position of the array.
-#define POS1 122 
-*/
-
-/** the parameter of shift left as four 32-bit registers.
-#define SL1 18
- */
-
-/** the parameter of shift left as one 128-bit register. 
- * The 128-bit integer is shifted by (SL2 * 8) bits. 
-#define SL2 1 
-*/
-
-/** the parameter of shift right as four 32-bit registers.
-#define SR1 11
-*/
-
-/** the parameter of shift right as one 128-bit register. 
- * The 128-bit integer is shifted by (SL2 * 8) bits. 
-#define SR2 1 
-*/
-
-/** A bitmask, used in the recursion.  These parameters are introduced
- * to break symmetry of SIMD.
-#define MSK1 0xdfffffefU
-#define MSK2 0xddfecb7fU
-#define MSK3 0xbffaffffU
-#define MSK4 0xbffffff6U 
-*/
-
-/** These definitions are part of a 128-bit period certification vector.
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0xc98e126aU
-*/
-
-#if MEXP == 607
-  #include "test/SFMT-params607.h"
-#elif MEXP == 1279
-  #include "test/SFMT-params1279.h"
-#elif MEXP == 2281
-  #include "test/SFMT-params2281.h"
-#elif MEXP == 4253
-  #include "test/SFMT-params4253.h"
-#elif MEXP == 11213
-  #include "test/SFMT-params11213.h"
-#elif MEXP == 19937
-  #include "test/SFMT-params19937.h"
-#elif MEXP == 44497
-  #include "test/SFMT-params44497.h"
-#elif MEXP == 86243
-  #include "test/SFMT-params86243.h"
-#elif MEXP == 132049
-  #include "test/SFMT-params132049.h"
-#elif MEXP == 216091
-  #include "test/SFMT-params216091.h"
-#else
-#ifdef __GNUC__
-  #error "MEXP is not valid."
-  #undef MEXP
-#else
-  #undef MEXP
-#endif
-
-#endif
-
-#endif /* SFMT_PARAMS_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
deleted file mode 100644
index 2994bd21..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params11213.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS11213_H
-#define SFMT_PARAMS11213_H
-
-#define POS1	68
-#define SL1	14
-#define SL2	3
-#define SR1	7
-#define SR2	3
-#define MSK1	0xeffff7fbU
-#define MSK2	0xffffffefU
-#define MSK3	0xdfdfbfffU
-#define MSK4	0x7fffdbfdU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0xe8148000U
-#define PARITY4	0xd0c7afa3U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
-    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
-    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
-    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-11213:68-14-3-7-3:effff7fb-ffffffef-dfdfbfff-7fffdbfd"
-
-#endif /* SFMT_PARAMS11213_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
deleted file mode 100644
index d7959f98..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params1279.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS1279_H
-#define SFMT_PARAMS1279_H
-
-#define POS1	7
-#define SL1	14
-#define SL2	3
-#define SR1	5
-#define SR2	1
-#define MSK1	0xf7fefffdU
-#define MSK2	0x7fefcfffU
-#define MSK3	0xaff3ef3fU
-#define MSK4	0xb5ffff7fU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0x20000000U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
-    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-1279:7-14-3-5-1:f7fefffd-7fefcfff-aff3ef3f-b5ffff7f"
-
-#endif /* SFMT_PARAMS1279_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
deleted file mode 100644
index a1dcec39..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params132049.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS132049_H
-#define SFMT_PARAMS132049_H
-
-#define POS1	110
-#define SL1	19
-#define SL2	1
-#define SR1	21
-#define SR2	1
-#define MSK1	0xffffbb5fU
-#define MSK2	0xfb6ebf95U
-#define MSK3	0xfffefffaU
-#define MSK4	0xcff77fffU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0xcb520000U
-#define PARITY4	0xc7e91c7dU
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
-    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-132049:110-19-1-21-1:ffffbb5f-fb6ebf95-fffefffa-cff77fff"
-
-#endif /* SFMT_PARAMS132049_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
deleted file mode 100644
index fb92b4c9..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params19937.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS19937_H
-#define SFMT_PARAMS19937_H
-
-#define POS1	122
-#define SL1	18
-#define SL2	1
-#define SR1	11
-#define SR2	1
-#define MSK1	0xdfffffefU
-#define MSK2	0xddfecb7fU
-#define MSK3	0xbffaffffU
-#define MSK4	0xbffffff6U
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0x13c9e684U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
-    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-19937:122-18-1-11-1:dfffffef-ddfecb7f-bffaffff-bffffff6"
-
-#endif /* SFMT_PARAMS19937_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
deleted file mode 100644
index 125ce282..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params216091.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS216091_H
-#define SFMT_PARAMS216091_H
-
-#define POS1	627
-#define SL1	11
-#define SL2	3
-#define SR1	10
-#define SR2	1
-#define MSK1	0xbff7bff7U
-#define MSK2	0xbfffffffU
-#define MSK3	0xbffffa7fU
-#define MSK4	0xffddfbfbU
-#define PARITY1	0xf8000001U
-#define PARITY2	0x89e80709U
-#define PARITY3	0x3bd2b64bU
-#define PARITY4	0x0c64b1e4U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
-    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-216091:627-11-3-10-1:bff7bff7-bfffffff-bffffa7f-ffddfbfb"
-
-#endif /* SFMT_PARAMS216091_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
deleted file mode 100644
index 0ef85c40..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params2281.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS2281_H
-#define SFMT_PARAMS2281_H
-
-#define POS1	12
-#define SL1	19
-#define SL2	1
-#define SR1	5
-#define SR2	1
-#define MSK1	0xbff7ffbfU
-#define MSK2	0xfdfffffeU
-#define MSK3	0xf7ffef7fU
-#define MSK4	0xf2f7cbbfU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0x41dfa600U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
-    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-2281:12-19-1-5-1:bff7ffbf-fdfffffe-f7ffef7f-f2f7cbbf"
-
-#endif /* SFMT_PARAMS2281_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
deleted file mode 100644
index 9f07bc67..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params4253.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS4253_H
-#define SFMT_PARAMS4253_H
-
-#define POS1	17
-#define SL1	20
-#define SL2	1
-#define SR1	7
-#define SR2	1
-#define MSK1	0x9f7bffffU
-#define MSK2	0x9fffff5fU
-#define MSK3	0x3efffffbU
-#define MSK4	0xfffff7bbU
-#define PARITY1	0xa8000001U
-#define PARITY2	0xaf5390a3U
-#define PARITY3	0xb740b3f8U
-#define PARITY4	0x6c11486dU
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{1,2,3,23,5,6,7,0,9,10,11,4,13,14,15,8}
-    #define ALTI_SL2_PERM64	{1,2,3,4,5,6,7,31,9,10,11,12,13,14,15,0}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-4253:17-20-1-7-1:9f7bffff-9fffff5f-3efffffb-fffff7bb"
-
-#endif /* SFMT_PARAMS4253_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
deleted file mode 100644
index 85598fed..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params44497.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS44497_H
-#define SFMT_PARAMS44497_H
-
-#define POS1	330
-#define SL1	5
-#define SL2	3
-#define SR1	9
-#define SR2	3
-#define MSK1	0xeffffffbU
-#define MSK2	0xdfbebfffU
-#define MSK3	0xbfbf7befU
-#define MSK4	0x9ffd7bffU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0xa3ac4000U
-#define PARITY4	0xecc1327aU
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
-    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
-    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
-    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-44497:330-5-3-9-3:effffffb-dfbebfff-bfbf7bef-9ffd7bff"
-
-#endif /* SFMT_PARAMS44497_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
deleted file mode 100644
index bc76485f..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params607.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS607_H
-#define SFMT_PARAMS607_H
-
-#define POS1	2
-#define SL1	15
-#define SL2	3
-#define SR1	13
-#define SR2	3
-#define MSK1	0xfdff37ffU
-#define MSK2	0xef7f3f7dU
-#define MSK3	0xff777b7dU
-#define MSK4	0x7ff7fb2fU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0x5986f054U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{3,21,21,21,7,0,1,2,11,4,5,6,15,8,9,10}
-    #define ALTI_SL2_PERM64	{3,4,5,6,7,29,29,29,11,12,13,14,15,0,1,2}
-    #define ALTI_SR2_PERM	{5,6,7,0,9,10,11,4,13,14,15,8,19,19,19,12}
-    #define ALTI_SR2_PERM64	{13,14,15,0,1,2,3,4,19,19,19,8,9,10,11,12}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-607:2-15-3-13-3:fdff37ff-ef7f3f7d-ff777b7d-7ff7fb2f"
-
-#endif /* SFMT_PARAMS607_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
deleted file mode 100644
index 5e4d783c..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-params86243.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#ifndef SFMT_PARAMS86243_H
-#define SFMT_PARAMS86243_H
-
-#define POS1	366
-#define SL1	6
-#define SL2	7
-#define SR1	19
-#define SR2	1
-#define MSK1	0xfdbffbffU
-#define MSK2	0xbff7ff3fU
-#define MSK3	0xfd77efffU
-#define MSK4	0xbf9ff3ffU
-#define PARITY1	0x00000001U
-#define PARITY2	0x00000000U
-#define PARITY3	0x00000000U
-#define PARITY4	0xe9528d85U
-
-
-/* PARAMETERS FOR ALTIVEC */
-#if defined(__APPLE__)	/* For OSX */
-    #define ALTI_SL1	(vector unsigned int)(SL1, SL1, SL1, SL1)
-    #define ALTI_SR1	(vector unsigned int)(SR1, SR1, SR1, SR1)
-    #define ALTI_MSK	(vector unsigned int)(MSK1, MSK2, MSK3, MSK4)
-    #define ALTI_MSK64 \
-	(vector unsigned int)(MSK2, MSK1, MSK4, MSK3)
-    #define ALTI_SL2_PERM \
-	(vector unsigned char)(25,25,25,25,3,25,25,25,7,0,1,2,11,4,5,6)
-    #define ALTI_SL2_PERM64 \
-	(vector unsigned char)(7,25,25,25,25,25,25,25,15,0,1,2,3,4,5,6)
-    #define ALTI_SR2_PERM \
-	(vector unsigned char)(7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14)
-    #define ALTI_SR2_PERM64 \
-	(vector unsigned char)(15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14)
-#else	/* For OTHER OSs(Linux?) */
-    #define ALTI_SL1	{SL1, SL1, SL1, SL1}
-    #define ALTI_SR1	{SR1, SR1, SR1, SR1}
-    #define ALTI_MSK	{MSK1, MSK2, MSK3, MSK4}
-    #define ALTI_MSK64	{MSK2, MSK1, MSK4, MSK3}
-    #define ALTI_SL2_PERM	{25,25,25,25,3,25,25,25,7,0,1,2,11,4,5,6}
-    #define ALTI_SL2_PERM64	{7,25,25,25,25,25,25,25,15,0,1,2,3,4,5,6}
-    #define ALTI_SR2_PERM	{7,0,1,2,11,4,5,6,15,8,9,10,17,12,13,14}
-    #define ALTI_SR2_PERM64	{15,0,1,2,3,4,5,6,17,8,9,10,11,12,13,14}
-#endif	/* For OSX */
-#define IDSTR	"SFMT-86243:366-6-7-19-1:fdbffbff-bff7ff3f-fd77efff-bf9ff3ff"
-
-#endif /* SFMT_PARAMS86243_H */
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h b/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
deleted file mode 100644
index 169ad558..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT-sse2.h
+++ /dev/null
@@ -1,157 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/**
- * @file  SFMT-sse2.h
- * @brief SIMD oriented Fast Mersenne Twister(SFMT) for Intel SSE2
- *
- * @author Mutsuo Saito (Hiroshima University)
- * @author Makoto Matsumoto (Hiroshima University)
- *
- * @note We assume LITTLE ENDIAN in this file
- *
- * Copyright (C) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- * University. All rights reserved.
- *
- * The new BSD License is applied to this software, see LICENSE.txt
- */
-
-#ifndef SFMT_SSE2_H
-#define SFMT_SSE2_H
-
-/**
- * This function represents the recursion formula.
- * @param a a 128-bit part of the interal state array
- * @param b a 128-bit part of the interal state array
- * @param c a 128-bit part of the interal state array
- * @param d a 128-bit part of the interal state array
- * @param mask 128-bit mask
- * @return output
- */
-JEMALLOC_ALWAYS_INLINE __m128i mm_recursion(__m128i *a, __m128i *b,
-				   __m128i c, __m128i d, __m128i mask) {
-    __m128i v, x, y, z;
-
-    x = _mm_load_si128(a);
-    y = _mm_srli_epi32(*b, SR1);
-    z = _mm_srli_si128(c, SR2);
-    v = _mm_slli_epi32(d, SL1);
-    z = _mm_xor_si128(z, x);
-    z = _mm_xor_si128(z, v);
-    x = _mm_slli_si128(x, SL2);
-    y = _mm_and_si128(y, mask);
-    z = _mm_xor_si128(z, x);
-    z = _mm_xor_si128(z, y);
-    return z;
-}
-
-/**
- * This function fills the internal state array with pseudorandom
- * integers.
- */
-static inline void gen_rand_all(sfmt_t *ctx) {
-    int i;
-    __m128i r, r1, r2, mask;
-    mask = _mm_set_epi32(MSK4, MSK3, MSK2, MSK1);
-
-    r1 = _mm_load_si128(&ctx->sfmt[N - 2].si);
-    r2 = _mm_load_si128(&ctx->sfmt[N - 1].si);
-    for (i = 0; i < N - POS1; i++) {
-	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2,
-	  mask);
-	_mm_store_si128(&ctx->sfmt[i].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-    for (; i < N; i++) {
-	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1 - N].si, r1, r2,
-	  mask);
-	_mm_store_si128(&ctx->sfmt[i].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-}
-
-/**
- * This function fills the user-specified array with pseudorandom
- * integers.
- *
- * @param array an 128-bit array to be filled by pseudorandom numbers.
- * @param size number of 128-bit pesudorandom numbers to be generated.
- */
-static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
-    int i, j;
-    __m128i r, r1, r2, mask;
-    mask = _mm_set_epi32(MSK4, MSK3, MSK2, MSK1);
-
-    r1 = _mm_load_si128(&ctx->sfmt[N - 2].si);
-    r2 = _mm_load_si128(&ctx->sfmt[N - 1].si);
-    for (i = 0; i < N - POS1; i++) {
-	r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2,
-	  mask);
-	_mm_store_si128(&array[i].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-    for (; i < N; i++) {
-	r = mm_recursion(&ctx->sfmt[i].si, &array[i + POS1 - N].si, r1, r2,
-	  mask);
-	_mm_store_si128(&array[i].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-    /* main loop */
-    for (; i < size - N; i++) {
-	r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2,
-			 mask);
-	_mm_store_si128(&array[i].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-    for (j = 0; j < 2 * N - size; j++) {
-	r = _mm_load_si128(&array[j + size - N].si);
-	_mm_store_si128(&ctx->sfmt[j].si, r);
-    }
-    for (; i < size; i++) {
-	r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2,
-			 mask);
-	_mm_store_si128(&array[i].si, r);
-	_mm_store_si128(&ctx->sfmt[j++].si, r);
-	r1 = r2;
-	r2 = r;
-    }
-}
-
-#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/SFMT.h b/redis-stable/deps/jemalloc/test/include/test/SFMT.h
deleted file mode 100644
index 863fc55e..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/SFMT.h
+++ /dev/null
@@ -1,146 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/** 
- * @file SFMT.h 
- *
- * @brief SIMD oriented Fast Mersenne Twister(SFMT) pseudorandom
- * number generator
- *
- * @author Mutsuo Saito (Hiroshima University)
- * @author Makoto Matsumoto (Hiroshima University)
- *
- * Copyright (C) 2006, 2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- * University. All rights reserved.
- *
- * The new BSD License is applied to this software.
- * see LICENSE.txt
- *
- * @note We assume that your system has inttypes.h.  If your system
- * doesn't have inttypes.h, you have to typedef uint32_t and uint64_t,
- * and you have to define PRIu64 and PRIx64 in this file as follows:
- * @verbatim
- typedef unsigned int uint32_t
- typedef unsigned long long uint64_t  
- #define PRIu64 "llu"
- #define PRIx64 "llx"
-@endverbatim
- * uint32_t must be exactly 32-bit unsigned integer type (no more, no
- * less), and uint64_t must be exactly 64-bit unsigned integer type.
- * PRIu64 and PRIx64 are used for printf function to print 64-bit
- * unsigned int and 64-bit unsigned int in hexadecimal format.
- */
-
-#ifndef SFMT_H
-#define SFMT_H
-
-typedef struct sfmt_s sfmt_t;
-
-uint32_t gen_rand32(sfmt_t *ctx);
-uint32_t gen_rand32_range(sfmt_t *ctx, uint32_t limit);
-uint64_t gen_rand64(sfmt_t *ctx);
-uint64_t gen_rand64_range(sfmt_t *ctx, uint64_t limit);
-void fill_array32(sfmt_t *ctx, uint32_t *array, int size);
-void fill_array64(sfmt_t *ctx, uint64_t *array, int size);
-sfmt_t *init_gen_rand(uint32_t seed);
-sfmt_t *init_by_array(uint32_t *init_key, int key_length);
-void fini_gen_rand(sfmt_t *ctx);
-const char *get_idstring(void);
-int get_min_array_size32(void);
-int get_min_array_size64(void);
-
-/* These real versions are due to Isaku Wada */
-/** generates a random number on [0,1]-real-interval */
-static inline double to_real1(uint32_t v) {
-    return v * (1.0/4294967295.0); 
-    /* divided by 2^32-1 */ 
-}
-
-/** generates a random number on [0,1]-real-interval */
-static inline double genrand_real1(sfmt_t *ctx) {
-    return to_real1(gen_rand32(ctx));
-}
-
-/** generates a random number on [0,1)-real-interval */
-static inline double to_real2(uint32_t v) {
-    return v * (1.0/4294967296.0); 
-    /* divided by 2^32 */
-}
-
-/** generates a random number on [0,1)-real-interval */
-static inline double genrand_real2(sfmt_t *ctx) {
-    return to_real2(gen_rand32(ctx));
-}
-
-/** generates a random number on (0,1)-real-interval */
-static inline double to_real3(uint32_t v) {
-    return (((double)v) + 0.5)*(1.0/4294967296.0); 
-    /* divided by 2^32 */
-}
-
-/** generates a random number on (0,1)-real-interval */
-static inline double genrand_real3(sfmt_t *ctx) {
-    return to_real3(gen_rand32(ctx));
-}
-/** These real versions are due to Isaku Wada */
-
-/** generates a random number on [0,1) with 53-bit resolution*/
-static inline double to_res53(uint64_t v) {
-    return v * (1.0/18446744073709551616.0L);
-}
-
-/** generates a random number on [0,1) with 53-bit resolution from two
- * 32 bit integers */
-static inline double to_res53_mix(uint32_t x, uint32_t y) {
-    return to_res53(x | ((uint64_t)y << 32));
-}
-
-/** generates a random number on [0,1) with 53-bit resolution
- */
-static inline double genrand_res53(sfmt_t *ctx) {
-    return to_res53(gen_rand64(ctx));
-}
-
-/** generates a random number on [0,1) with 53-bit resolution
-    using 32bit integer.
- */
-static inline double genrand_res53_mix(sfmt_t *ctx) {
-    uint32_t x, y;
-
-    x = gen_rand32(ctx);
-    y = gen_rand32(ctx);
-    return to_res53_mix(x, y);
-}
-#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/btalloc.h b/redis-stable/deps/jemalloc/test/include/test/btalloc.h
deleted file mode 100644
index 5877ea77..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/btalloc.h
+++ /dev/null
@@ -1,30 +0,0 @@
-/* btalloc() provides a mechanism for allocating via permuted backtraces. */
-void	*btalloc(size_t size, unsigned bits);
-
-#define btalloc_n_proto(n)						\
-void	*btalloc_##n(size_t size, unsigned bits);
-btalloc_n_proto(0)
-btalloc_n_proto(1)
-
-#define btalloc_n_gen(n)						\
-void *									\
-btalloc_##n(size_t size, unsigned bits) {				\
-	void *p;							\
-									\
-	if (bits == 0) {						\
-		p = mallocx(size, 0);					\
-	} else {							\
-		switch (bits & 0x1U) {					\
-		case 0:							\
-			p = (btalloc_0(size, bits >> 1));		\
-			break;						\
-		case 1:							\
-			p = (btalloc_1(size, bits >> 1));		\
-			break;						\
-		default: not_reached();					\
-		}							\
-	}								\
-	/* Intentionally sabotage tail call optimization. */		\
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");		\
-	return p;							\
-}
diff --git a/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h b/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
deleted file mode 100644
index 1f062015..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/extent_hooks.h
+++ /dev/null
@@ -1,289 +0,0 @@
-/*
- * Boilerplate code used for testing extent hooks via interception and
- * passthrough.
- */
-
-static void	*extent_alloc_hook(extent_hooks_t *extent_hooks, void *new_addr,
-    size_t size, size_t alignment, bool *zero, bool *commit,
-    unsigned arena_ind);
-static bool	extent_dalloc_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, bool committed, unsigned arena_ind);
-static void	extent_destroy_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, bool committed, unsigned arena_ind);
-static bool	extent_commit_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind);
-static bool	extent_decommit_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind);
-static bool	extent_purge_lazy_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t offset, size_t length, unsigned arena_ind);
-static bool	extent_purge_forced_hook(extent_hooks_t *extent_hooks,
-    void *addr, size_t size, size_t offset, size_t length, unsigned arena_ind);
-static bool	extent_split_hook(extent_hooks_t *extent_hooks, void *addr,
-    size_t size, size_t size_a, size_t size_b, bool committed,
-    unsigned arena_ind);
-static bool	extent_merge_hook(extent_hooks_t *extent_hooks, void *addr_a,
-    size_t size_a, void *addr_b, size_t size_b, bool committed,
-    unsigned arena_ind);
-
-static extent_hooks_t *default_hooks;
-static extent_hooks_t hooks = {
-	extent_alloc_hook,
-	extent_dalloc_hook,
-	extent_destroy_hook,
-	extent_commit_hook,
-	extent_decommit_hook,
-	extent_purge_lazy_hook,
-	extent_purge_forced_hook,
-	extent_split_hook,
-	extent_merge_hook
-};
-
-/* Control whether hook functions pass calls through to default hooks. */
-static bool try_alloc = true;
-static bool try_dalloc = true;
-static bool try_destroy = true;
-static bool try_commit = true;
-static bool try_decommit = true;
-static bool try_purge_lazy = true;
-static bool try_purge_forced = true;
-static bool try_split = true;
-static bool try_merge = true;
-
-/* Set to false prior to operations, then introspect after operations. */
-static bool called_alloc;
-static bool called_dalloc;
-static bool called_destroy;
-static bool called_commit;
-static bool called_decommit;
-static bool called_purge_lazy;
-static bool called_purge_forced;
-static bool called_split;
-static bool called_merge;
-
-/* Set to false prior to operations, then introspect after operations. */
-static bool did_alloc;
-static bool did_dalloc;
-static bool did_destroy;
-static bool did_commit;
-static bool did_decommit;
-static bool did_purge_lazy;
-static bool did_purge_forced;
-static bool did_split;
-static bool did_merge;
-
-#if 0
-#  define TRACE_HOOK(fmt, ...) malloc_printf(fmt, __VA_ARGS__)
-#else
-#  define TRACE_HOOK(fmt, ...)
-#endif
-
-static void *
-extent_alloc_hook(extent_hooks_t *extent_hooks, void *new_addr, size_t size,
-    size_t alignment, bool *zero, bool *commit, unsigned arena_ind) {
-	void *ret;
-
-	TRACE_HOOK("%s(extent_hooks=%p, new_addr=%p, size=%zu, alignment=%zu, "
-	    "*zero=%s, *commit=%s, arena_ind=%u)\n", __func__, extent_hooks,
-	    new_addr, size, alignment, *zero ?  "true" : "false", *commit ?
-	    "true" : "false", arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->alloc, extent_alloc_hook,
-	    "Wrong hook function");
-	called_alloc = true;
-	if (!try_alloc) {
-		return NULL;
-	}
-	ret = default_hooks->alloc(default_hooks, new_addr, size, alignment,
-	    zero, commit, 0);
-	did_alloc = (ret != NULL);
-	return ret;
-}
-
-static bool
-extent_dalloc_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    bool committed, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
-	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
-	    "true" : "false", arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->dalloc, extent_dalloc_hook,
-	    "Wrong hook function");
-	called_dalloc = true;
-	if (!try_dalloc) {
-		return true;
-	}
-	err = default_hooks->dalloc(default_hooks, addr, size, committed, 0);
-	did_dalloc = !err;
-	return err;
-}
-
-static void
-extent_destroy_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    bool committed, unsigned arena_ind) {
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
-	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
-	    "true" : "false", arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->destroy, extent_destroy_hook,
-	    "Wrong hook function");
-	called_destroy = true;
-	if (!try_destroy) {
-		return;
-	}
-	default_hooks->destroy(default_hooks, addr, size, committed, 0);
-	did_destroy = true;
-}
-
-static bool
-extent_commit_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
-	    "length=%zu, arena_ind=%u)\n", __func__, extent_hooks, addr, size,
-	    offset, length, arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->commit, extent_commit_hook,
-	    "Wrong hook function");
-	called_commit = true;
-	if (!try_commit) {
-		return true;
-	}
-	err = default_hooks->commit(default_hooks, addr, size, offset, length,
-	    0);
-	did_commit = !err;
-	return err;
-}
-
-static bool
-extent_decommit_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
-	    "length=%zu, arena_ind=%u)\n", __func__, extent_hooks, addr, size,
-	    offset, length, arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->decommit, extent_decommit_hook,
-	    "Wrong hook function");
-	called_decommit = true;
-	if (!try_decommit) {
-		return true;
-	}
-	err = default_hooks->decommit(default_hooks, addr, size, offset, length,
-	    0);
-	did_decommit = !err;
-	return err;
-}
-
-static bool
-extent_purge_lazy_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
-	    "length=%zu arena_ind=%u)\n", __func__, extent_hooks, addr, size,
-	    offset, length, arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->purge_lazy, extent_purge_lazy_hook,
-	    "Wrong hook function");
-	called_purge_lazy = true;
-	if (!try_purge_lazy) {
-		return true;
-	}
-	err = default_hooks->purge_lazy == NULL ||
-	    default_hooks->purge_lazy(default_hooks, addr, size, offset, length,
-	    0);
-	did_purge_lazy = !err;
-	return err;
-}
-
-static bool
-extent_purge_forced_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t offset, size_t length, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, offset=%zu, "
-	    "length=%zu arena_ind=%u)\n", __func__, extent_hooks, addr, size,
-	    offset, length, arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->purge_forced, extent_purge_forced_hook,
-	    "Wrong hook function");
-	called_purge_forced = true;
-	if (!try_purge_forced) {
-		return true;
-	}
-	err = default_hooks->purge_forced == NULL ||
-	    default_hooks->purge_forced(default_hooks, addr, size, offset,
-	    length, 0);
-	did_purge_forced = !err;
-	return err;
-}
-
-static bool
-extent_split_hook(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    size_t size_a, size_t size_b, bool committed, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, size_a=%zu, "
-	    "size_b=%zu, committed=%s, arena_ind=%u)\n", __func__, extent_hooks,
-	    addr, size, size_a, size_b, committed ? "true" : "false",
-	    arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->split, extent_split_hook,
-	    "Wrong hook function");
-	called_split = true;
-	if (!try_split) {
-		return true;
-	}
-	err = (default_hooks->split == NULL ||
-	    default_hooks->split(default_hooks, addr, size, size_a, size_b,
-	    committed, 0));
-	did_split = !err;
-	return err;
-}
-
-static bool
-extent_merge_hook(extent_hooks_t *extent_hooks, void *addr_a, size_t size_a,
-    void *addr_b, size_t size_b, bool committed, unsigned arena_ind) {
-	bool err;
-
-	TRACE_HOOK("%s(extent_hooks=%p, addr_a=%p, size_a=%zu, addr_b=%p "
-	    "size_b=%zu, committed=%s, arena_ind=%u)\n", __func__, extent_hooks,
-	    addr_a, size_a, addr_b, size_b, committed ? "true" : "false",
-	    arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->merge, extent_merge_hook,
-	    "Wrong hook function");
-	assert_ptr_eq((void *)((uintptr_t)addr_a + size_a), addr_b,
-	    "Extents not mergeable");
-	called_merge = true;
-	if (!try_merge) {
-		return true;
-	}
-	err = (default_hooks->merge == NULL ||
-	    default_hooks->merge(default_hooks, addr_a, size_a, addr_b, size_b,
-	    committed, 0));
-	did_merge = !err;
-	return err;
-}
-
-static void
-extent_hooks_prep(void) {
-	size_t sz;
-
-	sz = sizeof(default_hooks);
-	assert_d_eq(mallctl("arena.0.extent_hooks", (void *)&default_hooks, &sz,
-	    NULL, 0), 0, "Unexpected mallctl() error");
-}
diff --git a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
deleted file mode 100644
index 67caa86b..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test.h.in
+++ /dev/null
@@ -1,173 +0,0 @@
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <limits.h>
-#ifndef SIZE_T_MAX
-#  define SIZE_T_MAX	SIZE_MAX
-#endif
-#include <stdlib.h>
-#include <stdarg.h>
-#include <stdbool.h>
-#include <errno.h>
-#include <math.h>
-#include <string.h>
-#ifdef _WIN32
-#  include "msvc_compat/strings.h"
-#endif
-
-#ifdef _WIN32
-#  include <windows.h>
-#  include "msvc_compat/windows_extra.h"
-#else
-#  include <pthread.h>
-#endif
-
-#include "test/jemalloc_test_defs.h"
-
-#ifdef JEMALLOC_OSSPIN
-#  include <libkern/OSAtomic.h>
-#endif
-
-#if defined(HAVE_ALTIVEC) && !defined(__APPLE__)
-#  include <altivec.h>
-#endif
-#ifdef HAVE_SSE2
-#  include <emmintrin.h>
-#endif
-
-/******************************************************************************/
-/*
- * For unit tests, expose all public and private interfaces.
- */
-#ifdef JEMALLOC_UNIT_TEST
-#  define JEMALLOC_JET
-#  define JEMALLOC_MANGLE
-#  include "jemalloc/internal/jemalloc_preamble.h"
-#  include "jemalloc/internal/jemalloc_internal_includes.h"
-
-/******************************************************************************/
-/*
- * For integration tests, expose the public jemalloc interfaces, but only
- * expose the minimum necessary internal utility code (to avoid re-implementing
- * essentially identical code within the test infrastructure).
- */
-#elif defined(JEMALLOC_INTEGRATION_TEST) || \
-    defined(JEMALLOC_INTEGRATION_CPP_TEST)
-#  define JEMALLOC_MANGLE
-#  include "jemalloc/jemalloc@install_suffix@.h"
-#  include "jemalloc/internal/jemalloc_internal_defs.h"
-#  include "jemalloc/internal/jemalloc_internal_macros.h"
-
-static const bool config_debug =
-#ifdef JEMALLOC_DEBUG
-    true
-#else
-    false
-#endif
-    ;
-
-#  define JEMALLOC_N(n) @private_namespace@##n
-#  include "jemalloc/internal/private_namespace.h"
-#  include "jemalloc/internal/hooks.h"
-
-/* Hermetic headers. */
-#  include "jemalloc/internal/assert.h"
-#  include "jemalloc/internal/malloc_io.h"
-#  include "jemalloc/internal/nstime.h"
-#  include "jemalloc/internal/util.h"
-
-/* Non-hermetic headers. */
-#  include "jemalloc/internal/qr.h"
-#  include "jemalloc/internal/ql.h"
-
-/******************************************************************************/
-/*
- * For stress tests, expose the public jemalloc interfaces with name mangling
- * so that they can be tested as e.g. malloc() and free().  Also expose the
- * public jemalloc interfaces with jet_ prefixes, so that stress tests can use
- * a separate allocator for their internal data structures.
- */
-#elif defined(JEMALLOC_STRESS_TEST)
-#  include "jemalloc/jemalloc@install_suffix@.h"
-
-#  include "jemalloc/jemalloc_protos_jet.h"
-
-#  define JEMALLOC_JET
-#  include "jemalloc/internal/jemalloc_preamble.h"
-#  include "jemalloc/internal/jemalloc_internal_includes.h"
-#  include "jemalloc/internal/public_unnamespace.h"
-#  undef JEMALLOC_JET
-
-#  include "jemalloc/jemalloc_rename.h"
-#  define JEMALLOC_MANGLE
-#  ifdef JEMALLOC_STRESS_TESTLIB
-#    include "jemalloc/jemalloc_mangle_jet.h"
-#  else
-#    include "jemalloc/jemalloc_mangle.h"
-#  endif
-
-/******************************************************************************/
-/*
- * This header does dangerous things, the effects of which only test code
- * should be subject to.
- */
-#else
-#  error "This header cannot be included outside a testing context"
-#endif
-
-/******************************************************************************/
-/*
- * Common test utilities.
- */
-#include "test/btalloc.h"
-#include "test/math.h"
-#include "test/mtx.h"
-#include "test/mq.h"
-#include "test/test.h"
-#include "test/timer.h"
-#include "test/thd.h"
-#define MEXP 19937
-#include "test/SFMT.h"
-
-/******************************************************************************/
-/*
- * Define always-enabled assertion macros, so that test assertions execute even
- * if assertions are disabled in the library code.
- */
-#undef assert
-#undef not_reached
-#undef not_implemented
-#undef assert_not_implemented
-
-#define assert(e) do {							\
-	if (!(e)) {							\
-		malloc_printf(						\
-		    "<jemalloc>: %s:%d: Failed assertion: \"%s\"\n",	\
-		    __FILE__, __LINE__, #e);				\
-		abort();						\
-	}								\
-} while (0)
-
-#define not_reached() do {						\
-	malloc_printf(							\
-	    "<jemalloc>: %s:%d: Unreachable code reached\n",		\
-	    __FILE__, __LINE__);					\
-	abort();							\
-} while (0)
-
-#define not_implemented() do {						\
-	malloc_printf("<jemalloc>: %s:%d: Not implemented\n",		\
-	    __FILE__, __LINE__);					\
-	abort();							\
-} while (0)
-
-#define assert_not_implemented(e) do {					\
-	if (!(e)) {							\
-		not_implemented();					\
-	}								\
-} while (0)
-
-#ifdef __cplusplus
-}
-#endif
diff --git a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in b/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
deleted file mode 100644
index 5cc8532a..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/jemalloc_test_defs.h.in
+++ /dev/null
@@ -1,9 +0,0 @@
-#include "jemalloc/internal/jemalloc_internal_defs.h"
-#include "jemalloc/internal/jemalloc_internal_decls.h"
-
-/*
- * For use by SFMT.  configure.ac doesn't actually define HAVE_SSE2 because its
- * dependencies are notoriously unportable in practice.
- */
-#undef HAVE_SSE2
-#undef HAVE_ALTIVEC
diff --git a/redis-stable/deps/jemalloc/test/include/test/math.h b/redis-stable/deps/jemalloc/test/include/test/math.h
deleted file mode 100644
index efba086d..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/math.h
+++ /dev/null
@@ -1,306 +0,0 @@
-/*
- * Compute the natural log of Gamma(x), accurate to 10 decimal places.
- *
- * This implementation is based on:
- *
- *   Pike, M.C., I.D. Hill (1966) Algorithm 291: Logarithm of Gamma function
- *   [S14].  Communications of the ACM 9(9):684.
- */
-static inline double
-ln_gamma(double x) {
-	double f, z;
-
-	assert(x > 0.0);
-
-	if (x < 7.0) {
-		f = 1.0;
-		z = x;
-		while (z < 7.0) {
-			f *= z;
-			z += 1.0;
-		}
-		x = z;
-		f = -log(f);
-	} else {
-		f = 0.0;
-	}
-
-	z = 1.0 / (x * x);
-
-	return f + (x-0.5) * log(x) - x + 0.918938533204673 +
-	    (((-0.000595238095238 * z + 0.000793650793651) * z -
-	    0.002777777777778) * z + 0.083333333333333) / x;
-}
-
-/*
- * Compute the incomplete Gamma ratio for [0..x], where p is the shape
- * parameter, and ln_gamma_p is ln_gamma(p).
- *
- * This implementation is based on:
- *
- *   Bhattacharjee, G.P. (1970) Algorithm AS 32: The incomplete Gamma integral.
- *   Applied Statistics 19:285-287.
- */
-static inline double
-i_gamma(double x, double p, double ln_gamma_p) {
-	double acu, factor, oflo, gin, term, rn, a, b, an, dif;
-	double pn[6];
-	unsigned i;
-
-	assert(p > 0.0);
-	assert(x >= 0.0);
-
-	if (x == 0.0) {
-		return 0.0;
-	}
-
-	acu = 1.0e-10;
-	oflo = 1.0e30;
-	gin = 0.0;
-	factor = exp(p * log(x) - x - ln_gamma_p);
-
-	if (x <= 1.0 || x < p) {
-		/* Calculation by series expansion. */
-		gin = 1.0;
-		term = 1.0;
-		rn = p;
-
-		while (true) {
-			rn += 1.0;
-			term *= x / rn;
-			gin += term;
-			if (term <= acu) {
-				gin *= factor / p;
-				return gin;
-			}
-		}
-	} else {
-		/* Calculation by continued fraction. */
-		a = 1.0 - p;
-		b = a + x + 1.0;
-		term = 0.0;
-		pn[0] = 1.0;
-		pn[1] = x;
-		pn[2] = x + 1.0;
-		pn[3] = x * b;
-		gin = pn[2] / pn[3];
-
-		while (true) {
-			a += 1.0;
-			b += 2.0;
-			term += 1.0;
-			an = a * term;
-			for (i = 0; i < 2; i++) {
-				pn[i+4] = b * pn[i+2] - an * pn[i];
-			}
-			if (pn[5] != 0.0) {
-				rn = pn[4] / pn[5];
-				dif = fabs(gin - rn);
-				if (dif <= acu && dif <= acu * rn) {
-					gin = 1.0 - factor * gin;
-					return gin;
-				}
-				gin = rn;
-			}
-			for (i = 0; i < 4; i++) {
-				pn[i] = pn[i+2];
-			}
-
-			if (fabs(pn[4]) >= oflo) {
-				for (i = 0; i < 4; i++) {
-					pn[i] /= oflo;
-				}
-			}
-		}
-	}
-}
-
-/*
- * Given a value p in [0..1] of the lower tail area of the normal distribution,
- * compute the limit on the definite integral from [-inf..z] that satisfies p,
- * accurate to 16 decimal places.
- *
- * This implementation is based on:
- *
- *   Wichura, M.J. (1988) Algorithm AS 241: The percentage points of the normal
- *   distribution.  Applied Statistics 37(3):477-484.
- */
-static inline double
-pt_norm(double p) {
-	double q, r, ret;
-
-	assert(p > 0.0 && p < 1.0);
-
-	q = p - 0.5;
-	if (fabs(q) <= 0.425) {
-		/* p close to 1/2. */
-		r = 0.180625 - q * q;
-		return q * (((((((2.5090809287301226727e3 * r +
-		    3.3430575583588128105e4) * r + 6.7265770927008700853e4) * r
-		    + 4.5921953931549871457e4) * r + 1.3731693765509461125e4) *
-		    r + 1.9715909503065514427e3) * r + 1.3314166789178437745e2)
-		    * r + 3.3871328727963666080e0) /
-		    (((((((5.2264952788528545610e3 * r +
-		    2.8729085735721942674e4) * r + 3.9307895800092710610e4) * r
-		    + 2.1213794301586595867e4) * r + 5.3941960214247511077e3) *
-		    r + 6.8718700749205790830e2) * r + 4.2313330701600911252e1)
-		    * r + 1.0);
-	} else {
-		if (q < 0.0) {
-			r = p;
-		} else {
-			r = 1.0 - p;
-		}
-		assert(r > 0.0);
-
-		r = sqrt(-log(r));
-		if (r <= 5.0) {
-			/* p neither close to 1/2 nor 0 or 1. */
-			r -= 1.6;
-			ret = ((((((((7.74545014278341407640e-4 * r +
-			    2.27238449892691845833e-2) * r +
-			    2.41780725177450611770e-1) * r +
-			    1.27045825245236838258e0) * r +
-			    3.64784832476320460504e0) * r +
-			    5.76949722146069140550e0) * r +
-			    4.63033784615654529590e0) * r +
-			    1.42343711074968357734e0) /
-			    (((((((1.05075007164441684324e-9 * r +
-			    5.47593808499534494600e-4) * r +
-			    1.51986665636164571966e-2)
-			    * r + 1.48103976427480074590e-1) * r +
-			    6.89767334985100004550e-1) * r +
-			    1.67638483018380384940e0) * r +
-			    2.05319162663775882187e0) * r + 1.0));
-		} else {
-			/* p near 0 or 1. */
-			r -= 5.0;
-			ret = ((((((((2.01033439929228813265e-7 * r +
-			    2.71155556874348757815e-5) * r +
-			    1.24266094738807843860e-3) * r +
-			    2.65321895265761230930e-2) * r +
-			    2.96560571828504891230e-1) * r +
-			    1.78482653991729133580e0) * r +
-			    5.46378491116411436990e0) * r +
-			    6.65790464350110377720e0) /
-			    (((((((2.04426310338993978564e-15 * r +
-			    1.42151175831644588870e-7) * r +
-			    1.84631831751005468180e-5) * r +
-			    7.86869131145613259100e-4) * r +
-			    1.48753612908506148525e-2) * r +
-			    1.36929880922735805310e-1) * r +
-			    5.99832206555887937690e-1)
-			    * r + 1.0));
-		}
-		if (q < 0.0) {
-			ret = -ret;
-		}
-		return ret;
-	}
-}
-
-/*
- * Given a value p in [0..1] of the lower tail area of the Chi^2 distribution
- * with df degrees of freedom, where ln_gamma_df_2 is ln_gamma(df/2.0), compute
- * the upper limit on the definite integral from [0..z] that satisfies p,
- * accurate to 12 decimal places.
- *
- * This implementation is based on:
- *
- *   Best, D.J., D.E. Roberts (1975) Algorithm AS 91: The percentage points of
- *   the Chi^2 distribution.  Applied Statistics 24(3):385-388.
- *
- *   Shea, B.L. (1991) Algorithm AS R85: A remark on AS 91: The percentage
- *   points of the Chi^2 distribution.  Applied Statistics 40(1):233-235.
- */
-static inline double
-pt_chi2(double p, double df, double ln_gamma_df_2) {
-	double e, aa, xx, c, ch, a, q, p1, p2, t, x, b, s1, s2, s3, s4, s5, s6;
-	unsigned i;
-
-	assert(p >= 0.0 && p < 1.0);
-	assert(df > 0.0);
-
-	e = 5.0e-7;
-	aa = 0.6931471805;
-
-	xx = 0.5 * df;
-	c = xx - 1.0;
-
-	if (df < -1.24 * log(p)) {
-		/* Starting approximation for small Chi^2. */
-		ch = pow(p * xx * exp(ln_gamma_df_2 + xx * aa), 1.0 / xx);
-		if (ch - e < 0.0) {
-			return ch;
-		}
-	} else {
-		if (df > 0.32) {
-			x = pt_norm(p);
-			/*
-			 * Starting approximation using Wilson and Hilferty
-			 * estimate.
-			 */
-			p1 = 0.222222 / df;
-			ch = df * pow(x * sqrt(p1) + 1.0 - p1, 3.0);
-			/* Starting approximation for p tending to 1. */
-			if (ch > 2.2 * df + 6.0) {
-				ch = -2.0 * (log(1.0 - p) - c * log(0.5 * ch) +
-				    ln_gamma_df_2);
-			}
-		} else {
-			ch = 0.4;
-			a = log(1.0 - p);
-			while (true) {
-				q = ch;
-				p1 = 1.0 + ch * (4.67 + ch);
-				p2 = ch * (6.73 + ch * (6.66 + ch));
-				t = -0.5 + (4.67 + 2.0 * ch) / p1 - (6.73 + ch
-				    * (13.32 + 3.0 * ch)) / p2;
-				ch -= (1.0 - exp(a + ln_gamma_df_2 + 0.5 * ch +
-				    c * aa) * p2 / p1) / t;
-				if (fabs(q / ch - 1.0) - 0.01 <= 0.0) {
-					break;
-				}
-			}
-		}
-	}
-
-	for (i = 0; i < 20; i++) {
-		/* Calculation of seven-term Taylor series. */
-		q = ch;
-		p1 = 0.5 * ch;
-		if (p1 < 0.0) {
-			return -1.0;
-		}
-		p2 = p - i_gamma(p1, xx, ln_gamma_df_2);
-		t = p2 * exp(xx * aa + ln_gamma_df_2 + p1 - c * log(ch));
-		b = t / ch;
-		a = 0.5 * t - b * c;
-		s1 = (210.0 + a * (140.0 + a * (105.0 + a * (84.0 + a * (70.0 +
-		    60.0 * a))))) / 420.0;
-		s2 = (420.0 + a * (735.0 + a * (966.0 + a * (1141.0 + 1278.0 *
-		    a)))) / 2520.0;
-		s3 = (210.0 + a * (462.0 + a * (707.0 + 932.0 * a))) / 2520.0;
-		s4 = (252.0 + a * (672.0 + 1182.0 * a) + c * (294.0 + a *
-		    (889.0 + 1740.0 * a))) / 5040.0;
-		s5 = (84.0 + 264.0 * a + c * (175.0 + 606.0 * a)) / 2520.0;
-		s6 = (120.0 + c * (346.0 + 127.0 * c)) / 5040.0;
-		ch += t * (1.0 + 0.5 * t * s1 - b * c * (s1 - b * (s2 - b * (s3
-		    - b * (s4 - b * (s5 - b * s6))))));
-		if (fabs(q / ch - 1.0) <= e) {
-			break;
-		}
-	}
-
-	return ch;
-}
-
-/*
- * Given a value p in [0..1] and Gamma distribution shape and scale parameters,
- * compute the upper limit on the definite integral from [0..z] that satisfies
- * p.
- */
-static inline double
-pt_gamma(double p, double shape, double scale, double ln_gamma_shape) {
-	return pt_chi2(p, shape * 2.0, ln_gamma_shape) * 0.5 * scale;
-}
diff --git a/redis-stable/deps/jemalloc/test/include/test/mq.h b/redis-stable/deps/jemalloc/test/include/test/mq.h
deleted file mode 100644
index af2c078d..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/mq.h
+++ /dev/null
@@ -1,107 +0,0 @@
-void	mq_nanosleep(unsigned ns);
-
-/*
- * Simple templated message queue implementation that relies on only mutexes for
- * synchronization (which reduces portability issues).  Given the following
- * setup:
- *
- *   typedef struct mq_msg_s mq_msg_t;
- *   struct mq_msg_s {
- *           mq_msg(mq_msg_t) link;
- *           [message data]
- *   };
- *   mq_gen(, mq_, mq_t, mq_msg_t, link)
- *
- * The API is as follows:
- *
- *   bool mq_init(mq_t *mq);
- *   void mq_fini(mq_t *mq);
- *   unsigned mq_count(mq_t *mq);
- *   mq_msg_t *mq_tryget(mq_t *mq);
- *   mq_msg_t *mq_get(mq_t *mq);
- *   void mq_put(mq_t *mq, mq_msg_t *msg);
- *
- * The message queue linkage embedded in each message is to be treated as
- * externally opaque (no need to initialize or clean up externally).  mq_fini()
- * does not perform any cleanup of messages, since it knows nothing of their
- * payloads.
- */
-#define mq_msg(a_mq_msg_type)	ql_elm(a_mq_msg_type)
-
-#define mq_gen(a_attr, a_prefix, a_mq_type, a_mq_msg_type, a_field)	\
-typedef struct {							\
-	mtx_t			lock;					\
-	ql_head(a_mq_msg_type)	msgs;					\
-	unsigned		count;					\
-} a_mq_type;								\
-a_attr bool								\
-a_prefix##init(a_mq_type *mq) {						\
-									\
-	if (mtx_init(&mq->lock)) {					\
-		return true;						\
-	}								\
-	ql_new(&mq->msgs);						\
-	mq->count = 0;							\
-	return false;							\
-}									\
-a_attr void								\
-a_prefix##fini(a_mq_type *mq) {						\
-	mtx_fini(&mq->lock);						\
-}									\
-a_attr unsigned								\
-a_prefix##count(a_mq_type *mq) {					\
-	unsigned count;							\
-									\
-	mtx_lock(&mq->lock);						\
-	count = mq->count;						\
-	mtx_unlock(&mq->lock);						\
-	return count;							\
-}									\
-a_attr a_mq_msg_type *							\
-a_prefix##tryget(a_mq_type *mq) {					\
-	a_mq_msg_type *msg;						\
-									\
-	mtx_lock(&mq->lock);						\
-	msg = ql_first(&mq->msgs);					\
-	if (msg != NULL) {						\
-		ql_head_remove(&mq->msgs, a_mq_msg_type, a_field);	\
-		mq->count--;						\
-	}								\
-	mtx_unlock(&mq->lock);						\
-	return msg;							\
-}									\
-a_attr a_mq_msg_type *							\
-a_prefix##get(a_mq_type *mq) {						\
-	a_mq_msg_type *msg;						\
-	unsigned ns;							\
-									\
-	msg = a_prefix##tryget(mq);					\
-	if (msg != NULL) {						\
-		return msg;						\
-	}								\
-									\
-	ns = 1;								\
-	while (true) {							\
-		mq_nanosleep(ns);					\
-		msg = a_prefix##tryget(mq);				\
-		if (msg != NULL) {					\
-			return msg;					\
-		}							\
-		if (ns < 1000*1000*1000) {				\
-			/* Double sleep time, up to max 1 second. */	\
-			ns <<= 1;					\
-			if (ns > 1000*1000*1000) {			\
-				ns = 1000*1000*1000;			\
-			}						\
-		}							\
-	}								\
-}									\
-a_attr void								\
-a_prefix##put(a_mq_type *mq, a_mq_msg_type *msg) {			\
-									\
-	mtx_lock(&mq->lock);						\
-	ql_elm_new(msg, a_field);					\
-	ql_tail_insert(&mq->msgs, msg, a_field);			\
-	mq->count++;							\
-	mtx_unlock(&mq->lock);						\
-}
diff --git a/redis-stable/deps/jemalloc/test/include/test/mtx.h b/redis-stable/deps/jemalloc/test/include/test/mtx.h
deleted file mode 100644
index 58afbc3d..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/mtx.h
+++ /dev/null
@@ -1,23 +0,0 @@
-/*
- * mtx is a slightly simplified version of malloc_mutex.  This code duplication
- * is unfortunate, but there are allocator bootstrapping considerations that
- * would leak into the test infrastructure if malloc_mutex were used directly
- * in tests.
- */
-
-typedef struct {
-#ifdef _WIN32
-	CRITICAL_SECTION	lock;
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-	os_unfair_lock		lock;
-#elif (defined(JEMALLOC_OSSPIN))
-	OSSpinLock		lock;
-#else
-	pthread_mutex_t		lock;
-#endif
-} mtx_t;
-
-bool	mtx_init(mtx_t *mtx);
-void	mtx_fini(mtx_t *mtx);
-void	mtx_lock(mtx_t *mtx);
-void	mtx_unlock(mtx_t *mtx);
diff --git a/redis-stable/deps/jemalloc/test/include/test/test.h b/redis-stable/deps/jemalloc/test/include/test/test.h
deleted file mode 100644
index fd0e5265..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/test.h
+++ /dev/null
@@ -1,338 +0,0 @@
-#define ASSERT_BUFSIZE	256
-
-#define assert_cmp(t, a, b, cmp, neg_cmp, pri, ...) do {		\
-	t a_ = (a);							\
-	t b_ = (b);							\
-	if (!(a_ cmp b_)) {						\
-		char prefix[ASSERT_BUFSIZE];				\
-		char message[ASSERT_BUFSIZE];				\
-		malloc_snprintf(prefix, sizeof(prefix),			\
-		    "%s:%s:%d: Failed assertion: "			\
-		    "(%s) " #cmp " (%s) --> "				\
-		    "%" pri " " #neg_cmp " %" pri ": ",			\
-		    __func__, __FILE__, __LINE__,			\
-		    #a, #b, a_, b_);					\
-		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
-		p_test_fail(prefix, message);				\
-	}								\
-} while (0)
-
-#define assert_ptr_eq(a, b, ...)	assert_cmp(void *, a, b, ==,	\
-    !=, "p", __VA_ARGS__)
-#define assert_ptr_ne(a, b, ...)	assert_cmp(void *, a, b, !=,	\
-    ==, "p", __VA_ARGS__)
-#define assert_ptr_null(a, ...)		assert_cmp(void *, a, NULL, ==,	\
-    !=, "p", __VA_ARGS__)
-#define assert_ptr_not_null(a, ...)	assert_cmp(void *, a, NULL, !=,	\
-    ==, "p", __VA_ARGS__)
-
-#define assert_c_eq(a, b, ...)	assert_cmp(char, a, b, ==, !=, "c", __VA_ARGS__)
-#define assert_c_ne(a, b, ...)	assert_cmp(char, a, b, !=, ==, "c", __VA_ARGS__)
-#define assert_c_lt(a, b, ...)	assert_cmp(char, a, b, <, >=, "c", __VA_ARGS__)
-#define assert_c_le(a, b, ...)	assert_cmp(char, a, b, <=, >, "c", __VA_ARGS__)
-#define assert_c_ge(a, b, ...)	assert_cmp(char, a, b, >=, <, "c", __VA_ARGS__)
-#define assert_c_gt(a, b, ...)	assert_cmp(char, a, b, >, <=, "c", __VA_ARGS__)
-
-#define assert_x_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "#x", __VA_ARGS__)
-#define assert_x_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "#x", __VA_ARGS__)
-#define assert_x_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "#x", __VA_ARGS__)
-#define assert_x_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "#x", __VA_ARGS__)
-#define assert_x_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "#x", __VA_ARGS__)
-#define assert_x_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "#x", __VA_ARGS__)
-
-#define assert_d_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "d", __VA_ARGS__)
-#define assert_d_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "d", __VA_ARGS__)
-#define assert_d_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "d", __VA_ARGS__)
-#define assert_d_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "d", __VA_ARGS__)
-#define assert_d_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "d", __VA_ARGS__)
-#define assert_d_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "d", __VA_ARGS__)
-
-#define assert_u_eq(a, b, ...)	assert_cmp(int, a, b, ==, !=, "u", __VA_ARGS__)
-#define assert_u_ne(a, b, ...)	assert_cmp(int, a, b, !=, ==, "u", __VA_ARGS__)
-#define assert_u_lt(a, b, ...)	assert_cmp(int, a, b, <, >=, "u", __VA_ARGS__)
-#define assert_u_le(a, b, ...)	assert_cmp(int, a, b, <=, >, "u", __VA_ARGS__)
-#define assert_u_ge(a, b, ...)	assert_cmp(int, a, b, >=, <, "u", __VA_ARGS__)
-#define assert_u_gt(a, b, ...)	assert_cmp(int, a, b, >, <=, "u", __VA_ARGS__)
-
-#define assert_ld_eq(a, b, ...)	assert_cmp(long, a, b, ==,	\
-    !=, "ld", __VA_ARGS__)
-#define assert_ld_ne(a, b, ...)	assert_cmp(long, a, b, !=,	\
-    ==, "ld", __VA_ARGS__)
-#define assert_ld_lt(a, b, ...)	assert_cmp(long, a, b, <,	\
-    >=, "ld", __VA_ARGS__)
-#define assert_ld_le(a, b, ...)	assert_cmp(long, a, b, <=,	\
-    >, "ld", __VA_ARGS__)
-#define assert_ld_ge(a, b, ...)	assert_cmp(long, a, b, >=,	\
-    <, "ld", __VA_ARGS__)
-#define assert_ld_gt(a, b, ...)	assert_cmp(long, a, b, >,	\
-    <=, "ld", __VA_ARGS__)
-
-#define assert_lu_eq(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, ==, !=, "lu", __VA_ARGS__)
-#define assert_lu_ne(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, !=, ==, "lu", __VA_ARGS__)
-#define assert_lu_lt(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, <, >=, "lu", __VA_ARGS__)
-#define assert_lu_le(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, <=, >, "lu", __VA_ARGS__)
-#define assert_lu_ge(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, >=, <, "lu", __VA_ARGS__)
-#define assert_lu_gt(a, b, ...)	assert_cmp(unsigned long,	\
-    a, b, >, <=, "lu", __VA_ARGS__)
-
-#define assert_qd_eq(a, b, ...)	assert_cmp(long long, a, b, ==,	\
-    !=, "qd", __VA_ARGS__)
-#define assert_qd_ne(a, b, ...)	assert_cmp(long long, a, b, !=,	\
-    ==, "qd", __VA_ARGS__)
-#define assert_qd_lt(a, b, ...)	assert_cmp(long long, a, b, <,	\
-    >=, "qd", __VA_ARGS__)
-#define assert_qd_le(a, b, ...)	assert_cmp(long long, a, b, <=,	\
-    >, "qd", __VA_ARGS__)
-#define assert_qd_ge(a, b, ...)	assert_cmp(long long, a, b, >=,	\
-    <, "qd", __VA_ARGS__)
-#define assert_qd_gt(a, b, ...)	assert_cmp(long long, a, b, >,	\
-    <=, "qd", __VA_ARGS__)
-
-#define assert_qu_eq(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, ==, !=, "qu", __VA_ARGS__)
-#define assert_qu_ne(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, !=, ==, "qu", __VA_ARGS__)
-#define assert_qu_lt(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, <, >=, "qu", __VA_ARGS__)
-#define assert_qu_le(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, <=, >, "qu", __VA_ARGS__)
-#define assert_qu_ge(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, >=, <, "qu", __VA_ARGS__)
-#define assert_qu_gt(a, b, ...)	assert_cmp(unsigned long long,	\
-    a, b, >, <=, "qu", __VA_ARGS__)
-
-#define assert_jd_eq(a, b, ...)	assert_cmp(intmax_t, a, b, ==,	\
-    !=, "jd", __VA_ARGS__)
-#define assert_jd_ne(a, b, ...)	assert_cmp(intmax_t, a, b, !=,	\
-    ==, "jd", __VA_ARGS__)
-#define assert_jd_lt(a, b, ...)	assert_cmp(intmax_t, a, b, <,	\
-    >=, "jd", __VA_ARGS__)
-#define assert_jd_le(a, b, ...)	assert_cmp(intmax_t, a, b, <=,	\
-    >, "jd", __VA_ARGS__)
-#define assert_jd_ge(a, b, ...)	assert_cmp(intmax_t, a, b, >=,	\
-    <, "jd", __VA_ARGS__)
-#define assert_jd_gt(a, b, ...)	assert_cmp(intmax_t, a, b, >,	\
-    <=, "jd", __VA_ARGS__)
-
-#define assert_ju_eq(a, b, ...)	assert_cmp(uintmax_t, a, b, ==,	\
-    !=, "ju", __VA_ARGS__)
-#define assert_ju_ne(a, b, ...)	assert_cmp(uintmax_t, a, b, !=,	\
-    ==, "ju", __VA_ARGS__)
-#define assert_ju_lt(a, b, ...)	assert_cmp(uintmax_t, a, b, <,	\
-    >=, "ju", __VA_ARGS__)
-#define assert_ju_le(a, b, ...)	assert_cmp(uintmax_t, a, b, <=,	\
-    >, "ju", __VA_ARGS__)
-#define assert_ju_ge(a, b, ...)	assert_cmp(uintmax_t, a, b, >=,	\
-    <, "ju", __VA_ARGS__)
-#define assert_ju_gt(a, b, ...)	assert_cmp(uintmax_t, a, b, >,	\
-    <=, "ju", __VA_ARGS__)
-
-#define assert_zd_eq(a, b, ...)	assert_cmp(ssize_t, a, b, ==,	\
-    !=, "zd", __VA_ARGS__)
-#define assert_zd_ne(a, b, ...)	assert_cmp(ssize_t, a, b, !=,	\
-    ==, "zd", __VA_ARGS__)
-#define assert_zd_lt(a, b, ...)	assert_cmp(ssize_t, a, b, <,	\
-    >=, "zd", __VA_ARGS__)
-#define assert_zd_le(a, b, ...)	assert_cmp(ssize_t, a, b, <=,	\
-    >, "zd", __VA_ARGS__)
-#define assert_zd_ge(a, b, ...)	assert_cmp(ssize_t, a, b, >=,	\
-    <, "zd", __VA_ARGS__)
-#define assert_zd_gt(a, b, ...)	assert_cmp(ssize_t, a, b, >,	\
-    <=, "zd", __VA_ARGS__)
-
-#define assert_zu_eq(a, b, ...)	assert_cmp(size_t, a, b, ==,	\
-    !=, "zu", __VA_ARGS__)
-#define assert_zu_ne(a, b, ...)	assert_cmp(size_t, a, b, !=,	\
-    ==, "zu", __VA_ARGS__)
-#define assert_zu_lt(a, b, ...)	assert_cmp(size_t, a, b, <,	\
-    >=, "zu", __VA_ARGS__)
-#define assert_zu_le(a, b, ...)	assert_cmp(size_t, a, b, <=,	\
-    >, "zu", __VA_ARGS__)
-#define assert_zu_ge(a, b, ...)	assert_cmp(size_t, a, b, >=,	\
-    <, "zu", __VA_ARGS__)
-#define assert_zu_gt(a, b, ...)	assert_cmp(size_t, a, b, >,	\
-    <=, "zu", __VA_ARGS__)
-
-#define assert_d32_eq(a, b, ...)	assert_cmp(int32_t, a, b, ==,	\
-    !=, FMTd32, __VA_ARGS__)
-#define assert_d32_ne(a, b, ...)	assert_cmp(int32_t, a, b, !=,	\
-    ==, FMTd32, __VA_ARGS__)
-#define assert_d32_lt(a, b, ...)	assert_cmp(int32_t, a, b, <,	\
-    >=, FMTd32, __VA_ARGS__)
-#define assert_d32_le(a, b, ...)	assert_cmp(int32_t, a, b, <=,	\
-    >, FMTd32, __VA_ARGS__)
-#define assert_d32_ge(a, b, ...)	assert_cmp(int32_t, a, b, >=,	\
-    <, FMTd32, __VA_ARGS__)
-#define assert_d32_gt(a, b, ...)	assert_cmp(int32_t, a, b, >,	\
-    <=, FMTd32, __VA_ARGS__)
-
-#define assert_u32_eq(a, b, ...)	assert_cmp(uint32_t, a, b, ==,	\
-    !=, FMTu32, __VA_ARGS__)
-#define assert_u32_ne(a, b, ...)	assert_cmp(uint32_t, a, b, !=,	\
-    ==, FMTu32, __VA_ARGS__)
-#define assert_u32_lt(a, b, ...)	assert_cmp(uint32_t, a, b, <,	\
-    >=, FMTu32, __VA_ARGS__)
-#define assert_u32_le(a, b, ...)	assert_cmp(uint32_t, a, b, <=,	\
-    >, FMTu32, __VA_ARGS__)
-#define assert_u32_ge(a, b, ...)	assert_cmp(uint32_t, a, b, >=,	\
-    <, FMTu32, __VA_ARGS__)
-#define assert_u32_gt(a, b, ...)	assert_cmp(uint32_t, a, b, >,	\
-    <=, FMTu32, __VA_ARGS__)
-
-#define assert_d64_eq(a, b, ...)	assert_cmp(int64_t, a, b, ==,	\
-    !=, FMTd64, __VA_ARGS__)
-#define assert_d64_ne(a, b, ...)	assert_cmp(int64_t, a, b, !=,	\
-    ==, FMTd64, __VA_ARGS__)
-#define assert_d64_lt(a, b, ...)	assert_cmp(int64_t, a, b, <,	\
-    >=, FMTd64, __VA_ARGS__)
-#define assert_d64_le(a, b, ...)	assert_cmp(int64_t, a, b, <=,	\
-    >, FMTd64, __VA_ARGS__)
-#define assert_d64_ge(a, b, ...)	assert_cmp(int64_t, a, b, >=,	\
-    <, FMTd64, __VA_ARGS__)
-#define assert_d64_gt(a, b, ...)	assert_cmp(int64_t, a, b, >,	\
-    <=, FMTd64, __VA_ARGS__)
-
-#define assert_u64_eq(a, b, ...)	assert_cmp(uint64_t, a, b, ==,	\
-    !=, FMTu64, __VA_ARGS__)
-#define assert_u64_ne(a, b, ...)	assert_cmp(uint64_t, a, b, !=,	\
-    ==, FMTu64, __VA_ARGS__)
-#define assert_u64_lt(a, b, ...)	assert_cmp(uint64_t, a, b, <,	\
-    >=, FMTu64, __VA_ARGS__)
-#define assert_u64_le(a, b, ...)	assert_cmp(uint64_t, a, b, <=,	\
-    >, FMTu64, __VA_ARGS__)
-#define assert_u64_ge(a, b, ...)	assert_cmp(uint64_t, a, b, >=,	\
-    <, FMTu64, __VA_ARGS__)
-#define assert_u64_gt(a, b, ...)	assert_cmp(uint64_t, a, b, >,	\
-    <=, FMTu64, __VA_ARGS__)
-
-#define assert_b_eq(a, b, ...) do {					\
-	bool a_ = (a);							\
-	bool b_ = (b);							\
-	if (!(a_ == b_)) {						\
-		char prefix[ASSERT_BUFSIZE];				\
-		char message[ASSERT_BUFSIZE];				\
-		malloc_snprintf(prefix, sizeof(prefix),			\
-		    "%s:%s:%d: Failed assertion: "			\
-		    "(%s) == (%s) --> %s != %s: ",			\
-		    __func__, __FILE__, __LINE__,			\
-		    #a, #b, a_ ? "true" : "false",			\
-		    b_ ? "true" : "false");				\
-		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
-		p_test_fail(prefix, message);				\
-	}								\
-} while (0)
-#define assert_b_ne(a, b, ...) do {					\
-	bool a_ = (a);							\
-	bool b_ = (b);							\
-	if (!(a_ != b_)) {						\
-		char prefix[ASSERT_BUFSIZE];				\
-		char message[ASSERT_BUFSIZE];				\
-		malloc_snprintf(prefix, sizeof(prefix),			\
-		    "%s:%s:%d: Failed assertion: "			\
-		    "(%s) != (%s) --> %s == %s: ",			\
-		    __func__, __FILE__, __LINE__,			\
-		    #a, #b, a_ ? "true" : "false",			\
-		    b_ ? "true" : "false");				\
-		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
-		p_test_fail(prefix, message);				\
-	}								\
-} while (0)
-#define assert_true(a, ...)	assert_b_eq(a, true, __VA_ARGS__)
-#define assert_false(a, ...)	assert_b_eq(a, false, __VA_ARGS__)
-
-#define assert_str_eq(a, b, ...) do {				\
-	if (strcmp((a), (b))) {						\
-		char prefix[ASSERT_BUFSIZE];				\
-		char message[ASSERT_BUFSIZE];				\
-		malloc_snprintf(prefix, sizeof(prefix),			\
-		    "%s:%s:%d: Failed assertion: "			\
-		    "(%s) same as (%s) --> "				\
-		    "\"%s\" differs from \"%s\": ",			\
-		    __func__, __FILE__, __LINE__, #a, #b, a, b);	\
-		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
-		p_test_fail(prefix, message);				\
-	}								\
-} while (0)
-#define assert_str_ne(a, b, ...) do {				\
-	if (!strcmp((a), (b))) {					\
-		char prefix[ASSERT_BUFSIZE];				\
-		char message[ASSERT_BUFSIZE];				\
-		malloc_snprintf(prefix, sizeof(prefix),			\
-		    "%s:%s:%d: Failed assertion: "			\
-		    "(%s) differs from (%s) --> "			\
-		    "\"%s\" same as \"%s\": ",				\
-		    __func__, __FILE__, __LINE__, #a, #b, a, b);	\
-		malloc_snprintf(message, sizeof(message), __VA_ARGS__);	\
-		p_test_fail(prefix, message);				\
-	}								\
-} while (0)
-
-#define assert_not_reached(...) do {					\
-	char prefix[ASSERT_BUFSIZE];					\
-	char message[ASSERT_BUFSIZE];					\
-	malloc_snprintf(prefix, sizeof(prefix),				\
-	    "%s:%s:%d: Unreachable code reached: ",			\
-	    __func__, __FILE__, __LINE__);				\
-	malloc_snprintf(message, sizeof(message), __VA_ARGS__);		\
-	p_test_fail(prefix, message);					\
-} while (0)
-
-/*
- * If this enum changes, corresponding changes in test/test.sh.in are also
- * necessary.
- */
-typedef enum {
-	test_status_pass = 0,
-	test_status_skip = 1,
-	test_status_fail = 2,
-
-	test_status_count = 3
-} test_status_t;
-
-typedef void (test_t)(void);
-
-#define TEST_BEGIN(f)							\
-static void								\
-f(void) {								\
-	p_test_init(#f);
-
-#define TEST_END							\
-	goto label_test_end;						\
-label_test_end:								\
-	p_test_fini();							\
-}
-
-#define test(...)							\
-	p_test(__VA_ARGS__, NULL)
-
-#define test_no_reentrancy(...)							\
-	p_test_no_reentrancy(__VA_ARGS__, NULL)
-
-#define test_no_malloc_init(...)					\
-	p_test_no_malloc_init(__VA_ARGS__, NULL)
-
-#define test_skip_if(e) do {						\
-	if (e) {							\
-		test_skip("%s:%s:%d: Test skipped: (%s)",		\
-		    __func__, __FILE__, __LINE__, #e);			\
-		goto label_test_end;					\
-	}								\
-} while (0)
-
-bool test_is_reentrant();
-
-void	test_skip(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
-void	test_fail(const char *format, ...) JEMALLOC_FORMAT_PRINTF(1, 2);
-
-/* For private use by macros. */
-test_status_t	p_test(test_t *t, ...);
-test_status_t	p_test_no_reentrancy(test_t *t, ...);
-test_status_t	p_test_no_malloc_init(test_t *t, ...);
-void	p_test_init(const char *name);
-void	p_test_fini(void);
-void	p_test_fail(const char *prefix, const char *message);
diff --git a/redis-stable/deps/jemalloc/test/include/test/thd.h b/redis-stable/deps/jemalloc/test/include/test/thd.h
deleted file mode 100644
index 47a51262..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/thd.h
+++ /dev/null
@@ -1,9 +0,0 @@
-/* Abstraction layer for threading in tests. */
-#ifdef _WIN32
-typedef HANDLE thd_t;
-#else
-typedef pthread_t thd_t;
-#endif
-
-void	thd_create(thd_t *thd, void *(*proc)(void *), void *arg);
-void	thd_join(thd_t thd, void **ret);
diff --git a/redis-stable/deps/jemalloc/test/include/test/timer.h b/redis-stable/deps/jemalloc/test/include/test/timer.h
deleted file mode 100644
index ace6191b..00000000
--- a/redis-stable/deps/jemalloc/test/include/test/timer.h
+++ /dev/null
@@ -1,11 +0,0 @@
-/* Simple timer, for use in benchmark reporting. */
-
-typedef struct {
-	nstime_t t0;
-	nstime_t t1;
-} timedelta_t;
-
-void	timer_start(timedelta_t *timer);
-void	timer_stop(timedelta_t *timer);
-uint64_t	timer_usec(const timedelta_t *timer);
-void	timer_ratio(timedelta_t *a, timedelta_t *b, char *buf, size_t buflen);
diff --git a/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c b/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
deleted file mode 100644
index 222164d6..00000000
--- a/redis-stable/deps/jemalloc/test/integration/MALLOCX_ARENA.c
+++ /dev/null
@@ -1,66 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NTHREADS 10
-
-static bool have_dss =
-#ifdef JEMALLOC_DSS
-    true
-#else
-    false
-#endif
-    ;
-
-void *
-thd_start(void *arg) {
-	unsigned thread_ind = (unsigned)(uintptr_t)arg;
-	unsigned arena_ind;
-	void *p;
-	size_t sz;
-
-	sz = sizeof(arena_ind);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Error in arenas.create");
-
-	if (thread_ind % 4 != 3) {
-		size_t mib[3];
-		size_t miblen = sizeof(mib) / sizeof(size_t);
-		const char *dss_precs[] = {"disabled", "primary", "secondary"};
-		unsigned prec_ind = thread_ind %
-		    (sizeof(dss_precs)/sizeof(char*));
-		const char *dss = dss_precs[prec_ind];
-		int expected_err = (have_dss || prec_ind == 0) ? 0 : EFAULT;
-		assert_d_eq(mallctlnametomib("arena.0.dss", mib, &miblen), 0,
-		    "Error in mallctlnametomib()");
-		mib[1] = arena_ind;
-		assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&dss,
-		    sizeof(const char *)), expected_err,
-		    "Error in mallctlbymib()");
-	}
-
-	p = mallocx(1, MALLOCX_ARENA(arena_ind));
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	dallocx(p, 0);
-
-	return NULL;
-}
-
-TEST_BEGIN(test_MALLOCX_ARENA) {
-	thd_t thds[NTHREADS];
-	unsigned i;
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_create(&thds[i], thd_start,
-		    (void *)(uintptr_t)i);
-	}
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_join(thds[i], NULL);
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_MALLOCX_ARENA);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c b/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
deleted file mode 100644
index 536b67ea..00000000
--- a/redis-stable/deps/jemalloc/test/integration/aligned_alloc.c
+++ /dev/null
@@ -1,133 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define MAXALIGN (((size_t)1) << 23)
-
-/*
- * On systems which can't merge extents, tests that call this function generate
- * a lot of dirty memory very quickly.  Purging between cycles mitigates
- * potential OOM on e.g. 32-bit Windows.
- */
-static void
-purge(void) {
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl error");
-}
-
-TEST_BEGIN(test_alignment_errors) {
-	size_t alignment;
-	void *p;
-
-	alignment = 0;
-	set_errno(0);
-	p = aligned_alloc(alignment, 1);
-	assert_false(p != NULL || get_errno() != EINVAL,
-	    "Expected error for invalid alignment %zu", alignment);
-
-	for (alignment = sizeof(size_t); alignment < MAXALIGN;
-	    alignment <<= 1) {
-		set_errno(0);
-		p = aligned_alloc(alignment + 1, 1);
-		assert_false(p != NULL || get_errno() != EINVAL,
-		    "Expected error for invalid alignment %zu",
-		    alignment + 1);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_oom_errors) {
-	size_t alignment, size;
-	void *p;
-
-#if LG_SIZEOF_PTR == 3
-	alignment = UINT64_C(0x8000000000000000);
-	size      = UINT64_C(0x8000000000000000);
-#else
-	alignment = 0x80000000LU;
-	size      = 0x80000000LU;
-#endif
-	set_errno(0);
-	p = aligned_alloc(alignment, size);
-	assert_false(p != NULL || get_errno() != ENOMEM,
-	    "Expected error for aligned_alloc(%zu, %zu)",
-	    alignment, size);
-
-#if LG_SIZEOF_PTR == 3
-	alignment = UINT64_C(0x4000000000000000);
-	size      = UINT64_C(0xc000000000000001);
-#else
-	alignment = 0x40000000LU;
-	size      = 0xc0000001LU;
-#endif
-	set_errno(0);
-	p = aligned_alloc(alignment, size);
-	assert_false(p != NULL || get_errno() != ENOMEM,
-	    "Expected error for aligned_alloc(%zu, %zu)",
-	    alignment, size);
-
-	alignment = 0x10LU;
-#if LG_SIZEOF_PTR == 3
-	size = UINT64_C(0xfffffffffffffff0);
-#else
-	size = 0xfffffff0LU;
-#endif
-	set_errno(0);
-	p = aligned_alloc(alignment, size);
-	assert_false(p != NULL || get_errno() != ENOMEM,
-	    "Expected error for aligned_alloc(&p, %zu, %zu)",
-	    alignment, size);
-}
-TEST_END
-
-TEST_BEGIN(test_alignment_and_size) {
-#define NITER 4
-	size_t alignment, size, total;
-	unsigned i;
-	void *ps[NITER];
-
-	for (i = 0; i < NITER; i++) {
-		ps[i] = NULL;
-	}
-
-	for (alignment = 8;
-	    alignment <= MAXALIGN;
-	    alignment <<= 1) {
-		total = 0;
-		for (size = 1;
-		    size < 3 * alignment && size < (1U << 31);
-		    size += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
-			for (i = 0; i < NITER; i++) {
-				ps[i] = aligned_alloc(alignment, size);
-				if (ps[i] == NULL) {
-					char buf[BUFERROR_BUF];
-
-					buferror(get_errno(), buf, sizeof(buf));
-					test_fail(
-					    "Error for alignment=%zu, "
-					    "size=%zu (%#zx): %s",
-					    alignment, size, size, buf);
-				}
-				total += malloc_usable_size(ps[i]);
-				if (total >= (MAXALIGN << 1)) {
-					break;
-				}
-			}
-			for (i = 0; i < NITER; i++) {
-				if (ps[i] != NULL) {
-					free(ps[i]);
-					ps[i] = NULL;
-				}
-			}
-		}
-		purge();
-	}
-#undef NITER
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_alignment_errors,
-	    test_oom_errors,
-	    test_alignment_and_size);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/allocated.c b/redis-stable/deps/jemalloc/test/integration/allocated.c
deleted file mode 100644
index 1425fd0a..00000000
--- a/redis-stable/deps/jemalloc/test/integration/allocated.c
+++ /dev/null
@@ -1,124 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static const bool config_stats =
-#ifdef JEMALLOC_STATS
-    true
-#else
-    false
-#endif
-    ;
-
-void *
-thd_start(void *arg) {
-	int err;
-	void *p;
-	uint64_t a0, a1, d0, d1;
-	uint64_t *ap0, *ap1, *dp0, *dp1;
-	size_t sz, usize;
-
-	sz = sizeof(a0);
-	if ((err = mallctl("thread.allocated", (void *)&a0, &sz, NULL, 0))) {
-		if (err == ENOENT) {
-			goto label_ENOENT;
-		}
-		test_fail("%s(): Error in mallctl(): %s", __func__,
-		    strerror(err));
-	}
-	sz = sizeof(ap0);
-	if ((err = mallctl("thread.allocatedp", (void *)&ap0, &sz, NULL, 0))) {
-		if (err == ENOENT) {
-			goto label_ENOENT;
-		}
-		test_fail("%s(): Error in mallctl(): %s", __func__,
-		    strerror(err));
-	}
-	assert_u64_eq(*ap0, a0,
-	    "\"thread.allocatedp\" should provide a pointer to internal "
-	    "storage");
-
-	sz = sizeof(d0);
-	if ((err = mallctl("thread.deallocated", (void *)&d0, &sz, NULL, 0))) {
-		if (err == ENOENT) {
-			goto label_ENOENT;
-		}
-		test_fail("%s(): Error in mallctl(): %s", __func__,
-		    strerror(err));
-	}
-	sz = sizeof(dp0);
-	if ((err = mallctl("thread.deallocatedp", (void *)&dp0, &sz, NULL,
-	    0))) {
-		if (err == ENOENT) {
-			goto label_ENOENT;
-		}
-		test_fail("%s(): Error in mallctl(): %s", __func__,
-		    strerror(err));
-	}
-	assert_u64_eq(*dp0, d0,
-	    "\"thread.deallocatedp\" should provide a pointer to internal "
-	    "storage");
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Unexpected malloc() error");
-
-	sz = sizeof(a1);
-	mallctl("thread.allocated", (void *)&a1, &sz, NULL, 0);
-	sz = sizeof(ap1);
-	mallctl("thread.allocatedp", (void *)&ap1, &sz, NULL, 0);
-	assert_u64_eq(*ap1, a1,
-	    "Dereferenced \"thread.allocatedp\" value should equal "
-	    "\"thread.allocated\" value");
-	assert_ptr_eq(ap0, ap1,
-	    "Pointer returned by \"thread.allocatedp\" should not change");
-
-	usize = malloc_usable_size(p);
-	assert_u64_le(a0 + usize, a1,
-	    "Allocated memory counter should increase by at least the amount "
-	    "explicitly allocated");
-
-	free(p);
-
-	sz = sizeof(d1);
-	mallctl("thread.deallocated", (void *)&d1, &sz, NULL, 0);
-	sz = sizeof(dp1);
-	mallctl("thread.deallocatedp", (void *)&dp1, &sz, NULL, 0);
-	assert_u64_eq(*dp1, d1,
-	    "Dereferenced \"thread.deallocatedp\" value should equal "
-	    "\"thread.deallocated\" value");
-	assert_ptr_eq(dp0, dp1,
-	    "Pointer returned by \"thread.deallocatedp\" should not change");
-
-	assert_u64_le(d0 + usize, d1,
-	    "Deallocated memory counter should increase by at least the amount "
-	    "explicitly deallocated");
-
-	return NULL;
-label_ENOENT:
-	assert_false(config_stats,
-	    "ENOENT should only be returned if stats are disabled");
-	test_skip("\"thread.allocated\" mallctl not available");
-	return NULL;
-}
-
-TEST_BEGIN(test_main_thread) {
-	thd_start(NULL);
-}
-TEST_END
-
-TEST_BEGIN(test_subthread) {
-	thd_t thd;
-
-	thd_create(&thd, thd_start, NULL);
-	thd_join(thd, NULL);
-}
-TEST_END
-
-int
-main(void) {
-	/* Run tests multiple times to check for bad interactions. */
-	return test(
-	    test_main_thread,
-	    test_subthread,
-	    test_main_thread,
-	    test_subthread,
-	    test_main_thread);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/extent.c b/redis-stable/deps/jemalloc/test/integration/extent.c
deleted file mode 100644
index b5db0876..00000000
--- a/redis-stable/deps/jemalloc/test/integration/extent.c
+++ /dev/null
@@ -1,248 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "test/extent_hooks.h"
-
-static bool
-check_background_thread_enabled(void) {
-	bool enabled;
-	size_t sz = sizeof(bool);
-	int ret = mallctl("background_thread", (void *)&enabled, &sz, NULL,0);
-	if (ret == ENOENT) {
-		return false;
-	}
-	assert_d_eq(ret, 0, "Unexpected mallctl error");
-	return enabled;
-}
-
-static void
-test_extent_body(unsigned arena_ind) {
-	void *p;
-	size_t large0, large1, large2, sz;
-	size_t purge_mib[3];
-	size_t purge_miblen;
-	int flags;
-	bool xallocx_success_a, xallocx_success_b, xallocx_success_c;
-
-	flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
-
-	/* Get large size classes. */
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
-	    0), 0, "Unexpected arenas.lextent.0.size failure");
-	assert_d_eq(mallctl("arenas.lextent.1.size", (void *)&large1, &sz, NULL,
-	    0), 0, "Unexpected arenas.lextent.1.size failure");
-	assert_d_eq(mallctl("arenas.lextent.2.size", (void *)&large2, &sz, NULL,
-	    0), 0, "Unexpected arenas.lextent.2.size failure");
-
-	/* Test dalloc/decommit/purge cascade. */
-	purge_miblen = sizeof(purge_mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.purge", purge_mib, &purge_miblen),
-	    0, "Unexpected mallctlnametomib() failure");
-	purge_mib[1] = (size_t)arena_ind;
-	called_alloc = false;
-	try_alloc = true;
-	try_dalloc = false;
-	try_decommit = false;
-	p = mallocx(large0 * 2, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	assert_true(called_alloc, "Expected alloc call");
-	called_dalloc = false;
-	called_decommit = false;
-	did_purge_lazy = false;
-	did_purge_forced = false;
-	called_split = false;
-	xallocx_success_a = (xallocx(p, large0, 0, flags) == large0);
-	assert_d_eq(mallctlbymib(purge_mib, purge_miblen, NULL, NULL, NULL, 0),
-	    0, "Unexpected arena.%u.purge error", arena_ind);
-	if (xallocx_success_a) {
-		assert_true(called_dalloc, "Expected dalloc call");
-		assert_true(called_decommit, "Expected decommit call");
-		assert_true(did_purge_lazy || did_purge_forced,
-		    "Expected purge");
-	}
-	assert_true(called_split, "Expected split call");
-	dallocx(p, flags);
-	try_dalloc = true;
-
-	/* Test decommit/commit and observe split/merge. */
-	try_dalloc = false;
-	try_decommit = true;
-	p = mallocx(large0 * 2, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	did_decommit = false;
-	did_commit = false;
-	called_split = false;
-	did_split = false;
-	did_merge = false;
-	xallocx_success_b = (xallocx(p, large0, 0, flags) == large0);
-	assert_d_eq(mallctlbymib(purge_mib, purge_miblen, NULL, NULL, NULL, 0),
-	    0, "Unexpected arena.%u.purge error", arena_ind);
-	if (xallocx_success_b) {
-		assert_true(did_split, "Expected split");
-	}
-	xallocx_success_c = (xallocx(p, large0 * 2, 0, flags) == large0 * 2);
-	if (did_split) {
-		assert_b_eq(did_decommit, did_commit,
-		    "Expected decommit/commit match");
-	}
-	if (xallocx_success_b && xallocx_success_c) {
-		assert_true(did_merge, "Expected merge");
-	}
-	dallocx(p, flags);
-	try_dalloc = true;
-	try_decommit = false;
-
-	/* Make sure non-large allocation succeeds. */
-	p = mallocx(42, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	dallocx(p, flags);
-}
-
-static void
-test_manual_hook_auto_arena(void) {
-	unsigned narenas;
-	size_t old_size, new_size, sz;
-	size_t hooks_mib[3];
-	size_t hooks_miblen;
-	extent_hooks_t *new_hooks, *old_hooks;
-
-	extent_hooks_prep();
-
-	sz = sizeof(unsigned);
-	/* Get number of auto arenas. */
-	assert_d_eq(mallctl("opt.narenas", (void *)&narenas, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	if (narenas == 1) {
-		return;
-	}
-
-	/* Install custom extent hooks on arena 1 (might not be initialized). */
-	hooks_miblen = sizeof(hooks_mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.extent_hooks", hooks_mib,
-	    &hooks_miblen), 0, "Unexpected mallctlnametomib() failure");
-	hooks_mib[1] = 1;
-	old_size = sizeof(extent_hooks_t *);
-	new_hooks = &hooks;
-	new_size = sizeof(extent_hooks_t *);
-	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
-	    &old_size, (void *)&new_hooks, new_size), 0,
-	    "Unexpected extent_hooks error");
-	static bool auto_arena_created = false;
-	if (old_hooks != &hooks) {
-		assert_b_eq(auto_arena_created, false,
-		    "Expected auto arena 1 created only once.");
-		auto_arena_created = true;
-	}
-}
-
-static void
-test_manual_hook_body(void) {
-	unsigned arena_ind;
-	size_t old_size, new_size, sz;
-	size_t hooks_mib[3];
-	size_t hooks_miblen;
-	extent_hooks_t *new_hooks, *old_hooks;
-
-	extent_hooks_prep();
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-
-	/* Install custom extent hooks. */
-	hooks_miblen = sizeof(hooks_mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.extent_hooks", hooks_mib,
-	    &hooks_miblen), 0, "Unexpected mallctlnametomib() failure");
-	hooks_mib[1] = (size_t)arena_ind;
-	old_size = sizeof(extent_hooks_t *);
-	new_hooks = &hooks;
-	new_size = sizeof(extent_hooks_t *);
-	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
-	    &old_size, (void *)&new_hooks, new_size), 0,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->alloc, extent_alloc_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->dalloc, extent_dalloc_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->commit, extent_commit_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->decommit, extent_decommit_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->purge_lazy, extent_purge_lazy_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->purge_forced, extent_purge_forced_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->split, extent_split_hook,
-	    "Unexpected extent_hooks error");
-	assert_ptr_ne(old_hooks->merge, extent_merge_hook,
-	    "Unexpected extent_hooks error");
-
-	if (!check_background_thread_enabled()) {
-		test_extent_body(arena_ind);
-	}
-
-	/* Restore extent hooks. */
-	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, NULL, NULL,
-	    (void *)&old_hooks, new_size), 0, "Unexpected extent_hooks error");
-	assert_d_eq(mallctlbymib(hooks_mib, hooks_miblen, (void *)&old_hooks,
-	    &old_size, NULL, 0), 0, "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks, default_hooks, "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->alloc, default_hooks->alloc,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->dalloc, default_hooks->dalloc,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->commit, default_hooks->commit,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->decommit, default_hooks->decommit,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->purge_lazy, default_hooks->purge_lazy,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->purge_forced, default_hooks->purge_forced,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->split, default_hooks->split,
-	    "Unexpected extent_hooks error");
-	assert_ptr_eq(old_hooks->merge, default_hooks->merge,
-	    "Unexpected extent_hooks error");
-}
-
-TEST_BEGIN(test_extent_manual_hook) {
-	test_manual_hook_auto_arena();
-	test_manual_hook_body();
-
-	/* Test failure paths. */
-	try_split = false;
-	test_manual_hook_body();
-	try_merge = false;
-	test_manual_hook_body();
-	try_purge_lazy = false;
-	try_purge_forced = false;
-	test_manual_hook_body();
-
-	try_split = try_merge = try_purge_lazy = try_purge_forced = true;
-}
-TEST_END
-
-TEST_BEGIN(test_extent_auto_hook) {
-	unsigned arena_ind;
-	size_t new_size, sz;
-	extent_hooks_t *new_hooks;
-
-	extent_hooks_prep();
-
-	sz = sizeof(unsigned);
-	new_hooks = &hooks;
-	new_size = sizeof(extent_hooks_t *);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
-	    (void *)&new_hooks, new_size), 0, "Unexpected mallctl() failure");
-
-	test_skip_if(check_background_thread_enabled());
-	test_extent_body(arena_ind);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_extent_manual_hook,
-	    test_extent_auto_hook);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/extent.sh b/redis-stable/deps/jemalloc/test/integration/extent.sh
deleted file mode 100644
index 0cc21873..00000000
--- a/redis-stable/deps/jemalloc/test/integration/extent.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="junk:false"
-fi
diff --git a/redis-stable/deps/jemalloc/test/integration/mallocx.c b/redis-stable/deps/jemalloc/test/integration/mallocx.c
deleted file mode 100644
index fd960f30..00000000
--- a/redis-stable/deps/jemalloc/test/integration/mallocx.c
+++ /dev/null
@@ -1,228 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static unsigned
-get_nsizes_impl(const char *cmd) {
-	unsigned ret;
-	size_t z;
-
-	z = sizeof(unsigned);
-	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
-	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
-
-	return ret;
-}
-
-static unsigned
-get_nlarge(void) {
-	return get_nsizes_impl("arenas.nlextents");
-}
-
-static size_t
-get_size_impl(const char *cmd, size_t ind) {
-	size_t ret;
-	size_t z;
-	size_t mib[4];
-	size_t miblen = 4;
-
-	z = sizeof(size_t);
-	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
-	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
-	mib[2] = ind;
-	z = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
-	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
-
-	return ret;
-}
-
-static size_t
-get_large_size(size_t ind) {
-	return get_size_impl("arenas.lextent.0.size", ind);
-}
-
-/*
- * On systems which can't merge extents, tests that call this function generate
- * a lot of dirty memory very quickly.  Purging between cycles mitigates
- * potential OOM on e.g. 32-bit Windows.
- */
-static void
-purge(void) {
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl error");
-}
-
-TEST_BEGIN(test_overflow) {
-	size_t largemax;
-
-	largemax = get_large_size(get_nlarge()-1);
-
-	assert_ptr_null(mallocx(largemax+1, 0),
-	    "Expected OOM for mallocx(size=%#zx, 0)", largemax+1);
-
-	assert_ptr_null(mallocx(ZU(PTRDIFF_MAX)+1, 0),
-	    "Expected OOM for mallocx(size=%#zx, 0)", ZU(PTRDIFF_MAX)+1);
-
-	assert_ptr_null(mallocx(SIZE_T_MAX, 0),
-	    "Expected OOM for mallocx(size=%#zx, 0)", SIZE_T_MAX);
-
-	assert_ptr_null(mallocx(1, MALLOCX_ALIGN(ZU(PTRDIFF_MAX)+1)),
-	    "Expected OOM for mallocx(size=1, MALLOCX_ALIGN(%#zx))",
-	    ZU(PTRDIFF_MAX)+1);
-}
-TEST_END
-
-TEST_BEGIN(test_oom) {
-	size_t largemax;
-	bool oom;
-	void *ptrs[3];
-	unsigned i;
-
-	/*
-	 * It should be impossible to allocate three objects that each consume
-	 * nearly half the virtual address space.
-	 */
-	largemax = get_large_size(get_nlarge()-1);
-	oom = false;
-	for (i = 0; i < sizeof(ptrs) / sizeof(void *); i++) {
-		ptrs[i] = mallocx(largemax, 0);
-		if (ptrs[i] == NULL) {
-			oom = true;
-		}
-	}
-	assert_true(oom,
-	    "Expected OOM during series of calls to mallocx(size=%zu, 0)",
-	    largemax);
-	for (i = 0; i < sizeof(ptrs) / sizeof(void *); i++) {
-		if (ptrs[i] != NULL) {
-			dallocx(ptrs[i], 0);
-		}
-	}
-	purge();
-
-#if LG_SIZEOF_PTR == 3
-	assert_ptr_null(mallocx(0x8000000000000000ULL,
-	    MALLOCX_ALIGN(0x8000000000000000ULL)),
-	    "Expected OOM for mallocx()");
-	assert_ptr_null(mallocx(0x8000000000000000ULL,
-	    MALLOCX_ALIGN(0x80000000)),
-	    "Expected OOM for mallocx()");
-#else
-	assert_ptr_null(mallocx(0x80000000UL, MALLOCX_ALIGN(0x80000000UL)),
-	    "Expected OOM for mallocx()");
-#endif
-}
-TEST_END
-
-TEST_BEGIN(test_basic) {
-#define MAXSZ (((size_t)1) << 23)
-	size_t sz;
-
-	for (sz = 1; sz < MAXSZ; sz = nallocx(sz, 0) + 1) {
-		size_t nsz, rsz;
-		void *p;
-		nsz = nallocx(sz, 0);
-		assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
-		p = mallocx(sz, 0);
-		assert_ptr_not_null(p,
-		    "Unexpected mallocx(size=%zx, flags=0) error", sz);
-		rsz = sallocx(p, 0);
-		assert_zu_ge(rsz, sz, "Real size smaller than expected");
-		assert_zu_eq(nsz, rsz, "nallocx()/sallocx() size mismatch");
-		dallocx(p, 0);
-
-		p = mallocx(sz, 0);
-		assert_ptr_not_null(p,
-		    "Unexpected mallocx(size=%zx, flags=0) error", sz);
-		dallocx(p, 0);
-
-		nsz = nallocx(sz, MALLOCX_ZERO);
-		assert_zu_ne(nsz, 0, "Unexpected nallocx() error");
-		p = mallocx(sz, MALLOCX_ZERO);
-		assert_ptr_not_null(p,
-		    "Unexpected mallocx(size=%zx, flags=MALLOCX_ZERO) error",
-		    nsz);
-		rsz = sallocx(p, 0);
-		assert_zu_eq(nsz, rsz, "nallocx()/sallocx() rsize mismatch");
-		dallocx(p, 0);
-		purge();
-	}
-#undef MAXSZ
-}
-TEST_END
-
-TEST_BEGIN(test_alignment_and_size) {
-	const char *percpu_arena;
-	size_t sz = sizeof(percpu_arena);
-
-	if(mallctl("opt.percpu_arena", (void *)&percpu_arena, &sz, NULL, 0) ||
-	    strcmp(percpu_arena, "disabled") != 0) {
-		test_skip("test_alignment_and_size skipped: "
-		    "not working with percpu arena.");
-	};
-#define MAXALIGN (((size_t)1) << 23)
-#define NITER 4
-	size_t nsz, rsz, alignment, total;
-	unsigned i;
-	void *ps[NITER];
-
-	for (i = 0; i < NITER; i++) {
-		ps[i] = NULL;
-	}
-
-	for (alignment = 8;
-	    alignment <= MAXALIGN;
-	    alignment <<= 1) {
-		total = 0;
-		for (sz = 1;
-		    sz < 3 * alignment && sz < (1U << 31);
-		    sz += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
-			for (i = 0; i < NITER; i++) {
-				nsz = nallocx(sz, MALLOCX_ALIGN(alignment) |
-				    MALLOCX_ZERO);
-				assert_zu_ne(nsz, 0,
-				    "nallocx() error for alignment=%zu, "
-				    "size=%zu (%#zx)", alignment, sz, sz);
-				ps[i] = mallocx(sz, MALLOCX_ALIGN(alignment) |
-				    MALLOCX_ZERO);
-				assert_ptr_not_null(ps[i],
-				    "mallocx() error for alignment=%zu, "
-				    "size=%zu (%#zx)", alignment, sz, sz);
-				rsz = sallocx(ps[i], 0);
-				assert_zu_ge(rsz, sz,
-				    "Real size smaller than expected for "
-				    "alignment=%zu, size=%zu", alignment, sz);
-				assert_zu_eq(nsz, rsz,
-				    "nallocx()/sallocx() size mismatch for "
-				    "alignment=%zu, size=%zu", alignment, sz);
-				assert_ptr_null(
-				    (void *)((uintptr_t)ps[i] & (alignment-1)),
-				    "%p inadequately aligned for"
-				    " alignment=%zu, size=%zu", ps[i],
-				    alignment, sz);
-				total += rsz;
-				if (total >= (MAXALIGN << 1)) {
-					break;
-				}
-			}
-			for (i = 0; i < NITER; i++) {
-				if (ps[i] != NULL) {
-					dallocx(ps[i], 0);
-					ps[i] = NULL;
-				}
-			}
-		}
-		purge();
-	}
-#undef MAXALIGN
-#undef NITER
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_overflow,
-	    test_oom,
-	    test_basic,
-	    test_alignment_and_size);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/mallocx.sh b/redis-stable/deps/jemalloc/test/integration/mallocx.sh
deleted file mode 100644
index 0cc21873..00000000
--- a/redis-stable/deps/jemalloc/test/integration/mallocx.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="junk:false"
-fi
diff --git a/redis-stable/deps/jemalloc/test/integration/overflow.c b/redis-stable/deps/jemalloc/test/integration/overflow.c
deleted file mode 100644
index 6a9785b2..00000000
--- a/redis-stable/deps/jemalloc/test/integration/overflow.c
+++ /dev/null
@@ -1,46 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_overflow) {
-	unsigned nlextents;
-	size_t mib[4];
-	size_t sz, miblen, max_size_class;
-	void *p;
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
-	    0), 0, "Unexpected mallctl() error");
-
-	miblen = sizeof(mib) / sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() error");
-	mib[2] = nlextents - 1;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&max_size_class, &sz,
-	    NULL, 0), 0, "Unexpected mallctlbymib() error");
-
-	assert_ptr_null(malloc(max_size_class + 1),
-	    "Expected OOM due to over-sized allocation request");
-	assert_ptr_null(malloc(SIZE_T_MAX),
-	    "Expected OOM due to over-sized allocation request");
-
-	assert_ptr_null(calloc(1, max_size_class + 1),
-	    "Expected OOM due to over-sized allocation request");
-	assert_ptr_null(calloc(1, SIZE_T_MAX),
-	    "Expected OOM due to over-sized allocation request");
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Unexpected malloc() OOM");
-	assert_ptr_null(realloc(p, max_size_class + 1),
-	    "Expected OOM due to over-sized allocation request");
-	assert_ptr_null(realloc(p, SIZE_T_MAX),
-	    "Expected OOM due to over-sized allocation request");
-	free(p);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_overflow);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/posix_memalign.c b/redis-stable/deps/jemalloc/test/integration/posix_memalign.c
deleted file mode 100644
index 2c2726de..00000000
--- a/redis-stable/deps/jemalloc/test/integration/posix_memalign.c
+++ /dev/null
@@ -1,127 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define MAXALIGN (((size_t)1) << 23)
-
-/*
- * On systems which can't merge extents, tests that call this function generate
- * a lot of dirty memory very quickly.  Purging between cycles mitigates
- * potential OOM on e.g. 32-bit Windows.
- */
-static void
-purge(void) {
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl error");
-}
-
-TEST_BEGIN(test_alignment_errors) {
-	size_t alignment;
-	void *p;
-
-	for (alignment = 0; alignment < sizeof(void *); alignment++) {
-		assert_d_eq(posix_memalign(&p, alignment, 1), EINVAL,
-		    "Expected error for invalid alignment %zu",
-		    alignment);
-	}
-
-	for (alignment = sizeof(size_t); alignment < MAXALIGN;
-	    alignment <<= 1) {
-		assert_d_ne(posix_memalign(&p, alignment + 1, 1), 0,
-		    "Expected error for invalid alignment %zu",
-		    alignment + 1);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_oom_errors) {
-	size_t alignment, size;
-	void *p;
-
-#if LG_SIZEOF_PTR == 3
-	alignment = UINT64_C(0x8000000000000000);
-	size      = UINT64_C(0x8000000000000000);
-#else
-	alignment = 0x80000000LU;
-	size      = 0x80000000LU;
-#endif
-	assert_d_ne(posix_memalign(&p, alignment, size), 0,
-	    "Expected error for posix_memalign(&p, %zu, %zu)",
-	    alignment, size);
-
-#if LG_SIZEOF_PTR == 3
-	alignment = UINT64_C(0x4000000000000000);
-	size      = UINT64_C(0xc000000000000001);
-#else
-	alignment = 0x40000000LU;
-	size      = 0xc0000001LU;
-#endif
-	assert_d_ne(posix_memalign(&p, alignment, size), 0,
-	    "Expected error for posix_memalign(&p, %zu, %zu)",
-	    alignment, size);
-
-	alignment = 0x10LU;
-#if LG_SIZEOF_PTR == 3
-	size = UINT64_C(0xfffffffffffffff0);
-#else
-	size = 0xfffffff0LU;
-#endif
-	assert_d_ne(posix_memalign(&p, alignment, size), 0,
-	    "Expected error for posix_memalign(&p, %zu, %zu)",
-	    alignment, size);
-}
-TEST_END
-
-TEST_BEGIN(test_alignment_and_size) {
-#define NITER 4
-	size_t alignment, size, total;
-	unsigned i;
-	int err;
-	void *ps[NITER];
-
-	for (i = 0; i < NITER; i++) {
-		ps[i] = NULL;
-	}
-
-	for (alignment = 8;
-	    alignment <= MAXALIGN;
-	    alignment <<= 1) {
-		total = 0;
-		for (size = 1;
-		    size < 3 * alignment && size < (1U << 31);
-		    size += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
-			for (i = 0; i < NITER; i++) {
-				err = posix_memalign(&ps[i],
-				    alignment, size);
-				if (err) {
-					char buf[BUFERROR_BUF];
-
-					buferror(get_errno(), buf, sizeof(buf));
-					test_fail(
-					    "Error for alignment=%zu, "
-					    "size=%zu (%#zx): %s",
-					    alignment, size, size, buf);
-				}
-				total += malloc_usable_size(ps[i]);
-				if (total >= (MAXALIGN << 1)) {
-					break;
-				}
-			}
-			for (i = 0; i < NITER; i++) {
-				if (ps[i] != NULL) {
-					free(ps[i]);
-					ps[i] = NULL;
-				}
-			}
-		}
-		purge();
-	}
-#undef NITER
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_alignment_errors,
-	    test_oom_errors,
-	    test_alignment_and_size);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/rallocx.c b/redis-stable/deps/jemalloc/test/integration/rallocx.c
deleted file mode 100644
index 7821ca5f..00000000
--- a/redis-stable/deps/jemalloc/test/integration/rallocx.c
+++ /dev/null
@@ -1,245 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static unsigned
-get_nsizes_impl(const char *cmd) {
-	unsigned ret;
-	size_t z;
-
-	z = sizeof(unsigned);
-	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
-	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
-
-	return ret;
-}
-
-static unsigned
-get_nlarge(void) {
-	return get_nsizes_impl("arenas.nlextents");
-}
-
-static size_t
-get_size_impl(const char *cmd, size_t ind) {
-	size_t ret;
-	size_t z;
-	size_t mib[4];
-	size_t miblen = 4;
-
-	z = sizeof(size_t);
-	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
-	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
-	mib[2] = ind;
-	z = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
-	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
-
-	return ret;
-}
-
-static size_t
-get_large_size(size_t ind) {
-	return get_size_impl("arenas.lextent.0.size", ind);
-}
-
-TEST_BEGIN(test_grow_and_shrink) {
-	void *p, *q;
-	size_t tsz;
-#define NCYCLES 3
-	unsigned i, j;
-#define NSZS 1024
-	size_t szs[NSZS];
-#define MAXSZ ZU(12 * 1024 * 1024)
-
-	p = mallocx(1, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	szs[0] = sallocx(p, 0);
-
-	for (i = 0; i < NCYCLES; i++) {
-		for (j = 1; j < NSZS && szs[j-1] < MAXSZ; j++) {
-			q = rallocx(p, szs[j-1]+1, 0);
-			assert_ptr_not_null(q,
-			    "Unexpected rallocx() error for size=%zu-->%zu",
-			    szs[j-1], szs[j-1]+1);
-			szs[j] = sallocx(q, 0);
-			assert_zu_ne(szs[j], szs[j-1]+1,
-			    "Expected size to be at least: %zu", szs[j-1]+1);
-			p = q;
-		}
-
-		for (j--; j > 0; j--) {
-			q = rallocx(p, szs[j-1], 0);
-			assert_ptr_not_null(q,
-			    "Unexpected rallocx() error for size=%zu-->%zu",
-			    szs[j], szs[j-1]);
-			tsz = sallocx(q, 0);
-			assert_zu_eq(tsz, szs[j-1],
-			    "Expected size=%zu, got size=%zu", szs[j-1], tsz);
-			p = q;
-		}
-	}
-
-	dallocx(p, 0);
-#undef MAXSZ
-#undef NSZS
-#undef NCYCLES
-}
-TEST_END
-
-static bool
-validate_fill(const void *p, uint8_t c, size_t offset, size_t len) {
-	bool ret = false;
-	const uint8_t *buf = (const uint8_t *)p;
-	size_t i;
-
-	for (i = 0; i < len; i++) {
-		uint8_t b = buf[offset+i];
-		if (b != c) {
-			test_fail("Allocation at %p (len=%zu) contains %#x "
-			    "rather than %#x at offset %zu", p, len, b, c,
-			    offset+i);
-			ret = true;
-		}
-	}
-
-	return ret;
-}
-
-TEST_BEGIN(test_zero) {
-	void *p, *q;
-	size_t psz, qsz, i, j;
-	size_t start_sizes[] = {1, 3*1024, 63*1024, 4095*1024};
-#define FILL_BYTE 0xaaU
-#define RANGE 2048
-
-	for (i = 0; i < sizeof(start_sizes)/sizeof(size_t); i++) {
-		size_t start_size = start_sizes[i];
-		p = mallocx(start_size, MALLOCX_ZERO);
-		assert_ptr_not_null(p, "Unexpected mallocx() error");
-		psz = sallocx(p, 0);
-
-		assert_false(validate_fill(p, 0, 0, psz),
-		    "Expected zeroed memory");
-		memset(p, FILL_BYTE, psz);
-		assert_false(validate_fill(p, FILL_BYTE, 0, psz),
-		    "Expected filled memory");
-
-		for (j = 1; j < RANGE; j++) {
-			q = rallocx(p, start_size+j, MALLOCX_ZERO);
-			assert_ptr_not_null(q, "Unexpected rallocx() error");
-			qsz = sallocx(q, 0);
-			if (q != p || qsz != psz) {
-				assert_false(validate_fill(q, FILL_BYTE, 0,
-				    psz), "Expected filled memory");
-				assert_false(validate_fill(q, 0, psz, qsz-psz),
-				    "Expected zeroed memory");
-			}
-			if (psz != qsz) {
-				memset((void *)((uintptr_t)q+psz), FILL_BYTE,
-				    qsz-psz);
-				psz = qsz;
-			}
-			p = q;
-		}
-		assert_false(validate_fill(p, FILL_BYTE, 0, psz),
-		    "Expected filled memory");
-		dallocx(p, 0);
-	}
-#undef FILL_BYTE
-}
-TEST_END
-
-TEST_BEGIN(test_align) {
-	void *p, *q;
-	size_t align;
-#define MAX_ALIGN (ZU(1) << 25)
-
-	align = ZU(1);
-	p = mallocx(1, MALLOCX_ALIGN(align));
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	for (align <<= 1; align <= MAX_ALIGN; align <<= 1) {
-		q = rallocx(p, 1, MALLOCX_ALIGN(align));
-		assert_ptr_not_null(q,
-		    "Unexpected rallocx() error for align=%zu", align);
-		assert_ptr_null(
-		    (void *)((uintptr_t)q & (align-1)),
-		    "%p inadequately aligned for align=%zu",
-		    q, align);
-		p = q;
-	}
-	dallocx(p, 0);
-#undef MAX_ALIGN
-}
-TEST_END
-
-TEST_BEGIN(test_lg_align_and_zero) {
-	void *p, *q;
-	unsigned lg_align;
-	size_t sz;
-#define MAX_LG_ALIGN 25
-#define MAX_VALIDATE (ZU(1) << 22)
-
-	lg_align = 0;
-	p = mallocx(1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	for (lg_align++; lg_align <= MAX_LG_ALIGN; lg_align++) {
-		q = rallocx(p, 1, MALLOCX_LG_ALIGN(lg_align)|MALLOCX_ZERO);
-		assert_ptr_not_null(q,
-		    "Unexpected rallocx() error for lg_align=%u", lg_align);
-		assert_ptr_null(
-		    (void *)((uintptr_t)q & ((ZU(1) << lg_align)-1)),
-		    "%p inadequately aligned for lg_align=%u", q, lg_align);
-		sz = sallocx(q, 0);
-		if ((sz << 1) <= MAX_VALIDATE) {
-			assert_false(validate_fill(q, 0, 0, sz),
-			    "Expected zeroed memory");
-		} else {
-			assert_false(validate_fill(q, 0, 0, MAX_VALIDATE),
-			    "Expected zeroed memory");
-			assert_false(validate_fill(
-			    (void *)((uintptr_t)q+sz-MAX_VALIDATE),
-			    0, 0, MAX_VALIDATE), "Expected zeroed memory");
-		}
-		p = q;
-	}
-	dallocx(p, 0);
-#undef MAX_VALIDATE
-#undef MAX_LG_ALIGN
-}
-TEST_END
-
-TEST_BEGIN(test_overflow) {
-	size_t largemax;
-	void *p;
-
-	largemax = get_large_size(get_nlarge()-1);
-
-	p = mallocx(1, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-	assert_ptr_null(rallocx(p, largemax+1, 0),
-	    "Expected OOM for rallocx(p, size=%#zx, 0)", largemax+1);
-
-	assert_ptr_null(rallocx(p, ZU(PTRDIFF_MAX)+1, 0),
-	    "Expected OOM for rallocx(p, size=%#zx, 0)", ZU(PTRDIFF_MAX)+1);
-
-	assert_ptr_null(rallocx(p, SIZE_T_MAX, 0),
-	    "Expected OOM for rallocx(p, size=%#zx, 0)", SIZE_T_MAX);
-
-	assert_ptr_null(rallocx(p, 1, MALLOCX_ALIGN(ZU(PTRDIFF_MAX)+1)),
-	    "Expected OOM for rallocx(p, size=1, MALLOCX_ALIGN(%#zx))",
-	    ZU(PTRDIFF_MAX)+1);
-
-	dallocx(p, 0);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_grow_and_shrink,
-	    test_zero,
-	    test_align,
-	    test_lg_align_and_zero,
-	    test_overflow);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/sdallocx.c b/redis-stable/deps/jemalloc/test/integration/sdallocx.c
deleted file mode 100644
index ca014485..00000000
--- a/redis-stable/deps/jemalloc/test/integration/sdallocx.c
+++ /dev/null
@@ -1,55 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define MAXALIGN (((size_t)1) << 22)
-#define NITER 3
-
-TEST_BEGIN(test_basic) {
-	void *ptr = mallocx(64, 0);
-	sdallocx(ptr, 64, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_alignment_and_size) {
-	size_t nsz, sz, alignment, total;
-	unsigned i;
-	void *ps[NITER];
-
-	for (i = 0; i < NITER; i++) {
-		ps[i] = NULL;
-	}
-
-	for (alignment = 8;
-	    alignment <= MAXALIGN;
-	    alignment <<= 1) {
-		total = 0;
-		for (sz = 1;
-		    sz < 3 * alignment && sz < (1U << 31);
-		    sz += (alignment >> (LG_SIZEOF_PTR-1)) - 1) {
-			for (i = 0; i < NITER; i++) {
-				nsz = nallocx(sz, MALLOCX_ALIGN(alignment) |
-				    MALLOCX_ZERO);
-				ps[i] = mallocx(sz, MALLOCX_ALIGN(alignment) |
-				    MALLOCX_ZERO);
-				total += nsz;
-				if (total >= (MAXALIGN << 1)) {
-					break;
-				}
-			}
-			for (i = 0; i < NITER; i++) {
-				if (ps[i] != NULL) {
-					sdallocx(ps[i], sz,
-					    MALLOCX_ALIGN(alignment));
-					ps[i] = NULL;
-				}
-			}
-		}
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_basic,
-	    test_alignment_and_size);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/thread_arena.c b/redis-stable/deps/jemalloc/test/integration/thread_arena.c
deleted file mode 100644
index 1e5ec05d..00000000
--- a/redis-stable/deps/jemalloc/test/integration/thread_arena.c
+++ /dev/null
@@ -1,86 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NTHREADS 10
-
-void *
-thd_start(void *arg) {
-	unsigned main_arena_ind = *(unsigned *)arg;
-	void *p;
-	unsigned arena_ind;
-	size_t size;
-	int err;
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Error in malloc()");
-	free(p);
-
-	size = sizeof(arena_ind);
-	if ((err = mallctl("thread.arena", (void *)&arena_ind, &size,
-	    (void *)&main_arena_ind, sizeof(main_arena_ind)))) {
-		char buf[BUFERROR_BUF];
-
-		buferror(err, buf, sizeof(buf));
-		test_fail("Error in mallctl(): %s", buf);
-	}
-
-	size = sizeof(arena_ind);
-	if ((err = mallctl("thread.arena", (void *)&arena_ind, &size, NULL,
-	    0))) {
-		char buf[BUFERROR_BUF];
-
-		buferror(err, buf, sizeof(buf));
-		test_fail("Error in mallctl(): %s", buf);
-	}
-	assert_u_eq(arena_ind, main_arena_ind,
-	    "Arena index should be same as for main thread");
-
-	return NULL;
-}
-
-static void
-mallctl_failure(int err) {
-	char buf[BUFERROR_BUF];
-
-	buferror(err, buf, sizeof(buf));
-	test_fail("Error in mallctl(): %s", buf);
-}
-
-TEST_BEGIN(test_thread_arena) {
-	void *p;
-	int err;
-	thd_t thds[NTHREADS];
-	unsigned i;
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Error in malloc()");
-
-	unsigned arena_ind, old_arena_ind;
-	size_t sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Arena creation failure");
-
-	size_t size = sizeof(arena_ind);
-	if ((err = mallctl("thread.arena", (void *)&old_arena_ind, &size,
-	    (void *)&arena_ind, sizeof(arena_ind))) != 0) {
-		mallctl_failure(err);
-	}
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_create(&thds[i], thd_start,
-		    (void *)&arena_ind);
-	}
-
-	for (i = 0; i < NTHREADS; i++) {
-		intptr_t join_ret;
-		thd_join(thds[i], (void *)&join_ret);
-		assert_zd_eq(join_ret, 0, "Unexpected thread join error");
-	}
-	free(p);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_thread_arena);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c b/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
deleted file mode 100644
index 95c9acc1..00000000
--- a/redis-stable/deps/jemalloc/test/integration/thread_tcache_enabled.c
+++ /dev/null
@@ -1,87 +0,0 @@
-#include "test/jemalloc_test.h"
-
-void *
-thd_start(void *arg) {
-	bool e0, e1;
-	size_t sz = sizeof(bool);
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz, NULL,
-	    0), 0, "Unexpected mallctl failure");
-
-	if (e0) {
-		e1 = false;
-		assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-		    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-		assert_true(e0, "tcache should be enabled");
-	}
-
-	e1 = true;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_false(e0, "tcache should be disabled");
-
-	e1 = true;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_true(e0, "tcache should be enabled");
-
-	e1 = false;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_true(e0, "tcache should be enabled");
-
-	e1 = false;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_false(e0, "tcache should be disabled");
-
-	free(malloc(1));
-	e1 = true;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_false(e0, "tcache should be disabled");
-
-	free(malloc(1));
-	e1 = true;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_true(e0, "tcache should be enabled");
-
-	free(malloc(1));
-	e1 = false;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_true(e0, "tcache should be enabled");
-
-	free(malloc(1));
-	e1 = false;
-	assert_d_eq(mallctl("thread.tcache.enabled", (void *)&e0, &sz,
-	    (void *)&e1, sz), 0, "Unexpected mallctl() error");
-	assert_false(e0, "tcache should be disabled");
-
-	free(malloc(1));
-	return NULL;
-}
-
-TEST_BEGIN(test_main_thread) {
-	thd_start(NULL);
-}
-TEST_END
-
-TEST_BEGIN(test_subthread) {
-	thd_t thd;
-
-	thd_create(&thd, thd_start, NULL);
-	thd_join(thd, NULL);
-}
-TEST_END
-
-int
-main(void) {
-	/* Run tests multiple times to check for bad interactions. */
-	return test(
-	    test_main_thread,
-	    test_subthread,
-	    test_main_thread,
-	    test_subthread,
-	    test_main_thread);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/xallocx.c b/redis-stable/deps/jemalloc/test/integration/xallocx.c
deleted file mode 100644
index cd0ca048..00000000
--- a/redis-stable/deps/jemalloc/test/integration/xallocx.c
+++ /dev/null
@@ -1,384 +0,0 @@
-#include "test/jemalloc_test.h"
-
-/*
- * Use a separate arena for xallocx() extension/contraction tests so that
- * internal allocation e.g. by heap profiling can't interpose allocations where
- * xallocx() would ordinarily be able to extend.
- */
-static unsigned
-arena_ind(void) {
-	static unsigned ind = 0;
-
-	if (ind == 0) {
-		size_t sz = sizeof(ind);
-		assert_d_eq(mallctl("arenas.create", (void *)&ind, &sz, NULL,
-		    0), 0, "Unexpected mallctl failure creating arena");
-	}
-
-	return ind;
-}
-
-TEST_BEGIN(test_same_size) {
-	void *p;
-	size_t sz, tsz;
-
-	p = mallocx(42, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	sz = sallocx(p, 0);
-
-	tsz = xallocx(p, sz, 0, 0);
-	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_extra_no_move) {
-	void *p;
-	size_t sz, tsz;
-
-	p = mallocx(42, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	sz = sallocx(p, 0);
-
-	tsz = xallocx(p, sz, sz-42, 0);
-	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_no_move_fail) {
-	void *p;
-	size_t sz, tsz;
-
-	p = mallocx(42, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	sz = sallocx(p, 0);
-
-	tsz = xallocx(p, sz + 5, 0, 0);
-	assert_zu_eq(tsz, sz, "Unexpected size change: %zu --> %zu", sz, tsz);
-
-	dallocx(p, 0);
-}
-TEST_END
-
-static unsigned
-get_nsizes_impl(const char *cmd) {
-	unsigned ret;
-	size_t z;
-
-	z = sizeof(unsigned);
-	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
-	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
-
-	return ret;
-}
-
-static unsigned
-get_nsmall(void) {
-	return get_nsizes_impl("arenas.nbins");
-}
-
-static unsigned
-get_nlarge(void) {
-	return get_nsizes_impl("arenas.nlextents");
-}
-
-static size_t
-get_size_impl(const char *cmd, size_t ind) {
-	size_t ret;
-	size_t z;
-	size_t mib[4];
-	size_t miblen = 4;
-
-	z = sizeof(size_t);
-	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
-	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
-	mib[2] = ind;
-	z = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
-	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
-
-	return ret;
-}
-
-static size_t
-get_small_size(size_t ind) {
-	return get_size_impl("arenas.bin.0.size", ind);
-}
-
-static size_t
-get_large_size(size_t ind) {
-	return get_size_impl("arenas.lextent.0.size", ind);
-}
-
-TEST_BEGIN(test_size) {
-	size_t small0, largemax;
-	void *p;
-
-	/* Get size classes. */
-	small0 = get_small_size(0);
-	largemax = get_large_size(get_nlarge()-1);
-
-	p = mallocx(small0, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	/* Test smallest supported size. */
-	assert_zu_eq(xallocx(p, 1, 0, 0), small0,
-	    "Unexpected xallocx() behavior");
-
-	/* Test largest supported size. */
-	assert_zu_le(xallocx(p, largemax, 0, 0), largemax,
-	    "Unexpected xallocx() behavior");
-
-	/* Test size overflow. */
-	assert_zu_le(xallocx(p, largemax+1, 0, 0), largemax,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, SIZE_T_MAX, 0, 0), largemax,
-	    "Unexpected xallocx() behavior");
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_size_extra_overflow) {
-	size_t small0, largemax;
-	void *p;
-
-	/* Get size classes. */
-	small0 = get_small_size(0);
-	largemax = get_large_size(get_nlarge()-1);
-
-	p = mallocx(small0, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	/* Test overflows that can be resolved by clamping extra. */
-	assert_zu_le(xallocx(p, largemax-1, 2, 0), largemax,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, largemax, 1, 0), largemax,
-	    "Unexpected xallocx() behavior");
-
-	/* Test overflow such that largemax-size underflows. */
-	assert_zu_le(xallocx(p, largemax+1, 2, 0), largemax,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, largemax+2, 3, 0), largemax,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, SIZE_T_MAX-2, 2, 0), largemax,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, SIZE_T_MAX-1, 1, 0), largemax,
-	    "Unexpected xallocx() behavior");
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_extra_small) {
-	size_t small0, small1, largemax;
-	void *p;
-
-	/* Get size classes. */
-	small0 = get_small_size(0);
-	small1 = get_small_size(1);
-	largemax = get_large_size(get_nlarge()-1);
-
-	p = mallocx(small0, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	assert_zu_eq(xallocx(p, small1, 0, 0), small0,
-	    "Unexpected xallocx() behavior");
-
-	assert_zu_eq(xallocx(p, small1, 0, 0), small0,
-	    "Unexpected xallocx() behavior");
-
-	assert_zu_eq(xallocx(p, small0, small1 - small0, 0), small0,
-	    "Unexpected xallocx() behavior");
-
-	/* Test size+extra overflow. */
-	assert_zu_eq(xallocx(p, small0, largemax - small0 + 1, 0), small0,
-	    "Unexpected xallocx() behavior");
-	assert_zu_eq(xallocx(p, small0, SIZE_T_MAX - small0, 0), small0,
-	    "Unexpected xallocx() behavior");
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_extra_large) {
-	int flags = MALLOCX_ARENA(arena_ind());
-	size_t smallmax, large1, large2, large3, largemax;
-	void *p;
-
-	/* Get size classes. */
-	smallmax = get_small_size(get_nsmall()-1);
-	large1 = get_large_size(1);
-	large2 = get_large_size(2);
-	large3 = get_large_size(3);
-	largemax = get_large_size(get_nlarge()-1);
-
-	p = mallocx(large3, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-
-	assert_zu_eq(xallocx(p, large3, 0, flags), large3,
-	    "Unexpected xallocx() behavior");
-	/* Test size decrease with zero extra. */
-	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
-	    "Unexpected xallocx() behavior");
-	assert_zu_ge(xallocx(p, smallmax, 0, flags), large1,
-	    "Unexpected xallocx() behavior");
-
-	if (xallocx(p, large3, 0, flags) != large3) {
-		p = rallocx(p, large3, flags);
-		assert_ptr_not_null(p, "Unexpected rallocx() failure");
-	}
-	/* Test size decrease with non-zero extra. */
-	assert_zu_eq(xallocx(p, large1, large3 - large1, flags), large3,
-	    "Unexpected xallocx() behavior");
-	assert_zu_eq(xallocx(p, large2, large3 - large2, flags), large3,
-	    "Unexpected xallocx() behavior");
-	assert_zu_ge(xallocx(p, large1, large2 - large1, flags), large2,
-	    "Unexpected xallocx() behavior");
-	assert_zu_ge(xallocx(p, smallmax, large1 - smallmax, flags), large1,
-	    "Unexpected xallocx() behavior");
-
-	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
-	    "Unexpected xallocx() behavior");
-	/* Test size increase with zero extra. */
-	assert_zu_le(xallocx(p, large3, 0, flags), large3,
-	    "Unexpected xallocx() behavior");
-	assert_zu_le(xallocx(p, largemax+1, 0, flags), large3,
-	    "Unexpected xallocx() behavior");
-
-	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
-	    "Unexpected xallocx() behavior");
-	/* Test size increase with non-zero extra. */
-	assert_zu_le(xallocx(p, large1, SIZE_T_MAX - large1, flags), largemax,
-	    "Unexpected xallocx() behavior");
-
-	assert_zu_ge(xallocx(p, large1, 0, flags), large1,
-	    "Unexpected xallocx() behavior");
-	/* Test size increase with non-zero extra. */
-	assert_zu_le(xallocx(p, large1, large3 - large1, flags), large3,
-	    "Unexpected xallocx() behavior");
-
-	if (xallocx(p, large3, 0, flags) != large3) {
-		p = rallocx(p, large3, flags);
-		assert_ptr_not_null(p, "Unexpected rallocx() failure");
-	}
-	/* Test size+extra overflow. */
-	assert_zu_le(xallocx(p, large3, largemax - large3 + 1, flags), largemax,
-	    "Unexpected xallocx() behavior");
-
-	dallocx(p, flags);
-}
-TEST_END
-
-static void
-print_filled_extents(const void *p, uint8_t c, size_t len) {
-	const uint8_t *pc = (const uint8_t *)p;
-	size_t i, range0;
-	uint8_t c0;
-
-	malloc_printf("  p=%p, c=%#x, len=%zu:", p, c, len);
-	range0 = 0;
-	c0 = pc[0];
-	for (i = 0; i < len; i++) {
-		if (pc[i] != c0) {
-			malloc_printf(" %#x[%zu..%zu)", c0, range0, i);
-			range0 = i;
-			c0 = pc[i];
-		}
-	}
-	malloc_printf(" %#x[%zu..%zu)\n", c0, range0, i);
-}
-
-static bool
-validate_fill(const void *p, uint8_t c, size_t offset, size_t len) {
-	const uint8_t *pc = (const uint8_t *)p;
-	bool err;
-	size_t i;
-
-	for (i = offset, err = false; i < offset+len; i++) {
-		if (pc[i] != c) {
-			err = true;
-		}
-	}
-
-	if (err) {
-		print_filled_extents(p, c, offset + len);
-	}
-
-	return err;
-}
-
-static void
-test_zero(size_t szmin, size_t szmax) {
-	int flags = MALLOCX_ARENA(arena_ind()) | MALLOCX_ZERO;
-	size_t sz, nsz;
-	void *p;
-#define FILL_BYTE 0x7aU
-
-	sz = szmax;
-	p = mallocx(sz, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() error");
-	assert_false(validate_fill(p, 0x00, 0, sz), "Memory not filled: sz=%zu",
-	    sz);
-
-	/*
-	 * Fill with non-zero so that non-debug builds are more likely to detect
-	 * errors.
-	 */
-	memset(p, FILL_BYTE, sz);
-	assert_false(validate_fill(p, FILL_BYTE, 0, sz),
-	    "Memory not filled: sz=%zu", sz);
-
-	/* Shrink in place so that we can expect growing in place to succeed. */
-	sz = szmin;
-	if (xallocx(p, sz, 0, flags) != sz) {
-		p = rallocx(p, sz, flags);
-		assert_ptr_not_null(p, "Unexpected rallocx() failure");
-	}
-	assert_false(validate_fill(p, FILL_BYTE, 0, sz),
-	    "Memory not filled: sz=%zu", sz);
-
-	for (sz = szmin; sz < szmax; sz = nsz) {
-		nsz = nallocx(sz+1, flags);
-		if (xallocx(p, sz+1, 0, flags) != nsz) {
-			p = rallocx(p, sz+1, flags);
-			assert_ptr_not_null(p, "Unexpected rallocx() failure");
-		}
-		assert_false(validate_fill(p, FILL_BYTE, 0, sz),
-		    "Memory not filled: sz=%zu", sz);
-		assert_false(validate_fill(p, 0x00, sz, nsz-sz),
-		    "Memory not filled: sz=%zu, nsz-sz=%zu", sz, nsz-sz);
-		memset((void *)((uintptr_t)p + sz), FILL_BYTE, nsz-sz);
-		assert_false(validate_fill(p, FILL_BYTE, 0, nsz),
-		    "Memory not filled: nsz=%zu", nsz);
-	}
-
-	dallocx(p, flags);
-}
-
-TEST_BEGIN(test_zero_large) {
-	size_t large0, large1;
-
-	/* Get size classes. */
-	large0 = get_large_size(0);
-	large1 = get_large_size(1);
-
-	test_zero(large1, large0 * 2);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_same_size,
-	    test_extra_no_move,
-	    test_no_move_fail,
-	    test_size,
-	    test_size_extra_overflow,
-	    test_extra_small,
-	    test_extra_large,
-	    test_zero_large);
-}
diff --git a/redis-stable/deps/jemalloc/test/integration/xallocx.sh b/redis-stable/deps/jemalloc/test/integration/xallocx.sh
deleted file mode 100644
index 0cc21873..00000000
--- a/redis-stable/deps/jemalloc/test/integration/xallocx.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="junk:false"
-fi
diff --git a/redis-stable/deps/jemalloc/test/src/SFMT.c b/redis-stable/deps/jemalloc/test/src/SFMT.c
deleted file mode 100644
index c05e2183..00000000
--- a/redis-stable/deps/jemalloc/test/src/SFMT.c
+++ /dev/null
@@ -1,719 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/**
- * @file  SFMT.c
- * @brief SIMD oriented Fast Mersenne Twister(SFMT)
- *
- * @author Mutsuo Saito (Hiroshima University)
- * @author Makoto Matsumoto (Hiroshima University)
- *
- * Copyright (C) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- * University. All rights reserved.
- *
- * The new BSD License is applied to this software, see LICENSE.txt
- */
-#define SFMT_C_
-#include "test/jemalloc_test.h"
-#include "test/SFMT-params.h"
-
-#if defined(JEMALLOC_BIG_ENDIAN) && !defined(BIG_ENDIAN64)
-#define BIG_ENDIAN64 1
-#endif
-#if defined(__BIG_ENDIAN__) && !defined(__amd64) && !defined(BIG_ENDIAN64)
-#define BIG_ENDIAN64 1
-#endif
-#if defined(HAVE_ALTIVEC) && !defined(BIG_ENDIAN64)
-#define BIG_ENDIAN64 1
-#endif
-#if defined(ONLY64) && !defined(BIG_ENDIAN64)
-  #if defined(__GNUC__)
-    #error "-DONLY64 must be specified with -DBIG_ENDIAN64"
-  #endif
-#undef ONLY64
-#endif
-/*------------------------------------------------------
-  128-bit SIMD data type for Altivec, SSE2 or standard C
-  ------------------------------------------------------*/
-#if defined(HAVE_ALTIVEC)
-/** 128-bit data structure */
-union W128_T {
-    vector unsigned int s;
-    uint32_t u[4];
-};
-/** 128-bit data type */
-typedef union W128_T w128_t;
-
-#elif defined(HAVE_SSE2)
-/** 128-bit data structure */
-union W128_T {
-    __m128i si;
-    uint32_t u[4];
-};
-/** 128-bit data type */
-typedef union W128_T w128_t;
-
-#else
-
-/** 128-bit data structure */
-struct W128_T {
-    uint32_t u[4];
-};
-/** 128-bit data type */
-typedef struct W128_T w128_t;
-
-#endif
-
-struct sfmt_s {
-    /** the 128-bit internal state array */
-    w128_t sfmt[N];
-    /** index counter to the 32-bit internal state array */
-    int idx;
-    /** a flag: it is 0 if and only if the internal state is not yet
-     * initialized. */
-    int initialized;
-};
-
-/*--------------------------------------
-  FILE GLOBAL VARIABLES
-  internal state, index counter and flag
-  --------------------------------------*/
-
-/** a parity check vector which certificate the period of 2^{MEXP} */
-static uint32_t parity[4] = {PARITY1, PARITY2, PARITY3, PARITY4};
-
-/*----------------
-  STATIC FUNCTIONS
-  ----------------*/
-static inline int idxof(int i);
-#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
-static inline void rshift128(w128_t *out,  w128_t const *in, int shift);
-static inline void lshift128(w128_t *out,  w128_t const *in, int shift);
-#endif
-static inline void gen_rand_all(sfmt_t *ctx);
-static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size);
-static inline uint32_t func1(uint32_t x);
-static inline uint32_t func2(uint32_t x);
-static void period_certification(sfmt_t *ctx);
-#if defined(BIG_ENDIAN64) && !defined(ONLY64)
-static inline void swap(w128_t *array, int size);
-#endif
-
-#if defined(HAVE_ALTIVEC)
-  #include "test/SFMT-alti.h"
-#elif defined(HAVE_SSE2)
-  #include "test/SFMT-sse2.h"
-#endif
-
-/**
- * This function simulate a 64-bit index of LITTLE ENDIAN
- * in BIG ENDIAN machine.
- */
-#ifdef ONLY64
-static inline int idxof(int i) {
-    return i ^ 1;
-}
-#else
-static inline int idxof(int i) {
-    return i;
-}
-#endif
-/**
- * This function simulates SIMD 128-bit right shift by the standard C.
- * The 128-bit integer given in in is shifted by (shift * 8) bits.
- * This function simulates the LITTLE ENDIAN SIMD.
- * @param out the output of this function
- * @param in the 128-bit data to be shifted
- * @param shift the shift value
- */
-#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
-#ifdef ONLY64
-static inline void rshift128(w128_t *out, w128_t const *in, int shift) {
-    uint64_t th, tl, oh, ol;
-
-    th = ((uint64_t)in->u[2] << 32) | ((uint64_t)in->u[3]);
-    tl = ((uint64_t)in->u[0] << 32) | ((uint64_t)in->u[1]);
-
-    oh = th >> (shift * 8);
-    ol = tl >> (shift * 8);
-    ol |= th << (64 - shift * 8);
-    out->u[0] = (uint32_t)(ol >> 32);
-    out->u[1] = (uint32_t)ol;
-    out->u[2] = (uint32_t)(oh >> 32);
-    out->u[3] = (uint32_t)oh;
-}
-#else
-static inline void rshift128(w128_t *out, w128_t const *in, int shift) {
-    uint64_t th, tl, oh, ol;
-
-    th = ((uint64_t)in->u[3] << 32) | ((uint64_t)in->u[2]);
-    tl = ((uint64_t)in->u[1] << 32) | ((uint64_t)in->u[0]);
-
-    oh = th >> (shift * 8);
-    ol = tl >> (shift * 8);
-    ol |= th << (64 - shift * 8);
-    out->u[1] = (uint32_t)(ol >> 32);
-    out->u[0] = (uint32_t)ol;
-    out->u[3] = (uint32_t)(oh >> 32);
-    out->u[2] = (uint32_t)oh;
-}
-#endif
-/**
- * This function simulates SIMD 128-bit left shift by the standard C.
- * The 128-bit integer given in in is shifted by (shift * 8) bits.
- * This function simulates the LITTLE ENDIAN SIMD.
- * @param out the output of this function
- * @param in the 128-bit data to be shifted
- * @param shift the shift value
- */
-#ifdef ONLY64
-static inline void lshift128(w128_t *out, w128_t const *in, int shift) {
-    uint64_t th, tl, oh, ol;
-
-    th = ((uint64_t)in->u[2] << 32) | ((uint64_t)in->u[3]);
-    tl = ((uint64_t)in->u[0] << 32) | ((uint64_t)in->u[1]);
-
-    oh = th << (shift * 8);
-    ol = tl << (shift * 8);
-    oh |= tl >> (64 - shift * 8);
-    out->u[0] = (uint32_t)(ol >> 32);
-    out->u[1] = (uint32_t)ol;
-    out->u[2] = (uint32_t)(oh >> 32);
-    out->u[3] = (uint32_t)oh;
-}
-#else
-static inline void lshift128(w128_t *out, w128_t const *in, int shift) {
-    uint64_t th, tl, oh, ol;
-
-    th = ((uint64_t)in->u[3] << 32) | ((uint64_t)in->u[2]);
-    tl = ((uint64_t)in->u[1] << 32) | ((uint64_t)in->u[0]);
-
-    oh = th << (shift * 8);
-    ol = tl << (shift * 8);
-    oh |= tl >> (64 - shift * 8);
-    out->u[1] = (uint32_t)(ol >> 32);
-    out->u[0] = (uint32_t)ol;
-    out->u[3] = (uint32_t)(oh >> 32);
-    out->u[2] = (uint32_t)oh;
-}
-#endif
-#endif
-
-/**
- * This function represents the recursion formula.
- * @param r output
- * @param a a 128-bit part of the internal state array
- * @param b a 128-bit part of the internal state array
- * @param c a 128-bit part of the internal state array
- * @param d a 128-bit part of the internal state array
- */
-#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
-#ifdef ONLY64
-static inline void do_recursion(w128_t *r, w128_t *a, w128_t *b, w128_t *c,
-				w128_t *d) {
-    w128_t x;
-    w128_t y;
-
-    lshift128(&x, a, SL2);
-    rshift128(&y, c, SR2);
-    r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK2) ^ y.u[0]
-	^ (d->u[0] << SL1);
-    r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK1) ^ y.u[1]
-	^ (d->u[1] << SL1);
-    r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK4) ^ y.u[2]
-	^ (d->u[2] << SL1);
-    r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK3) ^ y.u[3]
-	^ (d->u[3] << SL1);
-}
-#else
-static inline void do_recursion(w128_t *r, w128_t *a, w128_t *b, w128_t *c,
-				w128_t *d) {
-    w128_t x;
-    w128_t y;
-
-    lshift128(&x, a, SL2);
-    rshift128(&y, c, SR2);
-    r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK1) ^ y.u[0]
-	^ (d->u[0] << SL1);
-    r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK2) ^ y.u[1]
-	^ (d->u[1] << SL1);
-    r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK3) ^ y.u[2]
-	^ (d->u[2] << SL1);
-    r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK4) ^ y.u[3]
-	^ (d->u[3] << SL1);
-}
-#endif
-#endif
-
-#if (!defined(HAVE_ALTIVEC)) && (!defined(HAVE_SSE2))
-/**
- * This function fills the internal state array with pseudorandom
- * integers.
- */
-static inline void gen_rand_all(sfmt_t *ctx) {
-    int i;
-    w128_t *r1, *r2;
-
-    r1 = &ctx->sfmt[N - 2];
-    r2 = &ctx->sfmt[N - 1];
-    for (i = 0; i < N - POS1; i++) {
-	do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1,
-	  r2);
-	r1 = r2;
-	r2 = &ctx->sfmt[i];
-    }
-    for (; i < N; i++) {
-	do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1 - N], r1,
-	  r2);
-	r1 = r2;
-	r2 = &ctx->sfmt[i];
-    }
-}
-
-/**
- * This function fills the user-specified array with pseudorandom
- * integers.
- *
- * @param array an 128-bit array to be filled by pseudorandom numbers.
- * @param size number of 128-bit pseudorandom numbers to be generated.
- */
-static inline void gen_rand_array(sfmt_t *ctx, w128_t *array, int size) {
-    int i, j;
-    w128_t *r1, *r2;
-
-    r1 = &ctx->sfmt[N - 2];
-    r2 = &ctx->sfmt[N - 1];
-    for (i = 0; i < N - POS1; i++) {
-	do_recursion(&array[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1, r2);
-	r1 = r2;
-	r2 = &array[i];
-    }
-    for (; i < N; i++) {
-	do_recursion(&array[i], &ctx->sfmt[i], &array[i + POS1 - N], r1, r2);
-	r1 = r2;
-	r2 = &array[i];
-    }
-    for (; i < size - N; i++) {
-	do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2);
-	r1 = r2;
-	r2 = &array[i];
-    }
-    for (j = 0; j < 2 * N - size; j++) {
-	ctx->sfmt[j] = array[j + size - N];
-    }
-    for (; i < size; i++, j++) {
-	do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2);
-	r1 = r2;
-	r2 = &array[i];
-	ctx->sfmt[j] = array[i];
-    }
-}
-#endif
-
-#if defined(BIG_ENDIAN64) && !defined(ONLY64) && !defined(HAVE_ALTIVEC)
-static inline void swap(w128_t *array, int size) {
-    int i;
-    uint32_t x, y;
-
-    for (i = 0; i < size; i++) {
-	x = array[i].u[0];
-	y = array[i].u[2];
-	array[i].u[0] = array[i].u[1];
-	array[i].u[2] = array[i].u[3];
-	array[i].u[1] = x;
-	array[i].u[3] = y;
-    }
-}
-#endif
-/**
- * This function represents a function used in the initialization
- * by init_by_array
- * @param x 32-bit integer
- * @return 32-bit integer
- */
-static uint32_t func1(uint32_t x) {
-    return (x ^ (x >> 27)) * (uint32_t)1664525UL;
-}
-
-/**
- * This function represents a function used in the initialization
- * by init_by_array
- * @param x 32-bit integer
- * @return 32-bit integer
- */
-static uint32_t func2(uint32_t x) {
-    return (x ^ (x >> 27)) * (uint32_t)1566083941UL;
-}
-
-/**
- * This function certificate the period of 2^{MEXP}
- */
-static void period_certification(sfmt_t *ctx) {
-    int inner = 0;
-    int i, j;
-    uint32_t work;
-    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
-
-    for (i = 0; i < 4; i++)
-	inner ^= psfmt32[idxof(i)] & parity[i];
-    for (i = 16; i > 0; i >>= 1)
-	inner ^= inner >> i;
-    inner &= 1;
-    /* check OK */
-    if (inner == 1) {
-	return;
-    }
-    /* check NG, and modification */
-    for (i = 0; i < 4; i++) {
-	work = 1;
-	for (j = 0; j < 32; j++) {
-	    if ((work & parity[i]) != 0) {
-		psfmt32[idxof(i)] ^= work;
-		return;
-	    }
-	    work = work << 1;
-	}
-    }
-}
-
-/*----------------
-  PUBLIC FUNCTIONS
-  ----------------*/
-/**
- * This function returns the identification string.
- * The string shows the word size, the Mersenne exponent,
- * and all parameters of this generator.
- */
-const char *get_idstring(void) {
-    return IDSTR;
-}
-
-/**
- * This function returns the minimum size of array used for \b
- * fill_array32() function.
- * @return minimum size of array used for fill_array32() function.
- */
-int get_min_array_size32(void) {
-    return N32;
-}
-
-/**
- * This function returns the minimum size of array used for \b
- * fill_array64() function.
- * @return minimum size of array used for fill_array64() function.
- */
-int get_min_array_size64(void) {
-    return N64;
-}
-
-#ifndef ONLY64
-/**
- * This function generates and returns 32-bit pseudorandom number.
- * init_gen_rand or init_by_array must be called before this function.
- * @return 32-bit pseudorandom number
- */
-uint32_t gen_rand32(sfmt_t *ctx) {
-    uint32_t r;
-    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
-
-    assert(ctx->initialized);
-    if (ctx->idx >= N32) {
-	gen_rand_all(ctx);
-	ctx->idx = 0;
-    }
-    r = psfmt32[ctx->idx++];
-    return r;
-}
-
-/* Generate a random integer in [0..limit). */
-uint32_t gen_rand32_range(sfmt_t *ctx, uint32_t limit) {
-    uint32_t ret, above;
-
-    above = 0xffffffffU - (0xffffffffU % limit);
-    while (1) {
-	ret = gen_rand32(ctx);
-	if (ret < above) {
-	    ret %= limit;
-	    break;
-	}
-    }
-    return ret;
-}
-#endif
-/**
- * This function generates and returns 64-bit pseudorandom number.
- * init_gen_rand or init_by_array must be called before this function.
- * The function gen_rand64 should not be called after gen_rand32,
- * unless an initialization is again executed.
- * @return 64-bit pseudorandom number
- */
-uint64_t gen_rand64(sfmt_t *ctx) {
-#if defined(BIG_ENDIAN64) && !defined(ONLY64)
-    uint32_t r1, r2;
-    uint32_t *psfmt32 = &ctx->sfmt[0].u[0];
-#else
-    uint64_t r;
-    uint64_t *psfmt64 = (uint64_t *)&ctx->sfmt[0].u[0];
-#endif
-
-    assert(ctx->initialized);
-    assert(ctx->idx % 2 == 0);
-
-    if (ctx->idx >= N32) {
-	gen_rand_all(ctx);
-	ctx->idx = 0;
-    }
-#if defined(BIG_ENDIAN64) && !defined(ONLY64)
-    r1 = psfmt32[ctx->idx];
-    r2 = psfmt32[ctx->idx + 1];
-    ctx->idx += 2;
-    return ((uint64_t)r2 << 32) | r1;
-#else
-    r = psfmt64[ctx->idx / 2];
-    ctx->idx += 2;
-    return r;
-#endif
-}
-
-/* Generate a random integer in [0..limit). */
-uint64_t gen_rand64_range(sfmt_t *ctx, uint64_t limit) {
-    uint64_t ret, above;
-
-    above = KQU(0xffffffffffffffff) - (KQU(0xffffffffffffffff) % limit);
-    while (1) {
-	ret = gen_rand64(ctx);
-	if (ret < above) {
-	    ret %= limit;
-	    break;
-	}
-    }
-    return ret;
-}
-
-#ifndef ONLY64
-/**
- * This function generates pseudorandom 32-bit integers in the
- * specified array[] by one call. The number of pseudorandom integers
- * is specified by the argument size, which must be at least 624 and a
- * multiple of four.  The generation by this function is much faster
- * than the following gen_rand function.
- *
- * For initialization, init_gen_rand or init_by_array must be called
- * before the first call of this function. This function can not be
- * used after calling gen_rand function, without initialization.
- *
- * @param array an array where pseudorandom 32-bit integers are filled
- * by this function.  The pointer to the array must be \b "aligned"
- * (namely, must be a multiple of 16) in the SIMD version, since it
- * refers to the address of a 128-bit integer.  In the standard C
- * version, the pointer is arbitrary.
- *
- * @param size the number of 32-bit pseudorandom integers to be
- * generated.  size must be a multiple of 4, and greater than or equal
- * to (MEXP / 128 + 1) * 4.
- *
- * @note \b memalign or \b posix_memalign is available to get aligned
- * memory. Mac OSX doesn't have these functions, but \b malloc of OSX
- * returns the pointer to the aligned memory block.
- */
-void fill_array32(sfmt_t *ctx, uint32_t *array, int size) {
-    assert(ctx->initialized);
-    assert(ctx->idx == N32);
-    assert(size % 4 == 0);
-    assert(size >= N32);
-
-    gen_rand_array(ctx, (w128_t *)array, size / 4);
-    ctx->idx = N32;
-}
-#endif
-
-/**
- * This function generates pseudorandom 64-bit integers in the
- * specified array[] by one call. The number of pseudorandom integers
- * is specified by the argument size, which must be at least 312 and a
- * multiple of two.  The generation by this function is much faster
- * than the following gen_rand function.
- *
- * For initialization, init_gen_rand or init_by_array must be called
- * before the first call of this function. This function can not be
- * used after calling gen_rand function, without initialization.
- *
- * @param array an array where pseudorandom 64-bit integers are filled
- * by this function.  The pointer to the array must be "aligned"
- * (namely, must be a multiple of 16) in the SIMD version, since it
- * refers to the address of a 128-bit integer.  In the standard C
- * version, the pointer is arbitrary.
- *
- * @param size the number of 64-bit pseudorandom integers to be
- * generated.  size must be a multiple of 2, and greater than or equal
- * to (MEXP / 128 + 1) * 2
- *
- * @note \b memalign or \b posix_memalign is available to get aligned
- * memory. Mac OSX doesn't have these functions, but \b malloc of OSX
- * returns the pointer to the aligned memory block.
- */
-void fill_array64(sfmt_t *ctx, uint64_t *array, int size) {
-    assert(ctx->initialized);
-    assert(ctx->idx == N32);
-    assert(size % 2 == 0);
-    assert(size >= N64);
-
-    gen_rand_array(ctx, (w128_t *)array, size / 2);
-    ctx->idx = N32;
-
-#if defined(BIG_ENDIAN64) && !defined(ONLY64)
-    swap((w128_t *)array, size /2);
-#endif
-}
-
-/**
- * This function initializes the internal state array with a 32-bit
- * integer seed.
- *
- * @param seed a 32-bit integer used as the seed.
- */
-sfmt_t *init_gen_rand(uint32_t seed) {
-    void *p;
-    sfmt_t *ctx;
-    int i;
-    uint32_t *psfmt32;
-
-    if (posix_memalign(&p, sizeof(w128_t), sizeof(sfmt_t)) != 0) {
-	return NULL;
-    }
-    ctx = (sfmt_t *)p;
-    psfmt32 = &ctx->sfmt[0].u[0];
-
-    psfmt32[idxof(0)] = seed;
-    for (i = 1; i < N32; i++) {
-	psfmt32[idxof(i)] = 1812433253UL * (psfmt32[idxof(i - 1)]
-					    ^ (psfmt32[idxof(i - 1)] >> 30))
-	    + i;
-    }
-    ctx->idx = N32;
-    period_certification(ctx);
-    ctx->initialized = 1;
-
-    return ctx;
-}
-
-/**
- * This function initializes the internal state array,
- * with an array of 32-bit integers used as the seeds
- * @param init_key the array of 32-bit integers, used as a seed.
- * @param key_length the length of init_key.
- */
-sfmt_t *init_by_array(uint32_t *init_key, int key_length) {
-    void *p;
-    sfmt_t *ctx;
-    int i, j, count;
-    uint32_t r;
-    int lag;
-    int mid;
-    int size = N * 4;
-    uint32_t *psfmt32;
-
-    if (posix_memalign(&p, sizeof(w128_t), sizeof(sfmt_t)) != 0) {
-	return NULL;
-    }
-    ctx = (sfmt_t *)p;
-    psfmt32 = &ctx->sfmt[0].u[0];
-
-    if (size >= 623) {
-	lag = 11;
-    } else if (size >= 68) {
-	lag = 7;
-    } else if (size >= 39) {
-	lag = 5;
-    } else {
-	lag = 3;
-    }
-    mid = (size - lag) / 2;
-
-    memset(ctx->sfmt, 0x8b, sizeof(ctx->sfmt));
-    if (key_length + 1 > N32) {
-	count = key_length + 1;
-    } else {
-	count = N32;
-    }
-    r = func1(psfmt32[idxof(0)] ^ psfmt32[idxof(mid)]
-	      ^ psfmt32[idxof(N32 - 1)]);
-    psfmt32[idxof(mid)] += r;
-    r += key_length;
-    psfmt32[idxof(mid + lag)] += r;
-    psfmt32[idxof(0)] = r;
-
-    count--;
-    for (i = 1, j = 0; (j < count) && (j < key_length); j++) {
-	r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
-		  ^ psfmt32[idxof((i + N32 - 1) % N32)]);
-	psfmt32[idxof((i + mid) % N32)] += r;
-	r += init_key[j] + i;
-	psfmt32[idxof((i + mid + lag) % N32)] += r;
-	psfmt32[idxof(i)] = r;
-	i = (i + 1) % N32;
-    }
-    for (; j < count; j++) {
-	r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
-		  ^ psfmt32[idxof((i + N32 - 1) % N32)]);
-	psfmt32[idxof((i + mid) % N32)] += r;
-	r += i;
-	psfmt32[idxof((i + mid + lag) % N32)] += r;
-	psfmt32[idxof(i)] = r;
-	i = (i + 1) % N32;
-    }
-    for (j = 0; j < N32; j++) {
-	r = func2(psfmt32[idxof(i)] + psfmt32[idxof((i + mid) % N32)]
-		  + psfmt32[idxof((i + N32 - 1) % N32)]);
-	psfmt32[idxof((i + mid) % N32)] ^= r;
-	r -= i;
-	psfmt32[idxof((i + mid + lag) % N32)] ^= r;
-	psfmt32[idxof(i)] = r;
-	i = (i + 1) % N32;
-    }
-
-    ctx->idx = N32;
-    period_certification(ctx);
-    ctx->initialized = 1;
-
-    return ctx;
-}
-
-void fini_gen_rand(sfmt_t *ctx) {
-    assert(ctx != NULL);
-
-    ctx->initialized = 0;
-    free(ctx);
-}
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc.c b/redis-stable/deps/jemalloc/test/src/btalloc.c
deleted file mode 100644
index d570952c..00000000
--- a/redis-stable/deps/jemalloc/test/src/btalloc.c
+++ /dev/null
@@ -1,6 +0,0 @@
-#include "test/jemalloc_test.h"
-
-void *
-btalloc(size_t size, unsigned bits) {
-	return btalloc_0(size, bits);
-}
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc_0.c b/redis-stable/deps/jemalloc/test/src/btalloc_0.c
deleted file mode 100644
index 77d8904e..00000000
--- a/redis-stable/deps/jemalloc/test/src/btalloc_0.c
+++ /dev/null
@@ -1,3 +0,0 @@
-#include "test/jemalloc_test.h"
-
-btalloc_n_gen(0)
diff --git a/redis-stable/deps/jemalloc/test/src/btalloc_1.c b/redis-stable/deps/jemalloc/test/src/btalloc_1.c
deleted file mode 100644
index 4c126c30..00000000
--- a/redis-stable/deps/jemalloc/test/src/btalloc_1.c
+++ /dev/null
@@ -1,3 +0,0 @@
-#include "test/jemalloc_test.h"
-
-btalloc_n_gen(1)
diff --git a/redis-stable/deps/jemalloc/test/src/math.c b/redis-stable/deps/jemalloc/test/src/math.c
deleted file mode 100644
index 1758c677..00000000
--- a/redis-stable/deps/jemalloc/test/src/math.c
+++ /dev/null
@@ -1,2 +0,0 @@
-#define MATH_C_
-#include "test/jemalloc_test.h"
diff --git a/redis-stable/deps/jemalloc/test/src/mq.c b/redis-stable/deps/jemalloc/test/src/mq.c
deleted file mode 100644
index 9b5f672d..00000000
--- a/redis-stable/deps/jemalloc/test/src/mq.c
+++ /dev/null
@@ -1,27 +0,0 @@
-#include "test/jemalloc_test.h"
-
-/*
- * Sleep for approximately ns nanoseconds.  No lower *nor* upper bound on sleep
- * time is guaranteed.
- */
-void
-mq_nanosleep(unsigned ns) {
-	assert(ns <= 1000*1000*1000);
-
-#ifdef _WIN32
-	Sleep(ns / 1000);
-#else
-	{
-		struct timespec timeout;
-
-		if (ns < 1000*1000*1000) {
-			timeout.tv_sec = 0;
-			timeout.tv_nsec = ns;
-		} else {
-			timeout.tv_sec = 1;
-			timeout.tv_nsec = 0;
-		}
-		nanosleep(&timeout, NULL);
-	}
-#endif
-}
diff --git a/redis-stable/deps/jemalloc/test/src/mtx.c b/redis-stable/deps/jemalloc/test/src/mtx.c
deleted file mode 100644
index a393c01f..00000000
--- a/redis-stable/deps/jemalloc/test/src/mtx.c
+++ /dev/null
@@ -1,68 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#ifndef _CRT_SPINCOUNT
-#define _CRT_SPINCOUNT 4000
-#endif
-
-bool
-mtx_init(mtx_t *mtx) {
-#ifdef _WIN32
-	if (!InitializeCriticalSectionAndSpinCount(&mtx->lock,
-	    _CRT_SPINCOUNT)) {
-		return true;
-	}
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-	mtx->lock = OS_UNFAIR_LOCK_INIT;
-#elif (defined(JEMALLOC_OSSPIN))
-	mtx->lock = 0;
-#else
-	pthread_mutexattr_t attr;
-
-	if (pthread_mutexattr_init(&attr) != 0) {
-		return true;
-	}
-	pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_DEFAULT);
-	if (pthread_mutex_init(&mtx->lock, &attr) != 0) {
-		pthread_mutexattr_destroy(&attr);
-		return true;
-	}
-	pthread_mutexattr_destroy(&attr);
-#endif
-	return false;
-}
-
-void
-mtx_fini(mtx_t *mtx) {
-#ifdef _WIN32
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-#elif (defined(JEMALLOC_OSSPIN))
-#else
-	pthread_mutex_destroy(&mtx->lock);
-#endif
-}
-
-void
-mtx_lock(mtx_t *mtx) {
-#ifdef _WIN32
-	EnterCriticalSection(&mtx->lock);
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-	os_unfair_lock_lock(&mtx->lock);
-#elif (defined(JEMALLOC_OSSPIN))
-	OSSpinLockLock(&mtx->lock);
-#else
-	pthread_mutex_lock(&mtx->lock);
-#endif
-}
-
-void
-mtx_unlock(mtx_t *mtx) {
-#ifdef _WIN32
-	LeaveCriticalSection(&mtx->lock);
-#elif (defined(JEMALLOC_OS_UNFAIR_LOCK))
-	os_unfair_lock_unlock(&mtx->lock);
-#elif (defined(JEMALLOC_OSSPIN))
-	OSSpinLockUnlock(&mtx->lock);
-#else
-	pthread_mutex_unlock(&mtx->lock);
-#endif
-}
diff --git a/redis-stable/deps/jemalloc/test/src/test.c b/redis-stable/deps/jemalloc/test/src/test.c
deleted file mode 100644
index 01a4d738..00000000
--- a/redis-stable/deps/jemalloc/test/src/test.c
+++ /dev/null
@@ -1,217 +0,0 @@
-#include "test/jemalloc_test.h"
-
-/* Test status state. */
-
-static unsigned		test_count = 0;
-static test_status_t	test_counts[test_status_count] = {0, 0, 0};
-static test_status_t	test_status = test_status_pass;
-static const char *	test_name = "";
-
-/* Reentrancy testing helpers. */
-
-#define NUM_REENTRANT_ALLOCS 20
-typedef enum {
-	non_reentrant = 0,
-	libc_reentrant = 1,
-	arena_new_reentrant = 2
-} reentrancy_t;
-static reentrancy_t reentrancy;
-
-static bool libc_hook_ran = false;
-static bool arena_new_hook_ran = false;
-
-static const char *
-reentrancy_t_str(reentrancy_t r) {
-	switch (r) {
-	case non_reentrant:
-		return "non-reentrant";
-	case libc_reentrant:
-		return "libc-reentrant";
-	case arena_new_reentrant:
-		return "arena_new-reentrant";
-	default:
-		unreachable();
-	}
-}
-
-static void
-do_hook(bool *hook_ran, void (**hook)()) {
-	*hook_ran = true;
-	*hook = NULL;
-
-	size_t alloc_size = 1;
-	for (int i = 0; i < NUM_REENTRANT_ALLOCS; i++) {
-		free(malloc(alloc_size));
-		alloc_size *= 2;
-	}
-}
-
-static void
-libc_reentrancy_hook() {
-	do_hook(&libc_hook_ran, &hooks_libc_hook);
-}
-
-static void
-arena_new_reentrancy_hook() {
-	do_hook(&arena_new_hook_ran, &hooks_arena_new_hook);
-}
-
-/* Actual test infrastructure. */
-bool
-test_is_reentrant() {
-	return reentrancy != non_reentrant;
-}
-
-JEMALLOC_FORMAT_PRINTF(1, 2)
-void
-test_skip(const char *format, ...) {
-	va_list ap;
-
-	va_start(ap, format);
-	malloc_vcprintf(NULL, NULL, format, ap);
-	va_end(ap);
-	malloc_printf("\n");
-	test_status = test_status_skip;
-}
-
-JEMALLOC_FORMAT_PRINTF(1, 2)
-void
-test_fail(const char *format, ...) {
-	va_list ap;
-
-	va_start(ap, format);
-	malloc_vcprintf(NULL, NULL, format, ap);
-	va_end(ap);
-	malloc_printf("\n");
-	test_status = test_status_fail;
-}
-
-static const char *
-test_status_string(test_status_t test_status) {
-	switch (test_status) {
-	case test_status_pass: return "pass";
-	case test_status_skip: return "skip";
-	case test_status_fail: return "fail";
-	default: not_reached();
-	}
-}
-
-void
-p_test_init(const char *name) {
-	test_count++;
-	test_status = test_status_pass;
-	test_name = name;
-}
-
-void
-p_test_fini(void) {
-	test_counts[test_status]++;
-	malloc_printf("%s (%s): %s\n", test_name, reentrancy_t_str(reentrancy),
-	    test_status_string(test_status));
-}
-
-static test_status_t
-p_test_impl(bool do_malloc_init, bool do_reentrant, test_t *t, va_list ap) {
-	test_status_t ret;
-
-	if (do_malloc_init) {
-		/*
-		 * Make sure initialization occurs prior to running tests.
-		 * Tests are special because they may use internal facilities
-		 * prior to triggering initialization as a side effect of
-		 * calling into the public API.
-		 */
-		if (nallocx(1, 0) == 0) {
-			malloc_printf("Initialization error");
-			return test_status_fail;
-		}
-	}
-
-	ret = test_status_pass;
-	for (; t != NULL; t = va_arg(ap, test_t *)) {
-		/* Non-reentrant run. */
-		reentrancy = non_reentrant;
-		hooks_arena_new_hook = hooks_libc_hook = NULL;
-		t();
-		if (test_status > ret) {
-			ret = test_status;
-		}
-		/* Reentrant run. */
-		if (do_reentrant) {
-			reentrancy = libc_reentrant;
-			hooks_arena_new_hook = NULL;
-			hooks_libc_hook = &libc_reentrancy_hook;
-			t();
-			if (test_status > ret) {
-				ret = test_status;
-			}
-
-			reentrancy = arena_new_reentrant;
-			hooks_libc_hook = NULL;
-			hooks_arena_new_hook = &arena_new_reentrancy_hook;
-			t();
-			if (test_status > ret) {
-				ret = test_status;
-			}
-		}
-	}
-
-	malloc_printf("--- %s: %u/%u, %s: %u/%u, %s: %u/%u ---\n",
-	    test_status_string(test_status_pass),
-	    test_counts[test_status_pass], test_count,
-	    test_status_string(test_status_skip),
-	    test_counts[test_status_skip], test_count,
-	    test_status_string(test_status_fail),
-	    test_counts[test_status_fail], test_count);
-
-	return ret;
-}
-
-test_status_t
-p_test(test_t *t, ...) {
-	test_status_t ret;
-	va_list ap;
-
-	ret = test_status_pass;
-	va_start(ap, t);
-	ret = p_test_impl(true, true, t, ap);
-	va_end(ap);
-
-	return ret;
-}
-
-test_status_t
-p_test_no_reentrancy(test_t *t, ...) {
-	test_status_t ret;
-	va_list ap;
-
-	ret = test_status_pass;
-	va_start(ap, t);
-	ret = p_test_impl(true, false, t, ap);
-	va_end(ap);
-
-	return ret;
-}
-
-test_status_t
-p_test_no_malloc_init(test_t *t, ...) {
-	test_status_t ret;
-	va_list ap;
-
-	ret = test_status_pass;
-	va_start(ap, t);
-	/*
-	 * We also omit reentrancy from bootstrapping tests, since we don't
-	 * (yet) care about general reentrancy during bootstrapping.
-	 */
-	ret = p_test_impl(false, false, t, ap);
-	va_end(ap);
-
-	return ret;
-}
-
-void
-p_test_fail(const char *prefix, const char *message) {
-	malloc_cprintf(NULL, NULL, "%s%s\n", prefix, message);
-	test_status = test_status_fail;
-}
diff --git a/redis-stable/deps/jemalloc/test/src/thd.c b/redis-stable/deps/jemalloc/test/src/thd.c
deleted file mode 100644
index 9a15eabb..00000000
--- a/redis-stable/deps/jemalloc/test/src/thd.c
+++ /dev/null
@@ -1,34 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#ifdef _WIN32
-void
-thd_create(thd_t *thd, void *(*proc)(void *), void *arg) {
-	LPTHREAD_START_ROUTINE routine = (LPTHREAD_START_ROUTINE)proc;
-	*thd = CreateThread(NULL, 0, routine, arg, 0, NULL);
-	if (*thd == NULL) {
-		test_fail("Error in CreateThread()\n");
-	}
-}
-
-void
-thd_join(thd_t thd, void **ret) {
-	if (WaitForSingleObject(thd, INFINITE) == WAIT_OBJECT_0 && ret) {
-		DWORD exit_code;
-		GetExitCodeThread(thd, (LPDWORD) &exit_code);
-		*ret = (void *)(uintptr_t)exit_code;
-	}
-}
-
-#else
-void
-thd_create(thd_t *thd, void *(*proc)(void *), void *arg) {
-	if (pthread_create(thd, NULL, proc, arg) != 0) {
-		test_fail("Error in pthread_create()\n");
-	}
-}
-
-void
-thd_join(thd_t thd, void **ret) {
-	pthread_join(thd, ret);
-}
-#endif
diff --git a/redis-stable/deps/jemalloc/test/src/timer.c b/redis-stable/deps/jemalloc/test/src/timer.c
deleted file mode 100644
index c451c639..00000000
--- a/redis-stable/deps/jemalloc/test/src/timer.c
+++ /dev/null
@@ -1,56 +0,0 @@
-#include "test/jemalloc_test.h"
-
-void
-timer_start(timedelta_t *timer) {
-	nstime_init(&timer->t0, 0);
-	nstime_update(&timer->t0);
-}
-
-void
-timer_stop(timedelta_t *timer) {
-	nstime_copy(&timer->t1, &timer->t0);
-	nstime_update(&timer->t1);
-}
-
-uint64_t
-timer_usec(const timedelta_t *timer) {
-	nstime_t delta;
-
-	nstime_copy(&delta, &timer->t1);
-	nstime_subtract(&delta, &timer->t0);
-	return nstime_ns(&delta) / 1000;
-}
-
-void
-timer_ratio(timedelta_t *a, timedelta_t *b, char *buf, size_t buflen) {
-	uint64_t t0 = timer_usec(a);
-	uint64_t t1 = timer_usec(b);
-	uint64_t mult;
-	size_t i = 0;
-	size_t j, n;
-
-	/* Whole. */
-	n = malloc_snprintf(&buf[i], buflen-i, "%"FMTu64, t0 / t1);
-	i += n;
-	if (i >= buflen) {
-		return;
-	}
-	mult = 1;
-	for (j = 0; j < n; j++) {
-		mult *= 10;
-	}
-
-	/* Decimal. */
-	n = malloc_snprintf(&buf[i], buflen-i, ".");
-	i += n;
-
-	/* Fraction. */
-	while (i < buflen-1) {
-		uint64_t round = (i+1 == buflen-1 && ((t0 * mult * 10 / t1) % 10
-		    >= 5)) ? 1 : 0;
-		n = malloc_snprintf(&buf[i], buflen-i,
-		    "%"FMTu64, (t0 * mult / t1) % 10 + round);
-		i += n;
-		mult *= 10;
-	}
-}
diff --git a/redis-stable/deps/jemalloc/test/stress/microbench.c b/redis-stable/deps/jemalloc/test/stress/microbench.c
deleted file mode 100644
index 988b7938..00000000
--- a/redis-stable/deps/jemalloc/test/stress/microbench.c
+++ /dev/null
@@ -1,165 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static inline void
-time_func(timedelta_t *timer, uint64_t nwarmup, uint64_t niter,
-    void (*func)(void)) {
-	uint64_t i;
-
-	for (i = 0; i < nwarmup; i++) {
-		func();
-	}
-	timer_start(timer);
-	for (i = 0; i < niter; i++) {
-		func();
-	}
-	timer_stop(timer);
-}
-
-void
-compare_funcs(uint64_t nwarmup, uint64_t niter, const char *name_a,
-    void (*func_a), const char *name_b, void (*func_b)) {
-	timedelta_t timer_a, timer_b;
-	char ratio_buf[6];
-	void *p;
-
-	p = mallocx(1, 0);
-	if (p == NULL) {
-		test_fail("Unexpected mallocx() failure");
-		return;
-	}
-
-	time_func(&timer_a, nwarmup, niter, func_a);
-	time_func(&timer_b, nwarmup, niter, func_b);
-
-	timer_ratio(&timer_a, &timer_b, ratio_buf, sizeof(ratio_buf));
-	malloc_printf("%"FMTu64" iterations, %s=%"FMTu64"us, "
-	    "%s=%"FMTu64"us, ratio=1:%s\n",
-	    niter, name_a, timer_usec(&timer_a), name_b, timer_usec(&timer_b),
-	    ratio_buf);
-
-	dallocx(p, 0);
-}
-
-static void
-malloc_free(void) {
-	/* The compiler can optimize away free(malloc(1))! */
-	void *p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	free(p);
-}
-
-static void
-mallocx_free(void) {
-	void *p = mallocx(1, 0);
-	if (p == NULL) {
-		test_fail("Unexpected mallocx() failure");
-		return;
-	}
-	free(p);
-}
-
-TEST_BEGIN(test_malloc_vs_mallocx) {
-	compare_funcs(10*1000*1000, 100*1000*1000, "malloc",
-	    malloc_free, "mallocx", mallocx_free);
-}
-TEST_END
-
-static void
-malloc_dallocx(void) {
-	void *p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	dallocx(p, 0);
-}
-
-static void
-malloc_sdallocx(void) {
-	void *p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	sdallocx(p, 1, 0);
-}
-
-TEST_BEGIN(test_free_vs_dallocx) {
-	compare_funcs(10*1000*1000, 100*1000*1000, "free", malloc_free,
-	    "dallocx", malloc_dallocx);
-}
-TEST_END
-
-TEST_BEGIN(test_dallocx_vs_sdallocx) {
-	compare_funcs(10*1000*1000, 100*1000*1000, "dallocx", malloc_dallocx,
-	    "sdallocx", malloc_sdallocx);
-}
-TEST_END
-
-static void
-malloc_mus_free(void) {
-	void *p;
-
-	p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	malloc_usable_size(p);
-	free(p);
-}
-
-static void
-malloc_sallocx_free(void) {
-	void *p;
-
-	p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	if (sallocx(p, 0) < 1) {
-		test_fail("Unexpected sallocx() failure");
-	}
-	free(p);
-}
-
-TEST_BEGIN(test_mus_vs_sallocx) {
-	compare_funcs(10*1000*1000, 100*1000*1000, "malloc_usable_size",
-	    malloc_mus_free, "sallocx", malloc_sallocx_free);
-}
-TEST_END
-
-static void
-malloc_nallocx_free(void) {
-	void *p;
-
-	p = malloc(1);
-	if (p == NULL) {
-		test_fail("Unexpected malloc() failure");
-		return;
-	}
-	if (nallocx(1, 0) < 1) {
-		test_fail("Unexpected nallocx() failure");
-	}
-	free(p);
-}
-
-TEST_BEGIN(test_sallocx_vs_nallocx) {
-	compare_funcs(10*1000*1000, 100*1000*1000, "sallocx",
-	    malloc_sallocx_free, "nallocx", malloc_nallocx_free);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_malloc_vs_mallocx,
-	    test_free_vs_dallocx,
-	    test_dallocx_vs_sdallocx,
-	    test_mus_vs_sallocx,
-	    test_sallocx_vs_nallocx);
-}
diff --git a/redis-stable/deps/jemalloc/test/test.sh.in b/redis-stable/deps/jemalloc/test/test.sh.in
deleted file mode 100644
index 39302fff..00000000
--- a/redis-stable/deps/jemalloc/test/test.sh.in
+++ /dev/null
@@ -1,80 +0,0 @@
-#!/bin/sh
-
-case @abi@ in
-  macho)
-    export DYLD_FALLBACK_LIBRARY_PATH="@objroot@lib"
-    ;;
-  pecoff)
-    export PATH="${PATH}:@objroot@lib"
-    ;;
-  *)
-    ;;
-esac
-
-# Make a copy of the @JEMALLOC_CPREFIX@MALLOC_CONF passed in to this script, so
-# it can be repeatedly concatenated with per test settings.
-export MALLOC_CONF_ALL=${@JEMALLOC_CPREFIX@MALLOC_CONF}
-# Concatenate the individual test's MALLOC_CONF and MALLOC_CONF_ALL.
-export_malloc_conf() {
-  if [ "x${MALLOC_CONF}" != "x" -a "x${MALLOC_CONF_ALL}" != "x" ] ; then
-    export @JEMALLOC_CPREFIX@MALLOC_CONF="${MALLOC_CONF},${MALLOC_CONF_ALL}"
-  else
-    export @JEMALLOC_CPREFIX@MALLOC_CONF="${MALLOC_CONF}${MALLOC_CONF_ALL}"
-  fi
-}
-
-# Corresponds to test_status_t.
-pass_code=0
-skip_code=1
-fail_code=2
-
-pass_count=0
-skip_count=0
-fail_count=0
-for t in $@; do
-  if [ $pass_count -ne 0 -o $skip_count -ne 0 -o $fail_count != 0 ] ; then
-    echo
-  fi
-  echo "=== ${t} ==="
-  if [ -e "@srcroot@${t}.sh" ] ; then
-    # Source the shell script corresponding to the test in a subshell and
-    # execute the test.  This allows the shell script to set MALLOC_CONF, which
-    # is then used to set @JEMALLOC_CPREFIX@MALLOC_CONF (thus allowing the
-    # per test shell script to ignore the @JEMALLOC_CPREFIX@ detail).
-    enable_fill=@enable_fill@ \
-    enable_prof=@enable_prof@ \
-    . @srcroot@${t}.sh && \
-    export_malloc_conf && \
-    $JEMALLOC_TEST_PREFIX ${t}@exe@ @abs_srcroot@ @abs_objroot@
-  else
-    export MALLOC_CONF= && \
-    export_malloc_conf && \
-    $JEMALLOC_TEST_PREFIX ${t}@exe@ @abs_srcroot@ @abs_objroot@
-  fi
-  result_code=$?
-  case ${result_code} in
-    ${pass_code})
-      pass_count=$((pass_count+1))
-      ;;
-    ${skip_code})
-      skip_count=$((skip_count+1))
-      ;;
-    ${fail_code})
-      fail_count=$((fail_count+1))
-      ;;
-    *)
-      echo "Test harness error: ${t} w/ MALLOC_CONF=\"${MALLOC_CONF}\"" 1>&2
-      echo "Use prefix to debug, e.g. JEMALLOC_TEST_PREFIX=\"gdb --args\" sh test/test.sh ${t}" 1>&2
-      exit 1
-  esac
-done
-
-total_count=`expr ${pass_count} + ${skip_count} + ${fail_count}`
-echo
-echo "Test suite summary: pass: ${pass_count}/${total_count}, skip: ${skip_count}/${total_count}, fail: ${fail_count}/${total_count}"
-
-if [ ${fail_count} -eq 0 ] ; then
-  exit 0
-else
-  exit 1
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/SFMT.c b/redis-stable/deps/jemalloc/test/unit/SFMT.c
deleted file mode 100644
index 1fc8cf1b..00000000
--- a/redis-stable/deps/jemalloc/test/unit/SFMT.c
+++ /dev/null
@@ -1,1599 +0,0 @@
-/*
- * This file derives from SFMT 1.3.3
- * (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html), which was
- * released under the terms of the following license:
- *
- *   Copyright (c) 2006,2007 Mutsuo Saito, Makoto Matsumoto and Hiroshima
- *   University. All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions are
- *   met:
- *
- *       * Redistributions of source code must retain the above copyright
- *         notice, this list of conditions and the following disclaimer.
- *       * Redistributions in binary form must reproduce the above
- *         copyright notice, this list of conditions and the following
- *         disclaimer in the documentation and/or other materials provided
- *         with the distribution.
- *       * Neither the name of the Hiroshima University nor the names of
- *         its contributors may be used to endorse or promote products
- *         derived from this software without specific prior written
- *         permission.
- *
- *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-#include "test/jemalloc_test.h"
-
-#define BLOCK_SIZE 10000
-#define BLOCK_SIZE64 (BLOCK_SIZE / 2)
-#define COUNT_1 1000
-#define COUNT_2 700
-
-static const uint32_t init_gen_rand_32_expected[] = {
-	3440181298U, 1564997079U, 1510669302U, 2930277156U, 1452439940U,
-	3796268453U,  423124208U, 2143818589U, 3827219408U, 2987036003U,
-	2674978610U, 1536842514U, 2027035537U, 2534897563U, 1686527725U,
-	 545368292U, 1489013321U, 1370534252U, 4231012796U, 3994803019U,
-	1764869045U,  824597505U,  862581900U, 2469764249U,  812862514U,
-	 359318673U,  116957936U, 3367389672U, 2327178354U, 1898245200U,
-	3206507879U, 2378925033U, 1040214787U, 2524778605U, 3088428700U,
-	1417665896U,  964324147U, 2282797708U, 2456269299U,  313400376U,
-	2245093271U, 1015729427U, 2694465011U, 3246975184U, 1992793635U,
-	 463679346U, 3721104591U, 3475064196U,  856141236U, 1499559719U,
-	3522818941U, 3721533109U, 1954826617U, 1282044024U, 1543279136U,
-	1301863085U, 2669145051U, 4221477354U, 3896016841U, 3392740262U,
-	 462466863U, 1037679449U, 1228140306U,  922298197U, 1205109853U,
-	1872938061U, 3102547608U, 2742766808U, 1888626088U, 4028039414U,
-	 157593879U, 1136901695U, 4038377686U, 3572517236U, 4231706728U,
-	2997311961U, 1189931652U, 3981543765U, 2826166703U,   87159245U,
-	1721379072U, 3897926942U, 1790395498U, 2569178939U, 1047368729U,
-	2340259131U, 3144212906U, 2301169789U, 2442885464U, 3034046771U,
-	3667880593U, 3935928400U, 2372805237U, 1666397115U, 2460584504U,
-	 513866770U, 3810869743U, 2147400037U, 2792078025U, 2941761810U,
-	3212265810U,  984692259U,  346590253U, 1804179199U, 3298543443U,
-	 750108141U, 2880257022U,  243310542U, 1869036465U, 1588062513U,
-	2983949551U, 1931450364U, 4034505847U, 2735030199U, 1628461061U,
-	2539522841U,  127965585U, 3992448871U,  913388237U,  559130076U,
-	1202933193U, 4087643167U, 2590021067U, 2256240196U, 1746697293U,
-	1013913783U, 1155864921U, 2715773730U,  915061862U, 1948766573U,
-	2322882854U, 3761119102U, 1343405684U, 3078711943U, 3067431651U,
-	3245156316U, 3588354584U, 3484623306U, 3899621563U, 4156689741U,
-	3237090058U, 3880063844U,  862416318U, 4039923869U, 2303788317U,
-	3073590536U,  701653667U, 2131530884U, 3169309950U, 2028486980U,
-	 747196777U, 3620218225U,  432016035U, 1449580595U, 2772266392U,
-	 444224948U, 1662832057U, 3184055582U, 3028331792U, 1861686254U,
-	1104864179U,  342430307U, 1350510923U, 3024656237U, 1028417492U,
-	2870772950U,  290847558U, 3675663500U,  508431529U, 4264340390U,
-	2263569913U, 1669302976U,  519511383U, 2706411211U, 3764615828U,
-	3883162495U, 4051445305U, 2412729798U, 3299405164U, 3991911166U,
-	2348767304U, 2664054906U, 3763609282U,  593943581U, 3757090046U,
-	2075338894U, 2020550814U, 4287452920U, 4290140003U, 1422957317U,
-	2512716667U, 2003485045U, 2307520103U, 2288472169U, 3940751663U,
-	4204638664U, 2892583423U, 1710068300U, 3904755993U, 2363243951U,
-	3038334120U,  547099465U,  771105860U, 3199983734U, 4282046461U,
-	2298388363U,  934810218U, 2837827901U, 3952500708U, 2095130248U,
-	3083335297U,   26885281U, 3932155283U, 1531751116U, 1425227133U,
-	 495654159U, 3279634176U, 3855562207U, 3957195338U, 4159985527U,
-	 893375062U, 1875515536U, 1327247422U, 3754140693U, 1028923197U,
-	1729880440U,  805571298U,  448971099U, 2726757106U, 2749436461U,
-	2485987104U,  175337042U, 3235477922U, 3882114302U, 2020970972U,
-	 943926109U, 2762587195U, 1904195558U, 3452650564U,  108432281U,
-	3893463573U, 3977583081U, 2636504348U, 1110673525U, 3548479841U,
-	4258854744U,  980047703U, 4057175418U, 3890008292U,  145653646U,
-	3141868989U, 3293216228U, 1194331837U, 1254570642U, 3049934521U,
-	2868313360U, 2886032750U, 1110873820U,  279553524U, 3007258565U,
-	1104807822U, 3186961098U,  315764646U, 2163680838U, 3574508994U,
-	3099755655U,  191957684U, 3642656737U, 3317946149U, 3522087636U,
-	 444526410U,  779157624U, 1088229627U, 1092460223U, 1856013765U,
-	3659877367U,  368270451U,  503570716U, 3000984671U, 2742789647U,
-	 928097709U, 2914109539U,  308843566U, 2816161253U, 3667192079U,
-	2762679057U, 3395240989U, 2928925038U, 1491465914U, 3458702834U,
-	3787782576U, 2894104823U, 1296880455U, 1253636503U,  989959407U,
-	2291560361U, 2776790436U, 1913178042U, 1584677829U,  689637520U,
-	1898406878U,  688391508U, 3385234998U,  845493284U, 1943591856U,
-	2720472050U,  222695101U, 1653320868U, 2904632120U, 4084936008U,
-	1080720688U, 3938032556U,  387896427U, 2650839632U,   99042991U,
-	1720913794U, 1047186003U, 1877048040U, 2090457659U,  517087501U,
-	4172014665U, 2129713163U, 2413533132U, 2760285054U, 4129272496U,
-	1317737175U, 2309566414U, 2228873332U, 3889671280U, 1110864630U,
-	3576797776U, 2074552772U,  832002644U, 3097122623U, 2464859298U,
-	2679603822U, 1667489885U, 3237652716U, 1478413938U, 1719340335U,
-	2306631119U,  639727358U, 3369698270U,  226902796U, 2099920751U,
-	1892289957U, 2201594097U, 3508197013U, 3495811856U, 3900381493U,
-	 841660320U, 3974501451U, 3360949056U, 1676829340U,  728899254U,
-	2047809627U, 2390948962U,  670165943U, 3412951831U, 4189320049U,
-	1911595255U, 2055363086U,  507170575U,  418219594U, 4141495280U,
-	2692088692U, 4203630654U, 3540093932U,  791986533U, 2237921051U,
-	2526864324U, 2956616642U, 1394958700U, 1983768223U, 1893373266U,
-	 591653646U,  228432437U, 1611046598U, 3007736357U, 1040040725U,
-	2726180733U, 2789804360U, 4263568405U,  829098158U, 3847722805U,
-	1123578029U, 1804276347U,  997971319U, 4203797076U, 4185199713U,
-	2811733626U, 2343642194U, 2985262313U, 1417930827U, 3759587724U,
-	1967077982U, 1585223204U, 1097475516U, 1903944948U,  740382444U,
-	1114142065U, 1541796065U, 1718384172U, 1544076191U, 1134682254U,
-	3519754455U, 2866243923U,  341865437U,  645498576U, 2690735853U,
-	1046963033U, 2493178460U, 1187604696U, 1619577821U,  488503634U,
-	3255768161U, 2306666149U, 1630514044U, 2377698367U, 2751503746U,
-	3794467088U, 1796415981U, 3657173746U,  409136296U, 1387122342U,
-	1297726519U,  219544855U, 4270285558U,  437578827U, 1444698679U,
-	2258519491U,  963109892U, 3982244073U, 3351535275U,  385328496U,
-	1804784013U,  698059346U, 3920535147U,  708331212U,  784338163U,
-	 785678147U, 1238376158U, 1557298846U, 2037809321U,  271576218U,
-	4145155269U, 1913481602U, 2763691931U,  588981080U, 1201098051U,
-	3717640232U, 1509206239U,  662536967U, 3180523616U, 1133105435U,
-	2963500837U, 2253971215U, 3153642623U, 1066925709U, 2582781958U,
-	3034720222U, 1090798544U, 2942170004U, 4036187520U,  686972531U,
-	2610990302U, 2641437026U, 1837562420U,  722096247U, 1315333033U,
-	2102231203U, 3402389208U, 3403698140U, 1312402831U, 2898426558U,
-	 814384596U,  385649582U, 1916643285U, 1924625106U, 2512905582U,
-	2501170304U, 4275223366U, 2841225246U, 1467663688U, 3563567847U,
-	2969208552U,  884750901U,  102992576U,  227844301U, 3681442994U,
-	3502881894U, 4034693299U, 1166727018U, 1697460687U, 1737778332U,
-	1787161139U, 1053003655U, 1215024478U, 2791616766U, 2525841204U,
-	1629323443U,    3233815U, 2003823032U, 3083834263U, 2379264872U,
-	3752392312U, 1287475550U, 3770904171U, 3004244617U, 1502117784U,
-	 918698423U, 2419857538U, 3864502062U, 1751322107U, 2188775056U,
-	4018728324U,  983712955U,  440071928U, 3710838677U, 2001027698U,
-	3994702151U,   22493119U, 3584400918U, 3446253670U, 4254789085U,
-	1405447860U, 1240245579U, 1800644159U, 1661363424U, 3278326132U,
-	3403623451U,   67092802U, 2609352193U, 3914150340U, 1814842761U,
-	3610830847U,  591531412U, 3880232807U, 1673505890U, 2585326991U,
-	1678544474U, 3148435887U, 3457217359U, 1193226330U, 2816576908U,
-	 154025329U,  121678860U, 1164915738U,  973873761U,  269116100U,
-	  52087970U,  744015362U,  498556057U,   94298882U, 1563271621U,
-	2383059628U, 4197367290U, 3958472990U, 2592083636U, 2906408439U,
-	1097742433U, 3924840517U,  264557272U, 2292287003U, 3203307984U,
-	4047038857U, 3820609705U, 2333416067U, 1839206046U, 3600944252U,
-	3412254904U,  583538222U, 2390557166U, 4140459427U, 2810357445U,
-	 226777499U, 2496151295U, 2207301712U, 3283683112U,  611630281U,
-	1933218215U, 3315610954U, 3889441987U, 3719454256U, 3957190521U,
-	1313998161U, 2365383016U, 3146941060U, 1801206260U,  796124080U,
-	2076248581U, 1747472464U, 3254365145U,  595543130U, 3573909503U,
-	3758250204U, 2020768540U, 2439254210U,   93368951U, 3155792250U,
-	2600232980U, 3709198295U, 3894900440U, 2971850836U, 1578909644U,
-	1443493395U, 2581621665U, 3086506297U, 2443465861U,  558107211U,
-	1519367835U,  249149686U,  908102264U, 2588765675U, 1232743965U,
-	1001330373U, 3561331654U, 2259301289U, 1564977624U, 3835077093U,
-	 727244906U, 4255738067U, 1214133513U, 2570786021U, 3899704621U,
-	1633861986U, 1636979509U, 1438500431U,   58463278U, 2823485629U,
-	2297430187U, 2926781924U, 3371352948U, 1864009023U, 2722267973U,
-	1444292075U,  437703973U, 1060414512U,  189705863U,  910018135U,
-	4077357964U,  884213423U, 2644986052U, 3973488374U, 1187906116U,
-	2331207875U,  780463700U, 3713351662U, 3854611290U,  412805574U,
-	2978462572U, 2176222820U,  829424696U, 2790788332U, 2750819108U,
-	1594611657U, 3899878394U, 3032870364U, 1702887682U, 1948167778U,
-	  14130042U,  192292500U,  947227076U,   90719497U, 3854230320U,
-	 784028434U, 2142399787U, 1563449646U, 2844400217U,  819143172U,
-	2883302356U, 2328055304U, 1328532246U, 2603885363U, 3375188924U,
-	 933941291U, 3627039714U, 2129697284U, 2167253953U, 2506905438U,
-	1412424497U, 2981395985U, 1418359660U, 2925902456U,   52752784U,
-	3713667988U, 3924669405U,  648975707U, 1145520213U, 4018650664U,
-	3805915440U, 2380542088U, 2013260958U, 3262572197U, 2465078101U,
-	1114540067U, 3728768081U, 2396958768U,  590672271U,  904818725U,
-	4263660715U,  700754408U, 1042601829U, 4094111823U, 4274838909U,
-	2512692617U, 2774300207U, 2057306915U, 3470942453U,   99333088U,
-	1142661026U, 2889931380U,   14316674U, 2201179167U,  415289459U,
-	 448265759U, 3515142743U, 3254903683U,  246633281U, 1184307224U,
-	2418347830U, 2092967314U, 2682072314U, 2558750234U, 2000352263U,
-	1544150531U,  399010405U, 1513946097U,  499682937U,  461167460U,
-	3045570638U, 1633669705U,  851492362U, 4052801922U, 2055266765U,
-	 635556996U,  368266356U, 2385737383U, 3218202352U, 2603772408U,
-	 349178792U,  226482567U, 3102426060U, 3575998268U, 2103001871U,
-	3243137071U,  225500688U, 1634718593U, 4283311431U, 4292122923U,
-	3842802787U,  811735523U,  105712518U,  663434053U, 1855889273U,
-	2847972595U, 1196355421U, 2552150115U, 4254510614U, 3752181265U,
-	3430721819U, 3828705396U, 3436287905U, 3441964937U, 4123670631U,
-	 353001539U,  459496439U, 3799690868U, 1293777660U, 2761079737U,
-	 498096339U, 3398433374U, 4080378380U, 2304691596U, 2995729055U,
-	4134660419U, 3903444024U, 3576494993U,  203682175U, 3321164857U,
-	2747963611U,   79749085U, 2992890370U, 1240278549U, 1772175713U,
-	2111331972U, 2655023449U, 1683896345U, 2836027212U, 3482868021U,
-	2489884874U,  756853961U, 2298874501U, 4013448667U, 4143996022U,
-	2948306858U, 4132920035U, 1283299272U,  995592228U, 3450508595U,
-	1027845759U, 1766942720U, 3861411826U, 1446861231U,   95974993U,
-	3502263554U, 1487532194U,  601502472U, 4129619129U,  250131773U,
-	2050079547U, 3198903947U, 3105589778U, 4066481316U, 3026383978U,
-	2276901713U,  365637751U, 2260718426U, 1394775634U, 1791172338U,
-	2690503163U, 2952737846U, 1568710462U,  732623190U, 2980358000U,
-	1053631832U, 1432426951U, 3229149635U, 1854113985U, 3719733532U,
-	3204031934U,  735775531U,  107468620U, 3734611984U,  631009402U,
-	3083622457U, 4109580626U,  159373458U, 1301970201U, 4132389302U,
-	1293255004U,  847182752U, 4170022737U,   96712900U, 2641406755U,
-	1381727755U,  405608287U, 4287919625U, 1703554290U, 3589580244U,
-	2911403488U,    2166565U, 2647306451U, 2330535117U, 1200815358U,
-	1165916754U,  245060911U, 4040679071U, 3684908771U, 2452834126U,
-	2486872773U, 2318678365U, 2940627908U, 1837837240U, 3447897409U,
-	4270484676U, 1495388728U, 3754288477U, 4204167884U, 1386977705U,
-	2692224733U, 3076249689U, 4109568048U, 4170955115U, 4167531356U,
-	4020189950U, 4261855038U, 3036907575U, 3410399885U, 3076395737U,
-	1046178638U,  144496770U,  230725846U, 3349637149U,   17065717U,
-	2809932048U, 2054581785U, 3608424964U, 3259628808U,  134897388U,
-	3743067463U,  257685904U, 3795656590U, 1562468719U, 3589103904U,
-	3120404710U,  254684547U, 2653661580U, 3663904795U, 2631942758U,
-	1063234347U, 2609732900U, 2332080715U, 3521125233U, 1180599599U,
-	1935868586U, 4110970440U,  296706371U, 2128666368U, 1319875791U,
-	1570900197U, 3096025483U, 1799882517U, 1928302007U, 1163707758U,
-	1244491489U, 3533770203U,  567496053U, 2757924305U, 2781639343U,
-	2818420107U,  560404889U, 2619609724U, 4176035430U, 2511289753U,
-	2521842019U, 3910553502U, 2926149387U, 3302078172U, 4237118867U,
-	 330725126U,  367400677U,  888239854U,  545570454U, 4259590525U,
-	 134343617U, 1102169784U, 1647463719U, 3260979784U, 1518840883U,
-	3631537963U, 3342671457U, 1301549147U, 2083739356U,  146593792U,
-	3217959080U,  652755743U, 2032187193U, 3898758414U, 1021358093U,
-	4037409230U, 2176407931U, 3427391950U, 2883553603U,  985613827U,
-	3105265092U, 3423168427U, 3387507672U,  467170288U, 2141266163U,
-	3723870208U,  916410914U, 1293987799U, 2652584950U,  769160137U,
-	3205292896U, 1561287359U, 1684510084U, 3136055621U, 3765171391U,
-	 639683232U, 2639569327U, 1218546948U, 4263586685U, 3058215773U,
-	2352279820U,  401870217U, 2625822463U, 1529125296U, 2981801895U,
-	1191285226U, 4027725437U, 3432700217U, 4098835661U,  971182783U,
-	2443861173U, 3881457123U, 3874386651U,  457276199U, 2638294160U,
-	4002809368U,  421169044U, 1112642589U, 3076213779U, 3387033971U,
-	2499610950U, 3057240914U, 1662679783U,  461224431U, 1168395933U
-};
-static const uint32_t init_by_array_32_expected[] = {
-	2920711183U, 3885745737U, 3501893680U,  856470934U, 1421864068U,
-	 277361036U, 1518638004U, 2328404353U, 3355513634U,   64329189U,
-	1624587673U, 3508467182U, 2481792141U, 3706480799U, 1925859037U,
-	2913275699U,  882658412U,  384641219U,  422202002U, 1873384891U,
-	2006084383U, 3924929912U, 1636718106U, 3108838742U, 1245465724U,
-	4195470535U,  779207191U, 1577721373U, 1390469554U, 2928648150U,
-	 121399709U, 3170839019U, 4044347501U,  953953814U, 3821710850U,
-	3085591323U, 3666535579U, 3577837737U, 2012008410U, 3565417471U,
-	4044408017U,  433600965U, 1637785608U, 1798509764U,  860770589U,
-	3081466273U, 3982393409U, 2451928325U, 3437124742U, 4093828739U,
-	3357389386U, 2154596123U,  496568176U, 2650035164U, 2472361850U,
-	   3438299U, 2150366101U, 1577256676U, 3802546413U, 1787774626U,
-	4078331588U, 3706103141U,  170391138U, 3806085154U, 1680970100U,
-	1961637521U, 3316029766U,  890610272U, 1453751581U, 1430283664U,
-	3051057411U, 3597003186U,  542563954U, 3796490244U, 1690016688U,
-	3448752238U,  440702173U,  347290497U, 1121336647U, 2540588620U,
-	 280881896U, 2495136428U,  213707396U,   15104824U, 2946180358U,
-	 659000016U,  566379385U, 2614030979U, 2855760170U,  334526548U,
-	2315569495U, 2729518615U,  564745877U, 1263517638U, 3157185798U,
-	1604852056U, 1011639885U, 2950579535U, 2524219188U,  312951012U,
-	1528896652U, 1327861054U, 2846910138U, 3966855905U, 2536721582U,
-	 855353911U, 1685434729U, 3303978929U, 1624872055U, 4020329649U,
-	3164802143U, 1642802700U, 1957727869U, 1792352426U, 3334618929U,
-	2631577923U, 3027156164U,  842334259U, 3353446843U, 1226432104U,
-	1742801369U, 3552852535U, 3471698828U, 1653910186U, 3380330939U,
-	2313782701U, 3351007196U, 2129839995U, 1800682418U, 4085884420U,
-	1625156629U, 3669701987U,  615211810U, 3294791649U, 4131143784U,
-	2590843588U, 3207422808U, 3275066464U,  561592872U, 3957205738U,
-	3396578098U,   48410678U, 3505556445U, 1005764855U, 3920606528U,
-	2936980473U, 2378918600U, 2404449845U, 1649515163U,  701203563U,
-	3705256349U,   83714199U, 3586854132U,  922978446U, 2863406304U,
-	3523398907U, 2606864832U, 2385399361U, 3171757816U, 4262841009U,
-	3645837721U, 1169579486U, 3666433897U, 3174689479U, 1457866976U,
-	3803895110U, 3346639145U, 1907224409U, 1978473712U, 1036712794U,
-	 980754888U, 1302782359U, 1765252468U,  459245755U, 3728923860U,
-	1512894209U, 2046491914U,  207860527U,  514188684U, 2288713615U,
-	1597354672U, 3349636117U, 2357291114U, 3995796221U,  945364213U,
-	1893326518U, 3770814016U, 1691552714U, 2397527410U,  967486361U,
-	 776416472U, 4197661421U,  951150819U, 1852770983U, 4044624181U,
-	1399439738U, 4194455275U, 2284037669U, 1550734958U, 3321078108U,
-	1865235926U, 2912129961U, 2664980877U, 1357572033U, 2600196436U,
-	2486728200U, 2372668724U, 1567316966U, 2374111491U, 1839843570U,
-	  20815612U, 3727008608U, 3871996229U,  824061249U, 1932503978U,
-	3404541726U,  758428924U, 2609331364U, 1223966026U, 1299179808U,
-	 648499352U, 2180134401U,  880821170U, 3781130950U,  113491270U,
-	1032413764U, 4185884695U, 2490396037U, 1201932817U, 4060951446U,
-	4165586898U, 1629813212U, 2887821158U,  415045333U,  628926856U,
-	2193466079U, 3391843445U, 2227540681U, 1907099846U, 2848448395U,
-	1717828221U, 1372704537U, 1707549841U, 2294058813U, 2101214437U,
-	2052479531U, 1695809164U, 3176587306U, 2632770465U,   81634404U,
-	1603220563U,  644238487U,  302857763U,  897352968U, 2613146653U,
-	1391730149U, 4245717312U, 4191828749U, 1948492526U, 2618174230U,
-	3992984522U, 2178852787U, 3596044509U, 3445573503U, 2026614616U,
-	 915763564U, 3415689334U, 2532153403U, 3879661562U, 2215027417U,
-	3111154986U, 2929478371U,  668346391U, 1152241381U, 2632029711U,
-	3004150659U, 2135025926U,  948690501U, 2799119116U, 4228829406U,
-	1981197489U, 4209064138U,  684318751U, 3459397845U,  201790843U,
-	4022541136U, 3043635877U,  492509624U, 3263466772U, 1509148086U,
-	 921459029U, 3198857146U,  705479721U, 3835966910U, 3603356465U,
-	 576159741U, 1742849431U,  594214882U, 2055294343U, 3634861861U,
-	 449571793U, 3246390646U, 3868232151U, 1479156585U, 2900125656U,
-	2464815318U, 3960178104U, 1784261920U,   18311476U, 3627135050U,
-	 644609697U,  424968996U,  919890700U, 2986824110U,  816423214U,
-	4003562844U, 1392714305U, 1757384428U, 2569030598U,  995949559U,
-	3875659880U, 2933807823U, 2752536860U, 2993858466U, 4030558899U,
-	2770783427U, 2775406005U, 2777781742U, 1931292655U,  472147933U,
-	3865853827U, 2726470545U, 2668412860U, 2887008249U,  408979190U,
-	3578063323U, 3242082049U, 1778193530U,   27981909U, 2362826515U,
-	 389875677U, 1043878156U,  581653903U, 3830568952U,  389535942U,
-	3713523185U, 2768373359U, 2526101582U, 1998618197U, 1160859704U,
-	3951172488U, 1098005003U,  906275699U, 3446228002U, 2220677963U,
-	2059306445U,  132199571U,  476838790U, 1868039399U, 3097344807U,
-	 857300945U,  396345050U, 2835919916U, 1782168828U, 1419519470U,
-	4288137521U,  819087232U,  596301494U,  872823172U, 1526888217U,
-	 805161465U, 1116186205U, 2829002754U, 2352620120U,  620121516U,
-	 354159268U, 3601949785U,  209568138U, 1352371732U, 2145977349U,
-	4236871834U, 1539414078U, 3558126206U, 3224857093U, 4164166682U,
-	3817553440U, 3301780278U, 2682696837U, 3734994768U, 1370950260U,
-	1477421202U, 2521315749U, 1330148125U, 1261554731U, 2769143688U,
-	3554756293U, 4235882678U, 3254686059U, 3530579953U, 1215452615U,
-	3574970923U, 4057131421U,  589224178U, 1000098193U,  171190718U,
-	2521852045U, 2351447494U, 2284441580U, 2646685513U, 3486933563U,
-	3789864960U, 1190528160U, 1702536782U, 1534105589U, 4262946827U,
-	2726686826U, 3584544841U, 2348270128U, 2145092281U, 2502718509U,
-	1027832411U, 3571171153U, 1287361161U, 4011474411U, 3241215351U,
-	2419700818U,  971242709U, 1361975763U, 1096842482U, 3271045537U,
-	  81165449U,  612438025U, 3912966678U, 1356929810U,  733545735U,
-	 537003843U, 1282953084U,  884458241U,  588930090U, 3930269801U,
-	2961472450U, 1219535534U, 3632251943U,  268183903U, 1441240533U,
-	3653903360U, 3854473319U, 2259087390U, 2548293048U, 2022641195U,
-	2105543911U, 1764085217U, 3246183186U,  482438805U,  888317895U,
-	2628314765U, 2466219854U,  717546004U, 2322237039U,  416725234U,
-	1544049923U, 1797944973U, 3398652364U, 3111909456U,  485742908U,
-	2277491072U, 1056355088U, 3181001278U,  129695079U, 2693624550U,
-	1764438564U, 3797785470U,  195503713U, 3266519725U, 2053389444U,
-	1961527818U, 3400226523U, 3777903038U, 2597274307U, 4235851091U,
-	4094406648U, 2171410785U, 1781151386U, 1378577117U,  654643266U,
-	3424024173U, 3385813322U,  679385799U,  479380913U,  681715441U,
-	3096225905U,  276813409U, 3854398070U, 2721105350U,  831263315U,
-	3276280337U, 2628301522U, 3984868494U, 1466099834U, 2104922114U,
-	1412672743U,  820330404U, 3491501010U,  942735832U,  710652807U,
-	3972652090U,  679881088U,   40577009U, 3705286397U, 2815423480U,
-	3566262429U,  663396513U, 3777887429U, 4016670678U,  404539370U,
-	1142712925U, 1140173408U, 2913248352U, 2872321286U,  263751841U,
-	3175196073U, 3162557581U, 2878996619U,   75498548U, 3836833140U,
-	3284664959U, 1157523805U,  112847376U,  207855609U, 1337979698U,
-	1222578451U,  157107174U,  901174378U, 3883717063U, 1618632639U,
-	1767889440U, 4264698824U, 1582999313U,  884471997U, 2508825098U,
-	3756370771U, 2457213553U, 3565776881U, 3709583214U,  915609601U,
-	 460833524U, 1091049576U,   85522880U,    2553251U,  132102809U,
-	2429882442U, 2562084610U, 1386507633U, 4112471229U,   21965213U,
-	1981516006U, 2418435617U, 3054872091U, 4251511224U, 2025783543U,
-	1916911512U, 2454491136U, 3938440891U, 3825869115U, 1121698605U,
-	3463052265U,  802340101U, 1912886800U, 4031997367U, 3550640406U,
-	1596096923U,  610150600U,  431464457U, 2541325046U,  486478003U,
-	 739704936U, 2862696430U, 3037903166U, 1129749694U, 2611481261U,
-	1228993498U,  510075548U, 3424962587U, 2458689681U,  818934833U,
-	4233309125U, 1608196251U, 3419476016U, 1858543939U, 2682166524U,
-	3317854285U,  631986188U, 3008214764U,  613826412U, 3567358221U,
-	3512343882U, 1552467474U, 3316162670U, 1275841024U, 4142173454U,
-	 565267881U,  768644821U,  198310105U, 2396688616U, 1837659011U,
-	 203429334U,  854539004U, 4235811518U, 3338304926U, 3730418692U,
-	3852254981U, 3032046452U, 2329811860U, 2303590566U, 2696092212U,
-	3894665932U,  145835667U,  249563655U, 1932210840U, 2431696407U,
-	3312636759U,  214962629U, 2092026914U, 3020145527U, 4073039873U,
-	2739105705U, 1308336752U,  855104522U, 2391715321U,   67448785U,
-	 547989482U,  854411802U, 3608633740U,  431731530U,  537375589U,
-	3888005760U,  696099141U,  397343236U, 1864511780U,   44029739U,
-	1729526891U, 1993398655U, 2010173426U, 2591546756U,  275223291U,
-	1503900299U, 4217765081U, 2185635252U, 1122436015U, 3550155364U,
-	 681707194U, 3260479338U,  933579397U, 2983029282U, 2505504587U,
-	2667410393U, 2962684490U, 4139721708U, 2658172284U, 2452602383U,
-	2607631612U, 1344296217U, 3075398709U, 2949785295U, 1049956168U,
-	3917185129U, 2155660174U, 3280524475U, 1503827867U,  674380765U,
-	1918468193U, 3843983676U,  634358221U, 2538335643U, 1873351298U,
-	3368723763U, 2129144130U, 3203528633U, 3087174986U, 2691698871U,
-	2516284287U,   24437745U, 1118381474U, 2816314867U, 2448576035U,
-	4281989654U,  217287825U,  165872888U, 2628995722U, 3533525116U,
-	2721669106U,  872340568U, 3429930655U, 3309047304U, 3916704967U,
-	3270160355U, 1348884255U, 1634797670U,  881214967U, 4259633554U,
-	 174613027U, 1103974314U, 1625224232U, 2678368291U, 1133866707U,
-	3853082619U, 4073196549U, 1189620777U,  637238656U,  930241537U,
-	4042750792U, 3842136042U, 2417007212U, 2524907510U, 1243036827U,
-	1282059441U, 3764588774U, 1394459615U, 2323620015U, 1166152231U,
-	3307479609U, 3849322257U, 3507445699U, 4247696636U,  758393720U,
-	 967665141U, 1095244571U, 1319812152U,  407678762U, 2640605208U,
-	2170766134U, 3663594275U, 4039329364U, 2512175520U,  725523154U,
-	2249807004U, 3312617979U, 2414634172U, 1278482215U,  349206484U,
-	1573063308U, 1196429124U, 3873264116U, 2400067801U,  268795167U,
-	 226175489U, 2961367263U, 1968719665U,   42656370U, 1010790699U,
-	 561600615U, 2422453992U, 3082197735U, 1636700484U, 3977715296U,
-	3125350482U, 3478021514U, 2227819446U, 1540868045U, 3061908980U,
-	1087362407U, 3625200291U,  361937537U,  580441897U, 1520043666U,
-	2270875402U, 1009161260U, 2502355842U, 4278769785U,  473902412U,
-	1057239083U, 1905829039U, 1483781177U, 2080011417U, 1207494246U,
-	1806991954U, 2194674403U, 3455972205U,  807207678U, 3655655687U,
-	 674112918U,  195425752U, 3917890095U, 1874364234U, 1837892715U,
-	3663478166U, 1548892014U, 2570748714U, 2049929836U, 2167029704U,
-	 697543767U, 3499545023U, 3342496315U, 1725251190U, 3561387469U,
-	2905606616U, 1580182447U, 3934525927U, 4103172792U, 1365672522U,
-	1534795737U, 3308667416U, 2841911405U, 3943182730U, 4072020313U,
-	3494770452U, 3332626671U,   55327267U,  478030603U,  411080625U,
-	3419529010U, 1604767823U, 3513468014U,  570668510U,  913790824U,
-	2283967995U,  695159462U, 3825542932U, 4150698144U, 1829758699U,
-	 202895590U, 1609122645U, 1267651008U, 2910315509U, 2511475445U,
-	2477423819U, 3932081579U,  900879979U, 2145588390U, 2670007504U,
-	 580819444U, 1864996828U, 2526325979U, 1019124258U,  815508628U,
-	2765933989U, 1277301341U, 3006021786U,  855540956U,  288025710U,
-	1919594237U, 2331223864U,  177452412U, 2475870369U, 2689291749U,
-	 865194284U,  253432152U, 2628531804U, 2861208555U, 2361597573U,
-	1653952120U, 1039661024U, 2159959078U, 3709040440U, 3564718533U,
-	2596878672U, 2041442161U,   31164696U, 2662962485U, 3665637339U,
-	1678115244U, 2699839832U, 3651968520U, 3521595541U,  458433303U,
-	2423096824U,   21831741U,  380011703U, 2498168716U,  861806087U,
-	1673574843U, 4188794405U, 2520563651U, 2632279153U, 2170465525U,
-	4171949898U, 3886039621U, 1661344005U, 3424285243U,  992588372U,
-	2500984144U, 2993248497U, 3590193895U, 1535327365U,  515645636U,
-	 131633450U, 3729760261U, 1613045101U, 3254194278U,   15889678U,
-	1493590689U,  244148718U, 2991472662U, 1401629333U,  777349878U,
-	2501401703U, 4285518317U, 3794656178U,  955526526U, 3442142820U,
-	3970298374U,  736025417U, 2737370764U, 1271509744U,  440570731U,
-	 136141826U, 1596189518U,  923399175U,  257541519U, 3505774281U,
-	2194358432U, 2518162991U, 1379893637U, 2667767062U, 3748146247U,
-	1821712620U, 3923161384U, 1947811444U, 2392527197U, 4127419685U,
-	1423694998U, 4156576871U, 1382885582U, 3420127279U, 3617499534U,
-	2994377493U, 4038063986U, 1918458672U, 2983166794U, 4200449033U,
-	 353294540U, 1609232588U,  243926648U, 2332803291U,  507996832U,
-	2392838793U, 4075145196U, 2060984340U, 4287475136U,   88232602U,
-	2491531140U, 4159725633U, 2272075455U,  759298618U,  201384554U,
-	 838356250U, 1416268324U,  674476934U,   90795364U,  141672229U,
-	3660399588U, 4196417251U, 3249270244U, 3774530247U,   59587265U,
-	3683164208U,   19392575U, 1463123697U, 1882205379U,  293780489U,
-	2553160622U, 2933904694U,  675638239U, 2851336944U, 1435238743U,
-	2448730183U,  804436302U, 2119845972U,  322560608U, 4097732704U,
-	2987802540U,  641492617U, 2575442710U, 4217822703U, 3271835300U,
-	2836418300U, 3739921620U, 2138378768U, 2879771855U, 4294903423U,
-	3121097946U, 2603440486U, 2560820391U, 1012930944U, 2313499967U,
-	 584489368U, 3431165766U,  897384869U, 2062537737U, 2847889234U,
-	3742362450U, 2951174585U, 4204621084U, 1109373893U, 3668075775U,
-	2750138839U, 3518055702U,  733072558U, 4169325400U,  788493625U
-};
-static const uint64_t init_gen_rand_64_expected[] = {
-	KQU(16924766246869039260), KQU( 8201438687333352714),
-	KQU( 2265290287015001750), KQU(18397264611805473832),
-	KQU( 3375255223302384358), KQU( 6345559975416828796),
-	KQU(18229739242790328073), KQU( 7596792742098800905),
-	KQU(  255338647169685981), KQU( 2052747240048610300),
-	KQU(18328151576097299343), KQU(12472905421133796567),
-	KQU(11315245349717600863), KQU(16594110197775871209),
-	KQU(15708751964632456450), KQU(10452031272054632535),
-	KQU(11097646720811454386), KQU( 4556090668445745441),
-	KQU(17116187693090663106), KQU(14931526836144510645),
-	KQU( 9190752218020552591), KQU( 9625800285771901401),
-	KQU(13995141077659972832), KQU( 5194209094927829625),
-	KQU( 4156788379151063303), KQU( 8523452593770139494),
-	KQU(14082382103049296727), KQU( 2462601863986088483),
-	KQU( 3030583461592840678), KQU( 5221622077872827681),
-	KQU( 3084210671228981236), KQU(13956758381389953823),
-	KQU(13503889856213423831), KQU(15696904024189836170),
-	KQU( 4612584152877036206), KQU( 6231135538447867881),
-	KQU(10172457294158869468), KQU( 6452258628466708150),
-	KQU(14044432824917330221), KQU(  370168364480044279),
-	KQU(10102144686427193359), KQU(  667870489994776076),
-	KQU( 2732271956925885858), KQU(18027788905977284151),
-	KQU(15009842788582923859), KQU( 7136357960180199542),
-	KQU(15901736243475578127), KQU(16951293785352615701),
-	KQU(10551492125243691632), KQU(17668869969146434804),
-	KQU(13646002971174390445), KQU( 9804471050759613248),
-	KQU( 5511670439655935493), KQU(18103342091070400926),
-	KQU(17224512747665137533), KQU(15534627482992618168),
-	KQU( 1423813266186582647), KQU(15821176807932930024),
-	KQU(   30323369733607156), KQU(11599382494723479403),
-	KQU(  653856076586810062), KQU( 3176437395144899659),
-	KQU(14028076268147963917), KQU(16156398271809666195),
-	KQU( 3166955484848201676), KQU( 5746805620136919390),
-	KQU(17297845208891256593), KQU(11691653183226428483),
-	KQU(17900026146506981577), KQU(15387382115755971042),
-	KQU(16923567681040845943), KQU( 8039057517199388606),
-	KQU(11748409241468629263), KQU(  794358245539076095),
-	KQU(13438501964693401242), KQU(14036803236515618962),
-	KQU( 5252311215205424721), KQU(17806589612915509081),
-	KQU( 6802767092397596006), KQU(14212120431184557140),
-	KQU( 1072951366761385712), KQU(13098491780722836296),
-	KQU( 9466676828710797353), KQU(12673056849042830081),
-	KQU(12763726623645357580), KQU(16468961652999309493),
-	KQU(15305979875636438926), KQU(17444713151223449734),
-	KQU( 5692214267627883674), KQU(13049589139196151505),
-	KQU(  880115207831670745), KQU( 1776529075789695498),
-	KQU(16695225897801466485), KQU(10666901778795346845),
-	KQU( 6164389346722833869), KQU( 2863817793264300475),
-	KQU( 9464049921886304754), KQU( 3993566636740015468),
-	KQU( 9983749692528514136), KQU(16375286075057755211),
-	KQU(16042643417005440820), KQU(11445419662923489877),
-	KQU( 7999038846885158836), KQU( 6721913661721511535),
-	KQU( 5363052654139357320), KQU( 1817788761173584205),
-	KQU(13290974386445856444), KQU( 4650350818937984680),
-	KQU( 8219183528102484836), KQU( 1569862923500819899),
-	KQU( 4189359732136641860), KQU(14202822961683148583),
-	KQU( 4457498315309429058), KQU(13089067387019074834),
-	KQU(11075517153328927293), KQU(10277016248336668389),
-	KQU( 7070509725324401122), KQU(17808892017780289380),
-	KQU(13143367339909287349), KQU( 1377743745360085151),
-	KQU( 5749341807421286485), KQU(14832814616770931325),
-	KQU( 7688820635324359492), KQU(10960474011539770045),
-	KQU(   81970066653179790), KQU(12619476072607878022),
-	KQU( 4419566616271201744), KQU(15147917311750568503),
-	KQU( 5549739182852706345), KQU( 7308198397975204770),
-	KQU(13580425496671289278), KQU(17070764785210130301),
-	KQU( 8202832846285604405), KQU( 6873046287640887249),
-	KQU( 6927424434308206114), KQU( 6139014645937224874),
-	KQU(10290373645978487639), KQU(15904261291701523804),
-	KQU( 9628743442057826883), KQU(18383429096255546714),
-	KQU( 4977413265753686967), KQU( 7714317492425012869),
-	KQU( 9025232586309926193), KQU(14627338359776709107),
-	KQU(14759849896467790763), KQU(10931129435864423252),
-	KQU( 4588456988775014359), KQU(10699388531797056724),
-	KQU(  468652268869238792), KQU( 5755943035328078086),
-	KQU( 2102437379988580216), KQU( 9986312786506674028),
-	KQU( 2654207180040945604), KQU( 8726634790559960062),
-	KQU(  100497234871808137), KQU( 2800137176951425819),
-	KQU( 6076627612918553487), KQU( 5780186919186152796),
-	KQU( 8179183595769929098), KQU( 6009426283716221169),
-	KQU( 2796662551397449358), KQU( 1756961367041986764),
-	KQU( 6972897917355606205), KQU(14524774345368968243),
-	KQU( 2773529684745706940), KQU( 4853632376213075959),
-	KQU( 4198177923731358102), KQU( 8271224913084139776),
-	KQU( 2741753121611092226), KQU(16782366145996731181),
-	KQU(15426125238972640790), KQU(13595497100671260342),
-	KQU( 3173531022836259898), KQU( 6573264560319511662),
-	KQU(18041111951511157441), KQU( 2351433581833135952),
-	KQU( 3113255578908173487), KQU( 1739371330877858784),
-	KQU(16046126562789165480), KQU( 8072101652214192925),
-	KQU(15267091584090664910), KQU( 9309579200403648940),
-	KQU( 5218892439752408722), KQU(14492477246004337115),
-	KQU(17431037586679770619), KQU( 7385248135963250480),
-	KQU( 9580144956565560660), KQU( 4919546228040008720),
-	KQU(15261542469145035584), KQU(18233297270822253102),
-	KQU( 5453248417992302857), KQU( 9309519155931460285),
-	KQU(10342813012345291756), KQU(15676085186784762381),
-	KQU(15912092950691300645), KQU( 9371053121499003195),
-	KQU( 9897186478226866746), KQU(14061858287188196327),
-	KQU(  122575971620788119), KQU(12146750969116317754),
-	KQU( 4438317272813245201), KQU( 8332576791009527119),
-	KQU(13907785691786542057), KQU(10374194887283287467),
-	KQU( 2098798755649059566), KQU( 3416235197748288894),
-	KQU( 8688269957320773484), KQU( 7503964602397371571),
-	KQU(16724977015147478236), KQU( 9461512855439858184),
-	KQU(13259049744534534727), KQU( 3583094952542899294),
-	KQU( 8764245731305528292), KQU(13240823595462088985),
-	KQU(13716141617617910448), KQU(18114969519935960955),
-	KQU( 2297553615798302206), KQU( 4585521442944663362),
-	KQU(17776858680630198686), KQU( 4685873229192163363),
-	KQU(  152558080671135627), KQU(15424900540842670088),
-	KQU(13229630297130024108), KQU(17530268788245718717),
-	KQU(16675633913065714144), KQU( 3158912717897568068),
-	KQU(15399132185380087288), KQU( 7401418744515677872),
-	KQU(13135412922344398535), KQU( 6385314346100509511),
-	KQU(13962867001134161139), KQU(10272780155442671999),
-	KQU(12894856086597769142), KQU(13340877795287554994),
-	KQU(12913630602094607396), KQU(12543167911119793857),
-	KQU(17343570372251873096), KQU(10959487764494150545),
-	KQU( 6966737953093821128), KQU(13780699135496988601),
-	KQU( 4405070719380142046), KQU(14923788365607284982),
-	KQU( 2869487678905148380), KQU( 6416272754197188403),
-	KQU(15017380475943612591), KQU( 1995636220918429487),
-	KQU( 3402016804620122716), KQU(15800188663407057080),
-	KQU(11362369990390932882), KQU(15262183501637986147),
-	KQU(10239175385387371494), KQU( 9352042420365748334),
-	KQU( 1682457034285119875), KQU( 1724710651376289644),
-	KQU( 2038157098893817966), KQU( 9897825558324608773),
-	KQU( 1477666236519164736), KQU(16835397314511233640),
-	KQU(10370866327005346508), KQU(10157504370660621982),
-	KQU(12113904045335882069), KQU(13326444439742783008),
-	KQU(11302769043000765804), KQU(13594979923955228484),
-	KQU(11779351762613475968), KQU( 3786101619539298383),
-	KQU( 8021122969180846063), KQU(15745904401162500495),
-	KQU(10762168465993897267), KQU(13552058957896319026),
-	KQU(11200228655252462013), KQU( 5035370357337441226),
-	KQU( 7593918984545500013), KQU( 5418554918361528700),
-	KQU( 4858270799405446371), KQU( 9974659566876282544),
-	KQU(18227595922273957859), KQU( 2772778443635656220),
-	KQU(14285143053182085385), KQU( 9939700992429600469),
-	KQU(12756185904545598068), KQU( 2020783375367345262),
-	KQU(   57026775058331227), KQU(  950827867930065454),
-	KQU( 6602279670145371217), KQU( 2291171535443566929),
-	KQU( 5832380724425010313), KQU( 1220343904715982285),
-	KQU(17045542598598037633), KQU(15460481779702820971),
-	KQU(13948388779949365130), KQU(13975040175430829518),
-	KQU(17477538238425541763), KQU(11104663041851745725),
-	KQU(15860992957141157587), KQU(14529434633012950138),
-	KQU( 2504838019075394203), KQU( 7512113882611121886),
-	KQU( 4859973559980886617), KQU( 1258601555703250219),
-	KQU(15594548157514316394), KQU( 4516730171963773048),
-	KQU(11380103193905031983), KQU( 6809282239982353344),
-	KQU(18045256930420065002), KQU( 2453702683108791859),
-	KQU(  977214582986981460), KQU( 2006410402232713466),
-	KQU( 6192236267216378358), KQU( 3429468402195675253),
-	KQU(18146933153017348921), KQU(17369978576367231139),
-	KQU( 1246940717230386603), KQU(11335758870083327110),
-	KQU(14166488801730353682), KQU( 9008573127269635732),
-	KQU(10776025389820643815), KQU(15087605441903942962),
-	KQU( 1359542462712147922), KQU(13898874411226454206),
-	KQU(17911176066536804411), KQU( 9435590428600085274),
-	KQU(  294488509967864007), KQU( 8890111397567922046),
-	KQU( 7987823476034328778), KQU(13263827582440967651),
-	KQU( 7503774813106751573), KQU(14974747296185646837),
-	KQU( 8504765037032103375), KQU(17340303357444536213),
-	KQU( 7704610912964485743), KQU( 8107533670327205061),
-	KQU( 9062969835083315985), KQU(16968963142126734184),
-	KQU(12958041214190810180), KQU( 2720170147759570200),
-	KQU( 2986358963942189566), KQU(14884226322219356580),
-	KQU(  286224325144368520), KQU(11313800433154279797),
-	KQU(18366849528439673248), KQU(17899725929482368789),
-	KQU( 3730004284609106799), KQU( 1654474302052767205),
-	KQU( 5006698007047077032), KQU( 8196893913601182838),
-	KQU(15214541774425211640), KQU(17391346045606626073),
-	KQU( 8369003584076969089), KQU( 3939046733368550293),
-	KQU(10178639720308707785), KQU( 2180248669304388697),
-	KQU(   62894391300126322), KQU( 9205708961736223191),
-	KQU( 6837431058165360438), KQU( 3150743890848308214),
-	KQU(17849330658111464583), KQU(12214815643135450865),
-	KQU(13410713840519603402), KQU( 3200778126692046802),
-	KQU(13354780043041779313), KQU(  800850022756886036),
-	KQU(15660052933953067433), KQU( 6572823544154375676),
-	KQU(11030281857015819266), KQU(12682241941471433835),
-	KQU(11654136407300274693), KQU( 4517795492388641109),
-	KQU( 9757017371504524244), KQU(17833043400781889277),
-	KQU(12685085201747792227), KQU(10408057728835019573),
-	KQU(   98370418513455221), KQU( 6732663555696848598),
-	KQU(13248530959948529780), KQU( 3530441401230622826),
-	KQU(18188251992895660615), KQU( 1847918354186383756),
-	KQU( 1127392190402660921), KQU(11293734643143819463),
-	KQU( 3015506344578682982), KQU(13852645444071153329),
-	KQU( 2121359659091349142), KQU( 1294604376116677694),
-	KQU( 5616576231286352318), KQU( 7112502442954235625),
-	KQU(11676228199551561689), KQU(12925182803007305359),
-	KQU( 7852375518160493082), KQU( 1136513130539296154),
-	KQU( 5636923900916593195), KQU( 3221077517612607747),
-	KQU(17784790465798152513), KQU( 3554210049056995938),
-	KQU(17476839685878225874), KQU( 3206836372585575732),
-	KQU( 2765333945644823430), KQU(10080070903718799528),
-	KQU( 5412370818878286353), KQU( 9689685887726257728),
-	KQU( 8236117509123533998), KQU( 1951139137165040214),
-	KQU( 4492205209227980349), KQU(16541291230861602967),
-	KQU( 1424371548301437940), KQU( 9117562079669206794),
-	KQU(14374681563251691625), KQU(13873164030199921303),
-	KQU( 6680317946770936731), KQU(15586334026918276214),
-	KQU(10896213950976109802), KQU( 9506261949596413689),
-	KQU( 9903949574308040616), KQU( 6038397344557204470),
-	KQU(  174601465422373648), KQU(15946141191338238030),
-	KQU(17142225620992044937), KQU( 7552030283784477064),
-	KQU( 2947372384532947997), KQU(  510797021688197711),
-	KQU( 4962499439249363461), KQU(   23770320158385357),
-	KQU(  959774499105138124), KQU( 1468396011518788276),
-	KQU( 2015698006852312308), KQU( 4149400718489980136),
-	KQU( 5992916099522371188), KQU(10819182935265531076),
-	KQU(16189787999192351131), KQU(  342833961790261950),
-	KQU(12470830319550495336), KQU(18128495041912812501),
-	KQU( 1193600899723524337), KQU( 9056793666590079770),
-	KQU( 2154021227041669041), KQU( 4963570213951235735),
-	KQU( 4865075960209211409), KQU( 2097724599039942963),
-	KQU( 2024080278583179845), KQU(11527054549196576736),
-	KQU(10650256084182390252), KQU( 4808408648695766755),
-	KQU( 1642839215013788844), KQU(10607187948250398390),
-	KQU( 7076868166085913508), KQU(  730522571106887032),
-	KQU(12500579240208524895), KQU( 4484390097311355324),
-	KQU(15145801330700623870), KQU( 8055827661392944028),
-	KQU( 5865092976832712268), KQU(15159212508053625143),
-	KQU( 3560964582876483341), KQU( 4070052741344438280),
-	KQU( 6032585709886855634), KQU(15643262320904604873),
-	KQU( 2565119772293371111), KQU(  318314293065348260),
-	KQU(15047458749141511872), KQU( 7772788389811528730),
-	KQU( 7081187494343801976), KQU( 6465136009467253947),
-	KQU(10425940692543362069), KQU(  554608190318339115),
-	KQU(14796699860302125214), KQU( 1638153134431111443),
-	KQU(10336967447052276248), KQU( 8412308070396592958),
-	KQU( 4004557277152051226), KQU( 8143598997278774834),
-	KQU(16413323996508783221), KQU(13139418758033994949),
-	KQU( 9772709138335006667), KQU( 2818167159287157659),
-	KQU(17091740573832523669), KQU(14629199013130751608),
-	KQU(18268322711500338185), KQU( 8290963415675493063),
-	KQU( 8830864907452542588), KQU( 1614839084637494849),
-	KQU(14855358500870422231), KQU( 3472996748392519937),
-	KQU(15317151166268877716), KQU( 5825895018698400362),
-	KQU(16730208429367544129), KQU(10481156578141202800),
-	KQU( 4746166512382823750), KQU(12720876014472464998),
-	KQU( 8825177124486735972), KQU(13733447296837467838),
-	KQU( 6412293741681359625), KQU( 8313213138756135033),
-	KQU(11421481194803712517), KQU( 7997007691544174032),
-	KQU( 6812963847917605930), KQU( 9683091901227558641),
-	KQU(14703594165860324713), KQU( 1775476144519618309),
-	KQU( 2724283288516469519), KQU(  717642555185856868),
-	KQU( 8736402192215092346), KQU(11878800336431381021),
-	KQU( 4348816066017061293), KQU( 6115112756583631307),
-	KQU( 9176597239667142976), KQU(12615622714894259204),
-	KQU(10283406711301385987), KQU( 5111762509485379420),
-	KQU( 3118290051198688449), KQU( 7345123071632232145),
-	KQU( 9176423451688682359), KQU( 4843865456157868971),
-	KQU(12008036363752566088), KQU(12058837181919397720),
-	KQU( 2145073958457347366), KQU( 1526504881672818067),
-	KQU( 3488830105567134848), KQU(13208362960674805143),
-	KQU( 4077549672899572192), KQU( 7770995684693818365),
-	KQU( 1398532341546313593), KQU(12711859908703927840),
-	KQU( 1417561172594446813), KQU(17045191024194170604),
-	KQU( 4101933177604931713), KQU(14708428834203480320),
-	KQU(17447509264469407724), KQU(14314821973983434255),
-	KQU(17990472271061617265), KQU( 5087756685841673942),
-	KQU(12797820586893859939), KQU( 1778128952671092879),
-	KQU( 3535918530508665898), KQU( 9035729701042481301),
-	KQU(14808661568277079962), KQU(14587345077537747914),
-	KQU(11920080002323122708), KQU( 6426515805197278753),
-	KQU( 3295612216725984831), KQU(11040722532100876120),
-	KQU(12305952936387598754), KQU(16097391899742004253),
-	KQU( 4908537335606182208), KQU(12446674552196795504),
-	KQU(16010497855816895177), KQU( 9194378874788615551),
-	KQU( 3382957529567613384), KQU( 5154647600754974077),
-	KQU( 9801822865328396141), KQU( 9023662173919288143),
-	KQU(17623115353825147868), KQU( 8238115767443015816),
-	KQU(15811444159859002560), KQU( 9085612528904059661),
-	KQU( 6888601089398614254), KQU(  258252992894160189),
-	KQU( 6704363880792428622), KQU( 6114966032147235763),
-	KQU(11075393882690261875), KQU( 8797664238933620407),
-	KQU( 5901892006476726920), KQU( 5309780159285518958),
-	KQU(14940808387240817367), KQU(14642032021449656698),
-	KQU( 9808256672068504139), KQU( 3670135111380607658),
-	KQU(11211211097845960152), KQU( 1474304506716695808),
-	KQU(15843166204506876239), KQU( 7661051252471780561),
-	KQU(10170905502249418476), KQU( 7801416045582028589),
-	KQU( 2763981484737053050), KQU( 9491377905499253054),
-	KQU(16201395896336915095), KQU( 9256513756442782198),
-	KQU( 5411283157972456034), KQU( 5059433122288321676),
-	KQU( 4327408006721123357), KQU( 9278544078834433377),
-	KQU( 7601527110882281612), KQU(11848295896975505251),
-	KQU(12096998801094735560), KQU(14773480339823506413),
-	KQU(15586227433895802149), KQU(12786541257830242872),
-	KQU( 6904692985140503067), KQU( 5309011515263103959),
-	KQU(12105257191179371066), KQU(14654380212442225037),
-	KQU( 2556774974190695009), KQU( 4461297399927600261),
-	KQU(14888225660915118646), KQU(14915459341148291824),
-	KQU( 2738802166252327631), KQU( 6047155789239131512),
-	KQU(12920545353217010338), KQU(10697617257007840205),
-	KQU( 2751585253158203504), KQU(13252729159780047496),
-	KQU(14700326134672815469), KQU(14082527904374600529),
-	KQU(16852962273496542070), KQU(17446675504235853907),
-	KQU(15019600398527572311), KQU(12312781346344081551),
-	KQU(14524667935039810450), KQU( 5634005663377195738),
-	KQU(11375574739525000569), KQU( 2423665396433260040),
-	KQU( 5222836914796015410), KQU( 4397666386492647387),
-	KQU( 4619294441691707638), KQU(  665088602354770716),
-	KQU(13246495665281593610), KQU( 6564144270549729409),
-	KQU(10223216188145661688), KQU( 3961556907299230585),
-	KQU(11543262515492439914), KQU(16118031437285993790),
-	KQU( 7143417964520166465), KQU(13295053515909486772),
-	KQU(   40434666004899675), KQU(17127804194038347164),
-	KQU( 8599165966560586269), KQU( 8214016749011284903),
-	KQU(13725130352140465239), KQU( 5467254474431726291),
-	KQU( 7748584297438219877), KQU(16933551114829772472),
-	KQU( 2169618439506799400), KQU( 2169787627665113463),
-	KQU(17314493571267943764), KQU(18053575102911354912),
-	KQU(11928303275378476973), KQU(11593850925061715550),
-	KQU(17782269923473589362), KQU( 3280235307704747039),
-	KQU( 6145343578598685149), KQU(17080117031114086090),
-	KQU(18066839902983594755), KQU( 6517508430331020706),
-	KQU( 8092908893950411541), KQU(12558378233386153732),
-	KQU( 4476532167973132976), KQU(16081642430367025016),
-	KQU( 4233154094369139361), KQU( 8693630486693161027),
-	KQU(11244959343027742285), KQU(12273503967768513508),
-	KQU(14108978636385284876), KQU( 7242414665378826984),
-	KQU( 6561316938846562432), KQU( 8601038474994665795),
-	KQU(17532942353612365904), KQU(17940076637020912186),
-	KQU( 7340260368823171304), KQU( 7061807613916067905),
-	KQU(10561734935039519326), KQU(17990796503724650862),
-	KQU( 6208732943911827159), KQU(  359077562804090617),
-	KQU(14177751537784403113), KQU(10659599444915362902),
-	KQU(15081727220615085833), KQU(13417573895659757486),
-	KQU(15513842342017811524), KQU(11814141516204288231),
-	KQU( 1827312513875101814), KQU( 2804611699894603103),
-	KQU(17116500469975602763), KQU(12270191815211952087),
-	KQU(12256358467786024988), KQU(18435021722453971267),
-	KQU(  671330264390865618), KQU(  476504300460286050),
-	KQU(16465470901027093441), KQU( 4047724406247136402),
-	KQU( 1322305451411883346), KQU( 1388308688834322280),
-	KQU( 7303989085269758176), KQU( 9323792664765233642),
-	KQU( 4542762575316368936), KQU(17342696132794337618),
-	KQU( 4588025054768498379), KQU(13415475057390330804),
-	KQU(17880279491733405570), KQU(10610553400618620353),
-	KQU( 3180842072658960139), KQU(13002966655454270120),
-	KQU( 1665301181064982826), KQU( 7083673946791258979),
-	KQU(  190522247122496820), KQU(17388280237250677740),
-	KQU( 8430770379923642945), KQU(12987180971921668584),
-	KQU( 2311086108365390642), KQU( 2870984383579822345),
-	KQU(14014682609164653318), KQU(14467187293062251484),
-	KQU(  192186361147413298), KQU(15171951713531796524),
-	KQU( 9900305495015948728), KQU(17958004775615466344),
-	KQU(14346380954498606514), KQU(18040047357617407096),
-	KQU( 5035237584833424532), KQU(15089555460613972287),
-	KQU( 4131411873749729831), KQU( 1329013581168250330),
-	KQU(10095353333051193949), KQU(10749518561022462716),
-	KQU( 9050611429810755847), KQU(15022028840236655649),
-	KQU( 8775554279239748298), KQU(13105754025489230502),
-	KQU(15471300118574167585), KQU(   89864764002355628),
-	KQU( 8776416323420466637), KQU( 5280258630612040891),
-	KQU( 2719174488591862912), KQU( 7599309137399661994),
-	KQU(15012887256778039979), KQU(14062981725630928925),
-	KQU(12038536286991689603), KQU( 7089756544681775245),
-	KQU(10376661532744718039), KQU( 1265198725901533130),
-	KQU(13807996727081142408), KQU( 2935019626765036403),
-	KQU( 7651672460680700141), KQU( 3644093016200370795),
-	KQU( 2840982578090080674), KQU(17956262740157449201),
-	KQU(18267979450492880548), KQU(11799503659796848070),
-	KQU( 9942537025669672388), KQU(11886606816406990297),
-	KQU( 5488594946437447576), KQU( 7226714353282744302),
-	KQU( 3784851653123877043), KQU(  878018453244803041),
-	KQU(12110022586268616085), KQU(  734072179404675123),
-	KQU(11869573627998248542), KQU(  469150421297783998),
-	KQU(  260151124912803804), KQU(11639179410120968649),
-	KQU( 9318165193840846253), KQU(12795671722734758075),
-	KQU(15318410297267253933), KQU(  691524703570062620),
-	KQU( 5837129010576994601), KQU(15045963859726941052),
-	KQU( 5850056944932238169), KQU(12017434144750943807),
-	KQU( 7447139064928956574), KQU( 3101711812658245019),
-	KQU(16052940704474982954), KQU(18195745945986994042),
-	KQU( 8932252132785575659), KQU(13390817488106794834),
-	KQU(11582771836502517453), KQU( 4964411326683611686),
-	KQU( 2195093981702694011), KQU(14145229538389675669),
-	KQU(16459605532062271798), KQU(  866316924816482864),
-	KQU( 4593041209937286377), KQU( 8415491391910972138),
-	KQU( 4171236715600528969), KQU(16637569303336782889),
-	KQU( 2002011073439212680), KQU(17695124661097601411),
-	KQU( 4627687053598611702), KQU( 7895831936020190403),
-	KQU( 8455951300917267802), KQU( 2923861649108534854),
-	KQU( 8344557563927786255), KQU( 6408671940373352556),
-	KQU(12210227354536675772), KQU(14294804157294222295),
-	KQU(10103022425071085127), KQU(10092959489504123771),
-	KQU( 6554774405376736268), KQU(12629917718410641774),
-	KQU( 6260933257596067126), KQU( 2460827021439369673),
-	KQU( 2541962996717103668), KQU(  597377203127351475),
-	KQU( 5316984203117315309), KQU( 4811211393563241961),
-	KQU(13119698597255811641), KQU( 8048691512862388981),
-	KQU(10216818971194073842), KQU( 4612229970165291764),
-	KQU(10000980798419974770), KQU( 6877640812402540687),
-	KQU( 1488727563290436992), KQU( 2227774069895697318),
-	KQU(11237754507523316593), KQU(13478948605382290972),
-	KQU( 1963583846976858124), KQU( 5512309205269276457),
-	KQU( 3972770164717652347), KQU( 3841751276198975037),
-	KQU(10283343042181903117), KQU( 8564001259792872199),
-	KQU(16472187244722489221), KQU( 8953493499268945921),
-	KQU( 3518747340357279580), KQU( 4003157546223963073),
-	KQU( 3270305958289814590), KQU( 3966704458129482496),
-	KQU( 8122141865926661939), KQU(14627734748099506653),
-	KQU(13064426990862560568), KQU( 2414079187889870829),
-	KQU( 5378461209354225306), KQU(10841985740128255566),
-	KQU(  538582442885401738), KQU( 7535089183482905946),
-	KQU(16117559957598879095), KQU( 8477890721414539741),
-	KQU( 1459127491209533386), KQU(17035126360733620462),
-	KQU( 8517668552872379126), KQU(10292151468337355014),
-	KQU(17081267732745344157), KQU(13751455337946087178),
-	KQU(14026945459523832966), KQU( 6653278775061723516),
-	KQU(10619085543856390441), KQU( 2196343631481122885),
-	KQU(10045966074702826136), KQU(10082317330452718282),
-	KQU( 5920859259504831242), KQU( 9951879073426540617),
-	KQU( 7074696649151414158), KQU(15808193543879464318),
-	KQU( 7385247772746953374), KQU( 3192003544283864292),
-	KQU(18153684490917593847), KQU(12423498260668568905),
-	KQU(10957758099756378169), KQU(11488762179911016040),
-	KQU( 2099931186465333782), KQU(11180979581250294432),
-	KQU( 8098916250668367933), KQU( 3529200436790763465),
-	KQU(12988418908674681745), KQU( 6147567275954808580),
-	KQU( 3207503344604030989), KQU(10761592604898615360),
-	KQU(  229854861031893504), KQU( 8809853962667144291),
-	KQU(13957364469005693860), KQU( 7634287665224495886),
-	KQU(12353487366976556874), KQU( 1134423796317152034),
-	KQU( 2088992471334107068), KQU( 7393372127190799698),
-	KQU( 1845367839871058391), KQU(  207922563987322884),
-	KQU(11960870813159944976), KQU(12182120053317317363),
-	KQU(17307358132571709283), KQU(13871081155552824936),
-	KQU(18304446751741566262), KQU( 7178705220184302849),
-	KQU(10929605677758824425), KQU(16446976977835806844),
-	KQU(13723874412159769044), KQU( 6942854352100915216),
-	KQU( 1726308474365729390), KQU( 2150078766445323155),
-	KQU(15345558947919656626), KQU(12145453828874527201),
-	KQU( 2054448620739726849), KQU( 2740102003352628137),
-	KQU(11294462163577610655), KQU(  756164283387413743),
-	KQU(17841144758438810880), KQU(10802406021185415861),
-	KQU( 8716455530476737846), KQU( 6321788834517649606),
-	KQU(14681322910577468426), KQU(17330043563884336387),
-	KQU(12701802180050071614), KQU(14695105111079727151),
-	KQU( 5112098511654172830), KQU( 4957505496794139973),
-	KQU( 8270979451952045982), KQU(12307685939199120969),
-	KQU(12425799408953443032), KQU( 8376410143634796588),
-	KQU(16621778679680060464), KQU( 3580497854566660073),
-	KQU( 1122515747803382416), KQU(  857664980960597599),
-	KQU( 6343640119895925918), KQU(12878473260854462891),
-	KQU(10036813920765722626), KQU(14451335468363173812),
-	KQU( 5476809692401102807), KQU(16442255173514366342),
-	KQU(13060203194757167104), KQU(14354124071243177715),
-	KQU(15961249405696125227), KQU(13703893649690872584),
-	KQU(  363907326340340064), KQU( 6247455540491754842),
-	KQU(12242249332757832361), KQU(  156065475679796717),
-	KQU( 9351116235749732355), KQU( 4590350628677701405),
-	KQU( 1671195940982350389), KQU(13501398458898451905),
-	KQU( 6526341991225002255), KQU( 1689782913778157592),
-	KQU( 7439222350869010334), KQU(13975150263226478308),
-	KQU(11411961169932682710), KQU(17204271834833847277),
-	KQU(  541534742544435367), KQU( 6591191931218949684),
-	KQU( 2645454775478232486), KQU( 4322857481256485321),
-	KQU( 8477416487553065110), KQU(12902505428548435048),
-	KQU(  971445777981341415), KQU(14995104682744976712),
-	KQU( 4243341648807158063), KQU( 8695061252721927661),
-	KQU( 5028202003270177222), KQU( 2289257340915567840),
-	KQU(13870416345121866007), KQU(13994481698072092233),
-	KQU( 6912785400753196481), KQU( 2278309315841980139),
-	KQU( 4329765449648304839), KQU( 5963108095785485298),
-	KQU( 4880024847478722478), KQU(16015608779890240947),
-	KQU( 1866679034261393544), KQU(  914821179919731519),
-	KQU( 9643404035648760131), KQU( 2418114953615593915),
-	KQU(  944756836073702374), KQU(15186388048737296834),
-	KQU( 7723355336128442206), KQU( 7500747479679599691),
-	KQU(18013961306453293634), KQU( 2315274808095756456),
-	KQU(13655308255424029566), KQU(17203800273561677098),
-	KQU( 1382158694422087756), KQU( 5090390250309588976),
-	KQU(  517170818384213989), KQU( 1612709252627729621),
-	KQU( 1330118955572449606), KQU(  300922478056709885),
-	KQU(18115693291289091987), KQU(13491407109725238321),
-	KQU(15293714633593827320), KQU( 5151539373053314504),
-	KQU( 5951523243743139207), KQU(14459112015249527975),
-	KQU( 5456113959000700739), KQU( 3877918438464873016),
-	KQU(12534071654260163555), KQU(15871678376893555041),
-	KQU(11005484805712025549), KQU(16353066973143374252),
-	KQU( 4358331472063256685), KQU( 8268349332210859288),
-	KQU(12485161590939658075), KQU(13955993592854471343),
-	KQU( 5911446886848367039), KQU(14925834086813706974),
-	KQU( 6590362597857994805), KQU( 1280544923533661875),
-	KQU( 1637756018947988164), KQU( 4734090064512686329),
-	KQU(16693705263131485912), KQU( 6834882340494360958),
-	KQU( 8120732176159658505), KQU( 2244371958905329346),
-	KQU(10447499707729734021), KQU( 7318742361446942194),
-	KQU( 8032857516355555296), KQU(14023605983059313116),
-	KQU( 1032336061815461376), KQU( 9840995337876562612),
-	KQU( 9869256223029203587), KQU(12227975697177267636),
-	KQU(12728115115844186033), KQU( 7752058479783205470),
-	KQU(  729733219713393087), KQU(12954017801239007622)
-};
-static const uint64_t init_by_array_64_expected[] = {
-	KQU( 2100341266307895239), KQU( 8344256300489757943),
-	KQU(15687933285484243894), KQU( 8268620370277076319),
-	KQU(12371852309826545459), KQU( 8800491541730110238),
-	KQU(18113268950100835773), KQU( 2886823658884438119),
-	KQU( 3293667307248180724), KQU( 9307928143300172731),
-	KQU( 7688082017574293629), KQU(  900986224735166665),
-	KQU( 9977972710722265039), KQU( 6008205004994830552),
-	KQU(  546909104521689292), KQU( 7428471521869107594),
-	KQU(14777563419314721179), KQU(16116143076567350053),
-	KQU( 5322685342003142329), KQU( 4200427048445863473),
-	KQU( 4693092150132559146), KQU(13671425863759338582),
-	KQU( 6747117460737639916), KQU( 4732666080236551150),
-	KQU( 5912839950611941263), KQU( 3903717554504704909),
-	KQU( 2615667650256786818), KQU(10844129913887006352),
-	KQU(13786467861810997820), KQU(14267853002994021570),
-	KQU(13767807302847237439), KQU(16407963253707224617),
-	KQU( 4802498363698583497), KQU( 2523802839317209764),
-	KQU( 3822579397797475589), KQU( 8950320572212130610),
-	KQU( 3745623504978342534), KQU(16092609066068482806),
-	KQU( 9817016950274642398), KQU(10591660660323829098),
-	KQU(11751606650792815920), KQU( 5122873818577122211),
-	KQU(17209553764913936624), KQU( 6249057709284380343),
-	KQU(15088791264695071830), KQU(15344673071709851930),
-	KQU( 4345751415293646084), KQU( 2542865750703067928),
-	KQU(13520525127852368784), KQU(18294188662880997241),
-	KQU( 3871781938044881523), KQU( 2873487268122812184),
-	KQU(15099676759482679005), KQU(15442599127239350490),
-	KQU( 6311893274367710888), KQU( 3286118760484672933),
-	KQU( 4146067961333542189), KQU(13303942567897208770),
-	KQU( 8196013722255630418), KQU( 4437815439340979989),
-	KQU(15433791533450605135), KQU( 4254828956815687049),
-	KQU( 1310903207708286015), KQU(10529182764462398549),
-	KQU(14900231311660638810), KQU( 9727017277104609793),
-	KQU( 1821308310948199033), KQU(11628861435066772084),
-	KQU( 9469019138491546924), KQU( 3145812670532604988),
-	KQU( 9938468915045491919), KQU( 1562447430672662142),
-	KQU(13963995266697989134), KQU( 3356884357625028695),
-	KQU( 4499850304584309747), KQU( 8456825817023658122),
-	KQU(10859039922814285279), KQU( 8099512337972526555),
-	KQU(  348006375109672149), KQU(11919893998241688603),
-	KQU( 1104199577402948826), KQU(16689191854356060289),
-	KQU(10992552041730168078), KQU( 7243733172705465836),
-	KQU( 5668075606180319560), KQU(18182847037333286970),
-	KQU( 4290215357664631322), KQU( 4061414220791828613),
-	KQU(13006291061652989604), KQU( 7140491178917128798),
-	KQU(12703446217663283481), KQU( 5500220597564558267),
-	KQU(10330551509971296358), KQU(15958554768648714492),
-	KQU( 5174555954515360045), KQU( 1731318837687577735),
-	KQU( 3557700801048354857), KQU(13764012341928616198),
-	KQU(13115166194379119043), KQU( 7989321021560255519),
-	KQU( 2103584280905877040), KQU( 9230788662155228488),
-	KQU(16396629323325547654), KQU(  657926409811318051),
-	KQU(15046700264391400727), KQU( 5120132858771880830),
-	KQU( 7934160097989028561), KQU( 6963121488531976245),
-	KQU(17412329602621742089), KQU(15144843053931774092),
-	KQU(17204176651763054532), KQU(13166595387554065870),
-	KQU( 8590377810513960213), KQU( 5834365135373991938),
-	KQU( 7640913007182226243), KQU( 3479394703859418425),
-	KQU(16402784452644521040), KQU( 4993979809687083980),
-	KQU(13254522168097688865), KQU(15643659095244365219),
-	KQU( 5881437660538424982), KQU(11174892200618987379),
-	KQU(  254409966159711077), KQU(17158413043140549909),
-	KQU( 3638048789290376272), KQU( 1376816930299489190),
-	KQU( 4622462095217761923), KQU(15086407973010263515),
-	KQU(13253971772784692238), KQU( 5270549043541649236),
-	KQU(11182714186805411604), KQU(12283846437495577140),
-	KQU( 5297647149908953219), KQU(10047451738316836654),
-	KQU( 4938228100367874746), KQU(12328523025304077923),
-	KQU( 3601049438595312361), KQU( 9313624118352733770),
-	KQU(13322966086117661798), KQU(16660005705644029394),
-	KQU(11337677526988872373), KQU(13869299102574417795),
-	KQU(15642043183045645437), KQU( 3021755569085880019),
-	KQU( 4979741767761188161), KQU(13679979092079279587),
-	KQU( 3344685842861071743), KQU(13947960059899588104),
-	KQU(  305806934293368007), KQU( 5749173929201650029),
-	KQU(11123724852118844098), KQU(15128987688788879802),
-	KQU(15251651211024665009), KQU( 7689925933816577776),
-	KQU(16732804392695859449), KQU(17087345401014078468),
-	KQU(14315108589159048871), KQU( 4820700266619778917),
-	KQU(16709637539357958441), KQU( 4936227875177351374),
-	KQU( 2137907697912987247), KQU(11628565601408395420),
-	KQU( 2333250549241556786), KQU( 5711200379577778637),
-	KQU( 5170680131529031729), KQU(12620392043061335164),
-	KQU(   95363390101096078), KQU( 5487981914081709462),
-	KQU( 1763109823981838620), KQU( 3395861271473224396),
-	KQU( 1300496844282213595), KQU( 6894316212820232902),
-	KQU(10673859651135576674), KQU( 5911839658857903252),
-	KQU(17407110743387299102), KQU( 8257427154623140385),
-	KQU(11389003026741800267), KQU( 4070043211095013717),
-	KQU(11663806997145259025), KQU(15265598950648798210),
-	KQU(  630585789434030934), KQU( 3524446529213587334),
-	KQU( 7186424168495184211), KQU(10806585451386379021),
-	KQU(11120017753500499273), KQU( 1586837651387701301),
-	KQU(17530454400954415544), KQU( 9991670045077880430),
-	KQU( 7550997268990730180), KQU( 8640249196597379304),
-	KQU( 3522203892786893823), KQU(10401116549878854788),
-	KQU(13690285544733124852), KQU( 8295785675455774586),
-	KQU(15535716172155117603), KQU( 3112108583723722511),
-	KQU(17633179955339271113), KQU(18154208056063759375),
-	KQU( 1866409236285815666), KQU(13326075895396412882),
-	KQU( 8756261842948020025), KQU( 6281852999868439131),
-	KQU(15087653361275292858), KQU(10333923911152949397),
-	KQU( 5265567645757408500), KQU(12728041843210352184),
-	KQU( 6347959327507828759), KQU(  154112802625564758),
-	KQU(18235228308679780218), KQU( 3253805274673352418),
-	KQU( 4849171610689031197), KQU(17948529398340432518),
-	KQU(13803510475637409167), KQU(13506570190409883095),
-	KQU(15870801273282960805), KQU( 8451286481299170773),
-	KQU( 9562190620034457541), KQU( 8518905387449138364),
-	KQU(12681306401363385655), KQU( 3788073690559762558),
-	KQU( 5256820289573487769), KQU( 2752021372314875467),
-	KQU( 6354035166862520716), KQU( 4328956378309739069),
-	KQU(  449087441228269600), KQU( 5533508742653090868),
-	KQU( 1260389420404746988), KQU(18175394473289055097),
-	KQU( 1535467109660399420), KQU( 8818894282874061442),
-	KQU(12140873243824811213), KQU(15031386653823014946),
-	KQU( 1286028221456149232), KQU( 6329608889367858784),
-	KQU( 9419654354945132725), KQU( 6094576547061672379),
-	KQU(17706217251847450255), KQU( 1733495073065878126),
-	KQU(16918923754607552663), KQU( 8881949849954945044),
-	KQU(12938977706896313891), KQU(14043628638299793407),
-	KQU(18393874581723718233), KQU( 6886318534846892044),
-	KQU(14577870878038334081), KQU(13541558383439414119),
-	KQU(13570472158807588273), KQU(18300760537910283361),
-	KQU(  818368572800609205), KQU( 1417000585112573219),
-	KQU(12337533143867683655), KQU(12433180994702314480),
-	KQU(  778190005829189083), KQU(13667356216206524711),
-	KQU( 9866149895295225230), KQU(11043240490417111999),
-	KQU( 1123933826541378598), KQU( 6469631933605123610),
-	KQU(14508554074431980040), KQU(13918931242962026714),
-	KQU( 2870785929342348285), KQU(14786362626740736974),
-	KQU(13176680060902695786), KQU( 9591778613541679456),
-	KQU( 9097662885117436706), KQU(  749262234240924947),
-	KQU( 1944844067793307093), KQU( 4339214904577487742),
-	KQU( 8009584152961946551), KQU(16073159501225501777),
-	KQU( 3335870590499306217), KQU(17088312653151202847),
-	KQU( 3108893142681931848), KQU(16636841767202792021),
-	KQU(10423316431118400637), KQU( 8008357368674443506),
-	KQU(11340015231914677875), KQU(17687896501594936090),
-	KQU(15173627921763199958), KQU(  542569482243721959),
-	KQU(15071714982769812975), KQU( 4466624872151386956),
-	KQU( 1901780715602332461), KQU( 9822227742154351098),
-	KQU( 1479332892928648780), KQU( 6981611948382474400),
-	KQU( 7620824924456077376), KQU(14095973329429406782),
-	KQU( 7902744005696185404), KQU(15830577219375036920),
-	KQU(10287076667317764416), KQU(12334872764071724025),
-	KQU( 4419302088133544331), KQU(14455842851266090520),
-	KQU(12488077416504654222), KQU( 7953892017701886766),
-	KQU( 6331484925529519007), KQU( 4902145853785030022),
-	KQU(17010159216096443073), KQU(11945354668653886087),
-	KQU(15112022728645230829), KQU(17363484484522986742),
-	KQU( 4423497825896692887), KQU( 8155489510809067471),
-	KQU(  258966605622576285), KQU( 5462958075742020534),
-	KQU( 6763710214913276228), KQU( 2368935183451109054),
-	KQU(14209506165246453811), KQU( 2646257040978514881),
-	KQU( 3776001911922207672), KQU( 1419304601390147631),
-	KQU(14987366598022458284), KQU( 3977770701065815721),
-	KQU(  730820417451838898), KQU( 3982991703612885327),
-	KQU( 2803544519671388477), KQU(17067667221114424649),
-	KQU( 2922555119737867166), KQU( 1989477584121460932),
-	KQU(15020387605892337354), KQU( 9293277796427533547),
-	KQU(10722181424063557247), KQU(16704542332047511651),
-	KQU( 5008286236142089514), KQU(16174732308747382540),
-	KQU(17597019485798338402), KQU(13081745199110622093),
-	KQU( 8850305883842258115), KQU(12723629125624589005),
-	KQU( 8140566453402805978), KQU(15356684607680935061),
-	KQU(14222190387342648650), KQU(11134610460665975178),
-	KQU( 1259799058620984266), KQU(13281656268025610041),
-	KQU(  298262561068153992), KQU(12277871700239212922),
-	KQU(13911297774719779438), KQU(16556727962761474934),
-	KQU(17903010316654728010), KQU( 9682617699648434744),
-	KQU(14757681836838592850), KQU( 1327242446558524473),
-	KQU(11126645098780572792), KQU( 1883602329313221774),
-	KQU( 2543897783922776873), KQU(15029168513767772842),
-	KQU(12710270651039129878), KQU(16118202956069604504),
-	KQU(15010759372168680524), KQU( 2296827082251923948),
-	KQU(10793729742623518101), KQU(13829764151845413046),
-	KQU(17769301223184451213), KQU( 3118268169210783372),
-	KQU(17626204544105123127), KQU( 7416718488974352644),
-	KQU(10450751996212925994), KQU( 9352529519128770586),
-	KQU(  259347569641110140), KQU( 8048588892269692697),
-	KQU( 1774414152306494058), KQU(10669548347214355622),
-	KQU(13061992253816795081), KQU(18432677803063861659),
-	KQU( 8879191055593984333), KQU(12433753195199268041),
-	KQU(14919392415439730602), KQU( 6612848378595332963),
-	KQU( 6320986812036143628), KQU(10465592420226092859),
-	KQU( 4196009278962570808), KQU( 3747816564473572224),
-	KQU(17941203486133732898), KQU( 2350310037040505198),
-	KQU( 5811779859134370113), KQU(10492109599506195126),
-	KQU( 7699650690179541274), KQU( 1954338494306022961),
-	KQU(14095816969027231152), KQU( 5841346919964852061),
-	KQU(14945969510148214735), KQU( 3680200305887550992),
-	KQU( 6218047466131695792), KQU( 8242165745175775096),
-	KQU(11021371934053307357), KQU( 1265099502753169797),
-	KQU( 4644347436111321718), KQU( 3609296916782832859),
-	KQU( 8109807992218521571), KQU(18387884215648662020),
-	KQU(14656324896296392902), KQU(17386819091238216751),
-	KQU(17788300878582317152), KQU( 7919446259742399591),
-	KQU( 4466613134576358004), KQU(12928181023667938509),
-	KQU(13147446154454932030), KQU(16552129038252734620),
-	KQU( 8395299403738822450), KQU(11313817655275361164),
-	KQU(  434258809499511718), KQU( 2074882104954788676),
-	KQU( 7929892178759395518), KQU( 9006461629105745388),
-	KQU( 5176475650000323086), KQU(11128357033468341069),
-	KQU(12026158851559118955), KQU(14699716249471156500),
-	KQU(  448982497120206757), KQU( 4156475356685519900),
-	KQU( 6063816103417215727), KQU(10073289387954971479),
-	KQU( 8174466846138590962), KQU( 2675777452363449006),
-	KQU( 9090685420572474281), KQU( 6659652652765562060),
-	KQU(12923120304018106621), KQU(11117480560334526775),
-	KQU(  937910473424587511), KQU( 1838692113502346645),
-	KQU(11133914074648726180), KQU( 7922600945143884053),
-	KQU(13435287702700959550), KQU( 5287964921251123332),
-	KQU(11354875374575318947), KQU(17955724760748238133),
-	KQU(13728617396297106512), KQU( 4107449660118101255),
-	KQU( 1210269794886589623), KQU(11408687205733456282),
-	KQU( 4538354710392677887), KQU(13566803319341319267),
-	KQU(17870798107734050771), KQU( 3354318982568089135),
-	KQU( 9034450839405133651), KQU(13087431795753424314),
-	KQU(  950333102820688239), KQU( 1968360654535604116),
-	KQU(16840551645563314995), KQU( 8867501803892924995),
-	KQU(11395388644490626845), KQU( 1529815836300732204),
-	KQU(13330848522996608842), KQU( 1813432878817504265),
-	KQU( 2336867432693429560), KQU(15192805445973385902),
-	KQU( 2528593071076407877), KQU(  128459777936689248),
-	KQU( 9976345382867214866), KQU( 6208885766767996043),
-	KQU(14982349522273141706), KQU( 3099654362410737822),
-	KQU(13776700761947297661), KQU( 8806185470684925550),
-	KQU( 8151717890410585321), KQU(  640860591588072925),
-	KQU(14592096303937307465), KQU( 9056472419613564846),
-	KQU(14861544647742266352), KQU(12703771500398470216),
-	KQU( 3142372800384138465), KQU( 6201105606917248196),
-	KQU(18337516409359270184), KQU(15042268695665115339),
-	KQU(15188246541383283846), KQU(12800028693090114519),
-	KQU( 5992859621101493472), KQU(18278043971816803521),
-	KQU( 9002773075219424560), KQU( 7325707116943598353),
-	KQU( 7930571931248040822), KQU( 5645275869617023448),
-	KQU( 7266107455295958487), KQU( 4363664528273524411),
-	KQU(14313875763787479809), KQU(17059695613553486802),
-	KQU( 9247761425889940932), KQU(13704726459237593128),
-	KQU( 2701312427328909832), KQU(17235532008287243115),
-	KQU(14093147761491729538), KQU( 6247352273768386516),
-	KQU( 8268710048153268415), KQU( 7985295214477182083),
-	KQU(15624495190888896807), KQU( 3772753430045262788),
-	KQU( 9133991620474991698), KQU( 5665791943316256028),
-	KQU( 7551996832462193473), KQU(13163729206798953877),
-	KQU( 9263532074153846374), KQU( 1015460703698618353),
-	KQU(17929874696989519390), KQU(18257884721466153847),
-	KQU(16271867543011222991), KQU( 3905971519021791941),
-	KQU(16814488397137052085), KQU( 1321197685504621613),
-	KQU( 2870359191894002181), KQU(14317282970323395450),
-	KQU(13663920845511074366), KQU( 2052463995796539594),
-	KQU(14126345686431444337), KQU( 1727572121947022534),
-	KQU(17793552254485594241), KQU( 6738857418849205750),
-	KQU( 1282987123157442952), KQU(16655480021581159251),
-	KQU( 6784587032080183866), KQU(14726758805359965162),
-	KQU( 7577995933961987349), KQU(12539609320311114036),
-	KQU(10789773033385439494), KQU( 8517001497411158227),
-	KQU(10075543932136339710), KQU(14838152340938811081),
-	KQU( 9560840631794044194), KQU(17445736541454117475),
-	KQU(10633026464336393186), KQU(15705729708242246293),
-	KQU( 1117517596891411098), KQU( 4305657943415886942),
-	KQU( 4948856840533979263), KQU(16071681989041789593),
-	KQU(13723031429272486527), KQU( 7639567622306509462),
-	KQU(12670424537483090390), KQU( 9715223453097197134),
-	KQU( 5457173389992686394), KQU(  289857129276135145),
-	KQU(17048610270521972512), KQU(  692768013309835485),
-	KQU(14823232360546632057), KQU(18218002361317895936),
-	KQU( 3281724260212650204), KQU(16453957266549513795),
-	KQU( 8592711109774511881), KQU(  929825123473369579),
-	KQU(15966784769764367791), KQU( 9627344291450607588),
-	KQU(10849555504977813287), KQU( 9234566913936339275),
-	KQU( 6413807690366911210), KQU(10862389016184219267),
-	KQU(13842504799335374048), KQU( 1531994113376881174),
-	KQU( 2081314867544364459), KQU(16430628791616959932),
-	KQU( 8314714038654394368), KQU( 9155473892098431813),
-	KQU(12577843786670475704), KQU( 4399161106452401017),
-	KQU( 1668083091682623186), KQU( 1741383777203714216),
-	KQU( 2162597285417794374), KQU(15841980159165218736),
-	KQU( 1971354603551467079), KQU( 1206714764913205968),
-	KQU( 4790860439591272330), KQU(14699375615594055799),
-	KQU( 8374423871657449988), KQU(10950685736472937738),
-	KQU(  697344331343267176), KQU(10084998763118059810),
-	KQU(12897369539795983124), KQU(12351260292144383605),
-	KQU( 1268810970176811234), KQU( 7406287800414582768),
-	KQU(  516169557043807831), KQU( 5077568278710520380),
-	KQU( 3828791738309039304), KQU( 7721974069946943610),
-	KQU( 3534670260981096460), KQU( 4865792189600584891),
-	KQU(16892578493734337298), KQU( 9161499464278042590),
-	KQU(11976149624067055931), KQU(13219479887277343990),
-	KQU(14161556738111500680), KQU(14670715255011223056),
-	KQU( 4671205678403576558), KQU(12633022931454259781),
-	KQU(14821376219869187646), KQU(  751181776484317028),
-	KQU( 2192211308839047070), KQU(11787306362361245189),
-	KQU(10672375120744095707), KQU( 4601972328345244467),
-	KQU(15457217788831125879), KQU( 8464345256775460809),
-	KQU(10191938789487159478), KQU( 6184348739615197613),
-	KQU(11425436778806882100), KQU( 2739227089124319793),
-	KQU(  461464518456000551), KQU( 4689850170029177442),
-	KQU( 6120307814374078625), KQU(11153579230681708671),
-	KQU( 7891721473905347926), KQU(10281646937824872400),
-	KQU( 3026099648191332248), KQU( 8666750296953273818),
-	KQU(14978499698844363232), KQU(13303395102890132065),
-	KQU( 8182358205292864080), KQU(10560547713972971291),
-	KQU(11981635489418959093), KQU( 3134621354935288409),
-	KQU(11580681977404383968), KQU(14205530317404088650),
-	KQU( 5997789011854923157), KQU(13659151593432238041),
-	KQU(11664332114338865086), KQU( 7490351383220929386),
-	KQU( 7189290499881530378), KQU(15039262734271020220),
-	KQU( 2057217285976980055), KQU(  555570804905355739),
-	KQU(11235311968348555110), KQU(13824557146269603217),
-	KQU(16906788840653099693), KQU( 7222878245455661677),
-	KQU( 5245139444332423756), KQU( 4723748462805674292),
-	KQU(12216509815698568612), KQU(17402362976648951187),
-	KQU(17389614836810366768), KQU( 4880936484146667711),
-	KQU( 9085007839292639880), KQU(13837353458498535449),
-	KQU(11914419854360366677), KQU(16595890135313864103),
-	KQU( 6313969847197627222), KQU(18296909792163910431),
-	KQU(10041780113382084042), KQU( 2499478551172884794),
-	KQU(11057894246241189489), KQU( 9742243032389068555),
-	KQU(12838934582673196228), KQU(13437023235248490367),
-	KQU(13372420669446163240), KQU( 6752564244716909224),
-	KQU( 7157333073400313737), KQU(12230281516370654308),
-	KQU( 1182884552219419117), KQU( 2955125381312499218),
-	KQU(10308827097079443249), KQU( 1337648572986534958),
-	KQU(16378788590020343939), KQU(  108619126514420935),
-	KQU( 3990981009621629188), KQU( 5460953070230946410),
-	KQU( 9703328329366531883), KQU(13166631489188077236),
-	KQU( 1104768831213675170), KQU( 3447930458553877908),
-	KQU( 8067172487769945676), KQU( 5445802098190775347),
-	KQU( 3244840981648973873), KQU(17314668322981950060),
-	KQU( 5006812527827763807), KQU(18158695070225526260),
-	KQU( 2824536478852417853), KQU(13974775809127519886),
-	KQU( 9814362769074067392), KQU(17276205156374862128),
-	KQU(11361680725379306967), KQU( 3422581970382012542),
-	KQU(11003189603753241266), KQU(11194292945277862261),
-	KQU( 6839623313908521348), KQU(11935326462707324634),
-	KQU( 1611456788685878444), KQU(13112620989475558907),
-	KQU(  517659108904450427), KQU(13558114318574407624),
-	KQU(15699089742731633077), KQU( 4988979278862685458),
-	KQU( 8111373583056521297), KQU( 3891258746615399627),
-	KQU( 8137298251469718086), KQU(12748663295624701649),
-	KQU( 4389835683495292062), KQU( 5775217872128831729),
-	KQU( 9462091896405534927), KQU( 8498124108820263989),
-	KQU( 8059131278842839525), KQU(10503167994254090892),
-	KQU(11613153541070396656), KQU(18069248738504647790),
-	KQU(  570657419109768508), KQU( 3950574167771159665),
-	KQU( 5514655599604313077), KQU( 2908460854428484165),
-	KQU(10777722615935663114), KQU(12007363304839279486),
-	KQU( 9800646187569484767), KQU( 8795423564889864287),
-	KQU(14257396680131028419), KQU( 6405465117315096498),
-	KQU( 7939411072208774878), KQU(17577572378528990006),
-	KQU(14785873806715994850), KQU(16770572680854747390),
-	KQU(18127549474419396481), KQU(11637013449455757750),
-	KQU(14371851933996761086), KQU( 3601181063650110280),
-	KQU( 4126442845019316144), KQU(10198287239244320669),
-	KQU(18000169628555379659), KQU(18392482400739978269),
-	KQU( 6219919037686919957), KQU( 3610085377719446052),
-	KQU( 2513925039981776336), KQU(16679413537926716955),
-	KQU(12903302131714909434), KQU( 5581145789762985009),
-	KQU(12325955044293303233), KQU(17216111180742141204),
-	KQU( 6321919595276545740), KQU( 3507521147216174501),
-	KQU( 9659194593319481840), KQU(11473976005975358326),
-	KQU(14742730101435987026), KQU(  492845897709954780),
-	KQU(16976371186162599676), KQU(17712703422837648655),
-	KQU( 9881254778587061697), KQU( 8413223156302299551),
-	KQU( 1563841828254089168), KQU( 9996032758786671975),
-	KQU(  138877700583772667), KQU(13003043368574995989),
-	KQU( 4390573668650456587), KQU( 8610287390568126755),
-	KQU(15126904974266642199), KQU( 6703637238986057662),
-	KQU( 2873075592956810157), KQU( 6035080933946049418),
-	KQU(13382846581202353014), KQU( 7303971031814642463),
-	KQU(18418024405307444267), KQU( 5847096731675404647),
-	KQU( 4035880699639842500), KQU(11525348625112218478),
-	KQU( 3041162365459574102), KQU( 2604734487727986558),
-	KQU(15526341771636983145), KQU(14556052310697370254),
-	KQU(12997787077930808155), KQU( 9601806501755554499),
-	KQU(11349677952521423389), KQU(14956777807644899350),
-	KQU(16559736957742852721), KQU(12360828274778140726),
-	KQU( 6685373272009662513), KQU(16932258748055324130),
-	KQU(15918051131954158508), KQU( 1692312913140790144),
-	KQU(  546653826801637367), KQU( 5341587076045986652),
-	KQU(14975057236342585662), KQU(12374976357340622412),
-	KQU(10328833995181940552), KQU(12831807101710443149),
-	KQU(10548514914382545716), KQU( 2217806727199715993),
-	KQU(12627067369242845138), KQU( 4598965364035438158),
-	KQU(  150923352751318171), KQU(14274109544442257283),
-	KQU( 4696661475093863031), KQU( 1505764114384654516),
-	KQU(10699185831891495147), KQU( 2392353847713620519),
-	KQU( 3652870166711788383), KQU( 8640653276221911108),
-	KQU( 3894077592275889704), KQU( 4918592872135964845),
-	KQU(16379121273281400789), KQU(12058465483591683656),
-	KQU(11250106829302924945), KQU( 1147537556296983005),
-	KQU( 6376342756004613268), KQU(14967128191709280506),
-	KQU(18007449949790627628), KQU( 9497178279316537841),
-	KQU( 7920174844809394893), KQU(10037752595255719907),
-	KQU(15875342784985217697), KQU(15311615921712850696),
-	KQU( 9552902652110992950), KQU(14054979450099721140),
-	KQU( 5998709773566417349), KQU(18027910339276320187),
-	KQU( 8223099053868585554), KQU( 7842270354824999767),
-	KQU( 4896315688770080292), KQU(12969320296569787895),
-	KQU( 2674321489185759961), KQU( 4053615936864718439),
-	KQU(11349775270588617578), KQU( 4743019256284553975),
-	KQU( 5602100217469723769), KQU(14398995691411527813),
-	KQU( 7412170493796825470), KQU(  836262406131744846),
-	KQU( 8231086633845153022), KQU( 5161377920438552287),
-	KQU( 8828731196169924949), KQU(16211142246465502680),
-	KQU( 3307990879253687818), KQU( 5193405406899782022),
-	KQU( 8510842117467566693), KQU( 6070955181022405365),
-	KQU(14482950231361409799), KQU(12585159371331138077),
-	KQU( 3511537678933588148), KQU( 2041849474531116417),
-	KQU(10944936685095345792), KQU(18303116923079107729),
-	KQU( 2720566371239725320), KQU( 4958672473562397622),
-	KQU( 3032326668253243412), KQU(13689418691726908338),
-	KQU( 1895205511728843996), KQU( 8146303515271990527),
-	KQU(16507343500056113480), KQU(  473996939105902919),
-	KQU( 9897686885246881481), KQU(14606433762712790575),
-	KQU( 6732796251605566368), KQU( 1399778120855368916),
-	KQU(  935023885182833777), KQU(16066282816186753477),
-	KQU( 7291270991820612055), KQU(17530230393129853844),
-	KQU(10223493623477451366), KQU(15841725630495676683),
-	KQU(17379567246435515824), KQU( 8588251429375561971),
-	KQU(18339511210887206423), KQU(17349587430725976100),
-	KQU(12244876521394838088), KQU( 6382187714147161259),
-	KQU(12335807181848950831), KQU(16948885622305460665),
-	KQU(13755097796371520506), KQU(14806740373324947801),
-	KQU( 4828699633859287703), KQU( 8209879281452301604),
-	KQU(12435716669553736437), KQU(13970976859588452131),
-	KQU( 6233960842566773148), KQU(12507096267900505759),
-	KQU( 1198713114381279421), KQU(14989862731124149015),
-	KQU(15932189508707978949), KQU( 2526406641432708722),
-	KQU(   29187427817271982), KQU( 1499802773054556353),
-	KQU(10816638187021897173), KQU( 5436139270839738132),
-	KQU( 6659882287036010082), KQU( 2154048955317173697),
-	KQU(10887317019333757642), KQU(16281091802634424955),
-	KQU(10754549879915384901), KQU(10760611745769249815),
-	KQU( 2161505946972504002), KQU( 5243132808986265107),
-	KQU(10129852179873415416), KQU(  710339480008649081),
-	KQU( 7802129453068808528), KQU(17967213567178907213),
-	KQU(15730859124668605599), KQU(13058356168962376502),
-	KQU( 3701224985413645909), KQU(14464065869149109264),
-	KQU( 9959272418844311646), KQU(10157426099515958752),
-	KQU(14013736814538268528), KQU(17797456992065653951),
-	KQU(17418878140257344806), KQU(15457429073540561521),
-	KQU( 2184426881360949378), KQU( 2062193041154712416),
-	KQU( 8553463347406931661), KQU( 4913057625202871854),
-	KQU( 2668943682126618425), KQU(17064444737891172288),
-	KQU( 4997115903913298637), KQU(12019402608892327416),
-	KQU(17603584559765897352), KQU(11367529582073647975),
-	KQU( 8211476043518436050), KQU( 8676849804070323674),
-	KQU(18431829230394475730), KQU(10490177861361247904),
-	KQU( 9508720602025651349), KQU( 7409627448555722700),
-	KQU( 5804047018862729008), KQU(11943858176893142594),
-	KQU(11908095418933847092), KQU( 5415449345715887652),
-	KQU( 1554022699166156407), KQU( 9073322106406017161),
-	KQU( 7080630967969047082), KQU(18049736940860732943),
-	KQU(12748714242594196794), KQU( 1226992415735156741),
-	KQU(17900981019609531193), KQU(11720739744008710999),
-	KQU( 3006400683394775434), KQU(11347974011751996028),
-	KQU( 3316999628257954608), KQU( 8384484563557639101),
-	KQU(18117794685961729767), KQU( 1900145025596618194),
-	KQU(17459527840632892676), KQU( 5634784101865710994),
-	KQU( 7918619300292897158), KQU( 3146577625026301350),
-	KQU( 9955212856499068767), KQU( 1873995843681746975),
-	KQU( 1561487759967972194), KQU( 8322718804375878474),
-	KQU(11300284215327028366), KQU( 4667391032508998982),
-	KQU( 9820104494306625580), KQU(17922397968599970610),
-	KQU( 1784690461886786712), KQU(14940365084341346821),
-	KQU( 5348719575594186181), KQU(10720419084507855261),
-	KQU(14210394354145143274), KQU( 2426468692164000131),
-	KQU(16271062114607059202), KQU(14851904092357070247),
-	KQU( 6524493015693121897), KQU( 9825473835127138531),
-	KQU(14222500616268569578), KQU(15521484052007487468),
-	KQU(14462579404124614699), KQU(11012375590820665520),
-	KQU(11625327350536084927), KQU(14452017765243785417),
-	KQU( 9989342263518766305), KQU( 3640105471101803790),
-	KQU( 4749866455897513242), KQU(13963064946736312044),
-	KQU(10007416591973223791), KQU(18314132234717431115),
-	KQU( 3286596588617483450), KQU( 7726163455370818765),
-	KQU( 7575454721115379328), KQU( 5308331576437663422),
-	KQU(18288821894903530934), KQU( 8028405805410554106),
-	KQU(15744019832103296628), KQU(  149765559630932100),
-	KQU( 6137705557200071977), KQU(14513416315434803615),
-	KQU(11665702820128984473), KQU(  218926670505601386),
-	KQU( 6868675028717769519), KQU(15282016569441512302),
-	KQU( 5707000497782960236), KQU( 6671120586555079567),
-	KQU( 2194098052618985448), KQU(16849577895477330978),
-	KQU(12957148471017466283), KQU( 1997805535404859393),
-	KQU( 1180721060263860490), KQU(13206391310193756958),
-	KQU(12980208674461861797), KQU( 3825967775058875366),
-	KQU(17543433670782042631), KQU( 1518339070120322730),
-	KQU(16344584340890991669), KQU( 2611327165318529819),
-	KQU(11265022723283422529), KQU( 4001552800373196817),
-	KQU(14509595890079346161), KQU( 3528717165416234562),
-	KQU(18153222571501914072), KQU( 9387182977209744425),
-	KQU(10064342315985580021), KQU(11373678413215253977),
-	KQU( 2308457853228798099), KQU( 9729042942839545302),
-	KQU( 7833785471140127746), KQU( 6351049900319844436),
-	KQU(14454610627133496067), KQU(12533175683634819111),
-	KQU(15570163926716513029), KQU(13356980519185762498)
-};
-
-TEST_BEGIN(test_gen_rand_32) {
-	uint32_t array32[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
-	uint32_t array32_2[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
-	int i;
-	uint32_t r32;
-	sfmt_t *ctx;
-
-	assert_d_le(get_min_array_size32(), BLOCK_SIZE,
-	    "Array size too small");
-	ctx = init_gen_rand(1234);
-	fill_array32(ctx, array32, BLOCK_SIZE);
-	fill_array32(ctx, array32_2, BLOCK_SIZE);
-	fini_gen_rand(ctx);
-
-	ctx = init_gen_rand(1234);
-	for (i = 0; i < BLOCK_SIZE; i++) {
-		if (i < COUNT_1) {
-			assert_u32_eq(array32[i], init_gen_rand_32_expected[i],
-			    "Output mismatch for i=%d", i);
-		}
-		r32 = gen_rand32(ctx);
-		assert_u32_eq(r32, array32[i],
-		    "Mismatch at array32[%d]=%x, gen=%x", i, array32[i], r32);
-	}
-	for (i = 0; i < COUNT_2; i++) {
-		r32 = gen_rand32(ctx);
-		assert_u32_eq(r32, array32_2[i],
-		    "Mismatch at array32_2[%d]=%x, gen=%x", i, array32_2[i],
-		    r32);
-	}
-	fini_gen_rand(ctx);
-}
-TEST_END
-
-TEST_BEGIN(test_by_array_32) {
-	uint32_t array32[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
-	uint32_t array32_2[BLOCK_SIZE] JEMALLOC_ATTR(aligned(16));
-	int i;
-	uint32_t ini[4] = {0x1234, 0x5678, 0x9abc, 0xdef0};
-	uint32_t r32;
-	sfmt_t *ctx;
-
-	assert_d_le(get_min_array_size32(), BLOCK_SIZE,
-	    "Array size too small");
-	ctx = init_by_array(ini, 4);
-	fill_array32(ctx, array32, BLOCK_SIZE);
-	fill_array32(ctx, array32_2, BLOCK_SIZE);
-	fini_gen_rand(ctx);
-
-	ctx = init_by_array(ini, 4);
-	for (i = 0; i < BLOCK_SIZE; i++) {
-		if (i < COUNT_1) {
-			assert_u32_eq(array32[i], init_by_array_32_expected[i],
-			    "Output mismatch for i=%d", i);
-		}
-		r32 = gen_rand32(ctx);
-		assert_u32_eq(r32, array32[i],
-		    "Mismatch at array32[%d]=%x, gen=%x", i, array32[i], r32);
-	}
-	for (i = 0; i < COUNT_2; i++) {
-		r32 = gen_rand32(ctx);
-		assert_u32_eq(r32, array32_2[i],
-		    "Mismatch at array32_2[%d]=%x, gen=%x", i, array32_2[i],
-		    r32);
-	}
-	fini_gen_rand(ctx);
-}
-TEST_END
-
-TEST_BEGIN(test_gen_rand_64) {
-	uint64_t array64[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
-	uint64_t array64_2[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
-	int i;
-	uint64_t r;
-	sfmt_t *ctx;
-
-	assert_d_le(get_min_array_size64(), BLOCK_SIZE64,
-	    "Array size too small");
-	ctx = init_gen_rand(4321);
-	fill_array64(ctx, array64, BLOCK_SIZE64);
-	fill_array64(ctx, array64_2, BLOCK_SIZE64);
-	fini_gen_rand(ctx);
-
-	ctx = init_gen_rand(4321);
-	for (i = 0; i < BLOCK_SIZE64; i++) {
-		if (i < COUNT_1) {
-			assert_u64_eq(array64[i], init_gen_rand_64_expected[i],
-			    "Output mismatch for i=%d", i);
-		}
-		r = gen_rand64(ctx);
-		assert_u64_eq(r, array64[i],
-		    "Mismatch at array64[%d]=%"FMTx64", gen=%"FMTx64, i,
-		    array64[i], r);
-	}
-	for (i = 0; i < COUNT_2; i++) {
-		r = gen_rand64(ctx);
-		assert_u64_eq(r, array64_2[i],
-		    "Mismatch at array64_2[%d]=%"FMTx64" gen=%"FMTx64"", i,
-		    array64_2[i], r);
-	}
-	fini_gen_rand(ctx);
-}
-TEST_END
-
-TEST_BEGIN(test_by_array_64) {
-	uint64_t array64[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
-	uint64_t array64_2[BLOCK_SIZE64] JEMALLOC_ATTR(aligned(16));
-	int i;
-	uint64_t r;
-	uint32_t ini[] = {5, 4, 3, 2, 1};
-	sfmt_t *ctx;
-
-	assert_d_le(get_min_array_size64(), BLOCK_SIZE64,
-	    "Array size too small");
-	ctx = init_by_array(ini, 5);
-	fill_array64(ctx, array64, BLOCK_SIZE64);
-	fill_array64(ctx, array64_2, BLOCK_SIZE64);
-	fini_gen_rand(ctx);
-
-	ctx = init_by_array(ini, 5);
-	for (i = 0; i < BLOCK_SIZE64; i++) {
-		if (i < COUNT_1) {
-			assert_u64_eq(array64[i], init_by_array_64_expected[i],
-			    "Output mismatch for i=%d", i);
-		}
-		r = gen_rand64(ctx);
-		assert_u64_eq(r, array64[i],
-		    "Mismatch at array64[%d]=%"FMTx64" gen=%"FMTx64, i,
-		    array64[i], r);
-	}
-	for (i = 0; i < COUNT_2; i++) {
-		r = gen_rand64(ctx);
-		assert_u64_eq(r, array64_2[i],
-		    "Mismatch at array64_2[%d]=%"FMTx64" gen=%"FMTx64, i,
-		    array64_2[i], r);
-	}
-	fini_gen_rand(ctx);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_gen_rand_32,
-	    test_by_array_32,
-	    test_gen_rand_64,
-	    test_by_array_64);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/a0.c b/redis-stable/deps/jemalloc/test/unit/a0.c
deleted file mode 100644
index a27ab3f4..00000000
--- a/redis-stable/deps/jemalloc/test/unit/a0.c
+++ /dev/null
@@ -1,16 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_a0) {
-	void *p;
-
-	p = a0malloc(1);
-	assert_ptr_not_null(p, "Unexpected a0malloc() error");
-	a0dalloc(p);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_malloc_init(
-	    test_a0);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset.c b/redis-stable/deps/jemalloc/test/unit/arena_reset.c
deleted file mode 100644
index f5fb24d1..00000000
--- a/redis-stable/deps/jemalloc/test/unit/arena_reset.c
+++ /dev/null
@@ -1,344 +0,0 @@
-#ifndef ARENA_RESET_PROF_C_
-#include "test/jemalloc_test.h"
-#endif
-
-#include "jemalloc/internal/extent_mmap.h"
-#include "jemalloc/internal/rtree.h"
-
-#include "test/extent_hooks.h"
-
-static unsigned
-get_nsizes_impl(const char *cmd) {
-	unsigned ret;
-	size_t z;
-
-	z = sizeof(unsigned);
-	assert_d_eq(mallctl(cmd, (void *)&ret, &z, NULL, 0), 0,
-	    "Unexpected mallctl(\"%s\", ...) failure", cmd);
-
-	return ret;
-}
-
-static unsigned
-get_nsmall(void) {
-	return get_nsizes_impl("arenas.nbins");
-}
-
-static unsigned
-get_nlarge(void) {
-	return get_nsizes_impl("arenas.nlextents");
-}
-
-static size_t
-get_size_impl(const char *cmd, size_t ind) {
-	size_t ret;
-	size_t z;
-	size_t mib[4];
-	size_t miblen = 4;
-
-	z = sizeof(size_t);
-	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
-	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
-	mib[2] = ind;
-	z = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&ret, &z, NULL, 0),
-	    0, "Unexpected mallctlbymib([\"%s\", %zu], ...) failure", cmd, ind);
-
-	return ret;
-}
-
-static size_t
-get_small_size(size_t ind) {
-	return get_size_impl("arenas.bin.0.size", ind);
-}
-
-static size_t
-get_large_size(size_t ind) {
-	return get_size_impl("arenas.lextent.0.size", ind);
-}
-
-/* Like ivsalloc(), but safe to call on discarded allocations. */
-static size_t
-vsalloc(tsdn_t *tsdn, const void *ptr) {
-	rtree_ctx_t rtree_ctx_fallback;
-	rtree_ctx_t *rtree_ctx = tsdn_rtree_ctx(tsdn, &rtree_ctx_fallback);
-
-	extent_t *extent;
-	szind_t szind;
-	if (rtree_extent_szind_read(tsdn, &extents_rtree, rtree_ctx,
-	    (uintptr_t)ptr, false, &extent, &szind)) {
-		return 0;
-	}
-
-	if (extent == NULL) {
-		return 0;
-	}
-	if (extent_state_get(extent) != extent_state_active) {
-		return 0;
-	}
-
-	if (szind == NSIZES) {
-		return 0;
-	}
-
-	return sz_index2size(szind);
-}
-
-static unsigned
-do_arena_create(extent_hooks_t *h) {
-	unsigned arena_ind;
-	size_t sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
-	    (void *)(h != NULL ? &h : NULL), (h != NULL ? sizeof(h) : 0)), 0,
-	    "Unexpected mallctl() failure");
-	return arena_ind;
-}
-
-static void
-do_arena_reset_pre(unsigned arena_ind, void ***ptrs, unsigned *nptrs) {
-#define NLARGE	32
-	unsigned nsmall, nlarge, i;
-	size_t sz;
-	int flags;
-	tsdn_t *tsdn;
-
-	flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
-
-	nsmall = get_nsmall();
-	nlarge = get_nlarge() > NLARGE ? NLARGE : get_nlarge();
-	*nptrs = nsmall + nlarge;
-	*ptrs = (void **)malloc(*nptrs * sizeof(void *));
-	assert_ptr_not_null(*ptrs, "Unexpected malloc() failure");
-
-	/* Allocate objects with a wide range of sizes. */
-	for (i = 0; i < nsmall; i++) {
-		sz = get_small_size(i);
-		(*ptrs)[i] = mallocx(sz, flags);
-		assert_ptr_not_null((*ptrs)[i],
-		    "Unexpected mallocx(%zu, %#x) failure", sz, flags);
-	}
-	for (i = 0; i < nlarge; i++) {
-		sz = get_large_size(i);
-		(*ptrs)[nsmall + i] = mallocx(sz, flags);
-		assert_ptr_not_null((*ptrs)[i],
-		    "Unexpected mallocx(%zu, %#x) failure", sz, flags);
-	}
-
-	tsdn = tsdn_fetch();
-
-	/* Verify allocations. */
-	for (i = 0; i < *nptrs; i++) {
-		assert_zu_gt(ivsalloc(tsdn, (*ptrs)[i]), 0,
-		    "Allocation should have queryable size");
-	}
-}
-
-static void
-do_arena_reset_post(void **ptrs, unsigned nptrs, unsigned arena_ind) {
-	tsdn_t *tsdn;
-	unsigned i;
-
-	tsdn = tsdn_fetch();
-
-	if (have_background_thread) {
-		malloc_mutex_lock(tsdn,
-		    &background_thread_info[arena_ind % ncpus].mtx);
-	}
-	/* Verify allocations no longer exist. */
-	for (i = 0; i < nptrs; i++) {
-		assert_zu_eq(vsalloc(tsdn, ptrs[i]), 0,
-		    "Allocation should no longer exist");
-	}
-	if (have_background_thread) {
-		malloc_mutex_unlock(tsdn,
-		    &background_thread_info[arena_ind % ncpus].mtx);
-	}
-
-	free(ptrs);
-}
-
-static void
-do_arena_reset_destroy(const char *name, unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen;
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib(name, mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-static void
-do_arena_reset(unsigned arena_ind) {
-	do_arena_reset_destroy("arena.0.reset", arena_ind);
-}
-
-static void
-do_arena_destroy(unsigned arena_ind) {
-	do_arena_reset_destroy("arena.0.destroy", arena_ind);
-}
-
-TEST_BEGIN(test_arena_reset) {
-	unsigned arena_ind;
-	void **ptrs;
-	unsigned nptrs;
-
-	arena_ind = do_arena_create(NULL);
-	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
-	do_arena_reset(arena_ind);
-	do_arena_reset_post(ptrs, nptrs, arena_ind);
-}
-TEST_END
-
-static bool
-arena_i_initialized(unsigned arena_ind, bool refresh) {
-	bool initialized;
-	size_t mib[3];
-	size_t miblen, sz;
-
-	if (refresh) {
-		uint64_t epoch = 1;
-		assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
-		    sizeof(epoch)), 0, "Unexpected mallctl() failure");
-	}
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.initialized", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	sz = sizeof(initialized);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&initialized, &sz, NULL,
-	    0), 0, "Unexpected mallctlbymib() failure");
-
-	return initialized;
-}
-
-TEST_BEGIN(test_arena_destroy_initial) {
-	assert_false(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
-	    "Destroyed arena stats should not be initialized");
-}
-TEST_END
-
-TEST_BEGIN(test_arena_destroy_hooks_default) {
-	unsigned arena_ind, arena_ind_another, arena_ind_prev;
-	void **ptrs;
-	unsigned nptrs;
-
-	arena_ind = do_arena_create(NULL);
-	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
-
-	assert_false(arena_i_initialized(arena_ind, false),
-	    "Arena stats should not be initialized");
-	assert_true(arena_i_initialized(arena_ind, true),
-	    "Arena stats should be initialized");
-
-	/*
-	 * Create another arena before destroying one, to better verify arena
-	 * index reuse.
-	 */
-	arena_ind_another = do_arena_create(NULL);
-
-	do_arena_destroy(arena_ind);
-
-	assert_false(arena_i_initialized(arena_ind, true),
-	    "Arena stats should not be initialized");
-	assert_true(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
-	    "Destroyed arena stats should be initialized");
-
-	do_arena_reset_post(ptrs, nptrs, arena_ind);
-
-	arena_ind_prev = arena_ind;
-	arena_ind = do_arena_create(NULL);
-	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
-	assert_u_eq(arena_ind, arena_ind_prev,
-	    "Arena index should have been recycled");
-	do_arena_destroy(arena_ind);
-	do_arena_reset_post(ptrs, nptrs, arena_ind);
-
-	do_arena_destroy(arena_ind_another);
-}
-TEST_END
-
-/*
- * Actually unmap extents, regardless of opt_retain, so that attempts to access
- * a destroyed arena's memory will segfault.
- */
-static bool
-extent_dalloc_unmap(extent_hooks_t *extent_hooks, void *addr, size_t size,
-    bool committed, unsigned arena_ind) {
-	TRACE_HOOK("%s(extent_hooks=%p, addr=%p, size=%zu, committed=%s, "
-	    "arena_ind=%u)\n", __func__, extent_hooks, addr, size, committed ?
-	    "true" : "false", arena_ind);
-	assert_ptr_eq(extent_hooks, &hooks,
-	    "extent_hooks should be same as pointer used to set hooks");
-	assert_ptr_eq(extent_hooks->dalloc, extent_dalloc_unmap,
-	    "Wrong hook function");
-	called_dalloc = true;
-	if (!try_dalloc) {
-		return true;
-	}
-	pages_unmap(addr, size);
-	did_dalloc = true;
-	return false;
-}
-
-static extent_hooks_t hooks_orig;
-
-static extent_hooks_t hooks_unmap = {
-	extent_alloc_hook,
-	extent_dalloc_unmap, /* dalloc */
-	extent_destroy_hook,
-	extent_commit_hook,
-	extent_decommit_hook,
-	extent_purge_lazy_hook,
-	extent_purge_forced_hook,
-	extent_split_hook,
-	extent_merge_hook
-};
-
-TEST_BEGIN(test_arena_destroy_hooks_unmap) {
-	unsigned arena_ind;
-	void **ptrs;
-	unsigned nptrs;
-
-	extent_hooks_prep();
-	try_decommit = false;
-	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
-	memcpy(&hooks, &hooks_unmap, sizeof(extent_hooks_t));
-
-	did_alloc = false;
-	arena_ind = do_arena_create(&hooks);
-	do_arena_reset_pre(arena_ind, &ptrs, &nptrs);
-
-	assert_true(did_alloc, "Expected alloc");
-
-	assert_false(arena_i_initialized(arena_ind, false),
-	    "Arena stats should not be initialized");
-	assert_true(arena_i_initialized(arena_ind, true),
-	    "Arena stats should be initialized");
-
-	did_dalloc = false;
-	do_arena_destroy(arena_ind);
-	assert_true(did_dalloc, "Expected dalloc");
-
-	assert_false(arena_i_initialized(arena_ind, true),
-	    "Arena stats should not be initialized");
-	assert_true(arena_i_initialized(MALLCTL_ARENAS_DESTROYED, false),
-	    "Destroyed arena stats should be initialized");
-
-	do_arena_reset_post(ptrs, nptrs, arena_ind);
-
-	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_arena_reset,
-	    test_arena_destroy_initial,
-	    test_arena_destroy_hooks_default,
-	    test_arena_destroy_hooks_unmap);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
deleted file mode 100644
index 38d80124..00000000
--- a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.c
+++ /dev/null
@@ -1,4 +0,0 @@
-#include "test/jemalloc_test.h"
-#define ARENA_RESET_PROF_C_
-
-#include "arena_reset.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh b/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
deleted file mode 100644
index 041dc1c3..00000000
--- a/redis-stable/deps/jemalloc/test/unit/arena_reset_prof.sh
+++ /dev/null
@@ -1,3 +0,0 @@
-#!/bin/sh
-
-export MALLOC_CONF="prof:true,lg_prof_sample:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/atomic.c b/redis-stable/deps/jemalloc/test/unit/atomic.c
deleted file mode 100644
index 572d8d23..00000000
--- a/redis-stable/deps/jemalloc/test/unit/atomic.c
+++ /dev/null
@@ -1,229 +0,0 @@
-#include "test/jemalloc_test.h"
-
-/*
- * We *almost* have consistent short names (e.g. "u32" for uint32_t, "b" for
- * bool, etc.  The one exception is that the short name for void * is "p" in
- * some places and "ptr" in others.  In the long run it would be nice to unify
- * these, but in the short run we'll use this shim.
- */
-#define assert_p_eq assert_ptr_eq
-
-/*
- * t: the non-atomic type, like "uint32_t".
- * ta: the short name for the type, like "u32".
- * val[1,2,3]: Values of the given type.  The CAS tests use val2 for expected,
- * and val3 for desired.
- */
-
-#define DO_TESTS(t, ta, val1, val2, val3) do {				\
-	t val;								\
-	t expected;							\
-	bool success;							\
-	/* This (along with the load below) also tests ATOMIC_LOAD. */	\
-	atomic_##ta##_t atom = ATOMIC_INIT(val1);			\
-									\
-	/* ATOMIC_INIT and load. */					\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1, val, "Load or init failed");		\
-									\
-	/* Store. */							\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	atomic_store_##ta(&atom, val2, ATOMIC_RELAXED);			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val2, val, "Store failed");			\
-									\
-	/* Exchange. */							\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_exchange_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val, "Exchange returned invalid value");	\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val2, val, "Exchange store invalid value");	\
-									\
-	/* 								\
-	 * Weak CAS.  Spurious failures are allowed, so we loop a few	\
-	 * times.							\
-	 */								\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	success = false;						\
-	for (int i = 0; i < 10 && !success; i++) {			\
-		expected = val2;					\
-		success = atomic_compare_exchange_weak_##ta(&atom,	\
-		    &expected, val3, ATOMIC_RELAXED, ATOMIC_RELAXED);	\
-		assert_##ta##_eq(val1, expected, 			\
-		    "CAS should update expected");			\
-	}								\
-	assert_b_eq(val1 == val2, success,				\
-	    "Weak CAS did the wrong state update");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	if (success) {							\
-		assert_##ta##_eq(val3, val,				\
-		    "Successful CAS should update atomic");		\
-	} else {							\
-		assert_##ta##_eq(val1, val,				\
-		    "Unsuccessful CAS should not update atomic");	\
-	}								\
-									\
-	/* Strong CAS. */						\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	expected = val2;						\
-	success = atomic_compare_exchange_strong_##ta(&atom, &expected,	\
-	    val3, ATOMIC_RELAXED, ATOMIC_RELAXED);			\
-	assert_b_eq(val1 == val2, success,				\
-	    "Strong CAS did the wrong state update");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	if (success) {							\
-		assert_##ta##_eq(val3, val,				\
-		    "Successful CAS should update atomic");		\
-	} else {							\
-		assert_##ta##_eq(val1, val,				\
-		    "Unsuccessful CAS should not update atomic");	\
-	}								\
-									\
-									\
-} while (0)
-
-#define DO_INTEGER_TESTS(t, ta, val1, val2) do {			\
-	atomic_##ta##_t atom;						\
-	t val;								\
-									\
-	/* Fetch-add. */						\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_fetch_add_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val,					\
-	    "Fetch-add should return previous value");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1 + val2, val,				\
-	    "Fetch-add should update atomic");				\
-									\
-	/* Fetch-sub. */						\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_fetch_sub_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val,					\
-	    "Fetch-sub should return previous value");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1 - val2, val,				\
-	    "Fetch-sub should update atomic");				\
-									\
-	/* Fetch-and. */						\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_fetch_and_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val,					\
-	    "Fetch-and should return previous value");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1 & val2, val,				\
-	    "Fetch-and should update atomic");				\
-									\
-	/* Fetch-or. */							\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_fetch_or_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val,					\
-	    "Fetch-or should return previous value");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1 | val2, val,				\
-	    "Fetch-or should update atomic");				\
-									\
-	/* Fetch-xor. */						\
-	atomic_store_##ta(&atom, val1, ATOMIC_RELAXED);			\
-	val = atomic_fetch_xor_##ta(&atom, val2, ATOMIC_RELAXED);	\
-	assert_##ta##_eq(val1, val,					\
-	    "Fetch-xor should return previous value");			\
-	val = atomic_load_##ta(&atom, ATOMIC_RELAXED);			\
-	assert_##ta##_eq(val1 ^ val2, val,				\
-	    "Fetch-xor should update atomic");				\
-} while (0)
-
-#define TEST_STRUCT(t, ta)						\
-typedef struct {							\
-	t val1;								\
-	t val2;								\
-	t val3;								\
-} ta##_test_t;
-
-#define TEST_CASES(t) {							\
-	{(t)-1, (t)-1, (t)-2},						\
-	{(t)-1, (t) 0, (t)-2},						\
-	{(t)-1, (t) 1, (t)-2},						\
-									\
-	{(t) 0, (t)-1, (t)-2},						\
-	{(t) 0, (t) 0, (t)-2},						\
-	{(t) 0, (t) 1, (t)-2},						\
-									\
-	{(t) 1, (t)-1, (t)-2},						\
-	{(t) 1, (t) 0, (t)-2},						\
-	{(t) 1, (t) 1, (t)-2},						\
-									\
-	{(t)0, (t)-(1 << 22), (t)-2},					\
-	{(t)0, (t)(1 << 22), (t)-2},					\
-	{(t)(1 << 22), (t)-(1 << 22), (t)-2},				\
-	{(t)(1 << 22), (t)(1 << 22), (t)-2}				\
-}
-
-#define TEST_BODY(t, ta) do {						\
-	const ta##_test_t tests[] = TEST_CASES(t);			\
-	for (unsigned i = 0; i < sizeof(tests)/sizeof(tests[0]); i++) {	\
-		ta##_test_t test = tests[i];				\
-		DO_TESTS(t, ta, test.val1, test.val2, test.val3);	\
-	}								\
-} while (0)
-
-#define INTEGER_TEST_BODY(t, ta) do {					\
-	const ta##_test_t tests[] = TEST_CASES(t);			\
-	for (unsigned i = 0; i < sizeof(tests)/sizeof(tests[0]); i++) {	\
-		ta##_test_t test = tests[i];				\
-		DO_TESTS(t, ta, test.val1, test.val2, test.val3);	\
-		DO_INTEGER_TESTS(t, ta, test.val1, test.val2);		\
-	}								\
-} while (0)
-
-TEST_STRUCT(uint64_t, u64);
-TEST_BEGIN(test_atomic_u64) {
-#if !(LG_SIZEOF_PTR == 3 || LG_SIZEOF_INT == 3)
-	test_skip("64-bit atomic operations not supported");
-#else
-	INTEGER_TEST_BODY(uint64_t, u64);
-#endif
-}
-TEST_END
-
-
-TEST_STRUCT(uint32_t, u32);
-TEST_BEGIN(test_atomic_u32) {
-	INTEGER_TEST_BODY(uint32_t, u32);
-}
-TEST_END
-
-TEST_STRUCT(void *, p);
-TEST_BEGIN(test_atomic_p) {
-	TEST_BODY(void *, p);
-}
-TEST_END
-
-TEST_STRUCT(size_t, zu);
-TEST_BEGIN(test_atomic_zu) {
-	INTEGER_TEST_BODY(size_t, zu);
-}
-TEST_END
-
-TEST_STRUCT(ssize_t, zd);
-TEST_BEGIN(test_atomic_zd) {
-	INTEGER_TEST_BODY(ssize_t, zd);
-}
-TEST_END
-
-
-TEST_STRUCT(unsigned, u);
-TEST_BEGIN(test_atomic_u) {
-	INTEGER_TEST_BODY(unsigned, u);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_atomic_u64,
-	    test_atomic_u32,
-	    test_atomic_p,
-	    test_atomic_zu,
-	    test_atomic_zd,
-	    test_atomic_u);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/background_thread.c b/redis-stable/deps/jemalloc/test/unit/background_thread.c
deleted file mode 100644
index f7bd37c4..00000000
--- a/redis-stable/deps/jemalloc/test/unit/background_thread.c
+++ /dev/null
@@ -1,119 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/util.h"
-
-static void
-test_switch_background_thread_ctl(bool new_val) {
-	bool e0, e1;
-	size_t sz = sizeof(bool);
-
-	e1 = new_val;
-	assert_d_eq(mallctl("background_thread", (void *)&e0, &sz,
-	    &e1, sz), 0, "Unexpected mallctl() failure");
-	assert_b_eq(e0, !e1,
-	    "background_thread should be %d before.\n", !e1);
-	if (e1) {
-		assert_zu_gt(n_background_threads, 0,
-		    "Number of background threads should be non zero.\n");
-	} else {
-		assert_zu_eq(n_background_threads, 0,
-		    "Number of background threads should be zero.\n");
-	}
-}
-
-static void
-test_repeat_background_thread_ctl(bool before) {
-	bool e0, e1;
-	size_t sz = sizeof(bool);
-
-	e1 = before;
-	assert_d_eq(mallctl("background_thread", (void *)&e0, &sz,
-	    &e1, sz), 0, "Unexpected mallctl() failure");
-	assert_b_eq(e0, before,
-	    "background_thread should be %d.\n", before);
-	if (e1) {
-		assert_zu_gt(n_background_threads, 0,
-		    "Number of background threads should be non zero.\n");
-	} else {
-		assert_zu_eq(n_background_threads, 0,
-		    "Number of background threads should be zero.\n");
-	}
-}
-
-TEST_BEGIN(test_background_thread_ctl) {
-	test_skip_if(!have_background_thread);
-
-	bool e0, e1;
-	size_t sz = sizeof(bool);
-
-	assert_d_eq(mallctl("opt.background_thread", (void *)&e0, &sz,
-	    NULL, 0), 0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctl("background_thread", (void *)&e1, &sz,
-	    NULL, 0), 0, "Unexpected mallctl() failure");
-	assert_b_eq(e0, e1,
-	    "Default and opt.background_thread does not match.\n");
-	if (e0) {
-		test_switch_background_thread_ctl(false);
-	}
-	assert_zu_eq(n_background_threads, 0,
-	    "Number of background threads should be 0.\n");
-
-	for (unsigned i = 0; i < 4; i++) {
-		test_switch_background_thread_ctl(true);
-		test_repeat_background_thread_ctl(true);
-		test_repeat_background_thread_ctl(true);
-
-		test_switch_background_thread_ctl(false);
-		test_repeat_background_thread_ctl(false);
-		test_repeat_background_thread_ctl(false);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_background_thread_running) {
-	test_skip_if(!have_background_thread);
-	test_skip_if(!config_stats);
-
-#if defined(JEMALLOC_BACKGROUND_THREAD)
-	tsd_t *tsd = tsd_fetch();
-	background_thread_info_t *info = &background_thread_info[0];
-
-	test_repeat_background_thread_ctl(false);
-	test_switch_background_thread_ctl(true);
-	assert_b_eq(info->state, background_thread_started,
-	    "Background_thread did not start.\n");
-
-	nstime_t start, now;
-	nstime_init(&start, 0);
-	nstime_update(&start);
-
-	bool ran = false;
-	while (true) {
-		malloc_mutex_lock(tsd_tsdn(tsd), &info->mtx);
-		if (info->tot_n_runs > 0) {
-			ran = true;
-		}
-		malloc_mutex_unlock(tsd_tsdn(tsd), &info->mtx);
-		if (ran) {
-			break;
-		}
-
-		nstime_init(&now, 0);
-		nstime_update(&now);
-		nstime_subtract(&now, &start);
-		assert_u64_lt(nstime_sec(&now), 1000,
-		    "Background threads did not run for 1000 seconds.");
-		sleep(1);
-	}
-	test_switch_background_thread_ctl(false);
-#endif
-}
-TEST_END
-
-int
-main(void) {
-	/* Background_thread creation tests reentrancy naturally. */
-	return test_no_reentrancy(
-	    test_background_thread_ctl,
-	    test_background_thread_running);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c b/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
deleted file mode 100644
index ff95e672..00000000
--- a/redis-stable/deps/jemalloc/test/unit/background_thread_enable.c
+++ /dev/null
@@ -1,83 +0,0 @@
-#include "test/jemalloc_test.h"
-
-const char *malloc_conf = "background_thread:false,narenas:1,max_background_threads:20";
-
-TEST_BEGIN(test_deferred) {
-	test_skip_if(!have_background_thread);
-
-	unsigned id;
-	size_t sz_u = sizeof(unsigned);
-
-	/*
-	 * 10 here is somewhat arbitrary, except insofar as we want to ensure
-	 * that the number of background threads is smaller than the number of
-	 * arenas.  I'll ragequit long before we have to spin up 10 threads per
-	 * cpu to handle background purging, so this is a conservative
-	 * approximation.
-	 */
-	for (unsigned i = 0; i < 10 * ncpus; i++) {
-		assert_d_eq(mallctl("arenas.create", &id, &sz_u, NULL, 0), 0,
-		    "Failed to create arena");
-	}
-
-	bool enable = true;
-	size_t sz_b = sizeof(bool);
-	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
-	    "Failed to enable background threads");
-	enable = false;
-	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
-	    "Failed to disable background threads");
-}
-TEST_END
-
-TEST_BEGIN(test_max_background_threads) {
-	test_skip_if(!have_background_thread);
-
-	size_t maxt;
-	size_t opt_maxt;
-	size_t sz_m = sizeof(maxt);
-	assert_d_eq(mallctl("opt.max_background_threads",
-			    &opt_maxt, &sz_m, NULL, 0), 0,
-			    "Failed to get opt.max_background_threads");
-	assert_d_eq(mallctl("max_background_threads", &maxt, &sz_m, NULL, 0), 0,
-		    "Failed to get max background threads");
-	assert_zu_eq(20, maxt, "should be ncpus");
-	assert_zu_eq(opt_maxt, maxt,
-		     "max_background_threads and "
-		     "opt.max_background_threads should match");
-	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
-		    0, "Failed to set max background threads");
-
-	unsigned id;
-	size_t sz_u = sizeof(unsigned);
-
-	for (unsigned i = 0; i < 10 * ncpus; i++) {
-		assert_d_eq(mallctl("arenas.create", &id, &sz_u, NULL, 0), 0,
-		    "Failed to create arena");
-	}
-
-	bool enable = true;
-	size_t sz_b = sizeof(bool);
-	assert_d_eq(mallctl("background_thread", NULL, NULL, &enable, sz_b), 0,
-	    "Failed to enable background threads");
-	assert_zu_eq(n_background_threads, maxt,
-		     "Number of background threads should be 3.\n");
-	maxt = 10;
-	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
-		    0, "Failed to set max background threads");
-	assert_zu_eq(n_background_threads, maxt,
-		     "Number of background threads should be 10.\n");
-	maxt = 3;
-	assert_d_eq(mallctl("max_background_threads", NULL, NULL, &maxt, sz_m),
-		    0, "Failed to set max background threads");
-	assert_zu_eq(n_background_threads, maxt,
-		     "Number of background threads should be 3.\n");
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-		test_deferred,
-		test_max_background_threads);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/base.c b/redis-stable/deps/jemalloc/test/unit/base.c
deleted file mode 100644
index 6b792cf2..00000000
--- a/redis-stable/deps/jemalloc/test/unit/base.c
+++ /dev/null
@@ -1,234 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "test/extent_hooks.h"
-
-static extent_hooks_t hooks_null = {
-	extent_alloc_hook,
-	NULL, /* dalloc */
-	NULL, /* destroy */
-	NULL, /* commit */
-	NULL, /* decommit */
-	NULL, /* purge_lazy */
-	NULL, /* purge_forced */
-	NULL, /* split */
-	NULL /* merge */
-};
-
-static extent_hooks_t hooks_not_null = {
-	extent_alloc_hook,
-	extent_dalloc_hook,
-	extent_destroy_hook,
-	NULL, /* commit */
-	extent_decommit_hook,
-	extent_purge_lazy_hook,
-	extent_purge_forced_hook,
-	NULL, /* split */
-	NULL /* merge */
-};
-
-TEST_BEGIN(test_base_hooks_default) {
-	base_t *base;
-	size_t allocated0, allocated1, resident, mapped, n_thp;
-
-	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
-	base = base_new(tsdn, 0, (extent_hooks_t *)&extent_hooks_default);
-
-	if (config_stats) {
-		base_stats_get(tsdn, base, &allocated0, &resident, &mapped,
-		    &n_thp);
-		assert_zu_ge(allocated0, sizeof(base_t),
-		    "Base header should count as allocated");
-		if (opt_metadata_thp == metadata_thp_always) {
-			assert_zu_gt(n_thp, 0,
-			    "Base should have 1 THP at least.");
-		}
-	}
-
-	assert_ptr_not_null(base_alloc(tsdn, base, 42, 1),
-	    "Unexpected base_alloc() failure");
-
-	if (config_stats) {
-		base_stats_get(tsdn, base, &allocated1, &resident, &mapped,
-		    &n_thp);
-		assert_zu_ge(allocated1 - allocated0, 42,
-		    "At least 42 bytes were allocated by base_alloc()");
-	}
-
-	base_delete(tsdn, base);
-}
-TEST_END
-
-TEST_BEGIN(test_base_hooks_null) {
-	extent_hooks_t hooks_orig;
-	base_t *base;
-	size_t allocated0, allocated1, resident, mapped, n_thp;
-
-	extent_hooks_prep();
-	try_dalloc = false;
-	try_destroy = true;
-	try_decommit = false;
-	try_purge_lazy = false;
-	try_purge_forced = false;
-	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
-	memcpy(&hooks, &hooks_null, sizeof(extent_hooks_t));
-
-	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
-	base = base_new(tsdn, 0, &hooks);
-	assert_ptr_not_null(base, "Unexpected base_new() failure");
-
-	if (config_stats) {
-		base_stats_get(tsdn, base, &allocated0, &resident, &mapped,
-		    &n_thp);
-		assert_zu_ge(allocated0, sizeof(base_t),
-		    "Base header should count as allocated");
-		if (opt_metadata_thp == metadata_thp_always) {
-			assert_zu_gt(n_thp, 0,
-			    "Base should have 1 THP at least.");
-		}
-	}
-
-	assert_ptr_not_null(base_alloc(tsdn, base, 42, 1),
-	    "Unexpected base_alloc() failure");
-
-	if (config_stats) {
-		base_stats_get(tsdn, base, &allocated1, &resident, &mapped,
-		    &n_thp);
-		assert_zu_ge(allocated1 - allocated0, 42,
-		    "At least 42 bytes were allocated by base_alloc()");
-	}
-
-	base_delete(tsdn, base);
-
-	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
-}
-TEST_END
-
-TEST_BEGIN(test_base_hooks_not_null) {
-	extent_hooks_t hooks_orig;
-	base_t *base;
-	void *p, *q, *r, *r_exp;
-
-	extent_hooks_prep();
-	try_dalloc = false;
-	try_destroy = true;
-	try_decommit = false;
-	try_purge_lazy = false;
-	try_purge_forced = false;
-	memcpy(&hooks_orig, &hooks, sizeof(extent_hooks_t));
-	memcpy(&hooks, &hooks_not_null, sizeof(extent_hooks_t));
-
-	tsdn_t *tsdn = tsd_tsdn(tsd_fetch());
-	did_alloc = false;
-	base = base_new(tsdn, 0, &hooks);
-	assert_ptr_not_null(base, "Unexpected base_new() failure");
-	assert_true(did_alloc, "Expected alloc");
-
-	/*
-	 * Check for tight packing at specified alignment under simple
-	 * conditions.
-	 */
-	{
-		const size_t alignments[] = {
-			1,
-			QUANTUM,
-			QUANTUM << 1,
-			CACHELINE,
-			CACHELINE << 1,
-		};
-		unsigned i;
-
-		for (i = 0; i < sizeof(alignments) / sizeof(size_t); i++) {
-			size_t alignment = alignments[i];
-			size_t align_ceil = ALIGNMENT_CEILING(alignment,
-			    QUANTUM);
-			p = base_alloc(tsdn, base, 1, alignment);
-			assert_ptr_not_null(p,
-			    "Unexpected base_alloc() failure");
-			assert_ptr_eq(p,
-			    (void *)(ALIGNMENT_CEILING((uintptr_t)p,
-			    alignment)), "Expected quantum alignment");
-			q = base_alloc(tsdn, base, alignment, alignment);
-			assert_ptr_not_null(q,
-			    "Unexpected base_alloc() failure");
-			assert_ptr_eq((void *)((uintptr_t)p + align_ceil), q,
-			    "Minimal allocation should take up %zu bytes",
-			    align_ceil);
-			r = base_alloc(tsdn, base, 1, alignment);
-			assert_ptr_not_null(r,
-			    "Unexpected base_alloc() failure");
-			assert_ptr_eq((void *)((uintptr_t)q + align_ceil), r,
-			    "Minimal allocation should take up %zu bytes",
-			    align_ceil);
-		}
-	}
-
-	/*
-	 * Allocate an object that cannot fit in the first block, then verify
-	 * that the first block's remaining space is considered for subsequent
-	 * allocation.
-	 */
-	assert_zu_ge(extent_bsize_get(&base->blocks->extent), QUANTUM,
-	    "Remainder insufficient for test");
-	/* Use up all but one quantum of block. */
-	while (extent_bsize_get(&base->blocks->extent) > QUANTUM) {
-		p = base_alloc(tsdn, base, QUANTUM, QUANTUM);
-		assert_ptr_not_null(p, "Unexpected base_alloc() failure");
-	}
-	r_exp = extent_addr_get(&base->blocks->extent);
-	assert_zu_eq(base->extent_sn_next, 1, "One extant block expected");
-	q = base_alloc(tsdn, base, QUANTUM + 1, QUANTUM);
-	assert_ptr_not_null(q, "Unexpected base_alloc() failure");
-	assert_ptr_ne(q, r_exp, "Expected allocation from new block");
-	assert_zu_eq(base->extent_sn_next, 2, "Two extant blocks expected");
-	r = base_alloc(tsdn, base, QUANTUM, QUANTUM);
-	assert_ptr_not_null(r, "Unexpected base_alloc() failure");
-	assert_ptr_eq(r, r_exp, "Expected allocation from first block");
-	assert_zu_eq(base->extent_sn_next, 2, "Two extant blocks expected");
-
-	/*
-	 * Check for proper alignment support when normal blocks are too small.
-	 */
-	{
-		const size_t alignments[] = {
-			HUGEPAGE,
-			HUGEPAGE << 1
-		};
-		unsigned i;
-
-		for (i = 0; i < sizeof(alignments) / sizeof(size_t); i++) {
-			size_t alignment = alignments[i];
-			p = base_alloc(tsdn, base, QUANTUM, alignment);
-			assert_ptr_not_null(p,
-			    "Unexpected base_alloc() failure");
-			assert_ptr_eq(p,
-			    (void *)(ALIGNMENT_CEILING((uintptr_t)p,
-			    alignment)), "Expected %zu-byte alignment",
-			    alignment);
-		}
-	}
-
-	called_dalloc = called_destroy = called_decommit = called_purge_lazy =
-	    called_purge_forced = false;
-	base_delete(tsdn, base);
-	assert_true(called_dalloc, "Expected dalloc call");
-	assert_true(!called_destroy, "Unexpected destroy call");
-	assert_true(called_decommit, "Expected decommit call");
-	assert_true(called_purge_lazy, "Expected purge_lazy call");
-	assert_true(called_purge_forced, "Expected purge_forced call");
-
-	try_dalloc = true;
-	try_destroy = true;
-	try_decommit = true;
-	try_purge_lazy = true;
-	try_purge_forced = true;
-	memcpy(&hooks, &hooks_orig, sizeof(extent_hooks_t));
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_base_hooks_default,
-	    test_base_hooks_null,
-	    test_base_hooks_not_null);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/bit_util.c b/redis-stable/deps/jemalloc/test/unit/bit_util.c
deleted file mode 100644
index 42a97013..00000000
--- a/redis-stable/deps/jemalloc/test/unit/bit_util.c
+++ /dev/null
@@ -1,57 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/bit_util.h"
-
-#define TEST_POW2_CEIL(t, suf, pri) do {				\
-	unsigned i, pow2;						\
-	t x;								\
-									\
-	assert_##suf##_eq(pow2_ceil_##suf(0), 0, "Unexpected result");	\
-									\
-	for (i = 0; i < sizeof(t) * 8; i++) {				\
-		assert_##suf##_eq(pow2_ceil_##suf(((t)1) << i), ((t)1)	\
-		    << i, "Unexpected result");				\
-	}								\
-									\
-	for (i = 2; i < sizeof(t) * 8; i++) {				\
-		assert_##suf##_eq(pow2_ceil_##suf((((t)1) << i) - 1),	\
-		    ((t)1) << i, "Unexpected result");			\
-	}								\
-									\
-	for (i = 0; i < sizeof(t) * 8 - 1; i++) {			\
-		assert_##suf##_eq(pow2_ceil_##suf((((t)1) << i) + 1),	\
-		    ((t)1) << (i+1), "Unexpected result");		\
-	}								\
-									\
-	for (pow2 = 1; pow2 < 25; pow2++) {				\
-		for (x = (((t)1) << (pow2-1)) + 1; x <= ((t)1) << pow2;	\
-		    x++) {						\
-			assert_##suf##_eq(pow2_ceil_##suf(x),		\
-			    ((t)1) << pow2,				\
-			    "Unexpected result, x=%"pri, x);		\
-		}							\
-	}								\
-} while (0)
-
-TEST_BEGIN(test_pow2_ceil_u64) {
-	TEST_POW2_CEIL(uint64_t, u64, FMTu64);
-}
-TEST_END
-
-TEST_BEGIN(test_pow2_ceil_u32) {
-	TEST_POW2_CEIL(uint32_t, u32, FMTu32);
-}
-TEST_END
-
-TEST_BEGIN(test_pow2_ceil_zu) {
-	TEST_POW2_CEIL(size_t, zu, "zu");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_pow2_ceil_u64,
-	    test_pow2_ceil_u32,
-	    test_pow2_ceil_zu);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/bitmap.c b/redis-stable/deps/jemalloc/test/unit/bitmap.c
deleted file mode 100644
index cafb2039..00000000
--- a/redis-stable/deps/jemalloc/test/unit/bitmap.c
+++ /dev/null
@@ -1,431 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NBITS_TAB \
-    NB( 1) \
-    NB( 2) \
-    NB( 3) \
-    NB( 4) \
-    NB( 5) \
-    NB( 6) \
-    NB( 7) \
-    NB( 8) \
-    NB( 9) \
-    NB(10) \
-    NB(11) \
-    NB(12) \
-    NB(13) \
-    NB(14) \
-    NB(15) \
-    NB(16) \
-    NB(17) \
-    NB(18) \
-    NB(19) \
-    NB(20) \
-    NB(21) \
-    NB(22) \
-    NB(23) \
-    NB(24) \
-    NB(25) \
-    NB(26) \
-    NB(27) \
-    NB(28) \
-    NB(29) \
-    NB(30) \
-    NB(31) \
-    NB(32) \
-    \
-    NB(33) \
-    NB(34) \
-    NB(35) \
-    NB(36) \
-    NB(37) \
-    NB(38) \
-    NB(39) \
-    NB(40) \
-    NB(41) \
-    NB(42) \
-    NB(43) \
-    NB(44) \
-    NB(45) \
-    NB(46) \
-    NB(47) \
-    NB(48) \
-    NB(49) \
-    NB(50) \
-    NB(51) \
-    NB(52) \
-    NB(53) \
-    NB(54) \
-    NB(55) \
-    NB(56) \
-    NB(57) \
-    NB(58) \
-    NB(59) \
-    NB(60) \
-    NB(61) \
-    NB(62) \
-    NB(63) \
-    NB(64) \
-    NB(65) \
-    \
-    NB(126) \
-    NB(127) \
-    NB(128) \
-    NB(129) \
-    NB(130) \
-    \
-    NB(254) \
-    NB(255) \
-    NB(256) \
-    NB(257) \
-    NB(258) \
-    \
-    NB(510) \
-    NB(511) \
-    NB(512) \
-    NB(513) \
-    NB(514) \
-    \
-    NB(1024) \
-    NB(2048) \
-    NB(4096) \
-    NB(8192) \
-    NB(16384) \
-
-static void
-test_bitmap_initializer_body(const bitmap_info_t *binfo, size_t nbits) {
-	bitmap_info_t binfo_dyn;
-	bitmap_info_init(&binfo_dyn, nbits);
-
-	assert_zu_eq(bitmap_size(binfo), bitmap_size(&binfo_dyn),
-	    "Unexpected difference between static and dynamic initialization, "
-	    "nbits=%zu", nbits);
-	assert_zu_eq(binfo->nbits, binfo_dyn.nbits,
-	    "Unexpected difference between static and dynamic initialization, "
-	    "nbits=%zu", nbits);
-#ifdef BITMAP_USE_TREE
-	assert_u_eq(binfo->nlevels, binfo_dyn.nlevels,
-	    "Unexpected difference between static and dynamic initialization, "
-	    "nbits=%zu", nbits);
-	{
-		unsigned i;
-
-		for (i = 0; i < binfo->nlevels; i++) {
-			assert_zu_eq(binfo->levels[i].group_offset,
-			    binfo_dyn.levels[i].group_offset,
-			    "Unexpected difference between static and dynamic "
-			    "initialization, nbits=%zu, level=%u", nbits, i);
-		}
-	}
-#else
-	assert_zu_eq(binfo->ngroups, binfo_dyn.ngroups,
-	    "Unexpected difference between static and dynamic initialization");
-#endif
-}
-
-TEST_BEGIN(test_bitmap_initializer) {
-#define NB(nbits) {							\
-		if (nbits <= BITMAP_MAXBITS) {				\
-			bitmap_info_t binfo =				\
-			    BITMAP_INFO_INITIALIZER(nbits);		\
-			test_bitmap_initializer_body(&binfo, nbits);	\
-		}							\
-	}
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-static size_t
-test_bitmap_size_body(const bitmap_info_t *binfo, size_t nbits,
-    size_t prev_size) {
-	size_t size = bitmap_size(binfo);
-	assert_zu_ge(size, (nbits >> 3),
-	    "Bitmap size is smaller than expected");
-	assert_zu_ge(size, prev_size, "Bitmap size is smaller than expected");
-	return size;
-}
-
-TEST_BEGIN(test_bitmap_size) {
-	size_t nbits, prev_size;
-
-	prev_size = 0;
-	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
-		bitmap_info_t binfo;
-		bitmap_info_init(&binfo, nbits);
-		prev_size = test_bitmap_size_body(&binfo, nbits, prev_size);
-	}
-#define NB(nbits) {							\
-		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
-		prev_size = test_bitmap_size_body(&binfo, nbits,	\
-		    prev_size);						\
-	}
-	prev_size = 0;
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-static void
-test_bitmap_init_body(const bitmap_info_t *binfo, size_t nbits) {
-	size_t i;
-	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
-	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
-
-	bitmap_init(bitmap, binfo, false);
-	for (i = 0; i < nbits; i++) {
-		assert_false(bitmap_get(bitmap, binfo, i),
-		    "Bit should be unset");
-	}
-
-	bitmap_init(bitmap, binfo, true);
-	for (i = 0; i < nbits; i++) {
-		assert_true(bitmap_get(bitmap, binfo, i), "Bit should be set");
-	}
-
-	free(bitmap);
-}
-
-TEST_BEGIN(test_bitmap_init) {
-	size_t nbits;
-
-	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
-		bitmap_info_t binfo;
-		bitmap_info_init(&binfo, nbits);
-		test_bitmap_init_body(&binfo, nbits);
-	}
-#define NB(nbits) {							\
-		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
-		test_bitmap_init_body(&binfo, nbits);			\
-	}
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-static void
-test_bitmap_set_body(const bitmap_info_t *binfo, size_t nbits) {
-	size_t i;
-	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
-	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
-	bitmap_init(bitmap, binfo, false);
-
-	for (i = 0; i < nbits; i++) {
-		bitmap_set(bitmap, binfo, i);
-	}
-	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
-	free(bitmap);
-}
-
-TEST_BEGIN(test_bitmap_set) {
-	size_t nbits;
-
-	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
-		bitmap_info_t binfo;
-		bitmap_info_init(&binfo, nbits);
-		test_bitmap_set_body(&binfo, nbits);
-	}
-#define NB(nbits) {							\
-		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
-		test_bitmap_set_body(&binfo, nbits);			\
-	}
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-static void
-test_bitmap_unset_body(const bitmap_info_t *binfo, size_t nbits) {
-	size_t i;
-	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
-	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
-	bitmap_init(bitmap, binfo, false);
-
-	for (i = 0; i < nbits; i++) {
-		bitmap_set(bitmap, binfo, i);
-	}
-	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
-	for (i = 0; i < nbits; i++) {
-		bitmap_unset(bitmap, binfo, i);
-	}
-	for (i = 0; i < nbits; i++) {
-		bitmap_set(bitmap, binfo, i);
-	}
-	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
-	free(bitmap);
-}
-
-TEST_BEGIN(test_bitmap_unset) {
-	size_t nbits;
-
-	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
-		bitmap_info_t binfo;
-		bitmap_info_init(&binfo, nbits);
-		test_bitmap_unset_body(&binfo, nbits);
-	}
-#define NB(nbits) {							\
-		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
-		test_bitmap_unset_body(&binfo, nbits);			\
-	}
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-static void
-test_bitmap_xfu_body(const bitmap_info_t *binfo, size_t nbits) {
-	bitmap_t *bitmap = (bitmap_t *)malloc(bitmap_size(binfo));
-	assert_ptr_not_null(bitmap, "Unexpected malloc() failure");
-	bitmap_init(bitmap, binfo, false);
-
-	/* Iteratively set bits starting at the beginning. */
-	for (size_t i = 0; i < nbits; i++) {
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
-		    "First unset bit should be just after previous first unset "
-		    "bit");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
-		    "First unset bit should be just after previous first unset "
-		    "bit");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
-		    "First unset bit should be just after previous first unset "
-		    "bit");
-		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
-		    "First unset bit should be just after previous first unset "
-		    "bit");
-	}
-	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
-
-	/*
-	 * Iteratively unset bits starting at the end, and verify that
-	 * bitmap_sfu() reaches the unset bits.
-	 */
-	for (size_t i = nbits - 1; i < nbits; i--) { /* (nbits..0] */
-		bitmap_unset(bitmap, binfo, i);
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
-		    "First unset bit should the bit previously unset");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
-		    "First unset bit should the bit previously unset");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
-		    "First unset bit should the bit previously unset");
-		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
-		    "First unset bit should the bit previously unset");
-		bitmap_unset(bitmap, binfo, i);
-	}
-	assert_false(bitmap_get(bitmap, binfo, 0), "Bit should be unset");
-
-	/*
-	 * Iteratively set bits starting at the beginning, and verify that
-	 * bitmap_sfu() looks past them.
-	 */
-	for (size_t i = 1; i < nbits; i++) {
-		bitmap_set(bitmap, binfo, i - 1);
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), i,
-		    "First unset bit should be just after the bit previously "
-		    "set");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, (i > 0) ? i-1 : i), i,
-		    "First unset bit should be just after the bit previously "
-		    "set");
-		assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
-		    "First unset bit should be just after the bit previously "
-		    "set");
-		assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
-		    "First unset bit should be just after the bit previously "
-		    "set");
-		bitmap_unset(bitmap, binfo, i);
-	}
-	assert_zu_eq(bitmap_ffu(bitmap, binfo, 0), nbits - 1,
-	    "First unset bit should be the last bit");
-	assert_zu_eq(bitmap_ffu(bitmap, binfo, (nbits > 1) ? nbits-2 : nbits-1),
-	    nbits - 1, "First unset bit should be the last bit");
-	assert_zu_eq(bitmap_ffu(bitmap, binfo, nbits - 1), nbits - 1,
-	    "First unset bit should be the last bit");
-	assert_zu_eq(bitmap_sfu(bitmap, binfo), nbits - 1,
-	    "First unset bit should be the last bit");
-	assert_true(bitmap_full(bitmap, binfo), "All bits should be set");
-
-	/*
-	 * Bubble a "usu" pattern through the bitmap and verify that
-	 * bitmap_ffu() finds the correct bit for all five min_bit cases.
-	 */
-	if (nbits >= 3) {
-		for (size_t i = 0; i < nbits-2; i++) {
-			bitmap_unset(bitmap, binfo, i);
-			bitmap_unset(bitmap, binfo, i+2);
-			if (i > 0) {
-				assert_zu_eq(bitmap_ffu(bitmap, binfo, i-1), i,
-				    "Unexpected first unset bit");
-			}
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
-			    "Unexpected first unset bit");
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+1), i+2,
-			    "Unexpected first unset bit");
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+2), i+2,
-			    "Unexpected first unset bit");
-			if (i + 3 < nbits) {
-				assert_zu_eq(bitmap_ffu(bitmap, binfo, i+3),
-				    nbits, "Unexpected first unset bit");
-			}
-			assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
-			    "Unexpected first unset bit");
-			assert_zu_eq(bitmap_sfu(bitmap, binfo), i+2,
-			    "Unexpected first unset bit");
-		}
-	}
-
-	/*
-	 * Unset the last bit, bubble another unset bit through the bitmap, and
-	 * verify that bitmap_ffu() finds the correct bit for all four min_bit
-	 * cases.
-	 */
-	if (nbits >= 3) {
-		bitmap_unset(bitmap, binfo, nbits-1);
-		for (size_t i = 0; i < nbits-1; i++) {
-			bitmap_unset(bitmap, binfo, i);
-			if (i > 0) {
-				assert_zu_eq(bitmap_ffu(bitmap, binfo, i-1), i,
-				    "Unexpected first unset bit");
-			}
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, i), i,
-			    "Unexpected first unset bit");
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, i+1), nbits-1,
-			    "Unexpected first unset bit");
-			assert_zu_eq(bitmap_ffu(bitmap, binfo, nbits-1),
-			    nbits-1, "Unexpected first unset bit");
-
-			assert_zu_eq(bitmap_sfu(bitmap, binfo), i,
-			    "Unexpected first unset bit");
-		}
-		assert_zu_eq(bitmap_sfu(bitmap, binfo), nbits-1,
-		    "Unexpected first unset bit");
-	}
-
-	free(bitmap);
-}
-
-TEST_BEGIN(test_bitmap_xfu) {
-	size_t nbits;
-
-	for (nbits = 1; nbits <= BITMAP_MAXBITS; nbits++) {
-		bitmap_info_t binfo;
-		bitmap_info_init(&binfo, nbits);
-		test_bitmap_xfu_body(&binfo, nbits);
-	}
-#define NB(nbits) {							\
-		bitmap_info_t binfo = BITMAP_INFO_INITIALIZER(nbits);	\
-		test_bitmap_xfu_body(&binfo, nbits);			\
-	}
-	NBITS_TAB
-#undef NB
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_bitmap_initializer,
-	    test_bitmap_size,
-	    test_bitmap_init,
-	    test_bitmap_set,
-	    test_bitmap_unset,
-	    test_bitmap_xfu);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/ckh.c b/redis-stable/deps/jemalloc/test/unit/ckh.c
deleted file mode 100644
index 707ea5f8..00000000
--- a/redis-stable/deps/jemalloc/test/unit/ckh.c
+++ /dev/null
@@ -1,211 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_new_delete) {
-	tsd_t *tsd;
-	ckh_t ckh;
-
-	tsd = tsd_fetch();
-
-	assert_false(ckh_new(tsd, &ckh, 2, ckh_string_hash,
-	    ckh_string_keycomp), "Unexpected ckh_new() error");
-	ckh_delete(tsd, &ckh);
-
-	assert_false(ckh_new(tsd, &ckh, 3, ckh_pointer_hash,
-	    ckh_pointer_keycomp), "Unexpected ckh_new() error");
-	ckh_delete(tsd, &ckh);
-}
-TEST_END
-
-TEST_BEGIN(test_count_insert_search_remove) {
-	tsd_t *tsd;
-	ckh_t ckh;
-	const char *strs[] = {
-	    "a string",
-	    "A string",
-	    "a string.",
-	    "A string."
-	};
-	const char *missing = "A string not in the hash table.";
-	size_t i;
-
-	tsd = tsd_fetch();
-
-	assert_false(ckh_new(tsd, &ckh, 2, ckh_string_hash,
-	    ckh_string_keycomp), "Unexpected ckh_new() error");
-	assert_zu_eq(ckh_count(&ckh), 0,
-	    "ckh_count() should return %zu, but it returned %zu", ZU(0),
-	    ckh_count(&ckh));
-
-	/* Insert. */
-	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
-		ckh_insert(tsd, &ckh, strs[i], strs[i]);
-		assert_zu_eq(ckh_count(&ckh), i+1,
-		    "ckh_count() should return %zu, but it returned %zu", i+1,
-		    ckh_count(&ckh));
-	}
-
-	/* Search. */
-	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
-		union {
-			void *p;
-			const char *s;
-		} k, v;
-		void **kp, **vp;
-		const char *ks, *vs;
-
-		kp = (i & 1) ? &k.p : NULL;
-		vp = (i & 2) ? &v.p : NULL;
-		k.p = NULL;
-		v.p = NULL;
-		assert_false(ckh_search(&ckh, strs[i], kp, vp),
-		    "Unexpected ckh_search() error");
-
-		ks = (i & 1) ? strs[i] : (const char *)NULL;
-		vs = (i & 2) ? strs[i] : (const char *)NULL;
-		assert_ptr_eq((void *)ks, (void *)k.s, "Key mismatch, i=%zu",
-		    i);
-		assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu",
-		    i);
-	}
-	assert_true(ckh_search(&ckh, missing, NULL, NULL),
-	    "Unexpected ckh_search() success");
-
-	/* Remove. */
-	for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) {
-		union {
-			void *p;
-			const char *s;
-		} k, v;
-		void **kp, **vp;
-		const char *ks, *vs;
-
-		kp = (i & 1) ? &k.p : NULL;
-		vp = (i & 2) ? &v.p : NULL;
-		k.p = NULL;
-		v.p = NULL;
-		assert_false(ckh_remove(tsd, &ckh, strs[i], kp, vp),
-		    "Unexpected ckh_remove() error");
-
-		ks = (i & 1) ? strs[i] : (const char *)NULL;
-		vs = (i & 2) ? strs[i] : (const char *)NULL;
-		assert_ptr_eq((void *)ks, (void *)k.s, "Key mismatch, i=%zu",
-		    i);
-		assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu",
-		    i);
-		assert_zu_eq(ckh_count(&ckh),
-		    sizeof(strs)/sizeof(const char *) - i - 1,
-		    "ckh_count() should return %zu, but it returned %zu",
-		        sizeof(strs)/sizeof(const char *) - i - 1,
-		    ckh_count(&ckh));
-	}
-
-	ckh_delete(tsd, &ckh);
-}
-TEST_END
-
-TEST_BEGIN(test_insert_iter_remove) {
-#define NITEMS ZU(1000)
-	tsd_t *tsd;
-	ckh_t ckh;
-	void **p[NITEMS];
-	void *q, *r;
-	size_t i;
-
-	tsd = tsd_fetch();
-
-	assert_false(ckh_new(tsd, &ckh, 2, ckh_pointer_hash,
-	    ckh_pointer_keycomp), "Unexpected ckh_new() error");
-
-	for (i = 0; i < NITEMS; i++) {
-		p[i] = mallocx(i+1, 0);
-		assert_ptr_not_null(p[i], "Unexpected mallocx() failure");
-	}
-
-	for (i = 0; i < NITEMS; i++) {
-		size_t j;
-
-		for (j = i; j < NITEMS; j++) {
-			assert_false(ckh_insert(tsd, &ckh, p[j], p[j]),
-			    "Unexpected ckh_insert() failure");
-			assert_false(ckh_search(&ckh, p[j], &q, &r),
-			    "Unexpected ckh_search() failure");
-			assert_ptr_eq(p[j], q, "Key pointer mismatch");
-			assert_ptr_eq(p[j], r, "Value pointer mismatch");
-		}
-
-		assert_zu_eq(ckh_count(&ckh), NITEMS,
-		    "ckh_count() should return %zu, but it returned %zu",
-		    NITEMS, ckh_count(&ckh));
-
-		for (j = i + 1; j < NITEMS; j++) {
-			assert_false(ckh_search(&ckh, p[j], NULL, NULL),
-			    "Unexpected ckh_search() failure");
-			assert_false(ckh_remove(tsd, &ckh, p[j], &q, &r),
-			    "Unexpected ckh_remove() failure");
-			assert_ptr_eq(p[j], q, "Key pointer mismatch");
-			assert_ptr_eq(p[j], r, "Value pointer mismatch");
-			assert_true(ckh_search(&ckh, p[j], NULL, NULL),
-			    "Unexpected ckh_search() success");
-			assert_true(ckh_remove(tsd, &ckh, p[j], &q, &r),
-			    "Unexpected ckh_remove() success");
-		}
-
-		{
-			bool seen[NITEMS];
-			size_t tabind;
-
-			memset(seen, 0, sizeof(seen));
-
-			for (tabind = 0; !ckh_iter(&ckh, &tabind, &q, &r);) {
-				size_t k;
-
-				assert_ptr_eq(q, r, "Key and val not equal");
-
-				for (k = 0; k < NITEMS; k++) {
-					if (p[k] == q) {
-						assert_false(seen[k],
-						    "Item %zu already seen", k);
-						seen[k] = true;
-						break;
-					}
-				}
-			}
-
-			for (j = 0; j < i + 1; j++) {
-				assert_true(seen[j], "Item %zu not seen", j);
-			}
-			for (; j < NITEMS; j++) {
-				assert_false(seen[j], "Item %zu seen", j);
-			}
-		}
-	}
-
-	for (i = 0; i < NITEMS; i++) {
-		assert_false(ckh_search(&ckh, p[i], NULL, NULL),
-		    "Unexpected ckh_search() failure");
-		assert_false(ckh_remove(tsd, &ckh, p[i], &q, &r),
-		    "Unexpected ckh_remove() failure");
-		assert_ptr_eq(p[i], q, "Key pointer mismatch");
-		assert_ptr_eq(p[i], r, "Value pointer mismatch");
-		assert_true(ckh_search(&ckh, p[i], NULL, NULL),
-		    "Unexpected ckh_search() success");
-		assert_true(ckh_remove(tsd, &ckh, p[i], &q, &r),
-		    "Unexpected ckh_remove() success");
-		dallocx(p[i], 0);
-	}
-
-	assert_zu_eq(ckh_count(&ckh), 0,
-	    "ckh_count() should return %zu, but it returned %zu",
-	    ZU(0), ckh_count(&ckh));
-	ckh_delete(tsd, &ckh);
-#undef NITEMS
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_new_delete,
-	    test_count_insert_search_remove,
-	    test_insert_iter_remove);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/decay.c b/redis-stable/deps/jemalloc/test/unit/decay.c
deleted file mode 100644
index f727bf93..00000000
--- a/redis-stable/deps/jemalloc/test/unit/decay.c
+++ /dev/null
@@ -1,599 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/ticker.h"
-
-static nstime_monotonic_t *nstime_monotonic_orig;
-static nstime_update_t *nstime_update_orig;
-
-static unsigned nupdates_mock;
-static nstime_t time_mock;
-static bool monotonic_mock;
-
-static bool
-check_background_thread_enabled(void) {
-	bool enabled;
-	size_t sz = sizeof(bool);
-	int ret = mallctl("background_thread", (void *)&enabled, &sz, NULL,0);
-	if (ret == ENOENT) {
-		return false;
-	}
-	assert_d_eq(ret, 0, "Unexpected mallctl error");
-	return enabled;
-}
-
-static bool
-nstime_monotonic_mock(void) {
-	return monotonic_mock;
-}
-
-static bool
-nstime_update_mock(nstime_t *time) {
-	nupdates_mock++;
-	if (monotonic_mock) {
-		nstime_copy(time, &time_mock);
-	}
-	return !monotonic_mock;
-}
-
-static unsigned
-do_arena_create(ssize_t dirty_decay_ms, ssize_t muzzy_decay_ms) {
-	unsigned arena_ind;
-	size_t sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	size_t mib[3];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-
-	assert_d_eq(mallctlnametomib("arena.0.dirty_decay_ms", mib, &miblen),
-	    0, "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL,
-	    (void *)&dirty_decay_ms, sizeof(dirty_decay_ms)), 0,
-	    "Unexpected mallctlbymib() failure");
-
-	assert_d_eq(mallctlnametomib("arena.0.muzzy_decay_ms", mib, &miblen),
-	    0, "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL,
-	    (void *)&muzzy_decay_ms, sizeof(muzzy_decay_ms)), 0,
-	    "Unexpected mallctlbymib() failure");
-
-	return arena_ind;
-}
-
-static void
-do_arena_destroy(unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.destroy", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-void
-do_epoch(void) {
-	uint64_t epoch = 1;
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-}
-
-void
-do_purge(unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.purge", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-void
-do_decay(unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.decay", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-static uint64_t
-get_arena_npurge_impl(const char *mibname, unsigned arena_ind) {
-	size_t mib[4];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib(mibname, mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[2] = (size_t)arena_ind;
-	uint64_t npurge = 0;
-	size_t sz = sizeof(npurge);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&npurge, &sz, NULL, 0),
-	    config_stats ? 0 : ENOENT, "Unexpected mallctlbymib() failure");
-	return npurge;
-}
-
-static uint64_t
-get_arena_dirty_npurge(unsigned arena_ind) {
-	do_epoch();
-	return get_arena_npurge_impl("stats.arenas.0.dirty_npurge", arena_ind);
-}
-
-static uint64_t
-get_arena_muzzy_npurge(unsigned arena_ind) {
-	do_epoch();
-	return get_arena_npurge_impl("stats.arenas.0.muzzy_npurge", arena_ind);
-}
-
-static uint64_t
-get_arena_npurge(unsigned arena_ind) {
-	do_epoch();
-	return get_arena_npurge_impl("stats.arenas.0.dirty_npurge", arena_ind) +
-	    get_arena_npurge_impl("stats.arenas.0.muzzy_npurge", arena_ind);
-}
-
-static size_t
-get_arena_pdirty(unsigned arena_ind) {
-	do_epoch();
-	size_t mib[4];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("stats.arenas.0.pdirty", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[2] = (size_t)arena_ind;
-	size_t pdirty;
-	size_t sz = sizeof(pdirty);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&pdirty, &sz, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-	return pdirty;
-}
-
-static size_t
-get_arena_pmuzzy(unsigned arena_ind) {
-	do_epoch();
-	size_t mib[4];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("stats.arenas.0.pmuzzy", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[2] = (size_t)arena_ind;
-	size_t pmuzzy;
-	size_t sz = sizeof(pmuzzy);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&pmuzzy, &sz, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-	return pmuzzy;
-}
-
-static void *
-do_mallocx(size_t size, int flags) {
-	void *p = mallocx(size, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	return p;
-}
-
-static void
-generate_dirty(unsigned arena_ind, size_t size) {
-	int flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
-	void *p = do_mallocx(size, flags);
-	dallocx(p, flags);
-}
-
-TEST_BEGIN(test_decay_ticks) {
-	test_skip_if(check_background_thread_enabled());
-
-	ticker_t *decay_ticker;
-	unsigned tick0, tick1, arena_ind;
-	size_t sz, large0;
-	void *p;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
-	    0), 0, "Unexpected mallctl failure");
-
-	/* Set up a manually managed arena for test. */
-	arena_ind = do_arena_create(0, 0);
-
-	/* Migrate to the new arena, and get the ticker. */
-	unsigned old_arena_ind;
-	size_t sz_arena_ind = sizeof(old_arena_ind);
-	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind,
-	    &sz_arena_ind, (void *)&arena_ind, sizeof(arena_ind)), 0,
-	    "Unexpected mallctl() failure");
-	decay_ticker = decay_ticker_get(tsd_fetch(), arena_ind);
-	assert_ptr_not_null(decay_ticker,
-	    "Unexpected failure getting decay ticker");
-
-	/*
-	 * Test the standard APIs using a large size class, since we can't
-	 * control tcache interactions for small size classes (except by
-	 * completely disabling tcache for the entire test program).
-	 */
-
-	/* malloc(). */
-	tick0 = ticker_read(decay_ticker);
-	p = malloc(large0);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during malloc()");
-	/* free(). */
-	tick0 = ticker_read(decay_ticker);
-	free(p);
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during free()");
-
-	/* calloc(). */
-	tick0 = ticker_read(decay_ticker);
-	p = calloc(1, large0);
-	assert_ptr_not_null(p, "Unexpected calloc() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during calloc()");
-	free(p);
-
-	/* posix_memalign(). */
-	tick0 = ticker_read(decay_ticker);
-	assert_d_eq(posix_memalign(&p, sizeof(size_t), large0), 0,
-	    "Unexpected posix_memalign() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0,
-	    "Expected ticker to tick during posix_memalign()");
-	free(p);
-
-	/* aligned_alloc(). */
-	tick0 = ticker_read(decay_ticker);
-	p = aligned_alloc(sizeof(size_t), large0);
-	assert_ptr_not_null(p, "Unexpected aligned_alloc() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0,
-	    "Expected ticker to tick during aligned_alloc()");
-	free(p);
-
-	/* realloc(). */
-	/* Allocate. */
-	tick0 = ticker_read(decay_ticker);
-	p = realloc(NULL, large0);
-	assert_ptr_not_null(p, "Unexpected realloc() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
-	/* Reallocate. */
-	tick0 = ticker_read(decay_ticker);
-	p = realloc(p, large0);
-	assert_ptr_not_null(p, "Unexpected realloc() failure");
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
-	/* Deallocate. */
-	tick0 = ticker_read(decay_ticker);
-	realloc(p, 0);
-	tick1 = ticker_read(decay_ticker);
-	assert_u32_ne(tick1, tick0, "Expected ticker to tick during realloc()");
-
-	/*
-	 * Test the *allocx() APIs using large and small size classes, with
-	 * tcache explicitly disabled.
-	 */
-	{
-		unsigned i;
-		size_t allocx_sizes[2];
-		allocx_sizes[0] = large0;
-		allocx_sizes[1] = 1;
-
-		for (i = 0; i < sizeof(allocx_sizes) / sizeof(size_t); i++) {
-			sz = allocx_sizes[i];
-
-			/* mallocx(). */
-			tick0 = ticker_read(decay_ticker);
-			p = mallocx(sz, MALLOCX_TCACHE_NONE);
-			assert_ptr_not_null(p, "Unexpected mallocx() failure");
-			tick1 = ticker_read(decay_ticker);
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during mallocx() (sz=%zu)",
-			    sz);
-			/* rallocx(). */
-			tick0 = ticker_read(decay_ticker);
-			p = rallocx(p, sz, MALLOCX_TCACHE_NONE);
-			assert_ptr_not_null(p, "Unexpected rallocx() failure");
-			tick1 = ticker_read(decay_ticker);
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during rallocx() (sz=%zu)",
-			    sz);
-			/* xallocx(). */
-			tick0 = ticker_read(decay_ticker);
-			xallocx(p, sz, 0, MALLOCX_TCACHE_NONE);
-			tick1 = ticker_read(decay_ticker);
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during xallocx() (sz=%zu)",
-			    sz);
-			/* dallocx(). */
-			tick0 = ticker_read(decay_ticker);
-			dallocx(p, MALLOCX_TCACHE_NONE);
-			tick1 = ticker_read(decay_ticker);
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during dallocx() (sz=%zu)",
-			    sz);
-			/* sdallocx(). */
-			p = mallocx(sz, MALLOCX_TCACHE_NONE);
-			assert_ptr_not_null(p, "Unexpected mallocx() failure");
-			tick0 = ticker_read(decay_ticker);
-			sdallocx(p, sz, MALLOCX_TCACHE_NONE);
-			tick1 = ticker_read(decay_ticker);
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during sdallocx() "
-			    "(sz=%zu)", sz);
-		}
-	}
-
-	/*
-	 * Test tcache fill/flush interactions for large and small size classes,
-	 * using an explicit tcache.
-	 */
-	unsigned tcache_ind, i;
-	size_t tcache_sizes[2];
-	tcache_sizes[0] = large0;
-	tcache_sizes[1] = 1;
-
-	size_t tcache_max, sz_tcache_max;
-	sz_tcache_max = sizeof(tcache_max);
-	assert_d_eq(mallctl("arenas.tcache_max", (void *)&tcache_max,
-	    &sz_tcache_max, NULL, 0), 0, "Unexpected mallctl() failure");
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("tcache.create", (void *)&tcache_ind, &sz,
-	    NULL, 0), 0, "Unexpected mallctl failure");
-
-	for (i = 0; i < sizeof(tcache_sizes) / sizeof(size_t); i++) {
-		sz = tcache_sizes[i];
-
-		/* tcache fill. */
-		tick0 = ticker_read(decay_ticker);
-		p = mallocx(sz, MALLOCX_TCACHE(tcache_ind));
-		assert_ptr_not_null(p, "Unexpected mallocx() failure");
-		tick1 = ticker_read(decay_ticker);
-		assert_u32_ne(tick1, tick0,
-		    "Expected ticker to tick during tcache fill "
-		    "(sz=%zu)", sz);
-		/* tcache flush. */
-		dallocx(p, MALLOCX_TCACHE(tcache_ind));
-		tick0 = ticker_read(decay_ticker);
-		assert_d_eq(mallctl("tcache.flush", NULL, NULL,
-		    (void *)&tcache_ind, sizeof(unsigned)), 0,
-		    "Unexpected mallctl failure");
-		tick1 = ticker_read(decay_ticker);
-
-		/* Will only tick if it's in tcache. */
-		if (sz <= tcache_max) {
-			assert_u32_ne(tick1, tick0,
-			    "Expected ticker to tick during tcache "
-			    "flush (sz=%zu)", sz);
-		} else {
-			assert_u32_eq(tick1, tick0,
-			    "Unexpected ticker tick during tcache "
-			    "flush (sz=%zu)", sz);
-		}
-	}
-}
-TEST_END
-
-static void
-decay_ticker_helper(unsigned arena_ind, int flags, bool dirty, ssize_t dt,
-    uint64_t dirty_npurge0, uint64_t muzzy_npurge0, bool terminate_asap) {
-#define NINTERVALS 101
-	nstime_t time, update_interval, decay_ms, deadline;
-
-	nstime_init(&time, 0);
-	nstime_update(&time);
-
-	nstime_init2(&decay_ms, dt, 0);
-	nstime_copy(&deadline, &time);
-	nstime_add(&deadline, &decay_ms);
-
-	nstime_init2(&update_interval, dt, 0);
-	nstime_idivide(&update_interval, NINTERVALS);
-
-	/*
-	 * Keep q's slab from being deallocated during the looping below.  If a
-	 * cached slab were to repeatedly come and go during looping, it could
-	 * prevent the decay backlog ever becoming empty.
-	 */
-	void *p = do_mallocx(1, flags);
-	uint64_t dirty_npurge1, muzzy_npurge1;
-	do {
-		for (unsigned i = 0; i < DECAY_NTICKS_PER_UPDATE / 2;
-		    i++) {
-			void *q = do_mallocx(1, flags);
-			dallocx(q, flags);
-		}
-		dirty_npurge1 = get_arena_dirty_npurge(arena_ind);
-		muzzy_npurge1 = get_arena_muzzy_npurge(arena_ind);
-
-		nstime_add(&time_mock, &update_interval);
-		nstime_update(&time);
-	} while (nstime_compare(&time, &deadline) <= 0 && ((dirty_npurge1 ==
-	    dirty_npurge0 && muzzy_npurge1 == muzzy_npurge0) ||
-	    !terminate_asap));
-	dallocx(p, flags);
-
-	if (config_stats) {
-		assert_u64_gt(dirty_npurge1 + muzzy_npurge1, dirty_npurge0 +
-		    muzzy_npurge0, "Expected purging to occur");
-	}
-#undef NINTERVALS
-}
-
-TEST_BEGIN(test_decay_ticker) {
-	test_skip_if(check_background_thread_enabled());
-#define NPS 2048
-	ssize_t ddt = opt_dirty_decay_ms;
-	ssize_t mdt = opt_muzzy_decay_ms;
-	unsigned arena_ind = do_arena_create(ddt, mdt);
-	int flags = (MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE);
-	void *ps[NPS];
-	size_t large;
-
-	/*
-	 * Allocate a bunch of large objects, pause the clock, deallocate every
-	 * other object (to fragment virtual memory), restore the clock, then
-	 * [md]allocx() in a tight loop while advancing time rapidly to verify
-	 * the ticker triggers purging.
-	 */
-
-	size_t tcache_max;
-	size_t sz = sizeof(size_t);
-	assert_d_eq(mallctl("arenas.tcache_max", (void *)&tcache_max, &sz, NULL,
-	    0), 0, "Unexpected mallctl failure");
-	large = nallocx(tcache_max + 1, flags);
-
-	do_purge(arena_ind);
-	uint64_t dirty_npurge0 = get_arena_dirty_npurge(arena_ind);
-	uint64_t muzzy_npurge0 = get_arena_muzzy_npurge(arena_ind);
-
-	for (unsigned i = 0; i < NPS; i++) {
-		ps[i] = do_mallocx(large, flags);
-	}
-
-	nupdates_mock = 0;
-	nstime_init(&time_mock, 0);
-	nstime_update(&time_mock);
-	monotonic_mock = true;
-
-	nstime_monotonic_orig = nstime_monotonic;
-	nstime_update_orig = nstime_update;
-	nstime_monotonic = nstime_monotonic_mock;
-	nstime_update = nstime_update_mock;
-
-	for (unsigned i = 0; i < NPS; i += 2) {
-		dallocx(ps[i], flags);
-		unsigned nupdates0 = nupdates_mock;
-		do_decay(arena_ind);
-		assert_u_gt(nupdates_mock, nupdates0,
-		    "Expected nstime_update() to be called");
-	}
-
-	decay_ticker_helper(arena_ind, flags, true, ddt, dirty_npurge0,
-	    muzzy_npurge0, true);
-	decay_ticker_helper(arena_ind, flags, false, ddt+mdt, dirty_npurge0,
-	    muzzy_npurge0, false);
-
-	do_arena_destroy(arena_ind);
-
-	nstime_monotonic = nstime_monotonic_orig;
-	nstime_update = nstime_update_orig;
-#undef NPS
-}
-TEST_END
-
-TEST_BEGIN(test_decay_nonmonotonic) {
-	test_skip_if(check_background_thread_enabled());
-#define NPS (SMOOTHSTEP_NSTEPS + 1)
-	int flags = (MALLOCX_ARENA(0) | MALLOCX_TCACHE_NONE);
-	void *ps[NPS];
-	uint64_t npurge0 = 0;
-	uint64_t npurge1 = 0;
-	size_t sz, large0;
-	unsigned i, nupdates0;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large0, &sz, NULL,
-	    0), 0, "Unexpected mallctl failure");
-
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl failure");
-	do_epoch();
-	sz = sizeof(uint64_t);
-	npurge0 = get_arena_npurge(0);
-
-	nupdates_mock = 0;
-	nstime_init(&time_mock, 0);
-	nstime_update(&time_mock);
-	monotonic_mock = false;
-
-	nstime_monotonic_orig = nstime_monotonic;
-	nstime_update_orig = nstime_update;
-	nstime_monotonic = nstime_monotonic_mock;
-	nstime_update = nstime_update_mock;
-
-	for (i = 0; i < NPS; i++) {
-		ps[i] = mallocx(large0, flags);
-		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure");
-	}
-
-	for (i = 0; i < NPS; i++) {
-		dallocx(ps[i], flags);
-		nupdates0 = nupdates_mock;
-		assert_d_eq(mallctl("arena.0.decay", NULL, NULL, NULL, 0), 0,
-		    "Unexpected arena.0.decay failure");
-		assert_u_gt(nupdates_mock, nupdates0,
-		    "Expected nstime_update() to be called");
-	}
-
-	do_epoch();
-	sz = sizeof(uint64_t);
-	npurge1 = get_arena_npurge(0);
-
-	if (config_stats) {
-		assert_u64_eq(npurge0, npurge1, "Unexpected purging occurred");
-	}
-
-	nstime_monotonic = nstime_monotonic_orig;
-	nstime_update = nstime_update_orig;
-#undef NPS
-}
-TEST_END
-
-TEST_BEGIN(test_decay_now) {
-	test_skip_if(check_background_thread_enabled());
-
-	unsigned arena_ind = do_arena_create(0, 0);
-	assert_zu_eq(get_arena_pdirty(arena_ind), 0, "Unexpected dirty pages");
-	assert_zu_eq(get_arena_pmuzzy(arena_ind), 0, "Unexpected muzzy pages");
-	size_t sizes[] = {16, PAGE<<2, HUGEPAGE<<2};
-	/* Verify that dirty/muzzy pages never linger after deallocation. */
-	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
-		size_t size = sizes[i];
-		generate_dirty(arena_ind, size);
-		assert_zu_eq(get_arena_pdirty(arena_ind), 0,
-		    "Unexpected dirty pages");
-		assert_zu_eq(get_arena_pmuzzy(arena_ind), 0,
-		    "Unexpected muzzy pages");
-	}
-	do_arena_destroy(arena_ind);
-}
-TEST_END
-
-TEST_BEGIN(test_decay_never) {
-	test_skip_if(check_background_thread_enabled());
-
-	unsigned arena_ind = do_arena_create(-1, -1);
-	int flags = MALLOCX_ARENA(arena_ind) | MALLOCX_TCACHE_NONE;
-	assert_zu_eq(get_arena_pdirty(arena_ind), 0, "Unexpected dirty pages");
-	assert_zu_eq(get_arena_pmuzzy(arena_ind), 0, "Unexpected muzzy pages");
-	size_t sizes[] = {16, PAGE<<2, HUGEPAGE<<2};
-	void *ptrs[sizeof(sizes)/sizeof(size_t)];
-	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
-		ptrs[i] = do_mallocx(sizes[i], flags);
-	}
-	/* Verify that each deallocation generates additional dirty pages. */
-	size_t pdirty_prev = get_arena_pdirty(arena_ind);
-	size_t pmuzzy_prev = get_arena_pmuzzy(arena_ind);
-	assert_zu_eq(pdirty_prev, 0, "Unexpected dirty pages");
-	assert_zu_eq(pmuzzy_prev, 0, "Unexpected muzzy pages");
-	for (unsigned i = 0; i < sizeof(sizes)/sizeof(size_t); i++) {
-		dallocx(ptrs[i], flags);
-		size_t pdirty = get_arena_pdirty(arena_ind);
-		size_t pmuzzy = get_arena_pmuzzy(arena_ind);
-		assert_zu_gt(pdirty, pdirty_prev,
-		    "Expected dirty pages to increase.");
-		assert_zu_eq(pmuzzy, 0, "Unexpected muzzy pages");
-		pdirty_prev = pdirty;
-	}
-	do_arena_destroy(arena_ind);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_decay_ticks,
-	    test_decay_ticker,
-	    test_decay_nonmonotonic,
-	    test_decay_now,
-	    test_decay_never);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/decay.sh b/redis-stable/deps/jemalloc/test/unit/decay.sh
deleted file mode 100644
index 45aeccf4..00000000
--- a/redis-stable/deps/jemalloc/test/unit/decay.sh
+++ /dev/null
@@ -1,3 +0,0 @@
-#!/bin/sh
-
-export MALLOC_CONF="dirty_decay_ms:1000,muzzy_decay_ms:1000,lg_tcache_max:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/div.c b/redis-stable/deps/jemalloc/test/unit/div.c
deleted file mode 100644
index b47f10b2..00000000
--- a/redis-stable/deps/jemalloc/test/unit/div.c
+++ /dev/null
@@ -1,29 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/div.h"
-
-TEST_BEGIN(test_div_exhaustive) {
-	for (size_t divisor = 2; divisor < 1000 * 1000; ++divisor) {
-		div_info_t div_info;
-		div_init(&div_info, divisor);
-		size_t max = 1000 * divisor;
-		if (max < 1000 * 1000) {
-			max = 1000 * 1000;
-		}
-		for (size_t dividend = 0; dividend < 1000 * divisor;
-		    dividend += divisor) {
-			size_t quotient = div_compute(
-			    &div_info, dividend);
-			assert_zu_eq(dividend, quotient * divisor,
-			    "With divisor = %zu, dividend = %zu, "
-			    "got quotient %zu", divisor, dividend, quotient);
-		}
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_div_exhaustive);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/emitter.c b/redis-stable/deps/jemalloc/test/unit/emitter.c
deleted file mode 100644
index 535c7cf1..00000000
--- a/redis-stable/deps/jemalloc/test/unit/emitter.c
+++ /dev/null
@@ -1,413 +0,0 @@
-#include "test/jemalloc_test.h"
-#include "jemalloc/internal/emitter.h"
-
-/*
- * This is so useful for debugging and feature work, we'll leave printing
- * functionality committed but disabled by default.
- */
-/* Print the text as it will appear. */
-static bool print_raw = false;
-/* Print the text escaped, so it can be copied back into the test case. */
-static bool print_escaped = false;
-
-typedef struct buf_descriptor_s buf_descriptor_t;
-struct buf_descriptor_s {
-	char *buf;
-	size_t len;
-	bool mid_quote;
-};
-
-/*
- * Forwards all writes to the passed-in buf_v (which should be cast from a
- * buf_descriptor_t *).
- */
-static void
-forwarding_cb(void *buf_descriptor_v, const char *str) {
-	buf_descriptor_t *buf_descriptor = (buf_descriptor_t *)buf_descriptor_v;
-
-	if (print_raw) {
-		malloc_printf("%s", str);
-	}
-	if (print_escaped) {
-		const char *it = str;
-		while (*it != '\0') {
-			if (!buf_descriptor->mid_quote) {
-				malloc_printf("\"");
-				buf_descriptor->mid_quote = true;
-			}
-			switch (*it) {
-			case '\\':
-				malloc_printf("\\");
-				break;
-			case '\"':
-				malloc_printf("\\\"");
-				break;
-			case '\t':
-				malloc_printf("\\t");
-				break;
-			case '\n':
-				malloc_printf("\\n\"\n");
-				buf_descriptor->mid_quote = false;
-				break;
-			default:
-				malloc_printf("%c", *it);
-			}
-			it++;
-		}
-	}
-
-	size_t written = malloc_snprintf(buf_descriptor->buf,
-	    buf_descriptor->len, "%s", str);
-	assert_zu_eq(written, strlen(str), "Buffer overflow!");
-	buf_descriptor->buf += written;
-	buf_descriptor->len -= written;
-	assert_zu_gt(buf_descriptor->len, 0, "Buffer out of space!");
-}
-
-static void
-assert_emit_output(void (*emit_fn)(emitter_t *),
-    const char *expected_json_output, const char *expected_table_output) {
-	emitter_t emitter;
-	char buf[MALLOC_PRINTF_BUFSIZE];
-	buf_descriptor_t buf_descriptor;
-
-	buf_descriptor.buf = buf;
-	buf_descriptor.len = MALLOC_PRINTF_BUFSIZE;
-	buf_descriptor.mid_quote = false;
-
-	emitter_init(&emitter, emitter_output_json, &forwarding_cb,
-	    &buf_descriptor);
-	(*emit_fn)(&emitter);
-	assert_str_eq(expected_json_output, buf, "json output failure");
-
-	buf_descriptor.buf = buf;
-	buf_descriptor.len = MALLOC_PRINTF_BUFSIZE;
-	buf_descriptor.mid_quote = false;
-
-	emitter_init(&emitter, emitter_output_table, &forwarding_cb,
-	    &buf_descriptor);
-	(*emit_fn)(&emitter);
-	assert_str_eq(expected_table_output, buf, "table output failure");
-}
-
-static void
-emit_dict(emitter_t *emitter) {
-	bool b_false = false;
-	bool b_true = true;
-	int i_123 = 123;
-	const char *str = "a string";
-
-	emitter_begin(emitter);
-	emitter_dict_begin(emitter, "foo", "This is the foo table:");
-	emitter_kv(emitter, "abc", "ABC", emitter_type_bool, &b_false);
-	emitter_kv(emitter, "def", "DEF", emitter_type_bool, &b_true);
-	emitter_kv_note(emitter, "ghi", "GHI", emitter_type_int, &i_123,
-	    "note_key1", emitter_type_string, &str);
-	emitter_kv_note(emitter, "jkl", "JKL", emitter_type_string, &str,
-	    "note_key2", emitter_type_bool, &b_false);
-	emitter_dict_end(emitter);
-	emitter_end(emitter);
-}
-static const char *dict_json =
-"{\n"
-"\t\"foo\": {\n"
-"\t\t\"abc\": false,\n"
-"\t\t\"def\": true,\n"
-"\t\t\"ghi\": 123,\n"
-"\t\t\"jkl\": \"a string\"\n"
-"\t}\n"
-"}\n";
-static const char *dict_table =
-"This is the foo table:\n"
-"  ABC: false\n"
-"  DEF: true\n"
-"  GHI: 123 (note_key1: \"a string\")\n"
-"  JKL: \"a string\" (note_key2: false)\n";
-
-TEST_BEGIN(test_dict) {
-	assert_emit_output(&emit_dict, dict_json, dict_table);
-}
-TEST_END
-
-static void
-emit_table_printf(emitter_t *emitter) {
-	emitter_begin(emitter);
-	emitter_table_printf(emitter, "Table note 1\n");
-	emitter_table_printf(emitter, "Table note 2 %s\n",
-	    "with format string");
-	emitter_end(emitter);
-}
-
-static const char *table_printf_json =
-"{\n"
-"}\n";
-
-static const char *table_printf_table =
-"Table note 1\n"
-"Table note 2 with format string\n";
-
-TEST_BEGIN(test_table_printf) {
-	assert_emit_output(&emit_table_printf, table_printf_json,
-	    table_printf_table);
-}
-TEST_END
-
-static void emit_nested_dict(emitter_t *emitter) {
-	int val = 123;
-	emitter_begin(emitter);
-	emitter_dict_begin(emitter, "json1", "Dict 1");
-	emitter_dict_begin(emitter, "json2", "Dict 2");
-	emitter_kv(emitter, "primitive", "A primitive", emitter_type_int, &val);
-	emitter_dict_end(emitter); /* Close 2 */
-	emitter_dict_begin(emitter, "json3", "Dict 3");
-	emitter_dict_end(emitter); /* Close 3 */
-	emitter_dict_end(emitter); /* Close 1 */
-	emitter_dict_begin(emitter, "json4", "Dict 4");
-	emitter_kv(emitter, "primitive", "Another primitive",
-	    emitter_type_int, &val);
-	emitter_dict_end(emitter); /* Close 4 */
-	emitter_end(emitter);
-}
-
-static const char *nested_dict_json =
-"{\n"
-"\t\"json1\": {\n"
-"\t\t\"json2\": {\n"
-"\t\t\t\"primitive\": 123\n"
-"\t\t},\n"
-"\t\t\"json3\": {\n"
-"\t\t}\n"
-"\t},\n"
-"\t\"json4\": {\n"
-"\t\t\"primitive\": 123\n"
-"\t}\n"
-"}\n";
-
-static const char *nested_dict_table =
-"Dict 1\n"
-"  Dict 2\n"
-"    A primitive: 123\n"
-"  Dict 3\n"
-"Dict 4\n"
-"  Another primitive: 123\n";
-
-TEST_BEGIN(test_nested_dict) {
-	assert_emit_output(&emit_nested_dict, nested_dict_json,
-	    nested_dict_table);
-}
-TEST_END
-
-static void
-emit_types(emitter_t *emitter) {
-	bool b = false;
-	int i = -123;
-	unsigned u = 123;
-	ssize_t zd = -456;
-	size_t zu = 456;
-	const char *str = "string";
-	uint32_t u32 = 789;
-	uint64_t u64 = 10000000000ULL;
-
-	emitter_begin(emitter);
-	emitter_kv(emitter, "k1", "K1", emitter_type_bool, &b);
-	emitter_kv(emitter, "k2", "K2", emitter_type_int, &i);
-	emitter_kv(emitter, "k3", "K3", emitter_type_unsigned, &u);
-	emitter_kv(emitter, "k4", "K4", emitter_type_ssize, &zd);
-	emitter_kv(emitter, "k5", "K5", emitter_type_size, &zu);
-	emitter_kv(emitter, "k6", "K6", emitter_type_string, &str);
-	emitter_kv(emitter, "k7", "K7", emitter_type_uint32, &u32);
-	emitter_kv(emitter, "k8", "K8", emitter_type_uint64, &u64);
-	/*
-	 * We don't test the title type, since it's only used for tables.  It's
-	 * tested in the emitter_table_row tests.
-	 */
-	emitter_end(emitter);
-}
-
-static const char *types_json =
-"{\n"
-"\t\"k1\": false,\n"
-"\t\"k2\": -123,\n"
-"\t\"k3\": 123,\n"
-"\t\"k4\": -456,\n"
-"\t\"k5\": 456,\n"
-"\t\"k6\": \"string\",\n"
-"\t\"k7\": 789,\n"
-"\t\"k8\": 10000000000\n"
-"}\n";
-
-static const char *types_table =
-"K1: false\n"
-"K2: -123\n"
-"K3: 123\n"
-"K4: -456\n"
-"K5: 456\n"
-"K6: \"string\"\n"
-"K7: 789\n"
-"K8: 10000000000\n";
-
-TEST_BEGIN(test_types) {
-	assert_emit_output(&emit_types, types_json, types_table);
-}
-TEST_END
-
-static void
-emit_modal(emitter_t *emitter) {
-	int val = 123;
-	emitter_begin(emitter);
-	emitter_dict_begin(emitter, "j0", "T0");
-	emitter_json_dict_begin(emitter, "j1");
-	emitter_kv(emitter, "i1", "I1", emitter_type_int, &val);
-	emitter_json_kv(emitter, "i2", emitter_type_int, &val);
-	emitter_table_kv(emitter, "I3", emitter_type_int, &val);
-	emitter_table_dict_begin(emitter, "T1");
-	emitter_kv(emitter, "i4", "I4", emitter_type_int, &val);
-	emitter_json_dict_end(emitter); /* Close j1 */
-	emitter_kv(emitter, "i5", "I5", emitter_type_int, &val);
-	emitter_table_dict_end(emitter); /* Close T1 */
-	emitter_kv(emitter, "i6", "I6", emitter_type_int, &val);
-	emitter_dict_end(emitter); /* Close j0 / T0 */
-	emitter_end(emitter);
-}
-
-const char *modal_json =
-"{\n"
-"\t\"j0\": {\n"
-"\t\t\"j1\": {\n"
-"\t\t\t\"i1\": 123,\n"
-"\t\t\t\"i2\": 123,\n"
-"\t\t\t\"i4\": 123\n"
-"\t\t},\n"
-"\t\t\"i5\": 123,\n"
-"\t\t\"i6\": 123\n"
-"\t}\n"
-"}\n";
-
-const char *modal_table =
-"T0\n"
-"  I1: 123\n"
-"  I3: 123\n"
-"  T1\n"
-"    I4: 123\n"
-"    I5: 123\n"
-"  I6: 123\n";
-
-TEST_BEGIN(test_modal) {
-	assert_emit_output(&emit_modal, modal_json, modal_table);
-}
-TEST_END
-
-static void
-emit_json_arr(emitter_t *emitter) {
-	int ival = 123;
-
-	emitter_begin(emitter);
-	emitter_json_dict_begin(emitter, "dict");
-	emitter_json_arr_begin(emitter, "arr");
-	emitter_json_arr_obj_begin(emitter);
-	emitter_json_kv(emitter, "foo", emitter_type_int, &ival);
-	emitter_json_arr_obj_end(emitter); /* Close arr[0] */
-	/* arr[1] and arr[2] are primitives. */
-	emitter_json_arr_value(emitter, emitter_type_int, &ival);
-	emitter_json_arr_value(emitter, emitter_type_int, &ival);
-	emitter_json_arr_obj_begin(emitter);
-	emitter_json_kv(emitter, "bar", emitter_type_int, &ival);
-	emitter_json_kv(emitter, "baz", emitter_type_int, &ival);
-	emitter_json_arr_obj_end(emitter); /* Close arr[3]. */
-	emitter_json_arr_end(emitter); /* Close arr. */
-	emitter_json_dict_end(emitter); /* Close dict. */
-	emitter_end(emitter);
-}
-
-static const char *json_arr_json =
-"{\n"
-"\t\"dict\": {\n"
-"\t\t\"arr\": [\n"
-"\t\t\t{\n"
-"\t\t\t\t\"foo\": 123\n"
-"\t\t\t},\n"
-"\t\t\t123,\n"
-"\t\t\t123,\n"
-"\t\t\t{\n"
-"\t\t\t\t\"bar\": 123,\n"
-"\t\t\t\t\"baz\": 123\n"
-"\t\t\t}\n"
-"\t\t]\n"
-"\t}\n"
-"}\n";
-
-static const char *json_arr_table = "";
-
-TEST_BEGIN(test_json_arr) {
-	assert_emit_output(&emit_json_arr, json_arr_json, json_arr_table);
-}
-TEST_END
-
-static void
-emit_table_row(emitter_t *emitter) {
-	emitter_begin(emitter);
-	emitter_row_t row;
-	emitter_col_t abc = {emitter_justify_left, 10, emitter_type_title};
-	abc.str_val = "ABC title";
-	emitter_col_t def = {emitter_justify_right, 15, emitter_type_title};
-	def.str_val = "DEF title";
-	emitter_col_t ghi = {emitter_justify_right, 5, emitter_type_title};
-	ghi.str_val = "GHI";
-
-	emitter_row_init(&row);
-	emitter_col_init(&abc, &row);
-	emitter_col_init(&def, &row);
-	emitter_col_init(&ghi, &row);
-
-	emitter_table_row(emitter, &row);
-
-	abc.type = emitter_type_int;
-	def.type = emitter_type_bool;
-	ghi.type = emitter_type_int;
-
-	abc.int_val = 123;
-	def.bool_val = true;
-	ghi.int_val = 456;
-	emitter_table_row(emitter, &row);
-
-	abc.int_val = 789;
-	def.bool_val = false;
-	ghi.int_val = 1011;
-	emitter_table_row(emitter, &row);
-
-	abc.type = emitter_type_string;
-	abc.str_val = "a string";
-	def.bool_val = false;
-	ghi.type = emitter_type_title;
-	ghi.str_val = "ghi";
-	emitter_table_row(emitter, &row);
-
-	emitter_end(emitter);
-}
-
-static const char *table_row_json =
-"{\n"
-"}\n";
-
-static const char *table_row_table =
-"ABC title       DEF title  GHI\n"
-"123                  true  456\n"
-"789                 false 1011\n"
-"\"a string\"          false  ghi\n";
-
-TEST_BEGIN(test_table_row) {
-	assert_emit_output(&emit_table_row, table_row_json, table_row_table);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_dict,
-	    test_table_printf,
-	    test_nested_dict,
-	    test_types,
-	    test_modal,
-	    test_json_arr,
-	    test_table_row);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/extent_quantize.c b/redis-stable/deps/jemalloc/test/unit/extent_quantize.c
deleted file mode 100644
index 0ca7a75d..00000000
--- a/redis-stable/deps/jemalloc/test/unit/extent_quantize.c
+++ /dev/null
@@ -1,141 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_small_extent_size) {
-	unsigned nbins, i;
-	size_t sz, extent_size;
-	size_t mib[4];
-	size_t miblen = sizeof(mib) / sizeof(size_t);
-
-	/*
-	 * Iterate over all small size classes, get their extent sizes, and
-	 * verify that the quantized size is the same as the extent size.
-	 */
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &sz, NULL, 0), 0,
-	    "Unexpected mallctl failure");
-
-	assert_d_eq(mallctlnametomib("arenas.bin.0.slab_size", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib failure");
-	for (i = 0; i < nbins; i++) {
-		mib[2] = i;
-		sz = sizeof(size_t);
-		assert_d_eq(mallctlbymib(mib, miblen, (void *)&extent_size, &sz,
-		    NULL, 0), 0, "Unexpected mallctlbymib failure");
-		assert_zu_eq(extent_size,
-		    extent_size_quantize_floor(extent_size),
-		    "Small extent quantization should be a no-op "
-		    "(extent_size=%zu)", extent_size);
-		assert_zu_eq(extent_size,
-		    extent_size_quantize_ceil(extent_size),
-		    "Small extent quantization should be a no-op "
-		    "(extent_size=%zu)", extent_size);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_large_extent_size) {
-	bool cache_oblivious;
-	unsigned nlextents, i;
-	size_t sz, extent_size_prev, ceil_prev;
-	size_t mib[4];
-	size_t miblen = sizeof(mib) / sizeof(size_t);
-
-	/*
-	 * Iterate over all large size classes, get their extent sizes, and
-	 * verify that the quantized size is the same as the extent size.
-	 */
-
-	sz = sizeof(bool);
-	assert_d_eq(mallctl("config.cache_oblivious", (void *)&cache_oblivious,
-	    &sz, NULL, 0), 0, "Unexpected mallctl failure");
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
-	    0), 0, "Unexpected mallctl failure");
-
-	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib failure");
-	for (i = 0; i < nlextents; i++) {
-		size_t lextent_size, extent_size, floor, ceil;
-
-		mib[2] = i;
-		sz = sizeof(size_t);
-		assert_d_eq(mallctlbymib(mib, miblen, (void *)&lextent_size,
-		    &sz, NULL, 0), 0, "Unexpected mallctlbymib failure");
-		extent_size = cache_oblivious ? lextent_size + PAGE :
-		    lextent_size;
-		floor = extent_size_quantize_floor(extent_size);
-		ceil = extent_size_quantize_ceil(extent_size);
-
-		assert_zu_eq(extent_size, floor,
-		    "Extent quantization should be a no-op for precise size "
-		    "(lextent_size=%zu, extent_size=%zu)", lextent_size,
-		    extent_size);
-		assert_zu_eq(extent_size, ceil,
-		    "Extent quantization should be a no-op for precise size "
-		    "(lextent_size=%zu, extent_size=%zu)", lextent_size,
-		    extent_size);
-
-		if (i > 0) {
-			assert_zu_eq(extent_size_prev,
-			    extent_size_quantize_floor(extent_size - PAGE),
-			    "Floor should be a precise size");
-			if (extent_size_prev < ceil_prev) {
-				assert_zu_eq(ceil_prev, extent_size,
-				    "Ceiling should be a precise size "
-				    "(extent_size_prev=%zu, ceil_prev=%zu, "
-				    "extent_size=%zu)", extent_size_prev,
-				    ceil_prev, extent_size);
-			}
-		}
-		if (i + 1 < nlextents) {
-			extent_size_prev = floor;
-			ceil_prev = extent_size_quantize_ceil(extent_size +
-			    PAGE);
-		}
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_monotonic) {
-#define SZ_MAX	ZU(4 * 1024 * 1024)
-	unsigned i;
-	size_t floor_prev, ceil_prev;
-
-	floor_prev = 0;
-	ceil_prev = 0;
-	for (i = 1; i <= SZ_MAX >> LG_PAGE; i++) {
-		size_t extent_size, floor, ceil;
-
-		extent_size = i << LG_PAGE;
-		floor = extent_size_quantize_floor(extent_size);
-		ceil = extent_size_quantize_ceil(extent_size);
-
-		assert_zu_le(floor, extent_size,
-		    "Floor should be <= (floor=%zu, extent_size=%zu, ceil=%zu)",
-		    floor, extent_size, ceil);
-		assert_zu_ge(ceil, extent_size,
-		    "Ceiling should be >= (floor=%zu, extent_size=%zu, "
-		    "ceil=%zu)", floor, extent_size, ceil);
-
-		assert_zu_le(floor_prev, floor, "Floor should be monotonic "
-		    "(floor_prev=%zu, floor=%zu, extent_size=%zu, ceil=%zu)",
-		    floor_prev, floor, extent_size, ceil);
-		assert_zu_le(ceil_prev, ceil, "Ceiling should be monotonic "
-		    "(floor=%zu, extent_size=%zu, ceil_prev=%zu, ceil=%zu)",
-		    floor, extent_size, ceil_prev, ceil);
-
-		floor_prev = floor;
-		ceil_prev = ceil;
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_small_extent_size,
-	    test_large_extent_size,
-	    test_monotonic);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/fork.c b/redis-stable/deps/jemalloc/test/unit/fork.c
deleted file mode 100644
index b1690750..00000000
--- a/redis-stable/deps/jemalloc/test/unit/fork.c
+++ /dev/null
@@ -1,141 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#ifndef _WIN32
-#include <sys/wait.h>
-#endif
-
-#ifndef _WIN32
-static void
-wait_for_child_exit(int pid) {
-	int status;
-	while (true) {
-		if (waitpid(pid, &status, 0) == -1) {
-			test_fail("Unexpected waitpid() failure.");
-		}
-		if (WIFSIGNALED(status)) {
-			test_fail("Unexpected child termination due to "
-			    "signal %d", WTERMSIG(status));
-			break;
-		}
-		if (WIFEXITED(status)) {
-			if (WEXITSTATUS(status) != 0) {
-				test_fail("Unexpected child exit value %d",
-				    WEXITSTATUS(status));
-			}
-			break;
-		}
-	}
-}
-#endif
-
-TEST_BEGIN(test_fork) {
-#ifndef _WIN32
-	void *p;
-	pid_t pid;
-
-	/* Set up a manually managed arena for test. */
-	unsigned arena_ind;
-	size_t sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-
-	/* Migrate to the new arena. */
-	unsigned old_arena_ind;
-	sz = sizeof(old_arena_ind);
-	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
-	    (void *)&arena_ind, sizeof(arena_ind)), 0,
-	    "Unexpected mallctl() failure");
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-
-	pid = fork();
-
-	free(p);
-
-	p = malloc(64);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-	free(p);
-
-	if (pid == -1) {
-		/* Error. */
-		test_fail("Unexpected fork() failure");
-	} else if (pid == 0) {
-		/* Child. */
-		_exit(0);
-	} else {
-		wait_for_child_exit(pid);
-	}
-#else
-	test_skip("fork(2) is irrelevant to Windows");
-#endif
-}
-TEST_END
-
-#ifndef _WIN32
-static void *
-do_fork_thd(void *arg) {
-	malloc(1);
-	int pid = fork();
-	if (pid == -1) {
-		/* Error. */
-		test_fail("Unexpected fork() failure");
-	} else if (pid == 0) {
-		/* Child. */
-		char *args[] = {"true", NULL};
-		execvp(args[0], args);
-		test_fail("Exec failed");
-	} else {
-		/* Parent */
-		wait_for_child_exit(pid);
-	}
-	return NULL;
-}
-#endif
-
-#ifndef _WIN32
-static void
-do_test_fork_multithreaded() {
-	thd_t child;
-	thd_create(&child, do_fork_thd, NULL);
-	do_fork_thd(NULL);
-	thd_join(child, NULL);
-}
-#endif
-
-TEST_BEGIN(test_fork_multithreaded) {
-#ifndef _WIN32
-	/*
-	 * We've seen bugs involving hanging on arenas_lock (though the same
-	 * class of bugs can happen on any mutex).  The bugs are intermittent
-	 * though, so we want to run the test multiple times.  Since we hold the
-	 * arenas lock only early in the process lifetime, we can't just run
-	 * this test in a loop (since, after all the arenas are initialized, we
-	 * won't acquire arenas_lock any further).  We therefore repeat the test
-	 * with multiple processes.
-	 */
-	for (int i = 0; i < 100; i++) {
-		int pid = fork();
-		if (pid == -1) {
-			/* Error. */
-			test_fail("Unexpected fork() failure,");
-		} else if (pid == 0) {
-			/* Child. */
-			do_test_fork_multithreaded();
-			_exit(0);
-		} else {
-			wait_for_child_exit(pid);
-		}
-	}
-#else
-	test_skip("fork(2) is irrelevant to Windows");
-#endif
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_fork,
-	    test_fork_multithreaded);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/hash.c b/redis-stable/deps/jemalloc/test/unit/hash.c
deleted file mode 100644
index 7cc034f8..00000000
--- a/redis-stable/deps/jemalloc/test/unit/hash.c
+++ /dev/null
@@ -1,173 +0,0 @@
-/*
- * This file is based on code that is part of SMHasher
- * (https://code.google.com/p/smhasher/), and is subject to the MIT license
- * (http://www.opensource.org/licenses/mit-license.php).  Both email addresses
- * associated with the source code's revision history belong to Austin Appleby,
- * and the revision history ranges from 2010 to 2012.  Therefore the copyright
- * and license are here taken to be:
- *
- * Copyright (c) 2010-2012 Austin Appleby
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
- * THE SOFTWARE.
- */
-
-#include "test/jemalloc_test.h"
-#include "jemalloc/internal/hash.h"
-
-typedef enum {
-	hash_variant_x86_32,
-	hash_variant_x86_128,
-	hash_variant_x64_128
-} hash_variant_t;
-
-static int
-hash_variant_bits(hash_variant_t variant) {
-	switch (variant) {
-	case hash_variant_x86_32: return 32;
-	case hash_variant_x86_128: return 128;
-	case hash_variant_x64_128: return 128;
-	default: not_reached();
-	}
-}
-
-static const char *
-hash_variant_string(hash_variant_t variant) {
-	switch (variant) {
-	case hash_variant_x86_32: return "hash_x86_32";
-	case hash_variant_x86_128: return "hash_x86_128";
-	case hash_variant_x64_128: return "hash_x64_128";
-	default: not_reached();
-	}
-}
-
-#define KEY_SIZE	256
-static void
-hash_variant_verify_key(hash_variant_t variant, uint8_t *key) {
-	const int hashbytes = hash_variant_bits(variant) / 8;
-	const int hashes_size = hashbytes * 256;
-	VARIABLE_ARRAY(uint8_t, hashes, hashes_size);
-	VARIABLE_ARRAY(uint8_t, final, hashbytes);
-	unsigned i;
-	uint32_t computed, expected;
-
-	memset(key, 0, KEY_SIZE);
-	memset(hashes, 0, hashes_size);
-	memset(final, 0, hashbytes);
-
-	/*
-	 * Hash keys of the form {0}, {0,1}, {0,1,2}, ..., {0,1,...,255} as the
-	 * seed.
-	 */
-	for (i = 0; i < 256; i++) {
-		key[i] = (uint8_t)i;
-		switch (variant) {
-		case hash_variant_x86_32: {
-			uint32_t out;
-			out = hash_x86_32(key, i, 256-i);
-			memcpy(&hashes[i*hashbytes], &out, hashbytes);
-			break;
-		} case hash_variant_x86_128: {
-			uint64_t out[2];
-			hash_x86_128(key, i, 256-i, out);
-			memcpy(&hashes[i*hashbytes], out, hashbytes);
-			break;
-		} case hash_variant_x64_128: {
-			uint64_t out[2];
-			hash_x64_128(key, i, 256-i, out);
-			memcpy(&hashes[i*hashbytes], out, hashbytes);
-			break;
-		} default: not_reached();
-		}
-	}
-
-	/* Hash the result array. */
-	switch (variant) {
-	case hash_variant_x86_32: {
-		uint32_t out = hash_x86_32(hashes, hashes_size, 0);
-		memcpy(final, &out, sizeof(out));
-		break;
-	} case hash_variant_x86_128: {
-		uint64_t out[2];
-		hash_x86_128(hashes, hashes_size, 0, out);
-		memcpy(final, out, sizeof(out));
-		break;
-	} case hash_variant_x64_128: {
-		uint64_t out[2];
-		hash_x64_128(hashes, hashes_size, 0, out);
-		memcpy(final, out, sizeof(out));
-		break;
-	} default: not_reached();
-	}
-
-	computed = (final[0] << 0) | (final[1] << 8) | (final[2] << 16) |
-	    (final[3] << 24);
-
-	switch (variant) {
-#ifdef JEMALLOC_BIG_ENDIAN
-	case hash_variant_x86_32: expected = 0x6213303eU; break;
-	case hash_variant_x86_128: expected = 0x266820caU; break;
-	case hash_variant_x64_128: expected = 0xcc622b6fU; break;
-#else
-	case hash_variant_x86_32: expected = 0xb0f57ee3U; break;
-	case hash_variant_x86_128: expected = 0xb3ece62aU; break;
-	case hash_variant_x64_128: expected = 0x6384ba69U; break;
-#endif
-	default: not_reached();
-	}
-
-	assert_u32_eq(computed, expected,
-	    "Hash mismatch for %s(): expected %#x but got %#x",
-	    hash_variant_string(variant), expected, computed);
-}
-
-static void
-hash_variant_verify(hash_variant_t variant) {
-#define MAX_ALIGN	16
-	uint8_t key[KEY_SIZE + (MAX_ALIGN - 1)];
-	unsigned i;
-
-	for (i = 0; i < MAX_ALIGN; i++) {
-		hash_variant_verify_key(variant, &key[i]);
-	}
-#undef MAX_ALIGN
-}
-#undef KEY_SIZE
-
-TEST_BEGIN(test_hash_x86_32) {
-	hash_variant_verify(hash_variant_x86_32);
-}
-TEST_END
-
-TEST_BEGIN(test_hash_x86_128) {
-	hash_variant_verify(hash_variant_x86_128);
-}
-TEST_END
-
-TEST_BEGIN(test_hash_x64_128) {
-	hash_variant_verify(hash_variant_x64_128);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_hash_x86_32,
-	    test_hash_x86_128,
-	    test_hash_x64_128);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/hooks.c b/redis-stable/deps/jemalloc/test/unit/hooks.c
deleted file mode 100644
index b70172e1..00000000
--- a/redis-stable/deps/jemalloc/test/unit/hooks.c
+++ /dev/null
@@ -1,38 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static bool hook_called = false;
-
-static void
-hook() {
-	hook_called = true;
-}
-
-static int
-func_to_hook(int arg1, int arg2) {
-	return arg1 + arg2;
-}
-
-#define func_to_hook JEMALLOC_HOOK(func_to_hook, hooks_libc_hook)
-
-TEST_BEGIN(unhooked_call) {
-	hooks_libc_hook = NULL;
-	hook_called = false;
-	assert_d_eq(3, func_to_hook(1, 2), "Hooking changed return value.");
-	assert_false(hook_called, "Nulling out hook didn't take.");
-}
-TEST_END
-
-TEST_BEGIN(hooked_call) {
-	hooks_libc_hook = &hook;
-	hook_called = false;
-	assert_d_eq(3, func_to_hook(1, 2), "Hooking changed return value.");
-	assert_true(hook_called, "Hook should have executed.");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    unhooked_call,
-	    hooked_call);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/junk.c b/redis-stable/deps/jemalloc/test/unit/junk.c
deleted file mode 100644
index 243ced41..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk.c
+++ /dev/null
@@ -1,141 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/util.h"
-
-static arena_dalloc_junk_small_t *arena_dalloc_junk_small_orig;
-static large_dalloc_junk_t *large_dalloc_junk_orig;
-static large_dalloc_maybe_junk_t *large_dalloc_maybe_junk_orig;
-static void *watch_for_junking;
-static bool saw_junking;
-
-static void
-watch_junking(void *p) {
-	watch_for_junking = p;
-	saw_junking = false;
-}
-
-static void
-arena_dalloc_junk_small_intercept(void *ptr, const bin_info_t *bin_info) {
-	size_t i;
-
-	arena_dalloc_junk_small_orig(ptr, bin_info);
-	for (i = 0; i < bin_info->reg_size; i++) {
-		assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK,
-		    "Missing junk fill for byte %zu/%zu of deallocated region",
-		    i, bin_info->reg_size);
-	}
-	if (ptr == watch_for_junking) {
-		saw_junking = true;
-	}
-}
-
-static void
-large_dalloc_junk_intercept(void *ptr, size_t usize) {
-	size_t i;
-
-	large_dalloc_junk_orig(ptr, usize);
-	for (i = 0; i < usize; i++) {
-		assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK,
-		    "Missing junk fill for byte %zu/%zu of deallocated region",
-		    i, usize);
-	}
-	if (ptr == watch_for_junking) {
-		saw_junking = true;
-	}
-}
-
-static void
-large_dalloc_maybe_junk_intercept(void *ptr, size_t usize) {
-	large_dalloc_maybe_junk_orig(ptr, usize);
-	if (ptr == watch_for_junking) {
-		saw_junking = true;
-	}
-}
-
-static void
-test_junk(size_t sz_min, size_t sz_max) {
-	uint8_t *s;
-	size_t sz_prev, sz, i;
-
-	if (opt_junk_free) {
-		arena_dalloc_junk_small_orig = arena_dalloc_junk_small;
-		arena_dalloc_junk_small = arena_dalloc_junk_small_intercept;
-		large_dalloc_junk_orig = large_dalloc_junk;
-		large_dalloc_junk = large_dalloc_junk_intercept;
-		large_dalloc_maybe_junk_orig = large_dalloc_maybe_junk;
-		large_dalloc_maybe_junk = large_dalloc_maybe_junk_intercept;
-	}
-
-	sz_prev = 0;
-	s = (uint8_t *)mallocx(sz_min, 0);
-	assert_ptr_not_null((void *)s, "Unexpected mallocx() failure");
-
-	for (sz = sallocx(s, 0); sz <= sz_max;
-	    sz_prev = sz, sz = sallocx(s, 0)) {
-		if (sz_prev > 0) {
-			assert_u_eq(s[0], 'a',
-			    "Previously allocated byte %zu/%zu is corrupted",
-			    ZU(0), sz_prev);
-			assert_u_eq(s[sz_prev-1], 'a',
-			    "Previously allocated byte %zu/%zu is corrupted",
-			    sz_prev-1, sz_prev);
-		}
-
-		for (i = sz_prev; i < sz; i++) {
-			if (opt_junk_alloc) {
-				assert_u_eq(s[i], JEMALLOC_ALLOC_JUNK,
-				    "Newly allocated byte %zu/%zu isn't "
-				    "junk-filled", i, sz);
-			}
-			s[i] = 'a';
-		}
-
-		if (xallocx(s, sz+1, 0, 0) == sz) {
-			uint8_t *t;
-			watch_junking(s);
-			t = (uint8_t *)rallocx(s, sz+1, 0);
-			assert_ptr_not_null((void *)t,
-			    "Unexpected rallocx() failure");
-			assert_zu_ge(sallocx(t, 0), sz+1,
-			    "Unexpectedly small rallocx() result");
-			if (!background_thread_enabled()) {
-				assert_ptr_ne(s, t,
-				    "Unexpected in-place rallocx()");
-				assert_true(!opt_junk_free || saw_junking,
-				    "Expected region of size %zu to be "
-				    "junk-filled", sz);
-			}
-			s = t;
-		}
-	}
-
-	watch_junking(s);
-	dallocx(s, 0);
-	assert_true(!opt_junk_free || saw_junking,
-	    "Expected region of size %zu to be junk-filled", sz);
-
-	if (opt_junk_free) {
-		arena_dalloc_junk_small = arena_dalloc_junk_small_orig;
-		large_dalloc_junk = large_dalloc_junk_orig;
-		large_dalloc_maybe_junk = large_dalloc_maybe_junk_orig;
-	}
-}
-
-TEST_BEGIN(test_junk_small) {
-	test_skip_if(!config_fill);
-	test_junk(1, SMALL_MAXCLASS-1);
-}
-TEST_END
-
-TEST_BEGIN(test_junk_large) {
-	test_skip_if(!config_fill);
-	test_junk(SMALL_MAXCLASS+1, (1U << (LG_LARGE_MINCLASS+1)));
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_junk_small,
-	    test_junk_large);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/junk.sh b/redis-stable/deps/jemalloc/test/unit/junk.sh
deleted file mode 100644
index 97cd8ca5..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="abort:false,zero:false,junk:true"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_alloc.c b/redis-stable/deps/jemalloc/test/unit/junk_alloc.c
deleted file mode 100644
index a442a0ca..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk_alloc.c
+++ /dev/null
@@ -1 +0,0 @@
-#include "junk.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh b/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
deleted file mode 100644
index e1008c2e..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk_alloc.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="abort:false,zero:false,junk:alloc"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_free.c b/redis-stable/deps/jemalloc/test/unit/junk_free.c
deleted file mode 100644
index a442a0ca..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk_free.c
+++ /dev/null
@@ -1 +0,0 @@
-#include "junk.c"
diff --git a/redis-stable/deps/jemalloc/test/unit/junk_free.sh b/redis-stable/deps/jemalloc/test/unit/junk_free.sh
deleted file mode 100644
index 402196ca..00000000
--- a/redis-stable/deps/jemalloc/test/unit/junk_free.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="abort:false,zero:false,junk:free"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/log.c b/redis-stable/deps/jemalloc/test/unit/log.c
deleted file mode 100644
index a52bd737..00000000
--- a/redis-stable/deps/jemalloc/test/unit/log.c
+++ /dev/null
@@ -1,193 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/log.h"
-
-static void
-expect_no_logging(const char *names) {
-	log_var_t log_l1 = LOG_VAR_INIT("l1");
-	log_var_t log_l2 = LOG_VAR_INIT("l2");
-	log_var_t log_l2_a = LOG_VAR_INIT("l2.a");
-
-	strcpy(log_var_names, names);
-
-	int count = 0;
-
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1)
-			count++;
-		log_do_end(log_l1)
-
-		log_do_begin(log_l2)
-			count++;
-		log_do_end(log_l2)
-
-		log_do_begin(log_l2_a)
-			count++;
-		log_do_end(log_l2_a)
-	}
-	assert_d_eq(count, 0, "Disabled logging not ignored!");
-}
-
-TEST_BEGIN(test_log_disabled) {
-	test_skip_if(!config_log);
-	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
-	expect_no_logging("");
-	expect_no_logging("abc");
-	expect_no_logging("a.b.c");
-	expect_no_logging("l12");
-	expect_no_logging("l123|a456|b789");
-	expect_no_logging("|||");
-}
-TEST_END
-
-TEST_BEGIN(test_log_enabled_direct) {
-	test_skip_if(!config_log);
-	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
-	log_var_t log_l1 = LOG_VAR_INIT("l1");
-	log_var_t log_l1_a = LOG_VAR_INIT("l1.a");
-	log_var_t log_l2 = LOG_VAR_INIT("l2");
-
-	int count;
-
-	count = 0;
-	strcpy(log_var_names, "l1");
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1)
-			count++;
-		log_do_end(log_l1)
-	}
-	assert_d_eq(count, 10, "Mis-logged!");
-
-	count = 0;
-	strcpy(log_var_names, "l1.a");
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1_a)
-			count++;
-		log_do_end(log_l1_a)
-	}
-	assert_d_eq(count, 10, "Mis-logged!");
-
-	count = 0;
-	strcpy(log_var_names, "l1.a|abc|l2|def");
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1_a)
-			count++;
-		log_do_end(log_l1_a)
-
-		log_do_begin(log_l2)
-			count++;
-		log_do_end(log_l2)
-	}
-	assert_d_eq(count, 20, "Mis-logged!");
-}
-TEST_END
-
-TEST_BEGIN(test_log_enabled_indirect) {
-	test_skip_if(!config_log);
-	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
-	strcpy(log_var_names, "l0|l1|abc|l2.b|def");
-
-	/* On. */
-	log_var_t log_l1 = LOG_VAR_INIT("l1");
-	/* Off. */
-	log_var_t log_l1a = LOG_VAR_INIT("l1a");
-	/* On. */
-	log_var_t log_l1_a = LOG_VAR_INIT("l1.a");
-	/* Off. */
-	log_var_t log_l2_a = LOG_VAR_INIT("l2.a");
-	/* On. */
-	log_var_t log_l2_b_a = LOG_VAR_INIT("l2.b.a");
-	/* On. */
-	log_var_t log_l2_b_b = LOG_VAR_INIT("l2.b.b");
-
-	/* 4 are on total, so should sum to 40. */
-	int count = 0;
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1)
-			count++;
-		log_do_end(log_l1)
-
-		log_do_begin(log_l1a)
-			count++;
-		log_do_end(log_l1a)
-
-		log_do_begin(log_l1_a)
-			count++;
-		log_do_end(log_l1_a)
-
-		log_do_begin(log_l2_a)
-			count++;
-		log_do_end(log_l2_a)
-
-		log_do_begin(log_l2_b_a)
-			count++;
-		log_do_end(log_l2_b_a)
-
-		log_do_begin(log_l2_b_b)
-			count++;
-		log_do_end(log_l2_b_b)
-	}
-
-	assert_d_eq(count, 40, "Mis-logged!");
-}
-TEST_END
-
-TEST_BEGIN(test_log_enabled_global) {
-	test_skip_if(!config_log);
-	atomic_store_b(&log_init_done, true, ATOMIC_RELAXED);
-	strcpy(log_var_names, "abc|.|def");
-
-	log_var_t log_l1 = LOG_VAR_INIT("l1");
-	log_var_t log_l2_a_a = LOG_VAR_INIT("l2.a.a");
-
-	int count = 0;
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(log_l1)
-		    count++;
-		log_do_end(log_l1)
-
-		log_do_begin(log_l2_a_a)
-		    count++;
-		log_do_end(log_l2_a_a)
-	}
-	assert_d_eq(count, 20, "Mis-logged!");
-}
-TEST_END
-
-TEST_BEGIN(test_logs_if_no_init) {
-	test_skip_if(!config_log);
-	atomic_store_b(&log_init_done, false, ATOMIC_RELAXED);
-
-	log_var_t l = LOG_VAR_INIT("definitely.not.enabled");
-
-	int count = 0;
-	for (int i = 0; i < 10; i++) {
-		log_do_begin(l)
-			count++;
-		log_do_end(l)
-	}
-	assert_d_eq(count, 0, "Logging shouldn't happen if not initialized.");
-}
-TEST_END
-
-/*
- * This really just checks to make sure that this usage compiles; we don't have
- * any test code to run.
- */
-TEST_BEGIN(test_log_only_format_string) {
-	if (false) {
-		LOG("log_str", "No arguments follow this format string.");
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_log_disabled,
-	    test_log_enabled_direct,
-	    test_log_enabled_indirect,
-	    test_log_enabled_global,
-	    test_logs_if_no_init,
-	    test_log_only_format_string);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/mallctl.c b/redis-stable/deps/jemalloc/test/unit/mallctl.c
deleted file mode 100644
index 1ecbab08..00000000
--- a/redis-stable/deps/jemalloc/test/unit/mallctl.c
+++ /dev/null
@@ -1,805 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/util.h"
-
-TEST_BEGIN(test_mallctl_errors) {
-	uint64_t epoch;
-	size_t sz;
-
-	assert_d_eq(mallctl("no_such_name", NULL, NULL, NULL, 0), ENOENT,
-	    "mallctl() should return ENOENT for non-existent names");
-
-	assert_d_eq(mallctl("version", NULL, NULL, "0.0.0", strlen("0.0.0")),
-	    EPERM, "mallctl() should return EPERM on attempt to write "
-	    "read-only value");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
-	    sizeof(epoch)-1), EINVAL,
-	    "mallctl() should return EINVAL for input size mismatch");
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
-	    sizeof(epoch)+1), EINVAL,
-	    "mallctl() should return EINVAL for input size mismatch");
-
-	sz = sizeof(epoch)-1;
-	assert_d_eq(mallctl("epoch", (void *)&epoch, &sz, NULL, 0), EINVAL,
-	    "mallctl() should return EINVAL for output size mismatch");
-	sz = sizeof(epoch)+1;
-	assert_d_eq(mallctl("epoch", (void *)&epoch, &sz, NULL, 0), EINVAL,
-	    "mallctl() should return EINVAL for output size mismatch");
-}
-TEST_END
-
-TEST_BEGIN(test_mallctlnametomib_errors) {
-	size_t mib[1];
-	size_t miblen;
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("no_such_name", mib, &miblen), ENOENT,
-	    "mallctlnametomib() should return ENOENT for non-existent names");
-}
-TEST_END
-
-TEST_BEGIN(test_mallctlbymib_errors) {
-	uint64_t epoch;
-	size_t sz;
-	size_t mib[1];
-	size_t miblen;
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("version", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, "0.0.0",
-	    strlen("0.0.0")), EPERM, "mallctl() should return EPERM on "
-	    "attempt to write read-only value");
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("epoch", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&epoch,
-	    sizeof(epoch)-1), EINVAL,
-	    "mallctlbymib() should return EINVAL for input size mismatch");
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, (void *)&epoch,
-	    sizeof(epoch)+1), EINVAL,
-	    "mallctlbymib() should return EINVAL for input size mismatch");
-
-	sz = sizeof(epoch)-1;
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&epoch, &sz, NULL, 0),
-	    EINVAL,
-	    "mallctlbymib() should return EINVAL for output size mismatch");
-	sz = sizeof(epoch)+1;
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&epoch, &sz, NULL, 0),
-	    EINVAL,
-	    "mallctlbymib() should return EINVAL for output size mismatch");
-}
-TEST_END
-
-TEST_BEGIN(test_mallctl_read_write) {
-	uint64_t old_epoch, new_epoch;
-	size_t sz = sizeof(old_epoch);
-
-	/* Blind. */
-	assert_d_eq(mallctl("epoch", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
-
-	/* Read. */
-	assert_d_eq(mallctl("epoch", (void *)&old_epoch, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
-
-	/* Write. */
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&new_epoch,
-	    sizeof(new_epoch)), 0, "Unexpected mallctl() failure");
-	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
-
-	/* Read+write. */
-	assert_d_eq(mallctl("epoch", (void *)&old_epoch, &sz,
-	    (void *)&new_epoch, sizeof(new_epoch)), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(sz, sizeof(old_epoch), "Unexpected output size");
-}
-TEST_END
-
-TEST_BEGIN(test_mallctlnametomib_short_mib) {
-	size_t mib[4];
-	size_t miblen;
-
-	miblen = 3;
-	mib[3] = 42;
-	assert_d_eq(mallctlnametomib("arenas.bin.0.nregs", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	assert_zu_eq(miblen, 3, "Unexpected mib output length");
-	assert_zu_eq(mib[3], 42,
-	    "mallctlnametomib() wrote past the end of the input mib");
-}
-TEST_END
-
-TEST_BEGIN(test_mallctl_config) {
-#define TEST_MALLCTL_CONFIG(config, t) do {				\
-	t oldval;							\
-	size_t sz = sizeof(oldval);					\
-	assert_d_eq(mallctl("config."#config, (void *)&oldval, &sz,	\
-	    NULL, 0), 0, "Unexpected mallctl() failure");		\
-	assert_b_eq(oldval, config_##config, "Incorrect config value");	\
-	assert_zu_eq(sz, sizeof(oldval), "Unexpected output size");	\
-} while (0)
-
-	TEST_MALLCTL_CONFIG(cache_oblivious, bool);
-	TEST_MALLCTL_CONFIG(debug, bool);
-	TEST_MALLCTL_CONFIG(fill, bool);
-	TEST_MALLCTL_CONFIG(lazy_lock, bool);
-	TEST_MALLCTL_CONFIG(malloc_conf, const char *);
-	TEST_MALLCTL_CONFIG(prof, bool);
-	TEST_MALLCTL_CONFIG(prof_libgcc, bool);
-	TEST_MALLCTL_CONFIG(prof_libunwind, bool);
-	TEST_MALLCTL_CONFIG(stats, bool);
-	TEST_MALLCTL_CONFIG(utrace, bool);
-	TEST_MALLCTL_CONFIG(xmalloc, bool);
-
-#undef TEST_MALLCTL_CONFIG
-}
-TEST_END
-
-TEST_BEGIN(test_mallctl_opt) {
-	bool config_always = true;
-
-#define TEST_MALLCTL_OPT(t, opt, config) do {				\
-	t oldval;							\
-	size_t sz = sizeof(oldval);					\
-	int expected = config_##config ? 0 : ENOENT;			\
-	int result = mallctl("opt."#opt, (void *)&oldval, &sz, NULL,	\
-	    0);								\
-	assert_d_eq(result, expected,					\
-	    "Unexpected mallctl() result for opt."#opt);		\
-	assert_zu_eq(sz, sizeof(oldval), "Unexpected output size");	\
-} while (0)
-
-	TEST_MALLCTL_OPT(bool, abort, always);
-	TEST_MALLCTL_OPT(bool, abort_conf, always);
-	TEST_MALLCTL_OPT(const char *, metadata_thp, always);
-	TEST_MALLCTL_OPT(bool, retain, always);
-	TEST_MALLCTL_OPT(const char *, dss, always);
-	TEST_MALLCTL_OPT(unsigned, narenas, always);
-	TEST_MALLCTL_OPT(const char *, percpu_arena, always);
-	TEST_MALLCTL_OPT(bool, background_thread, always);
-	TEST_MALLCTL_OPT(ssize_t, dirty_decay_ms, always);
-	TEST_MALLCTL_OPT(ssize_t, muzzy_decay_ms, always);
-	TEST_MALLCTL_OPT(bool, stats_print, always);
-	TEST_MALLCTL_OPT(const char *, junk, fill);
-	TEST_MALLCTL_OPT(bool, zero, fill);
-	TEST_MALLCTL_OPT(bool, utrace, utrace);
-	TEST_MALLCTL_OPT(bool, xmalloc, xmalloc);
-	TEST_MALLCTL_OPT(bool, tcache, always);
-	TEST_MALLCTL_OPT(size_t, lg_extent_max_active_fit, always);
-	TEST_MALLCTL_OPT(size_t, lg_tcache_max, always);
-	TEST_MALLCTL_OPT(const char *, thp, always);
-	TEST_MALLCTL_OPT(bool, prof, prof);
-	TEST_MALLCTL_OPT(const char *, prof_prefix, prof);
-	TEST_MALLCTL_OPT(bool, prof_active, prof);
-	TEST_MALLCTL_OPT(ssize_t, lg_prof_sample, prof);
-	TEST_MALLCTL_OPT(bool, prof_accum, prof);
-	TEST_MALLCTL_OPT(ssize_t, lg_prof_interval, prof);
-	TEST_MALLCTL_OPT(bool, prof_gdump, prof);
-	TEST_MALLCTL_OPT(bool, prof_final, prof);
-	TEST_MALLCTL_OPT(bool, prof_leak, prof);
-
-#undef TEST_MALLCTL_OPT
-}
-TEST_END
-
-TEST_BEGIN(test_manpage_example) {
-	unsigned nbins, i;
-	size_t mib[4];
-	size_t len, miblen;
-
-	len = sizeof(nbins);
-	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &len, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	miblen = 4;
-	assert_d_eq(mallctlnametomib("arenas.bin.0.size", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	for (i = 0; i < nbins; i++) {
-		size_t bin_size;
-
-		mib[2] = i;
-		len = sizeof(bin_size);
-		assert_d_eq(mallctlbymib(mib, miblen, (void *)&bin_size, &len,
-		    NULL, 0), 0, "Unexpected mallctlbymib() failure");
-		/* Do something with bin_size... */
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_tcache_none) {
-	test_skip_if(!opt_tcache);
-
-	/* Allocate p and q. */
-	void *p0 = mallocx(42, 0);
-	assert_ptr_not_null(p0, "Unexpected mallocx() failure");
-	void *q = mallocx(42, 0);
-	assert_ptr_not_null(q, "Unexpected mallocx() failure");
-
-	/* Deallocate p and q, but bypass the tcache for q. */
-	dallocx(p0, 0);
-	dallocx(q, MALLOCX_TCACHE_NONE);
-
-	/* Make sure that tcache-based allocation returns p, not q. */
-	void *p1 = mallocx(42, 0);
-	assert_ptr_not_null(p1, "Unexpected mallocx() failure");
-	assert_ptr_eq(p0, p1, "Expected tcache to allocate cached region");
-
-	/* Clean up. */
-	dallocx(p1, MALLOCX_TCACHE_NONE);
-}
-TEST_END
-
-TEST_BEGIN(test_tcache) {
-#define NTCACHES	10
-	unsigned tis[NTCACHES];
-	void *ps[NTCACHES];
-	void *qs[NTCACHES];
-	unsigned i;
-	size_t sz, psz, qsz;
-
-	psz = 42;
-	qsz = nallocx(psz, 0) + 1;
-
-	/* Create tcaches. */
-	for (i = 0; i < NTCACHES; i++) {
-		sz = sizeof(unsigned);
-		assert_d_eq(mallctl("tcache.create", (void *)&tis[i], &sz, NULL,
-		    0), 0, "Unexpected mallctl() failure, i=%u", i);
-	}
-
-	/* Exercise tcache ID recycling. */
-	for (i = 0; i < NTCACHES; i++) {
-		assert_d_eq(mallctl("tcache.destroy", NULL, NULL,
-		    (void *)&tis[i], sizeof(unsigned)), 0,
-		    "Unexpected mallctl() failure, i=%u", i);
-	}
-	for (i = 0; i < NTCACHES; i++) {
-		sz = sizeof(unsigned);
-		assert_d_eq(mallctl("tcache.create", (void *)&tis[i], &sz, NULL,
-		    0), 0, "Unexpected mallctl() failure, i=%u", i);
-	}
-
-	/* Flush empty tcaches. */
-	for (i = 0; i < NTCACHES; i++) {
-		assert_d_eq(mallctl("tcache.flush", NULL, NULL, (void *)&tis[i],
-		    sizeof(unsigned)), 0, "Unexpected mallctl() failure, i=%u",
-		    i);
-	}
-
-	/* Cache some allocations. */
-	for (i = 0; i < NTCACHES; i++) {
-		ps[i] = mallocx(psz, MALLOCX_TCACHE(tis[i]));
-		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure, i=%u",
-		    i);
-		dallocx(ps[i], MALLOCX_TCACHE(tis[i]));
-
-		qs[i] = mallocx(qsz, MALLOCX_TCACHE(tis[i]));
-		assert_ptr_not_null(qs[i], "Unexpected mallocx() failure, i=%u",
-		    i);
-		dallocx(qs[i], MALLOCX_TCACHE(tis[i]));
-	}
-
-	/* Verify that tcaches allocate cached regions. */
-	for (i = 0; i < NTCACHES; i++) {
-		void *p0 = ps[i];
-		ps[i] = mallocx(psz, MALLOCX_TCACHE(tis[i]));
-		assert_ptr_not_null(ps[i], "Unexpected mallocx() failure, i=%u",
-		    i);
-		assert_ptr_eq(ps[i], p0,
-		    "Expected mallocx() to allocate cached region, i=%u", i);
-	}
-
-	/* Verify that reallocation uses cached regions. */
-	for (i = 0; i < NTCACHES; i++) {
-		void *q0 = qs[i];
-		qs[i] = rallocx(ps[i], qsz, MALLOCX_TCACHE(tis[i]));
-		assert_ptr_not_null(qs[i], "Unexpected rallocx() failure, i=%u",
-		    i);
-		assert_ptr_eq(qs[i], q0,
-		    "Expected rallocx() to allocate cached region, i=%u", i);
-		/* Avoid undefined behavior in case of test failure. */
-		if (qs[i] == NULL) {
-			qs[i] = ps[i];
-		}
-	}
-	for (i = 0; i < NTCACHES; i++) {
-		dallocx(qs[i], MALLOCX_TCACHE(tis[i]));
-	}
-
-	/* Flush some non-empty tcaches. */
-	for (i = 0; i < NTCACHES/2; i++) {
-		assert_d_eq(mallctl("tcache.flush", NULL, NULL, (void *)&tis[i],
-		    sizeof(unsigned)), 0, "Unexpected mallctl() failure, i=%u",
-		    i);
-	}
-
-	/* Destroy tcaches. */
-	for (i = 0; i < NTCACHES; i++) {
-		assert_d_eq(mallctl("tcache.destroy", NULL, NULL,
-		    (void *)&tis[i], sizeof(unsigned)), 0,
-		    "Unexpected mallctl() failure, i=%u", i);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_thread_arena) {
-	unsigned old_arena_ind, new_arena_ind, narenas;
-
-	const char *opa;
-	size_t sz = sizeof(opa);
-	assert_d_eq(mallctl("opt.percpu_arena", (void *)&opa, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	assert_u_eq(narenas, opt_narenas, "Number of arenas incorrect");
-
-	if (strcmp(opa, "disabled") == 0) {
-		new_arena_ind = narenas - 1;
-		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
-		    (void *)&new_arena_ind, sizeof(unsigned)), 0,
-		    "Unexpected mallctl() failure");
-		new_arena_ind = 0;
-		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
-		    (void *)&new_arena_ind, sizeof(unsigned)), 0,
-		    "Unexpected mallctl() failure");
-	} else {
-		assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
-		    NULL, 0), 0, "Unexpected mallctl() failure");
-		new_arena_ind = percpu_arena_ind_limit(opt_percpu_arena) - 1;
-		if (old_arena_ind != new_arena_ind) {
-			assert_d_eq(mallctl("thread.arena",
-			    (void *)&old_arena_ind, &sz, (void *)&new_arena_ind,
-			    sizeof(unsigned)), EPERM, "thread.arena ctl "
-			    "should not be allowed with percpu arena");
-		}
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_initialized) {
-	unsigned narenas, i;
-	size_t sz;
-	size_t mib[3];
-	size_t miblen = sizeof(mib) / sizeof(size_t);
-	bool initialized;
-
-	sz = sizeof(narenas);
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctlnametomib("arena.0.initialized", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	for (i = 0; i < narenas; i++) {
-		mib[1] = i;
-		sz = sizeof(initialized);
-		assert_d_eq(mallctlbymib(mib, miblen, &initialized, &sz, NULL,
-		    0), 0, "Unexpected mallctl() failure");
-	}
-
-	mib[1] = MALLCTL_ARENAS_ALL;
-	sz = sizeof(initialized);
-	assert_d_eq(mallctlbymib(mib, miblen, &initialized, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_true(initialized,
-	    "Merged arena statistics should always be initialized");
-
-	/* Equivalent to the above but using mallctl() directly. */
-	sz = sizeof(initialized);
-	assert_d_eq(mallctl(
-	    "arena." STRINGIFY(MALLCTL_ARENAS_ALL) ".initialized",
-	    (void *)&initialized, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_true(initialized,
-	    "Merged arena statistics should always be initialized");
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_dirty_decay_ms) {
-	ssize_t dirty_decay_ms, orig_dirty_decay_ms, prev_dirty_decay_ms;
-	size_t sz = sizeof(ssize_t);
-
-	assert_d_eq(mallctl("arena.0.dirty_decay_ms",
-	    (void *)&orig_dirty_decay_ms, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	dirty_decay_ms = -2;
-	assert_d_eq(mallctl("arena.0.dirty_decay_ms", NULL, NULL,
-	    (void *)&dirty_decay_ms, sizeof(ssize_t)), EFAULT,
-	    "Unexpected mallctl() success");
-
-	dirty_decay_ms = 0x7fffffff;
-	assert_d_eq(mallctl("arena.0.dirty_decay_ms", NULL, NULL,
-	    (void *)&dirty_decay_ms, sizeof(ssize_t)), 0,
-	    "Unexpected mallctl() failure");
-
-	for (prev_dirty_decay_ms = dirty_decay_ms, dirty_decay_ms = -1;
-	    dirty_decay_ms < 20; prev_dirty_decay_ms = dirty_decay_ms,
-	    dirty_decay_ms++) {
-		ssize_t old_dirty_decay_ms;
-
-		assert_d_eq(mallctl("arena.0.dirty_decay_ms",
-		    (void *)&old_dirty_decay_ms, &sz, (void *)&dirty_decay_ms,
-		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
-		assert_zd_eq(old_dirty_decay_ms, prev_dirty_decay_ms,
-		    "Unexpected old arena.0.dirty_decay_ms");
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_muzzy_decay_ms) {
-	ssize_t muzzy_decay_ms, orig_muzzy_decay_ms, prev_muzzy_decay_ms;
-	size_t sz = sizeof(ssize_t);
-
-	assert_d_eq(mallctl("arena.0.muzzy_decay_ms",
-	    (void *)&orig_muzzy_decay_ms, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	muzzy_decay_ms = -2;
-	assert_d_eq(mallctl("arena.0.muzzy_decay_ms", NULL, NULL,
-	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), EFAULT,
-	    "Unexpected mallctl() success");
-
-	muzzy_decay_ms = 0x7fffffff;
-	assert_d_eq(mallctl("arena.0.muzzy_decay_ms", NULL, NULL,
-	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), 0,
-	    "Unexpected mallctl() failure");
-
-	for (prev_muzzy_decay_ms = muzzy_decay_ms, muzzy_decay_ms = -1;
-	    muzzy_decay_ms < 20; prev_muzzy_decay_ms = muzzy_decay_ms,
-	    muzzy_decay_ms++) {
-		ssize_t old_muzzy_decay_ms;
-
-		assert_d_eq(mallctl("arena.0.muzzy_decay_ms",
-		    (void *)&old_muzzy_decay_ms, &sz, (void *)&muzzy_decay_ms,
-		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
-		assert_zd_eq(old_muzzy_decay_ms, prev_muzzy_decay_ms,
-		    "Unexpected old arena.0.muzzy_decay_ms");
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_purge) {
-	unsigned narenas;
-	size_t sz = sizeof(unsigned);
-	size_t mib[3];
-	size_t miblen = 3;
-
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctlnametomib("arena.0.purge", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = narenas;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-
-	mib[1] = MALLCTL_ARENAS_ALL;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_decay) {
-	unsigned narenas;
-	size_t sz = sizeof(unsigned);
-	size_t mib[3];
-	size_t miblen = 3;
-
-	assert_d_eq(mallctl("arena.0.decay", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctlnametomib("arena.0.decay", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = narenas;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-
-	mib[1] = MALLCTL_ARENAS_ALL;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_dss) {
-	const char *dss_prec_old, *dss_prec_new;
-	size_t sz = sizeof(dss_prec_old);
-	size_t mib[3];
-	size_t miblen;
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.dss", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() error");
-
-	dss_prec_new = "disabled";
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz,
-	    (void *)&dss_prec_new, sizeof(dss_prec_new)), 0,
-	    "Unexpected mallctl() failure");
-	assert_str_ne(dss_prec_old, "primary",
-	    "Unexpected default for dss precedence");
-
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_new, &sz,
-	    (void *)&dss_prec_old, sizeof(dss_prec_old)), 0,
-	    "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz, NULL,
-	    0), 0, "Unexpected mallctl() failure");
-	assert_str_ne(dss_prec_old, "primary",
-	    "Unexpected value for dss precedence");
-
-	mib[1] = narenas_total_get();
-	dss_prec_new = "disabled";
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz,
-	    (void *)&dss_prec_new, sizeof(dss_prec_new)), 0,
-	    "Unexpected mallctl() failure");
-	assert_str_ne(dss_prec_old, "primary",
-	    "Unexpected default for dss precedence");
-
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_new, &sz,
-	    (void *)&dss_prec_old, sizeof(dss_prec_new)), 0,
-	    "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&dss_prec_old, &sz, NULL,
-	    0), 0, "Unexpected mallctl() failure");
-	assert_str_ne(dss_prec_old, "primary",
-	    "Unexpected value for dss precedence");
-}
-TEST_END
-
-TEST_BEGIN(test_arena_i_retain_grow_limit) {
-	size_t old_limit, new_limit, default_limit;
-	size_t mib[3];
-	size_t miblen;
-
-	bool retain_enabled;
-	size_t sz = sizeof(retain_enabled);
-	assert_d_eq(mallctl("opt.retain", &retain_enabled, &sz, NULL, 0),
-	    0, "Unexpected mallctl() failure");
-	test_skip_if(!retain_enabled);
-
-	sz = sizeof(default_limit);
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.retain_grow_limit", mib, &miblen),
-	    0, "Unexpected mallctlnametomib() error");
-
-	assert_d_eq(mallctlbymib(mib, miblen, &default_limit, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(default_limit, sz_pind2sz(EXTENT_GROW_MAX_PIND),
-	    "Unexpected default for retain_grow_limit");
-
-	new_limit = PAGE - 1;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
-	    sizeof(new_limit)), EFAULT, "Unexpected mallctl() success");
-
-	new_limit = PAGE + 1;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
-	    sizeof(new_limit)), 0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctlbymib(mib, miblen, &old_limit, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(old_limit, PAGE,
-	    "Unexpected value for retain_grow_limit");
-
-	/* Expect grow less than psize class 10. */
-	new_limit = sz_pind2sz(10) - 1;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &new_limit,
-	    sizeof(new_limit)), 0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctlbymib(mib, miblen, &old_limit, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_zu_eq(old_limit, sz_pind2sz(9),
-	    "Unexpected value for retain_grow_limit");
-
-	/* Restore to default. */
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, &default_limit,
-	    sizeof(default_limit)), 0, "Unexpected mallctl() failure");
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_dirty_decay_ms) {
-	ssize_t dirty_decay_ms, orig_dirty_decay_ms, prev_dirty_decay_ms;
-	size_t sz = sizeof(ssize_t);
-
-	assert_d_eq(mallctl("arenas.dirty_decay_ms",
-	    (void *)&orig_dirty_decay_ms, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	dirty_decay_ms = -2;
-	assert_d_eq(mallctl("arenas.dirty_decay_ms", NULL, NULL,
-	    (void *)&dirty_decay_ms, sizeof(ssize_t)), EFAULT,
-	    "Unexpected mallctl() success");
-
-	dirty_decay_ms = 0x7fffffff;
-	assert_d_eq(mallctl("arenas.dirty_decay_ms", NULL, NULL,
-	    (void *)&dirty_decay_ms, sizeof(ssize_t)), 0,
-	    "Expected mallctl() failure");
-
-	for (prev_dirty_decay_ms = dirty_decay_ms, dirty_decay_ms = -1;
-	    dirty_decay_ms < 20; prev_dirty_decay_ms = dirty_decay_ms,
-	    dirty_decay_ms++) {
-		ssize_t old_dirty_decay_ms;
-
-		assert_d_eq(mallctl("arenas.dirty_decay_ms",
-		    (void *)&old_dirty_decay_ms, &sz, (void *)&dirty_decay_ms,
-		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
-		assert_zd_eq(old_dirty_decay_ms, prev_dirty_decay_ms,
-		    "Unexpected old arenas.dirty_decay_ms");
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_muzzy_decay_ms) {
-	ssize_t muzzy_decay_ms, orig_muzzy_decay_ms, prev_muzzy_decay_ms;
-	size_t sz = sizeof(ssize_t);
-
-	assert_d_eq(mallctl("arenas.muzzy_decay_ms",
-	    (void *)&orig_muzzy_decay_ms, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	muzzy_decay_ms = -2;
-	assert_d_eq(mallctl("arenas.muzzy_decay_ms", NULL, NULL,
-	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), EFAULT,
-	    "Unexpected mallctl() success");
-
-	muzzy_decay_ms = 0x7fffffff;
-	assert_d_eq(mallctl("arenas.muzzy_decay_ms", NULL, NULL,
-	    (void *)&muzzy_decay_ms, sizeof(ssize_t)), 0,
-	    "Expected mallctl() failure");
-
-	for (prev_muzzy_decay_ms = muzzy_decay_ms, muzzy_decay_ms = -1;
-	    muzzy_decay_ms < 20; prev_muzzy_decay_ms = muzzy_decay_ms,
-	    muzzy_decay_ms++) {
-		ssize_t old_muzzy_decay_ms;
-
-		assert_d_eq(mallctl("arenas.muzzy_decay_ms",
-		    (void *)&old_muzzy_decay_ms, &sz, (void *)&muzzy_decay_ms,
-		    sizeof(ssize_t)), 0, "Unexpected mallctl() failure");
-		assert_zd_eq(old_muzzy_decay_ms, prev_muzzy_decay_ms,
-		    "Unexpected old arenas.muzzy_decay_ms");
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_constants) {
-#define TEST_ARENAS_CONSTANT(t, name, expected) do {			\
-	t name;								\
-	size_t sz = sizeof(t);						\
-	assert_d_eq(mallctl("arenas."#name, (void *)&name, &sz, NULL,	\
-	    0), 0, "Unexpected mallctl() failure");			\
-	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
-} while (0)
-
-	TEST_ARENAS_CONSTANT(size_t, quantum, QUANTUM);
-	TEST_ARENAS_CONSTANT(size_t, page, PAGE);
-	TEST_ARENAS_CONSTANT(unsigned, nbins, NBINS);
-	TEST_ARENAS_CONSTANT(unsigned, nlextents, NSIZES - NBINS);
-
-#undef TEST_ARENAS_CONSTANT
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_bin_constants) {
-#define TEST_ARENAS_BIN_CONSTANT(t, name, expected) do {		\
-	t name;								\
-	size_t sz = sizeof(t);						\
-	assert_d_eq(mallctl("arenas.bin.0."#name, (void *)&name, &sz,	\
-	    NULL, 0), 0, "Unexpected mallctl() failure");		\
-	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
-} while (0)
-
-	TEST_ARENAS_BIN_CONSTANT(size_t, size, bin_infos[0].reg_size);
-	TEST_ARENAS_BIN_CONSTANT(uint32_t, nregs, bin_infos[0].nregs);
-	TEST_ARENAS_BIN_CONSTANT(size_t, slab_size,
-	    bin_infos[0].slab_size);
-
-#undef TEST_ARENAS_BIN_CONSTANT
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_lextent_constants) {
-#define TEST_ARENAS_LEXTENT_CONSTANT(t, name, expected) do {		\
-	t name;								\
-	size_t sz = sizeof(t);						\
-	assert_d_eq(mallctl("arenas.lextent.0."#name, (void *)&name,	\
-	    &sz, NULL, 0), 0, "Unexpected mallctl() failure");		\
-	assert_zu_eq(name, expected, "Incorrect "#name" size");		\
-} while (0)
-
-	TEST_ARENAS_LEXTENT_CONSTANT(size_t, size, LARGE_MINCLASS);
-
-#undef TEST_ARENAS_LEXTENT_CONSTANT
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_create) {
-	unsigned narenas_before, arena, narenas_after;
-	size_t sz = sizeof(unsigned);
-
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas_before, &sz,
-	    NULL, 0), 0, "Unexpected mallctl() failure");
-	assert_d_eq(mallctl("arenas.create", (void *)&arena, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	assert_d_eq(mallctl("arenas.narenas", (void *)&narenas_after, &sz, NULL,
-	    0), 0, "Unexpected mallctl() failure");
-
-	assert_u_eq(narenas_before+1, narenas_after,
-	    "Unexpected number of arenas before versus after extension");
-	assert_u_eq(arena, narenas_after-1, "Unexpected arena index");
-}
-TEST_END
-
-TEST_BEGIN(test_arenas_lookup) {
-	unsigned arena, arena1;
-	void *ptr;
-	size_t sz = sizeof(unsigned);
-
-	assert_d_eq(mallctl("arenas.create", (void *)&arena, &sz, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-	ptr = mallocx(42, MALLOCX_ARENA(arena) | MALLOCX_TCACHE_NONE);
-	assert_ptr_not_null(ptr, "Unexpected mallocx() failure");
-	assert_d_eq(mallctl("arenas.lookup", &arena1, &sz, &ptr, sizeof(ptr)),
-	    0, "Unexpected mallctl() failure");
-	assert_u_eq(arena, arena1, "Unexpected arena index");
-	dallocx(ptr, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_stats_arenas) {
-#define TEST_STATS_ARENAS(t, name) do {					\
-	t name;								\
-	size_t sz = sizeof(t);						\
-	assert_d_eq(mallctl("stats.arenas.0."#name, (void *)&name, &sz,	\
-	    NULL, 0), 0, "Unexpected mallctl() failure");		\
-} while (0)
-
-	TEST_STATS_ARENAS(unsigned, nthreads);
-	TEST_STATS_ARENAS(const char *, dss);
-	TEST_STATS_ARENAS(ssize_t, dirty_decay_ms);
-	TEST_STATS_ARENAS(ssize_t, muzzy_decay_ms);
-	TEST_STATS_ARENAS(size_t, pactive);
-	TEST_STATS_ARENAS(size_t, pdirty);
-
-#undef TEST_STATS_ARENAS
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_mallctl_errors,
-	    test_mallctlnametomib_errors,
-	    test_mallctlbymib_errors,
-	    test_mallctl_read_write,
-	    test_mallctlnametomib_short_mib,
-	    test_mallctl_config,
-	    test_mallctl_opt,
-	    test_manpage_example,
-	    test_tcache_none,
-	    test_tcache,
-	    test_thread_arena,
-	    test_arena_i_initialized,
-	    test_arena_i_dirty_decay_ms,
-	    test_arena_i_muzzy_decay_ms,
-	    test_arena_i_purge,
-	    test_arena_i_decay,
-	    test_arena_i_dss,
-	    test_arena_i_retain_grow_limit,
-	    test_arenas_dirty_decay_ms,
-	    test_arenas_muzzy_decay_ms,
-	    test_arenas_constants,
-	    test_arenas_bin_constants,
-	    test_arenas_lextent_constants,
-	    test_arenas_create,
-	    test_arenas_lookup,
-	    test_stats_arenas);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/malloc_io.c b/redis-stable/deps/jemalloc/test/unit/malloc_io.c
deleted file mode 100644
index 79ba7fc5..00000000
--- a/redis-stable/deps/jemalloc/test/unit/malloc_io.c
+++ /dev/null
@@ -1,258 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_malloc_strtoumax_no_endptr) {
-	int err;
-
-	set_errno(0);
-	assert_ju_eq(malloc_strtoumax("0", NULL, 0), 0, "Unexpected result");
-	err = get_errno();
-	assert_d_eq(err, 0, "Unexpected failure");
-}
-TEST_END
-
-TEST_BEGIN(test_malloc_strtoumax) {
-	struct test_s {
-		const char *input;
-		const char *expected_remainder;
-		int base;
-		int expected_errno;
-		const char *expected_errno_name;
-		uintmax_t expected_x;
-	};
-#define ERR(e)		e, #e
-#define KUMAX(x)	((uintmax_t)x##ULL)
-#define KSMAX(x)	((uintmax_t)(intmax_t)x##LL)
-	struct test_s tests[] = {
-		{"0",		"0",	-1,	ERR(EINVAL),	UINTMAX_MAX},
-		{"0",		"0",	1,	ERR(EINVAL),	UINTMAX_MAX},
-		{"0",		"0",	37,	ERR(EINVAL),	UINTMAX_MAX},
-
-		{"",		"",	0,	ERR(EINVAL),	UINTMAX_MAX},
-		{"+",		"+",	0,	ERR(EINVAL),	UINTMAX_MAX},
-		{"++3",		"++3",	0,	ERR(EINVAL),	UINTMAX_MAX},
-		{"-",		"-",	0,	ERR(EINVAL),	UINTMAX_MAX},
-
-		{"42",		"",	0,	ERR(0),		KUMAX(42)},
-		{"+42",		"",	0,	ERR(0),		KUMAX(42)},
-		{"-42",		"",	0,	ERR(0),		KSMAX(-42)},
-		{"042",		"",	0,	ERR(0),		KUMAX(042)},
-		{"+042",	"",	0,	ERR(0),		KUMAX(042)},
-		{"-042",	"",	0,	ERR(0),		KSMAX(-042)},
-		{"0x42",	"",	0,	ERR(0),		KUMAX(0x42)},
-		{"+0x42",	"",	0,	ERR(0),		KUMAX(0x42)},
-		{"-0x42",	"",	0,	ERR(0),		KSMAX(-0x42)},
-
-		{"0",		"",	0,	ERR(0),		KUMAX(0)},
-		{"1",		"",	0,	ERR(0),		KUMAX(1)},
-
-		{"42",		"",	0,	ERR(0),		KUMAX(42)},
-		{" 42",		"",	0,	ERR(0),		KUMAX(42)},
-		{"42 ",		" ",	0,	ERR(0),		KUMAX(42)},
-		{"0x",		"x",	0,	ERR(0),		KUMAX(0)},
-		{"42x",		"x",	0,	ERR(0),		KUMAX(42)},
-
-		{"07",		"",	0,	ERR(0),		KUMAX(7)},
-		{"010",		"",	0,	ERR(0),		KUMAX(8)},
-		{"08",		"8",	0,	ERR(0),		KUMAX(0)},
-		{"0_",		"_",	0,	ERR(0),		KUMAX(0)},
-
-		{"0x",		"x",	0,	ERR(0),		KUMAX(0)},
-		{"0X",		"X",	0,	ERR(0),		KUMAX(0)},
-		{"0xg",		"xg",	0,	ERR(0),		KUMAX(0)},
-		{"0XA",		"",	0,	ERR(0),		KUMAX(10)},
-
-		{"010",		"",	10,	ERR(0),		KUMAX(10)},
-		{"0x3",		"x3",	10,	ERR(0),		KUMAX(0)},
-
-		{"12",		"2",	2,	ERR(0),		KUMAX(1)},
-		{"78",		"8",	8,	ERR(0),		KUMAX(7)},
-		{"9a",		"a",	10,	ERR(0),		KUMAX(9)},
-		{"9A",		"A",	10,	ERR(0),		KUMAX(9)},
-		{"fg",		"g",	16,	ERR(0),		KUMAX(15)},
-		{"FG",		"G",	16,	ERR(0),		KUMAX(15)},
-		{"0xfg",	"g",	16,	ERR(0),		KUMAX(15)},
-		{"0XFG",	"G",	16,	ERR(0),		KUMAX(15)},
-		{"z_",		"_",	36,	ERR(0),		KUMAX(35)},
-		{"Z_",		"_",	36,	ERR(0),		KUMAX(35)}
-	};
-#undef ERR
-#undef KUMAX
-#undef KSMAX
-	unsigned i;
-
-	for (i = 0; i < sizeof(tests)/sizeof(struct test_s); i++) {
-		struct test_s *test = &tests[i];
-		int err;
-		uintmax_t result;
-		char *remainder;
-
-		set_errno(0);
-		result = malloc_strtoumax(test->input, &remainder, test->base);
-		err = get_errno();
-		assert_d_eq(err, test->expected_errno,
-		    "Expected errno %s for \"%s\", base %d",
-		    test->expected_errno_name, test->input, test->base);
-		assert_str_eq(remainder, test->expected_remainder,
-		    "Unexpected remainder for \"%s\", base %d",
-		    test->input, test->base);
-		if (err == 0) {
-			assert_ju_eq(result, test->expected_x,
-			    "Unexpected result for \"%s\", base %d",
-			    test->input, test->base);
-		}
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_malloc_snprintf_truncated) {
-#define BUFLEN	15
-	char buf[BUFLEN];
-	size_t result;
-	size_t len;
-#define TEST(expected_str_untruncated, ...) do {			\
-	result = malloc_snprintf(buf, len, __VA_ARGS__);		\
-	assert_d_eq(strncmp(buf, expected_str_untruncated, len-1), 0,	\
-	    "Unexpected string inequality (\"%s\" vs \"%s\")",		\
-	    buf, expected_str_untruncated);				\
-	assert_zu_eq(result, strlen(expected_str_untruncated),		\
-	    "Unexpected result");					\
-} while (0)
-
-	for (len = 1; len < BUFLEN; len++) {
-		TEST("012346789",	"012346789");
-		TEST("a0123b",		"a%sb", "0123");
-		TEST("a01234567",	"a%s%s", "0123", "4567");
-		TEST("a0123  ",		"a%-6s", "0123");
-		TEST("a  0123",		"a%6s", "0123");
-		TEST("a   012",		"a%6.3s", "0123");
-		TEST("a   012",		"a%*.*s", 6, 3, "0123");
-		TEST("a 123b",		"a% db", 123);
-		TEST("a123b",		"a%-db", 123);
-		TEST("a-123b",		"a%-db", -123);
-		TEST("a+123b",		"a%+db", 123);
-	}
-#undef BUFLEN
-#undef TEST
-}
-TEST_END
-
-TEST_BEGIN(test_malloc_snprintf) {
-#define BUFLEN	128
-	char buf[BUFLEN];
-	size_t result;
-#define TEST(expected_str, ...) do {					\
-	result = malloc_snprintf(buf, sizeof(buf), __VA_ARGS__);	\
-	assert_str_eq(buf, expected_str, "Unexpected output");		\
-	assert_zu_eq(result, strlen(expected_str), "Unexpected result");\
-} while (0)
-
-	TEST("hello", "hello");
-
-	TEST("50%, 100%", "50%%, %d%%", 100);
-
-	TEST("a0123b", "a%sb", "0123");
-
-	TEST("a 0123b", "a%5sb", "0123");
-	TEST("a 0123b", "a%*sb", 5, "0123");
-
-	TEST("a0123 b", "a%-5sb", "0123");
-	TEST("a0123b", "a%*sb", -1, "0123");
-	TEST("a0123 b", "a%*sb", -5, "0123");
-	TEST("a0123 b", "a%-*sb", -5, "0123");
-
-	TEST("a012b", "a%.3sb", "0123");
-	TEST("a012b", "a%.*sb", 3, "0123");
-	TEST("a0123b", "a%.*sb", -3, "0123");
-
-	TEST("a  012b", "a%5.3sb", "0123");
-	TEST("a  012b", "a%5.*sb", 3, "0123");
-	TEST("a  012b", "a%*.3sb", 5, "0123");
-	TEST("a  012b", "a%*.*sb", 5, 3, "0123");
-	TEST("a 0123b", "a%*.*sb", 5, -3, "0123");
-
-	TEST("_abcd_", "_%x_", 0xabcd);
-	TEST("_0xabcd_", "_%#x_", 0xabcd);
-	TEST("_1234_", "_%o_", 01234);
-	TEST("_01234_", "_%#o_", 01234);
-	TEST("_1234_", "_%u_", 1234);
-
-	TEST("_1234_", "_%d_", 1234);
-	TEST("_ 1234_", "_% d_", 1234);
-	TEST("_+1234_", "_%+d_", 1234);
-	TEST("_-1234_", "_%d_", -1234);
-	TEST("_-1234_", "_% d_", -1234);
-	TEST("_-1234_", "_%+d_", -1234);
-
-	TEST("_-1234_", "_%d_", -1234);
-	TEST("_1234_", "_%d_", 1234);
-	TEST("_-1234_", "_%i_", -1234);
-	TEST("_1234_", "_%i_", 1234);
-	TEST("_01234_", "_%#o_", 01234);
-	TEST("_1234_", "_%u_", 1234);
-	TEST("_0x1234abc_", "_%#x_", 0x1234abc);
-	TEST("_0X1234ABC_", "_%#X_", 0x1234abc);
-	TEST("_c_", "_%c_", 'c');
-	TEST("_string_", "_%s_", "string");
-	TEST("_0x42_", "_%p_", ((void *)0x42));
-
-	TEST("_-1234_", "_%ld_", ((long)-1234));
-	TEST("_1234_", "_%ld_", ((long)1234));
-	TEST("_-1234_", "_%li_", ((long)-1234));
-	TEST("_1234_", "_%li_", ((long)1234));
-	TEST("_01234_", "_%#lo_", ((long)01234));
-	TEST("_1234_", "_%lu_", ((long)1234));
-	TEST("_0x1234abc_", "_%#lx_", ((long)0x1234abc));
-	TEST("_0X1234ABC_", "_%#lX_", ((long)0x1234ABC));
-
-	TEST("_-1234_", "_%lld_", ((long long)-1234));
-	TEST("_1234_", "_%lld_", ((long long)1234));
-	TEST("_-1234_", "_%lli_", ((long long)-1234));
-	TEST("_1234_", "_%lli_", ((long long)1234));
-	TEST("_01234_", "_%#llo_", ((long long)01234));
-	TEST("_1234_", "_%llu_", ((long long)1234));
-	TEST("_0x1234abc_", "_%#llx_", ((long long)0x1234abc));
-	TEST("_0X1234ABC_", "_%#llX_", ((long long)0x1234ABC));
-
-	TEST("_-1234_", "_%qd_", ((long long)-1234));
-	TEST("_1234_", "_%qd_", ((long long)1234));
-	TEST("_-1234_", "_%qi_", ((long long)-1234));
-	TEST("_1234_", "_%qi_", ((long long)1234));
-	TEST("_01234_", "_%#qo_", ((long long)01234));
-	TEST("_1234_", "_%qu_", ((long long)1234));
-	TEST("_0x1234abc_", "_%#qx_", ((long long)0x1234abc));
-	TEST("_0X1234ABC_", "_%#qX_", ((long long)0x1234ABC));
-
-	TEST("_-1234_", "_%jd_", ((intmax_t)-1234));
-	TEST("_1234_", "_%jd_", ((intmax_t)1234));
-	TEST("_-1234_", "_%ji_", ((intmax_t)-1234));
-	TEST("_1234_", "_%ji_", ((intmax_t)1234));
-	TEST("_01234_", "_%#jo_", ((intmax_t)01234));
-	TEST("_1234_", "_%ju_", ((intmax_t)1234));
-	TEST("_0x1234abc_", "_%#jx_", ((intmax_t)0x1234abc));
-	TEST("_0X1234ABC_", "_%#jX_", ((intmax_t)0x1234ABC));
-
-	TEST("_1234_", "_%td_", ((ptrdiff_t)1234));
-	TEST("_-1234_", "_%td_", ((ptrdiff_t)-1234));
-	TEST("_1234_", "_%ti_", ((ptrdiff_t)1234));
-	TEST("_-1234_", "_%ti_", ((ptrdiff_t)-1234));
-
-	TEST("_-1234_", "_%zd_", ((ssize_t)-1234));
-	TEST("_1234_", "_%zd_", ((ssize_t)1234));
-	TEST("_-1234_", "_%zi_", ((ssize_t)-1234));
-	TEST("_1234_", "_%zi_", ((ssize_t)1234));
-	TEST("_01234_", "_%#zo_", ((ssize_t)01234));
-	TEST("_1234_", "_%zu_", ((ssize_t)1234));
-	TEST("_0x1234abc_", "_%#zx_", ((ssize_t)0x1234abc));
-	TEST("_0X1234ABC_", "_%#zX_", ((ssize_t)0x1234ABC));
-#undef BUFLEN
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_malloc_strtoumax_no_endptr,
-	    test_malloc_strtoumax,
-	    test_malloc_snprintf_truncated,
-	    test_malloc_snprintf);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/math.c b/redis-stable/deps/jemalloc/test/unit/math.c
deleted file mode 100644
index 09ef20c7..00000000
--- a/redis-stable/deps/jemalloc/test/unit/math.c
+++ /dev/null
@@ -1,390 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define MAX_REL_ERR 1.0e-9
-#define MAX_ABS_ERR 1.0e-9
-
-#include <float.h>
-
-#ifdef __PGI
-#undef INFINITY
-#endif
-
-#ifndef INFINITY
-#define INFINITY (DBL_MAX + DBL_MAX)
-#endif
-
-static bool
-double_eq_rel(double a, double b, double max_rel_err, double max_abs_err) {
-	double rel_err;
-
-	if (fabs(a - b) < max_abs_err) {
-		return true;
-	}
-	rel_err = (fabs(b) > fabs(a)) ? fabs((a-b)/b) : fabs((a-b)/a);
-	return (rel_err < max_rel_err);
-}
-
-static uint64_t
-factorial(unsigned x) {
-	uint64_t ret = 1;
-	unsigned i;
-
-	for (i = 2; i <= x; i++) {
-		ret *= (uint64_t)i;
-	}
-
-	return ret;
-}
-
-TEST_BEGIN(test_ln_gamma_factorial) {
-	unsigned x;
-
-	/* exp(ln_gamma(x)) == (x-1)! for integer x. */
-	for (x = 1; x <= 21; x++) {
-		assert_true(double_eq_rel(exp(ln_gamma(x)),
-		    (double)factorial(x-1), MAX_REL_ERR, MAX_ABS_ERR),
-		    "Incorrect factorial result for x=%u", x);
-	}
-}
-TEST_END
-
-/* Expected ln_gamma([0.0..100.0] increment=0.25). */
-static const double ln_gamma_misc_expected[] = {
-	INFINITY,
-	1.28802252469807743, 0.57236494292470008, 0.20328095143129538,
-	0.00000000000000000, -0.09827183642181320, -0.12078223763524518,
-	-0.08440112102048555, 0.00000000000000000, 0.12487171489239651,
-	0.28468287047291918, 0.47521466691493719, 0.69314718055994529,
-	0.93580193110872523, 1.20097360234707429, 1.48681557859341718,
-	1.79175946922805496, 2.11445692745037128, 2.45373657084244234,
-	2.80857141857573644, 3.17805383034794575, 3.56137591038669710,
-	3.95781396761871651, 4.36671603662228680, 4.78749174278204581,
-	5.21960398699022932, 5.66256205985714178, 6.11591589143154568,
-	6.57925121201010121, 7.05218545073853953, 7.53436423675873268,
-	8.02545839631598312, 8.52516136106541467, 9.03318691960512332,
-	9.54926725730099690, 10.07315123968123949, 10.60460290274525086,
-	11.14340011995171231, 11.68933342079726856, 12.24220494005076176,
-	12.80182748008146909, 13.36802367147604720, 13.94062521940376342,
-	14.51947222506051816, 15.10441257307551943, 15.69530137706046524,
-	16.29200047656724237, 16.89437797963419285, 17.50230784587389010,
-	18.11566950571089407, 18.73434751193644843, 19.35823122022435427,
-	19.98721449566188468, 20.62119544270163018, 21.26007615624470048,
-	21.90376249182879320, 22.55216385312342098, 23.20519299513386002,
-	23.86276584168908954, 24.52480131594137802, 25.19122118273868338,
-	25.86194990184851861, 26.53691449111561340, 27.21604439872720604,
-	27.89927138384089389, 28.58652940490193828, 29.27775451504081516,
-	29.97288476399884871, 30.67186010608067548, 31.37462231367769050,
-	32.08111489594735843, 32.79128302226991565, 33.50507345013689076,
-	34.22243445715505317, 34.94331577687681545, 35.66766853819134298,
-	36.39544520803305261, 37.12659953718355865, 37.86108650896109395,
-	38.59886229060776230, 39.33988418719949465, 40.08411059791735198,
-	40.83150097453079752, 41.58201578195490100, 42.33561646075348506,
-	43.09226539146988699, 43.85192586067515208, 44.61456202863158893,
-	45.38013889847690052, 46.14862228684032885, 46.91997879580877395,
-	47.69417578616628361, 48.47118135183522014, 49.25096429545256882,
-	50.03349410501914463, 50.81874093156324790, 51.60667556776436982,
-	52.39726942748592364, 53.19049452616926743, 53.98632346204390586,
-	54.78472939811231157, 55.58568604486942633, 56.38916764371992940,
-	57.19514895105859864, 58.00360522298051080, 58.81451220059079787,
-	59.62784609588432261, 60.44358357816834371, 61.26170176100199427,
-	62.08217818962842927, 62.90499082887649962, 63.73011805151035958,
-	64.55753862700632340, 65.38723171073768015, 66.21917683354901385,
-	67.05335389170279825, 67.88974313718154008, 68.72832516833013017,
-	69.56908092082363737, 70.41199165894616385, 71.25703896716800045,
-	72.10420474200799390, 72.95347118416940191, 73.80482079093779646,
-	74.65823634883015814, 75.51370092648485866, 76.37119786778275454,
-	77.23071078519033961, 78.09222355331530707, 78.95572030266725960,
-	79.82118541361435859, 80.68860351052903468, 81.55795945611502873,
-	82.42923834590904164, 83.30242550295004378, 84.17750647261028973,
-	85.05446701758152983, 85.93329311301090456, 86.81397094178107920,
-	87.69648688992882057, 88.58082754219766741, 89.46697967771913795,
-	90.35493026581838194, 91.24466646193963015, 92.13617560368709292,
-	93.02944520697742803, 93.92446296229978486, 94.82121673107967297,
-	95.71969454214321615, 96.61988458827809723, 97.52177522288820910,
-	98.42535495673848800, 99.33061245478741341, 100.23753653310367895,
-	101.14611615586458981, 102.05634043243354370, 102.96819861451382394,
-	103.88168009337621811, 104.79677439715833032, 105.71347118823287303,
-	106.63176026064346047, 107.55163153760463501, 108.47307506906540198,
-	109.39608102933323153, 110.32063971475740516, 111.24674154146920557,
-	112.17437704317786995, 113.10353686902013237, 114.03421178146170689,
-	114.96639265424990128, 115.90007047041454769, 116.83523632031698014,
-	117.77188139974506953, 118.70999700805310795, 119.64957454634490830,
-	120.59060551569974962, 121.53308151543865279, 122.47699424143097247,
-	123.42233548443955726, 124.36909712850338394, 125.31727114935689826,
-	126.26684961288492559, 127.21782467361175861, 128.17018857322420899,
-	129.12393363912724453, 130.07905228303084755, 131.03553699956862033,
-	131.99338036494577864, 132.95257503561629164, 133.91311374698926784,
-	134.87498931216194364, 135.83819462068046846, 136.80272263732638294,
-	137.76856640092901785, 138.73571902320256299, 139.70417368760718091,
-	140.67392364823425055, 141.64496222871400732, 142.61728282114600574,
-	143.59087888505104047, 144.56574394634486680, 145.54187159633210058,
-	146.51925549072063859, 147.49788934865566148, 148.47776695177302031,
-	149.45888214327129617, 150.44122882700193600, 151.42480096657754984,
-	152.40959258449737490, 153.39559776128982094, 154.38281063467164245,
-	155.37122539872302696, 156.36083630307879844, 157.35163765213474107,
-	158.34362380426921391, 159.33678917107920370, 160.33112821663092973,
-	161.32663545672428995, 162.32330545817117695, 163.32113283808695314,
-	164.32011226319519892, 165.32023844914485267, 166.32150615984036790,
-	167.32391020678358018, 168.32744544842768164, 169.33210678954270634,
-	170.33788918059275375, 171.34478761712384198, 172.35279713916281707,
-	173.36191283062726143, 174.37212981874515094, 175.38344327348534080,
-	176.39584840699734514, 177.40934047306160437, 178.42391476654847793,
-	179.43956662288721304, 180.45629141754378111, 181.47408456550741107,
-	182.49294152078630304, 183.51285777591152737, 184.53382886144947861,
-	185.55585034552262869, 186.57891783333786861, 187.60302696672312095,
-	188.62817342367162610, 189.65435291789341932, 190.68156119837468054,
-	191.70979404894376330, 192.73904728784492590, 193.76931676731820176,
-	194.80059837318714244, 195.83288802445184729, 196.86618167288995096,
-	197.90047530266301123, 198.93576492992946214, 199.97204660246373464,
-	201.00931639928148797, 202.04757043027063901, 203.08680483582807597,
-	204.12701578650228385, 205.16819948264117102, 206.21035215404597807,
-	207.25347005962987623, 208.29754948708190909, 209.34258675253678916,
-	210.38857820024875878, 211.43552020227099320, 212.48340915813977858,
-	213.53224149456323744, 214.58201366511514152, 215.63272214993284592,
-	216.68436345542014010, 217.73693411395422004, 218.79043068359703739,
-	219.84484974781133815, 220.90018791517996988, 221.95644181913033322,
-	223.01360811766215875, 224.07168349307951871, 225.13066465172661879,
-	226.19054832372759734, 227.25133126272962159, 228.31301024565024704,
-	229.37558207242807384, 230.43904356577689896, 231.50339157094342113,
-	232.56862295546847008, 233.63473460895144740, 234.70172344281823484,
-	235.76958639009222907, 236.83832040516844586, 237.90792246359117712,
-	238.97838956183431947, 240.04971871708477238, 241.12190696702904802,
-	242.19495136964280846, 243.26884900298270509, 244.34359696498191283,
-	245.41919237324782443, 246.49563236486270057, 247.57291409618682110,
-	248.65103474266476269, 249.72999149863338175, 250.80978157713354904,
-	251.89040220972316320, 252.97185064629374551, 254.05412415488834199,
-	255.13722002152300661, 256.22113555000953511, 257.30586806178126835,
-	258.39141489572085675, 259.47777340799029844, 260.56494097186322279,
-	261.65291497755913497, 262.74169283208021852, 263.83127195904967266,
-	264.92164979855277807, 266.01282380697938379, 267.10479145686849733,
-	268.19755023675537586, 269.29109765101975427, 270.38543121973674488,
-	271.48054847852881721, 272.57644697842033565, 273.67312428569374561,
-	274.77057798174683967, 275.86880566295326389, 276.96780494052313770,
-	278.06757344036617496, 279.16810880295668085, 280.26940868320008349,
-	281.37147075030043197, 282.47429268763045229, 283.57787219260217171,
-	284.68220697654078322, 285.78729476455760050, 286.89313329542699194,
-	287.99972032146268930, 289.10705360839756395, 290.21513093526289140,
-	291.32395009427028754, 292.43350889069523646, 293.54380514276073200,
-	294.65483668152336350, 295.76660135076059532, 296.87909700685889902,
-	297.99232151870342022, 299.10627276756946458, 300.22094864701409733,
-	301.33634706277030091, 302.45246593264130297, 303.56930318639643929,
-	304.68685676566872189, 305.80512462385280514, 306.92410472600477078,
-	308.04379504874236773, 309.16419358014690033, 310.28529831966631036,
-	311.40710727801865687, 312.52961847709792664, 313.65282994987899201,
-	314.77673974032603610, 315.90134590329950015, 317.02664650446632777,
-	318.15263962020929966, 319.27932333753892635, 320.40669575400545455,
-	321.53475497761127144, 322.66349912672620803, 323.79292633000159185,
-	324.92303472628691452, 326.05382246454587403, 327.18528770377525916,
-	328.31742861292224234, 329.45024337080525356, 330.58373016603343331,
-	331.71788719692847280, 332.85271267144611329, 333.98820480709991898,
-	335.12436183088397001, 336.26118197919845443, 337.39866349777429377,
-	338.53680464159958774, 339.67560367484657036, 340.81505887079896411,
-	341.95516851178109619, 343.09593088908627578, 344.23734430290727460,
-	345.37940706226686416, 346.52211748494903532, 347.66547389743118401,
-	348.80947463481720661, 349.95411804077025408, 351.09940246744753267,
-	352.24532627543504759, 353.39188783368263103, 354.53908551944078908,
-	355.68691771819692349, 356.83538282361303118, 357.98447923746385868,
-	359.13420536957539753
-};
-
-TEST_BEGIN(test_ln_gamma_misc) {
-	unsigned i;
-
-	for (i = 1; i < sizeof(ln_gamma_misc_expected)/sizeof(double); i++) {
-		double x = (double)i * 0.25;
-		assert_true(double_eq_rel(ln_gamma(x),
-		    ln_gamma_misc_expected[i], MAX_REL_ERR, MAX_ABS_ERR),
-		    "Incorrect ln_gamma result for i=%u", i);
-	}
-}
-TEST_END
-
-/* Expected pt_norm([0.01..0.99] increment=0.01). */
-static const double pt_norm_expected[] = {
-	-INFINITY,
-	-2.32634787404084076, -2.05374891063182252, -1.88079360815125085,
-	-1.75068607125216946, -1.64485362695147264, -1.55477359459685305,
-	-1.47579102817917063, -1.40507156030963221, -1.34075503369021654,
-	-1.28155156554460081, -1.22652812003661049, -1.17498679206608991,
-	-1.12639112903880045, -1.08031934081495606, -1.03643338949378938,
-	-0.99445788320975281, -0.95416525314619416, -0.91536508784281390,
-	-0.87789629505122846, -0.84162123357291418, -0.80642124701824025,
-	-0.77219321418868492, -0.73884684918521371, -0.70630256284008752,
-	-0.67448975019608171, -0.64334540539291685, -0.61281299101662701,
-	-0.58284150727121620, -0.55338471955567281, -0.52440051270804067,
-	-0.49585034734745320, -0.46769879911450812, -0.43991316567323380,
-	-0.41246312944140462, -0.38532046640756751, -0.35845879325119373,
-	-0.33185334643681652, -0.30548078809939738, -0.27931903444745404,
-	-0.25334710313579978, -0.22754497664114931, -0.20189347914185077,
-	-0.17637416478086135, -0.15096921549677725, -0.12566134685507399,
-	-0.10043372051146975, -0.07526986209982976, -0.05015358346473352,
-	-0.02506890825871106, 0.00000000000000000, 0.02506890825871106,
-	0.05015358346473366, 0.07526986209982990, 0.10043372051146990,
-	0.12566134685507413, 0.15096921549677739, 0.17637416478086146,
-	0.20189347914185105, 0.22754497664114931, 0.25334710313579978,
-	0.27931903444745404, 0.30548078809939738, 0.33185334643681652,
-	0.35845879325119373, 0.38532046640756762, 0.41246312944140484,
-	0.43991316567323391, 0.46769879911450835, 0.49585034734745348,
-	0.52440051270804111, 0.55338471955567303, 0.58284150727121620,
-	0.61281299101662701, 0.64334540539291685, 0.67448975019608171,
-	0.70630256284008752, 0.73884684918521371, 0.77219321418868492,
-	0.80642124701824036, 0.84162123357291441, 0.87789629505122879,
-	0.91536508784281423, 0.95416525314619460, 0.99445788320975348,
-	1.03643338949378938, 1.08031934081495606, 1.12639112903880045,
-	1.17498679206608991, 1.22652812003661049, 1.28155156554460081,
-	1.34075503369021654, 1.40507156030963265, 1.47579102817917085,
-	1.55477359459685394, 1.64485362695147308, 1.75068607125217102,
-	1.88079360815125041, 2.05374891063182208, 2.32634787404084076
-};
-
-TEST_BEGIN(test_pt_norm) {
-	unsigned i;
-
-	for (i = 1; i < sizeof(pt_norm_expected)/sizeof(double); i++) {
-		double p = (double)i * 0.01;
-		assert_true(double_eq_rel(pt_norm(p), pt_norm_expected[i],
-		    MAX_REL_ERR, MAX_ABS_ERR),
-		    "Incorrect pt_norm result for i=%u", i);
-	}
-}
-TEST_END
-
-/*
- * Expected pt_chi2(p=[0.01..0.99] increment=0.07,
- *                  df={0.1, 1.1, 10.1, 100.1, 1000.1}).
- */
-static const double pt_chi2_df[] = {0.1, 1.1, 10.1, 100.1, 1000.1};
-static const double pt_chi2_expected[] = {
-	1.168926411457320e-40, 1.347680397072034e-22, 3.886980416666260e-17,
-	8.245951724356564e-14, 2.068936347497604e-11, 1.562561743309233e-09,
-	5.459543043426564e-08, 1.114775688149252e-06, 1.532101202364371e-05,
-	1.553884683726585e-04, 1.239396954915939e-03, 8.153872320255721e-03,
-	4.631183739647523e-02, 2.473187311701327e-01, 2.175254800183617e+00,
-
-	0.0003729887888876379, 0.0164409238228929513, 0.0521523015190650113,
-	0.1064701372271216612, 0.1800913735793082115, 0.2748704281195626931,
-	0.3939246282787986497, 0.5420727552260817816, 0.7267265822221973259,
-	0.9596554296000253670, 1.2607440376386165326, 1.6671185084541604304,
-	2.2604828984738705167, 3.2868613342148607082, 6.9298574921692139839,
-
-	2.606673548632508, 4.602913725294877, 5.646152813924212,
-	6.488971315540869, 7.249823275816285, 7.977314231410841,
-	8.700354939944047, 9.441728024225892, 10.224338321374127,
-	11.076435368801061, 12.039320937038386, 13.183878752697167,
-	14.657791935084575, 16.885728216339373, 23.361991680031817,
-
-	70.14844087392152, 80.92379498849355, 85.53325420085891,
-	88.94433120715347, 91.83732712857017, 94.46719943606301,
-	96.96896479994635, 99.43412843510363, 101.94074719829733,
-	104.57228644307247, 107.43900093448734, 110.71844673417287,
-	114.76616819871325, 120.57422505959563, 135.92318818757556,
-
-	899.0072447849649, 937.9271278858220, 953.8117189560207,
-	965.3079371501154, 974.8974061207954, 983.4936235182347,
-	991.5691170518946, 999.4334123954690, 1007.3391826856553,
-	1015.5445154999951, 1024.3777075619569, 1034.3538789836223,
-	1046.4872561869577, 1063.5717461999654, 1107.0741966053859
-};
-
-TEST_BEGIN(test_pt_chi2) {
-	unsigned i, j;
-	unsigned e = 0;
-
-	for (i = 0; i < sizeof(pt_chi2_df)/sizeof(double); i++) {
-		double df = pt_chi2_df[i];
-		double ln_gamma_df = ln_gamma(df * 0.5);
-		for (j = 1; j < 100; j += 7) {
-			double p = (double)j * 0.01;
-			assert_true(double_eq_rel(pt_chi2(p, df, ln_gamma_df),
-			    pt_chi2_expected[e], MAX_REL_ERR, MAX_ABS_ERR),
-			    "Incorrect pt_chi2 result for i=%u, j=%u", i, j);
-			e++;
-		}
-	}
-}
-TEST_END
-
-/*
- * Expected pt_gamma(p=[0.1..0.99] increment=0.07,
- *                   shape=[0.5..3.0] increment=0.5).
- */
-static const double pt_gamma_shape[] = {0.5, 1.0, 1.5, 2.0, 2.5, 3.0};
-static const double pt_gamma_expected[] = {
-	7.854392895485103e-05, 5.043466107888016e-03, 1.788288957794883e-02,
-	3.900956150232906e-02, 6.913847560638034e-02, 1.093710833465766e-01,
-	1.613412523825817e-01, 2.274682115597864e-01, 3.114117323127083e-01,
-	4.189466220207417e-01, 5.598106789059246e-01, 7.521856146202706e-01,
-	1.036125427911119e+00, 1.532450860038180e+00, 3.317448300510606e+00,
-
-	0.01005033585350144, 0.08338160893905107, 0.16251892949777497,
-	0.24846135929849966, 0.34249030894677596, 0.44628710262841947,
-	0.56211891815354142, 0.69314718055994529, 0.84397007029452920,
-	1.02165124753198167, 1.23787435600161766, 1.51412773262977574,
-	1.89711998488588196, 2.52572864430825783, 4.60517018598809091,
-
-	0.05741590094955853, 0.24747378084860744, 0.39888572212236084,
-	0.54394139997444901, 0.69048812513915159, 0.84311389861296104,
-	1.00580622221479898, 1.18298694218766931, 1.38038096305861213,
-	1.60627736383027453, 1.87396970522337947, 2.20749220408081070,
-	2.65852391865854942, 3.37934630984842244, 5.67243336507218476,
-
-	0.1485547402532659, 0.4657458011640391, 0.6832386130709406,
-	0.8794297834672100, 1.0700752852474524, 1.2629614217350744,
-	1.4638400448580779, 1.6783469900166610, 1.9132338090606940,
-	2.1778589228618777, 2.4868823970010991, 2.8664695666264195,
-	3.3724415436062114, 4.1682658512758071, 6.6383520679938108,
-
-	0.2771490383641385, 0.7195001279643727, 0.9969081732265243,
-	1.2383497880608061, 1.4675206597269927, 1.6953064251816552,
-	1.9291243435606809, 2.1757300955477641, 2.4428032131216391,
-	2.7406534569230616, 3.0851445039665513, 3.5043101122033367,
-	4.0575997065264637, 4.9182956424675286, 7.5431362346944937,
-
-	0.4360451650782932, 0.9983600902486267, 1.3306365880734528,
-	1.6129750834753802, 1.8767241606994294, 2.1357032436097660,
-	2.3988853336865565, 2.6740603137235603, 2.9697561737517959,
-	3.2971457713883265, 3.6731795898504660, 4.1275751617770631,
-	4.7230515633946677, 5.6417477865306020, 8.4059469148854635
-};
-
-TEST_BEGIN(test_pt_gamma_shape) {
-	unsigned i, j;
-	unsigned e = 0;
-
-	for (i = 0; i < sizeof(pt_gamma_shape)/sizeof(double); i++) {
-		double shape = pt_gamma_shape[i];
-		double ln_gamma_shape = ln_gamma(shape);
-		for (j = 1; j < 100; j += 7) {
-			double p = (double)j * 0.01;
-			assert_true(double_eq_rel(pt_gamma(p, shape, 1.0,
-			    ln_gamma_shape), pt_gamma_expected[e], MAX_REL_ERR,
-			    MAX_ABS_ERR),
-			    "Incorrect pt_gamma result for i=%u, j=%u", i, j);
-			e++;
-		}
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_pt_gamma_scale) {
-	double shape = 1.0;
-	double ln_gamma_shape = ln_gamma(shape);
-
-	assert_true(double_eq_rel(
-	    pt_gamma(0.5, shape, 1.0, ln_gamma_shape) * 10.0,
-	    pt_gamma(0.5, shape, 10.0, ln_gamma_shape), MAX_REL_ERR,
-	    MAX_ABS_ERR),
-	    "Scale should be trivially equivalent to external multiplication");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_ln_gamma_factorial,
-	    test_ln_gamma_misc,
-	    test_pt_norm,
-	    test_pt_chi2,
-	    test_pt_gamma_shape,
-	    test_pt_gamma_scale);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/mq.c b/redis-stable/deps/jemalloc/test/unit/mq.c
deleted file mode 100644
index 57a4d54e..00000000
--- a/redis-stable/deps/jemalloc/test/unit/mq.c
+++ /dev/null
@@ -1,89 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NSENDERS	3
-#define NMSGS		100000
-
-typedef struct mq_msg_s mq_msg_t;
-struct mq_msg_s {
-	mq_msg(mq_msg_t)	link;
-};
-mq_gen(static, mq_, mq_t, mq_msg_t, link)
-
-TEST_BEGIN(test_mq_basic) {
-	mq_t mq;
-	mq_msg_t msg;
-
-	assert_false(mq_init(&mq), "Unexpected mq_init() failure");
-	assert_u_eq(mq_count(&mq), 0, "mq should be empty");
-	assert_ptr_null(mq_tryget(&mq),
-	    "mq_tryget() should fail when the queue is empty");
-
-	mq_put(&mq, &msg);
-	assert_u_eq(mq_count(&mq), 1, "mq should contain one message");
-	assert_ptr_eq(mq_tryget(&mq), &msg, "mq_tryget() should return msg");
-
-	mq_put(&mq, &msg);
-	assert_ptr_eq(mq_get(&mq), &msg, "mq_get() should return msg");
-
-	mq_fini(&mq);
-}
-TEST_END
-
-static void *
-thd_receiver_start(void *arg) {
-	mq_t *mq = (mq_t *)arg;
-	unsigned i;
-
-	for (i = 0; i < (NSENDERS * NMSGS); i++) {
-		mq_msg_t *msg = mq_get(mq);
-		assert_ptr_not_null(msg, "mq_get() should never return NULL");
-		dallocx(msg, 0);
-	}
-	return NULL;
-}
-
-static void *
-thd_sender_start(void *arg) {
-	mq_t *mq = (mq_t *)arg;
-	unsigned i;
-
-	for (i = 0; i < NMSGS; i++) {
-		mq_msg_t *msg;
-		void *p;
-		p = mallocx(sizeof(mq_msg_t), 0);
-		assert_ptr_not_null(p, "Unexpected mallocx() failure");
-		msg = (mq_msg_t *)p;
-		mq_put(mq, msg);
-	}
-	return NULL;
-}
-
-TEST_BEGIN(test_mq_threaded) {
-	mq_t mq;
-	thd_t receiver;
-	thd_t senders[NSENDERS];
-	unsigned i;
-
-	assert_false(mq_init(&mq), "Unexpected mq_init() failure");
-
-	thd_create(&receiver, thd_receiver_start, (void *)&mq);
-	for (i = 0; i < NSENDERS; i++) {
-		thd_create(&senders[i], thd_sender_start, (void *)&mq);
-	}
-
-	thd_join(receiver, NULL);
-	for (i = 0; i < NSENDERS; i++) {
-		thd_join(senders[i], NULL);
-	}
-
-	mq_fini(&mq);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_mq_basic,
-	    test_mq_threaded);
-}
-
diff --git a/redis-stable/deps/jemalloc/test/unit/mtx.c b/redis-stable/deps/jemalloc/test/unit/mtx.c
deleted file mode 100644
index 424587b0..00000000
--- a/redis-stable/deps/jemalloc/test/unit/mtx.c
+++ /dev/null
@@ -1,57 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NTHREADS	2
-#define NINCRS		2000000
-
-TEST_BEGIN(test_mtx_basic) {
-	mtx_t mtx;
-
-	assert_false(mtx_init(&mtx), "Unexpected mtx_init() failure");
-	mtx_lock(&mtx);
-	mtx_unlock(&mtx);
-	mtx_fini(&mtx);
-}
-TEST_END
-
-typedef struct {
-	mtx_t		mtx;
-	unsigned	x;
-} thd_start_arg_t;
-
-static void *
-thd_start(void *varg) {
-	thd_start_arg_t *arg = (thd_start_arg_t *)varg;
-	unsigned i;
-
-	for (i = 0; i < NINCRS; i++) {
-		mtx_lock(&arg->mtx);
-		arg->x++;
-		mtx_unlock(&arg->mtx);
-	}
-	return NULL;
-}
-
-TEST_BEGIN(test_mtx_race) {
-	thd_start_arg_t arg;
-	thd_t thds[NTHREADS];
-	unsigned i;
-
-	assert_false(mtx_init(&arg.mtx), "Unexpected mtx_init() failure");
-	arg.x = 0;
-	for (i = 0; i < NTHREADS; i++) {
-		thd_create(&thds[i], thd_start, (void *)&arg);
-	}
-	for (i = 0; i < NTHREADS; i++) {
-		thd_join(thds[i], NULL);
-	}
-	assert_u_eq(arg.x, NTHREADS * NINCRS,
-	    "Race-related counter corruption");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_mtx_basic,
-	    test_mtx_race);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/nstime.c b/redis-stable/deps/jemalloc/test/unit/nstime.c
deleted file mode 100644
index f3137805..00000000
--- a/redis-stable/deps/jemalloc/test/unit/nstime.c
+++ /dev/null
@@ -1,249 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define BILLION	UINT64_C(1000000000)
-
-TEST_BEGIN(test_nstime_init) {
-	nstime_t nst;
-
-	nstime_init(&nst, 42000000043);
-	assert_u64_eq(nstime_ns(&nst), 42000000043, "ns incorrectly read");
-	assert_u64_eq(nstime_sec(&nst), 42, "sec incorrectly read");
-	assert_u64_eq(nstime_nsec(&nst), 43, "nsec incorrectly read");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_init2) {
-	nstime_t nst;
-
-	nstime_init2(&nst, 42, 43);
-	assert_u64_eq(nstime_sec(&nst), 42, "sec incorrectly read");
-	assert_u64_eq(nstime_nsec(&nst), 43, "nsec incorrectly read");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_copy) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_init(&nstb, 0);
-	nstime_copy(&nstb, &nsta);
-	assert_u64_eq(nstime_sec(&nstb), 42, "sec incorrectly copied");
-	assert_u64_eq(nstime_nsec(&nstb), 43, "nsec incorrectly copied");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_compare) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0, "Times should be equal");
-	assert_d_eq(nstime_compare(&nstb, &nsta), 0, "Times should be equal");
-
-	nstime_init2(&nstb, 42, 42);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 1,
-	    "nsta should be greater than nstb");
-	assert_d_eq(nstime_compare(&nstb, &nsta), -1,
-	    "nstb should be less than nsta");
-
-	nstime_init2(&nstb, 42, 44);
-	assert_d_eq(nstime_compare(&nsta, &nstb), -1,
-	    "nsta should be less than nstb");
-	assert_d_eq(nstime_compare(&nstb, &nsta), 1,
-	    "nstb should be greater than nsta");
-
-	nstime_init2(&nstb, 41, BILLION - 1);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 1,
-	    "nsta should be greater than nstb");
-	assert_d_eq(nstime_compare(&nstb, &nsta), -1,
-	    "nstb should be less than nsta");
-
-	nstime_init2(&nstb, 43, 0);
-	assert_d_eq(nstime_compare(&nsta, &nstb), -1,
-	    "nsta should be less than nstb");
-	assert_d_eq(nstime_compare(&nstb, &nsta), 1,
-	    "nstb should be greater than nsta");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_add) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_add(&nsta, &nstb);
-	nstime_init2(&nstb, 84, 86);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect addition result");
-
-	nstime_init2(&nsta, 42, BILLION - 1);
-	nstime_copy(&nstb, &nsta);
-	nstime_add(&nsta, &nstb);
-	nstime_init2(&nstb, 85, BILLION - 2);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect addition result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_iadd) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, BILLION - 1);
-	nstime_iadd(&nsta, 1);
-	nstime_init2(&nstb, 43, 0);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect addition result");
-
-	nstime_init2(&nsta, 42, 1);
-	nstime_iadd(&nsta, BILLION + 1);
-	nstime_init2(&nstb, 43, 2);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect addition result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_subtract) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_subtract(&nsta, &nstb);
-	nstime_init(&nstb, 0);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect subtraction result");
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_init2(&nstb, 41, 44);
-	nstime_subtract(&nsta, &nstb);
-	nstime_init2(&nstb, 0, BILLION - 1);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect subtraction result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_isubtract) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_isubtract(&nsta, 42*BILLION + 43);
-	nstime_init(&nstb, 0);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect subtraction result");
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_isubtract(&nsta, 41*BILLION + 44);
-	nstime_init2(&nstb, 0, BILLION - 1);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect subtraction result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_imultiply) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_imultiply(&nsta, 10);
-	nstime_init2(&nstb, 420, 430);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect multiplication result");
-
-	nstime_init2(&nsta, 42, 666666666);
-	nstime_imultiply(&nsta, 3);
-	nstime_init2(&nstb, 127, 999999998);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect multiplication result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_idivide) {
-	nstime_t nsta, nstb;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_imultiply(&nsta, 10);
-	nstime_idivide(&nsta, 10);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect division result");
-
-	nstime_init2(&nsta, 42, 666666666);
-	nstime_copy(&nstb, &nsta);
-	nstime_imultiply(&nsta, 3);
-	nstime_idivide(&nsta, 3);
-	assert_d_eq(nstime_compare(&nsta, &nstb), 0,
-	    "Incorrect division result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_divide) {
-	nstime_t nsta, nstb, nstc;
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_imultiply(&nsta, 10);
-	assert_u64_eq(nstime_divide(&nsta, &nstb), 10,
-	    "Incorrect division result");
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_imultiply(&nsta, 10);
-	nstime_init(&nstc, 1);
-	nstime_add(&nsta, &nstc);
-	assert_u64_eq(nstime_divide(&nsta, &nstb), 10,
-	    "Incorrect division result");
-
-	nstime_init2(&nsta, 42, 43);
-	nstime_copy(&nstb, &nsta);
-	nstime_imultiply(&nsta, 10);
-	nstime_init(&nstc, 1);
-	nstime_subtract(&nsta, &nstc);
-	assert_u64_eq(nstime_divide(&nsta, &nstb), 9,
-	    "Incorrect division result");
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_monotonic) {
-	nstime_monotonic();
-}
-TEST_END
-
-TEST_BEGIN(test_nstime_update) {
-	nstime_t nst;
-
-	nstime_init(&nst, 0);
-
-	assert_false(nstime_update(&nst), "Basic time update failed.");
-
-	/* Only Rip Van Winkle sleeps this long. */
-	{
-		nstime_t addend;
-		nstime_init2(&addend, 631152000, 0);
-		nstime_add(&nst, &addend);
-	}
-	{
-		nstime_t nst0;
-		nstime_copy(&nst0, &nst);
-		assert_true(nstime_update(&nst),
-		    "Update should detect time roll-back.");
-		assert_d_eq(nstime_compare(&nst, &nst0), 0,
-		    "Time should not have been modified");
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_nstime_init,
-	    test_nstime_init2,
-	    test_nstime_copy,
-	    test_nstime_compare,
-	    test_nstime_add,
-	    test_nstime_iadd,
-	    test_nstime_subtract,
-	    test_nstime_isubtract,
-	    test_nstime_imultiply,
-	    test_nstime_idivide,
-	    test_nstime_divide,
-	    test_nstime_monotonic,
-	    test_nstime_update);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/pack.c b/redis-stable/deps/jemalloc/test/unit/pack.c
deleted file mode 100644
index fc188b00..00000000
--- a/redis-stable/deps/jemalloc/test/unit/pack.c
+++ /dev/null
@@ -1,166 +0,0 @@
-#include "test/jemalloc_test.h"
-
-/*
- * Size class that is a divisor of the page size, ideally 4+ regions per run.
- */
-#if LG_PAGE <= 14
-#define SZ	(ZU(1) << (LG_PAGE - 2))
-#else
-#define SZ	ZU(4096)
-#endif
-
-/*
- * Number of slabs to consume at high water mark.  Should be at least 2 so that
- * if mmap()ed memory grows downward, downward growth of mmap()ed memory is
- * tested.
- */
-#define NSLABS	8
-
-static unsigned
-binind_compute(void) {
-	size_t sz;
-	unsigned nbins, i;
-
-	sz = sizeof(nbins);
-	assert_d_eq(mallctl("arenas.nbins", (void *)&nbins, &sz, NULL, 0), 0,
-	    "Unexpected mallctl failure");
-
-	for (i = 0; i < nbins; i++) {
-		size_t mib[4];
-		size_t miblen = sizeof(mib)/sizeof(size_t);
-		size_t size;
-
-		assert_d_eq(mallctlnametomib("arenas.bin.0.size", mib,
-		    &miblen), 0, "Unexpected mallctlnametomb failure");
-		mib[2] = (size_t)i;
-
-		sz = sizeof(size);
-		assert_d_eq(mallctlbymib(mib, miblen, (void *)&size, &sz, NULL,
-		    0), 0, "Unexpected mallctlbymib failure");
-		if (size == SZ) {
-			return i;
-		}
-	}
-
-	test_fail("Unable to compute nregs_per_run");
-	return 0;
-}
-
-static size_t
-nregs_per_run_compute(void) {
-	uint32_t nregs;
-	size_t sz;
-	unsigned binind = binind_compute();
-	size_t mib[4];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-
-	assert_d_eq(mallctlnametomib("arenas.bin.0.nregs", mib, &miblen), 0,
-	    "Unexpected mallctlnametomb failure");
-	mib[2] = (size_t)binind;
-	sz = sizeof(nregs);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&nregs, &sz, NULL,
-	    0), 0, "Unexpected mallctlbymib failure");
-	return nregs;
-}
-
-static unsigned
-arenas_create_mallctl(void) {
-	unsigned arena_ind;
-	size_t sz;
-
-	sz = sizeof(arena_ind);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Error in arenas.create");
-
-	return arena_ind;
-}
-
-static void
-arena_reset_mallctl(unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen = sizeof(mib)/sizeof(size_t);
-
-	assert_d_eq(mallctlnametomib("arena.0.reset", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-TEST_BEGIN(test_pack) {
-	bool prof_enabled;
-	size_t sz = sizeof(prof_enabled);
-	if (mallctl("opt.prof", (void *)&prof_enabled, &sz, NULL, 0) == 0) {
-		test_skip_if(prof_enabled);
-	}
-
-	unsigned arena_ind = arenas_create_mallctl();
-	size_t nregs_per_run = nregs_per_run_compute();
-	size_t nregs = nregs_per_run * NSLABS;
-	VARIABLE_ARRAY(void *, ptrs, nregs);
-	size_t i, j, offset;
-
-	/* Fill matrix. */
-	for (i = offset = 0; i < NSLABS; i++) {
-		for (j = 0; j < nregs_per_run; j++) {
-			void *p = mallocx(SZ, MALLOCX_ARENA(arena_ind) |
-			    MALLOCX_TCACHE_NONE);
-			assert_ptr_not_null(p,
-			    "Unexpected mallocx(%zu, MALLOCX_ARENA(%u) |"
-			    " MALLOCX_TCACHE_NONE) failure, run=%zu, reg=%zu",
-			    SZ, arena_ind, i, j);
-			ptrs[(i * nregs_per_run) + j] = p;
-		}
-	}
-
-	/*
-	 * Free all but one region of each run, but rotate which region is
-	 * preserved, so that subsequent allocations exercise the within-run
-	 * layout policy.
-	 */
-	offset = 0;
-	for (i = offset = 0;
-	    i < NSLABS;
-	    i++, offset = (offset + 1) % nregs_per_run) {
-		for (j = 0; j < nregs_per_run; j++) {
-			void *p = ptrs[(i * nregs_per_run) + j];
-			if (offset == j) {
-				continue;
-			}
-			dallocx(p, MALLOCX_ARENA(arena_ind) |
-			    MALLOCX_TCACHE_NONE);
-		}
-	}
-
-	/*
-	 * Logically refill matrix, skipping preserved regions and verifying
-	 * that the matrix is unmodified.
-	 */
-	offset = 0;
-	for (i = offset = 0;
-	    i < NSLABS;
-	    i++, offset = (offset + 1) % nregs_per_run) {
-		for (j = 0; j < nregs_per_run; j++) {
-			void *p;
-
-			if (offset == j) {
-				continue;
-			}
-			p = mallocx(SZ, MALLOCX_ARENA(arena_ind) |
-			    MALLOCX_TCACHE_NONE);
-			assert_ptr_eq(p, ptrs[(i * nregs_per_run) + j],
-			    "Unexpected refill discrepancy, run=%zu, reg=%zu\n",
-			    i, j);
-		}
-	}
-
-	/* Clean up. */
-	arena_reset_mallctl(arena_ind);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_pack);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/pack.sh b/redis-stable/deps/jemalloc/test/unit/pack.sh
deleted file mode 100644
index 6f451480..00000000
--- a/redis-stable/deps/jemalloc/test/unit/pack.sh
+++ /dev/null
@@ -1,4 +0,0 @@
-#!/bin/sh
-
-# Immediately purge to minimize fragmentation.
-export MALLOC_CONF="dirty_decay_ms:0,muzzy_decay_ms:0"
diff --git a/redis-stable/deps/jemalloc/test/unit/pages.c b/redis-stable/deps/jemalloc/test/unit/pages.c
deleted file mode 100644
index ee729eec..00000000
--- a/redis-stable/deps/jemalloc/test/unit/pages.c
+++ /dev/null
@@ -1,29 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_pages_huge) {
-	size_t alloc_size;
-	bool commit;
-	void *pages, *hugepage;
-
-	alloc_size = HUGEPAGE * 2 - PAGE;
-	commit = true;
-	pages = pages_map(NULL, alloc_size, PAGE, &commit);
-	assert_ptr_not_null(pages, "Unexpected pages_map() error");
-
-	if (init_system_thp_mode == thp_mode_default) {
-	    hugepage = (void *)(ALIGNMENT_CEILING((uintptr_t)pages, HUGEPAGE));
-	    assert_b_ne(pages_huge(hugepage, HUGEPAGE), have_madvise_huge,
-	        "Unexpected pages_huge() result");
-	    assert_false(pages_nohuge(hugepage, HUGEPAGE),
-	        "Unexpected pages_nohuge() result");
-	}
-
-	pages_unmap(pages, alloc_size);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_pages_huge);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/ph.c b/redis-stable/deps/jemalloc/test/unit/ph.c
deleted file mode 100644
index 88bf56f8..00000000
--- a/redis-stable/deps/jemalloc/test/unit/ph.c
+++ /dev/null
@@ -1,318 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/ph.h"
-
-typedef struct node_s node_t;
-
-struct node_s {
-#define NODE_MAGIC 0x9823af7e
-	uint32_t magic;
-	phn(node_t) link;
-	uint64_t key;
-};
-
-static int
-node_cmp(const node_t *a, const node_t *b) {
-	int ret;
-
-	ret = (a->key > b->key) - (a->key < b->key);
-	if (ret == 0) {
-		/*
-		 * Duplicates are not allowed in the heap, so force an
-		 * arbitrary ordering for non-identical items with equal keys.
-		 */
-		ret = (((uintptr_t)a) > ((uintptr_t)b))
-		    - (((uintptr_t)a) < ((uintptr_t)b));
-	}
-	return ret;
-}
-
-static int
-node_cmp_magic(const node_t *a, const node_t *b) {
-
-	assert_u32_eq(a->magic, NODE_MAGIC, "Bad magic");
-	assert_u32_eq(b->magic, NODE_MAGIC, "Bad magic");
-
-	return node_cmp(a, b);
-}
-
-typedef ph(node_t) heap_t;
-ph_gen(static, heap_, heap_t, node_t, link, node_cmp_magic);
-
-static void
-node_print(const node_t *node, unsigned depth) {
-	unsigned i;
-	node_t *leftmost_child, *sibling;
-
-	for (i = 0; i < depth; i++) {
-		malloc_printf("\t");
-	}
-	malloc_printf("%2"FMTu64"\n", node->key);
-
-	leftmost_child = phn_lchild_get(node_t, link, node);
-	if (leftmost_child == NULL) {
-		return;
-	}
-	node_print(leftmost_child, depth + 1);
-
-	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
-	    NULL; sibling = phn_next_get(node_t, link, sibling)) {
-		node_print(sibling, depth + 1);
-	}
-}
-
-static void
-heap_print(const heap_t *heap) {
-	node_t *auxelm;
-
-	malloc_printf("vvv heap %p vvv\n", heap);
-	if (heap->ph_root == NULL) {
-		goto label_return;
-	}
-
-	node_print(heap->ph_root, 0);
-
-	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
-	    auxelm = phn_next_get(node_t, link, auxelm)) {
-		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
-		    link, auxelm)), auxelm,
-		    "auxelm's prev doesn't link to auxelm");
-		node_print(auxelm, 0);
-	}
-
-label_return:
-	malloc_printf("^^^ heap %p ^^^\n", heap);
-}
-
-static unsigned
-node_validate(const node_t *node, const node_t *parent) {
-	unsigned nnodes = 1;
-	node_t *leftmost_child, *sibling;
-
-	if (parent != NULL) {
-		assert_d_ge(node_cmp_magic(node, parent), 0,
-		    "Child is less than parent");
-	}
-
-	leftmost_child = phn_lchild_get(node_t, link, node);
-	if (leftmost_child == NULL) {
-		return nnodes;
-	}
-	assert_ptr_eq((void *)phn_prev_get(node_t, link, leftmost_child),
-	    (void *)node, "Leftmost child does not link to node");
-	nnodes += node_validate(leftmost_child, node);
-
-	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
-	    NULL; sibling = phn_next_get(node_t, link, sibling)) {
-		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
-		    link, sibling)), sibling,
-		    "sibling's prev doesn't link to sibling");
-		nnodes += node_validate(sibling, node);
-	}
-	return nnodes;
-}
-
-static unsigned
-heap_validate(const heap_t *heap) {
-	unsigned nnodes = 0;
-	node_t *auxelm;
-
-	if (heap->ph_root == NULL) {
-		goto label_return;
-	}
-
-	nnodes += node_validate(heap->ph_root, NULL);
-
-	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
-	    auxelm = phn_next_get(node_t, link, auxelm)) {
-		assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
-		    link, auxelm)), auxelm,
-		    "auxelm's prev doesn't link to auxelm");
-		nnodes += node_validate(auxelm, NULL);
-	}
-
-label_return:
-	if (false) {
-		heap_print(heap);
-	}
-	return nnodes;
-}
-
-TEST_BEGIN(test_ph_empty) {
-	heap_t heap;
-
-	heap_new(&heap);
-	assert_true(heap_empty(&heap), "Heap should be empty");
-	assert_ptr_null(heap_first(&heap), "Unexpected node");
-	assert_ptr_null(heap_any(&heap), "Unexpected node");
-}
-TEST_END
-
-static void
-node_remove(heap_t *heap, node_t *node) {
-	heap_remove(heap, node);
-
-	node->magic = 0;
-}
-
-static node_t *
-node_remove_first(heap_t *heap) {
-	node_t *node = heap_remove_first(heap);
-	node->magic = 0;
-	return node;
-}
-
-static node_t *
-node_remove_any(heap_t *heap) {
-	node_t *node = heap_remove_any(heap);
-	node->magic = 0;
-	return node;
-}
-
-TEST_BEGIN(test_ph_random) {
-#define NNODES 25
-#define NBAGS 250
-#define SEED 42
-	sfmt_t *sfmt;
-	uint64_t bag[NNODES];
-	heap_t heap;
-	node_t nodes[NNODES];
-	unsigned i, j, k;
-
-	sfmt = init_gen_rand(SEED);
-	for (i = 0; i < NBAGS; i++) {
-		switch (i) {
-		case 0:
-			/* Insert in order. */
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = j;
-			}
-			break;
-		case 1:
-			/* Insert in reverse order. */
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = NNODES - j - 1;
-			}
-			break;
-		default:
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = gen_rand64_range(sfmt, NNODES);
-			}
-		}
-
-		for (j = 1; j <= NNODES; j++) {
-			/* Initialize heap and nodes. */
-			heap_new(&heap);
-			assert_u_eq(heap_validate(&heap), 0,
-			    "Incorrect node count");
-			for (k = 0; k < j; k++) {
-				nodes[k].magic = NODE_MAGIC;
-				nodes[k].key = bag[k];
-			}
-
-			/* Insert nodes. */
-			for (k = 0; k < j; k++) {
-				heap_insert(&heap, &nodes[k]);
-				if (i % 13 == 12) {
-					assert_ptr_not_null(heap_any(&heap),
-					    "Heap should not be empty");
-					/* Trigger merging. */
-					assert_ptr_not_null(heap_first(&heap),
-					    "Heap should not be empty");
-				}
-				assert_u_eq(heap_validate(&heap), k + 1,
-				    "Incorrect node count");
-			}
-
-			assert_false(heap_empty(&heap),
-			    "Heap should not be empty");
-
-			/* Remove nodes. */
-			switch (i % 6) {
-			case 0:
-				for (k = 0; k < j; k++) {
-					assert_u_eq(heap_validate(&heap), j - k,
-					    "Incorrect node count");
-					node_remove(&heap, &nodes[k]);
-					assert_u_eq(heap_validate(&heap), j - k
-					    - 1, "Incorrect node count");
-				}
-				break;
-			case 1:
-				for (k = j; k > 0; k--) {
-					node_remove(&heap, &nodes[k-1]);
-					assert_u_eq(heap_validate(&heap), k - 1,
-					    "Incorrect node count");
-				}
-				break;
-			case 2: {
-				node_t *prev = NULL;
-				for (k = 0; k < j; k++) {
-					node_t *node = node_remove_first(&heap);
-					assert_u_eq(heap_validate(&heap), j - k
-					    - 1, "Incorrect node count");
-					if (prev != NULL) {
-						assert_d_ge(node_cmp(node,
-						    prev), 0,
-						    "Bad removal order");
-					}
-					prev = node;
-				}
-				break;
-			} case 3: {
-				node_t *prev = NULL;
-				for (k = 0; k < j; k++) {
-					node_t *node = heap_first(&heap);
-					assert_u_eq(heap_validate(&heap), j - k,
-					    "Incorrect node count");
-					if (prev != NULL) {
-						assert_d_ge(node_cmp(node,
-						    prev), 0,
-						    "Bad removal order");
-					}
-					node_remove(&heap, node);
-					assert_u_eq(heap_validate(&heap), j - k
-					    - 1, "Incorrect node count");
-					prev = node;
-				}
-				break;
-			} case 4: {
-				for (k = 0; k < j; k++) {
-					node_remove_any(&heap);
-					assert_u_eq(heap_validate(&heap), j - k
-					    - 1, "Incorrect node count");
-				}
-				break;
-			} case 5: {
-				for (k = 0; k < j; k++) {
-					node_t *node = heap_any(&heap);
-					assert_u_eq(heap_validate(&heap), j - k,
-					    "Incorrect node count");
-					node_remove(&heap, node);
-					assert_u_eq(heap_validate(&heap), j - k
-					    - 1, "Incorrect node count");
-				}
-				break;
-			} default:
-				not_reached();
-			}
-
-			assert_ptr_null(heap_first(&heap),
-			    "Heap should be empty");
-			assert_ptr_null(heap_any(&heap),
-			    "Heap should be empty");
-			assert_true(heap_empty(&heap), "Heap should be empty");
-		}
-	}
-	fini_gen_rand(sfmt);
-#undef NNODES
-#undef SEED
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_ph_empty,
-	    test_ph_random);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prng.c b/redis-stable/deps/jemalloc/test/unit/prng.c
deleted file mode 100644
index b5795c2f..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prng.c
+++ /dev/null
@@ -1,237 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static void
-test_prng_lg_range_u32(bool atomic) {
-	atomic_u32_t sa, sb;
-	uint32_t ra, rb;
-	unsigned lg_range;
-
-	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_u32(&sa, 32, atomic);
-	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
-	rb = prng_lg_range_u32(&sa, 32, atomic);
-	assert_u32_eq(ra, rb,
-	    "Repeated generation should produce repeated results");
-
-	atomic_store_u32(&sb, 42, ATOMIC_RELAXED);
-	rb = prng_lg_range_u32(&sb, 32, atomic);
-	assert_u32_eq(ra, rb,
-	    "Equivalent generation should produce equivalent results");
-
-	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_u32(&sa, 32, atomic);
-	rb = prng_lg_range_u32(&sa, 32, atomic);
-	assert_u32_ne(ra, rb,
-	    "Full-width results must not immediately repeat");
-
-	atomic_store_u32(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_u32(&sa, 32, atomic);
-	for (lg_range = 31; lg_range > 0; lg_range--) {
-		atomic_store_u32(&sb, 42, ATOMIC_RELAXED);
-		rb = prng_lg_range_u32(&sb, lg_range, atomic);
-		assert_u32_eq((rb & (UINT32_C(0xffffffff) << lg_range)),
-		    0, "High order bits should be 0, lg_range=%u", lg_range);
-		assert_u32_eq(rb, (ra >> (32 - lg_range)),
-		    "Expected high order bits of full-width result, "
-		    "lg_range=%u", lg_range);
-	}
-}
-
-static void
-test_prng_lg_range_u64(void) {
-	uint64_t sa, sb, ra, rb;
-	unsigned lg_range;
-
-	sa = 42;
-	ra = prng_lg_range_u64(&sa, 64);
-	sa = 42;
-	rb = prng_lg_range_u64(&sa, 64);
-	assert_u64_eq(ra, rb,
-	    "Repeated generation should produce repeated results");
-
-	sb = 42;
-	rb = prng_lg_range_u64(&sb, 64);
-	assert_u64_eq(ra, rb,
-	    "Equivalent generation should produce equivalent results");
-
-	sa = 42;
-	ra = prng_lg_range_u64(&sa, 64);
-	rb = prng_lg_range_u64(&sa, 64);
-	assert_u64_ne(ra, rb,
-	    "Full-width results must not immediately repeat");
-
-	sa = 42;
-	ra = prng_lg_range_u64(&sa, 64);
-	for (lg_range = 63; lg_range > 0; lg_range--) {
-		sb = 42;
-		rb = prng_lg_range_u64(&sb, lg_range);
-		assert_u64_eq((rb & (UINT64_C(0xffffffffffffffff) << lg_range)),
-		    0, "High order bits should be 0, lg_range=%u", lg_range);
-		assert_u64_eq(rb, (ra >> (64 - lg_range)),
-		    "Expected high order bits of full-width result, "
-		    "lg_range=%u", lg_range);
-	}
-}
-
-static void
-test_prng_lg_range_zu(bool atomic) {
-	atomic_zu_t sa, sb;
-	size_t ra, rb;
-	unsigned lg_range;
-
-	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
-	rb = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	assert_zu_eq(ra, rb,
-	    "Repeated generation should produce repeated results");
-
-	atomic_store_zu(&sb, 42, ATOMIC_RELAXED);
-	rb = prng_lg_range_zu(&sb, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	assert_zu_eq(ra, rb,
-	    "Equivalent generation should produce equivalent results");
-
-	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	rb = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	assert_zu_ne(ra, rb,
-	    "Full-width results must not immediately repeat");
-
-	atomic_store_zu(&sa, 42, ATOMIC_RELAXED);
-	ra = prng_lg_range_zu(&sa, ZU(1) << (3 + LG_SIZEOF_PTR), atomic);
-	for (lg_range = (ZU(1) << (3 + LG_SIZEOF_PTR)) - 1; lg_range > 0;
-	    lg_range--) {
-		atomic_store_zu(&sb, 42, ATOMIC_RELAXED);
-		rb = prng_lg_range_zu(&sb, lg_range, atomic);
-		assert_zu_eq((rb & (SIZE_T_MAX << lg_range)),
-		    0, "High order bits should be 0, lg_range=%u", lg_range);
-		assert_zu_eq(rb, (ra >> ((ZU(1) << (3 + LG_SIZEOF_PTR)) -
-		    lg_range)), "Expected high order bits of full-width "
-		    "result, lg_range=%u", lg_range);
-	}
-}
-
-TEST_BEGIN(test_prng_lg_range_u32_nonatomic) {
-	test_prng_lg_range_u32(false);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_lg_range_u32_atomic) {
-	test_prng_lg_range_u32(true);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_lg_range_u64_nonatomic) {
-	test_prng_lg_range_u64();
-}
-TEST_END
-
-TEST_BEGIN(test_prng_lg_range_zu_nonatomic) {
-	test_prng_lg_range_zu(false);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_lg_range_zu_atomic) {
-	test_prng_lg_range_zu(true);
-}
-TEST_END
-
-static void
-test_prng_range_u32(bool atomic) {
-	uint32_t range;
-#define MAX_RANGE	10000000
-#define RANGE_STEP	97
-#define NREPS		10
-
-	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
-		atomic_u32_t s;
-		unsigned rep;
-
-		atomic_store_u32(&s, range, ATOMIC_RELAXED);
-		for (rep = 0; rep < NREPS; rep++) {
-			uint32_t r = prng_range_u32(&s, range, atomic);
-
-			assert_u32_lt(r, range, "Out of range");
-		}
-	}
-}
-
-static void
-test_prng_range_u64(void) {
-	uint64_t range;
-#define MAX_RANGE	10000000
-#define RANGE_STEP	97
-#define NREPS		10
-
-	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
-		uint64_t s;
-		unsigned rep;
-
-		s = range;
-		for (rep = 0; rep < NREPS; rep++) {
-			uint64_t r = prng_range_u64(&s, range);
-
-			assert_u64_lt(r, range, "Out of range");
-		}
-	}
-}
-
-static void
-test_prng_range_zu(bool atomic) {
-	size_t range;
-#define MAX_RANGE	10000000
-#define RANGE_STEP	97
-#define NREPS		10
-
-	for (range = 2; range < MAX_RANGE; range += RANGE_STEP) {
-		atomic_zu_t s;
-		unsigned rep;
-
-		atomic_store_zu(&s, range, ATOMIC_RELAXED);
-		for (rep = 0; rep < NREPS; rep++) {
-			size_t r = prng_range_zu(&s, range, atomic);
-
-			assert_zu_lt(r, range, "Out of range");
-		}
-	}
-}
-
-TEST_BEGIN(test_prng_range_u32_nonatomic) {
-	test_prng_range_u32(false);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_range_u32_atomic) {
-	test_prng_range_u32(true);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_range_u64_nonatomic) {
-	test_prng_range_u64();
-}
-TEST_END
-
-TEST_BEGIN(test_prng_range_zu_nonatomic) {
-	test_prng_range_zu(false);
-}
-TEST_END
-
-TEST_BEGIN(test_prng_range_zu_atomic) {
-	test_prng_range_zu(true);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_prng_lg_range_u32_nonatomic,
-	    test_prng_lg_range_u32_atomic,
-	    test_prng_lg_range_u64_nonatomic,
-	    test_prng_lg_range_zu_nonatomic,
-	    test_prng_lg_range_zu_atomic,
-	    test_prng_range_u32_nonatomic,
-	    test_prng_range_u32_atomic,
-	    test_prng_range_u64_nonatomic,
-	    test_prng_range_zu_nonatomic,
-	    test_prng_range_zu_atomic);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_accum.c b/redis-stable/deps/jemalloc/test/unit/prof_accum.c
deleted file mode 100644
index 25220063..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_accum.c
+++ /dev/null
@@ -1,81 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#define NTHREADS		4
-#define NALLOCS_PER_THREAD	50
-#define DUMP_INTERVAL		1
-#define BT_COUNT_CHECK_INTERVAL	5
-
-static int
-prof_dump_open_intercept(bool propagate_err, const char *filename) {
-	int fd;
-
-	fd = open("/dev/null", O_WRONLY);
-	assert_d_ne(fd, -1, "Unexpected open() failure");
-
-	return fd;
-}
-
-static void *
-alloc_from_permuted_backtrace(unsigned thd_ind, unsigned iteration) {
-	return btalloc(1, thd_ind*NALLOCS_PER_THREAD + iteration);
-}
-
-static void *
-thd_start(void *varg) {
-	unsigned thd_ind = *(unsigned *)varg;
-	size_t bt_count_prev, bt_count;
-	unsigned i_prev, i;
-
-	i_prev = 0;
-	bt_count_prev = 0;
-	for (i = 0; i < NALLOCS_PER_THREAD; i++) {
-		void *p = alloc_from_permuted_backtrace(thd_ind, i);
-		dallocx(p, 0);
-		if (i % DUMP_INTERVAL == 0) {
-			assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
-			    0, "Unexpected error while dumping heap profile");
-		}
-
-		if (i % BT_COUNT_CHECK_INTERVAL == 0 ||
-		    i+1 == NALLOCS_PER_THREAD) {
-			bt_count = prof_bt_count();
-			assert_zu_le(bt_count_prev+(i-i_prev), bt_count,
-			    "Expected larger backtrace count increase");
-			i_prev = i;
-			bt_count_prev = bt_count;
-		}
-	}
-
-	return NULL;
-}
-
-TEST_BEGIN(test_idump) {
-	bool active;
-	thd_t thds[NTHREADS];
-	unsigned thd_args[NTHREADS];
-	unsigned i;
-
-	test_skip_if(!config_prof);
-
-	active = true;
-	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
-	    sizeof(active)), 0,
-	    "Unexpected mallctl failure while activating profiling");
-
-	prof_dump_open = prof_dump_open_intercept;
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_args[i] = i;
-		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
-	}
-	for (i = 0; i < NTHREADS; i++) {
-		thd_join(thds[i], NULL);
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_idump);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_accum.sh b/redis-stable/deps/jemalloc/test/unit/prof_accum.sh
deleted file mode 100644
index b3e13fc5..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_accum.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,prof_accum:true,prof_active:false,lg_prof_sample:0"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_active.c b/redis-stable/deps/jemalloc/test/unit/prof_active.c
deleted file mode 100644
index 850a24a7..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_active.c
+++ /dev/null
@@ -1,117 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static void
-mallctl_bool_get(const char *name, bool expected, const char *func, int line) {
-	bool old;
-	size_t sz;
-
-	sz = sizeof(old);
-	assert_d_eq(mallctl(name, (void *)&old, &sz, NULL, 0), 0,
-	    "%s():%d: Unexpected mallctl failure reading %s", func, line, name);
-	assert_b_eq(old, expected, "%s():%d: Unexpected %s value", func, line,
-	    name);
-}
-
-static void
-mallctl_bool_set(const char *name, bool old_expected, bool val_new,
-    const char *func, int line) {
-	bool old;
-	size_t sz;
-
-	sz = sizeof(old);
-	assert_d_eq(mallctl(name, (void *)&old, &sz, (void *)&val_new,
-	    sizeof(val_new)), 0,
-	    "%s():%d: Unexpected mallctl failure reading/writing %s", func,
-	    line, name);
-	assert_b_eq(old, old_expected, "%s():%d: Unexpected %s value", func,
-	    line, name);
-}
-
-static void
-mallctl_prof_active_get_impl(bool prof_active_old_expected, const char *func,
-    int line) {
-	mallctl_bool_get("prof.active", prof_active_old_expected, func, line);
-}
-#define mallctl_prof_active_get(a)					\
-	mallctl_prof_active_get_impl(a, __func__, __LINE__)
-
-static void
-mallctl_prof_active_set_impl(bool prof_active_old_expected,
-    bool prof_active_new, const char *func, int line) {
-	mallctl_bool_set("prof.active", prof_active_old_expected,
-	    prof_active_new, func, line);
-}
-#define mallctl_prof_active_set(a, b)					\
-	mallctl_prof_active_set_impl(a, b, __func__, __LINE__)
-
-static void
-mallctl_thread_prof_active_get_impl(bool thread_prof_active_old_expected,
-    const char *func, int line) {
-	mallctl_bool_get("thread.prof.active", thread_prof_active_old_expected,
-	    func, line);
-}
-#define mallctl_thread_prof_active_get(a)				\
-	mallctl_thread_prof_active_get_impl(a, __func__, __LINE__)
-
-static void
-mallctl_thread_prof_active_set_impl(bool thread_prof_active_old_expected,
-    bool thread_prof_active_new, const char *func, int line) {
-	mallctl_bool_set("thread.prof.active", thread_prof_active_old_expected,
-	    thread_prof_active_new, func, line);
-}
-#define mallctl_thread_prof_active_set(a, b)				\
-	mallctl_thread_prof_active_set_impl(a, b, __func__, __LINE__)
-
-static void
-prof_sampling_probe_impl(bool expect_sample, const char *func, int line) {
-	void *p;
-	size_t expected_backtraces = expect_sample ? 1 : 0;
-
-	assert_zu_eq(prof_bt_count(), 0, "%s():%d: Expected 0 backtraces", func,
-	    line);
-	p = mallocx(1, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	assert_zu_eq(prof_bt_count(), expected_backtraces,
-	    "%s():%d: Unexpected backtrace count", func, line);
-	dallocx(p, 0);
-}
-#define prof_sampling_probe(a)						\
-	prof_sampling_probe_impl(a, __func__, __LINE__)
-
-TEST_BEGIN(test_prof_active) {
-	test_skip_if(!config_prof);
-
-	mallctl_prof_active_get(true);
-	mallctl_thread_prof_active_get(false);
-
-	mallctl_prof_active_set(true, true);
-	mallctl_thread_prof_active_set(false, false);
-	/* prof.active, !thread.prof.active. */
-	prof_sampling_probe(false);
-
-	mallctl_prof_active_set(true, false);
-	mallctl_thread_prof_active_set(false, false);
-	/* !prof.active, !thread.prof.active. */
-	prof_sampling_probe(false);
-
-	mallctl_prof_active_set(false, false);
-	mallctl_thread_prof_active_set(false, true);
-	/* !prof.active, thread.prof.active. */
-	prof_sampling_probe(false);
-
-	mallctl_prof_active_set(false, true);
-	mallctl_thread_prof_active_set(true, true);
-	/* prof.active, thread.prof.active. */
-	prof_sampling_probe(true);
-
-	/* Restore settings. */
-	mallctl_prof_active_set(true, true);
-	mallctl_thread_prof_active_set(true, false);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_prof_active);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_active.sh b/redis-stable/deps/jemalloc/test/unit/prof_active.sh
deleted file mode 100644
index 0167cb10..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_active.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,prof_thread_active_init:false,lg_prof_sample:0"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_gdump.c b/redis-stable/deps/jemalloc/test/unit/prof_gdump.c
deleted file mode 100644
index fcb434cb..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_gdump.c
+++ /dev/null
@@ -1,74 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static bool did_prof_dump_open;
-
-static int
-prof_dump_open_intercept(bool propagate_err, const char *filename) {
-	int fd;
-
-	did_prof_dump_open = true;
-
-	fd = open("/dev/null", O_WRONLY);
-	assert_d_ne(fd, -1, "Unexpected open() failure");
-
-	return fd;
-}
-
-TEST_BEGIN(test_gdump) {
-	bool active, gdump, gdump_old;
-	void *p, *q, *r, *s;
-	size_t sz;
-
-	test_skip_if(!config_prof);
-
-	active = true;
-	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
-	    sizeof(active)), 0,
-	    "Unexpected mallctl failure while activating profiling");
-
-	prof_dump_open = prof_dump_open_intercept;
-
-	did_prof_dump_open = false;
-	p = mallocx((1U << LG_LARGE_MINCLASS), 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	assert_true(did_prof_dump_open, "Expected a profile dump");
-
-	did_prof_dump_open = false;
-	q = mallocx((1U << LG_LARGE_MINCLASS), 0);
-	assert_ptr_not_null(q, "Unexpected mallocx() failure");
-	assert_true(did_prof_dump_open, "Expected a profile dump");
-
-	gdump = false;
-	sz = sizeof(gdump_old);
-	assert_d_eq(mallctl("prof.gdump", (void *)&gdump_old, &sz,
-	    (void *)&gdump, sizeof(gdump)), 0,
-	    "Unexpected mallctl failure while disabling prof.gdump");
-	assert(gdump_old);
-	did_prof_dump_open = false;
-	r = mallocx((1U << LG_LARGE_MINCLASS), 0);
-	assert_ptr_not_null(q, "Unexpected mallocx() failure");
-	assert_false(did_prof_dump_open, "Unexpected profile dump");
-
-	gdump = true;
-	sz = sizeof(gdump_old);
-	assert_d_eq(mallctl("prof.gdump", (void *)&gdump_old, &sz,
-	    (void *)&gdump, sizeof(gdump)), 0,
-	    "Unexpected mallctl failure while enabling prof.gdump");
-	assert(!gdump_old);
-	did_prof_dump_open = false;
-	s = mallocx((1U << LG_LARGE_MINCLASS), 0);
-	assert_ptr_not_null(q, "Unexpected mallocx() failure");
-	assert_true(did_prof_dump_open, "Expected a profile dump");
-
-	dallocx(p, 0);
-	dallocx(q, 0);
-	dallocx(r, 0);
-	dallocx(s, 0);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_gdump);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh b/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
deleted file mode 100644
index 3f600d20..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_gdump.sh
+++ /dev/null
@@ -1,6 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,prof_active:false,prof_gdump:true"
-fi
-
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_idump.c b/redis-stable/deps/jemalloc/test/unit/prof_idump.c
deleted file mode 100644
index 1cc6c98c..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_idump.c
+++ /dev/null
@@ -1,42 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static bool did_prof_dump_open;
-
-static int
-prof_dump_open_intercept(bool propagate_err, const char *filename) {
-	int fd;
-
-	did_prof_dump_open = true;
-
-	fd = open("/dev/null", O_WRONLY);
-	assert_d_ne(fd, -1, "Unexpected open() failure");
-
-	return fd;
-}
-
-TEST_BEGIN(test_idump) {
-	bool active;
-	void *p;
-
-	test_skip_if(!config_prof);
-
-	active = true;
-	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
-	    sizeof(active)), 0,
-	    "Unexpected mallctl failure while activating profiling");
-
-	prof_dump_open = prof_dump_open_intercept;
-
-	did_prof_dump_open = false;
-	p = mallocx(1, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	dallocx(p, 0);
-	assert_true(did_prof_dump_open, "Expected a profile dump");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_idump);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_idump.sh b/redis-stable/deps/jemalloc/test/unit/prof_idump.sh
deleted file mode 100644
index 4dc599a3..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_idump.sh
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/sh
-
-export MALLOC_CONF="tcache:false"
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="${MALLOC_CONF},prof:true,prof_accum:true,prof_active:false,lg_prof_sample:0,lg_prof_interval:0"
-fi
-
-
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_reset.c b/redis-stable/deps/jemalloc/test/unit/prof_reset.c
deleted file mode 100644
index 7cce42d2..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_reset.c
+++ /dev/null
@@ -1,286 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static int
-prof_dump_open_intercept(bool propagate_err, const char *filename) {
-	int fd;
-
-	fd = open("/dev/null", O_WRONLY);
-	assert_d_ne(fd, -1, "Unexpected open() failure");
-
-	return fd;
-}
-
-static void
-set_prof_active(bool active) {
-	assert_d_eq(mallctl("prof.active", NULL, NULL, (void *)&active,
-	    sizeof(active)), 0, "Unexpected mallctl failure");
-}
-
-static size_t
-get_lg_prof_sample(void) {
-	size_t lg_prof_sample;
-	size_t sz = sizeof(size_t);
-
-	assert_d_eq(mallctl("prof.lg_sample", (void *)&lg_prof_sample, &sz,
-	    NULL, 0), 0,
-	    "Unexpected mallctl failure while reading profiling sample rate");
-	return lg_prof_sample;
-}
-
-static void
-do_prof_reset(size_t lg_prof_sample) {
-	assert_d_eq(mallctl("prof.reset", NULL, NULL,
-	    (void *)&lg_prof_sample, sizeof(size_t)), 0,
-	    "Unexpected mallctl failure while resetting profile data");
-	assert_zu_eq(lg_prof_sample, get_lg_prof_sample(),
-	    "Expected profile sample rate change");
-}
-
-TEST_BEGIN(test_prof_reset_basic) {
-	size_t lg_prof_sample_orig, lg_prof_sample, lg_prof_sample_next;
-	size_t sz;
-	unsigned i;
-
-	test_skip_if(!config_prof);
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("opt.lg_prof_sample", (void *)&lg_prof_sample_orig,
-	    &sz, NULL, 0), 0,
-	    "Unexpected mallctl failure while reading profiling sample rate");
-	assert_zu_eq(lg_prof_sample_orig, 0,
-	    "Unexpected profiling sample rate");
-	lg_prof_sample = get_lg_prof_sample();
-	assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
-	    "Unexpected disagreement between \"opt.lg_prof_sample\" and "
-	    "\"prof.lg_sample\"");
-
-	/* Test simple resets. */
-	for (i = 0; i < 2; i++) {
-		assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
-		    "Unexpected mallctl failure while resetting profile data");
-		lg_prof_sample = get_lg_prof_sample();
-		assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
-		    "Unexpected profile sample rate change");
-	}
-
-	/* Test resets with prof.lg_sample changes. */
-	lg_prof_sample_next = 1;
-	for (i = 0; i < 2; i++) {
-		do_prof_reset(lg_prof_sample_next);
-		lg_prof_sample = get_lg_prof_sample();
-		assert_zu_eq(lg_prof_sample, lg_prof_sample_next,
-		    "Expected profile sample rate change");
-		lg_prof_sample_next = lg_prof_sample_orig;
-	}
-
-	/* Make sure the test code restored prof.lg_sample. */
-	lg_prof_sample = get_lg_prof_sample();
-	assert_zu_eq(lg_prof_sample_orig, lg_prof_sample,
-	    "Unexpected disagreement between \"opt.lg_prof_sample\" and "
-	    "\"prof.lg_sample\"");
-}
-TEST_END
-
-bool prof_dump_header_intercepted = false;
-prof_cnt_t cnt_all_copy = {0, 0, 0, 0};
-static bool
-prof_dump_header_intercept(tsdn_t *tsdn, bool propagate_err,
-    const prof_cnt_t *cnt_all) {
-	prof_dump_header_intercepted = true;
-	memcpy(&cnt_all_copy, cnt_all, sizeof(prof_cnt_t));
-
-	return false;
-}
-
-TEST_BEGIN(test_prof_reset_cleanup) {
-	void *p;
-	prof_dump_header_t *prof_dump_header_orig;
-
-	test_skip_if(!config_prof);
-
-	set_prof_active(true);
-
-	assert_zu_eq(prof_bt_count(), 0, "Expected 0 backtraces");
-	p = mallocx(1, 0);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	assert_zu_eq(prof_bt_count(), 1, "Expected 1 backtrace");
-
-	prof_dump_header_orig = prof_dump_header;
-	prof_dump_header = prof_dump_header_intercept;
-	assert_false(prof_dump_header_intercepted, "Unexpected intercept");
-
-	assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
-	    0, "Unexpected error while dumping heap profile");
-	assert_true(prof_dump_header_intercepted, "Expected intercept");
-	assert_u64_eq(cnt_all_copy.curobjs, 1, "Expected 1 allocation");
-
-	assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
-	    "Unexpected error while resetting heap profile data");
-	assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
-	    0, "Unexpected error while dumping heap profile");
-	assert_u64_eq(cnt_all_copy.curobjs, 0, "Expected 0 allocations");
-	assert_zu_eq(prof_bt_count(), 1, "Expected 1 backtrace");
-
-	prof_dump_header = prof_dump_header_orig;
-
-	dallocx(p, 0);
-	assert_zu_eq(prof_bt_count(), 0, "Expected 0 backtraces");
-
-	set_prof_active(false);
-}
-TEST_END
-
-#define NTHREADS		4
-#define NALLOCS_PER_THREAD	(1U << 13)
-#define OBJ_RING_BUF_COUNT	1531
-#define RESET_INTERVAL		(1U << 10)
-#define DUMP_INTERVAL		3677
-static void *
-thd_start(void *varg) {
-	unsigned thd_ind = *(unsigned *)varg;
-	unsigned i;
-	void *objs[OBJ_RING_BUF_COUNT];
-
-	memset(objs, 0, sizeof(objs));
-
-	for (i = 0; i < NALLOCS_PER_THREAD; i++) {
-		if (i % RESET_INTERVAL == 0) {
-			assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0),
-			    0, "Unexpected error while resetting heap profile "
-			    "data");
-		}
-
-		if (i % DUMP_INTERVAL == 0) {
-			assert_d_eq(mallctl("prof.dump", NULL, NULL, NULL, 0),
-			    0, "Unexpected error while dumping heap profile");
-		}
-
-		{
-			void **pp = &objs[i % OBJ_RING_BUF_COUNT];
-			if (*pp != NULL) {
-				dallocx(*pp, 0);
-				*pp = NULL;
-			}
-			*pp = btalloc(1, thd_ind*NALLOCS_PER_THREAD + i);
-			assert_ptr_not_null(*pp,
-			    "Unexpected btalloc() failure");
-		}
-	}
-
-	/* Clean up any remaining objects. */
-	for (i = 0; i < OBJ_RING_BUF_COUNT; i++) {
-		void **pp = &objs[i % OBJ_RING_BUF_COUNT];
-		if (*pp != NULL) {
-			dallocx(*pp, 0);
-			*pp = NULL;
-		}
-	}
-
-	return NULL;
-}
-
-TEST_BEGIN(test_prof_reset) {
-	size_t lg_prof_sample_orig;
-	thd_t thds[NTHREADS];
-	unsigned thd_args[NTHREADS];
-	unsigned i;
-	size_t bt_count, tdata_count;
-
-	test_skip_if(!config_prof);
-
-	bt_count = prof_bt_count();
-	assert_zu_eq(bt_count, 0,
-	    "Unexpected pre-existing tdata structures");
-	tdata_count = prof_tdata_count();
-
-	lg_prof_sample_orig = get_lg_prof_sample();
-	do_prof_reset(5);
-
-	set_prof_active(true);
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_args[i] = i;
-		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
-	}
-	for (i = 0; i < NTHREADS; i++) {
-		thd_join(thds[i], NULL);
-	}
-
-	assert_zu_eq(prof_bt_count(), bt_count,
-	    "Unexpected bactrace count change");
-	assert_zu_eq(prof_tdata_count(), tdata_count,
-	    "Unexpected remaining tdata structures");
-
-	set_prof_active(false);
-
-	do_prof_reset(lg_prof_sample_orig);
-}
-TEST_END
-#undef NTHREADS
-#undef NALLOCS_PER_THREAD
-#undef OBJ_RING_BUF_COUNT
-#undef RESET_INTERVAL
-#undef DUMP_INTERVAL
-
-/* Test sampling at the same allocation site across resets. */
-#define NITER 10
-TEST_BEGIN(test_xallocx) {
-	size_t lg_prof_sample_orig;
-	unsigned i;
-	void *ptrs[NITER];
-
-	test_skip_if(!config_prof);
-
-	lg_prof_sample_orig = get_lg_prof_sample();
-	set_prof_active(true);
-
-	/* Reset profiling. */
-	do_prof_reset(0);
-
-	for (i = 0; i < NITER; i++) {
-		void *p;
-		size_t sz, nsz;
-
-		/* Reset profiling. */
-		do_prof_reset(0);
-
-		/* Allocate small object (which will be promoted). */
-		p = ptrs[i] = mallocx(1, 0);
-		assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-		/* Reset profiling. */
-		do_prof_reset(0);
-
-		/* Perform successful xallocx(). */
-		sz = sallocx(p, 0);
-		assert_zu_eq(xallocx(p, sz, 0, 0), sz,
-		    "Unexpected xallocx() failure");
-
-		/* Perform unsuccessful xallocx(). */
-		nsz = nallocx(sz+1, 0);
-		assert_zu_eq(xallocx(p, nsz, 0, 0), sz,
-		    "Unexpected xallocx() success");
-	}
-
-	for (i = 0; i < NITER; i++) {
-		/* dallocx. */
-		dallocx(ptrs[i], 0);
-	}
-
-	set_prof_active(false);
-	do_prof_reset(lg_prof_sample_orig);
-}
-TEST_END
-#undef NITER
-
-int
-main(void) {
-	/* Intercept dumping prior to running any tests. */
-	prof_dump_open = prof_dump_open_intercept;
-
-	return test_no_reentrancy(
-	    test_prof_reset_basic,
-	    test_prof_reset_cleanup,
-	    test_prof_reset,
-	    test_xallocx);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_reset.sh b/redis-stable/deps/jemalloc/test/unit/prof_reset.sh
deleted file mode 100644
index 43c516a0..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_reset.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,prof_active:false,lg_prof_sample:0"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_tctx.c b/redis-stable/deps/jemalloc/test/unit/prof_tctx.c
deleted file mode 100644
index ff3b2b0c..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_tctx.c
+++ /dev/null
@@ -1,46 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_prof_realloc) {
-	tsdn_t *tsdn;
-	int flags;
-	void *p, *q;
-	prof_tctx_t *tctx_p, *tctx_q;
-	uint64_t curobjs_0, curobjs_1, curobjs_2, curobjs_3;
-
-	test_skip_if(!config_prof);
-
-	tsdn = tsdn_fetch();
-	flags = MALLOCX_TCACHE_NONE;
-
-	prof_cnt_all(&curobjs_0, NULL, NULL, NULL);
-	p = mallocx(1024, flags);
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-	tctx_p = prof_tctx_get(tsdn, p, NULL);
-	assert_ptr_ne(tctx_p, (prof_tctx_t *)(uintptr_t)1U,
-	    "Expected valid tctx");
-	prof_cnt_all(&curobjs_1, NULL, NULL, NULL);
-	assert_u64_eq(curobjs_0 + 1, curobjs_1,
-	    "Allocation should have increased sample size");
-
-	q = rallocx(p, 2048, flags);
-	assert_ptr_ne(p, q, "Expected move");
-	assert_ptr_not_null(p, "Unexpected rmallocx() failure");
-	tctx_q = prof_tctx_get(tsdn, q, NULL);
-	assert_ptr_ne(tctx_q, (prof_tctx_t *)(uintptr_t)1U,
-	    "Expected valid tctx");
-	prof_cnt_all(&curobjs_2, NULL, NULL, NULL);
-	assert_u64_eq(curobjs_1, curobjs_2,
-	    "Reallocation should not have changed sample size");
-
-	dallocx(q, flags);
-	prof_cnt_all(&curobjs_3, NULL, NULL, NULL);
-	assert_u64_eq(curobjs_0, curobjs_3,
-	    "Sample size should have returned to base level");
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_prof_realloc);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh b/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
deleted file mode 100644
index 8fcc7d8a..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_tctx.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,lg_prof_sample:0"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
deleted file mode 100644
index c9c2a2b7..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.c
+++ /dev/null
@@ -1,120 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static void
-mallctl_thread_name_get_impl(const char *thread_name_expected, const char *func,
-    int line) {
-	const char *thread_name_old;
-	size_t sz;
-
-	sz = sizeof(thread_name_old);
-	assert_d_eq(mallctl("thread.prof.name", (void *)&thread_name_old, &sz,
-	    NULL, 0), 0,
-	    "%s():%d: Unexpected mallctl failure reading thread.prof.name",
-	    func, line);
-	assert_str_eq(thread_name_old, thread_name_expected,
-	    "%s():%d: Unexpected thread.prof.name value", func, line);
-}
-#define mallctl_thread_name_get(a)					\
-	mallctl_thread_name_get_impl(a, __func__, __LINE__)
-
-static void
-mallctl_thread_name_set_impl(const char *thread_name, const char *func,
-    int line) {
-	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
-	    (void *)&thread_name, sizeof(thread_name)), 0,
-	    "%s():%d: Unexpected mallctl failure reading thread.prof.name",
-	    func, line);
-	mallctl_thread_name_get_impl(thread_name, func, line);
-}
-#define mallctl_thread_name_set(a)					\
-	mallctl_thread_name_set_impl(a, __func__, __LINE__)
-
-TEST_BEGIN(test_prof_thread_name_validation) {
-	const char *thread_name;
-
-	test_skip_if(!config_prof);
-
-	mallctl_thread_name_get("");
-	mallctl_thread_name_set("hi there");
-
-	/* NULL input shouldn't be allowed. */
-	thread_name = NULL;
-	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
-	    (void *)&thread_name, sizeof(thread_name)), EFAULT,
-	    "Unexpected mallctl result writing \"%s\" to thread.prof.name",
-	    thread_name);
-
-	/* '\n' shouldn't be allowed. */
-	thread_name = "hi\nthere";
-	assert_d_eq(mallctl("thread.prof.name", NULL, NULL,
-	    (void *)&thread_name, sizeof(thread_name)), EFAULT,
-	    "Unexpected mallctl result writing \"%s\" to thread.prof.name",
-	    thread_name);
-
-	/* Simultaneous read/write shouldn't be allowed. */
-	{
-		const char *thread_name_old;
-		size_t sz;
-
-		sz = sizeof(thread_name_old);
-		assert_d_eq(mallctl("thread.prof.name",
-		    (void *)&thread_name_old, &sz, (void *)&thread_name,
-		    sizeof(thread_name)), EPERM,
-		    "Unexpected mallctl result writing \"%s\" to "
-		    "thread.prof.name", thread_name);
-	}
-
-	mallctl_thread_name_set("");
-}
-TEST_END
-
-#define NTHREADS	4
-#define NRESET		25
-static void *
-thd_start(void *varg) {
-	unsigned thd_ind = *(unsigned *)varg;
-	char thread_name[16] = "";
-	unsigned i;
-
-	malloc_snprintf(thread_name, sizeof(thread_name), "thread %u", thd_ind);
-
-	mallctl_thread_name_get("");
-	mallctl_thread_name_set(thread_name);
-
-	for (i = 0; i < NRESET; i++) {
-		assert_d_eq(mallctl("prof.reset", NULL, NULL, NULL, 0), 0,
-		    "Unexpected error while resetting heap profile data");
-		mallctl_thread_name_get(thread_name);
-	}
-
-	mallctl_thread_name_set(thread_name);
-	mallctl_thread_name_set("");
-
-	return NULL;
-}
-
-TEST_BEGIN(test_prof_thread_name_threaded) {
-	thd_t thds[NTHREADS];
-	unsigned thd_args[NTHREADS];
-	unsigned i;
-
-	test_skip_if(!config_prof);
-
-	for (i = 0; i < NTHREADS; i++) {
-		thd_args[i] = i;
-		thd_create(&thds[i], thd_start, (void *)&thd_args[i]);
-	}
-	for (i = 0; i < NTHREADS; i++) {
-		thd_join(thds[i], NULL);
-	}
-}
-TEST_END
-#undef NTHREADS
-#undef NRESET
-
-int
-main(void) {
-	return test(
-	    test_prof_thread_name_validation,
-	    test_prof_thread_name_threaded);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh b/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
deleted file mode 100644
index 298c1058..00000000
--- a/redis-stable/deps/jemalloc/test/unit/prof_thread_name.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_prof}" = "x1" ] ; then
-  export MALLOC_CONF="prof:true,prof_active:false"
-fi
diff --git a/redis-stable/deps/jemalloc/test/unit/ql.c b/redis-stable/deps/jemalloc/test/unit/ql.c
deleted file mode 100644
index b76c24c4..00000000
--- a/redis-stable/deps/jemalloc/test/unit/ql.c
+++ /dev/null
@@ -1,204 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/ql.h"
-
-/* Number of ring entries, in [2..26]. */
-#define NENTRIES 9
-
-typedef struct list_s list_t;
-typedef ql_head(list_t) list_head_t;
-
-struct list_s {
-	ql_elm(list_t) link;
-	char id;
-};
-
-static void
-test_empty_list(list_head_t *head) {
-	list_t *t;
-	unsigned i;
-
-	assert_ptr_null(ql_first(head), "Unexpected element for empty list");
-	assert_ptr_null(ql_last(head, link),
-	    "Unexpected element for empty list");
-
-	i = 0;
-	ql_foreach(t, head, link) {
-		i++;
-	}
-	assert_u_eq(i, 0, "Unexpected element for empty list");
-
-	i = 0;
-	ql_reverse_foreach(t, head, link) {
-		i++;
-	}
-	assert_u_eq(i, 0, "Unexpected element for empty list");
-}
-
-TEST_BEGIN(test_ql_empty) {
-	list_head_t head;
-
-	ql_new(&head);
-	test_empty_list(&head);
-}
-TEST_END
-
-static void
-init_entries(list_t *entries, unsigned nentries) {
-	unsigned i;
-
-	for (i = 0; i < nentries; i++) {
-		entries[i].id = 'a' + i;
-		ql_elm_new(&entries[i], link);
-	}
-}
-
-static void
-test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
-	list_t *t;
-	unsigned i;
-
-	assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
-	assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
-	    "Element id mismatch");
-
-	i = 0;
-	ql_foreach(t, head, link) {
-		assert_c_eq(t->id, entries[i].id, "Element id mismatch");
-		i++;
-	}
-
-	i = 0;
-	ql_reverse_foreach(t, head, link) {
-		assert_c_eq(t->id, entries[nentries-i-1].id,
-		    "Element id mismatch");
-		i++;
-	}
-
-	for (i = 0; i < nentries-1; i++) {
-		t = ql_next(head, &entries[i], link);
-		assert_c_eq(t->id, entries[i+1].id, "Element id mismatch");
-	}
-	assert_ptr_null(ql_next(head, &entries[nentries-1], link),
-	    "Unexpected element");
-
-	assert_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");
-	for (i = 1; i < nentries; i++) {
-		t = ql_prev(head, &entries[i], link);
-		assert_c_eq(t->id, entries[i-1].id, "Element id mismatch");
-	}
-}
-
-TEST_BEGIN(test_ql_tail_insert) {
-	list_head_t head;
-	list_t entries[NENTRIES];
-	unsigned i;
-
-	ql_new(&head);
-	init_entries(entries, sizeof(entries)/sizeof(list_t));
-	for (i = 0; i < NENTRIES; i++) {
-		ql_tail_insert(&head, &entries[i], link);
-	}
-
-	test_entries_list(&head, entries, NENTRIES);
-}
-TEST_END
-
-TEST_BEGIN(test_ql_tail_remove) {
-	list_head_t head;
-	list_t entries[NENTRIES];
-	unsigned i;
-
-	ql_new(&head);
-	init_entries(entries, sizeof(entries)/sizeof(list_t));
-	for (i = 0; i < NENTRIES; i++) {
-		ql_tail_insert(&head, &entries[i], link);
-	}
-
-	for (i = 0; i < NENTRIES; i++) {
-		test_entries_list(&head, entries, NENTRIES-i);
-		ql_tail_remove(&head, list_t, link);
-	}
-	test_empty_list(&head);
-}
-TEST_END
-
-TEST_BEGIN(test_ql_head_insert) {
-	list_head_t head;
-	list_t entries[NENTRIES];
-	unsigned i;
-
-	ql_new(&head);
-	init_entries(entries, sizeof(entries)/sizeof(list_t));
-	for (i = 0; i < NENTRIES; i++) {
-		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
-	}
-
-	test_entries_list(&head, entries, NENTRIES);
-}
-TEST_END
-
-TEST_BEGIN(test_ql_head_remove) {
-	list_head_t head;
-	list_t entries[NENTRIES];
-	unsigned i;
-
-	ql_new(&head);
-	init_entries(entries, sizeof(entries)/sizeof(list_t));
-	for (i = 0; i < NENTRIES; i++) {
-		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
-	}
-
-	for (i = 0; i < NENTRIES; i++) {
-		test_entries_list(&head, &entries[i], NENTRIES-i);
-		ql_head_remove(&head, list_t, link);
-	}
-	test_empty_list(&head);
-}
-TEST_END
-
-TEST_BEGIN(test_ql_insert) {
-	list_head_t head;
-	list_t entries[8];
-	list_t *a, *b, *c, *d, *e, *f, *g, *h;
-
-	ql_new(&head);
-	init_entries(entries, sizeof(entries)/sizeof(list_t));
-	a = &entries[0];
-	b = &entries[1];
-	c = &entries[2];
-	d = &entries[3];
-	e = &entries[4];
-	f = &entries[5];
-	g = &entries[6];
-	h = &entries[7];
-
-	/*
-	 * ql_remove(), ql_before_insert(), and ql_after_insert() are used
-	 * internally by other macros that are already tested, so there's no
-	 * need to test them completely.  However, insertion/deletion from the
-	 * middle of lists is not otherwise tested; do so here.
-	 */
-	ql_tail_insert(&head, f, link);
-	ql_before_insert(&head, f, b, link);
-	ql_before_insert(&head, f, c, link);
-	ql_after_insert(f, h, link);
-	ql_after_insert(f, g, link);
-	ql_before_insert(&head, b, a, link);
-	ql_after_insert(c, d, link);
-	ql_before_insert(&head, f, e, link);
-
-	test_entries_list(&head, entries, sizeof(entries)/sizeof(list_t));
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_ql_empty,
-	    test_ql_tail_insert,
-	    test_ql_tail_remove,
-	    test_ql_head_insert,
-	    test_ql_head_remove,
-	    test_ql_insert);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/qr.c b/redis-stable/deps/jemalloc/test/unit/qr.c
deleted file mode 100644
index 271a1095..00000000
--- a/redis-stable/deps/jemalloc/test/unit/qr.c
+++ /dev/null
@@ -1,243 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/qr.h"
-
-/* Number of ring entries, in [2..26]. */
-#define NENTRIES 9
-/* Split index, in [1..NENTRIES). */
-#define SPLIT_INDEX 5
-
-typedef struct ring_s ring_t;
-
-struct ring_s {
-	qr(ring_t) link;
-	char id;
-};
-
-static void
-init_entries(ring_t *entries) {
-	unsigned i;
-
-	for (i = 0; i < NENTRIES; i++) {
-		qr_new(&entries[i], link);
-		entries[i].id = 'a' + i;
-	}
-}
-
-static void
-test_independent_entries(ring_t *entries) {
-	ring_t *t;
-	unsigned i, j;
-
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_foreach(t, &entries[i], link) {
-			j++;
-		}
-		assert_u_eq(j, 1,
-		    "Iteration over single-element ring should visit precisely "
-		    "one element");
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_reverse_foreach(t, &entries[i], link) {
-			j++;
-		}
-		assert_u_eq(j, 1,
-		    "Iteration over single-element ring should visit precisely "
-		    "one element");
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_next(&entries[i], link);
-		assert_ptr_eq(t, &entries[i],
-		    "Next element in single-element ring should be same as "
-		    "current element");
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_prev(&entries[i], link);
-		assert_ptr_eq(t, &entries[i],
-		    "Previous element in single-element ring should be same as "
-		    "current element");
-	}
-}
-
-TEST_BEGIN(test_qr_one) {
-	ring_t entries[NENTRIES];
-
-	init_entries(entries);
-	test_independent_entries(entries);
-}
-TEST_END
-
-static void
-test_entries_ring(ring_t *entries) {
-	ring_t *t;
-	unsigned i, j;
-
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[(i+j) % NENTRIES].id,
-			    "Element id mismatch");
-			j++;
-		}
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_reverse_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[(NENTRIES+i-j-1) %
-			    NENTRIES].id, "Element id mismatch");
-			j++;
-		}
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_next(&entries[i], link);
-		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,
-		    "Element id mismatch");
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_prev(&entries[i], link);
-		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,
-		    "Element id mismatch");
-	}
-}
-
-TEST_BEGIN(test_qr_after_insert) {
-	ring_t entries[NENTRIES];
-	unsigned i;
-
-	init_entries(entries);
-	for (i = 1; i < NENTRIES; i++) {
-		qr_after_insert(&entries[i - 1], &entries[i], link);
-	}
-	test_entries_ring(entries);
-}
-TEST_END
-
-TEST_BEGIN(test_qr_remove) {
-	ring_t entries[NENTRIES];
-	ring_t *t;
-	unsigned i, j;
-
-	init_entries(entries);
-	for (i = 1; i < NENTRIES; i++) {
-		qr_after_insert(&entries[i - 1], &entries[i], link);
-	}
-
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[i+j].id,
-			    "Element id mismatch");
-			j++;
-		}
-		j = 0;
-		qr_reverse_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[NENTRIES - 1 - j].id,
-			"Element id mismatch");
-			j++;
-		}
-		qr_remove(&entries[i], link);
-	}
-	test_independent_entries(entries);
-}
-TEST_END
-
-TEST_BEGIN(test_qr_before_insert) {
-	ring_t entries[NENTRIES];
-	ring_t *t;
-	unsigned i, j;
-
-	init_entries(entries);
-	for (i = 1; i < NENTRIES; i++) {
-		qr_before_insert(&entries[i - 1], &entries[i], link);
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[(NENTRIES+i-j) %
-			    NENTRIES].id, "Element id mismatch");
-			j++;
-		}
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_reverse_foreach(t, &entries[i], link) {
-			assert_c_eq(t->id, entries[(i+j+1) % NENTRIES].id,
-			    "Element id mismatch");
-			j++;
-		}
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_next(&entries[i], link);
-		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,
-		    "Element id mismatch");
-	}
-	for (i = 0; i < NENTRIES; i++) {
-		t = qr_prev(&entries[i], link);
-		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,
-		    "Element id mismatch");
-	}
-}
-TEST_END
-
-static void
-test_split_entries(ring_t *entries) {
-	ring_t *t;
-	unsigned i, j;
-
-	for (i = 0; i < NENTRIES; i++) {
-		j = 0;
-		qr_foreach(t, &entries[i], link) {
-			if (i < SPLIT_INDEX) {
-				assert_c_eq(t->id,
-				    entries[(i+j) % SPLIT_INDEX].id,
-				    "Element id mismatch");
-			} else {
-				assert_c_eq(t->id, entries[(i+j-SPLIT_INDEX) %
-				    (NENTRIES-SPLIT_INDEX) + SPLIT_INDEX].id,
-				    "Element id mismatch");
-			}
-			j++;
-		}
-	}
-}
-
-TEST_BEGIN(test_qr_meld_split) {
-	ring_t entries[NENTRIES];
-	unsigned i;
-
-	init_entries(entries);
-	for (i = 1; i < NENTRIES; i++) {
-		qr_after_insert(&entries[i - 1], &entries[i], link);
-	}
-
-	qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
-	test_split_entries(entries);
-
-	qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
-	test_entries_ring(entries);
-
-	qr_meld(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
-	test_split_entries(entries);
-
-	qr_split(&entries[0], &entries[SPLIT_INDEX], ring_t, link);
-	test_entries_ring(entries);
-
-	qr_split(&entries[0], &entries[0], ring_t, link);
-	test_entries_ring(entries);
-
-	qr_meld(&entries[0], &entries[0], ring_t, link);
-	test_entries_ring(entries);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_qr_one,
-	    test_qr_after_insert,
-	    test_qr_remove,
-	    test_qr_before_insert,
-	    test_qr_meld_split);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/rb.c b/redis-stable/deps/jemalloc/test/unit/rb.c
deleted file mode 100644
index 65c04920..00000000
--- a/redis-stable/deps/jemalloc/test/unit/rb.c
+++ /dev/null
@@ -1,355 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/rb.h"
-
-#define rbtn_black_height(a_type, a_field, a_rbt, r_height) do {	\
-	a_type *rbp_bh_t;						\
-	for (rbp_bh_t = (a_rbt)->rbt_root, (r_height) = 0; rbp_bh_t !=	\
-	    NULL; rbp_bh_t = rbtn_left_get(a_type, a_field,		\
-	    rbp_bh_t)) {						\
-		if (!rbtn_red_get(a_type, a_field, rbp_bh_t)) {		\
-		(r_height)++;						\
-		}							\
-	}								\
-} while (0)
-
-typedef struct node_s node_t;
-
-struct node_s {
-#define NODE_MAGIC 0x9823af7e
-	uint32_t magic;
-	rb_node(node_t) link;
-	uint64_t key;
-};
-
-static int
-node_cmp(const node_t *a, const node_t *b) {
-	int ret;
-
-	assert_u32_eq(a->magic, NODE_MAGIC, "Bad magic");
-	assert_u32_eq(b->magic, NODE_MAGIC, "Bad magic");
-
-	ret = (a->key > b->key) - (a->key < b->key);
-	if (ret == 0) {
-		/*
-		 * Duplicates are not allowed in the tree, so force an
-		 * arbitrary ordering for non-identical items with equal keys.
-		 */
-		ret = (((uintptr_t)a) > ((uintptr_t)b))
-		    - (((uintptr_t)a) < ((uintptr_t)b));
-	}
-	return ret;
-}
-
-typedef rb_tree(node_t) tree_t;
-rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
-
-TEST_BEGIN(test_rb_empty) {
-	tree_t tree;
-	node_t key;
-
-	tree_new(&tree);
-
-	assert_true(tree_empty(&tree), "Tree should be empty");
-	assert_ptr_null(tree_first(&tree), "Unexpected node");
-	assert_ptr_null(tree_last(&tree), "Unexpected node");
-
-	key.key = 0;
-	key.magic = NODE_MAGIC;
-	assert_ptr_null(tree_search(&tree, &key), "Unexpected node");
-
-	key.key = 0;
-	key.magic = NODE_MAGIC;
-	assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node");
-
-	key.key = 0;
-	key.magic = NODE_MAGIC;
-	assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node");
-}
-TEST_END
-
-static unsigned
-tree_recurse(node_t *node, unsigned black_height, unsigned black_depth) {
-	unsigned ret = 0;
-	node_t *left_node;
-	node_t *right_node;
-
-	if (node == NULL) {
-		return ret;
-	}
-
-	left_node = rbtn_left_get(node_t, link, node);
-	right_node = rbtn_right_get(node_t, link, node);
-
-	if (!rbtn_red_get(node_t, link, node)) {
-		black_depth++;
-	}
-
-	/* Red nodes must be interleaved with black nodes. */
-	if (rbtn_red_get(node_t, link, node)) {
-		if (left_node != NULL) {
-			assert_false(rbtn_red_get(node_t, link, left_node),
-				"Node should be black");
-		}
-		if (right_node != NULL) {
-			assert_false(rbtn_red_get(node_t, link, right_node),
-			    "Node should be black");
-		}
-	}
-
-	/* Self. */
-	assert_u32_eq(node->magic, NODE_MAGIC, "Bad magic");
-
-	/* Left subtree. */
-	if (left_node != NULL) {
-		ret += tree_recurse(left_node, black_height, black_depth);
-	} else {
-		ret += (black_depth != black_height);
-	}
-
-	/* Right subtree. */
-	if (right_node != NULL) {
-		ret += tree_recurse(right_node, black_height, black_depth);
-	} else {
-		ret += (black_depth != black_height);
-	}
-
-	return ret;
-}
-
-static node_t *
-tree_iterate_cb(tree_t *tree, node_t *node, void *data) {
-	unsigned *i = (unsigned *)data;
-	node_t *search_node;
-
-	assert_u32_eq(node->magic, NODE_MAGIC, "Bad magic");
-
-	/* Test rb_search(). */
-	search_node = tree_search(tree, node);
-	assert_ptr_eq(search_node, node,
-	    "tree_search() returned unexpected node");
-
-	/* Test rb_nsearch(). */
-	search_node = tree_nsearch(tree, node);
-	assert_ptr_eq(search_node, node,
-	    "tree_nsearch() returned unexpected node");
-
-	/* Test rb_psearch(). */
-	search_node = tree_psearch(tree, node);
-	assert_ptr_eq(search_node, node,
-	    "tree_psearch() returned unexpected node");
-
-	(*i)++;
-
-	return NULL;
-}
-
-static unsigned
-tree_iterate(tree_t *tree) {
-	unsigned i;
-
-	i = 0;
-	tree_iter(tree, NULL, tree_iterate_cb, (void *)&i);
-
-	return i;
-}
-
-static unsigned
-tree_iterate_reverse(tree_t *tree) {
-	unsigned i;
-
-	i = 0;
-	tree_reverse_iter(tree, NULL, tree_iterate_cb, (void *)&i);
-
-	return i;
-}
-
-static void
-node_remove(tree_t *tree, node_t *node, unsigned nnodes) {
-	node_t *search_node;
-	unsigned black_height, imbalances;
-
-	tree_remove(tree, node);
-
-	/* Test rb_nsearch(). */
-	search_node = tree_nsearch(tree, node);
-	if (search_node != NULL) {
-		assert_u64_ge(search_node->key, node->key,
-		    "Key ordering error");
-	}
-
-	/* Test rb_psearch(). */
-	search_node = tree_psearch(tree, node);
-	if (search_node != NULL) {
-		assert_u64_le(search_node->key, node->key,
-		    "Key ordering error");
-	}
-
-	node->magic = 0;
-
-	rbtn_black_height(node_t, link, tree, black_height);
-	imbalances = tree_recurse(tree->rbt_root, black_height, 0);
-	assert_u_eq(imbalances, 0, "Tree is unbalanced");
-	assert_u_eq(tree_iterate(tree), nnodes-1,
-	    "Unexpected node iteration count");
-	assert_u_eq(tree_iterate_reverse(tree), nnodes-1,
-	    "Unexpected node iteration count");
-}
-
-static node_t *
-remove_iterate_cb(tree_t *tree, node_t *node, void *data) {
-	unsigned *nnodes = (unsigned *)data;
-	node_t *ret = tree_next(tree, node);
-
-	node_remove(tree, node, *nnodes);
-
-	return ret;
-}
-
-static node_t *
-remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) {
-	unsigned *nnodes = (unsigned *)data;
-	node_t *ret = tree_prev(tree, node);
-
-	node_remove(tree, node, *nnodes);
-
-	return ret;
-}
-
-static void
-destroy_cb(node_t *node, void *data) {
-	unsigned *nnodes = (unsigned *)data;
-
-	assert_u_gt(*nnodes, 0, "Destruction removed too many nodes");
-	(*nnodes)--;
-}
-
-TEST_BEGIN(test_rb_random) {
-#define NNODES 25
-#define NBAGS 250
-#define SEED 42
-	sfmt_t *sfmt;
-	uint64_t bag[NNODES];
-	tree_t tree;
-	node_t nodes[NNODES];
-	unsigned i, j, k, black_height, imbalances;
-
-	sfmt = init_gen_rand(SEED);
-	for (i = 0; i < NBAGS; i++) {
-		switch (i) {
-		case 0:
-			/* Insert in order. */
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = j;
-			}
-			break;
-		case 1:
-			/* Insert in reverse order. */
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = NNODES - j - 1;
-			}
-			break;
-		default:
-			for (j = 0; j < NNODES; j++) {
-				bag[j] = gen_rand64_range(sfmt, NNODES);
-			}
-		}
-
-		for (j = 1; j <= NNODES; j++) {
-			/* Initialize tree and nodes. */
-			tree_new(&tree);
-			for (k = 0; k < j; k++) {
-				nodes[k].magic = NODE_MAGIC;
-				nodes[k].key = bag[k];
-			}
-
-			/* Insert nodes. */
-			for (k = 0; k < j; k++) {
-				tree_insert(&tree, &nodes[k]);
-
-				rbtn_black_height(node_t, link, &tree,
-				    black_height);
-				imbalances = tree_recurse(tree.rbt_root,
-				    black_height, 0);
-				assert_u_eq(imbalances, 0,
-				    "Tree is unbalanced");
-
-				assert_u_eq(tree_iterate(&tree), k+1,
-				    "Unexpected node iteration count");
-				assert_u_eq(tree_iterate_reverse(&tree), k+1,
-				    "Unexpected node iteration count");
-
-				assert_false(tree_empty(&tree),
-				    "Tree should not be empty");
-				assert_ptr_not_null(tree_first(&tree),
-				    "Tree should not be empty");
-				assert_ptr_not_null(tree_last(&tree),
-				    "Tree should not be empty");
-
-				tree_next(&tree, &nodes[k]);
-				tree_prev(&tree, &nodes[k]);
-			}
-
-			/* Remove nodes. */
-			switch (i % 5) {
-			case 0:
-				for (k = 0; k < j; k++) {
-					node_remove(&tree, &nodes[k], j - k);
-				}
-				break;
-			case 1:
-				for (k = j; k > 0; k--) {
-					node_remove(&tree, &nodes[k-1], k);
-				}
-				break;
-			case 2: {
-				node_t *start;
-				unsigned nnodes = j;
-
-				start = NULL;
-				do {
-					start = tree_iter(&tree, start,
-					    remove_iterate_cb, (void *)&nnodes);
-					nnodes--;
-				} while (start != NULL);
-				assert_u_eq(nnodes, 0,
-				    "Removal terminated early");
-				break;
-			} case 3: {
-				node_t *start;
-				unsigned nnodes = j;
-
-				start = NULL;
-				do {
-					start = tree_reverse_iter(&tree, start,
-					    remove_reverse_iterate_cb,
-					    (void *)&nnodes);
-					nnodes--;
-				} while (start != NULL);
-				assert_u_eq(nnodes, 0,
-				    "Removal terminated early");
-				break;
-			} case 4: {
-				unsigned nnodes = j;
-				tree_destroy(&tree, destroy_cb, &nnodes);
-				assert_u_eq(nnodes, 0,
-				    "Destruction terminated early");
-				break;
-			} default:
-				not_reached();
-			}
-		}
-	}
-	fini_gen_rand(sfmt);
-#undef NNODES
-#undef NBAGS
-#undef SEED
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_rb_empty,
-	    test_rb_random);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/retained.c b/redis-stable/deps/jemalloc/test/unit/retained.c
deleted file mode 100644
index d51a5981..00000000
--- a/redis-stable/deps/jemalloc/test/unit/retained.c
+++ /dev/null
@@ -1,181 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/spin.h"
-
-static unsigned		arena_ind;
-static size_t		sz;
-static size_t		esz;
-#define NEPOCHS		8
-#define PER_THD_NALLOCS	1
-static atomic_u_t	epoch;
-static atomic_u_t	nfinished;
-
-static unsigned
-do_arena_create(extent_hooks_t *h) {
-	unsigned arena_ind;
-	size_t sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz,
-	    (void *)(h != NULL ? &h : NULL), (h != NULL ? sizeof(h) : 0)), 0,
-	    "Unexpected mallctl() failure");
-	return arena_ind;
-}
-
-static void
-do_arena_destroy(unsigned arena_ind) {
-	size_t mib[3];
-	size_t miblen;
-
-	miblen = sizeof(mib)/sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arena.0.destroy", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() failure");
-	mib[1] = (size_t)arena_ind;
-	assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctlbymib() failure");
-}
-
-static void
-do_refresh(void) {
-	uint64_t epoch = 1;
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch,
-	    sizeof(epoch)), 0, "Unexpected mallctl() failure");
-}
-
-static size_t
-do_get_size_impl(const char *cmd, unsigned arena_ind) {
-	size_t mib[4];
-	size_t miblen = sizeof(mib) / sizeof(size_t);
-	size_t z = sizeof(size_t);
-
-	assert_d_eq(mallctlnametomib(cmd, mib, &miblen),
-	    0, "Unexpected mallctlnametomib(\"%s\", ...) failure", cmd);
-	mib[2] = arena_ind;
-	size_t size;
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&size, &z, NULL, 0),
-	    0, "Unexpected mallctlbymib([\"%s\"], ...) failure", cmd);
-
-	return size;
-}
-
-static size_t
-do_get_active(unsigned arena_ind) {
-	return do_get_size_impl("stats.arenas.0.pactive", arena_ind) * PAGE;
-}
-
-static size_t
-do_get_mapped(unsigned arena_ind) {
-	return do_get_size_impl("stats.arenas.0.mapped", arena_ind);
-}
-
-static void *
-thd_start(void *arg) {
-	for (unsigned next_epoch = 1; next_epoch < NEPOCHS; next_epoch++) {
-		/* Busy-wait for next epoch. */
-		unsigned cur_epoch;
-		spin_t spinner = SPIN_INITIALIZER;
-		while ((cur_epoch = atomic_load_u(&epoch, ATOMIC_ACQUIRE)) !=
-		    next_epoch) {
-			spin_adaptive(&spinner);
-		}
-		assert_u_eq(cur_epoch, next_epoch, "Unexpected epoch");
-
-		/*
-		 * Allocate.  The main thread will reset the arena, so there's
-		 * no need to deallocate.
-		 */
-		for (unsigned i = 0; i < PER_THD_NALLOCS; i++) {
-			void *p = mallocx(sz, MALLOCX_ARENA(arena_ind) |
-			    MALLOCX_TCACHE_NONE
-			    );
-			assert_ptr_not_null(p,
-			    "Unexpected mallocx() failure\n");
-		}
-
-		/* Let the main thread know we've finished this iteration. */
-		atomic_fetch_add_u(&nfinished, 1, ATOMIC_RELEASE);
-	}
-
-	return NULL;
-}
-
-TEST_BEGIN(test_retained) {
-	test_skip_if(!config_stats);
-
-	arena_ind = do_arena_create(NULL);
-	sz = nallocx(HUGEPAGE, 0);
-	esz = sz + sz_large_pad;
-
-	atomic_store_u(&epoch, 0, ATOMIC_RELAXED);
-
-	unsigned nthreads = ncpus * 2;
-	VARIABLE_ARRAY(thd_t, threads, nthreads);
-	for (unsigned i = 0; i < nthreads; i++) {
-		thd_create(&threads[i], thd_start, NULL);
-	}
-
-	for (unsigned e = 1; e < NEPOCHS; e++) {
-		atomic_store_u(&nfinished, 0, ATOMIC_RELEASE);
-		atomic_store_u(&epoch, e, ATOMIC_RELEASE);
-
-		/* Wait for threads to finish allocating. */
-		spin_t spinner = SPIN_INITIALIZER;
-		while (atomic_load_u(&nfinished, ATOMIC_ACQUIRE) < nthreads) {
-			spin_adaptive(&spinner);
-		}
-
-		/*
-		 * Assert that retained is no more than the sum of size classes
-		 * that should have been used to satisfy the worker threads'
-		 * requests, discounting per growth fragmentation.
-		 */
-		do_refresh();
-
-		size_t allocated = esz * nthreads * PER_THD_NALLOCS;
-		size_t active = do_get_active(arena_ind);
-		assert_zu_le(allocated, active, "Unexpected active memory");
-		size_t mapped = do_get_mapped(arena_ind);
-		assert_zu_le(active, mapped, "Unexpected mapped memory");
-
-		arena_t *arena = arena_get(tsdn_fetch(), arena_ind, false);
-		size_t usable = 0;
-		size_t fragmented = 0;
-		for (pszind_t pind = sz_psz2ind(HUGEPAGE); pind <
-		    arena->extent_grow_next; pind++) {
-			size_t psz = sz_pind2sz(pind);
-			size_t psz_fragmented = psz % esz;
-			size_t psz_usable = psz - psz_fragmented;
-			/*
-			 * Only consider size classes that wouldn't be skipped.
-			 */
-			if (psz_usable > 0) {
-				assert_zu_lt(usable, allocated,
-				    "Excessive retained memory "
-				    "(%#zx[+%#zx] > %#zx)", usable, psz_usable,
-				    allocated);
-				fragmented += psz_fragmented;
-				usable += psz_usable;
-			}
-		}
-
-		/*
-		 * Clean up arena.  Destroying and recreating the arena
-		 * is simpler that specifying extent hooks that deallocate
-		 * (rather than retaining) during reset.
-		 */
-		do_arena_destroy(arena_ind);
-		assert_u_eq(do_arena_create(NULL), arena_ind,
-		    "Unexpected arena index");
-	}
-
-	for (unsigned i = 0; i < nthreads; i++) {
-		thd_join(threads[i], NULL);
-	}
-
-	do_arena_destroy(arena_ind);
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_retained);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/rtree.c b/redis-stable/deps/jemalloc/test/unit/rtree.c
deleted file mode 100644
index 908100fa..00000000
--- a/redis-stable/deps/jemalloc/test/unit/rtree.c
+++ /dev/null
@@ -1,227 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/rtree.h"
-
-rtree_node_alloc_t *rtree_node_alloc_orig;
-rtree_node_dalloc_t *rtree_node_dalloc_orig;
-rtree_leaf_alloc_t *rtree_leaf_alloc_orig;
-rtree_leaf_dalloc_t *rtree_leaf_dalloc_orig;
-
-/* Potentially too large to safely place on the stack. */
-rtree_t test_rtree;
-
-static rtree_node_elm_t *
-rtree_node_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
-	rtree_node_elm_t *node;
-
-	if (rtree != &test_rtree) {
-		return rtree_node_alloc_orig(tsdn, rtree, nelms);
-	}
-
-	malloc_mutex_unlock(tsdn, &rtree->init_lock);
-	node = (rtree_node_elm_t *)calloc(nelms, sizeof(rtree_node_elm_t));
-	assert_ptr_not_null(node, "Unexpected calloc() failure");
-	malloc_mutex_lock(tsdn, &rtree->init_lock);
-
-	return node;
-}
-
-static void
-rtree_node_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,
-    rtree_node_elm_t *node) {
-	if (rtree != &test_rtree) {
-		rtree_node_dalloc_orig(tsdn, rtree, node);
-		return;
-	}
-
-	free(node);
-}
-
-static rtree_leaf_elm_t *
-rtree_leaf_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
-	rtree_leaf_elm_t *leaf;
-
-	if (rtree != &test_rtree) {
-		return rtree_leaf_alloc_orig(tsdn, rtree, nelms);
-	}
-
-	malloc_mutex_unlock(tsdn, &rtree->init_lock);
-	leaf = (rtree_leaf_elm_t *)calloc(nelms, sizeof(rtree_leaf_elm_t));
-	assert_ptr_not_null(leaf, "Unexpected calloc() failure");
-	malloc_mutex_lock(tsdn, &rtree->init_lock);
-
-	return leaf;
-}
-
-static void
-rtree_leaf_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,
-    rtree_leaf_elm_t *leaf) {
-	if (rtree != &test_rtree) {
-		rtree_leaf_dalloc_orig(tsdn, rtree, leaf);
-		return;
-	}
-
-	free(leaf);
-}
-
-TEST_BEGIN(test_rtree_read_empty) {
-	tsdn_t *tsdn;
-
-	tsdn = tsdn_fetch();
-
-	rtree_t *rtree = &test_rtree;
-	rtree_ctx_t rtree_ctx;
-	rtree_ctx_data_init(&rtree_ctx);
-	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
-	assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE,
-	    false), "rtree_extent_read() should return NULL for empty tree");
-	rtree_delete(tsdn, rtree);
-}
-TEST_END
-
-#undef NTHREADS
-#undef NITERS
-#undef SEED
-
-TEST_BEGIN(test_rtree_extrema) {
-	extent_t extent_a, extent_b;
-	extent_init(&extent_a, NULL, NULL, LARGE_MINCLASS, false,
-	    sz_size2index(LARGE_MINCLASS), 0, extent_state_active, false,
-	    false, true);
-	extent_init(&extent_b, NULL, NULL, 0, false, NSIZES, 0,
-	    extent_state_active, false, false, true);
-
-	tsdn_t *tsdn = tsdn_fetch();
-
-	rtree_t *rtree = &test_rtree;
-	rtree_ctx_t rtree_ctx;
-	rtree_ctx_data_init(&rtree_ctx);
-	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
-
-	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, &extent_a,
-	    extent_szind_get(&extent_a), extent_slab_get(&extent_a)),
-	    "Unexpected rtree_write() failure");
-	rtree_szind_slab_update(tsdn, rtree, &rtree_ctx, PAGE,
-	    extent_szind_get(&extent_a), extent_slab_get(&extent_a));
-	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE, true),
-	    &extent_a,
-	    "rtree_extent_read() should return previously set value");
-
-	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, ~((uintptr_t)0),
-	    &extent_b, extent_szind_get_maybe_invalid(&extent_b),
-	    extent_slab_get(&extent_b)), "Unexpected rtree_write() failure");
-	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-	    ~((uintptr_t)0), true), &extent_b,
-	    "rtree_extent_read() should return previously set value");
-
-	rtree_delete(tsdn, rtree);
-}
-TEST_END
-
-TEST_BEGIN(test_rtree_bits) {
-	tsdn_t *tsdn = tsdn_fetch();
-
-	uintptr_t keys[] = {PAGE, PAGE + 1,
-	    PAGE + (((uintptr_t)1) << LG_PAGE) - 1};
-
-	extent_t extent;
-	extent_init(&extent, NULL, NULL, 0, false, NSIZES, 0,
-	    extent_state_active, false, false, true);
-
-	rtree_t *rtree = &test_rtree;
-	rtree_ctx_t rtree_ctx;
-	rtree_ctx_data_init(&rtree_ctx);
-	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
-
-	for (unsigned i = 0; i < sizeof(keys)/sizeof(uintptr_t); i++) {
-		assert_false(rtree_write(tsdn, rtree, &rtree_ctx, keys[i],
-		    &extent, NSIZES, false),
-		    "Unexpected rtree_write() failure");
-		for (unsigned j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) {
-			assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-			    keys[j], true), &extent,
-			    "rtree_extent_read() should return previously set "
-			    "value and ignore insignificant key bits; i=%u, "
-			    "j=%u, set key=%#"FMTxPTR", get key=%#"FMTxPTR, i,
-			    j, keys[i], keys[j]);
-		}
-		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-		    (((uintptr_t)2) << LG_PAGE), false),
-		    "Only leftmost rtree leaf should be set; i=%u", i);
-		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
-	}
-
-	rtree_delete(tsdn, rtree);
-}
-TEST_END
-
-TEST_BEGIN(test_rtree_random) {
-#define NSET 16
-#define SEED 42
-	sfmt_t *sfmt = init_gen_rand(SEED);
-	tsdn_t *tsdn = tsdn_fetch();
-	uintptr_t keys[NSET];
-	rtree_t *rtree = &test_rtree;
-	rtree_ctx_t rtree_ctx;
-	rtree_ctx_data_init(&rtree_ctx);
-
-	extent_t extent;
-	extent_init(&extent, NULL, NULL, 0, false, NSIZES, 0,
-	    extent_state_active, false, false, true);
-
-	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");
-
-	for (unsigned i = 0; i < NSET; i++) {
-		keys[i] = (uintptr_t)gen_rand64(sfmt);
-		rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree,
-		    &rtree_ctx, keys[i], false, true);
-		assert_ptr_not_null(elm,
-		    "Unexpected rtree_leaf_elm_lookup() failure");
-		rtree_leaf_elm_write(tsdn, rtree, elm, &extent, NSIZES, false);
-		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-		    keys[i], true), &extent,
-		    "rtree_extent_read() should return previously set value");
-	}
-	for (unsigned i = 0; i < NSET; i++) {
-		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-		    keys[i], true), &extent,
-		    "rtree_extent_read() should return previously set value, "
-		    "i=%u", i);
-	}
-
-	for (unsigned i = 0; i < NSET; i++) {
-		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
-		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-		    keys[i], true),
-		   "rtree_extent_read() should return previously set value");
-	}
-	for (unsigned i = 0; i < NSET; i++) {
-		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,
-		    keys[i], true),
-		    "rtree_extent_read() should return previously set value");
-	}
-
-	rtree_delete(tsdn, rtree);
-	fini_gen_rand(sfmt);
-#undef NSET
-#undef SEED
-}
-TEST_END
-
-int
-main(void) {
-	rtree_node_alloc_orig = rtree_node_alloc;
-	rtree_node_alloc = rtree_node_alloc_intercept;
-	rtree_node_dalloc_orig = rtree_node_dalloc;
-	rtree_node_dalloc = rtree_node_dalloc_intercept;
-	rtree_leaf_alloc_orig = rtree_leaf_alloc;
-	rtree_leaf_alloc = rtree_leaf_alloc_intercept;
-	rtree_leaf_dalloc_orig = rtree_leaf_dalloc;
-	rtree_leaf_dalloc = rtree_leaf_dalloc_intercept;
-
-	return test(
-	    test_rtree_read_empty,
-	    test_rtree_extrema,
-	    test_rtree_bits,
-	    test_rtree_random);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/size_classes.c b/redis-stable/deps/jemalloc/test/unit/size_classes.c
deleted file mode 100644
index bcff5609..00000000
--- a/redis-stable/deps/jemalloc/test/unit/size_classes.c
+++ /dev/null
@@ -1,183 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static size_t
-get_max_size_class(void) {
-	unsigned nlextents;
-	size_t mib[4];
-	size_t sz, miblen, max_size_class;
-
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.nlextents", (void *)&nlextents, &sz, NULL,
-	    0), 0, "Unexpected mallctl() error");
-
-	miblen = sizeof(mib) / sizeof(size_t);
-	assert_d_eq(mallctlnametomib("arenas.lextent.0.size", mib, &miblen), 0,
-	    "Unexpected mallctlnametomib() error");
-	mib[2] = nlextents - 1;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctlbymib(mib, miblen, (void *)&max_size_class, &sz,
-	    NULL, 0), 0, "Unexpected mallctlbymib() error");
-
-	return max_size_class;
-}
-
-TEST_BEGIN(test_size_classes) {
-	size_t size_class, max_size_class;
-	szind_t index, max_index;
-
-	max_size_class = get_max_size_class();
-	max_index = sz_size2index(max_size_class);
-
-	for (index = 0, size_class = sz_index2size(index); index < max_index ||
-	    size_class < max_size_class; index++, size_class =
-	    sz_index2size(index)) {
-		assert_true(index < max_index,
-		    "Loop conditionals should be equivalent; index=%u, "
-		    "size_class=%zu (%#zx)", index, size_class, size_class);
-		assert_true(size_class < max_size_class,
-		    "Loop conditionals should be equivalent; index=%u, "
-		    "size_class=%zu (%#zx)", index, size_class, size_class);
-
-		assert_u_eq(index, sz_size2index(size_class),
-		    "sz_size2index() does not reverse sz_index2size(): index=%u"
-		    " --> size_class=%zu --> index=%u --> size_class=%zu",
-		    index, size_class, sz_size2index(size_class),
-		    sz_index2size(sz_size2index(size_class)));
-		assert_zu_eq(size_class,
-		    sz_index2size(sz_size2index(size_class)),
-		    "sz_index2size() does not reverse sz_size2index(): index=%u"
-		    " --> size_class=%zu --> index=%u --> size_class=%zu",
-		    index, size_class, sz_size2index(size_class),
-		    sz_index2size(sz_size2index(size_class)));
-
-		assert_u_eq(index+1, sz_size2index(size_class+1),
-		    "Next size_class does not round up properly");
-
-		assert_zu_eq(size_class, (index > 0) ?
-		    sz_s2u(sz_index2size(index-1)+1) : sz_s2u(1),
-		    "sz_s2u() does not round up to size class");
-		assert_zu_eq(size_class, sz_s2u(size_class-1),
-		    "sz_s2u() does not round up to size class");
-		assert_zu_eq(size_class, sz_s2u(size_class),
-		    "sz_s2u() does not compute same size class");
-		assert_zu_eq(sz_s2u(size_class+1), sz_index2size(index+1),
-		    "sz_s2u() does not round up to next size class");
-	}
-
-	assert_u_eq(index, sz_size2index(sz_index2size(index)),
-	    "sz_size2index() does not reverse sz_index2size()");
-	assert_zu_eq(max_size_class, sz_index2size(
-	    sz_size2index(max_size_class)),
-	    "sz_index2size() does not reverse sz_size2index()");
-
-	assert_zu_eq(size_class, sz_s2u(sz_index2size(index-1)+1),
-	    "sz_s2u() does not round up to size class");
-	assert_zu_eq(size_class, sz_s2u(size_class-1),
-	    "sz_s2u() does not round up to size class");
-	assert_zu_eq(size_class, sz_s2u(size_class),
-	    "sz_s2u() does not compute same size class");
-}
-TEST_END
-
-TEST_BEGIN(test_psize_classes) {
-	size_t size_class, max_psz;
-	pszind_t pind, max_pind;
-
-	max_psz = get_max_size_class() + PAGE;
-	max_pind = sz_psz2ind(max_psz);
-
-	for (pind = 0, size_class = sz_pind2sz(pind);
-	    pind < max_pind || size_class < max_psz;
-	    pind++, size_class = sz_pind2sz(pind)) {
-		assert_true(pind < max_pind,
-		    "Loop conditionals should be equivalent; pind=%u, "
-		    "size_class=%zu (%#zx)", pind, size_class, size_class);
-		assert_true(size_class < max_psz,
-		    "Loop conditionals should be equivalent; pind=%u, "
-		    "size_class=%zu (%#zx)", pind, size_class, size_class);
-
-		assert_u_eq(pind, sz_psz2ind(size_class),
-		    "sz_psz2ind() does not reverse sz_pind2sz(): pind=%u -->"
-		    " size_class=%zu --> pind=%u --> size_class=%zu", pind,
-		    size_class, sz_psz2ind(size_class),
-		    sz_pind2sz(sz_psz2ind(size_class)));
-		assert_zu_eq(size_class, sz_pind2sz(sz_psz2ind(size_class)),
-		    "sz_pind2sz() does not reverse sz_psz2ind(): pind=%u -->"
-		    " size_class=%zu --> pind=%u --> size_class=%zu", pind,
-		    size_class, sz_psz2ind(size_class),
-		    sz_pind2sz(sz_psz2ind(size_class)));
-
-		assert_u_eq(pind+1, sz_psz2ind(size_class+1),
-		    "Next size_class does not round up properly");
-
-		assert_zu_eq(size_class, (pind > 0) ?
-		    sz_psz2u(sz_pind2sz(pind-1)+1) : sz_psz2u(1),
-		    "sz_psz2u() does not round up to size class");
-		assert_zu_eq(size_class, sz_psz2u(size_class-1),
-		    "sz_psz2u() does not round up to size class");
-		assert_zu_eq(size_class, sz_psz2u(size_class),
-		    "sz_psz2u() does not compute same size class");
-		assert_zu_eq(sz_psz2u(size_class+1), sz_pind2sz(pind+1),
-		    "sz_psz2u() does not round up to next size class");
-	}
-
-	assert_u_eq(pind, sz_psz2ind(sz_pind2sz(pind)),
-	    "sz_psz2ind() does not reverse sz_pind2sz()");
-	assert_zu_eq(max_psz, sz_pind2sz(sz_psz2ind(max_psz)),
-	    "sz_pind2sz() does not reverse sz_psz2ind()");
-
-	assert_zu_eq(size_class, sz_psz2u(sz_pind2sz(pind-1)+1),
-	    "sz_psz2u() does not round up to size class");
-	assert_zu_eq(size_class, sz_psz2u(size_class-1),
-	    "sz_psz2u() does not round up to size class");
-	assert_zu_eq(size_class, sz_psz2u(size_class),
-	    "sz_psz2u() does not compute same size class");
-}
-TEST_END
-
-TEST_BEGIN(test_overflow) {
-	size_t max_size_class, max_psz;
-
-	max_size_class = get_max_size_class();
-	max_psz = max_size_class + PAGE;
-
-	assert_u_eq(sz_size2index(max_size_class+1), NSIZES,
-	    "sz_size2index() should return NSIZES on overflow");
-	assert_u_eq(sz_size2index(ZU(PTRDIFF_MAX)+1), NSIZES,
-	    "sz_size2index() should return NSIZES on overflow");
-	assert_u_eq(sz_size2index(SIZE_T_MAX), NSIZES,
-	    "sz_size2index() should return NSIZES on overflow");
-
-	assert_zu_eq(sz_s2u(max_size_class+1), 0,
-	    "sz_s2u() should return 0 for unsupported size");
-	assert_zu_eq(sz_s2u(ZU(PTRDIFF_MAX)+1), 0,
-	    "sz_s2u() should return 0 for unsupported size");
-	assert_zu_eq(sz_s2u(SIZE_T_MAX), 0,
-	    "sz_s2u() should return 0 on overflow");
-
-	assert_u_eq(sz_psz2ind(max_size_class+1), NPSIZES,
-	    "sz_psz2ind() should return NPSIZES on overflow");
-	assert_u_eq(sz_psz2ind(ZU(PTRDIFF_MAX)+1), NPSIZES,
-	    "sz_psz2ind() should return NPSIZES on overflow");
-	assert_u_eq(sz_psz2ind(SIZE_T_MAX), NPSIZES,
-	    "sz_psz2ind() should return NPSIZES on overflow");
-
-	assert_zu_eq(sz_psz2u(max_size_class+1), max_psz,
-	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) for unsupported"
-	    " size");
-	assert_zu_eq(sz_psz2u(ZU(PTRDIFF_MAX)+1), max_psz,
-	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) for unsupported "
-	    "size");
-	assert_zu_eq(sz_psz2u(SIZE_T_MAX), max_psz,
-	    "sz_psz2u() should return (LARGE_MAXCLASS + PAGE) on overflow");
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_size_classes,
-	    test_psize_classes,
-	    test_overflow);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/slab.c b/redis-stable/deps/jemalloc/test/unit/slab.c
deleted file mode 100644
index 7e662aed..00000000
--- a/redis-stable/deps/jemalloc/test/unit/slab.c
+++ /dev/null
@@ -1,32 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_arena_slab_regind) {
-	szind_t binind;
-
-	for (binind = 0; binind < NBINS; binind++) {
-		size_t regind;
-		extent_t slab;
-		const bin_info_t *bin_info = &bin_infos[binind];
-		extent_init(&slab, NULL, mallocx(bin_info->slab_size,
-		    MALLOCX_LG_ALIGN(LG_PAGE)), bin_info->slab_size, true,
-		    binind, 0, extent_state_active, false, true, true);
-		assert_ptr_not_null(extent_addr_get(&slab),
-		    "Unexpected malloc() failure");
-		for (regind = 0; regind < bin_info->nregs; regind++) {
-			void *reg = (void *)((uintptr_t)extent_addr_get(&slab) +
-			    (bin_info->reg_size * regind));
-			assert_zu_eq(arena_slab_regind(&slab, binind, reg),
-			    regind,
-			    "Incorrect region index computed for size %zu",
-			    bin_info->reg_size);
-		}
-		free(extent_addr_get(&slab));
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_arena_slab_regind);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/smoothstep.c b/redis-stable/deps/jemalloc/test/unit/smoothstep.c
deleted file mode 100644
index 7c5dbb7e..00000000
--- a/redis-stable/deps/jemalloc/test/unit/smoothstep.c
+++ /dev/null
@@ -1,102 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static const uint64_t smoothstep_tab[] = {
-#define STEP(step, h, x, y)			\
-	h,
-	SMOOTHSTEP
-#undef STEP
-};
-
-TEST_BEGIN(test_smoothstep_integral) {
-	uint64_t sum, min, max;
-	unsigned i;
-
-	/*
-	 * The integral of smoothstep in the [0..1] range equals 1/2.  Verify
-	 * that the fixed point representation's integral is no more than
-	 * rounding error distant from 1/2.  Regarding rounding, each table
-	 * element is rounded down to the nearest fixed point value, so the
-	 * integral may be off by as much as SMOOTHSTEP_NSTEPS ulps.
-	 */
-	sum = 0;
-	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
-		sum += smoothstep_tab[i];
-	}
-
-	max = (KQU(1) << (SMOOTHSTEP_BFP-1)) * (SMOOTHSTEP_NSTEPS+1);
-	min = max - SMOOTHSTEP_NSTEPS;
-
-	assert_u64_ge(sum, min,
-	    "Integral too small, even accounting for truncation");
-	assert_u64_le(sum, max, "Integral exceeds 1/2");
-	if (false) {
-		malloc_printf("%"FMTu64" ulps under 1/2 (limit %d)\n",
-		    max - sum, SMOOTHSTEP_NSTEPS);
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_smoothstep_monotonic) {
-	uint64_t prev_h;
-	unsigned i;
-
-	/*
-	 * The smoothstep function is monotonic in [0..1], i.e. its slope is
-	 * non-negative.  In practice we want to parametrize table generation
-	 * such that piecewise slope is greater than zero, but do not require
-	 * that here.
-	 */
-	prev_h = 0;
-	for (i = 0; i < SMOOTHSTEP_NSTEPS; i++) {
-		uint64_t h = smoothstep_tab[i];
-		assert_u64_ge(h, prev_h, "Piecewise non-monotonic, i=%u", i);
-		prev_h = h;
-	}
-	assert_u64_eq(smoothstep_tab[SMOOTHSTEP_NSTEPS-1],
-	    (KQU(1) << SMOOTHSTEP_BFP), "Last step must equal 1");
-}
-TEST_END
-
-TEST_BEGIN(test_smoothstep_slope) {
-	uint64_t prev_h, prev_delta;
-	unsigned i;
-
-	/*
-	 * The smoothstep slope strictly increases until x=0.5, and then
-	 * strictly decreases until x=1.0.  Verify the slightly weaker
-	 * requirement of monotonicity, so that inadequate table precision does
-	 * not cause false test failures.
-	 */
-	prev_h = 0;
-	prev_delta = 0;
-	for (i = 0; i < SMOOTHSTEP_NSTEPS / 2 + SMOOTHSTEP_NSTEPS % 2; i++) {
-		uint64_t h = smoothstep_tab[i];
-		uint64_t delta = h - prev_h;
-		assert_u64_ge(delta, prev_delta,
-		    "Slope must monotonically increase in 0.0 <= x <= 0.5, "
-		    "i=%u", i);
-		prev_h = h;
-		prev_delta = delta;
-	}
-
-	prev_h = KQU(1) << SMOOTHSTEP_BFP;
-	prev_delta = 0;
-	for (i = SMOOTHSTEP_NSTEPS-1; i >= SMOOTHSTEP_NSTEPS / 2; i--) {
-		uint64_t h = smoothstep_tab[i];
-		uint64_t delta = prev_h - h;
-		assert_u64_ge(delta, prev_delta,
-		    "Slope must monotonically decrease in 0.5 <= x <= 1.0, "
-		    "i=%u", i);
-		prev_h = h;
-		prev_delta = delta;
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_smoothstep_integral,
-	    test_smoothstep_monotonic,
-	    test_smoothstep_slope);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/spin.c b/redis-stable/deps/jemalloc/test/unit/spin.c
deleted file mode 100644
index b965f742..00000000
--- a/redis-stable/deps/jemalloc/test/unit/spin.c
+++ /dev/null
@@ -1,18 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/spin.h"
-
-TEST_BEGIN(test_spin) {
-	spin_t spinner = SPIN_INITIALIZER;
-
-	for (unsigned i = 0; i < 100; i++) {
-		spin_adaptive(&spinner);
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_spin);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/stats.c b/redis-stable/deps/jemalloc/test/unit/stats.c
deleted file mode 100644
index 231010e4..00000000
--- a/redis-stable/deps/jemalloc/test/unit/stats.c
+++ /dev/null
@@ -1,368 +0,0 @@
-#include "test/jemalloc_test.h"
-
-TEST_BEGIN(test_stats_summary) {
-	size_t sz, allocated, active, resident, mapped;
-	int expected = config_stats ? 0 : ENOENT;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.allocated", (void *)&allocated, &sz, NULL,
-	    0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.active", (void *)&active, &sz, NULL, 0),
-	    expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.resident", (void *)&resident, &sz, NULL, 0),
-	    expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.mapped", (void *)&mapped, &sz, NULL, 0),
-	    expected, "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_zu_le(allocated, active,
-		    "allocated should be no larger than active");
-		assert_zu_lt(active, resident,
-		    "active should be less than resident");
-		assert_zu_lt(active, mapped,
-		    "active should be less than mapped");
-	}
-}
-TEST_END
-
-TEST_BEGIN(test_stats_large) {
-	void *p;
-	uint64_t epoch;
-	size_t allocated;
-	uint64_t nmalloc, ndalloc, nrequests;
-	size_t sz;
-	int expected = config_stats ? 0 : ENOENT;
-
-	p = mallocx(SMALL_MAXCLASS+1, MALLOCX_ARENA(0));
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.arenas.0.large.allocated",
-	    (void *)&allocated, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(uint64_t);
-	assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.large.nrequests",
-	    (void *)&nrequests, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_zu_gt(allocated, 0,
-		    "allocated should be greater than zero");
-		assert_u64_ge(nmalloc, ndalloc,
-		    "nmalloc should be at least as large as ndalloc");
-		assert_u64_le(nmalloc, nrequests,
-		    "nmalloc should no larger than nrequests");
-	}
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_stats_arenas_summary) {
-	void *little, *large;
-	uint64_t epoch;
-	size_t sz;
-	int expected = config_stats ? 0 : ENOENT;
-	size_t mapped;
-	uint64_t dirty_npurge, dirty_nmadvise, dirty_purged;
-	uint64_t muzzy_npurge, muzzy_nmadvise, muzzy_purged;
-
-	little = mallocx(SMALL_MAXCLASS, MALLOCX_ARENA(0));
-	assert_ptr_not_null(little, "Unexpected mallocx() failure");
-	large = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
-	assert_ptr_not_null(large, "Unexpected mallocx() failure");
-
-	dallocx(little, 0);
-	dallocx(large, 0);
-
-	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
-	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("arena.0.purge", NULL, NULL, NULL, 0), 0,
-	    "Unexpected mallctl() failure");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.arenas.0.mapped", (void *)&mapped, &sz, NULL,
-	    0), expected, "Unexepected mallctl() result");
-
-	sz = sizeof(uint64_t);
-	assert_d_eq(mallctl("stats.arenas.0.dirty_npurge",
-	    (void *)&dirty_npurge, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.dirty_nmadvise",
-	    (void *)&dirty_nmadvise, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.dirty_purged",
-	    (void *)&dirty_purged, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.muzzy_npurge",
-	    (void *)&muzzy_npurge, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.muzzy_nmadvise",
-	    (void *)&muzzy_nmadvise, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.muzzy_purged",
-	    (void *)&muzzy_purged, &sz, NULL, 0), expected,
-	    "Unexepected mallctl() result");
-
-	if (config_stats) {
-		if (!background_thread_enabled()) {
-			assert_u64_gt(dirty_npurge + muzzy_npurge, 0,
-			    "At least one purge should have occurred");
-		}
-		assert_u64_le(dirty_nmadvise, dirty_purged,
-		    "dirty_nmadvise should be no greater than dirty_purged");
-		assert_u64_le(muzzy_nmadvise, muzzy_purged,
-		    "muzzy_nmadvise should be no greater than muzzy_purged");
-	}
-}
-TEST_END
-
-void *
-thd_start(void *arg) {
-	return NULL;
-}
-
-static void
-no_lazy_lock(void) {
-	thd_t thd;
-
-	thd_create(&thd, thd_start, NULL);
-	thd_join(thd, NULL);
-}
-
-TEST_BEGIN(test_stats_arenas_small) {
-	void *p;
-	size_t sz, allocated;
-	uint64_t epoch, nmalloc, ndalloc, nrequests;
-	int expected = config_stats ? 0 : ENOENT;
-
-	no_lazy_lock(); /* Lazy locking would dodge tcache testing. */
-
-	p = mallocx(SMALL_MAXCLASS, MALLOCX_ARENA(0));
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
-	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.arenas.0.small.allocated",
-	    (void *)&allocated, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(uint64_t);
-	assert_d_eq(mallctl("stats.arenas.0.small.nmalloc", (void *)&nmalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.small.ndalloc", (void *)&ndalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.small.nrequests",
-	    (void *)&nrequests, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_zu_gt(allocated, 0,
-		    "allocated should be greater than zero");
-		assert_u64_gt(nmalloc, 0,
-		    "nmalloc should be no greater than zero");
-		assert_u64_ge(nmalloc, ndalloc,
-		    "nmalloc should be at least as large as ndalloc");
-		assert_u64_gt(nrequests, 0,
-		    "nrequests should be greater than zero");
-	}
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_stats_arenas_large) {
-	void *p;
-	size_t sz, allocated;
-	uint64_t epoch, nmalloc, ndalloc;
-	int expected = config_stats ? 0 : ENOENT;
-
-	p = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.arenas.0.large.allocated",
-	    (void *)&allocated, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(uint64_t);
-	assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
-	    &sz, NULL, 0), expected, "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_zu_gt(allocated, 0,
-		    "allocated should be greater than zero");
-		assert_u64_gt(nmalloc, 0,
-		    "nmalloc should be greater than zero");
-		assert_u64_ge(nmalloc, ndalloc,
-		    "nmalloc should be at least as large as ndalloc");
-	}
-
-	dallocx(p, 0);
-}
-TEST_END
-
-static void
-gen_mallctl_str(char *cmd, char *name, unsigned arena_ind) {
-	sprintf(cmd, "stats.arenas.%u.bins.0.%s", arena_ind, name);
-}
-
-TEST_BEGIN(test_stats_arenas_bins) {
-	void *p;
-	size_t sz, curslabs, curregs;
-	uint64_t epoch, nmalloc, ndalloc, nrequests, nfills, nflushes;
-	uint64_t nslabs, nreslabs;
-	int expected = config_stats ? 0 : ENOENT;
-
-	/* Make sure allocation below isn't satisfied by tcache. */
-	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
-	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
-
-	unsigned arena_ind, old_arena_ind;
-	sz = sizeof(unsigned);
-	assert_d_eq(mallctl("arenas.create", (void *)&arena_ind, &sz, NULL, 0),
-	    0, "Arena creation failure");
-	sz = sizeof(arena_ind);
-	assert_d_eq(mallctl("thread.arena", (void *)&old_arena_ind, &sz,
-	    (void *)&arena_ind, sizeof(arena_ind)), 0,
-	    "Unexpected mallctl() failure");
-
-	p = malloc(bin_infos[0].reg_size);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-
-	assert_d_eq(mallctl("thread.tcache.flush", NULL, NULL, NULL, 0),
-	    opt_tcache ? 0 : EFAULT, "Unexpected mallctl() result");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	char cmd[128];
-	sz = sizeof(uint64_t);
-	gen_mallctl_str(cmd, "nmalloc", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nmalloc, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	gen_mallctl_str(cmd, "ndalloc", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&ndalloc, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	gen_mallctl_str(cmd, "nrequests", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nrequests, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(size_t);
-	gen_mallctl_str(cmd, "curregs", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&curregs, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	sz = sizeof(uint64_t);
-	gen_mallctl_str(cmd, "nfills", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nfills, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	gen_mallctl_str(cmd, "nflushes", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nflushes, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	gen_mallctl_str(cmd, "nslabs", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nslabs, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	gen_mallctl_str(cmd, "nreslabs", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&nreslabs, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(size_t);
-	gen_mallctl_str(cmd, "curslabs", arena_ind);
-	assert_d_eq(mallctl(cmd, (void *)&curslabs, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_u64_gt(nmalloc, 0,
-		    "nmalloc should be greater than zero");
-		assert_u64_ge(nmalloc, ndalloc,
-		    "nmalloc should be at least as large as ndalloc");
-		assert_u64_gt(nrequests, 0,
-		    "nrequests should be greater than zero");
-		assert_zu_gt(curregs, 0,
-		    "allocated should be greater than zero");
-		if (opt_tcache) {
-			assert_u64_gt(nfills, 0,
-			    "At least one fill should have occurred");
-			assert_u64_gt(nflushes, 0,
-			    "At least one flush should have occurred");
-		}
-		assert_u64_gt(nslabs, 0,
-		    "At least one slab should have been allocated");
-		assert_zu_gt(curslabs, 0,
-		    "At least one slab should be currently allocated");
-	}
-
-	dallocx(p, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_stats_arenas_lextents) {
-	void *p;
-	uint64_t epoch, nmalloc, ndalloc;
-	size_t curlextents, sz, hsize;
-	int expected = config_stats ? 0 : ENOENT;
-
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&hsize, &sz, NULL,
-	    0), 0, "Unexpected mallctl() failure");
-
-	p = mallocx(hsize, MALLOCX_ARENA(0));
-	assert_ptr_not_null(p, "Unexpected mallocx() failure");
-
-	assert_d_eq(mallctl("epoch", NULL, NULL, (void *)&epoch, sizeof(epoch)),
-	    0, "Unexpected mallctl() failure");
-
-	sz = sizeof(uint64_t);
-	assert_d_eq(mallctl("stats.arenas.0.lextents.0.nmalloc",
-	    (void *)&nmalloc, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	assert_d_eq(mallctl("stats.arenas.0.lextents.0.ndalloc",
-	    (void *)&ndalloc, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-	sz = sizeof(size_t);
-	assert_d_eq(mallctl("stats.arenas.0.lextents.0.curlextents",
-	    (void *)&curlextents, &sz, NULL, 0), expected,
-	    "Unexpected mallctl() result");
-
-	if (config_stats) {
-		assert_u64_gt(nmalloc, 0,
-		    "nmalloc should be greater than zero");
-		assert_u64_ge(nmalloc, ndalloc,
-		    "nmalloc should be at least as large as ndalloc");
-		assert_u64_gt(curlextents, 0,
-		    "At least one extent should be currently allocated");
-	}
-
-	dallocx(p, 0);
-}
-TEST_END
-
-int
-main(void) {
-	return test_no_reentrancy(
-	    test_stats_summary,
-	    test_stats_large,
-	    test_stats_arenas_summary,
-	    test_stats_arenas_small,
-	    test_stats_arenas_large,
-	    test_stats_arenas_bins,
-	    test_stats_arenas_lextents);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/stats_print.c b/redis-stable/deps/jemalloc/test/unit/stats_print.c
deleted file mode 100644
index 014d002f..00000000
--- a/redis-stable/deps/jemalloc/test/unit/stats_print.c
+++ /dev/null
@@ -1,999 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/util.h"
-
-typedef enum {
-	TOKEN_TYPE_NONE,
-	TOKEN_TYPE_ERROR,
-	TOKEN_TYPE_EOI,
-	TOKEN_TYPE_NULL,
-	TOKEN_TYPE_FALSE,
-	TOKEN_TYPE_TRUE,
-	TOKEN_TYPE_LBRACKET,
-	TOKEN_TYPE_RBRACKET,
-	TOKEN_TYPE_LBRACE,
-	TOKEN_TYPE_RBRACE,
-	TOKEN_TYPE_COLON,
-	TOKEN_TYPE_COMMA,
-	TOKEN_TYPE_STRING,
-	TOKEN_TYPE_NUMBER
-} token_type_t;
-
-typedef struct parser_s parser_t;
-typedef struct {
-	parser_t	*parser;
-	token_type_t	token_type;
-	size_t		pos;
-	size_t		len;
-	size_t		line;
-	size_t		col;
-} token_t;
-
-struct parser_s {
-	bool verbose;
-	char	*buf; /* '\0'-terminated. */
-	size_t	len; /* Number of characters preceding '\0' in buf. */
-	size_t	pos;
-	size_t	line;
-	size_t	col;
-	token_t	token;
-};
-
-static void
-token_init(token_t *token, parser_t *parser, token_type_t token_type,
-    size_t pos, size_t len, size_t line, size_t col) {
-	token->parser = parser;
-	token->token_type = token_type;
-	token->pos = pos;
-	token->len = len;
-	token->line = line;
-	token->col = col;
-}
-
-static void
-token_error(token_t *token) {
-	if (!token->parser->verbose) {
-		return;
-	}
-	switch (token->token_type) {
-	case TOKEN_TYPE_NONE:
-		not_reached();
-	case TOKEN_TYPE_ERROR:
-		malloc_printf("%zu:%zu: Unexpected character in token: ",
-		    token->line, token->col);
-		break;
-	default:
-		malloc_printf("%zu:%zu: Unexpected token: ", token->line,
-		    token->col);
-		break;
-	}
-	UNUSED ssize_t err = malloc_write_fd(STDERR_FILENO,
-	    &token->parser->buf[token->pos], token->len);
-	malloc_printf("\n");
-}
-
-static void
-parser_init(parser_t *parser, bool verbose) {
-	parser->verbose = verbose;
-	parser->buf = NULL;
-	parser->len = 0;
-	parser->pos = 0;
-	parser->line = 1;
-	parser->col = 0;
-}
-
-static void
-parser_fini(parser_t *parser) {
-	if (parser->buf != NULL) {
-		dallocx(parser->buf, MALLOCX_TCACHE_NONE);
-	}
-}
-
-static bool
-parser_append(parser_t *parser, const char *str) {
-	size_t len = strlen(str);
-	char *buf = (parser->buf == NULL) ? mallocx(len + 1,
-	    MALLOCX_TCACHE_NONE) : rallocx(parser->buf, parser->len + len + 1,
-	    MALLOCX_TCACHE_NONE);
-	if (buf == NULL) {
-		return true;
-	}
-	memcpy(&buf[parser->len], str, len + 1);
-	parser->buf = buf;
-	parser->len += len;
-	return false;
-}
-
-static bool
-parser_tokenize(parser_t *parser) {
-	enum {
-		STATE_START,
-		STATE_EOI,
-		STATE_N, STATE_NU, STATE_NUL, STATE_NULL,
-		STATE_F, STATE_FA, STATE_FAL, STATE_FALS, STATE_FALSE,
-		STATE_T, STATE_TR, STATE_TRU, STATE_TRUE,
-		STATE_LBRACKET,
-		STATE_RBRACKET,
-		STATE_LBRACE,
-		STATE_RBRACE,
-		STATE_COLON,
-		STATE_COMMA,
-		STATE_CHARS,
-		STATE_CHAR_ESCAPE,
-		STATE_CHAR_U, STATE_CHAR_UD, STATE_CHAR_UDD, STATE_CHAR_UDDD,
-		STATE_STRING,
-		STATE_MINUS,
-		STATE_LEADING_ZERO,
-		STATE_DIGITS,
-		STATE_DECIMAL,
-		STATE_FRAC_DIGITS,
-		STATE_EXP,
-		STATE_EXP_SIGN,
-		STATE_EXP_DIGITS,
-		STATE_ACCEPT
-	} state = STATE_START;
-	size_t token_pos JEMALLOC_CC_SILENCE_INIT(0);
-	size_t token_line JEMALLOC_CC_SILENCE_INIT(1);
-	size_t token_col JEMALLOC_CC_SILENCE_INIT(0);
-
-	assert_zu_le(parser->pos, parser->len,
-	    "Position is past end of buffer");
-
-	while (state != STATE_ACCEPT) {
-		char c = parser->buf[parser->pos];
-
-		switch (state) {
-		case STATE_START:
-			token_pos = parser->pos;
-			token_line = parser->line;
-			token_col = parser->col;
-			switch (c) {
-			case ' ': case '\b': case '\n': case '\r': case '\t':
-				break;
-			case '\0':
-				state = STATE_EOI;
-				break;
-			case 'n':
-				state = STATE_N;
-				break;
-			case 'f':
-				state = STATE_F;
-				break;
-			case 't':
-				state = STATE_T;
-				break;
-			case '[':
-				state = STATE_LBRACKET;
-				break;
-			case ']':
-				state = STATE_RBRACKET;
-				break;
-			case '{':
-				state = STATE_LBRACE;
-				break;
-			case '}':
-				state = STATE_RBRACE;
-				break;
-			case ':':
-				state = STATE_COLON;
-				break;
-			case ',':
-				state = STATE_COMMA;
-				break;
-			case '"':
-				state = STATE_CHARS;
-				break;
-			case '-':
-				state = STATE_MINUS;
-				break;
-			case '0':
-				state = STATE_LEADING_ZERO;
-				break;
-			case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				state = STATE_DIGITS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_EOI:
-			token_init(&parser->token, parser,
-			    TOKEN_TYPE_EOI, token_pos, parser->pos -
-			    token_pos, token_line, token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_N:
-			switch (c) {
-			case 'u':
-				state = STATE_NU;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_NU:
-			switch (c) {
-			case 'l':
-				state = STATE_NUL;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_NUL:
-			switch (c) {
-			case 'l':
-				state = STATE_NULL;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_NULL:
-			switch (c) {
-			case ' ': case '\b': case '\n': case '\r': case '\t':
-			case '\0':
-			case '[': case ']': case '{': case '}': case ':':
-			case ',':
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			token_init(&parser->token, parser, TOKEN_TYPE_NULL,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_F:
-			switch (c) {
-			case 'a':
-				state = STATE_FA;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_FA:
-			switch (c) {
-			case 'l':
-				state = STATE_FAL;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_FAL:
-			switch (c) {
-			case 's':
-				state = STATE_FALS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_FALS:
-			switch (c) {
-			case 'e':
-				state = STATE_FALSE;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_FALSE:
-			switch (c) {
-			case ' ': case '\b': case '\n': case '\r': case '\t':
-			case '\0':
-			case '[': case ']': case '{': case '}': case ':':
-			case ',':
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			token_init(&parser->token, parser,
-			    TOKEN_TYPE_FALSE, token_pos, parser->pos -
-			    token_pos, token_line, token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_T:
-			switch (c) {
-			case 'r':
-				state = STATE_TR;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_TR:
-			switch (c) {
-			case 'u':
-				state = STATE_TRU;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_TRU:
-			switch (c) {
-			case 'e':
-				state = STATE_TRUE;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_TRUE:
-			switch (c) {
-			case ' ': case '\b': case '\n': case '\r': case '\t':
-			case '\0':
-			case '[': case ']': case '{': case '}': case ':':
-			case ',':
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			token_init(&parser->token, parser, TOKEN_TYPE_TRUE,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_LBRACKET:
-			token_init(&parser->token, parser, TOKEN_TYPE_LBRACKET,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_RBRACKET:
-			token_init(&parser->token, parser, TOKEN_TYPE_RBRACKET,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_LBRACE:
-			token_init(&parser->token, parser, TOKEN_TYPE_LBRACE,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_RBRACE:
-			token_init(&parser->token, parser, TOKEN_TYPE_RBRACE,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_COLON:
-			token_init(&parser->token, parser, TOKEN_TYPE_COLON,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_COMMA:
-			token_init(&parser->token, parser, TOKEN_TYPE_COMMA,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_CHARS:
-			switch (c) {
-			case '\\':
-				state = STATE_CHAR_ESCAPE;
-				break;
-			case '"':
-				state = STATE_STRING;
-				break;
-			case 0x00: case 0x01: case 0x02: case 0x03: case 0x04:
-			case 0x05: case 0x06: case 0x07: case 0x08: case 0x09:
-			case 0x0a: case 0x0b: case 0x0c: case 0x0d: case 0x0e:
-			case 0x0f: case 0x10: case 0x11: case 0x12: case 0x13:
-			case 0x14: case 0x15: case 0x16: case 0x17: case 0x18:
-			case 0x19: case 0x1a: case 0x1b: case 0x1c: case 0x1d:
-			case 0x1e: case 0x1f:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			default:
-				break;
-			}
-			break;
-		case STATE_CHAR_ESCAPE:
-			switch (c) {
-			case '"': case '\\': case '/': case 'b': case 'n':
-			case 'r': case 't':
-				state = STATE_CHARS;
-				break;
-			case 'u':
-				state = STATE_CHAR_U;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_CHAR_U:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-			case 'a': case 'b': case 'c': case 'd': case 'e':
-			case 'f':
-			case 'A': case 'B': case 'C': case 'D': case 'E':
-			case 'F':
-				state = STATE_CHAR_UD;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_CHAR_UD:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-			case 'a': case 'b': case 'c': case 'd': case 'e':
-			case 'f':
-			case 'A': case 'B': case 'C': case 'D': case 'E':
-			case 'F':
-				state = STATE_CHAR_UDD;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_CHAR_UDD:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-			case 'a': case 'b': case 'c': case 'd': case 'e':
-			case 'f':
-			case 'A': case 'B': case 'C': case 'D': case 'E':
-			case 'F':
-				state = STATE_CHAR_UDDD;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_CHAR_UDDD:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-			case 'a': case 'b': case 'c': case 'd': case 'e':
-			case 'f':
-			case 'A': case 'B': case 'C': case 'D': case 'E':
-			case 'F':
-				state = STATE_CHARS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_STRING:
-			token_init(&parser->token, parser, TOKEN_TYPE_STRING,
-			    token_pos, parser->pos - token_pos, token_line,
-			    token_col);
-			state = STATE_ACCEPT;
-			break;
-		case STATE_MINUS:
-			switch (c) {
-			case '0':
-				state = STATE_LEADING_ZERO;
-				break;
-			case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				state = STATE_DIGITS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_LEADING_ZERO:
-			switch (c) {
-			case '.':
-				state = STATE_DECIMAL;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
-				    token_pos, token_line, token_col);
-				state = STATE_ACCEPT;
-				break;
-			}
-			break;
-		case STATE_DIGITS:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				break;
-			case '.':
-				state = STATE_DECIMAL;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
-				    token_pos, token_line, token_col);
-				state = STATE_ACCEPT;
-				break;
-			}
-			break;
-		case STATE_DECIMAL:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				state = STATE_FRAC_DIGITS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_FRAC_DIGITS:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				break;
-			case 'e': case 'E':
-				state = STATE_EXP;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
-				    token_pos, token_line, token_col);
-				state = STATE_ACCEPT;
-				break;
-			}
-			break;
-		case STATE_EXP:
-			switch (c) {
-			case '-': case '+':
-				state = STATE_EXP_SIGN;
-				break;
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				state = STATE_EXP_DIGITS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_EXP_SIGN:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				state = STATE_EXP_DIGITS;
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_ERROR, token_pos, parser->pos + 1
-				    - token_pos, token_line, token_col);
-				return true;
-			}
-			break;
-		case STATE_EXP_DIGITS:
-			switch (c) {
-			case '0': case '1': case '2': case '3': case '4':
-			case '5': case '6': case '7': case '8': case '9':
-				break;
-			default:
-				token_init(&parser->token, parser,
-				    TOKEN_TYPE_NUMBER, token_pos, parser->pos -
-				    token_pos, token_line, token_col);
-				state = STATE_ACCEPT;
-				break;
-			}
-			break;
-		default:
-			not_reached();
-		}
-
-		if (state != STATE_ACCEPT) {
-			if (c == '\n') {
-				parser->line++;
-				parser->col = 0;
-			} else {
-				parser->col++;
-			}
-			parser->pos++;
-		}
-	}
-	return false;
-}
-
-static bool	parser_parse_array(parser_t *parser);
-static bool	parser_parse_object(parser_t *parser);
-
-static bool
-parser_parse_value(parser_t *parser) {
-	switch (parser->token.token_type) {
-	case TOKEN_TYPE_NULL:
-	case TOKEN_TYPE_FALSE:
-	case TOKEN_TYPE_TRUE:
-	case TOKEN_TYPE_STRING:
-	case TOKEN_TYPE_NUMBER:
-		return false;
-	case TOKEN_TYPE_LBRACE:
-		return parser_parse_object(parser);
-	case TOKEN_TYPE_LBRACKET:
-		return parser_parse_array(parser);
-	default:
-		return true;
-	}
-	not_reached();
-}
-
-static bool
-parser_parse_pair(parser_t *parser) {
-	assert_d_eq(parser->token.token_type, TOKEN_TYPE_STRING,
-	    "Pair should start with string");
-	if (parser_tokenize(parser)) {
-		return true;
-	}
-	switch (parser->token.token_type) {
-	case TOKEN_TYPE_COLON:
-		if (parser_tokenize(parser)) {
-			return true;
-		}
-		return parser_parse_value(parser);
-	default:
-		return true;
-	}
-}
-
-static bool
-parser_parse_values(parser_t *parser) {
-	if (parser_parse_value(parser)) {
-		return true;
-	}
-
-	while (true) {
-		if (parser_tokenize(parser)) {
-			return true;
-		}
-		switch (parser->token.token_type) {
-		case TOKEN_TYPE_COMMA:
-			if (parser_tokenize(parser)) {
-				return true;
-			}
-			if (parser_parse_value(parser)) {
-				return true;
-			}
-			break;
-		case TOKEN_TYPE_RBRACKET:
-			return false;
-		default:
-			return true;
-		}
-	}
-}
-
-static bool
-parser_parse_array(parser_t *parser) {
-	assert_d_eq(parser->token.token_type, TOKEN_TYPE_LBRACKET,
-	    "Array should start with [");
-	if (parser_tokenize(parser)) {
-		return true;
-	}
-	switch (parser->token.token_type) {
-	case TOKEN_TYPE_RBRACKET:
-		return false;
-	default:
-		return parser_parse_values(parser);
-	}
-	not_reached();
-}
-
-static bool
-parser_parse_pairs(parser_t *parser) {
-	assert_d_eq(parser->token.token_type, TOKEN_TYPE_STRING,
-	    "Object should start with string");
-	if (parser_parse_pair(parser)) {
-		return true;
-	}
-
-	while (true) {
-		if (parser_tokenize(parser)) {
-			return true;
-		}
-		switch (parser->token.token_type) {
-		case TOKEN_TYPE_COMMA:
-			if (parser_tokenize(parser)) {
-				return true;
-			}
-			switch (parser->token.token_type) {
-			case TOKEN_TYPE_STRING:
-				if (parser_parse_pair(parser)) {
-					return true;
-				}
-				break;
-			default:
-				return true;
-			}
-			break;
-		case TOKEN_TYPE_RBRACE:
-			return false;
-		default:
-			return true;
-		}
-	}
-}
-
-static bool
-parser_parse_object(parser_t *parser) {
-	assert_d_eq(parser->token.token_type, TOKEN_TYPE_LBRACE,
-	    "Object should start with {");
-	if (parser_tokenize(parser)) {
-		return true;
-	}
-	switch (parser->token.token_type) {
-	case TOKEN_TYPE_STRING:
-		return parser_parse_pairs(parser);
-	case TOKEN_TYPE_RBRACE:
-		return false;
-	default:
-		return true;
-	}
-	not_reached();
-}
-
-static bool
-parser_parse(parser_t *parser) {
-	if (parser_tokenize(parser)) {
-		goto label_error;
-	}
-	if (parser_parse_value(parser)) {
-		goto label_error;
-	}
-
-	if (parser_tokenize(parser)) {
-		goto label_error;
-	}
-	switch (parser->token.token_type) {
-	case TOKEN_TYPE_EOI:
-		return false;
-	default:
-		goto label_error;
-	}
-	not_reached();
-
-label_error:
-	token_error(&parser->token);
-	return true;
-}
-
-TEST_BEGIN(test_json_parser) {
-	size_t i;
-	const char *invalid_inputs[] = {
-		/* Tokenizer error case tests. */
-		"{ \"string\": X }",
-		"{ \"string\": nXll }",
-		"{ \"string\": nuXl }",
-		"{ \"string\": nulX }",
-		"{ \"string\": nullX }",
-		"{ \"string\": fXlse }",
-		"{ \"string\": faXse }",
-		"{ \"string\": falXe }",
-		"{ \"string\": falsX }",
-		"{ \"string\": falseX }",
-		"{ \"string\": tXue }",
-		"{ \"string\": trXe }",
-		"{ \"string\": truX }",
-		"{ \"string\": trueX }",
-		"{ \"string\": \"\n\" }",
-		"{ \"string\": \"\\z\" }",
-		"{ \"string\": \"\\uX000\" }",
-		"{ \"string\": \"\\u0X00\" }",
-		"{ \"string\": \"\\u00X0\" }",
-		"{ \"string\": \"\\u000X\" }",
-		"{ \"string\": -X }",
-		"{ \"string\": 0.X }",
-		"{ \"string\": 0.0eX }",
-		"{ \"string\": 0.0e+X }",
-
-		/* Parser error test cases. */
-		"{\"string\": }",
-		"{\"string\" }",
-		"{\"string\": [ 0 }",
-		"{\"string\": {\"a\":0, 1 } }",
-		"{\"string\": {\"a\":0: } }",
-		"{",
-		"{}{",
-	};
-	const char *valid_inputs[] = {
-		/* Token tests. */
-		"null",
-		"false",
-		"true",
-		"{}",
-		"{\"a\": 0}",
-		"[]",
-		"[0, 1]",
-		"0",
-		"1",
-		"10",
-		"-10",
-		"10.23",
-		"10.23e4",
-		"10.23e-4",
-		"10.23e+4",
-		"10.23E4",
-		"10.23E-4",
-		"10.23E+4",
-		"-10.23",
-		"-10.23e4",
-		"-10.23e-4",
-		"-10.23e+4",
-		"-10.23E4",
-		"-10.23E-4",
-		"-10.23E+4",
-		"\"value\"",
-		"\" \\\" \\/ \\b \\n \\r \\t \\u0abc \\u1DEF \"",
-
-		/* Parser test with various nesting. */
-		"{\"a\":null, \"b\":[1,[{\"c\":2},3]], \"d\":{\"e\":true}}",
-	};
-
-	for (i = 0; i < sizeof(invalid_inputs)/sizeof(const char *); i++) {
-		const char *input = invalid_inputs[i];
-		parser_t parser;
-		parser_init(&parser, false);
-		assert_false(parser_append(&parser, input),
-		    "Unexpected input appending failure");
-		assert_true(parser_parse(&parser),
-		    "Unexpected parse success for input: %s", input);
-		parser_fini(&parser);
-	}
-
-	for (i = 0; i < sizeof(valid_inputs)/sizeof(const char *); i++) {
-		const char *input = valid_inputs[i];
-		parser_t parser;
-		parser_init(&parser, true);
-		assert_false(parser_append(&parser, input),
-		    "Unexpected input appending failure");
-		assert_false(parser_parse(&parser),
-		    "Unexpected parse error for input: %s", input);
-		parser_fini(&parser);
-	}
-}
-TEST_END
-
-void
-write_cb(void *opaque, const char *str) {
-	parser_t *parser = (parser_t *)opaque;
-	if (parser_append(parser, str)) {
-		test_fail("Unexpected input appending failure");
-	}
-}
-
-TEST_BEGIN(test_stats_print_json) {
-	const char *opts[] = {
-		"J",
-		"Jg",
-		"Jm",
-		"Jd",
-		"Jmd",
-		"Jgd",
-		"Jgm",
-		"Jgmd",
-		"Ja",
-		"Jb",
-		"Jl",
-		"Jx",
-		"Jbl",
-		"Jal",
-		"Jab",
-		"Jabl",
-		"Jax",
-		"Jbx",
-		"Jlx",
-		"Jablx",
-		"Jgmdablx",
-	};
-	unsigned arena_ind, i;
-
-	for (i = 0; i < 3; i++) {
-		unsigned j;
-
-		switch (i) {
-		case 0:
-			break;
-		case 1: {
-			size_t sz = sizeof(arena_ind);
-			assert_d_eq(mallctl("arenas.create", (void *)&arena_ind,
-			    &sz, NULL, 0), 0, "Unexpected mallctl failure");
-			break;
-		} case 2: {
-			size_t mib[3];
-			size_t miblen = sizeof(mib)/sizeof(size_t);
-			assert_d_eq(mallctlnametomib("arena.0.destroy",
-			    mib, &miblen), 0,
-			    "Unexpected mallctlnametomib failure");
-			mib[1] = arena_ind;
-			assert_d_eq(mallctlbymib(mib, miblen, NULL, NULL, NULL,
-			    0), 0, "Unexpected mallctlbymib failure");
-			break;
-		} default:
-			not_reached();
-		}
-
-		for (j = 0; j < sizeof(opts)/sizeof(const char *); j++) {
-			parser_t parser;
-
-			parser_init(&parser, true);
-			malloc_stats_print(write_cb, (void *)&parser, opts[j]);
-			assert_false(parser_parse(&parser),
-			    "Unexpected parse error, opts=\"%s\"", opts[j]);
-			parser_fini(&parser);
-		}
-	}
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_json_parser,
-	    test_stats_print_json);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/ticker.c b/redis-stable/deps/jemalloc/test/unit/ticker.c
deleted file mode 100644
index e5790a31..00000000
--- a/redis-stable/deps/jemalloc/test/unit/ticker.c
+++ /dev/null
@@ -1,73 +0,0 @@
-#include "test/jemalloc_test.h"
-
-#include "jemalloc/internal/ticker.h"
-
-TEST_BEGIN(test_ticker_tick) {
-#define NREPS 2
-#define NTICKS 3
-	ticker_t ticker;
-	int32_t i, j;
-
-	ticker_init(&ticker, NTICKS);
-	for (i = 0; i < NREPS; i++) {
-		for (j = 0; j < NTICKS; j++) {
-			assert_u_eq(ticker_read(&ticker), NTICKS - j,
-			    "Unexpected ticker value (i=%d, j=%d)", i, j);
-			assert_false(ticker_tick(&ticker),
-			    "Unexpected ticker fire (i=%d, j=%d)", i, j);
-		}
-		assert_u32_eq(ticker_read(&ticker), 0,
-		    "Expected ticker depletion");
-		assert_true(ticker_tick(&ticker),
-		    "Expected ticker fire (i=%d)", i);
-		assert_u32_eq(ticker_read(&ticker), NTICKS,
-		    "Expected ticker reset");
-	}
-#undef NTICKS
-}
-TEST_END
-
-TEST_BEGIN(test_ticker_ticks) {
-#define NTICKS 3
-	ticker_t ticker;
-
-	ticker_init(&ticker, NTICKS);
-
-	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
-	assert_false(ticker_ticks(&ticker, NTICKS), "Unexpected ticker fire");
-	assert_u_eq(ticker_read(&ticker), 0, "Unexpected ticker value");
-	assert_true(ticker_ticks(&ticker, NTICKS), "Expected ticker fire");
-	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
-
-	assert_true(ticker_ticks(&ticker, NTICKS + 1), "Expected ticker fire");
-	assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value");
-#undef NTICKS
-}
-TEST_END
-
-TEST_BEGIN(test_ticker_copy) {
-#define NTICKS 3
-	ticker_t ta, tb;
-
-	ticker_init(&ta, NTICKS);
-	ticker_copy(&tb, &ta);
-	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
-	assert_true(ticker_ticks(&tb, NTICKS + 1), "Expected ticker fire");
-	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
-
-	ticker_tick(&ta);
-	ticker_copy(&tb, &ta);
-	assert_u_eq(ticker_read(&tb), NTICKS - 1, "Unexpected ticker value");
-	assert_true(ticker_ticks(&tb, NTICKS), "Expected ticker fire");
-	assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value");
-#undef NTICKS
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_ticker_tick,
-	    test_ticker_ticks,
-	    test_ticker_copy);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/tsd.c b/redis-stable/deps/jemalloc/test/unit/tsd.c
deleted file mode 100644
index 6c479139..00000000
--- a/redis-stable/deps/jemalloc/test/unit/tsd.c
+++ /dev/null
@@ -1,139 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static int data_cleanup_count;
-
-void
-data_cleanup(int *data) {
-	if (data_cleanup_count == 0) {
-		assert_x_eq(*data, MALLOC_TSD_TEST_DATA_INIT,
-		    "Argument passed into cleanup function should match tsd "
-		    "value");
-	}
-	++data_cleanup_count;
-
-	/*
-	 * Allocate during cleanup for two rounds, in order to assure that
-	 * jemalloc's internal tsd reinitialization happens.
-	 */
-	bool reincarnate = false;
-	switch (*data) {
-	case MALLOC_TSD_TEST_DATA_INIT:
-		*data = 1;
-		reincarnate = true;
-		break;
-	case 1:
-		*data = 2;
-		reincarnate = true;
-		break;
-	case 2:
-		return;
-	default:
-		not_reached();
-	}
-
-	if (reincarnate) {
-		void *p = mallocx(1, 0);
-		assert_ptr_not_null(p, "Unexpeced mallocx() failure");
-		dallocx(p, 0);
-	}
-}
-
-static void *
-thd_start(void *arg) {
-	int d = (int)(uintptr_t)arg;
-	void *p;
-
-	tsd_t *tsd = tsd_fetch();
-	assert_x_eq(tsd_test_data_get(tsd), MALLOC_TSD_TEST_DATA_INIT,
-	    "Initial tsd get should return initialization value");
-
-	p = malloc(1);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-
-	tsd_test_data_set(tsd, d);
-	assert_x_eq(tsd_test_data_get(tsd), d,
-	    "After tsd set, tsd get should return value that was set");
-
-	d = 0;
-	assert_x_eq(tsd_test_data_get(tsd), (int)(uintptr_t)arg,
-	    "Resetting local data should have no effect on tsd");
-
-	tsd_test_callback_set(tsd, &data_cleanup);
-
-	free(p);
-	return NULL;
-}
-
-TEST_BEGIN(test_tsd_main_thread) {
-	thd_start((void *)(uintptr_t)0xa5f3e329);
-}
-TEST_END
-
-TEST_BEGIN(test_tsd_sub_thread) {
-	thd_t thd;
-
-	data_cleanup_count = 0;
-	thd_create(&thd, thd_start, (void *)MALLOC_TSD_TEST_DATA_INIT);
-	thd_join(thd, NULL);
-	/*
-	 * We reincarnate twice in the data cleanup, so it should execute at
-	 * least 3 times.
-	 */
-	assert_x_ge(data_cleanup_count, 3,
-	    "Cleanup function should have executed multiple times.");
-}
-TEST_END
-
-static void *
-thd_start_reincarnated(void *arg) {
-	tsd_t *tsd = tsd_fetch();
-	assert(tsd);
-
-	void *p = malloc(1);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-
-	/* Manually trigger reincarnation. */
-	assert_ptr_not_null(tsd_arena_get(tsd),
-	    "Should have tsd arena set.");
-	tsd_cleanup((void *)tsd);
-	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
-	    "TSD arena should have been cleared.");
-	assert_u_eq(tsd->state, tsd_state_purgatory,
-	    "TSD state should be purgatory\n");
-
-	free(p);
-	assert_u_eq(tsd->state, tsd_state_reincarnated,
-	    "TSD state should be reincarnated\n");
-	p = mallocx(1, MALLOCX_TCACHE_NONE);
-	assert_ptr_not_null(p, "Unexpected malloc() failure");
-	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
-	    "Should not have tsd arena set after reincarnation.");
-
-	free(p);
-	tsd_cleanup((void *)tsd);
-	assert_ptr_null(*tsd_arenap_get_unsafe(tsd),
-	    "TSD arena should have been cleared after 2nd cleanup.");
-
-	return NULL;
-}
-
-TEST_BEGIN(test_tsd_reincarnation) {
-	thd_t thd;
-	thd_create(&thd, thd_start_reincarnated, NULL);
-	thd_join(thd, NULL);
-}
-TEST_END
-
-int
-main(void) {
-	/* Ensure tsd bootstrapped. */
-	if (nallocx(1, 0) == 0) {
-		malloc_printf("Initialization error");
-		return test_status_fail;
-	}
-
-	return test_no_reentrancy(
-	    test_tsd_main_thread,
-	    test_tsd_sub_thread,
-	    test_tsd_reincarnation);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/witness.c b/redis-stable/deps/jemalloc/test/unit/witness.c
deleted file mode 100644
index 5986da40..00000000
--- a/redis-stable/deps/jemalloc/test/unit/witness.c
+++ /dev/null
@@ -1,280 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static witness_lock_error_t *witness_lock_error_orig;
-static witness_owner_error_t *witness_owner_error_orig;
-static witness_not_owner_error_t *witness_not_owner_error_orig;
-static witness_depth_error_t *witness_depth_error_orig;
-
-static bool saw_lock_error;
-static bool saw_owner_error;
-static bool saw_not_owner_error;
-static bool saw_depth_error;
-
-static void
-witness_lock_error_intercept(const witness_list_t *witnesses,
-    const witness_t *witness) {
-	saw_lock_error = true;
-}
-
-static void
-witness_owner_error_intercept(const witness_t *witness) {
-	saw_owner_error = true;
-}
-
-static void
-witness_not_owner_error_intercept(const witness_t *witness) {
-	saw_not_owner_error = true;
-}
-
-static void
-witness_depth_error_intercept(const witness_list_t *witnesses,
-    witness_rank_t rank_inclusive, unsigned depth) {
-	saw_depth_error = true;
-}
-
-static int
-witness_comp(const witness_t *a, void *oa, const witness_t *b, void *ob) {
-	assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank");
-
-	assert(oa == (void *)a);
-	assert(ob == (void *)b);
-
-	return strcmp(a->name, b->name);
-}
-
-static int
-witness_comp_reverse(const witness_t *a, void *oa, const witness_t *b,
-    void *ob) {
-	assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank");
-
-	assert(oa == (void *)a);
-	assert(ob == (void *)b);
-
-	return -strcmp(a->name, b->name);
-}
-
-TEST_BEGIN(test_witness) {
-	witness_t a, b;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 0);
-
-	witness_init(&a, "a", 1, NULL, NULL);
-	witness_assert_not_owner(&witness_tsdn, &a);
-	witness_lock(&witness_tsdn, &a);
-	witness_assert_owner(&witness_tsdn, &a);
-	witness_assert_depth(&witness_tsdn, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 0);
-
-	witness_init(&b, "b", 2, NULL, NULL);
-	witness_assert_not_owner(&witness_tsdn, &b);
-	witness_lock(&witness_tsdn, &b);
-	witness_assert_owner(&witness_tsdn, &b);
-	witness_assert_depth(&witness_tsdn, 2);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 2);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)3U, 0);
-
-	witness_unlock(&witness_tsdn, &a);
-	witness_assert_depth(&witness_tsdn, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)2U, 1);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)3U, 0);
-	witness_unlock(&witness_tsdn, &b);
-
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-	witness_assert_depth_to_rank(&witness_tsdn, (witness_rank_t)1U, 0);
-}
-TEST_END
-
-TEST_BEGIN(test_witness_comp) {
-	witness_t a, b, c, d;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_init(&a, "a", 1, witness_comp, &a);
-	witness_assert_not_owner(&witness_tsdn, &a);
-	witness_lock(&witness_tsdn, &a);
-	witness_assert_owner(&witness_tsdn, &a);
-	witness_assert_depth(&witness_tsdn, 1);
-
-	witness_init(&b, "b", 1, witness_comp, &b);
-	witness_assert_not_owner(&witness_tsdn, &b);
-	witness_lock(&witness_tsdn, &b);
-	witness_assert_owner(&witness_tsdn, &b);
-	witness_assert_depth(&witness_tsdn, 2);
-	witness_unlock(&witness_tsdn, &b);
-	witness_assert_depth(&witness_tsdn, 1);
-
-	witness_lock_error_orig = witness_lock_error;
-	witness_lock_error = witness_lock_error_intercept;
-	saw_lock_error = false;
-
-	witness_init(&c, "c", 1, witness_comp_reverse, &c);
-	witness_assert_not_owner(&witness_tsdn, &c);
-	assert_false(saw_lock_error, "Unexpected witness lock error");
-	witness_lock(&witness_tsdn, &c);
-	assert_true(saw_lock_error, "Expected witness lock error");
-	witness_unlock(&witness_tsdn, &c);
-	witness_assert_depth(&witness_tsdn, 1);
-
-	saw_lock_error = false;
-
-	witness_init(&d, "d", 1, NULL, NULL);
-	witness_assert_not_owner(&witness_tsdn, &d);
-	assert_false(saw_lock_error, "Unexpected witness lock error");
-	witness_lock(&witness_tsdn, &d);
-	assert_true(saw_lock_error, "Expected witness lock error");
-	witness_unlock(&witness_tsdn, &d);
-	witness_assert_depth(&witness_tsdn, 1);
-
-	witness_unlock(&witness_tsdn, &a);
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_lock_error = witness_lock_error_orig;
-}
-TEST_END
-
-TEST_BEGIN(test_witness_reversal) {
-	witness_t a, b;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_lock_error_orig = witness_lock_error;
-	witness_lock_error = witness_lock_error_intercept;
-	saw_lock_error = false;
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_init(&a, "a", 1, NULL, NULL);
-	witness_init(&b, "b", 2, NULL, NULL);
-
-	witness_lock(&witness_tsdn, &b);
-	witness_assert_depth(&witness_tsdn, 1);
-	assert_false(saw_lock_error, "Unexpected witness lock error");
-	witness_lock(&witness_tsdn, &a);
-	assert_true(saw_lock_error, "Expected witness lock error");
-
-	witness_unlock(&witness_tsdn, &a);
-	witness_assert_depth(&witness_tsdn, 1);
-	witness_unlock(&witness_tsdn, &b);
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_lock_error = witness_lock_error_orig;
-}
-TEST_END
-
-TEST_BEGIN(test_witness_recursive) {
-	witness_t a;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_not_owner_error_orig = witness_not_owner_error;
-	witness_not_owner_error = witness_not_owner_error_intercept;
-	saw_not_owner_error = false;
-
-	witness_lock_error_orig = witness_lock_error;
-	witness_lock_error = witness_lock_error_intercept;
-	saw_lock_error = false;
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_init(&a, "a", 1, NULL, NULL);
-
-	witness_lock(&witness_tsdn, &a);
-	assert_false(saw_lock_error, "Unexpected witness lock error");
-	assert_false(saw_not_owner_error, "Unexpected witness not owner error");
-	witness_lock(&witness_tsdn, &a);
-	assert_true(saw_lock_error, "Expected witness lock error");
-	assert_true(saw_not_owner_error, "Expected witness not owner error");
-
-	witness_unlock(&witness_tsdn, &a);
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_owner_error = witness_owner_error_orig;
-	witness_lock_error = witness_lock_error_orig;
-
-}
-TEST_END
-
-TEST_BEGIN(test_witness_unlock_not_owned) {
-	witness_t a;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_owner_error_orig = witness_owner_error;
-	witness_owner_error = witness_owner_error_intercept;
-	saw_owner_error = false;
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_init(&a, "a", 1, NULL, NULL);
-
-	assert_false(saw_owner_error, "Unexpected owner error");
-	witness_unlock(&witness_tsdn, &a);
-	assert_true(saw_owner_error, "Expected owner error");
-
-	witness_assert_lockless(&witness_tsdn);
-
-	witness_owner_error = witness_owner_error_orig;
-}
-TEST_END
-
-TEST_BEGIN(test_witness_depth) {
-	witness_t a;
-	witness_tsdn_t witness_tsdn = { WITNESS_TSD_INITIALIZER };
-
-	test_skip_if(!config_debug);
-
-	witness_depth_error_orig = witness_depth_error;
-	witness_depth_error = witness_depth_error_intercept;
-	saw_depth_error = false;
-
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-
-	witness_init(&a, "a", 1, NULL, NULL);
-
-	assert_false(saw_depth_error, "Unexpected depth error");
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-
-	witness_lock(&witness_tsdn, &a);
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-	assert_true(saw_depth_error, "Expected depth error");
-
-	witness_unlock(&witness_tsdn, &a);
-
-	witness_assert_lockless(&witness_tsdn);
-	witness_assert_depth(&witness_tsdn, 0);
-
-	witness_depth_error = witness_depth_error_orig;
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_witness,
-	    test_witness_comp,
-	    test_witness_reversal,
-	    test_witness_recursive,
-	    test_witness_unlock_not_owned,
-	    test_witness_depth);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/zero.c b/redis-stable/deps/jemalloc/test/unit/zero.c
deleted file mode 100644
index 553692ba..00000000
--- a/redis-stable/deps/jemalloc/test/unit/zero.c
+++ /dev/null
@@ -1,59 +0,0 @@
-#include "test/jemalloc_test.h"
-
-static void
-test_zero(size_t sz_min, size_t sz_max) {
-	uint8_t *s;
-	size_t sz_prev, sz, i;
-#define MAGIC	((uint8_t)0x61)
-
-	sz_prev = 0;
-	s = (uint8_t *)mallocx(sz_min, 0);
-	assert_ptr_not_null((void *)s, "Unexpected mallocx() failure");
-
-	for (sz = sallocx(s, 0); sz <= sz_max;
-	    sz_prev = sz, sz = sallocx(s, 0)) {
-		if (sz_prev > 0) {
-			assert_u_eq(s[0], MAGIC,
-			    "Previously allocated byte %zu/%zu is corrupted",
-			    ZU(0), sz_prev);
-			assert_u_eq(s[sz_prev-1], MAGIC,
-			    "Previously allocated byte %zu/%zu is corrupted",
-			    sz_prev-1, sz_prev);
-		}
-
-		for (i = sz_prev; i < sz; i++) {
-			assert_u_eq(s[i], 0x0,
-			    "Newly allocated byte %zu/%zu isn't zero-filled",
-			    i, sz);
-			s[i] = MAGIC;
-		}
-
-		if (xallocx(s, sz+1, 0, 0) == sz) {
-			s = (uint8_t *)rallocx(s, sz+1, 0);
-			assert_ptr_not_null((void *)s,
-			    "Unexpected rallocx() failure");
-		}
-	}
-
-	dallocx(s, 0);
-#undef MAGIC
-}
-
-TEST_BEGIN(test_zero_small) {
-	test_skip_if(!config_fill);
-	test_zero(1, SMALL_MAXCLASS-1);
-}
-TEST_END
-
-TEST_BEGIN(test_zero_large) {
-	test_skip_if(!config_fill);
-	test_zero(SMALL_MAXCLASS+1, (1U << (LG_LARGE_MINCLASS+1)));
-}
-TEST_END
-
-int
-main(void) {
-	return test(
-	    test_zero_small,
-	    test_zero_large);
-}
diff --git a/redis-stable/deps/jemalloc/test/unit/zero.sh b/redis-stable/deps/jemalloc/test/unit/zero.sh
deleted file mode 100644
index b4540b27..00000000
--- a/redis-stable/deps/jemalloc/test/unit/zero.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-#!/bin/sh
-
-if [ "x${enable_fill}" = "x1" ] ; then
-  export MALLOC_CONF="abort:false,junk:false,zero:true"
-fi
diff --git a/redis-stable/deps/linenoise/.gitignore b/redis-stable/deps/linenoise/.gitignore
deleted file mode 100644
index 7ab7825f..00000000
--- a/redis-stable/deps/linenoise/.gitignore
+++ /dev/null
@@ -1,3 +0,0 @@
-linenoise_example
-*.dSYM
-history.txt
diff --git a/redis-stable/deps/linenoise/Makefile b/redis-stable/deps/linenoise/Makefile
deleted file mode 100644
index 1dd894b4..00000000
--- a/redis-stable/deps/linenoise/Makefile
+++ /dev/null
@@ -1,21 +0,0 @@
-STD=
-WARN= -Wall
-OPT= -Os
-
-R_CFLAGS= $(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS)
-R_LDFLAGS= $(LDFLAGS)
-DEBUG= -g
-
-R_CC=$(CC) $(R_CFLAGS)
-R_LD=$(CC) $(R_LDFLAGS)
-
-linenoise.o: linenoise.h linenoise.c
-
-linenoise_example: linenoise.o example.o
-	$(R_LD) -o $@ $^
-
-.c.o:
-	$(R_CC) -c $<
-
-clean:
-	rm -f linenoise_example *.o
diff --git a/redis-stable/deps/linenoise/README.markdown b/redis-stable/deps/linenoise/README.markdown
deleted file mode 100644
index 1afea2ae..00000000
--- a/redis-stable/deps/linenoise/README.markdown
+++ /dev/null
@@ -1,247 +0,0 @@
-# Linenoise
-
-A minimal, zero-config, BSD licensed, readline replacement used in Redis,
-MongoDB, and Android.
-
-* Single and multi line editing mode with the usual key bindings implemented.
-* History handling.
-* Completion.
-* Hints (suggestions at the right of the prompt as you type).
-* About 1,100 lines of BSD license source code.
-* Only uses a subset of VT100 escapes (ANSI.SYS compatible).
-
-## Can a line editing library be 20k lines of code?
-
-Line editing with some support for history is a really important feature for command line utilities. Instead of retyping almost the same stuff again and again it's just much better to hit the up arrow and edit on syntax errors, or in order to try a slightly different command. But apparently code dealing with terminals is some sort of Black Magic: readline is 30k lines of code, libedit 20k. Is it reasonable to link small utilities to huge libraries just to get a minimal support for line editing?
-
-So what usually happens is either:
-
- * Large programs with configure scripts disabling line editing if readline is not present in the system, or not supporting it at all since readline is GPL licensed and libedit (the BSD clone) is not as known and available as readline is (Real world example of this problem: Tclsh).
- * Smaller programs not using a configure script not supporting line editing at all (A problem we had with Redis-cli for instance).
- 
-The result is a pollution of binaries without line editing support.
-
-So I spent more or less two hours doing a reality check resulting in this little library: is it *really* needed for a line editing library to be 20k lines of code? Apparently not, it is possibe to get a very small, zero configuration, trivial to embed library, that solves the problem. Smaller programs will just include this, supporting line editing out of the box. Larger programs may use this little library or just checking with configure if readline/libedit is available and resorting to Linenoise if not.
-
-## Terminals, in 2010.
-
-Apparently almost every terminal you can happen to use today has some kind of support for basic VT100 escape sequences. So I tried to write a lib using just very basic VT100 features. The resulting library appears to work everywhere I tried to use it, and now can work even on ANSI.SYS compatible terminals, since no
-VT220 specific sequences are used anymore.
-
-The library is currently about 1100 lines of code. In order to use it in your project just look at the *example.c* file in the source distribution, it is trivial. Linenoise is BSD code, so you can use both in free software and commercial software.
-
-## Tested with...
-
- * Linux text only console ($TERM = linux)
- * Linux KDE terminal application ($TERM = xterm)
- * Linux xterm ($TERM = xterm)
- * Linux Buildroot ($TERM = vt100)
- * Mac OS X iTerm ($TERM = xterm)
- * Mac OS X default Terminal.app ($TERM = xterm)
- * OpenBSD 4.5 through an OSX Terminal.app ($TERM = screen)
- * IBM AIX 6.1
- * FreeBSD xterm ($TERM = xterm)
- * ANSI.SYS
- * Emacs comint mode ($TERM = dumb)
-
-Please test it everywhere you can and report back!
-
-## Let's push this forward!
-
-Patches should be provided in the respect of Linenoise sensibility for small
-easy to understand code.
-
-Send feedbacks to antirez at gmail
-
-# The API
-
-Linenoise is very easy to use, and reading the example shipped with the
-library should get you up to speed ASAP. Here is a list of API calls
-and how to use them.
-
-    char *linenoise(const char *prompt);
-
-This is the main Linenoise call: it shows the user a prompt with line editing
-and history capabilities. The prompt you specify is used as a prompt, that is,
-it will be printed to the left of the cursor. The library returns a buffer
-with the line composed by the user, or NULL on end of file or when there
-is an out of memory condition.
-
-When a tty is detected (the user is actually typing into a terminal session)
-the maximum editable line length is `LINENOISE_MAX_LINE`. When instead the
-standard input is not a tty, which happens every time you redirect a file
-to a program, or use it in an Unix pipeline, there are no limits to the
-length of the line that can be returned.
-
-The returned line should be freed with the `free()` standard system call.
-However sometimes it could happen that your program uses a different dynamic
-allocation library, so you may also used `linenoiseFree` to make sure the
-line is freed with the same allocator it was created.
-
-The canonical loop used by a program using Linenoise will be something like
-this:
-
-    while((line = linenoise("hello> ")) != NULL) {
-        printf("You wrote: %s\n", line);
-        linenoiseFree(line); /* Or just free(line) if you use libc malloc. */
-    }
-
-## Single line VS multi line editing
-
-By default, Linenoise uses single line editing, that is, a single row on the
-screen will be used, and as the user types more, the text will scroll towards
-left to make room. This works if your program is one where the user is
-unlikely to write a lot of text, otherwise multi line editing, where multiple
-screens rows are used, can be a lot more comfortable.
-
-In order to enable multi line editing use the following API call:
-
-    linenoiseSetMultiLine(1);
-
-You can disable it using `0` as argument.
-
-## History
-
-Linenoise supporst history, so that the user does not have to retype
-again and again the same things, but can use the down and up arrows in order
-to search and re-edit already inserted lines of text.
-
-The followings are the history API calls:
-
-    int linenoiseHistoryAdd(const char *line);
-    int linenoiseHistorySetMaxLen(int len);
-    int linenoiseHistorySave(const char *filename);
-    int linenoiseHistoryLoad(const char *filename);
-
-Use `linenoiseHistoryAdd` every time you want to add a new element
-to the top of the history (it will be the first the user will see when
-using the up arrow).
-
-Note that for history to work, you have to set a length for the history
-(which is zero by default, so history will be disabled if you don't set
-a proper one). This is accomplished using the `linenoiseHistorySetMaxLen`
-function.
-
-Linenoise has direct support for persisting the history into an history
-file. The functions `linenoiseHistorySave` and `linenoiseHistoryLoad` do
-just that. Both functions return -1 on error and 0 on success.
-
-## Mask mode
-
-Sometimes it is useful to allow the user to type passwords or other
-secrets that should not be displayed. For such situations linenoise supports
-a "mask mode" that will just replace the characters the user is typing 
-with `*` characters, like in the following example:
-
-    $ ./linenoise_example
-    hello> get mykey
-    echo: 'get mykey'
-    hello> /mask
-    hello> *********
-
-You can enable and disable mask mode using the following two functions:
-
-    void linenoiseMaskModeEnable(void);
-    void linenoiseMaskModeDisable(void);
-
-## Completion
-
-Linenoise supports completion, which is the ability to complete the user
-input when she or he presses the `<TAB>` key.
-
-In order to use completion, you need to register a completion callback, which
-is called every time the user presses `<TAB>`. Your callback will return a
-list of items that are completions for the current string.
-
-The following is an example of registering a completion callback:
-
-    linenoiseSetCompletionCallback(completion);
-
-The completion must be a function returning `void` and getting as input
-a `const char` pointer, which is the line the user has typed so far, and
-a `linenoiseCompletions` object pointer, which is used as argument of
-`linenoiseAddCompletion` in order to add completions inside the callback.
-An example will make it more clear:
-
-    void completion(const char *buf, linenoiseCompletions *lc) {
-        if (buf[0] == 'h') {
-            linenoiseAddCompletion(lc,"hello");
-            linenoiseAddCompletion(lc,"hello there");
-        }
-    }
-
-Basically in your completion callback, you inspect the input, and return
-a list of items that are good completions by using `linenoiseAddCompletion`.
-
-If you want to test the completion feature, compile the example program
-with `make`, run it, type `h` and press `<TAB>`.
-
-## Hints
-
-Linenoise has a feature called *hints* which is very useful when you
-use Linenoise in order to implement a REPL (Read Eval Print Loop) for
-a program that accepts commands and arguments, but may also be useful in
-other conditions.
-
-The feature shows, on the right of the cursor, as the user types, hints that
-may be useful. The hints can be displayed using a different color compared
-to the color the user is typing, and can also be bold.
-
-For example as the user starts to type `"git remote add"`, with hints it's
-possible to show on the right of the prompt a string `<name> <url>`.
-
-The feature works similarly to the history feature, using a callback.
-To register the callback we use:
-
-    linenoiseSetHintsCallback(hints);
-
-The callback itself is implemented like this:
-
-    char *hints(const char *buf, int *color, int *bold) {
-        if (!strcasecmp(buf,"git remote add")) {
-            *color = 35;
-            *bold = 0;
-            return " <name> <url>";
-        }
-        return NULL;
-    }
-
-The callback function returns the string that should be displayed or NULL
-if no hint is available for the text the user currently typed. The returned
-string will be trimmed as needed depending on the number of columns available
-on the screen.
-
-It is possible to return a string allocated in dynamic way, by also registering
-a function to deallocate the hint string once used:
-
-    void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *);
-
-The free hint callback will just receive the pointer and free the string
-as needed (depending on how the hits callback allocated it).
-
-As you can see in the example above, a `color` (in xterm color terminal codes)
-can be provided together with a `bold` attribute. If no color is set, the
-current terminal foreground color is used. If no bold attribute is set,
-non-bold text is printed.
-
-Color codes are:
-
-    red = 31
-    green = 32
-    yellow = 33
-    blue = 34
-    magenta = 35
-    cyan = 36
-    white = 37;
-
-## Screen handling
-
-Sometimes you may want to clear the screen as a result of something the
-user typed. You can do this by calling the following function:
-
-    void linenoiseClearScreen(void);
-
-## Related projects
-
-* [Linenoise NG](https://github.com/arangodb/linenoise-ng) is a fork of Linenoise that aims to add more advanced features like UTF-8 support, Windows support and other features. Uses C++ instead of C as development language.
-* [Linenoise-swift](https://github.com/andybest/linenoise-swift) is a reimplementation of Linenoise written in Swift.
diff --git a/redis-stable/deps/linenoise/example.c b/redis-stable/deps/linenoise/example.c
deleted file mode 100644
index 74358c32..00000000
--- a/redis-stable/deps/linenoise/example.c
+++ /dev/null
@@ -1,79 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include "linenoise.h"
-
-
-void completion(const char *buf, linenoiseCompletions *lc) {
-    if (buf[0] == 'h') {
-        linenoiseAddCompletion(lc,"hello");
-        linenoiseAddCompletion(lc,"hello there");
-    }
-}
-
-char *hints(const char *buf, int *color, int *bold) {
-    if (!strcasecmp(buf,"hello")) {
-        *color = 35;
-        *bold = 0;
-        return " World";
-    }
-    return NULL;
-}
-
-int main(int argc, char **argv) {
-    char *line;
-    char *prgname = argv[0];
-
-    /* Parse options, with --multiline we enable multi line editing. */
-    while(argc > 1) {
-        argc--;
-        argv++;
-        if (!strcmp(*argv,"--multiline")) {
-            linenoiseSetMultiLine(1);
-            printf("Multi-line mode enabled.\n");
-        } else if (!strcmp(*argv,"--keycodes")) {
-            linenoisePrintKeyCodes();
-            exit(0);
-        } else {
-            fprintf(stderr, "Usage: %s [--multiline] [--keycodes]\n", prgname);
-            exit(1);
-        }
-    }
-
-    /* Set the completion callback. This will be called every time the
-     * user uses the <tab> key. */
-    linenoiseSetCompletionCallback(completion);
-    linenoiseSetHintsCallback(hints);
-
-    /* Load history from file. The history file is just a plain text file
-     * where entries are separated by newlines. */
-    linenoiseHistoryLoad("history.txt"); /* Load the history at startup */
-
-    /* Now this is the main loop of the typical linenoise-based application.
-     * The call to linenoise() will block as long as the user types something
-     * and presses enter.
-     *
-     * The typed string is returned as a malloc() allocated string by
-     * linenoise, so the user needs to free() it. */
-    
-    while((line = linenoise("hello> ")) != NULL) {
-        /* Do something with the string. */
-        if (line[0] != '\0' && line[0] != '/') {
-            printf("echo: '%s'\n", line);
-            linenoiseHistoryAdd(line); /* Add to the history. */
-            linenoiseHistorySave("history.txt"); /* Save the history on disk. */
-        } else if (!strncmp(line,"/historylen",11)) {
-            /* The "/historylen" command will change the history len. */
-            int len = atoi(line+11);
-            linenoiseHistorySetMaxLen(len);
-        } else if (!strncmp(line, "/mask", 5)) {
-            linenoiseMaskModeEnable();
-        } else if (!strncmp(line, "/unmask", 7)) {
-            linenoiseMaskModeDisable();
-        } else if (line[0] == '/') {
-            printf("Unreconized command: %s\n", line);
-        }
-        free(line);
-    }
-    return 0;
-}
diff --git a/redis-stable/deps/linenoise/linenoise.c b/redis-stable/deps/linenoise/linenoise.c
deleted file mode 100644
index ccf5c554..00000000
--- a/redis-stable/deps/linenoise/linenoise.c
+++ /dev/null
@@ -1,1225 +0,0 @@
-/* linenoise.c -- guerrilla line editing library against the idea that a
- * line editing lib needs to be 20,000 lines of C code.
- *
- * You can find the latest source code at:
- *
- *   http://github.com/antirez/linenoise
- *
- * Does a number of crazy assumptions that happen to be true in 99.9999% of
- * the 2010 UNIX computers around.
- *
- * ------------------------------------------------------------------------
- *
- * Copyright (c) 2010-2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2013, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *  *  Redistributions of source code must retain the above copyright
- *     notice, this list of conditions and the following disclaimer.
- *
- *  *  Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * ------------------------------------------------------------------------
- *
- * References:
- * - http://invisible-island.net/xterm/ctlseqs/ctlseqs.html
- * - http://www.3waylabs.com/nw/WWW/products/wizcon/vt220.html
- *
- * Todo list:
- * - Filter bogus Ctrl+<char> combinations.
- * - Win32 support
- *
- * Bloat:
- * - History search like Ctrl+r in readline?
- *
- * List of escape sequences used by this program, we do everything just
- * with three sequences. In order to be so cheap we may have some
- * flickering effect with some slow terminal, but the lesser sequences
- * the more compatible.
- *
- * EL (Erase Line)
- *    Sequence: ESC [ n K
- *    Effect: if n is 0 or missing, clear from cursor to end of line
- *    Effect: if n is 1, clear from beginning of line to cursor
- *    Effect: if n is 2, clear entire line
- *
- * CUF (CUrsor Forward)
- *    Sequence: ESC [ n C
- *    Effect: moves cursor forward n chars
- *
- * CUB (CUrsor Backward)
- *    Sequence: ESC [ n D
- *    Effect: moves cursor backward n chars
- *
- * The following is used to get the terminal width if getting
- * the width with the TIOCGWINSZ ioctl fails
- *
- * DSR (Device Status Report)
- *    Sequence: ESC [ 6 n
- *    Effect: reports the current cusor position as ESC [ n ; m R
- *            where n is the row and m is the column
- *
- * When multi line mode is enabled, we also use an additional escape
- * sequence. However multi line editing is disabled by default.
- *
- * CUU (Cursor Up)
- *    Sequence: ESC [ n A
- *    Effect: moves cursor up of n chars.
- *
- * CUD (Cursor Down)
- *    Sequence: ESC [ n B
- *    Effect: moves cursor down of n chars.
- *
- * When linenoiseClearScreen() is called, two additional escape sequences
- * are used in order to clear the screen and position the cursor at home
- * position.
- *
- * CUP (Cursor position)
- *    Sequence: ESC [ H
- *    Effect: moves the cursor to upper left corner
- *
- * ED (Erase display)
- *    Sequence: ESC [ 2 J
- *    Effect: clear the whole screen
- *
- */
-
-#include <termios.h>
-#include <unistd.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <errno.h>
-#include <string.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <sys/stat.h>
-#include <sys/types.h>
-#include <sys/ioctl.h>
-#include <unistd.h>
-#include "linenoise.h"
-
-#define LINENOISE_DEFAULT_HISTORY_MAX_LEN 100
-#define LINENOISE_MAX_LINE 4096
-static char *unsupported_term[] = {"dumb","cons25","emacs",NULL};
-static linenoiseCompletionCallback *completionCallback = NULL;
-static linenoiseHintsCallback *hintsCallback = NULL;
-static linenoiseFreeHintsCallback *freeHintsCallback = NULL;
-
-static struct termios orig_termios; /* In order to restore at exit.*/
-static int maskmode = 0; /* Show "***" instead of input. For passwords. */
-static int rawmode = 0; /* For atexit() function to check if restore is needed*/
-static int mlmode = 0;  /* Multi line mode. Default is single line. */
-static int atexit_registered = 0; /* Register atexit just 1 time. */
-static int history_max_len = LINENOISE_DEFAULT_HISTORY_MAX_LEN;
-static int history_len = 0;
-static char **history = NULL;
-
-/* The linenoiseState structure represents the state during line editing.
- * We pass this state to functions implementing specific editing
- * functionalities. */
-struct linenoiseState {
-    int ifd;            /* Terminal stdin file descriptor. */
-    int ofd;            /* Terminal stdout file descriptor. */
-    char *buf;          /* Edited line buffer. */
-    size_t buflen;      /* Edited line buffer size. */
-    const char *prompt; /* Prompt to display. */
-    size_t plen;        /* Prompt length. */
-    size_t pos;         /* Current cursor position. */
-    size_t oldpos;      /* Previous refresh cursor position. */
-    size_t len;         /* Current edited line length. */
-    size_t cols;        /* Number of columns in terminal. */
-    size_t maxrows;     /* Maximum num of rows used so far (multiline mode) */
-    int history_index;  /* The history index we are currently editing. */
-};
-
-enum KEY_ACTION{
-	KEY_NULL = 0,	    /* NULL */
-	CTRL_A = 1,         /* Ctrl+a */
-	CTRL_B = 2,         /* Ctrl-b */
-	CTRL_C = 3,         /* Ctrl-c */
-	CTRL_D = 4,         /* Ctrl-d */
-	CTRL_E = 5,         /* Ctrl-e */
-	CTRL_F = 6,         /* Ctrl-f */
-	CTRL_H = 8,         /* Ctrl-h */
-	TAB = 9,            /* Tab */
-	CTRL_K = 11,        /* Ctrl+k */
-	CTRL_L = 12,        /* Ctrl+l */
-	ENTER = 13,         /* Enter */
-	CTRL_N = 14,        /* Ctrl-n */
-	CTRL_P = 16,        /* Ctrl-p */
-	CTRL_T = 20,        /* Ctrl-t */
-	CTRL_U = 21,        /* Ctrl+u */
-	CTRL_W = 23,        /* Ctrl+w */
-	ESC = 27,           /* Escape */
-	BACKSPACE =  127    /* Backspace */
-};
-
-static void linenoiseAtExit(void);
-int linenoiseHistoryAdd(const char *line);
-static void refreshLine(struct linenoiseState *l);
-
-/* Debugging macro. */
-#if 0
-FILE *lndebug_fp = NULL;
-#define lndebug(...) \
-    do { \
-        if (lndebug_fp == NULL) { \
-            lndebug_fp = fopen("/tmp/lndebug.txt","a"); \
-            fprintf(lndebug_fp, \
-            "[%d %d %d] p: %d, rows: %d, rpos: %d, max: %d, oldmax: %d\n", \
-            (int)l->len,(int)l->pos,(int)l->oldpos,plen,rows,rpos, \
-            (int)l->maxrows,old_rows); \
-        } \
-        fprintf(lndebug_fp, ", " __VA_ARGS__); \
-        fflush(lndebug_fp); \
-    } while (0)
-#else
-#define lndebug(fmt, ...)
-#endif
-
-/* ======================= Low level terminal handling ====================== */
-
-/* Enable "mask mode". When it is enabled, instead of the input that
- * the user is typing, the terminal will just display a corresponding
- * number of asterisks, like "****". This is useful for passwords and other
- * secrets that should not be displayed. */
-void linenoiseMaskModeEnable(void) {
-    maskmode = 1;
-}
-
-/* Disable mask mode. */
-void linenoiseMaskModeDisable(void) {
-    maskmode = 0;
-}
-
-/* Set if to use or not the multi line mode. */
-void linenoiseSetMultiLine(int ml) {
-    mlmode = ml;
-}
-
-/* Return true if the terminal name is in the list of terminals we know are
- * not able to understand basic escape sequences. */
-static int isUnsupportedTerm(void) {
-    char *term = getenv("TERM");
-    int j;
-
-    if (term == NULL) return 0;
-    for (j = 0; unsupported_term[j]; j++)
-        if (!strcasecmp(term,unsupported_term[j])) return 1;
-    return 0;
-}
-
-/* Raw mode: 1960 magic shit. */
-static int enableRawMode(int fd) {
-    struct termios raw;
-
-    if (!isatty(STDIN_FILENO)) goto fatal;
-    if (!atexit_registered) {
-        atexit(linenoiseAtExit);
-        atexit_registered = 1;
-    }
-    if (tcgetattr(fd,&orig_termios) == -1) goto fatal;
-
-    raw = orig_termios;  /* modify the original mode */
-    /* input modes: no break, no CR to NL, no parity check, no strip char,
-     * no start/stop output control. */
-    raw.c_iflag &= ~(BRKINT | ICRNL | INPCK | ISTRIP | IXON);
-    /* output modes - disable post processing */
-    raw.c_oflag &= ~(OPOST);
-    /* control modes - set 8 bit chars */
-    raw.c_cflag |= (CS8);
-    /* local modes - choing off, canonical off, no extended functions,
-     * no signal chars (^Z,^C) */
-    raw.c_lflag &= ~(ECHO | ICANON | IEXTEN | ISIG);
-    /* control chars - set return condition: min number of bytes and timer.
-     * We want read to return every single byte, without timeout. */
-    raw.c_cc[VMIN] = 1; raw.c_cc[VTIME] = 0; /* 1 byte, no timer */
-
-    /* put terminal in raw mode after flushing */
-    if (tcsetattr(fd,TCSAFLUSH,&raw) < 0) goto fatal;
-    rawmode = 1;
-    return 0;
-
-fatal:
-    errno = ENOTTY;
-    return -1;
-}
-
-static void disableRawMode(int fd) {
-    /* Don't even check the return value as it's too late. */
-    if (rawmode && tcsetattr(fd,TCSAFLUSH,&orig_termios) != -1)
-        rawmode = 0;
-}
-
-/* Use the ESC [6n escape sequence to query the horizontal cursor position
- * and return it. On error -1 is returned, on success the position of the
- * cursor. */
-static int getCursorPosition(int ifd, int ofd) {
-    char buf[32];
-    int cols, rows;
-    unsigned int i = 0;
-
-    /* Report cursor location */
-    if (write(ofd, "\x1b[6n", 4) != 4) return -1;
-
-    /* Read the response: ESC [ rows ; cols R */
-    while (i < sizeof(buf)-1) {
-        if (read(ifd,buf+i,1) != 1) break;
-        if (buf[i] == 'R') break;
-        i++;
-    }
-    buf[i] = '\0';
-
-    /* Parse it. */
-    if (buf[0] != ESC || buf[1] != '[') return -1;
-    if (sscanf(buf+2,"%d;%d",&rows,&cols) != 2) return -1;
-    return cols;
-}
-
-/* Try to get the number of columns in the current terminal, or assume 80
- * if it fails. */
-static int getColumns(int ifd, int ofd) {
-    struct winsize ws;
-
-    if (ioctl(1, TIOCGWINSZ, &ws) == -1 || ws.ws_col == 0) {
-        /* ioctl() failed. Try to query the terminal itself. */
-        int start, cols;
-
-        /* Get the initial position so we can restore it later. */
-        start = getCursorPosition(ifd,ofd);
-        if (start == -1) goto failed;
-
-        /* Go to right margin and get position. */
-        if (write(ofd,"\x1b[999C",6) != 6) goto failed;
-        cols = getCursorPosition(ifd,ofd);
-        if (cols == -1) goto failed;
-
-        /* Restore position. */
-        if (cols > start) {
-            char seq[32];
-            snprintf(seq,32,"\x1b[%dD",cols-start);
-            if (write(ofd,seq,strlen(seq)) == -1) {
-                /* Can't recover... */
-            }
-        }
-        return cols;
-    } else {
-        return ws.ws_col;
-    }
-
-failed:
-    return 80;
-}
-
-/* Clear the screen. Used to handle ctrl+l */
-void linenoiseClearScreen(void) {
-    if (write(STDOUT_FILENO,"\x1b[H\x1b[2J",7) <= 0) {
-        /* nothing to do, just to avoid warning. */
-    }
-}
-
-/* Beep, used for completion when there is nothing to complete or when all
- * the choices were already shown. */
-static void linenoiseBeep(void) {
-    fprintf(stderr, "\x7");
-    fflush(stderr);
-}
-
-/* ============================== Completion ================================ */
-
-/* Free a list of completion option populated by linenoiseAddCompletion(). */
-static void freeCompletions(linenoiseCompletions *lc) {
-    size_t i;
-    for (i = 0; i < lc->len; i++)
-        free(lc->cvec[i]);
-    if (lc->cvec != NULL)
-        free(lc->cvec);
-}
-
-/* This is an helper function for linenoiseEdit() and is called when the
- * user types the <tab> key in order to complete the string currently in the
- * input.
- *
- * The state of the editing is encapsulated into the pointed linenoiseState
- * structure as described in the structure definition. */
-static int completeLine(struct linenoiseState *ls) {
-    linenoiseCompletions lc = { 0, NULL };
-    int nread, nwritten;
-    char c = 0;
-
-    completionCallback(ls->buf,&lc);
-    if (lc.len == 0) {
-        linenoiseBeep();
-    } else {
-        size_t stop = 0, i = 0;
-
-        while(!stop) {
-            /* Show completion or original buffer */
-            if (i < lc.len) {
-                struct linenoiseState saved = *ls;
-
-                ls->len = ls->pos = strlen(lc.cvec[i]);
-                ls->buf = lc.cvec[i];
-                refreshLine(ls);
-                ls->len = saved.len;
-                ls->pos = saved.pos;
-                ls->buf = saved.buf;
-            } else {
-                refreshLine(ls);
-            }
-
-            nread = read(ls->ifd,&c,1);
-            if (nread <= 0) {
-                freeCompletions(&lc);
-                return -1;
-            }
-
-            switch(c) {
-                case 9: /* tab */
-                    i = (i+1) % (lc.len+1);
-                    if (i == lc.len) linenoiseBeep();
-                    break;
-                case 27: /* escape */
-                    /* Re-show original buffer */
-                    if (i < lc.len) refreshLine(ls);
-                    stop = 1;
-                    break;
-                default:
-                    /* Update buffer and return */
-                    if (i < lc.len) {
-                        nwritten = snprintf(ls->buf,ls->buflen,"%s",lc.cvec[i]);
-                        ls->len = ls->pos = nwritten;
-                    }
-                    stop = 1;
-                    break;
-            }
-        }
-    }
-
-    freeCompletions(&lc);
-    return c; /* Return last read character */
-}
-
-/* Register a callback function to be called for tab-completion. */
-void linenoiseSetCompletionCallback(linenoiseCompletionCallback *fn) {
-    completionCallback = fn;
-}
-
-/* Register a hits function to be called to show hits to the user at the
- * right of the prompt. */
-void linenoiseSetHintsCallback(linenoiseHintsCallback *fn) {
-    hintsCallback = fn;
-}
-
-/* Register a function to free the hints returned by the hints callback
- * registered with linenoiseSetHintsCallback(). */
-void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *fn) {
-    freeHintsCallback = fn;
-}
-
-/* This function is used by the callback function registered by the user
- * in order to add completion options given the input string when the
- * user typed <tab>. See the example.c source code for a very easy to
- * understand example. */
-void linenoiseAddCompletion(linenoiseCompletions *lc, const char *str) {
-    size_t len = strlen(str);
-    char *copy, **cvec;
-
-    copy = malloc(len+1);
-    if (copy == NULL) return;
-    memcpy(copy,str,len+1);
-    cvec = realloc(lc->cvec,sizeof(char*)*(lc->len+1));
-    if (cvec == NULL) {
-        free(copy);
-        return;
-    }
-    lc->cvec = cvec;
-    lc->cvec[lc->len++] = copy;
-}
-
-/* =========================== Line editing ================================= */
-
-/* We define a very simple "append buffer" structure, that is an heap
- * allocated string where we can append to. This is useful in order to
- * write all the escape sequences in a buffer and flush them to the standard
- * output in a single call, to avoid flickering effects. */
-struct abuf {
-    char *b;
-    int len;
-};
-
-static void abInit(struct abuf *ab) {
-    ab->b = NULL;
-    ab->len = 0;
-}
-
-static void abAppend(struct abuf *ab, const char *s, int len) {
-    char *new = realloc(ab->b,ab->len+len);
-
-    if (new == NULL) return;
-    memcpy(new+ab->len,s,len);
-    ab->b = new;
-    ab->len += len;
-}
-
-static void abFree(struct abuf *ab) {
-    free(ab->b);
-}
-
-/* Helper of refreshSingleLine() and refreshMultiLine() to show hints
- * to the right of the prompt. */
-void refreshShowHints(struct abuf *ab, struct linenoiseState *l, int plen) {
-    char seq[64];
-    if (hintsCallback && plen+l->len < l->cols) {
-        int color = -1, bold = 0;
-        char *hint = hintsCallback(l->buf,&color,&bold);
-        if (hint) {
-            int hintlen = strlen(hint);
-            int hintmaxlen = l->cols-(plen+l->len);
-            if (hintlen > hintmaxlen) hintlen = hintmaxlen;
-            if (bold == 1 && color == -1) color = 37;
-            if (color != -1 || bold != 0)
-                snprintf(seq,64,"\033[%d;%d;49m",bold,color);
-            else
-                seq[0] = '\0';
-            abAppend(ab,seq,strlen(seq));
-            abAppend(ab,hint,hintlen);
-            if (color != -1 || bold != 0)
-                abAppend(ab,"\033[0m",4);
-            /* Call the function to free the hint returned. */
-            if (freeHintsCallback) freeHintsCallback(hint);
-        }
-    }
-}
-
-/* Single line low level line refresh.
- *
- * Rewrite the currently edited line accordingly to the buffer content,
- * cursor position, and number of columns of the terminal. */
-static void refreshSingleLine(struct linenoiseState *l) {
-    char seq[64];
-    size_t plen = strlen(l->prompt);
-    int fd = l->ofd;
-    char *buf = l->buf;
-    size_t len = l->len;
-    size_t pos = l->pos;
-    struct abuf ab;
-
-    while((plen+pos) >= l->cols) {
-        buf++;
-        len--;
-        pos--;
-    }
-    while (plen+len > l->cols) {
-        len--;
-    }
-
-    abInit(&ab);
-    /* Cursor to left edge */
-    snprintf(seq,64,"\r");
-    abAppend(&ab,seq,strlen(seq));
-    /* Write the prompt and the current buffer content */
-    abAppend(&ab,l->prompt,strlen(l->prompt));
-    if (maskmode == 1) {
-        while (len--) abAppend(&ab,"*",1);
-    } else {
-        abAppend(&ab,buf,len);
-    }
-    /* Show hits if any. */
-    refreshShowHints(&ab,l,plen);
-    /* Erase to right */
-    snprintf(seq,64,"\x1b[0K");
-    abAppend(&ab,seq,strlen(seq));
-    /* Move cursor to original position. */
-    snprintf(seq,64,"\r\x1b[%dC", (int)(pos+plen));
-    abAppend(&ab,seq,strlen(seq));
-    if (write(fd,ab.b,ab.len) == -1) {} /* Can't recover from write error. */
-    abFree(&ab);
-}
-
-/* Multi line low level line refresh.
- *
- * Rewrite the currently edited line accordingly to the buffer content,
- * cursor position, and number of columns of the terminal. */
-static void refreshMultiLine(struct linenoiseState *l) {
-    char seq[64];
-    int plen = strlen(l->prompt);
-    int rows = (plen+l->len+l->cols-1)/l->cols; /* rows used by current buf. */
-    int rpos = (plen+l->oldpos+l->cols)/l->cols; /* cursor relative row. */
-    int rpos2; /* rpos after refresh. */
-    int col; /* colum position, zero-based. */
-    int old_rows = l->maxrows;
-    int fd = l->ofd, j;
-    struct abuf ab;
-
-    /* Update maxrows if needed. */
-    if (rows > (int)l->maxrows) l->maxrows = rows;
-
-    /* First step: clear all the lines used before. To do so start by
-     * going to the last row. */
-    abInit(&ab);
-    if (old_rows-rpos > 0) {
-        lndebug("go down %d", old_rows-rpos);
-        snprintf(seq,64,"\x1b[%dB", old_rows-rpos);
-        abAppend(&ab,seq,strlen(seq));
-    }
-
-    /* Now for every row clear it, go up. */
-    for (j = 0; j < old_rows-1; j++) {
-        lndebug("clear+up");
-        snprintf(seq,64,"\r\x1b[0K\x1b[1A");
-        abAppend(&ab,seq,strlen(seq));
-    }
-
-    /* Clean the top line. */
-    lndebug("clear");
-    snprintf(seq,64,"\r\x1b[0K");
-    abAppend(&ab,seq,strlen(seq));
-
-    /* Write the prompt and the current buffer content */
-    abAppend(&ab,l->prompt,strlen(l->prompt));
-    if (maskmode == 1) {
-        unsigned int i;
-        for (i = 0; i < l->len; i++) abAppend(&ab,"*",1);
-    } else {
-        abAppend(&ab,l->buf,l->len);
-    }
-
-    /* Show hits if any. */
-    refreshShowHints(&ab,l,plen);
-
-    /* If we are at the very end of the screen with our prompt, we need to
-     * emit a newline and move the prompt to the first column. */
-    if (l->pos &&
-        l->pos == l->len &&
-        (l->pos+plen) % l->cols == 0)
-    {
-        lndebug("<newline>");
-        abAppend(&ab,"\n",1);
-        snprintf(seq,64,"\r");
-        abAppend(&ab,seq,strlen(seq));
-        rows++;
-        if (rows > (int)l->maxrows) l->maxrows = rows;
-    }
-
-    /* Move cursor to right position. */
-    rpos2 = (plen+l->pos+l->cols)/l->cols; /* current cursor relative row. */
-    lndebug("rpos2 %d", rpos2);
-
-    /* Go up till we reach the expected position. */
-    if (rows-rpos2 > 0) {
-        lndebug("go-up %d", rows-rpos2);
-        snprintf(seq,64,"\x1b[%dA", rows-rpos2);
-        abAppend(&ab,seq,strlen(seq));
-    }
-
-    /* Set column. */
-    col = (plen+(int)l->pos) % (int)l->cols;
-    lndebug("set col %d", 1+col);
-    if (col)
-        snprintf(seq,64,"\r\x1b[%dC", col);
-    else
-        snprintf(seq,64,"\r");
-    abAppend(&ab,seq,strlen(seq));
-
-    lndebug("\n");
-    l->oldpos = l->pos;
-
-    if (write(fd,ab.b,ab.len) == -1) {} /* Can't recover from write error. */
-    abFree(&ab);
-}
-
-/* Calls the two low level functions refreshSingleLine() or
- * refreshMultiLine() according to the selected mode. */
-static void refreshLine(struct linenoiseState *l) {
-    if (mlmode)
-        refreshMultiLine(l);
-    else
-        refreshSingleLine(l);
-}
-
-/* Insert the character 'c' at cursor current position.
- *
- * On error writing to the terminal -1 is returned, otherwise 0. */
-int linenoiseEditInsert(struct linenoiseState *l, char c) {
-    if (l->len < l->buflen) {
-        if (l->len == l->pos) {
-            l->buf[l->pos] = c;
-            l->pos++;
-            l->len++;
-            l->buf[l->len] = '\0';
-            if ((!mlmode && l->plen+l->len < l->cols && !hintsCallback)) {
-                /* Avoid a full update of the line in the
-                 * trivial case. */
-                char d = (maskmode==1) ? '*' : c;
-                if (write(l->ofd,&d,1) == -1) return -1;
-            } else {
-                refreshLine(l);
-            }
-        } else {
-            memmove(l->buf+l->pos+1,l->buf+l->pos,l->len-l->pos);
-            l->buf[l->pos] = c;
-            l->len++;
-            l->pos++;
-            l->buf[l->len] = '\0';
-            refreshLine(l);
-        }
-    }
-    return 0;
-}
-
-/* Move cursor on the left. */
-void linenoiseEditMoveLeft(struct linenoiseState *l) {
-    if (l->pos > 0) {
-        l->pos--;
-        refreshLine(l);
-    }
-}
-
-/* Move cursor on the right. */
-void linenoiseEditMoveRight(struct linenoiseState *l) {
-    if (l->pos != l->len) {
-        l->pos++;
-        refreshLine(l);
-    }
-}
-
-/* Move cursor to the start of the line. */
-void linenoiseEditMoveHome(struct linenoiseState *l) {
-    if (l->pos != 0) {
-        l->pos = 0;
-        refreshLine(l);
-    }
-}
-
-/* Move cursor to the end of the line. */
-void linenoiseEditMoveEnd(struct linenoiseState *l) {
-    if (l->pos != l->len) {
-        l->pos = l->len;
-        refreshLine(l);
-    }
-}
-
-/* Substitute the currently edited line with the next or previous history
- * entry as specified by 'dir'. */
-#define LINENOISE_HISTORY_NEXT 0
-#define LINENOISE_HISTORY_PREV 1
-void linenoiseEditHistoryNext(struct linenoiseState *l, int dir) {
-    if (history_len > 1) {
-        /* Update the current history entry before to
-         * overwrite it with the next one. */
-        free(history[history_len - 1 - l->history_index]);
-        history[history_len - 1 - l->history_index] = strdup(l->buf);
-        /* Show the new entry */
-        l->history_index += (dir == LINENOISE_HISTORY_PREV) ? 1 : -1;
-        if (l->history_index < 0) {
-            l->history_index = 0;
-            return;
-        } else if (l->history_index >= history_len) {
-            l->history_index = history_len-1;
-            return;
-        }
-        strncpy(l->buf,history[history_len - 1 - l->history_index],l->buflen);
-        l->buf[l->buflen-1] = '\0';
-        l->len = l->pos = strlen(l->buf);
-        refreshLine(l);
-    }
-}
-
-/* Delete the character at the right of the cursor without altering the cursor
- * position. Basically this is what happens with the "Delete" keyboard key. */
-void linenoiseEditDelete(struct linenoiseState *l) {
-    if (l->len > 0 && l->pos < l->len) {
-        memmove(l->buf+l->pos,l->buf+l->pos+1,l->len-l->pos-1);
-        l->len--;
-        l->buf[l->len] = '\0';
-        refreshLine(l);
-    }
-}
-
-/* Backspace implementation. */
-void linenoiseEditBackspace(struct linenoiseState *l) {
-    if (l->pos > 0 && l->len > 0) {
-        memmove(l->buf+l->pos-1,l->buf+l->pos,l->len-l->pos);
-        l->pos--;
-        l->len--;
-        l->buf[l->len] = '\0';
-        refreshLine(l);
-    }
-}
-
-/* Delete the previous word, maintaining the cursor at the start of the
- * current word. */
-void linenoiseEditDeletePrevWord(struct linenoiseState *l) {
-    size_t old_pos = l->pos;
-    size_t diff;
-
-    while (l->pos > 0 && l->buf[l->pos-1] == ' ')
-        l->pos--;
-    while (l->pos > 0 && l->buf[l->pos-1] != ' ')
-        l->pos--;
-    diff = old_pos - l->pos;
-    memmove(l->buf+l->pos,l->buf+old_pos,l->len-old_pos+1);
-    l->len -= diff;
-    refreshLine(l);
-}
-
-/* This function is the core of the line editing capability of linenoise.
- * It expects 'fd' to be already in "raw mode" so that every key pressed
- * will be returned ASAP to read().
- *
- * The resulting string is put into 'buf' when the user type enter, or
- * when ctrl+d is typed.
- *
- * The function returns the length of the current buffer. */
-static int linenoiseEdit(int stdin_fd, int stdout_fd, char *buf, size_t buflen, const char *prompt)
-{
-    struct linenoiseState l;
-
-    /* Populate the linenoise state that we pass to functions implementing
-     * specific editing functionalities. */
-    l.ifd = stdin_fd;
-    l.ofd = stdout_fd;
-    l.buf = buf;
-    l.buflen = buflen;
-    l.prompt = prompt;
-    l.plen = strlen(prompt);
-    l.oldpos = l.pos = 0;
-    l.len = 0;
-    l.cols = getColumns(stdin_fd, stdout_fd);
-    l.maxrows = 0;
-    l.history_index = 0;
-
-    /* Buffer starts empty. */
-    l.buf[0] = '\0';
-    l.buflen--; /* Make sure there is always space for the nulterm */
-
-    /* The latest history entry is always our current buffer, that
-     * initially is just an empty string. */
-    linenoiseHistoryAdd("");
-
-    if (write(l.ofd,prompt,l.plen) == -1) return -1;
-    while(1) {
-        char c;
-        int nread;
-        char seq[3];
-
-        nread = read(l.ifd,&c,1);
-        if (nread <= 0) return l.len;
-
-        /* Only autocomplete when the callback is set. It returns < 0 when
-         * there was an error reading from fd. Otherwise it will return the
-         * character that should be handled next. */
-        if (c == 9 && completionCallback != NULL) {
-            c = completeLine(&l);
-            /* Return on errors */
-            if (c < 0) return l.len;
-            /* Read next character when 0 */
-            if (c == 0) continue;
-        }
-
-        switch(c) {
-        case ENTER:    /* enter */
-            history_len--;
-            free(history[history_len]);
-            if (mlmode) linenoiseEditMoveEnd(&l);
-            if (hintsCallback) {
-                /* Force a refresh without hints to leave the previous
-                 * line as the user typed it after a newline. */
-                linenoiseHintsCallback *hc = hintsCallback;
-                hintsCallback = NULL;
-                refreshLine(&l);
-                hintsCallback = hc;
-            }
-            return (int)l.len;
-        case CTRL_C:     /* ctrl-c */
-            errno = EAGAIN;
-            return -1;
-        case BACKSPACE:   /* backspace */
-        case 8:     /* ctrl-h */
-            linenoiseEditBackspace(&l);
-            break;
-        case CTRL_D:     /* ctrl-d, remove char at right of cursor, or if the
-                            line is empty, act as end-of-file. */
-            if (l.len > 0) {
-                linenoiseEditDelete(&l);
-            } else {
-                history_len--;
-                free(history[history_len]);
-                return -1;
-            }
-            break;
-        case CTRL_T:    /* ctrl-t, swaps current character with previous. */
-            if (l.pos > 0 && l.pos < l.len) {
-                int aux = buf[l.pos-1];
-                buf[l.pos-1] = buf[l.pos];
-                buf[l.pos] = aux;
-                if (l.pos != l.len-1) l.pos++;
-                refreshLine(&l);
-            }
-            break;
-        case CTRL_B:     /* ctrl-b */
-            linenoiseEditMoveLeft(&l);
-            break;
-        case CTRL_F:     /* ctrl-f */
-            linenoiseEditMoveRight(&l);
-            break;
-        case CTRL_P:    /* ctrl-p */
-            linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_PREV);
-            break;
-        case CTRL_N:    /* ctrl-n */
-            linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_NEXT);
-            break;
-        case ESC:    /* escape sequence */
-            /* Read the next two bytes representing the escape sequence.
-             * Use two calls to handle slow terminals returning the two
-             * chars at different times. */
-            if (read(l.ifd,seq,1) == -1) break;
-            if (read(l.ifd,seq+1,1) == -1) break;
-
-            /* ESC [ sequences. */
-            if (seq[0] == '[') {
-                if (seq[1] >= '0' && seq[1] <= '9') {
-                    /* Extended escape, read additional byte. */
-                    if (read(l.ifd,seq+2,1) == -1) break;
-                    if (seq[2] == '~') {
-                        switch(seq[1]) {
-                        case '3': /* Delete key. */
-                            linenoiseEditDelete(&l);
-                            break;
-                        }
-                    }
-                } else {
-                    switch(seq[1]) {
-                    case 'A': /* Up */
-                        linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_PREV);
-                        break;
-                    case 'B': /* Down */
-                        linenoiseEditHistoryNext(&l, LINENOISE_HISTORY_NEXT);
-                        break;
-                    case 'C': /* Right */
-                        linenoiseEditMoveRight(&l);
-                        break;
-                    case 'D': /* Left */
-                        linenoiseEditMoveLeft(&l);
-                        break;
-                    case 'H': /* Home */
-                        linenoiseEditMoveHome(&l);
-                        break;
-                    case 'F': /* End*/
-                        linenoiseEditMoveEnd(&l);
-                        break;
-                    }
-                }
-            }
-
-            /* ESC O sequences. */
-            else if (seq[0] == 'O') {
-                switch(seq[1]) {
-                case 'H': /* Home */
-                    linenoiseEditMoveHome(&l);
-                    break;
-                case 'F': /* End*/
-                    linenoiseEditMoveEnd(&l);
-                    break;
-                }
-            }
-            break;
-        default:
-            if (linenoiseEditInsert(&l,c)) return -1;
-            break;
-        case CTRL_U: /* Ctrl+u, delete the whole line. */
-            buf[0] = '\0';
-            l.pos = l.len = 0;
-            refreshLine(&l);
-            break;
-        case CTRL_K: /* Ctrl+k, delete from current to end of line. */
-            buf[l.pos] = '\0';
-            l.len = l.pos;
-            refreshLine(&l);
-            break;
-        case CTRL_A: /* Ctrl+a, go to the start of the line */
-            linenoiseEditMoveHome(&l);
-            break;
-        case CTRL_E: /* ctrl+e, go to the end of the line */
-            linenoiseEditMoveEnd(&l);
-            break;
-        case CTRL_L: /* ctrl+l, clear screen */
-            linenoiseClearScreen();
-            refreshLine(&l);
-            break;
-        case CTRL_W: /* ctrl+w, delete previous word */
-            linenoiseEditDeletePrevWord(&l);
-            break;
-        }
-    }
-    return l.len;
-}
-
-/* This special mode is used by linenoise in order to print scan codes
- * on screen for debugging / development purposes. It is implemented
- * by the linenoise_example program using the --keycodes option. */
-void linenoisePrintKeyCodes(void) {
-    char quit[4];
-
-    printf("Linenoise key codes debugging mode.\n"
-            "Press keys to see scan codes. Type 'quit' at any time to exit.\n");
-    if (enableRawMode(STDIN_FILENO) == -1) return;
-    memset(quit,' ',4);
-    while(1) {
-        char c;
-        int nread;
-
-        nread = read(STDIN_FILENO,&c,1);
-        if (nread <= 0) continue;
-        memmove(quit,quit+1,sizeof(quit)-1); /* shift string to left. */
-        quit[sizeof(quit)-1] = c; /* Insert current char on the right. */
-        if (memcmp(quit,"quit",sizeof(quit)) == 0) break;
-
-        printf("'%c' %02x (%d) (type quit to exit)\n",
-            isprint(c) ? c : '?', (int)c, (int)c);
-        printf("\r"); /* Go left edge manually, we are in raw mode. */
-        fflush(stdout);
-    }
-    disableRawMode(STDIN_FILENO);
-}
-
-/* This function calls the line editing function linenoiseEdit() using
- * the STDIN file descriptor set in raw mode. */
-static int linenoiseRaw(char *buf, size_t buflen, const char *prompt) {
-    int count;
-
-    if (buflen == 0) {
-        errno = EINVAL;
-        return -1;
-    }
-
-    if (enableRawMode(STDIN_FILENO) == -1) return -1;
-    count = linenoiseEdit(STDIN_FILENO, STDOUT_FILENO, buf, buflen, prompt);
-    disableRawMode(STDIN_FILENO);
-    printf("\n");
-    return count;
-}
-
-/* This function is called when linenoise() is called with the standard
- * input file descriptor not attached to a TTY. So for example when the
- * program using linenoise is called in pipe or with a file redirected
- * to its standard input. In this case, we want to be able to return the
- * line regardless of its length (by default we are limited to 4k). */
-static char *linenoiseNoTTY(void) {
-    char *line = NULL;
-    size_t len = 0, maxlen = 0;
-
-    while(1) {
-        if (len == maxlen) {
-            if (maxlen == 0) maxlen = 16;
-            maxlen *= 2;
-            char *oldval = line;
-            line = realloc(line,maxlen);
-            if (line == NULL) {
-                if (oldval) free(oldval);
-                return NULL;
-            }
-        }
-        int c = fgetc(stdin);
-        if (c == EOF || c == '\n') {
-            if (c == EOF && len == 0) {
-                free(line);
-                return NULL;
-            } else {
-                line[len] = '\0';
-                return line;
-            }
-        } else {
-            line[len] = c;
-            len++;
-        }
-    }
-}
-
-/* The high level function that is the main API of the linenoise library.
- * This function checks if the terminal has basic capabilities, just checking
- * for a blacklist of stupid terminals, and later either calls the line
- * editing function or uses dummy fgets() so that you will be able to type
- * something even in the most desperate of the conditions. */
-char *linenoise(const char *prompt) {
-    char buf[LINENOISE_MAX_LINE];
-    int count;
-
-    if (!isatty(STDIN_FILENO)) {
-        /* Not a tty: read from file / pipe. In this mode we don't want any
-         * limit to the line size, so we call a function to handle that. */
-        return linenoiseNoTTY();
-    } else if (isUnsupportedTerm()) {
-        size_t len;
-
-        printf("%s",prompt);
-        fflush(stdout);
-        if (fgets(buf,LINENOISE_MAX_LINE,stdin) == NULL) return NULL;
-        len = strlen(buf);
-        while(len && (buf[len-1] == '\n' || buf[len-1] == '\r')) {
-            len--;
-            buf[len] = '\0';
-        }
-        return strdup(buf);
-    } else {
-        count = linenoiseRaw(buf,LINENOISE_MAX_LINE,prompt);
-        if (count == -1) return NULL;
-        return strdup(buf);
-    }
-}
-
-/* This is just a wrapper the user may want to call in order to make sure
- * the linenoise returned buffer is freed with the same allocator it was
- * created with. Useful when the main program is using an alternative
- * allocator. */
-void linenoiseFree(void *ptr) {
-    free(ptr);
-}
-
-/* ================================ History ================================= */
-
-/* Free the history, but does not reset it. Only used when we have to
- * exit() to avoid memory leaks are reported by valgrind & co. */
-static void freeHistory(void) {
-    if (history) {
-        int j;
-
-        for (j = 0; j < history_len; j++)
-            free(history[j]);
-        free(history);
-    }
-}
-
-/* At exit we'll try to fix the terminal to the initial conditions. */
-static void linenoiseAtExit(void) {
-    disableRawMode(STDIN_FILENO);
-    freeHistory();
-}
-
-/* This is the API call to add a new entry in the linenoise history.
- * It uses a fixed array of char pointers that are shifted (memmoved)
- * when the history max length is reached in order to remove the older
- * entry and make room for the new one, so it is not exactly suitable for huge
- * histories, but will work well for a few hundred of entries.
- *
- * Using a circular buffer is smarter, but a bit more complex to handle. */
-int linenoiseHistoryAdd(const char *line) {
-    char *linecopy;
-
-    if (history_max_len == 0) return 0;
-
-    /* Initialization on first call. */
-    if (history == NULL) {
-        history = malloc(sizeof(char*)*history_max_len);
-        if (history == NULL) return 0;
-        memset(history,0,(sizeof(char*)*history_max_len));
-    }
-
-    /* Don't add duplicated lines. */
-    if (history_len && !strcmp(history[history_len-1], line)) return 0;
-
-    /* Add an heap allocated copy of the line in the history.
-     * If we reached the max length, remove the older line. */
-    linecopy = strdup(line);
-    if (!linecopy) return 0;
-    if (history_len == history_max_len) {
-        free(history[0]);
-        memmove(history,history+1,sizeof(char*)*(history_max_len-1));
-        history_len--;
-    }
-    history[history_len] = linecopy;
-    history_len++;
-    return 1;
-}
-
-/* Set the maximum length for the history. This function can be called even
- * if there is already some history, the function will make sure to retain
- * just the latest 'len' elements if the new history length value is smaller
- * than the amount of items already inside the history. */
-int linenoiseHistorySetMaxLen(int len) {
-    char **new;
-
-    if (len < 1) return 0;
-    if (history) {
-        int tocopy = history_len;
-
-        new = malloc(sizeof(char*)*len);
-        if (new == NULL) return 0;
-
-        /* If we can't copy everything, free the elements we'll not use. */
-        if (len < tocopy) {
-            int j;
-
-            for (j = 0; j < tocopy-len; j++) free(history[j]);
-            tocopy = len;
-        }
-        memset(new,0,sizeof(char*)*len);
-        memcpy(new,history+(history_len-tocopy), sizeof(char*)*tocopy);
-        free(history);
-        history = new;
-    }
-    history_max_len = len;
-    if (history_len > history_max_len)
-        history_len = history_max_len;
-    return 1;
-}
-
-/* Save the history in the specified file. On success 0 is returned
- * otherwise -1 is returned. */
-int linenoiseHistorySave(const char *filename) {
-    mode_t old_umask = umask(S_IXUSR|S_IRWXG|S_IRWXO);
-    FILE *fp;
-    int j;
-
-    fp = fopen(filename,"w");
-    umask(old_umask);
-    if (fp == NULL) return -1;
-    chmod(filename,S_IRUSR|S_IWUSR);
-    for (j = 0; j < history_len; j++)
-        fprintf(fp,"%s\n",history[j]);
-    fclose(fp);
-    return 0;
-}
-
-/* Load the history from the specified file. If the file does not exist
- * zero is returned and no operation is performed.
- *
- * If the file exists and the operation succeeded 0 is returned, otherwise
- * on error -1 is returned. */
-int linenoiseHistoryLoad(const char *filename) {
-    FILE *fp = fopen(filename,"r");
-    char buf[LINENOISE_MAX_LINE];
-
-    if (fp == NULL) return -1;
-
-    while (fgets(buf,LINENOISE_MAX_LINE,fp) != NULL) {
-        char *p;
-
-        p = strchr(buf,'\r');
-        if (!p) p = strchr(buf,'\n');
-        if (p) *p = '\0';
-        linenoiseHistoryAdd(buf);
-    }
-    fclose(fp);
-    return 0;
-}
diff --git a/redis-stable/deps/linenoise/linenoise.h b/redis-stable/deps/linenoise/linenoise.h
deleted file mode 100644
index 6dfee73b..00000000
--- a/redis-stable/deps/linenoise/linenoise.h
+++ /dev/null
@@ -1,75 +0,0 @@
-/* linenoise.h -- VERSION 1.0
- *
- * Guerrilla line editing library against the idea that a line editing lib
- * needs to be 20,000 lines of C code.
- *
- * See linenoise.c for more information.
- *
- * ------------------------------------------------------------------------
- *
- * Copyright (c) 2010-2014, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2010-2013, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *  *  Redistributions of source code must retain the above copyright
- *     notice, this list of conditions and the following disclaimer.
- *
- *  *  Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __LINENOISE_H
-#define __LINENOISE_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct linenoiseCompletions {
-  size_t len;
-  char **cvec;
-} linenoiseCompletions;
-
-typedef void(linenoiseCompletionCallback)(const char *, linenoiseCompletions *);
-typedef char*(linenoiseHintsCallback)(const char *, int *color, int *bold);
-typedef void(linenoiseFreeHintsCallback)(void *);
-void linenoiseSetCompletionCallback(linenoiseCompletionCallback *);
-void linenoiseSetHintsCallback(linenoiseHintsCallback *);
-void linenoiseSetFreeHintsCallback(linenoiseFreeHintsCallback *);
-void linenoiseAddCompletion(linenoiseCompletions *, const char *);
-
-char *linenoise(const char *prompt);
-void linenoiseFree(void *ptr);
-int linenoiseHistoryAdd(const char *line);
-int linenoiseHistorySetMaxLen(int len);
-int linenoiseHistorySave(const char *filename);
-int linenoiseHistoryLoad(const char *filename);
-void linenoiseClearScreen(void);
-void linenoiseSetMultiLine(int ml);
-void linenoisePrintKeyCodes(void);
-void linenoiseMaskModeEnable(void);
-void linenoiseMaskModeDisable(void);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* __LINENOISE_H */
diff --git a/redis-stable/deps/lua/COPYRIGHT b/redis-stable/deps/lua/COPYRIGHT
deleted file mode 100644
index a8602680..00000000
--- a/redis-stable/deps/lua/COPYRIGHT
+++ /dev/null
@@ -1,34 +0,0 @@
-Lua License
------------
-
-Lua is licensed under the terms of the MIT license reproduced below.
-This means that Lua is free software and can be used for both academic
-and commercial purposes at absolutely no cost.
-
-For details and rationale, see http://www.lua.org/license.html .
-
-===============================================================================
-
-Copyright (C) 1994-2012 Lua.org, PUC-Rio.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
-===============================================================================
-
-(end of COPYRIGHT)
diff --git a/redis-stable/deps/lua/HISTORY b/redis-stable/deps/lua/HISTORY
deleted file mode 100644
index ce0c95bc..00000000
--- a/redis-stable/deps/lua/HISTORY
+++ /dev/null
@@ -1,183 +0,0 @@
-HISTORY for Lua 5.1
-
-* Changes from version 5.0 to 5.1
-  -------------------------------
-  Language:
-  + new module system.
-  + new semantics for control variables of fors.
-  + new semantics for setn/getn.
-  + new syntax/semantics for varargs.
-  + new long strings and comments.
-  + new `mod' operator (`%')
-  + new length operator #t
-  + metatables for all types
-  API:
-  + new functions: lua_createtable, lua_get(set)field, lua_push(to)integer.
-  + user supplies memory allocator (lua_open becomes lua_newstate).
-  + luaopen_* functions must be called through Lua.
-  Implementation:
-  + new configuration scheme via luaconf.h.
-  + incremental garbage collection.
-  + better handling of end-of-line in the lexer.
-  + fully reentrant parser (new Lua function `load')
-  + better support for 64-bit machines.
-  + native loadlib support for Mac OS X.
-  + standard distribution in only one library (lualib.a merged into lua.a)
-
-* Changes from version 4.0 to 5.0
-  -------------------------------
-  Language:
-  + lexical scoping.
-  + Lua coroutines.
-  + standard libraries now packaged in tables.
-  + tags replaced by metatables and tag methods replaced by metamethods,
-    stored in metatables.
-  + proper tail calls.
-  + each function can have its own global table, which can be shared.
-  + new __newindex metamethod, called when we insert a new key into a table.
-  + new block comments: --[[ ... ]].
-  + new generic for.
-  + new weak tables.
-  + new boolean type.
-  + new syntax "local function".
-  + (f()) returns the first value returned by f.
-  + {f()} fills a table with all values returned by f.
-  + \n ignored in [[\n .
-  + fixed and-or priorities.
-  + more general syntax for function definition (e.g. function a.x.y:f()...end).
-  + more general syntax for function calls (e.g. (print or write)(9)).
-  + new functions (time/date, tmpfile, unpack, require, load*, etc.).
-  API:
-  + chunks are loaded by using lua_load; new luaL_loadfile and luaL_loadbuffer.
-  + introduced lightweight userdata, a simple "void*" without a metatable.
-  + new error handling protocol: the core no longer prints error messages;
-    all errors are reported to the caller on the stack.
-  + new lua_atpanic for host cleanup.
-  + new, signal-safe, hook scheme.
-  Implementation:
-  + new license: MIT.
-  + new, faster, register-based virtual machine.
-  + support for external multithreading and coroutines.
-  + new and consistent error message format.
-  + the core no longer needs "stdio.h" for anything (except for a single
-    use of sprintf to convert numbers to strings).
-  + lua.c now runs the environment variable LUA_INIT, if present. It can
-    be "@filename", to run a file, or the chunk itself.
-  + support for user extensions in lua.c.
-    sample implementation given for command line editing.
-  + new dynamic loading library, active by default on several platforms.
-  + safe garbage-collector metamethods.
-  + precompiled bytecodes checked for integrity (secure binary dostring).
-  + strings are fully aligned.
-  + position capture in string.find.
-  + read('*l') can read lines with embedded zeros.
-
-* Changes from version 3.2 to 4.0
-  -------------------------------
-  Language:
-  + new "break" and "for" statements (both numerical and for tables).
-  + uniform treatment of globals: globals are now stored in a Lua table.
-  + improved error messages.
-  + no more '$debug': full speed *and* full debug information.
-  + new read form: read(N) for next N bytes.
-  + general read patterns now deprecated.
-    (still available with -DCOMPAT_READPATTERNS.)
-  + all return values are passed as arguments for the last function
-    (old semantics still available with -DLUA_COMPAT_ARGRET)
-  + garbage collection tag methods for tables now deprecated.
-  + there is now only one tag method for order.
-  API:
-  + New API: fully re-entrant, simpler, and more efficient.
-  + New debug API.
-  Implementation:
-  + faster than ever: cleaner virtual machine and new hashing algorithm.
-  + non-recursive garbage-collector algorithm.
-  + reduced memory usage for programs with many strings.
-  + improved treatment for memory allocation errors.
-  + improved support for 16-bit machines (we hope).
-  + code now compiles unmodified as both ANSI C and C++.
-  + numbers in bases other than 10 are converted using strtoul.
-  + new -f option in Lua to support #! scripts.
-  + luac can now combine text and binaries.
-
-* Changes from version 3.1 to 3.2
-  -------------------------------
-  + redirected all output in Lua's core to _ERRORMESSAGE and _ALERT.
-  + increased limit on the number of constants and globals per function
-    (from 2^16 to 2^24).
-  + debugging info (lua_debug and hooks) moved into lua_state and new API
-    functions provided to get and set this info.
-  + new debug lib gives full debugging access within Lua.
-  + new table functions "foreachi", "sort", "tinsert", "tremove", "getn".
-  + new io functions "flush", "seek".
-
-* Changes from version 3.0 to 3.1
-  -------------------------------
-  + NEW FEATURE: anonymous functions with closures (via "upvalues").
-  + new syntax:
-    - local variables in chunks.
-    - better scope control with DO block END.
-    - constructors can now be also written: { record-part; list-part }.
-    - more general syntax for function calls and lvalues, e.g.:
-      f(x).y=1
-      o:f(x,y):g(z)
-      f"string" is sugar for f("string")
-  + strings may now contain arbitrary binary data (e.g., embedded zeros).
-  + major code re-organization and clean-up; reduced module interdependecies.
-  + no arbitrary limits on the total number of constants and globals.
-  + support for multiple global contexts.
-  + better syntax error messages.
-  + new traversal functions "foreach" and "foreachvar".
-  + the default for numbers is now double.
-    changing it to use floats or longs is easy.
-  + complete debug information stored in pre-compiled chunks.
-  + sample interpreter now prompts user when run interactively, and also
-    handles control-C interruptions gracefully.
-
-* Changes from version 2.5 to 3.0
-  -------------------------------
-  + NEW CONCEPT: "tag methods".
-    Tag methods replace fallbacks as the meta-mechanism for extending the
-    semantics of Lua. Whereas fallbacks had a global nature, tag methods
-    work on objects having the same tag (e.g., groups of tables).
-    Existing code that uses fallbacks should work without change.
-  + new, general syntax for constructors {[exp] = exp, ... }.
-  + support for handling variable number of arguments in functions (varargs).
-  + support for conditional compilation ($if ... $else ... $end).
-  + cleaner semantics in API simplifies host code.
-  + better support for writing libraries (auxlib.h).
-  + better type checking and error messages in the standard library.
-  + luac can now also undump.
-
-* Changes from version 2.4 to 2.5
-  -------------------------------
-  + io and string libraries are now based on pattern matching;
-    the old libraries are still available for compatibility
-  + dofile and dostring can now return values (via return statement)
-  + better support for 16- and 64-bit machines
-  + expanded documentation, with more examples
-
-* Changes from version 2.2 to 2.4
-  -------------------------------
-  + external compiler creates portable binary files that can be loaded faster
-  + interface for debugging and profiling
-  + new "getglobal" fallback
-  + new functions for handling references to Lua objects
-  + new functions in standard lib
-  + only one copy of each string is stored
-  + expanded documentation, with more examples
-
-* Changes from version 2.1 to 2.2
-  -------------------------------
-  + functions now may be declared with any "lvalue" as a name
-  + garbage collection of functions
-  + support for pipes
-
-* Changes from version 1.1 to 2.1
-  -------------------------------
-  + object-oriented support
-  + fallbacks
-  + simplified syntax for tables
-  + many internal improvements
-
-(end of HISTORY)
diff --git a/redis-stable/deps/lua/INSTALL b/redis-stable/deps/lua/INSTALL
deleted file mode 100644
index 17eb8aee..00000000
--- a/redis-stable/deps/lua/INSTALL
+++ /dev/null
@@ -1,99 +0,0 @@
-INSTALL for Lua 5.1
-
-* Building Lua
-  ------------
-  Lua is built in the src directory, but the build process can be
-  controlled from the top-level Makefile.
-
-  Building Lua on Unix systems should be very easy. First do "make" and
-  see if your platform is listed. If so, just do "make xxx", where xxx
-  is your platform name. The platforms currently supported are:
-    aix ansi bsd freebsd generic linux macosx mingw posix solaris
-
-  If your platform is not listed, try the closest one or posix, generic,
-  ansi, in this order.
-
-  See below for customization instructions and for instructions on how
-  to build with other Windows compilers.
-
-  If you want to check that Lua has been built correctly, do "make test"
-  after building Lua. Also, have a look at the example programs in test.
-
-* Installing Lua
-  --------------
-  Once you have built Lua, you may want to install it in an official
-  place in your system. In this case, do "make install". The official
-  place and the way to install files are defined in Makefile. You must
-  have the right permissions to install files.
-
-  If you want to build and install Lua in one step, do "make xxx install",
-  where xxx is your platform name.
-
-  If you want to install Lua locally, then do "make local". This will
-  create directories bin, include, lib, man, and install Lua there as
-  follows:
-
-    bin:	lua luac
-    include:	lua.h luaconf.h lualib.h lauxlib.h lua.hpp
-    lib:	liblua.a
-    man/man1:	lua.1 luac.1
-
-  These are the only directories you need for development.
-
-  There are man pages for lua and luac, in both nroff and html, and a
-  reference manual in html in doc, some sample code in test, and some
-  useful stuff in etc. You don't need these directories for development.
-
-  If you want to install Lua locally, but in some other directory, do
-  "make install INSTALL_TOP=xxx", where xxx is your chosen directory.
-
-  See below for instructions for Windows and other systems.
-
-* Customization
-  -------------
-  Three things can be customized by editing a file:
-    - Where and how to install Lua -- edit Makefile.
-    - How to build Lua -- edit src/Makefile.
-    - Lua features -- edit src/luaconf.h.
-
-  You don't actually need to edit the Makefiles because you may set the
-  relevant variables when invoking make.
-
-  On the other hand, if you need to select some Lua features, you'll need
-  to edit src/luaconf.h. The edited file will be the one installed, and
-  it will be used by any Lua clients that you build, to ensure consistency.
-
-  We strongly recommend that you enable dynamic loading. This is done
-  automatically for all platforms listed above that have this feature
-  (and also Windows). See src/luaconf.h and also src/Makefile.
-
-* Building Lua on Windows and other systems
-  -----------------------------------------
-  If you're not using the usual Unix tools, then the instructions for
-  building Lua depend on the compiler you use. You'll need to create
-  projects (or whatever your compiler uses) for building the library,
-  the interpreter, and the compiler, as follows:
-
-  library:	lapi.c lcode.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c
-		lmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c
-		ltable.c ltm.c lundump.c lvm.c lzio.c
-		lauxlib.c lbaselib.c ldblib.c liolib.c lmathlib.c loslib.c
-		ltablib.c lstrlib.c loadlib.c linit.c
-
-  interpreter:	library, lua.c
-
-  compiler:	library, luac.c print.c
-
-  If you use Visual Studio .NET, you can use etc/luavs.bat in its
-  "Command Prompt".
-
-  If all you want is to build the Lua interpreter, you may put all .c files
-  in a single project, except for luac.c and print.c. Or just use etc/all.c.
-
-  To use Lua as a library in your own programs, you'll need to know how to
-  create and use libraries with your compiler.
-
-  As mentioned above, you may edit luaconf.h to select some features before
-  building Lua.
-
-(end of INSTALL)
diff --git a/redis-stable/deps/lua/Makefile b/redis-stable/deps/lua/Makefile
deleted file mode 100644
index 209a1324..00000000
--- a/redis-stable/deps/lua/Makefile
+++ /dev/null
@@ -1,128 +0,0 @@
-# makefile for installing Lua
-# see INSTALL for installation instructions
-# see src/Makefile and src/luaconf.h for further customization
-
-# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
-
-# Your platform. See PLATS for possible values.
-PLAT= none
-
-# Where to install. The installation starts in the src and doc directories,
-# so take care if INSTALL_TOP is not an absolute path.
-INSTALL_TOP= /usr/local
-INSTALL_BIN= $(INSTALL_TOP)/bin
-INSTALL_INC= $(INSTALL_TOP)/include
-INSTALL_LIB= $(INSTALL_TOP)/lib
-INSTALL_MAN= $(INSTALL_TOP)/man/man1
-#
-# You probably want to make INSTALL_LMOD and INSTALL_CMOD consistent with
-# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h (and also with etc/lua.pc).
-INSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V
-INSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V
-
-# How to install. If your install program does not support "-p", then you
-# may have to run ranlib on the installed liblua.a (do "make ranlib").
-INSTALL= install -p
-INSTALL_EXEC= $(INSTALL) -m 0755
-INSTALL_DATA= $(INSTALL) -m 0644
-#
-# If you don't have install you can use cp instead.
-# INSTALL= cp -p
-# INSTALL_EXEC= $(INSTALL)
-# INSTALL_DATA= $(INSTALL)
-
-# Utilities.
-MKDIR= mkdir -p
-RANLIB= ranlib
-
-# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
-
-# Convenience platforms targets.
-PLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris
-
-# What to install.
-TO_BIN= lua luac
-TO_INC= lua.h luaconf.h lualib.h lauxlib.h ../etc/lua.hpp
-TO_LIB= liblua.a
-TO_MAN= lua.1 luac.1
-
-# Lua version and release.
-V= 5.1
-R= 5.1.5
-
-all:	$(PLAT)
-
-$(PLATS) clean:
-	cd src && $(MAKE) $@
-
-test:	dummy
-	src/lua test/hello.lua
-
-install: dummy
-	cd src && $(MKDIR) $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN) $(INSTALL_LMOD) $(INSTALL_CMOD)
-	cd src && $(INSTALL_EXEC) $(TO_BIN) $(INSTALL_BIN)
-	cd src && $(INSTALL_DATA) $(TO_INC) $(INSTALL_INC)
-	cd src && $(INSTALL_DATA) $(TO_LIB) $(INSTALL_LIB)
-	cd doc && $(INSTALL_DATA) $(TO_MAN) $(INSTALL_MAN)
-
-ranlib:
-	cd src && cd $(INSTALL_LIB) && $(RANLIB) $(TO_LIB)
-
-local:
-	$(MAKE) install INSTALL_TOP=..
-
-none:
-	@echo "Please do"
-	@echo "   make PLATFORM"
-	@echo "where PLATFORM is one of these:"
-	@echo "   $(PLATS)"
-	@echo "See INSTALL for complete instructions."
-
-# make may get confused with test/ and INSTALL in a case-insensitive OS
-dummy:
-
-# echo config parameters
-echo:
-	@echo ""
-	@echo "These are the parameters currently set in src/Makefile to build Lua $R:"
-	@echo ""
-	@cd src && $(MAKE) -s echo
-	@echo ""
-	@echo "These are the parameters currently set in Makefile to install Lua $R:"
-	@echo ""
-	@echo "PLAT = $(PLAT)"
-	@echo "INSTALL_TOP = $(INSTALL_TOP)"
-	@echo "INSTALL_BIN = $(INSTALL_BIN)"
-	@echo "INSTALL_INC = $(INSTALL_INC)"
-	@echo "INSTALL_LIB = $(INSTALL_LIB)"
-	@echo "INSTALL_MAN = $(INSTALL_MAN)"
-	@echo "INSTALL_LMOD = $(INSTALL_LMOD)"
-	@echo "INSTALL_CMOD = $(INSTALL_CMOD)"
-	@echo "INSTALL_EXEC = $(INSTALL_EXEC)"
-	@echo "INSTALL_DATA = $(INSTALL_DATA)"
-	@echo ""
-	@echo "See also src/luaconf.h ."
-	@echo ""
-
-# echo private config parameters
-pecho:
-	@echo "V = $(V)"
-	@echo "R = $(R)"
-	@echo "TO_BIN = $(TO_BIN)"
-	@echo "TO_INC = $(TO_INC)"
-	@echo "TO_LIB = $(TO_LIB)"
-	@echo "TO_MAN = $(TO_MAN)"
-
-# echo config parameters as Lua code
-# uncomment the last sed expression if you want nil instead of empty strings
-lecho:
-	@echo "-- installation parameters for Lua $R"
-	@echo "VERSION = '$V'"
-	@echo "RELEASE = '$R'"
-	@$(MAKE) echo | grep = | sed -e 's/= /= "/' -e 's/$$/"/' #-e 's/""/nil/'
-	@echo "-- EOF"
-
-# list targets that do not create files (but not all makes understand .PHONY)
-.PHONY: all $(PLATS) clean test install local none dummy echo pecho lecho
-
-# (end of Makefile)
diff --git a/redis-stable/deps/lua/README b/redis-stable/deps/lua/README
deleted file mode 100644
index 11b4dff7..00000000
--- a/redis-stable/deps/lua/README
+++ /dev/null
@@ -1,37 +0,0 @@
-README for Lua 5.1
-
-See INSTALL for installation instructions.
-See HISTORY for a summary of changes since the last released version.
-
-* What is Lua?
-  ------------
-  Lua is a powerful, light-weight programming language designed for extending
-  applications. Lua is also frequently used as a general-purpose, stand-alone
-  language. Lua is free software.
-
-  For complete information, visit Lua's web site at http://www.lua.org/ .
-  For an executive summary, see http://www.lua.org/about.html .
-
-  Lua has been used in many different projects around the world.
-  For a short list, see http://www.lua.org/uses.html .
-
-* Availability
-  ------------
-  Lua is freely available for both academic and commercial purposes.
-  See COPYRIGHT and http://www.lua.org/license.html for details.
-  Lua can be downloaded at http://www.lua.org/download.html .
-
-* Installation
-  ------------
-  Lua is implemented in pure ANSI C, and compiles unmodified in all known
-  platforms that have an ANSI C compiler. In most Unix-like platforms, simply
-  do "make" with a suitable target. See INSTALL for detailed instructions.
-
-* Origin
-  ------
-  Lua is developed at Lua.org, a laboratory of the Department of Computer
-  Science of PUC-Rio (the Pontifical Catholic University of Rio de Janeiro
-  in Brazil).
-  For more information about the authors, see http://www.lua.org/authors.html .
-
-(end of README)
diff --git a/redis-stable/deps/lua/doc/contents.html b/redis-stable/deps/lua/doc/contents.html
deleted file mode 100644
index 3d83da98..00000000
--- a/redis-stable/deps/lua/doc/contents.html
+++ /dev/null
@@ -1,497 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<HTML>
-<HEAD>
-<TITLE>Lua 5.1 Reference Manual - contents</TITLE>
-<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
-<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=utf-8">
-<STYLE TYPE="text/css">
-ul {
-	list-style-type: none ;
-}
-</STYLE>
-</HEAD>
-
-<BODY>
-
-<HR>
-<H1>
-<A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="" BORDER=0></A>
-Lua 5.1 Reference Manual
-</H1>
-
-<P>
-The reference manual is the official definition of the Lua language.
-For a complete introduction to Lua programming, see the book
-<A HREF="http://www.lua.org/docs.html#pil">Programming in Lua</A>.
-
-<P>
-This manual is also available as a book:
-<BLOCKQUOTE>
-<A HREF="http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20">
-<IMG SRC="cover.png" ALT="" TITLE="buy from Amazon" BORDER=1 ALIGN="left" HSPACE=12>
-</A>
-<B>Lua 5.1 Reference Manual</B>
-<BR>by R. Ierusalimschy, L. H. de Figueiredo, W. Celes
-<BR>Lua.org, August 2006
-<BR>ISBN 85-903798-3-3
-<BR CLEAR="all">
-</BLOCKQUOTE>
-
-<P>
-<A HREF="http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20">Buy a copy</A>
-of this book and
-<A HREF="http://www.lua.org/donations.html">help to support</A>
-the Lua project.
-
-<P>
-<A HREF="manual.html">start</A>
-&middot;
-<A HREF="#contents">contents</A>
-&middot;
-<A HREF="#index">index</A>
-&middot;
-<A HREF="http://www.lua.org/manual/">other versions</A>
-<HR>
-<SMALL>
-Copyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.
-Freely available under the terms of the
-<A HREF="http://www.lua.org/license.html">Lua license</A>.
-</SMALL>
-
-<H2><A NAME="contents">Contents</A></H2>
-<UL style="padding: 0">
-<LI><A HREF="manual.html">1 &ndash; Introduction</A>
-<P>
-<LI><A HREF="manual.html#2">2 &ndash; The Language</A>
-<UL>
-<LI><A HREF="manual.html#2.1">2.1 &ndash; Lexical Conventions</A>
-<LI><A HREF="manual.html#2.2">2.2 &ndash; Values and Types</A>
-<UL>
-<LI><A HREF="manual.html#2.2.1">2.2.1 &ndash; Coercion</A>
-</UL>
-<LI><A HREF="manual.html#2.3">2.3 &ndash; Variables</A>
-<LI><A HREF="manual.html#2.4">2.4 &ndash; Statements</A>
-<UL>
-<LI><A HREF="manual.html#2.4.1">2.4.1 &ndash; Chunks</A>
-<LI><A HREF="manual.html#2.4.2">2.4.2 &ndash; Blocks</A>
-<LI><A HREF="manual.html#2.4.3">2.4.3 &ndash; Assignment</A>
-<LI><A HREF="manual.html#2.4.4">2.4.4 &ndash; Control Structures</A>
-<LI><A HREF="manual.html#2.4.5">2.4.5 &ndash; For Statement</A>
-<LI><A HREF="manual.html#2.4.6">2.4.6 &ndash; Function Calls as Statements</A>
-<LI><A HREF="manual.html#2.4.7">2.4.7 &ndash; Local Declarations</A>
-</UL>
-<LI><A HREF="manual.html#2.5">2.5 &ndash; Expressions</A>
-<UL>
-<LI><A HREF="manual.html#2.5.1">2.5.1 &ndash; Arithmetic Operators</A>
-<LI><A HREF="manual.html#2.5.2">2.5.2 &ndash; Relational Operators</A>
-<LI><A HREF="manual.html#2.5.3">2.5.3 &ndash; Logical Operators</A>
-<LI><A HREF="manual.html#2.5.4">2.5.4 &ndash; Concatenation</A>
-<LI><A HREF="manual.html#2.5.5">2.5.5 &ndash; The Length Operator</A>
-<LI><A HREF="manual.html#2.5.6">2.5.6 &ndash; Precedence</A>
-<LI><A HREF="manual.html#2.5.7">2.5.7 &ndash; Table Constructors</A>
-<LI><A HREF="manual.html#2.5.8">2.5.8 &ndash; Function Calls</A>
-<LI><A HREF="manual.html#2.5.9">2.5.9 &ndash; Function Definitions</A>
-</UL>
-<LI><A HREF="manual.html#2.6">2.6 &ndash; Visibility Rules</A>
-<LI><A HREF="manual.html#2.7">2.7 &ndash; Error Handling</A>
-<LI><A HREF="manual.html#2.8">2.8 &ndash; Metatables</A>
-<LI><A HREF="manual.html#2.9">2.9 &ndash; Environments</A>
-<LI><A HREF="manual.html#2.10">2.10 &ndash; Garbage Collection</A>
-<UL>
-<LI><A HREF="manual.html#2.10.1">2.10.1 &ndash; Garbage-Collection Metamethods</A>
-<LI><A HREF="manual.html#2.10.2">2.10.2 &ndash; Weak Tables</A>
-</UL>
-<LI><A HREF="manual.html#2.11">2.11 &ndash; Coroutines</A>
-</UL>
-<P>
-<LI><A HREF="manual.html#3">3 &ndash; The Application Program Interface</A>
-<UL>
-<LI><A HREF="manual.html#3.1">3.1 &ndash; The Stack</A>
-<LI><A HREF="manual.html#3.2">3.2 &ndash; Stack Size</A>
-<LI><A HREF="manual.html#3.3">3.3 &ndash; Pseudo-Indices</A>
-<LI><A HREF="manual.html#3.4">3.4 &ndash; C Closures</A>
-<LI><A HREF="manual.html#3.5">3.5 &ndash; Registry</A>
-<LI><A HREF="manual.html#3.6">3.6 &ndash; Error Handling in C</A>
-<LI><A HREF="manual.html#3.7">3.7 &ndash; Functions and Types</A>
-<LI><A HREF="manual.html#3.8">3.8 &ndash; The Debug Interface</A>
-</UL>
-<P>
-<LI><A HREF="manual.html#4">4 &ndash; The Auxiliary Library</A>
-<UL>
-<LI><A HREF="manual.html#4.1">4.1 &ndash; Functions and Types</A>
-</UL>
-<P>
-<LI><A HREF="manual.html#5">5 &ndash; Standard Libraries</A>
-<UL>
-<LI><A HREF="manual.html#5.1">5.1 &ndash; Basic Functions</A>
-<LI><A HREF="manual.html#5.2">5.2 &ndash; Coroutine Manipulation</A>
-<LI><A HREF="manual.html#5.3">5.3 &ndash; Modules</A>
-<LI><A HREF="manual.html#5.4">5.4 &ndash; String Manipulation</A>
-<UL>
-<LI><A HREF="manual.html#5.4.1">5.4.1 &ndash; Patterns</A>
-</UL>
-<LI><A HREF="manual.html#5.5">5.5 &ndash; Table Manipulation</A>
-<LI><A HREF="manual.html#5.6">5.6 &ndash; Mathematical Functions</A>
-<LI><A HREF="manual.html#5.7">5.7 &ndash; Input and Output Facilities</A>
-<LI><A HREF="manual.html#5.8">5.8 &ndash; Operating System Facilities</A>
-<LI><A HREF="manual.html#5.9">5.9 &ndash; The Debug Library</A>
-</UL>
-<P>
-<LI><A HREF="manual.html#6">6 &ndash; Lua Stand-alone</A>
-<P>
-<LI><A HREF="manual.html#7">7 &ndash; Incompatibilities with the Previous Version</A>
-<UL>
-<LI><A HREF="manual.html#7.1">7.1 &ndash; Changes in the Language</A>
-<LI><A HREF="manual.html#7.2">7.2 &ndash; Changes in the Libraries</A>
-<LI><A HREF="manual.html#7.3">7.3 &ndash; Changes in the API</A>
-</UL>
-<P>
-<LI><A HREF="manual.html#8">8 &ndash; The Complete Syntax of Lua</A>
-</UL>
-
-<H2><A NAME="index">Index</A></H2>
-<TABLE WIDTH="100%">
-<TR VALIGN="top">
-<TD>
-<H3><A NAME="functions">Lua functions</A></H3>
-<A HREF="manual.html#pdf-_G">_G</A><BR>
-<A HREF="manual.html#pdf-_VERSION">_VERSION</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-assert">assert</A><BR>
-<A HREF="manual.html#pdf-collectgarbage">collectgarbage</A><BR>
-<A HREF="manual.html#pdf-dofile">dofile</A><BR>
-<A HREF="manual.html#pdf-error">error</A><BR>
-<A HREF="manual.html#pdf-getfenv">getfenv</A><BR>
-<A HREF="manual.html#pdf-getmetatable">getmetatable</A><BR>
-<A HREF="manual.html#pdf-ipairs">ipairs</A><BR>
-<A HREF="manual.html#pdf-load">load</A><BR>
-<A HREF="manual.html#pdf-loadfile">loadfile</A><BR>
-<A HREF="manual.html#pdf-loadstring">loadstring</A><BR>
-<A HREF="manual.html#pdf-module">module</A><BR>
-<A HREF="manual.html#pdf-next">next</A><BR>
-<A HREF="manual.html#pdf-pairs">pairs</A><BR>
-<A HREF="manual.html#pdf-pcall">pcall</A><BR>
-<A HREF="manual.html#pdf-print">print</A><BR>
-<A HREF="manual.html#pdf-rawequal">rawequal</A><BR>
-<A HREF="manual.html#pdf-rawget">rawget</A><BR>
-<A HREF="manual.html#pdf-rawset">rawset</A><BR>
-<A HREF="manual.html#pdf-require">require</A><BR>
-<A HREF="manual.html#pdf-select">select</A><BR>
-<A HREF="manual.html#pdf-setfenv">setfenv</A><BR>
-<A HREF="manual.html#pdf-setmetatable">setmetatable</A><BR>
-<A HREF="manual.html#pdf-tonumber">tonumber</A><BR>
-<A HREF="manual.html#pdf-tostring">tostring</A><BR>
-<A HREF="manual.html#pdf-type">type</A><BR>
-<A HREF="manual.html#pdf-unpack">unpack</A><BR>
-<A HREF="manual.html#pdf-xpcall">xpcall</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-coroutine.create">coroutine.create</A><BR>
-<A HREF="manual.html#pdf-coroutine.resume">coroutine.resume</A><BR>
-<A HREF="manual.html#pdf-coroutine.running">coroutine.running</A><BR>
-<A HREF="manual.html#pdf-coroutine.status">coroutine.status</A><BR>
-<A HREF="manual.html#pdf-coroutine.wrap">coroutine.wrap</A><BR>
-<A HREF="manual.html#pdf-coroutine.yield">coroutine.yield</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-debug.debug">debug.debug</A><BR>
-<A HREF="manual.html#pdf-debug.getfenv">debug.getfenv</A><BR>
-<A HREF="manual.html#pdf-debug.gethook">debug.gethook</A><BR>
-<A HREF="manual.html#pdf-debug.getinfo">debug.getinfo</A><BR>
-<A HREF="manual.html#pdf-debug.getlocal">debug.getlocal</A><BR>
-<A HREF="manual.html#pdf-debug.getmetatable">debug.getmetatable</A><BR>
-<A HREF="manual.html#pdf-debug.getregistry">debug.getregistry</A><BR>
-<A HREF="manual.html#pdf-debug.getupvalue">debug.getupvalue</A><BR>
-<A HREF="manual.html#pdf-debug.setfenv">debug.setfenv</A><BR>
-<A HREF="manual.html#pdf-debug.sethook">debug.sethook</A><BR>
-<A HREF="manual.html#pdf-debug.setlocal">debug.setlocal</A><BR>
-<A HREF="manual.html#pdf-debug.setmetatable">debug.setmetatable</A><BR>
-<A HREF="manual.html#pdf-debug.setupvalue">debug.setupvalue</A><BR>
-<A HREF="manual.html#pdf-debug.traceback">debug.traceback</A><BR>
-
-</TD>
-<TD>
-<H3>&nbsp;</H3>
-<A HREF="manual.html#pdf-file:close">file:close</A><BR>
-<A HREF="manual.html#pdf-file:flush">file:flush</A><BR>
-<A HREF="manual.html#pdf-file:lines">file:lines</A><BR>
-<A HREF="manual.html#pdf-file:read">file:read</A><BR>
-<A HREF="manual.html#pdf-file:seek">file:seek</A><BR>
-<A HREF="manual.html#pdf-file:setvbuf">file:setvbuf</A><BR>
-<A HREF="manual.html#pdf-file:write">file:write</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-io.close">io.close</A><BR>
-<A HREF="manual.html#pdf-io.flush">io.flush</A><BR>
-<A HREF="manual.html#pdf-io.input">io.input</A><BR>
-<A HREF="manual.html#pdf-io.lines">io.lines</A><BR>
-<A HREF="manual.html#pdf-io.open">io.open</A><BR>
-<A HREF="manual.html#pdf-io.output">io.output</A><BR>
-<A HREF="manual.html#pdf-io.popen">io.popen</A><BR>
-<A HREF="manual.html#pdf-io.read">io.read</A><BR>
-<A HREF="manual.html#pdf-io.stderr">io.stderr</A><BR>
-<A HREF="manual.html#pdf-io.stdin">io.stdin</A><BR>
-<A HREF="manual.html#pdf-io.stdout">io.stdout</A><BR>
-<A HREF="manual.html#pdf-io.tmpfile">io.tmpfile</A><BR>
-<A HREF="manual.html#pdf-io.type">io.type</A><BR>
-<A HREF="manual.html#pdf-io.write">io.write</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-math.abs">math.abs</A><BR>
-<A HREF="manual.html#pdf-math.acos">math.acos</A><BR>
-<A HREF="manual.html#pdf-math.asin">math.asin</A><BR>
-<A HREF="manual.html#pdf-math.atan">math.atan</A><BR>
-<A HREF="manual.html#pdf-math.atan2">math.atan2</A><BR>
-<A HREF="manual.html#pdf-math.ceil">math.ceil</A><BR>
-<A HREF="manual.html#pdf-math.cos">math.cos</A><BR>
-<A HREF="manual.html#pdf-math.cosh">math.cosh</A><BR>
-<A HREF="manual.html#pdf-math.deg">math.deg</A><BR>
-<A HREF="manual.html#pdf-math.exp">math.exp</A><BR>
-<A HREF="manual.html#pdf-math.floor">math.floor</A><BR>
-<A HREF="manual.html#pdf-math.fmod">math.fmod</A><BR>
-<A HREF="manual.html#pdf-math.frexp">math.frexp</A><BR>
-<A HREF="manual.html#pdf-math.huge">math.huge</A><BR>
-<A HREF="manual.html#pdf-math.ldexp">math.ldexp</A><BR>
-<A HREF="manual.html#pdf-math.log">math.log</A><BR>
-<A HREF="manual.html#pdf-math.log10">math.log10</A><BR>
-<A HREF="manual.html#pdf-math.max">math.max</A><BR>
-<A HREF="manual.html#pdf-math.min">math.min</A><BR>
-<A HREF="manual.html#pdf-math.modf">math.modf</A><BR>
-<A HREF="manual.html#pdf-math.pi">math.pi</A><BR>
-<A HREF="manual.html#pdf-math.pow">math.pow</A><BR>
-<A HREF="manual.html#pdf-math.rad">math.rad</A><BR>
-<A HREF="manual.html#pdf-math.random">math.random</A><BR>
-<A HREF="manual.html#pdf-math.randomseed">math.randomseed</A><BR>
-<A HREF="manual.html#pdf-math.sin">math.sin</A><BR>
-<A HREF="manual.html#pdf-math.sinh">math.sinh</A><BR>
-<A HREF="manual.html#pdf-math.sqrt">math.sqrt</A><BR>
-<A HREF="manual.html#pdf-math.tan">math.tan</A><BR>
-<A HREF="manual.html#pdf-math.tanh">math.tanh</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-os.clock">os.clock</A><BR>
-<A HREF="manual.html#pdf-os.date">os.date</A><BR>
-<A HREF="manual.html#pdf-os.difftime">os.difftime</A><BR>
-<A HREF="manual.html#pdf-os.execute">os.execute</A><BR>
-<A HREF="manual.html#pdf-os.exit">os.exit</A><BR>
-<A HREF="manual.html#pdf-os.getenv">os.getenv</A><BR>
-<A HREF="manual.html#pdf-os.remove">os.remove</A><BR>
-<A HREF="manual.html#pdf-os.rename">os.rename</A><BR>
-<A HREF="manual.html#pdf-os.setlocale">os.setlocale</A><BR>
-<A HREF="manual.html#pdf-os.time">os.time</A><BR>
-<A HREF="manual.html#pdf-os.tmpname">os.tmpname</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-package.cpath">package.cpath</A><BR>
-<A HREF="manual.html#pdf-package.loaded">package.loaded</A><BR>
-<A HREF="manual.html#pdf-package.loaders">package.loaders</A><BR>
-<A HREF="manual.html#pdf-package.loadlib">package.loadlib</A><BR>
-<A HREF="manual.html#pdf-package.path">package.path</A><BR>
-<A HREF="manual.html#pdf-package.preload">package.preload</A><BR>
-<A HREF="manual.html#pdf-package.seeall">package.seeall</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-string.byte">string.byte</A><BR>
-<A HREF="manual.html#pdf-string.char">string.char</A><BR>
-<A HREF="manual.html#pdf-string.dump">string.dump</A><BR>
-<A HREF="manual.html#pdf-string.find">string.find</A><BR>
-<A HREF="manual.html#pdf-string.format">string.format</A><BR>
-<A HREF="manual.html#pdf-string.gmatch">string.gmatch</A><BR>
-<A HREF="manual.html#pdf-string.gsub">string.gsub</A><BR>
-<A HREF="manual.html#pdf-string.len">string.len</A><BR>
-<A HREF="manual.html#pdf-string.lower">string.lower</A><BR>
-<A HREF="manual.html#pdf-string.match">string.match</A><BR>
-<A HREF="manual.html#pdf-string.rep">string.rep</A><BR>
-<A HREF="manual.html#pdf-string.reverse">string.reverse</A><BR>
-<A HREF="manual.html#pdf-string.sub">string.sub</A><BR>
-<A HREF="manual.html#pdf-string.upper">string.upper</A><BR>
-<P>
-
-<A HREF="manual.html#pdf-table.concat">table.concat</A><BR>
-<A HREF="manual.html#pdf-table.insert">table.insert</A><BR>
-<A HREF="manual.html#pdf-table.maxn">table.maxn</A><BR>
-<A HREF="manual.html#pdf-table.remove">table.remove</A><BR>
-<A HREF="manual.html#pdf-table.sort">table.sort</A><BR>
-
-</TD>
-<TD>
-<H3>C API</H3>
-<A HREF="manual.html#lua_Alloc">lua_Alloc</A><BR>
-<A HREF="manual.html#lua_CFunction">lua_CFunction</A><BR>
-<A HREF="manual.html#lua_Debug">lua_Debug</A><BR>
-<A HREF="manual.html#lua_Hook">lua_Hook</A><BR>
-<A HREF="manual.html#lua_Integer">lua_Integer</A><BR>
-<A HREF="manual.html#lua_Number">lua_Number</A><BR>
-<A HREF="manual.html#lua_Reader">lua_Reader</A><BR>
-<A HREF="manual.html#lua_State">lua_State</A><BR>
-<A HREF="manual.html#lua_Writer">lua_Writer</A><BR>
-<P>
-
-<A HREF="manual.html#lua_atpanic">lua_atpanic</A><BR>
-<A HREF="manual.html#lua_call">lua_call</A><BR>
-<A HREF="manual.html#lua_checkstack">lua_checkstack</A><BR>
-<A HREF="manual.html#lua_close">lua_close</A><BR>
-<A HREF="manual.html#lua_concat">lua_concat</A><BR>
-<A HREF="manual.html#lua_cpcall">lua_cpcall</A><BR>
-<A HREF="manual.html#lua_createtable">lua_createtable</A><BR>
-<A HREF="manual.html#lua_dump">lua_dump</A><BR>
-<A HREF="manual.html#lua_equal">lua_equal</A><BR>
-<A HREF="manual.html#lua_error">lua_error</A><BR>
-<A HREF="manual.html#lua_gc">lua_gc</A><BR>
-<A HREF="manual.html#lua_getallocf">lua_getallocf</A><BR>
-<A HREF="manual.html#lua_getfenv">lua_getfenv</A><BR>
-<A HREF="manual.html#lua_getfield">lua_getfield</A><BR>
-<A HREF="manual.html#lua_getglobal">lua_getglobal</A><BR>
-<A HREF="manual.html#lua_gethook">lua_gethook</A><BR>
-<A HREF="manual.html#lua_gethookcount">lua_gethookcount</A><BR>
-<A HREF="manual.html#lua_gethookmask">lua_gethookmask</A><BR>
-<A HREF="manual.html#lua_getinfo">lua_getinfo</A><BR>
-<A HREF="manual.html#lua_getlocal">lua_getlocal</A><BR>
-<A HREF="manual.html#lua_getmetatable">lua_getmetatable</A><BR>
-<A HREF="manual.html#lua_getstack">lua_getstack</A><BR>
-<A HREF="manual.html#lua_gettable">lua_gettable</A><BR>
-<A HREF="manual.html#lua_gettop">lua_gettop</A><BR>
-<A HREF="manual.html#lua_getupvalue">lua_getupvalue</A><BR>
-<A HREF="manual.html#lua_insert">lua_insert</A><BR>
-<A HREF="manual.html#lua_isboolean">lua_isboolean</A><BR>
-<A HREF="manual.html#lua_iscfunction">lua_iscfunction</A><BR>
-<A HREF="manual.html#lua_isfunction">lua_isfunction</A><BR>
-<A HREF="manual.html#lua_islightuserdata">lua_islightuserdata</A><BR>
-<A HREF="manual.html#lua_isnil">lua_isnil</A><BR>
-<A HREF="manual.html#lua_isnone">lua_isnone</A><BR>
-<A HREF="manual.html#lua_isnoneornil">lua_isnoneornil</A><BR>
-<A HREF="manual.html#lua_isnumber">lua_isnumber</A><BR>
-<A HREF="manual.html#lua_isstring">lua_isstring</A><BR>
-<A HREF="manual.html#lua_istable">lua_istable</A><BR>
-<A HREF="manual.html#lua_isthread">lua_isthread</A><BR>
-<A HREF="manual.html#lua_isuserdata">lua_isuserdata</A><BR>
-<A HREF="manual.html#lua_lessthan">lua_lessthan</A><BR>
-<A HREF="manual.html#lua_load">lua_load</A><BR>
-<A HREF="manual.html#lua_newstate">lua_newstate</A><BR>
-<A HREF="manual.html#lua_newtable">lua_newtable</A><BR>
-<A HREF="manual.html#lua_newthread">lua_newthread</A><BR>
-<A HREF="manual.html#lua_newuserdata">lua_newuserdata</A><BR>
-<A HREF="manual.html#lua_next">lua_next</A><BR>
-<A HREF="manual.html#lua_objlen">lua_objlen</A><BR>
-<A HREF="manual.html#lua_pcall">lua_pcall</A><BR>
-<A HREF="manual.html#lua_pop">lua_pop</A><BR>
-<A HREF="manual.html#lua_pushboolean">lua_pushboolean</A><BR>
-<A HREF="manual.html#lua_pushcclosure">lua_pushcclosure</A><BR>
-<A HREF="manual.html#lua_pushcfunction">lua_pushcfunction</A><BR>
-<A HREF="manual.html#lua_pushfstring">lua_pushfstring</A><BR>
-<A HREF="manual.html#lua_pushinteger">lua_pushinteger</A><BR>
-<A HREF="manual.html#lua_pushlightuserdata">lua_pushlightuserdata</A><BR>
-<A HREF="manual.html#lua_pushliteral">lua_pushliteral</A><BR>
-<A HREF="manual.html#lua_pushlstring">lua_pushlstring</A><BR>
-<A HREF="manual.html#lua_pushnil">lua_pushnil</A><BR>
-<A HREF="manual.html#lua_pushnumber">lua_pushnumber</A><BR>
-<A HREF="manual.html#lua_pushstring">lua_pushstring</A><BR>
-<A HREF="manual.html#lua_pushthread">lua_pushthread</A><BR>
-<A HREF="manual.html#lua_pushvalue">lua_pushvalue</A><BR>
-<A HREF="manual.html#lua_pushvfstring">lua_pushvfstring</A><BR>
-<A HREF="manual.html#lua_rawequal">lua_rawequal</A><BR>
-<A HREF="manual.html#lua_rawget">lua_rawget</A><BR>
-<A HREF="manual.html#lua_rawgeti">lua_rawgeti</A><BR>
-<A HREF="manual.html#lua_rawset">lua_rawset</A><BR>
-<A HREF="manual.html#lua_rawseti">lua_rawseti</A><BR>
-<A HREF="manual.html#lua_register">lua_register</A><BR>
-<A HREF="manual.html#lua_remove">lua_remove</A><BR>
-<A HREF="manual.html#lua_replace">lua_replace</A><BR>
-<A HREF="manual.html#lua_resume">lua_resume</A><BR>
-<A HREF="manual.html#lua_setallocf">lua_setallocf</A><BR>
-<A HREF="manual.html#lua_setfenv">lua_setfenv</A><BR>
-<A HREF="manual.html#lua_setfield">lua_setfield</A><BR>
-<A HREF="manual.html#lua_setglobal">lua_setglobal</A><BR>
-<A HREF="manual.html#lua_sethook">lua_sethook</A><BR>
-<A HREF="manual.html#lua_setlocal">lua_setlocal</A><BR>
-<A HREF="manual.html#lua_setmetatable">lua_setmetatable</A><BR>
-<A HREF="manual.html#lua_settable">lua_settable</A><BR>
-<A HREF="manual.html#lua_settop">lua_settop</A><BR>
-<A HREF="manual.html#lua_setupvalue">lua_setupvalue</A><BR>
-<A HREF="manual.html#lua_status">lua_status</A><BR>
-<A HREF="manual.html#lua_toboolean">lua_toboolean</A><BR>
-<A HREF="manual.html#lua_tocfunction">lua_tocfunction</A><BR>
-<A HREF="manual.html#lua_tointeger">lua_tointeger</A><BR>
-<A HREF="manual.html#lua_tolstring">lua_tolstring</A><BR>
-<A HREF="manual.html#lua_tonumber">lua_tonumber</A><BR>
-<A HREF="manual.html#lua_topointer">lua_topointer</A><BR>
-<A HREF="manual.html#lua_tostring">lua_tostring</A><BR>
-<A HREF="manual.html#lua_tothread">lua_tothread</A><BR>
-<A HREF="manual.html#lua_touserdata">lua_touserdata</A><BR>
-<A HREF="manual.html#lua_type">lua_type</A><BR>
-<A HREF="manual.html#lua_typename">lua_typename</A><BR>
-<A HREF="manual.html#lua_upvalueindex">lua_upvalueindex</A><BR>
-<A HREF="manual.html#lua_xmove">lua_xmove</A><BR>
-<A HREF="manual.html#lua_yield">lua_yield</A><BR>
-
-</TD>
-<TD>
-<H3>auxiliary library</H3>
-<A HREF="manual.html#luaL_Buffer">luaL_Buffer</A><BR>
-<A HREF="manual.html#luaL_Reg">luaL_Reg</A><BR>
-<P>
-
-<A HREF="manual.html#luaL_addchar">luaL_addchar</A><BR>
-<A HREF="manual.html#luaL_addlstring">luaL_addlstring</A><BR>
-<A HREF="manual.html#luaL_addsize">luaL_addsize</A><BR>
-<A HREF="manual.html#luaL_addstring">luaL_addstring</A><BR>
-<A HREF="manual.html#luaL_addvalue">luaL_addvalue</A><BR>
-<A HREF="manual.html#luaL_argcheck">luaL_argcheck</A><BR>
-<A HREF="manual.html#luaL_argerror">luaL_argerror</A><BR>
-<A HREF="manual.html#luaL_buffinit">luaL_buffinit</A><BR>
-<A HREF="manual.html#luaL_callmeta">luaL_callmeta</A><BR>
-<A HREF="manual.html#luaL_checkany">luaL_checkany</A><BR>
-<A HREF="manual.html#luaL_checkint">luaL_checkint</A><BR>
-<A HREF="manual.html#luaL_checkinteger">luaL_checkinteger</A><BR>
-<A HREF="manual.html#luaL_checklong">luaL_checklong</A><BR>
-<A HREF="manual.html#luaL_checklstring">luaL_checklstring</A><BR>
-<A HREF="manual.html#luaL_checknumber">luaL_checknumber</A><BR>
-<A HREF="manual.html#luaL_checkoption">luaL_checkoption</A><BR>
-<A HREF="manual.html#luaL_checkstack">luaL_checkstack</A><BR>
-<A HREF="manual.html#luaL_checkstring">luaL_checkstring</A><BR>
-<A HREF="manual.html#luaL_checktype">luaL_checktype</A><BR>
-<A HREF="manual.html#luaL_checkudata">luaL_checkudata</A><BR>
-<A HREF="manual.html#luaL_dofile">luaL_dofile</A><BR>
-<A HREF="manual.html#luaL_dostring">luaL_dostring</A><BR>
-<A HREF="manual.html#luaL_error">luaL_error</A><BR>
-<A HREF="manual.html#luaL_getmetafield">luaL_getmetafield</A><BR>
-<A HREF="manual.html#luaL_getmetatable">luaL_getmetatable</A><BR>
-<A HREF="manual.html#luaL_gsub">luaL_gsub</A><BR>
-<A HREF="manual.html#luaL_loadbuffer">luaL_loadbuffer</A><BR>
-<A HREF="manual.html#luaL_loadfile">luaL_loadfile</A><BR>
-<A HREF="manual.html#luaL_loadstring">luaL_loadstring</A><BR>
-<A HREF="manual.html#luaL_newmetatable">luaL_newmetatable</A><BR>
-<A HREF="manual.html#luaL_newstate">luaL_newstate</A><BR>
-<A HREF="manual.html#luaL_openlibs">luaL_openlibs</A><BR>
-<A HREF="manual.html#luaL_optint">luaL_optint</A><BR>
-<A HREF="manual.html#luaL_optinteger">luaL_optinteger</A><BR>
-<A HREF="manual.html#luaL_optlong">luaL_optlong</A><BR>
-<A HREF="manual.html#luaL_optlstring">luaL_optlstring</A><BR>
-<A HREF="manual.html#luaL_optnumber">luaL_optnumber</A><BR>
-<A HREF="manual.html#luaL_optstring">luaL_optstring</A><BR>
-<A HREF="manual.html#luaL_prepbuffer">luaL_prepbuffer</A><BR>
-<A HREF="manual.html#luaL_pushresult">luaL_pushresult</A><BR>
-<A HREF="manual.html#luaL_ref">luaL_ref</A><BR>
-<A HREF="manual.html#luaL_register">luaL_register</A><BR>
-<A HREF="manual.html#luaL_typename">luaL_typename</A><BR>
-<A HREF="manual.html#luaL_typerror">luaL_typerror</A><BR>
-<A HREF="manual.html#luaL_unref">luaL_unref</A><BR>
-<A HREF="manual.html#luaL_where">luaL_where</A><BR>
-
-</TD>
-</TR>
-</TABLE>
-<P>
-
-<HR>
-<SMALL CLASS="footer">
-Last update:
-Mon Feb 13 18:53:32 BRST 2012
-</SMALL>
-<!--
-Last change: revised for Lua 5.1.5
--->
-
-</BODY>
-</HTML>
diff --git a/redis-stable/deps/lua/doc/cover.png b/redis-stable/deps/lua/doc/cover.png
deleted file mode 100644
index 2dbb198123f03a7250bfa57c8253739962d69afb..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 3305
zcmV<F3>Nc=P)<h;3K|Lk000e1NJLTq002b*003SH0ssI2`u<KP00004XF*Lt006O%
z3;baP0000ubVXQnQ*UN;cVTj609aNaR%LQ?X>V>IGcGYOVIUw<Wp+9sF)}YQIWIXh
zASh5yM<8%vbYo~BF)lJG-4!lL000b0Nkl<Zc%1E<OK=>=dB=a<GqbY~EU<WE0T3iW
zkQ7N#FUk@13Zse?l^+#3sdB87%Lm8hsvLaKP1e;%Uv%*$FZqzTRH;-V$Ek88#foT}
zDvK0J@c~jK0TLttf&drT#lB~z+Xw7o7Qh171s5Ws!oP69&h&JD|M~js{=Toj5&YvR
zzCw@>TYv^*htKxL4xjCf9X{I|EBQ!hu?+M>5oT>TE}0ye97P9R7S8qXycMFZ<kJ!`
zez3o*J7gZ~Y<fA~{QcpM4%_@vL|zwDvn*uE7jfLum2{2^*O^bRXt+{V0e#`Xvt7~W
zyP_=tqdR1cBy+PfE)Nk}vyi2w37{o{5CBrJJB|RctnErZ$)fvD7w;6|R=SWWx?w4=
zWs5+y8K`kR42i3-j8ey<bO+@jWohgOgwnVk(J-#Z*c8M42thcAQog#@;^Sot7tUX&
zP^7b!OdhRhjvxfChiTw?1Oq6I<I>&6rBQl2xq6d5z1RT?1tMWggH(oGfxZ3MRwMW*
zhWcm<0o+gGDNJLnwySJIYqTbnA(cT&JjHAh%b?&;aM%-PVunbF`4oU{acLCOU~~ed
z=<Vdr43<eIhwCxa*8nn$B2CV)CyuL1i@{uq*5;~<)+#=Bfc*pPj+0Ciwn31~(-I|_
z#<pk*5sRWVZBaT~X>Xys9YZpo#<qw>i8bMPc#43D)u4sMGKqI^_da6LW&~0K*cO4+
z_P<uVpqI5O{S>RNFEtj+pK65RYy#Eh+iK_)|A>ml%LRW(G?uWEPuP@)V__g<O07{^
zryS2wy3ICIju()ksC3ftI&Cu`WzO?FP0mv{777nT_$pY*$C9!)90*9!YMb{9Zld6J
z7*ay3ZN|YAXvll2-L?u!rHWob>B&q{E^1Drx0`;n)|1&{JZ#-e7eMcd1S~0(ChdB8
zS0!Ap-8R#X^0X5R7@pQ0wmH~jKhYj`l%C2tznfmz5?4vXD&s9-{r%L{8o|B1n{hn>
zX-7F)1C|g{Fjw^QO3xSEM8WF{nF8))ijLB@AziK0j<-dAU&NHQAw-4j8oelO%2Dg_
z37hiyuBd>qbbcrr0xb~*rLW9q2cyBcq8kgCW9j_Jd}=!9R2g|I=9{KHXtr2}hFHKH
zPZ!2Bg|$47mFu;Duqg$YQfQ4vD~-}9t!+atHYg~SbM=?ElxgB&vnLeLny@Jo1@}ra
zw-%pO_5&GLRc)GAp8w;^w0pr+)}6{$xN2*=h1(z&s0B5@zOQ<G`u`m}e6}}s_-t?N
z@Y&wj;j_K5!>2Cj<++EgPm6D*KdLp^Jc$%i(A&wq1mn{*M;Pu$%2I-|s;8_q`68Jd
zLJ$dITeas|8_h>+9GB??ksz(jj7@SsNq-j_f;Mf@l8W*L-v0vui)W9N64OhM7aV?n
zo{!IxNC9-U@zPPgc8EYtsn)ggZ<}BOc#01{#gH6*gjm!cMXYM<xFpjwg$Y=EF;2Xl
zmL`fWzx*FgoI`njM$a_(i(`EIIOfK0-{7?$G=Pljas4(*(G+GN&Tv1WAVQS?R<#!b
z!yp{OG(nSG;P)4ZMY(#5|NK9cs)%?5N^$EhL;ZBNZaDE8G2fKp<ar#IUEK(=ItRNl
zw^|`8fRGIDVs{*+c=vrgZ&mmvC^~#{k%NO6Tgpf4l371}kdR$UD_7q26!{|QEZIEy
z0s)I~kftypd)Z<j1Oba&f&0ldW6_y8l)~6xL4E)}T61%f(Meu9N+h)GmQo~ATpZ=X
zbta}+$l<yujR4am93<Y(p&=d{rn?QJOiTz&qaqi+Lee!B!-nxm=lJX@FMn;>FiJ5!
z$8SI7^a#mxl?1n2Bwr+v<kA?wKFQ%BUU`PWIEF#MWN$y?cdHF1*gvqLa@gd0u(*_2
zCd2)NLnS_oOYKKz_{FceJW9UE>eIkV`2fdd@*by0Naq>o!4A;Y!nrTV7gj#l-OAs*
zvT_zQj8D<w!VS9Hu}q&#GR?pIhW9@qn_rj75|)msT}CIkafiV^`a0?9;Kl^md^yQ0
zh<EV4Z!*xcHS<kt&RoGXkrk&Vb1DAeJw|Q<wJ?!V?%v(~)KhySk>KsyvuDrVn7=m8
z&;O0T{VN_DroW5Nu5jxvQZU%ZlLv@3)#xH@icfQd{R930nH<0P?=qQ<5s3ufc;l~s
z^rLTdbhJn*9LK$Q@z$Gf{__VPoYQ~*AN<{S=xOJbXHXg;Sjdpd5Nq1FU!ZP(bkV*K
z5BX<_uE(!VaN&B59T<lE$xmK?>#f)0@ixmc3_}Kkful!<-+AYa=bk&r<P87%8*&AN
zz>r9RA^GG2#cH|o2Jo3*;M^C0Z#I`l`S@(jj<Y^|c;JUW{JOc^a}h%H^t8V9*6X%y
zae0)F&Y;RU=SYZs1Eg~`4p0vtt+_l#B<Nqs75LQ&3dP#{c<H6bT3ee|+kz0{=+S-g
zcpFOd!5_Fcw{(NY_tDl|WB+yPCl)Q8Fauh1@dh_1>q^e|^t7&J*rAXei$y>%zrcxe
zzKVokW{ylvDyoN%5F8rxOC(&6ljrfOA4aT&iHZA4RiB-iOg@n)*W;YNOgdZoU&C~Q
zYvZ-d>YDjzn4Be*DQQDPBE@KZ$^kz7@cjMzsnv(*TI*A%M(*BC03b*t8J+ZR_jR(6
zttGy#T|b&jH^^6<W8a)2TdSFtA+BD%^Y+{C6$-^lN?PmNw`YF((_a>g<wG7%arG9e
zd~O<R=Gc*12B>-e(O?=xBjqSdb8D)Kd$tjjQa}6Izo*l=AOHBZzP@%TWj<d#efrv)
zZ@zQ-^z~)Ejo-!dkY<UJ=V5GI;8Zgo0WUs*Q7#11nwhzEA6T=ae7^Yh+wZ;m?uo;P
z2O^Q+#6)6bWIU6}FMl<H`2`%$-{?+$zC7lwj(YUtxXbutH(f&^v}S5*ZfYvAbft=(
z^F>?-Z2yYmt`$ryp=SGWT>kg8zlLgEEs(4iVm;4Q>56I~!I5E_!W;Hjvwox?Uqoq)
z@&EyI&Dg6UFbzN8)tb&2Y&=@c`Y|NW9`Pe8A!)AFN8A)Nk)Urp8ZM1e+_>zsW<F99
z@9>uw3Gwz#h*<|ZTYWyBV&rD^+OOrPXFnaE_T4H3gMI7NJvIPCeSU~lbZRURtjFJ3
zOtR_n9@p1NEV@-WX*<9pdwg@TE&lANPj7A1!>6YW%k<@shB-1^pOm#iGtfhChrf42
zsVsLR)XYafILOn7Dzbrs7oH##T<@vPK}ueH!cSN`F26lfqvKnrf9<;5xmTWYf?eG_
zeX!9}PBYlclLvflOw3@&T9Q?4=KSZAi+(6#NWSqr9j%R{qzT%*cARj9+M7Z={YZ`Z
zkUIHTCXWs=UG`IipsSVd{5f`@zJAseNAl`14({<oM$e-oR{LI8Cm$g=u$#f&QrY?9
zm8TBymw#GL)jj}(;Q7aS^_cG^7K(iE>FT2Xbx{9&lM)RVZ}_{lVes;w@a^N+fz49V
zNXZM2^W9f`Rcp=JFX(8gt1f+0`B4G4?=d#PKzC_k7?Qz0y4x6=B$uz#sndjmeCtJC
zJ5DgL%uYf!d*Z&jYQX0B2)f!R6lrVmT}CPC?c~T_GI?g_YxBM}hQWc|eD9k)^C*Fe
z?D1?8AQoMD2D71Pn?G+{G@(R_)@FY(T|5yQo#5loxID%}wj5$qei{Hm5DK!lj~Ach
z@X#`~XwB_uPF>*Z&(R#ISEvU#FA)Nz`TQED$+JgFvs?%)ll=n>_cNbnY=Y|(+?{11
zL&3o^iG=8GW2ldzK00F6PjxbRUOh&1<7lUfP!D<@?6{2FWT>x{XIvqi2CY#FPoWf2
zVo0P!tZu2v=D9u1zJZdTwyAHS9=M*uGC8uBNRUK|GgrvwmU;C8q`)+=EkZW7g=ru~
z6<HH0{_A&mszi0OA9gjOK4fwDXc#H@=q#>RQpkqkiq>Ru+?vAkXbSVK7dSLn?*gy_
zjjN{!SUh<EPhm*r7C3pH-cBCfOTa9>^+iEFRr=;K9At8qQ=c=~M}HT#)sT<V8dpzI
z38h%bGBeMvE)0W@&X7!V{3+U6`1CS&rrF!iWBbqwO)Xiq+Oai!sH{2Acpk38GLfQG
zE3sH)(Ks4Q*s^-0$}q_^{c-Bq>^Fg(`nT<k9X{I|JAAe`cKB>>?C{y%_^R>wBb&6$
nh%8`n`v3p{2XskIMF-Xh6%#iZwFs;u00000NkvXXu0mjfd@Wp4

diff --git a/redis-stable/deps/lua/doc/logo.gif b/redis-stable/deps/lua/doc/logo.gif
deleted file mode 100644
index 2f5e4ac2e742fbb7675e739879211553758aea9c..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 4232
zcmeH``9G8i;K!fm@ywWE@XWZzZ5SF?A>^uN#>^O6HI%DVL*<G!j$AqBbX6LxN`)Cm
zMJhsNOO2x(l|`2hyOX4-ZK<?kzxwX}4c}kC@7L$o&o7_D*N^4CA(9X9fxm%&NdbU#
z0LTV_TvgRPEH*zWDJeNQIXyi+J3Bi+KOY47Ff71eMC$5dO--SemPAvt0FRgG=@sJf
zMY_5r1_mXDhDS|Ij+mGnBauq2td3h)NUf~OY;4Ny?JHbePdYhOy1G_5Ii2$KJniXu
zcJt<HI=z;`sG-wkOs3r5zn;x*`01zmfPh90=lqTx=K=#Sgoa)W4{zSNvn3+p;+{R1
zxZErI_O->tw8h1>$H%uPC0$QQ=txe!o}PX)Ev+jn>*nFZ-TC=<^76WcLZL(=DJm)|
zEiIKwrInSHXU?3duCC_u@5try#>U2`rlw1mF15F}U%!66tE;QKyIUmcDJ<+QF77*W
z<Zfx{J*jk{ynL{-a=5DMepS_j+S=db^55#}#u^*Po0=XqH9fv`>FJd#&)VAl)kJ6K
zi<>tmZ{3>g>+2gB7#JQNe(>OdLh;A=`1q42PbMZNCMPF*dXxhLZw3aYhlZwyhu@Bj
z%#4n{d-Q1b$&<N>i4QMce4L#8^!oMdw{PDnm4D66&3*dxX=-YIX6DQL_g`jbzkd4k
zZDC<ye*W*p#l<gQzW@FA%J=WzS62S#$B!TXwfF!0-x9F@&;H*R0L&_|25Zc2mGy`)
z+O`pct@6G?#M1vPyRGi-5#svzSA%W!1INvMN{s!kHVjozwl_x%U2VL7(sAGLSwC%g
z!<h=+(+*;Bpxm<nV`$h<3G(;zGBPw_`wF(h+c7K}r(v*+W{R&OrTCyV?cxowjME)5
zOV91)=HZ^jcw?Fb*Os`leXA}@#l)#9C}wT{MrU&jhI*=%ujU0+x(>oLf=%jL&vIeE
zO=XcZ9fxt`f}-DQ^%H*PHMUs(JN%UWkI|Y8h9#6~I$Cw@{RqzO4&P-x;jHCPJ6Ks2
zoU%foi)nXd_sdkiuJa@@5J4RrreKfWSnz5>eMa5yTP=)16uu)TIdx~Fhho))6jZl)
z($*i>Qr<!n_FLoFoeEz=NBupi_n%uUu(lq~l6)_cZb5>IX4u}u3>m{WSn_ehkUGQ&
zs})aUlTH1Cj1g3ZE3=MPXsSniEwJ{e6C3N#HjD=B4`8rWIsz!a7ecYpec?Wu<RQx<
zW5OV*$UA5{48Is@B-oVaPDLF@{G{YODM^eY^Ed((jhq=O%2;YHLiQ~=O;=#PJ4IHS
zMi~U@UiSOt4T(F5a3dki=o^_p^IkaGnV&p((0eP^v>H+y?Wsm18^$cS4WmHhH3_=r
zh*ILlm*X1dB^E5($KVl&zT5<?j^;A%f-ajFC(OJ!2wzr{J~MT8IM*#6AiP%&9IKdc
z{3BQTl(i?0x05jdmNBObaWL;&?D3b*c9G)aDb_w_YVw}u+_bg6K$j^qYSO1<TKXq|
z%XwjcBX!Dc4)8E9=V0DlqnKwo-eNq}C-6e9)Xzd6=Aw}_(25p~ks9|w`iiw%*d}$t
zUgBo^*20mWPY9ztEGqkQG}rmo=$W(?Owrg?W%Ioj?_N#i)?m$P29~9ry&12TJ$Zmv
zCM<zIxRS-PZ>24%l}vpHg%;Y+LezV_&TAJCmH`idhuj-n$4FZ)UE|jXLayXa-&O3Q
z?Iyo!x*$5hD_HfFnDfGYj-RD|eIb7I?%>Y_kf%}Nbd`BXb4l1(Pc+}zoUR|9%_!7f
zum2T;wbx&pohtI+&@~wm3nH9xLbOYkg*`phY~TK5iC#3tZNXo9s`cahx+8j2)rh5C
zQgZh6D7Ekgib|hpdhxYf{r<U)u0wTrDRbDJ0JGH?75WFCy0Z=wf;Qsva!0DMT+sAp
zjKiqbRVP!vroBPXH#%E@UtSh#KZHvU+;#{MVir?N`_-1pD8_QqVP)WBfZds>!PTJc
z!vsYG@{hA}l5kL)g)0N_)(nC<*L0qdUi*3fD5<0sn58>zklX@6Tyv3*X^}m=Cqc40
zQ6GfjG@kd1mFIm`qaubWunm_?P>WUZ`9|f_z%gGHi{n|uu(N8!L=aw5(qAcDj$-QK
zu;D#j6e42<qtMiSuKWv@K?Ux07;9W{*R6XjJEx1#@iUm9Uy)x?7$8=?Y>OXTQD>)i
zlv<!8U`l(@GvECIbE)55<5^q%9yQCLtD!4{^S#Fybj?@>M$LX`$n9EEjxM$_QDF&a
z7cme_rat}aXmiN&7`6Q98}dh4Z@8L_uAb#nK&GQiZOOUnA9kAEVb-csuN1AWL=sXt
z{z9GCN%%l0N9QvJM;tl1nf?rrhT{*sE%4WqR?{0~aIrfCcCPxf4eh_*jjQ=`$p53Y
z@_|Rsx2i}|3dNF<BhsI}Wbcu~SaSg_1+!SN&0apzH<+p-xP}7L=8MSQoS)*Nl5;ny
zQMJ8KOMMe$4Y!^5s}kJ{3sM;VxO#%CD5lZz>etMQQ5y8agTK-E0D&7;@3-LUxfvZ7
z7~!p@&mFe^oca2^F|CBt+4Ly?^ViUVSAhAH>JH1GN{^TQb3QnM*x0ZiZgDyNI@_c3
z@{}(WH4*e3T~}n_^0}da4ElIxAf9B!IaL7z9X0Icvj@cIkE*~W--17&WN`Ea5)Gn>
z#gpfRb#44;jVTOS{FuaZgd(-ZD848=fQzgST2MxR>wSLc1P=2HDvByz$B$IsNCC6L
zCM?nK*OHj6JA9gz4|b<~2%RqelN^1Y)jIqnRs!mDKV^BQTfo@hOtz7*Ug}Ee^cbsj
zNNlumRgAmt`1$b5MO;&X#5-EP<}AaY;52ihIpem&MTea$?3!DrwbYa?V`NjEfWF3z
zUq5JY8Ch;L{kx&J<1K&Fe_Vn;8gk{%c;n?nA2(%(f%DCRHko3uT~VI7RE^JWEqaCq
z)i|<Fl@k83KMb0{93?tr0@6Rt6$Mux@&;p*Sq0^LopMfXa^91)2E|AJK6<6+`k2p&
zSlK4<2KDGby9iVI(f$XklN8AAU8TGEJ*22FF_%4*70fTHf>%nfj(*4|V*XhY3W%M#
z*yn6SN4eUOHFxAD7B&9E_PO`G5bqgs^@J{9bk>&;PlUAiqo`j3rjQDgD!}mqLUtb`
zCB}ZD@m@s#pf7bV4jreOC*JVfHZ|hyHkX!rauVdd_I9FL45d{gWH!DNYu;i(|8wVx
z!)eLY6YXxZ2{Coae0xuTnxo1ACb5wtED?VJAz&@114$Ao6uG9YSy*!K;m5_mj=0^j
zw%?b%AOs}ql@$TGC-!^^*_#RT5+y_kTzQG9?LPPZNAtt6cJ%d2$q(I)ws21*?xF%p
zN+NeGnWRQ<5w70Rc(bl|S0Xr&5@WrmdurS|IgPB|EyuZO#=tf!35)G!HJ`E1jh^lH
zTBu~rL#DhQO*XAWtBt}JHH$lc>3%r0yD|maW_(W=B_J+y164F>O4dO|@&@N3Z3p=B
zmVl{|^Z&#atHY|9n&la)SBo}=3AFIF=_~LDJk6MTlA73CXtX+4bnn+c!}N}IPa5pp
zwyqbqIkN|I3j_3vD6$zlu{Ps(<WKwkS{}LAFESsb3otboHNqZuf2f@HBOXvEIO;q`
zBk!(!*zJ-<tcRZFB5S0fBpdOk_XfMoJLoxt^JY@?3@f=!oq+=s56_owPW?yBC*7_c
zG&;J<Z?R-m%&)Jxy|h>N-J|*qz<PJB%h;`Yo8CO2cKzjEzL;>Et<$5Soh;s^AuKv_
z-Tz+O1_~6*9CJh4r}`}mbUtjbf#fX58RIIkP6&@*y9kI|5fK*_eZ%jv3U$5*x<>D_
za2M(TV8?XY+9xy>0En#Te<6X4$0&dbyd(go$~eq4u(u)E<bbc`m}>A2msyF<5ssLZ
zDP|I}=~Bi_q)whWv=Ri~L1TYaNrR;5cMB@s78HF1{w&r(6GJ;_2@bD?#1p&P4n<!j
zgB&X)uN9pk^$4ZHP){bL$Y7UY(iP~#QjZKEwgOQNnRip-0ap%TRU(VPE~p-}I21jD
zw46v{>_?n0#9Vx~$qjMX=Lk?*!@aKo8m&$iPO7S{g3sFUwr`*<53(68xx7?z`2xf#
zGSicy_zI(PJ|<oU3CBTO8RY!f6`BW2AZ$5+6+5D>%qc2VxT+6bOE--a{k&aq7$<<=
zFt)C<@|TPs`+eycPGoGL1Wn9|Ed&a2JyAmjnkm3DQBECX&`bt~od<UpB0(J3U;$lt
z7x8$vbBt&U+2q~(d+YlNhq|wpl9b(bg3{XrVC#A0s0=8H#ryIS)W-ySP*h!3c(+Tg
zS=74eo&X#P)!c|L=|`l1<Hz8ffCC$6_pdU^k2aa{0<dK;v6zrI52QTtzxLL_+S*Wy
zx;8=w`*Z^DzTxoghV@)4$HM)oc24ZrFBMOoIM*&Zb7t{d`1${=$A&sq_8($?dSYWM
z3AVAZ!?xyAT?NE%j*lL*<OCpXkf~j@&8!UGGK#R}D2_HYcY2RT6)L_HW;+scD=NMR
zqhYR-BlckB+wv|Zuum2eEZst;sq#<m&6a`OfgL(x=13W+O9<8;s&t`=d!AN+Xm3K0
z5vYVNq(oP6Fup?sOuewCi@w;CjkHD@S|Bm|-75GPXM}?3Ivtti2O%nnOJ`V0_?iWh
z+<Mfcci)|_6^jIl#VQhm&`?!b1Q8$LIO5}|)h`b)w~wDHEjPL;4A;h^^4}4JQeYc^
z_lQz;0l=FUxhBsoGPMDOs$#qb&*1|?K>H9cUPq4M{#$-q?G3!)qO-it*&YHw+j-O*
zYy78V*`4Q=kQ@^Yz*b6Tal4(Me7BGeS^;phWAW8+L^5A(=D)t?k!rLIwVAKtq=f7h
z&^n&VX1-T$ScvN~639QLZ^d@niMaS{C-Q)8oHHBhwD*r~-1Ze#Q)GFOFptW32a-uF
z;M@ux%i%a25NwIgXt*=GHX$3~aZfwovGL!}sf?j9TsVo^cn(%&a<--0mIX<H?1BP9
zFb7sMM;$V}pwfdmFClEFqMG_IXp&HVO7u2cyo7^#&1@plRJU<qEDw%YM#_+8wSO&h
zO++WmVNXQFhkrs)+xh1zII6)^RA4J?I+q<Zimn=Nwsb*p6tJ(9TUc^(E7H>YqGe>c
PWz_J}_#7St0k8iB@FZjZ

diff --git a/redis-stable/deps/lua/doc/lua.1 b/redis-stable/deps/lua/doc/lua.1
deleted file mode 100644
index 24809cc6..00000000
--- a/redis-stable/deps/lua/doc/lua.1
+++ /dev/null
@@ -1,163 +0,0 @@
-.\" $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $
-.TH LUA 1 "$Date: 2006/01/06 16:03:34 $"
-.SH NAME
-lua \- Lua interpreter
-.SH SYNOPSIS
-.B lua
-[
-.I options
-]
-[
-.I script
-[
-.I args
-]
-]
-.SH DESCRIPTION
-.B lua
-is the stand-alone Lua interpreter.
-It loads and executes Lua programs,
-either in textual source form or
-in precompiled binary form.
-(Precompiled binaries are output by
-.BR luac ,
-the Lua compiler.)
-.B lua
-can be used as a batch interpreter and also interactively.
-.LP
-The given
-.I options
-(see below)
-are executed and then
-the Lua program in file
-.I script
-is loaded and executed.
-The given
-.I args
-are available to
-.I script
-as strings in a global table named
-.BR arg .
-If these arguments contain spaces or other characters special to the shell,
-then they should be quoted
-(but note that the quotes will be removed by the shell).
-The arguments in
-.B arg
-start at 0,
-which contains the string
-.RI ' script '.
-The index of the last argument is stored in
-.BR arg.n .
-The arguments given in the command line before
-.IR script ,
-including the name of the interpreter,
-are available in negative indices in
-.BR arg .
-.LP
-At the very start,
-before even handling the command line,
-.B lua
-executes the contents of the environment variable
-.BR LUA_INIT ,
-if it is defined.
-If the value of
-.B LUA_INIT
-is of the form
-.RI '@ filename ',
-then
-.I filename
-is executed.
-Otherwise, the string is assumed to be a Lua statement and is executed.
-.LP
-Options start with
-.B '\-'
-and are described below.
-You can use
-.B "'\--'"
-to signal the end of options.
-.LP
-If no arguments are given,
-then
-.B "\-v \-i"
-is assumed when the standard input is a terminal;
-otherwise,
-.B "\-"
-is assumed.
-.LP
-In interactive mode,
-.B lua
-prompts the user,
-reads lines from the standard input,
-and executes them as they are read.
-If a line does not contain a complete statement,
-then a secondary prompt is displayed and
-lines are read until a complete statement is formed or
-a syntax error is found.
-So, one way to interrupt the reading of an incomplete statement is
-to force a syntax error:
-adding a
-.B ';' 
-in the middle of a statement is a sure way of forcing a syntax error
-(except inside multiline strings and comments; these must be closed explicitly).
-If a line starts with
-.BR '=' ,
-then
-.B lua
-displays the values of all the expressions in the remainder of the
-line. The expressions must be separated by commas.
-The primary prompt is the value of the global variable
-.BR _PROMPT ,
-if this value is a string;
-otherwise, the default prompt is used.
-Similarly, the secondary prompt is the value of the global variable
-.BR _PROMPT2 .
-So,
-to change the prompts,
-set the corresponding variable to a string of your choice.
-You can do that after calling the interpreter
-or on the command line
-(but in this case you have to be careful with quotes
-if the prompt string contains a space; otherwise you may confuse the shell.)
-The default prompts are "> " and ">> ".
-.SH OPTIONS
-.TP
-.B \-
-load and execute the standard input as a file,
-that is,
-not interactively,
-even when the standard input is a terminal.
-.TP
-.BI \-e " stat"
-execute statement
-.IR stat .
-You need to quote
-.I stat 
-if it contains spaces, quotes,
-or other characters special to the shell.
-.TP
-.B \-i
-enter interactive mode after
-.I script
-is executed.
-.TP
-.BI \-l " name"
-call
-.BI require(' name ')
-before executing
-.IR script .
-Typically used to load libraries.
-.TP
-.B \-v
-show version information.
-.SH "SEE ALSO"
-.BR luac (1)
-.br
-http://www.lua.org/
-.SH DIAGNOSTICS
-Error messages should be self explanatory.
-.SH AUTHORS
-R. Ierusalimschy,
-L. H. de Figueiredo,
-and
-W. Celes
-.\" EOF
diff --git a/redis-stable/deps/lua/doc/lua.css b/redis-stable/deps/lua/doc/lua.css
deleted file mode 100644
index 7fafbb1b..00000000
--- a/redis-stable/deps/lua/doc/lua.css
+++ /dev/null
@@ -1,83 +0,0 @@
-body {
-	color: #000000 ;
-	background-color: #FFFFFF ;
-	font-family: Helvetica, Arial, sans-serif ;
-	text-align: justify ;
-	margin-right: 30px ;
-	margin-left: 30px ;
-}
-
-h1, h2, h3, h4 {
-	font-family: Verdana, Geneva, sans-serif ;
-	font-weight: normal ;
-	font-style: italic ;
-}
-
-h2 {
-	padding-top: 0.4em ;
-	padding-bottom: 0.4em ;
-	padding-left: 30px ;
-	padding-right: 30px ;
-	margin-left: -30px ;
-	background-color: #E0E0FF ;
-}
-
-h3 {
-	padding-left: 0.5em ;
-	border-left: solid #E0E0FF 1em ;
-}
-
-table h3 {
-	padding-left: 0px ;
-	border-left: none ;
-}
-
-a:link {
-	color: #000080 ;
-	background-color: inherit ;
-	text-decoration: none ;
-}
-
-a:visited {
-	background-color: inherit ;
-	text-decoration: none ;
-}
-
-a:link:hover, a:visited:hover {
-	color: #000080 ;
-	background-color: #E0E0FF ;
-}
-
-a:link:active, a:visited:active {
-	color: #FF0000 ;
-}
-
-hr {
-	border: 0 ;
-	height: 1px ;
-	color: #a0a0a0 ;
-	background-color: #a0a0a0 ;
-}
-
-:target {
-	background-color: #F8F8F8 ;
-	padding: 8px ;
-	border: solid #a0a0a0 2px ;
-}
-
-.footer {
-	color: gray ;
-	font-size: small ;
-}
-
-input[type=text] {
-	border: solid #a0a0a0 2px ;
-	border-radius: 2em ;
-	-moz-border-radius: 2em ;
-	background-image: url('images/search.png') ;
-	background-repeat: no-repeat;
-	background-position: 4px center ;
-	padding-left: 20px ;
-	height: 2em ;
-}
-
diff --git a/redis-stable/deps/lua/doc/lua.html b/redis-stable/deps/lua/doc/lua.html
deleted file mode 100644
index 1d435ab0..00000000
--- a/redis-stable/deps/lua/doc/lua.html
+++ /dev/null
@@ -1,172 +0,0 @@
-<!-- $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $ -->
-<HTML>
-<HEAD>
-<TITLE>LUA man page</TITLE>
-<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
-</HEAD>
-
-<BODY BGCOLOR="#FFFFFF">
-
-<H2>NAME</H2>
-lua - Lua interpreter
-<H2>SYNOPSIS</H2>
-<B>lua</B>
-[
-<I>options</I>
-]
-[
-<I>script</I>
-[
-<I>args</I>
-]
-]
-<H2>DESCRIPTION</H2>
-<B>lua</B>
-is the stand-alone Lua interpreter.
-It loads and executes Lua programs,
-either in textual source form or
-in precompiled binary form.
-(Precompiled binaries are output by
-<B>luac</B>,
-the Lua compiler.)
-<B>lua</B>
-can be used as a batch interpreter and also interactively.
-<P>
-The given
-<I>options</I>
-(see below)
-are executed and then
-the Lua program in file
-<I>script</I>
-is loaded and executed.
-The given
-<I>args</I>
-are available to
-<I>script</I>
-as strings in a global table named
-<B>arg</B>.
-If these arguments contain spaces or other characters special to the shell,
-then they should be quoted
-(but note that the quotes will be removed by the shell).
-The arguments in
-<B>arg</B>
-start at 0,
-which contains the string
-'<I>script</I>'.
-The index of the last argument is stored in
-<B>arg.n</B>.
-The arguments given in the command line before
-<I>script</I>,
-including the name of the interpreter,
-are available in negative indices in
-<B>arg</B>.
-<P>
-At the very start,
-before even handling the command line,
-<B>lua</B>
-executes the contents of the environment variable
-<B>LUA_INIT</B>,
-if it is defined.
-If the value of
-<B>LUA_INIT</B>
-is of the form
-'@<I>filename</I>',
-then
-<I>filename</I>
-is executed.
-Otherwise, the string is assumed to be a Lua statement and is executed.
-<P>
-Options start with
-<B>'-'</B>
-and are described below.
-You can use
-<B>'--'</B>
-to signal the end of options.
-<P>
-If no arguments are given,
-then
-<B>"-v -i"</B>
-is assumed when the standard input is a terminal;
-otherwise,
-<B>"-"</B>
-is assumed.
-<P>
-In interactive mode,
-<B>lua</B>
-prompts the user,
-reads lines from the standard input,
-and executes them as they are read.
-If a line does not contain a complete statement,
-then a secondary prompt is displayed and
-lines are read until a complete statement is formed or
-a syntax error is found.
-So, one way to interrupt the reading of an incomplete statement is
-to force a syntax error:
-adding a
-<B>';'</B>
-in the middle of a statement is a sure way of forcing a syntax error
-(except inside multiline strings and comments; these must be closed explicitly).
-If a line starts with
-<B>'='</B>,
-then
-<B>lua</B>
-displays the values of all the expressions in the remainder of the
-line. The expressions must be separated by commas.
-The primary prompt is the value of the global variable
-<B>_PROMPT</B>,
-if this value is a string;
-otherwise, the default prompt is used.
-Similarly, the secondary prompt is the value of the global variable
-<B>_PROMPT2</B>.
-So,
-to change the prompts,
-set the corresponding variable to a string of your choice.
-You can do that after calling the interpreter
-or on the command line
-(but in this case you have to be careful with quotes
-if the prompt string contains a space; otherwise you may confuse the shell.)
-The default prompts are "&gt; " and "&gt;&gt; ".
-<H2>OPTIONS</H2>
-<P>
-<B>-</B>
-load and execute the standard input as a file,
-that is,
-not interactively,
-even when the standard input is a terminal.
-<P>
-<B>-e </B><I>stat</I>
-execute statement
-<I>stat</I>.
-You need to quote
-<I>stat </I>
-if it contains spaces, quotes,
-or other characters special to the shell.
-<P>
-<B>-i</B>
-enter interactive mode after
-<I>script</I>
-is executed.
-<P>
-<B>-l </B><I>name</I>
-call
-<B>require</B>('<I>name</I>')
-before executing
-<I>script</I>.
-Typically used to load libraries.
-<P>
-<B>-v</B>
-show version information.
-<H2>SEE ALSO</H2>
-<B>luac</B>(1)
-<BR>
-<A HREF="http://www.lua.org/">http://www.lua.org/</A>
-<H2>DIAGNOSTICS</H2>
-Error messages should be self explanatory.
-<H2>AUTHORS</H2>
-R. Ierusalimschy,
-L. H. de Figueiredo,
-and
-W. Celes
-<!-- EOF -->
-</BODY>
-</HTML>
diff --git a/redis-stable/deps/lua/doc/luac.1 b/redis-stable/deps/lua/doc/luac.1
deleted file mode 100644
index d8146782..00000000
--- a/redis-stable/deps/lua/doc/luac.1
+++ /dev/null
@@ -1,136 +0,0 @@
-.\" $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $
-.TH LUAC 1 "$Date: 2006/01/06 16:03:34 $"
-.SH NAME
-luac \- Lua compiler
-.SH SYNOPSIS
-.B luac
-[
-.I options
-] [
-.I filenames
-]
-.SH DESCRIPTION
-.B luac
-is the Lua compiler.
-It translates programs written in the Lua programming language
-into binary files that can be later loaded and executed.
-.LP
-The main advantages of precompiling chunks are:
-faster loading,
-protecting source code from accidental user changes,
-and
-off-line syntax checking.
-.LP
-Pre-compiling does not imply faster execution
-because in Lua chunks are always compiled into bytecodes before being executed.
-.B luac
-simply allows those bytecodes to be saved in a file for later execution.
-.LP
-Pre-compiled chunks are not necessarily smaller than the corresponding source.
-The main goal in pre-compiling is faster loading.
-.LP
-The binary files created by
-.B luac
-are portable only among architectures with the same word size and byte order.
-.LP
-.B luac
-produces a single output file containing the bytecodes
-for all source files given.
-By default,
-the output file is named
-.BR luac.out ,
-but you can change this with the
-.B \-o
-option.
-.LP
-In the command line,
-you can mix
-text files containing Lua source and
-binary files containing precompiled chunks.
-This is useful to combine several precompiled chunks,
-even from different (but compatible) platforms,
-into a single precompiled chunk.
-.LP
-You can use
-.B "'\-'"
-to indicate the standard input as a source file
-and
-.B "'\--'"
-to signal the end of options
-(that is,
-all remaining arguments will be treated as files even if they start with
-.BR "'\-'" ).
-.LP
-The internal format of the binary files produced by
-.B luac
-is likely to change when a new version of Lua is released.
-So,
-save the source files of all Lua programs that you precompile.
-.LP
-.SH OPTIONS
-Options must be separate.
-.TP
-.B \-l
-produce a listing of the compiled bytecode for Lua's virtual machine.
-Listing bytecodes is useful to learn about Lua's virtual machine.
-If no files are given, then
-.B luac
-loads
-.B luac.out
-and lists its contents.
-.TP
-.BI \-o " file"
-output to
-.IR file ,
-instead of the default
-.BR luac.out .
-(You can use
-.B "'\-'"
-for standard output,
-but not on platforms that open standard output in text mode.)
-The output file may be a source file because
-all files are loaded before the output file is written.
-Be careful not to overwrite precious files.
-.TP
-.B \-p
-load files but do not generate any output file.
-Used mainly for syntax checking and for testing precompiled chunks:
-corrupted files will probably generate errors when loaded.
-Lua always performs a thorough integrity test on precompiled chunks.
-Bytecode that passes this test is completely safe,
-in the sense that it will not break the interpreter.
-However,
-there is no guarantee that such code does anything sensible.
-(None can be given, because the halting problem is unsolvable.)
-If no files are given, then
-.B luac
-loads
-.B luac.out
-and tests its contents.
-No messages are displayed if the file passes the integrity test.
-.TP
-.B \-s
-strip debug information before writing the output file.
-This saves some space in very large chunks,
-but if errors occur when running a stripped chunk,
-then the error messages may not contain the full information they usually do.
-For instance,
-line numbers and names of local variables are lost.
-.TP
-.B \-v
-show version information.
-.SH FILES
-.TP 15
-.B luac.out
-default output file
-.SH "SEE ALSO"
-.BR lua (1)
-.br
-http://www.lua.org/
-.SH DIAGNOSTICS
-Error messages should be self explanatory.
-.SH AUTHORS
-L. H. de Figueiredo,
-R. Ierusalimschy and
-W. Celes
-.\" EOF
diff --git a/redis-stable/deps/lua/doc/luac.html b/redis-stable/deps/lua/doc/luac.html
deleted file mode 100644
index 179ffe82..00000000
--- a/redis-stable/deps/lua/doc/luac.html
+++ /dev/null
@@ -1,145 +0,0 @@
-<!-- $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $ -->
-<HTML>
-<HEAD>
-<TITLE>LUAC man page</TITLE>
-<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
-</HEAD>
-
-<BODY BGCOLOR="#FFFFFF">
-
-<H2>NAME</H2>
-luac - Lua compiler
-<H2>SYNOPSIS</H2>
-<B>luac</B>
-[
-<I>options</I>
-] [
-<I>filenames</I>
-]
-<H2>DESCRIPTION</H2>
-<B>luac</B>
-is the Lua compiler.
-It translates programs written in the Lua programming language
-into binary files that can be later loaded and executed.
-<P>
-The main advantages of precompiling chunks are:
-faster loading,
-protecting source code from accidental user changes,
-and
-off-line syntax checking.
-<P>
-Precompiling does not imply faster execution
-because in Lua chunks are always compiled into bytecodes before being executed.
-<B>luac</B>
-simply allows those bytecodes to be saved in a file for later execution.
-<P>
-Precompiled chunks are not necessarily smaller than the corresponding source.
-The main goal in precompiling is faster loading.
-<P>
-The binary files created by
-<B>luac</B>
-are portable only among architectures with the same word size and byte order.
-<P>
-<B>luac</B>
-produces a single output file containing the bytecodes
-for all source files given.
-By default,
-the output file is named
-<B>luac.out</B>,
-but you can change this with the
-<B>-o</B>
-option.
-<P>
-In the command line,
-you can mix
-text files containing Lua source and
-binary files containing precompiled chunks.
-This is useful because several precompiled chunks,
-even from different (but compatible) platforms,
-can be combined into a single precompiled chunk.
-<P>
-You can use
-<B>'-'</B>
-to indicate the standard input as a source file
-and
-<B>'--'</B>
-to signal the end of options
-(that is,
-all remaining arguments will be treated as files even if they start with
-<B>'-'</B>).
-<P>
-The internal format of the binary files produced by
-<B>luac</B>
-is likely to change when a new version of Lua is released.
-So,
-save the source files of all Lua programs that you precompile.
-<P>
-<H2>OPTIONS</H2>
-Options must be separate.
-<P>
-<B>-l</B>
-produce a listing of the compiled bytecode for Lua's virtual machine.
-Listing bytecodes is useful to learn about Lua's virtual machine.
-If no files are given, then
-<B>luac</B>
-loads
-<B>luac.out</B>
-and lists its contents.
-<P>
-<B>-o </B><I>file</I>
-output to
-<I>file</I>,
-instead of the default
-<B>luac.out</B>.
-(You can use
-<B>'-'</B>
-for standard output,
-but not on platforms that open standard output in text mode.)
-The output file may be a source file because
-all files are loaded before the output file is written.
-Be careful not to overwrite precious files.
-<P>
-<B>-p</B>
-load files but do not generate any output file.
-Used mainly for syntax checking and for testing precompiled chunks:
-corrupted files will probably generate errors when loaded.
-Lua always performs a thorough integrity test on precompiled chunks.
-Bytecode that passes this test is completely safe,
-in the sense that it will not break the interpreter.
-However,
-there is no guarantee that such code does anything sensible.
-(None can be given, because the halting problem is unsolvable.)
-If no files are given, then
-<B>luac</B>
-loads
-<B>luac.out</B>
-and tests its contents.
-No messages are displayed if the file passes the integrity test.
-<P>
-<B>-s</B>
-strip debug information before writing the output file.
-This saves some space in very large chunks,
-but if errors occur when running a stripped chunk,
-then the error messages may not contain the full information they usually do.
-For instance,
-line numbers and names of local variables are lost.
-<P>
-<B>-v</B>
-show version information.
-<H2>FILES</H2>
-<P>
-<B>luac.out</B>
-default output file
-<H2>SEE ALSO</H2>
-<B>lua</B>(1)
-<BR>
-<A HREF="http://www.lua.org/">http://www.lua.org/</A>
-<H2>DIAGNOSTICS</H2>
-Error messages should be self explanatory.
-<H2>AUTHORS</H2>
-L. H. de Figueiredo,
-R. Ierusalimschy and
-W. Celes
-<!-- EOF -->
-</BODY>
-</HTML>
diff --git a/redis-stable/deps/lua/doc/manual.css b/redis-stable/deps/lua/doc/manual.css
deleted file mode 100644
index b49b3629..00000000
--- a/redis-stable/deps/lua/doc/manual.css
+++ /dev/null
@@ -1,24 +0,0 @@
-h3 code {
-	font-family: inherit ;
-	font-size: inherit ;
-}
-
-pre, code {
-	font-size: 12pt ;
-}
-
-span.apii {
-	float: right ;
-	font-family: inherit ;
-	font-style: normal ;
-	font-size: small ;
-	color: gray ;
-}
-
-p+h1, ul+h1 {
-	padding-top: 0.4em ;
-	padding-bottom: 0.4em ;
-	padding-left: 30px ;
-	margin-left: -30px ;
-	background-color: #E0E0FF ;
-}
diff --git a/redis-stable/deps/lua/doc/manual.html b/redis-stable/deps/lua/doc/manual.html
deleted file mode 100644
index 4e41683d..00000000
--- a/redis-stable/deps/lua/doc/manual.html
+++ /dev/null
@@ -1,8804 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-
-<head>
-<title>Lua 5.1 Reference Manual</title>
-<link rel="stylesheet" type="text/css" href="lua.css">
-<link rel="stylesheet" type="text/css" href="manual.css">
-<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=iso-8859-1">
-</head>
-
-<body>
-
-<hr>
-<h1>
-<a href="http://www.lua.org/"><img src="logo.gif" alt="" border="0"></a>
-Lua 5.1 Reference Manual
-</h1>
-
-by Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes
-<p>
-<small>
-Copyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.
-Freely available under the terms of the
-<a href="http://www.lua.org/license.html">Lua license</a>.
-</small>
-<hr>
-<p>
-
-<a href="contents.html#contents">contents</A>
-&middot;
-<a href="contents.html#index">index</A>
-&middot;
-<A HREF="http://www.lua.org/manual/">other versions</A>
-
-<!-- ====================================================================== -->
-<p>
-
-<!-- $Id: manual.of,v 1.49.1.2 2012/01/13 20:23:26 roberto Exp $ -->
-
-
-
-
-<h1>1 - <a name="1">Introduction</a></h1>
-
-<p>
-Lua is an extension programming language designed to support
-general procedural programming with data description
-facilities.
-It also offers good support for object-oriented programming,
-functional programming, and data-driven programming.
-Lua is intended to be used as a powerful, light-weight
-scripting language for any program that needs one.
-Lua is implemented as a library, written in <em>clean</em> C
-(that is, in the common subset of ANSI&nbsp;C and C++).
-
-
-<p>
-Being an extension language, Lua has no notion of a "main" program:
-it only works <em>embedded</em> in a host client,
-called the <em>embedding program</em> or simply the <em>host</em>.
-This host program can invoke functions to execute a piece of Lua code,
-can write and read Lua variables,
-and can register C&nbsp;functions to be called by Lua code.
-Through the use of C&nbsp;functions, Lua can be augmented to cope with
-a wide range of different domains,
-thus creating customized programming languages sharing a syntactical framework.
-The Lua distribution includes a sample host program called <code>lua</code>,
-which uses the Lua library to offer a complete, stand-alone Lua interpreter.
-
-
-<p>
-Lua is free software,
-and is provided as usual with no guarantees,
-as stated in its license.
-The implementation described in this manual is available
-at Lua's official web site, <code>www.lua.org</code>.
-
-
-<p>
-Like any other reference manual,
-this document is dry in places.
-For a discussion of the decisions behind the design of Lua,
-see the technical papers available at Lua's web site.
-For a detailed introduction to programming in Lua,
-see Roberto's book, <em>Programming in Lua (Second Edition)</em>.
-
-
-
-<h1>2 - <a name="2">The Language</a></h1>
-
-<p>
-This section describes the lexis, the syntax, and the semantics of Lua.
-In other words,
-this section describes
-which tokens are valid,
-how they can be combined,
-and what their combinations mean.
-
-
-<p>
-The language constructs will be explained using the usual extended BNF notation,
-in which
-{<em>a</em>}&nbsp;means&nbsp;0 or more <em>a</em>'s, and
-[<em>a</em>]&nbsp;means an optional <em>a</em>.
-Non-terminals are shown like non-terminal,
-keywords are shown like <b>kword</b>,
-and other terminal symbols are shown like `<b>=</b>&acute;.
-The complete syntax of Lua can be found in <a href="#8">&sect;8</a>
-at the end of this manual.
-
-
-
-<h2>2.1 - <a name="2.1">Lexical Conventions</a></h2>
-
-<p>
-<em>Names</em>
-(also called <em>identifiers</em>)
-in Lua can be any string of letters,
-digits, and underscores,
-not beginning with a digit.
-This coincides with the definition of names in most languages.
-(The definition of letter depends on the current locale:
-any character considered alphabetic by the current locale
-can be used in an identifier.)
-Identifiers are used to name variables and table fields.
-
-
-<p>
-The following <em>keywords</em> are reserved
-and cannot be used as names:
-
-
-<pre>
-     and       break     do        else      elseif
-     end       false     for       function  if
-     in        local     nil       not       or
-     repeat    return    then      true      until     while
-</pre>
-
-<p>
-Lua is a case-sensitive language:
-<code>and</code> is a reserved word, but <code>And</code> and <code>AND</code>
-are two different, valid names.
-As a convention, names starting with an underscore followed by
-uppercase letters (such as <a href="#pdf-_VERSION"><code>_VERSION</code></a>)
-are reserved for internal global variables used by Lua.
-
-
-<p>
-The following strings denote other tokens:
-
-<pre>
-     +     -     *     /     %     ^     #
-     ==    ~=    &lt;=    &gt;=    &lt;     &gt;     =
-     (     )     {     }     [     ]
-     ;     :     ,     .     ..    ...
-</pre>
-
-<p>
-<em>Literal strings</em>
-can be delimited by matching single or double quotes,
-and can contain the following C-like escape sequences:
-'<code>\a</code>' (bell),
-'<code>\b</code>' (backspace),
-'<code>\f</code>' (form feed),
-'<code>\n</code>' (newline),
-'<code>\r</code>' (carriage return),
-'<code>\t</code>' (horizontal tab),
-'<code>\v</code>' (vertical tab),
-'<code>\\</code>' (backslash),
-'<code>\"</code>' (quotation mark [double quote]),
-and '<code>\'</code>' (apostrophe [single quote]).
-Moreover, a backslash followed by a real newline
-results in a newline in the string.
-A character in a string can also be specified by its numerical value
-using the escape sequence <code>\<em>ddd</em></code>,
-where <em>ddd</em> is a sequence of up to three decimal digits.
-(Note that if a numerical escape is to be followed by a digit,
-it must be expressed using exactly three digits.)
-Strings in Lua can contain any 8-bit value, including embedded zeros,
-which can be specified as '<code>\0</code>'.
-
-
-<p>
-Literal strings can also be defined using a long format
-enclosed by <em>long brackets</em>.
-We define an <em>opening long bracket of level <em>n</em></em> as an opening
-square bracket followed by <em>n</em> equal signs followed by another
-opening square bracket.
-So, an opening long bracket of level&nbsp;0 is written as <code>[[</code>,
-an opening long bracket of level&nbsp;1 is written as <code>[=[</code>,
-and so on.
-A <em>closing long bracket</em> is defined similarly;
-for instance, a closing long bracket of level&nbsp;4 is written as <code>]====]</code>.
-A long string starts with an opening long bracket of any level and
-ends at the first closing long bracket of the same level.
-Literals in this bracketed form can run for several lines,
-do not interpret any escape sequences,
-and ignore long brackets of any other level.
-They can contain anything except a closing bracket of the proper level.
-
-
-<p>
-For convenience,
-when the opening long bracket is immediately followed by a newline,
-the newline is not included in the string.
-As an example, in a system using ASCII
-(in which '<code>a</code>' is coded as&nbsp;97,
-newline is coded as&nbsp;10, and '<code>1</code>' is coded as&nbsp;49),
-the five literal strings below denote the same string:
-
-<pre>
-     a = 'alo\n123"'
-     a = "alo\n123\""
-     a = '\97lo\10\04923"'
-     a = [[alo
-     123"]]
-     a = [==[
-     alo
-     123"]==]
-</pre>
-
-<p>
-A <em>numerical constant</em> can be written with an optional decimal part
-and an optional decimal exponent.
-Lua also accepts integer hexadecimal constants,
-by prefixing them with <code>0x</code>.
-Examples of valid numerical constants are
-
-<pre>
-     3   3.0   3.1416   314.16e-2   0.31416E1   0xff   0x56
-</pre>
-
-<p>
-A <em>comment</em> starts with a double hyphen (<code>--</code>)
-anywhere outside a string.
-If the text immediately after <code>--</code> is not an opening long bracket,
-the comment is a <em>short comment</em>,
-which runs until the end of the line.
-Otherwise, it is a <em>long comment</em>,
-which runs until the corresponding closing long bracket.
-Long comments are frequently used to disable code temporarily.
-
-
-
-
-
-<h2>2.2 - <a name="2.2">Values and Types</a></h2>
-
-<p>
-Lua is a <em>dynamically typed language</em>.
-This means that
-variables do not have types; only values do.
-There are no type definitions in the language.
-All values carry their own type.
-
-
-<p>
-All values in Lua are <em>first-class values</em>.
-This means that all values can be stored in variables,
-passed as arguments to other functions, and returned as results.
-
-
-<p>
-There are eight basic types in Lua:
-<em>nil</em>, <em>boolean</em>, <em>number</em>,
-<em>string</em>, <em>function</em>, <em>userdata</em>,
-<em>thread</em>, and <em>table</em>.
-<em>Nil</em> is the type of the value <b>nil</b>,
-whose main property is to be different from any other value;
-it usually represents the absence of a useful value.
-<em>Boolean</em> is the type of the values <b>false</b> and <b>true</b>.
-Both <b>nil</b> and <b>false</b> make a condition false;
-any other value makes it true.
-<em>Number</em> represents real (double-precision floating-point) numbers.
-(It is easy to build Lua interpreters that use other
-internal representations for numbers,
-such as single-precision float or long integers;
-see file <code>luaconf.h</code>.)
-<em>String</em> represents arrays of characters.
-
-Lua is 8-bit clean:
-strings can contain any 8-bit character,
-including embedded zeros ('<code>\0</code>') (see <a href="#2.1">&sect;2.1</a>).
-
-
-<p>
-Lua can call (and manipulate) functions written in Lua and
-functions written in C
-(see <a href="#2.5.8">&sect;2.5.8</a>).
-
-
-<p>
-The type <em>userdata</em> is provided to allow arbitrary C&nbsp;data to
-be stored in Lua variables.
-This type corresponds to a block of raw memory
-and has no pre-defined operations in Lua,
-except assignment and identity test.
-However, by using <em>metatables</em>,
-the programmer can define operations for userdata values
-(see <a href="#2.8">&sect;2.8</a>).
-Userdata values cannot be created or modified in Lua,
-only through the C&nbsp;API.
-This guarantees the integrity of data owned by the host program.
-
-
-<p>
-The type <em>thread</em> represents independent threads of execution
-and it is used to implement coroutines (see <a href="#2.11">&sect;2.11</a>).
-Do not confuse Lua threads with operating-system threads.
-Lua supports coroutines on all systems,
-even those that do not support threads.
-
-
-<p>
-The type <em>table</em> implements associative arrays,
-that is, arrays that can be indexed not only with numbers,
-but with any value (except <b>nil</b>).
-Tables can be <em>heterogeneous</em>;
-that is, they can contain values of all types (except <b>nil</b>).
-Tables are the sole data structuring mechanism in Lua;
-they can be used to represent ordinary arrays,
-symbol tables, sets, records, graphs, trees, etc.
-To represent records, Lua uses the field name as an index.
-The language supports this representation by
-providing <code>a.name</code> as syntactic sugar for <code>a["name"]</code>.
-There are several convenient ways to create tables in Lua
-(see <a href="#2.5.7">&sect;2.5.7</a>).
-
-
-<p>
-Like indices,
-the value of a table field can be of any type (except <b>nil</b>).
-In particular,
-because functions are first-class values,
-table fields can contain functions.
-Thus tables can also carry <em>methods</em> (see <a href="#2.5.9">&sect;2.5.9</a>).
-
-
-<p>
-Tables, functions, threads, and (full) userdata values are <em>objects</em>:
-variables do not actually <em>contain</em> these values,
-only <em>references</em> to them.
-Assignment, parameter passing, and function returns
-always manipulate references to such values;
-these operations do not imply any kind of copy.
-
-
-<p>
-The library function <a href="#pdf-type"><code>type</code></a> returns a string describing the type
-of a given value.
-
-
-
-<h3>2.2.1 - <a name="2.2.1">Coercion</a></h3>
-
-<p>
-Lua provides automatic conversion between
-string and number values at run time.
-Any arithmetic operation applied to a string tries to convert
-this string to a number, following the usual conversion rules.
-Conversely, whenever a number is used where a string is expected,
-the number is converted to a string, in a reasonable format.
-For complete control over how numbers are converted to strings,
-use the <code>format</code> function from the string library
-(see <a href="#pdf-string.format"><code>string.format</code></a>).
-
-
-
-
-
-
-
-<h2>2.3 - <a name="2.3">Variables</a></h2>
-
-<p>
-Variables are places that store values.
-
-There are three kinds of variables in Lua:
-global variables, local variables, and table fields.
-
-
-<p>
-A single name can denote a global variable or a local variable
-(or a function's formal parameter,
-which is a particular kind of local variable):
-
-<pre>
-	var ::= Name
-</pre><p>
-Name denotes identifiers, as defined in <a href="#2.1">&sect;2.1</a>.
-
-
-<p>
-Any variable is assumed to be global unless explicitly declared
-as a local (see <a href="#2.4.7">&sect;2.4.7</a>).
-Local variables are <em>lexically scoped</em>:
-local variables can be freely accessed by functions
-defined inside their scope (see <a href="#2.6">&sect;2.6</a>).
-
-
-<p>
-Before the first assignment to a variable, its value is <b>nil</b>.
-
-
-<p>
-Square brackets are used to index a table:
-
-<pre>
-	var ::= prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute;
-</pre><p>
-The meaning of accesses to global variables 
-and table fields can be changed via metatables.
-An access to an indexed variable <code>t[i]</code> is equivalent to
-a call <code>gettable_event(t,i)</code>.
-(See <a href="#2.8">&sect;2.8</a> for a complete description of the
-<code>gettable_event</code> function.
-This function is not defined or callable in Lua.
-We use it here only for explanatory purposes.)
-
-
-<p>
-The syntax <code>var.Name</code> is just syntactic sugar for
-<code>var["Name"]</code>:
-
-<pre>
-	var ::= prefixexp `<b>.</b>&acute; Name
-</pre>
-
-<p>
-All global variables live as fields in ordinary Lua tables,
-called <em>environment tables</em> or simply
-<em>environments</em> (see <a href="#2.9">&sect;2.9</a>).
-Each function has its own reference to an environment,
-so that all global variables in this function
-will refer to this environment table.
-When a function is created,
-it inherits the environment from the function that created it.
-To get the environment table of a Lua function,
-you call <a href="#pdf-getfenv"><code>getfenv</code></a>.
-To replace it,
-you call <a href="#pdf-setfenv"><code>setfenv</code></a>.
-(You can only manipulate the environment of C&nbsp;functions
-through the debug library; (see <a href="#5.9">&sect;5.9</a>).)
-
-
-<p>
-An access to a global variable <code>x</code>
-is equivalent to <code>_env.x</code>,
-which in turn is equivalent to
-
-<pre>
-     gettable_event(_env, "x")
-</pre><p>
-where <code>_env</code> is the environment of the running function.
-(See <a href="#2.8">&sect;2.8</a> for a complete description of the
-<code>gettable_event</code> function.
-This function is not defined or callable in Lua.
-Similarly, the <code>_env</code> variable is not defined in Lua.
-We use them here only for explanatory purposes.)
-
-
-
-
-
-<h2>2.4 - <a name="2.4">Statements</a></h2>
-
-<p>
-Lua supports an almost conventional set of statements,
-similar to those in Pascal or C.
-This set includes
-assignments, control structures, function calls,
-and variable declarations.
-
-
-
-<h3>2.4.1 - <a name="2.4.1">Chunks</a></h3>
-
-<p>
-The unit of execution of Lua is called a <em>chunk</em>.
-A chunk is simply a sequence of statements,
-which are executed sequentially.
-Each statement can be optionally followed by a semicolon:
-
-<pre>
-	chunk ::= {stat [`<b>;</b>&acute;]}
-</pre><p>
-There are no empty statements and thus '<code>;;</code>' is not legal.
-
-
-<p>
-Lua handles a chunk as the body of an anonymous function 
-with a variable number of arguments
-(see <a href="#2.5.9">&sect;2.5.9</a>).
-As such, chunks can define local variables,
-receive arguments, and return values.
-
-
-<p>
-A chunk can be stored in a file or in a string inside the host program.
-To execute a chunk,
-Lua first pre-compiles the chunk into instructions for a virtual machine,
-and then it executes the compiled code
-with an interpreter for the virtual machine.
-
-
-<p>
-Chunks can also be pre-compiled into binary form;
-see program <code>luac</code> for details.
-Programs in source and compiled forms are interchangeable;
-Lua automatically detects the file type and acts accordingly.
-
-
-
-
-
-
-<h3>2.4.2 - <a name="2.4.2">Blocks</a></h3><p>
-A block is a list of statements;
-syntactically, a block is the same as a chunk:
-
-<pre>
-	block ::= chunk
-</pre>
-
-<p>
-A block can be explicitly delimited to produce a single statement:
-
-<pre>
-	stat ::= <b>do</b> block <b>end</b>
-</pre><p>
-Explicit blocks are useful
-to control the scope of variable declarations.
-Explicit blocks are also sometimes used to
-add a <b>return</b> or <b>break</b> statement in the middle
-of another block (see <a href="#2.4.4">&sect;2.4.4</a>).
-
-
-
-
-
-<h3>2.4.3 - <a name="2.4.3">Assignment</a></h3>
-
-<p>
-Lua allows multiple assignments.
-Therefore, the syntax for assignment
-defines a list of variables on the left side
-and a list of expressions on the right side.
-The elements in both lists are separated by commas:
-
-<pre>
-	stat ::= varlist `<b>=</b>&acute; explist
-	varlist ::= var {`<b>,</b>&acute; var}
-	explist ::= exp {`<b>,</b>&acute; exp}
-</pre><p>
-Expressions are discussed in <a href="#2.5">&sect;2.5</a>.
-
-
-<p>
-Before the assignment,
-the list of values is <em>adjusted</em> to the length of
-the list of variables.
-If there are more values than needed,
-the excess values are thrown away.
-If there are fewer values than needed,
-the list is extended with as many  <b>nil</b>'s as needed.
-If the list of expressions ends with a function call,
-then all values returned by that call enter the list of values,
-before the adjustment
-(except when the call is enclosed in parentheses; see <a href="#2.5">&sect;2.5</a>).
-
-
-<p>
-The assignment statement first evaluates all its expressions
-and only then are the assignments performed.
-Thus the code
-
-<pre>
-     i = 3
-     i, a[i] = i+1, 20
-</pre><p>
-sets <code>a[3]</code> to 20, without affecting <code>a[4]</code>
-because the <code>i</code> in <code>a[i]</code> is evaluated (to 3)
-before it is assigned&nbsp;4.
-Similarly, the line
-
-<pre>
-     x, y = y, x
-</pre><p>
-exchanges the values of <code>x</code> and <code>y</code>,
-and
-
-<pre>
-     x, y, z = y, z, x
-</pre><p>
-cyclically permutes the values of <code>x</code>, <code>y</code>, and <code>z</code>.
-
-
-<p>
-The meaning of assignments to global variables
-and table fields can be changed via metatables.
-An assignment to an indexed variable <code>t[i] = val</code> is equivalent to
-<code>settable_event(t,i,val)</code>.
-(See <a href="#2.8">&sect;2.8</a> for a complete description of the
-<code>settable_event</code> function.
-This function is not defined or callable in Lua.
-We use it here only for explanatory purposes.)
-
-
-<p>
-An assignment to a global variable <code>x = val</code>
-is equivalent to the assignment
-<code>_env.x = val</code>,
-which in turn is equivalent to
-
-<pre>
-     settable_event(_env, "x", val)
-</pre><p>
-where <code>_env</code> is the environment of the running function.
-(The <code>_env</code> variable is not defined in Lua.
-We use it here only for explanatory purposes.)
-
-
-
-
-
-<h3>2.4.4 - <a name="2.4.4">Control Structures</a></h3><p>
-The control structures
-<b>if</b>, <b>while</b>, and <b>repeat</b> have the usual meaning and
-familiar syntax:
-
-
-
-
-<pre>
-	stat ::= <b>while</b> exp <b>do</b> block <b>end</b>
-	stat ::= <b>repeat</b> block <b>until</b> exp
-	stat ::= <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b>
-</pre><p>
-Lua also has a <b>for</b> statement, in two flavors (see <a href="#2.4.5">&sect;2.4.5</a>).
-
-
-<p>
-The condition expression of a
-control structure can return any value.
-Both <b>false</b> and <b>nil</b> are considered false.
-All values different from <b>nil</b> and <b>false</b> are considered true
-(in particular, the number 0 and the empty string are also true).
-
-
-<p>
-In the <b>repeat</b>&ndash;<b>until</b> loop,
-the inner block does not end at the <b>until</b> keyword,
-but only after the condition.
-So, the condition can refer to local variables
-declared inside the loop block.
-
-
-<p>
-The <b>return</b> statement is used to return values
-from a function or a chunk (which is just a function).
-
-Functions and chunks can return more than one value,
-and so the syntax for the <b>return</b> statement is
-
-<pre>
-	stat ::= <b>return</b> [explist]
-</pre>
-
-<p>
-The <b>break</b> statement is used to terminate the execution of a
-<b>while</b>, <b>repeat</b>, or <b>for</b> loop,
-skipping to the next statement after the loop:
-
-
-<pre>
-	stat ::= <b>break</b>
-</pre><p>
-A <b>break</b> ends the innermost enclosing loop.
-
-
-<p>
-The <b>return</b> and <b>break</b>
-statements can only be written as the <em>last</em> statement of a block.
-If it is really necessary to <b>return</b> or <b>break</b> in the
-middle of a block,
-then an explicit inner block can be used,
-as in the idioms
-<code>do return end</code> and <code>do break end</code>,
-because now <b>return</b> and <b>break</b> are the last statements in
-their (inner) blocks.
-
-
-
-
-
-<h3>2.4.5 - <a name="2.4.5">For Statement</a></h3>
-
-<p>
-
-The <b>for</b> statement has two forms:
-one numeric and one generic.
-
-
-<p>
-The numeric <b>for</b> loop repeats a block of code while a
-control variable runs through an arithmetic progression.
-It has the following syntax:
-
-<pre>
-	stat ::= <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b>
-</pre><p>
-The <em>block</em> is repeated for <em>name</em> starting at the value of
-the first <em>exp</em>, until it passes the second <em>exp</em> by steps of the
-third <em>exp</em>.
-More precisely, a <b>for</b> statement like
-
-<pre>
-     for v = <em>e1</em>, <em>e2</em>, <em>e3</em> do <em>block</em> end
-</pre><p>
-is equivalent to the code:
-
-<pre>
-     do
-       local <em>var</em>, <em>limit</em>, <em>step</em> = tonumber(<em>e1</em>), tonumber(<em>e2</em>), tonumber(<em>e3</em>)
-       if not (<em>var</em> and <em>limit</em> and <em>step</em>) then error() end
-       while (<em>step</em> &gt; 0 and <em>var</em> &lt;= <em>limit</em>) or (<em>step</em> &lt;= 0 and <em>var</em> &gt;= <em>limit</em>) do
-         local v = <em>var</em>
-         <em>block</em>
-         <em>var</em> = <em>var</em> + <em>step</em>
-       end
-     end
-</pre><p>
-Note the following:
-
-<ul>
-
-<li>
-All three control expressions are evaluated only once,
-before the loop starts.
-They must all result in numbers.
-</li>
-
-<li>
-<code><em>var</em></code>, <code><em>limit</em></code>, and <code><em>step</em></code> are invisible variables.
-The names shown here are for explanatory purposes only.
-</li>
-
-<li>
-If the third expression (the step) is absent,
-then a step of&nbsp;1 is used.
-</li>
-
-<li>
-You can use <b>break</b> to exit a <b>for</b> loop.
-</li>
-
-<li>
-The loop variable <code>v</code> is local to the loop;
-you cannot use its value after the <b>for</b> ends or is broken.
-If you need this value,
-assign it to another variable before breaking or exiting the loop.
-</li>
-
-</ul>
-
-<p>
-The generic <b>for</b> statement works over functions,
-called <em>iterators</em>.
-On each iteration, the iterator function is called to produce a new value,
-stopping when this new value is <b>nil</b>.
-The generic <b>for</b> loop has the following syntax:
-
-<pre>
-	stat ::= <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b>
-	namelist ::= Name {`<b>,</b>&acute; Name}
-</pre><p>
-A <b>for</b> statement like
-
-<pre>
-     for <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> in <em>explist</em> do <em>block</em> end
-</pre><p>
-is equivalent to the code:
-
-<pre>
-     do
-       local <em>f</em>, <em>s</em>, <em>var</em> = <em>explist</em>
-       while true do
-         local <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> = <em>f</em>(<em>s</em>, <em>var</em>)
-         <em>var</em> = <em>var_1</em>
-         if <em>var</em> == nil then break end
-         <em>block</em>
-       end
-     end
-</pre><p>
-Note the following:
-
-<ul>
-
-<li>
-<code><em>explist</em></code> is evaluated only once.
-Its results are an <em>iterator</em> function,
-a <em>state</em>,
-and an initial value for the first <em>iterator variable</em>.
-</li>
-
-<li>
-<code><em>f</em></code>, <code><em>s</em></code>, and <code><em>var</em></code> are invisible variables.
-The names are here for explanatory purposes only.
-</li>
-
-<li>
-You can use <b>break</b> to exit a <b>for</b> loop.
-</li>
-
-<li>
-The loop variables <code><em>var_i</em></code> are local to the loop;
-you cannot use their values after the <b>for</b> ends.
-If you need these values,
-then assign them to other variables before breaking or exiting the loop.
-</li>
-
-</ul>
-
-
-
-
-<h3>2.4.6 - <a name="2.4.6">Function Calls as Statements</a></h3><p>
-To allow possible side-effects,
-function calls can be executed as statements:
-
-<pre>
-	stat ::= functioncall
-</pre><p>
-In this case, all returned values are thrown away.
-Function calls are explained in <a href="#2.5.8">&sect;2.5.8</a>.
-
-
-
-
-
-<h3>2.4.7 - <a name="2.4.7">Local Declarations</a></h3><p>
-Local variables can be declared anywhere inside a block.
-The declaration can include an initial assignment:
-
-<pre>
-	stat ::= <b>local</b> namelist [`<b>=</b>&acute; explist]
-</pre><p>
-If present, an initial assignment has the same semantics
-of a multiple assignment (see <a href="#2.4.3">&sect;2.4.3</a>).
-Otherwise, all variables are initialized with <b>nil</b>.
-
-
-<p>
-A chunk is also a block (see <a href="#2.4.1">&sect;2.4.1</a>),
-and so local variables can be declared in a chunk outside any explicit block.
-The scope of such local variables extends until the end of the chunk.
-
-
-<p>
-The visibility rules for local variables are explained in <a href="#2.6">&sect;2.6</a>.
-
-
-
-
-
-
-
-<h2>2.5 - <a name="2.5">Expressions</a></h2>
-
-<p>
-The basic expressions in Lua are the following:
-
-<pre>
-	exp ::= prefixexp
-	exp ::= <b>nil</b> | <b>false</b> | <b>true</b>
-	exp ::= Number
-	exp ::= String
-	exp ::= function
-	exp ::= tableconstructor
-	exp ::= `<b>...</b>&acute;
-	exp ::= exp binop exp
-	exp ::= unop exp
-	prefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;
-</pre>
-
-<p>
-Numbers and literal strings are explained in <a href="#2.1">&sect;2.1</a>;
-variables are explained in <a href="#2.3">&sect;2.3</a>;
-function definitions are explained in <a href="#2.5.9">&sect;2.5.9</a>;
-function calls are explained in <a href="#2.5.8">&sect;2.5.8</a>;
-table constructors are explained in <a href="#2.5.7">&sect;2.5.7</a>.
-Vararg expressions,
-denoted by three dots ('<code>...</code>'), can only be used when
-directly inside a vararg function;
-they are explained in <a href="#2.5.9">&sect;2.5.9</a>.
-
-
-<p>
-Binary operators comprise arithmetic operators (see <a href="#2.5.1">&sect;2.5.1</a>),
-relational operators (see <a href="#2.5.2">&sect;2.5.2</a>), logical operators (see <a href="#2.5.3">&sect;2.5.3</a>),
-and the concatenation operator (see <a href="#2.5.4">&sect;2.5.4</a>).
-Unary operators comprise the unary minus (see <a href="#2.5.1">&sect;2.5.1</a>),
-the unary <b>not</b> (see <a href="#2.5.3">&sect;2.5.3</a>),
-and the unary <em>length operator</em> (see <a href="#2.5.5">&sect;2.5.5</a>).
-
-
-<p>
-Both function calls and vararg expressions can result in multiple values.
-If an expression is used as a statement
-(only possible for function calls (see <a href="#2.4.6">&sect;2.4.6</a>)),
-then its return list is adjusted to zero elements,
-thus discarding all returned values.
-If an expression is used as the last (or the only) element
-of a list of expressions,
-then no adjustment is made
-(unless the call is enclosed in parentheses).
-In all other contexts,
-Lua adjusts the result list to one element,
-discarding all values except the first one.
-
-
-<p>
-Here are some examples:
-
-<pre>
-     f()                -- adjusted to 0 results
-     g(f(), x)          -- f() is adjusted to 1 result
-     g(x, f())          -- g gets x plus all results from f()
-     a,b,c = f(), x     -- f() is adjusted to 1 result (c gets nil)
-     a,b = ...          -- a gets the first vararg parameter, b gets
-                        -- the second (both a and b can get nil if there
-                        -- is no corresponding vararg parameter)
-     
-     a,b,c = x, f()     -- f() is adjusted to 2 results
-     a,b,c = f()        -- f() is adjusted to 3 results
-     return f()         -- returns all results from f()
-     return ...         -- returns all received vararg parameters
-     return x,y,f()     -- returns x, y, and all results from f()
-     {f()}              -- creates a list with all results from f()
-     {...}              -- creates a list with all vararg parameters
-     {f(), nil}         -- f() is adjusted to 1 result
-</pre>
-
-<p>
-Any expression enclosed in parentheses always results in only one value.
-Thus,
-<code>(f(x,y,z))</code> is always a single value,
-even if <code>f</code> returns several values.
-(The value of <code>(f(x,y,z))</code> is the first value returned by <code>f</code>
-or <b>nil</b> if <code>f</code> does not return any values.)
-
-
-
-<h3>2.5.1 - <a name="2.5.1">Arithmetic Operators</a></h3><p>
-Lua supports the usual arithmetic operators:
-the binary <code>+</code> (addition),
-<code>-</code> (subtraction), <code>*</code> (multiplication),
-<code>/</code> (division), <code>%</code> (modulo), and <code>^</code> (exponentiation);
-and unary <code>-</code> (negation).
-If the operands are numbers, or strings that can be converted to
-numbers (see <a href="#2.2.1">&sect;2.2.1</a>),
-then all operations have the usual meaning.
-Exponentiation works for any exponent.
-For instance, <code>x^(-0.5)</code> computes the inverse of the square root of <code>x</code>.
-Modulo is defined as
-
-<pre>
-     a % b == a - math.floor(a/b)*b
-</pre><p>
-That is, it is the remainder of a division that rounds
-the quotient towards minus infinity.
-
-
-
-
-
-<h3>2.5.2 - <a name="2.5.2">Relational Operators</a></h3><p>
-The relational operators in Lua are
-
-<pre>
-     ==    ~=    &lt;     &gt;     &lt;=    &gt;=
-</pre><p>
-These operators always result in <b>false</b> or <b>true</b>.
-
-
-<p>
-Equality (<code>==</code>) first compares the type of its operands.
-If the types are different, then the result is <b>false</b>.
-Otherwise, the values of the operands are compared.
-Numbers and strings are compared in the usual way.
-Objects (tables, userdata, threads, and functions)
-are compared by <em>reference</em>:
-two objects are considered equal only if they are the <em>same</em> object.
-Every time you create a new object
-(a table, userdata, thread, or function),
-this new object is different from any previously existing object.
-
-
-<p>
-You can change the way that Lua compares tables and userdata 
-by using the "eq" metamethod (see <a href="#2.8">&sect;2.8</a>).
-
-
-<p>
-The conversion rules of <a href="#2.2.1">&sect;2.2.1</a>
-<em>do not</em> apply to equality comparisons.
-Thus, <code>"0"==0</code> evaluates to <b>false</b>,
-and <code>t[0]</code> and <code>t["0"]</code> denote different
-entries in a table.
-
-
-<p>
-The operator <code>~=</code> is exactly the negation of equality (<code>==</code>).
-
-
-<p>
-The order operators work as follows.
-If both arguments are numbers, then they are compared as such.
-Otherwise, if both arguments are strings,
-then their values are compared according to the current locale.
-Otherwise, Lua tries to call the "lt" or the "le"
-metamethod (see <a href="#2.8">&sect;2.8</a>).
-A comparison <code>a &gt; b</code> is translated to <code>b &lt; a</code>
-and <code>a &gt;= b</code> is translated to <code>b &lt;= a</code>.
-
-
-
-
-
-<h3>2.5.3 - <a name="2.5.3">Logical Operators</a></h3><p>
-The logical operators in Lua are
-<b>and</b>, <b>or</b>, and <b>not</b>.
-Like the control structures (see <a href="#2.4.4">&sect;2.4.4</a>),
-all logical operators consider both <b>false</b> and <b>nil</b> as false
-and anything else as true.
-
-
-<p>
-The negation operator <b>not</b> always returns <b>false</b> or <b>true</b>.
-The conjunction operator <b>and</b> returns its first argument
-if this value is <b>false</b> or <b>nil</b>;
-otherwise, <b>and</b> returns its second argument.
-The disjunction operator <b>or</b> returns its first argument
-if this value is different from <b>nil</b> and <b>false</b>;
-otherwise, <b>or</b> returns its second argument.
-Both <b>and</b> and <b>or</b> use short-cut evaluation;
-that is,
-the second operand is evaluated only if necessary.
-Here are some examples:
-
-<pre>
-     10 or 20            --&gt; 10
-     10 or error()       --&gt; 10
-     nil or "a"          --&gt; "a"
-     nil and 10          --&gt; nil
-     false and error()   --&gt; false
-     false and nil       --&gt; false
-     false or nil        --&gt; nil
-     10 and 20           --&gt; 20
-</pre><p>
-(In this manual,
-<code>--&gt;</code> indicates the result of the preceding expression.)
-
-
-
-
-
-<h3>2.5.4 - <a name="2.5.4">Concatenation</a></h3><p>
-The string concatenation operator in Lua is
-denoted by two dots ('<code>..</code>').
-If both operands are strings or numbers, then they are converted to
-strings according to the rules mentioned in <a href="#2.2.1">&sect;2.2.1</a>.
-Otherwise, the "concat" metamethod is called (see <a href="#2.8">&sect;2.8</a>).
-
-
-
-
-
-<h3>2.5.5 - <a name="2.5.5">The Length Operator</a></h3>
-
-<p>
-The length operator is denoted by the unary operator <code>#</code>.
-The length of a string is its number of bytes
-(that is, the usual meaning of string length when each
-character is one byte).
-
-
-<p>
-The length of a table <code>t</code> is defined to be any
-integer index <code>n</code>
-such that <code>t[n]</code> is not <b>nil</b> and <code>t[n+1]</code> is <b>nil</b>;
-moreover, if <code>t[1]</code> is <b>nil</b>, <code>n</code> can be zero.
-For a regular array, with non-nil values from 1 to a given <code>n</code>,
-its length is exactly that <code>n</code>,
-the index of its last value.
-If the array has "holes"
-(that is, <b>nil</b> values between other non-nil values),
-then <code>#t</code> can be any of the indices that
-directly precedes a <b>nil</b> value
-(that is, it may consider any such <b>nil</b> value as the end of
-the array). 
-
-
-
-
-
-<h3>2.5.6 - <a name="2.5.6">Precedence</a></h3><p>
-Operator precedence in Lua follows the table below,
-from lower to higher priority:
-
-<pre>
-     or
-     and
-     &lt;     &gt;     &lt;=    &gt;=    ~=    ==
-     ..
-     +     -
-     *     /     %
-     not   #     - (unary)
-     ^
-</pre><p>
-As usual,
-you can use parentheses to change the precedences of an expression.
-The concatenation ('<code>..</code>') and exponentiation ('<code>^</code>')
-operators are right associative.
-All other binary operators are left associative.
-
-
-
-
-
-<h3>2.5.7 - <a name="2.5.7">Table Constructors</a></h3><p>
-Table constructors are expressions that create tables.
-Every time a constructor is evaluated, a new table is created.
-A constructor can be used to create an empty table
-or to create a table and initialize some of its fields.
-The general syntax for constructors is
-
-<pre>
-	tableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;
-	fieldlist ::= field {fieldsep field} [fieldsep]
-	field ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp
-	fieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;
-</pre>
-
-<p>
-Each field of the form <code>[exp1] = exp2</code> adds to the new table an entry
-with key <code>exp1</code> and value <code>exp2</code>.
-A field of the form <code>name = exp</code> is equivalent to
-<code>["name"] = exp</code>.
-Finally, fields of the form <code>exp</code> are equivalent to
-<code>[i] = exp</code>, where <code>i</code> are consecutive numerical integers,
-starting with 1.
-Fields in the other formats do not affect this counting.
-For example,
-
-<pre>
-     a = { [f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45 }
-</pre><p>
-is equivalent to
-
-<pre>
-     do
-       local t = {}
-       t[f(1)] = g
-       t[1] = "x"         -- 1st exp
-       t[2] = "y"         -- 2nd exp
-       t.x = 1            -- t["x"] = 1
-       t[3] = f(x)        -- 3rd exp
-       t[30] = 23
-       t[4] = 45          -- 4th exp
-       a = t
-     end
-</pre>
-
-<p>
-If the last field in the list has the form <code>exp</code>
-and the expression is a function call or a vararg expression,
-then all values returned by this expression enter the list consecutively
-(see <a href="#2.5.8">&sect;2.5.8</a>).
-To avoid this,
-enclose the function call or the vararg expression
-in parentheses (see <a href="#2.5">&sect;2.5</a>).
-
-
-<p>
-The field list can have an optional trailing separator,
-as a convenience for machine-generated code.
-
-
-
-
-
-<h3>2.5.8 - <a name="2.5.8">Function Calls</a></h3><p>
-A function call in Lua has the following syntax:
-
-<pre>
-	functioncall ::= prefixexp args
-</pre><p>
-In a function call,
-first prefixexp and args are evaluated.
-If the value of prefixexp has type <em>function</em>,
-then this function is called
-with the given arguments.
-Otherwise, the prefixexp "call" metamethod is called,
-having as first parameter the value of prefixexp,
-followed by the original call arguments
-(see <a href="#2.8">&sect;2.8</a>).
-
-
-<p>
-The form
-
-<pre>
-	functioncall ::= prefixexp `<b>:</b>&acute; Name args
-</pre><p>
-can be used to call "methods".
-A call <code>v:name(<em>args</em>)</code>
-is syntactic sugar for <code>v.name(v,<em>args</em>)</code>,
-except that <code>v</code> is evaluated only once.
-
-
-<p>
-Arguments have the following syntax:
-
-<pre>
-	args ::= `<b>(</b>&acute; [explist] `<b>)</b>&acute;
-	args ::= tableconstructor
-	args ::= String
-</pre><p>
-All argument expressions are evaluated before the call.
-A call of the form <code>f{<em>fields</em>}</code> is
-syntactic sugar for <code>f({<em>fields</em>})</code>;
-that is, the argument list is a single new table.
-A call of the form <code>f'<em>string</em>'</code>
-(or <code>f"<em>string</em>"</code> or <code>f[[<em>string</em>]]</code>)
-is syntactic sugar for <code>f('<em>string</em>')</code>;
-that is, the argument list is a single literal string.
-
-
-<p>
-As an exception to the free-format syntax of Lua,
-you cannot put a line break before the '<code>(</code>' in a function call.
-This restriction avoids some ambiguities in the language.
-If you write
-
-<pre>
-     a = f
-     (g).x(a)
-</pre><p>
-Lua would see that as a single statement, <code>a = f(g).x(a)</code>.
-So, if you want two statements, you must add a semi-colon between them.
-If you actually want to call <code>f</code>,
-you must remove the line break before <code>(g)</code>.
-
-
-<p>
-A call of the form <code>return</code> <em>functioncall</em> is called
-a <em>tail call</em>.
-Lua implements <em>proper tail calls</em>
-(or <em>proper tail recursion</em>):
-in a tail call,
-the called function reuses the stack entry of the calling function.
-Therefore, there is no limit on the number of nested tail calls that
-a program can execute.
-However, a tail call erases any debug information about the
-calling function.
-Note that a tail call only happens with a particular syntax,
-where the <b>return</b> has one single function call as argument;
-this syntax makes the calling function return exactly
-the returns of the called function.
-So, none of the following examples are tail calls:
-
-<pre>
-     return (f(x))        -- results adjusted to 1
-     return 2 * f(x)
-     return x, f(x)       -- additional results
-     f(x); return         -- results discarded
-     return x or f(x)     -- results adjusted to 1
-</pre>
-
-
-
-
-<h3>2.5.9 - <a name="2.5.9">Function Definitions</a></h3>
-
-<p>
-The syntax for function definition is
-
-<pre>
-	function ::= <b>function</b> funcbody
-	funcbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>
-</pre>
-
-<p>
-The following syntactic sugar simplifies function definitions:
-
-<pre>
-	stat ::= <b>function</b> funcname funcbody
-	stat ::= <b>local</b> <b>function</b> Name funcbody
-	funcname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]
-</pre><p>
-The statement
-
-<pre>
-     function f () <em>body</em> end
-</pre><p>
-translates to
-
-<pre>
-     f = function () <em>body</em> end
-</pre><p>
-The statement
-
-<pre>
-     function t.a.b.c.f () <em>body</em> end
-</pre><p>
-translates to
-
-<pre>
-     t.a.b.c.f = function () <em>body</em> end
-</pre><p>
-The statement
-
-<pre>
-     local function f () <em>body</em> end
-</pre><p>
-translates to
-
-<pre>
-     local f; f = function () <em>body</em> end
-</pre><p>
-<em>not</em> to
-
-<pre>
-     local f = function () <em>body</em> end
-</pre><p>
-(This only makes a difference when the body of the function
-contains references to <code>f</code>.)
-
-
-<p>
-A function definition is an executable expression,
-whose value has type <em>function</em>.
-When Lua pre-compiles a chunk,
-all its function bodies are pre-compiled too.
-Then, whenever Lua executes the function definition,
-the function is <em>instantiated</em> (or <em>closed</em>).
-This function instance (or <em>closure</em>)
-is the final value of the expression.
-Different instances of the same function
-can refer to different  external local variables
-and can have different environment tables.
-
-
-<p>
-Parameters act as local variables that are
-initialized with the argument values:
-
-<pre>
-	parlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;
-</pre><p>
-When a function is called,
-the list of arguments is adjusted to
-the length of the list of parameters,
-unless the function is a variadic or <em>vararg function</em>,
-which is
-indicated by three dots ('<code>...</code>') at the end of its parameter list.
-A vararg function does not adjust its argument list;
-instead, it collects all extra arguments and supplies them
-to the function through a <em>vararg expression</em>,
-which is also written as three dots.
-The value of this expression is a list of all actual extra arguments,
-similar to a function with multiple results.
-If a vararg expression is used inside another expression
-or in the middle of a list of expressions,
-then its return list is adjusted to one element.
-If the expression is used as the last element of a list of expressions,
-then no adjustment is made
-(unless that last expression is enclosed in parentheses).
-
-
-<p>
-As an example, consider the following definitions:
-
-<pre>
-     function f(a, b) end
-     function g(a, b, ...) end
-     function r() return 1,2,3 end
-</pre><p>
-Then, we have the following mapping from arguments to parameters and
-to the vararg expression:
-
-<pre>
-     CALL            PARAMETERS
-     
-     f(3)             a=3, b=nil
-     f(3, 4)          a=3, b=4
-     f(3, 4, 5)       a=3, b=4
-     f(r(), 10)       a=1, b=10
-     f(r())           a=1, b=2
-     
-     g(3)             a=3, b=nil, ... --&gt;  (nothing)
-     g(3, 4)          a=3, b=4,   ... --&gt;  (nothing)
-     g(3, 4, 5, 8)    a=3, b=4,   ... --&gt;  5  8
-     g(5, r())        a=5, b=1,   ... --&gt;  2  3
-</pre>
-
-<p>
-Results are returned using the <b>return</b> statement (see <a href="#2.4.4">&sect;2.4.4</a>).
-If control reaches the end of a function
-without encountering a <b>return</b> statement,
-then the function returns with no results.
-
-
-<p>
-The <em>colon</em> syntax
-is used for defining <em>methods</em>,
-that is, functions that have an implicit extra parameter <code>self</code>.
-Thus, the statement
-
-<pre>
-     function t.a.b.c:f (<em>params</em>) <em>body</em> end
-</pre><p>
-is syntactic sugar for
-
-<pre>
-     t.a.b.c.f = function (self, <em>params</em>) <em>body</em> end
-</pre>
-
-
-
-
-
-
-<h2>2.6 - <a name="2.6">Visibility Rules</a></h2>
-
-<p>
-
-Lua is a lexically scoped language.
-The scope of variables begins at the first statement <em>after</em>
-their declaration and lasts until the end of the innermost block that
-includes the declaration.
-Consider the following example:
-
-<pre>
-     x = 10                -- global variable
-     do                    -- new block
-       local x = x         -- new 'x', with value 10
-       print(x)            --&gt; 10
-       x = x+1
-       do                  -- another block
-         local x = x+1     -- another 'x'
-         print(x)          --&gt; 12
-       end
-       print(x)            --&gt; 11
-     end
-     print(x)              --&gt; 10  (the global one)
-</pre>
-
-<p>
-Notice that, in a declaration like <code>local x = x</code>,
-the new <code>x</code> being declared is not in scope yet,
-and so the second <code>x</code> refers to the outside variable.
-
-
-<p>
-Because of the lexical scoping rules,
-local variables can be freely accessed by functions
-defined inside their scope.
-A local variable used by an inner function is called
-an <em>upvalue</em>, or <em>external local variable</em>,
-inside the inner function.
-
-
-<p>
-Notice that each execution of a <b>local</b> statement
-defines new local variables.
-Consider the following example:
-
-<pre>
-     a = {}
-     local x = 20
-     for i=1,10 do
-       local y = 0
-       a[i] = function () y=y+1; return x+y end
-     end
-</pre><p>
-The loop creates ten closures
-(that is, ten instances of the anonymous function).
-Each of these closures uses a different <code>y</code> variable,
-while all of them share the same <code>x</code>.
-
-
-
-
-
-<h2>2.7 - <a name="2.7">Error Handling</a></h2>
-
-<p>
-Because Lua is an embedded extension language,
-all Lua actions start from C&nbsp;code in the host program
-calling a function from the Lua library (see <a href="#lua_pcall"><code>lua_pcall</code></a>).
-Whenever an error occurs during Lua compilation or execution,
-control returns to C,
-which can take appropriate measures
-(such as printing an error message).
-
-
-<p>
-Lua code can explicitly generate an error by calling the
-<a href="#pdf-error"><code>error</code></a> function.
-If you need to catch errors in Lua,
-you can use the <a href="#pdf-pcall"><code>pcall</code></a> function.
-
-
-
-
-
-<h2>2.8 - <a name="2.8">Metatables</a></h2>
-
-<p>
-Every value in Lua can have a <em>metatable</em>.
-This <em>metatable</em> is an ordinary Lua table
-that defines the behavior of the original value
-under certain special operations.
-You can change several aspects of the behavior
-of operations over a value by setting specific fields in its metatable.
-For instance, when a non-numeric value is the operand of an addition,
-Lua checks for a function in the field <code>"__add"</code> in its metatable.
-If it finds one,
-Lua calls this function to perform the addition.
-
-
-<p>
-We call the keys in a metatable <em>events</em>
-and the values <em>metamethods</em>.
-In the previous example, the event is <code>"add"</code> 
-and the metamethod is the function that performs the addition.
-
-
-<p>
-You can query the metatable of any value
-through the <a href="#pdf-getmetatable"><code>getmetatable</code></a> function.
-
-
-<p>
-You can replace the metatable of tables
-through the <a href="#pdf-setmetatable"><code>setmetatable</code></a>
-function.
-You cannot change the metatable of other types from Lua
-(except by using the debug library);
-you must use the C&nbsp;API for that.
-
-
-<p>
-Tables and full userdata have individual metatables
-(although multiple tables and userdata can share their metatables).
-Values of all other types share one single metatable per type;
-that is, there is one single metatable for all numbers,
-one for all strings, etc.
-
-
-<p>
-A metatable controls how an object behaves in arithmetic operations,
-order comparisons, concatenation, length operation, and indexing.
-A metatable also can define a function to be called when a userdata
-is garbage collected.
-For each of these operations Lua associates a specific key
-called an <em>event</em>.
-When Lua performs one of these operations over a value,
-it checks whether this value has a metatable with the corresponding event.
-If so, the value associated with that key (the metamethod)
-controls how Lua will perform the operation.
-
-
-<p>
-Metatables control the operations listed next.
-Each operation is identified by its corresponding name.
-The key for each operation is a string with its name prefixed by
-two underscores, '<code>__</code>';
-for instance, the key for operation "add" is the
-string <code>"__add"</code>.
-The semantics of these operations is better explained by a Lua function
-describing how the interpreter executes the operation.
-
-
-<p>
-The code shown here in Lua is only illustrative;
-the real behavior is hard coded in the interpreter
-and it is much more efficient than this simulation.
-All functions used in these descriptions
-(<a href="#pdf-rawget"><code>rawget</code></a>, <a href="#pdf-tonumber"><code>tonumber</code></a>, etc.)
-are described in <a href="#5.1">&sect;5.1</a>.
-In particular, to retrieve the metamethod of a given object,
-we use the expression
-
-<pre>
-     metatable(obj)[event]
-</pre><p>
-This should be read as
-
-<pre>
-     rawget(getmetatable(obj) or {}, event)
-</pre><p>
-
-That is, the access to a metamethod does not invoke other metamethods,
-and the access to objects with no metatables does not fail
-(it simply results in <b>nil</b>).
-
-
-
-<ul>
-
-<li><b>"add":</b>
-the <code>+</code> operation.
-
-
-
-<p>
-The function <code>getbinhandler</code> below defines how Lua chooses a handler
-for a binary operation.
-First, Lua tries the first operand.
-If its type does not define a handler for the operation,
-then Lua tries the second operand.
-
-<pre>
-     function getbinhandler (op1, op2, event)
-       return metatable(op1)[event] or metatable(op2)[event]
-     end
-</pre><p>
-By using this function,
-the behavior of the <code>op1 + op2</code> is
-
-<pre>
-     function add_event (op1, op2)
-       local o1, o2 = tonumber(op1), tonumber(op2)
-       if o1 and o2 then  -- both operands are numeric?
-         return o1 + o2   -- '+' here is the primitive 'add'
-       else  -- at least one of the operands is not numeric
-         local h = getbinhandler(op1, op2, "__add")
-         if h then
-           -- call the handler with both operands
-           return (h(op1, op2))
-         else  -- no handler available: default behavior
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-</li>
-
-<li><b>"sub":</b>
-the <code>-</code> operation.
-
-Behavior similar to the "add" operation.
-</li>
-
-<li><b>"mul":</b>
-the <code>*</code> operation.
-
-Behavior similar to the "add" operation.
-</li>
-
-<li><b>"div":</b>
-the <code>/</code> operation.
-
-Behavior similar to the "add" operation.
-</li>
-
-<li><b>"mod":</b>
-the <code>%</code> operation.
-
-Behavior similar to the "add" operation,
-with the operation
-<code>o1 - floor(o1/o2)*o2</code> as the primitive operation.
-</li>
-
-<li><b>"pow":</b>
-the <code>^</code> (exponentiation) operation.
-
-Behavior similar to the "add" operation,
-with the function <code>pow</code> (from the C&nbsp;math library)
-as the primitive operation.
-</li>
-
-<li><b>"unm":</b>
-the unary <code>-</code> operation.
-
-
-<pre>
-     function unm_event (op)
-       local o = tonumber(op)
-       if o then  -- operand is numeric?
-         return -o  -- '-' here is the primitive 'unm'
-       else  -- the operand is not numeric.
-         -- Try to get a handler from the operand
-         local h = metatable(op).__unm
-         if h then
-           -- call the handler with the operand
-           return (h(op))
-         else  -- no handler available: default behavior
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-</li>
-
-<li><b>"concat":</b>
-the <code>..</code> (concatenation) operation.
-
-
-<pre>
-     function concat_event (op1, op2)
-       if (type(op1) == "string" or type(op1) == "number") and
-          (type(op2) == "string" or type(op2) == "number") then
-         return op1 .. op2  -- primitive string concatenation
-       else
-         local h = getbinhandler(op1, op2, "__concat")
-         if h then
-           return (h(op1, op2))
-         else
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-</li>
-
-<li><b>"len":</b>
-the <code>#</code> operation.
-
-
-<pre>
-     function len_event (op)
-       if type(op) == "string" then
-         return strlen(op)         -- primitive string length
-       elseif type(op) == "table" then
-         return #op                -- primitive table length
-       else
-         local h = metatable(op).__len
-         if h then
-           -- call the handler with the operand
-           return (h(op))
-         else  -- no handler available: default behavior
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-See <a href="#2.5.5">&sect;2.5.5</a> for a description of the length of a table.
-</li>
-
-<li><b>"eq":</b>
-the <code>==</code> operation.
-
-The function <code>getcomphandler</code> defines how Lua chooses a metamethod
-for comparison operators.
-A metamethod only is selected when both objects
-being compared have the same type
-and the same metamethod for the selected operation.
-
-<pre>
-     function getcomphandler (op1, op2, event)
-       if type(op1) ~= type(op2) then return nil end
-       local mm1 = metatable(op1)[event]
-       local mm2 = metatable(op2)[event]
-       if mm1 == mm2 then return mm1 else return nil end
-     end
-</pre><p>
-The "eq" event is defined as follows:
-
-<pre>
-     function eq_event (op1, op2)
-       if type(op1) ~= type(op2) then  -- different types?
-         return false   -- different objects
-       end
-       if op1 == op2 then   -- primitive equal?
-         return true   -- objects are equal
-       end
-       -- try metamethod
-       local h = getcomphandler(op1, op2, "__eq")
-       if h then
-         return (h(op1, op2))
-       else
-         return false
-       end
-     end
-</pre><p>
-<code>a ~= b</code> is equivalent to <code>not (a == b)</code>.
-</li>
-
-<li><b>"lt":</b>
-the <code>&lt;</code> operation.
-
-
-<pre>
-     function lt_event (op1, op2)
-       if type(op1) == "number" and type(op2) == "number" then
-         return op1 &lt; op2   -- numeric comparison
-       elseif type(op1) == "string" and type(op2) == "string" then
-         return op1 &lt; op2   -- lexicographic comparison
-       else
-         local h = getcomphandler(op1, op2, "__lt")
-         if h then
-           return (h(op1, op2))
-         else
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-<code>a &gt; b</code> is equivalent to <code>b &lt; a</code>.
-</li>
-
-<li><b>"le":</b>
-the <code>&lt;=</code> operation.
-
-
-<pre>
-     function le_event (op1, op2)
-       if type(op1) == "number" and type(op2) == "number" then
-         return op1 &lt;= op2   -- numeric comparison
-       elseif type(op1) == "string" and type(op2) == "string" then
-         return op1 &lt;= op2   -- lexicographic comparison
-       else
-         local h = getcomphandler(op1, op2, "__le")
-         if h then
-           return (h(op1, op2))
-         else
-           h = getcomphandler(op1, op2, "__lt")
-           if h then
-             return not h(op2, op1)
-           else
-             error(&middot;&middot;&middot;)
-           end
-         end
-       end
-     end
-</pre><p>
-<code>a &gt;= b</code> is equivalent to <code>b &lt;= a</code>.
-Note that, in the absence of a "le" metamethod,
-Lua tries the "lt", assuming that <code>a &lt;= b</code> is
-equivalent to <code>not (b &lt; a)</code>.
-</li>
-
-<li><b>"index":</b>
-The indexing access <code>table[key]</code>.
-
-
-<pre>
-     function gettable_event (table, key)
-       local h
-       if type(table) == "table" then
-         local v = rawget(table, key)
-         if v ~= nil then return v end
-         h = metatable(table).__index
-         if h == nil then return nil end
-       else
-         h = metatable(table).__index
-         if h == nil then
-           error(&middot;&middot;&middot;)
-         end
-       end
-       if type(h) == "function" then
-         return (h(table, key))     -- call the handler
-       else return h[key]           -- or repeat operation on it
-       end
-     end
-</pre><p>
-</li>
-
-<li><b>"newindex":</b>
-The indexing assignment <code>table[key] = value</code>.
-
-
-<pre>
-     function settable_event (table, key, value)
-       local h
-       if type(table) == "table" then
-         local v = rawget(table, key)
-         if v ~= nil then rawset(table, key, value); return end
-         h = metatable(table).__newindex
-         if h == nil then rawset(table, key, value); return end
-       else
-         h = metatable(table).__newindex
-         if h == nil then
-           error(&middot;&middot;&middot;)
-         end
-       end
-       if type(h) == "function" then
-         h(table, key,value)           -- call the handler
-       else h[key] = value             -- or repeat operation on it
-       end
-     end
-</pre><p>
-</li>
-
-<li><b>"call":</b>
-called when Lua calls a value.
-
-
-<pre>
-     function function_event (func, ...)
-       if type(func) == "function" then
-         return func(...)   -- primitive call
-       else
-         local h = metatable(func).__call
-         if h then
-           return h(func, ...)
-         else
-           error(&middot;&middot;&middot;)
-         end
-       end
-     end
-</pre><p>
-</li>
-
-</ul>
-
-
-
-
-<h2>2.9 - <a name="2.9">Environments</a></h2>
-
-<p>
-Besides metatables,
-objects of types thread, function, and userdata
-have another table associated with them,
-called their <em>environment</em>.
-Like metatables, environments are regular tables and
-multiple objects can share the same environment.
-
-
-<p>
-Threads are created sharing the environment of the creating thread.
-Userdata and C&nbsp;functions are created sharing the environment
-of the creating C&nbsp;function.
-Non-nested Lua functions
-(created by <a href="#pdf-loadfile"><code>loadfile</code></a>, <a href="#pdf-loadstring"><code>loadstring</code></a> or <a href="#pdf-load"><code>load</code></a>)
-are created sharing the environment of the creating thread.
-Nested Lua functions are created sharing the environment of
-the creating Lua function.
-
-
-<p>
-Environments associated with userdata have no meaning for Lua.
-It is only a convenience feature for programmers to associate a table to
-a userdata.
-
-
-<p>
-Environments associated with threads are called
-<em>global environments</em>.
-They are used as the default environment for threads and
-non-nested Lua functions created by the thread
-and can be directly accessed by C&nbsp;code (see <a href="#3.3">&sect;3.3</a>).
-
-
-<p>
-The environment associated with a C&nbsp;function can be directly
-accessed by C&nbsp;code (see <a href="#3.3">&sect;3.3</a>).
-It is used as the default environment for other C&nbsp;functions
-and userdata created by the function.
-
-
-<p>
-Environments associated with Lua functions are used to resolve
-all accesses to global variables within the function (see <a href="#2.3">&sect;2.3</a>).
-They are used as the default environment for nested Lua functions
-created by the function.
-
-
-<p>
-You can change the environment of a Lua function or the
-running thread by calling <a href="#pdf-setfenv"><code>setfenv</code></a>.
-You can get the environment of a Lua function or the running thread
-by calling <a href="#pdf-getfenv"><code>getfenv</code></a>.
-To manipulate the environment of other objects
-(userdata, C&nbsp;functions, other threads) you must
-use the C&nbsp;API.
-
-
-
-
-
-<h2>2.10 - <a name="2.10">Garbage Collection</a></h2>
-
-<p>
-Lua performs automatic memory management.
-This means that
-you have to worry neither about allocating memory for new objects
-nor about freeing it when the objects are no longer needed.
-Lua manages memory automatically by running
-a <em>garbage collector</em> from time to time
-to collect all <em>dead objects</em>
-(that is, objects that are no longer accessible from Lua).
-All memory used by Lua is subject to automatic management:
-tables, userdata, functions, threads, strings, etc.
-
-
-<p>
-Lua implements an incremental mark-and-sweep collector.
-It uses two numbers to control its garbage-collection cycles:
-the <em>garbage-collector pause</em> and
-the <em>garbage-collector step multiplier</em>.
-Both use percentage points as units
-(so that a value of 100 means an internal value of 1).
-
-
-<p>
-The garbage-collector pause
-controls how long the collector waits before starting a new cycle.
-Larger values make the collector less aggressive.
-Values smaller than 100 mean the collector will not wait to
-start a new cycle.
-A value of 200 means that the collector waits for the total memory in use
-to double before starting a new cycle.
-
-
-<p>
-The step multiplier
-controls the relative speed of the collector relative to
-memory allocation.
-Larger values make the collector more aggressive but also increase
-the size of each incremental step.
-Values smaller than 100 make the collector too slow and
-can result in the collector never finishing a cycle.
-The default, 200, means that the collector runs at "twice"
-the speed of memory allocation.
-
-
-<p>
-You can change these numbers by calling <a href="#lua_gc"><code>lua_gc</code></a> in C
-or <a href="#pdf-collectgarbage"><code>collectgarbage</code></a> in Lua.
-With these functions you can also control 
-the collector directly (e.g., stop and restart it).
-
-
-
-<h3>2.10.1 - <a name="2.10.1">Garbage-Collection Metamethods</a></h3>
-
-<p>
-Using the C&nbsp;API,
-you can set garbage-collector metamethods for userdata (see <a href="#2.8">&sect;2.8</a>).
-These metamethods are also called <em>finalizers</em>.
-Finalizers allow you to coordinate Lua's garbage collection
-with external resource management
-(such as closing files, network or database connections,
-or freeing your own memory).
-
-
-<p>
-Garbage userdata with a field <code>__gc</code> in their metatables are not
-collected immediately by the garbage collector.
-Instead, Lua puts them in a list.
-After the collection,
-Lua does the equivalent of the following function
-for each userdata in that list:
-
-<pre>
-     function gc_event (udata)
-       local h = metatable(udata).__gc
-       if h then
-         h(udata)
-       end
-     end
-</pre>
-
-<p>
-At the end of each garbage-collection cycle,
-the finalizers for userdata are called in <em>reverse</em>
-order of their creation,
-among those collected in that cycle.
-That is, the first finalizer to be called is the one associated
-with the userdata created last in the program.
-The userdata itself is freed only in the next garbage-collection cycle.
-
-
-
-
-
-<h3>2.10.2 - <a name="2.10.2">Weak Tables</a></h3>
-
-<p>
-A <em>weak table</em> is a table whose elements are
-<em>weak references</em>.
-A weak reference is ignored by the garbage collector.
-In other words,
-if the only references to an object are weak references,
-then the garbage collector will collect this object.
-
-
-<p>
-A weak table can have weak keys, weak values, or both.
-A table with weak keys allows the collection of its keys,
-but prevents the collection of its values.
-A table with both weak keys and weak values allows the collection of
-both keys and values.
-In any case, if either the key or the value is collected,
-the whole pair is removed from the table.
-The weakness of a table is controlled by the
-<code>__mode</code> field of its metatable.
-If the <code>__mode</code> field is a string containing the character&nbsp;'<code>k</code>',
-the keys in the table are weak.
-If <code>__mode</code> contains '<code>v</code>',
-the values in the table are weak.
-
-
-<p>
-After you use a table as a metatable,
-you should not change the value of its <code>__mode</code> field.
-Otherwise, the weak behavior of the tables controlled by this
-metatable is undefined.
-
-
-
-
-
-
-
-<h2>2.11 - <a name="2.11">Coroutines</a></h2>
-
-<p>
-Lua supports coroutines,
-also called <em>collaborative multithreading</em>.
-A coroutine in Lua represents an independent thread of execution.
-Unlike threads in multithread systems, however,
-a coroutine only suspends its execution by explicitly calling
-a yield function.
-
-
-<p>
-You create a coroutine with a call to <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>.
-Its sole argument is a function
-that is the main function of the coroutine.
-The <code>create</code> function only creates a new coroutine and
-returns a handle to it (an object of type <em>thread</em>);
-it does not start the coroutine execution.
-
-
-<p>
-When you first call <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
-passing as its first argument
-a thread returned by <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>,
-the coroutine starts its execution,
-at the first line of its main function.
-Extra arguments passed to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> are passed on
-to the coroutine main function.
-After the coroutine starts running,
-it runs until it terminates or <em>yields</em>.
-
-
-<p>
-A coroutine can terminate its execution in two ways:
-normally, when its main function returns
-(explicitly or implicitly, after the last instruction);
-and abnormally, if there is an unprotected error.
-In the first case, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns <b>true</b>,
-plus any values returned by the coroutine main function.
-In case of errors, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns <b>false</b>
-plus an error message.
-
-
-<p>
-A coroutine yields by calling <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a>.
-When a coroutine yields,
-the corresponding <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> returns immediately,
-even if the yield happens inside nested function calls
-(that is, not in the main function,
-but in a function directly or indirectly called by the main function).
-In the case of a yield, <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a> also returns <b>true</b>,
-plus any values passed to <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a>.
-The next time you resume the same coroutine,
-it continues its execution from the point where it yielded,
-with the call to <a href="#pdf-coroutine.yield"><code>coroutine.yield</code></a> returning any extra
-arguments passed to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>.
-
-
-<p>
-Like <a href="#pdf-coroutine.create"><code>coroutine.create</code></a>,
-the <a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> function also creates a coroutine,
-but instead of returning the coroutine itself,
-it returns a function that, when called, resumes the coroutine.
-Any arguments passed to this function
-go as extra arguments to <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>.
-<a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> returns all the values returned by <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
-except the first one (the boolean error code).
-Unlike <a href="#pdf-coroutine.resume"><code>coroutine.resume</code></a>,
-<a href="#pdf-coroutine.wrap"><code>coroutine.wrap</code></a> does not catch errors;
-any error is propagated to the caller.
-
-
-<p>
-As an example,
-consider the following code:
-
-<pre>
-     function foo (a)
-       print("foo", a)
-       return coroutine.yield(2*a)
-     end
-     
-     co = coroutine.create(function (a,b)
-           print("co-body", a, b)
-           local r = foo(a+1)
-           print("co-body", r)
-           local r, s = coroutine.yield(a+b, a-b)
-           print("co-body", r, s)
-           return b, "end"
-     end)
-            
-     print("main", coroutine.resume(co, 1, 10))
-     print("main", coroutine.resume(co, "r"))
-     print("main", coroutine.resume(co, "x", "y"))
-     print("main", coroutine.resume(co, "x", "y"))
-</pre><p>
-When you run it, it produces the following output:
-
-<pre>
-     co-body 1       10
-     foo     2
-     
-     main    true    4
-     co-body r
-     main    true    11      -9
-     co-body x       y
-     main    true    10      end
-     main    false   cannot resume dead coroutine
-</pre>
-
-
-
-
-<h1>3 - <a name="3">The Application Program Interface</a></h1>
-
-<p>
-
-This section describes the C&nbsp;API for Lua, that is,
-the set of C&nbsp;functions available to the host program to communicate
-with Lua.
-All API functions and related types and constants
-are declared in the header file <a name="pdf-lua.h"><code>lua.h</code></a>.
-
-
-<p>
-Even when we use the term "function",
-any facility in the API may be provided as a macro instead.
-All such macros use each of their arguments exactly once
-(except for the first argument, which is always a Lua state),
-and so do not generate any hidden side-effects.
-
-
-<p>
-As in most C&nbsp;libraries,
-the Lua API functions do not check their arguments for validity or consistency.
-However, you can change this behavior by compiling Lua
-with a proper definition for the macro <a name="pdf-luai_apicheck"><code>luai_apicheck</code></a>,
-in file <code>luaconf.h</code>.
-
-
-
-<h2>3.1 - <a name="3.1">The Stack</a></h2>
-
-<p>
-Lua uses a <em>virtual stack</em> to pass values to and from C.
-Each element in this stack represents a Lua value
-(<b>nil</b>, number, string, etc.).
-
-
-<p>
-Whenever Lua calls C, the called function gets a new stack,
-which is independent of previous stacks and of stacks of
-C&nbsp;functions that are still active.
-This stack initially contains any arguments to the C&nbsp;function
-and it is where the C&nbsp;function pushes its results
-to be returned to the caller (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>).
-
-
-<p>
-For convenience,
-most query operations in the API do not follow a strict stack discipline.
-Instead, they can refer to any element in the stack
-by using an <em>index</em>:
-A positive index represents an <em>absolute</em> stack position
-(starting at&nbsp;1);
-a negative index represents an <em>offset</em> relative to the top of the stack.
-More specifically, if the stack has <em>n</em> elements,
-then index&nbsp;1 represents the first element
-(that is, the element that was pushed onto the stack first)
-and
-index&nbsp;<em>n</em> represents the last element;
-index&nbsp;-1 also represents the last element
-(that is, the element at the&nbsp;top)
-and index <em>-n</em> represents the first element.
-We say that an index is <em>valid</em>
-if it lies between&nbsp;1 and the stack top
-(that is, if <code>1 &le; abs(index) &le; top</code>).
- 
-
-
-
-
-
-<h2>3.2 - <a name="3.2">Stack Size</a></h2>
-
-<p>
-When you interact with Lua API,
-you are responsible for ensuring consistency.
-In particular,
-<em>you are responsible for controlling stack overflow</em>.
-You can use the function <a href="#lua_checkstack"><code>lua_checkstack</code></a>
-to grow the stack size.
-
-
-<p>
-Whenever Lua calls C,
-it ensures that at least <a name="pdf-LUA_MINSTACK"><code>LUA_MINSTACK</code></a> stack positions are available.
-<code>LUA_MINSTACK</code> is defined as 20,
-so that usually you do not have to worry about stack space
-unless your code has loops pushing elements onto the stack.
-
-
-<p>
-Most query functions accept as indices any value inside the
-available stack space, that is, indices up to the maximum stack size
-you have set through <a href="#lua_checkstack"><code>lua_checkstack</code></a>.
-Such indices are called <em>acceptable indices</em>.
-More formally, we define an <em>acceptable index</em>
-as follows:
-
-<pre>
-     (index &lt; 0 &amp;&amp; abs(index) &lt;= top) ||
-     (index &gt; 0 &amp;&amp; index &lt;= stackspace)
-</pre><p>
-Note that 0 is never an acceptable index.
-
-
-
-
-
-<h2>3.3 - <a name="3.3">Pseudo-Indices</a></h2>
-
-<p>
-Unless otherwise noted,
-any function that accepts valid indices can also be called with
-<em>pseudo-indices</em>,
-which represent some Lua values that are accessible to C&nbsp;code
-but which are not in the stack.
-Pseudo-indices are used to access the thread environment,
-the function environment,
-the registry,
-and the upvalues of a C&nbsp;function (see <a href="#3.4">&sect;3.4</a>).
-
-
-<p>
-The thread environment (where global variables live) is
-always at pseudo-index <a name="pdf-LUA_GLOBALSINDEX"><code>LUA_GLOBALSINDEX</code></a>.
-The environment of the running C&nbsp;function is always
-at pseudo-index <a name="pdf-LUA_ENVIRONINDEX"><code>LUA_ENVIRONINDEX</code></a>.
-
-
-<p>
-To access and change the value of global variables,
-you can use regular table operations over an environment table.
-For instance, to access the value of a global variable, do
-
-<pre>
-     lua_getfield(L, LUA_GLOBALSINDEX, varname);
-</pre>
-
-
-
-
-<h2>3.4 - <a name="3.4">C Closures</a></h2>
-
-<p>
-When a C&nbsp;function is created,
-it is possible to associate some values with it,
-thus creating a <em>C&nbsp;closure</em>;
-these values are called <em>upvalues</em> and are
-accessible to the function whenever it is called
-(see <a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a>).
-
-
-<p>
-Whenever a C&nbsp;function is called,
-its upvalues are located at specific pseudo-indices.
-These pseudo-indices are produced by the macro
-<a name="lua_upvalueindex"><code>lua_upvalueindex</code></a>.
-The first value associated with a function is at position
-<code>lua_upvalueindex(1)</code>, and so on.
-Any access to <code>lua_upvalueindex(<em>n</em>)</code>,
-where <em>n</em> is greater than the number of upvalues of the
-current function (but not greater than 256),
-produces an acceptable (but invalid) index.
-
-
-
-
-
-<h2>3.5 - <a name="3.5">Registry</a></h2>
-
-<p>
-Lua provides a <em>registry</em>,
-a pre-defined table that can be used by any C&nbsp;code to
-store whatever Lua value it needs to store.
-This table is always located at pseudo-index
-<a name="pdf-LUA_REGISTRYINDEX"><code>LUA_REGISTRYINDEX</code></a>.
-Any C&nbsp;library can store data into this table,
-but it should take care to choose keys different from those used
-by other libraries, to avoid collisions.
-Typically, you should use as key a string containing your library name
-or a light userdata with the address of a C&nbsp;object in your code.
-
-
-<p>
-The integer keys in the registry are used by the reference mechanism,
-implemented by the auxiliary library,
-and therefore should not be used for other purposes.
-
-
-
-
-
-<h2>3.6 - <a name="3.6">Error Handling in C</a></h2>
-
-<p>
-Internally, Lua uses the C <code>longjmp</code> facility to handle errors.
-(You can also choose to use exceptions if you use C++;
-see file <code>luaconf.h</code>.)
-When Lua faces any error
-(such as memory allocation errors, type errors, syntax errors,
-and runtime errors)
-it <em>raises</em> an error;
-that is, it does a long jump.
-A <em>protected environment</em> uses <code>setjmp</code>
-to set a recover point;
-any error jumps to the most recent active recover point.
-
-
-<p>
-Most functions in the API can throw an error,
-for instance due to a memory allocation error.
-The documentation for each function indicates whether
-it can throw errors.
-
-
-<p>
-Inside a C&nbsp;function you can throw an error by calling <a href="#lua_error"><code>lua_error</code></a>.
-
-
-
-
-
-<h2>3.7 - <a name="3.7">Functions and Types</a></h2>
-
-<p>
-Here we list all functions and types from the C&nbsp;API in
-alphabetical order.
-Each function has an indicator like this:
-<span class="apii">[-o, +p, <em>x</em>]</span>
-
-
-<p>
-The first field, <code>o</code>,
-is how many elements the function pops from the stack.
-The second field, <code>p</code>,
-is how many elements the function pushes onto the stack.
-(Any function always pushes its results after popping its arguments.)
-A field in the form <code>x|y</code> means the function can push (or pop)
-<code>x</code> or <code>y</code> elements,
-depending on the situation;
-an interrogation mark '<code>?</code>' means that
-we cannot know how many elements the function pops/pushes
-by looking only at its arguments
-(e.g., they may depend on what is on the stack).
-The third field, <code>x</code>,
-tells whether the function may throw errors:
-'<code>-</code>' means the function never throws any error;
-'<code>m</code>' means the function may throw an error
-only due to not enough memory;
-'<code>e</code>' means the function may throw other kinds of errors;
-'<code>v</code>' means the function may throw an error on purpose.
-
-
-
-<hr><h3><a name="lua_Alloc"><code>lua_Alloc</code></a></h3>
-<pre>typedef void * (*lua_Alloc) (void *ud,
-                             void *ptr,
-                             size_t osize,
-                             size_t nsize);</pre>
-
-<p>
-The type of the memory-allocation function used by Lua states.
-The allocator function must provide a
-functionality similar to <code>realloc</code>,
-but not exactly the same.
-Its arguments are
-<code>ud</code>, an opaque pointer passed to <a href="#lua_newstate"><code>lua_newstate</code></a>;
-<code>ptr</code>, a pointer to the block being allocated/reallocated/freed;
-<code>osize</code>, the original size of the block;
-<code>nsize</code>, the new size of the block.
-<code>ptr</code> is <code>NULL</code> if and only if <code>osize</code> is zero.
-When <code>nsize</code> is zero, the allocator must return <code>NULL</code>;
-if <code>osize</code> is not zero,
-it should free the block pointed to by <code>ptr</code>.
-When <code>nsize</code> is not zero, the allocator returns <code>NULL</code>
-if and only if it cannot fill the request.
-When <code>nsize</code> is not zero and <code>osize</code> is zero,
-the allocator should behave like <code>malloc</code>.
-When <code>nsize</code> and <code>osize</code> are not zero,
-the allocator behaves like <code>realloc</code>.
-Lua assumes that the allocator never fails when
-<code>osize &gt;= nsize</code>.
-
-
-<p>
-Here is a simple implementation for the allocator function.
-It is used in the auxiliary library by <a href="#luaL_newstate"><code>luaL_newstate</code></a>.
-
-<pre>
-     static void *l_alloc (void *ud, void *ptr, size_t osize,
-                                                size_t nsize) {
-       (void)ud;  (void)osize;  /* not used */
-       if (nsize == 0) {
-         free(ptr);
-         return NULL;
-       }
-       else
-         return realloc(ptr, nsize);
-     }
-</pre><p>
-This code assumes
-that <code>free(NULL)</code> has no effect and that
-<code>realloc(NULL, size)</code> is equivalent to <code>malloc(size)</code>.
-ANSI&nbsp;C ensures both behaviors.
-
-
-
-
-
-<hr><h3><a name="lua_atpanic"><code>lua_atpanic</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf);</pre>
-
-<p>
-Sets a new panic function and returns the old one.
-
-
-<p>
-If an error happens outside any protected environment,
-Lua calls a <em>panic function</em>
-and then calls <code>exit(EXIT_FAILURE)</code>,
-thus exiting the host application.
-Your panic function can avoid this exit by
-never returning (e.g., doing a long jump).
-
-
-<p>
-The panic function can access the error message at the top of the stack.
-
-
-
-
-
-<hr><h3><a name="lua_call"><code>lua_call</code></a></h3><p>
-<span class="apii">[-(nargs + 1), +nresults, <em>e</em>]</span>
-<pre>void lua_call (lua_State *L, int nargs, int nresults);</pre>
-
-<p>
-Calls a function.
-
-
-<p>
-To call a function you must use the following protocol:
-first, the function to be called is pushed onto the stack;
-then, the arguments to the function are pushed
-in direct order;
-that is, the first argument is pushed first.
-Finally you call <a href="#lua_call"><code>lua_call</code></a>;
-<code>nargs</code> is the number of arguments that you pushed onto the stack.
-All arguments and the function value are popped from the stack
-when the function is called.
-The function results are pushed onto the stack when the function returns.
-The number of results is adjusted to <code>nresults</code>,
-unless <code>nresults</code> is <a name="pdf-LUA_MULTRET"><code>LUA_MULTRET</code></a>.
-In this case, <em>all</em> results from the function are pushed.
-Lua takes care that the returned values fit into the stack space.
-The function results are pushed onto the stack in direct order
-(the first result is pushed first),
-so that after the call the last result is on the top of the stack.
-
-
-<p>
-Any error inside the called function is propagated upwards
-(with a <code>longjmp</code>).
-
-
-<p>
-The following example shows how the host program can do the
-equivalent to this Lua code:
-
-<pre>
-     a = f("how", t.x, 14)
-</pre><p>
-Here it is in&nbsp;C:
-
-<pre>
-     lua_getfield(L, LUA_GLOBALSINDEX, "f"); /* function to be called */
-     lua_pushstring(L, "how");                        /* 1st argument */
-     lua_getfield(L, LUA_GLOBALSINDEX, "t");   /* table to be indexed */
-     lua_getfield(L, -1, "x");        /* push result of t.x (2nd arg) */
-     lua_remove(L, -2);                  /* remove 't' from the stack */
-     lua_pushinteger(L, 14);                          /* 3rd argument */
-     lua_call(L, 3, 1);     /* call 'f' with 3 arguments and 1 result */
-     lua_setfield(L, LUA_GLOBALSINDEX, "a");        /* set global 'a' */
-</pre><p>
-Note that the code above is "balanced":
-at its end, the stack is back to its original configuration.
-This is considered good programming practice.
-
-
-
-
-
-<hr><h3><a name="lua_CFunction"><code>lua_CFunction</code></a></h3>
-<pre>typedef int (*lua_CFunction) (lua_State *L);</pre>
-
-<p>
-Type for C&nbsp;functions.
-
-
-<p>
-In order to communicate properly with Lua,
-a C&nbsp;function must use the following protocol,
-which defines the way parameters and results are passed:
-a C&nbsp;function receives its arguments from Lua in its stack
-in direct order (the first argument is pushed first).
-So, when the function starts,
-<code>lua_gettop(L)</code> returns the number of arguments received by the function.
-The first argument (if any) is at index 1
-and its last argument is at index <code>lua_gettop(L)</code>.
-To return values to Lua, a C&nbsp;function just pushes them onto the stack,
-in direct order (the first result is pushed first),
-and returns the number of results.
-Any other value in the stack below the results will be properly
-discarded by Lua.
-Like a Lua function, a C&nbsp;function called by Lua can also return
-many results.
-
-
-<p>
-As an example, the following function receives a variable number
-of numerical arguments and returns their average and sum:
-
-<pre>
-     static int foo (lua_State *L) {
-       int n = lua_gettop(L);    /* number of arguments */
-       lua_Number sum = 0;
-       int i;
-       for (i = 1; i &lt;= n; i++) {
-         if (!lua_isnumber(L, i)) {
-           lua_pushstring(L, "incorrect argument");
-           lua_error(L);
-         }
-         sum += lua_tonumber(L, i);
-       }
-       lua_pushnumber(L, sum/n);        /* first result */
-       lua_pushnumber(L, sum);         /* second result */
-       return 2;                   /* number of results */
-     }
-</pre>
-
-
-
-
-<hr><h3><a name="lua_checkstack"><code>lua_checkstack</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>int lua_checkstack (lua_State *L, int extra);</pre>
-
-<p>
-Ensures that there are at least <code>extra</code> free stack slots in the stack.
-It returns false if it cannot grow the stack to that size.
-This function never shrinks the stack;
-if the stack is already larger than the new size,
-it is left unchanged.
-
-
-
-
-
-<hr><h3><a name="lua_close"><code>lua_close</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>void lua_close (lua_State *L);</pre>
-
-<p>
-Destroys all objects in the given Lua state
-(calling the corresponding garbage-collection metamethods, if any)
-and frees all dynamic memory used by this state.
-On several platforms, you may not need to call this function,
-because all resources are naturally released when the host program ends.
-On the other hand, long-running programs,
-such as a daemon or a web server,
-might need to release states as soon as they are not needed,
-to avoid growing too large.
-
-
-
-
-
-<hr><h3><a name="lua_concat"><code>lua_concat</code></a></h3><p>
-<span class="apii">[-n, +1, <em>e</em>]</span>
-<pre>void lua_concat (lua_State *L, int n);</pre>
-
-<p>
-Concatenates the <code>n</code> values at the top of the stack,
-pops them, and leaves the result at the top.
-If <code>n</code>&nbsp;is&nbsp;1, the result is the single value on the stack
-(that is, the function does nothing);
-if <code>n</code> is 0, the result is the empty string.
-Concatenation is performed following the usual semantics of Lua
-(see <a href="#2.5.4">&sect;2.5.4</a>).
-
-
-
-
-
-<hr><h3><a name="lua_cpcall"><code>lua_cpcall</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>-</em>]</span>
-<pre>int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);</pre>
-
-<p>
-Calls the C&nbsp;function <code>func</code> in protected mode.
-<code>func</code> starts with only one element in its stack,
-a light userdata containing <code>ud</code>.
-In case of errors,
-<a href="#lua_cpcall"><code>lua_cpcall</code></a> returns the same error codes as <a href="#lua_pcall"><code>lua_pcall</code></a>,
-plus the error object on the top of the stack;
-otherwise, it returns zero, and does not change the stack.
-All values returned by <code>func</code> are discarded.
-
-
-
-
-
-<hr><h3><a name="lua_createtable"><code>lua_createtable</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_createtable (lua_State *L, int narr, int nrec);</pre>
-
-<p>
-Creates a new empty table and pushes it onto the stack.
-The new table has space pre-allocated
-for <code>narr</code> array elements and <code>nrec</code> non-array elements.
-This pre-allocation is useful when you know exactly how many elements
-the table will have.
-Otherwise you can use the function <a href="#lua_newtable"><code>lua_newtable</code></a>.
-
-
-
-
-
-<hr><h3><a name="lua_dump"><code>lua_dump</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>int lua_dump (lua_State *L, lua_Writer writer, void *data);</pre>
-
-<p>
-Dumps a function as a binary chunk.
-Receives a Lua function on the top of the stack
-and produces a binary chunk that,
-if loaded again,
-results in a function equivalent to the one dumped.
-As it produces parts of the chunk,
-<a href="#lua_dump"><code>lua_dump</code></a> calls function <code>writer</code> (see <a href="#lua_Writer"><code>lua_Writer</code></a>)
-with the given <code>data</code>
-to write them.
-
-
-<p>
-The value returned is the error code returned by the last
-call to the writer;
-0&nbsp;means no errors.
-
-
-<p>
-This function does not pop the Lua function from the stack.
-
-
-
-
-
-<hr><h3><a name="lua_equal"><code>lua_equal</code></a></h3><p>
-<span class="apii">[-0, +0, <em>e</em>]</span>
-<pre>int lua_equal (lua_State *L, int index1, int index2);</pre>
-
-<p>
-Returns 1 if the two values in acceptable indices <code>index1</code> and
-<code>index2</code> are equal,
-following the semantics of the Lua <code>==</code> operator
-(that is, may call metamethods).
-Otherwise returns&nbsp;0.
-Also returns&nbsp;0 if any of the indices is non valid.
-
-
-
-
-
-<hr><h3><a name="lua_error"><code>lua_error</code></a></h3><p>
-<span class="apii">[-1, +0, <em>v</em>]</span>
-<pre>int lua_error (lua_State *L);</pre>
-
-<p>
-Generates a Lua error.
-The error message (which can actually be a Lua value of any type)
-must be on the stack top.
-This function does a long jump,
-and therefore never returns.
-(see <a href="#luaL_error"><code>luaL_error</code></a>).
-
-
-
-
-
-<hr><h3><a name="lua_gc"><code>lua_gc</code></a></h3><p>
-<span class="apii">[-0, +0, <em>e</em>]</span>
-<pre>int lua_gc (lua_State *L, int what, int data);</pre>
-
-<p>
-Controls the garbage collector.
-
-
-<p>
-This function performs several tasks,
-according to the value of the parameter <code>what</code>:
-
-<ul>
-
-<li><b><code>LUA_GCSTOP</code>:</b>
-stops the garbage collector.
-</li>
-
-<li><b><code>LUA_GCRESTART</code>:</b>
-restarts the garbage collector.
-</li>
-
-<li><b><code>LUA_GCCOLLECT</code>:</b>
-performs a full garbage-collection cycle.
-</li>
-
-<li><b><code>LUA_GCCOUNT</code>:</b>
-returns the current amount of memory (in Kbytes) in use by Lua.
-</li>
-
-<li><b><code>LUA_GCCOUNTB</code>:</b>
-returns the remainder of dividing the current amount of bytes of
-memory in use by Lua by 1024.
-</li>
-
-<li><b><code>LUA_GCSTEP</code>:</b>
-performs an incremental step of garbage collection.
-The step "size" is controlled by <code>data</code>
-(larger values mean more steps) in a non-specified way.
-If you want to control the step size
-you must experimentally tune the value of <code>data</code>.
-The function returns 1 if the step finished a
-garbage-collection cycle.
-</li>
-
-<li><b><code>LUA_GCSETPAUSE</code>:</b>
-sets <code>data</code> as the new value
-for the <em>pause</em> of the collector (see <a href="#2.10">&sect;2.10</a>).
-The function returns the previous value of the pause.
-</li>
-
-<li><b><code>LUA_GCSETSTEPMUL</code>:</b>
-sets <code>data</code> as the new value for the <em>step multiplier</em> of
-the collector (see <a href="#2.10">&sect;2.10</a>).
-The function returns the previous value of the step multiplier.
-</li>
-
-</ul>
-
-
-
-
-<hr><h3><a name="lua_getallocf"><code>lua_getallocf</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_Alloc lua_getallocf (lua_State *L, void **ud);</pre>
-
-<p>
-Returns the memory-allocation function of a given state.
-If <code>ud</code> is not <code>NULL</code>, Lua stores in <code>*ud</code> the
-opaque pointer passed to <a href="#lua_newstate"><code>lua_newstate</code></a>.
-
-
-
-
-
-<hr><h3><a name="lua_getfenv"><code>lua_getfenv</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_getfenv (lua_State *L, int index);</pre>
-
-<p>
-Pushes onto the stack the environment table of
-the value at the given index.
-
-
-
-
-
-<hr><h3><a name="lua_getfield"><code>lua_getfield</code></a></h3><p>
-<span class="apii">[-0, +1, <em>e</em>]</span>
-<pre>void lua_getfield (lua_State *L, int index, const char *k);</pre>
-
-<p>
-Pushes onto the stack the value <code>t[k]</code>,
-where <code>t</code> is the value at the given valid index.
-As in Lua, this function may trigger a metamethod
-for the "index" event (see <a href="#2.8">&sect;2.8</a>).
-
-
-
-
-
-<hr><h3><a name="lua_getglobal"><code>lua_getglobal</code></a></h3><p>
-<span class="apii">[-0, +1, <em>e</em>]</span>
-<pre>void lua_getglobal (lua_State *L, const char *name);</pre>
-
-<p>
-Pushes onto the stack the value of the global <code>name</code>.
-It is defined as a macro:
-
-<pre>
-     #define lua_getglobal(L,s)  lua_getfield(L, LUA_GLOBALSINDEX, s)
-</pre>
-
-
-
-
-<hr><h3><a name="lua_getmetatable"><code>lua_getmetatable</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>-</em>]</span>
-<pre>int lua_getmetatable (lua_State *L, int index);</pre>
-
-<p>
-Pushes onto the stack the metatable of the value at the given
-acceptable index.
-If the index is not valid,
-or if the value does not have a metatable,
-the function returns&nbsp;0 and pushes nothing on the stack.
-
-
-
-
-
-<hr><h3><a name="lua_gettable"><code>lua_gettable</code></a></h3><p>
-<span class="apii">[-1, +1, <em>e</em>]</span>
-<pre>void lua_gettable (lua_State *L, int index);</pre>
-
-<p>
-Pushes onto the stack the value <code>t[k]</code>,
-where <code>t</code> is the value at the given valid index
-and <code>k</code> is the value at the top of the stack.
-
-
-<p>
-This function pops the key from the stack
-(putting the resulting value in its place).
-As in Lua, this function may trigger a metamethod
-for the "index" event (see <a href="#2.8">&sect;2.8</a>).
-
-
-
-
-
-<hr><h3><a name="lua_gettop"><code>lua_gettop</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_gettop (lua_State *L);</pre>
-
-<p>
-Returns the index of the top element in the stack.
-Because indices start at&nbsp;1,
-this result is equal to the number of elements in the stack
-(and so 0&nbsp;means an empty stack).
-
-
-
-
-
-<hr><h3><a name="lua_insert"><code>lua_insert</code></a></h3><p>
-<span class="apii">[-1, +1, <em>-</em>]</span>
-<pre>void lua_insert (lua_State *L, int index);</pre>
-
-<p>
-Moves the top element into the given valid index,
-shifting up the elements above this index to open space.
-Cannot be called with a pseudo-index,
-because a pseudo-index is not an actual stack position.
-
-
-
-
-
-<hr><h3><a name="lua_Integer"><code>lua_Integer</code></a></h3>
-<pre>typedef ptrdiff_t lua_Integer;</pre>
-
-<p>
-The type used by the Lua API to represent integral values.
-
-
-<p>
-By default it is a <code>ptrdiff_t</code>,
-which is usually the largest signed integral type the machine handles
-"comfortably".
-
-
-
-
-
-<hr><h3><a name="lua_isboolean"><code>lua_isboolean</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isboolean (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index has type boolean,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_iscfunction"><code>lua_iscfunction</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_iscfunction (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a C&nbsp;function,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isfunction"><code>lua_isfunction</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isfunction (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a function
-(either C or Lua), and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_islightuserdata"><code>lua_islightuserdata</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_islightuserdata (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a light userdata,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isnil"><code>lua_isnil</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isnil (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is <b>nil</b>,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isnone"><code>lua_isnone</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isnone (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the given acceptable index is not valid
-(that is, it refers to an element outside the current stack),
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isnoneornil"><code>lua_isnoneornil</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isnoneornil (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the given acceptable index is not valid
-(that is, it refers to an element outside the current stack)
-or if the value at this index is <b>nil</b>,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isnumber"><code>lua_isnumber</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isnumber (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a number
-or a string convertible to a number,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isstring"><code>lua_isstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isstring (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a string
-or a number (which is always convertible to a string),
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_istable"><code>lua_istable</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_istable (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a table,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isthread"><code>lua_isthread</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isthread (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a thread,
-and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_isuserdata"><code>lua_isuserdata</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_isuserdata (lua_State *L, int index);</pre>
-
-<p>
-Returns 1 if the value at the given acceptable index is a userdata
-(either full or light), and 0&nbsp;otherwise.
-
-
-
-
-
-<hr><h3><a name="lua_lessthan"><code>lua_lessthan</code></a></h3><p>
-<span class="apii">[-0, +0, <em>e</em>]</span>
-<pre>int lua_lessthan (lua_State *L, int index1, int index2);</pre>
-
-<p>
-Returns 1 if the value at acceptable index <code>index1</code> is smaller
-than the value at acceptable index <code>index2</code>,
-following the semantics of the Lua <code>&lt;</code> operator
-(that is, may call metamethods).
-Otherwise returns&nbsp;0.
-Also returns&nbsp;0 if any of the indices is non valid.
-
-
-
-
-
-<hr><h3><a name="lua_load"><code>lua_load</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>int lua_load (lua_State *L,
-              lua_Reader reader,
-              void *data,
-              const char *chunkname);</pre>
-
-<p>
-Loads a Lua chunk.
-If there are no errors,
-<a href="#lua_load"><code>lua_load</code></a> pushes the compiled chunk as a Lua
-function on top of the stack.
-Otherwise, it pushes an error message.
-The return values of <a href="#lua_load"><code>lua_load</code></a> are:
-
-<ul>
-
-<li><b>0:</b> no errors;</li>
-
-<li><b><a name="pdf-LUA_ERRSYNTAX"><code>LUA_ERRSYNTAX</code></a>:</b>
-syntax error during pre-compilation;</li>
-
-<li><b><a href="#pdf-LUA_ERRMEM"><code>LUA_ERRMEM</code></a>:</b>
-memory allocation error.</li>
-
-</ul>
-
-<p>
-This function only loads a chunk;
-it does not run it.
-
-
-<p>
-<a href="#lua_load"><code>lua_load</code></a> automatically detects whether the chunk is text or binary,
-and loads it accordingly (see program <code>luac</code>).
-
-
-<p>
-The <a href="#lua_load"><code>lua_load</code></a> function uses a user-supplied <code>reader</code> function
-to read the chunk (see <a href="#lua_Reader"><code>lua_Reader</code></a>).
-The <code>data</code> argument is an opaque value passed to the reader function.
-
-
-<p>
-The <code>chunkname</code> argument gives a name to the chunk,
-which is used for error messages and in debug information (see <a href="#3.8">&sect;3.8</a>).
-
-
-
-
-
-<hr><h3><a name="lua_newstate"><code>lua_newstate</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_State *lua_newstate (lua_Alloc f, void *ud);</pre>
-
-<p>
-Creates a new, independent state.
-Returns <code>NULL</code> if cannot create the state
-(due to lack of memory).
-The argument <code>f</code> is the allocator function;
-Lua does all memory allocation for this state through this function.
-The second argument, <code>ud</code>, is an opaque pointer that Lua
-simply passes to the allocator in every call.
-
-
-
-
-
-<hr><h3><a name="lua_newtable"><code>lua_newtable</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_newtable (lua_State *L);</pre>
-
-<p>
-Creates a new empty table and pushes it onto the stack.
-It is equivalent to <code>lua_createtable(L, 0, 0)</code>.
-
-
-
-
-
-<hr><h3><a name="lua_newthread"><code>lua_newthread</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>lua_State *lua_newthread (lua_State *L);</pre>
-
-<p>
-Creates a new thread, pushes it on the stack,
-and returns a pointer to a <a href="#lua_State"><code>lua_State</code></a> that represents this new thread.
-The new state returned by this function shares with the original state
-all global objects (such as tables),
-but has an independent execution stack.
-
-
-<p>
-There is no explicit function to close or to destroy a thread.
-Threads are subject to garbage collection,
-like any Lua object.
-
-
-
-
-
-<hr><h3><a name="lua_newuserdata"><code>lua_newuserdata</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void *lua_newuserdata (lua_State *L, size_t size);</pre>
-
-<p>
-This function allocates a new block of memory with the given size,
-pushes onto the stack a new full userdata with the block address,
-and returns this address.
-
-
-<p>
-Userdata represent C&nbsp;values in Lua.
-A <em>full userdata</em> represents a block of memory.
-It is an object (like a table):
-you must create it, it can have its own metatable,
-and you can detect when it is being collected.
-A full userdata is only equal to itself (under raw equality).
-
-
-<p>
-When Lua collects a full userdata with a <code>gc</code> metamethod,
-Lua calls the metamethod and marks the userdata as finalized.
-When this userdata is collected again then
-Lua frees its corresponding memory.
-
-
-
-
-
-<hr><h3><a name="lua_next"><code>lua_next</code></a></h3><p>
-<span class="apii">[-1, +(2|0), <em>e</em>]</span>
-<pre>int lua_next (lua_State *L, int index);</pre>
-
-<p>
-Pops a key from the stack,
-and pushes a key-value pair from the table at the given index
-(the "next" pair after the given key).
-If there are no more elements in the table,
-then <a href="#lua_next"><code>lua_next</code></a> returns 0 (and pushes nothing).
-
-
-<p>
-A typical traversal looks like this:
-
-<pre>
-     /* table is in the stack at index 't' */
-     lua_pushnil(L);  /* first key */
-     while (lua_next(L, t) != 0) {
-       /* uses 'key' (at index -2) and 'value' (at index -1) */
-       printf("%s - %s\n",
-              lua_typename(L, lua_type(L, -2)),
-              lua_typename(L, lua_type(L, -1)));
-       /* removes 'value'; keeps 'key' for next iteration */
-       lua_pop(L, 1);
-     }
-</pre>
-
-<p>
-While traversing a table,
-do not call <a href="#lua_tolstring"><code>lua_tolstring</code></a> directly on a key,
-unless you know that the key is actually a string.
-Recall that <a href="#lua_tolstring"><code>lua_tolstring</code></a> <em>changes</em>
-the value at the given index;
-this confuses the next call to <a href="#lua_next"><code>lua_next</code></a>.
-
-
-
-
-
-<hr><h3><a name="lua_Number"><code>lua_Number</code></a></h3>
-<pre>typedef double lua_Number;</pre>
-
-<p>
-The type of numbers in Lua.
-By default, it is double, but that can be changed in <code>luaconf.h</code>.
-
-
-<p>
-Through the configuration file you can change
-Lua to operate with another type for numbers (e.g., float or long).
-
-
-
-
-
-<hr><h3><a name="lua_objlen"><code>lua_objlen</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>size_t lua_objlen (lua_State *L, int index);</pre>
-
-<p>
-Returns the "length" of the value at the given acceptable index:
-for strings, this is the string length;
-for tables, this is the result of the length operator ('<code>#</code>');
-for userdata, this is the size of the block of memory allocated
-for the userdata;
-for other values, it is&nbsp;0.
-
-
-
-
-
-<hr><h3><a name="lua_pcall"><code>lua_pcall</code></a></h3><p>
-<span class="apii">[-(nargs + 1), +(nresults|1), <em>-</em>]</span>
-<pre>int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc);</pre>
-
-<p>
-Calls a function in protected mode.
-
-
-<p>
-Both <code>nargs</code> and <code>nresults</code> have the same meaning as
-in <a href="#lua_call"><code>lua_call</code></a>.
-If there are no errors during the call,
-<a href="#lua_pcall"><code>lua_pcall</code></a> behaves exactly like <a href="#lua_call"><code>lua_call</code></a>.
-However, if there is any error,
-<a href="#lua_pcall"><code>lua_pcall</code></a> catches it,
-pushes a single value on the stack (the error message),
-and returns an error code.
-Like <a href="#lua_call"><code>lua_call</code></a>,
-<a href="#lua_pcall"><code>lua_pcall</code></a> always removes the function
-and its arguments from the stack.
-
-
-<p>
-If <code>errfunc</code> is 0,
-then the error message returned on the stack
-is exactly the original error message.
-Otherwise, <code>errfunc</code> is the stack index of an
-<em>error handler function</em>.
-(In the current implementation, this index cannot be a pseudo-index.)
-In case of runtime errors,
-this function will be called with the error message
-and its return value will be the message returned on the stack by <a href="#lua_pcall"><code>lua_pcall</code></a>.
-
-
-<p>
-Typically, the error handler function is used to add more debug
-information to the error message, such as a stack traceback.
-Such information cannot be gathered after the return of <a href="#lua_pcall"><code>lua_pcall</code></a>,
-since by then the stack has unwound.
-
-
-<p>
-The <a href="#lua_pcall"><code>lua_pcall</code></a> function returns 0 in case of success
-or one of the following error codes
-(defined in <code>lua.h</code>):
-
-<ul>
-
-<li><b><a name="pdf-LUA_ERRRUN"><code>LUA_ERRRUN</code></a>:</b>
-a runtime error.
-</li>
-
-<li><b><a name="pdf-LUA_ERRMEM"><code>LUA_ERRMEM</code></a>:</b>
-memory allocation error.
-For such errors, Lua does not call the error handler function.
-</li>
-
-<li><b><a name="pdf-LUA_ERRERR"><code>LUA_ERRERR</code></a>:</b>
-error while running the error handler function.
-</li>
-
-</ul>
-
-
-
-
-<hr><h3><a name="lua_pop"><code>lua_pop</code></a></h3><p>
-<span class="apii">[-n, +0, <em>-</em>]</span>
-<pre>void lua_pop (lua_State *L, int n);</pre>
-
-<p>
-Pops <code>n</code> elements from the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushboolean"><code>lua_pushboolean</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushboolean (lua_State *L, int b);</pre>
-
-<p>
-Pushes a boolean value with value <code>b</code> onto the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushcclosure"><code>lua_pushcclosure</code></a></h3><p>
-<span class="apii">[-n, +1, <em>m</em>]</span>
-<pre>void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);</pre>
-
-<p>
-Pushes a new C&nbsp;closure onto the stack.
-
-
-<p>
-When a C&nbsp;function is created,
-it is possible to associate some values with it,
-thus creating a C&nbsp;closure (see <a href="#3.4">&sect;3.4</a>);
-these values are then accessible to the function whenever it is called.
-To associate values with a C&nbsp;function,
-first these values should be pushed onto the stack
-(when there are multiple values, the first value is pushed first).
-Then <a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a>
-is called to create and push the C&nbsp;function onto the stack,
-with the argument <code>n</code> telling how many values should be
-associated with the function.
-<a href="#lua_pushcclosure"><code>lua_pushcclosure</code></a> also pops these values from the stack.
-
-
-<p>
-The maximum value for <code>n</code> is 255.
-
-
-
-
-
-<hr><h3><a name="lua_pushcfunction"><code>lua_pushcfunction</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_pushcfunction (lua_State *L, lua_CFunction f);</pre>
-
-<p>
-Pushes a C&nbsp;function onto the stack.
-This function receives a pointer to a C function
-and pushes onto the stack a Lua value of type <code>function</code> that,
-when called, invokes the corresponding C&nbsp;function.
-
-
-<p>
-Any function to be registered in Lua must
-follow the correct protocol to receive its parameters
-and return its results (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>).
-
-
-<p>
-<code>lua_pushcfunction</code> is defined as a macro:
-
-<pre>
-     #define lua_pushcfunction(L,f)  lua_pushcclosure(L,f,0)
-</pre>
-
-
-
-
-<hr><h3><a name="lua_pushfstring"><code>lua_pushfstring</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>const char *lua_pushfstring (lua_State *L, const char *fmt, ...);</pre>
-
-<p>
-Pushes onto the stack a formatted string
-and returns a pointer to this string.
-It is similar to the C&nbsp;function <code>sprintf</code>,
-but has some important differences:
-
-<ul>
-
-<li>
-You do not have to allocate space for the result:
-the result is a Lua string and Lua takes care of memory allocation
-(and deallocation, through garbage collection).
-</li>
-
-<li>
-The conversion specifiers are quite restricted.
-There are no flags, widths, or precisions.
-The conversion specifiers can only be
-'<code>%%</code>' (inserts a '<code>%</code>' in the string),
-'<code>%s</code>' (inserts a zero-terminated string, with no size restrictions),
-'<code>%f</code>' (inserts a <a href="#lua_Number"><code>lua_Number</code></a>),
-'<code>%p</code>' (inserts a pointer as a hexadecimal numeral),
-'<code>%d</code>' (inserts an <code>int</code>), and
-'<code>%c</code>' (inserts an <code>int</code> as a character).
-</li>
-
-</ul>
-
-
-
-
-<hr><h3><a name="lua_pushinteger"><code>lua_pushinteger</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushinteger (lua_State *L, lua_Integer n);</pre>
-
-<p>
-Pushes a number with value <code>n</code> onto the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushlightuserdata"><code>lua_pushlightuserdata</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushlightuserdata (lua_State *L, void *p);</pre>
-
-<p>
-Pushes a light userdata onto the stack.
-
-
-<p>
-Userdata represent C&nbsp;values in Lua.
-A <em>light userdata</em> represents a pointer.
-It is a value (like a number):
-you do not create it, it has no individual metatable,
-and it is not collected (as it was never created).
-A light userdata is equal to "any"
-light userdata with the same C&nbsp;address.
-
-
-
-
-
-<hr><h3><a name="lua_pushliteral"><code>lua_pushliteral</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_pushliteral (lua_State *L, const char *s);</pre>
-
-<p>
-This macro is equivalent to <a href="#lua_pushlstring"><code>lua_pushlstring</code></a>,
-but can be used only when <code>s</code> is a literal string.
-In these cases, it automatically provides the string length.
-
-
-
-
-
-<hr><h3><a name="lua_pushlstring"><code>lua_pushlstring</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_pushlstring (lua_State *L, const char *s, size_t len);</pre>
-
-<p>
-Pushes the string pointed to by <code>s</code> with size <code>len</code>
-onto the stack.
-Lua makes (or reuses) an internal copy of the given string,
-so the memory at <code>s</code> can be freed or reused immediately after
-the function returns.
-The string can contain embedded zeros.
-
-
-
-
-
-<hr><h3><a name="lua_pushnil"><code>lua_pushnil</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushnil (lua_State *L);</pre>
-
-<p>
-Pushes a nil value onto the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushnumber"><code>lua_pushnumber</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushnumber (lua_State *L, lua_Number n);</pre>
-
-<p>
-Pushes a number with value <code>n</code> onto the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushstring"><code>lua_pushstring</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void lua_pushstring (lua_State *L, const char *s);</pre>
-
-<p>
-Pushes the zero-terminated string pointed to by <code>s</code>
-onto the stack.
-Lua makes (or reuses) an internal copy of the given string,
-so the memory at <code>s</code> can be freed or reused immediately after
-the function returns.
-The string cannot contain embedded zeros;
-it is assumed to end at the first zero.
-
-
-
-
-
-<hr><h3><a name="lua_pushthread"><code>lua_pushthread</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>int lua_pushthread (lua_State *L);</pre>
-
-<p>
-Pushes the thread represented by <code>L</code> onto the stack.
-Returns 1 if this thread is the main thread of its state.
-
-
-
-
-
-<hr><h3><a name="lua_pushvalue"><code>lua_pushvalue</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_pushvalue (lua_State *L, int index);</pre>
-
-<p>
-Pushes a copy of the element at the given valid index
-onto the stack.
-
-
-
-
-
-<hr><h3><a name="lua_pushvfstring"><code>lua_pushvfstring</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>const char *lua_pushvfstring (lua_State *L,
-                              const char *fmt,
-                              va_list argp);</pre>
-
-<p>
-Equivalent to <a href="#lua_pushfstring"><code>lua_pushfstring</code></a>, except that it receives a <code>va_list</code>
-instead of a variable number of arguments.
-
-
-
-
-
-<hr><h3><a name="lua_rawequal"><code>lua_rawequal</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_rawequal (lua_State *L, int index1, int index2);</pre>
-
-<p>
-Returns 1 if the two values in acceptable indices <code>index1</code> and
-<code>index2</code> are primitively equal
-(that is, without calling metamethods).
-Otherwise returns&nbsp;0.
-Also returns&nbsp;0 if any of the indices are non valid.
-
-
-
-
-
-<hr><h3><a name="lua_rawget"><code>lua_rawget</code></a></h3><p>
-<span class="apii">[-1, +1, <em>-</em>]</span>
-<pre>void lua_rawget (lua_State *L, int index);</pre>
-
-<p>
-Similar to <a href="#lua_gettable"><code>lua_gettable</code></a>, but does a raw access
-(i.e., without metamethods).
-
-
-
-
-
-<hr><h3><a name="lua_rawgeti"><code>lua_rawgeti</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void lua_rawgeti (lua_State *L, int index, int n);</pre>
-
-<p>
-Pushes onto the stack the value <code>t[n]</code>,
-where <code>t</code> is the value at the given valid index.
-The access is raw;
-that is, it does not invoke metamethods.
-
-
-
-
-
-<hr><h3><a name="lua_rawset"><code>lua_rawset</code></a></h3><p>
-<span class="apii">[-2, +0, <em>m</em>]</span>
-<pre>void lua_rawset (lua_State *L, int index);</pre>
-
-<p>
-Similar to <a href="#lua_settable"><code>lua_settable</code></a>, but does a raw assignment
-(i.e., without metamethods).
-
-
-
-
-
-<hr><h3><a name="lua_rawseti"><code>lua_rawseti</code></a></h3><p>
-<span class="apii">[-1, +0, <em>m</em>]</span>
-<pre>void lua_rawseti (lua_State *L, int index, int n);</pre>
-
-<p>
-Does the equivalent of <code>t[n] = v</code>,
-where <code>t</code> is the value at the given valid index
-and <code>v</code> is the value at the top of the stack.
-
-
-<p>
-This function pops the value from the stack.
-The assignment is raw;
-that is, it does not invoke metamethods.
-
-
-
-
-
-<hr><h3><a name="lua_Reader"><code>lua_Reader</code></a></h3>
-<pre>typedef const char * (*lua_Reader) (lua_State *L,
-                                    void *data,
-                                    size_t *size);</pre>
-
-<p>
-The reader function used by <a href="#lua_load"><code>lua_load</code></a>.
-Every time it needs another piece of the chunk,
-<a href="#lua_load"><code>lua_load</code></a> calls the reader,
-passing along its <code>data</code> parameter.
-The reader must return a pointer to a block of memory
-with a new piece of the chunk
-and set <code>size</code> to the block size.
-The block must exist until the reader function is called again.
-To signal the end of the chunk,
-the reader must return <code>NULL</code> or set <code>size</code> to zero.
-The reader function may return pieces of any size greater than zero.
-
-
-
-
-
-<hr><h3><a name="lua_register"><code>lua_register</code></a></h3><p>
-<span class="apii">[-0, +0, <em>e</em>]</span>
-<pre>void lua_register (lua_State *L,
-                   const char *name,
-                   lua_CFunction f);</pre>
-
-<p>
-Sets the C function <code>f</code> as the new value of global <code>name</code>.
-It is defined as a macro:
-
-<pre>
-     #define lua_register(L,n,f) \
-            (lua_pushcfunction(L, f), lua_setglobal(L, n))
-</pre>
-
-
-
-
-<hr><h3><a name="lua_remove"><code>lua_remove</code></a></h3><p>
-<span class="apii">[-1, +0, <em>-</em>]</span>
-<pre>void lua_remove (lua_State *L, int index);</pre>
-
-<p>
-Removes the element at the given valid index,
-shifting down the elements above this index to fill the gap.
-Cannot be called with a pseudo-index,
-because a pseudo-index is not an actual stack position.
-
-
-
-
-
-<hr><h3><a name="lua_replace"><code>lua_replace</code></a></h3><p>
-<span class="apii">[-1, +0, <em>-</em>]</span>
-<pre>void lua_replace (lua_State *L, int index);</pre>
-
-<p>
-Moves the top element into the given position (and pops it),
-without shifting any element
-(therefore replacing the value at the given position).
-
-
-
-
-
-<hr><h3><a name="lua_resume"><code>lua_resume</code></a></h3><p>
-<span class="apii">[-?, +?, <em>-</em>]</span>
-<pre>int lua_resume (lua_State *L, int narg);</pre>
-
-<p>
-Starts and resumes a coroutine in a given thread.
-
-
-<p>
-To start a coroutine, you first create a new thread
-(see <a href="#lua_newthread"><code>lua_newthread</code></a>);
-then you push onto its stack the main function plus any arguments;
-then you call <a href="#lua_resume"><code>lua_resume</code></a>,
-with <code>narg</code> being the number of arguments.
-This call returns when the coroutine suspends or finishes its execution.
-When it returns, the stack contains all values passed to <a href="#lua_yield"><code>lua_yield</code></a>,
-or all values returned by the body function.
-<a href="#lua_resume"><code>lua_resume</code></a> returns
-<a href="#pdf-LUA_YIELD"><code>LUA_YIELD</code></a> if the coroutine yields,
-0 if the coroutine finishes its execution
-without errors,
-or an error code in case of errors (see <a href="#lua_pcall"><code>lua_pcall</code></a>).
-In case of errors,
-the stack is not unwound,
-so you can use the debug API over it.
-The error message is on the top of the stack.
-To restart a coroutine, you put on its stack only the values to
-be passed as results from <code>yield</code>,
-and then call <a href="#lua_resume"><code>lua_resume</code></a>.
-
-
-
-
-
-<hr><h3><a name="lua_setallocf"><code>lua_setallocf</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);</pre>
-
-<p>
-Changes the allocator function of a given state to <code>f</code>
-with user data <code>ud</code>.
-
-
-
-
-
-<hr><h3><a name="lua_setfenv"><code>lua_setfenv</code></a></h3><p>
-<span class="apii">[-1, +0, <em>-</em>]</span>
-<pre>int lua_setfenv (lua_State *L, int index);</pre>
-
-<p>
-Pops a table from the stack and sets it as
-the new environment for the value at the given index.
-If the value at the given index is
-neither a function nor a thread nor a userdata,
-<a href="#lua_setfenv"><code>lua_setfenv</code></a> returns 0.
-Otherwise it returns 1.
-
-
-
-
-
-<hr><h3><a name="lua_setfield"><code>lua_setfield</code></a></h3><p>
-<span class="apii">[-1, +0, <em>e</em>]</span>
-<pre>void lua_setfield (lua_State *L, int index, const char *k);</pre>
-
-<p>
-Does the equivalent to <code>t[k] = v</code>,
-where <code>t</code> is the value at the given valid index
-and <code>v</code> is the value at the top of the stack.
-
-
-<p>
-This function pops the value from the stack.
-As in Lua, this function may trigger a metamethod
-for the "newindex" event (see <a href="#2.8">&sect;2.8</a>).
-
-
-
-
-
-<hr><h3><a name="lua_setglobal"><code>lua_setglobal</code></a></h3><p>
-<span class="apii">[-1, +0, <em>e</em>]</span>
-<pre>void lua_setglobal (lua_State *L, const char *name);</pre>
-
-<p>
-Pops a value from the stack and
-sets it as the new value of global <code>name</code>.
-It is defined as a macro:
-
-<pre>
-     #define lua_setglobal(L,s)   lua_setfield(L, LUA_GLOBALSINDEX, s)
-</pre>
-
-
-
-
-<hr><h3><a name="lua_setmetatable"><code>lua_setmetatable</code></a></h3><p>
-<span class="apii">[-1, +0, <em>-</em>]</span>
-<pre>int lua_setmetatable (lua_State *L, int index);</pre>
-
-<p>
-Pops a table from the stack and
-sets it as the new metatable for the value at the given
-acceptable index.
-
-
-
-
-
-<hr><h3><a name="lua_settable"><code>lua_settable</code></a></h3><p>
-<span class="apii">[-2, +0, <em>e</em>]</span>
-<pre>void lua_settable (lua_State *L, int index);</pre>
-
-<p>
-Does the equivalent to <code>t[k] = v</code>,
-where <code>t</code> is the value at the given valid index,
-<code>v</code> is the value at the top of the stack,
-and <code>k</code> is the value just below the top.
-
-
-<p>
-This function pops both the key and the value from the stack.
-As in Lua, this function may trigger a metamethod
-for the "newindex" event (see <a href="#2.8">&sect;2.8</a>).
-
-
-
-
-
-<hr><h3><a name="lua_settop"><code>lua_settop</code></a></h3><p>
-<span class="apii">[-?, +?, <em>-</em>]</span>
-<pre>void lua_settop (lua_State *L, int index);</pre>
-
-<p>
-Accepts any acceptable index, or&nbsp;0,
-and sets the stack top to this index.
-If the new top is larger than the old one,
-then the new elements are filled with <b>nil</b>.
-If <code>index</code> is&nbsp;0, then all stack elements are removed.
-
-
-
-
-
-<hr><h3><a name="lua_State"><code>lua_State</code></a></h3>
-<pre>typedef struct lua_State lua_State;</pre>
-
-<p>
-Opaque structure that keeps the whole state of a Lua interpreter.
-The Lua library is fully reentrant:
-it has no global variables.
-All information about a state is kept in this structure.
-
-
-<p>
-A pointer to this state must be passed as the first argument to
-every function in the library, except to <a href="#lua_newstate"><code>lua_newstate</code></a>,
-which creates a Lua state from scratch.
-
-
-
-
-
-<hr><h3><a name="lua_status"><code>lua_status</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_status (lua_State *L);</pre>
-
-<p>
-Returns the status of the thread <code>L</code>.
-
-
-<p>
-The status can be 0 for a normal thread,
-an error code if the thread finished its execution with an error,
-or <a name="pdf-LUA_YIELD"><code>LUA_YIELD</code></a> if the thread is suspended.
-
-
-
-
-
-<hr><h3><a name="lua_toboolean"><code>lua_toboolean</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_toboolean (lua_State *L, int index);</pre>
-
-<p>
-Converts the Lua value at the given acceptable index to a C&nbsp;boolean
-value (0&nbsp;or&nbsp;1).
-Like all tests in Lua,
-<a href="#lua_toboolean"><code>lua_toboolean</code></a> returns 1 for any Lua value
-different from <b>false</b> and <b>nil</b>;
-otherwise it returns 0.
-It also returns 0 when called with a non-valid index.
-(If you want to accept only actual boolean values,
-use <a href="#lua_isboolean"><code>lua_isboolean</code></a> to test the value's type.)
-
-
-
-
-
-<hr><h3><a name="lua_tocfunction"><code>lua_tocfunction</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_CFunction lua_tocfunction (lua_State *L, int index);</pre>
-
-<p>
-Converts a value at the given acceptable index to a C&nbsp;function.
-That value must be a C&nbsp;function;
-otherwise, returns <code>NULL</code>.
-
-
-
-
-
-<hr><h3><a name="lua_tointeger"><code>lua_tointeger</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_Integer lua_tointeger (lua_State *L, int index);</pre>
-
-<p>
-Converts the Lua value at the given acceptable index
-to the signed integral type <a href="#lua_Integer"><code>lua_Integer</code></a>.
-The Lua value must be a number or a string convertible to a number
-(see <a href="#2.2.1">&sect;2.2.1</a>);
-otherwise, <a href="#lua_tointeger"><code>lua_tointeger</code></a> returns&nbsp;0.
-
-
-<p>
-If the number is not an integer,
-it is truncated in some non-specified way.
-
-
-
-
-
-<hr><h3><a name="lua_tolstring"><code>lua_tolstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>const char *lua_tolstring (lua_State *L, int index, size_t *len);</pre>
-
-<p>
-Converts the Lua value at the given acceptable index to a C&nbsp;string.
-If <code>len</code> is not <code>NULL</code>,
-it also sets <code>*len</code> with the string length.
-The Lua value must be a string or a number;
-otherwise, the function returns <code>NULL</code>.
-If the value is a number,
-then <a href="#lua_tolstring"><code>lua_tolstring</code></a> also
-<em>changes the actual value in the stack to a string</em>.
-(This change confuses <a href="#lua_next"><code>lua_next</code></a>
-when <a href="#lua_tolstring"><code>lua_tolstring</code></a> is applied to keys during a table traversal.)
-
-
-<p>
-<a href="#lua_tolstring"><code>lua_tolstring</code></a> returns a fully aligned pointer
-to a string inside the Lua state.
-This string always has a zero ('<code>\0</code>')
-after its last character (as in&nbsp;C),
-but can contain other zeros in its body.
-Because Lua has garbage collection,
-there is no guarantee that the pointer returned by <a href="#lua_tolstring"><code>lua_tolstring</code></a>
-will be valid after the corresponding value is removed from the stack.
-
-
-
-
-
-<hr><h3><a name="lua_tonumber"><code>lua_tonumber</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_Number lua_tonumber (lua_State *L, int index);</pre>
-
-<p>
-Converts the Lua value at the given acceptable index
-to the C&nbsp;type <a href="#lua_Number"><code>lua_Number</code></a> (see <a href="#lua_Number"><code>lua_Number</code></a>).
-The Lua value must be a number or a string convertible to a number
-(see <a href="#2.2.1">&sect;2.2.1</a>);
-otherwise, <a href="#lua_tonumber"><code>lua_tonumber</code></a> returns&nbsp;0.
-
-
-
-
-
-<hr><h3><a name="lua_topointer"><code>lua_topointer</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>const void *lua_topointer (lua_State *L, int index);</pre>
-
-<p>
-Converts the value at the given acceptable index to a generic
-C&nbsp;pointer (<code>void*</code>).
-The value can be a userdata, a table, a thread, or a function;
-otherwise, <a href="#lua_topointer"><code>lua_topointer</code></a> returns <code>NULL</code>.
-Different objects will give different pointers.
-There is no way to convert the pointer back to its original value.
-
-
-<p>
-Typically this function is used only for debug information.
-
-
-
-
-
-<hr><h3><a name="lua_tostring"><code>lua_tostring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>const char *lua_tostring (lua_State *L, int index);</pre>
-
-<p>
-Equivalent to <a href="#lua_tolstring"><code>lua_tolstring</code></a> with <code>len</code> equal to <code>NULL</code>.
-
-
-
-
-
-<hr><h3><a name="lua_tothread"><code>lua_tothread</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_State *lua_tothread (lua_State *L, int index);</pre>
-
-<p>
-Converts the value at the given acceptable index to a Lua thread
-(represented as <code>lua_State*</code>).
-This value must be a thread;
-otherwise, the function returns <code>NULL</code>.
-
-
-
-
-
-<hr><h3><a name="lua_touserdata"><code>lua_touserdata</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>void *lua_touserdata (lua_State *L, int index);</pre>
-
-<p>
-If the value at the given acceptable index is a full userdata,
-returns its block address.
-If the value is a light userdata,
-returns its pointer.
-Otherwise, returns <code>NULL</code>.
-
-
-
-
-
-<hr><h3><a name="lua_type"><code>lua_type</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_type (lua_State *L, int index);</pre>
-
-<p>
-Returns the type of the value in the given acceptable index,
-or <code>LUA_TNONE</code> for a non-valid index
-(that is, an index to an "empty" stack position).
-The types returned by <a href="#lua_type"><code>lua_type</code></a> are coded by the following constants
-defined in <code>lua.h</code>:
-<code>LUA_TNIL</code>,
-<code>LUA_TNUMBER</code>,
-<code>LUA_TBOOLEAN</code>,
-<code>LUA_TSTRING</code>,
-<code>LUA_TTABLE</code>,
-<code>LUA_TFUNCTION</code>,
-<code>LUA_TUSERDATA</code>,
-<code>LUA_TTHREAD</code>,
-and
-<code>LUA_TLIGHTUSERDATA</code>.
-
-
-
-
-
-<hr><h3><a name="lua_typename"><code>lua_typename</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>const char *lua_typename  (lua_State *L, int tp);</pre>
-
-<p>
-Returns the name of the type encoded by the value <code>tp</code>,
-which must be one the values returned by <a href="#lua_type"><code>lua_type</code></a>.
-
-
-
-
-
-<hr><h3><a name="lua_Writer"><code>lua_Writer</code></a></h3>
-<pre>typedef int (*lua_Writer) (lua_State *L,
-                           const void* p,
-                           size_t sz,
-                           void* ud);</pre>
-
-<p>
-The type of the writer function used by <a href="#lua_dump"><code>lua_dump</code></a>.
-Every time it produces another piece of chunk,
-<a href="#lua_dump"><code>lua_dump</code></a> calls the writer,
-passing along the buffer to be written (<code>p</code>),
-its size (<code>sz</code>),
-and the <code>data</code> parameter supplied to <a href="#lua_dump"><code>lua_dump</code></a>.
-
-
-<p>
-The writer returns an error code:
-0&nbsp;means no errors;
-any other value means an error and stops <a href="#lua_dump"><code>lua_dump</code></a> from
-calling the writer again.
-
-
-
-
-
-<hr><h3><a name="lua_xmove"><code>lua_xmove</code></a></h3><p>
-<span class="apii">[-?, +?, <em>-</em>]</span>
-<pre>void lua_xmove (lua_State *from, lua_State *to, int n);</pre>
-
-<p>
-Exchange values between different threads of the <em>same</em> global state.
-
-
-<p>
-This function pops <code>n</code> values from the stack <code>from</code>,
-and pushes them onto the stack <code>to</code>.
-
-
-
-
-
-<hr><h3><a name="lua_yield"><code>lua_yield</code></a></h3><p>
-<span class="apii">[-?, +?, <em>-</em>]</span>
-<pre>int lua_yield  (lua_State *L, int nresults);</pre>
-
-<p>
-Yields a coroutine.
-
-
-<p>
-This function should only be called as the
-return expression of a C&nbsp;function, as follows:
-
-<pre>
-     return lua_yield (L, nresults);
-</pre><p>
-When a C&nbsp;function calls <a href="#lua_yield"><code>lua_yield</code></a> in that way,
-the running coroutine suspends its execution,
-and the call to <a href="#lua_resume"><code>lua_resume</code></a> that started this coroutine returns.
-The parameter <code>nresults</code> is the number of values from the stack
-that are passed as results to <a href="#lua_resume"><code>lua_resume</code></a>.
-
-
-
-
-
-
-
-<h2>3.8 - <a name="3.8">The Debug Interface</a></h2>
-
-<p>
-Lua has no built-in debugging facilities.
-Instead, it offers a special interface
-by means of functions and <em>hooks</em>.
-This interface allows the construction of different
-kinds of debuggers, profilers, and other tools
-that need "inside information" from the interpreter.
-
-
-
-<hr><h3><a name="lua_Debug"><code>lua_Debug</code></a></h3>
-<pre>typedef struct lua_Debug {
-  int event;
-  const char *name;           /* (n) */
-  const char *namewhat;       /* (n) */
-  const char *what;           /* (S) */
-  const char *source;         /* (S) */
-  int currentline;            /* (l) */
-  int nups;                   /* (u) number of upvalues */
-  int linedefined;            /* (S) */
-  int lastlinedefined;        /* (S) */
-  char short_src[LUA_IDSIZE]; /* (S) */
-  /* private part */
-  <em>other fields</em>
-} lua_Debug;</pre>
-
-<p>
-A structure used to carry different pieces of
-information about an active function.
-<a href="#lua_getstack"><code>lua_getstack</code></a> fills only the private part
-of this structure, for later use.
-To fill the other fields of <a href="#lua_Debug"><code>lua_Debug</code></a> with useful information,
-call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
-
-
-<p>
-The fields of <a href="#lua_Debug"><code>lua_Debug</code></a> have the following meaning:
-
-<ul>
-
-<li><b><code>source</code>:</b>
-If the function was defined in a string,
-then <code>source</code> is that string.
-If the function was defined in a file,
-then <code>source</code> starts with a '<code>@</code>' followed by the file name.
-</li>
-
-<li><b><code>short_src</code>:</b>
-a "printable" version of <code>source</code>, to be used in error messages.
-</li>
-
-<li><b><code>linedefined</code>:</b>
-the line number where the definition of the function starts.
-</li>
-
-<li><b><code>lastlinedefined</code>:</b>
-the line number where the definition of the function ends.
-</li>
-
-<li><b><code>what</code>:</b>
-the string <code>"Lua"</code> if the function is a Lua function,
-<code>"C"</code> if it is a C&nbsp;function,
-<code>"main"</code> if it is the main part of a chunk,
-and <code>"tail"</code> if it was a function that did a tail call.
-In the latter case,
-Lua has no other information about the function.
-</li>
-
-<li><b><code>currentline</code>:</b>
-the current line where the given function is executing.
-When no line information is available,
-<code>currentline</code> is set to -1.
-</li>
-
-<li><b><code>name</code>:</b>
-a reasonable name for the given function.
-Because functions in Lua are first-class values,
-they do not have a fixed name:
-some functions can be the value of multiple global variables,
-while others can be stored only in a table field.
-The <code>lua_getinfo</code> function checks how the function was
-called to find a suitable name.
-If it cannot find a name,
-then <code>name</code> is set to <code>NULL</code>.
-</li>
-
-<li><b><code>namewhat</code>:</b>
-explains the <code>name</code> field.
-The value of <code>namewhat</code> can be
-<code>"global"</code>, <code>"local"</code>, <code>"method"</code>,
-<code>"field"</code>, <code>"upvalue"</code>, or <code>""</code> (the empty string),
-according to how the function was called.
-(Lua uses the empty string when no other option seems to apply.)
-</li>
-
-<li><b><code>nups</code>:</b>
-the number of upvalues of the function.
-</li>
-
-</ul>
-
-
-
-
-<hr><h3><a name="lua_gethook"><code>lua_gethook</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_Hook lua_gethook (lua_State *L);</pre>
-
-<p>
-Returns the current hook function.
-
-
-
-
-
-<hr><h3><a name="lua_gethookcount"><code>lua_gethookcount</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_gethookcount (lua_State *L);</pre>
-
-<p>
-Returns the current hook count.
-
-
-
-
-
-<hr><h3><a name="lua_gethookmask"><code>lua_gethookmask</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_gethookmask (lua_State *L);</pre>
-
-<p>
-Returns the current hook mask.
-
-
-
-
-
-<hr><h3><a name="lua_getinfo"><code>lua_getinfo</code></a></h3><p>
-<span class="apii">[-(0|1), +(0|1|2), <em>m</em>]</span>
-<pre>int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);</pre>
-
-<p>
-Returns information about a specific function or function invocation.
-
-
-<p>
-To get information about a function invocation,
-the parameter <code>ar</code> must be a valid activation record that was
-filled by a previous call to <a href="#lua_getstack"><code>lua_getstack</code></a> or
-given as argument to a hook (see <a href="#lua_Hook"><code>lua_Hook</code></a>).
-
-
-<p>
-To get information about a function you push it onto the stack
-and start the <code>what</code> string with the character '<code>&gt;</code>'.
-(In that case,
-<code>lua_getinfo</code> pops the function in the top of the stack.)
-For instance, to know in which line a function <code>f</code> was defined,
-you can write the following code:
-
-<pre>
-     lua_Debug ar;
-     lua_getfield(L, LUA_GLOBALSINDEX, "f");  /* get global 'f' */
-     lua_getinfo(L, "&gt;S", &amp;ar);
-     printf("%d\n", ar.linedefined);
-</pre>
-
-<p>
-Each character in the string <code>what</code>
-selects some fields of the structure <code>ar</code> to be filled or
-a value to be pushed on the stack:
-
-<ul>
-
-<li><b>'<code>n</code>':</b> fills in the field <code>name</code> and <code>namewhat</code>;
-</li>
-
-<li><b>'<code>S</code>':</b>
-fills in the fields <code>source</code>, <code>short_src</code>,
-<code>linedefined</code>, <code>lastlinedefined</code>, and <code>what</code>;
-</li>
-
-<li><b>'<code>l</code>':</b> fills in the field <code>currentline</code>;
-</li>
-
-<li><b>'<code>u</code>':</b> fills in the field <code>nups</code>;
-</li>
-
-<li><b>'<code>f</code>':</b>
-pushes onto the stack the function that is
-running at the given level;
-</li>
-
-<li><b>'<code>L</code>':</b>
-pushes onto the stack a table whose indices are the
-numbers of the lines that are valid on the function.
-(A <em>valid line</em> is a line with some associated code,
-that is, a line where you can put a break point.
-Non-valid lines include empty lines and comments.)
-</li>
-
-</ul>
-
-<p>
-This function returns 0 on error
-(for instance, an invalid option in <code>what</code>).
-
-
-
-
-
-<hr><h3><a name="lua_getlocal"><code>lua_getlocal</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>-</em>]</span>
-<pre>const char *lua_getlocal (lua_State *L, lua_Debug *ar, int n);</pre>
-
-<p>
-Gets information about a local variable of a given activation record.
-The parameter <code>ar</code> must be a valid activation record that was
-filled by a previous call to <a href="#lua_getstack"><code>lua_getstack</code></a> or
-given as argument to a hook (see <a href="#lua_Hook"><code>lua_Hook</code></a>).
-The index <code>n</code> selects which local variable to inspect
-(1 is the first parameter or active local variable, and so on,
-until the last active local variable).
-<a href="#lua_getlocal"><code>lua_getlocal</code></a> pushes the variable's value onto the stack
-and returns its name.
-
-
-<p>
-Variable names starting with '<code>(</code>' (open parentheses)
-represent internal variables
-(loop control variables, temporaries, and C&nbsp;function locals).
-
-
-<p>
-Returns <code>NULL</code> (and pushes nothing)
-when the index is greater than
-the number of active local variables.
-
-
-
-
-
-<hr><h3><a name="lua_getstack"><code>lua_getstack</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_getstack (lua_State *L, int level, lua_Debug *ar);</pre>
-
-<p>
-Get information about the interpreter runtime stack.
-
-
-<p>
-This function fills parts of a <a href="#lua_Debug"><code>lua_Debug</code></a> structure with
-an identification of the <em>activation record</em>
-of the function executing at a given level.
-Level&nbsp;0 is the current running function,
-whereas level <em>n+1</em> is the function that has called level <em>n</em>.
-When there are no errors, <a href="#lua_getstack"><code>lua_getstack</code></a> returns 1;
-when called with a level greater than the stack depth,
-it returns 0.
-
-
-
-
-
-<hr><h3><a name="lua_getupvalue"><code>lua_getupvalue</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>-</em>]</span>
-<pre>const char *lua_getupvalue (lua_State *L, int funcindex, int n);</pre>
-
-<p>
-Gets information about a closure's upvalue.
-(For Lua functions,
-upvalues are the external local variables that the function uses,
-and that are consequently included in its closure.)
-<a href="#lua_getupvalue"><code>lua_getupvalue</code></a> gets the index <code>n</code> of an upvalue,
-pushes the upvalue's value onto the stack,
-and returns its name.
-<code>funcindex</code> points to the closure in the stack.
-(Upvalues have no particular order,
-as they are active through the whole function.
-So, they are numbered in an arbitrary order.)
-
-
-<p>
-Returns <code>NULL</code> (and pushes nothing)
-when the index is greater than the number of upvalues.
-For C&nbsp;functions, this function uses the empty string <code>""</code>
-as a name for all upvalues.
-
-
-
-
-
-<hr><h3><a name="lua_Hook"><code>lua_Hook</code></a></h3>
-<pre>typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);</pre>
-
-<p>
-Type for debugging hook functions.
-
-
-<p>
-Whenever a hook is called, its <code>ar</code> argument has its field
-<code>event</code> set to the specific event that triggered the hook.
-Lua identifies these events with the following constants:
-<a name="pdf-LUA_HOOKCALL"><code>LUA_HOOKCALL</code></a>, <a name="pdf-LUA_HOOKRET"><code>LUA_HOOKRET</code></a>,
-<a name="pdf-LUA_HOOKTAILRET"><code>LUA_HOOKTAILRET</code></a>, <a name="pdf-LUA_HOOKLINE"><code>LUA_HOOKLINE</code></a>,
-and <a name="pdf-LUA_HOOKCOUNT"><code>LUA_HOOKCOUNT</code></a>.
-Moreover, for line events, the field <code>currentline</code> is also set.
-To get the value of any other field in <code>ar</code>,
-the hook must call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
-For return events, <code>event</code> can be <code>LUA_HOOKRET</code>,
-the normal value, or <code>LUA_HOOKTAILRET</code>.
-In the latter case, Lua is simulating a return from
-a function that did a tail call;
-in this case, it is useless to call <a href="#lua_getinfo"><code>lua_getinfo</code></a>.
-
-
-<p>
-While Lua is running a hook, it disables other calls to hooks.
-Therefore, if a hook calls back Lua to execute a function or a chunk,
-this execution occurs without any calls to hooks.
-
-
-
-
-
-<hr><h3><a name="lua_sethook"><code>lua_sethook</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>int lua_sethook (lua_State *L, lua_Hook f, int mask, int count);</pre>
-
-<p>
-Sets the debugging hook function.
-
-
-<p>
-Argument <code>f</code> is the hook function.
-<code>mask</code> specifies on which events the hook will be called:
-it is formed by a bitwise or of the constants
-<a name="pdf-LUA_MASKCALL"><code>LUA_MASKCALL</code></a>,
-<a name="pdf-LUA_MASKRET"><code>LUA_MASKRET</code></a>,
-<a name="pdf-LUA_MASKLINE"><code>LUA_MASKLINE</code></a>,
-and <a name="pdf-LUA_MASKCOUNT"><code>LUA_MASKCOUNT</code></a>.
-The <code>count</code> argument is only meaningful when the mask
-includes <code>LUA_MASKCOUNT</code>.
-For each event, the hook is called as explained below:
-
-<ul>
-
-<li><b>The call hook:</b> is called when the interpreter calls a function.
-The hook is called just after Lua enters the new function,
-before the function gets its arguments.
-</li>
-
-<li><b>The return hook:</b> is called when the interpreter returns from a function.
-The hook is called just before Lua leaves the function.
-You have no access to the values to be returned by the function.
-</li>
-
-<li><b>The line hook:</b> is called when the interpreter is about to
-start the execution of a new line of code,
-or when it jumps back in the code (even to the same line).
-(This event only happens while Lua is executing a Lua function.)
-</li>
-
-<li><b>The count hook:</b> is called after the interpreter executes every
-<code>count</code> instructions.
-(This event only happens while Lua is executing a Lua function.)
-</li>
-
-</ul>
-
-<p>
-A hook is disabled by setting <code>mask</code> to zero.
-
-
-
-
-
-<hr><h3><a name="lua_setlocal"><code>lua_setlocal</code></a></h3><p>
-<span class="apii">[-(0|1), +0, <em>-</em>]</span>
-<pre>const char *lua_setlocal (lua_State *L, lua_Debug *ar, int n);</pre>
-
-<p>
-Sets the value of a local variable of a given activation record.
-Parameters <code>ar</code> and <code>n</code> are as in <a href="#lua_getlocal"><code>lua_getlocal</code></a>
-(see <a href="#lua_getlocal"><code>lua_getlocal</code></a>).
-<a href="#lua_setlocal"><code>lua_setlocal</code></a> assigns the value at the top of the stack
-to the variable and returns its name.
-It also pops the value from the stack.
-
-
-<p>
-Returns <code>NULL</code> (and pops nothing)
-when the index is greater than
-the number of active local variables.
-
-
-
-
-
-<hr><h3><a name="lua_setupvalue"><code>lua_setupvalue</code></a></h3><p>
-<span class="apii">[-(0|1), +0, <em>-</em>]</span>
-<pre>const char *lua_setupvalue (lua_State *L, int funcindex, int n);</pre>
-
-<p>
-Sets the value of a closure's upvalue.
-It assigns the value at the top of the stack
-to the upvalue and returns its name.
-It also pops the value from the stack.
-Parameters <code>funcindex</code> and <code>n</code> are as in the <a href="#lua_getupvalue"><code>lua_getupvalue</code></a>
-(see <a href="#lua_getupvalue"><code>lua_getupvalue</code></a>).
-
-
-<p>
-Returns <code>NULL</code> (and pops nothing)
-when the index is greater than the number of upvalues.
-
-
-
-
-
-
-
-<h1>4 - <a name="4">The Auxiliary Library</a></h1>
-
-<p>
-
-The <em>auxiliary library</em> provides several convenient functions
-to interface C with Lua.
-While the basic API provides the primitive functions for all 
-interactions between C and Lua,
-the auxiliary library provides higher-level functions for some
-common tasks.
-
-
-<p>
-All functions from the auxiliary library
-are defined in header file <code>lauxlib.h</code> and
-have a prefix <code>luaL_</code>.
-
-
-<p>
-All functions in the auxiliary library are built on
-top of the basic API,
-and so they provide nothing that cannot be done with this API.
-
-
-<p>
-Several functions in the auxiliary library are used to
-check C&nbsp;function arguments.
-Their names are always <code>luaL_check*</code> or <code>luaL_opt*</code>.
-All of these functions throw an error if the check is not satisfied.
-Because the error message is formatted for arguments
-(e.g., "<code>bad argument #1</code>"),
-you should not use these functions for other stack values.
-
-
-
-<h2>4.1 - <a name="4.1">Functions and Types</a></h2>
-
-<p>
-Here we list all functions and types from the auxiliary library
-in alphabetical order.
-
-
-
-<hr><h3><a name="luaL_addchar"><code>luaL_addchar</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>void luaL_addchar (luaL_Buffer *B, char c);</pre>
-
-<p>
-Adds the character <code>c</code> to the buffer <code>B</code>
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-
-
-
-
-
-<hr><h3><a name="luaL_addlstring"><code>luaL_addlstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l);</pre>
-
-<p>
-Adds the string pointed to by <code>s</code> with length <code>l</code> to
-the buffer <code>B</code>
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-The string may contain embedded zeros.
-
-
-
-
-
-<hr><h3><a name="luaL_addsize"><code>luaL_addsize</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>void luaL_addsize (luaL_Buffer *B, size_t n);</pre>
-
-<p>
-Adds to the buffer <code>B</code> (see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>)
-a string of length <code>n</code> previously copied to the
-buffer area (see <a href="#luaL_prepbuffer"><code>luaL_prepbuffer</code></a>).
-
-
-
-
-
-<hr><h3><a name="luaL_addstring"><code>luaL_addstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>void luaL_addstring (luaL_Buffer *B, const char *s);</pre>
-
-<p>
-Adds the zero-terminated string pointed to by <code>s</code>
-to the buffer <code>B</code>
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-The string may not contain embedded zeros.
-
-
-
-
-
-<hr><h3><a name="luaL_addvalue"><code>luaL_addvalue</code></a></h3><p>
-<span class="apii">[-1, +0, <em>m</em>]</span>
-<pre>void luaL_addvalue (luaL_Buffer *B);</pre>
-
-<p>
-Adds the value at the top of the stack
-to the buffer <code>B</code>
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-Pops the value.
-
-
-<p>
-This is the only function on string buffers that can (and must)
-be called with an extra element on the stack,
-which is the value to be added to the buffer.
-
-
-
-
-
-<hr><h3><a name="luaL_argcheck"><code>luaL_argcheck</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>void luaL_argcheck (lua_State *L,
-                    int cond,
-                    int narg,
-                    const char *extramsg);</pre>
-
-<p>
-Checks whether <code>cond</code> is true.
-If not, raises an error with the following message,
-where <code>func</code> is retrieved from the call stack:
-
-<pre>
-     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)
-</pre>
-
-
-
-
-<hr><h3><a name="luaL_argerror"><code>luaL_argerror</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_argerror (lua_State *L, int narg, const char *extramsg);</pre>
-
-<p>
-Raises an error with the following message,
-where <code>func</code> is retrieved from the call stack:
-
-<pre>
-     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)
-</pre>
-
-<p>
-This function never returns,
-but it is an idiom to use it in C&nbsp;functions
-as <code>return luaL_argerror(<em>args</em>)</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_Buffer"><code>luaL_Buffer</code></a></h3>
-<pre>typedef struct luaL_Buffer luaL_Buffer;</pre>
-
-<p>
-Type for a <em>string buffer</em>.
-
-
-<p>
-A string buffer allows C&nbsp;code to build Lua strings piecemeal.
-Its pattern of use is as follows:
-
-<ul>
-
-<li>First you declare a variable <code>b</code> of type <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>.</li>
-
-<li>Then you initialize it with a call <code>luaL_buffinit(L, &amp;b)</code>.</li>
-
-<li>
-Then you add string pieces to the buffer calling any of
-the <code>luaL_add*</code> functions.
-</li>
-
-<li>
-You finish by calling <code>luaL_pushresult(&amp;b)</code>.
-This call leaves the final string on the top of the stack.
-</li>
-
-</ul>
-
-<p>
-During its normal operation,
-a string buffer uses a variable number of stack slots.
-So, while using a buffer, you cannot assume that you know where
-the top of the stack is.
-You can use the stack between successive calls to buffer operations
-as long as that use is balanced;
-that is,
-when you call a buffer operation,
-the stack is at the same level
-it was immediately after the previous buffer operation.
-(The only exception to this rule is <a href="#luaL_addvalue"><code>luaL_addvalue</code></a>.)
-After calling <a href="#luaL_pushresult"><code>luaL_pushresult</code></a> the stack is back to its
-level when the buffer was initialized,
-plus the final string on its top.
-
-
-
-
-
-<hr><h3><a name="luaL_buffinit"><code>luaL_buffinit</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>void luaL_buffinit (lua_State *L, luaL_Buffer *B);</pre>
-
-<p>
-Initializes a buffer <code>B</code>.
-This function does not allocate any space;
-the buffer must be declared as a variable
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-
-
-
-
-
-<hr><h3><a name="luaL_callmeta"><code>luaL_callmeta</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>e</em>]</span>
-<pre>int luaL_callmeta (lua_State *L, int obj, const char *e);</pre>
-
-<p>
-Calls a metamethod.
-
-
-<p>
-If the object at index <code>obj</code> has a metatable and this
-metatable has a field <code>e</code>,
-this function calls this field and passes the object as its only argument.
-In this case this function returns 1 and pushes onto the
-stack the value returned by the call.
-If there is no metatable or no metamethod,
-this function returns 0 (without pushing any value on the stack).
-
-
-
-
-
-<hr><h3><a name="luaL_checkany"><code>luaL_checkany</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>void luaL_checkany (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function has an argument
-of any type (including <b>nil</b>) at position <code>narg</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_checkint"><code>luaL_checkint</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_checkint (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a number
-and returns this number cast to an <code>int</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_checkinteger"><code>luaL_checkinteger</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>lua_Integer luaL_checkinteger (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a number
-and returns this number cast to a <a href="#lua_Integer"><code>lua_Integer</code></a>.
-
-
-
-
-
-<hr><h3><a name="luaL_checklong"><code>luaL_checklong</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>long luaL_checklong (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a number
-and returns this number cast to a <code>long</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_checklstring"><code>luaL_checklstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>const char *luaL_checklstring (lua_State *L, int narg, size_t *l);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a string
-and returns this string;
-if <code>l</code> is not <code>NULL</code> fills <code>*l</code>
-with the string's length.
-
-
-<p>
-This function uses <a href="#lua_tolstring"><code>lua_tolstring</code></a> to get its result,
-so all conversions and caveats of that function apply here.
-
-
-
-
-
-<hr><h3><a name="luaL_checknumber"><code>luaL_checknumber</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>lua_Number luaL_checknumber (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a number
-and returns this number.
-
-
-
-
-
-<hr><h3><a name="luaL_checkoption"><code>luaL_checkoption</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_checkoption (lua_State *L,
-                      int narg,
-                      const char *def,
-                      const char *const lst[]);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a string and
-searches for this string in the array <code>lst</code>
-(which must be NULL-terminated).
-Returns the index in the array where the string was found.
-Raises an error if the argument is not a string or
-if the string cannot be found.
-
-
-<p>
-If <code>def</code> is not <code>NULL</code>,
-the function uses <code>def</code> as a default value when
-there is no argument <code>narg</code> or if this argument is <b>nil</b>.
-
-
-<p>
-This is a useful function for mapping strings to C&nbsp;enums.
-(The usual convention in Lua libraries is
-to use strings instead of numbers to select options.)
-
-
-
-
-
-<hr><h3><a name="luaL_checkstack"><code>luaL_checkstack</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>void luaL_checkstack (lua_State *L, int sz, const char *msg);</pre>
-
-<p>
-Grows the stack size to <code>top + sz</code> elements,
-raising an error if the stack cannot grow to that size.
-<code>msg</code> is an additional text to go into the error message.
-
-
-
-
-
-<hr><h3><a name="luaL_checkstring"><code>luaL_checkstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>const char *luaL_checkstring (lua_State *L, int narg);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a string
-and returns this string.
-
-
-<p>
-This function uses <a href="#lua_tolstring"><code>lua_tolstring</code></a> to get its result,
-so all conversions and caveats of that function apply here.
-
-
-
-
-
-<hr><h3><a name="luaL_checktype"><code>luaL_checktype</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>void luaL_checktype (lua_State *L, int narg, int t);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> has type <code>t</code>.
-See <a href="#lua_type"><code>lua_type</code></a> for the encoding of types for <code>t</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_checkudata"><code>luaL_checkudata</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>void *luaL_checkudata (lua_State *L, int narg, const char *tname);</pre>
-
-<p>
-Checks whether the function argument <code>narg</code> is a userdata
-of the type <code>tname</code> (see <a href="#luaL_newmetatable"><code>luaL_newmetatable</code></a>).
-
-
-
-
-
-<hr><h3><a name="luaL_dofile"><code>luaL_dofile</code></a></h3><p>
-<span class="apii">[-0, +?, <em>m</em>]</span>
-<pre>int luaL_dofile (lua_State *L, const char *filename);</pre>
-
-<p>
-Loads and runs the given file.
-It is defined as the following macro:
-
-<pre>
-     (luaL_loadfile(L, filename) || lua_pcall(L, 0, LUA_MULTRET, 0))
-</pre><p>
-It returns 0 if there are no errors
-or 1 in case of errors.
-
-
-
-
-
-<hr><h3><a name="luaL_dostring"><code>luaL_dostring</code></a></h3><p>
-<span class="apii">[-0, +?, <em>m</em>]</span>
-<pre>int luaL_dostring (lua_State *L, const char *str);</pre>
-
-<p>
-Loads and runs the given string.
-It is defined as the following macro:
-
-<pre>
-     (luaL_loadstring(L, str) || lua_pcall(L, 0, LUA_MULTRET, 0))
-</pre><p>
-It returns 0 if there are no errors
-or 1 in case of errors.
-
-
-
-
-
-<hr><h3><a name="luaL_error"><code>luaL_error</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_error (lua_State *L, const char *fmt, ...);</pre>
-
-<p>
-Raises an error.
-The error message format is given by <code>fmt</code>
-plus any extra arguments,
-following the same rules of <a href="#lua_pushfstring"><code>lua_pushfstring</code></a>.
-It also adds at the beginning of the message the file name and
-the line number where the error occurred,
-if this information is available.
-
-
-<p>
-This function never returns,
-but it is an idiom to use it in C&nbsp;functions
-as <code>return luaL_error(<em>args</em>)</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_getmetafield"><code>luaL_getmetafield</code></a></h3><p>
-<span class="apii">[-0, +(0|1), <em>m</em>]</span>
-<pre>int luaL_getmetafield (lua_State *L, int obj, const char *e);</pre>
-
-<p>
-Pushes onto the stack the field <code>e</code> from the metatable
-of the object at index <code>obj</code>.
-If the object does not have a metatable,
-or if the metatable does not have this field,
-returns 0 and pushes nothing.
-
-
-
-
-
-<hr><h3><a name="luaL_getmetatable"><code>luaL_getmetatable</code></a></h3><p>
-<span class="apii">[-0, +1, <em>-</em>]</span>
-<pre>void luaL_getmetatable (lua_State *L, const char *tname);</pre>
-
-<p>
-Pushes onto the stack the metatable associated with name <code>tname</code>
-in the registry (see <a href="#luaL_newmetatable"><code>luaL_newmetatable</code></a>).
-
-
-
-
-
-<hr><h3><a name="luaL_gsub"><code>luaL_gsub</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>const char *luaL_gsub (lua_State *L,
-                       const char *s,
-                       const char *p,
-                       const char *r);</pre>
-
-<p>
-Creates a copy of string <code>s</code> by replacing
-any occurrence of the string <code>p</code>
-with the string <code>r</code>.
-Pushes the resulting string on the stack and returns it.
-
-
-
-
-
-<hr><h3><a name="luaL_loadbuffer"><code>luaL_loadbuffer</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>int luaL_loadbuffer (lua_State *L,
-                     const char *buff,
-                     size_t sz,
-                     const char *name);</pre>
-
-<p>
-Loads a buffer as a Lua chunk.
-This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in the
-buffer pointed to by <code>buff</code> with size <code>sz</code>.
-
-
-<p>
-This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>.
-<code>name</code> is the chunk name,
-used for debug information and error messages.
-
-
-
-
-
-<hr><h3><a name="luaL_loadfile"><code>luaL_loadfile</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>int luaL_loadfile (lua_State *L, const char *filename);</pre>
-
-<p>
-Loads a file as a Lua chunk.
-This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in the file
-named <code>filename</code>.
-If <code>filename</code> is <code>NULL</code>,
-then it loads from the standard input.
-The first line in the file is ignored if it starts with a <code>#</code>.
-
-
-<p>
-This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>,
-but it has an extra error code <a name="pdf-LUA_ERRFILE"><code>LUA_ERRFILE</code></a>
-if it cannot open/read the file.
-
-
-<p>
-As <a href="#lua_load"><code>lua_load</code></a>, this function only loads the chunk;
-it does not run it.
-
-
-
-
-
-<hr><h3><a name="luaL_loadstring"><code>luaL_loadstring</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>int luaL_loadstring (lua_State *L, const char *s);</pre>
-
-<p>
-Loads a string as a Lua chunk.
-This function uses <a href="#lua_load"><code>lua_load</code></a> to load the chunk in
-the zero-terminated string <code>s</code>.
-
-
-<p>
-This function returns the same results as <a href="#lua_load"><code>lua_load</code></a>.
-
-
-<p>
-Also as <a href="#lua_load"><code>lua_load</code></a>, this function only loads the chunk;
-it does not run it.
-
-
-
-
-
-<hr><h3><a name="luaL_newmetatable"><code>luaL_newmetatable</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>int luaL_newmetatable (lua_State *L, const char *tname);</pre>
-
-<p>
-If the registry already has the key <code>tname</code>,
-returns 0.
-Otherwise,
-creates a new table to be used as a metatable for userdata,
-adds it to the registry with key <code>tname</code>,
-and returns 1.
-
-
-<p>
-In both cases pushes onto the stack the final value associated
-with <code>tname</code> in the registry.
-
-
-
-
-
-<hr><h3><a name="luaL_newstate"><code>luaL_newstate</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>lua_State *luaL_newstate (void);</pre>
-
-<p>
-Creates a new Lua state.
-It calls <a href="#lua_newstate"><code>lua_newstate</code></a> with an
-allocator based on the standard&nbsp;C <code>realloc</code> function
-and then sets a panic function (see <a href="#lua_atpanic"><code>lua_atpanic</code></a>) that prints
-an error message to the standard error output in case of fatal
-errors.
-
-
-<p>
-Returns the new state,
-or <code>NULL</code> if there is a memory allocation error.
-
-
-
-
-
-<hr><h3><a name="luaL_openlibs"><code>luaL_openlibs</code></a></h3><p>
-<span class="apii">[-0, +0, <em>m</em>]</span>
-<pre>void luaL_openlibs (lua_State *L);</pre>
-
-<p>
-Opens all standard Lua libraries into the given state.
-
-
-
-
-
-<hr><h3><a name="luaL_optint"><code>luaL_optint</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_optint (lua_State *L, int narg, int d);</pre>
-
-<p>
-If the function argument <code>narg</code> is a number,
-returns this number cast to an <code>int</code>.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-
-
-
-<hr><h3><a name="luaL_optinteger"><code>luaL_optinteger</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>lua_Integer luaL_optinteger (lua_State *L,
-                             int narg,
-                             lua_Integer d);</pre>
-
-<p>
-If the function argument <code>narg</code> is a number,
-returns this number cast to a <a href="#lua_Integer"><code>lua_Integer</code></a>.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-
-
-
-<hr><h3><a name="luaL_optlong"><code>luaL_optlong</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>long luaL_optlong (lua_State *L, int narg, long d);</pre>
-
-<p>
-If the function argument <code>narg</code> is a number,
-returns this number cast to a <code>long</code>.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-
-
-
-<hr><h3><a name="luaL_optlstring"><code>luaL_optlstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>const char *luaL_optlstring (lua_State *L,
-                             int narg,
-                             const char *d,
-                             size_t *l);</pre>
-
-<p>
-If the function argument <code>narg</code> is a string,
-returns this string.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-<p>
-If <code>l</code> is not <code>NULL</code>,
-fills the position <code>*l</code> with the results's length.
-
-
-
-
-
-<hr><h3><a name="luaL_optnumber"><code>luaL_optnumber</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number d);</pre>
-
-<p>
-If the function argument <code>narg</code> is a number,
-returns this number.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-
-
-
-<hr><h3><a name="luaL_optstring"><code>luaL_optstring</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>const char *luaL_optstring (lua_State *L,
-                            int narg,
-                            const char *d);</pre>
-
-<p>
-If the function argument <code>narg</code> is a string,
-returns this string.
-If this argument is absent or is <b>nil</b>,
-returns <code>d</code>.
-Otherwise, raises an error.
-
-
-
-
-
-<hr><h3><a name="luaL_prepbuffer"><code>luaL_prepbuffer</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>char *luaL_prepbuffer (luaL_Buffer *B);</pre>
-
-<p>
-Returns an address to a space of size <a name="pdf-LUAL_BUFFERSIZE"><code>LUAL_BUFFERSIZE</code></a>
-where you can copy a string to be added to buffer <code>B</code>
-(see <a href="#luaL_Buffer"><code>luaL_Buffer</code></a>).
-After copying the string into this space you must call
-<a href="#luaL_addsize"><code>luaL_addsize</code></a> with the size of the string to actually add 
-it to the buffer.
-
-
-
-
-
-<hr><h3><a name="luaL_pushresult"><code>luaL_pushresult</code></a></h3><p>
-<span class="apii">[-?, +1, <em>m</em>]</span>
-<pre>void luaL_pushresult (luaL_Buffer *B);</pre>
-
-<p>
-Finishes the use of buffer <code>B</code> leaving the final string on
-the top of the stack.
-
-
-
-
-
-<hr><h3><a name="luaL_ref"><code>luaL_ref</code></a></h3><p>
-<span class="apii">[-1, +0, <em>m</em>]</span>
-<pre>int luaL_ref (lua_State *L, int t);</pre>
-
-<p>
-Creates and returns a <em>reference</em>,
-in the table at index <code>t</code>,
-for the object at the top of the stack (and pops the object).
-
-
-<p>
-A reference is a unique integer key.
-As long as you do not manually add integer keys into table <code>t</code>,
-<a href="#luaL_ref"><code>luaL_ref</code></a> ensures the uniqueness of the key it returns.
-You can retrieve an object referred by reference <code>r</code>
-by calling <code>lua_rawgeti(L, t, r)</code>.
-Function <a href="#luaL_unref"><code>luaL_unref</code></a> frees a reference and its associated object.
-
-
-<p>
-If the object at the top of the stack is <b>nil</b>,
-<a href="#luaL_ref"><code>luaL_ref</code></a> returns the constant <a name="pdf-LUA_REFNIL"><code>LUA_REFNIL</code></a>.
-The constant <a name="pdf-LUA_NOREF"><code>LUA_NOREF</code></a> is guaranteed to be different
-from any reference returned by <a href="#luaL_ref"><code>luaL_ref</code></a>.
-
-
-
-
-
-<hr><h3><a name="luaL_Reg"><code>luaL_Reg</code></a></h3>
-<pre>typedef struct luaL_Reg {
-  const char *name;
-  lua_CFunction func;
-} luaL_Reg;</pre>
-
-<p>
-Type for arrays of functions to be registered by
-<a href="#luaL_register"><code>luaL_register</code></a>.
-<code>name</code> is the function name and <code>func</code> is a pointer to
-the function.
-Any array of <a href="#luaL_Reg"><code>luaL_Reg</code></a> must end with an sentinel entry
-in which both <code>name</code> and <code>func</code> are <code>NULL</code>.
-
-
-
-
-
-<hr><h3><a name="luaL_register"><code>luaL_register</code></a></h3><p>
-<span class="apii">[-(0|1), +1, <em>m</em>]</span>
-<pre>void luaL_register (lua_State *L,
-                    const char *libname,
-                    const luaL_Reg *l);</pre>
-
-<p>
-Opens a library.
-
-
-<p>
-When called with <code>libname</code> equal to <code>NULL</code>,
-it simply registers all functions in the list <code>l</code>
-(see <a href="#luaL_Reg"><code>luaL_Reg</code></a>) into the table on the top of the stack.
-
-
-<p>
-When called with a non-null <code>libname</code>,
-<code>luaL_register</code> creates a new table <code>t</code>,
-sets it as the value of the global variable <code>libname</code>,
-sets it as the value of <code>package.loaded[libname]</code>,
-and registers on it all functions in the list <code>l</code>.
-If there is a table in <code>package.loaded[libname]</code> or in
-variable <code>libname</code>,
-reuses this table instead of creating a new one.
-
-
-<p>
-In any case the function leaves the table
-on the top of the stack.
-
-
-
-
-
-<hr><h3><a name="luaL_typename"><code>luaL_typename</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>const char *luaL_typename (lua_State *L, int index);</pre>
-
-<p>
-Returns the name of the type of the value at the given index.
-
-
-
-
-
-<hr><h3><a name="luaL_typerror"><code>luaL_typerror</code></a></h3><p>
-<span class="apii">[-0, +0, <em>v</em>]</span>
-<pre>int luaL_typerror (lua_State *L, int narg, const char *tname);</pre>
-
-<p>
-Generates an error with a message like the following:
-
-<pre>
-     <em>location</em>: bad argument <em>narg</em> to '<em>func</em>' (<em>tname</em> expected, got <em>rt</em>)
-</pre><p>
-where <code><em>location</em></code> is produced by <a href="#luaL_where"><code>luaL_where</code></a>,
-<code><em>func</em></code> is the name of the current function,
-and <code><em>rt</em></code> is the type name of the actual argument.
-
-
-
-
-
-<hr><h3><a name="luaL_unref"><code>luaL_unref</code></a></h3><p>
-<span class="apii">[-0, +0, <em>-</em>]</span>
-<pre>void luaL_unref (lua_State *L, int t, int ref);</pre>
-
-<p>
-Releases reference <code>ref</code> from the table at index <code>t</code>
-(see <a href="#luaL_ref"><code>luaL_ref</code></a>).
-The entry is removed from the table,
-so that the referred object can be collected.
-The reference <code>ref</code> is also freed to be used again.
-
-
-<p>
-If <code>ref</code> is <a href="#pdf-LUA_NOREF"><code>LUA_NOREF</code></a> or <a href="#pdf-LUA_REFNIL"><code>LUA_REFNIL</code></a>,
-<a href="#luaL_unref"><code>luaL_unref</code></a> does nothing.
-
-
-
-
-
-<hr><h3><a name="luaL_where"><code>luaL_where</code></a></h3><p>
-<span class="apii">[-0, +1, <em>m</em>]</span>
-<pre>void luaL_where (lua_State *L, int lvl);</pre>
-
-<p>
-Pushes onto the stack a string identifying the current position
-of the control at level <code>lvl</code> in the call stack.
-Typically this string has the following format:
-
-<pre>
-     <em>chunkname</em>:<em>currentline</em>:
-</pre><p>
-Level&nbsp;0 is the running function,
-level&nbsp;1 is the function that called the running function,
-etc.
-
-
-<p>
-This function is used to build a prefix for error messages.
-
-
-
-
-
-
-
-<h1>5 - <a name="5">Standard Libraries</a></h1>
-
-<p>
-The standard Lua libraries provide useful functions
-that are implemented directly through the C&nbsp;API.
-Some of these functions provide essential services to the language
-(e.g., <a href="#pdf-type"><code>type</code></a> and <a href="#pdf-getmetatable"><code>getmetatable</code></a>);
-others provide access to "outside" services (e.g., I/O);
-and others could be implemented in Lua itself,
-but are quite useful or have critical performance requirements that
-deserve an implementation in C (e.g., <a href="#pdf-table.sort"><code>table.sort</code></a>).
-
-
-<p>
-All libraries are implemented through the official C&nbsp;API
-and are provided as separate C&nbsp;modules.
-Currently, Lua has the following standard libraries:
-
-<ul>
-
-<li>basic library, which includes the coroutine sub-library;</li>
-
-<li>package library;</li>
-
-<li>string manipulation;</li>
-
-<li>table manipulation;</li>
-
-<li>mathematical functions (sin, log, etc.);</li>
-
-<li>input and output;</li>
-
-<li>operating system facilities;</li>
-
-<li>debug facilities.</li>
-
-</ul><p>
-Except for the basic and package libraries,
-each library provides all its functions as fields of a global table
-or as methods of its objects.
-
-
-<p>
-To have access to these libraries,
-the C&nbsp;host program should call the <a href="#luaL_openlibs"><code>luaL_openlibs</code></a> function,
-which opens all standard libraries.
-Alternatively,
-it can open them individually by calling
-<a name="pdf-luaopen_base"><code>luaopen_base</code></a> (for the basic library),
-<a name="pdf-luaopen_package"><code>luaopen_package</code></a> (for the package library),
-<a name="pdf-luaopen_string"><code>luaopen_string</code></a> (for the string library),
-<a name="pdf-luaopen_table"><code>luaopen_table</code></a> (for the table library),
-<a name="pdf-luaopen_math"><code>luaopen_math</code></a> (for the mathematical library),
-<a name="pdf-luaopen_io"><code>luaopen_io</code></a> (for the I/O library),
-<a name="pdf-luaopen_os"><code>luaopen_os</code></a> (for the Operating System library),
-and <a name="pdf-luaopen_debug"><code>luaopen_debug</code></a> (for the debug library).
-These functions are declared in <a name="pdf-lualib.h"><code>lualib.h</code></a>
-and should not be called directly:
-you must call them like any other Lua C&nbsp;function,
-e.g., by using <a href="#lua_call"><code>lua_call</code></a>.
-
-
-
-<h2>5.1 - <a name="5.1">Basic Functions</a></h2>
-
-<p>
-The basic library provides some core functions to Lua.
-If you do not include this library in your application,
-you should check carefully whether you need to provide 
-implementations for some of its facilities.
-
-
-<p>
-<hr><h3><a name="pdf-assert"><code>assert (v [, message])</code></a></h3>
-Issues an  error when
-the value of its argument <code>v</code> is false (i.e., <b>nil</b> or <b>false</b>);
-otherwise, returns all its arguments.
-<code>message</code> is an error message;
-when absent, it defaults to "assertion failed!"
-
-
-
-
-<p>
-<hr><h3><a name="pdf-collectgarbage"><code>collectgarbage ([opt [, arg]])</code></a></h3>
-
-
-<p>
-This function is a generic interface to the garbage collector.
-It performs different functions according to its first argument, <code>opt</code>:
-
-<ul>
-
-<li><b>"collect":</b>
-performs a full garbage-collection cycle.
-This is the default option.
-</li>
-
-<li><b>"stop":</b>
-stops the garbage collector.
-</li>
-
-<li><b>"restart":</b>
-restarts the garbage collector.
-</li>
-
-<li><b>"count":</b>
-returns the total memory in use by Lua (in Kbytes).
-</li>
-
-<li><b>"step":</b>
-performs a garbage-collection step.
-The step "size" is controlled by <code>arg</code>
-(larger values mean more steps) in a non-specified way.
-If you want to control the step size
-you must experimentally tune the value of <code>arg</code>.
-Returns <b>true</b> if the step finished a collection cycle.
-</li>
-
-<li><b>"setpause":</b>
-sets <code>arg</code> as the new value for the <em>pause</em> of
-the collector (see <a href="#2.10">&sect;2.10</a>).
-Returns the previous value for <em>pause</em>.
-</li>
-
-<li><b>"setstepmul":</b>
-sets <code>arg</code> as the new value for the <em>step multiplier</em> of
-the collector (see <a href="#2.10">&sect;2.10</a>).
-Returns the previous value for <em>step</em>.
-</li>
-
-</ul>
-
-
-
-<p>
-<hr><h3><a name="pdf-dofile"><code>dofile ([filename])</code></a></h3>
-Opens the named file and executes its contents as a Lua chunk.
-When called without arguments,
-<code>dofile</code> executes the contents of the standard input (<code>stdin</code>).
-Returns all values returned by the chunk.
-In case of errors, <code>dofile</code> propagates the error
-to its caller (that is, <code>dofile</code> does not run in protected mode).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-error"><code>error (message [, level])</code></a></h3>
-Terminates the last protected function called
-and returns <code>message</code> as the error message.
-Function <code>error</code> never returns.
-
-
-<p>
-Usually, <code>error</code> adds some information about the error position
-at the beginning of the message.
-The <code>level</code> argument specifies how to get the error position.
-With level&nbsp;1 (the default), the error position is where the
-<code>error</code> function was called.
-Level&nbsp;2 points the error to where the function
-that called <code>error</code> was called; and so on.
-Passing a level&nbsp;0 avoids the addition of error position information
-to the message.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-_G"><code>_G</code></a></h3>
-A global variable (not a function) that
-holds the global environment (that is, <code>_G._G = _G</code>).
-Lua itself does not use this variable;
-changing its value does not affect any environment,
-nor vice-versa.
-(Use <a href="#pdf-setfenv"><code>setfenv</code></a> to change environments.)
-
-
-
-
-<p>
-<hr><h3><a name="pdf-getfenv"><code>getfenv ([f])</code></a></h3>
-Returns the current environment in use by the function.
-<code>f</code> can be a Lua function or a number
-that specifies the function at that stack level:
-Level&nbsp;1 is the function calling <code>getfenv</code>.
-If the given function is not a Lua function,
-or if <code>f</code> is 0,
-<code>getfenv</code> returns the global environment.
-The default for <code>f</code> is 1.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-getmetatable"><code>getmetatable (object)</code></a></h3>
-
-
-<p>
-If <code>object</code> does not have a metatable, returns <b>nil</b>.
-Otherwise,
-if the object's metatable has a <code>"__metatable"</code> field,
-returns the associated value.
-Otherwise, returns the metatable of the given object.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-ipairs"><code>ipairs (t)</code></a></h3>
-
-
-<p>
-Returns three values: an iterator function, the table <code>t</code>, and 0,
-so that the construction
-
-<pre>
-     for i,v in ipairs(t) do <em>body</em> end
-</pre><p>
-will iterate over the pairs (<code>1,t[1]</code>), (<code>2,t[2]</code>), &middot;&middot;&middot;,
-up to the first integer key absent from the table.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-load"><code>load (func [, chunkname])</code></a></h3>
-
-
-<p>
-Loads a chunk using function <code>func</code> to get its pieces.
-Each call to <code>func</code> must return a string that concatenates
-with previous results.
-A return of an empty string, <b>nil</b>, or no value signals the end of the chunk.
-
-
-<p>
-If there are no errors, 
-returns the compiled chunk as a function;
-otherwise, returns <b>nil</b> plus the error message.
-The environment of the returned function is the global environment.
-
-
-<p>
-<code>chunkname</code> is used as the chunk name for error messages
-and debug information.
-When absent,
-it defaults to "<code>=(load)</code>".
-
-
-
-
-<p>
-<hr><h3><a name="pdf-loadfile"><code>loadfile ([filename])</code></a></h3>
-
-
-<p>
-Similar to <a href="#pdf-load"><code>load</code></a>,
-but gets the chunk from file <code>filename</code>
-or from the standard input,
-if no file name is given.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-loadstring"><code>loadstring (string [, chunkname])</code></a></h3>
-
-
-<p>
-Similar to <a href="#pdf-load"><code>load</code></a>,
-but gets the chunk from the given string.
-
-
-<p>
-To load and run a given string, use the idiom
-
-<pre>
-     assert(loadstring(s))()
-</pre>
-
-<p>
-When absent,
-<code>chunkname</code> defaults to the given string.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-next"><code>next (table [, index])</code></a></h3>
-
-
-<p>
-Allows a program to traverse all fields of a table.
-Its first argument is a table and its second argument
-is an index in this table.
-<code>next</code> returns the next index of the table
-and its associated value.
-When called with <b>nil</b> as its second argument,
-<code>next</code> returns an initial index
-and its associated value.
-When called with the last index,
-or with <b>nil</b> in an empty table,
-<code>next</code> returns <b>nil</b>.
-If the second argument is absent, then it is interpreted as <b>nil</b>.
-In particular,
-you can use <code>next(t)</code> to check whether a table is empty.
-
-
-<p>
-The order in which the indices are enumerated is not specified,
-<em>even for numeric indices</em>.
-(To traverse a table in numeric order,
-use a numerical <b>for</b> or the <a href="#pdf-ipairs"><code>ipairs</code></a> function.)
-
-
-<p>
-The behavior of <code>next</code> is <em>undefined</em> if,
-during the traversal,
-you assign any value to a non-existent field in the table.
-You may however modify existing fields.
-In particular, you may clear existing fields.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-pairs"><code>pairs (t)</code></a></h3>
-
-
-<p>
-Returns three values: the <a href="#pdf-next"><code>next</code></a> function, the table <code>t</code>, and <b>nil</b>,
-so that the construction
-
-<pre>
-     for k,v in pairs(t) do <em>body</em> end
-</pre><p>
-will iterate over all key&ndash;value pairs of table <code>t</code>.
-
-
-<p>
-See function <a href="#pdf-next"><code>next</code></a> for the caveats of modifying
-the table during its traversal.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-pcall"><code>pcall (f, arg1, &middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Calls function <code>f</code> with
-the given arguments in <em>protected mode</em>.
-This means that any error inside&nbsp;<code>f</code> is not propagated;
-instead, <code>pcall</code> catches the error
-and returns a status code.
-Its first result is the status code (a boolean),
-which is true if the call succeeds without errors.
-In such case, <code>pcall</code> also returns all results from the call,
-after this first result.
-In case of any error, <code>pcall</code> returns <b>false</b> plus the error message.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-print"><code>print (&middot;&middot;&middot;)</code></a></h3>
-Receives any number of arguments,
-and prints their values to <code>stdout</code>,
-using the <a href="#pdf-tostring"><code>tostring</code></a> function to convert them to strings.
-<code>print</code> is not intended for formatted output,
-but only as a quick way to show a value,
-typically for debugging.
-For formatted output, use <a href="#pdf-string.format"><code>string.format</code></a>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-rawequal"><code>rawequal (v1, v2)</code></a></h3>
-Checks whether <code>v1</code> is equal to <code>v2</code>,
-without invoking any metamethod.
-Returns a boolean.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-rawget"><code>rawget (table, index)</code></a></h3>
-Gets the real value of <code>table[index]</code>,
-without invoking any metamethod.
-<code>table</code> must be a table;
-<code>index</code> may be any value.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-rawset"><code>rawset (table, index, value)</code></a></h3>
-Sets the real value of <code>table[index]</code> to <code>value</code>,
-without invoking any metamethod.
-<code>table</code> must be a table,
-<code>index</code> any value different from <b>nil</b>,
-and <code>value</code> any Lua value.
-
-
-<p>
-This function returns <code>table</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-select"><code>select (index, &middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-If <code>index</code> is a number,
-returns all arguments after argument number <code>index</code>.
-Otherwise, <code>index</code> must be the string <code>"#"</code>,
-and <code>select</code> returns the total number of extra arguments it received.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-setfenv"><code>setfenv (f, table)</code></a></h3>
-
-
-<p>
-Sets the environment to be used by the given function.
-<code>f</code> can be a Lua function or a number
-that specifies the function at that stack level:
-Level&nbsp;1 is the function calling <code>setfenv</code>.
-<code>setfenv</code> returns the given function.
-
-
-<p>
-As a special case, when <code>f</code> is 0 <code>setfenv</code> changes
-the environment of the running thread.
-In this case, <code>setfenv</code> returns no values.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-setmetatable"><code>setmetatable (table, metatable)</code></a></h3>
-
-
-<p>
-Sets the metatable for the given table.
-(You cannot change the metatable of other types from Lua, only from&nbsp;C.)
-If <code>metatable</code> is <b>nil</b>,
-removes the metatable of the given table.
-If the original metatable has a <code>"__metatable"</code> field,
-raises an error.
-
-
-<p>
-This function returns <code>table</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-tonumber"><code>tonumber (e [, base])</code></a></h3>
-Tries to convert its argument to a number.
-If the argument is already a number or a string convertible
-to a number, then <code>tonumber</code> returns this number;
-otherwise, it returns <b>nil</b>.
-
-
-<p>
-An optional argument specifies the base to interpret the numeral.
-The base may be any integer between 2 and 36, inclusive.
-In bases above&nbsp;10, the letter '<code>A</code>' (in either upper or lower case)
-represents&nbsp;10, '<code>B</code>' represents&nbsp;11, and so forth,
-with '<code>Z</code>' representing 35.
-In base 10 (the default), the number can have a decimal part,
-as well as an optional exponent part (see <a href="#2.1">&sect;2.1</a>).
-In other bases, only unsigned integers are accepted.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-tostring"><code>tostring (e)</code></a></h3>
-Receives an argument of any type and
-converts it to a string in a reasonable format.
-For complete control of how numbers are converted,
-use <a href="#pdf-string.format"><code>string.format</code></a>.
-
-
-<p>
-If the metatable of <code>e</code> has a <code>"__tostring"</code> field,
-then <code>tostring</code> calls the corresponding value
-with <code>e</code> as argument,
-and uses the result of the call as its result.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-type"><code>type (v)</code></a></h3>
-Returns the type of its only argument, coded as a string.
-The possible results of this function are
-"<code>nil</code>" (a string, not the value <b>nil</b>),
-"<code>number</code>",
-"<code>string</code>",
-"<code>boolean</code>",
-"<code>table</code>",
-"<code>function</code>",
-"<code>thread</code>",
-and "<code>userdata</code>".
-
-
-
-
-<p>
-<hr><h3><a name="pdf-unpack"><code>unpack (list [, i [, j]])</code></a></h3>
-Returns the elements from the given table.
-This function is equivalent to
-
-<pre>
-     return list[i], list[i+1], &middot;&middot;&middot;, list[j]
-</pre><p>
-except that the above code can be written only for a fixed number
-of elements.
-By default, <code>i</code> is&nbsp;1 and <code>j</code> is the length of the list,
-as defined by the length operator (see <a href="#2.5.5">&sect;2.5.5</a>).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-_VERSION"><code>_VERSION</code></a></h3>
-A global variable (not a function) that
-holds a string containing the current interpreter version.
-The current contents of this variable is "<code>Lua 5.1</code>".
-
-
-
-
-<p>
-<hr><h3><a name="pdf-xpcall"><code>xpcall (f, err)</code></a></h3>
-
-
-<p>
-This function is similar to <a href="#pdf-pcall"><code>pcall</code></a>,
-except that you can set a new error handler.
-
-
-<p>
-<code>xpcall</code> calls function <code>f</code> in protected mode,
-using <code>err</code> as the error handler.
-Any error inside <code>f</code> is not propagated;
-instead, <code>xpcall</code> catches the error,
-calls the <code>err</code> function with the original error object,
-and returns a status code.
-Its first result is the status code (a boolean),
-which is true if the call succeeds without errors.
-In this case, <code>xpcall</code> also returns all results from the call,
-after this first result.
-In case of any error,
-<code>xpcall</code> returns <b>false</b> plus the result from <code>err</code>.
-
-
-
-
-
-
-
-<h2>5.2 - <a name="5.2">Coroutine Manipulation</a></h2>
-
-<p>
-The operations related to coroutines comprise a sub-library of
-the basic library and come inside the table <a name="pdf-coroutine"><code>coroutine</code></a>.
-See <a href="#2.11">&sect;2.11</a> for a general description of coroutines.
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.create"><code>coroutine.create (f)</code></a></h3>
-
-
-<p>
-Creates a new coroutine, with body <code>f</code>.
-<code>f</code> must be a Lua function.
-Returns this new coroutine,
-an object with type <code>"thread"</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.resume"><code>coroutine.resume (co [, val1, &middot;&middot;&middot;])</code></a></h3>
-
-
-<p>
-Starts or continues the execution of coroutine <code>co</code>.
-The first time you resume a coroutine,
-it starts running its body.
-The values <code>val1</code>, &middot;&middot;&middot; are passed
-as the arguments to the body function.
-If the coroutine has yielded,
-<code>resume</code> restarts it;
-the values <code>val1</code>, &middot;&middot;&middot; are passed
-as the results from the yield.
-
-
-<p>
-If the coroutine runs without any errors,
-<code>resume</code> returns <b>true</b> plus any values passed to <code>yield</code>
-(if the coroutine yields) or any values returned by the body function
-(if the coroutine terminates).
-If there is any error,
-<code>resume</code> returns <b>false</b> plus the error message.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.running"><code>coroutine.running ()</code></a></h3>
-
-
-<p>
-Returns the running coroutine,
-or <b>nil</b> when called by the main thread.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.status"><code>coroutine.status (co)</code></a></h3>
-
-
-<p>
-Returns the status of coroutine <code>co</code>, as a string:
-<code>"running"</code>,
-if the coroutine is running (that is, it called <code>status</code>);
-<code>"suspended"</code>, if the coroutine is suspended in a call to <code>yield</code>,
-or if it has not started running yet;
-<code>"normal"</code> if the coroutine is active but not running
-(that is, it has resumed another coroutine);
-and <code>"dead"</code> if the coroutine has finished its body function,
-or if it has stopped with an error.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.wrap"><code>coroutine.wrap (f)</code></a></h3>
-
-
-<p>
-Creates a new coroutine, with body <code>f</code>.
-<code>f</code> must be a Lua function.
-Returns a function that resumes the coroutine each time it is called.
-Any arguments passed to the function behave as the
-extra arguments to <code>resume</code>.
-Returns the same values returned by <code>resume</code>,
-except the first boolean.
-In case of error, propagates the error.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-coroutine.yield"><code>coroutine.yield (&middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Suspends the execution of the calling coroutine.
-The coroutine cannot be running a C&nbsp;function,
-a metamethod, or an iterator.
-Any arguments to <code>yield</code> are passed as extra results to <code>resume</code>.
-
-
-
-
-
-
-
-<h2>5.3 - <a name="5.3">Modules</a></h2>
-
-<p>
-The package library provides basic
-facilities for loading and building modules in Lua.
-It exports two of its functions directly in the global environment:
-<a href="#pdf-require"><code>require</code></a> and <a href="#pdf-module"><code>module</code></a>.
-Everything else is exported in a table <a name="pdf-package"><code>package</code></a>.
-
-
-<p>
-<hr><h3><a name="pdf-module"><code>module (name [, &middot;&middot;&middot;])</code></a></h3>
-
-
-<p>
-Creates a module.
-If there is a table in <code>package.loaded[name]</code>,
-this table is the module.
-Otherwise, if there is a global table <code>t</code> with the given name,
-this table is the module.
-Otherwise creates a new table <code>t</code> and
-sets it as the value of the global <code>name</code> and
-the value of <code>package.loaded[name]</code>.
-This function also initializes <code>t._NAME</code> with the given name,
-<code>t._M</code> with the module (<code>t</code> itself),
-and <code>t._PACKAGE</code> with the package name
-(the full module name minus last component; see below).
-Finally, <code>module</code> sets <code>t</code> as the new environment
-of the current function and the new value of <code>package.loaded[name]</code>,
-so that <a href="#pdf-require"><code>require</code></a> returns <code>t</code>.
-
-
-<p>
-If <code>name</code> is a compound name
-(that is, one with components separated by dots),
-<code>module</code> creates (or reuses, if they already exist)
-tables for each component.
-For instance, if <code>name</code> is <code>a.b.c</code>,
-then <code>module</code> stores the module table in field <code>c</code> of
-field <code>b</code> of global <code>a</code>.
-
-
-<p>
-This function can receive optional <em>options</em> after
-the module name,
-where each option is a function to be applied over the module.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-require"><code>require (modname)</code></a></h3>
-
-
-<p>
-Loads the given module.
-The function starts by looking into the <a href="#pdf-package.loaded"><code>package.loaded</code></a> table
-to determine whether <code>modname</code> is already loaded.
-If it is, then <code>require</code> returns the value stored
-at <code>package.loaded[modname]</code>.
-Otherwise, it tries to find a <em>loader</em> for the module.
-
-
-<p>
-To find a loader,
-<code>require</code> is guided by the <a href="#pdf-package.loaders"><code>package.loaders</code></a> array.
-By changing this array,
-we can change how <code>require</code> looks for a module.
-The following explanation is based on the default configuration
-for <a href="#pdf-package.loaders"><code>package.loaders</code></a>.
-
-
-<p>
-First <code>require</code> queries <code>package.preload[modname]</code>.
-If it has a value,
-this value (which should be a function) is the loader.
-Otherwise <code>require</code> searches for a Lua loader using the
-path stored in <a href="#pdf-package.path"><code>package.path</code></a>.
-If that also fails, it searches for a C&nbsp;loader using the
-path stored in <a href="#pdf-package.cpath"><code>package.cpath</code></a>.
-If that also fails,
-it tries an <em>all-in-one</em> loader (see <a href="#pdf-package.loaders"><code>package.loaders</code></a>).
-
-
-<p>
-Once a loader is found,
-<code>require</code> calls the loader with a single argument, <code>modname</code>.
-If the loader returns any value,
-<code>require</code> assigns the returned value to <code>package.loaded[modname]</code>.
-If the loader returns no value and
-has not assigned any value to <code>package.loaded[modname]</code>,
-then <code>require</code> assigns <b>true</b> to this entry.
-In any case, <code>require</code> returns the
-final value of <code>package.loaded[modname]</code>.
-
-
-<p>
-If there is any error loading or running the module,
-or if it cannot find any loader for the module,
-then <code>require</code> signals an error. 
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.cpath"><code>package.cpath</code></a></h3>
-
-
-<p>
-The path used by <a href="#pdf-require"><code>require</code></a> to search for a C&nbsp;loader.
-
-
-<p>
-Lua initializes the C&nbsp;path <a href="#pdf-package.cpath"><code>package.cpath</code></a> in the same way
-it initializes the Lua path <a href="#pdf-package.path"><code>package.path</code></a>,
-using the environment variable <a name="pdf-LUA_CPATH"><code>LUA_CPATH</code></a>
-or a default path defined in <code>luaconf.h</code>.
-
-
-
-
-<p>
-
-<hr><h3><a name="pdf-package.loaded"><code>package.loaded</code></a></h3>
-
-
-<p>
-A table used by <a href="#pdf-require"><code>require</code></a> to control which
-modules are already loaded.
-When you require a module <code>modname</code> and
-<code>package.loaded[modname]</code> is not false,
-<a href="#pdf-require"><code>require</code></a> simply returns the value stored there.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.loaders"><code>package.loaders</code></a></h3>
-
-
-<p>
-A table used by <a href="#pdf-require"><code>require</code></a> to control how to load modules.
-
-
-<p>
-Each entry in this table is a <em>searcher function</em>.
-When looking for a module,
-<a href="#pdf-require"><code>require</code></a> calls each of these searchers in ascending order,
-with the module name (the argument given to <a href="#pdf-require"><code>require</code></a>) as its
-sole parameter.
-The function can return another function (the module <em>loader</em>)
-or a string explaining why it did not find that module
-(or <b>nil</b> if it has nothing to say).
-Lua initializes this table with four functions.
-
-
-<p>
-The first searcher simply looks for a loader in the
-<a href="#pdf-package.preload"><code>package.preload</code></a> table.
-
-
-<p>
-The second searcher looks for a loader as a Lua library,
-using the path stored at <a href="#pdf-package.path"><code>package.path</code></a>.
-A path is a sequence of <em>templates</em> separated by semicolons.
-For each template,
-the searcher will change each interrogation
-mark in the template by <code>filename</code>,
-which is the module name with each dot replaced by a
-"directory separator" (such as "<code>/</code>" in Unix);
-then it will try to open the resulting file name.
-So, for instance, if the Lua path is the string
-
-<pre>
-     "./?.lua;./?.lc;/usr/local/?/init.lua"
-</pre><p>
-the search for a Lua file for module <code>foo</code>
-will try to open the files
-<code>./foo.lua</code>, <code>./foo.lc</code>, and
-<code>/usr/local/foo/init.lua</code>, in that order.
-
-
-<p>
-The third searcher looks for a loader as a C&nbsp;library,
-using the path given by the variable <a href="#pdf-package.cpath"><code>package.cpath</code></a>.
-For instance,
-if the C&nbsp;path is the string
-
-<pre>
-     "./?.so;./?.dll;/usr/local/?/init.so"
-</pre><p>
-the searcher for module <code>foo</code>
-will try to open the files <code>./foo.so</code>, <code>./foo.dll</code>,
-and <code>/usr/local/foo/init.so</code>, in that order.
-Once it finds a C&nbsp;library,
-this searcher first uses a dynamic link facility to link the
-application with the library.
-Then it tries to find a C&nbsp;function inside the library to
-be used as the loader.
-The name of this C&nbsp;function is the string "<code>luaopen_</code>"
-concatenated with a copy of the module name where each dot
-is replaced by an underscore.
-Moreover, if the module name has a hyphen,
-its prefix up to (and including) the first hyphen is removed.
-For instance, if the module name is <code>a.v1-b.c</code>,
-the function name will be <code>luaopen_b_c</code>.
-
-
-<p>
-The fourth searcher tries an <em>all-in-one loader</em>.
-It searches the C&nbsp;path for a library for
-the root name of the given module.
-For instance, when requiring <code>a.b.c</code>,
-it will search for a C&nbsp;library for <code>a</code>.
-If found, it looks into it for an open function for
-the submodule;
-in our example, that would be <code>luaopen_a_b_c</code>.
-With this facility, a package can pack several C&nbsp;submodules
-into one single library,
-with each submodule keeping its original open function.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.loadlib"><code>package.loadlib (libname, funcname)</code></a></h3>
-
-
-<p>
-Dynamically links the host program with the C&nbsp;library <code>libname</code>.
-Inside this library, looks for a function <code>funcname</code>
-and returns this function as a C&nbsp;function.
-(So, <code>funcname</code> must follow the protocol (see <a href="#lua_CFunction"><code>lua_CFunction</code></a>)).
-
-
-<p>
-This is a low-level function.
-It completely bypasses the package and module system.
-Unlike <a href="#pdf-require"><code>require</code></a>,
-it does not perform any path searching and
-does not automatically adds extensions.
-<code>libname</code> must be the complete file name of the C&nbsp;library,
-including if necessary a path and extension.
-<code>funcname</code> must be the exact name exported by the C&nbsp;library
-(which may depend on the C&nbsp;compiler and linker used).
-
-
-<p>
-This function is not supported by ANSI C.
-As such, it is only available on some platforms
-(Windows, Linux, Mac OS X, Solaris, BSD,
-plus other Unix systems that support the <code>dlfcn</code> standard).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.path"><code>package.path</code></a></h3>
-
-
-<p>
-The path used by <a href="#pdf-require"><code>require</code></a> to search for a Lua loader.
-
-
-<p>
-At start-up, Lua initializes this variable with
-the value of the environment variable <a name="pdf-LUA_PATH"><code>LUA_PATH</code></a> or
-with a default path defined in <code>luaconf.h</code>,
-if the environment variable is not defined.
-Any "<code>;;</code>" in the value of the environment variable
-is replaced by the default path.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.preload"><code>package.preload</code></a></h3>
-
-
-<p>
-A table to store loaders for specific modules
-(see <a href="#pdf-require"><code>require</code></a>).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-package.seeall"><code>package.seeall (module)</code></a></h3>
-
-
-<p>
-Sets a metatable for <code>module</code> with
-its <code>__index</code> field referring to the global environment,
-so that this module inherits values
-from the global environment.
-To be used as an option to function <a href="#pdf-module"><code>module</code></a>.
-
-
-
-
-
-
-
-<h2>5.4 - <a name="5.4">String Manipulation</a></h2>
-
-<p>
-This library provides generic functions for string manipulation,
-such as finding and extracting substrings, and pattern matching.
-When indexing a string in Lua, the first character is at position&nbsp;1
-(not at&nbsp;0, as in C).
-Indices are allowed to be negative and are interpreted as indexing backwards,
-from the end of the string.
-Thus, the last character is at position -1, and so on.
-
-
-<p>
-The string library provides all its functions inside the table
-<a name="pdf-string"><code>string</code></a>.
-It also sets a metatable for strings
-where the <code>__index</code> field points to the <code>string</code> table.
-Therefore, you can use the string functions in object-oriented style.
-For instance, <code>string.byte(s, i)</code>
-can be written as <code>s:byte(i)</code>.
-
-
-<p>
-The string library assumes one-byte character encodings.
-
-
-<p>
-<hr><h3><a name="pdf-string.byte"><code>string.byte (s [, i [, j]])</code></a></h3>
-Returns the internal numerical codes of the characters <code>s[i]</code>,
-<code>s[i+1]</code>, &middot;&middot;&middot;, <code>s[j]</code>.
-The default value for <code>i</code> is&nbsp;1;
-the default value for <code>j</code> is&nbsp;<code>i</code>.
-
-
-<p>
-Note that numerical codes are not necessarily portable across platforms.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.char"><code>string.char (&middot;&middot;&middot;)</code></a></h3>
-Receives zero or more integers.
-Returns a string with length equal to the number of arguments,
-in which each character has the internal numerical code equal
-to its corresponding argument.
-
-
-<p>
-Note that numerical codes are not necessarily portable across platforms.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.dump"><code>string.dump (function)</code></a></h3>
-
-
-<p>
-Returns a string containing a binary representation of the given function,
-so that a later <a href="#pdf-loadstring"><code>loadstring</code></a> on this string returns
-a copy of the function.
-<code>function</code> must be a Lua function without upvalues.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.find"><code>string.find (s, pattern [, init [, plain]])</code></a></h3>
-Looks for the first match of
-<code>pattern</code> in the string <code>s</code>.
-If it finds a match, then <code>find</code> returns the indices of&nbsp;<code>s</code>
-where this occurrence starts and ends;
-otherwise, it returns <b>nil</b>.
-A third, optional numerical argument <code>init</code> specifies
-where to start the search;
-its default value is&nbsp;1 and can be negative.
-A value of <b>true</b> as a fourth, optional argument <code>plain</code>
-turns off the pattern matching facilities,
-so the function does a plain "find substring" operation,
-with no characters in <code>pattern</code> being considered "magic".
-Note that if <code>plain</code> is given, then <code>init</code> must be given as well.
-
-
-<p>
-If the pattern has captures,
-then in a successful match
-the captured values are also returned,
-after the two indices.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.format"><code>string.format (formatstring, &middot;&middot;&middot;)</code></a></h3>
-Returns a formatted version of its variable number of arguments
-following the description given in its first argument (which must be a string).
-The format string follows the same rules as the <code>printf</code> family of
-standard C&nbsp;functions.
-The only differences are that the options/modifiers
-<code>*</code>, <code>l</code>, <code>L</code>, <code>n</code>, <code>p</code>,
-and <code>h</code> are not supported
-and that there is an extra option, <code>q</code>.
-The <code>q</code> option formats a string in a form suitable to be safely read
-back by the Lua interpreter:
-the string is written between double quotes,
-and all double quotes, newlines, embedded zeros,
-and backslashes in the string
-are correctly escaped when written.
-For instance, the call
-
-<pre>
-     string.format('%q', 'a string with "quotes" and \n new line')
-</pre><p>
-will produce the string:
-
-<pre>
-     "a string with \"quotes\" and \
-      new line"
-</pre>
-
-<p>
-The options <code>c</code>, <code>d</code>, <code>E</code>, <code>e</code>, <code>f</code>,
-<code>g</code>, <code>G</code>, <code>i</code>, <code>o</code>, <code>u</code>, <code>X</code>, and <code>x</code> all
-expect a number as argument,
-whereas <code>q</code> and <code>s</code> expect a string.
-
-
-<p>
-This function does not accept string values
-containing embedded zeros,
-except as arguments to the <code>q</code> option.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.gmatch"><code>string.gmatch (s, pattern)</code></a></h3>
-Returns an iterator function that,
-each time it is called,
-returns the next captures from <code>pattern</code> over string <code>s</code>.
-If <code>pattern</code> specifies no captures,
-then the whole match is produced in each call.
-
-
-<p>
-As an example, the following loop
-
-<pre>
-     s = "hello world from Lua"
-     for w in string.gmatch(s, "%a+") do
-       print(w)
-     end
-</pre><p>
-will iterate over all the words from string <code>s</code>,
-printing one per line.
-The next example collects all pairs <code>key=value</code> from the
-given string into a table:
-
-<pre>
-     t = {}
-     s = "from=world, to=Lua"
-     for k, v in string.gmatch(s, "(%w+)=(%w+)") do
-       t[k] = v
-     end
-</pre>
-
-<p>
-For this function, a '<code>^</code>' at the start of a pattern does not
-work as an anchor, as this would prevent the iteration.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.gsub"><code>string.gsub (s, pattern, repl [, n])</code></a></h3>
-Returns a copy of <code>s</code>
-in which all (or the first <code>n</code>, if given)
-occurrences of the <code>pattern</code> have been
-replaced by a replacement string specified by <code>repl</code>,
-which can be a string, a table, or a function.
-<code>gsub</code> also returns, as its second value,
-the total number of matches that occurred.
-
-
-<p>
-If <code>repl</code> is a string, then its value is used for replacement.
-The character&nbsp;<code>%</code> works as an escape character:
-any sequence in <code>repl</code> of the form <code>%<em>n</em></code>,
-with <em>n</em> between 1 and 9,
-stands for the value of the <em>n</em>-th captured substring (see below).
-The sequence <code>%0</code> stands for the whole match.
-The sequence <code>%%</code> stands for a single&nbsp;<code>%</code>.
-
-
-<p>
-If <code>repl</code> is a table, then the table is queried for every match,
-using the first capture as the key;
-if the pattern specifies no captures,
-then the whole match is used as the key.
-
-
-<p>
-If <code>repl</code> is a function, then this function is called every time a
-match occurs, with all captured substrings passed as arguments,
-in order;
-if the pattern specifies no captures,
-then the whole match is passed as a sole argument.
-
-
-<p>
-If the value returned by the table query or by the function call
-is a string or a number,
-then it is used as the replacement string;
-otherwise, if it is <b>false</b> or <b>nil</b>,
-then there is no replacement
-(that is, the original match is kept in the string).
-
-
-<p>
-Here are some examples:
-
-<pre>
-     x = string.gsub("hello world", "(%w+)", "%1 %1")
-     --&gt; x="hello hello world world"
-     
-     x = string.gsub("hello world", "%w+", "%0 %0", 1)
-     --&gt; x="hello hello world"
-     
-     x = string.gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
-     --&gt; x="world hello Lua from"
-     
-     x = string.gsub("home = $HOME, user = $USER", "%$(%w+)", os.getenv)
-     --&gt; x="home = /home/roberto, user = roberto"
-     
-     x = string.gsub("4+5 = $return 4+5$", "%$(.-)%$", function (s)
-           return loadstring(s)()
-         end)
-     --&gt; x="4+5 = 9"
-     
-     local t = {name="lua", version="5.1"}
-     x = string.gsub("$name-$version.tar.gz", "%$(%w+)", t)
-     --&gt; x="lua-5.1.tar.gz"
-</pre>
-
-
-
-<p>
-<hr><h3><a name="pdf-string.len"><code>string.len (s)</code></a></h3>
-Receives a string and returns its length.
-The empty string <code>""</code> has length 0.
-Embedded zeros are counted,
-so <code>"a\000bc\000"</code> has length 5.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.lower"><code>string.lower (s)</code></a></h3>
-Receives a string and returns a copy of this string with all
-uppercase letters changed to lowercase.
-All other characters are left unchanged.
-The definition of what an uppercase letter is depends on the current locale.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.match"><code>string.match (s, pattern [, init])</code></a></h3>
-Looks for the first <em>match</em> of
-<code>pattern</code> in the string <code>s</code>.
-If it finds one, then <code>match</code> returns
-the captures from the pattern;
-otherwise it returns <b>nil</b>.
-If <code>pattern</code> specifies no captures,
-then the whole match is returned.
-A third, optional numerical argument <code>init</code> specifies
-where to start the search;
-its default value is&nbsp;1 and can be negative.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.rep"><code>string.rep (s, n)</code></a></h3>
-Returns a string that is the concatenation of <code>n</code> copies of
-the string <code>s</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.reverse"><code>string.reverse (s)</code></a></h3>
-Returns a string that is the string <code>s</code> reversed.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.sub"><code>string.sub (s, i [, j])</code></a></h3>
-Returns the substring of <code>s</code> that
-starts at <code>i</code>  and continues until <code>j</code>;
-<code>i</code> and <code>j</code> can be negative.
-If <code>j</code> is absent, then it is assumed to be equal to -1
-(which is the same as the string length).
-In particular,
-the call <code>string.sub(s,1,j)</code> returns a prefix of <code>s</code>
-with length <code>j</code>,
-and <code>string.sub(s, -i)</code> returns a suffix of <code>s</code>
-with length <code>i</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-string.upper"><code>string.upper (s)</code></a></h3>
-Receives a string and returns a copy of this string with all
-lowercase letters changed to uppercase.
-All other characters are left unchanged.
-The definition of what a lowercase letter is depends on the current locale.
-
-
-
-<h3>5.4.1 - <a name="5.4.1">Patterns</a></h3>
-
-
-<h4>Character Class:</h4><p>
-A <em>character class</em> is used to represent a set of characters.
-The following combinations are allowed in describing a character class:
-
-<ul>
-
-<li><b><em>x</em>:</b>
-(where <em>x</em> is not one of the <em>magic characters</em>
-<code>^$()%.[]*+-?</code>)
-represents the character <em>x</em> itself.
-</li>
-
-<li><b><code>.</code>:</b> (a dot) represents all characters.</li>
-
-<li><b><code>%a</code>:</b> represents all letters.</li>
-
-<li><b><code>%c</code>:</b> represents all control characters.</li>
-
-<li><b><code>%d</code>:</b> represents all digits.</li>
-
-<li><b><code>%l</code>:</b> represents all lowercase letters.</li>
-
-<li><b><code>%p</code>:</b> represents all punctuation characters.</li>
-
-<li><b><code>%s</code>:</b> represents all space characters.</li>
-
-<li><b><code>%u</code>:</b> represents all uppercase letters.</li>
-
-<li><b><code>%w</code>:</b> represents all alphanumeric characters.</li>
-
-<li><b><code>%x</code>:</b> represents all hexadecimal digits.</li>
-
-<li><b><code>%z</code>:</b> represents the character with representation 0.</li>
-
-<li><b><code>%<em>x</em></code>:</b> (where <em>x</em> is any non-alphanumeric character)
-represents the character <em>x</em>.
-This is the standard way to escape the magic characters.
-Any punctuation character (even the non magic)
-can be preceded by a '<code>%</code>'
-when used to represent itself in a pattern.
-</li>
-
-<li><b><code>[<em>set</em>]</code>:</b>
-represents the class which is the union of all
-characters in <em>set</em>.
-A range of characters can be specified by
-separating the end characters of the range with a '<code>-</code>'.
-All classes <code>%</code><em>x</em> described above can also be used as
-components in <em>set</em>.
-All other characters in <em>set</em> represent themselves.
-For example, <code>[%w_]</code> (or <code>[_%w]</code>)
-represents all alphanumeric characters plus the underscore,
-<code>[0-7]</code> represents the octal digits,
-and <code>[0-7%l%-]</code> represents the octal digits plus
-the lowercase letters plus the '<code>-</code>' character.
-
-
-<p>
-The interaction between ranges and classes is not defined.
-Therefore, patterns like <code>[%a-z]</code> or <code>[a-%%]</code>
-have no meaning.
-</li>
-
-<li><b><code>[^<em>set</em>]</code>:</b>
-represents the complement of <em>set</em>,
-where <em>set</em> is interpreted as above.
-</li>
-
-</ul><p>
-For all classes represented by single letters (<code>%a</code>, <code>%c</code>, etc.),
-the corresponding uppercase letter represents the complement of the class.
-For instance, <code>%S</code> represents all non-space characters.
-
-
-<p>
-The definitions of letter, space, and other character groups
-depend on the current locale.
-In particular, the class <code>[a-z]</code> may not be equivalent to <code>%l</code>.
-
-
-
-
-
-<h4>Pattern Item:</h4><p>
-A <em>pattern item</em> can be
-
-<ul>
-
-<li>
-a single character class,
-which matches any single character in the class;
-</li>
-
-<li>
-a single character class followed by '<code>*</code>',
-which matches 0 or more repetitions of characters in the class.
-These repetition items will always match the longest possible sequence;
-</li>
-
-<li>
-a single character class followed by '<code>+</code>',
-which matches 1 or more repetitions of characters in the class.
-These repetition items will always match the longest possible sequence;
-</li>
-
-<li>
-a single character class followed by '<code>-</code>',
-which also matches 0 or more repetitions of characters in the class.
-Unlike '<code>*</code>',
-these repetition items will always match the <em>shortest</em> possible sequence;
-</li>
-
-<li>
-a single character class followed by '<code>?</code>',
-which matches 0 or 1 occurrence of a character in the class;
-</li>
-
-<li>
-<code>%<em>n</em></code>, for <em>n</em> between 1 and 9;
-such item matches a substring equal to the <em>n</em>-th captured string
-(see below);
-</li>
-
-<li>
-<code>%b<em>xy</em></code>, where <em>x</em> and <em>y</em> are two distinct characters;
-such item matches strings that start with&nbsp;<em>x</em>, end with&nbsp;<em>y</em>,
-and where the <em>x</em> and <em>y</em> are <em>balanced</em>.
-This means that, if one reads the string from left to right,
-counting <em>+1</em> for an <em>x</em> and <em>-1</em> for a <em>y</em>,
-the ending <em>y</em> is the first <em>y</em> where the count reaches 0.
-For instance, the item <code>%b()</code> matches expressions with
-balanced parentheses.
-</li>
-
-</ul>
-
-
-
-
-<h4>Pattern:</h4><p>
-A <em>pattern</em> is a sequence of pattern items.
-A '<code>^</code>' at the beginning of a pattern anchors the match at the
-beginning of the subject string.
-A '<code>$</code>' at the end of a pattern anchors the match at the
-end of the subject string.
-At other positions,
-'<code>^</code>' and '<code>$</code>' have no special meaning and represent themselves.
-
-
-
-
-
-<h4>Captures:</h4><p>
-A pattern can contain sub-patterns enclosed in parentheses;
-they describe <em>captures</em>.
-When a match succeeds, the substrings of the subject string
-that match captures are stored (<em>captured</em>) for future use.
-Captures are numbered according to their left parentheses.
-For instance, in the pattern <code>"(a*(.)%w(%s*))"</code>,
-the part of the string matching <code>"a*(.)%w(%s*)"</code> is
-stored as the first capture (and therefore has number&nbsp;1);
-the character matching "<code>.</code>" is captured with number&nbsp;2,
-and the part matching "<code>%s*</code>" has number&nbsp;3.
-
-
-<p>
-As a special case, the empty capture <code>()</code> captures
-the current string position (a number).
-For instance, if we apply the pattern <code>"()aa()"</code> on the
-string <code>"flaaap"</code>, there will be two captures: 3&nbsp;and&nbsp;5.
-
-
-<p>
-A pattern cannot contain embedded zeros.  Use <code>%z</code> instead.
-
-
-
-
-
-
-
-
-
-
-
-<h2>5.5 - <a name="5.5">Table Manipulation</a></h2><p>
-This library provides generic functions for table manipulation.
-It provides all its functions inside the table <a name="pdf-table"><code>table</code></a>.
-
-
-<p>
-Most functions in the table library assume that the table
-represents an array or a list.
-For these functions, when we talk about the "length" of a table
-we mean the result of the length operator.
-
-
-<p>
-<hr><h3><a name="pdf-table.concat"><code>table.concat (table [, sep [, i [, j]]])</code></a></h3>
-Given an array where all elements are strings or numbers,
-returns <code>table[i]..sep..table[i+1] &middot;&middot;&middot; sep..table[j]</code>.
-The default value for <code>sep</code> is the empty string,
-the default for <code>i</code> is 1,
-and the default for <code>j</code> is the length of the table.
-If <code>i</code> is greater than <code>j</code>, returns the empty string.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-table.insert"><code>table.insert (table, [pos,] value)</code></a></h3>
-
-
-<p>
-Inserts element <code>value</code> at position <code>pos</code> in <code>table</code>,
-shifting up other elements to open space, if necessary.
-The default value for <code>pos</code> is <code>n+1</code>,
-where <code>n</code> is the length of the table (see <a href="#2.5.5">&sect;2.5.5</a>),
-so that a call <code>table.insert(t,x)</code> inserts <code>x</code> at the end
-of table <code>t</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-table.maxn"><code>table.maxn (table)</code></a></h3>
-
-
-<p>
-Returns the largest positive numerical index of the given table,
-or zero if the table has no positive numerical indices.
-(To do its job this function does a linear traversal of
-the whole table.) 
-
-
-
-
-<p>
-<hr><h3><a name="pdf-table.remove"><code>table.remove (table [, pos])</code></a></h3>
-
-
-<p>
-Removes from <code>table</code> the element at position <code>pos</code>,
-shifting down other elements to close the space, if necessary.
-Returns the value of the removed element.
-The default value for <code>pos</code> is <code>n</code>,
-where <code>n</code> is the length of the table,
-so that a call <code>table.remove(t)</code> removes the last element
-of table <code>t</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-table.sort"><code>table.sort (table [, comp])</code></a></h3>
-Sorts table elements in a given order, <em>in-place</em>,
-from <code>table[1]</code> to <code>table[n]</code>,
-where <code>n</code> is the length of the table.
-If <code>comp</code> is given,
-then it must be a function that receives two table elements,
-and returns true
-when the first is less than the second
-(so that <code>not comp(a[i+1],a[i])</code> will be true after the sort).
-If <code>comp</code> is not given,
-then the standard Lua operator <code>&lt;</code> is used instead.
-
-
-<p>
-The sort algorithm is not stable;
-that is, elements considered equal by the given order
-may have their relative positions changed by the sort.
-
-
-
-
-
-
-
-<h2>5.6 - <a name="5.6">Mathematical Functions</a></h2>
-
-<p>
-This library is an interface to the standard C&nbsp;math library.
-It provides all its functions inside the table <a name="pdf-math"><code>math</code></a>.
-
-
-<p>
-<hr><h3><a name="pdf-math.abs"><code>math.abs (x)</code></a></h3>
-
-
-<p>
-Returns the absolute value of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.acos"><code>math.acos (x)</code></a></h3>
-
-
-<p>
-Returns the arc cosine of <code>x</code> (in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.asin"><code>math.asin (x)</code></a></h3>
-
-
-<p>
-Returns the arc sine of <code>x</code> (in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.atan"><code>math.atan (x)</code></a></h3>
-
-
-<p>
-Returns the arc tangent of <code>x</code> (in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.atan2"><code>math.atan2 (y, x)</code></a></h3>
-
-
-<p>
-Returns the arc tangent of <code>y/x</code> (in radians),
-but uses the signs of both parameters to find the
-quadrant of the result.
-(It also handles correctly the case of <code>x</code> being zero.)
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.ceil"><code>math.ceil (x)</code></a></h3>
-
-
-<p>
-Returns the smallest integer larger than or equal to <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.cos"><code>math.cos (x)</code></a></h3>
-
-
-<p>
-Returns the cosine of <code>x</code> (assumed to be in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.cosh"><code>math.cosh (x)</code></a></h3>
-
-
-<p>
-Returns the hyperbolic cosine of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.deg"><code>math.deg (x)</code></a></h3>
-
-
-<p>
-Returns the angle <code>x</code> (given in radians) in degrees.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.exp"><code>math.exp (x)</code></a></h3>
-
-
-<p>
-Returns the value <em>e<sup>x</sup></em>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.floor"><code>math.floor (x)</code></a></h3>
-
-
-<p>
-Returns the largest integer smaller than or equal to <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.fmod"><code>math.fmod (x, y)</code></a></h3>
-
-
-<p>
-Returns the remainder of the division of <code>x</code> by <code>y</code>
-that rounds the quotient towards zero.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.frexp"><code>math.frexp (x)</code></a></h3>
-
-
-<p>
-Returns <code>m</code> and <code>e</code> such that <em>x = m2<sup>e</sup></em>,
-<code>e</code> is an integer and the absolute value of <code>m</code> is
-in the range <em>[0.5, 1)</em>
-(or zero when <code>x</code> is zero).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.huge"><code>math.huge</code></a></h3>
-
-
-<p>
-The value <code>HUGE_VAL</code>,
-a value larger than or equal to any other numerical value.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.ldexp"><code>math.ldexp (m, e)</code></a></h3>
-
-
-<p>
-Returns <em>m2<sup>e</sup></em> (<code>e</code> should be an integer).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.log"><code>math.log (x)</code></a></h3>
-
-
-<p>
-Returns the natural logarithm of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.log10"><code>math.log10 (x)</code></a></h3>
-
-
-<p>
-Returns the base-10 logarithm of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.max"><code>math.max (x, &middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Returns the maximum value among its arguments.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.min"><code>math.min (x, &middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Returns the minimum value among its arguments.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.modf"><code>math.modf (x)</code></a></h3>
-
-
-<p>
-Returns two numbers,
-the integral part of <code>x</code> and the fractional part of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.pi"><code>math.pi</code></a></h3>
-
-
-<p>
-The value of <em>pi</em>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.pow"><code>math.pow (x, y)</code></a></h3>
-
-
-<p>
-Returns <em>x<sup>y</sup></em>.
-(You can also use the expression <code>x^y</code> to compute this value.)
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.rad"><code>math.rad (x)</code></a></h3>
-
-
-<p>
-Returns the angle <code>x</code> (given in degrees) in radians.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.random"><code>math.random ([m [, n]])</code></a></h3>
-
-
-<p>
-This function is an interface to the simple
-pseudo-random generator function <code>rand</code> provided by ANSI&nbsp;C.
-(No guarantees can be given for its statistical properties.)
-
-
-<p>
-When called without arguments,
-returns a uniform pseudo-random real number
-in the range <em>[0,1)</em>.  
-When called with an integer number <code>m</code>,
-<code>math.random</code> returns
-a uniform pseudo-random integer in the range <em>[1, m]</em>.
-When called with two integer numbers <code>m</code> and <code>n</code>,
-<code>math.random</code> returns a uniform pseudo-random
-integer in the range <em>[m, n]</em>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.randomseed"><code>math.randomseed (x)</code></a></h3>
-
-
-<p>
-Sets <code>x</code> as the "seed"
-for the pseudo-random generator:
-equal seeds produce equal sequences of numbers.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.sin"><code>math.sin (x)</code></a></h3>
-
-
-<p>
-Returns the sine of <code>x</code> (assumed to be in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.sinh"><code>math.sinh (x)</code></a></h3>
-
-
-<p>
-Returns the hyperbolic sine of <code>x</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.sqrt"><code>math.sqrt (x)</code></a></h3>
-
-
-<p>
-Returns the square root of <code>x</code>.
-(You can also use the expression <code>x^0.5</code> to compute this value.)
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.tan"><code>math.tan (x)</code></a></h3>
-
-
-<p>
-Returns the tangent of <code>x</code> (assumed to be in radians).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-math.tanh"><code>math.tanh (x)</code></a></h3>
-
-
-<p>
-Returns the hyperbolic tangent of <code>x</code>.
-
-
-
-
-
-
-
-<h2>5.7 - <a name="5.7">Input and Output Facilities</a></h2>
-
-<p>
-The I/O library provides two different styles for file manipulation.
-The first one uses implicit file descriptors;
-that is, there are operations to set a default input file and a
-default output file,
-and all input/output operations are over these default files.
-The second style uses explicit file descriptors.
-
-
-<p>
-When using implicit file descriptors,
-all operations are supplied by table <a name="pdf-io"><code>io</code></a>.
-When using explicit file descriptors,
-the operation <a href="#pdf-io.open"><code>io.open</code></a> returns a file descriptor
-and then all operations are supplied as methods of the file descriptor.
-
-
-<p>
-The table <code>io</code> also provides
-three predefined file descriptors with their usual meanings from C:
-<a name="pdf-io.stdin"><code>io.stdin</code></a>, <a name="pdf-io.stdout"><code>io.stdout</code></a>, and <a name="pdf-io.stderr"><code>io.stderr</code></a>.
-The I/O library never closes these files.
-
-
-<p>
-Unless otherwise stated,
-all I/O functions return <b>nil</b> on failure
-(plus an error message as a second result and
-a system-dependent error code as a third result)
-and some value different from <b>nil</b> on success.
-
-
-<p>
-<hr><h3><a name="pdf-io.close"><code>io.close ([file])</code></a></h3>
-
-
-<p>
-Equivalent to <code>file:close()</code>.
-Without a <code>file</code>, closes the default output file.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.flush"><code>io.flush ()</code></a></h3>
-
-
-<p>
-Equivalent to <code>file:flush</code> over the default output file.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.input"><code>io.input ([file])</code></a></h3>
-
-
-<p>
-When called with a file name, it opens the named file (in text mode),
-and sets its handle as the default input file.
-When called with a file handle,
-it simply sets this file handle as the default input file.
-When called without parameters,
-it returns the current default input file.
-
-
-<p>
-In case of errors this function raises the error,
-instead of returning an error code.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.lines"><code>io.lines ([filename])</code></a></h3>
-
-
-<p>
-Opens the given file name in read mode
-and returns an iterator function that,
-each time it is called,
-returns a new line from the file.
-Therefore, the construction
-
-<pre>
-     for line in io.lines(filename) do <em>body</em> end
-</pre><p>
-will iterate over all lines of the file.
-When the iterator function detects the end of file,
-it returns <b>nil</b> (to finish the loop) and automatically closes the file.
-
-
-<p>
-The call <code>io.lines()</code> (with no file name) is equivalent
-to <code>io.input():lines()</code>;
-that is, it iterates over the lines of the default input file.
-In this case it does not close the file when the loop ends.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.open"><code>io.open (filename [, mode])</code></a></h3>
-
-
-<p>
-This function opens a file,
-in the mode specified in the string <code>mode</code>.
-It returns a new file handle,
-or, in case of errors, <b>nil</b> plus an error message.
-
-
-<p>
-The <code>mode</code> string can be any of the following:
-
-<ul>
-<li><b>"r":</b> read mode (the default);</li>
-<li><b>"w":</b> write mode;</li>
-<li><b>"a":</b> append mode;</li>
-<li><b>"r+":</b> update mode, all previous data is preserved;</li>
-<li><b>"w+":</b> update mode, all previous data is erased;</li>
-<li><b>"a+":</b> append update mode, previous data is preserved,
-  writing is only allowed at the end of file.</li>
-</ul><p>
-The <code>mode</code> string can also have a '<code>b</code>' at the end,
-which is needed in some systems to open the file in binary mode.
-This string is exactly what is used in the
-standard&nbsp;C function <code>fopen</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.output"><code>io.output ([file])</code></a></h3>
-
-
-<p>
-Similar to <a href="#pdf-io.input"><code>io.input</code></a>, but operates over the default output file.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.popen"><code>io.popen (prog [, mode])</code></a></h3>
-
-
-<p>
-Starts program <code>prog</code> in a separated process and returns
-a file handle that you can use to read data from this program
-(if <code>mode</code> is <code>"r"</code>, the default)
-or to write data to this program
-(if <code>mode</code> is <code>"w"</code>).
-
-
-<p>
-This function is system dependent and is not available
-on all platforms.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.read"><code>io.read (&middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Equivalent to <code>io.input():read</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.tmpfile"><code>io.tmpfile ()</code></a></h3>
-
-
-<p>
-Returns a handle for a temporary file.
-This file is opened in update mode
-and it is automatically removed when the program ends.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.type"><code>io.type (obj)</code></a></h3>
-
-
-<p>
-Checks whether <code>obj</code> is a valid file handle.
-Returns the string <code>"file"</code> if <code>obj</code> is an open file handle,
-<code>"closed file"</code> if <code>obj</code> is a closed file handle,
-or <b>nil</b> if <code>obj</code> is not a file handle.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-io.write"><code>io.write (&middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Equivalent to <code>io.output():write</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:close"><code>file:close ()</code></a></h3>
-
-
-<p>
-Closes <code>file</code>.
-Note that files are automatically closed when
-their handles are garbage collected,
-but that takes an unpredictable amount of time to happen.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:flush"><code>file:flush ()</code></a></h3>
-
-
-<p>
-Saves any written data to <code>file</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:lines"><code>file:lines ()</code></a></h3>
-
-
-<p>
-Returns an iterator function that,
-each time it is called,
-returns a new line from the file.
-Therefore, the construction
-
-<pre>
-     for line in file:lines() do <em>body</em> end
-</pre><p>
-will iterate over all lines of the file.
-(Unlike <a href="#pdf-io.lines"><code>io.lines</code></a>, this function does not close the file
-when the loop ends.)
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:read"><code>file:read (&middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Reads the file <code>file</code>,
-according to the given formats, which specify what to read.
-For each format,
-the function returns a string (or a number) with the characters read,
-or <b>nil</b> if it cannot read data with the specified format.
-When called without formats,
-it uses a default format that reads the entire next line
-(see below).
-
-
-<p>
-The available formats are
-
-<ul>
-
-<li><b>"*n":</b>
-reads a number;
-this is the only format that returns a number instead of a string.
-</li>
-
-<li><b>"*a":</b>
-reads the whole file, starting at the current position.
-On end of file, it returns the empty string.
-</li>
-
-<li><b>"*l":</b>
-reads the next line (skipping the end of line),
-returning <b>nil</b> on end of file.
-This is the default format.
-</li>
-
-<li><b><em>number</em>:</b>
-reads a string with up to this number of characters,
-returning <b>nil</b> on end of file.
-If number is zero,
-it reads nothing and returns an empty string,
-or <b>nil</b> on end of file.
-</li>
-
-</ul>
-
-
-
-<p>
-<hr><h3><a name="pdf-file:seek"><code>file:seek ([whence] [, offset])</code></a></h3>
-
-
-<p>
-Sets and gets the file position,
-measured from the beginning of the file,
-to the position given by <code>offset</code> plus a base
-specified by the string <code>whence</code>, as follows:
-
-<ul>
-<li><b>"set":</b> base is position 0 (beginning of the file);</li>
-<li><b>"cur":</b> base is current position;</li>
-<li><b>"end":</b> base is end of file;</li>
-</ul><p>
-In case of success, function <code>seek</code> returns the final file position,
-measured in bytes from the beginning of the file.
-If this function fails, it returns <b>nil</b>,
-plus a string describing the error.
-
-
-<p>
-The default value for <code>whence</code> is <code>"cur"</code>,
-and for <code>offset</code> is 0.
-Therefore, the call <code>file:seek()</code> returns the current
-file position, without changing it;
-the call <code>file:seek("set")</code> sets the position to the
-beginning of the file (and returns 0);
-and the call <code>file:seek("end")</code> sets the position to the
-end of the file, and returns its size.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:setvbuf"><code>file:setvbuf (mode [, size])</code></a></h3>
-
-
-<p>
-Sets the buffering mode for an output file.
-There are three available modes:
-
-<ul>
-
-<li><b>"no":</b>
-no buffering; the result of any output operation appears immediately.
-</li>
-
-<li><b>"full":</b>
-full buffering; output operation is performed only
-when the buffer is full (or when you explicitly <code>flush</code> the file
-(see <a href="#pdf-io.flush"><code>io.flush</code></a>)).
-</li>
-
-<li><b>"line":</b>
-line buffering; output is buffered until a newline is output
-or there is any input from some special files
-(such as a terminal device).
-</li>
-
-</ul><p>
-For the last two cases, <code>size</code>
-specifies the size of the buffer, in bytes.
-The default is an appropriate size.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-file:write"><code>file:write (&middot;&middot;&middot;)</code></a></h3>
-
-
-<p>
-Writes the value of each of its arguments to
-the <code>file</code>.
-The arguments must be strings or numbers.
-To write other values,
-use <a href="#pdf-tostring"><code>tostring</code></a> or <a href="#pdf-string.format"><code>string.format</code></a> before <code>write</code>.
-
-
-
-
-
-
-
-<h2>5.8 - <a name="5.8">Operating System Facilities</a></h2>
-
-<p>
-This library is implemented through table <a name="pdf-os"><code>os</code></a>.
-
-
-<p>
-<hr><h3><a name="pdf-os.clock"><code>os.clock ()</code></a></h3>
-
-
-<p>
-Returns an approximation of the amount in seconds of CPU time
-used by the program.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.date"><code>os.date ([format [, time]])</code></a></h3>
-
-
-<p>
-Returns a string or a table containing date and time,
-formatted according to the given string <code>format</code>.
-
-
-<p>
-If the <code>time</code> argument is present,
-this is the time to be formatted
-(see the <a href="#pdf-os.time"><code>os.time</code></a> function for a description of this value).
-Otherwise, <code>date</code> formats the current time.
-
-
-<p>
-If <code>format</code> starts with '<code>!</code>',
-then the date is formatted in Coordinated Universal Time.
-After this optional character,
-if <code>format</code> is the string "<code>*t</code>",
-then <code>date</code> returns a table with the following fields:
-<code>year</code> (four digits), <code>month</code> (1--12), <code>day</code> (1--31),
-<code>hour</code> (0--23), <code>min</code> (0--59), <code>sec</code> (0--61),
-<code>wday</code> (weekday, Sunday is&nbsp;1),
-<code>yday</code> (day of the year),
-and <code>isdst</code> (daylight saving flag, a boolean).
-
-
-<p>
-If <code>format</code> is not "<code>*t</code>",
-then <code>date</code> returns the date as a string,
-formatted according to the same rules as the C&nbsp;function <code>strftime</code>.
-
-
-<p>
-When called without arguments,
-<code>date</code> returns a reasonable date and time representation that depends on
-the host system and on the current locale
-(that is, <code>os.date()</code> is equivalent to <code>os.date("%c")</code>).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.difftime"><code>os.difftime (t2, t1)</code></a></h3>
-
-
-<p>
-Returns the number of seconds from time <code>t1</code> to time <code>t2</code>.
-In POSIX, Windows, and some other systems,
-this value is exactly <code>t2</code><em>-</em><code>t1</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.execute"><code>os.execute ([command])</code></a></h3>
-
-
-<p>
-This function is equivalent to the C&nbsp;function <code>system</code>.
-It passes <code>command</code> to be executed by an operating system shell.
-It returns a status code, which is system-dependent.
-If <code>command</code> is absent, then it returns nonzero if a shell is available
-and zero otherwise.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.exit"><code>os.exit ([code])</code></a></h3>
-
-
-<p>
-Calls the C&nbsp;function <code>exit</code>,
-with an optional <code>code</code>,
-to terminate the host program.
-The default value for <code>code</code> is the success code.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.getenv"><code>os.getenv (varname)</code></a></h3>
-
-
-<p>
-Returns the value of the process environment variable <code>varname</code>,
-or <b>nil</b> if the variable is not defined.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.remove"><code>os.remove (filename)</code></a></h3>
-
-
-<p>
-Deletes the file or directory with the given name.
-Directories must be empty to be removed.
-If this function fails, it returns <b>nil</b>,
-plus a string describing the error.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.rename"><code>os.rename (oldname, newname)</code></a></h3>
-
-
-<p>
-Renames file or directory named <code>oldname</code> to <code>newname</code>.
-If this function fails, it returns <b>nil</b>,
-plus a string describing the error.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.setlocale"><code>os.setlocale (locale [, category])</code></a></h3>
-
-
-<p>
-Sets the current locale of the program.
-<code>locale</code> is a string specifying a locale;
-<code>category</code> is an optional string describing which category to change:
-<code>"all"</code>, <code>"collate"</code>, <code>"ctype"</code>,
-<code>"monetary"</code>, <code>"numeric"</code>, or <code>"time"</code>;
-the default category is <code>"all"</code>.
-The function returns the name of the new locale,
-or <b>nil</b> if the request cannot be honored.
-
-
-<p>
-If <code>locale</code> is the empty string,
-the current locale is set to an implementation-defined native locale.
-If <code>locale</code> is the string "<code>C</code>",
-the current locale is set to the standard C locale.
-
-
-<p>
-When called with <b>nil</b> as the first argument,
-this function only returns the name of the current locale
-for the given category.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.time"><code>os.time ([table])</code></a></h3>
-
-
-<p>
-Returns the current time when called without arguments,
-or a time representing the date and time specified by the given table.
-This table must have fields <code>year</code>, <code>month</code>, and <code>day</code>,
-and may have fields <code>hour</code>, <code>min</code>, <code>sec</code>, and <code>isdst</code>
-(for a description of these fields, see the <a href="#pdf-os.date"><code>os.date</code></a> function).
-
-
-<p>
-The returned value is a number, whose meaning depends on your system.
-In POSIX, Windows, and some other systems, this number counts the number
-of seconds since some given start time (the "epoch").
-In other systems, the meaning is not specified,
-and the number returned by <code>time</code> can be used only as an argument to
-<code>date</code> and <code>difftime</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-os.tmpname"><code>os.tmpname ()</code></a></h3>
-
-
-<p>
-Returns a string with a file name that can
-be used for a temporary file.
-The file must be explicitly opened before its use
-and explicitly removed when no longer needed.
-
-
-<p>
-On some systems (POSIX),
-this function also creates a file with that name,
-to avoid security risks.
-(Someone else might create the file with wrong permissions
-in the time between getting the name and creating the file.)
-You still have to open the file to use it
-and to remove it (even if you do not use it).
-
-
-<p>
-When possible,
-you may prefer to use <a href="#pdf-io.tmpfile"><code>io.tmpfile</code></a>,
-which automatically removes the file when the program ends.
-
-
-
-
-
-
-
-<h2>5.9 - <a name="5.9">The Debug Library</a></h2>
-
-<p>
-This library provides
-the functionality of the debug interface to Lua programs.
-You should exert care when using this library.
-The functions provided here should be used exclusively for debugging
-and similar tasks, such as profiling.
-Please resist the temptation to use them as a
-usual programming tool:
-they can be very slow.
-Moreover, several of these functions
-violate some assumptions about Lua code
-(e.g., that variables local to a function
-cannot be accessed from outside or
-that userdata metatables cannot be changed by Lua code)
-and therefore can compromise otherwise secure code.
-
-
-<p>
-All functions in this library are provided
-inside the <a name="pdf-debug"><code>debug</code></a> table.
-All functions that operate over a thread
-have an optional first argument which is the
-thread to operate over.
-The default is always the current thread.
-
-
-<p>
-<hr><h3><a name="pdf-debug.debug"><code>debug.debug ()</code></a></h3>
-
-
-<p>
-Enters an interactive mode with the user,
-running each string that the user enters.
-Using simple commands and other debug facilities,
-the user can inspect global and local variables,
-change their values, evaluate expressions, and so on.
-A line containing only the word <code>cont</code> finishes this function,
-so that the caller continues its execution.
-
-
-<p>
-Note that commands for <code>debug.debug</code> are not lexically nested
-within any function, and so have no direct access to local variables.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getfenv"><code>debug.getfenv (o)</code></a></h3>
-Returns the environment of object <code>o</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.gethook"><code>debug.gethook ([thread])</code></a></h3>
-
-
-<p>
-Returns the current hook settings of the thread, as three values:
-the current hook function, the current hook mask,
-and the current hook count
-(as set by the <a href="#pdf-debug.sethook"><code>debug.sethook</code></a> function).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getinfo"><code>debug.getinfo ([thread,] function [, what])</code></a></h3>
-
-
-<p>
-Returns a table with information about a function.
-You can give the function directly,
-or you can give a number as the value of <code>function</code>,
-which means the function running at level <code>function</code> of the call stack
-of the given thread:
-level&nbsp;0 is the current function (<code>getinfo</code> itself);
-level&nbsp;1 is the function that called <code>getinfo</code>;
-and so on.
-If <code>function</code> is a number larger than the number of active functions,
-then <code>getinfo</code> returns <b>nil</b>.
-
-
-<p>
-The returned table can contain all the fields returned by <a href="#lua_getinfo"><code>lua_getinfo</code></a>,
-with the string <code>what</code> describing which fields to fill in.
-The default for <code>what</code> is to get all information available,
-except the table of valid lines.
-If present,
-the option '<code>f</code>'
-adds a field named <code>func</code> with the function itself.
-If present,
-the option '<code>L</code>'
-adds a field named <code>activelines</code> with the table of
-valid lines.
-
-
-<p>
-For instance, the expression <code>debug.getinfo(1,"n").name</code> returns
-a table with a name for the current function,
-if a reasonable name can be found,
-and the expression <code>debug.getinfo(print)</code>
-returns a table with all available information
-about the <a href="#pdf-print"><code>print</code></a> function.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getlocal"><code>debug.getlocal ([thread,] level, local)</code></a></h3>
-
-
-<p>
-This function returns the name and the value of the local variable
-with index <code>local</code> of the function at level <code>level</code> of the stack.
-(The first parameter or local variable has index&nbsp;1, and so on,
-until the last active local variable.)
-The function returns <b>nil</b> if there is no local
-variable with the given index,
-and raises an error when called with a <code>level</code> out of range.
-(You can call <a href="#pdf-debug.getinfo"><code>debug.getinfo</code></a> to check whether the level is valid.)
-
-
-<p>
-Variable names starting with '<code>(</code>' (open parentheses)
-represent internal variables
-(loop control variables, temporaries, and C&nbsp;function locals).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getmetatable"><code>debug.getmetatable (object)</code></a></h3>
-
-
-<p>
-Returns the metatable of the given <code>object</code>
-or <b>nil</b> if it does not have a metatable.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getregistry"><code>debug.getregistry ()</code></a></h3>
-
-
-<p>
-Returns the registry table (see <a href="#3.5">&sect;3.5</a>).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.getupvalue"><code>debug.getupvalue (func, up)</code></a></h3>
-
-
-<p>
-This function returns the name and the value of the upvalue
-with index <code>up</code> of the function <code>func</code>.
-The function returns <b>nil</b> if there is no upvalue with the given index.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.setfenv"><code>debug.setfenv (object, table)</code></a></h3>
-
-
-<p>
-Sets the environment of the given <code>object</code> to the given <code>table</code>.
-Returns <code>object</code>.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.sethook"><code>debug.sethook ([thread,] hook, mask [, count])</code></a></h3>
-
-
-<p>
-Sets the given function as a hook.
-The string <code>mask</code> and the number <code>count</code> describe
-when the hook will be called.
-The string mask may have the following characters,
-with the given meaning:
-
-<ul>
-<li><b><code>"c"</code>:</b> the hook is called every time Lua calls a function;</li>
-<li><b><code>"r"</code>:</b> the hook is called every time Lua returns from a function;</li>
-<li><b><code>"l"</code>:</b> the hook is called every time Lua enters a new line of code.</li>
-</ul><p>
-With a <code>count</code> different from zero,
-the hook is called after every <code>count</code> instructions.
-
-
-<p>
-When called without arguments,
-<a href="#pdf-debug.sethook"><code>debug.sethook</code></a> turns off the hook.
-
-
-<p>
-When the hook is called, its first parameter is a string
-describing the event that has triggered its call:
-<code>"call"</code>, <code>"return"</code> (or <code>"tail return"</code>,
-when simulating a return from a tail call),
-<code>"line"</code>, and <code>"count"</code>.
-For line events,
-the hook also gets the new line number as its second parameter.
-Inside a hook,
-you can call <code>getinfo</code> with level&nbsp;2 to get more information about
-the running function
-(level&nbsp;0 is the <code>getinfo</code> function,
-and level&nbsp;1 is the hook function),
-unless the event is <code>"tail return"</code>.
-In this case, Lua is only simulating the return,
-and a call to <code>getinfo</code> will return invalid data.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.setlocal"><code>debug.setlocal ([thread,] level, local, value)</code></a></h3>
-
-
-<p>
-This function assigns the value <code>value</code> to the local variable
-with index <code>local</code> of the function at level <code>level</code> of the stack.
-The function returns <b>nil</b> if there is no local
-variable with the given index,
-and raises an error when called with a <code>level</code> out of range.
-(You can call <code>getinfo</code> to check whether the level is valid.)
-Otherwise, it returns the name of the local variable.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.setmetatable"><code>debug.setmetatable (object, table)</code></a></h3>
-
-
-<p>
-Sets the metatable for the given <code>object</code> to the given <code>table</code>
-(which can be <b>nil</b>).
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.setupvalue"><code>debug.setupvalue (func, up, value)</code></a></h3>
-
-
-<p>
-This function assigns the value <code>value</code> to the upvalue
-with index <code>up</code> of the function <code>func</code>.
-The function returns <b>nil</b> if there is no upvalue
-with the given index.
-Otherwise, it returns the name of the upvalue.
-
-
-
-
-<p>
-<hr><h3><a name="pdf-debug.traceback"><code>debug.traceback ([thread,] [message [, level]])</code></a></h3>
-
-
-<p>
-Returns a string with a traceback of the call stack.
-An optional <code>message</code> string is appended
-at the beginning of the traceback.
-An optional <code>level</code> number tells at which level
-to start the traceback
-(default is 1, the function calling <code>traceback</code>).
-
-
-
-
-
-
-
-<h1>6 - <a name="6">Lua Stand-alone</a></h1>
-
-<p>
-Although Lua has been designed as an extension language,
-to be embedded in a host C&nbsp;program,
-it is also frequently used as a stand-alone language.
-An interpreter for Lua as a stand-alone language,
-called simply <code>lua</code>,
-is provided with the standard distribution.
-The stand-alone interpreter includes
-all standard libraries, including the debug library.
-Its usage is:
-
-<pre>
-     lua [options] [script [args]]
-</pre><p>
-The options are:
-
-<ul>
-<li><b><code>-e <em>stat</em></code>:</b> executes string <em>stat</em>;</li>
-<li><b><code>-l <em>mod</em></code>:</b> "requires" <em>mod</em>;</li>
-<li><b><code>-i</code>:</b> enters interactive mode after running <em>script</em>;</li>
-<li><b><code>-v</code>:</b> prints version information;</li>
-<li><b><code>--</code>:</b> stops handling options;</li>
-<li><b><code>-</code>:</b> executes <code>stdin</code> as a file and stops handling options.</li>
-</ul><p>
-After handling its options, <code>lua</code> runs the given <em>script</em>,
-passing to it the given <em>args</em> as string arguments.
-When called without arguments,
-<code>lua</code> behaves as <code>lua -v -i</code>
-when the standard input (<code>stdin</code>) is a terminal,
-and as <code>lua -</code> otherwise.
-
-
-<p>
-Before running any argument,
-the interpreter checks for an environment variable <a name="pdf-LUA_INIT"><code>LUA_INIT</code></a>.
-If its format is <code>@<em>filename</em></code>,
-then <code>lua</code> executes the file.
-Otherwise, <code>lua</code> executes the string itself.
-
-
-<p>
-All options are handled in order, except <code>-i</code>.
-For instance, an invocation like
-
-<pre>
-     $ lua -e'a=1' -e 'print(a)' script.lua
-</pre><p>
-will first set <code>a</code> to 1, then print the value of <code>a</code> (which is '<code>1</code>'),
-and finally run the file <code>script.lua</code> with no arguments.
-(Here <code>$</code> is the shell prompt. Your prompt may be different.)
-
-
-<p>
-Before starting to run the script,
-<code>lua</code> collects all arguments in the command line
-in a global table called <code>arg</code>.
-The script name is stored at index 0,
-the first argument after the script name goes to index 1,
-and so on.
-Any arguments before the script name
-(that is, the interpreter name plus the options)
-go to negative indices.
-For instance, in the call
-
-<pre>
-     $ lua -la b.lua t1 t2
-</pre><p>
-the interpreter first runs the file <code>a.lua</code>,
-then creates a table
-
-<pre>
-     arg = { [-2] = "lua", [-1] = "-la",
-             [0] = "b.lua",
-             [1] = "t1", [2] = "t2" }
-</pre><p>
-and finally runs the file <code>b.lua</code>.
-The script is called with <code>arg[1]</code>, <code>arg[2]</code>, &middot;&middot;&middot;
-as arguments;
-it can also access these arguments with the vararg expression '<code>...</code>'.
-
-
-<p>
-In interactive mode,
-if you write an incomplete statement,
-the interpreter waits for its completion
-by issuing a different prompt.
-
-
-<p>
-If the global variable <a name="pdf-_PROMPT"><code>_PROMPT</code></a> contains a string,
-then its value is used as the prompt.
-Similarly, if the global variable <a name="pdf-_PROMPT2"><code>_PROMPT2</code></a> contains a string,
-its value is used as the secondary prompt
-(issued during incomplete statements).
-Therefore, both prompts can be changed directly on the command line
-or in any Lua programs by assigning to <code>_PROMPT</code>.
-See the next example:
-
-<pre>
-     $ lua -e"_PROMPT='myprompt&gt; '" -i
-</pre><p>
-(The outer pair of quotes is for the shell,
-the inner pair is for Lua.)
-Note the use of <code>-i</code> to enter interactive mode;
-otherwise,
-the program would just end silently
-right after the assignment to <code>_PROMPT</code>.
-
-
-<p>
-To allow the use of Lua as a
-script interpreter in Unix systems,
-the stand-alone interpreter skips
-the first line of a chunk if it starts with <code>#</code>.
-Therefore, Lua scripts can be made into executable programs
-by using <code>chmod +x</code> and the&nbsp;<code>#!</code> form,
-as in
-
-<pre>
-     #!/usr/local/bin/lua
-</pre><p>
-(Of course,
-the location of the Lua interpreter may be different in your machine.
-If <code>lua</code> is in your <code>PATH</code>,
-then 
-
-<pre>
-     #!/usr/bin/env lua
-</pre><p>
-is a more portable solution.) 
-
-
-
-<h1>7 - <a name="7">Incompatibilities with the Previous Version</a></h1>
-
-<p>
-Here we list the incompatibilities that you may find when moving a program
-from Lua&nbsp;5.0 to Lua&nbsp;5.1.
-You can avoid most of the incompatibilities compiling Lua with
-appropriate options (see file <code>luaconf.h</code>).
-However,
-all these compatibility options will be removed in the next version of Lua.
-
-
-
-<h2>7.1 - <a name="7.1">Changes in the Language</a></h2>
-<ul>
-
-<li>
-The vararg system changed from the pseudo-argument <code>arg</code> with a
-table with the extra arguments to the vararg expression.
-(See compile-time option <code>LUA_COMPAT_VARARG</code> in <code>luaconf.h</code>.)
-</li>
-
-<li>
-There was a subtle change in the scope of the implicit
-variables of the <b>for</b> statement and for the <b>repeat</b> statement.
-</li>
-
-<li>
-The long string/long comment syntax (<code>[[<em>string</em>]]</code>)
-does not allow nesting.
-You can use the new syntax (<code>[=[<em>string</em>]=]</code>) in these cases.
-(See compile-time option <code>LUA_COMPAT_LSTR</code> in <code>luaconf.h</code>.)
-</li>
-
-</ul>
-
-
-
-
-<h2>7.2 - <a name="7.2">Changes in the Libraries</a></h2>
-<ul>
-
-<li>
-Function <code>string.gfind</code> was renamed <a href="#pdf-string.gmatch"><code>string.gmatch</code></a>.
-(See compile-time option <code>LUA_COMPAT_GFIND</code> in <code>luaconf.h</code>.)
-</li>
-
-<li>
-When <a href="#pdf-string.gsub"><code>string.gsub</code></a> is called with a function as its
-third argument,
-whenever this function returns <b>nil</b> or <b>false</b> the
-replacement string is the whole match,
-instead of the empty string.
-</li>
-
-<li>
-Function <code>table.setn</code> was deprecated.
-Function <code>table.getn</code> corresponds
-to the new length operator (<code>#</code>);
-use the operator instead of the function.
-(See compile-time option <code>LUA_COMPAT_GETN</code> in <code>luaconf.h</code>.)
-</li>
-
-<li>
-Function <code>loadlib</code> was renamed <a href="#pdf-package.loadlib"><code>package.loadlib</code></a>.
-(See compile-time option <code>LUA_COMPAT_LOADLIB</code> in <code>luaconf.h</code>.)
-</li>
-
-<li>
-Function <code>math.mod</code> was renamed <a href="#pdf-math.fmod"><code>math.fmod</code></a>.
-(See compile-time option <code>LUA_COMPAT_MOD</code> in <code>luaconf.h</code>.)
-</li>
-
-<li>
-Functions <code>table.foreach</code> and <code>table.foreachi</code> are deprecated.
-You can use a for loop with <code>pairs</code> or <code>ipairs</code> instead.
-</li>
-
-<li>
-There were substantial changes in function <a href="#pdf-require"><code>require</code></a> due to
-the new module system.
-However, the new behavior is mostly compatible with the old,
-but <code>require</code> gets the path from <a href="#pdf-package.path"><code>package.path</code></a> instead
-of from <code>LUA_PATH</code>.
-</li>
-
-<li>
-Function <a href="#pdf-collectgarbage"><code>collectgarbage</code></a> has different arguments.
-Function <code>gcinfo</code> is deprecated;
-use <code>collectgarbage("count")</code> instead.
-</li>
-
-</ul>
-
-
-
-
-<h2>7.3 - <a name="7.3">Changes in the API</a></h2>
-<ul>
-
-<li>
-The <code>luaopen_*</code> functions (to open libraries)
-cannot be called directly,
-like a regular C function.
-They must be called through Lua,
-like a Lua function.
-</li>
-
-<li>
-Function <code>lua_open</code> was replaced by <a href="#lua_newstate"><code>lua_newstate</code></a> to
-allow the user to set a memory-allocation function.
-You can use <a href="#luaL_newstate"><code>luaL_newstate</code></a> from the standard library to
-create a state with a standard allocation function
-(based on <code>realloc</code>).
-</li>
-
-<li>
-Functions <code>luaL_getn</code> and <code>luaL_setn</code>
-(from the auxiliary library) are deprecated.
-Use <a href="#lua_objlen"><code>lua_objlen</code></a> instead of <code>luaL_getn</code>
-and nothing instead of <code>luaL_setn</code>.
-</li>
-
-<li>
-Function <code>luaL_openlib</code> was replaced by <a href="#luaL_register"><code>luaL_register</code></a>.
-</li>
-
-<li>
-Function <code>luaL_checkudata</code> now throws an error when the given value
-is not a userdata of the expected type.
-(In Lua&nbsp;5.0 it returned <code>NULL</code>.)
-</li>
-
-</ul>
-
-
-
-
-<h1>8 - <a name="8">The Complete Syntax of Lua</a></h1>
-
-<p>
-Here is the complete syntax of Lua in extended BNF.
-(It does not describe operator precedences.)
-
-
-
-
-<pre>
-
-	chunk ::= {stat [`<b>;</b>&acute;]} [laststat [`<b>;</b>&acute;]]
-
-	block ::= chunk
-
-	stat ::=  varlist `<b>=</b>&acute; explist | 
-		 functioncall | 
-		 <b>do</b> block <b>end</b> | 
-		 <b>while</b> exp <b>do</b> block <b>end</b> | 
-		 <b>repeat</b> block <b>until</b> exp | 
-		 <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b> | 
-		 <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b> | 
-		 <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b> | 
-		 <b>function</b> funcname funcbody | 
-		 <b>local</b> <b>function</b> Name funcbody | 
-		 <b>local</b> namelist [`<b>=</b>&acute; explist] 
-
-	laststat ::= <b>return</b> [explist] | <b>break</b>
-
-	funcname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]
-
-	varlist ::= var {`<b>,</b>&acute; var}
-
-	var ::=  Name | prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute; | prefixexp `<b>.</b>&acute; Name 
-
-	namelist ::= Name {`<b>,</b>&acute; Name}
-
-	explist ::= {exp `<b>,</b>&acute;} exp
-
-	exp ::=  <b>nil</b> | <b>false</b> | <b>true</b> | Number | String | `<b>...</b>&acute; | function | 
-		 prefixexp | tableconstructor | exp binop exp | unop exp 
-
-	prefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;
-
-	functioncall ::=  prefixexp args | prefixexp `<b>:</b>&acute; Name args 
-
-	args ::=  `<b>(</b>&acute; [explist] `<b>)</b>&acute; | tableconstructor | String 
-
-	function ::= <b>function</b> funcbody
-
-	funcbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>
-
-	parlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;
-
-	tableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;
-
-	fieldlist ::= field {fieldsep field} [fieldsep]
-
-	field ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp
-
-	fieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;
-
-	binop ::= `<b>+</b>&acute; | `<b>-</b>&acute; | `<b>*</b>&acute; | `<b>/</b>&acute; | `<b>^</b>&acute; | `<b>%</b>&acute; | `<b>..</b>&acute; | 
-		 `<b>&lt;</b>&acute; | `<b>&lt;=</b>&acute; | `<b>&gt;</b>&acute; | `<b>&gt;=</b>&acute; | `<b>==</b>&acute; | `<b>~=</b>&acute; | 
-		 <b>and</b> | <b>or</b>
-
-	unop ::= `<b>-</b>&acute; | <b>not</b> | `<b>#</b>&acute;
-
-</pre>
-
-<p>
-
-
-
-
-
-
-
-<HR>
-<SMALL CLASS="footer">
-Last update:
-Mon Feb 13 18:54:19 BRST 2012
-</SMALL>
-<!--
-Last change: revised for Lua 5.1.5
--->
-
-</body></html>
-
diff --git a/redis-stable/deps/lua/doc/readme.html b/redis-stable/deps/lua/doc/readme.html
deleted file mode 100644
index 3ed6a818..00000000
--- a/redis-stable/deps/lua/doc/readme.html
+++ /dev/null
@@ -1,40 +0,0 @@
-<HTML>
-<HEAD>
-<TITLE>Lua documentation</TITLE>
-<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
-</HEAD>
-
-<BODY>
-
-<HR>
-<H1>
-<A HREF="http://www.lua.org/"><IMG SRC="logo.gif" ALT="Lua" BORDER=0></A>
-Documentation
-</H1>
-
-This is the documentation included in the source distribution of Lua 5.1.5.
-
-<UL>
-<LI><A HREF="contents.html">Reference manual</A>
-<LI><A HREF="lua.html">lua man page</A>
-<LI><A HREF="luac.html">luac man page</A>
-<LI><A HREF="../README">lua/README</A>
-<LI><A HREF="../etc/README">lua/etc/README</A>
-<LI><A HREF="../test/README">lua/test/README</A>
-</UL>
-
-Lua's
-<A HREF="http://www.lua.org/">official web site</A>
-contains updated documentation,
-especially the
-<A HREF="http://www.lua.org/manual/5.1/">reference manual</A>.
-<P>
-
-<HR>
-<SMALL>
-Last update:
-Fri Feb  3 09:44:42 BRST 2012
-</SMALL>
-
-</BODY>
-</HTML>
diff --git a/redis-stable/deps/lua/etc/Makefile b/redis-stable/deps/lua/etc/Makefile
deleted file mode 100644
index 6d00008d..00000000
--- a/redis-stable/deps/lua/etc/Makefile
+++ /dev/null
@@ -1,44 +0,0 @@
-# makefile for Lua etc
-
-TOP= ..
-LIB= $(TOP)/src
-INC= $(TOP)/src
-BIN= $(TOP)/src
-SRC= $(TOP)/src
-TST= $(TOP)/test
-
-CC= gcc
-CFLAGS= -O2 -Wall -I$(INC) $(MYCFLAGS)
-MYCFLAGS= 
-MYLDFLAGS= -Wl,-E
-MYLIBS= -lm
-#MYLIBS= -lm -Wl,-E -ldl -lreadline -lhistory -lncurses
-RM= rm -f
-
-default:
-	@echo 'Please choose a target: min noparser one strict clean'
-
-min:	min.c
-	$(CC) $(CFLAGS) $@.c -L$(LIB) -llua $(MYLIBS)
-	echo 'print"Hello there!"' | ./a.out
-
-noparser: noparser.o
-	$(CC) noparser.o $(SRC)/lua.o -L$(LIB) -llua $(MYLIBS)
-	$(BIN)/luac $(TST)/hello.lua
-	-./a.out luac.out
-	-./a.out -e'a=1'
-
-one:
-	$(CC) $(CFLAGS) all.c $(MYLIBS)
-	./a.out $(TST)/hello.lua
-
-strict:
-	-$(BIN)/lua -e 'print(a);b=2'
-	-$(BIN)/lua -lstrict -e 'print(a)'
-	-$(BIN)/lua -e 'function f() b=2 end f()'
-	-$(BIN)/lua -lstrict -e 'function f() b=2 end f()'
-
-clean:
-	$(RM) a.out core core.* *.o luac.out
-
-.PHONY:	default min noparser one strict clean
diff --git a/redis-stable/deps/lua/etc/README b/redis-stable/deps/lua/etc/README
deleted file mode 100644
index 5149fc91..00000000
--- a/redis-stable/deps/lua/etc/README
+++ /dev/null
@@ -1,37 +0,0 @@
-This directory contains some useful files and code.
-Unlike the code in ../src, everything here is in the public domain.
-
-If any of the makes fail, you're probably not using the same libraries
-used to build Lua. Set MYLIBS in Makefile accordingly.
-
-all.c
-	Full Lua interpreter in a single file.
-	Do "make one" for a demo.
-
-lua.hpp
-	Lua header files for C++ using 'extern "C"'.
-
-lua.ico
-	A Lua icon for Windows (and web sites: save as favicon.ico).
-	Drawn by hand by Markus Gritsch <gritsch@iue.tuwien.ac.at>.
-
-lua.pc
-	pkg-config data for Lua
-
-luavs.bat
-	Script to build Lua under "Visual Studio .NET Command Prompt".
-	Run it from the toplevel as etc\luavs.bat.
-
-min.c
-	A minimal Lua interpreter.
-	Good for learning and for starting your own.
-	Do "make min" for a demo.
-
-noparser.c
-	Linking with noparser.o avoids loading the parsing modules in lualib.a.
-	Do "make noparser" for a demo.
-
-strict.lua
-	Traps uses of undeclared global variables.
-	Do "make strict" for a demo.
-
diff --git a/redis-stable/deps/lua/etc/all.c b/redis-stable/deps/lua/etc/all.c
deleted file mode 100644
index dab68fac..00000000
--- a/redis-stable/deps/lua/etc/all.c
+++ /dev/null
@@ -1,38 +0,0 @@
-/*
-* all.c -- Lua core, libraries and interpreter in a single file
-*/
-
-#define luaall_c
-
-#include "lapi.c"
-#include "lcode.c"
-#include "ldebug.c"
-#include "ldo.c"
-#include "ldump.c"
-#include "lfunc.c"
-#include "lgc.c"
-#include "llex.c"
-#include "lmem.c"
-#include "lobject.c"
-#include "lopcodes.c"
-#include "lparser.c"
-#include "lstate.c"
-#include "lstring.c"
-#include "ltable.c"
-#include "ltm.c"
-#include "lundump.c"
-#include "lvm.c"
-#include "lzio.c"
-
-#include "lauxlib.c"
-#include "lbaselib.c"
-#include "ldblib.c"
-#include "liolib.c"
-#include "linit.c"
-#include "lmathlib.c"
-#include "loadlib.c"
-#include "loslib.c"
-#include "lstrlib.c"
-#include "ltablib.c"
-
-#include "lua.c"
diff --git a/redis-stable/deps/lua/etc/lua.hpp b/redis-stable/deps/lua/etc/lua.hpp
deleted file mode 100644
index ec417f59..00000000
--- a/redis-stable/deps/lua/etc/lua.hpp
+++ /dev/null
@@ -1,9 +0,0 @@
-// lua.hpp
-// Lua header files for C++
-// <<extern "C">> not supplied automatically because Lua also compiles as C++
-
-extern "C" {
-#include "lua.h"
-#include "lualib.h"
-#include "lauxlib.h"
-}
diff --git a/redis-stable/deps/lua/etc/lua.ico b/redis-stable/deps/lua/etc/lua.ico
deleted file mode 100644
index ccbabc4e2004683f29598a991006d7caff6d837d..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1078
zcma)5y>7xl4E|D3VJbX9VX7GW1~6FSw!BIQq_T0tNo32b^bxZ4H5fZGR7xh?&v!Y3
zDh3=J`#b+#Yy%W{!g4u>(a#g`Mme7+yefc~5wPOflDr`o81qe{?|t$BfABsDzNw;V
z8cH*0{6W<;G9Np#7ik(qoR4aR5-A@{5)}DJ9&}FRBA#X_5+im4-kQSzMF^)-t2(Vi
ztw-^|Sn8@O_lM9`oos+0wMZGt&`Bq(aK&XCv1Gfr&Jtd6%lKPdD{s=<uXnh?Rp9Ax
zy`#1~uzHCO%J^76V#i*^`r~9ynD^~JKVg1P{@xf*h`t||KlUT{i}n4dwKSxR9Kl{3
z4~Blz;_1*wcr&CFG;m&5Odq5F*fM)FWJ>unqGWyb3%y{X9SS{jB~HMh0oKMISQrDC
zJ;K?)>ElnpmN^UNE-rXxtyk{c#rCe~`P=q<PF|Apo_p%|$#chP@!W3{_E33j&x4IK
zwVO(6s^|V0ZTcy=JifcK?j-tgfn%KNCg!O-ULr7!+i^Zt$2Q3*%iZ?87HMYs>nFT7
bCxwx*w%~s~=?o*z_6Fk4@7l(poWF`cPpA(!

diff --git a/redis-stable/deps/lua/etc/lua.pc b/redis-stable/deps/lua/etc/lua.pc
deleted file mode 100644
index 07e2852b..00000000
--- a/redis-stable/deps/lua/etc/lua.pc
+++ /dev/null
@@ -1,31 +0,0 @@
-# lua.pc -- pkg-config data for Lua
-
-# vars from install Makefile
-
-# grep '^V=' ../Makefile
-V= 5.1
-# grep '^R=' ../Makefile
-R= 5.1.5
-
-# grep '^INSTALL_.*=' ../Makefile | sed 's/INSTALL_TOP/prefix/'
-prefix= /usr/local
-INSTALL_BIN= ${prefix}/bin
-INSTALL_INC= ${prefix}/include
-INSTALL_LIB= ${prefix}/lib
-INSTALL_MAN= ${prefix}/man/man1
-INSTALL_LMOD= ${prefix}/share/lua/${V}
-INSTALL_CMOD= ${prefix}/lib/lua/${V}
-
-# canonical vars
-exec_prefix=${prefix}
-libdir=${exec_prefix}/lib
-includedir=${prefix}/include
-
-Name: Lua
-Description: An Extensible Extension Language
-Version: ${R}
-Requires: 
-Libs: -L${libdir} -llua -lm
-Cflags: -I${includedir}
-
-# (end of lua.pc)
diff --git a/redis-stable/deps/lua/etc/luavs.bat b/redis-stable/deps/lua/etc/luavs.bat
deleted file mode 100644
index 08c2bedd..00000000
--- a/redis-stable/deps/lua/etc/luavs.bat
+++ /dev/null
@@ -1,28 +0,0 @@
-@rem Script to build Lua under "Visual Studio .NET Command Prompt".
-@rem Do not run from this directory; run it from the toplevel: etc\luavs.bat .
-@rem It creates lua51.dll, lua51.lib, lua.exe, and luac.exe in src.
-@rem (contributed by David Manura and Mike Pall)
-
-@setlocal
-@set MYCOMPILE=cl /nologo /MD /O2 /W3 /c /D_CRT_SECURE_NO_DEPRECATE
-@set MYLINK=link /nologo
-@set MYMT=mt /nologo
-
-cd src
-%MYCOMPILE% /DLUA_BUILD_AS_DLL l*.c
-del lua.obj luac.obj
-%MYLINK% /DLL /out:lua51.dll l*.obj
-if exist lua51.dll.manifest^
-  %MYMT% -manifest lua51.dll.manifest -outputresource:lua51.dll;2
-%MYCOMPILE% /DLUA_BUILD_AS_DLL lua.c
-%MYLINK% /out:lua.exe lua.obj lua51.lib
-if exist lua.exe.manifest^
-  %MYMT% -manifest lua.exe.manifest -outputresource:lua.exe
-%MYCOMPILE% l*.c print.c
-del lua.obj linit.obj lbaselib.obj ldblib.obj liolib.obj lmathlib.obj^
-    loslib.obj ltablib.obj lstrlib.obj loadlib.obj
-%MYLINK% /out:luac.exe *.obj
-if exist luac.exe.manifest^
-  %MYMT% -manifest luac.exe.manifest -outputresource:luac.exe
-del *.obj *.manifest
-cd ..
diff --git a/redis-stable/deps/lua/etc/min.c b/redis-stable/deps/lua/etc/min.c
deleted file mode 100644
index 6a85a4d1..00000000
--- a/redis-stable/deps/lua/etc/min.c
+++ /dev/null
@@ -1,39 +0,0 @@
-/*
-* min.c -- a minimal Lua interpreter
-* loads stdin only with minimal error handling.
-* no interaction, and no standard library, only a "print" function.
-*/
-
-#include <stdio.h>
-
-#include "lua.h"
-#include "lauxlib.h"
-
-static int print(lua_State *L)
-{
- int n=lua_gettop(L);
- int i;
- for (i=1; i<=n; i++)
- {
-  if (i>1) printf("\t");
-  if (lua_isstring(L,i))
-   printf("%s",lua_tostring(L,i));
-  else if (lua_isnil(L,i))
-   printf("%s","nil");
-  else if (lua_isboolean(L,i))
-   printf("%s",lua_toboolean(L,i) ? "true" : "false");
-  else
-   printf("%s:%p",luaL_typename(L,i),lua_topointer(L,i));
- }
- printf("\n");
- return 0;
-}
-
-int main(void)
-{
- lua_State *L=lua_open();
- lua_register(L,"print",print);
- if (luaL_dofile(L,NULL)!=0) fprintf(stderr,"%s\n",lua_tostring(L,-1));
- lua_close(L);
- return 0;
-}
diff --git a/redis-stable/deps/lua/etc/noparser.c b/redis-stable/deps/lua/etc/noparser.c
deleted file mode 100644
index 13ba5462..00000000
--- a/redis-stable/deps/lua/etc/noparser.c
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
-* The code below can be used to make a Lua core that does not contain the
-* parsing modules (lcode, llex, lparser), which represent 35% of the total core.
-* You'll only be able to load binary files and strings, precompiled with luac.
-* (Of course, you'll have to build luac with the original parsing modules!)
-*
-* To use this module, simply compile it ("make noparser" does that) and list
-* its object file before the Lua libraries. The linker should then not load
-* the parsing modules. To try it, do "make luab".
-*
-* If you also want to avoid the dump module (ldump.o), define NODUMP.
-* #define NODUMP
-*/
-
-#define LUA_CORE
-
-#include "llex.h"
-#include "lparser.h"
-#include "lzio.h"
-
-LUAI_FUNC void luaX_init (lua_State *L) {
-  UNUSED(L);
-}
-
-LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
-  UNUSED(z);
-  UNUSED(buff);
-  UNUSED(name);
-  lua_pushliteral(L,"parser not loaded");
-  lua_error(L);
-  return NULL;
-}
-
-#ifdef NODUMP
-#include "lundump.h"
-
-LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) {
-  UNUSED(f);
-  UNUSED(w);
-  UNUSED(data);
-  UNUSED(strip);
-#if 1
-  UNUSED(L);
-  return 0;
-#else
-  lua_pushliteral(L,"dumper not loaded");
-  lua_error(L);
-#endif
-}
-#endif
diff --git a/redis-stable/deps/lua/etc/strict.lua b/redis-stable/deps/lua/etc/strict.lua
deleted file mode 100644
index 604619dd..00000000
--- a/redis-stable/deps/lua/etc/strict.lua
+++ /dev/null
@@ -1,41 +0,0 @@
---
--- strict.lua
--- checks uses of undeclared global variables
--- All global variables must be 'declared' through a regular assignment
--- (even assigning nil will do) in a main chunk before being used
--- anywhere or assigned to inside a function.
---
-
-local getinfo, error, rawset, rawget = debug.getinfo, error, rawset, rawget
-
-local mt = getmetatable(_G)
-if mt == nil then
-  mt = {}
-  setmetatable(_G, mt)
-end
-
-mt.__declared = {}
-
-local function what ()
-  local d = getinfo(3, "S")
-  return d and d.what or "C"
-end
-
-mt.__newindex = function (t, n, v)
-  if not mt.__declared[n] then
-    local w = what()
-    if w ~= "main" and w ~= "C" then
-      error("assign to undeclared variable '"..n.."'", 2)
-    end
-    mt.__declared[n] = true
-  end
-  rawset(t, n, v)
-end
-  
-mt.__index = function (t, n)
-  if not mt.__declared[n] and what() ~= "C" then
-    error("variable '"..n.."' is not declared", 2)
-  end
-  return rawget(t, n)
-end
-
diff --git a/redis-stable/deps/lua/src/Makefile b/redis-stable/deps/lua/src/Makefile
deleted file mode 100644
index f3bba2f8..00000000
--- a/redis-stable/deps/lua/src/Makefile
+++ /dev/null
@@ -1,183 +0,0 @@
-# makefile for building Lua
-# see ../INSTALL for installation instructions
-# see ../Makefile and luaconf.h for further customization
-
-# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================
-
-# Your platform. See PLATS for possible values.
-PLAT= none
-
-CC?= gcc
-CFLAGS= -O2 -Wall $(MYCFLAGS)
-AR= ar rcu
-RANLIB= ranlib
-RM= rm -f
-LIBS= -lm $(MYLIBS)
-
-MYCFLAGS=
-MYLDFLAGS=
-MYLIBS=
-
-# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========
-
-PLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris
-
-LUA_A=	liblua.a
-CORE_O=	lapi.o lcode.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o lmem.o \
-	lobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o ltm.o  \
-	lundump.o lvm.o lzio.o strbuf.o fpconv.o
-LIB_O=	lauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o loslib.o ltablib.o \
-	lstrlib.o loadlib.o linit.o lua_cjson.o lua_struct.o lua_cmsgpack.o \
-	lua_bit.o
-
-LUA_T=	lua
-LUA_O=	lua.o
-
-LUAC_T=	luac
-LUAC_O=	luac.o print.o
-
-ALL_O= $(CORE_O) $(LIB_O) $(LUA_O) $(LUAC_O)
-ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T)
-ALL_A= $(LUA_A)
-
-default: $(PLAT)
-
-all:	$(ALL_T)
-
-o:	$(ALL_O)
-
-a:	$(ALL_A)
-
-$(LUA_A): $(CORE_O) $(LIB_O)
-	$(AR) $@ $(CORE_O) $(LIB_O)	# DLL needs all object files
-	$(RANLIB) $@
-
-$(LUA_T): $(LUA_O) $(LUA_A)
-	$(CC) -o $@ $(MYLDFLAGS) $(LUA_O) $(LUA_A) $(LIBS)
-
-$(LUAC_T): $(LUAC_O) $(LUA_A)
-	$(CC) -o $@ $(MYLDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS)
-
-clean:
-	$(RM) $(ALL_T) $(ALL_O)
-
-depend:
-	@$(CC) $(CFLAGS) -MM l*.c print.c
-
-echo:
-	@echo "PLAT = $(PLAT)"
-	@echo "CC = $(CC)"
-	@echo "CFLAGS = $(CFLAGS)"
-	@echo "AR = $(AR)"
-	@echo "RANLIB = $(RANLIB)"
-	@echo "RM = $(RM)"
-	@echo "MYCFLAGS = $(MYCFLAGS)"
-	@echo "MYLDFLAGS = $(MYLDFLAGS)"
-	@echo "MYLIBS = $(MYLIBS)"
-
-# convenience targets for popular platforms
-
-none:
-	@echo "Please choose a platform:"
-	@echo "   $(PLATS)"
-
-aix:
-	$(MAKE) all CC="xlc" CFLAGS="-O2 -DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl" MYLDFLAGS="-brtl -bexpall"
-
-ansi:
-	$(MAKE) all MYCFLAGS=-DLUA_ANSI
-
-bsd:
-	$(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-Wl,-E"
-
-freebsd:
-	$(MAKE) all MYCFLAGS="-DLUA_USE_LINUX" MYLIBS="-Wl,-E -lreadline"
-
-generic:
-	$(MAKE) all MYCFLAGS=
-
-linux:
-	$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-Wl,-E -ldl -lreadline -lhistory -lncurses"
-
-macosx:
-	$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS="-lreadline"
-# use this on Mac OS X 10.3-
-#	$(MAKE) all MYCFLAGS=-DLUA_USE_MACOSX
-
-mingw:
-	$(MAKE) "LUA_A=lua51.dll" "LUA_T=lua.exe" \
-	"AR=$(CC) -shared -o" "RANLIB=strip --strip-unneeded" \
-	"MYCFLAGS=-DLUA_BUILD_AS_DLL" "MYLIBS=" "MYLDFLAGS=-s" lua.exe
-	$(MAKE) "LUAC_T=luac.exe" luac.exe
-
-posix:
-	$(MAKE) all MYCFLAGS=-DLUA_USE_POSIX
-
-solaris:
-	$(MAKE) all MYCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" MYLIBS="-ldl"
-
-# list targets that do not create files (but not all makes understand .PHONY)
-.PHONY: all $(PLATS) default o a clean depend echo none
-
-# DO NOT DELETE
-
-lapi.o: lapi.c lua.h luaconf.h lapi.h lobject.h llimits.h ldebug.h \
-  lstate.h ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h \
-  lundump.h lvm.h
-lauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h
-lbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h
-lcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
-  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h lgc.h \
-  ltable.h
-ldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h
-ldebug.o: ldebug.c lua.h luaconf.h lapi.h lobject.h llimits.h lcode.h \
-  llex.h lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \
-  lfunc.h lstring.h lgc.h ltable.h lvm.h
-ldo.o: ldo.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
-  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h lstring.h \
-  ltable.h lundump.h lvm.h
-ldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \
-  lzio.h lmem.h lundump.h
-lfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h lmem.h \
-  lstate.h ltm.h lzio.h
-lgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
-  lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h
-linit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h
-liolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h
-llex.o: llex.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h ltm.h \
-  lzio.h lmem.h llex.h lparser.h lstring.h lgc.h ltable.h
-lmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h
-lmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
-  ltm.h lzio.h lmem.h ldo.h
-loadlib.o: loadlib.c lua.h luaconf.h lauxlib.h lualib.h
-lobject.o: lobject.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h \
-  ltm.h lzio.h lmem.h lstring.h lgc.h lvm.h
-lopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h
-loslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h
-lparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \
-  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \
-  lfunc.h lstring.h lgc.h ltable.h
-lstate.o: lstate.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
-  ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h llex.h lstring.h ltable.h
-lstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \
-  ltm.h lzio.h lstring.h lgc.h
-lstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h
-ltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \
-  ltm.h lzio.h lmem.h ldo.h lgc.h ltable.h
-ltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h
-ltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \
-  lmem.h lstring.h lgc.h ltable.h
-lua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h
-luac.o: luac.c lua.h luaconf.h lauxlib.h ldo.h lobject.h llimits.h \
-  lstate.h ltm.h lzio.h lmem.h lfunc.h lopcodes.h lstring.h lgc.h \
-  lundump.h
-lundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \
-  llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lstring.h lgc.h lundump.h
-lvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \
-  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h lvm.h
-lzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \
-  lzio.h
-print.o: print.c ldebug.h lstate.h lua.h luaconf.h lobject.h llimits.h \
-  ltm.h lzio.h lmem.h lopcodes.h lundump.h
-
-# (end of Makefile)
diff --git a/redis-stable/deps/lua/src/fpconv.c b/redis-stable/deps/lua/src/fpconv.c
deleted file mode 100644
index 79908317..00000000
--- a/redis-stable/deps/lua/src/fpconv.c
+++ /dev/null
@@ -1,205 +0,0 @@
-/* fpconv - Floating point conversion routines
- *
- * Copyright (c) 2011-2012  Mark Pulford <mark@kyne.com.au>
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- */
-
-/* JSON uses a '.' decimal separator. strtod() / sprintf() under C libraries
- * with locale support will break when the decimal separator is a comma.
- *
- * fpconv_* will around these issues with a translation buffer if required.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <assert.h>
-#include <string.h>
-
-#include "fpconv.h"
-
-/* Lua CJSON assumes the locale is the same for all threads within a
- * process and doesn't change after initialisation.
- *
- * This avoids the need for per thread storage or expensive checks
- * for call. */
-static char locale_decimal_point = '.';
-
-/* In theory multibyte decimal_points are possible, but
- * Lua CJSON only supports UTF-8 and known locales only have
- * single byte decimal points ([.,]).
- *
- * localconv() may not be thread safe (=>crash), and nl_langinfo() is
- * not supported on some platforms. Use sprintf() instead - if the
- * locale does change, at least Lua CJSON won't crash. */
-static void fpconv_update_locale()
-{
-    char buf[8];
-
-    snprintf(buf, sizeof(buf), "%g", 0.5);
-
-    /* Failing this test might imply the platform has a buggy dtoa
-     * implementation or wide characters */
-    if (buf[0] != '0' || buf[2] != '5' || buf[3] != 0) {
-        fprintf(stderr, "Error: wide characters found or printf() bug.");
-        abort();
-    }
-
-    locale_decimal_point = buf[1];
-}
-
-/* Check for a valid number character: [-+0-9a-yA-Y.]
- * Eg: -0.6e+5, infinity, 0xF0.F0pF0
- *
- * Used to find the probable end of a number. It doesn't matter if
- * invalid characters are counted - strtod() will find the valid
- * number if it exists.  The risk is that slightly more memory might
- * be allocated before a parse error occurs. */
-static inline int valid_number_character(char ch)
-{
-    char lower_ch;
-
-    if ('0' <= ch && ch <= '9')
-        return 1;
-    if (ch == '-' || ch == '+' || ch == '.')
-        return 1;
-
-    /* Hex digits, exponent (e), base (p), "infinity",.. */
-    lower_ch = ch | 0x20;
-    if ('a' <= lower_ch && lower_ch <= 'y')
-        return 1;
-
-    return 0;
-}
-
-/* Calculate the size of the buffer required for a strtod locale
- * conversion. */
-static int strtod_buffer_size(const char *s)
-{
-    const char *p = s;
-
-    while (valid_number_character(*p))
-        p++;
-
-    return p - s;
-}
-
-/* Similar to strtod(), but must be passed the current locale's decimal point
- * character. Guaranteed to be called at the start of any valid number in a string */
-double fpconv_strtod(const char *nptr, char **endptr)
-{
-    char localbuf[FPCONV_G_FMT_BUFSIZE];
-    char *buf, *endbuf, *dp;
-    int buflen;
-    double value;
-
-    /* System strtod() is fine when decimal point is '.' */
-    if (locale_decimal_point == '.')
-        return strtod(nptr, endptr);
-
-    buflen = strtod_buffer_size(nptr);
-    if (!buflen) {
-        /* No valid characters found, standard strtod() return */
-        *endptr = (char *)nptr;
-        return 0;
-    }
-
-    /* Duplicate number into buffer */
-    if (buflen >= FPCONV_G_FMT_BUFSIZE) {
-        /* Handle unusually large numbers */
-        buf = malloc(buflen + 1);
-        if (!buf) {
-            fprintf(stderr, "Out of memory");
-            abort();
-        }
-    } else {
-        /* This is the common case.. */
-        buf = localbuf;
-    }
-    memcpy(buf, nptr, buflen);
-    buf[buflen] = 0;
-
-    /* Update decimal point character if found */
-    dp = strchr(buf, '.');
-    if (dp)
-        *dp = locale_decimal_point;
-
-    value = strtod(buf, &endbuf);
-    *endptr = (char *)&nptr[endbuf - buf];
-    if (buflen >= FPCONV_G_FMT_BUFSIZE)
-        free(buf);
-
-    return value;
-}
-
-/* "fmt" must point to a buffer of at least 6 characters */
-static void set_number_format(char *fmt, int precision)
-{
-    int d1, d2, i;
-
-    assert(1 <= precision && precision <= 14);
-
-    /* Create printf format (%.14g) from precision */
-    d1 = precision / 10;
-    d2 = precision % 10;
-    fmt[0] = '%';
-    fmt[1] = '.';
-    i = 2;
-    if (d1) {
-        fmt[i++] = '0' + d1;
-    }
-    fmt[i++] = '0' + d2;
-    fmt[i++] = 'g';
-    fmt[i] = 0;
-}
-
-/* Assumes there is always at least 32 characters available in the target buffer */
-int fpconv_g_fmt(char *str, double num, int precision)
-{
-    char buf[FPCONV_G_FMT_BUFSIZE];
-    char fmt[6];
-    int len;
-    char *b;
-
-    set_number_format(fmt, precision);
-
-    /* Pass through when decimal point character is dot. */
-    if (locale_decimal_point == '.')
-        return snprintf(str, FPCONV_G_FMT_BUFSIZE, fmt, num);
-
-    /* snprintf() to a buffer then translate for other decimal point characters */
-    len = snprintf(buf, FPCONV_G_FMT_BUFSIZE, fmt, num);
-
-    /* Copy into target location. Translate decimal point if required */
-    b = buf;
-    do {
-        *str++ = (*b == locale_decimal_point ? '.' : *b);
-    } while(*b++);
-
-    return len;
-}
-
-void fpconv_init()
-{
-    fpconv_update_locale();
-}
-
-/* vi:ai et sw=4 ts=4:
- */
diff --git a/redis-stable/deps/lua/src/fpconv.h b/redis-stable/deps/lua/src/fpconv.h
deleted file mode 100644
index 7b0d0ee3..00000000
--- a/redis-stable/deps/lua/src/fpconv.h
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Lua CJSON floating point conversion routines */
-
-/* Buffer required to store the largest string representation of a double.
- *
- * Longest double printed with %.14g is 21 characters long:
- * -1.7976931348623e+308 */
-# define FPCONV_G_FMT_BUFSIZE   32
-
-#ifdef USE_INTERNAL_FPCONV
-static inline void fpconv_init()
-{
-    /* Do nothing - not required */
-}
-#else
-extern void fpconv_init();
-#endif
-
-extern int fpconv_g_fmt(char*, double, int);
-extern double fpconv_strtod(const char*, char**);
-
-/* vi:ai et sw=4 ts=4:
- */
diff --git a/redis-stable/deps/lua/src/lapi.c b/redis-stable/deps/lua/src/lapi.c
deleted file mode 100644
index 5d5145d2..00000000
--- a/redis-stable/deps/lua/src/lapi.c
+++ /dev/null
@@ -1,1087 +0,0 @@
-/*
-** $Id: lapi.c,v 2.55.1.5 2008/07/04 18:41:18 roberto Exp $
-** Lua API
-** See Copyright Notice in lua.h
-*/
-
-
-#include <assert.h>
-#include <math.h>
-#include <stdarg.h>
-#include <string.h>
-
-#define lapi_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lapi.h"
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lgc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-#include "lundump.h"
-#include "lvm.h"
-
-
-
-const char lua_ident[] =
-  "$Lua: " LUA_RELEASE " " LUA_COPYRIGHT " $\n"
-  "$Authors: " LUA_AUTHORS " $\n"
-  "$URL: www.lua.org $\n";
-
-
-
-#define api_checknelems(L, n)	api_check(L, (n) <= (L->top - L->base))
-
-#define api_checkvalidindex(L, i)	api_check(L, (i) != luaO_nilobject)
-
-#define api_incr_top(L)   {api_check(L, L->top < L->ci->top); L->top++;}
-
-
-
-static TValue *index2adr (lua_State *L, int idx) {
-  if (idx > 0) {
-    TValue *o = L->base + (idx - 1);
-    api_check(L, idx <= L->ci->top - L->base);
-    if (o >= L->top) return cast(TValue *, luaO_nilobject);
-    else return o;
-  }
-  else if (idx > LUA_REGISTRYINDEX) {
-    api_check(L, idx != 0 && -idx <= L->top - L->base);
-    return L->top + idx;
-  }
-  else switch (idx) {  /* pseudo-indices */
-    case LUA_REGISTRYINDEX: return registry(L);
-    case LUA_ENVIRONINDEX: {
-      Closure *func = curr_func(L);
-      sethvalue(L, &L->env, func->c.env);
-      return &L->env;
-    }
-    case LUA_GLOBALSINDEX: return gt(L);
-    default: {
-      Closure *func = curr_func(L);
-      idx = LUA_GLOBALSINDEX - idx;
-      return (idx <= func->c.nupvalues)
-                ? &func->c.upvalue[idx-1]
-                : cast(TValue *, luaO_nilobject);
-    }
-  }
-}
-
-
-static Table *getcurrenv (lua_State *L) {
-  if (L->ci == L->base_ci)  /* no enclosing function? */
-    return hvalue(gt(L));  /* use global table as environment */
-  else {
-    Closure *func = curr_func(L);
-    return func->c.env;
-  }
-}
-
-
-void luaA_pushobject (lua_State *L, const TValue *o) {
-  setobj2s(L, L->top, o);
-  api_incr_top(L);
-}
-
-
-LUA_API int lua_checkstack (lua_State *L, int size) {
-  int res = 1;
-  lua_lock(L);
-  if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK)
-    res = 0;  /* stack overflow */
-  else if (size > 0) {
-    luaD_checkstack(L, size);
-    if (L->ci->top < L->top + size)
-      L->ci->top = L->top + size;
-  }
-  lua_unlock(L);
-  return res;
-}
-
-
-LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {
-  int i;
-  if (from == to) return;
-  lua_lock(to);
-  api_checknelems(from, n);
-  api_check(from, G(from) == G(to));
-  api_check(from, to->ci->top - to->top >= n);
-  from->top -= n;
-  for (i = 0; i < n; i++) {
-    setobj2s(to, to->top++, from->top + i);
-  }
-  lua_unlock(to);
-}
-
-
-LUA_API void lua_setlevel (lua_State *from, lua_State *to) {
-  to->nCcalls = from->nCcalls;
-}
-
-
-LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) {
-  lua_CFunction old;
-  lua_lock(L);
-  old = G(L)->panic;
-  G(L)->panic = panicf;
-  lua_unlock(L);
-  return old;
-}
-
-
-LUA_API lua_State *lua_newthread (lua_State *L) {
-  lua_State *L1;
-  lua_lock(L);
-  luaC_checkGC(L);
-  L1 = luaE_newthread(L);
-  setthvalue(L, L->top, L1);
-  api_incr_top(L);
-  lua_unlock(L);
-  luai_userstatethread(L, L1);
-  return L1;
-}
-
-
-
-/*
-** basic stack manipulation
-*/
-
-
-LUA_API int lua_gettop (lua_State *L) {
-  return cast_int(L->top - L->base);
-}
-
-
-LUA_API void lua_settop (lua_State *L, int idx) {
-  lua_lock(L);
-  if (idx >= 0) {
-    api_check(L, idx <= L->stack_last - L->base);
-    while (L->top < L->base + idx)
-      setnilvalue(L->top++);
-    L->top = L->base + idx;
-  }
-  else {
-    api_check(L, -(idx+1) <= (L->top - L->base));
-    L->top += idx+1;  /* `subtract' index (index is negative) */
-  }
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_remove (lua_State *L, int idx) {
-  StkId p;
-  lua_lock(L);
-  p = index2adr(L, idx);
-  api_checkvalidindex(L, p);
-  while (++p < L->top) setobjs2s(L, p-1, p);
-  L->top--;
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_insert (lua_State *L, int idx) {
-  StkId p;
-  StkId q;
-  lua_lock(L);
-  p = index2adr(L, idx);
-  api_checkvalidindex(L, p);
-  for (q = L->top; q>p; q--) setobjs2s(L, q, q-1);
-  setobjs2s(L, p, L->top);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_replace (lua_State *L, int idx) {
-  StkId o;
-  lua_lock(L);
-  /* explicit test for incompatible code */
-  if (idx == LUA_ENVIRONINDEX && L->ci == L->base_ci)
-    luaG_runerror(L, "no calling environment");
-  api_checknelems(L, 1);
-  o = index2adr(L, idx);
-  api_checkvalidindex(L, o);
-  if (idx == LUA_ENVIRONINDEX) {
-    Closure *func = curr_func(L);
-    api_check(L, ttistable(L->top - 1)); 
-    func->c.env = hvalue(L->top - 1);
-    luaC_barrier(L, func, L->top - 1);
-  }
-  else {
-    setobj(L, o, L->top - 1);
-    if (idx < LUA_GLOBALSINDEX)  /* function upvalue? */
-      luaC_barrier(L, curr_func(L), L->top - 1);
-  }
-  L->top--;
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushvalue (lua_State *L, int idx) {
-  lua_lock(L);
-  setobj2s(L, L->top, index2adr(L, idx));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-
-/*
-** access functions (stack -> C)
-*/
-
-
-LUA_API int lua_type (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  return (o == luaO_nilobject) ? LUA_TNONE : ttype(o);
-}
-
-
-LUA_API const char *lua_typename (lua_State *L, int t) {
-  UNUSED(L);
-  return (t == LUA_TNONE) ? "no value" : luaT_typenames[t];
-}
-
-
-LUA_API int lua_iscfunction (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  return iscfunction(o);
-}
-
-
-LUA_API int lua_isnumber (lua_State *L, int idx) {
-  TValue n;
-  const TValue *o = index2adr(L, idx);
-  return tonumber(o, &n);
-}
-
-
-LUA_API int lua_isstring (lua_State *L, int idx) {
-  int t = lua_type(L, idx);
-  return (t == LUA_TSTRING || t == LUA_TNUMBER);
-}
-
-
-LUA_API int lua_isuserdata (lua_State *L, int idx) {
-  const TValue *o = index2adr(L, idx);
-  return (ttisuserdata(o) || ttislightuserdata(o));
-}
-
-
-LUA_API int lua_rawequal (lua_State *L, int index1, int index2) {
-  StkId o1 = index2adr(L, index1);
-  StkId o2 = index2adr(L, index2);
-  return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
-         : luaO_rawequalObj(o1, o2);
-}
-
-
-LUA_API int lua_equal (lua_State *L, int index1, int index2) {
-  StkId o1, o2;
-  int i;
-  lua_lock(L);  /* may call tag method */
-  o1 = index2adr(L, index1);
-  o2 = index2adr(L, index2);
-  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 : equalobj(L, o1, o2);
-  lua_unlock(L);
-  return i;
-}
-
-
-LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
-  StkId o1, o2;
-  int i;
-  lua_lock(L);  /* may call tag method */
-  o1 = index2adr(L, index1);
-  o2 = index2adr(L, index2);
-  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
-       : luaV_lessthan(L, o1, o2);
-  lua_unlock(L);
-  return i;
-}
-
-
-
-LUA_API lua_Number lua_tonumber (lua_State *L, int idx) {
-  TValue n;
-  const TValue *o = index2adr(L, idx);
-  if (tonumber(o, &n))
-    return nvalue(o);
-  else
-    return 0;
-}
-
-
-LUA_API lua_Integer lua_tointeger (lua_State *L, int idx) {
-  TValue n;
-  const TValue *o = index2adr(L, idx);
-  if (tonumber(o, &n)) {
-    lua_Integer res;
-    lua_Number num = nvalue(o);
-    lua_number2integer(res, num);
-    return res;
-  }
-  else
-    return 0;
-}
-
-
-LUA_API int lua_toboolean (lua_State *L, int idx) {
-  const TValue *o = index2adr(L, idx);
-  return !l_isfalse(o);
-}
-
-
-LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) {
-  StkId o = index2adr(L, idx);
-  if (!ttisstring(o)) {
-    lua_lock(L);  /* `luaV_tostring' may create a new string */
-    if (!luaV_tostring(L, o)) {  /* conversion failed? */
-      if (len != NULL) *len = 0;
-      lua_unlock(L);
-      return NULL;
-    }
-    luaC_checkGC(L);
-    o = index2adr(L, idx);  /* previous call may reallocate the stack */
-    lua_unlock(L);
-  }
-  if (len != NULL) *len = tsvalue(o)->len;
-  return svalue(o);
-}
-
-
-LUA_API size_t lua_objlen (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  switch (ttype(o)) {
-    case LUA_TSTRING: return tsvalue(o)->len;
-    case LUA_TUSERDATA: return uvalue(o)->len;
-    case LUA_TTABLE: return luaH_getn(hvalue(o));
-    case LUA_TNUMBER: {
-      size_t l;
-      lua_lock(L);  /* `luaV_tostring' may create a new string */
-      l = (luaV_tostring(L, o) ? tsvalue(o)->len : 0);
-      lua_unlock(L);
-      return l;
-    }
-    default: return 0;
-  }
-}
-
-
-LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  return (!iscfunction(o)) ? NULL : clvalue(o)->c.f;
-}
-
-
-LUA_API void *lua_touserdata (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  switch (ttype(o)) {
-    case LUA_TUSERDATA: return (rawuvalue(o) + 1);
-    case LUA_TLIGHTUSERDATA: return pvalue(o);
-    default: return NULL;
-  }
-}
-
-
-LUA_API lua_State *lua_tothread (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  return (!ttisthread(o)) ? NULL : thvalue(o);
-}
-
-
-LUA_API const void *lua_topointer (lua_State *L, int idx) {
-  StkId o = index2adr(L, idx);
-  switch (ttype(o)) {
-    case LUA_TTABLE: return hvalue(o);
-    case LUA_TFUNCTION: return clvalue(o);
-    case LUA_TTHREAD: return thvalue(o);
-    case LUA_TUSERDATA:
-    case LUA_TLIGHTUSERDATA:
-      return lua_touserdata(L, idx);
-    default: return NULL;
-  }
-}
-
-
-
-/*
-** push functions (C -> stack)
-*/
-
-
-LUA_API void lua_pushnil (lua_State *L) {
-  lua_lock(L);
-  setnilvalue(L->top);
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
-  lua_lock(L);
-  setnvalue(L->top, n);
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) {
-  lua_lock(L);
-  setnvalue(L->top, cast_num(n));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {
-  lua_lock(L);
-  luaC_checkGC(L);
-  setsvalue2s(L, L->top, luaS_newlstr(L, s, len));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushstring (lua_State *L, const char *s) {
-  if (s == NULL)
-    lua_pushnil(L);
-  else
-    lua_pushlstring(L, s, strlen(s));
-}
-
-
-LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt,
-                                      va_list argp) {
-  const char *ret;
-  lua_lock(L);
-  luaC_checkGC(L);
-  ret = luaO_pushvfstring(L, fmt, argp);
-  lua_unlock(L);
-  return ret;
-}
-
-
-LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) {
-  const char *ret;
-  va_list argp;
-  lua_lock(L);
-  luaC_checkGC(L);
-  va_start(argp, fmt);
-  ret = luaO_pushvfstring(L, fmt, argp);
-  va_end(argp);
-  lua_unlock(L);
-  return ret;
-}
-
-
-LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
-  Closure *cl;
-  lua_lock(L);
-  luaC_checkGC(L);
-  api_checknelems(L, n);
-  cl = luaF_newCclosure(L, n, getcurrenv(L));
-  cl->c.f = fn;
-  L->top -= n;
-  while (n--)
-    setobj2n(L, &cl->c.upvalue[n], L->top+n);
-  setclvalue(L, L->top, cl);
-  lua_assert(iswhite(obj2gco(cl)));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushboolean (lua_State *L, int b) {
-  lua_lock(L);
-  setbvalue(L->top, (b != 0));  /* ensure that true is 1 */
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_pushlightuserdata (lua_State *L, void *p) {
-  lua_lock(L);
-  setpvalue(L->top, p);
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API int lua_pushthread (lua_State *L) {
-  lua_lock(L);
-  setthvalue(L, L->top, L);
-  api_incr_top(L);
-  lua_unlock(L);
-  return (G(L)->mainthread == L);
-}
-
-
-
-/*
-** get functions (Lua -> stack)
-*/
-
-
-LUA_API void lua_gettable (lua_State *L, int idx) {
-  StkId t;
-  lua_lock(L);
-  t = index2adr(L, idx);
-  api_checkvalidindex(L, t);
-  luaV_gettable(L, t, L->top - 1, L->top - 1);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_getfield (lua_State *L, int idx, const char *k) {
-  StkId t;
-  TValue key;
-  lua_lock(L);
-  t = index2adr(L, idx);
-  api_checkvalidindex(L, t);
-  setsvalue(L, &key, luaS_new(L, k));
-  luaV_gettable(L, t, &key, L->top);
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_rawget (lua_State *L, int idx) {
-  StkId t;
-  lua_lock(L);
-  t = index2adr(L, idx);
-  api_check(L, ttistable(t));
-  setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1));
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_rawgeti (lua_State *L, int idx, int n) {
-  StkId o;
-  lua_lock(L);
-  o = index2adr(L, idx);
-  api_check(L, ttistable(o));
-  setobj2s(L, L->top, luaH_getnum(hvalue(o), n));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_createtable (lua_State *L, int narray, int nrec) {
-  lua_lock(L);
-  luaC_checkGC(L);
-  sethvalue(L, L->top, luaH_new(L, narray, nrec));
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-LUA_API int lua_getmetatable (lua_State *L, int objindex) {
-  const TValue *obj;
-  Table *mt = NULL;
-  int res;
-  lua_lock(L);
-  obj = index2adr(L, objindex);
-  switch (ttype(obj)) {
-    case LUA_TTABLE:
-      mt = hvalue(obj)->metatable;
-      break;
-    case LUA_TUSERDATA:
-      mt = uvalue(obj)->metatable;
-      break;
-    default:
-      mt = G(L)->mt[ttype(obj)];
-      break;
-  }
-  if (mt == NULL)
-    res = 0;
-  else {
-    sethvalue(L, L->top, mt);
-    api_incr_top(L);
-    res = 1;
-  }
-  lua_unlock(L);
-  return res;
-}
-
-
-LUA_API void lua_getfenv (lua_State *L, int idx) {
-  StkId o;
-  lua_lock(L);
-  o = index2adr(L, idx);
-  api_checkvalidindex(L, o);
-  switch (ttype(o)) {
-    case LUA_TFUNCTION:
-      sethvalue(L, L->top, clvalue(o)->c.env);
-      break;
-    case LUA_TUSERDATA:
-      sethvalue(L, L->top, uvalue(o)->env);
-      break;
-    case LUA_TTHREAD:
-      setobj2s(L, L->top,  gt(thvalue(o)));
-      break;
-    default:
-      setnilvalue(L->top);
-      break;
-  }
-  api_incr_top(L);
-  lua_unlock(L);
-}
-
-
-/*
-** set functions (stack -> Lua)
-*/
-
-
-LUA_API void lua_settable (lua_State *L, int idx) {
-  StkId t;
-  lua_lock(L);
-  api_checknelems(L, 2);
-  t = index2adr(L, idx);
-  api_checkvalidindex(L, t);
-  luaV_settable(L, t, L->top - 2, L->top - 1);
-  L->top -= 2;  /* pop index and value */
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_setfield (lua_State *L, int idx, const char *k) {
-  StkId t;
-  TValue key;
-  lua_lock(L);
-  api_checknelems(L, 1);
-  t = index2adr(L, idx);
-  api_checkvalidindex(L, t);
-  setsvalue(L, &key, luaS_new(L, k));
-  luaV_settable(L, t, &key, L->top - 1);
-  L->top--;  /* pop value */
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_rawset (lua_State *L, int idx) {
-  StkId t;
-  lua_lock(L);
-  api_checknelems(L, 2);
-  t = index2adr(L, idx);
-  api_check(L, ttistable(t));
-  setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1);
-  luaC_barriert(L, hvalue(t), L->top-1);
-  L->top -= 2;
-  lua_unlock(L);
-}
-
-
-LUA_API void lua_rawseti (lua_State *L, int idx, int n) {
-  StkId o;
-  lua_lock(L);
-  api_checknelems(L, 1);
-  o = index2adr(L, idx);
-  api_check(L, ttistable(o));
-  setobj2t(L, luaH_setnum(L, hvalue(o), n), L->top-1);
-  luaC_barriert(L, hvalue(o), L->top-1);
-  L->top--;
-  lua_unlock(L);
-}
-
-
-LUA_API int lua_setmetatable (lua_State *L, int objindex) {
-  TValue *obj;
-  Table *mt;
-  lua_lock(L);
-  api_checknelems(L, 1);
-  obj = index2adr(L, objindex);
-  api_checkvalidindex(L, obj);
-  if (ttisnil(L->top - 1))
-    mt = NULL;
-  else {
-    api_check(L, ttistable(L->top - 1));
-    mt = hvalue(L->top - 1);
-  }
-  switch (ttype(obj)) {
-    case LUA_TTABLE: {
-      hvalue(obj)->metatable = mt;
-      if (mt)
-        luaC_objbarriert(L, hvalue(obj), mt);
-      break;
-    }
-    case LUA_TUSERDATA: {
-      uvalue(obj)->metatable = mt;
-      if (mt)
-        luaC_objbarrier(L, rawuvalue(obj), mt);
-      break;
-    }
-    default: {
-      G(L)->mt[ttype(obj)] = mt;
-      break;
-    }
-  }
-  L->top--;
-  lua_unlock(L);
-  return 1;
-}
-
-
-LUA_API int lua_setfenv (lua_State *L, int idx) {
-  StkId o;
-  int res = 1;
-  lua_lock(L);
-  api_checknelems(L, 1);
-  o = index2adr(L, idx);
-  api_checkvalidindex(L, o);
-  api_check(L, ttistable(L->top - 1));
-  switch (ttype(o)) {
-    case LUA_TFUNCTION:
-      clvalue(o)->c.env = hvalue(L->top - 1);
-      break;
-    case LUA_TUSERDATA:
-      uvalue(o)->env = hvalue(L->top - 1);
-      break;
-    case LUA_TTHREAD:
-      sethvalue(L, gt(thvalue(o)), hvalue(L->top - 1));
-      break;
-    default:
-      res = 0;
-      break;
-  }
-  if (res) luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1));
-  L->top--;
-  lua_unlock(L);
-  return res;
-}
-
-
-/*
-** `load' and `call' functions (run Lua code)
-*/
-
-
-#define adjustresults(L,nres) \
-    { if (nres == LUA_MULTRET && L->top >= L->ci->top) L->ci->top = L->top; }
-
-
-#define checkresults(L,na,nr) \
-     api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)))
-	
-
-LUA_API void lua_call (lua_State *L, int nargs, int nresults) {
-  StkId func;
-  lua_lock(L);
-  api_checknelems(L, nargs+1);
-  checkresults(L, nargs, nresults);
-  func = L->top - (nargs+1);
-  luaD_call(L, func, nresults);
-  adjustresults(L, nresults);
-  lua_unlock(L);
-}
-
-
-
-/*
-** Execute a protected call.
-*/
-struct CallS {  /* data to `f_call' */
-  StkId func;
-  int nresults;
-};
-
-
-static void f_call (lua_State *L, void *ud) {
-  struct CallS *c = cast(struct CallS *, ud);
-  luaD_call(L, c->func, c->nresults);
-}
-
-
-
-LUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc) {
-  struct CallS c;
-  int status;
-  ptrdiff_t func;
-  lua_lock(L);
-  api_checknelems(L, nargs+1);
-  checkresults(L, nargs, nresults);
-  if (errfunc == 0)
-    func = 0;
-  else {
-    StkId o = index2adr(L, errfunc);
-    api_checkvalidindex(L, o);
-    func = savestack(L, o);
-  }
-  c.func = L->top - (nargs+1);  /* function to be called */
-  c.nresults = nresults;
-  status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func);
-  adjustresults(L, nresults);
-  lua_unlock(L);
-  return status;
-}
-
-
-/*
-** Execute a protected C call.
-*/
-struct CCallS {  /* data to `f_Ccall' */
-  lua_CFunction func;
-  void *ud;
-};
-
-
-static void f_Ccall (lua_State *L, void *ud) {
-  struct CCallS *c = cast(struct CCallS *, ud);
-  Closure *cl;
-  cl = luaF_newCclosure(L, 0, getcurrenv(L));
-  cl->c.f = c->func;
-  setclvalue(L, L->top, cl);  /* push function */
-  api_incr_top(L);
-  setpvalue(L->top, c->ud);  /* push only argument */
-  api_incr_top(L);
-  luaD_call(L, L->top - 2, 0);
-}
-
-
-LUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud) {
-  struct CCallS c;
-  int status;
-  lua_lock(L);
-  c.func = func;
-  c.ud = ud;
-  status = luaD_pcall(L, f_Ccall, &c, savestack(L, L->top), 0);
-  lua_unlock(L);
-  return status;
-}
-
-
-LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data,
-                      const char *chunkname) {
-  ZIO z;
-  int status;
-  lua_lock(L);
-  if (!chunkname) chunkname = "?";
-  luaZ_init(L, &z, reader, data);
-  status = luaD_protectedparser(L, &z, chunkname);
-  lua_unlock(L);
-  return status;
-}
-
-
-LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) {
-  int status;
-  TValue *o;
-  lua_lock(L);
-  api_checknelems(L, 1);
-  o = L->top - 1;
-  if (isLfunction(o))
-    status = luaU_dump(L, clvalue(o)->l.p, writer, data, 0);
-  else
-    status = 1;
-  lua_unlock(L);
-  return status;
-}
-
-
-LUA_API int  lua_status (lua_State *L) {
-  return L->status;
-}
-
-
-/*
-** Garbage-collection function
-*/
-
-LUA_API int lua_gc (lua_State *L, int what, int data) {
-  int res = 0;
-  global_State *g;
-  lua_lock(L);
-  g = G(L);
-  switch (what) {
-    case LUA_GCSTOP: {
-      g->GCthreshold = MAX_LUMEM;
-      break;
-    }
-    case LUA_GCRESTART: {
-      g->GCthreshold = g->totalbytes;
-      break;
-    }
-    case LUA_GCCOLLECT: {
-      luaC_fullgc(L);
-      break;
-    }
-    case LUA_GCCOUNT: {
-      /* GC values are expressed in Kbytes: #bytes/2^10 */
-      res = cast_int(g->totalbytes >> 10);
-      break;
-    }
-    case LUA_GCCOUNTB: {
-      res = cast_int(g->totalbytes & 0x3ff);
-      break;
-    }
-    case LUA_GCSTEP: {
-      lu_mem a = (cast(lu_mem, data) << 10);
-      if (a <= g->totalbytes)
-        g->GCthreshold = g->totalbytes - a;
-      else
-        g->GCthreshold = 0;
-      while (g->GCthreshold <= g->totalbytes) {
-        luaC_step(L);
-        if (g->gcstate == GCSpause) {  /* end of cycle? */
-          res = 1;  /* signal it */
-          break;
-        }
-      }
-      break;
-    }
-    case LUA_GCSETPAUSE: {
-      res = g->gcpause;
-      g->gcpause = data;
-      break;
-    }
-    case LUA_GCSETSTEPMUL: {
-      res = g->gcstepmul;
-      g->gcstepmul = data;
-      break;
-    }
-    default: res = -1;  /* invalid option */
-  }
-  lua_unlock(L);
-  return res;
-}
-
-
-
-/*
-** miscellaneous functions
-*/
-
-
-LUA_API int lua_error (lua_State *L) {
-  lua_lock(L);
-  api_checknelems(L, 1);
-  luaG_errormsg(L);
-  lua_unlock(L);
-  return 0;  /* to avoid warnings */
-}
-
-
-LUA_API int lua_next (lua_State *L, int idx) {
-  StkId t;
-  int more;
-  lua_lock(L);
-  t = index2adr(L, idx);
-  api_check(L, ttistable(t));
-  more = luaH_next(L, hvalue(t), L->top - 1);
-  if (more) {
-    api_incr_top(L);
-  }
-  else  /* no more elements */
-    L->top -= 1;  /* remove key */
-  lua_unlock(L);
-  return more;
-}
-
-
-LUA_API void lua_concat (lua_State *L, int n) {
-  lua_lock(L);
-  api_checknelems(L, n);
-  if (n >= 2) {
-    luaC_checkGC(L);
-    luaV_concat(L, n, cast_int(L->top - L->base) - 1);
-    L->top -= (n-1);
-  }
-  else if (n == 0) {  /* push empty string */
-    setsvalue2s(L, L->top, luaS_newlstr(L, "", 0));
-    api_incr_top(L);
-  }
-  /* else n == 1; nothing to do */
-  lua_unlock(L);
-}
-
-
-LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) {
-  lua_Alloc f;
-  lua_lock(L);
-  if (ud) *ud = G(L)->ud;
-  f = G(L)->frealloc;
-  lua_unlock(L);
-  return f;
-}
-
-
-LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) {
-  lua_lock(L);
-  G(L)->ud = ud;
-  G(L)->frealloc = f;
-  lua_unlock(L);
-}
-
-
-LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
-  Udata *u;
-  lua_lock(L);
-  luaC_checkGC(L);
-  u = luaS_newudata(L, size, getcurrenv(L));
-  setuvalue(L, L->top, u);
-  api_incr_top(L);
-  lua_unlock(L);
-  return u + 1;
-}
-
-
-
-
-static const char *aux_upvalue (StkId fi, int n, TValue **val) {
-  Closure *f;
-  if (!ttisfunction(fi)) return NULL;
-  f = clvalue(fi);
-  if (f->c.isC) {
-    if (!(1 <= n && n <= f->c.nupvalues)) return NULL;
-    *val = &f->c.upvalue[n-1];
-    return "";
-  }
-  else {
-    Proto *p = f->l.p;
-    if (!(1 <= n && n <= p->sizeupvalues)) return NULL;
-    *val = f->l.upvals[n-1]->v;
-    return getstr(p->upvalues[n-1]);
-  }
-}
-
-
-LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) {
-  const char *name;
-  TValue *val;
-  lua_lock(L);
-  name = aux_upvalue(index2adr(L, funcindex), n, &val);
-  if (name) {
-    setobj2s(L, L->top, val);
-    api_incr_top(L);
-  }
-  lua_unlock(L);
-  return name;
-}
-
-
-LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) {
-  const char *name;
-  TValue *val;
-  StkId fi;
-  lua_lock(L);
-  fi = index2adr(L, funcindex);
-  api_checknelems(L, 1);
-  name = aux_upvalue(fi, n, &val);
-  if (name) {
-    L->top--;
-    setobj(L, val, L->top);
-    luaC_barrier(L, clvalue(fi), L->top);
-  }
-  lua_unlock(L);
-  return name;
-}
-
diff --git a/redis-stable/deps/lua/src/lapi.h b/redis-stable/deps/lua/src/lapi.h
deleted file mode 100644
index 2c3fab24..00000000
--- a/redis-stable/deps/lua/src/lapi.h
+++ /dev/null
@@ -1,16 +0,0 @@
-/*
-** $Id: lapi.h,v 2.2.1.1 2007/12/27 13:02:25 roberto Exp $
-** Auxiliary functions from Lua API
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lapi_h
-#define lapi_h
-
-
-#include "lobject.h"
-
-
-LUAI_FUNC void luaA_pushobject (lua_State *L, const TValue *o);
-
-#endif
diff --git a/redis-stable/deps/lua/src/lauxlib.c b/redis-stable/deps/lua/src/lauxlib.c
deleted file mode 100644
index 751f1e88..00000000
--- a/redis-stable/deps/lua/src/lauxlib.c
+++ /dev/null
@@ -1,652 +0,0 @@
-/*
-** $Id: lauxlib.c,v 1.159.1.3 2008/01/21 13:20:51 roberto Exp $
-** Auxiliary functions for building Lua libraries
-** See Copyright Notice in lua.h
-*/
-
-
-#include <ctype.h>
-#include <errno.h>
-#include <stdarg.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-
-/* This file uses only the official API of Lua.
-** Any function declared here could be written as an application function.
-*/
-
-#define lauxlib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-
-
-#define FREELIST_REF	0	/* free list of references */
-
-
-/* convert a stack index to positive */
-#define abs_index(L, i)		((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \
-					lua_gettop(L) + (i) + 1)
-
-
-/*
-** {======================================================
-** Error-report functions
-** =======================================================
-*/
-
-
-LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
-  lua_Debug ar;
-  if (!lua_getstack(L, 0, &ar))  /* no stack frame? */
-    return luaL_error(L, "bad argument #%d (%s)", narg, extramsg);
-  lua_getinfo(L, "n", &ar);
-  if (strcmp(ar.namewhat, "method") == 0) {
-    narg--;  /* do not count `self' */
-    if (narg == 0)  /* error is in the self argument itself? */
-      return luaL_error(L, "calling " LUA_QS " on bad self (%s)",
-                           ar.name, extramsg);
-  }
-  if (ar.name == NULL)
-    ar.name = "?";
-  return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)",
-                        narg, ar.name, extramsg);
-}
-
-
-LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {
-  const char *msg = lua_pushfstring(L, "%s expected, got %s",
-                                    tname, luaL_typename(L, narg));
-  return luaL_argerror(L, narg, msg);
-}
-
-
-static void tag_error (lua_State *L, int narg, int tag) {
-  luaL_typerror(L, narg, lua_typename(L, tag));
-}
-
-
-LUALIB_API void luaL_where (lua_State *L, int level) {
-  lua_Debug ar;
-  if (lua_getstack(L, level, &ar)) {  /* check function at level */
-    lua_getinfo(L, "Sl", &ar);  /* get info about it */
-    if (ar.currentline > 0) {  /* is there info? */
-      lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
-      return;
-    }
-  }
-  lua_pushliteral(L, "");  /* else, no information available... */
-}
-
-
-LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
-  va_list argp;
-  va_start(argp, fmt);
-  luaL_where(L, 1);
-  lua_pushvfstring(L, fmt, argp);
-  va_end(argp);
-  lua_concat(L, 2);
-  return lua_error(L);
-}
-
-/* }====================================================== */
-
-
-LUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def,
-                                 const char *const lst[]) {
-  const char *name = (def) ? luaL_optstring(L, narg, def) :
-                             luaL_checkstring(L, narg);
-  int i;
-  for (i=0; lst[i]; i++)
-    if (strcmp(lst[i], name) == 0)
-      return i;
-  return luaL_argerror(L, narg,
-                       lua_pushfstring(L, "invalid option " LUA_QS, name));
-}
-
-
-LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
-  lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get registry.name */
-  if (!lua_isnil(L, -1))  /* name already in use? */
-    return 0;  /* leave previous value on top, but return 0 */
-  lua_pop(L, 1);
-  lua_newtable(L);  /* create metatable */
-  lua_pushvalue(L, -1);
-  lua_setfield(L, LUA_REGISTRYINDEX, tname);  /* registry.name = metatable */
-  return 1;
-}
-
-
-LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
-  void *p = lua_touserdata(L, ud);
-  if (p != NULL) {  /* value is a userdata? */
-    if (lua_getmetatable(L, ud)) {  /* does it have a metatable? */
-      lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get correct metatable */
-      if (lua_rawequal(L, -1, -2)) {  /* does it have the correct mt? */
-        lua_pop(L, 2);  /* remove both metatables */
-        return p;
-      }
-    }
-  }
-  luaL_typerror(L, ud, tname);  /* else error */
-  return NULL;  /* to avoid warnings */
-}
-
-
-LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
-  if (!lua_checkstack(L, space))
-    luaL_error(L, "stack overflow (%s)", mes);
-}
-
-
-LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
-  if (lua_type(L, narg) != t)
-    tag_error(L, narg, t);
-}
-
-
-LUALIB_API void luaL_checkany (lua_State *L, int narg) {
-  if (lua_type(L, narg) == LUA_TNONE)
-    luaL_argerror(L, narg, "value expected");
-}
-
-
-LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
-  const char *s = lua_tolstring(L, narg, len);
-  if (!s) tag_error(L, narg, LUA_TSTRING);
-  return s;
-}
-
-
-LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
-                                        const char *def, size_t *len) {
-  if (lua_isnoneornil(L, narg)) {
-    if (len)
-      *len = (def ? strlen(def) : 0);
-    return def;
-  }
-  else return luaL_checklstring(L, narg, len);
-}
-
-
-LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
-  lua_Number d = lua_tonumber(L, narg);
-  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */
-    tag_error(L, narg, LUA_TNUMBER);
-  return d;
-}
-
-
-LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
-  return luaL_opt(L, luaL_checknumber, narg, def);
-}
-
-
-LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {
-  lua_Integer d = lua_tointeger(L, narg);
-  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */
-    tag_error(L, narg, LUA_TNUMBER);
-  return d;
-}
-
-
-LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg,
-                                                      lua_Integer def) {
-  return luaL_opt(L, luaL_checkinteger, narg, def);
-}
-
-
-LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
-  if (!lua_getmetatable(L, obj))  /* no metatable? */
-    return 0;
-  lua_pushstring(L, event);
-  lua_rawget(L, -2);
-  if (lua_isnil(L, -1)) {
-    lua_pop(L, 2);  /* remove metatable and metafield */
-    return 0;
-  }
-  else {
-    lua_remove(L, -2);  /* remove only metatable */
-    return 1;
-  }
-}
-
-
-LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
-  obj = abs_index(L, obj);
-  if (!luaL_getmetafield(L, obj, event))  /* no metafield? */
-    return 0;
-  lua_pushvalue(L, obj);
-  lua_call(L, 1, 1);
-  return 1;
-}
-
-
-LUALIB_API void (luaL_register) (lua_State *L, const char *libname,
-                                const luaL_Reg *l) {
-  luaI_openlib(L, libname, l, 0);
-}
-
-
-static int libsize (const luaL_Reg *l) {
-  int size = 0;
-  for (; l->name; l++) size++;
-  return size;
-}
-
-
-LUALIB_API void luaI_openlib (lua_State *L, const char *libname,
-                              const luaL_Reg *l, int nup) {
-  if (libname) {
-    int size = libsize(l);
-    /* check whether lib already exists */
-    luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1);
-    lua_getfield(L, -1, libname);  /* get _LOADED[libname] */
-    if (!lua_istable(L, -1)) {  /* not found? */
-      lua_pop(L, 1);  /* remove previous result */
-      /* try global variable (and create one if it does not exist) */
-      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)
-        luaL_error(L, "name conflict for module " LUA_QS, libname);
-      lua_pushvalue(L, -1);
-      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */
-    }
-    lua_remove(L, -2);  /* remove _LOADED table */
-    lua_insert(L, -(nup+1));  /* move library table to below upvalues */
-  }
-  for (; l->name; l++) {
-    int i;
-    for (i=0; i<nup; i++)  /* copy upvalues to the top */
-      lua_pushvalue(L, -nup);
-    lua_pushcclosure(L, l->func, nup);
-    lua_setfield(L, -(nup+2), l->name);
-  }
-  lua_pop(L, nup);  /* remove upvalues */
-}
-
-
-
-/*
-** {======================================================
-** getn-setn: size for arrays
-** =======================================================
-*/
-
-#if defined(LUA_COMPAT_GETN)
-
-static int checkint (lua_State *L, int topop) {
-  int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1;
-  lua_pop(L, topop);
-  return n;
-}
-
-
-static void getsizes (lua_State *L) {
-  lua_getfield(L, LUA_REGISTRYINDEX, "LUA_SIZES");
-  if (lua_isnil(L, -1)) {  /* no `size' table? */
-    lua_pop(L, 1);  /* remove nil */
-    lua_newtable(L);  /* create it */
-    lua_pushvalue(L, -1);  /* `size' will be its own metatable */
-    lua_setmetatable(L, -2);
-    lua_pushliteral(L, "kv");
-    lua_setfield(L, -2, "__mode");  /* metatable(N).__mode = "kv" */
-    lua_pushvalue(L, -1);
-    lua_setfield(L, LUA_REGISTRYINDEX, "LUA_SIZES");  /* store in register */
-  }
-}
-
-
-LUALIB_API void luaL_setn (lua_State *L, int t, int n) {
-  t = abs_index(L, t);
-  lua_pushliteral(L, "n");
-  lua_rawget(L, t);
-  if (checkint(L, 1) >= 0) {  /* is there a numeric field `n'? */
-    lua_pushliteral(L, "n");  /* use it */
-    lua_pushinteger(L, n);
-    lua_rawset(L, t);
-  }
-  else {  /* use `sizes' */
-    getsizes(L);
-    lua_pushvalue(L, t);
-    lua_pushinteger(L, n);
-    lua_rawset(L, -3);  /* sizes[t] = n */
-    lua_pop(L, 1);  /* remove `sizes' */
-  }
-}
-
-
-LUALIB_API int luaL_getn (lua_State *L, int t) {
-  int n;
-  t = abs_index(L, t);
-  lua_pushliteral(L, "n");  /* try t.n */
-  lua_rawget(L, t);
-  if ((n = checkint(L, 1)) >= 0) return n;
-  getsizes(L);  /* else try sizes[t] */
-  lua_pushvalue(L, t);
-  lua_rawget(L, -2);
-  if ((n = checkint(L, 2)) >= 0) return n;
-  return (int)lua_objlen(L, t);
-}
-
-#endif
-
-/* }====================================================== */
-
-
-
-LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,
-                                                               const char *r) {
-  const char *wild;
-  size_t l = strlen(p);
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  while ((wild = strstr(s, p)) != NULL) {
-    luaL_addlstring(&b, s, wild - s);  /* push prefix */
-    luaL_addstring(&b, r);  /* push replacement in place of pattern */
-    s = wild + l;  /* continue after `p' */
-  }
-  luaL_addstring(&b, s);  /* push last suffix */
-  luaL_pushresult(&b);
-  return lua_tostring(L, -1);
-}
-
-
-LUALIB_API const char *luaL_findtable (lua_State *L, int idx,
-                                       const char *fname, int szhint) {
-  const char *e;
-  lua_pushvalue(L, idx);
-  do {
-    e = strchr(fname, '.');
-    if (e == NULL) e = fname + strlen(fname);
-    lua_pushlstring(L, fname, e - fname);
-    lua_rawget(L, -2);
-    if (lua_isnil(L, -1)) {  /* no such field? */
-      lua_pop(L, 1);  /* remove this nil */
-      lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */
-      lua_pushlstring(L, fname, e - fname);
-      lua_pushvalue(L, -2);
-      lua_settable(L, -4);  /* set new table into field */
-    }
-    else if (!lua_istable(L, -1)) {  /* field has a non-table value? */
-      lua_pop(L, 2);  /* remove table and value */
-      return fname;  /* return problematic part of the name */
-    }
-    lua_remove(L, -2);  /* remove previous table */
-    fname = e + 1;
-  } while (*e == '.');
-  return NULL;
-}
-
-
-
-/*
-** {======================================================
-** Generic Buffer manipulation
-** =======================================================
-*/
-
-
-#define bufflen(B)	((B)->p - (B)->buffer)
-#define bufffree(B)	((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
-
-#define LIMIT	(LUA_MINSTACK/2)
-
-
-static int emptybuffer (luaL_Buffer *B) {
-  size_t l = bufflen(B);
-  if (l == 0) return 0;  /* put nothing on stack */
-  else {
-    lua_pushlstring(B->L, B->buffer, l);
-    B->p = B->buffer;
-    B->lvl++;
-    return 1;
-  }
-}
-
-
-static void adjuststack (luaL_Buffer *B) {
-  if (B->lvl > 1) {
-    lua_State *L = B->L;
-    int toget = 1;  /* number of levels to concat */
-    size_t toplen = lua_strlen(L, -1);
-    do {
-      size_t l = lua_strlen(L, -(toget+1));
-      if (B->lvl - toget + 1 >= LIMIT || toplen > l) {
-        toplen += l;
-        toget++;
-      }
-      else break;
-    } while (toget < B->lvl);
-    lua_concat(L, toget);
-    B->lvl = B->lvl - toget + 1;
-  }
-}
-
-
-LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
-  if (emptybuffer(B))
-    adjuststack(B);
-  return B->buffer;
-}
-
-
-LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
-  while (l--)
-    luaL_addchar(B, *s++);
-}
-
-
-LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
-  luaL_addlstring(B, s, strlen(s));
-}
-
-
-LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
-  emptybuffer(B);
-  lua_concat(B->L, B->lvl);
-  B->lvl = 1;
-}
-
-
-LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
-  lua_State *L = B->L;
-  size_t vl;
-  const char *s = lua_tolstring(L, -1, &vl);
-  if (vl <= bufffree(B)) {  /* fit into buffer? */
-    memcpy(B->p, s, vl);  /* put it there */
-    B->p += vl;
-    lua_pop(L, 1);  /* remove from stack */
-  }
-  else {
-    if (emptybuffer(B))
-      lua_insert(L, -2);  /* put buffer before new value */
-    B->lvl++;  /* add new value into B stack */
-    adjuststack(B);
-  }
-}
-
-
-LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
-  B->L = L;
-  B->p = B->buffer;
-  B->lvl = 0;
-}
-
-/* }====================================================== */
-
-
-LUALIB_API int luaL_ref (lua_State *L, int t) {
-  int ref;
-  t = abs_index(L, t);
-  if (lua_isnil(L, -1)) {
-    lua_pop(L, 1);  /* remove from stack */
-    return LUA_REFNIL;  /* `nil' has a unique fixed reference */
-  }
-  lua_rawgeti(L, t, FREELIST_REF);  /* get first free element */
-  ref = (int)lua_tointeger(L, -1);  /* ref = t[FREELIST_REF] */
-  lua_pop(L, 1);  /* remove it from stack */
-  if (ref != 0) {  /* any free element? */
-    lua_rawgeti(L, t, ref);  /* remove it from list */
-    lua_rawseti(L, t, FREELIST_REF);  /* (t[FREELIST_REF] = t[ref]) */
-  }
-  else {  /* no free elements */
-    ref = (int)lua_objlen(L, t);
-    ref++;  /* create new reference */
-  }
-  lua_rawseti(L, t, ref);
-  return ref;
-}
-
-
-LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
-  if (ref >= 0) {
-    t = abs_index(L, t);
-    lua_rawgeti(L, t, FREELIST_REF);
-    lua_rawseti(L, t, ref);  /* t[ref] = t[FREELIST_REF] */
-    lua_pushinteger(L, ref);
-    lua_rawseti(L, t, FREELIST_REF);  /* t[FREELIST_REF] = ref */
-  }
-}
-
-
-
-/*
-** {======================================================
-** Load functions
-** =======================================================
-*/
-
-typedef struct LoadF {
-  int extraline;
-  FILE *f;
-  char buff[LUAL_BUFFERSIZE];
-} LoadF;
-
-
-static const char *getF (lua_State *L, void *ud, size_t *size) {
-  LoadF *lf = (LoadF *)ud;
-  (void)L;
-  if (lf->extraline) {
-    lf->extraline = 0;
-    *size = 1;
-    return "\n";
-  }
-  if (feof(lf->f)) return NULL;
-  *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f);
-  return (*size > 0) ? lf->buff : NULL;
-}
-
-
-static int errfile (lua_State *L, const char *what, int fnameindex) {
-  const char *serr = strerror(errno);
-  const char *filename = lua_tostring(L, fnameindex) + 1;
-  lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
-  lua_remove(L, fnameindex);
-  return LUA_ERRFILE;
-}
-
-
-LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
-  LoadF lf;
-  int status, readstatus;
-  int c;
-  int fnameindex = lua_gettop(L) + 1;  /* index of filename on the stack */
-  lf.extraline = 0;
-  if (filename == NULL) {
-    lua_pushliteral(L, "=stdin");
-    lf.f = stdin;
-  }
-  else {
-    lua_pushfstring(L, "@%s", filename);
-    lf.f = fopen(filename, "r");
-    if (lf.f == NULL) return errfile(L, "open", fnameindex);
-  }
-  c = getc(lf.f);
-  if (c == '#') {  /* Unix exec. file? */
-    lf.extraline = 1;
-    while ((c = getc(lf.f)) != EOF && c != '\n') ;  /* skip first line */
-    if (c == '\n') c = getc(lf.f);
-  }
-  if (c == LUA_SIGNATURE[0] && filename) {  /* binary file? */
-    lf.f = freopen(filename, "rb", lf.f);  /* reopen in binary mode */
-    if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
-    /* skip eventual `#!...' */
-   while ((c = getc(lf.f)) != EOF && c != LUA_SIGNATURE[0]) ;
-   lf.extraline = 0;
-  }
-  ungetc(c, lf.f);
-  status = lua_load(L, getF, &lf, lua_tostring(L, -1));
-  readstatus = ferror(lf.f);
-  if (filename) fclose(lf.f);  /* close file (even in case of errors) */
-  if (readstatus) {
-    lua_settop(L, fnameindex);  /* ignore results from `lua_load' */
-    return errfile(L, "read", fnameindex);
-  }
-  lua_remove(L, fnameindex);
-  return status;
-}
-
-
-typedef struct LoadS {
-  const char *s;
-  size_t size;
-} LoadS;
-
-
-static const char *getS (lua_State *L, void *ud, size_t *size) {
-  LoadS *ls = (LoadS *)ud;
-  (void)L;
-  if (ls->size == 0) return NULL;
-  *size = ls->size;
-  ls->size = 0;
-  return ls->s;
-}
-
-
-LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,
-                                const char *name) {
-  LoadS ls;
-  ls.s = buff;
-  ls.size = size;
-  return lua_load(L, getS, &ls, name);
-}
-
-
-LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s) {
-  return luaL_loadbuffer(L, s, strlen(s), s);
-}
-
-
-
-/* }====================================================== */
-
-
-static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
-  (void)ud;
-  (void)osize;
-  if (nsize == 0) {
-    free(ptr);
-    return NULL;
-  }
-  else
-    return realloc(ptr, nsize);
-}
-
-
-static int panic (lua_State *L) {
-  (void)L;  /* to avoid warnings */
-  fprintf(stderr, "PANIC: unprotected error in call to Lua API (%s)\n",
-                   lua_tostring(L, -1));
-  return 0;
-}
-
-
-LUALIB_API lua_State *luaL_newstate (void) {
-  lua_State *L = lua_newstate(l_alloc, NULL);
-  if (L) lua_atpanic(L, &panic);
-  return L;
-}
-
diff --git a/redis-stable/deps/lua/src/lauxlib.h b/redis-stable/deps/lua/src/lauxlib.h
deleted file mode 100644
index 34258235..00000000
--- a/redis-stable/deps/lua/src/lauxlib.h
+++ /dev/null
@@ -1,174 +0,0 @@
-/*
-** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 roberto Exp $
-** Auxiliary functions for building Lua libraries
-** See Copyright Notice in lua.h
-*/
-
-
-#ifndef lauxlib_h
-#define lauxlib_h
-
-
-#include <stddef.h>
-#include <stdio.h>
-
-#include "lua.h"
-
-
-#if defined(LUA_COMPAT_GETN)
-LUALIB_API int (luaL_getn) (lua_State *L, int t);
-LUALIB_API void (luaL_setn) (lua_State *L, int t, int n);
-#else
-#define luaL_getn(L,i)          ((int)lua_objlen(L, i))
-#define luaL_setn(L,i,j)        ((void)0)  /* no op! */
-#endif
-
-#if defined(LUA_COMPAT_OPENLIB)
-#define luaI_openlib	luaL_openlib
-#endif
-
-
-/* extra error code for `luaL_load' */
-#define LUA_ERRFILE     (LUA_ERRERR+1)
-
-
-typedef struct luaL_Reg {
-  const char *name;
-  lua_CFunction func;
-} luaL_Reg;
-
-
-
-LUALIB_API void (luaI_openlib) (lua_State *L, const char *libname,
-                                const luaL_Reg *l, int nup);
-LUALIB_API void (luaL_register) (lua_State *L, const char *libname,
-                                const luaL_Reg *l);
-LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e);
-LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e);
-LUALIB_API int (luaL_typerror) (lua_State *L, int narg, const char *tname);
-LUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg);
-LUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg,
-                                                          size_t *l);
-LUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg,
-                                          const char *def, size_t *l);
-LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg);
-LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def);
-
-LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);
-LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,
-                                          lua_Integer def);
-
-LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);
-LUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t);
-LUALIB_API void (luaL_checkany) (lua_State *L, int narg);
-
-LUALIB_API int   (luaL_newmetatable) (lua_State *L, const char *tname);
-LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname);
-
-LUALIB_API void (luaL_where) (lua_State *L, int lvl);
-LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);
-
-LUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,
-                                   const char *const lst[]);
-
-LUALIB_API int (luaL_ref) (lua_State *L, int t);
-LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref);
-
-LUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename);
-LUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,
-                                  const char *name);
-LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);
-
-LUALIB_API lua_State *(luaL_newstate) (void);
-
-
-LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,
-                                                  const char *r);
-
-LUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,
-                                         const char *fname, int szhint);
-
-
-
-
-/*
-** ===============================================================
-** some useful macros
-** ===============================================================
-*/
-
-#define luaL_argcheck(L, cond,numarg,extramsg)	\
-		((void)((cond) || luaL_argerror(L, (numarg), (extramsg))))
-#define luaL_checkstring(L,n)	(luaL_checklstring(L, (n), NULL))
-#define luaL_optstring(L,n,d)	(luaL_optlstring(L, (n), (d), NULL))
-#define luaL_checkint(L,n)	((int)luaL_checkinteger(L, (n)))
-#define luaL_optint(L,n,d)	((int)luaL_optinteger(L, (n), (d)))
-#define luaL_checklong(L,n)	((long)luaL_checkinteger(L, (n)))
-#define luaL_optlong(L,n,d)	((long)luaL_optinteger(L, (n), (d)))
-
-#define luaL_typename(L,i)	lua_typename(L, lua_type(L,(i)))
-
-#define luaL_dofile(L, fn) \
-	(luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))
-
-#define luaL_dostring(L, s) \
-	(luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))
-
-#define luaL_getmetatable(L,n)	(lua_getfield(L, LUA_REGISTRYINDEX, (n)))
-
-#define luaL_opt(L,f,n,d)	(lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))
-
-/*
-** {======================================================
-** Generic Buffer manipulation
-** =======================================================
-*/
-
-
-
-typedef struct luaL_Buffer {
-  char *p;			/* current position in buffer */
-  int lvl;  /* number of strings in the stack (level) */
-  lua_State *L;
-  char buffer[LUAL_BUFFERSIZE];
-} luaL_Buffer;
-
-#define luaL_addchar(B,c) \
-  ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \
-   (*(B)->p++ = (char)(c)))
-
-/* compatibility only */
-#define luaL_putchar(B,c)	luaL_addchar(B,c)
-
-#define luaL_addsize(B,n)	((B)->p += (n))
-
-LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B);
-LUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B);
-LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l);
-LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s);
-LUALIB_API void (luaL_addvalue) (luaL_Buffer *B);
-LUALIB_API void (luaL_pushresult) (luaL_Buffer *B);
-
-
-/* }====================================================== */
-
-
-/* compatibility with ref system */
-
-/* pre-defined references */
-#define LUA_NOREF       (-2)
-#define LUA_REFNIL      (-1)
-
-#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \
-      (lua_pushstring(L, "unlocked references are obsolete"), lua_error(L), 0))
-
-#define lua_unref(L,ref)        luaL_unref(L, LUA_REGISTRYINDEX, (ref))
-
-#define lua_getref(L,ref)       lua_rawgeti(L, LUA_REGISTRYINDEX, (ref))
-
-
-#define luaL_reg	luaL_Reg
-
-#endif
-
-
diff --git a/redis-stable/deps/lua/src/lbaselib.c b/redis-stable/deps/lua/src/lbaselib.c
deleted file mode 100644
index 2ab550bd..00000000
--- a/redis-stable/deps/lua/src/lbaselib.c
+++ /dev/null
@@ -1,653 +0,0 @@
-/*
-** $Id: lbaselib.c,v 1.191.1.6 2008/02/14 16:46:22 roberto Exp $
-** Basic library
-** See Copyright Notice in lua.h
-*/
-
-
-
-#include <ctype.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define lbaselib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-
-
-/*
-** If your system does not support `stdout', you can just remove this function.
-** If you need, you can define your own `print' function, following this
-** model but changing `fputs' to put the strings at a proper place
-** (a console window or a log file, for instance).
-*/
-static int luaB_print (lua_State *L) {
-  int n = lua_gettop(L);  /* number of arguments */
-  int i;
-  lua_getglobal(L, "tostring");
-  for (i=1; i<=n; i++) {
-    const char *s;
-    lua_pushvalue(L, -1);  /* function to be called */
-    lua_pushvalue(L, i);   /* value to print */
-    lua_call(L, 1, 1);
-    s = lua_tostring(L, -1);  /* get result */
-    if (s == NULL)
-      return luaL_error(L, LUA_QL("tostring") " must return a string to "
-                           LUA_QL("print"));
-    if (i>1) fputs("\t", stdout);
-    fputs(s, stdout);
-    lua_pop(L, 1);  /* pop result */
-  }
-  fputs("\n", stdout);
-  return 0;
-}
-
-
-static int luaB_tonumber (lua_State *L) {
-  int base = luaL_optint(L, 2, 10);
-  if (base == 10) {  /* standard conversion */
-    luaL_checkany(L, 1);
-    if (lua_isnumber(L, 1)) {
-      lua_pushnumber(L, lua_tonumber(L, 1));
-      return 1;
-    }
-  }
-  else {
-    const char *s1 = luaL_checkstring(L, 1);
-    char *s2;
-    unsigned long n;
-    luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range");
-    n = strtoul(s1, &s2, base);
-    if (s1 != s2) {  /* at least one valid digit? */
-      while (isspace((unsigned char)(*s2))) s2++;  /* skip trailing spaces */
-      if (*s2 == '\0') {  /* no invalid trailing characters? */
-        lua_pushnumber(L, (lua_Number)n);
-        return 1;
-      }
-    }
-  }
-  lua_pushnil(L);  /* else not a number */
-  return 1;
-}
-
-
-static int luaB_error (lua_State *L) {
-  int level = luaL_optint(L, 2, 1);
-  lua_settop(L, 1);
-  if (lua_isstring(L, 1) && level > 0) {  /* add extra information? */
-    luaL_where(L, level);
-    lua_pushvalue(L, 1);
-    lua_concat(L, 2);
-  }
-  return lua_error(L);
-}
-
-
-static int luaB_getmetatable (lua_State *L) {
-  luaL_checkany(L, 1);
-  if (!lua_getmetatable(L, 1)) {
-    lua_pushnil(L);
-    return 1;  /* no metatable */
-  }
-  luaL_getmetafield(L, 1, "__metatable");
-  return 1;  /* returns either __metatable field (if present) or metatable */
-}
-
-
-static int luaB_setmetatable (lua_State *L) {
-  int t = lua_type(L, 2);
-  luaL_checktype(L, 1, LUA_TTABLE);
-  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,
-                    "nil or table expected");
-  if (luaL_getmetafield(L, 1, "__metatable"))
-    luaL_error(L, "cannot change a protected metatable");
-  lua_settop(L, 2);
-  lua_setmetatable(L, 1);
-  return 1;
-}
-
-
-static void getfunc (lua_State *L, int opt) {
-  if (lua_isfunction(L, 1)) lua_pushvalue(L, 1);
-  else {
-    lua_Debug ar;
-    int level = opt ? luaL_optint(L, 1, 1) : luaL_checkint(L, 1);
-    luaL_argcheck(L, level >= 0, 1, "level must be non-negative");
-    if (lua_getstack(L, level, &ar) == 0)
-      luaL_argerror(L, 1, "invalid level");
-    lua_getinfo(L, "f", &ar);
-    if (lua_isnil(L, -1))
-      luaL_error(L, "no function environment for tail call at level %d",
-                    level);
-  }
-}
-
-
-static int luaB_getfenv (lua_State *L) {
-  getfunc(L, 1);
-  if (lua_iscfunction(L, -1))  /* is a C function? */
-    lua_pushvalue(L, LUA_GLOBALSINDEX);  /* return the thread's global env. */
-  else
-    lua_getfenv(L, -1);
-  return 1;
-}
-
-
-static int luaB_setfenv (lua_State *L) {
-  luaL_checktype(L, 2, LUA_TTABLE);
-  getfunc(L, 0);
-  lua_pushvalue(L, 2);
-  if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0) {
-    /* change environment of current thread */
-    lua_pushthread(L);
-    lua_insert(L, -2);
-    lua_setfenv(L, -2);
-    return 0;
-  }
-  else if (lua_iscfunction(L, -2) || lua_setfenv(L, -2) == 0)
-    luaL_error(L,
-          LUA_QL("setfenv") " cannot change environment of given object");
-  return 1;
-}
-
-
-static int luaB_rawequal (lua_State *L) {
-  luaL_checkany(L, 1);
-  luaL_checkany(L, 2);
-  lua_pushboolean(L, lua_rawequal(L, 1, 2));
-  return 1;
-}
-
-
-static int luaB_rawget (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  luaL_checkany(L, 2);
-  lua_settop(L, 2);
-  lua_rawget(L, 1);
-  return 1;
-}
-
-static int luaB_rawset (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  luaL_checkany(L, 2);
-  luaL_checkany(L, 3);
-  lua_settop(L, 3);
-  lua_rawset(L, 1);
-  return 1;
-}
-
-
-static int luaB_gcinfo (lua_State *L) {
-  lua_pushinteger(L, lua_getgccount(L));
-  return 1;
-}
-
-
-static int luaB_collectgarbage (lua_State *L) {
-  static const char *const opts[] = {"stop", "restart", "collect",
-    "count", "step", "setpause", "setstepmul", NULL};
-  static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT,
-    LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL};
-  int o = luaL_checkoption(L, 1, "collect", opts);
-  int ex = luaL_optint(L, 2, 0);
-  int res = lua_gc(L, optsnum[o], ex);
-  switch (optsnum[o]) {
-    case LUA_GCCOUNT: {
-      int b = lua_gc(L, LUA_GCCOUNTB, 0);
-      lua_pushnumber(L, res + ((lua_Number)b/1024));
-      return 1;
-    }
-    case LUA_GCSTEP: {
-      lua_pushboolean(L, res);
-      return 1;
-    }
-    default: {
-      lua_pushnumber(L, res);
-      return 1;
-    }
-  }
-}
-
-
-static int luaB_type (lua_State *L) {
-  luaL_checkany(L, 1);
-  lua_pushstring(L, luaL_typename(L, 1));
-  return 1;
-}
-
-
-static int luaB_next (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  lua_settop(L, 2);  /* create a 2nd argument if there isn't one */
-  if (lua_next(L, 1))
-    return 2;
-  else {
-    lua_pushnil(L);
-    return 1;
-  }
-}
-
-
-static int luaB_pairs (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */
-  lua_pushvalue(L, 1);  /* state, */
-  lua_pushnil(L);  /* and initial value */
-  return 3;
-}
-
-
-static int ipairsaux (lua_State *L) {
-  int i = luaL_checkint(L, 2);
-  luaL_checktype(L, 1, LUA_TTABLE);
-  i++;  /* next value */
-  lua_pushinteger(L, i);
-  lua_rawgeti(L, 1, i);
-  return (lua_isnil(L, -1)) ? 0 : 2;
-}
-
-
-static int luaB_ipairs (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */
-  lua_pushvalue(L, 1);  /* state, */
-  lua_pushinteger(L, 0);  /* and initial value */
-  return 3;
-}
-
-
-static int load_aux (lua_State *L, int status) {
-  if (status == 0)  /* OK? */
-    return 1;
-  else {
-    lua_pushnil(L);
-    lua_insert(L, -2);  /* put before error message */
-    return 2;  /* return nil plus error message */
-  }
-}
-
-
-static int luaB_loadstring (lua_State *L) {
-  size_t l;
-  const char *s = luaL_checklstring(L, 1, &l);
-  const char *chunkname = luaL_optstring(L, 2, s);
-  return load_aux(L, luaL_loadbuffer(L, s, l, chunkname));
-}
-
-
-static int luaB_loadfile (lua_State *L) {
-  const char *fname = luaL_optstring(L, 1, NULL);
-  return load_aux(L, luaL_loadfile(L, fname));
-}
-
-
-/*
-** Reader for generic `load' function: `lua_load' uses the
-** stack for internal stuff, so the reader cannot change the
-** stack top. Instead, it keeps its resulting string in a
-** reserved slot inside the stack.
-*/
-static const char *generic_reader (lua_State *L, void *ud, size_t *size) {
-  (void)ud;  /* to avoid warnings */
-  luaL_checkstack(L, 2, "too many nested functions");
-  lua_pushvalue(L, 1);  /* get function */
-  lua_call(L, 0, 1);  /* call it */
-  if (lua_isnil(L, -1)) {
-    *size = 0;
-    return NULL;
-  }
-  else if (lua_isstring(L, -1)) {
-    lua_replace(L, 3);  /* save string in a reserved stack slot */
-    return lua_tolstring(L, 3, size);
-  }
-  else luaL_error(L, "reader function must return a string");
-  return NULL;  /* to avoid warnings */
-}
-
-
-static int luaB_load (lua_State *L) {
-  int status;
-  const char *cname = luaL_optstring(L, 2, "=(load)");
-  luaL_checktype(L, 1, LUA_TFUNCTION);
-  lua_settop(L, 3);  /* function, eventual name, plus one reserved slot */
-  status = lua_load(L, generic_reader, NULL, cname);
-  return load_aux(L, status);
-}
-
-
-static int luaB_dofile (lua_State *L) {
-  const char *fname = luaL_optstring(L, 1, NULL);
-  int n = lua_gettop(L);
-  if (luaL_loadfile(L, fname) != 0) lua_error(L);
-  lua_call(L, 0, LUA_MULTRET);
-  return lua_gettop(L) - n;
-}
-
-
-static int luaB_assert (lua_State *L) {
-  luaL_checkany(L, 1);
-  if (!lua_toboolean(L, 1))
-    return luaL_error(L, "%s", luaL_optstring(L, 2, "assertion failed!"));
-  return lua_gettop(L);
-}
-
-
-static int luaB_unpack (lua_State *L) {
-  int i, e, n;
-  luaL_checktype(L, 1, LUA_TTABLE);
-  i = luaL_optint(L, 2, 1);
-  e = luaL_opt(L, luaL_checkint, 3, luaL_getn(L, 1));
-  if (i > e) return 0;  /* empty range */
-  n = e - i + 1;  /* number of elements */
-  if (n <= 0 || !lua_checkstack(L, n))  /* n <= 0 means arith. overflow */
-    return luaL_error(L, "too many results to unpack");
-  lua_rawgeti(L, 1, i);  /* push arg[i] (avoiding overflow problems) */
-  while (i++ < e)  /* push arg[i + 1...e] */
-    lua_rawgeti(L, 1, i);
-  return n;
-}
-
-
-static int luaB_select (lua_State *L) {
-  int n = lua_gettop(L);
-  if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') {
-    lua_pushinteger(L, n-1);
-    return 1;
-  }
-  else {
-    int i = luaL_checkint(L, 1);
-    if (i < 0) i = n + i;
-    else if (i > n) i = n;
-    luaL_argcheck(L, 1 <= i, 1, "index out of range");
-    return n - i;
-  }
-}
-
-
-static int luaB_pcall (lua_State *L) {
-  int status;
-  luaL_checkany(L, 1);
-  status = lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0);
-  lua_pushboolean(L, (status == 0));
-  lua_insert(L, 1);
-  return lua_gettop(L);  /* return status + all results */
-}
-
-
-static int luaB_xpcall (lua_State *L) {
-  int status;
-  luaL_checkany(L, 2);
-  lua_settop(L, 2);
-  lua_insert(L, 1);  /* put error function under function to be called */
-  status = lua_pcall(L, 0, LUA_MULTRET, 1);
-  lua_pushboolean(L, (status == 0));
-  lua_replace(L, 1);
-  return lua_gettop(L);  /* return status + all results */
-}
-
-
-static int luaB_tostring (lua_State *L) {
-  luaL_checkany(L, 1);
-  if (luaL_callmeta(L, 1, "__tostring"))  /* is there a metafield? */
-    return 1;  /* use its value */
-  switch (lua_type(L, 1)) {
-    case LUA_TNUMBER:
-      lua_pushstring(L, lua_tostring(L, 1));
-      break;
-    case LUA_TSTRING:
-      lua_pushvalue(L, 1);
-      break;
-    case LUA_TBOOLEAN:
-      lua_pushstring(L, (lua_toboolean(L, 1) ? "true" : "false"));
-      break;
-    case LUA_TNIL:
-      lua_pushliteral(L, "nil");
-      break;
-    default:
-      lua_pushfstring(L, "%s: %p", luaL_typename(L, 1), lua_topointer(L, 1));
-      break;
-  }
-  return 1;
-}
-
-
-static int luaB_newproxy (lua_State *L) {
-  lua_settop(L, 1);
-  lua_newuserdata(L, 0);  /* create proxy */
-  if (lua_toboolean(L, 1) == 0)
-    return 1;  /* no metatable */
-  else if (lua_isboolean(L, 1)) {
-    lua_newtable(L);  /* create a new metatable `m' ... */
-    lua_pushvalue(L, -1);  /* ... and mark `m' as a valid metatable */
-    lua_pushboolean(L, 1);
-    lua_rawset(L, lua_upvalueindex(1));  /* weaktable[m] = true */
-  }
-  else {
-    int validproxy = 0;  /* to check if weaktable[metatable(u)] == true */
-    if (lua_getmetatable(L, 1)) {
-      lua_rawget(L, lua_upvalueindex(1));
-      validproxy = lua_toboolean(L, -1);
-      lua_pop(L, 1);  /* remove value */
-    }
-    luaL_argcheck(L, validproxy, 1, "boolean or proxy expected");
-    lua_getmetatable(L, 1);  /* metatable is valid; get it */
-  }
-  lua_setmetatable(L, 2);
-  return 1;
-}
-
-
-static const luaL_Reg base_funcs[] = {
-  {"assert", luaB_assert},
-  {"collectgarbage", luaB_collectgarbage},
-  {"dofile", luaB_dofile},
-  {"error", luaB_error},
-  {"gcinfo", luaB_gcinfo},
-  {"getfenv", luaB_getfenv},
-  {"getmetatable", luaB_getmetatable},
-  {"loadfile", luaB_loadfile},
-  {"load", luaB_load},
-  {"loadstring", luaB_loadstring},
-  {"next", luaB_next},
-  {"pcall", luaB_pcall},
-  {"print", luaB_print},
-  {"rawequal", luaB_rawequal},
-  {"rawget", luaB_rawget},
-  {"rawset", luaB_rawset},
-  {"select", luaB_select},
-  {"setfenv", luaB_setfenv},
-  {"setmetatable", luaB_setmetatable},
-  {"tonumber", luaB_tonumber},
-  {"tostring", luaB_tostring},
-  {"type", luaB_type},
-  {"unpack", luaB_unpack},
-  {"xpcall", luaB_xpcall},
-  {NULL, NULL}
-};
-
-
-/*
-** {======================================================
-** Coroutine library
-** =======================================================
-*/
-
-#define CO_RUN	0	/* running */
-#define CO_SUS	1	/* suspended */
-#define CO_NOR	2	/* 'normal' (it resumed another coroutine) */
-#define CO_DEAD	3
-
-static const char *const statnames[] =
-    {"running", "suspended", "normal", "dead"};
-
-static int costatus (lua_State *L, lua_State *co) {
-  if (L == co) return CO_RUN;
-  switch (lua_status(co)) {
-    case LUA_YIELD:
-      return CO_SUS;
-    case 0: {
-      lua_Debug ar;
-      if (lua_getstack(co, 0, &ar) > 0)  /* does it have frames? */
-        return CO_NOR;  /* it is running */
-      else if (lua_gettop(co) == 0)
-          return CO_DEAD;
-      else
-        return CO_SUS;  /* initial state */
-    }
-    default:  /* some error occured */
-      return CO_DEAD;
-  }
-}
-
-
-static int luaB_costatus (lua_State *L) {
-  lua_State *co = lua_tothread(L, 1);
-  luaL_argcheck(L, co, 1, "coroutine expected");
-  lua_pushstring(L, statnames[costatus(L, co)]);
-  return 1;
-}
-
-
-static int auxresume (lua_State *L, lua_State *co, int narg) {
-  int status = costatus(L, co);
-  if (!lua_checkstack(co, narg))
-    luaL_error(L, "too many arguments to resume");
-  if (status != CO_SUS) {
-    lua_pushfstring(L, "cannot resume %s coroutine", statnames[status]);
-    return -1;  /* error flag */
-  }
-  lua_xmove(L, co, narg);
-  lua_setlevel(L, co);
-  status = lua_resume(co, narg);
-  if (status == 0 || status == LUA_YIELD) {
-    int nres = lua_gettop(co);
-    if (!lua_checkstack(L, nres + 1))
-      luaL_error(L, "too many results to resume");
-    lua_xmove(co, L, nres);  /* move yielded values */
-    return nres;
-  }
-  else {
-    lua_xmove(co, L, 1);  /* move error message */
-    return -1;  /* error flag */
-  }
-}
-
-
-static int luaB_coresume (lua_State *L) {
-  lua_State *co = lua_tothread(L, 1);
-  int r;
-  luaL_argcheck(L, co, 1, "coroutine expected");
-  r = auxresume(L, co, lua_gettop(L) - 1);
-  if (r < 0) {
-    lua_pushboolean(L, 0);
-    lua_insert(L, -2);
-    return 2;  /* return false + error message */
-  }
-  else {
-    lua_pushboolean(L, 1);
-    lua_insert(L, -(r + 1));
-    return r + 1;  /* return true + `resume' returns */
-  }
-}
-
-
-static int luaB_auxwrap (lua_State *L) {
-  lua_State *co = lua_tothread(L, lua_upvalueindex(1));
-  int r = auxresume(L, co, lua_gettop(L));
-  if (r < 0) {
-    if (lua_isstring(L, -1)) {  /* error object is a string? */
-      luaL_where(L, 1);  /* add extra info */
-      lua_insert(L, -2);
-      lua_concat(L, 2);
-    }
-    lua_error(L);  /* propagate error */
-  }
-  return r;
-}
-
-
-static int luaB_cocreate (lua_State *L) {
-  lua_State *NL = lua_newthread(L);
-  luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1,
-    "Lua function expected");
-  lua_pushvalue(L, 1);  /* move function to top */
-  lua_xmove(L, NL, 1);  /* move function from L to NL */
-  return 1;
-}
-
-
-static int luaB_cowrap (lua_State *L) {
-  luaB_cocreate(L);
-  lua_pushcclosure(L, luaB_auxwrap, 1);
-  return 1;
-}
-
-
-static int luaB_yield (lua_State *L) {
-  return lua_yield(L, lua_gettop(L));
-}
-
-
-static int luaB_corunning (lua_State *L) {
-  if (lua_pushthread(L))
-    lua_pushnil(L);  /* main thread is not a coroutine */
-  return 1;
-}
-
-
-static const luaL_Reg co_funcs[] = {
-  {"create", luaB_cocreate},
-  {"resume", luaB_coresume},
-  {"running", luaB_corunning},
-  {"status", luaB_costatus},
-  {"wrap", luaB_cowrap},
-  {"yield", luaB_yield},
-  {NULL, NULL}
-};
-
-/* }====================================================== */
-
-
-static void auxopen (lua_State *L, const char *name,
-                     lua_CFunction f, lua_CFunction u) {
-  lua_pushcfunction(L, u);
-  lua_pushcclosure(L, f, 1);
-  lua_setfield(L, -2, name);
-}
-
-
-static void base_open (lua_State *L) {
-  /* set global _G */
-  lua_pushvalue(L, LUA_GLOBALSINDEX);
-  lua_setglobal(L, "_G");
-  /* open lib into global table */
-  luaL_register(L, "_G", base_funcs);
-  lua_pushliteral(L, LUA_VERSION);
-  lua_setglobal(L, "_VERSION");  /* set global _VERSION */
-  /* `ipairs' and `pairs' need auxiliary functions as upvalues */
-  auxopen(L, "ipairs", luaB_ipairs, ipairsaux);
-  auxopen(L, "pairs", luaB_pairs, luaB_next);
-  /* `newproxy' needs a weaktable as upvalue */
-  lua_createtable(L, 0, 1);  /* new table `w' */
-  lua_pushvalue(L, -1);  /* `w' will be its own metatable */
-  lua_setmetatable(L, -2);
-  lua_pushliteral(L, "kv");
-  lua_setfield(L, -2, "__mode");  /* metatable(w).__mode = "kv" */
-  lua_pushcclosure(L, luaB_newproxy, 1);
-  lua_setglobal(L, "newproxy");  /* set global `newproxy' */
-}
-
-
-LUALIB_API int luaopen_base (lua_State *L) {
-  base_open(L);
-  luaL_register(L, LUA_COLIBNAME, co_funcs);
-  return 2;
-}
-
diff --git a/redis-stable/deps/lua/src/lcode.c b/redis-stable/deps/lua/src/lcode.c
deleted file mode 100644
index 679cb9cf..00000000
--- a/redis-stable/deps/lua/src/lcode.c
+++ /dev/null
@@ -1,831 +0,0 @@
-/*
-** $Id: lcode.c,v 2.25.1.5 2011/01/31 14:53:16 roberto Exp $
-** Code generator for Lua
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stdlib.h>
-
-#define lcode_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lcode.h"
-#include "ldebug.h"
-#include "ldo.h"
-#include "lgc.h"
-#include "llex.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lparser.h"
-#include "ltable.h"
-
-
-#define hasjumps(e)	((e)->t != (e)->f)
-
-
-static int isnumeral(expdesc *e) {
-  return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);
-}
-
-
-void luaK_nil (FuncState *fs, int from, int n) {
-  Instruction *previous;
-  if (fs->pc > fs->lasttarget) {  /* no jumps to current position? */
-    if (fs->pc == 0) {  /* function start? */
-      if (from >= fs->nactvar)
-        return;  /* positions are already clean */
-    }
-    else {
-      previous = &fs->f->code[fs->pc-1];
-      if (GET_OPCODE(*previous) == OP_LOADNIL) {
-        int pfrom = GETARG_A(*previous);
-        int pto = GETARG_B(*previous);
-        if (pfrom <= from && from <= pto+1) {  /* can connect both? */
-          if (from+n-1 > pto)
-            SETARG_B(*previous, from+n-1);
-          return;
-        }
-      }
-    }
-  }
-  luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0);  /* else no optimization */
-}
-
-
-int luaK_jump (FuncState *fs) {
-  int jpc = fs->jpc;  /* save list of jumps to here */
-  int j;
-  fs->jpc = NO_JUMP;
-  j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);
-  luaK_concat(fs, &j, jpc);  /* keep them on hold */
-  return j;
-}
-
-
-void luaK_ret (FuncState *fs, int first, int nret) {
-  luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
-}
-
-
-static int condjump (FuncState *fs, OpCode op, int A, int B, int C) {
-  luaK_codeABC(fs, op, A, B, C);
-  return luaK_jump(fs);
-}
-
-
-static void fixjump (FuncState *fs, int pc, int dest) {
-  Instruction *jmp = &fs->f->code[pc];
-  int offset = dest-(pc+1);
-  lua_assert(dest != NO_JUMP);
-  if (abs(offset) > MAXARG_sBx)
-    luaX_syntaxerror(fs->ls, "control structure too long");
-  SETARG_sBx(*jmp, offset);
-}
-
-
-/*
-** returns current `pc' and marks it as a jump target (to avoid wrong
-** optimizations with consecutive instructions not in the same basic block).
-*/
-int luaK_getlabel (FuncState *fs) {
-  fs->lasttarget = fs->pc;
-  return fs->pc;
-}
-
-
-static int getjump (FuncState *fs, int pc) {
-  int offset = GETARG_sBx(fs->f->code[pc]);
-  if (offset == NO_JUMP)  /* point to itself represents end of list */
-    return NO_JUMP;  /* end of list */
-  else
-    return (pc+1)+offset;  /* turn offset into absolute position */
-}
-
-
-static Instruction *getjumpcontrol (FuncState *fs, int pc) {
-  Instruction *pi = &fs->f->code[pc];
-  if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1))))
-    return pi-1;
-  else
-    return pi;
-}
-
-
-/*
-** check whether list has any jump that do not produce a value
-** (or produce an inverted value)
-*/
-static int need_value (FuncState *fs, int list) {
-  for (; list != NO_JUMP; list = getjump(fs, list)) {
-    Instruction i = *getjumpcontrol(fs, list);
-    if (GET_OPCODE(i) != OP_TESTSET) return 1;
-  }
-  return 0;  /* not found */
-}
-
-
-static int patchtestreg (FuncState *fs, int node, int reg) {
-  Instruction *i = getjumpcontrol(fs, node);
-  if (GET_OPCODE(*i) != OP_TESTSET)
-    return 0;  /* cannot patch other instructions */
-  if (reg != NO_REG && reg != GETARG_B(*i))
-    SETARG_A(*i, reg);
-  else  /* no register to put value or register already has the value */
-    *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i));
-
-  return 1;
-}
-
-
-static void removevalues (FuncState *fs, int list) {
-  for (; list != NO_JUMP; list = getjump(fs, list))
-      patchtestreg(fs, list, NO_REG);
-}
-
-
-static void patchlistaux (FuncState *fs, int list, int vtarget, int reg,
-                          int dtarget) {
-  while (list != NO_JUMP) {
-    int next = getjump(fs, list);
-    if (patchtestreg(fs, list, reg))
-      fixjump(fs, list, vtarget);
-    else
-      fixjump(fs, list, dtarget);  /* jump to default target */
-    list = next;
-  }
-}
-
-
-static void dischargejpc (FuncState *fs) {
-  patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc);
-  fs->jpc = NO_JUMP;
-}
-
-
-void luaK_patchlist (FuncState *fs, int list, int target) {
-  if (target == fs->pc)
-    luaK_patchtohere(fs, list);
-  else {
-    lua_assert(target < fs->pc);
-    patchlistaux(fs, list, target, NO_REG, target);
-  }
-}
-
-
-void luaK_patchtohere (FuncState *fs, int list) {
-  luaK_getlabel(fs);
-  luaK_concat(fs, &fs->jpc, list);
-}
-
-
-void luaK_concat (FuncState *fs, int *l1, int l2) {
-  if (l2 == NO_JUMP) return;
-  else if (*l1 == NO_JUMP)
-    *l1 = l2;
-  else {
-    int list = *l1;
-    int next;
-    while ((next = getjump(fs, list)) != NO_JUMP)  /* find last element */
-      list = next;
-    fixjump(fs, list, l2);
-  }
-}
-
-
-void luaK_checkstack (FuncState *fs, int n) {
-  int newstack = fs->freereg + n;
-  if (newstack > fs->f->maxstacksize) {
-    if (newstack >= MAXSTACK)
-      luaX_syntaxerror(fs->ls, "function or expression too complex");
-    fs->f->maxstacksize = cast_byte(newstack);
-  }
-}
-
-
-void luaK_reserveregs (FuncState *fs, int n) {
-  luaK_checkstack(fs, n);
-  fs->freereg += n;
-}
-
-
-static void freereg (FuncState *fs, int reg) {
-  if (!ISK(reg) && reg >= fs->nactvar) {
-    fs->freereg--;
-    lua_assert(reg == fs->freereg);
-  }
-}
-
-
-static void freeexp (FuncState *fs, expdesc *e) {
-  if (e->k == VNONRELOC)
-    freereg(fs, e->u.s.info);
-}
-
-
-static int addk (FuncState *fs, TValue *k, TValue *v) {
-  lua_State *L = fs->L;
-  TValue *idx = luaH_set(L, fs->h, k);
-  Proto *f = fs->f;
-  int oldsize = f->sizek;
-  if (ttisnumber(idx)) {
-    lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v));
-    return cast_int(nvalue(idx));
-  }
-  else {  /* constant not found; create a new entry */
-    setnvalue(idx, cast_num(fs->nk));
-    luaM_growvector(L, f->k, fs->nk, f->sizek, TValue,
-                    MAXARG_Bx, "constant table overflow");
-    while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]);
-    setobj(L, &f->k[fs->nk], v);
-    luaC_barrier(L, f, v);
-    return fs->nk++;
-  }
-}
-
-
-int luaK_stringK (FuncState *fs, TString *s) {
-  TValue o;
-  setsvalue(fs->L, &o, s);
-  return addk(fs, &o, &o);
-}
-
-
-int luaK_numberK (FuncState *fs, lua_Number r) {
-  TValue o;
-  setnvalue(&o, r);
-  return addk(fs, &o, &o);
-}
-
-
-static int boolK (FuncState *fs, int b) {
-  TValue o;
-  setbvalue(&o, b);
-  return addk(fs, &o, &o);
-}
-
-
-static int nilK (FuncState *fs) {
-  TValue k, v;
-  setnilvalue(&v);
-  /* cannot use nil as key; instead use table itself to represent nil */
-  sethvalue(fs->L, &k, fs->h);
-  return addk(fs, &k, &v);
-}
-
-
-void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) {
-  if (e->k == VCALL) {  /* expression is an open function call? */
-    SETARG_C(getcode(fs, e), nresults+1);
-  }
-  else if (e->k == VVARARG) {
-    SETARG_B(getcode(fs, e), nresults+1);
-    SETARG_A(getcode(fs, e), fs->freereg);
-    luaK_reserveregs(fs, 1);
-  }
-}
-
-
-void luaK_setoneret (FuncState *fs, expdesc *e) {
-  if (e->k == VCALL) {  /* expression is an open function call? */
-    e->k = VNONRELOC;
-    e->u.s.info = GETARG_A(getcode(fs, e));
-  }
-  else if (e->k == VVARARG) {
-    SETARG_B(getcode(fs, e), 2);
-    e->k = VRELOCABLE;  /* can relocate its simple result */
-  }
-}
-
-
-void luaK_dischargevars (FuncState *fs, expdesc *e) {
-  switch (e->k) {
-    case VLOCAL: {
-      e->k = VNONRELOC;
-      break;
-    }
-    case VUPVAL: {
-      e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0);
-      e->k = VRELOCABLE;
-      break;
-    }
-    case VGLOBAL: {
-      e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info);
-      e->k = VRELOCABLE;
-      break;
-    }
-    case VINDEXED: {
-      freereg(fs, e->u.s.aux);
-      freereg(fs, e->u.s.info);
-      e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux);
-      e->k = VRELOCABLE;
-      break;
-    }
-    case VVARARG:
-    case VCALL: {
-      luaK_setoneret(fs, e);
-      break;
-    }
-    default: break;  /* there is one value available (somewhere) */
-  }
-}
-
-
-static int code_label (FuncState *fs, int A, int b, int jump) {
-  luaK_getlabel(fs);  /* those instructions may be jump targets */
-  return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump);
-}
-
-
-static void discharge2reg (FuncState *fs, expdesc *e, int reg) {
-  luaK_dischargevars(fs, e);
-  switch (e->k) {
-    case VNIL: {
-      luaK_nil(fs, reg, 1);
-      break;
-    }
-    case VFALSE:  case VTRUE: {
-      luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0);
-      break;
-    }
-    case VK: {
-      luaK_codeABx(fs, OP_LOADK, reg, e->u.s.info);
-      break;
-    }
-    case VKNUM: {
-      luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval));
-      break;
-    }
-    case VRELOCABLE: {
-      Instruction *pc = &getcode(fs, e);
-      SETARG_A(*pc, reg);
-      break;
-    }
-    case VNONRELOC: {
-      if (reg != e->u.s.info)
-        luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0);
-      break;
-    }
-    default: {
-      lua_assert(e->k == VVOID || e->k == VJMP);
-      return;  /* nothing to do... */
-    }
-  }
-  e->u.s.info = reg;
-  e->k = VNONRELOC;
-}
-
-
-static void discharge2anyreg (FuncState *fs, expdesc *e) {
-  if (e->k != VNONRELOC) {
-    luaK_reserveregs(fs, 1);
-    discharge2reg(fs, e, fs->freereg-1);
-  }
-}
-
-
-static void exp2reg (FuncState *fs, expdesc *e, int reg) {
-  discharge2reg(fs, e, reg);
-  if (e->k == VJMP)
-    luaK_concat(fs, &e->t, e->u.s.info);  /* put this jump in `t' list */
-  if (hasjumps(e)) {
-    int final;  /* position after whole expression */
-    int p_f = NO_JUMP;  /* position of an eventual LOAD false */
-    int p_t = NO_JUMP;  /* position of an eventual LOAD true */
-    if (need_value(fs, e->t) || need_value(fs, e->f)) {
-      int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);
-      p_f = code_label(fs, reg, 0, 1);
-      p_t = code_label(fs, reg, 1, 0);
-      luaK_patchtohere(fs, fj);
-    }
-    final = luaK_getlabel(fs);
-    patchlistaux(fs, e->f, final, reg, p_f);
-    patchlistaux(fs, e->t, final, reg, p_t);
-  }
-  e->f = e->t = NO_JUMP;
-  e->u.s.info = reg;
-  e->k = VNONRELOC;
-}
-
-
-void luaK_exp2nextreg (FuncState *fs, expdesc *e) {
-  luaK_dischargevars(fs, e);
-  freeexp(fs, e);
-  luaK_reserveregs(fs, 1);
-  exp2reg(fs, e, fs->freereg - 1);
-}
-
-
-int luaK_exp2anyreg (FuncState *fs, expdesc *e) {
-  luaK_dischargevars(fs, e);
-  if (e->k == VNONRELOC) {
-    if (!hasjumps(e)) return e->u.s.info;  /* exp is already in a register */
-    if (e->u.s.info >= fs->nactvar) {  /* reg. is not a local? */
-      exp2reg(fs, e, e->u.s.info);  /* put value on it */
-      return e->u.s.info;
-    }
-  }
-  luaK_exp2nextreg(fs, e);  /* default */
-  return e->u.s.info;
-}
-
-
-void luaK_exp2val (FuncState *fs, expdesc *e) {
-  if (hasjumps(e))
-    luaK_exp2anyreg(fs, e);
-  else
-    luaK_dischargevars(fs, e);
-}
-
-
-int luaK_exp2RK (FuncState *fs, expdesc *e) {
-  luaK_exp2val(fs, e);
-  switch (e->k) {
-    case VKNUM:
-    case VTRUE:
-    case VFALSE:
-    case VNIL: {
-      if (fs->nk <= MAXINDEXRK) {  /* constant fit in RK operand? */
-        e->u.s.info = (e->k == VNIL)  ? nilK(fs) :
-                      (e->k == VKNUM) ? luaK_numberK(fs, e->u.nval) :
-                                        boolK(fs, (e->k == VTRUE));
-        e->k = VK;
-        return RKASK(e->u.s.info);
-      }
-      else break;
-    }
-    case VK: {
-      if (e->u.s.info <= MAXINDEXRK)  /* constant fit in argC? */
-        return RKASK(e->u.s.info);
-      else break;
-    }
-    default: break;
-  }
-  /* not a constant in the right range: put it in a register */
-  return luaK_exp2anyreg(fs, e);
-}
-
-
-void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) {
-  switch (var->k) {
-    case VLOCAL: {
-      freeexp(fs, ex);
-      exp2reg(fs, ex, var->u.s.info);
-      return;
-    }
-    case VUPVAL: {
-      int e = luaK_exp2anyreg(fs, ex);
-      luaK_codeABC(fs, OP_SETUPVAL, e, var->u.s.info, 0);
-      break;
-    }
-    case VGLOBAL: {
-      int e = luaK_exp2anyreg(fs, ex);
-      luaK_codeABx(fs, OP_SETGLOBAL, e, var->u.s.info);
-      break;
-    }
-    case VINDEXED: {
-      int e = luaK_exp2RK(fs, ex);
-      luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e);
-      break;
-    }
-    default: {
-      lua_assert(0);  /* invalid var kind to store */
-      break;
-    }
-  }
-  freeexp(fs, ex);
-}
-
-
-void luaK_self (FuncState *fs, expdesc *e, expdesc *key) {
-  int func;
-  luaK_exp2anyreg(fs, e);
-  freeexp(fs, e);
-  func = fs->freereg;
-  luaK_reserveregs(fs, 2);
-  luaK_codeABC(fs, OP_SELF, func, e->u.s.info, luaK_exp2RK(fs, key));
-  freeexp(fs, key);
-  e->u.s.info = func;
-  e->k = VNONRELOC;
-}
-
-
-static void invertjump (FuncState *fs, expdesc *e) {
-  Instruction *pc = getjumpcontrol(fs, e->u.s.info);
-  lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET &&
-                                           GET_OPCODE(*pc) != OP_TEST);
-  SETARG_A(*pc, !(GETARG_A(*pc)));
-}
-
-
-static int jumponcond (FuncState *fs, expdesc *e, int cond) {
-  if (e->k == VRELOCABLE) {
-    Instruction ie = getcode(fs, e);
-    if (GET_OPCODE(ie) == OP_NOT) {
-      fs->pc--;  /* remove previous OP_NOT */
-      return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond);
-    }
-    /* else go through */
-  }
-  discharge2anyreg(fs, e);
-  freeexp(fs, e);
-  return condjump(fs, OP_TESTSET, NO_REG, e->u.s.info, cond);
-}
-
-
-void luaK_goiftrue (FuncState *fs, expdesc *e) {
-  int pc;  /* pc of last jump */
-  luaK_dischargevars(fs, e);
-  switch (e->k) {
-    case VK: case VKNUM: case VTRUE: {
-      pc = NO_JUMP;  /* always true; do nothing */
-      break;
-    }
-    case VJMP: {
-      invertjump(fs, e);
-      pc = e->u.s.info;
-      break;
-    }
-    default: {
-      pc = jumponcond(fs, e, 0);
-      break;
-    }
-  }
-  luaK_concat(fs, &e->f, pc);  /* insert last jump in `f' list */
-  luaK_patchtohere(fs, e->t);
-  e->t = NO_JUMP;
-}
-
-
-static void luaK_goiffalse (FuncState *fs, expdesc *e) {
-  int pc;  /* pc of last jump */
-  luaK_dischargevars(fs, e);
-  switch (e->k) {
-    case VNIL: case VFALSE: {
-      pc = NO_JUMP;  /* always false; do nothing */
-      break;
-    }
-    case VJMP: {
-      pc = e->u.s.info;
-      break;
-    }
-    default: {
-      pc = jumponcond(fs, e, 1);
-      break;
-    }
-  }
-  luaK_concat(fs, &e->t, pc);  /* insert last jump in `t' list */
-  luaK_patchtohere(fs, e->f);
-  e->f = NO_JUMP;
-}
-
-
-static void codenot (FuncState *fs, expdesc *e) {
-  luaK_dischargevars(fs, e);
-  switch (e->k) {
-    case VNIL: case VFALSE: {
-      e->k = VTRUE;
-      break;
-    }
-    case VK: case VKNUM: case VTRUE: {
-      e->k = VFALSE;
-      break;
-    }
-    case VJMP: {
-      invertjump(fs, e);
-      break;
-    }
-    case VRELOCABLE:
-    case VNONRELOC: {
-      discharge2anyreg(fs, e);
-      freeexp(fs, e);
-      e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.info, 0);
-      e->k = VRELOCABLE;
-      break;
-    }
-    default: {
-      lua_assert(0);  /* cannot happen */
-      break;
-    }
-  }
-  /* interchange true and false lists */
-  { int temp = e->f; e->f = e->t; e->t = temp; }
-  removevalues(fs, e->f);
-  removevalues(fs, e->t);
-}
-
-
-void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {
-  t->u.s.aux = luaK_exp2RK(fs, k);
-  t->k = VINDEXED;
-}
-
-
-static int constfolding (OpCode op, expdesc *e1, expdesc *e2) {
-  lua_Number v1, v2, r;
-  if (!isnumeral(e1) || !isnumeral(e2)) return 0;
-  v1 = e1->u.nval;
-  v2 = e2->u.nval;
-  switch (op) {
-    case OP_ADD: r = luai_numadd(v1, v2); break;
-    case OP_SUB: r = luai_numsub(v1, v2); break;
-    case OP_MUL: r = luai_nummul(v1, v2); break;
-    case OP_DIV:
-      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */
-      r = luai_numdiv(v1, v2); break;
-    case OP_MOD:
-      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */
-      r = luai_nummod(v1, v2); break;
-    case OP_POW: r = luai_numpow(v1, v2); break;
-    case OP_UNM: r = luai_numunm(v1); break;
-    case OP_LEN: return 0;  /* no constant folding for 'len' */
-    default: lua_assert(0); r = 0; break;
-  }
-  if (luai_numisnan(r)) return 0;  /* do not attempt to produce NaN */
-  e1->u.nval = r;
-  return 1;
-}
-
-
-static void codearith (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) {
-  if (constfolding(op, e1, e2))
-    return;
-  else {
-    int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0;
-    int o1 = luaK_exp2RK(fs, e1);
-    if (o1 > o2) {
-      freeexp(fs, e1);
-      freeexp(fs, e2);
-    }
-    else {
-      freeexp(fs, e2);
-      freeexp(fs, e1);
-    }
-    e1->u.s.info = luaK_codeABC(fs, op, 0, o1, o2);
-    e1->k = VRELOCABLE;
-  }
-}
-
-
-static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1,
-                                                          expdesc *e2) {
-  int o1 = luaK_exp2RK(fs, e1);
-  int o2 = luaK_exp2RK(fs, e2);
-  freeexp(fs, e2);
-  freeexp(fs, e1);
-  if (cond == 0 && op != OP_EQ) {
-    int temp;  /* exchange args to replace by `<' or `<=' */
-    temp = o1; o1 = o2; o2 = temp;  /* o1 <==> o2 */
-    cond = 1;
-  }
-  e1->u.s.info = condjump(fs, op, cond, o1, o2);
-  e1->k = VJMP;
-}
-
-
-void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) {
-  expdesc e2;
-  e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;
-  switch (op) {
-    case OPR_MINUS: {
-      if (!isnumeral(e))
-        luaK_exp2anyreg(fs, e);  /* cannot operate on non-numeric constants */
-      codearith(fs, OP_UNM, e, &e2);
-      break;
-    }
-    case OPR_NOT: codenot(fs, e); break;
-    case OPR_LEN: {
-      luaK_exp2anyreg(fs, e);  /* cannot operate on constants */
-      codearith(fs, OP_LEN, e, &e2);
-      break;
-    }
-    default: lua_assert(0);
-  }
-}
-
-
-void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {
-  switch (op) {
-    case OPR_AND: {
-      luaK_goiftrue(fs, v);
-      break;
-    }
-    case OPR_OR: {
-      luaK_goiffalse(fs, v);
-      break;
-    }
-    case OPR_CONCAT: {
-      luaK_exp2nextreg(fs, v);  /* operand must be on the `stack' */
-      break;
-    }
-    case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV:
-    case OPR_MOD: case OPR_POW: {
-      if (!isnumeral(v)) luaK_exp2RK(fs, v);
-      break;
-    }
-    default: {
-      luaK_exp2RK(fs, v);
-      break;
-    }
-  }
-}
-
-
-void luaK_posfix (FuncState *fs, BinOpr op, expdesc *e1, expdesc *e2) {
-  switch (op) {
-    case OPR_AND: {
-      lua_assert(e1->t == NO_JUMP);  /* list must be closed */
-      luaK_dischargevars(fs, e2);
-      luaK_concat(fs, &e2->f, e1->f);
-      *e1 = *e2;
-      break;
-    }
-    case OPR_OR: {
-      lua_assert(e1->f == NO_JUMP);  /* list must be closed */
-      luaK_dischargevars(fs, e2);
-      luaK_concat(fs, &e2->t, e1->t);
-      *e1 = *e2;
-      break;
-    }
-    case OPR_CONCAT: {
-      luaK_exp2val(fs, e2);
-      if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {
-        lua_assert(e1->u.s.info == GETARG_B(getcode(fs, e2))-1);
-        freeexp(fs, e1);
-        SETARG_B(getcode(fs, e2), e1->u.s.info);
-        e1->k = VRELOCABLE; e1->u.s.info = e2->u.s.info;
-      }
-      else {
-        luaK_exp2nextreg(fs, e2);  /* operand must be on the 'stack' */
-        codearith(fs, OP_CONCAT, e1, e2);
-      }
-      break;
-    }
-    case OPR_ADD: codearith(fs, OP_ADD, e1, e2); break;
-    case OPR_SUB: codearith(fs, OP_SUB, e1, e2); break;
-    case OPR_MUL: codearith(fs, OP_MUL, e1, e2); break;
-    case OPR_DIV: codearith(fs, OP_DIV, e1, e2); break;
-    case OPR_MOD: codearith(fs, OP_MOD, e1, e2); break;
-    case OPR_POW: codearith(fs, OP_POW, e1, e2); break;
-    case OPR_EQ: codecomp(fs, OP_EQ, 1, e1, e2); break;
-    case OPR_NE: codecomp(fs, OP_EQ, 0, e1, e2); break;
-    case OPR_LT: codecomp(fs, OP_LT, 1, e1, e2); break;
-    case OPR_LE: codecomp(fs, OP_LE, 1, e1, e2); break;
-    case OPR_GT: codecomp(fs, OP_LT, 0, e1, e2); break;
-    case OPR_GE: codecomp(fs, OP_LE, 0, e1, e2); break;
-    default: lua_assert(0);
-  }
-}
-
-
-void luaK_fixline (FuncState *fs, int line) {
-  fs->f->lineinfo[fs->pc - 1] = line;
-}
-
-
-static int luaK_code (FuncState *fs, Instruction i, int line) {
-  Proto *f = fs->f;
-  dischargejpc(fs);  /* `pc' will change */
-  /* put new instruction in code array */
-  luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction,
-                  MAX_INT, "code size overflow");
-  f->code[fs->pc] = i;
-  /* save corresponding line information */
-  luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int,
-                  MAX_INT, "code size overflow");
-  f->lineinfo[fs->pc] = line;
-  return fs->pc++;
-}
-
-
-int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) {
-  lua_assert(getOpMode(o) == iABC);
-  lua_assert(getBMode(o) != OpArgN || b == 0);
-  lua_assert(getCMode(o) != OpArgN || c == 0);
-  return luaK_code(fs, CREATE_ABC(o, a, b, c), fs->ls->lastline);
-}
-
-
-int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) {
-  lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx);
-  lua_assert(getCMode(o) == OpArgN);
-  return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline);
-}
-
-
-void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) {
-  int c =  (nelems - 1)/LFIELDS_PER_FLUSH + 1;
-  int b = (tostore == LUA_MULTRET) ? 0 : tostore;
-  lua_assert(tostore != 0);
-  if (c <= MAXARG_C)
-    luaK_codeABC(fs, OP_SETLIST, base, b, c);
-  else {
-    luaK_codeABC(fs, OP_SETLIST, base, b, 0);
-    luaK_code(fs, cast(Instruction, c), fs->ls->lastline);
-  }
-  fs->freereg = base + 1;  /* free registers with list values */
-}
-
diff --git a/redis-stable/deps/lua/src/lcode.h b/redis-stable/deps/lua/src/lcode.h
deleted file mode 100644
index b941c607..00000000
--- a/redis-stable/deps/lua/src/lcode.h
+++ /dev/null
@@ -1,76 +0,0 @@
-/*
-** $Id: lcode.h,v 1.48.1.1 2007/12/27 13:02:25 roberto Exp $
-** Code generator for Lua
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lcode_h
-#define lcode_h
-
-#include "llex.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lparser.h"
-
-
-/*
-** Marks the end of a patch list. It is an invalid value both as an absolute
-** address, and as a list link (would link an element to itself).
-*/
-#define NO_JUMP (-1)
-
-
-/*
-** grep "ORDER OPR" if you change these enums
-*/
-typedef enum BinOpr {
-  OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW,
-  OPR_CONCAT,
-  OPR_NE, OPR_EQ,
-  OPR_LT, OPR_LE, OPR_GT, OPR_GE,
-  OPR_AND, OPR_OR,
-  OPR_NOBINOPR
-} BinOpr;
-
-
-typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr;
-
-
-#define getcode(fs,e)	((fs)->f->code[(e)->u.s.info])
-
-#define luaK_codeAsBx(fs,o,A,sBx)	luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx)
-
-#define luaK_setmultret(fs,e)	luaK_setreturns(fs, e, LUA_MULTRET)
-
-LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx);
-LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C);
-LUAI_FUNC void luaK_fixline (FuncState *fs, int line);
-LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n);
-LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n);
-LUAI_FUNC void luaK_checkstack (FuncState *fs, int n);
-LUAI_FUNC int luaK_stringK (FuncState *fs, TString *s);
-LUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r);
-LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e);
-LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e);
-LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e);
-LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e);
-LUAI_FUNC int luaK_exp2RK (FuncState *fs, expdesc *e);
-LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key);
-LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k);
-LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e);
-LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e);
-LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults);
-LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e);
-LUAI_FUNC int luaK_jump (FuncState *fs);
-LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret);
-LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target);
-LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list);
-LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2);
-LUAI_FUNC int luaK_getlabel (FuncState *fs);
-LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v);
-LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v);
-LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2);
-LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/ldblib.c b/redis-stable/deps/lua/src/ldblib.c
deleted file mode 100644
index 2027eda5..00000000
--- a/redis-stable/deps/lua/src/ldblib.c
+++ /dev/null
@@ -1,398 +0,0 @@
-/*
-** $Id: ldblib.c,v 1.104.1.4 2009/08/04 18:50:18 roberto Exp $
-** Interface from Lua to its debug API
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define ldblib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-
-static int db_getregistry (lua_State *L) {
-  lua_pushvalue(L, LUA_REGISTRYINDEX);
-  return 1;
-}
-
-
-static int db_getmetatable (lua_State *L) {
-  luaL_checkany(L, 1);
-  if (!lua_getmetatable(L, 1)) {
-    lua_pushnil(L);  /* no metatable */
-  }
-  return 1;
-}
-
-
-static int db_setmetatable (lua_State *L) {
-  int t = lua_type(L, 2);
-  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,
-                    "nil or table expected");
-  lua_settop(L, 2);
-  lua_pushboolean(L, lua_setmetatable(L, 1));
-  return 1;
-}
-
-
-static int db_getfenv (lua_State *L) {
-  luaL_checkany(L, 1);
-  lua_getfenv(L, 1);
-  return 1;
-}
-
-
-static int db_setfenv (lua_State *L) {
-  luaL_checktype(L, 2, LUA_TTABLE);
-  lua_settop(L, 2);
-  if (lua_setfenv(L, 1) == 0)
-    luaL_error(L, LUA_QL("setfenv")
-                  " cannot change environment of given object");
-  return 1;
-}
-
-
-static void settabss (lua_State *L, const char *i, const char *v) {
-  lua_pushstring(L, v);
-  lua_setfield(L, -2, i);
-}
-
-
-static void settabsi (lua_State *L, const char *i, int v) {
-  lua_pushinteger(L, v);
-  lua_setfield(L, -2, i);
-}
-
-
-static lua_State *getthread (lua_State *L, int *arg) {
-  if (lua_isthread(L, 1)) {
-    *arg = 1;
-    return lua_tothread(L, 1);
-  }
-  else {
-    *arg = 0;
-    return L;
-  }
-}
-
-
-static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) {
-  if (L == L1) {
-    lua_pushvalue(L, -2);
-    lua_remove(L, -3);
-  }
-  else
-    lua_xmove(L1, L, 1);
-  lua_setfield(L, -2, fname);
-}
-
-
-static int db_getinfo (lua_State *L) {
-  lua_Debug ar;
-  int arg;
-  lua_State *L1 = getthread(L, &arg);
-  const char *options = luaL_optstring(L, arg+2, "flnSu");
-  if (lua_isnumber(L, arg+1)) {
-    if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) {
-      lua_pushnil(L);  /* level out of range */
-      return 1;
-    }
-  }
-  else if (lua_isfunction(L, arg+1)) {
-    lua_pushfstring(L, ">%s", options);
-    options = lua_tostring(L, -1);
-    lua_pushvalue(L, arg+1);
-    lua_xmove(L, L1, 1);
-  }
-  else
-    return luaL_argerror(L, arg+1, "function or level expected");
-  if (!lua_getinfo(L1, options, &ar))
-    return luaL_argerror(L, arg+2, "invalid option");
-  lua_createtable(L, 0, 2);
-  if (strchr(options, 'S')) {
-    settabss(L, "source", ar.source);
-    settabss(L, "short_src", ar.short_src);
-    settabsi(L, "linedefined", ar.linedefined);
-    settabsi(L, "lastlinedefined", ar.lastlinedefined);
-    settabss(L, "what", ar.what);
-  }
-  if (strchr(options, 'l'))
-    settabsi(L, "currentline", ar.currentline);
-  if (strchr(options, 'u'))
-    settabsi(L, "nups", ar.nups);
-  if (strchr(options, 'n')) {
-    settabss(L, "name", ar.name);
-    settabss(L, "namewhat", ar.namewhat);
-  }
-  if (strchr(options, 'L'))
-    treatstackoption(L, L1, "activelines");
-  if (strchr(options, 'f'))
-    treatstackoption(L, L1, "func");
-  return 1;  /* return table */
-}
-    
-
-static int db_getlocal (lua_State *L) {
-  int arg;
-  lua_State *L1 = getthread(L, &arg);
-  lua_Debug ar;
-  const char *name;
-  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */
-    return luaL_argerror(L, arg+1, "level out of range");
-  name = lua_getlocal(L1, &ar, luaL_checkint(L, arg+2));
-  if (name) {
-    lua_xmove(L1, L, 1);
-    lua_pushstring(L, name);
-    lua_pushvalue(L, -2);
-    return 2;
-  }
-  else {
-    lua_pushnil(L);
-    return 1;
-  }
-}
-
-
-static int db_setlocal (lua_State *L) {
-  int arg;
-  lua_State *L1 = getthread(L, &arg);
-  lua_Debug ar;
-  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */
-    return luaL_argerror(L, arg+1, "level out of range");
-  luaL_checkany(L, arg+3);
-  lua_settop(L, arg+3);
-  lua_xmove(L, L1, 1);
-  lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+2)));
-  return 1;
-}
-
-
-static int auxupvalue (lua_State *L, int get) {
-  const char *name;
-  int n = luaL_checkint(L, 2);
-  luaL_checktype(L, 1, LUA_TFUNCTION);
-  if (lua_iscfunction(L, 1)) return 0;  /* cannot touch C upvalues from Lua */
-  name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);
-  if (name == NULL) return 0;
-  lua_pushstring(L, name);
-  lua_insert(L, -(get+1));
-  return get + 1;
-}
-
-
-static int db_getupvalue (lua_State *L) {
-  return auxupvalue(L, 1);
-}
-
-
-static int db_setupvalue (lua_State *L) {
-  luaL_checkany(L, 3);
-  return auxupvalue(L, 0);
-}
-
-
-
-static const char KEY_HOOK = 'h';
-
-
-static void hookf (lua_State *L, lua_Debug *ar) {
-  static const char *const hooknames[] =
-    {"call", "return", "line", "count", "tail return"};
-  lua_pushlightuserdata(L, (void *)&KEY_HOOK);
-  lua_rawget(L, LUA_REGISTRYINDEX);
-  lua_pushlightuserdata(L, L);
-  lua_rawget(L, -2);
-  if (lua_isfunction(L, -1)) {
-    lua_pushstring(L, hooknames[(int)ar->event]);
-    if (ar->currentline >= 0)
-      lua_pushinteger(L, ar->currentline);
-    else lua_pushnil(L);
-    lua_assert(lua_getinfo(L, "lS", ar));
-    lua_call(L, 2, 0);
-  }
-}
-
-
-static int makemask (const char *smask, int count) {
-  int mask = 0;
-  if (strchr(smask, 'c')) mask |= LUA_MASKCALL;
-  if (strchr(smask, 'r')) mask |= LUA_MASKRET;
-  if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
-  if (count > 0) mask |= LUA_MASKCOUNT;
-  return mask;
-}
-
-
-static char *unmakemask (int mask, char *smask) {
-  int i = 0;
-  if (mask & LUA_MASKCALL) smask[i++] = 'c';
-  if (mask & LUA_MASKRET) smask[i++] = 'r';
-  if (mask & LUA_MASKLINE) smask[i++] = 'l';
-  smask[i] = '\0';
-  return smask;
-}
-
-
-static void gethooktable (lua_State *L) {
-  lua_pushlightuserdata(L, (void *)&KEY_HOOK);
-  lua_rawget(L, LUA_REGISTRYINDEX);
-  if (!lua_istable(L, -1)) {
-    lua_pop(L, 1);
-    lua_createtable(L, 0, 1);
-    lua_pushlightuserdata(L, (void *)&KEY_HOOK);
-    lua_pushvalue(L, -2);
-    lua_rawset(L, LUA_REGISTRYINDEX);
-  }
-}
-
-
-static int db_sethook (lua_State *L) {
-  int arg, mask, count;
-  lua_Hook func;
-  lua_State *L1 = getthread(L, &arg);
-  if (lua_isnoneornil(L, arg+1)) {
-    lua_settop(L, arg+1);
-    func = NULL; mask = 0; count = 0;  /* turn off hooks */
-  }
-  else {
-    const char *smask = luaL_checkstring(L, arg+2);
-    luaL_checktype(L, arg+1, LUA_TFUNCTION);
-    count = luaL_optint(L, arg+3, 0);
-    func = hookf; mask = makemask(smask, count);
-  }
-  gethooktable(L);
-  lua_pushlightuserdata(L, L1);
-  lua_pushvalue(L, arg+1);
-  lua_rawset(L, -3);  /* set new hook */
-  lua_pop(L, 1);  /* remove hook table */
-  lua_sethook(L1, func, mask, count);  /* set hooks */
-  return 0;
-}
-
-
-static int db_gethook (lua_State *L) {
-  int arg;
-  lua_State *L1 = getthread(L, &arg);
-  char buff[5];
-  int mask = lua_gethookmask(L1);
-  lua_Hook hook = lua_gethook(L1);
-  if (hook != NULL && hook != hookf)  /* external hook? */
-    lua_pushliteral(L, "external hook");
-  else {
-    gethooktable(L);
-    lua_pushlightuserdata(L, L1);
-    lua_rawget(L, -2);   /* get hook */
-    lua_remove(L, -2);  /* remove hook table */
-  }
-  lua_pushstring(L, unmakemask(mask, buff));
-  lua_pushinteger(L, lua_gethookcount(L1));
-  return 3;
-}
-
-
-static int db_debug (lua_State *L) {
-  for (;;) {
-    char buffer[250];
-    fputs("lua_debug> ", stderr);
-    if (fgets(buffer, sizeof(buffer), stdin) == 0 ||
-        strcmp(buffer, "cont\n") == 0)
-      return 0;
-    if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") ||
-        lua_pcall(L, 0, 0, 0)) {
-      fputs(lua_tostring(L, -1), stderr);
-      fputs("\n", stderr);
-    }
-    lua_settop(L, 0);  /* remove eventual returns */
-  }
-}
-
-
-#define LEVELS1	12	/* size of the first part of the stack */
-#define LEVELS2	10	/* size of the second part of the stack */
-
-static int db_errorfb (lua_State *L) {
-  int level;
-  int firstpart = 1;  /* still before eventual `...' */
-  int arg;
-  lua_State *L1 = getthread(L, &arg);
-  lua_Debug ar;
-  if (lua_isnumber(L, arg+2)) {
-    level = (int)lua_tointeger(L, arg+2);
-    lua_pop(L, 1);
-  }
-  else
-    level = (L == L1) ? 1 : 0;  /* level 0 may be this own function */
-  if (lua_gettop(L) == arg)
-    lua_pushliteral(L, "");
-  else if (!lua_isstring(L, arg+1)) return 1;  /* message is not a string */
-  else lua_pushliteral(L, "\n");
-  lua_pushliteral(L, "stack traceback:");
-  while (lua_getstack(L1, level++, &ar)) {
-    if (level > LEVELS1 && firstpart) {
-      /* no more than `LEVELS2' more levels? */
-      if (!lua_getstack(L1, level+LEVELS2, &ar))
-        level--;  /* keep going */
-      else {
-        lua_pushliteral(L, "\n\t...");  /* too many levels */
-        while (lua_getstack(L1, level+LEVELS2, &ar))  /* find last levels */
-          level++;
-      }
-      firstpart = 0;
-      continue;
-    }
-    lua_pushliteral(L, "\n\t");
-    lua_getinfo(L1, "Snl", &ar);
-    lua_pushfstring(L, "%s:", ar.short_src);
-    if (ar.currentline > 0)
-      lua_pushfstring(L, "%d:", ar.currentline);
-    if (*ar.namewhat != '\0')  /* is there a name? */
-        lua_pushfstring(L, " in function " LUA_QS, ar.name);
-    else {
-      if (*ar.what == 'm')  /* main? */
-        lua_pushfstring(L, " in main chunk");
-      else if (*ar.what == 'C' || *ar.what == 't')
-        lua_pushliteral(L, " ?");  /* C function or tail call */
-      else
-        lua_pushfstring(L, " in function <%s:%d>",
-                           ar.short_src, ar.linedefined);
-    }
-    lua_concat(L, lua_gettop(L) - arg);
-  }
-  lua_concat(L, lua_gettop(L) - arg);
-  return 1;
-}
-
-
-static const luaL_Reg dblib[] = {
-  {"debug", db_debug},
-  {"getfenv", db_getfenv},
-  {"gethook", db_gethook},
-  {"getinfo", db_getinfo},
-  {"getlocal", db_getlocal},
-  {"getregistry", db_getregistry},
-  {"getmetatable", db_getmetatable},
-  {"getupvalue", db_getupvalue},
-  {"setfenv", db_setfenv},
-  {"sethook", db_sethook},
-  {"setlocal", db_setlocal},
-  {"setmetatable", db_setmetatable},
-  {"setupvalue", db_setupvalue},
-  {"traceback", db_errorfb},
-  {NULL, NULL}
-};
-
-
-LUALIB_API int luaopen_debug (lua_State *L) {
-  luaL_register(L, LUA_DBLIBNAME, dblib);
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/ldebug.c b/redis-stable/deps/lua/src/ldebug.c
deleted file mode 100644
index 50ad3d38..00000000
--- a/redis-stable/deps/lua/src/ldebug.c
+++ /dev/null
@@ -1,638 +0,0 @@
-/*
-** $Id: ldebug.c,v 2.29.1.6 2008/05/08 16:56:26 roberto Exp $
-** Debug Interface
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stdarg.h>
-#include <stddef.h>
-#include <string.h>
-
-
-#define ldebug_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lapi.h"
-#include "lcode.h"
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-#include "lvm.h"
-
-
-
-static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name);
-
-
-static int currentpc (lua_State *L, CallInfo *ci) {
-  if (!isLua(ci)) return -1;  /* function is not a Lua function? */
-  if (ci == L->ci)
-    ci->savedpc = L->savedpc;
-  return pcRel(ci->savedpc, ci_func(ci)->l.p);
-}
-
-
-static int currentline (lua_State *L, CallInfo *ci) {
-  int pc = currentpc(L, ci);
-  if (pc < 0)
-    return -1;  /* only active lua functions have current-line information */
-  else
-    return getline(ci_func(ci)->l.p, pc);
-}
-
-
-/*
-** this function can be called asynchronous (e.g. during a signal)
-*/
-LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
-  if (func == NULL || mask == 0) {  /* turn off hooks? */
-    mask = 0;
-    func = NULL;
-  }
-  L->hook = func;
-  L->basehookcount = count;
-  resethookcount(L);
-  L->hookmask = cast_byte(mask);
-  return 1;
-}
-
-
-LUA_API lua_Hook lua_gethook (lua_State *L) {
-  return L->hook;
-}
-
-
-LUA_API int lua_gethookmask (lua_State *L) {
-  return L->hookmask;
-}
-
-
-LUA_API int lua_gethookcount (lua_State *L) {
-  return L->basehookcount;
-}
-
-
-LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {
-  int status;
-  CallInfo *ci;
-  lua_lock(L);
-  for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) {
-    level--;
-    if (f_isLua(ci))  /* Lua function? */
-      level -= ci->tailcalls;  /* skip lost tail calls */
-  }
-  if (level == 0 && ci > L->base_ci) {  /* level found? */
-    status = 1;
-    ar->i_ci = cast_int(ci - L->base_ci);
-  }
-  else if (level < 0) {  /* level is of a lost tail call? */
-    status = 1;
-    ar->i_ci = 0;
-  }
-  else status = 0;  /* no such level */
-  lua_unlock(L);
-  return status;
-}
-
-
-static Proto *getluaproto (CallInfo *ci) {
-  return (isLua(ci) ? ci_func(ci)->l.p : NULL);
-}
-
-
-static const char *findlocal (lua_State *L, CallInfo *ci, int n) {
-  const char *name;
-  Proto *fp = getluaproto(ci);
-  if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL)
-    return name;  /* is a local variable in a Lua function */
-  else {
-    StkId limit = (ci == L->ci) ? L->top : (ci+1)->func;
-    if (limit - ci->base >= n && n > 0)  /* is 'n' inside 'ci' stack? */
-      return "(*temporary)";
-    else
-      return NULL;
-  }
-}
-
-
-LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
-  CallInfo *ci = L->base_ci + ar->i_ci;
-  const char *name = findlocal(L, ci, n);
-  lua_lock(L);
-  if (name)
-      luaA_pushobject(L, ci->base + (n - 1));
-  lua_unlock(L);
-  return name;
-}
-
-
-LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
-  CallInfo *ci = L->base_ci + ar->i_ci;
-  const char *name = findlocal(L, ci, n);
-  lua_lock(L);
-  if (name)
-      setobjs2s(L, ci->base + (n - 1), L->top - 1);
-  L->top--;  /* pop value */
-  lua_unlock(L);
-  return name;
-}
-
-
-static void funcinfo (lua_Debug *ar, Closure *cl) {
-  if (cl->c.isC) {
-    ar->source = "=[C]";
-    ar->linedefined = -1;
-    ar->lastlinedefined = -1;
-    ar->what = "C";
-  }
-  else {
-    ar->source = getstr(cl->l.p->source);
-    ar->linedefined = cl->l.p->linedefined;
-    ar->lastlinedefined = cl->l.p->lastlinedefined;
-    ar->what = (ar->linedefined == 0) ? "main" : "Lua";
-  }
-  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
-}
-
-
-static void info_tailcall (lua_Debug *ar) {
-  ar->name = ar->namewhat = "";
-  ar->what = "tail";
-  ar->lastlinedefined = ar->linedefined = ar->currentline = -1;
-  ar->source = "=(tail call)";
-  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
-  ar->nups = 0;
-}
-
-
-static void collectvalidlines (lua_State *L, Closure *f) {
-  if (f == NULL || f->c.isC) {
-    setnilvalue(L->top);
-  }
-  else {
-    Table *t = luaH_new(L, 0, 0);
-    int *lineinfo = f->l.p->lineinfo;
-    int i;
-    for (i=0; i<f->l.p->sizelineinfo; i++)
-      setbvalue(luaH_setnum(L, t, lineinfo[i]), 1);
-    sethvalue(L, L->top, t); 
-  }
-  incr_top(L);
-}
-
-
-static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
-                    Closure *f, CallInfo *ci) {
-  int status = 1;
-  if (f == NULL) {
-    info_tailcall(ar);
-    return status;
-  }
-  for (; *what; what++) {
-    switch (*what) {
-      case 'S': {
-        funcinfo(ar, f);
-        break;
-      }
-      case 'l': {
-        ar->currentline = (ci) ? currentline(L, ci) : -1;
-        break;
-      }
-      case 'u': {
-        ar->nups = f->c.nupvalues;
-        break;
-      }
-      case 'n': {
-        ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL;
-        if (ar->namewhat == NULL) {
-          ar->namewhat = "";  /* not found */
-          ar->name = NULL;
-        }
-        break;
-      }
-      case 'L':
-      case 'f':  /* handled by lua_getinfo */
-        break;
-      default: status = 0;  /* invalid option */
-    }
-  }
-  return status;
-}
-
-
-LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
-  int status;
-  Closure *f = NULL;
-  CallInfo *ci = NULL;
-  lua_lock(L);
-  if (*what == '>') {
-    StkId func = L->top - 1;
-    luai_apicheck(L, ttisfunction(func));
-    what++;  /* skip the '>' */
-    f = clvalue(func);
-    L->top--;  /* pop function */
-  }
-  else if (ar->i_ci != 0) {  /* no tail call? */
-    ci = L->base_ci + ar->i_ci;
-    lua_assert(ttisfunction(ci->func));
-    f = clvalue(ci->func);
-  }
-  status = auxgetinfo(L, what, ar, f, ci);
-  if (strchr(what, 'f')) {
-    if (f == NULL) setnilvalue(L->top);
-    else setclvalue(L, L->top, f);
-    incr_top(L);
-  }
-  if (strchr(what, 'L'))
-    collectvalidlines(L, f);
-  lua_unlock(L);
-  return status;
-}
-
-
-/*
-** {======================================================
-** Symbolic Execution and code checker
-** =======================================================
-*/
-
-#define check(x)		if (!(x)) return 0;
-
-#define checkjump(pt,pc)	check(0 <= pc && pc < pt->sizecode)
-
-#define checkreg(pt,reg)	check((reg) < (pt)->maxstacksize)
-
-
-
-static int precheck (const Proto *pt) {
-  check(pt->maxstacksize <= MAXSTACK);
-  check(pt->numparams+(pt->is_vararg & VARARG_HASARG) <= pt->maxstacksize);
-  check(!(pt->is_vararg & VARARG_NEEDSARG) ||
-              (pt->is_vararg & VARARG_HASARG));
-  check(pt->sizeupvalues <= pt->nups);
-  check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
-  check(pt->sizecode > 0 && GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
-  return 1;
-}
-
-
-#define checkopenop(pt,pc)	luaG_checkopenop((pt)->code[(pc)+1])
-
-int luaG_checkopenop (Instruction i) {
-  switch (GET_OPCODE(i)) {
-    case OP_CALL:
-    case OP_TAILCALL:
-    case OP_RETURN:
-    case OP_SETLIST: {
-      check(GETARG_B(i) == 0);
-      return 1;
-    }
-    default: return 0;  /* invalid instruction after an open call */
-  }
-}
-
-
-static int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) {
-  switch (mode) {
-    case OpArgN: check(r == 0); break;
-    case OpArgU: break;
-    case OpArgR: checkreg(pt, r); break;
-    case OpArgK:
-      check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize);
-      break;
-  }
-  return 1;
-}
-
-
-static Instruction symbexec (const Proto *pt, int lastpc, int reg) {
-  int pc;
-  int last;  /* stores position of last instruction that changed `reg' */
-  last = pt->sizecode-1;  /* points to final return (a `neutral' instruction) */
-  check(precheck(pt));
-  for (pc = 0; pc < lastpc; pc++) {
-    Instruction i = pt->code[pc];
-    OpCode op = GET_OPCODE(i);
-    int a = GETARG_A(i);
-    int b = 0;
-    int c = 0;
-    check(op < NUM_OPCODES);
-    checkreg(pt, a);
-    switch (getOpMode(op)) {
-      case iABC: {
-        b = GETARG_B(i);
-        c = GETARG_C(i);
-        check(checkArgMode(pt, b, getBMode(op)));
-        check(checkArgMode(pt, c, getCMode(op)));
-        break;
-      }
-      case iABx: {
-        b = GETARG_Bx(i);
-        if (getBMode(op) == OpArgK) check(b < pt->sizek);
-        break;
-      }
-      case iAsBx: {
-        b = GETARG_sBx(i);
-        if (getBMode(op) == OpArgR) {
-          int dest = pc+1+b;
-          check(0 <= dest && dest < pt->sizecode);
-          if (dest > 0) {
-            int j;
-            /* check that it does not jump to a setlist count; this
-               is tricky, because the count from a previous setlist may
-               have the same value of an invalid setlist; so, we must
-               go all the way back to the first of them (if any) */
-            for (j = 0; j < dest; j++) {
-              Instruction d = pt->code[dest-1-j];
-              if (!(GET_OPCODE(d) == OP_SETLIST && GETARG_C(d) == 0)) break;
-            }
-            /* if 'j' is even, previous value is not a setlist (even if
-               it looks like one) */
-            check((j&1) == 0);
-          }
-        }
-        break;
-      }
-    }
-    if (testAMode(op)) {
-      if (a == reg) last = pc;  /* change register `a' */
-    }
-    if (testTMode(op)) {
-      check(pc+2 < pt->sizecode);  /* check skip */
-      check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
-    }
-    switch (op) {
-      case OP_LOADBOOL: {
-        if (c == 1) {  /* does it jump? */
-          check(pc+2 < pt->sizecode);  /* check its jump */
-          check(GET_OPCODE(pt->code[pc+1]) != OP_SETLIST ||
-                GETARG_C(pt->code[pc+1]) != 0);
-        }
-        break;
-      }
-      case OP_LOADNIL: {
-        if (a <= reg && reg <= b)
-          last = pc;  /* set registers from `a' to `b' */
-        break;
-      }
-      case OP_GETUPVAL:
-      case OP_SETUPVAL: {
-        check(b < pt->nups);
-        break;
-      }
-      case OP_GETGLOBAL:
-      case OP_SETGLOBAL: {
-        check(ttisstring(&pt->k[b]));
-        break;
-      }
-      case OP_SELF: {
-        checkreg(pt, a+1);
-        if (reg == a+1) last = pc;
-        break;
-      }
-      case OP_CONCAT: {
-        check(b < c);  /* at least two operands */
-        break;
-      }
-      case OP_TFORLOOP: {
-        check(c >= 1);  /* at least one result (control variable) */
-        checkreg(pt, a+2+c);  /* space for results */
-        if (reg >= a+2) last = pc;  /* affect all regs above its base */
-        break;
-      }
-      case OP_FORLOOP:
-      case OP_FORPREP:
-        checkreg(pt, a+3);
-        /* go through */
-      case OP_JMP: {
-        int dest = pc+1+b;
-        /* not full check and jump is forward and do not skip `lastpc'? */
-        if (reg != NO_REG && pc < dest && dest <= lastpc)
-          pc += b;  /* do the jump */
-        break;
-      }
-      case OP_CALL:
-      case OP_TAILCALL: {
-        if (b != 0) {
-          checkreg(pt, a+b-1);
-        }
-        c--;  /* c = num. returns */
-        if (c == LUA_MULTRET) {
-          check(checkopenop(pt, pc));
-        }
-        else if (c != 0)
-          checkreg(pt, a+c-1);
-        if (reg >= a) last = pc;  /* affect all registers above base */
-        break;
-      }
-      case OP_RETURN: {
-        b--;  /* b = num. returns */
-        if (b > 0) checkreg(pt, a+b-1);
-        break;
-      }
-      case OP_SETLIST: {
-        if (b > 0) checkreg(pt, a + b);
-        if (c == 0) {
-          pc++;
-          check(pc < pt->sizecode - 1);
-        }
-        break;
-      }
-      case OP_CLOSURE: {
-        int nup, j;
-        check(b < pt->sizep);
-        nup = pt->p[b]->nups;
-        check(pc + nup < pt->sizecode);
-        for (j = 1; j <= nup; j++) {
-          OpCode op1 = GET_OPCODE(pt->code[pc + j]);
-          check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
-        }
-        if (reg != NO_REG)  /* tracing? */
-          pc += nup;  /* do not 'execute' these pseudo-instructions */
-        break;
-      }
-      case OP_VARARG: {
-        check((pt->is_vararg & VARARG_ISVARARG) &&
-             !(pt->is_vararg & VARARG_NEEDSARG));
-        b--;
-        if (b == LUA_MULTRET) check(checkopenop(pt, pc));
-        checkreg(pt, a+b-1);
-        break;
-      }
-      default: break;
-    }
-  }
-  return pt->code[last];
-}
-
-#undef check
-#undef checkjump
-#undef checkreg
-
-/* }====================================================== */
-
-
-int luaG_checkcode (const Proto *pt) {
-  return (symbexec(pt, pt->sizecode, NO_REG) != 0);
-}
-
-
-static const char *kname (Proto *p, int c) {
-  if (ISK(c) && ttisstring(&p->k[INDEXK(c)]))
-    return svalue(&p->k[INDEXK(c)]);
-  else
-    return "?";
-}
-
-
-static const char *getobjname (lua_State *L, CallInfo *ci, int stackpos,
-                               const char **name) {
-  if (isLua(ci)) {  /* a Lua function? */
-    Proto *p = ci_func(ci)->l.p;
-    int pc = currentpc(L, ci);
-    Instruction i;
-    *name = luaF_getlocalname(p, stackpos+1, pc);
-    if (*name)  /* is a local? */
-      return "local";
-    i = symbexec(p, pc, stackpos);  /* try symbolic execution */
-    lua_assert(pc != -1);
-    switch (GET_OPCODE(i)) {
-      case OP_GETGLOBAL: {
-        int g = GETARG_Bx(i);  /* global index */
-        lua_assert(ttisstring(&p->k[g]));
-        *name = svalue(&p->k[g]);
-        return "global";
-      }
-      case OP_MOVE: {
-        int a = GETARG_A(i);
-        int b = GETARG_B(i);  /* move from `b' to `a' */
-        if (b < a)
-          return getobjname(L, ci, b, name);  /* get name for `b' */
-        break;
-      }
-      case OP_GETTABLE: {
-        int k = GETARG_C(i);  /* key index */
-        *name = kname(p, k);
-        return "field";
-      }
-      case OP_GETUPVAL: {
-        int u = GETARG_B(i);  /* upvalue index */
-        *name = p->upvalues ? getstr(p->upvalues[u]) : "?";
-        return "upvalue";
-      }
-      case OP_SELF: {
-        int k = GETARG_C(i);  /* key index */
-        *name = kname(p, k);
-        return "method";
-      }
-      default: break;
-    }
-  }
-  return NULL;  /* no useful name found */
-}
-
-
-static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) {
-  Instruction i;
-  if ((isLua(ci) && ci->tailcalls > 0) || !isLua(ci - 1))
-    return NULL;  /* calling function is not Lua (or is unknown) */
-  ci--;  /* calling function */
-  i = ci_func(ci)->l.p->code[currentpc(L, ci)];
-  if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||
-      GET_OPCODE(i) == OP_TFORLOOP)
-    return getobjname(L, ci, GETARG_A(i), name);
-  else
-    return NULL;  /* no useful name can be found */
-}
-
-
-/* only ANSI way to check whether a pointer points to an array */
-static int isinstack (CallInfo *ci, const TValue *o) {
-  StkId p;
-  for (p = ci->base; p < ci->top; p++)
-    if (o == p) return 1;
-  return 0;
-}
-
-
-void luaG_typeerror (lua_State *L, const TValue *o, const char *op) {
-  const char *name = NULL;
-  const char *t = luaT_typenames[ttype(o)];
-  const char *kind = (isinstack(L->ci, o)) ?
-                         getobjname(L, L->ci, cast_int(o - L->base), &name) :
-                         NULL;
-  if (kind)
-    luaG_runerror(L, "attempt to %s %s " LUA_QS " (a %s value)",
-                op, kind, name, t);
-  else
-    luaG_runerror(L, "attempt to %s a %s value", op, t);
-}
-
-
-void luaG_concaterror (lua_State *L, StkId p1, StkId p2) {
-  if (ttisstring(p1) || ttisnumber(p1)) p1 = p2;
-  lua_assert(!ttisstring(p1) && !ttisnumber(p1));
-  luaG_typeerror(L, p1, "concatenate");
-}
-
-
-void luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) {
-  TValue temp;
-  if (luaV_tonumber(p1, &temp) == NULL)
-    p2 = p1;  /* first operand is wrong */
-  luaG_typeerror(L, p2, "perform arithmetic on");
-}
-
-
-int luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) {
-  const char *t1 = luaT_typenames[ttype(p1)];
-  const char *t2 = luaT_typenames[ttype(p2)];
-  if (t1[2] == t2[2])
-    luaG_runerror(L, "attempt to compare two %s values", t1);
-  else
-    luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
-  return 0;
-}
-
-
-static void addinfo (lua_State *L, const char *msg) {
-  CallInfo *ci = L->ci;
-  if (isLua(ci)) {  /* is Lua code? */
-    char buff[LUA_IDSIZE];  /* add file:line information */
-    int line = currentline(L, ci);
-    luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);
-    luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
-  }
-}
-
-
-void luaG_errormsg (lua_State *L) {
-  if (L->errfunc != 0) {  /* is there an error handling function? */
-    StkId errfunc = restorestack(L, L->errfunc);
-    if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);
-    setobjs2s(L, L->top, L->top - 1);  /* move argument */
-    setobjs2s(L, L->top - 1, errfunc);  /* push function */
-    incr_top(L);
-    luaD_call(L, L->top - 2, 1);  /* call it */
-  }
-  luaD_throw(L, LUA_ERRRUN);
-}
-
-
-void luaG_runerror (lua_State *L, const char *fmt, ...) {
-  va_list argp;
-  va_start(argp, fmt);
-  addinfo(L, luaO_pushvfstring(L, fmt, argp));
-  va_end(argp);
-  luaG_errormsg(L);
-}
-
diff --git a/redis-stable/deps/lua/src/ldebug.h b/redis-stable/deps/lua/src/ldebug.h
deleted file mode 100644
index ba28a972..00000000
--- a/redis-stable/deps/lua/src/ldebug.h
+++ /dev/null
@@ -1,33 +0,0 @@
-/*
-** $Id: ldebug.h,v 2.3.1.1 2007/12/27 13:02:25 roberto Exp $
-** Auxiliary functions from Debug Interface module
-** See Copyright Notice in lua.h
-*/
-
-#ifndef ldebug_h
-#define ldebug_h
-
-
-#include "lstate.h"
-
-
-#define pcRel(pc, p)	(cast(int, (pc) - (p)->code) - 1)
-
-#define getline(f,pc)	(((f)->lineinfo) ? (f)->lineinfo[pc] : 0)
-
-#define resethookcount(L)	(L->hookcount = L->basehookcount)
-
-
-LUAI_FUNC void luaG_typeerror (lua_State *L, const TValue *o,
-                                             const char *opname);
-LUAI_FUNC void luaG_concaterror (lua_State *L, StkId p1, StkId p2);
-LUAI_FUNC void luaG_aritherror (lua_State *L, const TValue *p1,
-                                              const TValue *p2);
-LUAI_FUNC int luaG_ordererror (lua_State *L, const TValue *p1,
-                                             const TValue *p2);
-LUAI_FUNC void luaG_runerror (lua_State *L, const char *fmt, ...);
-LUAI_FUNC void luaG_errormsg (lua_State *L);
-LUAI_FUNC int luaG_checkcode (const Proto *pt);
-LUAI_FUNC int luaG_checkopenop (Instruction i);
-
-#endif
diff --git a/redis-stable/deps/lua/src/ldo.c b/redis-stable/deps/lua/src/ldo.c
deleted file mode 100644
index e641dfcd..00000000
--- a/redis-stable/deps/lua/src/ldo.c
+++ /dev/null
@@ -1,519 +0,0 @@
-/*
-** $Id: ldo.c,v 2.38.1.4 2012/01/18 02:27:10 roberto Exp $
-** Stack and Call structure of Lua
-** See Copyright Notice in lua.h
-*/
-
-
-#include <setjmp.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define ldo_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lgc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lparser.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-#include "lundump.h"
-#include "lvm.h"
-#include "lzio.h"
-
-
-
-
-/*
-** {======================================================
-** Error-recovery functions
-** =======================================================
-*/
-
-
-/* chain list of long jump buffers */
-struct lua_longjmp {
-  struct lua_longjmp *previous;
-  luai_jmpbuf b;
-  volatile int status;  /* error code */
-};
-
-
-void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) {
-  switch (errcode) {
-    case LUA_ERRMEM: {
-      setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG));
-      break;
-    }
-    case LUA_ERRERR: {
-      setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling"));
-      break;
-    }
-    case LUA_ERRSYNTAX:
-    case LUA_ERRRUN: {
-      setobjs2s(L, oldtop, L->top - 1);  /* error message on current top */
-      break;
-    }
-  }
-  L->top = oldtop + 1;
-}
-
-
-static void restore_stack_limit (lua_State *L) {
-  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
-  if (L->size_ci > LUAI_MAXCALLS) {  /* there was an overflow? */
-    int inuse = cast_int(L->ci - L->base_ci);
-    if (inuse + 1 < LUAI_MAXCALLS)  /* can `undo' overflow? */
-      luaD_reallocCI(L, LUAI_MAXCALLS);
-  }
-}
-
-
-static void resetstack (lua_State *L, int status) {
-  L->ci = L->base_ci;
-  L->base = L->ci->base;
-  luaF_close(L, L->base);  /* close eventual pending closures */
-  luaD_seterrorobj(L, status, L->base);
-  L->nCcalls = L->baseCcalls;
-  L->allowhook = 1;
-  restore_stack_limit(L);
-  L->errfunc = 0;
-  L->errorJmp = NULL;
-}
-
-
-void luaD_throw (lua_State *L, int errcode) {
-  if (L->errorJmp) {
-    L->errorJmp->status = errcode;
-    LUAI_THROW(L, L->errorJmp);
-  }
-  else {
-    L->status = cast_byte(errcode);
-    if (G(L)->panic) {
-      resetstack(L, errcode);
-      lua_unlock(L);
-      G(L)->panic(L);
-    }
-    exit(EXIT_FAILURE);
-  }
-}
-
-
-int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) {
-  struct lua_longjmp lj;
-  lj.status = 0;
-  lj.previous = L->errorJmp;  /* chain new error handler */
-  L->errorJmp = &lj;
-  LUAI_TRY(L, &lj,
-    (*f)(L, ud);
-  );
-  L->errorJmp = lj.previous;  /* restore old error handler */
-  return lj.status;
-}
-
-/* }====================================================== */
-
-
-static void correctstack (lua_State *L, TValue *oldstack) {
-  CallInfo *ci;
-  GCObject *up;
-  L->top = (L->top - oldstack) + L->stack;
-  for (up = L->openupval; up != NULL; up = up->gch.next)
-    gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;
-  for (ci = L->base_ci; ci <= L->ci; ci++) {
-    ci->top = (ci->top - oldstack) + L->stack;
-    ci->base = (ci->base - oldstack) + L->stack;
-    ci->func = (ci->func - oldstack) + L->stack;
-  }
-  L->base = (L->base - oldstack) + L->stack;
-}
-
-
-void luaD_reallocstack (lua_State *L, int newsize) {
-  TValue *oldstack = L->stack;
-  int realsize = newsize + 1 + EXTRA_STACK;
-  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);
-  luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue);
-  L->stacksize = realsize;
-  L->stack_last = L->stack+newsize;
-  correctstack(L, oldstack);
-}
-
-
-void luaD_reallocCI (lua_State *L, int newsize) {
-  CallInfo *oldci = L->base_ci;
-  luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo);
-  L->size_ci = newsize;
-  L->ci = (L->ci - oldci) + L->base_ci;
-  L->end_ci = L->base_ci + L->size_ci - 1;
-}
-
-
-void luaD_growstack (lua_State *L, int n) {
-  if (n <= L->stacksize)  /* double size is enough? */
-    luaD_reallocstack(L, 2*L->stacksize);
-  else
-    luaD_reallocstack(L, L->stacksize + n);
-}
-
-
-static CallInfo *growCI (lua_State *L) {
-  if (L->size_ci > LUAI_MAXCALLS)  /* overflow while handling overflow? */
-    luaD_throw(L, LUA_ERRERR);
-  else {
-    luaD_reallocCI(L, 2*L->size_ci);
-    if (L->size_ci > LUAI_MAXCALLS)
-      luaG_runerror(L, "stack overflow");
-  }
-  return ++L->ci;
-}
-
-
-void luaD_callhook (lua_State *L, int event, int line) {
-  lua_Hook hook = L->hook;
-  if (hook && L->allowhook) {
-    ptrdiff_t top = savestack(L, L->top);
-    ptrdiff_t ci_top = savestack(L, L->ci->top);
-    lua_Debug ar;
-    ar.event = event;
-    ar.currentline = line;
-    if (event == LUA_HOOKTAILRET)
-      ar.i_ci = 0;  /* tail call; no debug information about it */
-    else
-      ar.i_ci = cast_int(L->ci - L->base_ci);
-    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */
-    L->ci->top = L->top + LUA_MINSTACK;
-    lua_assert(L->ci->top <= L->stack_last);
-    L->allowhook = 0;  /* cannot call hooks inside a hook */
-    lua_unlock(L);
-    (*hook)(L, &ar);
-    lua_lock(L);
-    lua_assert(!L->allowhook);
-    L->allowhook = 1;
-    L->ci->top = restorestack(L, ci_top);
-    L->top = restorestack(L, top);
-  }
-}
-
-
-static StkId adjust_varargs (lua_State *L, Proto *p, int actual) {
-  int i;
-  int nfixargs = p->numparams;
-  Table *htab = NULL;
-  StkId base, fixed;
-  for (; actual < nfixargs; ++actual)
-    setnilvalue(L->top++);
-#if defined(LUA_COMPAT_VARARG)
-  if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */
-    int nvar = actual - nfixargs;  /* number of extra arguments */
-    lua_assert(p->is_vararg & VARARG_HASARG);
-    luaC_checkGC(L);
-    luaD_checkstack(L, p->maxstacksize);
-    htab = luaH_new(L, nvar, 1);  /* create `arg' table */
-    for (i=0; i<nvar; i++)  /* put extra arguments into `arg' table */
-      setobj2n(L, luaH_setnum(L, htab, i+1), L->top - nvar + i);
-    /* store counter in field `n' */
-    setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, "n")), cast_num(nvar));
-  }
-#endif
-  /* move fixed parameters to final position */
-  fixed = L->top - actual;  /* first fixed argument */
-  base = L->top;  /* final position of first argument */
-  for (i=0; i<nfixargs; i++) {
-    setobjs2s(L, L->top++, fixed+i);
-    setnilvalue(fixed+i);
-  }
-  /* add `arg' parameter */
-  if (htab) {
-    sethvalue(L, L->top++, htab);
-    lua_assert(iswhite(obj2gco(htab)));
-  }
-  return base;
-}
-
-
-static StkId tryfuncTM (lua_State *L, StkId func) {
-  const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL);
-  StkId p;
-  ptrdiff_t funcr = savestack(L, func);
-  if (!ttisfunction(tm))
-    luaG_typeerror(L, func, "call");
-  /* Open a hole inside the stack at `func' */
-  for (p = L->top; p > func; p--) setobjs2s(L, p, p-1);
-  incr_top(L);
-  func = restorestack(L, funcr);  /* previous call may change stack */
-  setobj2s(L, func, tm);  /* tag method is the new function to be called */
-  return func;
-}
-
-
-
-#define inc_ci(L) \
-  ((L->ci == L->end_ci) ? growCI(L) : \
-   (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci))
-
-
-int luaD_precall (lua_State *L, StkId func, int nresults) {
-  LClosure *cl;
-  ptrdiff_t funcr;
-  if (!ttisfunction(func)) /* `func' is not a function? */
-    func = tryfuncTM(L, func);  /* check the `function' tag method */
-  funcr = savestack(L, func);
-  cl = &clvalue(func)->l;
-  L->ci->savedpc = L->savedpc;
-  if (!cl->isC) {  /* Lua function? prepare its call */
-    CallInfo *ci;
-    StkId st, base;
-    Proto *p = cl->p;
-    luaD_checkstack(L, p->maxstacksize + p->numparams);
-    func = restorestack(L, funcr);
-    if (!p->is_vararg) {  /* no varargs? */
-      base = func + 1;
-      if (L->top > base + p->numparams)
-        L->top = base + p->numparams;
-    }
-    else {  /* vararg function */
-      int nargs = cast_int(L->top - func) - 1;
-      base = adjust_varargs(L, p, nargs);
-      func = restorestack(L, funcr);  /* previous call may change the stack */
-    }
-    ci = inc_ci(L);  /* now `enter' new function */
-    ci->func = func;
-    L->base = ci->base = base;
-    ci->top = L->base + p->maxstacksize;
-    lua_assert(ci->top <= L->stack_last);
-    L->savedpc = p->code;  /* starting point */
-    ci->tailcalls = 0;
-    ci->nresults = nresults;
-    for (st = L->top; st < ci->top; st++)
-      setnilvalue(st);
-    L->top = ci->top;
-    if (L->hookmask & LUA_MASKCALL) {
-      L->savedpc++;  /* hooks assume 'pc' is already incremented */
-      luaD_callhook(L, LUA_HOOKCALL, -1);
-      L->savedpc--;  /* correct 'pc' */
-    }
-    return PCRLUA;
-  }
-  else {  /* if is a C function, call it */
-    CallInfo *ci;
-    int n;
-    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */
-    ci = inc_ci(L);  /* now `enter' new function */
-    ci->func = restorestack(L, funcr);
-    L->base = ci->base = ci->func + 1;
-    ci->top = L->top + LUA_MINSTACK;
-    lua_assert(ci->top <= L->stack_last);
-    ci->nresults = nresults;
-    if (L->hookmask & LUA_MASKCALL)
-      luaD_callhook(L, LUA_HOOKCALL, -1);
-    lua_unlock(L);
-    n = (*curr_func(L)->c.f)(L);  /* do the actual call */
-    lua_lock(L);
-    if (n < 0)  /* yielding? */
-      return PCRYIELD;
-    else {
-      luaD_poscall(L, L->top - n);
-      return PCRC;
-    }
-  }
-}
-
-
-static StkId callrethooks (lua_State *L, StkId firstResult) {
-  ptrdiff_t fr = savestack(L, firstResult);  /* next call may change stack */
-  luaD_callhook(L, LUA_HOOKRET, -1);
-  if (f_isLua(L->ci)) {  /* Lua function? */
-    while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */
-      luaD_callhook(L, LUA_HOOKTAILRET, -1);
-  }
-  return restorestack(L, fr);
-}
-
-
-int luaD_poscall (lua_State *L, StkId firstResult) {
-  StkId res;
-  int wanted, i;
-  CallInfo *ci;
-  if (L->hookmask & LUA_MASKRET)
-    firstResult = callrethooks(L, firstResult);
-  ci = L->ci--;
-  res = ci->func;  /* res == final position of 1st result */
-  wanted = ci->nresults;
-  L->base = (ci - 1)->base;  /* restore base */
-  L->savedpc = (ci - 1)->savedpc;  /* restore savedpc */
-  /* move results to correct place */
-  for (i = wanted; i != 0 && firstResult < L->top; i--)
-    setobjs2s(L, res++, firstResult++);
-  while (i-- > 0)
-    setnilvalue(res++);
-  L->top = res;
-  return (wanted - LUA_MULTRET);  /* 0 iff wanted == LUA_MULTRET */
-}
-
-
-/*
-** Call a function (C or Lua). The function to be called is at *func.
-** The arguments are on the stack, right after the function.
-** When returns, all the results are on the stack, starting at the original
-** function position.
-*/ 
-void luaD_call (lua_State *L, StkId func, int nResults) {
-  if (++L->nCcalls >= LUAI_MAXCCALLS) {
-    if (L->nCcalls == LUAI_MAXCCALLS)
-      luaG_runerror(L, "C stack overflow");
-    else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3)))
-      luaD_throw(L, LUA_ERRERR);  /* error while handing stack error */
-  }
-  if (luaD_precall(L, func, nResults) == PCRLUA)  /* is a Lua function? */
-    luaV_execute(L, 1);  /* call it */
-  L->nCcalls--;
-  luaC_checkGC(L);
-}
-
-
-static void resume (lua_State *L, void *ud) {
-  StkId firstArg = cast(StkId, ud);
-  CallInfo *ci = L->ci;
-  if (L->status == 0) {  /* start coroutine? */
-    lua_assert(ci == L->base_ci && firstArg > L->base);
-    if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA)
-      return;
-  }
-  else {  /* resuming from previous yield */
-    lua_assert(L->status == LUA_YIELD);
-    L->status = 0;
-    if (!f_isLua(ci)) {  /* `common' yield? */
-      /* finish interrupted execution of `OP_CALL' */
-      lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL ||
-                 GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL);
-      if (luaD_poscall(L, firstArg))  /* complete it... */
-        L->top = L->ci->top;  /* and correct top if not multiple results */
-    }
-    else  /* yielded inside a hook: just continue its execution */
-      L->base = L->ci->base;
-  }
-  luaV_execute(L, cast_int(L->ci - L->base_ci));
-}
-
-
-static int resume_error (lua_State *L, const char *msg) {
-  L->top = L->ci->base;
-  setsvalue2s(L, L->top, luaS_new(L, msg));
-  incr_top(L);
-  lua_unlock(L);
-  return LUA_ERRRUN;
-}
-
-
-LUA_API int lua_resume (lua_State *L, int nargs) {
-  int status;
-  lua_lock(L);
-  if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci))
-      return resume_error(L, "cannot resume non-suspended coroutine");
-  if (L->nCcalls >= LUAI_MAXCCALLS)
-    return resume_error(L, "C stack overflow");
-  luai_userstateresume(L, nargs);
-  lua_assert(L->errfunc == 0);
-  L->baseCcalls = ++L->nCcalls;
-  status = luaD_rawrunprotected(L, resume, L->top - nargs);
-  if (status != 0) {  /* error? */
-    L->status = cast_byte(status);  /* mark thread as `dead' */
-    luaD_seterrorobj(L, status, L->top);
-    L->ci->top = L->top;
-  }
-  else {
-    lua_assert(L->nCcalls == L->baseCcalls);
-    status = L->status;
-  }
-  --L->nCcalls;
-  lua_unlock(L);
-  return status;
-}
-
-
-LUA_API int lua_yield (lua_State *L, int nresults) {
-  luai_userstateyield(L, nresults);
-  lua_lock(L);
-  if (L->nCcalls > L->baseCcalls)
-    luaG_runerror(L, "attempt to yield across metamethod/C-call boundary");
-  L->base = L->top - nresults;  /* protect stack slots below */
-  L->status = LUA_YIELD;
-  lua_unlock(L);
-  return -1;
-}
-
-
-int luaD_pcall (lua_State *L, Pfunc func, void *u,
-                ptrdiff_t old_top, ptrdiff_t ef) {
-  int status;
-  unsigned short oldnCcalls = L->nCcalls;
-  ptrdiff_t old_ci = saveci(L, L->ci);
-  lu_byte old_allowhooks = L->allowhook;
-  ptrdiff_t old_errfunc = L->errfunc;
-  L->errfunc = ef;
-  status = luaD_rawrunprotected(L, func, u);
-  if (status != 0) {  /* an error occurred? */
-    StkId oldtop = restorestack(L, old_top);
-    luaF_close(L, oldtop);  /* close eventual pending closures */
-    luaD_seterrorobj(L, status, oldtop);
-    L->nCcalls = oldnCcalls;
-    L->ci = restoreci(L, old_ci);
-    L->base = L->ci->base;
-    L->savedpc = L->ci->savedpc;
-    L->allowhook = old_allowhooks;
-    restore_stack_limit(L);
-  }
-  L->errfunc = old_errfunc;
-  return status;
-}
-
-
-
-/*
-** Execute a protected parser.
-*/
-struct SParser {  /* data to `f_parser' */
-  ZIO *z;
-  Mbuffer buff;  /* buffer to be used by the scanner */
-  const char *name;
-};
-
-static void f_parser (lua_State *L, void *ud) {
-  int i;
-  Proto *tf;
-  Closure *cl;
-  struct SParser *p = cast(struct SParser *, ud);
-  luaZ_lookahead(p->z);
-  luaC_checkGC(L);
-  tf = (luaY_parser)(L, p->z,
-                                                             &p->buff, p->name);
-  cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L)));
-  cl->l.p = tf;
-  for (i = 0; i < tf->nups; i++)  /* initialize eventual upvalues */
-    cl->l.upvals[i] = luaF_newupval(L);
-  setclvalue(L, L->top, cl);
-  incr_top(L);
-}
-
-
-int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) {
-  struct SParser p;
-  int status;
-  p.z = z; p.name = name;
-  luaZ_initbuffer(L, &p.buff);
-  status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc);
-  luaZ_freebuffer(L, &p.buff);
-  return status;
-}
-
-
diff --git a/redis-stable/deps/lua/src/ldo.h b/redis-stable/deps/lua/src/ldo.h
deleted file mode 100644
index 98fddac5..00000000
--- a/redis-stable/deps/lua/src/ldo.h
+++ /dev/null
@@ -1,57 +0,0 @@
-/*
-** $Id: ldo.h,v 2.7.1.1 2007/12/27 13:02:25 roberto Exp $
-** Stack and Call structure of Lua
-** See Copyright Notice in lua.h
-*/
-
-#ifndef ldo_h
-#define ldo_h
-
-
-#include "lobject.h"
-#include "lstate.h"
-#include "lzio.h"
-
-
-#define luaD_checkstack(L,n)	\
-  if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TValue)) \
-    luaD_growstack(L, n); \
-  else condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1));
-
-
-#define incr_top(L) {luaD_checkstack(L,1); L->top++;}
-
-#define savestack(L,p)		((char *)(p) - (char *)L->stack)
-#define restorestack(L,n)	((TValue *)((char *)L->stack + (n)))
-
-#define saveci(L,p)		((char *)(p) - (char *)L->base_ci)
-#define restoreci(L,n)		((CallInfo *)((char *)L->base_ci + (n)))
-
-
-/* results from luaD_precall */
-#define PCRLUA		0	/* initiated a call to a Lua function */
-#define PCRC		1	/* did a call to a C function */
-#define PCRYIELD	2	/* C funtion yielded */
-
-
-/* type of protected functions, to be ran by `runprotected' */
-typedef void (*Pfunc) (lua_State *L, void *ud);
-
-LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name);
-LUAI_FUNC void luaD_callhook (lua_State *L, int event, int line);
-LUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults);
-LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults);
-LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u,
-                                        ptrdiff_t oldtop, ptrdiff_t ef);
-LUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult);
-LUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize);
-LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize);
-LUAI_FUNC void luaD_growstack (lua_State *L, int n);
-
-LUAI_FUNC void luaD_throw (lua_State *L, int errcode);
-LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud);
-
-LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop);
-
-#endif
-
diff --git a/redis-stable/deps/lua/src/ldump.c b/redis-stable/deps/lua/src/ldump.c
deleted file mode 100644
index c9d3d487..00000000
--- a/redis-stable/deps/lua/src/ldump.c
+++ /dev/null
@@ -1,164 +0,0 @@
-/*
-** $Id: ldump.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
-** save precompiled Lua chunks
-** See Copyright Notice in lua.h
-*/
-
-#include <stddef.h>
-
-#define ldump_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lobject.h"
-#include "lstate.h"
-#include "lundump.h"
-
-typedef struct {
- lua_State* L;
- lua_Writer writer;
- void* data;
- int strip;
- int status;
-} DumpState;
-
-#define DumpMem(b,n,size,D)	DumpBlock(b,(n)*(size),D)
-#define DumpVar(x,D)	 	DumpMem(&x,1,sizeof(x),D)
-
-static void DumpBlock(const void* b, size_t size, DumpState* D)
-{
- if (D->status==0)
- {
-  lua_unlock(D->L);
-  D->status=(*D->writer)(D->L,b,size,D->data);
-  lua_lock(D->L);
- }
-}
-
-static void DumpChar(int y, DumpState* D)
-{
- char x=(char)y;
- DumpVar(x,D);
-}
-
-static void DumpInt(int x, DumpState* D)
-{
- DumpVar(x,D);
-}
-
-static void DumpNumber(lua_Number x, DumpState* D)
-{
- DumpVar(x,D);
-}
-
-static void DumpVector(const void* b, int n, size_t size, DumpState* D)
-{
- DumpInt(n,D);
- DumpMem(b,n,size,D);
-}
-
-static void DumpString(const TString* s, DumpState* D)
-{
- if (s==NULL || getstr(s)==NULL)
- {
-  size_t size=0;
-  DumpVar(size,D);
- }
- else
- {
-  size_t size=s->tsv.len+1;		/* include trailing '\0' */
-  DumpVar(size,D);
-  DumpBlock(getstr(s),size,D);
- }
-}
-
-#define DumpCode(f,D)	 DumpVector(f->code,f->sizecode,sizeof(Instruction),D)
-
-static void DumpFunction(const Proto* f, const TString* p, DumpState* D);
-
-static void DumpConstants(const Proto* f, DumpState* D)
-{
- int i,n=f->sizek;
- DumpInt(n,D);
- for (i=0; i<n; i++)
- {
-  const TValue* o=&f->k[i];
-  DumpChar(ttype(o),D);
-  switch (ttype(o))
-  {
-   case LUA_TNIL:
-	break;
-   case LUA_TBOOLEAN:
-	DumpChar(bvalue(o),D);
-	break;
-   case LUA_TNUMBER:
-	DumpNumber(nvalue(o),D);
-	break;
-   case LUA_TSTRING:
-	DumpString(rawtsvalue(o),D);
-	break;
-   default:
-	lua_assert(0);			/* cannot happen */
-	break;
-  }
- }
- n=f->sizep;
- DumpInt(n,D);
- for (i=0; i<n; i++) DumpFunction(f->p[i],f->source,D);
-}
-
-static void DumpDebug(const Proto* f, DumpState* D)
-{
- int i,n;
- n= (D->strip) ? 0 : f->sizelineinfo;
- DumpVector(f->lineinfo,n,sizeof(int),D);
- n= (D->strip) ? 0 : f->sizelocvars;
- DumpInt(n,D);
- for (i=0; i<n; i++)
- {
-  DumpString(f->locvars[i].varname,D);
-  DumpInt(f->locvars[i].startpc,D);
-  DumpInt(f->locvars[i].endpc,D);
- }
- n= (D->strip) ? 0 : f->sizeupvalues;
- DumpInt(n,D);
- for (i=0; i<n; i++) DumpString(f->upvalues[i],D);
-}
-
-static void DumpFunction(const Proto* f, const TString* p, DumpState* D)
-{
- DumpString((f->source==p || D->strip) ? NULL : f->source,D);
- DumpInt(f->linedefined,D);
- DumpInt(f->lastlinedefined,D);
- DumpChar(f->nups,D);
- DumpChar(f->numparams,D);
- DumpChar(f->is_vararg,D);
- DumpChar(f->maxstacksize,D);
- DumpCode(f,D);
- DumpConstants(f,D);
- DumpDebug(f,D);
-}
-
-static void DumpHeader(DumpState* D)
-{
- char h[LUAC_HEADERSIZE];
- luaU_header(h);
- DumpBlock(h,LUAC_HEADERSIZE,D);
-}
-
-/*
-** dump Lua function as precompiled chunk
-*/
-int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip)
-{
- DumpState D;
- D.L=L;
- D.writer=w;
- D.data=data;
- D.strip=strip;
- D.status=0;
- DumpHeader(&D);
- DumpFunction(f,NULL,&D);
- return D.status;
-}
diff --git a/redis-stable/deps/lua/src/lfunc.c b/redis-stable/deps/lua/src/lfunc.c
deleted file mode 100644
index 813e88f5..00000000
--- a/redis-stable/deps/lua/src/lfunc.c
+++ /dev/null
@@ -1,174 +0,0 @@
-/*
-** $Id: lfunc.c,v 2.12.1.2 2007/12/28 14:58:43 roberto Exp $
-** Auxiliary functions to manipulate prototypes and closures
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stddef.h>
-
-#define lfunc_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lfunc.h"
-#include "lgc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-
-
-
-Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {
-  Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
-  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
-  c->c.isC = 1;
-  c->c.env = e;
-  c->c.nupvalues = cast_byte(nelems);
-  return c;
-}
-
-
-Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {
-  Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
-  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
-  c->l.isC = 0;
-  c->l.env = e;
-  c->l.nupvalues = cast_byte(nelems);
-  while (nelems--) c->l.upvals[nelems] = NULL;
-  return c;
-}
-
-
-UpVal *luaF_newupval (lua_State *L) {
-  UpVal *uv = luaM_new(L, UpVal);
-  luaC_link(L, obj2gco(uv), LUA_TUPVAL);
-  uv->v = &uv->u.value;
-  setnilvalue(uv->v);
-  return uv;
-}
-
-
-UpVal *luaF_findupval (lua_State *L, StkId level) {
-  global_State *g = G(L);
-  GCObject **pp = &L->openupval;
-  UpVal *p;
-  UpVal *uv;
-  while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) {
-    lua_assert(p->v != &p->u.value);
-    if (p->v == level) {  /* found a corresponding upvalue? */
-      if (isdead(g, obj2gco(p)))  /* is it dead? */
-        changewhite(obj2gco(p));  /* ressurect it */
-      return p;
-    }
-    pp = &p->next;
-  }
-  uv = luaM_new(L, UpVal);  /* not found: create a new one */
-  uv->tt = LUA_TUPVAL;
-  uv->marked = luaC_white(g);
-  uv->v = level;  /* current value lives in the stack */
-  uv->next = *pp;  /* chain it in the proper position */
-  *pp = obj2gco(uv);
-  uv->u.l.prev = &g->uvhead;  /* double link it in `uvhead' list */
-  uv->u.l.next = g->uvhead.u.l.next;
-  uv->u.l.next->u.l.prev = uv;
-  g->uvhead.u.l.next = uv;
-  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
-  return uv;
-}
-
-
-static void unlinkupval (UpVal *uv) {
-  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
-  uv->u.l.next->u.l.prev = uv->u.l.prev;  /* remove from `uvhead' list */
-  uv->u.l.prev->u.l.next = uv->u.l.next;
-}
-
-
-void luaF_freeupval (lua_State *L, UpVal *uv) {
-  if (uv->v != &uv->u.value)  /* is it open? */
-    unlinkupval(uv);  /* remove from open list */
-  luaM_free(L, uv);  /* free upvalue */
-}
-
-
-void luaF_close (lua_State *L, StkId level) {
-  UpVal *uv;
-  global_State *g = G(L);
-  while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) {
-    GCObject *o = obj2gco(uv);
-    lua_assert(!isblack(o) && uv->v != &uv->u.value);
-    L->openupval = uv->next;  /* remove from `open' list */
-    if (isdead(g, o))
-      luaF_freeupval(L, uv);  /* free upvalue */
-    else {
-      unlinkupval(uv);
-      setobj(L, &uv->u.value, uv->v);
-      uv->v = &uv->u.value;  /* now current value lives here */
-      luaC_linkupval(L, uv);  /* link upvalue into `gcroot' list */
-    }
-  }
-}
-
-
-Proto *luaF_newproto (lua_State *L) {
-  Proto *f = luaM_new(L, Proto);
-  luaC_link(L, obj2gco(f), LUA_TPROTO);
-  f->k = NULL;
-  f->sizek = 0;
-  f->p = NULL;
-  f->sizep = 0;
-  f->code = NULL;
-  f->sizecode = 0;
-  f->sizelineinfo = 0;
-  f->sizeupvalues = 0;
-  f->nups = 0;
-  f->upvalues = NULL;
-  f->numparams = 0;
-  f->is_vararg = 0;
-  f->maxstacksize = 0;
-  f->lineinfo = NULL;
-  f->sizelocvars = 0;
-  f->locvars = NULL;
-  f->linedefined = 0;
-  f->lastlinedefined = 0;
-  f->source = NULL;
-  return f;
-}
-
-
-void luaF_freeproto (lua_State *L, Proto *f) {
-  luaM_freearray(L, f->code, f->sizecode, Instruction);
-  luaM_freearray(L, f->p, f->sizep, Proto *);
-  luaM_freearray(L, f->k, f->sizek, TValue);
-  luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
-  luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
-  luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
-  luaM_free(L, f);
-}
-
-
-void luaF_freeclosure (lua_State *L, Closure *c) {
-  int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
-                          sizeLclosure(c->l.nupvalues);
-  luaM_freemem(L, c, size);
-}
-
-
-/*
-** Look for n-th local variable at line `line' in function `func'.
-** Returns NULL if not found.
-*/
-const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
-  int i;
-  for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
-    if (pc < f->locvars[i].endpc) {  /* is variable active? */
-      local_number--;
-      if (local_number == 0)
-        return getstr(f->locvars[i].varname);
-    }
-  }
-  return NULL;  /* not found */
-}
-
diff --git a/redis-stable/deps/lua/src/lfunc.h b/redis-stable/deps/lua/src/lfunc.h
deleted file mode 100644
index a68cf515..00000000
--- a/redis-stable/deps/lua/src/lfunc.h
+++ /dev/null
@@ -1,34 +0,0 @@
-/*
-** $Id: lfunc.h,v 2.4.1.1 2007/12/27 13:02:25 roberto Exp $
-** Auxiliary functions to manipulate prototypes and closures
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lfunc_h
-#define lfunc_h
-
-
-#include "lobject.h"
-
-
-#define sizeCclosure(n)	(cast(int, sizeof(CClosure)) + \
-                         cast(int, sizeof(TValue)*((n)-1)))
-
-#define sizeLclosure(n)	(cast(int, sizeof(LClosure)) + \
-                         cast(int, sizeof(TValue *)*((n)-1)))
-
-
-LUAI_FUNC Proto *luaF_newproto (lua_State *L);
-LUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e);
-LUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e);
-LUAI_FUNC UpVal *luaF_newupval (lua_State *L);
-LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level);
-LUAI_FUNC void luaF_close (lua_State *L, StkId level);
-LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f);
-LUAI_FUNC void luaF_freeclosure (lua_State *L, Closure *c);
-LUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv);
-LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number,
-                                         int pc);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/lgc.c b/redis-stable/deps/lua/src/lgc.c
deleted file mode 100644
index e909c79a..00000000
--- a/redis-stable/deps/lua/src/lgc.c
+++ /dev/null
@@ -1,710 +0,0 @@
-/*
-** $Id: lgc.c,v 2.38.1.2 2011/03/18 18:05:38 roberto Exp $
-** Garbage Collector
-** See Copyright Notice in lua.h
-*/
-
-#include <string.h>
-
-#define lgc_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lgc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-
-
-#define GCSTEPSIZE	1024u
-#define GCSWEEPMAX	40
-#define GCSWEEPCOST	10
-#define GCFINALIZECOST	100
-
-
-#define maskmarks	cast_byte(~(bitmask(BLACKBIT)|WHITEBITS))
-
-#define makewhite(g,x)	\
-   ((x)->gch.marked = cast_byte(((x)->gch.marked & maskmarks) | luaC_white(g)))
-
-#define white2gray(x)	reset2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
-#define black2gray(x)	resetbit((x)->gch.marked, BLACKBIT)
-
-#define stringmark(s)	reset2bits((s)->tsv.marked, WHITE0BIT, WHITE1BIT)
-
-
-#define isfinalized(u)		testbit((u)->marked, FINALIZEDBIT)
-#define markfinalized(u)	l_setbit((u)->marked, FINALIZEDBIT)
-
-
-#define KEYWEAK         bitmask(KEYWEAKBIT)
-#define VALUEWEAK       bitmask(VALUEWEAKBIT)
-
-
-
-#define markvalue(g,o) { checkconsistency(o); \
-  if (iscollectable(o) && iswhite(gcvalue(o))) reallymarkobject(g,gcvalue(o)); }
-
-#define markobject(g,t) { if (iswhite(obj2gco(t))) \
-		reallymarkobject(g, obj2gco(t)); }
-
-
-#define setthreshold(g)  (g->GCthreshold = (g->estimate/100) * g->gcpause)
-
-
-static void removeentry (Node *n) {
-  lua_assert(ttisnil(gval(n)));
-  if (iscollectable(gkey(n)))
-    setttype(gkey(n), LUA_TDEADKEY);  /* dead key; remove it */
-}
-
-
-static void reallymarkobject (global_State *g, GCObject *o) {
-  lua_assert(iswhite(o) && !isdead(g, o));
-  white2gray(o);
-  switch (o->gch.tt) {
-    case LUA_TSTRING: {
-      return;
-    }
-    case LUA_TUSERDATA: {
-      Table *mt = gco2u(o)->metatable;
-      gray2black(o);  /* udata are never gray */
-      if (mt) markobject(g, mt);
-      markobject(g, gco2u(o)->env);
-      return;
-    }
-    case LUA_TUPVAL: {
-      UpVal *uv = gco2uv(o);
-      markvalue(g, uv->v);
-      if (uv->v == &uv->u.value)  /* closed? */
-        gray2black(o);  /* open upvalues are never black */
-      return;
-    }
-    case LUA_TFUNCTION: {
-      gco2cl(o)->c.gclist = g->gray;
-      g->gray = o;
-      break;
-    }
-    case LUA_TTABLE: {
-      gco2h(o)->gclist = g->gray;
-      g->gray = o;
-      break;
-    }
-    case LUA_TTHREAD: {
-      gco2th(o)->gclist = g->gray;
-      g->gray = o;
-      break;
-    }
-    case LUA_TPROTO: {
-      gco2p(o)->gclist = g->gray;
-      g->gray = o;
-      break;
-    }
-    default: lua_assert(0);
-  }
-}
-
-
-static void marktmu (global_State *g) {
-  GCObject *u = g->tmudata;
-  if (u) {
-    do {
-      u = u->gch.next;
-      makewhite(g, u);  /* may be marked, if left from previous GC */
-      reallymarkobject(g, u);
-    } while (u != g->tmudata);
-  }
-}
-
-
-/* move `dead' udata that need finalization to list `tmudata' */
-size_t luaC_separateudata (lua_State *L, int all) {
-  global_State *g = G(L);
-  size_t deadmem = 0;
-  GCObject **p = &g->mainthread->next;
-  GCObject *curr;
-  while ((curr = *p) != NULL) {
-    if (!(iswhite(curr) || all) || isfinalized(gco2u(curr)))
-      p = &curr->gch.next;  /* don't bother with them */
-    else if (fasttm(L, gco2u(curr)->metatable, TM_GC) == NULL) {
-      markfinalized(gco2u(curr));  /* don't need finalization */
-      p = &curr->gch.next;
-    }
-    else {  /* must call its gc method */
-      deadmem += sizeudata(gco2u(curr));
-      markfinalized(gco2u(curr));
-      *p = curr->gch.next;
-      /* link `curr' at the end of `tmudata' list */
-      if (g->tmudata == NULL)  /* list is empty? */
-        g->tmudata = curr->gch.next = curr;  /* creates a circular list */
-      else {
-        curr->gch.next = g->tmudata->gch.next;
-        g->tmudata->gch.next = curr;
-        g->tmudata = curr;
-      }
-    }
-  }
-  return deadmem;
-}
-
-
-static int traversetable (global_State *g, Table *h) {
-  int i;
-  int weakkey = 0;
-  int weakvalue = 0;
-  const TValue *mode;
-  if (h->metatable)
-    markobject(g, h->metatable);
-  mode = gfasttm(g, h->metatable, TM_MODE);
-  if (mode && ttisstring(mode)) {  /* is there a weak mode? */
-    weakkey = (strchr(svalue(mode), 'k') != NULL);
-    weakvalue = (strchr(svalue(mode), 'v') != NULL);
-    if (weakkey || weakvalue) {  /* is really weak? */
-      h->marked &= ~(KEYWEAK | VALUEWEAK);  /* clear bits */
-      h->marked |= cast_byte((weakkey << KEYWEAKBIT) |
-                             (weakvalue << VALUEWEAKBIT));
-      h->gclist = g->weak;  /* must be cleared after GC, ... */
-      g->weak = obj2gco(h);  /* ... so put in the appropriate list */
-    }
-  }
-  if (weakkey && weakvalue) return 1;
-  if (!weakvalue) {
-    i = h->sizearray;
-    while (i--)
-      markvalue(g, &h->array[i]);
-  }
-  i = sizenode(h);
-  while (i--) {
-    Node *n = gnode(h, i);
-    lua_assert(ttype(gkey(n)) != LUA_TDEADKEY || ttisnil(gval(n)));
-    if (ttisnil(gval(n)))
-      removeentry(n);  /* remove empty entries */
-    else {
-      lua_assert(!ttisnil(gkey(n)));
-      if (!weakkey) markvalue(g, gkey(n));
-      if (!weakvalue) markvalue(g, gval(n));
-    }
-  }
-  return weakkey || weakvalue;
-}
-
-
-/*
-** All marks are conditional because a GC may happen while the
-** prototype is still being created
-*/
-static void traverseproto (global_State *g, Proto *f) {
-  int i;
-  if (f->source) stringmark(f->source);
-  for (i=0; i<f->sizek; i++)  /* mark literals */
-    markvalue(g, &f->k[i]);
-  for (i=0; i<f->sizeupvalues; i++) {  /* mark upvalue names */
-    if (f->upvalues[i])
-      stringmark(f->upvalues[i]);
-  }
-  for (i=0; i<f->sizep; i++) {  /* mark nested protos */
-    if (f->p[i])
-      markobject(g, f->p[i]);
-  }
-  for (i=0; i<f->sizelocvars; i++) {  /* mark local-variable names */
-    if (f->locvars[i].varname)
-      stringmark(f->locvars[i].varname);
-  }
-}
-
-
-
-static void traverseclosure (global_State *g, Closure *cl) {
-  markobject(g, cl->c.env);
-  if (cl->c.isC) {
-    int i;
-    for (i=0; i<cl->c.nupvalues; i++)  /* mark its upvalues */
-      markvalue(g, &cl->c.upvalue[i]);
-  }
-  else {
-    int i;
-    lua_assert(cl->l.nupvalues == cl->l.p->nups);
-    markobject(g, cl->l.p);
-    for (i=0; i<cl->l.nupvalues; i++)  /* mark its upvalues */
-      markobject(g, cl->l.upvals[i]);
-  }
-}
-
-
-static void checkstacksizes (lua_State *L, StkId max) {
-  int ci_used = cast_int(L->ci - L->base_ci);  /* number of `ci' in use */
-  int s_used = cast_int(max - L->stack);  /* part of stack in use */
-  if (L->size_ci > LUAI_MAXCALLS)  /* handling overflow? */
-    return;  /* do not touch the stacks */
-  if (4*ci_used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci)
-    luaD_reallocCI(L, L->size_ci/2);  /* still big enough... */
-  condhardstacktests(luaD_reallocCI(L, ci_used + 1));
-  if (4*s_used < L->stacksize &&
-      2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize)
-    luaD_reallocstack(L, L->stacksize/2);  /* still big enough... */
-  condhardstacktests(luaD_reallocstack(L, s_used));
-}
-
-
-static void traversestack (global_State *g, lua_State *l) {
-  StkId o, lim;
-  CallInfo *ci;
-  markvalue(g, gt(l));
-  lim = l->top;
-  for (ci = l->base_ci; ci <= l->ci; ci++) {
-    lua_assert(ci->top <= l->stack_last);
-    if (lim < ci->top) lim = ci->top;
-  }
-  for (o = l->stack; o < l->top; o++)
-    markvalue(g, o);
-  for (; o <= lim; o++)
-    setnilvalue(o);
-  checkstacksizes(l, lim);
-}
-
-
-/*
-** traverse one gray object, turning it to black.
-** Returns `quantity' traversed.
-*/
-static l_mem propagatemark (global_State *g) {
-  GCObject *o = g->gray;
-  lua_assert(isgray(o));
-  gray2black(o);
-  switch (o->gch.tt) {
-    case LUA_TTABLE: {
-      Table *h = gco2h(o);
-      g->gray = h->gclist;
-      if (traversetable(g, h))  /* table is weak? */
-        black2gray(o);  /* keep it gray */
-      return sizeof(Table) + sizeof(TValue) * h->sizearray +
-                             sizeof(Node) * sizenode(h);
-    }
-    case LUA_TFUNCTION: {
-      Closure *cl = gco2cl(o);
-      g->gray = cl->c.gclist;
-      traverseclosure(g, cl);
-      return (cl->c.isC) ? sizeCclosure(cl->c.nupvalues) :
-                           sizeLclosure(cl->l.nupvalues);
-    }
-    case LUA_TTHREAD: {
-      lua_State *th = gco2th(o);
-      g->gray = th->gclist;
-      th->gclist = g->grayagain;
-      g->grayagain = o;
-      black2gray(o);
-      traversestack(g, th);
-      return sizeof(lua_State) + sizeof(TValue) * th->stacksize +
-                                 sizeof(CallInfo) * th->size_ci;
-    }
-    case LUA_TPROTO: {
-      Proto *p = gco2p(o);
-      g->gray = p->gclist;
-      traverseproto(g, p);
-      return sizeof(Proto) + sizeof(Instruction) * p->sizecode +
-                             sizeof(Proto *) * p->sizep +
-                             sizeof(TValue) * p->sizek + 
-                             sizeof(int) * p->sizelineinfo +
-                             sizeof(LocVar) * p->sizelocvars +
-                             sizeof(TString *) * p->sizeupvalues;
-    }
-    default: lua_assert(0); return 0;
-  }
-}
-
-
-static size_t propagateall (global_State *g) {
-  size_t m = 0;
-  while (g->gray) m += propagatemark(g);
-  return m;
-}
-
-
-/*
-** The next function tells whether a key or value can be cleared from
-** a weak table. Non-collectable objects are never removed from weak
-** tables. Strings behave as `values', so are never removed too. for
-** other objects: if really collected, cannot keep them; for userdata
-** being finalized, keep them in keys, but not in values
-*/
-static int iscleared (const TValue *o, int iskey) {
-  if (!iscollectable(o)) return 0;
-  if (ttisstring(o)) {
-    stringmark(rawtsvalue(o));  /* strings are `values', so are never weak */
-    return 0;
-  }
-  return iswhite(gcvalue(o)) ||
-    (ttisuserdata(o) && (!iskey && isfinalized(uvalue(o))));
-}
-
-
-/*
-** clear collected entries from weaktables
-*/
-static void cleartable (GCObject *l) {
-  while (l) {
-    Table *h = gco2h(l);
-    int i = h->sizearray;
-    lua_assert(testbit(h->marked, VALUEWEAKBIT) ||
-               testbit(h->marked, KEYWEAKBIT));
-    if (testbit(h->marked, VALUEWEAKBIT)) {
-      while (i--) {
-        TValue *o = &h->array[i];
-        if (iscleared(o, 0))  /* value was collected? */
-          setnilvalue(o);  /* remove value */
-      }
-    }
-    i = sizenode(h);
-    while (i--) {
-      Node *n = gnode(h, i);
-      if (!ttisnil(gval(n)) &&  /* non-empty entry? */
-          (iscleared(key2tval(n), 1) || iscleared(gval(n), 0))) {
-        setnilvalue(gval(n));  /* remove value ... */
-        removeentry(n);  /* remove entry from table */
-      }
-    }
-    l = h->gclist;
-  }
-}
-
-
-static void freeobj (lua_State *L, GCObject *o) {
-  switch (o->gch.tt) {
-    case LUA_TPROTO: luaF_freeproto(L, gco2p(o)); break;
-    case LUA_TFUNCTION: luaF_freeclosure(L, gco2cl(o)); break;
-    case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break;
-    case LUA_TTABLE: luaH_free(L, gco2h(o)); break;
-    case LUA_TTHREAD: {
-      lua_assert(gco2th(o) != L && gco2th(o) != G(L)->mainthread);
-      luaE_freethread(L, gco2th(o));
-      break;
-    }
-    case LUA_TSTRING: {
-      G(L)->strt.nuse--;
-      luaM_freemem(L, o, sizestring(gco2ts(o)));
-      break;
-    }
-    case LUA_TUSERDATA: {
-      luaM_freemem(L, o, sizeudata(gco2u(o)));
-      break;
-    }
-    default: lua_assert(0);
-  }
-}
-
-
-
-#define sweepwholelist(L,p)	sweeplist(L,p,MAX_LUMEM)
-
-
-static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) {
-  GCObject *curr;
-  global_State *g = G(L);
-  int deadmask = otherwhite(g);
-  while ((curr = *p) != NULL && count-- > 0) {
-    if (curr->gch.tt == LUA_TTHREAD)  /* sweep open upvalues of each thread */
-      sweepwholelist(L, &gco2th(curr)->openupval);
-    if ((curr->gch.marked ^ WHITEBITS) & deadmask) {  /* not dead? */
-      lua_assert(!isdead(g, curr) || testbit(curr->gch.marked, FIXEDBIT));
-      makewhite(g, curr);  /* make it white (for next cycle) */
-      p = &curr->gch.next;
-    }
-    else {  /* must erase `curr' */
-      lua_assert(isdead(g, curr) || deadmask == bitmask(SFIXEDBIT));
-      *p = curr->gch.next;
-      if (curr == g->rootgc)  /* is the first element of the list? */
-        g->rootgc = curr->gch.next;  /* adjust first */
-      freeobj(L, curr);
-    }
-  }
-  return p;
-}
-
-
-static void checkSizes (lua_State *L) {
-  global_State *g = G(L);
-  /* check size of string hash */
-  if (g->strt.nuse < cast(lu_int32, g->strt.size/4) &&
-      g->strt.size > MINSTRTABSIZE*2)
-    luaS_resize(L, g->strt.size/2);  /* table is too big */
-  /* check size of buffer */
-  if (luaZ_sizebuffer(&g->buff) > LUA_MINBUFFER*2) {  /* buffer too big? */
-    size_t newsize = luaZ_sizebuffer(&g->buff) / 2;
-    luaZ_resizebuffer(L, &g->buff, newsize);
-  }
-}
-
-
-static void GCTM (lua_State *L) {
-  global_State *g = G(L);
-  GCObject *o = g->tmudata->gch.next;  /* get first element */
-  Udata *udata = rawgco2u(o);
-  const TValue *tm;
-  /* remove udata from `tmudata' */
-  if (o == g->tmudata)  /* last element? */
-    g->tmudata = NULL;
-  else
-    g->tmudata->gch.next = udata->uv.next;
-  udata->uv.next = g->mainthread->next;  /* return it to `root' list */
-  g->mainthread->next = o;
-  makewhite(g, o);
-  tm = fasttm(L, udata->uv.metatable, TM_GC);
-  if (tm != NULL) {
-    lu_byte oldah = L->allowhook;
-    lu_mem oldt = g->GCthreshold;
-    L->allowhook = 0;  /* stop debug hooks during GC tag method */
-    g->GCthreshold = 2*g->totalbytes;  /* avoid GC steps */
-    setobj2s(L, L->top, tm);
-    setuvalue(L, L->top+1, udata);
-    L->top += 2;
-    luaD_call(L, L->top - 2, 0);
-    L->allowhook = oldah;  /* restore hooks */
-    g->GCthreshold = oldt;  /* restore threshold */
-  }
-}
-
-
-/*
-** Call all GC tag methods
-*/
-void luaC_callGCTM (lua_State *L) {
-  while (G(L)->tmudata)
-    GCTM(L);
-}
-
-
-void luaC_freeall (lua_State *L) {
-  global_State *g = G(L);
-  int i;
-  g->currentwhite = WHITEBITS | bitmask(SFIXEDBIT);  /* mask to collect all elements */
-  sweepwholelist(L, &g->rootgc);
-  for (i = 0; i < g->strt.size; i++)  /* free all string lists */
-    sweepwholelist(L, &g->strt.hash[i]);
-}
-
-
-static void markmt (global_State *g) {
-  int i;
-  for (i=0; i<NUM_TAGS; i++)
-    if (g->mt[i]) markobject(g, g->mt[i]);
-}
-
-
-/* mark root set */
-static void markroot (lua_State *L) {
-  global_State *g = G(L);
-  g->gray = NULL;
-  g->grayagain = NULL;
-  g->weak = NULL;
-  markobject(g, g->mainthread);
-  /* make global table be traversed before main stack */
-  markvalue(g, gt(g->mainthread));
-  markvalue(g, registry(L));
-  markmt(g);
-  g->gcstate = GCSpropagate;
-}
-
-
-static void remarkupvals (global_State *g) {
-  UpVal *uv;
-  for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) {
-    lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
-    if (isgray(obj2gco(uv)))
-      markvalue(g, uv->v);
-  }
-}
-
-
-static void atomic (lua_State *L) {
-  global_State *g = G(L);
-  size_t udsize;  /* total size of userdata to be finalized */
-  /* remark occasional upvalues of (maybe) dead threads */
-  remarkupvals(g);
-  /* traverse objects cautch by write barrier and by 'remarkupvals' */
-  propagateall(g);
-  /* remark weak tables */
-  g->gray = g->weak;
-  g->weak = NULL;
-  lua_assert(!iswhite(obj2gco(g->mainthread)));
-  markobject(g, L);  /* mark running thread */
-  markmt(g);  /* mark basic metatables (again) */
-  propagateall(g);
-  /* remark gray again */
-  g->gray = g->grayagain;
-  g->grayagain = NULL;
-  propagateall(g);
-  udsize = luaC_separateudata(L, 0);  /* separate userdata to be finalized */
-  marktmu(g);  /* mark `preserved' userdata */
-  udsize += propagateall(g);  /* remark, to propagate `preserveness' */
-  cleartable(g->weak);  /* remove collected objects from weak tables */
-  /* flip current white */
-  g->currentwhite = cast_byte(otherwhite(g));
-  g->sweepstrgc = 0;
-  g->sweepgc = &g->rootgc;
-  g->gcstate = GCSsweepstring;
-  g->estimate = g->totalbytes - udsize;  /* first estimate */
-}
-
-
-static l_mem singlestep (lua_State *L) {
-  global_State *g = G(L);
-  /*lua_checkmemory(L);*/
-  switch (g->gcstate) {
-    case GCSpause: {
-      markroot(L);  /* start a new collection */
-      return 0;
-    }
-    case GCSpropagate: {
-      if (g->gray)
-        return propagatemark(g);
-      else {  /* no more `gray' objects */
-        atomic(L);  /* finish mark phase */
-        return 0;
-      }
-    }
-    case GCSsweepstring: {
-      lu_mem old = g->totalbytes;
-      sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]);
-      if (g->sweepstrgc >= g->strt.size)  /* nothing more to sweep? */
-        g->gcstate = GCSsweep;  /* end sweep-string phase */
-      lua_assert(old >= g->totalbytes);
-      g->estimate -= old - g->totalbytes;
-      return GCSWEEPCOST;
-    }
-    case GCSsweep: {
-      lu_mem old = g->totalbytes;
-      g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX);
-      if (*g->sweepgc == NULL) {  /* nothing more to sweep? */
-        checkSizes(L);
-        g->gcstate = GCSfinalize;  /* end sweep phase */
-      }
-      lua_assert(old >= g->totalbytes);
-      g->estimate -= old - g->totalbytes;
-      return GCSWEEPMAX*GCSWEEPCOST;
-    }
-    case GCSfinalize: {
-      if (g->tmudata) {
-        GCTM(L);
-        if (g->estimate > GCFINALIZECOST)
-          g->estimate -= GCFINALIZECOST;
-        return GCFINALIZECOST;
-      }
-      else {
-        g->gcstate = GCSpause;  /* end collection */
-        g->gcdept = 0;
-        return 0;
-      }
-    }
-    default: lua_assert(0); return 0;
-  }
-}
-
-
-void luaC_step (lua_State *L) {
-  global_State *g = G(L);
-  l_mem lim = (GCSTEPSIZE/100) * g->gcstepmul;
-  if (lim == 0)
-    lim = (MAX_LUMEM-1)/2;  /* no limit */
-  g->gcdept += g->totalbytes - g->GCthreshold;
-  do {
-    lim -= singlestep(L);
-    if (g->gcstate == GCSpause)
-      break;
-  } while (lim > 0);
-  if (g->gcstate != GCSpause) {
-    if (g->gcdept < GCSTEPSIZE)
-      g->GCthreshold = g->totalbytes + GCSTEPSIZE;  /* - lim/g->gcstepmul;*/
-    else {
-      g->gcdept -= GCSTEPSIZE;
-      g->GCthreshold = g->totalbytes;
-    }
-  }
-  else {
-    setthreshold(g);
-  }
-}
-
-
-void luaC_fullgc (lua_State *L) {
-  global_State *g = G(L);
-  if (g->gcstate <= GCSpropagate) {
-    /* reset sweep marks to sweep all elements (returning them to white) */
-    g->sweepstrgc = 0;
-    g->sweepgc = &g->rootgc;
-    /* reset other collector lists */
-    g->gray = NULL;
-    g->grayagain = NULL;
-    g->weak = NULL;
-    g->gcstate = GCSsweepstring;
-  }
-  lua_assert(g->gcstate != GCSpause && g->gcstate != GCSpropagate);
-  /* finish any pending sweep phase */
-  while (g->gcstate != GCSfinalize) {
-    lua_assert(g->gcstate == GCSsweepstring || g->gcstate == GCSsweep);
-    singlestep(L);
-  }
-  markroot(L);
-  while (g->gcstate != GCSpause) {
-    singlestep(L);
-  }
-  setthreshold(g);
-}
-
-
-void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v) {
-  global_State *g = G(L);
-  lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));
-  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
-  lua_assert(ttype(&o->gch) != LUA_TTABLE);
-  /* must keep invariant? */
-  if (g->gcstate == GCSpropagate)
-    reallymarkobject(g, v);  /* restore invariant */
-  else  /* don't mind */
-    makewhite(g, o);  /* mark as white just to avoid other barriers */
-}
-
-
-void luaC_barrierback (lua_State *L, Table *t) {
-  global_State *g = G(L);
-  GCObject *o = obj2gco(t);
-  lua_assert(isblack(o) && !isdead(g, o));
-  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
-  black2gray(o);  /* make table gray (again) */
-  t->gclist = g->grayagain;
-  g->grayagain = o;
-}
-
-
-void luaC_link (lua_State *L, GCObject *o, lu_byte tt) {
-  global_State *g = G(L);
-  o->gch.next = g->rootgc;
-  g->rootgc = o;
-  o->gch.marked = luaC_white(g);
-  o->gch.tt = tt;
-}
-
-
-void luaC_linkupval (lua_State *L, UpVal *uv) {
-  global_State *g = G(L);
-  GCObject *o = obj2gco(uv);
-  o->gch.next = g->rootgc;  /* link upvalue into `rootgc' list */
-  g->rootgc = o;
-  if (isgray(o)) { 
-    if (g->gcstate == GCSpropagate) {
-      gray2black(o);  /* closed upvalues need barrier */
-      luaC_barrier(L, uv, uv->v);
-    }
-    else {  /* sweep phase: sweep it (turning it into white) */
-      makewhite(g, o);
-      lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);
-    }
-  }
-}
-
diff --git a/redis-stable/deps/lua/src/lgc.h b/redis-stable/deps/lua/src/lgc.h
deleted file mode 100644
index 5a8dc605..00000000
--- a/redis-stable/deps/lua/src/lgc.h
+++ /dev/null
@@ -1,110 +0,0 @@
-/*
-** $Id: lgc.h,v 2.15.1.1 2007/12/27 13:02:25 roberto Exp $
-** Garbage Collector
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lgc_h
-#define lgc_h
-
-
-#include "lobject.h"
-
-
-/*
-** Possible states of the Garbage Collector
-*/
-#define GCSpause	0
-#define GCSpropagate	1
-#define GCSsweepstring	2
-#define GCSsweep	3
-#define GCSfinalize	4
-
-
-/*
-** some userful bit tricks
-*/
-#define resetbits(x,m)	((x) &= cast(lu_byte, ~(m)))
-#define setbits(x,m)	((x) |= (m))
-#define testbits(x,m)	((x) & (m))
-#define bitmask(b)	(1<<(b))
-#define bit2mask(b1,b2)	(bitmask(b1) | bitmask(b2))
-#define l_setbit(x,b)	setbits(x, bitmask(b))
-#define resetbit(x,b)	resetbits(x, bitmask(b))
-#define testbit(x,b)	testbits(x, bitmask(b))
-#define set2bits(x,b1,b2)	setbits(x, (bit2mask(b1, b2)))
-#define reset2bits(x,b1,b2)	resetbits(x, (bit2mask(b1, b2)))
-#define test2bits(x,b1,b2)	testbits(x, (bit2mask(b1, b2)))
-
-
-
-/*
-** Layout for bit use in `marked' field:
-** bit 0 - object is white (type 0)
-** bit 1 - object is white (type 1)
-** bit 2 - object is black
-** bit 3 - for userdata: has been finalized
-** bit 3 - for tables: has weak keys
-** bit 4 - for tables: has weak values
-** bit 5 - object is fixed (should not be collected)
-** bit 6 - object is "super" fixed (only the main thread)
-*/
-
-
-#define WHITE0BIT	0
-#define WHITE1BIT	1
-#define BLACKBIT	2
-#define FINALIZEDBIT	3
-#define KEYWEAKBIT	3
-#define VALUEWEAKBIT	4
-#define FIXEDBIT	5
-#define SFIXEDBIT	6
-#define WHITEBITS	bit2mask(WHITE0BIT, WHITE1BIT)
-
-
-#define iswhite(x)      test2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)
-#define isblack(x)      testbit((x)->gch.marked, BLACKBIT)
-#define isgray(x)	(!isblack(x) && !iswhite(x))
-
-#define otherwhite(g)	(g->currentwhite ^ WHITEBITS)
-#define isdead(g,v)	((v)->gch.marked & otherwhite(g) & WHITEBITS)
-
-#define changewhite(x)	((x)->gch.marked ^= WHITEBITS)
-#define gray2black(x)	l_setbit((x)->gch.marked, BLACKBIT)
-
-#define valiswhite(x)	(iscollectable(x) && iswhite(gcvalue(x)))
-
-#define luaC_white(g)	cast(lu_byte, (g)->currentwhite & WHITEBITS)
-
-
-#define luaC_checkGC(L) { \
-  condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); \
-  if (G(L)->totalbytes >= G(L)->GCthreshold) \
-	luaC_step(L); }
-
-
-#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p)))  \
-	luaC_barrierf(L,obj2gco(p),gcvalue(v)); }
-
-#define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t)))  \
-	luaC_barrierback(L,t); }
-
-#define luaC_objbarrier(L,p,o)  \
-	{ if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \
-		luaC_barrierf(L,obj2gco(p),obj2gco(o)); }
-
-#define luaC_objbarriert(L,t,o)  \
-   { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) luaC_barrierback(L,t); }
-
-LUAI_FUNC size_t luaC_separateudata (lua_State *L, int all);
-LUAI_FUNC void luaC_callGCTM (lua_State *L);
-LUAI_FUNC void luaC_freeall (lua_State *L);
-LUAI_FUNC void luaC_step (lua_State *L);
-LUAI_FUNC void luaC_fullgc (lua_State *L);
-LUAI_FUNC void luaC_link (lua_State *L, GCObject *o, lu_byte tt);
-LUAI_FUNC void luaC_linkupval (lua_State *L, UpVal *uv);
-LUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v);
-LUAI_FUNC void luaC_barrierback (lua_State *L, Table *t);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/linit.c b/redis-stable/deps/lua/src/linit.c
deleted file mode 100644
index c1f90dfa..00000000
--- a/redis-stable/deps/lua/src/linit.c
+++ /dev/null
@@ -1,38 +0,0 @@
-/*
-** $Id: linit.c,v 1.14.1.1 2007/12/27 13:02:25 roberto Exp $
-** Initialization of libraries for lua.c
-** See Copyright Notice in lua.h
-*/
-
-
-#define linit_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lualib.h"
-#include "lauxlib.h"
-
-
-static const luaL_Reg lualibs[] = {
-  {"", luaopen_base},
-  {LUA_LOADLIBNAME, luaopen_package},
-  {LUA_TABLIBNAME, luaopen_table},
-  {LUA_IOLIBNAME, luaopen_io},
-  {LUA_OSLIBNAME, luaopen_os},
-  {LUA_STRLIBNAME, luaopen_string},
-  {LUA_MATHLIBNAME, luaopen_math},
-  {LUA_DBLIBNAME, luaopen_debug},
-  {NULL, NULL}
-};
-
-
-LUALIB_API void luaL_openlibs (lua_State *L) {
-  const luaL_Reg *lib = lualibs;
-  for (; lib->func; lib++) {
-    lua_pushcfunction(L, lib->func);
-    lua_pushstring(L, lib->name);
-    lua_call(L, 1, 0);
-  }
-}
-
diff --git a/redis-stable/deps/lua/src/liolib.c b/redis-stable/deps/lua/src/liolib.c
deleted file mode 100644
index 649f9a59..00000000
--- a/redis-stable/deps/lua/src/liolib.c
+++ /dev/null
@@ -1,556 +0,0 @@
-/*
-** $Id: liolib.c,v 2.73.1.4 2010/05/14 15:33:51 roberto Exp $
-** Standard I/O (and system) library
-** See Copyright Notice in lua.h
-*/
-
-
-#include <errno.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define liolib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-
-#define IO_INPUT	1
-#define IO_OUTPUT	2
-
-
-static const char *const fnames[] = {"input", "output"};
-
-
-static int pushresult (lua_State *L, int i, const char *filename) {
-  int en = errno;  /* calls to Lua API may change this value */
-  if (i) {
-    lua_pushboolean(L, 1);
-    return 1;
-  }
-  else {
-    lua_pushnil(L);
-    if (filename)
-      lua_pushfstring(L, "%s: %s", filename, strerror(en));
-    else
-      lua_pushfstring(L, "%s", strerror(en));
-    lua_pushinteger(L, en);
-    return 3;
-  }
-}
-
-
-static void fileerror (lua_State *L, int arg, const char *filename) {
-  lua_pushfstring(L, "%s: %s", filename, strerror(errno));
-  luaL_argerror(L, arg, lua_tostring(L, -1));
-}
-
-
-#define tofilep(L)	((FILE **)luaL_checkudata(L, 1, LUA_FILEHANDLE))
-
-
-static int io_type (lua_State *L) {
-  void *ud;
-  luaL_checkany(L, 1);
-  ud = lua_touserdata(L, 1);
-  lua_getfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);
-  if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1))
-    lua_pushnil(L);  /* not a file */
-  else if (*((FILE **)ud) == NULL)
-    lua_pushliteral(L, "closed file");
-  else
-    lua_pushliteral(L, "file");
-  return 1;
-}
-
-
-static FILE *tofile (lua_State *L) {
-  FILE **f = tofilep(L);
-  if (*f == NULL)
-    luaL_error(L, "attempt to use a closed file");
-  return *f;
-}
-
-
-
-/*
-** When creating file handles, always creates a `closed' file handle
-** before opening the actual file; so, if there is a memory error, the
-** file is not left opened.
-*/
-static FILE **newfile (lua_State *L) {
-  FILE **pf = (FILE **)lua_newuserdata(L, sizeof(FILE *));
-  *pf = NULL;  /* file handle is currently `closed' */
-  luaL_getmetatable(L, LUA_FILEHANDLE);
-  lua_setmetatable(L, -2);
-  return pf;
-}
-
-
-/*
-** function to (not) close the standard files stdin, stdout, and stderr
-*/
-static int io_noclose (lua_State *L) {
-  lua_pushnil(L);
-  lua_pushliteral(L, "cannot close standard file");
-  return 2;
-}
-
-
-/*
-** function to close 'popen' files
-*/
-static int io_pclose (lua_State *L) {
-  FILE **p = tofilep(L);
-  int ok = lua_pclose(L, *p);
-  *p = NULL;
-  return pushresult(L, ok, NULL);
-}
-
-
-/*
-** function to close regular files
-*/
-static int io_fclose (lua_State *L) {
-  FILE **p = tofilep(L);
-  int ok = (fclose(*p) == 0);
-  *p = NULL;
-  return pushresult(L, ok, NULL);
-}
-
-
-static int aux_close (lua_State *L) {
-  lua_getfenv(L, 1);
-  lua_getfield(L, -1, "__close");
-  return (lua_tocfunction(L, -1))(L);
-}
-
-
-static int io_close (lua_State *L) {
-  if (lua_isnone(L, 1))
-    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_OUTPUT);
-  tofile(L);  /* make sure argument is a file */
-  return aux_close(L);
-}
-
-
-static int io_gc (lua_State *L) {
-  FILE *f = *tofilep(L);
-  /* ignore closed files */
-  if (f != NULL)
-    aux_close(L);
-  return 0;
-}
-
-
-static int io_tostring (lua_State *L) {
-  FILE *f = *tofilep(L);
-  if (f == NULL)
-    lua_pushliteral(L, "file (closed)");
-  else
-    lua_pushfstring(L, "file (%p)", f);
-  return 1;
-}
-
-
-static int io_open (lua_State *L) {
-  const char *filename = luaL_checkstring(L, 1);
-  const char *mode = luaL_optstring(L, 2, "r");
-  FILE **pf = newfile(L);
-  *pf = fopen(filename, mode);
-  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
-}
-
-
-/*
-** this function has a separated environment, which defines the
-** correct __close for 'popen' files
-*/
-static int io_popen (lua_State *L) {
-  const char *filename = luaL_checkstring(L, 1);
-  const char *mode = luaL_optstring(L, 2, "r");
-  FILE **pf = newfile(L);
-  *pf = lua_popen(L, filename, mode);
-  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;
-}
-
-
-static int io_tmpfile (lua_State *L) {
-  FILE **pf = newfile(L);
-  *pf = tmpfile();
-  return (*pf == NULL) ? pushresult(L, 0, NULL) : 1;
-}
-
-
-static FILE *getiofile (lua_State *L, int findex) {
-  FILE *f;
-  lua_rawgeti(L, LUA_ENVIRONINDEX, findex);
-  f = *(FILE **)lua_touserdata(L, -1);
-  if (f == NULL)
-    luaL_error(L, "standard %s file is closed", fnames[findex - 1]);
-  return f;
-}
-
-
-static int g_iofile (lua_State *L, int f, const char *mode) {
-  if (!lua_isnoneornil(L, 1)) {
-    const char *filename = lua_tostring(L, 1);
-    if (filename) {
-      FILE **pf = newfile(L);
-      *pf = fopen(filename, mode);
-      if (*pf == NULL)
-        fileerror(L, 1, filename);
-    }
-    else {
-      tofile(L);  /* check that it's a valid file handle */
-      lua_pushvalue(L, 1);
-    }
-    lua_rawseti(L, LUA_ENVIRONINDEX, f);
-  }
-  /* return current value */
-  lua_rawgeti(L, LUA_ENVIRONINDEX, f);
-  return 1;
-}
-
-
-static int io_input (lua_State *L) {
-  return g_iofile(L, IO_INPUT, "r");
-}
-
-
-static int io_output (lua_State *L) {
-  return g_iofile(L, IO_OUTPUT, "w");
-}
-
-
-static int io_readline (lua_State *L);
-
-
-static void aux_lines (lua_State *L, int idx, int toclose) {
-  lua_pushvalue(L, idx);
-  lua_pushboolean(L, toclose);  /* close/not close file when finished */
-  lua_pushcclosure(L, io_readline, 2);
-}
-
-
-static int f_lines (lua_State *L) {
-  tofile(L);  /* check that it's a valid file handle */
-  aux_lines(L, 1, 0);
-  return 1;
-}
-
-
-static int io_lines (lua_State *L) {
-  if (lua_isnoneornil(L, 1)) {  /* no arguments? */
-    /* will iterate over default input */
-    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_INPUT);
-    return f_lines(L);
-  }
-  else {
-    const char *filename = luaL_checkstring(L, 1);
-    FILE **pf = newfile(L);
-    *pf = fopen(filename, "r");
-    if (*pf == NULL)
-      fileerror(L, 1, filename);
-    aux_lines(L, lua_gettop(L), 1);
-    return 1;
-  }
-}
-
-
-/*
-** {======================================================
-** READ
-** =======================================================
-*/
-
-
-static int read_number (lua_State *L, FILE *f) {
-  lua_Number d;
-  if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) {
-    lua_pushnumber(L, d);
-    return 1;
-  }
-  else {
-    lua_pushnil(L);  /* "result" to be removed */
-    return 0;  /* read fails */
-  }
-}
-
-
-static int test_eof (lua_State *L, FILE *f) {
-  int c = getc(f);
-  ungetc(c, f);
-  lua_pushlstring(L, NULL, 0);
-  return (c != EOF);
-}
-
-
-static int read_line (lua_State *L, FILE *f) {
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  for (;;) {
-    size_t l;
-    char *p = luaL_prepbuffer(&b);
-    if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) {  /* eof? */
-      luaL_pushresult(&b);  /* close buffer */
-      return (lua_objlen(L, -1) > 0);  /* check whether read something */
-    }
-    l = strlen(p);
-    if (l == 0 || p[l-1] != '\n')
-      luaL_addsize(&b, l);
-    else {
-      luaL_addsize(&b, l - 1);  /* do not include `eol' */
-      luaL_pushresult(&b);  /* close buffer */
-      return 1;  /* read at least an `eol' */
-    }
-  }
-}
-
-
-static int read_chars (lua_State *L, FILE *f, size_t n) {
-  size_t rlen;  /* how much to read */
-  size_t nr;  /* number of chars actually read */
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  rlen = LUAL_BUFFERSIZE;  /* try to read that much each time */
-  do {
-    char *p = luaL_prepbuffer(&b);
-    if (rlen > n) rlen = n;  /* cannot read more than asked */
-    nr = fread(p, sizeof(char), rlen, f);
-    luaL_addsize(&b, nr);
-    n -= nr;  /* still have to read `n' chars */
-  } while (n > 0 && nr == rlen);  /* until end of count or eof */
-  luaL_pushresult(&b);  /* close buffer */
-  return (n == 0 || lua_objlen(L, -1) > 0);
-}
-
-
-static int g_read (lua_State *L, FILE *f, int first) {
-  int nargs = lua_gettop(L) - 1;
-  int success;
-  int n;
-  clearerr(f);
-  if (nargs == 0) {  /* no arguments? */
-    success = read_line(L, f);
-    n = first+1;  /* to return 1 result */
-  }
-  else {  /* ensure stack space for all results and for auxlib's buffer */
-    luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments");
-    success = 1;
-    for (n = first; nargs-- && success; n++) {
-      if (lua_type(L, n) == LUA_TNUMBER) {
-        size_t l = (size_t)lua_tointeger(L, n);
-        success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l);
-      }
-      else {
-        const char *p = lua_tostring(L, n);
-        luaL_argcheck(L, p && p[0] == '*', n, "invalid option");
-        switch (p[1]) {
-          case 'n':  /* number */
-            success = read_number(L, f);
-            break;
-          case 'l':  /* line */
-            success = read_line(L, f);
-            break;
-          case 'a':  /* file */
-            read_chars(L, f, ~((size_t)0));  /* read MAX_SIZE_T chars */
-            success = 1; /* always success */
-            break;
-          default:
-            return luaL_argerror(L, n, "invalid format");
-        }
-      }
-    }
-  }
-  if (ferror(f))
-    return pushresult(L, 0, NULL);
-  if (!success) {
-    lua_pop(L, 1);  /* remove last result */
-    lua_pushnil(L);  /* push nil instead */
-  }
-  return n - first;
-}
-
-
-static int io_read (lua_State *L) {
-  return g_read(L, getiofile(L, IO_INPUT), 1);
-}
-
-
-static int f_read (lua_State *L) {
-  return g_read(L, tofile(L), 2);
-}
-
-
-static int io_readline (lua_State *L) {
-  FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(1));
-  int sucess;
-  if (f == NULL)  /* file is already closed? */
-    luaL_error(L, "file is already closed");
-  sucess = read_line(L, f);
-  if (ferror(f))
-    return luaL_error(L, "%s", strerror(errno));
-  if (sucess) return 1;
-  else {  /* EOF */
-    if (lua_toboolean(L, lua_upvalueindex(2))) {  /* generator created file? */
-      lua_settop(L, 0);
-      lua_pushvalue(L, lua_upvalueindex(1));
-      aux_close(L);  /* close it */
-    }
-    return 0;
-  }
-}
-
-/* }====================================================== */
-
-
-static int g_write (lua_State *L, FILE *f, int arg) {
-  int nargs = lua_gettop(L) - 1;
-  int status = 1;
-  for (; nargs--; arg++) {
-    if (lua_type(L, arg) == LUA_TNUMBER) {
-      /* optimization: could be done exactly as for strings */
-      status = status &&
-          fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0;
-    }
-    else {
-      size_t l;
-      const char *s = luaL_checklstring(L, arg, &l);
-      status = status && (fwrite(s, sizeof(char), l, f) == l);
-    }
-  }
-  return pushresult(L, status, NULL);
-}
-
-
-static int io_write (lua_State *L) {
-  return g_write(L, getiofile(L, IO_OUTPUT), 1);
-}
-
-
-static int f_write (lua_State *L) {
-  return g_write(L, tofile(L), 2);
-}
-
-
-static int f_seek (lua_State *L) {
-  static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END};
-  static const char *const modenames[] = {"set", "cur", "end", NULL};
-  FILE *f = tofile(L);
-  int op = luaL_checkoption(L, 2, "cur", modenames);
-  long offset = luaL_optlong(L, 3, 0);
-  op = fseek(f, offset, mode[op]);
-  if (op)
-    return pushresult(L, 0, NULL);  /* error */
-  else {
-    lua_pushinteger(L, ftell(f));
-    return 1;
-  }
-}
-
-
-static int f_setvbuf (lua_State *L) {
-  static const int mode[] = {_IONBF, _IOFBF, _IOLBF};
-  static const char *const modenames[] = {"no", "full", "line", NULL};
-  FILE *f = tofile(L);
-  int op = luaL_checkoption(L, 2, NULL, modenames);
-  lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE);
-  int res = setvbuf(f, NULL, mode[op], sz);
-  return pushresult(L, res == 0, NULL);
-}
-
-
-
-static int io_flush (lua_State *L) {
-  return pushresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL);
-}
-
-
-static int f_flush (lua_State *L) {
-  return pushresult(L, fflush(tofile(L)) == 0, NULL);
-}
-
-
-static const luaL_Reg iolib[] = {
-  {"close", io_close},
-  {"flush", io_flush},
-  {"input", io_input},
-  {"lines", io_lines},
-  {"open", io_open},
-  {"output", io_output},
-  {"popen", io_popen},
-  {"read", io_read},
-  {"tmpfile", io_tmpfile},
-  {"type", io_type},
-  {"write", io_write},
-  {NULL, NULL}
-};
-
-
-static const luaL_Reg flib[] = {
-  {"close", io_close},
-  {"flush", f_flush},
-  {"lines", f_lines},
-  {"read", f_read},
-  {"seek", f_seek},
-  {"setvbuf", f_setvbuf},
-  {"write", f_write},
-  {"__gc", io_gc},
-  {"__tostring", io_tostring},
-  {NULL, NULL}
-};
-
-
-static void createmeta (lua_State *L) {
-  luaL_newmetatable(L, LUA_FILEHANDLE);  /* create metatable for file handles */
-  lua_pushvalue(L, -1);  /* push metatable */
-  lua_setfield(L, -2, "__index");  /* metatable.__index = metatable */
-  luaL_register(L, NULL, flib);  /* file methods */
-}
-
-
-static void createstdfile (lua_State *L, FILE *f, int k, const char *fname) {
-  *newfile(L) = f;
-  if (k > 0) {
-    lua_pushvalue(L, -1);
-    lua_rawseti(L, LUA_ENVIRONINDEX, k);
-  }
-  lua_pushvalue(L, -2);  /* copy environment */
-  lua_setfenv(L, -2);  /* set it */
-  lua_setfield(L, -3, fname);
-}
-
-
-static void newfenv (lua_State *L, lua_CFunction cls) {
-  lua_createtable(L, 0, 1);
-  lua_pushcfunction(L, cls);
-  lua_setfield(L, -2, "__close");
-}
-
-
-LUALIB_API int luaopen_io (lua_State *L) {
-  createmeta(L);
-  /* create (private) environment (with fields IO_INPUT, IO_OUTPUT, __close) */
-  newfenv(L, io_fclose);
-  lua_replace(L, LUA_ENVIRONINDEX);
-  /* open library */
-  luaL_register(L, LUA_IOLIBNAME, iolib);
-  /* create (and set) default files */
-  newfenv(L, io_noclose);  /* close function for default files */
-  createstdfile(L, stdin, IO_INPUT, "stdin");
-  createstdfile(L, stdout, IO_OUTPUT, "stdout");
-  createstdfile(L, stderr, 0, "stderr");
-  lua_pop(L, 1);  /* pop environment for default files */
-  lua_getfield(L, -1, "popen");
-  newfenv(L, io_pclose);  /* create environment for 'popen' */
-  lua_setfenv(L, -2);  /* set fenv for 'popen' */
-  lua_pop(L, 1);  /* pop 'popen' */
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/llex.c b/redis-stable/deps/lua/src/llex.c
deleted file mode 100644
index 88c6790c..00000000
--- a/redis-stable/deps/lua/src/llex.c
+++ /dev/null
@@ -1,463 +0,0 @@
-/*
-** $Id: llex.c,v 2.20.1.2 2009/11/23 14:58:22 roberto Exp $
-** Lexical Analyzer
-** See Copyright Notice in lua.h
-*/
-
-
-#include <ctype.h>
-#include <locale.h>
-#include <string.h>
-
-#define llex_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldo.h"
-#include "llex.h"
-#include "lobject.h"
-#include "lparser.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "lzio.h"
-
-
-
-#define next(ls) (ls->current = zgetc(ls->z))
-
-
-
-
-#define currIsNewline(ls)	(ls->current == '\n' || ls->current == '\r')
-
-
-/* ORDER RESERVED */
-const char *const luaX_tokens [] = {
-    "and", "break", "do", "else", "elseif",
-    "end", "false", "for", "function", "if",
-    "in", "local", "nil", "not", "or", "repeat",
-    "return", "then", "true", "until", "while",
-    "..", "...", "==", ">=", "<=", "~=",
-    "<number>", "<name>", "<string>", "<eof>",
-    NULL
-};
-
-
-#define save_and_next(ls) (save(ls, ls->current), next(ls))
-
-
-static void save (LexState *ls, int c) {
-  Mbuffer *b = ls->buff;
-  if (b->n + 1 > b->buffsize) {
-    size_t newsize;
-    if (b->buffsize >= MAX_SIZET/2)
-      luaX_lexerror(ls, "lexical element too long", 0);
-    newsize = b->buffsize * 2;
-    luaZ_resizebuffer(ls->L, b, newsize);
-  }
-  b->buffer[b->n++] = cast(char, c);
-}
-
-
-void luaX_init (lua_State *L) {
-  int i;
-  for (i=0; i<NUM_RESERVED; i++) {
-    TString *ts = luaS_new(L, luaX_tokens[i]);
-    luaS_fix(ts);  /* reserved words are never collected */
-    lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);
-    ts->tsv.reserved = cast_byte(i+1);  /* reserved word */
-  }
-}
-
-
-#define MAXSRC          80
-
-
-const char *luaX_token2str (LexState *ls, int token) {
-  if (token < FIRST_RESERVED) {
-    lua_assert(token == cast(unsigned char, token));
-    return (iscntrl(token)) ? luaO_pushfstring(ls->L, "char(%d)", token) :
-                              luaO_pushfstring(ls->L, "%c", token);
-  }
-  else
-    return luaX_tokens[token-FIRST_RESERVED];
-}
-
-
-static const char *txtToken (LexState *ls, int token) {
-  switch (token) {
-    case TK_NAME:
-    case TK_STRING:
-    case TK_NUMBER:
-      save(ls, '\0');
-      return luaZ_buffer(ls->buff);
-    default:
-      return luaX_token2str(ls, token);
-  }
-}
-
-
-void luaX_lexerror (LexState *ls, const char *msg, int token) {
-  char buff[MAXSRC];
-  luaO_chunkid(buff, getstr(ls->source), MAXSRC);
-  msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg);
-  if (token)
-    luaO_pushfstring(ls->L, "%s near " LUA_QS, msg, txtToken(ls, token));
-  luaD_throw(ls->L, LUA_ERRSYNTAX);
-}
-
-
-void luaX_syntaxerror (LexState *ls, const char *msg) {
-  luaX_lexerror(ls, msg, ls->t.token);
-}
-
-
-TString *luaX_newstring (LexState *ls, const char *str, size_t l) {
-  lua_State *L = ls->L;
-  TString *ts = luaS_newlstr(L, str, l);
-  TValue *o = luaH_setstr(L, ls->fs->h, ts);  /* entry for `str' */
-  if (ttisnil(o)) {
-    setbvalue(o, 1);  /* make sure `str' will not be collected */
-    luaC_checkGC(L);
-  }
-  return ts;
-}
-
-
-static void inclinenumber (LexState *ls) {
-  int old = ls->current;
-  lua_assert(currIsNewline(ls));
-  next(ls);  /* skip `\n' or `\r' */
-  if (currIsNewline(ls) && ls->current != old)
-    next(ls);  /* skip `\n\r' or `\r\n' */
-  if (++ls->linenumber >= MAX_INT)
-    luaX_syntaxerror(ls, "chunk has too many lines");
-}
-
-
-void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {
-  ls->decpoint = '.';
-  ls->L = L;
-  ls->lookahead.token = TK_EOS;  /* no look-ahead token */
-  ls->z = z;
-  ls->fs = NULL;
-  ls->linenumber = 1;
-  ls->lastline = 1;
-  ls->source = source;
-  luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */
-  next(ls);  /* read first char */
-}
-
-
-
-/*
-** =======================================================
-** LEXICAL ANALYZER
-** =======================================================
-*/
-
-
-
-static int check_next (LexState *ls, const char *set) {
-  if (!strchr(set, ls->current))
-    return 0;
-  save_and_next(ls);
-  return 1;
-}
-
-
-static void buffreplace (LexState *ls, char from, char to) {
-  size_t n = luaZ_bufflen(ls->buff);
-  char *p = luaZ_buffer(ls->buff);
-  while (n--)
-    if (p[n] == from) p[n] = to;
-}
-
-
-static void trydecpoint (LexState *ls, SemInfo *seminfo) {
-  /* format error: try to update decimal point separator */
-  struct lconv *cv = localeconv();
-  char old = ls->decpoint;
-  ls->decpoint = (cv ? cv->decimal_point[0] : '.');
-  buffreplace(ls, old, ls->decpoint);  /* try updated decimal separator */
-  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {
-    /* format error with correct decimal point: no more options */
-    buffreplace(ls, ls->decpoint, '.');  /* undo change (for error message) */
-    luaX_lexerror(ls, "malformed number", TK_NUMBER);
-  }
-}
-
-
-/* LUA_NUMBER */
-static void read_numeral (LexState *ls, SemInfo *seminfo) {
-  lua_assert(isdigit(ls->current));
-  do {
-    save_and_next(ls);
-  } while (isdigit(ls->current) || ls->current == '.');
-  if (check_next(ls, "Ee"))  /* `E'? */
-    check_next(ls, "+-");  /* optional exponent sign */
-  while (isalnum(ls->current) || ls->current == '_')
-    save_and_next(ls);
-  save(ls, '\0');
-  buffreplace(ls, '.', ls->decpoint);  /* follow locale for decimal point */
-  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r))  /* format error? */
-    trydecpoint(ls, seminfo); /* try to update decimal point separator */
-}
-
-
-static int skip_sep (LexState *ls) {
-  int count = 0;
-  int s = ls->current;
-  lua_assert(s == '[' || s == ']');
-  save_and_next(ls);
-  while (ls->current == '=') {
-    save_and_next(ls);
-    count++;
-  }
-  return (ls->current == s) ? count : (-count) - 1;
-}
-
-
-static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {
-  int cont = 0;
-  (void)(cont);  /* avoid warnings when `cont' is not used */
-  save_and_next(ls);  /* skip 2nd `[' */
-  if (currIsNewline(ls))  /* string starts with a newline? */
-    inclinenumber(ls);  /* skip it */
-  for (;;) {
-    switch (ls->current) {
-      case EOZ:
-        luaX_lexerror(ls, (seminfo) ? "unfinished long string" :
-                                   "unfinished long comment", TK_EOS);
-        break;  /* to avoid warnings */
-#if defined(LUA_COMPAT_LSTR)
-      case '[': {
-        if (skip_sep(ls) == sep) {
-          save_and_next(ls);  /* skip 2nd `[' */
-          cont++;
-#if LUA_COMPAT_LSTR == 1
-          if (sep == 0)
-            luaX_lexerror(ls, "nesting of [[...]] is deprecated", '[');
-#endif
-        }
-        break;
-      }
-#endif
-      case ']': {
-        if (skip_sep(ls) == sep) {
-          save_and_next(ls);  /* skip 2nd `]' */
-#if defined(LUA_COMPAT_LSTR) && LUA_COMPAT_LSTR == 2
-          cont--;
-          if (sep == 0 && cont >= 0) break;
-#endif
-          goto endloop;
-        }
-        break;
-      }
-      case '\n':
-      case '\r': {
-        save(ls, '\n');
-        inclinenumber(ls);
-        if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */
-        break;
-      }
-      default: {
-        if (seminfo) save_and_next(ls);
-        else next(ls);
-      }
-    }
-  } endloop:
-  if (seminfo)
-    seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),
-                                     luaZ_bufflen(ls->buff) - 2*(2 + sep));
-}
-
-
-static void read_string (LexState *ls, int del, SemInfo *seminfo) {
-  save_and_next(ls);
-  while (ls->current != del) {
-    switch (ls->current) {
-      case EOZ:
-        luaX_lexerror(ls, "unfinished string", TK_EOS);
-        continue;  /* to avoid warnings */
-      case '\n':
-      case '\r':
-        luaX_lexerror(ls, "unfinished string", TK_STRING);
-        continue;  /* to avoid warnings */
-      case '\\': {
-        int c;
-        next(ls);  /* do not save the `\' */
-        switch (ls->current) {
-          case 'a': c = '\a'; break;
-          case 'b': c = '\b'; break;
-          case 'f': c = '\f'; break;
-          case 'n': c = '\n'; break;
-          case 'r': c = '\r'; break;
-          case 't': c = '\t'; break;
-          case 'v': c = '\v'; break;
-          case '\n':  /* go through */
-          case '\r': save(ls, '\n'); inclinenumber(ls); continue;
-          case EOZ: continue;  /* will raise an error next loop */
-          default: {
-            if (!isdigit(ls->current))
-              save_and_next(ls);  /* handles \\, \", \', and \? */
-            else {  /* \xxx */
-              int i = 0;
-              c = 0;
-              do {
-                c = 10*c + (ls->current-'0');
-                next(ls);
-              } while (++i<3 && isdigit(ls->current));
-              if (c > UCHAR_MAX)
-                luaX_lexerror(ls, "escape sequence too large", TK_STRING);
-              save(ls, c);
-            }
-            continue;
-          }
-        }
-        save(ls, c);
-        next(ls);
-        continue;
-      }
-      default:
-        save_and_next(ls);
-    }
-  }
-  save_and_next(ls);  /* skip delimiter */
-  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,
-                                   luaZ_bufflen(ls->buff) - 2);
-}
-
-
-static int llex (LexState *ls, SemInfo *seminfo) {
-  luaZ_resetbuffer(ls->buff);
-  for (;;) {
-    switch (ls->current) {
-      case '\n':
-      case '\r': {
-        inclinenumber(ls);
-        continue;
-      }
-      case '-': {
-        next(ls);
-        if (ls->current != '-') return '-';
-        /* else is a comment */
-        next(ls);
-        if (ls->current == '[') {
-          int sep = skip_sep(ls);
-          luaZ_resetbuffer(ls->buff);  /* `skip_sep' may dirty the buffer */
-          if (sep >= 0) {
-            read_long_string(ls, NULL, sep);  /* long comment */
-            luaZ_resetbuffer(ls->buff);
-            continue;
-          }
-        }
-        /* else short comment */
-        while (!currIsNewline(ls) && ls->current != EOZ)
-          next(ls);
-        continue;
-      }
-      case '[': {
-        int sep = skip_sep(ls);
-        if (sep >= 0) {
-          read_long_string(ls, seminfo, sep);
-          return TK_STRING;
-        }
-        else if (sep == -1) return '[';
-        else luaX_lexerror(ls, "invalid long string delimiter", TK_STRING);
-      }
-      case '=': {
-        next(ls);
-        if (ls->current != '=') return '=';
-        else { next(ls); return TK_EQ; }
-      }
-      case '<': {
-        next(ls);
-        if (ls->current != '=') return '<';
-        else { next(ls); return TK_LE; }
-      }
-      case '>': {
-        next(ls);
-        if (ls->current != '=') return '>';
-        else { next(ls); return TK_GE; }
-      }
-      case '~': {
-        next(ls);
-        if (ls->current != '=') return '~';
-        else { next(ls); return TK_NE; }
-      }
-      case '"':
-      case '\'': {
-        read_string(ls, ls->current, seminfo);
-        return TK_STRING;
-      }
-      case '.': {
-        save_and_next(ls);
-        if (check_next(ls, ".")) {
-          if (check_next(ls, "."))
-            return TK_DOTS;   /* ... */
-          else return TK_CONCAT;   /* .. */
-        }
-        else if (!isdigit(ls->current)) return '.';
-        else {
-          read_numeral(ls, seminfo);
-          return TK_NUMBER;
-        }
-      }
-      case EOZ: {
-        return TK_EOS;
-      }
-      default: {
-        if (isspace(ls->current)) {
-          lua_assert(!currIsNewline(ls));
-          next(ls);
-          continue;
-        }
-        else if (isdigit(ls->current)) {
-          read_numeral(ls, seminfo);
-          return TK_NUMBER;
-        }
-        else if (isalpha(ls->current) || ls->current == '_') {
-          /* identifier or reserved word */
-          TString *ts;
-          do {
-            save_and_next(ls);
-          } while (isalnum(ls->current) || ls->current == '_');
-          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),
-                                  luaZ_bufflen(ls->buff));
-          if (ts->tsv.reserved > 0)  /* reserved word? */
-            return ts->tsv.reserved - 1 + FIRST_RESERVED;
-          else {
-            seminfo->ts = ts;
-            return TK_NAME;
-          }
-        }
-        else {
-          int c = ls->current;
-          next(ls);
-          return c;  /* single-char tokens (+ - / ...) */
-        }
-      }
-    }
-  }
-}
-
-
-void luaX_next (LexState *ls) {
-  ls->lastline = ls->linenumber;
-  if (ls->lookahead.token != TK_EOS) {  /* is there a look-ahead token? */
-    ls->t = ls->lookahead;  /* use this one */
-    ls->lookahead.token = TK_EOS;  /* and discharge it */
-  }
-  else
-    ls->t.token = llex(ls, &ls->t.seminfo);  /* read next token */
-}
-
-
-void luaX_lookahead (LexState *ls) {
-  lua_assert(ls->lookahead.token == TK_EOS);
-  ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);
-}
-
diff --git a/redis-stable/deps/lua/src/llex.h b/redis-stable/deps/lua/src/llex.h
deleted file mode 100644
index a9201cee..00000000
--- a/redis-stable/deps/lua/src/llex.h
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
-** $Id: llex.h,v 1.58.1.1 2007/12/27 13:02:25 roberto Exp $
-** Lexical Analyzer
-** See Copyright Notice in lua.h
-*/
-
-#ifndef llex_h
-#define llex_h
-
-#include "lobject.h"
-#include "lzio.h"
-
-
-#define FIRST_RESERVED	257
-
-/* maximum length of a reserved word */
-#define TOKEN_LEN	(sizeof("function")/sizeof(char))
-
-
-/*
-* WARNING: if you change the order of this enumeration,
-* grep "ORDER RESERVED"
-*/
-enum RESERVED {
-  /* terminal symbols denoted by reserved words */
-  TK_AND = FIRST_RESERVED, TK_BREAK,
-  TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION,
-  TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT,
-  TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE,
-  /* other terminal symbols */
-  TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER,
-  TK_NAME, TK_STRING, TK_EOS
-};
-
-/* number of reserved words */
-#define NUM_RESERVED	(cast(int, TK_WHILE-FIRST_RESERVED+1))
-
-
-/* array with token `names' */
-LUAI_DATA const char *const luaX_tokens [];
-
-
-typedef union {
-  lua_Number r;
-  TString *ts;
-} SemInfo;  /* semantics information */
-
-
-typedef struct Token {
-  int token;
-  SemInfo seminfo;
-} Token;
-
-
-typedef struct LexState {
-  int current;  /* current character (charint) */
-  int linenumber;  /* input line counter */
-  int lastline;  /* line of last token `consumed' */
-  Token t;  /* current token */
-  Token lookahead;  /* look ahead token */
-  struct FuncState *fs;  /* `FuncState' is private to the parser */
-  struct lua_State *L;
-  ZIO *z;  /* input stream */
-  Mbuffer *buff;  /* buffer for tokens */
-  TString *source;  /* current source name */
-  char decpoint;  /* locale decimal point */
-} LexState;
-
-
-LUAI_FUNC void luaX_init (lua_State *L);
-LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z,
-                              TString *source);
-LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l);
-LUAI_FUNC void luaX_next (LexState *ls);
-LUAI_FUNC void luaX_lookahead (LexState *ls);
-LUAI_FUNC void luaX_lexerror (LexState *ls, const char *msg, int token);
-LUAI_FUNC void luaX_syntaxerror (LexState *ls, const char *s);
-LUAI_FUNC const char *luaX_token2str (LexState *ls, int token);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/llimits.h b/redis-stable/deps/lua/src/llimits.h
deleted file mode 100644
index ca8dcb72..00000000
--- a/redis-stable/deps/lua/src/llimits.h
+++ /dev/null
@@ -1,128 +0,0 @@
-/*
-** $Id: llimits.h,v 1.69.1.1 2007/12/27 13:02:25 roberto Exp $
-** Limits, basic types, and some other `installation-dependent' definitions
-** See Copyright Notice in lua.h
-*/
-
-#ifndef llimits_h
-#define llimits_h
-
-
-#include <limits.h>
-#include <stddef.h>
-
-
-#include "lua.h"
-
-
-typedef LUAI_UINT32 lu_int32;
-
-typedef LUAI_UMEM lu_mem;
-
-typedef LUAI_MEM l_mem;
-
-
-
-/* chars used as small naturals (so that `char' is reserved for characters) */
-typedef unsigned char lu_byte;
-
-
-#define MAX_SIZET	((size_t)(~(size_t)0)-2)
-
-#define MAX_LUMEM	((lu_mem)(~(lu_mem)0)-2)
-
-
-#define MAX_INT (INT_MAX-2)  /* maximum value of an int (-2 for safety) */
-
-/*
-** conversion of pointer to integer
-** this is for hashing only; there is no problem if the integer
-** cannot hold the whole pointer value
-*/
-#define IntPoint(p)  ((unsigned int)(lu_mem)(p))
-
-
-
-/* type to ensure maximum alignment */
-typedef LUAI_USER_ALIGNMENT_T L_Umaxalign;
-
-
-/* result of a `usual argument conversion' over lua_Number */
-typedef LUAI_UACNUMBER l_uacNumber;
-
-
-/* internal assertions for in-house debugging */
-#ifdef lua_assert
-
-#define check_exp(c,e)		(lua_assert(c), (e))
-#define api_check(l,e)		lua_assert(e)
-
-#else
-
-#define lua_assert(c)		((void)0)
-#define check_exp(c,e)		(e)
-#define api_check		luai_apicheck
-
-#endif
-
-
-#ifndef UNUSED
-#define UNUSED(x)	((void)(x))	/* to avoid warnings */
-#endif
-
-
-#ifndef cast
-#define cast(t, exp)	((t)(exp))
-#endif
-
-#define cast_byte(i)	cast(lu_byte, (i))
-#define cast_num(i)	cast(lua_Number, (i))
-#define cast_int(i)	cast(int, (i))
-
-
-
-/*
-** type for virtual-machine instructions
-** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h)
-*/
-typedef lu_int32 Instruction;
-
-
-
-/* maximum stack for a Lua function */
-#define MAXSTACK	250
-
-
-
-/* minimum size for the string table (must be power of 2) */
-#ifndef MINSTRTABSIZE
-#define MINSTRTABSIZE	32
-#endif
-
-
-/* minimum size for string buffer */
-#ifndef LUA_MINBUFFER
-#define LUA_MINBUFFER	32
-#endif
-
-
-#ifndef lua_lock
-#define lua_lock(L)     ((void) 0) 
-#define lua_unlock(L)   ((void) 0)
-#endif
-
-#ifndef luai_threadyield
-#define luai_threadyield(L)     {lua_unlock(L); lua_lock(L);}
-#endif
-
-
-/*
-** macro to control inclusion of some hard tests on stack reallocation
-*/ 
-#ifndef HARDSTACKTESTS
-#define condhardstacktests(x)	((void)0)
-#else
-#define condhardstacktests(x)	x
-#endif
-
-#endif
diff --git a/redis-stable/deps/lua/src/lmathlib.c b/redis-stable/deps/lua/src/lmathlib.c
deleted file mode 100644
index 441fbf73..00000000
--- a/redis-stable/deps/lua/src/lmathlib.c
+++ /dev/null
@@ -1,263 +0,0 @@
-/*
-** $Id: lmathlib.c,v 1.67.1.1 2007/12/27 13:02:25 roberto Exp $
-** Standard mathematical library
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stdlib.h>
-#include <math.h>
-
-#define lmathlib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-#undef PI
-#define PI (3.14159265358979323846)
-#define RADIANS_PER_DEGREE (PI/180.0)
-
-
-
-static int math_abs (lua_State *L) {
-  lua_pushnumber(L, fabs(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_sin (lua_State *L) {
-  lua_pushnumber(L, sin(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_sinh (lua_State *L) {
-  lua_pushnumber(L, sinh(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_cos (lua_State *L) {
-  lua_pushnumber(L, cos(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_cosh (lua_State *L) {
-  lua_pushnumber(L, cosh(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_tan (lua_State *L) {
-  lua_pushnumber(L, tan(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_tanh (lua_State *L) {
-  lua_pushnumber(L, tanh(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_asin (lua_State *L) {
-  lua_pushnumber(L, asin(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_acos (lua_State *L) {
-  lua_pushnumber(L, acos(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_atan (lua_State *L) {
-  lua_pushnumber(L, atan(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_atan2 (lua_State *L) {
-  lua_pushnumber(L, atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
-  return 1;
-}
-
-static int math_ceil (lua_State *L) {
-  lua_pushnumber(L, ceil(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_floor (lua_State *L) {
-  lua_pushnumber(L, floor(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_fmod (lua_State *L) {
-  lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
-  return 1;
-}
-
-static int math_modf (lua_State *L) {
-  double ip;
-  double fp = modf(luaL_checknumber(L, 1), &ip);
-  lua_pushnumber(L, ip);
-  lua_pushnumber(L, fp);
-  return 2;
-}
-
-static int math_sqrt (lua_State *L) {
-  lua_pushnumber(L, sqrt(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_pow (lua_State *L) {
-  lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
-  return 1;
-}
-
-static int math_log (lua_State *L) {
-  lua_pushnumber(L, log(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_log10 (lua_State *L) {
-  lua_pushnumber(L, log10(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_exp (lua_State *L) {
-  lua_pushnumber(L, exp(luaL_checknumber(L, 1)));
-  return 1;
-}
-
-static int math_deg (lua_State *L) {
-  lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE);
-  return 1;
-}
-
-static int math_rad (lua_State *L) {
-  lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE);
-  return 1;
-}
-
-static int math_frexp (lua_State *L) {
-  int e;
-  lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e));
-  lua_pushinteger(L, e);
-  return 2;
-}
-
-static int math_ldexp (lua_State *L) {
-  lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2)));
-  return 1;
-}
-
-
-
-static int math_min (lua_State *L) {
-  int n = lua_gettop(L);  /* number of arguments */
-  lua_Number dmin = luaL_checknumber(L, 1);
-  int i;
-  for (i=2; i<=n; i++) {
-    lua_Number d = luaL_checknumber(L, i);
-    if (d < dmin)
-      dmin = d;
-  }
-  lua_pushnumber(L, dmin);
-  return 1;
-}
-
-
-static int math_max (lua_State *L) {
-  int n = lua_gettop(L);  /* number of arguments */
-  lua_Number dmax = luaL_checknumber(L, 1);
-  int i;
-  for (i=2; i<=n; i++) {
-    lua_Number d = luaL_checknumber(L, i);
-    if (d > dmax)
-      dmax = d;
-  }
-  lua_pushnumber(L, dmax);
-  return 1;
-}
-
-
-static int math_random (lua_State *L) {
-  /* the `%' avoids the (rare) case of r==1, and is needed also because on
-     some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
-  lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX;
-  switch (lua_gettop(L)) {  /* check number of arguments */
-    case 0: {  /* no arguments */
-      lua_pushnumber(L, r);  /* Number between 0 and 1 */
-      break;
-    }
-    case 1: {  /* only upper limit */
-      int u = luaL_checkint(L, 1);
-      luaL_argcheck(L, 1<=u, 1, "interval is empty");
-      lua_pushnumber(L, floor(r*u)+1);  /* int between 1 and `u' */
-      break;
-    }
-    case 2: {  /* lower and upper limits */
-      int l = luaL_checkint(L, 1);
-      int u = luaL_checkint(L, 2);
-      luaL_argcheck(L, l<=u, 2, "interval is empty");
-      lua_pushnumber(L, floor(r*(u-l+1))+l);  /* int between `l' and `u' */
-      break;
-    }
-    default: return luaL_error(L, "wrong number of arguments");
-  }
-  return 1;
-}
-
-
-static int math_randomseed (lua_State *L) {
-  srand(luaL_checkint(L, 1));
-  return 0;
-}
-
-
-static const luaL_Reg mathlib[] = {
-  {"abs",   math_abs},
-  {"acos",  math_acos},
-  {"asin",  math_asin},
-  {"atan2", math_atan2},
-  {"atan",  math_atan},
-  {"ceil",  math_ceil},
-  {"cosh",   math_cosh},
-  {"cos",   math_cos},
-  {"deg",   math_deg},
-  {"exp",   math_exp},
-  {"floor", math_floor},
-  {"fmod",   math_fmod},
-  {"frexp", math_frexp},
-  {"ldexp", math_ldexp},
-  {"log10", math_log10},
-  {"log",   math_log},
-  {"max",   math_max},
-  {"min",   math_min},
-  {"modf",   math_modf},
-  {"pow",   math_pow},
-  {"rad",   math_rad},
-  {"random",     math_random},
-  {"randomseed", math_randomseed},
-  {"sinh",   math_sinh},
-  {"sin",   math_sin},
-  {"sqrt",  math_sqrt},
-  {"tanh",   math_tanh},
-  {"tan",   math_tan},
-  {NULL, NULL}
-};
-
-
-/*
-** Open math library
-*/
-LUALIB_API int luaopen_math (lua_State *L) {
-  luaL_register(L, LUA_MATHLIBNAME, mathlib);
-  lua_pushnumber(L, PI);
-  lua_setfield(L, -2, "pi");
-  lua_pushnumber(L, HUGE_VAL);
-  lua_setfield(L, -2, "huge");
-#if defined(LUA_COMPAT_MOD)
-  lua_getfield(L, -1, "fmod");
-  lua_setfield(L, -2, "mod");
-#endif
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/lmem.c b/redis-stable/deps/lua/src/lmem.c
deleted file mode 100644
index ae7d8c96..00000000
--- a/redis-stable/deps/lua/src/lmem.c
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
-** $Id: lmem.c,v 1.70.1.1 2007/12/27 13:02:25 roberto Exp $
-** Interface to Memory Manager
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stddef.h>
-
-#define lmem_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-
-
-
-/*
-** About the realloc function:
-** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize);
-** (`osize' is the old size, `nsize' is the new size)
-**
-** Lua ensures that (ptr == NULL) iff (osize == 0).
-**
-** * frealloc(ud, NULL, 0, x) creates a new block of size `x'
-**
-** * frealloc(ud, p, x, 0) frees the block `p'
-** (in this specific case, frealloc must return NULL).
-** particularly, frealloc(ud, NULL, 0, 0) does nothing
-** (which is equivalent to free(NULL) in ANSI C)
-**
-** frealloc returns NULL if it cannot create or reallocate the area
-** (any reallocation to an equal or smaller size cannot fail!)
-*/
-
-
-
-#define MINSIZEARRAY	4
-
-
-void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
-                     int limit, const char *errormsg) {
-  void *newblock;
-  int newsize;
-  if (*size >= limit/2) {  /* cannot double it? */
-    if (*size >= limit)  /* cannot grow even a little? */
-      luaG_runerror(L, errormsg);
-    newsize = limit;  /* still have at least one free place */
-  }
-  else {
-    newsize = (*size)*2;
-    if (newsize < MINSIZEARRAY)
-      newsize = MINSIZEARRAY;  /* minimum size */
-  }
-  newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
-  *size = newsize;  /* update only when everything else is OK */
-  return newblock;
-}
-
-
-void *luaM_toobig (lua_State *L) {
-  luaG_runerror(L, "memory allocation error: block too big");
-  return NULL;  /* to avoid warnings */
-}
-
-
-
-/*
-** generic allocation routine.
-*/
-void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
-  global_State *g = G(L);
-  lua_assert((osize == 0) == (block == NULL));
-  block = (*g->frealloc)(g->ud, block, osize, nsize);
-  if (block == NULL && nsize > 0)
-    luaD_throw(L, LUA_ERRMEM);
-  lua_assert((nsize == 0) == (block == NULL));
-  g->totalbytes = (g->totalbytes - osize) + nsize;
-  return block;
-}
-
diff --git a/redis-stable/deps/lua/src/lmem.h b/redis-stable/deps/lua/src/lmem.h
deleted file mode 100644
index 7c2dcb32..00000000
--- a/redis-stable/deps/lua/src/lmem.h
+++ /dev/null
@@ -1,49 +0,0 @@
-/*
-** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
-** Interface to Memory Manager
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lmem_h
-#define lmem_h
-
-
-#include <stddef.h>
-
-#include "llimits.h"
-#include "lua.h"
-
-#define MEMERRMSG	"not enough memory"
-
-
-#define luaM_reallocv(L,b,on,n,e) \
-	((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ?  /* +1 to avoid warnings */ \
-		luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \
-		luaM_toobig(L))
-
-#define luaM_freemem(L, b, s)	luaM_realloc_(L, (b), (s), 0)
-#define luaM_free(L, b)		luaM_realloc_(L, (b), sizeof(*(b)), 0)
-#define luaM_freearray(L, b, n, t)   luaM_reallocv(L, (b), n, 0, sizeof(t))
-
-#define luaM_malloc(L,t)	luaM_realloc_(L, NULL, 0, (t))
-#define luaM_new(L,t)		cast(t *, luaM_malloc(L, sizeof(t)))
-#define luaM_newvector(L,n,t) \
-		cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
-
-#define luaM_growvector(L,v,nelems,size,t,limit,e) \
-          if ((nelems)+1 > (size)) \
-            ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
-
-#define luaM_reallocvector(L, v,oldn,n,t) \
-   ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
-
-
-LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
-                                                          size_t size);
-LUAI_FUNC void *luaM_toobig (lua_State *L);
-LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
-                               size_t size_elem, int limit,
-                               const char *errormsg);
-
-#endif
-
diff --git a/redis-stable/deps/lua/src/loadlib.c b/redis-stable/deps/lua/src/loadlib.c
deleted file mode 100644
index 6158c535..00000000
--- a/redis-stable/deps/lua/src/loadlib.c
+++ /dev/null
@@ -1,666 +0,0 @@
-/*
-** $Id: loadlib.c,v 1.52.1.4 2009/09/09 13:17:16 roberto Exp $
-** Dynamic library loader for Lua
-** See Copyright Notice in lua.h
-**
-** This module contains an implementation of loadlib for Unix systems
-** that have dlfcn, an implementation for Darwin (Mac OS X), an
-** implementation for Windows, and a stub for other systems.
-*/
-
-
-#include <stdlib.h>
-#include <string.h>
-
-
-#define loadlib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-/* prefix for open functions in C libraries */
-#define LUA_POF		"luaopen_"
-
-/* separator for open functions in C libraries */
-#define LUA_OFSEP	"_"
-
-
-#define LIBPREFIX	"LOADLIB: "
-
-#define POF		LUA_POF
-#define LIB_FAIL	"open"
-
-
-/* error codes for ll_loadfunc */
-#define ERRLIB		1
-#define ERRFUNC		2
-
-#define setprogdir(L)		((void)0)
-
-
-static void ll_unloadlib (void *lib);
-static void *ll_load (lua_State *L, const char *path);
-static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym);
-
-
-
-#if defined(LUA_DL_DLOPEN)
-/*
-** {========================================================================
-** This is an implementation of loadlib based on the dlfcn interface.
-** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD,
-** NetBSD, AIX 4.2, HPUX 11, and  probably most other Unix flavors, at least
-** as an emulation layer on top of native functions.
-** =========================================================================
-*/
-
-#include <dlfcn.h>
-
-static void ll_unloadlib (void *lib) {
-  dlclose(lib);
-}
-
-
-static void *ll_load (lua_State *L, const char *path) {
-  void *lib = dlopen(path, RTLD_NOW);
-  if (lib == NULL) lua_pushstring(L, dlerror());
-  return lib;
-}
-
-
-static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
-  lua_CFunction f = (lua_CFunction)dlsym(lib, sym);
-  if (f == NULL) lua_pushstring(L, dlerror());
-  return f;
-}
-
-/* }====================================================== */
-
-
-
-#elif defined(LUA_DL_DLL)
-/*
-** {======================================================================
-** This is an implementation of loadlib for Windows using native functions.
-** =======================================================================
-*/
-
-#include <windows.h>
-
-
-#undef setprogdir
-
-static void setprogdir (lua_State *L) {
-  char buff[MAX_PATH + 1];
-  char *lb;
-  DWORD nsize = sizeof(buff)/sizeof(char);
-  DWORD n = GetModuleFileNameA(NULL, buff, nsize);
-  if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL)
-    luaL_error(L, "unable to get ModuleFileName");
-  else {
-    *lb = '\0';
-    luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);
-    lua_remove(L, -2);  /* remove original string */
-  }
-}
-
-
-static void pusherror (lua_State *L) {
-  int error = GetLastError();
-  char buffer[128];
-  if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,
-      NULL, error, 0, buffer, sizeof(buffer), NULL))
-    lua_pushstring(L, buffer);
-  else
-    lua_pushfstring(L, "system error %d\n", error);
-}
-
-static void ll_unloadlib (void *lib) {
-  FreeLibrary((HINSTANCE)lib);
-}
-
-
-static void *ll_load (lua_State *L, const char *path) {
-  HINSTANCE lib = LoadLibraryA(path);
-  if (lib == NULL) pusherror(L);
-  return lib;
-}
-
-
-static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
-  lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);
-  if (f == NULL) pusherror(L);
-  return f;
-}
-
-/* }====================================================== */
-
-
-
-#elif defined(LUA_DL_DYLD)
-/*
-** {======================================================================
-** Native Mac OS X / Darwin Implementation
-** =======================================================================
-*/
-
-#include <mach-o/dyld.h>
-
-
-/* Mac appends a `_' before C function names */
-#undef POF
-#define POF	"_" LUA_POF
-
-
-static void pusherror (lua_State *L) {
-  const char *err_str;
-  const char *err_file;
-  NSLinkEditErrors err;
-  int err_num;
-  NSLinkEditError(&err, &err_num, &err_file, &err_str);
-  lua_pushstring(L, err_str);
-}
-
-
-static const char *errorfromcode (NSObjectFileImageReturnCode ret) {
-  switch (ret) {
-    case NSObjectFileImageInappropriateFile:
-      return "file is not a bundle";
-    case NSObjectFileImageArch:
-      return "library is for wrong CPU type";
-    case NSObjectFileImageFormat:
-      return "bad format";
-    case NSObjectFileImageAccess:
-      return "cannot access file";
-    case NSObjectFileImageFailure:
-    default:
-      return "unable to load library";
-  }
-}
-
-
-static void ll_unloadlib (void *lib) {
-  NSUnLinkModule((NSModule)lib, NSUNLINKMODULE_OPTION_RESET_LAZY_REFERENCES);
-}
-
-
-static void *ll_load (lua_State *L, const char *path) {
-  NSObjectFileImage img;
-  NSObjectFileImageReturnCode ret;
-  /* this would be a rare case, but prevents crashing if it happens */
-  if(!_dyld_present()) {
-    lua_pushliteral(L, "dyld not present");
-    return NULL;
-  }
-  ret = NSCreateObjectFileImageFromFile(path, &img);
-  if (ret == NSObjectFileImageSuccess) {
-    NSModule mod = NSLinkModule(img, path, NSLINKMODULE_OPTION_PRIVATE |
-                       NSLINKMODULE_OPTION_RETURN_ON_ERROR);
-    NSDestroyObjectFileImage(img);
-    if (mod == NULL) pusherror(L);
-    return mod;
-  }
-  lua_pushstring(L, errorfromcode(ret));
-  return NULL;
-}
-
-
-static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
-  NSSymbol nss = NSLookupSymbolInModule((NSModule)lib, sym);
-  if (nss == NULL) {
-    lua_pushfstring(L, "symbol " LUA_QS " not found", sym);
-    return NULL;
-  }
-  return (lua_CFunction)NSAddressOfSymbol(nss);
-}
-
-/* }====================================================== */
-
-
-
-#else
-/*
-** {======================================================
-** Fallback for other systems
-** =======================================================
-*/
-
-#undef LIB_FAIL
-#define LIB_FAIL	"absent"
-
-
-#define DLMSG	"dynamic libraries not enabled; check your Lua installation"
-
-
-static void ll_unloadlib (void *lib) {
-  (void)lib;  /* to avoid warnings */
-}
-
-
-static void *ll_load (lua_State *L, const char *path) {
-  (void)path;  /* to avoid warnings */
-  lua_pushliteral(L, DLMSG);
-  return NULL;
-}
-
-
-static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {
-  (void)lib; (void)sym;  /* to avoid warnings */
-  lua_pushliteral(L, DLMSG);
-  return NULL;
-}
-
-/* }====================================================== */
-#endif
-
-
-
-static void **ll_register (lua_State *L, const char *path) {
-  void **plib;
-  lua_pushfstring(L, "%s%s", LIBPREFIX, path);
-  lua_gettable(L, LUA_REGISTRYINDEX);  /* check library in registry? */
-  if (!lua_isnil(L, -1))  /* is there an entry? */
-    plib = (void **)lua_touserdata(L, -1);
-  else {  /* no entry yet; create one */
-    lua_pop(L, 1);
-    plib = (void **)lua_newuserdata(L, sizeof(const void *));
-    *plib = NULL;
-    luaL_getmetatable(L, "_LOADLIB");
-    lua_setmetatable(L, -2);
-    lua_pushfstring(L, "%s%s", LIBPREFIX, path);
-    lua_pushvalue(L, -2);
-    lua_settable(L, LUA_REGISTRYINDEX);
-  }
-  return plib;
-}
-
-
-/*
-** __gc tag method: calls library's `ll_unloadlib' function with the lib
-** handle
-*/
-static int gctm (lua_State *L) {
-  void **lib = (void **)luaL_checkudata(L, 1, "_LOADLIB");
-  if (*lib) ll_unloadlib(*lib);
-  *lib = NULL;  /* mark library as closed */
-  return 0;
-}
-
-
-static int ll_loadfunc (lua_State *L, const char *path, const char *sym) {
-  void **reg = ll_register(L, path);
-  if (*reg == NULL) *reg = ll_load(L, path);
-  if (*reg == NULL)
-    return ERRLIB;  /* unable to load library */
-  else {
-    lua_CFunction f = ll_sym(L, *reg, sym);
-    if (f == NULL)
-      return ERRFUNC;  /* unable to find function */
-    lua_pushcfunction(L, f);
-    return 0;  /* return function */
-  }
-}
-
-
-static int ll_loadlib (lua_State *L) {
-  const char *path = luaL_checkstring(L, 1);
-  const char *init = luaL_checkstring(L, 2);
-  int stat = ll_loadfunc(L, path, init);
-  if (stat == 0)  /* no errors? */
-    return 1;  /* return the loaded function */
-  else {  /* error; error message is on stack top */
-    lua_pushnil(L);
-    lua_insert(L, -2);
-    lua_pushstring(L, (stat == ERRLIB) ?  LIB_FAIL : "init");
-    return 3;  /* return nil, error message, and where */
-  }
-}
-
-
-
-/*
-** {======================================================
-** 'require' function
-** =======================================================
-*/
-
-
-static int readable (const char *filename) {
-  FILE *f = fopen(filename, "r");  /* try to open file */
-  if (f == NULL) return 0;  /* open failed */
-  fclose(f);
-  return 1;
-}
-
-
-static const char *pushnexttemplate (lua_State *L, const char *path) {
-  const char *l;
-  while (*path == *LUA_PATHSEP) path++;  /* skip separators */
-  if (*path == '\0') return NULL;  /* no more templates */
-  l = strchr(path, *LUA_PATHSEP);  /* find next separator */
-  if (l == NULL) l = path + strlen(path);
-  lua_pushlstring(L, path, l - path);  /* template */
-  return l;
-}
-
-
-static const char *findfile (lua_State *L, const char *name,
-                                           const char *pname) {
-  const char *path;
-  name = luaL_gsub(L, name, ".", LUA_DIRSEP);
-  lua_getfield(L, LUA_ENVIRONINDEX, pname);
-  path = lua_tostring(L, -1);
-  if (path == NULL)
-    luaL_error(L, LUA_QL("package.%s") " must be a string", pname);
-  lua_pushliteral(L, "");  /* error accumulator */
-  while ((path = pushnexttemplate(L, path)) != NULL) {
-    const char *filename;
-    filename = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name);
-    lua_remove(L, -2);  /* remove path template */
-    if (readable(filename))  /* does file exist and is readable? */
-      return filename;  /* return that file name */
-    lua_pushfstring(L, "\n\tno file " LUA_QS, filename);
-    lua_remove(L, -2);  /* remove file name */
-    lua_concat(L, 2);  /* add entry to possible error message */
-  }
-  return NULL;  /* not found */
-}
-
-
-static void loaderror (lua_State *L, const char *filename) {
-  luaL_error(L, "error loading module " LUA_QS " from file " LUA_QS ":\n\t%s",
-                lua_tostring(L, 1), filename, lua_tostring(L, -1));
-}
-
-
-static int loader_Lua (lua_State *L) {
-  const char *filename;
-  const char *name = luaL_checkstring(L, 1);
-  filename = findfile(L, name, "path");
-  if (filename == NULL) return 1;  /* library not found in this path */
-  if (luaL_loadfile(L, filename) != 0)
-    loaderror(L, filename);
-  return 1;  /* library loaded successfully */
-}
-
-
-static const char *mkfuncname (lua_State *L, const char *modname) {
-  const char *funcname;
-  const char *mark = strchr(modname, *LUA_IGMARK);
-  if (mark) modname = mark + 1;
-  funcname = luaL_gsub(L, modname, ".", LUA_OFSEP);
-  funcname = lua_pushfstring(L, POF"%s", funcname);
-  lua_remove(L, -2);  /* remove 'gsub' result */
-  return funcname;
-}
-
-
-static int loader_C (lua_State *L) {
-  const char *funcname;
-  const char *name = luaL_checkstring(L, 1);
-  const char *filename = findfile(L, name, "cpath");
-  if (filename == NULL) return 1;  /* library not found in this path */
-  funcname = mkfuncname(L, name);
-  if (ll_loadfunc(L, filename, funcname) != 0)
-    loaderror(L, filename);
-  return 1;  /* library loaded successfully */
-}
-
-
-static int loader_Croot (lua_State *L) {
-  const char *funcname;
-  const char *filename;
-  const char *name = luaL_checkstring(L, 1);
-  const char *p = strchr(name, '.');
-  int stat;
-  if (p == NULL) return 0;  /* is root */
-  lua_pushlstring(L, name, p - name);
-  filename = findfile(L, lua_tostring(L, -1), "cpath");
-  if (filename == NULL) return 1;  /* root not found */
-  funcname = mkfuncname(L, name);
-  if ((stat = ll_loadfunc(L, filename, funcname)) != 0) {
-    if (stat != ERRFUNC) loaderror(L, filename);  /* real error */
-    lua_pushfstring(L, "\n\tno module " LUA_QS " in file " LUA_QS,
-                       name, filename);
-    return 1;  /* function not found */
-  }
-  return 1;
-}
-
-
-static int loader_preload (lua_State *L) {
-  const char *name = luaL_checkstring(L, 1);
-  lua_getfield(L, LUA_ENVIRONINDEX, "preload");
-  if (!lua_istable(L, -1))
-    luaL_error(L, LUA_QL("package.preload") " must be a table");
-  lua_getfield(L, -1, name);
-  if (lua_isnil(L, -1))  /* not found? */
-    lua_pushfstring(L, "\n\tno field package.preload['%s']", name);
-  return 1;
-}
-
-
-static const int sentinel_ = 0;
-#define sentinel	((void *)&sentinel_)
-
-
-static int ll_require (lua_State *L) {
-  const char *name = luaL_checkstring(L, 1);
-  int i;
-  lua_settop(L, 1);  /* _LOADED table will be at index 2 */
-  lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
-  lua_getfield(L, 2, name);
-  if (lua_toboolean(L, -1)) {  /* is it there? */
-    if (lua_touserdata(L, -1) == sentinel)  /* check loops */
-      luaL_error(L, "loop or previous error loading module " LUA_QS, name);
-    return 1;  /* package is already loaded */
-  }
-  /* else must load it; iterate over available loaders */
-  lua_getfield(L, LUA_ENVIRONINDEX, "loaders");
-  if (!lua_istable(L, -1))
-    luaL_error(L, LUA_QL("package.loaders") " must be a table");
-  lua_pushliteral(L, "");  /* error message accumulator */
-  for (i=1; ; i++) {
-    lua_rawgeti(L, -2, i);  /* get a loader */
-    if (lua_isnil(L, -1))
-      luaL_error(L, "module " LUA_QS " not found:%s",
-                    name, lua_tostring(L, -2));
-    lua_pushstring(L, name);
-    lua_call(L, 1, 1);  /* call it */
-    if (lua_isfunction(L, -1))  /* did it find module? */
-      break;  /* module loaded successfully */
-    else if (lua_isstring(L, -1))  /* loader returned error message? */
-      lua_concat(L, 2);  /* accumulate it */
-    else
-      lua_pop(L, 1);
-  }
-  lua_pushlightuserdata(L, sentinel);
-  lua_setfield(L, 2, name);  /* _LOADED[name] = sentinel */
-  lua_pushstring(L, name);  /* pass name as argument to module */
-  lua_call(L, 1, 1);  /* run loaded module */
-  if (!lua_isnil(L, -1))  /* non-nil return? */
-    lua_setfield(L, 2, name);  /* _LOADED[name] = returned value */
-  lua_getfield(L, 2, name);
-  if (lua_touserdata(L, -1) == sentinel) {   /* module did not set a value? */
-    lua_pushboolean(L, 1);  /* use true as result */
-    lua_pushvalue(L, -1);  /* extra copy to be returned */
-    lua_setfield(L, 2, name);  /* _LOADED[name] = true */
-  }
-  return 1;
-}
-
-/* }====================================================== */
-
-
-
-/*
-** {======================================================
-** 'module' function
-** =======================================================
-*/
-  
-
-static void setfenv (lua_State *L) {
-  lua_Debug ar;
-  if (lua_getstack(L, 1, &ar) == 0 ||
-      lua_getinfo(L, "f", &ar) == 0 ||  /* get calling function */
-      lua_iscfunction(L, -1))
-    luaL_error(L, LUA_QL("module") " not called from a Lua function");
-  lua_pushvalue(L, -2);
-  lua_setfenv(L, -2);
-  lua_pop(L, 1);
-}
-
-
-static void dooptions (lua_State *L, int n) {
-  int i;
-  for (i = 2; i <= n; i++) {
-    lua_pushvalue(L, i);  /* get option (a function) */
-    lua_pushvalue(L, -2);  /* module */
-    lua_call(L, 1, 0);
-  }
-}
-
-
-static void modinit (lua_State *L, const char *modname) {
-  const char *dot;
-  lua_pushvalue(L, -1);
-  lua_setfield(L, -2, "_M");  /* module._M = module */
-  lua_pushstring(L, modname);
-  lua_setfield(L, -2, "_NAME");
-  dot = strrchr(modname, '.');  /* look for last dot in module name */
-  if (dot == NULL) dot = modname;
-  else dot++;
-  /* set _PACKAGE as package name (full module name minus last part) */
-  lua_pushlstring(L, modname, dot - modname);
-  lua_setfield(L, -2, "_PACKAGE");
-}
-
-
-static int ll_module (lua_State *L) {
-  const char *modname = luaL_checkstring(L, 1);
-  int loaded = lua_gettop(L) + 1;  /* index of _LOADED table */
-  lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED");
-  lua_getfield(L, loaded, modname);  /* get _LOADED[modname] */
-  if (!lua_istable(L, -1)) {  /* not found? */
-    lua_pop(L, 1);  /* remove previous result */
-    /* try global variable (and create one if it does not exist) */
-    if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)
-      return luaL_error(L, "name conflict for module " LUA_QS, modname);
-    lua_pushvalue(L, -1);
-    lua_setfield(L, loaded, modname);  /* _LOADED[modname] = new table */
-  }
-  /* check whether table already has a _NAME field */
-  lua_getfield(L, -1, "_NAME");
-  if (!lua_isnil(L, -1))  /* is table an initialized module? */
-    lua_pop(L, 1);
-  else {  /* no; initialize it */
-    lua_pop(L, 1);
-    modinit(L, modname);
-  }
-  lua_pushvalue(L, -1);
-  setfenv(L);
-  dooptions(L, loaded - 1);
-  return 0;
-}
-
-
-static int ll_seeall (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  if (!lua_getmetatable(L, 1)) {
-    lua_createtable(L, 0, 1); /* create new metatable */
-    lua_pushvalue(L, -1);
-    lua_setmetatable(L, 1);
-  }
-  lua_pushvalue(L, LUA_GLOBALSINDEX);
-  lua_setfield(L, -2, "__index");  /* mt.__index = _G */
-  return 0;
-}
-
-
-/* }====================================================== */
-
-
-
-/* auxiliary mark (for internal use) */
-#define AUXMARK		"\1"
-
-static void setpath (lua_State *L, const char *fieldname, const char *envname,
-                                   const char *def) {
-  const char *path = getenv(envname);
-  if (path == NULL)  /* no environment variable? */
-    lua_pushstring(L, def);  /* use default */
-  else {
-    /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */
-    path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,
-                              LUA_PATHSEP AUXMARK LUA_PATHSEP);
-    luaL_gsub(L, path, AUXMARK, def);
-    lua_remove(L, -2);
-  }
-  setprogdir(L);
-  lua_setfield(L, -2, fieldname);
-}
-
-
-static const luaL_Reg pk_funcs[] = {
-  {"loadlib", ll_loadlib},
-  {"seeall", ll_seeall},
-  {NULL, NULL}
-};
-
-
-static const luaL_Reg ll_funcs[] = {
-  {"module", ll_module},
-  {"require", ll_require},
-  {NULL, NULL}
-};
-
-
-static const lua_CFunction loaders[] =
-  {loader_preload, loader_Lua, loader_C, loader_Croot, NULL};
-
-
-LUALIB_API int luaopen_package (lua_State *L) {
-  int i;
-  /* create new type _LOADLIB */
-  luaL_newmetatable(L, "_LOADLIB");
-  lua_pushcfunction(L, gctm);
-  lua_setfield(L, -2, "__gc");
-  /* create `package' table */
-  luaL_register(L, LUA_LOADLIBNAME, pk_funcs);
-#if defined(LUA_COMPAT_LOADLIB) 
-  lua_getfield(L, -1, "loadlib");
-  lua_setfield(L, LUA_GLOBALSINDEX, "loadlib");
-#endif
-  lua_pushvalue(L, -1);
-  lua_replace(L, LUA_ENVIRONINDEX);
-  /* create `loaders' table */
-  lua_createtable(L, sizeof(loaders)/sizeof(loaders[0]) - 1, 0);
-  /* fill it with pre-defined loaders */
-  for (i=0; loaders[i] != NULL; i++) {
-    lua_pushcfunction(L, loaders[i]);
-    lua_rawseti(L, -2, i+1);
-  }
-  lua_setfield(L, -2, "loaders");  /* put it in field `loaders' */
-  setpath(L, "path", LUA_PATH, LUA_PATH_DEFAULT);  /* set field `path' */
-  setpath(L, "cpath", LUA_CPATH, LUA_CPATH_DEFAULT); /* set field `cpath' */
-  /* store config information */
-  lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATHSEP "\n" LUA_PATH_MARK "\n"
-                     LUA_EXECDIR "\n" LUA_IGMARK);
-  lua_setfield(L, -2, "config");
-  /* set field `loaded' */
-  luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 2);
-  lua_setfield(L, -2, "loaded");
-  /* set field `preload' */
-  lua_newtable(L);
-  lua_setfield(L, -2, "preload");
-  lua_pushvalue(L, LUA_GLOBALSINDEX);
-  luaL_register(L, NULL, ll_funcs);  /* open lib into global table */
-  lua_pop(L, 1);
-  return 1;  /* return 'package' table */
-}
-
diff --git a/redis-stable/deps/lua/src/lobject.c b/redis-stable/deps/lua/src/lobject.c
deleted file mode 100644
index 4ff50732..00000000
--- a/redis-stable/deps/lua/src/lobject.c
+++ /dev/null
@@ -1,214 +0,0 @@
-/*
-** $Id: lobject.c,v 2.22.1.1 2007/12/27 13:02:25 roberto Exp $
-** Some generic functions over Lua objects
-** See Copyright Notice in lua.h
-*/
-
-#include <ctype.h>
-#include <stdarg.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define lobject_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldo.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "lvm.h"
-
-
-
-const TValue luaO_nilobject_ = {{NULL}, LUA_TNIL};
-
-
-/*
-** converts an integer to a "floating point byte", represented as
-** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if
-** eeeee != 0 and (xxx) otherwise.
-*/
-int luaO_int2fb (unsigned int x) {
-  int e = 0;  /* expoent */
-  while (x >= 16) {
-    x = (x+1) >> 1;
-    e++;
-  }
-  if (x < 8) return x;
-  else return ((e+1) << 3) | (cast_int(x) - 8);
-}
-
-
-/* converts back */
-int luaO_fb2int (int x) {
-  int e = (x >> 3) & 31;
-  if (e == 0) return x;
-  else return ((x & 7)+8) << (e - 1);
-}
-
-
-int luaO_log2 (unsigned int x) {
-  static const lu_byte log_2[256] = {
-    0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
-    6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
-    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
-  };
-  int l = -1;
-  while (x >= 256) { l += 8; x >>= 8; }
-  return l + log_2[x];
-
-}
-
-
-int luaO_rawequalObj (const TValue *t1, const TValue *t2) {
-  if (ttype(t1) != ttype(t2)) return 0;
-  else switch (ttype(t1)) {
-    case LUA_TNIL:
-      return 1;
-    case LUA_TNUMBER:
-      return luai_numeq(nvalue(t1), nvalue(t2));
-    case LUA_TBOOLEAN:
-      return bvalue(t1) == bvalue(t2);  /* boolean true must be 1 !! */
-    case LUA_TLIGHTUSERDATA:
-      return pvalue(t1) == pvalue(t2);
-    default:
-      lua_assert(iscollectable(t1));
-      return gcvalue(t1) == gcvalue(t2);
-  }
-}
-
-
-int luaO_str2d (const char *s, lua_Number *result) {
-  char *endptr;
-  *result = lua_str2number(s, &endptr);
-  if (endptr == s) return 0;  /* conversion failed */
-  if (*endptr == 'x' || *endptr == 'X')  /* maybe an hexadecimal constant? */
-    *result = cast_num(strtoul(s, &endptr, 16));
-  if (*endptr == '\0') return 1;  /* most common case */
-  while (isspace(cast(unsigned char, *endptr))) endptr++;
-  if (*endptr != '\0') return 0;  /* invalid trailing characters? */
-  return 1;
-}
-
-
-
-static void pushstr (lua_State *L, const char *str) {
-  setsvalue2s(L, L->top, luaS_new(L, str));
-  incr_top(L);
-}
-
-
-/* this function handles only `%d', `%c', %f, %p, and `%s' formats */
-const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
-  int n = 1;
-  pushstr(L, "");
-  for (;;) {
-    const char *e = strchr(fmt, '%');
-    if (e == NULL) break;
-    setsvalue2s(L, L->top, luaS_newlstr(L, fmt, e-fmt));
-    incr_top(L);
-    switch (*(e+1)) {
-      case 's': {
-        const char *s = va_arg(argp, char *);
-        if (s == NULL) s = "(null)";
-        pushstr(L, s);
-        break;
-      }
-      case 'c': {
-        char buff[2];
-        buff[0] = cast(char, va_arg(argp, int));
-        buff[1] = '\0';
-        pushstr(L, buff);
-        break;
-      }
-      case 'd': {
-        setnvalue(L->top, cast_num(va_arg(argp, int)));
-        incr_top(L);
-        break;
-      }
-      case 'f': {
-        setnvalue(L->top, cast_num(va_arg(argp, l_uacNumber)));
-        incr_top(L);
-        break;
-      }
-      case 'p': {
-        char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */
-        sprintf(buff, "%p", va_arg(argp, void *));
-        pushstr(L, buff);
-        break;
-      }
-      case '%': {
-        pushstr(L, "%");
-        break;
-      }
-      default: {
-        char buff[3];
-        buff[0] = '%';
-        buff[1] = *(e+1);
-        buff[2] = '\0';
-        pushstr(L, buff);
-        break;
-      }
-    }
-    n += 2;
-    fmt = e+2;
-  }
-  pushstr(L, fmt);
-  luaV_concat(L, n+1, cast_int(L->top - L->base) - 1);
-  L->top -= n;
-  return svalue(L->top - 1);
-}
-
-
-const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {
-  const char *msg;
-  va_list argp;
-  va_start(argp, fmt);
-  msg = luaO_pushvfstring(L, fmt, argp);
-  va_end(argp);
-  return msg;
-}
-
-
-void luaO_chunkid (char *out, const char *source, size_t bufflen) {
-  if (*source == '=') {
-    strncpy(out, source+1, bufflen);  /* remove first char */
-    out[bufflen-1] = '\0';  /* ensures null termination */
-  }
-  else {  /* out = "source", or "...source" */
-    if (*source == '@') {
-      size_t l;
-      source++;  /* skip the `@' */
-      bufflen -= sizeof(" '...' ");
-      l = strlen(source);
-      strcpy(out, "");
-      if (l > bufflen) {
-        source += (l-bufflen);  /* get last part of file name */
-        strcat(out, "...");
-      }
-      strcat(out, source);
-    }
-    else {  /* out = [string "string"] */
-      size_t len = strcspn(source, "\n\r");  /* stop at first newline */
-      bufflen -= sizeof(" [string \"...\"] ");
-      if (len > bufflen) len = bufflen;
-      strcpy(out, "[string \"");
-      if (source[len] != '\0') {  /* must truncate? */
-        strncat(out, source, len);
-        strcat(out, "...");
-      }
-      else
-        strcat(out, source);
-      strcat(out, "\"]");
-    }
-  }
-}
diff --git a/redis-stable/deps/lua/src/lobject.h b/redis-stable/deps/lua/src/lobject.h
deleted file mode 100644
index f1e447ef..00000000
--- a/redis-stable/deps/lua/src/lobject.h
+++ /dev/null
@@ -1,381 +0,0 @@
-/*
-** $Id: lobject.h,v 2.20.1.2 2008/08/06 13:29:48 roberto Exp $
-** Type definitions for Lua objects
-** See Copyright Notice in lua.h
-*/
-
-
-#ifndef lobject_h
-#define lobject_h
-
-
-#include <stdarg.h>
-
-
-#include "llimits.h"
-#include "lua.h"
-
-
-/* tags for values visible from Lua */
-#define LAST_TAG	LUA_TTHREAD
-
-#define NUM_TAGS	(LAST_TAG+1)
-
-
-/*
-** Extra tags for non-values
-*/
-#define LUA_TPROTO	(LAST_TAG+1)
-#define LUA_TUPVAL	(LAST_TAG+2)
-#define LUA_TDEADKEY	(LAST_TAG+3)
-
-
-/*
-** Union of all collectable objects
-*/
-typedef union GCObject GCObject;
-
-
-/*
-** Common Header for all collectable objects (in macro form, to be
-** included in other objects)
-*/
-#define CommonHeader	GCObject *next; lu_byte tt; lu_byte marked
-
-
-/*
-** Common header in struct form
-*/
-typedef struct GCheader {
-  CommonHeader;
-} GCheader;
-
-
-
-
-/*
-** Union of all Lua values
-*/
-typedef union {
-  GCObject *gc;
-  void *p;
-  lua_Number n;
-  int b;
-} Value;
-
-
-/*
-** Tagged Values
-*/
-
-#define TValuefields	Value value; int tt
-
-typedef struct lua_TValue {
-  TValuefields;
-} TValue;
-
-
-/* Macros to test type */
-#define ttisnil(o)	(ttype(o) == LUA_TNIL)
-#define ttisnumber(o)	(ttype(o) == LUA_TNUMBER)
-#define ttisstring(o)	(ttype(o) == LUA_TSTRING)
-#define ttistable(o)	(ttype(o) == LUA_TTABLE)
-#define ttisfunction(o)	(ttype(o) == LUA_TFUNCTION)
-#define ttisboolean(o)	(ttype(o) == LUA_TBOOLEAN)
-#define ttisuserdata(o)	(ttype(o) == LUA_TUSERDATA)
-#define ttisthread(o)	(ttype(o) == LUA_TTHREAD)
-#define ttislightuserdata(o)	(ttype(o) == LUA_TLIGHTUSERDATA)
-
-/* Macros to access values */
-#define ttype(o)	((o)->tt)
-#define gcvalue(o)	check_exp(iscollectable(o), (o)->value.gc)
-#define pvalue(o)	check_exp(ttislightuserdata(o), (o)->value.p)
-#define nvalue(o)	check_exp(ttisnumber(o), (o)->value.n)
-#define rawtsvalue(o)	check_exp(ttisstring(o), &(o)->value.gc->ts)
-#define tsvalue(o)	(&rawtsvalue(o)->tsv)
-#define rawuvalue(o)	check_exp(ttisuserdata(o), &(o)->value.gc->u)
-#define uvalue(o)	(&rawuvalue(o)->uv)
-#define clvalue(o)	check_exp(ttisfunction(o), &(o)->value.gc->cl)
-#define hvalue(o)	check_exp(ttistable(o), &(o)->value.gc->h)
-#define bvalue(o)	check_exp(ttisboolean(o), (o)->value.b)
-#define thvalue(o)	check_exp(ttisthread(o), &(o)->value.gc->th)
-
-#define l_isfalse(o)	(ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0))
-
-/*
-** for internal debug only
-*/
-#define checkconsistency(obj) \
-  lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt))
-
-#define checkliveness(g,obj) \
-  lua_assert(!iscollectable(obj) || \
-  ((ttype(obj) == (obj)->value.gc->gch.tt) && !isdead(g, (obj)->value.gc)))
-
-
-/* Macros to set values */
-#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)
-
-#define setnvalue(obj,x) \
-  { TValue *i_o=(obj); i_o->value.n=(x); i_o->tt=LUA_TNUMBER; }
-
-#define setpvalue(obj,x) \
-  { TValue *i_o=(obj); i_o->value.p=(x); i_o->tt=LUA_TLIGHTUSERDATA; }
-
-#define setbvalue(obj,x) \
-  { TValue *i_o=(obj); i_o->value.b=(x); i_o->tt=LUA_TBOOLEAN; }
-
-#define setsvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TSTRING; \
-    checkliveness(G(L),i_o); }
-
-#define setuvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TUSERDATA; \
-    checkliveness(G(L),i_o); }
-
-#define setthvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTHREAD; \
-    checkliveness(G(L),i_o); }
-
-#define setclvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TFUNCTION; \
-    checkliveness(G(L),i_o); }
-
-#define sethvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTABLE; \
-    checkliveness(G(L),i_o); }
-
-#define setptvalue(L,obj,x) \
-  { TValue *i_o=(obj); \
-    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TPROTO; \
-    checkliveness(G(L),i_o); }
-
-
-
-
-#define setobj(L,obj1,obj2) \
-  { const TValue *o2=(obj2); TValue *o1=(obj1); \
-    o1->value = o2->value; o1->tt=o2->tt; \
-    checkliveness(G(L),o1); }
-
-
-/*
-** different types of sets, according to destination
-*/
-
-/* from stack to (same) stack */
-#define setobjs2s	setobj
-/* to stack (not from same stack) */
-#define setobj2s	setobj
-#define setsvalue2s	setsvalue
-#define sethvalue2s	sethvalue
-#define setptvalue2s	setptvalue
-/* from table to same table */
-#define setobjt2t	setobj
-/* to table */
-#define setobj2t	setobj
-/* to new object */
-#define setobj2n	setobj
-#define setsvalue2n	setsvalue
-
-#define setttype(obj, tt) (ttype(obj) = (tt))
-
-
-#define iscollectable(o)	(ttype(o) >= LUA_TSTRING)
-
-
-
-typedef TValue *StkId;  /* index to stack elements */
-
-
-/*
-** String headers for string table
-*/
-typedef union TString {
-  L_Umaxalign dummy;  /* ensures maximum alignment for strings */
-  struct {
-    CommonHeader;
-    lu_byte reserved;
-    unsigned int hash;
-    size_t len;
-  } tsv;
-} TString;
-
-
-#define getstr(ts)	cast(const char *, (ts) + 1)
-#define svalue(o)       getstr(rawtsvalue(o))
-
-
-
-typedef union Udata {
-  L_Umaxalign dummy;  /* ensures maximum alignment for `local' udata */
-  struct {
-    CommonHeader;
-    struct Table *metatable;
-    struct Table *env;
-    size_t len;
-  } uv;
-} Udata;
-
-
-
-
-/*
-** Function Prototypes
-*/
-typedef struct Proto {
-  CommonHeader;
-  TValue *k;  /* constants used by the function */
-  Instruction *code;
-  struct Proto **p;  /* functions defined inside the function */
-  int *lineinfo;  /* map from opcodes to source lines */
-  struct LocVar *locvars;  /* information about local variables */
-  TString **upvalues;  /* upvalue names */
-  TString  *source;
-  int sizeupvalues;
-  int sizek;  /* size of `k' */
-  int sizecode;
-  int sizelineinfo;
-  int sizep;  /* size of `p' */
-  int sizelocvars;
-  int linedefined;
-  int lastlinedefined;
-  GCObject *gclist;
-  lu_byte nups;  /* number of upvalues */
-  lu_byte numparams;
-  lu_byte is_vararg;
-  lu_byte maxstacksize;
-} Proto;
-
-
-/* masks for new-style vararg */
-#define VARARG_HASARG		1
-#define VARARG_ISVARARG		2
-#define VARARG_NEEDSARG		4
-
-
-typedef struct LocVar {
-  TString *varname;
-  int startpc;  /* first point where variable is active */
-  int endpc;    /* first point where variable is dead */
-} LocVar;
-
-
-
-/*
-** Upvalues
-*/
-
-typedef struct UpVal {
-  CommonHeader;
-  TValue *v;  /* points to stack or to its own value */
-  union {
-    TValue value;  /* the value (when closed) */
-    struct {  /* double linked list (when open) */
-      struct UpVal *prev;
-      struct UpVal *next;
-    } l;
-  } u;
-} UpVal;
-
-
-/*
-** Closures
-*/
-
-#define ClosureHeader \
-	CommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist; \
-	struct Table *env
-
-typedef struct CClosure {
-  ClosureHeader;
-  lua_CFunction f;
-  TValue upvalue[1];
-} CClosure;
-
-
-typedef struct LClosure {
-  ClosureHeader;
-  struct Proto *p;
-  UpVal *upvals[1];
-} LClosure;
-
-
-typedef union Closure {
-  CClosure c;
-  LClosure l;
-} Closure;
-
-
-#define iscfunction(o)	(ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)
-#define isLfunction(o)	(ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC)
-
-
-/*
-** Tables
-*/
-
-typedef union TKey {
-  struct {
-    TValuefields;
-    struct Node *next;  /* for chaining */
-  } nk;
-  TValue tvk;
-} TKey;
-
-
-typedef struct Node {
-  TValue i_val;
-  TKey i_key;
-} Node;
-
-
-typedef struct Table {
-  CommonHeader;
-  lu_byte flags;  /* 1<<p means tagmethod(p) is not present */ 
-  lu_byte lsizenode;  /* log2 of size of `node' array */
-  struct Table *metatable;
-  TValue *array;  /* array part */
-  Node *node;
-  Node *lastfree;  /* any free position is before this position */
-  GCObject *gclist;
-  int sizearray;  /* size of `array' array */
-} Table;
-
-
-
-/*
-** `module' operation for hashing (size is always a power of 2)
-*/
-#define lmod(s,size) \
-	(check_exp((size&(size-1))==0, (cast(int, (s) & ((size)-1)))))
-
-
-#define twoto(x)	(1<<(x))
-#define sizenode(t)	(twoto((t)->lsizenode))
-
-
-#define luaO_nilobject		(&luaO_nilobject_)
-
-LUAI_DATA const TValue luaO_nilobject_;
-
-#define ceillog2(x)	(luaO_log2((x)-1) + 1)
-
-LUAI_FUNC int luaO_log2 (unsigned int x);
-LUAI_FUNC int luaO_int2fb (unsigned int x);
-LUAI_FUNC int luaO_fb2int (int x);
-LUAI_FUNC int luaO_rawequalObj (const TValue *t1, const TValue *t2);
-LUAI_FUNC int luaO_str2d (const char *s, lua_Number *result);
-LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt,
-                                                       va_list argp);
-LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...);
-LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len);
-
-
-#endif
-
diff --git a/redis-stable/deps/lua/src/lopcodes.c b/redis-stable/deps/lua/src/lopcodes.c
deleted file mode 100644
index 4cc74523..00000000
--- a/redis-stable/deps/lua/src/lopcodes.c
+++ /dev/null
@@ -1,102 +0,0 @@
-/*
-** $Id: lopcodes.c,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
-** See Copyright Notice in lua.h
-*/
-
-
-#define lopcodes_c
-#define LUA_CORE
-
-
-#include "lopcodes.h"
-
-
-/* ORDER OP */
-
-const char *const luaP_opnames[NUM_OPCODES+1] = {
-  "MOVE",
-  "LOADK",
-  "LOADBOOL",
-  "LOADNIL",
-  "GETUPVAL",
-  "GETGLOBAL",
-  "GETTABLE",
-  "SETGLOBAL",
-  "SETUPVAL",
-  "SETTABLE",
-  "NEWTABLE",
-  "SELF",
-  "ADD",
-  "SUB",
-  "MUL",
-  "DIV",
-  "MOD",
-  "POW",
-  "UNM",
-  "NOT",
-  "LEN",
-  "CONCAT",
-  "JMP",
-  "EQ",
-  "LT",
-  "LE",
-  "TEST",
-  "TESTSET",
-  "CALL",
-  "TAILCALL",
-  "RETURN",
-  "FORLOOP",
-  "FORPREP",
-  "TFORLOOP",
-  "SETLIST",
-  "CLOSE",
-  "CLOSURE",
-  "VARARG",
-  NULL
-};
-
-
-#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m))
-
-const lu_byte luaP_opmodes[NUM_OPCODES] = {
-/*       T  A    B       C     mode		   opcode	*/
-  opmode(0, 1, OpArgR, OpArgN, iABC) 		/* OP_MOVE */
- ,opmode(0, 1, OpArgK, OpArgN, iABx)		/* OP_LOADK */
- ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_LOADBOOL */
- ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_LOADNIL */
- ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_GETUPVAL */
- ,opmode(0, 1, OpArgK, OpArgN, iABx)		/* OP_GETGLOBAL */
- ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_GETTABLE */
- ,opmode(0, 0, OpArgK, OpArgN, iABx)		/* OP_SETGLOBAL */
- ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_SETUPVAL */
- ,opmode(0, 0, OpArgK, OpArgK, iABC)		/* OP_SETTABLE */
- ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_NEWTABLE */
- ,opmode(0, 1, OpArgR, OpArgK, iABC)		/* OP_SELF */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_ADD */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_SUB */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MUL */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_DIV */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_MOD */
- ,opmode(0, 1, OpArgK, OpArgK, iABC)		/* OP_POW */
- ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_UNM */
- ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_NOT */
- ,opmode(0, 1, OpArgR, OpArgN, iABC)		/* OP_LEN */
- ,opmode(0, 1, OpArgR, OpArgR, iABC)		/* OP_CONCAT */
- ,opmode(0, 0, OpArgR, OpArgN, iAsBx)		/* OP_JMP */
- ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_EQ */
- ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LT */
- ,opmode(1, 0, OpArgK, OpArgK, iABC)		/* OP_LE */
- ,opmode(1, 1, OpArgR, OpArgU, iABC)		/* OP_TEST */
- ,opmode(1, 1, OpArgR, OpArgU, iABC)		/* OP_TESTSET */
- ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_CALL */
- ,opmode(0, 1, OpArgU, OpArgU, iABC)		/* OP_TAILCALL */
- ,opmode(0, 0, OpArgU, OpArgN, iABC)		/* OP_RETURN */
- ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORLOOP */
- ,opmode(0, 1, OpArgR, OpArgN, iAsBx)		/* OP_FORPREP */
- ,opmode(1, 0, OpArgN, OpArgU, iABC)		/* OP_TFORLOOP */
- ,opmode(0, 0, OpArgU, OpArgU, iABC)		/* OP_SETLIST */
- ,opmode(0, 0, OpArgN, OpArgN, iABC)		/* OP_CLOSE */
- ,opmode(0, 1, OpArgU, OpArgN, iABx)		/* OP_CLOSURE */
- ,opmode(0, 1, OpArgU, OpArgN, iABC)		/* OP_VARARG */
-};
-
diff --git a/redis-stable/deps/lua/src/lopcodes.h b/redis-stable/deps/lua/src/lopcodes.h
deleted file mode 100644
index 41224d6e..00000000
--- a/redis-stable/deps/lua/src/lopcodes.h
+++ /dev/null
@@ -1,268 +0,0 @@
-/*
-** $Id: lopcodes.h,v 1.125.1.1 2007/12/27 13:02:25 roberto Exp $
-** Opcodes for Lua virtual machine
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lopcodes_h
-#define lopcodes_h
-
-#include "llimits.h"
-
-
-/*===========================================================================
-  We assume that instructions are unsigned numbers.
-  All instructions have an opcode in the first 6 bits.
-  Instructions can have the following fields:
-	`A' : 8 bits
-	`B' : 9 bits
-	`C' : 9 bits
-	`Bx' : 18 bits (`B' and `C' together)
-	`sBx' : signed Bx
-
-  A signed argument is represented in excess K; that is, the number
-  value is the unsigned value minus K. K is exactly the maximum value
-  for that argument (so that -max is represented by 0, and +max is
-  represented by 2*max), which is half the maximum for the corresponding
-  unsigned argument.
-===========================================================================*/
-
-
-enum OpMode {iABC, iABx, iAsBx};  /* basic instruction format */
-
-
-/*
-** size and position of opcode arguments.
-*/
-#define SIZE_C		9
-#define SIZE_B		9
-#define SIZE_Bx		(SIZE_C + SIZE_B)
-#define SIZE_A		8
-
-#define SIZE_OP		6
-
-#define POS_OP		0
-#define POS_A		(POS_OP + SIZE_OP)
-#define POS_C		(POS_A + SIZE_A)
-#define POS_B		(POS_C + SIZE_C)
-#define POS_Bx		POS_C
-
-
-/*
-** limits for opcode arguments.
-** we use (signed) int to manipulate most arguments,
-** so they must fit in LUAI_BITSINT-1 bits (-1 for sign)
-*/
-#if SIZE_Bx < LUAI_BITSINT-1
-#define MAXARG_Bx        ((1<<SIZE_Bx)-1)
-#define MAXARG_sBx        (MAXARG_Bx>>1)         /* `sBx' is signed */
-#else
-#define MAXARG_Bx        MAX_INT
-#define MAXARG_sBx        MAX_INT
-#endif
-
-
-#define MAXARG_A        ((1<<SIZE_A)-1)
-#define MAXARG_B        ((1<<SIZE_B)-1)
-#define MAXARG_C        ((1<<SIZE_C)-1)
-
-
-/* creates a mask with `n' 1 bits at position `p' */
-#define MASK1(n,p)	((~((~(Instruction)0)<<n))<<p)
-
-/* creates a mask with `n' 0 bits at position `p' */
-#define MASK0(n,p)	(~MASK1(n,p))
-
-/*
-** the following macros help to manipulate instructions
-*/
-
-#define GET_OPCODE(i)	(cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0)))
-#define SET_OPCODE(i,o)	((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \
-		((cast(Instruction, o)<<POS_OP)&MASK1(SIZE_OP,POS_OP))))
-
-#define GETARG_A(i)	(cast(int, ((i)>>POS_A) & MASK1(SIZE_A,0)))
-#define SETARG_A(i,u)	((i) = (((i)&MASK0(SIZE_A,POS_A)) | \
-		((cast(Instruction, u)<<POS_A)&MASK1(SIZE_A,POS_A))))
-
-#define GETARG_B(i)	(cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0)))
-#define SETARG_B(i,b)	((i) = (((i)&MASK0(SIZE_B,POS_B)) | \
-		((cast(Instruction, b)<<POS_B)&MASK1(SIZE_B,POS_B))))
-
-#define GETARG_C(i)	(cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0)))
-#define SETARG_C(i,b)	((i) = (((i)&MASK0(SIZE_C,POS_C)) | \
-		((cast(Instruction, b)<<POS_C)&MASK1(SIZE_C,POS_C))))
-
-#define GETARG_Bx(i)	(cast(int, ((i)>>POS_Bx) & MASK1(SIZE_Bx,0)))
-#define SETARG_Bx(i,b)	((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \
-		((cast(Instruction, b)<<POS_Bx)&MASK1(SIZE_Bx,POS_Bx))))
-
-#define GETARG_sBx(i)	(GETARG_Bx(i)-MAXARG_sBx)
-#define SETARG_sBx(i,b)	SETARG_Bx((i),cast(unsigned int, (b)+MAXARG_sBx))
-
-
-#define CREATE_ABC(o,a,b,c)	((cast(Instruction, o)<<POS_OP) \
-			| (cast(Instruction, a)<<POS_A) \
-			| (cast(Instruction, b)<<POS_B) \
-			| (cast(Instruction, c)<<POS_C))
-
-#define CREATE_ABx(o,a,bc)	((cast(Instruction, o)<<POS_OP) \
-			| (cast(Instruction, a)<<POS_A) \
-			| (cast(Instruction, bc)<<POS_Bx))
-
-
-/*
-** Macros to operate RK indices
-*/
-
-/* this bit 1 means constant (0 means register) */
-#define BITRK		(1 << (SIZE_B - 1))
-
-/* test whether value is a constant */
-#define ISK(x)		((x) & BITRK)
-
-/* gets the index of the constant */
-#define INDEXK(r)	((int)(r) & ~BITRK)
-
-#define MAXINDEXRK	(BITRK - 1)
-
-/* code a constant index as a RK value */
-#define RKASK(x)	((x) | BITRK)
-
-
-/*
-** invalid register that fits in 8 bits
-*/
-#define NO_REG		MAXARG_A
-
-
-/*
-** R(x) - register
-** Kst(x) - constant (in constant table)
-** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x)
-*/
-
-
-/*
-** grep "ORDER OP" if you change these enums
-*/
-
-typedef enum {
-/*----------------------------------------------------------------------
-name		args	description
-------------------------------------------------------------------------*/
-OP_MOVE,/*	A B	R(A) := R(B)					*/
-OP_LOADK,/*	A Bx	R(A) := Kst(Bx)					*/
-OP_LOADBOOL,/*	A B C	R(A) := (Bool)B; if (C) pc++			*/
-OP_LOADNIL,/*	A B	R(A) := ... := R(B) := nil			*/
-OP_GETUPVAL,/*	A B	R(A) := UpValue[B]				*/
-
-OP_GETGLOBAL,/*	A Bx	R(A) := Gbl[Kst(Bx)]				*/
-OP_GETTABLE,/*	A B C	R(A) := R(B)[RK(C)]				*/
-
-OP_SETGLOBAL,/*	A Bx	Gbl[Kst(Bx)] := R(A)				*/
-OP_SETUPVAL,/*	A B	UpValue[B] := R(A)				*/
-OP_SETTABLE,/*	A B C	R(A)[RK(B)] := RK(C)				*/
-
-OP_NEWTABLE,/*	A B C	R(A) := {} (size = B,C)				*/
-
-OP_SELF,/*	A B C	R(A+1) := R(B); R(A) := R(B)[RK(C)]		*/
-
-OP_ADD,/*	A B C	R(A) := RK(B) + RK(C)				*/
-OP_SUB,/*	A B C	R(A) := RK(B) - RK(C)				*/
-OP_MUL,/*	A B C	R(A) := RK(B) * RK(C)				*/
-OP_DIV,/*	A B C	R(A) := RK(B) / RK(C)				*/
-OP_MOD,/*	A B C	R(A) := RK(B) % RK(C)				*/
-OP_POW,/*	A B C	R(A) := RK(B) ^ RK(C)				*/
-OP_UNM,/*	A B	R(A) := -R(B)					*/
-OP_NOT,/*	A B	R(A) := not R(B)				*/
-OP_LEN,/*	A B	R(A) := length of R(B)				*/
-
-OP_CONCAT,/*	A B C	R(A) := R(B).. ... ..R(C)			*/
-
-OP_JMP,/*	sBx	pc+=sBx					*/
-
-OP_EQ,/*	A B C	if ((RK(B) == RK(C)) ~= A) then pc++		*/
-OP_LT,/*	A B C	if ((RK(B) <  RK(C)) ~= A) then pc++  		*/
-OP_LE,/*	A B C	if ((RK(B) <= RK(C)) ~= A) then pc++  		*/
-
-OP_TEST,/*	A C	if not (R(A) <=> C) then pc++			*/ 
-OP_TESTSET,/*	A B C	if (R(B) <=> C) then R(A) := R(B) else pc++	*/ 
-
-OP_CALL,/*	A B C	R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */
-OP_TAILCALL,/*	A B C	return R(A)(R(A+1), ... ,R(A+B-1))		*/
-OP_RETURN,/*	A B	return R(A), ... ,R(A+B-2)	(see note)	*/
-
-OP_FORLOOP,/*	A sBx	R(A)+=R(A+2);
-			if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }*/
-OP_FORPREP,/*	A sBx	R(A)-=R(A+2); pc+=sBx				*/
-
-OP_TFORLOOP,/*	A C	R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); 
-                        if R(A+3) ~= nil then R(A+2)=R(A+3) else pc++	*/ 
-OP_SETLIST,/*	A B C	R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B	*/
-
-OP_CLOSE,/*	A 	close all variables in the stack up to (>=) R(A)*/
-OP_CLOSURE,/*	A Bx	R(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n))	*/
-
-OP_VARARG/*	A B	R(A), R(A+1), ..., R(A+B-1) = vararg		*/
-} OpCode;
-
-
-#define NUM_OPCODES	(cast(int, OP_VARARG) + 1)
-
-
-
-/*===========================================================================
-  Notes:
-  (*) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1,
-      and can be 0: OP_CALL then sets `top' to last_result+1, so
-      next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'.
-
-  (*) In OP_VARARG, if (B == 0) then use actual number of varargs and
-      set top (like in OP_CALL with C == 0).
-
-  (*) In OP_RETURN, if (B == 0) then return up to `top'
-
-  (*) In OP_SETLIST, if (B == 0) then B = `top';
-      if (C == 0) then next `instruction' is real C
-
-  (*) For comparisons, A specifies what condition the test should accept
-      (true or false).
-
-  (*) All `skips' (pc++) assume that next instruction is a jump
-===========================================================================*/
-
-
-/*
-** masks for instruction properties. The format is:
-** bits 0-1: op mode
-** bits 2-3: C arg mode
-** bits 4-5: B arg mode
-** bit 6: instruction set register A
-** bit 7: operator is a test
-*/  
-
-enum OpArgMask {
-  OpArgN,  /* argument is not used */
-  OpArgU,  /* argument is used */
-  OpArgR,  /* argument is a register or a jump offset */
-  OpArgK   /* argument is a constant or register/constant */
-};
-
-LUAI_DATA const lu_byte luaP_opmodes[NUM_OPCODES];
-
-#define getOpMode(m)	(cast(enum OpMode, luaP_opmodes[m] & 3))
-#define getBMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3))
-#define getCMode(m)	(cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3))
-#define testAMode(m)	(luaP_opmodes[m] & (1 << 6))
-#define testTMode(m)	(luaP_opmodes[m] & (1 << 7))
-
-
-LUAI_DATA const char *const luaP_opnames[NUM_OPCODES+1];  /* opcode names */
-
-
-/* number of list items to accumulate before a SETLIST instruction */
-#define LFIELDS_PER_FLUSH	50
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/loslib.c b/redis-stable/deps/lua/src/loslib.c
deleted file mode 100644
index da06a572..00000000
--- a/redis-stable/deps/lua/src/loslib.c
+++ /dev/null
@@ -1,243 +0,0 @@
-/*
-** $Id: loslib.c,v 1.19.1.3 2008/01/18 16:38:18 roberto Exp $
-** Standard Operating System library
-** See Copyright Notice in lua.h
-*/
-
-
-#include <errno.h>
-#include <locale.h>
-#include <stdlib.h>
-#include <string.h>
-#include <time.h>
-
-#define loslib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-static int os_pushresult (lua_State *L, int i, const char *filename) {
-  int en = errno;  /* calls to Lua API may change this value */
-  if (i) {
-    lua_pushboolean(L, 1);
-    return 1;
-  }
-  else {
-    lua_pushnil(L);
-    lua_pushfstring(L, "%s: %s", filename, strerror(en));
-    lua_pushinteger(L, en);
-    return 3;
-  }
-}
-
-
-static int os_execute (lua_State *L) {
-  lua_pushinteger(L, system(luaL_optstring(L, 1, NULL)));
-  return 1;
-}
-
-
-static int os_remove (lua_State *L) {
-  const char *filename = luaL_checkstring(L, 1);
-  return os_pushresult(L, remove(filename) == 0, filename);
-}
-
-
-static int os_rename (lua_State *L) {
-  const char *fromname = luaL_checkstring(L, 1);
-  const char *toname = luaL_checkstring(L, 2);
-  return os_pushresult(L, rename(fromname, toname) == 0, fromname);
-}
-
-
-static int os_tmpname (lua_State *L) {
-  char buff[LUA_TMPNAMBUFSIZE];
-  int err;
-  lua_tmpnam(buff, err);
-  if (err)
-    return luaL_error(L, "unable to generate a unique filename");
-  lua_pushstring(L, buff);
-  return 1;
-}
-
-
-static int os_getenv (lua_State *L) {
-  lua_pushstring(L, getenv(luaL_checkstring(L, 1)));  /* if NULL push nil */
-  return 1;
-}
-
-
-static int os_clock (lua_State *L) {
-  lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC);
-  return 1;
-}
-
-
-/*
-** {======================================================
-** Time/Date operations
-** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S,
-**   wday=%w+1, yday=%j, isdst=? }
-** =======================================================
-*/
-
-static void setfield (lua_State *L, const char *key, int value) {
-  lua_pushinteger(L, value);
-  lua_setfield(L, -2, key);
-}
-
-static void setboolfield (lua_State *L, const char *key, int value) {
-  if (value < 0)  /* undefined? */
-    return;  /* does not set field */
-  lua_pushboolean(L, value);
-  lua_setfield(L, -2, key);
-}
-
-static int getboolfield (lua_State *L, const char *key) {
-  int res;
-  lua_getfield(L, -1, key);
-  res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);
-  lua_pop(L, 1);
-  return res;
-}
-
-
-static int getfield (lua_State *L, const char *key, int d) {
-  int res;
-  lua_getfield(L, -1, key);
-  if (lua_isnumber(L, -1))
-    res = (int)lua_tointeger(L, -1);
-  else {
-    if (d < 0)
-      return luaL_error(L, "field " LUA_QS " missing in date table", key);
-    res = d;
-  }
-  lua_pop(L, 1);
-  return res;
-}
-
-
-static int os_date (lua_State *L) {
-  const char *s = luaL_optstring(L, 1, "%c");
-  time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));
-  struct tm *stm;
-  if (*s == '!') {  /* UTC? */
-    stm = gmtime(&t);
-    s++;  /* skip `!' */
-  }
-  else
-    stm = localtime(&t);
-  if (stm == NULL)  /* invalid date? */
-    lua_pushnil(L);
-  else if (strcmp(s, "*t") == 0) {
-    lua_createtable(L, 0, 9);  /* 9 = number of fields */
-    setfield(L, "sec", stm->tm_sec);
-    setfield(L, "min", stm->tm_min);
-    setfield(L, "hour", stm->tm_hour);
-    setfield(L, "day", stm->tm_mday);
-    setfield(L, "month", stm->tm_mon+1);
-    setfield(L, "year", stm->tm_year+1900);
-    setfield(L, "wday", stm->tm_wday+1);
-    setfield(L, "yday", stm->tm_yday+1);
-    setboolfield(L, "isdst", stm->tm_isdst);
-  }
-  else {
-    char cc[3];
-    luaL_Buffer b;
-    cc[0] = '%'; cc[2] = '\0';
-    luaL_buffinit(L, &b);
-    for (; *s; s++) {
-      if (*s != '%' || *(s + 1) == '\0')  /* no conversion specifier? */
-        luaL_addchar(&b, *s);
-      else {
-        size_t reslen;
-        char buff[200];  /* should be big enough for any conversion result */
-        cc[1] = *(++s);
-        reslen = strftime(buff, sizeof(buff), cc, stm);
-        luaL_addlstring(&b, buff, reslen);
-      }
-    }
-    luaL_pushresult(&b);
-  }
-  return 1;
-}
-
-
-static int os_time (lua_State *L) {
-  time_t t;
-  if (lua_isnoneornil(L, 1))  /* called without args? */
-    t = time(NULL);  /* get current time */
-  else {
-    struct tm ts;
-    luaL_checktype(L, 1, LUA_TTABLE);
-    lua_settop(L, 1);  /* make sure table is at the top */
-    ts.tm_sec = getfield(L, "sec", 0);
-    ts.tm_min = getfield(L, "min", 0);
-    ts.tm_hour = getfield(L, "hour", 12);
-    ts.tm_mday = getfield(L, "day", -1);
-    ts.tm_mon = getfield(L, "month", -1) - 1;
-    ts.tm_year = getfield(L, "year", -1) - 1900;
-    ts.tm_isdst = getboolfield(L, "isdst");
-    t = mktime(&ts);
-  }
-  if (t == (time_t)(-1))
-    lua_pushnil(L);
-  else
-    lua_pushnumber(L, (lua_Number)t);
-  return 1;
-}
-
-
-static int os_difftime (lua_State *L) {
-  lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),
-                             (time_t)(luaL_optnumber(L, 2, 0))));
-  return 1;
-}
-
-/* }====================================================== */
-
-
-static int os_setlocale (lua_State *L) {
-  static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY,
-                      LC_NUMERIC, LC_TIME};
-  static const char *const catnames[] = {"all", "collate", "ctype", "monetary",
-     "numeric", "time", NULL};
-  const char *l = luaL_optstring(L, 1, NULL);
-  int op = luaL_checkoption(L, 2, "all", catnames);
-  lua_pushstring(L, setlocale(cat[op], l));
-  return 1;
-}
-
-
-static int os_exit (lua_State *L) {
-  exit(luaL_optint(L, 1, EXIT_SUCCESS));
-}
-
-static const luaL_Reg syslib[] = {
-  {"clock",     os_clock},
-  {"date",      os_date},
-  {"difftime",  os_difftime},
-  {"execute",   os_execute},
-  {"exit",      os_exit},
-  {"getenv",    os_getenv},
-  {"remove",    os_remove},
-  {"rename",    os_rename},
-  {"setlocale", os_setlocale},
-  {"time",      os_time},
-  {"tmpname",   os_tmpname},
-  {NULL, NULL}
-};
-
-/* }====================================================== */
-
-
-
-LUALIB_API int luaopen_os (lua_State *L) {
-  luaL_register(L, LUA_OSLIBNAME, syslib);
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/lparser.c b/redis-stable/deps/lua/src/lparser.c
deleted file mode 100644
index dda7488d..00000000
--- a/redis-stable/deps/lua/src/lparser.c
+++ /dev/null
@@ -1,1339 +0,0 @@
-/*
-** $Id: lparser.c,v 2.42.1.4 2011/10/21 19:31:42 roberto Exp $
-** Lua Parser
-** See Copyright Notice in lua.h
-*/
-
-
-#include <string.h>
-
-#define lparser_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lcode.h"
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "llex.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lparser.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-
-
-
-#define hasmultret(k)		((k) == VCALL || (k) == VVARARG)
-
-#define getlocvar(fs, i)	((fs)->f->locvars[(fs)->actvar[i]])
-
-#define luaY_checklimit(fs,v,l,m)	if ((v)>(l)) errorlimit(fs,l,m)
-
-
-/*
-** nodes for block list (list of active blocks)
-*/
-typedef struct BlockCnt {
-  struct BlockCnt *previous;  /* chain */
-  int breaklist;  /* list of jumps out of this loop */
-  lu_byte nactvar;  /* # active locals outside the breakable structure */
-  lu_byte upval;  /* true if some variable in the block is an upvalue */
-  lu_byte isbreakable;  /* true if `block' is a loop */
-} BlockCnt;
-
-
-
-/*
-** prototypes for recursive non-terminal functions
-*/
-static void chunk (LexState *ls);
-static void expr (LexState *ls, expdesc *v);
-
-
-static void anchor_token (LexState *ls) {
-  if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) {
-    TString *ts = ls->t.seminfo.ts;
-    luaX_newstring(ls, getstr(ts), ts->tsv.len);
-  }
-}
-
-
-static void error_expected (LexState *ls, int token) {
-  luaX_syntaxerror(ls,
-      luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token)));
-}
-
-
-static void errorlimit (FuncState *fs, int limit, const char *what) {
-  const char *msg = (fs->f->linedefined == 0) ?
-    luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) :
-    luaO_pushfstring(fs->L, "function at line %d has more than %d %s",
-                            fs->f->linedefined, limit, what);
-  luaX_lexerror(fs->ls, msg, 0);
-}
-
-
-static int testnext (LexState *ls, int c) {
-  if (ls->t.token == c) {
-    luaX_next(ls);
-    return 1;
-  }
-  else return 0;
-}
-
-
-static void check (LexState *ls, int c) {
-  if (ls->t.token != c)
-    error_expected(ls, c);
-}
-
-static void checknext (LexState *ls, int c) {
-  check(ls, c);
-  luaX_next(ls);
-}
-
-
-#define check_condition(ls,c,msg)	{ if (!(c)) luaX_syntaxerror(ls, msg); }
-
-
-
-static void check_match (LexState *ls, int what, int who, int where) {
-  if (!testnext(ls, what)) {
-    if (where == ls->linenumber)
-      error_expected(ls, what);
-    else {
-      luaX_syntaxerror(ls, luaO_pushfstring(ls->L,
-             LUA_QS " expected (to close " LUA_QS " at line %d)",
-              luaX_token2str(ls, what), luaX_token2str(ls, who), where));
-    }
-  }
-}
-
-
-static TString *str_checkname (LexState *ls) {
-  TString *ts;
-  check(ls, TK_NAME);
-  ts = ls->t.seminfo.ts;
-  luaX_next(ls);
-  return ts;
-}
-
-
-static void init_exp (expdesc *e, expkind k, int i) {
-  e->f = e->t = NO_JUMP;
-  e->k = k;
-  e->u.s.info = i;
-}
-
-
-static void codestring (LexState *ls, expdesc *e, TString *s) {
-  init_exp(e, VK, luaK_stringK(ls->fs, s));
-}
-
-
-static void checkname(LexState *ls, expdesc *e) {
-  codestring(ls, e, str_checkname(ls));
-}
-
-
-static int registerlocalvar (LexState *ls, TString *varname) {
-  FuncState *fs = ls->fs;
-  Proto *f = fs->f;
-  int oldsize = f->sizelocvars;
-  luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,
-                  LocVar, SHRT_MAX, "too many local variables");
-  while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL;
-  f->locvars[fs->nlocvars].varname = varname;
-  luaC_objbarrier(ls->L, f, varname);
-  return fs->nlocvars++;
-}
-
-
-#define new_localvarliteral(ls,v,n) \
-  new_localvar(ls, luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char))-1), n)
-
-
-static void new_localvar (LexState *ls, TString *name, int n) {
-  FuncState *fs = ls->fs;
-  luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, "local variables");
-  fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));
-}
-
-
-static void adjustlocalvars (LexState *ls, int nvars) {
-  FuncState *fs = ls->fs;
-  fs->nactvar = cast_byte(fs->nactvar + nvars);
-  for (; nvars; nvars--) {
-    getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc;
-  }
-}
-
-
-static void removevars (LexState *ls, int tolevel) {
-  FuncState *fs = ls->fs;
-  while (fs->nactvar > tolevel)
-    getlocvar(fs, --fs->nactvar).endpc = fs->pc;
-}
-
-
-static int indexupvalue (FuncState *fs, TString *name, expdesc *v) {
-  int i;
-  Proto *f = fs->f;
-  int oldsize = f->sizeupvalues;
-  for (i=0; i<f->nups; i++) {
-    if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) {
-      lua_assert(f->upvalues[i] == name);
-      return i;
-    }
-  }
-  /* new one */
-  luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, "upvalues");
-  luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,
-                  TString *, MAX_INT, "");
-  while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;
-  f->upvalues[f->nups] = name;
-  luaC_objbarrier(fs->L, f, name);
-  lua_assert(v->k == VLOCAL || v->k == VUPVAL);
-  fs->upvalues[f->nups].k = cast_byte(v->k);
-  fs->upvalues[f->nups].info = cast_byte(v->u.s.info);
-  return f->nups++;
-}
-
-
-static int searchvar (FuncState *fs, TString *n) {
-  int i;
-  for (i=fs->nactvar-1; i >= 0; i--) {
-    if (n == getlocvar(fs, i).varname)
-      return i;
-  }
-  return -1;  /* not found */
-}
-
-
-static void markupval (FuncState *fs, int level) {
-  BlockCnt *bl = fs->bl;
-  while (bl && bl->nactvar > level) bl = bl->previous;
-  if (bl) bl->upval = 1;
-}
-
-
-static int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) {
-  if (fs == NULL) {  /* no more levels? */
-    init_exp(var, VGLOBAL, NO_REG);  /* default is global variable */
-    return VGLOBAL;
-  }
-  else {
-    int v = searchvar(fs, n);  /* look up at current level */
-    if (v >= 0) {
-      init_exp(var, VLOCAL, v);
-      if (!base)
-        markupval(fs, v);  /* local will be used as an upval */
-      return VLOCAL;
-    }
-    else {  /* not found at current level; try upper one */
-      if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL)
-        return VGLOBAL;
-      var->u.s.info = indexupvalue(fs, n, var);  /* else was LOCAL or UPVAL */
-      var->k = VUPVAL;  /* upvalue in this level */
-      return VUPVAL;
-    }
-  }
-}
-
-
-static void singlevar (LexState *ls, expdesc *var) {
-  TString *varname = str_checkname(ls);
-  FuncState *fs = ls->fs;
-  if (singlevaraux(fs, varname, var, 1) == VGLOBAL)
-    var->u.s.info = luaK_stringK(fs, varname);  /* info points to global name */
-}
-
-
-static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {
-  FuncState *fs = ls->fs;
-  int extra = nvars - nexps;
-  if (hasmultret(e->k)) {
-    extra++;  /* includes call itself */
-    if (extra < 0) extra = 0;
-    luaK_setreturns(fs, e, extra);  /* last exp. provides the difference */
-    if (extra > 1) luaK_reserveregs(fs, extra-1);
-  }
-  else {
-    if (e->k != VVOID) luaK_exp2nextreg(fs, e);  /* close last expression */
-    if (extra > 0) {
-      int reg = fs->freereg;
-      luaK_reserveregs(fs, extra);
-      luaK_nil(fs, reg, extra);
-    }
-  }
-}
-
-
-static void enterlevel (LexState *ls) {
-  if (++ls->L->nCcalls > LUAI_MAXCCALLS)
-	luaX_lexerror(ls, "chunk has too many syntax levels", 0);
-}
-
-
-#define leavelevel(ls)	((ls)->L->nCcalls--)
-
-
-static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) {
-  bl->breaklist = NO_JUMP;
-  bl->isbreakable = isbreakable;
-  bl->nactvar = fs->nactvar;
-  bl->upval = 0;
-  bl->previous = fs->bl;
-  fs->bl = bl;
-  lua_assert(fs->freereg == fs->nactvar);
-}
-
-
-static void leaveblock (FuncState *fs) {
-  BlockCnt *bl = fs->bl;
-  fs->bl = bl->previous;
-  removevars(fs->ls, bl->nactvar);
-  if (bl->upval)
-    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
-  /* a block either controls scope or breaks (never both) */
-  lua_assert(!bl->isbreakable || !bl->upval);
-  lua_assert(bl->nactvar == fs->nactvar);
-  fs->freereg = fs->nactvar;  /* free registers */
-  luaK_patchtohere(fs, bl->breaklist);
-}
-
-
-static void pushclosure (LexState *ls, FuncState *func, expdesc *v) {
-  FuncState *fs = ls->fs;
-  Proto *f = fs->f;
-  int oldsize = f->sizep;
-  int i;
-  luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,
-                  MAXARG_Bx, "constant table overflow");
-  while (oldsize < f->sizep) f->p[oldsize++] = NULL;
-  f->p[fs->np++] = func->f;
-  luaC_objbarrier(ls->L, f, func->f);
-  init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1));
-  for (i=0; i<func->f->nups; i++) {
-    OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL;
-    luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0);
-  }
-}
-
-
-static void open_func (LexState *ls, FuncState *fs) {
-  lua_State *L = ls->L;
-  Proto *f = luaF_newproto(L);
-  fs->f = f;
-  fs->prev = ls->fs;  /* linked list of funcstates */
-  fs->ls = ls;
-  fs->L = L;
-  ls->fs = fs;
-  fs->pc = 0;
-  fs->lasttarget = -1;
-  fs->jpc = NO_JUMP;
-  fs->freereg = 0;
-  fs->nk = 0;
-  fs->np = 0;
-  fs->nlocvars = 0;
-  fs->nactvar = 0;
-  fs->bl = NULL;
-  f->source = ls->source;
-  f->maxstacksize = 2;  /* registers 0/1 are always valid */
-  fs->h = luaH_new(L, 0, 0);
-  /* anchor table of constants and prototype (to avoid being collected) */
-  sethvalue2s(L, L->top, fs->h);
-  incr_top(L);
-  setptvalue2s(L, L->top, f);
-  incr_top(L);
-}
-
-
-static void close_func (LexState *ls) {
-  lua_State *L = ls->L;
-  FuncState *fs = ls->fs;
-  Proto *f = fs->f;
-  removevars(ls, 0);
-  luaK_ret(fs, 0, 0);  /* final return */
-  luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction);
-  f->sizecode = fs->pc;
-  luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int);
-  f->sizelineinfo = fs->pc;
-  luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue);
-  f->sizek = fs->nk;
-  luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *);
-  f->sizep = fs->np;
-  luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar);
-  f->sizelocvars = fs->nlocvars;
-  luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *);
-  f->sizeupvalues = f->nups;
-  lua_assert(luaG_checkcode(f));
-  lua_assert(fs->bl == NULL);
-  ls->fs = fs->prev;
-  /* last token read was anchored in defunct function; must reanchor it */
-  if (fs) anchor_token(ls);
-  L->top -= 2;  /* remove table and prototype from the stack */
-}
-
-
-Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {
-  struct LexState lexstate;
-  struct FuncState funcstate;
-  lexstate.buff = buff;
-  luaX_setinput(L, &lexstate, z, luaS_new(L, name));
-  open_func(&lexstate, &funcstate);
-  funcstate.f->is_vararg = VARARG_ISVARARG;  /* main func. is always vararg */
-  luaX_next(&lexstate);  /* read first token */
-  chunk(&lexstate);
-  check(&lexstate, TK_EOS);
-  close_func(&lexstate);
-  lua_assert(funcstate.prev == NULL);
-  lua_assert(funcstate.f->nups == 0);
-  lua_assert(lexstate.fs == NULL);
-  return funcstate.f;
-}
-
-
-
-/*============================================================*/
-/* GRAMMAR RULES */
-/*============================================================*/
-
-
-static void field (LexState *ls, expdesc *v) {
-  /* field -> ['.' | ':'] NAME */
-  FuncState *fs = ls->fs;
-  expdesc key;
-  luaK_exp2anyreg(fs, v);
-  luaX_next(ls);  /* skip the dot or colon */
-  checkname(ls, &key);
-  luaK_indexed(fs, v, &key);
-}
-
-
-static void yindex (LexState *ls, expdesc *v) {
-  /* index -> '[' expr ']' */
-  luaX_next(ls);  /* skip the '[' */
-  expr(ls, v);
-  luaK_exp2val(ls->fs, v);
-  checknext(ls, ']');
-}
-
-
-/*
-** {======================================================================
-** Rules for Constructors
-** =======================================================================
-*/
-
-
-struct ConsControl {
-  expdesc v;  /* last list item read */
-  expdesc *t;  /* table descriptor */
-  int nh;  /* total number of `record' elements */
-  int na;  /* total number of array elements */
-  int tostore;  /* number of array elements pending to be stored */
-};
-
-
-static void recfield (LexState *ls, struct ConsControl *cc) {
-  /* recfield -> (NAME | `['exp1`]') = exp1 */
-  FuncState *fs = ls->fs;
-  int reg = ls->fs->freereg;
-  expdesc key, val;
-  int rkkey;
-  if (ls->t.token == TK_NAME) {
-    luaY_checklimit(fs, cc->nh, MAX_INT, "items in a constructor");
-    checkname(ls, &key);
-  }
-  else  /* ls->t.token == '[' */
-    yindex(ls, &key);
-  cc->nh++;
-  checknext(ls, '=');
-  rkkey = luaK_exp2RK(fs, &key);
-  expr(ls, &val);
-  luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, luaK_exp2RK(fs, &val));
-  fs->freereg = reg;  /* free registers */
-}
-
-
-static void closelistfield (FuncState *fs, struct ConsControl *cc) {
-  if (cc->v.k == VVOID) return;  /* there is no list item */
-  luaK_exp2nextreg(fs, &cc->v);
-  cc->v.k = VVOID;
-  if (cc->tostore == LFIELDS_PER_FLUSH) {
-    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);  /* flush */
-    cc->tostore = 0;  /* no more items pending */
-  }
-}
-
-
-static void lastlistfield (FuncState *fs, struct ConsControl *cc) {
-  if (cc->tostore == 0) return;
-  if (hasmultret(cc->v.k)) {
-    luaK_setmultret(fs, &cc->v);
-    luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET);
-    cc->na--;  /* do not count last expression (unknown number of elements) */
-  }
-  else {
-    if (cc->v.k != VVOID)
-      luaK_exp2nextreg(fs, &cc->v);
-    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);
-  }
-}
-
-
-static void listfield (LexState *ls, struct ConsControl *cc) {
-  expr(ls, &cc->v);
-  luaY_checklimit(ls->fs, cc->na, MAX_INT, "items in a constructor");
-  cc->na++;
-  cc->tostore++;
-}
-
-
-static void constructor (LexState *ls, expdesc *t) {
-  /* constructor -> ?? */
-  FuncState *fs = ls->fs;
-  int line = ls->linenumber;
-  int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0);
-  struct ConsControl cc;
-  cc.na = cc.nh = cc.tostore = 0;
-  cc.t = t;
-  init_exp(t, VRELOCABLE, pc);
-  init_exp(&cc.v, VVOID, 0);  /* no value (yet) */
-  luaK_exp2nextreg(ls->fs, t);  /* fix it at stack top (for gc) */
-  checknext(ls, '{');
-  do {
-    lua_assert(cc.v.k == VVOID || cc.tostore > 0);
-    if (ls->t.token == '}') break;
-    closelistfield(fs, &cc);
-    switch(ls->t.token) {
-      case TK_NAME: {  /* may be listfields or recfields */
-        luaX_lookahead(ls);
-        if (ls->lookahead.token != '=')  /* expression? */
-          listfield(ls, &cc);
-        else
-          recfield(ls, &cc);
-        break;
-      }
-      case '[': {  /* constructor_item -> recfield */
-        recfield(ls, &cc);
-        break;
-      }
-      default: {  /* constructor_part -> listfield */
-        listfield(ls, &cc);
-        break;
-      }
-    }
-  } while (testnext(ls, ',') || testnext(ls, ';'));
-  check_match(ls, '}', '{', line);
-  lastlistfield(fs, &cc);
-  SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */
-  SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh));  /* set initial table size */
-}
-
-/* }====================================================================== */
-
-
-
-static void parlist (LexState *ls) {
-  /* parlist -> [ param { `,' param } ] */
-  FuncState *fs = ls->fs;
-  Proto *f = fs->f;
-  int nparams = 0;
-  f->is_vararg = 0;
-  if (ls->t.token != ')') {  /* is `parlist' not empty? */
-    do {
-      switch (ls->t.token) {
-        case TK_NAME: {  /* param -> NAME */
-          new_localvar(ls, str_checkname(ls), nparams++);
-          break;
-        }
-        case TK_DOTS: {  /* param -> `...' */
-          luaX_next(ls);
-#if defined(LUA_COMPAT_VARARG)
-          /* use `arg' as default name */
-          new_localvarliteral(ls, "arg", nparams++);
-          f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG;
-#endif
-          f->is_vararg |= VARARG_ISVARARG;
-          break;
-        }
-        default: luaX_syntaxerror(ls, "<name> or " LUA_QL("...") " expected");
-      }
-    } while (!f->is_vararg && testnext(ls, ','));
-  }
-  adjustlocalvars(ls, nparams);
-  f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG));
-  luaK_reserveregs(fs, fs->nactvar);  /* reserve register for parameters */
-}
-
-
-static void body (LexState *ls, expdesc *e, int needself, int line) {
-  /* body ->  `(' parlist `)' chunk END */
-  FuncState new_fs;
-  open_func(ls, &new_fs);
-  new_fs.f->linedefined = line;
-  checknext(ls, '(');
-  if (needself) {
-    new_localvarliteral(ls, "self", 0);
-    adjustlocalvars(ls, 1);
-  }
-  parlist(ls);
-  checknext(ls, ')');
-  chunk(ls);
-  new_fs.f->lastlinedefined = ls->linenumber;
-  check_match(ls, TK_END, TK_FUNCTION, line);
-  close_func(ls);
-  pushclosure(ls, &new_fs, e);
-}
-
-
-static int explist1 (LexState *ls, expdesc *v) {
-  /* explist1 -> expr { `,' expr } */
-  int n = 1;  /* at least one expression */
-  expr(ls, v);
-  while (testnext(ls, ',')) {
-    luaK_exp2nextreg(ls->fs, v);
-    expr(ls, v);
-    n++;
-  }
-  return n;
-}
-
-
-static void funcargs (LexState *ls, expdesc *f) {
-  FuncState *fs = ls->fs;
-  expdesc args;
-  int base, nparams;
-  int line = ls->linenumber;
-  switch (ls->t.token) {
-    case '(': {  /* funcargs -> `(' [ explist1 ] `)' */
-      if (line != ls->lastline)
-        luaX_syntaxerror(ls,"ambiguous syntax (function call x new statement)");
-      luaX_next(ls);
-      if (ls->t.token == ')')  /* arg list is empty? */
-        args.k = VVOID;
-      else {
-        explist1(ls, &args);
-        luaK_setmultret(fs, &args);
-      }
-      check_match(ls, ')', '(', line);
-      break;
-    }
-    case '{': {  /* funcargs -> constructor */
-      constructor(ls, &args);
-      break;
-    }
-    case TK_STRING: {  /* funcargs -> STRING */
-      codestring(ls, &args, ls->t.seminfo.ts);
-      luaX_next(ls);  /* must use `seminfo' before `next' */
-      break;
-    }
-    default: {
-      luaX_syntaxerror(ls, "function arguments expected");
-      return;
-    }
-  }
-  lua_assert(f->k == VNONRELOC);
-  base = f->u.s.info;  /* base register for call */
-  if (hasmultret(args.k))
-    nparams = LUA_MULTRET;  /* open call */
-  else {
-    if (args.k != VVOID)
-      luaK_exp2nextreg(fs, &args);  /* close last argument */
-    nparams = fs->freereg - (base+1);
-  }
-  init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));
-  luaK_fixline(fs, line);
-  fs->freereg = base+1;  /* call remove function and arguments and leaves
-                            (unless changed) one result */
-}
-
-
-
-
-/*
-** {======================================================================
-** Expression parsing
-** =======================================================================
-*/
-
-
-static void prefixexp (LexState *ls, expdesc *v) {
-  /* prefixexp -> NAME | '(' expr ')' */
-  switch (ls->t.token) {
-    case '(': {
-      int line = ls->linenumber;
-      luaX_next(ls);
-      expr(ls, v);
-      check_match(ls, ')', '(', line);
-      luaK_dischargevars(ls->fs, v);
-      return;
-    }
-    case TK_NAME: {
-      singlevar(ls, v);
-      return;
-    }
-    default: {
-      luaX_syntaxerror(ls, "unexpected symbol");
-      return;
-    }
-  }
-}
-
-
-static void primaryexp (LexState *ls, expdesc *v) {
-  /* primaryexp ->
-        prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */
-  FuncState *fs = ls->fs;
-  prefixexp(ls, v);
-  for (;;) {
-    switch (ls->t.token) {
-      case '.': {  /* field */
-        field(ls, v);
-        break;
-      }
-      case '[': {  /* `[' exp1 `]' */
-        expdesc key;
-        luaK_exp2anyreg(fs, v);
-        yindex(ls, &key);
-        luaK_indexed(fs, v, &key);
-        break;
-      }
-      case ':': {  /* `:' NAME funcargs */
-        expdesc key;
-        luaX_next(ls);
-        checkname(ls, &key);
-        luaK_self(fs, v, &key);
-        funcargs(ls, v);
-        break;
-      }
-      case '(': case TK_STRING: case '{': {  /* funcargs */
-        luaK_exp2nextreg(fs, v);
-        funcargs(ls, v);
-        break;
-      }
-      default: return;
-    }
-  }
-}
-
-
-static void simpleexp (LexState *ls, expdesc *v) {
-  /* simpleexp -> NUMBER | STRING | NIL | true | false | ... |
-                  constructor | FUNCTION body | primaryexp */
-  switch (ls->t.token) {
-    case TK_NUMBER: {
-      init_exp(v, VKNUM, 0);
-      v->u.nval = ls->t.seminfo.r;
-      break;
-    }
-    case TK_STRING: {
-      codestring(ls, v, ls->t.seminfo.ts);
-      break;
-    }
-    case TK_NIL: {
-      init_exp(v, VNIL, 0);
-      break;
-    }
-    case TK_TRUE: {
-      init_exp(v, VTRUE, 0);
-      break;
-    }
-    case TK_FALSE: {
-      init_exp(v, VFALSE, 0);
-      break;
-    }
-    case TK_DOTS: {  /* vararg */
-      FuncState *fs = ls->fs;
-      check_condition(ls, fs->f->is_vararg,
-                      "cannot use " LUA_QL("...") " outside a vararg function");
-      fs->f->is_vararg &= ~VARARG_NEEDSARG;  /* don't need 'arg' */
-      init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0));
-      break;
-    }
-    case '{': {  /* constructor */
-      constructor(ls, v);
-      return;
-    }
-    case TK_FUNCTION: {
-      luaX_next(ls);
-      body(ls, v, 0, ls->linenumber);
-      return;
-    }
-    default: {
-      primaryexp(ls, v);
-      return;
-    }
-  }
-  luaX_next(ls);
-}
-
-
-static UnOpr getunopr (int op) {
-  switch (op) {
-    case TK_NOT: return OPR_NOT;
-    case '-': return OPR_MINUS;
-    case '#': return OPR_LEN;
-    default: return OPR_NOUNOPR;
-  }
-}
-
-
-static BinOpr getbinopr (int op) {
-  switch (op) {
-    case '+': return OPR_ADD;
-    case '-': return OPR_SUB;
-    case '*': return OPR_MUL;
-    case '/': return OPR_DIV;
-    case '%': return OPR_MOD;
-    case '^': return OPR_POW;
-    case TK_CONCAT: return OPR_CONCAT;
-    case TK_NE: return OPR_NE;
-    case TK_EQ: return OPR_EQ;
-    case '<': return OPR_LT;
-    case TK_LE: return OPR_LE;
-    case '>': return OPR_GT;
-    case TK_GE: return OPR_GE;
-    case TK_AND: return OPR_AND;
-    case TK_OR: return OPR_OR;
-    default: return OPR_NOBINOPR;
-  }
-}
-
-
-static const struct {
-  lu_byte left;  /* left priority for each binary operator */
-  lu_byte right; /* right priority */
-} priority[] = {  /* ORDER OPR */
-   {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7},  /* `+' `-' `/' `%' */
-   {10, 9}, {5, 4},                 /* power and concat (right associative) */
-   {3, 3}, {3, 3},                  /* equality and inequality */
-   {3, 3}, {3, 3}, {3, 3}, {3, 3},  /* order */
-   {2, 2}, {1, 1}                   /* logical (and/or) */
-};
-
-#define UNARY_PRIORITY	8  /* priority for unary operators */
-
-
-/*
-** subexpr -> (simpleexp | unop subexpr) { binop subexpr }
-** where `binop' is any binary operator with a priority higher than `limit'
-*/
-static BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) {
-  BinOpr op;
-  UnOpr uop;
-  enterlevel(ls);
-  uop = getunopr(ls->t.token);
-  if (uop != OPR_NOUNOPR) {
-    luaX_next(ls);
-    subexpr(ls, v, UNARY_PRIORITY);
-    luaK_prefix(ls->fs, uop, v);
-  }
-  else simpleexp(ls, v);
-  /* expand while operators have priorities higher than `limit' */
-  op = getbinopr(ls->t.token);
-  while (op != OPR_NOBINOPR && priority[op].left > limit) {
-    expdesc v2;
-    BinOpr nextop;
-    luaX_next(ls);
-    luaK_infix(ls->fs, op, v);
-    /* read sub-expression with higher priority */
-    nextop = subexpr(ls, &v2, priority[op].right);
-    luaK_posfix(ls->fs, op, v, &v2);
-    op = nextop;
-  }
-  leavelevel(ls);
-  return op;  /* return first untreated operator */
-}
-
-
-static void expr (LexState *ls, expdesc *v) {
-  subexpr(ls, v, 0);
-}
-
-/* }==================================================================== */
-
-
-
-/*
-** {======================================================================
-** Rules for Statements
-** =======================================================================
-*/
-
-
-static int block_follow (int token) {
-  switch (token) {
-    case TK_ELSE: case TK_ELSEIF: case TK_END:
-    case TK_UNTIL: case TK_EOS:
-      return 1;
-    default: return 0;
-  }
-}
-
-
-static void block (LexState *ls) {
-  /* block -> chunk */
-  FuncState *fs = ls->fs;
-  BlockCnt bl;
-  enterblock(fs, &bl, 0);
-  chunk(ls);
-  lua_assert(bl.breaklist == NO_JUMP);
-  leaveblock(fs);
-}
-
-
-/*
-** structure to chain all variables in the left-hand side of an
-** assignment
-*/
-struct LHS_assign {
-  struct LHS_assign *prev;
-  expdesc v;  /* variable (global, local, upvalue, or indexed) */
-};
-
-
-/*
-** check whether, in an assignment to a local variable, the local variable
-** is needed in a previous assignment (to a table). If so, save original
-** local value in a safe place and use this safe copy in the previous
-** assignment.
-*/
-static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) {
-  FuncState *fs = ls->fs;
-  int extra = fs->freereg;  /* eventual position to save local variable */
-  int conflict = 0;
-  for (; lh; lh = lh->prev) {
-    if (lh->v.k == VINDEXED) {
-      if (lh->v.u.s.info == v->u.s.info) {  /* conflict? */
-        conflict = 1;
-        lh->v.u.s.info = extra;  /* previous assignment will use safe copy */
-      }
-      if (lh->v.u.s.aux == v->u.s.info) {  /* conflict? */
-        conflict = 1;
-        lh->v.u.s.aux = extra;  /* previous assignment will use safe copy */
-      }
-    }
-  }
-  if (conflict) {
-    luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.info, 0);  /* make copy */
-    luaK_reserveregs(fs, 1);
-  }
-}
-
-
-static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {
-  expdesc e;
-  check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,
-                      "syntax error");
-  if (testnext(ls, ',')) {  /* assignment -> `,' primaryexp assignment */
-    struct LHS_assign nv;
-    nv.prev = lh;
-    primaryexp(ls, &nv.v);
-    if (nv.v.k == VLOCAL)
-      check_conflict(ls, lh, &nv.v);
-    luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,
-                    "variables in assignment");
-    assignment(ls, &nv, nvars+1);
-  }
-  else {  /* assignment -> `=' explist1 */
-    int nexps;
-    checknext(ls, '=');
-    nexps = explist1(ls, &e);
-    if (nexps != nvars) {
-      adjust_assign(ls, nvars, nexps, &e);
-      if (nexps > nvars)
-        ls->fs->freereg -= nexps - nvars;  /* remove extra values */
-    }
-    else {
-      luaK_setoneret(ls->fs, &e);  /* close last expression */
-      luaK_storevar(ls->fs, &lh->v, &e);
-      return;  /* avoid default */
-    }
-  }
-  init_exp(&e, VNONRELOC, ls->fs->freereg-1);  /* default assignment */
-  luaK_storevar(ls->fs, &lh->v, &e);
-}
-
-
-static int cond (LexState *ls) {
-  /* cond -> exp */
-  expdesc v;
-  expr(ls, &v);  /* read condition */
-  if (v.k == VNIL) v.k = VFALSE;  /* `falses' are all equal here */
-  luaK_goiftrue(ls->fs, &v);
-  return v.f;
-}
-
-
-static void breakstat (LexState *ls) {
-  FuncState *fs = ls->fs;
-  BlockCnt *bl = fs->bl;
-  int upval = 0;
-  while (bl && !bl->isbreakable) {
-    upval |= bl->upval;
-    bl = bl->previous;
-  }
-  if (!bl)
-    luaX_syntaxerror(ls, "no loop to break");
-  if (upval)
-    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);
-  luaK_concat(fs, &bl->breaklist, luaK_jump(fs));
-}
-
-
-static void whilestat (LexState *ls, int line) {
-  /* whilestat -> WHILE cond DO block END */
-  FuncState *fs = ls->fs;
-  int whileinit;
-  int condexit;
-  BlockCnt bl;
-  luaX_next(ls);  /* skip WHILE */
-  whileinit = luaK_getlabel(fs);
-  condexit = cond(ls);
-  enterblock(fs, &bl, 1);
-  checknext(ls, TK_DO);
-  block(ls);
-  luaK_patchlist(fs, luaK_jump(fs), whileinit);
-  check_match(ls, TK_END, TK_WHILE, line);
-  leaveblock(fs);
-  luaK_patchtohere(fs, condexit);  /* false conditions finish the loop */
-}
-
-
-static void repeatstat (LexState *ls, int line) {
-  /* repeatstat -> REPEAT block UNTIL cond */
-  int condexit;
-  FuncState *fs = ls->fs;
-  int repeat_init = luaK_getlabel(fs);
-  BlockCnt bl1, bl2;
-  enterblock(fs, &bl1, 1);  /* loop block */
-  enterblock(fs, &bl2, 0);  /* scope block */
-  luaX_next(ls);  /* skip REPEAT */
-  chunk(ls);
-  check_match(ls, TK_UNTIL, TK_REPEAT, line);
-  condexit = cond(ls);  /* read condition (inside scope block) */
-  if (!bl2.upval) {  /* no upvalues? */
-    leaveblock(fs);  /* finish scope */
-    luaK_patchlist(ls->fs, condexit, repeat_init);  /* close the loop */
-  }
-  else {  /* complete semantics when there are upvalues */
-    breakstat(ls);  /* if condition then break */
-    luaK_patchtohere(ls->fs, condexit);  /* else... */
-    leaveblock(fs);  /* finish scope... */
-    luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init);  /* and repeat */
-  }
-  leaveblock(fs);  /* finish loop */
-}
-
-
-static int exp1 (LexState *ls) {
-  expdesc e;
-  int k;
-  expr(ls, &e);
-  k = e.k;
-  luaK_exp2nextreg(ls->fs, &e);
-  return k;
-}
-
-
-static void forbody (LexState *ls, int base, int line, int nvars, int isnum) {
-  /* forbody -> DO block */
-  BlockCnt bl;
-  FuncState *fs = ls->fs;
-  int prep, endfor;
-  adjustlocalvars(ls, 3);  /* control variables */
-  checknext(ls, TK_DO);
-  prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);
-  enterblock(fs, &bl, 0);  /* scope for declared variables */
-  adjustlocalvars(ls, nvars);
-  luaK_reserveregs(fs, nvars);
-  block(ls);
-  leaveblock(fs);  /* end of scope for declared variables */
-  luaK_patchtohere(fs, prep);
-  endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :
-                     luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars);
-  luaK_fixline(fs, line);  /* pretend that `OP_FOR' starts the loop */
-  luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1);
-}
-
-
-static void fornum (LexState *ls, TString *varname, int line) {
-  /* fornum -> NAME = exp1,exp1[,exp1] forbody */
-  FuncState *fs = ls->fs;
-  int base = fs->freereg;
-  new_localvarliteral(ls, "(for index)", 0);
-  new_localvarliteral(ls, "(for limit)", 1);
-  new_localvarliteral(ls, "(for step)", 2);
-  new_localvar(ls, varname, 3);
-  checknext(ls, '=');
-  exp1(ls);  /* initial value */
-  checknext(ls, ',');
-  exp1(ls);  /* limit */
-  if (testnext(ls, ','))
-    exp1(ls);  /* optional step */
-  else {  /* default step = 1 */
-    luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1));
-    luaK_reserveregs(fs, 1);
-  }
-  forbody(ls, base, line, 1, 1);
-}
-
-
-static void forlist (LexState *ls, TString *indexname) {
-  /* forlist -> NAME {,NAME} IN explist1 forbody */
-  FuncState *fs = ls->fs;
-  expdesc e;
-  int nvars = 0;
-  int line;
-  int base = fs->freereg;
-  /* create control variables */
-  new_localvarliteral(ls, "(for generator)", nvars++);
-  new_localvarliteral(ls, "(for state)", nvars++);
-  new_localvarliteral(ls, "(for control)", nvars++);
-  /* create declared variables */
-  new_localvar(ls, indexname, nvars++);
-  while (testnext(ls, ','))
-    new_localvar(ls, str_checkname(ls), nvars++);
-  checknext(ls, TK_IN);
-  line = ls->linenumber;
-  adjust_assign(ls, 3, explist1(ls, &e), &e);
-  luaK_checkstack(fs, 3);  /* extra space to call generator */
-  forbody(ls, base, line, nvars - 3, 0);
-}
-
-
-static void forstat (LexState *ls, int line) {
-  /* forstat -> FOR (fornum | forlist) END */
-  FuncState *fs = ls->fs;
-  TString *varname;
-  BlockCnt bl;
-  enterblock(fs, &bl, 1);  /* scope for loop and control variables */
-  luaX_next(ls);  /* skip `for' */
-  varname = str_checkname(ls);  /* first variable name */
-  switch (ls->t.token) {
-    case '=': fornum(ls, varname, line); break;
-    case ',': case TK_IN: forlist(ls, varname); break;
-    default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected");
-  }
-  check_match(ls, TK_END, TK_FOR, line);
-  leaveblock(fs);  /* loop scope (`break' jumps to this point) */
-}
-
-
-static int test_then_block (LexState *ls) {
-  /* test_then_block -> [IF | ELSEIF] cond THEN block */
-  int condexit;
-  luaX_next(ls);  /* skip IF or ELSEIF */
-  condexit = cond(ls);
-  checknext(ls, TK_THEN);
-  block(ls);  /* `then' part */
-  return condexit;
-}
-
-
-static void ifstat (LexState *ls, int line) {
-  /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */
-  FuncState *fs = ls->fs;
-  int flist;
-  int escapelist = NO_JUMP;
-  flist = test_then_block(ls);  /* IF cond THEN block */
-  while (ls->t.token == TK_ELSEIF) {
-    luaK_concat(fs, &escapelist, luaK_jump(fs));
-    luaK_patchtohere(fs, flist);
-    flist = test_then_block(ls);  /* ELSEIF cond THEN block */
-  }
-  if (ls->t.token == TK_ELSE) {
-    luaK_concat(fs, &escapelist, luaK_jump(fs));
-    luaK_patchtohere(fs, flist);
-    luaX_next(ls);  /* skip ELSE (after patch, for correct line info) */
-    block(ls);  /* `else' part */
-  }
-  else
-    luaK_concat(fs, &escapelist, flist);
-  luaK_patchtohere(fs, escapelist);
-  check_match(ls, TK_END, TK_IF, line);
-}
-
-
-static void localfunc (LexState *ls) {
-  expdesc v, b;
-  FuncState *fs = ls->fs;
-  new_localvar(ls, str_checkname(ls), 0);
-  init_exp(&v, VLOCAL, fs->freereg);
-  luaK_reserveregs(fs, 1);
-  adjustlocalvars(ls, 1);
-  body(ls, &b, 0, ls->linenumber);
-  luaK_storevar(fs, &v, &b);
-  /* debug information will only see the variable after this point! */
-  getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;
-}
-
-
-static void localstat (LexState *ls) {
-  /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */
-  int nvars = 0;
-  int nexps;
-  expdesc e;
-  do {
-    new_localvar(ls, str_checkname(ls), nvars++);
-  } while (testnext(ls, ','));
-  if (testnext(ls, '='))
-    nexps = explist1(ls, &e);
-  else {
-    e.k = VVOID;
-    nexps = 0;
-  }
-  adjust_assign(ls, nvars, nexps, &e);
-  adjustlocalvars(ls, nvars);
-}
-
-
-static int funcname (LexState *ls, expdesc *v) {
-  /* funcname -> NAME {field} [`:' NAME] */
-  int needself = 0;
-  singlevar(ls, v);
-  while (ls->t.token == '.')
-    field(ls, v);
-  if (ls->t.token == ':') {
-    needself = 1;
-    field(ls, v);
-  }
-  return needself;
-}
-
-
-static void funcstat (LexState *ls, int line) {
-  /* funcstat -> FUNCTION funcname body */
-  int needself;
-  expdesc v, b;
-  luaX_next(ls);  /* skip FUNCTION */
-  needself = funcname(ls, &v);
-  body(ls, &b, needself, line);
-  luaK_storevar(ls->fs, &v, &b);
-  luaK_fixline(ls->fs, line);  /* definition `happens' in the first line */
-}
-
-
-static void exprstat (LexState *ls) {
-  /* stat -> func | assignment */
-  FuncState *fs = ls->fs;
-  struct LHS_assign v;
-  primaryexp(ls, &v.v);
-  if (v.v.k == VCALL)  /* stat -> func */
-    SETARG_C(getcode(fs, &v.v), 1);  /* call statement uses no results */
-  else {  /* stat -> assignment */
-    v.prev = NULL;
-    assignment(ls, &v, 1);
-  }
-}
-
-
-static void retstat (LexState *ls) {
-  /* stat -> RETURN explist */
-  FuncState *fs = ls->fs;
-  expdesc e;
-  int first, nret;  /* registers with returned values */
-  luaX_next(ls);  /* skip RETURN */
-  if (block_follow(ls->t.token) || ls->t.token == ';')
-    first = nret = 0;  /* return no values */
-  else {
-    nret = explist1(ls, &e);  /* optional return values */
-    if (hasmultret(e.k)) {
-      luaK_setmultret(fs, &e);
-      if (e.k == VCALL && nret == 1) {  /* tail call? */
-        SET_OPCODE(getcode(fs,&e), OP_TAILCALL);
-        lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar);
-      }
-      first = fs->nactvar;
-      nret = LUA_MULTRET;  /* return all values */
-    }
-    else {
-      if (nret == 1)  /* only one single value? */
-        first = luaK_exp2anyreg(fs, &e);
-      else {
-        luaK_exp2nextreg(fs, &e);  /* values must go to the `stack' */
-        first = fs->nactvar;  /* return all `active' values */
-        lua_assert(nret == fs->freereg - first);
-      }
-    }
-  }
-  luaK_ret(fs, first, nret);
-}
-
-
-static int statement (LexState *ls) {
-  int line = ls->linenumber;  /* may be needed for error messages */
-  switch (ls->t.token) {
-    case TK_IF: {  /* stat -> ifstat */
-      ifstat(ls, line);
-      return 0;
-    }
-    case TK_WHILE: {  /* stat -> whilestat */
-      whilestat(ls, line);
-      return 0;
-    }
-    case TK_DO: {  /* stat -> DO block END */
-      luaX_next(ls);  /* skip DO */
-      block(ls);
-      check_match(ls, TK_END, TK_DO, line);
-      return 0;
-    }
-    case TK_FOR: {  /* stat -> forstat */
-      forstat(ls, line);
-      return 0;
-    }
-    case TK_REPEAT: {  /* stat -> repeatstat */
-      repeatstat(ls, line);
-      return 0;
-    }
-    case TK_FUNCTION: {
-      funcstat(ls, line);  /* stat -> funcstat */
-      return 0;
-    }
-    case TK_LOCAL: {  /* stat -> localstat */
-      luaX_next(ls);  /* skip LOCAL */
-      if (testnext(ls, TK_FUNCTION))  /* local function? */
-        localfunc(ls);
-      else
-        localstat(ls);
-      return 0;
-    }
-    case TK_RETURN: {  /* stat -> retstat */
-      retstat(ls);
-      return 1;  /* must be last statement */
-    }
-    case TK_BREAK: {  /* stat -> breakstat */
-      luaX_next(ls);  /* skip BREAK */
-      breakstat(ls);
-      return 1;  /* must be last statement */
-    }
-    default: {
-      exprstat(ls);
-      return 0;  /* to avoid warnings */
-    }
-  }
-}
-
-
-static void chunk (LexState *ls) {
-  /* chunk -> { stat [`;'] } */
-  int islast = 0;
-  enterlevel(ls);
-  while (!islast && !block_follow(ls->t.token)) {
-    islast = statement(ls);
-    testnext(ls, ';');
-    lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg &&
-               ls->fs->freereg >= ls->fs->nactvar);
-    ls->fs->freereg = ls->fs->nactvar;  /* free registers */
-  }
-  leavelevel(ls);
-}
-
-/* }====================================================================== */
diff --git a/redis-stable/deps/lua/src/lparser.h b/redis-stable/deps/lua/src/lparser.h
deleted file mode 100644
index 18836afd..00000000
--- a/redis-stable/deps/lua/src/lparser.h
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
-** $Id: lparser.h,v 1.57.1.1 2007/12/27 13:02:25 roberto Exp $
-** Lua Parser
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lparser_h
-#define lparser_h
-
-#include "llimits.h"
-#include "lobject.h"
-#include "lzio.h"
-
-
-/*
-** Expression descriptor
-*/
-
-typedef enum {
-  VVOID,	/* no value */
-  VNIL,
-  VTRUE,
-  VFALSE,
-  VK,		/* info = index of constant in `k' */
-  VKNUM,	/* nval = numerical value */
-  VLOCAL,	/* info = local register */
-  VUPVAL,       /* info = index of upvalue in `upvalues' */
-  VGLOBAL,	/* info = index of table; aux = index of global name in `k' */
-  VINDEXED,	/* info = table register; aux = index register (or `k') */
-  VJMP,		/* info = instruction pc */
-  VRELOCABLE,	/* info = instruction pc */
-  VNONRELOC,	/* info = result register */
-  VCALL,	/* info = instruction pc */
-  VVARARG	/* info = instruction pc */
-} expkind;
-
-typedef struct expdesc {
-  expkind k;
-  union {
-    struct { int info, aux; } s;
-    lua_Number nval;
-  } u;
-  int t;  /* patch list of `exit when true' */
-  int f;  /* patch list of `exit when false' */
-} expdesc;
-
-
-typedef struct upvaldesc {
-  lu_byte k;
-  lu_byte info;
-} upvaldesc;
-
-
-struct BlockCnt;  /* defined in lparser.c */
-
-
-/* state needed to generate code for a given function */
-typedef struct FuncState {
-  Proto *f;  /* current function header */
-  Table *h;  /* table to find (and reuse) elements in `k' */
-  struct FuncState *prev;  /* enclosing function */
-  struct LexState *ls;  /* lexical state */
-  struct lua_State *L;  /* copy of the Lua state */
-  struct BlockCnt *bl;  /* chain of current blocks */
-  int pc;  /* next position to code (equivalent to `ncode') */
-  int lasttarget;   /* `pc' of last `jump target' */
-  int jpc;  /* list of pending jumps to `pc' */
-  int freereg;  /* first free register */
-  int nk;  /* number of elements in `k' */
-  int np;  /* number of elements in `p' */
-  short nlocvars;  /* number of elements in `locvars' */
-  lu_byte nactvar;  /* number of active local variables */
-  upvaldesc upvalues[LUAI_MAXUPVALUES];  /* upvalues */
-  unsigned short actvar[LUAI_MAXVARS];  /* declared-variable stack */
-} FuncState;
-
-
-LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,
-                                            const char *name);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/lstate.c b/redis-stable/deps/lua/src/lstate.c
deleted file mode 100644
index 4313b83a..00000000
--- a/redis-stable/deps/lua/src/lstate.c
+++ /dev/null
@@ -1,214 +0,0 @@
-/*
-** $Id: lstate.c,v 2.36.1.2 2008/01/03 15:20:39 roberto Exp $
-** Global State
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stddef.h>
-
-#define lstate_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lgc.h"
-#include "llex.h"
-#include "lmem.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-
-
-#define state_size(x)	(sizeof(x) + LUAI_EXTRASPACE)
-#define fromstate(l)	(cast(lu_byte *, (l)) - LUAI_EXTRASPACE)
-#define tostate(l)   (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE))
-
-
-/*
-** Main thread combines a thread state and the global state
-*/
-typedef struct LG {
-  lua_State l;
-  global_State g;
-} LG;
-  
-
-
-static void stack_init (lua_State *L1, lua_State *L) {
-  /* initialize CallInfo array */
-  L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo);
-  L1->ci = L1->base_ci;
-  L1->size_ci = BASIC_CI_SIZE;
-  L1->end_ci = L1->base_ci + L1->size_ci - 1;
-  /* initialize stack array */
-  L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TValue);
-  L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK;
-  L1->top = L1->stack;
-  L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1;
-  /* initialize first ci */
-  L1->ci->func = L1->top;
-  setnilvalue(L1->top++);  /* `function' entry for this `ci' */
-  L1->base = L1->ci->base = L1->top;
-  L1->ci->top = L1->top + LUA_MINSTACK;
-}
-
-
-static void freestack (lua_State *L, lua_State *L1) {
-  luaM_freearray(L, L1->base_ci, L1->size_ci, CallInfo);
-  luaM_freearray(L, L1->stack, L1->stacksize, TValue);
-}
-
-
-/*
-** open parts that may cause memory-allocation errors
-*/
-static void f_luaopen (lua_State *L, void *ud) {
-  global_State *g = G(L);
-  UNUSED(ud);
-  stack_init(L, L);  /* init stack */
-  sethvalue(L, gt(L), luaH_new(L, 0, 2));  /* table of globals */
-  sethvalue(L, registry(L), luaH_new(L, 0, 2));  /* registry */
-  luaS_resize(L, MINSTRTABSIZE);  /* initial size of string table */
-  luaT_init(L);
-  luaX_init(L);
-  luaS_fix(luaS_newliteral(L, MEMERRMSG));
-  g->GCthreshold = 4*g->totalbytes;
-}
-
-
-static void preinit_state (lua_State *L, global_State *g) {
-  G(L) = g;
-  L->stack = NULL;
-  L->stacksize = 0;
-  L->errorJmp = NULL;
-  L->hook = NULL;
-  L->hookmask = 0;
-  L->basehookcount = 0;
-  L->allowhook = 1;
-  resethookcount(L);
-  L->openupval = NULL;
-  L->size_ci = 0;
-  L->nCcalls = L->baseCcalls = 0;
-  L->status = 0;
-  L->base_ci = L->ci = NULL;
-  L->savedpc = NULL;
-  L->errfunc = 0;
-  setnilvalue(gt(L));
-}
-
-
-static void close_state (lua_State *L) {
-  global_State *g = G(L);
-  luaF_close(L, L->stack);  /* close all upvalues for this thread */
-  luaC_freeall(L);  /* collect all objects */
-  lua_assert(g->rootgc == obj2gco(L));
-  lua_assert(g->strt.nuse == 0);
-  luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);
-  luaZ_freebuffer(L, &g->buff);
-  freestack(L, L);
-  lua_assert(g->totalbytes == sizeof(LG));
-  (*g->frealloc)(g->ud, fromstate(L), state_size(LG), 0);
-}
-
-
-lua_State *luaE_newthread (lua_State *L) {
-  lua_State *L1 = tostate(luaM_malloc(L, state_size(lua_State)));
-  luaC_link(L, obj2gco(L1), LUA_TTHREAD);
-  preinit_state(L1, G(L));
-  stack_init(L1, L);  /* init stack */
-  setobj2n(L, gt(L1), gt(L));  /* share table of globals */
-  L1->hookmask = L->hookmask;
-  L1->basehookcount = L->basehookcount;
-  L1->hook = L->hook;
-  resethookcount(L1);
-  lua_assert(iswhite(obj2gco(L1)));
-  return L1;
-}
-
-
-void luaE_freethread (lua_State *L, lua_State *L1) {
-  luaF_close(L1, L1->stack);  /* close all upvalues for this thread */
-  lua_assert(L1->openupval == NULL);
-  luai_userstatefree(L1);
-  freestack(L, L1);
-  luaM_freemem(L, fromstate(L1), state_size(lua_State));
-}
-
-
-LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) {
-  int i;
-  lua_State *L;
-  global_State *g;
-  void *l = (*f)(ud, NULL, 0, state_size(LG));
-  if (l == NULL) return NULL;
-  L = tostate(l);
-  g = &((LG *)L)->g;
-  L->next = NULL;
-  L->tt = LUA_TTHREAD;
-  g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT);
-  L->marked = luaC_white(g);
-  set2bits(L->marked, FIXEDBIT, SFIXEDBIT);
-  preinit_state(L, g);
-  g->frealloc = f;
-  g->ud = ud;
-  g->mainthread = L;
-  g->uvhead.u.l.prev = &g->uvhead;
-  g->uvhead.u.l.next = &g->uvhead;
-  g->GCthreshold = 0;  /* mark it as unfinished state */
-  g->strt.size = 0;
-  g->strt.nuse = 0;
-  g->strt.hash = NULL;
-  setnilvalue(registry(L));
-  luaZ_initbuffer(L, &g->buff);
-  g->panic = NULL;
-  g->gcstate = GCSpause;
-  g->rootgc = obj2gco(L);
-  g->sweepstrgc = 0;
-  g->sweepgc = &g->rootgc;
-  g->gray = NULL;
-  g->grayagain = NULL;
-  g->weak = NULL;
-  g->tmudata = NULL;
-  g->totalbytes = sizeof(LG);
-  g->gcpause = LUAI_GCPAUSE;
-  g->gcstepmul = LUAI_GCMUL;
-  g->gcdept = 0;
-  for (i=0; i<NUM_TAGS; i++) g->mt[i] = NULL;
-  if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) {
-    /* memory allocation error: free partial state */
-    close_state(L);
-    L = NULL;
-  }
-  else
-    luai_userstateopen(L);
-  return L;
-}
-
-
-static void callallgcTM (lua_State *L, void *ud) {
-  UNUSED(ud);
-  luaC_callGCTM(L);  /* call GC metamethods for all udata */
-}
-
-
-LUA_API void lua_close (lua_State *L) {
-  L = G(L)->mainthread;  /* only the main thread can be closed */
-  lua_lock(L);
-  luaF_close(L, L->stack);  /* close all upvalues for this thread */
-  luaC_separateudata(L, 1);  /* separate udata that have GC metamethods */
-  L->errfunc = 0;  /* no error function during GC metamethods */
-  do {  /* repeat until no more errors */
-    L->ci = L->base_ci;
-    L->base = L->top = L->ci->base;
-    L->nCcalls = L->baseCcalls = 0;
-  } while (luaD_rawrunprotected(L, callallgcTM, NULL) != 0);
-  lua_assert(G(L)->tmudata == NULL);
-  luai_userstateclose(L);
-  close_state(L);
-}
-
diff --git a/redis-stable/deps/lua/src/lstate.h b/redis-stable/deps/lua/src/lstate.h
deleted file mode 100644
index 3bc575b6..00000000
--- a/redis-stable/deps/lua/src/lstate.h
+++ /dev/null
@@ -1,169 +0,0 @@
-/*
-** $Id: lstate.h,v 2.24.1.2 2008/01/03 15:20:39 roberto Exp $
-** Global State
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lstate_h
-#define lstate_h
-
-#include "lua.h"
-
-#include "lobject.h"
-#include "ltm.h"
-#include "lzio.h"
-
-
-
-struct lua_longjmp;  /* defined in ldo.c */
-
-
-/* table of globals */
-#define gt(L)	(&L->l_gt)
-
-/* registry */
-#define registry(L)	(&G(L)->l_registry)
-
-
-/* extra stack space to handle TM calls and some other extras */
-#define EXTRA_STACK   5
-
-
-#define BASIC_CI_SIZE           8
-
-#define BASIC_STACK_SIZE        (2*LUA_MINSTACK)
-
-
-
-typedef struct stringtable {
-  GCObject **hash;
-  lu_int32 nuse;  /* number of elements */
-  int size;
-} stringtable;
-
-
-/*
-** informations about a call
-*/
-typedef struct CallInfo {
-  StkId base;  /* base for this function */
-  StkId func;  /* function index in the stack */
-  StkId	top;  /* top for this function */
-  const Instruction *savedpc;
-  int nresults;  /* expected number of results from this function */
-  int tailcalls;  /* number of tail calls lost under this entry */
-} CallInfo;
-
-
-
-#define curr_func(L)	(clvalue(L->ci->func))
-#define ci_func(ci)	(clvalue((ci)->func))
-#define f_isLua(ci)	(!ci_func(ci)->c.isC)
-#define isLua(ci)	(ttisfunction((ci)->func) && f_isLua(ci))
-
-
-/*
-** `global state', shared by all threads of this state
-*/
-typedef struct global_State {
-  stringtable strt;  /* hash table for strings */
-  lua_Alloc frealloc;  /* function to reallocate memory */
-  void *ud;         /* auxiliary data to `frealloc' */
-  lu_byte currentwhite;
-  lu_byte gcstate;  /* state of garbage collector */
-  int sweepstrgc;  /* position of sweep in `strt' */
-  GCObject *rootgc;  /* list of all collectable objects */
-  GCObject **sweepgc;  /* position of sweep in `rootgc' */
-  GCObject *gray;  /* list of gray objects */
-  GCObject *grayagain;  /* list of objects to be traversed atomically */
-  GCObject *weak;  /* list of weak tables (to be cleared) */
-  GCObject *tmudata;  /* last element of list of userdata to be GC */
-  Mbuffer buff;  /* temporary buffer for string concatentation */
-  lu_mem GCthreshold;
-  lu_mem totalbytes;  /* number of bytes currently allocated */
-  lu_mem estimate;  /* an estimate of number of bytes actually in use */
-  lu_mem gcdept;  /* how much GC is `behind schedule' */
-  int gcpause;  /* size of pause between successive GCs */
-  int gcstepmul;  /* GC `granularity' */
-  lua_CFunction panic;  /* to be called in unprotected errors */
-  TValue l_registry;
-  struct lua_State *mainthread;
-  UpVal uvhead;  /* head of double-linked list of all open upvalues */
-  struct Table *mt[NUM_TAGS];  /* metatables for basic types */
-  TString *tmname[TM_N];  /* array with tag-method names */
-} global_State;
-
-
-/*
-** `per thread' state
-*/
-struct lua_State {
-  CommonHeader;
-  lu_byte status;
-  StkId top;  /* first free slot in the stack */
-  StkId base;  /* base of current function */
-  global_State *l_G;
-  CallInfo *ci;  /* call info for current function */
-  const Instruction *savedpc;  /* `savedpc' of current function */
-  StkId stack_last;  /* last free slot in the stack */
-  StkId stack;  /* stack base */
-  CallInfo *end_ci;  /* points after end of ci array*/
-  CallInfo *base_ci;  /* array of CallInfo's */
-  int stacksize;
-  int size_ci;  /* size of array `base_ci' */
-  unsigned short nCcalls;  /* number of nested C calls */
-  unsigned short baseCcalls;  /* nested C calls when resuming coroutine */
-  lu_byte hookmask;
-  lu_byte allowhook;
-  int basehookcount;
-  int hookcount;
-  lua_Hook hook;
-  TValue l_gt;  /* table of globals */
-  TValue env;  /* temporary place for environments */
-  GCObject *openupval;  /* list of open upvalues in this stack */
-  GCObject *gclist;
-  struct lua_longjmp *errorJmp;  /* current error recover point */
-  ptrdiff_t errfunc;  /* current error handling function (stack index) */
-};
-
-
-#define G(L)	(L->l_G)
-
-
-/*
-** Union of all collectable objects
-*/
-union GCObject {
-  GCheader gch;
-  union TString ts;
-  union Udata u;
-  union Closure cl;
-  struct Table h;
-  struct Proto p;
-  struct UpVal uv;
-  struct lua_State th;  /* thread */
-};
-
-
-/* macros to convert a GCObject into a specific value */
-#define rawgco2ts(o)	check_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts))
-#define gco2ts(o)	(&rawgco2ts(o)->tsv)
-#define rawgco2u(o)	check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
-#define gco2u(o)	(&rawgco2u(o)->uv)
-#define gco2cl(o)	check_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl))
-#define gco2h(o)	check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))
-#define gco2p(o)	check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))
-#define gco2uv(o)	check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv))
-#define ngcotouv(o) \
-	check_exp((o) == NULL || (o)->gch.tt == LUA_TUPVAL, &((o)->uv))
-#define gco2th(o)	check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))
-
-/* macro to convert any Lua object into a GCObject */
-#define obj2gco(v)	(cast(GCObject *, (v)))
-
-
-LUAI_FUNC lua_State *luaE_newthread (lua_State *L);
-LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
-
-#endif
-
diff --git a/redis-stable/deps/lua/src/lstring.c b/redis-stable/deps/lua/src/lstring.c
deleted file mode 100644
index 49113151..00000000
--- a/redis-stable/deps/lua/src/lstring.c
+++ /dev/null
@@ -1,111 +0,0 @@
-/*
-** $Id: lstring.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
-** String table (keeps all strings handled by Lua)
-** See Copyright Notice in lua.h
-*/
-
-
-#include <string.h>
-
-#define lstring_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-#include "lstring.h"
-
-
-
-void luaS_resize (lua_State *L, int newsize) {
-  GCObject **newhash;
-  stringtable *tb;
-  int i;
-  if (G(L)->gcstate == GCSsweepstring)
-    return;  /* cannot resize during GC traverse */
-  newhash = luaM_newvector(L, newsize, GCObject *);
-  tb = &G(L)->strt;
-  for (i=0; i<newsize; i++) newhash[i] = NULL;
-  /* rehash */
-  for (i=0; i<tb->size; i++) {
-    GCObject *p = tb->hash[i];
-    while (p) {  /* for each node in the list */
-      GCObject *next = p->gch.next;  /* save next */
-      unsigned int h = gco2ts(p)->hash;
-      int h1 = lmod(h, newsize);  /* new position */
-      lua_assert(cast_int(h%newsize) == lmod(h, newsize));
-      p->gch.next = newhash[h1];  /* chain it */
-      newhash[h1] = p;
-      p = next;
-    }
-  }
-  luaM_freearray(L, tb->hash, tb->size, TString *);
-  tb->size = newsize;
-  tb->hash = newhash;
-}
-
-
-static TString *newlstr (lua_State *L, const char *str, size_t l,
-                                       unsigned int h) {
-  TString *ts;
-  stringtable *tb;
-  if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char))
-    luaM_toobig(L);
-  ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString)));
-  ts->tsv.len = l;
-  ts->tsv.hash = h;
-  ts->tsv.marked = luaC_white(G(L));
-  ts->tsv.tt = LUA_TSTRING;
-  ts->tsv.reserved = 0;
-  memcpy(ts+1, str, l*sizeof(char));
-  ((char *)(ts+1))[l] = '\0';  /* ending 0 */
-  tb = &G(L)->strt;
-  h = lmod(h, tb->size);
-  ts->tsv.next = tb->hash[h];  /* chain new entry */
-  tb->hash[h] = obj2gco(ts);
-  tb->nuse++;
-  if (tb->nuse > cast(lu_int32, tb->size) && tb->size <= MAX_INT/2)
-    luaS_resize(L, tb->size*2);  /* too crowded */
-  return ts;
-}
-
-
-TString *luaS_newlstr (lua_State *L, const char *str, size_t l) {
-  GCObject *o;
-  unsigned int h = cast(unsigned int, l);  /* seed */
-  size_t step = (l>>5)+1;  /* if string is too long, don't hash all its chars */
-  size_t l1;
-  for (l1=l; l1>=step; l1-=step)  /* compute hash */
-    h = h ^ ((h<<5)+(h>>2)+cast(unsigned char, str[l1-1]));
-  for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];
-       o != NULL;
-       o = o->gch.next) {
-    TString *ts = rawgco2ts(o);
-    if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) {
-      /* string may be dead */
-      if (isdead(G(L), o)) changewhite(o);
-      return ts;
-    }
-  }
-  return newlstr(L, str, l, h);  /* not found */
-}
-
-
-Udata *luaS_newudata (lua_State *L, size_t s, Table *e) {
-  Udata *u;
-  if (s > MAX_SIZET - sizeof(Udata))
-    luaM_toobig(L);
-  u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata)));
-  u->uv.marked = luaC_white(G(L));  /* is not finalized */
-  u->uv.tt = LUA_TUSERDATA;
-  u->uv.len = s;
-  u->uv.metatable = NULL;
-  u->uv.env = e;
-  /* chain it on udata list (after main thread) */
-  u->uv.next = G(L)->mainthread->next;
-  G(L)->mainthread->next = obj2gco(u);
-  return u;
-}
-
diff --git a/redis-stable/deps/lua/src/lstring.h b/redis-stable/deps/lua/src/lstring.h
deleted file mode 100644
index 73a2ff8b..00000000
--- a/redis-stable/deps/lua/src/lstring.h
+++ /dev/null
@@ -1,31 +0,0 @@
-/*
-** $Id: lstring.h,v 1.43.1.1 2007/12/27 13:02:25 roberto Exp $
-** String table (keep all strings handled by Lua)
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lstring_h
-#define lstring_h
-
-
-#include "lgc.h"
-#include "lobject.h"
-#include "lstate.h"
-
-
-#define sizestring(s)	(sizeof(union TString)+((s)->len+1)*sizeof(char))
-
-#define sizeudata(u)	(sizeof(union Udata)+(u)->len)
-
-#define luaS_new(L, s)	(luaS_newlstr(L, s, strlen(s)))
-#define luaS_newliteral(L, s)	(luaS_newlstr(L, "" s, \
-                                 (sizeof(s)/sizeof(char))-1))
-
-#define luaS_fix(s)	l_setbit((s)->tsv.marked, FIXEDBIT)
-
-LUAI_FUNC void luaS_resize (lua_State *L, int newsize);
-LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e);
-LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l);
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/lstrlib.c b/redis-stable/deps/lua/src/lstrlib.c
deleted file mode 100644
index 7a03489b..00000000
--- a/redis-stable/deps/lua/src/lstrlib.c
+++ /dev/null
@@ -1,871 +0,0 @@
-/*
-** $Id: lstrlib.c,v 1.132.1.5 2010/05/14 15:34:19 roberto Exp $
-** Standard library for string operations and pattern-matching
-** See Copyright Notice in lua.h
-*/
-
-
-#include <ctype.h>
-#include <stddef.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define lstrlib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-/* macro to `unsign' a character */
-#define uchar(c)        ((unsigned char)(c))
-
-
-
-static int str_len (lua_State *L) {
-  size_t l;
-  luaL_checklstring(L, 1, &l);
-  lua_pushinteger(L, l);
-  return 1;
-}
-
-
-static ptrdiff_t posrelat (ptrdiff_t pos, size_t len) {
-  /* relative string position: negative means back from end */
-  if (pos < 0) pos += (ptrdiff_t)len + 1;
-  return (pos >= 0) ? pos : 0;
-}
-
-
-static int str_sub (lua_State *L) {
-  size_t l;
-  const char *s = luaL_checklstring(L, 1, &l);
-  ptrdiff_t start = posrelat(luaL_checkinteger(L, 2), l);
-  ptrdiff_t end = posrelat(luaL_optinteger(L, 3, -1), l);
-  if (start < 1) start = 1;
-  if (end > (ptrdiff_t)l) end = (ptrdiff_t)l;
-  if (start <= end)
-    lua_pushlstring(L, s+start-1, end-start+1);
-  else lua_pushliteral(L, "");
-  return 1;
-}
-
-
-static int str_reverse (lua_State *L) {
-  size_t l;
-  luaL_Buffer b;
-  const char *s = luaL_checklstring(L, 1, &l);
-  luaL_buffinit(L, &b);
-  while (l--) luaL_addchar(&b, s[l]);
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static int str_lower (lua_State *L) {
-  size_t l;
-  size_t i;
-  luaL_Buffer b;
-  const char *s = luaL_checklstring(L, 1, &l);
-  luaL_buffinit(L, &b);
-  for (i=0; i<l; i++)
-    luaL_addchar(&b, tolower(uchar(s[i])));
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static int str_upper (lua_State *L) {
-  size_t l;
-  size_t i;
-  luaL_Buffer b;
-  const char *s = luaL_checklstring(L, 1, &l);
-  luaL_buffinit(L, &b);
-  for (i=0; i<l; i++)
-    luaL_addchar(&b, toupper(uchar(s[i])));
-  luaL_pushresult(&b);
-  return 1;
-}
-
-static int str_rep (lua_State *L) {
-  size_t l;
-  luaL_Buffer b;
-  const char *s = luaL_checklstring(L, 1, &l);
-  int n = luaL_checkint(L, 2);
-  luaL_buffinit(L, &b);
-  while (n-- > 0)
-    luaL_addlstring(&b, s, l);
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static int str_byte (lua_State *L) {
-  size_t l;
-  const char *s = luaL_checklstring(L, 1, &l);
-  ptrdiff_t posi = posrelat(luaL_optinteger(L, 2, 1), l);
-  ptrdiff_t pose = posrelat(luaL_optinteger(L, 3, posi), l);
-  int n, i;
-  if (posi <= 0) posi = 1;
-  if ((size_t)pose > l) pose = l;
-  if (posi > pose) return 0;  /* empty interval; return no values */
-  n = (int)(pose -  posi + 1);
-  if (posi + n <= pose)  /* overflow? */
-    luaL_error(L, "string slice too long");
-  luaL_checkstack(L, n, "string slice too long");
-  for (i=0; i<n; i++)
-    lua_pushinteger(L, uchar(s[posi+i-1]));
-  return n;
-}
-
-
-static int str_char (lua_State *L) {
-  int n = lua_gettop(L);  /* number of arguments */
-  int i;
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  for (i=1; i<=n; i++) {
-    int c = luaL_checkint(L, i);
-    luaL_argcheck(L, uchar(c) == c, i, "invalid value");
-    luaL_addchar(&b, uchar(c));
-  }
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static int writer (lua_State *L, const void* b, size_t size, void* B) {
-  (void)L;
-  luaL_addlstring((luaL_Buffer*) B, (const char *)b, size);
-  return 0;
-}
-
-
-static int str_dump (lua_State *L) {
-  luaL_Buffer b;
-  luaL_checktype(L, 1, LUA_TFUNCTION);
-  lua_settop(L, 1);
-  luaL_buffinit(L,&b);
-  if (lua_dump(L, writer, &b) != 0)
-    luaL_error(L, "unable to dump given function");
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-
-/*
-** {======================================================
-** PATTERN MATCHING
-** =======================================================
-*/
-
-
-#define CAP_UNFINISHED	(-1)
-#define CAP_POSITION	(-2)
-
-typedef struct MatchState {
-  const char *src_init;  /* init of source string */
-  const char *src_end;  /* end (`\0') of source string */
-  lua_State *L;
-  int level;  /* total number of captures (finished or unfinished) */
-  struct {
-    const char *init;
-    ptrdiff_t len;
-  } capture[LUA_MAXCAPTURES];
-} MatchState;
-
-
-#define L_ESC		'%'
-#define SPECIALS	"^$*+?.([%-"
-
-
-static int check_capture (MatchState *ms, int l) {
-  l -= '1';
-  if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)
-    return luaL_error(ms->L, "invalid capture index");
-  return l;
-}
-
-
-static int capture_to_close (MatchState *ms) {
-  int level = ms->level;
-  for (level--; level>=0; level--)
-    if (ms->capture[level].len == CAP_UNFINISHED) return level;
-  return luaL_error(ms->L, "invalid pattern capture");
-}
-
-
-static const char *classend (MatchState *ms, const char *p) {
-  switch (*p++) {
-    case L_ESC: {
-      if (*p == '\0')
-        luaL_error(ms->L, "malformed pattern (ends with " LUA_QL("%%") ")");
-      return p+1;
-    }
-    case '[': {
-      if (*p == '^') p++;
-      do {  /* look for a `]' */
-        if (*p == '\0')
-          luaL_error(ms->L, "malformed pattern (missing " LUA_QL("]") ")");
-        if (*(p++) == L_ESC && *p != '\0')
-          p++;  /* skip escapes (e.g. `%]') */
-      } while (*p != ']');
-      return p+1;
-    }
-    default: {
-      return p;
-    }
-  }
-}
-
-
-static int match_class (int c, int cl) {
-  int res;
-  switch (tolower(cl)) {
-    case 'a' : res = isalpha(c); break;
-    case 'c' : res = iscntrl(c); break;
-    case 'd' : res = isdigit(c); break;
-    case 'l' : res = islower(c); break;
-    case 'p' : res = ispunct(c); break;
-    case 's' : res = isspace(c); break;
-    case 'u' : res = isupper(c); break;
-    case 'w' : res = isalnum(c); break;
-    case 'x' : res = isxdigit(c); break;
-    case 'z' : res = (c == 0); break;
-    default: return (cl == c);
-  }
-  return (islower(cl) ? res : !res);
-}
-
-
-static int matchbracketclass (int c, const char *p, const char *ec) {
-  int sig = 1;
-  if (*(p+1) == '^') {
-    sig = 0;
-    p++;  /* skip the `^' */
-  }
-  while (++p < ec) {
-    if (*p == L_ESC) {
-      p++;
-      if (match_class(c, uchar(*p)))
-        return sig;
-    }
-    else if ((*(p+1) == '-') && (p+2 < ec)) {
-      p+=2;
-      if (uchar(*(p-2)) <= c && c <= uchar(*p))
-        return sig;
-    }
-    else if (uchar(*p) == c) return sig;
-  }
-  return !sig;
-}
-
-
-static int singlematch (int c, const char *p, const char *ep) {
-  switch (*p) {
-    case '.': return 1;  /* matches any char */
-    case L_ESC: return match_class(c, uchar(*(p+1)));
-    case '[': return matchbracketclass(c, p, ep-1);
-    default:  return (uchar(*p) == c);
-  }
-}
-
-
-static const char *match (MatchState *ms, const char *s, const char *p);
-
-
-static const char *matchbalance (MatchState *ms, const char *s,
-                                   const char *p) {
-  if (*p == 0 || *(p+1) == 0)
-    luaL_error(ms->L, "unbalanced pattern");
-  if (*s != *p) return NULL;
-  else {
-    int b = *p;
-    int e = *(p+1);
-    int cont = 1;
-    while (++s < ms->src_end) {
-      if (*s == e) {
-        if (--cont == 0) return s+1;
-      }
-      else if (*s == b) cont++;
-    }
-  }
-  return NULL;  /* string ends out of balance */
-}
-
-
-static const char *max_expand (MatchState *ms, const char *s,
-                                 const char *p, const char *ep) {
-  ptrdiff_t i = 0;  /* counts maximum expand for item */
-  while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep))
-    i++;
-  /* keeps trying to match with the maximum repetitions */
-  while (i>=0) {
-    const char *res = match(ms, (s+i), ep+1);
-    if (res) return res;
-    i--;  /* else didn't match; reduce 1 repetition to try again */
-  }
-  return NULL;
-}
-
-
-static const char *min_expand (MatchState *ms, const char *s,
-                                 const char *p, const char *ep) {
-  for (;;) {
-    const char *res = match(ms, s, ep+1);
-    if (res != NULL)
-      return res;
-    else if (s<ms->src_end && singlematch(uchar(*s), p, ep))
-      s++;  /* try with one more repetition */
-    else return NULL;
-  }
-}
-
-
-static const char *start_capture (MatchState *ms, const char *s,
-                                    const char *p, int what) {
-  const char *res;
-  int level = ms->level;
-  if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures");
-  ms->capture[level].init = s;
-  ms->capture[level].len = what;
-  ms->level = level+1;
-  if ((res=match(ms, s, p)) == NULL)  /* match failed? */
-    ms->level--;  /* undo capture */
-  return res;
-}
-
-
-static const char *end_capture (MatchState *ms, const char *s,
-                                  const char *p) {
-  int l = capture_to_close(ms);
-  const char *res;
-  ms->capture[l].len = s - ms->capture[l].init;  /* close capture */
-  if ((res = match(ms, s, p)) == NULL)  /* match failed? */
-    ms->capture[l].len = CAP_UNFINISHED;  /* undo capture */
-  return res;
-}
-
-
-static const char *match_capture (MatchState *ms, const char *s, int l) {
-  size_t len;
-  l = check_capture(ms, l);
-  len = ms->capture[l].len;
-  if ((size_t)(ms->src_end-s) >= len &&
-      memcmp(ms->capture[l].init, s, len) == 0)
-    return s+len;
-  else return NULL;
-}
-
-
-static const char *match (MatchState *ms, const char *s, const char *p) {
-  init: /* using goto's to optimize tail recursion */
-  switch (*p) {
-    case '(': {  /* start capture */
-      if (*(p+1) == ')')  /* position capture? */
-        return start_capture(ms, s, p+2, CAP_POSITION);
-      else
-        return start_capture(ms, s, p+1, CAP_UNFINISHED);
-    }
-    case ')': {  /* end capture */
-      return end_capture(ms, s, p+1);
-    }
-    case L_ESC: {
-      switch (*(p+1)) {
-        case 'b': {  /* balanced string? */
-          s = matchbalance(ms, s, p+2);
-          if (s == NULL) return NULL;
-          p+=4; goto init;  /* else return match(ms, s, p+4); */
-        }
-        case 'f': {  /* frontier? */
-          const char *ep; char previous;
-          p += 2;
-          if (*p != '[')
-            luaL_error(ms->L, "missing " LUA_QL("[") " after "
-                               LUA_QL("%%f") " in pattern");
-          ep = classend(ms, p);  /* points to what is next */
-          previous = (s == ms->src_init) ? '\0' : *(s-1);
-          if (matchbracketclass(uchar(previous), p, ep-1) ||
-             !matchbracketclass(uchar(*s), p, ep-1)) return NULL;
-          p=ep; goto init;  /* else return match(ms, s, ep); */
-        }
-        default: {
-          if (isdigit(uchar(*(p+1)))) {  /* capture results (%0-%9)? */
-            s = match_capture(ms, s, uchar(*(p+1)));
-            if (s == NULL) return NULL;
-            p+=2; goto init;  /* else return match(ms, s, p+2) */
-          }
-          goto dflt;  /* case default */
-        }
-      }
-    }
-    case '\0': {  /* end of pattern */
-      return s;  /* match succeeded */
-    }
-    case '$': {
-      if (*(p+1) == '\0')  /* is the `$' the last char in pattern? */
-        return (s == ms->src_end) ? s : NULL;  /* check end of string */
-      else goto dflt;
-    }
-    default: dflt: {  /* it is a pattern item */
-      const char *ep = classend(ms, p);  /* points to what is next */
-      int m = s<ms->src_end && singlematch(uchar(*s), p, ep);
-      switch (*ep) {
-        case '?': {  /* optional */
-          const char *res;
-          if (m && ((res=match(ms, s+1, ep+1)) != NULL))
-            return res;
-          p=ep+1; goto init;  /* else return match(ms, s, ep+1); */
-        }
-        case '*': {  /* 0 or more repetitions */
-          return max_expand(ms, s, p, ep);
-        }
-        case '+': {  /* 1 or more repetitions */
-          return (m ? max_expand(ms, s+1, p, ep) : NULL);
-        }
-        case '-': {  /* 0 or more repetitions (minimum) */
-          return min_expand(ms, s, p, ep);
-        }
-        default: {
-          if (!m) return NULL;
-          s++; p=ep; goto init;  /* else return match(ms, s+1, ep); */
-        }
-      }
-    }
-  }
-}
-
-
-
-static const char *lmemfind (const char *s1, size_t l1,
-                               const char *s2, size_t l2) {
-  if (l2 == 0) return s1;  /* empty strings are everywhere */
-  else if (l2 > l1) return NULL;  /* avoids a negative `l1' */
-  else {
-    const char *init;  /* to search for a `*s2' inside `s1' */
-    l2--;  /* 1st char will be checked by `memchr' */
-    l1 = l1-l2;  /* `s2' cannot be found after that */
-    while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) {
-      init++;   /* 1st char is already checked */
-      if (memcmp(init, s2+1, l2) == 0)
-        return init-1;
-      else {  /* correct `l1' and `s1' to try again */
-        l1 -= init-s1;
-        s1 = init;
-      }
-    }
-    return NULL;  /* not found */
-  }
-}
-
-
-static void push_onecapture (MatchState *ms, int i, const char *s,
-                                                    const char *e) {
-  if (i >= ms->level) {
-    if (i == 0)  /* ms->level == 0, too */
-      lua_pushlstring(ms->L, s, e - s);  /* add whole match */
-    else
-      luaL_error(ms->L, "invalid capture index");
-  }
-  else {
-    ptrdiff_t l = ms->capture[i].len;
-    if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture");
-    if (l == CAP_POSITION)
-      lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1);
-    else
-      lua_pushlstring(ms->L, ms->capture[i].init, l);
-  }
-}
-
-
-static int push_captures (MatchState *ms, const char *s, const char *e) {
-  int i;
-  int nlevels = (ms->level == 0 && s) ? 1 : ms->level;
-  luaL_checkstack(ms->L, nlevels, "too many captures");
-  for (i = 0; i < nlevels; i++)
-    push_onecapture(ms, i, s, e);
-  return nlevels;  /* number of strings pushed */
-}
-
-
-static int str_find_aux (lua_State *L, int find) {
-  size_t l1, l2;
-  const char *s = luaL_checklstring(L, 1, &l1);
-  const char *p = luaL_checklstring(L, 2, &l2);
-  ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1;
-  if (init < 0) init = 0;
-  else if ((size_t)(init) > l1) init = (ptrdiff_t)l1;
-  if (find && (lua_toboolean(L, 4) ||  /* explicit request? */
-      strpbrk(p, SPECIALS) == NULL)) {  /* or no special characters? */
-    /* do a plain search */
-    const char *s2 = lmemfind(s+init, l1-init, p, l2);
-    if (s2) {
-      lua_pushinteger(L, s2-s+1);
-      lua_pushinteger(L, s2-s+l2);
-      return 2;
-    }
-  }
-  else {
-    MatchState ms;
-    int anchor = (*p == '^') ? (p++, 1) : 0;
-    const char *s1=s+init;
-    ms.L = L;
-    ms.src_init = s;
-    ms.src_end = s+l1;
-    do {
-      const char *res;
-      ms.level = 0;
-      if ((res=match(&ms, s1, p)) != NULL) {
-        if (find) {
-          lua_pushinteger(L, s1-s+1);  /* start */
-          lua_pushinteger(L, res-s);   /* end */
-          return push_captures(&ms, NULL, 0) + 2;
-        }
-        else
-          return push_captures(&ms, s1, res);
-      }
-    } while (s1++ < ms.src_end && !anchor);
-  }
-  lua_pushnil(L);  /* not found */
-  return 1;
-}
-
-
-static int str_find (lua_State *L) {
-  return str_find_aux(L, 1);
-}
-
-
-static int str_match (lua_State *L) {
-  return str_find_aux(L, 0);
-}
-
-
-static int gmatch_aux (lua_State *L) {
-  MatchState ms;
-  size_t ls;
-  const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls);
-  const char *p = lua_tostring(L, lua_upvalueindex(2));
-  const char *src;
-  ms.L = L;
-  ms.src_init = s;
-  ms.src_end = s+ls;
-  for (src = s + (size_t)lua_tointeger(L, lua_upvalueindex(3));
-       src <= ms.src_end;
-       src++) {
-    const char *e;
-    ms.level = 0;
-    if ((e = match(&ms, src, p)) != NULL) {
-      lua_Integer newstart = e-s;
-      if (e == src) newstart++;  /* empty match? go at least one position */
-      lua_pushinteger(L, newstart);
-      lua_replace(L, lua_upvalueindex(3));
-      return push_captures(&ms, src, e);
-    }
-  }
-  return 0;  /* not found */
-}
-
-
-static int gmatch (lua_State *L) {
-  luaL_checkstring(L, 1);
-  luaL_checkstring(L, 2);
-  lua_settop(L, 2);
-  lua_pushinteger(L, 0);
-  lua_pushcclosure(L, gmatch_aux, 3);
-  return 1;
-}
-
-
-static int gfind_nodef (lua_State *L) {
-  return luaL_error(L, LUA_QL("string.gfind") " was renamed to "
-                       LUA_QL("string.gmatch"));
-}
-
-
-static void add_s (MatchState *ms, luaL_Buffer *b, const char *s,
-                                                   const char *e) {
-  size_t l, i;
-  const char *news = lua_tolstring(ms->L, 3, &l);
-  for (i = 0; i < l; i++) {
-    if (news[i] != L_ESC)
-      luaL_addchar(b, news[i]);
-    else {
-      i++;  /* skip ESC */
-      if (!isdigit(uchar(news[i])))
-        luaL_addchar(b, news[i]);
-      else if (news[i] == '0')
-          luaL_addlstring(b, s, e - s);
-      else {
-        push_onecapture(ms, news[i] - '1', s, e);
-        luaL_addvalue(b);  /* add capture to accumulated result */
-      }
-    }
-  }
-}
-
-
-static void add_value (MatchState *ms, luaL_Buffer *b, const char *s,
-                                                       const char *e) {
-  lua_State *L = ms->L;
-  switch (lua_type(L, 3)) {
-    case LUA_TNUMBER:
-    case LUA_TSTRING: {
-      add_s(ms, b, s, e);
-      return;
-    }
-    case LUA_TFUNCTION: {
-      int n;
-      lua_pushvalue(L, 3);
-      n = push_captures(ms, s, e);
-      lua_call(L, n, 1);
-      break;
-    }
-    case LUA_TTABLE: {
-      push_onecapture(ms, 0, s, e);
-      lua_gettable(L, 3);
-      break;
-    }
-  }
-  if (!lua_toboolean(L, -1)) {  /* nil or false? */
-    lua_pop(L, 1);
-    lua_pushlstring(L, s, e - s);  /* keep original text */
-  }
-  else if (!lua_isstring(L, -1))
-    luaL_error(L, "invalid replacement value (a %s)", luaL_typename(L, -1)); 
-  luaL_addvalue(b);  /* add result to accumulator */
-}
-
-
-static int str_gsub (lua_State *L) {
-  size_t srcl;
-  const char *src = luaL_checklstring(L, 1, &srcl);
-  const char *p = luaL_checkstring(L, 2);
-  int  tr = lua_type(L, 3);
-  int max_s = luaL_optint(L, 4, srcl+1);
-  int anchor = (*p == '^') ? (p++, 1) : 0;
-  int n = 0;
-  MatchState ms;
-  luaL_Buffer b;
-  luaL_argcheck(L, tr == LUA_TNUMBER || tr == LUA_TSTRING ||
-                   tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3,
-                      "string/function/table expected");
-  luaL_buffinit(L, &b);
-  ms.L = L;
-  ms.src_init = src;
-  ms.src_end = src+srcl;
-  while (n < max_s) {
-    const char *e;
-    ms.level = 0;
-    e = match(&ms, src, p);
-    if (e) {
-      n++;
-      add_value(&ms, &b, src, e);
-    }
-    if (e && e>src) /* non empty match? */
-      src = e;  /* skip it */
-    else if (src < ms.src_end)
-      luaL_addchar(&b, *src++);
-    else break;
-    if (anchor) break;
-  }
-  luaL_addlstring(&b, src, ms.src_end-src);
-  luaL_pushresult(&b);
-  lua_pushinteger(L, n);  /* number of substitutions */
-  return 2;
-}
-
-/* }====================================================== */
-
-
-/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */
-#define MAX_ITEM	512
-/* valid flags in a format specification */
-#define FLAGS	"-+ #0"
-/*
-** maximum size of each format specification (such as '%-099.99d')
-** (+10 accounts for %99.99x plus margin of error)
-*/
-#define MAX_FORMAT	(sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10)
-
-
-static void addquoted (lua_State *L, luaL_Buffer *b, int arg) {
-  size_t l;
-  const char *s = luaL_checklstring(L, arg, &l);
-  luaL_addchar(b, '"');
-  while (l--) {
-    switch (*s) {
-      case '"': case '\\': case '\n': {
-        luaL_addchar(b, '\\');
-        luaL_addchar(b, *s);
-        break;
-      }
-      case '\r': {
-        luaL_addlstring(b, "\\r", 2);
-        break;
-      }
-      case '\0': {
-        luaL_addlstring(b, "\\000", 4);
-        break;
-      }
-      default: {
-        luaL_addchar(b, *s);
-        break;
-      }
-    }
-    s++;
-  }
-  luaL_addchar(b, '"');
-}
-
-static const char *scanformat (lua_State *L, const char *strfrmt, char *form) {
-  const char *p = strfrmt;
-  while (*p != '\0' && strchr(FLAGS, *p) != NULL) p++;  /* skip flags */
-  if ((size_t)(p - strfrmt) >= sizeof(FLAGS))
-    luaL_error(L, "invalid format (repeated flags)");
-  if (isdigit(uchar(*p))) p++;  /* skip width */
-  if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */
-  if (*p == '.') {
-    p++;
-    if (isdigit(uchar(*p))) p++;  /* skip precision */
-    if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */
-  }
-  if (isdigit(uchar(*p)))
-    luaL_error(L, "invalid format (width or precision too long)");
-  *(form++) = '%';
-  strncpy(form, strfrmt, p - strfrmt + 1);
-  form += p - strfrmt + 1;
-  *form = '\0';
-  return p;
-}
-
-
-static void addintlen (char *form) {
-  size_t l = strlen(form);
-  char spec = form[l - 1];
-  strcpy(form + l - 1, LUA_INTFRMLEN);
-  form[l + sizeof(LUA_INTFRMLEN) - 2] = spec;
-  form[l + sizeof(LUA_INTFRMLEN) - 1] = '\0';
-}
-
-
-static int str_format (lua_State *L) {
-  int top = lua_gettop(L);
-  int arg = 1;
-  size_t sfl;
-  const char *strfrmt = luaL_checklstring(L, arg, &sfl);
-  const char *strfrmt_end = strfrmt+sfl;
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  while (strfrmt < strfrmt_end) {
-    if (*strfrmt != L_ESC)
-      luaL_addchar(&b, *strfrmt++);
-    else if (*++strfrmt == L_ESC)
-      luaL_addchar(&b, *strfrmt++);  /* %% */
-    else { /* format item */
-      char form[MAX_FORMAT];  /* to store the format (`%...') */
-      char buff[MAX_ITEM];  /* to store the formatted item */
-      if (++arg > top)
-        luaL_argerror(L, arg, "no value");
-      strfrmt = scanformat(L, strfrmt, form);
-      switch (*strfrmt++) {
-        case 'c': {
-          sprintf(buff, form, (int)luaL_checknumber(L, arg));
-          break;
-        }
-        case 'd':  case 'i': {
-          addintlen(form);
-          sprintf(buff, form, (LUA_INTFRM_T)luaL_checknumber(L, arg));
-          break;
-        }
-        case 'o':  case 'u':  case 'x':  case 'X': {
-          addintlen(form);
-          sprintf(buff, form, (unsigned LUA_INTFRM_T)luaL_checknumber(L, arg));
-          break;
-        }
-        case 'e':  case 'E': case 'f':
-        case 'g': case 'G': {
-          sprintf(buff, form, (double)luaL_checknumber(L, arg));
-          break;
-        }
-        case 'q': {
-          addquoted(L, &b, arg);
-          continue;  /* skip the 'addsize' at the end */
-        }
-        case 's': {
-          size_t l;
-          const char *s = luaL_checklstring(L, arg, &l);
-          if (!strchr(form, '.') && l >= 100) {
-            /* no precision and string is too long to be formatted;
-               keep original string */
-            lua_pushvalue(L, arg);
-            luaL_addvalue(&b);
-            continue;  /* skip the `addsize' at the end */
-          }
-          else {
-            sprintf(buff, form, s);
-            break;
-          }
-        }
-        default: {  /* also treat cases `pnLlh' */
-          return luaL_error(L, "invalid option " LUA_QL("%%%c") " to "
-                               LUA_QL("format"), *(strfrmt - 1));
-        }
-      }
-      luaL_addlstring(&b, buff, strlen(buff));
-    }
-  }
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static const luaL_Reg strlib[] = {
-  {"byte", str_byte},
-  {"char", str_char},
-  {"dump", str_dump},
-  {"find", str_find},
-  {"format", str_format},
-  {"gfind", gfind_nodef},
-  {"gmatch", gmatch},
-  {"gsub", str_gsub},
-  {"len", str_len},
-  {"lower", str_lower},
-  {"match", str_match},
-  {"rep", str_rep},
-  {"reverse", str_reverse},
-  {"sub", str_sub},
-  {"upper", str_upper},
-  {NULL, NULL}
-};
-
-
-static void createmetatable (lua_State *L) {
-  lua_createtable(L, 0, 1);  /* create metatable for strings */
-  lua_pushliteral(L, "");  /* dummy string */
-  lua_pushvalue(L, -2);
-  lua_setmetatable(L, -2);  /* set string metatable */
-  lua_pop(L, 1);  /* pop dummy string */
-  lua_pushvalue(L, -2);  /* string library... */
-  lua_setfield(L, -2, "__index");  /* ...is the __index metamethod */
-  lua_pop(L, 1);  /* pop metatable */
-}
-
-
-/*
-** Open string library
-*/
-LUALIB_API int luaopen_string (lua_State *L) {
-  luaL_register(L, LUA_STRLIBNAME, strlib);
-#if defined(LUA_COMPAT_GFIND)
-  lua_getfield(L, -1, "gmatch");
-  lua_setfield(L, -2, "gfind");
-#endif
-  createmetatable(L);
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/ltable.c b/redis-stable/deps/lua/src/ltable.c
deleted file mode 100644
index ec84f4fa..00000000
--- a/redis-stable/deps/lua/src/ltable.c
+++ /dev/null
@@ -1,588 +0,0 @@
-/*
-** $Id: ltable.c,v 2.32.1.2 2007/12/28 15:32:23 roberto Exp $
-** Lua tables (hash)
-** See Copyright Notice in lua.h
-*/
-
-
-/*
-** Implementation of tables (aka arrays, objects, or hash tables).
-** Tables keep its elements in two parts: an array part and a hash part.
-** Non-negative integer keys are all candidates to be kept in the array
-** part. The actual size of the array is the largest `n' such that at
-** least half the slots between 0 and n are in use.
-** Hash uses a mix of chained scatter table with Brent's variation.
-** A main invariant of these tables is that, if an element is not
-** in its main position (i.e. the `original' position that its hash gives
-** to it), then the colliding element is in its own main position.
-** Hence even when the load factor reaches 100%, performance remains good.
-*/
-
-#include <math.h>
-#include <string.h>
-
-#define ltable_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lgc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstate.h"
-#include "ltable.h"
-
-
-/*
-** max size of array part is 2^MAXBITS
-*/
-#if LUAI_BITSINT > 26
-#define MAXBITS		26
-#else
-#define MAXBITS		(LUAI_BITSINT-2)
-#endif
-
-#define MAXASIZE	(1 << MAXBITS)
-
-
-#define hashpow2(t,n)      (gnode(t, lmod((n), sizenode(t))))
-  
-#define hashstr(t,str)  hashpow2(t, (str)->tsv.hash)
-#define hashboolean(t,p)        hashpow2(t, p)
-
-
-/*
-** for some types, it is better to avoid modulus by power of 2, as
-** they tend to have many 2 factors.
-*/
-#define hashmod(t,n)	(gnode(t, ((n) % ((sizenode(t)-1)|1))))
-
-
-#define hashpointer(t,p)	hashmod(t, IntPoint(p))
-
-
-/*
-** number of ints inside a lua_Number
-*/
-#define numints		cast_int(sizeof(lua_Number)/sizeof(int))
-
-
-
-#define dummynode		(&dummynode_)
-
-static const Node dummynode_ = {
-  {{NULL}, LUA_TNIL},  /* value */
-  {{{NULL}, LUA_TNIL, NULL}}  /* key */
-};
-
-
-/*
-** hash for lua_Numbers
-*/
-static Node *hashnum (const Table *t, lua_Number n) {
-  unsigned int a[numints];
-  int i;
-  if (luai_numeq(n, 0))  /* avoid problems with -0 */
-    return gnode(t, 0);
-  memcpy(a, &n, sizeof(a));
-  for (i = 1; i < numints; i++) a[0] += a[i];
-  return hashmod(t, a[0]);
-}
-
-
-
-/*
-** returns the `main' position of an element in a table (that is, the index
-** of its hash value)
-*/
-static Node *mainposition (const Table *t, const TValue *key) {
-  switch (ttype(key)) {
-    case LUA_TNUMBER:
-      return hashnum(t, nvalue(key));
-    case LUA_TSTRING:
-      return hashstr(t, rawtsvalue(key));
-    case LUA_TBOOLEAN:
-      return hashboolean(t, bvalue(key));
-    case LUA_TLIGHTUSERDATA:
-      return hashpointer(t, pvalue(key));
-    default:
-      return hashpointer(t, gcvalue(key));
-  }
-}
-
-
-/*
-** returns the index for `key' if `key' is an appropriate key to live in
-** the array part of the table, -1 otherwise.
-*/
-static int arrayindex (const TValue *key) {
-  if (ttisnumber(key)) {
-    lua_Number n = nvalue(key);
-    int k;
-    lua_number2int(k, n);
-    if (luai_numeq(cast_num(k), n))
-      return k;
-  }
-  return -1;  /* `key' did not match some condition */
-}
-
-
-/*
-** returns the index of a `key' for table traversals. First goes all
-** elements in the array part, then elements in the hash part. The
-** beginning of a traversal is signalled by -1.
-*/
-static int findindex (lua_State *L, Table *t, StkId key) {
-  int i;
-  if (ttisnil(key)) return -1;  /* first iteration */
-  i = arrayindex(key);
-  if (0 < i && i <= t->sizearray)  /* is `key' inside array part? */
-    return i-1;  /* yes; that's the index (corrected to C) */
-  else {
-    Node *n = mainposition(t, key);
-    do {  /* check whether `key' is somewhere in the chain */
-      /* key may be dead already, but it is ok to use it in `next' */
-      if (luaO_rawequalObj(key2tval(n), key) ||
-            (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) &&
-             gcvalue(gkey(n)) == gcvalue(key))) {
-        i = cast_int(n - gnode(t, 0));  /* key index in hash table */
-        /* hash elements are numbered after array ones */
-        return i + t->sizearray;
-      }
-      else n = gnext(n);
-    } while (n);
-    luaG_runerror(L, "invalid key to " LUA_QL("next"));  /* key not found */
-    return 0;  /* to avoid warnings */
-  }
-}
-
-
-int luaH_next (lua_State *L, Table *t, StkId key) {
-  int i = findindex(L, t, key);  /* find original element */
-  for (i++; i < t->sizearray; i++) {  /* try first array part */
-    if (!ttisnil(&t->array[i])) {  /* a non-nil value? */
-      setnvalue(key, cast_num(i+1));
-      setobj2s(L, key+1, &t->array[i]);
-      return 1;
-    }
-  }
-  for (i -= t->sizearray; i < sizenode(t); i++) {  /* then hash part */
-    if (!ttisnil(gval(gnode(t, i)))) {  /* a non-nil value? */
-      setobj2s(L, key, key2tval(gnode(t, i)));
-      setobj2s(L, key+1, gval(gnode(t, i)));
-      return 1;
-    }
-  }
-  return 0;  /* no more elements */
-}
-
-
-/*
-** {=============================================================
-** Rehash
-** ==============================================================
-*/
-
-
-static int computesizes (int nums[], int *narray) {
-  int i;
-  int twotoi;  /* 2^i */
-  int a = 0;  /* number of elements smaller than 2^i */
-  int na = 0;  /* number of elements to go to array part */
-  int n = 0;  /* optimal size for array part */
-  for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {
-    if (nums[i] > 0) {
-      a += nums[i];
-      if (a > twotoi/2) {  /* more than half elements present? */
-        n = twotoi;  /* optimal size (till now) */
-        na = a;  /* all elements smaller than n will go to array part */
-      }
-    }
-    if (a == *narray) break;  /* all elements already counted */
-  }
-  *narray = n;
-  lua_assert(*narray/2 <= na && na <= *narray);
-  return na;
-}
-
-
-static int countint (const TValue *key, int *nums) {
-  int k = arrayindex(key);
-  if (0 < k && k <= MAXASIZE) {  /* is `key' an appropriate array index? */
-    nums[ceillog2(k)]++;  /* count as such */
-    return 1;
-  }
-  else
-    return 0;
-}
-
-
-static int numusearray (const Table *t, int *nums) {
-  int lg;
-  int ttlg;  /* 2^lg */
-  int ause = 0;  /* summation of `nums' */
-  int i = 1;  /* count to traverse all array keys */
-  for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) {  /* for each slice */
-    int lc = 0;  /* counter */
-    int lim = ttlg;
-    if (lim > t->sizearray) {
-      lim = t->sizearray;  /* adjust upper limit */
-      if (i > lim)
-        break;  /* no more elements to count */
-    }
-    /* count elements in range (2^(lg-1), 2^lg] */
-    for (; i <= lim; i++) {
-      if (!ttisnil(&t->array[i-1]))
-        lc++;
-    }
-    nums[lg] += lc;
-    ause += lc;
-  }
-  return ause;
-}
-
-
-static int numusehash (const Table *t, int *nums, int *pnasize) {
-  int totaluse = 0;  /* total number of elements */
-  int ause = 0;  /* summation of `nums' */
-  int i = sizenode(t);
-  while (i--) {
-    Node *n = &t->node[i];
-    if (!ttisnil(gval(n))) {
-      ause += countint(key2tval(n), nums);
-      totaluse++;
-    }
-  }
-  *pnasize += ause;
-  return totaluse;
-}
-
-
-static void setarrayvector (lua_State *L, Table *t, int size) {
-  int i;
-  luaM_reallocvector(L, t->array, t->sizearray, size, TValue);
-  for (i=t->sizearray; i<size; i++)
-     setnilvalue(&t->array[i]);
-  t->sizearray = size;
-}
-
-
-static void setnodevector (lua_State *L, Table *t, int size) {
-  int lsize;
-  if (size == 0) {  /* no elements to hash part? */
-    t->node = cast(Node *, dummynode);  /* use common `dummynode' */
-    lsize = 0;
-  }
-  else {
-    int i;
-    lsize = ceillog2(size);
-    if (lsize > MAXBITS)
-      luaG_runerror(L, "table overflow");
-    size = twoto(lsize);
-    t->node = luaM_newvector(L, size, Node);
-    for (i=0; i<size; i++) {
-      Node *n = gnode(t, i);
-      gnext(n) = NULL;
-      setnilvalue(gkey(n));
-      setnilvalue(gval(n));
-    }
-  }
-  t->lsizenode = cast_byte(lsize);
-  t->lastfree = gnode(t, size);  /* all positions are free */
-}
-
-
-static void resize (lua_State *L, Table *t, int nasize, int nhsize) {
-  int i;
-  int oldasize = t->sizearray;
-  int oldhsize = t->lsizenode;
-  Node *nold = t->node;  /* save old hash ... */
-  if (nasize > oldasize)  /* array part must grow? */
-    setarrayvector(L, t, nasize);
-  /* create new hash part with appropriate size */
-  setnodevector(L, t, nhsize);  
-  if (nasize < oldasize) {  /* array part must shrink? */
-    t->sizearray = nasize;
-    /* re-insert elements from vanishing slice */
-    for (i=nasize; i<oldasize; i++) {
-      if (!ttisnil(&t->array[i]))
-        setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);
-    }
-    /* shrink array */
-    luaM_reallocvector(L, t->array, oldasize, nasize, TValue);
-  }
-  /* re-insert elements from hash part */
-  for (i = twoto(oldhsize) - 1; i >= 0; i--) {
-    Node *old = nold+i;
-    if (!ttisnil(gval(old)))
-      setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old));
-  }
-  if (nold != dummynode)
-    luaM_freearray(L, nold, twoto(oldhsize), Node);  /* free old array */
-}
-
-
-void luaH_resizearray (lua_State *L, Table *t, int nasize) {
-  int nsize = (t->node == dummynode) ? 0 : sizenode(t);
-  resize(L, t, nasize, nsize);
-}
-
-
-static void rehash (lua_State *L, Table *t, const TValue *ek) {
-  int nasize, na;
-  int nums[MAXBITS+1];  /* nums[i] = number of keys between 2^(i-1) and 2^i */
-  int i;
-  int totaluse;
-  for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */
-  nasize = numusearray(t, nums);  /* count keys in array part */
-  totaluse = nasize;  /* all those keys are integer keys */
-  totaluse += numusehash(t, nums, &nasize);  /* count keys in hash part */
-  /* count extra key */
-  nasize += countint(ek, nums);
-  totaluse++;
-  /* compute new size for array part */
-  na = computesizes(nums, &nasize);
-  /* resize the table to new computed sizes */
-  resize(L, t, nasize, totaluse - na);
-}
-
-
-
-/*
-** }=============================================================
-*/
-
-
-Table *luaH_new (lua_State *L, int narray, int nhash) {
-  Table *t = luaM_new(L, Table);
-  luaC_link(L, obj2gco(t), LUA_TTABLE);
-  t->metatable = NULL;
-  t->flags = cast_byte(~0);
-  /* temporary values (kept only if some malloc fails) */
-  t->array = NULL;
-  t->sizearray = 0;
-  t->lsizenode = 0;
-  t->node = cast(Node *, dummynode);
-  setarrayvector(L, t, narray);
-  setnodevector(L, t, nhash);
-  return t;
-}
-
-
-void luaH_free (lua_State *L, Table *t) {
-  if (t->node != dummynode)
-    luaM_freearray(L, t->node, sizenode(t), Node);
-  luaM_freearray(L, t->array, t->sizearray, TValue);
-  luaM_free(L, t);
-}
-
-
-static Node *getfreepos (Table *t) {
-  while (t->lastfree-- > t->node) {
-    if (ttisnil(gkey(t->lastfree)))
-      return t->lastfree;
-  }
-  return NULL;  /* could not find a free place */
-}
-
-
-
-/*
-** inserts a new key into a hash table; first, check whether key's main 
-** position is free. If not, check whether colliding node is in its main 
-** position or not: if it is not, move colliding node to an empty place and 
-** put new key in its main position; otherwise (colliding node is in its main 
-** position), new key goes to an empty position. 
-*/
-static TValue *newkey (lua_State *L, Table *t, const TValue *key) {
-  Node *mp = mainposition(t, key);
-  if (!ttisnil(gval(mp)) || mp == dummynode) {
-    Node *othern;
-    Node *n = getfreepos(t);  /* get a free place */
-    if (n == NULL) {  /* cannot find a free place? */
-      rehash(L, t, key);  /* grow table */
-      return luaH_set(L, t, key);  /* re-insert key into grown table */
-    }
-    lua_assert(n != dummynode);
-    othern = mainposition(t, key2tval(mp));
-    if (othern != mp) {  /* is colliding node out of its main position? */
-      /* yes; move colliding node into free position */
-      while (gnext(othern) != mp) othern = gnext(othern);  /* find previous */
-      gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */
-      *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */
-      gnext(mp) = NULL;  /* now `mp' is free */
-      setnilvalue(gval(mp));
-    }
-    else {  /* colliding node is in its own main position */
-      /* new node will go into free position */
-      gnext(n) = gnext(mp);  /* chain new position */
-      gnext(mp) = n;
-      mp = n;
-    }
-  }
-  gkey(mp)->value = key->value; gkey(mp)->tt = key->tt;
-  luaC_barriert(L, t, key);
-  lua_assert(ttisnil(gval(mp)));
-  return gval(mp);
-}
-
-
-/*
-** search function for integers
-*/
-const TValue *luaH_getnum (Table *t, int key) {
-  /* (1 <= key && key <= t->sizearray) */
-  if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))
-    return &t->array[key-1];
-  else {
-    lua_Number nk = cast_num(key);
-    Node *n = hashnum(t, nk);
-    do {  /* check whether `key' is somewhere in the chain */
-      if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))
-        return gval(n);  /* that's it */
-      else n = gnext(n);
-    } while (n);
-    return luaO_nilobject;
-  }
-}
-
-
-/*
-** search function for strings
-*/
-const TValue *luaH_getstr (Table *t, TString *key) {
-  Node *n = hashstr(t, key);
-  do {  /* check whether `key' is somewhere in the chain */
-    if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)
-      return gval(n);  /* that's it */
-    else n = gnext(n);
-  } while (n);
-  return luaO_nilobject;
-}
-
-
-/*
-** main search function
-*/
-const TValue *luaH_get (Table *t, const TValue *key) {
-  switch (ttype(key)) {
-    case LUA_TNIL: return luaO_nilobject;
-    case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key));
-    case LUA_TNUMBER: {
-      int k;
-      lua_Number n = nvalue(key);
-      lua_number2int(k, n);
-      if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */
-        return luaH_getnum(t, k);  /* use specialized version */
-      /* else go through */
-    }
-    default: {
-      Node *n = mainposition(t, key);
-      do {  /* check whether `key' is somewhere in the chain */
-        if (luaO_rawequalObj(key2tval(n), key))
-          return gval(n);  /* that's it */
-        else n = gnext(n);
-      } while (n);
-      return luaO_nilobject;
-    }
-  }
-}
-
-
-TValue *luaH_set (lua_State *L, Table *t, const TValue *key) {
-  const TValue *p = luaH_get(t, key);
-  t->flags = 0;
-  if (p != luaO_nilobject)
-    return cast(TValue *, p);
-  else {
-    if (ttisnil(key)) luaG_runerror(L, "table index is nil");
-    else if (ttisnumber(key) && luai_numisnan(nvalue(key)))
-      luaG_runerror(L, "table index is NaN");
-    return newkey(L, t, key);
-  }
-}
-
-
-TValue *luaH_setnum (lua_State *L, Table *t, int key) {
-  const TValue *p = luaH_getnum(t, key);
-  if (p != luaO_nilobject)
-    return cast(TValue *, p);
-  else {
-    TValue k;
-    setnvalue(&k, cast_num(key));
-    return newkey(L, t, &k);
-  }
-}
-
-
-TValue *luaH_setstr (lua_State *L, Table *t, TString *key) {
-  const TValue *p = luaH_getstr(t, key);
-  if (p != luaO_nilobject)
-    return cast(TValue *, p);
-  else {
-    TValue k;
-    setsvalue(L, &k, key);
-    return newkey(L, t, &k);
-  }
-}
-
-
-static int unbound_search (Table *t, unsigned int j) {
-  unsigned int i = j;  /* i is zero or a present index */
-  j++;
-  /* find `i' and `j' such that i is present and j is not */
-  while (!ttisnil(luaH_getnum(t, j))) {
-    i = j;
-    j *= 2;
-    if (j > cast(unsigned int, MAX_INT)) {  /* overflow? */
-      /* table was built with bad purposes: resort to linear search */
-      i = 1;
-      while (!ttisnil(luaH_getnum(t, i))) i++;
-      return i - 1;
-    }
-  }
-  /* now do a binary search between them */
-  while (j - i > 1) {
-    unsigned int m = (i+j)/2;
-    if (ttisnil(luaH_getnum(t, m))) j = m;
-    else i = m;
-  }
-  return i;
-}
-
-
-/*
-** Try to find a boundary in table `t'. A `boundary' is an integer index
-** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).
-*/
-int luaH_getn (Table *t) {
-  unsigned int j = t->sizearray;
-  if (j > 0 && ttisnil(&t->array[j - 1])) {
-    /* there is a boundary in the array part: (binary) search for it */
-    unsigned int i = 0;
-    while (j - i > 1) {
-      unsigned int m = (i+j)/2;
-      if (ttisnil(&t->array[m - 1])) j = m;
-      else i = m;
-    }
-    return i;
-  }
-  /* else must find a boundary in hash part */
-  else if (t->node == dummynode)  /* hash part is empty? */
-    return j;  /* that is easy... */
-  else return unbound_search(t, j);
-}
-
-
-
-#if defined(LUA_DEBUG)
-
-Node *luaH_mainposition (const Table *t, const TValue *key) {
-  return mainposition(t, key);
-}
-
-int luaH_isdummy (Node *n) { return n == dummynode; }
-
-#endif
diff --git a/redis-stable/deps/lua/src/ltable.h b/redis-stable/deps/lua/src/ltable.h
deleted file mode 100644
index f5b9d5ea..00000000
--- a/redis-stable/deps/lua/src/ltable.h
+++ /dev/null
@@ -1,40 +0,0 @@
-/*
-** $Id: ltable.h,v 2.10.1.1 2007/12/27 13:02:25 roberto Exp $
-** Lua tables (hash)
-** See Copyright Notice in lua.h
-*/
-
-#ifndef ltable_h
-#define ltable_h
-
-#include "lobject.h"
-
-
-#define gnode(t,i)	(&(t)->node[i])
-#define gkey(n)		(&(n)->i_key.nk)
-#define gval(n)		(&(n)->i_val)
-#define gnext(n)	((n)->i_key.nk.next)
-
-#define key2tval(n)	(&(n)->i_key.tvk)
-
-
-LUAI_FUNC const TValue *luaH_getnum (Table *t, int key);
-LUAI_FUNC TValue *luaH_setnum (lua_State *L, Table *t, int key);
-LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);
-LUAI_FUNC TValue *luaH_setstr (lua_State *L, Table *t, TString *key);
-LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key);
-LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key);
-LUAI_FUNC Table *luaH_new (lua_State *L, int narray, int lnhash);
-LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize);
-LUAI_FUNC void luaH_free (lua_State *L, Table *t);
-LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);
-LUAI_FUNC int luaH_getn (Table *t);
-
-
-#if defined(LUA_DEBUG)
-LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
-LUAI_FUNC int luaH_isdummy (Node *n);
-#endif
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/ltablib.c b/redis-stable/deps/lua/src/ltablib.c
deleted file mode 100644
index 0bdac7f6..00000000
--- a/redis-stable/deps/lua/src/ltablib.c
+++ /dev/null
@@ -1,287 +0,0 @@
-/*
-** $Id: ltablib.c,v 1.38.1.3 2008/02/14 16:46:58 roberto Exp $
-** Library for Table Manipulation
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stddef.h>
-
-#define ltablib_c
-#define LUA_LIB
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-#define aux_getn(L,n)	(luaL_checktype(L, n, LUA_TTABLE), luaL_getn(L, n))
-
-
-static int foreachi (lua_State *L) {
-  int i;
-  int n = aux_getn(L, 1);
-  luaL_checktype(L, 2, LUA_TFUNCTION);
-  for (i=1; i <= n; i++) {
-    lua_pushvalue(L, 2);  /* function */
-    lua_pushinteger(L, i);  /* 1st argument */
-    lua_rawgeti(L, 1, i);  /* 2nd argument */
-    lua_call(L, 2, 1);
-    if (!lua_isnil(L, -1))
-      return 1;
-    lua_pop(L, 1);  /* remove nil result */
-  }
-  return 0;
-}
-
-
-static int foreach (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-  luaL_checktype(L, 2, LUA_TFUNCTION);
-  lua_pushnil(L);  /* first key */
-  while (lua_next(L, 1)) {
-    lua_pushvalue(L, 2);  /* function */
-    lua_pushvalue(L, -3);  /* key */
-    lua_pushvalue(L, -3);  /* value */
-    lua_call(L, 2, 1);
-    if (!lua_isnil(L, -1))
-      return 1;
-    lua_pop(L, 2);  /* remove value and result */
-  }
-  return 0;
-}
-
-
-static int maxn (lua_State *L) {
-  lua_Number max = 0;
-  luaL_checktype(L, 1, LUA_TTABLE);
-  lua_pushnil(L);  /* first key */
-  while (lua_next(L, 1)) {
-    lua_pop(L, 1);  /* remove value */
-    if (lua_type(L, -1) == LUA_TNUMBER) {
-      lua_Number v = lua_tonumber(L, -1);
-      if (v > max) max = v;
-    }
-  }
-  lua_pushnumber(L, max);
-  return 1;
-}
-
-
-static int getn (lua_State *L) {
-  lua_pushinteger(L, aux_getn(L, 1));
-  return 1;
-}
-
-
-static int setn (lua_State *L) {
-  luaL_checktype(L, 1, LUA_TTABLE);
-#ifndef luaL_setn
-  luaL_setn(L, 1, luaL_checkint(L, 2));
-#else
-  luaL_error(L, LUA_QL("setn") " is obsolete");
-#endif
-  lua_pushvalue(L, 1);
-  return 1;
-}
-
-
-static int tinsert (lua_State *L) {
-  int e = aux_getn(L, 1) + 1;  /* first empty element */
-  int pos;  /* where to insert new element */
-  switch (lua_gettop(L)) {
-    case 2: {  /* called with only 2 arguments */
-      pos = e;  /* insert new element at the end */
-      break;
-    }
-    case 3: {
-      int i;
-      pos = luaL_checkint(L, 2);  /* 2nd argument is the position */
-      if (pos > e) e = pos;  /* `grow' array if necessary */
-      for (i = e; i > pos; i--) {  /* move up elements */
-        lua_rawgeti(L, 1, i-1);
-        lua_rawseti(L, 1, i);  /* t[i] = t[i-1] */
-      }
-      break;
-    }
-    default: {
-      return luaL_error(L, "wrong number of arguments to " LUA_QL("insert"));
-    }
-  }
-  luaL_setn(L, 1, e);  /* new size */
-  lua_rawseti(L, 1, pos);  /* t[pos] = v */
-  return 0;
-}
-
-
-static int tremove (lua_State *L) {
-  int e = aux_getn(L, 1);
-  int pos = luaL_optint(L, 2, e);
-  if (!(1 <= pos && pos <= e))  /* position is outside bounds? */
-   return 0;  /* nothing to remove */
-  luaL_setn(L, 1, e - 1);  /* t.n = n-1 */
-  lua_rawgeti(L, 1, pos);  /* result = t[pos] */
-  for ( ;pos<e; pos++) {
-    lua_rawgeti(L, 1, pos+1);
-    lua_rawseti(L, 1, pos);  /* t[pos] = t[pos+1] */
-  }
-  lua_pushnil(L);
-  lua_rawseti(L, 1, e);  /* t[e] = nil */
-  return 1;
-}
-
-
-static void addfield (lua_State *L, luaL_Buffer *b, int i) {
-  lua_rawgeti(L, 1, i);
-  if (!lua_isstring(L, -1))
-    luaL_error(L, "invalid value (%s) at index %d in table for "
-                  LUA_QL("concat"), luaL_typename(L, -1), i);
-  luaL_addvalue(b);
-}
-
-
-static int tconcat (lua_State *L) {
-  luaL_Buffer b;
-  size_t lsep;
-  int i, last;
-  const char *sep = luaL_optlstring(L, 2, "", &lsep);
-  luaL_checktype(L, 1, LUA_TTABLE);
-  i = luaL_optint(L, 3, 1);
-  last = luaL_opt(L, luaL_checkint, 4, luaL_getn(L, 1));
-  luaL_buffinit(L, &b);
-  for (; i < last; i++) {
-    addfield(L, &b, i);
-    luaL_addlstring(&b, sep, lsep);
-  }
-  if (i == last)  /* add last value (if interval was not empty) */
-    addfield(L, &b, i);
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-
-/*
-** {======================================================
-** Quicksort
-** (based on `Algorithms in MODULA-3', Robert Sedgewick;
-**  Addison-Wesley, 1993.)
-*/
-
-
-static void set2 (lua_State *L, int i, int j) {
-  lua_rawseti(L, 1, i);
-  lua_rawseti(L, 1, j);
-}
-
-static int sort_comp (lua_State *L, int a, int b) {
-  if (!lua_isnil(L, 2)) {  /* function? */
-    int res;
-    lua_pushvalue(L, 2);
-    lua_pushvalue(L, a-1);  /* -1 to compensate function */
-    lua_pushvalue(L, b-2);  /* -2 to compensate function and `a' */
-    lua_call(L, 2, 1);
-    res = lua_toboolean(L, -1);
-    lua_pop(L, 1);
-    return res;
-  }
-  else  /* a < b? */
-    return lua_lessthan(L, a, b);
-}
-
-static void auxsort (lua_State *L, int l, int u) {
-  while (l < u) {  /* for tail recursion */
-    int i, j;
-    /* sort elements a[l], a[(l+u)/2] and a[u] */
-    lua_rawgeti(L, 1, l);
-    lua_rawgeti(L, 1, u);
-    if (sort_comp(L, -1, -2))  /* a[u] < a[l]? */
-      set2(L, l, u);  /* swap a[l] - a[u] */
-    else
-      lua_pop(L, 2);
-    if (u-l == 1) break;  /* only 2 elements */
-    i = (l+u)/2;
-    lua_rawgeti(L, 1, i);
-    lua_rawgeti(L, 1, l);
-    if (sort_comp(L, -2, -1))  /* a[i]<a[l]? */
-      set2(L, i, l);
-    else {
-      lua_pop(L, 1);  /* remove a[l] */
-      lua_rawgeti(L, 1, u);
-      if (sort_comp(L, -1, -2))  /* a[u]<a[i]? */
-        set2(L, i, u);
-      else
-        lua_pop(L, 2);
-    }
-    if (u-l == 2) break;  /* only 3 elements */
-    lua_rawgeti(L, 1, i);  /* Pivot */
-    lua_pushvalue(L, -1);
-    lua_rawgeti(L, 1, u-1);
-    set2(L, i, u-1);
-    /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */
-    i = l; j = u-1;
-    for (;;) {  /* invariant: a[l..i] <= P <= a[j..u] */
-      /* repeat ++i until a[i] >= P */
-      while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {
-        if (i>u) luaL_error(L, "invalid order function for sorting");
-        lua_pop(L, 1);  /* remove a[i] */
-      }
-      /* repeat --j until a[j] <= P */
-      while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {
-        if (j<l) luaL_error(L, "invalid order function for sorting");
-        lua_pop(L, 1);  /* remove a[j] */
-      }
-      if (j<i) {
-        lua_pop(L, 3);  /* pop pivot, a[i], a[j] */
-        break;
-      }
-      set2(L, i, j);
-    }
-    lua_rawgeti(L, 1, u-1);
-    lua_rawgeti(L, 1, i);
-    set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */
-    /* a[l..i-1] <= a[i] == P <= a[i+1..u] */
-    /* adjust so that smaller half is in [j..i] and larger one in [l..u] */
-    if (i-l < u-i) {
-      j=l; i=i-1; l=i+2;
-    }
-    else {
-      j=i+1; i=u; u=j-2;
-    }
-    auxsort(L, j, i);  /* call recursively the smaller one */
-  }  /* repeat the routine for the larger one */
-}
-
-static int sort (lua_State *L) {
-  int n = aux_getn(L, 1);
-  luaL_checkstack(L, 40, "");  /* assume array is smaller than 2^40 */
-  if (!lua_isnoneornil(L, 2))  /* is there a 2nd argument? */
-    luaL_checktype(L, 2, LUA_TFUNCTION);
-  lua_settop(L, 2);  /* make sure there is two arguments */
-  auxsort(L, 1, n);
-  return 0;
-}
-
-/* }====================================================== */
-
-
-static const luaL_Reg tab_funcs[] = {
-  {"concat", tconcat},
-  {"foreach", foreach},
-  {"foreachi", foreachi},
-  {"getn", getn},
-  {"maxn", maxn},
-  {"insert", tinsert},
-  {"remove", tremove},
-  {"setn", setn},
-  {"sort", sort},
-  {NULL, NULL}
-};
-
-
-LUALIB_API int luaopen_table (lua_State *L) {
-  luaL_register(L, LUA_TABLIBNAME, tab_funcs);
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/ltm.c b/redis-stable/deps/lua/src/ltm.c
deleted file mode 100644
index c27f0f6f..00000000
--- a/redis-stable/deps/lua/src/ltm.c
+++ /dev/null
@@ -1,75 +0,0 @@
-/*
-** $Id: ltm.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $
-** Tag methods
-** See Copyright Notice in lua.h
-*/
-
-
-#include <string.h>
-
-#define ltm_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "lobject.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-
-
-
-const char *const luaT_typenames[] = {
-  "nil", "boolean", "userdata", "number",
-  "string", "table", "function", "userdata", "thread",
-  "proto", "upval"
-};
-
-
-void luaT_init (lua_State *L) {
-  static const char *const luaT_eventname[] = {  /* ORDER TM */
-    "__index", "__newindex",
-    "__gc", "__mode", "__eq",
-    "__add", "__sub", "__mul", "__div", "__mod",
-    "__pow", "__unm", "__len", "__lt", "__le",
-    "__concat", "__call"
-  };
-  int i;
-  for (i=0; i<TM_N; i++) {
-    G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);
-    luaS_fix(G(L)->tmname[i]);  /* never collect these names */
-  }
-}
-
-
-/*
-** function to be used with macro "fasttm": optimized for absence of
-** tag methods
-*/
-const TValue *luaT_gettm (Table *events, TMS event, TString *ename) {
-  const TValue *tm = luaH_getstr(events, ename);
-  lua_assert(event <= TM_EQ);
-  if (ttisnil(tm)) {  /* no tag method? */
-    events->flags |= cast_byte(1u<<event);  /* cache this fact */
-    return NULL;
-  }
-  else return tm;
-}
-
-
-const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {
-  Table *mt;
-  switch (ttype(o)) {
-    case LUA_TTABLE:
-      mt = hvalue(o)->metatable;
-      break;
-    case LUA_TUSERDATA:
-      mt = uvalue(o)->metatable;
-      break;
-    default:
-      mt = G(L)->mt[ttype(o)];
-  }
-  return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject);
-}
-
diff --git a/redis-stable/deps/lua/src/ltm.h b/redis-stable/deps/lua/src/ltm.h
deleted file mode 100644
index 64343b78..00000000
--- a/redis-stable/deps/lua/src/ltm.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/*
-** $Id: ltm.h,v 2.6.1.1 2007/12/27 13:02:25 roberto Exp $
-** Tag methods
-** See Copyright Notice in lua.h
-*/
-
-#ifndef ltm_h
-#define ltm_h
-
-
-#include "lobject.h"
-
-
-/*
-* WARNING: if you change the order of this enumeration,
-* grep "ORDER TM"
-*/
-typedef enum {
-  TM_INDEX,
-  TM_NEWINDEX,
-  TM_GC,
-  TM_MODE,
-  TM_EQ,  /* last tag method with `fast' access */
-  TM_ADD,
-  TM_SUB,
-  TM_MUL,
-  TM_DIV,
-  TM_MOD,
-  TM_POW,
-  TM_UNM,
-  TM_LEN,
-  TM_LT,
-  TM_LE,
-  TM_CONCAT,
-  TM_CALL,
-  TM_N		/* number of elements in the enum */
-} TMS;
-
-
-
-#define gfasttm(g,et,e) ((et) == NULL ? NULL : \
-  ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e]))
-
-#define fasttm(l,et,e)	gfasttm(G(l), et, e)
-
-LUAI_DATA const char *const luaT_typenames[];
-
-
-LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename);
-LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o,
-                                                       TMS event);
-LUAI_FUNC void luaT_init (lua_State *L);
-
-#endif
diff --git a/redis-stable/deps/lua/src/lua.c b/redis-stable/deps/lua/src/lua.c
deleted file mode 100644
index 3a466093..00000000
--- a/redis-stable/deps/lua/src/lua.c
+++ /dev/null
@@ -1,392 +0,0 @@
-/*
-** $Id: lua.c,v 1.160.1.2 2007/12/28 15:32:23 roberto Exp $
-** Lua stand-alone interpreter
-** See Copyright Notice in lua.h
-*/
-
-
-#include <signal.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define lua_c
-
-#include "lua.h"
-
-#include "lauxlib.h"
-#include "lualib.h"
-
-
-
-static lua_State *globalL = NULL;
-
-static const char *progname = LUA_PROGNAME;
-
-
-
-static void lstop (lua_State *L, lua_Debug *ar) {
-  (void)ar;  /* unused arg. */
-  lua_sethook(L, NULL, 0, 0);
-  luaL_error(L, "interrupted!");
-}
-
-
-static void laction (int i) {
-  signal(i, SIG_DFL); /* if another SIGINT happens before lstop,
-                              terminate process (default action) */
-  lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);
-}
-
-
-static void print_usage (void) {
-  fprintf(stderr,
-  "usage: %s [options] [script [args]].\n"
-  "Available options are:\n"
-  "  -e stat  execute string " LUA_QL("stat") "\n"
-  "  -l name  require library " LUA_QL("name") "\n"
-  "  -i       enter interactive mode after executing " LUA_QL("script") "\n"
-  "  -v       show version information\n"
-  "  --       stop handling options\n"
-  "  -        execute stdin and stop handling options\n"
-  ,
-  progname);
-  fflush(stderr);
-}
-
-
-static void l_message (const char *pname, const char *msg) {
-  if (pname) fprintf(stderr, "%s: ", pname);
-  fprintf(stderr, "%s\n", msg);
-  fflush(stderr);
-}
-
-
-static int report (lua_State *L, int status) {
-  if (status && !lua_isnil(L, -1)) {
-    const char *msg = lua_tostring(L, -1);
-    if (msg == NULL) msg = "(error object is not a string)";
-    l_message(progname, msg);
-    lua_pop(L, 1);
-  }
-  return status;
-}
-
-
-static int traceback (lua_State *L) {
-  if (!lua_isstring(L, 1))  /* 'message' not a string? */
-    return 1;  /* keep it intact */
-  lua_getfield(L, LUA_GLOBALSINDEX, "debug");
-  if (!lua_istable(L, -1)) {
-    lua_pop(L, 1);
-    return 1;
-  }
-  lua_getfield(L, -1, "traceback");
-  if (!lua_isfunction(L, -1)) {
-    lua_pop(L, 2);
-    return 1;
-  }
-  lua_pushvalue(L, 1);  /* pass error message */
-  lua_pushinteger(L, 2);  /* skip this function and traceback */
-  lua_call(L, 2, 1);  /* call debug.traceback */
-  return 1;
-}
-
-
-static int docall (lua_State *L, int narg, int clear) {
-  int status;
-  int base = lua_gettop(L) - narg;  /* function index */
-  lua_pushcfunction(L, traceback);  /* push traceback function */
-  lua_insert(L, base);  /* put it under chunk and args */
-  signal(SIGINT, laction);
-  status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);
-  signal(SIGINT, SIG_DFL);
-  lua_remove(L, base);  /* remove traceback function */
-  /* force a complete garbage collection in case of errors */
-  if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0);
-  return status;
-}
-
-
-static void print_version (void) {
-  l_message(NULL, LUA_RELEASE "  " LUA_COPYRIGHT);
-}
-
-
-static int getargs (lua_State *L, char **argv, int n) {
-  int narg;
-  int i;
-  int argc = 0;
-  while (argv[argc]) argc++;  /* count total number of arguments */
-  narg = argc - (n + 1);  /* number of arguments to the script */
-  luaL_checkstack(L, narg + 3, "too many arguments to script");
-  for (i=n+1; i < argc; i++)
-    lua_pushstring(L, argv[i]);
-  lua_createtable(L, narg, n + 1);
-  for (i=0; i < argc; i++) {
-    lua_pushstring(L, argv[i]);
-    lua_rawseti(L, -2, i - n);
-  }
-  return narg;
-}
-
-
-static int dofile (lua_State *L, const char *name) {
-  int status = luaL_loadfile(L, name) || docall(L, 0, 1);
-  return report(L, status);
-}
-
-
-static int dostring (lua_State *L, const char *s, const char *name) {
-  int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1);
-  return report(L, status);
-}
-
-
-static int dolibrary (lua_State *L, const char *name) {
-  lua_getglobal(L, "require");
-  lua_pushstring(L, name);
-  return report(L, docall(L, 1, 1));
-}
-
-
-static const char *get_prompt (lua_State *L, int firstline) {
-  const char *p;
-  lua_getfield(L, LUA_GLOBALSINDEX, firstline ? "_PROMPT" : "_PROMPT2");
-  p = lua_tostring(L, -1);
-  if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2);
-  lua_pop(L, 1);  /* remove global */
-  return p;
-}
-
-
-static int incomplete (lua_State *L, int status) {
-  if (status == LUA_ERRSYNTAX) {
-    size_t lmsg;
-    const char *msg = lua_tolstring(L, -1, &lmsg);
-    const char *tp = msg + lmsg - (sizeof(LUA_QL("<eof>")) - 1);
-    if (strstr(msg, LUA_QL("<eof>")) == tp) {
-      lua_pop(L, 1);
-      return 1;
-    }
-  }
-  return 0;  /* else... */
-}
-
-
-static int pushline (lua_State *L, int firstline) {
-  char buffer[LUA_MAXINPUT];
-  char *b = buffer;
-  size_t l;
-  const char *prmt = get_prompt(L, firstline);
-  if (lua_readline(L, b, prmt) == 0)
-    return 0;  /* no input */
-  l = strlen(b);
-  if (l > 0 && b[l-1] == '\n')  /* line ends with newline? */
-    b[l-1] = '\0';  /* remove it */
-  if (firstline && b[0] == '=')  /* first line starts with `=' ? */
-    lua_pushfstring(L, "return %s", b+1);  /* change it to `return' */
-  else
-    lua_pushstring(L, b);
-  lua_freeline(L, b);
-  return 1;
-}
-
-
-static int loadline (lua_State *L) {
-  int status;
-  lua_settop(L, 0);
-  if (!pushline(L, 1))
-    return -1;  /* no input */
-  for (;;) {  /* repeat until gets a complete line */
-    status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), "=stdin");
-    if (!incomplete(L, status)) break;  /* cannot try to add lines? */
-    if (!pushline(L, 0))  /* no more input? */
-      return -1;
-    lua_pushliteral(L, "\n");  /* add a new line... */
-    lua_insert(L, -2);  /* ...between the two lines */
-    lua_concat(L, 3);  /* join them */
-  }
-  lua_saveline(L, 1);
-  lua_remove(L, 1);  /* remove line */
-  return status;
-}
-
-
-static void dotty (lua_State *L) {
-  int status;
-  const char *oldprogname = progname;
-  progname = NULL;
-  while ((status = loadline(L)) != -1) {
-    if (status == 0) status = docall(L, 0, 0);
-    report(L, status);
-    if (status == 0 && lua_gettop(L) > 0) {  /* any result to print? */
-      lua_getglobal(L, "print");
-      lua_insert(L, 1);
-      if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)
-        l_message(progname, lua_pushfstring(L,
-                               "error calling " LUA_QL("print") " (%s)",
-                               lua_tostring(L, -1)));
-    }
-  }
-  lua_settop(L, 0);  /* clear stack */
-  fputs("\n", stdout);
-  fflush(stdout);
-  progname = oldprogname;
-}
-
-
-static int handle_script (lua_State *L, char **argv, int n) {
-  int status;
-  const char *fname;
-  int narg = getargs(L, argv, n);  /* collect arguments */
-  lua_setglobal(L, "arg");
-  fname = argv[n];
-  if (strcmp(fname, "-") == 0 && strcmp(argv[n-1], "--") != 0) 
-    fname = NULL;  /* stdin */
-  status = luaL_loadfile(L, fname);
-  lua_insert(L, -(narg+1));
-  if (status == 0)
-    status = docall(L, narg, 0);
-  else
-    lua_pop(L, narg);      
-  return report(L, status);
-}
-
-
-/* check that argument has no extra characters at the end */
-#define notail(x)	{if ((x)[2] != '\0') return -1;}
-
-
-static int collectargs (char **argv, int *pi, int *pv, int *pe) {
-  int i;
-  for (i = 1; argv[i] != NULL; i++) {
-    if (argv[i][0] != '-')  /* not an option? */
-        return i;
-    switch (argv[i][1]) {  /* option */
-      case '-':
-        notail(argv[i]);
-        return (argv[i+1] != NULL ? i+1 : 0);
-      case '\0':
-        return i;
-      case 'i':
-        notail(argv[i]);
-        *pi = 1;  /* go through */
-      case 'v':
-        notail(argv[i]);
-        *pv = 1;
-        break;
-      case 'e':
-        *pe = 1;  /* go through */
-      case 'l':
-        if (argv[i][2] == '\0') {
-          i++;
-          if (argv[i] == NULL) return -1;
-        }
-        break;
-      default: return -1;  /* invalid option */
-    }
-  }
-  return 0;
-}
-
-
-static int runargs (lua_State *L, char **argv, int n) {
-  int i;
-  for (i = 1; i < n; i++) {
-    if (argv[i] == NULL) continue;
-    lua_assert(argv[i][0] == '-');
-    switch (argv[i][1]) {  /* option */
-      case 'e': {
-        const char *chunk = argv[i] + 2;
-        if (*chunk == '\0') chunk = argv[++i];
-        lua_assert(chunk != NULL);
-        if (dostring(L, chunk, "=(command line)") != 0)
-          return 1;
-        break;
-      }
-      case 'l': {
-        const char *filename = argv[i] + 2;
-        if (*filename == '\0') filename = argv[++i];
-        lua_assert(filename != NULL);
-        if (dolibrary(L, filename))
-          return 1;  /* stop if file fails */
-        break;
-      }
-      default: break;
-    }
-  }
-  return 0;
-}
-
-
-static int handle_luainit (lua_State *L) {
-  const char *init = getenv(LUA_INIT);
-  if (init == NULL) return 0;  /* status OK */
-  else if (init[0] == '@')
-    return dofile(L, init+1);
-  else
-    return dostring(L, init, "=" LUA_INIT);
-}
-
-
-struct Smain {
-  int argc;
-  char **argv;
-  int status;
-};
-
-
-static int pmain (lua_State *L) {
-  struct Smain *s = (struct Smain *)lua_touserdata(L, 1);
-  char **argv = s->argv;
-  int script;
-  int has_i = 0, has_v = 0, has_e = 0;
-  globalL = L;
-  if (argv[0] && argv[0][0]) progname = argv[0];
-  lua_gc(L, LUA_GCSTOP, 0);  /* stop collector during initialization */
-  luaL_openlibs(L);  /* open libraries */
-  lua_gc(L, LUA_GCRESTART, 0);
-  s->status = handle_luainit(L);
-  if (s->status != 0) return 0;
-  script = collectargs(argv, &has_i, &has_v, &has_e);
-  if (script < 0) {  /* invalid args? */
-    print_usage();
-    s->status = 1;
-    return 0;
-  }
-  if (has_v) print_version();
-  s->status = runargs(L, argv, (script > 0) ? script : s->argc);
-  if (s->status != 0) return 0;
-  if (script)
-    s->status = handle_script(L, argv, script);
-  if (s->status != 0) return 0;
-  if (has_i)
-    dotty(L);
-  else if (script == 0 && !has_e && !has_v) {
-    if (lua_stdin_is_tty()) {
-      print_version();
-      dotty(L);
-    }
-    else dofile(L, NULL);  /* executes stdin as a file */
-  }
-  return 0;
-}
-
-
-int main (int argc, char **argv) {
-  int status;
-  struct Smain s;
-  lua_State *L = lua_open();  /* create state */
-  if (L == NULL) {
-    l_message(argv[0], "cannot create state: not enough memory");
-    return EXIT_FAILURE;
-  }
-  s.argc = argc;
-  s.argv = argv;
-  status = lua_cpcall(L, &pmain, &s);
-  report(L, status);
-  lua_close(L);
-  return (status || s.status) ? EXIT_FAILURE : EXIT_SUCCESS;
-}
-
diff --git a/redis-stable/deps/lua/src/lua.h b/redis-stable/deps/lua/src/lua.h
deleted file mode 100644
index a4b73e74..00000000
--- a/redis-stable/deps/lua/src/lua.h
+++ /dev/null
@@ -1,388 +0,0 @@
-/*
-** $Id: lua.h,v 1.218.1.7 2012/01/13 20:36:20 roberto Exp $
-** Lua - An Extensible Extension Language
-** Lua.org, PUC-Rio, Brazil (http://www.lua.org)
-** See Copyright Notice at the end of this file
-*/
-
-
-#ifndef lua_h
-#define lua_h
-
-#include <stdarg.h>
-#include <stddef.h>
-
-
-#include "luaconf.h"
-
-
-#define LUA_VERSION	"Lua 5.1"
-#define LUA_RELEASE	"Lua 5.1.5"
-#define LUA_VERSION_NUM	501
-#define LUA_COPYRIGHT	"Copyright (C) 1994-2012 Lua.org, PUC-Rio"
-#define LUA_AUTHORS 	"R. Ierusalimschy, L. H. de Figueiredo & W. Celes"
-
-
-/* mark for precompiled code (`<esc>Lua') */
-#define	LUA_SIGNATURE	"\033Lua"
-
-/* option for multiple returns in `lua_pcall' and `lua_call' */
-#define LUA_MULTRET	(-1)
-
-
-/*
-** pseudo-indices
-*/
-#define LUA_REGISTRYINDEX	(-10000)
-#define LUA_ENVIRONINDEX	(-10001)
-#define LUA_GLOBALSINDEX	(-10002)
-#define lua_upvalueindex(i)	(LUA_GLOBALSINDEX-(i))
-
-
-/* thread status; 0 is OK */
-#define LUA_YIELD	1
-#define LUA_ERRRUN	2
-#define LUA_ERRSYNTAX	3
-#define LUA_ERRMEM	4
-#define LUA_ERRERR	5
-
-
-typedef struct lua_State lua_State;
-
-typedef int (*lua_CFunction) (lua_State *L);
-
-
-/*
-** functions that read/write blocks when loading/dumping Lua chunks
-*/
-typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);
-
-typedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);
-
-
-/*
-** prototype for memory-allocation functions
-*/
-typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);
-
-
-/*
-** basic types
-*/
-#define LUA_TNONE		(-1)
-
-#define LUA_TNIL		0
-#define LUA_TBOOLEAN		1
-#define LUA_TLIGHTUSERDATA	2
-#define LUA_TNUMBER		3
-#define LUA_TSTRING		4
-#define LUA_TTABLE		5
-#define LUA_TFUNCTION		6
-#define LUA_TUSERDATA		7
-#define LUA_TTHREAD		8
-
-
-
-/* minimum Lua stack available to a C function */
-#define LUA_MINSTACK	20
-
-
-/*
-** generic extra include file
-*/
-#if defined(LUA_USER_H)
-#include LUA_USER_H
-#endif
-
-
-/* type of numbers in Lua */
-typedef LUA_NUMBER lua_Number;
-
-
-/* type for integer functions */
-typedef LUA_INTEGER lua_Integer;
-
-
-
-/*
-** state manipulation
-*/
-LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);
-LUA_API void       (lua_close) (lua_State *L);
-LUA_API lua_State *(lua_newthread) (lua_State *L);
-
-LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);
-
-
-/*
-** basic stack manipulation
-*/
-LUA_API int   (lua_gettop) (lua_State *L);
-LUA_API void  (lua_settop) (lua_State *L, int idx);
-LUA_API void  (lua_pushvalue) (lua_State *L, int idx);
-LUA_API void  (lua_remove) (lua_State *L, int idx);
-LUA_API void  (lua_insert) (lua_State *L, int idx);
-LUA_API void  (lua_replace) (lua_State *L, int idx);
-LUA_API int   (lua_checkstack) (lua_State *L, int sz);
-
-LUA_API void  (lua_xmove) (lua_State *from, lua_State *to, int n);
-
-
-/*
-** access functions (stack -> C)
-*/
-
-LUA_API int             (lua_isnumber) (lua_State *L, int idx);
-LUA_API int             (lua_isstring) (lua_State *L, int idx);
-LUA_API int             (lua_iscfunction) (lua_State *L, int idx);
-LUA_API int             (lua_isuserdata) (lua_State *L, int idx);
-LUA_API int             (lua_type) (lua_State *L, int idx);
-LUA_API const char     *(lua_typename) (lua_State *L, int tp);
-
-LUA_API int            (lua_equal) (lua_State *L, int idx1, int idx2);
-LUA_API int            (lua_rawequal) (lua_State *L, int idx1, int idx2);
-LUA_API int            (lua_lessthan) (lua_State *L, int idx1, int idx2);
-
-LUA_API lua_Number      (lua_tonumber) (lua_State *L, int idx);
-LUA_API lua_Integer     (lua_tointeger) (lua_State *L, int idx);
-LUA_API int             (lua_toboolean) (lua_State *L, int idx);
-LUA_API const char     *(lua_tolstring) (lua_State *L, int idx, size_t *len);
-LUA_API size_t          (lua_objlen) (lua_State *L, int idx);
-LUA_API lua_CFunction   (lua_tocfunction) (lua_State *L, int idx);
-LUA_API void	       *(lua_touserdata) (lua_State *L, int idx);
-LUA_API lua_State      *(lua_tothread) (lua_State *L, int idx);
-LUA_API const void     *(lua_topointer) (lua_State *L, int idx);
-
-
-/*
-** push functions (C -> stack)
-*/
-LUA_API void  (lua_pushnil) (lua_State *L);
-LUA_API void  (lua_pushnumber) (lua_State *L, lua_Number n);
-LUA_API void  (lua_pushinteger) (lua_State *L, lua_Integer n);
-LUA_API void  (lua_pushlstring) (lua_State *L, const char *s, size_t l);
-LUA_API void  (lua_pushstring) (lua_State *L, const char *s);
-LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt,
-                                                      va_list argp);
-LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...);
-LUA_API void  (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);
-LUA_API void  (lua_pushboolean) (lua_State *L, int b);
-LUA_API void  (lua_pushlightuserdata) (lua_State *L, void *p);
-LUA_API int   (lua_pushthread) (lua_State *L);
-
-
-/*
-** get functions (Lua -> stack)
-*/
-LUA_API void  (lua_gettable) (lua_State *L, int idx);
-LUA_API void  (lua_getfield) (lua_State *L, int idx, const char *k);
-LUA_API void  (lua_rawget) (lua_State *L, int idx);
-LUA_API void  (lua_rawgeti) (lua_State *L, int idx, int n);
-LUA_API void  (lua_createtable) (lua_State *L, int narr, int nrec);
-LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);
-LUA_API int   (lua_getmetatable) (lua_State *L, int objindex);
-LUA_API void  (lua_getfenv) (lua_State *L, int idx);
-
-
-/*
-** set functions (stack -> Lua)
-*/
-LUA_API void  (lua_settable) (lua_State *L, int idx);
-LUA_API void  (lua_setfield) (lua_State *L, int idx, const char *k);
-LUA_API void  (lua_rawset) (lua_State *L, int idx);
-LUA_API void  (lua_rawseti) (lua_State *L, int idx, int n);
-LUA_API int   (lua_setmetatable) (lua_State *L, int objindex);
-LUA_API int   (lua_setfenv) (lua_State *L, int idx);
-
-
-/*
-** `load' and `call' functions (load and run Lua code)
-*/
-LUA_API void  (lua_call) (lua_State *L, int nargs, int nresults);
-LUA_API int   (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);
-LUA_API int   (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud);
-LUA_API int   (lua_load) (lua_State *L, lua_Reader reader, void *dt,
-                                        const char *chunkname);
-
-LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data);
-
-
-/*
-** coroutine functions
-*/
-LUA_API int  (lua_yield) (lua_State *L, int nresults);
-LUA_API int  (lua_resume) (lua_State *L, int narg);
-LUA_API int  (lua_status) (lua_State *L);
-
-/*
-** garbage-collection function and options
-*/
-
-#define LUA_GCSTOP		0
-#define LUA_GCRESTART		1
-#define LUA_GCCOLLECT		2
-#define LUA_GCCOUNT		3
-#define LUA_GCCOUNTB		4
-#define LUA_GCSTEP		5
-#define LUA_GCSETPAUSE		6
-#define LUA_GCSETSTEPMUL	7
-
-LUA_API int (lua_gc) (lua_State *L, int what, int data);
-
-
-/*
-** miscellaneous functions
-*/
-
-LUA_API int   (lua_error) (lua_State *L);
-
-LUA_API int   (lua_next) (lua_State *L, int idx);
-
-LUA_API void  (lua_concat) (lua_State *L, int n);
-
-LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);
-LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);
-
-
-
-/* 
-** ===============================================================
-** some useful macros
-** ===============================================================
-*/
-
-#define lua_pop(L,n)		lua_settop(L, -(n)-1)
-
-#define lua_newtable(L)		lua_createtable(L, 0, 0)
-
-#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))
-
-#define lua_pushcfunction(L,f)	lua_pushcclosure(L, (f), 0)
-
-#define lua_strlen(L,i)		lua_objlen(L, (i))
-
-#define lua_isfunction(L,n)	(lua_type(L, (n)) == LUA_TFUNCTION)
-#define lua_istable(L,n)	(lua_type(L, (n)) == LUA_TTABLE)
-#define lua_islightuserdata(L,n)	(lua_type(L, (n)) == LUA_TLIGHTUSERDATA)
-#define lua_isnil(L,n)		(lua_type(L, (n)) == LUA_TNIL)
-#define lua_isboolean(L,n)	(lua_type(L, (n)) == LUA_TBOOLEAN)
-#define lua_isthread(L,n)	(lua_type(L, (n)) == LUA_TTHREAD)
-#define lua_isnone(L,n)		(lua_type(L, (n)) == LUA_TNONE)
-#define lua_isnoneornil(L, n)	(lua_type(L, (n)) <= 0)
-
-#define lua_pushliteral(L, s)	\
-	lua_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1)
-
-#define lua_setglobal(L,s)	lua_setfield(L, LUA_GLOBALSINDEX, (s))
-#define lua_getglobal(L,s)	lua_getfield(L, LUA_GLOBALSINDEX, (s))
-
-#define lua_tostring(L,i)	lua_tolstring(L, (i), NULL)
-
-
-
-/*
-** compatibility macros and functions
-*/
-
-#define lua_open()	luaL_newstate()
-
-#define lua_getregistry(L)	lua_pushvalue(L, LUA_REGISTRYINDEX)
-
-#define lua_getgccount(L)	lua_gc(L, LUA_GCCOUNT, 0)
-
-#define lua_Chunkreader		lua_Reader
-#define lua_Chunkwriter		lua_Writer
-
-
-/* hack */
-LUA_API void lua_setlevel	(lua_State *from, lua_State *to);
-
-
-/*
-** {======================================================================
-** Debug API
-** =======================================================================
-*/
-
-
-/*
-** Event codes
-*/
-#define LUA_HOOKCALL	0
-#define LUA_HOOKRET	1
-#define LUA_HOOKLINE	2
-#define LUA_HOOKCOUNT	3
-#define LUA_HOOKTAILRET 4
-
-
-/*
-** Event masks
-*/
-#define LUA_MASKCALL	(1 << LUA_HOOKCALL)
-#define LUA_MASKRET	(1 << LUA_HOOKRET)
-#define LUA_MASKLINE	(1 << LUA_HOOKLINE)
-#define LUA_MASKCOUNT	(1 << LUA_HOOKCOUNT)
-
-typedef struct lua_Debug lua_Debug;  /* activation record */
-
-
-/* Functions to be called by the debuger in specific events */
-typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
-
-
-LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);
-LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
-LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
-LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
-LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);
-LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);
-
-LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);
-LUA_API lua_Hook lua_gethook (lua_State *L);
-LUA_API int lua_gethookmask (lua_State *L);
-LUA_API int lua_gethookcount (lua_State *L);
-
-
-struct lua_Debug {
-  int event;
-  const char *name;	/* (n) */
-  const char *namewhat;	/* (n) `global', `local', `field', `method' */
-  const char *what;	/* (S) `Lua', `C', `main', `tail' */
-  const char *source;	/* (S) */
-  int currentline;	/* (l) */
-  int nups;		/* (u) number of upvalues */
-  int linedefined;	/* (S) */
-  int lastlinedefined;	/* (S) */
-  char short_src[LUA_IDSIZE]; /* (S) */
-  /* private part */
-  int i_ci;  /* active function */
-};
-
-/* }====================================================================== */
-
-
-/******************************************************************************
-* Copyright (C) 1994-2012 Lua.org, PUC-Rio.  All rights reserved.
-*
-* Permission is hereby granted, free of charge, to any person obtaining
-* a copy of this software and associated documentation files (the
-* "Software"), to deal in the Software without restriction, including
-* without limitation the rights to use, copy, modify, merge, publish,
-* distribute, sublicense, and/or sell copies of the Software, and to
-* permit persons to whom the Software is furnished to do so, subject to
-* the following conditions:
-*
-* The above copyright notice and this permission notice shall be
-* included in all copies or substantial portions of the Software.
-*
-* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-******************************************************************************/
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/lua_bit.c b/redis-stable/deps/lua/src/lua_bit.c
deleted file mode 100644
index 690df7d3..00000000
--- a/redis-stable/deps/lua/src/lua_bit.c
+++ /dev/null
@@ -1,189 +0,0 @@
-/*
-** Lua BitOp -- a bit operations library for Lua 5.1/5.2.
-** http://bitop.luajit.org/
-**
-** Copyright (C) 2008-2012 Mike Pall. All rights reserved.
-**
-** Permission is hereby granted, free of charge, to any person obtaining
-** a copy of this software and associated documentation files (the
-** "Software"), to deal in the Software without restriction, including
-** without limitation the rights to use, copy, modify, merge, publish,
-** distribute, sublicense, and/or sell copies of the Software, and to
-** permit persons to whom the Software is furnished to do so, subject to
-** the following conditions:
-**
-** The above copyright notice and this permission notice shall be
-** included in all copies or substantial portions of the Software.
-**
-** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-**
-** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]
-*/
-
-#define LUA_BITOP_VERSION	"1.0.2"
-
-#define LUA_LIB
-#include "lua.h"
-#include "lauxlib.h"
-
-#ifdef _MSC_VER
-/* MSVC is stuck in the last century and doesn't have C99's stdint.h. */
-typedef __int32 int32_t;
-typedef unsigned __int32 uint32_t;
-typedef unsigned __int64 uint64_t;
-#else
-#include <stdint.h>
-#endif
-
-typedef int32_t SBits;
-typedef uint32_t UBits;
-
-typedef union {
-  lua_Number n;
-#ifdef LUA_NUMBER_DOUBLE
-  uint64_t b;
-#else
-  UBits b;
-#endif
-} BitNum;
-
-/* Convert argument to bit type. */
-static UBits barg(lua_State *L, int idx)
-{
-  BitNum bn;
-  UBits b;
-#if LUA_VERSION_NUM < 502
-  bn.n = lua_tonumber(L, idx);
-#else
-  bn.n = luaL_checknumber(L, idx);
-#endif
-#if defined(LUA_NUMBER_DOUBLE)
-  bn.n += 6755399441055744.0;  /* 2^52+2^51 */
-#ifdef SWAPPED_DOUBLE
-  b = (UBits)(bn.b >> 32);
-#else
-  b = (UBits)bn.b;
-#endif
-#elif defined(LUA_NUMBER_INT) || defined(LUA_NUMBER_LONG) || \
-      defined(LUA_NUMBER_LONGLONG) || defined(LUA_NUMBER_LONG_LONG) || \
-      defined(LUA_NUMBER_LLONG)
-  if (sizeof(UBits) == sizeof(lua_Number))
-    b = bn.b;
-  else
-    b = (UBits)(SBits)bn.n;
-#elif defined(LUA_NUMBER_FLOAT)
-#error "A 'float' lua_Number type is incompatible with this library"
-#else
-#error "Unknown number type, check LUA_NUMBER_* in luaconf.h"
-#endif
-#if LUA_VERSION_NUM < 502
-  if (b == 0 && !lua_isnumber(L, idx)) {
-    luaL_typerror(L, idx, "number");
-  }
-#endif
-  return b;
-}
-
-/* Return bit type. */
-#define BRET(b)  lua_pushnumber(L, (lua_Number)(SBits)(b)); return 1;
-
-static int bit_tobit(lua_State *L) { BRET(barg(L, 1)) }
-static int bit_bnot(lua_State *L) { BRET(~barg(L, 1)) }
-
-#define BIT_OP(func, opr) \
-  static int func(lua_State *L) { int i; UBits b = barg(L, 1); \
-    for (i = lua_gettop(L); i > 1; i--) b opr barg(L, i); BRET(b) }
-BIT_OP(bit_band, &=)
-BIT_OP(bit_bor, |=)
-BIT_OP(bit_bxor, ^=)
-
-#define bshl(b, n)  (b << n)
-#define bshr(b, n)  (b >> n)
-#define bsar(b, n)  ((SBits)b >> n)
-#define brol(b, n)  ((b << n) | (b >> (32-n)))
-#define bror(b, n)  ((b << (32-n)) | (b >> n))
-#define BIT_SH(func, fn) \
-  static int func(lua_State *L) { \
-    UBits b = barg(L, 1); UBits n = barg(L, 2) & 31; BRET(fn(b, n)) }
-BIT_SH(bit_lshift, bshl)
-BIT_SH(bit_rshift, bshr)
-BIT_SH(bit_arshift, bsar)
-BIT_SH(bit_rol, brol)
-BIT_SH(bit_ror, bror)
-
-static int bit_bswap(lua_State *L)
-{
-  UBits b = barg(L, 1);
-  b = (b >> 24) | ((b >> 8) & 0xff00) | ((b & 0xff00) << 8) | (b << 24);
-  BRET(b)
-}
-
-static int bit_tohex(lua_State *L)
-{
-  UBits b = barg(L, 1);
-  SBits n = lua_isnone(L, 2) ? 8 : (SBits)barg(L, 2);
-  const char *hexdigits = "0123456789abcdef";
-  char buf[8];
-  int i;
-  if (n < 0) { n = -n; hexdigits = "0123456789ABCDEF"; }
-  if (n > 8) n = 8;
-  for (i = (int)n; --i >= 0; ) { buf[i] = hexdigits[b & 15]; b >>= 4; }
-  lua_pushlstring(L, buf, (size_t)n);
-  return 1;
-}
-
-static const struct luaL_Reg bit_funcs[] = {
-  { "tobit",	bit_tobit },
-  { "bnot",	bit_bnot },
-  { "band",	bit_band },
-  { "bor",	bit_bor },
-  { "bxor",	bit_bxor },
-  { "lshift",	bit_lshift },
-  { "rshift",	bit_rshift },
-  { "arshift",	bit_arshift },
-  { "rol",	bit_rol },
-  { "ror",	bit_ror },
-  { "bswap",	bit_bswap },
-  { "tohex",	bit_tohex },
-  { NULL, NULL }
-};
-
-/* Signed right-shifts are implementation-defined per C89/C99.
-** But the de facto standard are arithmetic right-shifts on two's
-** complement CPUs. This behaviour is required here, so test for it.
-*/
-#define BAD_SAR		(bsar(-8, 2) != (SBits)-2)
-
-LUALIB_API int luaopen_bit(lua_State *L)
-{
-  UBits b;
-  lua_pushnumber(L, (lua_Number)1437217655L);
-  b = barg(L, -1);
-  if (b != (UBits)1437217655L || BAD_SAR) {  /* Perform a simple self-test. */
-    const char *msg = "compiled with incompatible luaconf.h";
-#ifdef LUA_NUMBER_DOUBLE
-#ifdef _WIN32
-    if (b == (UBits)1610612736L)
-      msg = "use D3DCREATE_FPU_PRESERVE with DirectX";
-#endif
-    if (b == (UBits)1127743488L)
-      msg = "not compiled with SWAPPED_DOUBLE";
-#endif
-    if (BAD_SAR)
-      msg = "arithmetic right-shift broken";
-    luaL_error(L, "bit library self-test failed (%s)", msg);
-  }
-#if LUA_VERSION_NUM < 502
-  luaL_register(L, "bit", bit_funcs);
-#else
-  luaL_newlib(L, bit_funcs);
-#endif
-  return 1;
-}
-
diff --git a/redis-stable/deps/lua/src/lua_cjson.c b/redis-stable/deps/lua/src/lua_cjson.c
deleted file mode 100644
index c26c0d7b..00000000
--- a/redis-stable/deps/lua/src/lua_cjson.c
+++ /dev/null
@@ -1,1427 +0,0 @@
-/* Lua CJSON - JSON support for Lua
- *
- * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- */
-
-/* Caveats:
- * - JSON "null" values are represented as lightuserdata since Lua
- *   tables cannot contain "nil". Compare with cjson.null.
- * - Invalid UTF-8 characters are not detected and will be passed
- *   untouched. If required, UTF-8 error checking should be done
- *   outside this library.
- * - Javascript comments are not part of the JSON spec, and are not
- *   currently supported.
- *
- * Note: Decoding is slower than encoding. Lua spends significant
- *       time (30%) managing tables when parsing JSON since it is
- *       difficult to know object/array sizes ahead of time.
- */
-
-#include <assert.h>
-#include <string.h>
-#include <math.h>
-#include <limits.h>
-#include "lua.h"
-#include "lauxlib.h"
-
-#include "strbuf.h"
-#include "fpconv.h"
-
-#include "../../../src/solarisfixes.h"
-
-#ifndef CJSON_MODNAME
-#define CJSON_MODNAME   "cjson"
-#endif
-
-#ifndef CJSON_VERSION
-#define CJSON_VERSION   "2.1.0"
-#endif
-
-/* Workaround for Solaris platforms missing isinf() */
-#if !defined(isinf) && (defined(USE_INTERNAL_ISINF) || defined(MISSING_ISINF))
-#define isinf(x) (!isnan(x) && isnan((x) - (x)))
-#endif
-
-#define DEFAULT_SPARSE_CONVERT 0
-#define DEFAULT_SPARSE_RATIO 2
-#define DEFAULT_SPARSE_SAFE 10
-#define DEFAULT_ENCODE_MAX_DEPTH 1000
-#define DEFAULT_DECODE_MAX_DEPTH 1000
-#define DEFAULT_ENCODE_INVALID_NUMBERS 0
-#define DEFAULT_DECODE_INVALID_NUMBERS 1
-#define DEFAULT_ENCODE_KEEP_BUFFER 1
-#define DEFAULT_ENCODE_NUMBER_PRECISION 14
-
-#ifdef DISABLE_INVALID_NUMBERS
-#undef DEFAULT_DECODE_INVALID_NUMBERS
-#define DEFAULT_DECODE_INVALID_NUMBERS 0
-#endif
-
-typedef enum {
-    T_OBJ_BEGIN,
-    T_OBJ_END,
-    T_ARR_BEGIN,
-    T_ARR_END,
-    T_STRING,
-    T_NUMBER,
-    T_BOOLEAN,
-    T_NULL,
-    T_COLON,
-    T_COMMA,
-    T_END,
-    T_WHITESPACE,
-    T_ERROR,
-    T_UNKNOWN
-} json_token_type_t;
-
-static const char *json_token_type_name[] = {
-    "T_OBJ_BEGIN",
-    "T_OBJ_END",
-    "T_ARR_BEGIN",
-    "T_ARR_END",
-    "T_STRING",
-    "T_NUMBER",
-    "T_BOOLEAN",
-    "T_NULL",
-    "T_COLON",
-    "T_COMMA",
-    "T_END",
-    "T_WHITESPACE",
-    "T_ERROR",
-    "T_UNKNOWN",
-    NULL
-};
-
-typedef struct {
-    json_token_type_t ch2token[256];
-    char escape2char[256];  /* Decoding */
-
-    /* encode_buf is only allocated and used when
-     * encode_keep_buffer is set */
-    strbuf_t encode_buf;
-
-    int encode_sparse_convert;
-    int encode_sparse_ratio;
-    int encode_sparse_safe;
-    int encode_max_depth;
-    int encode_invalid_numbers;     /* 2 => Encode as "null" */
-    int encode_number_precision;
-    int encode_keep_buffer;
-
-    int decode_invalid_numbers;
-    int decode_max_depth;
-} json_config_t;
-
-typedef struct {
-    const char *data;
-    const char *ptr;
-    strbuf_t *tmp;    /* Temporary storage for strings */
-    json_config_t *cfg;
-    int current_depth;
-} json_parse_t;
-
-typedef struct {
-    json_token_type_t type;
-    int index;
-    union {
-        const char *string;
-        double number;
-        int boolean;
-    } value;
-    int string_len;
-} json_token_t;
-
-static const char *char2escape[256] = {
-    "\\u0000", "\\u0001", "\\u0002", "\\u0003",
-    "\\u0004", "\\u0005", "\\u0006", "\\u0007",
-    "\\b", "\\t", "\\n", "\\u000b",
-    "\\f", "\\r", "\\u000e", "\\u000f",
-    "\\u0010", "\\u0011", "\\u0012", "\\u0013",
-    "\\u0014", "\\u0015", "\\u0016", "\\u0017",
-    "\\u0018", "\\u0019", "\\u001a", "\\u001b",
-    "\\u001c", "\\u001d", "\\u001e", "\\u001f",
-    NULL, NULL, "\\\"", NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, "\\/",
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, "\\\\", NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, "\\u007f",
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-    NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
-};
-
-/* ===== CONFIGURATION ===== */
-
-static json_config_t *json_fetch_config(lua_State *l)
-{
-    json_config_t *cfg;
-
-    cfg = lua_touserdata(l, lua_upvalueindex(1));
-    if (!cfg)
-        luaL_error(l, "BUG: Unable to fetch CJSON configuration");
-
-    return cfg;
-}
-
-/* Ensure the correct number of arguments have been provided.
- * Pad with nil to allow other functions to simply check arg[i]
- * to find whether an argument was provided */
-static json_config_t *json_arg_init(lua_State *l, int args)
-{
-    luaL_argcheck(l, lua_gettop(l) <= args, args + 1,
-                  "found too many arguments");
-
-    while (lua_gettop(l) < args)
-        lua_pushnil(l);
-
-    return json_fetch_config(l);
-}
-
-/* Process integer options for configuration functions */
-static int json_integer_option(lua_State *l, int optindex, int *setting,
-                               int min, int max)
-{
-    char errmsg[64];
-    int value;
-
-    if (!lua_isnil(l, optindex)) {
-        value = luaL_checkinteger(l, optindex);
-        snprintf(errmsg, sizeof(errmsg), "expected integer between %d and %d", min, max);
-        luaL_argcheck(l, min <= value && value <= max, 1, errmsg);
-        *setting = value;
-    }
-
-    lua_pushinteger(l, *setting);
-
-    return 1;
-}
-
-/* Process enumerated arguments for a configuration function */
-static int json_enum_option(lua_State *l, int optindex, int *setting,
-                            const char **options, int bool_true)
-{
-    static const char *bool_options[] = { "off", "on", NULL };
-
-    if (!options) {
-        options = bool_options;
-        bool_true = 1;
-    }
-
-    if (!lua_isnil(l, optindex)) {
-        if (bool_true && lua_isboolean(l, optindex))
-            *setting = lua_toboolean(l, optindex) * bool_true;
-        else
-            *setting = luaL_checkoption(l, optindex, NULL, options);
-    }
-
-    if (bool_true && (*setting == 0 || *setting == bool_true))
-        lua_pushboolean(l, *setting);
-    else
-        lua_pushstring(l, options[*setting]);
-
-    return 1;
-}
-
-/* Configures handling of extremely sparse arrays:
- * convert: Convert extremely sparse arrays into objects? Otherwise error.
- * ratio: 0: always allow sparse; 1: never allow sparse; >1: use ratio
- * safe: Always use an array when the max index <= safe */
-static int json_cfg_encode_sparse_array(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 3);
-
-    json_enum_option(l, 1, &cfg->encode_sparse_convert, NULL, 1);
-    json_integer_option(l, 2, &cfg->encode_sparse_ratio, 0, INT_MAX);
-    json_integer_option(l, 3, &cfg->encode_sparse_safe, 0, INT_MAX);
-
-    return 3;
-}
-
-/* Configures the maximum number of nested arrays/objects allowed when
- * encoding */
-static int json_cfg_encode_max_depth(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 1);
-
-    return json_integer_option(l, 1, &cfg->encode_max_depth, 1, INT_MAX);
-}
-
-/* Configures the maximum number of nested arrays/objects allowed when
- * encoding */
-static int json_cfg_decode_max_depth(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 1);
-
-    return json_integer_option(l, 1, &cfg->decode_max_depth, 1, INT_MAX);
-}
-
-/* Configures number precision when converting doubles to text */
-static int json_cfg_encode_number_precision(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 1);
-
-    return json_integer_option(l, 1, &cfg->encode_number_precision, 1, 14);
-}
-
-/* Configures JSON encoding buffer persistence */
-static int json_cfg_encode_keep_buffer(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 1);
-    int old_value;
-
-    old_value = cfg->encode_keep_buffer;
-
-    json_enum_option(l, 1, &cfg->encode_keep_buffer, NULL, 1);
-
-    /* Init / free the buffer if the setting has changed */
-    if (old_value ^ cfg->encode_keep_buffer) {
-        if (cfg->encode_keep_buffer)
-            strbuf_init(&cfg->encode_buf, 0);
-        else
-            strbuf_free(&cfg->encode_buf);
-    }
-
-    return 1;
-}
-
-#if defined(DISABLE_INVALID_NUMBERS) && !defined(USE_INTERNAL_FPCONV)
-void json_verify_invalid_number_setting(lua_State *l, int *setting)
-{
-    if (*setting == 1) {
-        *setting = 0;
-        luaL_error(l, "Infinity, NaN, and/or hexadecimal numbers are not supported.");
-    }
-}
-#else
-#define json_verify_invalid_number_setting(l, s)    do { } while(0)
-#endif
-
-static int json_cfg_encode_invalid_numbers(lua_State *l)
-{
-    static const char *options[] = { "off", "on", "null", NULL };
-    json_config_t *cfg = json_arg_init(l, 1);
-
-    json_enum_option(l, 1, &cfg->encode_invalid_numbers, options, 1);
-
-    json_verify_invalid_number_setting(l, &cfg->encode_invalid_numbers);
-
-    return 1;
-}
-
-static int json_cfg_decode_invalid_numbers(lua_State *l)
-{
-    json_config_t *cfg = json_arg_init(l, 1);
-
-    json_enum_option(l, 1, &cfg->decode_invalid_numbers, NULL, 1);
-
-    json_verify_invalid_number_setting(l, &cfg->encode_invalid_numbers);
-
-    return 1;
-}
-
-static int json_destroy_config(lua_State *l)
-{
-    json_config_t *cfg;
-
-    cfg = lua_touserdata(l, 1);
-    if (cfg)
-        strbuf_free(&cfg->encode_buf);
-    cfg = NULL;
-
-    return 0;
-}
-
-static void json_create_config(lua_State *l)
-{
-    json_config_t *cfg;
-    int i;
-
-    cfg = lua_newuserdata(l, sizeof(*cfg));
-
-    /* Create GC method to clean up strbuf */
-    lua_newtable(l);
-    lua_pushcfunction(l, json_destroy_config);
-    lua_setfield(l, -2, "__gc");
-    lua_setmetatable(l, -2);
-
-    cfg->encode_sparse_convert = DEFAULT_SPARSE_CONVERT;
-    cfg->encode_sparse_ratio = DEFAULT_SPARSE_RATIO;
-    cfg->encode_sparse_safe = DEFAULT_SPARSE_SAFE;
-    cfg->encode_max_depth = DEFAULT_ENCODE_MAX_DEPTH;
-    cfg->decode_max_depth = DEFAULT_DECODE_MAX_DEPTH;
-    cfg->encode_invalid_numbers = DEFAULT_ENCODE_INVALID_NUMBERS;
-    cfg->decode_invalid_numbers = DEFAULT_DECODE_INVALID_NUMBERS;
-    cfg->encode_keep_buffer = DEFAULT_ENCODE_KEEP_BUFFER;
-    cfg->encode_number_precision = DEFAULT_ENCODE_NUMBER_PRECISION;
-
-#if DEFAULT_ENCODE_KEEP_BUFFER > 0
-    strbuf_init(&cfg->encode_buf, 0);
-#endif
-
-    /* Decoding init */
-
-    /* Tag all characters as an error */
-    for (i = 0; i < 256; i++)
-        cfg->ch2token[i] = T_ERROR;
-
-    /* Set tokens that require no further processing */
-    cfg->ch2token['{'] = T_OBJ_BEGIN;
-    cfg->ch2token['}'] = T_OBJ_END;
-    cfg->ch2token['['] = T_ARR_BEGIN;
-    cfg->ch2token[']'] = T_ARR_END;
-    cfg->ch2token[','] = T_COMMA;
-    cfg->ch2token[':'] = T_COLON;
-    cfg->ch2token['\0'] = T_END;
-    cfg->ch2token[' '] = T_WHITESPACE;
-    cfg->ch2token['\t'] = T_WHITESPACE;
-    cfg->ch2token['\n'] = T_WHITESPACE;
-    cfg->ch2token['\r'] = T_WHITESPACE;
-
-    /* Update characters that require further processing */
-    cfg->ch2token['f'] = T_UNKNOWN;     /* false? */
-    cfg->ch2token['i'] = T_UNKNOWN;     /* inf, ininity? */
-    cfg->ch2token['I'] = T_UNKNOWN;
-    cfg->ch2token['n'] = T_UNKNOWN;     /* null, nan? */
-    cfg->ch2token['N'] = T_UNKNOWN;
-    cfg->ch2token['t'] = T_UNKNOWN;     /* true? */
-    cfg->ch2token['"'] = T_UNKNOWN;     /* string? */
-    cfg->ch2token['+'] = T_UNKNOWN;     /* number? */
-    cfg->ch2token['-'] = T_UNKNOWN;
-    for (i = 0; i < 10; i++)
-        cfg->ch2token['0' + i] = T_UNKNOWN;
-
-    /* Lookup table for parsing escape characters */
-    for (i = 0; i < 256; i++)
-        cfg->escape2char[i] = 0;          /* String error */
-    cfg->escape2char['"'] = '"';
-    cfg->escape2char['\\'] = '\\';
-    cfg->escape2char['/'] = '/';
-    cfg->escape2char['b'] = '\b';
-    cfg->escape2char['t'] = '\t';
-    cfg->escape2char['n'] = '\n';
-    cfg->escape2char['f'] = '\f';
-    cfg->escape2char['r'] = '\r';
-    cfg->escape2char['u'] = 'u';          /* Unicode parsing required */
-}
-
-/* ===== ENCODING ===== */
-
-static void json_encode_exception(lua_State *l, json_config_t *cfg, strbuf_t *json, int lindex,
-                                  const char *reason)
-{
-    if (!cfg->encode_keep_buffer)
-        strbuf_free(json);
-    luaL_error(l, "Cannot serialise %s: %s",
-                  lua_typename(l, lua_type(l, lindex)), reason);
-}
-
-/* json_append_string args:
- * - lua_State
- * - JSON strbuf
- * - String (Lua stack index)
- *
- * Returns nothing. Doesn't remove string from Lua stack */
-static void json_append_string(lua_State *l, strbuf_t *json, int lindex)
-{
-    const char *escstr;
-    int i;
-    const char *str;
-    size_t len;
-
-    str = lua_tolstring(l, lindex, &len);
-
-    /* Worst case is len * 6 (all unicode escapes).
-     * This buffer is reused constantly for small strings
-     * If there are any excess pages, they won't be hit anyway.
-     * This gains ~5% speedup. */
-    strbuf_ensure_empty_length(json, len * 6 + 2);
-
-    strbuf_append_char_unsafe(json, '\"');
-    for (i = 0; i < len; i++) {
-        escstr = char2escape[(unsigned char)str[i]];
-        if (escstr)
-            strbuf_append_string(json, escstr);
-        else
-            strbuf_append_char_unsafe(json, str[i]);
-    }
-    strbuf_append_char_unsafe(json, '\"');
-}
-
-/* Find the size of the array on the top of the Lua stack
- * -1   object (not a pure array)
- * >=0  elements in array
- */
-static int lua_array_length(lua_State *l, json_config_t *cfg, strbuf_t *json)
-{
-    double k;
-    int max;
-    int items;
-
-    max = 0;
-    items = 0;
-
-    lua_pushnil(l);
-    /* table, startkey */
-    while (lua_next(l, -2) != 0) {
-        /* table, key, value */
-        if (lua_type(l, -2) == LUA_TNUMBER &&
-            (k = lua_tonumber(l, -2))) {
-            /* Integer >= 1 ? */
-            if (floor(k) == k && k >= 1) {
-                if (k > max)
-                    max = k;
-                items++;
-                lua_pop(l, 1);
-                continue;
-            }
-        }
-
-        /* Must not be an array (non integer key) */
-        lua_pop(l, 2);
-        return -1;
-    }
-
-    /* Encode excessively sparse arrays as objects (if enabled) */
-    if (cfg->encode_sparse_ratio > 0 &&
-        max > items * cfg->encode_sparse_ratio &&
-        max > cfg->encode_sparse_safe) {
-        if (!cfg->encode_sparse_convert)
-            json_encode_exception(l, cfg, json, -1, "excessively sparse array");
-
-        return -1;
-    }
-
-    return max;
-}
-
-static void json_check_encode_depth(lua_State *l, json_config_t *cfg,
-                                    int current_depth, strbuf_t *json)
-{
-    /* Ensure there are enough slots free to traverse a table (key,
-     * value) and push a string for a potential error message.
-     *
-     * Unlike "decode", the key and value are still on the stack when
-     * lua_checkstack() is called.  Hence an extra slot for luaL_error()
-     * below is required just in case the next check to lua_checkstack()
-     * fails.
-     *
-     * While this won't cause a crash due to the EXTRA_STACK reserve
-     * slots, it would still be an improper use of the API. */
-    if (current_depth <= cfg->encode_max_depth && lua_checkstack(l, 3))
-        return;
-
-    if (!cfg->encode_keep_buffer)
-        strbuf_free(json);
-
-    luaL_error(l, "Cannot serialise, excessive nesting (%d)",
-               current_depth);
-}
-
-static void json_append_data(lua_State *l, json_config_t *cfg,
-                             int current_depth, strbuf_t *json);
-
-/* json_append_array args:
- * - lua_State
- * - JSON strbuf
- * - Size of passwd Lua array (top of stack) */
-static void json_append_array(lua_State *l, json_config_t *cfg, int current_depth,
-                              strbuf_t *json, int array_length)
-{
-    int comma, i;
-
-    strbuf_append_char(json, '[');
-
-    comma = 0;
-    for (i = 1; i <= array_length; i++) {
-        if (comma)
-            strbuf_append_char(json, ',');
-        else
-            comma = 1;
-
-        lua_rawgeti(l, -1, i);
-        json_append_data(l, cfg, current_depth, json);
-        lua_pop(l, 1);
-    }
-
-    strbuf_append_char(json, ']');
-}
-
-static void json_append_number(lua_State *l, json_config_t *cfg,
-                               strbuf_t *json, int lindex)
-{
-    double num = lua_tonumber(l, lindex);
-    int len;
-
-    if (cfg->encode_invalid_numbers == 0) {
-        /* Prevent encoding invalid numbers */
-        if (isinf(num) || isnan(num))
-            json_encode_exception(l, cfg, json, lindex, "must not be NaN or Inf");
-    } else if (cfg->encode_invalid_numbers == 1) {
-        /* Encode invalid numbers, but handle "nan" separately
-         * since some platforms may encode as "-nan". */
-        if (isnan(num)) {
-            strbuf_append_mem(json, "nan", 3);
-            return;
-        }
-    } else {
-        /* Encode invalid numbers as "null" */
-        if (isinf(num) || isnan(num)) {
-            strbuf_append_mem(json, "null", 4);
-            return;
-        }
-    }
-
-    strbuf_ensure_empty_length(json, FPCONV_G_FMT_BUFSIZE);
-    len = fpconv_g_fmt(strbuf_empty_ptr(json), num, cfg->encode_number_precision);
-    strbuf_extend_length(json, len);
-}
-
-static void json_append_object(lua_State *l, json_config_t *cfg,
-                               int current_depth, strbuf_t *json)
-{
-    int comma, keytype;
-
-    /* Object */
-    strbuf_append_char(json, '{');
-
-    lua_pushnil(l);
-    /* table, startkey */
-    comma = 0;
-    while (lua_next(l, -2) != 0) {
-        if (comma)
-            strbuf_append_char(json, ',');
-        else
-            comma = 1;
-
-        /* table, key, value */
-        keytype = lua_type(l, -2);
-        if (keytype == LUA_TNUMBER) {
-            strbuf_append_char(json, '"');
-            json_append_number(l, cfg, json, -2);
-            strbuf_append_mem(json, "\":", 2);
-        } else if (keytype == LUA_TSTRING) {
-            json_append_string(l, json, -2);
-            strbuf_append_char(json, ':');
-        } else {
-            json_encode_exception(l, cfg, json, -2,
-                                  "table key must be a number or string");
-            /* never returns */
-        }
-
-        /* table, key, value */
-        json_append_data(l, cfg, current_depth, json);
-        lua_pop(l, 1);
-        /* table, key */
-    }
-
-    strbuf_append_char(json, '}');
-}
-
-/* Serialise Lua data into JSON string. */
-static void json_append_data(lua_State *l, json_config_t *cfg,
-                             int current_depth, strbuf_t *json)
-{
-    int len;
-
-    switch (lua_type(l, -1)) {
-    case LUA_TSTRING:
-        json_append_string(l, json, -1);
-        break;
-    case LUA_TNUMBER:
-        json_append_number(l, cfg, json, -1);
-        break;
-    case LUA_TBOOLEAN:
-        if (lua_toboolean(l, -1))
-            strbuf_append_mem(json, "true", 4);
-        else
-            strbuf_append_mem(json, "false", 5);
-        break;
-    case LUA_TTABLE:
-        current_depth++;
-        json_check_encode_depth(l, cfg, current_depth, json);
-        len = lua_array_length(l, cfg, json);
-        if (len > 0)
-            json_append_array(l, cfg, current_depth, json, len);
-        else
-            json_append_object(l, cfg, current_depth, json);
-        break;
-    case LUA_TNIL:
-        strbuf_append_mem(json, "null", 4);
-        break;
-    case LUA_TLIGHTUSERDATA:
-        if (lua_touserdata(l, -1) == NULL) {
-            strbuf_append_mem(json, "null", 4);
-            break;
-        }
-    default:
-        /* Remaining types (LUA_TFUNCTION, LUA_TUSERDATA, LUA_TTHREAD,
-         * and LUA_TLIGHTUSERDATA) cannot be serialised */
-        json_encode_exception(l, cfg, json, -1, "type not supported");
-        /* never returns */
-    }
-}
-
-static int json_encode(lua_State *l)
-{
-    json_config_t *cfg = json_fetch_config(l);
-    strbuf_t local_encode_buf;
-    strbuf_t *encode_buf;
-    char *json;
-    int len;
-
-    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
-
-    if (!cfg->encode_keep_buffer) {
-        /* Use private buffer */
-        encode_buf = &local_encode_buf;
-        strbuf_init(encode_buf, 0);
-    } else {
-        /* Reuse existing buffer */
-        encode_buf = &cfg->encode_buf;
-        strbuf_reset(encode_buf);
-    }
-
-    json_append_data(l, cfg, 0, encode_buf);
-    json = strbuf_string(encode_buf, &len);
-
-    lua_pushlstring(l, json, len);
-
-    if (!cfg->encode_keep_buffer)
-        strbuf_free(encode_buf);
-
-    return 1;
-}
-
-/* ===== DECODING ===== */
-
-static void json_process_value(lua_State *l, json_parse_t *json,
-                               json_token_t *token);
-
-static int hexdigit2int(char hex)
-{
-    if ('0' <= hex  && hex <= '9')
-        return hex - '0';
-
-    /* Force lowercase */
-    hex |= 0x20;
-    if ('a' <= hex && hex <= 'f')
-        return 10 + hex - 'a';
-
-    return -1;
-}
-
-static int decode_hex4(const char *hex)
-{
-    int digit[4];
-    int i;
-
-    /* Convert ASCII hex digit to numeric digit
-     * Note: this returns an error for invalid hex digits, including
-     *       NULL */
-    for (i = 0; i < 4; i++) {
-        digit[i] = hexdigit2int(hex[i]);
-        if (digit[i] < 0) {
-            return -1;
-        }
-    }
-
-    return (digit[0] << 12) +
-           (digit[1] << 8) +
-           (digit[2] << 4) +
-            digit[3];
-}
-
-/* Converts a Unicode codepoint to UTF-8.
- * Returns UTF-8 string length, and up to 4 bytes in *utf8 */
-static int codepoint_to_utf8(char *utf8, int codepoint)
-{
-    /* 0xxxxxxx */
-    if (codepoint <= 0x7F) {
-        utf8[0] = codepoint;
-        return 1;
-    }
-
-    /* 110xxxxx 10xxxxxx */
-    if (codepoint <= 0x7FF) {
-        utf8[0] = (codepoint >> 6) | 0xC0;
-        utf8[1] = (codepoint & 0x3F) | 0x80;
-        return 2;
-    }
-
-    /* 1110xxxx 10xxxxxx 10xxxxxx */
-    if (codepoint <= 0xFFFF) {
-        utf8[0] = (codepoint >> 12) | 0xE0;
-        utf8[1] = ((codepoint >> 6) & 0x3F) | 0x80;
-        utf8[2] = (codepoint & 0x3F) | 0x80;
-        return 3;
-    }
-
-    /* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
-    if (codepoint <= 0x1FFFFF) {
-        utf8[0] = (codepoint >> 18) | 0xF0;
-        utf8[1] = ((codepoint >> 12) & 0x3F) | 0x80;
-        utf8[2] = ((codepoint >> 6) & 0x3F) | 0x80;
-        utf8[3] = (codepoint & 0x3F) | 0x80;
-        return 4;
-    }
-
-    return 0;
-}
-
-
-/* Called when index pointing to beginning of UTF-16 code escape: \uXXXX
- * \u is guaranteed to exist, but the remaining hex characters may be
- * missing.
- * Translate to UTF-8 and append to temporary token string.
- * Must advance index to the next character to be processed.
- * Returns: 0   success
- *          -1  error
- */
-static int json_append_unicode_escape(json_parse_t *json)
-{
-    char utf8[4];       /* Surrogate pairs require 4 UTF-8 bytes */
-    int codepoint;
-    int surrogate_low;
-    int len;
-    int escape_len = 6;
-
-    /* Fetch UTF-16 code unit */
-    codepoint = decode_hex4(json->ptr + 2);
-    if (codepoint < 0)
-        return -1;
-
-    /* UTF-16 surrogate pairs take the following 2 byte form:
-     *      11011 x yyyyyyyyyy
-     * When x = 0: y is the high 10 bits of the codepoint
-     *      x = 1: y is the low 10 bits of the codepoint
-     *
-     * Check for a surrogate pair (high or low) */
-    if ((codepoint & 0xF800) == 0xD800) {
-        /* Error if the 1st surrogate is not high */
-        if (codepoint & 0x400)
-            return -1;
-
-        /* Ensure the next code is a unicode escape */
-        if (*(json->ptr + escape_len) != '\\' ||
-            *(json->ptr + escape_len + 1) != 'u') {
-            return -1;
-        }
-
-        /* Fetch the next codepoint */
-        surrogate_low = decode_hex4(json->ptr + 2 + escape_len);
-        if (surrogate_low < 0)
-            return -1;
-
-        /* Error if the 2nd code is not a low surrogate */
-        if ((surrogate_low & 0xFC00) != 0xDC00)
-            return -1;
-
-        /* Calculate Unicode codepoint */
-        codepoint = (codepoint & 0x3FF) << 10;
-        surrogate_low &= 0x3FF;
-        codepoint = (codepoint | surrogate_low) + 0x10000;
-        escape_len = 12;
-    }
-
-    /* Convert codepoint to UTF-8 */
-    len = codepoint_to_utf8(utf8, codepoint);
-    if (!len)
-        return -1;
-
-    /* Append bytes and advance parse index */
-    strbuf_append_mem_unsafe(json->tmp, utf8, len);
-    json->ptr += escape_len;
-
-    return 0;
-}
-
-static void json_set_token_error(json_token_t *token, json_parse_t *json,
-                                 const char *errtype)
-{
-    token->type = T_ERROR;
-    token->index = json->ptr - json->data;
-    token->value.string = errtype;
-}
-
-static void json_next_string_token(json_parse_t *json, json_token_t *token)
-{
-    char *escape2char = json->cfg->escape2char;
-    char ch;
-
-    /* Caller must ensure a string is next */
-    assert(*json->ptr == '"');
-
-    /* Skip " */
-    json->ptr++;
-
-    /* json->tmp is the temporary strbuf used to accumulate the
-     * decoded string value.
-     * json->tmp is sized to handle JSON containing only a string value.
-     */
-    strbuf_reset(json->tmp);
-
-    while ((ch = *json->ptr) != '"') {
-        if (!ch) {
-            /* Premature end of the string */
-            json_set_token_error(token, json, "unexpected end of string");
-            return;
-        }
-
-        /* Handle escapes */
-        if (ch == '\\') {
-            /* Fetch escape character */
-            ch = *(json->ptr + 1);
-
-            /* Translate escape code and append to tmp string */
-            ch = escape2char[(unsigned char)ch];
-            if (ch == 'u') {
-                if (json_append_unicode_escape(json) == 0)
-                    continue;
-
-                json_set_token_error(token, json,
-                                     "invalid unicode escape code");
-                return;
-            }
-            if (!ch) {
-                json_set_token_error(token, json, "invalid escape code");
-                return;
-            }
-
-            /* Skip '\' */
-            json->ptr++;
-        }
-        /* Append normal character or translated single character
-         * Unicode escapes are handled above */
-        strbuf_append_char_unsafe(json->tmp, ch);
-        json->ptr++;
-    }
-    json->ptr++;    /* Eat final quote (") */
-
-    strbuf_ensure_null(json->tmp);
-
-    token->type = T_STRING;
-    token->value.string = strbuf_string(json->tmp, &token->string_len);
-}
-
-/* JSON numbers should take the following form:
- *      -?(0|[1-9]|[1-9][0-9]+)(.[0-9]+)?([eE][-+]?[0-9]+)?
- *
- * json_next_number_token() uses strtod() which allows other forms:
- * - numbers starting with '+'
- * - NaN, -NaN, infinity, -infinity
- * - hexadecimal numbers
- * - numbers with leading zeros
- *
- * json_is_invalid_number() detects "numbers" which may pass strtod()'s
- * error checking, but should not be allowed with strict JSON.
- *
- * json_is_invalid_number() may pass numbers which cause strtod()
- * to generate an error.
- */
-static int json_is_invalid_number(json_parse_t *json)
-{
-    const char *p = json->ptr;
-
-    /* Reject numbers starting with + */
-    if (*p == '+')
-        return 1;
-
-    /* Skip minus sign if it exists */
-    if (*p == '-')
-        p++;
-
-    /* Reject numbers starting with 0x, or leading zeros */
-    if (*p == '0') {
-        int ch2 = *(p + 1);
-
-        if ((ch2 | 0x20) == 'x' ||          /* Hex */
-            ('0' <= ch2 && ch2 <= '9'))     /* Leading zero */
-            return 1;
-
-        return 0;
-    } else if (*p <= '9') {
-        return 0;                           /* Ordinary number */
-    }
-
-    /* Reject inf/nan */
-    if (!strncasecmp(p, "inf", 3))
-        return 1;
-    if (!strncasecmp(p, "nan", 3))
-        return 1;
-
-    /* Pass all other numbers which may still be invalid, but
-     * strtod() will catch them. */
-    return 0;
-}
-
-static void json_next_number_token(json_parse_t *json, json_token_t *token)
-{
-    char *endptr;
-
-    token->type = T_NUMBER;
-    token->value.number = fpconv_strtod(json->ptr, &endptr);
-    if (json->ptr == endptr)
-        json_set_token_error(token, json, "invalid number");
-    else
-        json->ptr = endptr;     /* Skip the processed number */
-
-    return;
-}
-
-/* Fills in the token struct.
- * T_STRING will return a pointer to the json_parse_t temporary string
- * T_ERROR will leave the json->ptr pointer at the error.
- */
-static void json_next_token(json_parse_t *json, json_token_t *token)
-{
-    const json_token_type_t *ch2token = json->cfg->ch2token;
-    int ch;
-
-    /* Eat whitespace. */
-    while (1) {
-        ch = (unsigned char)*(json->ptr);
-        token->type = ch2token[ch];
-        if (token->type != T_WHITESPACE)
-            break;
-        json->ptr++;
-    }
-
-    /* Store location of new token. Required when throwing errors
-     * for unexpected tokens (syntax errors). */
-    token->index = json->ptr - json->data;
-
-    /* Don't advance the pointer for an error or the end */
-    if (token->type == T_ERROR) {
-        json_set_token_error(token, json, "invalid token");
-        return;
-    }
-
-    if (token->type == T_END) {
-        return;
-    }
-
-    /* Found a known single character token, advance index and return */
-    if (token->type != T_UNKNOWN) {
-        json->ptr++;
-        return;
-    }
-
-    /* Process characters which triggered T_UNKNOWN
-     *
-     * Must use strncmp() to match the front of the JSON string.
-     * JSON identifier must be lowercase.
-     * When strict_numbers if disabled, either case is allowed for
-     * Infinity/NaN (since we are no longer following the spec..) */
-    if (ch == '"') {
-        json_next_string_token(json, token);
-        return;
-    } else if (ch == '-' || ('0' <= ch && ch <= '9')) {
-        if (!json->cfg->decode_invalid_numbers && json_is_invalid_number(json)) {
-            json_set_token_error(token, json, "invalid number");
-            return;
-        }
-        json_next_number_token(json, token);
-        return;
-    } else if (!strncmp(json->ptr, "true", 4)) {
-        token->type = T_BOOLEAN;
-        token->value.boolean = 1;
-        json->ptr += 4;
-        return;
-    } else if (!strncmp(json->ptr, "false", 5)) {
-        token->type = T_BOOLEAN;
-        token->value.boolean = 0;
-        json->ptr += 5;
-        return;
-    } else if (!strncmp(json->ptr, "null", 4)) {
-        token->type = T_NULL;
-        json->ptr += 4;
-        return;
-    } else if (json->cfg->decode_invalid_numbers &&
-               json_is_invalid_number(json)) {
-        /* When decode_invalid_numbers is enabled, only attempt to process
-         * numbers we know are invalid JSON (Inf, NaN, hex)
-         * This is required to generate an appropriate token error,
-         * otherwise all bad tokens will register as "invalid number"
-         */
-        json_next_number_token(json, token);
-        return;
-    }
-
-    /* Token starts with t/f/n but isn't recognised above. */
-    json_set_token_error(token, json, "invalid token");
-}
-
-/* This function does not return.
- * DO NOT CALL WITH DYNAMIC MEMORY ALLOCATED.
- * The only supported exception is the temporary parser string
- * json->tmp struct.
- * json and token should exist on the stack somewhere.
- * luaL_error() will long_jmp and release the stack */
-static void json_throw_parse_error(lua_State *l, json_parse_t *json,
-                                   const char *exp, json_token_t *token)
-{
-    const char *found;
-
-    strbuf_free(json->tmp);
-
-    if (token->type == T_ERROR)
-        found = token->value.string;
-    else
-        found = json_token_type_name[token->type];
-
-    /* Note: token->index is 0 based, display starting from 1 */
-    luaL_error(l, "Expected %s but found %s at character %d",
-               exp, found, token->index + 1);
-}
-
-static inline void json_decode_ascend(json_parse_t *json)
-{
-    json->current_depth--;
-}
-
-static void json_decode_descend(lua_State *l, json_parse_t *json, int slots)
-{
-    json->current_depth++;
-
-    if (json->current_depth <= json->cfg->decode_max_depth &&
-        lua_checkstack(l, slots)) {
-        return;
-    }
-
-    strbuf_free(json->tmp);
-    luaL_error(l, "Found too many nested data structures (%d) at character %d",
-        json->current_depth, json->ptr - json->data);
-}
-
-static void json_parse_object_context(lua_State *l, json_parse_t *json)
-{
-    json_token_t token;
-
-    /* 3 slots required:
-     * .., table, key, value */
-    json_decode_descend(l, json, 3);
-
-    lua_newtable(l);
-
-    json_next_token(json, &token);
-
-    /* Handle empty objects */
-    if (token.type == T_OBJ_END) {
-        json_decode_ascend(json);
-        return;
-    }
-
-    while (1) {
-        if (token.type != T_STRING)
-            json_throw_parse_error(l, json, "object key string", &token);
-
-        /* Push key */
-        lua_pushlstring(l, token.value.string, token.string_len);
-
-        json_next_token(json, &token);
-        if (token.type != T_COLON)
-            json_throw_parse_error(l, json, "colon", &token);
-
-        /* Fetch value */
-        json_next_token(json, &token);
-        json_process_value(l, json, &token);
-
-        /* Set key = value */
-        lua_rawset(l, -3);
-
-        json_next_token(json, &token);
-
-        if (token.type == T_OBJ_END) {
-            json_decode_ascend(json);
-            return;
-        }
-
-        if (token.type != T_COMMA)
-            json_throw_parse_error(l, json, "comma or object end", &token);
-
-        json_next_token(json, &token);
-    }
-}
-
-/* Handle the array context */
-static void json_parse_array_context(lua_State *l, json_parse_t *json)
-{
-    json_token_t token;
-    int i;
-
-    /* 2 slots required:
-     * .., table, value */
-    json_decode_descend(l, json, 2);
-
-    lua_newtable(l);
-
-    json_next_token(json, &token);
-
-    /* Handle empty arrays */
-    if (token.type == T_ARR_END) {
-        json_decode_ascend(json);
-        return;
-    }
-
-    for (i = 1; ; i++) {
-        json_process_value(l, json, &token);
-        lua_rawseti(l, -2, i);            /* arr[i] = value */
-
-        json_next_token(json, &token);
-
-        if (token.type == T_ARR_END) {
-            json_decode_ascend(json);
-            return;
-        }
-
-        if (token.type != T_COMMA)
-            json_throw_parse_error(l, json, "comma or array end", &token);
-
-        json_next_token(json, &token);
-    }
-}
-
-/* Handle the "value" context */
-static void json_process_value(lua_State *l, json_parse_t *json,
-                               json_token_t *token)
-{
-    switch (token->type) {
-    case T_STRING:
-        lua_pushlstring(l, token->value.string, token->string_len);
-        break;;
-    case T_NUMBER:
-        lua_pushnumber(l, token->value.number);
-        break;;
-    case T_BOOLEAN:
-        lua_pushboolean(l, token->value.boolean);
-        break;;
-    case T_OBJ_BEGIN:
-        json_parse_object_context(l, json);
-        break;;
-    case T_ARR_BEGIN:
-        json_parse_array_context(l, json);
-        break;;
-    case T_NULL:
-        /* In Lua, setting "t[k] = nil" will delete k from the table.
-         * Hence a NULL pointer lightuserdata object is used instead */
-        lua_pushlightuserdata(l, NULL);
-        break;;
-    default:
-        json_throw_parse_error(l, json, "value", token);
-    }
-}
-
-static int json_decode(lua_State *l)
-{
-    json_parse_t json;
-    json_token_t token;
-    size_t json_len;
-
-    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
-
-    json.cfg = json_fetch_config(l);
-    json.data = luaL_checklstring(l, 1, &json_len);
-    json.current_depth = 0;
-    json.ptr = json.data;
-
-    /* Detect Unicode other than UTF-8 (see RFC 4627, Sec 3)
-     *
-     * CJSON can support any simple data type, hence only the first
-     * character is guaranteed to be ASCII (at worst: '"'). This is
-     * still enough to detect whether the wrong encoding is in use. */
-    if (json_len >= 2 && (!json.data[0] || !json.data[1]))
-        luaL_error(l, "JSON parser does not support UTF-16 or UTF-32");
-
-    /* Ensure the temporary buffer can hold the entire string.
-     * This means we no longer need to do length checks since the decoded
-     * string must be smaller than the entire json string */
-    json.tmp = strbuf_new(json_len);
-
-    json_next_token(&json, &token);
-    json_process_value(l, &json, &token);
-
-    /* Ensure there is no more input left */
-    json_next_token(&json, &token);
-
-    if (token.type != T_END)
-        json_throw_parse_error(l, &json, "the end", &token);
-
-    strbuf_free(json.tmp);
-
-    return 1;
-}
-
-/* ===== INITIALISATION ===== */
-
-#if !defined(LUA_VERSION_NUM) || LUA_VERSION_NUM < 502
-/* Compatibility for Lua 5.1.
- *
- * luaL_setfuncs() is used to create a module table where the functions have
- * json_config_t as their first upvalue. Code borrowed from Lua 5.2 source. */
-static void luaL_setfuncs (lua_State *l, const luaL_Reg *reg, int nup)
-{
-    int i;
-
-    luaL_checkstack(l, nup, "too many upvalues");
-    for (; reg->name != NULL; reg++) {  /* fill the table with given functions */
-        for (i = 0; i < nup; i++)  /* copy upvalues to the top */
-            lua_pushvalue(l, -nup);
-        lua_pushcclosure(l, reg->func, nup);  /* closure with those upvalues */
-        lua_setfield(l, -(nup + 2), reg->name);
-    }
-    lua_pop(l, nup);  /* remove upvalues */
-}
-#endif
-
-/* Call target function in protected mode with all supplied args.
- * Assumes target function only returns a single non-nil value.
- * Convert and return thrown errors as: nil, "error message" */
-static int json_protect_conversion(lua_State *l)
-{
-    int err;
-
-    /* Deliberately throw an error for invalid arguments */
-    luaL_argcheck(l, lua_gettop(l) == 1, 1, "expected 1 argument");
-
-    /* pcall() the function stored as upvalue(1) */
-    lua_pushvalue(l, lua_upvalueindex(1));
-    lua_insert(l, 1);
-    err = lua_pcall(l, 1, 1, 0);
-    if (!err)
-        return 1;
-
-    if (err == LUA_ERRRUN) {
-        lua_pushnil(l);
-        lua_insert(l, -2);
-        return 2;
-    }
-
-    /* Since we are not using a custom error handler, the only remaining
-     * errors are memory related */
-    return luaL_error(l, "Memory allocation error in CJSON protected call");
-}
-
-/* Return cjson module table */
-static int lua_cjson_new(lua_State *l)
-{
-    luaL_Reg reg[] = {
-        { "encode", json_encode },
-        { "decode", json_decode },
-        { "encode_sparse_array", json_cfg_encode_sparse_array },
-        { "encode_max_depth", json_cfg_encode_max_depth },
-        { "decode_max_depth", json_cfg_decode_max_depth },
-        { "encode_number_precision", json_cfg_encode_number_precision },
-        { "encode_keep_buffer", json_cfg_encode_keep_buffer },
-        { "encode_invalid_numbers", json_cfg_encode_invalid_numbers },
-        { "decode_invalid_numbers", json_cfg_decode_invalid_numbers },
-        { "new", lua_cjson_new },
-        { NULL, NULL }
-    };
-
-    /* Initialise number conversions */
-    fpconv_init();
-
-    /* cjson module table */
-    lua_newtable(l);
-
-    /* Register functions with config data as upvalue */
-    json_create_config(l);
-    luaL_setfuncs(l, reg, 1);
-
-    /* Set cjson.null */
-    lua_pushlightuserdata(l, NULL);
-    lua_setfield(l, -2, "null");
-
-    /* Set module name / version fields */
-    lua_pushliteral(l, CJSON_MODNAME);
-    lua_setfield(l, -2, "_NAME");
-    lua_pushliteral(l, CJSON_VERSION);
-    lua_setfield(l, -2, "_VERSION");
-
-    return 1;
-}
-
-/* Return cjson.safe module table */
-static int lua_cjson_safe_new(lua_State *l)
-{
-    const char *func[] = { "decode", "encode", NULL };
-    int i;
-
-    lua_cjson_new(l);
-
-    /* Fix new() method */
-    lua_pushcfunction(l, lua_cjson_safe_new);
-    lua_setfield(l, -2, "new");
-
-    for (i = 0; func[i]; i++) {
-        lua_getfield(l, -1, func[i]);
-        lua_pushcclosure(l, json_protect_conversion, 1);
-        lua_setfield(l, -2, func[i]);
-    }
-
-    return 1;
-}
-
-int luaopen_cjson(lua_State *l)
-{
-    lua_cjson_new(l);
-
-#ifdef ENABLE_CJSON_GLOBAL
-    /* Register a global "cjson" table. */
-    lua_pushvalue(l, -1);
-    lua_setglobal(l, CJSON_MODNAME);
-#endif
-
-    /* Return cjson table */
-    return 1;
-}
-
-int luaopen_cjson_safe(lua_State *l)
-{
-    lua_cjson_safe_new(l);
-
-    /* Return cjson.safe table */
-    return 1;
-}
-
-/* vi:ai et sw=4 ts=4:
- */
diff --git a/redis-stable/deps/lua/src/lua_cmsgpack.c b/redis-stable/deps/lua/src/lua_cmsgpack.c
deleted file mode 100644
index 89215479..00000000
--- a/redis-stable/deps/lua/src/lua_cmsgpack.c
+++ /dev/null
@@ -1,977 +0,0 @@
-#include <math.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <string.h>
-#include <assert.h>
-
-#include "lua.h"
-#include "lauxlib.h"
-
-#define LUACMSGPACK_NAME        "cmsgpack"
-#define LUACMSGPACK_SAFE_NAME   "cmsgpack_safe"
-#define LUACMSGPACK_VERSION     "lua-cmsgpack 0.4.0"
-#define LUACMSGPACK_COPYRIGHT   "Copyright (C) 2012, Salvatore Sanfilippo"
-#define LUACMSGPACK_DESCRIPTION "MessagePack C implementation for Lua"
-
-/* Allows a preprocessor directive to override MAX_NESTING */
-#ifndef LUACMSGPACK_MAX_NESTING
-    #define LUACMSGPACK_MAX_NESTING  16 /* Max tables nesting. */
-#endif
-
-/* Check if float or double can be an integer without loss of precision */
-#define IS_INT_TYPE_EQUIVALENT(x, T) (!isinf(x) && (T)(x) == (x))
-
-#define IS_INT64_EQUIVALENT(x) IS_INT_TYPE_EQUIVALENT(x, int64_t)
-#define IS_INT_EQUIVALENT(x) IS_INT_TYPE_EQUIVALENT(x, int)
-
-/* If size of pointer is equal to a 4 byte integer, we're on 32 bits. */
-#if UINTPTR_MAX == UINT_MAX
-    #define BITS_32 1
-#else
-    #define BITS_32 0
-#endif
-
-#if BITS_32
-    #define lua_pushunsigned(L, n) lua_pushnumber(L, n)
-#else
-    #define lua_pushunsigned(L, n) lua_pushinteger(L, n)
-#endif
-
-/* =============================================================================
- * MessagePack implementation and bindings for Lua 5.1/5.2.
- * Copyright(C) 2012 Salvatore Sanfilippo <antirez@gmail.com>
- *
- * http://github.com/antirez/lua-cmsgpack
- *
- * For MessagePack specification check the following web site:
- * http://wiki.msgpack.org/display/MSGPACK/Format+specification
- *
- * See Copyright Notice at the end of this file.
- *
- * CHANGELOG:
- * 19-Feb-2012 (ver 0.1.0): Initial release.
- * 20-Feb-2012 (ver 0.2.0): Tables encoding improved.
- * 20-Feb-2012 (ver 0.2.1): Minor bug fixing.
- * 20-Feb-2012 (ver 0.3.0): Module renamed lua-cmsgpack (was lua-msgpack).
- * 04-Apr-2014 (ver 0.3.1): Lua 5.2 support and minor bug fix.
- * 07-Apr-2014 (ver 0.4.0): Multiple pack/unpack, lua allocator, efficiency.
- * ========================================================================== */
-
-/* -------------------------- Endian conversion --------------------------------
- * We use it only for floats and doubles, all the other conversions performed
- * in an endian independent fashion. So the only thing we need is a function
- * that swaps a binary string if arch is little endian (and left it untouched
- * otherwise). */
-
-/* Reverse memory bytes if arch is little endian. Given the conceptual
- * simplicity of the Lua build system we prefer check for endianess at runtime.
- * The performance difference should be acceptable. */
-void memrevifle(void *ptr, size_t len) {
-    unsigned char   *p = (unsigned char *)ptr,
-                    *e = (unsigned char *)p+len-1,
-                    aux;
-    int test = 1;
-    unsigned char *testp = (unsigned char*) &test;
-
-    if (testp[0] == 0) return; /* Big endian, nothing to do. */
-    len /= 2;
-    while(len--) {
-        aux = *p;
-        *p = *e;
-        *e = aux;
-        p++;
-        e--;
-    }
-}
-
-/* ---------------------------- String buffer ----------------------------------
- * This is a simple implementation of string buffers. The only operation
- * supported is creating empty buffers and appending bytes to it.
- * The string buffer uses 2x preallocation on every realloc for O(N) append
- * behavior.  */
-
-typedef struct mp_buf {
-    unsigned char *b;
-    size_t len, free;
-} mp_buf;
-
-void *mp_realloc(lua_State *L, void *target, size_t osize,size_t nsize) {
-    void *(*local_realloc) (void *, void *, size_t osize, size_t nsize) = NULL;
-    void *ud;
-
-    local_realloc = lua_getallocf(L, &ud);
-
-    return local_realloc(ud, target, osize, nsize);
-}
-
-mp_buf *mp_buf_new(lua_State *L) {
-    mp_buf *buf = NULL;
-
-    /* Old size = 0; new size = sizeof(*buf) */
-    buf = (mp_buf*)mp_realloc(L, NULL, 0, sizeof(*buf));
-
-    buf->b = NULL;
-    buf->len = buf->free = 0;
-    return buf;
-}
-
-void mp_buf_append(lua_State *L, mp_buf *buf, const unsigned char *s, size_t len) {
-    if (buf->free < len) {
-        size_t newsize = (buf->len+len)*2;
-
-        buf->b = (unsigned char*)mp_realloc(L, buf->b, buf->len + buf->free, newsize);
-        buf->free = newsize - buf->len;
-    }
-    memcpy(buf->b+buf->len,s,len);
-    buf->len += len;
-    buf->free -= len;
-}
-
-void mp_buf_free(lua_State *L, mp_buf *buf) {
-    mp_realloc(L, buf->b, buf->len + buf->free, 0); /* realloc to 0 = free */
-    mp_realloc(L, buf, sizeof(*buf), 0);
-}
-
-/* ---------------------------- String cursor ----------------------------------
- * This simple data structure is used for parsing. Basically you create a cursor
- * using a string pointer and a length, then it is possible to access the
- * current string position with cursor->p, check the remaining length
- * in cursor->left, and finally consume more string using
- * mp_cur_consume(cursor,len), to advance 'p' and subtract 'left'.
- * An additional field cursor->error is set to zero on initialization and can
- * be used to report errors. */
-
-#define MP_CUR_ERROR_NONE   0
-#define MP_CUR_ERROR_EOF    1   /* Not enough data to complete operation. */
-#define MP_CUR_ERROR_BADFMT 2   /* Bad data format */
-
-typedef struct mp_cur {
-    const unsigned char *p;
-    size_t left;
-    int err;
-} mp_cur;
-
-void mp_cur_init(mp_cur *cursor, const unsigned char *s, size_t len) {
-    cursor->p = s;
-    cursor->left = len;
-    cursor->err = MP_CUR_ERROR_NONE;
-}
-
-#define mp_cur_consume(_c,_len) do { _c->p += _len; _c->left -= _len; } while(0)
-
-/* When there is not enough room we set an error in the cursor and return. This
- * is very common across the code so we have a macro to make the code look
- * a bit simpler. */
-#define mp_cur_need(_c,_len) do { \
-    if (_c->left < _len) { \
-        _c->err = MP_CUR_ERROR_EOF; \
-        return; \
-    } \
-} while(0)
-
-/* ------------------------- Low level MP encoding -------------------------- */
-
-void mp_encode_bytes(lua_State *L, mp_buf *buf, const unsigned char *s, size_t len) {
-    unsigned char hdr[5];
-    int hdrlen;
-
-    if (len < 32) {
-        hdr[0] = 0xa0 | (len&0xff); /* fix raw */
-        hdrlen = 1;
-    } else if (len <= 0xff) {
-        hdr[0] = 0xd9;
-        hdr[1] = len;
-        hdrlen = 2;
-    } else if (len <= 0xffff) {
-        hdr[0] = 0xda;
-        hdr[1] = (len&0xff00)>>8;
-        hdr[2] = len&0xff;
-        hdrlen = 3;
-    } else {
-        hdr[0] = 0xdb;
-        hdr[1] = (len&0xff000000)>>24;
-        hdr[2] = (len&0xff0000)>>16;
-        hdr[3] = (len&0xff00)>>8;
-        hdr[4] = len&0xff;
-        hdrlen = 5;
-    }
-    mp_buf_append(L,buf,hdr,hdrlen);
-    mp_buf_append(L,buf,s,len);
-}
-
-/* we assume IEEE 754 internal format for single and double precision floats. */
-void mp_encode_double(lua_State *L, mp_buf *buf, double d) {
-    unsigned char b[9];
-    float f = d;
-
-    assert(sizeof(f) == 4 && sizeof(d) == 8);
-    if (d == (double)f) {
-        b[0] = 0xca;    /* float IEEE 754 */
-        memcpy(b+1,&f,4);
-        memrevifle(b+1,4);
-        mp_buf_append(L,buf,b,5);
-    } else if (sizeof(d) == 8) {
-        b[0] = 0xcb;    /* double IEEE 754 */
-        memcpy(b+1,&d,8);
-        memrevifle(b+1,8);
-        mp_buf_append(L,buf,b,9);
-    }
-}
-
-void mp_encode_int(lua_State *L, mp_buf *buf, int64_t n) {
-    unsigned char b[9];
-    int enclen;
-
-    if (n >= 0) {
-        if (n <= 127) {
-            b[0] = n & 0x7f;    /* positive fixnum */
-            enclen = 1;
-        } else if (n <= 0xff) {
-            b[0] = 0xcc;        /* uint 8 */
-            b[1] = n & 0xff;
-            enclen = 2;
-        } else if (n <= 0xffff) {
-            b[0] = 0xcd;        /* uint 16 */
-            b[1] = (n & 0xff00) >> 8;
-            b[2] = n & 0xff;
-            enclen = 3;
-        } else if (n <= 0xffffffffLL) {
-            b[0] = 0xce;        /* uint 32 */
-            b[1] = (n & 0xff000000) >> 24;
-            b[2] = (n & 0xff0000) >> 16;
-            b[3] = (n & 0xff00) >> 8;
-            b[4] = n & 0xff;
-            enclen = 5;
-        } else {
-            b[0] = 0xcf;        /* uint 64 */
-            b[1] = (n & 0xff00000000000000LL) >> 56;
-            b[2] = (n & 0xff000000000000LL) >> 48;
-            b[3] = (n & 0xff0000000000LL) >> 40;
-            b[4] = (n & 0xff00000000LL) >> 32;
-            b[5] = (n & 0xff000000) >> 24;
-            b[6] = (n & 0xff0000) >> 16;
-            b[7] = (n & 0xff00) >> 8;
-            b[8] = n & 0xff;
-            enclen = 9;
-        }
-    } else {
-        if (n >= -32) {
-            b[0] = ((signed char)n);   /* negative fixnum */
-            enclen = 1;
-        } else if (n >= -128) {
-            b[0] = 0xd0;        /* int 8 */
-            b[1] = n & 0xff;
-            enclen = 2;
-        } else if (n >= -32768) {
-            b[0] = 0xd1;        /* int 16 */
-            b[1] = (n & 0xff00) >> 8;
-            b[2] = n & 0xff;
-            enclen = 3;
-        } else if (n >= -2147483648LL) {
-            b[0] = 0xd2;        /* int 32 */
-            b[1] = (n & 0xff000000) >> 24;
-            b[2] = (n & 0xff0000) >> 16;
-            b[3] = (n & 0xff00) >> 8;
-            b[4] = n & 0xff;
-            enclen = 5;
-        } else {
-            b[0] = 0xd3;        /* int 64 */
-            b[1] = (n & 0xff00000000000000LL) >> 56;
-            b[2] = (n & 0xff000000000000LL) >> 48;
-            b[3] = (n & 0xff0000000000LL) >> 40;
-            b[4] = (n & 0xff00000000LL) >> 32;
-            b[5] = (n & 0xff000000) >> 24;
-            b[6] = (n & 0xff0000) >> 16;
-            b[7] = (n & 0xff00) >> 8;
-            b[8] = n & 0xff;
-            enclen = 9;
-        }
-    }
-    mp_buf_append(L,buf,b,enclen);
-}
-
-void mp_encode_array(lua_State *L, mp_buf *buf, int64_t n) {
-    unsigned char b[5];
-    int enclen;
-
-    if (n <= 15) {
-        b[0] = 0x90 | (n & 0xf);    /* fix array */
-        enclen = 1;
-    } else if (n <= 65535) {
-        b[0] = 0xdc;                /* array 16 */
-        b[1] = (n & 0xff00) >> 8;
-        b[2] = n & 0xff;
-        enclen = 3;
-    } else {
-        b[0] = 0xdd;                /* array 32 */
-        b[1] = (n & 0xff000000) >> 24;
-        b[2] = (n & 0xff0000) >> 16;
-        b[3] = (n & 0xff00) >> 8;
-        b[4] = n & 0xff;
-        enclen = 5;
-    }
-    mp_buf_append(L,buf,b,enclen);
-}
-
-void mp_encode_map(lua_State *L, mp_buf *buf, int64_t n) {
-    unsigned char b[5];
-    int enclen;
-
-    if (n <= 15) {
-        b[0] = 0x80 | (n & 0xf);    /* fix map */
-        enclen = 1;
-    } else if (n <= 65535) {
-        b[0] = 0xde;                /* map 16 */
-        b[1] = (n & 0xff00) >> 8;
-        b[2] = n & 0xff;
-        enclen = 3;
-    } else {
-        b[0] = 0xdf;                /* map 32 */
-        b[1] = (n & 0xff000000) >> 24;
-        b[2] = (n & 0xff0000) >> 16;
-        b[3] = (n & 0xff00) >> 8;
-        b[4] = n & 0xff;
-        enclen = 5;
-    }
-    mp_buf_append(L,buf,b,enclen);
-}
-
-/* --------------------------- Lua types encoding --------------------------- */
-
-void mp_encode_lua_string(lua_State *L, mp_buf *buf) {
-    size_t len;
-    const char *s;
-
-    s = lua_tolstring(L,-1,&len);
-    mp_encode_bytes(L,buf,(const unsigned char*)s,len);
-}
-
-void mp_encode_lua_bool(lua_State *L, mp_buf *buf) {
-    unsigned char b = lua_toboolean(L,-1) ? 0xc3 : 0xc2;
-    mp_buf_append(L,buf,&b,1);
-}
-
-/* Lua 5.3 has a built in 64-bit integer type */
-void mp_encode_lua_integer(lua_State *L, mp_buf *buf) {
-#if (LUA_VERSION_NUM < 503) && BITS_32
-    lua_Number i = lua_tonumber(L,-1);
-#else
-    lua_Integer i = lua_tointeger(L,-1);
-#endif
-    mp_encode_int(L, buf, (int64_t)i);
-}
-
-/* Lua 5.2 and lower only has 64-bit doubles, so we need to
- * detect if the double may be representable as an int
- * for Lua < 5.3 */
-void mp_encode_lua_number(lua_State *L, mp_buf *buf) {
-    lua_Number n = lua_tonumber(L,-1);
-
-    if (IS_INT64_EQUIVALENT(n)) {
-        mp_encode_lua_integer(L, buf);
-    } else {
-        mp_encode_double(L,buf,(double)n);
-    }
-}
-
-void mp_encode_lua_type(lua_State *L, mp_buf *buf, int level);
-
-/* Convert a lua table into a message pack list. */
-void mp_encode_lua_table_as_array(lua_State *L, mp_buf *buf, int level) {
-#if LUA_VERSION_NUM < 502
-    size_t len = lua_objlen(L,-1), j;
-#else
-    size_t len = lua_rawlen(L,-1), j;
-#endif
-
-    mp_encode_array(L,buf,len);
-    luaL_checkstack(L, 1, "in function mp_encode_lua_table_as_array");
-    for (j = 1; j <= len; j++) {
-        lua_pushnumber(L,j);
-        lua_gettable(L,-2);
-        mp_encode_lua_type(L,buf,level+1);
-    }
-}
-
-/* Convert a lua table into a message pack key-value map. */
-void mp_encode_lua_table_as_map(lua_State *L, mp_buf *buf, int level) {
-    size_t len = 0;
-
-    /* First step: count keys into table. No other way to do it with the
-     * Lua API, we need to iterate a first time. Note that an alternative
-     * would be to do a single run, and then hack the buffer to insert the
-     * map opcodes for message pack. Too hackish for this lib. */
-    luaL_checkstack(L, 3, "in function mp_encode_lua_table_as_map");
-    lua_pushnil(L);
-    while(lua_next(L,-2)) {
-        lua_pop(L,1); /* remove value, keep key for next iteration. */
-        len++;
-    }
-
-    /* Step two: actually encoding of the map. */
-    mp_encode_map(L,buf,len);
-    lua_pushnil(L);
-    while(lua_next(L,-2)) {
-        /* Stack: ... key value */
-        lua_pushvalue(L,-2); /* Stack: ... key value key */
-        mp_encode_lua_type(L,buf,level+1); /* encode key */
-        mp_encode_lua_type(L,buf,level+1); /* encode val */
-    }
-}
-
-/* Returns true if the Lua table on top of the stack is exclusively composed
- * of keys from numerical keys from 1 up to N, with N being the total number
- * of elements, without any hole in the middle. */
-int table_is_an_array(lua_State *L) {
-    int count = 0, max = 0;
-#if LUA_VERSION_NUM < 503
-    lua_Number n;
-#else
-    lua_Integer n;
-#endif
-
-    /* Stack top on function entry */
-    int stacktop;
-
-    stacktop = lua_gettop(L);
-
-    lua_pushnil(L);
-    while(lua_next(L,-2)) {
-        /* Stack: ... key value */
-        lua_pop(L,1); /* Stack: ... key */
-        /* The <= 0 check is valid here because we're comparing indexes. */
-#if LUA_VERSION_NUM < 503
-        if ((LUA_TNUMBER != lua_type(L,-1)) || (n = lua_tonumber(L, -1)) <= 0 ||
-            !IS_INT_EQUIVALENT(n))
-#else
-        if (!lua_isinteger(L,-1) || (n = lua_tointeger(L, -1)) <= 0)
-#endif
-        {
-            lua_settop(L, stacktop);
-            return 0;
-        }
-        max = (n > max ? n : max);
-        count++;
-    }
-    /* We have the total number of elements in "count". Also we have
-     * the max index encountered in "max". We can't reach this code
-     * if there are indexes <= 0. If you also note that there can not be
-     * repeated keys into a table, you have that if max==count you are sure
-     * that there are all the keys form 1 to count (both included). */
-    lua_settop(L, stacktop);
-    return max == count;
-}
-
-/* If the length operator returns non-zero, that is, there is at least
- * an object at key '1', we serialize to message pack list. Otherwise
- * we use a map. */
-void mp_encode_lua_table(lua_State *L, mp_buf *buf, int level) {
-    if (table_is_an_array(L))
-        mp_encode_lua_table_as_array(L,buf,level);
-    else
-        mp_encode_lua_table_as_map(L,buf,level);
-}
-
-void mp_encode_lua_null(lua_State *L, mp_buf *buf) {
-    unsigned char b[1];
-
-    b[0] = 0xc0;
-    mp_buf_append(L,buf,b,1);
-}
-
-void mp_encode_lua_type(lua_State *L, mp_buf *buf, int level) {
-    int t = lua_type(L,-1);
-
-    /* Limit the encoding of nested tables to a specified maximum depth, so that
-     * we survive when called against circular references in tables. */
-    if (t == LUA_TTABLE && level == LUACMSGPACK_MAX_NESTING) t = LUA_TNIL;
-    switch(t) {
-    case LUA_TSTRING: mp_encode_lua_string(L,buf); break;
-    case LUA_TBOOLEAN: mp_encode_lua_bool(L,buf); break;
-    case LUA_TNUMBER:
-    #if LUA_VERSION_NUM < 503
-        mp_encode_lua_number(L,buf); break;
-    #else
-        if (lua_isinteger(L, -1)) {
-            mp_encode_lua_integer(L, buf);
-        } else {
-            mp_encode_lua_number(L, buf);
-        }
-        break;
-    #endif
-    case LUA_TTABLE: mp_encode_lua_table(L,buf,level); break;
-    default: mp_encode_lua_null(L,buf); break;
-    }
-    lua_pop(L,1);
-}
-
-/*
- * Packs all arguments as a stream for multiple upacking later.
- * Returns error if no arguments provided.
- */
-int mp_pack(lua_State *L) {
-    int nargs = lua_gettop(L);
-    int i;
-    mp_buf *buf;
-
-    if (nargs == 0)
-        return luaL_argerror(L, 0, "MessagePack pack needs input.");
-
-    if (!lua_checkstack(L, nargs))
-        return luaL_argerror(L, 0, "Too many arguments for MessagePack pack.");
-
-    buf = mp_buf_new(L);
-    for(i = 1; i <= nargs; i++) {
-        /* Copy argument i to top of stack for _encode processing;
-         * the encode function pops it from the stack when complete. */
-        luaL_checkstack(L, 1, "in function mp_check");
-        lua_pushvalue(L, i);
-
-        mp_encode_lua_type(L,buf,0);
-
-        lua_pushlstring(L,(char*)buf->b,buf->len);
-
-        /* Reuse the buffer for the next operation by
-         * setting its free count to the total buffer size
-         * and the current position to zero. */
-        buf->free += buf->len;
-        buf->len = 0;
-    }
-    mp_buf_free(L, buf);
-
-    /* Concatenate all nargs buffers together */
-    lua_concat(L, nargs);
-    return 1;
-}
-
-/* ------------------------------- Decoding --------------------------------- */
-
-void mp_decode_to_lua_type(lua_State *L, mp_cur *c);
-
-void mp_decode_to_lua_array(lua_State *L, mp_cur *c, size_t len) {
-    assert(len <= UINT_MAX);
-    int index = 1;
-
-    lua_newtable(L);
-    luaL_checkstack(L, 1, "in function mp_decode_to_lua_array");
-    while(len--) {
-        lua_pushnumber(L,index++);
-        mp_decode_to_lua_type(L,c);
-        if (c->err) return;
-        lua_settable(L,-3);
-    }
-}
-
-void mp_decode_to_lua_hash(lua_State *L, mp_cur *c, size_t len) {
-    assert(len <= UINT_MAX);
-    lua_newtable(L);
-    while(len--) {
-        mp_decode_to_lua_type(L,c); /* key */
-        if (c->err) return;
-        mp_decode_to_lua_type(L,c); /* value */
-        if (c->err) return;
-        lua_settable(L,-3);
-    }
-}
-
-/* Decode a Message Pack raw object pointed by the string cursor 'c' to
- * a Lua type, that is left as the only result on the stack. */
-void mp_decode_to_lua_type(lua_State *L, mp_cur *c) {
-    mp_cur_need(c,1);
-
-    /* If we return more than 18 elements, we must resize the stack to
-     * fit all our return values.  But, there is no way to
-     * determine how many objects a msgpack will unpack to up front, so
-     * we request a +1 larger stack on each iteration (noop if stack is
-     * big enough, and when stack does require resize it doubles in size) */
-    luaL_checkstack(L, 1,
-        "too many return values at once; "
-        "use unpack_one or unpack_limit instead.");
-
-    switch(c->p[0]) {
-    case 0xcc:  /* uint 8 */
-        mp_cur_need(c,2);
-        lua_pushunsigned(L,c->p[1]);
-        mp_cur_consume(c,2);
-        break;
-    case 0xd0:  /* int 8 */
-        mp_cur_need(c,2);
-        lua_pushinteger(L,(signed char)c->p[1]);
-        mp_cur_consume(c,2);
-        break;
-    case 0xcd:  /* uint 16 */
-        mp_cur_need(c,3);
-        lua_pushunsigned(L,
-            (c->p[1] << 8) |
-             c->p[2]);
-        mp_cur_consume(c,3);
-        break;
-    case 0xd1:  /* int 16 */
-        mp_cur_need(c,3);
-        lua_pushinteger(L,(int16_t)
-            (c->p[1] << 8) |
-             c->p[2]);
-        mp_cur_consume(c,3);
-        break;
-    case 0xce:  /* uint 32 */
-        mp_cur_need(c,5);
-        lua_pushunsigned(L,
-            ((uint32_t)c->p[1] << 24) |
-            ((uint32_t)c->p[2] << 16) |
-            ((uint32_t)c->p[3] << 8) |
-             (uint32_t)c->p[4]);
-        mp_cur_consume(c,5);
-        break;
-    case 0xd2:  /* int 32 */
-        mp_cur_need(c,5);
-        lua_pushinteger(L,
-            ((int32_t)c->p[1] << 24) |
-            ((int32_t)c->p[2] << 16) |
-            ((int32_t)c->p[3] << 8) |
-             (int32_t)c->p[4]);
-        mp_cur_consume(c,5);
-        break;
-    case 0xcf:  /* uint 64 */
-        mp_cur_need(c,9);
-        lua_pushunsigned(L,
-            ((uint64_t)c->p[1] << 56) |
-            ((uint64_t)c->p[2] << 48) |
-            ((uint64_t)c->p[3] << 40) |
-            ((uint64_t)c->p[4] << 32) |
-            ((uint64_t)c->p[5] << 24) |
-            ((uint64_t)c->p[6] << 16) |
-            ((uint64_t)c->p[7] << 8) |
-             (uint64_t)c->p[8]);
-        mp_cur_consume(c,9);
-        break;
-    case 0xd3:  /* int 64 */
-        mp_cur_need(c,9);
-#if LUA_VERSION_NUM < 503
-        lua_pushnumber(L,
-#else
-        lua_pushinteger(L,
-#endif
-            ((int64_t)c->p[1] << 56) |
-            ((int64_t)c->p[2] << 48) |
-            ((int64_t)c->p[3] << 40) |
-            ((int64_t)c->p[4] << 32) |
-            ((int64_t)c->p[5] << 24) |
-            ((int64_t)c->p[6] << 16) |
-            ((int64_t)c->p[7] << 8) |
-             (int64_t)c->p[8]);
-        mp_cur_consume(c,9);
-        break;
-    case 0xc0:  /* nil */
-        lua_pushnil(L);
-        mp_cur_consume(c,1);
-        break;
-    case 0xc3:  /* true */
-        lua_pushboolean(L,1);
-        mp_cur_consume(c,1);
-        break;
-    case 0xc2:  /* false */
-        lua_pushboolean(L,0);
-        mp_cur_consume(c,1);
-        break;
-    case 0xca:  /* float */
-        mp_cur_need(c,5);
-        assert(sizeof(float) == 4);
-        {
-            float f;
-            memcpy(&f,c->p+1,4);
-            memrevifle(&f,4);
-            lua_pushnumber(L,f);
-            mp_cur_consume(c,5);
-        }
-        break;
-    case 0xcb:  /* double */
-        mp_cur_need(c,9);
-        assert(sizeof(double) == 8);
-        {
-            double d;
-            memcpy(&d,c->p+1,8);
-            memrevifle(&d,8);
-            lua_pushnumber(L,d);
-            mp_cur_consume(c,9);
-        }
-        break;
-    case 0xd9:  /* raw 8 */
-        mp_cur_need(c,2);
-        {
-            size_t l = c->p[1];
-            mp_cur_need(c,2+l);
-            lua_pushlstring(L,(char*)c->p+2,l);
-            mp_cur_consume(c,2+l);
-        }
-        break;
-    case 0xda:  /* raw 16 */
-        mp_cur_need(c,3);
-        {
-            size_t l = (c->p[1] << 8) | c->p[2];
-            mp_cur_need(c,3+l);
-            lua_pushlstring(L,(char*)c->p+3,l);
-            mp_cur_consume(c,3+l);
-        }
-        break;
-    case 0xdb:  /* raw 32 */
-        mp_cur_need(c,5);
-        {
-            size_t l = ((size_t)c->p[1] << 24) |
-                       ((size_t)c->p[2] << 16) |
-                       ((size_t)c->p[3] << 8) |
-                       (size_t)c->p[4];
-            mp_cur_consume(c,5);
-            mp_cur_need(c,l);
-            lua_pushlstring(L,(char*)c->p,l);
-            mp_cur_consume(c,l);
-        }
-        break;
-    case 0xdc:  /* array 16 */
-        mp_cur_need(c,3);
-        {
-            size_t l = (c->p[1] << 8) | c->p[2];
-            mp_cur_consume(c,3);
-            mp_decode_to_lua_array(L,c,l);
-        }
-        break;
-    case 0xdd:  /* array 32 */
-        mp_cur_need(c,5);
-        {
-            size_t l = ((size_t)c->p[1] << 24) |
-                       ((size_t)c->p[2] << 16) |
-                       ((size_t)c->p[3] << 8) |
-                       (size_t)c->p[4];
-            mp_cur_consume(c,5);
-            mp_decode_to_lua_array(L,c,l);
-        }
-        break;
-    case 0xde:  /* map 16 */
-        mp_cur_need(c,3);
-        {
-            size_t l = (c->p[1] << 8) | c->p[2];
-            mp_cur_consume(c,3);
-            mp_decode_to_lua_hash(L,c,l);
-        }
-        break;
-    case 0xdf:  /* map 32 */
-        mp_cur_need(c,5);
-        {
-            size_t l = ((size_t)c->p[1] << 24) |
-                       ((size_t)c->p[2] << 16) |
-                       ((size_t)c->p[3] << 8) |
-                       (size_t)c->p[4];
-            mp_cur_consume(c,5);
-            mp_decode_to_lua_hash(L,c,l);
-        }
-        break;
-    default:    /* types that can't be idenitified by first byte value. */
-        if ((c->p[0] & 0x80) == 0) {   /* positive fixnum */
-            lua_pushunsigned(L,c->p[0]);
-            mp_cur_consume(c,1);
-        } else if ((c->p[0] & 0xe0) == 0xe0) {  /* negative fixnum */
-            lua_pushinteger(L,(signed char)c->p[0]);
-            mp_cur_consume(c,1);
-        } else if ((c->p[0] & 0xe0) == 0xa0) {  /* fix raw */
-            size_t l = c->p[0] & 0x1f;
-            mp_cur_need(c,1+l);
-            lua_pushlstring(L,(char*)c->p+1,l);
-            mp_cur_consume(c,1+l);
-        } else if ((c->p[0] & 0xf0) == 0x90) {  /* fix map */
-            size_t l = c->p[0] & 0xf;
-            mp_cur_consume(c,1);
-            mp_decode_to_lua_array(L,c,l);
-        } else if ((c->p[0] & 0xf0) == 0x80) {  /* fix map */
-            size_t l = c->p[0] & 0xf;
-            mp_cur_consume(c,1);
-            mp_decode_to_lua_hash(L,c,l);
-        } else {
-            c->err = MP_CUR_ERROR_BADFMT;
-        }
-    }
-}
-
-int mp_unpack_full(lua_State *L, int limit, int offset) {
-    size_t len;
-    const char *s;
-    mp_cur c;
-    int cnt; /* Number of objects unpacked */
-    int decode_all = (!limit && !offset);
-
-    s = luaL_checklstring(L,1,&len); /* if no match, exits */
-
-    if (offset < 0 || limit < 0) /* requesting negative off or lim is invalid */
-        return luaL_error(L,
-            "Invalid request to unpack with offset of %d and limit of %d.",
-            offset, len);
-    else if (offset > len)
-        return luaL_error(L,
-            "Start offset %d greater than input length %d.", offset, len);
-
-    if (decode_all) limit = INT_MAX;
-
-    mp_cur_init(&c,(const unsigned char *)s+offset,len-offset);
-
-    /* We loop over the decode because this could be a stream
-     * of multiple top-level values serialized together */
-    for(cnt = 0; c.left > 0 && cnt < limit; cnt++) {
-        mp_decode_to_lua_type(L,&c);
-
-        if (c.err == MP_CUR_ERROR_EOF) {
-            return luaL_error(L,"Missing bytes in input.");
-        } else if (c.err == MP_CUR_ERROR_BADFMT) {
-            return luaL_error(L,"Bad data format in input.");
-        }
-    }
-
-    if (!decode_all) {
-        /* c->left is the remaining size of the input buffer.
-         * subtract the entire buffer size from the unprocessed size
-         * to get our next start offset */
-        int offset = len - c.left;
-
-        luaL_checkstack(L, 1, "in function mp_unpack_full");
-
-        /* Return offset -1 when we have have processed the entire buffer. */
-        lua_pushinteger(L, c.left == 0 ? -1 : offset);
-        /* Results are returned with the arg elements still
-         * in place. Lua takes care of only returning
-         * elements above the args for us.
-         * In this case, we have one arg on the stack
-         * for this function, so we insert our first return
-         * value at position 2. */
-        lua_insert(L, 2);
-        cnt += 1; /* increase return count by one to make room for offset */
-    }
-
-    return cnt;
-}
-
-int mp_unpack(lua_State *L) {
-    return mp_unpack_full(L, 0, 0);
-}
-
-int mp_unpack_one(lua_State *L) {
-    int offset = luaL_optinteger(L, 2, 0);
-    /* Variable pop because offset may not exist */
-    lua_pop(L, lua_gettop(L)-1);
-    return mp_unpack_full(L, 1, offset);
-}
-
-int mp_unpack_limit(lua_State *L) {
-    int limit = luaL_checkinteger(L, 2);
-    int offset = luaL_optinteger(L, 3, 0);
-    /* Variable pop because offset may not exist */
-    lua_pop(L, lua_gettop(L)-1);
-
-    return mp_unpack_full(L, limit, offset);
-}
-
-int mp_safe(lua_State *L) {
-    int argc, err, total_results;
-
-    argc = lua_gettop(L);
-
-    /* This adds our function to the bottom of the stack
-     * (the "call this function" position) */
-    lua_pushvalue(L, lua_upvalueindex(1));
-    lua_insert(L, 1);
-
-    err = lua_pcall(L, argc, LUA_MULTRET, 0);
-    total_results = lua_gettop(L);
-
-    if (!err) {
-        return total_results;
-    } else {
-        lua_pushnil(L);
-        lua_insert(L,-2);
-        return 2;
-    }
-}
-
-/* -------------------------------------------------------------------------- */
-const struct luaL_Reg cmds[] = {
-    {"pack", mp_pack},
-    {"unpack", mp_unpack},
-    {"unpack_one", mp_unpack_one},
-    {"unpack_limit", mp_unpack_limit},
-    {0}
-};
-
-int luaopen_create(lua_State *L) {
-    int i;
-    /* Manually construct our module table instead of
-     * relying on _register or _newlib */
-    lua_newtable(L);
-
-    for (i = 0; i < (sizeof(cmds)/sizeof(*cmds) - 1); i++) {
-        lua_pushcfunction(L, cmds[i].func);
-        lua_setfield(L, -2, cmds[i].name);
-    }
-
-    /* Add metadata */
-    lua_pushliteral(L, LUACMSGPACK_NAME);
-    lua_setfield(L, -2, "_NAME");
-    lua_pushliteral(L, LUACMSGPACK_VERSION);
-    lua_setfield(L, -2, "_VERSION");
-    lua_pushliteral(L, LUACMSGPACK_COPYRIGHT);
-    lua_setfield(L, -2, "_COPYRIGHT");
-    lua_pushliteral(L, LUACMSGPACK_DESCRIPTION);
-    lua_setfield(L, -2, "_DESCRIPTION");
-    return 1;
-}
-
-LUALIB_API int luaopen_cmsgpack(lua_State *L) {
-    luaopen_create(L);
-
-#if LUA_VERSION_NUM < 502
-    /* Register name globally for 5.1 */
-    lua_pushvalue(L, -1);
-    lua_setglobal(L, LUACMSGPACK_NAME);
-#endif
-
-    return 1;
-}
-
-LUALIB_API int luaopen_cmsgpack_safe(lua_State *L) {
-    int i;
-
-    luaopen_cmsgpack(L);
-
-    /* Wrap all functions in the safe handler */
-    for (i = 0; i < (sizeof(cmds)/sizeof(*cmds) - 1); i++) {
-        lua_getfield(L, -1, cmds[i].name);
-        lua_pushcclosure(L, mp_safe, 1);
-        lua_setfield(L, -2, cmds[i].name);
-    }
-
-#if LUA_VERSION_NUM < 502
-    /* Register name globally for 5.1 */
-    lua_pushvalue(L, -1);
-    lua_setglobal(L, LUACMSGPACK_SAFE_NAME);
-#endif
-
-    return 1;
-}
-
-/******************************************************************************
-* Copyright (C) 2012 Salvatore Sanfilippo.  All rights reserved.
-*
-* Permission is hereby granted, free of charge, to any person obtaining
-* a copy of this software and associated documentation files (the
-* "Software"), to deal in the Software without restriction, including
-* without limitation the rights to use, copy, modify, merge, publish,
-* distribute, sublicense, and/or sell copies of the Software, and to
-* permit persons to whom the Software is furnished to do so, subject to
-* the following conditions:
-*
-* The above copyright notice and this permission notice shall be
-* included in all copies or substantial portions of the Software.
-*
-* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-******************************************************************************/
diff --git a/redis-stable/deps/lua/src/lua_struct.c b/redis-stable/deps/lua/src/lua_struct.c
deleted file mode 100644
index c58c8e72..00000000
--- a/redis-stable/deps/lua/src/lua_struct.c
+++ /dev/null
@@ -1,429 +0,0 @@
-/*
-** {======================================================
-** Library for packing/unpacking structures.
-** $Id: struct.c,v 1.7 2018/05/11 22:04:31 roberto Exp $
-** See Copyright Notice at the end of this file
-** =======================================================
-*/
-/*
-** Valid formats:
-** > - big endian
-** < - little endian
-** ![num] - alignment
-** x - pading
-** b/B - signed/unsigned byte
-** h/H - signed/unsigned short
-** l/L - signed/unsigned long
-** T   - size_t
-** i/In - signed/unsigned integer with size 'n' (default is size of int)
-** cn - sequence of 'n' chars (from/to a string); when packing, n==0 means
-        the whole string; when unpacking, n==0 means use the previous
-        read number as the string length
-** s - zero-terminated string
-** f - float
-** d - double
-** ' ' - ignored
-*/
-
-
-#include <assert.h>
-#include <ctype.h>
-#include <limits.h>
-#include <stddef.h>
-#include <string.h>
-
-
-#include "lua.h"
-#include "lauxlib.h"
-
-
-#if (LUA_VERSION_NUM >= 502)
-
-#define luaL_register(L,n,f)	luaL_newlib(L,f)
-
-#endif
-
-
-/* basic integer type */
-#if !defined(STRUCT_INT)
-#define STRUCT_INT	long
-#endif
-
-typedef STRUCT_INT Inttype;
-
-/* corresponding unsigned version */
-typedef unsigned STRUCT_INT Uinttype;
-
-
-/* maximum size (in bytes) for integral types */
-#define MAXINTSIZE	32
-
-/* is 'x' a power of 2? */
-#define isp2(x)		((x) > 0 && ((x) & ((x) - 1)) == 0)
-
-/* dummy structure to get alignment requirements */
-struct cD {
-  char c;
-  double d;
-};
-
-
-#define PADDING		(sizeof(struct cD) - sizeof(double))
-#define MAXALIGN  	(PADDING > sizeof(int) ? PADDING : sizeof(int))
-
-
-/* endian options */
-#define BIG	0
-#define LITTLE	1
-
-
-static union {
-  int dummy;
-  char endian;
-} const native = {1};
-
-
-typedef struct Header {
-  int endian;
-  int align;
-} Header;
-
-
-static int getnum (lua_State *L, const char **fmt, int df) {
-  if (!isdigit(**fmt))  /* no number? */
-    return df;  /* return default value */
-  else {
-    int a = 0;
-    do {
-      if (a > (INT_MAX / 10) || a * 10 > (INT_MAX - (**fmt - '0')))
-        luaL_error(L, "integral size overflow");
-      a = a*10 + *((*fmt)++) - '0';
-    } while (isdigit(**fmt));
-    return a;
-  }
-}
-
-
-#define defaultoptions(h)	((h)->endian = native.endian, (h)->align = 1)
-
-
-
-static size_t optsize (lua_State *L, char opt, const char **fmt) {
-  switch (opt) {
-    case 'B': case 'b': return sizeof(char);
-    case 'H': case 'h': return sizeof(short);
-    case 'L': case 'l': return sizeof(long);
-    case 'T': return sizeof(size_t);
-    case 'f':  return sizeof(float);
-    case 'd':  return sizeof(double);
-    case 'x': return 1;
-    case 'c': return getnum(L, fmt, 1);
-    case 'i': case 'I': {
-      int sz = getnum(L, fmt, sizeof(int));
-      if (sz > MAXINTSIZE)
-        luaL_error(L, "integral size %d is larger than limit of %d",
-                       sz, MAXINTSIZE);
-      return sz;
-    }
-    default: return 0;  /* other cases do not need alignment */
-  }
-}
-
-
-/*
-** return number of bytes needed to align an element of size 'size'
-** at current position 'len'
-*/
-static int gettoalign (size_t len, Header *h, int opt, size_t size) {
-  if (size == 0 || opt == 'c') return 0;
-  if (size > (size_t)h->align)
-    size = h->align;  /* respect max. alignment */
-  return (size - (len & (size - 1))) & (size - 1);
-}
-
-
-/*
-** options to control endianess and alignment
-*/
-static void controloptions (lua_State *L, int opt, const char **fmt,
-                            Header *h) {
-  switch (opt) {
-    case  ' ': return;  /* ignore white spaces */
-    case '>': h->endian = BIG; return;
-    case '<': h->endian = LITTLE; return;
-    case '!': {
-      int a = getnum(L, fmt, MAXALIGN);
-      if (!isp2(a))
-        luaL_error(L, "alignment %d is not a power of 2", a);
-      h->align = a;
-      return;
-    }
-    default: {
-      const char *msg = lua_pushfstring(L, "invalid format option '%c'", opt);
-      luaL_argerror(L, 1, msg);
-    }
-  }
-}
-
-
-static void putinteger (lua_State *L, luaL_Buffer *b, int arg, int endian,
-                        int size) {
-  lua_Number n = luaL_checknumber(L, arg);
-  Uinttype value;
-  char buff[MAXINTSIZE];
-  if (n < 0)
-    value = (Uinttype)(Inttype)n;
-  else
-    value = (Uinttype)n;
-  if (endian == LITTLE) {
-    int i;
-    for (i = 0; i < size; i++) {
-      buff[i] = (value & 0xff);
-      value >>= 8;
-    }
-  }
-  else {
-    int i;
-    for (i = size - 1; i >= 0; i--) {
-      buff[i] = (value & 0xff);
-      value >>= 8;
-    }
-  }
-  luaL_addlstring(b, buff, size);
-}
-
-
-static void correctbytes (char *b, int size, int endian) {
-  if (endian != native.endian) {
-    int i = 0;
-    while (i < --size) {
-      char temp = b[i];
-      b[i++] = b[size];
-      b[size] = temp;
-    }
-  }
-}
-
-
-static int b_pack (lua_State *L) {
-  luaL_Buffer b;
-  const char *fmt = luaL_checkstring(L, 1);
-  Header h;
-  int arg = 2;
-  size_t totalsize = 0;
-  defaultoptions(&h);
-  lua_pushnil(L);  /* mark to separate arguments from string buffer */
-  luaL_buffinit(L, &b);
-  while (*fmt != '\0') {
-    int opt = *fmt++;
-    size_t size = optsize(L, opt, &fmt);
-    int toalign = gettoalign(totalsize, &h, opt, size);
-    totalsize += toalign;
-    while (toalign-- > 0) luaL_addchar(&b, '\0');
-    switch (opt) {
-      case 'b': case 'B': case 'h': case 'H':
-      case 'l': case 'L': case 'T': case 'i': case 'I': {  /* integer types */
-        putinteger(L, &b, arg++, h.endian, size);
-        break;
-      }
-      case 'x': {
-        luaL_addchar(&b, '\0');
-        break;
-      }
-      case 'f': {
-        float f = (float)luaL_checknumber(L, arg++);
-        correctbytes((char *)&f, size, h.endian);
-        luaL_addlstring(&b, (char *)&f, size);
-        break;
-      }
-      case 'd': {
-        double d = luaL_checknumber(L, arg++);
-        correctbytes((char *)&d, size, h.endian);
-        luaL_addlstring(&b, (char *)&d, size);
-        break;
-      }
-      case 'c': case 's': {
-        size_t l;
-        const char *s = luaL_checklstring(L, arg++, &l);
-        if (size == 0) size = l;
-        luaL_argcheck(L, l >= (size_t)size, arg, "string too short");
-        luaL_addlstring(&b, s, size);
-        if (opt == 's') {
-          luaL_addchar(&b, '\0');  /* add zero at the end */
-          size++;
-        }
-        break;
-      }
-      default: controloptions(L, opt, &fmt, &h);
-    }
-    totalsize += size;
-  }
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static lua_Number getinteger (const char *buff, int endian,
-                        int issigned, int size) {
-  Uinttype l = 0;
-  int i;
-  if (endian == BIG) {
-    for (i = 0; i < size; i++) {
-      l <<= 8;
-      l |= (Uinttype)(unsigned char)buff[i];
-    }
-  }
-  else {
-    for (i = size - 1; i >= 0; i--) {
-      l <<= 8;
-      l |= (Uinttype)(unsigned char)buff[i];
-    }
-  }
-  if (!issigned)
-    return (lua_Number)l;
-  else {  /* signed format */
-    Uinttype mask = (Uinttype)(~((Uinttype)0)) << (size*8 - 1);
-    if (l & mask)  /* negative value? */
-      l |= mask;  /* signal extension */
-    return (lua_Number)(Inttype)l;
-  }
-}
-
-
-static int b_unpack (lua_State *L) {
-  Header h;
-  const char *fmt = luaL_checkstring(L, 1);
-  size_t ld;
-  const char *data = luaL_checklstring(L, 2, &ld);
-  size_t pos = luaL_optinteger(L, 3, 1);
-  luaL_argcheck(L, pos > 0, 3, "offset must be 1 or greater");
-  pos--; /* Lua indexes are 1-based, but here we want 0-based for C
-          * pointer math. */
-  int n = 0;  /* number of results */
-  defaultoptions(&h);
-  while (*fmt) {
-    int opt = *fmt++;
-    size_t size = optsize(L, opt, &fmt);
-    pos += gettoalign(pos, &h, opt, size);
-    luaL_argcheck(L, size <= ld && pos <= ld - size,
-                   2, "data string too short");
-    /* stack space for item + next position */
-    luaL_checkstack(L, 2, "too many results");
-    switch (opt) {
-      case 'b': case 'B': case 'h': case 'H':
-      case 'l': case 'L': case 'T': case 'i':  case 'I': {  /* integer types */
-        int issigned = islower(opt);
-        lua_Number res = getinteger(data+pos, h.endian, issigned, size);
-        lua_pushnumber(L, res); n++;
-        break;
-      }
-      case 'x': {
-        break;
-      }
-      case 'f': {
-        float f;
-        memcpy(&f, data+pos, size);
-        correctbytes((char *)&f, sizeof(f), h.endian);
-        lua_pushnumber(L, f); n++;
-        break;
-      }
-      case 'd': {
-        double d;
-        memcpy(&d, data+pos, size);
-        correctbytes((char *)&d, sizeof(d), h.endian);
-        lua_pushnumber(L, d); n++;
-        break;
-      }
-      case 'c': {
-        if (size == 0) {
-          if (n == 0 || !lua_isnumber(L, -1))
-            luaL_error(L, "format 'c0' needs a previous size");
-          size = lua_tonumber(L, -1);
-          lua_pop(L, 1); n--;
-          luaL_argcheck(L, size <= ld && pos <= ld - size,
-                           2, "data string too short");
-        }
-        lua_pushlstring(L, data+pos, size); n++;
-        break;
-      }
-      case 's': {
-        const char *e = (const char *)memchr(data+pos, '\0', ld - pos);
-        if (e == NULL)
-          luaL_error(L, "unfinished string in data");
-        size = (e - (data+pos)) + 1;
-        lua_pushlstring(L, data+pos, size - 1); n++;
-        break;
-      }
-      default: controloptions(L, opt, &fmt, &h);
-    }
-    pos += size;
-  }
-  lua_pushinteger(L, pos + 1);  /* next position */
-  return n + 1;
-}
-
-
-static int b_size (lua_State *L) {
-  Header h;
-  const char *fmt = luaL_checkstring(L, 1);
-  size_t pos = 0;
-  defaultoptions(&h);
-  while (*fmt) {
-    int opt = *fmt++;
-    size_t size = optsize(L, opt, &fmt);
-    pos += gettoalign(pos, &h, opt, size);
-    if (opt == 's')
-      luaL_argerror(L, 1, "option 's' has no fixed size");
-    else if (opt == 'c' && size == 0)
-      luaL_argerror(L, 1, "option 'c0' has no fixed size");
-    if (!isalnum(opt))
-      controloptions(L, opt, &fmt, &h);
-    pos += size;
-  }
-  lua_pushinteger(L, pos);
-  return 1;
-}
-
-/* }====================================================== */
-
-
-
-static const struct luaL_Reg thislib[] = {
-  {"pack", b_pack},
-  {"unpack", b_unpack},
-  {"size", b_size},
-  {NULL, NULL}
-};
-
-
-LUALIB_API int luaopen_struct (lua_State *L);
-
-LUALIB_API int luaopen_struct (lua_State *L) {
-  luaL_register(L, "struct", thislib);
-  return 1;
-}
-
-
-/******************************************************************************
-* Copyright (C) 2010-2018 Lua.org, PUC-Rio.  All rights reserved.
-*
-* Permission is hereby granted, free of charge, to any person obtaining
-* a copy of this software and associated documentation files (the
-* "Software"), to deal in the Software without restriction, including
-* without limitation the rights to use, copy, modify, merge, publish,
-* distribute, sublicense, and/or sell copies of the Software, and to
-* permit persons to whom the Software is furnished to do so, subject to
-* the following conditions:
-*
-* The above copyright notice and this permission notice shall be
-* included in all copies or substantial portions of the Software.
-*
-* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-******************************************************************************/
-
diff --git a/redis-stable/deps/lua/src/luac.c b/redis-stable/deps/lua/src/luac.c
deleted file mode 100644
index d0701739..00000000
--- a/redis-stable/deps/lua/src/luac.c
+++ /dev/null
@@ -1,200 +0,0 @@
-/*
-** $Id: luac.c,v 1.54 2006/06/02 17:37:11 lhf Exp $
-** Lua compiler (saves bytecodes to files; also list bytecodes)
-** See Copyright Notice in lua.h
-*/
-
-#include <errno.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define luac_c
-#define LUA_CORE
-
-#include "lua.h"
-#include "lauxlib.h"
-
-#include "ldo.h"
-#include "lfunc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lstring.h"
-#include "lundump.h"
-
-#define PROGNAME	"luac"		/* default program name */
-#define	OUTPUT		PROGNAME ".out"	/* default output file */
-
-static int listing=0;			/* list bytecodes? */
-static int dumping=1;			/* dump bytecodes? */
-static int stripping=0;			/* strip debug information? */
-static char Output[]={ OUTPUT };	/* default output file name */
-static const char* output=Output;	/* actual output file name */
-static const char* progname=PROGNAME;	/* actual program name */
-
-static void fatal(const char* message)
-{
- fprintf(stderr,"%s: %s\n",progname,message);
- exit(EXIT_FAILURE);
-}
-
-static void cannot(const char* what)
-{
- fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno));
- exit(EXIT_FAILURE);
-}
-
-static void usage(const char* message)
-{
- if (*message=='-')
-  fprintf(stderr,"%s: unrecognized option " LUA_QS "\n",progname,message);
- else
-  fprintf(stderr,"%s: %s\n",progname,message);
- fprintf(stderr,
- "usage: %s [options] [filenames].\n"
- "Available options are:\n"
- "  -        process stdin\n"
- "  -l       list\n"
- "  -o name  output to file " LUA_QL("name") " (default is \"%s\")\n"
- "  -p       parse only\n"
- "  -s       strip debug information\n"
- "  -v       show version information\n"
- "  --       stop handling options\n",
- progname,Output);
- exit(EXIT_FAILURE);
-}
-
-#define	IS(s)	(strcmp(argv[i],s)==0)
-
-static int doargs(int argc, char* argv[])
-{
- int i;
- int version=0;
- if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0];
- for (i=1; i<argc; i++)
- {
-  if (*argv[i]!='-')			/* end of options; keep it */
-   break;
-  else if (IS("--"))			/* end of options; skip it */
-  {
-   ++i;
-   if (version) ++version;
-   break;
-  }
-  else if (IS("-"))			/* end of options; use stdin */
-   break;
-  else if (IS("-l"))			/* list */
-   ++listing;
-  else if (IS("-o"))			/* output file */
-  {
-   output=argv[++i];
-   if (output==NULL || *output==0) usage(LUA_QL("-o") " needs argument");
-   if (IS("-")) output=NULL;
-  }
-  else if (IS("-p"))			/* parse only */
-   dumping=0;
-  else if (IS("-s"))			/* strip debug information */
-   stripping=1;
-  else if (IS("-v"))			/* show version */
-   ++version;
-  else					/* unknown option */
-   usage(argv[i]);
- }
- if (i==argc && (listing || !dumping))
- {
-  dumping=0;
-  argv[--i]=Output;
- }
- if (version)
- {
-  printf("%s  %s\n",LUA_RELEASE,LUA_COPYRIGHT);
-  if (version==argc-1) exit(EXIT_SUCCESS);
- }
- return i;
-}
-
-#define toproto(L,i) (clvalue(L->top+(i))->l.p)
-
-static const Proto* combine(lua_State* L, int n)
-{
- if (n==1)
-  return toproto(L,-1);
- else
- {
-  int i,pc;
-  Proto* f=luaF_newproto(L);
-  setptvalue2s(L,L->top,f); incr_top(L);
-  f->source=luaS_newliteral(L,"=(" PROGNAME ")");
-  f->maxstacksize=1;
-  pc=2*n+1;
-  f->code=luaM_newvector(L,pc,Instruction);
-  f->sizecode=pc;
-  f->p=luaM_newvector(L,n,Proto*);
-  f->sizep=n;
-  pc=0;
-  for (i=0; i<n; i++)
-  {
-   f->p[i]=toproto(L,i-n-1);
-   f->code[pc++]=CREATE_ABx(OP_CLOSURE,0,i);
-   f->code[pc++]=CREATE_ABC(OP_CALL,0,1,1);
-  }
-  f->code[pc++]=CREATE_ABC(OP_RETURN,0,1,0);
-  return f;
- }
-}
-
-static int writer(lua_State* L, const void* p, size_t size, void* u)
-{
- UNUSED(L);
- return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0);
-}
-
-struct Smain {
- int argc;
- char** argv;
-};
-
-static int pmain(lua_State* L)
-{
- struct Smain* s = (struct Smain*)lua_touserdata(L, 1);
- int argc=s->argc;
- char** argv=s->argv;
- const Proto* f;
- int i;
- if (!lua_checkstack(L,argc)) fatal("too many input files");
- for (i=0; i<argc; i++)
- {
-  const char* filename=IS("-") ? NULL : argv[i];
-  if (luaL_loadfile(L,filename)!=0) fatal(lua_tostring(L,-1));
- }
- f=combine(L,argc);
- if (listing) luaU_print(f,listing>1);
- if (dumping)
- {
-  FILE* D= (output==NULL) ? stdout : fopen(output,"wb");
-  if (D==NULL) cannot("open");
-  lua_lock(L);
-  luaU_dump(L,f,writer,D,stripping);
-  lua_unlock(L);
-  if (ferror(D)) cannot("write");
-  if (fclose(D)) cannot("close");
- }
- return 0;
-}
-
-int main(int argc, char* argv[])
-{
- lua_State* L;
- struct Smain s;
- int i=doargs(argc,argv);
- argc-=i; argv+=i;
- if (argc<=0) usage("no input files given");
- L=lua_open();
- if (L==NULL) fatal("not enough memory for state");
- s.argc=argc;
- s.argv=argv;
- if (lua_cpcall(L,pmain,&s)!=0) fatal(lua_tostring(L,-1));
- lua_close(L);
- return EXIT_SUCCESS;
-}
diff --git a/redis-stable/deps/lua/src/luaconf.h b/redis-stable/deps/lua/src/luaconf.h
deleted file mode 100644
index e2cb2616..00000000
--- a/redis-stable/deps/lua/src/luaconf.h
+++ /dev/null
@@ -1,763 +0,0 @@
-/*
-** $Id: luaconf.h,v 1.82.1.7 2008/02/11 16:25:08 roberto Exp $
-** Configuration file for Lua
-** See Copyright Notice in lua.h
-*/
-
-
-#ifndef lconfig_h
-#define lconfig_h
-
-#include <limits.h>
-#include <stddef.h>
-
-
-/*
-** ==================================================================
-** Search for "@@" to find all configurable definitions.
-** ===================================================================
-*/
-
-
-/*
-@@ LUA_ANSI controls the use of non-ansi features.
-** CHANGE it (define it) if you want Lua to avoid the use of any
-** non-ansi feature or library.
-*/
-#if defined(__STRICT_ANSI__)
-#define LUA_ANSI
-#endif
-
-
-#if !defined(LUA_ANSI) && defined(_WIN32)
-#define LUA_WIN
-#endif
-
-#if defined(LUA_USE_LINUX)
-#define LUA_USE_POSIX
-#define LUA_USE_DLOPEN		/* needs an extra library: -ldl */
-#define LUA_USE_READLINE	/* needs some extra libraries */
-#endif
-
-#if defined(LUA_USE_MACOSX)
-#define LUA_USE_POSIX
-#define LUA_DL_DYLD		/* does not need extra library */
-#endif
-
-
-
-/*
-@@ LUA_USE_POSIX includes all functionallity listed as X/Open System
-@* Interfaces Extension (XSI).
-** CHANGE it (define it) if your system is XSI compatible.
-*/
-#if defined(LUA_USE_POSIX)
-#define LUA_USE_MKSTEMP
-#define LUA_USE_ISATTY
-#define LUA_USE_POPEN
-#define LUA_USE_ULONGJMP
-#endif
-
-
-/*
-@@ LUA_PATH and LUA_CPATH are the names of the environment variables that
-@* Lua check to set its paths.
-@@ LUA_INIT is the name of the environment variable that Lua
-@* checks for initialization code.
-** CHANGE them if you want different names.
-*/
-#define LUA_PATH        "LUA_PATH"
-#define LUA_CPATH       "LUA_CPATH"
-#define LUA_INIT	"LUA_INIT"
-
-
-/*
-@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for
-@* Lua libraries.
-@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for
-@* C libraries.
-** CHANGE them if your machine has a non-conventional directory
-** hierarchy or if you want to install your libraries in
-** non-conventional directories.
-*/
-#if defined(_WIN32)
-/*
-** In Windows, any exclamation mark ('!') in the path is replaced by the
-** path of the directory of the executable file of the current process.
-*/
-#define LUA_LDIR	"!\\lua\\"
-#define LUA_CDIR	"!\\"
-#define LUA_PATH_DEFAULT  \
-		".\\?.lua;"  LUA_LDIR"?.lua;"  LUA_LDIR"?\\init.lua;" \
-		             LUA_CDIR"?.lua;"  LUA_CDIR"?\\init.lua"
-#define LUA_CPATH_DEFAULT \
-	".\\?.dll;"  LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll"
-
-#else
-#define LUA_ROOT	"/usr/local/"
-#define LUA_LDIR	LUA_ROOT "share/lua/5.1/"
-#define LUA_CDIR	LUA_ROOT "lib/lua/5.1/"
-#define LUA_PATH_DEFAULT  \
-		"./?.lua;"  LUA_LDIR"?.lua;"  LUA_LDIR"?/init.lua;" \
-		            LUA_CDIR"?.lua;"  LUA_CDIR"?/init.lua"
-#define LUA_CPATH_DEFAULT \
-	"./?.so;"  LUA_CDIR"?.so;" LUA_CDIR"loadall.so"
-#endif
-
-
-/*
-@@ LUA_DIRSEP is the directory separator (for submodules).
-** CHANGE it if your machine does not use "/" as the directory separator
-** and is not Windows. (On Windows Lua automatically uses "\".)
-*/
-#if defined(_WIN32)
-#define LUA_DIRSEP	"\\"
-#else
-#define LUA_DIRSEP	"/"
-#endif
-
-
-/*
-@@ LUA_PATHSEP is the character that separates templates in a path.
-@@ LUA_PATH_MARK is the string that marks the substitution points in a
-@* template.
-@@ LUA_EXECDIR in a Windows path is replaced by the executable's
-@* directory.
-@@ LUA_IGMARK is a mark to ignore all before it when bulding the
-@* luaopen_ function name.
-** CHANGE them if for some reason your system cannot use those
-** characters. (E.g., if one of those characters is a common character
-** in file/directory names.) Probably you do not need to change them.
-*/
-#define LUA_PATHSEP	";"
-#define LUA_PATH_MARK	"?"
-#define LUA_EXECDIR	"!"
-#define LUA_IGMARK	"-"
-
-
-/*
-@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger.
-** CHANGE that if ptrdiff_t is not adequate on your machine. (On most
-** machines, ptrdiff_t gives a good choice between int or long.)
-*/
-#define LUA_INTEGER	ptrdiff_t
-
-
-/*
-@@ LUA_API is a mark for all core API functions.
-@@ LUALIB_API is a mark for all standard library functions.
-** CHANGE them if you need to define those functions in some special way.
-** For instance, if you want to create one Windows DLL with the core and
-** the libraries, you may want to use the following definition (define
-** LUA_BUILD_AS_DLL to get it).
-*/
-#if defined(LUA_BUILD_AS_DLL)
-
-#if defined(LUA_CORE) || defined(LUA_LIB)
-#define LUA_API __declspec(dllexport)
-#else
-#define LUA_API __declspec(dllimport)
-#endif
-
-#else
-
-#define LUA_API		extern
-
-#endif
-
-/* more often than not the libs go together with the core */
-#define LUALIB_API	LUA_API
-
-
-/*
-@@ LUAI_FUNC is a mark for all extern functions that are not to be
-@* exported to outside modules.
-@@ LUAI_DATA is a mark for all extern (const) variables that are not to
-@* be exported to outside modules.
-** CHANGE them if you need to mark them in some special way. Elf/gcc
-** (versions 3.2 and later) mark them as "hidden" to optimize access
-** when Lua is compiled as a shared library.
-*/
-#if defined(luaall_c)
-#define LUAI_FUNC	static
-#define LUAI_DATA	/* empty */
-
-#elif defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \
-      defined(__ELF__)
-#define LUAI_FUNC	__attribute__((visibility("hidden"))) extern
-#define LUAI_DATA	LUAI_FUNC
-
-#else
-#define LUAI_FUNC	extern
-#define LUAI_DATA	extern
-#endif
-
-
-
-/*
-@@ LUA_QL describes how error messages quote program elements.
-** CHANGE it if you want a different appearance.
-*/
-#define LUA_QL(x)	"'" x "'"
-#define LUA_QS		LUA_QL("%s")
-
-
-/*
-@@ LUA_IDSIZE gives the maximum size for the description of the source
-@* of a function in debug information.
-** CHANGE it if you want a different size.
-*/
-#define LUA_IDSIZE	60
-
-
-/*
-** {==================================================================
-** Stand-alone configuration
-** ===================================================================
-*/
-
-#if defined(lua_c) || defined(luaall_c)
-
-/*
-@@ lua_stdin_is_tty detects whether the standard input is a 'tty' (that
-@* is, whether we're running lua interactively).
-** CHANGE it if you have a better definition for non-POSIX/non-Windows
-** systems.
-*/
-#if defined(LUA_USE_ISATTY)
-#include <unistd.h>
-#define lua_stdin_is_tty()	isatty(0)
-#elif defined(LUA_WIN)
-#include <io.h>
-#include <stdio.h>
-#define lua_stdin_is_tty()	_isatty(_fileno(stdin))
-#else
-#define lua_stdin_is_tty()	1  /* assume stdin is a tty */
-#endif
-
-
-/*
-@@ LUA_PROMPT is the default prompt used by stand-alone Lua.
-@@ LUA_PROMPT2 is the default continuation prompt used by stand-alone Lua.
-** CHANGE them if you want different prompts. (You can also change the
-** prompts dynamically, assigning to globals _PROMPT/_PROMPT2.)
-*/
-#define LUA_PROMPT		"> "
-#define LUA_PROMPT2		">> "
-
-
-/*
-@@ LUA_PROGNAME is the default name for the stand-alone Lua program.
-** CHANGE it if your stand-alone interpreter has a different name and
-** your system is not able to detect that name automatically.
-*/
-#define LUA_PROGNAME		"lua"
-
-
-/*
-@@ LUA_MAXINPUT is the maximum length for an input line in the
-@* stand-alone interpreter.
-** CHANGE it if you need longer lines.
-*/
-#define LUA_MAXINPUT	512
-
-
-/*
-@@ lua_readline defines how to show a prompt and then read a line from
-@* the standard input.
-@@ lua_saveline defines how to "save" a read line in a "history".
-@@ lua_freeline defines how to free a line read by lua_readline.
-** CHANGE them if you want to improve this functionality (e.g., by using
-** GNU readline and history facilities).
-*/
-#if defined(LUA_USE_READLINE)
-#include <stdio.h>
-#include <readline/readline.h>
-#include <readline/history.h>
-#define lua_readline(L,b,p)	((void)L, ((b)=readline(p)) != NULL)
-#define lua_saveline(L,idx) \
-	if (lua_strlen(L,idx) > 0)  /* non-empty line? */ \
-	  add_history(lua_tostring(L, idx));  /* add it to history */
-#define lua_freeline(L,b)	((void)L, free(b))
-#else
-#define lua_readline(L,b,p)	\
-	((void)L, fputs(p, stdout), fflush(stdout),  /* show prompt */ \
-	fgets(b, LUA_MAXINPUT, stdin) != NULL)  /* get line */
-#define lua_saveline(L,idx)	{ (void)L; (void)idx; }
-#define lua_freeline(L,b)	{ (void)L; (void)b; }
-#endif
-
-#endif
-
-/* }================================================================== */
-
-
-/*
-@@ LUAI_GCPAUSE defines the default pause between garbage-collector cycles
-@* as a percentage.
-** CHANGE it if you want the GC to run faster or slower (higher values
-** mean larger pauses which mean slower collection.) You can also change
-** this value dynamically.
-*/
-#define LUAI_GCPAUSE	200  /* 200% (wait memory to double before next GC) */
-
-
-/*
-@@ LUAI_GCMUL defines the default speed of garbage collection relative to
-@* memory allocation as a percentage.
-** CHANGE it if you want to change the granularity of the garbage
-** collection. (Higher values mean coarser collections. 0 represents
-** infinity, where each step performs a full collection.) You can also
-** change this value dynamically.
-*/
-#define LUAI_GCMUL	200 /* GC runs 'twice the speed' of memory allocation */
-
-
-
-/*
-@@ LUA_COMPAT_GETN controls compatibility with old getn behavior.
-** CHANGE it (define it) if you want exact compatibility with the
-** behavior of setn/getn in Lua 5.0.
-*/
-#undef LUA_COMPAT_GETN
-
-/*
-@@ LUA_COMPAT_LOADLIB controls compatibility about global loadlib.
-** CHANGE it to undefined as soon as you do not need a global 'loadlib'
-** function (the function is still available as 'package.loadlib').
-*/
-#undef LUA_COMPAT_LOADLIB
-
-/*
-@@ LUA_COMPAT_VARARG controls compatibility with old vararg feature.
-** CHANGE it to undefined as soon as your programs use only '...' to
-** access vararg parameters (instead of the old 'arg' table).
-*/
-#define LUA_COMPAT_VARARG
-
-/*
-@@ LUA_COMPAT_MOD controls compatibility with old math.mod function.
-** CHANGE it to undefined as soon as your programs use 'math.fmod' or
-** the new '%' operator instead of 'math.mod'.
-*/
-#define LUA_COMPAT_MOD
-
-/*
-@@ LUA_COMPAT_LSTR controls compatibility with old long string nesting
-@* facility.
-** CHANGE it to 2 if you want the old behaviour, or undefine it to turn
-** off the advisory error when nesting [[...]].
-*/
-#define LUA_COMPAT_LSTR		1
-
-/*
-@@ LUA_COMPAT_GFIND controls compatibility with old 'string.gfind' name.
-** CHANGE it to undefined as soon as you rename 'string.gfind' to
-** 'string.gmatch'.
-*/
-#define LUA_COMPAT_GFIND
-
-/*
-@@ LUA_COMPAT_OPENLIB controls compatibility with old 'luaL_openlib'
-@* behavior.
-** CHANGE it to undefined as soon as you replace to 'luaL_register'
-** your uses of 'luaL_openlib'
-*/
-#define LUA_COMPAT_OPENLIB
-
-
-
-/*
-@@ luai_apicheck is the assert macro used by the Lua-C API.
-** CHANGE luai_apicheck if you want Lua to perform some checks in the
-** parameters it gets from API calls. This may slow down the interpreter
-** a bit, but may be quite useful when debugging C code that interfaces
-** with Lua. A useful redefinition is to use assert.h.
-*/
-#if defined(LUA_USE_APICHECK)
-#include <assert.h>
-#define luai_apicheck(L,o)	{ (void)L; assert(o); }
-#else
-#define luai_apicheck(L,o)	{ (void)L; }
-#endif
-
-
-/*
-@@ LUAI_BITSINT defines the number of bits in an int.
-** CHANGE here if Lua cannot automatically detect the number of bits of
-** your machine. Probably you do not need to change this.
-*/
-/* avoid overflows in comparison */
-#if INT_MAX-20 < 32760
-#define LUAI_BITSINT	16
-#elif INT_MAX > 2147483640L
-/* int has at least 32 bits */
-#define LUAI_BITSINT	32
-#else
-#error "you must define LUA_BITSINT with number of bits in an integer"
-#endif
-
-
-/*
-@@ LUAI_UINT32 is an unsigned integer with at least 32 bits.
-@@ LUAI_INT32 is an signed integer with at least 32 bits.
-@@ LUAI_UMEM is an unsigned integer big enough to count the total
-@* memory used by Lua.
-@@ LUAI_MEM is a signed integer big enough to count the total memory
-@* used by Lua.
-** CHANGE here if for some weird reason the default definitions are not
-** good enough for your machine. (The definitions in the 'else'
-** part always works, but may waste space on machines with 64-bit
-** longs.) Probably you do not need to change this.
-*/
-#if LUAI_BITSINT >= 32
-#define LUAI_UINT32	unsigned int
-#define LUAI_INT32	int
-#define LUAI_MAXINT32	INT_MAX
-#define LUAI_UMEM	size_t
-#define LUAI_MEM	ptrdiff_t
-#else
-/* 16-bit ints */
-#define LUAI_UINT32	unsigned long
-#define LUAI_INT32	long
-#define LUAI_MAXINT32	LONG_MAX
-#define LUAI_UMEM	unsigned long
-#define LUAI_MEM	long
-#endif
-
-
-/*
-@@ LUAI_MAXCALLS limits the number of nested calls.
-** CHANGE it if you need really deep recursive calls. This limit is
-** arbitrary; its only purpose is to stop infinite recursion before
-** exhausting memory.
-*/
-#define LUAI_MAXCALLS	20000
-
-
-/*
-@@ LUAI_MAXCSTACK limits the number of Lua stack slots that a C function
-@* can use.
-** CHANGE it if you need lots of (Lua) stack space for your C
-** functions. This limit is arbitrary; its only purpose is to stop C
-** functions to consume unlimited stack space. (must be smaller than
-** -LUA_REGISTRYINDEX)
-*/
-#define LUAI_MAXCSTACK	8000
-
-
-
-/*
-** {==================================================================
-** CHANGE (to smaller values) the following definitions if your system
-** has a small C stack. (Or you may want to change them to larger
-** values if your system has a large C stack and these limits are
-** too rigid for you.) Some of these constants control the size of
-** stack-allocated arrays used by the compiler or the interpreter, while
-** others limit the maximum number of recursive calls that the compiler
-** or the interpreter can perform. Values too large may cause a C stack
-** overflow for some forms of deep constructs.
-** ===================================================================
-*/
-
-
-/*
-@@ LUAI_MAXCCALLS is the maximum depth for nested C calls (short) and
-@* syntactical nested non-terminals in a program.
-*/
-#define LUAI_MAXCCALLS		200
-
-
-/*
-@@ LUAI_MAXVARS is the maximum number of local variables per function
-@* (must be smaller than 250).
-*/
-#define LUAI_MAXVARS		200
-
-
-/*
-@@ LUAI_MAXUPVALUES is the maximum number of upvalues per function
-@* (must be smaller than 250).
-*/
-#define LUAI_MAXUPVALUES	60
-
-
-/*
-@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system.
-*/
-#define LUAL_BUFFERSIZE		BUFSIZ
-
-/* }================================================================== */
-
-
-
-
-/*
-** {==================================================================
-@@ LUA_NUMBER is the type of numbers in Lua.
-** CHANGE the following definitions only if you want to build Lua
-** with a number type different from double. You may also need to
-** change lua_number2int & lua_number2integer.
-** ===================================================================
-*/
-
-#define LUA_NUMBER_DOUBLE
-#define LUA_NUMBER	double
-
-/*
-@@ LUAI_UACNUMBER is the result of an 'usual argument conversion'
-@* over a number.
-*/
-#define LUAI_UACNUMBER	double
-
-
-/*
-@@ LUA_NUMBER_SCAN is the format for reading numbers.
-@@ LUA_NUMBER_FMT is the format for writing numbers.
-@@ lua_number2str converts a number to a string.
-@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion.
-@@ lua_str2number converts a string to a number.
-*/
-#define LUA_NUMBER_SCAN		"%lf"
-#define LUA_NUMBER_FMT		"%.14g"
-#define lua_number2str(s,n)	sprintf((s), LUA_NUMBER_FMT, (n))
-#define LUAI_MAXNUMBER2STR	32 /* 16 digits, sign, point, and \0 */
-#define lua_str2number(s,p)	strtod((s), (p))
-
-
-/*
-@@ The luai_num* macros define the primitive operations over numbers.
-*/
-#if defined(LUA_CORE)
-#include <math.h>
-#define luai_numadd(a,b)	((a)+(b))
-#define luai_numsub(a,b)	((a)-(b))
-#define luai_nummul(a,b)	((a)*(b))
-#define luai_numdiv(a,b)	((a)/(b))
-#define luai_nummod(a,b)	((a) - floor((a)/(b))*(b))
-#define luai_numpow(a,b)	(pow(a,b))
-#define luai_numunm(a)		(-(a))
-#define luai_numeq(a,b)		((a)==(b))
-#define luai_numlt(a,b)		((a)<(b))
-#define luai_numle(a,b)		((a)<=(b))
-#define luai_numisnan(a)	(!luai_numeq((a), (a)))
-#endif
-
-
-/*
-@@ lua_number2int is a macro to convert lua_Number to int.
-@@ lua_number2integer is a macro to convert lua_Number to lua_Integer.
-** CHANGE them if you know a faster way to convert a lua_Number to
-** int (with any rounding method and without throwing errors) in your
-** system. In Pentium machines, a naive typecast from double to int
-** in C is extremely slow, so any alternative is worth trying.
-*/
-
-/* On a Pentium, resort to a trick */
-#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) && !defined(__SSE2__) && \
-    (defined(__i386) || defined (_M_IX86) || defined(__i386__))
-
-/* On a Microsoft compiler, use assembler */
-#if defined(_MSC_VER)
-
-#define lua_number2int(i,d)   __asm fld d   __asm fistp i
-#define lua_number2integer(i,n)		lua_number2int(i, n)
-
-/* the next trick should work on any Pentium, but sometimes clashes
-   with a DirectX idiosyncrasy */
-#else
-
-union luai_Cast { double l_d; long l_l; };
-#define lua_number2int(i,d) \
-  { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; }
-#define lua_number2integer(i,n)		lua_number2int(i, n)
-
-#endif
-
-
-/* this option always works, but may be slow */
-#else
-#define lua_number2int(i,d)	((i)=(int)(d))
-#define lua_number2integer(i,d)	((i)=(lua_Integer)(d))
-
-#endif
-
-/* }================================================================== */
-
-
-/*
-@@ LUAI_USER_ALIGNMENT_T is a type that requires maximum alignment.
-** CHANGE it if your system requires alignments larger than double. (For
-** instance, if your system supports long doubles and they must be
-** aligned in 16-byte boundaries, then you should add long double in the
-** union.) Probably you do not need to change this.
-*/
-#define LUAI_USER_ALIGNMENT_T	union { double u; void *s; long l; }
-
-
-/*
-@@ LUAI_THROW/LUAI_TRY define how Lua does exception handling.
-** CHANGE them if you prefer to use longjmp/setjmp even with C++
-** or if want/don't to use _longjmp/_setjmp instead of regular
-** longjmp/setjmp. By default, Lua handles errors with exceptions when
-** compiling as C++ code, with _longjmp/_setjmp when asked to use them,
-** and with longjmp/setjmp otherwise.
-*/
-#if defined(__cplusplus)
-/* C++ exceptions */
-#define LUAI_THROW(L,c)	throw(c)
-#define LUAI_TRY(L,c,a)	try { a } catch(...) \
-	{ if ((c)->status == 0) (c)->status = -1; }
-#define luai_jmpbuf	int  /* dummy variable */
-
-#elif defined(LUA_USE_ULONGJMP)
-/* in Unix, try _longjmp/_setjmp (more efficient) */
-#define LUAI_THROW(L,c)	_longjmp((c)->b, 1)
-#define LUAI_TRY(L,c,a)	if (_setjmp((c)->b) == 0) { a }
-#define luai_jmpbuf	jmp_buf
-
-#else
-/* default handling with long jumps */
-#define LUAI_THROW(L,c)	longjmp((c)->b, 1)
-#define LUAI_TRY(L,c,a)	if (setjmp((c)->b) == 0) { a }
-#define luai_jmpbuf	jmp_buf
-
-#endif
-
-
-/*
-@@ LUA_MAXCAPTURES is the maximum number of captures that a pattern
-@* can do during pattern-matching.
-** CHANGE it if you need more captures. This limit is arbitrary.
-*/
-#define LUA_MAXCAPTURES		32
-
-
-/*
-@@ lua_tmpnam is the function that the OS library uses to create a
-@* temporary name.
-@@ LUA_TMPNAMBUFSIZE is the maximum size of a name created by lua_tmpnam.
-** CHANGE them if you have an alternative to tmpnam (which is considered
-** insecure) or if you want the original tmpnam anyway.  By default, Lua
-** uses tmpnam except when POSIX is available, where it uses mkstemp.
-*/
-#if defined(loslib_c) || defined(luaall_c)
-
-#if defined(LUA_USE_MKSTEMP)
-#include <unistd.h>
-#define LUA_TMPNAMBUFSIZE	32
-#define lua_tmpnam(b,e)	{ \
-	strcpy(b, "/tmp/lua_XXXXXX"); \
-	e = mkstemp(b); \
-	if (e != -1) close(e); \
-	e = (e == -1); }
-
-#else
-#define LUA_TMPNAMBUFSIZE	L_tmpnam
-#define lua_tmpnam(b,e)		{ e = (tmpnam(b) == NULL); }
-#endif
-
-#endif
-
-
-/*
-@@ lua_popen spawns a new process connected to the current one through
-@* the file streams.
-** CHANGE it if you have a way to implement it in your system.
-*/
-#if defined(LUA_USE_POPEN)
-
-#define lua_popen(L,c,m)	((void)L, fflush(NULL), popen(c,m))
-#define lua_pclose(L,file)	((void)L, (pclose(file) != -1))
-
-#elif defined(LUA_WIN)
-
-#define lua_popen(L,c,m)	((void)L, _popen(c,m))
-#define lua_pclose(L,file)	((void)L, (_pclose(file) != -1))
-
-#else
-
-#define lua_popen(L,c,m)	((void)((void)c, m),  \
-		luaL_error(L, LUA_QL("popen") " not supported"), (FILE*)0)
-#define lua_pclose(L,file)		((void)((void)L, file), 0)
-
-#endif
-
-/*
-@@ LUA_DL_* define which dynamic-library system Lua should use.
-** CHANGE here if Lua has problems choosing the appropriate
-** dynamic-library system for your platform (either Windows' DLL, Mac's
-** dyld, or Unix's dlopen). If your system is some kind of Unix, there
-** is a good chance that it has dlopen, so LUA_DL_DLOPEN will work for
-** it.  To use dlopen you also need to adapt the src/Makefile (probably
-** adding -ldl to the linker options), so Lua does not select it
-** automatically.  (When you change the makefile to add -ldl, you must
-** also add -DLUA_USE_DLOPEN.)
-** If you do not want any kind of dynamic library, undefine all these
-** options.
-** By default, _WIN32 gets LUA_DL_DLL and MAC OS X gets LUA_DL_DYLD.
-*/
-#if defined(LUA_USE_DLOPEN)
-#define LUA_DL_DLOPEN
-#endif
-
-#if defined(LUA_WIN)
-#define LUA_DL_DLL
-#endif
-
-
-/*
-@@ LUAI_EXTRASPACE allows you to add user-specific data in a lua_State
-@* (the data goes just *before* the lua_State pointer).
-** CHANGE (define) this if you really need that. This value must be
-** a multiple of the maximum alignment required for your machine.
-*/
-#define LUAI_EXTRASPACE		0
-
-
-/*
-@@ luai_userstate* allow user-specific actions on threads.
-** CHANGE them if you defined LUAI_EXTRASPACE and need to do something
-** extra when a thread is created/deleted/resumed/yielded.
-*/
-#define luai_userstateopen(L)		((void)L)
-#define luai_userstateclose(L)		((void)L)
-#define luai_userstatethread(L,L1)	((void)L)
-#define luai_userstatefree(L)		((void)L)
-#define luai_userstateresume(L,n)	((void)L)
-#define luai_userstateyield(L,n)	((void)L)
-
-
-/*
-@@ LUA_INTFRMLEN is the length modifier for integer conversions
-@* in 'string.format'.
-@@ LUA_INTFRM_T is the integer type correspoding to the previous length
-@* modifier.
-** CHANGE them if your system supports long long or does not support long.
-*/
-
-#if defined(LUA_USELONGLONG)
-
-#define LUA_INTFRMLEN		"ll"
-#define LUA_INTFRM_T		long long
-
-#else
-
-#define LUA_INTFRMLEN		"l"
-#define LUA_INTFRM_T		long
-
-#endif
-
-
-
-/* =================================================================== */
-
-/*
-** Local configuration. You can use this space to add your redefinitions
-** without modifying the main part of the file.
-*/
-
-
-
-#endif
-
diff --git a/redis-stable/deps/lua/src/lualib.h b/redis-stable/deps/lua/src/lualib.h
deleted file mode 100644
index 469417f6..00000000
--- a/redis-stable/deps/lua/src/lualib.h
+++ /dev/null
@@ -1,53 +0,0 @@
-/*
-** $Id: lualib.h,v 1.36.1.1 2007/12/27 13:02:25 roberto Exp $
-** Lua standard libraries
-** See Copyright Notice in lua.h
-*/
-
-
-#ifndef lualib_h
-#define lualib_h
-
-#include "lua.h"
-
-
-/* Key to file-handle type */
-#define LUA_FILEHANDLE		"FILE*"
-
-
-#define LUA_COLIBNAME	"coroutine"
-LUALIB_API int (luaopen_base) (lua_State *L);
-
-#define LUA_TABLIBNAME	"table"
-LUALIB_API int (luaopen_table) (lua_State *L);
-
-#define LUA_IOLIBNAME	"io"
-LUALIB_API int (luaopen_io) (lua_State *L);
-
-#define LUA_OSLIBNAME	"os"
-LUALIB_API int (luaopen_os) (lua_State *L);
-
-#define LUA_STRLIBNAME	"string"
-LUALIB_API int (luaopen_string) (lua_State *L);
-
-#define LUA_MATHLIBNAME	"math"
-LUALIB_API int (luaopen_math) (lua_State *L);
-
-#define LUA_DBLIBNAME	"debug"
-LUALIB_API int (luaopen_debug) (lua_State *L);
-
-#define LUA_LOADLIBNAME	"package"
-LUALIB_API int (luaopen_package) (lua_State *L);
-
-
-/* open all previous libraries */
-LUALIB_API void (luaL_openlibs) (lua_State *L); 
-
-
-
-#ifndef lua_assert
-#define lua_assert(x)	((void)0)
-#endif
-
-
-#endif
diff --git a/redis-stable/deps/lua/src/lundump.c b/redis-stable/deps/lua/src/lundump.c
deleted file mode 100644
index 8010a457..00000000
--- a/redis-stable/deps/lua/src/lundump.c
+++ /dev/null
@@ -1,227 +0,0 @@
-/*
-** $Id: lundump.c,v 2.7.1.4 2008/04/04 19:51:41 roberto Exp $
-** load precompiled Lua chunks
-** See Copyright Notice in lua.h
-*/
-
-#include <string.h>
-
-#define lundump_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lmem.h"
-#include "lobject.h"
-#include "lstring.h"
-#include "lundump.h"
-#include "lzio.h"
-
-typedef struct {
- lua_State* L;
- ZIO* Z;
- Mbuffer* b;
- const char* name;
-} LoadState;
-
-#ifdef LUAC_TRUST_BINARIES
-#define IF(c,s)
-#define error(S,s)
-#else
-#define IF(c,s)		if (c) error(S,s)
-
-static void error(LoadState* S, const char* why)
-{
- luaO_pushfstring(S->L,"%s: %s in precompiled chunk",S->name,why);
- luaD_throw(S->L,LUA_ERRSYNTAX);
-}
-#endif
-
-#define LoadMem(S,b,n,size)	LoadBlock(S,b,(n)*(size))
-#define	LoadByte(S)		(lu_byte)LoadChar(S)
-#define LoadVar(S,x)		LoadMem(S,&x,1,sizeof(x))
-#define LoadVector(S,b,n,size)	LoadMem(S,b,n,size)
-
-static void LoadBlock(LoadState* S, void* b, size_t size)
-{
- size_t r=luaZ_read(S->Z,b,size);
- IF (r!=0, "unexpected end");
-}
-
-static int LoadChar(LoadState* S)
-{
- char x;
- LoadVar(S,x);
- return x;
-}
-
-static int LoadInt(LoadState* S)
-{
- int x;
- LoadVar(S,x);
- IF (x<0, "bad integer");
- return x;
-}
-
-static lua_Number LoadNumber(LoadState* S)
-{
- lua_Number x;
- LoadVar(S,x);
- return x;
-}
-
-static TString* LoadString(LoadState* S)
-{
- size_t size;
- LoadVar(S,size);
- if (size==0)
-  return NULL;
- else
- {
-  char* s=luaZ_openspace(S->L,S->b,size);
-  LoadBlock(S,s,size);
-  return luaS_newlstr(S->L,s,size-1);		/* remove trailing '\0' */
- }
-}
-
-static void LoadCode(LoadState* S, Proto* f)
-{
- int n=LoadInt(S);
- f->code=luaM_newvector(S->L,n,Instruction);
- f->sizecode=n;
- LoadVector(S,f->code,n,sizeof(Instruction));
-}
-
-static Proto* LoadFunction(LoadState* S, TString* p);
-
-static void LoadConstants(LoadState* S, Proto* f)
-{
- int i,n;
- n=LoadInt(S);
- f->k=luaM_newvector(S->L,n,TValue);
- f->sizek=n;
- for (i=0; i<n; i++) setnilvalue(&f->k[i]);
- for (i=0; i<n; i++)
- {
-  TValue* o=&f->k[i];
-  int t=LoadChar(S);
-  switch (t)
-  {
-   case LUA_TNIL:
-   	setnilvalue(o);
-	break;
-   case LUA_TBOOLEAN:
-   	setbvalue(o,LoadChar(S)!=0);
-	break;
-   case LUA_TNUMBER:
-	setnvalue(o,LoadNumber(S));
-	break;
-   case LUA_TSTRING:
-	setsvalue2n(S->L,o,LoadString(S));
-	break;
-   default:
-	error(S,"bad constant");
-	break;
-  }
- }
- n=LoadInt(S);
- f->p=luaM_newvector(S->L,n,Proto*);
- f->sizep=n;
- for (i=0; i<n; i++) f->p[i]=NULL;
- for (i=0; i<n; i++) f->p[i]=LoadFunction(S,f->source);
-}
-
-static void LoadDebug(LoadState* S, Proto* f)
-{
- int i,n;
- n=LoadInt(S);
- f->lineinfo=luaM_newvector(S->L,n,int);
- f->sizelineinfo=n;
- LoadVector(S,f->lineinfo,n,sizeof(int));
- n=LoadInt(S);
- f->locvars=luaM_newvector(S->L,n,LocVar);
- f->sizelocvars=n;
- for (i=0; i<n; i++) f->locvars[i].varname=NULL;
- for (i=0; i<n; i++)
- {
-  f->locvars[i].varname=LoadString(S);
-  f->locvars[i].startpc=LoadInt(S);
-  f->locvars[i].endpc=LoadInt(S);
- }
- n=LoadInt(S);
- f->upvalues=luaM_newvector(S->L,n,TString*);
- f->sizeupvalues=n;
- for (i=0; i<n; i++) f->upvalues[i]=NULL;
- for (i=0; i<n; i++) f->upvalues[i]=LoadString(S);
-}
-
-static Proto* LoadFunction(LoadState* S, TString* p)
-{
- Proto* f;
- if (++S->L->nCcalls > LUAI_MAXCCALLS) error(S,"code too deep");
- f=luaF_newproto(S->L);
- setptvalue2s(S->L,S->L->top,f); incr_top(S->L);
- f->source=LoadString(S); if (f->source==NULL) f->source=p;
- f->linedefined=LoadInt(S);
- f->lastlinedefined=LoadInt(S);
- f->nups=LoadByte(S);
- f->numparams=LoadByte(S);
- f->is_vararg=LoadByte(S);
- f->maxstacksize=LoadByte(S);
- LoadCode(S,f);
- LoadConstants(S,f);
- LoadDebug(S,f);
- IF (!luaG_checkcode(f), "bad code");
- S->L->top--;
- S->L->nCcalls--;
- return f;
-}
-
-static void LoadHeader(LoadState* S)
-{
- char h[LUAC_HEADERSIZE];
- char s[LUAC_HEADERSIZE];
- luaU_header(h);
- LoadBlock(S,s,LUAC_HEADERSIZE);
- IF (memcmp(h,s,LUAC_HEADERSIZE)!=0, "bad header");
-}
-
-/*
-** load precompiled chunk
-*/
-Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name)
-{
- LoadState S;
- if (*name=='@' || *name=='=')
-  S.name=name+1;
- else if (*name==LUA_SIGNATURE[0])
-  S.name="binary string";
- else
-  S.name=name;
- S.L=L;
- S.Z=Z;
- S.b=buff;
- LoadHeader(&S);
- return LoadFunction(&S,luaS_newliteral(L,"=?"));
-}
-
-/*
-* make header
-*/
-void luaU_header (char* h)
-{
- int x=1;
- memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-1);
- h+=sizeof(LUA_SIGNATURE)-1;
- *h++=(char)LUAC_VERSION;
- *h++=(char)LUAC_FORMAT;
- *h++=(char)*(char*)&x;				/* endianness */
- *h++=(char)sizeof(int);
- *h++=(char)sizeof(size_t);
- *h++=(char)sizeof(Instruction);
- *h++=(char)sizeof(lua_Number);
- *h++=(char)(((lua_Number)0.5)==0);		/* is lua_Number integral? */
-}
diff --git a/redis-stable/deps/lua/src/lundump.h b/redis-stable/deps/lua/src/lundump.h
deleted file mode 100644
index c80189db..00000000
--- a/redis-stable/deps/lua/src/lundump.h
+++ /dev/null
@@ -1,36 +0,0 @@
-/*
-** $Id: lundump.h,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $
-** load precompiled Lua chunks
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lundump_h
-#define lundump_h
-
-#include "lobject.h"
-#include "lzio.h"
-
-/* load one chunk; from lundump.c */
-LUAI_FUNC Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name);
-
-/* make header; from lundump.c */
-LUAI_FUNC void luaU_header (char* h);
-
-/* dump one chunk; from ldump.c */
-LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip);
-
-#ifdef luac_c
-/* print one chunk; from print.c */
-LUAI_FUNC void luaU_print (const Proto* f, int full);
-#endif
-
-/* for header of binary files -- this is Lua 5.1 */
-#define LUAC_VERSION		0x51
-
-/* for header of binary files -- this is the official format */
-#define LUAC_FORMAT		0
-
-/* size of header of binary files */
-#define LUAC_HEADERSIZE		12
-
-#endif
diff --git a/redis-stable/deps/lua/src/lvm.c b/redis-stable/deps/lua/src/lvm.c
deleted file mode 100644
index e0a0cd85..00000000
--- a/redis-stable/deps/lua/src/lvm.c
+++ /dev/null
@@ -1,767 +0,0 @@
-/*
-** $Id: lvm.c,v 2.63.1.5 2011/08/17 20:43:11 roberto Exp $
-** Lua virtual machine
-** See Copyright Notice in lua.h
-*/
-
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define lvm_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "ldebug.h"
-#include "ldo.h"
-#include "lfunc.h"
-#include "lgc.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lstate.h"
-#include "lstring.h"
-#include "ltable.h"
-#include "ltm.h"
-#include "lvm.h"
-
-
-
-/* limit for table tag-method chains (to avoid loops) */
-#define MAXTAGLOOP	100
-
-
-const TValue *luaV_tonumber (const TValue *obj, TValue *n) {
-  lua_Number num;
-  if (ttisnumber(obj)) return obj;
-  if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {
-    setnvalue(n, num);
-    return n;
-  }
-  else
-    return NULL;
-}
-
-
-int luaV_tostring (lua_State *L, StkId obj) {
-  if (!ttisnumber(obj))
-    return 0;
-  else {
-    char s[LUAI_MAXNUMBER2STR];
-    lua_Number n = nvalue(obj);
-    lua_number2str(s, n);
-    setsvalue2s(L, obj, luaS_new(L, s));
-    return 1;
-  }
-}
-
-
-static void traceexec (lua_State *L, const Instruction *pc) {
-  lu_byte mask = L->hookmask;
-  const Instruction *oldpc = L->savedpc;
-  L->savedpc = pc;
-  if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
-    resethookcount(L);
-    luaD_callhook(L, LUA_HOOKCOUNT, -1);
-  }
-  if (mask & LUA_MASKLINE) {
-    Proto *p = ci_func(L->ci)->l.p;
-    int npc = pcRel(pc, p);
-    int newline = getline(p, npc);
-    /* call linehook when enter a new function, when jump back (loop),
-       or when enter a new line */
-    if (npc == 0 || pc <= oldpc || newline != getline(p, pcRel(oldpc, p)))
-      luaD_callhook(L, LUA_HOOKLINE, newline);
-  }
-}
-
-
-static void callTMres (lua_State *L, StkId res, const TValue *f,
-                        const TValue *p1, const TValue *p2) {
-  ptrdiff_t result = savestack(L, res);
-  setobj2s(L, L->top, f);  /* push function */
-  setobj2s(L, L->top+1, p1);  /* 1st argument */
-  setobj2s(L, L->top+2, p2);  /* 2nd argument */
-  luaD_checkstack(L, 3);
-  L->top += 3;
-  luaD_call(L, L->top - 3, 1);
-  res = restorestack(L, result);
-  L->top--;
-  setobjs2s(L, res, L->top);
-}
-
-
-
-static void callTM (lua_State *L, const TValue *f, const TValue *p1,
-                    const TValue *p2, const TValue *p3) {
-  setobj2s(L, L->top, f);  /* push function */
-  setobj2s(L, L->top+1, p1);  /* 1st argument */
-  setobj2s(L, L->top+2, p2);  /* 2nd argument */
-  setobj2s(L, L->top+3, p3);  /* 3th argument */
-  luaD_checkstack(L, 4);
-  L->top += 4;
-  luaD_call(L, L->top - 4, 0);
-}
-
-
-void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
-  int loop;
-  for (loop = 0; loop < MAXTAGLOOP; loop++) {
-    const TValue *tm;
-    if (ttistable(t)) {  /* `t' is a table? */
-      Table *h = hvalue(t);
-      const TValue *res = luaH_get(h, key); /* do a primitive get */
-      if (!ttisnil(res) ||  /* result is no nil? */
-          (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
-        setobj2s(L, val, res);
-        return;
-      }
-      /* else will try the tag method */
-    }
-    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
-      luaG_typeerror(L, t, "index");
-    if (ttisfunction(tm)) {
-      callTMres(L, val, tm, t, key);
-      return;
-    }
-    t = tm;  /* else repeat with `tm' */ 
-  }
-  luaG_runerror(L, "loop in gettable");
-}
-
-
-void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
-  int loop;
-  TValue temp;
-  for (loop = 0; loop < MAXTAGLOOP; loop++) {
-    const TValue *tm;
-    if (ttistable(t)) {  /* `t' is a table? */
-      Table *h = hvalue(t);
-      TValue *oldval = luaH_set(L, h, key); /* do a primitive set */
-      if (!ttisnil(oldval) ||  /* result is no nil? */
-          (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */
-        setobj2t(L, oldval, val);
-        h->flags = 0;
-        luaC_barriert(L, h, val);
-        return;
-      }
-      /* else will try the tag method */
-    }
-    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
-      luaG_typeerror(L, t, "index");
-    if (ttisfunction(tm)) {
-      callTM(L, tm, t, key, val);
-      return;
-    }
-    /* else repeat with `tm' */
-    setobj(L, &temp, tm);  /* avoid pointing inside table (may rehash) */
-    t = &temp;
-  }
-  luaG_runerror(L, "loop in settable");
-}
-
-
-static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
-                       StkId res, TMS event) {
-  const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */
-  if (ttisnil(tm))
-    tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */
-  if (ttisnil(tm)) return 0;
-  callTMres(L, res, tm, p1, p2);
-  return 1;
-}
-
-
-static const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2,
-                                  TMS event) {
-  const TValue *tm1 = fasttm(L, mt1, event);
-  const TValue *tm2;
-  if (tm1 == NULL) return NULL;  /* no metamethod */
-  if (mt1 == mt2) return tm1;  /* same metatables => same metamethods */
-  tm2 = fasttm(L, mt2, event);
-  if (tm2 == NULL) return NULL;  /* no metamethod */
-  if (luaO_rawequalObj(tm1, tm2))  /* same metamethods? */
-    return tm1;
-  return NULL;
-}
-
-
-static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,
-                         TMS event) {
-  const TValue *tm1 = luaT_gettmbyobj(L, p1, event);
-  const TValue *tm2;
-  if (ttisnil(tm1)) return -1;  /* no metamethod? */
-  tm2 = luaT_gettmbyobj(L, p2, event);
-  if (!luaO_rawequalObj(tm1, tm2))  /* different metamethods? */
-    return -1;
-  callTMres(L, L->top, tm1, p1, p2);
-  return !l_isfalse(L->top);
-}
-
-
-static int l_strcmp (const TString *ls, const TString *rs) {
-  const char *l = getstr(ls);
-  size_t ll = ls->tsv.len;
-  const char *r = getstr(rs);
-  size_t lr = rs->tsv.len;
-  for (;;) {
-    int temp = strcoll(l, r);
-    if (temp != 0) return temp;
-    else {  /* strings are equal up to a `\0' */
-      size_t len = strlen(l);  /* index of first `\0' in both strings */
-      if (len == lr)  /* r is finished? */
-        return (len == ll) ? 0 : 1;
-      else if (len == ll)  /* l is finished? */
-        return -1;  /* l is smaller than r (because r is not finished) */
-      /* both strings longer than `len'; go on comparing (after the `\0') */
-      len++;
-      l += len; ll -= len; r += len; lr -= len;
-    }
-  }
-}
-
-
-int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {
-  int res;
-  if (ttype(l) != ttype(r))
-    return luaG_ordererror(L, l, r);
-  else if (ttisnumber(l))
-    return luai_numlt(nvalue(l), nvalue(r));
-  else if (ttisstring(l))
-    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
-  else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
-    return res;
-  return luaG_ordererror(L, l, r);
-}
-
-
-static int lessequal (lua_State *L, const TValue *l, const TValue *r) {
-  int res;
-  if (ttype(l) != ttype(r))
-    return luaG_ordererror(L, l, r);
-  else if (ttisnumber(l))
-    return luai_numle(nvalue(l), nvalue(r));
-  else if (ttisstring(l))
-    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;
-  else if ((res = call_orderTM(L, l, r, TM_LE)) != -1)  /* first try `le' */
-    return res;
-  else if ((res = call_orderTM(L, r, l, TM_LT)) != -1)  /* else try `lt' */
-    return !res;
-  return luaG_ordererror(L, l, r);
-}
-
-
-int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2) {
-  const TValue *tm;
-  lua_assert(ttype(t1) == ttype(t2));
-  switch (ttype(t1)) {
-    case LUA_TNIL: return 1;
-    case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));
-    case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2);  /* true must be 1 !! */
-    case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
-    case LUA_TUSERDATA: {
-      if (uvalue(t1) == uvalue(t2)) return 1;
-      tm = get_compTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable,
-                         TM_EQ);
-      break;  /* will try TM */
-    }
-    case LUA_TTABLE: {
-      if (hvalue(t1) == hvalue(t2)) return 1;
-      tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
-      break;  /* will try TM */
-    }
-    default: return gcvalue(t1) == gcvalue(t2);
-  }
-  if (tm == NULL) return 0;  /* no TM? */
-  callTMres(L, L->top, tm, t1, t2);  /* call TM */
-  return !l_isfalse(L->top);
-}
-
-
-void luaV_concat (lua_State *L, int total, int last) {
-  do {
-    StkId top = L->base + last + 1;
-    int n = 2;  /* number of elements handled in this pass (at least 2) */
-    if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
-      if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
-        luaG_concaterror(L, top-2, top-1);
-    } else if (tsvalue(top-1)->len == 0)  /* second op is empty? */
-      (void)tostring(L, top - 2);  /* result is first op (as string) */
-    else {
-      /* at least two string values; get as many as possible */
-      size_t tl = tsvalue(top-1)->len;
-      char *buffer;
-      int i;
-      /* collect total length */
-      for (n = 1; n < total && tostring(L, top-n-1); n++) {
-        size_t l = tsvalue(top-n-1)->len;
-        if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
-        tl += l;
-      }
-      buffer = luaZ_openspace(L, &G(L)->buff, tl);
-      tl = 0;
-      for (i=n; i>0; i--) {  /* concat all strings */
-        size_t l = tsvalue(top-i)->len;
-        memcpy(buffer+tl, svalue(top-i), l);
-        tl += l;
-      }
-      setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
-    }
-    total -= n-1;  /* got `n' strings to create 1 new */
-    last -= n-1;
-  } while (total > 1);  /* repeat until only 1 result left */
-}
-
-
-static void Arith (lua_State *L, StkId ra, const TValue *rb,
-                   const TValue *rc, TMS op) {
-  TValue tempb, tempc;
-  const TValue *b, *c;
-  if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
-      (c = luaV_tonumber(rc, &tempc)) != NULL) {
-    lua_Number nb = nvalue(b), nc = nvalue(c);
-    switch (op) {
-      case TM_ADD: setnvalue(ra, luai_numadd(nb, nc)); break;
-      case TM_SUB: setnvalue(ra, luai_numsub(nb, nc)); break;
-      case TM_MUL: setnvalue(ra, luai_nummul(nb, nc)); break;
-      case TM_DIV: setnvalue(ra, luai_numdiv(nb, nc)); break;
-      case TM_MOD: setnvalue(ra, luai_nummod(nb, nc)); break;
-      case TM_POW: setnvalue(ra, luai_numpow(nb, nc)); break;
-      case TM_UNM: setnvalue(ra, luai_numunm(nb)); break;
-      default: lua_assert(0); break;
-    }
-  }
-  else if (!call_binTM(L, rb, rc, ra, op))
-    luaG_aritherror(L, rb, rc);
-}
-
-
-
-/*
-** some macros for common tasks in `luaV_execute'
-*/
-
-#define runtime_check(L, c)	{ if (!(c)) break; }
-
-#define RA(i)	(base+GETARG_A(i))
-/* to be used after possible stack reallocation */
-#define RB(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
-#define RC(i)	check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
-#define RKB(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
-	ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
-#define RKC(i)	check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
-	ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
-#define KBx(i)	check_exp(getBMode(GET_OPCODE(i)) == OpArgK, k+GETARG_Bx(i))
-
-
-#define dojump(L,pc,i)	{(pc) += (i); luai_threadyield(L);}
-
-
-#define Protect(x)	{ L->savedpc = pc; {x;}; base = L->base; }
-
-
-#define arith_op(op,tm) { \
-        TValue *rb = RKB(i); \
-        TValue *rc = RKC(i); \
-        if (ttisnumber(rb) && ttisnumber(rc)) { \
-          lua_Number nb = nvalue(rb), nc = nvalue(rc); \
-          setnvalue(ra, op(nb, nc)); \
-        } \
-        else \
-          Protect(Arith(L, ra, rb, rc, tm)); \
-      }
-
-
-
-void luaV_execute (lua_State *L, int nexeccalls) {
-  LClosure *cl;
-  StkId base;
-  TValue *k;
-  const Instruction *pc;
- reentry:  /* entry point */
-  lua_assert(isLua(L->ci));
-  pc = L->savedpc;
-  cl = &clvalue(L->ci->func)->l;
-  base = L->base;
-  k = cl->p->k;
-  /* main loop of interpreter */
-  for (;;) {
-    const Instruction i = *pc++;
-    StkId ra;
-    if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
-        (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
-      traceexec(L, pc);
-      if (L->status == LUA_YIELD) {  /* did hook yield? */
-        L->savedpc = pc - 1;
-        return;
-      }
-      base = L->base;
-    }
-    /* warning!! several calls may realloc the stack and invalidate `ra' */
-    ra = RA(i);
-    lua_assert(base == L->base && L->base == L->ci->base);
-    lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
-    lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
-    switch (GET_OPCODE(i)) {
-      case OP_MOVE: {
-        setobjs2s(L, ra, RB(i));
-        continue;
-      }
-      case OP_LOADK: {
-        setobj2s(L, ra, KBx(i));
-        continue;
-      }
-      case OP_LOADBOOL: {
-        setbvalue(ra, GETARG_B(i));
-        if (GETARG_C(i)) pc++;  /* skip next instruction (if C) */
-        continue;
-      }
-      case OP_LOADNIL: {
-        TValue *rb = RB(i);
-        do {
-          setnilvalue(rb--);
-        } while (rb >= ra);
-        continue;
-      }
-      case OP_GETUPVAL: {
-        int b = GETARG_B(i);
-        setobj2s(L, ra, cl->upvals[b]->v);
-        continue;
-      }
-      case OP_GETGLOBAL: {
-        TValue g;
-        TValue *rb = KBx(i);
-        sethvalue(L, &g, cl->env);
-        lua_assert(ttisstring(rb));
-        Protect(luaV_gettable(L, &g, rb, ra));
-        continue;
-      }
-      case OP_GETTABLE: {
-        Protect(luaV_gettable(L, RB(i), RKC(i), ra));
-        continue;
-      }
-      case OP_SETGLOBAL: {
-        TValue g;
-        sethvalue(L, &g, cl->env);
-        lua_assert(ttisstring(KBx(i)));
-        Protect(luaV_settable(L, &g, KBx(i), ra));
-        continue;
-      }
-      case OP_SETUPVAL: {
-        UpVal *uv = cl->upvals[GETARG_B(i)];
-        setobj(L, uv->v, ra);
-        luaC_barrier(L, uv, ra);
-        continue;
-      }
-      case OP_SETTABLE: {
-        Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
-        continue;
-      }
-      case OP_NEWTABLE: {
-        int b = GETARG_B(i);
-        int c = GETARG_C(i);
-        sethvalue(L, ra, luaH_new(L, luaO_fb2int(b), luaO_fb2int(c)));
-        Protect(luaC_checkGC(L));
-        continue;
-      }
-      case OP_SELF: {
-        StkId rb = RB(i);
-        setobjs2s(L, ra+1, rb);
-        Protect(luaV_gettable(L, rb, RKC(i), ra));
-        continue;
-      }
-      case OP_ADD: {
-        arith_op(luai_numadd, TM_ADD);
-        continue;
-      }
-      case OP_SUB: {
-        arith_op(luai_numsub, TM_SUB);
-        continue;
-      }
-      case OP_MUL: {
-        arith_op(luai_nummul, TM_MUL);
-        continue;
-      }
-      case OP_DIV: {
-        arith_op(luai_numdiv, TM_DIV);
-        continue;
-      }
-      case OP_MOD: {
-        arith_op(luai_nummod, TM_MOD);
-        continue;
-      }
-      case OP_POW: {
-        arith_op(luai_numpow, TM_POW);
-        continue;
-      }
-      case OP_UNM: {
-        TValue *rb = RB(i);
-        if (ttisnumber(rb)) {
-          lua_Number nb = nvalue(rb);
-          setnvalue(ra, luai_numunm(nb));
-        }
-        else {
-          Protect(Arith(L, ra, rb, rb, TM_UNM));
-        }
-        continue;
-      }
-      case OP_NOT: {
-        int res = l_isfalse(RB(i));  /* next assignment may change this value */
-        setbvalue(ra, res);
-        continue;
-      }
-      case OP_LEN: {
-        const TValue *rb = RB(i);
-        switch (ttype(rb)) {
-          case LUA_TTABLE: {
-            setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));
-            break;
-          }
-          case LUA_TSTRING: {
-            setnvalue(ra, cast_num(tsvalue(rb)->len));
-            break;
-          }
-          default: {  /* try metamethod */
-            Protect(
-              if (!call_binTM(L, rb, luaO_nilobject, ra, TM_LEN))
-                luaG_typeerror(L, rb, "get length of");
-            )
-          }
-        }
-        continue;
-      }
-      case OP_CONCAT: {
-        int b = GETARG_B(i);
-        int c = GETARG_C(i);
-        Protect(luaV_concat(L, c-b+1, c); luaC_checkGC(L));
-        setobjs2s(L, RA(i), base+b);
-        continue;
-      }
-      case OP_JMP: {
-        dojump(L, pc, GETARG_sBx(i));
-        continue;
-      }
-      case OP_EQ: {
-        TValue *rb = RKB(i);
-        TValue *rc = RKC(i);
-        Protect(
-          if (equalobj(L, rb, rc) == GETARG_A(i))
-            dojump(L, pc, GETARG_sBx(*pc));
-        )
-        pc++;
-        continue;
-      }
-      case OP_LT: {
-        Protect(
-          if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
-            dojump(L, pc, GETARG_sBx(*pc));
-        )
-        pc++;
-        continue;
-      }
-      case OP_LE: {
-        Protect(
-          if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
-            dojump(L, pc, GETARG_sBx(*pc));
-        )
-        pc++;
-        continue;
-      }
-      case OP_TEST: {
-        if (l_isfalse(ra) != GETARG_C(i))
-          dojump(L, pc, GETARG_sBx(*pc));
-        pc++;
-        continue;
-      }
-      case OP_TESTSET: {
-        TValue *rb = RB(i);
-        if (l_isfalse(rb) != GETARG_C(i)) {
-          setobjs2s(L, ra, rb);
-          dojump(L, pc, GETARG_sBx(*pc));
-        }
-        pc++;
-        continue;
-      }
-      case OP_CALL: {
-        int b = GETARG_B(i);
-        int nresults = GETARG_C(i) - 1;
-        if (b != 0) L->top = ra+b;  /* else previous instruction set top */
-        L->savedpc = pc;
-        switch (luaD_precall(L, ra, nresults)) {
-          case PCRLUA: {
-            nexeccalls++;
-            goto reentry;  /* restart luaV_execute over new Lua function */
-          }
-          case PCRC: {
-            /* it was a C function (`precall' called it); adjust results */
-            if (nresults >= 0) L->top = L->ci->top;
-            base = L->base;
-            continue;
-          }
-          default: {
-            return;  /* yield */
-          }
-        }
-      }
-      case OP_TAILCALL: {
-        int b = GETARG_B(i);
-        if (b != 0) L->top = ra+b;  /* else previous instruction set top */
-        L->savedpc = pc;
-        lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
-        switch (luaD_precall(L, ra, LUA_MULTRET)) {
-          case PCRLUA: {
-            /* tail call: put new frame in place of previous one */
-            CallInfo *ci = L->ci - 1;  /* previous frame */
-            int aux;
-            StkId func = ci->func;
-            StkId pfunc = (ci+1)->func;  /* previous function index */
-            if (L->openupval) luaF_close(L, ci->base);
-            L->base = ci->base = ci->func + ((ci+1)->base - pfunc);
-            for (aux = 0; pfunc+aux < L->top; aux++)  /* move frame down */
-              setobjs2s(L, func+aux, pfunc+aux);
-            ci->top = L->top = func+aux;  /* correct top */
-            lua_assert(L->top == L->base + clvalue(func)->l.p->maxstacksize);
-            ci->savedpc = L->savedpc;
-            ci->tailcalls++;  /* one more call lost */
-            L->ci--;  /* remove new frame */
-            goto reentry;
-          }
-          case PCRC: {  /* it was a C function (`precall' called it) */
-            base = L->base;
-            continue;
-          }
-          default: {
-            return;  /* yield */
-          }
-        }
-      }
-      case OP_RETURN: {
-        int b = GETARG_B(i);
-        if (b != 0) L->top = ra+b-1;
-        if (L->openupval) luaF_close(L, base);
-        L->savedpc = pc;
-        b = luaD_poscall(L, ra);
-        if (--nexeccalls == 0)  /* was previous function running `here'? */
-          return;  /* no: return */
-        else {  /* yes: continue its execution */
-          if (b) L->top = L->ci->top;
-          lua_assert(isLua(L->ci));
-          lua_assert(GET_OPCODE(*((L->ci)->savedpc - 1)) == OP_CALL);
-          goto reentry;
-        }
-      }
-      case OP_FORLOOP: {
-        lua_Number step = nvalue(ra+2);
-        lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */
-        lua_Number limit = nvalue(ra+1);
-        if (luai_numlt(0, step) ? luai_numle(idx, limit)
-                                : luai_numle(limit, idx)) {
-          dojump(L, pc, GETARG_sBx(i));  /* jump back */
-          setnvalue(ra, idx);  /* update internal index... */
-          setnvalue(ra+3, idx);  /* ...and external index */
-        }
-        continue;
-      }
-      case OP_FORPREP: {
-        const TValue *init = ra;
-        const TValue *plimit = ra+1;
-        const TValue *pstep = ra+2;
-        L->savedpc = pc;  /* next steps may throw errors */
-        if (!tonumber(init, ra))
-          luaG_runerror(L, LUA_QL("for") " initial value must be a number");
-        else if (!tonumber(plimit, ra+1))
-          luaG_runerror(L, LUA_QL("for") " limit must be a number");
-        else if (!tonumber(pstep, ra+2))
-          luaG_runerror(L, LUA_QL("for") " step must be a number");
-        setnvalue(ra, luai_numsub(nvalue(ra), nvalue(pstep)));
-        dojump(L, pc, GETARG_sBx(i));
-        continue;
-      }
-      case OP_TFORLOOP: {
-        StkId cb = ra + 3;  /* call base */
-        setobjs2s(L, cb+2, ra+2);
-        setobjs2s(L, cb+1, ra+1);
-        setobjs2s(L, cb, ra);
-        L->top = cb+3;  /* func. + 2 args (state and index) */
-        Protect(luaD_call(L, cb, GETARG_C(i)));
-        L->top = L->ci->top;
-        cb = RA(i) + 3;  /* previous call may change the stack */
-        if (!ttisnil(cb)) {  /* continue loop? */
-          setobjs2s(L, cb-1, cb);  /* save control variable */
-          dojump(L, pc, GETARG_sBx(*pc));  /* jump back */
-        }
-        pc++;
-        continue;
-      }
-      case OP_SETLIST: {
-        int n = GETARG_B(i);
-        int c = GETARG_C(i);
-        int last;
-        Table *h;
-        if (n == 0) {
-          n = cast_int(L->top - ra) - 1;
-          L->top = L->ci->top;
-        }
-        if (c == 0) c = cast_int(*pc++);
-        runtime_check(L, ttistable(ra));
-        h = hvalue(ra);
-        last = ((c-1)*LFIELDS_PER_FLUSH) + n;
-        if (last > h->sizearray)  /* needs more space? */
-          luaH_resizearray(L, h, last);  /* pre-alloc it at once */
-        for (; n > 0; n--) {
-          TValue *val = ra+n;
-          setobj2t(L, luaH_setnum(L, h, last--), val);
-          luaC_barriert(L, h, val);
-        }
-        continue;
-      }
-      case OP_CLOSE: {
-        luaF_close(L, ra);
-        continue;
-      }
-      case OP_CLOSURE: {
-        Proto *p;
-        Closure *ncl;
-        int nup, j;
-        p = cl->p->p[GETARG_Bx(i)];
-        nup = p->nups;
-        ncl = luaF_newLclosure(L, nup, cl->env);
-        ncl->l.p = p;
-        for (j=0; j<nup; j++, pc++) {
-          if (GET_OPCODE(*pc) == OP_GETUPVAL)
-            ncl->l.upvals[j] = cl->upvals[GETARG_B(*pc)];
-          else {
-            lua_assert(GET_OPCODE(*pc) == OP_MOVE);
-            ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc));
-          }
-        }
-        setclvalue(L, ra, ncl);
-        Protect(luaC_checkGC(L));
-        continue;
-      }
-      case OP_VARARG: {
-        int b = GETARG_B(i) - 1;
-        int j;
-        CallInfo *ci = L->ci;
-        int n = cast_int(ci->base - ci->func) - cl->p->numparams - 1;
-        if (b == LUA_MULTRET) {
-          Protect(luaD_checkstack(L, n));
-          ra = RA(i);  /* previous call may change the stack */
-          b = n;
-          L->top = ra + n;
-        }
-        for (j = 0; j < b; j++) {
-          if (j < n) {
-            setobjs2s(L, ra + j, ci->base - n + j);
-          }
-          else {
-            setnilvalue(ra + j);
-          }
-        }
-        continue;
-      }
-    }
-  }
-}
-
diff --git a/redis-stable/deps/lua/src/lvm.h b/redis-stable/deps/lua/src/lvm.h
deleted file mode 100644
index bfe4f567..00000000
--- a/redis-stable/deps/lua/src/lvm.h
+++ /dev/null
@@ -1,36 +0,0 @@
-/*
-** $Id: lvm.h,v 2.5.1.1 2007/12/27 13:02:25 roberto Exp $
-** Lua virtual machine
-** See Copyright Notice in lua.h
-*/
-
-#ifndef lvm_h
-#define lvm_h
-
-
-#include "ldo.h"
-#include "lobject.h"
-#include "ltm.h"
-
-
-#define tostring(L,o) ((ttype(o) == LUA_TSTRING) || (luaV_tostring(L, o)))
-
-#define tonumber(o,n)	(ttype(o) == LUA_TNUMBER || \
-                         (((o) = luaV_tonumber(o,n)) != NULL))
-
-#define equalobj(L,o1,o2) \
-	(ttype(o1) == ttype(o2) && luaV_equalval(L, o1, o2))
-
-
-LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r);
-LUAI_FUNC int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2);
-LUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n);
-LUAI_FUNC int luaV_tostring (lua_State *L, StkId obj);
-LUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key,
-                                            StkId val);
-LUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key,
-                                            StkId val);
-LUAI_FUNC void luaV_execute (lua_State *L, int nexeccalls);
-LUAI_FUNC void luaV_concat (lua_State *L, int total, int last);
-
-#endif
diff --git a/redis-stable/deps/lua/src/lzio.c b/redis-stable/deps/lua/src/lzio.c
deleted file mode 100644
index 293edd59..00000000
--- a/redis-stable/deps/lua/src/lzio.c
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
-** $Id: lzio.c,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
-** a generic input stream interface
-** See Copyright Notice in lua.h
-*/
-
-
-#include <string.h>
-
-#define lzio_c
-#define LUA_CORE
-
-#include "lua.h"
-
-#include "llimits.h"
-#include "lmem.h"
-#include "lstate.h"
-#include "lzio.h"
-
-
-int luaZ_fill (ZIO *z) {
-  size_t size;
-  lua_State *L = z->L;
-  const char *buff;
-  lua_unlock(L);
-  buff = z->reader(L, z->data, &size);
-  lua_lock(L);
-  if (buff == NULL || size == 0) return EOZ;
-  z->n = size - 1;
-  z->p = buff;
-  return char2int(*(z->p++));
-}
-
-
-int luaZ_lookahead (ZIO *z) {
-  if (z->n == 0) {
-    if (luaZ_fill(z) == EOZ)
-      return EOZ;
-    else {
-      z->n++;  /* luaZ_fill removed first byte; put back it */
-      z->p--;
-    }
-  }
-  return char2int(*z->p);
-}
-
-
-void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {
-  z->L = L;
-  z->reader = reader;
-  z->data = data;
-  z->n = 0;
-  z->p = NULL;
-}
-
-
-/* --------------------------------------------------------------- read --- */
-size_t luaZ_read (ZIO *z, void *b, size_t n) {
-  while (n) {
-    size_t m;
-    if (luaZ_lookahead(z) == EOZ)
-      return n;  /* return number of missing bytes */
-    m = (n <= z->n) ? n : z->n;  /* min. between n and z->n */
-    memcpy(b, z->p, m);
-    z->n -= m;
-    z->p += m;
-    b = (char *)b + m;
-    n -= m;
-  }
-  return 0;
-}
-
-/* ------------------------------------------------------------------------ */
-char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {
-  if (n > buff->buffsize) {
-    if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;
-    luaZ_resizebuffer(L, buff, n);
-  }
-  return buff->buffer;
-}
-
-
diff --git a/redis-stable/deps/lua/src/lzio.h b/redis-stable/deps/lua/src/lzio.h
deleted file mode 100644
index 51d695d8..00000000
--- a/redis-stable/deps/lua/src/lzio.h
+++ /dev/null
@@ -1,67 +0,0 @@
-/*
-** $Id: lzio.h,v 1.21.1.1 2007/12/27 13:02:25 roberto Exp $
-** Buffered streams
-** See Copyright Notice in lua.h
-*/
-
-
-#ifndef lzio_h
-#define lzio_h
-
-#include "lua.h"
-
-#include "lmem.h"
-
-
-#define EOZ	(-1)			/* end of stream */
-
-typedef struct Zio ZIO;
-
-#define char2int(c)	cast(int, cast(unsigned char, (c)))
-
-#define zgetc(z)  (((z)->n--)>0 ?  char2int(*(z)->p++) : luaZ_fill(z))
-
-typedef struct Mbuffer {
-  char *buffer;
-  size_t n;
-  size_t buffsize;
-} Mbuffer;
-
-#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0)
-
-#define luaZ_buffer(buff)	((buff)->buffer)
-#define luaZ_sizebuffer(buff)	((buff)->buffsize)
-#define luaZ_bufflen(buff)	((buff)->n)
-
-#define luaZ_resetbuffer(buff) ((buff)->n = 0)
-
-
-#define luaZ_resizebuffer(L, buff, size) \
-	(luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \
-	(buff)->buffsize = size)
-
-#define luaZ_freebuffer(L, buff)	luaZ_resizebuffer(L, buff, 0)
-
-
-LUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n);
-LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader,
-                                        void *data);
-LUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n);	/* read next n bytes */
-LUAI_FUNC int luaZ_lookahead (ZIO *z);
-
-
-
-/* --------- Private Part ------------------ */
-
-struct Zio {
-  size_t n;			/* bytes still unread */
-  const char *p;		/* current position in buffer */
-  lua_Reader reader;
-  void* data;			/* additional data */
-  lua_State *L;			/* Lua state (for reader) */
-};
-
-
-LUAI_FUNC int luaZ_fill (ZIO *z);
-
-#endif
diff --git a/redis-stable/deps/lua/src/print.c b/redis-stable/deps/lua/src/print.c
deleted file mode 100644
index e240cfc3..00000000
--- a/redis-stable/deps/lua/src/print.c
+++ /dev/null
@@ -1,227 +0,0 @@
-/*
-** $Id: print.c,v 1.55a 2006/05/31 13:30:05 lhf Exp $
-** print bytecodes
-** See Copyright Notice in lua.h
-*/
-
-#include <ctype.h>
-#include <stdio.h>
-
-#define luac_c
-#define LUA_CORE
-
-#include "ldebug.h"
-#include "lobject.h"
-#include "lopcodes.h"
-#include "lundump.h"
-
-#define PrintFunction	luaU_print
-
-#define Sizeof(x)	((int)sizeof(x))
-#define VOID(p)		((const void*)(p))
-
-static void PrintString(const TString* ts)
-{
- const char* s=getstr(ts);
- size_t i,n=ts->tsv.len;
- putchar('"');
- for (i=0; i<n; i++)
- {
-  int c=s[i];
-  switch (c)
-  {
-   case '"': printf("\\\""); break;
-   case '\\': printf("\\\\"); break;
-   case '\a': printf("\\a"); break;
-   case '\b': printf("\\b"); break;
-   case '\f': printf("\\f"); break;
-   case '\n': printf("\\n"); break;
-   case '\r': printf("\\r"); break;
-   case '\t': printf("\\t"); break;
-   case '\v': printf("\\v"); break;
-   default:	if (isprint((unsigned char)c))
-   			putchar(c);
-		else
-			printf("\\%03u",(unsigned char)c);
-  }
- }
- putchar('"');
-}
-
-static void PrintConstant(const Proto* f, int i)
-{
- const TValue* o=&f->k[i];
- switch (ttype(o))
- {
-  case LUA_TNIL:
-	printf("nil");
-	break;
-  case LUA_TBOOLEAN:
-	printf(bvalue(o) ? "true" : "false");
-	break;
-  case LUA_TNUMBER:
-	printf(LUA_NUMBER_FMT,nvalue(o));
-	break;
-  case LUA_TSTRING:
-	PrintString(rawtsvalue(o));
-	break;
-  default:				/* cannot happen */
-	printf("? type=%d",ttype(o));
-	break;
- }
-}
-
-static void PrintCode(const Proto* f)
-{
- const Instruction* code=f->code;
- int pc,n=f->sizecode;
- for (pc=0; pc<n; pc++)
- {
-  Instruction i=code[pc];
-  OpCode o=GET_OPCODE(i);
-  int a=GETARG_A(i);
-  int b=GETARG_B(i);
-  int c=GETARG_C(i);
-  int bx=GETARG_Bx(i);
-  int sbx=GETARG_sBx(i);
-  int line=getline(f,pc);
-  printf("\t%d\t",pc+1);
-  if (line>0) printf("[%d]\t",line); else printf("[-]\t");
-  printf("%-9s\t",luaP_opnames[o]);
-  switch (getOpMode(o))
-  {
-   case iABC:
-    printf("%d",a);
-    if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (-1-INDEXK(b)) : b);
-    if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (-1-INDEXK(c)) : c);
-    break;
-   case iABx:
-    if (getBMode(o)==OpArgK) printf("%d %d",a,-1-bx); else printf("%d %d",a,bx);
-    break;
-   case iAsBx:
-    if (o==OP_JMP) printf("%d",sbx); else printf("%d %d",a,sbx);
-    break;
-  }
-  switch (o)
-  {
-   case OP_LOADK:
-    printf("\t; "); PrintConstant(f,bx);
-    break;
-   case OP_GETUPVAL:
-   case OP_SETUPVAL:
-    printf("\t; %s", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : "-");
-    break;
-   case OP_GETGLOBAL:
-   case OP_SETGLOBAL:
-    printf("\t; %s",svalue(&f->k[bx]));
-    break;
-   case OP_GETTABLE:
-   case OP_SELF:
-    if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); }
-    break;
-   case OP_SETTABLE:
-   case OP_ADD:
-   case OP_SUB:
-   case OP_MUL:
-   case OP_DIV:
-   case OP_POW:
-   case OP_EQ:
-   case OP_LT:
-   case OP_LE:
-    if (ISK(b) || ISK(c))
-    {
-     printf("\t; ");
-     if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-");
-     printf(" ");
-     if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-");
-    }
-    break;
-   case OP_JMP:
-   case OP_FORLOOP:
-   case OP_FORPREP:
-    printf("\t; to %d",sbx+pc+2);
-    break;
-   case OP_CLOSURE:
-    printf("\t; %p",VOID(f->p[bx]));
-    break;
-   case OP_SETLIST:
-    if (c==0) printf("\t; %d",(int)code[++pc]);
-    else printf("\t; %d",c);
-    break;
-   default:
-    break;
-  }
-  printf("\n");
- }
-}
-
-#define SS(x)	(x==1)?"":"s"
-#define S(x)	x,SS(x)
-
-static void PrintHeader(const Proto* f)
-{
- const char* s=getstr(f->source);
- if (*s=='@' || *s=='=')
-  s++;
- else if (*s==LUA_SIGNATURE[0])
-  s="(bstring)";
- else
-  s="(string)";
- printf("\n%s <%s:%d,%d> (%d instruction%s, %d bytes at %p)\n",
- 	(f->linedefined==0)?"main":"function",s,
-	f->linedefined,f->lastlinedefined,
-	S(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f));
- printf("%d%s param%s, %d slot%s, %d upvalue%s, ",
-	f->numparams,f->is_vararg?"+":"",SS(f->numparams),
-	S(f->maxstacksize),S(f->nups));
- printf("%d local%s, %d constant%s, %d function%s\n",
-	S(f->sizelocvars),S(f->sizek),S(f->sizep));
-}
-
-static void PrintConstants(const Proto* f)
-{
- int i,n=f->sizek;
- printf("constants (%d) for %p:\n",n,VOID(f));
- for (i=0; i<n; i++)
- {
-  printf("\t%d\t",i+1);
-  PrintConstant(f,i);
-  printf("\n");
- }
-}
-
-static void PrintLocals(const Proto* f)
-{
- int i,n=f->sizelocvars;
- printf("locals (%d) for %p:\n",n,VOID(f));
- for (i=0; i<n; i++)
- {
-  printf("\t%d\t%s\t%d\t%d\n",
-  i,getstr(f->locvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1);
- }
-}
-
-static void PrintUpvalues(const Proto* f)
-{
- int i,n=f->sizeupvalues;
- printf("upvalues (%d) for %p:\n",n,VOID(f));
- if (f->upvalues==NULL) return;
- for (i=0; i<n; i++)
- {
-  printf("\t%d\t%s\n",i,getstr(f->upvalues[i]));
- }
-}
-
-void PrintFunction(const Proto* f, int full)
-{
- int i,n=f->sizep;
- PrintHeader(f);
- PrintCode(f);
- if (full)
- {
-  PrintConstants(f);
-  PrintLocals(f);
-  PrintUpvalues(f);
- }
- for (i=0; i<n; i++) PrintFunction(f->p[i],full);
-}
diff --git a/redis-stable/deps/lua/src/strbuf.c b/redis-stable/deps/lua/src/strbuf.c
deleted file mode 100644
index f0f7f4b9..00000000
--- a/redis-stable/deps/lua/src/strbuf.c
+++ /dev/null
@@ -1,251 +0,0 @@
-/* strbuf - String buffer routines
- *
- * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <string.h>
-
-#include "strbuf.h"
-
-static void die(const char *fmt, ...)
-{
-    va_list arg;
-
-    va_start(arg, fmt);
-    vfprintf(stderr, fmt, arg);
-    va_end(arg);
-    fprintf(stderr, "\n");
-
-    exit(-1);
-}
-
-void strbuf_init(strbuf_t *s, int len)
-{
-    int size;
-
-    if (len <= 0)
-        size = STRBUF_DEFAULT_SIZE;
-    else
-        size = len + 1;         /* \0 terminator */
-
-    s->buf = NULL;
-    s->size = size;
-    s->length = 0;
-    s->increment = STRBUF_DEFAULT_INCREMENT;
-    s->dynamic = 0;
-    s->reallocs = 0;
-    s->debug = 0;
-
-    s->buf = malloc(size);
-    if (!s->buf)
-        die("Out of memory");
-
-    strbuf_ensure_null(s);
-}
-
-strbuf_t *strbuf_new(int len)
-{
-    strbuf_t *s;
-
-    s = malloc(sizeof(strbuf_t));
-    if (!s)
-        die("Out of memory");
-
-    strbuf_init(s, len);
-
-    /* Dynamic strbuf allocation / deallocation */
-    s->dynamic = 1;
-
-    return s;
-}
-
-void strbuf_set_increment(strbuf_t *s, int increment)
-{
-    /* Increment > 0:  Linear buffer growth rate
-     * Increment < -1: Exponential buffer growth rate */
-    if (increment == 0 || increment == -1)
-        die("BUG: Invalid string increment");
-
-    s->increment = increment;
-}
-
-static inline void debug_stats(strbuf_t *s)
-{
-    if (s->debug) {
-        fprintf(stderr, "strbuf(%lx) reallocs: %d, length: %d, size: %d\n",
-                (long)s, s->reallocs, s->length, s->size);
-    }
-}
-
-/* If strbuf_t has not been dynamically allocated, strbuf_free() can
- * be called any number of times strbuf_init() */
-void strbuf_free(strbuf_t *s)
-{
-    debug_stats(s);
-
-    if (s->buf) {
-        free(s->buf);
-        s->buf = NULL;
-    }
-    if (s->dynamic)
-        free(s);
-}
-
-char *strbuf_free_to_string(strbuf_t *s, int *len)
-{
-    char *buf;
-
-    debug_stats(s);
-
-    strbuf_ensure_null(s);
-
-    buf = s->buf;
-    if (len)
-        *len = s->length;
-
-    if (s->dynamic)
-        free(s);
-
-    return buf;
-}
-
-static int calculate_new_size(strbuf_t *s, int len)
-{
-    int reqsize, newsize;
-
-    if (len <= 0)
-        die("BUG: Invalid strbuf length requested");
-
-    /* Ensure there is room for optional NULL termination */
-    reqsize = len + 1;
-
-    /* If the user has requested to shrink the buffer, do it exactly */
-    if (s->size > reqsize)
-        return reqsize;
-
-    newsize = s->size;
-    if (s->increment < 0) {
-        /* Exponential sizing */
-        while (newsize < reqsize)
-            newsize *= -s->increment;
-    } else {
-        /* Linear sizing */
-        newsize = ((newsize + s->increment - 1) / s->increment) * s->increment;
-    }
-
-    return newsize;
-}
-
-
-/* Ensure strbuf can handle a string length bytes long (ignoring NULL
- * optional termination). */
-void strbuf_resize(strbuf_t *s, int len)
-{
-    int newsize;
-
-    newsize = calculate_new_size(s, len);
-
-    if (s->debug > 1) {
-        fprintf(stderr, "strbuf(%lx) resize: %d => %d\n",
-                (long)s, s->size, newsize);
-    }
-
-    s->size = newsize;
-    s->buf = realloc(s->buf, s->size);
-    if (!s->buf)
-        die("Out of memory");
-    s->reallocs++;
-}
-
-void strbuf_append_string(strbuf_t *s, const char *str)
-{
-    int space, i;
-
-    space = strbuf_empty_length(s);
-
-    for (i = 0; str[i]; i++) {
-        if (space < 1) {
-            strbuf_resize(s, s->length + 1);
-            space = strbuf_empty_length(s);
-        }
-
-        s->buf[s->length] = str[i];
-        s->length++;
-        space--;
-    }
-}
-
-/* strbuf_append_fmt() should only be used when an upper bound
- * is known for the output string. */
-void strbuf_append_fmt(strbuf_t *s, int len, const char *fmt, ...)
-{
-    va_list arg;
-    int fmt_len;
-
-    strbuf_ensure_empty_length(s, len);
-
-    va_start(arg, fmt);
-    fmt_len = vsnprintf(s->buf + s->length, len, fmt, arg);
-    va_end(arg);
-
-    if (fmt_len < 0)
-        die("BUG: Unable to convert number");  /* This should never happen.. */
-
-    s->length += fmt_len;
-}
-
-/* strbuf_append_fmt_retry() can be used when the there is no known
- * upper bound for the output string. */
-void strbuf_append_fmt_retry(strbuf_t *s, const char *fmt, ...)
-{
-    va_list arg;
-    int fmt_len, try;
-    int empty_len;
-
-    /* If the first attempt to append fails, resize the buffer appropriately
-     * and try again */
-    for (try = 0; ; try++) {
-        va_start(arg, fmt);
-        /* Append the new formatted string */
-        /* fmt_len is the length of the string required, excluding the
-         * trailing NULL */
-        empty_len = strbuf_empty_length(s);
-        /* Add 1 since there is also space to store the terminating NULL. */
-        fmt_len = vsnprintf(s->buf + s->length, empty_len + 1, fmt, arg);
-        va_end(arg);
-
-        if (fmt_len <= empty_len)
-            break;  /* SUCCESS */
-        if (try > 0)
-            die("BUG: length of formatted string changed");
-
-        strbuf_resize(s, s->length + fmt_len);
-    }
-
-    s->length += fmt_len;
-}
-
-/* vi:ai et sw=4 ts=4:
- */
diff --git a/redis-stable/deps/lua/src/strbuf.h b/redis-stable/deps/lua/src/strbuf.h
deleted file mode 100644
index d861108c..00000000
--- a/redis-stable/deps/lua/src/strbuf.h
+++ /dev/null
@@ -1,154 +0,0 @@
-/* strbuf - String buffer routines
- *
- * Copyright (c) 2010-2012  Mark Pulford <mark@kyne.com.au>
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
- * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
- * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- */
-
-#include <stdlib.h>
-#include <stdarg.h>
-
-/* Size: Total bytes allocated to *buf
- * Length: String length, excluding optional NULL terminator.
- * Increment: Allocation increments when resizing the string buffer.
- * Dynamic: True if created via strbuf_new()
- */
-
-typedef struct {
-    char *buf;
-    int size;
-    int length;
-    int increment;
-    int dynamic;
-    int reallocs;
-    int debug;
-} strbuf_t;
-
-#ifndef STRBUF_DEFAULT_SIZE
-#define STRBUF_DEFAULT_SIZE 1023
-#endif
-#ifndef STRBUF_DEFAULT_INCREMENT
-#define STRBUF_DEFAULT_INCREMENT -2
-#endif
-
-/* Initialise */
-extern strbuf_t *strbuf_new(int len);
-extern void strbuf_init(strbuf_t *s, int len);
-extern void strbuf_set_increment(strbuf_t *s, int increment);
-
-/* Release */
-extern void strbuf_free(strbuf_t *s);
-extern char *strbuf_free_to_string(strbuf_t *s, int *len);
-
-/* Management */
-extern void strbuf_resize(strbuf_t *s, int len);
-static int strbuf_empty_length(strbuf_t *s);
-static int strbuf_length(strbuf_t *s);
-static char *strbuf_string(strbuf_t *s, int *len);
-static void strbuf_ensure_empty_length(strbuf_t *s, int len);
-static char *strbuf_empty_ptr(strbuf_t *s);
-static void strbuf_extend_length(strbuf_t *s, int len);
-
-/* Update */
-extern void strbuf_append_fmt(strbuf_t *s, int len, const char *fmt, ...);
-extern void strbuf_append_fmt_retry(strbuf_t *s, const char *format, ...);
-static void strbuf_append_mem(strbuf_t *s, const char *c, int len);
-extern void strbuf_append_string(strbuf_t *s, const char *str);
-static void strbuf_append_char(strbuf_t *s, const char c);
-static void strbuf_ensure_null(strbuf_t *s);
-
-/* Reset string for before use */
-static inline void strbuf_reset(strbuf_t *s)
-{
-    s->length = 0;
-}
-
-static inline int strbuf_allocated(strbuf_t *s)
-{
-    return s->buf != NULL;
-}
-
-/* Return bytes remaining in the string buffer
- * Ensure there is space for a NULL terminator. */
-static inline int strbuf_empty_length(strbuf_t *s)
-{
-    return s->size - s->length - 1;
-}
-
-static inline void strbuf_ensure_empty_length(strbuf_t *s, int len)
-{
-    if (len > strbuf_empty_length(s))
-        strbuf_resize(s, s->length + len);
-}
-
-static inline char *strbuf_empty_ptr(strbuf_t *s)
-{
-    return s->buf + s->length;
-}
-
-static inline void strbuf_extend_length(strbuf_t *s, int len)
-{
-    s->length += len;
-}
-
-static inline int strbuf_length(strbuf_t *s)
-{
-    return s->length;
-}
-
-static inline void strbuf_append_char(strbuf_t *s, const char c)
-{
-    strbuf_ensure_empty_length(s, 1);
-    s->buf[s->length++] = c;
-}
-
-static inline void strbuf_append_char_unsafe(strbuf_t *s, const char c)
-{
-    s->buf[s->length++] = c;
-}
-
-static inline void strbuf_append_mem(strbuf_t *s, const char *c, int len)
-{
-    strbuf_ensure_empty_length(s, len);
-    memcpy(s->buf + s->length, c, len);
-    s->length += len;
-}
-
-static inline void strbuf_append_mem_unsafe(strbuf_t *s, const char *c, int len)
-{
-    memcpy(s->buf + s->length, c, len);
-    s->length += len;
-}
-
-static inline void strbuf_ensure_null(strbuf_t *s)
-{
-    s->buf[s->length] = 0;
-}
-
-static inline char *strbuf_string(strbuf_t *s, int *len)
-{
-    if (len)
-        *len = s->length;
-
-    return s->buf;
-}
-
-/* vi:ai et sw=4 ts=4:
- */
diff --git a/redis-stable/deps/lua/test/README b/redis-stable/deps/lua/test/README
deleted file mode 100644
index 0c7f38bc..00000000
--- a/redis-stable/deps/lua/test/README
+++ /dev/null
@@ -1,26 +0,0 @@
-These are simple tests for Lua.  Some of them contain useful code.
-They are meant to be run to make sure Lua is built correctly and also
-to be read, to see how Lua programs look.
-
-Here is a one-line summary of each program:
-
-   bisect.lua		bisection method for solving non-linear equations
-   cf.lua		temperature conversion table (celsius to farenheit)
-   echo.lua             echo command line arguments
-   env.lua              environment variables as automatic global variables
-   factorial.lua	factorial without recursion
-   fib.lua		fibonacci function with cache
-   fibfor.lua		fibonacci numbers with coroutines and generators
-   globals.lua		report global variable usage
-   hello.lua		the first program in every language
-   life.lua		Conway's Game of Life
-   luac.lua	 	bare-bones luac
-   printf.lua		an implementation of printf
-   readonly.lua		make global variables readonly
-   sieve.lua		the sieve of of Eratosthenes programmed with coroutines
-   sort.lua		two implementations of a sort function
-   table.lua		make table, grouping all data for the same item
-   trace-calls.lua	trace calls
-   trace-globals.lua	trace assigments to global variables
-   xd.lua		hex dump
-
diff --git a/redis-stable/deps/lua/test/bisect.lua b/redis-stable/deps/lua/test/bisect.lua
deleted file mode 100644
index f91e69bf..00000000
--- a/redis-stable/deps/lua/test/bisect.lua
+++ /dev/null
@@ -1,27 +0,0 @@
--- bisection method for solving non-linear equations
-
-delta=1e-6	-- tolerance
-
-function bisect(f,a,b,fa,fb)
- local c=(a+b)/2
- io.write(n," c=",c," a=",a," b=",b,"\n")
- if c==a or c==b or math.abs(a-b)<delta then return c,b-a end
- n=n+1
- local fc=f(c)
- if fa*fc<0 then return bisect(f,a,c,fa,fc) else return bisect(f,c,b,fc,fb) end
-end
-
--- find root of f in the inverval [a,b]. needs f(a)*f(b)<0
-function solve(f,a,b)
- n=0
- local z,e=bisect(f,a,b,f(a),f(b))
- io.write(string.format("after %d steps, root is %.17g with error %.1e, f=%.1e\n",n,z,e,f(z)))
-end
-
--- our function
-function f(x)
- return x*x*x-x-1
-end
-
--- find zero in [1,2]
-solve(f,1,2)
diff --git a/redis-stable/deps/lua/test/cf.lua b/redis-stable/deps/lua/test/cf.lua
deleted file mode 100644
index 8cda54b9..00000000
--- a/redis-stable/deps/lua/test/cf.lua
+++ /dev/null
@@ -1,16 +0,0 @@
--- temperature conversion table (celsius to farenheit)
-
-for c0=-20,50-1,10 do
-	io.write("C ")
-	for c=c0,c0+10-1 do
-		io.write(string.format("%3.0f ",c))
-	end
-	io.write("\n")
-	
-	io.write("F ")
-	for c=c0,c0+10-1 do
-		f=(9/5)*c+32
-		io.write(string.format("%3.0f ",f))
-	end
-	io.write("\n\n")
-end
diff --git a/redis-stable/deps/lua/test/echo.lua b/redis-stable/deps/lua/test/echo.lua
deleted file mode 100644
index 4313439a..00000000
--- a/redis-stable/deps/lua/test/echo.lua
+++ /dev/null
@@ -1,5 +0,0 @@
--- echo command line arguments
-
-for i=0,table.getn(arg) do
- print(i,arg[i])
-end
diff --git a/redis-stable/deps/lua/test/env.lua b/redis-stable/deps/lua/test/env.lua
deleted file mode 100644
index 9e62a57f..00000000
--- a/redis-stable/deps/lua/test/env.lua
+++ /dev/null
@@ -1,7 +0,0 @@
--- read environment variables as if they were global variables
-
-local f=function (t,i) return os.getenv(i) end
-setmetatable(getfenv(),{__index=f})
-
--- an example
-print(a,USER,PATH)
diff --git a/redis-stable/deps/lua/test/factorial.lua b/redis-stable/deps/lua/test/factorial.lua
deleted file mode 100644
index 7c4cf0fa..00000000
--- a/redis-stable/deps/lua/test/factorial.lua
+++ /dev/null
@@ -1,32 +0,0 @@
--- function closures are powerful
-
--- traditional fixed-point operator from functional programming
-Y = function (g)
-      local a = function (f) return f(f) end
-      return a(function (f)
-                 return g(function (x)
-                             local c=f(f)
-                             return c(x)
-                           end)
-               end)
-end
-
-
--- factorial without recursion
-F = function (f)
-      return function (n)
-               if n == 0 then return 1
-               else return n*f(n-1) end
-             end
-    end
-
-factorial = Y(F)   -- factorial is the fixed point of F
-
--- now test it
-function test(x)
-	io.write(x,"! = ",factorial(x),"\n")
-end
-
-for n=0,16 do
-	test(n)
-end
diff --git a/redis-stable/deps/lua/test/fib.lua b/redis-stable/deps/lua/test/fib.lua
deleted file mode 100644
index 97a921b1..00000000
--- a/redis-stable/deps/lua/test/fib.lua
+++ /dev/null
@@ -1,40 +0,0 @@
--- fibonacci function with cache
-
--- very inefficient fibonacci function
-function fib(n)
-	N=N+1
-	if n<2 then
-		return n
-	else
-		return fib(n-1)+fib(n-2)
-	end
-end
-
--- a general-purpose value cache
-function cache(f)
-	local c={}
-	return function (x)
-		local y=c[x]
-		if not y then
-			y=f(x)
-			c[x]=y
-		end
-		return y
-	end
-end
-
--- run and time it
-function test(s,f)
-	N=0
-	local c=os.clock()
-	local v=f(n)
-	local t=os.clock()-c
-	print(s,n,v,t,N)
-end
-
-n=arg[1] or 24		-- for other values, do lua fib.lua XX
-n=tonumber(n)
-print("","n","value","time","evals")
-test("plain",fib)
-fib=cache(fib)
-test("cached",fib)
diff --git a/redis-stable/deps/lua/test/fibfor.lua b/redis-stable/deps/lua/test/fibfor.lua
deleted file mode 100644
index 8bbba39c..00000000
--- a/redis-stable/deps/lua/test/fibfor.lua
+++ /dev/null
@@ -1,13 +0,0 @@
--- example of for with generator functions
-
-function generatefib (n)
-  return coroutine.wrap(function ()
-    local a,b = 1, 1
-    while a <= n do
-      coroutine.yield(a)
-      a, b = b, a+b
-    end
-  end)
-end
-
-for i in generatefib(1000) do print(i) end
diff --git a/redis-stable/deps/lua/test/globals.lua b/redis-stable/deps/lua/test/globals.lua
deleted file mode 100644
index d4c20e15..00000000
--- a/redis-stable/deps/lua/test/globals.lua
+++ /dev/null
@@ -1,13 +0,0 @@
--- reads luac listings and reports global variable usage
--- lines where a global is written to are marked with "*"
--- typical usage: luac -p -l file.lua | lua globals.lua | sort | lua table.lua
-
-while 1 do
- local s=io.read()
- if s==nil then break end
- local ok,_,l,op,g=string.find(s,"%[%-?(%d*)%]%s*([GS])ETGLOBAL.-;%s+(.*)$")
- if ok then
-  if op=="S" then op="*" else op="" end
-  io.write(g,"\t",l,op,"\n")
- end
-end
diff --git a/redis-stable/deps/lua/test/hello.lua b/redis-stable/deps/lua/test/hello.lua
deleted file mode 100644
index 0925498f..00000000
--- a/redis-stable/deps/lua/test/hello.lua
+++ /dev/null
@@ -1,3 +0,0 @@
--- the first program in every language
-
-io.write("Hello world, from ",_VERSION,"!\n")
diff --git a/redis-stable/deps/lua/test/life.lua b/redis-stable/deps/lua/test/life.lua
deleted file mode 100644
index 911d9fe1..00000000
--- a/redis-stable/deps/lua/test/life.lua
+++ /dev/null
@@ -1,111 +0,0 @@
--- life.lua
--- original by Dave Bollinger <DBollinger@compuserve.com> posted to lua-l
--- modified to use ANSI terminal escape sequences
--- modified to use for instead of while
-
-local write=io.write
-
-ALIVE="�"	DEAD="�"
-ALIVE="O"	DEAD="-"
-
-function delay() -- NOTE: SYSTEM-DEPENDENT, adjust as necessary
-  for i=1,10000 do end
-  -- local i=os.clock()+1 while(os.clock()<i) do end
-end
-
-function ARRAY2D(w,h)
-  local t = {w=w,h=h}
-  for y=1,h do
-    t[y] = {}
-    for x=1,w do
-      t[y][x]=0
-    end
-  end
-  return t
-end
-
-_CELLS = {}
-
--- give birth to a "shape" within the cell array
-function _CELLS:spawn(shape,left,top)
-  for y=0,shape.h-1 do
-    for x=0,shape.w-1 do
-      self[top+y][left+x] = shape[y*shape.w+x+1]
-    end
-  end
-end
-
--- run the CA and produce the next generation
-function _CELLS:evolve(next)
-  local ym1,y,yp1,yi=self.h-1,self.h,1,self.h
-  while yi > 0 do
-    local xm1,x,xp1,xi=self.w-1,self.w,1,self.w
-    while xi > 0 do
-      local sum = self[ym1][xm1] + self[ym1][x] + self[ym1][xp1] +
-                  self[y][xm1] + self[y][xp1] +
-                  self[yp1][xm1] + self[yp1][x] + self[yp1][xp1]
-      next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0
-      xm1,x,xp1,xi = x,xp1,xp1+1,xi-1
-    end
-    ym1,y,yp1,yi = y,yp1,yp1+1,yi-1
-  end
-end
-
--- output the array to screen
-function _CELLS:draw()
-  local out="" -- accumulate to reduce flicker
-  for y=1,self.h do
-   for x=1,self.w do
-      out=out..(((self[y][x]>0) and ALIVE) or DEAD)
-    end
-    out=out.."\n"
-  end
-  write(out)
-end
-
--- constructor
-function CELLS(w,h)
-  local c = ARRAY2D(w,h)
-  c.spawn = _CELLS.spawn
-  c.evolve = _CELLS.evolve
-  c.draw = _CELLS.draw
-  return c
-end
-
---
--- shapes suitable for use with spawn() above
---
-HEART = { 1,0,1,1,0,1,1,1,1; w=3,h=3 }
-GLIDER = { 0,0,1,1,0,1,0,1,1; w=3,h=3 }
-EXPLODE = { 0,1,0,1,1,1,1,0,1,0,1,0; w=3,h=4 }
-FISH = { 0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,1,0; w=5,h=4 }
-BUTTERFLY = { 1,0,0,0,1,0,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,0,1; w=5,h=5 }
-
--- the main routine
-function LIFE(w,h)
-  -- create two arrays
-  local thisgen = CELLS(w,h)
-  local nextgen = CELLS(w,h)
-
-  -- create some life
-  -- about 1000 generations of fun, then a glider steady-state
-  thisgen:spawn(GLIDER,5,4)
-  thisgen:spawn(EXPLODE,25,10)
-  thisgen:spawn(FISH,4,12)
-
-  -- run until break
-  local gen=1
-  write("\027[2J")	-- ANSI clear screen
-  while 1 do
-    thisgen:evolve(nextgen)
-    thisgen,nextgen = nextgen,thisgen
-    write("\027[H")	-- ANSI home cursor
-    thisgen:draw()
-    write("Life - generation ",gen,"\n")
-    gen=gen+1
-    if gen>2000 then break end
-    --delay()		-- no delay
-  end
-end
-
-LIFE(40,20)
diff --git a/redis-stable/deps/lua/test/luac.lua b/redis-stable/deps/lua/test/luac.lua
deleted file mode 100644
index 96a0a97c..00000000
--- a/redis-stable/deps/lua/test/luac.lua
+++ /dev/null
@@ -1,7 +0,0 @@
--- bare-bones luac in Lua
--- usage: lua luac.lua file.lua
-
-assert(arg[1]~=nil and arg[2]==nil,"usage: lua luac.lua file.lua")
-f=assert(io.open("luac.out","wb"))
-assert(f:write(string.dump(assert(loadfile(arg[1])))))
-assert(f:close())
diff --git a/redis-stable/deps/lua/test/printf.lua b/redis-stable/deps/lua/test/printf.lua
deleted file mode 100644
index 58c63ff5..00000000
--- a/redis-stable/deps/lua/test/printf.lua
+++ /dev/null
@@ -1,7 +0,0 @@
--- an implementation of printf
-
-function printf(...)
- io.write(string.format(...))
-end
-
-printf("Hello %s from %s on %s\n",os.getenv"USER" or "there",_VERSION,os.date())
diff --git a/redis-stable/deps/lua/test/readonly.lua b/redis-stable/deps/lua/test/readonly.lua
deleted file mode 100644
index 85c0b4e0..00000000
--- a/redis-stable/deps/lua/test/readonly.lua
+++ /dev/null
@@ -1,12 +0,0 @@
--- make global variables readonly
-
-local f=function (t,i) error("cannot redefine global variable `"..i.."'",2) end
-local g={}
-local G=getfenv()
-setmetatable(g,{__index=G,__newindex=f})
-setfenv(1,g)
-
--- an example
-rawset(g,"x",3)
-x=2
-y=1	-- cannot redefine `y'
diff --git a/redis-stable/deps/lua/test/sieve.lua b/redis-stable/deps/lua/test/sieve.lua
deleted file mode 100644
index 0871bb21..00000000
--- a/redis-stable/deps/lua/test/sieve.lua
+++ /dev/null
@@ -1,29 +0,0 @@
--- the sieve of of Eratosthenes programmed with coroutines
--- typical usage: lua -e N=1000 sieve.lua | column
-
--- generate all the numbers from 2 to n
-function gen (n)
-  return coroutine.wrap(function ()
-    for i=2,n do coroutine.yield(i) end
-  end)
-end
-
--- filter the numbers generated by `g', removing multiples of `p'
-function filter (p, g)
-  return coroutine.wrap(function ()
-    while 1 do
-      local n = g()
-      if n == nil then return end
-      if math.mod(n, p) ~= 0 then coroutine.yield(n) end
-    end
-  end)
-end
-
-N=N or 1000		-- from command line
-x = gen(N)		-- generate primes up to N
-while 1 do
-  local n = x()		-- pick a number until done
-  if n == nil then break end
-  print(n)		-- must be a prime number
-  x = filter(n, x)	-- now remove its multiples
-end
diff --git a/redis-stable/deps/lua/test/sort.lua b/redis-stable/deps/lua/test/sort.lua
deleted file mode 100644
index 0bcb15f8..00000000
--- a/redis-stable/deps/lua/test/sort.lua
+++ /dev/null
@@ -1,66 +0,0 @@
--- two implementations of a sort function
--- this is an example only. Lua has now a built-in function "sort"
-
--- extracted from Programming Pearls, page 110
-function qsort(x,l,u,f)
- if l<u then
-  local m=math.random(u-(l-1))+l-1	-- choose a random pivot in range l..u
-  x[l],x[m]=x[m],x[l]			-- swap pivot to first position
-  local t=x[l]				-- pivot value
-  m=l
-  local i=l+1
-  while i<=u do
-    -- invariant: x[l+1..m] < t <= x[m+1..i-1]
-    if f(x[i],t) then
-      m=m+1
-      x[m],x[i]=x[i],x[m]		-- swap x[i] and x[m]
-    end
-    i=i+1
-  end
-  x[l],x[m]=x[m],x[l]			-- swap pivot to a valid place
-  -- x[l+1..m-1] < x[m] <= x[m+1..u]
-  qsort(x,l,m-1,f)
-  qsort(x,m+1,u,f)
- end
-end
-
-function selectionsort(x,n,f)
- local i=1
- while i<=n do
-  local m,j=i,i+1
-  while j<=n do
-   if f(x[j],x[m]) then m=j end
-   j=j+1
-  end
- x[i],x[m]=x[m],x[i]			-- swap x[i] and x[m]
- i=i+1
- end
-end
-
-function show(m,x)
- io.write(m,"\n\t")
- local i=1
- while x[i] do
-  io.write(x[i])
-  i=i+1
-  if x[i] then io.write(",") end
- end
- io.write("\n")
-end
-
-function testsorts(x)
- local n=1
- while x[n] do n=n+1 end; n=n-1		-- count elements
- show("original",x)
- qsort(x,1,n,function (x,y) return x<y end)
- show("after quicksort",x)
- selectionsort(x,n,function (x,y) return x>y end)
- show("after reverse selection sort",x)
- qsort(x,1,n,function (x,y) return x<y end)
- show("after quicksort again",x)
-end
-
--- array to be sorted
-x={"Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"}
-
-testsorts(x)
diff --git a/redis-stable/deps/lua/test/table.lua b/redis-stable/deps/lua/test/table.lua
deleted file mode 100644
index 235089c0..00000000
--- a/redis-stable/deps/lua/test/table.lua
+++ /dev/null
@@ -1,12 +0,0 @@
--- make table, grouping all data for the same item
--- input is 2 columns (item, data)
-
-local A
-while 1 do
- local l=io.read()
- if l==nil then break end
- local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
- if a~=A then A=a io.write("\n",a,":") end
- io.write(" ",b)
-end
-io.write("\n")
diff --git a/redis-stable/deps/lua/test/trace-calls.lua b/redis-stable/deps/lua/test/trace-calls.lua
deleted file mode 100644
index 6d7a7b3b..00000000
--- a/redis-stable/deps/lua/test/trace-calls.lua
+++ /dev/null
@@ -1,32 +0,0 @@
--- trace calls
--- example: lua -ltrace-calls bisect.lua
-
-local level=0
-
-local function hook(event)
- local t=debug.getinfo(3)
- io.write(level," >>> ",string.rep(" ",level))
- if t~=nil and t.currentline>=0 then io.write(t.short_src,":",t.currentline," ") end
- t=debug.getinfo(2)
- if event=="call" then
-  level=level+1
- else
-  level=level-1 if level<0 then level=0 end
- end
- if t.what=="main" then
-  if event=="call" then
-   io.write("begin ",t.short_src)
-  else
-   io.write("end ",t.short_src)
-  end
- elseif t.what=="Lua" then
--- table.foreach(t,print)
-  io.write(event," ",t.name or "(Lua)"," <",t.linedefined,":",t.short_src,">")
- else
- io.write(event," ",t.name or "(C)"," [",t.what,"] ")
- end
- io.write("\n")
-end
-
-debug.sethook(hook,"cr")
-level=0
diff --git a/redis-stable/deps/lua/test/trace-globals.lua b/redis-stable/deps/lua/test/trace-globals.lua
deleted file mode 100644
index 295e670c..00000000
--- a/redis-stable/deps/lua/test/trace-globals.lua
+++ /dev/null
@@ -1,38 +0,0 @@
--- trace assigments to global variables
-
-do
- -- a tostring that quotes strings. note the use of the original tostring.
- local _tostring=tostring
- local tostring=function(a)
-  if type(a)=="string" then
-   return string.format("%q",a)
-  else
-   return _tostring(a)
-  end
- end
-
- local log=function (name,old,new)
-  local t=debug.getinfo(3,"Sl")
-  local line=t.currentline
-  io.write(t.short_src)
-  if line>=0 then io.write(":",line) end
-  io.write(": ",name," is now ",tostring(new)," (was ",tostring(old),")","\n")
- end
-
- local g={}
- local set=function (t,name,value)
-  log(name,g[name],value)
-  g[name]=value
- end
- setmetatable(getfenv(),{__index=g,__newindex=set})
-end
-
--- an example
-
-a=1
-b=2
-a=10
-b=20
-b=nil
-b=200
-print(a,b,c)
diff --git a/redis-stable/deps/lua/test/xd.lua b/redis-stable/deps/lua/test/xd.lua
deleted file mode 100644
index ebc3effc..00000000
--- a/redis-stable/deps/lua/test/xd.lua
+++ /dev/null
@@ -1,14 +0,0 @@
--- hex dump
--- usage: lua xd.lua < file
-
-local offset=0
-while true do
- local s=io.read(16)
- if s==nil then return end
- io.write(string.format("%08X  ",offset))
- string.gsub(s,"(.)",
-	function (c) io.write(string.format("%02X ",string.byte(c))) end)
- io.write(string.rep(" ",3*(16-string.len(s))))
- io.write(" ",string.gsub(s,"%c","."),"\n") 
- offset=offset+16
-end
diff --git a/redis-stable/deps/update-jemalloc.sh b/redis-stable/deps/update-jemalloc.sh
deleted file mode 100755
index 8ffbe1d7..00000000
--- a/redis-stable/deps/update-jemalloc.sh
+++ /dev/null
@@ -1,9 +0,0 @@
-#!/bin/bash
-VER=$1
-URL="http://www.canonware.com/download/jemalloc/jemalloc-${VER}.tar.bz2"
-echo "Downloading $URL"
-curl $URL > /tmp/jemalloc.tar.bz2
-tar xvjf /tmp/jemalloc.tar.bz2
-rm -rf jemalloc
-mv jemalloc-${VER} jemalloc
-echo "Use git status, add all files and commit changes."
diff --git a/redis-stable/redis.conf b/redis-stable/redis.conf
deleted file mode 100644
index e8eff277..00000000
--- a/redis-stable/redis.conf
+++ /dev/null
@@ -1,2051 +0,0 @@
-# Redis configuration file example.
-#
-# Note that in order to read the configuration file, Redis must be
-# started with the file path as first argument:
-#
-# ./redis-server /path/to/redis.conf
-
-# Note on units: when memory size is needed, it is possible to specify
-# it in the usual form of 1k 5GB 4M and so forth:
-#
-# 1k => 1000 bytes
-# 1kb => 1024 bytes
-# 1m => 1000000 bytes
-# 1mb => 1024*1024 bytes
-# 1g => 1000000000 bytes
-# 1gb => 1024*1024*1024 bytes
-#
-# units are case insensitive so 1GB 1Gb 1gB are all the same.
-
-################################## INCLUDES ###################################
-
-# Include one or more other config files here.  This is useful if you
-# have a standard template that goes to all Redis servers but also need
-# to customize a few per-server settings.  Include files can include
-# other files, so use this wisely.
-#
-# Note that option "include" won't be rewritten by command "CONFIG REWRITE"
-# from admin or Redis Sentinel. Since Redis always uses the last processed
-# line as value of a configuration directive, you'd better put includes
-# at the beginning of this file to avoid overwriting config change at runtime.
-#
-# If instead you are interested in using includes to override configuration
-# options, it is better to use include as the last line.
-#
-# include /path/to/local.conf
-# include /path/to/other.conf
-
-################################## MODULES #####################################
-
-# Load modules at startup. If the server is not able to load modules
-# it will abort. It is possible to use multiple loadmodule directives.
-#
-# loadmodule /path/to/my_module.so
-# loadmodule /path/to/other_module.so
-
-################################## NETWORK #####################################
-
-# By default, if no "bind" configuration directive is specified, Redis listens
-# for connections from all available network interfaces on the host machine.
-# It is possible to listen to just one or multiple selected interfaces using
-# the "bind" configuration directive, followed by one or more IP addresses.
-# Each address can be prefixed by "-", which means that redis will not fail to
-# start if the address is not available. Being not available only refers to
-# addresses that does not correspond to any network interfece. Addresses that
-# are already in use will always fail, and unsupported protocols will always BE
-# silently skipped.
-#
-# Examples:
-#
-# bind 192.168.1.100 10.0.0.1     # listens on two specific IPv4 addresses
-# bind 127.0.0.1 ::1              # listens on loopback IPv4 and IPv6
-# bind * -::*                     # like the default, all available interfaces
-#
-# ~~~ WARNING ~~~ If the computer running Redis is directly exposed to the
-# internet, binding to all the interfaces is dangerous and will expose the
-# instance to everybody on the internet. So by default we uncomment the
-# following bind directive, that will force Redis to listen only on the
-# IPv4 and IPv6 (if available) loopback interface addresses (this means Redis
-# will only be able to accept client connections from the same host that it is
-# running on).
-#
-# IF YOU ARE SURE YOU WANT YOUR INSTANCE TO LISTEN TO ALL THE INTERFACES
-# JUST COMMENT OUT THE FOLLOWING LINE.
-# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-bind 127.0.0.1 -::1
-
-# Protected mode is a layer of security protection, in order to avoid that
-# Redis instances left open on the internet are accessed and exploited.
-#
-# When protected mode is on and if:
-#
-# 1) The server is not binding explicitly to a set of addresses using the
-#    "bind" directive.
-# 2) No password is configured.
-#
-# The server only accepts connections from clients connecting from the
-# IPv4 and IPv6 loopback addresses 127.0.0.1 and ::1, and from Unix domain
-# sockets.
-#
-# By default protected mode is enabled. You should disable it only if
-# you are sure you want clients from other hosts to connect to Redis
-# even if no authentication is configured, nor a specific set of interfaces
-# are explicitly listed using the "bind" directive.
-protected-mode yes
-
-# Accept connections on the specified port, default is 6379 (IANA #815344).
-# If port 0 is specified Redis will not listen on a TCP socket.
-port 6379
-
-# TCP listen() backlog.
-#
-# In high requests-per-second environments you need a high backlog in order
-# to avoid slow clients connection issues. Note that the Linux kernel
-# will silently truncate it to the value of /proc/sys/net/core/somaxconn so
-# make sure to raise both the value of somaxconn and tcp_max_syn_backlog
-# in order to get the desired effect.
-tcp-backlog 511
-
-# Unix socket.
-#
-# Specify the path for the Unix socket that will be used to listen for
-# incoming connections. There is no default, so Redis will not listen
-# on a unix socket when not specified.
-#
-# unixsocket /run/redis.sock
-# unixsocketperm 700
-
-# Close the connection after a client is idle for N seconds (0 to disable)
-timeout 0
-
-# TCP keepalive.
-#
-# If non-zero, use SO_KEEPALIVE to send TCP ACKs to clients in absence
-# of communication. This is useful for two reasons:
-#
-# 1) Detect dead peers.
-# 2) Force network equipment in the middle to consider the connection to be
-#    alive.
-#
-# On Linux, the specified value (in seconds) is the period used to send ACKs.
-# Note that to close the connection the double of the time is needed.
-# On other kernels the period depends on the kernel configuration.
-#
-# A reasonable value for this option is 300 seconds, which is the new
-# Redis default starting with Redis 3.2.1.
-tcp-keepalive 300
-
-################################# TLS/SSL #####################################
-
-# By default, TLS/SSL is disabled. To enable it, the "tls-port" configuration
-# directive can be used to define TLS-listening ports. To enable TLS on the
-# default port, use:
-#
-# port 0
-# tls-port 6379
-
-# Configure a X.509 certificate and private key to use for authenticating the
-# server to connected clients, masters or cluster peers.  These files should be
-# PEM formatted.
-#
-# tls-cert-file redis.crt 
-# tls-key-file redis.key
-#
-# If the key file is encrypted using a passphrase, it can be included here
-# as well.
-#
-# tls-key-file-pass secret
-
-# Normally Redis uses the same certificate for both server functions (accepting
-# connections) and client functions (replicating from a master, establishing
-# cluster bus connections, etc.).
-#
-# Sometimes certificates are issued with attributes that designate them as
-# client-only or server-only certificates. In that case it may be desired to use
-# different certificates for incoming (server) and outgoing (client)
-# connections. To do that, use the following directives:
-#
-# tls-client-cert-file client.crt
-# tls-client-key-file client.key
-#
-# If the key file is encrypted using a passphrase, it can be included here
-# as well.
-#
-# tls-client-key-file-pass secret
-
-# Configure a DH parameters file to enable Diffie-Hellman (DH) key exchange:
-#
-# tls-dh-params-file redis.dh
-
-# Configure a CA certificate(s) bundle or directory to authenticate TLS/SSL
-# clients and peers.  Redis requires an explicit configuration of at least one
-# of these, and will not implicitly use the system wide configuration.
-#
-# tls-ca-cert-file ca.crt
-# tls-ca-cert-dir /etc/ssl/certs
-
-# By default, clients (including replica servers) on a TLS port are required
-# to authenticate using valid client side certificates.
-#
-# If "no" is specified, client certificates are not required and not accepted.
-# If "optional" is specified, client certificates are accepted and must be
-# valid if provided, but are not required.
-#
-# tls-auth-clients no
-# tls-auth-clients optional
-
-# By default, a Redis replica does not attempt to establish a TLS connection
-# with its master.
-#
-# Use the following directive to enable TLS on replication links.
-#
-# tls-replication yes
-
-# By default, the Redis Cluster bus uses a plain TCP connection. To enable
-# TLS for the bus protocol, use the following directive:
-#
-# tls-cluster yes
-
-# By default, only TLSv1.2 and TLSv1.3 are enabled and it is highly recommended
-# that older formally deprecated versions are kept disabled to reduce the attack surface.
-# You can explicitly specify TLS versions to support.
-# Allowed values are case insensitive and include "TLSv1", "TLSv1.1", "TLSv1.2",
-# "TLSv1.3" (OpenSSL >= 1.1.1) or any combination.
-# To enable only TLSv1.2 and TLSv1.3, use:
-#
-# tls-protocols "TLSv1.2 TLSv1.3"
-
-# Configure allowed ciphers.  See the ciphers(1ssl) manpage for more information
-# about the syntax of this string.
-#
-# Note: this configuration applies only to <= TLSv1.2.
-#
-# tls-ciphers DEFAULT:!MEDIUM
-
-# Configure allowed TLSv1.3 ciphersuites.  See the ciphers(1ssl) manpage for more
-# information about the syntax of this string, and specifically for TLSv1.3
-# ciphersuites.
-#
-# tls-ciphersuites TLS_CHACHA20_POLY1305_SHA256
-
-# When choosing a cipher, use the server's preference instead of the client
-# preference. By default, the server follows the client's preference.
-#
-# tls-prefer-server-ciphers yes
-
-# By default, TLS session caching is enabled to allow faster and less expensive
-# reconnections by clients that support it. Use the following directive to disable
-# caching.
-#
-# tls-session-caching no
-
-# Change the default number of TLS sessions cached. A zero value sets the cache
-# to unlimited size. The default size is 20480.
-#
-# tls-session-cache-size 5000
-
-# Change the default timeout of cached TLS sessions. The default timeout is 300
-# seconds.
-#
-# tls-session-cache-timeout 60
-
-################################# GENERAL #####################################
-
-# By default Redis does not run as a daemon. Use 'yes' if you need it.
-# Note that Redis will write a pid file in /var/run/redis.pid when daemonized.
-# When Redis is supervised by upstart or systemd, this parameter has no impact.
-daemonize no
-
-# If you run Redis from upstart or systemd, Redis can interact with your
-# supervision tree. Options:
-#   supervised no      - no supervision interaction
-#   supervised upstart - signal upstart by putting Redis into SIGSTOP mode
-#                        requires "expect stop" in your upstart job config
-#   supervised systemd - signal systemd by writing READY=1 to $NOTIFY_SOCKET
-#                        on startup, and updating Redis status on a regular
-#                        basis.
-#   supervised auto    - detect upstart or systemd method based on
-#                        UPSTART_JOB or NOTIFY_SOCKET environment variables
-# Note: these supervision methods only signal "process is ready."
-#       They do not enable continuous pings back to your supervisor.
-#
-# The default is "no". To run under upstart/systemd, you can simply uncomment
-# the line below:
-#
-# supervised auto
-
-# If a pid file is specified, Redis writes it where specified at startup
-# and removes it at exit.
-#
-# When the server runs non daemonized, no pid file is created if none is
-# specified in the configuration. When the server is daemonized, the pid file
-# is used even if not specified, defaulting to "/var/run/redis.pid".
-#
-# Creating a pid file is best effort: if Redis is not able to create it
-# nothing bad happens, the server will start and run normally.
-#
-# Note that on modern Linux systems "/run/redis.pid" is more conforming
-# and should be used instead.
-pidfile /var/run/redis_6379.pid
-
-# Specify the server verbosity level.
-# This can be one of:
-# debug (a lot of information, useful for development/testing)
-# verbose (many rarely useful info, but not a mess like the debug level)
-# notice (moderately verbose, what you want in production probably)
-# warning (only very important / critical messages are logged)
-loglevel notice
-
-# Specify the log file name. Also the empty string can be used to force
-# Redis to log on the standard output. Note that if you use standard
-# output for logging but daemonize, logs will be sent to /dev/null
-logfile ""
-
-# To enable logging to the system logger, just set 'syslog-enabled' to yes,
-# and optionally update the other syslog parameters to suit your needs.
-# syslog-enabled no
-
-# Specify the syslog identity.
-# syslog-ident redis
-
-# Specify the syslog facility. Must be USER or between LOCAL0-LOCAL7.
-# syslog-facility local0
-
-# To disable the built in crash log, which will possibly produce cleaner core
-# dumps when they are needed, uncomment the following:
-#
-# crash-log-enabled no
-
-# To disable the fast memory check that's run as part of the crash log, which
-# will possibly let redis terminate sooner, uncomment the following:
-#
-# crash-memcheck-enabled no
-
-# Set the number of databases. The default database is DB 0, you can select
-# a different one on a per-connection basis using SELECT <dbid> where
-# dbid is a number between 0 and 'databases'-1
-databases 16
-
-# By default Redis shows an ASCII art logo only when started to log to the
-# standard output and if the standard output is a TTY and syslog logging is
-# disabled. Basically this means that normally a logo is displayed only in
-# interactive sessions.
-#
-# However it is possible to force the pre-4.0 behavior and always show a
-# ASCII art logo in startup logs by setting the following option to yes.
-always-show-logo no
-
-# By default, Redis modifies the process title (as seen in 'top' and 'ps') to
-# provide some runtime information. It is possible to disable this and leave
-# the process name as executed by setting the following to no.
-set-proc-title yes
-
-# When changing the process title, Redis uses the following template to construct
-# the modified title.
-#
-# Template variables are specified in curly brackets. The following variables are
-# supported:
-#
-# {title}           Name of process as executed if parent, or type of child process.
-# {listen-addr}     Bind address or '*' followed by TCP or TLS port listening on, or
-#                   Unix socket if only that's available.
-# {server-mode}     Special mode, i.e. "[sentinel]" or "[cluster]".
-# {port}            TCP port listening on, or 0.
-# {tls-port}        TLS port listening on, or 0.
-# {unixsocket}      Unix domain socket listening on, or "".
-# {config-file}     Name of configuration file used.
-#
-proc-title-template "{title} {listen-addr} {server-mode}"
-
-################################ SNAPSHOTTING  ################################
-
-# Save the DB to disk.
-#
-# save <seconds> <changes>
-#
-# Redis will save the DB if both the given number of seconds and the given
-# number of write operations against the DB occurred.
-#
-# Snapshotting can be completely disabled with a single empty string argument
-# as in following example:
-#
-# save ""
-#
-# Unless specified otherwise, by default Redis will save the DB:
-#   * After 3600 seconds (an hour) if at least 1 key changed
-#   * After 300 seconds (5 minutes) if at least 100 keys changed
-#   * After 60 seconds if at least 10000 keys changed
-#
-# You can set these explicitly by uncommenting the three following lines.
-#
-# save 3600 1
-# save 300 100
-# save 60 10000
-
-# By default Redis will stop accepting writes if RDB snapshots are enabled
-# (at least one save point) and the latest background save failed.
-# This will make the user aware (in a hard way) that data is not persisting
-# on disk properly, otherwise chances are that no one will notice and some
-# disaster will happen.
-#
-# If the background saving process will start working again Redis will
-# automatically allow writes again.
-#
-# However if you have setup your proper monitoring of the Redis server
-# and persistence, you may want to disable this feature so that Redis will
-# continue to work as usual even if there are problems with disk,
-# permissions, and so forth.
-stop-writes-on-bgsave-error yes
-
-# Compress string objects using LZF when dump .rdb databases?
-# By default compression is enabled as it's almost always a win.
-# If you want to save some CPU in the saving child set it to 'no' but
-# the dataset will likely be bigger if you have compressible values or keys.
-rdbcompression yes
-
-# Since version 5 of RDB a CRC64 checksum is placed at the end of the file.
-# This makes the format more resistant to corruption but there is a performance
-# hit to pay (around 10%) when saving and loading RDB files, so you can disable it
-# for maximum performances.
-#
-# RDB files created with checksum disabled have a checksum of zero that will
-# tell the loading code to skip the check.
-rdbchecksum yes
-
-# Enables or disables full sanitation checks for ziplist and listpack etc when
-# loading an RDB or RESTORE payload. This reduces the chances of a assertion or
-# crash later on while processing commands.
-# Options:
-#   no         - Never perform full sanitation
-#   yes        - Always perform full sanitation
-#   clients    - Perform full sanitation only for user connections.
-#                Excludes: RDB files, RESTORE commands received from the master
-#                connection, and client connections which have the
-#                skip-sanitize-payload ACL flag.
-# The default should be 'clients' but since it currently affects cluster
-# resharding via MIGRATE, it is temporarily set to 'no' by default.
-#
-# sanitize-dump-payload no
-
-# The filename where to dump the DB
-dbfilename dump.rdb
-
-# Remove RDB files used by replication in instances without persistence
-# enabled. By default this option is disabled, however there are environments
-# where for regulations or other security concerns, RDB files persisted on
-# disk by masters in order to feed replicas, or stored on disk by replicas
-# in order to load them for the initial synchronization, should be deleted
-# ASAP. Note that this option ONLY WORKS in instances that have both AOF
-# and RDB persistence disabled, otherwise is completely ignored.
-#
-# An alternative (and sometimes better) way to obtain the same effect is
-# to use diskless replication on both master and replicas instances. However
-# in the case of replicas, diskless is not always an option.
-rdb-del-sync-files no
-
-# The working directory.
-#
-# The DB will be written inside this directory, with the filename specified
-# above using the 'dbfilename' configuration directive.
-#
-# The Append Only File will also be created inside this directory.
-#
-# Note that you must specify a directory here, not a file name.
-dir ./
-
-################################# REPLICATION #################################
-
-# Master-Replica replication. Use replicaof to make a Redis instance a copy of
-# another Redis server. A few things to understand ASAP about Redis replication.
-#
-#   +------------------+      +---------------+
-#   |      Master      | ---> |    Replica    |
-#   | (receive writes) |      |  (exact copy) |
-#   +------------------+      +---------------+
-#
-# 1) Redis replication is asynchronous, but you can configure a master to
-#    stop accepting writes if it appears to be not connected with at least
-#    a given number of replicas.
-# 2) Redis replicas are able to perform a partial resynchronization with the
-#    master if the replication link is lost for a relatively small amount of
-#    time. You may want to configure the replication backlog size (see the next
-#    sections of this file) with a sensible value depending on your needs.
-# 3) Replication is automatic and does not need user intervention. After a
-#    network partition replicas automatically try to reconnect to masters
-#    and resynchronize with them.
-#
-# replicaof <masterip> <masterport>
-
-# If the master is password protected (using the "requirepass" configuration
-# directive below) it is possible to tell the replica to authenticate before
-# starting the replication synchronization process, otherwise the master will
-# refuse the replica request.
-#
-# masterauth <master-password>
-#
-# However this is not enough if you are using Redis ACLs (for Redis version
-# 6 or greater), and the default user is not capable of running the PSYNC
-# command and/or other commands needed for replication. In this case it's
-# better to configure a special user to use with replication, and specify the
-# masteruser configuration as such:
-#
-# masteruser <username>
-#
-# When masteruser is specified, the replica will authenticate against its
-# master using the new AUTH form: AUTH <username> <password>.
-
-# When a replica loses its connection with the master, or when the replication
-# is still in progress, the replica can act in two different ways:
-#
-# 1) if replica-serve-stale-data is set to 'yes' (the default) the replica will
-#    still reply to client requests, possibly with out of date data, or the
-#    data set may just be empty if this is the first synchronization.
-#
-# 2) If replica-serve-stale-data is set to 'no' the replica will reply with
-#    an error "SYNC with master in progress" to all commands except:
-#    INFO, REPLICAOF, AUTH, PING, SHUTDOWN, REPLCONF, ROLE, CONFIG, SUBSCRIBE,
-#    UNSUBSCRIBE, PSUBSCRIBE, PUNSUBSCRIBE, PUBLISH, PUBSUB, COMMAND, POST,
-#    HOST and LATENCY.
-#
-replica-serve-stale-data yes
-
-# You can configure a replica instance to accept writes or not. Writing against
-# a replica instance may be useful to store some ephemeral data (because data
-# written on a replica will be easily deleted after resync with the master) but
-# may also cause problems if clients are writing to it because of a
-# misconfiguration.
-#
-# Since Redis 2.6 by default replicas are read-only.
-#
-# Note: read only replicas are not designed to be exposed to untrusted clients
-# on the internet. It's just a protection layer against misuse of the instance.
-# Still a read only replica exports by default all the administrative commands
-# such as CONFIG, DEBUG, and so forth. To a limited extent you can improve
-# security of read only replicas using 'rename-command' to shadow all the
-# administrative / dangerous commands.
-replica-read-only yes
-
-# Replication SYNC strategy: disk or socket.
-#
-# New replicas and reconnecting replicas that are not able to continue the
-# replication process just receiving differences, need to do what is called a
-# "full synchronization". An RDB file is transmitted from the master to the
-# replicas.
-#
-# The transmission can happen in two different ways:
-#
-# 1) Disk-backed: The Redis master creates a new process that writes the RDB
-#                 file on disk. Later the file is transferred by the parent
-#                 process to the replicas incrementally.
-# 2) Diskless: The Redis master creates a new process that directly writes the
-#              RDB file to replica sockets, without touching the disk at all.
-#
-# With disk-backed replication, while the RDB file is generated, more replicas
-# can be queued and served with the RDB file as soon as the current child
-# producing the RDB file finishes its work. With diskless replication instead
-# once the transfer starts, new replicas arriving will be queued and a new
-# transfer will start when the current one terminates.
-#
-# When diskless replication is used, the master waits a configurable amount of
-# time (in seconds) before starting the transfer in the hope that multiple
-# replicas will arrive and the transfer can be parallelized.
-#
-# With slow disks and fast (large bandwidth) networks, diskless replication
-# works better.
-repl-diskless-sync no
-
-# When diskless replication is enabled, it is possible to configure the delay
-# the server waits in order to spawn the child that transfers the RDB via socket
-# to the replicas.
-#
-# This is important since once the transfer starts, it is not possible to serve
-# new replicas arriving, that will be queued for the next RDB transfer, so the
-# server waits a delay in order to let more replicas arrive.
-#
-# The delay is specified in seconds, and by default is 5 seconds. To disable
-# it entirely just set it to 0 seconds and the transfer will start ASAP.
-repl-diskless-sync-delay 5
-
-# -----------------------------------------------------------------------------
-# WARNING: RDB diskless load is experimental. Since in this setup the replica
-# does not immediately store an RDB on disk, it may cause data loss during
-# failovers. RDB diskless load + Redis modules not handling I/O reads may also
-# cause Redis to abort in case of I/O errors during the initial synchronization
-# stage with the master. Use only if you know what you are doing.
-# -----------------------------------------------------------------------------
-#
-# Replica can load the RDB it reads from the replication link directly from the
-# socket, or store the RDB to a file and read that file after it was completely
-# received from the master.
-#
-# In many cases the disk is slower than the network, and storing and loading
-# the RDB file may increase replication time (and even increase the master's
-# Copy on Write memory and salve buffers).
-# However, parsing the RDB file directly from the socket may mean that we have
-# to flush the contents of the current database before the full rdb was
-# received. For this reason we have the following options:
-#
-# "disabled"    - Don't use diskless load (store the rdb file to the disk first)
-# "on-empty-db" - Use diskless load only when it is completely safe.
-# "swapdb"      - Keep a copy of the current db contents in RAM while parsing
-#                 the data directly from the socket. note that this requires
-#                 sufficient memory, if you don't have it, you risk an OOM kill.
-repl-diskless-load disabled
-
-# Replicas send PINGs to server in a predefined interval. It's possible to
-# change this interval with the repl_ping_replica_period option. The default
-# value is 10 seconds.
-#
-# repl-ping-replica-period 10
-
-# The following option sets the replication timeout for:
-#
-# 1) Bulk transfer I/O during SYNC, from the point of view of replica.
-# 2) Master timeout from the point of view of replicas (data, pings).
-# 3) Replica timeout from the point of view of masters (REPLCONF ACK pings).
-#
-# It is important to make sure that this value is greater than the value
-# specified for repl-ping-replica-period otherwise a timeout will be detected
-# every time there is low traffic between the master and the replica. The default
-# value is 60 seconds.
-#
-# repl-timeout 60
-
-# Disable TCP_NODELAY on the replica socket after SYNC?
-#
-# If you select "yes" Redis will use a smaller number of TCP packets and
-# less bandwidth to send data to replicas. But this can add a delay for
-# the data to appear on the replica side, up to 40 milliseconds with
-# Linux kernels using a default configuration.
-#
-# If you select "no" the delay for data to appear on the replica side will
-# be reduced but more bandwidth will be used for replication.
-#
-# By default we optimize for low latency, but in very high traffic conditions
-# or when the master and replicas are many hops away, turning this to "yes" may
-# be a good idea.
-repl-disable-tcp-nodelay no
-
-# Set the replication backlog size. The backlog is a buffer that accumulates
-# replica data when replicas are disconnected for some time, so that when a
-# replica wants to reconnect again, often a full resync is not needed, but a
-# partial resync is enough, just passing the portion of data the replica
-# missed while disconnected.
-#
-# The bigger the replication backlog, the longer the replica can endure the
-# disconnect and later be able to perform a partial resynchronization.
-#
-# The backlog is only allocated if there is at least one replica connected.
-#
-# repl-backlog-size 1mb
-
-# After a master has no connected replicas for some time, the backlog will be
-# freed. The following option configures the amount of seconds that need to
-# elapse, starting from the time the last replica disconnected, for the backlog
-# buffer to be freed.
-#
-# Note that replicas never free the backlog for timeout, since they may be
-# promoted to masters later, and should be able to correctly "partially
-# resynchronize" with other replicas: hence they should always accumulate backlog.
-#
-# A value of 0 means to never release the backlog.
-#
-# repl-backlog-ttl 3600
-
-# The replica priority is an integer number published by Redis in the INFO
-# output. It is used by Redis Sentinel in order to select a replica to promote
-# into a master if the master is no longer working correctly.
-#
-# A replica with a low priority number is considered better for promotion, so
-# for instance if there are three replicas with priority 10, 100, 25 Sentinel
-# will pick the one with priority 10, that is the lowest.
-#
-# However a special priority of 0 marks the replica as not able to perform the
-# role of master, so a replica with priority of 0 will never be selected by
-# Redis Sentinel for promotion.
-#
-# By default the priority is 100.
-replica-priority 100
-
-# -----------------------------------------------------------------------------
-# By default, Redis Sentinel includes all replicas in its reports. A replica
-# can be excluded from Redis Sentinel's announcements. An unannounced replica
-# will be ignored by the 'sentinel replicas <master>' command and won't be
-# exposed to Redis Sentinel's clients.
-#
-# This option does not change the behavior of replica-priority. Even with
-# replica-announced set to 'no', the replica can be promoted to master. To
-# prevent this behavior, set replica-priority to 0.
-#
-# replica-announced yes
-
-# It is possible for a master to stop accepting writes if there are less than
-# N replicas connected, having a lag less or equal than M seconds.
-#
-# The N replicas need to be in "online" state.
-#
-# The lag in seconds, that must be <= the specified value, is calculated from
-# the last ping received from the replica, that is usually sent every second.
-#
-# This option does not GUARANTEE that N replicas will accept the write, but
-# will limit the window of exposure for lost writes in case not enough replicas
-# are available, to the specified number of seconds.
-#
-# For example to require at least 3 replicas with a lag <= 10 seconds use:
-#
-# min-replicas-to-write 3
-# min-replicas-max-lag 10
-#
-# Setting one or the other to 0 disables the feature.
-#
-# By default min-replicas-to-write is set to 0 (feature disabled) and
-# min-replicas-max-lag is set to 10.
-
-# A Redis master is able to list the address and port of the attached
-# replicas in different ways. For example the "INFO replication" section
-# offers this information, which is used, among other tools, by
-# Redis Sentinel in order to discover replica instances.
-# Another place where this info is available is in the output of the
-# "ROLE" command of a master.
-#
-# The listed IP address and port normally reported by a replica is
-# obtained in the following way:
-#
-#   IP: The address is auto detected by checking the peer address
-#   of the socket used by the replica to connect with the master.
-#
-#   Port: The port is communicated by the replica during the replication
-#   handshake, and is normally the port that the replica is using to
-#   listen for connections.
-#
-# However when port forwarding or Network Address Translation (NAT) is
-# used, the replica may actually be reachable via different IP and port
-# pairs. The following two options can be used by a replica in order to
-# report to its master a specific set of IP and port, so that both INFO
-# and ROLE will report those values.
-#
-# There is no need to use both the options if you need to override just
-# the port or the IP address.
-#
-# replica-announce-ip 5.5.5.5
-# replica-announce-port 1234
-
-############################### KEYS TRACKING #################################
-
-# Redis implements server assisted support for client side caching of values.
-# This is implemented using an invalidation table that remembers, using
-# a radix key indexed by key name, what clients have which keys. In turn
-# this is used in order to send invalidation messages to clients. Please
-# check this page to understand more about the feature:
-#
-#   https://redis.io/topics/client-side-caching
-#
-# When tracking is enabled for a client, all the read only queries are assumed
-# to be cached: this will force Redis to store information in the invalidation
-# table. When keys are modified, such information is flushed away, and
-# invalidation messages are sent to the clients. However if the workload is
-# heavily dominated by reads, Redis could use more and more memory in order
-# to track the keys fetched by many clients.
-#
-# For this reason it is possible to configure a maximum fill value for the
-# invalidation table. By default it is set to 1M of keys, and once this limit
-# is reached, Redis will start to evict keys in the invalidation table
-# even if they were not modified, just to reclaim memory: this will in turn
-# force the clients to invalidate the cached values. Basically the table
-# maximum size is a trade off between the memory you want to spend server
-# side to track information about who cached what, and the ability of clients
-# to retain cached objects in memory.
-#
-# If you set the value to 0, it means there are no limits, and Redis will
-# retain as many keys as needed in the invalidation table.
-# In the "stats" INFO section, you can find information about the number of
-# keys in the invalidation table at every given moment.
-#
-# Note: when key tracking is used in broadcasting mode, no memory is used
-# in the server side so this setting is useless.
-#
-# tracking-table-max-keys 1000000
-
-################################## SECURITY ###################################
-
-# Warning: since Redis is pretty fast, an outside user can try up to
-# 1 million passwords per second against a modern box. This means that you
-# should use very strong passwords, otherwise they will be very easy to break.
-# Note that because the password is really a shared secret between the client
-# and the server, and should not be memorized by any human, the password
-# can be easily a long string from /dev/urandom or whatever, so by using a
-# long and unguessable password no brute force attack will be possible.
-
-# Redis ACL users are defined in the following format:
-#
-#   user <username> ... acl rules ...
-#
-# For example:
-#
-#   user worker +@list +@connection ~jobs:* on >ffa9203c493aa99
-#
-# The special username "default" is used for new connections. If this user
-# has the "nopass" rule, then new connections will be immediately authenticated
-# as the "default" user without the need of any password provided via the
-# AUTH command. Otherwise if the "default" user is not flagged with "nopass"
-# the connections will start in not authenticated state, and will require
-# AUTH (or the HELLO command AUTH option) in order to be authenticated and
-# start to work.
-#
-# The ACL rules that describe what a user can do are the following:
-#
-#  on           Enable the user: it is possible to authenticate as this user.
-#  off          Disable the user: it's no longer possible to authenticate
-#               with this user, however the already authenticated connections
-#               will still work.
-#  skip-sanitize-payload    RESTORE dump-payload sanitation is skipped.
-#  sanitize-payload         RESTORE dump-payload is sanitized (default).
-#  +<command>   Allow the execution of that command
-#  -<command>   Disallow the execution of that command
-#  +@<category> Allow the execution of all the commands in such category
-#               with valid categories are like @admin, @set, @sortedset, ...
-#               and so forth, see the full list in the server.c file where
-#               the Redis command table is described and defined.
-#               The special category @all means all the commands, but currently
-#               present in the server, and that will be loaded in the future
-#               via modules.
-#  +<command>|subcommand    Allow a specific subcommand of an otherwise
-#                           disabled command. Note that this form is not
-#                           allowed as negative like -DEBUG|SEGFAULT, but
-#                           only additive starting with "+".
-#  allcommands  Alias for +@all. Note that it implies the ability to execute
-#               all the future commands loaded via the modules system.
-#  nocommands   Alias for -@all.
-#  ~<pattern>   Add a pattern of keys that can be mentioned as part of
-#               commands. For instance ~* allows all the keys. The pattern
-#               is a glob-style pattern like the one of KEYS.
-#               It is possible to specify multiple patterns.
-#  allkeys      Alias for ~*
-#  resetkeys    Flush the list of allowed keys patterns.
-#  &<pattern>   Add a glob-style pattern of Pub/Sub channels that can be
-#               accessed by the user. It is possible to specify multiple channel
-#               patterns.
-#  allchannels  Alias for &*
-#  resetchannels            Flush the list of allowed channel patterns.
-#  ><password>  Add this password to the list of valid password for the user.
-#               For example >mypass will add "mypass" to the list.
-#               This directive clears the "nopass" flag (see later).
-#  <<password>  Remove this password from the list of valid passwords.
-#  nopass       All the set passwords of the user are removed, and the user
-#               is flagged as requiring no password: it means that every
-#               password will work against this user. If this directive is
-#               used for the default user, every new connection will be
-#               immediately authenticated with the default user without
-#               any explicit AUTH command required. Note that the "resetpass"
-#               directive will clear this condition.
-#  resetpass    Flush the list of allowed passwords. Moreover removes the
-#               "nopass" status. After "resetpass" the user has no associated
-#               passwords and there is no way to authenticate without adding
-#               some password (or setting it as "nopass" later).
-#  reset        Performs the following actions: resetpass, resetkeys, off,
-#               -@all. The user returns to the same state it has immediately
-#               after its creation.
-#
-# ACL rules can be specified in any order: for instance you can start with
-# passwords, then flags, or key patterns. However note that the additive
-# and subtractive rules will CHANGE MEANING depending on the ordering.
-# For instance see the following example:
-#
-#   user alice on +@all -DEBUG ~* >somepassword
-#
-# This will allow "alice" to use all the commands with the exception of the
-# DEBUG command, since +@all added all the commands to the set of the commands
-# alice can use, and later DEBUG was removed. However if we invert the order
-# of two ACL rules the result will be different:
-#
-#   user alice on -DEBUG +@all ~* >somepassword
-#
-# Now DEBUG was removed when alice had yet no commands in the set of allowed
-# commands, later all the commands are added, so the user will be able to
-# execute everything.
-#
-# Basically ACL rules are processed left-to-right.
-#
-# For more information about ACL configuration please refer to
-# the Redis web site at https://redis.io/topics/acl
-
-# ACL LOG
-#
-# The ACL Log tracks failed commands and authentication events associated
-# with ACLs. The ACL Log is useful to troubleshoot failed commands blocked 
-# by ACLs. The ACL Log is stored in memory. You can reclaim memory with 
-# ACL LOG RESET. Define the maximum entry length of the ACL Log below.
-acllog-max-len 128
-
-# Using an external ACL file
-#
-# Instead of configuring users here in this file, it is possible to use
-# a stand-alone file just listing users. The two methods cannot be mixed:
-# if you configure users here and at the same time you activate the external
-# ACL file, the server will refuse to start.
-#
-# The format of the external ACL user file is exactly the same as the
-# format that is used inside redis.conf to describe users.
-#
-# aclfile /etc/redis/users.acl
-
-# IMPORTANT NOTE: starting with Redis 6 "requirepass" is just a compatibility
-# layer on top of the new ACL system. The option effect will be just setting
-# the password for the default user. Clients will still authenticate using
-# AUTH <password> as usually, or more explicitly with AUTH default <password>
-# if they follow the new protocol: both will work.
-#
-# The requirepass is not compatable with aclfile option and the ACL LOAD
-# command, these will cause requirepass to be ignored.
-#
-# requirepass foobared
-
-# New users are initialized with restrictive permissions by default, via the
-# equivalent of this ACL rule 'off resetkeys -@all'. Starting with Redis 6.2, it
-# is possible to manage access to Pub/Sub channels with ACL rules as well. The
-# default Pub/Sub channels permission if new users is controlled by the 
-# acl-pubsub-default configuration directive, which accepts one of these values:
-#
-# allchannels: grants access to all Pub/Sub channels
-# resetchannels: revokes access to all Pub/Sub channels
-#
-# To ensure backward compatibility while upgrading Redis 6.0, acl-pubsub-default
-# defaults to the 'allchannels' permission.
-#
-# Future compatibility note: it is very likely that in a future version of Redis
-# the directive's default of 'allchannels' will be changed to 'resetchannels' in
-# order to provide better out-of-the-box Pub/Sub security. Therefore, it is
-# recommended that you explicitly define Pub/Sub permissions for all users
-# rather then rely on implicit default values. Once you've set explicit
-# Pub/Sub for all existing users, you should uncomment the following line.
-#
-# acl-pubsub-default resetchannels
-
-# Command renaming (DEPRECATED).
-#
-# ------------------------------------------------------------------------
-# WARNING: avoid using this option if possible. Instead use ACLs to remove
-# commands from the default user, and put them only in some admin user you
-# create for administrative purposes.
-# ------------------------------------------------------------------------
-#
-# It is possible to change the name of dangerous commands in a shared
-# environment. For instance the CONFIG command may be renamed into something
-# hard to guess so that it will still be available for internal-use tools
-# but not available for general clients.
-#
-# Example:
-#
-# rename-command CONFIG b840fc02d524045429941cc15f59e41cb7be6c52
-#
-# It is also possible to completely kill a command by renaming it into
-# an empty string:
-#
-# rename-command CONFIG ""
-#
-# Please note that changing the name of commands that are logged into the
-# AOF file or transmitted to replicas may cause problems.
-
-################################### CLIENTS ####################################
-
-# Set the max number of connected clients at the same time. By default
-# this limit is set to 10000 clients, however if the Redis server is not
-# able to configure the process file limit to allow for the specified limit
-# the max number of allowed clients is set to the current file limit
-# minus 32 (as Redis reserves a few file descriptors for internal uses).
-#
-# Once the limit is reached Redis will close all the new connections sending
-# an error 'max number of clients reached'.
-#
-# IMPORTANT: When Redis Cluster is used, the max number of connections is also
-# shared with the cluster bus: every node in the cluster will use two
-# connections, one incoming and another outgoing. It is important to size the
-# limit accordingly in case of very large clusters.
-#
-# maxclients 10000
-
-############################## MEMORY MANAGEMENT ################################
-
-# Set a memory usage limit to the specified amount of bytes.
-# When the memory limit is reached Redis will try to remove keys
-# according to the eviction policy selected (see maxmemory-policy).
-#
-# If Redis can't remove keys according to the policy, or if the policy is
-# set to 'noeviction', Redis will start to reply with errors to commands
-# that would use more memory, like SET, LPUSH, and so on, and will continue
-# to reply to read-only commands like GET.
-#
-# This option is usually useful when using Redis as an LRU or LFU cache, or to
-# set a hard memory limit for an instance (using the 'noeviction' policy).
-#
-# WARNING: If you have replicas attached to an instance with maxmemory on,
-# the size of the output buffers needed to feed the replicas are subtracted
-# from the used memory count, so that network problems / resyncs will
-# not trigger a loop where keys are evicted, and in turn the output
-# buffer of replicas is full with DELs of keys evicted triggering the deletion
-# of more keys, and so forth until the database is completely emptied.
-#
-# In short... if you have replicas attached it is suggested that you set a lower
-# limit for maxmemory so that there is some free RAM on the system for replica
-# output buffers (but this is not needed if the policy is 'noeviction').
-#
-# maxmemory <bytes>
-
-# MAXMEMORY POLICY: how Redis will select what to remove when maxmemory
-# is reached. You can select one from the following behaviors:
-#
-# volatile-lru -> Evict using approximated LRU, only keys with an expire set.
-# allkeys-lru -> Evict any key using approximated LRU.
-# volatile-lfu -> Evict using approximated LFU, only keys with an expire set.
-# allkeys-lfu -> Evict any key using approximated LFU.
-# volatile-random -> Remove a random key having an expire set.
-# allkeys-random -> Remove a random key, any key.
-# volatile-ttl -> Remove the key with the nearest expire time (minor TTL)
-# noeviction -> Don't evict anything, just return an error on write operations.
-#
-# LRU means Least Recently Used
-# LFU means Least Frequently Used
-#
-# Both LRU, LFU and volatile-ttl are implemented using approximated
-# randomized algorithms.
-#
-# Note: with any of the above policies, when there are no suitable keys for
-# eviction, Redis will return an error on write operations that require
-# more memory. These are usually commands that create new keys, add data or
-# modify existing keys. A few examples are: SET, INCR, HSET, LPUSH, SUNIONSTORE,
-# SORT (due to the STORE argument), and EXEC (if the transaction includes any
-# command that requires memory).
-#
-# The default is:
-#
-# maxmemory-policy noeviction
-
-# LRU, LFU and minimal TTL algorithms are not precise algorithms but approximated
-# algorithms (in order to save memory), so you can tune it for speed or
-# accuracy. By default Redis will check five keys and pick the one that was
-# used least recently, you can change the sample size using the following
-# configuration directive.
-#
-# The default of 5 produces good enough results. 10 Approximates very closely
-# true LRU but costs more CPU. 3 is faster but not very accurate.
-#
-# maxmemory-samples 5
-
-# Eviction processing is designed to function well with the default setting.
-# If there is an unusually large amount of write traffic, this value may need to
-# be increased.  Decreasing this value may reduce latency at the risk of 
-# eviction processing effectiveness
-#   0 = minimum latency, 10 = default, 100 = process without regard to latency
-#
-# maxmemory-eviction-tenacity 10
-
-# Starting from Redis 5, by default a replica will ignore its maxmemory setting
-# (unless it is promoted to master after a failover or manually). It means
-# that the eviction of keys will be just handled by the master, sending the
-# DEL commands to the replica as keys evict in the master side.
-#
-# This behavior ensures that masters and replicas stay consistent, and is usually
-# what you want, however if your replica is writable, or you want the replica
-# to have a different memory setting, and you are sure all the writes performed
-# to the replica are idempotent, then you may change this default (but be sure
-# to understand what you are doing).
-#
-# Note that since the replica by default does not evict, it may end using more
-# memory than the one set via maxmemory (there are certain buffers that may
-# be larger on the replica, or data structures may sometimes take more memory
-# and so forth). So make sure you monitor your replicas and make sure they
-# have enough memory to never hit a real out-of-memory condition before the
-# master hits the configured maxmemory setting.
-#
-# replica-ignore-maxmemory yes
-
-# Redis reclaims expired keys in two ways: upon access when those keys are
-# found to be expired, and also in background, in what is called the
-# "active expire key". The key space is slowly and interactively scanned
-# looking for expired keys to reclaim, so that it is possible to free memory
-# of keys that are expired and will never be accessed again in a short time.
-#
-# The default effort of the expire cycle will try to avoid having more than
-# ten percent of expired keys still in memory, and will try to avoid consuming
-# more than 25% of total memory and to add latency to the system. However
-# it is possible to increase the expire "effort" that is normally set to
-# "1", to a greater value, up to the value "10". At its maximum value the
-# system will use more CPU, longer cycles (and technically may introduce
-# more latency), and will tolerate less already expired keys still present
-# in the system. It's a tradeoff between memory, CPU and latency.
-#
-# active-expire-effort 1
-
-############################# LAZY FREEING ####################################
-
-# Redis has two primitives to delete keys. One is called DEL and is a blocking
-# deletion of the object. It means that the server stops processing new commands
-# in order to reclaim all the memory associated with an object in a synchronous
-# way. If the key deleted is associated with a small object, the time needed
-# in order to execute the DEL command is very small and comparable to most other
-# O(1) or O(log_N) commands in Redis. However if the key is associated with an
-# aggregated value containing millions of elements, the server can block for
-# a long time (even seconds) in order to complete the operation.
-#
-# For the above reasons Redis also offers non blocking deletion primitives
-# such as UNLINK (non blocking DEL) and the ASYNC option of FLUSHALL and
-# FLUSHDB commands, in order to reclaim memory in background. Those commands
-# are executed in constant time. Another thread will incrementally free the
-# object in the background as fast as possible.
-#
-# DEL, UNLINK and ASYNC option of FLUSHALL and FLUSHDB are user-controlled.
-# It's up to the design of the application to understand when it is a good
-# idea to use one or the other. However the Redis server sometimes has to
-# delete keys or flush the whole database as a side effect of other operations.
-# Specifically Redis deletes objects independently of a user call in the
-# following scenarios:
-#
-# 1) On eviction, because of the maxmemory and maxmemory policy configurations,
-#    in order to make room for new data, without going over the specified
-#    memory limit.
-# 2) Because of expire: when a key with an associated time to live (see the
-#    EXPIRE command) must be deleted from memory.
-# 3) Because of a side effect of a command that stores data on a key that may
-#    already exist. For example the RENAME command may delete the old key
-#    content when it is replaced with another one. Similarly SUNIONSTORE
-#    or SORT with STORE option may delete existing keys. The SET command
-#    itself removes any old content of the specified key in order to replace
-#    it with the specified string.
-# 4) During replication, when a replica performs a full resynchronization with
-#    its master, the content of the whole database is removed in order to
-#    load the RDB file just transferred.
-#
-# In all the above cases the default is to delete objects in a blocking way,
-# like if DEL was called. However you can configure each case specifically
-# in order to instead release memory in a non-blocking way like if UNLINK
-# was called, using the following configuration directives.
-
-lazyfree-lazy-eviction no
-lazyfree-lazy-expire no
-lazyfree-lazy-server-del no
-replica-lazy-flush no
-
-# It is also possible, for the case when to replace the user code DEL calls
-# with UNLINK calls is not easy, to modify the default behavior of the DEL
-# command to act exactly like UNLINK, using the following configuration
-# directive:
-
-lazyfree-lazy-user-del no
-
-# FLUSHDB, FLUSHALL, and SCRIPT FLUSH support both asynchronous and synchronous
-# deletion, which can be controlled by passing the [SYNC|ASYNC] flags into the
-# commands. When neither flag is passed, this directive will be used to determine
-# if the data should be deleted asynchronously.
-
-lazyfree-lazy-user-flush no
-
-################################ THREADED I/O #################################
-
-# Redis is mostly single threaded, however there are certain threaded
-# operations such as UNLINK, slow I/O accesses and other things that are
-# performed on side threads.
-#
-# Now it is also possible to handle Redis clients socket reads and writes
-# in different I/O threads. Since especially writing is so slow, normally
-# Redis users use pipelining in order to speed up the Redis performances per
-# core, and spawn multiple instances in order to scale more. Using I/O
-# threads it is possible to easily speedup two times Redis without resorting
-# to pipelining nor sharding of the instance.
-#
-# By default threading is disabled, we suggest enabling it only in machines
-# that have at least 4 or more cores, leaving at least one spare core.
-# Using more than 8 threads is unlikely to help much. We also recommend using
-# threaded I/O only if you actually have performance problems, with Redis
-# instances being able to use a quite big percentage of CPU time, otherwise
-# there is no point in using this feature.
-#
-# So for instance if you have a four cores boxes, try to use 2 or 3 I/O
-# threads, if you have a 8 cores, try to use 6 threads. In order to
-# enable I/O threads use the following configuration directive:
-#
-# io-threads 4
-#
-# Setting io-threads to 1 will just use the main thread as usual.
-# When I/O threads are enabled, we only use threads for writes, that is
-# to thread the write(2) syscall and transfer the client buffers to the
-# socket. However it is also possible to enable threading of reads and
-# protocol parsing using the following configuration directive, by setting
-# it to yes:
-#
-# io-threads-do-reads no
-#
-# Usually threading reads doesn't help much.
-#
-# NOTE 1: This configuration directive cannot be changed at runtime via
-# CONFIG SET. Aso this feature currently does not work when SSL is
-# enabled.
-#
-# NOTE 2: If you want to test the Redis speedup using redis-benchmark, make
-# sure you also run the benchmark itself in threaded mode, using the
-# --threads option to match the number of Redis threads, otherwise you'll not
-# be able to notice the improvements.
-
-############################ KERNEL OOM CONTROL ##############################
-
-# On Linux, it is possible to hint the kernel OOM killer on what processes
-# should be killed first when out of memory.
-#
-# Enabling this feature makes Redis actively control the oom_score_adj value
-# for all its processes, depending on their role. The default scores will
-# attempt to have background child processes killed before all others, and
-# replicas killed before masters.
-#
-# Redis supports three options:
-#
-# no:       Don't make changes to oom-score-adj (default).
-# yes:      Alias to "relative" see below.
-# absolute: Values in oom-score-adj-values are written as is to the kernel.
-# relative: Values are used relative to the initial value of oom_score_adj when
-#           the server starts and are then clamped to a range of -1000 to 1000.
-#           Because typically the initial value is 0, they will often match the
-#           absolute values.
-oom-score-adj no
-
-# When oom-score-adj is used, this directive controls the specific values used
-# for master, replica and background child processes. Values range -2000 to
-# 2000 (higher means more likely to be killed).
-#
-# Unprivileged processes (not root, and without CAP_SYS_RESOURCE capabilities)
-# can freely increase their value, but not decrease it below its initial
-# settings. This means that setting oom-score-adj to "relative" and setting the
-# oom-score-adj-values to positive values will always succeed.
-oom-score-adj-values 0 200 800
-
-
-#################### KERNEL transparent hugepage CONTROL ######################
-
-# Usually the kernel Transparent Huge Pages control is set to "madvise" or
-# or "never" by default (/sys/kernel/mm/transparent_hugepage/enabled), in which
-# case this config has no effect. On systems in which it is set to "always",
-# redis will attempt to disable it specifically for the redis process in order
-# to avoid latency problems specifically with fork(2) and CoW.
-# If for some reason you prefer to keep it enabled, you can set this config to
-# "no" and the kernel global to "always".
-
-disable-thp yes
-
-############################## APPEND ONLY MODE ###############################
-
-# By default Redis asynchronously dumps the dataset on disk. This mode is
-# good enough in many applications, but an issue with the Redis process or
-# a power outage may result into a few minutes of writes lost (depending on
-# the configured save points).
-#
-# The Append Only File is an alternative persistence mode that provides
-# much better durability. For instance using the default data fsync policy
-# (see later in the config file) Redis can lose just one second of writes in a
-# dramatic event like a server power outage, or a single write if something
-# wrong with the Redis process itself happens, but the operating system is
-# still running correctly.
-#
-# AOF and RDB persistence can be enabled at the same time without problems.
-# If the AOF is enabled on startup Redis will load the AOF, that is the file
-# with the better durability guarantees.
-#
-# Please check https://redis.io/topics/persistence for more information.
-
-appendonly no
-
-# The name of the append only file (default: "appendonly.aof")
-
-appendfilename "appendonly.aof"
-
-# The fsync() call tells the Operating System to actually write data on disk
-# instead of waiting for more data in the output buffer. Some OS will really flush
-# data on disk, some other OS will just try to do it ASAP.
-#
-# Redis supports three different modes:
-#
-# no: don't fsync, just let the OS flush the data when it wants. Faster.
-# always: fsync after every write to the append only log. Slow, Safest.
-# everysec: fsync only one time every second. Compromise.
-#
-# The default is "everysec", as that's usually the right compromise between
-# speed and data safety. It's up to you to understand if you can relax this to
-# "no" that will let the operating system flush the output buffer when
-# it wants, for better performances (but if you can live with the idea of
-# some data loss consider the default persistence mode that's snapshotting),
-# or on the contrary, use "always" that's very slow but a bit safer than
-# everysec.
-#
-# More details please check the following article:
-# http://antirez.com/post/redis-persistence-demystified.html
-#
-# If unsure, use "everysec".
-
-# appendfsync always
-appendfsync everysec
-# appendfsync no
-
-# When the AOF fsync policy is set to always or everysec, and a background
-# saving process (a background save or AOF log background rewriting) is
-# performing a lot of I/O against the disk, in some Linux configurations
-# Redis may block too long on the fsync() call. Note that there is no fix for
-# this currently, as even performing fsync in a different thread will block
-# our synchronous write(2) call.
-#
-# In order to mitigate this problem it's possible to use the following option
-# that will prevent fsync() from being called in the main process while a
-# BGSAVE or BGREWRITEAOF is in progress.
-#
-# This means that while another child is saving, the durability of Redis is
-# the same as "appendfsync none". In practical terms, this means that it is
-# possible to lose up to 30 seconds of log in the worst scenario (with the
-# default Linux settings).
-#
-# If you have latency problems turn this to "yes". Otherwise leave it as
-# "no" that is the safest pick from the point of view of durability.
-
-no-appendfsync-on-rewrite no
-
-# Automatic rewrite of the append only file.
-# Redis is able to automatically rewrite the log file implicitly calling
-# BGREWRITEAOF when the AOF log size grows by the specified percentage.
-#
-# This is how it works: Redis remembers the size of the AOF file after the
-# latest rewrite (if no rewrite has happened since the restart, the size of
-# the AOF at startup is used).
-#
-# This base size is compared to the current size. If the current size is
-# bigger than the specified percentage, the rewrite is triggered. Also
-# you need to specify a minimal size for the AOF file to be rewritten, this
-# is useful to avoid rewriting the AOF file even if the percentage increase
-# is reached but it is still pretty small.
-#
-# Specify a percentage of zero in order to disable the automatic AOF
-# rewrite feature.
-
-auto-aof-rewrite-percentage 100
-auto-aof-rewrite-min-size 64mb
-
-# An AOF file may be found to be truncated at the end during the Redis
-# startup process, when the AOF data gets loaded back into memory.
-# This may happen when the system where Redis is running
-# crashes, especially when an ext4 filesystem is mounted without the
-# data=ordered option (however this can't happen when Redis itself
-# crashes or aborts but the operating system still works correctly).
-#
-# Redis can either exit with an error when this happens, or load as much
-# data as possible (the default now) and start if the AOF file is found
-# to be truncated at the end. The following option controls this behavior.
-#
-# If aof-load-truncated is set to yes, a truncated AOF file is loaded and
-# the Redis server starts emitting a log to inform the user of the event.
-# Otherwise if the option is set to no, the server aborts with an error
-# and refuses to start. When the option is set to no, the user requires
-# to fix the AOF file using the "redis-check-aof" utility before to restart
-# the server.
-#
-# Note that if the AOF file will be found to be corrupted in the middle
-# the server will still exit with an error. This option only applies when
-# Redis will try to read more data from the AOF file but not enough bytes
-# will be found.
-aof-load-truncated yes
-
-# When rewriting the AOF file, Redis is able to use an RDB preamble in the
-# AOF file for faster rewrites and recoveries. When this option is turned
-# on the rewritten AOF file is composed of two different stanzas:
-#
-#   [RDB file][AOF tail]
-#
-# When loading, Redis recognizes that the AOF file starts with the "REDIS"
-# string and loads the prefixed RDB file, then continues loading the AOF
-# tail.
-aof-use-rdb-preamble yes
-
-################################ LUA SCRIPTING  ###############################
-
-# Max execution time of a Lua script in milliseconds.
-#
-# If the maximum execution time is reached Redis will log that a script is
-# still in execution after the maximum allowed time and will start to
-# reply to queries with an error.
-#
-# When a long running script exceeds the maximum execution time only the
-# SCRIPT KILL and SHUTDOWN NOSAVE commands are available. The first can be
-# used to stop a script that did not yet call any write commands. The second
-# is the only way to shut down the server in the case a write command was
-# already issued by the script but the user doesn't want to wait for the natural
-# termination of the script.
-#
-# Set it to 0 or a negative value for unlimited execution without warnings.
-lua-time-limit 5000
-
-################################ REDIS CLUSTER  ###############################
-
-# Normal Redis instances can't be part of a Redis Cluster; only nodes that are
-# started as cluster nodes can. In order to start a Redis instance as a
-# cluster node enable the cluster support uncommenting the following:
-#
-# cluster-enabled yes
-
-# Every cluster node has a cluster configuration file. This file is not
-# intended to be edited by hand. It is created and updated by Redis nodes.
-# Every Redis Cluster node requires a different cluster configuration file.
-# Make sure that instances running in the same system do not have
-# overlapping cluster configuration file names.
-#
-# cluster-config-file nodes-6379.conf
-
-# Cluster node timeout is the amount of milliseconds a node must be unreachable
-# for it to be considered in failure state.
-# Most other internal time limits are a multiple of the node timeout.
-#
-# cluster-node-timeout 15000
-
-# A replica of a failing master will avoid to start a failover if its data
-# looks too old.
-#
-# There is no simple way for a replica to actually have an exact measure of
-# its "data age", so the following two checks are performed:
-#
-# 1) If there are multiple replicas able to failover, they exchange messages
-#    in order to try to give an advantage to the replica with the best
-#    replication offset (more data from the master processed).
-#    Replicas will try to get their rank by offset, and apply to the start
-#    of the failover a delay proportional to their rank.
-#
-# 2) Every single replica computes the time of the last interaction with
-#    its master. This can be the last ping or command received (if the master
-#    is still in the "connected" state), or the time that elapsed since the
-#    disconnection with the master (if the replication link is currently down).
-#    If the last interaction is too old, the replica will not try to failover
-#    at all.
-#
-# The point "2" can be tuned by user. Specifically a replica will not perform
-# the failover if, since the last interaction with the master, the time
-# elapsed is greater than:
-#
-#   (node-timeout * cluster-replica-validity-factor) + repl-ping-replica-period
-#
-# So for example if node-timeout is 30 seconds, and the cluster-replica-validity-factor
-# is 10, and assuming a default repl-ping-replica-period of 10 seconds, the
-# replica will not try to failover if it was not able to talk with the master
-# for longer than 310 seconds.
-#
-# A large cluster-replica-validity-factor may allow replicas with too old data to failover
-# a master, while a too small value may prevent the cluster from being able to
-# elect a replica at all.
-#
-# For maximum availability, it is possible to set the cluster-replica-validity-factor
-# to a value of 0, which means, that replicas will always try to failover the
-# master regardless of the last time they interacted with the master.
-# (However they'll always try to apply a delay proportional to their
-# offset rank).
-#
-# Zero is the only value able to guarantee that when all the partitions heal
-# the cluster will always be able to continue.
-#
-# cluster-replica-validity-factor 10
-
-# Cluster replicas are able to migrate to orphaned masters, that are masters
-# that are left without working replicas. This improves the cluster ability
-# to resist to failures as otherwise an orphaned master can't be failed over
-# in case of failure if it has no working replicas.
-#
-# Replicas migrate to orphaned masters only if there are still at least a
-# given number of other working replicas for their old master. This number
-# is the "migration barrier". A migration barrier of 1 means that a replica
-# will migrate only if there is at least 1 other working replica for its master
-# and so forth. It usually reflects the number of replicas you want for every
-# master in your cluster.
-#
-# Default is 1 (replicas migrate only if their masters remain with at least
-# one replica). To disable migration just set it to a very large value or
-# set cluster-allow-replica-migration to 'no'.
-# A value of 0 can be set but is useful only for debugging and dangerous
-# in production.
-#
-# cluster-migration-barrier 1
-
-# Turning off this option allows to use less automatic cluster configuration.
-# It both disables migration to orphaned masters and migration from masters
-# that became empty.
-#
-# Default is 'yes' (allow automatic migrations).
-#
-# cluster-allow-replica-migration yes
-
-# By default Redis Cluster nodes stop accepting queries if they detect there
-# is at least a hash slot uncovered (no available node is serving it).
-# This way if the cluster is partially down (for example a range of hash slots
-# are no longer covered) all the cluster becomes, eventually, unavailable.
-# It automatically returns available as soon as all the slots are covered again.
-#
-# However sometimes you want the subset of the cluster which is working,
-# to continue to accept queries for the part of the key space that is still
-# covered. In order to do so, just set the cluster-require-full-coverage
-# option to no.
-#
-# cluster-require-full-coverage yes
-
-# This option, when set to yes, prevents replicas from trying to failover its
-# master during master failures. However the replica can still perform a
-# manual failover, if forced to do so.
-#
-# This is useful in different scenarios, especially in the case of multiple
-# data center operations, where we want one side to never be promoted if not
-# in the case of a total DC failure.
-#
-# cluster-replica-no-failover no
-
-# This option, when set to yes, allows nodes to serve read traffic while the
-# the cluster is in a down state, as long as it believes it owns the slots. 
-#
-# This is useful for two cases.  The first case is for when an application 
-# doesn't require consistency of data during node failures or network partitions.
-# One example of this is a cache, where as long as the node has the data it
-# should be able to serve it. 
-#
-# The second use case is for configurations that don't meet the recommended  
-# three shards but want to enable cluster mode and scale later. A 
-# master outage in a 1 or 2 shard configuration causes a read/write outage to the
-# entire cluster without this option set, with it set there is only a write outage.
-# Without a quorum of masters, slot ownership will not change automatically. 
-#
-# cluster-allow-reads-when-down no
-
-# In order to setup your cluster make sure to read the documentation
-# available at https://redis.io web site.
-
-########################## CLUSTER DOCKER/NAT support  ########################
-
-# In certain deployments, Redis Cluster nodes address discovery fails, because
-# addresses are NAT-ted or because ports are forwarded (the typical case is
-# Docker and other containers).
-#
-# In order to make Redis Cluster working in such environments, a static
-# configuration where each node knows its public address is needed. The
-# following four options are used for this scope, and are:
-#
-# * cluster-announce-ip
-# * cluster-announce-port
-# * cluster-announce-tls-port
-# * cluster-announce-bus-port
-#
-# Each instructs the node about its address, client ports (for connections
-# without and with TLS) and cluster message bus port. The information is then
-# published in the header of the bus packets so that other nodes will be able to
-# correctly map the address of the node publishing the information.
-#
-# If cluster-tls is set to yes and cluster-announce-tls-port is omitted or set
-# to zero, then cluster-announce-port refers to the TLS port. Note also that
-# cluster-announce-tls-port has no effect if cluster-tls is set to no.
-#
-# If the above options are not used, the normal Redis Cluster auto-detection
-# will be used instead.
-#
-# Note that when remapped, the bus port may not be at the fixed offset of
-# clients port + 10000, so you can specify any port and bus-port depending
-# on how they get remapped. If the bus-port is not set, a fixed offset of
-# 10000 will be used as usual.
-#
-# Example:
-#
-# cluster-announce-ip 10.1.1.5
-# cluster-announce-tls-port 6379
-# cluster-announce-port 0
-# cluster-announce-bus-port 6380
-
-################################## SLOW LOG ###################################
-
-# The Redis Slow Log is a system to log queries that exceeded a specified
-# execution time. The execution time does not include the I/O operations
-# like talking with the client, sending the reply and so forth,
-# but just the time needed to actually execute the command (this is the only
-# stage of command execution where the thread is blocked and can not serve
-# other requests in the meantime).
-#
-# You can configure the slow log with two parameters: one tells Redis
-# what is the execution time, in microseconds, to exceed in order for the
-# command to get logged, and the other parameter is the length of the
-# slow log. When a new command is logged the oldest one is removed from the
-# queue of logged commands.
-
-# The following time is expressed in microseconds, so 1000000 is equivalent
-# to one second. Note that a negative number disables the slow log, while
-# a value of zero forces the logging of every command.
-slowlog-log-slower-than 10000
-
-# There is no limit to this length. Just be aware that it will consume memory.
-# You can reclaim memory used by the slow log with SLOWLOG RESET.
-slowlog-max-len 128
-
-################################ LATENCY MONITOR ##############################
-
-# The Redis latency monitoring subsystem samples different operations
-# at runtime in order to collect data related to possible sources of
-# latency of a Redis instance.
-#
-# Via the LATENCY command this information is available to the user that can
-# print graphs and obtain reports.
-#
-# The system only logs operations that were performed in a time equal or
-# greater than the amount of milliseconds specified via the
-# latency-monitor-threshold configuration directive. When its value is set
-# to zero, the latency monitor is turned off.
-#
-# By default latency monitoring is disabled since it is mostly not needed
-# if you don't have latency issues, and collecting data has a performance
-# impact, that while very small, can be measured under big load. Latency
-# monitoring can easily be enabled at runtime using the command
-# "CONFIG SET latency-monitor-threshold <milliseconds>" if needed.
-latency-monitor-threshold 0
-
-############################# EVENT NOTIFICATION ##############################
-
-# Redis can notify Pub/Sub clients about events happening in the key space.
-# This feature is documented at https://redis.io/topics/notifications
-#
-# For instance if keyspace events notification is enabled, and a client
-# performs a DEL operation on key "foo" stored in the Database 0, two
-# messages will be published via Pub/Sub:
-#
-# PUBLISH __keyspace@0__:foo del
-# PUBLISH __keyevent@0__:del foo
-#
-# It is possible to select the events that Redis will notify among a set
-# of classes. Every class is identified by a single character:
-#
-#  K     Keyspace events, published with __keyspace@<db>__ prefix.
-#  E     Keyevent events, published with __keyevent@<db>__ prefix.
-#  g     Generic commands (non-type specific) like DEL, EXPIRE, RENAME, ...
-#  $     String commands
-#  l     List commands
-#  s     Set commands
-#  h     Hash commands
-#  z     Sorted set commands
-#  x     Expired events (events generated every time a key expires)
-#  e     Evicted events (events generated when a key is evicted for maxmemory)
-#  t     Stream commands
-#  d     Module key type events
-#  m     Key-miss events (Note: It is not included in the 'A' class)
-#  A     Alias for g$lshzxetd, so that the "AKE" string means all the events
-#        (Except key-miss events which are excluded from 'A' due to their
-#         unique nature).
-#
-#  The "notify-keyspace-events" takes as argument a string that is composed
-#  of zero or multiple characters. The empty string means that notifications
-#  are disabled.
-#
-#  Example: to enable list and generic events, from the point of view of the
-#           event name, use:
-#
-#  notify-keyspace-events Elg
-#
-#  Example 2: to get the stream of the expired keys subscribing to channel
-#             name __keyevent@0__:expired use:
-#
-#  notify-keyspace-events Ex
-#
-#  By default all notifications are disabled because most users don't need
-#  this feature and the feature has some overhead. Note that if you don't
-#  specify at least one of K or E, no events will be delivered.
-notify-keyspace-events ""
-
-############################### GOPHER SERVER #################################
-
-# Redis contains an implementation of the Gopher protocol, as specified in
-# the RFC 1436 (https://www.ietf.org/rfc/rfc1436.txt).
-#
-# The Gopher protocol was very popular in the late '90s. It is an alternative
-# to the web, and the implementation both server and client side is so simple
-# that the Redis server has just 100 lines of code in order to implement this
-# support.
-#
-# What do you do with Gopher nowadays? Well Gopher never *really* died, and
-# lately there is a movement in order for the Gopher more hierarchical content
-# composed of just plain text documents to be resurrected. Some want a simpler
-# internet, others believe that the mainstream internet became too much
-# controlled, and it's cool to create an alternative space for people that
-# want a bit of fresh air.
-#
-# Anyway for the 10nth birthday of the Redis, we gave it the Gopher protocol
-# as a gift.
-#
-# --- HOW IT WORKS? ---
-#
-# The Redis Gopher support uses the inline protocol of Redis, and specifically
-# two kind of inline requests that were anyway illegal: an empty request
-# or any request that starts with "/" (there are no Redis commands starting
-# with such a slash). Normal RESP2/RESP3 requests are completely out of the
-# path of the Gopher protocol implementation and are served as usual as well.
-#
-# If you open a connection to Redis when Gopher is enabled and send it
-# a string like "/foo", if there is a key named "/foo" it is served via the
-# Gopher protocol.
-#
-# In order to create a real Gopher "hole" (the name of a Gopher site in Gopher
-# talking), you likely need a script like the following:
-#
-#   https://github.com/antirez/gopher2redis
-#
-# --- SECURITY WARNING ---
-#
-# If you plan to put Redis on the internet in a publicly accessible address
-# to server Gopher pages MAKE SURE TO SET A PASSWORD to the instance.
-# Once a password is set:
-#
-#   1. The Gopher server (when enabled, not by default) will still serve
-#      content via Gopher.
-#   2. However other commands cannot be called before the client will
-#      authenticate.
-#
-# So use the 'requirepass' option to protect your instance.
-#
-# Note that Gopher is not currently supported when 'io-threads-do-reads'
-# is enabled.
-#
-# To enable Gopher support, uncomment the following line and set the option
-# from no (the default) to yes.
-#
-# gopher-enabled no
-
-############################### ADVANCED CONFIG ###############################
-
-# Hashes are encoded using a memory efficient data structure when they have a
-# small number of entries, and the biggest entry does not exceed a given
-# threshold. These thresholds can be configured using the following directives.
-hash-max-ziplist-entries 512
-hash-max-ziplist-value 64
-
-# Lists are also encoded in a special way to save a lot of space.
-# The number of entries allowed per internal list node can be specified
-# as a fixed maximum size or a maximum number of elements.
-# For a fixed maximum size, use -5 through -1, meaning:
-# -5: max size: 64 Kb  <-- not recommended for normal workloads
-# -4: max size: 32 Kb  <-- not recommended
-# -3: max size: 16 Kb  <-- probably not recommended
-# -2: max size: 8 Kb   <-- good
-# -1: max size: 4 Kb   <-- good
-# Positive numbers mean store up to _exactly_ that number of elements
-# per list node.
-# The highest performing option is usually -2 (8 Kb size) or -1 (4 Kb size),
-# but if your use case is unique, adjust the settings as necessary.
-list-max-ziplist-size -2
-
-# Lists may also be compressed.
-# Compress depth is the number of quicklist ziplist nodes from *each* side of
-# the list to *exclude* from compression.  The head and tail of the list
-# are always uncompressed for fast push/pop operations.  Settings are:
-# 0: disable all list compression
-# 1: depth 1 means "don't start compressing until after 1 node into the list,
-#    going from either the head or tail"
-#    So: [head]->node->node->...->node->[tail]
-#    [head], [tail] will always be uncompressed; inner nodes will compress.
-# 2: [head]->[next]->node->node->...->node->[prev]->[tail]
-#    2 here means: don't compress head or head->next or tail->prev or tail,
-#    but compress all nodes between them.
-# 3: [head]->[next]->[next]->node->node->...->node->[prev]->[prev]->[tail]
-# etc.
-list-compress-depth 0
-
-# Sets have a special encoding in just one case: when a set is composed
-# of just strings that happen to be integers in radix 10 in the range
-# of 64 bit signed integers.
-# The following configuration setting sets the limit in the size of the
-# set in order to use this special memory saving encoding.
-set-max-intset-entries 512
-
-# Similarly to hashes and lists, sorted sets are also specially encoded in
-# order to save a lot of space. This encoding is only used when the length and
-# elements of a sorted set are below the following limits:
-zset-max-ziplist-entries 128
-zset-max-ziplist-value 64
-
-# HyperLogLog sparse representation bytes limit. The limit includes the
-# 16 bytes header. When an HyperLogLog using the sparse representation crosses
-# this limit, it is converted into the dense representation.
-#
-# A value greater than 16000 is totally useless, since at that point the
-# dense representation is more memory efficient.
-#
-# The suggested value is ~ 3000 in order to have the benefits of
-# the space efficient encoding without slowing down too much PFADD,
-# which is O(N) with the sparse encoding. The value can be raised to
-# ~ 10000 when CPU is not a concern, but space is, and the data set is
-# composed of many HyperLogLogs with cardinality in the 0 - 15000 range.
-hll-sparse-max-bytes 3000
-
-# Streams macro node max size / items. The stream data structure is a radix
-# tree of big nodes that encode multiple items inside. Using this configuration
-# it is possible to configure how big a single node can be in bytes, and the
-# maximum number of items it may contain before switching to a new node when
-# appending new stream entries. If any of the following settings are set to
-# zero, the limit is ignored, so for instance it is possible to set just a
-# max entries limit by setting max-bytes to 0 and max-entries to the desired
-# value.
-stream-node-max-bytes 4096
-stream-node-max-entries 100
-
-# Active rehashing uses 1 millisecond every 100 milliseconds of CPU time in
-# order to help rehashing the main Redis hash table (the one mapping top-level
-# keys to values). The hash table implementation Redis uses (see dict.c)
-# performs a lazy rehashing: the more operation you run into a hash table
-# that is rehashing, the more rehashing "steps" are performed, so if the
-# server is idle the rehashing is never complete and some more memory is used
-# by the hash table.
-#
-# The default is to use this millisecond 10 times every second in order to
-# actively rehash the main dictionaries, freeing memory when possible.
-#
-# If unsure:
-# use "activerehashing no" if you have hard latency requirements and it is
-# not a good thing in your environment that Redis can reply from time to time
-# to queries with 2 milliseconds delay.
-#
-# use "activerehashing yes" if you don't have such hard requirements but
-# want to free memory asap when possible.
-activerehashing yes
-
-# The client output buffer limits can be used to force disconnection of clients
-# that are not reading data from the server fast enough for some reason (a
-# common reason is that a Pub/Sub client can't consume messages as fast as the
-# publisher can produce them).
-#
-# The limit can be set differently for the three different classes of clients:
-#
-# normal -> normal clients including MONITOR clients
-# replica  -> replica clients
-# pubsub -> clients subscribed to at least one pubsub channel or pattern
-#
-# The syntax of every client-output-buffer-limit directive is the following:
-#
-# client-output-buffer-limit <class> <hard limit> <soft limit> <soft seconds>
-#
-# A client is immediately disconnected once the hard limit is reached, or if
-# the soft limit is reached and remains reached for the specified number of
-# seconds (continuously).
-# So for instance if the hard limit is 32 megabytes and the soft limit is
-# 16 megabytes / 10 seconds, the client will get disconnected immediately
-# if the size of the output buffers reach 32 megabytes, but will also get
-# disconnected if the client reaches 16 megabytes and continuously overcomes
-# the limit for 10 seconds.
-#
-# By default normal clients are not limited because they don't receive data
-# without asking (in a push way), but just after a request, so only
-# asynchronous clients may create a scenario where data is requested faster
-# than it can read.
-#
-# Instead there is a default limit for pubsub and replica clients, since
-# subscribers and replicas receive data in a push fashion.
-#
-# Both the hard or the soft limit can be disabled by setting them to zero.
-client-output-buffer-limit normal 0 0 0
-client-output-buffer-limit replica 256mb 64mb 60
-client-output-buffer-limit pubsub 32mb 8mb 60
-
-# Client query buffers accumulate new commands. They are limited to a fixed
-# amount by default in order to avoid that a protocol desynchronization (for
-# instance due to a bug in the client) will lead to unbound memory usage in
-# the query buffer. However you can configure it here if you have very special
-# needs, such us huge multi/exec requests or alike.
-#
-# client-query-buffer-limit 1gb
-
-# In the Redis protocol, bulk requests, that are, elements representing single
-# strings, are normally limited to 512 mb. However you can change this limit
-# here, but must be 1mb or greater
-#
-# proto-max-bulk-len 512mb
-
-# Redis calls an internal function to perform many background tasks, like
-# closing connections of clients in timeout, purging expired keys that are
-# never requested, and so forth.
-#
-# Not all tasks are performed with the same frequency, but Redis checks for
-# tasks to perform according to the specified "hz" value.
-#
-# By default "hz" is set to 10. Raising the value will use more CPU when
-# Redis is idle, but at the same time will make Redis more responsive when
-# there are many keys expiring at the same time, and timeouts may be
-# handled with more precision.
-#
-# The range is between 1 and 500, however a value over 100 is usually not
-# a good idea. Most users should use the default of 10 and raise this up to
-# 100 only in environments where very low latency is required.
-hz 10
-
-# Normally it is useful to have an HZ value which is proportional to the
-# number of clients connected. This is useful in order, for instance, to
-# avoid too many clients are processed for each background task invocation
-# in order to avoid latency spikes.
-#
-# Since the default HZ value by default is conservatively set to 10, Redis
-# offers, and enables by default, the ability to use an adaptive HZ value
-# which will temporarily raise when there are many connected clients.
-#
-# When dynamic HZ is enabled, the actual configured HZ will be used
-# as a baseline, but multiples of the configured HZ value will be actually
-# used as needed once more clients are connected. In this way an idle
-# instance will use very little CPU time while a busy instance will be
-# more responsive.
-dynamic-hz yes
-
-# When a child rewrites the AOF file, if the following option is enabled
-# the file will be fsync-ed every 32 MB of data generated. This is useful
-# in order to commit the file to the disk more incrementally and avoid
-# big latency spikes.
-aof-rewrite-incremental-fsync yes
-
-# When redis saves RDB file, if the following option is enabled
-# the file will be fsync-ed every 32 MB of data generated. This is useful
-# in order to commit the file to the disk more incrementally and avoid
-# big latency spikes.
-rdb-save-incremental-fsync yes
-
-# Redis LFU eviction (see maxmemory setting) can be tuned. However it is a good
-# idea to start with the default settings and only change them after investigating
-# how to improve the performances and how the keys LFU change over time, which
-# is possible to inspect via the OBJECT FREQ command.
-#
-# There are two tunable parameters in the Redis LFU implementation: the
-# counter logarithm factor and the counter decay time. It is important to
-# understand what the two parameters mean before changing them.
-#
-# The LFU counter is just 8 bits per key, it's maximum value is 255, so Redis
-# uses a probabilistic increment with logarithmic behavior. Given the value
-# of the old counter, when a key is accessed, the counter is incremented in
-# this way:
-#
-# 1. A random number R between 0 and 1 is extracted.
-# 2. A probability P is calculated as 1/(old_value*lfu_log_factor+1).
-# 3. The counter is incremented only if R < P.
-#
-# The default lfu-log-factor is 10. This is a table of how the frequency
-# counter changes with a different number of accesses with different
-# logarithmic factors:
-#
-# +--------+------------+------------+------------+------------+------------+
-# | factor | 100 hits   | 1000 hits  | 100K hits  | 1M hits    | 10M hits   |
-# +--------+------------+------------+------------+------------+------------+
-# | 0      | 104        | 255        | 255        | 255        | 255        |
-# +--------+------------+------------+------------+------------+------------+
-# | 1      | 18         | 49         | 255        | 255        | 255        |
-# +--------+------------+------------+------------+------------+------------+
-# | 10     | 10         | 18         | 142        | 255        | 255        |
-# +--------+------------+------------+------------+------------+------------+
-# | 100    | 8          | 11         | 49         | 143        | 255        |
-# +--------+------------+------------+------------+------------+------------+
-#
-# NOTE: The above table was obtained by running the following commands:
-#
-#   redis-benchmark -n 1000000 incr foo
-#   redis-cli object freq foo
-#
-# NOTE 2: The counter initial value is 5 in order to give new objects a chance
-# to accumulate hits.
-#
-# The counter decay time is the time, in minutes, that must elapse in order
-# for the key counter to be divided by two (or decremented if it has a value
-# less <= 10).
-#
-# The default value for the lfu-decay-time is 1. A special value of 0 means to
-# decay the counter every time it happens to be scanned.
-#
-# lfu-log-factor 10
-# lfu-decay-time 1
-
-########################### ACTIVE DEFRAGMENTATION #######################
-#
-# What is active defragmentation?
-# -------------------------------
-#
-# Active (online) defragmentation allows a Redis server to compact the
-# spaces left between small allocations and deallocations of data in memory,
-# thus allowing to reclaim back memory.
-#
-# Fragmentation is a natural process that happens with every allocator (but
-# less so with Jemalloc, fortunately) and certain workloads. Normally a server
-# restart is needed in order to lower the fragmentation, or at least to flush
-# away all the data and create it again. However thanks to this feature
-# implemented by Oran Agra for Redis 4.0 this process can happen at runtime
-# in a "hot" way, while the server is running.
-#
-# Basically when the fragmentation is over a certain level (see the
-# configuration options below) Redis will start to create new copies of the
-# values in contiguous memory regions by exploiting certain specific Jemalloc
-# features (in order to understand if an allocation is causing fragmentation
-# and to allocate it in a better place), and at the same time, will release the
-# old copies of the data. This process, repeated incrementally for all the keys
-# will cause the fragmentation to drop back to normal values.
-#
-# Important things to understand:
-#
-# 1. This feature is disabled by default, and only works if you compiled Redis
-#    to use the copy of Jemalloc we ship with the source code of Redis.
-#    This is the default with Linux builds.
-#
-# 2. You never need to enable this feature if you don't have fragmentation
-#    issues.
-#
-# 3. Once you experience fragmentation, you can enable this feature when
-#    needed with the command "CONFIG SET activedefrag yes".
-#
-# The configuration parameters are able to fine tune the behavior of the
-# defragmentation process. If you are not sure about what they mean it is
-# a good idea to leave the defaults untouched.
-
-# Enabled active defragmentation
-# activedefrag no
-
-# Minimum amount of fragmentation waste to start active defrag
-# active-defrag-ignore-bytes 100mb
-
-# Minimum percentage of fragmentation to start active defrag
-# active-defrag-threshold-lower 10
-
-# Maximum percentage of fragmentation at which we use maximum effort
-# active-defrag-threshold-upper 100
-
-# Minimal effort for defrag in CPU percentage, to be used when the lower
-# threshold is reached
-# active-defrag-cycle-min 1
-
-# Maximal effort for defrag in CPU percentage, to be used when the upper
-# threshold is reached
-# active-defrag-cycle-max 25
-
-# Maximum number of set/hash/zset/list fields that will be processed from
-# the main dictionary scan
-# active-defrag-max-scan-fields 1000
-
-# Jemalloc background thread for purging will be enabled by default
-jemalloc-bg-thread yes
-
-# It is possible to pin different threads and processes of Redis to specific
-# CPUs in your system, in order to maximize the performances of the server.
-# This is useful both in order to pin different Redis threads in different
-# CPUs, but also in order to make sure that multiple Redis instances running
-# in the same host will be pinned to different CPUs.
-#
-# Normally you can do this using the "taskset" command, however it is also
-# possible to this via Redis configuration directly, both in Linux and FreeBSD.
-#
-# You can pin the server/IO threads, bio threads, aof rewrite child process, and
-# the bgsave child process. The syntax to specify the cpu list is the same as
-# the taskset command:
-#
-# Set redis server/io threads to cpu affinity 0,2,4,6:
-# server_cpulist 0-7:2
-#
-# Set bio threads to cpu affinity 1,3:
-# bio_cpulist 1,3
-#
-# Set aof rewrite child process to cpu affinity 8,9,10,11:
-# aof_rewrite_cpulist 8-11
-#
-# Set bgsave child process to cpu affinity 1,10,11
-# bgsave_cpulist 1,10-11
-
-# In some cases redis will emit warnings and even refuse to start if it detects
-# that the system is in bad state, it is possible to suppress these warnings
-# by setting the following config which takes a space delimited list of warnings
-# to suppress
-#
-# ignore-warnings ARM64-COW-BUG
diff --git a/redis-stable/runtest b/redis-stable/runtest
deleted file mode 100755
index ade1bd09..00000000
--- a/redis-stable/runtest
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/sh
-TCL_VERSIONS="8.5 8.6"
-TCLSH=""
-
-for VERSION in $TCL_VERSIONS; do
-	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
-done
-
-if [ -z $TCLSH ]
-then
-    echo "You need tcl 8.5 or newer in order to run the Redis test"
-    exit 1
-fi
-$TCLSH tests/test_helper.tcl "${@}"
diff --git a/redis-stable/runtest-cluster b/redis-stable/runtest-cluster
deleted file mode 100755
index a86e9314..00000000
--- a/redis-stable/runtest-cluster
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/sh
-TCL_VERSIONS="8.5 8.6"
-TCLSH=""
-
-for VERSION in $TCL_VERSIONS; do
-	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
-done
-
-if [ -z $TCLSH ]
-then
-    echo "You need tcl 8.5 or newer in order to run the Redis Cluster test"
-    exit 1
-fi
-$TCLSH tests/cluster/run.tcl $*
diff --git a/redis-stable/runtest-moduleapi b/redis-stable/runtest-moduleapi
deleted file mode 100755
index 56d14960..00000000
--- a/redis-stable/runtest-moduleapi
+++ /dev/null
@@ -1,39 +0,0 @@
-#!/bin/sh
-TCL_VERSIONS="8.5 8.6"
-TCLSH=""
-[ -z "$MAKE" ] && MAKE=make
-
-for VERSION in $TCL_VERSIONS; do
-	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
-done
-
-if [ -z $TCLSH ]
-then
-    echo "You need tcl 8.5 or newer in order to run the Redis ModuleApi test"
-    exit 1
-fi
-
-$MAKE -C tests/modules && \
-$TCLSH tests/test_helper.tcl \
---single unit/moduleapi/commandfilter \
---single unit/moduleapi/basics \
---single unit/moduleapi/fork \
---single unit/moduleapi/testrdb \
---single unit/moduleapi/infotest \
---single unit/moduleapi/propagate \
---single unit/moduleapi/hooks \
---single unit/moduleapi/misc \
---single unit/moduleapi/blockonkeys \
---single unit/moduleapi/blockonbackground \
---single unit/moduleapi/scan \
---single unit/moduleapi/datatype \
---single unit/moduleapi/auth \
---single unit/moduleapi/keyspace_events \
---single unit/moduleapi/blockedclient \
---single unit/moduleapi/getkeys \
---single unit/moduleapi/test_lazyfree \
---single unit/moduleapi/defrag \
---single unit/moduleapi/hash \
---single unit/moduleapi/zset \
---single unit/moduleapi/stream \
-"${@}"
diff --git a/redis-stable/runtest-sentinel b/redis-stable/runtest-sentinel
deleted file mode 100755
index 3fb1ef61..00000000
--- a/redis-stable/runtest-sentinel
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/sh
-TCL_VERSIONS="8.5 8.6"
-TCLSH=""
-
-for VERSION in $TCL_VERSIONS; do
-	TCL=`which tclsh$VERSION 2>/dev/null` && TCLSH=$TCL
-done
-
-if [ -z $TCLSH ]
-then
-    echo "You need tcl 8.5 or newer in order to run the Redis Sentinel test"
-    exit 1
-fi
-$TCLSH tests/sentinel/run.tcl $*
diff --git a/redis-stable/sentinel.conf b/redis-stable/sentinel.conf
deleted file mode 100644
index 8647379d..00000000
--- a/redis-stable/sentinel.conf
+++ /dev/null
@@ -1,341 +0,0 @@
-# Example sentinel.conf
-
-# *** IMPORTANT ***
-#
-# By default Sentinel will not be reachable from interfaces different than
-# localhost, either use the 'bind' directive to bind to a list of network
-# interfaces, or disable protected mode with "protected-mode no" by
-# adding it to this configuration file.
-#
-# Before doing that MAKE SURE the instance is protected from the outside
-# world via firewalling or other means.
-#
-# For example you may use one of the following:
-#
-# bind 127.0.0.1 192.168.1.1
-#
-# protected-mode no
-
-# port <sentinel-port>
-# The port that this sentinel instance will run on
-port 26379
-
-# By default Redis Sentinel does not run as a daemon. Use 'yes' if you need it.
-# Note that Redis will write a pid file in /var/run/redis-sentinel.pid when
-# daemonized.
-daemonize no
-
-# When running daemonized, Redis Sentinel writes a pid file in
-# /var/run/redis-sentinel.pid by default. You can specify a custom pid file
-# location here.
-pidfile /var/run/redis-sentinel.pid
-
-# Specify the log file name. Also the empty string can be used to force
-# Sentinel to log on the standard output. Note that if you use standard
-# output for logging but daemonize, logs will be sent to /dev/null
-logfile ""
-
-# sentinel announce-ip <ip>
-# sentinel announce-port <port>
-#
-# The above two configuration directives are useful in environments where,
-# because of NAT, Sentinel is reachable from outside via a non-local address.
-#
-# When announce-ip is provided, the Sentinel will claim the specified IP address
-# in HELLO messages used to gossip its presence, instead of auto-detecting the
-# local address as it usually does.
-#
-# Similarly when announce-port is provided and is valid and non-zero, Sentinel
-# will announce the specified TCP port.
-#
-# The two options don't need to be used together, if only announce-ip is
-# provided, the Sentinel will announce the specified IP and the server port
-# as specified by the "port" option. If only announce-port is provided, the
-# Sentinel will announce the auto-detected local IP and the specified port.
-#
-# Example:
-#
-# sentinel announce-ip 1.2.3.4
-
-# dir <working-directory>
-# Every long running process should have a well-defined working directory.
-# For Redis Sentinel to chdir to /tmp at startup is the simplest thing
-# for the process to don't interfere with administrative tasks such as
-# unmounting filesystems.
-dir /tmp
-
-# sentinel monitor <master-name> <ip> <redis-port> <quorum>
-#
-# Tells Sentinel to monitor this master, and to consider it in O_DOWN
-# (Objectively Down) state only if at least <quorum> sentinels agree.
-#
-# Note that whatever is the ODOWN quorum, a Sentinel will require to
-# be elected by the majority of the known Sentinels in order to
-# start a failover, so no failover can be performed in minority.
-#
-# Replicas are auto-discovered, so you don't need to specify replicas in
-# any way. Sentinel itself will rewrite this configuration file adding
-# the replicas using additional configuration options.
-# Also note that the configuration file is rewritten when a
-# replica is promoted to master.
-#
-# Note: master name should not include special characters or spaces.
-# The valid charset is A-z 0-9 and the three characters ".-_".
-sentinel monitor mymaster 127.0.0.1 6379 2
-
-# sentinel auth-pass <master-name> <password>
-#
-# Set the password to use to authenticate with the master and replicas.
-# Useful if there is a password set in the Redis instances to monitor.
-#
-# Note that the master password is also used for replicas, so it is not
-# possible to set a different password in masters and replicas instances
-# if you want to be able to monitor these instances with Sentinel.
-#
-# However you can have Redis instances without the authentication enabled
-# mixed with Redis instances requiring the authentication (as long as the
-# password set is the same for all the instances requiring the password) as
-# the AUTH command will have no effect in Redis instances with authentication
-# switched off.
-#
-# Example:
-#
-# sentinel auth-pass mymaster MySUPER--secret-0123passw0rd
-
-# sentinel auth-user <master-name> <username>
-#
-# This is useful in order to authenticate to instances having ACL capabilities,
-# that is, running Redis 6.0 or greater. When just auth-pass is provided the
-# Sentinel instance will authenticate to Redis using the old "AUTH <pass>"
-# method. When also an username is provided, it will use "AUTH <user> <pass>".
-# In the Redis servers side, the ACL to provide just minimal access to
-# Sentinel instances, should be configured along the following lines:
-#
-#     user sentinel-user >somepassword +client +subscribe +publish \
-#                        +ping +info +multi +slaveof +config +client +exec on
-
-# sentinel down-after-milliseconds <master-name> <milliseconds>
-#
-# Number of milliseconds the master (or any attached replica or sentinel) should
-# be unreachable (as in, not acceptable reply to PING, continuously, for the
-# specified period) in order to consider it in S_DOWN state (Subjectively
-# Down).
-#
-# Default is 30 seconds.
-sentinel down-after-milliseconds mymaster 30000
-
-# IMPORTANT NOTE: starting with Redis 6.2 ACL capability is supported for
-# Sentinel mode, please refer to the Redis website https://redis.io/topics/acl
-# for more details.
-
-# Sentinel's ACL users are defined in the following format:
-#
-#   user <username> ... acl rules ...
-#
-# For example:
-#
-#   user worker +@admin +@connection ~* on >ffa9203c493aa99
-#
-# For more information about ACL configuration please refer to the Redis
-# website at https://redis.io/topics/acl and redis server configuration 
-# template redis.conf.
-
-# ACL LOG
-#
-# The ACL Log tracks failed commands and authentication events associated
-# with ACLs. The ACL Log is useful to troubleshoot failed commands blocked 
-# by ACLs. The ACL Log is stored in memory. You can reclaim memory with 
-# ACL LOG RESET. Define the maximum entry length of the ACL Log below.
-acllog-max-len 128
-
-# Using an external ACL file
-#
-# Instead of configuring users here in this file, it is possible to use
-# a stand-alone file just listing users. The two methods cannot be mixed:
-# if you configure users here and at the same time you activate the external
-# ACL file, the server will refuse to start.
-#
-# The format of the external ACL user file is exactly the same as the
-# format that is used inside redis.conf to describe users.
-#
-# aclfile /etc/redis/sentinel-users.acl
-
-# requirepass <password>
-#
-# You can configure Sentinel itself to require a password, however when doing
-# so Sentinel will try to authenticate with the same password to all the
-# other Sentinels. So you need to configure all your Sentinels in a given
-# group with the same "requirepass" password. Check the following documentation
-# for more info: https://redis.io/topics/sentinel
-#
-# IMPORTANT NOTE: starting with Redis 6.2 "requirepass" is a compatibility
-# layer on top of the ACL system. The option effect will be just setting
-# the password for the default user. Clients will still authenticate using
-# AUTH <password> as usually, or more explicitly with AUTH default <password>
-# if they follow the new protocol: both will work.
-#
-# New config files are advised to use separate authentication control for
-# incoming connections (via ACL), and for outgoing connections (via
-# sentinel-user and sentinel-pass) 
-#
-# The requirepass is not compatable with aclfile option and the ACL LOAD
-# command, these will cause requirepass to be ignored.
-
-# sentinel sentinel-user <username>
-#
-# You can configure Sentinel to authenticate with other Sentinels with specific
-# user name. 
-
-# sentinel sentinel-pass <password>
-#
-# The password for Sentinel to authenticate with other Sentinels. If sentinel-user
-# is not configured, Sentinel will use 'default' user with sentinel-pass to authenticate.
-
-# sentinel parallel-syncs <master-name> <numreplicas>
-#
-# How many replicas we can reconfigure to point to the new replica simultaneously
-# during the failover. Use a low number if you use the replicas to serve query
-# to avoid that all the replicas will be unreachable at about the same
-# time while performing the synchronization with the master.
-sentinel parallel-syncs mymaster 1
-
-# sentinel failover-timeout <master-name> <milliseconds>
-#
-# Specifies the failover timeout in milliseconds. It is used in many ways:
-#
-# - The time needed to re-start a failover after a previous failover was
-#   already tried against the same master by a given Sentinel, is two
-#   times the failover timeout.
-#
-# - The time needed for a replica replicating to a wrong master according
-#   to a Sentinel current configuration, to be forced to replicate
-#   with the right master, is exactly the failover timeout (counting since
-#   the moment a Sentinel detected the misconfiguration).
-#
-# - The time needed to cancel a failover that is already in progress but
-#   did not produced any configuration change (SLAVEOF NO ONE yet not
-#   acknowledged by the promoted replica).
-#
-# - The maximum time a failover in progress waits for all the replicas to be
-#   reconfigured as replicas of the new master. However even after this time
-#   the replicas will be reconfigured by the Sentinels anyway, but not with
-#   the exact parallel-syncs progression as specified.
-#
-# Default is 3 minutes.
-sentinel failover-timeout mymaster 180000
-
-# SCRIPTS EXECUTION
-#
-# sentinel notification-script and sentinel reconfig-script are used in order
-# to configure scripts that are called to notify the system administrator
-# or to reconfigure clients after a failover. The scripts are executed
-# with the following rules for error handling:
-#
-# If script exits with "1" the execution is retried later (up to a maximum
-# number of times currently set to 10).
-#
-# If script exits with "2" (or an higher value) the script execution is
-# not retried.
-#
-# If script terminates because it receives a signal the behavior is the same
-# as exit code 1.
-#
-# A script has a maximum running time of 60 seconds. After this limit is
-# reached the script is terminated with a SIGKILL and the execution retried.
-
-# NOTIFICATION SCRIPT
-#
-# sentinel notification-script <master-name> <script-path>
-# 
-# Call the specified notification script for any sentinel event that is
-# generated in the WARNING level (for instance -sdown, -odown, and so forth).
-# This script should notify the system administrator via email, SMS, or any
-# other messaging system, that there is something wrong with the monitored
-# Redis systems.
-#
-# The script is called with just two arguments: the first is the event type
-# and the second the event description.
-#
-# The script must exist and be executable in order for sentinel to start if
-# this option is provided.
-#
-# Example:
-#
-# sentinel notification-script mymaster /var/redis/notify.sh
-
-# CLIENTS RECONFIGURATION SCRIPT
-#
-# sentinel client-reconfig-script <master-name> <script-path>
-#
-# When the master changed because of a failover a script can be called in
-# order to perform application-specific tasks to notify the clients that the
-# configuration has changed and the master is at a different address.
-# 
-# The following arguments are passed to the script:
-#
-# <master-name> <role> <state> <from-ip> <from-port> <to-ip> <to-port>
-#
-# <state> is currently always "failover"
-# <role> is either "leader" or "observer"
-# 
-# The arguments from-ip, from-port, to-ip, to-port are used to communicate
-# the old address of the master and the new address of the elected replica
-# (now a master).
-#
-# This script should be resistant to multiple invocations.
-#
-# Example:
-#
-# sentinel client-reconfig-script mymaster /var/redis/reconfig.sh
-
-# SECURITY
-#
-# By default SENTINEL SET will not be able to change the notification-script
-# and client-reconfig-script at runtime. This avoids a trivial security issue
-# where clients can set the script to anything and trigger a failover in order
-# to get the program executed.
-
-sentinel deny-scripts-reconfig yes
-
-# REDIS COMMANDS RENAMING
-#
-# Sometimes the Redis server has certain commands, that are needed for Sentinel
-# to work correctly, renamed to unguessable strings. This is often the case
-# of CONFIG and SLAVEOF in the context of providers that provide Redis as
-# a service, and don't want the customers to reconfigure the instances outside
-# of the administration console.
-#
-# In such case it is possible to tell Sentinel to use different command names
-# instead of the normal ones. For example if the master "mymaster", and the
-# associated replicas, have "CONFIG" all renamed to "GUESSME", I could use:
-#
-# SENTINEL rename-command mymaster CONFIG GUESSME
-#
-# After such configuration is set, every time Sentinel would use CONFIG it will
-# use GUESSME instead. Note that there is no actual need to respect the command
-# case, so writing "config guessme" is the same in the example above.
-#
-# SENTINEL SET can also be used in order to perform this configuration at runtime.
-#
-# In order to set a command back to its original name (undo the renaming), it
-# is possible to just rename a command to itself:
-#
-# SENTINEL rename-command mymaster CONFIG CONFIG
-
-# HOSTNAMES SUPPORT
-#
-# Normally Sentinel uses only IP addresses and requires SENTINEL MONITOR
-# to specify an IP address. Also, it requires the Redis replica-announce-ip
-# keyword to specify only IP addresses.
-#
-# You may enable hostnames support by enabling resolve-hostnames. Note
-# that you must make sure your DNS is configured properly and that DNS
-# resolution does not introduce very long delays.
-#
-SENTINEL resolve-hostnames no
-
-# When resolve-hostnames is enabled, Sentinel still uses IP addresses
-# when exposing instances to users, configuration files, etc. If you want
-# to retain the hostnames when announced, enable announce-hostnames below.
-#
-SENTINEL announce-hostnames no
diff --git a/redis-stable/src/.gitignore b/redis-stable/src/.gitignore
deleted file mode 100644
index aee7aacf..00000000
--- a/redis-stable/src/.gitignore
+++ /dev/null
@@ -1,5 +0,0 @@
-*.gcda
-*.gcno
-*.gcov
-redis.info
-lcov-html
diff --git a/redis-stable/src/Makefile b/redis-stable/src/Makefile
deleted file mode 100644
index 1001f5b3..00000000
--- a/redis-stable/src/Makefile
+++ /dev/null
@@ -1,443 +0,0 @@
-# Redis Makefile
-# Copyright (C) 2009 Salvatore Sanfilippo <antirez at gmail dot com>
-# This file is released under the BSD license, see the COPYING file
-#
-# The Makefile composes the final FINAL_CFLAGS and FINAL_LDFLAGS using
-# what is needed for Redis plus the standard CFLAGS and LDFLAGS passed.
-# However when building the dependencies (Jemalloc, Lua, Hiredis, ...)
-# CFLAGS and LDFLAGS are propagated to the dependencies, so to pass
-# flags only to be used when compiling / linking Redis itself REDIS_CFLAGS
-# and REDIS_LDFLAGS are used instead (this is the case of 'make gcov').
-#
-# Dependencies are stored in the Makefile.dep file. To rebuild this file
-# Just use 'make dep', but this is only needed by developers.
-
-release_hdr := $(shell sh -c './mkreleasehdr.sh')
-uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
-uname_M := $(shell sh -c 'uname -m 2>/dev/null || echo not')
-OPTIMIZATION?=-O2
-DEPENDENCY_TARGETS=hiredis linenoise lua hdr_histogram
-NODEPS:=clean distclean
-
-# Default settings
-STD=-pedantic -DREDIS_STATIC=''
-
-# Use -Wno-c11-extensions on clang, either where explicitly used or on
-# platforms we can assume it's being used.
-ifneq (,$(findstring clang,$(CC)))
-  STD+=-Wno-c11-extensions
-else
-ifneq (,$(findstring FreeBSD,$(uname_S)))
-  STD+=-Wno-c11-extensions
-endif
-endif
-WARN=-Wall -W -Wno-missing-field-initializers
-OPT=$(OPTIMIZATION)
-
-# Detect if the compiler supports C11 _Atomic
-C11_ATOMIC := $(shell sh -c 'echo "\#include <stdatomic.h>" > foo.c; \
-	$(CC) -std=c11 -c foo.c -o foo.o > /dev/null 2>&1; \
-	if [ -f foo.o ]; then echo "yes"; rm foo.o; fi; rm foo.c')
-ifeq ($(C11_ATOMIC),yes)
-	STD+=-std=c11
-else
-	STD+=-std=c99
-endif
-
-PREFIX?=/usr/local
-INSTALL_BIN=$(PREFIX)/bin
-INSTALL=install
-PKG_CONFIG?=pkg-config
-
-# Default allocator defaults to Jemalloc if it's not an ARM
-MALLOC=libc
-ifneq ($(uname_M),armv6l)
-ifneq ($(uname_M),armv7l)
-ifeq ($(uname_S),Linux)
-	MALLOC=jemalloc
-endif
-endif
-endif
-
-# To get ARM stack traces if Redis crashes we need a special C flag.
-ifneq (,$(filter aarch64 armv,$(uname_M)))
-        CFLAGS+=-funwind-tables
-else
-ifneq (,$(findstring armv,$(uname_M)))
-        CFLAGS+=-funwind-tables
-endif
-endif
-
-# Backwards compatibility for selecting an allocator
-ifeq ($(USE_TCMALLOC),yes)
-	MALLOC=tcmalloc
-endif
-
-ifeq ($(USE_TCMALLOC_MINIMAL),yes)
-	MALLOC=tcmalloc_minimal
-endif
-
-ifeq ($(USE_JEMALLOC),yes)
-	MALLOC=jemalloc
-endif
-
-ifeq ($(USE_JEMALLOC),no)
-	MALLOC=libc
-endif
-
-# Override default settings if possible
--include .make-settings
-
-FINAL_CFLAGS=$(STD) $(WARN) $(OPT) $(DEBUG) $(CFLAGS) $(REDIS_CFLAGS)
-FINAL_LDFLAGS=$(LDFLAGS) $(REDIS_LDFLAGS) $(DEBUG)
-FINAL_LIBS=-lm
-DEBUG=-g -ggdb
-
-# Linux ARM32 needs -latomic at linking time
-ifneq (,$(findstring armv,$(uname_M)))
-        FINAL_LIBS+=-latomic
-endif
-
-ifeq ($(uname_S),SunOS)
-	# SunOS
-	ifeq ($(findstring -m32,$(FINAL_CFLAGS)),)
-		CFLAGS+=-m64
-	endif
-	ifeq ($(findstring -m32,$(FINAL_LDFLAGS)),)
-		LDFLAGS+=-m64
-	endif
-	DEBUG=-g
-	DEBUG_FLAGS=-g
-	export CFLAGS LDFLAGS DEBUG DEBUG_FLAGS
-	INSTALL=cp -pf
-	FINAL_CFLAGS+= -D__EXTENSIONS__ -D_XPG6
-	FINAL_LIBS+= -ldl -lnsl -lsocket -lresolv -lpthread -lrt
-else
-ifeq ($(uname_S),Darwin)
-	# Darwin
-	FINAL_LIBS+= -ldl
-	# Homebrew's OpenSSL is not linked to /usr/local to avoid
-	# conflicts with the system's LibreSSL installation so it
-	# must be referenced explicitly during build.
-ifeq ($(uname_M),arm64)
-	# Homebrew arm64 uses /opt/homebrew as HOMEBREW_PREFIX
-	OPENSSL_PREFIX?=/opt/homebrew/opt/openssl
-else
-	# Homebrew x86/ppc uses /usr/local as HOMEBREW_PREFIX
-	OPENSSL_PREFIX?=/usr/local/opt/openssl
-endif
-else
-ifeq ($(uname_S),AIX)
-        # AIX
-        FINAL_LDFLAGS+= -Wl,-bexpall
-        FINAL_LIBS+=-ldl -pthread -lcrypt -lbsd
-else
-ifeq ($(uname_S),OpenBSD)
-	# OpenBSD
-	FINAL_LIBS+= -lpthread
-	ifeq ($(USE_BACKTRACE),yes)
-	    FINAL_CFLAGS+= -DUSE_BACKTRACE -I/usr/local/include
-	    FINAL_LDFLAGS+= -L/usr/local/lib
-	    FINAL_LIBS+= -lexecinfo
-    	endif
-
-else
-ifeq ($(uname_S),NetBSD)
-	# NetBSD
-	FINAL_LIBS+= -lpthread
-	ifeq ($(USE_BACKTRACE),yes)
-	    FINAL_CFLAGS+= -DUSE_BACKTRACE -I/usr/pkg/include
-	    FINAL_LDFLAGS+= -L/usr/pkg/lib
-	    FINAL_LIBS+= -lexecinfo
-    	endif
-else
-ifeq ($(uname_S),FreeBSD)
-	# FreeBSD
-	FINAL_LIBS+= -lpthread -lexecinfo
-else
-ifeq ($(uname_S),DragonFly)
-	# DragonFly
-	FINAL_LIBS+= -lpthread -lexecinfo
-else
-ifeq ($(uname_S),OpenBSD)
-	# OpenBSD
-	FINAL_LIBS+= -lpthread -lexecinfo
-else
-ifeq ($(uname_S),NetBSD)
-	# NetBSD
-	FINAL_LIBS+= -lpthread -lexecinfo
-else
-ifeq ($(uname_S),Haiku)
-	# Haiku
-	FINAL_CFLAGS+= -DBSD_SOURCE
-	FINAL_LDFLAGS+= -lbsd -lnetwork
-	FINAL_LIBS+= -lpthread
-else
-	# All the other OSes (notably Linux)
-	FINAL_LDFLAGS+= -rdynamic
-	FINAL_LIBS+=-ldl -pthread -lrt
-endif
-endif
-endif
-endif
-endif
-endif
-endif
-endif
-endif
-endif
-
-ifdef OPENSSL_PREFIX
-	OPENSSL_CFLAGS=-I$(OPENSSL_PREFIX)/include
-	OPENSSL_LDFLAGS=-L$(OPENSSL_PREFIX)/lib
-	# Also export OPENSSL_PREFIX so it ends up in deps sub-Makefiles
-	export OPENSSL_PREFIX
-endif
-
-# Include paths to dependencies
-FINAL_CFLAGS+= -I../deps/hiredis -I../deps/linenoise -I../deps/lua/src -I../deps/hdr_histogram
-
-# Determine systemd support and/or build preference (defaulting to auto-detection)
-BUILD_WITH_SYSTEMD=no
-LIBSYSTEMD_LIBS=-lsystemd
-
-# If 'USE_SYSTEMD' in the environment is neither "no" nor "yes", try to
-# auto-detect libsystemd's presence and link accordingly.
-ifneq ($(USE_SYSTEMD),no)
-	LIBSYSTEMD_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libsystemd && echo $$?)
-# If libsystemd cannot be detected, continue building without support for it
-# (unless a later check tells us otherwise)
-ifeq ($(LIBSYSTEMD_PKGCONFIG),0)
-	BUILD_WITH_SYSTEMD=yes
-	LIBSYSTEMD_LIBS=$(shell $(PKG_CONFIG) --libs libsystemd)
-endif
-endif
-
-# If 'USE_SYSTEMD' is set to "yes" use pkg-config if available or fall back to
-# default -lsystemd.
-ifeq ($(USE_SYSTEMD),yes)
-	BUILD_WITH_SYSTEMD=yes
-endif
-
-ifeq ($(BUILD_WITH_SYSTEMD),yes)
-	FINAL_LIBS+=$(LIBSYSTEMD_LIBS)
-	FINAL_CFLAGS+= -DHAVE_LIBSYSTEMD
-endif
-
-ifeq ($(MALLOC),tcmalloc)
-	FINAL_CFLAGS+= -DUSE_TCMALLOC
-	FINAL_LIBS+= -ltcmalloc
-endif
-
-ifeq ($(MALLOC),tcmalloc_minimal)
-	FINAL_CFLAGS+= -DUSE_TCMALLOC
-	FINAL_LIBS+= -ltcmalloc_minimal
-endif
-
-ifeq ($(MALLOC),jemalloc)
-	DEPENDENCY_TARGETS+= jemalloc
-	FINAL_CFLAGS+= -DUSE_JEMALLOC -I../deps/jemalloc/include
-	FINAL_LIBS := ../deps/jemalloc/lib/libjemalloc.a $(FINAL_LIBS)
-endif
-
-ifeq ($(BUILD_TLS),yes)
-	FINAL_CFLAGS+=-DUSE_OPENSSL $(OPENSSL_CFLAGS)
-	FINAL_LDFLAGS+=$(OPENSSL_LDFLAGS)
-	LIBSSL_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libssl && echo $$?)
-ifeq ($(LIBSSL_PKGCONFIG),0)
-	LIBSSL_LIBS=$(shell $(PKG_CONFIG) --libs libssl)
-else
-	LIBSSL_LIBS=-lssl
-endif
-	LIBCRYPTO_PKGCONFIG := $(shell $(PKG_CONFIG) --exists libcrypto && echo $$?)
-ifeq ($(LIBCRYPTO_PKGCONFIG),0)
-	LIBCRYPTO_LIBS=$(shell $(PKG_CONFIG) --libs libcrypto)
-else
-	LIBCRYPTO_LIBS=-lcrypto
-endif
-	FINAL_LIBS += ../deps/hiredis/libhiredis_ssl.a $(LIBSSL_LIBS) $(LIBCRYPTO_LIBS)
-endif
-
-ifndef V
-    define MAKE_INSTALL
-        @printf '    %b %b\n' $(LINKCOLOR)INSTALL$(ENDCOLOR) $(BINCOLOR)$(1)$(ENDCOLOR) 1>&2
-        @$(INSTALL) $(1) $(2)
-    endef
-else
-    define MAKE_INSTALL
-        $(INSTALL) $(1) $(2)
-    endef
-endif
-
-REDIS_CC=$(QUIET_CC)$(CC) $(FINAL_CFLAGS)
-REDIS_LD=$(QUIET_LINK)$(CC) $(FINAL_LDFLAGS)
-REDIS_INSTALL=$(QUIET_INSTALL)$(INSTALL)
-
-CCCOLOR="\033[34m"
-LINKCOLOR="\033[34;1m"
-SRCCOLOR="\033[33m"
-BINCOLOR="\033[37;1m"
-MAKECOLOR="\033[32;1m"
-ENDCOLOR="\033[0m"
-
-ifndef V
-QUIET_CC = @printf '    %b %b\n' $(CCCOLOR)CC$(ENDCOLOR) $(SRCCOLOR)$@$(ENDCOLOR) 1>&2;
-QUIET_LINK = @printf '    %b %b\n' $(LINKCOLOR)LINK$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR) 1>&2;
-QUIET_INSTALL = @printf '    %b %b\n' $(LINKCOLOR)INSTALL$(ENDCOLOR) $(BINCOLOR)$@$(ENDCOLOR) 1>&2;
-endif
-
-REDIS_SERVER_NAME=redis-server$(PROG_SUFFIX)
-REDIS_SENTINEL_NAME=redis-sentinel$(PROG_SUFFIX)
-REDIS_SERVER_OBJ=adlist.o quicklist.o ae.o anet.o dict.o server.o sds.o zmalloc.o lzf_c.o lzf_d.o pqsort.o zipmap.o sha1.o ziplist.o release.o networking.o util.o object.o db.o replication.o rdb.o t_string.o t_list.o t_set.o t_zset.o t_hash.o config.o aof.o pubsub.o multi.o debug.o sort.o intset.o syncio.o cluster.o crc16.o endianconv.o slowlog.o scripting.o bio.o rio.o rand.o memtest.o crcspeed.o crc64.o bitops.o sentinel.o notify.o setproctitle.o blocked.o hyperloglog.o latency.o sparkline.o redis-check-rdb.o redis-check-aof.o geo.o lazyfree.o module.o evict.o expire.o geohash.o geohash_helper.o childinfo.o defrag.o siphash.o rax.o t_stream.o listpack.o localtime.o lolwut.o lolwut5.o lolwut6.o acl.o gopher.o tracking.o connection.o tls.o sha256.o timeout.o setcpuaffinity.o monotonic.o mt19937-64.o
-REDIS_CLI_NAME=redis-cli$(PROG_SUFFIX)
-REDIS_CLI_OBJ=anet.o adlist.o dict.o redis-cli.o zmalloc.o release.o ae.o crcspeed.o crc64.o siphash.o crc16.o monotonic.o cli_common.o mt19937-64.o
-REDIS_BENCHMARK_NAME=redis-benchmark$(PROG_SUFFIX)
-REDIS_BENCHMARK_OBJ=ae.o anet.o redis-benchmark.o adlist.o dict.o zmalloc.o release.o crcspeed.o crc64.o siphash.o crc16.o monotonic.o cli_common.o mt19937-64.o
-REDIS_CHECK_RDB_NAME=redis-check-rdb$(PROG_SUFFIX)
-REDIS_CHECK_AOF_NAME=redis-check-aof$(PROG_SUFFIX)
-
-all: $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME) $(REDIS_CHECK_RDB_NAME) $(REDIS_CHECK_AOF_NAME)
-	@echo ""
-	@echo "Hint: It's a good idea to run 'make test' ;)"
-	@echo ""
-
-Makefile.dep:
-	-$(REDIS_CC) -MM *.c > Makefile.dep 2> /dev/null || true
-
-ifeq (0, $(words $(findstring $(MAKECMDGOALS), $(NODEPS))))
--include Makefile.dep
-endif
-
-.PHONY: all
-
-persist-settings: distclean
-	echo STD=$(STD) >> .make-settings
-	echo WARN=$(WARN) >> .make-settings
-	echo OPT=$(OPT) >> .make-settings
-	echo MALLOC=$(MALLOC) >> .make-settings
-	echo BUILD_TLS=$(BUILD_TLS) >> .make-settings
-	echo USE_SYSTEMD=$(USE_SYSTEMD) >> .make-settings
-	echo CFLAGS=$(CFLAGS) >> .make-settings
-	echo LDFLAGS=$(LDFLAGS) >> .make-settings
-	echo REDIS_CFLAGS=$(REDIS_CFLAGS) >> .make-settings
-	echo REDIS_LDFLAGS=$(REDIS_LDFLAGS) >> .make-settings
-	echo PREV_FINAL_CFLAGS=$(FINAL_CFLAGS) >> .make-settings
-	echo PREV_FINAL_LDFLAGS=$(FINAL_LDFLAGS) >> .make-settings
-	-(cd ../deps && $(MAKE) $(DEPENDENCY_TARGETS))
-
-.PHONY: persist-settings
-
-# Prerequisites target
-.make-prerequisites:
-	@touch $@
-
-# Clean everything, persist settings and build dependencies if anything changed
-ifneq ($(strip $(PREV_FINAL_CFLAGS)), $(strip $(FINAL_CFLAGS)))
-.make-prerequisites: persist-settings
-endif
-
-ifneq ($(strip $(PREV_FINAL_LDFLAGS)), $(strip $(FINAL_LDFLAGS)))
-.make-prerequisites: persist-settings
-endif
-
-# redis-server
-$(REDIS_SERVER_NAME): $(REDIS_SERVER_OBJ)
-	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/lua/src/liblua.a $(FINAL_LIBS)
-
-# redis-sentinel
-$(REDIS_SENTINEL_NAME): $(REDIS_SERVER_NAME)
-	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME)
-
-# redis-check-rdb
-$(REDIS_CHECK_RDB_NAME): $(REDIS_SERVER_NAME)
-	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_CHECK_RDB_NAME)
-
-# redis-check-aof
-$(REDIS_CHECK_AOF_NAME): $(REDIS_SERVER_NAME)
-	$(REDIS_INSTALL) $(REDIS_SERVER_NAME) $(REDIS_CHECK_AOF_NAME)
-
-# redis-cli
-$(REDIS_CLI_NAME): $(REDIS_CLI_OBJ)
-	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/linenoise/linenoise.o $(FINAL_LIBS)
-
-# redis-benchmark
-$(REDIS_BENCHMARK_NAME): $(REDIS_BENCHMARK_OBJ)
-	$(REDIS_LD) -o $@ $^ ../deps/hiredis/libhiredis.a ../deps/hdr_histogram/hdr_histogram.o $(FINAL_LIBS)
-
-DEP = $(REDIS_SERVER_OBJ:%.o=%.d) $(REDIS_CLI_OBJ:%.o=%.d) $(REDIS_BENCHMARK_OBJ:%.o=%.d)
--include $(DEP)
-
-# Because the jemalloc.h header is generated as a part of the jemalloc build,
-# building it should complete before building any other object. Instead of
-# depending on a single artifact, build all dependencies first.
-%.o: %.c .make-prerequisites
-	$(REDIS_CC) -MMD -o $@ -c $<
-
-clean:
-	rm -rf $(REDIS_SERVER_NAME) $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME) $(REDIS_CHECK_RDB_NAME) $(REDIS_CHECK_AOF_NAME) *.o *.gcda *.gcno *.gcov redis.info lcov-html Makefile.dep
-	rm -f $(DEP)
-
-.PHONY: clean
-
-distclean: clean
-	-(cd ../deps && $(MAKE) distclean)
-	-(cd modules && $(MAKE) clean)
-	-(cd ../tests/modules && $(MAKE) clean)
-	-(rm -f .make-*)
-
-.PHONY: distclean
-
-test: $(REDIS_SERVER_NAME) $(REDIS_CHECK_AOF_NAME) $(REDIS_CLI_NAME) $(REDIS_BENCHMARK_NAME)
-	@(cd ..; ./runtest)
-
-test-modules: $(REDIS_SERVER_NAME)
-	@(cd ..; ./runtest-moduleapi)
-
-test-sentinel: $(REDIS_SENTINEL_NAME) $(REDIS_CLI_NAME)
-	@(cd ..; ./runtest-sentinel)
-
-check: test
-
-lcov:
-	$(MAKE) gcov
-	@(set -e; cd ..; ./runtest --clients 1)
-	@geninfo -o redis.info .
-	@genhtml --legend -o lcov-html redis.info
-
-.PHONY: lcov
-
-bench: $(REDIS_BENCHMARK_NAME)
-	./$(REDIS_BENCHMARK_NAME)
-
-32bit:
-	@echo ""
-	@echo "WARNING: if it fails under Linux you probably need to install libc6-dev-i386"
-	@echo ""
-	$(MAKE) CFLAGS="-m32" LDFLAGS="-m32"
-
-gcov:
-	$(MAKE) REDIS_CFLAGS="-fprofile-arcs -ftest-coverage -DCOVERAGE_TEST" REDIS_LDFLAGS="-fprofile-arcs -ftest-coverage"
-
-noopt:
-	$(MAKE) OPTIMIZATION="-O0"
-
-valgrind:
-	$(MAKE) OPTIMIZATION="-O0" MALLOC="libc"
-
-helgrind:
-	$(MAKE) OPTIMIZATION="-O0" MALLOC="libc" CFLAGS="-D__ATOMIC_VAR_FORCE_SYNC_MACROS" REDIS_CFLAGS="-I/usr/local/include" REDIS_LDFLAGS="-L/usr/local/lib"
-
-src/help.h:
-	@../utils/generate-command-help.rb > help.h
-
-install: all
-	@mkdir -p $(INSTALL_BIN)
-	$(call MAKE_INSTALL,$(REDIS_SERVER_NAME),$(INSTALL_BIN))
-	$(call MAKE_INSTALL,$(REDIS_BENCHMARK_NAME),$(INSTALL_BIN))
-	$(call MAKE_INSTALL,$(REDIS_CLI_NAME),$(INSTALL_BIN))
-	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_CHECK_RDB_NAME)
-	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_CHECK_AOF_NAME)
-	@ln -sf $(REDIS_SERVER_NAME) $(INSTALL_BIN)/$(REDIS_SENTINEL_NAME)
-
-uninstall:
-	rm -f $(INSTALL_BIN)/{$(REDIS_SERVER_NAME),$(REDIS_BENCHMARK_NAME),$(REDIS_CLI_NAME),$(REDIS_CHECK_RDB_NAME),$(REDIS_CHECK_AOF_NAME),$(REDIS_SENTINEL_NAME)}
diff --git a/redis-stable/src/acl.c b/redis-stable/src/acl.c
deleted file mode 100644
index 86f73fe7..00000000
--- a/redis-stable/src/acl.c
+++ /dev/null
@@ -1,2292 +0,0 @@
-/*
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "sha256.h"
-#include <fcntl.h>
-#include <ctype.h>
-
-/* =============================================================================
- * Global state for ACLs
- * ==========================================================================*/
-
-rax *Users; /* Table mapping usernames to user structures. */
-
-user *DefaultUser;  /* Global reference to the default user.
-                       Every new connection is associated to it, if no
-                       AUTH or HELLO is used to authenticate with a
-                       different user. */
-
-list *UsersToLoad;  /* This is a list of users found in the configuration file
-                       that we'll need to load in the final stage of Redis
-                       initialization, after all the modules are already
-                       loaded. Every list element is a NULL terminated
-                       array of SDS pointers: the first is the user name,
-                       all the remaining pointers are ACL rules in the same
-                       format as ACLSetUser(). */
-list *ACLLog;       /* Our security log, the user is able to inspect that
-                       using the ACL LOG command .*/
-
-static rax *commandId = NULL; /* Command name to id mapping */
-
-static unsigned long nextid = 0; /* Next command id that has not been assigned */
-
-struct ACLCategoryItem {
-    const char *name;
-    uint64_t flag;
-} ACLCommandCategories[] = {
-    {"keyspace", CMD_CATEGORY_KEYSPACE},
-    {"read", CMD_CATEGORY_READ},
-    {"write", CMD_CATEGORY_WRITE},
-    {"set", CMD_CATEGORY_SET},
-    {"sortedset", CMD_CATEGORY_SORTEDSET},
-    {"list", CMD_CATEGORY_LIST},
-    {"hash", CMD_CATEGORY_HASH},
-    {"string", CMD_CATEGORY_STRING},
-    {"bitmap", CMD_CATEGORY_BITMAP},
-    {"hyperloglog", CMD_CATEGORY_HYPERLOGLOG},
-    {"geo", CMD_CATEGORY_GEO},
-    {"stream", CMD_CATEGORY_STREAM},
-    {"pubsub", CMD_CATEGORY_PUBSUB},
-    {"admin", CMD_CATEGORY_ADMIN},
-    {"fast", CMD_CATEGORY_FAST},
-    {"slow", CMD_CATEGORY_SLOW},
-    {"blocking", CMD_CATEGORY_BLOCKING},
-    {"dangerous", CMD_CATEGORY_DANGEROUS},
-    {"connection", CMD_CATEGORY_CONNECTION},
-    {"transaction", CMD_CATEGORY_TRANSACTION},
-    {"scripting", CMD_CATEGORY_SCRIPTING},
-    {NULL,0} /* Terminator. */
-};
-
-struct ACLUserFlag {
-    const char *name;
-    uint64_t flag;
-} ACLUserFlags[] = {
-    /* Note: the order here dictates the emitted order at ACLDescribeUser */
-    {"on", USER_FLAG_ENABLED},
-    {"off", USER_FLAG_DISABLED},
-    {"allkeys", USER_FLAG_ALLKEYS},
-    {"allchannels", USER_FLAG_ALLCHANNELS},
-    {"allcommands", USER_FLAG_ALLCOMMANDS},
-    {"nopass", USER_FLAG_NOPASS},
-    {"skip-sanitize-payload", USER_FLAG_SANITIZE_PAYLOAD_SKIP},
-    {"sanitize-payload", USER_FLAG_SANITIZE_PAYLOAD},
-    {NULL,0} /* Terminator. */
-};
-
-void ACLResetSubcommandsForCommand(user *u, unsigned long id);
-void ACLResetSubcommands(user *u);
-void ACLAddAllowedSubcommand(user *u, unsigned long id, const char *sub);
-void ACLFreeLogEntry(void *le);
-
-/* The length of the string representation of a hashed password. */
-#define HASH_PASSWORD_LEN SHA256_BLOCK_SIZE*2
-
-/* =============================================================================
- * Helper functions for the rest of the ACL implementation
- * ==========================================================================*/
-
-/* Return zero if strings are the same, non-zero if they are not.
- * The comparison is performed in a way that prevents an attacker to obtain
- * information about the nature of the strings just monitoring the execution
- * time of the function.
- *
- * Note that limiting the comparison length to strings up to 512 bytes we
- * can avoid leaking any information about the password length and any
- * possible branch misprediction related leak.
- */
-int time_independent_strcmp(char *a, char *b) {
-    char bufa[CONFIG_AUTHPASS_MAX_LEN], bufb[CONFIG_AUTHPASS_MAX_LEN];
-    /* The above two strlen perform len(a) + len(b) operations where either
-     * a or b are fixed (our password) length, and the difference is only
-     * relative to the length of the user provided string, so no information
-     * leak is possible in the following two lines of code. */
-    unsigned int alen = strlen(a);
-    unsigned int blen = strlen(b);
-    unsigned int j;
-    int diff = 0;
-
-    /* We can't compare strings longer than our static buffers.
-     * Note that this will never pass the first test in practical circumstances
-     * so there is no info leak. */
-    if (alen > sizeof(bufa) || blen > sizeof(bufb)) return 1;
-
-    memset(bufa,0,sizeof(bufa));        /* Constant time. */
-    memset(bufb,0,sizeof(bufb));        /* Constant time. */
-    /* Again the time of the following two copies is proportional to
-     * len(a) + len(b) so no info is leaked. */
-    memcpy(bufa,a,alen);
-    memcpy(bufb,b,blen);
-
-    /* Always compare all the chars in the two buffers without
-     * conditional expressions. */
-    for (j = 0; j < sizeof(bufa); j++) {
-        diff |= (bufa[j] ^ bufb[j]);
-    }
-    /* Length must be equal as well. */
-    diff |= alen ^ blen;
-    return diff; /* If zero strings are the same. */
-}
-
-/* Given an SDS string, returns the SHA256 hex representation as a
- * new SDS string. */
-sds ACLHashPassword(unsigned char *cleartext, size_t len) {
-    SHA256_CTX ctx;
-    unsigned char hash[SHA256_BLOCK_SIZE];
-    char hex[HASH_PASSWORD_LEN];
-    char *cset = "0123456789abcdef";
-
-    sha256_init(&ctx);
-    sha256_update(&ctx,(unsigned char*)cleartext,len);
-    sha256_final(&ctx,hash);
-
-    for (int j = 0; j < SHA256_BLOCK_SIZE; j++) {
-        hex[j*2] = cset[((hash[j]&0xF0)>>4)];
-        hex[j*2+1] = cset[(hash[j]&0xF)];
-    }
-    return sdsnewlen(hex,HASH_PASSWORD_LEN);
-}
-
-/* Given a hash and the hash length, returns C_OK if it is a valid password
- * hash, or C_ERR otherwise. */
-int ACLCheckPasswordHash(unsigned char *hash, int hashlen) {
-    if (hashlen != HASH_PASSWORD_LEN) {
-        return C_ERR;
-    }
-
-    /* Password hashes can only be characters that represent
-     * hexadecimal values, which are numbers and lowercase
-     * characters 'a' through 'f'. */
-    for(int i = 0; i < HASH_PASSWORD_LEN; i++) {
-        char c = hash[i];
-        if ((c < 'a' || c > 'f') && (c < '0' || c > '9')) {
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* =============================================================================
- * Low level ACL API
- * ==========================================================================*/
-
-/* Return 1 if the specified string contains spaces or null characters.
- * We do this for usernames and key patterns for simpler rewriting of
- * ACL rules, presentation on ACL list, and to avoid subtle security bugs
- * that may arise from parsing the rules in presence of escapes.
- * The function returns 0 if the string has no spaces. */
-int ACLStringHasSpaces(const char *s, size_t len) {
-    for (size_t i = 0; i < len; i++) {
-        if (isspace(s[i]) || s[i] == 0) return 1;
-    }
-    return 0;
-}
-
-/* Given the category name the command returns the corresponding flag, or
- * zero if there is no match. */
-uint64_t ACLGetCommandCategoryFlagByName(const char *name) {
-    for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
-        if (!strcasecmp(name,ACLCommandCategories[j].name)) {
-            return ACLCommandCategories[j].flag;
-        }
-    }
-    return 0; /* No match. */
-}
-
-/* Method for passwords/pattern comparison used for the user->passwords list
- * so that we can search for items with listSearchKey(). */
-int ACLListMatchSds(void *a, void *b) {
-    return sdscmp(a,b) == 0;
-}
-
-/* Method to free list elements from ACL users password/patterns lists. */
-void ACLListFreeSds(void *item) {
-    sdsfree(item);
-}
-
-/* Method to duplicate list elements from ACL users password/patterns lists. */
-void *ACLListDupSds(void *item) {
-    return sdsdup(item);
-}
-
-/* Create a new user with the specified name, store it in the list
- * of users (the Users global radix tree), and returns a reference to
- * the structure representing the user.
- *
- * If the user with such name already exists NULL is returned. */
-user *ACLCreateUser(const char *name, size_t namelen) {
-    if (raxFind(Users,(unsigned char*)name,namelen) != raxNotFound) return NULL;
-    user *u = zmalloc(sizeof(*u));
-    u->name = sdsnewlen(name,namelen);
-    u->flags = USER_FLAG_DISABLED | server.acl_pubsub_default;
-    u->allowed_subcommands = NULL;
-    u->passwords = listCreate();
-    u->patterns = listCreate();
-    u->channels = listCreate();
-    listSetMatchMethod(u->passwords,ACLListMatchSds);
-    listSetFreeMethod(u->passwords,ACLListFreeSds);
-    listSetDupMethod(u->passwords,ACLListDupSds);
-    listSetMatchMethod(u->patterns,ACLListMatchSds);
-    listSetFreeMethod(u->patterns,ACLListFreeSds);
-    listSetDupMethod(u->patterns,ACLListDupSds);
-    listSetMatchMethod(u->channels,ACLListMatchSds);
-    listSetFreeMethod(u->channels,ACLListFreeSds);
-    listSetDupMethod(u->channels,ACLListDupSds);
-    memset(u->allowed_commands,0,sizeof(u->allowed_commands));
-    raxInsert(Users,(unsigned char*)name,namelen,u,NULL);
-    return u;
-}
-
-/* This function should be called when we need an unlinked "fake" user
- * we can use in order to validate ACL rules or for other similar reasons.
- * The user will not get linked to the Users radix tree. The returned
- * user should be released with ACLFreeUser() as usually. */
-user *ACLCreateUnlinkedUser(void) {
-    char username[64];
-    for (int j = 0; ; j++) {
-        snprintf(username,sizeof(username),"__fakeuser:%d__",j);
-        user *fakeuser = ACLCreateUser(username,strlen(username));
-        if (fakeuser == NULL) continue;
-        int retval = raxRemove(Users,(unsigned char*) username,
-                               strlen(username),NULL);
-        serverAssert(retval != 0);
-        return fakeuser;
-    }
-}
-
-/* Release the memory used by the user structure. Note that this function
- * will not remove the user from the Users global radix tree. */
-void ACLFreeUser(user *u) {
-    sdsfree(u->name);
-    listRelease(u->passwords);
-    listRelease(u->patterns);
-    listRelease(u->channels);
-    ACLResetSubcommands(u);
-    zfree(u);
-}
-
-/* When a user is deleted we need to cycle the active
- * connections in order to kill all the pending ones that
- * are authenticated with such user. */
-void ACLFreeUserAndKillClients(user *u) {
-    listIter li;
-    listNode *ln;
-    listRewind(server.clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        client *c = listNodeValue(ln);
-        if (c->user == u) {
-            /* We'll free the connection asynchronously, so
-             * in theory to set a different user is not needed.
-             * However if there are bugs in Redis, soon or later
-             * this may result in some security hole: it's much
-             * more defensive to set the default user and put
-             * it in non authenticated mode. */
-            c->user = DefaultUser;
-            c->authenticated = 0;
-            /* We will write replies to this client later, so we can't
-             * close it directly even if async. */
-            if (c == server.current_client) {
-                c->flags |= CLIENT_CLOSE_AFTER_COMMAND;
-            } else {
-                freeClientAsync(c);
-            }
-        }
-    }
-    ACLFreeUser(u);
-}
-
-/* Copy the user ACL rules from the source user 'src' to the destination
- * user 'dst' so that at the end of the process they'll have exactly the
- * same rules (but the names will continue to be the original ones). */
-void ACLCopyUser(user *dst, user *src) {
-    listRelease(dst->passwords);
-    listRelease(dst->patterns);
-    listRelease(dst->channels);
-    dst->passwords = listDup(src->passwords);
-    dst->patterns = listDup(src->patterns);
-    dst->channels = listDup(src->channels);
-    memcpy(dst->allowed_commands,src->allowed_commands,
-           sizeof(dst->allowed_commands));
-    dst->flags = src->flags;
-    ACLResetSubcommands(dst);
-    /* Copy the allowed subcommands array of array of SDS strings. */
-    if (src->allowed_subcommands) {
-        for (int j = 0; j < USER_COMMAND_BITS_COUNT; j++) {
-            if (src->allowed_subcommands[j]) {
-                for (int i = 0; src->allowed_subcommands[j][i]; i++)
-                {
-                    ACLAddAllowedSubcommand(dst, j,
-                        src->allowed_subcommands[j][i]);
-                }
-            }
-        }
-    }
-}
-
-/* Free all the users registered in the radix tree 'users' and free the
- * radix tree itself. */
-void ACLFreeUsersSet(rax *users) {
-    raxFreeWithCallback(users,(void(*)(void*))ACLFreeUserAndKillClients);
-}
-
-/* Given a command ID, this function set by reference 'word' and 'bit'
- * so that user->allowed_commands[word] will address the right word
- * where the corresponding bit for the provided ID is stored, and
- * so that user->allowed_commands[word]&bit will identify that specific
- * bit. The function returns C_ERR in case the specified ID overflows
- * the bitmap in the user representation. */
-int ACLGetCommandBitCoordinates(uint64_t id, uint64_t *word, uint64_t *bit) {
-    if (id >= USER_COMMAND_BITS_COUNT) return C_ERR;
-    *word = id / sizeof(uint64_t) / 8;
-    *bit = 1ULL << (id % (sizeof(uint64_t) * 8));
-    return C_OK;
-}
-
-/* Check if the specified command bit is set for the specified user.
- * The function returns 1 is the bit is set or 0 if it is not.
- * Note that this function does not check the ALLCOMMANDS flag of the user
- * but just the lowlevel bitmask.
- *
- * If the bit overflows the user internal representation, zero is returned
- * in order to disallow the execution of the command in such edge case. */
-int ACLGetUserCommandBit(user *u, unsigned long id) {
-    uint64_t word, bit;
-    if (ACLGetCommandBitCoordinates(id,&word,&bit) == C_ERR) return 0;
-    return (u->allowed_commands[word] & bit) != 0;
-}
-
-/* When +@all or allcommands is given, we set a reserved bit as well that we
- * can later test, to see if the user has the right to execute "future commands",
- * that is, commands loaded later via modules. */
-int ACLUserCanExecuteFutureCommands(user *u) {
-    return ACLGetUserCommandBit(u,USER_COMMAND_BITS_COUNT-1);
-}
-
-/* Set the specified command bit for the specified user to 'value' (0 or 1).
- * If the bit overflows the user internal representation, no operation
- * is performed. As a side effect of calling this function with a value of
- * zero, the user flag ALLCOMMANDS is cleared since it is no longer possible
- * to skip the command bit explicit test. */
-void ACLSetUserCommandBit(user *u, unsigned long id, int value) {
-    uint64_t word, bit;
-    if (ACLGetCommandBitCoordinates(id,&word,&bit) == C_ERR) return;
-    if (value) {
-        u->allowed_commands[word] |= bit;
-    } else {
-        u->allowed_commands[word] &= ~bit;
-        u->flags &= ~USER_FLAG_ALLCOMMANDS;
-    }
-}
-
-/* This is like ACLSetUserCommandBit(), but instead of setting the specified
- * ID, it will check all the commands in the category specified as argument,
- * and will set all the bits corresponding to such commands to the specified
- * value. Since the category passed by the user may be non existing, the
- * function returns C_ERR if the category was not found, or C_OK if it was
- * found and the operation was performed. */
-int ACLSetUserCommandBitsForCategory(user *u, const char *category, int value) {
-    uint64_t cflag = ACLGetCommandCategoryFlagByName(category);
-    if (!cflag) return C_ERR;
-    dictIterator *di = dictGetIterator(server.orig_commands);
-    dictEntry *de;
-    while ((de = dictNext(di)) != NULL) {
-        struct redisCommand *cmd = dictGetVal(de);
-        if (cmd->flags & CMD_MODULE) continue; /* Ignore modules commands. */
-        if (cmd->flags & cflag) {
-            ACLSetUserCommandBit(u,cmd->id,value);
-            ACLResetSubcommandsForCommand(u,cmd->id);
-        }
-    }
-    dictReleaseIterator(di);
-    return C_OK;
-}
-
-/* Return the number of commands allowed (on) and denied (off) for the user 'u'
- * in the subset of commands flagged with the specified category name.
- * If the category name is not valid, C_ERR is returned, otherwise C_OK is
- * returned and on and off are populated by reference. */
-int ACLCountCategoryBitsForUser(user *u, unsigned long *on, unsigned long *off,
-                                const char *category)
-{
-    uint64_t cflag = ACLGetCommandCategoryFlagByName(category);
-    if (!cflag) return C_ERR;
-
-    *on = *off = 0;
-    dictIterator *di = dictGetIterator(server.orig_commands);
-    dictEntry *de;
-    while ((de = dictNext(di)) != NULL) {
-        struct redisCommand *cmd = dictGetVal(de);
-        if (cmd->flags & cflag) {
-            if (ACLGetUserCommandBit(u,cmd->id))
-                (*on)++;
-            else
-                (*off)++;
-        }
-    }
-    dictReleaseIterator(di);
-    return C_OK;
-}
-
-/* This function returns an SDS string representing the specified user ACL
- * rules related to command execution, in the same format you could set them
- * back using ACL SETUSER. The function will return just the set of rules needed
- * to recreate the user commands bitmap, without including other user flags such
- * as on/off, passwords and so forth. The returned string always starts with
- * the +@all or -@all rule, depending on the user bitmap, and is followed, if
- * needed, by the other rules needed to narrow or extend what the user can do. */
-sds ACLDescribeUserCommandRules(user *u) {
-    sds rules = sdsempty();
-    int additive;   /* If true we start from -@all and add, otherwise if
-                       false we start from +@all and remove. */
-
-    /* This code is based on a trick: as we generate the rules, we apply
-     * them to a fake user, so that as we go we still know what are the
-     * bit differences we should try to address by emitting more rules. */
-    user fu = {0};
-    user *fakeuser = &fu;
-
-    /* Here we want to understand if we should start with +@all and remove
-     * the commands corresponding to the bits that are not set in the user
-     * commands bitmap, or the contrary. Note that semantically the two are
-     * different. For instance starting with +@all and subtracting, the user
-     * will be able to execute future commands, while -@all and adding will just
-     * allow the user the run the selected commands and/or categories.
-     * How do we test for that? We use the trick of a reserved command ID bit
-     * that is set only by +@all (and its alias "allcommands"). */
-    if (ACLUserCanExecuteFutureCommands(u)) {
-        additive = 0;
-        rules = sdscat(rules,"+@all ");
-        ACLSetUser(fakeuser,"+@all",-1);
-    } else {
-        additive = 1;
-        rules = sdscat(rules,"-@all ");
-        ACLSetUser(fakeuser,"-@all",-1);
-    }
-
-    /* Attempt to find a good approximation for categories and commands
-     * based on the current bits used, by looping over the category list
-     * and applying the best fit each time. Often a set of categories will not 
-     * perfectly match the set of commands into it, so at the end we do a 
-     * final pass adding/removing the single commands needed to make the bitmap
-     * exactly match. A temp user is maintained to keep track of categories 
-     * already applied. */
-    user tu = {0};
-    user *tempuser = &tu;
-    
-    /* Keep track of the categories that have been applied, to prevent
-     * applying them twice.  */
-    char applied[sizeof(ACLCommandCategories)/sizeof(ACLCommandCategories[0])];
-    memset(applied, 0, sizeof(applied));
-
-    memcpy(tempuser->allowed_commands,
-        u->allowed_commands, 
-        sizeof(u->allowed_commands));
-    while (1) {
-        int best = -1;
-        unsigned long mindiff = INT_MAX, maxsame = 0;
-        for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
-            if (applied[j]) continue;
-
-            unsigned long on, off, diff, same;
-            ACLCountCategoryBitsForUser(tempuser,&on,&off,ACLCommandCategories[j].name);
-            /* Check if the current category is the best this loop:
-             * * It has more commands in common with the user than commands
-             *   that are different.
-             * AND EITHER
-             * * It has the fewest number of differences
-             *    than the best match we have found so far. 
-             * * OR it matches the fewest number of differences
-             *   that we've seen but it has more in common. */
-            diff = additive ? off : on;
-            same = additive ? on : off;
-            if (same > diff && 
-                ((diff < mindiff) || (diff == mindiff && same > maxsame)))
-            {
-                best = j;
-                mindiff = diff;
-                maxsame = same;
-            }
-        }
-
-        /* We didn't find a match */
-        if (best == -1) break;
-
-        sds op = sdsnewlen(additive ? "+@" : "-@", 2);
-        op = sdscat(op,ACLCommandCategories[best].name);
-        ACLSetUser(fakeuser,op,-1);
-
-        sds invop = sdsnewlen(additive ? "-@" : "+@", 2);
-        invop = sdscat(invop,ACLCommandCategories[best].name);
-        ACLSetUser(tempuser,invop,-1);
-
-        rules = sdscatsds(rules,op);
-        rules = sdscatlen(rules," ",1);
-        sdsfree(op);
-        sdsfree(invop);
-
-        applied[best] = 1;
-    }
-
-    /* Fix the final ACLs with single commands differences. */
-    dictIterator *di = dictGetIterator(server.orig_commands);
-    dictEntry *de;
-    while ((de = dictNext(di)) != NULL) {
-        struct redisCommand *cmd = dictGetVal(de);
-        int userbit = ACLGetUserCommandBit(u,cmd->id);
-        int fakebit = ACLGetUserCommandBit(fakeuser,cmd->id);
-        if (userbit != fakebit) {
-            rules = sdscatlen(rules, userbit ? "+" : "-", 1);
-            rules = sdscat(rules,cmd->name);
-            rules = sdscatlen(rules," ",1);
-            ACLSetUserCommandBit(fakeuser,cmd->id,userbit);
-        }
-
-        /* Emit the subcommands if there are any. */
-        if (userbit == 0 && u->allowed_subcommands &&
-            u->allowed_subcommands[cmd->id])
-        {
-            for (int j = 0; u->allowed_subcommands[cmd->id][j]; j++) {
-                rules = sdscatlen(rules,"+",1);
-                rules = sdscat(rules,cmd->name);
-                rules = sdscatlen(rules,"|",1);
-                rules = sdscatsds(rules,u->allowed_subcommands[cmd->id][j]);
-                rules = sdscatlen(rules," ",1);
-            }
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Trim the final useless space. */
-    sdsrange(rules,0,-2);
-
-    /* This is technically not needed, but we want to verify that now the
-     * predicted bitmap is exactly the same as the user bitmap, and abort
-     * otherwise, because aborting is better than a security risk in this
-     * code path. */
-    if (memcmp(fakeuser->allowed_commands,
-                        u->allowed_commands,
-                        sizeof(u->allowed_commands)) != 0)
-    {
-        serverLog(LL_WARNING,
-            "CRITICAL ERROR: User ACLs don't match final bitmap: '%s'",
-            rules);
-        serverPanic("No bitmap match in ACLDescribeUserCommandRules()");
-    }
-    return rules;
-}
-
-/* This is similar to ACLDescribeUserCommandRules(), however instead of
- * describing just the user command rules, everything is described: user
- * flags, keys, passwords and finally the command rules obtained via
- * the ACLDescribeUserCommandRules() function. This is the function we call
- * when we want to rewrite the configuration files describing ACLs and
- * in order to show users with ACL LIST. */
-sds ACLDescribeUser(user *u) {
-    sds res = sdsempty();
-
-    /* Flags. */
-    for (int j = 0; ACLUserFlags[j].flag; j++) {
-        /* Skip the allcommands, allkeys and allchannels flags because they'll
-         * be emitted later as +@all, ~* and &*. */
-        if (ACLUserFlags[j].flag == USER_FLAG_ALLKEYS ||
-            ACLUserFlags[j].flag == USER_FLAG_ALLCHANNELS ||
-            ACLUserFlags[j].flag == USER_FLAG_ALLCOMMANDS) continue;
-        if (u->flags & ACLUserFlags[j].flag) {
-            res = sdscat(res,ACLUserFlags[j].name);
-            res = sdscatlen(res," ",1);
-        }
-    }
-
-    /* Passwords. */
-    listIter li;
-    listNode *ln;
-    listRewind(u->passwords,&li);
-    while((ln = listNext(&li))) {
-        sds thispass = listNodeValue(ln);
-        res = sdscatlen(res,"#",1);
-        res = sdscatsds(res,thispass);
-        res = sdscatlen(res," ",1);
-    }
-
-    /* Key patterns. */
-    if (u->flags & USER_FLAG_ALLKEYS) {
-        res = sdscatlen(res,"~* ",3);
-    } else {
-        listRewind(u->patterns,&li);
-        while((ln = listNext(&li))) {
-            sds thispat = listNodeValue(ln);
-            res = sdscatlen(res,"~",1);
-            res = sdscatsds(res,thispat);
-            res = sdscatlen(res," ",1);
-        }
-    }
-
-    /* Pub/sub channel patterns. */
-    if (u->flags & USER_FLAG_ALLCHANNELS) {
-        res = sdscatlen(res,"&* ",3);
-    } else {
-        res = sdscatlen(res,"resetchannels ",14);
-        listRewind(u->channels,&li);
-        while((ln = listNext(&li))) {
-            sds thispat = listNodeValue(ln);
-            res = sdscatlen(res,"&",1);
-            res = sdscatsds(res,thispat);
-            res = sdscatlen(res," ",1);
-        }
-    }
-
-    /* Command rules. */
-    sds rules = ACLDescribeUserCommandRules(u);
-    res = sdscatsds(res,rules);
-    sdsfree(rules);
-    return res;
-}
-
-/* Get a command from the original command table, that is not affected
- * by the command renaming operations: we base all the ACL work from that
- * table, so that ACLs are valid regardless of command renaming. */
-struct redisCommand *ACLLookupCommand(const char *name) {
-    struct redisCommand *cmd;
-    sds sdsname = sdsnew(name);
-    cmd = dictFetchValue(server.orig_commands, sdsname);
-    sdsfree(sdsname);
-    return cmd;
-}
-
-/* Flush the array of allowed subcommands for the specified user
- * and command ID. */
-void ACLResetSubcommandsForCommand(user *u, unsigned long id) {
-    if (u->allowed_subcommands && u->allowed_subcommands[id]) {
-        for (int i = 0; u->allowed_subcommands[id][i]; i++)
-            sdsfree(u->allowed_subcommands[id][i]);
-        zfree(u->allowed_subcommands[id]);
-        u->allowed_subcommands[id] = NULL;
-    }
-}
-
-/* Flush the entire table of subcommands. This is useful on +@all, -@all
- * or similar to return back to the minimal memory usage (and checks to do)
- * for the user. */
-void ACLResetSubcommands(user *u) {
-    if (u->allowed_subcommands == NULL) return;
-    for (int j = 0; j < USER_COMMAND_BITS_COUNT; j++) {
-        if (u->allowed_subcommands[j]) {
-            for (int i = 0; u->allowed_subcommands[j][i]; i++)
-                sdsfree(u->allowed_subcommands[j][i]);
-            zfree(u->allowed_subcommands[j]);
-        }
-    }
-    zfree(u->allowed_subcommands);
-    u->allowed_subcommands = NULL;
-}
-
-/* Add a subcommand to the list of subcommands for the user 'u' and
- * the command id specified. */
-void ACLAddAllowedSubcommand(user *u, unsigned long id, const char *sub) {
-    /* If this is the first subcommand to be configured for
-     * this user, we have to allocate the subcommands array. */
-    if (u->allowed_subcommands == NULL) {
-        u->allowed_subcommands = zcalloc(USER_COMMAND_BITS_COUNT *
-                                 sizeof(sds*));
-    }
-
-    /* We also need to enlarge the allocation pointing to the
-     * null terminated SDS array, to make space for this one.
-     * To start check the current size, and while we are here
-     * make sure the subcommand is not already specified inside. */
-    long items = 0;
-    if (u->allowed_subcommands[id]) {
-        while(u->allowed_subcommands[id][items]) {
-            /* If it's already here do not add it again. */
-            if (!strcasecmp(u->allowed_subcommands[id][items],sub)) return;
-            items++;
-        }
-    }
-
-    /* Now we can make space for the new item (and the null term). */
-    items += 2;
-    u->allowed_subcommands[id] = zrealloc(u->allowed_subcommands[id],
-                                 sizeof(sds)*items);
-    u->allowed_subcommands[id][items-2] = sdsnew(sub);
-    u->allowed_subcommands[id][items-1] = NULL;
-}
-
-/* Set user properties according to the string "op". The following
- * is a description of what different strings will do:
- *
- * on           Enable the user: it is possible to authenticate as this user.
- * off          Disable the user: it's no longer possible to authenticate
- *              with this user, however the already authenticated connections
- *              will still work.
- * +<command>   Allow the execution of that command
- * -<command>   Disallow the execution of that command
- * +@<category> Allow the execution of all the commands in such category
- *              with valid categories are like @admin, @set, @sortedset, ...
- *              and so forth, see the full list in the server.c file where
- *              the Redis command table is described and defined.
- *              The special category @all means all the commands, but currently
- *              present in the server, and that will be loaded in the future
- *              via modules.
- * +<command>|subcommand    Allow a specific subcommand of an otherwise
- *                          disabled command. Note that this form is not
- *                          allowed as negative like -DEBUG|SEGFAULT, but
- *                          only additive starting with "+".
- * allcommands  Alias for +@all. Note that it implies the ability to execute
- *              all the future commands loaded via the modules system.
- * nocommands   Alias for -@all.
- * ~<pattern>   Add a pattern of keys that can be mentioned as part of
- *              commands. For instance ~* allows all the keys. The pattern
- *              is a glob-style pattern like the one of KEYS.
- *              It is possible to specify multiple patterns.
- * allkeys      Alias for ~*
- * resetkeys    Flush the list of allowed keys patterns.
- * &<pattern>   Add a pattern of channels that can be mentioned as part of
- *              Pub/Sub commands. For instance &* allows all the channels. The
- *              pattern is a glob-style pattern like the one of PSUBSCRIBE.
- *              It is possible to specify multiple patterns.
- * allchannels              Alias for &*
- * resetchannels            Flush the list of allowed keys patterns.
- * ><password>  Add this password to the list of valid password for the user.
- *              For example >mypass will add "mypass" to the list.
- *              This directive clears the "nopass" flag (see later).
- * #<hash>      Add this password hash to the list of valid hashes for
- *              the user. This is useful if you have previously computed
- *              the hash, and don't want to store it in plaintext.
- *              This directive clears the "nopass" flag (see later).
- * <<password>  Remove this password from the list of valid passwords.
- * !<hash>      Remove this hashed password from the list of valid passwords.
- *              This is useful when you want to remove a password just by
- *              hash without knowing its plaintext version at all.
- * nopass       All the set passwords of the user are removed, and the user
- *              is flagged as requiring no password: it means that every
- *              password will work against this user. If this directive is
- *              used for the default user, every new connection will be
- *              immediately authenticated with the default user without
- *              any explicit AUTH command required. Note that the "resetpass"
- *              directive will clear this condition.
- * resetpass    Flush the list of allowed passwords. Moreover removes the
- *              "nopass" status. After "resetpass" the user has no associated
- *              passwords and there is no way to authenticate without adding
- *              some password (or setting it as "nopass" later).
- * reset        Performs the following actions: resetpass, resetkeys, off,
- *              -@all. The user returns to the same state it has immediately
- *              after its creation.
- *
- * The 'op' string must be null terminated. The 'oplen' argument should
- * specify the length of the 'op' string in case the caller requires to pass
- * binary data (for instance the >password form may use a binary password).
- * Otherwise the field can be set to -1 and the function will use strlen()
- * to determine the length.
- *
- * The function returns C_OK if the action to perform was understood because
- * the 'op' string made sense. Otherwise C_ERR is returned if the operation
- * is unknown or has some syntax error.
- *
- * When an error is returned, errno is set to the following values:
- *
- * EINVAL: The specified opcode is not understood or the key/channel pattern is
- *         invalid (contains non allowed characters).
- * ENOENT: The command name or command category provided with + or - is not
- *         known.
- * EEXIST: You are adding a key pattern after "*" was already added. This is
- *         almost surely an error on the user side.
- * EISDIR: You are adding a channel pattern after "*" was already added. This is
- *         almost surely an error on the user side.
- * ENODEV: The password you are trying to remove from the user does not exist.
- * EBADMSG: The hash you are trying to add is not a valid hash.
- */
-int ACLSetUser(user *u, const char *op, ssize_t oplen) {
-    if (oplen == -1) oplen = strlen(op);
-    if (oplen == 0) return C_OK; /* Empty string is a no-operation. */
-    if (!strcasecmp(op,"on")) {
-        u->flags |= USER_FLAG_ENABLED;
-        u->flags &= ~USER_FLAG_DISABLED;
-    } else if (!strcasecmp(op,"off")) {
-        u->flags |= USER_FLAG_DISABLED;
-        u->flags &= ~USER_FLAG_ENABLED;
-    } else if (!strcasecmp(op,"skip-sanitize-payload")) {
-        u->flags |= USER_FLAG_SANITIZE_PAYLOAD_SKIP;
-        u->flags &= ~USER_FLAG_SANITIZE_PAYLOAD;
-    } else if (!strcasecmp(op,"sanitize-payload")) {
-        u->flags &= ~USER_FLAG_SANITIZE_PAYLOAD_SKIP;
-        u->flags |= USER_FLAG_SANITIZE_PAYLOAD;
-    } else if (!strcasecmp(op,"allkeys") ||
-               !strcasecmp(op,"~*"))
-    {
-        u->flags |= USER_FLAG_ALLKEYS;
-        listEmpty(u->patterns);
-    } else if (!strcasecmp(op,"resetkeys")) {
-        u->flags &= ~USER_FLAG_ALLKEYS;
-        listEmpty(u->patterns);
-    } else if (!strcasecmp(op,"allchannels") ||
-               !strcasecmp(op,"&*"))
-    {
-        u->flags |= USER_FLAG_ALLCHANNELS;
-        listEmpty(u->channels);
-    } else if (!strcasecmp(op,"resetchannels")) {
-        u->flags &= ~USER_FLAG_ALLCHANNELS;
-        listEmpty(u->channels);
-    } else if (!strcasecmp(op,"allcommands") ||
-               !strcasecmp(op,"+@all"))
-    {
-        memset(u->allowed_commands,255,sizeof(u->allowed_commands));
-        u->flags |= USER_FLAG_ALLCOMMANDS;
-        ACLResetSubcommands(u);
-    } else if (!strcasecmp(op,"nocommands") ||
-               !strcasecmp(op,"-@all"))
-    {
-        memset(u->allowed_commands,0,sizeof(u->allowed_commands));
-        u->flags &= ~USER_FLAG_ALLCOMMANDS;
-        ACLResetSubcommands(u);
-    } else if (!strcasecmp(op,"nopass")) {
-        u->flags |= USER_FLAG_NOPASS;
-        listEmpty(u->passwords);
-    } else if (!strcasecmp(op,"resetpass")) {
-        u->flags &= ~USER_FLAG_NOPASS;
-        listEmpty(u->passwords);
-    } else if (op[0] == '>' || op[0] == '#') {
-        sds newpass;
-        if (op[0] == '>') {
-            newpass = ACLHashPassword((unsigned char*)op+1,oplen-1);
-        } else {
-            if (ACLCheckPasswordHash((unsigned char*)op+1,oplen-1) == C_ERR) {
-                errno = EBADMSG;
-                return C_ERR;
-            }
-            newpass = sdsnewlen(op+1,oplen-1);
-        }
-
-        listNode *ln = listSearchKey(u->passwords,newpass);
-        /* Avoid re-adding the same password multiple times. */
-        if (ln == NULL)
-            listAddNodeTail(u->passwords,newpass);
-        else
-            sdsfree(newpass);
-        u->flags &= ~USER_FLAG_NOPASS;
-    } else if (op[0] == '<' || op[0] == '!') {
-        sds delpass;
-        if (op[0] == '<') {
-            delpass = ACLHashPassword((unsigned char*)op+1,oplen-1);
-        } else {
-            if (ACLCheckPasswordHash((unsigned char*)op+1,oplen-1) == C_ERR) {
-                errno = EBADMSG;
-                return C_ERR;
-            }
-            delpass = sdsnewlen(op+1,oplen-1);
-        }
-        listNode *ln = listSearchKey(u->passwords,delpass);
-        sdsfree(delpass);
-        if (ln) {
-            listDelNode(u->passwords,ln);
-        } else {
-            errno = ENODEV;
-            return C_ERR;
-        }
-    } else if (op[0] == '~') {
-        if (u->flags & USER_FLAG_ALLKEYS) {
-            errno = EEXIST;
-            return C_ERR;
-        }
-        if (ACLStringHasSpaces(op+1,oplen-1)) {
-            errno = EINVAL;
-            return C_ERR;
-        }
-        sds newpat = sdsnewlen(op+1,oplen-1);
-        listNode *ln = listSearchKey(u->patterns,newpat);
-        /* Avoid re-adding the same key pattern multiple times. */
-        if (ln == NULL)
-            listAddNodeTail(u->patterns,newpat);
-        else
-            sdsfree(newpat);
-        u->flags &= ~USER_FLAG_ALLKEYS;
-    } else if (op[0] == '&') {
-        if (u->flags & USER_FLAG_ALLCHANNELS) {
-            errno = EISDIR;
-            return C_ERR;
-        }
-        if (ACLStringHasSpaces(op+1,oplen-1)) {
-            errno = EINVAL;
-            return C_ERR;
-        }
-        sds newpat = sdsnewlen(op+1,oplen-1);
-        listNode *ln = listSearchKey(u->channels,newpat);
-        /* Avoid re-adding the same channel pattern multiple times. */
-        if (ln == NULL)
-            listAddNodeTail(u->channels,newpat);
-        else
-            sdsfree(newpat);
-        u->flags &= ~USER_FLAG_ALLCHANNELS;
-    } else if (op[0] == '+' && op[1] != '@') {
-        if (strchr(op,'|') == NULL) {
-            if (ACLLookupCommand(op+1) == NULL) {
-                errno = ENOENT;
-                return C_ERR;
-            }
-            unsigned long id = ACLGetCommandID(op+1);
-            ACLSetUserCommandBit(u,id,1);
-            ACLResetSubcommandsForCommand(u,id);
-        } else {
-            /* Split the command and subcommand parts. */
-            char *copy = zstrdup(op+1);
-            char *sub = strchr(copy,'|');
-            sub[0] = '\0';
-            sub++;
-
-            /* Check if the command exists. We can't check the
-             * subcommand to see if it is valid. */
-            if (ACLLookupCommand(copy) == NULL) {
-                zfree(copy);
-                errno = ENOENT;
-                return C_ERR;
-            }
-
-            /* The subcommand cannot be empty, so things like DEBUG|
-             * are syntax errors of course. */
-            if (strlen(sub) == 0) {
-                zfree(copy);
-                errno = EINVAL;
-                return C_ERR;
-            }
-
-            unsigned long id = ACLGetCommandID(copy);
-            /* Add the subcommand to the list of valid ones, if the command is not set. */
-            if (ACLGetUserCommandBit(u,id) == 0) {
-                ACLAddAllowedSubcommand(u,id,sub);
-            }
-
-            zfree(copy);
-        }
-    } else if (op[0] == '-' && op[1] != '@') {
-        if (ACLLookupCommand(op+1) == NULL) {
-            errno = ENOENT;
-            return C_ERR;
-        }
-        unsigned long id = ACLGetCommandID(op+1);
-        ACLSetUserCommandBit(u,id,0);
-        ACLResetSubcommandsForCommand(u,id);
-    } else if ((op[0] == '+' || op[0] == '-') && op[1] == '@') {
-        int bitval = op[0] == '+' ? 1 : 0;
-        if (ACLSetUserCommandBitsForCategory(u,op+2,bitval) == C_ERR) {
-            errno = ENOENT;
-            return C_ERR;
-        }
-    } else if (!strcasecmp(op,"reset")) {
-        serverAssert(ACLSetUser(u,"resetpass",-1) == C_OK);
-        serverAssert(ACLSetUser(u,"resetkeys",-1) == C_OK);
-        serverAssert(ACLSetUser(u,"resetchannels",-1) == C_OK);
-        if (server.acl_pubsub_default & USER_FLAG_ALLCHANNELS)
-            serverAssert(ACLSetUser(u,"allchannels",-1) == C_OK);
-        serverAssert(ACLSetUser(u,"off",-1) == C_OK);
-        serverAssert(ACLSetUser(u,"sanitize-payload",-1) == C_OK);
-        serverAssert(ACLSetUser(u,"-@all",-1) == C_OK);
-    } else {
-        errno = EINVAL;
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-/* Return a description of the error that occurred in ACLSetUser() according to
- * the errno value set by the function on error. */
-const char *ACLSetUserStringError(void) {
-    const char *errmsg = "Wrong format";
-    if (errno == ENOENT)
-        errmsg = "Unknown command or category name in ACL";
-    else if (errno == EINVAL)
-        errmsg = "Syntax error";
-    else if (errno == EEXIST)
-        errmsg = "Adding a pattern after the * pattern (or the "
-                 "'allkeys' flag) is not valid and does not have any "
-                 "effect. Try 'resetkeys' to start with an empty "
-                 "list of patterns";
-    else if (errno == EISDIR)
-        errmsg = "Adding a pattern after the * pattern (or the "
-                 "'allchannels' flag) is not valid and does not have any "
-                 "effect. Try 'resetchannels' to start with an empty "
-                 "list of channels";
-    else if (errno == ENODEV)
-        errmsg = "The password you are trying to remove from the user does "
-                 "not exist";
-    else if (errno == EBADMSG)
-        errmsg = "The password hash must be exactly 64 characters and contain "
-                 "only lowercase hexadecimal characters";
-    return errmsg;
-}
-
-/* Initialize the default user, that will always exist for all the process
- * lifetime. */
-void ACLInitDefaultUser(void) {
-    DefaultUser = ACLCreateUser("default",7);
-    ACLSetUser(DefaultUser,"+@all",-1);
-    ACLSetUser(DefaultUser,"~*",-1);
-    ACLSetUser(DefaultUser,"&*",-1);
-    ACLSetUser(DefaultUser,"on",-1);
-    ACLSetUser(DefaultUser,"nopass",-1);
-}
-
-/* Initialization of the ACL subsystem. */
-void ACLInit(void) {
-    Users = raxNew();
-    UsersToLoad = listCreate();
-    ACLLog = listCreate();
-    ACLInitDefaultUser();
-}
-
-/* Check the username and password pair and return C_OK if they are valid,
- * otherwise C_ERR is returned and errno is set to:
- *
- *  EINVAL: if the username-password do not match.
- *  ENONENT: if the specified user does not exist at all.
- */
-int ACLCheckUserCredentials(robj *username, robj *password) {
-    user *u = ACLGetUserByName(username->ptr,sdslen(username->ptr));
-    if (u == NULL) {
-        errno = ENOENT;
-        return C_ERR;
-    }
-
-    /* Disabled users can't login. */
-    if (u->flags & USER_FLAG_DISABLED) {
-        errno = EINVAL;
-        return C_ERR;
-    }
-
-    /* If the user is configured to don't require any password, we
-     * are already fine here. */
-    if (u->flags & USER_FLAG_NOPASS) return C_OK;
-
-    /* Check all the user passwords for at least one to match. */
-    listIter li;
-    listNode *ln;
-    listRewind(u->passwords,&li);
-    sds hashed = ACLHashPassword(password->ptr,sdslen(password->ptr));
-    while((ln = listNext(&li))) {
-        sds thispass = listNodeValue(ln);
-        if (!time_independent_strcmp(hashed, thispass)) {
-            sdsfree(hashed);
-            return C_OK;
-        }
-    }
-    sdsfree(hashed);
-
-    /* If we reached this point, no password matched. */
-    errno = EINVAL;
-    return C_ERR;
-}
-
-/* This is like ACLCheckUserCredentials(), however if the user/pass
- * are correct, the connection is put in authenticated state and the
- * connection user reference is populated.
- *
- * The return value is C_OK or C_ERR with the same meaning as
- * ACLCheckUserCredentials(). */
-int ACLAuthenticateUser(client *c, robj *username, robj *password) {
-    if (ACLCheckUserCredentials(username,password) == C_OK) {
-        c->authenticated = 1;
-        c->user = ACLGetUserByName(username->ptr,sdslen(username->ptr));
-        moduleNotifyUserChanged(c);
-        return C_OK;
-    } else {
-        addACLLogEntry(c,ACL_DENIED_AUTH,0,username->ptr);
-        return C_ERR;
-    }
-}
-
-/* For ACL purposes, every user has a bitmap with the commands that such
- * user is allowed to execute. In order to populate the bitmap, every command
- * should have an assigned ID (that is used to index the bitmap). This function
- * creates such an ID: it uses sequential IDs, reusing the same ID for the same
- * command name, so that a command retains the same ID in case of modules that
- * are unloaded and later reloaded. */
-unsigned long ACLGetCommandID(const char *cmdname) {
-
-    sds lowername = sdsnew(cmdname);
-    sdstolower(lowername);
-    if (commandId == NULL) commandId = raxNew();
-    void *id = raxFind(commandId,(unsigned char*)lowername,sdslen(lowername));
-    if (id != raxNotFound) {
-        sdsfree(lowername);
-        return (unsigned long)id;
-    }
-    raxInsert(commandId,(unsigned char*)lowername,strlen(lowername),
-              (void*)nextid,NULL);
-    sdsfree(lowername);
-    unsigned long thisid = nextid;
-    nextid++;
-
-    /* We never assign the last bit in the user commands bitmap structure,
-     * this way we can later check if this bit is set, understanding if the
-     * current ACL for the user was created starting with a +@all to add all
-     * the possible commands and just subtracting other single commands or
-     * categories, or if, instead, the ACL was created just adding commands
-     * and command categories from scratch, not allowing future commands by
-     * default (loaded via modules). This is useful when rewriting the ACLs
-     * with ACL SAVE. */
-    if (nextid == USER_COMMAND_BITS_COUNT-1) nextid++;
-    return thisid;
-}
-
-/* Clear command id table and reset nextid to 0. */
-void ACLClearCommandID(void) {
-    if (commandId) raxFree(commandId);
-    commandId = NULL;
-    nextid = 0;
-}
-
-/* Return an username by its name, or NULL if the user does not exist. */
-user *ACLGetUserByName(const char *name, size_t namelen) {
-    void *myuser = raxFind(Users,(unsigned char*)name,namelen);
-    if (myuser == raxNotFound) return NULL;
-    return myuser;
-}
-
-/* Check if the command is ready to be executed in the client 'c', already
- * referenced by c->cmd, and can be executed by this client according to the
- * ACLs associated to the client user c->user.
- *
- * If the user can execute the command ACL_OK is returned, otherwise
- * ACL_DENIED_CMD or ACL_DENIED_KEY is returned: the first in case the
- * command cannot be executed because the user is not allowed to run such
- * command, the second if the command is denied because the user is trying
- * to access keys that are not among the specified patterns. */
-int ACLCheckCommandPerm(client *c, int *keyidxptr) {
-    user *u = c->user;
-    uint64_t id = c->cmd->id;
-
-    /* If there is no associated user, the connection can run anything. */
-    if (u == NULL) return ACL_OK;
-
-    /* Check if the user can execute this command or if the command
-     * doesn't need to be authenticated (hello, auth). */
-    if (!(u->flags & USER_FLAG_ALLCOMMANDS) && !(c->cmd->flags & CMD_NO_AUTH))
-    {
-        /* If the bit is not set we have to check further, in case the
-         * command is allowed just with that specific subcommand. */
-        if (ACLGetUserCommandBit(u,id) == 0) {
-            /* Check if the subcommand matches. */
-            if (c->argc < 2 ||
-                u->allowed_subcommands == NULL ||
-                u->allowed_subcommands[id] == NULL)
-            {
-                return ACL_DENIED_CMD;
-            }
-
-            long subid = 0;
-            while (1) {
-                if (u->allowed_subcommands[id][subid] == NULL)
-                    return ACL_DENIED_CMD;
-                if (!strcasecmp(c->argv[1]->ptr,
-                                u->allowed_subcommands[id][subid]))
-                    break; /* Subcommand match found. Stop here. */
-                subid++;
-            }
-        }
-    }
-
-    /* Check if the user can execute commands explicitly touching the keys
-     * mentioned in the command arguments. */
-    if (!(c->user->flags & USER_FLAG_ALLKEYS) &&
-        (c->cmd->getkeys_proc || c->cmd->firstkey))
-    {
-        getKeysResult result = GETKEYS_RESULT_INIT;
-        int numkeys = getKeysFromCommand(c->cmd,c->argv,c->argc,&result);
-        int *keyidx = result.keys;
-        for (int j = 0; j < numkeys; j++) {
-            listIter li;
-            listNode *ln;
-            listRewind(u->patterns,&li);
-
-            /* Test this key against every pattern. */
-            int match = 0;
-            while((ln = listNext(&li))) {
-                sds pattern = listNodeValue(ln);
-                size_t plen = sdslen(pattern);
-                int idx = keyidx[j];
-                if (stringmatchlen(pattern,plen,c->argv[idx]->ptr,
-                                   sdslen(c->argv[idx]->ptr),0))
-                {
-                    match = 1;
-                    break;
-                }
-            }
-            if (!match) {
-                if (keyidxptr) *keyidxptr = keyidx[j];
-                getKeysFreeResult(&result);
-                return ACL_DENIED_KEY;
-            }
-        }
-        getKeysFreeResult(&result);
-    }
-
-    /* If we survived all the above checks, the user can execute the
-     * command. */
-    return ACL_OK;
-}
-
-/* Check if the provided channel is whitelisted by the given allowed channels
- * list. Glob-style pattern matching is employed, unless the literal flag is
- * set. Returns ACL_OK if access is granted or ACL_DENIED_CHANNEL otherwise. */
-int ACLCheckPubsubChannelPerm(sds channel, list *allowed, int literal) {
-    listIter li;
-    listNode *ln;
-    size_t clen = sdslen(channel);
-    int match = 0;
-
-    listRewind(allowed,&li);
-    while((ln = listNext(&li))) {
-        sds pattern = listNodeValue(ln);
-        size_t plen = sdslen(pattern);
-
-        if ((literal && !sdscmp(pattern,channel)) || 
-            (!literal && stringmatchlen(pattern,plen,channel,clen,0)))
-        {
-            match = 1;
-            break;
-        }
-    }
-    if (!match) {
-        return ACL_DENIED_CHANNEL;
-    }
-    return ACL_OK;
-}
-
-/* Check if the user's existing pub/sub clients violate the ACL pub/sub
- * permissions specified via the upcoming argument, and kill them if so. */
-void ACLKillPubsubClientsIfNeeded(user *u, list *upcoming) {
-    listIter li, lpi;
-    listNode *ln, *lpn;
-    robj *o;
-    int kill = 0;
-    
-    /* Nothing to kill when the upcoming are a literal super set of the original
-     * permissions. */
-    listRewind(u->channels,&li);
-    while (!kill && ((ln = listNext(&li)) != NULL)) {
-        sds pattern = listNodeValue(ln);
-        kill = (ACLCheckPubsubChannelPerm(pattern,upcoming,1) ==
-                ACL_DENIED_CHANNEL);
-    }
-    if (!kill) return;
-
-    /* Scan all connected clients to find the user's pub/subs. */
-    listRewind(server.clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        client *c = listNodeValue(ln);
-        kill = 0;
-
-        if (c->user == u && getClientType(c) == CLIENT_TYPE_PUBSUB) {
-            /* Check for pattern violations. */
-            listRewind(c->pubsub_patterns,&lpi);
-            while (!kill && ((lpn = listNext(&lpi)) != NULL)) {
-                o = lpn->value;
-                kill = (ACLCheckPubsubChannelPerm(o->ptr,upcoming,1) == 
-                        ACL_DENIED_CHANNEL);
-            }
-            /* Check for channel violations. */
-            if (!kill) {
-                dictIterator *di = dictGetIterator(c->pubsub_channels);
-                dictEntry *de;                
-                while (!kill && ((de = dictNext(di)) != NULL)) {
-                    o = dictGetKey(de);
-                    kill = (ACLCheckPubsubChannelPerm(o->ptr,upcoming,0) ==
-                            ACL_DENIED_CHANNEL);
-                }
-                dictReleaseIterator(di);
-            }
-
-            /* Kill it. */
-            if (kill) {
-                freeClient(c);
-            }
-        }
-    }
-}
-
-/* Check if the pub/sub channels of the command, that's ready to be executed in
- * the client 'c', can be executed by this client according to the ACLs channels
- * associated to the client user c->user.
- * 
- * idx and count are the index and count of channel arguments from the
- * command. The literal argument controls whether the user's ACL channels are 
- * evaluated as literal values or matched as glob-like patterns.
- *
- * If the user can execute the command ACL_OK is returned, otherwise 
- * ACL_DENIED_CHANNEL. */
-int ACLCheckPubsubPerm(client *c, int idx, int count, int literal, int *idxptr) {
-    user *u = c->user;
-
-    /* If there is no associated user, the connection can run anything. */
-    if (u == NULL) return ACL_OK;
-
-    /* Check if the user can access the channels mentioned in the command's
-     * arguments. */
-    if (!(c->user->flags & USER_FLAG_ALLCHANNELS)) {
-        for (int j = idx; j < idx+count; j++) {
-            if (ACLCheckPubsubChannelPerm(c->argv[j]->ptr,u->channels,literal)
-                != ACL_OK) {
-                if (idxptr) *idxptr = j;
-                return ACL_DENIED_CHANNEL;
-            }
-        }
-    }
-
-    /* If we survived all the above checks, the user can execute the
-     * command. */
-    return ACL_OK;
-
-}
-
-/* Check whether the command is ready to be exceuted by ACLCheckCommandPerm.
- * If check passes, then check whether pub/sub channels of the command is
- * ready to be executed by ACLCheckPubsubPerm */
-int ACLCheckAllPerm(client *c, int *idxptr) {
-    int acl_retval = ACLCheckCommandPerm(c,idxptr);
-    if (acl_retval != ACL_OK)
-        return acl_retval;
-    if (c->cmd->proc == publishCommand)
-        acl_retval = ACLCheckPubsubPerm(c,1,1,0,idxptr);
-    else if (c->cmd->proc == subscribeCommand)
-        acl_retval = ACLCheckPubsubPerm(c,1,c->argc-1,0,idxptr);
-    else if (c->cmd->proc == psubscribeCommand)
-        acl_retval = ACLCheckPubsubPerm(c,1,c->argc-1,1,idxptr);
-    return acl_retval;
-}
-
-/* =============================================================================
- * ACL loading / saving functions
- * ==========================================================================*/
-
-/* Given an argument vector describing a user in the form:
- *
- *      user <username> ... ACL rules and flags ...
- *
- * this function validates, and if the syntax is valid, appends
- * the user definition to a list for later loading.
- *
- * The rules are tested for validity and if there obvious syntax errors
- * the function returns C_ERR and does nothing, otherwise C_OK is returned
- * and the user is appended to the list.
- *
- * Note that this function cannot stop in case of commands that are not found
- * and, in that case, the error will be emitted later, because certain
- * commands may be defined later once modules are loaded.
- *
- * When an error is detected and C_ERR is returned, the function populates
- * by reference (if not set to NULL) the argc_err argument with the index
- * of the argv vector that caused the error. */
-int ACLAppendUserForLoading(sds *argv, int argc, int *argc_err) {
-    if (argc < 2 || strcasecmp(argv[0],"user")) {
-        if (argc_err) *argc_err = 0;
-        return C_ERR;
-    }
-
-    /* Try to apply the user rules in a fake user to see if they
-     * are actually valid. */
-    user *fakeuser = ACLCreateUnlinkedUser();
-
-    for (int j = 2; j < argc; j++) {
-        if (ACLSetUser(fakeuser,argv[j],sdslen(argv[j])) == C_ERR) {
-            if (errno != ENOENT) {
-                ACLFreeUser(fakeuser);
-                if (argc_err) *argc_err = j;
-                return C_ERR;
-            }
-        }
-    }
-
-    /* Rules look valid, let's append the user to the list. */
-    sds *copy = zmalloc(sizeof(sds)*argc);
-    for (int j = 1; j < argc; j++) copy[j-1] = sdsdup(argv[j]);
-    copy[argc-1] = NULL;
-    listAddNodeTail(UsersToLoad,copy);
-    ACLFreeUser(fakeuser);
-    return C_OK;
-}
-
-/* This function will load the configured users appended to the server
- * configuration via ACLAppendUserForLoading(). On loading errors it will
- * log an error and return C_ERR, otherwise C_OK will be returned. */
-int ACLLoadConfiguredUsers(void) {
-    listIter li;
-    listNode *ln;
-    listRewind(UsersToLoad,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        sds *aclrules = listNodeValue(ln);
-        sds username = aclrules[0];
-
-        if (ACLStringHasSpaces(aclrules[0],sdslen(aclrules[0]))) {
-            serverLog(LL_WARNING,"Spaces not allowed in ACL usernames");
-            return C_ERR;
-        }
-
-        user *u = ACLCreateUser(username,sdslen(username));
-        if (!u) {
-            u = ACLGetUserByName(username,sdslen(username));
-            serverAssert(u != NULL);
-            ACLSetUser(u,"reset",-1);
-        }
-
-        /* Load every rule defined for this user. */
-        for (int j = 1; aclrules[j]; j++) {
-            if (ACLSetUser(u,aclrules[j],sdslen(aclrules[j])) != C_OK) {
-                const char *errmsg = ACLSetUserStringError();
-                serverLog(LL_WARNING,"Error loading ACL rule '%s' for "
-                                     "the user named '%s': %s",
-                          aclrules[j],aclrules[0],errmsg);
-                return C_ERR;
-            }
-        }
-
-        /* Having a disabled user in the configuration may be an error,
-         * warn about it without returning any error to the caller. */
-        if (u->flags & USER_FLAG_DISABLED) {
-            serverLog(LL_NOTICE, "The user '%s' is disabled (there is no "
-                                 "'on' modifier in the user description). Make "
-                                 "sure this is not a configuration error.",
-                      aclrules[0]);
-        }
-    }
-    return C_OK;
-}
-
-/* This function loads the ACL from the specified filename: every line
- * is validated and should be either empty or in the format used to specify
- * users in the redis.conf configuration or in the ACL file, that is:
- *
- *  user <username> ... rules ...
- *
- * Note that this function considers comments starting with '#' as errors
- * because the ACL file is meant to be rewritten, and comments would be
- * lost after the rewrite. Yet empty lines are allowed to avoid being too
- * strict.
- *
- * One important part of implementing ACL LOAD, that uses this function, is
- * to avoid ending with broken rules if the ACL file is invalid for some
- * reason, so the function will attempt to validate the rules before loading
- * each user. For every line that will be found broken the function will
- * collect an error message.
- *
- * IMPORTANT: If there is at least a single error, nothing will be loaded
- * and the rules will remain exactly as they were.
- *
- * At the end of the process, if no errors were found in the whole file then
- * NULL is returned. Otherwise an SDS string describing in a single line
- * a description of all the issues found is returned. */
-sds ACLLoadFromFile(const char *filename) {
-    FILE *fp;
-    char buf[1024];
-
-    /* Open the ACL file. */
-    if ((fp = fopen(filename,"r")) == NULL) {
-        sds errors = sdscatprintf(sdsempty(),
-            "Error loading ACLs, opening file '%s': %s",
-            filename, strerror(errno));
-        return errors;
-    }
-
-    /* Load the whole file as a single string in memory. */
-    sds acls = sdsempty();
-    while(fgets(buf,sizeof(buf),fp) != NULL)
-        acls = sdscat(acls,buf);
-    fclose(fp);
-
-    /* Split the file into lines and attempt to load each line. */
-    int totlines;
-    sds *lines, errors = sdsempty();
-    lines = sdssplitlen(acls,strlen(acls),"\n",1,&totlines);
-    sdsfree(acls);
-
-    /* We need a fake user to validate the rules before making changes
-     * to the real user mentioned in the ACL line. */
-    user *fakeuser = ACLCreateUnlinkedUser();
-
-    /* We do all the loading in a fresh instance of the Users radix tree,
-     * so if there are errors loading the ACL file we can rollback to the
-     * old version. */
-    rax *old_users = Users;
-    user *old_default_user = DefaultUser;
-    Users = raxNew();
-    ACLInitDefaultUser();
-
-    /* Load each line of the file. */
-    for (int i = 0; i < totlines; i++) {
-        sds *argv;
-        int argc;
-        int linenum = i+1;
-
-        lines[i] = sdstrim(lines[i]," \t\r\n");
-
-        /* Skip blank lines */
-        if (lines[i][0] == '\0') continue;
-
-        /* Split into arguments */
-        argv = sdssplitlen(lines[i],sdslen(lines[i])," ",1,&argc);
-        if (argv == NULL) {
-            errors = sdscatprintf(errors,
-                     "%s:%d: unbalanced quotes in acl line. ",
-                     server.acl_filename, linenum);
-            continue;
-        }
-
-        /* Skip this line if the resulting command vector is empty. */
-        if (argc == 0) {
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* The line should start with the "user" keyword. */
-        if (strcmp(argv[0],"user") || argc < 2) {
-            errors = sdscatprintf(errors,
-                     "%s:%d should start with user keyword followed "
-                     "by the username. ", server.acl_filename,
-                     linenum);
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* Spaces are not allowed in usernames. */
-        if (ACLStringHasSpaces(argv[1],sdslen(argv[1]))) {
-            errors = sdscatprintf(errors,
-                     "'%s:%d: username '%s' contains invalid characters. ",
-                     server.acl_filename, linenum, argv[1]);
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* Try to process the line using the fake user to validate if
-         * the rules are able to apply cleanly. At this stage we also
-         * trim trailing spaces, so that we don't have to handle that
-         * in ACLSetUser(). */
-        ACLSetUser(fakeuser,"reset",-1);
-        int j;
-        for (j = 2; j < argc; j++) {
-            argv[j] = sdstrim(argv[j],"\t\r\n");
-            if (ACLSetUser(fakeuser,argv[j],sdslen(argv[j])) != C_OK) {
-                const char *errmsg = ACLSetUserStringError();
-                errors = sdscatprintf(errors,
-                         "%s:%d: %s. ",
-                         server.acl_filename, linenum, errmsg);
-                continue;
-            }
-        }
-
-        /* Apply the rule to the new users set only if so far there
-         * are no errors, otherwise it's useless since we are going
-         * to discard the new users set anyway. */
-        if (sdslen(errors) != 0) {
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* We can finally lookup the user and apply the rule. If the
-         * user already exists we always reset it to start. */
-        user *u = ACLCreateUser(argv[1],sdslen(argv[1]));
-        if (!u) {
-            u = ACLGetUserByName(argv[1],sdslen(argv[1]));
-            serverAssert(u != NULL);
-            ACLSetUser(u,"reset",-1);
-        }
-
-        /* Note that the same rules already applied to the fake user, so
-         * we just assert that everything goes well: it should. */
-        for (j = 2; j < argc; j++)
-            serverAssert(ACLSetUser(u,argv[j],sdslen(argv[j])) == C_OK);
-
-        sdsfreesplitres(argv,argc);
-    }
-
-    ACLFreeUser(fakeuser);
-    sdsfreesplitres(lines,totlines);
-    DefaultUser = old_default_user; /* This pointer must never change. */
-
-    /* Check if we found errors and react accordingly. */
-    if (sdslen(errors) == 0) {
-        /* The default user pointer is referenced in different places: instead
-         * of replacing such occurrences it is much simpler to copy the new
-         * default user configuration in the old one. */
-        user *new = ACLGetUserByName("default",7);
-        serverAssert(new != NULL);
-        ACLCopyUser(DefaultUser,new);
-        ACLFreeUser(new);
-        raxInsert(Users,(unsigned char*)"default",7,DefaultUser,NULL);
-        raxRemove(old_users,(unsigned char*)"default",7,NULL);
-        ACLFreeUsersSet(old_users);
-        sdsfree(errors);
-        return NULL;
-    } else {
-        ACLFreeUsersSet(Users);
-        Users = old_users;
-        errors = sdscat(errors,"WARNING: ACL errors detected, no change to the previously active ACL rules was performed");
-        return errors;
-    }
-}
-
-/* Generate a copy of the ACLs currently in memory in the specified filename.
- * Returns C_OK on success or C_ERR if there was an error during the I/O.
- * When C_ERR is returned a log is produced with hints about the issue. */
-int ACLSaveToFile(const char *filename) {
-    sds acl = sdsempty();
-    int fd = -1;
-    sds tmpfilename = NULL;
-    int retval = C_ERR;
-
-    /* Let's generate an SDS string containing the new version of the
-     * ACL file. */
-    raxIterator ri;
-    raxStart(&ri,Users);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        user *u = ri.data;
-        /* Return information in the configuration file format. */
-        sds user = sdsnew("user ");
-        user = sdscatsds(user,u->name);
-        user = sdscatlen(user," ",1);
-        sds descr = ACLDescribeUser(u);
-        user = sdscatsds(user,descr);
-        sdsfree(descr);
-        acl = sdscatsds(acl,user);
-        acl = sdscatlen(acl,"\n",1);
-        sdsfree(user);
-    }
-    raxStop(&ri);
-
-    /* Create a temp file with the new content. */
-    tmpfilename = sdsnew(filename);
-    tmpfilename = sdscatfmt(tmpfilename,".tmp-%i-%I",
-        (int)getpid(),(int)mstime());
-    if ((fd = open(tmpfilename,O_WRONLY|O_CREAT,0644)) == -1) {
-        serverLog(LL_WARNING,"Opening temp ACL file for ACL SAVE: %s",
-            strerror(errno));
-        goto cleanup;
-    }
-
-    /* Write it. */
-    if (write(fd,acl,sdslen(acl)) != (ssize_t)sdslen(acl)) {
-        serverLog(LL_WARNING,"Writing ACL file for ACL SAVE: %s",
-            strerror(errno));
-        goto cleanup;
-    }
-    close(fd); fd = -1;
-
-    /* Let's replace the new file with the old one. */
-    if (rename(tmpfilename,filename) == -1) {
-        serverLog(LL_WARNING,"Renaming ACL file for ACL SAVE: %s",
-            strerror(errno));
-        goto cleanup;
-    }
-    sdsfree(tmpfilename); tmpfilename = NULL;
-    retval = C_OK; /* If we reached this point, everything is fine. */
-
-cleanup:
-    if (fd != -1) close(fd);
-    if (tmpfilename) unlink(tmpfilename);
-    sdsfree(tmpfilename);
-    sdsfree(acl);
-    return retval;
-}
-
-/* This function is called once the server is already running, modules are
- * loaded, and we are ready to start, in order to load the ACLs either from
- * the pending list of users defined in redis.conf, or from the ACL file.
- * The function will just exit with an error if the user is trying to mix
- * both the loading methods. */
-void ACLLoadUsersAtStartup(void) {
-    if (server.acl_filename[0] != '\0' && listLength(UsersToLoad) != 0) {
-        serverLog(LL_WARNING,
-            "Configuring Redis with users defined in redis.conf and at "
-            "the same setting an ACL file path is invalid. This setup "
-            "is very likely to lead to configuration errors and security "
-            "holes, please define either an ACL file or declare users "
-            "directly in your redis.conf, but not both.");
-        exit(1);
-    }
-
-    if (ACLLoadConfiguredUsers() == C_ERR) {
-        serverLog(LL_WARNING,
-            "Critical error while loading ACLs. Exiting.");
-        exit(1);
-    }
-
-    if (server.acl_filename[0] != '\0') {
-        sds errors = ACLLoadFromFile(server.acl_filename);
-        if (errors) {
-            serverLog(LL_WARNING,
-                "Aborting Redis startup because of ACL errors: %s", errors);
-            sdsfree(errors);
-            exit(1);
-        }
-    }
-}
-
-/* =============================================================================
- * ACL log
- * ==========================================================================*/
-
-#define ACL_LOG_CTX_TOPLEVEL 0
-#define ACL_LOG_CTX_LUA 1
-#define ACL_LOG_CTX_MULTI 2
-#define ACL_LOG_GROUPING_MAX_TIME_DELTA 60000
-
-/* This structure defines an entry inside the ACL log. */
-typedef struct ACLLogEntry {
-    uint64_t count;     /* Number of times this happened recently. */
-    int reason;         /* Reason for denying the command. ACL_DENIED_*. */
-    int context;        /* Toplevel, Lua or MULTI/EXEC? ACL_LOG_CTX_*. */
-    sds object;         /* The key name or command name. */
-    sds username;       /* User the client is authenticated with. */
-    mstime_t ctime;     /* Milliseconds time of last update to this entry. */
-    sds cinfo;          /* Client info (last client if updated). */
-} ACLLogEntry;
-
-/* This function will check if ACL entries 'a' and 'b' are similar enough
- * that we should actually update the existing entry in our ACL log instead
- * of creating a new one. */
-int ACLLogMatchEntry(ACLLogEntry *a, ACLLogEntry *b) {
-    if (a->reason != b->reason) return 0;
-    if (a->context != b->context) return 0;
-    mstime_t delta = a->ctime - b->ctime;
-    if (delta < 0) delta = -delta;
-    if (delta > ACL_LOG_GROUPING_MAX_TIME_DELTA) return 0;
-    if (sdscmp(a->object,b->object) != 0) return 0;
-    if (sdscmp(a->username,b->username) != 0) return 0;
-    return 1;
-}
-
-/* Release an ACL log entry. */
-void ACLFreeLogEntry(void *leptr) {
-    ACLLogEntry *le = leptr;
-    sdsfree(le->object);
-    sdsfree(le->username);
-    sdsfree(le->cinfo);
-    zfree(le);
-}
-
-/* Adds a new entry in the ACL log, making sure to delete the old entry
- * if we reach the maximum length allowed for the log. This function attempts
- * to find similar entries in the current log in order to bump the counter of
- * the log entry instead of creating many entries for very similar ACL
- * rules issues.
- *
- * The argpos argument is used when the reason is ACL_DENIED_KEY or 
- * ACL_DENIED_CHANNEL, since it allows the function to log the key or channel
- * name that caused the problem. Similarly the username is only passed when we
- * failed to authenticate the user with AUTH or HELLO, for the ACL_DENIED_AUTH
- * reason. Otherwise it will just be NULL.
- */
-void addACLLogEntry(client *c, int reason, int argpos, sds username) {
-    /* Create a new entry. */
-    struct ACLLogEntry *le = zmalloc(sizeof(*le));
-    le->count = 1;
-    le->reason = reason;
-    le->username = sdsdup(reason == ACL_DENIED_AUTH ? username : c->user->name);
-    le->ctime = mstime();
-
-    switch(reason) {
-    case ACL_DENIED_CMD: le->object = sdsnew(c->cmd->name); break;
-    case ACL_DENIED_KEY: le->object = sdsdup(c->argv[argpos]->ptr); break;
-    case ACL_DENIED_CHANNEL: le->object = sdsdup(c->argv[argpos]->ptr); break;
-    case ACL_DENIED_AUTH: le->object = sdsdup(c->argv[0]->ptr); break;
-    default: le->object = sdsempty();
-    }
-
-    client *realclient = c;
-    if (realclient->flags & CLIENT_LUA) realclient = server.lua_caller;
-
-    le->cinfo = catClientInfoString(sdsempty(),realclient);
-    if (c->flags & CLIENT_MULTI) {
-        le->context = ACL_LOG_CTX_MULTI;
-    } else if (c->flags & CLIENT_LUA) {
-        le->context = ACL_LOG_CTX_LUA;
-    } else {
-        le->context = ACL_LOG_CTX_TOPLEVEL;
-    }
-
-    /* Try to match this entry with past ones, to see if we can just
-     * update an existing entry instead of creating a new one. */
-    long toscan = 10; /* Do a limited work trying to find duplicated. */
-    listIter li;
-    listNode *ln;
-    listRewind(ACLLog,&li);
-    ACLLogEntry *match = NULL;
-    while (toscan-- && (ln = listNext(&li)) != NULL) {
-        ACLLogEntry *current = listNodeValue(ln);
-        if (ACLLogMatchEntry(current,le)) {
-            match = current;
-            listDelNode(ACLLog,ln);
-            listAddNodeHead(ACLLog,current);
-            break;
-        }
-    }
-
-    /* If there is a match update the entry, otherwise add it as a
-     * new one. */
-    if (match) {
-        /* We update a few fields of the existing entry and bump the
-         * counter of events for this entry. */
-        sdsfree(match->cinfo);
-        match->cinfo = le->cinfo;
-        match->ctime = le->ctime;
-        match->count++;
-
-        /* Release the old entry. */
-        le->cinfo = NULL;
-        ACLFreeLogEntry(le);
-    } else {
-        /* Add it to our list of entries. We'll have to trim the list
-         * to its maximum size. */
-        listAddNodeHead(ACLLog, le);
-        while(listLength(ACLLog) > server.acllog_max_len) {
-            listNode *ln = listLast(ACLLog);
-            ACLLogEntry *le = listNodeValue(ln);
-            ACLFreeLogEntry(le);
-            listDelNode(ACLLog,ln);
-        }
-    }
-}
-
-/* =============================================================================
- * ACL related commands
- * ==========================================================================*/
-
-/* ACL -- show and modify the configuration of ACL users.
- * ACL HELP
- * ACL LOAD
- * ACL SAVE
- * ACL LIST
- * ACL USERS
- * ACL CAT [<category>]
- * ACL SETUSER <username> ... acl rules ...
- * ACL DELUSER <username> [...]
- * ACL GETUSER <username>
- * ACL GENPASS [<bits>]
- * ACL WHOAMI
- * ACL LOG [<count> | RESET]
- */
-void aclCommand(client *c) {
-    char *sub = c->argv[1]->ptr;
-    if (!strcasecmp(sub,"setuser") && c->argc >= 3) {
-        sds username = c->argv[2]->ptr;
-        /* Check username validity. */
-        if (ACLStringHasSpaces(username,sdslen(username))) {
-            addReplyErrorFormat(c,
-                "Usernames can't contain spaces or null characters");
-            return;
-        }
-
-        /* Create a temporary user to validate and stage all changes against
-         * before applying to an existing user or creating a new user. If all
-         * arguments are valid the user parameters will all be applied together.
-         * If there are any errors then none of the changes will be applied. */
-        user *tempu = ACLCreateUnlinkedUser();
-        user *u = ACLGetUserByName(username,sdslen(username));
-        if (u) ACLCopyUser(tempu, u);
-
-        /* Initially redact all of the arguments to not leak any information
-         * about the user. */
-        for (int j = 2; j < c->argc; j++) {
-            redactClientCommandArgument(c, j);
-        }
-
-        for (int j = 3; j < c->argc; j++) {
-            if (ACLSetUser(tempu,c->argv[j]->ptr,sdslen(c->argv[j]->ptr)) != C_OK) {
-                const char *errmsg = ACLSetUserStringError();
-                addReplyErrorFormat(c,
-                    "Error in ACL SETUSER modifier '%s': %s",
-                    (char*)c->argv[j]->ptr, errmsg);
-
-                ACLFreeUser(tempu);
-                return;
-            }
-        }
-
-        /* Existing pub/sub clients authenticated with the user may need to be
-         * disconnected if (some of) their channel permissions were revoked. */
-        if (u && !(tempu->flags & USER_FLAG_ALLCHANNELS))
-            ACLKillPubsubClientsIfNeeded(u,tempu->channels);
-
-        /* Overwrite the user with the temporary user we modified above. */
-        if (!u) u = ACLCreateUser(username,sdslen(username));
-        serverAssert(u != NULL);
-        ACLCopyUser(u, tempu);
-        ACLFreeUser(tempu);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(sub,"deluser") && c->argc >= 3) {
-        int deleted = 0;
-        for (int j = 2; j < c->argc; j++) {
-            sds username = c->argv[j]->ptr;
-            if (!strcmp(username,"default")) {
-                addReplyError(c,"The 'default' user cannot be removed");
-                return;
-            }
-        }
-
-        for (int j = 2; j < c->argc; j++) {
-            sds username = c->argv[j]->ptr;
-            user *u;
-            if (raxRemove(Users,(unsigned char*)username,
-                          sdslen(username),
-                          (void**)&u))
-            {
-                ACLFreeUserAndKillClients(u);
-                deleted++;
-            }
-        }
-        addReplyLongLong(c,deleted);
-    } else if (!strcasecmp(sub,"getuser") && c->argc == 3) {
-        user *u = ACLGetUserByName(c->argv[2]->ptr,sdslen(c->argv[2]->ptr));
-        if (u == NULL) {
-            addReplyNull(c);
-            return;
-        }
-
-        addReplyMapLen(c,5);
-
-        /* Flags */
-        addReplyBulkCString(c,"flags");
-        void *deflen = addReplyDeferredLen(c);
-        int numflags = 0;
-        for (int j = 0; ACLUserFlags[j].flag; j++) {
-            if (u->flags & ACLUserFlags[j].flag) {
-                addReplyBulkCString(c,ACLUserFlags[j].name);
-                numflags++;
-            }
-        }
-        setDeferredSetLen(c,deflen,numflags);
-
-        /* Passwords */
-        addReplyBulkCString(c,"passwords");
-        addReplyArrayLen(c,listLength(u->passwords));
-        listIter li;
-        listNode *ln;
-        listRewind(u->passwords,&li);
-        while((ln = listNext(&li))) {
-            sds thispass = listNodeValue(ln);
-            addReplyBulkCBuffer(c,thispass,sdslen(thispass));
-        }
-
-        /* Commands */
-        addReplyBulkCString(c,"commands");
-        sds cmddescr = ACLDescribeUserCommandRules(u);
-        addReplyBulkSds(c,cmddescr);
-
-        /* Key patterns */
-        addReplyBulkCString(c,"keys");
-        if (u->flags & USER_FLAG_ALLKEYS) {
-            addReplyArrayLen(c,1);
-            addReplyBulkCBuffer(c,"*",1);
-        } else {
-            addReplyArrayLen(c,listLength(u->patterns));
-            listIter li;
-            listNode *ln;
-            listRewind(u->patterns,&li);
-            while((ln = listNext(&li))) {
-                sds thispat = listNodeValue(ln);
-                addReplyBulkCBuffer(c,thispat,sdslen(thispat));
-            }
-        }
-
-        /* Pub/sub patterns */
-        addReplyBulkCString(c,"channels");
-        if (u->flags & USER_FLAG_ALLCHANNELS) {
-            addReplyArrayLen(c,1);
-            addReplyBulkCBuffer(c,"*",1);
-        } else {
-            addReplyArrayLen(c,listLength(u->channels));
-            listIter li;
-            listNode *ln;
-            listRewind(u->channels,&li);
-            while((ln = listNext(&li))) {
-                sds thispat = listNodeValue(ln);
-                addReplyBulkCBuffer(c,thispat,sdslen(thispat));
-            }
-        }
-    } else if ((!strcasecmp(sub,"list") || !strcasecmp(sub,"users")) &&
-               c->argc == 2)
-    {
-        int justnames = !strcasecmp(sub,"users");
-        addReplyArrayLen(c,raxSize(Users));
-        raxIterator ri;
-        raxStart(&ri,Users);
-        raxSeek(&ri,"^",NULL,0);
-        while(raxNext(&ri)) {
-            user *u = ri.data;
-            if (justnames) {
-                addReplyBulkCBuffer(c,u->name,sdslen(u->name));
-            } else {
-                /* Return information in the configuration file format. */
-                sds config = sdsnew("user ");
-                config = sdscatsds(config,u->name);
-                config = sdscatlen(config," ",1);
-                sds descr = ACLDescribeUser(u);
-                config = sdscatsds(config,descr);
-                sdsfree(descr);
-                addReplyBulkSds(c,config);
-            }
-        }
-        raxStop(&ri);
-    } else if (!strcasecmp(sub,"whoami") && c->argc == 2) {
-        if (c->user != NULL) {
-            addReplyBulkCBuffer(c,c->user->name,sdslen(c->user->name));
-        } else {
-            addReplyNull(c);
-        }
-    } else if (server.acl_filename[0] == '\0' &&
-               (!strcasecmp(sub,"load") || !strcasecmp(sub,"save")))
-    {
-        addReplyError(c,"This Redis instance is not configured to use an ACL file. You may want to specify users via the ACL SETUSER command and then issue a CONFIG REWRITE (assuming you have a Redis configuration file set) in order to store users in the Redis configuration.");
-        return;
-    } else if (!strcasecmp(sub,"load") && c->argc == 2) {
-        sds errors = ACLLoadFromFile(server.acl_filename);
-        if (errors == NULL) {
-            addReply(c,shared.ok);
-        } else {
-            addReplyError(c,errors);
-            sdsfree(errors);
-        }
-    } else if (!strcasecmp(sub,"save") && c->argc == 2) {
-        if (ACLSaveToFile(server.acl_filename) == C_OK) {
-            addReply(c,shared.ok);
-        } else {
-            addReplyError(c,"There was an error trying to save the ACLs. "
-                            "Please check the server logs for more "
-                            "information");
-        }
-    } else if (!strcasecmp(sub,"cat") && c->argc == 2) {
-        void *dl = addReplyDeferredLen(c);
-        int j;
-        for (j = 0; ACLCommandCategories[j].flag != 0; j++)
-            addReplyBulkCString(c,ACLCommandCategories[j].name);
-        setDeferredArrayLen(c,dl,j);
-    } else if (!strcasecmp(sub,"cat") && c->argc == 3) {
-        uint64_t cflag = ACLGetCommandCategoryFlagByName(c->argv[2]->ptr);
-        if (cflag == 0) {
-            addReplyErrorFormat(c, "Unknown category '%s'", (char*)c->argv[2]->ptr);
-            return;
-        }
-        int arraylen = 0;
-        void *dl = addReplyDeferredLen(c);
-        dictIterator *di = dictGetIterator(server.orig_commands);
-        dictEntry *de;
-        while ((de = dictNext(di)) != NULL) {
-            struct redisCommand *cmd = dictGetVal(de);
-            if (cmd->flags & CMD_MODULE) continue;
-            if (cmd->flags & cflag) {
-                addReplyBulkCString(c,cmd->name);
-                arraylen++;
-            }
-        }
-        dictReleaseIterator(di);
-        setDeferredArrayLen(c,dl,arraylen);
-    } else if (!strcasecmp(sub,"genpass") && (c->argc == 2 || c->argc == 3)) {
-        #define GENPASS_MAX_BITS 4096
-        char pass[GENPASS_MAX_BITS/8*2]; /* Hex representation. */
-        long bits = 256; /* By default generate 256 bits passwords. */
-
-        if (c->argc == 3 && getLongFromObjectOrReply(c,c->argv[2],&bits,NULL)
-            != C_OK) return;
-
-        if (bits <= 0 || bits > GENPASS_MAX_BITS) {
-            addReplyErrorFormat(c,
-                "ACL GENPASS argument must be the number of "
-                "bits for the output password, a positive number "
-                "up to %d",GENPASS_MAX_BITS);
-            return;
-        }
-
-        long chars = (bits+3)/4; /* Round to number of characters to emit. */
-        getRandomHexChars(pass,chars);
-        addReplyBulkCBuffer(c,pass,chars);
-    } else if (!strcasecmp(sub,"log") && (c->argc == 2 || c->argc ==3)) {
-        long count = 10; /* Number of entries to emit by default. */
-
-        /* Parse the only argument that LOG may have: it could be either
-         * the number of entries the user wants to display, or alternatively
-         * the "RESET" command in order to flush the old entries. */
-        if (c->argc == 3) {
-            if (!strcasecmp(c->argv[2]->ptr,"reset")) {
-                listSetFreeMethod(ACLLog,ACLFreeLogEntry);
-                listEmpty(ACLLog);
-                listSetFreeMethod(ACLLog,NULL);
-                addReply(c,shared.ok);
-                return;
-            } else if (getLongFromObjectOrReply(c,c->argv[2],&count,NULL)
-                       != C_OK)
-            {
-                return;
-            }
-            if (count < 0) count = 0;
-        }
-
-        /* Fix the count according to the number of entries we got. */
-        if ((size_t)count > listLength(ACLLog))
-            count = listLength(ACLLog);
-
-        addReplyArrayLen(c,count);
-        listIter li;
-        listNode *ln;
-        listRewind(ACLLog,&li);
-        mstime_t now = mstime();
-        while (count-- && (ln = listNext(&li)) != NULL) {
-            ACLLogEntry *le = listNodeValue(ln);
-            addReplyMapLen(c,7);
-            addReplyBulkCString(c,"count");
-            addReplyLongLong(c,le->count);
-
-            addReplyBulkCString(c,"reason");
-            char *reasonstr;
-            switch(le->reason) {
-            case ACL_DENIED_CMD: reasonstr="command"; break;
-            case ACL_DENIED_KEY: reasonstr="key"; break;
-            case ACL_DENIED_CHANNEL: reasonstr="channel"; break;
-            case ACL_DENIED_AUTH: reasonstr="auth"; break;
-            default: reasonstr="unknown";
-            }
-            addReplyBulkCString(c,reasonstr);
-
-            addReplyBulkCString(c,"context");
-            char *ctxstr;
-            switch(le->context) {
-            case ACL_LOG_CTX_TOPLEVEL: ctxstr="toplevel"; break;
-            case ACL_LOG_CTX_MULTI: ctxstr="multi"; break;
-            case ACL_LOG_CTX_LUA: ctxstr="lua"; break;
-            default: ctxstr="unknown";
-            }
-            addReplyBulkCString(c,ctxstr);
-
-            addReplyBulkCString(c,"object");
-            addReplyBulkCBuffer(c,le->object,sdslen(le->object));
-            addReplyBulkCString(c,"username");
-            addReplyBulkCBuffer(c,le->username,sdslen(le->username));
-            addReplyBulkCString(c,"age-seconds");
-            double age = (double)(now - le->ctime)/1000;
-            addReplyDouble(c,age);
-            addReplyBulkCString(c,"client-info");
-            addReplyBulkCBuffer(c,le->cinfo,sdslen(le->cinfo));
-        }
-    } else if (c->argc == 2 && !strcasecmp(sub,"help")) {
-        const char *help[] = {
-"CAT [<category>]",
-"    List all commands that belong to <category>, or all command categories",
-"    when no category is specified.",
-"DELUSER <username> [<username> ...]",
-"    Delete a list of users.",
-"GETUSER <username>",
-"    Get the user's details.",
-"GENPASS [<bits>]",
-"    Generate a secure 256-bit user password. The optional `bits` argument can",
-"    be used to specify a different size.",
-"LIST",
-"    Show users details in config file format.",
-"LOAD",
-"    Reload users from the ACL file.",
-"LOG [<count> | RESET]",
-"    Show the ACL log entries.",
-"SAVE",
-"    Save the current config to the ACL file.",
-"SETUSER <username> <attribute> [<attribute> ...]",
-"    Create or modify a user with the specified attributes.",
-"USERS",
-"    List all the registered usernames.",
-"WHOAMI",
-"    Return the current connection username.",
-NULL
-        };
-        addReplyHelp(c,help);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-void addReplyCommandCategories(client *c, struct redisCommand *cmd) {
-    int flagcount = 0;
-    void *flaglen = addReplyDeferredLen(c);
-    for (int j = 0; ACLCommandCategories[j].flag != 0; j++) {
-        if (cmd->flags & ACLCommandCategories[j].flag) {
-            addReplyStatusFormat(c, "@%s", ACLCommandCategories[j].name);
-            flagcount++;
-        }
-    }
-    setDeferredSetLen(c, flaglen, flagcount);
-}
-
-/* AUTH <password>
- * AUTH <username> <password> (Redis >= 6.0 form)
- *
- * When the user is omitted it means that we are trying to authenticate
- * against the default user. */
-void authCommand(client *c) {
-    /* Only two or three argument forms are allowed. */
-    if (c->argc > 3) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-    /* Always redact the second argument */
-    redactClientCommandArgument(c, 1);
-
-    /* Handle the two different forms here. The form with two arguments
-     * will just use "default" as username. */
-    robj *username, *password;
-    if (c->argc == 2) {
-        /* Mimic the old behavior of giving an error for the two commands
-         * from if no password is configured. */
-        if (DefaultUser->flags & USER_FLAG_NOPASS) {
-            addReplyError(c,"AUTH <password> called without any password "
-                            "configured for the default user. Are you sure "
-                            "your configuration is correct?");
-            return;
-        }
-
-        username = shared.default_username; 
-        password = c->argv[1];
-    } else {
-        username = c->argv[1];
-        password = c->argv[2];
-        redactClientCommandArgument(c, 2);
-    }
-
-    if (ACLAuthenticateUser(c,username,password) == C_OK) {
-        addReply(c,shared.ok);
-    } else {
-        addReplyError(c,"-WRONGPASS invalid username-password pair or user is disabled.");
-    }
-}
-
-/* Set the password for the "default" ACL user. This implements supports for
- * requirepass config, so passing in NULL will set the user to be nopass. */
-void ACLUpdateDefaultUserPassword(sds password) {
-    ACLSetUser(DefaultUser,"resetpass",-1);
-    if (password) {
-        sds aclop = sdscatlen(sdsnew(">"), password, sdslen(password));
-        ACLSetUser(DefaultUser,aclop,sdslen(aclop));
-        sdsfree(aclop);
-    } else {
-        ACLSetUser(DefaultUser,"nopass",-1);
-    }
-}
diff --git a/redis-stable/src/adlist.c b/redis-stable/src/adlist.c
deleted file mode 100644
index 7670b2c1..00000000
--- a/redis-stable/src/adlist.c
+++ /dev/null
@@ -1,378 +0,0 @@
-/* adlist.c - A generic doubly linked list implementation
- *
- * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <stdlib.h>
-#include "adlist.h"
-#include "zmalloc.h"
-
-/* Create a new list. The created list can be freed with
- * listRelease(), but private value of every node need to be freed
- * by the user before to call listRelease(), or by setting a free method using
- * listSetFreeMethod.
- *
- * On error, NULL is returned. Otherwise the pointer to the new list. */
-list *listCreate(void)
-{
-    struct list *list;
-
-    if ((list = zmalloc(sizeof(*list))) == NULL)
-        return NULL;
-    list->head = list->tail = NULL;
-    list->len = 0;
-    list->dup = NULL;
-    list->free = NULL;
-    list->match = NULL;
-    return list;
-}
-
-/* Remove all the elements from the list without destroying the list itself. */
-void listEmpty(list *list)
-{
-    unsigned long len;
-    listNode *current, *next;
-
-    current = list->head;
-    len = list->len;
-    while(len--) {
-        next = current->next;
-        if (list->free) list->free(current->value);
-        zfree(current);
-        current = next;
-    }
-    list->head = list->tail = NULL;
-    list->len = 0;
-}
-
-/* Free the whole list.
- *
- * This function can't fail. */
-void listRelease(list *list)
-{
-    listEmpty(list);
-    zfree(list);
-}
-
-/* Add a new node to the list, to head, containing the specified 'value'
- * pointer as value.
- *
- * On error, NULL is returned and no operation is performed (i.e. the
- * list remains unaltered).
- * On success the 'list' pointer you pass to the function is returned. */
-list *listAddNodeHead(list *list, void *value)
-{
-    listNode *node;
-
-    if ((node = zmalloc(sizeof(*node))) == NULL)
-        return NULL;
-    node->value = value;
-    if (list->len == 0) {
-        list->head = list->tail = node;
-        node->prev = node->next = NULL;
-    } else {
-        node->prev = NULL;
-        node->next = list->head;
-        list->head->prev = node;
-        list->head = node;
-    }
-    list->len++;
-    return list;
-}
-
-/* Add a new node to the list, to tail, containing the specified 'value'
- * pointer as value.
- *
- * On error, NULL is returned and no operation is performed (i.e. the
- * list remains unaltered).
- * On success the 'list' pointer you pass to the function is returned. */
-list *listAddNodeTail(list *list, void *value)
-{
-    listNode *node;
-
-    if ((node = zmalloc(sizeof(*node))) == NULL)
-        return NULL;
-    node->value = value;
-    if (list->len == 0) {
-        list->head = list->tail = node;
-        node->prev = node->next = NULL;
-    } else {
-        node->prev = list->tail;
-        node->next = NULL;
-        list->tail->next = node;
-        list->tail = node;
-    }
-    list->len++;
-    return list;
-}
-
-list *listInsertNode(list *list, listNode *old_node, void *value, int after) {
-    listNode *node;
-
-    if ((node = zmalloc(sizeof(*node))) == NULL)
-        return NULL;
-    node->value = value;
-    if (after) {
-        node->prev = old_node;
-        node->next = old_node->next;
-        if (list->tail == old_node) {
-            list->tail = node;
-        }
-    } else {
-        node->next = old_node;
-        node->prev = old_node->prev;
-        if (list->head == old_node) {
-            list->head = node;
-        }
-    }
-    if (node->prev != NULL) {
-        node->prev->next = node;
-    }
-    if (node->next != NULL) {
-        node->next->prev = node;
-    }
-    list->len++;
-    return list;
-}
-
-/* Remove the specified node from the specified list.
- * It's up to the caller to free the private value of the node.
- *
- * This function can't fail. */
-void listDelNode(list *list, listNode *node)
-{
-    if (node->prev)
-        node->prev->next = node->next;
-    else
-        list->head = node->next;
-    if (node->next)
-        node->next->prev = node->prev;
-    else
-        list->tail = node->prev;
-    if (list->free) list->free(node->value);
-    zfree(node);
-    list->len--;
-}
-
-/* Returns a list iterator 'iter'. After the initialization every
- * call to listNext() will return the next element of the list.
- *
- * This function can't fail. */
-listIter *listGetIterator(list *list, int direction)
-{
-    listIter *iter;
-
-    if ((iter = zmalloc(sizeof(*iter))) == NULL) return NULL;
-    if (direction == AL_START_HEAD)
-        iter->next = list->head;
-    else
-        iter->next = list->tail;
-    iter->direction = direction;
-    return iter;
-}
-
-/* Release the iterator memory */
-void listReleaseIterator(listIter *iter) {
-    zfree(iter);
-}
-
-/* Create an iterator in the list private iterator structure */
-void listRewind(list *list, listIter *li) {
-    li->next = list->head;
-    li->direction = AL_START_HEAD;
-}
-
-void listRewindTail(list *list, listIter *li) {
-    li->next = list->tail;
-    li->direction = AL_START_TAIL;
-}
-
-/* Return the next element of an iterator.
- * It's valid to remove the currently returned element using
- * listDelNode(), but not to remove other elements.
- *
- * The function returns a pointer to the next element of the list,
- * or NULL if there are no more elements, so the classical usage
- * pattern is:
- *
- * iter = listGetIterator(list,<direction>);
- * while ((node = listNext(iter)) != NULL) {
- *     doSomethingWith(listNodeValue(node));
- * }
- *
- * */
-listNode *listNext(listIter *iter)
-{
-    listNode *current = iter->next;
-
-    if (current != NULL) {
-        if (iter->direction == AL_START_HEAD)
-            iter->next = current->next;
-        else
-            iter->next = current->prev;
-    }
-    return current;
-}
-
-/* Duplicate the whole list. On out of memory NULL is returned.
- * On success a copy of the original list is returned.
- *
- * The 'Dup' method set with listSetDupMethod() function is used
- * to copy the node value. Otherwise the same pointer value of
- * the original node is used as value of the copied node.
- *
- * The original list both on success or error is never modified. */
-list *listDup(list *orig)
-{
-    list *copy;
-    listIter iter;
-    listNode *node;
-
-    if ((copy = listCreate()) == NULL)
-        return NULL;
-    copy->dup = orig->dup;
-    copy->free = orig->free;
-    copy->match = orig->match;
-    listRewind(orig, &iter);
-    while((node = listNext(&iter)) != NULL) {
-        void *value;
-
-        if (copy->dup) {
-            value = copy->dup(node->value);
-            if (value == NULL) {
-                listRelease(copy);
-                return NULL;
-            }
-        } else
-            value = node->value;
-        if (listAddNodeTail(copy, value) == NULL) {
-            listRelease(copy);
-            return NULL;
-        }
-    }
-    return copy;
-}
-
-/* Search the list for a node matching a given key.
- * The match is performed using the 'match' method
- * set with listSetMatchMethod(). If no 'match' method
- * is set, the 'value' pointer of every node is directly
- * compared with the 'key' pointer.
- *
- * On success the first matching node pointer is returned
- * (search starts from head). If no matching node exists
- * NULL is returned. */
-listNode *listSearchKey(list *list, void *key)
-{
-    listIter iter;
-    listNode *node;
-
-    listRewind(list, &iter);
-    while((node = listNext(&iter)) != NULL) {
-        if (list->match) {
-            if (list->match(node->value, key)) {
-                return node;
-            }
-        } else {
-            if (key == node->value) {
-                return node;
-            }
-        }
-    }
-    return NULL;
-}
-
-/* Return the element at the specified zero-based index
- * where 0 is the head, 1 is the element next to head
- * and so on. Negative integers are used in order to count
- * from the tail, -1 is the last element, -2 the penultimate
- * and so on. If the index is out of range NULL is returned. */
-listNode *listIndex(list *list, long index) {
-    listNode *n;
-
-    if (index < 0) {
-        index = (-index)-1;
-        n = list->tail;
-        while(index-- && n) n = n->prev;
-    } else {
-        n = list->head;
-        while(index-- && n) n = n->next;
-    }
-    return n;
-}
-
-/* Rotate the list removing the tail node and inserting it to the head. */
-void listRotateTailToHead(list *list) {
-    if (listLength(list) <= 1) return;
-
-    /* Detach current tail */
-    listNode *tail = list->tail;
-    list->tail = tail->prev;
-    list->tail->next = NULL;
-    /* Move it as head */
-    list->head->prev = tail;
-    tail->prev = NULL;
-    tail->next = list->head;
-    list->head = tail;
-}
-
-/* Rotate the list removing the head node and inserting it to the tail. */
-void listRotateHeadToTail(list *list) {
-    if (listLength(list) <= 1) return;
-
-    listNode *head = list->head;
-    /* Detach current head */
-    list->head = head->next;
-    list->head->prev = NULL;
-    /* Move it as tail */
-    list->tail->next = head;
-    head->next = NULL;
-    head->prev = list->tail;
-    list->tail = head;
-}
-
-/* Add all the elements of the list 'o' at the end of the
- * list 'l'. The list 'other' remains empty but otherwise valid. */
-void listJoin(list *l, list *o) {
-    if (o->len == 0) return;
-
-    o->head->prev = l->tail;
-
-    if (l->tail)
-        l->tail->next = o->head;
-    else
-        l->head = o->head;
-
-    l->tail = o->tail;
-    l->len += o->len;
-
-    /* Setup other as an empty list. */
-    o->head = o->tail = NULL;
-    o->len = 0;
-}
diff --git a/redis-stable/src/adlist.h b/redis-stable/src/adlist.h
deleted file mode 100644
index dd8a8d69..00000000
--- a/redis-stable/src/adlist.h
+++ /dev/null
@@ -1,96 +0,0 @@
-/* adlist.h - A generic doubly linked list implementation
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __ADLIST_H__
-#define __ADLIST_H__
-
-/* Node, List, and Iterator are the only data structures used currently. */
-
-typedef struct listNode {
-    struct listNode *prev;
-    struct listNode *next;
-    void *value;
-} listNode;
-
-typedef struct listIter {
-    listNode *next;
-    int direction;
-} listIter;
-
-typedef struct list {
-    listNode *head;
-    listNode *tail;
-    void *(*dup)(void *ptr);
-    void (*free)(void *ptr);
-    int (*match)(void *ptr, void *key);
-    unsigned long len;
-} list;
-
-/* Functions implemented as macros */
-#define listLength(l) ((l)->len)
-#define listFirst(l) ((l)->head)
-#define listLast(l) ((l)->tail)
-#define listPrevNode(n) ((n)->prev)
-#define listNextNode(n) ((n)->next)
-#define listNodeValue(n) ((n)->value)
-
-#define listSetDupMethod(l,m) ((l)->dup = (m))
-#define listSetFreeMethod(l,m) ((l)->free = (m))
-#define listSetMatchMethod(l,m) ((l)->match = (m))
-
-#define listGetDupMethod(l) ((l)->dup)
-#define listGetFreeMethod(l) ((l)->free)
-#define listGetMatchMethod(l) ((l)->match)
-
-/* Prototypes */
-list *listCreate(void);
-void listRelease(list *list);
-void listEmpty(list *list);
-list *listAddNodeHead(list *list, void *value);
-list *listAddNodeTail(list *list, void *value);
-list *listInsertNode(list *list, listNode *old_node, void *value, int after);
-void listDelNode(list *list, listNode *node);
-listIter *listGetIterator(list *list, int direction);
-listNode *listNext(listIter *iter);
-void listReleaseIterator(listIter *iter);
-list *listDup(list *orig);
-listNode *listSearchKey(list *list, void *key);
-listNode *listIndex(list *list, long index);
-void listRewind(list *list, listIter *li);
-void listRewindTail(list *list, listIter *li);
-void listRotateTailToHead(list *list);
-void listRotateHeadToTail(list *list);
-void listJoin(list *l, list *o);
-
-/* Directions for iterators */
-#define AL_START_HEAD 0
-#define AL_START_TAIL 1
-
-#endif /* __ADLIST_H__ */
diff --git a/redis-stable/src/ae.c b/redis-stable/src/ae.c
deleted file mode 100644
index 48fb63ed..00000000
--- a/redis-stable/src/ae.c
+++ /dev/null
@@ -1,503 +0,0 @@
-/* A simple event-driven programming library. Originally I wrote this code
- * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated
- * it in form of a library for easy reuse.
- *
- * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "ae.h"
-#include "anet.h"
-
-#include <stdio.h>
-#include <sys/time.h>
-#include <sys/types.h>
-#include <unistd.h>
-#include <stdlib.h>
-#include <poll.h>
-#include <string.h>
-#include <time.h>
-#include <errno.h>
-
-#include "zmalloc.h"
-#include "config.h"
-
-/* Include the best multiplexing layer supported by this system.
- * The following should be ordered by performances, descending. */
-#ifdef HAVE_EVPORT
-#include "ae_evport.c"
-#else
-    #ifdef HAVE_EPOLL
-    #include "ae_epoll.c"
-    #else
-        #ifdef HAVE_KQUEUE
-        #include "ae_kqueue.c"
-        #else
-        #include "ae_select.c"
-        #endif
-    #endif
-#endif
-
-
-aeEventLoop *aeCreateEventLoop(int setsize) {
-    aeEventLoop *eventLoop;
-    int i;
-
-    monotonicInit();    /* just in case the calling app didn't initialize */
-
-    if ((eventLoop = zmalloc(sizeof(*eventLoop))) == NULL) goto err;
-    eventLoop->events = zmalloc(sizeof(aeFileEvent)*setsize);
-    eventLoop->fired = zmalloc(sizeof(aeFiredEvent)*setsize);
-    if (eventLoop->events == NULL || eventLoop->fired == NULL) goto err;
-    eventLoop->setsize = setsize;
-    eventLoop->timeEventHead = NULL;
-    eventLoop->timeEventNextId = 0;
-    eventLoop->stop = 0;
-    eventLoop->maxfd = -1;
-    eventLoop->beforesleep = NULL;
-    eventLoop->aftersleep = NULL;
-    eventLoop->flags = 0;
-    if (aeApiCreate(eventLoop) == -1) goto err;
-    /* Events with mask == AE_NONE are not set. So let's initialize the
-     * vector with it. */
-    for (i = 0; i < setsize; i++)
-        eventLoop->events[i].mask = AE_NONE;
-    return eventLoop;
-
-err:
-    if (eventLoop) {
-        zfree(eventLoop->events);
-        zfree(eventLoop->fired);
-        zfree(eventLoop);
-    }
-    return NULL;
-}
-
-/* Return the current set size. */
-int aeGetSetSize(aeEventLoop *eventLoop) {
-    return eventLoop->setsize;
-}
-
-/* Tells the next iteration/s of the event processing to set timeout of 0. */
-void aeSetDontWait(aeEventLoop *eventLoop, int noWait) {
-    if (noWait)
-        eventLoop->flags |= AE_DONT_WAIT;
-    else
-        eventLoop->flags &= ~AE_DONT_WAIT;
-}
-
-/* Resize the maximum set size of the event loop.
- * If the requested set size is smaller than the current set size, but
- * there is already a file descriptor in use that is >= the requested
- * set size minus one, AE_ERR is returned and the operation is not
- * performed at all.
- *
- * Otherwise AE_OK is returned and the operation is successful. */
-int aeResizeSetSize(aeEventLoop *eventLoop, int setsize) {
-    int i;
-
-    if (setsize == eventLoop->setsize) return AE_OK;
-    if (eventLoop->maxfd >= setsize) return AE_ERR;
-    if (aeApiResize(eventLoop,setsize) == -1) return AE_ERR;
-
-    eventLoop->events = zrealloc(eventLoop->events,sizeof(aeFileEvent)*setsize);
-    eventLoop->fired = zrealloc(eventLoop->fired,sizeof(aeFiredEvent)*setsize);
-    eventLoop->setsize = setsize;
-
-    /* Make sure that if we created new slots, they are initialized with
-     * an AE_NONE mask. */
-    for (i = eventLoop->maxfd+1; i < setsize; i++)
-        eventLoop->events[i].mask = AE_NONE;
-    return AE_OK;
-}
-
-void aeDeleteEventLoop(aeEventLoop *eventLoop) {
-    aeApiFree(eventLoop);
-    zfree(eventLoop->events);
-    zfree(eventLoop->fired);
-
-    /* Free the time events list. */
-    aeTimeEvent *next_te, *te = eventLoop->timeEventHead;
-    while (te) {
-        next_te = te->next;
-        zfree(te);
-        te = next_te;
-    }
-    zfree(eventLoop);
-}
-
-void aeStop(aeEventLoop *eventLoop) {
-    eventLoop->stop = 1;
-}
-
-int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,
-        aeFileProc *proc, void *clientData)
-{
-    if (fd >= eventLoop->setsize) {
-        errno = ERANGE;
-        return AE_ERR;
-    }
-    aeFileEvent *fe = &eventLoop->events[fd];
-
-    if (aeApiAddEvent(eventLoop, fd, mask) == -1)
-        return AE_ERR;
-    fe->mask |= mask;
-    if (mask & AE_READABLE) fe->rfileProc = proc;
-    if (mask & AE_WRITABLE) fe->wfileProc = proc;
-    fe->clientData = clientData;
-    if (fd > eventLoop->maxfd)
-        eventLoop->maxfd = fd;
-    return AE_OK;
-}
-
-void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask)
-{
-    if (fd >= eventLoop->setsize) return;
-    aeFileEvent *fe = &eventLoop->events[fd];
-    if (fe->mask == AE_NONE) return;
-
-    /* We want to always remove AE_BARRIER if set when AE_WRITABLE
-     * is removed. */
-    if (mask & AE_WRITABLE) mask |= AE_BARRIER;
-
-    aeApiDelEvent(eventLoop, fd, mask);
-    fe->mask = fe->mask & (~mask);
-    if (fd == eventLoop->maxfd && fe->mask == AE_NONE) {
-        /* Update the max fd */
-        int j;
-
-        for (j = eventLoop->maxfd-1; j >= 0; j--)
-            if (eventLoop->events[j].mask != AE_NONE) break;
-        eventLoop->maxfd = j;
-    }
-}
-
-int aeGetFileEvents(aeEventLoop *eventLoop, int fd) {
-    if (fd >= eventLoop->setsize) return 0;
-    aeFileEvent *fe = &eventLoop->events[fd];
-
-    return fe->mask;
-}
-
-long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
-        aeTimeProc *proc, void *clientData,
-        aeEventFinalizerProc *finalizerProc)
-{
-    long long id = eventLoop->timeEventNextId++;
-    aeTimeEvent *te;
-
-    te = zmalloc(sizeof(*te));
-    if (te == NULL) return AE_ERR;
-    te->id = id;
-    te->when = getMonotonicUs() + milliseconds * 1000;
-    te->timeProc = proc;
-    te->finalizerProc = finalizerProc;
-    te->clientData = clientData;
-    te->prev = NULL;
-    te->next = eventLoop->timeEventHead;
-    te->refcount = 0;
-    if (te->next)
-        te->next->prev = te;
-    eventLoop->timeEventHead = te;
-    return id;
-}
-
-int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id)
-{
-    aeTimeEvent *te = eventLoop->timeEventHead;
-    while(te) {
-        if (te->id == id) {
-            te->id = AE_DELETED_EVENT_ID;
-            return AE_OK;
-        }
-        te = te->next;
-    }
-    return AE_ERR; /* NO event with the specified ID found */
-}
-
-/* How many microseconds until the first timer should fire.
- * If there are no timers, -1 is returned.
- *
- * Note that's O(N) since time events are unsorted.
- * Possible optimizations (not needed by Redis so far, but...):
- * 1) Insert the event in order, so that the nearest is just the head.
- *    Much better but still insertion or deletion of timers is O(N).
- * 2) Use a skiplist to have this operation as O(1) and insertion as O(log(N)).
- */
-static int64_t usUntilEarliestTimer(aeEventLoop *eventLoop) {
-    aeTimeEvent *te = eventLoop->timeEventHead;
-    if (te == NULL) return -1;
-
-    aeTimeEvent *earliest = NULL;
-    while (te) {
-        if (!earliest || te->when < earliest->when)
-            earliest = te;
-        te = te->next;
-    }
-
-    monotime now = getMonotonicUs();
-    return (now >= earliest->when) ? 0 : earliest->when - now;
-}
-
-/* Process time events */
-static int processTimeEvents(aeEventLoop *eventLoop) {
-    int processed = 0;
-    aeTimeEvent *te;
-    long long maxId;
-
-    te = eventLoop->timeEventHead;
-    maxId = eventLoop->timeEventNextId-1;
-    monotime now = getMonotonicUs();
-    while(te) {
-        long long id;
-
-        /* Remove events scheduled for deletion. */
-        if (te->id == AE_DELETED_EVENT_ID) {
-            aeTimeEvent *next = te->next;
-            /* If a reference exists for this timer event,
-             * don't free it. This is currently incremented
-             * for recursive timerProc calls */
-            if (te->refcount) {
-                te = next;
-                continue;
-            }
-            if (te->prev)
-                te->prev->next = te->next;
-            else
-                eventLoop->timeEventHead = te->next;
-            if (te->next)
-                te->next->prev = te->prev;
-            if (te->finalizerProc) {
-                te->finalizerProc(eventLoop, te->clientData);
-                now = getMonotonicUs();
-            }
-            zfree(te);
-            te = next;
-            continue;
-        }
-
-        /* Make sure we don't process time events created by time events in
-         * this iteration. Note that this check is currently useless: we always
-         * add new timers on the head, however if we change the implementation
-         * detail, this check may be useful again: we keep it here for future
-         * defense. */
-        if (te->id > maxId) {
-            te = te->next;
-            continue;
-        }
-
-        if (te->when <= now) {
-            int retval;
-
-            id = te->id;
-            te->refcount++;
-            retval = te->timeProc(eventLoop, id, te->clientData);
-            te->refcount--;
-            processed++;
-            now = getMonotonicUs();
-            if (retval != AE_NOMORE) {
-                te->when = now + retval * 1000;
-            } else {
-                te->id = AE_DELETED_EVENT_ID;
-            }
-        }
-        te = te->next;
-    }
-    return processed;
-}
-
-/* Process every pending time event, then every pending file event
- * (that may be registered by time event callbacks just processed).
- * Without special flags the function sleeps until some file event
- * fires, or when the next time event occurs (if any).
- *
- * If flags is 0, the function does nothing and returns.
- * if flags has AE_ALL_EVENTS set, all the kind of events are processed.
- * if flags has AE_FILE_EVENTS set, file events are processed.
- * if flags has AE_TIME_EVENTS set, time events are processed.
- * if flags has AE_DONT_WAIT set the function returns ASAP until all
- * the events that's possible to process without to wait are processed.
- * if flags has AE_CALL_AFTER_SLEEP set, the aftersleep callback is called.
- * if flags has AE_CALL_BEFORE_SLEEP set, the beforesleep callback is called.
- *
- * The function returns the number of events processed. */
-int aeProcessEvents(aeEventLoop *eventLoop, int flags)
-{
-    int processed = 0, numevents;
-
-    /* Nothing to do? return ASAP */
-    if (!(flags & AE_TIME_EVENTS) && !(flags & AE_FILE_EVENTS)) return 0;
-
-    /* Note that we want to call select() even if there are no
-     * file events to process as long as we want to process time
-     * events, in order to sleep until the next time event is ready
-     * to fire. */
-    if (eventLoop->maxfd != -1 ||
-        ((flags & AE_TIME_EVENTS) && !(flags & AE_DONT_WAIT))) {
-        int j;
-        struct timeval tv, *tvp;
-        int64_t usUntilTimer = -1;
-
-        if (flags & AE_TIME_EVENTS && !(flags & AE_DONT_WAIT))
-            usUntilTimer = usUntilEarliestTimer(eventLoop);
-
-        if (usUntilTimer >= 0) {
-            tv.tv_sec = usUntilTimer / 1000000;
-            tv.tv_usec = usUntilTimer % 1000000;
-            tvp = &tv;
-        } else {
-            /* If we have to check for events but need to return
-             * ASAP because of AE_DONT_WAIT we need to set the timeout
-             * to zero */
-            if (flags & AE_DONT_WAIT) {
-                tv.tv_sec = tv.tv_usec = 0;
-                tvp = &tv;
-            } else {
-                /* Otherwise we can block */
-                tvp = NULL; /* wait forever */
-            }
-        }
-
-        if (eventLoop->flags & AE_DONT_WAIT) {
-            tv.tv_sec = tv.tv_usec = 0;
-            tvp = &tv;
-        }
-
-        if (eventLoop->beforesleep != NULL && flags & AE_CALL_BEFORE_SLEEP)
-            eventLoop->beforesleep(eventLoop);
-
-        /* Call the multiplexing API, will return only on timeout or when
-         * some event fires. */
-        numevents = aeApiPoll(eventLoop, tvp);
-
-        /* After sleep callback. */
-        if (eventLoop->aftersleep != NULL && flags & AE_CALL_AFTER_SLEEP)
-            eventLoop->aftersleep(eventLoop);
-
-        for (j = 0; j < numevents; j++) {
-            aeFileEvent *fe = &eventLoop->events[eventLoop->fired[j].fd];
-            int mask = eventLoop->fired[j].mask;
-            int fd = eventLoop->fired[j].fd;
-            int fired = 0; /* Number of events fired for current fd. */
-
-            /* Normally we execute the readable event first, and the writable
-             * event later. This is useful as sometimes we may be able
-             * to serve the reply of a query immediately after processing the
-             * query.
-             *
-             * However if AE_BARRIER is set in the mask, our application is
-             * asking us to do the reverse: never fire the writable event
-             * after the readable. In such a case, we invert the calls.
-             * This is useful when, for instance, we want to do things
-             * in the beforeSleep() hook, like fsyncing a file to disk,
-             * before replying to a client. */
-            int invert = fe->mask & AE_BARRIER;
-
-            /* Note the "fe->mask & mask & ..." code: maybe an already
-             * processed event removed an element that fired and we still
-             * didn't processed, so we check if the event is still valid.
-             *
-             * Fire the readable event if the call sequence is not
-             * inverted. */
-            if (!invert && fe->mask & mask & AE_READABLE) {
-                fe->rfileProc(eventLoop,fd,fe->clientData,mask);
-                fired++;
-                fe = &eventLoop->events[fd]; /* Refresh in case of resize. */
-            }
-
-            /* Fire the writable event. */
-            if (fe->mask & mask & AE_WRITABLE) {
-                if (!fired || fe->wfileProc != fe->rfileProc) {
-                    fe->wfileProc(eventLoop,fd,fe->clientData,mask);
-                    fired++;
-                }
-            }
-
-            /* If we have to invert the call, fire the readable event now
-             * after the writable one. */
-            if (invert) {
-                fe = &eventLoop->events[fd]; /* Refresh in case of resize. */
-                if ((fe->mask & mask & AE_READABLE) &&
-                    (!fired || fe->wfileProc != fe->rfileProc))
-                {
-                    fe->rfileProc(eventLoop,fd,fe->clientData,mask);
-                    fired++;
-                }
-            }
-
-            processed++;
-        }
-    }
-    /* Check time events */
-    if (flags & AE_TIME_EVENTS)
-        processed += processTimeEvents(eventLoop);
-
-    return processed; /* return the number of processed file/time events */
-}
-
-/* Wait for milliseconds until the given file descriptor becomes
- * writable/readable/exception */
-int aeWait(int fd, int mask, long long milliseconds) {
-    struct pollfd pfd;
-    int retmask = 0, retval;
-
-    memset(&pfd, 0, sizeof(pfd));
-    pfd.fd = fd;
-    if (mask & AE_READABLE) pfd.events |= POLLIN;
-    if (mask & AE_WRITABLE) pfd.events |= POLLOUT;
-
-    if ((retval = poll(&pfd, 1, milliseconds))== 1) {
-        if (pfd.revents & POLLIN) retmask |= AE_READABLE;
-        if (pfd.revents & POLLOUT) retmask |= AE_WRITABLE;
-        if (pfd.revents & POLLERR) retmask |= AE_WRITABLE;
-        if (pfd.revents & POLLHUP) retmask |= AE_WRITABLE;
-        return retmask;
-    } else {
-        return retval;
-    }
-}
-
-void aeMain(aeEventLoop *eventLoop) {
-    eventLoop->stop = 0;
-    while (!eventLoop->stop) {
-        aeProcessEvents(eventLoop, AE_ALL_EVENTS|
-                                   AE_CALL_BEFORE_SLEEP|
-                                   AE_CALL_AFTER_SLEEP);
-    }
-}
-
-char *aeGetApiName(void) {
-    return aeApiName();
-}
-
-void aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep) {
-    eventLoop->beforesleep = beforesleep;
-}
-
-void aeSetAfterSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *aftersleep) {
-    eventLoop->aftersleep = aftersleep;
-}
diff --git a/redis-stable/src/ae.h b/redis-stable/src/ae.h
deleted file mode 100644
index 4a1edb68..00000000
--- a/redis-stable/src/ae.h
+++ /dev/null
@@ -1,135 +0,0 @@
-/* A simple event-driven programming library. Originally I wrote this code
- * for the Jim's event-loop (Jim is a Tcl interpreter) but later translated
- * it in form of a library for easy reuse.
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __AE_H__
-#define __AE_H__
-
-#include "monotonic.h"
-
-#define AE_OK 0
-#define AE_ERR -1
-
-#define AE_NONE 0       /* No events registered. */
-#define AE_READABLE 1   /* Fire when descriptor is readable. */
-#define AE_WRITABLE 2   /* Fire when descriptor is writable. */
-#define AE_BARRIER 4    /* With WRITABLE, never fire the event if the
-                           READABLE event already fired in the same event
-                           loop iteration. Useful when you want to persist
-                           things to disk before sending replies, and want
-                           to do that in a group fashion. */
-
-#define AE_FILE_EVENTS (1<<0)
-#define AE_TIME_EVENTS (1<<1)
-#define AE_ALL_EVENTS (AE_FILE_EVENTS|AE_TIME_EVENTS)
-#define AE_DONT_WAIT (1<<2)
-#define AE_CALL_BEFORE_SLEEP (1<<3)
-#define AE_CALL_AFTER_SLEEP (1<<4)
-
-#define AE_NOMORE -1
-#define AE_DELETED_EVENT_ID -1
-
-/* Macros */
-#define AE_NOTUSED(V) ((void) V)
-
-struct aeEventLoop;
-
-/* Types and data structures */
-typedef void aeFileProc(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask);
-typedef int aeTimeProc(struct aeEventLoop *eventLoop, long long id, void *clientData);
-typedef void aeEventFinalizerProc(struct aeEventLoop *eventLoop, void *clientData);
-typedef void aeBeforeSleepProc(struct aeEventLoop *eventLoop);
-
-/* File event structure */
-typedef struct aeFileEvent {
-    int mask; /* one of AE_(READABLE|WRITABLE|BARRIER) */
-    aeFileProc *rfileProc;
-    aeFileProc *wfileProc;
-    void *clientData;
-} aeFileEvent;
-
-/* Time event structure */
-typedef struct aeTimeEvent {
-    long long id; /* time event identifier. */
-    monotime when;
-    aeTimeProc *timeProc;
-    aeEventFinalizerProc *finalizerProc;
-    void *clientData;
-    struct aeTimeEvent *prev;
-    struct aeTimeEvent *next;
-    int refcount; /* refcount to prevent timer events from being
-  		   * freed in recursive time event calls. */
-} aeTimeEvent;
-
-/* A fired event */
-typedef struct aeFiredEvent {
-    int fd;
-    int mask;
-} aeFiredEvent;
-
-/* State of an event based program */
-typedef struct aeEventLoop {
-    int maxfd;   /* highest file descriptor currently registered */
-    int setsize; /* max number of file descriptors tracked */
-    long long timeEventNextId;
-    aeFileEvent *events; /* Registered events */
-    aeFiredEvent *fired; /* Fired events */
-    aeTimeEvent *timeEventHead;
-    int stop;
-    void *apidata; /* This is used for polling API specific data */
-    aeBeforeSleepProc *beforesleep;
-    aeBeforeSleepProc *aftersleep;
-    int flags;
-} aeEventLoop;
-
-/* Prototypes */
-aeEventLoop *aeCreateEventLoop(int setsize);
-void aeDeleteEventLoop(aeEventLoop *eventLoop);
-void aeStop(aeEventLoop *eventLoop);
-int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,
-        aeFileProc *proc, void *clientData);
-void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask);
-int aeGetFileEvents(aeEventLoop *eventLoop, int fd);
-long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
-        aeTimeProc *proc, void *clientData,
-        aeEventFinalizerProc *finalizerProc);
-int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id);
-int aeProcessEvents(aeEventLoop *eventLoop, int flags);
-int aeWait(int fd, int mask, long long milliseconds);
-void aeMain(aeEventLoop *eventLoop);
-char *aeGetApiName(void);
-void aeSetBeforeSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *beforesleep);
-void aeSetAfterSleepProc(aeEventLoop *eventLoop, aeBeforeSleepProc *aftersleep);
-int aeGetSetSize(aeEventLoop *eventLoop);
-int aeResizeSetSize(aeEventLoop *eventLoop, int setsize);
-void aeSetDontWait(aeEventLoop *eventLoop, int noWait);
-
-#endif
diff --git a/redis-stable/src/ae_epoll.c b/redis-stable/src/ae_epoll.c
deleted file mode 100644
index 023c93a1..00000000
--- a/redis-stable/src/ae_epoll.c
+++ /dev/null
@@ -1,136 +0,0 @@
-/* Linux epoll(2) based ae.c module
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <sys/epoll.h>
-
-typedef struct aeApiState {
-    int epfd;
-    struct epoll_event *events;
-} aeApiState;
-
-static int aeApiCreate(aeEventLoop *eventLoop) {
-    aeApiState *state = zmalloc(sizeof(aeApiState));
-
-    if (!state) return -1;
-    state->events = zmalloc(sizeof(struct epoll_event)*eventLoop->setsize);
-    if (!state->events) {
-        zfree(state);
-        return -1;
-    }
-    state->epfd = epoll_create(1024); /* 1024 is just a hint for the kernel */
-    if (state->epfd == -1) {
-        zfree(state->events);
-        zfree(state);
-        return -1;
-    }
-    anetCloexec(state->epfd);
-    eventLoop->apidata = state;
-    return 0;
-}
-
-static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
-    aeApiState *state = eventLoop->apidata;
-
-    state->events = zrealloc(state->events, sizeof(struct epoll_event)*setsize);
-    return 0;
-}
-
-static void aeApiFree(aeEventLoop *eventLoop) {
-    aeApiState *state = eventLoop->apidata;
-
-    close(state->epfd);
-    zfree(state->events);
-    zfree(state);
-}
-
-static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-    struct epoll_event ee = {0}; /* avoid valgrind warning */
-    /* If the fd was already monitored for some event, we need a MOD
-     * operation. Otherwise we need an ADD operation. */
-    int op = eventLoop->events[fd].mask == AE_NONE ?
-            EPOLL_CTL_ADD : EPOLL_CTL_MOD;
-
-    ee.events = 0;
-    mask |= eventLoop->events[fd].mask; /* Merge old events */
-    if (mask & AE_READABLE) ee.events |= EPOLLIN;
-    if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;
-    ee.data.fd = fd;
-    if (epoll_ctl(state->epfd,op,fd,&ee) == -1) return -1;
-    return 0;
-}
-
-static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int delmask) {
-    aeApiState *state = eventLoop->apidata;
-    struct epoll_event ee = {0}; /* avoid valgrind warning */
-    int mask = eventLoop->events[fd].mask & (~delmask);
-
-    ee.events = 0;
-    if (mask & AE_READABLE) ee.events |= EPOLLIN;
-    if (mask & AE_WRITABLE) ee.events |= EPOLLOUT;
-    ee.data.fd = fd;
-    if (mask != AE_NONE) {
-        epoll_ctl(state->epfd,EPOLL_CTL_MOD,fd,&ee);
-    } else {
-        /* Note, Kernel < 2.6.9 requires a non null event pointer even for
-         * EPOLL_CTL_DEL. */
-        epoll_ctl(state->epfd,EPOLL_CTL_DEL,fd,&ee);
-    }
-}
-
-static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
-    aeApiState *state = eventLoop->apidata;
-    int retval, numevents = 0;
-
-    retval = epoll_wait(state->epfd,state->events,eventLoop->setsize,
-            tvp ? (tvp->tv_sec*1000 + (tvp->tv_usec + 999)/1000) : -1);
-    if (retval > 0) {
-        int j;
-
-        numevents = retval;
-        for (j = 0; j < numevents; j++) {
-            int mask = 0;
-            struct epoll_event *e = state->events+j;
-
-            if (e->events & EPOLLIN) mask |= AE_READABLE;
-            if (e->events & EPOLLOUT) mask |= AE_WRITABLE;
-            if (e->events & EPOLLERR) mask |= AE_WRITABLE|AE_READABLE;
-            if (e->events & EPOLLHUP) mask |= AE_WRITABLE|AE_READABLE;
-            eventLoop->fired[j].fd = e->data.fd;
-            eventLoop->fired[j].mask = mask;
-        }
-    }
-    return numevents;
-}
-
-static char *aeApiName(void) {
-    return "epoll";
-}
diff --git a/redis-stable/src/ae_evport.c b/redis-stable/src/ae_evport.c
deleted file mode 100644
index 7a0b03ae..00000000
--- a/redis-stable/src/ae_evport.c
+++ /dev/null
@@ -1,323 +0,0 @@
-/* ae.c module for illumos event ports.
- *
- * Copyright (c) 2012, Joyent, Inc. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <assert.h>
-#include <errno.h>
-#include <port.h>
-#include <poll.h>
-
-#include <sys/types.h>
-#include <sys/time.h>
-
-#include <stdio.h>
-
-static int evport_debug = 0;
-
-/*
- * This file implements the ae API using event ports, present on Solaris-based
- * systems since Solaris 10.  Using the event port interface, we associate file
- * descriptors with the port.  Each association also includes the set of poll(2)
- * events that the consumer is interested in (e.g., POLLIN and POLLOUT).
- *
- * There's one tricky piece to this implementation: when we return events via
- * aeApiPoll, the corresponding file descriptors become dissociated from the
- * port.  This is necessary because poll events are level-triggered, so if the
- * fd didn't become dissociated, it would immediately fire another event since
- * the underlying state hasn't changed yet.  We must re-associate the file
- * descriptor, but only after we know that our caller has actually read from it.
- * The ae API does not tell us exactly when that happens, but we do know that
- * it must happen by the time aeApiPoll is called again.  Our solution is to
- * keep track of the last fds returned by aeApiPoll and re-associate them next
- * time aeApiPoll is invoked.
- *
- * To summarize, in this module, each fd association is EITHER (a) represented
- * only via the in-kernel association OR (b) represented by pending_fds and
- * pending_masks.  (b) is only true for the last fds we returned from aeApiPoll,
- * and only until we enter aeApiPoll again (at which point we restore the
- * in-kernel association).
- */
-#define MAX_EVENT_BATCHSZ 512
-
-typedef struct aeApiState {
-    int     portfd;                             /* event port */
-    uint_t  npending;                           /* # of pending fds */
-    int     pending_fds[MAX_EVENT_BATCHSZ];     /* pending fds */
-    int     pending_masks[MAX_EVENT_BATCHSZ];   /* pending fds' masks */
-} aeApiState;
-
-static int aeApiCreate(aeEventLoop *eventLoop) {
-    int i;
-    aeApiState *state = zmalloc(sizeof(aeApiState));
-    if (!state) return -1;
-
-    state->portfd = port_create();
-    if (state->portfd == -1) {
-        zfree(state);
-        return -1;
-    }
-    anetCloexec(state->portfd);
-
-    state->npending = 0;
-
-    for (i = 0; i < MAX_EVENT_BATCHSZ; i++) {
-        state->pending_fds[i] = -1;
-        state->pending_masks[i] = AE_NONE;
-    }
-
-    eventLoop->apidata = state;
-    return 0;
-}
-
-static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
-    (void) eventLoop;
-    (void) setsize;
-    /* Nothing to resize here. */
-    return 0;
-}
-
-static void aeApiFree(aeEventLoop *eventLoop) {
-    aeApiState *state = eventLoop->apidata;
-
-    close(state->portfd);
-    zfree(state);
-}
-
-static int aeApiLookupPending(aeApiState *state, int fd) {
-    uint_t i;
-
-    for (i = 0; i < state->npending; i++) {
-        if (state->pending_fds[i] == fd)
-            return (i);
-    }
-
-    return (-1);
-}
-
-/*
- * Helper function to invoke port_associate for the given fd and mask.
- */
-static int aeApiAssociate(const char *where, int portfd, int fd, int mask) {
-    int events = 0;
-    int rv, err;
-
-    if (mask & AE_READABLE)
-        events |= POLLIN;
-    if (mask & AE_WRITABLE)
-        events |= POLLOUT;
-
-    if (evport_debug)
-        fprintf(stderr, "%s: port_associate(%d, 0x%x) = ", where, fd, events);
-
-    rv = port_associate(portfd, PORT_SOURCE_FD, fd, events,
-        (void *)(uintptr_t)mask);
-    err = errno;
-
-    if (evport_debug)
-        fprintf(stderr, "%d (%s)\n", rv, rv == 0 ? "no error" : strerror(err));
-
-    if (rv == -1) {
-        fprintf(stderr, "%s: port_associate: %s\n", where, strerror(err));
-
-        if (err == EAGAIN)
-            fprintf(stderr, "aeApiAssociate: event port limit exceeded.");
-    }
-
-    return rv;
-}
-
-static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-    int fullmask, pfd;
-
-    if (evport_debug)
-        fprintf(stderr, "aeApiAddEvent: fd %d mask 0x%x\n", fd, mask);
-
-    /*
-     * Since port_associate's "events" argument replaces any existing events, we
-     * must be sure to include whatever events are already associated when
-     * we call port_associate() again.
-     */
-    fullmask = mask | eventLoop->events[fd].mask;
-    pfd = aeApiLookupPending(state, fd);
-
-    if (pfd != -1) {
-        /*
-         * This fd was recently returned from aeApiPoll.  It should be safe to
-         * assume that the consumer has processed that poll event, but we play
-         * it safer by simply updating pending_mask.  The fd will be
-         * re-associated as usual when aeApiPoll is called again.
-         */
-        if (evport_debug)
-            fprintf(stderr, "aeApiAddEvent: adding to pending fd %d\n", fd);
-        state->pending_masks[pfd] |= fullmask;
-        return 0;
-    }
-
-    return (aeApiAssociate("aeApiAddEvent", state->portfd, fd, fullmask));
-}
-
-static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-    int fullmask, pfd;
-
-    if (evport_debug)
-        fprintf(stderr, "del fd %d mask 0x%x\n", fd, mask);
-
-    pfd = aeApiLookupPending(state, fd);
-
-    if (pfd != -1) {
-        if (evport_debug)
-            fprintf(stderr, "deleting event from pending fd %d\n", fd);
-
-        /*
-         * This fd was just returned from aeApiPoll, so it's not currently
-         * associated with the port.  All we need to do is update
-         * pending_mask appropriately.
-         */
-        state->pending_masks[pfd] &= ~mask;
-
-        if (state->pending_masks[pfd] == AE_NONE)
-            state->pending_fds[pfd] = -1;
-
-        return;
-    }
-
-    /*
-     * The fd is currently associated with the port.  Like with the add case
-     * above, we must look at the full mask for the file descriptor before
-     * updating that association.  We don't have a good way of knowing what the
-     * events are without looking into the eventLoop state directly.  We rely on
-     * the fact that our caller has already updated the mask in the eventLoop.
-     */
-
-    fullmask = eventLoop->events[fd].mask;
-    if (fullmask == AE_NONE) {
-        /*
-         * We're removing *all* events, so use port_dissociate to remove the
-         * association completely.  Failure here indicates a bug.
-         */
-        if (evport_debug)
-            fprintf(stderr, "aeApiDelEvent: port_dissociate(%d)\n", fd);
-
-        if (port_dissociate(state->portfd, PORT_SOURCE_FD, fd) != 0) {
-            perror("aeApiDelEvent: port_dissociate");
-            abort(); /* will not return */
-        }
-    } else if (aeApiAssociate("aeApiDelEvent", state->portfd, fd,
-        fullmask) != 0) {
-        /*
-         * ENOMEM is a potentially transient condition, but the kernel won't
-         * generally return it unless things are really bad.  EAGAIN indicates
-         * we've reached a resource limit, for which it doesn't make sense to
-         * retry (counter-intuitively).  All other errors indicate a bug.  In any
-         * of these cases, the best we can do is to abort.
-         */
-        abort(); /* will not return */
-    }
-}
-
-static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
-    aeApiState *state = eventLoop->apidata;
-    struct timespec timeout, *tsp;
-    uint_t mask, i;
-    uint_t nevents;
-    port_event_t event[MAX_EVENT_BATCHSZ];
-
-    /*
-     * If we've returned fd events before, we must re-associate them with the
-     * port now, before calling port_get().  See the block comment at the top of
-     * this file for an explanation of why.
-     */
-    for (i = 0; i < state->npending; i++) {
-        if (state->pending_fds[i] == -1)
-            /* This fd has since been deleted. */
-            continue;
-
-        if (aeApiAssociate("aeApiPoll", state->portfd,
-            state->pending_fds[i], state->pending_masks[i]) != 0) {
-            /* See aeApiDelEvent for why this case is fatal. */
-            abort();
-        }
-
-        state->pending_masks[i] = AE_NONE;
-        state->pending_fds[i] = -1;
-    }
-
-    state->npending = 0;
-
-    if (tvp != NULL) {
-        timeout.tv_sec = tvp->tv_sec;
-        timeout.tv_nsec = tvp->tv_usec * 1000;
-        tsp = &timeout;
-    } else {
-        tsp = NULL;
-    }
-
-    /*
-     * port_getn can return with errno == ETIME having returned some events (!).
-     * So if we get ETIME, we check nevents, too.
-     */
-    nevents = 1;
-    if (port_getn(state->portfd, event, MAX_EVENT_BATCHSZ, &nevents,
-        tsp) == -1 && (errno != ETIME || nevents == 0)) {
-        if (errno == ETIME || errno == EINTR)
-            return 0;
-
-        /* Any other error indicates a bug. */
-        perror("aeApiPoll: port_get");
-        abort();
-    }
-
-    state->npending = nevents;
-
-    for (i = 0; i < nevents; i++) {
-            mask = 0;
-            if (event[i].portev_events & POLLIN)
-                mask |= AE_READABLE;
-            if (event[i].portev_events & POLLOUT)
-                mask |= AE_WRITABLE;
-
-            eventLoop->fired[i].fd = event[i].portev_object;
-            eventLoop->fired[i].mask = mask;
-
-            if (evport_debug)
-                fprintf(stderr, "aeApiPoll: fd %d mask 0x%x\n",
-                    (int)event[i].portev_object, mask);
-
-            state->pending_fds[i] = event[i].portev_object;
-            state->pending_masks[i] = (uintptr_t)event[i].portev_user;
-    }
-
-    return nevents;
-}
-
-static char *aeApiName(void) {
-    return "evport";
-}
diff --git a/redis-stable/src/ae_kqueue.c b/redis-stable/src/ae_kqueue.c
deleted file mode 100644
index 6d62720b..00000000
--- a/redis-stable/src/ae_kqueue.c
+++ /dev/null
@@ -1,187 +0,0 @@
-/* Kqueue(2)-based ae.c module
- *
- * Copyright (C) 2009 Harish Mallipeddi - harish.mallipeddi@gmail.com
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <sys/types.h>
-#include <sys/event.h>
-#include <sys/time.h>
-
-typedef struct aeApiState {
-    int kqfd;
-    struct kevent *events;
-
-    /* Events mask for merge read and write event.
-     * To reduce memory consumption, we use 2 bits to store the mask
-     * of an event, so that 1 byte will store the mask of 4 events. */
-    char *eventsMask; 
-} aeApiState;
-
-#define EVENT_MASK_MALLOC_SIZE(sz) (((sz) + 3) / 4)
-#define EVENT_MASK_OFFSET(fd) ((fd) % 4 * 2)
-#define EVENT_MASK_ENCODE(fd, mask) (((mask) & 0x3) << EVENT_MASK_OFFSET(fd))
-
-static inline int getEventMask(const char *eventsMask, int fd) {
-    return (eventsMask[fd/4] >> EVENT_MASK_OFFSET(fd)) & 0x3;
-}
-
-static inline void addEventMask(char *eventsMask, int fd, int mask) {
-    eventsMask[fd/4] |= EVENT_MASK_ENCODE(fd, mask);
-}
-
-static inline void resetEventMask(char *eventsMask, int fd) {
-    eventsMask[fd/4] &= ~EVENT_MASK_ENCODE(fd, 0x3);
-}
-
-static int aeApiCreate(aeEventLoop *eventLoop) {
-    aeApiState *state = zmalloc(sizeof(aeApiState));
-
-    if (!state) return -1;
-    state->events = zmalloc(sizeof(struct kevent)*eventLoop->setsize);
-    if (!state->events) {
-        zfree(state);
-        return -1;
-    }
-    state->kqfd = kqueue();
-    if (state->kqfd == -1) {
-        zfree(state->events);
-        zfree(state);
-        return -1;
-    }
-    anetCloexec(state->kqfd);
-    state->eventsMask = zmalloc(EVENT_MASK_MALLOC_SIZE(eventLoop->setsize));
-    memset(state->eventsMask, 0, EVENT_MASK_MALLOC_SIZE(eventLoop->setsize));
-    eventLoop->apidata = state;
-    return 0;
-}
-
-static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
-    aeApiState *state = eventLoop->apidata;
-
-    state->events = zrealloc(state->events, sizeof(struct kevent)*setsize);
-    state->eventsMask = zrealloc(state->eventsMask, EVENT_MASK_MALLOC_SIZE(setsize));
-    memset(state->eventsMask, 0, EVENT_MASK_MALLOC_SIZE(setsize));
-    return 0;
-}
-
-static void aeApiFree(aeEventLoop *eventLoop) {
-    aeApiState *state = eventLoop->apidata;
-
-    close(state->kqfd);
-    zfree(state->events);
-    zfree(state->eventsMask);
-    zfree(state);
-}
-
-static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-    struct kevent ke;
-
-    if (mask & AE_READABLE) {
-        EV_SET(&ke, fd, EVFILT_READ, EV_ADD, 0, 0, NULL);
-        if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;
-    }
-    if (mask & AE_WRITABLE) {
-        EV_SET(&ke, fd, EVFILT_WRITE, EV_ADD, 0, 0, NULL);
-        if (kevent(state->kqfd, &ke, 1, NULL, 0, NULL) == -1) return -1;
-    }
-    return 0;
-}
-
-static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-    struct kevent ke;
-
-    if (mask & AE_READABLE) {
-        EV_SET(&ke, fd, EVFILT_READ, EV_DELETE, 0, 0, NULL);
-        kevent(state->kqfd, &ke, 1, NULL, 0, NULL);
-    }
-    if (mask & AE_WRITABLE) {
-        EV_SET(&ke, fd, EVFILT_WRITE, EV_DELETE, 0, 0, NULL);
-        kevent(state->kqfd, &ke, 1, NULL, 0, NULL);
-    }
-}
-
-static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
-    aeApiState *state = eventLoop->apidata;
-    int retval, numevents = 0;
-
-    if (tvp != NULL) {
-        struct timespec timeout;
-        timeout.tv_sec = tvp->tv_sec;
-        timeout.tv_nsec = tvp->tv_usec * 1000;
-        retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,
-                        &timeout);
-    } else {
-        retval = kevent(state->kqfd, NULL, 0, state->events, eventLoop->setsize,
-                        NULL);
-    }
-
-    if (retval > 0) {
-        int j;
-
-        /* Normally we execute the read event first and then the write event.
-         * When the barrier is set, we will do it reverse.
-         * 
-         * However, under kqueue, read and write events would be separate
-         * events, which would make it impossible to control the order of
-         * reads and writes. So we store the event's mask we've got and merge
-         * the same fd events later. */
-        for (j = 0; j < retval; j++) {
-            struct kevent *e = state->events+j;
-            int fd = e->ident;
-            int mask = 0; 
-
-            if (e->filter == EVFILT_READ) mask = AE_READABLE;
-            else if (e->filter == EVFILT_WRITE) mask = AE_WRITABLE;
-            addEventMask(state->eventsMask, fd, mask);
-        }
-
-        /* Re-traversal to merge read and write events, and set the fd's mask to
-         * 0 so that events are not added again when the fd is encountered again. */
-        numevents = 0;
-        for (j = 0; j < retval; j++) {
-            struct kevent *e = state->events+j;
-            int fd = e->ident;
-            int mask = getEventMask(state->eventsMask, fd);
-
-            if (mask) {
-                eventLoop->fired[numevents].fd = fd;
-                eventLoop->fired[numevents].mask = mask;
-                resetEventMask(state->eventsMask, fd);
-                numevents++;
-            }
-        }
-    }
-    return numevents;
-}
-
-static char *aeApiName(void) {
-    return "kqueue";
-}
diff --git a/redis-stable/src/ae_select.c b/redis-stable/src/ae_select.c
deleted file mode 100644
index c039a8ea..00000000
--- a/redis-stable/src/ae_select.c
+++ /dev/null
@@ -1,106 +0,0 @@
-/* Select()-based ae.c module.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <sys/select.h>
-#include <string.h>
-
-typedef struct aeApiState {
-    fd_set rfds, wfds;
-    /* We need to have a copy of the fd sets as it's not safe to reuse
-     * FD sets after select(). */
-    fd_set _rfds, _wfds;
-} aeApiState;
-
-static int aeApiCreate(aeEventLoop *eventLoop) {
-    aeApiState *state = zmalloc(sizeof(aeApiState));
-
-    if (!state) return -1;
-    FD_ZERO(&state->rfds);
-    FD_ZERO(&state->wfds);
-    eventLoop->apidata = state;
-    return 0;
-}
-
-static int aeApiResize(aeEventLoop *eventLoop, int setsize) {
-    /* Just ensure we have enough room in the fd_set type. */
-    if (setsize >= FD_SETSIZE) return -1;
-    return 0;
-}
-
-static void aeApiFree(aeEventLoop *eventLoop) {
-    zfree(eventLoop->apidata);
-}
-
-static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-
-    if (mask & AE_READABLE) FD_SET(fd,&state->rfds);
-    if (mask & AE_WRITABLE) FD_SET(fd,&state->wfds);
-    return 0;
-}
-
-static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int mask) {
-    aeApiState *state = eventLoop->apidata;
-
-    if (mask & AE_READABLE) FD_CLR(fd,&state->rfds);
-    if (mask & AE_WRITABLE) FD_CLR(fd,&state->wfds);
-}
-
-static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) {
-    aeApiState *state = eventLoop->apidata;
-    int retval, j, numevents = 0;
-
-    memcpy(&state->_rfds,&state->rfds,sizeof(fd_set));
-    memcpy(&state->_wfds,&state->wfds,sizeof(fd_set));
-
-    retval = select(eventLoop->maxfd+1,
-                &state->_rfds,&state->_wfds,NULL,tvp);
-    if (retval > 0) {
-        for (j = 0; j <= eventLoop->maxfd; j++) {
-            int mask = 0;
-            aeFileEvent *fe = &eventLoop->events[j];
-
-            if (fe->mask == AE_NONE) continue;
-            if (fe->mask & AE_READABLE && FD_ISSET(j,&state->_rfds))
-                mask |= AE_READABLE;
-            if (fe->mask & AE_WRITABLE && FD_ISSET(j,&state->_wfds))
-                mask |= AE_WRITABLE;
-            eventLoop->fired[numevents].fd = j;
-            eventLoop->fired[numevents].mask = mask;
-            numevents++;
-        }
-    }
-    return numevents;
-}
-
-static char *aeApiName(void) {
-    return "select";
-}
diff --git a/redis-stable/src/anet.c b/redis-stable/src/anet.c
deleted file mode 100644
index a121c276..00000000
--- a/redis-stable/src/anet.c
+++ /dev/null
@@ -1,595 +0,0 @@
-/* anet.c -- Basic TCP socket stuff made a bit less boring
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-
-#include <sys/types.h>
-#include <sys/socket.h>
-#include <sys/stat.h>
-#include <sys/un.h>
-#include <sys/time.h>
-#include <netinet/in.h>
-#include <netinet/tcp.h>
-#include <arpa/inet.h>
-#include <unistd.h>
-#include <fcntl.h>
-#include <string.h>
-#include <netdb.h>
-#include <errno.h>
-#include <stdarg.h>
-#include <stdio.h>
-
-#include "anet.h"
-
-static void anetSetError(char *err, const char *fmt, ...)
-{
-    va_list ap;
-
-    if (!err) return;
-    va_start(ap, fmt);
-    vsnprintf(err, ANET_ERR_LEN, fmt, ap);
-    va_end(ap);
-}
-
-int anetSetBlock(char *err, int fd, int non_block) {
-    int flags;
-
-    /* Set the socket blocking (if non_block is zero) or non-blocking.
-     * Note that fcntl(2) for F_GETFL and F_SETFL can't be
-     * interrupted by a signal. */
-    if ((flags = fcntl(fd, F_GETFL)) == -1) {
-        anetSetError(err, "fcntl(F_GETFL): %s", strerror(errno));
-        return ANET_ERR;
-    }
-
-    /* Check if this flag has been set or unset, if so, 
-     * then there is no need to call fcntl to set/unset it again. */
-    if (!!(flags & O_NONBLOCK) == !!non_block)
-        return ANET_OK;
-
-    if (non_block)
-        flags |= O_NONBLOCK;
-    else
-        flags &= ~O_NONBLOCK;
-
-    if (fcntl(fd, F_SETFL, flags) == -1) {
-        anetSetError(err, "fcntl(F_SETFL,O_NONBLOCK): %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-int anetNonBlock(char *err, int fd) {
-    return anetSetBlock(err,fd,1);
-}
-
-int anetBlock(char *err, int fd) {
-    return anetSetBlock(err,fd,0);
-}
-
-/* Enable the FD_CLOEXEC on the given fd to avoid fd leaks. 
- * This function should be invoked for fd's on specific places 
- * where fork + execve system calls are called. */
-int anetCloexec(int fd) {
-    int r;
-    int flags;
-
-    do {
-        r = fcntl(fd, F_GETFD);
-    } while (r == -1 && errno == EINTR);
-
-    if (r == -1 || (r & FD_CLOEXEC))
-        return r;
-
-    flags = r | FD_CLOEXEC;
-
-    do {
-        r = fcntl(fd, F_SETFD, flags);
-    } while (r == -1 && errno == EINTR);
-
-    return r;
-}
-
-/* Set TCP keep alive option to detect dead peers. The interval option
- * is only used for Linux as we are using Linux-specific APIs to set
- * the probe send time, interval, and count. */
-int anetKeepAlive(char *err, int fd, int interval)
-{
-    int val = 1;
-
-    if (setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &val, sizeof(val)) == -1)
-    {
-        anetSetError(err, "setsockopt SO_KEEPALIVE: %s", strerror(errno));
-        return ANET_ERR;
-    }
-
-#ifdef __linux__
-    /* Default settings are more or less garbage, with the keepalive time
-     * set to 7200 by default on Linux. Modify settings to make the feature
-     * actually useful. */
-
-    /* Send first probe after interval. */
-    val = interval;
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPIDLE, &val, sizeof(val)) < 0) {
-        anetSetError(err, "setsockopt TCP_KEEPIDLE: %s\n", strerror(errno));
-        return ANET_ERR;
-    }
-
-    /* Send next probes after the specified interval. Note that we set the
-     * delay as interval / 3, as we send three probes before detecting
-     * an error (see the next setsockopt call). */
-    val = interval/3;
-    if (val == 0) val = 1;
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPINTVL, &val, sizeof(val)) < 0) {
-        anetSetError(err, "setsockopt TCP_KEEPINTVL: %s\n", strerror(errno));
-        return ANET_ERR;
-    }
-
-    /* Consider the socket in error state after three we send three ACK
-     * probes without getting a reply. */
-    val = 3;
-    if (setsockopt(fd, IPPROTO_TCP, TCP_KEEPCNT, &val, sizeof(val)) < 0) {
-        anetSetError(err, "setsockopt TCP_KEEPCNT: %s\n", strerror(errno));
-        return ANET_ERR;
-    }
-#else
-    ((void) interval); /* Avoid unused var warning for non Linux systems. */
-#endif
-
-    return ANET_OK;
-}
-
-static int anetSetTcpNoDelay(char *err, int fd, int val)
-{
-    if (setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &val, sizeof(val)) == -1)
-    {
-        anetSetError(err, "setsockopt TCP_NODELAY: %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-int anetEnableTcpNoDelay(char *err, int fd)
-{
-    return anetSetTcpNoDelay(err, fd, 1);
-}
-
-int anetDisableTcpNoDelay(char *err, int fd)
-{
-    return anetSetTcpNoDelay(err, fd, 0);
-}
-
-/* Set the socket send timeout (SO_SNDTIMEO socket option) to the specified
- * number of milliseconds, or disable it if the 'ms' argument is zero. */
-int anetSendTimeout(char *err, int fd, long long ms) {
-    struct timeval tv;
-
-    tv.tv_sec = ms/1000;
-    tv.tv_usec = (ms%1000)*1000;
-    if (setsockopt(fd, SOL_SOCKET, SO_SNDTIMEO, &tv, sizeof(tv)) == -1) {
-        anetSetError(err, "setsockopt SO_SNDTIMEO: %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-/* Set the socket receive timeout (SO_RCVTIMEO socket option) to the specified
- * number of milliseconds, or disable it if the 'ms' argument is zero. */
-int anetRecvTimeout(char *err, int fd, long long ms) {
-    struct timeval tv;
-
-    tv.tv_sec = ms/1000;
-    tv.tv_usec = (ms%1000)*1000;
-    if (setsockopt(fd, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)) == -1) {
-        anetSetError(err, "setsockopt SO_RCVTIMEO: %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-/* Resolve the hostname "host" and set the string representation of the
- * IP address into the buffer pointed by "ipbuf".
- *
- * If flags is set to ANET_IP_ONLY the function only resolves hostnames
- * that are actually already IPv4 or IPv6 addresses. This turns the function
- * into a validating / normalizing function. */
-int anetResolve(char *err, char *host, char *ipbuf, size_t ipbuf_len,
-                       int flags)
-{
-    struct addrinfo hints, *info;
-    int rv;
-
-    memset(&hints,0,sizeof(hints));
-    if (flags & ANET_IP_ONLY) hints.ai_flags = AI_NUMERICHOST;
-    hints.ai_family = AF_UNSPEC;
-    hints.ai_socktype = SOCK_STREAM;  /* specify socktype to avoid dups */
-
-    if ((rv = getaddrinfo(host, NULL, &hints, &info)) != 0) {
-        anetSetError(err, "%s", gai_strerror(rv));
-        return ANET_ERR;
-    }
-    if (info->ai_family == AF_INET) {
-        struct sockaddr_in *sa = (struct sockaddr_in *)info->ai_addr;
-        inet_ntop(AF_INET, &(sa->sin_addr), ipbuf, ipbuf_len);
-    } else {
-        struct sockaddr_in6 *sa = (struct sockaddr_in6 *)info->ai_addr;
-        inet_ntop(AF_INET6, &(sa->sin6_addr), ipbuf, ipbuf_len);
-    }
-
-    freeaddrinfo(info);
-    return ANET_OK;
-}
-
-static int anetSetReuseAddr(char *err, int fd) {
-    int yes = 1;
-    /* Make sure connection-intensive things like the redis benchmark
-     * will be able to close/open sockets a zillion of times */
-    if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes)) == -1) {
-        anetSetError(err, "setsockopt SO_REUSEADDR: %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-static int anetCreateSocket(char *err, int domain) {
-    int s;
-    if ((s = socket(domain, SOCK_STREAM, 0)) == -1) {
-        anetSetError(err, "creating socket: %s", strerror(errno));
-        return ANET_ERR;
-    }
-
-    /* Make sure connection-intensive things like the redis benchmark
-     * will be able to close/open sockets a zillion of times */
-    if (anetSetReuseAddr(err,s) == ANET_ERR) {
-        close(s);
-        return ANET_ERR;
-    }
-    return s;
-}
-
-#define ANET_CONNECT_NONE 0
-#define ANET_CONNECT_NONBLOCK 1
-#define ANET_CONNECT_BE_BINDING 2 /* Best effort binding. */
-static int anetTcpGenericConnect(char *err, const char *addr, int port,
-                                 const char *source_addr, int flags)
-{
-    int s = ANET_ERR, rv;
-    char portstr[6];  /* strlen("65535") + 1; */
-    struct addrinfo hints, *servinfo, *bservinfo, *p, *b;
-
-    snprintf(portstr,sizeof(portstr),"%d",port);
-    memset(&hints,0,sizeof(hints));
-    hints.ai_family = AF_UNSPEC;
-    hints.ai_socktype = SOCK_STREAM;
-
-    if ((rv = getaddrinfo(addr,portstr,&hints,&servinfo)) != 0) {
-        anetSetError(err, "%s", gai_strerror(rv));
-        return ANET_ERR;
-    }
-    for (p = servinfo; p != NULL; p = p->ai_next) {
-        /* Try to create the socket and to connect it.
-         * If we fail in the socket() call, or on connect(), we retry with
-         * the next entry in servinfo. */
-        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == -1)
-            continue;
-        if (anetSetReuseAddr(err,s) == ANET_ERR) goto error;
-        if (flags & ANET_CONNECT_NONBLOCK && anetNonBlock(err,s) != ANET_OK)
-            goto error;
-        if (source_addr) {
-            int bound = 0;
-            /* Using getaddrinfo saves us from self-determining IPv4 vs IPv6 */
-            if ((rv = getaddrinfo(source_addr, NULL, &hints, &bservinfo)) != 0)
-            {
-                anetSetError(err, "%s", gai_strerror(rv));
-                goto error;
-            }
-            for (b = bservinfo; b != NULL; b = b->ai_next) {
-                if (bind(s,b->ai_addr,b->ai_addrlen) != -1) {
-                    bound = 1;
-                    break;
-                }
-            }
-            freeaddrinfo(bservinfo);
-            if (!bound) {
-                anetSetError(err, "bind: %s", strerror(errno));
-                goto error;
-            }
-        }
-        if (connect(s,p->ai_addr,p->ai_addrlen) == -1) {
-            /* If the socket is non-blocking, it is ok for connect() to
-             * return an EINPROGRESS error here. */
-            if (errno == EINPROGRESS && flags & ANET_CONNECT_NONBLOCK)
-                goto end;
-            close(s);
-            s = ANET_ERR;
-            continue;
-        }
-
-        /* If we ended an iteration of the for loop without errors, we
-         * have a connected socket. Let's return to the caller. */
-        goto end;
-    }
-    if (p == NULL)
-        anetSetError(err, "creating socket: %s", strerror(errno));
-
-error:
-    if (s != ANET_ERR) {
-        close(s);
-        s = ANET_ERR;
-    }
-
-end:
-    freeaddrinfo(servinfo);
-
-    /* Handle best effort binding: if a binding address was used, but it is
-     * not possible to create a socket, try again without a binding address. */
-    if (s == ANET_ERR && source_addr && (flags & ANET_CONNECT_BE_BINDING)) {
-        return anetTcpGenericConnect(err,addr,port,NULL,flags);
-    } else {
-        return s;
-    }
-}
-
-int anetTcpNonBlockConnect(char *err, const char *addr, int port)
-{
-    return anetTcpGenericConnect(err,addr,port,NULL,ANET_CONNECT_NONBLOCK);
-}
-
-int anetTcpNonBlockBestEffortBindConnect(char *err, const char *addr, int port,
-                                         const char *source_addr)
-{
-    return anetTcpGenericConnect(err,addr,port,source_addr,
-            ANET_CONNECT_NONBLOCK|ANET_CONNECT_BE_BINDING);
-}
-
-int anetUnixGenericConnect(char *err, const char *path, int flags)
-{
-    int s;
-    struct sockaddr_un sa;
-
-    if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR)
-        return ANET_ERR;
-
-    sa.sun_family = AF_LOCAL;
-    strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1);
-    if (flags & ANET_CONNECT_NONBLOCK) {
-        if (anetNonBlock(err,s) != ANET_OK) {
-            close(s);
-            return ANET_ERR;
-        }
-    }
-    if (connect(s,(struct sockaddr*)&sa,sizeof(sa)) == -1) {
-        if (errno == EINPROGRESS &&
-            flags & ANET_CONNECT_NONBLOCK)
-            return s;
-
-        anetSetError(err, "connect: %s", strerror(errno));
-        close(s);
-        return ANET_ERR;
-    }
-    return s;
-}
-
-static int anetListen(char *err, int s, struct sockaddr *sa, socklen_t len, int backlog) {
-    if (bind(s,sa,len) == -1) {
-        anetSetError(err, "bind: %s", strerror(errno));
-        close(s);
-        return ANET_ERR;
-    }
-
-    if (listen(s, backlog) == -1) {
-        anetSetError(err, "listen: %s", strerror(errno));
-        close(s);
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-static int anetV6Only(char *err, int s) {
-    int yes = 1;
-    if (setsockopt(s,IPPROTO_IPV6,IPV6_V6ONLY,&yes,sizeof(yes)) == -1) {
-        anetSetError(err, "setsockopt: %s", strerror(errno));
-        return ANET_ERR;
-    }
-    return ANET_OK;
-}
-
-static int _anetTcpServer(char *err, int port, char *bindaddr, int af, int backlog)
-{
-    int s = -1, rv;
-    char _port[6];  /* strlen("65535") */
-    struct addrinfo hints, *servinfo, *p;
-
-    snprintf(_port,6,"%d",port);
-    memset(&hints,0,sizeof(hints));
-    hints.ai_family = af;
-    hints.ai_socktype = SOCK_STREAM;
-    hints.ai_flags = AI_PASSIVE;    /* No effect if bindaddr != NULL */
-    if (bindaddr && !strcmp("*", bindaddr))
-        bindaddr = NULL;
-    if (af == AF_INET6 && bindaddr && !strcmp("::*", bindaddr))
-        bindaddr = NULL;
-
-    if ((rv = getaddrinfo(bindaddr,_port,&hints,&servinfo)) != 0) {
-        anetSetError(err, "%s", gai_strerror(rv));
-        return ANET_ERR;
-    }
-    for (p = servinfo; p != NULL; p = p->ai_next) {
-        if ((s = socket(p->ai_family,p->ai_socktype,p->ai_protocol)) == -1)
-            continue;
-
-        if (af == AF_INET6 && anetV6Only(err,s) == ANET_ERR) goto error;
-        if (anetSetReuseAddr(err,s) == ANET_ERR) goto error;
-        if (anetListen(err,s,p->ai_addr,p->ai_addrlen,backlog) == ANET_ERR) s = ANET_ERR;
-        goto end;
-    }
-    if (p == NULL) {
-        anetSetError(err, "unable to bind socket, errno: %d", errno);
-        goto error;
-    }
-
-error:
-    if (s != -1) close(s);
-    s = ANET_ERR;
-end:
-    freeaddrinfo(servinfo);
-    return s;
-}
-
-int anetTcpServer(char *err, int port, char *bindaddr, int backlog)
-{
-    return _anetTcpServer(err, port, bindaddr, AF_INET, backlog);
-}
-
-int anetTcp6Server(char *err, int port, char *bindaddr, int backlog)
-{
-    return _anetTcpServer(err, port, bindaddr, AF_INET6, backlog);
-}
-
-int anetUnixServer(char *err, char *path, mode_t perm, int backlog)
-{
-    int s;
-    struct sockaddr_un sa;
-
-    if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR)
-        return ANET_ERR;
-
-    memset(&sa,0,sizeof(sa));
-    sa.sun_family = AF_LOCAL;
-    strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1);
-    if (anetListen(err,s,(struct sockaddr*)&sa,sizeof(sa),backlog) == ANET_ERR)
-        return ANET_ERR;
-    if (perm)
-        chmod(sa.sun_path, perm);
-    return s;
-}
-
-static int anetGenericAccept(char *err, int s, struct sockaddr *sa, socklen_t *len) {
-    int fd;
-    while(1) {
-        fd = accept(s,sa,len);
-        if (fd == -1) {
-            if (errno == EINTR)
-                continue;
-            else {
-                anetSetError(err, "accept: %s", strerror(errno));
-                return ANET_ERR;
-            }
-        }
-        break;
-    }
-    return fd;
-}
-
-int anetTcpAccept(char *err, int s, char *ip, size_t ip_len, int *port) {
-    int fd;
-    struct sockaddr_storage sa;
-    socklen_t salen = sizeof(sa);
-    if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == -1)
-        return ANET_ERR;
-
-    if (sa.ss_family == AF_INET) {
-        struct sockaddr_in *s = (struct sockaddr_in *)&sa;
-        if (ip) inet_ntop(AF_INET,(void*)&(s->sin_addr),ip,ip_len);
-        if (port) *port = ntohs(s->sin_port);
-    } else {
-        struct sockaddr_in6 *s = (struct sockaddr_in6 *)&sa;
-        if (ip) inet_ntop(AF_INET6,(void*)&(s->sin6_addr),ip,ip_len);
-        if (port) *port = ntohs(s->sin6_port);
-    }
-    return fd;
-}
-
-int anetUnixAccept(char *err, int s) {
-    int fd;
-    struct sockaddr_un sa;
-    socklen_t salen = sizeof(sa);
-    if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == -1)
-        return ANET_ERR;
-
-    return fd;
-}
-
-int anetFdToString(int fd, char *ip, size_t ip_len, int *port, int fd_to_str_type) {
-    struct sockaddr_storage sa;
-    socklen_t salen = sizeof(sa);
-
-    if (fd_to_str_type == FD_TO_PEER_NAME) {
-        if (getpeername(fd, (struct sockaddr *)&sa, &salen) == -1) goto error;
-    } else {
-        if (getsockname(fd, (struct sockaddr *)&sa, &salen) == -1) goto error;
-    }
-    if (ip_len == 0) goto error;
-
-    if (sa.ss_family == AF_INET) {
-        struct sockaddr_in *s = (struct sockaddr_in *)&sa;
-        if (ip) inet_ntop(AF_INET,(void*)&(s->sin_addr),ip,ip_len);
-        if (port) *port = ntohs(s->sin_port);
-    } else if (sa.ss_family == AF_INET6) {
-        struct sockaddr_in6 *s = (struct sockaddr_in6 *)&sa;
-        if (ip) inet_ntop(AF_INET6,(void*)&(s->sin6_addr),ip,ip_len);
-        if (port) *port = ntohs(s->sin6_port);
-    } else if (sa.ss_family == AF_UNIX) {
-        if (ip) snprintf(ip, ip_len, "/unixsocket");
-        if (port) *port = 0;
-    } else {
-        goto error;
-    }
-    return 0;
-
-error:
-    if (ip) {
-        if (ip_len >= 2) {
-            ip[0] = '?';
-            ip[1] = '\0';
-        } else if (ip_len == 1) {
-            ip[0] = '\0';
-        }
-    }
-    if (port) *port = 0;
-    return -1;
-}
-
-/* Format an IP,port pair into something easy to parse. If IP is IPv6
- * (matches for ":"), the ip is surrounded by []. IP and port are just
- * separated by colons. This the standard to display addresses within Redis. */
-int anetFormatAddr(char *buf, size_t buf_len, char *ip, int port) {
-    return snprintf(buf,buf_len, strchr(ip,':') ?
-           "[%s]:%d" : "%s:%d", ip, port);
-}
-
-/* Like anetFormatAddr() but extract ip and port from the socket's peer/sockname. */
-int anetFormatFdAddr(int fd, char *buf, size_t buf_len, int fd_to_str_type) {
-    char ip[INET6_ADDRSTRLEN];
-    int port;
-
-    anetFdToString(fd,ip,sizeof(ip),&port,fd_to_str_type);
-    return anetFormatAddr(buf, buf_len, ip, port);
-}
diff --git a/redis-stable/src/anet.h b/redis-stable/src/anet.h
deleted file mode 100644
index 2a685cc0..00000000
--- a/redis-stable/src/anet.h
+++ /dev/null
@@ -1,76 +0,0 @@
-/* anet.c -- Basic TCP socket stuff made a bit less boring
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef ANET_H
-#define ANET_H
-
-#include <sys/types.h>
-
-#define ANET_OK 0
-#define ANET_ERR -1
-#define ANET_ERR_LEN 256
-
-/* Flags used with certain functions. */
-#define ANET_NONE 0
-#define ANET_IP_ONLY (1<<0)
-
-#if defined(__sun) || defined(_AIX)
-#define AF_LOCAL AF_UNIX
-#endif
-
-#ifdef _AIX
-#undef ip_len
-#endif
-
-/* FD to address string conversion types */
-#define FD_TO_PEER_NAME 0
-#define FD_TO_SOCK_NAME 1
-
-int anetTcpNonBlockConnect(char *err, const char *addr, int port);
-int anetTcpNonBlockBestEffortBindConnect(char *err, const char *addr, int port, const char *source_addr);
-int anetResolve(char *err, char *host, char *ipbuf, size_t ipbuf_len, int flags);
-int anetTcpServer(char *err, int port, char *bindaddr, int backlog);
-int anetTcp6Server(char *err, int port, char *bindaddr, int backlog);
-int anetUnixServer(char *err, char *path, mode_t perm, int backlog);
-int anetTcpAccept(char *err, int serversock, char *ip, size_t ip_len, int *port);
-int anetUnixAccept(char *err, int serversock);
-int anetNonBlock(char *err, int fd);
-int anetBlock(char *err, int fd);
-int anetCloexec(int fd);
-int anetEnableTcpNoDelay(char *err, int fd);
-int anetDisableTcpNoDelay(char *err, int fd);
-int anetSendTimeout(char *err, int fd, long long ms);
-int anetRecvTimeout(char *err, int fd, long long ms);
-int anetFdToString(int fd, char *ip, size_t ip_len, int *port, int fd_to_str_type);
-int anetKeepAlive(char *err, int fd, int interval);
-int anetFormatAddr(char *fmt, size_t fmt_len, char *ip, int port);
-int anetFormatFdAddr(int fd, char *buf, size_t buf_len, int fd_to_str_type);
-
-#endif
diff --git a/redis-stable/src/aof.c b/redis-stable/src/aof.c
deleted file mode 100644
index 566a9864..00000000
--- a/redis-stable/src/aof.c
+++ /dev/null
@@ -1,2010 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "bio.h"
-#include "rio.h"
-
-#include <signal.h>
-#include <fcntl.h>
-#include <sys/stat.h>
-#include <sys/types.h>
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/wait.h>
-#include <sys/param.h>
-
-void aofUpdateCurrentSize(void);
-void aofClosePipes(void);
-
-/* ----------------------------------------------------------------------------
- * AOF rewrite buffer implementation.
- *
- * The following code implement a simple buffer used in order to accumulate
- * changes while the background process is rewriting the AOF file.
- *
- * We only need to append, but can't just use realloc with a large block
- * because 'huge' reallocs are not always handled as one could expect
- * (via remapping of pages at OS level) but may involve copying data.
- *
- * For this reason we use a list of blocks, every block is
- * AOF_RW_BUF_BLOCK_SIZE bytes.
- * ------------------------------------------------------------------------- */
-
-#define AOF_RW_BUF_BLOCK_SIZE (1024*1024*10)    /* 10 MB per block */
-
-typedef struct aofrwblock {
-    unsigned long used, free;
-    char buf[AOF_RW_BUF_BLOCK_SIZE];
-} aofrwblock;
-
-/* This function free the old AOF rewrite buffer if needed, and initialize
- * a fresh new one. It tests for server.aof_rewrite_buf_blocks equal to NULL
- * so can be used for the first initialization as well. */
-void aofRewriteBufferReset(void) {
-    if (server.aof_rewrite_buf_blocks)
-        listRelease(server.aof_rewrite_buf_blocks);
-
-    server.aof_rewrite_buf_blocks = listCreate();
-    listSetFreeMethod(server.aof_rewrite_buf_blocks,zfree);
-}
-
-/* Return the current size of the AOF rewrite buffer. */
-unsigned long aofRewriteBufferSize(void) {
-    listNode *ln;
-    listIter li;
-    unsigned long size = 0;
-
-    listRewind(server.aof_rewrite_buf_blocks,&li);
-    while((ln = listNext(&li))) {
-        aofrwblock *block = listNodeValue(ln);
-        size += block->used;
-    }
-    return size;
-}
-
-/* Event handler used to send data to the child process doing the AOF
- * rewrite. We send pieces of our AOF differences buffer so that the final
- * write when the child finishes the rewrite will be small. */
-void aofChildWriteDiffData(aeEventLoop *el, int fd, void *privdata, int mask) {
-    listNode *ln;
-    aofrwblock *block;
-    ssize_t nwritten;
-    UNUSED(el);
-    UNUSED(fd);
-    UNUSED(privdata);
-    UNUSED(mask);
-
-    while(1) {
-        ln = listFirst(server.aof_rewrite_buf_blocks);
-        block = ln ? ln->value : NULL;
-        if (server.aof_stop_sending_diff || !block) {
-            aeDeleteFileEvent(server.el,server.aof_pipe_write_data_to_child,
-                              AE_WRITABLE);
-            return;
-        }
-        if (block->used > 0) {
-            nwritten = write(server.aof_pipe_write_data_to_child,
-                             block->buf,block->used);
-            if (nwritten <= 0) return;
-            memmove(block->buf,block->buf+nwritten,block->used-nwritten);
-            block->used -= nwritten;
-            block->free += nwritten;
-        }
-        if (block->used == 0) listDelNode(server.aof_rewrite_buf_blocks,ln);
-    }
-}
-
-/* Append data to the AOF rewrite buffer, allocating new blocks if needed. */
-void aofRewriteBufferAppend(unsigned char *s, unsigned long len) {
-    listNode *ln = listLast(server.aof_rewrite_buf_blocks);
-    aofrwblock *block = ln ? ln->value : NULL;
-
-    while(len) {
-        /* If we already got at least an allocated block, try appending
-         * at least some piece into it. */
-        if (block) {
-            unsigned long thislen = (block->free < len) ? block->free : len;
-            if (thislen) {  /* The current block is not already full. */
-                memcpy(block->buf+block->used, s, thislen);
-                block->used += thislen;
-                block->free -= thislen;
-                s += thislen;
-                len -= thislen;
-            }
-        }
-
-        if (len) { /* First block to allocate, or need another block. */
-            int numblocks;
-
-            block = zmalloc(sizeof(*block));
-            block->free = AOF_RW_BUF_BLOCK_SIZE;
-            block->used = 0;
-            listAddNodeTail(server.aof_rewrite_buf_blocks,block);
-
-            /* Log every time we cross more 10 or 100 blocks, respectively
-             * as a notice or warning. */
-            numblocks = listLength(server.aof_rewrite_buf_blocks);
-            if (((numblocks+1) % 10) == 0) {
-                int level = ((numblocks+1) % 100) == 0 ? LL_WARNING :
-                                                         LL_NOTICE;
-                serverLog(level,"Background AOF buffer size: %lu MB",
-                    aofRewriteBufferSize()/(1024*1024));
-            }
-        }
-    }
-
-    /* Install a file event to send data to the rewrite child if there is
-     * not one already. */
-    if (!server.aof_stop_sending_diff &&
-        aeGetFileEvents(server.el,server.aof_pipe_write_data_to_child) == 0)
-    {
-        aeCreateFileEvent(server.el, server.aof_pipe_write_data_to_child,
-            AE_WRITABLE, aofChildWriteDiffData, NULL);
-    }
-}
-
-/* Write the buffer (possibly composed of multiple blocks) into the specified
- * fd. If a short write or any other error happens -1 is returned,
- * otherwise the number of bytes written is returned. */
-ssize_t aofRewriteBufferWrite(int fd) {
-    listNode *ln;
-    listIter li;
-    ssize_t count = 0;
-
-    listRewind(server.aof_rewrite_buf_blocks,&li);
-    while((ln = listNext(&li))) {
-        aofrwblock *block = listNodeValue(ln);
-        ssize_t nwritten;
-
-        if (block->used) {
-            nwritten = write(fd,block->buf,block->used);
-            if (nwritten != (ssize_t)block->used) {
-                if (nwritten == 0) errno = EIO;
-                return -1;
-            }
-            count += nwritten;
-        }
-    }
-    return count;
-}
-
-/* ----------------------------------------------------------------------------
- * AOF file implementation
- * ------------------------------------------------------------------------- */
-
-/* Return true if an AOf fsync is currently already in progress in a
- * BIO thread. */
-int aofFsyncInProgress(void) {
-    return bioPendingJobsOfType(BIO_AOF_FSYNC) != 0;
-}
-
-/* Starts a background task that performs fsync() against the specified
- * file descriptor (the one of the AOF file) in another thread. */
-void aof_background_fsync(int fd) {
-    bioCreateFsyncJob(fd);
-}
-
-/* Kills an AOFRW child process if exists */
-void killAppendOnlyChild(void) {
-    int statloc;
-    /* No AOFRW child? return. */
-    if (server.child_type != CHILD_TYPE_AOF) return;
-    /* Kill AOFRW child, wait for child exit. */
-    serverLog(LL_NOTICE,"Killing running AOF rewrite child: %ld",
-        (long) server.child_pid);
-    if (kill(server.child_pid,SIGUSR1) != -1) {
-        while(waitpid(-1, &statloc, 0) != server.child_pid);
-    }
-    /* Reset the buffer accumulating changes while the child saves. */
-    aofRewriteBufferReset();
-    aofRemoveTempFile(server.child_pid);
-    resetChildState();
-    server.aof_rewrite_time_start = -1;
-    /* Close pipes used for IPC between the two processes. */
-    aofClosePipes();
-}
-
-/* Called when the user switches from "appendonly yes" to "appendonly no"
- * at runtime using the CONFIG command. */
-void stopAppendOnly(void) {
-    serverAssert(server.aof_state != AOF_OFF);
-    flushAppendOnlyFile(1);
-    if (redis_fsync(server.aof_fd) == -1) {
-        serverLog(LL_WARNING,"Fail to fsync the AOF file: %s",strerror(errno));
-    } else {
-        server.aof_fsync_offset = server.aof_current_size;
-        server.aof_last_fsync = server.unixtime;
-    }
-    close(server.aof_fd);
-
-    server.aof_fd = -1;
-    server.aof_selected_db = -1;
-    server.aof_state = AOF_OFF;
-    server.aof_rewrite_scheduled = 0;
-    killAppendOnlyChild();
-    sdsfree(server.aof_buf);
-    server.aof_buf = sdsempty();
-}
-
-/* Called when the user switches from "appendonly no" to "appendonly yes"
- * at runtime using the CONFIG command. */
-int startAppendOnly(void) {
-    char cwd[MAXPATHLEN]; /* Current working dir path for error messages. */
-    int newfd;
-
-    newfd = open(server.aof_filename,O_WRONLY|O_APPEND|O_CREAT,0644);
-    serverAssert(server.aof_state == AOF_OFF);
-    if (newfd == -1) {
-        char *cwdp = getcwd(cwd,MAXPATHLEN);
-
-        serverLog(LL_WARNING,
-            "Redis needs to enable the AOF but can't open the "
-            "append only file %s (in server root dir %s): %s",
-            server.aof_filename,
-            cwdp ? cwdp : "unknown",
-            strerror(errno));
-        return C_ERR;
-    }
-    if (hasActiveChildProcess() && server.child_type != CHILD_TYPE_AOF) {
-        server.aof_rewrite_scheduled = 1;
-        serverLog(LL_WARNING,"AOF was enabled but there is already another background operation. An AOF background was scheduled to start when possible.");
-    } else {
-        /* If there is a pending AOF rewrite, we need to switch it off and
-         * start a new one: the old one cannot be reused because it is not
-         * accumulating the AOF buffer. */
-        if (server.child_type == CHILD_TYPE_AOF) {
-            serverLog(LL_WARNING,"AOF was enabled but there is already an AOF rewriting in background. Stopping background AOF and starting a rewrite now.");
-            killAppendOnlyChild();
-        }
-        if (rewriteAppendOnlyFileBackground() == C_ERR) {
-            close(newfd);
-            serverLog(LL_WARNING,"Redis needs to enable the AOF but can't trigger a background AOF rewrite operation. Check the above logs for more info about the error.");
-            return C_ERR;
-        }
-    }
-    /* We correctly switched on AOF, now wait for the rewrite to be complete
-     * in order to append data on disk. */
-    server.aof_state = AOF_WAIT_REWRITE;
-    server.aof_last_fsync = server.unixtime;
-    server.aof_fd = newfd;
-
-    /* If AOF fsync error in bio job, we just ignore it and log the event. */
-    int aof_bio_fsync_status;
-    atomicGet(server.aof_bio_fsync_status, aof_bio_fsync_status);
-    if (aof_bio_fsync_status == C_ERR) {
-        serverLog(LL_WARNING,
-            "AOF reopen, just ignore the AOF fsync error in bio job");
-        atomicSet(server.aof_bio_fsync_status,C_OK);
-    }
-
-    /* If AOF was in error state, we just ignore it and log the event. */
-    if (server.aof_last_write_status == C_ERR) {
-        serverLog(LL_WARNING,"AOF reopen, just ignore the last error.");
-        server.aof_last_write_status = C_OK;
-    }
-    return C_OK;
-}
-
-/* This is a wrapper to the write syscall in order to retry on short writes
- * or if the syscall gets interrupted. It could look strange that we retry
- * on short writes given that we are writing to a block device: normally if
- * the first call is short, there is a end-of-space condition, so the next
- * is likely to fail. However apparently in modern systems this is no longer
- * true, and in general it looks just more resilient to retry the write. If
- * there is an actual error condition we'll get it at the next try. */
-ssize_t aofWrite(int fd, const char *buf, size_t len) {
-    ssize_t nwritten = 0, totwritten = 0;
-
-    while(len) {
-        nwritten = write(fd, buf, len);
-
-        if (nwritten < 0) {
-            if (errno == EINTR) continue;
-            return totwritten ? totwritten : -1;
-        }
-
-        len -= nwritten;
-        buf += nwritten;
-        totwritten += nwritten;
-    }
-
-    return totwritten;
-}
-
-/* Write the append only file buffer on disk.
- *
- * Since we are required to write the AOF before replying to the client,
- * and the only way the client socket can get a write is entering when the
- * the event loop, we accumulate all the AOF writes in a memory
- * buffer and write it on disk using this function just before entering
- * the event loop again.
- *
- * About the 'force' argument:
- *
- * When the fsync policy is set to 'everysec' we may delay the flush if there
- * is still an fsync() going on in the background thread, since for instance
- * on Linux write(2) will be blocked by the background fsync anyway.
- * When this happens we remember that there is some aof buffer to be
- * flushed ASAP, and will try to do that in the serverCron() function.
- *
- * However if force is set to 1 we'll write regardless of the background
- * fsync. */
-#define AOF_WRITE_LOG_ERROR_RATE 30 /* Seconds between errors logging. */
-void flushAppendOnlyFile(int force) {
-    ssize_t nwritten;
-    int sync_in_progress = 0;
-    mstime_t latency;
-
-    if (sdslen(server.aof_buf) == 0) {
-        /* Check if we need to do fsync even the aof buffer is empty,
-         * because previously in AOF_FSYNC_EVERYSEC mode, fsync is
-         * called only when aof buffer is not empty, so if users
-         * stop write commands before fsync called in one second,
-         * the data in page cache cannot be flushed in time. */
-        if (server.aof_fsync == AOF_FSYNC_EVERYSEC &&
-            server.aof_fsync_offset != server.aof_current_size &&
-            server.unixtime > server.aof_last_fsync &&
-            !(sync_in_progress = aofFsyncInProgress())) {
-            goto try_fsync;
-        } else {
-            return;
-        }
-    }
-
-    if (server.aof_fsync == AOF_FSYNC_EVERYSEC)
-        sync_in_progress = aofFsyncInProgress();
-
-    if (server.aof_fsync == AOF_FSYNC_EVERYSEC && !force) {
-        /* With this append fsync policy we do background fsyncing.
-         * If the fsync is still in progress we can try to delay
-         * the write for a couple of seconds. */
-        if (sync_in_progress) {
-            if (server.aof_flush_postponed_start == 0) {
-                /* No previous write postponing, remember that we are
-                 * postponing the flush and return. */
-                server.aof_flush_postponed_start = server.unixtime;
-                return;
-            } else if (server.unixtime - server.aof_flush_postponed_start < 2) {
-                /* We were already waiting for fsync to finish, but for less
-                 * than two seconds this is still ok. Postpone again. */
-                return;
-            }
-            /* Otherwise fall trough, and go write since we can't wait
-             * over two seconds. */
-            server.aof_delayed_fsync++;
-            serverLog(LL_NOTICE,"Asynchronous AOF fsync is taking too long (disk is busy?). Writing the AOF buffer without waiting for fsync to complete, this may slow down Redis.");
-        }
-    }
-    /* We want to perform a single write. This should be guaranteed atomic
-     * at least if the filesystem we are writing is a real physical one.
-     * While this will save us against the server being killed I don't think
-     * there is much to do about the whole server stopping for power problems
-     * or alike */
-
-    if (server.aof_flush_sleep && sdslen(server.aof_buf)) {
-        usleep(server.aof_flush_sleep);
-    }
-
-    latencyStartMonitor(latency);
-    nwritten = aofWrite(server.aof_fd,server.aof_buf,sdslen(server.aof_buf));
-    latencyEndMonitor(latency);
-    /* We want to capture different events for delayed writes:
-     * when the delay happens with a pending fsync, or with a saving child
-     * active, and when the above two conditions are missing.
-     * We also use an additional event name to save all samples which is
-     * useful for graphing / monitoring purposes. */
-    if (sync_in_progress) {
-        latencyAddSampleIfNeeded("aof-write-pending-fsync",latency);
-    } else if (hasActiveChildProcess()) {
-        latencyAddSampleIfNeeded("aof-write-active-child",latency);
-    } else {
-        latencyAddSampleIfNeeded("aof-write-alone",latency);
-    }
-    latencyAddSampleIfNeeded("aof-write",latency);
-
-    /* We performed the write so reset the postponed flush sentinel to zero. */
-    server.aof_flush_postponed_start = 0;
-
-    if (nwritten != (ssize_t)sdslen(server.aof_buf)) {
-        static time_t last_write_error_log = 0;
-        int can_log = 0;
-
-        /* Limit logging rate to 1 line per AOF_WRITE_LOG_ERROR_RATE seconds. */
-        if ((server.unixtime - last_write_error_log) > AOF_WRITE_LOG_ERROR_RATE) {
-            can_log = 1;
-            last_write_error_log = server.unixtime;
-        }
-
-        /* Log the AOF write error and record the error code. */
-        if (nwritten == -1) {
-            if (can_log) {
-                serverLog(LL_WARNING,"Error writing to the AOF file: %s",
-                    strerror(errno));
-                server.aof_last_write_errno = errno;
-            }
-        } else {
-            if (can_log) {
-                serverLog(LL_WARNING,"Short write while writing to "
-                                       "the AOF file: (nwritten=%lld, "
-                                       "expected=%lld)",
-                                       (long long)nwritten,
-                                       (long long)sdslen(server.aof_buf));
-            }
-
-            if (ftruncate(server.aof_fd, server.aof_current_size) == -1) {
-                if (can_log) {
-                    serverLog(LL_WARNING, "Could not remove short write "
-                             "from the append-only file.  Redis may refuse "
-                             "to load the AOF the next time it starts.  "
-                             "ftruncate: %s", strerror(errno));
-                }
-            } else {
-                /* If the ftruncate() succeeded we can set nwritten to
-                 * -1 since there is no longer partial data into the AOF. */
-                nwritten = -1;
-            }
-            server.aof_last_write_errno = ENOSPC;
-        }
-
-        /* Handle the AOF write error. */
-        if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
-            /* We can't recover when the fsync policy is ALWAYS since the reply
-             * for the client is already in the output buffers (both writes and
-             * reads), and the changes to the db can't be rolled back. Since we
-             * have a contract with the user that on acknowledged or observed
-             * writes are is synced on disk, we must exit. */
-            serverLog(LL_WARNING,"Can't recover from AOF write error when the AOF fsync policy is 'always'. Exiting...");
-            exit(1);
-        } else {
-            /* Recover from failed write leaving data into the buffer. However
-             * set an error to stop accepting writes as long as the error
-             * condition is not cleared. */
-            server.aof_last_write_status = C_ERR;
-
-            /* Trim the sds buffer if there was a partial write, and there
-             * was no way to undo it with ftruncate(2). */
-            if (nwritten > 0) {
-                server.aof_current_size += nwritten;
-                sdsrange(server.aof_buf,nwritten,-1);
-            }
-            return; /* We'll try again on the next call... */
-        }
-    } else {
-        /* Successful write(2). If AOF was in error state, restore the
-         * OK state and log the event. */
-        if (server.aof_last_write_status == C_ERR) {
-            serverLog(LL_WARNING,
-                "AOF write error looks solved, Redis can write again.");
-            server.aof_last_write_status = C_OK;
-        }
-    }
-    server.aof_current_size += nwritten;
-
-    /* Re-use AOF buffer when it is small enough. The maximum comes from the
-     * arena size of 4k minus some overhead (but is otherwise arbitrary). */
-    if ((sdslen(server.aof_buf)+sdsavail(server.aof_buf)) < 4000) {
-        sdsclear(server.aof_buf);
-    } else {
-        sdsfree(server.aof_buf);
-        server.aof_buf = sdsempty();
-    }
-
-try_fsync:
-    /* Don't fsync if no-appendfsync-on-rewrite is set to yes and there are
-     * children doing I/O in the background. */
-    if (server.aof_no_fsync_on_rewrite && hasActiveChildProcess())
-        return;
-
-    /* Perform the fsync if needed. */
-    if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
-        /* redis_fsync is defined as fdatasync() for Linux in order to avoid
-         * flushing metadata. */
-        latencyStartMonitor(latency);
-        /* Let's try to get this data on the disk. To guarantee data safe when
-         * the AOF fsync policy is 'always', we should exit if failed to fsync
-         * AOF (see comment next to the exit(1) after write error above). */
-        if (redis_fsync(server.aof_fd) == -1) {
-            serverLog(LL_WARNING,"Can't persist AOF for fsync error when the "
-              "AOF fsync policy is 'always': %s. Exiting...", strerror(errno));
-            exit(1);
-        }
-        latencyEndMonitor(latency);
-        latencyAddSampleIfNeeded("aof-fsync-always",latency);
-        server.aof_fsync_offset = server.aof_current_size;
-        server.aof_last_fsync = server.unixtime;
-    } else if ((server.aof_fsync == AOF_FSYNC_EVERYSEC &&
-                server.unixtime > server.aof_last_fsync)) {
-        if (!sync_in_progress) {
-            aof_background_fsync(server.aof_fd);
-            server.aof_fsync_offset = server.aof_current_size;
-        }
-        server.aof_last_fsync = server.unixtime;
-    }
-}
-
-sds catAppendOnlyGenericCommand(sds dst, int argc, robj **argv) {
-    char buf[32];
-    int len, j;
-    robj *o;
-
-    buf[0] = '*';
-    len = 1+ll2string(buf+1,sizeof(buf)-1,argc);
-    buf[len++] = '\r';
-    buf[len++] = '\n';
-    dst = sdscatlen(dst,buf,len);
-
-    for (j = 0; j < argc; j++) {
-        o = getDecodedObject(argv[j]);
-        buf[0] = '$';
-        len = 1+ll2string(buf+1,sizeof(buf)-1,sdslen(o->ptr));
-        buf[len++] = '\r';
-        buf[len++] = '\n';
-        dst = sdscatlen(dst,buf,len);
-        dst = sdscatlen(dst,o->ptr,sdslen(o->ptr));
-        dst = sdscatlen(dst,"\r\n",2);
-        decrRefCount(o);
-    }
-    return dst;
-}
-
-/* Create the sds representation of a PEXPIREAT command, using
- * 'seconds' as time to live and 'cmd' to understand what command
- * we are translating into a PEXPIREAT.
- *
- * This command is used in order to translate EXPIRE and PEXPIRE commands
- * into PEXPIREAT command so that we retain precision in the append only
- * file, and the time is always absolute and not relative. */
-sds catAppendOnlyExpireAtCommand(sds buf, struct redisCommand *cmd, robj *key, robj *seconds) {
-    long long when;
-    robj *argv[3];
-
-    /* Make sure we can use strtoll */
-    seconds = getDecodedObject(seconds);
-    when = strtoll(seconds->ptr,NULL,10);
-    /* Convert argument into milliseconds for EXPIRE, SETEX, EXPIREAT */
-    if (cmd->proc == expireCommand || cmd->proc == setexCommand ||
-        cmd->proc == expireatCommand)
-    {
-        when *= 1000;
-    }
-    /* Convert into absolute time for EXPIRE, PEXPIRE, SETEX, PSETEX */
-    if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||
-        cmd->proc == setexCommand || cmd->proc == psetexCommand)
-    {
-        when += mstime();
-    }
-    decrRefCount(seconds);
-
-    argv[0] = shared.pexpireat;
-    argv[1] = key;
-    argv[2] = createStringObjectFromLongLong(when);
-    buf = catAppendOnlyGenericCommand(buf, 3, argv);
-    decrRefCount(argv[2]);
-    return buf;
-}
-
-void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc) {
-    sds buf = sdsempty();
-    /* The DB this command was targeting is not the same as the last command
-     * we appended. To issue a SELECT command is needed. */
-    if (dictid != server.aof_selected_db) {
-        char seldb[64];
-
-        snprintf(seldb,sizeof(seldb),"%d",dictid);
-        buf = sdscatprintf(buf,"*2\r\n$6\r\nSELECT\r\n$%lu\r\n%s\r\n",
-            (unsigned long)strlen(seldb),seldb);
-        server.aof_selected_db = dictid;
-    }
-
-    if (cmd->proc == expireCommand || cmd->proc == pexpireCommand ||
-        cmd->proc == expireatCommand) {
-        /* Translate EXPIRE/PEXPIRE/EXPIREAT into PEXPIREAT */
-        buf = catAppendOnlyExpireAtCommand(buf,cmd,argv[1],argv[2]);
-    } else if (cmd->proc == setCommand && argc > 3) {
-        robj *pxarg = NULL;
-        /* When SET is used with EX/PX argument setGenericCommand propagates them with PX millisecond argument.
-         * So since the command arguments are re-written there, we can rely here on the index of PX being 3. */
-        if (!strcasecmp(argv[3]->ptr, "px")) {
-            pxarg = argv[4];
-        }
-        /* For AOF we convert SET key value relative time in milliseconds to SET key value absolute time in
-         * millisecond. Whenever the condition is true it implies that original SET has been transformed
-         * to SET PX with millisecond time argument so we do not need to worry about unit here.*/
-        if (pxarg) {
-            robj *millisecond = getDecodedObject(pxarg);
-            long long when = strtoll(millisecond->ptr,NULL,10);
-            when += mstime();
-
-            decrRefCount(millisecond);
-
-            robj *newargs[5];
-            newargs[0] = argv[0];
-            newargs[1] = argv[1];
-            newargs[2] = argv[2];
-            newargs[3] = shared.pxat;
-            newargs[4] = createStringObjectFromLongLong(when);
-            buf = catAppendOnlyGenericCommand(buf,5,newargs);
-            decrRefCount(newargs[4]);
-        } else {
-            buf = catAppendOnlyGenericCommand(buf,argc,argv);
-        }
-    } else {
-        /* All the other commands don't need translation or need the
-         * same translation already operated in the command vector
-         * for the replication itself. */
-        buf = catAppendOnlyGenericCommand(buf,argc,argv);
-    }
-
-    /* Append to the AOF buffer. This will be flushed on disk just before
-     * of re-entering the event loop, so before the client will get a
-     * positive reply about the operation performed. */
-    if (server.aof_state == AOF_ON)
-        server.aof_buf = sdscatlen(server.aof_buf,buf,sdslen(buf));
-
-    /* If a background append only file rewriting is in progress we want to
-     * accumulate the differences between the child DB and the current one
-     * in a buffer, so that when the child process will do its work we
-     * can append the differences to the new append only file. */
-    if (server.child_type == CHILD_TYPE_AOF)
-        aofRewriteBufferAppend((unsigned char*)buf,sdslen(buf));
-
-    sdsfree(buf);
-}
-
-/* ----------------------------------------------------------------------------
- * AOF loading
- * ------------------------------------------------------------------------- */
-
-/* In Redis commands are always executed in the context of a client, so in
- * order to load the append only file we need to create a fake client. */
-struct client *createAOFClient(void) {
-    struct client *c = zmalloc(sizeof(*c));
-
-    selectDb(c,0);
-    c->id = CLIENT_ID_AOF; /* So modules can identify it's the AOF client. */
-    c->conn = NULL;
-    c->name = NULL;
-    c->querybuf = sdsempty();
-    c->querybuf_peak = 0;
-    c->argc = 0;
-    c->argv = NULL;
-    c->original_argc = 0;
-    c->original_argv = NULL;
-    c->argv_len_sum = 0;
-    c->bufpos = 0;
-
-    /*
-     * The AOF client should never be blocked (unlike master
-     * replication connection).
-     * This is because blocking the AOF client might cause
-     * deadlock (because potentially no one will unblock it).
-     * Also, if the AOF client will be blocked just for
-     * background processing there is a chance that the
-     * command execution order will be violated.
-     */
-    c->flags = CLIENT_DENY_BLOCKING;
-
-    c->btype = BLOCKED_NONE;
-    /* We set the fake client as a slave waiting for the synchronization
-     * so that Redis will not try to send replies to this client. */
-    c->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
-    c->reply = listCreate();
-    c->reply_bytes = 0;
-    c->obuf_soft_limit_reached_time = 0;
-    c->watched_keys = listCreate();
-    c->peerid = NULL;
-    c->sockname = NULL;
-    c->resp = 2;
-    c->user = NULL;
-    listSetFreeMethod(c->reply,freeClientReplyValue);
-    listSetDupMethod(c->reply,dupClientReplyValue);
-    initClientMultiState(c);
-    return c;
-}
-
-void freeFakeClientArgv(struct client *c) {
-    int j;
-
-    for (j = 0; j < c->argc; j++)
-        decrRefCount(c->argv[j]);
-    zfree(c->argv);
-    c->argv_len_sum = 0;
-}
-
-void freeFakeClient(struct client *c) {
-    sdsfree(c->querybuf);
-    listRelease(c->reply);
-    listRelease(c->watched_keys);
-    freeClientMultiState(c);
-    freeClientOriginalArgv(c);
-    zfree(c);
-}
-
-/* Replay the append log file. On success C_OK is returned. On non fatal
- * error (the append only file is zero-length) C_ERR is returned. On
- * fatal error an error message is logged and the program exists. */
-int loadAppendOnlyFile(char *filename) {
-    struct client *fakeClient;
-    FILE *fp = fopen(filename,"r");
-    struct redis_stat sb;
-    int old_aof_state = server.aof_state;
-    long loops = 0;
-    off_t valid_up_to = 0; /* Offset of latest well-formed command loaded. */
-    off_t valid_before_multi = 0; /* Offset before MULTI command loaded. */
-
-    if (fp == NULL) {
-        serverLog(LL_WARNING,"Fatal error: can't open the append log file for reading: %s",strerror(errno));
-        exit(1);
-    }
-
-    /* Handle a zero-length AOF file as a special case. An empty AOF file
-     * is a valid AOF because an empty server with AOF enabled will create
-     * a zero length file at startup, that will remain like that if no write
-     * operation is received. */
-    if (fp && redis_fstat(fileno(fp),&sb) != -1 && sb.st_size == 0) {
-        server.aof_current_size = 0;
-        server.aof_fsync_offset = server.aof_current_size;
-        fclose(fp);
-        return C_ERR;
-    }
-
-    /* Temporarily disable AOF, to prevent EXEC from feeding a MULTI
-     * to the same file we're about to read. */
-    server.aof_state = AOF_OFF;
-
-    fakeClient = createAOFClient();
-    startLoadingFile(fp, filename, RDBFLAGS_AOF_PREAMBLE);
-
-    /* Check if this AOF file has an RDB preamble. In that case we need to
-     * load the RDB file and later continue loading the AOF tail. */
-    char sig[5]; /* "REDIS" */
-    if (fread(sig,1,5,fp) != 5 || memcmp(sig,"REDIS",5) != 0) {
-        /* No RDB preamble, seek back at 0 offset. */
-        if (fseek(fp,0,SEEK_SET) == -1) goto readerr;
-    } else {
-        /* RDB preamble. Pass loading the RDB functions. */
-        rio rdb;
-
-        serverLog(LL_NOTICE,"Reading RDB preamble from AOF file...");
-        if (fseek(fp,0,SEEK_SET) == -1) goto readerr;
-        rioInitWithFile(&rdb,fp);
-        if (rdbLoadRio(&rdb,RDBFLAGS_AOF_PREAMBLE,NULL) != C_OK) {
-            serverLog(LL_WARNING,"Error reading the RDB preamble of the AOF file, AOF loading aborted");
-            goto readerr;
-        } else {
-            serverLog(LL_NOTICE,"Reading the remaining AOF tail...");
-        }
-    }
-
-    /* Read the actual AOF file, in REPL format, command by command. */
-    while(1) {
-        int argc, j;
-        unsigned long len;
-        robj **argv;
-        char buf[128];
-        sds argsds;
-        struct redisCommand *cmd;
-
-        /* Serve the clients from time to time */
-        if (!(loops++ % 1000)) {
-            loadingProgress(ftello(fp));
-            processEventsWhileBlocked();
-            processModuleLoadingProgressEvent(1);
-        }
-
-        if (fgets(buf,sizeof(buf),fp) == NULL) {
-            if (feof(fp))
-                break;
-            else
-                goto readerr;
-        }
-        if (buf[0] != '*') goto fmterr;
-        if (buf[1] == '\0') goto readerr;
-        argc = atoi(buf+1);
-        if (argc < 1) goto fmterr;
-
-        /* Load the next command in the AOF as our fake client
-         * argv. */
-        argv = zmalloc(sizeof(robj*)*argc);
-        fakeClient->argc = argc;
-        fakeClient->argv = argv;
-
-        for (j = 0; j < argc; j++) {
-            /* Parse the argument len. */
-            char *readres = fgets(buf,sizeof(buf),fp);
-            if (readres == NULL || buf[0] != '$') {
-                fakeClient->argc = j; /* Free up to j-1. */
-                freeFakeClientArgv(fakeClient);
-                if (readres == NULL)
-                    goto readerr;
-                else
-                    goto fmterr;
-            }
-            len = strtol(buf+1,NULL,10);
-
-            /* Read it into a string object. */
-            argsds = sdsnewlen(SDS_NOINIT,len);
-            if (len && fread(argsds,len,1,fp) == 0) {
-                sdsfree(argsds);
-                fakeClient->argc = j; /* Free up to j-1. */
-                freeFakeClientArgv(fakeClient);
-                goto readerr;
-            }
-            argv[j] = createObject(OBJ_STRING,argsds);
-
-            /* Discard CRLF. */
-            if (fread(buf,2,1,fp) == 0) {
-                fakeClient->argc = j+1; /* Free up to j. */
-                freeFakeClientArgv(fakeClient);
-                goto readerr;
-            }
-        }
-
-        /* Command lookup */
-        cmd = lookupCommand(argv[0]->ptr);
-        if (!cmd) {
-            serverLog(LL_WARNING,
-                "Unknown command '%s' reading the append only file",
-                (char*)argv[0]->ptr);
-            exit(1);
-        }
-
-        if (cmd == server.multiCommand) valid_before_multi = valid_up_to;
-
-        /* Run the command in the context of a fake client */
-        fakeClient->cmd = fakeClient->lastcmd = cmd;
-        if (fakeClient->flags & CLIENT_MULTI &&
-            fakeClient->cmd->proc != execCommand)
-        {
-            queueMultiCommand(fakeClient);
-        } else {
-            cmd->proc(fakeClient);
-        }
-
-        /* The fake client should not have a reply */
-        serverAssert(fakeClient->bufpos == 0 &&
-                     listLength(fakeClient->reply) == 0);
-
-        /* The fake client should never get blocked */
-        serverAssert((fakeClient->flags & CLIENT_BLOCKED) == 0);
-
-        /* Clean up. Command code may have changed argv/argc so we use the
-         * argv/argc of the client instead of the local variables. */
-        freeFakeClientArgv(fakeClient);
-        fakeClient->cmd = NULL;
-        if (server.aof_load_truncated) valid_up_to = ftello(fp);
-        if (server.key_load_delay)
-            debugDelay(server.key_load_delay);
-    }
-
-    /* This point can only be reached when EOF is reached without errors.
-     * If the client is in the middle of a MULTI/EXEC, handle it as it was
-     * a short read, even if technically the protocol is correct: we want
-     * to remove the unprocessed tail and continue. */
-    if (fakeClient->flags & CLIENT_MULTI) {
-        serverLog(LL_WARNING,
-            "Revert incomplete MULTI/EXEC transaction in AOF file");
-        valid_up_to = valid_before_multi;
-        goto uxeof;
-    }
-
-loaded_ok: /* DB loaded, cleanup and return C_OK to the caller. */
-    fclose(fp);
-    freeFakeClient(fakeClient);
-    server.aof_state = old_aof_state;
-    stopLoading(1);
-    aofUpdateCurrentSize();
-    server.aof_rewrite_base_size = server.aof_current_size;
-    server.aof_fsync_offset = server.aof_current_size;
-    return C_OK;
-
-readerr: /* Read error. If feof(fp) is true, fall through to unexpected EOF. */
-    if (!feof(fp)) {
-        if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
-        fclose(fp);
-        serverLog(LL_WARNING,"Unrecoverable error reading the append only file: %s", strerror(errno));
-        exit(1);
-    }
-
-uxeof: /* Unexpected AOF end of file. */
-    if (server.aof_load_truncated) {
-        serverLog(LL_WARNING,"!!! Warning: short read while loading the AOF file !!!");
-        serverLog(LL_WARNING,"!!! Truncating the AOF at offset %llu !!!",
-            (unsigned long long) valid_up_to);
-        if (valid_up_to == -1 || truncate(filename,valid_up_to) == -1) {
-            if (valid_up_to == -1) {
-                serverLog(LL_WARNING,"Last valid command offset is invalid");
-            } else {
-                serverLog(LL_WARNING,"Error truncating the AOF file: %s",
-                    strerror(errno));
-            }
-        } else {
-            /* Make sure the AOF file descriptor points to the end of the
-             * file after the truncate call. */
-            if (server.aof_fd != -1 && lseek(server.aof_fd,0,SEEK_END) == -1) {
-                serverLog(LL_WARNING,"Can't seek the end of the AOF file: %s",
-                    strerror(errno));
-            } else {
-                serverLog(LL_WARNING,
-                    "AOF loaded anyway because aof-load-truncated is enabled");
-                goto loaded_ok;
-            }
-        }
-    }
-    if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
-    fclose(fp);
-    serverLog(LL_WARNING,"Unexpected end of file reading the append only file. You can: 1) Make a backup of your AOF file, then use ./redis-check-aof --fix <filename>. 2) Alternatively you can set the 'aof-load-truncated' configuration option to yes and restart the server.");
-    exit(1);
-
-fmterr: /* Format error. */
-    if (fakeClient) freeFakeClient(fakeClient); /* avoid valgrind warning */
-    fclose(fp);
-    serverLog(LL_WARNING,"Bad file format reading the append only file: make a backup of your AOF file, then use ./redis-check-aof --fix <filename>");
-    exit(1);
-}
-
-/* ----------------------------------------------------------------------------
- * AOF rewrite
- * ------------------------------------------------------------------------- */
-
-/* Delegate writing an object to writing a bulk string or bulk long long.
- * This is not placed in rio.c since that adds the server.h dependency. */
-int rioWriteBulkObject(rio *r, robj *obj) {
-    /* Avoid using getDecodedObject to help copy-on-write (we are often
-     * in a child process when this function is called). */
-    if (obj->encoding == OBJ_ENCODING_INT) {
-        return rioWriteBulkLongLong(r,(long)obj->ptr);
-    } else if (sdsEncodedObject(obj)) {
-        return rioWriteBulkString(r,obj->ptr,sdslen(obj->ptr));
-    } else {
-        serverPanic("Unknown string encoding");
-    }
-}
-
-/* Emit the commands needed to rebuild a list object.
- * The function returns 0 on error, 1 on success. */
-int rewriteListObject(rio *r, robj *key, robj *o) {
-    long long count = 0, items = listTypeLength(o);
-
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklist *list = o->ptr;
-        quicklistIter *li = quicklistGetIterator(list, AL_START_HEAD);
-        quicklistEntry entry;
-
-        while (quicklistNext(li,&entry)) {
-            if (count == 0) {
-                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                    AOF_REWRITE_ITEMS_PER_CMD : items;
-                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
-                    !rioWriteBulkString(r,"RPUSH",5) ||
-                    !rioWriteBulkObject(r,key)) 
-                {
-                    quicklistReleaseIterator(li);
-                    return 0;
-                }
-            }
-
-            if (entry.value) {
-                if (!rioWriteBulkString(r,(char*)entry.value,entry.sz)) {
-                    quicklistReleaseIterator(li);
-                    return 0;
-                }
-            } else {
-                if (!rioWriteBulkLongLong(r,entry.longval)) {
-                    quicklistReleaseIterator(li);
-                    return 0;
-                }
-            }
-            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-            items--;
-        }
-        quicklistReleaseIterator(li);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-    return 1;
-}
-
-/* Emit the commands needed to rebuild a set object.
- * The function returns 0 on error, 1 on success. */
-int rewriteSetObject(rio *r, robj *key, robj *o) {
-    long long count = 0, items = setTypeSize(o);
-
-    if (o->encoding == OBJ_ENCODING_INTSET) {
-        int ii = 0;
-        int64_t llval;
-
-        while(intsetGet(o->ptr,ii++,&llval)) {
-            if (count == 0) {
-                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                    AOF_REWRITE_ITEMS_PER_CMD : items;
-
-                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
-                    !rioWriteBulkString(r,"SADD",4) ||
-                    !rioWriteBulkObject(r,key)) 
-                {
-                    return 0;
-                }
-            }
-            if (!rioWriteBulkLongLong(r,llval)) return 0;
-            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-            items--;
-        }
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        dictIterator *di = dictGetIterator(o->ptr);
-        dictEntry *de;
-
-        while((de = dictNext(di)) != NULL) {
-            sds ele = dictGetKey(de);
-            if (count == 0) {
-                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                    AOF_REWRITE_ITEMS_PER_CMD : items;
-
-                if (!rioWriteBulkCount(r,'*',2+cmd_items) ||
-                    !rioWriteBulkString(r,"SADD",4) ||
-                    !rioWriteBulkObject(r,key)) 
-                {
-                    dictReleaseIterator(di);
-                    return 0;
-                }
-            }
-            if (!rioWriteBulkString(r,ele,sdslen(ele))) {
-                dictReleaseIterator(di);
-                return 0;          
-            }
-            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-            items--;
-        }
-        dictReleaseIterator(di);
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return 1;
-}
-
-/* Emit the commands needed to rebuild a sorted set object.
- * The function returns 0 on error, 1 on success. */
-int rewriteSortedSetObject(rio *r, robj *key, robj *o) {
-    long long count = 0, items = zsetLength(o);
-
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = o->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vll;
-        double score;
-
-        eptr = ziplistIndex(zl,0);
-        serverAssert(eptr != NULL);
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-
-        while (eptr != NULL) {
-            serverAssert(ziplistGet(eptr,&vstr,&vlen,&vll));
-            score = zzlGetScore(sptr);
-
-            if (count == 0) {
-                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                    AOF_REWRITE_ITEMS_PER_CMD : items;
-
-                if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
-                    !rioWriteBulkString(r,"ZADD",4) ||
-                    !rioWriteBulkObject(r,key)) 
-                {
-                    return 0;
-                }
-            }
-            if (!rioWriteBulkDouble(r,score)) return 0;
-            if (vstr != NULL) {
-                if (!rioWriteBulkString(r,(char*)vstr,vlen)) return 0;
-            } else {
-                if (!rioWriteBulkLongLong(r,vll)) return 0;
-            }
-            zzlNext(zl,&eptr,&sptr);
-            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-            items--;
-        }
-    } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = o->ptr;
-        dictIterator *di = dictGetIterator(zs->dict);
-        dictEntry *de;
-
-        while((de = dictNext(di)) != NULL) {
-            sds ele = dictGetKey(de);
-            double *score = dictGetVal(de);
-
-            if (count == 0) {
-                int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                    AOF_REWRITE_ITEMS_PER_CMD : items;
-
-                if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
-                    !rioWriteBulkString(r,"ZADD",4) ||
-                    !rioWriteBulkObject(r,key)) 
-                {
-                    dictReleaseIterator(di);
-                    return 0;
-                }
-            }
-            if (!rioWriteBulkDouble(r,*score) ||
-                !rioWriteBulkString(r,ele,sdslen(ele)))
-            {
-                dictReleaseIterator(di);
-                return 0;
-            }
-            if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-            items--;
-        }
-        dictReleaseIterator(di);
-    } else {
-        serverPanic("Unknown sorted zset encoding");
-    }
-    return 1;
-}
-
-/* Write either the key or the value of the currently selected item of a hash.
- * The 'hi' argument passes a valid Redis hash iterator.
- * The 'what' filed specifies if to write a key or a value and can be
- * either OBJ_HASH_KEY or OBJ_HASH_VALUE.
- *
- * The function returns 0 on error, non-zero on success. */
-static int rioWriteHashIteratorCursor(rio *r, hashTypeIterator *hi, int what) {
-    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *vstr = NULL;
-        unsigned int vlen = UINT_MAX;
-        long long vll = LLONG_MAX;
-
-        hashTypeCurrentFromZiplist(hi, what, &vstr, &vlen, &vll);
-        if (vstr)
-            return rioWriteBulkString(r, (char*)vstr, vlen);
-        else
-            return rioWriteBulkLongLong(r, vll);
-    } else if (hi->encoding == OBJ_ENCODING_HT) {
-        sds value = hashTypeCurrentFromHashTable(hi, what);
-        return rioWriteBulkString(r, value, sdslen(value));
-    }
-
-    serverPanic("Unknown hash encoding");
-    return 0;
-}
-
-/* Emit the commands needed to rebuild a hash object.
- * The function returns 0 on error, 1 on success. */
-int rewriteHashObject(rio *r, robj *key, robj *o) {
-    hashTypeIterator *hi;
-    long long count = 0, items = hashTypeLength(o);
-
-    hi = hashTypeInitIterator(o);
-    while (hashTypeNext(hi) != C_ERR) {
-        if (count == 0) {
-            int cmd_items = (items > AOF_REWRITE_ITEMS_PER_CMD) ?
-                AOF_REWRITE_ITEMS_PER_CMD : items;
-
-            if (!rioWriteBulkCount(r,'*',2+cmd_items*2) ||
-                !rioWriteBulkString(r,"HMSET",5) ||
-                !rioWriteBulkObject(r,key)) 
-            {
-                hashTypeReleaseIterator(hi);
-                return 0;
-            }
-        }
-
-        if (!rioWriteHashIteratorCursor(r, hi, OBJ_HASH_KEY) ||
-            !rioWriteHashIteratorCursor(r, hi, OBJ_HASH_VALUE))
-        {
-            hashTypeReleaseIterator(hi);
-            return 0;           
-        }
-        if (++count == AOF_REWRITE_ITEMS_PER_CMD) count = 0;
-        items--;
-    }
-
-    hashTypeReleaseIterator(hi);
-
-    return 1;
-}
-
-/* Helper for rewriteStreamObject() that generates a bulk string into the
- * AOF representing the ID 'id'. */
-int rioWriteBulkStreamID(rio *r,streamID *id) {
-    int retval;
-
-    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
-    retval = rioWriteBulkString(r,replyid,sdslen(replyid));
-    sdsfree(replyid);
-    return retval;
-}
-
-/* Helper for rewriteStreamObject(): emit the XCLAIM needed in order to
- * add the message described by 'nack' having the id 'rawid', into the pending
- * list of the specified consumer. All this in the context of the specified
- * key and group. */
-int rioWriteStreamPendingEntry(rio *r, robj *key, const char *groupname, size_t groupname_len, streamConsumer *consumer, unsigned char *rawid, streamNACK *nack) {
-     /* XCLAIM <key> <group> <consumer> 0 <id> TIME <milliseconds-unix-time>
-               RETRYCOUNT <count> JUSTID FORCE. */
-    streamID id;
-    streamDecodeID(rawid,&id);
-    if (rioWriteBulkCount(r,'*',12) == 0) return 0;
-    if (rioWriteBulkString(r,"XCLAIM",6) == 0) return 0;
-    if (rioWriteBulkObject(r,key) == 0) return 0;
-    if (rioWriteBulkString(r,groupname,groupname_len) == 0) return 0;
-    if (rioWriteBulkString(r,consumer->name,sdslen(consumer->name)) == 0) return 0;
-    if (rioWriteBulkString(r,"0",1) == 0) return 0;
-    if (rioWriteBulkStreamID(r,&id) == 0) return 0;
-    if (rioWriteBulkString(r,"TIME",4) == 0) return 0;
-    if (rioWriteBulkLongLong(r,nack->delivery_time) == 0) return 0;
-    if (rioWriteBulkString(r,"RETRYCOUNT",10) == 0) return 0;
-    if (rioWriteBulkLongLong(r,nack->delivery_count) == 0) return 0;
-    if (rioWriteBulkString(r,"JUSTID",6) == 0) return 0;
-    if (rioWriteBulkString(r,"FORCE",5) == 0) return 0;
-    return 1;
-}
-
-/* Helper for rewriteStreamObject(): emit the XGROUP CREATECONSUMER is
- * needed in order to create consumers that do not have any pending entries.
- * All this in the context of the specified key and group. */
-int rioWriteStreamEmptyConsumer(rio *r, robj *key, const char *groupname, size_t groupname_len, streamConsumer *consumer) {
-    /* XGROUP CREATECONSUMER <key> <group> <consumer> */
-    if (rioWriteBulkCount(r,'*',5) == 0) return 0;
-    if (rioWriteBulkString(r,"XGROUP",6) == 0) return 0;
-    if (rioWriteBulkString(r,"CREATECONSUMER",14) == 0) return 0;
-    if (rioWriteBulkObject(r,key) == 0) return 0;
-    if (rioWriteBulkString(r,groupname,groupname_len) == 0) return 0;
-    if (rioWriteBulkString(r,consumer->name,sdslen(consumer->name)) == 0) return 0;
-    return 1;
-}
-
-/* Emit the commands needed to rebuild a stream object.
- * The function returns 0 on error, 1 on success. */
-int rewriteStreamObject(rio *r, robj *key, robj *o) {
-    stream *s = o->ptr;
-    streamIterator si;
-    streamIteratorStart(&si,s,NULL,NULL,0);
-    streamID id;
-    int64_t numfields;
-
-    if (s->length) {
-        /* Reconstruct the stream data using XADD commands. */
-        while(streamIteratorGetID(&si,&id,&numfields)) {
-            /* Emit a two elements array for each item. The first is
-             * the ID, the second is an array of field-value pairs. */
-
-            /* Emit the XADD <key> <id> ...fields... command. */
-            if (!rioWriteBulkCount(r,'*',3+numfields*2) || 
-                !rioWriteBulkString(r,"XADD",4) ||
-                !rioWriteBulkObject(r,key) ||
-                !rioWriteBulkStreamID(r,&id)) 
-            {
-                streamIteratorStop(&si);
-                return 0;
-            }
-            while(numfields--) {
-                unsigned char *field, *value;
-                int64_t field_len, value_len;
-                streamIteratorGetField(&si,&field,&value,&field_len,&value_len);
-                if (!rioWriteBulkString(r,(char*)field,field_len) ||
-                    !rioWriteBulkString(r,(char*)value,value_len)) 
-                {
-                    streamIteratorStop(&si);
-                    return 0;                  
-                }
-            }
-        }
-    } else {
-        /* Use the XADD MAXLEN 0 trick to generate an empty stream if
-         * the key we are serializing is an empty string, which is possible
-         * for the Stream type. */
-        id.ms = 0; id.seq = 1; 
-        if (!rioWriteBulkCount(r,'*',7) ||
-            !rioWriteBulkString(r,"XADD",4) ||
-            !rioWriteBulkObject(r,key) ||
-            !rioWriteBulkString(r,"MAXLEN",6) ||
-            !rioWriteBulkString(r,"0",1) ||
-            !rioWriteBulkStreamID(r,&id) ||
-            !rioWriteBulkString(r,"x",1) ||
-            !rioWriteBulkString(r,"y",1))
-        {
-            streamIteratorStop(&si);
-            return 0;     
-        }
-    }
-
-    /* Append XSETID after XADD, make sure lastid is correct,
-     * in case of XDEL lastid. */
-    if (!rioWriteBulkCount(r,'*',3) ||
-        !rioWriteBulkString(r,"XSETID",6) ||
-        !rioWriteBulkObject(r,key) ||
-        !rioWriteBulkStreamID(r,&s->last_id)) 
-    {
-        streamIteratorStop(&si);
-        return 0; 
-    }
-
-
-    /* Create all the stream consumer groups. */
-    if (s->cgroups) {
-        raxIterator ri;
-        raxStart(&ri,s->cgroups);
-        raxSeek(&ri,"^",NULL,0);
-        while(raxNext(&ri)) {
-            streamCG *group = ri.data;
-            /* Emit the XGROUP CREATE in order to create the group. */
-            if (!rioWriteBulkCount(r,'*',5) ||
-                !rioWriteBulkString(r,"XGROUP",6) ||
-                !rioWriteBulkString(r,"CREATE",6) ||
-                !rioWriteBulkObject(r,key) ||
-                !rioWriteBulkString(r,(char*)ri.key,ri.key_len) ||
-                !rioWriteBulkStreamID(r,&group->last_id)) 
-            {
-                raxStop(&ri);
-                streamIteratorStop(&si);
-                return 0;
-            }
-
-            /* Generate XCLAIMs for each consumer that happens to
-             * have pending entries. Empty consumers would be generated with
-             * XGROUP CREATECONSUMER. */
-            raxIterator ri_cons;
-            raxStart(&ri_cons,group->consumers);
-            raxSeek(&ri_cons,"^",NULL,0);
-            while(raxNext(&ri_cons)) {
-                streamConsumer *consumer = ri_cons.data;
-                /* If there are no pending entries, just emit XGROUP CREATECONSUMER */
-                if (raxSize(consumer->pel) == 0) {
-                    if (rioWriteStreamEmptyConsumer(r,key,(char*)ri.key,
-                                                    ri.key_len,consumer) == 0)
-                    {
-                        raxStop(&ri_cons);
-                        raxStop(&ri);
-                        streamIteratorStop(&si);
-                        return 0;
-                    }
-                    continue;
-                }
-                /* For the current consumer, iterate all the PEL entries
-                 * to emit the XCLAIM protocol. */
-                raxIterator ri_pel;
-                raxStart(&ri_pel,consumer->pel);
-                raxSeek(&ri_pel,"^",NULL,0);
-                while(raxNext(&ri_pel)) {
-                    streamNACK *nack = ri_pel.data;
-                    if (rioWriteStreamPendingEntry(r,key,(char*)ri.key,
-                                                   ri.key_len,consumer,
-                                                   ri_pel.key,nack) == 0)
-                    {
-                        raxStop(&ri_pel);
-                        raxStop(&ri_cons);
-                        raxStop(&ri);
-                        streamIteratorStop(&si);
-                        return 0;
-                    }
-                }
-                raxStop(&ri_pel);
-            }
-            raxStop(&ri_cons);
-        }
-        raxStop(&ri);
-    }
-
-    streamIteratorStop(&si);
-    return 1;
-}
-
-/* Call the module type callback in order to rewrite a data type
- * that is exported by a module and is not handled by Redis itself.
- * The function returns 0 on error, 1 on success. */
-int rewriteModuleObject(rio *r, robj *key, robj *o) {
-    RedisModuleIO io;
-    moduleValue *mv = o->ptr;
-    moduleType *mt = mv->type;
-    moduleInitIOContext(io,mt,r,key);
-    mt->aof_rewrite(&io,key,mv->value);
-    if (io.ctx) {
-        moduleFreeContext(io.ctx);
-        zfree(io.ctx);
-    }
-    return io.error ? 0 : 1;
-}
-
-/* This function is called by the child rewriting the AOF file to read
- * the difference accumulated from the parent into a buffer, that is
- * concatenated at the end of the rewrite. */
-ssize_t aofReadDiffFromParent(void) {
-    char buf[65536]; /* Default pipe buffer size on most Linux systems. */
-    ssize_t nread, total = 0;
-
-    while ((nread =
-            read(server.aof_pipe_read_data_from_parent,buf,sizeof(buf))) > 0) {
-        server.aof_child_diff = sdscatlen(server.aof_child_diff,buf,nread);
-        total += nread;
-    }
-    return total;
-}
-
-int rewriteAppendOnlyFileRio(rio *aof) {
-    dictIterator *di = NULL;
-    dictEntry *de;
-    size_t processed = 0;
-    int j;
-    long key_count = 0;
-    long long updated_time = 0;
-
-    for (j = 0; j < server.dbnum; j++) {
-        char selectcmd[] = "*2\r\n$6\r\nSELECT\r\n";
-        redisDb *db = server.db+j;
-        dict *d = db->dict;
-        if (dictSize(d) == 0) continue;
-        di = dictGetSafeIterator(d);
-
-        /* SELECT the new DB */
-        if (rioWrite(aof,selectcmd,sizeof(selectcmd)-1) == 0) goto werr;
-        if (rioWriteBulkLongLong(aof,j) == 0) goto werr;
-
-        /* Iterate this DB writing every entry */
-        while((de = dictNext(di)) != NULL) {
-            sds keystr;
-            robj key, *o;
-            long long expiretime;
-
-            keystr = dictGetKey(de);
-            o = dictGetVal(de);
-            initStaticStringObject(key,keystr);
-
-            expiretime = getExpire(db,&key);
-
-            /* Save the key and associated value */
-            if (o->type == OBJ_STRING) {
-                /* Emit a SET command */
-                char cmd[]="*3\r\n$3\r\nSET\r\n";
-                if (rioWrite(aof,cmd,sizeof(cmd)-1) == 0) goto werr;
-                /* Key and value */
-                if (rioWriteBulkObject(aof,&key) == 0) goto werr;
-                if (rioWriteBulkObject(aof,o) == 0) goto werr;
-            } else if (o->type == OBJ_LIST) {
-                if (rewriteListObject(aof,&key,o) == 0) goto werr;
-            } else if (o->type == OBJ_SET) {
-                if (rewriteSetObject(aof,&key,o) == 0) goto werr;
-            } else if (o->type == OBJ_ZSET) {
-                if (rewriteSortedSetObject(aof,&key,o) == 0) goto werr;
-            } else if (o->type == OBJ_HASH) {
-                if (rewriteHashObject(aof,&key,o) == 0) goto werr;
-            } else if (o->type == OBJ_STREAM) {
-                if (rewriteStreamObject(aof,&key,o) == 0) goto werr;
-            } else if (o->type == OBJ_MODULE) {
-                if (rewriteModuleObject(aof,&key,o) == 0) goto werr;
-            } else {
-                serverPanic("Unknown object type");
-            }
-            /* Save the expire time */
-            if (expiretime != -1) {
-                char cmd[]="*3\r\n$9\r\nPEXPIREAT\r\n";
-                if (rioWrite(aof,cmd,sizeof(cmd)-1) == 0) goto werr;
-                if (rioWriteBulkObject(aof,&key) == 0) goto werr;
-                if (rioWriteBulkLongLong(aof,expiretime) == 0) goto werr;
-            }
-            /* Read some diff from the parent process from time to time. */
-            if (aof->processed_bytes > processed+AOF_READ_DIFF_INTERVAL_BYTES) {
-                processed = aof->processed_bytes;
-                aofReadDiffFromParent();
-            }
-
-            /* Update info every 1 second (approximately).
-             * in order to avoid calling mstime() on each iteration, we will
-             * check the diff every 1024 keys */
-            if ((key_count++ & 1023) == 0) {
-                long long now = mstime();
-                if (now - updated_time >= 1000) {
-                    sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, "AOF rewrite");
-                    updated_time = now;
-                }
-            }
-        }
-        dictReleaseIterator(di);
-        di = NULL;
-    }
-    return C_OK;
-
-werr:
-    if (di) dictReleaseIterator(di);
-    return C_ERR;
-}
-
-/* Write a sequence of commands able to fully rebuild the dataset into
- * "filename". Used both by REWRITEAOF and BGREWRITEAOF.
- *
- * In order to minimize the number of commands needed in the rewritten
- * log Redis uses variadic commands when possible, such as RPUSH, SADD
- * and ZADD. However at max AOF_REWRITE_ITEMS_PER_CMD items per time
- * are inserted using a single command. */
-int rewriteAppendOnlyFile(char *filename) {
-    rio aof;
-    FILE *fp = NULL;
-    char tmpfile[256];
-    char byte;
-
-    /* Note that we have to use a different temp name here compared to the
-     * one used by rewriteAppendOnlyFileBackground() function. */
-    snprintf(tmpfile,256,"temp-rewriteaof-%d.aof", (int) getpid());
-    fp = fopen(tmpfile,"w");
-    if (!fp) {
-        serverLog(LL_WARNING, "Opening the temp file for AOF rewrite in rewriteAppendOnlyFile(): %s", strerror(errno));
-        return C_ERR;
-    }
-
-    server.aof_child_diff = sdsempty();
-    rioInitWithFile(&aof,fp);
-
-    if (server.aof_rewrite_incremental_fsync)
-        rioSetAutoSync(&aof,REDIS_AUTOSYNC_BYTES);
-
-    startSaving(RDBFLAGS_AOF_PREAMBLE);
-
-    if (server.aof_use_rdb_preamble) {
-        int error;
-        if (rdbSaveRio(&aof,&error,RDBFLAGS_AOF_PREAMBLE,NULL) == C_ERR) {
-            errno = error;
-            goto werr;
-        }
-    } else {
-        if (rewriteAppendOnlyFileRio(&aof) == C_ERR) goto werr;
-    }
-
-    /* Do an initial slow fsync here while the parent is still sending
-     * data, in order to make the next final fsync faster. */
-    if (fflush(fp) == EOF) goto werr;
-    if (fsync(fileno(fp)) == -1) goto werr;
-
-    /* Read again a few times to get more data from the parent.
-     * We can't read forever (the server may receive data from clients
-     * faster than it is able to send data to the child), so we try to read
-     * some more data in a loop as soon as there is a good chance more data
-     * will come. If it looks like we are wasting time, we abort (this
-     * happens after 20 ms without new data). */
-    int nodata = 0;
-    mstime_t start = mstime();
-    while(mstime()-start < 1000 && nodata < 20) {
-        if (aeWait(server.aof_pipe_read_data_from_parent, AE_READABLE, 1) <= 0)
-        {
-            nodata++;
-            continue;
-        }
-        nodata = 0; /* Start counting from zero, we stop on N *contiguous*
-                       timeouts. */
-        aofReadDiffFromParent();
-    }
-
-    /* Ask the master to stop sending diffs. */
-    if (write(server.aof_pipe_write_ack_to_parent,"!",1) != 1) goto werr;
-    if (anetNonBlock(NULL,server.aof_pipe_read_ack_from_parent) != ANET_OK)
-        goto werr;
-    /* We read the ACK from the server using a 5 seconds timeout. Normally
-     * it should reply ASAP, but just in case we lose its reply, we are sure
-     * the child will eventually get terminated. */
-    if (syncRead(server.aof_pipe_read_ack_from_parent,&byte,1,5000) != 1 ||
-        byte != '!') goto werr;
-    serverLog(LL_NOTICE,"Parent agreed to stop sending diffs. Finalizing AOF...");
-
-    /* Read the final diff if any. */
-    aofReadDiffFromParent();
-
-    /* Write the received diff to the file. */
-    serverLog(LL_NOTICE,
-        "Concatenating %.2f MB of AOF diff received from parent.",
-        (double) sdslen(server.aof_child_diff) / (1024*1024));
-
-    /* Now we write the entire AOF buffer we received from the parent
-     * via the pipe during the life of this fork child.
-     * once a second, we'll take a break and send updated COW info to the parent */
-    size_t bytes_to_write = sdslen(server.aof_child_diff);
-    const char *buf = server.aof_child_diff;
-    long long cow_updated_time = mstime();
-    long long key_count = dbTotalServerKeyCount();
-    while (bytes_to_write) {
-        /* We write the AOF buffer in chunk of 8MB so that we can check the time in between them */
-        size_t chunk_size = bytes_to_write < (8<<20) ? bytes_to_write : (8<<20);
-
-        if (rioWrite(&aof,buf,chunk_size) == 0)
-            goto werr;
-
-        bytes_to_write -= chunk_size;
-        buf += chunk_size;
-
-        /* Update COW info */
-        long long now = mstime();
-        if (now - cow_updated_time >= 1000) {
-            sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, "AOF rewrite");
-            cow_updated_time = now;
-        }
-    }
-
-    /* Make sure data will not remain on the OS's output buffers */
-    if (fflush(fp)) goto werr;
-    if (fsync(fileno(fp))) goto werr;
-    if (fclose(fp)) { fp = NULL; goto werr; }
-    fp = NULL;
-
-    /* Use RENAME to make sure the DB file is changed atomically only
-     * if the generate DB file is ok. */
-    if (rename(tmpfile,filename) == -1) {
-        serverLog(LL_WARNING,"Error moving temp append only file on the final destination: %s", strerror(errno));
-        unlink(tmpfile);
-        stopSaving(0);
-        return C_ERR;
-    }
-    serverLog(LL_NOTICE,"SYNC append only file rewrite performed");
-    stopSaving(1);
-    return C_OK;
-
-werr:
-    serverLog(LL_WARNING,"Write error writing append only file on disk: %s", strerror(errno));
-    if (fp) fclose(fp);
-    unlink(tmpfile);
-    stopSaving(0);
-    return C_ERR;
-}
-
-/* ----------------------------------------------------------------------------
- * AOF rewrite pipes for IPC
- * -------------------------------------------------------------------------- */
-
-/* This event handler is called when the AOF rewriting child sends us a
- * single '!' char to signal we should stop sending buffer diffs. The
- * parent sends a '!' as well to acknowledge. */
-void aofChildPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask) {
-    char byte;
-    UNUSED(el);
-    UNUSED(privdata);
-    UNUSED(mask);
-
-    if (read(fd,&byte,1) == 1 && byte == '!') {
-        serverLog(LL_NOTICE,"AOF rewrite child asks to stop sending diffs.");
-        server.aof_stop_sending_diff = 1;
-        if (write(server.aof_pipe_write_ack_to_child,"!",1) != 1) {
-            /* If we can't send the ack, inform the user, but don't try again
-             * since in the other side the children will use a timeout if the
-             * kernel can't buffer our write, or, the children was
-             * terminated. */
-            serverLog(LL_WARNING,"Can't send ACK to AOF child: %s",
-                strerror(errno));
-        }
-    }
-    /* Remove the handler since this can be called only one time during a
-     * rewrite. */
-    aeDeleteFileEvent(server.el,server.aof_pipe_read_ack_from_child,AE_READABLE);
-}
-
-/* Create the pipes used for parent - child process IPC during rewrite.
- * We have a data pipe used to send AOF incremental diffs to the child,
- * and two other pipes used by the children to signal it finished with
- * the rewrite so no more data should be written, and another for the
- * parent to acknowledge it understood this new condition. */
-int aofCreatePipes(void) {
-    int fds[6] = {-1, -1, -1, -1, -1, -1};
-    int j;
-
-    if (pipe(fds) == -1) goto error; /* parent -> children data. */
-    if (pipe(fds+2) == -1) goto error; /* children -> parent ack. */
-    if (pipe(fds+4) == -1) goto error; /* parent -> children ack. */
-    /* Parent -> children data is non blocking. */
-    if (anetNonBlock(NULL,fds[0]) != ANET_OK) goto error;
-    if (anetNonBlock(NULL,fds[1]) != ANET_OK) goto error;
-    if (aeCreateFileEvent(server.el, fds[2], AE_READABLE, aofChildPipeReadable, NULL) == AE_ERR) goto error;
-
-    server.aof_pipe_write_data_to_child = fds[1];
-    server.aof_pipe_read_data_from_parent = fds[0];
-    server.aof_pipe_write_ack_to_parent = fds[3];
-    server.aof_pipe_read_ack_from_child = fds[2];
-    server.aof_pipe_write_ack_to_child = fds[5];
-    server.aof_pipe_read_ack_from_parent = fds[4];
-    server.aof_stop_sending_diff = 0;
-    return C_OK;
-
-error:
-    serverLog(LL_WARNING,"Error opening /setting AOF rewrite IPC pipes: %s",
-        strerror(errno));
-    for (j = 0; j < 6; j++) if(fds[j] != -1) close(fds[j]);
-    return C_ERR;
-}
-
-void aofClosePipes(void) {
-    aeDeleteFileEvent(server.el,server.aof_pipe_read_ack_from_child,AE_READABLE);
-    aeDeleteFileEvent(server.el,server.aof_pipe_write_data_to_child,AE_WRITABLE);
-    close(server.aof_pipe_write_data_to_child);
-    close(server.aof_pipe_read_data_from_parent);
-    close(server.aof_pipe_write_ack_to_parent);
-    close(server.aof_pipe_read_ack_from_child);
-    close(server.aof_pipe_write_ack_to_child);
-    close(server.aof_pipe_read_ack_from_parent);
-}
-
-/* ----------------------------------------------------------------------------
- * AOF background rewrite
- * ------------------------------------------------------------------------- */
-
-/* This is how rewriting of the append only file in background works:
- *
- * 1) The user calls BGREWRITEAOF
- * 2) Redis calls this function, that forks():
- *    2a) the child rewrite the append only file in a temp file.
- *    2b) the parent accumulates differences in server.aof_rewrite_buf.
- * 3) When the child finished '2a' exists.
- * 4) The parent will trap the exit code, if it's OK, will append the
- *    data accumulated into server.aof_rewrite_buf into the temp file, and
- *    finally will rename(2) the temp file in the actual file name.
- *    The the new file is reopened as the new append only file. Profit!
- */
-int rewriteAppendOnlyFileBackground(void) {
-    pid_t childpid;
-
-    if (hasActiveChildProcess()) return C_ERR;
-    if (aofCreatePipes() != C_OK) return C_ERR;
-    if ((childpid = redisFork(CHILD_TYPE_AOF)) == 0) {
-        char tmpfile[256];
-
-        /* Child */
-        redisSetProcTitle("redis-aof-rewrite");
-        redisSetCpuAffinity(server.aof_rewrite_cpulist);
-        snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) getpid());
-        if (rewriteAppendOnlyFile(tmpfile) == C_OK) {
-            sendChildCowInfo(CHILD_INFO_TYPE_AOF_COW_SIZE, "AOF rewrite");
-            exitFromChild(0);
-        } else {
-            exitFromChild(1);
-        }
-    } else {
-        /* Parent */
-        if (childpid == -1) {
-            serverLog(LL_WARNING,
-                "Can't rewrite append only file in background: fork: %s",
-                strerror(errno));
-            aofClosePipes();
-            return C_ERR;
-        }
-        serverLog(LL_NOTICE,
-            "Background append only file rewriting started by pid %ld",(long) childpid);
-        server.aof_rewrite_scheduled = 0;
-        server.aof_rewrite_time_start = time(NULL);
-
-        /* We set appendseldb to -1 in order to force the next call to the
-         * feedAppendOnlyFile() to issue a SELECT command, so the differences
-         * accumulated by the parent into server.aof_rewrite_buf will start
-         * with a SELECT statement and it will be safe to merge. */
-        server.aof_selected_db = -1;
-        replicationScriptCacheFlush();
-        return C_OK;
-    }
-    return C_OK; /* unreached */
-}
-
-void bgrewriteaofCommand(client *c) {
-    if (server.child_type == CHILD_TYPE_AOF) {
-        addReplyError(c,"Background append only file rewriting already in progress");
-    } else if (hasActiveChildProcess()) {
-        server.aof_rewrite_scheduled = 1;
-        addReplyStatus(c,"Background append only file rewriting scheduled");
-    } else if (rewriteAppendOnlyFileBackground() == C_OK) {
-        addReplyStatus(c,"Background append only file rewriting started");
-    } else {
-        addReplyError(c,"Can't execute an AOF background rewriting. "
-                        "Please check the server logs for more information.");
-    }
-}
-
-void aofRemoveTempFile(pid_t childpid) {
-    char tmpfile[256];
-
-    snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof", (int) childpid);
-    bg_unlink(tmpfile);
-
-    snprintf(tmpfile,256,"temp-rewriteaof-%d.aof", (int) childpid);
-    bg_unlink(tmpfile);
-}
-
-/* Update the server.aof_current_size field explicitly using stat(2)
- * to check the size of the file. This is useful after a rewrite or after
- * a restart, normally the size is updated just adding the write length
- * to the current length, that is much faster. */
-void aofUpdateCurrentSize(void) {
-    struct redis_stat sb;
-    mstime_t latency;
-
-    latencyStartMonitor(latency);
-    if (redis_fstat(server.aof_fd,&sb) == -1) {
-        serverLog(LL_WARNING,"Unable to obtain the AOF file length. stat: %s",
-            strerror(errno));
-    } else {
-        server.aof_current_size = sb.st_size;
-    }
-    latencyEndMonitor(latency);
-    latencyAddSampleIfNeeded("aof-fstat",latency);
-}
-
-/* A background append only file rewriting (BGREWRITEAOF) terminated its work.
- * Handle this. */
-void backgroundRewriteDoneHandler(int exitcode, int bysignal) {
-    if (!bysignal && exitcode == 0) {
-        int newfd, oldfd;
-        char tmpfile[256];
-        long long now = ustime();
-        mstime_t latency;
-
-        serverLog(LL_NOTICE,
-            "Background AOF rewrite terminated with success");
-
-        /* Flush the differences accumulated by the parent to the
-         * rewritten AOF. */
-        latencyStartMonitor(latency);
-        snprintf(tmpfile,256,"temp-rewriteaof-bg-%d.aof",
-            (int)server.child_pid);
-        newfd = open(tmpfile,O_WRONLY|O_APPEND);
-        if (newfd == -1) {
-            serverLog(LL_WARNING,
-                "Unable to open the temporary AOF produced by the child: %s", strerror(errno));
-            goto cleanup;
-        }
-
-        if (aofRewriteBufferWrite(newfd) == -1) {
-            serverLog(LL_WARNING,
-                "Error trying to flush the parent diff to the rewritten AOF: %s", strerror(errno));
-            close(newfd);
-            goto cleanup;
-        }
-        latencyEndMonitor(latency);
-        latencyAddSampleIfNeeded("aof-rewrite-diff-write",latency);
-  
-        if (server.aof_fsync == AOF_FSYNC_EVERYSEC) {
-            aof_background_fsync(newfd);
-        } else if (server.aof_fsync == AOF_FSYNC_ALWAYS) {
-            latencyStartMonitor(latency);
-            if (redis_fsync(newfd) == -1) {
-                serverLog(LL_WARNING,
-                    "Error trying to fsync the parent diff to the rewritten AOF: %s", strerror(errno));
-                close(newfd);
-                goto cleanup;
-            }
-            latencyEndMonitor(latency);
-            latencyAddSampleIfNeeded("aof-rewrite-done-fsync",latency);
-        }
-
-        serverLog(LL_NOTICE,
-            "Residual parent diff successfully flushed to the rewritten AOF (%.2f MB)", (double) aofRewriteBufferSize() / (1024*1024));
-
-        /* The only remaining thing to do is to rename the temporary file to
-         * the configured file and switch the file descriptor used to do AOF
-         * writes. We don't want close(2) or rename(2) calls to block the
-         * server on old file deletion.
-         *
-         * There are two possible scenarios:
-         *
-         * 1) AOF is DISABLED and this was a one time rewrite. The temporary
-         * file will be renamed to the configured file. When this file already
-         * exists, it will be unlinked, which may block the server.
-         *
-         * 2) AOF is ENABLED and the rewritten AOF will immediately start
-         * receiving writes. After the temporary file is renamed to the
-         * configured file, the original AOF file descriptor will be closed.
-         * Since this will be the last reference to that file, closing it
-         * causes the underlying file to be unlinked, which may block the
-         * server.
-         *
-         * To mitigate the blocking effect of the unlink operation (either
-         * caused by rename(2) in scenario 1, or by close(2) in scenario 2), we
-         * use a background thread to take care of this. First, we
-         * make scenario 1 identical to scenario 2 by opening the target file
-         * when it exists. The unlink operation after the rename(2) will then
-         * be executed upon calling close(2) for its descriptor. Everything to
-         * guarantee atomicity for this switch has already happened by then, so
-         * we don't care what the outcome or duration of that close operation
-         * is, as long as the file descriptor is released again. */
-        if (server.aof_fd == -1) {
-            /* AOF disabled */
-
-            /* Don't care if this fails: oldfd will be -1 and we handle that.
-             * One notable case of -1 return is if the old file does
-             * not exist. */
-            oldfd = open(server.aof_filename,O_RDONLY|O_NONBLOCK);
-        } else {
-            /* AOF enabled */
-            oldfd = -1; /* We'll set this to the current AOF filedes later. */
-        }
-
-        /* Rename the temporary file. This will not unlink the target file if
-         * it exists, because we reference it with "oldfd". */
-        latencyStartMonitor(latency);
-        if (rename(tmpfile,server.aof_filename) == -1) {
-            serverLog(LL_WARNING,
-                "Error trying to rename the temporary AOF file %s into %s: %s",
-                tmpfile,
-                server.aof_filename,
-                strerror(errno));
-            close(newfd);
-            if (oldfd != -1) close(oldfd);
-            goto cleanup;
-        }
-        latencyEndMonitor(latency);
-        latencyAddSampleIfNeeded("aof-rename",latency);
-
-        if (server.aof_fd == -1) {
-            /* AOF disabled, we don't need to set the AOF file descriptor
-             * to this new file, so we can close it. */
-            close(newfd);
-        } else {
-            /* AOF enabled, replace the old fd with the new one. */
-            oldfd = server.aof_fd;
-            server.aof_fd = newfd;
-            server.aof_selected_db = -1; /* Make sure SELECT is re-issued */
-            aofUpdateCurrentSize();
-            server.aof_rewrite_base_size = server.aof_current_size;
-            server.aof_fsync_offset = server.aof_current_size;
-            server.aof_last_fsync = server.unixtime;
-
-            /* Clear regular AOF buffer since its contents was just written to
-             * the new AOF from the background rewrite buffer. */
-            sdsfree(server.aof_buf);
-            server.aof_buf = sdsempty();
-        }
-
-        server.aof_lastbgrewrite_status = C_OK;
-
-        serverLog(LL_NOTICE, "Background AOF rewrite finished successfully");
-        /* Change state from WAIT_REWRITE to ON if needed */
-        if (server.aof_state == AOF_WAIT_REWRITE)
-            server.aof_state = AOF_ON;
-
-        /* Asynchronously close the overwritten AOF. */
-        if (oldfd != -1) bioCreateCloseJob(oldfd);
-
-        serverLog(LL_VERBOSE,
-            "Background AOF rewrite signal handler took %lldus", ustime()-now);
-    } else if (!bysignal && exitcode != 0) {
-        server.aof_lastbgrewrite_status = C_ERR;
-
-        serverLog(LL_WARNING,
-            "Background AOF rewrite terminated with error");
-    } else {
-        /* SIGUSR1 is whitelisted, so we have a way to kill a child without
-         * triggering an error condition. */
-        if (bysignal != SIGUSR1)
-            server.aof_lastbgrewrite_status = C_ERR;
-
-        serverLog(LL_WARNING,
-            "Background AOF rewrite terminated by signal %d", bysignal);
-    }
-
-cleanup:
-    aofClosePipes();
-    aofRewriteBufferReset();
-    aofRemoveTempFile(server.child_pid);
-    server.aof_rewrite_time_last = time(NULL)-server.aof_rewrite_time_start;
-    server.aof_rewrite_time_start = -1;
-    /* Schedule a new rewrite if we are waiting for it to switch the AOF ON. */
-    if (server.aof_state == AOF_WAIT_REWRITE)
-        server.aof_rewrite_scheduled = 1;
-}
diff --git a/redis-stable/src/asciilogo.h b/redis-stable/src/asciilogo.h
deleted file mode 100644
index a62f68cf..00000000
--- a/redis-stable/src/asciilogo.h
+++ /dev/null
@@ -1,47 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-const char *ascii_logo =
-"                _._                                                  \n"
-"           _.-``__ ''-._                                             \n"
-"      _.-``    `.  `_.  ''-._           Redis %s (%s/%d) %s bit\n"
-"  .-`` .-```.  ```\\/    _.,_ ''-._                                  \n"
-" (    '      ,       .-`  | `,    )     Running in %s mode\n"
-" |`-._`-...-` __...-.``-._|'` _.-'|     Port: %d\n"
-" |    `-._   `._    /     _.-'    |     PID: %ld\n"
-"  `-._    `-._  `-./  _.-'    _.-'                                   \n"
-" |`-._`-._    `-.__.-'    _.-'_.-'|                                  \n"
-" |    `-._`-._        _.-'_.-'    |           https://redis.io       \n"
-"  `-._    `-._`-.__.-'_.-'    _.-'                                   \n"
-" |`-._`-._    `-.__.-'    _.-'_.-'|                                  \n"
-" |    `-._`-._        _.-'_.-'    |                                  \n"
-"  `-._    `-._`-.__.-'_.-'    _.-'                                   \n"
-"      `-._    `-.__.-'    _.-'                                       \n"
-"          `-._        _.-'                                           \n"
-"              `-.__.-'                                               \n\n";
diff --git a/redis-stable/src/atomicvar.h b/redis-stable/src/atomicvar.h
deleted file mode 100644
index 222b8269..00000000
--- a/redis-stable/src/atomicvar.h
+++ /dev/null
@@ -1,158 +0,0 @@
-/* This file implements atomic counters using c11 _Atomic, __atomic or __sync
- * macros if available, otherwise we will throw an error when compile.
- *
- * The exported interface is composed of three macros:
- *
- * atomicIncr(var,count) -- Increment the atomic counter
- * atomicGetIncr(var,oldvalue_var,count) -- Get and increment the atomic counter
- * atomicDecr(var,count) -- Decrement the atomic counter
- * atomicGet(var,dstvar) -- Fetch the atomic counter value
- * atomicSet(var,value)  -- Set the atomic counter value
- * atomicGetWithSync(var,value)  -- 'atomicGet' with inter-thread synchronization
- * atomicSetWithSync(var,value)  -- 'atomicSet' with inter-thread synchronization
- *
- * Never use return value from the macros, instead use the AtomicGetIncr()
- * if you need to get the current value and increment it atomically, like
- * in the following example:
- *
- *  long oldvalue;
- *  atomicGetIncr(myvar,oldvalue,1);
- *  doSomethingWith(oldvalue);
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <pthread.h>
-#include "config.h"
-
-#ifndef __ATOMIC_VAR_H
-#define __ATOMIC_VAR_H
-
-/* Define redisAtomic for atomic variable. */
-#define redisAtomic
-
-/* To test Redis with Helgrind (a Valgrind tool) it is useful to define
- * the following macro, so that __sync macros are used: those can be detected
- * by Helgrind (even if they are less efficient) so that no false positive
- * is reported. */
-// #define __ATOMIC_VAR_FORCE_SYNC_MACROS
-
-/* There will be many false positives if we test Redis with Helgrind, since
- * Helgrind can't understand we have imposed ordering on the program, so
- * we use macros in helgrind.h to tell Helgrind inter-thread happens-before
- * relationship explicitly for avoiding false positives.
- *
- * For more details, please see: valgrind/helgrind.h and
- * https://www.valgrind.org/docs/manual/hg-manual.html#hg-manual.effective-use
- *
- * These macros take effect only when 'make helgrind', and you must first
- * install Valgrind in the default path configuration. */
-#ifdef __ATOMIC_VAR_FORCE_SYNC_MACROS
-#include <valgrind/helgrind.h>
-#else
-#define ANNOTATE_HAPPENS_BEFORE(v) ((void) v)
-#define ANNOTATE_HAPPENS_AFTER(v)  ((void) v)
-#endif
-
-#if !defined(__ATOMIC_VAR_FORCE_SYNC_MACROS) && defined(__STDC_VERSION__) && \
-    (__STDC_VERSION__ >= 201112L) && !defined(__STDC_NO_ATOMICS__)
-/* Use '_Atomic' keyword if the compiler supports. */
-#undef  redisAtomic
-#define redisAtomic _Atomic
-/* Implementation using _Atomic in C11. */
-
-#include <stdatomic.h>
-#define atomicIncr(var,count) atomic_fetch_add_explicit(&var,(count),memory_order_relaxed)
-#define atomicGetIncr(var,oldvalue_var,count) do { \
-    oldvalue_var = atomic_fetch_add_explicit(&var,(count),memory_order_relaxed); \
-} while(0)
-#define atomicDecr(var,count) atomic_fetch_sub_explicit(&var,(count),memory_order_relaxed)
-#define atomicGet(var,dstvar) do { \
-    dstvar = atomic_load_explicit(&var,memory_order_relaxed); \
-} while(0)
-#define atomicSet(var,value) atomic_store_explicit(&var,value,memory_order_relaxed)
-#define atomicGetWithSync(var,dstvar) do { \
-    dstvar = atomic_load_explicit(&var,memory_order_seq_cst); \
-} while(0)
-#define atomicSetWithSync(var,value) \
-    atomic_store_explicit(&var,value,memory_order_seq_cst)
-#define REDIS_ATOMIC_API "c11-builtin"
-
-#elif !defined(__ATOMIC_VAR_FORCE_SYNC_MACROS) && \
-    (!defined(__clang__) || !defined(__APPLE__) || __apple_build_version__ > 4210057) && \
-    defined(__ATOMIC_RELAXED) && defined(__ATOMIC_SEQ_CST)
-/* Implementation using __atomic macros. */
-
-#define atomicIncr(var,count) __atomic_add_fetch(&var,(count),__ATOMIC_RELAXED)
-#define atomicGetIncr(var,oldvalue_var,count) do { \
-    oldvalue_var = __atomic_fetch_add(&var,(count),__ATOMIC_RELAXED); \
-} while(0)
-#define atomicDecr(var,count) __atomic_sub_fetch(&var,(count),__ATOMIC_RELAXED)
-#define atomicGet(var,dstvar) do { \
-    dstvar = __atomic_load_n(&var,__ATOMIC_RELAXED); \
-} while(0)
-#define atomicSet(var,value) __atomic_store_n(&var,value,__ATOMIC_RELAXED)
-#define atomicGetWithSync(var,dstvar) do { \
-    dstvar = __atomic_load_n(&var,__ATOMIC_SEQ_CST); \
-} while(0)
-#define atomicSetWithSync(var,value) \
-    __atomic_store_n(&var,value,__ATOMIC_SEQ_CST)
-#define REDIS_ATOMIC_API "atomic-builtin"
-
-#elif defined(HAVE_ATOMIC)
-/* Implementation using __sync macros. */
-
-#define atomicIncr(var,count) __sync_add_and_fetch(&var,(count))
-#define atomicGetIncr(var,oldvalue_var,count) do { \
-    oldvalue_var = __sync_fetch_and_add(&var,(count)); \
-} while(0)
-#define atomicDecr(var,count) __sync_sub_and_fetch(&var,(count))
-#define atomicGet(var,dstvar) do { \
-    dstvar = __sync_sub_and_fetch(&var,0); \
-} while(0)
-#define atomicSet(var,value) do { \
-    while(!__sync_bool_compare_and_swap(&var,var,value)); \
-} while(0)
-/* Actually the builtin issues a full memory barrier by default. */
-#define atomicGetWithSync(var,dstvar) { \
-    dstvar = __sync_sub_and_fetch(&var,0,__sync_synchronize); \
-    ANNOTATE_HAPPENS_AFTER(&var); \
-} while(0)
-#define atomicSetWithSync(var,value) do { \
-    ANNOTATE_HAPPENS_BEFORE(&var);  \
-    while(!__sync_bool_compare_and_swap(&var,var,value,__sync_synchronize)); \
-} while(0)
-#define REDIS_ATOMIC_API "sync-builtin"
-
-#else
-#error "Unable to determine atomic operations for your platform"
-
-#endif
-#endif /* __ATOMIC_VAR_H */
diff --git a/redis-stable/src/bio.c b/redis-stable/src/bio.c
deleted file mode 100644
index ff18c4fe..00000000
--- a/redis-stable/src/bio.c
+++ /dev/null
@@ -1,309 +0,0 @@
-/* Background I/O service for Redis.
- *
- * This file implements operations that we need to perform in the background.
- * Currently there is only a single operation, that is a background close(2)
- * system call. This is needed as when the process is the last owner of a
- * reference to a file closing it means unlinking it, and the deletion of the
- * file is slow, blocking the server.
- *
- * In the future we'll either continue implementing new things we need or
- * we'll switch to libeio. However there are probably long term uses for this
- * file as we may want to put here Redis specific background tasks (for instance
- * it is not impossible that we'll need a non blocking FLUSHDB/FLUSHALL
- * implementation).
- *
- * DESIGN
- * ------
- *
- * The design is trivial, we have a structure representing a job to perform
- * and a different thread and job queue for every job type.
- * Every thread waits for new jobs in its queue, and process every job
- * sequentially.
- *
- * Jobs of the same type are guaranteed to be processed from the least
- * recently inserted to the most recently inserted (older jobs processed
- * first).
- *
- * Currently there is no way for the creator of the job to be notified about
- * the completion of the operation, this will only be added when/if needed.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "server.h"
-#include "bio.h"
-
-static pthread_t bio_threads[BIO_NUM_OPS];
-static pthread_mutex_t bio_mutex[BIO_NUM_OPS];
-static pthread_cond_t bio_newjob_cond[BIO_NUM_OPS];
-static pthread_cond_t bio_step_cond[BIO_NUM_OPS];
-static list *bio_jobs[BIO_NUM_OPS];
-/* The following array is used to hold the number of pending jobs for every
- * OP type. This allows us to export the bioPendingJobsOfType() API that is
- * useful when the main thread wants to perform some operation that may involve
- * objects shared with the background thread. The main thread will just wait
- * that there are no longer jobs of this type to be executed before performing
- * the sensible operation. This data is also useful for reporting. */
-static unsigned long long bio_pending[BIO_NUM_OPS];
-
-/* This structure represents a background Job. It is only used locally to this
- * file as the API does not expose the internals at all. */
-struct bio_job {
-    time_t time; /* Time at which the job was created. */
-    /* Job specific arguments.*/
-    int fd; /* Fd for file based background jobs */
-    lazy_free_fn *free_fn; /* Function that will free the provided arguments */
-    void *free_args[]; /* List of arguments to be passed to the free function */
-};
-
-void *bioProcessBackgroundJobs(void *arg);
-
-/* Make sure we have enough stack to perform all the things we do in the
- * main thread. */
-#define REDIS_THREAD_STACK_SIZE (1024*1024*4)
-
-/* Initialize the background system, spawning the thread. */
-void bioInit(void) {
-    pthread_attr_t attr;
-    pthread_t thread;
-    size_t stacksize;
-    int j;
-
-    /* Initialization of state vars and objects */
-    for (j = 0; j < BIO_NUM_OPS; j++) {
-        pthread_mutex_init(&bio_mutex[j],NULL);
-        pthread_cond_init(&bio_newjob_cond[j],NULL);
-        pthread_cond_init(&bio_step_cond[j],NULL);
-        bio_jobs[j] = listCreate();
-        bio_pending[j] = 0;
-    }
-
-    /* Set the stack size as by default it may be small in some system */
-    pthread_attr_init(&attr);
-    pthread_attr_getstacksize(&attr,&stacksize);
-    if (!stacksize) stacksize = 1; /* The world is full of Solaris Fixes */
-    while (stacksize < REDIS_THREAD_STACK_SIZE) stacksize *= 2;
-    pthread_attr_setstacksize(&attr, stacksize);
-
-    /* Ready to spawn our threads. We use the single argument the thread
-     * function accepts in order to pass the job ID the thread is
-     * responsible of. */
-    for (j = 0; j < BIO_NUM_OPS; j++) {
-        void *arg = (void*)(unsigned long) j;
-        if (pthread_create(&thread,&attr,bioProcessBackgroundJobs,arg) != 0) {
-            serverLog(LL_WARNING,"Fatal: Can't initialize Background Jobs.");
-            exit(1);
-        }
-        bio_threads[j] = thread;
-    }
-}
-
-void bioSubmitJob(int type, struct bio_job *job) {
-    job->time = time(NULL);
-    pthread_mutex_lock(&bio_mutex[type]);
-    listAddNodeTail(bio_jobs[type],job);
-    bio_pending[type]++;
-    pthread_cond_signal(&bio_newjob_cond[type]);
-    pthread_mutex_unlock(&bio_mutex[type]);
-}
-
-void bioCreateLazyFreeJob(lazy_free_fn free_fn, int arg_count, ...) {
-    va_list valist;
-    /* Allocate memory for the job structure and all required
-     * arguments */
-    struct bio_job *job = zmalloc(sizeof(*job) + sizeof(void *) * (arg_count));
-    job->free_fn = free_fn;
-
-    va_start(valist, arg_count);
-    for (int i = 0; i < arg_count; i++) {
-        job->free_args[i] = va_arg(valist, void *);
-    }
-    va_end(valist);
-    bioSubmitJob(BIO_LAZY_FREE, job);
-}
-
-void bioCreateCloseJob(int fd) {
-    struct bio_job *job = zmalloc(sizeof(*job));
-    job->fd = fd;
-
-    bioSubmitJob(BIO_CLOSE_FILE, job);
-}
-
-void bioCreateFsyncJob(int fd) {
-    struct bio_job *job = zmalloc(sizeof(*job));
-    job->fd = fd;
-
-    bioSubmitJob(BIO_AOF_FSYNC, job);
-}
-
-void *bioProcessBackgroundJobs(void *arg) {
-    struct bio_job *job;
-    unsigned long type = (unsigned long) arg;
-    sigset_t sigset;
-
-    /* Check that the type is within the right interval. */
-    if (type >= BIO_NUM_OPS) {
-        serverLog(LL_WARNING,
-            "Warning: bio thread started with wrong type %lu",type);
-        return NULL;
-    }
-
-    switch (type) {
-    case BIO_CLOSE_FILE:
-        redis_set_thread_title("bio_close_file");
-        break;
-    case BIO_AOF_FSYNC:
-        redis_set_thread_title("bio_aof_fsync");
-        break;
-    case BIO_LAZY_FREE:
-        redis_set_thread_title("bio_lazy_free");
-        break;
-    }
-
-    redisSetCpuAffinity(server.bio_cpulist);
-
-    makeThreadKillable();
-
-    pthread_mutex_lock(&bio_mutex[type]);
-    /* Block SIGALRM so we are sure that only the main thread will
-     * receive the watchdog signal. */
-    sigemptyset(&sigset);
-    sigaddset(&sigset, SIGALRM);
-    if (pthread_sigmask(SIG_BLOCK, &sigset, NULL))
-        serverLog(LL_WARNING,
-            "Warning: can't mask SIGALRM in bio.c thread: %s", strerror(errno));
-
-    while(1) {
-        listNode *ln;
-
-        /* The loop always starts with the lock hold. */
-        if (listLength(bio_jobs[type]) == 0) {
-            pthread_cond_wait(&bio_newjob_cond[type],&bio_mutex[type]);
-            continue;
-        }
-        /* Pop the job from the queue. */
-        ln = listFirst(bio_jobs[type]);
-        job = ln->value;
-        /* It is now possible to unlock the background system as we know have
-         * a stand alone job structure to process.*/
-        pthread_mutex_unlock(&bio_mutex[type]);
-
-        /* Process the job accordingly to its type. */
-        if (type == BIO_CLOSE_FILE) {
-            close(job->fd);
-        } else if (type == BIO_AOF_FSYNC) {
-            /* The fd may be closed by main thread and reused for another
-             * socket, pipe, or file. We just ignore these errno because
-             * aof fsync did not really fail. */
-            if (redis_fsync(job->fd) == -1 &&
-                errno != EBADF && errno != EINVAL)
-            {
-                int last_status;
-                atomicGet(server.aof_bio_fsync_status,last_status);
-                atomicSet(server.aof_bio_fsync_status,C_ERR);
-                atomicSet(server.aof_bio_fsync_errno,errno);
-                if (last_status == C_OK) {
-                    serverLog(LL_WARNING,
-                        "Fail to fsync the AOF file: %s",strerror(errno));
-                }
-            } else {
-                atomicSet(server.aof_bio_fsync_status,C_OK);
-            }
-        } else if (type == BIO_LAZY_FREE) {
-            job->free_fn(job->free_args);
-        } else {
-            serverPanic("Wrong job type in bioProcessBackgroundJobs().");
-        }
-        zfree(job);
-
-        /* Lock again before reiterating the loop, if there are no longer
-         * jobs to process we'll block again in pthread_cond_wait(). */
-        pthread_mutex_lock(&bio_mutex[type]);
-        listDelNode(bio_jobs[type],ln);
-        bio_pending[type]--;
-
-        /* Unblock threads blocked on bioWaitStepOfType() if any. */
-        pthread_cond_broadcast(&bio_step_cond[type]);
-    }
-}
-
-/* Return the number of pending jobs of the specified type. */
-unsigned long long bioPendingJobsOfType(int type) {
-    unsigned long long val;
-    pthread_mutex_lock(&bio_mutex[type]);
-    val = bio_pending[type];
-    pthread_mutex_unlock(&bio_mutex[type]);
-    return val;
-}
-
-/* If there are pending jobs for the specified type, the function blocks
- * and waits that the next job was processed. Otherwise the function
- * does not block and returns ASAP.
- *
- * The function returns the number of jobs still to process of the
- * requested type.
- *
- * This function is useful when from another thread, we want to wait
- * a bio.c thread to do more work in a blocking way.
- */
-unsigned long long bioWaitStepOfType(int type) {
-    unsigned long long val;
-    pthread_mutex_lock(&bio_mutex[type]);
-    val = bio_pending[type];
-    if (val != 0) {
-        pthread_cond_wait(&bio_step_cond[type],&bio_mutex[type]);
-        val = bio_pending[type];
-    }
-    pthread_mutex_unlock(&bio_mutex[type]);
-    return val;
-}
-
-/* Kill the running bio threads in an unclean way. This function should be
- * used only when it's critical to stop the threads for some reason.
- * Currently Redis does this only on crash (for instance on SIGSEGV) in order
- * to perform a fast memory check without other threads messing with memory. */
-void bioKillThreads(void) {
-    int err, j;
-
-    for (j = 0; j < BIO_NUM_OPS; j++) {
-        if (bio_threads[j] == pthread_self()) continue;
-        if (bio_threads[j] && pthread_cancel(bio_threads[j]) == 0) {
-            if ((err = pthread_join(bio_threads[j],NULL)) != 0) {
-                serverLog(LL_WARNING,
-                    "Bio thread for job type #%d can not be joined: %s",
-                        j, strerror(err));
-            } else {
-                serverLog(LL_WARNING,
-                    "Bio thread for job type #%d terminated",j);
-            }
-        }
-    }
-}
diff --git a/redis-stable/src/bio.h b/redis-stable/src/bio.h
deleted file mode 100644
index 1e6e9729..00000000
--- a/redis-stable/src/bio.h
+++ /dev/null
@@ -1,51 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __BIO_H
-#define __BIO_H
-
-typedef void lazy_free_fn(void *args[]);
-
-/* Exported API */
-void bioInit(void);
-unsigned long long bioPendingJobsOfType(int type);
-unsigned long long bioWaitStepOfType(int type);
-time_t bioOlderJobOfType(int type);
-void bioKillThreads(void);
-void bioCreateCloseJob(int fd);
-void bioCreateFsyncJob(int fd);
-void bioCreateLazyFreeJob(lazy_free_fn free_fn, int arg_count, ...);
-
-/* Background job opcodes */
-#define BIO_CLOSE_FILE    0 /* Deferred close(2) syscall. */
-#define BIO_AOF_FSYNC     1 /* Deferred AOF fsync. */
-#define BIO_LAZY_FREE     2 /* Deferred objects freeing. */
-#define BIO_NUM_OPS       3
-
-#endif
diff --git a/redis-stable/src/bitops.c b/redis-stable/src/bitops.c
deleted file mode 100644
index f1c563a4..00000000
--- a/redis-stable/src/bitops.c
+++ /dev/null
@@ -1,1165 +0,0 @@
-/* Bit operations.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* -----------------------------------------------------------------------------
- * Helpers and low level bit functions.
- * -------------------------------------------------------------------------- */
-
-/* Count number of bits set in the binary array pointed by 's' and long
- * 'count' bytes. The implementation of this function is required to
- * work with an input string length up to 512 MB or more (server.proto_max_bulk_len) */
-long long redisPopcount(void *s, long count) {
-    long long bits = 0;
-    unsigned char *p = s;
-    uint32_t *p4;
-    static const unsigned char bitsinbyte[256] = {0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8};
-
-    /* Count initial bytes not aligned to 32 bit. */
-    while((unsigned long)p & 3 && count) {
-        bits += bitsinbyte[*p++];
-        count--;
-    }
-
-    /* Count bits 28 bytes at a time */
-    p4 = (uint32_t*)p;
-    while(count>=28) {
-        uint32_t aux1, aux2, aux3, aux4, aux5, aux6, aux7;
-
-        aux1 = *p4++;
-        aux2 = *p4++;
-        aux3 = *p4++;
-        aux4 = *p4++;
-        aux5 = *p4++;
-        aux6 = *p4++;
-        aux7 = *p4++;
-        count -= 28;
-
-        aux1 = aux1 - ((aux1 >> 1) & 0x55555555);
-        aux1 = (aux1 & 0x33333333) + ((aux1 >> 2) & 0x33333333);
-        aux2 = aux2 - ((aux2 >> 1) & 0x55555555);
-        aux2 = (aux2 & 0x33333333) + ((aux2 >> 2) & 0x33333333);
-        aux3 = aux3 - ((aux3 >> 1) & 0x55555555);
-        aux3 = (aux3 & 0x33333333) + ((aux3 >> 2) & 0x33333333);
-        aux4 = aux4 - ((aux4 >> 1) & 0x55555555);
-        aux4 = (aux4 & 0x33333333) + ((aux4 >> 2) & 0x33333333);
-        aux5 = aux5 - ((aux5 >> 1) & 0x55555555);
-        aux5 = (aux5 & 0x33333333) + ((aux5 >> 2) & 0x33333333);
-        aux6 = aux6 - ((aux6 >> 1) & 0x55555555);
-        aux6 = (aux6 & 0x33333333) + ((aux6 >> 2) & 0x33333333);
-        aux7 = aux7 - ((aux7 >> 1) & 0x55555555);
-        aux7 = (aux7 & 0x33333333) + ((aux7 >> 2) & 0x33333333);
-        bits += ((((aux1 + (aux1 >> 4)) & 0x0F0F0F0F) +
-                    ((aux2 + (aux2 >> 4)) & 0x0F0F0F0F) +
-                    ((aux3 + (aux3 >> 4)) & 0x0F0F0F0F) +
-                    ((aux4 + (aux4 >> 4)) & 0x0F0F0F0F) +
-                    ((aux5 + (aux5 >> 4)) & 0x0F0F0F0F) +
-                    ((aux6 + (aux6 >> 4)) & 0x0F0F0F0F) +
-                    ((aux7 + (aux7 >> 4)) & 0x0F0F0F0F))* 0x01010101) >> 24;
-    }
-    /* Count the remaining bytes. */
-    p = (unsigned char*)p4;
-    while(count--) bits += bitsinbyte[*p++];
-    return bits;
-}
-
-/* Return the position of the first bit set to one (if 'bit' is 1) or
- * zero (if 'bit' is 0) in the bitmap starting at 's' and long 'count' bytes.
- *
- * The function is guaranteed to return a value >= 0 if 'bit' is 0 since if
- * no zero bit is found, it returns count*8 assuming the string is zero
- * padded on the right. However if 'bit' is 1 it is possible that there is
- * not a single set bit in the bitmap. In this special case -1 is returned. */
-long long redisBitpos(void *s, unsigned long count, int bit) {
-    unsigned long *l;
-    unsigned char *c;
-    unsigned long skipval, word = 0, one;
-    long long pos = 0; /* Position of bit, to return to the caller. */
-    unsigned long j;
-    int found;
-
-    /* Process whole words first, seeking for first word that is not
-     * all ones or all zeros respectively if we are looking for zeros
-     * or ones. This is much faster with large strings having contiguous
-     * blocks of 1 or 0 bits compared to the vanilla bit per bit processing.
-     *
-     * Note that if we start from an address that is not aligned
-     * to sizeof(unsigned long) we consume it byte by byte until it is
-     * aligned. */
-
-    /* Skip initial bits not aligned to sizeof(unsigned long) byte by byte. */
-    skipval = bit ? 0 : UCHAR_MAX;
-    c = (unsigned char*) s;
-    found = 0;
-    while((unsigned long)c & (sizeof(*l)-1) && count) {
-        if (*c != skipval) {
-            found = 1;
-            break;
-        }
-        c++;
-        count--;
-        pos += 8;
-    }
-
-    /* Skip bits with full word step. */
-    l = (unsigned long*) c;
-    if (!found) {
-        skipval = bit ? 0 : ULONG_MAX;
-        while (count >= sizeof(*l)) {
-            if (*l != skipval) break;
-            l++;
-            count -= sizeof(*l);
-            pos += sizeof(*l)*8;
-        }
-    }
-
-    /* Load bytes into "word" considering the first byte as the most significant
-     * (we basically consider it as written in big endian, since we consider the
-     * string as a set of bits from left to right, with the first bit at position
-     * zero.
-     *
-     * Note that the loading is designed to work even when the bytes left
-     * (count) are less than a full word. We pad it with zero on the right. */
-    c = (unsigned char*)l;
-    for (j = 0; j < sizeof(*l); j++) {
-        word <<= 8;
-        if (count) {
-            word |= *c;
-            c++;
-            count--;
-        }
-    }
-
-    /* Special case:
-     * If bits in the string are all zero and we are looking for one,
-     * return -1 to signal that there is not a single "1" in the whole
-     * string. This can't happen when we are looking for "0" as we assume
-     * that the right of the string is zero padded. */
-    if (bit == 1 && word == 0) return -1;
-
-    /* Last word left, scan bit by bit. The first thing we need is to
-     * have a single "1" set in the most significant position in an
-     * unsigned long. We don't know the size of the long so we use a
-     * simple trick. */
-    one = ULONG_MAX; /* All bits set to 1.*/
-    one >>= 1;       /* All bits set to 1 but the MSB. */
-    one = ~one;      /* All bits set to 0 but the MSB. */
-
-    while(one) {
-        if (((one & word) != 0) == bit) return pos;
-        pos++;
-        one >>= 1;
-    }
-
-    /* If we reached this point, there is a bug in the algorithm, since
-     * the case of no match is handled as a special case before. */
-    serverPanic("End of redisBitpos() reached.");
-    return 0; /* Just to avoid warnings. */
-}
-
-/* The following set.*Bitfield and get.*Bitfield functions implement setting
- * and getting arbitrary size (up to 64 bits) signed and unsigned integers
- * at arbitrary positions into a bitmap.
- *
- * The representation considers the bitmap as having the bit number 0 to be
- * the most significant bit of the first byte, and so forth, so for example
- * setting a 5 bits unsigned integer to value 23 at offset 7 into a bitmap
- * previously set to all zeroes, will produce the following representation:
- *
- * +--------+--------+
- * |00000001|01110000|
- * +--------+--------+
- *
- * When offsets and integer sizes are aligned to bytes boundaries, this is the
- * same as big endian, however when such alignment does not exist, its important
- * to also understand how the bits inside a byte are ordered.
- *
- * Note that this format follows the same convention as SETBIT and related
- * commands.
- */
-
-void setUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, uint64_t value) {
-    uint64_t byte, bit, byteval, bitval, j;
-
-    for (j = 0; j < bits; j++) {
-        bitval = (value & ((uint64_t)1<<(bits-1-j))) != 0;
-        byte = offset >> 3;
-        bit = 7 - (offset & 0x7);
-        byteval = p[byte];
-        byteval &= ~(1 << bit);
-        byteval |= bitval << bit;
-        p[byte] = byteval & 0xff;
-        offset++;
-    }
-}
-
-void setSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits, int64_t value) {
-    uint64_t uv = value; /* Casting will add UINT64_MAX + 1 if v is negative. */
-    setUnsignedBitfield(p,offset,bits,uv);
-}
-
-uint64_t getUnsignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {
-    uint64_t byte, bit, byteval, bitval, j, value = 0;
-
-    for (j = 0; j < bits; j++) {
-        byte = offset >> 3;
-        bit = 7 - (offset & 0x7);
-        byteval = p[byte];
-        bitval = (byteval >> bit) & 1;
-        value = (value<<1) | bitval;
-        offset++;
-    }
-    return value;
-}
-
-int64_t getSignedBitfield(unsigned char *p, uint64_t offset, uint64_t bits) {
-    int64_t value;
-    union {uint64_t u; int64_t i;} conv;
-
-    /* Converting from unsigned to signed is undefined when the value does
-     * not fit, however here we assume two's complement and the original value
-     * was obtained from signed -> unsigned conversion, so we'll find the
-     * most significant bit set if the original value was negative.
-     *
-     * Note that two's complement is mandatory for exact-width types
-     * according to the C99 standard. */
-    conv.u = getUnsignedBitfield(p,offset,bits);
-    value = conv.i;
-
-    /* If the top significant bit is 1, propagate it to all the
-     * higher bits for two's complement representation of signed
-     * integers. */
-    if (bits < 64 && (value & ((uint64_t)1 << (bits-1))))
-        value |= ((uint64_t)-1) << bits;
-    return value;
-}
-
-/* The following two functions detect overflow of a value in the context
- * of storing it as an unsigned or signed integer with the specified
- * number of bits. The functions both take the value and a possible increment.
- * If no overflow could happen and the value+increment fit inside the limits,
- * then zero is returned, otherwise in case of overflow, 1 is returned,
- * otherwise in case of underflow, -1 is returned.
- *
- * When non-zero is returned (overflow or underflow), if not NULL, *limit is
- * set to the value the operation should result when an overflow happens,
- * depending on the specified overflow semantics:
- *
- * For BFOVERFLOW_SAT if 1 is returned, *limit it is set maximum value that
- * you can store in that integer. when -1 is returned, *limit is set to the
- * minimum value that an integer of that size can represent.
- *
- * For BFOVERFLOW_WRAP *limit is set by performing the operation in order to
- * "wrap" around towards zero for unsigned integers, or towards the most
- * negative number that is possible to represent for signed integers. */
-
-#define BFOVERFLOW_WRAP 0
-#define BFOVERFLOW_SAT 1
-#define BFOVERFLOW_FAIL 2 /* Used by the BITFIELD command implementation. */
-
-int checkUnsignedBitfieldOverflow(uint64_t value, int64_t incr, uint64_t bits, int owtype, uint64_t *limit) {
-    uint64_t max = (bits == 64) ? UINT64_MAX : (((uint64_t)1<<bits)-1);
-    int64_t maxincr = max-value;
-    int64_t minincr = -value;
-
-    if (value > max || (incr > 0 && incr > maxincr)) {
-        if (limit) {
-            if (owtype == BFOVERFLOW_WRAP) {
-                goto handle_wrap;
-            } else if (owtype == BFOVERFLOW_SAT) {
-                *limit = max;
-            }
-        }
-        return 1;
-    } else if (incr < 0 && incr < minincr) {
-        if (limit) {
-            if (owtype == BFOVERFLOW_WRAP) {
-                goto handle_wrap;
-            } else if (owtype == BFOVERFLOW_SAT) {
-                *limit = 0;
-            }
-        }
-        return -1;
-    }
-    return 0;
-
-handle_wrap:
-    {
-        uint64_t mask = ((uint64_t)-1) << bits;
-        uint64_t res = value+incr;
-
-        res &= ~mask;
-        *limit = res;
-    }
-    return 1;
-}
-
-int checkSignedBitfieldOverflow(int64_t value, int64_t incr, uint64_t bits, int owtype, int64_t *limit) {
-    int64_t max = (bits == 64) ? INT64_MAX : (((int64_t)1<<(bits-1))-1);
-    int64_t min = (-max)-1;
-
-    /* Note that maxincr and minincr could overflow, but we use the values
-     * only after checking 'value' range, so when we use it no overflow
-     * happens. */
-    int64_t maxincr = max-value;
-    int64_t minincr = min-value;
-
-    if (value > max || (bits != 64 && incr > maxincr) || (value >= 0 && incr > 0 && incr > maxincr))
-    {
-        if (limit) {
-            if (owtype == BFOVERFLOW_WRAP) {
-                goto handle_wrap;
-            } else if (owtype == BFOVERFLOW_SAT) {
-                *limit = max;
-            }
-        }
-        return 1;
-    } else if (value < min || (bits != 64 && incr < minincr) || (value < 0 && incr < 0 && incr < minincr)) {
-        if (limit) {
-            if (owtype == BFOVERFLOW_WRAP) {
-                goto handle_wrap;
-            } else if (owtype == BFOVERFLOW_SAT) {
-                *limit = min;
-            }
-        }
-        return -1;
-    }
-    return 0;
-
-handle_wrap:
-    {
-        uint64_t msb = (uint64_t)1 << (bits-1);
-        uint64_t a = value, b = incr, c;
-        c = a+b; /* Perform addition as unsigned so that's defined. */
-
-        /* If the sign bit is set, propagate to all the higher order
-         * bits, to cap the negative value. If it's clear, mask to
-         * the positive integer limit. */
-        if (bits < 64) {
-            uint64_t mask = ((uint64_t)-1) << bits;
-            if (c & msb) {
-                c |= mask;
-            } else {
-                c &= ~mask;
-            }
-        }
-        *limit = c;
-    }
-    return 1;
-}
-
-/* Debugging function. Just show bits in the specified bitmap. Not used
- * but here for not having to rewrite it when debugging is needed. */
-void printBits(unsigned char *p, unsigned long count) {
-    unsigned long j, i, byte;
-
-    for (j = 0; j < count; j++) {
-        byte = p[j];
-        for (i = 0x80; i > 0; i /= 2)
-            printf("%c", (byte & i) ? '1' : '0');
-        printf("|");
-    }
-    printf("\n");
-}
-
-/* -----------------------------------------------------------------------------
- * Bits related string commands: GETBIT, SETBIT, BITCOUNT, BITOP.
- * -------------------------------------------------------------------------- */
-
-#define BITOP_AND   0
-#define BITOP_OR    1
-#define BITOP_XOR   2
-#define BITOP_NOT   3
-
-#define BITFIELDOP_GET 0
-#define BITFIELDOP_SET 1
-#define BITFIELDOP_INCRBY 2
-
-/* This helper function used by GETBIT / SETBIT parses the bit offset argument
- * making sure an error is returned if it is negative or if it overflows
- * Redis 512 MB limit for the string value or more (server.proto_max_bulk_len).
- *
- * If the 'hash' argument is true, and 'bits is positive, then the command
- * will also parse bit offsets prefixed by "#". In such a case the offset
- * is multiplied by 'bits'. This is useful for the BITFIELD command. */
-int getBitOffsetFromArgument(client *c, robj *o, uint64_t *offset, int hash, int bits) {
-    long long loffset;
-    char *err = "bit offset is not an integer or out of range";
-    char *p = o->ptr;
-    size_t plen = sdslen(p);
-    int usehash = 0;
-
-    /* Handle #<offset> form. */
-    if (p[0] == '#' && hash && bits > 0) usehash = 1;
-
-    if (string2ll(p+usehash,plen-usehash,&loffset) == 0) {
-        addReplyError(c,err);
-        return C_ERR;
-    }
-
-    /* Adjust the offset by 'bits' for #<offset> form. */
-    if (usehash) loffset *= bits;
-
-    /* Limit offset to server.proto_max_bulk_len (512MB in bytes by default) */
-    if ((loffset < 0) || (loffset >> 3) >= server.proto_max_bulk_len)
-    {
-        addReplyError(c,err);
-        return C_ERR;
-    }
-
-    *offset = loffset;
-    return C_OK;
-}
-
-/* This helper function for BITFIELD parses a bitfield type in the form
- * <sign><bits> where sign is 'u' or 'i' for unsigned and signed, and
- * the bits is a value between 1 and 64. However 64 bits unsigned integers
- * are reported as an error because of current limitations of Redis protocol
- * to return unsigned integer values greater than INT64_MAX.
- *
- * On error C_ERR is returned and an error is sent to the client. */
-int getBitfieldTypeFromArgument(client *c, robj *o, int *sign, int *bits) {
-    char *p = o->ptr;
-    char *err = "Invalid bitfield type. Use something like i16 u8. Note that u64 is not supported but i64 is.";
-    long long llbits;
-
-    if (p[0] == 'i') {
-        *sign = 1;
-    } else if (p[0] == 'u') {
-        *sign = 0;
-    } else {
-        addReplyError(c,err);
-        return C_ERR;
-    }
-
-    if ((string2ll(p+1,strlen(p+1),&llbits)) == 0 ||
-        llbits < 1 ||
-        (*sign == 1 && llbits > 64) ||
-        (*sign == 0 && llbits > 63))
-    {
-        addReplyError(c,err);
-        return C_ERR;
-    }
-    *bits = llbits;
-    return C_OK;
-}
-
-/* This is an helper function for commands implementations that need to write
- * bits to a string object. The command creates or pad with zeroes the string
- * so that the 'maxbit' bit can be addressed. The object is finally
- * returned. Otherwise if the key holds a wrong type NULL is returned and
- * an error is sent to the client. */
-robj *lookupStringForBitCommand(client *c, uint64_t maxbit) {
-    size_t byte = maxbit >> 3;
-    robj *o = lookupKeyWrite(c->db,c->argv[1]);
-    if (checkType(c,o,OBJ_STRING)) return NULL;
-
-    if (o == NULL) {
-        o = createObject(OBJ_STRING,sdsnewlen(NULL, byte+1));
-        dbAdd(c->db,c->argv[1],o);
-    } else {
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-        o->ptr = sdsgrowzero(o->ptr,byte+1);
-    }
-    return o;
-}
-
-/* Return a pointer to the string object content, and stores its length
- * in 'len'. The user is required to pass (likely stack allocated) buffer
- * 'llbuf' of at least LONG_STR_SIZE bytes. Such a buffer is used in the case
- * the object is integer encoded in order to provide the representation
- * without using heap allocation.
- *
- * The function returns the pointer to the object array of bytes representing
- * the string it contains, that may be a pointer to 'llbuf' or to the
- * internal object representation. As a side effect 'len' is filled with
- * the length of such buffer.
- *
- * If the source object is NULL the function is guaranteed to return NULL
- * and set 'len' to 0. */
-unsigned char *getObjectReadOnlyString(robj *o, long *len, char *llbuf) {
-    serverAssert(o->type == OBJ_STRING);
-    unsigned char *p = NULL;
-
-    /* Set the 'p' pointer to the string, that can be just a stack allocated
-     * array if our string was integer encoded. */
-    if (o && o->encoding == OBJ_ENCODING_INT) {
-        p = (unsigned char*) llbuf;
-        if (len) *len = ll2string(llbuf,LONG_STR_SIZE,(long)o->ptr);
-    } else if (o) {
-        p = (unsigned char*) o->ptr;
-        if (len) *len = sdslen(o->ptr);
-    } else {
-        if (len) *len = 0;
-    }
-    return p;
-}
-
-/* SETBIT key offset bitvalue */
-void setbitCommand(client *c) {
-    robj *o;
-    char *err = "bit is not an integer or out of range";
-    uint64_t bitoffset;
-    ssize_t byte, bit;
-    int byteval, bitval;
-    long on;
-
-    if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != C_OK)
-        return;
-
-    if (getLongFromObjectOrReply(c,c->argv[3],&on,err) != C_OK)
-        return;
-
-    /* Bits can only be set or cleared... */
-    if (on & ~1) {
-        addReplyError(c,err);
-        return;
-    }
-
-    if ((o = lookupStringForBitCommand(c,bitoffset)) == NULL) return;
-
-    /* Get current values */
-    byte = bitoffset >> 3;
-    byteval = ((uint8_t*)o->ptr)[byte];
-    bit = 7 - (bitoffset & 0x7);
-    bitval = byteval & (1 << bit);
-
-    /* Update byte with new bit value and return original value */
-    byteval &= ~(1 << bit);
-    byteval |= ((on & 0x1) << bit);
-    ((uint8_t*)o->ptr)[byte] = byteval;
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_STRING,"setbit",c->argv[1],c->db->id);
-    server.dirty++;
-    addReply(c, bitval ? shared.cone : shared.czero);
-}
-
-/* GETBIT key offset */
-void getbitCommand(client *c) {
-    robj *o;
-    char llbuf[32];
-    uint64_t bitoffset;
-    size_t byte, bit;
-    size_t bitval = 0;
-
-    if (getBitOffsetFromArgument(c,c->argv[2],&bitoffset,0,0) != C_OK)
-        return;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_STRING)) return;
-
-    byte = bitoffset >> 3;
-    bit = 7 - (bitoffset & 0x7);
-    if (sdsEncodedObject(o)) {
-        if (byte < sdslen(o->ptr))
-            bitval = ((uint8_t*)o->ptr)[byte] & (1 << bit);
-    } else {
-        if (byte < (size_t)ll2string(llbuf,sizeof(llbuf),(long)o->ptr))
-            bitval = llbuf[byte] & (1 << bit);
-    }
-
-    addReply(c, bitval ? shared.cone : shared.czero);
-}
-
-/* BITOP op_name target_key src_key1 src_key2 src_key3 ... src_keyN */
-void bitopCommand(client *c) {
-    char *opname = c->argv[1]->ptr;
-    robj *o, *targetkey = c->argv[2];
-    unsigned long op, j, numkeys;
-    robj **objects;      /* Array of source objects. */
-    unsigned char **src; /* Array of source strings pointers. */
-    unsigned long *len, maxlen = 0; /* Array of length of src strings,
-                                       and max len. */
-    unsigned long minlen = 0;    /* Min len among the input keys. */
-    unsigned char *res = NULL; /* Resulting string. */
-
-    /* Parse the operation name. */
-    if ((opname[0] == 'a' || opname[0] == 'A') && !strcasecmp(opname,"and"))
-        op = BITOP_AND;
-    else if((opname[0] == 'o' || opname[0] == 'O') && !strcasecmp(opname,"or"))
-        op = BITOP_OR;
-    else if((opname[0] == 'x' || opname[0] == 'X') && !strcasecmp(opname,"xor"))
-        op = BITOP_XOR;
-    else if((opname[0] == 'n' || opname[0] == 'N') && !strcasecmp(opname,"not"))
-        op = BITOP_NOT;
-    else {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Sanity check: NOT accepts only a single key argument. */
-    if (op == BITOP_NOT && c->argc != 4) {
-        addReplyError(c,"BITOP NOT must be called with a single source key.");
-        return;
-    }
-
-    /* Lookup keys, and store pointers to the string objects into an array. */
-    numkeys = c->argc - 3;
-    src = zmalloc(sizeof(unsigned char*) * numkeys);
-    len = zmalloc(sizeof(long) * numkeys);
-    objects = zmalloc(sizeof(robj*) * numkeys);
-    for (j = 0; j < numkeys; j++) {
-        o = lookupKeyRead(c->db,c->argv[j+3]);
-        /* Handle non-existing keys as empty strings. */
-        if (o == NULL) {
-            objects[j] = NULL;
-            src[j] = NULL;
-            len[j] = 0;
-            minlen = 0;
-            continue;
-        }
-        /* Return an error if one of the keys is not a string. */
-        if (checkType(c,o,OBJ_STRING)) {
-            unsigned long i;
-            for (i = 0; i < j; i++) {
-                if (objects[i])
-                    decrRefCount(objects[i]);
-            }
-            zfree(src);
-            zfree(len);
-            zfree(objects);
-            return;
-        }
-        objects[j] = getDecodedObject(o);
-        src[j] = objects[j]->ptr;
-        len[j] = sdslen(objects[j]->ptr);
-        if (len[j] > maxlen) maxlen = len[j];
-        if (j == 0 || len[j] < minlen) minlen = len[j];
-    }
-
-    /* Compute the bit operation, if at least one string is not empty. */
-    if (maxlen) {
-        res = (unsigned char*) sdsnewlen(NULL,maxlen);
-        unsigned char output, byte;
-        unsigned long i;
-
-        /* Fast path: as far as we have data for all the input bitmaps we
-         * can take a fast path that performs much better than the
-         * vanilla algorithm. On ARM we skip the fast path since it will
-         * result in GCC compiling the code using multiple-words load/store
-         * operations that are not supported even in ARM >= v6. */
-        j = 0;
-        #ifndef USE_ALIGNED_ACCESS
-        if (minlen >= sizeof(unsigned long)*4 && numkeys <= 16) {
-            unsigned long *lp[16];
-            unsigned long *lres = (unsigned long*) res;
-
-            /* Note: sds pointer is always aligned to 8 byte boundary. */
-            memcpy(lp,src,sizeof(unsigned long*)*numkeys);
-            memcpy(res,src[0],minlen);
-
-            /* Different branches per different operations for speed (sorry). */
-            if (op == BITOP_AND) {
-                while(minlen >= sizeof(unsigned long)*4) {
-                    for (i = 1; i < numkeys; i++) {
-                        lres[0] &= lp[i][0];
-                        lres[1] &= lp[i][1];
-                        lres[2] &= lp[i][2];
-                        lres[3] &= lp[i][3];
-                        lp[i]+=4;
-                    }
-                    lres+=4;
-                    j += sizeof(unsigned long)*4;
-                    minlen -= sizeof(unsigned long)*4;
-                }
-            } else if (op == BITOP_OR) {
-                while(minlen >= sizeof(unsigned long)*4) {
-                    for (i = 1; i < numkeys; i++) {
-                        lres[0] |= lp[i][0];
-                        lres[1] |= lp[i][1];
-                        lres[2] |= lp[i][2];
-                        lres[3] |= lp[i][3];
-                        lp[i]+=4;
-                    }
-                    lres+=4;
-                    j += sizeof(unsigned long)*4;
-                    minlen -= sizeof(unsigned long)*4;
-                }
-            } else if (op == BITOP_XOR) {
-                while(minlen >= sizeof(unsigned long)*4) {
-                    for (i = 1; i < numkeys; i++) {
-                        lres[0] ^= lp[i][0];
-                        lres[1] ^= lp[i][1];
-                        lres[2] ^= lp[i][2];
-                        lres[3] ^= lp[i][3];
-                        lp[i]+=4;
-                    }
-                    lres+=4;
-                    j += sizeof(unsigned long)*4;
-                    minlen -= sizeof(unsigned long)*4;
-                }
-            } else if (op == BITOP_NOT) {
-                while(minlen >= sizeof(unsigned long)*4) {
-                    lres[0] = ~lres[0];
-                    lres[1] = ~lres[1];
-                    lres[2] = ~lres[2];
-                    lres[3] = ~lres[3];
-                    lres+=4;
-                    j += sizeof(unsigned long)*4;
-                    minlen -= sizeof(unsigned long)*4;
-                }
-            }
-        }
-        #endif
-
-        /* j is set to the next byte to process by the previous loop. */
-        for (; j < maxlen; j++) {
-            output = (len[0] <= j) ? 0 : src[0][j];
-            if (op == BITOP_NOT) output = ~output;
-            for (i = 1; i < numkeys; i++) {
-                int skip = 0;
-                byte = (len[i] <= j) ? 0 : src[i][j];
-                switch(op) {
-                case BITOP_AND:
-                    output &= byte;
-                    skip = (output == 0);
-                    break;
-                case BITOP_OR:
-                    output |= byte;
-                    skip = (output == 0xff);
-                    break;
-                case BITOP_XOR: output ^= byte; break;
-                }
-
-                if (skip) {
-                    break;
-                }
-            }
-            res[j] = output;
-        }
-    }
-    for (j = 0; j < numkeys; j++) {
-        if (objects[j])
-            decrRefCount(objects[j]);
-    }
-    zfree(src);
-    zfree(len);
-    zfree(objects);
-
-    /* Store the computed value into the target key */
-    if (maxlen) {
-        o = createObject(OBJ_STRING,res);
-        setKey(c,c->db,targetkey,o);
-        notifyKeyspaceEvent(NOTIFY_STRING,"set",targetkey,c->db->id);
-        decrRefCount(o);
-        server.dirty++;
-    } else if (dbDelete(c->db,targetkey)) {
-        signalModifiedKey(c,c->db,targetkey);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",targetkey,c->db->id);
-        server.dirty++;
-    }
-    addReplyLongLong(c,maxlen); /* Return the output string length in bytes. */
-}
-
-/* BITCOUNT key [start end] */
-void bitcountCommand(client *c) {
-    robj *o;
-    long start, end, strlen;
-    unsigned char *p;
-    char llbuf[LONG_STR_SIZE];
-
-    /* Lookup, check for type, and return 0 for non existing keys. */
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_STRING)) return;
-    p = getObjectReadOnlyString(o,&strlen,llbuf);
-
-    /* Parse start/end range if any. */
-    if (c->argc == 4) {
-        if (getLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK)
-            return;
-        if (getLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK)
-            return;
-        /* Convert negative indexes */
-        if (start < 0 && end < 0 && start > end) {
-            addReply(c,shared.czero);
-            return;
-        }
-        if (start < 0) start = strlen+start;
-        if (end < 0) end = strlen+end;
-        if (start < 0) start = 0;
-        if (end < 0) end = 0;
-        if (end >= strlen) end = strlen-1;
-    } else if (c->argc == 2) {
-        /* The whole string. */
-        start = 0;
-        end = strlen-1;
-    } else {
-        /* Syntax error. */
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Precondition: end >= 0 && end < strlen, so the only condition where
-     * zero can be returned is: start > end. */
-    if (start > end) {
-        addReply(c,shared.czero);
-    } else {
-        long bytes = end-start+1;
-
-        addReplyLongLong(c,redisPopcount(p+start,bytes));
-    }
-}
-
-/* BITPOS key bit [start [end]] */
-void bitposCommand(client *c) {
-    robj *o;
-    long bit, start, end, strlen;
-    unsigned char *p;
-    char llbuf[LONG_STR_SIZE];
-    int end_given = 0;
-
-    /* Parse the bit argument to understand what we are looking for, set
-     * or clear bits. */
-    if (getLongFromObjectOrReply(c,c->argv[2],&bit,NULL) != C_OK)
-        return;
-    if (bit != 0 && bit != 1) {
-        addReplyError(c, "The bit argument must be 1 or 0.");
-        return;
-    }
-
-    /* If the key does not exist, from our point of view it is an infinite
-     * array of 0 bits. If the user is looking for the fist clear bit return 0,
-     * If the user is looking for the first set bit, return -1. */
-    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
-        addReplyLongLong(c, bit ? -1 : 0);
-        return;
-    }
-    if (checkType(c,o,OBJ_STRING)) return;
-    p = getObjectReadOnlyString(o,&strlen,llbuf);
-
-    /* Parse start/end range if any. */
-    if (c->argc == 4 || c->argc == 5) {
-        if (getLongFromObjectOrReply(c,c->argv[3],&start,NULL) != C_OK)
-            return;
-        if (c->argc == 5) {
-            if (getLongFromObjectOrReply(c,c->argv[4],&end,NULL) != C_OK)
-                return;
-            end_given = 1;
-        } else {
-            end = strlen-1;
-        }
-        /* Convert negative indexes */
-        if (start < 0) start = strlen+start;
-        if (end < 0) end = strlen+end;
-        if (start < 0) start = 0;
-        if (end < 0) end = 0;
-        if (end >= strlen) end = strlen-1;
-    } else if (c->argc == 3) {
-        /* The whole string. */
-        start = 0;
-        end = strlen-1;
-    } else {
-        /* Syntax error. */
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* For empty ranges (start > end) we return -1 as an empty range does
-     * not contain a 0 nor a 1. */
-    if (start > end) {
-        addReplyLongLong(c, -1);
-    } else {
-        long bytes = end-start+1;
-        long long pos = redisBitpos(p+start,bytes,bit);
-
-        /* If we are looking for clear bits, and the user specified an exact
-         * range with start-end, we can't consider the right of the range as
-         * zero padded (as we do when no explicit end is given).
-         *
-         * So if redisBitpos() returns the first bit outside the range,
-         * we return -1 to the caller, to mean, in the specified range there
-         * is not a single "0" bit. */
-        if (end_given && bit == 0 && pos == (long long)bytes<<3) {
-            addReplyLongLong(c,-1);
-            return;
-        }
-        if (pos != -1) pos += (long long)start<<3; /* Adjust for the bytes we skipped. */
-        addReplyLongLong(c,pos);
-    }
-}
-
-/* BITFIELD key subcommmand-1 arg ... subcommand-2 arg ... subcommand-N ...
- *
- * Supported subcommands:
- *
- * GET <type> <offset>
- * SET <type> <offset> <value>
- * INCRBY <type> <offset> <increment>
- * OVERFLOW [WRAP|SAT|FAIL]
- */
-
-#define BITFIELD_FLAG_NONE      0
-#define BITFIELD_FLAG_READONLY  (1<<0)
-
-struct bitfieldOp {
-    uint64_t offset;    /* Bitfield offset. */
-    int64_t i64;        /* Increment amount (INCRBY) or SET value */
-    int opcode;         /* Operation id. */
-    int owtype;         /* Overflow type to use. */
-    int bits;           /* Integer bitfield bits width. */
-    int sign;           /* True if signed, otherwise unsigned op. */
-};
-
-/* This implements both the BITFIELD command and the BITFIELD_RO command
- * when flags is set to BITFIELD_FLAG_READONLY: in this case only the
- * GET subcommand is allowed, other subcommands will return an error. */
-void bitfieldGeneric(client *c, int flags) {
-    robj *o;
-    uint64_t bitoffset;
-    int j, numops = 0, changes = 0;
-    struct bitfieldOp *ops = NULL; /* Array of ops to execute at end. */
-    int owtype = BFOVERFLOW_WRAP; /* Overflow type. */
-    int readonly = 1;
-    uint64_t highest_write_offset = 0;
-
-    for (j = 2; j < c->argc; j++) {
-        int remargs = c->argc-j-1; /* Remaining args other than current. */
-        char *subcmd = c->argv[j]->ptr; /* Current command name. */
-        int opcode; /* Current operation code. */
-        long long i64 = 0;  /* Signed SET value. */
-        int sign = 0; /* Signed or unsigned type? */
-        int bits = 0; /* Bitfield width in bits. */
-
-        if (!strcasecmp(subcmd,"get") && remargs >= 2)
-            opcode = BITFIELDOP_GET;
-        else if (!strcasecmp(subcmd,"set") && remargs >= 3)
-            opcode = BITFIELDOP_SET;
-        else if (!strcasecmp(subcmd,"incrby") && remargs >= 3)
-            opcode = BITFIELDOP_INCRBY;
-        else if (!strcasecmp(subcmd,"overflow") && remargs >= 1) {
-            char *owtypename = c->argv[j+1]->ptr;
-            j++;
-            if (!strcasecmp(owtypename,"wrap"))
-                owtype = BFOVERFLOW_WRAP;
-            else if (!strcasecmp(owtypename,"sat"))
-                owtype = BFOVERFLOW_SAT;
-            else if (!strcasecmp(owtypename,"fail"))
-                owtype = BFOVERFLOW_FAIL;
-            else {
-                addReplyError(c,"Invalid OVERFLOW type specified");
-                zfree(ops);
-                return;
-            }
-            continue;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            zfree(ops);
-            return;
-        }
-
-        /* Get the type and offset arguments, common to all the ops. */
-        if (getBitfieldTypeFromArgument(c,c->argv[j+1],&sign,&bits) != C_OK) {
-            zfree(ops);
-            return;
-        }
-
-        if (getBitOffsetFromArgument(c,c->argv[j+2],&bitoffset,1,bits) != C_OK){
-            zfree(ops);
-            return;
-        }
-
-        if (opcode != BITFIELDOP_GET) {
-            readonly = 0;
-            if (highest_write_offset < bitoffset + bits - 1)
-                highest_write_offset = bitoffset + bits - 1;
-            /* INCRBY and SET require another argument. */
-            if (getLongLongFromObjectOrReply(c,c->argv[j+3],&i64,NULL) != C_OK){
-                zfree(ops);
-                return;
-            }
-        }
-
-        /* Populate the array of operations we'll process. */
-        ops = zrealloc(ops,sizeof(*ops)*(numops+1));
-        ops[numops].offset = bitoffset;
-        ops[numops].i64 = i64;
-        ops[numops].opcode = opcode;
-        ops[numops].owtype = owtype;
-        ops[numops].bits = bits;
-        ops[numops].sign = sign;
-        numops++;
-
-        j += 3 - (opcode == BITFIELDOP_GET);
-    }
-
-    if (readonly) {
-        /* Lookup for read is ok if key doesn't exit, but errors
-         * if it's not a string. */
-        o = lookupKeyRead(c->db,c->argv[1]);
-        if (o != NULL && checkType(c,o,OBJ_STRING)) {
-            zfree(ops);
-            return;
-        }
-    } else {
-        if (flags & BITFIELD_FLAG_READONLY) {
-            zfree(ops);
-            addReplyError(c, "BITFIELD_RO only supports the GET subcommand");
-            return;
-        }
-
-        /* Lookup by making room up to the farest bit reached by
-         * this operation. */
-        if ((o = lookupStringForBitCommand(c,
-            highest_write_offset)) == NULL) {
-            zfree(ops);
-            return;
-        }
-    }
-
-    addReplyArrayLen(c,numops);
-
-    /* Actually process the operations. */
-    for (j = 0; j < numops; j++) {
-        struct bitfieldOp *thisop = ops+j;
-
-        /* Execute the operation. */
-        if (thisop->opcode == BITFIELDOP_SET ||
-            thisop->opcode == BITFIELDOP_INCRBY)
-        {
-            /* SET and INCRBY: We handle both with the same code path
-             * for simplicity. SET return value is the previous value so
-             * we need fetch & store as well. */
-
-            /* We need two different but very similar code paths for signed
-             * and unsigned operations, since the set of functions to get/set
-             * the integers and the used variables types are different. */
-            if (thisop->sign) {
-                int64_t oldval, newval, wrapped, retval;
-                int overflow;
-
-                oldval = getSignedBitfield(o->ptr,thisop->offset,
-                        thisop->bits);
-
-                if (thisop->opcode == BITFIELDOP_INCRBY) {
-                    newval = oldval + thisop->i64;
-                    overflow = checkSignedBitfieldOverflow(oldval,
-                            thisop->i64,thisop->bits,thisop->owtype,&wrapped);
-                    if (overflow) newval = wrapped;
-                    retval = newval;
-                } else {
-                    newval = thisop->i64;
-                    overflow = checkSignedBitfieldOverflow(newval,
-                            0,thisop->bits,thisop->owtype,&wrapped);
-                    if (overflow) newval = wrapped;
-                    retval = oldval;
-                }
-
-                /* On overflow of type is "FAIL", don't write and return
-                 * NULL to signal the condition. */
-                if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {
-                    addReplyLongLong(c,retval);
-                    setSignedBitfield(o->ptr,thisop->offset,
-                                      thisop->bits,newval);
-                } else {
-                    addReplyNull(c);
-                }
-            } else {
-                uint64_t oldval, newval, wrapped, retval;
-                int overflow;
-
-                oldval = getUnsignedBitfield(o->ptr,thisop->offset,
-                        thisop->bits);
-
-                if (thisop->opcode == BITFIELDOP_INCRBY) {
-                    newval = oldval + thisop->i64;
-                    overflow = checkUnsignedBitfieldOverflow(oldval,
-                            thisop->i64,thisop->bits,thisop->owtype,&wrapped);
-                    if (overflow) newval = wrapped;
-                    retval = newval;
-                } else {
-                    newval = thisop->i64;
-                    overflow = checkUnsignedBitfieldOverflow(newval,
-                            0,thisop->bits,thisop->owtype,&wrapped);
-                    if (overflow) newval = wrapped;
-                    retval = oldval;
-                }
-                /* On overflow of type is "FAIL", don't write and return
-                 * NULL to signal the condition. */
-                if (!(overflow && thisop->owtype == BFOVERFLOW_FAIL)) {
-                    addReplyLongLong(c,retval);
-                    setUnsignedBitfield(o->ptr,thisop->offset,
-                                        thisop->bits,newval);
-                } else {
-                    addReplyNull(c);
-                }
-            }
-            changes++;
-        } else {
-            /* GET */
-            unsigned char buf[9];
-            long strlen = 0;
-            unsigned char *src = NULL;
-            char llbuf[LONG_STR_SIZE];
-
-            if (o != NULL)
-                src = getObjectReadOnlyString(o,&strlen,llbuf);
-
-            /* For GET we use a trick: before executing the operation
-             * copy up to 9 bytes to a local buffer, so that we can easily
-             * execute up to 64 bit operations that are at actual string
-             * object boundaries. */
-            memset(buf,0,9);
-            int i;
-            uint64_t byte = thisop->offset >> 3;
-            for (i = 0; i < 9; i++) {
-                if (src == NULL || i+byte >= (uint64_t)strlen) break;
-                buf[i] = src[i+byte];
-            }
-
-            /* Now operate on the copied buffer which is guaranteed
-             * to be zero-padded. */
-            if (thisop->sign) {
-                int64_t val = getSignedBitfield(buf,thisop->offset-(byte*8),
-                                            thisop->bits);
-                addReplyLongLong(c,val);
-            } else {
-                uint64_t val = getUnsignedBitfield(buf,thisop->offset-(byte*8),
-                                            thisop->bits);
-                addReplyLongLong(c,val);
-            }
-        }
-    }
-
-    if (changes) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_STRING,"setbit",c->argv[1],c->db->id);
-        server.dirty += changes;
-    }
-    zfree(ops);
-}
-
-void bitfieldCommand(client *c) {
-    bitfieldGeneric(c, BITFIELD_FLAG_NONE);
-}
-
-void bitfieldroCommand(client *c) {
-    bitfieldGeneric(c, BITFIELD_FLAG_READONLY);
-}
diff --git a/redis-stable/src/blocked.c b/redis-stable/src/blocked.c
deleted file mode 100644
index df3b6a92..00000000
--- a/redis-stable/src/blocked.c
+++ /dev/null
@@ -1,768 +0,0 @@
-/* blocked.c - generic support for blocking operations like BLPOP & WAIT.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * ---------------------------------------------------------------------------
- *
- * API:
- *
- * blockClient() set the CLIENT_BLOCKED flag in the client, and set the
- * specified block type 'btype' filed to one of BLOCKED_* macros.
- *
- * unblockClient() unblocks the client doing the following:
- * 1) It calls the btype-specific function to cleanup the state.
- * 2) It unblocks the client by unsetting the CLIENT_BLOCKED flag.
- * 3) It puts the client into a list of just unblocked clients that are
- *    processed ASAP in the beforeSleep() event loop callback, so that
- *    if there is some query buffer to process, we do it. This is also
- *    required because otherwise there is no 'readable' event fired, we
- *    already read the pending commands. We also set the CLIENT_UNBLOCKED
- *    flag to remember the client is in the unblocked_clients list.
- *
- * processUnblockedClients() is called inside the beforeSleep() function
- * to process the query buffer from unblocked clients and remove the clients
- * from the blocked_clients queue.
- *
- * replyToBlockedClientTimedOut() is called by the cron function when
- * a client blocked reaches the specified timeout (if the timeout is set
- * to 0, no timeout is processed).
- * It usually just needs to send a reply to the client.
- *
- * When implementing a new type of blocking operation, the implementation
- * should modify unblockClient() and replyToBlockedClientTimedOut() in order
- * to handle the btype-specific behavior of this two functions.
- * If the blocking operation waits for certain keys to change state, the
- * clusterRedirectBlockedClientIfNeeded() function should also be updated.
- */
-
-#include "server.h"
-#include "slowlog.h"
-#include "latency.h"
-#include "monotonic.h"
-
-int serveClientBlockedOnList(client *receiver, robj *key, robj *dstkey, redisDb *db, robj *value, int wherefrom, int whereto);
-int getListPositionFromObjectOrReply(client *c, robj *arg, int *position);
-
-/* This structure represents the blocked key information that we store
- * in the client structure. Each client blocked on keys, has a
- * client->bpop.keys hash table. The keys of the hash table are Redis
- * keys pointers to 'robj' structures. The value is this structure.
- * The structure has two goals: firstly we store the list node that this
- * client uses to be listed in the database "blocked clients for this key"
- * list, so we can later unblock in O(1) without a list scan.
- * Secondly for certain blocking types, we have additional info. Right now
- * the only use for additional info we have is when clients are blocked
- * on streams, as we have to remember the ID it blocked for. */
-typedef struct bkinfo {
-    listNode *listnode;     /* List node for db->blocking_keys[key] list. */
-    streamID stream_id;     /* Stream ID if we blocked in a stream. */
-} bkinfo;
-
-/* Block a client for the specific operation type. Once the CLIENT_BLOCKED
- * flag is set client query buffer is not longer processed, but accumulated,
- * and will be processed when the client is unblocked. */
-void blockClient(client *c, int btype) {
-    /* Master client should never be blocked unless pause or module */
-    serverAssert(!(c->flags & CLIENT_MASTER &&
-                   btype != BLOCKED_MODULE &&
-                   btype != BLOCKED_PAUSE));
-
-    c->flags |= CLIENT_BLOCKED;
-    c->btype = btype;
-    server.blocked_clients++;
-    server.blocked_clients_by_type[btype]++;
-    addClientToTimeoutTable(c);
-    if (btype == BLOCKED_PAUSE) {
-        listAddNodeTail(server.paused_clients, c);
-        c->paused_list_node = listLast(server.paused_clients);
-        /* Mark this client to execute its command */
-        c->flags |= CLIENT_PENDING_COMMAND;
-    }
-}
-
-/* This function is called after a client has finished a blocking operation
- * in order to update the total command duration, log the command into
- * the Slow log if needed, and log the reply duration event if needed. */
-void updateStatsOnUnblock(client *c, long blocked_us, long reply_us){
-    const ustime_t total_cmd_duration = c->duration + blocked_us + reply_us;
-    c->lastcmd->microseconds += total_cmd_duration;
-
-    /* Log the command into the Slow log if needed. */
-    slowlogPushCurrentCommand(c, c->lastcmd, total_cmd_duration);
-    /* Log the reply duration event. */
-    latencyAddSampleIfNeeded("command-unblocking",reply_us/1000);
-}
-
-/* This function is called in the beforeSleep() function of the event loop
- * in order to process the pending input buffer of clients that were
- * unblocked after a blocking operation. */
-void processUnblockedClients(void) {
-    listNode *ln;
-    client *c;
-
-    while (listLength(server.unblocked_clients)) {
-        ln = listFirst(server.unblocked_clients);
-        serverAssert(ln != NULL);
-        c = ln->value;
-        listDelNode(server.unblocked_clients,ln);
-        c->flags &= ~CLIENT_UNBLOCKED;
-
-        /* Process remaining data in the input buffer, unless the client
-         * is blocked again. Actually processInputBuffer() checks that the
-         * client is not blocked before to proceed, but things may change and
-         * the code is conceptually more correct this way. */
-        if (!(c->flags & CLIENT_BLOCKED)) {
-            /* If we have a queued command, execute it now. */
-            if (processPendingCommandsAndResetClient(c) == C_ERR) {
-                continue;
-            }
-            /* Then process client if it has more data in it's buffer. */
-            if (c->querybuf && sdslen(c->querybuf) > 0) {
-                processInputBuffer(c);
-            }
-        }
-    }
-}
-
-/* This function will schedule the client for reprocessing at a safe time.
- *
- * This is useful when a client was blocked for some reason (blocking operation,
- * CLIENT PAUSE, or whatever), because it may end with some accumulated query
- * buffer that needs to be processed ASAP:
- *
- * 1. When a client is blocked, its readable handler is still active.
- * 2. However in this case it only gets data into the query buffer, but the
- *    query is not parsed or executed once there is enough to proceed as
- *    usually (because the client is blocked... so we can't execute commands).
- * 3. When the client is unblocked, without this function, the client would
- *    have to write some query in order for the readable handler to finally
- *    call processQueryBuffer*() on it.
- * 4. With this function instead we can put the client in a queue that will
- *    process it for queries ready to be executed at a safe time.
- */
-void queueClientForReprocessing(client *c) {
-    /* The client may already be into the unblocked list because of a previous
-     * blocking operation, don't add back it into the list multiple times. */
-    if (!(c->flags & CLIENT_UNBLOCKED)) {
-        c->flags |= CLIENT_UNBLOCKED;
-        listAddNodeTail(server.unblocked_clients,c);
-    }
-}
-
-/* Unblock a client calling the right function depending on the kind
- * of operation the client is blocking for. */
-void unblockClient(client *c) {
-    if (c->btype == BLOCKED_LIST ||
-        c->btype == BLOCKED_ZSET ||
-        c->btype == BLOCKED_STREAM) {
-        unblockClientWaitingData(c);
-    } else if (c->btype == BLOCKED_WAIT) {
-        unblockClientWaitingReplicas(c);
-    } else if (c->btype == BLOCKED_MODULE) {
-        if (moduleClientIsBlockedOnKeys(c)) unblockClientWaitingData(c);
-        unblockClientFromModule(c);
-    } else if (c->btype == BLOCKED_PAUSE) {
-        listDelNode(server.paused_clients,c->paused_list_node);
-        c->paused_list_node = NULL;
-    } else {
-        serverPanic("Unknown btype in unblockClient().");
-    }
-
-    /* Reset the client for a new query since, for blocking commands
-     * we do not do it immediately after the command returns (when the
-     * client got blocked) in order to be still able to access the argument
-     * vector from module callbacks and updateStatsOnUnblock. */
-    if (c->btype != BLOCKED_PAUSE) {
-        freeClientOriginalArgv(c);
-        resetClient(c);
-    }
-
-    /* Clear the flags, and put the client in the unblocked list so that
-     * we'll process new commands in its query buffer ASAP. */
-    server.blocked_clients--;
-    server.blocked_clients_by_type[c->btype]--;
-    c->flags &= ~CLIENT_BLOCKED;
-    c->btype = BLOCKED_NONE;
-    removeClientFromTimeoutTable(c);
-    queueClientForReprocessing(c);
-}
-
-/* This function gets called when a blocked client timed out in order to
- * send it a reply of some kind. After this function is called,
- * unblockClient() will be called with the same client as argument. */
-void replyToBlockedClientTimedOut(client *c) {
-    if (c->btype == BLOCKED_LIST ||
-        c->btype == BLOCKED_ZSET ||
-        c->btype == BLOCKED_STREAM) {
-        addReplyNullArray(c);
-    } else if (c->btype == BLOCKED_WAIT) {
-        addReplyLongLong(c,replicationCountAcksByOffset(c->bpop.reploffset));
-    } else if (c->btype == BLOCKED_MODULE) {
-        moduleBlockedClientTimedOut(c);
-    } else {
-        serverPanic("Unknown btype in replyToBlockedClientTimedOut().");
-    }
-}
-
-/* Mass-unblock clients because something changed in the instance that makes
- * blocking no longer safe. For example clients blocked in list operations
- * in an instance which turns from master to slave is unsafe, so this function
- * is called when a master turns into a slave.
- *
- * The semantics is to send an -UNBLOCKED error to the client, disconnecting
- * it at the same time. */
-void disconnectAllBlockedClients(void) {
-    listNode *ln;
-    listIter li;
-
-    listRewind(server.clients,&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-
-        if (c->flags & CLIENT_BLOCKED) {
-            /* PAUSED clients are an exception, when they'll be unblocked, the
-             * command processing will start from scratch, and the command will
-             * be either executed or rejected. (unlike LIST blocked clients for
-             * which the command is already in progress in a way. */
-            if (c->btype == BLOCKED_PAUSE)
-                continue;
-
-            addReplyError(c,
-                "-UNBLOCKED force unblock from blocking operation, "
-                "instance state changed (master -> replica?)");
-            unblockClient(c);
-            c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-        }
-    }
-}
-
-/* Helper function for handleClientsBlockedOnKeys(). This function is called
- * when there may be clients blocked on a list key, and there may be new
- * data to fetch (the key is ready). */
-void serveClientsBlockedOnListKey(robj *o, readyList *rl) {
-    /* We serve clients in the same order they blocked for
-     * this key, from the first blocked to the last. */
-    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
-    if (de) {
-        list *clients = dictGetVal(de);
-        int numclients = listLength(clients);
-
-        while(numclients--) {
-            listNode *clientnode = listFirst(clients);
-            client *receiver = clientnode->value;
-
-            if (receiver->btype != BLOCKED_LIST) {
-                /* Put at the tail, so that at the next call
-                 * we'll not run into it again. */
-                listRotateHeadToTail(clients);
-                continue;
-            }
-
-            robj *dstkey = receiver->bpop.target;
-            int wherefrom = receiver->bpop.listpos.wherefrom;
-            int whereto = receiver->bpop.listpos.whereto;
-            robj *value = listTypePop(o, wherefrom);
-
-            if (value) {
-                /* Protect receiver->bpop.target, that will be
-                 * freed by the next unblockClient()
-                 * call. */
-                if (dstkey) incrRefCount(dstkey);
-
-                monotime replyTimer;
-                elapsedStart(&replyTimer);
-                if (serveClientBlockedOnList(receiver,
-                    rl->key,dstkey,rl->db,value,
-                    wherefrom, whereto) == C_ERR)
-                {
-                    /* If we failed serving the client we need
-                     * to also undo the POP operation. */
-                    listTypePush(o,value,wherefrom);
-                }
-                updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
-                unblockClient(receiver);
-
-                if (dstkey) decrRefCount(dstkey);
-                decrRefCount(value);
-            } else {
-                break;
-            }
-        }
-    }
-
-    if (listTypeLength(o) == 0) {
-        dbDelete(rl->db,rl->key);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",rl->key,rl->db->id);
-    }
-    /* We don't call signalModifiedKey() as it was already called
-     * when an element was pushed on the list. */
-}
-
-/* Helper function for handleClientsBlockedOnKeys(). This function is called
- * when there may be clients blocked on a sorted set key, and there may be new
- * data to fetch (the key is ready). */
-void serveClientsBlockedOnSortedSetKey(robj *o, readyList *rl) {
-    /* We serve clients in the same order they blocked for
-     * this key, from the first blocked to the last. */
-    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
-    if (de) {
-        list *clients = dictGetVal(de);
-        int numclients = listLength(clients);
-        unsigned long zcard = zsetLength(o);
-
-        while(numclients-- && zcard) {
-            listNode *clientnode = listFirst(clients);
-            client *receiver = clientnode->value;
-
-            if (receiver->btype != BLOCKED_ZSET) {
-                /* Put at the tail, so that at the next call
-                 * we'll not run into it again. */
-                listRotateHeadToTail(clients);
-                continue;
-            }
-
-            int where = (receiver->lastcmd &&
-                         receiver->lastcmd->proc == bzpopminCommand)
-                         ? ZSET_MIN : ZSET_MAX;
-            monotime replyTimer;
-            elapsedStart(&replyTimer);
-            genericZpopCommand(receiver,&rl->key,1,where,1,NULL);
-            updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
-            unblockClient(receiver);
-            zcard--;
-
-            /* Replicate the command. */
-            robj *argv[2];
-            struct redisCommand *cmd = where == ZSET_MIN ?
-                                       server.zpopminCommand :
-                                       server.zpopmaxCommand;
-            argv[0] = createStringObject(cmd->name,strlen(cmd->name));
-            argv[1] = rl->key;
-            incrRefCount(rl->key);
-            propagate(cmd,receiver->db->id,
-                      argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
-            decrRefCount(argv[0]);
-            decrRefCount(argv[1]);
-        }
-    }
-}
-
-/* Helper function for handleClientsBlockedOnKeys(). This function is called
- * when there may be clients blocked on a stream key, and there may be new
- * data to fetch (the key is ready). */
-void serveClientsBlockedOnStreamKey(robj *o, readyList *rl) {
-    dictEntry *de = dictFind(rl->db->blocking_keys,rl->key);
-    stream *s = o->ptr;
-
-    /* We need to provide the new data arrived on the stream
-     * to all the clients that are waiting for an offset smaller
-     * than the current top item. */
-    if (de) {
-        list *clients = dictGetVal(de);
-        listNode *ln;
-        listIter li;
-        listRewind(clients,&li);
-
-        while((ln = listNext(&li))) {
-            client *receiver = listNodeValue(ln);
-            if (receiver->btype != BLOCKED_STREAM) continue;
-            bkinfo *bki = dictFetchValue(receiver->bpop.keys,rl->key);
-            streamID *gt = &bki->stream_id;
-
-            /* If we blocked in the context of a consumer
-             * group, we need to resolve the group and update the
-             * last ID the client is blocked for: this is needed
-             * because serving other clients in the same consumer
-             * group will alter the "last ID" of the consumer
-             * group, and clients blocked in a consumer group are
-             * always blocked for the ">" ID: we need to deliver
-             * only new messages and avoid unblocking the client
-             * otherwise. */
-            streamCG *group = NULL;
-            if (receiver->bpop.xread_group) {
-                group = streamLookupCG(s,
-                        receiver->bpop.xread_group->ptr);
-                /* If the group was not found, send an error
-                 * to the consumer. */
-                if (!group) {
-                    addReplyError(receiver,
-                        "-NOGROUP the consumer group this client "
-                        "was blocked on no longer exists");
-                    unblockClient(receiver);
-                    continue;
-                } else {
-                    *gt = group->last_id;
-                }
-            }
-
-            if (streamCompareID(&s->last_id, gt) > 0) {
-                streamID start = *gt;
-                streamIncrID(&start);
-
-                /* Lookup the consumer for the group, if any. */
-                streamConsumer *consumer = NULL;
-                int noack = 0;
-
-                if (group) {
-                    int created = 0;
-                    consumer =
-                        streamLookupConsumer(group,
-                                             receiver->bpop.xread_consumer->ptr,
-                                             SLC_NONE,
-                                             &created);
-                    noack = receiver->bpop.xread_group_noack;
-                    if (created && noack) {
-                        streamPropagateConsumerCreation(receiver,rl->key,
-                                                        receiver->bpop.xread_group,
-                                                        consumer->name);
-                    }
-                }
-
-                monotime replyTimer;
-                elapsedStart(&replyTimer);
-                /* Emit the two elements sub-array consisting of
-                 * the name of the stream and the data we
-                 * extracted from it. Wrapped in a single-item
-                 * array, since we have just one key. */
-                if (receiver->resp == 2) {
-                    addReplyArrayLen(receiver,1);
-                    addReplyArrayLen(receiver,2);
-                } else {
-                    addReplyMapLen(receiver,1);
-                }
-                addReplyBulk(receiver,rl->key);
-
-                streamPropInfo pi = {
-                    rl->key,
-                    receiver->bpop.xread_group
-                };
-                streamReplyWithRange(receiver,s,&start,NULL,
-                                     receiver->bpop.xread_count,
-                                     0, group, consumer, noack, &pi);
-                updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
-
-                /* Note that after we unblock the client, 'gt'
-                 * and other receiver->bpop stuff are no longer
-                 * valid, so we must do the setup above before
-                 * this call. */
-                unblockClient(receiver);
-            }
-        }
-    }
-}
-
-/* Helper function for handleClientsBlockedOnKeys(). This function is called
- * in order to check if we can serve clients blocked by modules using
- * RM_BlockClientOnKeys(), when the corresponding key was signaled as ready:
- * our goal here is to call the RedisModuleBlockedClient reply() callback to
- * see if the key is really able to serve the client, and in that case,
- * unblock it. */
-void serveClientsBlockedOnKeyByModule(readyList *rl) {
-    dictEntry *de;
-
-    /* Optimization: If no clients are in type BLOCKED_MODULE,
-     * we can skip this loop. */
-    if (!server.blocked_clients_by_type[BLOCKED_MODULE]) return;
-
-    /* We serve clients in the same order they blocked for
-     * this key, from the first blocked to the last. */
-    de = dictFind(rl->db->blocking_keys,rl->key);
-    if (de) {
-        list *clients = dictGetVal(de);
-        int numclients = listLength(clients);
-
-        while(numclients--) {
-            listNode *clientnode = listFirst(clients);
-            client *receiver = clientnode->value;
-
-            /* Put at the tail, so that at the next call
-             * we'll not run into it again: clients here may not be
-             * ready to be served, so they'll remain in the list
-             * sometimes. We want also be able to skip clients that are
-             * not blocked for the MODULE type safely. */
-            listRotateHeadToTail(clients);
-
-            if (receiver->btype != BLOCKED_MODULE) continue;
-
-            /* Note that if *this* client cannot be served by this key,
-             * it does not mean that another client that is next into the
-             * list cannot be served as well: they may be blocked by
-             * different modules with different triggers to consider if a key
-             * is ready or not. This means we can't exit the loop but need
-             * to continue after the first failure. */
-            monotime replyTimer;
-            elapsedStart(&replyTimer);
-            if (!moduleTryServeClientBlockedOnKey(receiver, rl->key)) continue;
-            updateStatsOnUnblock(receiver, 0, elapsedUs(replyTimer));
-
-            moduleUnblockClient(receiver);
-        }
-    }
-}
-
-/* This function should be called by Redis every time a single command,
- * a MULTI/EXEC block, or a Lua script, terminated its execution after
- * being called by a client. It handles serving clients blocked in
- * lists, streams, and sorted sets, via a blocking commands.
- *
- * All the keys with at least one client blocked that received at least
- * one new element via some write operation are accumulated into
- * the server.ready_keys list. This function will run the list and will
- * serve clients accordingly. Note that the function will iterate again and
- * again as a result of serving BLMOVE we can have new blocking clients
- * to serve because of the PUSH side of BLMOVE.
- *
- * This function is normally "fair", that is, it will server clients
- * using a FIFO behavior. However this fairness is violated in certain
- * edge cases, that is, when we have clients blocked at the same time
- * in a sorted set and in a list, for the same key (a very odd thing to
- * do client side, indeed!). Because mismatching clients (blocking for
- * a different type compared to the current key type) are moved in the
- * other side of the linked list. However as long as the key starts to
- * be used only for a single type, like virtually any Redis application will
- * do, the function is already fair. */
-void handleClientsBlockedOnKeys(void) {
-    while(listLength(server.ready_keys) != 0) {
-        list *l;
-
-        /* Point server.ready_keys to a fresh list and save the current one
-         * locally. This way as we run the old list we are free to call
-         * signalKeyAsReady() that may push new elements in server.ready_keys
-         * when handling clients blocked into BLMOVE. */
-        l = server.ready_keys;
-        server.ready_keys = listCreate();
-
-        while(listLength(l) != 0) {
-            listNode *ln = listFirst(l);
-            readyList *rl = ln->value;
-
-            /* First of all remove this key from db->ready_keys so that
-             * we can safely call signalKeyAsReady() against this key. */
-            dictDelete(rl->db->ready_keys,rl->key);
-
-            /* Even if we are not inside call(), increment the call depth
-             * in order to make sure that keys are expired against a fixed
-             * reference time, and not against the wallclock time. This
-             * way we can lookup an object multiple times (BLMOVE does
-             * that) without the risk of it being freed in the second
-             * lookup, invalidating the first one.
-             * See https://github.com/redis/redis/pull/6554. */
-            server.fixed_time_expire++;
-            updateCachedTime(0);
-
-            /* Serve clients blocked on the key. */
-            robj *o = lookupKeyWrite(rl->db,rl->key);
-
-            if (o != NULL) {
-                if (o->type == OBJ_LIST)
-                    serveClientsBlockedOnListKey(o,rl);
-                else if (o->type == OBJ_ZSET)
-                    serveClientsBlockedOnSortedSetKey(o,rl);
-                else if (o->type == OBJ_STREAM)
-                    serveClientsBlockedOnStreamKey(o,rl);
-                /* We want to serve clients blocked on module keys
-                 * regardless of the object type: we don't know what the
-                 * module is trying to accomplish right now. */
-                serveClientsBlockedOnKeyByModule(rl);
-            }
-            server.fixed_time_expire--;
-
-            /* Free this item. */
-            decrRefCount(rl->key);
-            zfree(rl);
-            listDelNode(l,ln);
-        }
-        listRelease(l); /* We have the new list on place at this point. */
-    }
-}
-
-/* This is how the current blocking lists/sorted sets/streams work, we use
- * BLPOP as example, but the concept is the same for other list ops, sorted
- * sets and XREAD.
- * - If the user calls BLPOP and the key exists and contains a non empty list
- *   then LPOP is called instead. So BLPOP is semantically the same as LPOP
- *   if blocking is not required.
- * - If instead BLPOP is called and the key does not exists or the list is
- *   empty we need to block. In order to do so we remove the notification for
- *   new data to read in the client socket (so that we'll not serve new
- *   requests if the blocking request is not served). Also we put the client
- *   in a dictionary (db->blocking_keys) mapping keys to a list of clients
- *   blocking for this keys.
- * - If a PUSH operation against a key with blocked clients waiting is
- *   performed, we mark this key as "ready", and after the current command,
- *   MULTI/EXEC block, or script, is executed, we serve all the clients waiting
- *   for this list, from the one that blocked first, to the last, accordingly
- *   to the number of elements we have in the ready list.
- */
-
-/* Set a client in blocking mode for the specified key (list, zset or stream),
- * with the specified timeout. The 'type' argument is BLOCKED_LIST,
- * BLOCKED_ZSET or BLOCKED_STREAM depending on the kind of operation we are
- * waiting for an empty key in order to awake the client. The client is blocked
- * for all the 'numkeys' keys as in the 'keys' argument. When we block for
- * stream keys, we also provide an array of streamID structures: clients will
- * be unblocked only when items with an ID greater or equal to the specified
- * one is appended to the stream. */
-void blockForKeys(client *c, int btype, robj **keys, int numkeys, mstime_t timeout, robj *target, struct listPos *listpos, streamID *ids) {
-    dictEntry *de;
-    list *l;
-    int j;
-
-    c->bpop.timeout = timeout;
-    c->bpop.target = target;
-
-    if (listpos != NULL) c->bpop.listpos = *listpos;
-
-    if (target != NULL) incrRefCount(target);
-
-    for (j = 0; j < numkeys; j++) {
-        /* Allocate our bkinfo structure, associated to each key the client
-         * is blocked for. */
-        bkinfo *bki = zmalloc(sizeof(*bki));
-        if (btype == BLOCKED_STREAM)
-            bki->stream_id = ids[j];
-
-        /* If the key already exists in the dictionary ignore it. */
-        if (dictAdd(c->bpop.keys,keys[j],bki) != DICT_OK) {
-            zfree(bki);
-            continue;
-        }
-        incrRefCount(keys[j]);
-
-        /* And in the other "side", to map keys -> clients */
-        de = dictFind(c->db->blocking_keys,keys[j]);
-        if (de == NULL) {
-            int retval;
-
-            /* For every key we take a list of clients blocked for it */
-            l = listCreate();
-            retval = dictAdd(c->db->blocking_keys,keys[j],l);
-            incrRefCount(keys[j]);
-            serverAssertWithInfo(c,keys[j],retval == DICT_OK);
-        } else {
-            l = dictGetVal(de);
-        }
-        listAddNodeTail(l,c);
-        bki->listnode = listLast(l);
-    }
-    blockClient(c,btype);
-}
-
-/* Unblock a client that's waiting in a blocking operation such as BLPOP.
- * You should never call this function directly, but unblockClient() instead. */
-void unblockClientWaitingData(client *c) {
-    dictEntry *de;
-    dictIterator *di;
-    list *l;
-
-    serverAssertWithInfo(c,NULL,dictSize(c->bpop.keys) != 0);
-    di = dictGetIterator(c->bpop.keys);
-    /* The client may wait for multiple keys, so unblock it for every key. */
-    while((de = dictNext(di)) != NULL) {
-        robj *key = dictGetKey(de);
-        bkinfo *bki = dictGetVal(de);
-
-        /* Remove this client from the list of clients waiting for this key. */
-        l = dictFetchValue(c->db->blocking_keys,key);
-        serverAssertWithInfo(c,key,l != NULL);
-        listDelNode(l,bki->listnode);
-        /* If the list is empty we need to remove it to avoid wasting memory */
-        if (listLength(l) == 0)
-            dictDelete(c->db->blocking_keys,key);
-    }
-    dictReleaseIterator(di);
-
-    /* Cleanup the client structure */
-    dictEmpty(c->bpop.keys,NULL);
-    if (c->bpop.target) {
-        decrRefCount(c->bpop.target);
-        c->bpop.target = NULL;
-    }
-    if (c->bpop.xread_group) {
-        decrRefCount(c->bpop.xread_group);
-        decrRefCount(c->bpop.xread_consumer);
-        c->bpop.xread_group = NULL;
-        c->bpop.xread_consumer = NULL;
-    }
-}
-
-static int getBlockedTypeByType(int type) {
-    switch (type) {
-        case OBJ_LIST: return BLOCKED_LIST;
-        case OBJ_ZSET: return BLOCKED_ZSET;
-        case OBJ_MODULE: return BLOCKED_MODULE;
-        case OBJ_STREAM: return BLOCKED_STREAM;
-        default: return BLOCKED_NONE;
-    }
-}
-
-/* If the specified key has clients blocked waiting for list pushes, this
- * function will put the key reference into the server.ready_keys list.
- * Note that db->ready_keys is a hash table that allows us to avoid putting
- * the same key again and again in the list in case of multiple pushes
- * made by a script or in the context of MULTI/EXEC.
- *
- * The list will be finally processed by handleClientsBlockedOnKeys() */
-void signalKeyAsReady(redisDb *db, robj *key, int type) {
-    readyList *rl;
-
-    /* Quick returns. */
-    int btype = getBlockedTypeByType(type);
-    if (btype == BLOCKED_NONE) {
-        /* The type can never block. */
-        return;
-    }
-    if (!server.blocked_clients_by_type[btype] &&
-        !server.blocked_clients_by_type[BLOCKED_MODULE]) {
-        /* No clients block on this type. Note: Blocked modules are represented
-         * by BLOCKED_MODULE, even if the intention is to wake up by normal
-         * types (list, zset, stream), so we need to check that there are no
-         * blocked modules before we do a quick return here. */
-        return;
-    }
-
-    /* No clients blocking for this key? No need to queue it. */
-    if (dictFind(db->blocking_keys,key) == NULL) return;
-
-    /* Key was already signaled? No need to queue it again. */
-    if (dictFind(db->ready_keys,key) != NULL) return;
-
-    /* Ok, we need to queue this key into server.ready_keys. */
-    rl = zmalloc(sizeof(*rl));
-    rl->key = key;
-    rl->db = db;
-    incrRefCount(key);
-    listAddNodeTail(server.ready_keys,rl);
-
-    /* We also add the key in the db->ready_keys dictionary in order
-     * to avoid adding it multiple times into a list with a simple O(1)
-     * check. */
-    incrRefCount(key);
-    serverAssert(dictAdd(db->ready_keys,key,NULL) == DICT_OK);
-}
-
diff --git a/redis-stable/src/childinfo.c b/redis-stable/src/childinfo.c
deleted file mode 100644
index 5e94a4f2..00000000
--- a/redis-stable/src/childinfo.c
+++ /dev/null
@@ -1,173 +0,0 @@
-/*
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <unistd.h>
-
-typedef struct {
-    size_t keys;
-    size_t cow;
-    monotime cow_updated;
-    double progress;
-    childInfoType information_type; /* Type of information */
-} child_info_data;
-
-/* Open a child-parent channel used in order to move information about the
- * RDB / AOF saving process from the child to the parent (for instance
- * the amount of copy on write memory used) */
-void openChildInfoPipe(void) {
-    if (pipe(server.child_info_pipe) == -1) {
-        /* On error our two file descriptors should be still set to -1,
-         * but we call anyway closeChildInfoPipe() since can't hurt. */
-        closeChildInfoPipe();
-    } else if (anetNonBlock(NULL,server.child_info_pipe[0]) != ANET_OK) {
-        closeChildInfoPipe();
-    } else {
-        server.child_info_nread = 0;
-    }
-}
-
-/* Close the pipes opened with openChildInfoPipe(). */
-void closeChildInfoPipe(void) {
-    if (server.child_info_pipe[0] != -1 ||
-        server.child_info_pipe[1] != -1)
-    {
-        close(server.child_info_pipe[0]);
-        close(server.child_info_pipe[1]);
-        server.child_info_pipe[0] = -1;
-        server.child_info_pipe[1] = -1;
-        server.child_info_nread = 0;
-    }
-}
-
-/* Send save data to parent. */
-void sendChildInfoGeneric(childInfoType info_type, size_t keys, double progress, char *pname) {
-    if (server.child_info_pipe[1] == -1) return;
-
-    static monotime cow_updated = 0;
-    static uint64_t cow_update_cost = 0;
-    static size_t cow = 0;
-
-    child_info_data data = {0}; /* zero everything, including padding to satisfy valgrind */
-
-    /* When called to report current info, we need to throttle down CoW updates as they
-     * can be very expensive. To do that, we measure the time it takes to get a reading
-     * and schedule the next reading to happen not before time*CHILD_COW_COST_FACTOR
-     * passes. */
-
-    monotime now = getMonotonicUs();
-    if (info_type != CHILD_INFO_TYPE_CURRENT_INFO ||
-        !cow_updated ||
-        now - cow_updated > cow_update_cost * CHILD_COW_DUTY_CYCLE)
-    {
-        cow = zmalloc_get_private_dirty(-1);
-        cow_updated = getMonotonicUs();
-        cow_update_cost = cow_updated - now;
-
-        if (cow) {
-            serverLog((info_type == CHILD_INFO_TYPE_CURRENT_INFO) ? LL_VERBOSE : LL_NOTICE,
-                      "%s: %zu MB of memory used by copy-on-write",
-                      pname, cow / (1024 * 1024));
-        }
-    }
-
-    data.information_type = info_type;
-    data.keys = keys;
-    data.cow = cow;
-    data.cow_updated = cow_updated;
-    data.progress = progress;
-
-    ssize_t wlen = sizeof(data);
-
-    if (write(server.child_info_pipe[1], &data, wlen) != wlen) {
-        /* Nothing to do on error, this will be detected by the other side. */
-    }
-}
-
-/* Update Child info. */
-void updateChildInfo(childInfoType information_type, size_t cow, monotime cow_updated, size_t keys, double progress) {
-    if (information_type == CHILD_INFO_TYPE_CURRENT_INFO) {
-        server.stat_current_cow_bytes = cow;
-        server.stat_current_cow_updated = cow_updated;
-        server.stat_current_save_keys_processed = keys;
-        if (progress != -1) server.stat_module_progress = progress;
-    } else if (information_type == CHILD_INFO_TYPE_AOF_COW_SIZE) {
-        server.stat_aof_cow_bytes = cow;
-    } else if (information_type == CHILD_INFO_TYPE_RDB_COW_SIZE) {
-        server.stat_rdb_cow_bytes = cow;
-    } else if (information_type == CHILD_INFO_TYPE_MODULE_COW_SIZE) {
-        server.stat_module_cow_bytes = cow;
-    }
-}
-
-/* Read child info data from the pipe.
- * if complete data read into the buffer, 
- * data is stored into *buffer, and returns 1.
- * otherwise, the partial data is left in the buffer, waiting for the next read, and returns 0. */
-int readChildInfo(childInfoType *information_type, size_t *cow, monotime *cow_updated, size_t *keys, double* progress) {
-    /* We are using here a static buffer in combination with the server.child_info_nread to handle short reads */
-    static child_info_data buffer;
-    ssize_t wlen = sizeof(buffer);
-
-    /* Do not overlap */
-    if (server.child_info_nread == wlen) server.child_info_nread = 0;
-
-    int nread = read(server.child_info_pipe[0], (char *)&buffer + server.child_info_nread, wlen - server.child_info_nread);
-    if (nread > 0) {
-        server.child_info_nread += nread;
-    }
-
-    /* We have complete child info */
-    if (server.child_info_nread == wlen) {
-        *information_type = buffer.information_type;
-        *cow = buffer.cow;
-        *cow_updated = buffer.cow_updated;
-        *keys = buffer.keys;
-        *progress = buffer.progress;
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Receive info data from child. */
-void receiveChildInfo(void) {
-    if (server.child_info_pipe[0] == -1) return;
-
-    size_t cow;
-    monotime cow_updated;
-    size_t keys;
-    double progress;
-    childInfoType information_type;
-
-    /* Drain the pipe and update child info so that we get the final message. */
-    while (readChildInfo(&information_type, &cow, &cow_updated, &keys, &progress)) {
-        updateChildInfo(information_type, cow, cow_updated, keys, progress);
-    }
-}
diff --git a/redis-stable/src/cli_common.c b/redis-stable/src/cli_common.c
deleted file mode 100644
index e88327ac..00000000
--- a/redis-stable/src/cli_common.c
+++ /dev/null
@@ -1,194 +0,0 @@
-/* CLI (command line interface) common methods
- * 
- * Copyright (c) 2020, Redis Labs
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "cli_common.h"
-#include <errno.h>
-#include <hiredis.h>
-#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
-#include <sds.h> /* use sds.h from hiredis, so that only one set of sds functions will be present in the binary */
-#ifdef USE_OPENSSL
-#include <openssl/ssl.h>
-#include <openssl/err.h>
-#include <hiredis_ssl.h>
-#endif
-
-
-/* Wrapper around redisSecureConnection to avoid hiredis_ssl dependencies if
- * not building with TLS support.
- */
-int cliSecureConnection(redisContext *c, cliSSLconfig config, const char **err) {
-#ifdef USE_OPENSSL
-    static SSL_CTX *ssl_ctx = NULL;
-
-    if (!ssl_ctx) {
-        ssl_ctx = SSL_CTX_new(SSLv23_client_method());
-        if (!ssl_ctx) {
-            *err = "Failed to create SSL_CTX";
-            goto error;
-        }
-        SSL_CTX_set_options(ssl_ctx, SSL_OP_NO_SSLv2 | SSL_OP_NO_SSLv3);
-        SSL_CTX_set_verify(ssl_ctx, config.skip_cert_verify ? SSL_VERIFY_NONE : SSL_VERIFY_PEER, NULL);
-
-        if (config.cacert || config.cacertdir) {
-            if (!SSL_CTX_load_verify_locations(ssl_ctx, config.cacert, config.cacertdir)) {
-                *err = "Invalid CA Certificate File/Directory";
-                goto error;
-            }
-        } else {
-            if (!SSL_CTX_set_default_verify_paths(ssl_ctx)) {
-                *err = "Failed to use default CA paths";
-                goto error;
-            }
-        }
-
-        if (config.cert && !SSL_CTX_use_certificate_chain_file(ssl_ctx, config.cert)) {
-            *err = "Invalid client certificate";
-            goto error;
-        }
-
-        if (config.key && !SSL_CTX_use_PrivateKey_file(ssl_ctx, config.key, SSL_FILETYPE_PEM)) {
-            *err = "Invalid private key";
-            goto error;
-        }
-        if (config.ciphers && !SSL_CTX_set_cipher_list(ssl_ctx, config.ciphers)) {
-            *err = "Error while configuring ciphers";
-            goto error;
-        }
-#ifdef TLS1_3_VERSION
-        if (config.ciphersuites && !SSL_CTX_set_ciphersuites(ssl_ctx, config.ciphersuites)) {
-            *err = "Error while setting cypher suites";
-            goto error;
-        }
-#endif
-    }
-
-    SSL *ssl = SSL_new(ssl_ctx);
-    if (!ssl) {
-        *err = "Failed to create SSL object";
-        return REDIS_ERR;
-    }
-
-    if (config.sni && !SSL_set_tlsext_host_name(ssl, config.sni)) {
-        *err = "Failed to configure SNI";
-        SSL_free(ssl);
-        return REDIS_ERR;
-    }
-
-    return redisInitiateSSL(c, ssl);
-
-error:
-    SSL_CTX_free(ssl_ctx);
-    ssl_ctx = NULL;
-    return REDIS_ERR;
-#else
-    (void) config;
-    (void) c;
-    (void) err;
-    return REDIS_OK;
-#endif
-}
-
-/* Wrapper around hiredis to allow arbitrary reads and writes.
- *
- * We piggybacks on top of hiredis to achieve transparent TLS support,
- * and use its internal buffers so it can co-exist with commands
- * previously/later issued on the connection.
- *
- * Interface is close to enough to read()/write() so things should mostly
- * work transparently.
- */
-
-/* Write a raw buffer through a redisContext. If we already have something
- * in the buffer (leftovers from hiredis operations) it will be written
- * as well.
- */
-ssize_t cliWriteConn(redisContext *c, const char *buf, size_t buf_len)
-{
-    int done = 0;
-
-    /* Append data to buffer which is *usually* expected to be empty
-     * but we don't assume that, and write.
-     */
-    c->obuf = sdscatlen(c->obuf, buf, buf_len);
-    if (redisBufferWrite(c, &done) == REDIS_ERR) {
-        if (!(c->flags & REDIS_BLOCK))
-            errno = EAGAIN;
-
-        /* On error, we assume nothing was written and we roll back the
-         * buffer to its original state.
-         */
-        if (sdslen(c->obuf) > buf_len)
-            sdsrange(c->obuf, 0, -(buf_len+1));
-        else
-            sdsclear(c->obuf);
-
-        return -1;
-    }
-
-    /* If we're done, free up everything. We may have written more than
-     * buf_len (if c->obuf was not initially empty) but we don't have to
-     * tell.
-     */
-    if (done) {
-        sdsclear(c->obuf);
-        return buf_len;
-    }
-
-    /* Write was successful but we have some leftovers which we should
-     * remove from the buffer.
-     *
-     * Do we still have data that was there prior to our buf? If so,
-     * restore buffer to it's original state and report no new data was
-     * writen.
-     */
-    if (sdslen(c->obuf) > buf_len) {
-        sdsrange(c->obuf, 0, -(buf_len+1));
-        return 0;
-    }
-
-    /* At this point we're sure no prior data is left. We flush the buffer
-     * and report how much we've written.
-     */
-    size_t left = sdslen(c->obuf);
-    sdsclear(c->obuf);
-    return buf_len - left;
-}
-
-/* Wrapper around OpenSSL (libssl and libcrypto) initialisation
- */
-int cliSecureInit()
-{
-#ifdef USE_OPENSSL
-    ERR_load_crypto_strings();
-    SSL_load_error_strings();
-    SSL_library_init();
-#endif
-    return REDIS_OK;
-}
diff --git a/redis-stable/src/cli_common.h b/redis-stable/src/cli_common.h
deleted file mode 100644
index 16d6ec2a..00000000
--- a/redis-stable/src/cli_common.h
+++ /dev/null
@@ -1,50 +0,0 @@
-#ifndef __CLICOMMON_H
-#define __CLICOMMON_H
-
-#include <hiredis.h>
-
-typedef struct cliSSLconfig {
-    /* Requested SNI, or NULL */
-    char *sni;
-    /* CA Certificate file, or NULL */
-    char *cacert;
-    /* Directory where trusted CA certificates are stored, or NULL */
-    char *cacertdir;
-    /* Skip server certificate verification. */
-    int skip_cert_verify;
-    /* Client certificate to authenticate with, or NULL */
-    char *cert;
-    /* Private key file to authenticate with, or NULL */
-    char *key;
-    /* Prefered cipher list, or NULL (applies only to <= TLSv1.2) */
-    char* ciphers;
-    /* Prefered ciphersuites list, or NULL (applies only to TLSv1.3) */
-    char* ciphersuites;
-} cliSSLconfig;
-
-/* Wrapper around redisSecureConnection to avoid hiredis_ssl dependencies if
- * not building with TLS support.
- */
-int cliSecureConnection(redisContext *c, cliSSLconfig config, const char **err);
-
-/* Wrapper around hiredis to allow arbitrary reads and writes.
- *
- * We piggybacks on top of hiredis to achieve transparent TLS support,
- * and use its internal buffers so it can co-exist with commands
- * previously/later issued on the connection.
- *
- * Interface is close to enough to read()/write() so things should mostly
- * work transparently.
- */
-
-/* Write a raw buffer through a redisContext. If we already have something
- * in the buffer (leftovers from hiredis operations) it will be written
- * as well.
- */
-ssize_t cliWriteConn(redisContext *c, const char *buf, size_t buf_len);
-
-/* Wrapper around OpenSSL (libssl and libcrypto) initialisation.
- */
-int cliSecureInit();
-
-#endif /* __CLICOMMON_H */
diff --git a/redis-stable/src/cluster.c b/redis-stable/src/cluster.c
deleted file mode 100644
index b305353d..00000000
--- a/redis-stable/src/cluster.c
+++ /dev/null
@@ -1,6032 +0,0 @@
-/* Redis Cluster implementation.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "cluster.h"
-#include "endianconv.h"
-
-#include <sys/types.h>
-#include <sys/socket.h>
-#include <arpa/inet.h>
-#include <fcntl.h>
-#include <unistd.h>
-#include <sys/stat.h>
-#include <sys/file.h>
-#include <math.h>
-
-/* A global reference to myself is handy to make code more clear.
- * Myself always points to server.cluster->myself, that is, the clusterNode
- * that represents this node. */
-clusterNode *myself = NULL;
-
-clusterNode *createClusterNode(char *nodename, int flags);
-void clusterAddNode(clusterNode *node);
-void clusterAcceptHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-void clusterReadHandler(connection *conn);
-void clusterSendPing(clusterLink *link, int type);
-void clusterSendFail(char *nodename);
-void clusterSendFailoverAuthIfNeeded(clusterNode *node, clusterMsg *request);
-void clusterUpdateState(void);
-int clusterNodeGetSlotBit(clusterNode *n, int slot);
-sds clusterGenNodesDescription(int filter, int use_pport);
-clusterNode *clusterLookupNode(const char *name);
-int clusterNodeAddSlave(clusterNode *master, clusterNode *slave);
-int clusterAddSlot(clusterNode *n, int slot);
-int clusterDelSlot(int slot);
-int clusterDelNodeSlots(clusterNode *node);
-int clusterNodeSetSlotBit(clusterNode *n, int slot);
-void clusterSetMaster(clusterNode *n);
-void clusterHandleSlaveFailover(void);
-void clusterHandleSlaveMigration(int max_slaves);
-int bitmapTestBit(unsigned char *bitmap, int pos);
-void clusterDoBeforeSleep(int flags);
-void clusterSendUpdate(clusterLink *link, clusterNode *node);
-void resetManualFailover(void);
-void clusterCloseAllSlots(void);
-void clusterSetNodeAsMaster(clusterNode *n);
-void clusterDelNode(clusterNode *delnode);
-sds representClusterNodeFlags(sds ci, uint16_t flags);
-uint64_t clusterGetMaxEpoch(void);
-int clusterBumpConfigEpochWithoutConsensus(void);
-void moduleCallClusterReceivers(const char *sender_id, uint64_t module_id, uint8_t type, const unsigned char *payload, uint32_t len);
-
-#define RCVBUF_INIT_LEN 1024
-#define RCVBUF_MAX_PREALLOC (1<<20) /* 1MB */
-
-/* -----------------------------------------------------------------------------
- * Initialization
- * -------------------------------------------------------------------------- */
-
-/* Load the cluster config from 'filename'.
- *
- * If the file does not exist or is zero-length (this may happen because
- * when we lock the nodes.conf file, we create a zero-length one for the
- * sake of locking if it does not already exist), C_ERR is returned.
- * If the configuration was loaded from the file, C_OK is returned. */
-int clusterLoadConfig(char *filename) {
-    FILE *fp = fopen(filename,"r");
-    struct stat sb;
-    char *line;
-    int maxline, j;
-
-    if (fp == NULL) {
-        if (errno == ENOENT) {
-            return C_ERR;
-        } else {
-            serverLog(LL_WARNING,
-                "Loading the cluster node config from %s: %s",
-                filename, strerror(errno));
-            exit(1);
-        }
-    }
-
-    /* Check if the file is zero-length: if so return C_ERR to signal
-     * we have to write the config. */
-    if (fstat(fileno(fp),&sb) != -1 && sb.st_size == 0) {
-        fclose(fp);
-        return C_ERR;
-    }
-
-    /* Parse the file. Note that single lines of the cluster config file can
-     * be really long as they include all the hash slots of the node.
-     * This means in the worst possible case, half of the Redis slots will be
-     * present in a single line, possibly in importing or migrating state, so
-     * together with the node ID of the sender/receiver.
-     *
-     * To simplify we allocate 1024+CLUSTER_SLOTS*128 bytes per line. */
-    maxline = 1024+CLUSTER_SLOTS*128;
-    line = zmalloc(maxline);
-    while(fgets(line,maxline,fp) != NULL) {
-        int argc;
-        sds *argv;
-        clusterNode *n, *master;
-        char *p, *s;
-
-        /* Skip blank lines, they can be created either by users manually
-         * editing nodes.conf or by the config writing process if stopped
-         * before the truncate() call. */
-        if (line[0] == '\n' || line[0] == '\0') continue;
-
-        /* Split the line into arguments for processing. */
-        argv = sdssplitargs(line,&argc);
-        if (argv == NULL) goto fmterr;
-
-        /* Handle the special "vars" line. Don't pretend it is the last
-         * line even if it actually is when generated by Redis. */
-        if (strcasecmp(argv[0],"vars") == 0) {
-            if (!(argc % 2)) goto fmterr;
-            for (j = 1; j < argc; j += 2) {
-                if (strcasecmp(argv[j],"currentEpoch") == 0) {
-                    server.cluster->currentEpoch =
-                            strtoull(argv[j+1],NULL,10);
-                } else if (strcasecmp(argv[j],"lastVoteEpoch") == 0) {
-                    server.cluster->lastVoteEpoch =
-                            strtoull(argv[j+1],NULL,10);
-                } else {
-                    serverLog(LL_WARNING,
-                        "Skipping unknown cluster config variable '%s'",
-                        argv[j]);
-                }
-            }
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* Regular config lines have at least eight fields */
-        if (argc < 8) {
-            sdsfreesplitres(argv,argc);
-            goto fmterr;
-        }
-
-        /* Create this node if it does not exist */
-        n = clusterLookupNode(argv[0]);
-        if (!n) {
-            n = createClusterNode(argv[0],0);
-            clusterAddNode(n);
-        }
-        /* Address and port */
-        if ((p = strrchr(argv[1],':')) == NULL) {
-            sdsfreesplitres(argv,argc);
-            goto fmterr;
-        }
-        *p = '\0';
-        memcpy(n->ip,argv[1],strlen(argv[1])+1);
-        char *port = p+1;
-        char *busp = strchr(port,'@');
-        if (busp) {
-            *busp = '\0';
-            busp++;
-        }
-        n->port = atoi(port);
-        /* In older versions of nodes.conf the "@busport" part is missing.
-         * In this case we set it to the default offset of 10000 from the
-         * base port. */
-        n->cport = busp ? atoi(busp) : n->port + CLUSTER_PORT_INCR;
-
-        /* The plaintext port for client in a TLS cluster (n->pport) is not
-         * stored in nodes.conf. It is received later over the bus protocol. */
-
-        /* Parse flags */
-        p = s = argv[2];
-        while(p) {
-            p = strchr(s,',');
-            if (p) *p = '\0';
-            if (!strcasecmp(s,"myself")) {
-                serverAssert(server.cluster->myself == NULL);
-                myself = server.cluster->myself = n;
-                n->flags |= CLUSTER_NODE_MYSELF;
-            } else if (!strcasecmp(s,"master")) {
-                n->flags |= CLUSTER_NODE_MASTER;
-            } else if (!strcasecmp(s,"slave")) {
-                n->flags |= CLUSTER_NODE_SLAVE;
-            } else if (!strcasecmp(s,"fail?")) {
-                n->flags |= CLUSTER_NODE_PFAIL;
-            } else if (!strcasecmp(s,"fail")) {
-                n->flags |= CLUSTER_NODE_FAIL;
-                n->fail_time = mstime();
-            } else if (!strcasecmp(s,"handshake")) {
-                n->flags |= CLUSTER_NODE_HANDSHAKE;
-            } else if (!strcasecmp(s,"noaddr")) {
-                n->flags |= CLUSTER_NODE_NOADDR;
-            } else if (!strcasecmp(s,"nofailover")) {
-                n->flags |= CLUSTER_NODE_NOFAILOVER;
-            } else if (!strcasecmp(s,"noflags")) {
-                /* nothing to do */
-            } else {
-                serverPanic("Unknown flag in redis cluster config file");
-            }
-            if (p) s = p+1;
-        }
-
-        /* Get master if any. Set the master and populate master's
-         * slave list. */
-        if (argv[3][0] != '-') {
-            master = clusterLookupNode(argv[3]);
-            if (!master) {
-                master = createClusterNode(argv[3],0);
-                clusterAddNode(master);
-            }
-            n->slaveof = master;
-            clusterNodeAddSlave(master,n);
-        }
-
-        /* Set ping sent / pong received timestamps */
-        if (atoi(argv[4])) n->ping_sent = mstime();
-        if (atoi(argv[5])) n->pong_received = mstime();
-
-        /* Set configEpoch for this node. */
-        n->configEpoch = strtoull(argv[6],NULL,10);
-
-        /* Populate hash slots served by this instance. */
-        for (j = 8; j < argc; j++) {
-            int start, stop;
-
-            if (argv[j][0] == '[') {
-                /* Here we handle migrating / importing slots */
-                int slot;
-                char direction;
-                clusterNode *cn;
-
-                p = strchr(argv[j],'-');
-                serverAssert(p != NULL);
-                *p = '\0';
-                direction = p[1]; /* Either '>' or '<' */
-                slot = atoi(argv[j]+1);
-                if (slot < 0 || slot >= CLUSTER_SLOTS) {
-                    sdsfreesplitres(argv,argc);
-                    goto fmterr;
-                }
-                p += 3;
-                cn = clusterLookupNode(p);
-                if (!cn) {
-                    cn = createClusterNode(p,0);
-                    clusterAddNode(cn);
-                }
-                if (direction == '>') {
-                    server.cluster->migrating_slots_to[slot] = cn;
-                } else {
-                    server.cluster->importing_slots_from[slot] = cn;
-                }
-                continue;
-            } else if ((p = strchr(argv[j],'-')) != NULL) {
-                *p = '\0';
-                start = atoi(argv[j]);
-                stop = atoi(p+1);
-            } else {
-                start = stop = atoi(argv[j]);
-            }
-            if (start < 0 || start >= CLUSTER_SLOTS ||
-                stop < 0 || stop >= CLUSTER_SLOTS)
-            {
-                sdsfreesplitres(argv,argc);
-                goto fmterr;
-            }
-            while(start <= stop) clusterAddSlot(n, start++);
-        }
-
-        sdsfreesplitres(argv,argc);
-    }
-    /* Config sanity check */
-    if (server.cluster->myself == NULL) goto fmterr;
-
-    zfree(line);
-    fclose(fp);
-
-    serverLog(LL_NOTICE,"Node configuration loaded, I'm %.40s", myself->name);
-
-    /* Something that should never happen: currentEpoch smaller than
-     * the max epoch found in the nodes configuration. However we handle this
-     * as some form of protection against manual editing of critical files. */
-    if (clusterGetMaxEpoch() > server.cluster->currentEpoch) {
-        server.cluster->currentEpoch = clusterGetMaxEpoch();
-    }
-    return C_OK;
-
-fmterr:
-    serverLog(LL_WARNING,
-        "Unrecoverable error: corrupted cluster config file.");
-    zfree(line);
-    if (fp) fclose(fp);
-    exit(1);
-}
-
-/* Cluster node configuration is exactly the same as CLUSTER NODES output.
- *
- * This function writes the node config and returns 0, on error -1
- * is returned.
- *
- * Note: we need to write the file in an atomic way from the point of view
- * of the POSIX filesystem semantics, so that if the server is stopped
- * or crashes during the write, we'll end with either the old file or the
- * new one. Since we have the full payload to write available we can use
- * a single write to write the whole file. If the pre-existing file was
- * bigger we pad our payload with newlines that are anyway ignored and truncate
- * the file afterward. */
-int clusterSaveConfig(int do_fsync) {
-    sds ci;
-    size_t content_size;
-    struct stat sb;
-    int fd;
-
-    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_SAVE_CONFIG;
-
-    /* Get the nodes description and concatenate our "vars" directive to
-     * save currentEpoch and lastVoteEpoch. */
-    ci = clusterGenNodesDescription(CLUSTER_NODE_HANDSHAKE, 0);
-    ci = sdscatprintf(ci,"vars currentEpoch %llu lastVoteEpoch %llu\n",
-        (unsigned long long) server.cluster->currentEpoch,
-        (unsigned long long) server.cluster->lastVoteEpoch);
-    content_size = sdslen(ci);
-
-    if ((fd = open(server.cluster_configfile,O_WRONLY|O_CREAT,0644))
-        == -1) goto err;
-
-    /* Pad the new payload if the existing file length is greater. */
-    if (fstat(fd,&sb) != -1) {
-        if (sb.st_size > (off_t)content_size) {
-            ci = sdsgrowzero(ci,sb.st_size);
-            memset(ci+content_size,'\n',sb.st_size-content_size);
-        }
-    }
-    if (write(fd,ci,sdslen(ci)) != (ssize_t)sdslen(ci)) goto err;
-    if (do_fsync) {
-        server.cluster->todo_before_sleep &= ~CLUSTER_TODO_FSYNC_CONFIG;
-        if (fsync(fd) == -1) goto err;
-    }
-
-    /* Truncate the file if needed to remove the final \n padding that
-     * is just garbage. */
-    if (content_size != sdslen(ci) && ftruncate(fd,content_size) == -1) {
-        /* ftruncate() failing is not a critical error. */
-    }
-    close(fd);
-    sdsfree(ci);
-    return 0;
-
-err:
-    if (fd != -1) close(fd);
-    sdsfree(ci);
-    return -1;
-}
-
-void clusterSaveConfigOrDie(int do_fsync) {
-    if (clusterSaveConfig(do_fsync) == -1) {
-        serverLog(LL_WARNING,"Fatal: can't update cluster config file.");
-        exit(1);
-    }
-}
-
-/* Lock the cluster config using flock(), and leaks the file descriptor used to
- * acquire the lock so that the file will be locked forever.
- *
- * This works because we always update nodes.conf with a new version
- * in-place, reopening the file, and writing to it in place (later adjusting
- * the length with ftruncate()).
- *
- * On success C_OK is returned, otherwise an error is logged and
- * the function returns C_ERR to signal a lock was not acquired. */
-int clusterLockConfig(char *filename) {
-/* flock() does not exist on Solaris
- * and a fcntl-based solution won't help, as we constantly re-open that file,
- * which will release _all_ locks anyway
- */
-#if !defined(__sun)
-    /* To lock it, we need to open the file in a way it is created if
-     * it does not exist, otherwise there is a race condition with other
-     * processes. */
-    int fd = open(filename,O_WRONLY|O_CREAT|O_CLOEXEC,0644);
-    if (fd == -1) {
-        serverLog(LL_WARNING,
-            "Can't open %s in order to acquire a lock: %s",
-            filename, strerror(errno));
-        return C_ERR;
-    }
-
-    if (flock(fd,LOCK_EX|LOCK_NB) == -1) {
-        if (errno == EWOULDBLOCK) {
-            serverLog(LL_WARNING,
-                 "Sorry, the cluster configuration file %s is already used "
-                 "by a different Redis Cluster node. Please make sure that "
-                 "different nodes use different cluster configuration "
-                 "files.", filename);
-        } else {
-            serverLog(LL_WARNING,
-                "Impossible to lock %s: %s", filename, strerror(errno));
-        }
-        close(fd);
-        return C_ERR;
-    }
-    /* Lock acquired: leak the 'fd' by not closing it, so that we'll retain the
-     * lock to the file as long as the process exists.
-     *
-     * After fork, the child process will get the fd opened by the parent process,
-     * we need save `fd` to `cluster_config_file_lock_fd`, so that in redisFork(),
-     * it will be closed in the child process.
-     * If it is not closed, when the main process is killed -9, but the child process
-     * (redis-aof-rewrite) is still alive, the fd(lock) will still be held by the
-     * child process, and the main process will fail to get lock, means fail to start. */
-    server.cluster_config_file_lock_fd = fd;
-#else
-    UNUSED(filename);
-#endif /* __sun */
-
-    return C_OK;
-}
-
-/* Derives our ports to be announced in the cluster bus. */
-void deriveAnnouncedPorts(int *announced_port, int *announced_pport,
-                          int *announced_cport) {
-    int port = server.tls_cluster ? server.tls_port : server.port;
-    /* Default announced ports. */
-    *announced_port = port;
-    *announced_pport = server.tls_cluster ? server.port : 0;
-    *announced_cport = port + CLUSTER_PORT_INCR;
-    /* Config overriding announced ports. */
-    if (server.tls_cluster && server.cluster_announce_tls_port) {
-        *announced_port = server.cluster_announce_tls_port;
-        *announced_pport = server.cluster_announce_port;
-    } else if (server.cluster_announce_port) {
-        *announced_port = server.cluster_announce_port;
-    }
-    if (server.cluster_announce_bus_port) {
-        *announced_cport = server.cluster_announce_bus_port;
-    }
-}
-
-/* Some flags (currently just the NOFAILOVER flag) may need to be updated
- * in the "myself" node based on the current configuration of the node,
- * that may change at runtime via CONFIG SET. This function changes the
- * set of flags in myself->flags accordingly. */
-void clusterUpdateMyselfFlags(void) {
-    int oldflags = myself->flags;
-    int nofailover = server.cluster_slave_no_failover ?
-                     CLUSTER_NODE_NOFAILOVER : 0;
-    myself->flags &= ~CLUSTER_NODE_NOFAILOVER;
-    myself->flags |= nofailover;
-    if (myself->flags != oldflags) {
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                             CLUSTER_TODO_UPDATE_STATE);
-    }
-}
-
-void clusterInit(void) {
-    int saveconf = 0;
-
-    server.cluster = zmalloc(sizeof(clusterState));
-    server.cluster->myself = NULL;
-    server.cluster->currentEpoch = 0;
-    server.cluster->state = CLUSTER_FAIL;
-    server.cluster->size = 1;
-    server.cluster->todo_before_sleep = 0;
-    server.cluster->nodes = dictCreate(&clusterNodesDictType,NULL);
-    server.cluster->nodes_black_list =
-        dictCreate(&clusterNodesBlackListDictType,NULL);
-    server.cluster->failover_auth_time = 0;
-    server.cluster->failover_auth_count = 0;
-    server.cluster->failover_auth_rank = 0;
-    server.cluster->failover_auth_epoch = 0;
-    server.cluster->cant_failover_reason = CLUSTER_CANT_FAILOVER_NONE;
-    server.cluster->lastVoteEpoch = 0;
-    for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
-        server.cluster->stats_bus_messages_sent[i] = 0;
-        server.cluster->stats_bus_messages_received[i] = 0;
-    }
-    server.cluster->stats_pfail_nodes = 0;
-    memset(server.cluster->slots,0, sizeof(server.cluster->slots));
-    clusterCloseAllSlots();
-
-    /* Lock the cluster config file to make sure every node uses
-     * its own nodes.conf. */
-    server.cluster_config_file_lock_fd = -1;
-    if (clusterLockConfig(server.cluster_configfile) == C_ERR)
-        exit(1);
-
-    /* Load or create a new nodes configuration. */
-    if (clusterLoadConfig(server.cluster_configfile) == C_ERR) {
-        /* No configuration found. We will just use the random name provided
-         * by the createClusterNode() function. */
-        myself = server.cluster->myself =
-            createClusterNode(NULL,CLUSTER_NODE_MYSELF|CLUSTER_NODE_MASTER);
-        serverLog(LL_NOTICE,"No cluster configuration found, I'm %.40s",
-            myself->name);
-        clusterAddNode(myself);
-        saveconf = 1;
-    }
-    if (saveconf) clusterSaveConfigOrDie(1);
-
-    /* We need a listening TCP port for our cluster messaging needs. */
-    server.cfd.count = 0;
-
-    /* Port sanity check II
-     * The other handshake port check is triggered too late to stop
-     * us from trying to use a too-high cluster port number. */
-    int port = server.tls_cluster ? server.tls_port : server.port;
-    if (port > (65535-CLUSTER_PORT_INCR)) {
-        serverLog(LL_WARNING, "Redis port number too high. "
-                   "Cluster communication port is 10,000 port "
-                   "numbers higher than your Redis port. "
-                   "Your Redis port number must be 55535 or less.");
-        exit(1);
-    }
-    if (listenToPort(port+CLUSTER_PORT_INCR, &server.cfd) == C_ERR) {
-        exit(1);
-    }
-    if (createSocketAcceptHandler(&server.cfd, clusterAcceptHandler) != C_OK) {
-        serverPanic("Unrecoverable error creating Redis Cluster socket accept handler.");
-    }
-
-    /* The slots -> keys map is a radix tree. Initialize it here. */
-    server.cluster->slots_to_keys = raxNew();
-    memset(server.cluster->slots_keys_count,0,
-           sizeof(server.cluster->slots_keys_count));
-
-    /* Set myself->port/cport/pport to my listening ports, we'll just need to
-     * discover the IP address via MEET messages. */
-    deriveAnnouncedPorts(&myself->port, &myself->pport, &myself->cport);
-
-    server.cluster->mf_end = 0;
-    resetManualFailover();
-    clusterUpdateMyselfFlags();
-}
-
-/* Reset a node performing a soft or hard reset:
- *
- * 1) All other nodes are forgotten.
- * 2) All the assigned / open slots are released.
- * 3) If the node is a slave, it turns into a master.
- * 4) Only for hard reset: a new Node ID is generated.
- * 5) Only for hard reset: currentEpoch and configEpoch are set to 0.
- * 6) The new configuration is saved and the cluster state updated.
- * 7) If the node was a slave, the whole data set is flushed away. */
-void clusterReset(int hard) {
-    dictIterator *di;
-    dictEntry *de;
-    int j;
-
-    /* Turn into master. */
-    if (nodeIsSlave(myself)) {
-        clusterSetNodeAsMaster(myself);
-        replicationUnsetMaster();
-        emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
-    }
-
-    /* Close slots, reset manual failover state. */
-    clusterCloseAllSlots();
-    resetManualFailover();
-
-    /* Unassign all the slots. */
-    for (j = 0; j < CLUSTER_SLOTS; j++) clusterDelSlot(j);
-
-    /* Forget all the nodes, but myself. */
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (node == myself) continue;
-        clusterDelNode(node);
-    }
-    dictReleaseIterator(di);
-
-    /* Hard reset only: set epochs to 0, change node ID. */
-    if (hard) {
-        sds oldname;
-
-        server.cluster->currentEpoch = 0;
-        server.cluster->lastVoteEpoch = 0;
-        myself->configEpoch = 0;
-        serverLog(LL_WARNING, "configEpoch set to 0 via CLUSTER RESET HARD");
-
-        /* To change the Node ID we need to remove the old name from the
-         * nodes table, change the ID, and re-add back with new name. */
-        oldname = sdsnewlen(myself->name, CLUSTER_NAMELEN);
-        dictDelete(server.cluster->nodes,oldname);
-        sdsfree(oldname);
-        getRandomHexChars(myself->name, CLUSTER_NAMELEN);
-        clusterAddNode(myself);
-        serverLog(LL_NOTICE,"Node hard reset, now I'm %.40s", myself->name);
-    }
-
-    /* Make sure to persist the new config and update the state. */
-    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                         CLUSTER_TODO_UPDATE_STATE|
-                         CLUSTER_TODO_FSYNC_CONFIG);
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER communication link
- * -------------------------------------------------------------------------- */
-
-clusterLink *createClusterLink(clusterNode *node) {
-    clusterLink *link = zmalloc(sizeof(*link));
-    link->ctime = mstime();
-    link->sndbuf = sdsempty();
-    link->rcvbuf = zmalloc(link->rcvbuf_alloc = RCVBUF_INIT_LEN);
-    link->rcvbuf_len = 0;
-    link->node = node;
-    link->conn = NULL;
-    return link;
-}
-
-/* Free a cluster link, but does not free the associated node of course.
- * This function will just make sure that the original node associated
- * with this link will have the 'link' field set to NULL. */
-void freeClusterLink(clusterLink *link) {
-    if (link->conn) {
-        connClose(link->conn);
-        link->conn = NULL;
-    }
-    sdsfree(link->sndbuf);
-    zfree(link->rcvbuf);
-    if (link->node)
-        link->node->link = NULL;
-    zfree(link);
-}
-
-static void clusterConnAcceptHandler(connection *conn) {
-    clusterLink *link;
-
-    if (connGetState(conn) != CONN_STATE_CONNECTED) {
-        serverLog(LL_VERBOSE,
-                "Error accepting cluster node connection: %s", connGetLastError(conn));
-        connClose(conn);
-        return;
-    }
-
-    /* Create a link object we use to handle the connection.
-     * It gets passed to the readable handler when data is available.
-     * Initially the link->node pointer is set to NULL as we don't know
-     * which node is, but the right node is references once we know the
-     * node identity. */
-    link = createClusterLink(NULL);
-    link->conn = conn;
-    connSetPrivateData(conn, link);
-
-    /* Register read handler */
-    connSetReadHandler(conn, clusterReadHandler);
-}
-
-#define MAX_CLUSTER_ACCEPTS_PER_CALL 1000
-void clusterAcceptHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    int cport, cfd;
-    int max = MAX_CLUSTER_ACCEPTS_PER_CALL;
-    char cip[NET_IP_STR_LEN];
-    UNUSED(el);
-    UNUSED(mask);
-    UNUSED(privdata);
-
-    /* If the server is starting up, don't accept cluster connections:
-     * UPDATE messages may interact with the database content. */
-    if (server.masterhost == NULL && server.loading) return;
-
-    while(max--) {
-        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
-        if (cfd == ANET_ERR) {
-            if (errno != EWOULDBLOCK)
-                serverLog(LL_VERBOSE,
-                    "Error accepting cluster node: %s", server.neterr);
-            return;
-        }
-
-        connection *conn = server.tls_cluster ?
-            connCreateAcceptedTLS(cfd, TLS_CLIENT_AUTH_YES) : connCreateAcceptedSocket(cfd);
-
-        /* Make sure connection is not in an error state */
-        if (connGetState(conn) != CONN_STATE_ACCEPTING) {
-            serverLog(LL_VERBOSE,
-                "Error creating an accepting connection for cluster node: %s",
-                    connGetLastError(conn));
-            connClose(conn);
-            return;
-        }
-        connNonBlock(conn);
-        connEnableTcpNoDelay(conn);
-        connKeepAlive(conn,server.cluster_node_timeout * 2);
-
-        /* Use non-blocking I/O for cluster messages. */
-        serverLog(LL_VERBOSE,"Accepting cluster node connection from %s:%d", cip, cport);
-
-        /* Accept the connection now.  connAccept() may call our handler directly
-         * or schedule it for later depending on connection implementation.
-         */
-        if (connAccept(conn, clusterConnAcceptHandler) == C_ERR) {
-            if (connGetState(conn) == CONN_STATE_ERROR)
-                serverLog(LL_VERBOSE,
-                        "Error accepting cluster node connection: %s",
-                        connGetLastError(conn));
-            connClose(conn);
-            return;
-        }
-    }
-}
-
-/* Return the approximated number of sockets we are using in order to
- * take the cluster bus connections. */
-unsigned long getClusterConnectionsCount(void) {
-    /* We decrement the number of nodes by one, since there is the
-     * "myself" node too in the list. Each node uses two file descriptors,
-     * one incoming and one outgoing, thus the multiplication by 2. */
-    return server.cluster_enabled ?
-           ((dictSize(server.cluster->nodes)-1)*2) : 0;
-}
-
-/* -----------------------------------------------------------------------------
- * Key space handling
- * -------------------------------------------------------------------------- */
-
-/* We have 16384 hash slots. The hash slot of a given key is obtained
- * as the least significant 14 bits of the crc16 of the key.
- *
- * However if the key contains the {...} pattern, only the part between
- * { and } is hashed. This may be useful in the future to force certain
- * keys to be in the same node (assuming no resharding is in progress). */
-unsigned int keyHashSlot(char *key, int keylen) {
-    int s, e; /* start-end indexes of { and } */
-
-    for (s = 0; s < keylen; s++)
-        if (key[s] == '{') break;
-
-    /* No '{' ? Hash the whole key. This is the base case. */
-    if (s == keylen) return crc16(key,keylen) & 0x3FFF;
-
-    /* '{' found? Check if we have the corresponding '}'. */
-    for (e = s+1; e < keylen; e++)
-        if (key[e] == '}') break;
-
-    /* No '}' or nothing between {} ? Hash the whole key. */
-    if (e == keylen || e == s+1) return crc16(key,keylen) & 0x3FFF;
-
-    /* If we are here there is both a { and a } on its right. Hash
-     * what is in the middle between { and }. */
-    return crc16(key+s+1,e-s-1) & 0x3FFF;
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER node API
- * -------------------------------------------------------------------------- */
-
-/* Create a new cluster node, with the specified flags.
- * If "nodename" is NULL this is considered a first handshake and a random
- * node name is assigned to this node (it will be fixed later when we'll
- * receive the first pong).
- *
- * The node is created and returned to the user, but it is not automatically
- * added to the nodes hash table. */
-clusterNode *createClusterNode(char *nodename, int flags) {
-    clusterNode *node = zmalloc(sizeof(*node));
-
-    if (nodename)
-        memcpy(node->name, nodename, CLUSTER_NAMELEN);
-    else
-        getRandomHexChars(node->name, CLUSTER_NAMELEN);
-    node->ctime = mstime();
-    node->configEpoch = 0;
-    node->flags = flags;
-    memset(node->slots,0,sizeof(node->slots));
-    node->slots_info = NULL;
-    node->numslots = 0;
-    node->numslaves = 0;
-    node->slaves = NULL;
-    node->slaveof = NULL;
-    node->ping_sent = node->pong_received = 0;
-    node->data_received = 0;
-    node->fail_time = 0;
-    node->link = NULL;
-    memset(node->ip,0,sizeof(node->ip));
-    node->port = 0;
-    node->cport = 0;
-    node->pport = 0;
-    node->fail_reports = listCreate();
-    node->voted_time = 0;
-    node->orphaned_time = 0;
-    node->repl_offset_time = 0;
-    node->repl_offset = 0;
-    listSetFreeMethod(node->fail_reports,zfree);
-    return node;
-}
-
-/* This function is called every time we get a failure report from a node.
- * The side effect is to populate the fail_reports list (or to update
- * the timestamp of an existing report).
- *
- * 'failing' is the node that is in failure state according to the
- * 'sender' node.
- *
- * The function returns 0 if it just updates a timestamp of an existing
- * failure report from the same sender. 1 is returned if a new failure
- * report is created. */
-int clusterNodeAddFailureReport(clusterNode *failing, clusterNode *sender) {
-    list *l = failing->fail_reports;
-    listNode *ln;
-    listIter li;
-    clusterNodeFailReport *fr;
-
-    /* If a failure report from the same sender already exists, just update
-     * the timestamp. */
-    listRewind(l,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        fr = ln->value;
-        if (fr->node == sender) {
-            fr->time = mstime();
-            return 0;
-        }
-    }
-
-    /* Otherwise create a new report. */
-    fr = zmalloc(sizeof(*fr));
-    fr->node = sender;
-    fr->time = mstime();
-    listAddNodeTail(l,fr);
-    return 1;
-}
-
-/* Remove failure reports that are too old, where too old means reasonably
- * older than the global node timeout. Note that anyway for a node to be
- * flagged as FAIL we need to have a local PFAIL state that is at least
- * older than the global node timeout, so we don't just trust the number
- * of failure reports from other nodes. */
-void clusterNodeCleanupFailureReports(clusterNode *node) {
-    list *l = node->fail_reports;
-    listNode *ln;
-    listIter li;
-    clusterNodeFailReport *fr;
-    mstime_t maxtime = server.cluster_node_timeout *
-                     CLUSTER_FAIL_REPORT_VALIDITY_MULT;
-    mstime_t now = mstime();
-
-    listRewind(l,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        fr = ln->value;
-        if (now - fr->time > maxtime) listDelNode(l,ln);
-    }
-}
-
-/* Remove the failing report for 'node' if it was previously considered
- * failing by 'sender'. This function is called when a node informs us via
- * gossip that a node is OK from its point of view (no FAIL or PFAIL flags).
- *
- * Note that this function is called relatively often as it gets called even
- * when there are no nodes failing, and is O(N), however when the cluster is
- * fine the failure reports list is empty so the function runs in constant
- * time.
- *
- * The function returns 1 if the failure report was found and removed.
- * Otherwise 0 is returned. */
-int clusterNodeDelFailureReport(clusterNode *node, clusterNode *sender) {
-    list *l = node->fail_reports;
-    listNode *ln;
-    listIter li;
-    clusterNodeFailReport *fr;
-
-    /* Search for a failure report from this sender. */
-    listRewind(l,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        fr = ln->value;
-        if (fr->node == sender) break;
-    }
-    if (!ln) return 0; /* No failure report from this sender. */
-
-    /* Remove the failure report. */
-    listDelNode(l,ln);
-    clusterNodeCleanupFailureReports(node);
-    return 1;
-}
-
-/* Return the number of external nodes that believe 'node' is failing,
- * not including this node, that may have a PFAIL or FAIL state for this
- * node as well. */
-int clusterNodeFailureReportsCount(clusterNode *node) {
-    clusterNodeCleanupFailureReports(node);
-    return listLength(node->fail_reports);
-}
-
-int clusterNodeRemoveSlave(clusterNode *master, clusterNode *slave) {
-    int j;
-
-    for (j = 0; j < master->numslaves; j++) {
-        if (master->slaves[j] == slave) {
-            if ((j+1) < master->numslaves) {
-                int remaining_slaves = (master->numslaves - j) - 1;
-                memmove(master->slaves+j,master->slaves+(j+1),
-                        (sizeof(*master->slaves) * remaining_slaves));
-            }
-            master->numslaves--;
-            if (master->numslaves == 0)
-                master->flags &= ~CLUSTER_NODE_MIGRATE_TO;
-            return C_OK;
-        }
-    }
-    return C_ERR;
-}
-
-int clusterNodeAddSlave(clusterNode *master, clusterNode *slave) {
-    int j;
-
-    /* If it's already a slave, don't add it again. */
-    for (j = 0; j < master->numslaves; j++)
-        if (master->slaves[j] == slave) return C_ERR;
-    master->slaves = zrealloc(master->slaves,
-        sizeof(clusterNode*)*(master->numslaves+1));
-    master->slaves[master->numslaves] = slave;
-    master->numslaves++;
-    master->flags |= CLUSTER_NODE_MIGRATE_TO;
-    return C_OK;
-}
-
-int clusterCountNonFailingSlaves(clusterNode *n) {
-    int j, okslaves = 0;
-
-    for (j = 0; j < n->numslaves; j++)
-        if (!nodeFailed(n->slaves[j])) okslaves++;
-    return okslaves;
-}
-
-/* Low level cleanup of the node structure. Only called by clusterDelNode(). */
-void freeClusterNode(clusterNode *n) {
-    sds nodename;
-    int j;
-
-    /* If the node has associated slaves, we have to set
-     * all the slaves->slaveof fields to NULL (unknown). */
-    for (j = 0; j < n->numslaves; j++)
-        n->slaves[j]->slaveof = NULL;
-
-    /* Remove this node from the list of slaves of its master. */
-    if (nodeIsSlave(n) && n->slaveof) clusterNodeRemoveSlave(n->slaveof,n);
-
-    /* Unlink from the set of nodes. */
-    nodename = sdsnewlen(n->name, CLUSTER_NAMELEN);
-    serverAssert(dictDelete(server.cluster->nodes,nodename) == DICT_OK);
-    sdsfree(nodename);
-
-    /* Release link and associated data structures. */
-    if (n->link) freeClusterLink(n->link);
-    listRelease(n->fail_reports);
-    zfree(n->slaves);
-    zfree(n);
-}
-
-/* Add a node to the nodes hash table */
-void clusterAddNode(clusterNode *node) {
-    int retval;
-
-    retval = dictAdd(server.cluster->nodes,
-            sdsnewlen(node->name,CLUSTER_NAMELEN), node);
-    serverAssert(retval == DICT_OK);
-}
-
-/* Remove a node from the cluster. The function performs the high level
- * cleanup, calling freeClusterNode() for the low level cleanup.
- * Here we do the following:
- *
- * 1) Mark all the slots handled by it as unassigned.
- * 2) Remove all the failure reports sent by this node and referenced by
- *    other nodes.
- * 3) Free the node with freeClusterNode() that will in turn remove it
- *    from the hash table and from the list of slaves of its master, if
- *    it is a slave node.
- */
-void clusterDelNode(clusterNode *delnode) {
-    int j;
-    dictIterator *di;
-    dictEntry *de;
-
-    /* 1) Mark slots as unassigned. */
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (server.cluster->importing_slots_from[j] == delnode)
-            server.cluster->importing_slots_from[j] = NULL;
-        if (server.cluster->migrating_slots_to[j] == delnode)
-            server.cluster->migrating_slots_to[j] = NULL;
-        if (server.cluster->slots[j] == delnode)
-            clusterDelSlot(j);
-    }
-
-    /* 2) Remove failure reports. */
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (node == delnode) continue;
-        clusterNodeDelFailureReport(node,delnode);
-    }
-    dictReleaseIterator(di);
-
-    /* 3) Free the node, unlinking it from the cluster. */
-    freeClusterNode(delnode);
-}
-
-/* Node lookup by name */
-clusterNode *clusterLookupNode(const char *name) {
-    sds s = sdsnewlen(name, CLUSTER_NAMELEN);
-    dictEntry *de;
-
-    de = dictFind(server.cluster->nodes,s);
-    sdsfree(s);
-    if (de == NULL) return NULL;
-    return dictGetVal(de);
-}
-
-/* This is only used after the handshake. When we connect a given IP/PORT
- * as a result of CLUSTER MEET we don't have the node name yet, so we
- * pick a random one, and will fix it when we receive the PONG request using
- * this function. */
-void clusterRenameNode(clusterNode *node, char *newname) {
-    int retval;
-    sds s = sdsnewlen(node->name, CLUSTER_NAMELEN);
-
-    serverLog(LL_DEBUG,"Renaming node %.40s into %.40s",
-        node->name, newname);
-    retval = dictDelete(server.cluster->nodes, s);
-    sdsfree(s);
-    serverAssert(retval == DICT_OK);
-    memcpy(node->name, newname, CLUSTER_NAMELEN);
-    clusterAddNode(node);
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER config epoch handling
- * -------------------------------------------------------------------------- */
-
-/* Return the greatest configEpoch found in the cluster, or the current
- * epoch if greater than any node configEpoch. */
-uint64_t clusterGetMaxEpoch(void) {
-    uint64_t max = 0;
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-        if (node->configEpoch > max) max = node->configEpoch;
-    }
-    dictReleaseIterator(di);
-    if (max < server.cluster->currentEpoch) max = server.cluster->currentEpoch;
-    return max;
-}
-
-/* If this node epoch is zero or is not already the greatest across the
- * cluster (from the POV of the local configuration), this function will:
- *
- * 1) Generate a new config epoch, incrementing the current epoch.
- * 2) Assign the new epoch to this node, WITHOUT any consensus.
- * 3) Persist the configuration on disk before sending packets with the
- *    new configuration.
- *
- * If the new config epoch is generated and assigned, C_OK is returned,
- * otherwise C_ERR is returned (since the node has already the greatest
- * configuration around) and no operation is performed.
- *
- * Important note: this function violates the principle that config epochs
- * should be generated with consensus and should be unique across the cluster.
- * However Redis Cluster uses this auto-generated new config epochs in two
- * cases:
- *
- * 1) When slots are closed after importing. Otherwise resharding would be
- *    too expensive.
- * 2) When CLUSTER FAILOVER is called with options that force a slave to
- *    failover its master even if there is not master majority able to
- *    create a new configuration epoch.
- *
- * Redis Cluster will not explode using this function, even in the case of
- * a collision between this node and another node, generating the same
- * configuration epoch unilaterally, because the config epoch conflict
- * resolution algorithm will eventually move colliding nodes to different
- * config epochs. However using this function may violate the "last failover
- * wins" rule, so should only be used with care. */
-int clusterBumpConfigEpochWithoutConsensus(void) {
-    uint64_t maxEpoch = clusterGetMaxEpoch();
-
-    if (myself->configEpoch == 0 ||
-        myself->configEpoch != maxEpoch)
-    {
-        server.cluster->currentEpoch++;
-        myself->configEpoch = server.cluster->currentEpoch;
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                             CLUSTER_TODO_FSYNC_CONFIG);
-        serverLog(LL_WARNING,
-            "New configEpoch set to %llu",
-            (unsigned long long) myself->configEpoch);
-        return C_OK;
-    } else {
-        return C_ERR;
-    }
-}
-
-/* This function is called when this node is a master, and we receive from
- * another master a configuration epoch that is equal to our configuration
- * epoch.
- *
- * BACKGROUND
- *
- * It is not possible that different slaves get the same config
- * epoch during a failover election, because the slaves need to get voted
- * by a majority. However when we perform a manual resharding of the cluster
- * the node will assign a configuration epoch to itself without to ask
- * for agreement. Usually resharding happens when the cluster is working well
- * and is supervised by the sysadmin, however it is possible for a failover
- * to happen exactly while the node we are resharding a slot to assigns itself
- * a new configuration epoch, but before it is able to propagate it.
- *
- * So technically it is possible in this condition that two nodes end with
- * the same configuration epoch.
- *
- * Another possibility is that there are bugs in the implementation causing
- * this to happen.
- *
- * Moreover when a new cluster is created, all the nodes start with the same
- * configEpoch. This collision resolution code allows nodes to automatically
- * end with a different configEpoch at startup automatically.
- *
- * In all the cases, we want a mechanism that resolves this issue automatically
- * as a safeguard. The same configuration epoch for masters serving different
- * set of slots is not harmful, but it is if the nodes end serving the same
- * slots for some reason (manual errors or software bugs) without a proper
- * failover procedure.
- *
- * In general we want a system that eventually always ends with different
- * masters having different configuration epochs whatever happened, since
- * nothing is worse than a split-brain condition in a distributed system.
- *
- * BEHAVIOR
- *
- * When this function gets called, what happens is that if this node
- * has the lexicographically smaller Node ID compared to the other node
- * with the conflicting epoch (the 'sender' node), it will assign itself
- * the greatest configuration epoch currently detected among nodes plus 1.
- *
- * This means that even if there are multiple nodes colliding, the node
- * with the greatest Node ID never moves forward, so eventually all the nodes
- * end with a different configuration epoch.
- */
-void clusterHandleConfigEpochCollision(clusterNode *sender) {
-    /* Prerequisites: nodes have the same configEpoch and are both masters. */
-    if (sender->configEpoch != myself->configEpoch ||
-        !nodeIsMaster(sender) || !nodeIsMaster(myself)) return;
-    /* Don't act if the colliding node has a smaller Node ID. */
-    if (memcmp(sender->name,myself->name,CLUSTER_NAMELEN) <= 0) return;
-    /* Get the next ID available at the best of this node knowledge. */
-    server.cluster->currentEpoch++;
-    myself->configEpoch = server.cluster->currentEpoch;
-    clusterSaveConfigOrDie(1);
-    serverLog(LL_VERBOSE,
-        "WARNING: configEpoch collision with node %.40s."
-        " configEpoch set to %llu",
-        sender->name,
-        (unsigned long long) myself->configEpoch);
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER nodes blacklist
- *
- * The nodes blacklist is just a way to ensure that a given node with a given
- * Node ID is not readded before some time elapsed (this time is specified
- * in seconds in CLUSTER_BLACKLIST_TTL).
- *
- * This is useful when we want to remove a node from the cluster completely:
- * when CLUSTER FORGET is called, it also puts the node into the blacklist so
- * that even if we receive gossip messages from other nodes that still remember
- * about the node we want to remove, we don't re-add it before some time.
- *
- * Currently the CLUSTER_BLACKLIST_TTL is set to 1 minute, this means
- * that redis-trib has 60 seconds to send CLUSTER FORGET messages to nodes
- * in the cluster without dealing with the problem of other nodes re-adding
- * back the node to nodes we already sent the FORGET command to.
- *
- * The data structure used is a hash table with an sds string representing
- * the node ID as key, and the time when it is ok to re-add the node as
- * value.
- * -------------------------------------------------------------------------- */
-
-#define CLUSTER_BLACKLIST_TTL 60      /* 1 minute. */
-
-
-/* Before of the addNode() or Exists() operations we always remove expired
- * entries from the black list. This is an O(N) operation but it is not a
- * problem since add / exists operations are called very infrequently and
- * the hash table is supposed to contain very little elements at max.
- * However without the cleanup during long uptime and with some automated
- * node add/removal procedures, entries could accumulate. */
-void clusterBlacklistCleanup(void) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(server.cluster->nodes_black_list);
-    while((de = dictNext(di)) != NULL) {
-        int64_t expire = dictGetUnsignedIntegerVal(de);
-
-        if (expire < server.unixtime)
-            dictDelete(server.cluster->nodes_black_list,dictGetKey(de));
-    }
-    dictReleaseIterator(di);
-}
-
-/* Cleanup the blacklist and add a new node ID to the black list. */
-void clusterBlacklistAddNode(clusterNode *node) {
-    dictEntry *de;
-    sds id = sdsnewlen(node->name,CLUSTER_NAMELEN);
-
-    clusterBlacklistCleanup();
-    if (dictAdd(server.cluster->nodes_black_list,id,NULL) == DICT_OK) {
-        /* If the key was added, duplicate the sds string representation of
-         * the key for the next lookup. We'll free it at the end. */
-        id = sdsdup(id);
-    }
-    de = dictFind(server.cluster->nodes_black_list,id);
-    dictSetUnsignedIntegerVal(de,time(NULL)+CLUSTER_BLACKLIST_TTL);
-    sdsfree(id);
-}
-
-/* Return non-zero if the specified node ID exists in the blacklist.
- * You don't need to pass an sds string here, any pointer to 40 bytes
- * will work. */
-int clusterBlacklistExists(char *nodeid) {
-    sds id = sdsnewlen(nodeid,CLUSTER_NAMELEN);
-    int retval;
-
-    clusterBlacklistCleanup();
-    retval = dictFind(server.cluster->nodes_black_list,id) != NULL;
-    sdsfree(id);
-    return retval;
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER messages exchange - PING/PONG and gossip
- * -------------------------------------------------------------------------- */
-
-/* This function checks if a given node should be marked as FAIL.
- * It happens if the following conditions are met:
- *
- * 1) We received enough failure reports from other master nodes via gossip.
- *    Enough means that the majority of the masters signaled the node is
- *    down recently.
- * 2) We believe this node is in PFAIL state.
- *
- * If a failure is detected we also inform the whole cluster about this
- * event trying to force every other node to set the FAIL flag for the node.
- *
- * Note that the form of agreement used here is weak, as we collect the majority
- * of masters state during some time, and even if we force agreement by
- * propagating the FAIL message, because of partitions we may not reach every
- * node. However:
- *
- * 1) Either we reach the majority and eventually the FAIL state will propagate
- *    to all the cluster.
- * 2) Or there is no majority so no slave promotion will be authorized and the
- *    FAIL flag will be cleared after some time.
- */
-void markNodeAsFailingIfNeeded(clusterNode *node) {
-    int failures;
-    int needed_quorum = (server.cluster->size / 2) + 1;
-
-    if (!nodeTimedOut(node)) return; /* We can reach it. */
-    if (nodeFailed(node)) return; /* Already FAILing. */
-
-    failures = clusterNodeFailureReportsCount(node);
-    /* Also count myself as a voter if I'm a master. */
-    if (nodeIsMaster(myself)) failures++;
-    if (failures < needed_quorum) return; /* No weak agreement from masters. */
-
-    serverLog(LL_NOTICE,
-        "Marking node %.40s as failing (quorum reached).", node->name);
-
-    /* Mark the node as failing. */
-    node->flags &= ~CLUSTER_NODE_PFAIL;
-    node->flags |= CLUSTER_NODE_FAIL;
-    node->fail_time = mstime();
-
-    /* Broadcast the failing node name to everybody, forcing all the other
-     * reachable nodes to flag the node as FAIL.
-     * We do that even if this node is a replica and not a master: anyway
-     * the failing state is triggered collecting failure reports from masters,
-     * so here the replica is only helping propagating this status. */
-    clusterSendFail(node->name);
-    clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-}
-
-/* This function is called only if a node is marked as FAIL, but we are able
- * to reach it again. It checks if there are the conditions to undo the FAIL
- * state. */
-void clearNodeFailureIfNeeded(clusterNode *node) {
-    mstime_t now = mstime();
-
-    serverAssert(nodeFailed(node));
-
-    /* For slaves we always clear the FAIL flag if we can contact the
-     * node again. */
-    if (nodeIsSlave(node) || node->numslots == 0) {
-        serverLog(LL_NOTICE,
-            "Clear FAIL state for node %.40s: %s is reachable again.",
-                node->name,
-                nodeIsSlave(node) ? "replica" : "master without slots");
-        node->flags &= ~CLUSTER_NODE_FAIL;
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-    }
-
-    /* If it is a master and...
-     * 1) The FAIL state is old enough.
-     * 2) It is yet serving slots from our point of view (not failed over).
-     * Apparently no one is going to fix these slots, clear the FAIL flag. */
-    if (nodeIsMaster(node) && node->numslots > 0 &&
-        (now - node->fail_time) >
-        (server.cluster_node_timeout * CLUSTER_FAIL_UNDO_TIME_MULT))
-    {
-        serverLog(LL_NOTICE,
-            "Clear FAIL state for node %.40s: is reachable again and nobody is serving its slots after some time.",
-                node->name);
-        node->flags &= ~CLUSTER_NODE_FAIL;
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-    }
-}
-
-/* Return true if we already have a node in HANDSHAKE state matching the
- * specified ip address and port number. This function is used in order to
- * avoid adding a new handshake node for the same address multiple times. */
-int clusterHandshakeInProgress(char *ip, int port, int cport) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (!nodeInHandshake(node)) continue;
-        if (!strcasecmp(node->ip,ip) &&
-            node->port == port &&
-            node->cport == cport) break;
-    }
-    dictReleaseIterator(di);
-    return de != NULL;
-}
-
-/* Start a handshake with the specified address if there is not one
- * already in progress. Returns non-zero if the handshake was actually
- * started. On error zero is returned and errno is set to one of the
- * following values:
- *
- * EAGAIN - There is already a handshake in progress for this address.
- * EINVAL - IP or port are not valid. */
-int clusterStartHandshake(char *ip, int port, int cport) {
-    clusterNode *n;
-    char norm_ip[NET_IP_STR_LEN];
-    struct sockaddr_storage sa;
-
-    /* IP sanity check */
-    if (inet_pton(AF_INET,ip,
-            &(((struct sockaddr_in *)&sa)->sin_addr)))
-    {
-        sa.ss_family = AF_INET;
-    } else if (inet_pton(AF_INET6,ip,
-            &(((struct sockaddr_in6 *)&sa)->sin6_addr)))
-    {
-        sa.ss_family = AF_INET6;
-    } else {
-        errno = EINVAL;
-        return 0;
-    }
-
-    /* Port sanity check */
-    if (port <= 0 || port > 65535 || cport <= 0 || cport > 65535) {
-        errno = EINVAL;
-        return 0;
-    }
-
-    /* Set norm_ip as the normalized string representation of the node
-     * IP address. */
-    memset(norm_ip,0,NET_IP_STR_LEN);
-    if (sa.ss_family == AF_INET)
-        inet_ntop(AF_INET,
-            (void*)&(((struct sockaddr_in *)&sa)->sin_addr),
-            norm_ip,NET_IP_STR_LEN);
-    else
-        inet_ntop(AF_INET6,
-            (void*)&(((struct sockaddr_in6 *)&sa)->sin6_addr),
-            norm_ip,NET_IP_STR_LEN);
-
-    if (clusterHandshakeInProgress(norm_ip,port,cport)) {
-        errno = EAGAIN;
-        return 0;
-    }
-
-    /* Add the node with a random address (NULL as first argument to
-     * createClusterNode()). Everything will be fixed during the
-     * handshake. */
-    n = createClusterNode(NULL,CLUSTER_NODE_HANDSHAKE|CLUSTER_NODE_MEET);
-    memcpy(n->ip,norm_ip,sizeof(n->ip));
-    n->port = port;
-    n->cport = cport;
-    clusterAddNode(n);
-    return 1;
-}
-
-/* Process the gossip section of PING or PONG packets.
- * Note that this function assumes that the packet is already sanity-checked
- * by the caller, not in the content of the gossip section, but in the
- * length. */
-void clusterProcessGossipSection(clusterMsg *hdr, clusterLink *link) {
-    uint16_t count = ntohs(hdr->count);
-    clusterMsgDataGossip *g = (clusterMsgDataGossip*) hdr->data.ping.gossip;
-    clusterNode *sender = link->node ? link->node : clusterLookupNode(hdr->sender);
-
-    while(count--) {
-        uint16_t flags = ntohs(g->flags);
-        clusterNode *node;
-        sds ci;
-
-        if (server.verbosity == LL_DEBUG) {
-            ci = representClusterNodeFlags(sdsempty(), flags);
-            serverLog(LL_DEBUG,"GOSSIP %.40s %s:%d@%d %s",
-                g->nodename,
-                g->ip,
-                ntohs(g->port),
-                ntohs(g->cport),
-                ci);
-            sdsfree(ci);
-        }
-
-        /* Update our state accordingly to the gossip sections */
-        node = clusterLookupNode(g->nodename);
-        if (node) {
-            /* We already know this node.
-               Handle failure reports, only when the sender is a master. */
-            if (sender && nodeIsMaster(sender) && node != myself) {
-                if (flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) {
-                    if (clusterNodeAddFailureReport(node,sender)) {
-                        serverLog(LL_VERBOSE,
-                            "Node %.40s reported node %.40s as not reachable.",
-                            sender->name, node->name);
-                    }
-                    markNodeAsFailingIfNeeded(node);
-                } else {
-                    if (clusterNodeDelFailureReport(node,sender)) {
-                        serverLog(LL_VERBOSE,
-                            "Node %.40s reported node %.40s is back online.",
-                            sender->name, node->name);
-                    }
-                }
-            }
-
-            /* If from our POV the node is up (no failure flags are set),
-             * we have no pending ping for the node, nor we have failure
-             * reports for this node, update the last pong time with the
-             * one we see from the other nodes. */
-            if (!(flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) &&
-                node->ping_sent == 0 &&
-                clusterNodeFailureReportsCount(node) == 0)
-            {
-                mstime_t pongtime = ntohl(g->pong_received);
-                pongtime *= 1000; /* Convert back to milliseconds. */
-
-                /* Replace the pong time with the received one only if
-                 * it's greater than our view but is not in the future
-                 * (with 500 milliseconds tolerance) from the POV of our
-                 * clock. */
-                if (pongtime <= (server.mstime+500) &&
-                    pongtime > node->pong_received)
-                {
-                    node->pong_received = pongtime;
-                }
-            }
-
-            /* If we already know this node, but it is not reachable, and
-             * we see a different address in the gossip section of a node that
-             * can talk with this other node, update the address, disconnect
-             * the old link if any, so that we'll attempt to connect with the
-             * new address. */
-            if (node->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL) &&
-                !(flags & CLUSTER_NODE_NOADDR) &&
-                !(flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) &&
-                (strcasecmp(node->ip,g->ip) ||
-                 node->port != ntohs(g->port) ||
-                 node->cport != ntohs(g->cport)))
-            {
-                if (node->link) freeClusterLink(node->link);
-                memcpy(node->ip,g->ip,NET_IP_STR_LEN);
-                node->port = ntohs(g->port);
-                node->pport = ntohs(g->pport);
-                node->cport = ntohs(g->cport);
-                node->flags &= ~CLUSTER_NODE_NOADDR;
-            }
-        } else {
-            /* If it's not in NOADDR state and we don't have it, we
-             * add it to our trusted dict with exact nodeid and flag.
-             * Note that we cannot simply start a handshake against
-             * this IP/PORT pairs, since IP/PORT can be reused already,
-             * otherwise we risk joining another cluster.
-             *
-             * Note that we require that the sender of this gossip message
-             * is a well known node in our cluster, otherwise we risk
-             * joining another cluster. */
-            if (sender &&
-                !(flags & CLUSTER_NODE_NOADDR) &&
-                !clusterBlacklistExists(g->nodename))
-            {
-                clusterNode *node;
-                node = createClusterNode(g->nodename, flags);
-                memcpy(node->ip,g->ip,NET_IP_STR_LEN);
-                node->port = ntohs(g->port);
-                node->pport = ntohs(g->pport);
-                node->cport = ntohs(g->cport);
-                clusterAddNode(node);
-            }
-        }
-
-        /* Next node */
-        g++;
-    }
-}
-
-/* IP -> string conversion. 'buf' is supposed to at least be 46 bytes.
- * If 'announced_ip' length is non-zero, it is used instead of extracting
- * the IP from the socket peer address. */
-void nodeIp2String(char *buf, clusterLink *link, char *announced_ip) {
-    if (announced_ip[0] != '\0') {
-        memcpy(buf,announced_ip,NET_IP_STR_LEN);
-        buf[NET_IP_STR_LEN-1] = '\0'; /* We are not sure the input is sane. */
-    } else {
-        connPeerToString(link->conn, buf, NET_IP_STR_LEN, NULL);
-    }
-}
-
-/* Update the node address to the IP address that can be extracted
- * from link->fd, or if hdr->myip is non empty, to the address the node
- * is announcing us. The port is taken from the packet header as well.
- *
- * If the address or port changed, disconnect the node link so that we'll
- * connect again to the new address.
- *
- * If the ip/port pair are already correct no operation is performed at
- * all.
- *
- * The function returns 0 if the node address is still the same,
- * otherwise 1 is returned. */
-int nodeUpdateAddressIfNeeded(clusterNode *node, clusterLink *link,
-                              clusterMsg *hdr)
-{
-    char ip[NET_IP_STR_LEN] = {0};
-    int port = ntohs(hdr->port);
-    int pport = ntohs(hdr->pport);
-    int cport = ntohs(hdr->cport);
-
-    /* We don't proceed if the link is the same as the sender link, as this
-     * function is designed to see if the node link is consistent with the
-     * symmetric link that is used to receive PINGs from the node.
-     *
-     * As a side effect this function never frees the passed 'link', so
-     * it is safe to call during packet processing. */
-    if (link == node->link) return 0;
-
-    nodeIp2String(ip,link,hdr->myip);
-    if (node->port == port && node->cport == cport && node->pport == pport &&
-        strcmp(ip,node->ip) == 0) return 0;
-
-    /* IP / port is different, update it. */
-    memcpy(node->ip,ip,sizeof(ip));
-    node->port = port;
-    node->pport = pport;
-    node->cport = cport;
-    if (node->link) freeClusterLink(node->link);
-    node->flags &= ~CLUSTER_NODE_NOADDR;
-    serverLog(LL_WARNING,"Address updated for node %.40s, now %s:%d",
-        node->name, node->ip, node->port);
-
-    /* Check if this is our master and we have to change the
-     * replication target as well. */
-    if (nodeIsSlave(myself) && myself->slaveof == node)
-        replicationSetMaster(node->ip, node->port);
-    return 1;
-}
-
-/* Reconfigure the specified node 'n' as a master. This function is called when
- * a node that we believed to be a slave is now acting as master in order to
- * update the state of the node. */
-void clusterSetNodeAsMaster(clusterNode *n) {
-    if (nodeIsMaster(n)) return;
-
-    if (n->slaveof) {
-        clusterNodeRemoveSlave(n->slaveof,n);
-        if (n != myself) n->flags |= CLUSTER_NODE_MIGRATE_TO;
-    }
-    n->flags &= ~CLUSTER_NODE_SLAVE;
-    n->flags |= CLUSTER_NODE_MASTER;
-    n->slaveof = NULL;
-
-    /* Update config and state. */
-    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                         CLUSTER_TODO_UPDATE_STATE);
-}
-
-/* This function is called when we receive a master configuration via a
- * PING, PONG or UPDATE packet. What we receive is a node, a configEpoch of the
- * node, and the set of slots claimed under this configEpoch.
- *
- * What we do is to rebind the slots with newer configuration compared to our
- * local configuration, and if needed, we turn ourself into a replica of the
- * node (see the function comments for more info).
- *
- * The 'sender' is the node for which we received a configuration update.
- * Sometimes it is not actually the "Sender" of the information, like in the
- * case we receive the info via an UPDATE packet. */
-void clusterUpdateSlotsConfigWith(clusterNode *sender, uint64_t senderConfigEpoch, unsigned char *slots) {
-    int j;
-    clusterNode *curmaster = NULL, *newmaster = NULL;
-    /* The dirty slots list is a list of slots for which we lose the ownership
-     * while having still keys inside. This usually happens after a failover
-     * or after a manual cluster reconfiguration operated by the admin.
-     *
-     * If the update message is not able to demote a master to slave (in this
-     * case we'll resync with the master updating the whole key space), we
-     * need to delete all the keys in the slots we lost ownership. */
-    uint16_t dirty_slots[CLUSTER_SLOTS];
-    int dirty_slots_count = 0;
-
-    /* We should detect if sender is new master of our shard.
-     * We will know it if all our slots were migrated to sender, and sender
-     * has no slots except ours */
-    int sender_slots = 0;
-    int migrated_our_slots = 0;
-
-    /* Here we set curmaster to this node or the node this node
-     * replicates to if it's a slave. In the for loop we are
-     * interested to check if slots are taken away from curmaster. */
-    curmaster = nodeIsMaster(myself) ? myself : myself->slaveof;
-
-    if (sender == myself) {
-        serverLog(LL_WARNING,"Discarding UPDATE message about myself.");
-        return;
-    }
-
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (bitmapTestBit(slots,j)) {
-            sender_slots++;
-
-            /* The slot is already bound to the sender of this message. */
-            if (server.cluster->slots[j] == sender) continue;
-
-            /* The slot is in importing state, it should be modified only
-             * manually via redis-trib (example: a resharding is in progress
-             * and the migrating side slot was already closed and is advertising
-             * a new config. We still want the slot to be closed manually). */
-            if (server.cluster->importing_slots_from[j]) continue;
-
-            /* We rebind the slot to the new node claiming it if:
-             * 1) The slot was unassigned or the new node claims it with a
-             *    greater configEpoch.
-             * 2) We are not currently importing the slot. */
-            if (server.cluster->slots[j] == NULL ||
-                server.cluster->slots[j]->configEpoch < senderConfigEpoch)
-            {
-                /* Was this slot mine, and still contains keys? Mark it as
-                 * a dirty slot. */
-                if (server.cluster->slots[j] == myself &&
-                    countKeysInSlot(j) &&
-                    sender != myself)
-                {
-                    dirty_slots[dirty_slots_count] = j;
-                    dirty_slots_count++;
-                }
-
-                if (server.cluster->slots[j] == curmaster) {
-                    newmaster = sender;
-                    migrated_our_slots++;
-                }
-                clusterDelSlot(j);
-                clusterAddSlot(sender,j);
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                     CLUSTER_TODO_UPDATE_STATE|
-                                     CLUSTER_TODO_FSYNC_CONFIG);
-            }
-        }
-    }
-
-    /* After updating the slots configuration, don't do any actual change
-     * in the state of the server if a module disabled Redis Cluster
-     * keys redirections. */
-    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
-        return;
-
-    /* If at least one slot was reassigned from a node to another node
-     * with a greater configEpoch, it is possible that:
-     * 1) We are a master left without slots. This means that we were
-     *    failed over and we should turn into a replica of the new
-     *    master.
-     * 2) We are a slave and our master is left without slots. We need
-     *    to replicate to the new slots owner. */
-    if (newmaster && curmaster->numslots == 0 &&
-            (server.cluster_allow_replica_migration ||
-             sender_slots == migrated_our_slots)) {
-        serverLog(LL_WARNING,
-            "Configuration change detected. Reconfiguring myself "
-            "as a replica of %.40s", sender->name);
-        clusterSetMaster(sender);
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                             CLUSTER_TODO_UPDATE_STATE|
-                             CLUSTER_TODO_FSYNC_CONFIG);
-    } else if (dirty_slots_count) {
-        /* If we are here, we received an update message which removed
-         * ownership for certain slots we still have keys about, but still
-         * we are serving some slots, so this master node was not demoted to
-         * a slave.
-         *
-         * In order to maintain a consistent state between keys and slots
-         * we need to remove all the keys from the slots we lost. */
-        for (j = 0; j < dirty_slots_count; j++)
-            delKeysInSlot(dirty_slots[j]);
-    }
-}
-
-/* When this function is called, there is a packet to process starting
- * at node->rcvbuf. Releasing the buffer is up to the caller, so this
- * function should just handle the higher level stuff of processing the
- * packet, modifying the cluster state if needed.
- *
- * The function returns 1 if the link is still valid after the packet
- * was processed, otherwise 0 if the link was freed since the packet
- * processing lead to some inconsistency error (for instance a PONG
- * received from the wrong sender ID). */
-int clusterProcessPacket(clusterLink *link) {
-    clusterMsg *hdr = (clusterMsg*) link->rcvbuf;
-    uint32_t totlen = ntohl(hdr->totlen);
-    uint16_t type = ntohs(hdr->type);
-    mstime_t now = mstime();
-
-    if (type < CLUSTERMSG_TYPE_COUNT)
-        server.cluster->stats_bus_messages_received[type]++;
-    serverLog(LL_DEBUG,"--- Processing packet of type %d, %lu bytes",
-        type, (unsigned long) totlen);
-
-    /* Perform sanity checks */
-    if (totlen < 16) return 1; /* At least signature, version, totlen, count. */
-    if (totlen > link->rcvbuf_len) return 1;
-
-    if (ntohs(hdr->ver) != CLUSTER_PROTO_VER) {
-        /* Can't handle messages of different versions. */
-        return 1;
-    }
-
-    uint16_t flags = ntohs(hdr->flags);
-    uint64_t senderCurrentEpoch = 0, senderConfigEpoch = 0;
-    clusterNode *sender;
-
-    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_PONG ||
-        type == CLUSTERMSG_TYPE_MEET)
-    {
-        uint16_t count = ntohs(hdr->count);
-        uint32_t explen; /* expected length of this packet */
-
-        explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-        explen += (sizeof(clusterMsgDataGossip)*count);
-        if (totlen != explen) return 1;
-    } else if (type == CLUSTERMSG_TYPE_FAIL) {
-        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-
-        explen += sizeof(clusterMsgDataFail);
-        if (totlen != explen) return 1;
-    } else if (type == CLUSTERMSG_TYPE_PUBLISH) {
-        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-
-        explen += sizeof(clusterMsgDataPublish) -
-                8 +
-                ntohl(hdr->data.publish.msg.channel_len) +
-                ntohl(hdr->data.publish.msg.message_len);
-        if (totlen != explen) return 1;
-    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST ||
-               type == CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK ||
-               type == CLUSTERMSG_TYPE_MFSTART)
-    {
-        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-
-        if (totlen != explen) return 1;
-    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
-        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-
-        explen += sizeof(clusterMsgDataUpdate);
-        if (totlen != explen) return 1;
-    } else if (type == CLUSTERMSG_TYPE_MODULE) {
-        uint32_t explen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-
-        explen += sizeof(clusterMsgModule) -
-                3 + ntohl(hdr->data.module.msg.len);
-        if (totlen != explen) return 1;
-    }
-
-    /* Check if the sender is a known node. Note that for incoming connections
-     * we don't store link->node information, but resolve the node by the
-     * ID in the header each time in the current implementation. */
-    sender = clusterLookupNode(hdr->sender);
-
-    /* Update the last time we saw any data from this node. We
-     * use this in order to avoid detecting a timeout from a node that
-     * is just sending a lot of data in the cluster bus, for instance
-     * because of Pub/Sub. */
-    if (sender) sender->data_received = now;
-
-    if (sender && !nodeInHandshake(sender)) {
-        /* Update our currentEpoch if we see a newer epoch in the cluster. */
-        senderCurrentEpoch = ntohu64(hdr->currentEpoch);
-        senderConfigEpoch = ntohu64(hdr->configEpoch);
-        if (senderCurrentEpoch > server.cluster->currentEpoch)
-            server.cluster->currentEpoch = senderCurrentEpoch;
-        /* Update the sender configEpoch if it is publishing a newer one. */
-        if (senderConfigEpoch > sender->configEpoch) {
-            sender->configEpoch = senderConfigEpoch;
-            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                 CLUSTER_TODO_FSYNC_CONFIG);
-        }
-        /* Update the replication offset info for this node. */
-        sender->repl_offset = ntohu64(hdr->offset);
-        sender->repl_offset_time = now;
-        /* If we are a slave performing a manual failover and our master
-         * sent its offset while already paused, populate the MF state. */
-        if (server.cluster->mf_end &&
-            nodeIsSlave(myself) &&
-            myself->slaveof == sender &&
-            hdr->mflags[0] & CLUSTERMSG_FLAG0_PAUSED &&
-            server.cluster->mf_master_offset == -1)
-        {
-            server.cluster->mf_master_offset = sender->repl_offset;
-            clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_MANUALFAILOVER);
-            serverLog(LL_WARNING,
-                "Received replication offset for paused "
-                "master manual failover: %lld",
-                server.cluster->mf_master_offset);
-        }
-    }
-
-    /* Initial processing of PING and MEET requests replying with a PONG. */
-    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_MEET) {
-        serverLog(LL_DEBUG,"Ping packet received: %p", (void*)link->node);
-
-        /* We use incoming MEET messages in order to set the address
-         * for 'myself', since only other cluster nodes will send us
-         * MEET messages on handshakes, when the cluster joins, or
-         * later if we changed address, and those nodes will use our
-         * official address to connect to us. So by obtaining this address
-         * from the socket is a simple way to discover / update our own
-         * address in the cluster without it being hardcoded in the config.
-         *
-         * However if we don't have an address at all, we update the address
-         * even with a normal PING packet. If it's wrong it will be fixed
-         * by MEET later. */
-        if ((type == CLUSTERMSG_TYPE_MEET || myself->ip[0] == '\0') &&
-            server.cluster_announce_ip == NULL)
-        {
-            char ip[NET_IP_STR_LEN];
-
-            if (connSockName(link->conn,ip,sizeof(ip),NULL) != -1 &&
-                strcmp(ip,myself->ip))
-            {
-                memcpy(myself->ip,ip,NET_IP_STR_LEN);
-                serverLog(LL_WARNING,"IP address for this node updated to %s",
-                    myself->ip);
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
-            }
-        }
-
-        /* Add this node if it is new for us and the msg type is MEET.
-         * In this stage we don't try to add the node with the right
-         * flags, slaveof pointer, and so forth, as this details will be
-         * resolved when we'll receive PONGs from the node. */
-        if (!sender && type == CLUSTERMSG_TYPE_MEET) {
-            clusterNode *node;
-
-            node = createClusterNode(NULL,CLUSTER_NODE_HANDSHAKE);
-            nodeIp2String(node->ip,link,hdr->myip);
-            node->port = ntohs(hdr->port);
-            node->pport = ntohs(hdr->pport);
-            node->cport = ntohs(hdr->cport);
-            clusterAddNode(node);
-            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
-        }
-
-        /* If this is a MEET packet from an unknown node, we still process
-         * the gossip section here since we have to trust the sender because
-         * of the message type. */
-        if (!sender && type == CLUSTERMSG_TYPE_MEET)
-            clusterProcessGossipSection(hdr,link);
-
-        /* Anyway reply with a PONG */
-        clusterSendPing(link,CLUSTERMSG_TYPE_PONG);
-    }
-
-    /* PING, PONG, MEET: process config information. */
-    if (type == CLUSTERMSG_TYPE_PING || type == CLUSTERMSG_TYPE_PONG ||
-        type == CLUSTERMSG_TYPE_MEET)
-    {
-        serverLog(LL_DEBUG,"%s packet received: %p",
-            type == CLUSTERMSG_TYPE_PING ? "ping" : "pong",
-            (void*)link->node);
-        if (link->node) {
-            if (nodeInHandshake(link->node)) {
-                /* If we already have this node, try to change the
-                 * IP/port of the node with the new one. */
-                if (sender) {
-                    serverLog(LL_VERBOSE,
-                        "Handshake: we already know node %.40s, "
-                        "updating the address if needed.", sender->name);
-                    if (nodeUpdateAddressIfNeeded(sender,link,hdr))
-                    {
-                        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                             CLUSTER_TODO_UPDATE_STATE);
-                    }
-                    /* Free this node as we already have it. This will
-                     * cause the link to be freed as well. */
-                    clusterDelNode(link->node);
-                    return 0;
-                }
-
-                /* First thing to do is replacing the random name with the
-                 * right node name if this was a handshake stage. */
-                clusterRenameNode(link->node, hdr->sender);
-                serverLog(LL_DEBUG,"Handshake with node %.40s completed.",
-                    link->node->name);
-                link->node->flags &= ~CLUSTER_NODE_HANDSHAKE;
-                link->node->flags |= flags&(CLUSTER_NODE_MASTER|CLUSTER_NODE_SLAVE);
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
-            } else if (memcmp(link->node->name,hdr->sender,
-                        CLUSTER_NAMELEN) != 0)
-            {
-                /* If the reply has a non matching node ID we
-                 * disconnect this node and set it as not having an associated
-                 * address. */
-                serverLog(LL_DEBUG,"PONG contains mismatching sender ID. About node %.40s added %d ms ago, having flags %d",
-                    link->node->name,
-                    (int)(now-(link->node->ctime)),
-                    link->node->flags);
-                link->node->flags |= CLUSTER_NODE_NOADDR;
-                link->node->ip[0] = '\0';
-                link->node->port = 0;
-                link->node->pport = 0;
-                link->node->cport = 0;
-                freeClusterLink(link);
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
-                return 0;
-            }
-        }
-
-        /* Copy the CLUSTER_NODE_NOFAILOVER flag from what the sender
-         * announced. This is a dynamic flag that we receive from the
-         * sender, and the latest status must be trusted. We need it to
-         * be propagated because the slave ranking used to understand the
-         * delay of each slave in the voting process, needs to know
-         * what are the instances really competing. */
-        if (sender) {
-            int nofailover = flags & CLUSTER_NODE_NOFAILOVER;
-            sender->flags &= ~CLUSTER_NODE_NOFAILOVER;
-            sender->flags |= nofailover;
-        }
-
-        /* Update the node address if it changed. */
-        if (sender && type == CLUSTERMSG_TYPE_PING &&
-            !nodeInHandshake(sender) &&
-            nodeUpdateAddressIfNeeded(sender,link,hdr))
-        {
-            clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                 CLUSTER_TODO_UPDATE_STATE);
-        }
-
-        /* Update our info about the node */
-        if (link->node && type == CLUSTERMSG_TYPE_PONG) {
-            link->node->pong_received = now;
-            link->node->ping_sent = 0;
-
-            /* The PFAIL condition can be reversed without external
-             * help if it is momentary (that is, if it does not
-             * turn into a FAIL state).
-             *
-             * The FAIL condition is also reversible under specific
-             * conditions detected by clearNodeFailureIfNeeded(). */
-            if (nodeTimedOut(link->node)) {
-                link->node->flags &= ~CLUSTER_NODE_PFAIL;
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                     CLUSTER_TODO_UPDATE_STATE);
-            } else if (nodeFailed(link->node)) {
-                clearNodeFailureIfNeeded(link->node);
-            }
-        }
-
-        /* Check for role switch: slave -> master or master -> slave. */
-        if (sender) {
-            if (!memcmp(hdr->slaveof,CLUSTER_NODE_NULL_NAME,
-                sizeof(hdr->slaveof)))
-            {
-                /* Node is a master. */
-                clusterSetNodeAsMaster(sender);
-            } else {
-                /* Node is a slave. */
-                clusterNode *master = clusterLookupNode(hdr->slaveof);
-
-                if (nodeIsMaster(sender)) {
-                    /* Master turned into a slave! Reconfigure the node. */
-                    clusterDelNodeSlots(sender);
-                    sender->flags &= ~(CLUSTER_NODE_MASTER|
-                                       CLUSTER_NODE_MIGRATE_TO);
-                    sender->flags |= CLUSTER_NODE_SLAVE;
-
-                    /* Update config and state. */
-                    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                         CLUSTER_TODO_UPDATE_STATE);
-                }
-
-                /* Master node changed for this slave? */
-                if (master && sender->slaveof != master) {
-                    if (sender->slaveof)
-                        clusterNodeRemoveSlave(sender->slaveof,sender);
-                    clusterNodeAddSlave(master,sender);
-                    sender->slaveof = master;
-
-                    /* Update config. */
-                    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG);
-                }
-            }
-        }
-
-        /* Update our info about served slots.
-         *
-         * Note: this MUST happen after we update the master/slave state
-         * so that CLUSTER_NODE_MASTER flag will be set. */
-
-        /* Many checks are only needed if the set of served slots this
-         * instance claims is different compared to the set of slots we have
-         * for it. Check this ASAP to avoid other computational expansive
-         * checks later. */
-        clusterNode *sender_master = NULL; /* Sender or its master if slave. */
-        int dirty_slots = 0; /* Sender claimed slots don't match my view? */
-
-        if (sender) {
-            sender_master = nodeIsMaster(sender) ? sender : sender->slaveof;
-            if (sender_master) {
-                dirty_slots = memcmp(sender_master->slots,
-                        hdr->myslots,sizeof(hdr->myslots)) != 0;
-            }
-        }
-
-        /* 1) If the sender of the message is a master, and we detected that
-         *    the set of slots it claims changed, scan the slots to see if we
-         *    need to update our configuration. */
-        if (sender && nodeIsMaster(sender) && dirty_slots)
-            clusterUpdateSlotsConfigWith(sender,senderConfigEpoch,hdr->myslots);
-
-        /* 2) We also check for the reverse condition, that is, the sender
-         *    claims to serve slots we know are served by a master with a
-         *    greater configEpoch. If this happens we inform the sender.
-         *
-         * This is useful because sometimes after a partition heals, a
-         * reappearing master may be the last one to claim a given set of
-         * hash slots, but with a configuration that other instances know to
-         * be deprecated. Example:
-         *
-         * A and B are master and slave for slots 1,2,3.
-         * A is partitioned away, B gets promoted.
-         * B is partitioned away, and A returns available.
-         *
-         * Usually B would PING A publishing its set of served slots and its
-         * configEpoch, but because of the partition B can't inform A of the
-         * new configuration, so other nodes that have an updated table must
-         * do it. In this way A will stop to act as a master (or can try to
-         * failover if there are the conditions to win the election). */
-        if (sender && dirty_slots) {
-            int j;
-
-            for (j = 0; j < CLUSTER_SLOTS; j++) {
-                if (bitmapTestBit(hdr->myslots,j)) {
-                    if (server.cluster->slots[j] == sender ||
-                        server.cluster->slots[j] == NULL) continue;
-                    if (server.cluster->slots[j]->configEpoch >
-                        senderConfigEpoch)
-                    {
-                        serverLog(LL_VERBOSE,
-                            "Node %.40s has old slots configuration, sending "
-                            "an UPDATE message about %.40s",
-                                sender->name, server.cluster->slots[j]->name);
-                        clusterSendUpdate(sender->link,
-                            server.cluster->slots[j]);
-
-                        /* TODO: instead of exiting the loop send every other
-                         * UPDATE packet for other nodes that are the new owner
-                         * of sender's slots. */
-                        break;
-                    }
-                }
-            }
-        }
-
-        /* If our config epoch collides with the sender's try to fix
-         * the problem. */
-        if (sender &&
-            nodeIsMaster(myself) && nodeIsMaster(sender) &&
-            senderConfigEpoch == myself->configEpoch)
-        {
-            clusterHandleConfigEpochCollision(sender);
-        }
-
-        /* Get info from the gossip section */
-        if (sender) clusterProcessGossipSection(hdr,link);
-    } else if (type == CLUSTERMSG_TYPE_FAIL) {
-        clusterNode *failing;
-
-        if (sender) {
-            failing = clusterLookupNode(hdr->data.fail.about.nodename);
-            if (failing &&
-                !(failing->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_MYSELF)))
-            {
-                serverLog(LL_NOTICE,
-                    "FAIL message received from %.40s about %.40s",
-                    hdr->sender, hdr->data.fail.about.nodename);
-                failing->flags |= CLUSTER_NODE_FAIL;
-                failing->fail_time = now;
-                failing->flags &= ~CLUSTER_NODE_PFAIL;
-                clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                                     CLUSTER_TODO_UPDATE_STATE);
-            }
-        } else {
-            serverLog(LL_NOTICE,
-                "Ignoring FAIL message from unknown node %.40s about %.40s",
-                hdr->sender, hdr->data.fail.about.nodename);
-        }
-    } else if (type == CLUSTERMSG_TYPE_PUBLISH) {
-        robj *channel, *message;
-        uint32_t channel_len, message_len;
-
-        /* Don't bother creating useless objects if there are no
-         * Pub/Sub subscribers. */
-        if (dictSize(server.pubsub_channels) ||
-           dictSize(server.pubsub_patterns))
-        {
-            channel_len = ntohl(hdr->data.publish.msg.channel_len);
-            message_len = ntohl(hdr->data.publish.msg.message_len);
-            channel = createStringObject(
-                        (char*)hdr->data.publish.msg.bulk_data,channel_len);
-            message = createStringObject(
-                        (char*)hdr->data.publish.msg.bulk_data+channel_len,
-                        message_len);
-            pubsubPublishMessage(channel,message);
-            decrRefCount(channel);
-            decrRefCount(message);
-        }
-    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST) {
-        if (!sender) return 1;  /* We don't know that node. */
-        clusterSendFailoverAuthIfNeeded(sender,hdr);
-    } else if (type == CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK) {
-        if (!sender) return 1;  /* We don't know that node. */
-        /* We consider this vote only if the sender is a master serving
-         * a non zero number of slots, and its currentEpoch is greater or
-         * equal to epoch where this node started the election. */
-        if (nodeIsMaster(sender) && sender->numslots > 0 &&
-            senderCurrentEpoch >= server.cluster->failover_auth_epoch)
-        {
-            server.cluster->failover_auth_count++;
-            /* Maybe we reached a quorum here, set a flag to make sure
-             * we check ASAP. */
-            clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
-        }
-    } else if (type == CLUSTERMSG_TYPE_MFSTART) {
-        /* This message is acceptable only if I'm a master and the sender
-         * is one of my slaves. */
-        if (!sender || sender->slaveof != myself) return 1;
-        /* Manual failover requested from slaves. Initialize the state
-         * accordingly. */
-        resetManualFailover();
-        server.cluster->mf_end = now + CLUSTER_MF_TIMEOUT;
-        server.cluster->mf_slave = sender;
-        pauseClients(now+(CLUSTER_MF_TIMEOUT*CLUSTER_MF_PAUSE_MULT),CLIENT_PAUSE_WRITE);
-        serverLog(LL_WARNING,"Manual failover requested by replica %.40s.",
-            sender->name);
-        /* We need to send a ping message to the replica, as it would carry
-         * `server.cluster->mf_master_offset`, which means the master paused clients
-         * at offset `server.cluster->mf_master_offset`, so that the replica would
-         * know that it is safe to set its `server.cluster->mf_can_start` to 1 so as
-         * to complete failover as quickly as possible. */
-        clusterSendPing(link, CLUSTERMSG_TYPE_PING);
-    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
-        clusterNode *n; /* The node the update is about. */
-        uint64_t reportedConfigEpoch =
-                    ntohu64(hdr->data.update.nodecfg.configEpoch);
-
-        if (!sender) return 1;  /* We don't know the sender. */
-        n = clusterLookupNode(hdr->data.update.nodecfg.nodename);
-        if (!n) return 1;   /* We don't know the reported node. */
-        if (n->configEpoch >= reportedConfigEpoch) return 1; /* Nothing new. */
-
-        /* If in our current config the node is a slave, set it as a master. */
-        if (nodeIsSlave(n)) clusterSetNodeAsMaster(n);
-
-        /* Update the node's configEpoch. */
-        n->configEpoch = reportedConfigEpoch;
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                             CLUSTER_TODO_FSYNC_CONFIG);
-
-        /* Check the bitmap of served slots and update our
-         * config accordingly. */
-        clusterUpdateSlotsConfigWith(n,reportedConfigEpoch,
-            hdr->data.update.nodecfg.slots);
-    } else if (type == CLUSTERMSG_TYPE_MODULE) {
-        if (!sender) return 1;  /* Protect the module from unknown nodes. */
-        /* We need to route this message back to the right module subscribed
-         * for the right message type. */
-        uint64_t module_id = hdr->data.module.msg.module_id; /* Endian-safe ID */
-        uint32_t len = ntohl(hdr->data.module.msg.len);
-        uint8_t type = hdr->data.module.msg.type;
-        unsigned char *payload = hdr->data.module.msg.bulk_data;
-        moduleCallClusterReceivers(sender->name,module_id,type,payload,len);
-    } else {
-        serverLog(LL_WARNING,"Received unknown packet type: %d", type);
-    }
-    return 1;
-}
-
-/* This function is called when we detect the link with this node is lost.
-   We set the node as no longer connected. The Cluster Cron will detect
-   this connection and will try to get it connected again.
-
-   Instead if the node is a temporary node used to accept a query, we
-   completely free the node on error. */
-void handleLinkIOError(clusterLink *link) {
-    freeClusterLink(link);
-}
-
-/* Send data. This is handled using a trivial send buffer that gets
- * consumed by write(). We don't try to optimize this for speed too much
- * as this is a very low traffic channel. */
-void clusterWriteHandler(connection *conn) {
-    clusterLink *link = connGetPrivateData(conn);
-    ssize_t nwritten;
-
-    nwritten = connWrite(conn, link->sndbuf, sdslen(link->sndbuf));
-    if (nwritten <= 0) {
-        serverLog(LL_DEBUG,"I/O error writing to node link: %s",
-            (nwritten == -1) ? connGetLastError(conn) : "short write");
-        handleLinkIOError(link);
-        return;
-    }
-    sdsrange(link->sndbuf,nwritten,-1);
-    if (sdslen(link->sndbuf) == 0)
-        connSetWriteHandler(link->conn, NULL);
-}
-
-/* A connect handler that gets called when a connection to another node
- * gets established.
- */
-void clusterLinkConnectHandler(connection *conn) {
-    clusterLink *link = connGetPrivateData(conn);
-    clusterNode *node = link->node;
-
-    /* Check if connection succeeded */
-    if (connGetState(conn) != CONN_STATE_CONNECTED) {
-        serverLog(LL_VERBOSE, "Connection with Node %.40s at %s:%d failed: %s",
-                node->name, node->ip, node->cport,
-                connGetLastError(conn));
-        freeClusterLink(link);
-        return;
-    }
-
-    /* Register a read handler from now on */
-    connSetReadHandler(conn, clusterReadHandler);
-
-    /* Queue a PING in the new connection ASAP: this is crucial
-     * to avoid false positives in failure detection.
-     *
-     * If the node is flagged as MEET, we send a MEET message instead
-     * of a PING one, to force the receiver to add us in its node
-     * table. */
-    mstime_t old_ping_sent = node->ping_sent;
-    clusterSendPing(link, node->flags & CLUSTER_NODE_MEET ?
-            CLUSTERMSG_TYPE_MEET : CLUSTERMSG_TYPE_PING);
-    if (old_ping_sent) {
-        /* If there was an active ping before the link was
-         * disconnected, we want to restore the ping time, otherwise
-         * replaced by the clusterSendPing() call. */
-        node->ping_sent = old_ping_sent;
-    }
-    /* We can clear the flag after the first packet is sent.
-     * If we'll never receive a PONG, we'll never send new packets
-     * to this node. Instead after the PONG is received and we
-     * are no longer in meet/handshake status, we want to send
-     * normal PING packets. */
-    node->flags &= ~CLUSTER_NODE_MEET;
-
-    serverLog(LL_DEBUG,"Connecting with Node %.40s at %s:%d",
-            node->name, node->ip, node->cport);
-}
-
-/* Read data. Try to read the first field of the header first to check the
- * full length of the packet. When a whole packet is in memory this function
- * will call the function to process the packet. And so forth. */
-void clusterReadHandler(connection *conn) {
-    clusterMsg buf[1];
-    ssize_t nread;
-    clusterMsg *hdr;
-    clusterLink *link = connGetPrivateData(conn);
-    unsigned int readlen, rcvbuflen;
-
-    while(1) { /* Read as long as there is data to read. */
-        rcvbuflen = link->rcvbuf_len;
-        if (rcvbuflen < 8) {
-            /* First, obtain the first 8 bytes to get the full message
-             * length. */
-            readlen = 8 - rcvbuflen;
-        } else {
-            /* Finally read the full message. */
-            hdr = (clusterMsg*) link->rcvbuf;
-            if (rcvbuflen == 8) {
-                /* Perform some sanity check on the message signature
-                 * and length. */
-                if (memcmp(hdr->sig,"RCmb",4) != 0 ||
-                    ntohl(hdr->totlen) < CLUSTERMSG_MIN_LEN)
-                {
-                    serverLog(LL_WARNING,
-                        "Bad message length or signature received "
-                        "from Cluster bus.");
-                    handleLinkIOError(link);
-                    return;
-                }
-            }
-            readlen = ntohl(hdr->totlen) - rcvbuflen;
-            if (readlen > sizeof(buf)) readlen = sizeof(buf);
-        }
-
-        nread = connRead(conn,buf,readlen);
-        if (nread == -1 && (connGetState(conn) == CONN_STATE_CONNECTED)) return; /* No more data ready. */
-
-        if (nread <= 0) {
-            /* I/O error... */
-            serverLog(LL_DEBUG,"I/O error reading from node link: %s",
-                (nread == 0) ? "connection closed" : connGetLastError(conn));
-            handleLinkIOError(link);
-            return;
-        } else {
-            /* Read data and recast the pointer to the new buffer. */
-            size_t unused = link->rcvbuf_alloc - link->rcvbuf_len;
-            if ((size_t)nread > unused) {
-                size_t required = link->rcvbuf_len + nread;
-                /* If less than 1mb, grow to twice the needed size, if larger grow by 1mb. */
-                link->rcvbuf_alloc = required < RCVBUF_MAX_PREALLOC ? required * 2: required + RCVBUF_MAX_PREALLOC;
-                link->rcvbuf = zrealloc(link->rcvbuf, link->rcvbuf_alloc);
-            }
-            memcpy(link->rcvbuf + link->rcvbuf_len, buf, nread);
-            link->rcvbuf_len += nread;
-            hdr = (clusterMsg*) link->rcvbuf;
-            rcvbuflen += nread;
-        }
-
-        /* Total length obtained? Process this packet. */
-        if (rcvbuflen >= 8 && rcvbuflen == ntohl(hdr->totlen)) {
-            if (clusterProcessPacket(link)) {
-                if (link->rcvbuf_alloc > RCVBUF_INIT_LEN) {
-                    zfree(link->rcvbuf);
-                    link->rcvbuf = zmalloc(link->rcvbuf_alloc = RCVBUF_INIT_LEN);
-                }
-                link->rcvbuf_len = 0;
-            } else {
-                return; /* Link no longer valid. */
-            }
-        }
-    }
-}
-
-/* Put stuff into the send buffer.
- *
- * It is guaranteed that this function will never have as a side effect
- * the link to be invalidated, so it is safe to call this function
- * from event handlers that will do stuff with the same link later. */
-void clusterSendMessage(clusterLink *link, unsigned char *msg, size_t msglen) {
-    if (sdslen(link->sndbuf) == 0 && msglen != 0)
-        connSetWriteHandlerWithBarrier(link->conn, clusterWriteHandler, 1);
-
-    link->sndbuf = sdscatlen(link->sndbuf, msg, msglen);
-
-    /* Populate sent messages stats. */
-    clusterMsg *hdr = (clusterMsg*) msg;
-    uint16_t type = ntohs(hdr->type);
-    if (type < CLUSTERMSG_TYPE_COUNT)
-        server.cluster->stats_bus_messages_sent[type]++;
-}
-
-/* Send a message to all the nodes that are part of the cluster having
- * a connected link.
- *
- * It is guaranteed that this function will never have as a side effect
- * some node->link to be invalidated, so it is safe to call this function
- * from event handlers that will do stuff with node links later. */
-void clusterBroadcastMessage(void *buf, size_t len) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (!node->link) continue;
-        if (node->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_HANDSHAKE))
-            continue;
-        clusterSendMessage(node->link,buf,len);
-    }
-    dictReleaseIterator(di);
-}
-
-/* Build the message header. hdr must point to a buffer at least
- * sizeof(clusterMsg) in bytes. */
-void clusterBuildMessageHdr(clusterMsg *hdr, int type) {
-    int totlen = 0;
-    uint64_t offset;
-    clusterNode *master;
-
-    /* If this node is a master, we send its slots bitmap and configEpoch.
-     * If this node is a slave we send the master's information instead (the
-     * node is flagged as slave so the receiver knows that it is NOT really
-     * in charge for this slots. */
-    master = (nodeIsSlave(myself) && myself->slaveof) ?
-              myself->slaveof : myself;
-
-    memset(hdr,0,sizeof(*hdr));
-    hdr->ver = htons(CLUSTER_PROTO_VER);
-    hdr->sig[0] = 'R';
-    hdr->sig[1] = 'C';
-    hdr->sig[2] = 'm';
-    hdr->sig[3] = 'b';
-    hdr->type = htons(type);
-    memcpy(hdr->sender,myself->name,CLUSTER_NAMELEN);
-
-    /* If cluster-announce-ip option is enabled, force the receivers of our
-     * packets to use the specified address for this node. Otherwise if the
-     * first byte is zero, they'll do auto discovery. */
-    memset(hdr->myip,0,NET_IP_STR_LEN);
-    if (server.cluster_announce_ip) {
-        strncpy(hdr->myip,server.cluster_announce_ip,NET_IP_STR_LEN);
-        hdr->myip[NET_IP_STR_LEN-1] = '\0';
-    }
-
-    /* Handle cluster-announce-[tls-|bus-]port. */
-    int announced_port, announced_pport, announced_cport;
-    deriveAnnouncedPorts(&announced_port, &announced_pport, &announced_cport);
-
-    memcpy(hdr->myslots,master->slots,sizeof(hdr->myslots));
-    memset(hdr->slaveof,0,CLUSTER_NAMELEN);
-    if (myself->slaveof != NULL)
-        memcpy(hdr->slaveof,myself->slaveof->name, CLUSTER_NAMELEN);
-    hdr->port = htons(announced_port);
-    hdr->pport = htons(announced_pport);
-    hdr->cport = htons(announced_cport);
-    hdr->flags = htons(myself->flags);
-    hdr->state = server.cluster->state;
-
-    /* Set the currentEpoch and configEpochs. */
-    hdr->currentEpoch = htonu64(server.cluster->currentEpoch);
-    hdr->configEpoch = htonu64(master->configEpoch);
-
-    /* Set the replication offset. */
-    if (nodeIsSlave(myself))
-        offset = replicationGetSlaveOffset();
-    else
-        offset = server.master_repl_offset;
-    hdr->offset = htonu64(offset);
-
-    /* Set the message flags. */
-    if (nodeIsMaster(myself) && server.cluster->mf_end)
-        hdr->mflags[0] |= CLUSTERMSG_FLAG0_PAUSED;
-
-    /* Compute the message length for certain messages. For other messages
-     * this is up to the caller. */
-    if (type == CLUSTERMSG_TYPE_FAIL) {
-        totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-        totlen += sizeof(clusterMsgDataFail);
-    } else if (type == CLUSTERMSG_TYPE_UPDATE) {
-        totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-        totlen += sizeof(clusterMsgDataUpdate);
-    }
-    hdr->totlen = htonl(totlen);
-    /* For PING, PONG, and MEET, fixing the totlen field is up to the caller. */
-}
-
-/* Return non zero if the node is already present in the gossip section of the
- * message pointed by 'hdr' and having 'count' gossip entries. Otherwise
- * zero is returned. Helper for clusterSendPing(). */
-int clusterNodeIsInGossipSection(clusterMsg *hdr, int count, clusterNode *n) {
-    int j;
-    for (j = 0; j < count; j++) {
-        if (memcmp(hdr->data.ping.gossip[j].nodename,n->name,
-                CLUSTER_NAMELEN) == 0) break;
-    }
-    return j != count;
-}
-
-/* Set the i-th entry of the gossip section in the message pointed by 'hdr'
- * to the info of the specified node 'n'. */
-void clusterSetGossipEntry(clusterMsg *hdr, int i, clusterNode *n) {
-    clusterMsgDataGossip *gossip;
-    gossip = &(hdr->data.ping.gossip[i]);
-    memcpy(gossip->nodename,n->name,CLUSTER_NAMELEN);
-    gossip->ping_sent = htonl(n->ping_sent/1000);
-    gossip->pong_received = htonl(n->pong_received/1000);
-    memcpy(gossip->ip,n->ip,sizeof(n->ip));
-    gossip->port = htons(n->port);
-    gossip->cport = htons(n->cport);
-    gossip->flags = htons(n->flags);
-    gossip->pport = htons(n->pport);
-    gossip->notused1 = 0;
-}
-
-/* Send a PING or PONG packet to the specified node, making sure to add enough
- * gossip information. */
-void clusterSendPing(clusterLink *link, int type) {
-    unsigned char *buf;
-    clusterMsg *hdr;
-    int gossipcount = 0; /* Number of gossip sections added so far. */
-    int wanted; /* Number of gossip sections we want to append if possible. */
-    int totlen; /* Total packet length. */
-    /* freshnodes is the max number of nodes we can hope to append at all:
-     * nodes available minus two (ourself and the node we are sending the
-     * message to). However practically there may be less valid nodes since
-     * nodes in handshake state, disconnected, are not considered. */
-    int freshnodes = dictSize(server.cluster->nodes)-2;
-
-    /* How many gossip sections we want to add? 1/10 of the number of nodes
-     * and anyway at least 3. Why 1/10?
-     *
-     * If we have N masters, with N/10 entries, and we consider that in
-     * node_timeout we exchange with each other node at least 4 packets
-     * (we ping in the worst case in node_timeout/2 time, and we also
-     * receive two pings from the host), we have a total of 8 packets
-     * in the node_timeout*2 failure reports validity time. So we have
-     * that, for a single PFAIL node, we can expect to receive the following
-     * number of failure reports (in the specified window of time):
-     *
-     * PROB * GOSSIP_ENTRIES_PER_PACKET * TOTAL_PACKETS:
-     *
-     * PROB = probability of being featured in a single gossip entry,
-     *        which is 1 / NUM_OF_NODES.
-     * ENTRIES = 10.
-     * TOTAL_PACKETS = 2 * 4 * NUM_OF_MASTERS.
-     *
-     * If we assume we have just masters (so num of nodes and num of masters
-     * is the same), with 1/10 we always get over the majority, and specifically
-     * 80% of the number of nodes, to account for many masters failing at the
-     * same time.
-     *
-     * Since we have non-voting slaves that lower the probability of an entry
-     * to feature our node, we set the number of entries per packet as
-     * 10% of the total nodes we have. */
-    wanted = floor(dictSize(server.cluster->nodes)/10);
-    if (wanted < 3) wanted = 3;
-    if (wanted > freshnodes) wanted = freshnodes;
-
-    /* Include all the nodes in PFAIL state, so that failure reports are
-     * faster to propagate to go from PFAIL to FAIL state. */
-    int pfail_wanted = server.cluster->stats_pfail_nodes;
-
-    /* Compute the maximum totlen to allocate our buffer. We'll fix the totlen
-     * later according to the number of gossip sections we really were able
-     * to put inside the packet. */
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    totlen += (sizeof(clusterMsgDataGossip)*(wanted+pfail_wanted));
-    /* Note: clusterBuildMessageHdr() expects the buffer to be always at least
-     * sizeof(clusterMsg) or more. */
-    if (totlen < (int)sizeof(clusterMsg)) totlen = sizeof(clusterMsg);
-    buf = zcalloc(totlen);
-    hdr = (clusterMsg*) buf;
-
-    /* Populate the header. */
-    if (link->node && type == CLUSTERMSG_TYPE_PING)
-        link->node->ping_sent = mstime();
-    clusterBuildMessageHdr(hdr,type);
-
-    /* Populate the gossip fields */
-    int maxiterations = wanted*3;
-    while(freshnodes > 0 && gossipcount < wanted && maxiterations--) {
-        dictEntry *de = dictGetRandomKey(server.cluster->nodes);
-        clusterNode *this = dictGetVal(de);
-
-        /* Don't include this node: the whole packet header is about us
-         * already, so we just gossip about other nodes. */
-        if (this == myself) continue;
-
-        /* PFAIL nodes will be added later. */
-        if (this->flags & CLUSTER_NODE_PFAIL) continue;
-
-        /* In the gossip section don't include:
-         * 1) Nodes in HANDSHAKE state.
-         * 3) Nodes with the NOADDR flag set.
-         * 4) Disconnected nodes if they don't have configured slots.
-         */
-        if (this->flags & (CLUSTER_NODE_HANDSHAKE|CLUSTER_NODE_NOADDR) ||
-            (this->link == NULL && this->numslots == 0))
-        {
-            freshnodes--; /* Technically not correct, but saves CPU. */
-            continue;
-        }
-
-        /* Do not add a node we already have. */
-        if (clusterNodeIsInGossipSection(hdr,gossipcount,this)) continue;
-
-        /* Add it */
-        clusterSetGossipEntry(hdr,gossipcount,this);
-        freshnodes--;
-        gossipcount++;
-    }
-
-    /* If there are PFAIL nodes, add them at the end. */
-    if (pfail_wanted) {
-        dictIterator *di;
-        dictEntry *de;
-
-        di = dictGetSafeIterator(server.cluster->nodes);
-        while((de = dictNext(di)) != NULL && pfail_wanted > 0) {
-            clusterNode *node = dictGetVal(de);
-            if (node->flags & CLUSTER_NODE_HANDSHAKE) continue;
-            if (node->flags & CLUSTER_NODE_NOADDR) continue;
-            if (!(node->flags & CLUSTER_NODE_PFAIL)) continue;
-            clusterSetGossipEntry(hdr,gossipcount,node);
-            freshnodes--;
-            gossipcount++;
-            /* We take the count of the slots we allocated, since the
-             * PFAIL stats may not match perfectly with the current number
-             * of PFAIL nodes. */
-            pfail_wanted--;
-        }
-        dictReleaseIterator(di);
-    }
-
-    /* Ready to send... fix the totlen fiend and queue the message in the
-     * output buffer. */
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    totlen += (sizeof(clusterMsgDataGossip)*gossipcount);
-    hdr->count = htons(gossipcount);
-    hdr->totlen = htonl(totlen);
-    clusterSendMessage(link,buf,totlen);
-    zfree(buf);
-}
-
-/* Send a PONG packet to every connected node that's not in handshake state
- * and for which we have a valid link.
- *
- * In Redis Cluster pongs are not used just for failure detection, but also
- * to carry important configuration information. So broadcasting a pong is
- * useful when something changes in the configuration and we want to make
- * the cluster aware ASAP (for instance after a slave promotion).
- *
- * The 'target' argument specifies the receiving instances using the
- * defines below:
- *
- * CLUSTER_BROADCAST_ALL -> All known instances.
- * CLUSTER_BROADCAST_LOCAL_SLAVES -> All slaves in my master-slaves ring.
- */
-#define CLUSTER_BROADCAST_ALL 0
-#define CLUSTER_BROADCAST_LOCAL_SLAVES 1
-void clusterBroadcastPong(int target) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (!node->link) continue;
-        if (node == myself || nodeInHandshake(node)) continue;
-        if (target == CLUSTER_BROADCAST_LOCAL_SLAVES) {
-            int local_slave =
-                nodeIsSlave(node) && node->slaveof &&
-                (node->slaveof == myself || node->slaveof == myself->slaveof);
-            if (!local_slave) continue;
-        }
-        clusterSendPing(node->link,CLUSTERMSG_TYPE_PONG);
-    }
-    dictReleaseIterator(di);
-}
-
-/* Send a PUBLISH message.
- *
- * If link is NULL, then the message is broadcasted to the whole cluster. */
-void clusterSendPublish(clusterLink *link, robj *channel, robj *message) {
-    unsigned char *payload;
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-    uint32_t totlen;
-    uint32_t channel_len, message_len;
-
-    channel = getDecodedObject(channel);
-    message = getDecodedObject(message);
-    channel_len = sdslen(channel->ptr);
-    message_len = sdslen(message->ptr);
-
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_PUBLISH);
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    totlen += sizeof(clusterMsgDataPublish) - 8 + channel_len + message_len;
-
-    hdr->data.publish.msg.channel_len = htonl(channel_len);
-    hdr->data.publish.msg.message_len = htonl(message_len);
-    hdr->totlen = htonl(totlen);
-
-    /* Try to use the local buffer if possible */
-    if (totlen < sizeof(buf)) {
-        payload = (unsigned char*)buf;
-    } else {
-        payload = zmalloc(totlen);
-        memcpy(payload,hdr,sizeof(*hdr));
-        hdr = (clusterMsg*) payload;
-    }
-    memcpy(hdr->data.publish.msg.bulk_data,channel->ptr,sdslen(channel->ptr));
-    memcpy(hdr->data.publish.msg.bulk_data+sdslen(channel->ptr),
-        message->ptr,sdslen(message->ptr));
-
-    if (link)
-        clusterSendMessage(link,payload,totlen);
-    else
-        clusterBroadcastMessage(payload,totlen);
-
-    decrRefCount(channel);
-    decrRefCount(message);
-    if (payload != (unsigned char*)buf) zfree(payload);
-}
-
-/* Send a FAIL message to all the nodes we are able to contact.
- * The FAIL message is sent when we detect that a node is failing
- * (CLUSTER_NODE_PFAIL) and we also receive a gossip confirmation of this:
- * we switch the node state to CLUSTER_NODE_FAIL and ask all the other
- * nodes to do the same ASAP. */
-void clusterSendFail(char *nodename) {
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAIL);
-    memcpy(hdr->data.fail.about.nodename,nodename,CLUSTER_NAMELEN);
-    clusterBroadcastMessage(buf,ntohl(hdr->totlen));
-}
-
-/* Send an UPDATE message to the specified link carrying the specified 'node'
- * slots configuration. The node name, slots bitmap, and configEpoch info
- * are included. */
-void clusterSendUpdate(clusterLink *link, clusterNode *node) {
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-
-    if (link == NULL) return;
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_UPDATE);
-    memcpy(hdr->data.update.nodecfg.nodename,node->name,CLUSTER_NAMELEN);
-    hdr->data.update.nodecfg.configEpoch = htonu64(node->configEpoch);
-    memcpy(hdr->data.update.nodecfg.slots,node->slots,sizeof(node->slots));
-    clusterSendMessage(link,(unsigned char*)buf,ntohl(hdr->totlen));
-}
-
-/* Send a MODULE message.
- *
- * If link is NULL, then the message is broadcasted to the whole cluster. */
-void clusterSendModule(clusterLink *link, uint64_t module_id, uint8_t type,
-                       unsigned char *payload, uint32_t len) {
-    unsigned char *heapbuf;
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-    uint32_t totlen;
-
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_MODULE);
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    totlen += sizeof(clusterMsgModule) - 3 + len;
-
-    hdr->data.module.msg.module_id = module_id; /* Already endian adjusted. */
-    hdr->data.module.msg.type = type;
-    hdr->data.module.msg.len = htonl(len);
-    hdr->totlen = htonl(totlen);
-
-    /* Try to use the local buffer if possible */
-    if (totlen < sizeof(buf)) {
-        heapbuf = (unsigned char*)buf;
-    } else {
-        heapbuf = zmalloc(totlen);
-        memcpy(heapbuf,hdr,sizeof(*hdr));
-        hdr = (clusterMsg*) heapbuf;
-    }
-    memcpy(hdr->data.module.msg.bulk_data,payload,len);
-
-    if (link)
-        clusterSendMessage(link,heapbuf,totlen);
-    else
-        clusterBroadcastMessage(heapbuf,totlen);
-
-    if (heapbuf != (unsigned char*)buf) zfree(heapbuf);
-}
-
-/* This function gets a cluster node ID string as target, the same way the nodes
- * addresses are represented in the modules side, resolves the node, and sends
- * the message. If the target is NULL the message is broadcasted.
- *
- * The function returns C_OK if the target is valid, otherwise C_ERR is
- * returned. */
-int clusterSendModuleMessageToTarget(const char *target, uint64_t module_id, uint8_t type, unsigned char *payload, uint32_t len) {
-    clusterNode *node = NULL;
-
-    if (target != NULL) {
-        node = clusterLookupNode(target);
-        if (node == NULL || node->link == NULL) return C_ERR;
-    }
-
-    clusterSendModule(target ? node->link : NULL,
-                      module_id, type, payload, len);
-    return C_OK;
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER Pub/Sub support
- *
- * For now we do very little, just propagating PUBLISH messages across the whole
- * cluster. In the future we'll try to get smarter and avoiding propagating those
- * messages to hosts without receives for a given channel.
- * -------------------------------------------------------------------------- */
-void clusterPropagatePublish(robj *channel, robj *message) {
-    clusterSendPublish(NULL, channel, message);
-}
-
-/* -----------------------------------------------------------------------------
- * SLAVE node specific functions
- * -------------------------------------------------------------------------- */
-
-/* This function sends a FAILOVER_AUTH_REQUEST message to every node in order to
- * see if there is the quorum for this slave instance to failover its failing
- * master.
- *
- * Note that we send the failover request to everybody, master and slave nodes,
- * but only the masters are supposed to reply to our query. */
-void clusterRequestFailoverAuth(void) {
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-    uint32_t totlen;
-
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST);
-    /* If this is a manual failover, set the CLUSTERMSG_FLAG0_FORCEACK bit
-     * in the header to communicate the nodes receiving the message that
-     * they should authorized the failover even if the master is working. */
-    if (server.cluster->mf_end) hdr->mflags[0] |= CLUSTERMSG_FLAG0_FORCEACK;
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    hdr->totlen = htonl(totlen);
-    clusterBroadcastMessage(buf,totlen);
-}
-
-/* Send a FAILOVER_AUTH_ACK message to the specified node. */
-void clusterSendFailoverAuth(clusterNode *node) {
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-    uint32_t totlen;
-
-    if (!node->link) return;
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK);
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    hdr->totlen = htonl(totlen);
-    clusterSendMessage(node->link,(unsigned char*)buf,totlen);
-}
-
-/* Send a MFSTART message to the specified node. */
-void clusterSendMFStart(clusterNode *node) {
-    clusterMsg buf[1];
-    clusterMsg *hdr = (clusterMsg*) buf;
-    uint32_t totlen;
-
-    if (!node->link) return;
-    clusterBuildMessageHdr(hdr,CLUSTERMSG_TYPE_MFSTART);
-    totlen = sizeof(clusterMsg)-sizeof(union clusterMsgData);
-    hdr->totlen = htonl(totlen);
-    clusterSendMessage(node->link,(unsigned char*)buf,totlen);
-}
-
-/* Vote for the node asking for our vote if there are the conditions. */
-void clusterSendFailoverAuthIfNeeded(clusterNode *node, clusterMsg *request) {
-    clusterNode *master = node->slaveof;
-    uint64_t requestCurrentEpoch = ntohu64(request->currentEpoch);
-    uint64_t requestConfigEpoch = ntohu64(request->configEpoch);
-    unsigned char *claimed_slots = request->myslots;
-    int force_ack = request->mflags[0] & CLUSTERMSG_FLAG0_FORCEACK;
-    int j;
-
-    /* IF we are not a master serving at least 1 slot, we don't have the
-     * right to vote, as the cluster size in Redis Cluster is the number
-     * of masters serving at least one slot, and quorum is the cluster
-     * size + 1 */
-    if (nodeIsSlave(myself) || myself->numslots == 0) return;
-
-    /* Request epoch must be >= our currentEpoch.
-     * Note that it is impossible for it to actually be greater since
-     * our currentEpoch was updated as a side effect of receiving this
-     * request, if the request epoch was greater. */
-    if (requestCurrentEpoch < server.cluster->currentEpoch) {
-        serverLog(LL_WARNING,
-            "Failover auth denied to %.40s: reqEpoch (%llu) < curEpoch(%llu)",
-            node->name,
-            (unsigned long long) requestCurrentEpoch,
-            (unsigned long long) server.cluster->currentEpoch);
-        return;
-    }
-
-    /* I already voted for this epoch? Return ASAP. */
-    if (server.cluster->lastVoteEpoch == server.cluster->currentEpoch) {
-        serverLog(LL_WARNING,
-                "Failover auth denied to %.40s: already voted for epoch %llu",
-                node->name,
-                (unsigned long long) server.cluster->currentEpoch);
-        return;
-    }
-
-    /* Node must be a slave and its master down.
-     * The master can be non failing if the request is flagged
-     * with CLUSTERMSG_FLAG0_FORCEACK (manual failover). */
-    if (nodeIsMaster(node) || master == NULL ||
-        (!nodeFailed(master) && !force_ack))
-    {
-        if (nodeIsMaster(node)) {
-            serverLog(LL_WARNING,
-                    "Failover auth denied to %.40s: it is a master node",
-                    node->name);
-        } else if (master == NULL) {
-            serverLog(LL_WARNING,
-                    "Failover auth denied to %.40s: I don't know its master",
-                    node->name);
-        } else if (!nodeFailed(master)) {
-            serverLog(LL_WARNING,
-                    "Failover auth denied to %.40s: its master is up",
-                    node->name);
-        }
-        return;
-    }
-
-    /* We did not voted for a slave about this master for two
-     * times the node timeout. This is not strictly needed for correctness
-     * of the algorithm but makes the base case more linear. */
-    if (mstime() - node->slaveof->voted_time < server.cluster_node_timeout * 2)
-    {
-        serverLog(LL_WARNING,
-                "Failover auth denied to %.40s: "
-                "can't vote about this master before %lld milliseconds",
-                node->name,
-                (long long) ((server.cluster_node_timeout*2)-
-                             (mstime() - node->slaveof->voted_time)));
-        return;
-    }
-
-    /* The slave requesting the vote must have a configEpoch for the claimed
-     * slots that is >= the one of the masters currently serving the same
-     * slots in the current configuration. */
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (bitmapTestBit(claimed_slots, j) == 0) continue;
-        if (server.cluster->slots[j] == NULL ||
-            server.cluster->slots[j]->configEpoch <= requestConfigEpoch)
-        {
-            continue;
-        }
-        /* If we reached this point we found a slot that in our current slots
-         * is served by a master with a greater configEpoch than the one claimed
-         * by the slave requesting our vote. Refuse to vote for this slave. */
-        serverLog(LL_WARNING,
-                "Failover auth denied to %.40s: "
-                "slot %d epoch (%llu) > reqEpoch (%llu)",
-                node->name, j,
-                (unsigned long long) server.cluster->slots[j]->configEpoch,
-                (unsigned long long) requestConfigEpoch);
-        return;
-    }
-
-    /* We can vote for this slave. */
-    server.cluster->lastVoteEpoch = server.cluster->currentEpoch;
-    node->slaveof->voted_time = mstime();
-    clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|CLUSTER_TODO_FSYNC_CONFIG);
-    clusterSendFailoverAuth(node);
-    serverLog(LL_WARNING, "Failover auth granted to %.40s for epoch %llu",
-        node->name, (unsigned long long) server.cluster->currentEpoch);
-}
-
-/* This function returns the "rank" of this instance, a slave, in the context
- * of its master-slaves ring. The rank of the slave is given by the number of
- * other slaves for the same master that have a better replication offset
- * compared to the local one (better means, greater, so they claim more data).
- *
- * A slave with rank 0 is the one with the greatest (most up to date)
- * replication offset, and so forth. Note that because how the rank is computed
- * multiple slaves may have the same rank, in case they have the same offset.
- *
- * The slave rank is used to add a delay to start an election in order to
- * get voted and replace a failing master. Slaves with better replication
- * offsets are more likely to win. */
-int clusterGetSlaveRank(void) {
-    long long myoffset;
-    int j, rank = 0;
-    clusterNode *master;
-
-    serverAssert(nodeIsSlave(myself));
-    master = myself->slaveof;
-    if (master == NULL) return 0; /* Never called by slaves without master. */
-
-    myoffset = replicationGetSlaveOffset();
-    for (j = 0; j < master->numslaves; j++)
-        if (master->slaves[j] != myself &&
-            !nodeCantFailover(master->slaves[j]) &&
-            master->slaves[j]->repl_offset > myoffset) rank++;
-    return rank;
-}
-
-/* This function is called by clusterHandleSlaveFailover() in order to
- * let the slave log why it is not able to failover. Sometimes there are
- * not the conditions, but since the failover function is called again and
- * again, we can't log the same things continuously.
- *
- * This function works by logging only if a given set of conditions are
- * true:
- *
- * 1) The reason for which the failover can't be initiated changed.
- *    The reasons also include a NONE reason we reset the state to
- *    when the slave finds that its master is fine (no FAIL flag).
- * 2) Also, the log is emitted again if the master is still down and
- *    the reason for not failing over is still the same, but more than
- *    CLUSTER_CANT_FAILOVER_RELOG_PERIOD seconds elapsed.
- * 3) Finally, the function only logs if the slave is down for more than
- *    five seconds + NODE_TIMEOUT. This way nothing is logged when a
- *    failover starts in a reasonable time.
- *
- * The function is called with the reason why the slave can't failover
- * which is one of the integer macros CLUSTER_CANT_FAILOVER_*.
- *
- * The function is guaranteed to be called only if 'myself' is a slave. */
-void clusterLogCantFailover(int reason) {
-    char *msg;
-    static time_t lastlog_time = 0;
-    mstime_t nolog_fail_time = server.cluster_node_timeout + 5000;
-
-    /* Don't log if we have the same reason for some time. */
-    if (reason == server.cluster->cant_failover_reason &&
-        time(NULL)-lastlog_time < CLUSTER_CANT_FAILOVER_RELOG_PERIOD)
-        return;
-
-    server.cluster->cant_failover_reason = reason;
-
-    /* We also don't emit any log if the master failed no long ago, the
-     * goal of this function is to log slaves in a stalled condition for
-     * a long time. */
-    if (myself->slaveof &&
-        nodeFailed(myself->slaveof) &&
-        (mstime() - myself->slaveof->fail_time) < nolog_fail_time) return;
-
-    switch(reason) {
-    case CLUSTER_CANT_FAILOVER_DATA_AGE:
-        msg = "Disconnected from master for longer than allowed. "
-              "Please check the 'cluster-replica-validity-factor' configuration "
-              "option.";
-        break;
-    case CLUSTER_CANT_FAILOVER_WAITING_DELAY:
-        msg = "Waiting the delay before I can start a new failover.";
-        break;
-    case CLUSTER_CANT_FAILOVER_EXPIRED:
-        msg = "Failover attempt expired.";
-        break;
-    case CLUSTER_CANT_FAILOVER_WAITING_VOTES:
-        msg = "Waiting for votes, but majority still not reached.";
-        break;
-    default:
-        msg = "Unknown reason code.";
-        break;
-    }
-    lastlog_time = time(NULL);
-    serverLog(LL_WARNING,"Currently unable to failover: %s", msg);
-}
-
-/* This function implements the final part of automatic and manual failovers,
- * where the slave grabs its master's hash slots, and propagates the new
- * configuration.
- *
- * Note that it's up to the caller to be sure that the node got a new
- * configuration epoch already. */
-void clusterFailoverReplaceYourMaster(void) {
-    int j;
-    clusterNode *oldmaster = myself->slaveof;
-
-    if (nodeIsMaster(myself) || oldmaster == NULL) return;
-
-    /* 1) Turn this node into a master. */
-    clusterSetNodeAsMaster(myself);
-    replicationUnsetMaster();
-
-    /* 2) Claim all the slots assigned to our master. */
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (clusterNodeGetSlotBit(oldmaster,j)) {
-            clusterDelSlot(j);
-            clusterAddSlot(myself,j);
-        }
-    }
-
-    /* 3) Update state and save config. */
-    clusterUpdateState();
-    clusterSaveConfigOrDie(1);
-
-    /* 4) Pong all the other nodes so that they can update the state
-     *    accordingly and detect that we switched to master role. */
-    clusterBroadcastPong(CLUSTER_BROADCAST_ALL);
-
-    /* 5) If there was a manual failover in progress, clear the state. */
-    resetManualFailover();
-}
-
-/* This function is called if we are a slave node and our master serving
- * a non-zero amount of hash slots is in FAIL state.
- *
- * The goal of this function is:
- * 1) To check if we are able to perform a failover, is our data updated?
- * 2) Try to get elected by masters.
- * 3) Perform the failover informing all the other nodes.
- */
-void clusterHandleSlaveFailover(void) {
-    mstime_t data_age;
-    mstime_t auth_age = mstime() - server.cluster->failover_auth_time;
-    int needed_quorum = (server.cluster->size / 2) + 1;
-    int manual_failover = server.cluster->mf_end != 0 &&
-                          server.cluster->mf_can_start;
-    mstime_t auth_timeout, auth_retry_time;
-
-    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_HANDLE_FAILOVER;
-
-    /* Compute the failover timeout (the max time we have to send votes
-     * and wait for replies), and the failover retry time (the time to wait
-     * before trying to get voted again).
-     *
-     * Timeout is MAX(NODE_TIMEOUT*2,2000) milliseconds.
-     * Retry is two times the Timeout.
-     */
-    auth_timeout = server.cluster_node_timeout*2;
-    if (auth_timeout < 2000) auth_timeout = 2000;
-    auth_retry_time = auth_timeout*2;
-
-    /* Pre conditions to run the function, that must be met both in case
-     * of an automatic or manual failover:
-     * 1) We are a slave.
-     * 2) Our master is flagged as FAIL, or this is a manual failover.
-     * 3) We don't have the no failover configuration set, and this is
-     *    not a manual failover.
-     * 4) It is serving slots. */
-    if (nodeIsMaster(myself) ||
-        myself->slaveof == NULL ||
-        (!nodeFailed(myself->slaveof) && !manual_failover) ||
-        (server.cluster_slave_no_failover && !manual_failover) ||
-        myself->slaveof->numslots == 0)
-    {
-        /* There are no reasons to failover, so we set the reason why we
-         * are returning without failing over to NONE. */
-        server.cluster->cant_failover_reason = CLUSTER_CANT_FAILOVER_NONE;
-        return;
-    }
-
-    /* Set data_age to the number of milliseconds we are disconnected from
-     * the master. */
-    if (server.repl_state == REPL_STATE_CONNECTED) {
-        data_age = (mstime_t)(server.unixtime - server.master->lastinteraction)
-                   * 1000;
-    } else {
-        data_age = (mstime_t)(server.unixtime - server.repl_down_since) * 1000;
-    }
-
-    /* Remove the node timeout from the data age as it is fine that we are
-     * disconnected from our master at least for the time it was down to be
-     * flagged as FAIL, that's the baseline. */
-    if (data_age > server.cluster_node_timeout)
-        data_age -= server.cluster_node_timeout;
-
-    /* Check if our data is recent enough according to the slave validity
-     * factor configured by the user.
-     *
-     * Check bypassed for manual failovers. */
-    if (server.cluster_slave_validity_factor &&
-        data_age >
-        (((mstime_t)server.repl_ping_slave_period * 1000) +
-         (server.cluster_node_timeout * server.cluster_slave_validity_factor)))
-    {
-        if (!manual_failover) {
-            clusterLogCantFailover(CLUSTER_CANT_FAILOVER_DATA_AGE);
-            return;
-        }
-    }
-
-    /* If the previous failover attempt timeout and the retry time has
-     * elapsed, we can setup a new one. */
-    if (auth_age > auth_retry_time) {
-        server.cluster->failover_auth_time = mstime() +
-            500 + /* Fixed delay of 500 milliseconds, let FAIL msg propagate. */
-            random() % 500; /* Random delay between 0 and 500 milliseconds. */
-        server.cluster->failover_auth_count = 0;
-        server.cluster->failover_auth_sent = 0;
-        server.cluster->failover_auth_rank = clusterGetSlaveRank();
-        /* We add another delay that is proportional to the slave rank.
-         * Specifically 1 second * rank. This way slaves that have a probably
-         * less updated replication offset, are penalized. */
-        server.cluster->failover_auth_time +=
-            server.cluster->failover_auth_rank * 1000;
-        /* However if this is a manual failover, no delay is needed. */
-        if (server.cluster->mf_end) {
-            server.cluster->failover_auth_time = mstime();
-            server.cluster->failover_auth_rank = 0;
-	    clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
-        }
-        serverLog(LL_WARNING,
-            "Start of election delayed for %lld milliseconds "
-            "(rank #%d, offset %lld).",
-            server.cluster->failover_auth_time - mstime(),
-            server.cluster->failover_auth_rank,
-            replicationGetSlaveOffset());
-        /* Now that we have a scheduled election, broadcast our offset
-         * to all the other slaves so that they'll updated their offsets
-         * if our offset is better. */
-        clusterBroadcastPong(CLUSTER_BROADCAST_LOCAL_SLAVES);
-        return;
-    }
-
-    /* It is possible that we received more updated offsets from other
-     * slaves for the same master since we computed our election delay.
-     * Update the delay if our rank changed.
-     *
-     * Not performed if this is a manual failover. */
-    if (server.cluster->failover_auth_sent == 0 &&
-        server.cluster->mf_end == 0)
-    {
-        int newrank = clusterGetSlaveRank();
-        if (newrank > server.cluster->failover_auth_rank) {
-            long long added_delay =
-                (newrank - server.cluster->failover_auth_rank) * 1000;
-            server.cluster->failover_auth_time += added_delay;
-            server.cluster->failover_auth_rank = newrank;
-            serverLog(LL_WARNING,
-                "Replica rank updated to #%d, added %lld milliseconds of delay.",
-                newrank, added_delay);
-        }
-    }
-
-    /* Return ASAP if we can't still start the election. */
-    if (mstime() < server.cluster->failover_auth_time) {
-        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_WAITING_DELAY);
-        return;
-    }
-
-    /* Return ASAP if the election is too old to be valid. */
-    if (auth_age > auth_timeout) {
-        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_EXPIRED);
-        return;
-    }
-
-    /* Ask for votes if needed. */
-    if (server.cluster->failover_auth_sent == 0) {
-        server.cluster->currentEpoch++;
-        server.cluster->failover_auth_epoch = server.cluster->currentEpoch;
-        serverLog(LL_WARNING,"Starting a failover election for epoch %llu.",
-            (unsigned long long) server.cluster->currentEpoch);
-        clusterRequestFailoverAuth();
-        server.cluster->failover_auth_sent = 1;
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|
-                             CLUSTER_TODO_UPDATE_STATE|
-                             CLUSTER_TODO_FSYNC_CONFIG);
-        return; /* Wait for replies. */
-    }
-
-    /* Check if we reached the quorum. */
-    if (server.cluster->failover_auth_count >= needed_quorum) {
-        /* We have the quorum, we can finally failover the master. */
-
-        serverLog(LL_WARNING,
-            "Failover election won: I'm the new master.");
-
-        /* Update my configEpoch to the epoch of the election. */
-        if (myself->configEpoch < server.cluster->failover_auth_epoch) {
-            myself->configEpoch = server.cluster->failover_auth_epoch;
-            serverLog(LL_WARNING,
-                "configEpoch set to %llu after successful failover",
-                (unsigned long long) myself->configEpoch);
-        }
-
-        /* Take responsibility for the cluster slots. */
-        clusterFailoverReplaceYourMaster();
-    } else {
-        clusterLogCantFailover(CLUSTER_CANT_FAILOVER_WAITING_VOTES);
-    }
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER slave migration
- *
- * Slave migration is the process that allows a slave of a master that is
- * already covered by at least another slave, to "migrate" to a master that
- * is orphaned, that is, left with no working slaves.
- * ------------------------------------------------------------------------- */
-
-/* This function is responsible to decide if this replica should be migrated
- * to a different (orphaned) master. It is called by the clusterCron() function
- * only if:
- *
- * 1) We are a slave node.
- * 2) It was detected that there is at least one orphaned master in
- *    the cluster.
- * 3) We are a slave of one of the masters with the greatest number of
- *    slaves.
- *
- * This checks are performed by the caller since it requires to iterate
- * the nodes anyway, so we spend time into clusterHandleSlaveMigration()
- * if definitely needed.
- *
- * The function is called with a pre-computed max_slaves, that is the max
- * number of working (not in FAIL state) slaves for a single master.
- *
- * Additional conditions for migration are examined inside the function.
- */
-void clusterHandleSlaveMigration(int max_slaves) {
-    int j, okslaves = 0;
-    clusterNode *mymaster = myself->slaveof, *target = NULL, *candidate = NULL;
-    dictIterator *di;
-    dictEntry *de;
-
-    /* Step 1: Don't migrate if the cluster state is not ok. */
-    if (server.cluster->state != CLUSTER_OK) return;
-
-    /* Step 2: Don't migrate if my master will not be left with at least
-     *         'migration-barrier' slaves after my migration. */
-    if (mymaster == NULL) return;
-    for (j = 0; j < mymaster->numslaves; j++)
-        if (!nodeFailed(mymaster->slaves[j]) &&
-            !nodeTimedOut(mymaster->slaves[j])) okslaves++;
-    if (okslaves <= server.cluster_migration_barrier) return;
-
-    /* Step 3: Identify a candidate for migration, and check if among the
-     * masters with the greatest number of ok slaves, I'm the one with the
-     * smallest node ID (the "candidate slave").
-     *
-     * Note: this means that eventually a replica migration will occur
-     * since slaves that are reachable again always have their FAIL flag
-     * cleared, so eventually there must be a candidate. At the same time
-     * this does not mean that there are no race conditions possible (two
-     * slaves migrating at the same time), but this is unlikely to
-     * happen, and harmless when happens. */
-    candidate = myself;
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-        int okslaves = 0, is_orphaned = 1;
-
-        /* We want to migrate only if this master is working, orphaned, and
-         * used to have slaves or if failed over a master that had slaves
-         * (MIGRATE_TO flag). This way we only migrate to instances that were
-         * supposed to have replicas. */
-        if (nodeIsSlave(node) || nodeFailed(node)) is_orphaned = 0;
-        if (!(node->flags & CLUSTER_NODE_MIGRATE_TO)) is_orphaned = 0;
-
-        /* Check number of working slaves. */
-        if (nodeIsMaster(node)) okslaves = clusterCountNonFailingSlaves(node);
-        if (okslaves > 0) is_orphaned = 0;
-
-        if (is_orphaned) {
-            if (!target && node->numslots > 0) target = node;
-
-            /* Track the starting time of the orphaned condition for this
-             * master. */
-            if (!node->orphaned_time) node->orphaned_time = mstime();
-        } else {
-            node->orphaned_time = 0;
-        }
-
-        /* Check if I'm the slave candidate for the migration: attached
-         * to a master with the maximum number of slaves and with the smallest
-         * node ID. */
-        if (okslaves == max_slaves) {
-            for (j = 0; j < node->numslaves; j++) {
-                if (memcmp(node->slaves[j]->name,
-                           candidate->name,
-                           CLUSTER_NAMELEN) < 0)
-                {
-                    candidate = node->slaves[j];
-                }
-            }
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Step 4: perform the migration if there is a target, and if I'm the
-     * candidate, but only if the master is continuously orphaned for a
-     * couple of seconds, so that during failovers, we give some time to
-     * the natural slaves of this instance to advertise their switch from
-     * the old master to the new one. */
-    if (target && candidate == myself &&
-        (mstime()-target->orphaned_time) > CLUSTER_SLAVE_MIGRATION_DELAY &&
-       !(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
-    {
-        serverLog(LL_WARNING,"Migrating to orphaned master %.40s",
-            target->name);
-        clusterSetMaster(target);
-    }
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER manual failover
- *
- * This are the important steps performed by slaves during a manual failover:
- * 1) User send CLUSTER FAILOVER command. The failover state is initialized
- *    setting mf_end to the millisecond unix time at which we'll abort the
- *    attempt.
- * 2) Slave sends a MFSTART message to the master requesting to pause clients
- *    for two times the manual failover timeout CLUSTER_MF_TIMEOUT.
- *    When master is paused for manual failover, it also starts to flag
- *    packets with CLUSTERMSG_FLAG0_PAUSED.
- * 3) Slave waits for master to send its replication offset flagged as PAUSED.
- * 4) If slave received the offset from the master, and its offset matches,
- *    mf_can_start is set to 1, and clusterHandleSlaveFailover() will perform
- *    the failover as usually, with the difference that the vote request
- *    will be modified to force masters to vote for a slave that has a
- *    working master.
- *
- * From the point of view of the master things are simpler: when a
- * PAUSE_CLIENTS packet is received the master sets mf_end as well and
- * the sender in mf_slave. During the time limit for the manual failover
- * the master will just send PINGs more often to this slave, flagged with
- * the PAUSED flag, so that the slave will set mf_master_offset when receiving
- * a packet from the master with this flag set.
- *
- * The gaol of the manual failover is to perform a fast failover without
- * data loss due to the asynchronous master-slave replication.
- * -------------------------------------------------------------------------- */
-
-/* Reset the manual failover state. This works for both masters and slaves
- * as all the state about manual failover is cleared.
- *
- * The function can be used both to initialize the manual failover state at
- * startup or to abort a manual failover in progress. */
-void resetManualFailover(void) {
-    if (server.cluster->mf_end) {
-        checkClientPauseTimeoutAndReturnIfPaused();
-    }
-    server.cluster->mf_end = 0; /* No manual failover in progress. */
-    server.cluster->mf_can_start = 0;
-    server.cluster->mf_slave = NULL;
-    server.cluster->mf_master_offset = -1;
-}
-
-/* If a manual failover timed out, abort it. */
-void manualFailoverCheckTimeout(void) {
-    if (server.cluster->mf_end && server.cluster->mf_end < mstime()) {
-        serverLog(LL_WARNING,"Manual failover timed out.");
-        resetManualFailover();
-    }
-}
-
-/* This function is called from the cluster cron function in order to go
- * forward with a manual failover state machine. */
-void clusterHandleManualFailover(void) {
-    /* Return ASAP if no manual failover is in progress. */
-    if (server.cluster->mf_end == 0) return;
-
-    /* If mf_can_start is non-zero, the failover was already triggered so the
-     * next steps are performed by clusterHandleSlaveFailover(). */
-    if (server.cluster->mf_can_start) return;
-
-    if (server.cluster->mf_master_offset == -1) return; /* Wait for offset... */
-
-    if (server.cluster->mf_master_offset == replicationGetSlaveOffset()) {
-        /* Our replication offset matches the master replication offset
-         * announced after clients were paused. We can start the failover. */
-        server.cluster->mf_can_start = 1;
-        serverLog(LL_WARNING,
-            "All master replication stream processed, "
-            "manual failover can start.");
-        clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_FAILOVER);
-        return;
-    }
-    clusterDoBeforeSleep(CLUSTER_TODO_HANDLE_MANUALFAILOVER);
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER cron job
- * -------------------------------------------------------------------------- */
-
-/* This is executed 10 times every second */
-void clusterCron(void) {
-    dictIterator *di;
-    dictEntry *de;
-    int update_state = 0;
-    int orphaned_masters; /* How many masters there are without ok slaves. */
-    int max_slaves; /* Max number of ok slaves for a single master. */
-    int this_slaves; /* Number of ok slaves for our master (if we are slave). */
-    mstime_t min_pong = 0, now = mstime();
-    clusterNode *min_pong_node = NULL;
-    static unsigned long long iteration = 0;
-    mstime_t handshake_timeout;
-
-    iteration++; /* Number of times this function was called so far. */
-
-    /* We want to take myself->ip in sync with the cluster-announce-ip option.
-     * The option can be set at runtime via CONFIG SET, so we periodically check
-     * if the option changed to reflect this into myself->ip. */
-    {
-        static char *prev_ip = NULL;
-        char *curr_ip = server.cluster_announce_ip;
-        int changed = 0;
-
-        if (prev_ip == NULL && curr_ip != NULL) changed = 1;
-        else if (prev_ip != NULL && curr_ip == NULL) changed = 1;
-        else if (prev_ip && curr_ip && strcmp(prev_ip,curr_ip)) changed = 1;
-
-        if (changed) {
-            if (prev_ip) zfree(prev_ip);
-            prev_ip = curr_ip;
-
-            if (curr_ip) {
-                /* We always take a copy of the previous IP address, by
-                 * duplicating the string. This way later we can check if
-                 * the address really changed. */
-                prev_ip = zstrdup(prev_ip);
-                strncpy(myself->ip,server.cluster_announce_ip,NET_IP_STR_LEN);
-                myself->ip[NET_IP_STR_LEN-1] = '\0';
-            } else {
-                myself->ip[0] = '\0'; /* Force autodetection. */
-            }
-        }
-    }
-
-    /* The handshake timeout is the time after which a handshake node that was
-     * not turned into a normal node is removed from the nodes. Usually it is
-     * just the NODE_TIMEOUT value, but when NODE_TIMEOUT is too small we use
-     * the value of 1 second. */
-    handshake_timeout = server.cluster_node_timeout;
-    if (handshake_timeout < 1000) handshake_timeout = 1000;
-
-    /* Update myself flags. */
-    clusterUpdateMyselfFlags();
-
-    /* Check if we have disconnected nodes and re-establish the connection.
-     * Also update a few stats while we are here, that can be used to make
-     * better decisions in other part of the code. */
-    di = dictGetSafeIterator(server.cluster->nodes);
-    server.cluster->stats_pfail_nodes = 0;
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        /* Not interested in reconnecting the link with myself or nodes
-         * for which we have no address. */
-        if (node->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_NOADDR)) continue;
-
-        if (node->flags & CLUSTER_NODE_PFAIL)
-            server.cluster->stats_pfail_nodes++;
-
-        /* A Node in HANDSHAKE state has a limited lifespan equal to the
-         * configured node timeout. */
-        if (nodeInHandshake(node) && now - node->ctime > handshake_timeout) {
-            clusterDelNode(node);
-            continue;
-        }
-
-        if (node->link == NULL) {
-            clusterLink *link = createClusterLink(node);
-            link->conn = server.tls_cluster ? connCreateTLS() : connCreateSocket();
-            connSetPrivateData(link->conn, link);
-            if (connConnect(link->conn, node->ip, node->cport, NET_FIRST_BIND_ADDR,
-                        clusterLinkConnectHandler) == -1) {
-                /* We got a synchronous error from connect before
-                 * clusterSendPing() had a chance to be called.
-                 * If node->ping_sent is zero, failure detection can't work,
-                 * so we claim we actually sent a ping now (that will
-                 * be really sent as soon as the link is obtained). */
-                if (node->ping_sent == 0) node->ping_sent = mstime();
-                serverLog(LL_DEBUG, "Unable to connect to "
-                    "Cluster Node [%s]:%d -> %s", node->ip,
-                    node->cport, server.neterr);
-
-                freeClusterLink(link);
-                continue;
-            }
-            node->link = link;
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Ping some random node 1 time every 10 iterations, so that we usually ping
-     * one random node every second. */
-    if (!(iteration % 10)) {
-        int j;
-
-        /* Check a few random nodes and ping the one with the oldest
-         * pong_received time. */
-        for (j = 0; j < 5; j++) {
-            de = dictGetRandomKey(server.cluster->nodes);
-            clusterNode *this = dictGetVal(de);
-
-            /* Don't ping nodes disconnected or with a ping currently active. */
-            if (this->link == NULL || this->ping_sent != 0) continue;
-            if (this->flags & (CLUSTER_NODE_MYSELF|CLUSTER_NODE_HANDSHAKE))
-                continue;
-            if (min_pong_node == NULL || min_pong > this->pong_received) {
-                min_pong_node = this;
-                min_pong = this->pong_received;
-            }
-        }
-        if (min_pong_node) {
-            serverLog(LL_DEBUG,"Pinging node %.40s", min_pong_node->name);
-            clusterSendPing(min_pong_node->link, CLUSTERMSG_TYPE_PING);
-        }
-    }
-
-    /* Iterate nodes to check if we need to flag something as failing.
-     * This loop is also responsible to:
-     * 1) Check if there are orphaned masters (masters without non failing
-     *    slaves).
-     * 2) Count the max number of non failing slaves for a single master.
-     * 3) Count the number of slaves for our master, if we are a slave. */
-    orphaned_masters = 0;
-    max_slaves = 0;
-    this_slaves = 0;
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-        now = mstime(); /* Use an updated time at every iteration. */
-
-        if (node->flags &
-            (CLUSTER_NODE_MYSELF|CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE))
-                continue;
-
-        /* Orphaned master check, useful only if the current instance
-         * is a slave that may migrate to another master. */
-        if (nodeIsSlave(myself) && nodeIsMaster(node) && !nodeFailed(node)) {
-            int okslaves = clusterCountNonFailingSlaves(node);
-
-            /* A master is orphaned if it is serving a non-zero number of
-             * slots, have no working slaves, but used to have at least one
-             * slave, or failed over a master that used to have slaves. */
-            if (okslaves == 0 && node->numslots > 0 &&
-                node->flags & CLUSTER_NODE_MIGRATE_TO)
-            {
-                orphaned_masters++;
-            }
-            if (okslaves > max_slaves) max_slaves = okslaves;
-            if (nodeIsSlave(myself) && myself->slaveof == node)
-                this_slaves = okslaves;
-        }
-
-        /* If we are not receiving any data for more than half the cluster
-         * timeout, reconnect the link: maybe there is a connection
-         * issue even if the node is alive. */
-        mstime_t ping_delay = now - node->ping_sent;
-        mstime_t data_delay = now - node->data_received;
-        if (node->link && /* is connected */
-            now - node->link->ctime >
-            server.cluster_node_timeout && /* was not already reconnected */
-            node->ping_sent && /* we already sent a ping */
-            /* and we are waiting for the pong more than timeout/2 */
-            ping_delay > server.cluster_node_timeout/2 &&
-            /* and in such interval we are not seeing any traffic at all. */
-            data_delay > server.cluster_node_timeout/2)
-        {
-            /* Disconnect the link, it will be reconnected automatically. */
-            freeClusterLink(node->link);
-        }
-
-        /* If we have currently no active ping in this instance, and the
-         * received PONG is older than half the cluster timeout, send
-         * a new ping now, to ensure all the nodes are pinged without
-         * a too big delay. */
-        if (node->link &&
-            node->ping_sent == 0 &&
-            (now - node->pong_received) > server.cluster_node_timeout/2)
-        {
-            clusterSendPing(node->link, CLUSTERMSG_TYPE_PING);
-            continue;
-        }
-
-        /* If we are a master and one of the slaves requested a manual
-         * failover, ping it continuously. */
-        if (server.cluster->mf_end &&
-            nodeIsMaster(myself) &&
-            server.cluster->mf_slave == node &&
-            node->link)
-        {
-            clusterSendPing(node->link, CLUSTERMSG_TYPE_PING);
-            continue;
-        }
-
-        /* Check only if we have an active ping for this instance. */
-        if (node->ping_sent == 0) continue;
-
-        /* Check if this node looks unreachable.
-         * Note that if we already received the PONG, then node->ping_sent
-         * is zero, so can't reach this code at all, so we don't risk of
-         * checking for a PONG delay if we didn't sent the PING.
-         *
-         * We also consider every incoming data as proof of liveness, since
-         * our cluster bus link is also used for data: under heavy data
-         * load pong delays are possible. */
-        mstime_t node_delay = (ping_delay < data_delay) ? ping_delay :
-                                                          data_delay;
-
-        if (node_delay > server.cluster_node_timeout) {
-            /* Timeout reached. Set the node as possibly failing if it is
-             * not already in this state. */
-            if (!(node->flags & (CLUSTER_NODE_PFAIL|CLUSTER_NODE_FAIL))) {
-                serverLog(LL_DEBUG,"*** NODE %.40s possibly failing",
-                    node->name);
-                node->flags |= CLUSTER_NODE_PFAIL;
-                update_state = 1;
-            }
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* If we are a slave node but the replication is still turned off,
-     * enable it if we know the address of our master and it appears to
-     * be up. */
-    if (nodeIsSlave(myself) &&
-        server.masterhost == NULL &&
-        myself->slaveof &&
-        nodeHasAddr(myself->slaveof))
-    {
-        replicationSetMaster(myself->slaveof->ip, myself->slaveof->port);
-    }
-
-    /* Abort a manual failover if the timeout is reached. */
-    manualFailoverCheckTimeout();
-
-    if (nodeIsSlave(myself)) {
-        clusterHandleManualFailover();
-        if (!(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
-            clusterHandleSlaveFailover();
-        /* If there are orphaned slaves, and we are a slave among the masters
-         * with the max number of non-failing slaves, consider migrating to
-         * the orphaned masters. Note that it does not make sense to try
-         * a migration if there is no master with at least *two* working
-         * slaves. */
-        if (orphaned_masters && max_slaves >= 2 && this_slaves == max_slaves &&
-		server.cluster_allow_replica_migration)
-            clusterHandleSlaveMigration(max_slaves);
-    }
-
-    if (update_state || server.cluster->state == CLUSTER_FAIL)
-        clusterUpdateState();
-}
-
-/* This function is called before the event handler returns to sleep for
- * events. It is useful to perform operations that must be done ASAP in
- * reaction to events fired but that are not safe to perform inside event
- * handlers, or to perform potentially expansive tasks that we need to do
- * a single time before replying to clients. */
-void clusterBeforeSleep(void) {
-    int flags = server.cluster->todo_before_sleep;
-
-    /* Reset our flags (not strictly needed since every single function
-     * called for flags set should be able to clear its flag). */
-    server.cluster->todo_before_sleep = 0;
-
-    if (flags & CLUSTER_TODO_HANDLE_MANUALFAILOVER) {
-        /* Handle manual failover as soon as possible so that won't have a 100ms
-         * as it was handled only in clusterCron */
-        if(nodeIsSlave(myself)) {
-            clusterHandleManualFailover();
-            if (!(server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_FAILOVER))
-                clusterHandleSlaveFailover();
-        }
-    } else if (flags & CLUSTER_TODO_HANDLE_FAILOVER) {
-        /* Handle failover, this is needed when it is likely that there is already
-         * the quorum from masters in order to react fast. */
-        clusterHandleSlaveFailover();
-    }
-
-    /* Update the cluster state. */
-    if (flags & CLUSTER_TODO_UPDATE_STATE)
-        clusterUpdateState();
-
-    /* Save the config, possibly using fsync. */
-    if (flags & CLUSTER_TODO_SAVE_CONFIG) {
-        int fsync = flags & CLUSTER_TODO_FSYNC_CONFIG;
-        clusterSaveConfigOrDie(fsync);
-    }
-}
-
-void clusterDoBeforeSleep(int flags) {
-    server.cluster->todo_before_sleep |= flags;
-}
-
-/* -----------------------------------------------------------------------------
- * Slots management
- * -------------------------------------------------------------------------- */
-
-/* Test bit 'pos' in a generic bitmap. Return 1 if the bit is set,
- * otherwise 0. */
-int bitmapTestBit(unsigned char *bitmap, int pos) {
-    off_t byte = pos/8;
-    int bit = pos&7;
-    return (bitmap[byte] & (1<<bit)) != 0;
-}
-
-/* Set the bit at position 'pos' in a bitmap. */
-void bitmapSetBit(unsigned char *bitmap, int pos) {
-    off_t byte = pos/8;
-    int bit = pos&7;
-    bitmap[byte] |= 1<<bit;
-}
-
-/* Clear the bit at position 'pos' in a bitmap. */
-void bitmapClearBit(unsigned char *bitmap, int pos) {
-    off_t byte = pos/8;
-    int bit = pos&7;
-    bitmap[byte] &= ~(1<<bit);
-}
-
-/* Return non-zero if there is at least one master with slaves in the cluster.
- * Otherwise zero is returned. Used by clusterNodeSetSlotBit() to set the
- * MIGRATE_TO flag the when a master gets the first slot. */
-int clusterMastersHaveSlaves(void) {
-    dictIterator *di = dictGetSafeIterator(server.cluster->nodes);
-    dictEntry *de;
-    int slaves = 0;
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (nodeIsSlave(node)) continue;
-        slaves += node->numslaves;
-    }
-    dictReleaseIterator(di);
-    return slaves != 0;
-}
-
-/* Set the slot bit and return the old value. */
-int clusterNodeSetSlotBit(clusterNode *n, int slot) {
-    int old = bitmapTestBit(n->slots,slot);
-    bitmapSetBit(n->slots,slot);
-    if (!old) {
-        n->numslots++;
-        /* When a master gets its first slot, even if it has no slaves,
-         * it gets flagged with MIGRATE_TO, that is, the master is a valid
-         * target for replicas migration, if and only if at least one of
-         * the other masters has slaves right now.
-         *
-         * Normally masters are valid targets of replica migration if:
-         * 1. The used to have slaves (but no longer have).
-         * 2. They are slaves failing over a master that used to have slaves.
-         *
-         * However new masters with slots assigned are considered valid
-         * migration targets if the rest of the cluster is not a slave-less.
-         *
-         * See https://github.com/redis/redis/issues/3043 for more info. */
-        if (n->numslots == 1 && clusterMastersHaveSlaves())
-            n->flags |= CLUSTER_NODE_MIGRATE_TO;
-    }
-    return old;
-}
-
-/* Clear the slot bit and return the old value. */
-int clusterNodeClearSlotBit(clusterNode *n, int slot) {
-    int old = bitmapTestBit(n->slots,slot);
-    bitmapClearBit(n->slots,slot);
-    if (old) n->numslots--;
-    return old;
-}
-
-/* Return the slot bit from the cluster node structure. */
-int clusterNodeGetSlotBit(clusterNode *n, int slot) {
-    return bitmapTestBit(n->slots,slot);
-}
-
-/* Add the specified slot to the list of slots that node 'n' will
- * serve. Return C_OK if the operation ended with success.
- * If the slot is already assigned to another instance this is considered
- * an error and C_ERR is returned. */
-int clusterAddSlot(clusterNode *n, int slot) {
-    if (server.cluster->slots[slot]) return C_ERR;
-    clusterNodeSetSlotBit(n,slot);
-    server.cluster->slots[slot] = n;
-    return C_OK;
-}
-
-/* Delete the specified slot marking it as unassigned.
- * Returns C_OK if the slot was assigned, otherwise if the slot was
- * already unassigned C_ERR is returned. */
-int clusterDelSlot(int slot) {
-    clusterNode *n = server.cluster->slots[slot];
-
-    if (!n) return C_ERR;
-    serverAssert(clusterNodeClearSlotBit(n,slot) == 1);
-    server.cluster->slots[slot] = NULL;
-    return C_OK;
-}
-
-/* Delete all the slots associated with the specified node.
- * The number of deleted slots is returned. */
-int clusterDelNodeSlots(clusterNode *node) {
-    int deleted = 0, j;
-
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (clusterNodeGetSlotBit(node,j)) {
-            clusterDelSlot(j);
-            deleted++;
-        }
-    }
-    return deleted;
-}
-
-/* Clear the migrating / importing state for all the slots.
- * This is useful at initialization and when turning a master into slave. */
-void clusterCloseAllSlots(void) {
-    memset(server.cluster->migrating_slots_to,0,
-        sizeof(server.cluster->migrating_slots_to));
-    memset(server.cluster->importing_slots_from,0,
-        sizeof(server.cluster->importing_slots_from));
-}
-
-/* -----------------------------------------------------------------------------
- * Cluster state evaluation function
- * -------------------------------------------------------------------------- */
-
-/* The following are defines that are only used in the evaluation function
- * and are based on heuristics. Actually the main point about the rejoin and
- * writable delay is that they should be a few orders of magnitude larger
- * than the network latency. */
-#define CLUSTER_MAX_REJOIN_DELAY 5000
-#define CLUSTER_MIN_REJOIN_DELAY 500
-#define CLUSTER_WRITABLE_DELAY 2000
-
-void clusterUpdateState(void) {
-    int j, new_state;
-    int reachable_masters = 0;
-    static mstime_t among_minority_time;
-    static mstime_t first_call_time = 0;
-
-    server.cluster->todo_before_sleep &= ~CLUSTER_TODO_UPDATE_STATE;
-
-    /* If this is a master node, wait some time before turning the state
-     * into OK, since it is not a good idea to rejoin the cluster as a writable
-     * master, after a reboot, without giving the cluster a chance to
-     * reconfigure this node. Note that the delay is calculated starting from
-     * the first call to this function and not since the server start, in order
-     * to don't count the DB loading time. */
-    if (first_call_time == 0) first_call_time = mstime();
-    if (nodeIsMaster(myself) &&
-        server.cluster->state == CLUSTER_FAIL &&
-        mstime() - first_call_time < CLUSTER_WRITABLE_DELAY) return;
-
-    /* Start assuming the state is OK. We'll turn it into FAIL if there
-     * are the right conditions. */
-    new_state = CLUSTER_OK;
-
-    /* Check if all the slots are covered. */
-    if (server.cluster_require_full_coverage) {
-        for (j = 0; j < CLUSTER_SLOTS; j++) {
-            if (server.cluster->slots[j] == NULL ||
-                server.cluster->slots[j]->flags & (CLUSTER_NODE_FAIL))
-            {
-                new_state = CLUSTER_FAIL;
-                break;
-            }
-        }
-    }
-
-    /* Compute the cluster size, that is the number of master nodes
-     * serving at least a single slot.
-     *
-     * At the same time count the number of reachable masters having
-     * at least one slot. */
-    {
-        dictIterator *di;
-        dictEntry *de;
-
-        server.cluster->size = 0;
-        di = dictGetSafeIterator(server.cluster->nodes);
-        while((de = dictNext(di)) != NULL) {
-            clusterNode *node = dictGetVal(de);
-
-            if (nodeIsMaster(node) && node->numslots) {
-                server.cluster->size++;
-                if ((node->flags & (CLUSTER_NODE_FAIL|CLUSTER_NODE_PFAIL)) == 0)
-                    reachable_masters++;
-            }
-        }
-        dictReleaseIterator(di);
-    }
-
-    /* If we are in a minority partition, change the cluster state
-     * to FAIL. */
-    {
-        int needed_quorum = (server.cluster->size / 2) + 1;
-
-        if (reachable_masters < needed_quorum) {
-            new_state = CLUSTER_FAIL;
-            among_minority_time = mstime();
-        }
-    }
-
-    /* Log a state change */
-    if (new_state != server.cluster->state) {
-        mstime_t rejoin_delay = server.cluster_node_timeout;
-
-        /* If the instance is a master and was partitioned away with the
-         * minority, don't let it accept queries for some time after the
-         * partition heals, to make sure there is enough time to receive
-         * a configuration update. */
-        if (rejoin_delay > CLUSTER_MAX_REJOIN_DELAY)
-            rejoin_delay = CLUSTER_MAX_REJOIN_DELAY;
-        if (rejoin_delay < CLUSTER_MIN_REJOIN_DELAY)
-            rejoin_delay = CLUSTER_MIN_REJOIN_DELAY;
-
-        if (new_state == CLUSTER_OK &&
-            nodeIsMaster(myself) &&
-            mstime() - among_minority_time < rejoin_delay)
-        {
-            return;
-        }
-
-        /* Change the state and log the event. */
-        serverLog(LL_WARNING,"Cluster state changed: %s",
-            new_state == CLUSTER_OK ? "ok" : "fail");
-        server.cluster->state = new_state;
-    }
-}
-
-/* This function is called after the node startup in order to verify that data
- * loaded from disk is in agreement with the cluster configuration:
- *
- * 1) If we find keys about hash slots we have no responsibility for, the
- *    following happens:
- *    A) If no other node is in charge according to the current cluster
- *       configuration, we add these slots to our node.
- *    B) If according to our config other nodes are already in charge for
- *       this slots, we set the slots as IMPORTING from our point of view
- *       in order to justify we have those slots, and in order to make
- *       redis-trib aware of the issue, so that it can try to fix it.
- * 2) If we find data in a DB different than DB0 we return C_ERR to
- *    signal the caller it should quit the server with an error message
- *    or take other actions.
- *
- * The function always returns C_OK even if it will try to correct
- * the error described in "1". However if data is found in DB different
- * from DB0, C_ERR is returned.
- *
- * The function also uses the logging facility in order to warn the user
- * about desynchronizations between the data we have in memory and the
- * cluster configuration. */
-int verifyClusterConfigWithData(void) {
-    int j;
-    int update_config = 0;
-
-    /* Return ASAP if a module disabled cluster redirections. In that case
-     * every master can store keys about every possible hash slot. */
-    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
-        return C_OK;
-
-    /* If this node is a slave, don't perform the check at all as we
-     * completely depend on the replication stream. */
-    if (nodeIsSlave(myself)) return C_OK;
-
-    /* Make sure we only have keys in DB0. */
-    for (j = 1; j < server.dbnum; j++) {
-        if (dictSize(server.db[j].dict)) return C_ERR;
-    }
-
-    /* Check that all the slots we see populated memory have a corresponding
-     * entry in the cluster table. Otherwise fix the table. */
-    for (j = 0; j < CLUSTER_SLOTS; j++) {
-        if (!countKeysInSlot(j)) continue; /* No keys in this slot. */
-        /* Check if we are assigned to this slot or if we are importing it.
-         * In both cases check the next slot as the configuration makes
-         * sense. */
-        if (server.cluster->slots[j] == myself ||
-            server.cluster->importing_slots_from[j] != NULL) continue;
-
-        /* If we are here data and cluster config don't agree, and we have
-         * slot 'j' populated even if we are not importing it, nor we are
-         * assigned to this slot. Fix this condition. */
-
-        update_config++;
-        /* Case A: slot is unassigned. Take responsibility for it. */
-        if (server.cluster->slots[j] == NULL) {
-            serverLog(LL_WARNING, "I have keys for unassigned slot %d. "
-                                    "Taking responsibility for it.",j);
-            clusterAddSlot(myself,j);
-        } else {
-            serverLog(LL_WARNING, "I have keys for slot %d, but the slot is "
-                                    "assigned to another node. "
-                                    "Setting it to importing state.",j);
-            server.cluster->importing_slots_from[j] = server.cluster->slots[j];
-        }
-    }
-    if (update_config) clusterSaveConfigOrDie(1);
-    return C_OK;
-}
-
-/* -----------------------------------------------------------------------------
- * SLAVE nodes handling
- * -------------------------------------------------------------------------- */
-
-/* Set the specified node 'n' as master for this node.
- * If this node is currently a master, it is turned into a slave. */
-void clusterSetMaster(clusterNode *n) {
-    serverAssert(n != myself);
-    serverAssert(myself->numslots == 0);
-
-    if (nodeIsMaster(myself)) {
-        myself->flags &= ~(CLUSTER_NODE_MASTER|CLUSTER_NODE_MIGRATE_TO);
-        myself->flags |= CLUSTER_NODE_SLAVE;
-        clusterCloseAllSlots();
-    } else {
-        if (myself->slaveof)
-            clusterNodeRemoveSlave(myself->slaveof,myself);
-    }
-    myself->slaveof = n;
-    clusterNodeAddSlave(n,myself);
-    replicationSetMaster(n->ip, n->port);
-    resetManualFailover();
-}
-
-/* -----------------------------------------------------------------------------
- * Nodes to string representation functions.
- * -------------------------------------------------------------------------- */
-
-struct redisNodeFlags {
-    uint16_t flag;
-    char *name;
-};
-
-static struct redisNodeFlags redisNodeFlagsTable[] = {
-    {CLUSTER_NODE_MYSELF,       "myself,"},
-    {CLUSTER_NODE_MASTER,       "master,"},
-    {CLUSTER_NODE_SLAVE,        "slave,"},
-    {CLUSTER_NODE_PFAIL,        "fail?,"},
-    {CLUSTER_NODE_FAIL,         "fail,"},
-    {CLUSTER_NODE_HANDSHAKE,    "handshake,"},
-    {CLUSTER_NODE_NOADDR,       "noaddr,"},
-    {CLUSTER_NODE_NOFAILOVER,   "nofailover,"}
-};
-
-/* Concatenate the comma separated list of node flags to the given SDS
- * string 'ci'. */
-sds representClusterNodeFlags(sds ci, uint16_t flags) {
-    size_t orig_len = sdslen(ci);
-    int i, size = sizeof(redisNodeFlagsTable)/sizeof(struct redisNodeFlags);
-    for (i = 0; i < size; i++) {
-        struct redisNodeFlags *nodeflag = redisNodeFlagsTable + i;
-        if (flags & nodeflag->flag) ci = sdscat(ci, nodeflag->name);
-    }
-    /* If no flag was added, add the "noflags" special flag. */
-    if (sdslen(ci) == orig_len) ci = sdscat(ci,"noflags,");
-    sdsIncrLen(ci,-1); /* Remove trailing comma. */
-    return ci;
-}
-
-/* Generate a csv-alike representation of the specified cluster node.
- * See clusterGenNodesDescription() top comment for more information.
- *
- * The function returns the string representation as an SDS string. */
-sds clusterGenNodeDescription(clusterNode *node, int use_pport) {
-    int j, start;
-    sds ci;
-    int port = use_pport && node->pport ? node->pport : node->port;
-
-    /* Node coordinates */
-    ci = sdscatlen(sdsempty(),node->name,CLUSTER_NAMELEN);
-    ci = sdscatfmt(ci," %s:%i@%i ",
-        node->ip,
-        port,
-        node->cport);
-
-    /* Flags */
-    ci = representClusterNodeFlags(ci, node->flags);
-
-    /* Slave of... or just "-" */
-    ci = sdscatlen(ci," ",1);
-    if (node->slaveof)
-        ci = sdscatlen(ci,node->slaveof->name,CLUSTER_NAMELEN);
-    else
-        ci = sdscatlen(ci,"-",1);
-
-    unsigned long long nodeEpoch = node->configEpoch;
-    if (nodeIsSlave(node) && node->slaveof) {
-        nodeEpoch = node->slaveof->configEpoch;
-    }
-    /* Latency from the POV of this node, config epoch, link status */
-    ci = sdscatfmt(ci," %I %I %U %s",
-        (long long) node->ping_sent,
-        (long long) node->pong_received,
-        nodeEpoch,
-        (node->link || node->flags & CLUSTER_NODE_MYSELF) ?
-                    "connected" : "disconnected");
-
-    /* Slots served by this instance. If we already have slots info,
-     * append it diretly, otherwise, generate slots only if it has. */
-    if (node->slots_info) {
-        ci = sdscatsds(ci, node->slots_info);
-    } else if (node->numslots > 0) {
-        start = -1;
-        for (j = 0; j < CLUSTER_SLOTS; j++) {
-            int bit;
-
-            if ((bit = clusterNodeGetSlotBit(node,j)) != 0) {
-                if (start == -1) start = j;
-            }
-            if (start != -1 && (!bit || j == CLUSTER_SLOTS-1)) {
-                if (bit && j == CLUSTER_SLOTS-1) j++;
-
-                if (start == j-1) {
-                    ci = sdscatfmt(ci," %i",start);
-                } else {
-                    ci = sdscatfmt(ci," %i-%i",start,j-1);
-                }
-                start = -1;
-            }
-        }
-    }
-
-    /* Just for MYSELF node we also dump info about slots that
-     * we are migrating to other instances or importing from other
-     * instances. */
-    if (node->flags & CLUSTER_NODE_MYSELF) {
-        for (j = 0; j < CLUSTER_SLOTS; j++) {
-            if (server.cluster->migrating_slots_to[j]) {
-                ci = sdscatprintf(ci," [%d->-%.40s]",j,
-                    server.cluster->migrating_slots_to[j]->name);
-            } else if (server.cluster->importing_slots_from[j]) {
-                ci = sdscatprintf(ci," [%d-<-%.40s]",j,
-                    server.cluster->importing_slots_from[j]->name);
-            }
-        }
-    }
-    return ci;
-}
-
-/* Generate the slot topology for all nodes and store the string representation
- * in the slots_info struct on the node. This is used to improve the efficiency
- * of clusterGenNodesDescription() because it removes looping of the slot space
- * for generating the slot info for each node individually. */
-void clusterGenNodesSlotsInfo(int filter) {
-    clusterNode *n = NULL;
-    int start = -1;
-
-    for (int i = 0; i <= CLUSTER_SLOTS; i++) {
-        /* Find start node and slot id. */
-        if (n == NULL) {
-            if (i == CLUSTER_SLOTS) break;
-            n = server.cluster->slots[i];
-            start = i;
-            continue;
-        }
-
-        /* Generate slots info when occur different node with start
-         * or end of slot. */
-        if (i == CLUSTER_SLOTS || n != server.cluster->slots[i]) {
-            if (!(n->flags & filter)) {
-                if (n->slots_info == NULL) n->slots_info = sdsempty();
-                if (start == i-1) {
-                    n->slots_info = sdscatfmt(n->slots_info," %i",start);
-                } else {
-                    n->slots_info = sdscatfmt(n->slots_info," %i-%i",start,i-1);
-                }
-            }
-            if (i == CLUSTER_SLOTS) break;
-            n = server.cluster->slots[i];
-            start = i;
-        }
-    }
-}
-
-/* Generate a csv-alike representation of the nodes we are aware of,
- * including the "myself" node, and return an SDS string containing the
- * representation (it is up to the caller to free it).
- *
- * All the nodes matching at least one of the node flags specified in
- * "filter" are excluded from the output, so using zero as a filter will
- * include all the known nodes in the representation, including nodes in
- * the HANDSHAKE state.
- *
- * Setting use_pport to 1 in a TLS cluster makes the result contain the
- * plaintext client port rather then the TLS client port of each node.
- *
- * The representation obtained using this function is used for the output
- * of the CLUSTER NODES function, and as format for the cluster
- * configuration file (nodes.conf) for a given node. */
-sds clusterGenNodesDescription(int filter, int use_pport) {
-    sds ci = sdsempty(), ni;
-    dictIterator *di;
-    dictEntry *de;
-
-    /* Generate all nodes slots info firstly. */
-    clusterGenNodesSlotsInfo(filter);
-
-    di = dictGetSafeIterator(server.cluster->nodes);
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-
-        if (node->flags & filter) continue;
-        ni = clusterGenNodeDescription(node, use_pport);
-        ci = sdscatsds(ci,ni);
-        sdsfree(ni);
-        ci = sdscatlen(ci,"\n",1);
-
-        /* Release slots info. */
-        if (node->slots_info) {
-            sdsfree(node->slots_info);
-            node->slots_info = NULL;
-        }
-    }
-    dictReleaseIterator(di);
-    return ci;
-}
-
-/* -----------------------------------------------------------------------------
- * CLUSTER command
- * -------------------------------------------------------------------------- */
-
-const char *clusterGetMessageTypeString(int type) {
-    switch(type) {
-    case CLUSTERMSG_TYPE_PING: return "ping";
-    case CLUSTERMSG_TYPE_PONG: return "pong";
-    case CLUSTERMSG_TYPE_MEET: return "meet";
-    case CLUSTERMSG_TYPE_FAIL: return "fail";
-    case CLUSTERMSG_TYPE_PUBLISH: return "publish";
-    case CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST: return "auth-req";
-    case CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK: return "auth-ack";
-    case CLUSTERMSG_TYPE_UPDATE: return "update";
-    case CLUSTERMSG_TYPE_MFSTART: return "mfstart";
-    case CLUSTERMSG_TYPE_MODULE: return "module";
-    }
-    return "unknown";
-}
-
-int getSlotOrReply(client *c, robj *o) {
-    long long slot;
-
-    if (getLongLongFromObject(o,&slot) != C_OK ||
-        slot < 0 || slot >= CLUSTER_SLOTS)
-    {
-        addReplyError(c,"Invalid or out of range slot");
-        return -1;
-    }
-    return (int) slot;
-}
-
-void addNodeReplyForClusterSlot(client *c, clusterNode *node, int start_slot, int end_slot) {
-    int i, nested_elements = 3; /* slots (2) + master addr (1) */
-    void *nested_replylen = addReplyDeferredLen(c);
-    addReplyLongLong(c, start_slot);
-    addReplyLongLong(c, end_slot);
-    addReplyArrayLen(c, 3);
-    addReplyBulkCString(c, node->ip);
-    /* Report non-TLS ports to non-TLS client in TLS cluster if available. */
-    int use_pport = (server.tls_cluster &&
-                     c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
-    addReplyLongLong(c, use_pport && node->pport ? node->pport : node->port);
-    addReplyBulkCBuffer(c, node->name, CLUSTER_NAMELEN);
-
-    /* Remaining nodes in reply are replicas for slot range */
-    for (i = 0; i < node->numslaves; i++) {
-        /* This loop is copy/pasted from clusterGenNodeDescription()
-         * with modifications for per-slot node aggregation. */
-        if (nodeFailed(node->slaves[i])) continue;
-        addReplyArrayLen(c, 3);
-        addReplyBulkCString(c, node->slaves[i]->ip);
-        /* Report slave's non-TLS port to non-TLS client in TLS cluster */
-        addReplyLongLong(c, (use_pport && node->slaves[i]->pport ?
-                             node->slaves[i]->pport :
-                             node->slaves[i]->port));
-        addReplyBulkCBuffer(c, node->slaves[i]->name, CLUSTER_NAMELEN);
-        nested_elements++;
-    }
-    setDeferredArrayLen(c, nested_replylen, nested_elements);
-}
-
-void clusterReplyMultiBulkSlots(client * c) {
-    /* Format: 1) 1) start slot
-     *            2) end slot
-     *            3) 1) master IP
-     *               2) master port
-     *               3) node ID
-     *            4) 1) replica IP
-     *               2) replica port
-     *               3) node ID
-     *           ... continued until done
-     */
-    clusterNode *n = NULL;
-    int num_masters = 0, start = -1;
-    void *slot_replylen = addReplyDeferredLen(c);
-
-    for (int i = 0; i <= CLUSTER_SLOTS; i++) {
-        /* Find start node and slot id. */
-        if (n == NULL) {
-            if (i == CLUSTER_SLOTS) break;
-            n = server.cluster->slots[i];
-            start = i;
-            continue;
-        }
-
-        /* Add cluster slots info when occur different node with start
-         * or end of slot. */
-        if (i == CLUSTER_SLOTS || n != server.cluster->slots[i]) {
-            addNodeReplyForClusterSlot(c, n, start, i-1);
-            num_masters++;
-            if (i == CLUSTER_SLOTS) break;
-            n = server.cluster->slots[i];
-            start = i;
-        }
-    }
-    setDeferredArrayLen(c, slot_replylen, num_masters);
-}
-
-void clusterCommand(client *c) {
-    if (server.cluster_enabled == 0) {
-        addReplyError(c,"This instance has cluster support disabled");
-        return;
-    }
-
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"ADDSLOTS <slot> [<slot> ...]",
-"    Assign slots to current node.",
-"BUMPEPOCH",
-"    Advance the cluster config epoch.",
-"COUNT-FAILURE-REPORTS <node-id>",
-"    Return number of failure reports for <node-id>.",
-"COUNTKEYSINSLOT <slot>",
-"    Return the number of keys in <slot>.",
-"DELSLOTS <slot> [<slot> ...]",
-"    Delete slots information from current node.",
-"FAILOVER [FORCE|TAKEOVER]",
-"    Promote current replica node to being a master.",
-"FORGET <node-id>",
-"    Remove a node from the cluster.",
-"GETKEYSINSLOT <slot> <count>",
-"    Return key names stored by current node in a slot.",
-"FLUSHSLOTS",
-"    Delete current node own slots information.",
-"INFO",
-"    Return information about the cluster.",
-"KEYSLOT <key>",
-"    Return the hash slot for <key>.",
-"MEET <ip> <port> [<bus-port>]",
-"    Connect nodes into a working cluster.",
-"MYID",
-"    Return the node id.",
-"NODES",
-"    Return cluster configuration seen by node. Output format:",
-"    <id> <ip:port> <flags> <master> <pings> <pongs> <epoch> <link> <slot> ...",
-"REPLICATE <node-id>",
-"    Configure current node as replica to <node-id>.",
-"RESET [HARD|SOFT]",
-"    Reset current node (default: soft).",
-"SET-CONFIG-EPOCH <epoch>",
-"    Set config epoch of current node.",
-"SETSLOT <slot> (IMPORTING|MIGRATING|STABLE|NODE <node-id>)",
-"    Set slot state.",
-"REPLICAS <node-id>",
-"    Return <node-id> replicas.",
-"SAVECONFIG",
-"    Force saving cluster configuration on disk.",
-"SLOTS",
-"    Return information about slots range mappings. Each range is made of:",
-"    start, end, master and replicas IP addresses, ports and ids",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"meet") && (c->argc == 4 || c->argc == 5)) {
-        /* CLUSTER MEET <ip> <port> [cport] */
-        long long port, cport;
-
-        if (getLongLongFromObject(c->argv[3], &port) != C_OK) {
-            addReplyErrorFormat(c,"Invalid TCP base port specified: %s",
-                                (char*)c->argv[3]->ptr);
-            return;
-        }
-
-        if (c->argc == 5) {
-            if (getLongLongFromObject(c->argv[4], &cport) != C_OK) {
-                addReplyErrorFormat(c,"Invalid TCP bus port specified: %s",
-                                    (char*)c->argv[4]->ptr);
-                return;
-            }
-        } else {
-            cport = port + CLUSTER_PORT_INCR;
-        }
-
-        if (clusterStartHandshake(c->argv[2]->ptr,port,cport) == 0 &&
-            errno == EINVAL)
-        {
-            addReplyErrorFormat(c,"Invalid node address specified: %s:%s",
-                            (char*)c->argv[2]->ptr, (char*)c->argv[3]->ptr);
-        } else {
-            addReply(c,shared.ok);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"nodes") && c->argc == 2) {
-        /* CLUSTER NODES */
-        /* Report plaintext ports, only if cluster is TLS but client is known to
-         * be non-TLS). */
-        int use_pport = (server.tls_cluster &&
-                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
-        sds nodes = clusterGenNodesDescription(0, use_pport);
-        addReplyVerbatim(c,nodes,sdslen(nodes),"txt");
-        sdsfree(nodes);
-    } else if (!strcasecmp(c->argv[1]->ptr,"myid") && c->argc == 2) {
-        /* CLUSTER MYID */
-        addReplyBulkCBuffer(c,myself->name, CLUSTER_NAMELEN);
-    } else if (!strcasecmp(c->argv[1]->ptr,"slots") && c->argc == 2) {
-        /* CLUSTER SLOTS */
-        clusterReplyMultiBulkSlots(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"flushslots") && c->argc == 2) {
-        /* CLUSTER FLUSHSLOTS */
-        if (dictSize(server.db[0].dict) != 0) {
-            addReplyError(c,"DB must be empty to perform CLUSTER FLUSHSLOTS.");
-            return;
-        }
-        clusterDelNodeSlots(myself);
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-        addReply(c,shared.ok);
-    } else if ((!strcasecmp(c->argv[1]->ptr,"addslots") ||
-               !strcasecmp(c->argv[1]->ptr,"delslots")) && c->argc >= 3)
-    {
-        /* CLUSTER ADDSLOTS <slot> [slot] ... */
-        /* CLUSTER DELSLOTS <slot> [slot] ... */
-        int j, slot;
-        unsigned char *slots = zmalloc(CLUSTER_SLOTS);
-        int del = !strcasecmp(c->argv[1]->ptr,"delslots");
-
-        memset(slots,0,CLUSTER_SLOTS);
-        /* Check that all the arguments are parseable and that all the
-         * slots are not already busy. */
-        for (j = 2; j < c->argc; j++) {
-            if ((slot = getSlotOrReply(c,c->argv[j])) == -1) {
-                zfree(slots);
-                return;
-            }
-            if (del && server.cluster->slots[slot] == NULL) {
-                addReplyErrorFormat(c,"Slot %d is already unassigned", slot);
-                zfree(slots);
-                return;
-            } else if (!del && server.cluster->slots[slot]) {
-                addReplyErrorFormat(c,"Slot %d is already busy", slot);
-                zfree(slots);
-                return;
-            }
-            if (slots[slot]++ == 1) {
-                addReplyErrorFormat(c,"Slot %d specified multiple times",
-                    (int)slot);
-                zfree(slots);
-                return;
-            }
-        }
-        for (j = 0; j < CLUSTER_SLOTS; j++) {
-            if (slots[j]) {
-                int retval;
-
-                /* If this slot was set as importing we can clear this
-                 * state as now we are the real owner of the slot. */
-                if (server.cluster->importing_slots_from[j])
-                    server.cluster->importing_slots_from[j] = NULL;
-
-                retval = del ? clusterDelSlot(j) :
-                               clusterAddSlot(myself,j);
-                serverAssertWithInfo(c,NULL,retval == C_OK);
-            }
-        }
-        zfree(slots);
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"setslot") && c->argc >= 4) {
-        /* SETSLOT 10 MIGRATING <node ID> */
-        /* SETSLOT 10 IMPORTING <node ID> */
-        /* SETSLOT 10 STABLE */
-        /* SETSLOT 10 NODE <node ID> */
-        int slot;
-        clusterNode *n;
-
-        if (nodeIsSlave(myself)) {
-            addReplyError(c,"Please use SETSLOT only with masters.");
-            return;
-        }
-
-        if ((slot = getSlotOrReply(c,c->argv[2])) == -1) return;
-
-        if (!strcasecmp(c->argv[3]->ptr,"migrating") && c->argc == 5) {
-            if (server.cluster->slots[slot] != myself) {
-                addReplyErrorFormat(c,"I'm not the owner of hash slot %u",slot);
-                return;
-            }
-            if ((n = clusterLookupNode(c->argv[4]->ptr)) == NULL) {
-                addReplyErrorFormat(c,"I don't know about node %s",
-                    (char*)c->argv[4]->ptr);
-                return;
-            }
-            server.cluster->migrating_slots_to[slot] = n;
-        } else if (!strcasecmp(c->argv[3]->ptr,"importing") && c->argc == 5) {
-            if (server.cluster->slots[slot] == myself) {
-                addReplyErrorFormat(c,
-                    "I'm already the owner of hash slot %u",slot);
-                return;
-            }
-            if ((n = clusterLookupNode(c->argv[4]->ptr)) == NULL) {
-                addReplyErrorFormat(c,"I don't know about node %s",
-                    (char*)c->argv[4]->ptr);
-                return;
-            }
-            server.cluster->importing_slots_from[slot] = n;
-        } else if (!strcasecmp(c->argv[3]->ptr,"stable") && c->argc == 4) {
-            /* CLUSTER SETSLOT <SLOT> STABLE */
-            server.cluster->importing_slots_from[slot] = NULL;
-            server.cluster->migrating_slots_to[slot] = NULL;
-        } else if (!strcasecmp(c->argv[3]->ptr,"node") && c->argc == 5) {
-            /* CLUSTER SETSLOT <SLOT> NODE <NODE ID> */
-            clusterNode *n = clusterLookupNode(c->argv[4]->ptr);
-
-            if (!n) {
-                addReplyErrorFormat(c,"Unknown node %s",
-                    (char*)c->argv[4]->ptr);
-                return;
-            }
-            /* If this hash slot was served by 'myself' before to switch
-             * make sure there are no longer local keys for this hash slot. */
-            if (server.cluster->slots[slot] == myself && n != myself) {
-                if (countKeysInSlot(slot) != 0) {
-                    addReplyErrorFormat(c,
-                        "Can't assign hashslot %d to a different node "
-                        "while I still hold keys for this hash slot.", slot);
-                    return;
-                }
-            }
-            /* If this slot is in migrating status but we have no keys
-             * for it assigning the slot to another node will clear
-             * the migrating status. */
-            if (countKeysInSlot(slot) == 0 &&
-                server.cluster->migrating_slots_to[slot])
-                server.cluster->migrating_slots_to[slot] = NULL;
-
-            clusterDelSlot(slot);
-            clusterAddSlot(n,slot);
-
-            /* If this node was importing this slot, assigning the slot to
-             * itself also clears the importing status. */
-            if (n == myself &&
-                server.cluster->importing_slots_from[slot])
-            {
-                /* This slot was manually migrated, set this node configEpoch
-                 * to a new epoch so that the new version can be propagated
-                 * by the cluster.
-                 *
-                 * Note that if this ever results in a collision with another
-                 * node getting the same configEpoch, for example because a
-                 * failover happens at the same time we close the slot, the
-                 * configEpoch collision resolution will fix it assigning
-                 * a different epoch to each node. */
-                if (clusterBumpConfigEpochWithoutConsensus() == C_OK) {
-                    serverLog(LL_WARNING,
-                        "configEpoch updated after importing slot %d", slot);
-                }
-                server.cluster->importing_slots_from[slot] = NULL;
-                /* After importing this slot, let the other nodes know as
-                 * soon as possible. */
-                clusterBroadcastPong(CLUSTER_BROADCAST_ALL);
-            }
-        } else {
-            addReplyError(c,
-                "Invalid CLUSTER SETSLOT action or number of arguments. Try CLUSTER HELP");
-            return;
-        }
-        clusterDoBeforeSleep(CLUSTER_TODO_SAVE_CONFIG|CLUSTER_TODO_UPDATE_STATE);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"bumpepoch") && c->argc == 2) {
-        /* CLUSTER BUMPEPOCH */
-        int retval = clusterBumpConfigEpochWithoutConsensus();
-        sds reply = sdscatprintf(sdsempty(),"+%s %llu\r\n",
-                (retval == C_OK) ? "BUMPED" : "STILL",
-                (unsigned long long) myself->configEpoch);
-        addReplySds(c,reply);
-    } else if (!strcasecmp(c->argv[1]->ptr,"info") && c->argc == 2) {
-        /* CLUSTER INFO */
-        char *statestr[] = {"ok","fail","needhelp"};
-        int slots_assigned = 0, slots_ok = 0, slots_pfail = 0, slots_fail = 0;
-        uint64_t myepoch;
-        int j;
-
-        for (j = 0; j < CLUSTER_SLOTS; j++) {
-            clusterNode *n = server.cluster->slots[j];
-
-            if (n == NULL) continue;
-            slots_assigned++;
-            if (nodeFailed(n)) {
-                slots_fail++;
-            } else if (nodeTimedOut(n)) {
-                slots_pfail++;
-            } else {
-                slots_ok++;
-            }
-        }
-
-        myepoch = (nodeIsSlave(myself) && myself->slaveof) ?
-                  myself->slaveof->configEpoch : myself->configEpoch;
-
-        sds info = sdscatprintf(sdsempty(),
-            "cluster_state:%s\r\n"
-            "cluster_slots_assigned:%d\r\n"
-            "cluster_slots_ok:%d\r\n"
-            "cluster_slots_pfail:%d\r\n"
-            "cluster_slots_fail:%d\r\n"
-            "cluster_known_nodes:%lu\r\n"
-            "cluster_size:%d\r\n"
-            "cluster_current_epoch:%llu\r\n"
-            "cluster_my_epoch:%llu\r\n"
-            , statestr[server.cluster->state],
-            slots_assigned,
-            slots_ok,
-            slots_pfail,
-            slots_fail,
-            dictSize(server.cluster->nodes),
-            server.cluster->size,
-            (unsigned long long) server.cluster->currentEpoch,
-            (unsigned long long) myepoch
-        );
-
-        /* Show stats about messages sent and received. */
-        long long tot_msg_sent = 0;
-        long long tot_msg_received = 0;
-
-        for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
-            if (server.cluster->stats_bus_messages_sent[i] == 0) continue;
-            tot_msg_sent += server.cluster->stats_bus_messages_sent[i];
-            info = sdscatprintf(info,
-                "cluster_stats_messages_%s_sent:%lld\r\n",
-                clusterGetMessageTypeString(i),
-                server.cluster->stats_bus_messages_sent[i]);
-        }
-        info = sdscatprintf(info,
-            "cluster_stats_messages_sent:%lld\r\n", tot_msg_sent);
-
-        for (int i = 0; i < CLUSTERMSG_TYPE_COUNT; i++) {
-            if (server.cluster->stats_bus_messages_received[i] == 0) continue;
-            tot_msg_received += server.cluster->stats_bus_messages_received[i];
-            info = sdscatprintf(info,
-                "cluster_stats_messages_%s_received:%lld\r\n",
-                clusterGetMessageTypeString(i),
-                server.cluster->stats_bus_messages_received[i]);
-        }
-        info = sdscatprintf(info,
-            "cluster_stats_messages_received:%lld\r\n", tot_msg_received);
-
-        /* Produce the reply protocol. */
-        addReplyVerbatim(c,info,sdslen(info),"txt");
-        sdsfree(info);
-    } else if (!strcasecmp(c->argv[1]->ptr,"saveconfig") && c->argc == 2) {
-        int retval = clusterSaveConfig(1);
-
-        if (retval == 0)
-            addReply(c,shared.ok);
-        else
-            addReplyErrorFormat(c,"error saving the cluster node config: %s",
-                strerror(errno));
-    } else if (!strcasecmp(c->argv[1]->ptr,"keyslot") && c->argc == 3) {
-        /* CLUSTER KEYSLOT <key> */
-        sds key = c->argv[2]->ptr;
-
-        addReplyLongLong(c,keyHashSlot(key,sdslen(key)));
-    } else if (!strcasecmp(c->argv[1]->ptr,"countkeysinslot") && c->argc == 3) {
-        /* CLUSTER COUNTKEYSINSLOT <slot> */
-        long long slot;
-
-        if (getLongLongFromObjectOrReply(c,c->argv[2],&slot,NULL) != C_OK)
-            return;
-        if (slot < 0 || slot >= CLUSTER_SLOTS) {
-            addReplyError(c,"Invalid slot");
-            return;
-        }
-        addReplyLongLong(c,countKeysInSlot(slot));
-    } else if (!strcasecmp(c->argv[1]->ptr,"getkeysinslot") && c->argc == 4) {
-        /* CLUSTER GETKEYSINSLOT <slot> <count> */
-        long long maxkeys, slot;
-        unsigned int numkeys, j;
-        robj **keys;
-
-        if (getLongLongFromObjectOrReply(c,c->argv[2],&slot,NULL) != C_OK)
-            return;
-        if (getLongLongFromObjectOrReply(c,c->argv[3],&maxkeys,NULL)
-            != C_OK)
-            return;
-        if (slot < 0 || slot >= CLUSTER_SLOTS || maxkeys < 0) {
-            addReplyError(c,"Invalid slot or number of keys");
-            return;
-        }
-
-        /* Avoid allocating more than needed in case of large COUNT argument
-         * and smaller actual number of keys. */
-        unsigned int keys_in_slot = countKeysInSlot(slot);
-        if (maxkeys > keys_in_slot) maxkeys = keys_in_slot;
-
-        keys = zmalloc(sizeof(robj*)*maxkeys);
-        numkeys = getKeysInSlot(slot, keys, maxkeys);
-        addReplyArrayLen(c,numkeys);
-        for (j = 0; j < numkeys; j++) {
-            addReplyBulk(c,keys[j]);
-            decrRefCount(keys[j]);
-        }
-        zfree(keys);
-    } else if (!strcasecmp(c->argv[1]->ptr,"forget") && c->argc == 3) {
-        /* CLUSTER FORGET <NODE ID> */
-        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
-
-        if (!n) {
-            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
-            return;
-        } else if (n == myself) {
-            addReplyError(c,"I tried hard but I can't forget myself...");
-            return;
-        } else if (nodeIsSlave(myself) && myself->slaveof == n) {
-            addReplyError(c,"Can't forget my master!");
-            return;
-        }
-        clusterBlacklistAddNode(n);
-        clusterDelNode(n);
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|
-                             CLUSTER_TODO_SAVE_CONFIG);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"replicate") && c->argc == 3) {
-        /* CLUSTER REPLICATE <NODE ID> */
-        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
-
-        /* Lookup the specified node in our table. */
-        if (!n) {
-            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
-            return;
-        }
-
-        /* I can't replicate myself. */
-        if (n == myself) {
-            addReplyError(c,"Can't replicate myself");
-            return;
-        }
-
-        /* Can't replicate a slave. */
-        if (nodeIsSlave(n)) {
-            addReplyError(c,"I can only replicate a master, not a replica.");
-            return;
-        }
-
-        /* If the instance is currently a master, it should have no assigned
-         * slots nor keys to accept to replicate some other node.
-         * Slaves can switch to another master without issues. */
-        if (nodeIsMaster(myself) &&
-            (myself->numslots != 0 || dictSize(server.db[0].dict) != 0)) {
-            addReplyError(c,
-                "To set a master the node must be empty and "
-                "without assigned slots.");
-            return;
-        }
-
-        /* Set the master. */
-        clusterSetMaster(n);
-        clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|CLUSTER_TODO_SAVE_CONFIG);
-        addReply(c,shared.ok);
-    } else if ((!strcasecmp(c->argv[1]->ptr,"slaves") ||
-                !strcasecmp(c->argv[1]->ptr,"replicas")) && c->argc == 3) {
-        /* CLUSTER SLAVES <NODE ID> */
-        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
-        int j;
-
-        /* Lookup the specified node in our table. */
-        if (!n) {
-            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
-            return;
-        }
-
-        if (nodeIsSlave(n)) {
-            addReplyError(c,"The specified node is not a master");
-            return;
-        }
-
-        /* Use plaintext port if cluster is TLS but client is non-TLS. */
-        int use_pport = (server.tls_cluster &&
-                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
-        addReplyArrayLen(c,n->numslaves);
-        for (j = 0; j < n->numslaves; j++) {
-            sds ni = clusterGenNodeDescription(n->slaves[j], use_pport);
-            addReplyBulkCString(c,ni);
-            sdsfree(ni);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"count-failure-reports") &&
-               c->argc == 3)
-    {
-        /* CLUSTER COUNT-FAILURE-REPORTS <NODE ID> */
-        clusterNode *n = clusterLookupNode(c->argv[2]->ptr);
-
-        if (!n) {
-            addReplyErrorFormat(c,"Unknown node %s", (char*)c->argv[2]->ptr);
-            return;
-        } else {
-            addReplyLongLong(c,clusterNodeFailureReportsCount(n));
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"failover") &&
-               (c->argc == 2 || c->argc == 3))
-    {
-        /* CLUSTER FAILOVER [FORCE|TAKEOVER] */
-        int force = 0, takeover = 0;
-
-        if (c->argc == 3) {
-            if (!strcasecmp(c->argv[2]->ptr,"force")) {
-                force = 1;
-            } else if (!strcasecmp(c->argv[2]->ptr,"takeover")) {
-                takeover = 1;
-                force = 1; /* Takeover also implies force. */
-            } else {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-
-        /* Check preconditions. */
-        if (nodeIsMaster(myself)) {
-            addReplyError(c,"You should send CLUSTER FAILOVER to a replica");
-            return;
-        } else if (myself->slaveof == NULL) {
-            addReplyError(c,"I'm a replica but my master is unknown to me");
-            return;
-        } else if (!force &&
-                   (nodeFailed(myself->slaveof) ||
-                    myself->slaveof->link == NULL))
-        {
-            addReplyError(c,"Master is down or failed, "
-                            "please use CLUSTER FAILOVER FORCE");
-            return;
-        }
-        resetManualFailover();
-        server.cluster->mf_end = mstime() + CLUSTER_MF_TIMEOUT;
-
-        if (takeover) {
-            /* A takeover does not perform any initial check. It just
-             * generates a new configuration epoch for this node without
-             * consensus, claims the master's slots, and broadcast the new
-             * configuration. */
-            serverLog(LL_WARNING,"Taking over the master (user request).");
-            clusterBumpConfigEpochWithoutConsensus();
-            clusterFailoverReplaceYourMaster();
-        } else if (force) {
-            /* If this is a forced failover, we don't need to talk with our
-             * master to agree about the offset. We just failover taking over
-             * it without coordination. */
-            serverLog(LL_WARNING,"Forced failover user request accepted.");
-            server.cluster->mf_can_start = 1;
-        } else {
-            serverLog(LL_WARNING,"Manual failover user request accepted.");
-            clusterSendMFStart(myself->slaveof);
-        }
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"set-config-epoch") && c->argc == 3)
-    {
-        /* CLUSTER SET-CONFIG-EPOCH <epoch>
-         *
-         * The user is allowed to set the config epoch only when a node is
-         * totally fresh: no config epoch, no other known node, and so forth.
-         * This happens at cluster creation time to start with a cluster where
-         * every node has a different node ID, without to rely on the conflicts
-         * resolution system which is too slow when a big cluster is created. */
-        long long epoch;
-
-        if (getLongLongFromObjectOrReply(c,c->argv[2],&epoch,NULL) != C_OK)
-            return;
-
-        if (epoch < 0) {
-            addReplyErrorFormat(c,"Invalid config epoch specified: %lld",epoch);
-        } else if (dictSize(server.cluster->nodes) > 1) {
-            addReplyError(c,"The user can assign a config epoch only when the "
-                            "node does not know any other node.");
-        } else if (myself->configEpoch != 0) {
-            addReplyError(c,"Node config epoch is already non-zero");
-        } else {
-            myself->configEpoch = epoch;
-            serverLog(LL_WARNING,
-                "configEpoch set to %llu via CLUSTER SET-CONFIG-EPOCH",
-                (unsigned long long) myself->configEpoch);
-
-            if (server.cluster->currentEpoch < (uint64_t)epoch)
-                server.cluster->currentEpoch = epoch;
-            /* No need to fsync the config here since in the unlucky event
-             * of a failure to persist the config, the conflict resolution code
-             * will assign a unique config to this node. */
-            clusterDoBeforeSleep(CLUSTER_TODO_UPDATE_STATE|
-                                 CLUSTER_TODO_SAVE_CONFIG);
-            addReply(c,shared.ok);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"reset") &&
-               (c->argc == 2 || c->argc == 3))
-    {
-        /* CLUSTER RESET [SOFT|HARD] */
-        int hard = 0;
-
-        /* Parse soft/hard argument. Default is soft. */
-        if (c->argc == 3) {
-            if (!strcasecmp(c->argv[2]->ptr,"hard")) {
-                hard = 1;
-            } else if (!strcasecmp(c->argv[2]->ptr,"soft")) {
-                hard = 0;
-            } else {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-
-        /* Slaves can be reset while containing data, but not master nodes
-         * that must be empty. */
-        if (nodeIsMaster(myself) && dictSize(c->db->dict) != 0) {
-            addReplyError(c,"CLUSTER RESET can't be called with "
-                            "master nodes containing keys");
-            return;
-        }
-        clusterReset(hard);
-        addReply(c,shared.ok);
-    } else {
-        addReplySubcommandSyntaxError(c);
-        return;
-    }
-}
-
-/* -----------------------------------------------------------------------------
- * DUMP, RESTORE and MIGRATE commands
- * -------------------------------------------------------------------------- */
-
-/* Generates a DUMP-format representation of the object 'o', adding it to the
- * io stream pointed by 'rio'. This function can't fail. */
-void createDumpPayload(rio *payload, robj *o, robj *key) {
-    unsigned char buf[2];
-    uint64_t crc;
-
-    /* Serialize the object in an RDB-like format. It consist of an object type
-     * byte followed by the serialized object. This is understood by RESTORE. */
-    rioInitWithBuffer(payload,sdsempty());
-    serverAssert(rdbSaveObjectType(payload,o));
-    serverAssert(rdbSaveObject(payload,o,key));
-
-    /* Write the footer, this is how it looks like:
-     * ----------------+---------------------+---------------+
-     * ... RDB payload | 2 bytes RDB version | 8 bytes CRC64 |
-     * ----------------+---------------------+---------------+
-     * RDB version and CRC are both in little endian.
-     */
-
-    /* RDB version */
-    buf[0] = RDB_VERSION & 0xff;
-    buf[1] = (RDB_VERSION >> 8) & 0xff;
-    payload->io.buffer.ptr = sdscatlen(payload->io.buffer.ptr,buf,2);
-
-    /* CRC64 */
-    crc = crc64(0,(unsigned char*)payload->io.buffer.ptr,
-                sdslen(payload->io.buffer.ptr));
-    memrev64ifbe(&crc);
-    payload->io.buffer.ptr = sdscatlen(payload->io.buffer.ptr,&crc,8);
-}
-
-/* Verify that the RDB version of the dump payload matches the one of this Redis
- * instance and that the checksum is ok.
- * If the DUMP payload looks valid C_OK is returned, otherwise C_ERR
- * is returned. */
-int verifyDumpPayload(unsigned char *p, size_t len) {
-    unsigned char *footer;
-    uint16_t rdbver;
-    uint64_t crc;
-
-    /* At least 2 bytes of RDB version and 8 of CRC64 should be present. */
-    if (len < 10) return C_ERR;
-    footer = p+(len-10);
-
-    /* Verify RDB version */
-    rdbver = (footer[1] << 8) | footer[0];
-    if (rdbver > RDB_VERSION) return C_ERR;
-
-    if (server.skip_checksum_validation)
-        return C_OK;
-
-    /* Verify CRC64 */
-    crc = crc64(0,p,len-8);
-    memrev64ifbe(&crc);
-    return (memcmp(&crc,footer+2,8) == 0) ? C_OK : C_ERR;
-}
-
-/* DUMP keyname
- * DUMP is actually not used by Redis Cluster but it is the obvious
- * complement of RESTORE and can be useful for different applications. */
-void dumpCommand(client *c) {
-    robj *o;
-    rio payload;
-
-    /* Check if the key is here. */
-    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
-        addReplyNull(c);
-        return;
-    }
-
-    /* Create the DUMP encoded representation. */
-    createDumpPayload(&payload,o,c->argv[1]);
-
-    /* Transfer to the client */
-    addReplyBulkSds(c,payload.io.buffer.ptr);
-    return;
-}
-
-/* RESTORE key ttl serialized-value [REPLACE] */
-void restoreCommand(client *c) {
-    long long ttl, lfu_freq = -1, lru_idle = -1, lru_clock = -1;
-    rio payload;
-    int j, type, replace = 0, absttl = 0;
-    robj *obj;
-
-    /* Parse additional options */
-    for (j = 4; j < c->argc; j++) {
-        int additional = c->argc-j-1;
-        if (!strcasecmp(c->argv[j]->ptr,"replace")) {
-            replace = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"absttl")) {
-            absttl = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"idletime") && additional >= 1 &&
-                   lfu_freq == -1)
-        {
-            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&lru_idle,NULL)
-                    != C_OK) return;
-            if (lru_idle < 0) {
-                addReplyError(c,"Invalid IDLETIME value, must be >= 0");
-                return;
-            }
-            lru_clock = LRU_CLOCK();
-            j++; /* Consume additional arg. */
-        } else if (!strcasecmp(c->argv[j]->ptr,"freq") && additional >= 1 &&
-                   lru_idle == -1)
-        {
-            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&lfu_freq,NULL)
-                    != C_OK) return;
-            if (lfu_freq < 0 || lfu_freq > 255) {
-                addReplyError(c,"Invalid FREQ value, must be >= 0 and <= 255");
-                return;
-            }
-            j++; /* Consume additional arg. */
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    /* Make sure this key does not already exist here... */
-    robj *key = c->argv[1];
-    if (!replace && lookupKeyWrite(c->db,key) != NULL) {
-        addReplyErrorObject(c,shared.busykeyerr);
-        return;
-    }
-
-    /* Check if the TTL value makes sense */
-    if (getLongLongFromObjectOrReply(c,c->argv[2],&ttl,NULL) != C_OK) {
-        return;
-    } else if (ttl < 0) {
-        addReplyError(c,"Invalid TTL value, must be >= 0");
-        return;
-    }
-
-    /* Verify RDB version and data checksum. */
-    if (verifyDumpPayload(c->argv[3]->ptr,sdslen(c->argv[3]->ptr)) == C_ERR)
-    {
-        addReplyError(c,"DUMP payload version or checksum are wrong");
-        return;
-    }
-
-    rioInitWithBuffer(&payload,c->argv[3]->ptr);
-    if (((type = rdbLoadObjectType(&payload)) == -1) ||
-        ((obj = rdbLoadObject(type,&payload,key->ptr,NULL)) == NULL))
-    {
-        addReplyError(c,"Bad data format");
-        return;
-    }
-
-    /* Remove the old key if needed. */
-    int deleted = 0;
-    if (replace)
-        deleted = dbDelete(c->db,key);
-
-    if (ttl && !absttl) ttl+=mstime();
-    if (ttl && checkAlreadyExpired(ttl)) {
-        if (deleted) {
-            rewriteClientCommandVector(c,2,shared.del,key);
-            signalModifiedKey(c,c->db,key);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
-            server.dirty++;
-        }
-        decrRefCount(obj);
-        addReply(c, shared.ok);
-        return;
-    }
-
-    /* Create the key and set the TTL if any */
-    dbAdd(c->db,key,obj);
-    if (ttl) {
-        setExpire(c,c->db,key,ttl);
-    }
-    objectSetLRUOrLFU(obj,lfu_freq,lru_idle,lru_clock,1000);
-    signalModifiedKey(c,c->db,key);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,"restore",key,c->db->id);
-    addReply(c,shared.ok);
-    server.dirty++;
-}
-
-/* MIGRATE socket cache implementation.
- *
- * We take a map between host:ip and a TCP socket that we used to connect
- * to this instance in recent time.
- * This sockets are closed when the max number we cache is reached, and also
- * in serverCron() when they are around for more than a few seconds. */
-#define MIGRATE_SOCKET_CACHE_ITEMS 64 /* max num of items in the cache. */
-#define MIGRATE_SOCKET_CACHE_TTL 10 /* close cached sockets after 10 sec. */
-
-typedef struct migrateCachedSocket {
-    connection *conn;
-    long last_dbid;
-    time_t last_use_time;
-} migrateCachedSocket;
-
-/* Return a migrateCachedSocket containing a TCP socket connected with the
- * target instance, possibly returning a cached one.
- *
- * This function is responsible of sending errors to the client if a
- * connection can't be established. In this case -1 is returned.
- * Otherwise on success the socket is returned, and the caller should not
- * attempt to free it after usage.
- *
- * If the caller detects an error while using the socket, migrateCloseSocket()
- * should be called so that the connection will be created from scratch
- * the next time. */
-migrateCachedSocket* migrateGetSocket(client *c, robj *host, robj *port, long timeout) {
-    connection *conn;
-    sds name = sdsempty();
-    migrateCachedSocket *cs;
-
-    /* Check if we have an already cached socket for this ip:port pair. */
-    name = sdscatlen(name,host->ptr,sdslen(host->ptr));
-    name = sdscatlen(name,":",1);
-    name = sdscatlen(name,port->ptr,sdslen(port->ptr));
-    cs = dictFetchValue(server.migrate_cached_sockets,name);
-    if (cs) {
-        sdsfree(name);
-        cs->last_use_time = server.unixtime;
-        return cs;
-    }
-
-    /* No cached socket, create one. */
-    if (dictSize(server.migrate_cached_sockets) == MIGRATE_SOCKET_CACHE_ITEMS) {
-        /* Too many items, drop one at random. */
-        dictEntry *de = dictGetRandomKey(server.migrate_cached_sockets);
-        cs = dictGetVal(de);
-        connClose(cs->conn);
-        zfree(cs);
-        dictDelete(server.migrate_cached_sockets,dictGetKey(de));
-    }
-
-    /* Create the socket */
-    conn = server.tls_cluster ? connCreateTLS() : connCreateSocket();
-    if (connBlockingConnect(conn, c->argv[1]->ptr, atoi(c->argv[2]->ptr), timeout)
-            != C_OK) {
-        addReplyError(c,"-IOERR error or timeout connecting to the client");
-        connClose(conn);
-        sdsfree(name);
-        return NULL;
-    }
-    connEnableTcpNoDelay(conn);
-
-    /* Add to the cache and return it to the caller. */
-    cs = zmalloc(sizeof(*cs));
-    cs->conn = conn;
-
-    cs->last_dbid = -1;
-    cs->last_use_time = server.unixtime;
-    dictAdd(server.migrate_cached_sockets,name,cs);
-    return cs;
-}
-
-/* Free a migrate cached connection. */
-void migrateCloseSocket(robj *host, robj *port) {
-    sds name = sdsempty();
-    migrateCachedSocket *cs;
-
-    name = sdscatlen(name,host->ptr,sdslen(host->ptr));
-    name = sdscatlen(name,":",1);
-    name = sdscatlen(name,port->ptr,sdslen(port->ptr));
-    cs = dictFetchValue(server.migrate_cached_sockets,name);
-    if (!cs) {
-        sdsfree(name);
-        return;
-    }
-
-    connClose(cs->conn);
-    zfree(cs);
-    dictDelete(server.migrate_cached_sockets,name);
-    sdsfree(name);
-}
-
-void migrateCloseTimedoutSockets(void) {
-    dictIterator *di = dictGetSafeIterator(server.migrate_cached_sockets);
-    dictEntry *de;
-
-    while((de = dictNext(di)) != NULL) {
-        migrateCachedSocket *cs = dictGetVal(de);
-
-        if ((server.unixtime - cs->last_use_time) > MIGRATE_SOCKET_CACHE_TTL) {
-            connClose(cs->conn);
-            zfree(cs);
-            dictDelete(server.migrate_cached_sockets,dictGetKey(de));
-        }
-    }
-    dictReleaseIterator(di);
-}
-
-/* MIGRATE host port key dbid timeout [COPY | REPLACE | AUTH password |
- *         AUTH2 username password]
- *
- * On in the multiple keys form:
- *
- * MIGRATE host port "" dbid timeout [COPY | REPLACE | AUTH password |
- *         AUTH2 username password] KEYS key1 key2 ... keyN */
-void migrateCommand(client *c) {
-    migrateCachedSocket *cs;
-    int copy = 0, replace = 0, j;
-    char *username = NULL;
-    char *password = NULL;
-    long timeout;
-    long dbid;
-    robj **ov = NULL; /* Objects to migrate. */
-    robj **kv = NULL; /* Key names. */
-    robj **newargv = NULL; /* Used to rewrite the command as DEL ... keys ... */
-    rio cmd, payload;
-    int may_retry = 1;
-    int write_error = 0;
-    int argv_rewritten = 0;
-
-    /* To support the KEYS option we need the following additional state. */
-    int first_key = 3; /* Argument index of the first key. */
-    int num_keys = 1;  /* By default only migrate the 'key' argument. */
-
-    /* Parse additional options */
-    for (j = 6; j < c->argc; j++) {
-        int moreargs = (c->argc-1) - j;
-        if (!strcasecmp(c->argv[j]->ptr,"copy")) {
-            copy = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"replace")) {
-            replace = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"auth")) {
-            if (!moreargs) {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-            j++;
-            password = c->argv[j]->ptr;
-            redactClientCommandArgument(c,j);
-        } else if (!strcasecmp(c->argv[j]->ptr,"auth2")) {
-            if (moreargs < 2) {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-            username = c->argv[++j]->ptr;
-            redactClientCommandArgument(c,j);
-            password = c->argv[++j]->ptr;
-            redactClientCommandArgument(c,j);
-        } else if (!strcasecmp(c->argv[j]->ptr,"keys")) {
-            if (sdslen(c->argv[3]->ptr) != 0) {
-                addReplyError(c,
-                    "When using MIGRATE KEYS option, the key argument"
-                    " must be set to the empty string");
-                return;
-            }
-            first_key = j+1;
-            num_keys = c->argc - j - 1;
-            break; /* All the remaining args are keys. */
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    /* Sanity check */
-    if (getLongFromObjectOrReply(c,c->argv[5],&timeout,NULL) != C_OK ||
-        getLongFromObjectOrReply(c,c->argv[4],&dbid,NULL) != C_OK)
-    {
-        return;
-    }
-    if (timeout <= 0) timeout = 1000;
-
-    /* Check if the keys are here. If at least one key is to migrate, do it
-     * otherwise if all the keys are missing reply with "NOKEY" to signal
-     * the caller there was nothing to migrate. We don't return an error in
-     * this case, since often this is due to a normal condition like the key
-     * expiring in the meantime. */
-    ov = zrealloc(ov,sizeof(robj*)*num_keys);
-    kv = zrealloc(kv,sizeof(robj*)*num_keys);
-    int oi = 0;
-
-    for (j = 0; j < num_keys; j++) {
-        if ((ov[oi] = lookupKeyRead(c->db,c->argv[first_key+j])) != NULL) {
-            kv[oi] = c->argv[first_key+j];
-            oi++;
-        }
-    }
-    num_keys = oi;
-    if (num_keys == 0) {
-        zfree(ov); zfree(kv);
-        addReplySds(c,sdsnew("+NOKEY\r\n"));
-        return;
-    }
-
-try_again:
-    write_error = 0;
-
-    /* Connect */
-    cs = migrateGetSocket(c,c->argv[1],c->argv[2],timeout);
-    if (cs == NULL) {
-        zfree(ov); zfree(kv);
-        return; /* error sent to the client by migrateGetSocket() */
-    }
-
-    rioInitWithBuffer(&cmd,sdsempty());
-
-    /* Authentication */
-    if (password) {
-        int arity = username ? 3 : 2;
-        serverAssertWithInfo(c,NULL,rioWriteBulkCount(&cmd,'*',arity));
-        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"AUTH",4));
-        if (username) {
-            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,username,
-                                 sdslen(username)));
-        }
-        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,password,
-            sdslen(password)));
-    }
-
-    /* Send the SELECT command if the current DB is not already selected. */
-    int select = cs->last_dbid != dbid; /* Should we emit SELECT? */
-    if (select) {
-        serverAssertWithInfo(c,NULL,rioWriteBulkCount(&cmd,'*',2));
-        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"SELECT",6));
-        serverAssertWithInfo(c,NULL,rioWriteBulkLongLong(&cmd,dbid));
-    }
-
-    int non_expired = 0; /* Number of keys that we'll find non expired.
-                            Note that serializing large keys may take some time
-                            so certain keys that were found non expired by the
-                            lookupKey() function, may be expired later. */
-
-    /* Create RESTORE payload and generate the protocol to call the command. */
-    for (j = 0; j < num_keys; j++) {
-        long long ttl = 0;
-        long long expireat = getExpire(c->db,kv[j]);
-
-        if (expireat != -1) {
-            ttl = expireat-mstime();
-            if (ttl < 0) {
-                continue;
-            }
-            if (ttl < 1) ttl = 1;
-        }
-
-        /* Relocate valid (non expired) keys and values into the array in successive
-         * positions to remove holes created by the keys that were present
-         * in the first lookup but are now expired after the second lookup. */
-        ov[non_expired] = ov[j];
-        kv[non_expired++] = kv[j];
-
-        serverAssertWithInfo(c,NULL,
-            rioWriteBulkCount(&cmd,'*',replace ? 5 : 4));
-
-        if (server.cluster_enabled)
-            serverAssertWithInfo(c,NULL,
-                rioWriteBulkString(&cmd,"RESTORE-ASKING",14));
-        else
-            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"RESTORE",7));
-        serverAssertWithInfo(c,NULL,sdsEncodedObject(kv[j]));
-        serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,kv[j]->ptr,
-                sdslen(kv[j]->ptr)));
-        serverAssertWithInfo(c,NULL,rioWriteBulkLongLong(&cmd,ttl));
-
-        /* Emit the payload argument, that is the serialized object using
-         * the DUMP format. */
-        createDumpPayload(&payload,ov[j],kv[j]);
-        serverAssertWithInfo(c,NULL,
-            rioWriteBulkString(&cmd,payload.io.buffer.ptr,
-                               sdslen(payload.io.buffer.ptr)));
-        sdsfree(payload.io.buffer.ptr);
-
-        /* Add the REPLACE option to the RESTORE command if it was specified
-         * as a MIGRATE option. */
-        if (replace)
-            serverAssertWithInfo(c,NULL,rioWriteBulkString(&cmd,"REPLACE",7));
-    }
-
-    /* Fix the actual number of keys we are migrating. */
-    num_keys = non_expired;
-
-    /* Transfer the query to the other node in 64K chunks. */
-    errno = 0;
-    {
-        sds buf = cmd.io.buffer.ptr;
-        size_t pos = 0, towrite;
-        int nwritten = 0;
-
-        while ((towrite = sdslen(buf)-pos) > 0) {
-            towrite = (towrite > (64*1024) ? (64*1024) : towrite);
-            nwritten = connSyncWrite(cs->conn,buf+pos,towrite,timeout);
-            if (nwritten != (signed)towrite) {
-                write_error = 1;
-                goto socket_err;
-            }
-            pos += nwritten;
-        }
-    }
-
-    char buf0[1024]; /* Auth reply. */
-    char buf1[1024]; /* Select reply. */
-    char buf2[1024]; /* Restore reply. */
-
-    /* Read the AUTH reply if needed. */
-    if (password && connSyncReadLine(cs->conn, buf0, sizeof(buf0), timeout) <= 0)
-        goto socket_err;
-
-    /* Read the SELECT reply if needed. */
-    if (select && connSyncReadLine(cs->conn, buf1, sizeof(buf1), timeout) <= 0)
-        goto socket_err;
-
-    /* Read the RESTORE replies. */
-    int error_from_target = 0;
-    int socket_error = 0;
-    int del_idx = 1; /* Index of the key argument for the replicated DEL op. */
-
-    /* Allocate the new argument vector that will replace the current command,
-     * to propagate the MIGRATE as a DEL command (if no COPY option was given).
-     * We allocate num_keys+1 because the additional argument is for "DEL"
-     * command name itself. */
-    if (!copy) newargv = zmalloc(sizeof(robj*)*(num_keys+1));
-
-    for (j = 0; j < num_keys; j++) {
-        if (connSyncReadLine(cs->conn, buf2, sizeof(buf2), timeout) <= 0) {
-            socket_error = 1;
-            break;
-        }
-        if ((password && buf0[0] == '-') ||
-            (select && buf1[0] == '-') ||
-            buf2[0] == '-')
-        {
-            /* On error assume that last_dbid is no longer valid. */
-            if (!error_from_target) {
-                cs->last_dbid = -1;
-                char *errbuf;
-                if (password && buf0[0] == '-') errbuf = buf0;
-                else if (select && buf1[0] == '-') errbuf = buf1;
-                else errbuf = buf2;
-
-                error_from_target = 1;
-                addReplyErrorFormat(c,"Target instance replied with error: %s",
-                    errbuf+1);
-            }
-        } else {
-            if (!copy) {
-                /* No COPY option: remove the local key, signal the change. */
-                dbDelete(c->db,kv[j]);
-                signalModifiedKey(c,c->db,kv[j]);
-                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",kv[j],c->db->id);
-                server.dirty++;
-
-                /* Populate the argument vector to replace the old one. */
-                newargv[del_idx++] = kv[j];
-                incrRefCount(kv[j]);
-            }
-        }
-    }
-
-    /* On socket error, if we want to retry, do it now before rewriting the
-     * command vector. We only retry if we are sure nothing was processed
-     * and we failed to read the first reply (j == 0 test). */
-    if (!error_from_target && socket_error && j == 0 && may_retry &&
-        errno != ETIMEDOUT)
-    {
-        goto socket_err; /* A retry is guaranteed because of tested conditions.*/
-    }
-
-    /* On socket errors, close the migration socket now that we still have
-     * the original host/port in the ARGV. Later the original command may be
-     * rewritten to DEL and will be too later. */
-    if (socket_error) migrateCloseSocket(c->argv[1],c->argv[2]);
-
-    if (!copy) {
-        /* Translate MIGRATE as DEL for replication/AOF. Note that we do
-         * this only for the keys for which we received an acknowledgement
-         * from the receiving Redis server, by using the del_idx index. */
-        if (del_idx > 1) {
-            newargv[0] = createStringObject("DEL",3);
-            /* Note that the following call takes ownership of newargv. */
-            replaceClientCommandVector(c,del_idx,newargv);
-            argv_rewritten = 1;
-        } else {
-            /* No key transfer acknowledged, no need to rewrite as DEL. */
-            zfree(newargv);
-        }
-        newargv = NULL; /* Make it safe to call zfree() on it in the future. */
-    }
-
-    /* If we are here and a socket error happened, we don't want to retry.
-     * Just signal the problem to the client, but only do it if we did not
-     * already queue a different error reported by the destination server. */
-    if (!error_from_target && socket_error) {
-        may_retry = 0;
-        goto socket_err;
-    }
-
-    if (!error_from_target) {
-        /* Success! Update the last_dbid in migrateCachedSocket, so that we can
-         * avoid SELECT the next time if the target DB is the same. Reply +OK.
-         *
-         * Note: If we reached this point, even if socket_error is true
-         * still the SELECT command succeeded (otherwise the code jumps to
-         * socket_err label. */
-        cs->last_dbid = dbid;
-        addReply(c,shared.ok);
-    } else {
-        /* On error we already sent it in the for loop above, and set
-         * the currently selected socket to -1 to force SELECT the next time. */
-    }
-
-    sdsfree(cmd.io.buffer.ptr);
-    zfree(ov); zfree(kv); zfree(newargv);
-    return;
-
-/* On socket errors we try to close the cached socket and try again.
- * It is very common for the cached socket to get closed, if just reopening
- * it works it's a shame to notify the error to the caller. */
-socket_err:
-    /* Cleanup we want to perform in both the retry and no retry case.
-     * Note: Closing the migrate socket will also force SELECT next time. */
-    sdsfree(cmd.io.buffer.ptr);
-
-    /* If the command was rewritten as DEL and there was a socket error,
-     * we already closed the socket earlier. While migrateCloseSocket()
-     * is idempotent, the host/port arguments are now gone, so don't do it
-     * again. */
-    if (!argv_rewritten) migrateCloseSocket(c->argv[1],c->argv[2]);
-    zfree(newargv);
-    newargv = NULL; /* This will get reallocated on retry. */
-
-    /* Retry only if it's not a timeout and we never attempted a retry
-     * (or the code jumping here did not set may_retry to zero). */
-    if (errno != ETIMEDOUT && may_retry) {
-        may_retry = 0;
-        goto try_again;
-    }
-
-    /* Cleanup we want to do if no retry is attempted. */
-    zfree(ov); zfree(kv);
-    addReplySds(c,
-        sdscatprintf(sdsempty(),
-            "-IOERR error or timeout %s to target instance\r\n",
-            write_error ? "writing" : "reading"));
-    return;
-}
-
-/* -----------------------------------------------------------------------------
- * Cluster functions related to serving / redirecting clients
- * -------------------------------------------------------------------------- */
-
-/* The ASKING command is required after a -ASK redirection.
- * The client should issue ASKING before to actually send the command to
- * the target instance. See the Redis Cluster specification for more
- * information. */
-void askingCommand(client *c) {
-    if (server.cluster_enabled == 0) {
-        addReplyError(c,"This instance has cluster support disabled");
-        return;
-    }
-    c->flags |= CLIENT_ASKING;
-    addReply(c,shared.ok);
-}
-
-/* The READONLY command is used by clients to enter the read-only mode.
- * In this mode slaves will not redirect clients as long as clients access
- * with read-only commands to keys that are served by the slave's master. */
-void readonlyCommand(client *c) {
-    if (server.cluster_enabled == 0) {
-        addReplyError(c,"This instance has cluster support disabled");
-        return;
-    }
-    c->flags |= CLIENT_READONLY;
-    addReply(c,shared.ok);
-}
-
-/* The READWRITE command just clears the READONLY command state. */
-void readwriteCommand(client *c) {
-    c->flags &= ~CLIENT_READONLY;
-    addReply(c,shared.ok);
-}
-
-/* Return the pointer to the cluster node that is able to serve the command.
- * For the function to succeed the command should only target either:
- *
- * 1) A single key (even multiple times like LPOPRPUSH mylist mylist).
- * 2) Multiple keys in the same hash slot, while the slot is stable (no
- *    resharding in progress).
- *
- * On success the function returns the node that is able to serve the request.
- * If the node is not 'myself' a redirection must be performed. The kind of
- * redirection is specified setting the integer passed by reference
- * 'error_code', which will be set to CLUSTER_REDIR_ASK or
- * CLUSTER_REDIR_MOVED.
- *
- * When the node is 'myself' 'error_code' is set to CLUSTER_REDIR_NONE.
- *
- * If the command fails NULL is returned, and the reason of the failure is
- * provided via 'error_code', which will be set to:
- *
- * CLUSTER_REDIR_CROSS_SLOT if the request contains multiple keys that
- * don't belong to the same hash slot.
- *
- * CLUSTER_REDIR_UNSTABLE if the request contains multiple keys
- * belonging to the same slot, but the slot is not stable (in migration or
- * importing state, likely because a resharding is in progress).
- *
- * CLUSTER_REDIR_DOWN_UNBOUND if the request addresses a slot which is
- * not bound to any node. In this case the cluster global state should be
- * already "down" but it is fragile to rely on the update of the global state,
- * so we also handle it here.
- *
- * CLUSTER_REDIR_DOWN_STATE and CLUSTER_REDIR_DOWN_RO_STATE if the cluster is
- * down but the user attempts to execute a command that addresses one or more keys. */
-clusterNode *getNodeByQuery(client *c, struct redisCommand *cmd, robj **argv, int argc, int *hashslot, int *error_code) {
-    clusterNode *n = NULL;
-    robj *firstkey = NULL;
-    int multiple_keys = 0;
-    multiState *ms, _ms;
-    multiCmd mc;
-    int i, slot = 0, migrating_slot = 0, importing_slot = 0, missing_keys = 0;
-
-    /* Allow any key to be set if a module disabled cluster redirections. */
-    if (server.cluster_module_flags & CLUSTER_MODULE_FLAG_NO_REDIRECTION)
-        return myself;
-
-    /* Set error code optimistically for the base case. */
-    if (error_code) *error_code = CLUSTER_REDIR_NONE;
-
-    /* Modules can turn off Redis Cluster redirection: this is useful
-     * when writing a module that implements a completely different
-     * distributed system. */
-
-    /* We handle all the cases as if they were EXEC commands, so we have
-     * a common code path for everything */
-    if (cmd->proc == execCommand) {
-        /* If CLIENT_MULTI flag is not set EXEC is just going to return an
-         * error. */
-        if (!(c->flags & CLIENT_MULTI)) return myself;
-        ms = &c->mstate;
-    } else {
-        /* In order to have a single codepath create a fake Multi State
-         * structure if the client is not in MULTI/EXEC state, this way
-         * we have a single codepath below. */
-        ms = &_ms;
-        _ms.commands = &mc;
-        _ms.count = 1;
-        mc.argv = argv;
-        mc.argc = argc;
-        mc.cmd = cmd;
-    }
-
-    /* Check that all the keys are in the same hash slot, and obtain this
-     * slot and the node associated. */
-    for (i = 0; i < ms->count; i++) {
-        struct redisCommand *mcmd;
-        robj **margv;
-        int margc, *keyindex, numkeys, j;
-
-        mcmd = ms->commands[i].cmd;
-        margc = ms->commands[i].argc;
-        margv = ms->commands[i].argv;
-
-        getKeysResult result = GETKEYS_RESULT_INIT;
-        numkeys = getKeysFromCommand(mcmd,margv,margc,&result);
-        keyindex = result.keys;
-
-        for (j = 0; j < numkeys; j++) {
-            robj *thiskey = margv[keyindex[j]];
-            int thisslot = keyHashSlot((char*)thiskey->ptr,
-                                       sdslen(thiskey->ptr));
-
-            if (firstkey == NULL) {
-                /* This is the first key we see. Check what is the slot
-                 * and node. */
-                firstkey = thiskey;
-                slot = thisslot;
-                n = server.cluster->slots[slot];
-
-                /* Error: If a slot is not served, we are in "cluster down"
-                 * state. However the state is yet to be updated, so this was
-                 * not trapped earlier in processCommand(). Report the same
-                 * error to the client. */
-                if (n == NULL) {
-                    getKeysFreeResult(&result);
-                    if (error_code)
-                        *error_code = CLUSTER_REDIR_DOWN_UNBOUND;
-                    return NULL;
-                }
-
-                /* If we are migrating or importing this slot, we need to check
-                 * if we have all the keys in the request (the only way we
-                 * can safely serve the request, otherwise we return a TRYAGAIN
-                 * error). To do so we set the importing/migrating state and
-                 * increment a counter for every missing key. */
-                if (n == myself &&
-                    server.cluster->migrating_slots_to[slot] != NULL)
-                {
-                    migrating_slot = 1;
-                } else if (server.cluster->importing_slots_from[slot] != NULL) {
-                    importing_slot = 1;
-                }
-            } else {
-                /* If it is not the first key, make sure it is exactly
-                 * the same key as the first we saw. */
-                if (!equalStringObjects(firstkey,thiskey)) {
-                    if (slot != thisslot) {
-                        /* Error: multiple keys from different slots. */
-                        getKeysFreeResult(&result);
-                        if (error_code)
-                            *error_code = CLUSTER_REDIR_CROSS_SLOT;
-                        return NULL;
-                    } else {
-                        /* Flag this request as one with multiple different
-                         * keys. */
-                        multiple_keys = 1;
-                    }
-                }
-            }
-
-            /* Migrating / Importing slot? Count keys we don't have. */
-            if ((migrating_slot || importing_slot) &&
-                lookupKeyRead(&server.db[0],thiskey) == NULL)
-            {
-                missing_keys++;
-            }
-        }
-        getKeysFreeResult(&result);
-    }
-
-    /* No key at all in command? then we can serve the request
-     * without redirections or errors in all the cases. */
-    if (n == NULL) return myself;
-
-    /* Cluster is globally down but we got keys? We only serve the request
-     * if it is a read command and when allow_reads_when_down is enabled. */
-    if (server.cluster->state != CLUSTER_OK) {
-        if (!server.cluster_allow_reads_when_down) {
-            /* The cluster is configured to block commands when the
-             * cluster is down. */
-            if (error_code) *error_code = CLUSTER_REDIR_DOWN_STATE;
-            return NULL;
-        } else if (cmd->flags & CMD_WRITE) {
-            /* The cluster is configured to allow read only commands */
-            if (error_code) *error_code = CLUSTER_REDIR_DOWN_RO_STATE;
-            return NULL;
-        } else {
-            /* Fall through and allow the command to be executed:
-             * this happens when server.cluster_allow_reads_when_down is
-             * true and the command is not a write command */
-        }
-    }
-
-    /* Return the hashslot by reference. */
-    if (hashslot) *hashslot = slot;
-
-    /* MIGRATE always works in the context of the local node if the slot
-     * is open (migrating or importing state). We need to be able to freely
-     * move keys among instances in this case. */
-    if ((migrating_slot || importing_slot) && cmd->proc == migrateCommand)
-        return myself;
-
-    /* If we don't have all the keys and we are migrating the slot, send
-     * an ASK redirection. */
-    if (migrating_slot && missing_keys) {
-        if (error_code) *error_code = CLUSTER_REDIR_ASK;
-        return server.cluster->migrating_slots_to[slot];
-    }
-
-    /* If we are receiving the slot, and the client correctly flagged the
-     * request as "ASKING", we can serve the request. However if the request
-     * involves multiple keys and we don't have them all, the only option is
-     * to send a TRYAGAIN error. */
-    if (importing_slot &&
-        (c->flags & CLIENT_ASKING || cmd->flags & CMD_ASKING))
-    {
-        if (multiple_keys && missing_keys) {
-            if (error_code) *error_code = CLUSTER_REDIR_UNSTABLE;
-            return NULL;
-        } else {
-            return myself;
-        }
-    }
-
-    /* Handle the read-only client case reading from a slave: if this
-     * node is a slave and the request is about a hash slot our master
-     * is serving, we can reply without redirection. */
-    int is_write_command = (c->cmd->flags & CMD_WRITE) ||
-                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_WRITE));
-    if (c->flags & CLIENT_READONLY &&
-        !is_write_command &&
-        nodeIsSlave(myself) &&
-        myself->slaveof == n)
-    {
-        return myself;
-    }
-
-    /* Base case: just return the right node. However if this node is not
-     * myself, set error_code to MOVED since we need to issue a redirection. */
-    if (n != myself && error_code) *error_code = CLUSTER_REDIR_MOVED;
-    return n;
-}
-
-/* Send the client the right redirection code, according to error_code
- * that should be set to one of CLUSTER_REDIR_* macros.
- *
- * If CLUSTER_REDIR_ASK or CLUSTER_REDIR_MOVED error codes
- * are used, then the node 'n' should not be NULL, but should be the
- * node we want to mention in the redirection. Moreover hashslot should
- * be set to the hash slot that caused the redirection. */
-void clusterRedirectClient(client *c, clusterNode *n, int hashslot, int error_code) {
-    if (error_code == CLUSTER_REDIR_CROSS_SLOT) {
-        addReplyError(c,"-CROSSSLOT Keys in request don't hash to the same slot");
-    } else if (error_code == CLUSTER_REDIR_UNSTABLE) {
-        /* The request spawns multiple keys in the same slot,
-         * but the slot is not "stable" currently as there is
-         * a migration or import in progress. */
-        addReplyError(c,"-TRYAGAIN Multiple keys request during rehashing of slot");
-    } else if (error_code == CLUSTER_REDIR_DOWN_STATE) {
-        addReplyError(c,"-CLUSTERDOWN The cluster is down");
-    } else if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) {
-        addReplyError(c,"-CLUSTERDOWN The cluster is down and only accepts read commands");
-    } else if (error_code == CLUSTER_REDIR_DOWN_UNBOUND) {
-        addReplyError(c,"-CLUSTERDOWN Hash slot not served");
-    } else if (error_code == CLUSTER_REDIR_MOVED ||
-               error_code == CLUSTER_REDIR_ASK)
-    {
-        /* Redirect to IP:port. Include plaintext port if cluster is TLS but
-         * client is non-TLS. */
-        int use_pport = (server.tls_cluster &&
-                         c->conn && connGetType(c->conn) != CONN_TYPE_TLS);
-        int port = use_pport && n->pport ? n->pport : n->port;
-        addReplyErrorSds(c,sdscatprintf(sdsempty(),
-            "-%s %d %s:%d",
-            (error_code == CLUSTER_REDIR_ASK) ? "ASK" : "MOVED",
-            hashslot, n->ip, port));
-    } else {
-        serverPanic("getNodeByQuery() unknown error.");
-    }
-}
-
-/* This function is called by the function processing clients incrementally
- * to detect timeouts, in order to handle the following case:
- *
- * 1) A client blocks with BLPOP or similar blocking operation.
- * 2) The master migrates the hash slot elsewhere or turns into a slave.
- * 3) The client may remain blocked forever (or up to the max timeout time)
- *    waiting for a key change that will never happen.
- *
- * If the client is found to be blocked into a hash slot this node no
- * longer handles, the client is sent a redirection error, and the function
- * returns 1. Otherwise 0 is returned and no operation is performed. */
-int clusterRedirectBlockedClientIfNeeded(client *c) {
-    if (c->flags & CLIENT_BLOCKED &&
-        (c->btype == BLOCKED_LIST ||
-         c->btype == BLOCKED_ZSET ||
-         c->btype == BLOCKED_STREAM))
-    {
-        dictEntry *de;
-        dictIterator *di;
-
-        /* If the cluster is down, unblock the client with the right error.
-         * If the cluster is configured to allow reads on cluster down, we
-         * still want to emit this error since a write will be required
-         * to unblock them which may never come.  */
-        if (server.cluster->state == CLUSTER_FAIL) {
-            clusterRedirectClient(c,NULL,0,CLUSTER_REDIR_DOWN_STATE);
-            return 1;
-        }
-
-        /* All keys must belong to the same slot, so check first key only. */
-        di = dictGetIterator(c->bpop.keys);
-        if ((de = dictNext(di)) != NULL) {
-            robj *key = dictGetKey(de);
-            int slot = keyHashSlot((char*)key->ptr, sdslen(key->ptr));
-            clusterNode *node = server.cluster->slots[slot];
-
-            /* if the client is read-only and attempting to access key that our
-             * replica can handle, allow it. */
-            if ((c->flags & CLIENT_READONLY) &&
-                !(c->lastcmd->flags & CMD_WRITE) &&
-                nodeIsSlave(myself) && myself->slaveof == node)
-            {
-                node = myself;
-            }
-
-            /* We send an error and unblock the client if:
-             * 1) The slot is unassigned, emitting a cluster down error.
-             * 2) The slot is not handled by this node, nor being imported. */
-            if (node != myself &&
-                server.cluster->importing_slots_from[slot] == NULL)
-            {
-                if (node == NULL) {
-                    clusterRedirectClient(c,NULL,0,
-                        CLUSTER_REDIR_DOWN_UNBOUND);
-                } else {
-                    clusterRedirectClient(c,node,slot,
-                        CLUSTER_REDIR_MOVED);
-                }
-                dictReleaseIterator(di);
-                return 1;
-            }
-        }
-        dictReleaseIterator(di);
-    }
-    return 0;
-}
diff --git a/redis-stable/src/cluster.h b/redis-stable/src/cluster.h
deleted file mode 100644
index f476a50a..00000000
--- a/redis-stable/src/cluster.h
+++ /dev/null
@@ -1,296 +0,0 @@
-#ifndef __CLUSTER_H
-#define __CLUSTER_H
-
-/*-----------------------------------------------------------------------------
- * Redis cluster data structures, defines, exported API.
- *----------------------------------------------------------------------------*/
-
-#define CLUSTER_SLOTS 16384
-#define CLUSTER_OK 0          /* Everything looks ok */
-#define CLUSTER_FAIL 1        /* The cluster can't work */
-#define CLUSTER_NAMELEN 40    /* sha1 hex length */
-#define CLUSTER_PORT_INCR 10000 /* Cluster port = baseport + PORT_INCR */
-
-/* The following defines are amount of time, sometimes expressed as
- * multiplicators of the node timeout value (when ending with MULT). */
-#define CLUSTER_FAIL_REPORT_VALIDITY_MULT 2 /* Fail report validity. */
-#define CLUSTER_FAIL_UNDO_TIME_MULT 2 /* Undo fail if master is back. */
-#define CLUSTER_FAIL_UNDO_TIME_ADD 10 /* Some additional time. */
-#define CLUSTER_FAILOVER_DELAY 5 /* Seconds */
-#define CLUSTER_MF_TIMEOUT 5000 /* Milliseconds to do a manual failover. */
-#define CLUSTER_MF_PAUSE_MULT 2 /* Master pause manual failover mult. */
-#define CLUSTER_SLAVE_MIGRATION_DELAY 5000 /* Delay for slave migration. */
-
-/* Redirection errors returned by getNodeByQuery(). */
-#define CLUSTER_REDIR_NONE 0          /* Node can serve the request. */
-#define CLUSTER_REDIR_CROSS_SLOT 1    /* -CROSSSLOT request. */
-#define CLUSTER_REDIR_UNSTABLE 2      /* -TRYAGAIN redirection required */
-#define CLUSTER_REDIR_ASK 3           /* -ASK redirection required. */
-#define CLUSTER_REDIR_MOVED 4         /* -MOVED redirection required. */
-#define CLUSTER_REDIR_DOWN_STATE 5    /* -CLUSTERDOWN, global state. */
-#define CLUSTER_REDIR_DOWN_UNBOUND 6  /* -CLUSTERDOWN, unbound slot. */
-#define CLUSTER_REDIR_DOWN_RO_STATE 7 /* -CLUSTERDOWN, allow reads. */
-
-struct clusterNode;
-
-/* clusterLink encapsulates everything needed to talk with a remote node. */
-typedef struct clusterLink {
-    mstime_t ctime;             /* Link creation time */
-    connection *conn;           /* Connection to remote node */
-    sds sndbuf;                 /* Packet send buffer */
-    char *rcvbuf;               /* Packet reception buffer */
-    size_t rcvbuf_len;          /* Used size of rcvbuf */
-    size_t rcvbuf_alloc;        /* Allocated size of rcvbuf */
-    struct clusterNode *node;   /* Node related to this link if any, or NULL */
-} clusterLink;
-
-/* Cluster node flags and macros. */
-#define CLUSTER_NODE_MASTER 1     /* The node is a master */
-#define CLUSTER_NODE_SLAVE 2      /* The node is a slave */
-#define CLUSTER_NODE_PFAIL 4      /* Failure? Need acknowledge */
-#define CLUSTER_NODE_FAIL 8       /* The node is believed to be malfunctioning */
-#define CLUSTER_NODE_MYSELF 16    /* This node is myself */
-#define CLUSTER_NODE_HANDSHAKE 32 /* We have still to exchange the first ping */
-#define CLUSTER_NODE_NOADDR   64  /* We don't know the address of this node */
-#define CLUSTER_NODE_MEET 128     /* Send a MEET message to this node */
-#define CLUSTER_NODE_MIGRATE_TO 256 /* Master eligible for replica migration. */
-#define CLUSTER_NODE_NOFAILOVER 512 /* Slave will not try to failover. */
-#define CLUSTER_NODE_NULL_NAME "\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000"
-
-#define nodeIsMaster(n) ((n)->flags & CLUSTER_NODE_MASTER)
-#define nodeIsSlave(n) ((n)->flags & CLUSTER_NODE_SLAVE)
-#define nodeInHandshake(n) ((n)->flags & CLUSTER_NODE_HANDSHAKE)
-#define nodeHasAddr(n) (!((n)->flags & CLUSTER_NODE_NOADDR))
-#define nodeWithoutAddr(n) ((n)->flags & CLUSTER_NODE_NOADDR)
-#define nodeTimedOut(n) ((n)->flags & CLUSTER_NODE_PFAIL)
-#define nodeFailed(n) ((n)->flags & CLUSTER_NODE_FAIL)
-#define nodeCantFailover(n) ((n)->flags & CLUSTER_NODE_NOFAILOVER)
-
-/* Reasons why a slave is not able to failover. */
-#define CLUSTER_CANT_FAILOVER_NONE 0
-#define CLUSTER_CANT_FAILOVER_DATA_AGE 1
-#define CLUSTER_CANT_FAILOVER_WAITING_DELAY 2
-#define CLUSTER_CANT_FAILOVER_EXPIRED 3
-#define CLUSTER_CANT_FAILOVER_WAITING_VOTES 4
-#define CLUSTER_CANT_FAILOVER_RELOG_PERIOD (60*5) /* seconds. */
-
-/* clusterState todo_before_sleep flags. */
-#define CLUSTER_TODO_HANDLE_FAILOVER (1<<0)
-#define CLUSTER_TODO_UPDATE_STATE (1<<1)
-#define CLUSTER_TODO_SAVE_CONFIG (1<<2)
-#define CLUSTER_TODO_FSYNC_CONFIG (1<<3)
-#define CLUSTER_TODO_HANDLE_MANUALFAILOVER (1<<4)
-
-/* Message types.
- *
- * Note that the PING, PONG and MEET messages are actually the same exact
- * kind of packet. PONG is the reply to ping, in the exact format as a PING,
- * while MEET is a special PING that forces the receiver to add the sender
- * as a node (if it is not already in the list). */
-#define CLUSTERMSG_TYPE_PING 0          /* Ping */
-#define CLUSTERMSG_TYPE_PONG 1          /* Pong (reply to Ping) */
-#define CLUSTERMSG_TYPE_MEET 2          /* Meet "let's join" message */
-#define CLUSTERMSG_TYPE_FAIL 3          /* Mark node xxx as failing */
-#define CLUSTERMSG_TYPE_PUBLISH 4       /* Pub/Sub Publish propagation */
-#define CLUSTERMSG_TYPE_FAILOVER_AUTH_REQUEST 5 /* May I failover? */
-#define CLUSTERMSG_TYPE_FAILOVER_AUTH_ACK 6     /* Yes, you have my vote */
-#define CLUSTERMSG_TYPE_UPDATE 7        /* Another node slots configuration */
-#define CLUSTERMSG_TYPE_MFSTART 8       /* Pause clients for manual failover */
-#define CLUSTERMSG_TYPE_MODULE 9        /* Module cluster API message. */
-#define CLUSTERMSG_TYPE_COUNT 10        /* Total number of message types. */
-
-/* Flags that a module can set in order to prevent certain Redis Cluster
- * features to be enabled. Useful when implementing a different distributed
- * system on top of Redis Cluster message bus, using modules. */
-#define CLUSTER_MODULE_FLAG_NONE 0
-#define CLUSTER_MODULE_FLAG_NO_FAILOVER (1<<1)
-#define CLUSTER_MODULE_FLAG_NO_REDIRECTION (1<<2)
-
-/* This structure represent elements of node->fail_reports. */
-typedef struct clusterNodeFailReport {
-    struct clusterNode *node;  /* Node reporting the failure condition. */
-    mstime_t time;             /* Time of the last report from this node. */
-} clusterNodeFailReport;
-
-typedef struct clusterNode {
-    mstime_t ctime; /* Node object creation time. */
-    char name[CLUSTER_NAMELEN]; /* Node name, hex string, sha1-size */
-    int flags;      /* CLUSTER_NODE_... */
-    uint64_t configEpoch; /* Last configEpoch observed for this node */
-    unsigned char slots[CLUSTER_SLOTS/8]; /* slots handled by this node */
-    sds slots_info; /* Slots info represented by string. */
-    int numslots;   /* Number of slots handled by this node */
-    int numslaves;  /* Number of slave nodes, if this is a master */
-    struct clusterNode **slaves; /* pointers to slave nodes */
-    struct clusterNode *slaveof; /* pointer to the master node. Note that it
-                                    may be NULL even if the node is a slave
-                                    if we don't have the master node in our
-                                    tables. */
-    mstime_t ping_sent;      /* Unix time we sent latest ping */
-    mstime_t pong_received;  /* Unix time we received the pong */
-    mstime_t data_received;  /* Unix time we received any data */
-    mstime_t fail_time;      /* Unix time when FAIL flag was set */
-    mstime_t voted_time;     /* Last time we voted for a slave of this master */
-    mstime_t repl_offset_time;  /* Unix time we received offset for this node */
-    mstime_t orphaned_time;     /* Starting time of orphaned master condition */
-    long long repl_offset;      /* Last known repl offset for this node. */
-    char ip[NET_IP_STR_LEN];  /* Latest known IP address of this node */
-    int port;                   /* Latest known clients port (TLS or plain). */
-    int pport;                  /* Latest known clients plaintext port. Only used
-                                   if the main clients port is for TLS. */
-    int cport;                  /* Latest known cluster port of this node. */
-    clusterLink *link;          /* TCP/IP link with this node */
-    list *fail_reports;         /* List of nodes signaling this as failing */
-} clusterNode;
-
-typedef struct clusterState {
-    clusterNode *myself;  /* This node */
-    uint64_t currentEpoch;
-    int state;            /* CLUSTER_OK, CLUSTER_FAIL, ... */
-    int size;             /* Num of master nodes with at least one slot */
-    dict *nodes;          /* Hash table of name -> clusterNode structures */
-    dict *nodes_black_list; /* Nodes we don't re-add for a few seconds. */
-    clusterNode *migrating_slots_to[CLUSTER_SLOTS];
-    clusterNode *importing_slots_from[CLUSTER_SLOTS];
-    clusterNode *slots[CLUSTER_SLOTS];
-    uint64_t slots_keys_count[CLUSTER_SLOTS];
-    rax *slots_to_keys;
-    /* The following fields are used to take the slave state on elections. */
-    mstime_t failover_auth_time; /* Time of previous or next election. */
-    int failover_auth_count;    /* Number of votes received so far. */
-    int failover_auth_sent;     /* True if we already asked for votes. */
-    int failover_auth_rank;     /* This slave rank for current auth request. */
-    uint64_t failover_auth_epoch; /* Epoch of the current election. */
-    int cant_failover_reason;   /* Why a slave is currently not able to
-                                   failover. See the CANT_FAILOVER_* macros. */
-    /* Manual failover state in common. */
-    mstime_t mf_end;            /* Manual failover time limit (ms unixtime).
-                                   It is zero if there is no MF in progress. */
-    /* Manual failover state of master. */
-    clusterNode *mf_slave;      /* Slave performing the manual failover. */
-    /* Manual failover state of slave. */
-    long long mf_master_offset; /* Master offset the slave needs to start MF
-                                   or -1 if still not received. */
-    int mf_can_start;           /* If non-zero signal that the manual failover
-                                   can start requesting masters vote. */
-    /* The following fields are used by masters to take state on elections. */
-    uint64_t lastVoteEpoch;     /* Epoch of the last vote granted. */
-    int todo_before_sleep; /* Things to do in clusterBeforeSleep(). */
-    /* Messages received and sent by type. */
-    long long stats_bus_messages_sent[CLUSTERMSG_TYPE_COUNT];
-    long long stats_bus_messages_received[CLUSTERMSG_TYPE_COUNT];
-    long long stats_pfail_nodes;    /* Number of nodes in PFAIL status,
-                                       excluding nodes without address. */
-} clusterState;
-
-/* Redis cluster messages header */
-
-/* Initially we don't know our "name", but we'll find it once we connect
- * to the first node, using the getsockname() function. Then we'll use this
- * address for all the next messages. */
-typedef struct {
-    char nodename[CLUSTER_NAMELEN];
-    uint32_t ping_sent;
-    uint32_t pong_received;
-    char ip[NET_IP_STR_LEN];  /* IP address last time it was seen */
-    uint16_t port;              /* base port last time it was seen */
-    uint16_t cport;             /* cluster port last time it was seen */
-    uint16_t flags;             /* node->flags copy */
-    uint16_t pport;             /* plaintext-port, when base port is TLS */
-    uint16_t notused1;
-} clusterMsgDataGossip;
-
-typedef struct {
-    char nodename[CLUSTER_NAMELEN];
-} clusterMsgDataFail;
-
-typedef struct {
-    uint32_t channel_len;
-    uint32_t message_len;
-    unsigned char bulk_data[8]; /* 8 bytes just as placeholder. */
-} clusterMsgDataPublish;
-
-typedef struct {
-    uint64_t configEpoch; /* Config epoch of the specified instance. */
-    char nodename[CLUSTER_NAMELEN]; /* Name of the slots owner. */
-    unsigned char slots[CLUSTER_SLOTS/8]; /* Slots bitmap. */
-} clusterMsgDataUpdate;
-
-typedef struct {
-    uint64_t module_id;     /* ID of the sender module. */
-    uint32_t len;           /* ID of the sender module. */
-    uint8_t type;           /* Type from 0 to 255. */
-    unsigned char bulk_data[3]; /* 3 bytes just as placeholder. */
-} clusterMsgModule;
-
-union clusterMsgData {
-    /* PING, MEET and PONG */
-    struct {
-        /* Array of N clusterMsgDataGossip structures */
-        clusterMsgDataGossip gossip[1];
-    } ping;
-
-    /* FAIL */
-    struct {
-        clusterMsgDataFail about;
-    } fail;
-
-    /* PUBLISH */
-    struct {
-        clusterMsgDataPublish msg;
-    } publish;
-
-    /* UPDATE */
-    struct {
-        clusterMsgDataUpdate nodecfg;
-    } update;
-
-    /* MODULE */
-    struct {
-        clusterMsgModule msg;
-    } module;
-};
-
-#define CLUSTER_PROTO_VER 1 /* Cluster bus protocol version. */
-
-typedef struct {
-    char sig[4];        /* Signature "RCmb" (Redis Cluster message bus). */
-    uint32_t totlen;    /* Total length of this message */
-    uint16_t ver;       /* Protocol version, currently set to 1. */
-    uint16_t port;      /* TCP base port number. */
-    uint16_t type;      /* Message type */
-    uint16_t count;     /* Only used for some kind of messages. */
-    uint64_t currentEpoch;  /* The epoch accordingly to the sending node. */
-    uint64_t configEpoch;   /* The config epoch if it's a master, or the last
-                               epoch advertised by its master if it is a
-                               slave. */
-    uint64_t offset;    /* Master replication offset if node is a master or
-                           processed replication offset if node is a slave. */
-    char sender[CLUSTER_NAMELEN]; /* Name of the sender node */
-    unsigned char myslots[CLUSTER_SLOTS/8];
-    char slaveof[CLUSTER_NAMELEN];
-    char myip[NET_IP_STR_LEN];    /* Sender IP, if not all zeroed. */
-    char notused1[32];  /* 32 bytes reserved for future usage. */
-    uint16_t pport;      /* Sender TCP plaintext port, if base port is TLS */
-    uint16_t cport;      /* Sender TCP cluster bus port */
-    uint16_t flags;      /* Sender node flags */
-    unsigned char state; /* Cluster state from the POV of the sender */
-    unsigned char mflags[3]; /* Message flags: CLUSTERMSG_FLAG[012]_... */
-    union clusterMsgData data;
-} clusterMsg;
-
-#define CLUSTERMSG_MIN_LEN (sizeof(clusterMsg)-sizeof(union clusterMsgData))
-
-/* Message flags better specify the packet content or are used to
- * provide some information about the node state. */
-#define CLUSTERMSG_FLAG0_PAUSED (1<<0) /* Master paused for manual failover. */
-#define CLUSTERMSG_FLAG0_FORCEACK (1<<1) /* Give ACK to AUTH_REQUEST even if
-                                            master is up. */
-
-/* ---------------------- API exported outside cluster.c -------------------- */
-clusterNode *getNodeByQuery(client *c, struct redisCommand *cmd, robj **argv, int argc, int *hashslot, int *ask);
-int clusterRedirectBlockedClientIfNeeded(client *c);
-void clusterRedirectClient(client *c, clusterNode *n, int hashslot, int error_code);
-unsigned long getClusterConnectionsCount(void);
-
-#endif /* __CLUSTER_H */
diff --git a/redis-stable/src/config.c b/redis-stable/src/config.c
deleted file mode 100644
index e0eec2f6..00000000
--- a/redis-stable/src/config.c
+++ /dev/null
@@ -1,2624 +0,0 @@
-/* Configuration file parsing and CONFIG GET/SET commands implementation.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "cluster.h"
-
-#include <fcntl.h>
-#include <sys/stat.h>
-
-/*-----------------------------------------------------------------------------
- * Config file name-value maps.
- *----------------------------------------------------------------------------*/
-
-typedef struct configEnum {
-    const char *name;
-    const int val;
-} configEnum;
-
-configEnum maxmemory_policy_enum[] = {
-    {"volatile-lru", MAXMEMORY_VOLATILE_LRU},
-    {"volatile-lfu", MAXMEMORY_VOLATILE_LFU},
-    {"volatile-random",MAXMEMORY_VOLATILE_RANDOM},
-    {"volatile-ttl",MAXMEMORY_VOLATILE_TTL},
-    {"allkeys-lru",MAXMEMORY_ALLKEYS_LRU},
-    {"allkeys-lfu",MAXMEMORY_ALLKEYS_LFU},
-    {"allkeys-random",MAXMEMORY_ALLKEYS_RANDOM},
-    {"noeviction",MAXMEMORY_NO_EVICTION},
-    {NULL, 0}
-};
-
-configEnum syslog_facility_enum[] = {
-    {"user",    LOG_USER},
-    {"local0",  LOG_LOCAL0},
-    {"local1",  LOG_LOCAL1},
-    {"local2",  LOG_LOCAL2},
-    {"local3",  LOG_LOCAL3},
-    {"local4",  LOG_LOCAL4},
-    {"local5",  LOG_LOCAL5},
-    {"local6",  LOG_LOCAL6},
-    {"local7",  LOG_LOCAL7},
-    {NULL, 0}
-};
-
-configEnum loglevel_enum[] = {
-    {"debug", LL_DEBUG},
-    {"verbose", LL_VERBOSE},
-    {"notice", LL_NOTICE},
-    {"warning", LL_WARNING},
-    {NULL,0}
-};
-
-configEnum supervised_mode_enum[] = {
-    {"upstart", SUPERVISED_UPSTART},
-    {"systemd", SUPERVISED_SYSTEMD},
-    {"auto", SUPERVISED_AUTODETECT},
-    {"no", SUPERVISED_NONE},
-    {NULL, 0}
-};
-
-configEnum aof_fsync_enum[] = {
-    {"everysec", AOF_FSYNC_EVERYSEC},
-    {"always", AOF_FSYNC_ALWAYS},
-    {"no", AOF_FSYNC_NO},
-    {NULL, 0}
-};
-
-configEnum repl_diskless_load_enum[] = {
-    {"disabled", REPL_DISKLESS_LOAD_DISABLED},
-    {"on-empty-db", REPL_DISKLESS_LOAD_WHEN_DB_EMPTY},
-    {"swapdb", REPL_DISKLESS_LOAD_SWAPDB},
-    {NULL, 0}
-};
-
-configEnum tls_auth_clients_enum[] = {
-    {"no", TLS_CLIENT_AUTH_NO},
-    {"yes", TLS_CLIENT_AUTH_YES},
-    {"optional", TLS_CLIENT_AUTH_OPTIONAL},
-    {NULL, 0}
-};
-
-configEnum oom_score_adj_enum[] = {
-    {"no", OOM_SCORE_ADJ_NO},
-    {"yes", OOM_SCORE_RELATIVE},
-    {"relative", OOM_SCORE_RELATIVE},
-    {"absolute", OOM_SCORE_ADJ_ABSOLUTE},
-    {NULL, 0}
-};
-
-configEnum acl_pubsub_default_enum[] = {
-    {"allchannels", USER_FLAG_ALLCHANNELS},
-    {"resetchannels", 0},
-    {NULL, 0}
-};
-
-configEnum sanitize_dump_payload_enum[] = {
-    {"no", SANITIZE_DUMP_NO},
-    {"yes", SANITIZE_DUMP_YES},
-    {"clients", SANITIZE_DUMP_CLIENTS},
-    {NULL, 0}
-};
-
-/* Output buffer limits presets. */
-clientBufferLimitsConfig clientBufferLimitsDefaults[CLIENT_TYPE_OBUF_COUNT] = {
-    {0, 0, 0}, /* normal */
-    {1024*1024*256, 1024*1024*64, 60}, /* slave */
-    {1024*1024*32, 1024*1024*8, 60}  /* pubsub */
-};
-
-/* OOM Score defaults */
-int configOOMScoreAdjValuesDefaults[CONFIG_OOM_COUNT] = { 0, 200, 800 };
-
-/* Generic config infrastructure function pointers
- * int is_valid_fn(val, err)
- *     Return 1 when val is valid, and 0 when invalid.
- *     Optionally set err to a static error string.
- * int update_fn(val, prev, err)
- *     This function is called only for CONFIG SET command (not at config file parsing)
- *     It is called after the actual config is applied,
- *     Return 1 for success, and 0 for failure.
- *     Optionally set err to a static error string.
- *     On failure the config change will be reverted.
- */
-
-/* Configuration values that require no special handling to set, get, load or
- * rewrite. */
-typedef struct boolConfigData {
-    int *config; /* The pointer to the server config this value is stored in */
-    const int default_value; /* The default value of the config on rewrite */
-    int (*is_valid_fn)(int val, const char **err); /* Optional function to check validity of new value (generic doc above) */
-    int (*update_fn)(int val, int prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
-} boolConfigData;
-
-typedef struct stringConfigData {
-    char **config; /* Pointer to the server config this value is stored in. */
-    const char *default_value; /* Default value of the config on rewrite. */
-    int (*is_valid_fn)(char* val, const char **err); /* Optional function to check validity of new value (generic doc above) */
-    int (*update_fn)(char* val, char* prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
-    int convert_empty_to_null; /* Boolean indicating if empty strings should
-                                  be stored as a NULL value. */
-} stringConfigData;
-
-typedef struct sdsConfigData {
-    sds *config; /* Pointer to the server config this value is stored in. */
-    const char *default_value; /* Default value of the config on rewrite. */
-    int (*is_valid_fn)(sds val, const char **err); /* Optional function to check validity of new value (generic doc above) */
-    int (*update_fn)(sds val, sds prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
-    int convert_empty_to_null; /* Boolean indicating if empty SDS strings should
-                                  be stored as a NULL value. */
-} sdsConfigData;
-
-typedef struct enumConfigData {
-    int *config; /* The pointer to the server config this value is stored in */
-    configEnum *enum_value; /* The underlying enum type this data represents */
-    const int default_value; /* The default value of the config on rewrite */
-    int (*is_valid_fn)(int val, const char **err); /* Optional function to check validity of new value (generic doc above) */
-    int (*update_fn)(int val, int prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
-} enumConfigData;
-
-typedef enum numericType {
-    NUMERIC_TYPE_INT,
-    NUMERIC_TYPE_UINT,
-    NUMERIC_TYPE_LONG,
-    NUMERIC_TYPE_ULONG,
-    NUMERIC_TYPE_LONG_LONG,
-    NUMERIC_TYPE_ULONG_LONG,
-    NUMERIC_TYPE_SIZE_T,
-    NUMERIC_TYPE_SSIZE_T,
-    NUMERIC_TYPE_OFF_T,
-    NUMERIC_TYPE_TIME_T,
-} numericType;
-
-typedef struct numericConfigData {
-    union {
-        int *i;
-        unsigned int *ui;
-        long *l;
-        unsigned long *ul;
-        long long *ll;
-        unsigned long long *ull;
-        size_t *st;
-        ssize_t *sst;
-        off_t *ot;
-        time_t *tt;
-    } config; /* The pointer to the numeric config this value is stored in */
-    int is_memory; /* Indicates if this value can be loaded as a memory value */
-    numericType numeric_type; /* An enum indicating the type of this value */
-    long long lower_bound; /* The lower bound of this numeric value */
-    long long upper_bound; /* The upper bound of this numeric value */
-    const long long default_value; /* The default value of the config on rewrite */
-    int (*is_valid_fn)(long long val, const char **err); /* Optional function to check validity of new value (generic doc above) */
-    int (*update_fn)(long long val, long long prev, const char **err); /* Optional function to apply new value at runtime (generic doc above) */
-} numericConfigData;
-
-typedef union typeData {
-    boolConfigData yesno;
-    stringConfigData string;
-    sdsConfigData sds;
-    enumConfigData enumd;
-    numericConfigData numeric;
-} typeData;
-
-typedef struct typeInterface {
-    /* Called on server start, to init the server with default value */
-    void (*init)(typeData data);
-    /* Called on server startup and CONFIG SET, returns 1 on success, 0 on error
-     * and can set a verbose err string, update is true when called from CONFIG SET */
-    int (*set)(typeData data, sds value, int update, const char **err);
-    /* Called on CONFIG GET, required to add output to the client */
-    void (*get)(client *c, typeData data);
-    /* Called on CONFIG REWRITE, required to rewrite the config state */
-    void (*rewrite)(typeData data, const char *name, struct rewriteConfigState *state);
-} typeInterface;
-
-typedef struct standardConfig {
-    const char *name; /* The user visible name of this config */
-    const char *alias; /* An alias that can also be used for this config */
-    const unsigned int flags; /* Flags for this specific config */
-    typeInterface interface; /* The function pointers that define the type interface */
-    typeData data; /* The type specific data exposed used by the interface */
-} standardConfig;
-
-#define MODIFIABLE_CONFIG 0 /* This is the implied default for a standard 
-                             * config, which is mutable. */
-#define IMMUTABLE_CONFIG (1ULL<<0) /* Can this value only be set at startup? */
-#define SENSITIVE_CONFIG (1ULL<<1) /* Does this value contain sensitive information */
-
-standardConfig configs[];
-
-/*-----------------------------------------------------------------------------
- * Enum access functions
- *----------------------------------------------------------------------------*/
-
-/* Get enum value from name. If there is no match INT_MIN is returned. */
-int configEnumGetValue(configEnum *ce, char *name) {
-    while(ce->name != NULL) {
-        if (!strcasecmp(ce->name,name)) return ce->val;
-        ce++;
-    }
-    return INT_MIN;
-}
-
-/* Get enum name from value. If no match is found NULL is returned. */
-const char *configEnumGetName(configEnum *ce, int val) {
-    while(ce->name != NULL) {
-        if (ce->val == val) return ce->name;
-        ce++;
-    }
-    return NULL;
-}
-
-/* Wrapper for configEnumGetName() returning "unknown" instead of NULL if
- * there is no match. */
-const char *configEnumGetNameOrUnknown(configEnum *ce, int val) {
-    const char *name = configEnumGetName(ce,val);
-    return name ? name : "unknown";
-}
-
-/* Used for INFO generation. */
-const char *evictPolicyToString(void) {
-    return configEnumGetNameOrUnknown(maxmemory_policy_enum,server.maxmemory_policy);
-}
-
-/*-----------------------------------------------------------------------------
- * Config file parsing
- *----------------------------------------------------------------------------*/
-
-int yesnotoi(char *s) {
-    if (!strcasecmp(s,"yes")) return 1;
-    else if (!strcasecmp(s,"no")) return 0;
-    else return -1;
-}
-
-void appendServerSaveParams(time_t seconds, int changes) {
-    server.saveparams = zrealloc(server.saveparams,sizeof(struct saveparam)*(server.saveparamslen+1));
-    server.saveparams[server.saveparamslen].seconds = seconds;
-    server.saveparams[server.saveparamslen].changes = changes;
-    server.saveparamslen++;
-}
-
-void resetServerSaveParams(void) {
-    zfree(server.saveparams);
-    server.saveparams = NULL;
-    server.saveparamslen = 0;
-}
-
-void queueLoadModule(sds path, sds *argv, int argc) {
-    int i;
-    struct moduleLoadQueueEntry *loadmod;
-
-    loadmod = zmalloc(sizeof(struct moduleLoadQueueEntry));
-    loadmod->argv = zmalloc(sizeof(robj*)*argc);
-    loadmod->path = sdsnew(path);
-    loadmod->argc = argc;
-    for (i = 0; i < argc; i++) {
-        loadmod->argv[i] = createRawStringObject(argv[i],sdslen(argv[i]));
-    }
-    listAddNodeTail(server.loadmodule_queue,loadmod);
-}
-
-/* Parse an array of CONFIG_OOM_COUNT sds strings, validate and populate
- * server.oom_score_adj_values if valid.
- */
-
-static int updateOOMScoreAdjValues(sds *args, const char **err, int apply) {
-    int i;
-    int values[CONFIG_OOM_COUNT];
-
-    for (i = 0; i < CONFIG_OOM_COUNT; i++) {
-        char *eptr;
-        long long val = strtoll(args[i], &eptr, 10);
-
-        if (*eptr != '\0' || val < -2000 || val > 2000) {
-            if (err) *err = "Invalid oom-score-adj-values, elements must be between -2000 and 2000.";
-            return C_ERR;
-        }
-
-        values[i] = val;
-    }
-
-    /* Verify that the values make sense. If they don't omit a warning but
-     * keep the configuration, which may still be valid for privileged processes.
-     */
-
-    if (values[CONFIG_OOM_REPLICA] < values[CONFIG_OOM_MASTER] ||
-        values[CONFIG_OOM_BGCHILD] < values[CONFIG_OOM_REPLICA]) {
-            serverLog(LOG_WARNING,
-                    "The oom-score-adj-values configuration may not work for non-privileged processes! "
-                    "Please consult the documentation.");
-    }
-
-    /* Store values, retain previous config for rollback in case we fail. */
-    int old_values[CONFIG_OOM_COUNT];
-    for (i = 0; i < CONFIG_OOM_COUNT; i++) {
-        old_values[i] = server.oom_score_adj_values[i];
-        server.oom_score_adj_values[i] = values[i];
-    }
-    
-    /* When parsing the config file, we want to apply only when all is done. */
-    if (!apply)
-        return C_OK;
-
-    /* Update */
-    if (setOOMScoreAdj(-1) == C_ERR) {
-        /* Roll back */
-        for (i = 0; i < CONFIG_OOM_COUNT; i++)
-            server.oom_score_adj_values[i] = old_values[i];
-
-        if (err)
-            *err = "Failed to apply oom-score-adj-values configuration, check server logs.";
-
-        return C_ERR;
-    }
-
-    return C_OK;
-}
-
-void initConfigValues() {
-    for (standardConfig *config = configs; config->name != NULL; config++) {
-        config->interface.init(config->data);
-    }
-}
-
-void loadServerConfigFromString(char *config) {
-    const char *err = NULL;
-    int linenum = 0, totlines, i;
-    int slaveof_linenum = 0;
-    sds *lines;
-    int save_loaded = 0;
-
-    lines = sdssplitlen(config,strlen(config),"\n",1,&totlines);
-
-    for (i = 0; i < totlines; i++) {
-        sds *argv;
-        int argc;
-
-        linenum = i+1;
-        lines[i] = sdstrim(lines[i]," \t\r\n");
-
-        /* Skip comments and blank lines */
-        if (lines[i][0] == '#' || lines[i][0] == '\0') continue;
-
-        /* Split into arguments */
-        argv = sdssplitargs(lines[i],&argc);
-        if (argv == NULL) {
-            err = "Unbalanced quotes in configuration line";
-            goto loaderr;
-        }
-
-        /* Skip this line if the resulting command vector is empty. */
-        if (argc == 0) {
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-        sdstolower(argv[0]);
-
-        /* Iterate the configs that are standard */
-        int match = 0;
-        for (standardConfig *config = configs; config->name != NULL; config++) {
-            if ((!strcasecmp(argv[0],config->name) ||
-                (config->alias && !strcasecmp(argv[0],config->alias))))
-            {
-                if (argc != 2) {
-                    err = "wrong number of arguments";
-                    goto loaderr;
-                }
-                if (!config->interface.set(config->data, argv[1], 0, &err)) {
-                    goto loaderr;
-                }
-
-                match = 1;
-                break;
-            }
-        }
-
-        if (match) {
-            sdsfreesplitres(argv,argc);
-            continue;
-        }
-
-        /* Execute config directives */
-        if (!strcasecmp(argv[0],"bind") && argc >= 2) {
-            int j, addresses = argc-1;
-
-            if (addresses > CONFIG_BINDADDR_MAX) {
-                err = "Too many bind addresses specified"; goto loaderr;
-            }
-            /* Free old bind addresses */
-            for (j = 0; j < server.bindaddr_count; j++) {
-                zfree(server.bindaddr[j]);
-            }
-            for (j = 0; j < addresses; j++)
-                server.bindaddr[j] = zstrdup(argv[j+1]);
-            server.bindaddr_count = addresses;
-        } else if (!strcasecmp(argv[0],"unixsocketperm") && argc == 2) {
-            errno = 0;
-            server.unixsocketperm = (mode_t)strtol(argv[1], NULL, 8);
-            if (errno || server.unixsocketperm > 0777) {
-                err = "Invalid socket file permissions"; goto loaderr;
-            }
-        } else if (!strcasecmp(argv[0],"save")) {
-            /* We don't reset save params before loading, because if they're not part
-             * of the file the defaults should be used.
-             */
-            if (!save_loaded) {
-                save_loaded = 1;
-                resetServerSaveParams();
-            }
-
-            if (argc == 3) {
-                int seconds = atoi(argv[1]);
-                int changes = atoi(argv[2]);
-                if (seconds < 1 || changes < 0) {
-                    err = "Invalid save parameters"; goto loaderr;
-                }
-                appendServerSaveParams(seconds,changes);
-            } else if (argc == 2 && !strcasecmp(argv[1],"")) {
-                resetServerSaveParams();
-            }
-        } else if (!strcasecmp(argv[0],"dir") && argc == 2) {
-            if (chdir(argv[1]) == -1) {
-                serverLog(LL_WARNING,"Can't chdir to '%s': %s",
-                    argv[1], strerror(errno));
-                exit(1);
-            }
-        } else if (!strcasecmp(argv[0],"logfile") && argc == 2) {
-            FILE *logfp;
-
-            zfree(server.logfile);
-            server.logfile = zstrdup(argv[1]);
-            if (server.logfile[0] != '\0') {
-                /* Test if we are able to open the file. The server will not
-                 * be able to abort just for this problem later... */
-                logfp = fopen(server.logfile,"a");
-                if (logfp == NULL) {
-                    err = sdscatprintf(sdsempty(),
-                        "Can't open the log file: %s", strerror(errno));
-                    goto loaderr;
-                }
-                fclose(logfp);
-            }
-        } else if (!strcasecmp(argv[0],"include") && argc == 2) {
-            loadServerConfig(argv[1], 0, NULL);
-        } else if ((!strcasecmp(argv[0],"slaveof") ||
-                    !strcasecmp(argv[0],"replicaof")) && argc == 3) {
-            slaveof_linenum = linenum;
-            sdsfree(server.masterhost);
-            if (!strcasecmp(argv[1], "no") && !strcasecmp(argv[2], "one")) {
-                server.masterhost = NULL;
-                continue;
-            }
-            server.masterhost = sdsnew(argv[1]);
-            char *ptr;
-            server.masterport = strtol(argv[2], &ptr, 10);
-            if (server.masterport < 0 || server.masterport > 65535 || *ptr != '\0') {
-                err = "Invalid master port"; goto loaderr;
-            }
-            server.repl_state = REPL_STATE_CONNECT;
-        } else if (!strcasecmp(argv[0],"list-max-ziplist-entries") && argc == 2){
-            /* DEAD OPTION */
-        } else if (!strcasecmp(argv[0],"list-max-ziplist-value") && argc == 2) {
-            /* DEAD OPTION */
-        } else if (!strcasecmp(argv[0],"rename-command") && argc == 3) {
-            struct redisCommand *cmd = lookupCommand(argv[1]);
-            int retval;
-
-            if (!cmd) {
-                err = "No such command in rename-command";
-                goto loaderr;
-            }
-
-            /* If the target command name is the empty string we just
-             * remove it from the command table. */
-            retval = dictDelete(server.commands, argv[1]);
-            serverAssert(retval == DICT_OK);
-
-            /* Otherwise we re-add the command under a different name. */
-            if (sdslen(argv[2]) != 0) {
-                sds copy = sdsdup(argv[2]);
-
-                retval = dictAdd(server.commands, copy, cmd);
-                if (retval != DICT_OK) {
-                    sdsfree(copy);
-                    err = "Target command name already exists"; goto loaderr;
-                }
-            }
-        } else if (!strcasecmp(argv[0],"cluster-config-file") && argc == 2) {
-            zfree(server.cluster_configfile);
-            server.cluster_configfile = zstrdup(argv[1]);
-        } else if (!strcasecmp(argv[0],"client-output-buffer-limit") &&
-                   argc == 5)
-        {
-            int class = getClientTypeByName(argv[1]);
-            unsigned long long hard, soft;
-            int soft_seconds;
-
-            if (class == -1 || class == CLIENT_TYPE_MASTER) {
-                err = "Unrecognized client limit class: the user specified "
-                "an invalid one, or 'master' which has no buffer limits.";
-                goto loaderr;
-            }
-            hard = memtoll(argv[2],NULL);
-            soft = memtoll(argv[3],NULL);
-            soft_seconds = atoi(argv[4]);
-            if (soft_seconds < 0) {
-                err = "Negative number of seconds in soft limit is invalid";
-                goto loaderr;
-            }
-            server.client_obuf_limits[class].hard_limit_bytes = hard;
-            server.client_obuf_limits[class].soft_limit_bytes = soft;
-            server.client_obuf_limits[class].soft_limit_seconds = soft_seconds;
-        } else if (!strcasecmp(argv[0],"oom-score-adj-values") && argc == 1 + CONFIG_OOM_COUNT) {
-            if (updateOOMScoreAdjValues(&argv[1], &err, 0) == C_ERR) goto loaderr;
-        } else if (!strcasecmp(argv[0],"notify-keyspace-events") && argc == 2) {
-            int flags = keyspaceEventsStringToFlags(argv[1]);
-
-            if (flags == -1) {
-                err = "Invalid event class character. Use 'g$lshzxeA'.";
-                goto loaderr;
-            }
-            server.notify_keyspace_events = flags;
-        } else if (!strcasecmp(argv[0],"user") && argc >= 2) {
-            int argc_err;
-            if (ACLAppendUserForLoading(argv,argc,&argc_err) == C_ERR) {
-                char buf[1024];
-                const char *errmsg = ACLSetUserStringError();
-                snprintf(buf,sizeof(buf),"Error in user declaration '%s': %s",
-                    argv[argc_err],errmsg);
-                err = buf;
-                goto loaderr;
-            }
-        } else if (!strcasecmp(argv[0],"loadmodule") && argc >= 2) {
-            queueLoadModule(argv[1],&argv[2],argc-2);
-        } else if (!strcasecmp(argv[0],"sentinel")) {
-            /* argc == 1 is handled by main() as we need to enter the sentinel
-             * mode ASAP. */
-            if (argc != 1) {
-                if (!server.sentinel_mode) {
-                    err = "sentinel directive while not in sentinel mode";
-                    goto loaderr;
-                }
-                queueSentinelConfig(argv+1,argc-1,linenum,lines[i]);
-            }
-        } else {
-            err = "Bad directive or wrong number of arguments"; goto loaderr;
-        }
-        sdsfreesplitres(argv,argc);
-    }
-
-    /* Sanity checks. */
-    if (server.cluster_enabled && server.masterhost) {
-        linenum = slaveof_linenum;
-        i = linenum-1;
-        err = "replicaof directive not allowed in cluster mode";
-        goto loaderr;
-    }
-
-    /* To ensure backward compatibility and work while hz is out of range */
-    if (server.config_hz < CONFIG_MIN_HZ) server.config_hz = CONFIG_MIN_HZ;
-    if (server.config_hz > CONFIG_MAX_HZ) server.config_hz = CONFIG_MAX_HZ;
-
-    sdsfreesplitres(lines,totlines);
-    return;
-
-loaderr:
-    fprintf(stderr, "\n*** FATAL CONFIG FILE ERROR (Redis %s) ***\n",
-        REDIS_VERSION);
-    fprintf(stderr, "Reading the configuration file, at line %d\n", linenum);
-    fprintf(stderr, ">>> '%s'\n", lines[i]);
-    fprintf(stderr, "%s\n", err);
-    exit(1);
-}
-
-/* Load the server configuration from the specified filename.
- * The function appends the additional configuration directives stored
- * in the 'options' string to the config file before loading.
- *
- * Both filename and options can be NULL, in such a case are considered
- * empty. This way loadServerConfig can be used to just load a file or
- * just load a string. */
-void loadServerConfig(char *filename, char config_from_stdin, char *options) {
-    sds config = sdsempty();
-    char buf[CONFIG_MAX_LINE+1];
-    FILE *fp;
-
-    /* Load the file content */
-    if (filename) {
-        if ((fp = fopen(filename,"r")) == NULL) {
-            serverLog(LL_WARNING,
-                    "Fatal error, can't open config file '%s': %s",
-                    filename, strerror(errno));
-            exit(1);
-        }
-        while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL)
-            config = sdscat(config,buf);
-        fclose(fp);
-    }
-    /* Append content from stdin */
-    if (config_from_stdin) {
-        serverLog(LL_WARNING,"Reading config from stdin");
-        fp = stdin;
-        while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL)
-            config = sdscat(config,buf);
-    }
-
-    /* Append the additional options */
-    if (options) {
-        config = sdscat(config,"\n");
-        config = sdscat(config,options);
-    }
-    loadServerConfigFromString(config);
-    sdsfree(config);
-}
-
-/*-----------------------------------------------------------------------------
- * CONFIG SET implementation
- *----------------------------------------------------------------------------*/
-
-#define config_set_bool_field(_name,_var) \
-    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
-        int yn = yesnotoi(o->ptr); \
-        if (yn == -1) goto badfmt; \
-        _var = yn;
-
-#define config_set_numerical_field(_name,_var,min,max) \
-    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
-        if (getLongLongFromObject(o,&ll) == C_ERR) goto badfmt; \
-        if (min != LLONG_MIN && ll < min) goto badfmt; \
-        if (max != LLONG_MAX && ll > max) goto badfmt; \
-        _var = ll;
-
-#define config_set_memory_field(_name,_var) \
-    } else if (!strcasecmp(c->argv[2]->ptr,_name)) { \
-        ll = memtoll(o->ptr,&err); \
-        if (err || ll < 0) goto badfmt; \
-        _var = ll;
-
-#define config_set_special_field(_name) \
-    } else if (!strcasecmp(c->argv[2]->ptr,_name)) {
-
-#define config_set_special_field_with_alias(_name1,_name2) \
-    } else if (!strcasecmp(c->argv[2]->ptr,_name1) || \
-               !strcasecmp(c->argv[2]->ptr,_name2)) {
-
-#define config_set_else } else
-
-void configSetCommand(client *c) {
-    robj *o;
-    long long ll;
-    int err;
-    const char *errstr = NULL;
-    serverAssertWithInfo(c,c->argv[2],sdsEncodedObject(c->argv[2]));
-    serverAssertWithInfo(c,c->argv[3],sdsEncodedObject(c->argv[3]));
-    o = c->argv[3];
-
-    /* Iterate the configs that are standard */
-    for (standardConfig *config = configs; config->name != NULL; config++) {
-        if (!(config->flags & IMMUTABLE_CONFIG) && 
-            (!strcasecmp(c->argv[2]->ptr,config->name) ||
-            (config->alias && !strcasecmp(c->argv[2]->ptr,config->alias))))
-        {
-            if (config->flags & SENSITIVE_CONFIG) {
-                redactClientCommandArgument(c,3);
-            }
-            if (!config->interface.set(config->data,o->ptr,1,&errstr)) {
-                goto badfmt;
-            }
-            addReply(c,shared.ok);
-            return;
-        }
-    }
-
-    if (0) { /* this starts the config_set macros else-if chain. */
-
-    /* Special fields that can't be handled with general macros. */
-    config_set_special_field("bind") {
-        int vlen;
-        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
-
-        if (vlen < 1 || vlen > CONFIG_BINDADDR_MAX) {
-            addReplyError(c, "Too many bind addresses specified.");
-            sdsfreesplitres(v, vlen);
-            return;
-        }
-
-        if (changeBindAddr(v, vlen) == C_ERR) {
-            addReplyError(c, "Failed to bind to specified addresses.");
-            sdsfreesplitres(v, vlen);
-            return;
-        }
-        sdsfreesplitres(v, vlen);
-    } config_set_special_field("save") {
-        int vlen, j;
-        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
-
-        /* Perform sanity check before setting the new config:
-         * - Even number of args
-         * - Seconds >= 1, changes >= 0 */
-        if (vlen & 1) {
-            sdsfreesplitres(v,vlen);
-            goto badfmt;
-        }
-        for (j = 0; j < vlen; j++) {
-            char *eptr;
-            long val;
-
-            val = strtoll(v[j], &eptr, 10);
-            if (eptr[0] != '\0' ||
-                ((j & 1) == 0 && val < 1) ||
-                ((j & 1) == 1 && val < 0)) {
-                sdsfreesplitres(v,vlen);
-                goto badfmt;
-            }
-        }
-        /* Finally set the new config */
-        resetServerSaveParams();
-        for (j = 0; j < vlen; j += 2) {
-            time_t seconds;
-            int changes;
-
-            seconds = strtoll(v[j],NULL,10);
-            changes = strtoll(v[j+1],NULL,10);
-            appendServerSaveParams(seconds, changes);
-        }
-        sdsfreesplitres(v,vlen);
-    } config_set_special_field("dir") {
-        if (chdir((char*)o->ptr) == -1) {
-            addReplyErrorFormat(c,"Changing directory: %s", strerror(errno));
-            return;
-        }
-    } config_set_special_field("client-output-buffer-limit") {
-        int vlen, j;
-        sds *v = sdssplitlen(o->ptr,sdslen(o->ptr)," ",1,&vlen);
-
-        /* We need a multiple of 4: <class> <hard> <soft> <soft_seconds> */
-        if (vlen % 4) {
-            sdsfreesplitres(v,vlen);
-            goto badfmt;
-        }
-
-        /* Sanity check of single arguments, so that we either refuse the
-         * whole configuration string or accept it all, even if a single
-         * error in a single client class is present. */
-        for (j = 0; j < vlen; j++) {
-            long val;
-
-            if ((j % 4) == 0) {
-                int class = getClientTypeByName(v[j]);
-                if (class == -1 || class == CLIENT_TYPE_MASTER) {
-                    sdsfreesplitres(v,vlen);
-                    goto badfmt;
-                }
-            } else {
-                val = memtoll(v[j], &err);
-                if (err || val < 0) {
-                    sdsfreesplitres(v,vlen);
-                    goto badfmt;
-                }
-            }
-        }
-        /* Finally set the new config */
-        for (j = 0; j < vlen; j += 4) {
-            int class;
-            unsigned long long hard, soft;
-            int soft_seconds;
-
-            class = getClientTypeByName(v[j]);
-            hard = memtoll(v[j+1],NULL);
-            soft = memtoll(v[j+2],NULL);
-            soft_seconds = strtoll(v[j+3],NULL,10);
-
-            server.client_obuf_limits[class].hard_limit_bytes = hard;
-            server.client_obuf_limits[class].soft_limit_bytes = soft;
-            server.client_obuf_limits[class].soft_limit_seconds = soft_seconds;
-        }
-        sdsfreesplitres(v,vlen);
-    } config_set_special_field("oom-score-adj-values") {
-        int vlen;
-        int success = 1;
-
-        sds *v = sdssplitlen(o->ptr, sdslen(o->ptr), " ", 1, &vlen);
-        if (vlen != CONFIG_OOM_COUNT || updateOOMScoreAdjValues(v, &errstr, 1) == C_ERR)
-            success = 0;
-
-        sdsfreesplitres(v, vlen);
-        if (!success)
-            goto badfmt;
-    } config_set_special_field("notify-keyspace-events") {
-        int flags = keyspaceEventsStringToFlags(o->ptr);
-
-        if (flags == -1) goto badfmt;
-        server.notify_keyspace_events = flags;
-    /* Numerical fields.
-     * config_set_numerical_field(name,var,min,max) */
-    } config_set_numerical_field(
-      "watchdog-period",ll,0,INT_MAX) {
-        if (ll)
-            enableWatchdog(ll);
-        else
-            disableWatchdog();
-    /* Everything else is an error... */
-    } config_set_else {
-        addReplyErrorFormat(c,"Unsupported CONFIG parameter: %s",
-            (char*)c->argv[2]->ptr);
-        return;
-    }
-
-    /* On success we just return a generic OK for all the options. */
-    addReply(c,shared.ok);
-    return;
-
-badfmt: /* Bad format errors */
-    if (errstr) {
-        addReplyErrorFormat(c,"Invalid argument '%s' for CONFIG SET '%s' - %s",
-                (char*)o->ptr,
-                (char*)c->argv[2]->ptr,
-                errstr);
-    } else {
-        addReplyErrorFormat(c,"Invalid argument '%s' for CONFIG SET '%s'",
-                (char*)o->ptr,
-                (char*)c->argv[2]->ptr);
-    }
-}
-
-/*-----------------------------------------------------------------------------
- * CONFIG GET implementation
- *----------------------------------------------------------------------------*/
-
-#define config_get_string_field(_name,_var) do { \
-    if (stringmatch(pattern,_name,1)) { \
-        addReplyBulkCString(c,_name); \
-        addReplyBulkCString(c,_var ? _var : ""); \
-        matches++; \
-    } \
-} while(0)
-
-#define config_get_bool_field(_name,_var) do { \
-    if (stringmatch(pattern,_name,1)) { \
-        addReplyBulkCString(c,_name); \
-        addReplyBulkCString(c,_var ? "yes" : "no"); \
-        matches++; \
-    } \
-} while(0)
-
-#define config_get_numerical_field(_name,_var) do { \
-    if (stringmatch(pattern,_name,1)) { \
-        ll2string(buf,sizeof(buf),_var); \
-        addReplyBulkCString(c,_name); \
-        addReplyBulkCString(c,buf); \
-        matches++; \
-    } \
-} while(0)
-
-void configGetCommand(client *c) {
-    robj *o = c->argv[2];
-    void *replylen = addReplyDeferredLen(c);
-    char *pattern = o->ptr;
-    char buf[128];
-    int matches = 0;
-    serverAssertWithInfo(c,o,sdsEncodedObject(o));
-
-    /* Iterate the configs that are standard */
-    for (standardConfig *config = configs; config->name != NULL; config++) {
-        if (stringmatch(pattern,config->name,1)) {
-            addReplyBulkCString(c,config->name);
-            config->interface.get(c,config->data);
-            matches++;
-        }
-        if (config->alias && stringmatch(pattern,config->alias,1)) {
-            addReplyBulkCString(c,config->alias);
-            config->interface.get(c,config->data);
-            matches++;
-        }
-    }
-
-    /* String values */
-    config_get_string_field("logfile",server.logfile);
-
-    /* Numerical values */
-    config_get_numerical_field("watchdog-period",server.watchdog_period);
-
-    /* Everything we can't handle with macros follows. */
-
-    if (stringmatch(pattern,"dir",1)) {
-        char buf[1024];
-
-        if (getcwd(buf,sizeof(buf)) == NULL)
-            buf[0] = '\0';
-
-        addReplyBulkCString(c,"dir");
-        addReplyBulkCString(c,buf);
-        matches++;
-    }
-    if (stringmatch(pattern,"save",1)) {
-        sds buf = sdsempty();
-        int j;
-
-        for (j = 0; j < server.saveparamslen; j++) {
-            buf = sdscatprintf(buf,"%jd %d",
-                    (intmax_t)server.saveparams[j].seconds,
-                    server.saveparams[j].changes);
-            if (j != server.saveparamslen-1)
-                buf = sdscatlen(buf," ",1);
-        }
-        addReplyBulkCString(c,"save");
-        addReplyBulkCString(c,buf);
-        sdsfree(buf);
-        matches++;
-    }
-    if (stringmatch(pattern,"client-output-buffer-limit",1)) {
-        sds buf = sdsempty();
-        int j;
-
-        for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++) {
-            buf = sdscatprintf(buf,"%s %llu %llu %ld",
-                    getClientTypeName(j),
-                    server.client_obuf_limits[j].hard_limit_bytes,
-                    server.client_obuf_limits[j].soft_limit_bytes,
-                    (long) server.client_obuf_limits[j].soft_limit_seconds);
-            if (j != CLIENT_TYPE_OBUF_COUNT-1)
-                buf = sdscatlen(buf," ",1);
-        }
-        addReplyBulkCString(c,"client-output-buffer-limit");
-        addReplyBulkCString(c,buf);
-        sdsfree(buf);
-        matches++;
-    }
-    if (stringmatch(pattern,"unixsocketperm",1)) {
-        char buf[32];
-        snprintf(buf,sizeof(buf),"%lo",(unsigned long) server.unixsocketperm);
-        addReplyBulkCString(c,"unixsocketperm");
-        addReplyBulkCString(c,buf);
-        matches++;
-    }
-    if (stringmatch(pattern,"slaveof",1) ||
-        stringmatch(pattern,"replicaof",1))
-    {
-        char *optname = stringmatch(pattern,"slaveof",1) ?
-                        "slaveof" : "replicaof";
-        char buf[256];
-
-        addReplyBulkCString(c,optname);
-        if (server.masterhost)
-            snprintf(buf,sizeof(buf),"%s %d",
-                server.masterhost, server.masterport);
-        else
-            buf[0] = '\0';
-        addReplyBulkCString(c,buf);
-        matches++;
-    }
-    if (stringmatch(pattern,"notify-keyspace-events",1)) {
-        sds flags = keyspaceEventsFlagsToString(server.notify_keyspace_events);
-
-        addReplyBulkCString(c,"notify-keyspace-events");
-        addReplyBulkSds(c,flags);
-        matches++;
-    }
-    if (stringmatch(pattern,"bind",1)) {
-        sds aux = sdsjoin(server.bindaddr,server.bindaddr_count," ");
-
-        addReplyBulkCString(c,"bind");
-        addReplyBulkCString(c,aux);
-        sdsfree(aux);
-        matches++;
-    }
-
-    if (stringmatch(pattern,"oom-score-adj-values",0)) {
-        sds buf = sdsempty();
-        int j;
-
-        for (j = 0; j < CONFIG_OOM_COUNT; j++) {
-            buf = sdscatprintf(buf,"%d", server.oom_score_adj_values[j]);
-            if (j != CONFIG_OOM_COUNT-1)
-                buf = sdscatlen(buf," ",1);
-        }
-
-        addReplyBulkCString(c,"oom-score-adj-values");
-        addReplyBulkCString(c,buf);
-        sdsfree(buf);
-        matches++;
-    }
-
-    setDeferredMapLen(c,replylen,matches);
-}
-
-/*-----------------------------------------------------------------------------
- * CONFIG REWRITE implementation
- *----------------------------------------------------------------------------*/
-
-#define REDIS_CONFIG_REWRITE_SIGNATURE "# Generated by CONFIG REWRITE"
-
-/* We use the following dictionary type to store where a configuration
- * option is mentioned in the old configuration file, so it's
- * like "maxmemory" -> list of line numbers (first line is zero). */
-uint64_t dictSdsCaseHash(const void *key);
-int dictSdsKeyCaseCompare(void *privdata, const void *key1, const void *key2);
-void dictSdsDestructor(void *privdata, void *val);
-void dictListDestructor(void *privdata, void *val);
-
-/* Sentinel config rewriting is implemented inside sentinel.c by
- * rewriteConfigSentinelOption(). */
-void rewriteConfigSentinelOption(struct rewriteConfigState *state);
-
-dictType optionToLineDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    dictListDestructor,         /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-dictType optionSetDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* The config rewrite state. */
-struct rewriteConfigState {
-    dict *option_to_line; /* Option -> list of config file lines map */
-    dict *rewritten;      /* Dictionary of already processed options */
-    int numlines;         /* Number of lines in current config */
-    sds *lines;           /* Current lines as an array of sds strings */
-    int has_tail;         /* True if we already added directives that were
-                             not present in the original config file. */
-    int force_all;        /* True if we want all keywords to be force
-                             written. Currently only used for testing. */
-};
-
-/* Append the new line to the current configuration state. */
-void rewriteConfigAppendLine(struct rewriteConfigState *state, sds line) {
-    state->lines = zrealloc(state->lines, sizeof(char*) * (state->numlines+1));
-    state->lines[state->numlines++] = line;
-}
-
-/* Populate the option -> list of line numbers map. */
-void rewriteConfigAddLineNumberToOption(struct rewriteConfigState *state, sds option, int linenum) {
-    list *l = dictFetchValue(state->option_to_line,option);
-
-    if (l == NULL) {
-        l = listCreate();
-        dictAdd(state->option_to_line,sdsdup(option),l);
-    }
-    listAddNodeTail(l,(void*)(long)linenum);
-}
-
-/* Add the specified option to the set of processed options.
- * This is useful as only unused lines of processed options will be blanked
- * in the config file, while options the rewrite process does not understand
- * remain untouched. */
-void rewriteConfigMarkAsProcessed(struct rewriteConfigState *state, const char *option) {
-    sds opt = sdsnew(option);
-
-    if (dictAdd(state->rewritten,opt,NULL) != DICT_OK) sdsfree(opt);
-}
-
-/* Read the old file, split it into lines to populate a newly created
- * config rewrite state, and return it to the caller.
- *
- * If it is impossible to read the old file, NULL is returned.
- * If the old file does not exist at all, an empty state is returned. */
-struct rewriteConfigState *rewriteConfigReadOldFile(char *path) {
-    FILE *fp = fopen(path,"r");
-    if (fp == NULL && errno != ENOENT) return NULL;
-
-    char buf[CONFIG_MAX_LINE+1];
-    int linenum = -1;
-    struct rewriteConfigState *state = zmalloc(sizeof(*state));
-    state->option_to_line = dictCreate(&optionToLineDictType,NULL);
-    state->rewritten = dictCreate(&optionSetDictType,NULL);
-    state->numlines = 0;
-    state->lines = NULL;
-    state->has_tail = 0;
-    state->force_all = 0;
-    if (fp == NULL) return state;
-
-    /* Read the old file line by line, populate the state. */
-    while(fgets(buf,CONFIG_MAX_LINE+1,fp) != NULL) {
-        int argc;
-        sds *argv;
-        sds line = sdstrim(sdsnew(buf),"\r\n\t ");
-
-        linenum++; /* Zero based, so we init at -1 */
-
-        /* Handle comments and empty lines. */
-        if (line[0] == '#' || line[0] == '\0') {
-            if (!state->has_tail && !strcmp(line,REDIS_CONFIG_REWRITE_SIGNATURE))
-                state->has_tail = 1;
-            rewriteConfigAppendLine(state,line);
-            continue;
-        }
-
-        /* Not a comment, split into arguments. */
-        argv = sdssplitargs(line,&argc);
-        if (argv == NULL) {
-            /* Apparently the line is unparsable for some reason, for
-             * instance it may have unbalanced quotes. Load it as a
-             * comment. */
-            sds aux = sdsnew("# ??? ");
-            aux = sdscatsds(aux,line);
-            sdsfree(line);
-            rewriteConfigAppendLine(state,aux);
-            continue;
-        }
-
-        sdstolower(argv[0]); /* We only want lowercase config directives. */
-
-        /* Now we populate the state according to the content of this line.
-         * Append the line and populate the option -> line numbers map. */
-        rewriteConfigAppendLine(state,line);
-
-        /* Translate options using the word "slave" to the corresponding name
-         * "replica", before adding such option to the config name -> lines
-         * mapping. */
-        char *p = strstr(argv[0],"slave");
-        if (p) {
-            sds alt = sdsempty();
-            alt = sdscatlen(alt,argv[0],p-argv[0]);
-            alt = sdscatlen(alt,"replica",7);
-            alt = sdscatlen(alt,p+5,strlen(p+5));
-            sdsfree(argv[0]);
-            argv[0] = alt;
-        }
-        /* If this is sentinel config, we use sentinel "sentinel <config>" as option 
-            to avoid messing up the sequence. */
-        if (server.sentinel_mode && argc > 1 && !strcasecmp(argv[0],"sentinel")) {
-            sds sentinelOption = sdsempty();
-            sentinelOption = sdscatfmt(sentinelOption,"%S %S",argv[0],argv[1]);
-            rewriteConfigAddLineNumberToOption(state,sentinelOption,linenum);
-            sdsfree(sentinelOption);
-        } else {
-            rewriteConfigAddLineNumberToOption(state,argv[0],linenum);
-        }
-        sdsfreesplitres(argv,argc);
-    }
-    fclose(fp);
-    return state;
-}
-
-/* Rewrite the specified configuration option with the new "line".
- * It progressively uses lines of the file that were already used for the same
- * configuration option in the old version of the file, removing that line from
- * the map of options -> line numbers.
- *
- * If there are lines associated with a given configuration option and
- * "force" is non-zero, the line is appended to the configuration file.
- * Usually "force" is true when an option has not its default value, so it
- * must be rewritten even if not present previously.
- *
- * The first time a line is appended into a configuration file, a comment
- * is added to show that starting from that point the config file was generated
- * by CONFIG REWRITE.
- *
- * "line" is either used, or freed, so the caller does not need to free it
- * in any way. */
-void rewriteConfigRewriteLine(struct rewriteConfigState *state, const char *option, sds line, int force) {
-    sds o = sdsnew(option);
-    list *l = dictFetchValue(state->option_to_line,o);
-
-    rewriteConfigMarkAsProcessed(state,option);
-
-    if (!l && !force && !state->force_all) {
-        /* Option not used previously, and we are not forced to use it. */
-        sdsfree(line);
-        sdsfree(o);
-        return;
-    }
-
-    if (l) {
-        listNode *ln = listFirst(l);
-        int linenum = (long) ln->value;
-
-        /* There are still lines in the old configuration file we can reuse
-         * for this option. Replace the line with the new one. */
-        listDelNode(l,ln);
-        if (listLength(l) == 0) dictDelete(state->option_to_line,o);
-        sdsfree(state->lines[linenum]);
-        state->lines[linenum] = line;
-    } else {
-        /* Append a new line. */
-        if (!state->has_tail) {
-            rewriteConfigAppendLine(state,
-                sdsnew(REDIS_CONFIG_REWRITE_SIGNATURE));
-            state->has_tail = 1;
-        }
-        rewriteConfigAppendLine(state,line);
-    }
-    sdsfree(o);
-}
-
-/* Write the long long 'bytes' value as a string in a way that is parsable
- * inside redis.conf. If possible uses the GB, MB, KB notation. */
-int rewriteConfigFormatMemory(char *buf, size_t len, long long bytes) {
-    int gb = 1024*1024*1024;
-    int mb = 1024*1024;
-    int kb = 1024;
-
-    if (bytes && (bytes % gb) == 0) {
-        return snprintf(buf,len,"%lldgb",bytes/gb);
-    } else if (bytes && (bytes % mb) == 0) {
-        return snprintf(buf,len,"%lldmb",bytes/mb);
-    } else if (bytes && (bytes % kb) == 0) {
-        return snprintf(buf,len,"%lldkb",bytes/kb);
-    } else {
-        return snprintf(buf,len,"%lld",bytes);
-    }
-}
-
-/* Rewrite a simple "option-name <bytes>" configuration option. */
-void rewriteConfigBytesOption(struct rewriteConfigState *state, const char *option, long long value, long long defvalue) {
-    char buf[64];
-    int force = value != defvalue;
-    sds line;
-
-    rewriteConfigFormatMemory(buf,sizeof(buf),value);
-    line = sdscatprintf(sdsempty(),"%s %s",option,buf);
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite a yes/no option. */
-void rewriteConfigYesNoOption(struct rewriteConfigState *state, const char *option, int value, int defvalue) {
-    int force = value != defvalue;
-    sds line = sdscatprintf(sdsempty(),"%s %s",option,
-        value ? "yes" : "no");
-
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite a string option. */
-void rewriteConfigStringOption(struct rewriteConfigState *state, const char *option, char *value, const char *defvalue) {
-    int force = 1;
-    sds line;
-
-    /* String options set to NULL need to be not present at all in the
-     * configuration file to be set to NULL again at the next reboot. */
-    if (value == NULL) {
-        rewriteConfigMarkAsProcessed(state,option);
-        return;
-    }
-
-    /* Set force to zero if the value is set to its default. */
-    if (defvalue && strcmp(value,defvalue) == 0) force = 0;
-
-    line = sdsnew(option);
-    line = sdscatlen(line, " ", 1);
-    line = sdscatrepr(line, value, strlen(value));
-
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite a SDS string option. */
-void rewriteConfigSdsOption(struct rewriteConfigState *state, const char *option, sds value, const sds defvalue) {
-    int force = 1;
-    sds line;
-
-    /* If there is no value set, we don't want the SDS option
-     * to be present in the configuration at all. */
-    if (value == NULL) {
-        rewriteConfigMarkAsProcessed(state, option);
-        return;
-    }
-
-    /* Set force to zero if the value is set to its default. */
-    if (defvalue && sdscmp(value, defvalue) == 0) force = 0;
-
-    line = sdsnew(option);
-    line = sdscatlen(line, " ", 1);
-    line = sdscatrepr(line, value, sdslen(value));
-
-    rewriteConfigRewriteLine(state, option, line, force);
-}
-
-/* Rewrite a numerical (long long range) option. */
-void rewriteConfigNumericalOption(struct rewriteConfigState *state, const char *option, long long value, long long defvalue) {
-    int force = value != defvalue;
-    sds line = sdscatprintf(sdsempty(),"%s %lld",option,value);
-
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite an octal option. */
-void rewriteConfigOctalOption(struct rewriteConfigState *state, char *option, int value, int defvalue) {
-    int force = value != defvalue;
-    sds line = sdscatprintf(sdsempty(),"%s %o",option,value);
-
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite an enumeration option. It takes as usually state and option name,
- * and in addition the enumeration array and the default value for the
- * option. */
-void rewriteConfigEnumOption(struct rewriteConfigState *state, const char *option, int value, configEnum *ce, int defval) {
-    sds line;
-    const char *name = configEnumGetNameOrUnknown(ce,value);
-    int force = value != defval;
-
-    line = sdscatprintf(sdsempty(),"%s %s",option,name);
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite the save option. */
-void rewriteConfigSaveOption(struct rewriteConfigState *state) {
-    int j;
-    sds line;
-
-    /* In Sentinel mode we don't need to rewrite the save parameters */
-    if (server.sentinel_mode) {
-        rewriteConfigMarkAsProcessed(state,"save");
-        return;
-    }
-
-    /* Rewrite save parameters, or an empty 'save ""' line to avoid the
-     * defaults from being used.
-     */
-    if (!server.saveparamslen) {
-        rewriteConfigRewriteLine(state,"save",sdsnew("save \"\""),1);
-    } else {
-        for (j = 0; j < server.saveparamslen; j++) {
-            line = sdscatprintf(sdsempty(),"save %ld %d",
-                (long) server.saveparams[j].seconds, server.saveparams[j].changes);
-            rewriteConfigRewriteLine(state,"save",line,1);
-        }
-    }
-
-    /* Mark "save" as processed in case server.saveparamslen is zero. */
-    rewriteConfigMarkAsProcessed(state,"save");
-}
-
-/* Rewrite the user option. */
-void rewriteConfigUserOption(struct rewriteConfigState *state) {
-    /* If there is a user file defined we just mark this configuration
-     * directive as processed, so that all the lines containing users
-     * inside the config file gets discarded. */
-    if (server.acl_filename[0] != '\0') {
-        rewriteConfigMarkAsProcessed(state,"user");
-        return;
-    }
-
-    /* Otherwise scan the list of users and rewrite every line. Note that
-     * in case the list here is empty, the effect will just be to comment
-     * all the users directive inside the config file. */
-    raxIterator ri;
-    raxStart(&ri,Users);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        user *u = ri.data;
-        sds line = sdsnew("user ");
-        line = sdscatsds(line,u->name);
-        line = sdscatlen(line," ",1);
-        sds descr = ACLDescribeUser(u);
-        line = sdscatsds(line,descr);
-        sdsfree(descr);
-        rewriteConfigRewriteLine(state,"user",line,1);
-    }
-    raxStop(&ri);
-
-    /* Mark "user" as processed in case there are no defined users. */
-    rewriteConfigMarkAsProcessed(state,"user");
-}
-
-/* Rewrite the dir option, always using absolute paths.*/
-void rewriteConfigDirOption(struct rewriteConfigState *state) {
-    char cwd[1024];
-
-    if (getcwd(cwd,sizeof(cwd)) == NULL) {
-        rewriteConfigMarkAsProcessed(state,"dir");
-        return; /* no rewrite on error. */
-    }
-    rewriteConfigStringOption(state,"dir",cwd,NULL);
-}
-
-/* Rewrite the slaveof option. */
-void rewriteConfigSlaveofOption(struct rewriteConfigState *state, char *option) {
-    sds line;
-
-    /* If this is a master, we want all the slaveof config options
-     * in the file to be removed. Note that if this is a cluster instance
-     * we don't want a slaveof directive inside redis.conf. */
-    if (server.cluster_enabled || server.masterhost == NULL) {
-        rewriteConfigMarkAsProcessed(state,option);
-        return;
-    }
-    line = sdscatprintf(sdsempty(),"%s %s %d", option,
-        server.masterhost, server.masterport);
-    rewriteConfigRewriteLine(state,option,line,1);
-}
-
-/* Rewrite the notify-keyspace-events option. */
-void rewriteConfigNotifykeyspaceeventsOption(struct rewriteConfigState *state) {
-    int force = server.notify_keyspace_events != 0;
-    char *option = "notify-keyspace-events";
-    sds line, flags;
-
-    flags = keyspaceEventsFlagsToString(server.notify_keyspace_events);
-    line = sdsnew(option);
-    line = sdscatlen(line, " ", 1);
-    line = sdscatrepr(line, flags, sdslen(flags));
-    sdsfree(flags);
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite the client-output-buffer-limit option. */
-void rewriteConfigClientoutputbufferlimitOption(struct rewriteConfigState *state) {
-    int j;
-    char *option = "client-output-buffer-limit";
-
-    for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++) {
-        int force = (server.client_obuf_limits[j].hard_limit_bytes !=
-                    clientBufferLimitsDefaults[j].hard_limit_bytes) ||
-                    (server.client_obuf_limits[j].soft_limit_bytes !=
-                    clientBufferLimitsDefaults[j].soft_limit_bytes) ||
-                    (server.client_obuf_limits[j].soft_limit_seconds !=
-                    clientBufferLimitsDefaults[j].soft_limit_seconds);
-        sds line;
-        char hard[64], soft[64];
-
-        rewriteConfigFormatMemory(hard,sizeof(hard),
-                server.client_obuf_limits[j].hard_limit_bytes);
-        rewriteConfigFormatMemory(soft,sizeof(soft),
-                server.client_obuf_limits[j].soft_limit_bytes);
-
-        char *typename = getClientTypeName(j);
-        if (!strcmp(typename,"slave")) typename = "replica";
-        line = sdscatprintf(sdsempty(),"%s %s %s %s %ld",
-                option, typename, hard, soft,
-                (long) server.client_obuf_limits[j].soft_limit_seconds);
-        rewriteConfigRewriteLine(state,option,line,force);
-    }
-}
-
-/* Rewrite the oom-score-adj-values option. */
-void rewriteConfigOOMScoreAdjValuesOption(struct rewriteConfigState *state) {
-    int force = 0;
-    int j;
-    char *option = "oom-score-adj-values";
-    sds line;
-
-    line = sdsnew(option);
-    line = sdscatlen(line, " ", 1);
-    for (j = 0; j < CONFIG_OOM_COUNT; j++) {
-        if (server.oom_score_adj_values[j] != configOOMScoreAdjValuesDefaults[j])
-            force = 1;
-
-        line = sdscatprintf(line, "%d", server.oom_score_adj_values[j]);
-        if (j+1 != CONFIG_OOM_COUNT)
-            line = sdscatlen(line, " ", 1);
-    }
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Rewrite the bind option. */
-void rewriteConfigBindOption(struct rewriteConfigState *state) {
-    int force = 1;
-    sds line, addresses;
-    char *option = "bind";
-
-    /* Nothing to rewrite if we don't have bind addresses. */
-    if (server.bindaddr_count == 0) {
-        rewriteConfigMarkAsProcessed(state,option);
-        return;
-    }
-
-    /* Rewrite as bind <addr1> <addr2> ... <addrN> */
-    addresses = sdsjoin(server.bindaddr,server.bindaddr_count," ");
-    line = sdsnew(option);
-    line = sdscatlen(line, " ", 1);
-    line = sdscatsds(line, addresses);
-    sdsfree(addresses);
-
-    rewriteConfigRewriteLine(state,option,line,force);
-}
-
-/* Glue together the configuration lines in the current configuration
- * rewrite state into a single string, stripping multiple empty lines. */
-sds rewriteConfigGetContentFromState(struct rewriteConfigState *state) {
-    sds content = sdsempty();
-    int j, was_empty = 0;
-
-    for (j = 0; j < state->numlines; j++) {
-        /* Every cluster of empty lines is turned into a single empty line. */
-        if (sdslen(state->lines[j]) == 0) {
-            if (was_empty) continue;
-            was_empty = 1;
-        } else {
-            was_empty = 0;
-        }
-        content = sdscatsds(content,state->lines[j]);
-        content = sdscatlen(content,"\n",1);
-    }
-    return content;
-}
-
-/* Free the configuration rewrite state. */
-void rewriteConfigReleaseState(struct rewriteConfigState *state) {
-    sdsfreesplitres(state->lines,state->numlines);
-    dictRelease(state->option_to_line);
-    dictRelease(state->rewritten);
-    zfree(state);
-}
-
-/* At the end of the rewrite process the state contains the remaining
- * map between "option name" => "lines in the original config file".
- * Lines used by the rewrite process were removed by the function
- * rewriteConfigRewriteLine(), all the other lines are "orphaned" and
- * should be replaced by empty lines.
- *
- * This function does just this, iterating all the option names and
- * blanking all the lines still associated. */
-void rewriteConfigRemoveOrphaned(struct rewriteConfigState *state) {
-    dictIterator *di = dictGetIterator(state->option_to_line);
-    dictEntry *de;
-
-    while((de = dictNext(di)) != NULL) {
-        list *l = dictGetVal(de);
-        sds option = dictGetKey(de);
-
-        /* Don't blank lines about options the rewrite process
-         * don't understand. */
-        if (dictFind(state->rewritten,option) == NULL) {
-            serverLog(LL_DEBUG,"Not rewritten option: %s", option);
-            continue;
-        }
-
-        while(listLength(l)) {
-            listNode *ln = listFirst(l);
-            int linenum = (long) ln->value;
-
-            sdsfree(state->lines[linenum]);
-            state->lines[linenum] = sdsempty();
-            listDelNode(l,ln);
-        }
-    }
-    dictReleaseIterator(di);
-}
-
-/* This function replaces the old configuration file with the new content
- * in an atomic manner.
- *
- * The function returns 0 on success, otherwise -1 is returned and errno
- * is set accordingly. */
-int rewriteConfigOverwriteFile(char *configfile, sds content) {
-    int fd = -1;
-    int retval = -1;
-    char tmp_conffile[PATH_MAX];
-    const char *tmp_suffix = ".XXXXXX";
-    size_t offset = 0;
-    ssize_t written_bytes = 0;
-
-    int tmp_path_len = snprintf(tmp_conffile, sizeof(tmp_conffile), "%s%s", configfile, tmp_suffix);
-    if (tmp_path_len <= 0 || (unsigned int)tmp_path_len >= sizeof(tmp_conffile)) {
-        serverLog(LL_WARNING, "Config file full path is too long");
-        errno = ENAMETOOLONG;
-        return retval;
-    }
-
-#ifdef _GNU_SOURCE
-    fd = mkostemp(tmp_conffile, O_CLOEXEC);
-#else
-    /* There's a theoretical chance here to leak the FD if a module thread forks & execv in the middle */
-    fd = mkstemp(tmp_conffile);
-#endif
-
-    if (fd == -1) {
-        serverLog(LL_WARNING, "Could not create tmp config file (%s)", strerror(errno));
-        return retval;
-    }
-
-    while (offset < sdslen(content)) {
-         written_bytes = write(fd, content + offset, sdslen(content) - offset);
-         if (written_bytes <= 0) {
-             if (errno == EINTR) continue; /* FD is blocking, no other retryable errors */
-             serverLog(LL_WARNING, "Failed after writing (%zd) bytes to tmp config file (%s)", offset, strerror(errno));
-             goto cleanup;
-         }
-         offset+=written_bytes;
-    }
-
-    if (fsync(fd))
-        serverLog(LL_WARNING, "Could not sync tmp config file to disk (%s)", strerror(errno));
-    else if (fchmod(fd, 0644 & ~server.umask) == -1)
-        serverLog(LL_WARNING, "Could not chmod config file (%s)", strerror(errno));
-    else if (rename(tmp_conffile, configfile) == -1)
-        serverLog(LL_WARNING, "Could not rename tmp config file (%s)", strerror(errno));
-    else {
-        retval = 0;
-        serverLog(LL_DEBUG, "Rewritten config file (%s) successfully", configfile);
-    }
-
-cleanup:
-    close(fd);
-    if (retval) unlink(tmp_conffile);
-    return retval;
-}
-
-/* Rewrite the configuration file at "path".
- * If the configuration file already exists, we try at best to retain comments
- * and overall structure.
- *
- * Configuration parameters that are at their default value, unless already
- * explicitly included in the old configuration file, are not rewritten.
- * The force_all flag overrides this behavior and forces everything to be
- * written. This is currently only used for testing purposes.
- *
- * On error -1 is returned and errno is set accordingly, otherwise 0. */
-int rewriteConfig(char *path, int force_all) {
-    struct rewriteConfigState *state;
-    sds newcontent;
-    int retval;
-
-    /* Step 1: read the old config into our rewrite state. */
-    if ((state = rewriteConfigReadOldFile(path)) == NULL) return -1;
-    if (force_all) state->force_all = 1;
-
-    /* Step 2: rewrite every single option, replacing or appending it inside
-     * the rewrite state. */
-
-    /* Iterate the configs that are standard */
-    for (standardConfig *config = configs; config->name != NULL; config++) {
-        config->interface.rewrite(config->data, config->name, state);
-    }
-
-    rewriteConfigBindOption(state);
-    rewriteConfigOctalOption(state,"unixsocketperm",server.unixsocketperm,CONFIG_DEFAULT_UNIX_SOCKET_PERM);
-    rewriteConfigStringOption(state,"logfile",server.logfile,CONFIG_DEFAULT_LOGFILE);
-    rewriteConfigSaveOption(state);
-    rewriteConfigUserOption(state);
-    rewriteConfigDirOption(state);
-    rewriteConfigSlaveofOption(state,"replicaof");
-    rewriteConfigStringOption(state,"cluster-config-file",server.cluster_configfile,CONFIG_DEFAULT_CLUSTER_CONFIG_FILE);
-    rewriteConfigNotifykeyspaceeventsOption(state);
-    rewriteConfigClientoutputbufferlimitOption(state);
-    rewriteConfigOOMScoreAdjValuesOption(state);
-
-    /* Rewrite Sentinel config if in Sentinel mode. */
-    if (server.sentinel_mode) rewriteConfigSentinelOption(state);
-
-    /* Step 3: remove all the orphaned lines in the old file, that is, lines
-     * that were used by a config option and are no longer used, like in case
-     * of multiple "save" options or duplicated options. */
-    rewriteConfigRemoveOrphaned(state);
-
-    /* Step 4: generate a new configuration file from the modified state
-     * and write it into the original file. */
-    newcontent = rewriteConfigGetContentFromState(state);
-    retval = rewriteConfigOverwriteFile(server.configfile,newcontent);
-
-    sdsfree(newcontent);
-    rewriteConfigReleaseState(state);
-    return retval;
-}
-
-/*-----------------------------------------------------------------------------
- * Configs that fit one of the major types and require no special handling
- *----------------------------------------------------------------------------*/
-#define LOADBUF_SIZE 256
-static char loadbuf[LOADBUF_SIZE];
-
-#define embedCommonConfig(config_name, config_alias, config_flags) \
-    .name = (config_name), \
-    .alias = (config_alias), \
-    .flags = (config_flags),
-
-#define embedConfigInterface(initfn, setfn, getfn, rewritefn) .interface = { \
-    .init = (initfn), \
-    .set = (setfn), \
-    .get = (getfn), \
-    .rewrite = (rewritefn) \
-},
-
-/* What follows is the generic config types that are supported. To add a new
- * config with one of these types, add it to the standardConfig table with
- * the creation macro for each type.
- *
- * Each type contains the following:
- * * A function defining how to load this type on startup.
- * * A function defining how to update this type on CONFIG SET.
- * * A function defining how to serialize this type on CONFIG SET.
- * * A function defining how to rewrite this type on CONFIG REWRITE.
- * * A Macro defining how to create this type.
- */
-
-/* Bool Configs */
-static void boolConfigInit(typeData data) {
-    *data.yesno.config = data.yesno.default_value;
-}
-
-static int boolConfigSet(typeData data, sds value, int update, const char **err) {
-    int yn = yesnotoi(value);
-    if (yn == -1) {
-        *err = "argument must be 'yes' or 'no'";
-        return 0;
-    }
-    if (data.yesno.is_valid_fn && !data.yesno.is_valid_fn(yn, err))
-        return 0;
-    int prev = *(data.yesno.config);
-    *(data.yesno.config) = yn;
-    if (update && data.yesno.update_fn && !data.yesno.update_fn(yn, prev, err)) {
-        *(data.yesno.config) = prev;
-        return 0;
-    }
-    return 1;
-}
-
-static void boolConfigGet(client *c, typeData data) {
-    addReplyBulkCString(c, *data.yesno.config ? "yes" : "no");
-}
-
-static void boolConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
-    rewriteConfigYesNoOption(state, name,*(data.yesno.config), data.yesno.default_value);
-}
-
-#define createBoolConfig(name, alias, flags, config_addr, default, is_valid, update) { \
-    embedCommonConfig(name, alias, flags) \
-    embedConfigInterface(boolConfigInit, boolConfigSet, boolConfigGet, boolConfigRewrite) \
-    .data.yesno = { \
-        .config = &(config_addr), \
-        .default_value = (default), \
-        .is_valid_fn = (is_valid), \
-        .update_fn = (update), \
-    } \
-}
-
-/* String Configs */
-static void stringConfigInit(typeData data) {
-    *data.string.config = (data.string.convert_empty_to_null && !data.string.default_value) ? NULL : zstrdup(data.string.default_value);
-}
-
-static int stringConfigSet(typeData data, sds value, int update, const char **err) {
-    if (data.string.is_valid_fn && !data.string.is_valid_fn(value, err))
-        return 0;
-    char *prev = *data.string.config;
-    *data.string.config = (data.string.convert_empty_to_null && !value[0]) ? NULL : zstrdup(value);
-    if (update && data.string.update_fn && !data.string.update_fn(*data.string.config, prev, err)) {
-        zfree(*data.string.config);
-        *data.string.config = prev;
-        return 0;
-    }
-    zfree(prev);
-    return 1;
-}
-
-static void stringConfigGet(client *c, typeData data) {
-    addReplyBulkCString(c, *data.string.config ? *data.string.config : "");
-}
-
-static void stringConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
-    rewriteConfigStringOption(state, name,*(data.string.config), data.string.default_value);
-}
-
-/* SDS Configs */
-static void sdsConfigInit(typeData data) {
-    *data.sds.config = (data.sds.convert_empty_to_null && !data.sds.default_value) ? NULL: sdsnew(data.sds.default_value);
-}
-
-static int sdsConfigSet(typeData data, sds value, int update, const char **err) {
-    if (data.sds.is_valid_fn && !data.sds.is_valid_fn(value, err))
-        return 0;
-    sds prev = *data.sds.config;
-    *data.sds.config = (data.sds.convert_empty_to_null && (sdslen(value) == 0)) ? NULL : sdsdup(value);
-    if (update && data.sds.update_fn && !data.sds.update_fn(*data.sds.config, prev, err)) {
-        sdsfree(*data.sds.config);
-        *data.sds.config = prev;
-        return 0;
-    }
-    sdsfree(prev);
-    return 1;
-}
-
-static void sdsConfigGet(client *c, typeData data) {
-    if (*data.sds.config) {
-        addReplyBulkSds(c, sdsdup(*data.sds.config));
-    } else {
-        addReplyBulkCString(c, "");
-    }
-}
-
-static void sdsConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
-    rewriteConfigSdsOption(state, name, *(data.sds.config), data.sds.default_value ? sdsnew(data.sds.default_value) : NULL);
-}
-
-
-#define ALLOW_EMPTY_STRING 0
-#define EMPTY_STRING_IS_NULL 1
-
-#define createStringConfig(name, alias, flags, empty_to_null, config_addr, default, is_valid, update) { \
-    embedCommonConfig(name, alias, flags) \
-    embedConfigInterface(stringConfigInit, stringConfigSet, stringConfigGet, stringConfigRewrite) \
-    .data.string = { \
-        .config = &(config_addr), \
-        .default_value = (default), \
-        .is_valid_fn = (is_valid), \
-        .update_fn = (update), \
-        .convert_empty_to_null = (empty_to_null), \
-    } \
-}
-
-#define createSDSConfig(name, alias, flags, empty_to_null, config_addr, default, is_valid, update) { \
-    embedCommonConfig(name, alias, flags) \
-    embedConfigInterface(sdsConfigInit, sdsConfigSet, sdsConfigGet, sdsConfigRewrite) \
-    .data.sds = { \
-        .config = &(config_addr), \
-        .default_value = (default), \
-        .is_valid_fn = (is_valid), \
-        .update_fn = (update), \
-        .convert_empty_to_null = (empty_to_null), \
-    } \
-}
-
-/* Enum configs */
-static void enumConfigInit(typeData data) {
-    *data.enumd.config = data.enumd.default_value;
-}
-
-static int enumConfigSet(typeData data, sds value, int update, const char **err) {
-    int enumval = configEnumGetValue(data.enumd.enum_value, value);
-    if (enumval == INT_MIN) {
-        sds enumerr = sdsnew("argument must be one of the following: ");
-        configEnum *enumNode = data.enumd.enum_value;
-        while(enumNode->name != NULL) {
-            enumerr = sdscatlen(enumerr, enumNode->name,
-                                strlen(enumNode->name));
-            enumerr = sdscatlen(enumerr, ", ", 2);
-            enumNode++;
-        }
-        sdsrange(enumerr,0,-3); /* Remove final ", ". */
-
-        strncpy(loadbuf, enumerr, LOADBUF_SIZE);
-        loadbuf[LOADBUF_SIZE - 1] = '\0';
-
-        sdsfree(enumerr);
-        *err = loadbuf;
-        return 0;
-    }
-    if (data.enumd.is_valid_fn && !data.enumd.is_valid_fn(enumval, err))
-        return 0;
-    int prev = *(data.enumd.config);
-    *(data.enumd.config) = enumval;
-    if (update && data.enumd.update_fn && !data.enumd.update_fn(enumval, prev, err)) {
-        *(data.enumd.config) = prev;
-        return 0;
-    }
-    return 1;
-}
-
-static void enumConfigGet(client *c, typeData data) {
-    addReplyBulkCString(c, configEnumGetNameOrUnknown(data.enumd.enum_value,*data.enumd.config));
-}
-
-static void enumConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
-    rewriteConfigEnumOption(state, name,*(data.enumd.config), data.enumd.enum_value, data.enumd.default_value);
-}
-
-#define createEnumConfig(name, alias, flags, enum, config_addr, default, is_valid, update) { \
-    embedCommonConfig(name, alias, flags) \
-    embedConfigInterface(enumConfigInit, enumConfigSet, enumConfigGet, enumConfigRewrite) \
-    .data.enumd = { \
-        .config = &(config_addr), \
-        .default_value = (default), \
-        .is_valid_fn = (is_valid), \
-        .update_fn = (update), \
-        .enum_value = (enum), \
-    } \
-}
-
-/* Gets a 'long long val' and sets it into the union, using a macro to get
- * compile time type check. */
-#define SET_NUMERIC_TYPE(val) \
-    if (data.numeric.numeric_type == NUMERIC_TYPE_INT) { \
-        *(data.numeric.config.i) = (int) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_UINT) { \
-        *(data.numeric.config.ui) = (unsigned int) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG) { \
-        *(data.numeric.config.l) = (long) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG) { \
-        *(data.numeric.config.ul) = (unsigned long) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG_LONG) { \
-        *(data.numeric.config.ll) = (long long) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG) { \
-        *(data.numeric.config.ull) = (unsigned long long) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) { \
-        *(data.numeric.config.st) = (size_t) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SSIZE_T) { \
-        *(data.numeric.config.sst) = (ssize_t) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_OFF_T) { \
-        *(data.numeric.config.ot) = (off_t) val; \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_TIME_T) { \
-        *(data.numeric.config.tt) = (time_t) val; \
-    }
-
-/* Gets a 'long long val' and sets it with the value from the union, using a
- * macro to get compile time type check. */
-#define GET_NUMERIC_TYPE(val) \
-    if (data.numeric.numeric_type == NUMERIC_TYPE_INT) { \
-        val = *(data.numeric.config.i); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_UINT) { \
-        val = *(data.numeric.config.ui); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG) { \
-        val = *(data.numeric.config.l); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG) { \
-        val = *(data.numeric.config.ul); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_LONG_LONG) { \
-        val = *(data.numeric.config.ll); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG) { \
-        val = *(data.numeric.config.ull); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) { \
-        val = *(data.numeric.config.st); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_SSIZE_T) { \
-        val = *(data.numeric.config.sst); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_OFF_T) { \
-        val = *(data.numeric.config.ot); \
-    } else if (data.numeric.numeric_type == NUMERIC_TYPE_TIME_T) { \
-        val = *(data.numeric.config.tt); \
-    }
-
-/* Numeric configs */
-static void numericConfigInit(typeData data) {
-    SET_NUMERIC_TYPE(data.numeric.default_value)
-}
-
-static int numericBoundaryCheck(typeData data, long long ll, const char **err) {
-    if (data.numeric.numeric_type == NUMERIC_TYPE_ULONG_LONG ||
-        data.numeric.numeric_type == NUMERIC_TYPE_UINT ||
-        data.numeric.numeric_type == NUMERIC_TYPE_SIZE_T) {
-        /* Boundary check for unsigned types */
-        unsigned long long ull = ll;
-        unsigned long long upper_bound = data.numeric.upper_bound;
-        unsigned long long lower_bound = data.numeric.lower_bound;
-        if (ull > upper_bound || ull < lower_bound) {
-            snprintf(loadbuf, LOADBUF_SIZE,
-                "argument must be between %llu and %llu inclusive",
-                lower_bound,
-                upper_bound);
-            *err = loadbuf;
-            return 0;
-        }
-    } else {
-        /* Boundary check for signed types */
-        if (ll > data.numeric.upper_bound || ll < data.numeric.lower_bound) {
-            snprintf(loadbuf, LOADBUF_SIZE,
-                "argument must be between %lld and %lld inclusive",
-                data.numeric.lower_bound,
-                data.numeric.upper_bound);
-            *err = loadbuf;
-            return 0;
-        }
-    }
-    return 1;
-}
-
-static int numericConfigSet(typeData data, sds value, int update, const char **err) {
-    long long ll, prev = 0;
-    if (data.numeric.is_memory) {
-        int memerr;
-        ll = memtoll(value, &memerr);
-        if (memerr || ll < 0) {
-            *err = "argument must be a memory value";
-            return 0;
-        }
-    } else {
-        if (!string2ll(value, sdslen(value),&ll)) {
-            *err = "argument couldn't be parsed into an integer" ;
-            return 0;
-        }
-    }
-
-    if (!numericBoundaryCheck(data, ll, err))
-        return 0;
-
-    if (data.numeric.is_valid_fn && !data.numeric.is_valid_fn(ll, err))
-        return 0;
-
-    GET_NUMERIC_TYPE(prev)
-    SET_NUMERIC_TYPE(ll)
-
-    if (update && data.numeric.update_fn && !data.numeric.update_fn(ll, prev, err)) {
-        SET_NUMERIC_TYPE(prev)
-        return 0;
-    }
-    return 1;
-}
-
-static void numericConfigGet(client *c, typeData data) {
-    char buf[128];
-    long long value = 0;
-
-    GET_NUMERIC_TYPE(value)
-
-    ll2string(buf, sizeof(buf), value);
-    addReplyBulkCString(c, buf);
-}
-
-static void numericConfigRewrite(typeData data, const char *name, struct rewriteConfigState *state) {
-    long long value = 0;
-
-    GET_NUMERIC_TYPE(value)
-
-    if (data.numeric.is_memory) {
-        rewriteConfigBytesOption(state, name, value, data.numeric.default_value);
-    } else {
-        rewriteConfigNumericalOption(state, name, value, data.numeric.default_value);
-    }
-}
-
-#define INTEGER_CONFIG 0
-#define MEMORY_CONFIG 1
-
-#define embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) { \
-    embedCommonConfig(name, alias, flags) \
-    embedConfigInterface(numericConfigInit, numericConfigSet, numericConfigGet, numericConfigRewrite) \
-    .data.numeric = { \
-        .lower_bound = (lower), \
-        .upper_bound = (upper), \
-        .default_value = (default), \
-        .is_valid_fn = (is_valid), \
-        .update_fn = (update), \
-        .is_memory = (memory),
-
-#define createIntConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_INT, \
-        .config.i = &(config_addr) \
-    } \
-}
-
-#define createUIntConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_UINT, \
-        .config.ui = &(config_addr) \
-    } \
-}
-
-#define createLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_LONG, \
-        .config.l = &(config_addr) \
-    } \
-}
-
-#define createULongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_ULONG, \
-        .config.ul = &(config_addr) \
-    } \
-}
-
-#define createLongLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_LONG_LONG, \
-        .config.ll = &(config_addr) \
-    } \
-}
-
-#define createULongLongConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_ULONG_LONG, \
-        .config.ull = &(config_addr) \
-    } \
-}
-
-#define createSizeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_SIZE_T, \
-        .config.st = &(config_addr) \
-    } \
-}
-
-#define createSSizeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_SSIZE_T, \
-        .config.sst = &(config_addr) \
-    } \
-}
-
-#define createTimeTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_TIME_T, \
-        .config.tt = &(config_addr) \
-    } \
-}
-
-#define createOffTConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-    embedCommonNumericalConfig(name, alias, flags, lower, upper, config_addr, default, memory, is_valid, update) \
-        .numeric_type = NUMERIC_TYPE_OFF_T, \
-        .config.ot = &(config_addr) \
-    } \
-}
-
-static int isValidActiveDefrag(int val, const char **err) {
-#ifndef HAVE_DEFRAG
-    if (val) {
-        *err = "Active defragmentation cannot be enabled: it "
-               "requires a Redis server compiled with a modified Jemalloc "
-               "like the one shipped by default with the Redis source "
-               "distribution";
-        return 0;
-    }
-#else
-    UNUSED(val);
-    UNUSED(err);
-#endif
-    return 1;
-}
-
-static int isValidDBfilename(char *val, const char **err) {
-    if (!pathIsBaseName(val)) {
-        *err = "dbfilename can't be a path, just a filename";
-        return 0;
-    }
-    return 1;
-}
-
-static int isValidAOFfilename(char *val, const char **err) {
-    if (!pathIsBaseName(val)) {
-        *err = "appendfilename can't be a path, just a filename";
-        return 0;
-    }
-    return 1;
-}
-
-/* Validate specified string is a valid proc-title-template */
-static int isValidProcTitleTemplate(char *val, const char **err) {
-    if (!validateProcTitleTemplate(val)) {
-        *err = "template format is invalid or contains unknown variables";
-        return 0;
-    }
-    return 1;
-}
-
-static int updateProcTitleTemplate(char *val, char *prev, const char **err) {
-    UNUSED(val);
-    UNUSED(prev);
-    if (redisSetProcTitle(NULL) == C_ERR) {
-        *err = "failed to set process title";
-        return 0;
-    }
-    return 1;
-}
-
-static int updateHZ(long long val, long long prev, const char **err) {
-    UNUSED(prev);
-    UNUSED(err);
-    /* Hz is more a hint from the user, so we accept values out of range
-     * but cap them to reasonable values. */
-    server.config_hz = val;
-    if (server.config_hz < CONFIG_MIN_HZ) server.config_hz = CONFIG_MIN_HZ;
-    if (server.config_hz > CONFIG_MAX_HZ) server.config_hz = CONFIG_MAX_HZ;
-    server.hz = server.config_hz;
-    return 1;
-}
-
-static int updatePort(long long val, long long prev, const char **err) {
-    /* Do nothing if port is unchanged */
-    if (val == prev) {
-        return 1;
-    }
-
-    if (changeListenPort(val, &server.ipfd, acceptTcpHandler) == C_ERR) {
-        *err = "Unable to listen on this port. Check server logs.";
-        return 0;
-    }
-
-    return 1;
-}
-
-static int updateJemallocBgThread(int val, int prev, const char **err) {
-    UNUSED(prev);
-    UNUSED(err);
-    set_jemalloc_bg_thread(val);
-    return 1;
-}
-
-static int updateReplBacklogSize(long long val, long long prev, const char **err) {
-    /* resizeReplicationBacklog sets server.repl_backlog_size, and relies on
-     * being able to tell when the size changes, so restore prev before calling it. */
-    UNUSED(err);
-    server.repl_backlog_size = prev;
-    resizeReplicationBacklog(val);
-    return 1;
-}
-
-static int updateMaxmemory(long long val, long long prev, const char **err) {
-    UNUSED(prev);
-    UNUSED(err);
-    if (val) {
-        size_t used = zmalloc_used_memory()-freeMemoryGetNotCountedMemory();
-        if ((unsigned long long)val < used) {
-            serverLog(LL_WARNING,"WARNING: the new maxmemory value set via CONFIG SET (%llu) is smaller than the current memory usage (%zu). This will result in key eviction and/or the inability to accept new write commands depending on the maxmemory-policy.", server.maxmemory, used);
-        }
-        performEvictions();
-    }
-    return 1;
-}
-
-static int updateGoodSlaves(long long val, long long prev, const char **err) {
-    UNUSED(val);
-    UNUSED(prev);
-    UNUSED(err);
-    refreshGoodSlavesCount();
-    return 1;
-}
-
-static int updateAppendonly(int val, int prev, const char **err) {
-    UNUSED(prev);
-    if (val == 0 && server.aof_state != AOF_OFF) {
-        stopAppendOnly();
-    } else if (val && server.aof_state == AOF_OFF) {
-        if (startAppendOnly() == C_ERR) {
-            *err = "Unable to turn on AOF. Check server logs.";
-            return 0;
-        }
-    }
-    return 1;
-}
-
-static int updateSighandlerEnabled(int val, int prev, const char **err) {
-    UNUSED(err);
-    UNUSED(prev);
-    if (val)
-        setupSignalHandlers();
-    else
-        removeSignalHandlers();
-    return 1;
-}
-
-static int updateMaxclients(long long val, long long prev, const char **err) {
-    /* Try to check if the OS is capable of supporting so many FDs. */
-    if (val > prev) {
-        adjustOpenFilesLimit();
-        if (server.maxclients != val) {
-            static char msg[128];
-            sprintf(msg, "The operating system is not able to handle the specified number of clients, try with %d", server.maxclients);
-            *err = msg;
-            if (server.maxclients > prev) {
-                server.maxclients = prev;
-                adjustOpenFilesLimit();
-            }
-            return 0;
-        }
-        if ((unsigned int) aeGetSetSize(server.el) <
-            server.maxclients + CONFIG_FDSET_INCR)
-        {
-            if (aeResizeSetSize(server.el,
-                server.maxclients + CONFIG_FDSET_INCR) == AE_ERR)
-            {
-                *err = "The event loop API used by Redis is not able to handle the specified number of clients";
-                return 0;
-            }
-        }
-    }
-    return 1;
-}
-
-static int updateOOMScoreAdj(int val, int prev, const char **err) {
-    UNUSED(prev);
-
-    if (val) {
-        if (setOOMScoreAdj(-1) == C_ERR) {
-            *err = "Failed to set current oom_score_adj. Check server logs.";
-            return 0;
-        }
-    }
-
-    return 1;
-}
-
-
-int updateRequirePass(sds val, sds prev, const char **err) {
-    UNUSED(prev);
-    UNUSED(err);
-    /* The old "requirepass" directive just translates to setting
-     * a password to the default user. The only thing we do
-     * additionally is to remember the cleartext password in this
-     * case, for backward compatibility with Redis <= 5. */
-    ACLUpdateDefaultUserPassword(val);
-    return 1;
-}
-
-#ifdef USE_OPENSSL
-static int updateTlsCfg(char *val, char *prev, const char **err) {
-    UNUSED(val);
-    UNUSED(prev);
-    UNUSED(err);
-
-    /* If TLS is enabled, try to configure OpenSSL. */
-    if ((server.tls_port || server.tls_replication || server.tls_cluster)
-            && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
-        *err = "Unable to update TLS configuration. Check server logs.";
-        return 0;
-    }
-    return 1;
-}
-static int updateTlsCfgBool(int val, int prev, const char **err) {
-    UNUSED(val);
-    UNUSED(prev);
-    return updateTlsCfg(NULL, NULL, err);
-}
-
-static int updateTlsCfgInt(long long val, long long prev, const char **err) {
-    UNUSED(val);
-    UNUSED(prev);
-    return updateTlsCfg(NULL, NULL, err);
-}
-
-static int updateTLSPort(long long val, long long prev, const char **err) {
-    /* Do nothing if port is unchanged */
-    if (val == prev) {
-        return 1;
-    }
-
-    /* Configure TLS if tls is enabled */
-    if (prev == 0 && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
-        *err = "Unable to update TLS configuration. Check server logs.";
-        return 0;
-    }
-
-    if (changeListenPort(val, &server.tlsfd, acceptTLSHandler) == C_ERR) {
-        *err = "Unable to listen on this port. Check server logs.";
-        return 0;
-    }
-
-    return 1;
-}
-
-#endif  /* USE_OPENSSL */
-
-standardConfig configs[] = {
-    /* Bool configs */
-    createBoolConfig("rdbchecksum", NULL, IMMUTABLE_CONFIG, server.rdb_checksum, 1, NULL, NULL),
-    createBoolConfig("daemonize", NULL, IMMUTABLE_CONFIG, server.daemonize, 0, NULL, NULL),
-    createBoolConfig("io-threads-do-reads", NULL, IMMUTABLE_CONFIG, server.io_threads_do_reads, 0,NULL, NULL), /* Read + parse from threads? */
-    createBoolConfig("lua-replicate-commands", NULL, MODIFIABLE_CONFIG, server.lua_always_replicate_commands, 1, NULL, NULL),
-    createBoolConfig("always-show-logo", NULL, IMMUTABLE_CONFIG, server.always_show_logo, 0, NULL, NULL),
-    createBoolConfig("protected-mode", NULL, MODIFIABLE_CONFIG, server.protected_mode, 1, NULL, NULL),
-    createBoolConfig("rdbcompression", NULL, MODIFIABLE_CONFIG, server.rdb_compression, 1, NULL, NULL),
-    createBoolConfig("rdb-del-sync-files", NULL, MODIFIABLE_CONFIG, server.rdb_del_sync_files, 0, NULL, NULL),
-    createBoolConfig("activerehashing", NULL, MODIFIABLE_CONFIG, server.activerehashing, 1, NULL, NULL),
-    createBoolConfig("stop-writes-on-bgsave-error", NULL, MODIFIABLE_CONFIG, server.stop_writes_on_bgsave_err, 1, NULL, NULL),
-    createBoolConfig("set-proc-title", NULL, IMMUTABLE_CONFIG, server.set_proc_title, 1, NULL, NULL), /* Should setproctitle be used? */
-    createBoolConfig("dynamic-hz", NULL, MODIFIABLE_CONFIG, server.dynamic_hz, 1, NULL, NULL), /* Adapt hz to # of clients.*/
-    createBoolConfig("lazyfree-lazy-eviction", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_eviction, 0, NULL, NULL),
-    createBoolConfig("lazyfree-lazy-expire", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_expire, 0, NULL, NULL),
-    createBoolConfig("lazyfree-lazy-server-del", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_server_del, 0, NULL, NULL),
-    createBoolConfig("lazyfree-lazy-user-del", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_user_del , 0, NULL, NULL),
-    createBoolConfig("lazyfree-lazy-user-flush", NULL, MODIFIABLE_CONFIG, server.lazyfree_lazy_user_flush , 0, NULL, NULL),
-    createBoolConfig("repl-disable-tcp-nodelay", NULL, MODIFIABLE_CONFIG, server.repl_disable_tcp_nodelay, 0, NULL, NULL),
-    createBoolConfig("repl-diskless-sync", NULL, MODIFIABLE_CONFIG, server.repl_diskless_sync, 0, NULL, NULL),
-    createBoolConfig("gopher-enabled", NULL, MODIFIABLE_CONFIG, server.gopher_enabled, 0, NULL, NULL),
-    createBoolConfig("aof-rewrite-incremental-fsync", NULL, MODIFIABLE_CONFIG, server.aof_rewrite_incremental_fsync, 1, NULL, NULL),
-    createBoolConfig("no-appendfsync-on-rewrite", NULL, MODIFIABLE_CONFIG, server.aof_no_fsync_on_rewrite, 0, NULL, NULL),
-    createBoolConfig("cluster-require-full-coverage", NULL, MODIFIABLE_CONFIG, server.cluster_require_full_coverage, 1, NULL, NULL),
-    createBoolConfig("rdb-save-incremental-fsync", NULL, MODIFIABLE_CONFIG, server.rdb_save_incremental_fsync, 1, NULL, NULL),
-    createBoolConfig("aof-load-truncated", NULL, MODIFIABLE_CONFIG, server.aof_load_truncated, 1, NULL, NULL),
-    createBoolConfig("aof-use-rdb-preamble", NULL, MODIFIABLE_CONFIG, server.aof_use_rdb_preamble, 1, NULL, NULL),
-    createBoolConfig("cluster-replica-no-failover", "cluster-slave-no-failover", MODIFIABLE_CONFIG, server.cluster_slave_no_failover, 0, NULL, NULL), /* Failover by default. */
-    createBoolConfig("replica-lazy-flush", "slave-lazy-flush", MODIFIABLE_CONFIG, server.repl_slave_lazy_flush, 0, NULL, NULL),
-    createBoolConfig("replica-serve-stale-data", "slave-serve-stale-data", MODIFIABLE_CONFIG, server.repl_serve_stale_data, 1, NULL, NULL),
-    createBoolConfig("replica-read-only", "slave-read-only", MODIFIABLE_CONFIG, server.repl_slave_ro, 1, NULL, NULL),
-    createBoolConfig("replica-ignore-maxmemory", "slave-ignore-maxmemory", MODIFIABLE_CONFIG, server.repl_slave_ignore_maxmemory, 1, NULL, NULL),
-    createBoolConfig("jemalloc-bg-thread", NULL, MODIFIABLE_CONFIG, server.jemalloc_bg_thread, 1, NULL, updateJemallocBgThread),
-    createBoolConfig("activedefrag", NULL, MODIFIABLE_CONFIG, server.active_defrag_enabled, 0, isValidActiveDefrag, NULL),
-    createBoolConfig("syslog-enabled", NULL, IMMUTABLE_CONFIG, server.syslog_enabled, 0, NULL, NULL),
-    createBoolConfig("cluster-enabled", NULL, IMMUTABLE_CONFIG, server.cluster_enabled, 0, NULL, NULL),
-    createBoolConfig("appendonly", NULL, MODIFIABLE_CONFIG, server.aof_enabled, 0, NULL, updateAppendonly),
-    createBoolConfig("cluster-allow-reads-when-down", NULL, MODIFIABLE_CONFIG, server.cluster_allow_reads_when_down, 0, NULL, NULL),
-    createBoolConfig("crash-log-enabled", NULL, MODIFIABLE_CONFIG, server.crashlog_enabled, 1, NULL, updateSighandlerEnabled),
-    createBoolConfig("crash-memcheck-enabled", NULL, MODIFIABLE_CONFIG, server.memcheck_enabled, 1, NULL, NULL),
-    createBoolConfig("use-exit-on-panic", NULL, MODIFIABLE_CONFIG, server.use_exit_on_panic, 0, NULL, NULL),
-    createBoolConfig("disable-thp", NULL, MODIFIABLE_CONFIG, server.disable_thp, 1, NULL, NULL),
-    createBoolConfig("cluster-allow-replica-migration", NULL, MODIFIABLE_CONFIG, server.cluster_allow_replica_migration, 1, NULL, NULL),
-    createBoolConfig("replica-announced", NULL, MODIFIABLE_CONFIG, server.replica_announced, 1, NULL, NULL),
-
-    /* String Configs */
-    createStringConfig("aclfile", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.acl_filename, "", NULL, NULL),
-    createStringConfig("unixsocket", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.unixsocket, NULL, NULL, NULL),
-    createStringConfig("pidfile", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.pidfile, NULL, NULL, NULL),
-    createStringConfig("replica-announce-ip", "slave-announce-ip", MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.slave_announce_ip, NULL, NULL, NULL),
-    createStringConfig("masteruser", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.masteruser, NULL, NULL, NULL),
-    createStringConfig("cluster-announce-ip", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.cluster_announce_ip, NULL, NULL, NULL),
-    createStringConfig("syslog-ident", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.syslog_ident, "redis", NULL, NULL),
-    createStringConfig("dbfilename", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.rdb_filename, "dump.rdb", isValidDBfilename, NULL),
-    createStringConfig("appendfilename", NULL, IMMUTABLE_CONFIG, ALLOW_EMPTY_STRING, server.aof_filename, "appendonly.aof", isValidAOFfilename, NULL),
-    createStringConfig("server_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.server_cpulist, NULL, NULL, NULL),
-    createStringConfig("bio_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.bio_cpulist, NULL, NULL, NULL),
-    createStringConfig("aof_rewrite_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.aof_rewrite_cpulist, NULL, NULL, NULL),
-    createStringConfig("bgsave_cpulist", NULL, IMMUTABLE_CONFIG, EMPTY_STRING_IS_NULL, server.bgsave_cpulist, NULL, NULL, NULL),
-    createStringConfig("ignore-warnings", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.ignore_warnings, "", NULL, NULL),
-    createStringConfig("proc-title-template", NULL, MODIFIABLE_CONFIG, ALLOW_EMPTY_STRING, server.proc_title_template, CONFIG_DEFAULT_PROC_TITLE_TEMPLATE, isValidProcTitleTemplate, updateProcTitleTemplate),
-
-    /* SDS Configs */
-    createSDSConfig("masterauth", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.masterauth, NULL, NULL, NULL),
-    createSDSConfig("requirepass", NULL, MODIFIABLE_CONFIG | SENSITIVE_CONFIG, EMPTY_STRING_IS_NULL, server.requirepass, NULL, NULL, updateRequirePass),
-
-    /* Enum Configs */
-    createEnumConfig("supervised", NULL, IMMUTABLE_CONFIG, supervised_mode_enum, server.supervised_mode, SUPERVISED_NONE, NULL, NULL),
-    createEnumConfig("syslog-facility", NULL, IMMUTABLE_CONFIG, syslog_facility_enum, server.syslog_facility, LOG_LOCAL0, NULL, NULL),
-    createEnumConfig("repl-diskless-load", NULL, MODIFIABLE_CONFIG, repl_diskless_load_enum, server.repl_diskless_load, REPL_DISKLESS_LOAD_DISABLED, NULL, NULL),
-    createEnumConfig("loglevel", NULL, MODIFIABLE_CONFIG, loglevel_enum, server.verbosity, LL_NOTICE, NULL, NULL),
-    createEnumConfig("maxmemory-policy", NULL, MODIFIABLE_CONFIG, maxmemory_policy_enum, server.maxmemory_policy, MAXMEMORY_NO_EVICTION, NULL, NULL),
-    createEnumConfig("appendfsync", NULL, MODIFIABLE_CONFIG, aof_fsync_enum, server.aof_fsync, AOF_FSYNC_EVERYSEC, NULL, NULL),
-    createEnumConfig("oom-score-adj", NULL, MODIFIABLE_CONFIG, oom_score_adj_enum, server.oom_score_adj, OOM_SCORE_ADJ_NO, NULL, updateOOMScoreAdj),
-    createEnumConfig("acl-pubsub-default", NULL, MODIFIABLE_CONFIG, acl_pubsub_default_enum, server.acl_pubsub_default, USER_FLAG_ALLCHANNELS, NULL, NULL),
-    createEnumConfig("sanitize-dump-payload", NULL, MODIFIABLE_CONFIG, sanitize_dump_payload_enum, server.sanitize_dump_payload, SANITIZE_DUMP_NO, NULL, NULL),
-
-    /* Integer configs */
-    createIntConfig("databases", NULL, IMMUTABLE_CONFIG, 1, INT_MAX, server.dbnum, 16, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.port, 6379, INTEGER_CONFIG, NULL, updatePort), /* TCP port. */
-    createIntConfig("io-threads", NULL, IMMUTABLE_CONFIG, 1, 128, server.io_threads_num, 1, INTEGER_CONFIG, NULL, NULL), /* Single threaded by default */
-    createIntConfig("auto-aof-rewrite-percentage", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.aof_rewrite_perc, 100, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("cluster-replica-validity-factor", "cluster-slave-validity-factor", MODIFIABLE_CONFIG, 0, INT_MAX, server.cluster_slave_validity_factor, 10, INTEGER_CONFIG, NULL, NULL), /* Slave max data age factor. */
-    createIntConfig("list-max-ziplist-size", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.list_max_ziplist_size, -2, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("tcp-keepalive", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tcpkeepalive, 300, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("cluster-migration-barrier", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.cluster_migration_barrier, 1, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("active-defrag-cycle-min", NULL, MODIFIABLE_CONFIG, 1, 99, server.active_defrag_cycle_min, 1, INTEGER_CONFIG, NULL, NULL), /* Default: 1% CPU min (at lower threshold) */
-    createIntConfig("active-defrag-cycle-max", NULL, MODIFIABLE_CONFIG, 1, 99, server.active_defrag_cycle_max, 25, INTEGER_CONFIG, NULL, NULL), /* Default: 25% CPU max (at upper threshold) */
-    createIntConfig("active-defrag-threshold-lower", NULL, MODIFIABLE_CONFIG, 0, 1000, server.active_defrag_threshold_lower, 10, INTEGER_CONFIG, NULL, NULL), /* Default: don't defrag when fragmentation is below 10% */
-    createIntConfig("active-defrag-threshold-upper", NULL, MODIFIABLE_CONFIG, 0, 1000, server.active_defrag_threshold_upper, 100, INTEGER_CONFIG, NULL, NULL), /* Default: maximum defrag force at 100% fragmentation */
-    createIntConfig("lfu-log-factor", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.lfu_log_factor, 10, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("lfu-decay-time", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.lfu_decay_time, 1, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("replica-priority", "slave-priority", MODIFIABLE_CONFIG, 0, INT_MAX, server.slave_priority, 100, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("repl-diskless-sync-delay", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_diskless_sync_delay, 5, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("maxmemory-samples", NULL, MODIFIABLE_CONFIG, 1, INT_MAX, server.maxmemory_samples, 5, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("maxmemory-eviction-tenacity", NULL, MODIFIABLE_CONFIG, 0, 100, server.maxmemory_eviction_tenacity, 10, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("timeout", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.maxidletime, 0, INTEGER_CONFIG, NULL, NULL), /* Default client timeout: infinite */
-    createIntConfig("replica-announce-port", "slave-announce-port", MODIFIABLE_CONFIG, 0, 65535, server.slave_announce_port, 0, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("tcp-backlog", NULL, IMMUTABLE_CONFIG, 0, INT_MAX, server.tcp_backlog, 511, INTEGER_CONFIG, NULL, NULL), /* TCP listen backlog. */
-    createIntConfig("cluster-announce-bus-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_bus_port, 0, INTEGER_CONFIG, NULL, NULL), /* Default: Use +10000 offset. */
-    createIntConfig("cluster-announce-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_port, 0, INTEGER_CONFIG, NULL, NULL), /* Use server.port */
-    createIntConfig("cluster-announce-tls-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.cluster_announce_tls_port, 0, INTEGER_CONFIG, NULL, NULL), /* Use server.tls_port */
-    createIntConfig("repl-timeout", NULL, MODIFIABLE_CONFIG, 1, INT_MAX, server.repl_timeout, 60, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("repl-ping-replica-period", "repl-ping-slave-period", MODIFIABLE_CONFIG, 1, INT_MAX, server.repl_ping_slave_period, 10, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("list-compress-depth", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.list_compress_depth, 0, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("rdb-key-save-delay", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.rdb_key_save_delay, 0, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("key-load-delay", NULL, MODIFIABLE_CONFIG, INT_MIN, INT_MAX, server.key_load_delay, 0, INTEGER_CONFIG, NULL, NULL),
-    createIntConfig("active-expire-effort", NULL, MODIFIABLE_CONFIG, 1, 10, server.active_expire_effort, 1, INTEGER_CONFIG, NULL, NULL), /* From 1 to 10. */
-    createIntConfig("hz", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.config_hz, CONFIG_DEFAULT_HZ, INTEGER_CONFIG, NULL, updateHZ),
-    createIntConfig("min-replicas-to-write", "min-slaves-to-write", MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_min_slaves_to_write, 0, INTEGER_CONFIG, NULL, updateGoodSlaves),
-    createIntConfig("min-replicas-max-lag", "min-slaves-max-lag", MODIFIABLE_CONFIG, 0, INT_MAX, server.repl_min_slaves_max_lag, 10, INTEGER_CONFIG, NULL, updateGoodSlaves),
-
-    /* Unsigned int configs */
-    createUIntConfig("maxclients", NULL, MODIFIABLE_CONFIG, 1, UINT_MAX, server.maxclients, 10000, INTEGER_CONFIG, NULL, updateMaxclients),
-
-    /* Unsigned Long configs */
-    createULongConfig("active-defrag-max-scan-fields", NULL, MODIFIABLE_CONFIG, 1, LONG_MAX, server.active_defrag_max_scan_fields, 1000, INTEGER_CONFIG, NULL, NULL), /* Default: keys with more than 1000 fields will be processed separately */
-    createULongConfig("slowlog-max-len", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.slowlog_max_len, 128, INTEGER_CONFIG, NULL, NULL),
-    createULongConfig("acllog-max-len", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.acllog_max_len, 128, INTEGER_CONFIG, NULL, NULL),
-
-    /* Long Long configs */
-    createLongLongConfig("lua-time-limit", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.lua_time_limit, 5000, INTEGER_CONFIG, NULL, NULL),/* milliseconds */
-    createLongLongConfig("cluster-node-timeout", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.cluster_node_timeout, 15000, INTEGER_CONFIG, NULL, NULL),
-    createLongLongConfig("slowlog-log-slower-than", NULL, MODIFIABLE_CONFIG, -1, LLONG_MAX, server.slowlog_log_slower_than, 10000, INTEGER_CONFIG, NULL, NULL),
-    createLongLongConfig("latency-monitor-threshold", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.latency_monitor_threshold, 0, INTEGER_CONFIG, NULL, NULL),
-    createLongLongConfig("proto-max-bulk-len", NULL, MODIFIABLE_CONFIG, 1024*1024, LONG_MAX, server.proto_max_bulk_len, 512ll*1024*1024, MEMORY_CONFIG, NULL, NULL), /* Bulk request max size */
-    createLongLongConfig("stream-node-max-entries", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.stream_node_max_entries, 100, INTEGER_CONFIG, NULL, NULL),
-    createLongLongConfig("repl-backlog-size", NULL, MODIFIABLE_CONFIG, 1, LLONG_MAX, server.repl_backlog_size, 1024*1024, MEMORY_CONFIG, NULL, updateReplBacklogSize), /* Default: 1mb */
-
-    /* Unsigned Long Long configs */
-    createULongLongConfig("maxmemory", NULL, MODIFIABLE_CONFIG, 0, ULLONG_MAX, server.maxmemory, 0, MEMORY_CONFIG, NULL, updateMaxmemory),
-
-    /* Size_t configs */
-    createSizeTConfig("hash-max-ziplist-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hash_max_ziplist_entries, 512, INTEGER_CONFIG, NULL, NULL),
-    createSizeTConfig("set-max-intset-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.set_max_intset_entries, 512, INTEGER_CONFIG, NULL, NULL),
-    createSizeTConfig("zset-max-ziplist-entries", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.zset_max_ziplist_entries, 128, INTEGER_CONFIG, NULL, NULL),
-    createSizeTConfig("active-defrag-ignore-bytes", NULL, MODIFIABLE_CONFIG, 1, LLONG_MAX, server.active_defrag_ignore_bytes, 100<<20, MEMORY_CONFIG, NULL, NULL), /* Default: don't defrag if frag overhead is below 100mb */
-    createSizeTConfig("hash-max-ziplist-value", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hash_max_ziplist_value, 64, MEMORY_CONFIG, NULL, NULL),
-    createSizeTConfig("stream-node-max-bytes", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.stream_node_max_bytes, 4096, MEMORY_CONFIG, NULL, NULL),
-    createSizeTConfig("zset-max-ziplist-value", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.zset_max_ziplist_value, 64, MEMORY_CONFIG, NULL, NULL),
-    createSizeTConfig("hll-sparse-max-bytes", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.hll_sparse_max_bytes, 3000, MEMORY_CONFIG, NULL, NULL),
-    createSizeTConfig("tracking-table-max-keys", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.tracking_table_max_keys, 1000000, INTEGER_CONFIG, NULL, NULL), /* Default: 1 million keys max. */
-    createSizeTConfig("client-query-buffer-limit", NULL, MODIFIABLE_CONFIG, 1024*1024, LONG_MAX, server.client_max_querybuf_len, 1024*1024*1024, MEMORY_CONFIG, NULL, NULL), /* Default: 1GB max query buffer. */
-
-    /* Other configs */
-    createTimeTConfig("repl-backlog-ttl", NULL, MODIFIABLE_CONFIG, 0, LONG_MAX, server.repl_backlog_time_limit, 60*60, INTEGER_CONFIG, NULL, NULL), /* Default: 1 hour */
-    createOffTConfig("auto-aof-rewrite-min-size", NULL, MODIFIABLE_CONFIG, 0, LLONG_MAX, server.aof_rewrite_min_size, 64*1024*1024, MEMORY_CONFIG, NULL, NULL),
-
-#ifdef USE_OPENSSL
-    createIntConfig("tls-port", NULL, MODIFIABLE_CONFIG, 0, 65535, server.tls_port, 0, INTEGER_CONFIG, NULL, updateTLSPort), /* TCP port. */
-    createIntConfig("tls-session-cache-size", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tls_ctx_config.session_cache_size, 20*1024, INTEGER_CONFIG, NULL, updateTlsCfgInt),
-    createIntConfig("tls-session-cache-timeout", NULL, MODIFIABLE_CONFIG, 0, INT_MAX, server.tls_ctx_config.session_cache_timeout, 300, INTEGER_CONFIG, NULL, updateTlsCfgInt),
-    createBoolConfig("tls-cluster", NULL, MODIFIABLE_CONFIG, server.tls_cluster, 0, NULL, updateTlsCfgBool),
-    createBoolConfig("tls-replication", NULL, MODIFIABLE_CONFIG, server.tls_replication, 0, NULL, updateTlsCfgBool),
-    createEnumConfig("tls-auth-clients", NULL, MODIFIABLE_CONFIG, tls_auth_clients_enum, server.tls_auth_clients, TLS_CLIENT_AUTH_YES, NULL, NULL),
-    createBoolConfig("tls-prefer-server-ciphers", NULL, MODIFIABLE_CONFIG, server.tls_ctx_config.prefer_server_ciphers, 0, NULL, updateTlsCfgBool),
-    createBoolConfig("tls-session-caching", NULL, MODIFIABLE_CONFIG, server.tls_ctx_config.session_caching, 1, NULL, updateTlsCfgBool),
-    createStringConfig("tls-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.cert_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-key-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.key_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-key-file-pass", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.key_file_pass, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-client-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_cert_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-client-key-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_key_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-client-key-file-pass", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.client_key_file_pass, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-dh-params-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.dh_params_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-ca-cert-file", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ca_cert_file, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-ca-cert-dir", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ca_cert_dir, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-protocols", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.protocols, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-ciphers", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ciphers, NULL, NULL, updateTlsCfg),
-    createStringConfig("tls-ciphersuites", NULL, MODIFIABLE_CONFIG, EMPTY_STRING_IS_NULL, server.tls_ctx_config.ciphersuites, NULL, NULL, updateTlsCfg),
-#endif
-
-    /* NULL Terminator */
-    {NULL}
-};
-
-/*-----------------------------------------------------------------------------
- * CONFIG command entry point
- *----------------------------------------------------------------------------*/
-
-void configCommand(client *c) {
-    /* Only allow CONFIG GET while loading. */
-    if (server.loading && strcasecmp(c->argv[1]->ptr,"get")) {
-        addReplyError(c,"Only CONFIG GET is allowed during loading");
-        return;
-    }
-
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"GET <pattern>",
-"    Return parameters matching the glob-like <pattern> and their values.",
-"SET <directive> <value>",
-"    Set the configuration <directive> to <value>.",
-"RESETSTAT",
-"    Reset statistics reported by the INFO command.",
-"REWRITE",
-"    Rewrite the configuration file.",
-NULL
-        };
-
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"set") && c->argc == 4) {
-        configSetCommand(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"get") && c->argc == 3) {
-        configGetCommand(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"resetstat") && c->argc == 2) {
-        resetServerStats();
-        resetCommandTableStats();
-        resetErrorTableStats();
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"rewrite") && c->argc == 2) {
-        if (server.configfile == NULL) {
-            addReplyError(c,"The server is running without a config file");
-            return;
-        }
-        if (rewriteConfig(server.configfile, 0) == -1) {
-            serverLog(LL_WARNING,"CONFIG REWRITE failed: %s", strerror(errno));
-            addReplyErrorFormat(c,"Rewriting config file: %s", strerror(errno));
-        } else {
-            serverLog(LL_WARNING,"CONFIG REWRITE executed with success.");
-            addReply(c,shared.ok);
-        }
-    } else {
-        addReplySubcommandSyntaxError(c);
-        return;
-    }
-}
diff --git a/redis-stable/src/config.h b/redis-stable/src/config.h
deleted file mode 100644
index 2f351a1b..00000000
--- a/redis-stable/src/config.h
+++ /dev/null
@@ -1,267 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __CONFIG_H
-#define __CONFIG_H
-
-#ifdef __APPLE__
-#include <AvailabilityMacros.h>
-#endif
-
-#ifdef __linux__
-#include <features.h>
-#include <fcntl.h>
-#endif
-
-/* Define redis_fstat to fstat or fstat64() */
-#if defined(__APPLE__) && !defined(MAC_OS_X_VERSION_10_6)
-#define redis_fstat fstat64
-#define redis_stat stat64
-#else
-#define redis_fstat fstat
-#define redis_stat stat
-#endif
-
-/* Test for proc filesystem */
-#ifdef __linux__
-#define HAVE_PROC_STAT 1
-#define HAVE_PROC_MAPS 1
-#define HAVE_PROC_SMAPS 1
-#define HAVE_PROC_SOMAXCONN 1
-#define HAVE_PROC_OOM_SCORE_ADJ 1
-#endif
-
-/* Test for task_info() */
-#if defined(__APPLE__)
-#define HAVE_TASKINFO 1
-#endif
-
-/* Test for backtrace() */
-#if defined(__APPLE__) || (defined(__linux__) && defined(__GLIBC__)) || \
-    defined(__FreeBSD__) || ((defined(__OpenBSD__) || defined(__NetBSD__)) && defined(USE_BACKTRACE))\
- || defined(__DragonFly__) || (defined(__UCLIBC__) && defined(__UCLIBC_HAS_BACKTRACE__))
-#define HAVE_BACKTRACE 1
-#endif
-
-/* MSG_NOSIGNAL. */
-#ifdef __linux__
-#define HAVE_MSG_NOSIGNAL 1
-#endif
-
-/* Test for polling API */
-#ifdef __linux__
-#define HAVE_EPOLL 1
-#endif
-
-#if (defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)) || defined(__FreeBSD__) || defined(__OpenBSD__) || defined (__NetBSD__)
-#define HAVE_KQUEUE 1
-#endif
-
-#ifdef __sun
-#include <sys/feature_tests.h>
-#ifdef _DTRACE_VERSION
-#define HAVE_EVPORT 1
-#define HAVE_PSINFO 1
-#endif
-#endif
-
-/* Define redis_fsync to fdatasync() in Linux and fsync() for all the rest */
-#ifdef __linux__
-#define redis_fsync fdatasync
-#else
-#define redis_fsync fsync
-#endif
-
-#if __GNUC__ >= 4
-#define redis_unreachable __builtin_unreachable
-#else
-#define redis_unreachable abort
-#endif
-
-#if __GNUC__ >= 3
-#define likely(x) __builtin_expect(!!(x), 1)
-#define unlikely(x) __builtin_expect(!!(x), 0)
-#else
-#define likely(x) (x)
-#define unlikely(x) (x)
-#endif
-
-/* Define rdb_fsync_range to sync_file_range() on Linux, otherwise we use
- * the plain fsync() call. */
-#if (defined(__linux__) && defined(SYNC_FILE_RANGE_WAIT_BEFORE))
-#define rdb_fsync_range(fd,off,size) sync_file_range(fd,off,size,SYNC_FILE_RANGE_WAIT_BEFORE|SYNC_FILE_RANGE_WRITE)
-#else
-#define rdb_fsync_range(fd,off,size) fsync(fd)
-#endif
-
-/* Check if we can use setproctitle().
- * BSD systems have support for it, we provide an implementation for
- * Linux and osx. */
-#if (defined __NetBSD__ || defined __FreeBSD__ || defined __OpenBSD__)
-#define USE_SETPROCTITLE
-#endif
-
-#if defined(__HAIKU__)
-#define ESOCKTNOSUPPORT 0
-#endif
-
-#if (defined __linux || defined __APPLE__)
-#define USE_SETPROCTITLE
-#define INIT_SETPROCTITLE_REPLACEMENT
-void spt_init(int argc, char *argv[]);
-void setproctitle(const char *fmt, ...);
-#endif
-
-/* Byte ordering detection */
-#include <sys/types.h> /* This will likely define BYTE_ORDER */
-
-#ifndef BYTE_ORDER
-#if (BSD >= 199103)
-# include <machine/endian.h>
-#else
-#if defined(linux) || defined(__linux__)
-# include <endian.h>
-#else
-#define	LITTLE_ENDIAN	1234	/* least-significant byte first (vax, pc) */
-#define	BIG_ENDIAN	4321	/* most-significant byte first (IBM, net) */
-#define	PDP_ENDIAN	3412	/* LSB first in word, MSW first in long (pdp)*/
-
-#if defined(__i386__) || defined(__x86_64__) || defined(__amd64__) || \
-   defined(vax) || defined(ns32000) || defined(sun386) || \
-   defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \
-   defined(__alpha__) || defined(__alpha)
-#define BYTE_ORDER    LITTLE_ENDIAN
-#endif
-
-#if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \
-    defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \
-    defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\
-    defined(apollo) || defined(__convex__) || defined(_CRAY) || \
-    defined(__hppa) || defined(__hp9000) || \
-    defined(__hp9000s300) || defined(__hp9000s700) || \
-    defined (BIT_ZERO_ON_LEFT) || defined(m68k) || defined(__sparc)
-#define BYTE_ORDER	BIG_ENDIAN
-#endif
-#endif /* linux */
-#endif /* BSD */
-#endif /* BYTE_ORDER */
-
-/* Sometimes after including an OS-specific header that defines the
- * endianness we end with __BYTE_ORDER but not with BYTE_ORDER that is what
- * the Redis code uses. In this case let's define everything without the
- * underscores. */
-#ifndef BYTE_ORDER
-#ifdef __BYTE_ORDER
-#if defined(__LITTLE_ENDIAN) && defined(__BIG_ENDIAN)
-#ifndef LITTLE_ENDIAN
-#define LITTLE_ENDIAN __LITTLE_ENDIAN
-#endif
-#ifndef BIG_ENDIAN
-#define BIG_ENDIAN __BIG_ENDIAN
-#endif
-#if (__BYTE_ORDER == __LITTLE_ENDIAN)
-#define BYTE_ORDER LITTLE_ENDIAN
-#else
-#define BYTE_ORDER BIG_ENDIAN
-#endif
-#endif
-#endif
-#endif
-
-#if !defined(BYTE_ORDER) || \
-    (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN)
-	/* you must determine what the correct bit order is for
-	 * your compiler - the next line is an intentional error
-	 * which will force your compiles to bomb until you fix
-	 * the above macros.
-	 */
-#error "Undefined or invalid BYTE_ORDER"
-#endif
-
-#if (__i386 || __amd64 || __powerpc__) && __GNUC__
-#define GNUC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__)
-#if defined(__clang__)
-#define HAVE_ATOMIC
-#endif
-#if (defined(__GLIBC__) && defined(__GLIBC_PREREQ))
-#if (GNUC_VERSION >= 40100 && __GLIBC_PREREQ(2, 6))
-#define HAVE_ATOMIC
-#endif
-#endif
-#endif
-
-/* Make sure we can test for ARM just checking for __arm__, since sometimes
- * __arm is defined but __arm__ is not. */
-#if defined(__arm) && !defined(__arm__)
-#define __arm__
-#endif
-#if defined (__aarch64__) && !defined(__arm64__)
-#define __arm64__
-#endif
-
-/* Make sure we can test for SPARC just checking for __sparc__. */
-#if defined(__sparc) && !defined(__sparc__)
-#define __sparc__
-#endif
-
-#if defined(__sparc__) || defined(__arm__)
-#define USE_ALIGNED_ACCESS
-#endif
-
-/* Define for redis_set_thread_title */
-#ifdef __linux__
-#define redis_set_thread_title(name) pthread_setname_np(pthread_self(), name)
-#else
-#if (defined __FreeBSD__ || defined __OpenBSD__)
-#include <pthread_np.h>
-#define redis_set_thread_title(name) pthread_set_name_np(pthread_self(), name)
-#elif defined __NetBSD__
-#include <pthread.h>
-#define redis_set_thread_title(name) pthread_setname_np(pthread_self(), "%s", name)
-#elif defined __HAIKU__
-#include <kernel/OS.h>
-#define redis_set_thread_title(name) rename_thread(find_thread(0), name)
-#else
-#if (defined __APPLE__ && defined(MAC_OS_X_VERSION_10_7))
-int pthread_setname_np(const char *name);
-#include <pthread.h>
-#define redis_set_thread_title(name) pthread_setname_np(name)
-#else
-#define redis_set_thread_title(name)
-#endif
-#endif
-#endif
-
-/* Check if we can use setcpuaffinity(). */
-#if (defined __linux || defined __NetBSD__ || defined __FreeBSD__ || defined __DragonFly__)
-#define USE_SETCPUAFFINITY
-void setcpuaffinity(const char *cpulist);
-#endif
-
-#endif
diff --git a/redis-stable/src/connection.c b/redis-stable/src/connection.c
deleted file mode 100644
index a5946322..00000000
--- a/redis-stable/src/connection.c
+++ /dev/null
@@ -1,433 +0,0 @@
-/*
- * Copyright (c) 2019, Redis Labs
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "connhelpers.h"
-
-/* The connections module provides a lean abstraction of network connections
- * to avoid direct socket and async event management across the Redis code base.
- *
- * It does NOT provide advanced connection features commonly found in similar
- * libraries such as complete in/out buffer management, throttling, etc. These
- * functions remain in networking.c.
- *
- * The primary goal is to allow transparent handling of TCP and TLS based
- * connections. To do so, connections have the following properties:
- *
- * 1. A connection may live before its corresponding socket exists.  This
- *    allows various context and configuration setting to be handled before
- *    establishing the actual connection.
- * 2. The caller may register/unregister logical read/write handlers to be
- *    called when the connection has data to read from/can accept writes.
- *    These logical handlers may or may not correspond to actual AE events,
- *    depending on the implementation (for TCP they are; for TLS they aren't).
- */
-
-ConnectionType CT_Socket;
-
-/* When a connection is created we must know its type already, but the
- * underlying socket may or may not exist:
- *
- * - For accepted connections, it exists as we do not model the listen/accept
- *   part; So caller calls connCreateSocket() followed by connAccept().
- * - For outgoing connections, the socket is created by the connection module
- *   itself; So caller calls connCreateSocket() followed by connConnect(),
- *   which registers a connect callback that fires on connected/error state
- *   (and after any transport level handshake was done).
- *
- * NOTE: An earlier version relied on connections being part of other structs
- * and not independently allocated. This could lead to further optimizations
- * like using container_of(), etc.  However it was discontinued in favor of
- * this approach for these reasons:
- *
- * 1. In some cases conns are created/handled outside the context of the
- * containing struct, in which case it gets a bit awkward to copy them.
- * 2. Future implementations may wish to allocate arbitrary data for the
- * connection.
- * 3. The container_of() approach is anyway risky because connections may
- * be embedded in different structs, not just client.
- */
-
-connection *connCreateSocket() {
-    connection *conn = zcalloc(sizeof(connection));
-    conn->type = &CT_Socket;
-    conn->fd = -1;
-
-    return conn;
-}
-
-/* Create a new socket-type connection that is already associated with
- * an accepted connection.
- *
- * The socket is not ready for I/O until connAccept() was called and
- * invoked the connection-level accept handler.
- *
- * Callers should use connGetState() and verify the created connection
- * is not in an error state (which is not possible for a socket connection,
- * but could but possible with other protocols).
- */
-connection *connCreateAcceptedSocket(int fd) {
-    connection *conn = connCreateSocket();
-    conn->fd = fd;
-    conn->state = CONN_STATE_ACCEPTING;
-    return conn;
-}
-
-static int connSocketConnect(connection *conn, const char *addr, int port, const char *src_addr,
-        ConnectionCallbackFunc connect_handler) {
-    int fd = anetTcpNonBlockBestEffortBindConnect(NULL,addr,port,src_addr);
-    if (fd == -1) {
-        conn->state = CONN_STATE_ERROR;
-        conn->last_errno = errno;
-        return C_ERR;
-    }
-
-    conn->fd = fd;
-    conn->state = CONN_STATE_CONNECTING;
-
-    conn->conn_handler = connect_handler;
-    aeCreateFileEvent(server.el, conn->fd, AE_WRITABLE,
-            conn->type->ae_handler, conn);
-
-    return C_OK;
-}
-
-/* Returns true if a write handler is registered */
-int connHasWriteHandler(connection *conn) {
-    return conn->write_handler != NULL;
-}
-
-/* Returns true if a read handler is registered */
-int connHasReadHandler(connection *conn) {
-    return conn->read_handler != NULL;
-}
-
-/* Associate a private data pointer with the connection */
-void connSetPrivateData(connection *conn, void *data) {
-    conn->private_data = data;
-}
-
-/* Get the associated private data pointer */
-void *connGetPrivateData(connection *conn) {
-    return conn->private_data;
-}
-
-/* ------ Pure socket connections ------- */
-
-/* A very incomplete list of implementation-specific calls.  Much of the above shall
- * move here as we implement additional connection types.
- */
-
-/* Close the connection and free resources. */
-static void connSocketClose(connection *conn) {
-    if (conn->fd != -1) {
-        aeDeleteFileEvent(server.el,conn->fd, AE_READABLE | AE_WRITABLE);
-        close(conn->fd);
-        conn->fd = -1;
-    }
-
-    /* If called from within a handler, schedule the close but
-     * keep the connection until the handler returns.
-     */
-    if (connHasRefs(conn)) {
-        conn->flags |= CONN_FLAG_CLOSE_SCHEDULED;
-        return;
-    }
-
-    zfree(conn);
-}
-
-static int connSocketWrite(connection *conn, const void *data, size_t data_len) {
-    int ret = write(conn->fd, data, data_len);
-    if (ret < 0 && errno != EAGAIN) {
-        conn->last_errno = errno;
-
-        /* Don't overwrite the state of a connection that is not already
-         * connected, not to mess with handler callbacks.
-         */
-        if (conn->state == CONN_STATE_CONNECTED)
-            conn->state = CONN_STATE_ERROR;
-    }
-
-    return ret;
-}
-
-static int connSocketRead(connection *conn, void *buf, size_t buf_len) {
-    int ret = read(conn->fd, buf, buf_len);
-    if (!ret) {
-        conn->state = CONN_STATE_CLOSED;
-    } else if (ret < 0 && errno != EAGAIN) {
-        conn->last_errno = errno;
-
-        /* Don't overwrite the state of a connection that is not already
-         * connected, not to mess with handler callbacks.
-         */
-        if (conn->state == CONN_STATE_CONNECTED)
-            conn->state = CONN_STATE_ERROR;
-    }
-
-    return ret;
-}
-
-static int connSocketAccept(connection *conn, ConnectionCallbackFunc accept_handler) {
-    int ret = C_OK;
-
-    if (conn->state != CONN_STATE_ACCEPTING) return C_ERR;
-    conn->state = CONN_STATE_CONNECTED;
-
-    connIncrRefs(conn);
-    if (!callHandler(conn, accept_handler)) ret = C_ERR;
-    connDecrRefs(conn);
-
-    return ret;
-}
-
-/* Register a write handler, to be called when the connection is writable.
- * If NULL, the existing handler is removed.
- *
- * The barrier flag indicates a write barrier is requested, resulting with
- * CONN_FLAG_WRITE_BARRIER set. This will ensure that the write handler is
- * always called before and not after the read handler in a single event
- * loop.
- */
-static int connSocketSetWriteHandler(connection *conn, ConnectionCallbackFunc func, int barrier) {
-    if (func == conn->write_handler) return C_OK;
-
-    conn->write_handler = func;
-    if (barrier)
-        conn->flags |= CONN_FLAG_WRITE_BARRIER;
-    else
-        conn->flags &= ~CONN_FLAG_WRITE_BARRIER;
-    if (!conn->write_handler)
-        aeDeleteFileEvent(server.el,conn->fd,AE_WRITABLE);
-    else
-        if (aeCreateFileEvent(server.el,conn->fd,AE_WRITABLE,
-                    conn->type->ae_handler,conn) == AE_ERR) return C_ERR;
-    return C_OK;
-}
-
-/* Register a read handler, to be called when the connection is readable.
- * If NULL, the existing handler is removed.
- */
-static int connSocketSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
-    if (func == conn->read_handler) return C_OK;
-
-    conn->read_handler = func;
-    if (!conn->read_handler)
-        aeDeleteFileEvent(server.el,conn->fd,AE_READABLE);
-    else
-        if (aeCreateFileEvent(server.el,conn->fd,
-                    AE_READABLE,conn->type->ae_handler,conn) == AE_ERR) return C_ERR;
-    return C_OK;
-}
-
-static const char *connSocketGetLastError(connection *conn) {
-    return strerror(conn->last_errno);
-}
-
-static void connSocketEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask)
-{
-    UNUSED(el);
-    UNUSED(fd);
-    connection *conn = clientData;
-
-    if (conn->state == CONN_STATE_CONNECTING &&
-            (mask & AE_WRITABLE) && conn->conn_handler) {
-
-        int conn_error = connGetSocketError(conn);
-        if (conn_error) {
-            conn->last_errno = conn_error;
-            conn->state = CONN_STATE_ERROR;
-        } else {
-            conn->state = CONN_STATE_CONNECTED;
-        }
-
-        if (!conn->write_handler) aeDeleteFileEvent(server.el,conn->fd,AE_WRITABLE);
-
-        if (!callHandler(conn, conn->conn_handler)) return;
-        conn->conn_handler = NULL;
-    }
-
-    /* Normally we execute the readable event first, and the writable
-     * event later. This is useful as sometimes we may be able
-     * to serve the reply of a query immediately after processing the
-     * query.
-     *
-     * However if WRITE_BARRIER is set in the mask, our application is
-     * asking us to do the reverse: never fire the writable event
-     * after the readable. In such a case, we invert the calls.
-     * This is useful when, for instance, we want to do things
-     * in the beforeSleep() hook, like fsync'ing a file to disk,
-     * before replying to a client. */
-    int invert = conn->flags & CONN_FLAG_WRITE_BARRIER;
-
-    int call_write = (mask & AE_WRITABLE) && conn->write_handler;
-    int call_read = (mask & AE_READABLE) && conn->read_handler;
-
-    /* Handle normal I/O flows */
-    if (!invert && call_read) {
-        if (!callHandler(conn, conn->read_handler)) return;
-    }
-    /* Fire the writable event. */
-    if (call_write) {
-        if (!callHandler(conn, conn->write_handler)) return;
-    }
-    /* If we have to invert the call, fire the readable event now
-     * after the writable one. */
-    if (invert && call_read) {
-        if (!callHandler(conn, conn->read_handler)) return;
-    }
-}
-
-static int connSocketBlockingConnect(connection *conn, const char *addr, int port, long long timeout) {
-    int fd = anetTcpNonBlockConnect(NULL,addr,port);
-    if (fd == -1) {
-        conn->state = CONN_STATE_ERROR;
-        conn->last_errno = errno;
-        return C_ERR;
-    }
-
-    if ((aeWait(fd, AE_WRITABLE, timeout) & AE_WRITABLE) == 0) {
-        conn->state = CONN_STATE_ERROR;
-        conn->last_errno = ETIMEDOUT;
-    }
-
-    conn->fd = fd;
-    conn->state = CONN_STATE_CONNECTED;
-    return C_OK;
-}
-
-/* Connection-based versions of syncio.c functions.
- * NOTE: This should ideally be refactored out in favor of pure async work.
- */
-
-static ssize_t connSocketSyncWrite(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return syncWrite(conn->fd, ptr, size, timeout);
-}
-
-static ssize_t connSocketSyncRead(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return syncRead(conn->fd, ptr, size, timeout);
-}
-
-static ssize_t connSocketSyncReadLine(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return syncReadLine(conn->fd, ptr, size, timeout);
-}
-
-static int connSocketGetType(connection *conn) {
-    (void) conn;
-
-    return CONN_TYPE_SOCKET;
-}
-
-ConnectionType CT_Socket = {
-    .ae_handler = connSocketEventHandler,
-    .close = connSocketClose,
-    .write = connSocketWrite,
-    .read = connSocketRead,
-    .accept = connSocketAccept,
-    .connect = connSocketConnect,
-    .set_write_handler = connSocketSetWriteHandler,
-    .set_read_handler = connSocketSetReadHandler,
-    .get_last_error = connSocketGetLastError,
-    .blocking_connect = connSocketBlockingConnect,
-    .sync_write = connSocketSyncWrite,
-    .sync_read = connSocketSyncRead,
-    .sync_readline = connSocketSyncReadLine,
-    .get_type = connSocketGetType
-};
-
-
-int connGetSocketError(connection *conn) {
-    int sockerr = 0;
-    socklen_t errlen = sizeof(sockerr);
-
-    if (getsockopt(conn->fd, SOL_SOCKET, SO_ERROR, &sockerr, &errlen) == -1)
-        sockerr = errno;
-    return sockerr;
-}
-
-int connPeerToString(connection *conn, char *ip, size_t ip_len, int *port) {
-    return anetFdToString(conn ? conn->fd : -1, ip, ip_len, port, FD_TO_PEER_NAME);
-}
-
-int connSockName(connection *conn, char *ip, size_t ip_len, int *port) {
-    return anetFdToString(conn->fd, ip, ip_len, port, FD_TO_SOCK_NAME);
-}
-
-int connFormatFdAddr(connection *conn, char *buf, size_t buf_len, int fd_to_str_type) {
-    return anetFormatFdAddr(conn ? conn->fd : -1, buf, buf_len, fd_to_str_type);
-}
-
-int connBlock(connection *conn) {
-    if (conn->fd == -1) return C_ERR;
-    return anetBlock(NULL, conn->fd);
-}
-
-int connNonBlock(connection *conn) {
-    if (conn->fd == -1) return C_ERR;
-    return anetNonBlock(NULL, conn->fd);
-}
-
-int connEnableTcpNoDelay(connection *conn) {
-    if (conn->fd == -1) return C_ERR;
-    return anetEnableTcpNoDelay(NULL, conn->fd);
-}
-
-int connDisableTcpNoDelay(connection *conn) {
-    if (conn->fd == -1) return C_ERR;
-    return anetDisableTcpNoDelay(NULL, conn->fd);
-}
-
-int connKeepAlive(connection *conn, int interval) {
-    if (conn->fd == -1) return C_ERR;
-    return anetKeepAlive(NULL, conn->fd, interval);
-}
-
-int connSendTimeout(connection *conn, long long ms) {
-    return anetSendTimeout(NULL, conn->fd, ms);
-}
-
-int connRecvTimeout(connection *conn, long long ms) {
-    return anetRecvTimeout(NULL, conn->fd, ms);
-}
-
-int connGetState(connection *conn) {
-    return conn->state;
-}
-
-/* Return a text that describes the connection, suitable for inclusion
- * in CLIENT LIST and similar outputs.
- *
- * For sockets, we always return "fd=<fdnum>" to maintain compatibility.
- */
-const char *connGetInfo(connection *conn, char *buf, size_t buf_len) {
-    snprintf(buf, buf_len-1, "fd=%i", conn == NULL ? -1 : conn->fd);
-    return buf;
-}
-
diff --git a/redis-stable/src/connection.h b/redis-stable/src/connection.h
deleted file mode 100644
index 60f1f70c..00000000
--- a/redis-stable/src/connection.h
+++ /dev/null
@@ -1,237 +0,0 @@
-
-/*
- * Copyright (c) 2019, Redis Labs
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __REDIS_CONNECTION_H
-#define __REDIS_CONNECTION_H
-
-#define CONN_INFO_LEN   32
-
-struct aeEventLoop;
-typedef struct connection connection;
-
-typedef enum {
-    CONN_STATE_NONE = 0,
-    CONN_STATE_CONNECTING,
-    CONN_STATE_ACCEPTING,
-    CONN_STATE_CONNECTED,
-    CONN_STATE_CLOSED,
-    CONN_STATE_ERROR
-} ConnectionState;
-
-#define CONN_FLAG_CLOSE_SCHEDULED   (1<<0)      /* Closed scheduled by a handler */
-#define CONN_FLAG_WRITE_BARRIER     (1<<1)      /* Write barrier requested */
-
-#define CONN_TYPE_SOCKET            1
-#define CONN_TYPE_TLS               2
-
-typedef void (*ConnectionCallbackFunc)(struct connection *conn);
-
-typedef struct ConnectionType {
-    void (*ae_handler)(struct aeEventLoop *el, int fd, void *clientData, int mask);
-    int (*connect)(struct connection *conn, const char *addr, int port, const char *source_addr, ConnectionCallbackFunc connect_handler);
-    int (*write)(struct connection *conn, const void *data, size_t data_len);
-    int (*read)(struct connection *conn, void *buf, size_t buf_len);
-    void (*close)(struct connection *conn);
-    int (*accept)(struct connection *conn, ConnectionCallbackFunc accept_handler);
-    int (*set_write_handler)(struct connection *conn, ConnectionCallbackFunc handler, int barrier);
-    int (*set_read_handler)(struct connection *conn, ConnectionCallbackFunc handler);
-    const char *(*get_last_error)(struct connection *conn);
-    int (*blocking_connect)(struct connection *conn, const char *addr, int port, long long timeout);
-    ssize_t (*sync_write)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
-    ssize_t (*sync_read)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
-    ssize_t (*sync_readline)(struct connection *conn, char *ptr, ssize_t size, long long timeout);
-    int (*get_type)(struct connection *conn);
-} ConnectionType;
-
-struct connection {
-    ConnectionType *type;
-    ConnectionState state;
-    short int flags;
-    short int refs;
-    int last_errno;
-    void *private_data;
-    ConnectionCallbackFunc conn_handler;
-    ConnectionCallbackFunc write_handler;
-    ConnectionCallbackFunc read_handler;
-    int fd;
-};
-
-/* The connection module does not deal with listening and accepting sockets,
- * so we assume we have a socket when an incoming connection is created.
- *
- * The fd supplied should therefore be associated with an already accept()ed
- * socket.
- *
- * connAccept() may directly call accept_handler(), or return and call it
- * at a later time. This behavior is a bit awkward but aims to reduce the need
- * to wait for the next event loop, if no additional handshake is required.
- *
- * IMPORTANT: accept_handler may decide to close the connection, calling connClose().
- * To make this safe, the connection is only marked with CONN_FLAG_CLOSE_SCHEDULED
- * in this case, and connAccept() returns with an error.
- *
- * connAccept() callers must always check the return value and on error (C_ERR)
- * a connClose() must be called.
- */
-
-static inline int connAccept(connection *conn, ConnectionCallbackFunc accept_handler) {
-    return conn->type->accept(conn, accept_handler);
-}
-
-/* Establish a connection.  The connect_handler will be called when the connection
- * is established, or if an error has occurred.
- *
- * The connection handler will be responsible to set up any read/write handlers
- * as needed.
- *
- * If C_ERR is returned, the operation failed and the connection handler shall
- * not be expected.
- */
-static inline int connConnect(connection *conn, const char *addr, int port, const char *src_addr,
-        ConnectionCallbackFunc connect_handler) {
-    return conn->type->connect(conn, addr, port, src_addr, connect_handler);
-}
-
-/* Blocking connect.
- *
- * NOTE: This is implemented in order to simplify the transition to the abstract
- * connections, but should probably be refactored out of cluster.c and replication.c,
- * in favor of a pure async implementation.
- */
-static inline int connBlockingConnect(connection *conn, const char *addr, int port, long long timeout) {
-    return conn->type->blocking_connect(conn, addr, port, timeout);
-}
-
-/* Write to connection, behaves the same as write(2).
- *
- * Like write(2), a short write is possible. A -1 return indicates an error.
- *
- * The caller should NOT rely on errno. Testing for an EAGAIN-like condition, use
- * connGetState() to see if the connection state is still CONN_STATE_CONNECTED.
- */
-static inline int connWrite(connection *conn, const void *data, size_t data_len) {
-    return conn->type->write(conn, data, data_len);
-}
-
-/* Read from the connection, behaves the same as read(2).
- * 
- * Like read(2), a short read is possible.  A return value of 0 will indicate the
- * connection was closed, and -1 will indicate an error.
- *
- * The caller should NOT rely on errno. Testing for an EAGAIN-like condition, use
- * connGetState() to see if the connection state is still CONN_STATE_CONNECTED.
- */
-static inline int connRead(connection *conn, void *buf, size_t buf_len) {
-    return conn->type->read(conn, buf, buf_len);
-}
-
-/* Register a write handler, to be called when the connection is writable.
- * If NULL, the existing handler is removed.
- */
-static inline int connSetWriteHandler(connection *conn, ConnectionCallbackFunc func) {
-    return conn->type->set_write_handler(conn, func, 0);
-}
-
-/* Register a read handler, to be called when the connection is readable.
- * If NULL, the existing handler is removed.
- */
-static inline int connSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
-    return conn->type->set_read_handler(conn, func);
-}
-
-/* Set a write handler, and possibly enable a write barrier, this flag is
- * cleared when write handler is changed or removed.
- * With barrier enabled, we never fire the event if the read handler already
- * fired in the same event loop iteration. Useful when you want to persist
- * things to disk before sending replies, and want to do that in a group fashion. */
-static inline int connSetWriteHandlerWithBarrier(connection *conn, ConnectionCallbackFunc func, int barrier) {
-    return conn->type->set_write_handler(conn, func, barrier);
-}
-
-static inline void connClose(connection *conn) {
-    conn->type->close(conn);
-}
-
-/* Returns the last error encountered by the connection, as a string.  If no error,
- * a NULL is returned.
- */
-static inline const char *connGetLastError(connection *conn) {
-    return conn->type->get_last_error(conn);
-}
-
-static inline ssize_t connSyncWrite(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return conn->type->sync_write(conn, ptr, size, timeout);
-}
-
-static inline ssize_t connSyncRead(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return conn->type->sync_read(conn, ptr, size, timeout);
-}
-
-static inline ssize_t connSyncReadLine(connection *conn, char *ptr, ssize_t size, long long timeout) {
-    return conn->type->sync_readline(conn, ptr, size, timeout);
-}
-
-/* Return CONN_TYPE_* for the specified connection */
-static inline int connGetType(connection *conn) {
-    return conn->type->get_type(conn);
-}
-
-connection *connCreateSocket();
-connection *connCreateAcceptedSocket(int fd);
-
-connection *connCreateTLS();
-connection *connCreateAcceptedTLS(int fd, int require_auth);
-
-void connSetPrivateData(connection *conn, void *data);
-void *connGetPrivateData(connection *conn);
-int connGetState(connection *conn);
-int connHasWriteHandler(connection *conn);
-int connHasReadHandler(connection *conn);
-int connGetSocketError(connection *conn);
-
-/* anet-style wrappers to conns */
-int connBlock(connection *conn);
-int connNonBlock(connection *conn);
-int connEnableTcpNoDelay(connection *conn);
-int connDisableTcpNoDelay(connection *conn);
-int connKeepAlive(connection *conn, int interval);
-int connSendTimeout(connection *conn, long long ms);
-int connRecvTimeout(connection *conn, long long ms);
-int connPeerToString(connection *conn, char *ip, size_t ip_len, int *port);
-int connFormatFdAddr(connection *conn, char *buf, size_t buf_len, int fd_to_str_type);
-int connSockName(connection *conn, char *ip, size_t ip_len, int *port);
-const char *connGetInfo(connection *conn, char *buf, size_t buf_len);
-
-/* Helpers for tls special considerations */
-sds connTLSGetPeerCert(connection *conn);
-int tlsHasPendingData();
-int tlsProcessPendingData();
-
-#endif  /* __REDIS_CONNECTION_H */
diff --git a/redis-stable/src/connhelpers.h b/redis-stable/src/connhelpers.h
deleted file mode 100644
index 86250d09..00000000
--- a/redis-stable/src/connhelpers.h
+++ /dev/null
@@ -1,88 +0,0 @@
-
-/*
- * Copyright (c) 2019, Redis Labs
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __REDIS_CONNHELPERS_H
-#define __REDIS_CONNHELPERS_H
-
-#include "connection.h"
-
-/* These are helper functions that are common to different connection
- * implementations (currently sockets in connection.c and TLS in tls.c).
- *
- * Currently helpers implement the mechanisms for invoking connection
- * handlers and tracking connection references, to allow safe destruction
- * of connections from within a handler.
- */
-
-/* Incremenet connection references.
- *
- * Inside a connection handler, we guarantee refs >= 1 so it is always
- * safe to connClose().
- *
- * In other cases where we don't want to prematurely lose the connection,
- * it can go beyond 1 as well; currently it is only done by connAccept().
- */
-static inline void connIncrRefs(connection *conn) {
-    conn->refs++;
-}
-
-/* Decrement connection references.
- *
- * Note that this is not intended to provide any automatic free logic!
- * callHandler() takes care of that for the common flows, and anywhere an
- * explicit connIncrRefs() is used, the caller is expected to take care of
- * that.
- */
-
-static inline void connDecrRefs(connection *conn) {
-    conn->refs--;
-}
-
-static inline int connHasRefs(connection *conn) {
-    return conn->refs;
-}
-
-/* Helper for connection implementations to call handlers:
- * 1. Increment refs to protect the connection.
- * 2. Execute the handler (if set).
- * 3. Decrement refs and perform deferred close, if refs==0.
- */
-static inline int callHandler(connection *conn, ConnectionCallbackFunc handler) {
-    connIncrRefs(conn);
-    if (handler) handler(conn);
-    connDecrRefs(conn);
-    if (conn->flags & CONN_FLAG_CLOSE_SCHEDULED) {
-        if (!connHasRefs(conn)) connClose(conn);
-        return 0;
-    }
-    return 1;
-}
-
-#endif  /* __REDIS_CONNHELPERS_H */
diff --git a/redis-stable/src/crc16.c b/redis-stable/src/crc16.c
deleted file mode 100644
index 7b8c1dad..00000000
--- a/redis-stable/src/crc16.c
+++ /dev/null
@@ -1,88 +0,0 @@
-#include "server.h"
-
-/*
- * Copyright 2001-2010 Georges Menie (www.menie.org)
- * Copyright 2010-2012 Salvatore Sanfilippo (adapted to Redis coding style)
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *     * Redistributions of source code must retain the above copyright
- *       notice, this list of conditions and the following disclaimer.
- *     * Redistributions in binary form must reproduce the above copyright
- *       notice, this list of conditions and the following disclaimer in the
- *       documentation and/or other materials provided with the distribution.
- *     * Neither the name of the University of California, Berkeley nor the
- *       names of its contributors may be used to endorse or promote products
- *       derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
- * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
- * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* CRC16 implementation according to CCITT standards.
- *
- * Note by @antirez: this is actually the XMODEM CRC 16 algorithm, using the
- * following parameters:
- *
- * Name                       : "XMODEM", also known as "ZMODEM", "CRC-16/ACORN"
- * Width                      : 16 bit
- * Poly                       : 1021 (That is actually x^16 + x^12 + x^5 + 1)
- * Initialization             : 0000
- * Reflect Input byte         : False
- * Reflect Output CRC         : False
- * Xor constant to output CRC : 0000
- * Output for "123456789"     : 31C3
- */
-
-static const uint16_t crc16tab[256]= {
-    0x0000,0x1021,0x2042,0x3063,0x4084,0x50a5,0x60c6,0x70e7,
-    0x8108,0x9129,0xa14a,0xb16b,0xc18c,0xd1ad,0xe1ce,0xf1ef,
-    0x1231,0x0210,0x3273,0x2252,0x52b5,0x4294,0x72f7,0x62d6,
-    0x9339,0x8318,0xb37b,0xa35a,0xd3bd,0xc39c,0xf3ff,0xe3de,
-    0x2462,0x3443,0x0420,0x1401,0x64e6,0x74c7,0x44a4,0x5485,
-    0xa56a,0xb54b,0x8528,0x9509,0xe5ee,0xf5cf,0xc5ac,0xd58d,
-    0x3653,0x2672,0x1611,0x0630,0x76d7,0x66f6,0x5695,0x46b4,
-    0xb75b,0xa77a,0x9719,0x8738,0xf7df,0xe7fe,0xd79d,0xc7bc,
-    0x48c4,0x58e5,0x6886,0x78a7,0x0840,0x1861,0x2802,0x3823,
-    0xc9cc,0xd9ed,0xe98e,0xf9af,0x8948,0x9969,0xa90a,0xb92b,
-    0x5af5,0x4ad4,0x7ab7,0x6a96,0x1a71,0x0a50,0x3a33,0x2a12,
-    0xdbfd,0xcbdc,0xfbbf,0xeb9e,0x9b79,0x8b58,0xbb3b,0xab1a,
-    0x6ca6,0x7c87,0x4ce4,0x5cc5,0x2c22,0x3c03,0x0c60,0x1c41,
-    0xedae,0xfd8f,0xcdec,0xddcd,0xad2a,0xbd0b,0x8d68,0x9d49,
-    0x7e97,0x6eb6,0x5ed5,0x4ef4,0x3e13,0x2e32,0x1e51,0x0e70,
-    0xff9f,0xefbe,0xdfdd,0xcffc,0xbf1b,0xaf3a,0x9f59,0x8f78,
-    0x9188,0x81a9,0xb1ca,0xa1eb,0xd10c,0xc12d,0xf14e,0xe16f,
-    0x1080,0x00a1,0x30c2,0x20e3,0x5004,0x4025,0x7046,0x6067,
-    0x83b9,0x9398,0xa3fb,0xb3da,0xc33d,0xd31c,0xe37f,0xf35e,
-    0x02b1,0x1290,0x22f3,0x32d2,0x4235,0x5214,0x6277,0x7256,
-    0xb5ea,0xa5cb,0x95a8,0x8589,0xf56e,0xe54f,0xd52c,0xc50d,
-    0x34e2,0x24c3,0x14a0,0x0481,0x7466,0x6447,0x5424,0x4405,
-    0xa7db,0xb7fa,0x8799,0x97b8,0xe75f,0xf77e,0xc71d,0xd73c,
-    0x26d3,0x36f2,0x0691,0x16b0,0x6657,0x7676,0x4615,0x5634,
-    0xd94c,0xc96d,0xf90e,0xe92f,0x99c8,0x89e9,0xb98a,0xa9ab,
-    0x5844,0x4865,0x7806,0x6827,0x18c0,0x08e1,0x3882,0x28a3,
-    0xcb7d,0xdb5c,0xeb3f,0xfb1e,0x8bf9,0x9bd8,0xabbb,0xbb9a,
-    0x4a75,0x5a54,0x6a37,0x7a16,0x0af1,0x1ad0,0x2ab3,0x3a92,
-    0xfd2e,0xed0f,0xdd6c,0xcd4d,0xbdaa,0xad8b,0x9de8,0x8dc9,
-    0x7c26,0x6c07,0x5c64,0x4c45,0x3ca2,0x2c83,0x1ce0,0x0cc1,
-    0xef1f,0xff3e,0xcf5d,0xdf7c,0xaf9b,0xbfba,0x8fd9,0x9ff8,
-    0x6e17,0x7e36,0x4e55,0x5e74,0x2e93,0x3eb2,0x0ed1,0x1ef0
-};
-
-uint16_t crc16(const char *buf, int len) {
-    int counter;
-    uint16_t crc = 0;
-    for (counter = 0; counter < len; counter++)
-            crc = (crc<<8) ^ crc16tab[((crc>>8) ^ *buf++)&0x00FF];
-    return crc;
-}
diff --git a/redis-stable/src/crc16_slottable.h b/redis-stable/src/crc16_slottable.h
deleted file mode 100644
index 652aea9e..00000000
--- a/redis-stable/src/crc16_slottable.h
+++ /dev/null
@@ -1,835 +0,0 @@
-#ifndef _CRC16_TABLE_H__
-#define _CRC16_TABLE_H__
-
-/* A table of the shortest possible alphanumeric string that is mapped by redis' crc16
- * to any given redis cluster slot. 
- * 
- * The array indexes are slot numbers, so that given a desired slot, this string is guaranteed
- * to make redis cluster route a request to the shard holding this slot 
- */
-
-const char *crc16_slot_table[] = {
-"06S", "Qi", "5L5", "4Iu", "4gY", "460", "1Y7", "1LV", "0QG", "ru", "7Ok", "4ji", "4DE", "65n", "2JH", "I8", "F9", "SX", "7nF", "4KD", 
-"4eh", "6PK", "2ke", "1Ng", "0Sv", "4L", "491", "4hX", "4Ft", "5C4", "2Hy", "09R", "021", "0cX", "4Xv", "6mU", "6Cy", "42R", "0Mt", "nF", 
-"cv", "1Pe", "5kK", "6NI", "74L", "4UF", "0nh", "MZ", "2TJ", "0ai", "4ZG", "6od", "6AH", "40c", "0OE", "lw", "aG", "0Bu", "5iz", "6Lx", 
-"5R7", "4Ww", "0lY", "Ok", "5n3", "4ks", "8YE", "7g", "2KR", "1nP", "714", "64t", "69D", "4Ho", "07I", "Ps", "2hN", "1ML", "4fC", "7CA", 
-"avs", "4iB", "0Rl", "5V", "2Ic", "08H", "4Gn", "66E", "aUo", "b4e", "05x", "RB", "8f", "8VD", "4dr", "5a2", "4zp", "6OS", "bl", "355", 
-"0or", "1j2", "75V", "bno", "4Yl", "6lO", "Ap", "0bB", "0Ln", "2yM", "6Bc", "43H", "4xA", "6Mb", "22D", "14", "0mC", "Nq", "6cN", "4Vm", 
-"ban", "aDl", "CA", "14Z", "8GG", "mm", "549", "41y", "53t", "464", "1Y3", "1LR", "06W", "Qm", "5L1", "4Iq", "4DA", "65j", "2JL", "1oN", 
-"0QC", "6y", "7Oo", "4jm", "4el", "6PO", "9x", "1Nc", "04f", "2EM", "7nB", "bqs", "4Fp", "5C0", "d6F", "09V", "0Sr", "4H", "495", "bRo", 
-"aio", "42V", "0Mp", "nB", "025", "17u", "4Xr", "6mQ", "74H", "4UB", "0nl", "3Kn", "cr", "1Pa", "5kO", "6NM", "6AL", "40g", "0OA", "ls", 
-"2TN", "0am", "4ZC", "aEr", "5R3", "4Ws", "18t", "Oo", "aC", "0Bq", "bCl", "afn", "2KV", "1nT", "5Uz", "64p", "5n7", "4kw", "0PY", "7c", 
-"2hJ", "1MH", "4fG", "6Sd", "7mi", "4Hk", "07M", "Pw", "2Ig", "08L", "4Gj", "66A", "7LD", "4iF", "0Rh", "5R", "8b", "1Oy", "4dv", "5a6", 
-"7oX", "4JZ", "0qt", "RF", "0ov", "LD", "4A9", "4TX", "4zt", "6OW", "bh", "0AZ", "z9", "oX", "6Bg", "43L", "4Yh", "6lK", "At", "0bF", 
-"0mG", "Nu", "6cJ", "4Vi", "4xE", "6Mf", "2vH", "10", "8GC", "mi", "5p5", "4uu", "5Kx", "4N8", "CE", "1pV", "0QO", "6u", "7Oc", "4ja", 
-"4DM", "65f", "3Za", "I0", "0rS", "Qa", "68V", "b7F", "4gQ", "468", "dSo", "285", "274", "4D", "499", "4hP", "b8G", "67W", "0h3", "09Z", 
-"F1", "SP", "7nN", "4KL", "51I", "6PC", "9t", "1No", "21g", "1Pm", "5kC", "6NA", "74D", "4UN", "X3", "MR", "029", "0cP", "bbM", "79t", 
-"4c3", "42Z", "8Dd", "nN", "aO", "8Ke", "4yS", "4l2", "76u", "635", "0lQ", "Oc", "BS", "W2", "4ZO", "6ol", "7Qa", "40k", "0OM", "2zn", 
-"69L", "4Hg", "07A", "2Fj", "2hF", "k6", "4fK", "6Sh", "7Ny", "6K9", "0PU", "7o", "2KZ", "1nX", "4EW", "4P6", "7oT", "4JV", "05p", "RJ", 
-"8n", "1Ou", "4dz", "6QY", "7LH", "4iJ", "d7", "qV", "2Ik", "1li", "4Gf", "66M", "4Yd", "6lG", "Ax", "0bJ", "z5", "oT", "6Bk", "4wH", 
-"4zx", "aeI", "bd", "0AV", "0oz", "LH", "4A5", "4TT", "5Kt", "4N4", "CI", "14R", "0NW", "me", "541", "41q", "4xI", "6Mj", "22L", "u4", 
-"0mK", "Ny", "6cF", "4Ve", "4DI", "65b", "2JD", "I4", "0QK", "6q", "7Og", "4je", "4gU", "4r4", "2iX", "1LZ", "0rW", "Qe", "5L9", "4Iy", 
-"4Fx", "5C8", "0h7", "1mw", "0Sz", "pH", "7MV", "4hT", "4ed", "6PG", "9p", "1Nk", "F5", "ST", "7nJ", "4KH", "7pH", "4UJ", "X7", "MV", 
-"cz", "1Pi", "5kG", "6NE", "4c7", "4vV", "0Mx", "nJ", "0v5", "0cT", "4Xz", "6mY", "6bX", "5GZ", "0lU", "Og", "aK", "0By", "4yW", "4l6", 
-"6AD", "40o", "0OI", "2zj", "BW", "W6", "4ZK", "6oh", "2hB", "k2", "4fO", "6Sl", "69H", "4Hc", "07E", "2Fn", "d5e", "83m", "4ES", "4P2", 
-"a0F", "bQL", "0PQ", "7k", "8j", "1Oq", "50W", "hbv", "7oP", "4JR", "05t", "RN", "2Io", "08D", "4Gb", "66I", "7LL", "4iN", "d3", "5Z", 
-"z1", "oP", "6Bo", "43D", "5IA", "6lC", "2Wm", "0bN", "8ff", "LL", "4A1", "4TP", "cPn", "aeM", "0T3", "0AR", "0NS", "ma", "545", "41u", 
-"5Kp", "4N0", "CM", "14V", "0mO", "2Xl", "6cB", "4Va", "4xM", "6Mn", "22H", "18", "04s", "SI", "7nW", "4KU", "4ey", "6PZ", "9m", "1Nv", 
-"e4", "pU", "7MK", "4hI", "4Fe", "67N", "2Hh", "09C", "06B", "Qx", "68O", "4Id", "4gH", "6Rk", "2iE", "j5", "0QV", "6l", "5o8", "4jx", 
-"4DT", "4Q5", "2JY", "82j", "BJ", "0ax", "4ZV", "4O7", "552", "40r", "0OT", "lf", "aV", "t7", "4yJ", "6Li", "6bE", "4Wf", "0lH", "Oz", 
-"2Vj", "0cI", "4Xg", "6mD", "6Ch", "42C", "0Me", "nW", "cg", "1Pt", "5kZ", "6NX", "7pU", "4UW", "0ny", "MK", "7LQ", "4iS", "267", "5G", 
-"0i0", "08Y", "b9D", "66T", "7oM", "4JO", "G2", "RS", "8w", "1Ol", "4dc", "7Aa", "atS", "4kb", "0PL", "7v", "2KC", "H3", "4EN", "64e", 
-"69U", "b6E", "07X", "Pb", "dRl", "296", "4fR", "4s3", "4xP", "4m1", "22U", "8Jf", "0mR", "0x3", "77v", "626", "5Km", "6no", "CP", "V1", 
-"0NN", "3kL", "7Pb", "41h", "4za", "6OB", "20d", "0AO", "Y0", "LQ", "6an", "4TM", "bcN", "78w", "Aa", "0bS", "8Eg", "oM", "4b0", "43Y", 
-"51T", "azL", "9i", "1Nr", "04w", "SM", "7nS", "4KQ", "4Fa", "67J", "2Hl", "09G", "e0", "4Y", "7MO", "4hM", "4gL", "6Ro", "2iA", "j1", 
-"06F", "2Gm", "68K", "5YA", "4DP", "4Q1", "d4f", "82n", "0QR", "6h", "a1E", "bPO", "556", "40v", "0OP", "lb", "BN", "15U", "4ZR", "4O3", 
-"6bA", "4Wb", "0lL", "2Yo", "aR", "t3", "4yN", "6Lm", "6Cl", "42G", "0Ma", "nS", "2Vn", "0cM", "4Xc", "79i", "74Y", "4US", "8ge", "MO", 
-"cc", "1Pp", "bAL", "adN", "0i4", "1lt", "5WZ", "66P", "7LU", "4iW", "0Ry", "5C", "8s", "1Oh", "4dg", "6QD", "7oI", "4JK", "G6", "RW", 
-"2KG", "H7", "4EJ", "64a", "7Nd", "4kf", "0PH", "7r", "1X8", "1MY", "4fV", "4s7", "69Q", "4Hz", "0sT", "Pf", "0mV", "Nd", "5S8", "4Vx", 
-"4xT", "4m5", "22Q", "0Cz", "0NJ", "mx", "7Pf", "41l", "5Ki", "6nk", "CT", "V5", "Y4", "LU", "6aj", "4TI", "4ze", "6OF", "by", "0AK", 
-"2l9", "oI", "4b4", "4wU", "4Yy", "6lZ", "Ae", "0bW", "0So", "4U", "7MC", "4hA", "4Fm", "67F", "3XA", "09K", "0ps", "SA", "aTl", "b5f", 
-"4eq", "6PR", "9e", "8WG", "8XF", "6d", "5o0", "4jp", "707", "65w", "1z2", "1oS", "06J", "Qp", "68G", "4Il", "53i", "6Rc", "2iM", "1LO", 
-"23G", "07", "4yB", "6La", "6bM", "4Wn", "18i", "Or", "BB", "0ap", "c4D", "aEo", "5q2", "40z", "8FD", "ln", "co", "346", "5kR", "6NP", 
-"74U", "bol", "0nq", "MC", "2Vb", "0cA", "4Xo", "6mL", "7SA", "42K", "0Mm", "2xN", "7oE", "4JG", "05a", "2DJ", "2jf", "1Od", "4dk", "6QH", 
-"482", "5yz", "0Ru", "5O", "0i8", "08Q", "4Gw", "5B7", "5M6", "4Hv", "07P", "Pj", "1X4", "1MU", "4fZ", "473", "7Nh", "4kj", "0PD", "sv", 
-"2KK", "1nI", "4EF", "64m", "5Ke", "6ng", "CX", "V9", "0NF", "mt", "7Pj", "4uh", "4xX", "4m9", "1F6", "0Cv", "0mZ", "Nh", "5S4", "4Vt", 
-"4Yu", "6lV", "Ai", "16r", "0Lw", "oE", "4b8", "43Q", "4zi", "6OJ", "bu", "0AG", "Y8", "LY", "6af", "4TE", "4Fi", "67B", "2Hd", "09O", 
-"e8", "4Q", "7MG", "4hE", "4eu", "6PV", "9a", "1Nz", "0pw", "SE", "aTh", "4KY", "4DX", "4Q9", "1z6", "1oW", "0QZ", "rh", "5o4", "4jt", 
-"4gD", "6Rg", "2iI", "j9", "06N", "Qt", "68C", "4Ih", "6bI", "4Wj", "0lD", "Ov", "aZ", "03", "4yF", "6Le", "5q6", "4tv", "0OX", "lj", 
-"BF", "0at", "4ZZ", "6oy", "74Q", "5Ez", "0nu", "MG", "ck", "1Px", "5kV", "6NT", "6Cd", "42O", "0Mi", "2xJ", "2Vf", "0cE", "4Xk", "6mH", 
-"2jb", "8VY", "4do", "6QL", "7oA", "4JC", "05e", "2DN", "d7E", "08U", "4Gs", "5B3", "486", "bSl", "0Rq", "5K", "1X0", "1MQ", "52w", "477", 
-"5M2", "4Hr", "07T", "Pn", "2KO", "1nM", "4EB", "64i", "7Nl", "4kn", "8YX", "7z", "0NB", "mp", "7Pn", "41d", "5Ka", "6nc", "2UM", "14G", 
-"19w", "Nl", "5S0", "4Vp", "bBo", "agm", "1F2", "0Cr", "0Ls", "oA", "ahl", "43U", "4Yq", "6lR", "Am", "16v", "0oo", "2ZL", "6ab", "4TA", 
-"4zm", "6ON", "bq", "0AC", "2VY", "0cz", "4XT", "4M5", "570", "42p", "0MV", "nd", "cT", "v5", "5ki", "6Nk", "74n", "4Ud", "0nJ", "Mx", 
-"By", "0aK", "4Ze", "6oF", "6Aj", "40A", "y4", "lU", "ae", "0BW", "4yy", "581", "4B4", "4WU", "18R", "OI", "06q", "QK", "7lU", "4IW", 
-"53R", "6RX", "0I4", "1Lt", "g6", "rW", "7OI", "4jK", "4Dg", "65L", "2Jj", "1oh", "0pH", "Sz", "7nd", "4Kf", "4eJ", "6Pi", "2kG", "h7", 
-"0ST", "4n", "7Mx", "4hz", "4FV", "4S7", "1x8", "09p", "4zR", "4o3", "bN", "8Hd", "0oP", "Lb", "75t", "604", "4YN", "6lm", "AR", "T3", 
-"0LL", "2yo", "6BA", "43j", "4xc", "agR", "22f", "0CM", "0ma", "NS", "6cl", "4VO", "baL", "aDN", "Cc", "14x", "8Ge", "mO", "7PQ", "4uS", 
-"7NS", "4kQ", "245", "7E", "0k2", "1nr", "coo", "64V", "69f", "4HM", "E0", "PQ", "2hl", "1Mn", "4fa", "6SB", "7Lb", "5yA", "0RN", "5t", 
-"2IA", "J1", "4GL", "66g", "aUM", "b4G", "05Z", "0d3", "8D", "8Vf", "4dP", "459", "574", "42t", "0MR", "0X3", "dln", "17W", "4XP", "4M1", 
-"74j", "5EA", "0nN", "3KL", "cP", "29", "5km", "6No", "6An", "40E", "y0", "lQ", "2Tl", "0aO", "4Za", "6oB", "4B0", "4WQ", "18V", "OM", 
-"aa", "0BS", "bCN", "585", "53V", "axN", "0I0", "1Lp", "06u", "QO", "68x", "4IS", "4Dc", "65H", "2Jn", "1ol", "g2", "rS", "7OM", "4jO", 
-"4eN", "6Pm", "9Z", "h3", "04D", "2Eo", "aTS", "4Kb", "4FR", "4S3", "d6d", "09t", "0SP", "4j", "a3G", "bRM", "0oT", "Lf", "6aY", "4Tz", 
-"4zV", "4o7", "bJ", "0Ax", "0LH", "oz", "6BE", "43n", "4YJ", "6li", "AV", "T7", "0me", "NW", "6ch", "4VK", "4xg", "6MD", "22b", "0CI", 
-"0Ny", "mK", "7PU", "4uW", "5KZ", "6nX", "Cg", "1pt", "0k6", "1nv", "4Ey", "64R", "7NW", "4kU", "241", "7A", "2hh", "1Mj", "4fe", "6SF", 
-"69b", "4HI", "E4", "PU", "2IE", "J5", "4GH", "66c", "7Lf", "4id", "0RJ", "5p", "2jY", "8Vb", "4dT", "4q5", "5O8", "4Jx", "0qV", "Rd", 
-"21E", "25", "5ka", "6Nc", "74f", "4Ul", "0nB", "Mp", "1f2", "0cr", "bbo", "79V", "578", "42x", "395", "nl", "am", "364", "4yq", "589", 
-"76W", "bmn", "0ls", "OA", "Bq", "0aC", "4Zm", "6oN", "6Ab", "40I", "0Oo", "2zL", "0Qm", "6W", "7OA", "4jC", "4Do", "65D", "2Jb", "82Q", 
-"06y", "QC", "68t", "b7d", "4gs", "5b3", "dSM", "8UE", "8ZD", "4f", "5m2", "4hr", "725", "67u", "1x0", "09x", "04H", "Sr", "7nl", "4Kn", 
-"4eB", "6Pa", "9V", "1NM", "4YF", "6le", "AZ", "0bh", "0LD", "ov", "6BI", "43b", "4zZ", "6Oy", "bF", "0At", "0oX", "Lj", "5Q6", "4Tv", 
-"5KV", "6nT", "Ck", "14p", "0Nu", "mG", "7PY", "41S", "4xk", "6MH", "22n", "0CE", "0mi", "2XJ", "6cd", "4VG", "69n", "4HE", "E8", "PY", 
-"2hd", "1Mf", "4fi", "6SJ", "ath", "4kY", "0Pw", "7M", "2Kx", "1nz", "4Eu", "6pV", "5O4", "4Jt", "05R", "Rh", "8L", "1OW", "4dX", "451", 
-"7Lj", "4ih", "0RF", "qt", "2II", "J9", "4GD", "66o", "74b", "4Uh", "0nF", "Mt", "cX", "21", "5ke", "6Ng", "5s4", "4vt", "0MZ", "nh", 
-"1f6", "0cv", "4XX", "4M9", "4B8", "4WY", "0lw", "OE", "ai", "1Rz", "4yu", "6LV", "6Af", "40M", "y8", "lY", "Bu", "0aG", "4Zi", "6oJ", 
-"4Dk", "6qH", "2Jf", "1od", "0Qi", "6S", "7OE", "4jG", "4gw", "5b7", "0I8", "1Lx", "0ru", "QG", "68p", "5Yz", "4FZ", "67q", "1x4", "1mU", 
-"0SX", "4b", "5m6", "4hv", "4eF", "6Pe", "9R", "1NI", "04L", "Sv", "7nh", "4Kj", "8EX", "or", "6BM", "43f", "4YB", "6la", "2WO", "0bl", 
-"8fD", "Ln", "5Q2", "4Tr", "cPL", "aeo", "bB", "0Ap", "0Nq", "mC", "ajn", "41W", "5KR", "6nP", "Co", "14t", "0mm", "2XN", "77I", "4VC", 
-"4xo", "6ML", "22j", "0CA", "3xA", "1Mb", "4fm", "6SN", "69j", "4HA", "07g", "2FL", "d5G", "83O", "4Eq", "64Z", "a0d", "bQn", "0Ps", "7I", 
-"8H", "1OS", "50u", "455", "5O0", "4Jp", "05V", "Rl", "2IM", "08f", "5Wa", "66k", "7Ln", "4il", "0RB", "5x", "Bh", "0aZ", "4Zt", "6oW", 
-"4a9", "40P", "0Ov", "lD", "at", "0BF", "4yh", "6LK", "6bg", "4WD", "Z9", "OX", "2VH", "U8", "4XE", "6mf", "6CJ", "42a", "0MG", "nu", 
-"cE", "1PV", "5kx", "4n8", "5P5", "4Uu", "8gC", "Mi", "04Q", "Sk", "5N7", "4Kw", "51r", "442", "9O", "1NT", "0SE", "pw", "7Mi", "4hk", 
-"4FG", "67l", "2HJ", "09a", "3", "QZ", "68m", "4IF", "4gj", "6RI", "2ig", "1Le", "0Qt", "6N", "7OX", "4jZ", "4Dv", "5A6", "0j9", "1oy", 
-"4xr", "6MQ", "22w", "377", "0mp", "NB", "77T", "blm", "5KO", "6nM", "Cr", "14i", "0Nl", "3kn", "ajs", "41J", "4zC", "aer", "20F", "36", 
-"0oA", "Ls", "6aL", "4To", "bcl", "78U", "AC", "0bq", "386", "oo", "5r3", "4ws", "5l1", "4iq", "9Kf", "5e", "1y3", "1lR", "736", "66v", 
-"7oo", "4Jm", "05K", "Rq", "8U", "1ON", "4dA", "6Qb", "7NB", "bQs", "0Pn", "7T", "2Ka", "1nc", "4El", "64G", "69w", "b6g", "07z", "1v2", 
-"dRN", "8TF", "4fp", "5c0", "akm", "40T", "0Or", "1J2", "Bl", "15w", "4Zp", "6oS", "6bc", "5Ga", "0ln", "2YM", "ap", "0BB", "4yl", "6LO", 
-"6CN", "42e", "0MC", "nq", "2VL", "0co", "4XA", "6mb", "5P1", "4Uq", "8gG", "Mm", "cA", "1PR", "bAn", "adl", "51v", "446", "9K", "1NP", 
-"04U", "So", "5N3", "4Ks", "4FC", "67h", "2HN", "09e", "0SA", "ps", "7Mm", "4ho", "4gn", "6RM", "2ic", "1La", "7", "2GO", "68i", "4IB", 
-"4Dr", "5A2", "d4D", "82L", "0Qp", "6J", "a1g", "bPm", "0mt", "NF", "6cy", "4VZ", "4xv", "6MU", "0V9", "0CX", "0Nh", "mZ", "7PD", "41N", 
-"5KK", "6nI", "Cv", "14m", "0oE", "Lw", "6aH", "4Tk", "4zG", "6Od", "20B", "32", "0LY", "ok", "5r7", "4ww", "5Iz", "6lx", "AG", "0bu", 
-"1y7", "1lV", "4GY", "4R8", "5l5", "4iu", "1Bz", "5a", "8Q", "i8", "4dE", "6Qf", "7ok", "4Ji", "05O", "Ru", "2Ke", "1ng", "4Eh", "64C", 
-"7NF", "4kD", "f9", "7P", "2hy", "3m9", "4ft", "5c4", "69s", "4HX", "0sv", "PD", "23e", "0BN", "5iA", "6LC", "6bo", "4WL", "Z1", "OP", 
-"0t3", "0aR", "c4f", "aEM", "4a1", "40X", "8Ff", "lL", "cM", "8Ig", "5kp", "4n0", "74w", "617", "0nS", "Ma", "3Fa", "U0", "4XM", "6mn", 
-"6CB", "42i", "0MO", "2xl", "0SM", "4w", "7Ma", "4hc", "4FO", "67d", "2HB", "K2", "04Y", "Sc", "aTN", "b5D", "4eS", "4p2", "9G", "8We", 
-"256", "6F", "7OP", "4jR", "cnl", "65U", "0j1", "1oq", "D3", "QR", "68e", "4IN", "4gb", "6RA", "2io", "1Lm", "5KG", "6nE", "Cz", "14a", 
-"x7", "mV", "7PH", "41B", "4xz", "592", "0V5", "0CT", "0mx", "NJ", "4C7", "4VV", "4YW", "4L6", "AK", "0by", "0LU", "og", "563", "43s", 
-"4zK", "6Oh", "bW", "w6", "0oI", "2Zj", "6aD", "4Tg", "7og", "4Je", "05C", "Ry", "2jD", "i4", "4dI", "6Qj", "5l9", "4iy", "0RW", "5m", 
-"2IX", "08s", "4GU", "4R4", "7mV", "4HT", "07r", "PH", "0H7", "1Mw", "4fx", "5c8", "7NJ", "4kH", "f5", "sT", "2Ki", "1nk", "4Ed", "64O", 
-"6bk", "4WH", "Z5", "OT", "ax", "0BJ", "4yd", "6LG", "4a5", "4tT", "0Oz", "lH", "Bd", "0aV", "4Zx", "aEI", "5P9", "4Uy", "0nW", "Me", 
-"cI", "1PZ", "5kt", "4n4", "6CF", "42m", "0MK", "ny", "2VD", "U4", "4XI", "6mj", "4FK", "6sh", "2HF", "K6", "0SI", "4s", "7Me", "4hg", 
-"4eW", "4p6", "9C", "1NX", "0pU", "Sg", "7ny", "6k9", "4Dz", "65Q", "0j5", "1ou", "0Qx", "6B", "7OT", "4jV", "4gf", "6RE", "2ik", "1Li", 
-"D7", "QV", "68a", "4IJ", "x3", "mR", "7PL", "41F", "5KC", "6nA", "2Uo", "14e", "19U", "NN", "4C3", "4VR", "bBM", "596", "0V1", "0CP", 
-"0LQ", "oc", "567", "43w", "4YS", "4L2", "AO", "16T", "0oM", "2Zn", "75i", "4Tc", "4zO", "6Ol", "bS", "w2", "8Y", "i0", "4dM", "6Qn", 
-"7oc", "4Ja", "05G", "2Dl", "d7g", "08w", "4GQ", "4R0", "a2D", "bSN", "0RS", "5i", "0H3", "1Ms", "52U", "ayM", "7mR", "4HP", "07v", "PL", 
-"2Km", "1no", "5UA", "64K", "7NN", "4kL", "f1", "7X", "5nw", "4k7", "fJ", "0Ex", "0kT", "Hf", "6eY", "4Pz", "5Mk", "6hi", "EV", "P7", 
-"0HH", "kz", "6FE", "47n", "48o", "6ID", "26b", "0GI", "0ie", "JW", "6gh", "4RK", "5OZ", "6jX", "Gg", "0dU", "0Jy", "iK", "4d6", "4qW", 
-"4z4", "4oU", "1DZ", "3A", "Ye", "0zW", "4Ay", "5D9", "6yj", "4LI", "A4", "TU", "zy", "0YK", "4be", "6WF", "6XG", "4md", "0VJ", "1p", 
-"2ME", "N5", "4CH", "62c", "5K8", "4Nx", "0uV", "Vd", "xH", "8Rb", "5pu", "4u5", "D", "13W", "5Lq", "4I1", "534", "46t", "0IR", "28y", 
-"gP", "69", "5om", "6Jo", "6dC", "5AA", "0jN", "3OL", "2Pl", "0eO", "aT1", "6kB", "6En", "44E", "98", "hQ", "ea", "0FS", "49u", "abL", 
-"4F0", "4SQ", "8ag", "KM", "02u", "UO", "4X2", "4MS", "57V", "a8F", "0M0", "0XQ", "c2", "vS", "7KM", "4nO", "5PB", "61H", "2Nn", "1kl", 
-"00D", "2Ao", "6zA", "4Ob", "4aN", "6Tm", "yR", "l3", "0WP", "0j", "a7G", "58W", "4BR", "4W3", "ZN", "84l", "0kP", "Hb", "71t", "644", 
-"5ns", "4k3", "fN", "8Ld", "0HL", "29g", "6FA", "47j", "5Mo", "6hm", "ER", "P3", "0ia", "JS", "6gl", "4RO", "48k", "7Ya", "26f", "0GM", 
-"8Ce", "iO", "4d2", "4qS", "beL", "hYw", "Gc", "0dQ", "Ya", "0zS", "cko", "60V", "4z0", "4oQ", "205", "3E", "2ll", "0YO", "4ba", "6WB", 
-"6yn", "4LM", "A0", "TQ", "2MA", "N1", "4CL", "62g", "6XC", "59I", "0VN", "1t", "xL", "8Rf", "54y", "419", "aQM", "b0G", "01Z", "3PP", 
-"530", "46p", "0IV", "jd", "DH", "0gz", "5Lu", "4I5", "6dG", "4Qd", "0jJ", "Ix", "gT", "r5", "5oi", "6Jk", "6Ej", "44A", "0Kg", "hU", 
-"Fy", "0eK", "5ND", "6kF", "4F4", "4SU", "1xZ", "KI", "ee", "0FW", "49q", "5x9", "57R", "6VX", "0M4", "0XU", "02q", "UK", "4X6", "4MW", 
-"5PF", "61L", "2Nj", "1kh", "c6", "vW", "7KI", "4nK", "4aJ", "6Ti", "yV", "l7", "0tH", "Wz", "6zE", "4Of", "4BV", "4W7", "ZJ", "0yx", 
-"0WT", "0n", "6YY", "4lz", "5Mc", "6ha", "2SO", "0fl", "1Xa", "kr", "6FM", "47f", "bDm", "aao", "fB", "0Ep", "8bD", "Hn", "5U2", "4Pr", 
-"5OR", "5Z3", "Go", "10t", "0Jq", "iC", "ann", "45W", "48g", "6IL", "ds", "0GA", "0im", "3Lo", "73I", "4RC", "6yb", "4LA", "03g", "2BL", 
-"zq", "0YC", "4bm", "6WN", "a4d", "bUn", "0Ts", "3I", "Ym", "87O", "4Aq", "5D1", "5K0", "4Np", "01V", "Vl", "2nQ", "1KS", "54u", "415", 
-"6XO", "4ml", "0VB", "1x", "2MM", "0xn", "5Sa", "62k", "gX", "61", "5oe", "6Jg", "6dK", "4Qh", "0jF", "It", "L", "0gv", "5Ly", "4I9", 
-"5w4", "4rt", "0IZ", "jh", "ei", "1Vz", "5mT", "5x5", "4F8", "4SY", "0hw", "KE", "Fu", "0eG", "5NH", "6kJ", "6Ef", "44M", "90", "hY", 
-"0Ui", "2S", "7KE", "4nG", "5PJ", "6uH", "Xw", "1kd", "0vu", "UG", "6xx", "790", "4cw", "5f7", "0M8", "0XY", "0WX", "0b", "5i6", "4lv", 
-"4BZ", "63q", "ZF", "0yt", "00L", "Wv", "6zI", "4Oj", "4aF", "6Te", "yZ", "0Zh", "0HD", "kv", "6FI", "47b", "5Mg", "6he", "EZ", "0fh", 
-"0kX", "Hj", "5U6", "4Pv", "7N9", "6Ky", "fF", "0Et", "0Ju", "iG", "6Dx", "45S", "5OV", "5Z7", "Gk", "0dY", "0ii", "3Lk", "6gd", "4RG", 
-"48c", "6IH", "dw", "0GE", "zu", "0YG", "4bi", "6WJ", "6yf", "4LE", "A8", "TY", "Yi", "1jz", "4Au", "5D5", "4z8", "4oY", "0Tw", "3M", 
-"xD", "1KW", "54q", "411", "5K4", "4Nt", "01R", "Vh", "2MI", "N9", "4CD", "62o", "6XK", "4mh", "0VF", "ut", "6dO", "4Ql", "0jB", "Ip", 
-"25E", "65", "5oa", "6Jc", "538", "46x", "9Pg", "jl", "H", "0gr", "bfo", "aCm", "72W", "bin", "0hs", "KA", "em", "324", "49y", "5x1", 
-"6Eb", "44I", "94", "3nm", "Fq", "0eC", "5NL", "6kN", "5PN", "61D", "Xs", "86Q", "0Um", "2W", "7KA", "4nC", "4cs", "5f3", "39W", "8QE", 
-"02y", "UC", "aRn", "794", "765", "63u", "ZB", "0yp", "9Ne", "0f", "5i2", "4lr", "4aB", "6Ta", "2oO", "0Zl", "00H", "Wr", "6zM", "4On", 
-"5lW", "5y6", "dj", "0GX", "0it", "JF", "6gy", "4RZ", "5OK", "6jI", "Gv", "0dD", "83", "iZ", "6De", "45N", "5nf", "6Kd", "24B", "72", 
-"0kE", "Hw", "6eH", "4Pk", "5Mz", "6hx", "EG", "0fu", "0HY", "kk", "5v7", "4sw", "5h5", "4mu", "1Fz", "1a", "2MT", "0xw", "4CY", "4V8", 
-"7kk", "4Ni", "01O", "Vu", "xY", "m8", "54l", "6Uf", "6Zg", "4oD", "b9", "3P", "Yt", "0zF", "4Ah", "60C", "4Y9", "4LX", "0wv", "TD", 
-"zh", "0YZ", "4bt", "5g4", "Fl", "11w", "5NQ", "6kS", "aom", "44T", "0Kr", "1N2", "ep", "0FB", "49d", "6HO", "6fc", "5Ca", "0hn", "3Ml", 
-"U", "0go", "bfr", "6ib", "6GN", "46e", "0IC", "jq", "gA", "0Ds", "bEn", "hyU", "5T1", "4Qq", "8cG", "Im", "00U", "Wo", "5J3", "4Os", 
-"55v", "406", "yC", "0Zq", "0WA", "ts", "6YL", "4lo", "4BC", "63h", "2LN", "0ym", "02d", "2CO", "6xa", "4MB", "4cn", "6VM", "2mc", "1Ha", 
-"0Up", "2J", "a5g", "bTm", "5PS", "5E2", "Xn", "86L", "0ip", "JB", "73T", "bhm", "48z", "5y2", "dn", "337", "87", "3on", "6Da", "45J", 
-"5OO", "6jM", "Gr", "10i", "0kA", "Hs", "6eL", "4Po", "5nb", "aar", "24F", "76", "8AE", "ko", "5v3", "4ss", "bgl", "aBn", "EC", "0fq", 
-"2MP", "0xs", "776", "62v", "5h1", "4mq", "9Of", "1e", "2nL", "1KN", "54h", "6Ub", "7ko", "4Nm", "01K", "Vq", "Yp", "0zB", "4Al", "60G", 
-"6Zc", "bUs", "0Tn", "3T", "zl", "8PF", "4bp", "5g0", "aSm", "787", "03z", "1r2", "4e9", "44P", "0Kv", "hD", "Fh", "0eZ", "5NU", "6kW", 
-"6fg", "4SD", "0hj", "KX", "et", "0FF", "5mI", "6HK", "6GJ", "46a", "0IG", "ju", "Q", "Q8", "5Ld", "6if", "5T5", "4Qu", "1zz", "Ii", 
-"gE", "0Dw", "5ox", "4j8", "55r", "402", "yG", "0Zu", "00Q", "Wk", "5J7", "4Ow", "4BG", "63l", "2LJ", "0yi", "0WE", "tw", "6YH", "4lk", 
-"4cj", "6VI", "2mg", "0XD", "0vh", "UZ", "6xe", "4MF", "5PW", "5E6", "Xj", "1ky", "0Ut", "2N", "7KX", "4nZ", "5OC", "6jA", "2Qo", "0dL", 
-"1ZA", "iR", "6Dm", "45F", "48v", "acO", "db", "0GP", "94M", "JN", "4G3", "4RR", "5Mr", "4H2", "EO", "12T", "0HQ", "kc", "527", "47w", 
-"5nn", "6Kl", "fS", "s2", "0kM", "3NO", "71i", "4Pc", "7kc", "4Na", "01G", "3PM", "xQ", "m0", "54d", "6Un", "a6D", "59T", "0VS", "1i", 
-"197", "85o", "4CQ", "4V0", "4Y1", "4LP", "03v", "TL", "0L3", "0YR", "56U", "a9E", "6Zo", "4oL", "b1", "3X", "2Om", "0zN", "5QA", "60K", 
-"ex", "0FJ", "49l", "6HG", "6fk", "4SH", "0hf", "KT", "Fd", "0eV", "5NY", "aAI", "4e5", "4pT", "0Kz", "hH", "gI", "1TZ", "5ot", "4j4", 
-"5T9", "4Qy", "0jW", "Ie", "DU", "Q4", "5Lh", "6ij", "6GF", "46m", "0IK", "jy", "0WI", "0s", "6YD", "4lg", "4BK", "6wh", "ZW", "O6", 
-"0tU", "Wg", "6zX", "6o9", "4aW", "4t6", "yK", "0Zy", "0Ux", "2B", "7KT", "4nV", "bzI", "61Q", "Xf", "1ku", "02l", "UV", "6xi", "4MJ", 
-"4cf", "6VE", "2mk", "0XH", "0Jd", "iV", "6Di", "45B", "5OG", "6jE", "Gz", "0dH", "0ix", "JJ", "4G7", "4RV", "48r", "6IY", "df", "0GT", 
-"0HU", "kg", "523", "47s", "5Mv", "4H6", "EK", "0fy", "0kI", "3NK", "6eD", "4Pg", "5nj", "6Kh", "fW", "s6", "xU", "m4", "5ph", "6Uj", 
-"7kg", "4Ne", "01C", "Vy", "193", "1hZ", "4CU", "4V4", "5h9", "4my", "0VW", "1m", "zd", "0YV", "4bx", "5g8", "4Y5", "4LT", "03r", "TH", 
-"Yx", "0zJ", "4Ad", "60O", "6Zk", "4oH", "b5", "wT", "6fo", "4SL", "0hb", "KP", "27e", "0FN", "49h", "6HC", "4e1", "44X", "8Bf", "hL", 
-"0p3", "0eR", "bdO", "aAM", "70w", "657", "0jS", "Ia", "gM", "8Mg", "5op", "4j0", "6GB", "46i", "0IO", "28d", "Y", "Q0", "5Ll", "6in", 
-"4BO", "63d", "ZS", "O2", "0WM", "0w", "7Ia", "4lc", "4aS", "4t2", "yO", "8Se", "00Y", "Wc", "aPN", "b1D", "bzM", "61U", "Xb", "1kq", 
-"216", "2F", "7KP", "4nR", "4cb", "6VA", "2mo", "0XL", "02h", "UR", "6xm", "4MN", "5j7", "4ow", "0TY", "3c", "YG", "0zu", "5Qz", "60p", 
-"6yH", "4Lk", "03M", "Tw", "2lJ", "0Yi", "4bG", "6Wd", "6Xe", "4mF", "0Vh", "1R", "2Mg", "0xD", "4Cj", "62A", "7kX", "4NZ", "0ut", "VF", 
-"xj", "1Ky", "5pW", "5e6", "5nU", "6KW", "fh", "0EZ", "0kv", "HD", "4E9", "4PX", "5MI", "6hK", "Et", "0fF", "0Hj", "kX", "6Fg", "47L", 
-"48M", "6If", "dY", "50", "0iG", "Ju", "6gJ", "4Ri", "5Ox", "4J8", "GE", "0dw", "1Zz", "ii", "5t5", "4qu", "02W", "Um", "5H1", "4Mq", 
-"57t", "424", "2mP", "0Xs", "0UC", "2y", "7Ko", "4nm", "bzr", "61j", "2NL", "1kN", "00f", "2AM", "6zc", "bus", "4al", "6TO", "yp", "0ZB", 
-"0Wr", "0H", "a7e", "58u", "4Bp", "5G0", "Zl", "84N", "f", "13u", "5LS", "5Y2", "amo", "46V", "0Ip", "jB", "gr", "1Ta", "5oO", "6JM", 
-"6da", "4QB", "0jl", "3On", "2PN", "0em", "5Nb", "aAr", "6EL", "44g", "0KA", "hs", "eC", "0Fq", "49W", "abn", "5V3", "4Ss", "8aE", "Ko", 
-"YC", "0zq", "754", "60t", "5j3", "4os", "9Md", "3g", "2lN", "0Ym", "4bC", "7GA", "6yL", "4Lo", "03I", "Ts", "2Mc", "1ha", "4Cn", "62E", 
-"6Xa", "4mB", "0Vl", "1V", "xn", "8RD", "5pS", "5e2", "aQo", "b0e", "01x", "VB", "0kr", "1n2", "71V", "bjo", "5nQ", "6KS", "fl", "315", 
-"0Hn", "29E", "6Fc", "47H", "5MM", "6hO", "Ep", "0fB", "0iC", "Jq", "6gN", "4Rm", "48I", "6Ib", "26D", "54", "8CG", "im", "509", "45y", 
-"ben", "hYU", "GA", "0ds", "4cY", "420", "2mT", "0Xw", "02S", "Ui", "5H5", "4Mu", "5Pd", "61n", "XY", "M8", "0UG", "vu", "7Kk", "4ni", 
-"4ah", "6TK", "yt", "0ZF", "B9", "WX", "6zg", "4OD", "4Bt", "5G4", "Zh", "0yZ", "0Wv", "0L", "4y9", "4lX", "6Gy", "46R", "0It", "jF", 
-"b", "0gX", "5LW", "5Y6", "6de", "4QF", "0jh", "IZ", "gv", "0DD", "5oK", "6JI", "6EH", "44c", "0KE", "hw", "2PJ", "0ei", "5Nf", "6kd", 
-"5V7", "4Sw", "0hY", "Kk", "eG", "0Fu", "49S", "6Hx", "7ia", "4Lc", "03E", "2Bn", "zS", "o2", "4bO", "6Wl", "a4F", "bUL", "0TQ", "3k", 
-"YO", "87m", "4AS", "4T2", "7kP", "4NR", "01t", "VN", "xb", "1Kq", "54W", "hfv", "6Xm", "4mN", "1FA", "1Z", "2Mo", "0xL", "4Cb", "62I", 
-"5MA", "6hC", "2Sm", "0fN", "0Hb", "kP", "6Fo", "47D", "bDO", "aaM", "0P3", "0ER", "8bf", "HL", "4E1", "4PP", "5Op", "4J0", "GM", "10V", 
-"0JS", "ia", "505", "45u", "48E", "6In", "dQ", "58", "0iO", "3LM", "6gB", "4Ra", "0UK", "2q", "7Kg", "4ne", "5Ph", "61b", "XU", "M4", 
-"0vW", "Ue", "5H9", "4My", "4cU", "4v4", "2mX", "1HZ", "0Wz", "tH", "4y5", "4lT", "4Bx", "5G8", "Zd", "0yV", "B5", "WT", "6zk", "4OH", 
-"4ad", "6TG", "yx", "0ZJ", "gz", "0DH", "5oG", "6JE", "6di", "4QJ", "0jd", "IV", "n", "0gT", "680", "6iY", "4g7", "4rV", "0Ix", "jJ", 
-"eK", "0Fy", "5mv", "4h6", "6fX", "5CZ", "0hU", "Kg", "FW", "S6", "5Nj", "6kh", "6ED", "44o", "0KI", "3nK", "zW", "o6", "4bK", "6Wh", 
-"6yD", "4Lg", "03A", "2Bj", "YK", "0zy", "4AW", "4T6", "6ZX", "6O9", "0TU", "3o", "xf", "1Ku", "54S", "6UY", "7kT", "4NV", "01p", "VJ", 
-"2Mk", "0xH", "4Cf", "62M", "6Xi", "4mJ", "0Vd", "uV", "0Hf", "kT", "6Fk", "4sH", "5ME", "6hG", "Ex", "0fJ", "0kz", "HH", "4E5", "4PT", 
-"5nY", "aaI", "fd", "0EV", "0JW", "ie", "501", "45q", "5Ot", "4J4", "GI", "10R", "0iK", "Jy", "6gF", "4Re", "48A", "6Ij", "dU", "q4", 
-"5Pl", "61f", "XQ", "M0", "0UO", "2u", "7Kc", "4na", "4cQ", "428", "39u", "8Qg", "0vS", "Ua", "aRL", "b3F", "bxO", "63W", "0l3", "0yR", 
-"234", "0D", "4y1", "4lP", "55I", "6TC", "2om", "0ZN", "B1", "WP", "6zo", "4OL", "6dm", "4QN", "1zA", "IR", "25g", "0DL", "5oC", "6JA", 
-"4g3", "46Z", "9PE", "jN", "j", "0gP", "684", "aCO", "72u", "675", "0hQ", "Kc", "eO", "8Oe", "5mr", "4h2", "7Ua", "44k", "0KM", "3nO", 
-"FS", "S2", "5Nn", "6kl", "4x6", "4mW", "0Vy", "1C", "0m4", "0xU", "5SZ", "62P", "7kI", "4NK", "C6", "VW", "2nj", "1Kh", "54N", "6UD", 
-"6ZE", "4of", "0TH", "3r", "YV", "L7", "4AJ", "60a", "6yY", "4Lz", "0wT", "Tf", "zJ", "0Yx", "4bV", "4w7", "5lu", "4i5", "dH", "0Gz", 
-"0iV", "Jd", "5W8", "4Rx", "5Oi", "6jk", "GT", "R5", "0JJ", "ix", "6DG", "45l", "5nD", "6KF", "fy", "0EK", "0kg", "HU", "6ej", "4PI", 
-"5MX", "5X9", "Ee", "0fW", "1XZ", "kI", "4f4", "4sU", "00w", "WM", "4Z0", "4OQ", "55T", "hgu", "ya", "0ZS", "a0", "0Y", "6Yn", "4lM", 
-"4Ba", "63J", "2Ll", "0yO", "02F", "2Cm", "6xC", "aG0", "4cL", "6Vo", "2mA", "n1", "0UR", "2h", "a5E", "bTO", "5Pq", "4U1", "XL", "86n", 
-"FN", "11U", "5Ns", "4K3", "516", "44v", "0KP", "hb", "eR", "p3", "49F", "6Hm", "6fA", "4Sb", "0hL", "3MN", "w", "0gM", "5LB", "7ya", 
-"6Gl", "46G", "0Ia", "jS", "gc", "0DQ", "bEL", "hyw", "4D2", "4QS", "8ce", "IO", "0m0", "0xQ", "byL", "62T", "4x2", "4mS", "227", "1G", 
-"2nn", "1Kl", "54J", "7Ea", "7kM", "4NO", "C2", "VS", "YR", "L3", "4AN", "60e", "6ZA", "4ob", "0TL", "3v", "zN", "8Pd", "4bR", "4w3", 
-"aSO", "b2E", "03X", "Tb", "0iR", "3LP", "73v", "666", "48X", "4i1", "dL", "8Nf", "0JN", "3oL", "6DC", "45h", "5Om", "6jo", "GP", "R1", 
-"0kc", "HQ", "6en", "4PM", "a09", "6KB", "24d", "0EO", "8Ag", "kM", "4f0", "47Y", "697", "aBL", "Ea", "0fS", "4ay", "5d9", "ye", "0ZW", 
-"00s", "WI", "4Z4", "4OU", "4Be", "63N", "Zy", "0yK", "a4", "tU", "6Yj", "4lI", "4cH", "6Vk", "2mE", "n5", "02B", "Ux", "6xG", "4Md", 
-"5Pu", "4U5", "XH", "86j", "0UV", "2l", "5k8", "4nx", "512", "44r", "0KT", "hf", "FJ", "0ex", "5Nw", "4K7", "6fE", "4Sf", "0hH", "Kz", 
-"eV", "p7", "49B", "6Hi", "6Gh", "46C", "0Ie", "jW", "s", "0gI", "5LF", "6iD", "4D6", "4QW", "0jy", "IK", "gg", "0DU", "5oZ", "6JX", 
-"7kA", "4NC", "01e", "3Po", "xs", "8RY", "54F", "6UL", "a6f", "59v", "0Vq", "1K", "d3E", "85M", "4Cs", "5F3", "5I2", "4Lr", "03T", "Tn", 
-"zB", "0Yp", "56w", "437", "6ZM", "4on", "1Da", "3z", "2OO", "0zl", "4AB", "60i", "5Oa", "6jc", "2QM", "0dn", "0JB", "ip", "6DO", "45d", 
-"48T", "acm", "1B2", "0Gr", "94o", "Jl", "5W0", "4Rp", "5MP", "5X1", "Em", "12v", "0Hs", "kA", "all", "47U", "5nL", "6KN", "fq", "0EC", 
-"0ko", "3Nm", "6eb", "4PA", "a8", "0Q", "6Yf", "4lE", "4Bi", "63B", "Zu", "0yG", "0tw", "WE", "4Z8", "4OY", "4au", "5d5", "yi", "1Jz", 
-"0UZ", "vh", "5k4", "4nt", "5Py", "4U9", "XD", "1kW", "02N", "Ut", "6xK", "4Mh", "4cD", "6Vg", "2mI", "n9", "eZ", "43", "49N", "6He", 
-"6fI", "4Sj", "0hD", "Kv", "FF", "0et", "7n9", "6ky", "5u6", "4pv", "0KX", "hj", "gk", "0DY", "5oV", "5z7", "6dx", "5Az", "0ju", "IG", 
-"Dw", "0gE", "5LJ", "6iH", "6Gd", "46O", "0Ii", "28B", "xw", "1Kd", "54B", "6UH", "7kE", "4NG", "01a", "3Pk", "0m8", "0xY", "4Cw", "5F7", 
-"6Xx", "59r", "0Vu", "1O", "zF", "0Yt", "4bZ", "433", "5I6", "4Lv", "03P", "Tj", "YZ", "0zh", "4AF", "60m", "6ZI", "4oj", "0TD", "wv", 
-"0JF", "it", "6DK", "4qh", "5Oe", "6jg", "GX", "R9", "0iZ", "Jh", "5W4", "4Rt", "48P", "4i9", "dD", "0Gv", "0Hw", "kE", "4f8", "47Q", 
-"5MT", "5X5", "Ei", "12r", "0kk", "HY", "6ef", "4PE", "5nH", "6KJ", "fu", "0EG", "4Bm", "63F", "Zq", "0yC", "0Wo", "0U", "6Yb", "4lA", 
-"4aq", "5d1", "ym", "8SG", "0ts", "WA", "aPl", "b1f", "747", "61w", "2NQ", "1kS", "9Lg", "2d", "5k0", "4np", "57i", "6Vc", "2mM", "0Xn", 
-"02J", "Up", "6xO", "4Ml", "6fM", "4Sn", "1xa", "Kr", "27G", "47", "49J", "6Ha", "5u2", "44z", "8BD", "hn", "FB", "0ep", "bdm", "aAo", 
-"70U", "bkl", "0jq", "IC", "go", "306", "5oR", "5z3", "7WA", "46K", "0Im", "28F", "Ds", "0gA", "5LN", "6iL", "0cY", "020", "6mT", "4Xw", 
-"42S", "6Cx", "nG", "0Mu", "1Pd", "cw", "6NH", "5kJ", "4UG", "74M", "3Kk", "0ni", "0ah", "BZ", "6oe", "4ZF", "40b", "6AI", "lv", "0OD", 
-"0Bt", "aF", "6Ly", "4yZ", "4Wv", "5R6", "Oj", "0lX", "Qh", "06R", "4It", "5L4", "461", "4gX", "1LW", "1Y6", "rt", "0QF", "4jh", "7Oj", 
-"65o", "4DD", "I9", "2JI", "SY", "F8", "4KE", "7nG", "6PJ", "4ei", "1Nf", "2kd", "4M", "0Sw", "4hY", "490", "5C5", "4Fu", "09S", "2Hx", 
-"6OR", "4zq", "354", "bm", "LA", "0os", "bnn", "75W", "6lN", "4Ym", "0bC", "Aq", "2yL", "0Lo", "43I", "6Bb", "6Mc", "5ha", "15", "22E", 
-"Np", "0mB", "4Vl", "6cO", "aDm", "bao", "1pS", "1e2", "ml", "8GF", "41x", "548", "4kr", "5n2", "7f", "8YD", "1nQ", "2KS", "64u", "715", 
-"4Hn", "69E", "Pr", "07H", "1MM", "2hO", "6Sa", "4fB", "4iC", "7LA", "5W", "0Rm", "08I", "2Ib", "66D", "4Go", "b4d", "aUn", "RC", "05y", 
-"8VE", "8g", "5a3", "4ds", "42W", "ain", "nC", "0Mq", "17t", "024", "6mP", "4Xs", "4UC", "74I", "3Ko", "0nm", "8IY", "cs", "6NL", "5kN", 
-"40f", "6AM", "lr", "8FX", "0al", "2TO", "6oa", "4ZB", "4Wr", "5R2", "On", "18u", "0Bp", "aB", "afo", "bCm", "465", "53u", "1LS", "1Y2", 
-"Ql", "06V", "4Ip", "5L0", "65k", "5Ta", "1oO", "2JM", "6x", "0QB", "4jl", "7On", "6PN", "4em", "1Nb", "9y", "2EL", "04g", "4KA", "7nC", 
-"5C1", "4Fq", "09W", "d6G", "4I", "0Ss", "bRn", "494", "LE", "0ow", "4TY", "4A8", "6OV", "4zu", "1Qz", "bi", "oY", "z8", "43M", "6Bf", 
-"6lJ", "4Yi", "0bG", "Au", "Nt", "0mF", "4Vh", "6cK", "6Mg", "4xD", "11", "22A", "mh", "0NZ", "4ut", "5p4", "4N9", "5Ky", "1pW", "CD", 
-"1nU", "2KW", "64q", "4EZ", "4kv", "5n6", "7b", "0PX", "1MI", "2hK", "6Se", "4fF", "4Hj", "69A", "Pv", "07L", "08M", "2If", "6rH", "4Gk", 
-"4iG", "7LE", "5S", "0Ri", "1Ox", "8c", "5a7", "4dw", "5Zz", "7oY", "RG", "0qu", "1Pl", "21f", "adR", "5kB", "4UO", "74E", "MS", "X2", 
-"0cQ", "028", "79u", "bbL", "4vS", "4c2", "nO", "8De", "8Kd", "aN", "4l3", "4yR", "634", "76t", "Ob", "0lP", "W3", "BR", "6om", "4ZN", 
-"40j", "6AA", "2zo", "0OL", "6t", "0QN", "5zA", "7Ob", "65g", "4DL", "I1", "2JA", "0g3", "06Z", "b7G", "68W", "469", "4gP", "284", "dSn", 
-"4E", "275", "4hQ", "498", "67V", "b8F", "1mr", "0h2", "SQ", "F0", "4KM", "7nO", "6PB", "4ea", "1Nn", "9u", "6lF", "4Ye", "0bK", "Ay", 
-"oU", "z4", "43A", "6Bj", "6OZ", "4zy", "0AW", "be", "LI", "2O9", "4TU", "4A4", "4N5", "5Ku", "14S", "CH", "md", "0NV", "41p", "540", 
-"6Mk", "4xH", "u5", "22M", "Nx", "0mJ", "4Vd", "6cG", "4Hf", "69M", "Pz", "0sH", "k7", "2hG", "6Si", "4fJ", "4kz", "7Nx", "7n", "0PT", 
-"1nY", "dqh", "4P7", "4EV", "4JW", "7oU", "RK", "05q", "1Ot", "8o", "6QX", "50R", "4iK", "7LI", "qW", "d6", "08A", "2Ij", "66L", "4Gg", 
-"4UK", "74A", "MW", "X6", "1Ph", "21b", "6ND", "5kF", "4vW", "4c6", "nK", "0My", "0cU", "0v4", "6mX", "5HZ", "4Wz", "6bY", "Of", "0lT", 
-"0Bx", "aJ", "4l7", "4yV", "40n", "6AE", "lz", "0OH", "W7", "BV", "6oi", "4ZJ", "65c", "4DH", "I5", "2JE", "6p", "0QJ", "4jd", "7Of", 
-"4r5", "4gT", "280", "2iY", "Qd", "0rV", "4Ix", "5L8", "5C9", "4Fy", "1mv", "0h6", "4A", "1CZ", "4hU", "7MW", "6PF", "4ee", "1Nj", "9q", 
-"SU", "F4", "4KI", "7nK", "oQ", "z0", "43E", "6Bn", "6lB", "4Ya", "0bO", "2Wl", "LM", "8fg", "4TQ", "4A0", "aeL", "cPo", "0AS", "ba", 
-"3kP", "0NR", "41t", "544", "4N1", "5Kq", "14W", "CL", "2Xm", "0mN", "5FA", "6cC", "6Mo", "4xL", "19", "22I", "k3", "2hC", "6Sm", "4fN", 
-"4Hb", "69I", "2Fo", "07D", "83l", "d5d", "4P3", "4ER", "bQM", "a0G", "7j", "0PP", "1Op", "8k", "hbw", "50V", "4JS", "7oQ", "RO", "05u", 
-"08E", "2In", "66H", "4Gc", "4iO", "7LM", "qS", "d2", "0ay", "BK", "4O6", "4ZW", "40s", "553", "lg", "0OU", "t6", "aW", "6Lh", "4yK", 
-"4Wg", "6bD", "2Yj", "0lI", "0cH", "2Vk", "6mE", "4Xf", "42B", "6Ci", "nV", "0Md", "1Pu", "cf", "6NY", "bAI", "4UV", "7pT", "MJ", "0nx", 
-"SH", "04r", "4KT", "7nV", "azI", "4ex", "1Nw", "9l", "pT", "e5", "4hH", "7MJ", "67O", "4Fd", "09B", "2Hi", "Qy", "06C", "4Ie", "68N", 
-"6Rj", "4gI", "j4", "2iD", "6m", "0QW", "4jy", "5o9", "4Q4", "4DU", "1oZ", "2JX", "4m0", "4xQ", "8Jg", "22T", "Na", "0mS", "627", "77w", 
-"6nn", "5Kl", "V0", "CQ", "3kM", "0NO", "41i", "7Pc", "6OC", "5jA", "0AN", "20e", "LP", "Y1", "4TL", "6ao", "78v", "bcO", "0bR", "0w3", 
-"oL", "8Ef", "43X", "4b1", "4iR", "7LP", "5F", "266", "08X", "0i1", "66U", "b9E", "4JN", "7oL", "RR", "G3", "1Om", "8v", "6QA", "4db", 
-"4kc", "7Na", "7w", "0PM", "H2", "2KB", "64d", "4EO", "b6D", "69T", "Pc", "07Y", "297", "dRm", "4s2", "4fS", "40w", "557", "lc", "0OQ", 
-"15T", "BO", "4O2", "4ZS", "4Wc", "76i", "2Yn", "0lM", "t2", "aS", "6Ll", "4yO", "42F", "6Cm", "nR", "8Dx", "0cL", "2Vo", "6mA", "4Xb", 
-"4UR", "74X", "MN", "8gd", "1Pq", "cb", "adO", "bAM", "azM", "51U", "1Ns", "9h", "SL", "04v", "4KP", "7nR", "67K", "5VA", "09F", "2Hm", 
-"4X", "e1", "4hL", "7MN", "6Rn", "4gM", "j0", "3ya", "2Gl", "06G", "4Ia", "68J", "4Q0", "4DQ", "82o", "d4g", "6i", "0QS", "bPN", "a1D", 
-"Ne", "0mW", "4Vy", "5S9", "4m4", "4xU", "1SZ", "22P", "my", "0NK", "41m", "7Pg", "6nj", "5Kh", "V4", "CU", "LT", "Y5", "4TH", "6ak", 
-"6OG", "4zd", "0AJ", "bx", "oH", "0Lz", "4wT", "4b5", "78r", "4Yx", "0bV", "Ad", "1lu", "0i5", "66Q", "4Gz", "4iV", "7LT", "5B", "0Rx", 
-"1Oi", "8r", "6QE", "4df", "4JJ", "7oH", "RV", "G7", "H6", "2KF", "6ph", "4EK", "4kg", "7Ne", "7s", "0PI", "1MX", "1X9", "4s6", "4fW", 
-"5XZ", "69P", "Pg", "0sU", "06", "23F", "afr", "4yC", "4Wo", "6bL", "Os", "0lA", "0aq", "BC", "aEn", "c4E", "4ts", "5q3", "lo", "8FE", 
-"347", "cn", "6NQ", "5kS", "bom", "74T", "MB", "0np", "17i", "2Vc", "6mM", "4Xn", "42J", "6Ca", "2xO", "0Ml", "4T", "0Sn", "5xa", "7MB", 
-"67G", "4Fl", "09J", "2Ha", "1u2", "04z", "b5g", "aTm", "6PS", "4ep", "8WF", "9d", "6e", "8XG", "4jq", "5o1", "65v", "706", "1oR", "1z3", 
-"Qq", "06K", "4Im", "68F", "6Rb", "4gA", "1LN", "2iL", "6nf", "5Kd", "V8", "CY", "mu", "0NG", "41a", "7Pk", "4m8", "4xY", "0Cw", "1F7", 
-"Ni", "19r", "4Vu", "5S5", "6lW", "4Yt", "0bZ", "Ah", "oD", "0Lv", "43P", "4b9", "6OK", "4zh", "0AF", "bt", "LX", "Y9", "4TD", "6ag", 
-"4JF", "7oD", "RZ", "0qh", "1Oe", "2jg", "6QI", "4dj", "4iZ", "483", "5N", "0Rt", "08P", "0i9", "5B6", "4Gv", "4Hw", "5M7", "Pk", "07Q", 
-"1MT", "1X5", "472", "52r", "4kk", "7Ni", "sw", "0PE", "1nH", "2KJ", "64l", "4EG", "4Wk", "6bH", "Ow", "0lE", "02", "23B", "6Ld", "4yG", 
-"4tw", "5q7", "lk", "0OY", "0au", "BG", "6ox", "5Jz", "4UZ", "74P", "MF", "0nt", "1Py", "cj", "6NU", "5kW", "42N", "6Ce", "nZ", "0Mh", 
-"0cD", "2Vg", "6mI", "4Xj", "67C", "4Fh", "09N", "2He", "4P", "e9", "4hD", "7MF", "6PW", "4et", "3n9", "2ky", "SD", "0pv", "4KX", "7nZ", 
-"4Q8", "4DY", "1oV", "1z7", "6a", "1Az", "4ju", "5o5", "6Rf", "4gE", "j8", "2iH", "Qu", "06O", "4Ii", "68B", "mq", "0NC", "41e", "7Po", 
-"6nb", "bar", "14F", "2UL", "Nm", "19v", "4Vq", "5S1", "agl", "bBn", "0Cs", "1F3", "1I2", "0Lr", "43T", "ahm", "6lS", "4Yp", "16w", "Al", 
-"2ZM", "0on", "5Da", "6ac", "6OO", "4zl", "0AB", "bp", "1Oa", "8z", "6QM", "4dn", "4JB", "aUs", "2DO", "05d", "08T", "d7D", "5B2", "4Gr", 
-"bSm", "487", "5J", "0Rp", "1MP", "1X1", "476", "52v", "4Hs", "5M3", "Po", "07U", "1nL", "2KN", "64h", "4EC", "4ko", "7Nm", "ss", "0PA", 
-"QJ", "06p", "4IV", "7lT", "6RY", "4gz", "1Lu", "0I5", "rV", "g7", "4jJ", "7OH", "65M", "4Df", "1oi", "2Jk", "2Ej", "04A", "4Kg", "7ne", 
-"6Ph", "4eK", "h6", "2kF", "4o", "0SU", "5xZ", "7My", "4S6", "4FW", "09q", "1x9", "17R", "2VX", "4M4", "4XU", "42q", "571", "ne", "0MW", 
-"v4", "cU", "6Nj", "5kh", "4Ue", "74o", "My", "0nK", "0aJ", "Bx", "6oG", "4Zd", "4tH", "6Ak", "lT", "y5", "0BV", "ad", "580", "4yx", 
-"4WT", "4B5", "OH", "0lz", "4kP", "7NR", "7D", "244", "1ns", "0k3", "64W", "con", "4HL", "69g", "PP", "E1", "1Mo", "2hm", "6SC", "52I", 
-"4ia", "7Lc", "5u", "0RO", "J0", "3Ya", "66f", "4GM", "b4F", "aUL", "Ra", "0qS", "8Vg", "8E", "458", "4dQ", "4o2", "4zS", "8He", "bO", 
-"Lc", "0oQ", "605", "75u", "6ll", "4YO", "T2", "AS", "2yn", "0LM", "43k", "7Ra", "6MA", "4xb", "0CL", "22g", "NR", "19I", "4VN", "6cm", 
-"aDO", "baM", "14y", "Cb", "mN", "8Gd", "41Z", "7PP", "axO", "53W", "1Lq", "0I1", "QN", "06t", "4IR", "68y", "65I", "4Db", "1om", "2Jo", 
-"6Z", "g3", "4jN", "7OL", "6Pl", "4eO", "h2", "2kB", "2En", "04E", "4Kc", "7na", "4S2", "4FS", "09u", "d6e", "4k", "0SQ", "bRL", "a3F", 
-"42u", "575", "na", "0MS", "17V", "dlo", "4M0", "4XQ", "4Ua", "74k", "3KM", "0nO", "28", "cQ", "6Nn", "5kl", "40D", "6Ao", "lP", "y1", 
-"0aN", "2Tm", "6oC", "5JA", "4WP", "4B1", "OL", "18W", "0BR", "0W3", "584", "bCO", "1nw", "0k7", "64S", "4Ex", "4kT", "7NV", "sH", "0Pz", 
-"1Mk", "2hi", "6SG", "4fd", "4HH", "69c", "PT", "E5", "J4", "2ID", "66b", "4GI", "4ie", "7Lg", "5q", "0RK", "1OZ", "8A", "4q4", "4dU", 
-"4Jy", "5O9", "Re", "0qW", "Lg", "0oU", "5DZ", "6aX", "4o6", "4zW", "0Ay", "bK", "2yj", "0LI", "43o", "6BD", "6lh", "4YK", "T6", "AW", 
-"NV", "0md", "4VJ", "6ci", "6ME", "4xf", "0CH", "22c", "mJ", "0Nx", "4uV", "7PT", "6nY", "baI", "1pu", "Cf", "6V", "0Ql", "4jB", "aus", 
-"65E", "4Dn", "1oa", "2Jc", "QB", "06x", "b7e", "68u", "5b2", "4gr", "8UD", "dSL", "4g", "8ZE", "4hs", "5m3", "67t", "724", "09y", "1x1", 
-"Ss", "04I", "4Ko", "7nm", "azr", "4eC", "1NL", "9W", "24", "21D", "6Nb", "bAr", "4Um", "74g", "Mq", "0nC", "0cs", "1f3", "79W", "bbn", 
-"42y", "579", "nm", "394", "365", "al", "588", "4yp", "bmo", "76V", "1i2", "0lr", "0aB", "Bp", "6oO", "4Zl", "40H", "6Ac", "2zM", "0On", 
-"4HD", "69o", "PX", "E9", "1Mg", "2he", "6SK", "4fh", "4kX", "7NZ", "7L", "0Pv", "3N9", "2Ky", "6pW", "4Et", "4Ju", "5O5", "Ri", "05S", 
-"1OV", "8M", "450", "4dY", "4ii", "7Lk", "qu", "0RG", "J8", "2IH", "66n", "4GE", "6ld", "4YG", "0bi", "2WJ", "ow", "0LE", "43c", "6BH", 
-"6Ox", "5jz", "0Au", "bG", "Lk", "0oY", "4Tw", "5Q7", "6nU", "5KW", "14q", "Cj", "mF", "0Nt", "41R", "7PX", "6MI", "4xj", "0CD", "22o", 
-"NZ", "0mh", "4VF", "6ce", "65A", "4Dj", "1oe", "2Jg", "6R", "0Qh", "4jF", "7OD", "5b6", "4gv", "1Ly", "0I9", "QF", "0rt", "4IZ", "68q", 
-"67p", "5Vz", "1mT", "1x5", "4c", "0SY", "4hw", "5m7", "6Pd", "4eG", "1NH", "9S", "Sw", "04M", "4Kk", "7ni", "4Ui", "74c", "Mu", "0nG", 
-"20", "cY", "6Nf", "5kd", "4vu", "5s5", "ni", "390", "0cw", "1f7", "4M8", "4XY", "4WX", "4B9", "OD", "0lv", "0BZ", "ah", "6LW", "4yt", 
-"40L", "6Ag", "lX", "y9", "0aF", "Bt", "6oK", "4Zh", "1Mc", "2ha", "6SO", "4fl", "5Xa", "69k", "2FM", "07f", "83N", "d5F", "6pS", "4Ep", 
-"bQo", "a0e", "7H", "0Pr", "1OR", "8I", "454", "50t", "4Jq", "5O1", "Rm", "05W", "08g", "2IL", "66j", "4GA", "4im", "7Lo", "5y", "0RC", 
-"os", "0LA", "43g", "6BL", "78I", "4YC", "0bm", "2WN", "Lo", "8fE", "4Ts", "5Q3", "aen", "cPM", "0Aq", "bC", "mB", "0Np", "41V", "ajo", 
-"6nQ", "5KS", "14u", "Cn", "2XO", "0ml", "4VB", "6ca", "6MM", "4xn", "1Sa", "22k", "Sj", "04P", "4Kv", "5N6", "443", "4eZ", "1NU", "9N", 
-"pv", "0SD", "4hj", "7Mh", "67m", "4FF", "1mI", "2HK", "2GJ", "2", "4IG", "68l", "6RH", "4gk", "1Ld", "2if", "6O", "0Qu", "5zz", "7OY", 
-"5A7", "4Dw", "1ox", "0j8", "15r", "Bi", "6oV", "4Zu", "40Q", "4a8", "lE", "0Ow", "0BG", "au", "6LJ", "4yi", "4WE", "6bf", "OY", "Z8", 
-"U9", "2VI", "6mg", "4XD", "4vh", "6CK", "nt", "0MF", "1PW", "cD", "4n9", "5ky", "4Ut", "5P4", "Mh", "0nZ", "4ip", "5l0", "5d", "9Kg", 
-"08z", "1y2", "66w", "737", "4Jl", "7on", "Rp", "05J", "1OO", "8T", "6Qc", "50i", "4kA", "7NC", "7U", "0Po", "1nb", "dqS", "64F", "4Em", 
-"b6f", "69v", "PA", "0ss", "8TG", "dRO", "5c1", "4fq", "6MP", "4xs", "376", "22v", "NC", "0mq", "bll", "77U", "6nL", "5KN", "14h", "Cs", 
-"3ko", "0Nm", "41K", "7PA", "6Oa", "4zB", "37", "20G", "Lr", "8fX", "4Tn", "6aM", "78T", "bcm", "0bp", "AB", "on", "387", "43z", "5r2", 
-"447", "51w", "1NQ", "9J", "Sn", "04T", "4Kr", "5N2", "67i", "4FB", "09d", "2HO", "4z", "1Ca", "4hn", "7Ml", "6RL", "4go", "8UY", "2ib", 
-"2GN", "6", "4IC", "68h", "5A3", "4Ds", "82M", "d4E", "6K", "0Qq", "bPl", "a1f", "40U", "akl", "lA", "0Os", "15v", "Bm", "6oR", "4Zq", 
-"4WA", "6bb", "2YL", "0lo", "0BC", "aq", "6LN", "4ym", "42d", "6CO", "np", "0MB", "0cn", "2VM", "6mc", "5Ha", "4Up", "5P0", "Ml", "8gF", 
-"1PS", "1E2", "adm", "bAo", "1lW", "1y6", "4R9", "4GX", "4it", "5l4", "qh", "0RZ", "i9", "8P", "6Qg", "4dD", "4Jh", "7oj", "Rt", "05N", 
-"1nf", "2Kd", "64B", "4Ei", "4kE", "7NG", "7Q", "f8", "1Mz", "2hx", "5c5", "4fu", "4HY", "69r", "PE", "0sw", "NG", "0mu", "5Fz", "6cx", 
-"6MT", "4xw", "0CY", "0V8", "3kk", "0Ni", "41O", "7PE", "6nH", "5KJ", "14l", "Cw", "Lv", "0oD", "4Tj", "6aI", "6Oe", "4zF", "33", "bZ", 
-"oj", "0LX", "4wv", "5r6", "6ly", "4YZ", "0bt", "AF", "4v", "0SL", "4hb", "awS", "67e", "4FN", "K3", "2HC", "Sb", "04X", "b5E", "aTO", 
-"4p3", "4eR", "8Wd", "9F", "6G", "257", "4jS", "7OQ", "65T", "cnm", "1op", "0j0", "QS", "D2", "4IO", "68d", "7Ba", "4gc", "1Ll", "2in", 
-"0BO", "23d", "6LB", "4ya", "4WM", "6bn", "OQ", "Z0", "0aS", "Ba", "aEL", "c4g", "40Y", "4a0", "lM", "8Fg", "8If", "cL", "4n1", "5kq", 
-"616", "74v", "3KP", "0nR", "U1", "2VA", "6mo", "4XL", "42h", "6CC", "2xm", "0MN", "4Jd", "7of", "Rx", "05B", "i5", "2jE", "6Qk", "4dH", 
-"4ix", "5l8", "5l", "0RV", "08r", "2IY", "4R5", "4GT", "4HU", "7mW", "PI", "07s", "1Mv", "0H6", "5c9", "4fy", "4kI", "7NK", "sU", "f4", 
-"1nj", "2Kh", "64N", "4Ee", "6nD", "5KF", "1ph", "2Uj", "mW", "x6", "41C", "7PI", "593", "5hZ", "0CU", "0V4", "NK", "0my", "4VW", "4C6", 
-"4L7", "4YV", "0bx", "AJ", "of", "0LT", "43r", "562", "6Oi", "4zJ", "w7", "bV", "Lz", "0oH", "4Tf", "6aE", "67a", "4FJ", "K7", "2HG", 
-"4r", "0SH", "4hf", "7Md", "4p7", "4eV", "1NY", "9B", "Sf", "0pT", "4Kz", "7nx", "65P", "5TZ", "1ot", "0j4", "6C", "0Qy", "4jW", "7OU", 
-"6RD", "4gg", "1Lh", "2ij", "QW", "D6", "4IK", "7lI", "4WI", "6bj", "OU", "Z4", "0BK", "ay", "6LF", "4ye", "4tU", "4a4", "lI", "2o9", 
-"0aW", "Be", "6oZ", "4Zy", "4Ux", "5P8", "Md", "0nV", "8Ib", "cH", "4n5", "5ku", "42l", "6CG", "nx", "0MJ", "U5", "2VE", "6mk", "4XH", 
-"i1", "8X", "6Qo", "4dL", "5ZA", "7ob", "2Dm", "05F", "08v", "d7f", "4R1", "4GP", "bSO", "a2E", "5h", "0RR", "1Mr", "0H2", "ayL", "52T", 
-"4HQ", "69z", "PM", "07w", "1nn", "2Kl", "64J", "4Ea", "4kM", "7NO", "7Y", "f0", "mS", "x2", "41G", "7PM", "aDR", "5KB", "14d", "2Un", 
-"NO", "19T", "4VS", "4C2", "597", "bBL", "0CQ", "0V0", "ob", "0LP", "43v", "566", "4L3", "4YR", "16U", "AN", "2Zo", "0oL", "4Tb", "6aA", 
-"6Om", "4zN", "w3", "bR", "4oT", "4z5", "wH", "0Tz", "0zV", "Yd", "5D8", "4Ax", "4LH", "6yk", "TT", "A5", "0YJ", "zx", "6WG", "4bd", 
-"4me", "6XF", "1q", "0VK", "N4", "2MD", "62b", "4CI", "4Ny", "5K9", "Ve", "0uW", "1KZ", "xI", "4u4", "5pt", "4k6", "5nv", "0Ey", "fK", 
-"Hg", "0kU", "641", "6eX", "6hh", "5Mj", "P6", "EW", "29b", "0HI", "47o", "6FD", "6IE", "48n", "0GH", "dz", "JV", "0id", "4RJ", "6gi", 
-"6jY", "beI", "0dT", "Gf", "iJ", "0Jx", "4qV", "4d7", "UN", "02t", "4MR", "4X3", "a8G", "57W", "0XP", "0M1", "2Z", "c3", "4nN", "7KL", 
-"61I", "5PC", "1km", "2No", "2An", "00E", "4Oc", "7ja", "6Tl", "4aO", "l2", "yS", "0k", "0WQ", "58V", "a7F", "4W2", "4BS", "84m", "ZO", 
-"13V", "E", "4I0", "5Lp", "46u", "535", "ja", "0IS", "68", "gQ", "6Jn", "5ol", "4Qa", "6dB", "3OM", "0jO", "0eN", "2Pm", "6kC", "5NA", 
-"44D", "6Eo", "hP", "99", "0FR", "0S3", "abM", "49t", "4SP", "4F1", "KL", "8af", "0zR", "0o3", "60W", "ckn", "4oP", "4z1", "3D", "204", 
-"0YN", "2lm", "6WC", "56I", "4LL", "6yo", "TP", "A1", "N0", "903", "62f", "4CM", "4ma", "6XB", "1u", "0VO", "8Rg", "xM", "418", "54x", 
-"b0F", "aQL", "Va", "0uS", "Hc", "0kQ", "645", "71u", "4k2", "5nr", "8Le", "fO", "29f", "0HM", "47k", "7Va", "6hl", "5Mn", "P2", "ES", 
-"JR", "1yA", "4RN", "6gm", "6IA", "48j", "0GL", "26g", "iN", "8Cd", "45Z", "4d3", "hYv", "beM", "0dP", "Gb", "6VY", "4cz", "0XT", "0M5", 
-"UJ", "02p", "4MV", "4X7", "61M", "5PG", "1ki", "Xz", "vV", "c7", "4nJ", "7KH", "6Th", "4aK", "l6", "yW", "2Aj", "00A", "4Og", "6zD", 
-"4W6", "4BW", "0yy", "ZK", "0o", "0WU", "58R", "6YX", "46q", "531", "je", "0IW", "13R", "A", "4I4", "5Lt", "4Qe", "6dF", "Iy", "0jK", 
-"r4", "gU", "6Jj", "5oh", "4pH", "6Ek", "hT", "0Kf", "0eJ", "Fx", "6kG", "5NE", "4ST", "4F5", "KH", "0hz", "0FV", "ed", "5x8", "49p", 
-"bvs", "6yc", "2BM", "03f", "0YB", "zp", "6WO", "4bl", "bUo", "a4e", "3H", "0Tr", "87N", "Yl", "5D0", "4Ap", "4Nq", "5K1", "Vm", "01W", 
-"1KR", "xA", "414", "54t", "4mm", "6XN", "1y", "0VC", "0xo", "2ML", "62j", "4CA", "7xA", "5Mb", "0fm", "2SN", "ks", "0HA", "47g", "6FL", 
-"aan", "bDl", "0Eq", "fC", "Ho", "8bE", "4Ps", "5U3", "5Z2", "5OS", "10u", "Gn", "iB", "0Jp", "45V", "ano", "6IM", "48f", "1Wa", "dr", 
-"3Ln", "0il", "4RB", "6ga", "2R", "0Uh", "4nF", "7KD", "61A", "5PK", "1ke", "Xv", "UF", "0vt", "4MZ", "6xy", "5f6", "4cv", "0XX", "0M9", 
-"0c", "0WY", "4lw", "5i7", "63p", "5Rz", "0yu", "ZG", "Ww", "00M", "4Ok", "6zH", "6Td", "4aG", "0Zi", "2oJ", "60", "gY", "6Jf", "5od", 
-"4Qi", "6dJ", "Iu", "0jG", "0gw", "M", "4I8", "5Lx", "4ru", "5w5", "ji", "1Yz", "0FZ", "eh", "5x4", "5mU", "4SX", "4F9", "KD", "0hv", 
-"0eF", "Ft", "6kK", "5NI", "44L", "6Eg", "hX", "91", "0YF", "zt", "6WK", "4bh", "4LD", "6yg", "TX", "A9", "0zZ", "Yh", "5D4", "4At", 
-"4oX", "4z9", "3L", "0Tv", "1KV", "xE", "410", "54p", "4Nu", "5K5", "Vi", "01S", "N8", "2MH", "62n", "4CE", "4mi", "6XJ", "uu", "0VG", 
-"kw", "0HE", "47c", "6FH", "6hd", "5Mf", "0fi", "2SJ", "Hk", "0kY", "4Pw", "5U7", "6Kx", "5nz", "0Eu", "fG", "iF", "0Jt", "45R", "6Dy", 
-"5Z6", "5OW", "0dX", "Gj", "JZ", "0ih", "4RF", "6ge", "6II", "48b", "0GD", "dv", "61E", "5PO", "1ka", "Xr", "2V", "0Ul", "4nB", "aqs", 
-"5f2", "4cr", "8QD", "39V", "UB", "02x", "795", "aRo", "63t", "764", "0yq", "ZC", "0g", "9Nd", "4ls", "5i3", "7DA", "4aC", "0Zm", "2oN", 
-"Ws", "00I", "4Oo", "6zL", "4Qm", "6dN", "Iq", "0jC", "64", "25D", "6Jb", "bEr", "46y", "539", "jm", "9Pf", "0gs", "I", "aCl", "bfn", 
-"bio", "72V", "1m2", "0hr", "325", "el", "5x0", "49x", "44H", "6Ec", "3nl", "95", "0eB", "Fp", "6kO", "5NM", "4mt", "5h4", "uh", "0VZ", 
-"0xv", "2MU", "4V9", "4CX", "4Nh", "7kj", "Vt", "01N", "m9", "xX", "6Ug", "54m", "4oE", "6Zf", "3Q", "b8", "0zG", "Yu", "60B", "4Ai", 
-"4LY", "4Y8", "TE", "0ww", "1Iz", "zi", "5g5", "4bu", "5y7", "5lV", "0GY", "dk", "JG", "0iu", "5Bz", "6gx", "6jH", "5OJ", "0dE", "Gw", 
-"3ok", "82", "45O", "6Dd", "6Ke", "5ng", "73", "fZ", "Hv", "0kD", "4Pj", "6eI", "6hy", "7m9", "0ft", "EF", "kj", "0HX", "4sv", "5v6", 
-"Wn", "00T", "4Or", "5J2", "407", "55w", "0Zp", "yB", "0z", "1Ga", "4ln", "6YM", "63i", "4BB", "0yl", "2LO", "2CN", "02e", "4MC", "7hA", 
-"6VL", "4co", "0XA", "2mb", "2K", "0Uq", "bTl", "a5f", "5E3", "5PR", "86M", "Xo", "11v", "Fm", "6kR", "5NP", "44U", "aol", "hA", "0Ks", 
-"0FC", "eq", "6HN", "49e", "4SA", "6fb", "3Mm", "0ho", "0gn", "T", "6ic", "5La", "46d", "6GO", "jp", "0IB", "0Dr", "1A2", "hyT", "bEo", 
-"4Qp", "5T0", "Il", "8cF", "0xr", "2MQ", "62w", "777", "4mp", "5h0", "1d", "9Og", "1KO", "2nM", "6Uc", "54i", "4Nl", "7kn", "Vp", "01J", 
-"0zC", "Yq", "60F", "4Am", "4oA", "6Zb", "3U", "0To", "8PG", "zm", "5g1", "4bq", "786", "aSl", "TA", "0ws", "JC", "0iq", "bhl", "73U", 
-"5y3", "5lR", "336", "do", "3oo", "86", "45K", "7TA", "6jL", "5ON", "0dA", "Gs", "Hr", "8bX", "4Pn", "6eM", "6Ka", "5nc", "77", "24G", 
-"kn", "8AD", "47z", "5v2", "aBo", "bgm", "0fp", "EB", "403", "4aZ", "0Zt", "yF", "Wj", "00P", "4Ov", "5J6", "63m", "4BF", "0yh", "ZZ", 
-"tv", "0WD", "4lj", "6YI", "6VH", "4ck", "0XE", "2mf", "2CJ", "02a", "4MG", "6xd", "5E7", "5PV", "1kx", "Xk", "2O", "0Uu", "bTh", "7KY", 
-"44Q", "4e8", "hE", "0Kw", "11r", "Fi", "6kV", "5NT", "4SE", "6ff", "KY", "0hk", "0FG", "eu", "6HJ", "49a", "4rh", "6GK", "jt", "0IF", 
-"Q9", "P", "6ig", "5Le", "4Qt", "5T4", "Ih", "0jZ", "0Dv", "gD", "4j9", "5oy", "aD0", "7kb", "3PL", "01F", "m1", "xP", "6Uo", "54e", 
-"59U", "a6E", "1h", "0VR", "85n", "196", "4V1", "4CP", "4LQ", "4Y0", "TM", "03w", "0YS", "za", "a9D", "56T", "4oM", "6Zn", "3Y", "b0", 
-"0zO", "2Ol", "60J", "4Aa", "7za", "5OB", "0dM", "2Qn", "iS", "0Ja", "45G", "6Dl", "acN", "48w", "0GQ", "dc", "JO", "94L", "4RS", "4G2", 
-"4H3", "5Ms", "12U", "EN", "kb", "0HP", "47v", "526", "6Km", "5no", "s3", "fR", "3NN", "0kL", "4Pb", "6eA", "0r", "0WH", "4lf", "6YE", 
-"63a", "4BJ", "O7", "ZV", "Wf", "0tT", "4Oz", "6zY", "4t7", "4aV", "0Zx", "yJ", "2C", "0Uy", "4nW", "7KU", "61P", "5PZ", "1kt", "Xg", 
-"UW", "02m", "4MK", "6xh", "6VD", "4cg", "0XI", "2mj", "0FK", "ey", "6HF", "49m", "4SI", "6fj", "KU", "0hg", "0eW", "Fe", "6kZ", "5NX", 
-"4pU", "4e4", "hI", "2k9", "0Dz", "gH", "4j5", "5ou", "4Qx", "5T8", "Id", "0jV", "Q5", "DT", "6ik", "5Li", "46l", "6GG", "jx", "0IJ", 
-"m5", "xT", "6Uk", "54a", "4Nd", "7kf", "Vx", "01B", "0xz", "192", "4V5", "4CT", "4mx", "5h8", "1l", "0VV", "0YW", "ze", "5g9", "4by", 
-"4LU", "4Y4", "TI", "03s", "0zK", "Yy", "60N", "4Ae", "4oI", "6Zj", "wU", "b4", "iW", "0Je", "45C", "6Dh", "6jD", "5OF", "0dI", "2Qj", 
-"JK", "0iy", "4RW", "4G6", "6IX", "48s", "0GU", "dg", "kf", "0HT", "47r", "522", "4H7", "5Mw", "0fx", "EJ", "Hz", "0kH", "4Pf", "6eE", 
-"6Ki", "5nk", "s7", "fV", "63e", "4BN", "O3", "ZR", "0v", "0WL", "4lb", "6YA", "4t3", "4aR", "8Sd", "yN", "Wb", "00X", "b1E", "aPO", 
-"61T", "bzL", "1kp", "Xc", "2G", "217", "4nS", "7KQ", "7Fa", "4cc", "0XM", "2mn", "US", "02i", "4MO", "6xl", "4SM", "6fn", "KQ", "0hc", 
-"0FO", "27d", "6HB", "49i", "44Y", "4e0", "hM", "8Bg", "0eS", "Fa", "aAL", "bdN", "656", "70v", "3OP", "0jR", "8Mf", "gL", "4j1", "5oq", 
-"46h", "6GC", "28e", "0IN", "Q1", "X", "6io", "5Lm", "6KV", "5nT", "1Uz", "fi", "HE", "0kw", "4PY", "4E8", "6hJ", "5MH", "0fG", "Eu", 
-"kY", "0Hk", "47M", "6Ff", "6Ig", "48L", "51", "dX", "Jt", "0iF", "4Rh", "6gK", "4J9", "5Oy", "0dv", "GD", "ih", "0JZ", "4qt", "5t4", 
-"4ov", "5j6", "3b", "0TX", "0zt", "YF", "60q", "4AZ", "4Lj", "6yI", "Tv", "03L", "0Yh", "zZ", "6We", "4bF", "4mG", "6Xd", "1S", "0Vi", 
-"0xE", "2Mf", "6vH", "4Ck", "bth", "7kY", "VG", "0uu", "1Kx", "xk", "5e7", "5pV", "13t", "g", "5Y3", "5LR", "46W", "amn", "jC", "0Iq", 
-"0DA", "gs", "6JL", "5oN", "4QC", "70I", "3Oo", "0jm", "0el", "2PO", "6ka", "5Nc", "44f", "6EM", "hr", "8BX", "0Fp", "eB", "abo", "49V", 
-"4Sr", "5V2", "Kn", "8aD", "Ul", "02V", "4Mp", "5H0", "425", "57u", "0Xr", "2mQ", "2x", "0UB", "4nl", "7Kn", "61k", "5Pa", "1kO", "2NM", 
-"2AL", "00g", "4OA", "6zb", "6TN", "4am", "0ZC", "yq", "0I", "0Ws", "58t", "a7d", "5G1", "4Bq", "84O", "Zm", "HA", "0ks", "bjn", "71W", 
-"6KR", "5nP", "314", "fm", "29D", "0Ho", "47I", "6Fb", "6hN", "5ML", "0fC", "Eq", "Jp", "0iB", "4Rl", "6gO", "6Ic", "48H", "55", "26E", 
-"il", "8CF", "45x", "508", "hYT", "beo", "0dr", "1a2", "0zp", "YB", "60u", "755", "4or", "5j2", "3f", "9Me", "0Yl", "2lO", "6Wa", "4bB", 
-"4Ln", "6yM", "Tr", "03H", "0xA", "2Mb", "62D", "4Co", "4mC", "7HA", "1W", "0Vm", "8RE", "xo", "5e3", "54Z", "b0d", "aQn", "VC", "01y", 
-"46S", "6Gx", "jG", "0Iu", "0gY", "c", "5Y7", "5LV", "4QG", "6dd", "3Ok", "0ji", "0DE", "gw", "6JH", "5oJ", "44b", "6EI", "hv", "0KD", 
-"0eh", "FZ", "6ke", "5Ng", "4Sv", "5V6", "Kj", "0hX", "0Ft", "eF", "6Hy", "49R", "421", "4cX", "0Xv", "2mU", "Uh", "02R", "4Mt", "5H4", 
-"61o", "5Pe", "M9", "XX", "vt", "0UF", "4nh", "7Kj", "6TJ", "4ai", "0ZG", "yu", "WY", "B8", "4OE", "6zf", "5G5", "4Bu", "1iz", "Zi", 
-"0M", "0Ww", "4lY", "4y8", "6hB", "aW1", "0fO", "2Sl", "kQ", "0Hc", "47E", "6Fn", "aaL", "bDN", "0ES", "fa", "HM", "8bg", "4PQ", "4E0", 
-"4J1", "5Oq", "10W", "GL", "3oP", "0JR", "45t", "504", "6Io", "48D", "59", "dP", "3LL", "0iN", "5BA", "6gC", "4Lb", "6yA", "2Bo", "03D", 
-"o3", "zR", "6Wm", "4bN", "bUM", "a4G", "3j", "0TP", "87l", "YN", "4T3", "4AR", "4NS", "7kQ", "VO", "01u", "1Kp", "xc", "hfw", "54V", 
-"4mO", "6Xl", "uS", "0Va", "0xM", "2Mn", "62H", "4Cc", "0DI", "25b", "6JD", "5oF", "4QK", "6dh", "IW", "0je", "0gU", "o", "6iX", "5LZ", 
-"4rW", "4g6", "jK", "0Iy", "0Fx", "eJ", "4h7", "5mw", "4Sz", "6fY", "Kf", "0hT", "S7", "FV", "6ki", "5Nk", "44n", "6EE", "hz", "0KH", 
-"2p", "0UJ", "4nd", "7Kf", "61c", "5Pi", "M5", "XT", "Ud", "0vV", "4Mx", "5H8", "4v5", "4cT", "0Xz", "2mY", "0A", "1GZ", "4lU", "4y4", 
-"5G9", "4By", "0yW", "Ze", "WU", "B4", "4OI", "6zj", "6TF", "4ae", "0ZK", "yy", "kU", "0Hg", "47A", "6Fj", "6hF", "5MD", "0fK", "Ey", 
-"HI", "2K9", "4PU", "4E4", "6KZ", "5nX", "0EW", "fe", "id", "0JV", "45p", "500", "4J5", "5Ou", "0dz", "GH", "Jx", "0iJ", "4Rd", "6gG", 
-"6Ik", "5li", "q5", "dT", "o7", "zV", "6Wi", "4bJ", "4Lf", "6yE", "Tz", "0wH", "0zx", "YJ", "4T7", "4AV", "4oz", "6ZY", "3n", "0TT", 
-"1Kt", "xg", "6UX", "54R", "4NW", "7kU", "VK", "01q", "0xI", "2Mj", "62L", "4Cg", "4mK", "6Xh", "uW", "0Ve", "4QO", "6dl", "IS", "0ja", 
-"0DM", "25f", "7Za", "5oB", "4rS", "4g2", "jO", "9PD", "0gQ", "k", "aCN", "685", "674", "72t", "Kb", "0hP", "8Od", "eN", "4h3", "49Z", 
-"44j", "6EA", "3nN", "0KL", "S3", "FR", "6km", "5No", "61g", "5Pm", "M1", "XP", "2t", "0UN", "ad0", "7Kb", "429", "4cP", "8Qf", "39t", 
-"0c3", "02Z", "b3G", "aRM", "63V", "bxN", "0yS", "Za", "0E", "235", "4lQ", "4y0", "6TB", "4aa", "0ZO", "2ol", "WQ", "B0", "4OM", "6zn", 
-"4i4", "5lt", "1WZ", "dI", "Je", "0iW", "4Ry", "5W9", "6jj", "5Oh", "R4", "GU", "iy", "0JK", "45m", "6DF", "6KG", "5nE", "0EJ", "fx", 
-"HT", "0kf", "4PH", "6ek", "5X8", "5MY", "0fV", "Ed", "kH", "0Hz", "4sT", "4f5", "4mV", "4x7", "1B", "0Vx", "0xT", "0m5", "62Q", "4Cz", 
-"4NJ", "7kH", "VV", "C7", "1Ki", "xz", "6UE", "54O", "4og", "6ZD", "3s", "0TI", "L6", "YW", "6th", "4AK", "6l9", "6yX", "Tg", "0wU", 
-"0Yy", "zK", "4w6", "4bW", "11T", "FO", "4K2", "5Nr", "44w", "517", "hc", "0KQ", "p2", "eS", "6Hl", "49G", "4Sc", "72i", "3MO", "0hM", 
-"0gL", "v", "6iA", "5LC", "46F", "6Gm", "jR", "1YA", "0DP", "gb", "hyv", "bEM", "4QR", "4D3", "IN", "8cd", "WL", "00v", "4OP", "4Z1", 
-"hgt", "55U", "0ZR", "0O3", "0X", "a1", "4lL", "6Yo", "63K", "5RA", "0yN", "2Lm", "2Cl", "02G", "4Ma", "6xB", "6Vn", "4cM", "n0", "39i", 
-"2i", "0US", "bTN", "a5D", "4U0", "5Pp", "86o", "XM", "Ja", "0iS", "667", "73w", "4i0", "48Y", "8Ng", "dM", "3oM", "0JO", "45i", "6DB", 
-"6jn", "5Ol", "R0", "GQ", "HP", "0kb", "4PL", "6eo", "6KC", "5nA", "0EN", "24e", "kL", "8Af", "47X", "4f1", "aBM", "696", "0fR", "0s3", 
-"0xP", "0m1", "62U", "byM", "4mR", "4x3", "1F", "226", "1Km", "2no", "6UA", "54K", "4NN", "7kL", "VR", "C3", "L2", "YS", "60d", "4AO", 
-"4oc", "7Ja", "3w", "0TM", "8Pe", "zO", "4w2", "4bS", "b2D", "aSN", "Tc", "03Y", "44s", "513", "hg", "0KU", "0ey", "FK", "4K6", "5Nv", 
-"4Sg", "6fD", "3MK", "0hI", "p6", "eW", "6Hh", "49C", "46B", "6Gi", "jV", "0Id", "0gH", "r", "6iE", "5LG", "4QV", "4D7", "IJ", "0jx", 
-"0DT", "gf", "6JY", "bEI", "5d8", "4ax", "0ZV", "yd", "WH", "00r", "4OT", "4Z5", "63O", "4Bd", "0yJ", "Zx", "tT", "a5", "4lH", "6Yk", 
-"6Vj", "4cI", "n4", "2mD", "Uy", "02C", "4Me", "6xF", "4U4", "5Pt", "1kZ", "XI", "2m", "0UW", "4ny", "5k9", "6jb", "ber", "0do", "2QL", 
-"iq", "0JC", "45e", "6DN", "acl", "48U", "0Gs", "dA", "Jm", "94n", "4Rq", "5W1", "5X0", "5MQ", "12w", "El", "1M2", "0Hr", "47T", "alm", 
-"6KO", "5nM", "0EB", "fp", "3Nl", "0kn", "bjs", "6ec", "4NB", "aQs", "3Pn", "01d", "1Ka", "xr", "6UM", "54G", "59w", "a6g", "1J", "0Vp", 
-"85L", "d3D", "5F2", "4Cr", "4Ls", "5I3", "To", "03U", "0Yq", "zC", "436", "56v", "4oo", "6ZL", "ws", "0TA", "0zm", "2ON", "60h", "4AC", 
-"42", "27B", "6Hd", "49O", "4Sk", "6fH", "Kw", "0hE", "0eu", "FG", "6kx", "5Nz", "4pw", "5u7", "hk", "0KY", "0DX", "gj", "5z6", "5oW", 
-"4QZ", "6dy", "IF", "0jt", "0gD", "Dv", "6iI", "5LK", "46N", "6Ge", "jZ", "0Ih", "0P", "a9", "4lD", "6Yg", "63C", "4Bh", "0yF", "Zt", 
-"WD", "0tv", "4OX", "4Z9", "5d4", "4at", "0ZZ", "yh", "2a", "1Ez", "4nu", "5k5", "4U8", "5Px", "1kV", "XE", "Uu", "02O", "4Mi", "6xJ", 
-"6Vf", "4cE", "n8", "2mH", "iu", "0JG", "45a", "6DJ", "6jf", "5Od", "R8", "GY", "Ji", "1yz", "4Ru", "5W5", "4i8", "48Q", "0Gw", "dE", 
-"kD", "0Hv", "47P", "4f9", "5X4", "5MU", "0fZ", "Eh", "HX", "0kj", "4PD", "6eg", "6KK", "5nI", "0EF", "ft", "1Ke", "xv", "6UI", "54C", 
-"4NF", "7kD", "VZ", "0uh", "0xX", "0m9", "5F6", "4Cv", "4mZ", "6Xy", "1N", "0Vt", "0Yu", "zG", "432", "56r", "4Lw", "5I7", "Tk", "03Q", 
-"0zi", "2OJ", "60l", "4AG", "4ok", "6ZH", "ww", "0TE", "4So", "6fL", "Ks", "0hA", "46", "27F", "7XA", "49K", "4ps", "5u3", "ho", "8BE", 
-"0eq", "FC", "aAn", "bdl", "bkm", "70T", "IB", "0jp", "307", "gn", "5z2", "5oS", "46J", "6Ga", "28G", "0Il", "13i", "z", "6iM", "5LO", 
-"63G", "4Bl", "0yB", "Zp", "0T", "0Wn", "58i", "6Yc", "5d0", "4ap", "8SF", "yl", "1q2", "00z", "b1g", "aPm", "61v", "746", "1kR", "XA", 
-"2e", "9Lf", "4nq", "5k1", "6Vb", "4cA", "0Xo", "2mL", "Uq", "02K", "4Mm", "6xN", "8YG", "7e", "5n1", "4kq", "716", "64v", "2KP", "1nR", 
-"07K", "Pq", "69F", "4Hm", "4fA", "6Sb", "2hL", "1MN", "0Rn", "5T", "7LB", "5ya", "4Gl", "66G", "2Ia", "08J", "05z", "1t2", "aUm", "b4g", 
-"4dp", "5a0", "8d", "8VF", "bn", "357", "4zr", "6OQ", "75T", "bnm", "0op", "LB", "Ar", "16i", "4Yn", "6lM", "6Ba", "43J", "0Ll", "2yO", 
-"22F", "16", "4xC", "agr", "6cL", "4Vo", "0mA", "Ns", "CC", "14X", "bal", "aDn", "5p3", "4us", "8GE", "mo", "5L7", "4Iw", "06Q", "Qk", 
-"1Y5", "1LT", "53r", "462", "7Oi", "4jk", "0QE", "rw", "2JJ", "1oH", "4DG", "65l", "7nD", "4KF", "0ph", "SZ", "2kg", "1Ne", "4ej", "6PI", 
-"493", "4hZ", "0St", "4N", "0h9", "09P", "4Fv", "5C6", "4Xt", "6mW", "023", "0cZ", "0Mv", "nD", "4c9", "42P", "5kI", "6NK", "ct", "1Pg", 
-"X9", "MX", "74N", "4UD", "4ZE", "6of", "BY", "W8", "0OG", "lu", "6AJ", "40a", "4yY", "4l8", "aE", "0Bw", "18r", "Oi", "5R5", "4Wu", 
-"4EY", "4P8", "2KT", "1nV", "8YC", "7a", "5n5", "4ku", "4fE", "6Sf", "2hH", "k8", "07O", "Pu", "69B", "4Hi", "4Gh", "66C", "2Ie", "08N", 
-"d9", "5P", "7LF", "4iD", "4dt", "5a4", "2jy", "3o9", "0qv", "RD", "7oZ", "4JX", "6ay", "4TZ", "0ot", "LF", "bj", "0AX", "4zv", "6OU", 
-"6Be", "43N", "0Lh", "oZ", "Av", "0bD", "4Yj", "6lI", "6cH", "4Vk", "0mE", "Nw", "22B", "12", "4xG", "6Md", "5p7", "4uw", "0NY", "mk", 
-"CG", "1pT", "5Kz", "6nx", "1Y1", "1LP", "53v", "466", "5L3", "4Is", "06U", "Qo", "2JN", "1oL", "4DC", "65h", "7Om", "4jo", "0QA", "rs", 
-"9z", "1Na", "4en", "6PM", "aTs", "4KB", "04d", "2EO", "d6D", "09T", "4Fr", "5C2", "497", "bRm", "0Sp", "4J", "0Mr", "1H2", "aim", "42T", 
-"4Xp", "6mS", "027", "17w", "0nn", "3Kl", "74J", "5Ea", "5kM", "6NO", "cp", "1Pc", "0OC", "lq", "6AN", "40e", "4ZA", "6ob", "2TL", "0ao", 
-"18v", "Om", "5R1", "4Wq", "bCn", "afl", "aA", "0Bs", "07C", "Py", "69N", "4He", "4fI", "6Sj", "2hD", "k4", "0PW", "7m", "5n9", "4ky", 
-"4EU", "4P4", "2KX", "1nZ", "05r", "RH", "7oV", "4JT", "4dx", "5a8", "8l", "1Ow", "d5", "qT", "7LJ", "4iH", "4Gd", "66O", "2Ii", "08B", 
-"Az", "0bH", "4Yf", "6lE", "6Bi", "43B", "z7", "oV", "bf", "0AT", "4zz", "6OY", "4A7", "4TV", "0ox", "LJ", "CK", "14P", "5Kv", "4N6", 
-"543", "41s", "0NU", "mg", "22N", "u6", "4xK", "6Mh", "6cD", "4Vg", "0mI", "2Xj", "7Oa", "4jc", "0QM", "6w", "2JB", "I2", "4DO", "65d", 
-"68T", "b7D", "06Y", "Qc", "dSm", "287", "4gS", "4r2", "7MP", "4hR", "276", "4F", "0h1", "09X", "b8E", "67U", "7nL", "4KN", "F3", "SR", 
-"9v", "1Nm", "4eb", "6PA", "5kA", "6NC", "21e", "1Po", "X1", "MP", "74F", "4UL", "bbO", "79v", "0v3", "0cR", "8Df", "nL", "4c1", "42X", 
-"4yQ", "4l0", "aM", "8Kg", "0lS", "Oa", "76w", "637", "4ZM", "6on", "BQ", "W0", "0OO", "2zl", "6AB", "40i", "4fM", "6Sn", "3xa", "k0", 
-"07G", "2Fl", "69J", "4Ha", "4EQ", "4P0", "d5g", "83o", "0PS", "7i", "a0D", "bQN", "50U", "hbt", "8h", "1Os", "05v", "RL", "7oR", "4JP", 
-"5WA", "66K", "2Im", "08F", "d1", "5X", "7LN", "4iL", "6Bm", "43F", "z3", "oR", "2Wo", "0bL", "4Yb", "6lA", "4A3", "4TR", "8fd", "LN", 
-"bb", "0AP", "cPl", "aeO", "547", "41w", "0NQ", "mc", "CO", "14T", "5Kr", "4N2", "77i", "4Vc", "0mM", "2Xn", "22J", "u2", "4xO", "6Ml", 
-"2JF", "I6", "4DK", "6qh", "7Oe", "4jg", "0QI", "6s", "1Y9", "1LX", "4gW", "4r6", "68P", "5YZ", "0rU", "Qg", "0h5", "1mu", "4Fz", "67Q", 
-"7MT", "4hV", "0Sx", "4B", "9r", "1Ni", "4ef", "6PE", "7nH", "4KJ", "F7", "SV", "X5", "MT", "74B", "4UH", "5kE", "6NG", "cx", "1Pk", 
-"0Mz", "nH", "4c5", "4vT", "4Xx", "79r", "0v7", "0cV", "0lW", "Oe", "5R9", "4Wy", "4yU", "4l4", "aI", "1RZ", "0OK", "ly", "6AF", "40m", 
-"4ZI", "6oj", "BU", "W4", "265", "5E", "488", "4iQ", "b9F", "66V", "0i2", "1lr", "G0", "RQ", "7oO", "4JM", "4da", "6QB", "8u", "1On", 
-"0PN", "7t", "7Nb", "aa0", "4EL", "64g", "2KA", "H1", "07Z", "0f3", "69W", "b6G", "4fP", "479", "dRn", "294", "22W", "8Jd", "4xR", "4m3", 
-"77t", "624", "0mP", "Nb", "CR", "V3", "5Ko", "6nm", "ajS", "41j", "0NL", "3kN", "20f", "0AM", "4zc", "aeR", "6al", "4TO", "Y2", "LS", 
-"Ac", "0bQ", "bcL", "78u", "4b2", "4wS", "8Ee", "oO", "7nU", "4KW", "04q", "SK", "9o", "1Nt", "51R", "6PX", "7MI", "4hK", "e6", "pW", 
-"2Hj", "09A", "4Fg", "67L", "68M", "4If", "0rH", "Qz", "2iG", "j7", "4gJ", "6Ri", "7Ox", "4jz", "0QT", "6n", "1z8", "1oY", "4DV", "4Q7", 
-"4ZT", "4O5", "BH", "0az", "0OV", "ld", "550", "40p", "4yH", "6Lk", "aT", "t5", "0lJ", "Ox", "6bG", "4Wd", "4Xe", "6mF", "2Vh", "0cK", 
-"0Mg", "nU", "6Cj", "42A", "5kX", "6NZ", "ce", "1Pv", "2N9", "MI", "7pW", "4UU", "4Gy", "5B9", "0i6", "1lv", "1BZ", "5A", "7LW", "4iU", 
-"4de", "6QF", "8q", "1Oj", "G4", "RU", "7oK", "4JI", "4EH", "64c", "2KE", "H5", "0PJ", "7p", "7Nf", "4kd", "4fT", "4s5", "2hY", "290", 
-"0sV", "Pd", "5M8", "4Hx", "6cY", "4Vz", "0mT", "Nf", "1F8", "0Cx", "4xV", "4m7", "7Pd", "41n", "0NH", "mz", "CV", "V7", "5Kk", "6ni", 
-"6ah", "4TK", "Y6", "LW", "20b", "0AI", "4zg", "6OD", "4b6", "4wW", "0Ly", "oK", "Ag", "0bU", "5IZ", "6lX", "9k", "1Np", "51V", "azN", 
-"7nQ", "4KS", "04u", "SO", "2Hn", "09E", "4Fc", "67H", "7MM", "4hO", "e2", "pS", "2iC", "j3", "4gN", "6Rm", "68I", "4Ib", "06D", "2Go", 
-"d4d", "82l", "4DR", "4Q3", "a1G", "bPM", "0QP", "6j", "0OR", "0Z3", "554", "40t", "4ZP", "4O1", "BL", "15W", "0lN", "2Ym", "6bC", "5GA", 
-"4yL", "6Lo", "aP", "09", "0Mc", "nQ", "6Cn", "42E", "4Xa", "6mB", "2Vl", "0cO", "8gg", "MM", "7pS", "4UQ", "bAN", "adL", "ca", "1Pr", 
-"G8", "RY", "7oG", "4JE", "4di", "6QJ", "2jd", "1Of", "0Rw", "5M", "480", "4iY", "4Gu", "5B5", "2Ix", "08S", "07R", "Ph", "5M4", "4Ht", 
-"4fX", "471", "1X6", "1MW", "0PF", "st", "7Nj", "4kh", "4ED", "64o", "2KI", "H9", "CZ", "14A", "5Kg", "6ne", "7Ph", "41b", "0ND", "mv", 
-"1F4", "0Ct", "4xZ", "6My", "5S6", "4Vv", "0mX", "Nj", "Ak", "0bY", "4Yw", "6lT", "6Bx", "43S", "0Lu", "oG", "bw", "0AE", "4zk", "6OH", 
-"6ad", "4TG", "0oi", "2ZJ", "7MA", "4hC", "0Sm", "4W", "2Hb", "09I", "4Fo", "67D", "aTn", "b5d", "04y", "SC", "9g", "8WE", "4es", "6PP", 
-"5o2", "4jr", "8XD", "6f", "1z0", "1oQ", "705", "65u", "68E", "4In", "06H", "Qr", "2iO", "1LM", "4gB", "6Ra", "5ia", "6Lc", "23E", "05", 
-"0lB", "Op", "6bO", "4Wl", "c4F", "aEm", "1d2", "0ar", "8FF", "ll", "558", "40x", "5kP", "6NR", "cm", "344", "0ns", "MA", "74W", "bon", 
-"4Xm", "6mN", "3FA", "0cC", "0Mo", "2xL", "6Cb", "42I", "4dm", "6QN", "8y", "1Ob", "05g", "2DL", "7oC", "4JA", "4Gq", "5B1", "d7G", "08W", 
-"0Rs", "5I", "484", "bSn", "52u", "475", "1X2", "1MS", "07V", "Pl", "5M0", "4Hp", "5Ua", "64k", "2KM", "1nO", "0PB", "7x", "7Nn", "4kl", 
-"7Pl", "41f", "8GX", "mr", "2UO", "14E", "5Kc", "6na", "5S2", "4Vr", "19u", "Nn", "1F0", "0Cp", "bBm", "ago", "ahn", "43W", "0Lq", "oC", 
-"Ao", "16t", "4Ys", "6lP", "75I", "4TC", "0om", "2ZN", "bs", "0AA", "4zo", "6OL", "2Hf", "09M", "4Fk", "6sH", "7ME", "4hG", "0Si", "4S", 
-"9c", "1Nx", "4ew", "6PT", "7nY", "bqh", "0pu", "SG", "1z4", "1oU", "4DZ", "65q", "5o6", "4jv", "0QX", "6b", "2iK", "1LI", "4gF", "6Re", 
-"68A", "4Ij", "06L", "Qv", "0lF", "Ot", "6bK", "4Wh", "4yD", "6Lg", "aX", "01", "0OZ", "lh", "5q4", "4tt", "4ZX", "4O9", "BD", "0av", 
-"0nw", "ME", "74S", "4UY", "5kT", "6NV", "ci", "1Pz", "0Mk", "nY", "6Cf", "42M", "4Xi", "6mJ", "2Vd", "0cG", "bL", "8Hf", "4zP", "4o1", 
-"75v", "606", "0oR", "0z3", "AP", "T1", "4YL", "6lo", "6BC", "43h", "0LN", "2ym", "22d", "0CO", "4xa", "6MB", "6cn", "4VM", "0mc", "NQ", 
-"Ca", "14z", "baN", "aDL", "7PS", "41Y", "8Gg", "mM", "247", "7G", "7NQ", "4kS", "com", "64T", "0k0", "1np", "E2", "PS", "69d", "4HO", 
-"4fc", "7Ca", "2hn", "1Ml", "0RL", "5v", "avS", "4ib", "4GN", "66e", "2IC", "J3", "05X", "Rb", "aUO", "b4E", "4dR", "4q3", "8F", "8Vd", 
-"4XV", "4M7", "1f8", "0cx", "0MT", "nf", "572", "42r", "5kk", "6Ni", "cV", "v7", "0nH", "Mz", "74l", "4Uf", "4Zg", "6oD", "2Tj", "0aI", 
-"y6", "lW", "6Ah", "40C", "5iZ", "583", "ag", "0BU", "0ly", "OK", "4B6", "4WW", "7lW", "4IU", "06s", "QI", "0I6", "1Lv", "4gy", "5b9", 
-"7OK", "4jI", "g4", "rU", "2Jh", "1oj", "4De", "65N", "7nf", "4Kd", "04B", "Sx", "2kE", "h5", "4eH", "6Pk", "5m8", "4hx", "0SV", "4l", 
-"2HY", "09r", "4FT", "4S5", "5Q8", "4Tx", "0oV", "Ld", "bH", "0Az", "4zT", "4o5", "6BG", "43l", "0LJ", "ox", "AT", "T5", "4YH", "6lk", 
-"6cj", "4VI", "0mg", "NU", "2vh", "0CK", "4xe", "6MF", "7PW", "4uU", "2n9", "mI", "Ce", "1pv", "5KX", "6nZ", "5UZ", "64P", "0k4", "1nt", 
-"0Py", "7C", "7NU", "4kW", "4fg", "6SD", "2hj", "1Mh", "E6", "PW", "7mI", "4HK", "4GJ", "66a", "2IG", "J7", "0RH", "5r", "7Ld", "4if", 
-"4dV", "4q7", "8B", "1OY", "0qT", "Rf", "7ox", "4Jz", "0MP", "nb", "576", "42v", "4XR", "4M3", "dll", "17U", "0nL", "3KN", "74h", "4Ub", 
-"5ko", "6Nm", "cR", "v3", "y2", "lS", "6Al", "40G", "4Zc", "aER", "2Tn", "0aM", "18T", "OO", "4B2", "4WS", "bCL", "587", "ac", "0BQ", 
-"0I2", "1Lr", "53T", "axL", "68z", "4IQ", "06w", "QM", "2Jl", "1on", "4Da", "65J", "7OO", "4jM", "g0", "6Y", "9X", "h1", "4eL", "6Po", 
-"7nb", "aA0", "04F", "2Em", "d6f", "09v", "4FP", "4S1", "a3E", "bRO", "0SR", "4h", "AX", "T9", "4YD", "6lg", "6BK", "4wh", "0LF", "ot", 
-"bD", "0Av", "4zX", "4o9", "5Q4", "4Tt", "0oZ", "Lh", "Ci", "14r", "5KT", "6nV", "ajh", "41Q", "0Nw", "mE", "22l", "0CG", "4xi", "6MJ", 
-"6cf", "4VE", "0mk", "NY", "07a", "2FJ", "69l", "4HG", "4fk", "6SH", "2hf", "1Md", "0Pu", "7O", "7NY", "bQh", "4Ew", "6pT", "0k8", "1nx", 
-"05P", "Rj", "5O6", "4Jv", "4dZ", "453", "8N", "1OU", "0RD", "qv", "7Lh", "4ij", "4GF", "66m", "2IK", "1lI", "5kc", "6Na", "21G", "27", 
-"8gX", "Mr", "74d", "4Un", "bbm", "79T", "1f0", "0cp", "397", "nn", "5s2", "42z", "4ys", "6LP", "ao", "366", "0lq", "OC", "76U", "bml", 
-"4Zo", "6oL", "Bs", "0aA", "0Om", "2zN", "7QA", "40K", "7OC", "4jA", "0Qo", "6U", "3ZA", "1ob", "4Dm", "65F", "68v", "b7f", "0rs", "QA", 
-"dSO", "8UG", "4gq", "5b1", "5m0", "4hp", "8ZF", "4d", "1x2", "09z", "727", "67w", "7nn", "4Kl", "04J", "Sp", "9T", "1NO", "51i", "6Pc", 
-"6BO", "43d", "0LB", "op", "2WM", "0bn", "5Ia", "6lc", "5Q0", "4Tp", "8fF", "Ll", "1D2", "0Ar", "cPN", "aem", "ajl", "41U", "0Ns", "mA", 
-"Cm", "14v", "5KP", "6nR", "6cb", "4VA", "0mo", "2XL", "22h", "0CC", "4xm", "6MN", "4fo", "6SL", "2hb", "8TY", "07e", "2FN", "69h", "4HC", 
-"4Es", "64X", "d5E", "83M", "0Pq", "7K", "a0f", "bQl", "50w", "457", "8J", "1OQ", "05T", "Rn", "5O2", "4Jr", "4GB", "66i", "2IO", "08d", 
-"1Ba", "5z", "7Ll", "4in", "0nD", "Mv", "7ph", "4Uj", "5kg", "6Ne", "cZ", "23", "0MX", "nj", "5s6", "4vv", "4XZ", "6my", "1f4", "0ct", 
-"0lu", "OG", "6bx", "5Gz", "4yw", "6LT", "ak", "0BY", "0Oi", "2zJ", "6Ad", "40O", "4Zk", "6oH", "Bw", "0aE", "2Jd", "1of", "4Di", "65B", 
-"7OG", "4jE", "g8", "6Q", "2ix", "1Lz", "4gu", "5b5", "68r", "4IY", "0rw", "QE", "1x6", "1mW", "4FX", "4S9", "5m4", "4ht", "0SZ", "ph", 
-"9P", "h9", "4eD", "6Pg", "7nj", "4Kh", "04N", "St", "22u", "375", "4xp", "598", "77V", "blo", "0mr", "1h2", "Cp", "14k", "5KM", "6nO", 
-"7PB", "41H", "0Nn", "3kl", "20D", "34", "4zA", "6Ob", "6aN", "4Tm", "0oC", "Lq", "AA", "0bs", "bcn", "78W", "569", "43y", "384", "om", 
-"9Kd", "5g", "5l3", "4is", "734", "66t", "1y1", "08y", "05I", "Rs", "7om", "4Jo", "4dC", "7AA", "8W", "1OL", "0Pl", "7V", "ats", "4kB", 
-"4En", "64E", "2Kc", "1na", "07x", "PB", "69u", "b6e", "4fr", "5c2", "dRL", "8TD", "4Zv", "6oU", "Bj", "0aX", "0Ot", "lF", "6Ay", "40R", 
-"4yj", "6LI", "av", "0BD", "0lh", "OZ", "6be", "4WF", "4XG", "6md", "2VJ", "0ci", "0ME", "nw", "6CH", "42c", "5kz", "6Nx", "cG", "1PT", 
-"0nY", "Mk", "5P7", "4Uw", "5N5", "4Ku", "04S", "Si", "9M", "1NV", "4eY", "440", "7Mk", "4hi", "0SG", "pu", "2HH", "K8", "4FE", "67n", 
-"68o", "4ID", "1", "QX", "2ie", "1Lg", "4gh", "6RK", "7OZ", "4jX", "0Qv", "6L", "2Jy", "3O9", "4Dt", "5A4", "4C9", "4VX", "0mv", "ND", 
-"22q", "0CZ", "4xt", "6MW", "7PF", "41L", "x9", "mX", "Ct", "14o", "5KI", "6nK", "6aJ", "4Ti", "0oG", "Lu", "bY", "30", "4zE", "6Of", 
-"5r5", "4wu", "380", "oi", "AE", "0bw", "4YY", "4L8", "5Wz", "66p", "1y5", "1lT", "0RY", "5c", "5l7", "4iw", "4dG", "6Qd", "8S", "1OH", 
-"05M", "Rw", "7oi", "4Jk", "4Ej", "64A", "2Kg", "1ne", "0Ph", "7R", "7ND", "4kF", "4fv", "5c6", "0H9", "1My", "0st", "PF", "69q", "4HZ", 
-"0Op", "lB", "ako", "40V", "4Zr", "6oQ", "Bn", "15u", "0ll", "2YO", "6ba", "4WB", "4yn", "6LM", "ar", "1Ra", "0MA", "ns", "6CL", "42g", 
-"4XC", "79I", "2VN", "0cm", "8gE", "Mo", "5P3", "4Us", "bAl", "adn", "cC", "1PP", "9I", "1NR", "51t", "444", "5N1", "4Kq", "04W", "Sm", 
-"2HL", "09g", "4FA", "67j", "7Mo", "4hm", "0SC", "4y", "2ia", "1Lc", "4gl", "6RO", "68k", "5Ya", "5", "2GM", "d4F", "82N", "4Dp", "5A0", 
-"a1e", "bPo", "0Qr", "6H", "Cx", "14c", "5KE", "6nG", "7PJ", "4uH", "x5", "mT", "0V7", "0CV", "4xx", "590", "4C5", "4VT", "0mz", "NH", 
-"AI", "16R", "4YU", "4L4", "561", "43q", "0LW", "oe", "bU", "w4", "4zI", "6Oj", "6aF", "4Te", "0oK", "Ly", "05A", "2Dj", "7oe", "4Jg", 
-"4dK", "6Qh", "2jF", "i6", "0RU", "5o", "7Ly", "5yZ", "4GW", "4R6", "1y9", "08q", "07p", "PJ", "7mT", "4HV", "4fz", "6SY", "0H5", "1Mu", 
-"f7", "sV", "7NH", "4kJ", "4Ef", "64M", "2Kk", "1ni", "4yb", "6LA", "23g", "0BL", "Z3", "OR", "6bm", "4WN", "c4d", "aEO", "Bb", "0aP", 
-"8Fd", "lN", "4a3", "40Z", "5kr", "4n2", "cO", "8Ie", "0nQ", "Mc", "74u", "615", "4XO", "6ml", "2VB", "U2", "0MM", "2xn", "7Sa", "42k", 
-"7Mc", "4ha", "0SO", "4u", "3Xa", "K0", "4FM", "67f", "aTL", "b5F", "0pS", "Sa", "9E", "8Wg", "4eQ", "448", "7OR", "4jP", "254", "6D", 
-"0j3", "1os", "cnn", "65W", "68g", "4IL", "9", "QP", "2im", "1Lo", "53I", "6RC", "7PN", "41D", "x1", "mP", "2Um", "14g", "5KA", "6nC", 
-"4C1", "4VP", "19W", "NL", "0V3", "0CR", "bBO", "594", "565", "43u", "0LS", "oa", "AM", "16V", "4YQ", "4L0", "6aB", "4Ta", "0oO", "2Zl", 
-"bQ", "38", "4zM", "6On", "4dO", "6Ql", "2jB", "i2", "05E", "2Dn", "7oa", "4Jc", "4GS", "4R2", "d7e", "08u", "0RQ", "5k", "a2F", "bSL", 
-"52W", "ayO", "0H1", "1Mq", "07t", "PN", "69y", "4HR", "4Eb", "64I", "2Ko", "1nm", "f3", "7Z", "7NL", "4kN", "Z7", "OV", "6bi", "4WJ", 
-"4yf", "6LE", "az", "0BH", "0Ox", "lJ", "4a7", "4tV", "4Zz", "6oY", "Bf", "0aT", "0nU", "Mg", "74q", "5EZ", "5kv", "4n6", "cK", "1PX", 
-"0MI", "2xj", "6CD", "42o", "4XK", "6mh", "2VF", "U6", "2HD", "K4", "4FI", "67b", "7Mg", "4he", "0SK", "4q", "9A", "1NZ", "4eU", "4p4", 
-"5N9", "4Ky", "0pW", "Se", "0j7", "1ow", "4Dx", "5A8", "7OV", "4jT", "0Qz", "rH", "2ii", "1Lk", "4gd", "6RG", "68c", "4IH", "D5", "QT", 
-"5Ls", "4I3", "F", "13U", "0IP", "jb", "536", "46v", "5oo", "6Jm", "gR", "r3", "0jL", "3ON", "6dA", "4Qb", "5NB", "aAR", "2Pn", "0eM", 
-"0Ka", "hS", "6El", "44G", "49w", "abN", "ec", "0FQ", "8ae", "KO", "4F2", "4SS", "4X0", "4MQ", "02w", "UM", "0M2", "0XS", "57T", "a8D", 
-"7KO", "4nM", "c0", "2Y", "2Nl", "1kn", "aJ1", "61J", "6zC", "aE0", "00F", "2Am", "yP", "l1", "4aL", "6To", "a7E", "58U", "0WR", "0h", 
-"ZL", "84n", "4BP", "4W1", "fH", "0Ez", "5nu", "4k5", "5U8", "4Px", "0kV", "Hd", "ET", "P5", "5Mi", "6hk", "6FG", "47l", "0HJ", "kx", 
-"dy", "0GK", "48m", "6IF", "6gj", "4RI", "0ig", "JU", "Ge", "0dW", "5OX", "5Z9", "4d4", "4qU", "1ZZ", "iI", "0Ty", "3C", "4z6", "4oW", 
-"5QZ", "60P", "Yg", "0zU", "A6", "TW", "6yh", "4LK", "4bg", "6WD", "2lj", "0YI", "0VH", "1r", "6XE", "4mf", "4CJ", "62a", "2MG", "N7", 
-"0uT", "Vf", "7kx", "4Nz", "5pw", "4u7", "xJ", "1KY", "0IT", "jf", "532", "46r", "5Lw", "4I7", "B", "0gx", "0jH", "Iz", "6dE", "4Qf", 
-"5ok", "6Ji", "gV", "r7", "0Ke", "hW", "6Eh", "44C", "5NF", "6kD", "2Pj", "0eI", "0hy", "KK", "4F6", "4SW", "49s", "6HX", "eg", "0FU", 
-"0M6", "0XW", "4cy", "5f9", "4X4", "4MU", "02s", "UI", "Xy", "1kj", "5PD", "61N", "7KK", "4nI", "c4", "vU", "yT", "l5", "4aH", "6Tk", 
-"6zG", "4Od", "00B", "Wx", "ZH", "0yz", "4BT", "4W5", "5i8", "4lx", "0WV", "0l", "71v", "646", "0kR", "3NP", "fL", "8Lf", "5nq", "4k1", 
-"6FC", "47h", "0HN", "29e", "EP", "P1", "5Mm", "6ho", "6gn", "4RM", "0ic", "JQ", "26d", "0GO", "48i", "6IB", "4d0", "45Y", "8Cg", "iM", 
-"Ga", "0dS", "beN", "hYu", "ckm", "60T", "Yc", "0zQ", "207", "3G", "4z2", "4oS", "4bc", "7Ga", "2ln", "0YM", "A2", "TS", "6yl", "4LO", 
-"4CN", "62e", "2MC", "N3", "0VL", "1v", "6XA", "4mb", "5ps", "4u3", "xN", "8Rd", "01X", "Vb", "aQO", "b0E", "5og", "6Je", "gZ", "63", 
-"0jD", "Iv", "6dI", "4Qj", "7l9", "6iy", "N", "0gt", "0IX", "jj", "5w6", "4rv", "5mV", "5x7", "ek", "0FY", "0hu", "KG", "6fx", "5Cz", 
-"5NJ", "6kH", "Fw", "0eE", "92", "3nk", "6Ed", "44O", "7KG", "4nE", "c8", "2Q", "Xu", "1kf", "5PH", "61B", "4X8", "4MY", "0vw", "UE", 
-"2mx", "1Hz", "4cu", "5f5", "5i4", "4lt", "0WZ", "th", "ZD", "0yv", "4BX", "4W9", "6zK", "4Oh", "00N", "Wt", "yX", "l9", "4aD", "6Tg", 
-"2SM", "0fn", "5Ma", "6hc", "6FO", "47d", "0HB", "kp", "24Y", "0Er", "bDo", "aam", "5U0", "4Pp", "8bF", "Hl", "Gm", "10v", "5OP", "5Z1", 
-"anl", "45U", "0Js", "iA", "dq", "0GC", "48e", "6IN", "6gb", "4RA", "0io", "3Lm", "03e", "2BN", "7iA", "4LC", "4bo", "6WL", "zs", "0YA", 
-"0Tq", "3K", "a4f", "bUl", "4As", "5D3", "Yo", "87M", "01T", "Vn", "5K2", "4Nr", "54w", "417", "xB", "1KQ", "1Fa", "1z", "6XM", "4mn", 
-"4CB", "62i", "2MO", "0xl", "1za", "Ir", "6dM", "4Qn", "5oc", "6Ja", "25G", "67", "9Pe", "jn", "5w2", "46z", "bfm", "aCo", "J", "0gp", 
-"0hq", "KC", "72U", "bil", "5mR", "5x3", "eo", "326", "96", "3no", "7UA", "44K", "5NN", "6kL", "Fs", "0eA", "Xq", "1kb", "5PL", "61F", 
-"7KC", "4nA", "0Uo", "2U", "39U", "8QG", "4cq", "5f1", "aRl", "796", "0vs", "UA", "2LQ", "0yr", "767", "63w", "5i0", "4lp", "9Ng", "0d", 
-"2oM", "0Zn", "55i", "6Tc", "6zO", "4Ol", "00J", "Wp", "6FK", "4sh", "0HF", "kt", "EX", "P9", "5Me", "6hg", "5U4", "4Pt", "0kZ", "Hh", 
-"fD", "0Ev", "5ny", "4k9", "4d8", "45Q", "0Jw", "iE", "Gi", "10r", "5OT", "5Z5", "6gf", "4RE", "0ik", "JY", "du", "0GG", "48a", "6IJ", 
-"4bk", "6WH", "zw", "0YE", "03a", "2BJ", "6yd", "4LG", "4Aw", "5D7", "Yk", "0zY", "0Tu", "3O", "6Zx", "bUh", "54s", "413", "xF", "1KU", 
-"01P", "Vj", "5K6", "4Nv", "4CF", "62m", "2MK", "0xh", "0VD", "uv", "6XI", "4mj", "5NS", "6kQ", "Fn", "11u", "0Kp", "hB", "aoo", "44V", 
-"49f", "6HM", "er", "1Va", "0hl", "3Mn", "6fa", "4SB", "5Lb", "7yA", "W", "0gm", "0IA", "js", "6GL", "46g", "bEl", "hyW", "gC", "0Dq", 
-"8cE", "Io", "5T3", "4Qs", "5J1", "4Oq", "00W", "Wm", "yA", "0Zs", "55t", "404", "6YN", "4lm", "0WC", "0y", "2LL", "0yo", "4BA", "63j", 
-"6xc", "bws", "02f", "2CM", "2ma", "0XB", "4cl", "6VO", "a5e", "bTo", "0Ur", "2H", "Xl", "86N", "5PQ", "5E0", "dh", "0GZ", "5lU", "5y4", 
-"4G9", "4RX", "0iv", "JD", "Gt", "0dF", "5OI", "6jK", "6Dg", "45L", "81", "iX", "fY", "70", "5nd", "6Kf", "6eJ", "4Pi", "0kG", "Hu", 
-"EE", "0fw", "5Mx", "4H8", "5v5", "4su", "1Xz", "ki", "0VY", "1c", "5h7", "4mw", "5Sz", "62p", "2MV", "0xu", "01M", "Vw", "7ki", "4Nk", 
-"54n", "6Ud", "2nJ", "1KH", "0Th", "3R", "6Ze", "4oF", "4Aj", "60A", "Yv", "0zD", "0wt", "TF", "6yy", "4LZ", "4bv", "5g6", "zj", "0YX", 
-"0Kt", "hF", "6Ey", "44R", "5NW", "6kU", "Fj", "0eX", "0hh", "KZ", "6fe", "4SF", "49b", "6HI", "ev", "0FD", "0IE", "jw", "6GH", "46c", 
-"5Lf", "6id", "S", "0gi", "0jY", "Ik", "5T7", "4Qw", "5oz", "6Jx", "gG", "0Du", "yE", "0Zw", "4aY", "400", "5J5", "4Ou", "00S", "Wi", 
-"ZY", "O8", "4BE", "63n", "6YJ", "4li", "0WG", "tu", "2me", "0XF", "4ch", "6VK", "6xg", "4MD", "02b", "UX", "Xh", "3K9", "5PU", "5E4", 
-"7KZ", "4nX", "0Uv", "2L", "73V", "bho", "0ir", "1l2", "dl", "335", "48x", "5y0", "6Dc", "45H", "85", "3ol", "Gp", "0dB", "5OM", "6jO", 
-"6eN", "4Pm", "0kC", "Hq", "24D", "74", "bDr", "6Kb", "529", "47y", "8AG", "km", "EA", "0fs", "bgn", "aBl", "774", "62t", "199", "0xq", 
-"9Od", "1g", "5h3", "4ms", "54j", "7EA", "2nN", "1KL", "01I", "Vs", "7km", "4No", "4An", "60E", "Yr", "1ja", "0Tl", "3V", "6Za", "4oB", 
-"4br", "5g2", "zn", "8PD", "03x", "TB", "aSo", "785", "49n", "6HE", "ez", "0FH", "0hd", "KV", "6fi", "4SJ", "bdI", "6kY", "Ff", "0eT", 
-"0Kx", "hJ", "4e7", "4pV", "5ov", "4j6", "gK", "0Dy", "0jU", "Ig", "6dX", "5AZ", "5Lj", "6ih", "DW", "Q6", "0II", "28b", "6GD", "46o", 
-"6YF", "4le", "0WK", "0q", "ZU", "O4", "4BI", "63b", "5J9", "4Oy", "0tW", "We", "yI", "1JZ", "4aU", "4t4", "7KV", "4nT", "0Uz", "vH", 
-"Xd", "1kw", "5PY", "5E8", "6xk", "4MH", "02n", "UT", "2mi", "0XJ", "4cd", "6VG", "2Qm", "0dN", "5OA", "6jC", "6Do", "45D", "89", "iP", 
-"0R3", "0GR", "48t", "acM", "4G1", "4RP", "94O", "JL", "EM", "12V", "5Mp", "4H0", "525", "47u", "0HS", "ka", "fQ", "78", "5nl", "6Kn", 
-"6eB", "4Pa", "0kO", "3NM", "01E", "3PO", "7ka", "4Nc", "54f", "6Ul", "xS", "m2", "0VQ", "1k", "a6F", "59V", "4CS", "4V2", "195", "85m", 
-"03t", "TN", "4Y3", "4LR", "56W", "a9G", "zb", "0YP", "b3", "3Z", "6Zm", "4oN", "4Ab", "60I", "2Oo", "0zL", "1xA", "KR", "6fm", "4SN", 
-"49j", "6HA", "27g", "0FL", "8Bd", "hN", "4e3", "44Z", "bdM", "aAO", "Fb", "0eP", "0jQ", "Ic", "70u", "655", "5or", "4j2", "gO", "8Me", 
-"0IM", "28f", "7Wa", "46k", "5Ln", "6il", "DS", "Q2", "ZQ", "O0", "4BM", "63f", "6YB", "4la", "0WO", "0u", "yM", "8Sg", "4aQ", "408", 
-"aPL", "b1F", "0tS", "Wa", "0n3", "1ks", "bzO", "61W", "7KR", "4nP", "214", "2D", "2mm", "0XN", "57I", "6VC", "6xo", "4ML", "02j", "UP", 
-"6Dk", "4qH", "0Jf", "iT", "Gx", "0dJ", "5OE", "6jG", "4G5", "4RT", "0iz", "JH", "dd", "0GV", "48p", "5y8", "521", "47q", "0HW", "ke", 
-"EI", "12R", "5Mt", "4H4", "6eF", "4Pe", "0kK", "Hy", "fU", "s4", "5nh", "6Kj", "54b", "6Uh", "xW", "m6", "01A", "3PK", "7ke", "4Ng", 
-"4CW", "4V6", "191", "0xy", "0VU", "1o", "6XX", "59R", "4bz", "6WY", "zf", "0YT", "03p", "TJ", "4Y7", "4LV", "4Af", "60M", "Yz", "0zH", 
-"b7", "wV", "6Zi", "4oJ", "5H3", "4Ms", "02U", "Uo", "2mR", "0Xq", "57v", "426", "7Km", "4no", "0UA", "vs", "2NN", "1kL", "5Pb", "61h", 
-"6za", "4OB", "00d", "2AO", "yr", "1Ja", "4an", "6TM", "a7g", "58w", "0Wp", "0J", "Zn", "84L", "4Br", "5G2", "5LQ", "5Y0", "d", "13w", 
-"0Ir", "1L2", "amm", "46T", "5oM", "6JO", "gp", "0DB", "0jn", "3Ol", "6dc", "5Aa", "bdr", "6kb", "2PL", "0eo", "0KC", "hq", "6EN", "44e", 
-"49U", "abl", "eA", "0Fs", "8aG", "Km", "5V1", "4Sq", "1Dz", "3a", "5j5", "4ou", "4AY", "4T8", "YE", "0zw", "03O", "Tu", "6yJ", "4Li", 
-"4bE", "6Wf", "zY", "o8", "0Vj", "1P", "6Xg", "4mD", "4Ch", "62C", "2Me", "0xF", "0uv", "VD", "7kZ", "4NX", "5pU", "5e4", "xh", "3k9", 
-"fj", "0EX", "5nW", "6KU", "6ey", "4PZ", "0kt", "HF", "Ev", "0fD", "5MK", "6hI", "6Fe", "47N", "0Hh", "kZ", "26B", "52", "48O", "6Id", 
-"6gH", "4Rk", "0iE", "Jw", "GG", "0du", "5Oz", "6jx", "5t7", "4qw", "0JY", "ik", "2mV", "0Xu", "57r", "422", "5H7", "4Mw", "02Q", "Uk", 
-"2NJ", "1kH", "5Pf", "61l", "7Ki", "4nk", "0UE", "vw", "yv", "0ZD", "4aj", "6TI", "6ze", "4OF", "0th", "WZ", "Zj", "0yX", "4Bv", "5G6", 
-"6Yy", "4lZ", "0Wt", "0N", "0Iv", "jD", "4g9", "46P", "5LU", "5Y4", "Dh", "0gZ", "0jj", "IX", "6dg", "4QD", "5oI", "6JK", "gt", "0DF", 
-"0KG", "hu", "6EJ", "44a", "5Nd", "6kf", "FY", "S8", "1xz", "Ki", "5V5", "4Su", "49Q", "4h8", "eE", "0Fw", "756", "60v", "YA", "0zs", 
-"9Mf", "3e", "5j1", "4oq", "4bA", "6Wb", "2lL", "0Yo", "03K", "Tq", "6yN", "4Lm", "4Cl", "62G", "2Ma", "0xB", "0Vn", "1T", "6Xc", "59i", 
-"54Y", "5e0", "xl", "8RF", "01z", "1p2", "aQm", "b0g", "71T", "bjm", "0kp", "HB", "fn", "317", "5nS", "6KQ", "6Fa", "47J", "0Hl", "29G", 
-"Er", "12i", "5MO", "6hM", "6gL", "4Ro", "0iA", "Js", "26F", "56", "48K", "7YA", "5t3", "4qs", "8CE", "io", "GC", "0dq", "bel", "hYW", 
-"7Ke", "4ng", "0UI", "2s", "XW", "M6", "5Pj", "6uh", "6xX", "6m9", "0vU", "Ug", "2mZ", "0Xy", "4cW", "4v6", "4y7", "4lV", "0Wx", "0B", 
-"Zf", "0yT", "4Bz", "63Q", "6zi", "4OJ", "B7", "WV", "yz", "0ZH", "4af", "6TE", "5oE", "6JG", "gx", "0DJ", "0jf", "IT", "6dk", "4QH", 
-"5LY", "5Y8", "l", "0gV", "0Iz", "jH", "4g5", "4rT", "5mt", "4h4", "eI", "1VZ", "0hW", "Ke", "5V9", "4Sy", "5Nh", "6kj", "FU", "S4", 
-"0KK", "hy", "6EF", "44m", "03G", "2Bl", "6yB", "4La", "4bM", "6Wn", "zQ", "o0", "0TS", "3i", "a4D", "bUN", "4AQ", "4T0", "YM", "87o", 
-"01v", "VL", "7kR", "4NP", "54U", "hft", "0N3", "1Ks", "0Vb", "1X", "6Xo", "4mL", "5SA", "62K", "2Mm", "0xN", "2So", "0fL", "5MC", "6hA", 
-"6Fm", "47F", "1XA", "kR", "fb", "0EP", "bDM", "aaO", "4E3", "4PR", "8bd", "HN", "GO", "10T", "5Or", "4J2", "507", "45w", "0JQ", "ic", 
-"dS", "q2", "48G", "6Il", "73i", "4Rc", "0iM", "3LO", "XS", "M2", "5Pn", "61d", "7Ka", "4nc", "0UM", "2w", "39w", "8Qe", "4cS", "4v2", 
-"aRN", "b3D", "02Y", "Uc", "Zb", "0yP", "bxM", "63U", "4y3", "4lR", "236", "0F", "2oo", "0ZL", "4ab", "6TA", "6zm", "4ON", "B3", "WR", 
-"0jb", "IP", "6do", "4QL", "5oA", "6JC", "25e", "0DN", "9PG", "jL", "4g1", "46X", "686", "aCM", "h", "0gR", "0hS", "Ka", "72w", "677", 
-"49Y", "4h0", "eM", "8Og", "0KO", "3nM", "6EB", "44i", "5Nl", "6kn", "FQ", "S0", "4bI", "6Wj", "zU", "o4", "03C", "Ty", "6yF", "4Le", 
-"4AU", "4T4", "YI", "1jZ", "0TW", "3m", "5j9", "4oy", "54Q", "5e8", "xd", "1Kw", "01r", "VH", "7kV", "4NT", "4Cd", "62O", "2Mi", "0xJ", 
-"0Vf", "uT", "6Xk", "4mH", "6Fi", "47B", "0Hd", "kV", "Ez", "0fH", "5MG", "6hE", "4E7", "4PV", "0kx", "HJ", "ff", "0ET", "bDI", "6KY", 
-"503", "45s", "0JU", "ig", "GK", "0dy", "5Ov", "4J6", "6gD", "4Rg", "0iI", "3LK", "dW", "q6", "48C", "6Ih", "4Z2", "4OS", "00u", "WO", 
-"yc", "0ZQ", "55V", "hgw", "6Yl", "4lO", "a2", "tS", "2Ln", "0yM", "4Bc", "63H", "6xA", "4Mb", "02D", "2Co", "2mC", "n3", "4cN", "6Vm", 
-"a5G", "bTM", "0UP", "2j", "XN", "86l", "5Ps", "4U3", "5Nq", "4K1", "FL", "11W", "0KR", "3nP", "514", "44t", "49D", "6Ho", "eP", "49", 
-"0hN", "3ML", "6fC", "5CA", "aV1", "6iB", "u", "0gO", "0Ic", "jQ", "6Gn", "46E", "bEN", "hyu", "ga", "0DS", "8cg", "IM", "4D0", "4QQ", 
-"1FZ", "1A", "4x4", "4mU", "4Cy", "5F9", "0m6", "0xW", "C4", "VU", "7kK", "4NI", "54L", "6UF", "xy", "1Kj", "0TJ", "3p", "6ZG", "4od", 
-"4AH", "60c", "YT", "L5", "0wV", "Td", "5I8", "4Lx", "4bT", "4w5", "zH", "0Yz", "dJ", "0Gx", "5lw", "4i7", "6gY", "4Rz", "0iT", "Jf", 
-"GV", "R7", "5Ok", "6ji", "6DE", "45n", "0JH", "iz", "24b", "0EI", "5nF", "6KD", "6eh", "4PK", "0ke", "HW", "Eg", "0fU", "5MZ", "6hX", 
-"4f6", "4sW", "0Hy", "kK", "yg", "0ZU", "55R", "6TX", "4Z6", "4OW", "00q", "WK", "2Lj", "0yI", "4Bg", "63L", "6Yh", "4lK", "a6", "tW", 
-"2mG", "n7", "4cJ", "6Vi", "6xE", "4Mf", "0vH", "Uz", "XJ", "1kY", "5Pw", "4U7", "7Kx", "4nz", "0UT", "2n", "0KV", "hd", "510", "44p", 
-"5Nu", "4K5", "FH", "0ez", "0hJ", "Kx", "6fG", "4Sd", "5mi", "6Hk", "eT", "p5", "0Ig", "jU", "6Gj", "46A", "5LD", "6iF", "q", "0gK", 
-"1zZ", "II", "4D4", "4QU", "5oX", "5z9", "ge", "0DW", "byN", "62V", "0m2", "0xS", "225", "1E", "4x0", "4mQ", "54H", "6UB", "2nl", "1Kn", 
-"C0", "VQ", "7kO", "4NM", "4AL", "60g", "YP", "L1", "0TN", "3t", "6ZC", "ae0", "4bP", "439", "zL", "8Pf", "03Z", "0b3", "aSM", "b2G", 
-"73t", "664", "0iP", "Jb", "dN", "8Nd", "48Z", "4i3", "6DA", "45j", "0JL", "3oN", "GR", "R3", "5Oo", "6jm", "6el", "4PO", "0ka", "HS", 
-"24f", "0EM", "5nB", "aaR", "4f2", "4sS", "8Ae", "kO", "Ec", "0fQ", "695", "aBN", "6Yd", "4lG", "0Wi", "0S", "Zw", "0yE", "4Bk", "6wH", 
-"6zx", "buh", "0tu", "WG", "yk", "0ZY", "4aw", "5d7", "5k6", "4nv", "0UX", "2b", "XF", "1kU", "741", "61q", "6xI", "4Mj", "02L", "Uv", 
-"2mK", "0Xh", "4cF", "6Ve", "49L", "6Hg", "eX", "41", "0hF", "Kt", "6fK", "4Sh", "5Ny", "4K9", "FD", "0ev", "0KZ", "hh", "5u4", "4pt", 
-"5oT", "5z5", "gi", "1Tz", "0jw", "IE", "4D8", "4QY", "5LH", "6iJ", "Du", "0gG", "0Ik", "jY", "6Gf", "46M", "01g", "3Pm", "7kC", "4NA", 
-"54D", "6UN", "xq", "1Kb", "0Vs", "1I", "a6d", "59t", "4Cq", "5F1", "d3G", "85O", "03V", "Tl", "5I0", "4Lp", "56u", "435", "2lQ", "0Yr", 
-"0TB", "3x", "6ZO", "4ol", "5Qa", "60k", "2OM", "0zn", "2QO", "0dl", "5Oc", "6ja", "6DM", "45f", "1Za", "ir", "dB", "0Gp", "48V", "aco", 
-"5W2", "4Rr", "94m", "Jn", "Eo", "12t", "5MR", "5X3", "aln", "47W", "0Hq", "kC", "fs", "0EA", "5nN", "6KL", "71I", "4PC", "0km", "3No", 
-"Zs", "0yA", "4Bo", "63D", "7IA", "4lC", "0Wm", "0W", "yo", "8SE", "4as", "5d3", "aPn", "b1d", "00y", "WC", "XB", "1kQ", "745", "61u", 
-"5k2", "4nr", "9Le", "2f", "2mO", "0Xl", "4cB", "6Va", "6xM", "4Mn", "02H", "Ur", "0hB", "Kp", "6fO", "4Sl", "49H", "6Hc", "27E", "45", 
-"8BF", "hl", "518", "44x", "bdo", "aAm", "2PQ", "0er", "0js", "IA", "70W", "bkn", "5oP", "5z1", "gm", "304", "0Io", "28D", "6Gb", "46I", 
-"5LL", "6iN", "y", "0gC", "5pH", "6UJ", "xu", "1Kf", "C8", "VY", "7kG", "4NE", "4Cu", "5F5", "2Mx", "1hz", "0Vw", "1M", "4x8", "4mY", 
-"4bX", "431", "zD", "0Yv", "03R", "Th", "5I4", "4Lt", "4AD", "60o", "YX", "L9", "0TF", "wt", "6ZK", "4oh", "6DI", "45b", "0JD", "iv", 
-"GZ", "0dh", "5Og", "6je", "5W6", "4Rv", "0iX", "Jj", "dF", "0Gt", "48R", "6Iy", "6Fx", "47S", "0Hu", "kG", "Ek", "0fY", "5MV", "5X7", 
-"6ed", "4PG", "0ki", "3Nk", "fw", "0EE", "5nJ", "6KH", "356", "bo", "6OP", "4zs", "bnl", "75U", "LC", "0oq", "0bA", "As", "6lL", "4Yo", 
-"43K", "7RA", "2yN", "0Lm", "17", "22G", "6Ma", "4xB", "4Vn", "6cM", "Nr", "19i", "14Y", "CB", "aDo", "bam", "41z", "5p2", "mn", "8GD", 
-"7d", "8YF", "4kp", "5n0", "64w", "717", "1nS", "2KQ", "Pp", "07J", "4Hl", "69G", "6Sc", "52i", "1MO", "2hM", "5U", "0Ro", "4iA", "7LC", 
-"66F", "4Gm", "08K", "3YA", "RA", "0qs", "b4f", "aUl", "5a1", "4dq", "8VG", "8e", "6mV", "4Xu", "17r", "022", "nE", "0Mw", "42Q", "4c8", 
-"6NJ", "5kH", "1Pf", "cu", "MY", "X8", "4UE", "74O", "6og", "4ZD", "W9", "BX", "lt", "0OF", "4th", "6AK", "4l9", "4yX", "0Bv", "aD", 
-"Oh", "0lZ", "4Wt", "5R4", "4Iv", "5L6", "Qj", "06P", "1LU", "1Y4", "463", "4gZ", "4jj", "7Oh", "rv", "0QD", "1oI", "2JK", "65m", "4DF", 
-"4KG", "7nE", "2EJ", "04a", "1Nd", "2kf", "6PH", "4ek", "5xz", "492", "4O", "0Su", "09Q", "0h8", "5C7", "4Fw", "5Dz", "6ax", "LG", "0ou", 
-"0AY", "bk", "6OT", "4zw", "43O", "6Bd", "2yJ", "0Li", "0bE", "Aw", "6lH", "4Yk", "4Vj", "6cI", "Nv", "0mD", "13", "22C", "6Me", "4xF", 
-"4uv", "5p6", "mj", "0NX", "1pU", "CF", "6ny", "7k9", "4P9", "4EX", "1nW", "2KU", "sh", "0PZ", "4kt", "5n4", "6Sg", "4fD", "k9", "2hI", 
-"Pt", "07N", "4Hh", "69C", "66B", "4Gi", "08O", "2Id", "5Q", "d8", "4iE", "7LG", "5a5", "4du", "1Oz", "8a", "RE", "0qw", "4JY", "aUh", 
-"nA", "0Ms", "42U", "ail", "6mR", "4Xq", "17v", "026", "3Km", "0no", "4UA", "74K", "6NN", "5kL", "1Pb", "cq", "lp", "0OB", "40d", "6AO", 
-"6oc", "5Ja", "0an", "2TM", "Ol", "18w", "4Wp", "5R0", "afm", "bCo", "0Br", "1G2", "1LQ", "1Y0", "467", "53w", "4Ir", "5L2", "Qn", "06T", 
-"1oM", "2JO", "65i", "4DB", "4jn", "7Ol", "6z", "1Aa", "8WY", "2kb", "6PL", "4eo", "4KC", "7nA", "2EN", "04e", "09U", "d6E", "5C3", "4Fs", 
-"bRl", "496", "4K", "0Sq", "0bI", "2Wj", "6lD", "4Yg", "43C", "6Bh", "oW", "z6", "0AU", "bg", "6OX", "5jZ", "4TW", "4A6", "LK", "0oy", 
-"14Q", "CJ", "4N7", "5Kw", "41r", "542", "mf", "0NT", "u7", "22O", "6Mi", "4xJ", "4Vf", "6cE", "Nz", "0mH", "Px", "07B", "4Hd", "69O", 
-"6Sk", "4fH", "k5", "2hE", "7l", "0PV", "4kx", "5n8", "4P5", "4ET", "83j", "2KY", "RI", "05s", "4JU", "7oW", "5a9", "4dy", "1Ov", "8m", 
-"qU", "d4", "4iI", "7LK", "66N", "4Ge", "08C", "2Ih", "6NB", "a59", "1Pn", "21d", "MQ", "X0", "4UM", "74G", "79w", "bbN", "0cS", "0v2", 
-"nM", "8Dg", "42Y", "4c0", "4l1", "4yP", "8Kf", "aL", "0y3", "0lR", "636", "76v", "6oo", "4ZL", "W1", "BP", "2zm", "0ON", "40h", "6AC", 
-"4jb", "auS", "6v", "0QL", "I3", "2JC", "65e", "4DN", "b7E", "68U", "Qb", "06X", "286", "dSl", "4r3", "4gR", "4hS", "7MQ", "4G", "277", 
-"09Y", "0h0", "67T", "b8D", "4KO", "7nM", "SS", "F2", "1Nl", "9w", "azR", "4ec", "43G", "6Bl", "oS", "z2", "0bM", "2Wn", "78i", "4Yc", 
-"4TS", "4A2", "LO", "8fe", "0AQ", "bc", "aeN", "cPm", "41v", "546", "mb", "0NP", "14U", "CN", "4N3", "5Ks", "4Vb", "6cA", "2Xo", "0mL", 
-"u3", "22K", "6Mm", "4xN", "6So", "4fL", "k1", "2hA", "2Fm", "07F", "5XA", "69K", "4P1", "4EP", "83n", "d5f", "7h", "0PR", "bQO", "a0E", 
-"hbu", "50T", "1Or", "8i", "RM", "05w", "4JQ", "7oS", "66J", "4Ga", "08G", "2Il", "5Y", "d0", "4iM", "7LO", "MU", "X4", "4UI", "74C", 
-"6NF", "5kD", "1Pj", "cy", "nI", "2m9", "4vU", "4c4", "6mZ", "4Xy", "0cW", "0v6", "Od", "0lV", "4Wx", "5R8", "4l5", "4yT", "0Bz", "aH", 
-"lx", "0OJ", "40l", "6AG", "6ok", "4ZH", "W5", "BT", "I7", "2JG", "65a", "4DJ", "4jf", "7Od", "6r", "0QH", "1LY", "1Y8", "4r7", "4gV", 
-"4Iz", "68Q", "Qf", "0rT", "1mt", "0h4", "67P", "5VZ", "4hW", "7MU", "4C", "0Sy", "1Nh", "9s", "6PD", "4eg", "4KK", "7nI", "SW", "F6", 
-"8Je", "22V", "4m2", "4xS", "625", "77u", "Nc", "0mQ", "V2", "CS", "6nl", "5Kn", "41k", "7Pa", "3kO", "0NM", "0AL", "20g", "6OA", "4zb", 
-"4TN", "6am", "LR", "Y3", "0bP", "Ab", "78t", "bcM", "43Z", "4b3", "oN", "8Ed", "5D", "264", "4iP", "489", "66W", "b9G", "08Z", "0i3", 
-"RP", "G1", "4JL", "7oN", "6QC", "50I", "1Oo", "8t", "7u", "0PO", "4ka", "7Nc", "64f", "4EM", "H0", "963", "Pa", "0sS", "b6F", "69V", 
-"478", "4fQ", "295", "dRo", "4O4", "4ZU", "15R", "BI", "le", "0OW", "40q", "551", "6Lj", "4yI", "t4", "aU", "Oy", "0lK", "4We", "6bF", 
-"6mG", "4Xd", "0cJ", "2Vi", "nT", "0Mf", "4vH", "6Ck", "adI", "5kY", "1Pw", "cd", "MH", "0nz", "4UT", "7pV", "4KV", "7nT", "SJ", "04p", 
-"1Nu", "9n", "6PY", "4ez", "4hJ", "7MH", "pV", "e7", "1mi", "2Hk", "67M", "4Ff", "4Ig", "68L", "2Gj", "06A", "j6", "2iF", "6Rh", "4gK", 
-"5zZ", "7Oy", "6o", "0QU", "1oX", "1z9", "4Q6", "4DW", "5FZ", "6cX", "Ng", "0mU", "0Cy", "1F9", "4m6", "4xW", "41o", "7Pe", "3kK", "0NI", 
-"V6", "CW", "6nh", "5Kj", "4TJ", "6ai", "LV", "Y7", "0AH", "bz", "6OE", "4zf", "4wV", "4b7", "oJ", "0Lx", "0bT", "Af", "6lY", "4Yz", 
-"5B8", "4Gx", "1lw", "0i7", "qH", "0Rz", "4iT", "7LV", "6QG", "4dd", "1Ok", "8p", "RT", "G5", "4JH", "7oJ", "64b", "4EI", "H4", "2KD", 
-"7q", "0PK", "4ke", "7Ng", "4s4", "4fU", "1MZ", "2hX", "Pe", "0sW", "4Hy", "5M9", "la", "0OS", "40u", "555", "4O0", "4ZQ", "15V", "BM", 
-"2Yl", "0lO", "4Wa", "6bB", "6Ln", "4yM", "08", "aQ", "nP", "0Mb", "42D", "6Co", "6mC", "5HA", "0cN", "2Vm", "ML", "8gf", "4UP", "74Z", 
-"adM", "bAO", "1Ps", "0U3", "1Nq", "9j", "azO", "51W", "4KR", "7nP", "SN", "04t", "09D", "2Ho", "67I", "4Fb", "4hN", "7ML", "4Z", "e3", 
-"j2", "2iB", "6Rl", "4gO", "4Ic", "68H", "2Gn", "06E", "82m", "d4e", "4Q2", "4DS", "bPL", "a1F", "6k", "0QQ", "1pH", "2UJ", "6nd", "5Kf", 
-"41c", "7Pi", "mw", "0NE", "0Cu", "1F5", "6Mx", "5hz", "4Vw", "5S7", "Nk", "0mY", "0bX", "Aj", "6lU", "4Yv", "43R", "6By", "oF", "0Lt", 
-"0AD", "bv", "6OI", "4zj", "4TF", "6ae", "LZ", "0oh", "RX", "G9", "4JD", "7oF", "6QK", "4dh", "1Og", "2je", "5L", "0Rv", "4iX", "481", 
-"5B4", "4Gt", "08R", "2Iy", "Pi", "07S", "4Hu", "5M5", "470", "4fY", "1MV", "1X7", "su", "0PG", "4ki", "7Nk", "64n", "4EE", "H8", "2KH", 
-"6Lb", "4yA", "04", "23D", "Oq", "0lC", "4Wm", "6bN", "aEl", "c4G", "0as", "BA", "lm", "8FG", "40y", "559", "6NS", "5kQ", "345", "cl", 
-"1k2", "0nr", "boo", "74V", "6mO", "4Xl", "0cB", "2Va", "2xM", "0Mn", "42H", "6Cc", "4hB", "aws", "4V", "0Sl", "09H", "2Hc", "67E", "4Fn", 
-"b5e", "aTo", "SB", "04x", "8WD", "9f", "6PQ", "4er", "4js", "5o3", "6g", "8XE", "1oP", "1z1", "65t", "704", "4Io", "68D", "Qs", "06I", 
-"1LL", "2iN", "7BA", "4gC", "41g", "7Pm", "ms", "0NA", "14D", "2UN", "aDr", "5Kb", "4Vs", "5S3", "No", "19t", "0Cq", "1F1", "agn", "bBl", 
-"43V", "aho", "oB", "0Lp", "16u", "An", "6lQ", "4Yr", "4TB", "6aa", "2ZO", "0ol", "1Qa", "br", "6OM", "4zn", "6QO", "4dl", "1Oc", "8x", 
-"2DM", "05f", "5Za", "7oB", "5B0", "4Gp", "08V", "d7F", "5H", "0Rr", "bSo", "485", "474", "52t", "1MR", "1X3", "Pm", "07W", "4Hq", "5M1", 
-"64j", "4EA", "1nN", "2KL", "7y", "0PC", "4km", "7No", "Ou", "0lG", "4Wi", "6bJ", "6Lf", "4yE", "00", "aY", "li", "8FC", "4tu", "5q5", 
-"4O8", "4ZY", "0aw", "BE", "MD", "0nv", "4UX", "74R", "6NW", "5kU", "341", "ch", "nX", "0Mj", "42L", "6Cg", "6mK", "4Xh", "0cF", "2Ve", 
-"09L", "2Hg", "67A", "4Fj", "4hF", "7MD", "4R", "0Sh", "1Ny", "9b", "6PU", "4ev", "4KZ", "7nX", "SF", "0pt", "1oT", "1z5", "65p", "5Tz", 
-"4jw", "5o7", "6c", "0QY", "1LH", "2iJ", "6Rd", "4gG", "4Ik", "7li", "Qw", "06M", "7F", "246", "4kR", "7NP", "64U", "col", "1nq", "0k1", 
-"PR", "E3", "4HN", "69e", "6SA", "4fb", "1Mm", "2ho", "5w", "0RM", "4ic", "7La", "66d", "4GO", "J2", "2IB", "Rc", "05Y", "b4D", "aUN", 
-"4q2", "4dS", "8Ve", "8G", "8Hg", "bM", "4o0", "4zQ", "607", "75w", "La", "0oS", "T0", "AQ", "6ln", "4YM", "43i", "6BB", "2yl", "0LO", 
-"0CN", "22e", "6MC", "5hA", "4VL", "6co", "NP", "0mb", "1ps", "0u3", "aDM", "baO", "41X", "7PR", "mL", "8Gf", "4IT", "7lV", "QH", "06r", 
-"1Lw", "0I7", "5b8", "4gx", "4jH", "7OJ", "rT", "g5", "1ok", "2Ji", "65O", "4Dd", "4Ke", "7ng", "Sy", "04C", "h4", "2kD", "6Pj", "4eI", 
-"4hy", "5m9", "4m", "0SW", "09s", "2HX", "4S4", "4FU", "4M6", "4XW", "0cy", "1f9", "ng", "0MU", "42s", "573", "6Nh", "5kj", "v6", "cW", 
-"3KK", "0nI", "4Ug", "74m", "6oE", "4Zf", "0aH", "Bz", "lV", "y7", "40B", "6Ai", "582", "4yz", "0BT", "af", "OJ", "0lx", "4WV", "4B7", 
-"64Q", "4Ez", "1nu", "0k5", "7B", "0Px", "4kV", "7NT", "6SE", "4ff", "1Mi", "2hk", "PV", "E7", "4HJ", "69a", "6rh", "4GK", "J6", "2IF", 
-"5s", "0RI", "4ig", "7Le", "4q6", "4dW", "1OX", "8C", "Rg", "0qU", "5ZZ", "7oy", "4Ty", "5Q9", "Le", "0oW", "1QZ", "bI", "4o4", "4zU", 
-"43m", "6BF", "oy", "0LK", "T4", "AU", "6lj", "4YI", "4VH", "6ck", "NT", "0mf", "0CJ", "22a", "6MG", "4xd", "4uT", "7PV", "mH", "0Nz", 
-"1pw", "Cd", "aDI", "5KY", "1Ls", "0I3", "axM", "53U", "4IP", "7lR", "QL", "06v", "1oo", "2Jm", "65K", "5TA", "4jL", "7ON", "6X", "g1", 
-"h0", "9Y", "6Pn", "4eM", "4Ka", "7nc", "2El", "04G", "09w", "d6g", "4S0", "4FQ", "bRN", "a3D", "4i", "0SS", "nc", "0MQ", "42w", "577", 
-"4M2", "4XS", "17T", "dlm", "3KO", "0nM", "4Uc", "74i", "6Nl", "5kn", "v2", "cS", "lR", "y3", "40F", "6Am", "6oA", "4Zb", "0aL", "2To", 
-"ON", "18U", "4WR", "4B3", "586", "bCM", "0BP", "ab", "PZ", "0sh", "4HF", "69m", "6SI", "4fj", "1Me", "2hg", "7N", "0Pt", "4kZ", "7NX", 
-"6pU", "4Ev", "1ny", "0k9", "Rk", "05Q", "4Jw", "5O7", "452", "50r", "1OT", "8O", "qw", "0RE", "4ik", "7Li", "66l", "4GG", "08a", "2IJ", 
-"T8", "AY", "6lf", "4YE", "43a", "6BJ", "ou", "0LG", "0Aw", "bE", "4o8", "4zY", "4Tu", "5Q5", "Li", "8fC", "14s", "Ch", "6nW", "5KU", 
-"41P", "7PZ", "mD", "0Nv", "0CF", "22m", "6MK", "4xh", "4VD", "6cg", "NX", "0mj", "5za", "7OB", "6T", "0Qn", "1oc", "2Ja", "65G", "4Dl", 
-"b7g", "68w", "1w2", "06z", "8UF", "dSN", "5b0", "4gp", "4hq", "5m1", "4e", "8ZG", "1mR", "1x3", "67v", "726", "4Km", "7no", "Sq", "04K", 
-"1NN", "9U", "6Pb", "4eA", "adr", "5kb", "26", "21F", "Ms", "0nA", "4Uo", "74e", "79U", "bbl", "0cq", "1f1", "no", "396", "4vs", "5s3", 
-"6LQ", "4yr", "367", "an", "OB", "0lp", "bmm", "76T", "6oM", "4Zn", "15i", "Br", "2zO", "0Ol", "40J", "6Aa", "6SM", "4fn", "1Ma", "2hc", 
-"2FO", "07d", "4HB", "69i", "64Y", "4Er", "83L", "d5D", "7J", "0Pp", "bQm", "a0g", "456", "50v", "1OP", "8K", "Ro", "05U", "4Js", "5O3", 
-"66h", "4GC", "08e", "2IN", "qs", "0RA", "4io", "7Lm", "43e", "6BN", "oq", "0LC", "0bo", "2WL", "6lb", "4YA", "4Tq", "5Q1", "Lm", "8fG", 
-"0As", "bA", "ael", "cPO", "41T", "ajm", "1K2", "0Nr", "14w", "Cl", "6nS", "5KQ", "5Fa", "6cc", "2XM", "0mn", "0CB", "22i", "6MO", "4xl", 
-"1og", "2Je", "65C", "4Dh", "4jD", "7OF", "6P", "g9", "3l9", "2iy", "5b4", "4gt", "4IX", "68s", "QD", "0rv", "1mV", "1x7", "4S8", "4FY", 
-"4hu", "5m5", "4a", "1Cz", "h8", "9Q", "6Pf", "4eE", "4Ki", "7nk", "Su", "04O", "Mw", "0nE", "4Uk", "74a", "6Nd", "5kf", "22", "21B", 
-"nk", "0MY", "4vw", "5s7", "6mx", "5Hz", "0cu", "1f5", "OF", "0lt", "4WZ", "6by", "6LU", "4yv", "0BX", "aj", "lZ", "0Oh", "40N", "6Ae", 
-"6oI", "4Zj", "0aD", "Bv", "5f", "9Ke", "4ir", "5l2", "66u", "735", "08x", "1y0", "Rr", "05H", "4Jn", "7ol", "6Qa", "4dB", "1OM", "8V", 
-"7W", "0Pm", "4kC", "7NA", "64D", "4Eo", "83Q", "2Kb", "PC", "07y", "b6d", "69t", "5c3", "4fs", "8TE", "dRM", "374", "22t", "599", "4xq", 
-"bln", "77W", "NA", "0ms", "14j", "Cq", "6nN", "5KL", "41I", "7PC", "3km", "0No", "35", "20E", "6Oc", "5ja", "4Tl", "6aO", "Lp", "0oB", 
-"0br", "1g2", "78V", "bco", "43x", "568", "ol", "385", "4Kt", "5N4", "Sh", "04R", "1NW", "9L", "441", "4eX", "4hh", "7Mj", "pt", "0SF", 
-"K9", "2HI", "67o", "4FD", "4IE", "68n", "QY", "0", "1Lf", "2id", "6RJ", "4gi", "4jY", "auh", "6M", "0Qw", "1oz", "2Jx", "5A5", "4Du", 
-"6oT", "4Zw", "0aY", "Bk", "lG", "0Ou", "40S", "6Ax", "6LH", "4yk", "0BE", "aw", "2YJ", "0li", "4WG", "6bd", "6me", "4XF", "0ch", "2VK", 
-"nv", "0MD", "42b", "6CI", "6Ny", "7K9", "1PU", "cF", "Mj", "0nX", "4Uv", "5P6", "66q", "4GZ", "1lU", "1y4", "5b", "0RX", "4iv", "5l6", 
-"6Qe", "4dF", "1OI", "8R", "Rv", "05L", "4Jj", "7oh", "6pH", "4Ek", "1nd", "2Kf", "7S", "0Pi", "4kG", "7NE", "5c7", "4fw", "1Mx", "0H8", 
-"PG", "0su", "5Xz", "69p", "4VY", "4C8", "NE", "0mw", "1Sz", "22p", "6MV", "4xu", "41M", "7PG", "mY", "x8", "14n", "Cu", "6nJ", "5KH", 
-"4Th", "6aK", "Lt", "0oF", "31", "bX", "6Og", "4zD", "4wt", "5r4", "oh", "0LZ", "0bv", "AD", "4L9", "4YX", "1NS", "9H", "445", "51u", 
-"4Kp", "5N0", "Sl", "04V", "09f", "2HM", "67k", "5Va", "4hl", "7Mn", "4x", "0SB", "1Lb", "3yA", "6RN", "4gm", "4IA", "68j", "2GL", "4", 
-"82O", "d4G", "5A1", "4Dq", "bPn", "a1d", "6I", "0Qs", "lC", "0Oq", "40W", "akn", "6oP", "4Zs", "15t", "Bo", "2YN", "0lm", "4WC", "76I", 
-"6LL", "4yo", "0BA", "as", "nr", "8DX", "42f", "6CM", "6ma", "4XB", "0cl", "2VO", "Mn", "8gD", "4Ur", "5P2", "ado", "bAm", "1PQ", "cB", 
-"Rz", "0qH", "4Jf", "7od", "6Qi", "4dJ", "i7", "2jG", "5n", "0RT", "4iz", "7Lx", "4R7", "4GV", "08p", "1y8", "PK", "07q", "4HW", "7mU", 
-"6SX", "52R", "1Mt", "0H4", "sW", "f6", "4kK", "7NI", "64L", "4Eg", "1nh", "2Kj", "14b", "Cy", "6nF", "5KD", "41A", "7PK", "mU", "x4", 
-"0CW", "0V6", "591", "4xy", "4VU", "4C4", "NI", "19R", "0bz", "AH", "4L5", "4YT", "43p", "560", "od", "0LV", "w5", "bT", "6Ok", "4zH", 
-"4Td", "6aG", "Lx", "0oJ", "5xA", "7Mb", "4t", "0SN", "K1", "2HA", "67g", "4FL", "b5G", "aTM", "0e3", "04Z", "8Wf", "9D", "449", "4eP", 
-"4jQ", "7OS", "6E", "255", "1or", "0j2", "65V", "cno", "4IM", "68f", "QQ", "8", "1Ln", "2il", "6RB", "4ga", "afR", "4yc", "0BM", "23f", 
-"OS", "Z2", "4WO", "6bl", "aEN", "c4e", "0aQ", "Bc", "lO", "8Fe", "4tS", "4a2", "4n3", "5ks", "8Id", "cN", "Mb", "0nP", "614", "74t", 
-"6mm", "4XN", "U3", "2VC", "2xo", "0ML", "42j", "6CA", "6Qm", "4dN", "i3", "8Z", "2Do", "05D", "4Jb", "aUS", "4R3", "4GR", "08t", "d7d", 
-"5j", "0RP", "bSM", "a2G", "ayN", "52V", "1Mp", "0H0", "PO", "07u", "4HS", "69x", "64H", "4Ec", "1nl", "2Kn", "sS", "f2", "4kO", "7NM", 
-"41E", "7PO", "mQ", "x0", "14f", "2Ul", "6nB", "aQ1", "4VQ", "4C0", "NM", "19V", "0CS", "0V2", "595", "bBN", "43t", "564", "0Y3", "0LR", 
-"16W", "AL", "4L1", "4YP", "5DA", "6aC", "2Zm", "0oN", "39", "bP", "6Oo", "4zL", "K5", "2HE", "67c", "4FH", "4hd", "7Mf", "4p", "0SJ", 
-"8Wb", "2kY", "4p5", "4eT", "4Kx", "5N8", "Sd", "0pV", "1ov", "0j6", "5A9", "4Dy", "4jU", "7OW", "6A", "1AZ", "1Lj", "2ih", "6RF", "4ge", 
-"4II", "68b", "QU", "D4", "OW", "Z6", "4WK", "6bh", "6LD", "4yg", "0BI", "23b", "lK", "0Oy", "4tW", "4a6", "6oX", "5JZ", "0aU", "Bg", 
-"Mf", "0nT", "4Uz", "74p", "4n7", "5kw", "1PY", "cJ", "nz", "0MH", "42n", "6CE", "6mi", "4XJ", "U7", "2VG", "4MP", "4X1", "UL", "02v", 
-"0XR", "0M3", "a8E", "57U", "4nL", "7KN", "2X", "c1", "1ko", "2Nm", "61K", "5PA", "4Oa", "6zB", "2Al", "00G", "l0", "yQ", "6Tn", "4aM", 
-"58T", "a7D", "0i", "0WS", "84o", "ZM", "4W0", "4BQ", "4I2", "5Lr", "13T", "G", "jc", "0IQ", "46w", "537", "6Jl", "5on", "r2", "gS", 
-"3OO", "0jM", "4Qc", "70i", "6kA", "5NC", "0eL", "2Po", "hR", "8Bx", "44F", "6Em", "abO", "49v", "0FP", "eb", "KN", "8ad", "4SR", "4F3", 
-"3B", "0Tx", "4oV", "4z7", "60Q", "4Az", "0zT", "Yf", "TV", "A7", "4LJ", "6yi", "6WE", "4bf", "0YH", "zz", "1s", "0VI", "4mg", "6XD", 
-"6vh", "4CK", "N6", "2MF", "Vg", "0uU", "6n9", "7ky", "4u6", "5pv", "1KX", "xK", "1UZ", "fI", "4k4", "5nt", "4Py", "5U9", "He", "0kW", 
-"P4", "EU", "6hj", "5Mh", "47m", "6FF", "ky", "0HK", "0GJ", "dx", "6IG", "48l", "4RH", "6gk", "JT", "0if", "0dV", "Gd", "5Z8", "5OY", 
-"4qT", "4d5", "iH", "0Jz", "0XV", "0M7", "5f8", "4cx", "4MT", "4X5", "UH", "02r", "1kk", "Xx", "61O", "5PE", "4nH", "7KJ", "vT", "c5", 
-"l4", "yU", "6Tj", "4aI", "4Oe", "6zF", "Wy", "00C", "1iZ", "ZI", "4W4", "4BU", "4ly", "5i9", "0m", "0WW", "jg", "0IU", "46s", "533", 
-"4I6", "5Lv", "0gy", "C", "3OK", "0jI", "4Qg", "6dD", "6Jh", "5oj", "r6", "gW", "hV", "0Kd", "44B", "6Ei", "6kE", "5NG", "0eH", "Fz", 
-"KJ", "0hx", "4SV", "4F7", "6HY", "49r", "0FT", "ef", "60U", "ckl", "0zP", "Yb", "3F", "206", "4oR", "4z3", "6WA", "4bb", "0YL", "2lo", 
-"TR", "A3", "4LN", "6ym", "62d", "4CO", "N2", "2MB", "1w", "0VM", "4mc", "7Ha", "4u2", "54z", "8Re", "xO", "Vc", "01Y", "b0D", "aQN", 
-"647", "71w", "Ha", "0kS", "8Lg", "fM", "4k0", "5np", "47i", "6FB", "29d", "0HO", "P0", "EQ", "6hn", "5Ml", "4RL", "6go", "JP", "0ib", 
-"0GN", "26e", "6IC", "48h", "45X", "4d1", "iL", "8Cf", "0dR", "0q3", "hYt", "beO", "4nD", "7KF", "2P", "c9", "1kg", "Xt", "61C", "5PI", 
-"4MX", "4X9", "UD", "0vv", "0XZ", "2my", "5f4", "4ct", "4lu", "5i5", "0a", "1Gz", "0yw", "ZE", "4W8", "4BY", "4Oi", "6zJ", "Wu", "00O", 
-"l8", "yY", "6Tf", "4aE", "6Jd", "5of", "62", "25B", "Iw", "0jE", "4Qk", "6dH", "6ix", "5Lz", "0gu", "O", "jk", "0IY", "4rw", "5w7", 
-"5x6", "5mW", "0FX", "ej", "KF", "0ht", "4SZ", "6fy", "6kI", "5NK", "0eD", "Fv", "hZ", "93", "44N", "6Ee", "2BO", "03d", "4LB", "6ya", 
-"6WM", "4bn", "1Ia", "zr", "3J", "0Tp", "bUm", "a4g", "5D2", "4Ar", "87L", "Yn", "Vo", "01U", "4Ns", "5K3", "416", "54v", "1KP", "xC", 
-"us", "0VA", "4mo", "6XL", "62h", "4CC", "0xm", "2MN", "0fo", "2SL", "6hb", "bgr", "47e", "6FN", "kq", "0HC", "0Es", "fA", "aal", "bDn", 
-"4Pq", "5U1", "Hm", "8bG", "10w", "Gl", "5Z0", "5OQ", "45T", "anm", "1O2", "0Jr", "0GB", "dp", "6IO", "48d", "5Ba", "6gc", "3Ll", "0in", 
-"1kc", "Xp", "61G", "5PM", "bTs", "7KB", "2T", "0Un", "8QF", "39T", "5f0", "4cp", "797", "aRm", "1s2", "02z", "0ys", "ZA", "63v", "766", 
-"4lq", "5i1", "0e", "9Nf", "0Zo", "2oL", "6Tb", "4aA", "4Om", "6zN", "Wq", "00K", "Is", "0jA", "4Qo", "6dL", "7ZA", "5ob", "66", "25F", 
-"jo", "9Pd", "4rs", "5w3", "aCn", "bfl", "0gq", "K", "KB", "0hp", "bim", "72T", "5x2", "49z", "327", "en", "3nn", "97", "44J", "6Ea", 
-"6kM", "5NO", "11i", "Fr", "6WI", "4bj", "0YD", "zv", "TZ", "0wh", "4LF", "6ye", "5D6", "4Av", "0zX", "Yj", "3N", "0Tt", "4oZ", "6Zy", 
-"412", "54r", "1KT", "xG", "Vk", "01Q", "4Nw", "5K7", "62l", "4CG", "0xi", "2MJ", "uw", "0VE", "4mk", "6XH", "47a", "6FJ", "ku", "0HG", 
-"P8", "EY", "6hf", "5Md", "4Pu", "5U5", "Hi", "8bC", "0Ew", "fE", "4k8", "5nx", "45P", "4d9", "iD", "0Jv", "0dZ", "Gh", "5Z4", "5OU", 
-"4RD", "6gg", "JX", "0ij", "0GF", "dt", "6IK", "5lI", "4Op", "5J0", "Wl", "00V", "0Zr", "2oQ", "405", "55u", "4ll", "6YO", "0x", "0WB", 
-"0yn", "2LM", "63k", "5Ra", "4MA", "6xb", "2CL", "02g", "0XC", "39I", "6VN", "4cm", "bTn", "a5d", "2I", "0Us", "86O", "Xm", "5E1", "5PP", 
-"6kP", "5NR", "11t", "Fo", "hC", "0Kq", "44W", "aon", "6HL", "49g", "0FA", "es", "3Mo", "0hm", "4SC", "72I", "6ia", "5Lc", "0gl", "V", 
-"jr", "1Ya", "46f", "6GM", "hyV", "bEm", "0Dp", "gB", "In", "8cD", "4Qr", "5T2", "1b", "0VX", "4mv", "5h6", "62q", "4CZ", "0xt", "2MW", 
-"Vv", "01L", "4Nj", "7kh", "6Ue", "54o", "1KI", "xZ", "3S", "0Ti", "4oG", "6Zd", "6tH", "4Ak", "0zE", "Yw", "TG", "0wu", "780", "6yx", 
-"5g7", "4bw", "0YY", "zk", "1Wz", "di", "5y5", "5lT", "4RY", "4G8", "JE", "0iw", "0dG", "Gu", "6jJ", "5OH", "45M", "6Df", "iY", "80", 
-"71", "fX", "6Kg", "5ne", "4Ph", "6eK", "Ht", "0kF", "0fv", "ED", "4H9", "5My", "4st", "5v4", "kh", "0HZ", "0Zv", "yD", "401", "4aX", 
-"4Ot", "5J4", "Wh", "00R", "O9", "ZX", "63o", "4BD", "4lh", "6YK", "tt", "0WF", "0XG", "2md", "6VJ", "4ci", "4ME", "6xf", "UY", "02c", 
-"1kz", "Xi", "5E5", "5PT", "4nY", "aqh", "2M", "0Uw", "hG", "0Ku", "44S", "6Ex", "6kT", "5NV", "0eY", "Fk", "3Mk", "0hi", "4SG", "6fd", 
-"6HH", "49c", "0FE", "ew", "jv", "0ID", "46b", "6GI", "6ie", "5Lg", "0gh", "R", "Ij", "0jX", "4Qv", "5T6", "6Jy", "7O9", "0Dt", "gF", 
-"62u", "775", "0xp", "198", "1f", "9Oe", "4mr", "5h2", "6Ua", "54k", "1KM", "2nO", "Vr", "01H", "4Nn", "7kl", "60D", "4Ao", "0zA", "Ys", 
-"3W", "0Tm", "4oC", "7JA", "5g3", "4bs", "8PE", "zo", "TC", "03y", "784", "aSn", "bhn", "73W", "JA", "0is", "334", "dm", "5y1", "48y", 
-"45I", "6Db", "3om", "84", "0dC", "Gq", "6jN", "5OL", "4Pl", "6eO", "Hp", "0kB", "75", "24E", "6Kc", "5na", "47x", "528", "kl", "8AF", 
-"0fr", "1c2", "aBm", "bgo", "4ld", "6YG", "0p", "0WJ", "O5", "ZT", "63c", "4BH", "4Ox", "5J8", "Wd", "0tV", "0Zz", "yH", "4t5", "4aT", 
-"4nU", "7KW", "2A", "1EZ", "1kv", "Xe", "5E9", "5PX", "4MI", "6xj", "UU", "02o", "0XK", "2mh", "6VF", "4ce", "6HD", "49o", "0FI", "27b", 
-"KW", "0he", "4SK", "6fh", "6kX", "5NZ", "0eU", "Fg", "hK", "0Ky", "4pW", "4e6", "4j7", "5ow", "0Dx", "gJ", "If", "0jT", "4Qz", "6dY", 
-"6ii", "5Lk", "Q7", "DV", "jz", "0IH", "46n", "6GE", "3PN", "01D", "4Nb", "aQS", "6Um", "54g", "m3", "xR", "1j", "0VP", "59W", "a6G", 
-"4V3", "4CR", "85l", "194", "TO", "03u", "4LS", "4Y2", "a9F", "56V", "0YQ", "zc", "wS", "b2", "4oO", "6Zl", "60H", "4Ac", "0zM", "2On", 
-"0dO", "2Ql", "6jB", "aU1", "45E", "6Dn", "iQ", "88", "0GS", "da", "acL", "48u", "4RQ", "4G0", "JM", "94N", "12W", "EL", "4H1", "5Mq", 
-"47t", "524", "29y", "0HR", "79", "fP", "6Ko", "5nm", "aZ0", "6eC", "3NL", "0kN", "O1", "ZP", "63g", "4BL", "58I", "6YC", "0t", "0WN", 
-"8Sf", "yL", "409", "4aP", "b1G", "aPM", "0a3", "00Z", "1kr", "Xa", "61V", "bzN", "4nQ", "7KS", "2E", "215", "0XO", "2ml", "6VB", "4ca", 
-"4MM", "6xn", "UQ", "02k", "KS", "0ha", "4SO", "6fl", "7Xa", "49k", "0FM", "27f", "hO", "8Be", "4pS", "4e2", "aAN", "bdL", "0eQ", "Fc", 
-"Ib", "0jP", "654", "70t", "4j3", "5os", "8Md", "gN", "28g", "0IL", "46j", "6GA", "6im", "5Lo", "Q3", "Z", "6Ui", "54c", "m7", "xV", 
-"Vz", "0uH", "4Nf", "7kd", "4V7", "4CV", "0xx", "190", "1n", "0VT", "4mz", "6XY", "6WX", "56R", "0YU", "zg", "TK", "03q", "4LW", "4Y6", 
-"60L", "4Ag", "0zI", "2Oj", "wW", "b6", "4oK", "6Zh", "45A", "6Dj", "iU", "0Jg", "0dK", "Gy", "6jF", "5OD", "4RU", "4G4", "JI", "1yZ", 
-"0GW", "de", "5y9", "48q", "47p", "520", "kd", "0HV", "0fz", "EH", "4H5", "5Mu", "4Pd", "6eG", "Hx", "0kJ", "s5", "fT", "6Kk", "5ni", 
-"5Y1", "5LP", "13v", "e", "jA", "0Is", "46U", "aml", "6JN", "5oL", "0DC", "gq", "3Om", "0jo", "4QA", "6db", "6kc", "5Na", "0en", "2PM", 
-"hp", "0KB", "44d", "6EO", "abm", "49T", "0Fr", "1C2", "Kl", "8aF", "4Sp", "5V0", "4Mr", "5H2", "Un", "02T", "0Xp", "2mS", "427", "57w", 
-"4nn", "7Kl", "2z", "1Ea", "1kM", "2NO", "61i", "5Pc", "4OC", "7jA", "2AN", "00e", "0ZA", "ys", "6TL", "4ao", "58v", "a7f", "0K", "0Wq", 
-"84M", "Zo", "5G3", "4Bs", "0EY", "fk", "6KT", "5nV", "bjh", "6ex", "HG", "0ku", "0fE", "Ew", "6hH", "5MJ", "47O", "6Fd", "29B", "0Hi", 
-"53", "dZ", "6Ie", "48N", "4Rj", "6gI", "Jv", "0iD", "0dt", "GF", "6jy", "7o9", "4qv", "5t6", "ij", "0JX", "wh", "0TZ", "4ot", "5j4", 
-"4T9", "4AX", "0zv", "YD", "Tt", "03N", "4Lh", "6yK", "6Wg", "4bD", "o9", "zX", "1Q", "0Vk", "4mE", "6Xf", "62B", "4Ci", "0xG", "2Md", 
-"VE", "0uw", "4NY", "aQh", "5e5", "5pT", "1Kz", "xi", "jE", "0Iw", "46Q", "4g8", "5Y5", "5LT", "13r", "a", "IY", "0jk", "4QE", "6df", 
-"6JJ", "5oH", "0DG", "gu", "ht", "0KF", "4ph", "6EK", "6kg", "5Ne", "S9", "FX", "Kh", "0hZ", "4St", "5V4", "4h9", "49P", "0Fv", "eD", 
-"0Xt", "2mW", "423", "4cZ", "4Mv", "5H6", "Uj", "02P", "1kI", "XZ", "61m", "5Pg", "4nj", "7Kh", "vv", "0UD", "0ZE", "yw", "6TH", "4ak", 
-"4OG", "6zd", "2AJ", "00a", "0yY", "Zk", "5G7", "4Bw", "58r", "6Yx", "0O", "0Wu", "bjl", "71U", "HC", "0kq", "316", "fo", "6KP", "5nR", 
-"47K", "7VA", "29F", "0Hm", "0fA", "Es", "6hL", "5MN", "4Rn", "6gM", "Jr", "1ya", "57", "26G", "6Ia", "48J", "45z", "5t2", "in", "8CD", 
-"0dp", "GB", "hYV", "bem", "60w", "757", "0zr", "2OQ", "3d", "9Mg", "4op", "5j0", "6Wc", "56i", "0Yn", "2lM", "Tp", "03J", "4Ll", "6yO", 
-"62F", "4Cm", "0xC", "dwS", "1U", "0Vo", "4mA", "6Xb", "5e1", "54X", "8RG", "xm", "VA", "0us", "b0f", "aQl", "6JF", "5oD", "0DK", "gy", 
-"IU", "0jg", "4QI", "6dj", "5Y9", "5LX", "0gW", "m", "jI", "1YZ", "4rU", "4g4", "4h5", "5mu", "0Fz", "eH", "Kd", "0hV", "4Sx", "5V8", 
-"6kk", "5Ni", "S5", "FT", "hx", "0KJ", "44l", "6EG", "4nf", "7Kd", "2r", "0UH", "M7", "XV", "61a", "5Pk", "4Mz", "6xY", "Uf", "0vT", 
-"0Xx", "39r", "4v7", "4cV", "4lW", "4y6", "0C", "0Wy", "0yU", "Zg", "63P", "5RZ", "4OK", "6zh", "WW", "B6", "0ZI", "2oj", "6TD", "4ag", 
-"0fM", "2Sn", "7xa", "5MB", "47G", "6Fl", "kS", "0Ha", "0EQ", "fc", "aaN", "bDL", "4PS", "4E2", "HO", "8be", "10U", "GN", "4J3", "5Os", 
-"45v", "506", "ib", "0JP", "q3", "dR", "6Im", "48F", "4Rb", "6gA", "3LN", "0iL", "2Bm", "03F", "aF0", "6yC", "6Wo", "4bL", "o1", "zP", 
-"3h", "0TR", "bUO", "a4E", "4T1", "4AP", "87n", "YL", "VM", "01w", "4NQ", "7kS", "hfu", "54T", "1Kr", "xa", "1Y", "0Vc", "4mM", "6Xn", 
-"62J", "4Ca", "0xO", "2Ml", "IQ", "0jc", "4QM", "6dn", "6JB", "a19", "0DO", "25d", "jM", "9PF", "46Y", "4g0", "aCL", "687", "0gS", "i", 
-"3MP", "0hR", "676", "72v", "4h1", "49X", "8Of", "eL", "3nL", "0KN", "44h", "6EC", "6ko", "5Nm", "S1", "FP", "M3", "XR", "61e", "5Po", 
-"4nb", "aqS", "2v", "0UL", "8Qd", "39v", "4v3", "4cR", "b3E", "aRO", "Ub", "02X", "0yQ", "Zc", "63T", "bxL", "4lS", "4y2", "0G", "237", 
-"0ZM", "2on", "7Da", "4ac", "4OO", "6zl", "WS", "B2", "47C", "6Fh", "kW", "0He", "0fI", "2Sj", "6hD", "5MF", "4PW", "4E6", "HK", "0ky", 
-"0EU", "fg", "6KX", "5nZ", "45r", "502", "if", "0JT", "0dx", "GJ", "4J7", "5Ow", "4Rf", "6gE", "Jz", "0iH", "q7", "dV", "6Ii", "48B", 
-"6Wk", "4bH", "o5", "zT", "Tx", "03B", "4Ld", "6yG", "4T5", "4AT", "0zz", "YH", "3l", "0TV", "4ox", "5j8", "5e9", "54P", "1Kv", "xe", 
-"VI", "01s", "4NU", "7kW", "62N", "4Ce", "0xK", "2Mh", "uU", "0Vg", "4mI", "6Xj", "4K0", "5Np", "11V", "FM", "ha", "0KS", "44u", "515", 
-"6Hn", "49E", "48", "eQ", "3MM", "0hO", "4Sa", "6fB", "6iC", "5LA", "0gN", "t", "jP", "0Ib", "46D", "6Go", "hyt", "bEO", "0DR", "0Q3", 
-"IL", "8cf", "4QP", "4D1", "4OR", "4Z3", "WN", "00t", "0ZP", "yb", "hgv", "55W", "4lN", "6Ym", "0Z", "a3", "0yL", "2Lo", "63I", "4Bb", 
-"4Mc", "7ha", "2Cn", "02E", "n2", "2mB", "6Vl", "4cO", "bTL", "a5F", "2k", "0UQ", "86m", "XO", "4U2", "5Pr", "0Gy", "dK", "4i6", "5lv", 
-"5BZ", "6gX", "Jg", "0iU", "R6", "GW", "6jh", "5Oj", "45o", "6DD", "3oK", "0JI", "0EH", "fz", "6KE", "5nG", "4PJ", "6ei", "HV", "0kd", 
-"0fT", "Ef", "6hY", "690", "4sV", "4f7", "kJ", "0Hx", "uH", "0Vz", "4mT", "4x5", "5F8", "4Cx", "0xV", "0m7", "VT", "C5", "4NH", "7kJ", 
-"6UG", "54M", "1Kk", "xx", "3q", "0TK", "4oe", "6ZF", "60b", "4AI", "L4", "YU", "Te", "0wW", "4Ly", "5I9", "4w4", "4bU", "1IZ", "zI", 
-"he", "0KW", "44q", "511", "4K4", "5Nt", "11R", "FI", "Ky", "0hK", "4Se", "6fF", "6Hj", "49A", "p4", "eU", "jT", "0If", "4rH", "6Gk", 
-"6iG", "5LE", "0gJ", "p", "IH", "0jz", "4QT", "4D5", "5z8", "5oY", "0DV", "gd", "0ZT", "yf", "6TY", "4az", "4OV", "4Z7", "WJ", "00p", 
-"0yH", "Zz", "63M", "4Bf", "4lJ", "6Yi", "tV", "a7", "n6", "2mF", "6Vh", "4cK", "4Mg", "6xD", "2Cj", "02A", "1kX", "XK", "4U6", "5Pv", 
-"6N9", "7Ky", "2o", "0UU", "665", "73u", "Jc", "0iQ", "8Ne", "dO", "4i2", "5lr", "45k", "7Ta", "3oO", "0JM", "R2", "GS", "6jl", "5On", 
-"4PN", "6em", "HR", "8bx", "0EL", "24g", "6KA", "5nC", "47Z", "4f3", "kN", "8Ad", "0fP", "Eb", "aBO", "694", "62W", "byO", "0xR", "0m3", 
-"1D", "224", "4mP", "4x1", "6UC", "54I", "1Ko", "2nm", "VP", "C1", "4NL", "7kN", "60f", "4AM", "L0", "YQ", "3u", "0TO", "4oa", "6ZB", 
-"438", "4bQ", "8Pg", "zM", "Ta", "0wS", "b2F", "aSL", "6Hf", "49M", "40", "eY", "Ku", "0hG", "4Si", "6fJ", "4K8", "5Nx", "0ew", "FE", 
-"hi", "8BC", "4pu", "5u5", "5z4", "5oU", "0DZ", "gh", "ID", "0jv", "4QX", "4D9", "6iK", "5LI", "0gF", "Dt", "jX", "0Ij", "46L", "6Gg", 
-"4lF", "6Ye", "0R", "0Wh", "0yD", "Zv", "63A", "4Bj", "4OZ", "6zy", "WF", "0tt", "0ZX", "yj", "5d6", "4av", "4nw", "5k7", "2c", "0UY", 
-"1kT", "XG", "61p", "5Pz", "4Mk", "6xH", "Uw", "02M", "0Xi", "2mJ", "6Vd", "4cG", "0dm", "2QN", "7zA", "5Ob", "45g", "6DL", "is", "0JA", 
-"0Gq", "dC", "acn", "48W", "4Rs", "5W3", "Jo", "94l", "12u", "En", "5X2", "5MS", "47V", "alo", "kB", "0Hp", "1Ua", "fr", "6KM", "5nO", 
-"4PB", "6ea", "3Nn", "0kl", "3Pl", "01f", "bts", "7kB", "6UO", "54E", "1Kc", "xp", "1H", "0Vr", "59u", "a6e", "5F0", "4Cp", "85N", "d3F", 
-"Tm", "03W", "4Lq", "5I1", "434", "56t", "0Ys", "zA", "3y", "0TC", "4om", "6ZN", "60j", "4AA", "0zo", "2OL", "Kq", "0hC", "4Sm", "6fN", 
-"6Hb", "49I", "44", "27D", "hm", "8BG", "44y", "519", "aAl", "bdn", "0es", "FA", "1o2", "0jr", "bko", "70V", "5z0", "5oQ", "305", "gl", 
-"28E", "0In", "46H", "6Gc", "6iO", "5LM", "0gB", "x", "1ia", "Zr", "63E", "4Bn", "4lB", "6Ya", "0V", "0Wl", "8SD", "yn", "5d2", "4ar", 
-"b1e", "aPo", "WB", "00x", "1kP", "XC", "61t", "744", "4ns", "5k3", "2g", "9Ld", "0Xm", "2mN", "7FA", "4cC", "4Mo", "6xL", "Us", "02I", 
-"45c", "6DH", "iw", "0JE", "0di", "2QJ", "6jd", "5Of", "4Rw", "5W7", "Jk", "0iY", "0Gu", "dG", "6Ix", "48S", "47R", "6Fy", "kF", "0Ht", 
-"0fX", "Ej", "5X6", "5MW", "4PF", "6ee", "HZ", "0kh", "0ED", "fv", "6KI", "5nK", "6UK", "54A", "1Kg", "xt", "VX", "C9", "4ND", "7kF", 
-"5F4", "4Ct", "0xZ", "2My", "1L", "0Vv", "4mX", "4x9", "430", "4bY", "0Yw", "zE", "Ti", "03S", "4Lu", "5I5", "60n", "4AE", "L8", "YY", 
-"wu", "0TG", "4oi", "6ZJ" };
-
-
-#endif
-
diff --git a/redis-stable/src/crc64.c b/redis-stable/src/crc64.c
deleted file mode 100644
index d4db4158..00000000
--- a/redis-stable/src/crc64.c
+++ /dev/null
@@ -1,161 +0,0 @@
-/* Copyright (c) 2014, Matt Stancliff <matt@genges.com>
- * Copyright (c) 2020, Amazon Web Services
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE. */
-
-#include "crc64.h"
-#include "crcspeed.h"
-static uint64_t crc64_table[8][256] = {{0}};
-
-#define POLY UINT64_C(0xad93d23594c935a9)
-/******************** BEGIN GENERATED PYCRC FUNCTIONS ********************/
-/**
- * Generated on Sun Dec 21 14:14:07 2014,
- * by pycrc v0.8.2, https://www.tty1.net/pycrc/
- *
- * LICENSE ON GENERATED CODE:
- * ==========================
- * As of version 0.6, pycrc is released under the terms of the MIT licence.
- * The code generated by pycrc is not considered a substantial portion of the
- * software, therefore the author of pycrc will not claim any copyright on
- * the generated code.
- * ==========================
- *
- * CRC configuration:
- *    Width        = 64
- *    Poly         = 0xad93d23594c935a9
- *    XorIn        = 0xffffffffffffffff
- *    ReflectIn    = True
- *    XorOut       = 0x0000000000000000
- *    ReflectOut   = True
- *    Algorithm    = bit-by-bit-fast
- *
- * Modifications after generation (by matt):
- *   - included finalize step in-line with update for single-call generation
- *   - re-worked some inner variable architectures
- *   - adjusted function parameters to match expected prototypes.
- *****************************************************************************/
-
-/**
- * Reflect all bits of a \a data word of \a data_len bytes.
- *
- * \param data         The data word to be reflected.
- * \param data_len     The width of \a data expressed in number of bits.
- * \return             The reflected data.
- *****************************************************************************/
-static inline uint_fast64_t crc_reflect(uint_fast64_t data, size_t data_len) {
-    uint_fast64_t ret = data & 0x01;
-
-    for (size_t i = 1; i < data_len; i++) {
-        data >>= 1;
-        ret = (ret << 1) | (data & 0x01);
-    }
-
-    return ret;
-}
-
-/**
- *  Update the crc value with new data.
- *
- * \param crc      The current crc value.
- * \param data     Pointer to a buffer of \a data_len bytes.
- * \param data_len Number of bytes in the \a data buffer.
- * \return         The updated crc value.
- ******************************************************************************/
-uint64_t _crc64(uint_fast64_t crc, const void *in_data, const uint64_t len) {
-    const uint8_t *data = in_data;
-    unsigned long long bit;
-
-    for (uint64_t offset = 0; offset < len; offset++) {
-        uint8_t c = data[offset];
-        for (uint_fast8_t i = 0x01; i & 0xff; i <<= 1) {
-            bit = crc & 0x8000000000000000;
-            if (c & i) {
-                bit = !bit;
-            }
-
-            crc <<= 1;
-            if (bit) {
-                crc ^= POLY;
-            }
-        }
-
-        crc &= 0xffffffffffffffff;
-    }
-
-    crc = crc & 0xffffffffffffffff;
-    return crc_reflect(crc, 64) ^ 0x0000000000000000;
-}
-
-/******************** END GENERATED PYCRC FUNCTIONS ********************/
-
-/* Initializes the 16KB lookup tables. */
-void crc64_init(void) {
-    crcspeed64native_init(_crc64, crc64_table);
-}
-
-/* Compute crc64 */
-uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l) {
-    return crcspeed64native(crc64_table, crc, (void *) s, l);
-}
-
-/* Test main */
-#ifdef REDIS_TEST
-#include <stdio.h>
-
-#define UNUSED(x) (void)(x)
-int crc64Test(int argc, char *argv[], int accurate) {
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-    crc64_init();
-    printf("[calcula]: e9c6d914c4b8d9ca == %016" PRIx64 "\n",
-           (uint64_t)_crc64(0, "123456789", 9));
-    printf("[64speed]: e9c6d914c4b8d9ca == %016" PRIx64 "\n",
-           (uint64_t)crc64(0, (unsigned char*)"123456789", 9));
-    char li[] = "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed "
-                "do eiusmod tempor incididunt ut labore et dolore magna "
-                "aliqua. Ut enim ad minim veniam, quis nostrud exercitation "
-                "ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis "
-                "aute irure dolor in reprehenderit in voluptate velit esse "
-                "cillum dolore eu fugiat nulla pariatur. Excepteur sint "
-                "occaecat cupidatat non proident, sunt in culpa qui officia "
-                "deserunt mollit anim id est laborum.";
-    printf("[calcula]: c7794709e69683b3 == %016" PRIx64 "\n",
-           (uint64_t)_crc64(0, li, sizeof(li)));
-    printf("[64speed]: c7794709e69683b3 == %016" PRIx64 "\n",
-           (uint64_t)crc64(0, (unsigned char*)li, sizeof(li)));
-    return 0;
-}
-
-#endif
-
-#ifdef REDIS_TEST_MAIN
-int main(int argc, char *argv[]) {
-    return crc64Test(argc, argv);
-}
-
-#endif
diff --git a/redis-stable/src/crc64.h b/redis-stable/src/crc64.h
deleted file mode 100644
index 38b0b638..00000000
--- a/redis-stable/src/crc64.h
+++ /dev/null
@@ -1,13 +0,0 @@
-#ifndef CRC64_H
-#define CRC64_H
-
-#include <stdint.h>
-
-void crc64_init(void);
-uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l);
-
-#ifdef REDIS_TEST
-int crc64Test(int argc, char *argv[], int accurate);
-#endif
-
-#endif
diff --git a/redis-stable/src/crcspeed.c b/redis-stable/src/crcspeed.c
deleted file mode 100644
index 67cb8fd9..00000000
--- a/redis-stable/src/crcspeed.c
+++ /dev/null
@@ -1,282 +0,0 @@
-/*
- * Copyright (C) 2013 Mark Adler
- * Originally by: crc64.c Version 1.4  16 Dec 2013  Mark Adler
- * Modifications by Matt Stancliff <matt@genges.com>:
- *   - removed CRC64-specific behavior
- *   - added generation of lookup tables by parameters
- *   - removed inversion of CRC input/result
- *   - removed automatic initialization in favor of explicit initialization
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the author be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  Mark Adler
-  madler@alumni.caltech.edu
- */
-
-#include "crcspeed.h"
-
-/* Fill in a CRC constants table. */
-void crcspeed64little_init(crcfn64 crcfn, uint64_t table[8][256]) {
-    uint64_t crc;
-
-    /* generate CRCs for all single byte sequences */
-    for (int n = 0; n < 256; n++) {
-        unsigned char v = n;
-        table[0][n] = crcfn(0, &v, 1);
-    }
-
-    /* generate nested CRC table for future slice-by-8 lookup */
-    for (int n = 0; n < 256; n++) {
-        crc = table[0][n];
-        for (int k = 1; k < 8; k++) {
-            crc = table[0][crc & 0xff] ^ (crc >> 8);
-            table[k][n] = crc;
-        }
-    }
-}
-
-void crcspeed16little_init(crcfn16 crcfn, uint16_t table[8][256]) {
-    uint16_t crc;
-
-    /* generate CRCs for all single byte sequences */
-    for (int n = 0; n < 256; n++) {
-        table[0][n] = crcfn(0, &n, 1);
-    }
-
-    /* generate nested CRC table for future slice-by-8 lookup */
-    for (int n = 0; n < 256; n++) {
-        crc = table[0][n];
-        for (int k = 1; k < 8; k++) {
-            crc = table[0][(crc >> 8) & 0xff] ^ (crc << 8);
-            table[k][n] = crc;
-        }
-    }
-}
-
-/* Reverse the bytes in a 64-bit word. */
-static inline uint64_t rev8(uint64_t a) {
-#if defined(__GNUC__) || defined(__clang__)
-    return __builtin_bswap64(a);
-#else
-    uint64_t m;
-
-    m = UINT64_C(0xff00ff00ff00ff);
-    a = ((a >> 8) & m) | (a & m) << 8;
-    m = UINT64_C(0xffff0000ffff);
-    a = ((a >> 16) & m) | (a & m) << 16;
-    return a >> 32 | a << 32;
-#endif
-}
-
-/* This function is called once to initialize the CRC table for use on a
-   big-endian architecture. */
-void crcspeed64big_init(crcfn64 fn, uint64_t big_table[8][256]) {
-    /* Create the little endian table then reverse all the entries. */
-    crcspeed64little_init(fn, big_table);
-    for (int k = 0; k < 8; k++) {
-        for (int n = 0; n < 256; n++) {
-            big_table[k][n] = rev8(big_table[k][n]);
-        }
-    }
-}
-
-void crcspeed16big_init(crcfn16 fn, uint16_t big_table[8][256]) {
-    /* Create the little endian table then reverse all the entries. */
-    crcspeed16little_init(fn, big_table);
-    for (int k = 0; k < 8; k++) {
-        for (int n = 0; n < 256; n++) {
-            big_table[k][n] = rev8(big_table[k][n]);
-        }
-    }
-}
-
-/* Calculate a non-inverted CRC multiple bytes at a time on a little-endian
- * architecture. If you need inverted CRC, invert *before* calling and invert
- * *after* calling.
- * 64 bit crc = process 8 bytes at once;
- */
-uint64_t crcspeed64little(uint64_t little_table[8][256], uint64_t crc,
-                          void *buf, size_t len) {
-    unsigned char *next = buf;
-
-    /* process individual bytes until we reach an 8-byte aligned pointer */
-    while (len && ((uintptr_t)next & 7) != 0) {
-        crc = little_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);
-        len--;
-    }
-
-    /* fast middle processing, 8 bytes (aligned!) per loop */
-    while (len >= 8) {
-        crc ^= *(uint64_t *)next;
-        crc = little_table[7][crc & 0xff] ^
-              little_table[6][(crc >> 8) & 0xff] ^
-              little_table[5][(crc >> 16) & 0xff] ^
-              little_table[4][(crc >> 24) & 0xff] ^
-              little_table[3][(crc >> 32) & 0xff] ^
-              little_table[2][(crc >> 40) & 0xff] ^
-              little_table[1][(crc >> 48) & 0xff] ^
-              little_table[0][crc >> 56];
-        next += 8;
-        len -= 8;
-    }
-
-    /* process remaining bytes (can't be larger than 8) */
-    while (len) {
-        crc = little_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);
-        len--;
-    }
-
-    return crc;
-}
-
-uint16_t crcspeed16little(uint16_t little_table[8][256], uint16_t crc,
-                          void *buf, size_t len) {
-    unsigned char *next = buf;
-
-    /* process individual bytes until we reach an 8-byte aligned pointer */
-    while (len && ((uintptr_t)next & 7) != 0) {
-        crc = little_table[0][((crc >> 8) ^ *next++) & 0xff] ^ (crc << 8);
-        len--;
-    }
-
-    /* fast middle processing, 8 bytes (aligned!) per loop */
-    while (len >= 8) {
-        uint64_t n = *(uint64_t *)next;
-        crc = little_table[7][(n & 0xff) ^ ((crc >> 8) & 0xff)] ^
-              little_table[6][((n >> 8) & 0xff) ^ (crc & 0xff)] ^
-              little_table[5][(n >> 16) & 0xff] ^
-              little_table[4][(n >> 24) & 0xff] ^
-              little_table[3][(n >> 32) & 0xff] ^
-              little_table[2][(n >> 40) & 0xff] ^
-              little_table[1][(n >> 48) & 0xff] ^
-              little_table[0][n >> 56];
-        next += 8;
-        len -= 8;
-    }
-
-    /* process remaining bytes (can't be larger than 8) */
-    while (len) {
-        crc = little_table[0][((crc >> 8) ^ *next++) & 0xff] ^ (crc << 8);
-        len--;
-    }
-
-    return crc;
-}
-
-/* Calculate a non-inverted CRC eight bytes at a time on a big-endian
- * architecture.
- */
-uint64_t crcspeed64big(uint64_t big_table[8][256], uint64_t crc, void *buf,
-                       size_t len) {
-    unsigned char *next = buf;
-
-    crc = rev8(crc);
-    while (len && ((uintptr_t)next & 7) != 0) {
-        crc = big_table[0][(crc >> 56) ^ *next++] ^ (crc << 8);
-        len--;
-    }
-
-    while (len >= 8) {
-        crc ^= *(uint64_t *)next;
-        crc = big_table[0][crc & 0xff] ^
-              big_table[1][(crc >> 8) & 0xff] ^
-              big_table[2][(crc >> 16) & 0xff] ^
-              big_table[3][(crc >> 24) & 0xff] ^
-              big_table[4][(crc >> 32) & 0xff] ^
-              big_table[5][(crc >> 40) & 0xff] ^
-              big_table[6][(crc >> 48) & 0xff] ^
-              big_table[7][crc >> 56];
-        next += 8;
-        len -= 8;
-    }
-
-    while (len) {
-        crc = big_table[0][(crc >> 56) ^ *next++] ^ (crc << 8);
-        len--;
-    }
-
-    return rev8(crc);
-}
-
-/* WARNING: Completely untested on big endian architecture.  Possibly broken. */
-uint16_t crcspeed16big(uint16_t big_table[8][256], uint16_t crc_in, void *buf,
-                       size_t len) {
-    unsigned char *next = buf;
-    uint64_t crc = crc_in;
-
-    crc = rev8(crc);
-    while (len && ((uintptr_t)next & 7) != 0) {
-        crc = big_table[0][((crc >> (56 - 8)) ^ *next++) & 0xff] ^ (crc >> 8);
-        len--;
-    }
-
-    while (len >= 8) {
-        uint64_t n = *(uint64_t *)next;
-        crc = big_table[0][(n & 0xff) ^ ((crc >> (56 - 8)) & 0xff)] ^
-              big_table[1][((n >> 8) & 0xff) ^ (crc & 0xff)] ^
-              big_table[2][(n >> 16) & 0xff] ^
-              big_table[3][(n >> 24) & 0xff] ^
-              big_table[4][(n >> 32) & 0xff] ^
-              big_table[5][(n >> 40) & 0xff] ^
-              big_table[6][(n >> 48) & 0xff] ^
-              big_table[7][n >> 56];
-        next += 8;
-        len -= 8;
-    }
-
-    while (len) {
-        crc = big_table[0][((crc >> (56 - 8)) ^ *next++) & 0xff] ^ (crc >> 8);
-        len--;
-    }
-
-    return rev8(crc);
-}
-
-/* Return the CRC of buf[0..len-1] with initial crc, processing eight bytes
-   at a time using passed-in lookup table.
-   This selects one of two routines depending on the endianess of
-   the architecture. */
-uint64_t crcspeed64native(uint64_t table[8][256], uint64_t crc, void *buf,
-                          size_t len) {
-    uint64_t n = 1;
-
-    return *(char *)&n ? crcspeed64little(table, crc, buf, len)
-                       : crcspeed64big(table, crc, buf, len);
-}
-
-uint16_t crcspeed16native(uint16_t table[8][256], uint16_t crc, void *buf,
-                          size_t len) {
-    uint64_t n = 1;
-
-    return *(char *)&n ? crcspeed16little(table, crc, buf, len)
-                       : crcspeed16big(table, crc, buf, len);
-}
-
-/* Initialize CRC lookup table in architecture-dependent manner. */
-void crcspeed64native_init(crcfn64 fn, uint64_t table[8][256]) {
-    uint64_t n = 1;
-
-    *(char *)&n ? crcspeed64little_init(fn, table)
-                : crcspeed64big_init(fn, table);
-}
-
-void crcspeed16native_init(crcfn16 fn, uint16_t table[8][256]) {
-    uint64_t n = 1;
-
-    *(char *)&n ? crcspeed16little_init(fn, table)
-                : crcspeed16big_init(fn, table);
-}
diff --git a/redis-stable/src/crcspeed.h b/redis-stable/src/crcspeed.h
deleted file mode 100644
index d7ee95eb..00000000
--- a/redis-stable/src/crcspeed.h
+++ /dev/null
@@ -1,60 +0,0 @@
-/* Copyright (c) 2014, Matt Stancliff <matt@genges.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE. */
-
-#ifndef CRCSPEED_H
-#define CRCSPEED_H
-
-#include <inttypes.h>
-#include <stdio.h>
-
-typedef uint64_t (*crcfn64)(uint64_t, const void *, const uint64_t);
-typedef uint16_t (*crcfn16)(uint16_t, const void *, const uint64_t);
-
-/* CRC-64 */
-void crcspeed64little_init(crcfn64 fn, uint64_t table[8][256]);
-void crcspeed64big_init(crcfn64 fn, uint64_t table[8][256]);
-void crcspeed64native_init(crcfn64 fn, uint64_t table[8][256]);
-
-uint64_t crcspeed64little(uint64_t table[8][256], uint64_t crc, void *buf,
-                          size_t len);
-uint64_t crcspeed64big(uint64_t table[8][256], uint64_t crc, void *buf,
-                       size_t len);
-uint64_t crcspeed64native(uint64_t table[8][256], uint64_t crc, void *buf,
-                          size_t len);
-
-/* CRC-16 */
-void crcspeed16little_init(crcfn16 fn, uint16_t table[8][256]);
-void crcspeed16big_init(crcfn16 fn, uint16_t table[8][256]);
-void crcspeed16native_init(crcfn16 fn, uint16_t table[8][256]);
-
-uint16_t crcspeed16little(uint16_t table[8][256], uint16_t crc, void *buf,
-                          size_t len);
-uint16_t crcspeed16big(uint16_t table[8][256], uint16_t crc, void *buf,
-                       size_t len);
-uint16_t crcspeed16native(uint16_t table[8][256], uint16_t crc, void *buf,
-                          size_t len);
-#endif
diff --git a/redis-stable/src/db.c b/redis-stable/src/db.c
deleted file mode 100644
index c8d6199d..00000000
--- a/redis-stable/src/db.c
+++ /dev/null
@@ -1,2009 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "cluster.h"
-#include "atomicvar.h"
-#include "latency.h"
-
-#include <signal.h>
-#include <ctype.h>
-
-/* Database backup. */
-struct dbBackup {
-    redisDb *dbarray;
-    rax *slots_to_keys;
-    uint64_t slots_keys_count[CLUSTER_SLOTS];
-};
-
-/*-----------------------------------------------------------------------------
- * C-level DB API
- *----------------------------------------------------------------------------*/
-
-int keyIsExpired(redisDb *db, robj *key);
-
-/* Update LFU when an object is accessed.
- * Firstly, decrement the counter if the decrement time is reached.
- * Then logarithmically increment the counter, and update the access time. */
-void updateLFU(robj *val) {
-    unsigned long counter = LFUDecrAndReturn(val);
-    counter = LFULogIncr(counter);
-    val->lru = (LFUGetTimeInMinutes()<<8) | counter;
-}
-
-/* Low level key lookup API, not actually called directly from commands
- * implementations that should instead rely on lookupKeyRead(),
- * lookupKeyWrite() and lookupKeyReadWithFlags(). */
-robj *lookupKey(redisDb *db, robj *key, int flags) {
-    dictEntry *de = dictFind(db->dict,key->ptr);
-    if (de) {
-        robj *val = dictGetVal(de);
-
-        /* Update the access time for the ageing algorithm.
-         * Don't do it if we have a saving child, as this will trigger
-         * a copy on write madness. */
-        if (!hasActiveChildProcess() && !(flags & LOOKUP_NOTOUCH)){
-            if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-                updateLFU(val);
-            } else {
-                val->lru = LRU_CLOCK();
-            }
-        }
-        return val;
-    } else {
-        return NULL;
-    }
-}
-
-/* Lookup a key for read operations, or return NULL if the key is not found
- * in the specified DB.
- *
- * As a side effect of calling this function:
- * 1. A key gets expired if it reached it's TTL.
- * 2. The key last access time is updated.
- * 3. The global keys hits/misses stats are updated (reported in INFO).
- * 4. If keyspace notifications are enabled, a "keymiss" notification is fired.
- *
- * This API should not be used when we write to the key after obtaining
- * the object linked to the key, but only for read only operations.
- *
- * Flags change the behavior of this command:
- *
- *  LOOKUP_NONE (or zero): no special flags are passed.
- *  LOOKUP_NOTOUCH: don't alter the last access time of the key.
- *
- * Note: this function also returns NULL if the key is logically expired
- * but still existing, in case this is a slave, since this API is called only
- * for read operations. Even if the key expiry is master-driven, we can
- * correctly report a key is expired on slaves even if the master is lagging
- * expiring our key via DELs in the replication link. */
-robj *lookupKeyReadWithFlags(redisDb *db, robj *key, int flags) {
-    robj *val;
-
-    if (expireIfNeeded(db,key) == 1) {
-        /* If we are in the context of a master, expireIfNeeded() returns 1
-         * when the key is no longer valid, so we can return NULL ASAP. */
-        if (server.masterhost == NULL)
-            goto keymiss;
-
-        /* However if we are in the context of a slave, expireIfNeeded() will
-         * not really try to expire the key, it only returns information
-         * about the "logical" status of the key: key expiring is up to the
-         * master in order to have a consistent view of master's data set.
-         *
-         * However, if the command caller is not the master, and as additional
-         * safety measure, the command invoked is a read-only command, we can
-         * safely return NULL here, and provide a more consistent behavior
-         * to clients accessing expired values in a read-only fashion, that
-         * will say the key as non existing.
-         *
-         * Notably this covers GETs when slaves are used to scale reads. */
-        if (server.current_client &&
-            server.current_client != server.master &&
-            server.current_client->cmd &&
-            server.current_client->cmd->flags & CMD_READONLY)
-        {
-            goto keymiss;
-        }
-    }
-    val = lookupKey(db,key,flags);
-    if (val == NULL)
-        goto keymiss;
-    server.stat_keyspace_hits++;
-    return val;
-
-keymiss:
-    if (!(flags & LOOKUP_NONOTIFY)) {
-        notifyKeyspaceEvent(NOTIFY_KEY_MISS, "keymiss", key, db->id);
-    }
-    server.stat_keyspace_misses++;
-    return NULL;
-}
-
-/* Like lookupKeyReadWithFlags(), but does not use any flag, which is the
- * common case. */
-robj *lookupKeyRead(redisDb *db, robj *key) {
-    return lookupKeyReadWithFlags(db,key,LOOKUP_NONE);
-}
-
-/* Lookup a key for write operations, and as a side effect, if needed, expires
- * the key if its TTL is reached.
- *
- * Returns the linked value object if the key exists or NULL if the key
- * does not exist in the specified DB. */
-robj *lookupKeyWriteWithFlags(redisDb *db, robj *key, int flags) {
-    expireIfNeeded(db,key);
-    return lookupKey(db,key,flags);
-}
-
-robj *lookupKeyWrite(redisDb *db, robj *key) {
-    return lookupKeyWriteWithFlags(db, key, LOOKUP_NONE);
-}
-void SentReplyOnKeyMiss(client *c, robj *reply){
-    serverAssert(sdsEncodedObject(reply));
-    sds rep = reply->ptr;
-    if (sdslen(rep) > 1 && rep[0] == '-'){
-        addReplyErrorObject(c, reply);
-    } else {
-        addReply(c,reply);
-    }
-}
-robj *lookupKeyReadOrReply(client *c, robj *key, robj *reply) {
-    robj *o = lookupKeyRead(c->db, key);
-    if (!o) SentReplyOnKeyMiss(c, reply);
-    return o;
-}
-
-robj *lookupKeyWriteOrReply(client *c, robj *key, robj *reply) {
-    robj *o = lookupKeyWrite(c->db, key);
-    if (!o) SentReplyOnKeyMiss(c, reply);
-    return o;
-}
-
-/* Add the key to the DB. It's up to the caller to increment the reference
- * counter of the value if needed.
- *
- * The program is aborted if the key already exists. */
-void dbAdd(redisDb *db, robj *key, robj *val) {
-    sds copy = sdsdup(key->ptr);
-    int retval = dictAdd(db->dict, copy, val);
-
-    serverAssertWithInfo(NULL,key,retval == DICT_OK);
-    signalKeyAsReady(db, key, val->type);
-    if (server.cluster_enabled) slotToKeyAdd(key->ptr);
-}
-
-/* This is a special version of dbAdd() that is used only when loading
- * keys from the RDB file: the key is passed as an SDS string that is
- * retained by the function (and not freed by the caller).
- *
- * Moreover this function will not abort if the key is already busy, to
- * give more control to the caller, nor will signal the key as ready
- * since it is not useful in this context.
- *
- * The function returns 1 if the key was added to the database, taking
- * ownership of the SDS string, otherwise 0 is returned, and is up to the
- * caller to free the SDS string. */
-int dbAddRDBLoad(redisDb *db, sds key, robj *val) {
-    int retval = dictAdd(db->dict, key, val);
-    if (retval != DICT_OK) return 0;
-    if (server.cluster_enabled) slotToKeyAdd(key);
-    return 1;
-}
-
-/* Overwrite an existing key with a new value. Incrementing the reference
- * count of the new value is up to the caller.
- * This function does not modify the expire time of the existing key.
- *
- * The program is aborted if the key was not already present. */
-void dbOverwrite(redisDb *db, robj *key, robj *val) {
-    dictEntry *de = dictFind(db->dict,key->ptr);
-
-    serverAssertWithInfo(NULL,key,de != NULL);
-    dictEntry auxentry = *de;
-    robj *old = dictGetVal(de);
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-        val->lru = old->lru;
-    }
-    /* Although the key is not really deleted from the database, we regard 
-    overwrite as two steps of unlink+add, so we still need to call the unlink 
-    callback of the module. */
-    moduleNotifyKeyUnlink(key,old);
-    dictSetVal(db->dict, de, val);
-
-    if (server.lazyfree_lazy_server_del) {
-        freeObjAsync(key,old);
-        dictSetVal(db->dict, &auxentry, NULL);
-    }
-
-    dictFreeVal(db->dict, &auxentry);
-}
-
-/* High level Set operation. This function can be used in order to set
- * a key, whatever it was existing or not, to a new object.
- *
- * 1) The ref count of the value object is incremented.
- * 2) clients WATCHing for the destination key notified.
- * 3) The expire time of the key is reset (the key is made persistent),
- *    unless 'keepttl' is true.
- *
- * All the new keys in the database should be created via this interface.
- * The client 'c' argument may be set to NULL if the operation is performed
- * in a context where there is no clear client performing the operation. */
-void genericSetKey(client *c, redisDb *db, robj *key, robj *val, int keepttl, int signal) {
-    if (lookupKeyWrite(db,key) == NULL) {
-        dbAdd(db,key,val);
-    } else {
-        dbOverwrite(db,key,val);
-    }
-    incrRefCount(val);
-    if (!keepttl) removeExpire(db,key);
-    if (signal) signalModifiedKey(c,db,key);
-}
-
-/* Common case for genericSetKey() where the TTL is not retained. */
-void setKey(client *c, redisDb *db, robj *key, robj *val) {
-    genericSetKey(c,db,key,val,0,1);
-}
-
-/* Return a random key, in form of a Redis object.
- * If there are no keys, NULL is returned.
- *
- * The function makes sure to return keys not already expired. */
-robj *dbRandomKey(redisDb *db) {
-    dictEntry *de;
-    int maxtries = 100;
-    int allvolatile = dictSize(db->dict) == dictSize(db->expires);
-
-    while(1) {
-        sds key;
-        robj *keyobj;
-
-        de = dictGetFairRandomKey(db->dict);
-        if (de == NULL) return NULL;
-
-        key = dictGetKey(de);
-        keyobj = createStringObject(key,sdslen(key));
-        if (dictFind(db->expires,key)) {
-            if (allvolatile && server.masterhost && --maxtries == 0) {
-                /* If the DB is composed only of keys with an expire set,
-                 * it could happen that all the keys are already logically
-                 * expired in the slave, so the function cannot stop because
-                 * expireIfNeeded() is false, nor it can stop because
-                 * dictGetRandomKey() returns NULL (there are keys to return).
-                 * To prevent the infinite loop we do some tries, but if there
-                 * are the conditions for an infinite loop, eventually we
-                 * return a key name that may be already expired. */
-                return keyobj;
-            }
-            if (expireIfNeeded(db,keyobj)) {
-                decrRefCount(keyobj);
-                continue; /* search for another key. This expired. */
-            }
-        }
-        return keyobj;
-    }
-}
-
-/* Delete a key, value, and associated expiration entry if any, from the DB */
-int dbSyncDelete(redisDb *db, robj *key) {
-    /* Deleting an entry from the expires dict will not free the sds of
-     * the key, because it is shared with the main dictionary. */
-    if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr);
-    dictEntry *de = dictUnlink(db->dict,key->ptr);
-    if (de) {
-        robj *val = dictGetVal(de);
-        /* Tells the module that the key has been unlinked from the database. */
-        moduleNotifyKeyUnlink(key,val);
-        dictFreeUnlinkedEntry(db->dict,de);
-        if (server.cluster_enabled) slotToKeyDel(key->ptr);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* This is a wrapper whose behavior depends on the Redis lazy free
- * configuration. Deletes the key synchronously or asynchronously. */
-int dbDelete(redisDb *db, robj *key) {
-    return server.lazyfree_lazy_server_del ? dbAsyncDelete(db,key) :
-                                             dbSyncDelete(db,key);
-}
-
-/* Prepare the string object stored at 'key' to be modified destructively
- * to implement commands like SETBIT or APPEND.
- *
- * An object is usually ready to be modified unless one of the two conditions
- * are true:
- *
- * 1) The object 'o' is shared (refcount > 1), we don't want to affect
- *    other users.
- * 2) The object encoding is not "RAW".
- *
- * If the object is found in one of the above conditions (or both) by the
- * function, an unshared / not-encoded copy of the string object is stored
- * at 'key' in the specified 'db'. Otherwise the object 'o' itself is
- * returned.
- *
- * USAGE:
- *
- * The object 'o' is what the caller already obtained by looking up 'key'
- * in 'db', the usage pattern looks like this:
- *
- * o = lookupKeyWrite(db,key);
- * if (checkType(c,o,OBJ_STRING)) return;
- * o = dbUnshareStringValue(db,key,o);
- *
- * At this point the caller is ready to modify the object, for example
- * using an sdscat() call to append some data, or anything else.
- */
-robj *dbUnshareStringValue(redisDb *db, robj *key, robj *o) {
-    serverAssert(o->type == OBJ_STRING);
-    if (o->refcount != 1 || o->encoding != OBJ_ENCODING_RAW) {
-        robj *decoded = getDecodedObject(o);
-        o = createRawStringObject(decoded->ptr, sdslen(decoded->ptr));
-        decrRefCount(decoded);
-        dbOverwrite(db,key,o);
-    }
-    return o;
-}
-
-/* Remove all keys from the database(s) structure. The dbarray argument
- * may not be the server main DBs (could be a backup).
- *
- * The dbnum can be -1 if all the DBs should be emptied, or the specified
- * DB index if we want to empty only a single database.
- * The function returns the number of keys removed from the database(s). */
-long long emptyDbStructure(redisDb *dbarray, int dbnum, int async,
-                           void(callback)(void*))
-{
-    long long removed = 0;
-    int startdb, enddb;
-
-    if (dbnum == -1) {
-        startdb = 0;
-        enddb = server.dbnum-1;
-    } else {
-        startdb = enddb = dbnum;
-    }
-
-    for (int j = startdb; j <= enddb; j++) {
-        removed += dictSize(dbarray[j].dict);
-        if (async) {
-            emptyDbAsync(&dbarray[j]);
-        } else {
-            dictEmpty(dbarray[j].dict,callback);
-            dictEmpty(dbarray[j].expires,callback);
-        }
-        /* Because all keys of database are removed, reset average ttl. */
-        dbarray[j].avg_ttl = 0;
-        dbarray[j].expires_cursor = 0;
-    }
-
-    return removed;
-}
-
-/* Remove all keys from all the databases in a Redis server.
- * If callback is given the function is called from time to time to
- * signal that work is in progress.
- *
- * The dbnum can be -1 if all the DBs should be flushed, or the specified
- * DB number if we want to flush only a single Redis database number.
- *
- * Flags are be EMPTYDB_NO_FLAGS if no special flags are specified or
- * EMPTYDB_ASYNC if we want the memory to be freed in a different thread
- * and the function to return ASAP.
- *
- * On success the function returns the number of keys removed from the
- * database(s). Otherwise -1 is returned in the specific case the
- * DB number is out of range, and errno is set to EINVAL. */
-long long emptyDb(int dbnum, int flags, void(callback)(void*)) {
-    int async = (flags & EMPTYDB_ASYNC);
-    RedisModuleFlushInfoV1 fi = {REDISMODULE_FLUSHINFO_VERSION,!async,dbnum};
-    long long removed = 0;
-
-    if (dbnum < -1 || dbnum >= server.dbnum) {
-        errno = EINVAL;
-        return -1;
-    }
-
-    /* Fire the flushdb modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_FLUSHDB,
-                          REDISMODULE_SUBEVENT_FLUSHDB_START,
-                          &fi);
-
-    /* Make sure the WATCHed keys are affected by the FLUSH* commands.
-     * Note that we need to call the function while the keys are still
-     * there. */
-    signalFlushedDb(dbnum, async);
-
-    /* Empty redis database structure. */
-    removed = emptyDbStructure(server.db, dbnum, async, callback);
-
-    /* Flush slots to keys map if enable cluster, we can flush entire
-     * slots to keys map whatever dbnum because only support one DB
-     * in cluster mode. */
-    if (server.cluster_enabled) slotToKeyFlush(async);
-
-    if (dbnum == -1) flushSlaveKeysWithExpireList();
-
-    /* Also fire the end event. Note that this event will fire almost
-     * immediately after the start event if the flush is asynchronous. */
-    moduleFireServerEvent(REDISMODULE_EVENT_FLUSHDB,
-                          REDISMODULE_SUBEVENT_FLUSHDB_END,
-                          &fi);
-
-    return removed;
-}
-
-/* Store a backup of the database for later use, and put an empty one
- * instead of it. */
-dbBackup *backupDb(void) {
-    dbBackup *backup = zmalloc(sizeof(dbBackup));
-
-    /* Backup main DBs. */
-    backup->dbarray = zmalloc(sizeof(redisDb)*server.dbnum);
-    for (int i=0; i<server.dbnum; i++) {
-        backup->dbarray[i] = server.db[i];
-        server.db[i].dict = dictCreate(&dbDictType,NULL);
-        server.db[i].expires = dictCreate(&dbExpiresDictType,NULL);
-    }
-
-    /* Backup cluster slots to keys map if enable cluster. */
-    if (server.cluster_enabled) {
-        backup->slots_to_keys = server.cluster->slots_to_keys;
-        memcpy(backup->slots_keys_count, server.cluster->slots_keys_count,
-            sizeof(server.cluster->slots_keys_count));
-        server.cluster->slots_to_keys = raxNew();
-        memset(server.cluster->slots_keys_count, 0,
-            sizeof(server.cluster->slots_keys_count));
-    }
-
-    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
-                          REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE,
-                          NULL);
-
-    return backup;
-}
-
-/* Discard a previously created backup, this can be slow (similar to FLUSHALL)
- * Arguments are similar to the ones of emptyDb, see EMPTYDB_ flags. */
-void discardDbBackup(dbBackup *buckup, int flags, void(callback)(void*)) {
-    int async = (flags & EMPTYDB_ASYNC);
-
-    /* Release main DBs backup . */
-    emptyDbStructure(buckup->dbarray, -1, async, callback);
-    for (int i=0; i<server.dbnum; i++) {
-        dictRelease(buckup->dbarray[i].dict);
-        dictRelease(buckup->dbarray[i].expires);
-    }
-
-    /* Release slots to keys map backup if enable cluster. */
-    if (server.cluster_enabled) freeSlotsToKeysMap(buckup->slots_to_keys, async);
-
-    /* Release buckup. */
-    zfree(buckup->dbarray);
-    zfree(buckup);
-
-    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
-                          REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD,
-                          NULL);
-}
-
-/* Restore the previously created backup (discarding what currently resides
- * in the db).
- * This function should be called after the current contents of the database
- * was emptied with a previous call to emptyDb (possibly using the async mode). */
-void restoreDbBackup(dbBackup *buckup) {
-    /* Restore main DBs. */
-    for (int i=0; i<server.dbnum; i++) {
-        serverAssert(dictSize(server.db[i].dict) == 0);
-        serverAssert(dictSize(server.db[i].expires) == 0);
-        dictRelease(server.db[i].dict);
-        dictRelease(server.db[i].expires);
-        server.db[i] = buckup->dbarray[i];
-    }
-
-    /* Restore slots to keys map backup if enable cluster. */
-    if (server.cluster_enabled) {
-        serverAssert(server.cluster->slots_to_keys->numele == 0);
-        raxFree(server.cluster->slots_to_keys);
-        server.cluster->slots_to_keys = buckup->slots_to_keys;
-        memcpy(server.cluster->slots_keys_count, buckup->slots_keys_count,
-                sizeof(server.cluster->slots_keys_count));
-    }
-
-    /* Release buckup. */
-    zfree(buckup->dbarray);
-    zfree(buckup);
-
-    moduleFireServerEvent(REDISMODULE_EVENT_REPL_BACKUP,
-                          REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE,
-                          NULL);
-}
-
-int selectDb(client *c, int id) {
-    if (id < 0 || id >= server.dbnum)
-        return C_ERR;
-    c->db = &server.db[id];
-    return C_OK;
-}
-
-long long dbTotalServerKeyCount() {
-    long long total = 0;
-    int j;
-    for (j = 0; j < server.dbnum; j++) {
-        total += dictSize(server.db[j].dict);
-    }
-    return total;
-}
-
-/*-----------------------------------------------------------------------------
- * Hooks for key space changes.
- *
- * Every time a key in the database is modified the function
- * signalModifiedKey() is called.
- *
- * Every time a DB is flushed the function signalFlushDb() is called.
- *----------------------------------------------------------------------------*/
-
-/* Note that the 'c' argument may be NULL if the key was modified out of
- * a context of a client. */
-void signalModifiedKey(client *c, redisDb *db, robj *key) {
-    touchWatchedKey(db,key);
-    trackingInvalidateKey(c,key);
-}
-
-void signalFlushedDb(int dbid, int async) {
-    int startdb, enddb;
-    if (dbid == -1) {
-        startdb = 0;
-        enddb = server.dbnum-1;
-    } else {
-        startdb = enddb = dbid;
-    }
-
-    for (int j = startdb; j <= enddb; j++) {
-        touchAllWatchedKeysInDb(&server.db[j], NULL);
-    }
-
-    trackingInvalidateKeysOnFlush(async);
-}
-
-/*-----------------------------------------------------------------------------
- * Type agnostic commands operating on the key space
- *----------------------------------------------------------------------------*/
-
-/* Return the set of flags to use for the emptyDb() call for FLUSHALL
- * and FLUSHDB commands.
- *
- * sync: flushes the database in an sync manner.
- * async: flushes the database in an async manner.
- * no option: determine sync or async according to the value of lazyfree-lazy-user-flush.
- *
- * On success C_OK is returned and the flags are stored in *flags, otherwise
- * C_ERR is returned and the function sends an error to the client. */
-int getFlushCommandFlags(client *c, int *flags) {
-    /* Parse the optional ASYNC option. */
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"sync")) {
-        *flags = EMPTYDB_NO_FLAGS;
-    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"async")) {
-        *flags = EMPTYDB_ASYNC;
-    } else if (c->argc == 1) {
-        *flags = server.lazyfree_lazy_user_flush ? EMPTYDB_ASYNC : EMPTYDB_NO_FLAGS;
-    } else {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-/* Flushes the whole server data set. */
-void flushAllDataAndResetRDB(int flags) {
-    server.dirty += emptyDb(-1,flags,NULL);
-    if (server.child_type == CHILD_TYPE_RDB) killRDBChild();
-    if (server.saveparamslen > 0) {
-        /* Normally rdbSave() will reset dirty, but we don't want this here
-         * as otherwise FLUSHALL will not be replicated nor put into the AOF. */
-        int saved_dirty = server.dirty;
-        rdbSaveInfo rsi, *rsiptr;
-        rsiptr = rdbPopulateSaveInfo(&rsi);
-        rdbSave(server.rdb_filename,rsiptr);
-        server.dirty = saved_dirty;
-    }
-
-    /* Without that extra dirty++, when db was already empty, FLUSHALL will
-     * not be replicated nor put into the AOF. */
-    server.dirty++;
-#if defined(USE_JEMALLOC)
-    /* jemalloc 5 doesn't release pages back to the OS when there's no traffic.
-     * for large databases, flushdb blocks for long anyway, so a bit more won't
-     * harm and this way the flush and purge will be synchroneus. */
-    if (!(flags & EMPTYDB_ASYNC))
-        jemalloc_purge();
-#endif
-}
-
-/* FLUSHDB [ASYNC]
- *
- * Flushes the currently SELECTed Redis DB. */
-void flushdbCommand(client *c) {
-    int flags;
-
-    if (getFlushCommandFlags(c,&flags) == C_ERR) return;
-    server.dirty += emptyDb(c->db->id,flags,NULL);
-    addReply(c,shared.ok);
-#if defined(USE_JEMALLOC)
-    /* jemalloc 5 doesn't release pages back to the OS when there's no traffic.
-     * for large databases, flushdb blocks for long anyway, so a bit more won't
-     * harm and this way the flush and purge will be synchroneus. */
-    if (!(flags & EMPTYDB_ASYNC))
-        jemalloc_purge();
-#endif
-}
-
-/* FLUSHALL [ASYNC]
- *
- * Flushes the whole server data set. */
-void flushallCommand(client *c) {
-    int flags;
-    if (getFlushCommandFlags(c,&flags) == C_ERR) return;
-    flushAllDataAndResetRDB(flags);
-    addReply(c,shared.ok);
-}
-
-/* This command implements DEL and LAZYDEL. */
-void delGenericCommand(client *c, int lazy) {
-    int numdel = 0, j;
-
-    for (j = 1; j < c->argc; j++) {
-        expireIfNeeded(c->db,c->argv[j]);
-        int deleted  = lazy ? dbAsyncDelete(c->db,c->argv[j]) :
-                              dbSyncDelete(c->db,c->argv[j]);
-        if (deleted) {
-            signalModifiedKey(c,c->db,c->argv[j]);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,
-                "del",c->argv[j],c->db->id);
-            server.dirty++;
-            numdel++;
-        }
-    }
-    addReplyLongLong(c,numdel);
-}
-
-void delCommand(client *c) {
-    delGenericCommand(c,server.lazyfree_lazy_user_del);
-}
-
-void unlinkCommand(client *c) {
-    delGenericCommand(c,1);
-}
-
-/* EXISTS key1 key2 ... key_N.
- * Return value is the number of keys existing. */
-void existsCommand(client *c) {
-    long long count = 0;
-    int j;
-
-    for (j = 1; j < c->argc; j++) {
-        if (lookupKeyReadWithFlags(c->db,c->argv[j],LOOKUP_NOTOUCH)) count++;
-    }
-    addReplyLongLong(c,count);
-}
-
-void selectCommand(client *c) {
-    int id;
-
-    if (getIntFromObjectOrReply(c, c->argv[1], &id, NULL) != C_OK)
-        return;
-
-    if (server.cluster_enabled && id != 0) {
-        addReplyError(c,"SELECT is not allowed in cluster mode");
-        return;
-    }
-    if (selectDb(c,id) == C_ERR) {
-        addReplyError(c,"DB index is out of range");
-    } else {
-        addReply(c,shared.ok);
-    }
-}
-
-void randomkeyCommand(client *c) {
-    robj *key;
-
-    if ((key = dbRandomKey(c->db)) == NULL) {
-        addReplyNull(c);
-        return;
-    }
-
-    addReplyBulk(c,key);
-    decrRefCount(key);
-}
-
-void keysCommand(client *c) {
-    dictIterator *di;
-    dictEntry *de;
-    sds pattern = c->argv[1]->ptr;
-    int plen = sdslen(pattern), allkeys;
-    unsigned long numkeys = 0;
-    void *replylen = addReplyDeferredLen(c);
-
-    di = dictGetSafeIterator(c->db->dict);
-    allkeys = (pattern[0] == '*' && plen == 1);
-    while((de = dictNext(di)) != NULL) {
-        sds key = dictGetKey(de);
-        robj *keyobj;
-
-        if (allkeys || stringmatchlen(pattern,plen,key,sdslen(key),0)) {
-            keyobj = createStringObject(key,sdslen(key));
-            if (!keyIsExpired(c->db,keyobj)) {
-                addReplyBulk(c,keyobj);
-                numkeys++;
-            }
-            decrRefCount(keyobj);
-        }
-    }
-    dictReleaseIterator(di);
-    setDeferredArrayLen(c,replylen,numkeys);
-}
-
-/* This callback is used by scanGenericCommand in order to collect elements
- * returned by the dictionary iterator into a list. */
-void scanCallback(void *privdata, const dictEntry *de) {
-    void **pd = (void**) privdata;
-    list *keys = pd[0];
-    robj *o = pd[1];
-    robj *key, *val = NULL;
-
-    if (o == NULL) {
-        sds sdskey = dictGetKey(de);
-        key = createStringObject(sdskey, sdslen(sdskey));
-    } else if (o->type == OBJ_SET) {
-        sds keysds = dictGetKey(de);
-        key = createStringObject(keysds,sdslen(keysds));
-    } else if (o->type == OBJ_HASH) {
-        sds sdskey = dictGetKey(de);
-        sds sdsval = dictGetVal(de);
-        key = createStringObject(sdskey,sdslen(sdskey));
-        val = createStringObject(sdsval,sdslen(sdsval));
-    } else if (o->type == OBJ_ZSET) {
-        sds sdskey = dictGetKey(de);
-        key = createStringObject(sdskey,sdslen(sdskey));
-        val = createStringObjectFromLongDouble(*(double*)dictGetVal(de),0);
-    } else {
-        serverPanic("Type not handled in SCAN callback.");
-    }
-
-    listAddNodeTail(keys, key);
-    if (val) listAddNodeTail(keys, val);
-}
-
-/* Try to parse a SCAN cursor stored at object 'o':
- * if the cursor is valid, store it as unsigned integer into *cursor and
- * returns C_OK. Otherwise return C_ERR and send an error to the
- * client. */
-int parseScanCursorOrReply(client *c, robj *o, unsigned long *cursor) {
-    char *eptr;
-
-    /* Use strtoul() because we need an *unsigned* long, so
-     * getLongLongFromObject() does not cover the whole cursor space. */
-    errno = 0;
-    *cursor = strtoul(o->ptr, &eptr, 10);
-    if (isspace(((char*)o->ptr)[0]) || eptr[0] != '\0' || errno == ERANGE)
-    {
-        addReplyError(c, "invalid cursor");
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-/* This command implements SCAN, HSCAN and SSCAN commands.
- * If object 'o' is passed, then it must be a Hash, Set or Zset object, otherwise
- * if 'o' is NULL the command will operate on the dictionary associated with
- * the current database.
- *
- * When 'o' is not NULL the function assumes that the first argument in
- * the client arguments vector is a key so it skips it before iterating
- * in order to parse options.
- *
- * In the case of a Hash object the function returns both the field and value
- * of every element on the Hash. */
-void scanGenericCommand(client *c, robj *o, unsigned long cursor) {
-    int i, j;
-    list *keys = listCreate();
-    listNode *node, *nextnode;
-    long count = 10;
-    sds pat = NULL;
-    sds typename = NULL;
-    int patlen = 0, use_pattern = 0;
-    dict *ht;
-
-    /* Object must be NULL (to iterate keys names), or the type of the object
-     * must be Set, Sorted Set, or Hash. */
-    serverAssert(o == NULL || o->type == OBJ_SET || o->type == OBJ_HASH ||
-                o->type == OBJ_ZSET);
-
-    /* Set i to the first option argument. The previous one is the cursor. */
-    i = (o == NULL) ? 2 : 3; /* Skip the key argument if needed. */
-
-    /* Step 1: Parse options. */
-    while (i < c->argc) {
-        j = c->argc - i;
-        if (!strcasecmp(c->argv[i]->ptr, "count") && j >= 2) {
-            if (getLongFromObjectOrReply(c, c->argv[i+1], &count, NULL)
-                != C_OK)
-            {
-                goto cleanup;
-            }
-
-            if (count < 1) {
-                addReplyErrorObject(c,shared.syntaxerr);
-                goto cleanup;
-            }
-
-            i += 2;
-        } else if (!strcasecmp(c->argv[i]->ptr, "match") && j >= 2) {
-            pat = c->argv[i+1]->ptr;
-            patlen = sdslen(pat);
-
-            /* The pattern always matches if it is exactly "*", so it is
-             * equivalent to disabling it. */
-            use_pattern = !(pat[0] == '*' && patlen == 1);
-
-            i += 2;
-        } else if (!strcasecmp(c->argv[i]->ptr, "type") && o == NULL && j >= 2) {
-            /* SCAN for a particular type only applies to the db dict */
-            typename = c->argv[i+1]->ptr;
-            i+= 2;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            goto cleanup;
-        }
-    }
-
-    /* Step 2: Iterate the collection.
-     *
-     * Note that if the object is encoded with a ziplist, intset, or any other
-     * representation that is not a hash table, we are sure that it is also
-     * composed of a small number of elements. So to avoid taking state we
-     * just return everything inside the object in a single call, setting the
-     * cursor to zero to signal the end of the iteration. */
-
-    /* Handle the case of a hash table. */
-    ht = NULL;
-    if (o == NULL) {
-        ht = c->db->dict;
-    } else if (o->type == OBJ_SET && o->encoding == OBJ_ENCODING_HT) {
-        ht = o->ptr;
-    } else if (o->type == OBJ_HASH && o->encoding == OBJ_ENCODING_HT) {
-        ht = o->ptr;
-        count *= 2; /* We return key / value for this type. */
-    } else if (o->type == OBJ_ZSET && o->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = o->ptr;
-        ht = zs->dict;
-        count *= 2; /* We return key / value for this type. */
-    }
-
-    if (ht) {
-        void *privdata[2];
-        /* We set the max number of iterations to ten times the specified
-         * COUNT, so if the hash table is in a pathological state (very
-         * sparsely populated) we avoid to block too much time at the cost
-         * of returning no or very few elements. */
-        long maxiterations = count*10;
-
-        /* We pass two pointers to the callback: the list to which it will
-         * add new elements, and the object containing the dictionary so that
-         * it is possible to fetch more data in a type-dependent way. */
-        privdata[0] = keys;
-        privdata[1] = o;
-        do {
-            cursor = dictScan(ht, cursor, scanCallback, NULL, privdata);
-        } while (cursor &&
-              maxiterations-- &&
-              listLength(keys) < (unsigned long)count);
-    } else if (o->type == OBJ_SET) {
-        int pos = 0;
-        int64_t ll;
-
-        while(intsetGet(o->ptr,pos++,&ll))
-            listAddNodeTail(keys,createStringObjectFromLongLong(ll));
-        cursor = 0;
-    } else if (o->type == OBJ_HASH || o->type == OBJ_ZSET) {
-        unsigned char *p = ziplistIndex(o->ptr,0);
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vll;
-
-        while(p) {
-            ziplistGet(p,&vstr,&vlen,&vll);
-            listAddNodeTail(keys,
-                (vstr != NULL) ? createStringObject((char*)vstr,vlen) :
-                                 createStringObjectFromLongLong(vll));
-            p = ziplistNext(o->ptr,p);
-        }
-        cursor = 0;
-    } else {
-        serverPanic("Not handled encoding in SCAN.");
-    }
-
-    /* Step 3: Filter elements. */
-    node = listFirst(keys);
-    while (node) {
-        robj *kobj = listNodeValue(node);
-        nextnode = listNextNode(node);
-        int filter = 0;
-
-        /* Filter element if it does not match the pattern. */
-        if (use_pattern) {
-            if (sdsEncodedObject(kobj)) {
-                if (!stringmatchlen(pat, patlen, kobj->ptr, sdslen(kobj->ptr), 0))
-                    filter = 1;
-            } else {
-                char buf[LONG_STR_SIZE];
-                int len;
-
-                serverAssert(kobj->encoding == OBJ_ENCODING_INT);
-                len = ll2string(buf,sizeof(buf),(long)kobj->ptr);
-                if (!stringmatchlen(pat, patlen, buf, len, 0)) filter = 1;
-            }
-        }
-
-        /* Filter an element if it isn't the type we want. */
-        if (!filter && o == NULL && typename){
-            robj* typecheck = lookupKeyReadWithFlags(c->db, kobj, LOOKUP_NOTOUCH);
-            char* type = getObjectTypeName(typecheck);
-            if (strcasecmp((char*) typename, type)) filter = 1;
-        }
-
-        /* Filter element if it is an expired key. */
-        if (!filter && o == NULL && expireIfNeeded(c->db, kobj)) filter = 1;
-
-        /* Remove the element and its associated value if needed. */
-        if (filter) {
-            decrRefCount(kobj);
-            listDelNode(keys, node);
-        }
-
-        /* If this is a hash or a sorted set, we have a flat list of
-         * key-value elements, so if this element was filtered, remove the
-         * value, or skip it if it was not filtered: we only match keys. */
-        if (o && (o->type == OBJ_ZSET || o->type == OBJ_HASH)) {
-            node = nextnode;
-            serverAssert(node); /* assertion for valgrind (avoid NPD) */
-            nextnode = listNextNode(node);
-            if (filter) {
-                kobj = listNodeValue(node);
-                decrRefCount(kobj);
-                listDelNode(keys, node);
-            }
-        }
-        node = nextnode;
-    }
-
-    /* Step 4: Reply to the client. */
-    addReplyArrayLen(c, 2);
-    addReplyBulkLongLong(c,cursor);
-
-    addReplyArrayLen(c, listLength(keys));
-    while ((node = listFirst(keys)) != NULL) {
-        robj *kobj = listNodeValue(node);
-        addReplyBulk(c, kobj);
-        decrRefCount(kobj);
-        listDelNode(keys, node);
-    }
-
-cleanup:
-    listSetFreeMethod(keys,decrRefCountVoid);
-    listRelease(keys);
-}
-
-/* The SCAN command completely relies on scanGenericCommand. */
-void scanCommand(client *c) {
-    unsigned long cursor;
-    if (parseScanCursorOrReply(c,c->argv[1],&cursor) == C_ERR) return;
-    scanGenericCommand(c,NULL,cursor);
-}
-
-void dbsizeCommand(client *c) {
-    addReplyLongLong(c,dictSize(c->db->dict));
-}
-
-void lastsaveCommand(client *c) {
-    addReplyLongLong(c,server.lastsave);
-}
-
-char* getObjectTypeName(robj *o) {
-    char* type;
-    if (o == NULL) {
-        type = "none";
-    } else {
-        switch(o->type) {
-        case OBJ_STRING: type = "string"; break;
-        case OBJ_LIST: type = "list"; break;
-        case OBJ_SET: type = "set"; break;
-        case OBJ_ZSET: type = "zset"; break;
-        case OBJ_HASH: type = "hash"; break;
-        case OBJ_STREAM: type = "stream"; break;
-        case OBJ_MODULE: {
-            moduleValue *mv = o->ptr;
-            type = mv->type->name;
-        }; break;
-        default: type = "unknown"; break;
-        }
-    }
-    return type;
-}
-
-void typeCommand(client *c) {
-    robj *o;
-    o = lookupKeyReadWithFlags(c->db,c->argv[1],LOOKUP_NOTOUCH);
-    addReplyStatus(c, getObjectTypeName(o));
-}
-
-void shutdownCommand(client *c) {
-    int flags = 0;
-
-    if (c->argc > 2) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    } else if (c->argc == 2) {
-        if (!strcasecmp(c->argv[1]->ptr,"nosave")) {
-            flags |= SHUTDOWN_NOSAVE;
-        } else if (!strcasecmp(c->argv[1]->ptr,"save")) {
-            flags |= SHUTDOWN_SAVE;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-    if (prepareForShutdown(flags) == C_OK) exit(0);
-    addReplyError(c,"Errors trying to SHUTDOWN. Check logs.");
-}
-
-void renameGenericCommand(client *c, int nx) {
-    robj *o;
-    long long expire;
-    int samekey = 0;
-
-    /* When source and dest key is the same, no operation is performed,
-     * if the key exists, however we still return an error on unexisting key. */
-    if (sdscmp(c->argv[1]->ptr,c->argv[2]->ptr) == 0) samekey = 1;
-
-    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr)) == NULL)
-        return;
-
-    if (samekey) {
-        addReply(c,nx ? shared.czero : shared.ok);
-        return;
-    }
-
-    incrRefCount(o);
-    expire = getExpire(c->db,c->argv[1]);
-    if (lookupKeyWrite(c->db,c->argv[2]) != NULL) {
-        if (nx) {
-            decrRefCount(o);
-            addReply(c,shared.czero);
-            return;
-        }
-        /* Overwrite: delete the old key before creating the new one
-         * with the same name. */
-        dbDelete(c->db,c->argv[2]);
-    }
-    dbAdd(c->db,c->argv[2],o);
-    if (expire != -1) setExpire(c,c->db,c->argv[2],expire);
-    dbDelete(c->db,c->argv[1]);
-    signalModifiedKey(c,c->db,c->argv[1]);
-    signalModifiedKey(c,c->db,c->argv[2]);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,"rename_from",
-        c->argv[1],c->db->id);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,"rename_to",
-        c->argv[2],c->db->id);
-    server.dirty++;
-    addReply(c,nx ? shared.cone : shared.ok);
-}
-
-void renameCommand(client *c) {
-    renameGenericCommand(c,0);
-}
-
-void renamenxCommand(client *c) {
-    renameGenericCommand(c,1);
-}
-
-void moveCommand(client *c) {
-    robj *o;
-    redisDb *src, *dst;
-    int srcid, dbid;
-    long long expire;
-
-    if (server.cluster_enabled) {
-        addReplyError(c,"MOVE is not allowed in cluster mode");
-        return;
-    }
-
-    /* Obtain source and target DB pointers */
-    src = c->db;
-    srcid = c->db->id;
-
-    if (getIntFromObjectOrReply(c, c->argv[2], &dbid, NULL) != C_OK)
-        return;
-
-    if (selectDb(c,dbid) == C_ERR) {
-        addReplyError(c,"DB index is out of range");
-        return;
-    }
-    dst = c->db;
-    selectDb(c,srcid); /* Back to the source DB */
-
-    /* If the user is moving using as target the same
-     * DB as the source DB it is probably an error. */
-    if (src == dst) {
-        addReplyErrorObject(c,shared.sameobjecterr);
-        return;
-    }
-
-    /* Check if the element exists and get a reference */
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (!o) {
-        addReply(c,shared.czero);
-        return;
-    }
-    expire = getExpire(c->db,c->argv[1]);
-
-    /* Return zero if the key already exists in the target DB */
-    if (lookupKeyWrite(dst,c->argv[1]) != NULL) {
-        addReply(c,shared.czero);
-        return;
-    }
-    dbAdd(dst,c->argv[1],o);
-    if (expire != -1) setExpire(c,dst,c->argv[1],expire);
-    incrRefCount(o);
-
-    /* OK! key moved, free the entry in the source DB */
-    dbDelete(src,c->argv[1]);
-    signalModifiedKey(c,src,c->argv[1]);
-    signalModifiedKey(c,dst,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,
-                "move_from",c->argv[1],src->id);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,
-                "move_to",c->argv[1],dst->id);
-
-    server.dirty++;
-    addReply(c,shared.cone);
-}
-
-void copyCommand(client *c) {
-    robj *o;
-    redisDb *src, *dst;
-    int srcid, dbid;
-    long long expire;
-    int j, replace = 0, delete = 0;
-
-    /* Obtain source and target DB pointers 
-     * Default target DB is the same as the source DB 
-     * Parse the REPLACE option and targetDB option. */
-    src = c->db;
-    dst = c->db;
-    srcid = c->db->id;
-    dbid = c->db->id;
-    for (j = 3; j < c->argc; j++) {
-        int additional = c->argc - j - 1;
-        if (!strcasecmp(c->argv[j]->ptr,"replace")) {
-            replace = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr, "db") && additional >= 1) {
-            if (getIntFromObjectOrReply(c, c->argv[j+1], &dbid, NULL) != C_OK)
-                return;
-
-            if (selectDb(c, dbid) == C_ERR) {
-                addReplyError(c,"DB index is out of range");
-                return;
-            }
-            dst = c->db;
-            selectDb(c,srcid); /* Back to the source DB */
-            j++; /* Consume additional arg. */
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    if ((server.cluster_enabled == 1) && (srcid != 0 || dbid != 0)) {
-        addReplyError(c,"Copying to another database is not allowed in cluster mode");
-        return;
-    }
-
-    /* If the user select the same DB as
-     * the source DB and using newkey as the same key
-     * it is probably an error. */
-    robj *key = c->argv[1];
-    robj *newkey = c->argv[2];
-    if (src == dst && (sdscmp(key->ptr, newkey->ptr) == 0)) {
-        addReplyErrorObject(c,shared.sameobjecterr);
-        return;
-    }
-
-    /* Check if the element exists and get a reference */
-    o = lookupKeyWrite(c->db, key);
-    if (!o) {
-        addReply(c,shared.czero);
-        return;
-    }
-    expire = getExpire(c->db,key);
-
-    /* Return zero if the key already exists in the target DB. 
-     * If REPLACE option is selected, delete newkey from targetDB. */
-    if (lookupKeyWrite(dst,newkey) != NULL) {
-        if (replace) {
-            delete = 1;
-        } else {
-            addReply(c,shared.czero);
-            return;
-        }
-    }
-
-    /* Duplicate object according to object's type. */
-    robj *newobj;
-    switch(o->type) {
-        case OBJ_STRING: newobj = dupStringObject(o); break;
-        case OBJ_LIST: newobj = listTypeDup(o); break;
-        case OBJ_SET: newobj = setTypeDup(o); break;
-        case OBJ_ZSET: newobj = zsetDup(o); break;
-        case OBJ_HASH: newobj = hashTypeDup(o); break;
-        case OBJ_STREAM: newobj = streamDup(o); break;
-        case OBJ_MODULE:
-            newobj = moduleTypeDupOrReply(c, key, newkey, o);
-            if (!newobj) return;
-            break;
-        default:
-            addReplyError(c, "unknown type object");
-            return;
-    }
-
-    if (delete) {
-        dbDelete(dst,newkey);
-    }
-
-    dbAdd(dst,newkey,newobj);
-    if (expire != -1) setExpire(c, dst, newkey, expire);
-
-    /* OK! key copied */
-    signalModifiedKey(c,dst,c->argv[2]);
-    notifyKeyspaceEvent(NOTIFY_GENERIC,"copy_to",c->argv[2],dst->id);
-
-    server.dirty++;
-    addReply(c,shared.cone);
-}
-
-/* Helper function for dbSwapDatabases(): scans the list of keys that have
- * one or more blocked clients for B[LR]POP or other blocking commands
- * and signal the keys as ready if they are of the right type. See the comment
- * where the function is used for more info. */
-void scanDatabaseForReadyLists(redisDb *db) {
-    dictEntry *de;
-    dictIterator *di = dictGetSafeIterator(db->blocking_keys);
-    while((de = dictNext(di)) != NULL) {
-        robj *key = dictGetKey(de);
-        robj *value = lookupKey(db,key,LOOKUP_NOTOUCH);
-        if (value) signalKeyAsReady(db, key, value->type);
-    }
-    dictReleaseIterator(di);
-}
-
-/* Swap two databases at runtime so that all clients will magically see
- * the new database even if already connected. Note that the client
- * structure c->db points to a given DB, so we need to be smarter and
- * swap the underlying referenced structures, otherwise we would need
- * to fix all the references to the Redis DB structure.
- *
- * Returns C_ERR if at least one of the DB ids are out of range, otherwise
- * C_OK is returned. */
-int dbSwapDatabases(int id1, int id2) {
-    if (id1 < 0 || id1 >= server.dbnum ||
-        id2 < 0 || id2 >= server.dbnum) return C_ERR;
-    if (id1 == id2) return C_OK;
-    redisDb aux = server.db[id1];
-    redisDb *db1 = &server.db[id1], *db2 = &server.db[id2];
-
-    /* Swap hash tables. Note that we don't swap blocking_keys,
-     * ready_keys and watched_keys, since we want clients to
-     * remain in the same DB they were. */
-    db1->dict = db2->dict;
-    db1->expires = db2->expires;
-    db1->avg_ttl = db2->avg_ttl;
-    db1->expires_cursor = db2->expires_cursor;
-
-    db2->dict = aux.dict;
-    db2->expires = aux.expires;
-    db2->avg_ttl = aux.avg_ttl;
-    db2->expires_cursor = aux.expires_cursor;
-
-    /* Now we need to handle clients blocked on lists: as an effect
-     * of swapping the two DBs, a client that was waiting for list
-     * X in a given DB, may now actually be unblocked if X happens
-     * to exist in the new version of the DB, after the swap.
-     *
-     * However normally we only do this check for efficiency reasons
-     * in dbAdd() when a list is created. So here we need to rescan
-     * the list of clients blocked on lists and signal lists as ready
-     * if needed.
-     *
-     * Also the swapdb should make transaction fail if there is any
-     * client watching keys */
-    scanDatabaseForReadyLists(db1);
-    touchAllWatchedKeysInDb(db1, db2);
-    scanDatabaseForReadyLists(db2);
-    touchAllWatchedKeysInDb(db2, db1);
-    return C_OK;
-}
-
-/* SWAPDB db1 db2 */
-void swapdbCommand(client *c) {
-    int id1, id2;
-
-    /* Not allowed in cluster mode: we have just DB 0 there. */
-    if (server.cluster_enabled) {
-        addReplyError(c,"SWAPDB is not allowed in cluster mode");
-        return;
-    }
-
-    /* Get the two DBs indexes. */
-    if (getIntFromObjectOrReply(c, c->argv[1], &id1,
-        "invalid first DB index") != C_OK)
-        return;
-
-    if (getIntFromObjectOrReply(c, c->argv[2], &id2,
-        "invalid second DB index") != C_OK)
-        return;
-
-    /* Swap... */
-    if (dbSwapDatabases(id1,id2) == C_ERR) {
-        addReplyError(c,"DB index is out of range");
-        return;
-    } else {
-        RedisModuleSwapDbInfo si = {REDISMODULE_SWAPDBINFO_VERSION,id1,id2};
-        moduleFireServerEvent(REDISMODULE_EVENT_SWAPDB,0,&si);
-        server.dirty++;
-        addReply(c,shared.ok);
-    }
-}
-
-/*-----------------------------------------------------------------------------
- * Expires API
- *----------------------------------------------------------------------------*/
-
-int removeExpire(redisDb *db, robj *key) {
-    /* An expire may only be removed if there is a corresponding entry in the
-     * main dict. Otherwise, the key will never be freed. */
-    serverAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
-    return dictDelete(db->expires,key->ptr) == DICT_OK;
-}
-
-/* Set an expire to the specified key. If the expire is set in the context
- * of an user calling a command 'c' is the client, otherwise 'c' is set
- * to NULL. The 'when' parameter is the absolute unix time in milliseconds
- * after which the key will no longer be considered valid. */
-void setExpire(client *c, redisDb *db, robj *key, long long when) {
-    dictEntry *kde, *de;
-
-    /* Reuse the sds from the main dict in the expire dict */
-    kde = dictFind(db->dict,key->ptr);
-    serverAssertWithInfo(NULL,key,kde != NULL);
-    de = dictAddOrFind(db->expires,dictGetKey(kde));
-    dictSetSignedIntegerVal(de,when);
-
-    int writable_slave = server.masterhost && server.repl_slave_ro == 0;
-    if (c && writable_slave && !(c->flags & CLIENT_MASTER))
-        rememberSlaveKeyWithExpire(db,key);
-}
-
-/* Return the expire time of the specified key, or -1 if no expire
- * is associated with this key (i.e. the key is non volatile) */
-long long getExpire(redisDb *db, robj *key) {
-    dictEntry *de;
-
-    /* No expire? return ASAP */
-    if (dictSize(db->expires) == 0 ||
-       (de = dictFind(db->expires,key->ptr)) == NULL) return -1;
-
-    /* The entry was found in the expire dict, this means it should also
-     * be present in the main dict (safety check). */
-    serverAssertWithInfo(NULL,key,dictFind(db->dict,key->ptr) != NULL);
-    return dictGetSignedIntegerVal(de);
-}
-
-/* Delete the specified expired key and propagate expire. */
-void deleteExpiredKeyAndPropagate(redisDb *db, robj *keyobj) {
-    mstime_t expire_latency;
-    latencyStartMonitor(expire_latency);
-    if (server.lazyfree_lazy_expire)
-        dbAsyncDelete(db,keyobj);
-    else
-        dbSyncDelete(db,keyobj);
-    latencyEndMonitor(expire_latency);
-    latencyAddSampleIfNeeded("expire-del",expire_latency);
-    notifyKeyspaceEvent(NOTIFY_EXPIRED,"expired",keyobj,db->id);
-    signalModifiedKey(NULL, db, keyobj);
-    propagateExpire(db,keyobj,server.lazyfree_lazy_expire);
-    server.stat_expiredkeys++;
-}
-
-/* Propagate expires into slaves and the AOF file.
- * When a key expires in the master, a DEL operation for this key is sent
- * to all the slaves and the AOF file if enabled.
- *
- * This way the key expiry is centralized in one place, and since both
- * AOF and the master->slave link guarantee operation ordering, everything
- * will be consistent even if we allow write operations against expiring
- * keys. */
-void propagateExpire(redisDb *db, robj *key, int lazy) {
-    robj *argv[2];
-
-    argv[0] = lazy ? shared.unlink : shared.del;
-    argv[1] = key;
-    incrRefCount(argv[0]);
-    incrRefCount(argv[1]);
-
-    /* If the master decided to expire a key we must propagate it to replicas no matter what..
-     * Even if module executed a command without asking for propagation. */
-    int prev_replication_allowed = server.replication_allowed;
-    server.replication_allowed = 1;
-    propagate(server.delCommand,db->id,argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
-    server.replication_allowed = prev_replication_allowed;
-
-    decrRefCount(argv[0]);
-    decrRefCount(argv[1]);
-}
-
-/* Check if the key is expired. */
-int keyIsExpired(redisDb *db, robj *key) {
-    mstime_t when = getExpire(db,key);
-    mstime_t now;
-
-    if (when < 0) return 0; /* No expire for this key */
-
-    /* Don't expire anything while loading. It will be done later. */
-    if (server.loading) return 0;
-
-    /* If we are in the context of a Lua script, we pretend that time is
-     * blocked to when the Lua script started. This way a key can expire
-     * only the first time it is accessed and not in the middle of the
-     * script execution, making propagation to slaves / AOF consistent.
-     * See issue #1525 on Github for more information. */
-    if (server.lua_caller) {
-        now = server.lua_time_snapshot;
-    }
-    /* If we are in the middle of a command execution, we still want to use
-     * a reference time that does not change: in that case we just use the
-     * cached time, that we update before each call in the call() function.
-     * This way we avoid that commands such as RPOPLPUSH or similar, that
-     * may re-open the same key multiple times, can invalidate an already
-     * open object in a next call, if the next call will see the key expired,
-     * while the first did not. */
-    else if (server.fixed_time_expire > 0) {
-        now = server.mstime;
-    }
-    /* For the other cases, we want to use the most fresh time we have. */
-    else {
-        now = mstime();
-    }
-
-    /* The key expired if the current (virtual or real) time is greater
-     * than the expire time of the key. */
-    return now > when;
-}
-
-/* This function is called when we are going to perform some operation
- * in a given key, but such key may be already logically expired even if
- * it still exists in the database. The main way this function is called
- * is via lookupKey*() family of functions.
- *
- * The behavior of the function depends on the replication role of the
- * instance, because slave instances do not expire keys, they wait
- * for DELs from the master for consistency matters. However even
- * slaves will try to have a coherent return value for the function,
- * so that read commands executed in the slave side will be able to
- * behave like if the key is expired even if still present (because the
- * master has yet to propagate the DEL).
- *
- * In masters as a side effect of finding a key which is expired, such
- * key will be evicted from the database. Also this may trigger the
- * propagation of a DEL/UNLINK command in AOF / replication stream.
- *
- * The return value of the function is 0 if the key is still valid,
- * otherwise the function returns 1 if the key is expired. */
-int expireIfNeeded(redisDb *db, robj *key) {
-    if (!keyIsExpired(db,key)) return 0;
-
-    /* If we are running in the context of a slave, instead of
-     * evicting the expired key from the database, we return ASAP:
-     * the slave key expiration is controlled by the master that will
-     * send us synthesized DEL operations for expired keys.
-     *
-     * Still we try to return the right information to the caller,
-     * that is, 0 if we think the key should be still valid, 1 if
-     * we think the key is expired at this time. */
-    if (server.masterhost != NULL) return 1;
-
-    /* If clients are paused, we keep the current dataset constant,
-     * but return to the client what we believe is the right state. Typically,
-     * at the end of the pause we will properly expire the key OR we will
-     * have failed over and the new primary will send us the expire. */
-    if (checkClientPauseTimeoutAndReturnIfPaused()) return 1;
-
-    /* Delete the key */
-    deleteExpiredKeyAndPropagate(db,key);
-    return 1;
-}
-
-/* -----------------------------------------------------------------------------
- * API to get key arguments from commands
- * ---------------------------------------------------------------------------*/
-
-/* Prepare the getKeysResult struct to hold numkeys, either by using the
- * pre-allocated keysbuf or by allocating a new array on the heap.
- *
- * This function must be called at least once before starting to populate
- * the result, and can be called repeatedly to enlarge the result array.
- */
-int *getKeysPrepareResult(getKeysResult *result, int numkeys) {
-    /* GETKEYS_RESULT_INIT initializes keys to NULL, point it to the pre-allocated stack
-     * buffer here. */
-    if (!result->keys) {
-        serverAssert(!result->numkeys);
-        result->keys = result->keysbuf;
-    }
-
-    /* Resize if necessary */
-    if (numkeys > result->size) {
-        if (result->keys != result->keysbuf) {
-            /* We're not using a static buffer, just (re)alloc */
-            result->keys = zrealloc(result->keys, numkeys * sizeof(int));
-        } else {
-            /* We are using a static buffer, copy its contents */
-            result->keys = zmalloc(numkeys * sizeof(int));
-            if (result->numkeys)
-                memcpy(result->keys, result->keysbuf, result->numkeys * sizeof(int));
-        }
-        result->size = numkeys;
-    }
-
-    return result->keys;
-}
-
-/* The base case is to use the keys position as given in the command table
- * (firstkey, lastkey, step). */
-int getKeysUsingCommandTable(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result) {
-    int j, i = 0, last, *keys;
-    UNUSED(argv);
-
-    if (cmd->firstkey == 0) {
-        result->numkeys = 0;
-        return 0;
-    }
-
-    last = cmd->lastkey;
-    if (last < 0) last = argc+last;
-
-    int count = ((last - cmd->firstkey)+1);
-    keys = getKeysPrepareResult(result, count);
-
-    for (j = cmd->firstkey; j <= last; j += cmd->keystep) {
-        if (j >= argc) {
-            /* Modules commands, and standard commands with a not fixed number
-             * of arguments (negative arity parameter) do not have dispatch
-             * time arity checks, so we need to handle the case where the user
-             * passed an invalid number of arguments here. In this case we
-             * return no keys and expect the command implementation to report
-             * an arity or syntax error. */
-            if (cmd->flags & CMD_MODULE || cmd->arity < 0) {
-                result->numkeys = 0;
-                return 0;
-            } else {
-                serverPanic("Redis built-in command declared keys positions not matching the arity requirements.");
-            }
-        }
-        keys[i++] = j;
-    }
-    result->numkeys = i;
-    return i;
-}
-
-/* Return all the arguments that are keys in the command passed via argc / argv.
- *
- * The command returns the positions of all the key arguments inside the array,
- * so the actual return value is a heap allocated array of integers. The
- * length of the array is returned by reference into *numkeys.
- *
- * 'cmd' must be point to the corresponding entry into the redisCommand
- * table, according to the command name in argv[0].
- *
- * This function uses the command table if a command-specific helper function
- * is not required, otherwise it calls the command-specific function. */
-int getKeysFromCommand(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    if (cmd->flags & CMD_MODULE_GETKEYS) {
-        return moduleGetCommandKeysViaAPI(cmd,argv,argc,result);
-    } else if (!(cmd->flags & CMD_MODULE) && cmd->getkeys_proc) {
-        return cmd->getkeys_proc(cmd,argv,argc,result);
-    } else {
-        return getKeysUsingCommandTable(cmd,argv,argc,result);
-    }
-}
-
-/* Free the result of getKeysFromCommand. */
-void getKeysFreeResult(getKeysResult *result) {
-    if (result && result->keys != result->keysbuf)
-        zfree(result->keys);
-}
-
-/* Helper function to extract keys from following commands:
- * COMMAND [destkey] <num-keys> <key> [...] <key> [...] ... <options>
- *
- * eg:
- * ZUNION <num-keys> <key> <key> ... <key> <options>
- * ZUNIONSTORE <destkey> <num-keys> <key> <key> ... <key> <options>
- *
- * 'storeKeyOfs': destkey index, 0 means destkey not exists.
- * 'keyCountOfs': num-keys index.
- * 'firstKeyOfs': firstkey index.
- * 'keyStep': the interval of each key, usually this value is 1.
- * */
-int genericGetKeys(int storeKeyOfs, int keyCountOfs, int firstKeyOfs, int keyStep,
-                    robj **argv, int argc, getKeysResult *result) {
-    int i, num, *keys;
-
-    num = atoi(argv[keyCountOfs]->ptr);
-    /* Sanity check. Don't return any key if the command is going to
-     * reply with syntax error. (no input keys). */
-    if (num < 1 || num > (argc - firstKeyOfs)/keyStep) {
-        result->numkeys = 0;
-        return 0;
-    }
-
-    int numkeys = storeKeyOfs ? num + 1 : num;
-    keys = getKeysPrepareResult(result, numkeys);
-    result->numkeys = numkeys;
-
-    /* Add all key positions for argv[firstKeyOfs...n] to keys[] */
-    for (i = 0; i < num; i++) keys[i] = firstKeyOfs+(i*keyStep);
-
-    if (storeKeyOfs) keys[num] = storeKeyOfs;
-    return result->numkeys;
-}
-
-int zunionInterDiffStoreGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    UNUSED(cmd);
-    return genericGetKeys(1, 2, 3, 1, argv, argc, result);
-}
-
-int zunionInterDiffGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    UNUSED(cmd);
-    return genericGetKeys(0, 1, 2, 1, argv, argc, result);
-}
-
-int evalGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    UNUSED(cmd);
-    return genericGetKeys(0, 2, 3, 1, argv, argc, result);
-}
-
-/* Helper function to extract keys from the SORT command.
- *
- * SORT <sort-key> ... STORE <store-key> ...
- *
- * The first argument of SORT is always a key, however a list of options
- * follow in SQL-alike style. Here we parse just the minimum in order to
- * correctly identify keys in the "STORE" option. */
-int sortGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    int i, j, num, *keys, found_store = 0;
-    UNUSED(cmd);
-
-    num = 0;
-    keys = getKeysPrepareResult(result, 2); /* Alloc 2 places for the worst case. */
-    keys[num++] = 1; /* <sort-key> is always present. */
-
-    /* Search for STORE option. By default we consider options to don't
-     * have arguments, so if we find an unknown option name we scan the
-     * next. However there are options with 1 or 2 arguments, so we
-     * provide a list here in order to skip the right number of args. */
-    struct {
-        char *name;
-        int skip;
-    } skiplist[] = {
-        {"limit", 2},
-        {"get", 1},
-        {"by", 1},
-        {NULL, 0} /* End of elements. */
-    };
-
-    for (i = 2; i < argc; i++) {
-        for (j = 0; skiplist[j].name != NULL; j++) {
-            if (!strcasecmp(argv[i]->ptr,skiplist[j].name)) {
-                i += skiplist[j].skip;
-                break;
-            } else if (!strcasecmp(argv[i]->ptr,"store") && i+1 < argc) {
-                /* Note: we don't increment "num" here and continue the loop
-                 * to be sure to process the *last* "STORE" option if multiple
-                 * ones are provided. This is same behavior as SORT. */
-                found_store = 1;
-                keys[num] = i+1; /* <store-key> */
-                break;
-            }
-        }
-    }
-    result->numkeys = num + found_store;
-    return result->numkeys;
-}
-
-int migrateGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    int i, num, first, *keys;
-    UNUSED(cmd);
-
-    /* Assume the obvious form. */
-    first = 3;
-    num = 1;
-
-    /* But check for the extended one with the KEYS option. */
-    if (argc > 6) {
-        for (i = 6; i < argc; i++) {
-            if (!strcasecmp(argv[i]->ptr,"keys") &&
-                sdslen(argv[3]->ptr) == 0)
-            {
-                first = i+1;
-                num = argc-first;
-                break;
-            }
-        }
-    }
-
-    keys = getKeysPrepareResult(result, num);
-    for (i = 0; i < num; i++) keys[i] = first+i;
-    result->numkeys = num;
-    return num;
-}
-
-/* Helper function to extract keys from following commands:
- * GEORADIUS key x y radius unit [WITHDIST] [WITHHASH] [WITHCOORD] [ASC|DESC]
- *                             [COUNT count] [STORE key] [STOREDIST key]
- * GEORADIUSBYMEMBER key member radius unit ... options ... */
-int georadiusGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    int i, num, *keys;
-    UNUSED(cmd);
-
-    /* Check for the presence of the stored key in the command */
-    int stored_key = -1;
-    for (i = 5; i < argc; i++) {
-        char *arg = argv[i]->ptr;
-        /* For the case when user specifies both "store" and "storedist" options, the
-         * second key specified would override the first key. This behavior is kept
-         * the same as in georadiusCommand method.
-         */
-        if ((!strcasecmp(arg, "store") || !strcasecmp(arg, "storedist")) && ((i+1) < argc)) {
-            stored_key = i+1;
-            i++;
-        }
-    }
-    num = 1 + (stored_key == -1 ? 0 : 1);
-
-    /* Keys in the command come from two places:
-     * argv[1] = key,
-     * argv[5...n] = stored key if present
-     */
-    keys = getKeysPrepareResult(result, num);
-
-    /* Add all key positions to keys[] */
-    keys[0] = 1;
-    if(num > 1) {
-         keys[1] = stored_key;
-    }
-    result->numkeys = num;
-    return num;
-}
-
-/* LCS ... [KEYS <key1> <key2>] ... */
-int lcsGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    int i;
-    int *keys = getKeysPrepareResult(result, 2);
-    UNUSED(cmd);
-
-    /* We need to parse the options of the command in order to check for the
-     * "KEYS" argument before the "STRINGS" argument. */
-    for (i = 1; i < argc; i++) {
-        char *arg = argv[i]->ptr;
-        int moreargs = (argc-1) - i;
-
-        if (!strcasecmp(arg, "strings")) {
-            break;
-        } else if (!strcasecmp(arg, "keys") && moreargs >= 2) {
-            keys[0] = i+1;
-            keys[1] = i+2;
-            result->numkeys = 2;
-            return result->numkeys;
-        }
-    }
-    result->numkeys = 0;
-    return result->numkeys;
-}
-
-/* Helper function to extract keys from memory command.
- * MEMORY USAGE <key> */
-int memoryGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    UNUSED(cmd);
-
-    getKeysPrepareResult(result, 1);
-    if (argc >= 3 && !strcasecmp(argv[1]->ptr,"usage")) {
-        result->keys[0] = 2;
-        result->numkeys = 1;
-        return result->numkeys;
-    }
-    result->numkeys = 0;
-    return 0;
-}
-
-/* XREAD [BLOCK <milliseconds>] [COUNT <count>] [GROUP <groupname> <ttl>]
- *       STREAMS key_1 key_2 ... key_N ID_1 ID_2 ... ID_N */
-int xreadGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    int i, num = 0, *keys;
-    UNUSED(cmd);
-
-    /* We need to parse the options of the command in order to seek the first
-     * "STREAMS" string which is actually the option. This is needed because
-     * "STREAMS" could also be the name of the consumer group and even the
-     * name of the stream key. */
-    int streams_pos = -1;
-    for (i = 1; i < argc; i++) {
-        char *arg = argv[i]->ptr;
-        if (!strcasecmp(arg, "block")) {
-            i++; /* Skip option argument. */
-        } else if (!strcasecmp(arg, "count")) {
-            i++; /* Skip option argument. */
-        } else if (!strcasecmp(arg, "group")) {
-            i += 2; /* Skip option argument. */
-        } else if (!strcasecmp(arg, "noack")) {
-            /* Nothing to do. */
-        } else if (!strcasecmp(arg, "streams")) {
-            streams_pos = i;
-            break;
-        } else {
-            break; /* Syntax error. */
-        }
-    }
-    if (streams_pos != -1) num = argc - streams_pos - 1;
-
-    /* Syntax error. */
-    if (streams_pos == -1 || num == 0 || num % 2 != 0) {
-        result->numkeys = 0;
-        return 0;
-    }
-    num /= 2; /* We have half the keys as there are arguments because
-                 there are also the IDs, one per key. */
-
-    keys = getKeysPrepareResult(result, num);
-    for (i = streams_pos+1; i < argc-num; i++) keys[i-streams_pos-1] = i;
-    result->numkeys = num;
-    return num;
-}
-
-/* Slot to Key API. This is used by Redis Cluster in order to obtain in
- * a fast way a key that belongs to a specified hash slot. This is useful
- * while rehashing the cluster and in other conditions when we need to
- * understand if we have keys for a given hash slot. */
-void slotToKeyUpdateKey(sds key, int add) {
-    size_t keylen = sdslen(key);
-    unsigned int hashslot = keyHashSlot(key,keylen);
-    unsigned char buf[64];
-    unsigned char *indexed = buf;
-
-    server.cluster->slots_keys_count[hashslot] += add ? 1 : -1;
-    if (keylen+2 > 64) indexed = zmalloc(keylen+2);
-    indexed[0] = (hashslot >> 8) & 0xff;
-    indexed[1] = hashslot & 0xff;
-    memcpy(indexed+2,key,keylen);
-    if (add) {
-        raxInsert(server.cluster->slots_to_keys,indexed,keylen+2,NULL,NULL);
-    } else {
-        raxRemove(server.cluster->slots_to_keys,indexed,keylen+2,NULL);
-    }
-    if (indexed != buf) zfree(indexed);
-}
-
-void slotToKeyAdd(sds key) {
-    slotToKeyUpdateKey(key,1);
-}
-
-void slotToKeyDel(sds key) {
-    slotToKeyUpdateKey(key,0);
-}
-
-/* Release the radix tree mapping Redis Cluster keys to slots. If 'async'
- * is true, we release it asynchronously. */
-void freeSlotsToKeysMap(rax *rt, int async) {
-    if (async) {
-        freeSlotsToKeysMapAsync(rt);
-    } else {
-        raxFree(rt);
-    }
-}
-
-/* Empty the slots-keys map of Redis CLuster by creating a new empty one and
- * freeing the old one. */
-void slotToKeyFlush(int async) {
-    rax *old = server.cluster->slots_to_keys;
-
-    server.cluster->slots_to_keys = raxNew();
-    memset(server.cluster->slots_keys_count,0,
-           sizeof(server.cluster->slots_keys_count));
-    freeSlotsToKeysMap(old, async);
-}
-
-/* Populate the specified array of objects with keys in the specified slot.
- * New objects are returned to represent keys, it's up to the caller to
- * decrement the reference count to release the keys names. */
-unsigned int getKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count) {
-    raxIterator iter;
-    int j = 0;
-    unsigned char indexed[2];
-
-    indexed[0] = (hashslot >> 8) & 0xff;
-    indexed[1] = hashslot & 0xff;
-    raxStart(&iter,server.cluster->slots_to_keys);
-    raxSeek(&iter,">=",indexed,2);
-    while(count-- && raxNext(&iter)) {
-        if (iter.key[0] != indexed[0] || iter.key[1] != indexed[1]) break;
-        keys[j++] = createStringObject((char*)iter.key+2,iter.key_len-2);
-    }
-    raxStop(&iter);
-    return j;
-}
-
-/* Remove all the keys in the specified hash slot.
- * The number of removed items is returned. */
-unsigned int delKeysInSlot(unsigned int hashslot) {
-    raxIterator iter;
-    int j = 0;
-    unsigned char indexed[2];
-
-    indexed[0] = (hashslot >> 8) & 0xff;
-    indexed[1] = hashslot & 0xff;
-    raxStart(&iter,server.cluster->slots_to_keys);
-    while(server.cluster->slots_keys_count[hashslot]) {
-        raxSeek(&iter,">=",indexed,2);
-        raxNext(&iter);
-
-        robj *key = createStringObject((char*)iter.key+2,iter.key_len-2);
-        dbDelete(&server.db[0],key);
-        decrRefCount(key);
-        j++;
-    }
-    raxStop(&iter);
-    return j;
-}
-
-unsigned int countKeysInSlot(unsigned int hashslot) {
-    return server.cluster->slots_keys_count[hashslot];
-}
diff --git a/redis-stable/src/debug.c b/redis-stable/src/debug.c
deleted file mode 100644
index f521490a..00000000
--- a/redis-stable/src/debug.c
+++ /dev/null
@@ -1,1988 +0,0 @@
-/*
- * Copyright (c) 2009-2020, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2020, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "sha1.h"   /* SHA1 is used for DEBUG DIGEST */
-#include "crc64.h"
-#include "bio.h"
-
-#include <arpa/inet.h>
-#include <signal.h>
-#include <dlfcn.h>
-#include <fcntl.h>
-#include <unistd.h>
-
-#ifdef HAVE_BACKTRACE
-#include <execinfo.h>
-#ifndef __OpenBSD__
-#include <ucontext.h>
-#else
-typedef ucontext_t sigcontext_t;
-#endif
-#endif /* HAVE_BACKTRACE */
-
-#ifdef __CYGWIN__
-#ifndef SA_ONSTACK
-#define SA_ONSTACK 0x08000000
-#endif
-#endif
-
-#if defined(__APPLE__) && defined(__arm64__)
-#include <mach/mach.h>
-#endif
-
-/* Globals */
-static int bug_report_start = 0; /* True if bug report header was already logged. */
-static pthread_mutex_t bug_report_start_mutex = PTHREAD_MUTEX_INITIALIZER;
-
-/* Forward declarations */
-void bugReportStart(void);
-void printCrashReport(void);
-void bugReportEnd(int killViaSignal, int sig);
-void logStackTrace(void *eip, int uplevel);
-
-/* ================================= Debugging ============================== */
-
-/* Compute the sha1 of string at 's' with 'len' bytes long.
- * The SHA1 is then xored against the string pointed by digest.
- * Since xor is commutative, this operation is used in order to
- * "add" digests relative to unordered elements.
- *
- * So digest(a,b,c,d) will be the same of digest(b,a,c,d) */
-void xorDigest(unsigned char *digest, void *ptr, size_t len) {
-    SHA1_CTX ctx;
-    unsigned char hash[20], *s = ptr;
-    int j;
-
-    SHA1Init(&ctx);
-    SHA1Update(&ctx,s,len);
-    SHA1Final(hash,&ctx);
-
-    for (j = 0; j < 20; j++)
-        digest[j] ^= hash[j];
-}
-
-void xorStringObjectDigest(unsigned char *digest, robj *o) {
-    o = getDecodedObject(o);
-    xorDigest(digest,o->ptr,sdslen(o->ptr));
-    decrRefCount(o);
-}
-
-/* This function instead of just computing the SHA1 and xoring it
- * against digest, also perform the digest of "digest" itself and
- * replace the old value with the new one.
- *
- * So the final digest will be:
- *
- * digest = SHA1(digest xor SHA1(data))
- *
- * This function is used every time we want to preserve the order so
- * that digest(a,b,c,d) will be different than digest(b,c,d,a)
- *
- * Also note that mixdigest("foo") followed by mixdigest("bar")
- * will lead to a different digest compared to "fo", "obar".
- */
-void mixDigest(unsigned char *digest, void *ptr, size_t len) {
-    SHA1_CTX ctx;
-    char *s = ptr;
-
-    xorDigest(digest,s,len);
-    SHA1Init(&ctx);
-    SHA1Update(&ctx,digest,20);
-    SHA1Final(digest,&ctx);
-}
-
-void mixStringObjectDigest(unsigned char *digest, robj *o) {
-    o = getDecodedObject(o);
-    mixDigest(digest,o->ptr,sdslen(o->ptr));
-    decrRefCount(o);
-}
-
-/* This function computes the digest of a data structure stored in the
- * object 'o'. It is the core of the DEBUG DIGEST command: when taking the
- * digest of a whole dataset, we take the digest of the key and the value
- * pair, and xor all those together.
- *
- * Note that this function does not reset the initial 'digest' passed, it
- * will continue mixing this object digest to anything that was already
- * present. */
-void xorObjectDigest(redisDb *db, robj *keyobj, unsigned char *digest, robj *o) {
-    uint32_t aux = htonl(o->type);
-    mixDigest(digest,&aux,sizeof(aux));
-    long long expiretime = getExpire(db,keyobj);
-    char buf[128];
-
-    /* Save the key and associated value */
-    if (o->type == OBJ_STRING) {
-        mixStringObjectDigest(digest,o);
-    } else if (o->type == OBJ_LIST) {
-        listTypeIterator *li = listTypeInitIterator(o,0,LIST_TAIL);
-        listTypeEntry entry;
-        while(listTypeNext(li,&entry)) {
-            robj *eleobj = listTypeGet(&entry);
-            mixStringObjectDigest(digest,eleobj);
-            decrRefCount(eleobj);
-        }
-        listTypeReleaseIterator(li);
-    } else if (o->type == OBJ_SET) {
-        setTypeIterator *si = setTypeInitIterator(o);
-        sds sdsele;
-        while((sdsele = setTypeNextObject(si)) != NULL) {
-            xorDigest(digest,sdsele,sdslen(sdsele));
-            sdsfree(sdsele);
-        }
-        setTypeReleaseIterator(si);
-    } else if (o->type == OBJ_ZSET) {
-        unsigned char eledigest[20];
-
-        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            unsigned char *zl = o->ptr;
-            unsigned char *eptr, *sptr;
-            unsigned char *vstr;
-            unsigned int vlen;
-            long long vll;
-            double score;
-
-            eptr = ziplistIndex(zl,0);
-            serverAssert(eptr != NULL);
-            sptr = ziplistNext(zl,eptr);
-            serverAssert(sptr != NULL);
-
-            while (eptr != NULL) {
-                serverAssert(ziplistGet(eptr,&vstr,&vlen,&vll));
-                score = zzlGetScore(sptr);
-
-                memset(eledigest,0,20);
-                if (vstr != NULL) {
-                    mixDigest(eledigest,vstr,vlen);
-                } else {
-                    ll2string(buf,sizeof(buf),vll);
-                    mixDigest(eledigest,buf,strlen(buf));
-                }
-
-                snprintf(buf,sizeof(buf),"%.17g",score);
-                mixDigest(eledigest,buf,strlen(buf));
-                xorDigest(digest,eledigest,20);
-                zzlNext(zl,&eptr,&sptr);
-            }
-        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = o->ptr;
-            dictIterator *di = dictGetIterator(zs->dict);
-            dictEntry *de;
-
-            while((de = dictNext(di)) != NULL) {
-                sds sdsele = dictGetKey(de);
-                double *score = dictGetVal(de);
-
-                snprintf(buf,sizeof(buf),"%.17g",*score);
-                memset(eledigest,0,20);
-                mixDigest(eledigest,sdsele,sdslen(sdsele));
-                mixDigest(eledigest,buf,strlen(buf));
-                xorDigest(digest,eledigest,20);
-            }
-            dictReleaseIterator(di);
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else if (o->type == OBJ_HASH) {
-        hashTypeIterator *hi = hashTypeInitIterator(o);
-        while (hashTypeNext(hi) != C_ERR) {
-            unsigned char eledigest[20];
-            sds sdsele;
-
-            memset(eledigest,0,20);
-            sdsele = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
-            mixDigest(eledigest,sdsele,sdslen(sdsele));
-            sdsfree(sdsele);
-            sdsele = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
-            mixDigest(eledigest,sdsele,sdslen(sdsele));
-            sdsfree(sdsele);
-            xorDigest(digest,eledigest,20);
-        }
-        hashTypeReleaseIterator(hi);
-    } else if (o->type == OBJ_STREAM) {
-        streamIterator si;
-        streamIteratorStart(&si,o->ptr,NULL,NULL,0);
-        streamID id;
-        int64_t numfields;
-
-        while(streamIteratorGetID(&si,&id,&numfields)) {
-            sds itemid = sdscatfmt(sdsempty(),"%U.%U",id.ms,id.seq);
-            mixDigest(digest,itemid,sdslen(itemid));
-            sdsfree(itemid);
-
-            while(numfields--) {
-                unsigned char *field, *value;
-                int64_t field_len, value_len;
-                streamIteratorGetField(&si,&field,&value,
-                                           &field_len,&value_len);
-                mixDigest(digest,field,field_len);
-                mixDigest(digest,value,value_len);
-            }
-        }
-        streamIteratorStop(&si);
-    } else if (o->type == OBJ_MODULE) {
-        RedisModuleDigest md = {{0},{0}};
-        moduleValue *mv = o->ptr;
-        moduleType *mt = mv->type;
-        moduleInitDigestContext(md);
-        if (mt->digest) {
-            mt->digest(&md,mv->value);
-            xorDigest(digest,md.x,sizeof(md.x));
-        }
-    } else {
-        serverPanic("Unknown object type");
-    }
-    /* If the key has an expire, add it to the mix */
-    if (expiretime != -1) xorDigest(digest,"!!expire!!",10);
-}
-
-/* Compute the dataset digest. Since keys, sets elements, hashes elements
- * are not ordered, we use a trick: every aggregate digest is the xor
- * of the digests of their elements. This way the order will not change
- * the result. For list instead we use a feedback entering the output digest
- * as input in order to ensure that a different ordered list will result in
- * a different digest. */
-void computeDatasetDigest(unsigned char *final) {
-    unsigned char digest[20];
-    dictIterator *di = NULL;
-    dictEntry *de;
-    int j;
-    uint32_t aux;
-
-    memset(final,0,20); /* Start with a clean result */
-
-    for (j = 0; j < server.dbnum; j++) {
-        redisDb *db = server.db+j;
-
-        if (dictSize(db->dict) == 0) continue;
-        di = dictGetSafeIterator(db->dict);
-
-        /* hash the DB id, so the same dataset moved in a different
-         * DB will lead to a different digest */
-        aux = htonl(j);
-        mixDigest(final,&aux,sizeof(aux));
-
-        /* Iterate this DB writing every entry */
-        while((de = dictNext(di)) != NULL) {
-            sds key;
-            robj *keyobj, *o;
-
-            memset(digest,0,20); /* This key-val digest */
-            key = dictGetKey(de);
-            keyobj = createStringObject(key,sdslen(key));
-
-            mixDigest(digest,key,sdslen(key));
-
-            o = dictGetVal(de);
-            xorObjectDigest(db,keyobj,digest,o);
-
-            /* We can finally xor the key-val digest to the final digest */
-            xorDigest(final,digest,20);
-            decrRefCount(keyobj);
-        }
-        dictReleaseIterator(di);
-    }
-}
-
-#ifdef USE_JEMALLOC
-void mallctl_int(client *c, robj **argv, int argc) {
-    int ret;
-    /* start with the biggest size (int64), and if that fails, try smaller sizes (int32, bool) */
-    int64_t old = 0, val;
-    if (argc > 1) {
-        long long ll;
-        if (getLongLongFromObjectOrReply(c, argv[1], &ll, NULL) != C_OK)
-            return;
-        val = ll;
-    }
-    size_t sz = sizeof(old);
-    while (sz > 0) {
-        if ((ret=je_mallctl(argv[0]->ptr, &old, &sz, argc > 1? &val: NULL, argc > 1?sz: 0))) {
-            if (ret == EPERM && argc > 1) {
-                /* if this option is write only, try just writing to it. */
-                if (!(ret=je_mallctl(argv[0]->ptr, NULL, 0, &val, sz))) {
-                    addReply(c, shared.ok);
-                    return;
-                }
-            }
-            if (ret==EINVAL) {
-                /* size might be wrong, try a smaller one */
-                sz /= 2;
-#if BYTE_ORDER == BIG_ENDIAN
-                val <<= 8*sz;
-#endif
-                continue;
-            }
-            addReplyErrorFormat(c,"%s", strerror(ret));
-            return;
-        } else {
-#if BYTE_ORDER == BIG_ENDIAN
-            old >>= 64 - 8*sz;
-#endif
-            addReplyLongLong(c, old);
-            return;
-        }
-    }
-    addReplyErrorFormat(c,"%s", strerror(EINVAL));
-}
-
-void mallctl_string(client *c, robj **argv, int argc) {
-    int rret, wret;
-    char *old;
-    size_t sz = sizeof(old);
-    /* for strings, it seems we need to first get the old value, before overriding it. */
-    if ((rret=je_mallctl(argv[0]->ptr, &old, &sz, NULL, 0))) {
-        /* return error unless this option is write only. */
-        if (!(rret == EPERM && argc > 1)) {
-            addReplyErrorFormat(c,"%s", strerror(rret));
-            return;
-        }
-    }
-    if(argc > 1) {
-        char *val = argv[1]->ptr;
-        char **valref = &val;
-        if ((!strcmp(val,"VOID")))
-            valref = NULL, sz = 0;
-        wret = je_mallctl(argv[0]->ptr, NULL, 0, valref, sz);
-    }
-    if (!rret)
-        addReplyBulkCString(c, old);
-    else if (wret)
-        addReplyErrorFormat(c,"%s", strerror(wret));
-    else
-        addReply(c, shared.ok);
-}
-#endif
-
-void debugCommand(client *c) {
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"AOF-FLUSH-SLEEP <microsec>",
-"    Server will sleep before flushing the AOF, this is used for testing.",
-"ASSERT",
-"    Crash by assertion failed.",
-"CHANGE-REPL-ID"
-"    Change the replication IDs of the instance.",
-"    Dangerous: should be used only for testing the replication subsystem.",
-"CONFIG-REWRITE-FORCE-ALL",
-"    Like CONFIG REWRITE but writes all configuration options, including",
-"    keywords not listed in original configuration file or default values.",
-"CRASH-AND-RECOVER <milliseconds>",
-"    Hard crash and restart after a <milliseconds> delay.",
-"DIGEST",
-"    Output a hex signature representing the current DB content.",
-"DIGEST-VALUE <key> [<key> ...]",
-"    Output a hex signature of the values of all the specified keys.",
-"ERROR <string>",
-"    Return a Redis protocol error with <string> as message. Useful for clients",
-"    unit tests to simulate Redis errors.",
-"LOG <message>",
-"    Write <message> to the server log.",
-"HTSTATS <dbid>",
-"    Return hash table statistics of the specified Redis database.",
-"HTSTATS-KEY <key>",
-"    Like HTSTATS but for the hash table stored at <key>'s value.",
-"LOADAOF",
-"    Flush the AOF buffers on disk and reload the AOF in memory.",
-"LUA-ALWAYS-REPLICATE-COMMANDS <0|1>",
-"    Setting it to 1 makes Lua replication defaulting to replicating single",
-"    commands, without the script having to enable effects replication.",
-#ifdef USE_JEMALLOC
-"MALLCTL <key> [<val>]",
-"    Get or set a malloc tuning integer.",
-"MALLCTL-STR <key> [<val>]",
-"    Get or set a malloc tuning string.",
-#endif
-"OBJECT <key>",
-"    Show low level info about `key` and associated value.",
-"OOM",
-"    Crash the server simulating an out-of-memory error.",
-"PANIC",
-"    Crash the server simulating a panic.",
-"POPULATE <count> [<prefix>] [<size>]",
-"    Create <count> string keys named key:<num>. If <prefix> is specified then",
-"    it is used instead of the 'key' prefix.",
-"DEBUG PROTOCOL <type>",
-"    Reply with a test value of the specified type. <type> can be: string,",
-"    integer, double, bignum, null, array, set, map, attrib, push, verbatim,",
-"    true, false.",
-"RELOAD [option ...]",
-"    Save the RDB on disk and reload it back to memory. Valid <option> values:",
-"    * MERGE: conflicting keys will be loaded from RDB.",
-"    * NOFLUSH: the existing database will not be removed before load, but",
-"      conflicting keys will generate an exception and kill the server."
-"    * NOSAVE: the database will be loaded from an existing RDB file.",
-"    Examples:",
-"    * DEBUG RELOAD: verify that the server is able to persist, flush and reload",
-"      the database.",
-"    * DEBUG RELOAD NOSAVE: replace the current database with the contents of an",
-"      existing RDB file.",
-"    * DEBUG RELOAD NOSAVE NOFLUSH MERGE: add the contents of an existing RDB",
-"      file to the database.",
-"RESTART",
-"    Graceful restart: save config, db, restart.",
-"SDSLEN <key>",
-"    Show low level SDS string info representing `key` and value.",
-"SEGFAULT",
-"    Crash the server with sigsegv.",
-"SET-ACTIVE-EXPIRE <0|1>",
-"    Setting it to 0 disables expiring keys in background when they are not",
-"    accessed (otherwise the Redis behavior). Setting it to 1 reenables back the",
-"    default.",
-"SET-SKIP-CHECKSUM-VALIDATION <0|1>",
-"    Enables or disables checksum checks for RDB files and RESTORE's payload.",
-"SLEEP <seconds>",
-"    Stop the server for <seconds>. Decimals allowed.",
-"STRINGMATCH-TEST",
-"    Run a fuzz tester against the stringmatchlen() function.",
-"STRUCTSIZE",
-"    Return the size of different Redis core C structures.",
-"ZIPLIST <key>",
-"    Show low level info about the ziplist encoding of <key>.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"segfault")) {
-        *((char*)-1) = 'x';
-    } else if (!strcasecmp(c->argv[1]->ptr,"panic")) {
-        serverPanic("DEBUG PANIC called at Unix time %lld", (long long)time(NULL));
-    } else if (!strcasecmp(c->argv[1]->ptr,"restart") ||
-               !strcasecmp(c->argv[1]->ptr,"crash-and-recover"))
-    {
-        long long delay = 0;
-        if (c->argc >= 3) {
-            if (getLongLongFromObjectOrReply(c, c->argv[2], &delay, NULL)
-                != C_OK) return;
-            if (delay < 0) delay = 0;
-        }
-        int flags = !strcasecmp(c->argv[1]->ptr,"restart") ?
-            (RESTART_SERVER_GRACEFULLY|RESTART_SERVER_CONFIG_REWRITE) :
-             RESTART_SERVER_NONE;
-        restartServer(flags,delay);
-        addReplyError(c,"failed to restart the server. Check server logs.");
-    } else if (!strcasecmp(c->argv[1]->ptr,"oom")) {
-        void *ptr = zmalloc(ULONG_MAX); /* Should trigger an out of memory. */
-        zfree(ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"assert")) {
-        serverAssertWithInfo(c,c->argv[0],1 == 2);
-    } else if (!strcasecmp(c->argv[1]->ptr,"log") && c->argc == 3) {
-        serverLog(LL_WARNING, "DEBUG LOG: %s", (char*)c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"leak") && c->argc == 3) {
-        sdsdup(c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"reload")) {
-        int flush = 1, save = 1;
-        int flags = RDBFLAGS_NONE;
-
-        /* Parse the additional options that modify the RELOAD
-         * behavior. */
-        for (int j = 2; j < c->argc; j++) {
-            char *opt = c->argv[j]->ptr;
-            if (!strcasecmp(opt,"MERGE")) {
-                flags |= RDBFLAGS_ALLOW_DUP;
-            } else if (!strcasecmp(opt,"NOFLUSH")) {
-                flush = 0;
-            } else if (!strcasecmp(opt,"NOSAVE")) {
-                save = 0;
-            } else {
-                addReplyError(c,"DEBUG RELOAD only supports the "
-                                "MERGE, NOFLUSH and NOSAVE options.");
-                return;
-            }
-        }
-
-        /* The default behavior is to save the RDB file before loading
-         * it back. */
-        if (save) {
-            rdbSaveInfo rsi, *rsiptr;
-            rsiptr = rdbPopulateSaveInfo(&rsi);
-            if (rdbSave(server.rdb_filename,rsiptr) != C_OK) {
-                addReplyErrorObject(c,shared.err);
-                return;
-            }
-        }
-
-        /* The default behavior is to remove the current dataset from
-         * memory before loading the RDB file, however when MERGE is
-         * used together with NOFLUSH, we are able to merge two datasets. */
-        if (flush) emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
-
-        protectClient(c);
-        int ret = rdbLoad(server.rdb_filename,NULL,flags);
-        unprotectClient(c);
-        if (ret != C_OK) {
-            addReplyError(c,"Error trying to load the RDB dump");
-            return;
-        }
-        serverLog(LL_WARNING,"DB reloaded by DEBUG RELOAD");
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"loadaof")) {
-        if (server.aof_state != AOF_OFF) flushAppendOnlyFile(1);
-        emptyDb(-1,EMPTYDB_NO_FLAGS,NULL);
-        protectClient(c);
-        int ret = loadAppendOnlyFile(server.aof_filename);
-        unprotectClient(c);
-        if (ret != C_OK) {
-            addReplyErrorObject(c,shared.err);
-            return;
-        }
-        server.dirty = 0; /* Prevent AOF / replication */
-        serverLog(LL_WARNING,"Append Only File loaded by DEBUG LOADAOF");
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"object") && c->argc == 3) {
-        dictEntry *de;
-        robj *val;
-        char *strenc;
-
-        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
-            addReplyErrorObject(c,shared.nokeyerr);
-            return;
-        }
-        val = dictGetVal(de);
-        strenc = strEncoding(val->encoding);
-
-        char extra[138] = {0};
-        if (val->encoding == OBJ_ENCODING_QUICKLIST) {
-            char *nextra = extra;
-            int remaining = sizeof(extra);
-            quicklist *ql = val->ptr;
-            /* Add number of quicklist nodes */
-            int used = snprintf(nextra, remaining, " ql_nodes:%lu", ql->len);
-            nextra += used;
-            remaining -= used;
-            /* Add average quicklist fill factor */
-            double avg = (double)ql->count/ql->len;
-            used = snprintf(nextra, remaining, " ql_avg_node:%.2f", avg);
-            nextra += used;
-            remaining -= used;
-            /* Add quicklist fill level / max ziplist size */
-            used = snprintf(nextra, remaining, " ql_ziplist_max:%d", ql->fill);
-            nextra += used;
-            remaining -= used;
-            /* Add isCompressed? */
-            int compressed = ql->compress != 0;
-            used = snprintf(nextra, remaining, " ql_compressed:%d", compressed);
-            nextra += used;
-            remaining -= used;
-            /* Add total uncompressed size */
-            unsigned long sz = 0;
-            for (quicklistNode *node = ql->head; node; node = node->next) {
-                sz += node->sz;
-            }
-            used = snprintf(nextra, remaining, " ql_uncompressed_size:%lu", sz);
-            nextra += used;
-            remaining -= used;
-        }
-
-        addReplyStatusFormat(c,
-            "Value at:%p refcount:%d "
-            "encoding:%s serializedlength:%zu "
-            "lru:%d lru_seconds_idle:%llu%s",
-            (void*)val, val->refcount,
-            strenc, rdbSavedObjectLen(val, c->argv[2]),
-            val->lru, estimateObjectIdleTime(val)/1000, extra);
-    } else if (!strcasecmp(c->argv[1]->ptr,"sdslen") && c->argc == 3) {
-        dictEntry *de;
-        robj *val;
-        sds key;
-
-        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
-            addReplyErrorObject(c,shared.nokeyerr);
-            return;
-        }
-        val = dictGetVal(de);
-        key = dictGetKey(de);
-
-        if (val->type != OBJ_STRING || !sdsEncodedObject(val)) {
-            addReplyError(c,"Not an sds encoded string.");
-        } else {
-            addReplyStatusFormat(c,
-                "key_sds_len:%lld, key_sds_avail:%lld, key_zmalloc: %lld, "
-                "val_sds_len:%lld, val_sds_avail:%lld, val_zmalloc: %lld",
-                (long long) sdslen(key),
-                (long long) sdsavail(key),
-                (long long) sdsZmallocSize(key),
-                (long long) sdslen(val->ptr),
-                (long long) sdsavail(val->ptr),
-                (long long) getStringObjectSdsUsedMemory(val));
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"ziplist") && c->argc == 3) {
-        robj *o;
-
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.nokeyerr))
-                == NULL) return;
-
-        if (o->encoding != OBJ_ENCODING_ZIPLIST) {
-            addReplyError(c,"Not a ziplist encoded object.");
-        } else {
-            ziplistRepr(o->ptr);
-            addReplyStatus(c,"Ziplist structure printed on stdout");
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"populate") &&
-               c->argc >= 3 && c->argc <= 5) {
-        long keys, j;
-        robj *key, *val;
-        char buf[128];
-
-        if (getPositiveLongFromObjectOrReply(c, c->argv[2], &keys, NULL) != C_OK)
-            return;
-
-        dictExpand(c->db->dict,keys);
-        long valsize = 0;
-        if ( c->argc == 5 && getPositiveLongFromObjectOrReply(c, c->argv[4], &valsize, NULL) != C_OK ) 
-            return;
-
-        for (j = 0; j < keys; j++) {
-            snprintf(buf,sizeof(buf),"%s:%lu",
-                (c->argc == 3) ? "key" : (char*)c->argv[3]->ptr, j);
-            key = createStringObject(buf,strlen(buf));
-            if (lookupKeyWrite(c->db,key) != NULL) {
-                decrRefCount(key);
-                continue;
-            }
-            snprintf(buf,sizeof(buf),"value:%lu",j);
-            if (valsize==0)
-                val = createStringObject(buf,strlen(buf));
-            else {
-                int buflen = strlen(buf);
-                val = createStringObject(NULL,valsize);
-                memcpy(val->ptr, buf, valsize<=buflen? valsize: buflen);
-            }
-            dbAdd(c->db,key,val);
-            signalModifiedKey(c,c->db,key);
-            decrRefCount(key);
-        }
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"digest") && c->argc == 2) {
-        /* DEBUG DIGEST (form without keys specified) */
-        unsigned char digest[20];
-        sds d = sdsempty();
-
-        computeDatasetDigest(digest);
-        for (int i = 0; i < 20; i++) d = sdscatprintf(d, "%02x",digest[i]);
-        addReplyStatus(c,d);
-        sdsfree(d);
-    } else if (!strcasecmp(c->argv[1]->ptr,"digest-value") && c->argc >= 2) {
-        /* DEBUG DIGEST-VALUE key key key ... key. */
-        addReplyArrayLen(c,c->argc-2);
-        for (int j = 2; j < c->argc; j++) {
-            unsigned char digest[20];
-            memset(digest,0,20); /* Start with a clean result */
-
-            /* We don't use lookupKey because a debug command should
-             * work on logically expired keys */
-            dictEntry *de;
-            robj *o = ((de = dictFind(c->db->dict,c->argv[j]->ptr)) == NULL) ? NULL : dictGetVal(de);
-            if (o) xorObjectDigest(c->db,c->argv[j],digest,o);
-
-            sds d = sdsempty();
-            for (int i = 0; i < 20; i++) d = sdscatprintf(d, "%02x",digest[i]);
-            addReplyStatus(c,d);
-            sdsfree(d);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"protocol") && c->argc == 3) {
-        /* DEBUG PROTOCOL [string|integer|double|bignum|null|array|set|map|
-         *                 attrib|push|verbatim|true|false] */
-        char *name = c->argv[2]->ptr;
-        if (!strcasecmp(name,"string")) {
-            addReplyBulkCString(c,"Hello World");
-        } else if (!strcasecmp(name,"integer")) {
-            addReplyLongLong(c,12345);
-        } else if (!strcasecmp(name,"double")) {
-            addReplyDouble(c,3.14159265359);
-        } else if (!strcasecmp(name,"bignum")) {
-            addReplyBigNum(c,"1234567999999999999999999999999999999",37);
-        } else if (!strcasecmp(name,"null")) {
-            addReplyNull(c);
-        } else if (!strcasecmp(name,"array")) {
-            addReplyArrayLen(c,3);
-            for (int j = 0; j < 3; j++) addReplyLongLong(c,j);
-        } else if (!strcasecmp(name,"set")) {
-            addReplySetLen(c,3);
-            for (int j = 0; j < 3; j++) addReplyLongLong(c,j);
-        } else if (!strcasecmp(name,"map")) {
-            addReplyMapLen(c,3);
-            for (int j = 0; j < 3; j++) {
-                addReplyLongLong(c,j);
-                addReplyBool(c, j == 1);
-            }
-        } else if (!strcasecmp(name,"attrib")) {
-            if (c->resp >= 3) {
-                addReplyAttributeLen(c,1);
-                addReplyBulkCString(c,"key-popularity");
-                addReplyArrayLen(c,2);
-                addReplyBulkCString(c,"key:123");
-                addReplyLongLong(c,90);
-            }
-            /* Attributes are not real replies, so a well formed reply should
-             * also have a normal reply type after the attribute. */
-            addReplyBulkCString(c,"Some real reply following the attribute");
-        } else if (!strcasecmp(name,"push")) {
-            addReplyPushLen(c,2);
-            addReplyBulkCString(c,"server-cpu-usage");
-            addReplyLongLong(c,42);
-            /* Push replies are not synchronous replies, so we emit also a
-             * normal reply in order for blocking clients just discarding the
-             * push reply, to actually consume the reply and continue. */
-            addReplyBulkCString(c,"Some real reply following the push reply");
-        } else if (!strcasecmp(name,"true")) {
-            addReplyBool(c,1);
-        } else if (!strcasecmp(name,"false")) {
-            addReplyBool(c,0);
-        } else if (!strcasecmp(name,"verbatim")) {
-            addReplyVerbatim(c,"This is a verbatim\nstring",25,"txt");
-        } else {
-            addReplyError(c,"Wrong protocol type name. Please use one of the following: string|integer|double|bignum|null|array|set|map|attrib|push|verbatim|true|false");
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"sleep") && c->argc == 3) {
-        double dtime = strtod(c->argv[2]->ptr,NULL);
-        long long utime = dtime*1000000;
-        struct timespec tv;
-
-        tv.tv_sec = utime / 1000000;
-        tv.tv_nsec = (utime % 1000000) * 1000;
-        nanosleep(&tv, NULL);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"set-active-expire") &&
-               c->argc == 3)
-    {
-        server.active_expire_enabled = atoi(c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"set-skip-checksum-validation") &&
-               c->argc == 3)
-    {
-        server.skip_checksum_validation = atoi(c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"aof-flush-sleep") &&
-               c->argc == 3)
-    {
-        server.aof_flush_sleep = atoi(c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"lua-always-replicate-commands") &&
-               c->argc == 3)
-    {
-        server.lua_always_replicate_commands = atoi(c->argv[2]->ptr);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"error") && c->argc == 3) {
-        sds errstr = sdsnewlen("-",1);
-
-        errstr = sdscatsds(errstr,c->argv[2]->ptr);
-        errstr = sdsmapchars(errstr,"\n\r","  ",2); /* no newlines in errors. */
-        errstr = sdscatlen(errstr,"\r\n",2);
-        addReplySds(c,errstr);
-    } else if (!strcasecmp(c->argv[1]->ptr,"structsize") && c->argc == 2) {
-        sds sizes = sdsempty();
-        sizes = sdscatprintf(sizes,"bits:%d ",(sizeof(void*) == 8)?64:32);
-        sizes = sdscatprintf(sizes,"robj:%d ",(int)sizeof(robj));
-        sizes = sdscatprintf(sizes,"dictentry:%d ",(int)sizeof(dictEntry));
-        sizes = sdscatprintf(sizes,"sdshdr5:%d ",(int)sizeof(struct sdshdr5));
-        sizes = sdscatprintf(sizes,"sdshdr8:%d ",(int)sizeof(struct sdshdr8));
-        sizes = sdscatprintf(sizes,"sdshdr16:%d ",(int)sizeof(struct sdshdr16));
-        sizes = sdscatprintf(sizes,"sdshdr32:%d ",(int)sizeof(struct sdshdr32));
-        sizes = sdscatprintf(sizes,"sdshdr64:%d ",(int)sizeof(struct sdshdr64));
-        addReplyBulkSds(c,sizes);
-    } else if (!strcasecmp(c->argv[1]->ptr,"htstats") && c->argc == 3) {
-        long dbid;
-        sds stats = sdsempty();
-        char buf[4096];
-
-        if (getLongFromObjectOrReply(c, c->argv[2], &dbid, NULL) != C_OK) {
-            sdsfree(stats);
-            return;
-        }
-        if (dbid < 0 || dbid >= server.dbnum) {
-            sdsfree(stats);
-            addReplyError(c,"Out of range database");
-            return;
-        }
-
-        stats = sdscatprintf(stats,"[Dictionary HT]\n");
-        dictGetStats(buf,sizeof(buf),server.db[dbid].dict);
-        stats = sdscat(stats,buf);
-
-        stats = sdscatprintf(stats,"[Expires HT]\n");
-        dictGetStats(buf,sizeof(buf),server.db[dbid].expires);
-        stats = sdscat(stats,buf);
-
-        addReplyVerbatim(c,stats,sdslen(stats),"txt");
-        sdsfree(stats);
-    } else if (!strcasecmp(c->argv[1]->ptr,"htstats-key") && c->argc == 3) {
-        robj *o;
-        dict *ht = NULL;
-
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.nokeyerr))
-                == NULL) return;
-
-        /* Get the hash table reference from the object, if possible. */
-        switch (o->encoding) {
-        case OBJ_ENCODING_SKIPLIST:
-            {
-                zset *zs = o->ptr;
-                ht = zs->dict;
-            }
-            break;
-        case OBJ_ENCODING_HT:
-            ht = o->ptr;
-            break;
-        }
-
-        if (ht == NULL) {
-            addReplyError(c,"The value stored at the specified key is not "
-                            "represented using an hash table");
-        } else {
-            char buf[4096];
-            dictGetStats(buf,sizeof(buf),ht);
-            addReplyVerbatim(c,buf,strlen(buf),"txt");
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"change-repl-id") && c->argc == 2) {
-        serverLog(LL_WARNING,"Changing replication IDs after receiving DEBUG change-repl-id");
-        changeReplicationId();
-        clearReplicationId2();
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"stringmatch-test") && c->argc == 2)
-    {
-        stringmatchlen_fuzz_test();
-        addReplyStatus(c,"Apparently Redis did not crash: test passed");
-    } else if (!strcasecmp(c->argv[1]->ptr,"config-rewrite-force-all") && c->argc == 2)
-    {
-        if (rewriteConfig(server.configfile, 1) == -1)
-            addReplyError(c, "CONFIG-REWRITE-FORCE-ALL failed");
-        else
-            addReply(c, shared.ok);
-#ifdef USE_JEMALLOC
-    } else if(!strcasecmp(c->argv[1]->ptr,"mallctl") && c->argc >= 3) {
-        mallctl_int(c, c->argv+2, c->argc-2);
-        return;
-    } else if(!strcasecmp(c->argv[1]->ptr,"mallctl-str") && c->argc >= 3) {
-        mallctl_string(c, c->argv+2, c->argc-2);
-        return;
-#endif
-    } else {
-        addReplySubcommandSyntaxError(c);
-        return;
-    }
-}
-
-/* =========================== Crash handling  ============================== */
-
-void _serverAssert(const char *estr, const char *file, int line) {
-    bugReportStart();
-    serverLog(LL_WARNING,"=== ASSERTION FAILED ===");
-    serverLog(LL_WARNING,"==> %s:%d '%s' is not true",file,line,estr);
-
-    if (server.crashlog_enabled) {
-#ifdef HAVE_BACKTRACE
-        logStackTrace(NULL, 1);
-#endif
-        printCrashReport();
-    }
-
-    // remove the signal handler so on abort() we will output the crash report.
-    removeSignalHandlers();
-    bugReportEnd(0, 0);
-}
-
-void _serverAssertPrintClientInfo(const client *c) {
-    int j;
-    char conninfo[CONN_INFO_LEN];
-
-    bugReportStart();
-    serverLog(LL_WARNING,"=== ASSERTION FAILED CLIENT CONTEXT ===");
-    serverLog(LL_WARNING,"client->flags = %llu", (unsigned long long) c->flags);
-    serverLog(LL_WARNING,"client->conn = %s", connGetInfo(c->conn, conninfo, sizeof(conninfo)));
-    serverLog(LL_WARNING,"client->argc = %d", c->argc);
-    for (j=0; j < c->argc; j++) {
-        char buf[128];
-        char *arg;
-
-        if (c->argv[j]->type == OBJ_STRING && sdsEncodedObject(c->argv[j])) {
-            arg = (char*) c->argv[j]->ptr;
-        } else {
-            snprintf(buf,sizeof(buf),"Object type: %u, encoding: %u",
-                c->argv[j]->type, c->argv[j]->encoding);
-            arg = buf;
-        }
-        serverLog(LL_WARNING,"client->argv[%d] = \"%s\" (refcount: %d)",
-            j, arg, c->argv[j]->refcount);
-    }
-}
-
-void serverLogObjectDebugInfo(const robj *o) {
-    serverLog(LL_WARNING,"Object type: %d", o->type);
-    serverLog(LL_WARNING,"Object encoding: %d", o->encoding);
-    serverLog(LL_WARNING,"Object refcount: %d", o->refcount);
-#if UNSAFE_CRASH_REPORT
-    /* This code is now disabled. o->ptr may be unreliable to print. in some
-     * cases a ziplist could have already been freed by realloc, but not yet
-     * updated to o->ptr. in other cases the call to ziplistLen may need to
-     * iterate on all the items in the list (and possibly crash again).
-     * For some cases it may be ok to crash here again, but these could cause
-     * invalid memory access which will bother valgrind and also possibly cause
-     * random memory portion to be "leaked" into the logfile. */
-    if (o->type == OBJ_STRING && sdsEncodedObject(o)) {
-        serverLog(LL_WARNING,"Object raw string len: %zu", sdslen(o->ptr));
-        if (sdslen(o->ptr) < 4096) {
-            sds repr = sdscatrepr(sdsempty(),o->ptr,sdslen(o->ptr));
-            serverLog(LL_WARNING,"Object raw string content: %s", repr);
-            sdsfree(repr);
-        }
-    } else if (o->type == OBJ_LIST) {
-        serverLog(LL_WARNING,"List length: %d", (int) listTypeLength(o));
-    } else if (o->type == OBJ_SET) {
-        serverLog(LL_WARNING,"Set size: %d", (int) setTypeSize(o));
-    } else if (o->type == OBJ_HASH) {
-        serverLog(LL_WARNING,"Hash size: %d", (int) hashTypeLength(o));
-    } else if (o->type == OBJ_ZSET) {
-        serverLog(LL_WARNING,"Sorted set size: %d", (int) zsetLength(o));
-        if (o->encoding == OBJ_ENCODING_SKIPLIST)
-            serverLog(LL_WARNING,"Skiplist level: %d", (int) ((const zset*)o->ptr)->zsl->level);
-    } else if (o->type == OBJ_STREAM) {
-        serverLog(LL_WARNING,"Stream size: %d", (int) streamLength(o));
-    }
-#endif
-}
-
-void _serverAssertPrintObject(const robj *o) {
-    bugReportStart();
-    serverLog(LL_WARNING,"=== ASSERTION FAILED OBJECT CONTEXT ===");
-    serverLogObjectDebugInfo(o);
-}
-
-void _serverAssertWithInfo(const client *c, const robj *o, const char *estr, const char *file, int line) {
-    if (c) _serverAssertPrintClientInfo(c);
-    if (o) _serverAssertPrintObject(o);
-    _serverAssert(estr,file,line);
-}
-
-void _serverPanic(const char *file, int line, const char *msg, ...) {
-    va_list ap;
-    va_start(ap,msg);
-    char fmtmsg[256];
-    vsnprintf(fmtmsg,sizeof(fmtmsg),msg,ap);
-    va_end(ap);
-
-    bugReportStart();
-    serverLog(LL_WARNING,"------------------------------------------------");
-    serverLog(LL_WARNING,"!!! Software Failure. Press left mouse button to continue");
-    serverLog(LL_WARNING,"Guru Meditation: %s #%s:%d",fmtmsg,file,line);
-
-    if (server.crashlog_enabled) {
-#ifdef HAVE_BACKTRACE
-        logStackTrace(NULL, 1);
-#endif
-        printCrashReport();
-    }
-
-    // remove the signal handler so on abort() we will output the crash report.
-    removeSignalHandlers();
-    bugReportEnd(0, 0);
-}
-
-void bugReportStart(void) {
-    pthread_mutex_lock(&bug_report_start_mutex);
-    if (bug_report_start == 0) {
-        serverLogRaw(LL_WARNING|LL_RAW,
-        "\n\n=== REDIS BUG REPORT START: Cut & paste starting from here ===\n");
-        bug_report_start = 1;
-    }
-    pthread_mutex_unlock(&bug_report_start_mutex);
-}
-
-#ifdef HAVE_BACKTRACE
-static void *getMcontextEip(ucontext_t *uc) {
-#if defined(__APPLE__) && !defined(MAC_OS_X_VERSION_10_6)
-    /* OSX < 10.6 */
-    #if defined(__x86_64__)
-    return (void*) uc->uc_mcontext->__ss.__rip;
-    #elif defined(__i386__)
-    return (void*) uc->uc_mcontext->__ss.__eip;
-    #else
-    return (void*) uc->uc_mcontext->__ss.__srr0;
-    #endif
-#elif defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)
-    /* OSX >= 10.6 */
-    #if defined(_STRUCT_X86_THREAD_STATE64) && !defined(__i386__)
-    return (void*) uc->uc_mcontext->__ss.__rip;
-    #elif defined(__i386__)
-    return (void*) uc->uc_mcontext->__ss.__eip;
-    #else
-    /* OSX ARM64 */
-    return (void*) arm_thread_state64_get_pc(uc->uc_mcontext->__ss);
-    #endif
-#elif defined(__linux__)
-    /* Linux */
-    #if defined(__i386__) || ((defined(__X86_64__) || defined(__x86_64__)) && defined(__ILP32__))
-    return (void*) uc->uc_mcontext.gregs[14]; /* Linux 32 */
-    #elif defined(__X86_64__) || defined(__x86_64__)
-    return (void*) uc->uc_mcontext.gregs[16]; /* Linux 64 */
-    #elif defined(__ia64__) /* Linux IA64 */
-    return (void*) uc->uc_mcontext.sc_ip;
-    #elif defined(__arm__) /* Linux ARM */
-    return (void*) uc->uc_mcontext.arm_pc;
-    #elif defined(__aarch64__) /* Linux AArch64 */
-    return (void*) uc->uc_mcontext.pc;
-    #endif
-#elif defined(__FreeBSD__)
-    /* FreeBSD */
-    #if defined(__i386__)
-    return (void*) uc->uc_mcontext.mc_eip;
-    #elif defined(__x86_64__)
-    return (void*) uc->uc_mcontext.mc_rip;
-    #endif
-#elif defined(__OpenBSD__)
-    /* OpenBSD */
-    #if defined(__i386__)
-    return (void*) uc->sc_eip;
-    #elif defined(__x86_64__)
-    return (void*) uc->sc_rip;
-    #endif
-#elif defined(__NetBSD__)
-    #if defined(__i386__)
-    return (void*) uc->uc_mcontext.__gregs[_REG_EIP];
-    #elif defined(__x86_64__)
-    return (void*) uc->uc_mcontext.__gregs[_REG_RIP];
-    #endif
-#elif defined(__DragonFly__)
-    return (void*) uc->uc_mcontext.mc_rip;
-#else
-    return NULL;
-#endif
-}
-
-void logStackContent(void **sp) {
-    int i;
-    for (i = 15; i >= 0; i--) {
-        unsigned long addr = (unsigned long) sp+i;
-        unsigned long val = (unsigned long) sp[i];
-
-        if (sizeof(long) == 4)
-            serverLog(LL_WARNING, "(%08lx) -> %08lx", addr, val);
-        else
-            serverLog(LL_WARNING, "(%016lx) -> %016lx", addr, val);
-    }
-}
-
-/* Log dump of processor registers */
-void logRegisters(ucontext_t *uc) {
-    serverLog(LL_WARNING|LL_RAW, "\n------ REGISTERS ------\n");
-
-/* OSX */
-#if defined(__APPLE__) && defined(MAC_OS_X_VERSION_10_6)
-  /* OSX AMD64 */
-    #if defined(_STRUCT_X86_THREAD_STATE64) && !defined(__i386__)
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCS :%016lx FS:%016lx  GS:%016lx",
-        (unsigned long) uc->uc_mcontext->__ss.__rax,
-        (unsigned long) uc->uc_mcontext->__ss.__rbx,
-        (unsigned long) uc->uc_mcontext->__ss.__rcx,
-        (unsigned long) uc->uc_mcontext->__ss.__rdx,
-        (unsigned long) uc->uc_mcontext->__ss.__rdi,
-        (unsigned long) uc->uc_mcontext->__ss.__rsi,
-        (unsigned long) uc->uc_mcontext->__ss.__rbp,
-        (unsigned long) uc->uc_mcontext->__ss.__rsp,
-        (unsigned long) uc->uc_mcontext->__ss.__r8,
-        (unsigned long) uc->uc_mcontext->__ss.__r9,
-        (unsigned long) uc->uc_mcontext->__ss.__r10,
-        (unsigned long) uc->uc_mcontext->__ss.__r11,
-        (unsigned long) uc->uc_mcontext->__ss.__r12,
-        (unsigned long) uc->uc_mcontext->__ss.__r13,
-        (unsigned long) uc->uc_mcontext->__ss.__r14,
-        (unsigned long) uc->uc_mcontext->__ss.__r15,
-        (unsigned long) uc->uc_mcontext->__ss.__rip,
-        (unsigned long) uc->uc_mcontext->__ss.__rflags,
-        (unsigned long) uc->uc_mcontext->__ss.__cs,
-        (unsigned long) uc->uc_mcontext->__ss.__fs,
-        (unsigned long) uc->uc_mcontext->__ss.__gs
-    );
-    logStackContent((void**)uc->uc_mcontext->__ss.__rsp);
-    #elif defined(__i386__)
-    /* OSX x86 */
-    serverLog(LL_WARNING,
-    "\n"
-    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
-    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
-    "SS:%08lx  EFL:%08lx EIP:%08lx CS :%08lx\n"
-    "DS:%08lx  ES:%08lx  FS :%08lx GS :%08lx",
-        (unsigned long) uc->uc_mcontext->__ss.__eax,
-        (unsigned long) uc->uc_mcontext->__ss.__ebx,
-        (unsigned long) uc->uc_mcontext->__ss.__ecx,
-        (unsigned long) uc->uc_mcontext->__ss.__edx,
-        (unsigned long) uc->uc_mcontext->__ss.__edi,
-        (unsigned long) uc->uc_mcontext->__ss.__esi,
-        (unsigned long) uc->uc_mcontext->__ss.__ebp,
-        (unsigned long) uc->uc_mcontext->__ss.__esp,
-        (unsigned long) uc->uc_mcontext->__ss.__ss,
-        (unsigned long) uc->uc_mcontext->__ss.__eflags,
-        (unsigned long) uc->uc_mcontext->__ss.__eip,
-        (unsigned long) uc->uc_mcontext->__ss.__cs,
-        (unsigned long) uc->uc_mcontext->__ss.__ds,
-        (unsigned long) uc->uc_mcontext->__ss.__es,
-        (unsigned long) uc->uc_mcontext->__ss.__fs,
-        (unsigned long) uc->uc_mcontext->__ss.__gs
-    );
-    logStackContent((void**)uc->uc_mcontext->__ss.__esp);
-    #else
-    /* OSX ARM64 */
-    serverLog(LL_WARNING,
-    "\n"
-    "x0:%016lx x1:%016lx x2:%016lx x3:%016lx\n"
-    "x4:%016lx x5:%016lx x6:%016lx x7:%016lx\n"
-    "x8:%016lx x9:%016lx x10:%016lx x11:%016lx\n"
-    "x12:%016lx x13:%016lx x14:%016lx x15:%016lx\n"
-    "x16:%016lx x17:%016lx x18:%016lx x19:%016lx\n"
-    "x20:%016lx x21:%016lx x22:%016lx x23:%016lx\n"
-    "x24:%016lx x25:%016lx x26:%016lx x27:%016lx\n"
-    "x28:%016lx fp:%016lx lr:%016lx\n"
-    "sp:%016lx pc:%016lx cpsr:%08lx\n",
-        (unsigned long) uc->uc_mcontext->__ss.__x[0],
-        (unsigned long) uc->uc_mcontext->__ss.__x[1],
-        (unsigned long) uc->uc_mcontext->__ss.__x[2],
-        (unsigned long) uc->uc_mcontext->__ss.__x[3],
-        (unsigned long) uc->uc_mcontext->__ss.__x[4],
-        (unsigned long) uc->uc_mcontext->__ss.__x[5],
-        (unsigned long) uc->uc_mcontext->__ss.__x[6],
-        (unsigned long) uc->uc_mcontext->__ss.__x[7],
-        (unsigned long) uc->uc_mcontext->__ss.__x[8],
-        (unsigned long) uc->uc_mcontext->__ss.__x[9],
-        (unsigned long) uc->uc_mcontext->__ss.__x[10],
-        (unsigned long) uc->uc_mcontext->__ss.__x[11],
-        (unsigned long) uc->uc_mcontext->__ss.__x[12],
-        (unsigned long) uc->uc_mcontext->__ss.__x[13],
-        (unsigned long) uc->uc_mcontext->__ss.__x[14],
-        (unsigned long) uc->uc_mcontext->__ss.__x[15],
-        (unsigned long) uc->uc_mcontext->__ss.__x[16],
-        (unsigned long) uc->uc_mcontext->__ss.__x[17],
-        (unsigned long) uc->uc_mcontext->__ss.__x[18],
-        (unsigned long) uc->uc_mcontext->__ss.__x[19],
-        (unsigned long) uc->uc_mcontext->__ss.__x[20],
-        (unsigned long) uc->uc_mcontext->__ss.__x[21],
-        (unsigned long) uc->uc_mcontext->__ss.__x[22],
-        (unsigned long) uc->uc_mcontext->__ss.__x[23],
-        (unsigned long) uc->uc_mcontext->__ss.__x[24],
-        (unsigned long) uc->uc_mcontext->__ss.__x[25],
-        (unsigned long) uc->uc_mcontext->__ss.__x[26],
-        (unsigned long) uc->uc_mcontext->__ss.__x[27],
-        (unsigned long) uc->uc_mcontext->__ss.__x[28],
-        (unsigned long) arm_thread_state64_get_fp(uc->uc_mcontext->__ss),
-        (unsigned long) arm_thread_state64_get_lr(uc->uc_mcontext->__ss),
-        (unsigned long) arm_thread_state64_get_sp(uc->uc_mcontext->__ss),
-        (unsigned long) arm_thread_state64_get_pc(uc->uc_mcontext->__ss),
-        (unsigned long) uc->uc_mcontext->__ss.__cpsr
-    );
-    logStackContent((void**) arm_thread_state64_get_sp(uc->uc_mcontext->__ss));
-    #endif
-/* Linux */
-#elif defined(__linux__)
-    /* Linux x86 */
-    #if defined(__i386__) || ((defined(__X86_64__) || defined(__x86_64__)) && defined(__ILP32__))
-    serverLog(LL_WARNING,
-    "\n"
-    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
-    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
-    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
-    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
-        (unsigned long) uc->uc_mcontext.gregs[11],
-        (unsigned long) uc->uc_mcontext.gregs[8],
-        (unsigned long) uc->uc_mcontext.gregs[10],
-        (unsigned long) uc->uc_mcontext.gregs[9],
-        (unsigned long) uc->uc_mcontext.gregs[4],
-        (unsigned long) uc->uc_mcontext.gregs[5],
-        (unsigned long) uc->uc_mcontext.gregs[6],
-        (unsigned long) uc->uc_mcontext.gregs[7],
-        (unsigned long) uc->uc_mcontext.gregs[18],
-        (unsigned long) uc->uc_mcontext.gregs[17],
-        (unsigned long) uc->uc_mcontext.gregs[14],
-        (unsigned long) uc->uc_mcontext.gregs[15],
-        (unsigned long) uc->uc_mcontext.gregs[3],
-        (unsigned long) uc->uc_mcontext.gregs[2],
-        (unsigned long) uc->uc_mcontext.gregs[1],
-        (unsigned long) uc->uc_mcontext.gregs[0]
-    );
-    logStackContent((void**)uc->uc_mcontext.gregs[7]);
-    #elif defined(__X86_64__) || defined(__x86_64__)
-    /* Linux AMD64 */
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
-        (unsigned long) uc->uc_mcontext.gregs[13],
-        (unsigned long) uc->uc_mcontext.gregs[11],
-        (unsigned long) uc->uc_mcontext.gregs[14],
-        (unsigned long) uc->uc_mcontext.gregs[12],
-        (unsigned long) uc->uc_mcontext.gregs[8],
-        (unsigned long) uc->uc_mcontext.gregs[9],
-        (unsigned long) uc->uc_mcontext.gregs[10],
-        (unsigned long) uc->uc_mcontext.gregs[15],
-        (unsigned long) uc->uc_mcontext.gregs[0],
-        (unsigned long) uc->uc_mcontext.gregs[1],
-        (unsigned long) uc->uc_mcontext.gregs[2],
-        (unsigned long) uc->uc_mcontext.gregs[3],
-        (unsigned long) uc->uc_mcontext.gregs[4],
-        (unsigned long) uc->uc_mcontext.gregs[5],
-        (unsigned long) uc->uc_mcontext.gregs[6],
-        (unsigned long) uc->uc_mcontext.gregs[7],
-        (unsigned long) uc->uc_mcontext.gregs[16],
-        (unsigned long) uc->uc_mcontext.gregs[17],
-        (unsigned long) uc->uc_mcontext.gregs[18]
-    );
-    logStackContent((void**)uc->uc_mcontext.gregs[15]);
-    #elif defined(__aarch64__) /* Linux AArch64 */
-    serverLog(LL_WARNING,
-	      "\n"
-	      "X18:%016lx X19:%016lx\nX20:%016lx X21:%016lx\n"
-	      "X22:%016lx X23:%016lx\nX24:%016lx X25:%016lx\n"
-	      "X26:%016lx X27:%016lx\nX28:%016lx X29:%016lx\n"
-	      "X30:%016lx\n"
-	      "pc:%016lx sp:%016lx\npstate:%016lx fault_address:%016lx\n",
-	      (unsigned long) uc->uc_mcontext.regs[18],
-	      (unsigned long) uc->uc_mcontext.regs[19],
-	      (unsigned long) uc->uc_mcontext.regs[20],
-	      (unsigned long) uc->uc_mcontext.regs[21],
-	      (unsigned long) uc->uc_mcontext.regs[22],
-	      (unsigned long) uc->uc_mcontext.regs[23],
-	      (unsigned long) uc->uc_mcontext.regs[24],
-	      (unsigned long) uc->uc_mcontext.regs[25],
-	      (unsigned long) uc->uc_mcontext.regs[26],
-	      (unsigned long) uc->uc_mcontext.regs[27],
-	      (unsigned long) uc->uc_mcontext.regs[28],
-	      (unsigned long) uc->uc_mcontext.regs[29],
-	      (unsigned long) uc->uc_mcontext.regs[30],
-	      (unsigned long) uc->uc_mcontext.pc,
-	      (unsigned long) uc->uc_mcontext.sp,
-	      (unsigned long) uc->uc_mcontext.pstate,
-	      (unsigned long) uc->uc_mcontext.fault_address
-		      );
-	      logStackContent((void**)uc->uc_mcontext.sp);
-    #elif defined(__arm__) /* Linux ARM */
-    serverLog(LL_WARNING,
-	      "\n"
-	      "R10:%016lx R9 :%016lx\nR8 :%016lx R7 :%016lx\n"
-	      "R6 :%016lx R5 :%016lx\nR4 :%016lx R3 :%016lx\n"
-	      "R2 :%016lx R1 :%016lx\nR0 :%016lx EC :%016lx\n"
-	      "fp: %016lx ip:%016lx\n"
-	      "pc:%016lx sp:%016lx\ncpsr:%016lx fault_address:%016lx\n",
-	      (unsigned long) uc->uc_mcontext.arm_r10,
-	      (unsigned long) uc->uc_mcontext.arm_r9,
-	      (unsigned long) uc->uc_mcontext.arm_r8,
-	      (unsigned long) uc->uc_mcontext.arm_r7,
-	      (unsigned long) uc->uc_mcontext.arm_r6,
-	      (unsigned long) uc->uc_mcontext.arm_r5,
-	      (unsigned long) uc->uc_mcontext.arm_r4,
-	      (unsigned long) uc->uc_mcontext.arm_r3,
-	      (unsigned long) uc->uc_mcontext.arm_r2,
-	      (unsigned long) uc->uc_mcontext.arm_r1,
-	      (unsigned long) uc->uc_mcontext.arm_r0,
-	      (unsigned long) uc->uc_mcontext.error_code,
-	      (unsigned long) uc->uc_mcontext.arm_fp,
-	      (unsigned long) uc->uc_mcontext.arm_ip,
-	      (unsigned long) uc->uc_mcontext.arm_pc,
-	      (unsigned long) uc->uc_mcontext.arm_sp,
-	      (unsigned long) uc->uc_mcontext.arm_cpsr,
-	      (unsigned long) uc->uc_mcontext.fault_address
-		      );
-	      logStackContent((void**)uc->uc_mcontext.arm_sp);
-    #endif
-#elif defined(__FreeBSD__)
-    #if defined(__x86_64__)
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
-        (unsigned long) uc->uc_mcontext.mc_rax,
-        (unsigned long) uc->uc_mcontext.mc_rbx,
-        (unsigned long) uc->uc_mcontext.mc_rcx,
-        (unsigned long) uc->uc_mcontext.mc_rdx,
-        (unsigned long) uc->uc_mcontext.mc_rdi,
-        (unsigned long) uc->uc_mcontext.mc_rsi,
-        (unsigned long) uc->uc_mcontext.mc_rbp,
-        (unsigned long) uc->uc_mcontext.mc_rsp,
-        (unsigned long) uc->uc_mcontext.mc_r8,
-        (unsigned long) uc->uc_mcontext.mc_r9,
-        (unsigned long) uc->uc_mcontext.mc_r10,
-        (unsigned long) uc->uc_mcontext.mc_r11,
-        (unsigned long) uc->uc_mcontext.mc_r12,
-        (unsigned long) uc->uc_mcontext.mc_r13,
-        (unsigned long) uc->uc_mcontext.mc_r14,
-        (unsigned long) uc->uc_mcontext.mc_r15,
-        (unsigned long) uc->uc_mcontext.mc_rip,
-        (unsigned long) uc->uc_mcontext.mc_rflags,
-        (unsigned long) uc->uc_mcontext.mc_cs
-    );
-    logStackContent((void**)uc->uc_mcontext.mc_rsp);
-    #elif defined(__i386__)
-    serverLog(LL_WARNING,
-    "\n"
-    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
-    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
-    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
-    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
-        (unsigned long) uc->uc_mcontext.mc_eax,
-        (unsigned long) uc->uc_mcontext.mc_ebx,
-        (unsigned long) uc->uc_mcontext.mc_ebx,
-        (unsigned long) uc->uc_mcontext.mc_edx,
-        (unsigned long) uc->uc_mcontext.mc_edi,
-        (unsigned long) uc->uc_mcontext.mc_esi,
-        (unsigned long) uc->uc_mcontext.mc_ebp,
-        (unsigned long) uc->uc_mcontext.mc_esp,
-        (unsigned long) uc->uc_mcontext.mc_ss,
-        (unsigned long) uc->uc_mcontext.mc_eflags,
-        (unsigned long) uc->uc_mcontext.mc_eip,
-        (unsigned long) uc->uc_mcontext.mc_cs,
-        (unsigned long) uc->uc_mcontext.mc_es,
-        (unsigned long) uc->uc_mcontext.mc_fs,
-        (unsigned long) uc->uc_mcontext.mc_gs
-    );
-    logStackContent((void**)uc->uc_mcontext.mc_esp);
-    #endif
-#elif defined(__OpenBSD__)
-    #if defined(__x86_64__)
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
-        (unsigned long) uc->sc_rax,
-        (unsigned long) uc->sc_rbx,
-        (unsigned long) uc->sc_rcx,
-        (unsigned long) uc->sc_rdx,
-        (unsigned long) uc->sc_rdi,
-        (unsigned long) uc->sc_rsi,
-        (unsigned long) uc->sc_rbp,
-        (unsigned long) uc->sc_rsp,
-        (unsigned long) uc->sc_r8,
-        (unsigned long) uc->sc_r9,
-        (unsigned long) uc->sc_r10,
-        (unsigned long) uc->sc_r11,
-        (unsigned long) uc->sc_r12,
-        (unsigned long) uc->sc_r13,
-        (unsigned long) uc->sc_r14,
-        (unsigned long) uc->sc_r15,
-        (unsigned long) uc->sc_rip,
-        (unsigned long) uc->sc_rflags,
-        (unsigned long) uc->sc_cs
-    );
-    logStackContent((void**)uc->sc_rsp);
-    #elif defined(__i386__)
-    serverLog(LL_WARNING,
-    "\n"
-    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
-    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
-    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
-    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
-        (unsigned long) uc->sc_eax,
-        (unsigned long) uc->sc_ebx,
-        (unsigned long) uc->sc_ebx,
-        (unsigned long) uc->sc_edx,
-        (unsigned long) uc->sc_edi,
-        (unsigned long) uc->sc_esi,
-        (unsigned long) uc->sc_ebp,
-        (unsigned long) uc->sc_esp,
-        (unsigned long) uc->sc_ss,
-        (unsigned long) uc->sc_eflags,
-        (unsigned long) uc->sc_eip,
-        (unsigned long) uc->sc_cs,
-        (unsigned long) uc->sc_es,
-        (unsigned long) uc->sc_fs,
-        (unsigned long) uc->sc_gs
-    );
-    logStackContent((void**)uc->sc_esp);
-    #endif
-#elif defined(__NetBSD__)
-    #if defined(__x86_64__)
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RAX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RBX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RCX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RDX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RDI],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RSI],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RBP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RSP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R8],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R9],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R10],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R11],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R12],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R13],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R14],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_R15],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RIP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_RFLAGS],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_CS]
-    );
-    logStackContent((void**)uc->uc_mcontext.__gregs[_REG_RSP]);
-    #elif defined(__i386__)
-    serverLog(LL_WARNING,
-    "\n"
-    "EAX:%08lx EBX:%08lx ECX:%08lx EDX:%08lx\n"
-    "EDI:%08lx ESI:%08lx EBP:%08lx ESP:%08lx\n"
-    "SS :%08lx EFL:%08lx EIP:%08lx CS:%08lx\n"
-    "DS :%08lx ES :%08lx FS :%08lx GS:%08lx",
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EAX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EBX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EDX],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EDI],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_ESI],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EBP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_ESP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_SS],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EFLAGS],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_EIP],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_CS],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_ES],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_FS],
-        (unsigned long) uc->uc_mcontext.__gregs[_REG_GS]
-    );
-    #endif
-#elif defined(__DragonFly__)
-    serverLog(LL_WARNING,
-    "\n"
-    "RAX:%016lx RBX:%016lx\nRCX:%016lx RDX:%016lx\n"
-    "RDI:%016lx RSI:%016lx\nRBP:%016lx RSP:%016lx\n"
-    "R8 :%016lx R9 :%016lx\nR10:%016lx R11:%016lx\n"
-    "R12:%016lx R13:%016lx\nR14:%016lx R15:%016lx\n"
-    "RIP:%016lx EFL:%016lx\nCSGSFS:%016lx",
-        (unsigned long) uc->uc_mcontext.mc_rax,
-        (unsigned long) uc->uc_mcontext.mc_rbx,
-        (unsigned long) uc->uc_mcontext.mc_rcx,
-        (unsigned long) uc->uc_mcontext.mc_rdx,
-        (unsigned long) uc->uc_mcontext.mc_rdi,
-        (unsigned long) uc->uc_mcontext.mc_rsi,
-        (unsigned long) uc->uc_mcontext.mc_rbp,
-        (unsigned long) uc->uc_mcontext.mc_rsp,
-        (unsigned long) uc->uc_mcontext.mc_r8,
-        (unsigned long) uc->uc_mcontext.mc_r9,
-        (unsigned long) uc->uc_mcontext.mc_r10,
-        (unsigned long) uc->uc_mcontext.mc_r11,
-        (unsigned long) uc->uc_mcontext.mc_r12,
-        (unsigned long) uc->uc_mcontext.mc_r13,
-        (unsigned long) uc->uc_mcontext.mc_r14,
-        (unsigned long) uc->uc_mcontext.mc_r15,
-        (unsigned long) uc->uc_mcontext.mc_rip,
-        (unsigned long) uc->uc_mcontext.mc_rflags,
-        (unsigned long) uc->uc_mcontext.mc_cs
-    );
-    logStackContent((void**)uc->uc_mcontext.mc_rsp);
-#else
-    serverLog(LL_WARNING,
-        "  Dumping of registers not supported for this OS/arch");
-#endif
-}
-
-#endif /* HAVE_BACKTRACE */
-
-/* Return a file descriptor to write directly to the Redis log with the
- * write(2) syscall, that can be used in critical sections of the code
- * where the rest of Redis can't be trusted (for example during the memory
- * test) or when an API call requires a raw fd.
- *
- * Close it with closeDirectLogFiledes(). */
-int openDirectLogFiledes(void) {
-    int log_to_stdout = server.logfile[0] == '\0';
-    int fd = log_to_stdout ?
-        STDOUT_FILENO :
-        open(server.logfile, O_APPEND|O_CREAT|O_WRONLY, 0644);
-    return fd;
-}
-
-/* Used to close what closeDirectLogFiledes() returns. */
-void closeDirectLogFiledes(int fd) {
-    int log_to_stdout = server.logfile[0] == '\0';
-    if (!log_to_stdout) close(fd);
-}
-
-#ifdef HAVE_BACKTRACE
-
-/* Logs the stack trace using the backtrace() call. This function is designed
- * to be called from signal handlers safely.
- * The eip argument is optional (can take NULL).
- * The uplevel argument indicates how many of the calling functions to skip.
- */
-void logStackTrace(void *eip, int uplevel) {
-    void *trace[100];
-    int trace_size = 0, fd = openDirectLogFiledes();
-    char *msg;
-    uplevel++; /* skip this function */
-
-    if (fd == -1) return; /* If we can't log there is anything to do. */
-
-    /* Get the stack trace first! */
-    trace_size = backtrace(trace, 100);
-
-    msg = "\n------ STACK TRACE ------\n";
-    if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
-
-    if (eip) {
-        /* Write EIP to the log file*/
-        msg = "EIP:\n";
-        if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
-        backtrace_symbols_fd(&eip, 1, fd);
-    }
-
-    /* Write symbols to log file */
-    msg = "\nBacktrace:\n";
-    if (write(fd,msg,strlen(msg)) == -1) {/* Avoid warning. */};
-    backtrace_symbols_fd(trace+uplevel, trace_size-uplevel, fd);
-
-    /* Cleanup */
-    closeDirectLogFiledes(fd);
-}
-
-#endif /* HAVE_BACKTRACE */
-
-/* Log global server info */
-void logServerInfo(void) {
-    sds infostring, clients;
-    serverLogRaw(LL_WARNING|LL_RAW, "\n------ INFO OUTPUT ------\n");
-    infostring = genRedisInfoString("all");
-    serverLogRaw(LL_WARNING|LL_RAW, infostring);
-    serverLogRaw(LL_WARNING|LL_RAW, "\n------ CLIENT LIST OUTPUT ------\n");
-    clients = getAllClientsInfoString(-1);
-    serverLogRaw(LL_WARNING|LL_RAW, clients);
-    sdsfree(infostring);
-    sdsfree(clients);
-}
-
-/* Log modules info. Something we wanna do last since we fear it may crash. */
-void logModulesInfo(void) {
-    serverLogRaw(LL_WARNING|LL_RAW, "\n------ MODULES INFO OUTPUT ------\n");
-    sds infostring = modulesCollectInfo(sdsempty(), NULL, 1, 0);
-    serverLogRaw(LL_WARNING|LL_RAW, infostring);
-    sdsfree(infostring);
-}
-
-/* Log information about the "current" client, that is, the client that is
- * currently being served by Redis. May be NULL if Redis is not serving a
- * client right now. */
-void logCurrentClient(void) {
-    if (server.current_client == NULL) return;
-
-    client *cc = server.current_client;
-    sds client;
-    int j;
-
-    serverLogRaw(LL_WARNING|LL_RAW, "\n------ CURRENT CLIENT INFO ------\n");
-    client = catClientInfoString(sdsempty(),cc);
-    serverLog(LL_WARNING|LL_RAW,"%s\n", client);
-    sdsfree(client);
-    for (j = 0; j < cc->argc; j++) {
-        robj *decoded;
-
-        decoded = getDecodedObject(cc->argv[j]);
-        serverLog(LL_WARNING|LL_RAW,"argv[%d]: '%s'\n", j,
-            (char*)decoded->ptr);
-        decrRefCount(decoded);
-    }
-    /* Check if the first argument, usually a key, is found inside the
-     * selected DB, and if so print info about the associated object. */
-    if (cc->argc > 1) {
-        robj *val, *key;
-        dictEntry *de;
-
-        key = getDecodedObject(cc->argv[1]);
-        de = dictFind(cc->db->dict, key->ptr);
-        if (de) {
-            val = dictGetVal(de);
-            serverLog(LL_WARNING,"key '%s' found in DB containing the following object:", (char*)key->ptr);
-            serverLogObjectDebugInfo(val);
-        }
-        decrRefCount(key);
-    }
-}
-
-#if defined(HAVE_PROC_MAPS)
-
-#define MEMTEST_MAX_REGIONS 128
-
-/* A non destructive memory test executed during segfault. */
-int memtest_test_linux_anonymous_maps(void) {
-    FILE *fp;
-    char line[1024];
-    char logbuf[1024];
-    size_t start_addr, end_addr, size;
-    size_t start_vect[MEMTEST_MAX_REGIONS];
-    size_t size_vect[MEMTEST_MAX_REGIONS];
-    int regions = 0, j;
-
-    int fd = openDirectLogFiledes();
-    if (!fd) return 0;
-
-    fp = fopen("/proc/self/maps","r");
-    if (!fp) return 0;
-    while(fgets(line,sizeof(line),fp) != NULL) {
-        char *start, *end, *p = line;
-
-        start = p;
-        p = strchr(p,'-');
-        if (!p) continue;
-        *p++ = '\0';
-        end = p;
-        p = strchr(p,' ');
-        if (!p) continue;
-        *p++ = '\0';
-        if (strstr(p,"stack") ||
-            strstr(p,"vdso") ||
-            strstr(p,"vsyscall")) continue;
-        if (!strstr(p,"00:00")) continue;
-        if (!strstr(p,"rw")) continue;
-
-        start_addr = strtoul(start,NULL,16);
-        end_addr = strtoul(end,NULL,16);
-        size = end_addr-start_addr;
-
-        start_vect[regions] = start_addr;
-        size_vect[regions] = size;
-        snprintf(logbuf,sizeof(logbuf),
-            "*** Preparing to test memory region %lx (%lu bytes)\n",
-                (unsigned long) start_vect[regions],
-                (unsigned long) size_vect[regions]);
-        if (write(fd,logbuf,strlen(logbuf)) == -1) { /* Nothing to do. */ }
-        regions++;
-    }
-
-    int errors = 0;
-    for (j = 0; j < regions; j++) {
-        if (write(fd,".",1) == -1) { /* Nothing to do. */ }
-        errors += memtest_preserving_test((void*)start_vect[j],size_vect[j],1);
-        if (write(fd, errors ? "E" : "O",1) == -1) { /* Nothing to do. */ }
-    }
-    if (write(fd,"\n",1) == -1) { /* Nothing to do. */ }
-
-    /* NOTE: It is very important to close the file descriptor only now
-     * because closing it before may result into unmapping of some memory
-     * region that we are testing. */
-    fclose(fp);
-    closeDirectLogFiledes(fd);
-    return errors;
-}
-#endif /* HAVE_PROC_MAPS */
-
-static void killMainThread(void) {
-    int err;
-    if (pthread_self() != server.main_thread_id && pthread_cancel(server.main_thread_id) == 0) {
-        if ((err = pthread_join(server.main_thread_id,NULL)) != 0) {
-            serverLog(LL_WARNING, "main thread can not be joined: %s", strerror(err));
-        } else {
-            serverLog(LL_WARNING, "main thread terminated");
-        }
-    }
-}
-
-/* Kill the running threads (other than current) in an unclean way. This function
- * should be used only when it's critical to stop the threads for some reason.
- * Currently Redis does this only on crash (for instance on SIGSEGV) in order
- * to perform a fast memory check without other threads messing with memory. */
-void killThreads(void) {
-    killMainThread();
-    bioKillThreads();
-    killIOThreads();
-}
-
-void doFastMemoryTest(void) {
-#if defined(HAVE_PROC_MAPS)
-    if (server.memcheck_enabled) {
-        /* Test memory */
-        serverLogRaw(LL_WARNING|LL_RAW, "\n------ FAST MEMORY TEST ------\n");
-        killThreads();
-        if (memtest_test_linux_anonymous_maps()) {
-            serverLogRaw(LL_WARNING|LL_RAW,
-                "!!! MEMORY ERROR DETECTED! Check your memory ASAP !!!\n");
-        } else {
-            serverLogRaw(LL_WARNING|LL_RAW,
-                "Fast memory test PASSED, however your memory can still be broken. Please run a memory test for several hours if possible.\n");
-        }
-    }
-#endif /* HAVE_PROC_MAPS */
-}
-
-/* Scans the (assumed) x86 code starting at addr, for a max of `len`
- * bytes, searching for E8 (callq) opcodes, and dumping the symbols
- * and the call offset if they appear to be valid. */
-void dumpX86Calls(void *addr, size_t len) {
-    size_t j;
-    unsigned char *p = addr;
-    Dl_info info;
-    /* Hash table to best-effort avoid printing the same symbol
-     * multiple times. */
-    unsigned long ht[256] = {0};
-
-    if (len < 5) return;
-    for (j = 0; j < len-4; j++) {
-        if (p[j] != 0xE8) continue; /* Not an E8 CALL opcode. */
-        unsigned long target = (unsigned long)addr+j+5;
-        target += *((int32_t*)(p+j+1));
-        if (dladdr((void*)target, &info) != 0 && info.dli_sname != NULL) {
-            if (ht[target&0xff] != target) {
-                printf("Function at 0x%lx is %s\n",target,info.dli_sname);
-                ht[target&0xff] = target;
-            }
-            j += 4; /* Skip the 32 bit immediate. */
-        }
-    }
-}
-
-void dumpCodeAroundEIP(void *eip) {
-    Dl_info info;
-    if (dladdr(eip, &info) != 0) {
-        serverLog(LL_WARNING|LL_RAW,
-            "\n------ DUMPING CODE AROUND EIP ------\n"
-            "Symbol: %s (base: %p)\n"
-            "Module: %s (base %p)\n"
-            "$ xxd -r -p /tmp/dump.hex /tmp/dump.bin\n"
-            "$ objdump --adjust-vma=%p -D -b binary -m i386:x86-64 /tmp/dump.bin\n"
-            "------\n",
-            info.dli_sname, info.dli_saddr, info.dli_fname, info.dli_fbase,
-            info.dli_saddr);
-        size_t len = (long)eip - (long)info.dli_saddr;
-        unsigned long sz = sysconf(_SC_PAGESIZE);
-        if (len < 1<<13) { /* we don't have functions over 8k (verified) */
-            /* Find the address of the next page, which is our "safety"
-             * limit when dumping. Then try to dump just 128 bytes more
-             * than EIP if there is room, or stop sooner. */
-            void *base = (void *)info.dli_saddr;
-            unsigned long next = ((unsigned long)eip + sz) & ~(sz-1);
-            unsigned long end = (unsigned long)eip + 128;
-            if (end > next) end = next;
-            len = end - (unsigned long)base;
-            serverLogHexDump(LL_WARNING, "dump of function",
-                base, len);
-            dumpX86Calls(base, len);
-        }
-    }
-}
-
-void sigsegvHandler(int sig, siginfo_t *info, void *secret) {
-    UNUSED(secret);
-    UNUSED(info);
-
-    bugReportStart();
-    serverLog(LL_WARNING,
-        "Redis %s crashed by signal: %d, si_code: %d", REDIS_VERSION, sig, info->si_code);
-    if (sig == SIGSEGV || sig == SIGBUS) {
-        serverLog(LL_WARNING,
-        "Accessing address: %p", (void*)info->si_addr);
-    }
-    if (info->si_code <= SI_USER && info->si_pid != -1) {
-        serverLog(LL_WARNING, "Killed by PID: %ld, UID: %d", (long) info->si_pid, info->si_uid);
-    }
-
-#ifdef HAVE_BACKTRACE
-    ucontext_t *uc = (ucontext_t*) secret;
-    void *eip = getMcontextEip(uc);
-    if (eip != NULL) {
-        serverLog(LL_WARNING,
-        "Crashed running the instruction at: %p", eip);
-    }
-
-    logStackTrace(getMcontextEip(uc), 1);
-
-    logRegisters(uc);
-#endif
-
-    printCrashReport();
-
-#ifdef HAVE_BACKTRACE
-    if (eip != NULL)
-        dumpCodeAroundEIP(eip);
-#endif
-
-    bugReportEnd(1, sig);
-}
-
-void printCrashReport(void) {
-    /* Log INFO and CLIENT LIST */
-    logServerInfo();
-
-    /* Log the current client */
-    logCurrentClient();
-
-    /* Log modules info. Something we wanna do last since we fear it may crash. */
-    logModulesInfo();
-
-    /* Run memory test in case the crash was triggered by memory corruption. */
-    doFastMemoryTest();
-}
-
-void bugReportEnd(int killViaSignal, int sig) {
-    struct sigaction act;
-
-    serverLogRaw(LL_WARNING|LL_RAW,
-"\n=== REDIS BUG REPORT END. Make sure to include from START to END. ===\n\n"
-"       Please report the crash by opening an issue on github:\n\n"
-"           http://github.com/redis/redis/issues\n\n"
-"  Suspect RAM error? Use redis-server --test-memory to verify it.\n\n"
-);
-
-    /* free(messages); Don't call free() with possibly corrupted memory. */
-    if (server.daemonize && server.supervised == 0 && server.pidfile) unlink(server.pidfile);
-
-    if (!killViaSignal) {
-        if (server.use_exit_on_panic)
-            exit(1);
-        abort();
-    }
-
-    /* Make sure we exit with the right signal at the end. So for instance
-     * the core will be dumped if enabled. */
-    sigemptyset (&act.sa_mask);
-    act.sa_flags = SA_NODEFER | SA_ONSTACK | SA_RESETHAND;
-    act.sa_handler = SIG_DFL;
-    sigaction (sig, &act, NULL);
-    kill(getpid(),sig);
-}
-
-/* ==================== Logging functions for debugging ===================== */
-
-void serverLogHexDump(int level, char *descr, void *value, size_t len) {
-    char buf[65], *b;
-    unsigned char *v = value;
-    char charset[] = "0123456789abcdef";
-
-    serverLog(level,"%s (hexdump of %zu bytes):", descr, len);
-    b = buf;
-    while(len) {
-        b[0] = charset[(*v)>>4];
-        b[1] = charset[(*v)&0xf];
-        b[2] = '\0';
-        b += 2;
-        len--;
-        v++;
-        if (b-buf == 64 || len == 0) {
-            serverLogRaw(level|LL_RAW,buf);
-            b = buf;
-        }
-    }
-    serverLogRaw(level|LL_RAW,"\n");
-}
-
-/* =========================== Software Watchdog ============================ */
-#include <sys/time.h>
-
-void watchdogSignalHandler(int sig, siginfo_t *info, void *secret) {
-#ifdef HAVE_BACKTRACE
-    ucontext_t *uc = (ucontext_t*) secret;
-#else
-    (void)secret;
-#endif
-    UNUSED(info);
-    UNUSED(sig);
-
-    serverLogFromHandler(LL_WARNING,"\n--- WATCHDOG TIMER EXPIRED ---");
-#ifdef HAVE_BACKTRACE
-    logStackTrace(getMcontextEip(uc), 1);
-#else
-    serverLogFromHandler(LL_WARNING,"Sorry: no support for backtrace().");
-#endif
-    serverLogFromHandler(LL_WARNING,"--------\n");
-}
-
-/* Schedule a SIGALRM delivery after the specified period in milliseconds.
- * If a timer is already scheduled, this function will re-schedule it to the
- * specified time. If period is 0 the current timer is disabled. */
-void watchdogScheduleSignal(int period) {
-    struct itimerval it;
-
-    /* Will stop the timer if period is 0. */
-    it.it_value.tv_sec = period/1000;
-    it.it_value.tv_usec = (period%1000)*1000;
-    /* Don't automatically restart. */
-    it.it_interval.tv_sec = 0;
-    it.it_interval.tv_usec = 0;
-    setitimer(ITIMER_REAL, &it, NULL);
-}
-
-/* Enable the software watchdog with the specified period in milliseconds. */
-void enableWatchdog(int period) {
-    int min_period;
-
-    if (server.watchdog_period == 0) {
-        struct sigaction act;
-
-        /* Watchdog was actually disabled, so we have to setup the signal
-         * handler. */
-        sigemptyset(&act.sa_mask);
-        act.sa_flags = SA_SIGINFO;
-        act.sa_sigaction = watchdogSignalHandler;
-        sigaction(SIGALRM, &act, NULL);
-    }
-    /* If the configured period is smaller than twice the timer period, it is
-     * too short for the software watchdog to work reliably. Fix it now
-     * if needed. */
-    min_period = (1000/server.hz)*2;
-    if (period < min_period) period = min_period;
-    watchdogScheduleSignal(period); /* Adjust the current timer. */
-    server.watchdog_period = period;
-}
-
-/* Disable the software watchdog. */
-void disableWatchdog(void) {
-    struct sigaction act;
-    if (server.watchdog_period == 0) return; /* Already disabled. */
-    watchdogScheduleSignal(0); /* Stop the current timer. */
-
-    /* Set the signal handler to SIG_IGN, this will also remove pending
-     * signals from the queue. */
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = 0;
-    act.sa_handler = SIG_IGN;
-    sigaction(SIGALRM, &act, NULL);
-    server.watchdog_period = 0;
-}
-
-/* Positive input is sleep time in microseconds. Negative input is fractions
- * of microseconds, i.e. -10 means 100 nanoseconds. */
-void debugDelay(int usec) {
-    /* Since even the shortest sleep results in context switch and system call,
-     * the way we achive short sleeps is by statistically sleeping less often. */
-    if (usec < 0) usec = (rand() % -usec) == 0 ? 1: 0;
-    if (usec) usleep(usec);
-}
diff --git a/redis-stable/src/debugmacro.h b/redis-stable/src/debugmacro.h
deleted file mode 100644
index 58e6577e..00000000
--- a/redis-stable/src/debugmacro.h
+++ /dev/null
@@ -1,41 +0,0 @@
-/* This file contains debugging macros to be used when investigating issues.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdio.h>
-#define D(...)                                                               \
-    do {                                                                     \
-        FILE *fp = fopen("/tmp/log.txt","a");                                \
-        fprintf(fp,"%s:%s:%d:\t", __FILE__, __func__, __LINE__);             \
-        fprintf(fp,__VA_ARGS__);                                             \
-        fprintf(fp,"\n");                                                    \
-        fclose(fp);                                                          \
-    } while (0)
diff --git a/redis-stable/src/defrag.c b/redis-stable/src/defrag.c
deleted file mode 100644
index 3dfb8679..00000000
--- a/redis-stable/src/defrag.c
+++ /dev/null
@@ -1,1215 +0,0 @@
-/* 
- * Active memory defragmentation
- * Try to find key / value allocations that need to be re-allocated in order 
- * to reduce external fragmentation.
- * We do that by scanning the keyspace and for each pointer we have, we can try to
- * ask the allocator if moving it to a new address will help reduce fragmentation.
- *
- * Copyright (c) 2020, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <time.h>
-#include <assert.h>
-#include <stddef.h>
-
-#ifdef HAVE_DEFRAG
-
-/* this method was added to jemalloc in order to help us understand which
- * pointers are worthwhile moving and which aren't */
-int je_get_defrag_hint(void* ptr);
-
-/* forward declarations*/
-void defragDictBucketCallback(void *privdata, dictEntry **bucketref);
-dictEntry* replaceSatelliteDictKeyPtrAndOrDefragDictEntry(dict *d, sds oldkey, sds newkey, uint64_t hash, long *defragged);
-
-/* Defrag helper for generic allocations.
- *
- * returns NULL in case the allocation wasn't moved.
- * when it returns a non-null value, the old pointer was already released
- * and should NOT be accessed. */
-void* activeDefragAlloc(void *ptr) {
-    size_t size;
-    void *newptr;
-    if(!je_get_defrag_hint(ptr)) {
-        server.stat_active_defrag_misses++;
-        return NULL;
-    }
-    /* move this allocation to a new allocation.
-     * make sure not to use the thread cache. so that we don't get back the same
-     * pointers we try to free */
-    size = zmalloc_size(ptr);
-    newptr = zmalloc_no_tcache(size);
-    memcpy(newptr, ptr, size);
-    zfree_no_tcache(ptr);
-    return newptr;
-}
-
-/*Defrag helper for sds strings
- *
- * returns NULL in case the allocation wasn't moved.
- * when it returns a non-null value, the old pointer was already released
- * and should NOT be accessed. */
-sds activeDefragSds(sds sdsptr) {
-    void* ptr = sdsAllocPtr(sdsptr);
-    void* newptr = activeDefragAlloc(ptr);
-    if (newptr) {
-        size_t offset = sdsptr - (char*)ptr;
-        sdsptr = (char*)newptr + offset;
-        return sdsptr;
-    }
-    return NULL;
-}
-
-/* Defrag helper for robj and/or string objects
- *
- * returns NULL in case the allocation wasn't moved.
- * when it returns a non-null value, the old pointer was already released
- * and should NOT be accessed. */
-robj *activeDefragStringOb(robj* ob, long *defragged) {
-    robj *ret = NULL;
-    if (ob->refcount!=1)
-        return NULL;
-
-    /* try to defrag robj (only if not an EMBSTR type (handled below). */
-    if (ob->type!=OBJ_STRING || ob->encoding!=OBJ_ENCODING_EMBSTR) {
-        if ((ret = activeDefragAlloc(ob))) {
-            ob = ret;
-            (*defragged)++;
-        }
-    }
-
-    /* try to defrag string object */
-    if (ob->type == OBJ_STRING) {
-        if(ob->encoding==OBJ_ENCODING_RAW) {
-            sds newsds = activeDefragSds((sds)ob->ptr);
-            if (newsds) {
-                ob->ptr = newsds;
-                (*defragged)++;
-            }
-        } else if (ob->encoding==OBJ_ENCODING_EMBSTR) {
-            /* The sds is embedded in the object allocation, calculate the
-             * offset and update the pointer in the new allocation. */
-            long ofs = (intptr_t)ob->ptr - (intptr_t)ob;
-            if ((ret = activeDefragAlloc(ob))) {
-                ret->ptr = (void*)((intptr_t)ret + ofs);
-                (*defragged)++;
-            }
-        } else if (ob->encoding!=OBJ_ENCODING_INT) {
-            serverPanic("Unknown string encoding");
-        }
-    }
-    return ret;
-}
-
-/* Defrag helper for dictEntries to be used during dict iteration (called on
- * each step). Returns a stat of how many pointers were moved. */
-long dictIterDefragEntry(dictIterator *iter) {
-    /* This function is a little bit dirty since it messes with the internals
-     * of the dict and it's iterator, but the benefit is that it is very easy
-     * to use, and require no other changes in the dict. */
-    long defragged = 0;
-    dictht *ht;
-    /* Handle the next entry (if there is one), and update the pointer in the
-     * current entry. */
-    if (iter->nextEntry) {
-        dictEntry *newde = activeDefragAlloc(iter->nextEntry);
-        if (newde) {
-            defragged++;
-            iter->nextEntry = newde;
-            iter->entry->next = newde;
-        }
-    }
-    /* handle the case of the first entry in the hash bucket. */
-    ht = &iter->d->ht[iter->table];
-    if (ht->table[iter->index] == iter->entry) {
-        dictEntry *newde = activeDefragAlloc(iter->entry);
-        if (newde) {
-            iter->entry = newde;
-            ht->table[iter->index] = newde;
-            defragged++;
-        }
-    }
-    return defragged;
-}
-
-/* Defrag helper for dict main allocations (dict struct, and hash tables).
- * receives a pointer to the dict* and implicitly updates it when the dict
- * struct itself was moved. Returns a stat of how many pointers were moved. */
-long dictDefragTables(dict* d) {
-    dictEntry **newtable;
-    long defragged = 0;
-    /* handle the first hash table */
-    newtable = activeDefragAlloc(d->ht[0].table);
-    if (newtable)
-        defragged++, d->ht[0].table = newtable;
-    /* handle the second hash table */
-    if (d->ht[1].table) {
-        newtable = activeDefragAlloc(d->ht[1].table);
-        if (newtable)
-            defragged++, d->ht[1].table = newtable;
-    }
-    return defragged;
-}
-
-/* Internal function used by zslDefrag */
-void zslUpdateNode(zskiplist *zsl, zskiplistNode *oldnode, zskiplistNode *newnode, zskiplistNode **update) {
-    int i;
-    for (i = 0; i < zsl->level; i++) {
-        if (update[i]->level[i].forward == oldnode)
-            update[i]->level[i].forward = newnode;
-    }
-    serverAssert(zsl->header!=oldnode);
-    if (newnode->level[0].forward) {
-        serverAssert(newnode->level[0].forward->backward==oldnode);
-        newnode->level[0].forward->backward = newnode;
-    } else {
-        serverAssert(zsl->tail==oldnode);
-        zsl->tail = newnode;
-    }
-}
-
-/* Defrag helper for sorted set.
- * Update the robj pointer, defrag the skiplist struct and return the new score
- * reference. We may not access oldele pointer (not even the pointer stored in
- * the skiplist), as it was already freed. Newele may be null, in which case we
- * only need to defrag the skiplist, but not update the obj pointer.
- * When return value is non-NULL, it is the score reference that must be updated
- * in the dict record. */
-double *zslDefrag(zskiplist *zsl, double score, sds oldele, sds newele) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x, *newx;
-    int i;
-    sds ele = newele? newele: oldele;
-
-    /* find the skiplist node referring to the object that was moved,
-     * and all pointers that need to be updated if we'll end up moving the skiplist node. */
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-            x->level[i].forward->ele != oldele && /* make sure not to access the
-                                                     ->obj pointer if it matches
-                                                     oldele */
-            (x->level[i].forward->score < score ||
-                (x->level[i].forward->score == score &&
-                sdscmp(x->level[i].forward->ele,ele) < 0)))
-            x = x->level[i].forward;
-        update[i] = x;
-    }
-
-    /* update the robj pointer inside the skip list record. */
-    x = x->level[0].forward;
-    serverAssert(x && score == x->score && x->ele==oldele);
-    if (newele)
-        x->ele = newele;
-
-    /* try to defrag the skiplist record itself */
-    newx = activeDefragAlloc(x);
-    if (newx) {
-        zslUpdateNode(zsl, x, newx, update);
-        return &newx->score;
-    }
-    return NULL;
-}
-
-/* Defrag helper for sorted set.
- * Defrag a single dict entry key name, and corresponding skiplist struct */
-long activeDefragZsetEntry(zset *zs, dictEntry *de) {
-    sds newsds;
-    double* newscore;
-    long defragged = 0;
-    sds sdsele = dictGetKey(de);
-    if ((newsds = activeDefragSds(sdsele)))
-        defragged++, de->key = newsds;
-    newscore = zslDefrag(zs->zsl, *(double*)dictGetVal(de), sdsele, newsds);
-    if (newscore) {
-        dictSetVal(zs->dict, de, newscore);
-        defragged++;
-    }
-    return defragged;
-}
-
-#define DEFRAG_SDS_DICT_NO_VAL 0
-#define DEFRAG_SDS_DICT_VAL_IS_SDS 1
-#define DEFRAG_SDS_DICT_VAL_IS_STROB 2
-#define DEFRAG_SDS_DICT_VAL_VOID_PTR 3
-
-/* Defrag a dict with sds key and optional value (either ptr, sds or robj string) */
-long activeDefragSdsDict(dict* d, int val_type) {
-    dictIterator *di;
-    dictEntry *de;
-    long defragged = 0;
-    di = dictGetIterator(d);
-    while((de = dictNext(di)) != NULL) {
-        sds sdsele = dictGetKey(de), newsds;
-        if ((newsds = activeDefragSds(sdsele)))
-            de->key = newsds, defragged++;
-        /* defrag the value */
-        if (val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
-            sdsele = dictGetVal(de);
-            if ((newsds = activeDefragSds(sdsele)))
-                de->v.val = newsds, defragged++;
-        } else if (val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
-            robj *newele, *ele = dictGetVal(de);
-            if ((newele = activeDefragStringOb(ele, &defragged)))
-                de->v.val = newele;
-        } else if (val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
-            void *newptr, *ptr = dictGetVal(de);
-            if ((newptr = activeDefragAlloc(ptr)))
-                de->v.val = newptr, defragged++;
-        }
-        defragged += dictIterDefragEntry(di);
-    }
-    dictReleaseIterator(di);
-    return defragged;
-}
-
-/* Defrag a list of ptr, sds or robj string values */
-long activeDefragList(list *l, int val_type) {
-    long defragged = 0;
-    listNode *ln, *newln;
-    for (ln = l->head; ln; ln = ln->next) {
-        if ((newln = activeDefragAlloc(ln))) {
-            if (newln->prev)
-                newln->prev->next = newln;
-            else
-                l->head = newln;
-            if (newln->next)
-                newln->next->prev = newln;
-            else
-                l->tail = newln;
-            ln = newln;
-            defragged++;
-        }
-        if (val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
-            sds newsds, sdsele = ln->value;
-            if ((newsds = activeDefragSds(sdsele)))
-                ln->value = newsds, defragged++;
-        } else if (val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
-            robj *newele, *ele = ln->value;
-            if ((newele = activeDefragStringOb(ele, &defragged)))
-                ln->value = newele;
-        } else if (val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
-            void *newptr, *ptr = ln->value;
-            if ((newptr = activeDefragAlloc(ptr)))
-                ln->value = newptr, defragged++;
-        }
-    }
-    return defragged;
-}
-
-/* Defrag a list of sds values and a dict with the same sds keys */
-long activeDefragSdsListAndDict(list *l, dict *d, int dict_val_type) {
-    long defragged = 0;
-    sds newsds, sdsele;
-    listNode *ln, *newln;
-    dictIterator *di;
-    dictEntry *de;
-    /* Defrag the list and it's sds values */
-    for (ln = l->head; ln; ln = ln->next) {
-        if ((newln = activeDefragAlloc(ln))) {
-            if (newln->prev)
-                newln->prev->next = newln;
-            else
-                l->head = newln;
-            if (newln->next)
-                newln->next->prev = newln;
-            else
-                l->tail = newln;
-            ln = newln;
-            defragged++;
-        }
-        sdsele = ln->value;
-        if ((newsds = activeDefragSds(sdsele))) {
-            /* When defragging an sds value, we need to update the dict key */
-            uint64_t hash = dictGetHash(d, newsds);
-            dictEntry **deref = dictFindEntryRefByPtrAndHash(d, sdsele, hash);
-            if (deref)
-                (*deref)->key = newsds;
-            ln->value = newsds;
-            defragged++;
-        }
-    }
-
-    /* Defrag the dict values (keys were already handled) */
-    di = dictGetIterator(d);
-    while((de = dictNext(di)) != NULL) {
-        if (dict_val_type == DEFRAG_SDS_DICT_VAL_IS_SDS) {
-            sds newsds, sdsele = dictGetVal(de);
-            if ((newsds = activeDefragSds(sdsele)))
-                de->v.val = newsds, defragged++;
-        } else if (dict_val_type == DEFRAG_SDS_DICT_VAL_IS_STROB) {
-            robj *newele, *ele = dictGetVal(de);
-            if ((newele = activeDefragStringOb(ele, &defragged)))
-                de->v.val = newele, defragged++;
-        } else if (dict_val_type == DEFRAG_SDS_DICT_VAL_VOID_PTR) {
-            void *newptr, *ptr = dictGetVal(de);
-            if ((newptr = activeDefragAlloc(ptr)))
-                de->v.val = newptr, defragged++;
-        }
-        defragged += dictIterDefragEntry(di);
-    }
-    dictReleaseIterator(di);
-
-    return defragged;
-}
-
-/* Utility function that replaces an old key pointer in the dictionary with a
- * new pointer. Additionally, we try to defrag the dictEntry in that dict.
- * Oldkey mey be a dead pointer and should not be accessed (we get a
- * pre-calculated hash value). Newkey may be null if the key pointer wasn't
- * moved. Return value is the the dictEntry if found, or NULL if not found.
- * NOTE: this is very ugly code, but it let's us avoid the complication of
- * doing a scan on another dict. */
-dictEntry* replaceSatelliteDictKeyPtrAndOrDefragDictEntry(dict *d, sds oldkey, sds newkey, uint64_t hash, long *defragged) {
-    dictEntry **deref = dictFindEntryRefByPtrAndHash(d, oldkey, hash);
-    if (deref) {
-        dictEntry *de = *deref;
-        dictEntry *newde = activeDefragAlloc(de);
-        if (newde) {
-            de = *deref = newde;
-            (*defragged)++;
-        }
-        if (newkey)
-            de->key = newkey;
-        return de;
-    }
-    return NULL;
-}
-
-long activeDefragQuickListNode(quicklist *ql, quicklistNode **node_ref) {
-    quicklistNode *newnode, *node = *node_ref;
-    long defragged = 0;
-    unsigned char *newzl;
-    if ((newnode = activeDefragAlloc(node))) {
-        if (newnode->prev)
-            newnode->prev->next = newnode;
-        else
-            ql->head = newnode;
-        if (newnode->next)
-            newnode->next->prev = newnode;
-        else
-            ql->tail = newnode;
-        *node_ref = node = newnode;
-        defragged++;
-    }
-    if ((newzl = activeDefragAlloc(node->zl)))
-        defragged++, node->zl = newzl;
-    return defragged;
-}
-
-long activeDefragQuickListNodes(quicklist *ql) {
-    quicklistNode *node = ql->head;
-    long defragged = 0;
-    while (node) {
-        defragged += activeDefragQuickListNode(ql, &node);
-        node = node->next;
-    }
-    return defragged;
-}
-
-/* when the value has lots of elements, we want to handle it later and not as
- * part of the main dictionary scan. this is needed in order to prevent latency
- * spikes when handling large items */
-void defragLater(redisDb *db, dictEntry *kde) {
-    sds key = sdsdup(dictGetKey(kde));
-    listAddNodeTail(db->defrag_later, key);
-}
-
-/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
-long scanLaterList(robj *ob, unsigned long *cursor, long long endtime, long long *defragged) {
-    quicklist *ql = ob->ptr;
-    quicklistNode *node;
-    long iterations = 0;
-    int bookmark_failed = 0;
-    if (ob->type != OBJ_LIST || ob->encoding != OBJ_ENCODING_QUICKLIST)
-        return 0;
-
-    if (*cursor == 0) {
-        /* if cursor is 0, we start new iteration */
-        node = ql->head;
-    } else {
-        node = quicklistBookmarkFind(ql, "_AD");
-        if (!node) {
-            /* if the bookmark was deleted, it means we reached the end. */
-            *cursor = 0;
-            return 0;
-        }
-        node = node->next;
-    }
-
-    (*cursor)++;
-    while (node) {
-        (*defragged) += activeDefragQuickListNode(ql, &node);
-        server.stat_active_defrag_scanned++;
-        if (++iterations > 128 && !bookmark_failed) {
-            if (ustime() > endtime) {
-                if (!quicklistBookmarkCreate(&ql, "_AD", node)) {
-                    bookmark_failed = 1;
-                } else {
-                    ob->ptr = ql; /* bookmark creation may have re-allocated the quicklist */
-                    return 1;
-                }
-            }
-            iterations = 0;
-        }
-        node = node->next;
-    }
-    quicklistBookmarkDelete(ql, "_AD");
-    *cursor = 0;
-    return bookmark_failed? 1: 0;
-}
-
-typedef struct {
-    zset *zs;
-    long defragged;
-} scanLaterZsetData;
-
-void scanLaterZsetCallback(void *privdata, const dictEntry *_de) {
-    dictEntry *de = (dictEntry*)_de;
-    scanLaterZsetData *data = privdata;
-    data->defragged += activeDefragZsetEntry(data->zs, de);
-    server.stat_active_defrag_scanned++;
-}
-
-long scanLaterZset(robj *ob, unsigned long *cursor) {
-    if (ob->type != OBJ_ZSET || ob->encoding != OBJ_ENCODING_SKIPLIST)
-        return 0;
-    zset *zs = (zset*)ob->ptr;
-    dict *d = zs->dict;
-    scanLaterZsetData data = {zs, 0};
-    *cursor = dictScan(d, *cursor, scanLaterZsetCallback, defragDictBucketCallback, &data);
-    return data.defragged;
-}
-
-void scanLaterSetCallback(void *privdata, const dictEntry *_de) {
-    dictEntry *de = (dictEntry*)_de;
-    long *defragged = privdata;
-    sds sdsele = dictGetKey(de), newsds;
-    if ((newsds = activeDefragSds(sdsele)))
-        (*defragged)++, de->key = newsds;
-    server.stat_active_defrag_scanned++;
-}
-
-long scanLaterSet(robj *ob, unsigned long *cursor) {
-    long defragged = 0;
-    if (ob->type != OBJ_SET || ob->encoding != OBJ_ENCODING_HT)
-        return 0;
-    dict *d = ob->ptr;
-    *cursor = dictScan(d, *cursor, scanLaterSetCallback, defragDictBucketCallback, &defragged);
-    return defragged;
-}
-
-void scanLaterHashCallback(void *privdata, const dictEntry *_de) {
-    dictEntry *de = (dictEntry*)_de;
-    long *defragged = privdata;
-    sds sdsele = dictGetKey(de), newsds;
-    if ((newsds = activeDefragSds(sdsele)))
-        (*defragged)++, de->key = newsds;
-    sdsele = dictGetVal(de);
-    if ((newsds = activeDefragSds(sdsele)))
-        (*defragged)++, de->v.val = newsds;
-    server.stat_active_defrag_scanned++;
-}
-
-long scanLaterHash(robj *ob, unsigned long *cursor) {
-    long defragged = 0;
-    if (ob->type != OBJ_HASH || ob->encoding != OBJ_ENCODING_HT)
-        return 0;
-    dict *d = ob->ptr;
-    *cursor = dictScan(d, *cursor, scanLaterHashCallback, defragDictBucketCallback, &defragged);
-    return defragged;
-}
-
-long defragQuicklist(redisDb *db, dictEntry *kde) {
-    robj *ob = dictGetVal(kde);
-    long defragged = 0;
-    quicklist *ql = ob->ptr, *newql;
-    serverAssert(ob->type == OBJ_LIST && ob->encoding == OBJ_ENCODING_QUICKLIST);
-    if ((newql = activeDefragAlloc(ql)))
-        defragged++, ob->ptr = ql = newql;
-    if (ql->len > server.active_defrag_max_scan_fields)
-        defragLater(db, kde);
-    else
-        defragged += activeDefragQuickListNodes(ql);
-    return defragged;
-}
-
-long defragZsetSkiplist(redisDb *db, dictEntry *kde) {
-    robj *ob = dictGetVal(kde);
-    long defragged = 0;
-    zset *zs = (zset*)ob->ptr;
-    zset *newzs;
-    zskiplist *newzsl;
-    dict *newdict;
-    dictEntry *de;
-    struct zskiplistNode *newheader;
-    serverAssert(ob->type == OBJ_ZSET && ob->encoding == OBJ_ENCODING_SKIPLIST);
-    if ((newzs = activeDefragAlloc(zs)))
-        defragged++, ob->ptr = zs = newzs;
-    if ((newzsl = activeDefragAlloc(zs->zsl)))
-        defragged++, zs->zsl = newzsl;
-    if ((newheader = activeDefragAlloc(zs->zsl->header)))
-        defragged++, zs->zsl->header = newheader;
-    if (dictSize(zs->dict) > server.active_defrag_max_scan_fields)
-        defragLater(db, kde);
-    else {
-        dictIterator *di = dictGetIterator(zs->dict);
-        while((de = dictNext(di)) != NULL) {
-            defragged += activeDefragZsetEntry(zs, de);
-        }
-        dictReleaseIterator(di);
-    }
-    /* handle the dict struct */
-    if ((newdict = activeDefragAlloc(zs->dict)))
-        defragged++, zs->dict = newdict;
-    /* defrag the dict tables */
-    defragged += dictDefragTables(zs->dict);
-    return defragged;
-}
-
-long defragHash(redisDb *db, dictEntry *kde) {
-    long defragged = 0;
-    robj *ob = dictGetVal(kde);
-    dict *d, *newd;
-    serverAssert(ob->type == OBJ_HASH && ob->encoding == OBJ_ENCODING_HT);
-    d = ob->ptr;
-    if (dictSize(d) > server.active_defrag_max_scan_fields)
-        defragLater(db, kde);
-    else
-        defragged += activeDefragSdsDict(d, DEFRAG_SDS_DICT_VAL_IS_SDS);
-    /* handle the dict struct */
-    if ((newd = activeDefragAlloc(ob->ptr)))
-        defragged++, ob->ptr = newd;
-    /* defrag the dict tables */
-    defragged += dictDefragTables(ob->ptr);
-    return defragged;
-}
-
-long defragSet(redisDb *db, dictEntry *kde) {
-    long defragged = 0;
-    robj *ob = dictGetVal(kde);
-    dict *d, *newd;
-    serverAssert(ob->type == OBJ_SET && ob->encoding == OBJ_ENCODING_HT);
-    d = ob->ptr;
-    if (dictSize(d) > server.active_defrag_max_scan_fields)
-        defragLater(db, kde);
-    else
-        defragged += activeDefragSdsDict(d, DEFRAG_SDS_DICT_NO_VAL);
-    /* handle the dict struct */
-    if ((newd = activeDefragAlloc(ob->ptr)))
-        defragged++, ob->ptr = newd;
-    /* defrag the dict tables */
-    defragged += dictDefragTables(ob->ptr);
-    return defragged;
-}
-
-/* Defrag callback for radix tree iterator, called for each node,
- * used in order to defrag the nodes allocations. */
-int defragRaxNode(raxNode **noderef) {
-    raxNode *newnode = activeDefragAlloc(*noderef);
-    if (newnode) {
-        *noderef = newnode;
-        return 1;
-    }
-    return 0;
-}
-
-/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
-int scanLaterStreamListpacks(robj *ob, unsigned long *cursor, long long endtime, long long *defragged) {
-    static unsigned char last[sizeof(streamID)];
-    raxIterator ri;
-    long iterations = 0;
-    if (ob->type != OBJ_STREAM || ob->encoding != OBJ_ENCODING_STREAM) {
-        *cursor = 0;
-        return 0;
-    }
-
-    stream *s = ob->ptr;
-    raxStart(&ri,s->rax);
-    if (*cursor == 0) {
-        /* if cursor is 0, we start new iteration */
-        defragRaxNode(&s->rax->head);
-        /* assign the iterator node callback before the seek, so that the
-         * initial nodes that are processed till the first item are covered */
-        ri.node_cb = defragRaxNode;
-        raxSeek(&ri,"^",NULL,0);
-    } else {
-        /* if cursor is non-zero, we seek to the static 'last' */
-        if (!raxSeek(&ri,">", last, sizeof(last))) {
-            *cursor = 0;
-            raxStop(&ri);
-            return 0;
-        }
-        /* assign the iterator node callback after the seek, so that the
-         * initial nodes that are processed till now aren't covered */
-        ri.node_cb = defragRaxNode;
-    }
-
-    (*cursor)++;
-    while (raxNext(&ri)) {
-        void *newdata = activeDefragAlloc(ri.data);
-        if (newdata)
-            raxSetData(ri.node, ri.data=newdata), (*defragged)++;
-        server.stat_active_defrag_scanned++;
-        if (++iterations > 128) {
-            if (ustime() > endtime) {
-                serverAssert(ri.key_len==sizeof(last));
-                memcpy(last,ri.key,ri.key_len);
-                raxStop(&ri);
-                return 1;
-            }
-            iterations = 0;
-        }
-    }
-    raxStop(&ri);
-    *cursor = 0;
-    return 0;
-}
-
-/* optional callback used defrag each rax element (not including the element pointer itself) */
-typedef void *(raxDefragFunction)(raxIterator *ri, void *privdata, long *defragged);
-
-/* defrag radix tree including:
- * 1) rax struct
- * 2) rax nodes
- * 3) rax entry data (only if defrag_data is specified)
- * 4) call a callback per element, and allow the callback to return a new pointer for the element */
-long defragRadixTree(rax **raxref, int defrag_data, raxDefragFunction *element_cb, void *element_cb_data) {
-    long defragged = 0;
-    raxIterator ri;
-    rax* rax;
-    if ((rax = activeDefragAlloc(*raxref)))
-        defragged++, *raxref = rax;
-    rax = *raxref;
-    raxStart(&ri,rax);
-    ri.node_cb = defragRaxNode;
-    defragRaxNode(&rax->head);
-    raxSeek(&ri,"^",NULL,0);
-    while (raxNext(&ri)) {
-        void *newdata = NULL;
-        if (element_cb)
-            newdata = element_cb(&ri, element_cb_data, &defragged);
-        if (defrag_data && !newdata)
-            newdata = activeDefragAlloc(ri.data);
-        if (newdata)
-            raxSetData(ri.node, ri.data=newdata), defragged++;
-    }
-    raxStop(&ri);
-    return defragged;
-}
-
-typedef struct {
-    streamCG *cg;
-    streamConsumer *c;
-} PendingEntryContext;
-
-void* defragStreamConsumerPendingEntry(raxIterator *ri, void *privdata, long *defragged) {
-    UNUSED(defragged);
-    PendingEntryContext *ctx = privdata;
-    streamNACK *nack = ri->data, *newnack;
-    nack->consumer = ctx->c; /* update nack pointer to consumer */
-    newnack = activeDefragAlloc(nack);
-    if (newnack) {
-        /* update consumer group pointer to the nack */
-        void *prev;
-        raxInsert(ctx->cg->pel, ri->key, ri->key_len, newnack, &prev);
-        serverAssert(prev==nack);
-        /* note: we don't increment 'defragged' that's done by the caller */
-    }
-    return newnack;
-}
-
-void* defragStreamConsumer(raxIterator *ri, void *privdata, long *defragged) {
-    streamConsumer *c = ri->data;
-    streamCG *cg = privdata;
-    void *newc = activeDefragAlloc(c);
-    if (newc) {
-        /* note: we don't increment 'defragged' that's done by the caller */
-        c = newc;
-    }
-    sds newsds = activeDefragSds(c->name);
-    if (newsds)
-        (*defragged)++, c->name = newsds;
-    if (c->pel) {
-        PendingEntryContext pel_ctx = {cg, c};
-        *defragged += defragRadixTree(&c->pel, 0, defragStreamConsumerPendingEntry, &pel_ctx);
-    }
-    return newc; /* returns NULL if c was not defragged */
-}
-
-void* defragStreamConsumerGroup(raxIterator *ri, void *privdata, long *defragged) {
-    streamCG *cg = ri->data;
-    UNUSED(privdata);
-    if (cg->consumers)
-        *defragged += defragRadixTree(&cg->consumers, 0, defragStreamConsumer, cg);
-    if (cg->pel)
-        *defragged += defragRadixTree(&cg->pel, 0, NULL, NULL);
-    return NULL;
-}
-
-long defragStream(redisDb *db, dictEntry *kde) {
-    long defragged = 0;
-    robj *ob = dictGetVal(kde);
-    serverAssert(ob->type == OBJ_STREAM && ob->encoding == OBJ_ENCODING_STREAM);
-    stream *s = ob->ptr, *news;
-
-    /* handle the main struct */
-    if ((news = activeDefragAlloc(s)))
-        defragged++, ob->ptr = s = news;
-
-    if (raxSize(s->rax) > server.active_defrag_max_scan_fields) {
-        rax *newrax = activeDefragAlloc(s->rax);
-        if (newrax)
-            defragged++, s->rax = newrax;
-        defragLater(db, kde);
-    } else
-        defragged += defragRadixTree(&s->rax, 1, NULL, NULL);
-
-    if (s->cgroups)
-        defragged += defragRadixTree(&s->cgroups, 1, defragStreamConsumerGroup, NULL);
-    return defragged;
-}
-
-/* Defrag a module key. This is either done immediately or scheduled
- * for later. Returns then number of pointers defragged.
- */
-long defragModule(redisDb *db, dictEntry *kde) {
-    robj *obj = dictGetVal(kde);
-    serverAssert(obj->type == OBJ_MODULE);
-    long defragged = 0;
-
-    if (!moduleDefragValue(dictGetKey(kde), obj, &defragged))
-        defragLater(db, kde);
-
-    return defragged;
-}
-
-/* for each key we scan in the main dict, this function will attempt to defrag
- * all the various pointers it has. Returns a stat of how many pointers were
- * moved. */
-long defragKey(redisDb *db, dictEntry *de) {
-    sds keysds = dictGetKey(de);
-    robj *newob, *ob;
-    unsigned char *newzl;
-    long defragged = 0;
-    sds newsds;
-
-    /* Try to defrag the key name. */
-    newsds = activeDefragSds(keysds);
-    if (newsds)
-        defragged++, de->key = newsds;
-    if (dictSize(db->expires)) {
-         /* Dirty code:
-          * I can't search in db->expires for that key after i already released
-          * the pointer it holds it won't be able to do the string compare */
-        uint64_t hash = dictGetHash(db->dict, de->key);
-        replaceSatelliteDictKeyPtrAndOrDefragDictEntry(db->expires, keysds, newsds, hash, &defragged);
-    }
-
-    /* Try to defrag robj and / or string value. */
-    ob = dictGetVal(de);
-    if ((newob = activeDefragStringOb(ob, &defragged))) {
-        de->v.val = newob;
-        ob = newob;
-    }
-
-    if (ob->type == OBJ_STRING) {
-        /* Already handled in activeDefragStringOb. */
-    } else if (ob->type == OBJ_LIST) {
-        if (ob->encoding == OBJ_ENCODING_QUICKLIST) {
-            defragged += defragQuicklist(db, de);
-        } else if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
-            if ((newzl = activeDefragAlloc(ob->ptr)))
-                defragged++, ob->ptr = newzl;
-        } else {
-            serverPanic("Unknown list encoding");
-        }
-    } else if (ob->type == OBJ_SET) {
-        if (ob->encoding == OBJ_ENCODING_HT) {
-            defragged += defragSet(db, de);
-        } else if (ob->encoding == OBJ_ENCODING_INTSET) {
-            intset *newis, *is = ob->ptr;
-            if ((newis = activeDefragAlloc(is)))
-                defragged++, ob->ptr = newis;
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (ob->type == OBJ_ZSET) {
-        if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
-            if ((newzl = activeDefragAlloc(ob->ptr)))
-                defragged++, ob->ptr = newzl;
-        } else if (ob->encoding == OBJ_ENCODING_SKIPLIST) {
-            defragged += defragZsetSkiplist(db, de);
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else if (ob->type == OBJ_HASH) {
-        if (ob->encoding == OBJ_ENCODING_ZIPLIST) {
-            if ((newzl = activeDefragAlloc(ob->ptr)))
-                defragged++, ob->ptr = newzl;
-        } else if (ob->encoding == OBJ_ENCODING_HT) {
-            defragged += defragHash(db, de);
-        } else {
-            serverPanic("Unknown hash encoding");
-        }
-    } else if (ob->type == OBJ_STREAM) {
-        defragged += defragStream(db, de);
-    } else if (ob->type == OBJ_MODULE) {
-        defragged += defragModule(db, de);
-    } else {
-        serverPanic("Unknown object type");
-    }
-    return defragged;
-}
-
-/* Defrag scan callback for the main db dictionary. */
-void defragScanCallback(void *privdata, const dictEntry *de) {
-    long defragged = defragKey((redisDb*)privdata, (dictEntry*)de);
-    server.stat_active_defrag_hits += defragged;
-    if(defragged)
-        server.stat_active_defrag_key_hits++;
-    else
-        server.stat_active_defrag_key_misses++;
-    server.stat_active_defrag_scanned++;
-}
-
-/* Defrag scan callback for each hash table bucket,
- * used in order to defrag the dictEntry allocations. */
-void defragDictBucketCallback(void *privdata, dictEntry **bucketref) {
-    UNUSED(privdata); /* NOTE: this function is also used by both activeDefragCycle and scanLaterHash, etc. don't use privdata */
-    while(*bucketref) {
-        dictEntry *de = *bucketref, *newde;
-        if ((newde = activeDefragAlloc(de))) {
-            *bucketref = newde;
-        }
-        bucketref = &(*bucketref)->next;
-    }
-}
-
-/* Utility function to get the fragmentation ratio from jemalloc.
- * It is critical to do that by comparing only heap maps that belong to
- * jemalloc, and skip ones the jemalloc keeps as spare. Since we use this
- * fragmentation ratio in order to decide if a defrag action should be taken
- * or not, a false detection can cause the defragmenter to waste a lot of CPU
- * without the possibility of getting any results. */
-float getAllocatorFragmentation(size_t *out_frag_bytes) {
-    size_t resident, active, allocated;
-    zmalloc_get_allocator_info(&allocated, &active, &resident);
-    float frag_pct = ((float)active / allocated)*100 - 100;
-    size_t frag_bytes = active - allocated;
-    float rss_pct = ((float)resident / allocated)*100 - 100;
-    size_t rss_bytes = resident - allocated;
-    if(out_frag_bytes)
-        *out_frag_bytes = frag_bytes;
-    serverLog(LL_DEBUG,
-        "allocated=%zu, active=%zu, resident=%zu, frag=%.0f%% (%.0f%% rss), frag_bytes=%zu (%zu rss)",
-        allocated, active, resident, frag_pct, rss_pct, frag_bytes, rss_bytes);
-    return frag_pct;
-}
-
-/* We may need to defrag other globals, one small allocation can hold a full allocator run.
- * so although small, it is still important to defrag these */
-long defragOtherGlobals() {
-    long defragged = 0;
-
-    /* there are many more pointers to defrag (e.g. client argv, output / aof buffers, etc.
-     * but we assume most of these are short lived, we only need to defrag allocations
-     * that remain static for a long time */
-    defragged += activeDefragSdsDict(server.lua_scripts, DEFRAG_SDS_DICT_VAL_IS_STROB);
-    defragged += activeDefragSdsListAndDict(server.repl_scriptcache_fifo, server.repl_scriptcache_dict, DEFRAG_SDS_DICT_NO_VAL);
-    defragged += moduleDefragGlobals();
-    return defragged;
-}
-
-/* returns 0 more work may or may not be needed (see non-zero cursor),
- * and 1 if time is up and more work is needed. */
-int defragLaterItem(dictEntry *de, unsigned long *cursor, long long endtime) {
-    if (de) {
-        robj *ob = dictGetVal(de);
-        if (ob->type == OBJ_LIST) {
-            return scanLaterList(ob, cursor, endtime, &server.stat_active_defrag_hits);
-        } else if (ob->type == OBJ_SET) {
-            server.stat_active_defrag_hits += scanLaterSet(ob, cursor);
-        } else if (ob->type == OBJ_ZSET) {
-            server.stat_active_defrag_hits += scanLaterZset(ob, cursor);
-        } else if (ob->type == OBJ_HASH) {
-            server.stat_active_defrag_hits += scanLaterHash(ob, cursor);
-        } else if (ob->type == OBJ_STREAM) {
-            return scanLaterStreamListpacks(ob, cursor, endtime, &server.stat_active_defrag_hits);
-        } else if (ob->type == OBJ_MODULE) {
-            return moduleLateDefrag(dictGetKey(de), ob, cursor, endtime, &server.stat_active_defrag_hits);
-        } else {
-            *cursor = 0; /* object type may have changed since we schedule it for later */
-        }
-    } else {
-        *cursor = 0; /* object may have been deleted already */
-    }
-    return 0;
-}
-
-/* static variables serving defragLaterStep to continue scanning a key from were we stopped last time. */
-static sds defrag_later_current_key = NULL;
-static unsigned long defrag_later_cursor = 0;
-
-/* returns 0 if no more work needs to be been done, and 1 if time is up and more work is needed. */
-int defragLaterStep(redisDb *db, long long endtime) {
-    unsigned int iterations = 0;
-    unsigned long long prev_defragged = server.stat_active_defrag_hits;
-    unsigned long long prev_scanned = server.stat_active_defrag_scanned;
-    long long key_defragged;
-
-    do {
-        /* if we're not continuing a scan from the last call or loop, start a new one */
-        if (!defrag_later_cursor) {
-            listNode *head = listFirst(db->defrag_later);
-
-            /* Move on to next key */
-            if (defrag_later_current_key) {
-                serverAssert(defrag_later_current_key == head->value);
-                listDelNode(db->defrag_later, head);
-                defrag_later_cursor = 0;
-                defrag_later_current_key = NULL;
-            }
-
-            /* stop if we reached the last one. */
-            head = listFirst(db->defrag_later);
-            if (!head)
-                return 0;
-
-            /* start a new key */
-            defrag_later_current_key = head->value;
-            defrag_later_cursor = 0;
-        }
-
-        /* each time we enter this function we need to fetch the key from the dict again (if it still exists) */
-        dictEntry *de = dictFind(db->dict, defrag_later_current_key);
-        key_defragged = server.stat_active_defrag_hits;
-        do {
-            int quit = 0;
-            if (defragLaterItem(de, &defrag_later_cursor, endtime))
-                quit = 1; /* time is up, we didn't finish all the work */
-
-            /* Once in 16 scan iterations, 512 pointer reallocations, or 64 fields
-             * (if we have a lot of pointers in one hash bucket, or rehashing),
-             * check if we reached the time limit. */
-            if (quit || (++iterations > 16 ||
-                            server.stat_active_defrag_hits - prev_defragged > 512 ||
-                            server.stat_active_defrag_scanned - prev_scanned > 64)) {
-                if (quit || ustime() > endtime) {
-                    if(key_defragged != server.stat_active_defrag_hits)
-                        server.stat_active_defrag_key_hits++;
-                    else
-                        server.stat_active_defrag_key_misses++;
-                    return 1;
-                }
-                iterations = 0;
-                prev_defragged = server.stat_active_defrag_hits;
-                prev_scanned = server.stat_active_defrag_scanned;
-            }
-        } while(defrag_later_cursor);
-        if(key_defragged != server.stat_active_defrag_hits)
-            server.stat_active_defrag_key_hits++;
-        else
-            server.stat_active_defrag_key_misses++;
-    } while(1);
-}
-
-#define INTERPOLATE(x, x1, x2, y1, y2) ( (y1) + ((x)-(x1)) * ((y2)-(y1)) / ((x2)-(x1)) )
-#define LIMIT(y, min, max) ((y)<(min)? min: ((y)>(max)? max: (y)))
-
-/* decide if defrag is needed, and at what CPU effort to invest in it */
-void computeDefragCycles() {
-    size_t frag_bytes;
-    float frag_pct = getAllocatorFragmentation(&frag_bytes);
-    /* If we're not already running, and below the threshold, exit. */
-    if (!server.active_defrag_running) {
-        if(frag_pct < server.active_defrag_threshold_lower || frag_bytes < server.active_defrag_ignore_bytes)
-            return;
-    }
-
-    /* Calculate the adaptive aggressiveness of the defrag */
-    int cpu_pct = INTERPOLATE(frag_pct,
-            server.active_defrag_threshold_lower,
-            server.active_defrag_threshold_upper,
-            server.active_defrag_cycle_min,
-            server.active_defrag_cycle_max);
-    cpu_pct = LIMIT(cpu_pct,
-            server.active_defrag_cycle_min,
-            server.active_defrag_cycle_max);
-     /* We allow increasing the aggressiveness during a scan, but don't
-      * reduce it. */
-    if (!server.active_defrag_running ||
-        cpu_pct > server.active_defrag_running)
-    {
-        server.active_defrag_running = cpu_pct;
-        serverLog(LL_VERBOSE,
-            "Starting active defrag, frag=%.0f%%, frag_bytes=%zu, cpu=%d%%",
-            frag_pct, frag_bytes, cpu_pct);
-    }
-}
-
-/* Perform incremental defragmentation work from the serverCron.
- * This works in a similar way to activeExpireCycle, in the sense that
- * we do incremental work across calls. */
-void activeDefragCycle(void) {
-    static int current_db = -1;
-    static unsigned long cursor = 0;
-    static redisDb *db = NULL;
-    static long long start_scan, start_stat;
-    unsigned int iterations = 0;
-    unsigned long long prev_defragged = server.stat_active_defrag_hits;
-    unsigned long long prev_scanned = server.stat_active_defrag_scanned;
-    long long start, timelimit, endtime;
-    mstime_t latency;
-    int quit = 0;
-
-    if (!server.active_defrag_enabled) {
-        if (server.active_defrag_running) {
-            /* if active defrag was disabled mid-run, start from fresh next time. */
-            server.active_defrag_running = 0;
-            if (db)
-                listEmpty(db->defrag_later);
-            defrag_later_current_key = NULL;
-            defrag_later_cursor = 0;
-            current_db = -1;
-            cursor = 0;
-            db = NULL;
-        }
-        return;
-    }
-
-    if (hasActiveChildProcess())
-        return; /* Defragging memory while there's a fork will just do damage. */
-
-    /* Once a second, check if the fragmentation justfies starting a scan
-     * or making it more aggressive. */
-    run_with_period(1000) {
-        computeDefragCycles();
-    }
-    if (!server.active_defrag_running)
-        return;
-
-    /* See activeExpireCycle for how timelimit is handled. */
-    start = ustime();
-    timelimit = 1000000*server.active_defrag_running/server.hz/100;
-    if (timelimit <= 0) timelimit = 1;
-    endtime = start + timelimit;
-    latencyStartMonitor(latency);
-
-    do {
-        /* if we're not continuing a scan from the last call or loop, start a new one */
-        if (!cursor) {
-            /* finish any leftovers from previous db before moving to the next one */
-            if (db && defragLaterStep(db, endtime)) {
-                quit = 1; /* time is up, we didn't finish all the work */
-                break; /* this will exit the function and we'll continue on the next cycle */
-            }
-
-            /* Move on to next database, and stop if we reached the last one. */
-            if (++current_db >= server.dbnum) {
-                /* defrag other items not part of the db / keys */
-                defragOtherGlobals();
-
-                long long now = ustime();
-                size_t frag_bytes;
-                float frag_pct = getAllocatorFragmentation(&frag_bytes);
-                serverLog(LL_VERBOSE,
-                    "Active defrag done in %dms, reallocated=%d, frag=%.0f%%, frag_bytes=%zu",
-                    (int)((now - start_scan)/1000), (int)(server.stat_active_defrag_hits - start_stat), frag_pct, frag_bytes);
-
-                start_scan = now;
-                current_db = -1;
-                cursor = 0;
-                db = NULL;
-                server.active_defrag_running = 0;
-
-                computeDefragCycles(); /* if another scan is needed, start it right away */
-                if (server.active_defrag_running != 0 && ustime() < endtime)
-                    continue;
-                break;
-            }
-            else if (current_db==0) {
-                /* Start a scan from the first database. */
-                start_scan = ustime();
-                start_stat = server.stat_active_defrag_hits;
-            }
-
-            db = &server.db[current_db];
-            cursor = 0;
-        }
-
-        do {
-            /* before scanning the next bucket, see if we have big keys left from the previous bucket to scan */
-            if (defragLaterStep(db, endtime)) {
-                quit = 1; /* time is up, we didn't finish all the work */
-                break; /* this will exit the function and we'll continue on the next cycle */
-            }
-
-            cursor = dictScan(db->dict, cursor, defragScanCallback, defragDictBucketCallback, db);
-
-            /* Once in 16 scan iterations, 512 pointer reallocations. or 64 keys
-             * (if we have a lot of pointers in one hash bucket or rehasing),
-             * check if we reached the time limit.
-             * But regardless, don't start a new db in this loop, this is because after
-             * the last db we call defragOtherGlobals, which must be done in one cycle */
-            if (!cursor || (++iterations > 16 ||
-                            server.stat_active_defrag_hits - prev_defragged > 512 ||
-                            server.stat_active_defrag_scanned - prev_scanned > 64)) {
-                if (!cursor || ustime() > endtime) {
-                    quit = 1;
-                    break;
-                }
-                iterations = 0;
-                prev_defragged = server.stat_active_defrag_hits;
-                prev_scanned = server.stat_active_defrag_scanned;
-            }
-        } while(cursor && !quit);
-    } while(!quit);
-
-    latencyEndMonitor(latency);
-    latencyAddSampleIfNeeded("active-defrag-cycle",latency);
-}
-
-#else /* HAVE_DEFRAG */
-
-void activeDefragCycle(void) {
-    /* Not implemented yet. */
-}
-
-void *activeDefragAlloc(void *ptr) {
-    UNUSED(ptr);
-    return NULL;
-}
-
-robj *activeDefragStringOb(robj *ob, long *defragged) {
-    UNUSED(ob);
-    UNUSED(defragged);
-    return NULL;
-}
-
-#endif
diff --git a/redis-stable/src/dict.c b/redis-stable/src/dict.c
deleted file mode 100644
index 1bbdc211..00000000
--- a/redis-stable/src/dict.c
+++ /dev/null
@@ -1,1315 +0,0 @@
-/* Hash Tables Implementation.
- *
- * This file implements in memory hash tables with insert/del/replace/find/
- * get-random-element operations. Hash tables will auto resize if needed
- * tables of power of two in size are used, collisions are handled by
- * chaining. See the source code for more information... :)
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <string.h>
-#include <stdarg.h>
-#include <limits.h>
-#include <sys/time.h>
-
-#include "dict.h"
-#include "zmalloc.h"
-#include "redisassert.h"
-
-/* Using dictEnableResize() / dictDisableResize() we make possible to
- * enable/disable resizing of the hash table as needed. This is very important
- * for Redis, as we use copy-on-write and don't want to move too much memory
- * around when there is a child performing saving operations.
- *
- * Note that even when dict_can_resize is set to 0, not all resizes are
- * prevented: a hash table is still allowed to grow if the ratio between
- * the number of elements and the buckets > dict_force_resize_ratio. */
-static int dict_can_resize = 1;
-static unsigned int dict_force_resize_ratio = 5;
-
-/* -------------------------- private prototypes ---------------------------- */
-
-static int _dictExpandIfNeeded(dict *ht);
-static unsigned long _dictNextPower(unsigned long size);
-static long _dictKeyIndex(dict *ht, const void *key, uint64_t hash, dictEntry **existing);
-static int _dictInit(dict *ht, dictType *type, void *privDataPtr);
-
-/* -------------------------- hash functions -------------------------------- */
-
-static uint8_t dict_hash_function_seed[16];
-
-void dictSetHashFunctionSeed(uint8_t *seed) {
-    memcpy(dict_hash_function_seed,seed,sizeof(dict_hash_function_seed));
-}
-
-uint8_t *dictGetHashFunctionSeed(void) {
-    return dict_hash_function_seed;
-}
-
-/* The default hashing function uses SipHash implementation
- * in siphash.c. */
-
-uint64_t siphash(const uint8_t *in, const size_t inlen, const uint8_t *k);
-uint64_t siphash_nocase(const uint8_t *in, const size_t inlen, const uint8_t *k);
-
-uint64_t dictGenHashFunction(const void *key, int len) {
-    return siphash(key,len,dict_hash_function_seed);
-}
-
-uint64_t dictGenCaseHashFunction(const unsigned char *buf, int len) {
-    return siphash_nocase(buf,len,dict_hash_function_seed);
-}
-
-/* ----------------------------- API implementation ------------------------- */
-
-/* Reset a hash table already initialized with ht_init().
- * NOTE: This function should only be called by ht_destroy(). */
-static void _dictReset(dictht *ht)
-{
-    ht->table = NULL;
-    ht->size = 0;
-    ht->sizemask = 0;
-    ht->used = 0;
-}
-
-/* Create a new hash table */
-dict *dictCreate(dictType *type,
-        void *privDataPtr)
-{
-    dict *d = zmalloc(sizeof(*d));
-
-    _dictInit(d,type,privDataPtr);
-    return d;
-}
-
-/* Initialize the hash table */
-int _dictInit(dict *d, dictType *type,
-        void *privDataPtr)
-{
-    _dictReset(&d->ht[0]);
-    _dictReset(&d->ht[1]);
-    d->type = type;
-    d->privdata = privDataPtr;
-    d->rehashidx = -1;
-    d->pauserehash = 0;
-    return DICT_OK;
-}
-
-/* Resize the table to the minimal size that contains all the elements,
- * but with the invariant of a USED/BUCKETS ratio near to <= 1 */
-int dictResize(dict *d)
-{
-    unsigned long minimal;
-
-    if (!dict_can_resize || dictIsRehashing(d)) return DICT_ERR;
-    minimal = d->ht[0].used;
-    if (minimal < DICT_HT_INITIAL_SIZE)
-        minimal = DICT_HT_INITIAL_SIZE;
-    return dictExpand(d, minimal);
-}
-
-/* Expand or create the hash table,
- * when malloc_failed is non-NULL, it'll avoid panic if malloc fails (in which case it'll be set to 1).
- * Returns DICT_OK if expand was performed, and DICT_ERR if skipped. */
-int _dictExpand(dict *d, unsigned long size, int* malloc_failed)
-{
-    if (malloc_failed) *malloc_failed = 0;
-
-    /* the size is invalid if it is smaller than the number of
-     * elements already inside the hash table */
-    if (dictIsRehashing(d) || d->ht[0].used > size)
-        return DICT_ERR;
-
-    dictht n; /* the new hash table */
-    unsigned long realsize = _dictNextPower(size);
-
-    /* Detect overflows */
-    if (realsize < size || realsize * sizeof(dictEntry*) < realsize)
-        return DICT_ERR;
-
-    /* Rehashing to the same table size is not useful. */
-    if (realsize == d->ht[0].size) return DICT_ERR;
-
-    /* Allocate the new hash table and initialize all pointers to NULL */
-    n.size = realsize;
-    n.sizemask = realsize-1;
-    if (malloc_failed) {
-        n.table = ztrycalloc(realsize*sizeof(dictEntry*));
-        *malloc_failed = n.table == NULL;
-        if (*malloc_failed)
-            return DICT_ERR;
-    } else
-        n.table = zcalloc(realsize*sizeof(dictEntry*));
-
-    n.used = 0;
-
-    /* Is this the first initialization? If so it's not really a rehashing
-     * we just set the first hash table so that it can accept keys. */
-    if (d->ht[0].table == NULL) {
-        d->ht[0] = n;
-        return DICT_OK;
-    }
-
-    /* Prepare a second hash table for incremental rehashing */
-    d->ht[1] = n;
-    d->rehashidx = 0;
-    return DICT_OK;
-}
-
-/* return DICT_ERR if expand was not performed */
-int dictExpand(dict *d, unsigned long size) {
-    return _dictExpand(d, size, NULL);
-}
-
-/* return DICT_ERR if expand failed due to memory allocation failure */
-int dictTryExpand(dict *d, unsigned long size) {
-    int malloc_failed;
-    _dictExpand(d, size, &malloc_failed);
-    return malloc_failed? DICT_ERR : DICT_OK;
-}
-
-/* Performs N steps of incremental rehashing. Returns 1 if there are still
- * keys to move from the old to the new hash table, otherwise 0 is returned.
- *
- * Note that a rehashing step consists in moving a bucket (that may have more
- * than one key as we use chaining) from the old to the new hash table, however
- * since part of the hash table may be composed of empty spaces, it is not
- * guaranteed that this function will rehash even a single bucket, since it
- * will visit at max N*10 empty buckets in total, otherwise the amount of
- * work it does would be unbound and the function may block for a long time. */
-int dictRehash(dict *d, int n) {
-    int empty_visits = n*10; /* Max number of empty buckets to visit. */
-    if (!dictIsRehashing(d)) return 0;
-
-    while(n-- && d->ht[0].used != 0) {
-        dictEntry *de, *nextde;
-
-        /* Note that rehashidx can't overflow as we are sure there are more
-         * elements because ht[0].used != 0 */
-        assert(d->ht[0].size > (unsigned long)d->rehashidx);
-        while(d->ht[0].table[d->rehashidx] == NULL) {
-            d->rehashidx++;
-            if (--empty_visits == 0) return 1;
-        }
-        de = d->ht[0].table[d->rehashidx];
-        /* Move all the keys in this bucket from the old to the new hash HT */
-        while(de) {
-            uint64_t h;
-
-            nextde = de->next;
-            /* Get the index in the new hash table */
-            h = dictHashKey(d, de->key) & d->ht[1].sizemask;
-            de->next = d->ht[1].table[h];
-            d->ht[1].table[h] = de;
-            d->ht[0].used--;
-            d->ht[1].used++;
-            de = nextde;
-        }
-        d->ht[0].table[d->rehashidx] = NULL;
-        d->rehashidx++;
-    }
-
-    /* Check if we already rehashed the whole table... */
-    if (d->ht[0].used == 0) {
-        zfree(d->ht[0].table);
-        d->ht[0] = d->ht[1];
-        _dictReset(&d->ht[1]);
-        d->rehashidx = -1;
-        return 0;
-    }
-
-    /* More to rehash... */
-    return 1;
-}
-
-long long timeInMilliseconds(void) {
-    struct timeval tv;
-
-    gettimeofday(&tv,NULL);
-    return (((long long)tv.tv_sec)*1000)+(tv.tv_usec/1000);
-}
-
-/* Rehash in ms+"delta" milliseconds. The value of "delta" is larger 
- * than 0, and is smaller than 1 in most cases. The exact upper bound 
- * depends on the running time of dictRehash(d,100).*/
-int dictRehashMilliseconds(dict *d, int ms) {
-    if (d->pauserehash > 0) return 0;
-
-    long long start = timeInMilliseconds();
-    int rehashes = 0;
-
-    while(dictRehash(d,100)) {
-        rehashes += 100;
-        if (timeInMilliseconds()-start > ms) break;
-    }
-    return rehashes;
-}
-
-/* This function performs just a step of rehashing, and only if hashing has
- * not been paused for our hash table. When we have iterators in the
- * middle of a rehashing we can't mess with the two hash tables otherwise
- * some element can be missed or duplicated.
- *
- * This function is called by common lookup or update operations in the
- * dictionary so that the hash table automatically migrates from H1 to H2
- * while it is actively used. */
-static void _dictRehashStep(dict *d) {
-    if (d->pauserehash == 0) dictRehash(d,1);
-}
-
-/* Add an element to the target hash table */
-int dictAdd(dict *d, void *key, void *val)
-{
-    dictEntry *entry = dictAddRaw(d,key,NULL);
-
-    if (!entry) return DICT_ERR;
-    dictSetVal(d, entry, val);
-    return DICT_OK;
-}
-
-/* Low level add or find:
- * This function adds the entry but instead of setting a value returns the
- * dictEntry structure to the user, that will make sure to fill the value
- * field as they wish.
- *
- * This function is also directly exposed to the user API to be called
- * mainly in order to store non-pointers inside the hash value, example:
- *
- * entry = dictAddRaw(dict,mykey,NULL);
- * if (entry != NULL) dictSetSignedIntegerVal(entry,1000);
- *
- * Return values:
- *
- * If key already exists NULL is returned, and "*existing" is populated
- * with the existing entry if existing is not NULL.
- *
- * If key was added, the hash entry is returned to be manipulated by the caller.
- */
-dictEntry *dictAddRaw(dict *d, void *key, dictEntry **existing)
-{
-    long index;
-    dictEntry *entry;
-    dictht *ht;
-
-    if (dictIsRehashing(d)) _dictRehashStep(d);
-
-    /* Get the index of the new element, or -1 if
-     * the element already exists. */
-    if ((index = _dictKeyIndex(d, key, dictHashKey(d,key), existing)) == -1)
-        return NULL;
-
-    /* Allocate the memory and store the new entry.
-     * Insert the element in top, with the assumption that in a database
-     * system it is more likely that recently added entries are accessed
-     * more frequently. */
-    ht = dictIsRehashing(d) ? &d->ht[1] : &d->ht[0];
-    entry = zmalloc(sizeof(*entry));
-    entry->next = ht->table[index];
-    ht->table[index] = entry;
-    ht->used++;
-
-    /* Set the hash entry fields. */
-    dictSetKey(d, entry, key);
-    return entry;
-}
-
-/* Add or Overwrite:
- * Add an element, discarding the old value if the key already exists.
- * Return 1 if the key was added from scratch, 0 if there was already an
- * element with such key and dictReplace() just performed a value update
- * operation. */
-int dictReplace(dict *d, void *key, void *val)
-{
-    dictEntry *entry, *existing, auxentry;
-
-    /* Try to add the element. If the key
-     * does not exists dictAdd will succeed. */
-    entry = dictAddRaw(d,key,&existing);
-    if (entry) {
-        dictSetVal(d, entry, val);
-        return 1;
-    }
-
-    /* Set the new value and free the old one. Note that it is important
-     * to do that in this order, as the value may just be exactly the same
-     * as the previous one. In this context, think to reference counting,
-     * you want to increment (set), and then decrement (free), and not the
-     * reverse. */
-    auxentry = *existing;
-    dictSetVal(d, existing, val);
-    dictFreeVal(d, &auxentry);
-    return 0;
-}
-
-/* Add or Find:
- * dictAddOrFind() is simply a version of dictAddRaw() that always
- * returns the hash entry of the specified key, even if the key already
- * exists and can't be added (in that case the entry of the already
- * existing key is returned.)
- *
- * See dictAddRaw() for more information. */
-dictEntry *dictAddOrFind(dict *d, void *key) {
-    dictEntry *entry, *existing;
-    entry = dictAddRaw(d,key,&existing);
-    return entry ? entry : existing;
-}
-
-/* Search and remove an element. This is an helper function for
- * dictDelete() and dictUnlink(), please check the top comment
- * of those functions. */
-static dictEntry *dictGenericDelete(dict *d, const void *key, int nofree) {
-    uint64_t h, idx;
-    dictEntry *he, *prevHe;
-    int table;
-
-    if (d->ht[0].used == 0 && d->ht[1].used == 0) return NULL;
-
-    if (dictIsRehashing(d)) _dictRehashStep(d);
-    h = dictHashKey(d, key);
-
-    for (table = 0; table <= 1; table++) {
-        idx = h & d->ht[table].sizemask;
-        he = d->ht[table].table[idx];
-        prevHe = NULL;
-        while(he) {
-            if (key==he->key || dictCompareKeys(d, key, he->key)) {
-                /* Unlink the element from the list */
-                if (prevHe)
-                    prevHe->next = he->next;
-                else
-                    d->ht[table].table[idx] = he->next;
-                if (!nofree) {
-                    dictFreeKey(d, he);
-                    dictFreeVal(d, he);
-                    zfree(he);
-                }
-                d->ht[table].used--;
-                return he;
-            }
-            prevHe = he;
-            he = he->next;
-        }
-        if (!dictIsRehashing(d)) break;
-    }
-    return NULL; /* not found */
-}
-
-/* Remove an element, returning DICT_OK on success or DICT_ERR if the
- * element was not found. */
-int dictDelete(dict *ht, const void *key) {
-    return dictGenericDelete(ht,key,0) ? DICT_OK : DICT_ERR;
-}
-
-/* Remove an element from the table, but without actually releasing
- * the key, value and dictionary entry. The dictionary entry is returned
- * if the element was found (and unlinked from the table), and the user
- * should later call `dictFreeUnlinkedEntry()` with it in order to release it.
- * Otherwise if the key is not found, NULL is returned.
- *
- * This function is useful when we want to remove something from the hash
- * table but want to use its value before actually deleting the entry.
- * Without this function the pattern would require two lookups:
- *
- *  entry = dictFind(...);
- *  // Do something with entry
- *  dictDelete(dictionary,entry);
- *
- * Thanks to this function it is possible to avoid this, and use
- * instead:
- *
- * entry = dictUnlink(dictionary,entry);
- * // Do something with entry
- * dictFreeUnlinkedEntry(entry); // <- This does not need to lookup again.
- */
-dictEntry *dictUnlink(dict *ht, const void *key) {
-    return dictGenericDelete(ht,key,1);
-}
-
-/* You need to call this function to really free the entry after a call
- * to dictUnlink(). It's safe to call this function with 'he' = NULL. */
-void dictFreeUnlinkedEntry(dict *d, dictEntry *he) {
-    if (he == NULL) return;
-    dictFreeKey(d, he);
-    dictFreeVal(d, he);
-    zfree(he);
-}
-
-/* Destroy an entire dictionary */
-int _dictClear(dict *d, dictht *ht, void(callback)(void *)) {
-    unsigned long i;
-
-    /* Free all the elements */
-    for (i = 0; i < ht->size && ht->used > 0; i++) {
-        dictEntry *he, *nextHe;
-
-        if (callback && (i & 65535) == 0) callback(d->privdata);
-
-        if ((he = ht->table[i]) == NULL) continue;
-        while(he) {
-            nextHe = he->next;
-            dictFreeKey(d, he);
-            dictFreeVal(d, he);
-            zfree(he);
-            ht->used--;
-            he = nextHe;
-        }
-    }
-    /* Free the table and the allocated cache structure */
-    zfree(ht->table);
-    /* Re-initialize the table */
-    _dictReset(ht);
-    return DICT_OK; /* never fails */
-}
-
-/* Clear & Release the hash table */
-void dictRelease(dict *d)
-{
-    _dictClear(d,&d->ht[0],NULL);
-    _dictClear(d,&d->ht[1],NULL);
-    zfree(d);
-}
-
-dictEntry *dictFind(dict *d, const void *key)
-{
-    dictEntry *he;
-    uint64_t h, idx, table;
-
-    if (dictSize(d) == 0) return NULL; /* dict is empty */
-    if (dictIsRehashing(d)) _dictRehashStep(d);
-    h = dictHashKey(d, key);
-    for (table = 0; table <= 1; table++) {
-        idx = h & d->ht[table].sizemask;
-        he = d->ht[table].table[idx];
-        while(he) {
-            if (key==he->key || dictCompareKeys(d, key, he->key))
-                return he;
-            he = he->next;
-        }
-        if (!dictIsRehashing(d)) return NULL;
-    }
-    return NULL;
-}
-
-void *dictFetchValue(dict *d, const void *key) {
-    dictEntry *he;
-
-    he = dictFind(d,key);
-    return he ? dictGetVal(he) : NULL;
-}
-
-/* A fingerprint is a 64 bit number that represents the state of the dictionary
- * at a given time, it's just a few dict properties xored together.
- * When an unsafe iterator is initialized, we get the dict fingerprint, and check
- * the fingerprint again when the iterator is released.
- * If the two fingerprints are different it means that the user of the iterator
- * performed forbidden operations against the dictionary while iterating. */
-long long dictFingerprint(dict *d) {
-    long long integers[6], hash = 0;
-    int j;
-
-    integers[0] = (long) d->ht[0].table;
-    integers[1] = d->ht[0].size;
-    integers[2] = d->ht[0].used;
-    integers[3] = (long) d->ht[1].table;
-    integers[4] = d->ht[1].size;
-    integers[5] = d->ht[1].used;
-
-    /* We hash N integers by summing every successive integer with the integer
-     * hashing of the previous sum. Basically:
-     *
-     * Result = hash(hash(hash(int1)+int2)+int3) ...
-     *
-     * This way the same set of integers in a different order will (likely) hash
-     * to a different number. */
-    for (j = 0; j < 6; j++) {
-        hash += integers[j];
-        /* For the hashing step we use Tomas Wang's 64 bit integer hash. */
-        hash = (~hash) + (hash << 21); // hash = (hash << 21) - hash - 1;
-        hash = hash ^ (hash >> 24);
-        hash = (hash + (hash << 3)) + (hash << 8); // hash * 265
-        hash = hash ^ (hash >> 14);
-        hash = (hash + (hash << 2)) + (hash << 4); // hash * 21
-        hash = hash ^ (hash >> 28);
-        hash = hash + (hash << 31);
-    }
-    return hash;
-}
-
-dictIterator *dictGetIterator(dict *d)
-{
-    dictIterator *iter = zmalloc(sizeof(*iter));
-
-    iter->d = d;
-    iter->table = 0;
-    iter->index = -1;
-    iter->safe = 0;
-    iter->entry = NULL;
-    iter->nextEntry = NULL;
-    return iter;
-}
-
-dictIterator *dictGetSafeIterator(dict *d) {
-    dictIterator *i = dictGetIterator(d);
-
-    i->safe = 1;
-    return i;
-}
-
-dictEntry *dictNext(dictIterator *iter)
-{
-    while (1) {
-        if (iter->entry == NULL) {
-            dictht *ht = &iter->d->ht[iter->table];
-            if (iter->index == -1 && iter->table == 0) {
-                if (iter->safe)
-                    dictPauseRehashing(iter->d);
-                else
-                    iter->fingerprint = dictFingerprint(iter->d);
-            }
-            iter->index++;
-            if (iter->index >= (long) ht->size) {
-                if (dictIsRehashing(iter->d) && iter->table == 0) {
-                    iter->table++;
-                    iter->index = 0;
-                    ht = &iter->d->ht[1];
-                } else {
-                    break;
-                }
-            }
-            iter->entry = ht->table[iter->index];
-        } else {
-            iter->entry = iter->nextEntry;
-        }
-        if (iter->entry) {
-            /* We need to save the 'next' here, the iterator user
-             * may delete the entry we are returning. */
-            iter->nextEntry = iter->entry->next;
-            return iter->entry;
-        }
-    }
-    return NULL;
-}
-
-void dictReleaseIterator(dictIterator *iter)
-{
-    if (!(iter->index == -1 && iter->table == 0)) {
-        if (iter->safe)
-            dictResumeRehashing(iter->d);
-        else
-            assert(iter->fingerprint == dictFingerprint(iter->d));
-    }
-    zfree(iter);
-}
-
-/* Return a random entry from the hash table. Useful to
- * implement randomized algorithms */
-dictEntry *dictGetRandomKey(dict *d)
-{
-    dictEntry *he, *orighe;
-    unsigned long h;
-    int listlen, listele;
-
-    if (dictSize(d) == 0) return NULL;
-    if (dictIsRehashing(d)) _dictRehashStep(d);
-    if (dictIsRehashing(d)) {
-        do {
-            /* We are sure there are no elements in indexes from 0
-             * to rehashidx-1 */
-            h = d->rehashidx + (randomULong() % (dictSlots(d) - d->rehashidx));
-            he = (h >= d->ht[0].size) ? d->ht[1].table[h - d->ht[0].size] :
-                                      d->ht[0].table[h];
-        } while(he == NULL);
-    } else {
-        do {
-            h = randomULong() & d->ht[0].sizemask;
-            he = d->ht[0].table[h];
-        } while(he == NULL);
-    }
-
-    /* Now we found a non empty bucket, but it is a linked
-     * list and we need to get a random element from the list.
-     * The only sane way to do so is counting the elements and
-     * select a random index. */
-    listlen = 0;
-    orighe = he;
-    while(he) {
-        he = he->next;
-        listlen++;
-    }
-    listele = random() % listlen;
-    he = orighe;
-    while(listele--) he = he->next;
-    return he;
-}
-
-/* This function samples the dictionary to return a few keys from random
- * locations.
- *
- * It does not guarantee to return all the keys specified in 'count', nor
- * it does guarantee to return non-duplicated elements, however it will make
- * some effort to do both things.
- *
- * Returned pointers to hash table entries are stored into 'des' that
- * points to an array of dictEntry pointers. The array must have room for
- * at least 'count' elements, that is the argument we pass to the function
- * to tell how many random elements we need.
- *
- * The function returns the number of items stored into 'des', that may
- * be less than 'count' if the hash table has less than 'count' elements
- * inside, or if not enough elements were found in a reasonable amount of
- * steps.
- *
- * Note that this function is not suitable when you need a good distribution
- * of the returned items, but only when you need to "sample" a given number
- * of continuous elements to run some kind of algorithm or to produce
- * statistics. However the function is much faster than dictGetRandomKey()
- * at producing N elements. */
-unsigned int dictGetSomeKeys(dict *d, dictEntry **des, unsigned int count) {
-    unsigned long j; /* internal hash table id, 0 or 1. */
-    unsigned long tables; /* 1 or 2 tables? */
-    unsigned long stored = 0, maxsizemask;
-    unsigned long maxsteps;
-
-    if (dictSize(d) < count) count = dictSize(d);
-    maxsteps = count*10;
-
-    /* Try to do a rehashing work proportional to 'count'. */
-    for (j = 0; j < count; j++) {
-        if (dictIsRehashing(d))
-            _dictRehashStep(d);
-        else
-            break;
-    }
-
-    tables = dictIsRehashing(d) ? 2 : 1;
-    maxsizemask = d->ht[0].sizemask;
-    if (tables > 1 && maxsizemask < d->ht[1].sizemask)
-        maxsizemask = d->ht[1].sizemask;
-
-    /* Pick a random point inside the larger table. */
-    unsigned long i = randomULong() & maxsizemask;
-    unsigned long emptylen = 0; /* Continuous empty entries so far. */
-    while(stored < count && maxsteps--) {
-        for (j = 0; j < tables; j++) {
-            /* Invariant of the dict.c rehashing: up to the indexes already
-             * visited in ht[0] during the rehashing, there are no populated
-             * buckets, so we can skip ht[0] for indexes between 0 and idx-1. */
-            if (tables == 2 && j == 0 && i < (unsigned long) d->rehashidx) {
-                /* Moreover, if we are currently out of range in the second
-                 * table, there will be no elements in both tables up to
-                 * the current rehashing index, so we jump if possible.
-                 * (this happens when going from big to small table). */
-                if (i >= d->ht[1].size)
-                    i = d->rehashidx;
-                else
-                    continue;
-            }
-            if (i >= d->ht[j].size) continue; /* Out of range for this table. */
-            dictEntry *he = d->ht[j].table[i];
-
-            /* Count contiguous empty buckets, and jump to other
-             * locations if they reach 'count' (with a minimum of 5). */
-            if (he == NULL) {
-                emptylen++;
-                if (emptylen >= 5 && emptylen > count) {
-                    i = randomULong() & maxsizemask;
-                    emptylen = 0;
-                }
-            } else {
-                emptylen = 0;
-                while (he) {
-                    /* Collect all the elements of the buckets found non
-                     * empty while iterating. */
-                    *des = he;
-                    des++;
-                    he = he->next;
-                    stored++;
-                    if (stored == count) return stored;
-                }
-            }
-        }
-        i = (i+1) & maxsizemask;
-    }
-    return stored;
-}
-
-/* This is like dictGetRandomKey() from the POV of the API, but will do more
- * work to ensure a better distribution of the returned element.
- *
- * This function improves the distribution because the dictGetRandomKey()
- * problem is that it selects a random bucket, then it selects a random
- * element from the chain in the bucket. However elements being in different
- * chain lengths will have different probabilities of being reported. With
- * this function instead what we do is to consider a "linear" range of the table
- * that may be constituted of N buckets with chains of different lengths
- * appearing one after the other. Then we report a random element in the range.
- * In this way we smooth away the problem of different chain lengths. */
-#define GETFAIR_NUM_ENTRIES 15
-dictEntry *dictGetFairRandomKey(dict *d) {
-    dictEntry *entries[GETFAIR_NUM_ENTRIES];
-    unsigned int count = dictGetSomeKeys(d,entries,GETFAIR_NUM_ENTRIES);
-    /* Note that dictGetSomeKeys() may return zero elements in an unlucky
-     * run() even if there are actually elements inside the hash table. So
-     * when we get zero, we call the true dictGetRandomKey() that will always
-     * yield the element if the hash table has at least one. */
-    if (count == 0) return dictGetRandomKey(d);
-    unsigned int idx = rand() % count;
-    return entries[idx];
-}
-
-/* Function to reverse bits. Algorithm from:
- * http://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel */
-static unsigned long rev(unsigned long v) {
-    unsigned long s = CHAR_BIT * sizeof(v); // bit size; must be power of 2
-    unsigned long mask = ~0UL;
-    while ((s >>= 1) > 0) {
-        mask ^= (mask << s);
-        v = ((v >> s) & mask) | ((v << s) & ~mask);
-    }
-    return v;
-}
-
-/* dictScan() is used to iterate over the elements of a dictionary.
- *
- * Iterating works the following way:
- *
- * 1) Initially you call the function using a cursor (v) value of 0.
- * 2) The function performs one step of the iteration, and returns the
- *    new cursor value you must use in the next call.
- * 3) When the returned cursor is 0, the iteration is complete.
- *
- * The function guarantees all elements present in the
- * dictionary get returned between the start and end of the iteration.
- * However it is possible some elements get returned multiple times.
- *
- * For every element returned, the callback argument 'fn' is
- * called with 'privdata' as first argument and the dictionary entry
- * 'de' as second argument.
- *
- * HOW IT WORKS.
- *
- * The iteration algorithm was designed by Pieter Noordhuis.
- * The main idea is to increment a cursor starting from the higher order
- * bits. That is, instead of incrementing the cursor normally, the bits
- * of the cursor are reversed, then the cursor is incremented, and finally
- * the bits are reversed again.
- *
- * This strategy is needed because the hash table may be resized between
- * iteration calls.
- *
- * dict.c hash tables are always power of two in size, and they
- * use chaining, so the position of an element in a given table is given
- * by computing the bitwise AND between Hash(key) and SIZE-1
- * (where SIZE-1 is always the mask that is equivalent to taking the rest
- *  of the division between the Hash of the key and SIZE).
- *
- * For example if the current hash table size is 16, the mask is
- * (in binary) 1111. The position of a key in the hash table will always be
- * the last four bits of the hash output, and so forth.
- *
- * WHAT HAPPENS IF THE TABLE CHANGES IN SIZE?
- *
- * If the hash table grows, elements can go anywhere in one multiple of
- * the old bucket: for example let's say we already iterated with
- * a 4 bit cursor 1100 (the mask is 1111 because hash table size = 16).
- *
- * If the hash table will be resized to 64 elements, then the new mask will
- * be 111111. The new buckets you obtain by substituting in ??1100
- * with either 0 or 1 can be targeted only by keys we already visited
- * when scanning the bucket 1100 in the smaller hash table.
- *
- * By iterating the higher bits first, because of the inverted counter, the
- * cursor does not need to restart if the table size gets bigger. It will
- * continue iterating using cursors without '1100' at the end, and also
- * without any other combination of the final 4 bits already explored.
- *
- * Similarly when the table size shrinks over time, for example going from
- * 16 to 8, if a combination of the lower three bits (the mask for size 8
- * is 111) were already completely explored, it would not be visited again
- * because we are sure we tried, for example, both 0111 and 1111 (all the
- * variations of the higher bit) so we don't need to test it again.
- *
- * WAIT... YOU HAVE *TWO* TABLES DURING REHASHING!
- *
- * Yes, this is true, but we always iterate the smaller table first, then
- * we test all the expansions of the current cursor into the larger
- * table. For example if the current cursor is 101 and we also have a
- * larger table of size 16, we also test (0)101 and (1)101 inside the larger
- * table. This reduces the problem back to having only one table, where
- * the larger one, if it exists, is just an expansion of the smaller one.
- *
- * LIMITATIONS
- *
- * This iterator is completely stateless, and this is a huge advantage,
- * including no additional memory used.
- *
- * The disadvantages resulting from this design are:
- *
- * 1) It is possible we return elements more than once. However this is usually
- *    easy to deal with in the application level.
- * 2) The iterator must return multiple elements per call, as it needs to always
- *    return all the keys chained in a given bucket, and all the expansions, so
- *    we are sure we don't miss keys moving during rehashing.
- * 3) The reverse cursor is somewhat hard to understand at first, but this
- *    comment is supposed to help.
- */
-unsigned long dictScan(dict *d,
-                       unsigned long v,
-                       dictScanFunction *fn,
-                       dictScanBucketFunction* bucketfn,
-                       void *privdata)
-{
-    dictht *t0, *t1;
-    const dictEntry *de, *next;
-    unsigned long m0, m1;
-
-    if (dictSize(d) == 0) return 0;
-
-    /* This is needed in case the scan callback tries to do dictFind or alike. */
-    dictPauseRehashing(d);
-
-    if (!dictIsRehashing(d)) {
-        t0 = &(d->ht[0]);
-        m0 = t0->sizemask;
-
-        /* Emit entries at cursor */
-        if (bucketfn) bucketfn(privdata, &t0->table[v & m0]);
-        de = t0->table[v & m0];
-        while (de) {
-            next = de->next;
-            fn(privdata, de);
-            de = next;
-        }
-
-        /* Set unmasked bits so incrementing the reversed cursor
-         * operates on the masked bits */
-        v |= ~m0;
-
-        /* Increment the reverse cursor */
-        v = rev(v);
-        v++;
-        v = rev(v);
-
-    } else {
-        t0 = &d->ht[0];
-        t1 = &d->ht[1];
-
-        /* Make sure t0 is the smaller and t1 is the bigger table */
-        if (t0->size > t1->size) {
-            t0 = &d->ht[1];
-            t1 = &d->ht[0];
-        }
-
-        m0 = t0->sizemask;
-        m1 = t1->sizemask;
-
-        /* Emit entries at cursor */
-        if (bucketfn) bucketfn(privdata, &t0->table[v & m0]);
-        de = t0->table[v & m0];
-        while (de) {
-            next = de->next;
-            fn(privdata, de);
-            de = next;
-        }
-
-        /* Iterate over indices in larger table that are the expansion
-         * of the index pointed to by the cursor in the smaller table */
-        do {
-            /* Emit entries at cursor */
-            if (bucketfn) bucketfn(privdata, &t1->table[v & m1]);
-            de = t1->table[v & m1];
-            while (de) {
-                next = de->next;
-                fn(privdata, de);
-                de = next;
-            }
-
-            /* Increment the reverse cursor not covered by the smaller mask.*/
-            v |= ~m1;
-            v = rev(v);
-            v++;
-            v = rev(v);
-
-            /* Continue while bits covered by mask difference is non-zero */
-        } while (v & (m0 ^ m1));
-    }
-
-    dictResumeRehashing(d);
-
-    return v;
-}
-
-/* ------------------------- private functions ------------------------------ */
-
-/* Because we may need to allocate huge memory chunk at once when dict
- * expands, we will check this allocation is allowed or not if the dict
- * type has expandAllowed member function. */
-static int dictTypeExpandAllowed(dict *d) {
-    if (d->type->expandAllowed == NULL) return 1;
-    return d->type->expandAllowed(
-                    _dictNextPower(d->ht[0].used + 1) * sizeof(dictEntry*),
-                    (double)d->ht[0].used / d->ht[0].size);
-}
-
-/* Expand the hash table if needed */
-static int _dictExpandIfNeeded(dict *d)
-{
-    /* Incremental rehashing already in progress. Return. */
-    if (dictIsRehashing(d)) return DICT_OK;
-
-    /* If the hash table is empty expand it to the initial size. */
-    if (d->ht[0].size == 0) return dictExpand(d, DICT_HT_INITIAL_SIZE);
-
-    /* If we reached the 1:1 ratio, and we are allowed to resize the hash
-     * table (global setting) or we should avoid it but the ratio between
-     * elements/buckets is over the "safe" threshold, we resize doubling
-     * the number of buckets. */
-    if (d->ht[0].used >= d->ht[0].size &&
-        (dict_can_resize ||
-         d->ht[0].used/d->ht[0].size > dict_force_resize_ratio) &&
-        dictTypeExpandAllowed(d))
-    {
-        return dictExpand(d, d->ht[0].used + 1);
-    }
-    return DICT_OK;
-}
-
-/* Our hash table capability is a power of two */
-static unsigned long _dictNextPower(unsigned long size)
-{
-    unsigned long i = DICT_HT_INITIAL_SIZE;
-
-    if (size >= LONG_MAX) return LONG_MAX + 1LU;
-    while(1) {
-        if (i >= size)
-            return i;
-        i *= 2;
-    }
-}
-
-/* Returns the index of a free slot that can be populated with
- * a hash entry for the given 'key'.
- * If the key already exists, -1 is returned
- * and the optional output parameter may be filled.
- *
- * Note that if we are in the process of rehashing the hash table, the
- * index is always returned in the context of the second (new) hash table. */
-static long _dictKeyIndex(dict *d, const void *key, uint64_t hash, dictEntry **existing)
-{
-    unsigned long idx, table;
-    dictEntry *he;
-    if (existing) *existing = NULL;
-
-    /* Expand the hash table if needed */
-    if (_dictExpandIfNeeded(d) == DICT_ERR)
-        return -1;
-    for (table = 0; table <= 1; table++) {
-        idx = hash & d->ht[table].sizemask;
-        /* Search if this slot does not already contain the given key */
-        he = d->ht[table].table[idx];
-        while(he) {
-            if (key==he->key || dictCompareKeys(d, key, he->key)) {
-                if (existing) *existing = he;
-                return -1;
-            }
-            he = he->next;
-        }
-        if (!dictIsRehashing(d)) break;
-    }
-    return idx;
-}
-
-void dictEmpty(dict *d, void(callback)(void*)) {
-    _dictClear(d,&d->ht[0],callback);
-    _dictClear(d,&d->ht[1],callback);
-    d->rehashidx = -1;
-    d->pauserehash = 0;
-}
-
-void dictEnableResize(void) {
-    dict_can_resize = 1;
-}
-
-void dictDisableResize(void) {
-    dict_can_resize = 0;
-}
-
-uint64_t dictGetHash(dict *d, const void *key) {
-    return dictHashKey(d, key);
-}
-
-/* Finds the dictEntry reference by using pointer and pre-calculated hash.
- * oldkey is a dead pointer and should not be accessed.
- * the hash value should be provided using dictGetHash.
- * no string / key comparison is performed.
- * return value is the reference to the dictEntry if found, or NULL if not found. */
-dictEntry **dictFindEntryRefByPtrAndHash(dict *d, const void *oldptr, uint64_t hash) {
-    dictEntry *he, **heref;
-    unsigned long idx, table;
-
-    if (dictSize(d) == 0) return NULL; /* dict is empty */
-    for (table = 0; table <= 1; table++) {
-        idx = hash & d->ht[table].sizemask;
-        heref = &d->ht[table].table[idx];
-        he = *heref;
-        while(he) {
-            if (oldptr==he->key)
-                return heref;
-            heref = &he->next;
-            he = *heref;
-        }
-        if (!dictIsRehashing(d)) return NULL;
-    }
-    return NULL;
-}
-
-/* ------------------------------- Debugging ---------------------------------*/
-
-#define DICT_STATS_VECTLEN 50
-size_t _dictGetStatsHt(char *buf, size_t bufsize, dictht *ht, int tableid) {
-    unsigned long i, slots = 0, chainlen, maxchainlen = 0;
-    unsigned long totchainlen = 0;
-    unsigned long clvector[DICT_STATS_VECTLEN];
-    size_t l = 0;
-
-    if (ht->used == 0) {
-        return snprintf(buf,bufsize,
-            "No stats available for empty dictionaries\n");
-    }
-
-    /* Compute stats. */
-    for (i = 0; i < DICT_STATS_VECTLEN; i++) clvector[i] = 0;
-    for (i = 0; i < ht->size; i++) {
-        dictEntry *he;
-
-        if (ht->table[i] == NULL) {
-            clvector[0]++;
-            continue;
-        }
-        slots++;
-        /* For each hash entry on this slot... */
-        chainlen = 0;
-        he = ht->table[i];
-        while(he) {
-            chainlen++;
-            he = he->next;
-        }
-        clvector[(chainlen < DICT_STATS_VECTLEN) ? chainlen : (DICT_STATS_VECTLEN-1)]++;
-        if (chainlen > maxchainlen) maxchainlen = chainlen;
-        totchainlen += chainlen;
-    }
-
-    /* Generate human readable stats. */
-    l += snprintf(buf+l,bufsize-l,
-        "Hash table %d stats (%s):\n"
-        " table size: %lu\n"
-        " number of elements: %lu\n"
-        " different slots: %lu\n"
-        " max chain length: %lu\n"
-        " avg chain length (counted): %.02f\n"
-        " avg chain length (computed): %.02f\n"
-        " Chain length distribution:\n",
-        tableid, (tableid == 0) ? "main hash table" : "rehashing target",
-        ht->size, ht->used, slots, maxchainlen,
-        (float)totchainlen/slots, (float)ht->used/slots);
-
-    for (i = 0; i < DICT_STATS_VECTLEN-1; i++) {
-        if (clvector[i] == 0) continue;
-        if (l >= bufsize) break;
-        l += snprintf(buf+l,bufsize-l,
-            "   %s%ld: %ld (%.02f%%)\n",
-            (i == DICT_STATS_VECTLEN-1)?">= ":"",
-            i, clvector[i], ((float)clvector[i]/ht->size)*100);
-    }
-
-    /* Unlike snprintf(), return the number of characters actually written. */
-    if (bufsize) buf[bufsize-1] = '\0';
-    return strlen(buf);
-}
-
-void dictGetStats(char *buf, size_t bufsize, dict *d) {
-    size_t l;
-    char *orig_buf = buf;
-    size_t orig_bufsize = bufsize;
-
-    l = _dictGetStatsHt(buf,bufsize,&d->ht[0],0);
-    buf += l;
-    bufsize -= l;
-    if (dictIsRehashing(d) && bufsize > 0) {
-        _dictGetStatsHt(buf,bufsize,&d->ht[1],1);
-    }
-    /* Make sure there is a NULL term at the end. */
-    if (orig_bufsize) orig_buf[orig_bufsize-1] = '\0';
-}
-
-/* ------------------------------- Benchmark ---------------------------------*/
-
-#ifdef REDIS_TEST
-
-uint64_t hashCallback(const void *key) {
-    return dictGenHashFunction((unsigned char*)key, strlen((char*)key));
-}
-
-int compareCallback(void *privdata, const void *key1, const void *key2) {
-    int l1,l2;
-    DICT_NOTUSED(privdata);
-
-    l1 = strlen((char*)key1);
-    l2 = strlen((char*)key2);
-    if (l1 != l2) return 0;
-    return memcmp(key1, key2, l1) == 0;
-}
-
-void freeCallback(void *privdata, void *val) {
-    DICT_NOTUSED(privdata);
-
-    zfree(val);
-}
-
-char *stringFromLongLong(long long value) {
-    char buf[32];
-    int len;
-    char *s;
-
-    len = sprintf(buf,"%lld",value);
-    s = zmalloc(len+1);
-    memcpy(s, buf, len);
-    s[len] = '\0';
-    return s;
-}
-
-dictType BenchmarkDictType = {
-    hashCallback,
-    NULL,
-    NULL,
-    compareCallback,
-    freeCallback,
-    NULL,
-    NULL
-};
-
-#define start_benchmark() start = timeInMilliseconds()
-#define end_benchmark(msg) do { \
-    elapsed = timeInMilliseconds()-start; \
-    printf(msg ": %ld items in %lld ms\n", count, elapsed); \
-} while(0)
-
-/* ./redis-server test dict [<count> | --accurate] */
-int dictTest(int argc, char **argv, int accurate) {
-    long j;
-    long long start, elapsed;
-    dict *dict = dictCreate(&BenchmarkDictType,NULL);
-    long count = 0;
-
-    if (argc == 4) {
-        if (accurate) {
-            count = 5000000;
-        } else {
-            count = strtol(argv[3],NULL,10);
-        }
-    } else {
-        count = 5000;
-    }
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        int retval = dictAdd(dict,stringFromLongLong(j),(void*)j);
-        assert(retval == DICT_OK);
-    }
-    end_benchmark("Inserting");
-    assert((long)dictSize(dict) == count);
-
-    /* Wait for rehashing. */
-    while (dictIsRehashing(dict)) {
-        dictRehashMilliseconds(dict,100);
-    }
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        char *key = stringFromLongLong(j);
-        dictEntry *de = dictFind(dict,key);
-        assert(de != NULL);
-        zfree(key);
-    }
-    end_benchmark("Linear access of existing elements");
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        char *key = stringFromLongLong(j);
-        dictEntry *de = dictFind(dict,key);
-        assert(de != NULL);
-        zfree(key);
-    }
-    end_benchmark("Linear access of existing elements (2nd round)");
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        char *key = stringFromLongLong(rand() % count);
-        dictEntry *de = dictFind(dict,key);
-        assert(de != NULL);
-        zfree(key);
-    }
-    end_benchmark("Random access of existing elements");
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        dictEntry *de = dictGetRandomKey(dict);
-        assert(de != NULL);
-    }
-    end_benchmark("Accessing random keys");
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        char *key = stringFromLongLong(rand() % count);
-        key[0] = 'X';
-        dictEntry *de = dictFind(dict,key);
-        assert(de == NULL);
-        zfree(key);
-    }
-    end_benchmark("Accessing missing");
-
-    start_benchmark();
-    for (j = 0; j < count; j++) {
-        char *key = stringFromLongLong(j);
-        int retval = dictDelete(dict,key);
-        assert(retval == DICT_OK);
-        key[0] += 17; /* Change first number to letter. */
-        retval = dictAdd(dict,key,(void*)j);
-        assert(retval == DICT_OK);
-    }
-    end_benchmark("Removing and adding");
-    dictRelease(dict);
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/dict.h b/redis-stable/src/dict.h
deleted file mode 100644
index 7e225896..00000000
--- a/redis-stable/src/dict.h
+++ /dev/null
@@ -1,208 +0,0 @@
-/* Hash Tables Implementation.
- *
- * This file implements in-memory hash tables with insert/del/replace/find/
- * get-random-element operations. Hash tables will auto-resize if needed
- * tables of power of two in size are used, collisions are handled by
- * chaining. See the source code for more information... :)
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __DICT_H
-#define __DICT_H
-
-#include "mt19937-64.h"
-#include <limits.h>
-#include <stdint.h>
-#include <stdlib.h>
-
-#define DICT_OK 0
-#define DICT_ERR 1
-
-/* Unused arguments generate annoying warnings... */
-#define DICT_NOTUSED(V) ((void) V)
-
-typedef struct dictEntry {
-    void *key;
-    union {
-        void *val;
-        uint64_t u64;
-        int64_t s64;
-        double d;
-    } v;
-    struct dictEntry *next;
-} dictEntry;
-
-typedef struct dictType {
-    uint64_t (*hashFunction)(const void *key);
-    void *(*keyDup)(void *privdata, const void *key);
-    void *(*valDup)(void *privdata, const void *obj);
-    int (*keyCompare)(void *privdata, const void *key1, const void *key2);
-    void (*keyDestructor)(void *privdata, void *key);
-    void (*valDestructor)(void *privdata, void *obj);
-    int (*expandAllowed)(size_t moreMem, double usedRatio);
-} dictType;
-
-/* This is our hash table structure. Every dictionary has two of this as we
- * implement incremental rehashing, for the old to the new table. */
-typedef struct dictht {
-    dictEntry **table;
-    unsigned long size;
-    unsigned long sizemask;
-    unsigned long used;
-} dictht;
-
-typedef struct dict {
-    dictType *type;
-    void *privdata;
-    dictht ht[2];
-    long rehashidx; /* rehashing not in progress if rehashidx == -1 */
-    int16_t pauserehash; /* If >0 rehashing is paused (<0 indicates coding error) */
-} dict;
-
-/* If safe is set to 1 this is a safe iterator, that means, you can call
- * dictAdd, dictFind, and other functions against the dictionary even while
- * iterating. Otherwise it is a non safe iterator, and only dictNext()
- * should be called while iterating. */
-typedef struct dictIterator {
-    dict *d;
-    long index;
-    int table, safe;
-    dictEntry *entry, *nextEntry;
-    /* unsafe iterator fingerprint for misuse detection. */
-    long long fingerprint;
-} dictIterator;
-
-typedef void (dictScanFunction)(void *privdata, const dictEntry *de);
-typedef void (dictScanBucketFunction)(void *privdata, dictEntry **bucketref);
-
-/* This is the initial size of every hash table */
-#define DICT_HT_INITIAL_SIZE     4
-
-/* ------------------------------- Macros ------------------------------------*/
-#define dictFreeVal(d, entry) \
-    if ((d)->type->valDestructor) \
-        (d)->type->valDestructor((d)->privdata, (entry)->v.val)
-
-#define dictSetVal(d, entry, _val_) do { \
-    if ((d)->type->valDup) \
-        (entry)->v.val = (d)->type->valDup((d)->privdata, _val_); \
-    else \
-        (entry)->v.val = (_val_); \
-} while(0)
-
-#define dictSetSignedIntegerVal(entry, _val_) \
-    do { (entry)->v.s64 = _val_; } while(0)
-
-#define dictSetUnsignedIntegerVal(entry, _val_) \
-    do { (entry)->v.u64 = _val_; } while(0)
-
-#define dictSetDoubleVal(entry, _val_) \
-    do { (entry)->v.d = _val_; } while(0)
-
-#define dictFreeKey(d, entry) \
-    if ((d)->type->keyDestructor) \
-        (d)->type->keyDestructor((d)->privdata, (entry)->key)
-
-#define dictSetKey(d, entry, _key_) do { \
-    if ((d)->type->keyDup) \
-        (entry)->key = (d)->type->keyDup((d)->privdata, _key_); \
-    else \
-        (entry)->key = (_key_); \
-} while(0)
-
-#define dictCompareKeys(d, key1, key2) \
-    (((d)->type->keyCompare) ? \
-        (d)->type->keyCompare((d)->privdata, key1, key2) : \
-        (key1) == (key2))
-
-#define dictHashKey(d, key) (d)->type->hashFunction(key)
-#define dictGetKey(he) ((he)->key)
-#define dictGetVal(he) ((he)->v.val)
-#define dictGetSignedIntegerVal(he) ((he)->v.s64)
-#define dictGetUnsignedIntegerVal(he) ((he)->v.u64)
-#define dictGetDoubleVal(he) ((he)->v.d)
-#define dictSlots(d) ((d)->ht[0].size+(d)->ht[1].size)
-#define dictSize(d) ((d)->ht[0].used+(d)->ht[1].used)
-#define dictIsRehashing(d) ((d)->rehashidx != -1)
-#define dictPauseRehashing(d) (d)->pauserehash++
-#define dictResumeRehashing(d) (d)->pauserehash--
-
-/* If our unsigned long type can store a 64 bit number, use a 64 bit PRNG. */
-#if ULONG_MAX >= 0xffffffffffffffff
-#define randomULong() ((unsigned long) genrand64_int64())
-#else
-#define randomULong() random()
-#endif
-
-/* API */
-dict *dictCreate(dictType *type, void *privDataPtr);
-int dictExpand(dict *d, unsigned long size);
-int dictTryExpand(dict *d, unsigned long size);
-int dictAdd(dict *d, void *key, void *val);
-dictEntry *dictAddRaw(dict *d, void *key, dictEntry **existing);
-dictEntry *dictAddOrFind(dict *d, void *key);
-int dictReplace(dict *d, void *key, void *val);
-int dictDelete(dict *d, const void *key);
-dictEntry *dictUnlink(dict *ht, const void *key);
-void dictFreeUnlinkedEntry(dict *d, dictEntry *he);
-void dictRelease(dict *d);
-dictEntry * dictFind(dict *d, const void *key);
-void *dictFetchValue(dict *d, const void *key);
-int dictResize(dict *d);
-dictIterator *dictGetIterator(dict *d);
-dictIterator *dictGetSafeIterator(dict *d);
-dictEntry *dictNext(dictIterator *iter);
-void dictReleaseIterator(dictIterator *iter);
-dictEntry *dictGetRandomKey(dict *d);
-dictEntry *dictGetFairRandomKey(dict *d);
-unsigned int dictGetSomeKeys(dict *d, dictEntry **des, unsigned int count);
-void dictGetStats(char *buf, size_t bufsize, dict *d);
-uint64_t dictGenHashFunction(const void *key, int len);
-uint64_t dictGenCaseHashFunction(const unsigned char *buf, int len);
-void dictEmpty(dict *d, void(callback)(void*));
-void dictEnableResize(void);
-void dictDisableResize(void);
-int dictRehash(dict *d, int n);
-int dictRehashMilliseconds(dict *d, int ms);
-void dictSetHashFunctionSeed(uint8_t *seed);
-uint8_t *dictGetHashFunctionSeed(void);
-unsigned long dictScan(dict *d, unsigned long v, dictScanFunction *fn, dictScanBucketFunction *bucketfn, void *privdata);
-uint64_t dictGetHash(dict *d, const void *key);
-dictEntry **dictFindEntryRefByPtrAndHash(dict *d, const void *oldptr, uint64_t hash);
-
-/* Hash table types */
-extern dictType dictTypeHeapStringCopyKey;
-extern dictType dictTypeHeapStrings;
-extern dictType dictTypeHeapStringCopyKeyValue;
-
-#ifdef REDIS_TEST
-int dictTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif /* __DICT_H */
diff --git a/redis-stable/src/endianconv.c b/redis-stable/src/endianconv.c
deleted file mode 100644
index 98ed405a..00000000
--- a/redis-stable/src/endianconv.c
+++ /dev/null
@@ -1,129 +0,0 @@
-/* endinconv.c -- Endian conversions utilities.
- *
- * This functions are never called directly, but always using the macros
- * defined into endianconv.h, this way we define everything is a non-operation
- * if the arch is already little endian.
- *
- * Redis tries to encode everything as little endian (but a few things that need
- * to be backward compatible are still in big endian) because most of the
- * production environments are little endian, and we have a lot of conversions
- * in a few places because ziplists, intsets, zipmaps, need to be endian-neutral
- * even in memory, since they are serialized on RDB files directly with a single
- * write(2) without other additional steps.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2011-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include <stdint.h>
-
-/* Toggle the 16 bit unsigned integer pointed by *p from little endian to
- * big endian */
-void memrev16(void *p) {
-    unsigned char *x = p, t;
-
-    t = x[0];
-    x[0] = x[1];
-    x[1] = t;
-}
-
-/* Toggle the 32 bit unsigned integer pointed by *p from little endian to
- * big endian */
-void memrev32(void *p) {
-    unsigned char *x = p, t;
-
-    t = x[0];
-    x[0] = x[3];
-    x[3] = t;
-    t = x[1];
-    x[1] = x[2];
-    x[2] = t;
-}
-
-/* Toggle the 64 bit unsigned integer pointed by *p from little endian to
- * big endian */
-void memrev64(void *p) {
-    unsigned char *x = p, t;
-
-    t = x[0];
-    x[0] = x[7];
-    x[7] = t;
-    t = x[1];
-    x[1] = x[6];
-    x[6] = t;
-    t = x[2];
-    x[2] = x[5];
-    x[5] = t;
-    t = x[3];
-    x[3] = x[4];
-    x[4] = t;
-}
-
-uint16_t intrev16(uint16_t v) {
-    memrev16(&v);
-    return v;
-}
-
-uint32_t intrev32(uint32_t v) {
-    memrev32(&v);
-    return v;
-}
-
-uint64_t intrev64(uint64_t v) {
-    memrev64(&v);
-    return v;
-}
-
-#ifdef REDIS_TEST
-#include <stdio.h>
-
-#define UNUSED(x) (void)(x)
-int endianconvTest(int argc, char *argv[], int accurate) {
-    char buf[32];
-
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    sprintf(buf,"ciaoroma");
-    memrev16(buf);
-    printf("%s\n", buf);
-
-    sprintf(buf,"ciaoroma");
-    memrev32(buf);
-    printf("%s\n", buf);
-
-    sprintf(buf,"ciaoroma");
-    memrev64(buf);
-    printf("%s\n", buf);
-
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/endianconv.h b/redis-stable/src/endianconv.h
deleted file mode 100644
index 00474978..00000000
--- a/redis-stable/src/endianconv.h
+++ /dev/null
@@ -1,78 +0,0 @@
-/* See endianconv.c top comments for more information
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2011-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __ENDIANCONV_H
-#define __ENDIANCONV_H
-
-#include "config.h"
-#include <stdint.h>
-
-void memrev16(void *p);
-void memrev32(void *p);
-void memrev64(void *p);
-uint16_t intrev16(uint16_t v);
-uint32_t intrev32(uint32_t v);
-uint64_t intrev64(uint64_t v);
-
-/* variants of the function doing the actual conversion only if the target
- * host is big endian */
-#if (BYTE_ORDER == LITTLE_ENDIAN)
-#define memrev16ifbe(p) ((void)(0))
-#define memrev32ifbe(p) ((void)(0))
-#define memrev64ifbe(p) ((void)(0))
-#define intrev16ifbe(v) (v)
-#define intrev32ifbe(v) (v)
-#define intrev64ifbe(v) (v)
-#else
-#define memrev16ifbe(p) memrev16(p)
-#define memrev32ifbe(p) memrev32(p)
-#define memrev64ifbe(p) memrev64(p)
-#define intrev16ifbe(v) intrev16(v)
-#define intrev32ifbe(v) intrev32(v)
-#define intrev64ifbe(v) intrev64(v)
-#endif
-
-/* The functions htonu64() and ntohu64() convert the specified value to
- * network byte ordering and back. In big endian systems they are no-ops. */
-#if (BYTE_ORDER == BIG_ENDIAN)
-#define htonu64(v) (v)
-#define ntohu64(v) (v)
-#else
-#define htonu64(v) intrev64(v)
-#define ntohu64(v) intrev64(v)
-#endif
-
-#ifdef REDIS_TEST
-int endianconvTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif
diff --git a/redis-stable/src/evict.c b/redis-stable/src/evict.c
deleted file mode 100644
index d3cdaaa8..00000000
--- a/redis-stable/src/evict.c
+++ /dev/null
@@ -1,710 +0,0 @@
-/* Maxmemory directive handling (LRU eviction and other policies).
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "bio.h"
-#include "atomicvar.h"
-#include <math.h>
-
-/* ----------------------------------------------------------------------------
- * Data structures
- * --------------------------------------------------------------------------*/
-
-/* To improve the quality of the LRU approximation we take a set of keys
- * that are good candidate for eviction across performEvictions() calls.
- *
- * Entries inside the eviction pool are taken ordered by idle time, putting
- * greater idle times to the right (ascending order).
- *
- * When an LFU policy is used instead, a reverse frequency indication is used
- * instead of the idle time, so that we still evict by larger value (larger
- * inverse frequency means to evict keys with the least frequent accesses).
- *
- * Empty entries have the key pointer set to NULL. */
-#define EVPOOL_SIZE 16
-#define EVPOOL_CACHED_SDS_SIZE 255
-struct evictionPoolEntry {
-    unsigned long long idle;    /* Object idle time (inverse frequency for LFU) */
-    sds key;                    /* Key name. */
-    sds cached;                 /* Cached SDS object for key name. */
-    int dbid;                   /* Key DB number. */
-};
-
-static struct evictionPoolEntry *EvictionPoolLRU;
-
-/* ----------------------------------------------------------------------------
- * Implementation of eviction, aging and LRU
- * --------------------------------------------------------------------------*/
-
-/* Return the LRU clock, based on the clock resolution. This is a time
- * in a reduced-bits format that can be used to set and check the
- * object->lru field of redisObject structures. */
-unsigned int getLRUClock(void) {
-    return (mstime()/LRU_CLOCK_RESOLUTION) & LRU_CLOCK_MAX;
-}
-
-/* This function is used to obtain the current LRU clock.
- * If the current resolution is lower than the frequency we refresh the
- * LRU clock (as it should be in production servers) we return the
- * precomputed value, otherwise we need to resort to a system call. */
-unsigned int LRU_CLOCK(void) {
-    unsigned int lruclock;
-    if (1000/server.hz <= LRU_CLOCK_RESOLUTION) {
-        atomicGet(server.lruclock,lruclock);
-    } else {
-        lruclock = getLRUClock();
-    }
-    return lruclock;
-}
-
-/* Given an object returns the min number of milliseconds the object was never
- * requested, using an approximated LRU algorithm. */
-unsigned long long estimateObjectIdleTime(robj *o) {
-    unsigned long long lruclock = LRU_CLOCK();
-    if (lruclock >= o->lru) {
-        return (lruclock - o->lru) * LRU_CLOCK_RESOLUTION;
-    } else {
-        return (lruclock + (LRU_CLOCK_MAX - o->lru)) *
-                    LRU_CLOCK_RESOLUTION;
-    }
-}
-
-/* LRU approximation algorithm
- *
- * Redis uses an approximation of the LRU algorithm that runs in constant
- * memory. Every time there is a key to expire, we sample N keys (with
- * N very small, usually in around 5) to populate a pool of best keys to
- * evict of M keys (the pool size is defined by EVPOOL_SIZE).
- *
- * The N keys sampled are added in the pool of good keys to expire (the one
- * with an old access time) if they are better than one of the current keys
- * in the pool.
- *
- * After the pool is populated, the best key we have in the pool is expired.
- * However note that we don't remove keys from the pool when they are deleted
- * so the pool may contain keys that no longer exist.
- *
- * When we try to evict a key, and all the entries in the pool don't exist
- * we populate it again. This time we'll be sure that the pool has at least
- * one key that can be evicted, if there is at least one key that can be
- * evicted in the whole database. */
-
-/* Create a new eviction pool. */
-void evictionPoolAlloc(void) {
-    struct evictionPoolEntry *ep;
-    int j;
-
-    ep = zmalloc(sizeof(*ep)*EVPOOL_SIZE);
-    for (j = 0; j < EVPOOL_SIZE; j++) {
-        ep[j].idle = 0;
-        ep[j].key = NULL;
-        ep[j].cached = sdsnewlen(NULL,EVPOOL_CACHED_SDS_SIZE);
-        ep[j].dbid = 0;
-    }
-    EvictionPoolLRU = ep;
-}
-
-/* This is an helper function for performEvictions(), it is used in order
- * to populate the evictionPool with a few entries every time we want to
- * expire a key. Keys with idle time bigger than one of the current
- * keys are added. Keys are always added if there are free entries.
- *
- * We insert keys on place in ascending order, so keys with the smaller
- * idle time are on the left, and keys with the higher idle time on the
- * right. */
-
-void evictionPoolPopulate(int dbid, dict *sampledict, dict *keydict, struct evictionPoolEntry *pool) {
-    int j, k, count;
-    dictEntry *samples[server.maxmemory_samples];
-
-    count = dictGetSomeKeys(sampledict,samples,server.maxmemory_samples);
-    for (j = 0; j < count; j++) {
-        unsigned long long idle;
-        sds key;
-        robj *o;
-        dictEntry *de;
-
-        de = samples[j];
-        key = dictGetKey(de);
-
-        /* If the dictionary we are sampling from is not the main
-         * dictionary (but the expires one) we need to lookup the key
-         * again in the key dictionary to obtain the value object. */
-        if (server.maxmemory_policy != MAXMEMORY_VOLATILE_TTL) {
-            if (sampledict != keydict) de = dictFind(keydict, key);
-            o = dictGetVal(de);
-        }
-
-        /* Calculate the idle time according to the policy. This is called
-         * idle just because the code initially handled LRU, but is in fact
-         * just a score where an higher score means better candidate. */
-        if (server.maxmemory_policy & MAXMEMORY_FLAG_LRU) {
-            idle = estimateObjectIdleTime(o);
-        } else if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-            /* When we use an LRU policy, we sort the keys by idle time
-             * so that we expire keys starting from greater idle time.
-             * However when the policy is an LFU one, we have a frequency
-             * estimation, and we want to evict keys with lower frequency
-             * first. So inside the pool we put objects using the inverted
-             * frequency subtracting the actual frequency to the maximum
-             * frequency of 255. */
-            idle = 255-LFUDecrAndReturn(o);
-        } else if (server.maxmemory_policy == MAXMEMORY_VOLATILE_TTL) {
-            /* In this case the sooner the expire the better. */
-            idle = ULLONG_MAX - (long)dictGetVal(de);
-        } else {
-            serverPanic("Unknown eviction policy in evictionPoolPopulate()");
-        }
-
-        /* Insert the element inside the pool.
-         * First, find the first empty bucket or the first populated
-         * bucket that has an idle time smaller than our idle time. */
-        k = 0;
-        while (k < EVPOOL_SIZE &&
-               pool[k].key &&
-               pool[k].idle < idle) k++;
-        if (k == 0 && pool[EVPOOL_SIZE-1].key != NULL) {
-            /* Can't insert if the element is < the worst element we have
-             * and there are no empty buckets. */
-            continue;
-        } else if (k < EVPOOL_SIZE && pool[k].key == NULL) {
-            /* Inserting into empty position. No setup needed before insert. */
-        } else {
-            /* Inserting in the middle. Now k points to the first element
-             * greater than the element to insert.  */
-            if (pool[EVPOOL_SIZE-1].key == NULL) {
-                /* Free space on the right? Insert at k shifting
-                 * all the elements from k to end to the right. */
-
-                /* Save SDS before overwriting. */
-                sds cached = pool[EVPOOL_SIZE-1].cached;
-                memmove(pool+k+1,pool+k,
-                    sizeof(pool[0])*(EVPOOL_SIZE-k-1));
-                pool[k].cached = cached;
-            } else {
-                /* No free space on right? Insert at k-1 */
-                k--;
-                /* Shift all elements on the left of k (included) to the
-                 * left, so we discard the element with smaller idle time. */
-                sds cached = pool[0].cached; /* Save SDS before overwriting. */
-                if (pool[0].key != pool[0].cached) sdsfree(pool[0].key);
-                memmove(pool,pool+1,sizeof(pool[0])*k);
-                pool[k].cached = cached;
-            }
-        }
-
-        /* Try to reuse the cached SDS string allocated in the pool entry,
-         * because allocating and deallocating this object is costly
-         * (according to the profiler, not my fantasy. Remember:
-         * premature optimization bla bla bla. */
-        int klen = sdslen(key);
-        if (klen > EVPOOL_CACHED_SDS_SIZE) {
-            pool[k].key = sdsdup(key);
-        } else {
-            memcpy(pool[k].cached,key,klen+1);
-            sdssetlen(pool[k].cached,klen);
-            pool[k].key = pool[k].cached;
-        }
-        pool[k].idle = idle;
-        pool[k].dbid = dbid;
-    }
-}
-
-/* ----------------------------------------------------------------------------
- * LFU (Least Frequently Used) implementation.
-
- * We have 24 total bits of space in each object in order to implement
- * an LFU (Least Frequently Used) eviction policy, since we re-use the
- * LRU field for this purpose.
- *
- * We split the 24 bits into two fields:
- *
- *          16 bits      8 bits
- *     +----------------+--------+
- *     + Last decr time | LOG_C  |
- *     +----------------+--------+
- *
- * LOG_C is a logarithmic counter that provides an indication of the access
- * frequency. However this field must also be decremented otherwise what used
- * to be a frequently accessed key in the past, will remain ranked like that
- * forever, while we want the algorithm to adapt to access pattern changes.
- *
- * So the remaining 16 bits are used in order to store the "decrement time",
- * a reduced-precision Unix time (we take 16 bits of the time converted
- * in minutes since we don't care about wrapping around) where the LOG_C
- * counter is halved if it has an high value, or just decremented if it
- * has a low value.
- *
- * New keys don't start at zero, in order to have the ability to collect
- * some accesses before being trashed away, so they start at COUNTER_INIT_VAL.
- * The logarithmic increment performed on LOG_C takes care of COUNTER_INIT_VAL
- * when incrementing the key, so that keys starting at COUNTER_INIT_VAL
- * (or having a smaller value) have a very high chance of being incremented
- * on access.
- *
- * During decrement, the value of the logarithmic counter is halved if
- * its current value is greater than two times the COUNTER_INIT_VAL, otherwise
- * it is just decremented by one.
- * --------------------------------------------------------------------------*/
-
-/* Return the current time in minutes, just taking the least significant
- * 16 bits. The returned time is suitable to be stored as LDT (last decrement
- * time) for the LFU implementation. */
-unsigned long LFUGetTimeInMinutes(void) {
-    return (server.unixtime/60) & 65535;
-}
-
-/* Given an object last access time, compute the minimum number of minutes
- * that elapsed since the last access. Handle overflow (ldt greater than
- * the current 16 bits minutes time) considering the time as wrapping
- * exactly once. */
-unsigned long LFUTimeElapsed(unsigned long ldt) {
-    unsigned long now = LFUGetTimeInMinutes();
-    if (now >= ldt) return now-ldt;
-    return 65535-ldt+now;
-}
-
-/* Logarithmically increment a counter. The greater is the current counter value
- * the less likely is that it gets really implemented. Saturate it at 255. */
-uint8_t LFULogIncr(uint8_t counter) {
-    if (counter == 255) return 255;
-    double r = (double)rand()/RAND_MAX;
-    double baseval = counter - LFU_INIT_VAL;
-    if (baseval < 0) baseval = 0;
-    double p = 1.0/(baseval*server.lfu_log_factor+1);
-    if (r < p) counter++;
-    return counter;
-}
-
-/* If the object decrement time is reached decrement the LFU counter but
- * do not update LFU fields of the object, we update the access time
- * and counter in an explicit way when the object is really accessed.
- * And we will times halve the counter according to the times of
- * elapsed time than server.lfu_decay_time.
- * Return the object frequency counter.
- *
- * This function is used in order to scan the dataset for the best object
- * to fit: as we check for the candidate, we incrementally decrement the
- * counter of the scanned objects if needed. */
-unsigned long LFUDecrAndReturn(robj *o) {
-    unsigned long ldt = o->lru >> 8;
-    unsigned long counter = o->lru & 255;
-    unsigned long num_periods = server.lfu_decay_time ? LFUTimeElapsed(ldt) / server.lfu_decay_time : 0;
-    if (num_periods)
-        counter = (num_periods > counter) ? 0 : counter - num_periods;
-    return counter;
-}
-
-/* We don't want to count AOF buffers and slaves output buffers as
- * used memory: the eviction should use mostly data size. This function
- * returns the sum of AOF and slaves buffer. */
-size_t freeMemoryGetNotCountedMemory(void) {
-    size_t overhead = 0;
-    int slaves = listLength(server.slaves);
-
-    if (slaves) {
-        listIter li;
-        listNode *ln;
-
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = listNodeValue(ln);
-            overhead += getClientOutputBufferMemoryUsage(slave);
-        }
-    }
-    if (server.aof_state != AOF_OFF) {
-        overhead += sdsalloc(server.aof_buf)+aofRewriteBufferSize();
-    }
-    return overhead;
-}
-
-/* Get the memory status from the point of view of the maxmemory directive:
- * if the memory used is under the maxmemory setting then C_OK is returned.
- * Otherwise, if we are over the memory limit, the function returns
- * C_ERR.
- *
- * The function may return additional info via reference, only if the
- * pointers to the respective arguments is not NULL. Certain fields are
- * populated only when C_ERR is returned:
- *
- *  'total'     total amount of bytes used.
- *              (Populated both for C_ERR and C_OK)
- *
- *  'logical'   the amount of memory used minus the slaves/AOF buffers.
- *              (Populated when C_ERR is returned)
- *
- *  'tofree'    the amount of memory that should be released
- *              in order to return back into the memory limits.
- *              (Populated when C_ERR is returned)
- *
- *  'level'     this usually ranges from 0 to 1, and reports the amount of
- *              memory currently used. May be > 1 if we are over the memory
- *              limit.
- *              (Populated both for C_ERR and C_OK)
- */
-int getMaxmemoryState(size_t *total, size_t *logical, size_t *tofree, float *level) {
-    size_t mem_reported, mem_used, mem_tofree;
-
-    /* Check if we are over the memory usage limit. If we are not, no need
-     * to subtract the slaves output buffers. We can just return ASAP. */
-    mem_reported = zmalloc_used_memory();
-    if (total) *total = mem_reported;
-
-    /* We may return ASAP if there is no need to compute the level. */
-    int return_ok_asap = !server.maxmemory || mem_reported <= server.maxmemory;
-    if (return_ok_asap && !level) return C_OK;
-
-    /* Remove the size of slaves output buffers and AOF buffer from the
-     * count of used memory. */
-    mem_used = mem_reported;
-    size_t overhead = freeMemoryGetNotCountedMemory();
-    mem_used = (mem_used > overhead) ? mem_used-overhead : 0;
-
-    /* Compute the ratio of memory usage. */
-    if (level) {
-        if (!server.maxmemory) {
-            *level = 0;
-        } else {
-            *level = (float)mem_used / (float)server.maxmemory;
-        }
-    }
-
-    if (return_ok_asap) return C_OK;
-
-    /* Check if we are still over the memory limit. */
-    if (mem_used <= server.maxmemory) return C_OK;
-
-    /* Compute how much memory we need to free. */
-    mem_tofree = mem_used - server.maxmemory;
-
-    if (logical) *logical = mem_used;
-    if (tofree) *tofree = mem_tofree;
-
-    return C_ERR;
-}
-
-/* Return 1 if used memory is more than maxmemory after allocating more memory,
- * return 0 if not. Redis may reject user's requests or evict some keys if used
- * memory exceeds maxmemory, especially, when we allocate huge memory at once. */
-int overMaxmemoryAfterAlloc(size_t moremem) {
-    if (!server.maxmemory) return  0; /* No limit. */
-
-    /* Check quickly. */
-    size_t mem_used = zmalloc_used_memory();
-    if (mem_used + moremem <= server.maxmemory) return 0;
-
-    size_t overhead = freeMemoryGetNotCountedMemory();
-    mem_used = (mem_used > overhead) ? mem_used - overhead : 0;
-    return mem_used + moremem > server.maxmemory;
-}
-
-/* The evictionTimeProc is started when "maxmemory" has been breached and
- * could not immediately be resolved.  This will spin the event loop with short
- * eviction cycles until the "maxmemory" condition has resolved or there are no
- * more evictable items.  */
-static int isEvictionProcRunning = 0;
-static int evictionTimeProc(
-        struct aeEventLoop *eventLoop, long long id, void *clientData) {
-    UNUSED(eventLoop);
-    UNUSED(id);
-    UNUSED(clientData);
-
-    if (performEvictions() == EVICT_RUNNING) return 0;  /* keep evicting */
-
-    /* For EVICT_OK - things are good, no need to keep evicting.
-     * For EVICT_FAIL - there is nothing left to evict.  */
-    isEvictionProcRunning = 0;
-    return AE_NOMORE;
-}
-
-/* Check if it's safe to perform evictions.
- *   Returns 1 if evictions can be performed
- *   Returns 0 if eviction processing should be skipped
- */
-static int isSafeToPerformEvictions(void) {
-    /* - There must be no script in timeout condition.
-     * - Nor we are loading data right now.  */
-    if (server.lua_timedout || server.loading) return 0;
-
-    /* By default replicas should ignore maxmemory
-     * and just be masters exact copies. */
-    if (server.masterhost && server.repl_slave_ignore_maxmemory) return 0;
-
-    /* When clients are paused the dataset should be static not just from the
-     * POV of clients not being able to write, but also from the POV of
-     * expires and evictions of keys not being performed. */
-    if (checkClientPauseTimeoutAndReturnIfPaused()) return 0;
-
-    return 1;
-}
-
-/* Algorithm for converting tenacity (0-100) to a time limit.  */
-static unsigned long evictionTimeLimitUs() {
-    serverAssert(server.maxmemory_eviction_tenacity >= 0);
-    serverAssert(server.maxmemory_eviction_tenacity <= 100);
-
-    if (server.maxmemory_eviction_tenacity <= 10) {
-        /* A linear progression from 0..500us */
-        return 50uL * server.maxmemory_eviction_tenacity;
-    }
-
-    if (server.maxmemory_eviction_tenacity < 100) {
-        /* A 15% geometric progression, resulting in a limit of ~2 min at tenacity==99  */
-        return (unsigned long)(500.0 * pow(1.15, server.maxmemory_eviction_tenacity - 10.0));
-    }
-
-    return ULONG_MAX;   /* No limit to eviction time */
-}
-
-/* Check that memory usage is within the current "maxmemory" limit.  If over
- * "maxmemory", attempt to free memory by evicting data (if it's safe to do so).
- *
- * It's possible for Redis to suddenly be significantly over the "maxmemory"
- * setting.  This can happen if there is a large allocation (like a hash table
- * resize) or even if the "maxmemory" setting is manually adjusted.  Because of
- * this, it's important to evict for a managed period of time - otherwise Redis
- * would become unresponsive while evicting.
- *
- * The goal of this function is to improve the memory situation - not to
- * immediately resolve it.  In the case that some items have been evicted but
- * the "maxmemory" limit has not been achieved, an aeTimeProc will be started
- * which will continue to evict items until memory limits are achieved or
- * nothing more is evictable.
- *
- * This should be called before execution of commands.  If EVICT_FAIL is
- * returned, commands which will result in increased memory usage should be
- * rejected.
- *
- * Returns:
- *   EVICT_OK       - memory is OK or it's not possible to perform evictions now
- *   EVICT_RUNNING  - memory is over the limit, but eviction is still processing
- *   EVICT_FAIL     - memory is over the limit, and there's nothing to evict
- * */
-int performEvictions(void) {
-    if (!isSafeToPerformEvictions()) return EVICT_OK;
-
-    int keys_freed = 0;
-    size_t mem_reported, mem_tofree;
-    long long mem_freed; /* May be negative */
-    mstime_t latency, eviction_latency;
-    long long delta;
-    int slaves = listLength(server.slaves);
-    int result = EVICT_FAIL;
-
-    if (getMaxmemoryState(&mem_reported,NULL,&mem_tofree,NULL) == C_OK)
-        return EVICT_OK;
-
-    if (server.maxmemory_policy == MAXMEMORY_NO_EVICTION)
-        return EVICT_FAIL;  /* We need to free memory, but policy forbids. */
-
-    unsigned long eviction_time_limit_us = evictionTimeLimitUs();
-
-    mem_freed = 0;
-
-    latencyStartMonitor(latency);
-
-    monotime evictionTimer;
-    elapsedStart(&evictionTimer);
-
-    while (mem_freed < (long long)mem_tofree) {
-        int j, k, i;
-        static unsigned int next_db = 0;
-        sds bestkey = NULL;
-        int bestdbid;
-        redisDb *db;
-        dict *dict;
-        dictEntry *de;
-
-        if (server.maxmemory_policy & (MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_LFU) ||
-            server.maxmemory_policy == MAXMEMORY_VOLATILE_TTL)
-        {
-            struct evictionPoolEntry *pool = EvictionPoolLRU;
-
-            while(bestkey == NULL) {
-                unsigned long total_keys = 0, keys;
-
-                /* We don't want to make local-db choices when expiring keys,
-                 * so to start populate the eviction pool sampling keys from
-                 * every DB. */
-                for (i = 0; i < server.dbnum; i++) {
-                    db = server.db+i;
-                    dict = (server.maxmemory_policy & MAXMEMORY_FLAG_ALLKEYS) ?
-                            db->dict : db->expires;
-                    if ((keys = dictSize(dict)) != 0) {
-                        evictionPoolPopulate(i, dict, db->dict, pool);
-                        total_keys += keys;
-                    }
-                }
-                if (!total_keys) break; /* No keys to evict. */
-
-                /* Go backward from best to worst element to evict. */
-                for (k = EVPOOL_SIZE-1; k >= 0; k--) {
-                    if (pool[k].key == NULL) continue;
-                    bestdbid = pool[k].dbid;
-
-                    if (server.maxmemory_policy & MAXMEMORY_FLAG_ALLKEYS) {
-                        de = dictFind(server.db[pool[k].dbid].dict,
-                            pool[k].key);
-                    } else {
-                        de = dictFind(server.db[pool[k].dbid].expires,
-                            pool[k].key);
-                    }
-
-                    /* Remove the entry from the pool. */
-                    if (pool[k].key != pool[k].cached)
-                        sdsfree(pool[k].key);
-                    pool[k].key = NULL;
-                    pool[k].idle = 0;
-
-                    /* If the key exists, is our pick. Otherwise it is
-                     * a ghost and we need to try the next element. */
-                    if (de) {
-                        bestkey = dictGetKey(de);
-                        break;
-                    } else {
-                        /* Ghost... Iterate again. */
-                    }
-                }
-            }
-        }
-
-        /* volatile-random and allkeys-random policy */
-        else if (server.maxmemory_policy == MAXMEMORY_ALLKEYS_RANDOM ||
-                 server.maxmemory_policy == MAXMEMORY_VOLATILE_RANDOM)
-        {
-            /* When evicting a random key, we try to evict a key for
-             * each DB, so we use the static 'next_db' variable to
-             * incrementally visit all DBs. */
-            for (i = 0; i < server.dbnum; i++) {
-                j = (++next_db) % server.dbnum;
-                db = server.db+j;
-                dict = (server.maxmemory_policy == MAXMEMORY_ALLKEYS_RANDOM) ?
-                        db->dict : db->expires;
-                if (dictSize(dict) != 0) {
-                    de = dictGetRandomKey(dict);
-                    bestkey = dictGetKey(de);
-                    bestdbid = j;
-                    break;
-                }
-            }
-        }
-
-        /* Finally remove the selected key. */
-        if (bestkey) {
-            db = server.db+bestdbid;
-            robj *keyobj = createStringObject(bestkey,sdslen(bestkey));
-            propagateExpire(db,keyobj,server.lazyfree_lazy_eviction);
-            /* We compute the amount of memory freed by db*Delete() alone.
-             * It is possible that actually the memory needed to propagate
-             * the DEL in AOF and replication link is greater than the one
-             * we are freeing removing the key, but we can't account for
-             * that otherwise we would never exit the loop.
-             *
-             * Same for CSC invalidation messages generated by signalModifiedKey.
-             *
-             * AOF and Output buffer memory will be freed eventually so
-             * we only care about memory used by the key space. */
-            delta = (long long) zmalloc_used_memory();
-            latencyStartMonitor(eviction_latency);
-            if (server.lazyfree_lazy_eviction)
-                dbAsyncDelete(db,keyobj);
-            else
-                dbSyncDelete(db,keyobj);
-            latencyEndMonitor(eviction_latency);
-            latencyAddSampleIfNeeded("eviction-del",eviction_latency);
-            delta -= (long long) zmalloc_used_memory();
-            mem_freed += delta;
-            server.stat_evictedkeys++;
-            signalModifiedKey(NULL,db,keyobj);
-            notifyKeyspaceEvent(NOTIFY_EVICTED, "evicted",
-                keyobj, db->id);
-            decrRefCount(keyobj);
-            keys_freed++;
-
-            if (keys_freed % 16 == 0) {
-                /* When the memory to free starts to be big enough, we may
-                 * start spending so much time here that is impossible to
-                 * deliver data to the replicas fast enough, so we force the
-                 * transmission here inside the loop. */
-                if (slaves) flushSlavesOutputBuffers();
-
-                /* Normally our stop condition is the ability to release
-                 * a fixed, pre-computed amount of memory. However when we
-                 * are deleting objects in another thread, it's better to
-                 * check, from time to time, if we already reached our target
-                 * memory, since the "mem_freed" amount is computed only
-                 * across the dbAsyncDelete() call, while the thread can
-                 * release the memory all the time. */
-                if (server.lazyfree_lazy_eviction) {
-                    if (getMaxmemoryState(NULL,NULL,NULL,NULL) == C_OK) {
-                        break;
-                    }
-                }
-
-                /* After some time, exit the loop early - even if memory limit
-                 * hasn't been reached.  If we suddenly need to free a lot of
-                 * memory, don't want to spend too much time here.  */
-                if (elapsedUs(evictionTimer) > eviction_time_limit_us) {
-                    // We still need to free memory - start eviction timer proc
-                    if (!isEvictionProcRunning) {
-                        isEvictionProcRunning = 1;
-                        aeCreateTimeEvent(server.el, 0,
-                                evictionTimeProc, NULL, NULL);
-                    }
-                    break;
-                }
-            }
-        } else {
-            goto cant_free; /* nothing to free... */
-        }
-    }
-    /* at this point, the memory is OK, or we have reached the time limit */
-    result = (isEvictionProcRunning) ? EVICT_RUNNING : EVICT_OK;
-
-cant_free:
-    if (result == EVICT_FAIL) {
-        /* At this point, we have run out of evictable items.  It's possible
-         * that some items are being freed in the lazyfree thread.  Perform a
-         * short wait here if such jobs exist, but don't wait long.  */
-        if (bioPendingJobsOfType(BIO_LAZY_FREE)) {
-            usleep(eviction_time_limit_us);
-            if (getMaxmemoryState(NULL,NULL,NULL,NULL) == C_OK) {
-                result = EVICT_OK;
-            }
-        }
-    }
-
-    latencyEndMonitor(latency);
-    latencyAddSampleIfNeeded("eviction-cycle",latency);
-    return result;
-}
-
diff --git a/redis-stable/src/expire.c b/redis-stable/src/expire.c
deleted file mode 100644
index f23a79b8..00000000
--- a/redis-stable/src/expire.c
+++ /dev/null
@@ -1,612 +0,0 @@
-/* Implementation of EXPIRE (keys with fixed time to live).
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/*-----------------------------------------------------------------------------
- * Incremental collection of expired keys.
- *
- * When keys are accessed they are expired on-access. However we need a
- * mechanism in order to ensure keys are eventually removed when expired even
- * if no access is performed on them.
- *----------------------------------------------------------------------------*/
-
-/* Helper function for the activeExpireCycle() function.
- * This function will try to expire the key that is stored in the hash table
- * entry 'de' of the 'expires' hash table of a Redis database.
- *
- * If the key is found to be expired, it is removed from the database and
- * 1 is returned. Otherwise no operation is performed and 0 is returned.
- *
- * When a key is expired, server.stat_expiredkeys is incremented.
- *
- * The parameter 'now' is the current time in milliseconds as is passed
- * to the function to avoid too many gettimeofday() syscalls. */
-int activeExpireCycleTryExpire(redisDb *db, dictEntry *de, long long now) {
-    long long t = dictGetSignedIntegerVal(de);
-    if (now > t) {
-        sds key = dictGetKey(de);
-        robj *keyobj = createStringObject(key,sdslen(key));
-        deleteExpiredKeyAndPropagate(db,keyobj);
-        decrRefCount(keyobj);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Try to expire a few timed out keys. The algorithm used is adaptive and
- * will use few CPU cycles if there are few expiring keys, otherwise
- * it will get more aggressive to avoid that too much memory is used by
- * keys that can be removed from the keyspace.
- *
- * Every expire cycle tests multiple databases: the next call will start
- * again from the next db. No more than CRON_DBS_PER_CALL databases are
- * tested at every iteration.
- *
- * The function can perform more or less work, depending on the "type"
- * argument. It can execute a "fast cycle" or a "slow cycle". The slow
- * cycle is the main way we collect expired cycles: this happens with
- * the "server.hz" frequency (usually 10 hertz).
- *
- * However the slow cycle can exit for timeout, since it used too much time.
- * For this reason the function is also invoked to perform a fast cycle
- * at every event loop cycle, in the beforeSleep() function. The fast cycle
- * will try to perform less work, but will do it much more often.
- *
- * The following are the details of the two expire cycles and their stop
- * conditions:
- *
- * If type is ACTIVE_EXPIRE_CYCLE_FAST the function will try to run a
- * "fast" expire cycle that takes no longer than ACTIVE_EXPIRE_CYCLE_FAST_DURATION
- * microseconds, and is not repeated again before the same amount of time.
- * The cycle will also refuse to run at all if the latest slow cycle did not
- * terminate because of a time limit condition.
- *
- * If type is ACTIVE_EXPIRE_CYCLE_SLOW, that normal expire cycle is
- * executed, where the time limit is a percentage of the REDIS_HZ period
- * as specified by the ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC define. In the
- * fast cycle, the check of every database is interrupted once the number
- * of already expired keys in the database is estimated to be lower than
- * a given percentage, in order to avoid doing too much work to gain too
- * little memory.
- *
- * The configured expire "effort" will modify the baseline parameters in
- * order to do more work in both the fast and slow expire cycles.
- */
-
-#define ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP 20 /* Keys for each DB loop. */
-#define ACTIVE_EXPIRE_CYCLE_FAST_DURATION 1000 /* Microseconds. */
-#define ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC 25 /* Max % of CPU to use. */
-#define ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE 10 /* % of stale keys after which
-                                                   we do extra efforts. */
-
-void activeExpireCycle(int type) {
-    /* Adjust the running parameters according to the configured expire
-     * effort. The default effort is 1, and the maximum configurable effort
-     * is 10. */
-    unsigned long
-    effort = server.active_expire_effort-1, /* Rescale from 0 to 9. */
-    config_keys_per_loop = ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP +
-                           ACTIVE_EXPIRE_CYCLE_KEYS_PER_LOOP/4*effort,
-    config_cycle_fast_duration = ACTIVE_EXPIRE_CYCLE_FAST_DURATION +
-                                 ACTIVE_EXPIRE_CYCLE_FAST_DURATION/4*effort,
-    config_cycle_slow_time_perc = ACTIVE_EXPIRE_CYCLE_SLOW_TIME_PERC +
-                                  2*effort,
-    config_cycle_acceptable_stale = ACTIVE_EXPIRE_CYCLE_ACCEPTABLE_STALE-
-                                    effort;
-
-    /* This function has some global state in order to continue the work
-     * incrementally across calls. */
-    static unsigned int current_db = 0; /* Next DB to test. */
-    static int timelimit_exit = 0;      /* Time limit hit in previous call? */
-    static long long last_fast_cycle = 0; /* When last fast cycle ran. */
-
-    int j, iteration = 0;
-    int dbs_per_call = CRON_DBS_PER_CALL;
-    long long start = ustime(), timelimit, elapsed;
-
-    /* When clients are paused the dataset should be static not just from the
-     * POV of clients not being able to write, but also from the POV of
-     * expires and evictions of keys not being performed. */
-    if (checkClientPauseTimeoutAndReturnIfPaused()) return;
-
-    if (type == ACTIVE_EXPIRE_CYCLE_FAST) {
-        /* Don't start a fast cycle if the previous cycle did not exit
-         * for time limit, unless the percentage of estimated stale keys is
-         * too high. Also never repeat a fast cycle for the same period
-         * as the fast cycle total duration itself. */
-        if (!timelimit_exit &&
-            server.stat_expired_stale_perc < config_cycle_acceptable_stale)
-            return;
-
-        if (start < last_fast_cycle + (long long)config_cycle_fast_duration*2)
-            return;
-
-        last_fast_cycle = start;
-    }
-
-    /* We usually should test CRON_DBS_PER_CALL per iteration, with
-     * two exceptions:
-     *
-     * 1) Don't test more DBs than we have.
-     * 2) If last time we hit the time limit, we want to scan all DBs
-     * in this iteration, as there is work to do in some DB and we don't want
-     * expired keys to use memory for too much time. */
-    if (dbs_per_call > server.dbnum || timelimit_exit)
-        dbs_per_call = server.dbnum;
-
-    /* We can use at max 'config_cycle_slow_time_perc' percentage of CPU
-     * time per iteration. Since this function gets called with a frequency of
-     * server.hz times per second, the following is the max amount of
-     * microseconds we can spend in this function. */
-    timelimit = config_cycle_slow_time_perc*1000000/server.hz/100;
-    timelimit_exit = 0;
-    if (timelimit <= 0) timelimit = 1;
-
-    if (type == ACTIVE_EXPIRE_CYCLE_FAST)
-        timelimit = config_cycle_fast_duration; /* in microseconds. */
-
-    /* Accumulate some global stats as we expire keys, to have some idea
-     * about the number of keys that are already logically expired, but still
-     * existing inside the database. */
-    long total_sampled = 0;
-    long total_expired = 0;
-
-    for (j = 0; j < dbs_per_call && timelimit_exit == 0; j++) {
-        /* Expired and checked in a single loop. */
-        unsigned long expired, sampled;
-
-        redisDb *db = server.db+(current_db % server.dbnum);
-
-        /* Increment the DB now so we are sure if we run out of time
-         * in the current DB we'll restart from the next. This allows to
-         * distribute the time evenly across DBs. */
-        current_db++;
-
-        /* Continue to expire if at the end of the cycle there are still
-         * a big percentage of keys to expire, compared to the number of keys
-         * we scanned. The percentage, stored in config_cycle_acceptable_stale
-         * is not fixed, but depends on the Redis configured "expire effort". */
-        do {
-            unsigned long num, slots;
-            long long now, ttl_sum;
-            int ttl_samples;
-            iteration++;
-
-            /* If there is nothing to expire try next DB ASAP. */
-            if ((num = dictSize(db->expires)) == 0) {
-                db->avg_ttl = 0;
-                break;
-            }
-            slots = dictSlots(db->expires);
-            now = mstime();
-
-            /* When there are less than 1% filled slots, sampling the key
-             * space is expensive, so stop here waiting for better times...
-             * The dictionary will be resized asap. */
-            if (slots > DICT_HT_INITIAL_SIZE &&
-                (num*100/slots < 1)) break;
-
-            /* The main collection cycle. Sample random keys among keys
-             * with an expire set, checking for expired ones. */
-            expired = 0;
-            sampled = 0;
-            ttl_sum = 0;
-            ttl_samples = 0;
-
-            if (num > config_keys_per_loop)
-                num = config_keys_per_loop;
-
-            /* Here we access the low level representation of the hash table
-             * for speed concerns: this makes this code coupled with dict.c,
-             * but it hardly changed in ten years.
-             *
-             * Note that certain places of the hash table may be empty,
-             * so we want also a stop condition about the number of
-             * buckets that we scanned. However scanning for free buckets
-             * is very fast: we are in the cache line scanning a sequential
-             * array of NULL pointers, so we can scan a lot more buckets
-             * than keys in the same time. */
-            long max_buckets = num*20;
-            long checked_buckets = 0;
-
-            while (sampled < num && checked_buckets < max_buckets) {
-                for (int table = 0; table < 2; table++) {
-                    if (table == 1 && !dictIsRehashing(db->expires)) break;
-
-                    unsigned long idx = db->expires_cursor;
-                    idx &= db->expires->ht[table].sizemask;
-                    dictEntry *de = db->expires->ht[table].table[idx];
-                    long long ttl;
-
-                    /* Scan the current bucket of the current table. */
-                    checked_buckets++;
-                    while(de) {
-                        /* Get the next entry now since this entry may get
-                         * deleted. */
-                        dictEntry *e = de;
-                        de = de->next;
-
-                        ttl = dictGetSignedIntegerVal(e)-now;
-                        if (activeExpireCycleTryExpire(db,e,now)) expired++;
-                        if (ttl > 0) {
-                            /* We want the average TTL of keys yet
-                             * not expired. */
-                            ttl_sum += ttl;
-                            ttl_samples++;
-                        }
-                        sampled++;
-                    }
-                }
-                db->expires_cursor++;
-            }
-            total_expired += expired;
-            total_sampled += sampled;
-
-            /* Update the average TTL stats for this database. */
-            if (ttl_samples) {
-                long long avg_ttl = ttl_sum/ttl_samples;
-
-                /* Do a simple running average with a few samples.
-                 * We just use the current estimate with a weight of 2%
-                 * and the previous estimate with a weight of 98%. */
-                if (db->avg_ttl == 0) db->avg_ttl = avg_ttl;
-                db->avg_ttl = (db->avg_ttl/50)*49 + (avg_ttl/50);
-            }
-
-            /* We can't block forever here even if there are many keys to
-             * expire. So after a given amount of milliseconds return to the
-             * caller waiting for the other active expire cycle. */
-            if ((iteration & 0xf) == 0) { /* check once every 16 iterations. */
-                elapsed = ustime()-start;
-                if (elapsed > timelimit) {
-                    timelimit_exit = 1;
-                    server.stat_expired_time_cap_reached_count++;
-                    break;
-                }
-            }
-            /* We don't repeat the cycle for the current database if there are
-             * an acceptable amount of stale keys (logically expired but yet
-             * not reclaimed). */
-        } while (sampled == 0 ||
-                 (expired*100/sampled) > config_cycle_acceptable_stale);
-    }
-
-    elapsed = ustime()-start;
-    server.stat_expire_cycle_time_used += elapsed;
-    latencyAddSampleIfNeeded("expire-cycle",elapsed/1000);
-
-    /* Update our estimate of keys existing but yet to be expired.
-     * Running average with this sample accounting for 5%. */
-    double current_perc;
-    if (total_sampled) {
-        current_perc = (double)total_expired/total_sampled;
-    } else
-        current_perc = 0;
-    server.stat_expired_stale_perc = (current_perc*0.05)+
-                                     (server.stat_expired_stale_perc*0.95);
-}
-
-/*-----------------------------------------------------------------------------
- * Expires of keys created in writable slaves
- *
- * Normally slaves do not process expires: they wait the masters to synthesize
- * DEL operations in order to retain consistency. However writable slaves are
- * an exception: if a key is created in the slave and an expire is assigned
- * to it, we need a way to expire such a key, since the master does not know
- * anything about such a key.
- *
- * In order to do so, we track keys created in the slave side with an expire
- * set, and call the expireSlaveKeys() function from time to time in order to
- * reclaim the keys if they already expired.
- *
- * Note that the use case we are trying to cover here, is a popular one where
- * slaves are put in writable mode in order to compute slow operations in
- * the slave side that are mostly useful to actually read data in a more
- * processed way. Think at sets intersections in a tmp key, with an expire so
- * that it is also used as a cache to avoid intersecting every time.
- *
- * This implementation is currently not perfect but a lot better than leaking
- * the keys as implemented in 3.2.
- *----------------------------------------------------------------------------*/
-
-/* The dictionary where we remember key names and database ID of keys we may
- * want to expire from the slave. Since this function is not often used we
- * don't even care to initialize the database at startup. We'll do it once
- * the feature is used the first time, that is, when rememberSlaveKeyWithExpire()
- * is called.
- *
- * The dictionary has an SDS string representing the key as the hash table
- * key, while the value is a 64 bit unsigned integer with the bits corresponding
- * to the DB where the keys may exist set to 1. Currently the keys created
- * with a DB id > 63 are not expired, but a trivial fix is to set the bitmap
- * to the max 64 bit unsigned value when we know there is a key with a DB
- * ID greater than 63, and check all the configured DBs in such a case. */
-dict *slaveKeysWithExpire = NULL;
-
-/* Check the set of keys created by the master with an expire set in order to
- * check if they should be evicted. */
-void expireSlaveKeys(void) {
-    if (slaveKeysWithExpire == NULL ||
-        dictSize(slaveKeysWithExpire) == 0) return;
-
-    int cycles = 0, noexpire = 0;
-    mstime_t start = mstime();
-    while(1) {
-        dictEntry *de = dictGetRandomKey(slaveKeysWithExpire);
-        sds keyname = dictGetKey(de);
-        uint64_t dbids = dictGetUnsignedIntegerVal(de);
-        uint64_t new_dbids = 0;
-
-        /* Check the key against every database corresponding to the
-         * bits set in the value bitmap. */
-        int dbid = 0;
-        while(dbids && dbid < server.dbnum) {
-            if ((dbids & 1) != 0) {
-                redisDb *db = server.db+dbid;
-                dictEntry *expire = dictFind(db->expires,keyname);
-                int expired = 0;
-
-                if (expire &&
-                    activeExpireCycleTryExpire(server.db+dbid,expire,start))
-                {
-                    expired = 1;
-                }
-
-                /* If the key was not expired in this DB, we need to set the
-                 * corresponding bit in the new bitmap we set as value.
-                 * At the end of the loop if the bitmap is zero, it means we
-                 * no longer need to keep track of this key. */
-                if (expire && !expired) {
-                    noexpire++;
-                    new_dbids |= (uint64_t)1 << dbid;
-                }
-            }
-            dbid++;
-            dbids >>= 1;
-        }
-
-        /* Set the new bitmap as value of the key, in the dictionary
-         * of keys with an expire set directly in the writable slave. Otherwise
-         * if the bitmap is zero, we no longer need to keep track of it. */
-        if (new_dbids)
-            dictSetUnsignedIntegerVal(de,new_dbids);
-        else
-            dictDelete(slaveKeysWithExpire,keyname);
-
-        /* Stop conditions: found 3 keys we can't expire in a row or
-         * time limit was reached. */
-        cycles++;
-        if (noexpire > 3) break;
-        if ((cycles % 64) == 0 && mstime()-start > 1) break;
-        if (dictSize(slaveKeysWithExpire) == 0) break;
-    }
-}
-
-/* Track keys that received an EXPIRE or similar command in the context
- * of a writable slave. */
-void rememberSlaveKeyWithExpire(redisDb *db, robj *key) {
-    if (slaveKeysWithExpire == NULL) {
-        static dictType dt = {
-            dictSdsHash,                /* hash function */
-            NULL,                       /* key dup */
-            NULL,                       /* val dup */
-            dictSdsKeyCompare,          /* key compare */
-            dictSdsDestructor,          /* key destructor */
-            NULL,                       /* val destructor */
-            NULL                        /* allow to expand */
-        };
-        slaveKeysWithExpire = dictCreate(&dt,NULL);
-    }
-    if (db->id > 63) return;
-
-    dictEntry *de = dictAddOrFind(slaveKeysWithExpire,key->ptr);
-    /* If the entry was just created, set it to a copy of the SDS string
-     * representing the key: we don't want to need to take those keys
-     * in sync with the main DB. The keys will be removed by expireSlaveKeys()
-     * as it scans to find keys to remove. */
-    if (de->key == key->ptr) {
-        de->key = sdsdup(key->ptr);
-        dictSetUnsignedIntegerVal(de,0);
-    }
-
-    uint64_t dbids = dictGetUnsignedIntegerVal(de);
-    dbids |= (uint64_t)1 << db->id;
-    dictSetUnsignedIntegerVal(de,dbids);
-}
-
-/* Return the number of keys we are tracking. */
-size_t getSlaveKeyWithExpireCount(void) {
-    if (slaveKeysWithExpire == NULL) return 0;
-    return dictSize(slaveKeysWithExpire);
-}
-
-/* Remove the keys in the hash table. We need to do that when data is
- * flushed from the server. We may receive new keys from the master with
- * the same name/db and it is no longer a good idea to expire them.
- *
- * Note: technically we should handle the case of a single DB being flushed
- * but it is not worth it since anyway race conditions using the same set
- * of key names in a writable slave and in its master will lead to
- * inconsistencies. This is just a best-effort thing we do. */
-void flushSlaveKeysWithExpireList(void) {
-    if (slaveKeysWithExpire) {
-        dictRelease(slaveKeysWithExpire);
-        slaveKeysWithExpire = NULL;
-    }
-}
-
-int checkAlreadyExpired(long long when) {
-    /* EXPIRE with negative TTL, or EXPIREAT with a timestamp into the past
-     * should never be executed as a DEL when load the AOF or in the context
-     * of a slave instance.
-     *
-     * Instead we add the already expired key to the database with expire time
-     * (possibly in the past) and wait for an explicit DEL from the master. */
-    return (when <= mstime() && !server.loading && !server.masterhost);
-}
-
-/*-----------------------------------------------------------------------------
- * Expires Commands
- *----------------------------------------------------------------------------*/
-
-/* This is the generic command implementation for EXPIRE, PEXPIRE, EXPIREAT
- * and PEXPIREAT. Because the command second argument may be relative or absolute
- * the "basetime" argument is used to signal what the base time is (either 0
- * for *AT variants of the command, or the current time for relative expires).
- *
- * unit is either UNIT_SECONDS or UNIT_MILLISECONDS, and is only used for
- * the argv[2] parameter. The basetime is always specified in milliseconds. */
-void expireGenericCommand(client *c, long long basetime, int unit) {
-    robj *key = c->argv[1], *param = c->argv[2];
-    long long when; /* unix time in milliseconds when the key will expire. */
-
-    if (getLongLongFromObjectOrReply(c, param, &when, NULL) != C_OK)
-        return;
-    int negative_when = when < 0;
-    if (unit == UNIT_SECONDS) when *= 1000;
-    when += basetime;
-    if (((when < 0) && !negative_when) || ((when-basetime > 0) && negative_when)) {
-        /* EXPIRE allows negative numbers, but we can at least detect an
-         * overflow by either unit conversion or basetime addition. */
-        addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
-        return;
-    }
-    /* No key, return zero. */
-    if (lookupKeyWrite(c->db,key) == NULL) {
-        addReply(c,shared.czero);
-        return;
-    }
-
-    if (checkAlreadyExpired(when)) {
-        robj *aux;
-
-        int deleted = server.lazyfree_lazy_expire ? dbAsyncDelete(c->db,key) :
-                                                    dbSyncDelete(c->db,key);
-        serverAssertWithInfo(c,key,deleted);
-        server.dirty++;
-
-        /* Replicate/AOF this as an explicit DEL or UNLINK. */
-        aux = server.lazyfree_lazy_expire ? shared.unlink : shared.del;
-        rewriteClientCommandVector(c,2,aux,key);
-        signalModifiedKey(c,c->db,key);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
-        addReply(c, shared.cone);
-        return;
-    } else {
-        setExpire(c,c->db,key,when);
-        addReply(c,shared.cone);
-        signalModifiedKey(c,c->db,key);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",key,c->db->id);
-        server.dirty++;
-        return;
-    }
-}
-
-/* EXPIRE key seconds */
-void expireCommand(client *c) {
-    expireGenericCommand(c,mstime(),UNIT_SECONDS);
-}
-
-/* EXPIREAT key time */
-void expireatCommand(client *c) {
-    expireGenericCommand(c,0,UNIT_SECONDS);
-}
-
-/* PEXPIRE key milliseconds */
-void pexpireCommand(client *c) {
-    expireGenericCommand(c,mstime(),UNIT_MILLISECONDS);
-}
-
-/* PEXPIREAT key ms_time */
-void pexpireatCommand(client *c) {
-    expireGenericCommand(c,0,UNIT_MILLISECONDS);
-}
-
-/* Implements TTL and PTTL */
-void ttlGenericCommand(client *c, int output_ms) {
-    long long expire, ttl = -1;
-
-    /* If the key does not exist at all, return -2 */
-    if (lookupKeyReadWithFlags(c->db,c->argv[1],LOOKUP_NOTOUCH) == NULL) {
-        addReplyLongLong(c,-2);
-        return;
-    }
-    /* The key exists. Return -1 if it has no expire, or the actual
-     * TTL value otherwise. */
-    expire = getExpire(c->db,c->argv[1]);
-    if (expire != -1) {
-        ttl = expire-mstime();
-        if (ttl < 0) ttl = 0;
-    }
-    if (ttl == -1) {
-        addReplyLongLong(c,-1);
-    } else {
-        addReplyLongLong(c,output_ms ? ttl : ((ttl+500)/1000));
-    }
-}
-
-/* TTL key */
-void ttlCommand(client *c) {
-    ttlGenericCommand(c, 0);
-}
-
-/* PTTL key */
-void pttlCommand(client *c) {
-    ttlGenericCommand(c, 1);
-}
-
-/* PERSIST key */
-void persistCommand(client *c) {
-    if (lookupKeyWrite(c->db,c->argv[1])) {
-        if (removeExpire(c->db,c->argv[1])) {
-            signalModifiedKey(c,c->db,c->argv[1]);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"persist",c->argv[1],c->db->id);
-            addReply(c,shared.cone);
-            server.dirty++;
-        } else {
-            addReply(c,shared.czero);
-        }
-    } else {
-        addReply(c,shared.czero);
-    }
-}
-
-/* TOUCH key1 [key2 key3 ... keyN] */
-void touchCommand(client *c) {
-    int touched = 0;
-    for (int j = 1; j < c->argc; j++)
-        if (lookupKeyRead(c->db,c->argv[j]) != NULL) touched++;
-    addReplyLongLong(c,touched);
-}
-
diff --git a/redis-stable/src/fmacros.h b/redis-stable/src/fmacros.h
deleted file mode 100644
index a97d21a4..00000000
--- a/redis-stable/src/fmacros.h
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef _REDIS_FMACRO_H
-#define _REDIS_FMACRO_H
-
-#define _BSD_SOURCE
-
-#if defined(__linux__)
-#define _GNU_SOURCE
-#define _DEFAULT_SOURCE
-#endif
-
-#if defined(_AIX)
-#define _ALL_SOURCE
-#endif
-
-#if defined(__linux__) || defined(__OpenBSD__)
-#define _XOPEN_SOURCE 700
-/*
- * On NetBSD, _XOPEN_SOURCE undefines _NETBSD_SOURCE and
- * thus hides inet_aton etc.
- */
-#elif !defined(__NetBSD__)
-#define _XOPEN_SOURCE
-#endif
-
-#if defined(__sun)
-#define _POSIX_C_SOURCE 199506L
-#endif
-
-#define _LARGEFILE_SOURCE
-#define _FILE_OFFSET_BITS 64
-
-#ifdef __linux__
-/* features.h uses the defines above to set feature specific defines.  */
-#include <features.h>
-#endif
-
-#endif
diff --git a/redis-stable/src/geo.c b/redis-stable/src/geo.c
deleted file mode 100644
index c3f6c922..00000000
--- a/redis-stable/src/geo.c
+++ /dev/null
@@ -1,998 +0,0 @@
-/*
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
- * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "geo.h"
-#include "geohash_helper.h"
-#include "debugmacro.h"
-#include "pqsort.h"
-
-/* Things exported from t_zset.c only for geo.c, since it is the only other
- * part of Redis that requires close zset introspection. */
-unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range);
-int zslValueLteMax(double value, zrangespec *spec);
-
-/* ====================================================================
- * This file implements the following commands:
- *
- *   - geoadd - add coordinates for value to geoset
- *   - georadius - search radius by coordinates in geoset
- *   - georadiusbymember - search radius based on geoset member position
- * ==================================================================== */
-
-/* ====================================================================
- * geoArray implementation
- * ==================================================================== */
-
-/* Create a new array of geoPoints. */
-geoArray *geoArrayCreate(void) {
-    geoArray *ga = zmalloc(sizeof(*ga));
-    /* It gets allocated on first geoArrayAppend() call. */
-    ga->array = NULL;
-    ga->buckets = 0;
-    ga->used = 0;
-    return ga;
-}
-
-/* Add a new entry and return its pointer so that the caller can populate
- * it with data. */
-geoPoint *geoArrayAppend(geoArray *ga) {
-    if (ga->used == ga->buckets) {
-        ga->buckets = (ga->buckets == 0) ? 8 : ga->buckets*2;
-        ga->array = zrealloc(ga->array,sizeof(geoPoint)*ga->buckets);
-    }
-    geoPoint *gp = ga->array+ga->used;
-    ga->used++;
-    return gp;
-}
-
-/* Destroy a geoArray created with geoArrayCreate(). */
-void geoArrayFree(geoArray *ga) {
-    size_t i;
-    for (i = 0; i < ga->used; i++) sdsfree(ga->array[i].member);
-    zfree(ga->array);
-    zfree(ga);
-}
-
-/* ====================================================================
- * Helpers
- * ==================================================================== */
-int decodeGeohash(double bits, double *xy) {
-    GeoHashBits hash = { .bits = (uint64_t)bits, .step = GEO_STEP_MAX };
-    return geohashDecodeToLongLatWGS84(hash, xy);
-}
-
-/* Input Argument Helper */
-/* Take a pointer to the latitude arg then use the next arg for longitude.
- * On parse error C_ERR is returned, otherwise C_OK. */
-int extractLongLatOrReply(client *c, robj **argv, double *xy) {
-    int i;
-    for (i = 0; i < 2; i++) {
-        if (getDoubleFromObjectOrReply(c, argv[i], xy + i, NULL) !=
-            C_OK) {
-            return C_ERR;
-        }
-    }
-    if (xy[0] < GEO_LONG_MIN || xy[0] > GEO_LONG_MAX ||
-        xy[1] < GEO_LAT_MIN  || xy[1] > GEO_LAT_MAX) {
-        addReplyErrorFormat(c,
-            "-ERR invalid longitude,latitude pair %f,%f\r\n",xy[0],xy[1]);
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-/* Input Argument Helper */
-/* Decode lat/long from a zset member's score.
- * Returns C_OK on successful decoding, otherwise C_ERR is returned. */
-int longLatFromMember(robj *zobj, robj *member, double *xy) {
-    double score = 0;
-
-    if (zsetScore(zobj, member->ptr, &score) == C_ERR) return C_ERR;
-    if (!decodeGeohash(score, xy)) return C_ERR;
-    return C_OK;
-}
-
-/* Check that the unit argument matches one of the known units, and returns
- * the conversion factor to meters (you need to divide meters by the conversion
- * factor to convert to the right unit).
- *
- * If the unit is not valid, an error is reported to the client, and a value
- * less than zero is returned. */
-double extractUnitOrReply(client *c, robj *unit) {
-    char *u = unit->ptr;
-
-    if (!strcmp(u, "m")) {
-        return 1;
-    } else if (!strcmp(u, "km")) {
-        return 1000;
-    } else if (!strcmp(u, "ft")) {
-        return 0.3048;
-    } else if (!strcmp(u, "mi")) {
-        return 1609.34;
-    } else {
-        addReplyError(c,
-            "unsupported unit provided. please use m, km, ft, mi");
-        return -1;
-    }
-}
-
-/* Input Argument Helper.
- * Extract the distance from the specified two arguments starting at 'argv'
- * that should be in the form: <number> <unit>, and return C_OK or C_ERR means success or failure
- * *conversions is populated with the coefficient to use in order to convert meters to the unit.*/
-int extractDistanceOrReply(client *c, robj **argv,
-                              double *conversion, double *radius) {
-    double distance;
-    if (getDoubleFromObjectOrReply(c, argv[0], &distance,
-                                   "need numeric radius") != C_OK) {
-        return C_ERR;
-    }
-
-    if (distance < 0) {
-        addReplyError(c,"radius cannot be negative");
-        return C_ERR;
-    }
-    if (radius) *radius = distance;
-
-    double to_meters = extractUnitOrReply(c,argv[1]);
-    if (to_meters < 0) {
-        return C_ERR;
-    }
-
-    if (conversion) *conversion = to_meters;
-    return C_OK;
-}
-
-/* Input Argument Helper.
- * Extract height and width from the specified three arguments starting at 'argv'
- * that should be in the form: <number> <number> <unit>, and return C_OK or C_ERR means success or failure
- * *conversions is populated with the coefficient to use in order to convert meters to the unit.*/
-int extractBoxOrReply(client *c, robj **argv, double *conversion,
-                         double *width, double *height) {
-    double h, w;
-    if ((getDoubleFromObjectOrReply(c, argv[0], &w, "need numeric width") != C_OK) ||
-        (getDoubleFromObjectOrReply(c, argv[1], &h, "need numeric height") != C_OK)) {
-        return C_ERR;
-    }
-
-    if (h < 0 || w < 0) {
-        addReplyError(c, "height or width cannot be negative");
-        return C_ERR;
-    }
-    if (height) *height = h;
-    if (width) *width = w;
-
-    double to_meters = extractUnitOrReply(c,argv[2]);
-    if (to_meters < 0) {
-        return C_ERR;
-    }
-
-    if (conversion) *conversion = to_meters;
-    return C_OK;
-}
-
-/* The default addReplyDouble has too much accuracy.  We use this
- * for returning location distances. "5.2145 meters away" is nicer
- * than "5.2144992818115 meters away." We provide 4 digits after the dot
- * so that the returned value is decently accurate even when the unit is
- * the kilometer. */
-void addReplyDoubleDistance(client *c, double d) {
-    char dbuf[128];
-    int dlen = snprintf(dbuf, sizeof(dbuf), "%.4f", d);
-    addReplyBulkCBuffer(c, dbuf, dlen);
-}
-
-/* Helper function for geoGetPointsInRange(): given a sorted set score
- * representing a point, and a GeoShape, appends this entry as a geoPoint
- * into the specified geoArray only if the point is within the search area.
- *
- * returns C_OK if the point is included, or REIDS_ERR if it is outside. */
-int geoAppendIfWithinShape(geoArray *ga, GeoShape *shape, double score, sds member) {
-    double distance = 0, xy[2];
-
-    if (!decodeGeohash(score,xy)) return C_ERR; /* Can't decode. */
-    /* Note that geohashGetDistanceIfInRadiusWGS84() takes arguments in
-     * reverse order: longitude first, latitude later. */
-    if (shape->type == CIRCULAR_TYPE) {
-        if (!geohashGetDistanceIfInRadiusWGS84(shape->xy[0], shape->xy[1], xy[0], xy[1],
-                                               shape->t.radius*shape->conversion, &distance)) return C_ERR;
-    } else if (shape->type == RECTANGLE_TYPE) {
-        if (!geohashGetDistanceIfInRectangle(shape->t.r.width * shape->conversion,
-                                             shape->t.r.height * shape->conversion,
-                                             shape->xy[0], shape->xy[1], xy[0], xy[1], &distance))
-            return C_ERR;
-    }
-
-    /* Append the new element. */
-    geoPoint *gp = geoArrayAppend(ga);
-    gp->longitude = xy[0];
-    gp->latitude = xy[1];
-    gp->dist = distance;
-    gp->member = member;
-    gp->score = score;
-    return C_OK;
-}
-
-/* Query a Redis sorted set to extract all the elements between 'min' and
- * 'max', appending them into the array of geoPoint structures 'gparray'.
- * The command returns the number of elements added to the array.
- *
- * Elements which are farest than 'radius' from the specified 'x' and 'y'
- * coordinates are not included.
- *
- * The ability of this function to append to an existing set of points is
- * important for good performances because querying by radius is performed
- * using multiple queries to the sorted set, that we later need to sort
- * via qsort. Similarly we need to be able to reject points outside the search
- * radius area ASAP in order to allocate and process more points than needed. */
-int geoGetPointsInRange(robj *zobj, double min, double max, GeoShape *shape, geoArray *ga, unsigned long limit) {
-    /* minex 0 = include min in range; maxex 1 = exclude max in range */
-    /* That's: min <= val < max */
-    zrangespec range = { .min = min, .max = max, .minex = 0, .maxex = 1 };
-    size_t origincount = ga->used;
-    sds member;
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr = NULL;
-        unsigned int vlen = 0;
-        long long vlong = 0;
-        double score = 0;
-
-        if ((eptr = zzlFirstInRange(zl, &range)) == NULL) {
-            /* Nothing exists starting at our min.  No results. */
-            return 0;
-        }
-
-        sptr = ziplistNext(zl, eptr);
-        while (eptr) {
-            score = zzlGetScore(sptr);
-
-            /* If we fell out of range, break. */
-            if (!zslValueLteMax(score, &range))
-                break;
-
-            /* We know the element exists. ziplistGet should always succeed */
-            ziplistGet(eptr, &vstr, &vlen, &vlong);
-            member = (vstr == NULL) ? sdsfromlonglong(vlong) :
-                                      sdsnewlen(vstr,vlen);
-            if (geoAppendIfWithinShape(ga,shape,score,member)
-                == C_ERR) sdsfree(member);
-            if (ga->used && limit && ga->used >= limit) break;
-            zzlNext(zl, &eptr, &sptr);
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-
-        if ((ln = zslFirstInRange(zsl, &range)) == NULL) {
-            /* Nothing exists starting at our min.  No results. */
-            return 0;
-        }
-
-        while (ln) {
-            sds ele = ln->ele;
-            /* Abort when the node is no longer in range. */
-            if (!zslValueLteMax(ln->score, &range))
-                break;
-
-            ele = sdsdup(ele);
-            if (geoAppendIfWithinShape(ga,shape,ln->score,ele)
-                == C_ERR) sdsfree(ele);
-            if (ga->used && limit && ga->used >= limit) break;
-            ln = ln->level[0].forward;
-        }
-    }
-    return ga->used - origincount;
-}
-
-/* Compute the sorted set scores min (inclusive), max (exclusive) we should
- * query in order to retrieve all the elements inside the specified area
- * 'hash'. The two scores are returned by reference in *min and *max. */
-void scoresOfGeoHashBox(GeoHashBits hash, GeoHashFix52Bits *min, GeoHashFix52Bits *max) {
-    /* We want to compute the sorted set scores that will include all the
-     * elements inside the specified Geohash 'hash', which has as many
-     * bits as specified by hash.step * 2.
-     *
-     * So if step is, for example, 3, and the hash value in binary
-     * is 101010, since our score is 52 bits we want every element which
-     * is in binary: 101010?????????????????????????????????????????????
-     * Where ? can be 0 or 1.
-     *
-     * To get the min score we just use the initial hash value left
-     * shifted enough to get the 52 bit value. Later we increment the
-     * 6 bit prefis (see the hash.bits++ statement), and get the new
-     * prefix: 101011, which we align again to 52 bits to get the maximum
-     * value (which is excluded from the search). So we get everything
-     * between the two following scores (represented in binary):
-     *
-     * 1010100000000000000000000000000000000000000000000000 (included)
-     * and
-     * 1010110000000000000000000000000000000000000000000000 (excluded).
-     */
-    *min = geohashAlign52Bits(hash);
-    hash.bits++;
-    *max = geohashAlign52Bits(hash);
-}
-
-/* Obtain all members between the min/max of this geohash bounding box.
- * Populate a geoArray of GeoPoints by calling geoGetPointsInRange().
- * Return the number of points added to the array. */
-int membersOfGeoHashBox(robj *zobj, GeoHashBits hash, geoArray *ga, GeoShape *shape, unsigned long limit) {
-    GeoHashFix52Bits min, max;
-
-    scoresOfGeoHashBox(hash,&min,&max);
-    return geoGetPointsInRange(zobj, min, max, shape, ga, limit);
-}
-
-/* Search all eight neighbors + self geohash box */
-int membersOfAllNeighbors(robj *zobj, GeoHashRadius n, GeoShape *shape, geoArray *ga, unsigned long limit) {
-    GeoHashBits neighbors[9];
-    unsigned int i, count = 0, last_processed = 0;
-    int debugmsg = 0;
-
-    neighbors[0] = n.hash;
-    neighbors[1] = n.neighbors.north;
-    neighbors[2] = n.neighbors.south;
-    neighbors[3] = n.neighbors.east;
-    neighbors[4] = n.neighbors.west;
-    neighbors[5] = n.neighbors.north_east;
-    neighbors[6] = n.neighbors.north_west;
-    neighbors[7] = n.neighbors.south_east;
-    neighbors[8] = n.neighbors.south_west;
-
-    /* For each neighbor (*and* our own hashbox), get all the matching
-     * members and add them to the potential result list. */
-    for (i = 0; i < sizeof(neighbors) / sizeof(*neighbors); i++) {
-        if (HASHISZERO(neighbors[i])) {
-            if (debugmsg) D("neighbors[%d] is zero",i);
-            continue;
-        }
-
-        /* Debugging info. */
-        if (debugmsg) {
-            GeoHashRange long_range, lat_range;
-            geohashGetCoordRange(&long_range,&lat_range);
-            GeoHashArea myarea = {{0}};
-            geohashDecode(long_range, lat_range, neighbors[i], &myarea);
-
-            /* Dump center square. */
-            D("neighbors[%d]:\n",i);
-            D("area.longitude.min: %f\n", myarea.longitude.min);
-            D("area.longitude.max: %f\n", myarea.longitude.max);
-            D("area.latitude.min: %f\n", myarea.latitude.min);
-            D("area.latitude.max: %f\n", myarea.latitude.max);
-            D("\n");
-        }
-
-        /* When a huge Radius (in the 5000 km range or more) is used,
-         * adjacent neighbors can be the same, leading to duplicated
-         * elements. Skip every range which is the same as the one
-         * processed previously. */
-        if (last_processed &&
-            neighbors[i].bits == neighbors[last_processed].bits &&
-            neighbors[i].step == neighbors[last_processed].step)
-        {
-            if (debugmsg)
-                D("Skipping processing of %d, same as previous\n",i);
-            continue;
-        }
-        if (ga->used && limit && ga->used >= limit) break;
-        count += membersOfGeoHashBox(zobj, neighbors[i], ga, shape, limit);
-        last_processed = i;
-    }
-    return count;
-}
-
-/* Sort comparators for qsort() */
-static int sort_gp_asc(const void *a, const void *b) {
-    const struct geoPoint *gpa = a, *gpb = b;
-    /* We can't do adist - bdist because they are doubles and
-     * the comparator returns an int. */
-    if (gpa->dist > gpb->dist)
-        return 1;
-    else if (gpa->dist == gpb->dist)
-        return 0;
-    else
-        return -1;
-}
-
-static int sort_gp_desc(const void *a, const void *b) {
-    return -sort_gp_asc(a, b);
-}
-
-/* ====================================================================
- * Commands
- * ==================================================================== */
-
-/* GEOADD key [CH] [NX|XX] long lat name [long2 lat2 name2 ... longN latN nameN] */
-void geoaddCommand(client *c) {
-    int xx = 0, nx = 0, longidx = 2;
-    int i;
-
-    /* Parse options. At the end 'longidx' is set to the argument position
-     * of the longitude of the first element. */
-    while (longidx < c->argc) {
-        char *opt = c->argv[longidx]->ptr;
-        if (!strcasecmp(opt,"nx")) nx = 1;
-        else if (!strcasecmp(opt,"xx")) xx = 1;
-        else if (!strcasecmp(opt,"ch")) {}
-        else break;
-        longidx++;
-    }
-
-    if ((c->argc - longidx) % 3 || (xx && nx)) {
-        /* Need an odd number of arguments if we got this far... */
-            addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Set up the vector for calling ZADD. */
-    int elements = (c->argc - longidx) / 3;
-    int argc = longidx+elements*2; /* ZADD key [CH] [NX|XX] score ele ... */
-    robj **argv = zcalloc(argc*sizeof(robj*));
-    argv[0] = createRawStringObject("zadd",4);
-    for (i = 1; i < longidx; i++) {
-        argv[i] = c->argv[i];
-        incrRefCount(argv[i]);
-    }
-
-    /* Create the argument vector to call ZADD in order to add all
-     * the score,value pairs to the requested zset, where score is actually
-     * an encoded version of lat,long. */
-    for (i = 0; i < elements; i++) {
-        double xy[2];
-
-        if (extractLongLatOrReply(c, (c->argv+longidx)+(i*3),xy) == C_ERR) {
-            for (i = 0; i < argc; i++)
-                if (argv[i]) decrRefCount(argv[i]);
-            zfree(argv);
-            return;
-        }
-
-        /* Turn the coordinates into the score of the element. */
-        GeoHashBits hash;
-        geohashEncodeWGS84(xy[0], xy[1], GEO_STEP_MAX, &hash);
-        GeoHashFix52Bits bits = geohashAlign52Bits(hash);
-        robj *score = createObject(OBJ_STRING, sdsfromlonglong(bits));
-        robj *val = c->argv[longidx + i * 3 + 2];
-        argv[longidx+i*2] = score;
-        argv[longidx+1+i*2] = val;
-        incrRefCount(val);
-    }
-
-    /* Finally call ZADD that will do the work for us. */
-    replaceClientCommandVector(c,argc,argv);
-    zaddCommand(c);
-}
-
-#define SORT_NONE 0
-#define SORT_ASC 1
-#define SORT_DESC 2
-
-#define RADIUS_COORDS (1<<0)    /* Search around coordinates. */
-#define RADIUS_MEMBER (1<<1)    /* Search around member. */
-#define RADIUS_NOSTORE (1<<2)   /* Do not accept STORE/STOREDIST option. */
-#define GEOSEARCH (1<<3)        /* GEOSEARCH command variant (different arguments supported) */
-#define GEOSEARCHSTORE (1<<4)   /* GEOSEARCHSTORE just accept STOREDIST option */
-
-/* GEORADIUS key x y radius unit [WITHDIST] [WITHHASH] [WITHCOORD] [ASC|DESC]
- *                               [COUNT count [ANY]] [STORE key] [STOREDIST key]
- * GEORADIUSBYMEMBER key member radius unit ... options ...
- * GEOSEARCH key [FROMMEMBER member] [FROMLONLAT long lat] [BYRADIUS radius unit]
- *               [BYBOX width height unit] [WITHCOORD] [WITHDIST] [WITHASH] [COUNT count [ANY]] [ASC|DESC]
- * GEOSEARCHSTORE dest_key src_key [FROMMEMBER member] [FROMLONLAT long lat] [BYRADIUS radius unit]
- *               [BYBOX width height unit] [WITHCORD] [WITHDIST] [WITHASH] [COUNT count [ANY]] [ASC|DESC] [STOREDIST]
- *  */
-void georadiusGeneric(client *c, int srcKeyIndex, int flags) {
-    robj *storekey = NULL;
-    int storedist = 0; /* 0 for STORE, 1 for STOREDIST. */
-
-    /* Look up the requested zset */
-    robj *zobj = lookupKeyRead(c->db, c->argv[srcKeyIndex]);
-    if (checkType(c, zobj, OBJ_ZSET)) return;
-
-    /* Find long/lat to use for radius or box search based on inquiry type */
-    int base_args;
-    GeoShape shape = {0};
-    if (flags & RADIUS_COORDS) {
-        /* GEORADIUS or GEORADIUS_RO */
-        base_args = 6;
-        shape.type = CIRCULAR_TYPE;
-        if (extractLongLatOrReply(c, c->argv + 2, shape.xy) == C_ERR) return;
-        if (extractDistanceOrReply(c, c->argv+base_args-2, &shape.conversion, &shape.t.radius) != C_OK) return;
-    } else if ((flags & RADIUS_MEMBER) && !zobj) {
-        /* We don't have a source key, but we need to proceed with argument
-         * parsing, so we know which reply to use depending on the STORE flag. */
-        base_args = 5;
-    } else if (flags & RADIUS_MEMBER) {
-        /* GEORADIUSBYMEMBER or GEORADIUSBYMEMBER_RO */
-        base_args = 5;
-        shape.type = CIRCULAR_TYPE;
-        robj *member = c->argv[2];
-        if (longLatFromMember(zobj, member, shape.xy) == C_ERR) {
-            addReplyError(c, "could not decode requested zset member");
-            return;
-        }
-        if (extractDistanceOrReply(c, c->argv+base_args-2, &shape.conversion, &shape.t.radius) != C_OK) return;
-    } else if (flags & GEOSEARCH) {
-        /* GEOSEARCH or GEOSEARCHSTORE */
-        base_args = 2;
-        if (flags & GEOSEARCHSTORE) {
-            base_args = 3;
-            storekey = c->argv[1];
-        }
-    } else {
-        addReplyError(c, "Unknown georadius search type");
-        return;
-    }
-
-    /* Discover and populate all optional parameters. */
-    int withdist = 0, withhash = 0, withcoords = 0;
-    int frommember = 0, fromloc = 0, byradius = 0, bybox = 0;
-    int sort = SORT_NONE;
-    int any = 0; /* any=1 means a limited search, stop as soon as enough results were found. */
-    long long count = 0;  /* Max number of results to return. 0 means unlimited. */
-    if (c->argc > base_args) {
-        int remaining = c->argc - base_args;
-        for (int i = 0; i < remaining; i++) {
-            char *arg = c->argv[base_args + i]->ptr;
-            if (!strcasecmp(arg, "withdist")) {
-                withdist = 1;
-            } else if (!strcasecmp(arg, "withhash")) {
-                withhash = 1;
-            } else if (!strcasecmp(arg, "withcoord")) {
-                withcoords = 1;
-            } else if (!strcasecmp(arg, "any")) {
-                any = 1;
-            } else if (!strcasecmp(arg, "asc")) {
-                sort = SORT_ASC;
-            } else if (!strcasecmp(arg, "desc")) {
-                sort = SORT_DESC;
-            } else if (!strcasecmp(arg, "count") && (i+1) < remaining) {
-                if (getLongLongFromObjectOrReply(c, c->argv[base_args+i+1],
-                                                 &count, NULL) != C_OK) return;
-                if (count <= 0) {
-                    addReplyError(c,"COUNT must be > 0");
-                    return;
-                }
-                i++;
-            } else if (!strcasecmp(arg, "store") &&
-                       (i+1) < remaining &&
-                       !(flags & RADIUS_NOSTORE) &&
-                       !(flags & GEOSEARCH))
-            {
-                storekey = c->argv[base_args+i+1];
-                storedist = 0;
-                i++;
-            } else if (!strcasecmp(arg, "storedist") &&
-                       (i+1) < remaining &&
-                       !(flags & RADIUS_NOSTORE) &&
-                       !(flags & GEOSEARCH))
-            {
-                storekey = c->argv[base_args+i+1];
-                storedist = 1;
-                i++;
-            } else if (!strcasecmp(arg, "storedist") &&
-                       (flags & GEOSEARCH) &&
-                       (flags & GEOSEARCHSTORE))
-            {
-                storedist = 1;
-            } else if (!strcasecmp(arg, "frommember") &&
-                      (i+1) < remaining &&
-                      flags & GEOSEARCH &&
-                      !fromloc)
-            {
-                /* No source key, proceed with argument parsing and return an error when done. */
-                if (zobj == NULL) {
-                    frommember = 1;
-                    i++;
-                    continue;
-                }
-
-                if (longLatFromMember(zobj, c->argv[base_args+i+1], shape.xy) == C_ERR) {
-                    addReplyError(c, "could not decode requested zset member");
-                    return;
-                }
-                frommember = 1;
-                i++;
-            } else if (!strcasecmp(arg, "fromlonlat") &&
-                       (i+2) < remaining &&
-                       flags & GEOSEARCH &&
-                       !frommember)
-            {
-                if (extractLongLatOrReply(c, c->argv+base_args+i+1, shape.xy) == C_ERR) return;
-                fromloc = 1;
-                i += 2;
-            } else if (!strcasecmp(arg, "byradius") &&
-                       (i+2) < remaining &&
-                       flags & GEOSEARCH &&
-                       !bybox)
-            {
-                if (extractDistanceOrReply(c, c->argv+base_args+i+1, &shape.conversion, &shape.t.radius) != C_OK)
-                    return;
-                shape.type = CIRCULAR_TYPE;
-                byradius = 1;
-                i += 2;
-            } else if (!strcasecmp(arg, "bybox") &&
-                       (i+3) < remaining &&
-                       flags & GEOSEARCH &&
-                       !byradius)
-            {
-                if (extractBoxOrReply(c, c->argv+base_args+i+1, &shape.conversion, &shape.t.r.width,
-                        &shape.t.r.height) != C_OK) return;
-                shape.type = RECTANGLE_TYPE;
-                bybox = 1;
-                i += 3;
-            } else {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-    }
-
-    /* Trap options not compatible with STORE and STOREDIST. */
-    if (storekey && (withdist || withhash || withcoords)) {
-        addReplyError(c,
-            "STORE option in GEORADIUS is not compatible with "
-            "WITHDIST, WITHHASH and WITHCOORDS options");
-        return;
-    }
-
-    if ((flags & GEOSEARCH) && !(frommember || fromloc)) {
-        addReplyErrorFormat(c,
-            "exactly one of FROMMEMBER or FROMLONLAT can be specified for %s",
-            (char *)c->argv[0]->ptr);
-        return;
-    }
-
-    if ((flags & GEOSEARCH) && !(byradius || bybox)) {
-        addReplyErrorFormat(c,
-            "exactly one of BYRADIUS and BYBOX can be specified for %s",
-            (char *)c->argv[0]->ptr);
-        return;
-    }
-
-    if (any && !count) {
-        addReplyErrorFormat(c, "the ANY argument requires COUNT argument");
-        return;
-    }
-
-    /* Return ASAP when src key does not exist. */
-    if (zobj == NULL) {
-        if (storekey) {
-            /* store key is not NULL, try to delete it and return 0. */
-            if (dbDelete(c->db, storekey)) {
-                signalModifiedKey(c, c->db, storekey);
-                notifyKeyspaceEvent(NOTIFY_GENERIC, "del", storekey, c->db->id);
-                server.dirty++;
-            }
-            addReply(c, shared.czero);
-        } else {
-            /* Otherwise we return an empty array. */
-            addReply(c, shared.emptyarray);
-        }
-        return;
-    }
-
-    /* COUNT without ordering does not make much sense (we need to
-     * sort in order to return the closest N entries),
-     * force ASC ordering if COUNT was specified but no sorting was
-     * requested. Note that this is not needed for ANY option. */
-    if (count != 0 && sort == SORT_NONE && !any) sort = SORT_ASC;
-
-    /* Get all neighbor geohash boxes for our radius search */
-    GeoHashRadius georadius = geohashCalculateAreasByShapeWGS84(&shape);
-
-    /* Search the zset for all matching points */
-    geoArray *ga = geoArrayCreate();
-    membersOfAllNeighbors(zobj, georadius, &shape, ga, any ? count : 0);
-
-    /* If no matching results, the user gets an empty reply. */
-    if (ga->used == 0 && storekey == NULL) {
-        addReply(c,shared.emptyarray);
-        geoArrayFree(ga);
-        return;
-    }
-
-    long result_length = ga->used;
-    long returned_items = (count == 0 || result_length < count) ?
-                          result_length : count;
-    long option_length = 0;
-
-    /* Process [optional] requested sorting */
-    if (sort != SORT_NONE) {
-        int (*sort_gp_callback)(const void *a, const void *b) = NULL;
-        if (sort == SORT_ASC) {
-            sort_gp_callback = sort_gp_asc;
-        } else if (sort == SORT_DESC) {
-            sort_gp_callback = sort_gp_desc;
-        }
-
-        if (returned_items == result_length) {
-            qsort(ga->array, result_length, sizeof(geoPoint), sort_gp_callback);
-        } else {
-            pqsort(ga->array, result_length, sizeof(geoPoint), sort_gp_callback,
-                0, (returned_items - 1));
-        }
-    }
-
-    if (storekey == NULL) {
-        /* No target key, return results to user. */
-
-        /* Our options are self-contained nested multibulk replies, so we
-         * only need to track how many of those nested replies we return. */
-        if (withdist)
-            option_length++;
-
-        if (withcoords)
-            option_length++;
-
-        if (withhash)
-            option_length++;
-
-        /* The array len we send is exactly result_length. The result is
-         * either all strings of just zset members  *or* a nested multi-bulk
-         * reply containing the zset member string _and_ all the additional
-         * options the user enabled for this request. */
-        addReplyArrayLen(c, returned_items);
-
-        /* Finally send results back to the caller */
-        int i;
-        for (i = 0; i < returned_items; i++) {
-            geoPoint *gp = ga->array+i;
-            gp->dist /= shape.conversion; /* Fix according to unit. */
-
-            /* If we have options in option_length, return each sub-result
-             * as a nested multi-bulk.  Add 1 to account for result value
-             * itself. */
-            if (option_length)
-                addReplyArrayLen(c, option_length + 1);
-
-            addReplyBulkSds(c,gp->member);
-            gp->member = NULL;
-
-            if (withdist)
-                addReplyDoubleDistance(c, gp->dist);
-
-            if (withhash)
-                addReplyLongLong(c, gp->score);
-
-            if (withcoords) {
-                addReplyArrayLen(c, 2);
-                addReplyHumanLongDouble(c, gp->longitude);
-                addReplyHumanLongDouble(c, gp->latitude);
-            }
-        }
-    } else {
-        /* Target key, create a sorted set with the results. */
-        robj *zobj;
-        zset *zs;
-        int i;
-        size_t maxelelen = 0, totelelen = 0;
-
-        if (returned_items) {
-            zobj = createZsetObject();
-            zs = zobj->ptr;
-        }
-
-        for (i = 0; i < returned_items; i++) {
-            zskiplistNode *znode;
-            geoPoint *gp = ga->array+i;
-            gp->dist /= shape.conversion; /* Fix according to unit. */
-            double score = storedist ? gp->dist : gp->score;
-            size_t elelen = sdslen(gp->member);
-
-            if (maxelelen < elelen) maxelelen = elelen;
-            totelelen += elelen;
-            znode = zslInsert(zs->zsl,score,gp->member);
-            serverAssert(dictAdd(zs->dict,gp->member,&znode->score) == DICT_OK);
-            gp->member = NULL;
-        }
-
-        if (returned_items) {
-            zsetConvertToZiplistIfNeeded(zobj,maxelelen,totelelen);
-            setKey(c,c->db,storekey,zobj);
-            decrRefCount(zobj);
-            notifyKeyspaceEvent(NOTIFY_ZSET,flags & GEOSEARCH ? "geosearchstore" : "georadiusstore",storekey,
-                                c->db->id);
-            server.dirty += returned_items;
-        } else if (dbDelete(c->db,storekey)) {
-            signalModifiedKey(c,c->db,storekey);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",storekey,c->db->id);
-            server.dirty++;
-        }
-        addReplyLongLong(c, returned_items);
-    }
-    geoArrayFree(ga);
-}
-
-/* GEORADIUS wrapper function. */
-void georadiusCommand(client *c) {
-    georadiusGeneric(c, 1, RADIUS_COORDS);
-}
-
-/* GEORADIUSBYMEMBER wrapper function. */
-void georadiusbymemberCommand(client *c) {
-    georadiusGeneric(c, 1, RADIUS_MEMBER);
-}
-
-/* GEORADIUS_RO wrapper function. */
-void georadiusroCommand(client *c) {
-    georadiusGeneric(c, 1, RADIUS_COORDS|RADIUS_NOSTORE);
-}
-
-/* GEORADIUSBYMEMBER_RO wrapper function. */
-void georadiusbymemberroCommand(client *c) {
-    georadiusGeneric(c, 1, RADIUS_MEMBER|RADIUS_NOSTORE);
-}
-
-void geosearchCommand(client *c) {
-    georadiusGeneric(c, 1, GEOSEARCH);
-}
-
-void geosearchstoreCommand(client *c) {
-    georadiusGeneric(c, 2, GEOSEARCH|GEOSEARCHSTORE);
-}
-
-/* GEOHASH key ele1 ele2 ... eleN
- *
- * Returns an array with an 11 characters geohash representation of the
- * position of the specified elements. */
-void geohashCommand(client *c) {
-    char *geoalphabet= "0123456789bcdefghjkmnpqrstuvwxyz";
-    int j;
-
-    /* Look up the requested zset */
-    robj *zobj = lookupKeyRead(c->db, c->argv[1]);
-    if (checkType(c, zobj, OBJ_ZSET)) return;
-
-    /* Geohash elements one after the other, using a null bulk reply for
-     * missing elements. */
-    addReplyArrayLen(c,c->argc-2);
-    for (j = 2; j < c->argc; j++) {
-        double score;
-        if (!zobj || zsetScore(zobj, c->argv[j]->ptr, &score) == C_ERR) {
-            addReplyNull(c);
-        } else {
-            /* The internal format we use for geocoding is a bit different
-             * than the standard, since we use as initial latitude range
-             * -85,85, while the normal geohashing algorithm uses -90,90.
-             * So we have to decode our position and re-encode using the
-             * standard ranges in order to output a valid geohash string. */
-
-            /* Decode... */
-            double xy[2];
-            if (!decodeGeohash(score,xy)) {
-                addReplyNull(c);
-                continue;
-            }
-
-            /* Re-encode */
-            GeoHashRange r[2];
-            GeoHashBits hash;
-            r[0].min = -180;
-            r[0].max = 180;
-            r[1].min = -90;
-            r[1].max = 90;
-            geohashEncode(&r[0],&r[1],xy[0],xy[1],26,&hash);
-
-            char buf[12];
-            int i;
-            for (i = 0; i < 11; i++) {
-                int idx;
-                if (i == 10) {
-                    /* We have just 52 bits, but the API used to output
-                     * an 11 bytes geohash. For compatibility we assume
-                     * zero. */
-                    idx = 0;
-                } else {
-                    idx = (hash.bits >> (52-((i+1)*5))) & 0x1f;
-                }
-                buf[i] = geoalphabet[idx];
-            }
-            buf[11] = '\0';
-            addReplyBulkCBuffer(c,buf,11);
-        }
-    }
-}
-
-/* GEOPOS key ele1 ele2 ... eleN
- *
- * Returns an array of two-items arrays representing the x,y position of each
- * element specified in the arguments. For missing elements NULL is returned. */
-void geoposCommand(client *c) {
-    int j;
-
-    /* Look up the requested zset */
-    robj *zobj = lookupKeyRead(c->db, c->argv[1]);
-    if (checkType(c, zobj, OBJ_ZSET)) return;
-
-    /* Report elements one after the other, using a null bulk reply for
-     * missing elements. */
-    addReplyArrayLen(c,c->argc-2);
-    for (j = 2; j < c->argc; j++) {
-        double score;
-        if (!zobj || zsetScore(zobj, c->argv[j]->ptr, &score) == C_ERR) {
-            addReplyNullArray(c);
-        } else {
-            /* Decode... */
-            double xy[2];
-            if (!decodeGeohash(score,xy)) {
-                addReplyNullArray(c);
-                continue;
-            }
-            addReplyArrayLen(c,2);
-            addReplyHumanLongDouble(c,xy[0]);
-            addReplyHumanLongDouble(c,xy[1]);
-        }
-    }
-}
-
-/* GEODIST key ele1 ele2 [unit]
- *
- * Return the distance, in meters by default, otherwise according to "unit",
- * between points ele1 and ele2. If one or more elements are missing NULL
- * is returned. */
-void geodistCommand(client *c) {
-    double to_meter = 1;
-
-    /* Check if there is the unit to extract, otherwise assume meters. */
-    if (c->argc == 5) {
-        to_meter = extractUnitOrReply(c,c->argv[4]);
-        if (to_meter < 0) return;
-    } else if (c->argc > 5) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Look up the requested zset */
-    robj *zobj = NULL;
-    if ((zobj = lookupKeyReadOrReply(c, c->argv[1], shared.null[c->resp]))
-        == NULL || checkType(c, zobj, OBJ_ZSET)) return;
-
-    /* Get the scores. We need both otherwise NULL is returned. */
-    double score1, score2, xyxy[4];
-    if (zsetScore(zobj, c->argv[2]->ptr, &score1) == C_ERR ||
-        zsetScore(zobj, c->argv[3]->ptr, &score2) == C_ERR)
-    {
-        addReplyNull(c);
-        return;
-    }
-
-    /* Decode & compute the distance. */
-    if (!decodeGeohash(score1,xyxy) || !decodeGeohash(score2,xyxy+2))
-        addReplyNull(c);
-    else
-        addReplyDoubleDistance(c,
-            geohashGetDistance(xyxy[0],xyxy[1],xyxy[2],xyxy[3]) / to_meter);
-}
diff --git a/redis-stable/src/geo.h b/redis-stable/src/geo.h
deleted file mode 100644
index 79d0a6a4..00000000
--- a/redis-stable/src/geo.h
+++ /dev/null
@@ -1,22 +0,0 @@
-#ifndef __GEO_H__
-#define __GEO_H__
-
-#include "server.h"
-
-/* Structures used inside geo.c in order to represent points and array of
- * points on the earth. */
-typedef struct geoPoint {
-    double longitude;
-    double latitude;
-    double dist;
-    double score;
-    char *member;
-} geoPoint;
-
-typedef struct geoArray {
-    struct geoPoint *array;
-    size_t buckets;
-    size_t used;
-} geoArray;
-
-#endif
diff --git a/redis-stable/src/geohash.c b/redis-stable/src/geohash.c
deleted file mode 100644
index de9620b7..00000000
--- a/redis-stable/src/geohash.c
+++ /dev/null
@@ -1,299 +0,0 @@
-/*
- * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
- * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *  * Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- *  * Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *  * Neither the name of Redis nor the names of its contributors may be used
- *    to endorse or promote products derived from this software without
- *    specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- * THE POSSIBILITY OF SUCH DAMAGE.
- */
-#include "geohash.h"
-
-/**
- * Hashing works like this:
- * Divide the world into 4 buckets.  Label each one as such:
- *  -----------------
- *  |       |       |
- *  |       |       |
- *  | 0,1   | 1,1   |
- *  -----------------
- *  |       |       |
- *  |       |       |
- *  | 0,0   | 1,0   |
- *  -----------------
- */
-
-/* Interleave lower bits of x and y, so the bits of x
- * are in the even positions and bits from y in the odd;
- * x and y must initially be less than 2**32 (65536).
- * From:  https://graphics.stanford.edu/~seander/bithacks.html#InterleaveBMN
- */
-static inline uint64_t interleave64(uint32_t xlo, uint32_t ylo) {
-    static const uint64_t B[] = {0x5555555555555555ULL, 0x3333333333333333ULL,
-                                 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
-                                 0x0000FFFF0000FFFFULL};
-    static const unsigned int S[] = {1, 2, 4, 8, 16};
-
-    uint64_t x = xlo;
-    uint64_t y = ylo;
-
-    x = (x | (x << S[4])) & B[4];
-    y = (y | (y << S[4])) & B[4];
-
-    x = (x | (x << S[3])) & B[3];
-    y = (y | (y << S[3])) & B[3];
-
-    x = (x | (x << S[2])) & B[2];
-    y = (y | (y << S[2])) & B[2];
-
-    x = (x | (x << S[1])) & B[1];
-    y = (y | (y << S[1])) & B[1];
-
-    x = (x | (x << S[0])) & B[0];
-    y = (y | (y << S[0])) & B[0];
-
-    return x | (y << 1);
-}
-
-/* reverse the interleave process
- * derived from http://stackoverflow.com/questions/4909263
- */
-static inline uint64_t deinterleave64(uint64_t interleaved) {
-    static const uint64_t B[] = {0x5555555555555555ULL, 0x3333333333333333ULL,
-                                 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
-                                 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL};
-    static const unsigned int S[] = {0, 1, 2, 4, 8, 16};
-
-    uint64_t x = interleaved;
-    uint64_t y = interleaved >> 1;
-
-    x = (x | (x >> S[0])) & B[0];
-    y = (y | (y >> S[0])) & B[0];
-
-    x = (x | (x >> S[1])) & B[1];
-    y = (y | (y >> S[1])) & B[1];
-
-    x = (x | (x >> S[2])) & B[2];
-    y = (y | (y >> S[2])) & B[2];
-
-    x = (x | (x >> S[3])) & B[3];
-    y = (y | (y >> S[3])) & B[3];
-
-    x = (x | (x >> S[4])) & B[4];
-    y = (y | (y >> S[4])) & B[4];
-
-    x = (x | (x >> S[5])) & B[5];
-    y = (y | (y >> S[5])) & B[5];
-
-    return x | (y << 32);
-}
-
-void geohashGetCoordRange(GeoHashRange *long_range, GeoHashRange *lat_range) {
-    /* These are constraints from EPSG:900913 / EPSG:3785 / OSGEO:41001 */
-    /* We can't geocode at the north/south pole. */
-    long_range->max = GEO_LONG_MAX;
-    long_range->min = GEO_LONG_MIN;
-    lat_range->max = GEO_LAT_MAX;
-    lat_range->min = GEO_LAT_MIN;
-}
-
-int geohashEncode(const GeoHashRange *long_range, const GeoHashRange *lat_range,
-                  double longitude, double latitude, uint8_t step,
-                  GeoHashBits *hash) {
-    /* Check basic arguments sanity. */
-    if (hash == NULL || step > 32 || step == 0 ||
-        RANGEPISZERO(lat_range) || RANGEPISZERO(long_range)) return 0;
-
-    /* Return an error when trying to index outside the supported
-     * constraints. */
-    if (longitude > GEO_LONG_MAX || longitude < GEO_LONG_MIN ||
-        latitude > GEO_LAT_MAX || latitude < GEO_LAT_MIN) return 0;
-
-    hash->bits = 0;
-    hash->step = step;
-
-    if (latitude < lat_range->min || latitude > lat_range->max ||
-        longitude < long_range->min || longitude > long_range->max) {
-        return 0;
-    }
-
-    double lat_offset =
-        (latitude - lat_range->min) / (lat_range->max - lat_range->min);
-    double long_offset =
-        (longitude - long_range->min) / (long_range->max - long_range->min);
-
-    /* convert to fixed point based on the step size */
-    lat_offset *= (1ULL << step);
-    long_offset *= (1ULL << step);
-    hash->bits = interleave64(lat_offset, long_offset);
-    return 1;
-}
-
-int geohashEncodeType(double longitude, double latitude, uint8_t step, GeoHashBits *hash) {
-    GeoHashRange r[2] = {{0}};
-    geohashGetCoordRange(&r[0], &r[1]);
-    return geohashEncode(&r[0], &r[1], longitude, latitude, step, hash);
-}
-
-int geohashEncodeWGS84(double longitude, double latitude, uint8_t step,
-                       GeoHashBits *hash) {
-    return geohashEncodeType(longitude, latitude, step, hash);
-}
-
-int geohashDecode(const GeoHashRange long_range, const GeoHashRange lat_range,
-                   const GeoHashBits hash, GeoHashArea *area) {
-    if (HASHISZERO(hash) || NULL == area || RANGEISZERO(lat_range) ||
-        RANGEISZERO(long_range)) {
-        return 0;
-    }
-
-    area->hash = hash;
-    uint8_t step = hash.step;
-    uint64_t hash_sep = deinterleave64(hash.bits); /* hash = [LAT][LONG] */
-
-    double lat_scale = lat_range.max - lat_range.min;
-    double long_scale = long_range.max - long_range.min;
-
-    uint32_t ilato = hash_sep;       /* get lat part of deinterleaved hash */
-    uint32_t ilono = hash_sep >> 32; /* shift over to get long part of hash */
-
-    /* divide by 2**step.
-     * Then, for 0-1 coordinate, multiply times scale and add
-       to the min to get the absolute coordinate. */
-    area->latitude.min =
-        lat_range.min + (ilato * 1.0 / (1ull << step)) * lat_scale;
-    area->latitude.max =
-        lat_range.min + ((ilato + 1) * 1.0 / (1ull << step)) * lat_scale;
-    area->longitude.min =
-        long_range.min + (ilono * 1.0 / (1ull << step)) * long_scale;
-    area->longitude.max =
-        long_range.min + ((ilono + 1) * 1.0 / (1ull << step)) * long_scale;
-
-    return 1;
-}
-
-int geohashDecodeType(const GeoHashBits hash, GeoHashArea *area) {
-    GeoHashRange r[2] = {{0}};
-    geohashGetCoordRange(&r[0], &r[1]);
-    return geohashDecode(r[0], r[1], hash, area);
-}
-
-int geohashDecodeWGS84(const GeoHashBits hash, GeoHashArea *area) {
-    return geohashDecodeType(hash, area);
-}
-
-int geohashDecodeAreaToLongLat(const GeoHashArea *area, double *xy) {
-    if (!xy) return 0;
-    xy[0] = (area->longitude.min + area->longitude.max) / 2;
-    if (xy[0] > GEO_LONG_MAX) xy[0] = GEO_LONG_MAX;
-    if (xy[0] < GEO_LONG_MIN) xy[0] = GEO_LONG_MIN;
-    xy[1] = (area->latitude.min + area->latitude.max) / 2;
-    if (xy[1] > GEO_LAT_MAX) xy[1] = GEO_LAT_MAX;
-    if (xy[1] < GEO_LAT_MIN) xy[1] = GEO_LAT_MIN;
-    return 1;
-}
-
-int geohashDecodeToLongLatType(const GeoHashBits hash, double *xy) {
-    GeoHashArea area = {{0}};
-    if (!xy || !geohashDecodeType(hash, &area))
-        return 0;
-    return geohashDecodeAreaToLongLat(&area, xy);
-}
-
-int geohashDecodeToLongLatWGS84(const GeoHashBits hash, double *xy) {
-    return geohashDecodeToLongLatType(hash, xy);
-}
-
-static void geohash_move_x(GeoHashBits *hash, int8_t d) {
-    if (d == 0)
-        return;
-
-    uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL;
-    uint64_t y = hash->bits & 0x5555555555555555ULL;
-
-    uint64_t zz = 0x5555555555555555ULL >> (64 - hash->step * 2);
-
-    if (d > 0) {
-        x = x + (zz + 1);
-    } else {
-        x = x | zz;
-        x = x - (zz + 1);
-    }
-
-    x &= (0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2));
-    hash->bits = (x | y);
-}
-
-static void geohash_move_y(GeoHashBits *hash, int8_t d) {
-    if (d == 0)
-        return;
-
-    uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL;
-    uint64_t y = hash->bits & 0x5555555555555555ULL;
-
-    uint64_t zz = 0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2);
-    if (d > 0) {
-        y = y + (zz + 1);
-    } else {
-        y = y | zz;
-        y = y - (zz + 1);
-    }
-    y &= (0x5555555555555555ULL >> (64 - hash->step * 2));
-    hash->bits = (x | y);
-}
-
-void geohashNeighbors(const GeoHashBits *hash, GeoHashNeighbors *neighbors) {
-    neighbors->east = *hash;
-    neighbors->west = *hash;
-    neighbors->north = *hash;
-    neighbors->south = *hash;
-    neighbors->south_east = *hash;
-    neighbors->south_west = *hash;
-    neighbors->north_east = *hash;
-    neighbors->north_west = *hash;
-
-    geohash_move_x(&neighbors->east, 1);
-    geohash_move_y(&neighbors->east, 0);
-
-    geohash_move_x(&neighbors->west, -1);
-    geohash_move_y(&neighbors->west, 0);
-
-    geohash_move_x(&neighbors->south, 0);
-    geohash_move_y(&neighbors->south, -1);
-
-    geohash_move_x(&neighbors->north, 0);
-    geohash_move_y(&neighbors->north, 1);
-
-    geohash_move_x(&neighbors->north_west, -1);
-    geohash_move_y(&neighbors->north_west, 1);
-
-    geohash_move_x(&neighbors->north_east, 1);
-    geohash_move_y(&neighbors->north_east, 1);
-
-    geohash_move_x(&neighbors->south_east, 1);
-    geohash_move_y(&neighbors->south_east, -1);
-
-    geohash_move_x(&neighbors->south_west, -1);
-    geohash_move_y(&neighbors->south_west, -1);
-}
diff --git a/redis-stable/src/geohash.h b/redis-stable/src/geohash.h
deleted file mode 100644
index ebe52ff3..00000000
--- a/redis-stable/src/geohash.h
+++ /dev/null
@@ -1,137 +0,0 @@
-/*
- * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
- * Copyright (c) 2015, Salvatore Sanfilippo <antirez@gmail.com>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *  * Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- *  * Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *  * Neither the name of Redis nor the names of its contributors may be used
- *    to endorse or promote products derived from this software without
- *    specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- * THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef GEOHASH_H_
-#define GEOHASH_H_
-
-#include <stddef.h>
-#include <stdint.h>
-#include <stdint.h>
-
-#if defined(__cplusplus)
-extern "C" {
-#endif
-
-#define HASHISZERO(r) (!(r).bits && !(r).step)
-#define RANGEISZERO(r) (!(r).max && !(r).min)
-#define RANGEPISZERO(r) (r == NULL || RANGEISZERO(*r))
-
-#define GEO_STEP_MAX 26 /* 26*2 = 52 bits. */
-
-/* Limits from EPSG:900913 / EPSG:3785 / OSGEO:41001 */
-#define GEO_LAT_MIN -85.05112878
-#define GEO_LAT_MAX 85.05112878
-#define GEO_LONG_MIN -180
-#define GEO_LONG_MAX 180
-
-typedef enum {
-    GEOHASH_NORTH = 0,
-    GEOHASH_EAST,
-    GEOHASH_WEST,
-    GEOHASH_SOUTH,
-    GEOHASH_SOUTH_WEST,
-    GEOHASH_SOUTH_EAST,
-    GEOHASH_NORT_WEST,
-    GEOHASH_NORT_EAST
-} GeoDirection;
-
-typedef struct {
-    uint64_t bits;
-    uint8_t step;
-} GeoHashBits;
-
-typedef struct {
-    double min;
-    double max;
-} GeoHashRange;
-
-typedef struct {
-    GeoHashBits hash;
-    GeoHashRange longitude;
-    GeoHashRange latitude;
-} GeoHashArea;
-
-typedef struct {
-    GeoHashBits north;
-    GeoHashBits east;
-    GeoHashBits west;
-    GeoHashBits south;
-    GeoHashBits north_east;
-    GeoHashBits south_east;
-    GeoHashBits north_west;
-    GeoHashBits south_west;
-} GeoHashNeighbors;
-
-#define CIRCULAR_TYPE 1
-#define RECTANGLE_TYPE 2
-typedef struct {
-    int type; /* search type */
-    double xy[2]; /* search center point, xy[0]: lon, xy[1]: lat */
-    double conversion; /* km: 1000 */
-    double bounds[4]; /* bounds[0]: min_lon, bounds[1]: min_lat
-                       * bounds[2]: max_lon, bounds[3]: max_lat */
-    union {
-        /* CIRCULAR_TYPE */
-        double radius;
-        /* RECTANGLE_TYPE */
-        struct {
-            double height;
-            double width;
-        } r;
-    } t;
-} GeoShape;
-
-/*
- * 0:success
- * -1:failed
- */
-void geohashGetCoordRange(GeoHashRange *long_range, GeoHashRange *lat_range);
-int geohashEncode(const GeoHashRange *long_range, const GeoHashRange *lat_range,
-                  double longitude, double latitude, uint8_t step,
-                  GeoHashBits *hash);
-int geohashEncodeType(double longitude, double latitude,
-                      uint8_t step, GeoHashBits *hash);
-int geohashEncodeWGS84(double longitude, double latitude, uint8_t step,
-                       GeoHashBits *hash);
-int geohashDecode(const GeoHashRange long_range, const GeoHashRange lat_range,
-                  const GeoHashBits hash, GeoHashArea *area);
-int geohashDecodeType(const GeoHashBits hash, GeoHashArea *area);
-int geohashDecodeWGS84(const GeoHashBits hash, GeoHashArea *area);
-int geohashDecodeAreaToLongLat(const GeoHashArea *area, double *xy);
-int geohashDecodeToLongLatType(const GeoHashBits hash, double *xy);
-int geohashDecodeToLongLatWGS84(const GeoHashBits hash, double *xy);
-int geohashDecodeToLongLatMercator(const GeoHashBits hash, double *xy);
-void geohashNeighbors(const GeoHashBits *hash, GeoHashNeighbors *neighbors);
-
-#if defined(__cplusplus)
-}
-#endif
-#endif /* GEOHASH_H_ */
diff --git a/redis-stable/src/geohash_helper.c b/redis-stable/src/geohash_helper.c
deleted file mode 100644
index fec193e8..00000000
--- a/redis-stable/src/geohash_helper.c
+++ /dev/null
@@ -1,263 +0,0 @@
-/*
- * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
- * Copyright (c) 2015-2016, Salvatore Sanfilippo <antirez@gmail.com>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *  * Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- *  * Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *  * Neither the name of Redis nor the names of its contributors may be used
- *    to endorse or promote products derived from this software without
- *    specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- * THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* This is a C++ to C conversion from the ardb project.
- * This file started out as:
- * https://github.com/yinqiwen/ardb/blob/d42503/src/geo/geohash_helper.cpp
- */
-
-#include "fmacros.h"
-#include "geohash_helper.h"
-#include "debugmacro.h"
-#include <math.h>
-
-#define D_R (M_PI / 180.0)
-#define R_MAJOR 6378137.0
-#define R_MINOR 6356752.3142
-#define RATIO (R_MINOR / R_MAJOR)
-#define ECCENT (sqrt(1.0 - (RATIO *RATIO)))
-#define COM (0.5 * ECCENT)
-
-/// @brief The usual PI/180 constant
-const double DEG_TO_RAD = 0.017453292519943295769236907684886;
-/// @brief Earth's quatratic mean radius for WGS-84
-const double EARTH_RADIUS_IN_METERS = 6372797.560856;
-
-const double MERCATOR_MAX = 20037726.37;
-const double MERCATOR_MIN = -20037726.37;
-
-static inline double deg_rad(double ang) { return ang * D_R; }
-static inline double rad_deg(double ang) { return ang / D_R; }
-
-/* This function is used in order to estimate the step (bits precision)
- * of the 9 search area boxes during radius queries. */
-uint8_t geohashEstimateStepsByRadius(double range_meters, double lat) {
-    if (range_meters == 0) return 26;
-    int step = 1;
-    while (range_meters < MERCATOR_MAX) {
-        range_meters *= 2;
-        step++;
-    }
-    step -= 2; /* Make sure range is included in most of the base cases. */
-
-    /* Wider range towards the poles... Note: it is possible to do better
-     * than this approximation by computing the distance between meridians
-     * at this latitude, but this does the trick for now. */
-    if (lat > 66 || lat < -66) {
-        step--;
-        if (lat > 80 || lat < -80) step--;
-    }
-
-    /* Frame to valid range. */
-    if (step < 1) step = 1;
-    if (step > 26) step = 26;
-    return step;
-}
-
-/* Return the bounding box of the search area by shape (see geohash.h GeoShape)
- * bounds[0] - bounds[2] is the minimum and maximum longitude
- * while bounds[1] - bounds[3] is the minimum and maximum latitude.
- * since the higher the latitude, the shorter the arc length, the box shape is as follows
- * (left and right edges are actually bent), as shown in the following diagram:
- *
- *    \-----------------/          --------               \-----------------/
- *     \               /         /          \              \               /
- *      \  (long,lat) /         / (long,lat) \              \  (long,lat) /
- *       \           /         /              \              /            \
- *         ---------          /----------------\            /--------------\
- *  Northern Hemisphere       Southern Hemisphere         Around the equator
- */
-int geohashBoundingBox(GeoShape *shape, double *bounds) {
-    if (!bounds) return 0;
-    double longitude = shape->xy[0];
-    double latitude = shape->xy[1];
-    double height = shape->conversion * (shape->type == CIRCULAR_TYPE ? shape->t.radius : shape->t.r.height/2);
-    double width = shape->conversion * (shape->type == CIRCULAR_TYPE ? shape->t.radius : shape->t.r.width/2);
-
-    const double lat_delta = rad_deg(height/EARTH_RADIUS_IN_METERS);
-    const double long_delta_top = rad_deg(width/EARTH_RADIUS_IN_METERS/cos(deg_rad(latitude+lat_delta)));
-    const double long_delta_bottom = rad_deg(width/EARTH_RADIUS_IN_METERS/cos(deg_rad(latitude-lat_delta)));
-    /* The directions of the northern and southern hemispheres
-     * are opposite, so we choice different points as min/max long/lat */
-    int southern_hemisphere = latitude < 0 ? 1 : 0;
-    bounds[0] = southern_hemisphere ? longitude-long_delta_bottom : longitude-long_delta_top;
-    bounds[2] = southern_hemisphere ? longitude+long_delta_bottom : longitude+long_delta_top;
-    bounds[1] = latitude - lat_delta;
-    bounds[3] = latitude + lat_delta;
-    return 1;
-}
-
-/* Calculate a set of areas (center + 8) that are able to cover a range query
- * for the specified position and shape (see geohash.h GeoShape).
- * the bounding box saved in shaple.bounds */
-GeoHashRadius geohashCalculateAreasByShapeWGS84(GeoShape *shape) {
-    GeoHashRange long_range, lat_range;
-    GeoHashRadius radius;
-    GeoHashBits hash;
-    GeoHashNeighbors neighbors;
-    GeoHashArea area;
-    double min_lon, max_lon, min_lat, max_lat;
-    int steps;
-
-    geohashBoundingBox(shape, shape->bounds);
-    min_lon = shape->bounds[0];
-    min_lat = shape->bounds[1];
-    max_lon = shape->bounds[2];
-    max_lat = shape->bounds[3];
-
-    double longitude = shape->xy[0];
-    double latitude = shape->xy[1];
-    /* radius_meters is calculated differently in different search types:
-     * 1) CIRCULAR_TYPE, just use radius.
-     * 2) RECTANGLE_TYPE, we use sqrt((width/2)^2 + (height/2)^2) to
-     * calculate the distance from the center point to the corner */
-    double radius_meters = shape->type == CIRCULAR_TYPE ? shape->t.radius :
-            sqrt((shape->t.r.width/2)*(shape->t.r.width/2) + (shape->t.r.height/2)*(shape->t.r.height/2));
-    radius_meters *= shape->conversion;
-
-    steps = geohashEstimateStepsByRadius(radius_meters,latitude);
-
-    geohashGetCoordRange(&long_range,&lat_range);
-    geohashEncode(&long_range,&lat_range,longitude,latitude,steps,&hash);
-    geohashNeighbors(&hash,&neighbors);
-    geohashDecode(long_range,lat_range,hash,&area);
-
-    /* Check if the step is enough at the limits of the covered area.
-     * Sometimes when the search area is near an edge of the
-     * area, the estimated step is not small enough, since one of the
-     * north / south / west / east square is too near to the search area
-     * to cover everything. */
-    int decrease_step = 0;
-    {
-        GeoHashArea north, south, east, west;
-
-        geohashDecode(long_range, lat_range, neighbors.north, &north);
-        geohashDecode(long_range, lat_range, neighbors.south, &south);
-        geohashDecode(long_range, lat_range, neighbors.east, &east);
-        geohashDecode(long_range, lat_range, neighbors.west, &west);
-
-        if (geohashGetDistance(longitude,latitude,longitude,north.latitude.max)
-            < radius_meters) decrease_step = 1;
-        if (geohashGetDistance(longitude,latitude,longitude,south.latitude.min)
-            < radius_meters) decrease_step = 1;
-        if (geohashGetDistance(longitude,latitude,east.longitude.max,latitude)
-            < radius_meters) decrease_step = 1;
-        if (geohashGetDistance(longitude,latitude,west.longitude.min,latitude)
-            < radius_meters) decrease_step = 1;
-    }
-
-    if (steps > 1 && decrease_step) {
-        steps--;
-        geohashEncode(&long_range,&lat_range,longitude,latitude,steps,&hash);
-        geohashNeighbors(&hash,&neighbors);
-        geohashDecode(long_range,lat_range,hash,&area);
-    }
-
-    /* Exclude the search areas that are useless. */
-    if (steps >= 2) {
-        if (area.latitude.min < min_lat) {
-            GZERO(neighbors.south);
-            GZERO(neighbors.south_west);
-            GZERO(neighbors.south_east);
-        }
-        if (area.latitude.max > max_lat) {
-            GZERO(neighbors.north);
-            GZERO(neighbors.north_east);
-            GZERO(neighbors.north_west);
-        }
-        if (area.longitude.min < min_lon) {
-            GZERO(neighbors.west);
-            GZERO(neighbors.south_west);
-            GZERO(neighbors.north_west);
-        }
-        if (area.longitude.max > max_lon) {
-            GZERO(neighbors.east);
-            GZERO(neighbors.south_east);
-            GZERO(neighbors.north_east);
-        }
-    }
-    radius.hash = hash;
-    radius.neighbors = neighbors;
-    radius.area = area;
-    return radius;
-}
-
-GeoHashFix52Bits geohashAlign52Bits(const GeoHashBits hash) {
-    uint64_t bits = hash.bits;
-    bits <<= (52 - hash.step * 2);
-    return bits;
-}
-
-/* Calculate distance using haversin great circle distance formula. */
-double geohashGetDistance(double lon1d, double lat1d, double lon2d, double lat2d) {
-    double lat1r, lon1r, lat2r, lon2r, u, v;
-    lat1r = deg_rad(lat1d);
-    lon1r = deg_rad(lon1d);
-    lat2r = deg_rad(lat2d);
-    lon2r = deg_rad(lon2d);
-    u = sin((lat2r - lat1r) / 2);
-    v = sin((lon2r - lon1r) / 2);
-    return 2.0 * EARTH_RADIUS_IN_METERS *
-           asin(sqrt(u * u + cos(lat1r) * cos(lat2r) * v * v));
-}
-
-int geohashGetDistanceIfInRadius(double x1, double y1,
-                                 double x2, double y2, double radius,
-                                 double *distance) {
-    *distance = geohashGetDistance(x1, y1, x2, y2);
-    if (*distance > radius) return 0;
-    return 1;
-}
-
-int geohashGetDistanceIfInRadiusWGS84(double x1, double y1, double x2,
-                                      double y2, double radius,
-                                      double *distance) {
-    return geohashGetDistanceIfInRadius(x1, y1, x2, y2, radius, distance);
-}
-
-/* Judge whether a point is in the axis-aligned rectangle, when the distance
- * between a searched point and the center point is less than or equal to
- * height/2 or width/2 in height and width, the point is in the rectangle.
- *
- * width_m, height_m: the rectangle
- * x1, y1 : the center of the box
- * x2, y2 : the point to be searched
- */
-int geohashGetDistanceIfInRectangle(double width_m, double height_m, double x1, double y1,
-                                    double x2, double y2, double *distance) {
-    double lon_distance = geohashGetDistance(x2, y2, x1, y2);
-    double lat_distance = geohashGetDistance(x2, y2, x2, y1);
-    if (lon_distance > width_m/2 || lat_distance > height_m/2) {
-        return 0;
-    }
-    *distance = geohashGetDistance(x1, y1, x2, y2);
-    return 1;
-}
diff --git a/redis-stable/src/geohash_helper.h b/redis-stable/src/geohash_helper.h
deleted file mode 100644
index 630a89e3..00000000
--- a/redis-stable/src/geohash_helper.h
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2013-2014, yinqiwen <yinqiwen@gmail.com>
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>.
- * Copyright (c) 2015, Salvatore Sanfilippo <antirez@gmail.com>.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *  * Redistributions of source code must retain the above copyright notice,
- *    this list of conditions and the following disclaimer.
- *  * Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *  * Neither the name of Redis nor the names of its contributors may be used
- *    to endorse or promote products derived from this software without
- *    specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
- * THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef GEOHASH_HELPER_HPP_
-#define GEOHASH_HELPER_HPP_
-
-#include "geohash.h"
-
-#define GZERO(s) s.bits = s.step = 0;
-#define GISZERO(s) (!s.bits && !s.step)
-#define GISNOTZERO(s) (s.bits || s.step)
-
-typedef uint64_t GeoHashFix52Bits;
-typedef uint64_t GeoHashVarBits;
-
-typedef struct {
-    GeoHashBits hash;
-    GeoHashArea area;
-    GeoHashNeighbors neighbors;
-} GeoHashRadius;
-
-int GeoHashBitsComparator(const GeoHashBits *a, const GeoHashBits *b);
-uint8_t geohashEstimateStepsByRadius(double range_meters, double lat);
-int geohashBoundingBox(GeoShape *shape, double *bounds);
-GeoHashRadius geohashCalculateAreasByShapeWGS84(GeoShape *shape);
-GeoHashFix52Bits geohashAlign52Bits(const GeoHashBits hash);
-double geohashGetDistance(double lon1d, double lat1d,
-                          double lon2d, double lat2d);
-int geohashGetDistanceIfInRadius(double x1, double y1,
-                                 double x2, double y2, double radius,
-                                 double *distance);
-int geohashGetDistanceIfInRadiusWGS84(double x1, double y1, double x2,
-                                      double y2, double radius,
-                                      double *distance);
-int geohashGetDistanceIfInRectangle(double width_m, double height_m, double x1, double y1,
-                                    double x2, double y2, double *distance);
-
-#endif /* GEOHASH_HELPER_HPP_ */
diff --git a/redis-stable/src/gopher.c b/redis-stable/src/gopher.c
deleted file mode 100644
index 38e44f75..00000000
--- a/redis-stable/src/gopher.c
+++ /dev/null
@@ -1,97 +0,0 @@
-/*
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* Emit an item in Gopher directory listing format:
- * <type><descr><TAB><selector><TAB><hostname><TAB><port>
- * If descr or selector are NULL, then the "(NULL)" string is used instead. */
-void addReplyGopherItem(client *c, const char *type, const char *descr,
-                        const char *selector, const char *hostname, int port)
-{
-    sds item = sdscatfmt(sdsempty(),"%s%s\t%s\t%s\t%i\r\n",
-                         type, descr,
-                         selector ? selector : "(NULL)",
-                         hostname ? hostname : "(NULL)",
-                         port);
-    addReplyProto(c,item,sdslen(item));
-    sdsfree(item);
-}
-
-/* This is called by processInputBuffer() when an inline request is processed
- * with Gopher mode enabled, and the request happens to have zero or just one
- * argument. In such case we get the relevant key and reply using the Gopher
- * protocol. */
-void processGopherRequest(client *c) {
-    robj *keyname = c->argc == 0 ? createStringObject("/",1) : c->argv[0];
-    robj *o = lookupKeyRead(c->db,keyname);
-
-    /* If there is no such key, return with a Gopher error. */
-    if (o == NULL || o->type != OBJ_STRING) {
-        char *errstr;
-        if (o == NULL)
-            errstr = "Error: no content at the specified key";
-        else
-            errstr = "Error: selected key type is invalid "
-                     "for Gopher output";
-        addReplyGopherItem(c,"i",errstr,NULL,NULL,0);
-        addReplyGopherItem(c,"i","Redis Gopher server",NULL,NULL,0);
-    } else {
-        addReply(c,o);
-    }
-
-    /* Cleanup, also make sure to emit the final ".CRLF" line. Note that
-     * the connection will be closed immediately after this because the client
-     * will be flagged with CLIENT_CLOSE_AFTER_REPLY, in accordance with the
-     * Gopher protocol. */
-    if (c->argc == 0) decrRefCount(keyname);
-
-    /* Note that in theory we should terminate the Gopher request with
-     * ".<CR><LF>" (called Lastline in the RFC) like that:
-     *
-     * addReplyProto(c,".\r\n",3);
-     *
-     * However after examining the current clients landscape, it's probably
-     * going to do more harm than good for several reasons:
-     *
-     * 1. Clients should not have any issue with missing .<CR><LF> as for
-     *    specification, and in the real world indeed certain servers
-     *    implementations never used to send the terminator.
-     *
-     * 2. Redis does not know if it's serving a text file or a binary file:
-     *    at the same time clients will not remove the ".<CR><LF>" bytes at
-     *    tne end when downloading a binary file from the server, so adding
-     *    the "Lastline" terminator without knowing the content is just
-     *    dangerous.
-     *
-     * 3. The utility gopher2redis.rb that we provide for Redis, and any
-     *    other similar tool you may use as Gopher authoring system for
-     *    Redis, can just add the "Lastline" when needed.
-     */
-}
diff --git a/redis-stable/src/help.h b/redis-stable/src/help.h
deleted file mode 100644
index c14b53ab..00000000
--- a/redis-stable/src/help.h
+++ /dev/null
@@ -1,1438 +0,0 @@
-/* Automatically generated by ./utils/generate-command-help.rb, do not edit. */
-
-#ifndef __REDIS_HELP_H
-#define __REDIS_HELP_H
-
-static char *commandGroups[] = {
-    "generic",
-    "string",
-    "list",
-    "set",
-    "sorted_set",
-    "hash",
-    "pubsub",
-    "transactions",
-    "connection",
-    "server",
-    "scripting",
-    "hyperloglog",
-    "cluster",
-    "geo",
-    "stream"
-};
-
-struct commandHelp {
-  char *name;
-  char *params;
-  char *summary;
-  int group;
-  char *since;
-} commandHelp[] = {
-    { "ACL CAT",
-    "[categoryname]",
-    "List the ACL categories or the commands inside a category",
-    9,
-    "6.0.0" },
-    { "ACL DELUSER",
-    "username [username ...]",
-    "Remove the specified ACL users and the associated rules",
-    9,
-    "6.0.0" },
-    { "ACL GENPASS",
-    "[bits]",
-    "Generate a pseudorandom secure password to use for ACL users",
-    9,
-    "6.0.0" },
-    { "ACL GETUSER",
-    "username",
-    "Get the rules for a specific ACL user",
-    9,
-    "6.0.0" },
-    { "ACL HELP",
-    "-",
-    "Show helpful text about the different subcommands",
-    9,
-    "6.0.0" },
-    { "ACL LIST",
-    "-",
-    "List the current ACL rules in ACL config file format",
-    9,
-    "6.0.0" },
-    { "ACL LOAD",
-    "-",
-    "Reload the ACLs from the configured ACL file",
-    9,
-    "6.0.0" },
-    { "ACL LOG",
-    "[count or RESET]",
-    "List latest events denied because of ACLs in place",
-    9,
-    "6.0.0" },
-    { "ACL SAVE",
-    "-",
-    "Save the current ACL rules in the configured ACL file",
-    9,
-    "6.0.0" },
-    { "ACL SETUSER",
-    "username [rule [rule ...]]",
-    "Modify or create the rules for a specific ACL user",
-    9,
-    "6.0.0" },
-    { "ACL USERS",
-    "-",
-    "List the username of all the configured ACL rules",
-    9,
-    "6.0.0" },
-    { "ACL WHOAMI",
-    "-",
-    "Return the name of the user associated to the current connection",
-    9,
-    "6.0.0" },
-    { "APPEND",
-    "key value",
-    "Append a value to a key",
-    1,
-    "2.0.0" },
-    { "AUTH",
-    "[username] password",
-    "Authenticate to the server",
-    8,
-    "1.0.0" },
-    { "BGREWRITEAOF",
-    "-",
-    "Asynchronously rewrite the append-only file",
-    9,
-    "1.0.0" },
-    { "BGSAVE",
-    "[SCHEDULE]",
-    "Asynchronously save the dataset to disk",
-    9,
-    "1.0.0" },
-    { "BITCOUNT",
-    "key [start end]",
-    "Count set bits in a string",
-    1,
-    "2.6.0" },
-    { "BITFIELD",
-    "key [GET type offset] [SET type offset value] [INCRBY type offset increment] [OVERFLOW WRAP|SAT|FAIL]",
-    "Perform arbitrary bitfield integer operations on strings",
-    1,
-    "3.2.0" },
-    { "BITOP",
-    "operation destkey key [key ...]",
-    "Perform bitwise operations between strings",
-    1,
-    "2.6.0" },
-    { "BITPOS",
-    "key bit [start] [end]",
-    "Find first bit set or clear in a string",
-    1,
-    "2.8.7" },
-    { "BLMOVE",
-    "source destination LEFT|RIGHT LEFT|RIGHT timeout",
-    "Pop an element from a list, push it to another list and return it; or block until one is available",
-    2,
-    "6.2.0" },
-    { "BLPOP",
-    "key [key ...] timeout",
-    "Remove and get the first element in a list, or block until one is available",
-    2,
-    "2.0.0" },
-    { "BRPOP",
-    "key [key ...] timeout",
-    "Remove and get the last element in a list, or block until one is available",
-    2,
-    "2.0.0" },
-    { "BRPOPLPUSH",
-    "source destination timeout",
-    "Pop an element from a list, push it to another list and return it; or block until one is available",
-    2,
-    "2.2.0" },
-    { "BZPOPMAX",
-    "key [key ...] timeout",
-    "Remove and return the member with the highest score from one or more sorted sets, or block until one is available",
-    4,
-    "5.0.0" },
-    { "BZPOPMIN",
-    "key [key ...] timeout",
-    "Remove and return the member with the lowest score from one or more sorted sets, or block until one is available",
-    4,
-    "5.0.0" },
-    { "CLIENT CACHING",
-    "YES|NO",
-    "Instruct the server about tracking or not keys in the next request",
-    8,
-    "6.0.0" },
-    { "CLIENT GETNAME",
-    "-",
-    "Get the current connection name",
-    8,
-    "2.6.9" },
-    { "CLIENT GETREDIR",
-    "-",
-    "Get tracking notifications redirection client ID if any",
-    8,
-    "6.0.0" },
-    { "CLIENT ID",
-    "-",
-    "Returns the client ID for the current connection",
-    8,
-    "5.0.0" },
-    { "CLIENT INFO",
-    "-",
-    "Returns information about the current client connection.",
-    8,
-    "6.2.0" },
-    { "CLIENT KILL",
-    "[ip:port] [ID client-id] [TYPE normal|master|slave|pubsub] [USER username] [ADDR ip:port] [LADDR ip:port] [SKIPME yes/no]",
-    "Kill the connection of a client",
-    8,
-    "2.4.0" },
-    { "CLIENT LIST",
-    "[TYPE normal|master|replica|pubsub] [ID client-id [client-id ...]]",
-    "Get the list of client connections",
-    8,
-    "2.4.0" },
-    { "CLIENT PAUSE",
-    "timeout [WRITE|ALL]",
-    "Stop processing commands from clients for some time",
-    8,
-    "2.9.50" },
-    { "CLIENT REPLY",
-    "ON|OFF|SKIP",
-    "Instruct the server whether to reply to commands",
-    8,
-    "3.2.0" },
-    { "CLIENT SETNAME",
-    "connection-name",
-    "Set the current connection name",
-    8,
-    "2.6.9" },
-    { "CLIENT TRACKING",
-    "ON|OFF [REDIRECT client-id] [PREFIX prefix [PREFIX prefix ...]] [BCAST] [OPTIN] [OPTOUT] [NOLOOP]",
-    "Enable or disable server assisted client side caching support",
-    8,
-    "6.0.0" },
-    { "CLIENT TRACKINGINFO",
-    "-",
-    "Return information about server assisted client side caching for the current connection",
-    8,
-    "6.2.0" },
-    { "CLIENT UNBLOCK",
-    "client-id [TIMEOUT|ERROR]",
-    "Unblock a client blocked in a blocking command from a different connection",
-    8,
-    "5.0.0" },
-    { "CLIENT UNPAUSE",
-    "-",
-    "Resume processing of clients that were paused",
-    8,
-    "6.2.0" },
-    { "CLUSTER ADDSLOTS",
-    "slot [slot ...]",
-    "Assign new hash slots to receiving node",
-    12,
-    "3.0.0" },
-    { "CLUSTER BUMPEPOCH",
-    "-",
-    "Advance the cluster config epoch",
-    12,
-    "3.0.0" },
-    { "CLUSTER COUNT-FAILURE-REPORTS",
-    "node-id",
-    "Return the number of failure reports active for a given node",
-    12,
-    "3.0.0" },
-    { "CLUSTER COUNTKEYSINSLOT",
-    "slot",
-    "Return the number of local keys in the specified hash slot",
-    12,
-    "3.0.0" },
-    { "CLUSTER DELSLOTS",
-    "slot [slot ...]",
-    "Set hash slots as unbound in receiving node",
-    12,
-    "3.0.0" },
-    { "CLUSTER FAILOVER",
-    "[FORCE|TAKEOVER]",
-    "Forces a replica to perform a manual failover of its master.",
-    12,
-    "3.0.0" },
-    { "CLUSTER FLUSHSLOTS",
-    "-",
-    "Delete a node's own slots information",
-    12,
-    "3.0.0" },
-    { "CLUSTER FORGET",
-    "node-id",
-    "Remove a node from the nodes table",
-    12,
-    "3.0.0" },
-    { "CLUSTER GETKEYSINSLOT",
-    "slot count",
-    "Return local key names in the specified hash slot",
-    12,
-    "3.0.0" },
-    { "CLUSTER INFO",
-    "-",
-    "Provides info about Redis Cluster node state",
-    12,
-    "3.0.0" },
-    { "CLUSTER KEYSLOT",
-    "key",
-    "Returns the hash slot of the specified key",
-    12,
-    "3.0.0" },
-    { "CLUSTER MEET",
-    "ip port",
-    "Force a node cluster to handshake with another node",
-    12,
-    "3.0.0" },
-    { "CLUSTER MYID",
-    "-",
-    "Return the node id",
-    12,
-    "3.0.0" },
-    { "CLUSTER NODES",
-    "-",
-    "Get Cluster config for the node",
-    12,
-    "3.0.0" },
-    { "CLUSTER REPLICAS",
-    "node-id",
-    "List replica nodes of the specified master node",
-    12,
-    "5.0.0" },
-    { "CLUSTER REPLICATE",
-    "node-id",
-    "Reconfigure a node as a replica of the specified master node",
-    12,
-    "3.0.0" },
-    { "CLUSTER RESET",
-    "[HARD|SOFT]",
-    "Reset a Redis Cluster node",
-    12,
-    "3.0.0" },
-    { "CLUSTER SAVECONFIG",
-    "-",
-    "Forces the node to save cluster state on disk",
-    12,
-    "3.0.0" },
-    { "CLUSTER SET-CONFIG-EPOCH",
-    "config-epoch",
-    "Set the configuration epoch in a new node",
-    12,
-    "3.0.0" },
-    { "CLUSTER SETSLOT",
-    "slot IMPORTING|MIGRATING|STABLE|NODE [node-id]",
-    "Bind a hash slot to a specific node",
-    12,
-    "3.0.0" },
-    { "CLUSTER SLAVES",
-    "node-id",
-    "List replica nodes of the specified master node",
-    12,
-    "3.0.0" },
-    { "CLUSTER SLOTS",
-    "-",
-    "Get array of Cluster slot to node mappings",
-    12,
-    "3.0.0" },
-    { "COMMAND",
-    "-",
-    "Get array of Redis command details",
-    9,
-    "2.8.13" },
-    { "COMMAND COUNT",
-    "-",
-    "Get total number of Redis commands",
-    9,
-    "2.8.13" },
-    { "COMMAND GETKEYS",
-    "-",
-    "Extract keys given a full Redis command",
-    9,
-    "2.8.13" },
-    { "COMMAND INFO",
-    "command-name [command-name ...]",
-    "Get array of specific Redis command details",
-    9,
-    "2.8.13" },
-    { "CONFIG GET",
-    "parameter",
-    "Get the value of a configuration parameter",
-    9,
-    "2.0.0" },
-    { "CONFIG RESETSTAT",
-    "-",
-    "Reset the stats returned by INFO",
-    9,
-    "2.0.0" },
-    { "CONFIG REWRITE",
-    "-",
-    "Rewrite the configuration file with the in memory configuration",
-    9,
-    "2.8.0" },
-    { "CONFIG SET",
-    "parameter value",
-    "Set a configuration parameter to the given value",
-    9,
-    "2.0.0" },
-    { "COPY",
-    "source destination [DB destination-db] [REPLACE]",
-    "Copy a key",
-    0,
-    "6.2.0" },
-    { "DBSIZE",
-    "-",
-    "Return the number of keys in the selected database",
-    9,
-    "1.0.0" },
-    { "DEBUG OBJECT",
-    "key",
-    "Get debugging information about a key",
-    9,
-    "1.0.0" },
-    { "DEBUG SEGFAULT",
-    "-",
-    "Make the server crash",
-    9,
-    "1.0.0" },
-    { "DECR",
-    "key",
-    "Decrement the integer value of a key by one",
-    1,
-    "1.0.0" },
-    { "DECRBY",
-    "key decrement",
-    "Decrement the integer value of a key by the given number",
-    1,
-    "1.0.0" },
-    { "DEL",
-    "key [key ...]",
-    "Delete a key",
-    0,
-    "1.0.0" },
-    { "DISCARD",
-    "-",
-    "Discard all commands issued after MULTI",
-    7,
-    "2.0.0" },
-    { "DUMP",
-    "key",
-    "Return a serialized version of the value stored at the specified key.",
-    0,
-    "2.6.0" },
-    { "ECHO",
-    "message",
-    "Echo the given string",
-    8,
-    "1.0.0" },
-    { "EVAL",
-    "script numkeys key [key ...] arg [arg ...]",
-    "Execute a Lua script server side",
-    10,
-    "2.6.0" },
-    { "EVALSHA",
-    "sha1 numkeys key [key ...] arg [arg ...]",
-    "Execute a Lua script server side",
-    10,
-    "2.6.0" },
-    { "EXEC",
-    "-",
-    "Execute all commands issued after MULTI",
-    7,
-    "1.2.0" },
-    { "EXISTS",
-    "key [key ...]",
-    "Determine if a key exists",
-    0,
-    "1.0.0" },
-    { "EXPIRE",
-    "key seconds",
-    "Set a key's time to live in seconds",
-    0,
-    "1.0.0" },
-    { "EXPIREAT",
-    "key timestamp",
-    "Set the expiration for a key as a UNIX timestamp",
-    0,
-    "1.2.0" },
-    { "FAILOVER",
-    "[TO host port [FORCE]] [ABORT] [TIMEOUT milliseconds]",
-    "Start a coordinated failover between this server and one of its replicas.",
-    9,
-    "6.2.0" },
-    { "FLUSHALL",
-    "[ASYNC|SYNC]",
-    "Remove all keys from all databases",
-    9,
-    "1.0.0" },
-    { "FLUSHDB",
-    "[ASYNC|SYNC]",
-    "Remove all keys from the current database",
-    9,
-    "1.0.0" },
-    { "GEOADD",
-    "key [NX|XX] [CH] longitude latitude member [longitude latitude member ...]",
-    "Add one or more geospatial items in the geospatial index represented using a sorted set",
-    13,
-    "3.2.0" },
-    { "GEODIST",
-    "key member1 member2 [m|km|ft|mi]",
-    "Returns the distance between two members of a geospatial index",
-    13,
-    "3.2.0" },
-    { "GEOHASH",
-    "key member [member ...]",
-    "Returns members of a geospatial index as standard geohash strings",
-    13,
-    "3.2.0" },
-    { "GEOPOS",
-    "key member [member ...]",
-    "Returns longitude and latitude of members of a geospatial index",
-    13,
-    "3.2.0" },
-    { "GEORADIUS",
-    "key longitude latitude radius m|km|ft|mi [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]",
-    "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point",
-    13,
-    "3.2.0" },
-    { "GEORADIUSBYMEMBER",
-    "key member radius m|km|ft|mi [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]",
-    "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member",
-    13,
-    "3.2.0" },
-    { "GEOSEARCH",
-    "key [FROMMEMBER member] [FROMLONLAT longitude latitude] [BYRADIUS radius m|km|ft|mi] [BYBOX width height m|km|ft|mi] [ASC|DESC] [COUNT count [ANY]] [WITHCOORD] [WITHDIST] [WITHHASH]",
-    "Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle.",
-    13,
-    "6.2" },
-    { "GEOSEARCHSTORE",
-    "destination source [FROMMEMBER member] [FROMLONLAT longitude latitude] [BYRADIUS radius m|km|ft|mi] [BYBOX width height m|km|ft|mi] [ASC|DESC] [COUNT count [ANY]] [WITHCOORD] [WITHDIST] [WITHHASH] [STOREDIST]",
-    "Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle, and store the result in another key.",
-    13,
-    "6.2" },
-    { "GET",
-    "key",
-    "Get the value of a key",
-    1,
-    "1.0.0" },
-    { "GETBIT",
-    "key offset",
-    "Returns the bit value at offset in the string value stored at key",
-    1,
-    "2.2.0" },
-    { "GETDEL",
-    "key",
-    "Get the value of a key and delete the key",
-    1,
-    "6.2.0" },
-    { "GETEX",
-    "key [EX seconds|PX milliseconds|EXAT timestamp|PXAT milliseconds-timestamp|PERSIST]",
-    "Get the value of a key and optionally set its expiration",
-    1,
-    "6.2.0" },
-    { "GETRANGE",
-    "key start end",
-    "Get a substring of the string stored at a key",
-    1,
-    "2.4.0" },
-    { "GETSET",
-    "key value",
-    "Set the string value of a key and return its old value",
-    1,
-    "1.0.0" },
-    { "HDEL",
-    "key field [field ...]",
-    "Delete one or more hash fields",
-    5,
-    "2.0.0" },
-    { "HELLO",
-    "[protover [AUTH username password] [SETNAME clientname]]",
-    "Handshake with Redis",
-    8,
-    "6.0.0" },
-    { "HEXISTS",
-    "key field",
-    "Determine if a hash field exists",
-    5,
-    "2.0.0" },
-    { "HGET",
-    "key field",
-    "Get the value of a hash field",
-    5,
-    "2.0.0" },
-    { "HGETALL",
-    "key",
-    "Get all the fields and values in a hash",
-    5,
-    "2.0.0" },
-    { "HINCRBY",
-    "key field increment",
-    "Increment the integer value of a hash field by the given number",
-    5,
-    "2.0.0" },
-    { "HINCRBYFLOAT",
-    "key field increment",
-    "Increment the float value of a hash field by the given amount",
-    5,
-    "2.6.0" },
-    { "HKEYS",
-    "key",
-    "Get all the fields in a hash",
-    5,
-    "2.0.0" },
-    { "HLEN",
-    "key",
-    "Get the number of fields in a hash",
-    5,
-    "2.0.0" },
-    { "HMGET",
-    "key field [field ...]",
-    "Get the values of all the given hash fields",
-    5,
-    "2.0.0" },
-    { "HMSET",
-    "key field value [field value ...]",
-    "Set multiple hash fields to multiple values",
-    5,
-    "2.0.0" },
-    { "HRANDFIELD",
-    "key [count [WITHVALUES]]",
-    "Get one or multiple random fields from a hash",
-    5,
-    "6.2.0" },
-    { "HSCAN",
-    "key cursor [MATCH pattern] [COUNT count]",
-    "Incrementally iterate hash fields and associated values",
-    5,
-    "2.8.0" },
-    { "HSET",
-    "key field value [field value ...]",
-    "Set the string value of a hash field",
-    5,
-    "2.0.0" },
-    { "HSETNX",
-    "key field value",
-    "Set the value of a hash field, only if the field does not exist",
-    5,
-    "2.0.0" },
-    { "HSTRLEN",
-    "key field",
-    "Get the length of the value of a hash field",
-    5,
-    "3.2.0" },
-    { "HVALS",
-    "key",
-    "Get all the values in a hash",
-    5,
-    "2.0.0" },
-    { "INCR",
-    "key",
-    "Increment the integer value of a key by one",
-    1,
-    "1.0.0" },
-    { "INCRBY",
-    "key increment",
-    "Increment the integer value of a key by the given amount",
-    1,
-    "1.0.0" },
-    { "INCRBYFLOAT",
-    "key increment",
-    "Increment the float value of a key by the given amount",
-    1,
-    "2.6.0" },
-    { "INFO",
-    "[section]",
-    "Get information and statistics about the server",
-    9,
-    "1.0.0" },
-    { "KEYS",
-    "pattern",
-    "Find all keys matching the given pattern",
-    0,
-    "1.0.0" },
-    { "LASTSAVE",
-    "-",
-    "Get the UNIX time stamp of the last successful save to disk",
-    9,
-    "1.0.0" },
-    { "LATENCY DOCTOR",
-    "-",
-    "Return a human readable latency analysis report.",
-    9,
-    "2.8.13" },
-    { "LATENCY GRAPH",
-    "event",
-    "Return a latency graph for the event.",
-    9,
-    "2.8.13" },
-    { "LATENCY HELP",
-    "-",
-    "Show helpful text about the different subcommands.",
-    9,
-    "2.8.13" },
-    { "LATENCY HISTORY",
-    "event",
-    "Return timestamp-latency samples for the event.",
-    9,
-    "2.8.13" },
-    { "LATENCY LATEST",
-    "-",
-    "Return the latest latency samples for all events.",
-    9,
-    "2.8.13" },
-    { "LATENCY RESET",
-    "[event [event ...]]",
-    "Reset latency data for one or more events.",
-    9,
-    "2.8.13" },
-    { "LINDEX",
-    "key index",
-    "Get an element from a list by its index",
-    2,
-    "1.0.0" },
-    { "LINSERT",
-    "key BEFORE|AFTER pivot element",
-    "Insert an element before or after another element in a list",
-    2,
-    "2.2.0" },
-    { "LLEN",
-    "key",
-    "Get the length of a list",
-    2,
-    "1.0.0" },
-    { "LMOVE",
-    "source destination LEFT|RIGHT LEFT|RIGHT",
-    "Pop an element from a list, push it to another list and return it",
-    2,
-    "6.2.0" },
-    { "LOLWUT",
-    "[VERSION version]",
-    "Display some computer art and the Redis version",
-    9,
-    "5.0.0" },
-    { "LPOP",
-    "key [count]",
-    "Remove and get the first elements in a list",
-    2,
-    "1.0.0" },
-    { "LPOS",
-    "key element [RANK rank] [COUNT num-matches] [MAXLEN len]",
-    "Return the index of matching elements on a list",
-    2,
-    "6.0.6" },
-    { "LPUSH",
-    "key element [element ...]",
-    "Prepend one or multiple elements to a list",
-    2,
-    "1.0.0" },
-    { "LPUSHX",
-    "key element [element ...]",
-    "Prepend an element to a list, only if the list exists",
-    2,
-    "2.2.0" },
-    { "LRANGE",
-    "key start stop",
-    "Get a range of elements from a list",
-    2,
-    "1.0.0" },
-    { "LREM",
-    "key count element",
-    "Remove elements from a list",
-    2,
-    "1.0.0" },
-    { "LSET",
-    "key index element",
-    "Set the value of an element in a list by its index",
-    2,
-    "1.0.0" },
-    { "LTRIM",
-    "key start stop",
-    "Trim a list to the specified range",
-    2,
-    "1.0.0" },
-    { "MEMORY DOCTOR",
-    "-",
-    "Outputs memory problems report",
-    9,
-    "4.0.0" },
-    { "MEMORY HELP",
-    "-",
-    "Show helpful text about the different subcommands",
-    9,
-    "4.0.0" },
-    { "MEMORY MALLOC-STATS",
-    "-",
-    "Show allocator internal stats",
-    9,
-    "4.0.0" },
-    { "MEMORY PURGE",
-    "-",
-    "Ask the allocator to release memory",
-    9,
-    "4.0.0" },
-    { "MEMORY STATS",
-    "-",
-    "Show memory usage details",
-    9,
-    "4.0.0" },
-    { "MEMORY USAGE",
-    "key [SAMPLES count]",
-    "Estimate the memory usage of a key",
-    9,
-    "4.0.0" },
-    { "MGET",
-    "key [key ...]",
-    "Get the values of all the given keys",
-    1,
-    "1.0.0" },
-    { "MIGRATE",
-    "host port key|"" destination-db timeout [COPY] [REPLACE] [AUTH password] [AUTH2 username password] [KEYS key]",
-    "Atomically transfer a key from a Redis instance to another one.",
-    0,
-    "2.6.0" },
-    { "MODULE LIST",
-    "-",
-    "List all modules loaded by the server",
-    9,
-    "4.0.0" },
-    { "MODULE LOAD",
-    "path [arg]",
-    "Load a module",
-    9,
-    "4.0.0" },
-    { "MODULE UNLOAD",
-    "name",
-    "Unload a module",
-    9,
-    "4.0.0" },
-    { "MONITOR",
-    "-",
-    "Listen for all requests received by the server in real time",
-    9,
-    "1.0.0" },
-    { "MOVE",
-    "key db",
-    "Move a key to another database",
-    0,
-    "1.0.0" },
-    { "MSET",
-    "key value [key value ...]",
-    "Set multiple keys to multiple values",
-    1,
-    "1.0.1" },
-    { "MSETNX",
-    "key value [key value ...]",
-    "Set multiple keys to multiple values, only if none of the keys exist",
-    1,
-    "1.0.1" },
-    { "MULTI",
-    "-",
-    "Mark the start of a transaction block",
-    7,
-    "1.2.0" },
-    { "OBJECT",
-    "subcommand [arguments [arguments ...]]",
-    "Inspect the internals of Redis objects",
-    0,
-    "2.2.3" },
-    { "PERSIST",
-    "key",
-    "Remove the expiration from a key",
-    0,
-    "2.2.0" },
-    { "PEXPIRE",
-    "key milliseconds",
-    "Set a key's time to live in milliseconds",
-    0,
-    "2.6.0" },
-    { "PEXPIREAT",
-    "key milliseconds-timestamp",
-    "Set the expiration for a key as a UNIX timestamp specified in milliseconds",
-    0,
-    "2.6.0" },
-    { "PFADD",
-    "key element [element ...]",
-    "Adds the specified elements to the specified HyperLogLog.",
-    11,
-    "2.8.9" },
-    { "PFCOUNT",
-    "key [key ...]",
-    "Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).",
-    11,
-    "2.8.9" },
-    { "PFMERGE",
-    "destkey sourcekey [sourcekey ...]",
-    "Merge N different HyperLogLogs into a single one.",
-    11,
-    "2.8.9" },
-    { "PING",
-    "[message]",
-    "Ping the server",
-    8,
-    "1.0.0" },
-    { "PSETEX",
-    "key milliseconds value",
-    "Set the value and expiration in milliseconds of a key",
-    1,
-    "2.6.0" },
-    { "PSUBSCRIBE",
-    "pattern [pattern ...]",
-    "Listen for messages published to channels matching the given patterns",
-    6,
-    "2.0.0" },
-    { "PSYNC",
-    "replicationid offset",
-    "Internal command used for replication",
-    9,
-    "2.8.0" },
-    { "PTTL",
-    "key",
-    "Get the time to live for a key in milliseconds",
-    0,
-    "2.6.0" },
-    { "PUBLISH",
-    "channel message",
-    "Post a message to a channel",
-    6,
-    "2.0.0" },
-    { "PUBSUB",
-    "subcommand [argument [argument ...]]",
-    "Inspect the state of the Pub/Sub subsystem",
-    6,
-    "2.8.0" },
-    { "PUNSUBSCRIBE",
-    "[pattern [pattern ...]]",
-    "Stop listening for messages posted to channels matching the given patterns",
-    6,
-    "2.0.0" },
-    { "QUIT",
-    "-",
-    "Close the connection",
-    8,
-    "1.0.0" },
-    { "RANDOMKEY",
-    "-",
-    "Return a random key from the keyspace",
-    0,
-    "1.0.0" },
-    { "READONLY",
-    "-",
-    "Enables read queries for a connection to a cluster replica node",
-    12,
-    "3.0.0" },
-    { "READWRITE",
-    "-",
-    "Disables read queries for a connection to a cluster replica node",
-    12,
-    "3.0.0" },
-    { "RENAME",
-    "key newkey",
-    "Rename a key",
-    0,
-    "1.0.0" },
-    { "RENAMENX",
-    "key newkey",
-    "Rename a key, only if the new key does not exist",
-    0,
-    "1.0.0" },
-    { "REPLICAOF",
-    "host port",
-    "Make the server a replica of another instance, or promote it as master.",
-    9,
-    "5.0.0" },
-    { "RESET",
-    "-",
-    "Reset the connection",
-    8,
-    "6.2" },
-    { "RESTORE",
-    "key ttl serialized-value [REPLACE] [ABSTTL] [IDLETIME seconds] [FREQ frequency]",
-    "Create a key using the provided serialized value, previously obtained using DUMP.",
-    0,
-    "2.6.0" },
-    { "ROLE",
-    "-",
-    "Return the role of the instance in the context of replication",
-    9,
-    "2.8.12" },
-    { "RPOP",
-    "key [count]",
-    "Remove and get the last elements in a list",
-    2,
-    "1.0.0" },
-    { "RPOPLPUSH",
-    "source destination",
-    "Remove the last element in a list, prepend it to another list and return it",
-    2,
-    "1.2.0" },
-    { "RPUSH",
-    "key element [element ...]",
-    "Append one or multiple elements to a list",
-    2,
-    "1.0.0" },
-    { "RPUSHX",
-    "key element [element ...]",
-    "Append an element to a list, only if the list exists",
-    2,
-    "2.2.0" },
-    { "SADD",
-    "key member [member ...]",
-    "Add one or more members to a set",
-    3,
-    "1.0.0" },
-    { "SAVE",
-    "-",
-    "Synchronously save the dataset to disk",
-    9,
-    "1.0.0" },
-    { "SCAN",
-    "cursor [MATCH pattern] [COUNT count] [TYPE type]",
-    "Incrementally iterate the keys space",
-    0,
-    "2.8.0" },
-    { "SCARD",
-    "key",
-    "Get the number of members in a set",
-    3,
-    "1.0.0" },
-    { "SCRIPT DEBUG",
-    "YES|SYNC|NO",
-    "Set the debug mode for executed scripts.",
-    10,
-    "3.2.0" },
-    { "SCRIPT EXISTS",
-    "sha1 [sha1 ...]",
-    "Check existence of scripts in the script cache.",
-    10,
-    "2.6.0" },
-    { "SCRIPT FLUSH",
-    "[ASYNC|SYNC]",
-    "Remove all the scripts from the script cache.",
-    10,
-    "2.6.0" },
-    { "SCRIPT KILL",
-    "-",
-    "Kill the script currently in execution.",
-    10,
-    "2.6.0" },
-    { "SCRIPT LOAD",
-    "script",
-    "Load the specified Lua script into the script cache.",
-    10,
-    "2.6.0" },
-    { "SDIFF",
-    "key [key ...]",
-    "Subtract multiple sets",
-    3,
-    "1.0.0" },
-    { "SDIFFSTORE",
-    "destination key [key ...]",
-    "Subtract multiple sets and store the resulting set in a key",
-    3,
-    "1.0.0" },
-    { "SELECT",
-    "index",
-    "Change the selected database for the current connection",
-    8,
-    "1.0.0" },
-    { "SET",
-    "key value [EX seconds|PX milliseconds|EXAT timestamp|PXAT milliseconds-timestamp|KEEPTTL] [NX|XX] [GET]",
-    "Set the string value of a key",
-    1,
-    "1.0.0" },
-    { "SETBIT",
-    "key offset value",
-    "Sets or clears the bit at offset in the string value stored at key",
-    1,
-    "2.2.0" },
-    { "SETEX",
-    "key seconds value",
-    "Set the value and expiration of a key",
-    1,
-    "2.0.0" },
-    { "SETNX",
-    "key value",
-    "Set the value of a key, only if the key does not exist",
-    1,
-    "1.0.0" },
-    { "SETRANGE",
-    "key offset value",
-    "Overwrite part of a string at key starting at the specified offset",
-    1,
-    "2.2.0" },
-    { "SHUTDOWN",
-    "[NOSAVE|SAVE]",
-    "Synchronously save the dataset to disk and then shut down the server",
-    9,
-    "1.0.0" },
-    { "SINTER",
-    "key [key ...]",
-    "Intersect multiple sets",
-    3,
-    "1.0.0" },
-    { "SINTERSTORE",
-    "destination key [key ...]",
-    "Intersect multiple sets and store the resulting set in a key",
-    3,
-    "1.0.0" },
-    { "SISMEMBER",
-    "key member",
-    "Determine if a given value is a member of a set",
-    3,
-    "1.0.0" },
-    { "SLAVEOF",
-    "host port",
-    "Make the server a replica of another instance, or promote it as master. Deprecated starting with Redis 5. Use REPLICAOF instead.",
-    9,
-    "1.0.0" },
-    { "SLOWLOG",
-    "subcommand [argument]",
-    "Manages the Redis slow queries log",
-    9,
-    "2.2.12" },
-    { "SMEMBERS",
-    "key",
-    "Get all the members in a set",
-    3,
-    "1.0.0" },
-    { "SMISMEMBER",
-    "key member [member ...]",
-    "Returns the membership associated with the given elements for a set",
-    3,
-    "6.2.0" },
-    { "SMOVE",
-    "source destination member",
-    "Move a member from one set to another",
-    3,
-    "1.0.0" },
-    { "SORT",
-    "key [BY pattern] [LIMIT offset count] [GET pattern [GET pattern ...]] [ASC|DESC] [ALPHA] [STORE destination]",
-    "Sort the elements in a list, set or sorted set",
-    0,
-    "1.0.0" },
-    { "SPOP",
-    "key [count]",
-    "Remove and return one or multiple random members from a set",
-    3,
-    "1.0.0" },
-    { "SRANDMEMBER",
-    "key [count]",
-    "Get one or multiple random members from a set",
-    3,
-    "1.0.0" },
-    { "SREM",
-    "key member [member ...]",
-    "Remove one or more members from a set",
-    3,
-    "1.0.0" },
-    { "SSCAN",
-    "key cursor [MATCH pattern] [COUNT count]",
-    "Incrementally iterate Set elements",
-    3,
-    "2.8.0" },
-    { "STRALGO",
-    "LCS algo-specific-argument [algo-specific-argument ...]",
-    "Run algorithms (currently LCS) against strings",
-    1,
-    "6.0.0" },
-    { "STRLEN",
-    "key",
-    "Get the length of the value stored in a key",
-    1,
-    "2.2.0" },
-    { "SUBSCRIBE",
-    "channel [channel ...]",
-    "Listen for messages published to the given channels",
-    6,
-    "2.0.0" },
-    { "SUNION",
-    "key [key ...]",
-    "Add multiple sets",
-    3,
-    "1.0.0" },
-    { "SUNIONSTORE",
-    "destination key [key ...]",
-    "Add multiple sets and store the resulting set in a key",
-    3,
-    "1.0.0" },
-    { "SWAPDB",
-    "index1 index2",
-    "Swaps two Redis databases",
-    9,
-    "4.0.0" },
-    { "SYNC",
-    "-",
-    "Internal command used for replication",
-    9,
-    "1.0.0" },
-    { "TIME",
-    "-",
-    "Return the current server time",
-    9,
-    "2.6.0" },
-    { "TOUCH",
-    "key [key ...]",
-    "Alters the last access time of a key(s). Returns the number of existing keys specified.",
-    0,
-    "3.2.1" },
-    { "TTL",
-    "key",
-    "Get the time to live for a key",
-    0,
-    "1.0.0" },
-    { "TYPE",
-    "key",
-    "Determine the type stored at key",
-    0,
-    "1.0.0" },
-    { "UNLINK",
-    "key [key ...]",
-    "Delete a key asynchronously in another thread. Otherwise it is just as DEL, but non blocking.",
-    0,
-    "4.0.0" },
-    { "UNSUBSCRIBE",
-    "[channel [channel ...]]",
-    "Stop listening for messages posted to the given channels",
-    6,
-    "2.0.0" },
-    { "UNWATCH",
-    "-",
-    "Forget about all watched keys",
-    7,
-    "2.2.0" },
-    { "WAIT",
-    "numreplicas timeout",
-    "Wait for the synchronous replication of all the write commands sent in the context of the current connection",
-    0,
-    "3.0.0" },
-    { "WATCH",
-    "key [key ...]",
-    "Watch the given keys to determine execution of the MULTI/EXEC block",
-    7,
-    "2.2.0" },
-    { "XACK",
-    "key group ID [ID ...]",
-    "Marks a pending message as correctly processed, effectively removing it from the pending entries list of the consumer group. Return value of the command is the number of messages successfully acknowledged, that is, the IDs we were actually able to resolve in the PEL.",
-    14,
-    "5.0.0" },
-    { "XADD",
-    "key [NOMKSTREAM] [MAXLEN|MINID [=|~] threshold [LIMIT count]] *|ID field value [field value ...]",
-    "Appends a new entry to a stream",
-    14,
-    "5.0.0" },
-    { "XAUTOCLAIM",
-    "key group consumer min-idle-time start [COUNT count] [justid]",
-    "Changes (or acquires) ownership of messages in a consumer group, as if the messages were delivered to the specified consumer.",
-    14,
-    "6.2.0" },
-    { "XCLAIM",
-    "key group consumer min-idle-time ID [ID ...] [IDLE ms] [TIME ms-unix-time] [RETRYCOUNT count] [force] [justid]",
-    "Changes (or acquires) ownership of a message in a consumer group, as if the message was delivered to the specified consumer.",
-    14,
-    "5.0.0" },
-    { "XDEL",
-    "key ID [ID ...]",
-    "Removes the specified entries from the stream. Returns the number of items actually deleted, that may be different from the number of IDs passed in case certain IDs do not exist.",
-    14,
-    "5.0.0" },
-    { "XGROUP",
-    "[CREATE key groupname ID|$ [MKSTREAM]] [SETID key groupname ID|$] [DESTROY key groupname] [CREATECONSUMER key groupname consumername] [DELCONSUMER key groupname consumername]",
-    "Create, destroy, and manage consumer groups.",
-    14,
-    "5.0.0" },
-    { "XINFO",
-    "[CONSUMERS key groupname] [GROUPS key] [STREAM key] [HELP]",
-    "Get information on streams and consumer groups",
-    14,
-    "5.0.0" },
-    { "XLEN",
-    "key",
-    "Return the number of entries in a stream",
-    14,
-    "5.0.0" },
-    { "XPENDING",
-    "key group [[IDLE min-idle-time] start end count [consumer]]",
-    "Return information and entries from a stream consumer group pending entries list, that are messages fetched but never acknowledged.",
-    14,
-    "5.0.0" },
-    { "XRANGE",
-    "key start end [COUNT count]",
-    "Return a range of elements in a stream, with IDs matching the specified IDs interval",
-    14,
-    "5.0.0" },
-    { "XREAD",
-    "[COUNT count] [BLOCK milliseconds] STREAMS key [key ...] ID [ID ...]",
-    "Return never seen elements in multiple streams, with IDs greater than the ones reported by the caller for each stream. Can block.",
-    14,
-    "5.0.0" },
-    { "XREADGROUP",
-    "GROUP group consumer [COUNT count] [BLOCK milliseconds] [NOACK] STREAMS key [key ...] ID [ID ...]",
-    "Return new entries from a stream using a consumer group, or access the history of the pending entries for a given consumer. Can block.",
-    14,
-    "5.0.0" },
-    { "XREVRANGE",
-    "key end start [COUNT count]",
-    "Return a range of elements in a stream, with IDs matching the specified IDs interval, in reverse order (from greater to smaller IDs) compared to XRANGE",
-    14,
-    "5.0.0" },
-    { "XTRIM",
-    "key MAXLEN|MINID [=|~] threshold [LIMIT count]",
-    "Trims the stream to (approximately if '~' is passed) a certain size",
-    14,
-    "5.0.0" },
-    { "ZADD",
-    "key [NX|XX] [GT|LT] [CH] [INCR] score member [score member ...]",
-    "Add one or more members to a sorted set, or update its score if it already exists",
-    4,
-    "1.2.0" },
-    { "ZCARD",
-    "key",
-    "Get the number of members in a sorted set",
-    4,
-    "1.2.0" },
-    { "ZCOUNT",
-    "key min max",
-    "Count the members in a sorted set with scores within the given values",
-    4,
-    "2.0.0" },
-    { "ZDIFF",
-    "numkeys key [key ...] [WITHSCORES]",
-    "Subtract multiple sorted sets",
-    4,
-    "6.2.0" },
-    { "ZDIFFSTORE",
-    "destination numkeys key [key ...]",
-    "Subtract multiple sorted sets and store the resulting sorted set in a new key",
-    4,
-    "6.2.0" },
-    { "ZINCRBY",
-    "key increment member",
-    "Increment the score of a member in a sorted set",
-    4,
-    "1.2.0" },
-    { "ZINTER",
-    "numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX] [WITHSCORES]",
-    "Intersect multiple sorted sets",
-    4,
-    "6.2.0" },
-    { "ZINTERSTORE",
-    "destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]",
-    "Intersect multiple sorted sets and store the resulting sorted set in a new key",
-    4,
-    "2.0.0" },
-    { "ZLEXCOUNT",
-    "key min max",
-    "Count the number of members in a sorted set between a given lexicographical range",
-    4,
-    "2.8.9" },
-    { "ZMSCORE",
-    "key member [member ...]",
-    "Get the score associated with the given members in a sorted set",
-    4,
-    "6.2.0" },
-    { "ZPOPMAX",
-    "key [count]",
-    "Remove and return members with the highest scores in a sorted set",
-    4,
-    "5.0.0" },
-    { "ZPOPMIN",
-    "key [count]",
-    "Remove and return members with the lowest scores in a sorted set",
-    4,
-    "5.0.0" },
-    { "ZRANDMEMBER",
-    "key [count [WITHSCORES]]",
-    "Get one or multiple random elements from a sorted set",
-    4,
-    "6.2.0" },
-    { "ZRANGE",
-    "key min max [BYSCORE|BYLEX] [REV] [LIMIT offset count] [WITHSCORES]",
-    "Return a range of members in a sorted set",
-    4,
-    "1.2.0" },
-    { "ZRANGEBYLEX",
-    "key min max [LIMIT offset count]",
-    "Return a range of members in a sorted set, by lexicographical range",
-    4,
-    "2.8.9" },
-    { "ZRANGEBYSCORE",
-    "key min max [WITHSCORES] [LIMIT offset count]",
-    "Return a range of members in a sorted set, by score",
-    4,
-    "1.0.5" },
-    { "ZRANGESTORE",
-    "dst src min max [BYSCORE|BYLEX] [REV] [LIMIT offset count]",
-    "Store a range of members from sorted set into another key",
-    4,
-    "6.2.0" },
-    { "ZRANK",
-    "key member",
-    "Determine the index of a member in a sorted set",
-    4,
-    "2.0.0" },
-    { "ZREM",
-    "key member [member ...]",
-    "Remove one or more members from a sorted set",
-    4,
-    "1.2.0" },
-    { "ZREMRANGEBYLEX",
-    "key min max",
-    "Remove all members in a sorted set between the given lexicographical range",
-    4,
-    "2.8.9" },
-    { "ZREMRANGEBYRANK",
-    "key start stop",
-    "Remove all members in a sorted set within the given indexes",
-    4,
-    "2.0.0" },
-    { "ZREMRANGEBYSCORE",
-    "key min max",
-    "Remove all members in a sorted set within the given scores",
-    4,
-    "1.2.0" },
-    { "ZREVRANGE",
-    "key start stop [WITHSCORES]",
-    "Return a range of members in a sorted set, by index, with scores ordered from high to low",
-    4,
-    "1.2.0" },
-    { "ZREVRANGEBYLEX",
-    "key max min [LIMIT offset count]",
-    "Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.",
-    4,
-    "2.8.9" },
-    { "ZREVRANGEBYSCORE",
-    "key max min [WITHSCORES] [LIMIT offset count]",
-    "Return a range of members in a sorted set, by score, with scores ordered from high to low",
-    4,
-    "2.2.0" },
-    { "ZREVRANK",
-    "key member",
-    "Determine the index of a member in a sorted set, with scores ordered from high to low",
-    4,
-    "2.0.0" },
-    { "ZSCAN",
-    "key cursor [MATCH pattern] [COUNT count]",
-    "Incrementally iterate sorted sets elements and associated scores",
-    4,
-    "2.8.0" },
-    { "ZSCORE",
-    "key member",
-    "Get the score associated with the given member in a sorted set",
-    4,
-    "1.2.0" },
-    { "ZUNION",
-    "numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX] [WITHSCORES]",
-    "Add multiple sorted sets",
-    4,
-    "6.2.0" },
-    { "ZUNIONSTORE",
-    "destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]",
-    "Add multiple sorted sets and store the resulting sorted set in a new key",
-    4,
-    "2.0.0" }
-};
-
-#endif
diff --git a/redis-stable/src/hyperloglog.c b/redis-stable/src/hyperloglog.c
deleted file mode 100644
index 75a04227..00000000
--- a/redis-stable/src/hyperloglog.c
+++ /dev/null
@@ -1,1595 +0,0 @@
-/* hyperloglog.c - Redis HyperLogLog probabilistic cardinality approximation.
- * This file implements the algorithm and the exported Redis commands.
- *
- * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-#include <stdint.h>
-#include <math.h>
-
-/* The Redis HyperLogLog implementation is based on the following ideas:
- *
- * * The use of a 64 bit hash function as proposed in [1], in order to estimate
- *   cardinalities larger than 10^9, at the cost of just 1 additional bit per
- *   register.
- * * The use of 16384 6-bit registers for a great level of accuracy, using
- *   a total of 12k per key.
- * * The use of the Redis string data type. No new type is introduced.
- * * No attempt is made to compress the data structure as in [1]. Also the
- *   algorithm used is the original HyperLogLog Algorithm as in [2], with
- *   the only difference that a 64 bit hash function is used, so no correction
- *   is performed for values near 2^32 as in [1].
- *
- * [1] Heule, Nunkesser, Hall: HyperLogLog in Practice: Algorithmic
- *     Engineering of a State of The Art Cardinality Estimation Algorithm.
- *
- * [2] P. Flajolet, Éric Fusy, O. Gandouet, and F. Meunier. Hyperloglog: The
- *     analysis of a near-optimal cardinality estimation algorithm.
- *
- * Redis uses two representations:
- *
- * 1) A "dense" representation where every entry is represented by
- *    a 6-bit integer.
- * 2) A "sparse" representation using run length compression suitable
- *    for representing HyperLogLogs with many registers set to 0 in
- *    a memory efficient way.
- *
- *
- * HLL header
- * ===
- *
- * Both the dense and sparse representation have a 16 byte header as follows:
- *
- * +------+---+-----+----------+
- * | HYLL | E | N/U | Cardin.  |
- * +------+---+-----+----------+
- *
- * The first 4 bytes are a magic string set to the bytes "HYLL".
- * "E" is one byte encoding, currently set to HLL_DENSE or
- * HLL_SPARSE. N/U are three not used bytes.
- *
- * The "Cardin." field is a 64 bit integer stored in little endian format
- * with the latest cardinality computed that can be reused if the data
- * structure was not modified since the last computation (this is useful
- * because there are high probabilities that HLLADD operations don't
- * modify the actual data structure and hence the approximated cardinality).
- *
- * When the most significant bit in the most significant byte of the cached
- * cardinality is set, it means that the data structure was modified and
- * we can't reuse the cached value that must be recomputed.
- *
- * Dense representation
- * ===
- *
- * The dense representation used by Redis is the following:
- *
- * +--------+--------+--------+------//      //--+
- * |11000000|22221111|33333322|55444444 ....     |
- * +--------+--------+--------+------//      //--+
- *
- * The 6 bits counters are encoded one after the other starting from the
- * LSB to the MSB, and using the next bytes as needed.
- *
- * Sparse representation
- * ===
- *
- * The sparse representation encodes registers using a run length
- * encoding composed of three opcodes, two using one byte, and one using
- * of two bytes. The opcodes are called ZERO, XZERO and VAL.
- *
- * ZERO opcode is represented as 00xxxxxx. The 6-bit integer represented
- * by the six bits 'xxxxxx', plus 1, means that there are N registers set
- * to 0. This opcode can represent from 1 to 64 contiguous registers set
- * to the value of 0.
- *
- * XZERO opcode is represented by two bytes 01xxxxxx yyyyyyyy. The 14-bit
- * integer represented by the bits 'xxxxxx' as most significant bits and
- * 'yyyyyyyy' as least significant bits, plus 1, means that there are N
- * registers set to 0. This opcode can represent from 0 to 16384 contiguous
- * registers set to the value of 0.
- *
- * VAL opcode is represented as 1vvvvvxx. It contains a 5-bit integer
- * representing the value of a register, and a 2-bit integer representing
- * the number of contiguous registers set to that value 'vvvvv'.
- * To obtain the value and run length, the integers vvvvv and xx must be
- * incremented by one. This opcode can represent values from 1 to 32,
- * repeated from 1 to 4 times.
- *
- * The sparse representation can't represent registers with a value greater
- * than 32, however it is very unlikely that we find such a register in an
- * HLL with a cardinality where the sparse representation is still more
- * memory efficient than the dense representation. When this happens the
- * HLL is converted to the dense representation.
- *
- * The sparse representation is purely positional. For example a sparse
- * representation of an empty HLL is just: XZERO:16384.
- *
- * An HLL having only 3 non-zero registers at position 1000, 1020, 1021
- * respectively set to 2, 3, 3, is represented by the following three
- * opcodes:
- *
- * XZERO:1000 (Registers 0-999 are set to 0)
- * VAL:2,1    (1 register set to value 2, that is register 1000)
- * ZERO:19    (Registers 1001-1019 set to 0)
- * VAL:3,2    (2 registers set to value 3, that is registers 1020,1021)
- * XZERO:15362 (Registers 1022-16383 set to 0)
- *
- * In the example the sparse representation used just 7 bytes instead
- * of 12k in order to represent the HLL registers. In general for low
- * cardinality there is a big win in terms of space efficiency, traded
- * with CPU time since the sparse representation is slower to access:
- *
- * The following table shows average cardinality vs bytes used, 100
- * samples per cardinality (when the set was not representable because
- * of registers with too big value, the dense representation size was used
- * as a sample).
- *
- * 100 267
- * 200 485
- * 300 678
- * 400 859
- * 500 1033
- * 600 1205
- * 700 1375
- * 800 1544
- * 900 1713
- * 1000 1882
- * 2000 3480
- * 3000 4879
- * 4000 6089
- * 5000 7138
- * 6000 8042
- * 7000 8823
- * 8000 9500
- * 9000 10088
- * 10000 10591
- *
- * The dense representation uses 12288 bytes, so there is a big win up to
- * a cardinality of ~2000-3000. For bigger cardinalities the constant times
- * involved in updating the sparse representation is not justified by the
- * memory savings. The exact maximum length of the sparse representation
- * when this implementation switches to the dense representation is
- * configured via the define server.hll_sparse_max_bytes.
- */
-
-struct hllhdr {
-    char magic[4];      /* "HYLL" */
-    uint8_t encoding;   /* HLL_DENSE or HLL_SPARSE. */
-    uint8_t notused[3]; /* Reserved for future use, must be zero. */
-    uint8_t card[8];    /* Cached cardinality, little endian. */
-    uint8_t registers[]; /* Data bytes. */
-};
-
-/* The cached cardinality MSB is used to signal validity of the cached value. */
-#define HLL_INVALIDATE_CACHE(hdr) (hdr)->card[7] |= (1<<7)
-#define HLL_VALID_CACHE(hdr) (((hdr)->card[7] & (1<<7)) == 0)
-
-#define HLL_P 14 /* The greater is P, the smaller the error. */
-#define HLL_Q (64-HLL_P) /* The number of bits of the hash value used for
-                            determining the number of leading zeros. */
-#define HLL_REGISTERS (1<<HLL_P) /* With P=14, 16384 registers. */
-#define HLL_P_MASK (HLL_REGISTERS-1) /* Mask to index register. */
-#define HLL_BITS 6 /* Enough to count up to 63 leading zeroes. */
-#define HLL_REGISTER_MAX ((1<<HLL_BITS)-1)
-#define HLL_HDR_SIZE sizeof(struct hllhdr)
-#define HLL_DENSE_SIZE (HLL_HDR_SIZE+((HLL_REGISTERS*HLL_BITS+7)/8))
-#define HLL_DENSE 0 /* Dense encoding. */
-#define HLL_SPARSE 1 /* Sparse encoding. */
-#define HLL_RAW 255 /* Only used internally, never exposed. */
-#define HLL_MAX_ENCODING 1
-
-static char *invalid_hll_err = "-INVALIDOBJ Corrupted HLL object detected";
-
-/* =========================== Low level bit macros ========================= */
-
-/* Macros to access the dense representation.
- *
- * We need to get and set 6 bit counters in an array of 8 bit bytes.
- * We use macros to make sure the code is inlined since speed is critical
- * especially in order to compute the approximated cardinality in
- * HLLCOUNT where we need to access all the registers at once.
- * For the same reason we also want to avoid conditionals in this code path.
- *
- * +--------+--------+--------+------//
- * |11000000|22221111|33333322|55444444
- * +--------+--------+--------+------//
- *
- * Note: in the above representation the most significant bit (MSB)
- * of every byte is on the left. We start using bits from the LSB to MSB,
- * and so forth passing to the next byte.
- *
- * Example, we want to access to counter at pos = 1 ("111111" in the
- * illustration above).
- *
- * The index of the first byte b0 containing our data is:
- *
- *  b0 = 6 * pos / 8 = 0
- *
- *   +--------+
- *   |11000000|  <- Our byte at b0
- *   +--------+
- *
- * The position of the first bit (counting from the LSB = 0) in the byte
- * is given by:
- *
- *  fb = 6 * pos % 8 -> 6
- *
- * Right shift b0 of 'fb' bits.
- *
- *   +--------+
- *   |11000000|  <- Initial value of b0
- *   |00000011|  <- After right shift of 6 pos.
- *   +--------+
- *
- * Left shift b1 of bits 8-fb bits (2 bits)
- *
- *   +--------+
- *   |22221111|  <- Initial value of b1
- *   |22111100|  <- After left shift of 2 bits.
- *   +--------+
- *
- * OR the two bits, and finally AND with 111111 (63 in decimal) to
- * clean the higher order bits we are not interested in:
- *
- *   +--------+
- *   |00000011|  <- b0 right shifted
- *   |22111100|  <- b1 left shifted
- *   |22111111|  <- b0 OR b1
- *   |  111111|  <- (b0 OR b1) AND 63, our value.
- *   +--------+
- *
- * We can try with a different example, like pos = 0. In this case
- * the 6-bit counter is actually contained in a single byte.
- *
- *  b0 = 6 * pos / 8 = 0
- *
- *   +--------+
- *   |11000000|  <- Our byte at b0
- *   +--------+
- *
- *  fb = 6 * pos % 8 = 0
- *
- *  So we right shift of 0 bits (no shift in practice) and
- *  left shift the next byte of 8 bits, even if we don't use it,
- *  but this has the effect of clearing the bits so the result
- *  will not be affected after the OR.
- *
- * -------------------------------------------------------------------------
- *
- * Setting the register is a bit more complex, let's assume that 'val'
- * is the value we want to set, already in the right range.
- *
- * We need two steps, in one we need to clear the bits, and in the other
- * we need to bitwise-OR the new bits.
- *
- * Let's try with 'pos' = 1, so our first byte at 'b' is 0,
- *
- * "fb" is 6 in this case.
- *
- *   +--------+
- *   |11000000|  <- Our byte at b0
- *   +--------+
- *
- * To create an AND-mask to clear the bits about this position, we just
- * initialize the mask with the value 63, left shift it of "fs" bits,
- * and finally invert the result.
- *
- *   +--------+
- *   |00111111|  <- "mask" starts at 63
- *   |11000000|  <- "mask" after left shift of "ls" bits.
- *   |00111111|  <- "mask" after invert.
- *   +--------+
- *
- * Now we can bitwise-AND the byte at "b" with the mask, and bitwise-OR
- * it with "val" left-shifted of "ls" bits to set the new bits.
- *
- * Now let's focus on the next byte b1:
- *
- *   +--------+
- *   |22221111|  <- Initial value of b1
- *   +--------+
- *
- * To build the AND mask we start again with the 63 value, right shift
- * it by 8-fb bits, and invert it.
- *
- *   +--------+
- *   |00111111|  <- "mask" set at 2&6-1
- *   |00001111|  <- "mask" after the right shift by 8-fb = 2 bits
- *   |11110000|  <- "mask" after bitwise not.
- *   +--------+
- *
- * Now we can mask it with b+1 to clear the old bits, and bitwise-OR
- * with "val" left-shifted by "rs" bits to set the new value.
- */
-
-/* Note: if we access the last counter, we will also access the b+1 byte
- * that is out of the array, but sds strings always have an implicit null
- * term, so the byte exists, and we can skip the conditional (or the need
- * to allocate 1 byte more explicitly). */
-
-/* Store the value of the register at position 'regnum' into variable 'target'.
- * 'p' is an array of unsigned bytes. */
-#define HLL_DENSE_GET_REGISTER(target,p,regnum) do { \
-    uint8_t *_p = (uint8_t*) p; \
-    unsigned long _byte = regnum*HLL_BITS/8; \
-    unsigned long _fb = regnum*HLL_BITS&7; \
-    unsigned long _fb8 = 8 - _fb; \
-    unsigned long b0 = _p[_byte]; \
-    unsigned long b1 = _p[_byte+1]; \
-    target = ((b0 >> _fb) | (b1 << _fb8)) & HLL_REGISTER_MAX; \
-} while(0)
-
-/* Set the value of the register at position 'regnum' to 'val'.
- * 'p' is an array of unsigned bytes. */
-#define HLL_DENSE_SET_REGISTER(p,regnum,val) do { \
-    uint8_t *_p = (uint8_t*) p; \
-    unsigned long _byte = regnum*HLL_BITS/8; \
-    unsigned long _fb = regnum*HLL_BITS&7; \
-    unsigned long _fb8 = 8 - _fb; \
-    unsigned long _v = val; \
-    _p[_byte] &= ~(HLL_REGISTER_MAX << _fb); \
-    _p[_byte] |= _v << _fb; \
-    _p[_byte+1] &= ~(HLL_REGISTER_MAX >> _fb8); \
-    _p[_byte+1] |= _v >> _fb8; \
-} while(0)
-
-/* Macros to access the sparse representation.
- * The macros parameter is expected to be an uint8_t pointer. */
-#define HLL_SPARSE_XZERO_BIT 0x40 /* 01xxxxxx */
-#define HLL_SPARSE_VAL_BIT 0x80 /* 1vvvvvxx */
-#define HLL_SPARSE_IS_ZERO(p) (((*(p)) & 0xc0) == 0) /* 00xxxxxx */
-#define HLL_SPARSE_IS_XZERO(p) (((*(p)) & 0xc0) == HLL_SPARSE_XZERO_BIT)
-#define HLL_SPARSE_IS_VAL(p) ((*(p)) & HLL_SPARSE_VAL_BIT)
-#define HLL_SPARSE_ZERO_LEN(p) (((*(p)) & 0x3f)+1)
-#define HLL_SPARSE_XZERO_LEN(p) (((((*(p)) & 0x3f) << 8) | (*((p)+1)))+1)
-#define HLL_SPARSE_VAL_VALUE(p) ((((*(p)) >> 2) & 0x1f)+1)
-#define HLL_SPARSE_VAL_LEN(p) (((*(p)) & 0x3)+1)
-#define HLL_SPARSE_VAL_MAX_VALUE 32
-#define HLL_SPARSE_VAL_MAX_LEN 4
-#define HLL_SPARSE_ZERO_MAX_LEN 64
-#define HLL_SPARSE_XZERO_MAX_LEN 16384
-#define HLL_SPARSE_VAL_SET(p,val,len) do { \
-    *(p) = (((val)-1)<<2|((len)-1))|HLL_SPARSE_VAL_BIT; \
-} while(0)
-#define HLL_SPARSE_ZERO_SET(p,len) do { \
-    *(p) = (len)-1; \
-} while(0)
-#define HLL_SPARSE_XZERO_SET(p,len) do { \
-    int _l = (len)-1; \
-    *(p) = (_l>>8) | HLL_SPARSE_XZERO_BIT; \
-    *((p)+1) = (_l&0xff); \
-} while(0)
-#define HLL_ALPHA_INF 0.721347520444481703680 /* constant for 0.5/ln(2) */
-
-/* ========================= HyperLogLog algorithm  ========================= */
-
-/* Our hash function is MurmurHash2, 64 bit version.
- * It was modified for Redis in order to provide the same result in
- * big and little endian archs (endian neutral). */
-uint64_t MurmurHash64A (const void * key, int len, unsigned int seed) {
-    const uint64_t m = 0xc6a4a7935bd1e995;
-    const int r = 47;
-    uint64_t h = seed ^ (len * m);
-    const uint8_t *data = (const uint8_t *)key;
-    const uint8_t *end = data + (len-(len&7));
-
-    while(data != end) {
-        uint64_t k;
-
-#if (BYTE_ORDER == LITTLE_ENDIAN)
-    #ifdef USE_ALIGNED_ACCESS
-        memcpy(&k,data,sizeof(uint64_t));
-    #else
-        k = *((uint64_t*)data);
-    #endif
-#else
-        k = (uint64_t) data[0];
-        k |= (uint64_t) data[1] << 8;
-        k |= (uint64_t) data[2] << 16;
-        k |= (uint64_t) data[3] << 24;
-        k |= (uint64_t) data[4] << 32;
-        k |= (uint64_t) data[5] << 40;
-        k |= (uint64_t) data[6] << 48;
-        k |= (uint64_t) data[7] << 56;
-#endif
-
-        k *= m;
-        k ^= k >> r;
-        k *= m;
-        h ^= k;
-        h *= m;
-        data += 8;
-    }
-
-    switch(len & 7) {
-    case 7: h ^= (uint64_t)data[6] << 48; /* fall-thru */
-    case 6: h ^= (uint64_t)data[5] << 40; /* fall-thru */
-    case 5: h ^= (uint64_t)data[4] << 32; /* fall-thru */
-    case 4: h ^= (uint64_t)data[3] << 24; /* fall-thru */
-    case 3: h ^= (uint64_t)data[2] << 16; /* fall-thru */
-    case 2: h ^= (uint64_t)data[1] << 8; /* fall-thru */
-    case 1: h ^= (uint64_t)data[0];
-            h *= m; /* fall-thru */
-    };
-
-    h ^= h >> r;
-    h *= m;
-    h ^= h >> r;
-    return h;
-}
-
-/* Given a string element to add to the HyperLogLog, returns the length
- * of the pattern 000..1 of the element hash. As a side effect 'regp' is
- * set to the register index this element hashes to. */
-int hllPatLen(unsigned char *ele, size_t elesize, long *regp) {
-    uint64_t hash, bit, index;
-    int count;
-
-    /* Count the number of zeroes starting from bit HLL_REGISTERS
-     * (that is a power of two corresponding to the first bit we don't use
-     * as index). The max run can be 64-P+1 = Q+1 bits.
-     *
-     * Note that the final "1" ending the sequence of zeroes must be
-     * included in the count, so if we find "001" the count is 3, and
-     * the smallest count possible is no zeroes at all, just a 1 bit
-     * at the first position, that is a count of 1.
-     *
-     * This may sound like inefficient, but actually in the average case
-     * there are high probabilities to find a 1 after a few iterations. */
-    hash = MurmurHash64A(ele,elesize,0xadc83b19ULL);
-    index = hash & HLL_P_MASK; /* Register index. */
-    hash >>= HLL_P; /* Remove bits used to address the register. */
-    hash |= ((uint64_t)1<<HLL_Q); /* Make sure the loop terminates
-                                     and count will be <= Q+1. */
-    bit = 1;
-    count = 1; /* Initialized to 1 since we count the "00000...1" pattern. */
-    while((hash & bit) == 0) {
-        count++;
-        bit <<= 1;
-    }
-    *regp = (int) index;
-    return count;
-}
-
-/* ================== Dense representation implementation  ================== */
-
-/* Low level function to set the dense HLL register at 'index' to the
- * specified value if the current value is smaller than 'count'.
- *
- * 'registers' is expected to have room for HLL_REGISTERS plus an
- * additional byte on the right. This requirement is met by sds strings
- * automatically since they are implicitly null terminated.
- *
- * The function always succeed, however if as a result of the operation
- * the approximated cardinality changed, 1 is returned. Otherwise 0
- * is returned. */
-int hllDenseSet(uint8_t *registers, long index, uint8_t count) {
-    uint8_t oldcount;
-
-    HLL_DENSE_GET_REGISTER(oldcount,registers,index);
-    if (count > oldcount) {
-        HLL_DENSE_SET_REGISTER(registers,index,count);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* "Add" the element in the dense hyperloglog data structure.
- * Actually nothing is added, but the max 0 pattern counter of the subset
- * the element belongs to is incremented if needed.
- *
- * This is just a wrapper to hllDenseSet(), performing the hashing of the
- * element in order to retrieve the index and zero-run count. */
-int hllDenseAdd(uint8_t *registers, unsigned char *ele, size_t elesize) {
-    long index;
-    uint8_t count = hllPatLen(ele,elesize,&index);
-    /* Update the register if this element produced a longer run of zeroes. */
-    return hllDenseSet(registers,index,count);
-}
-
-/* Compute the register histogram in the dense representation. */
-void hllDenseRegHisto(uint8_t *registers, int* reghisto) {
-    int j;
-
-    /* Redis default is to use 16384 registers 6 bits each. The code works
-     * with other values by modifying the defines, but for our target value
-     * we take a faster path with unrolled loops. */
-    if (HLL_REGISTERS == 16384 && HLL_BITS == 6) {
-        uint8_t *r = registers;
-        unsigned long r0, r1, r2, r3, r4, r5, r6, r7, r8, r9,
-                      r10, r11, r12, r13, r14, r15;
-        for (j = 0; j < 1024; j++) {
-            /* Handle 16 registers per iteration. */
-            r0 = r[0] & 63;
-            r1 = (r[0] >> 6 | r[1] << 2) & 63;
-            r2 = (r[1] >> 4 | r[2] << 4) & 63;
-            r3 = (r[2] >> 2) & 63;
-            r4 = r[3] & 63;
-            r5 = (r[3] >> 6 | r[4] << 2) & 63;
-            r6 = (r[4] >> 4 | r[5] << 4) & 63;
-            r7 = (r[5] >> 2) & 63;
-            r8 = r[6] & 63;
-            r9 = (r[6] >> 6 | r[7] << 2) & 63;
-            r10 = (r[7] >> 4 | r[8] << 4) & 63;
-            r11 = (r[8] >> 2) & 63;
-            r12 = r[9] & 63;
-            r13 = (r[9] >> 6 | r[10] << 2) & 63;
-            r14 = (r[10] >> 4 | r[11] << 4) & 63;
-            r15 = (r[11] >> 2) & 63;
-
-            reghisto[r0]++;
-            reghisto[r1]++;
-            reghisto[r2]++;
-            reghisto[r3]++;
-            reghisto[r4]++;
-            reghisto[r5]++;
-            reghisto[r6]++;
-            reghisto[r7]++;
-            reghisto[r8]++;
-            reghisto[r9]++;
-            reghisto[r10]++;
-            reghisto[r11]++;
-            reghisto[r12]++;
-            reghisto[r13]++;
-            reghisto[r14]++;
-            reghisto[r15]++;
-
-            r += 12;
-        }
-    } else {
-        for(j = 0; j < HLL_REGISTERS; j++) {
-            unsigned long reg;
-            HLL_DENSE_GET_REGISTER(reg,registers,j);
-            reghisto[reg]++;
-        }
-    }
-}
-
-/* ================== Sparse representation implementation  ================= */
-
-/* Convert the HLL with sparse representation given as input in its dense
- * representation. Both representations are represented by SDS strings, and
- * the input representation is freed as a side effect.
- *
- * The function returns C_OK if the sparse representation was valid,
- * otherwise C_ERR is returned if the representation was corrupted. */
-int hllSparseToDense(robj *o) {
-    sds sparse = o->ptr, dense;
-    struct hllhdr *hdr, *oldhdr = (struct hllhdr*)sparse;
-    int idx = 0, runlen, regval;
-    uint8_t *p = (uint8_t*)sparse, *end = p+sdslen(sparse);
-
-    /* If the representation is already the right one return ASAP. */
-    hdr = (struct hllhdr*) sparse;
-    if (hdr->encoding == HLL_DENSE) return C_OK;
-
-    /* Create a string of the right size filled with zero bytes.
-     * Note that the cached cardinality is set to 0 as a side effect
-     * that is exactly the cardinality of an empty HLL. */
-    dense = sdsnewlen(NULL,HLL_DENSE_SIZE);
-    hdr = (struct hllhdr*) dense;
-    *hdr = *oldhdr; /* This will copy the magic and cached cardinality. */
-    hdr->encoding = HLL_DENSE;
-
-    /* Now read the sparse representation and set non-zero registers
-     * accordingly. */
-    p += HLL_HDR_SIZE;
-    while(p < end) {
-        if (HLL_SPARSE_IS_ZERO(p)) {
-            runlen = HLL_SPARSE_ZERO_LEN(p);
-            idx += runlen;
-            p++;
-        } else if (HLL_SPARSE_IS_XZERO(p)) {
-            runlen = HLL_SPARSE_XZERO_LEN(p);
-            idx += runlen;
-            p += 2;
-        } else {
-            runlen = HLL_SPARSE_VAL_LEN(p);
-            regval = HLL_SPARSE_VAL_VALUE(p);
-            if ((runlen + idx) > HLL_REGISTERS) break; /* Overflow. */
-            while(runlen--) {
-                HLL_DENSE_SET_REGISTER(hdr->registers,idx,regval);
-                idx++;
-            }
-            p++;
-        }
-    }
-
-    /* If the sparse representation was valid, we expect to find idx
-     * set to HLL_REGISTERS. */
-    if (idx != HLL_REGISTERS) {
-        sdsfree(dense);
-        return C_ERR;
-    }
-
-    /* Free the old representation and set the new one. */
-    sdsfree(o->ptr);
-    o->ptr = dense;
-    return C_OK;
-}
-
-/* Low level function to set the sparse HLL register at 'index' to the
- * specified value if the current value is smaller than 'count'.
- *
- * The object 'o' is the String object holding the HLL. The function requires
- * a reference to the object in order to be able to enlarge the string if
- * needed.
- *
- * On success, the function returns 1 if the cardinality changed, or 0
- * if the register for this element was not updated.
- * On error (if the representation is invalid) -1 is returned.
- *
- * As a side effect the function may promote the HLL representation from
- * sparse to dense: this happens when a register requires to be set to a value
- * not representable with the sparse representation, or when the resulting
- * size would be greater than server.hll_sparse_max_bytes. */
-int hllSparseSet(robj *o, long index, uint8_t count) {
-    struct hllhdr *hdr;
-    uint8_t oldcount, *sparse, *end, *p, *prev, *next;
-    long first, span;
-    long is_zero = 0, is_xzero = 0, is_val = 0, runlen = 0;
-
-    /* If the count is too big to be representable by the sparse representation
-     * switch to dense representation. */
-    if (count > HLL_SPARSE_VAL_MAX_VALUE) goto promote;
-
-    /* When updating a sparse representation, sometimes we may need to
-     * enlarge the buffer for up to 3 bytes in the worst case (XZERO split
-     * into XZERO-VAL-XZERO). Make sure there is enough space right now
-     * so that the pointers we take during the execution of the function
-     * will be valid all the time. */
-    o->ptr = sdsMakeRoomFor(o->ptr,3);
-
-    /* Step 1: we need to locate the opcode we need to modify to check
-     * if a value update is actually needed. */
-    sparse = p = ((uint8_t*)o->ptr) + HLL_HDR_SIZE;
-    end = p + sdslen(o->ptr) - HLL_HDR_SIZE;
-
-    first = 0;
-    prev = NULL; /* Points to previous opcode at the end of the loop. */
-    next = NULL; /* Points to the next opcode at the end of the loop. */
-    span = 0;
-    while(p < end) {
-        long oplen;
-
-        /* Set span to the number of registers covered by this opcode.
-         *
-         * This is the most performance critical loop of the sparse
-         * representation. Sorting the conditionals from the most to the
-         * least frequent opcode in many-bytes sparse HLLs is faster. */
-        oplen = 1;
-        if (HLL_SPARSE_IS_ZERO(p)) {
-            span = HLL_SPARSE_ZERO_LEN(p);
-        } else if (HLL_SPARSE_IS_VAL(p)) {
-            span = HLL_SPARSE_VAL_LEN(p);
-        } else { /* XZERO. */
-            span = HLL_SPARSE_XZERO_LEN(p);
-            oplen = 2;
-        }
-        /* Break if this opcode covers the register as 'index'. */
-        if (index <= first+span-1) break;
-        prev = p;
-        p += oplen;
-        first += span;
-    }
-    if (span == 0 || p >= end) return -1; /* Invalid format. */
-
-    next = HLL_SPARSE_IS_XZERO(p) ? p+2 : p+1;
-    if (next >= end) next = NULL;
-
-    /* Cache current opcode type to avoid using the macro again and
-     * again for something that will not change.
-     * Also cache the run-length of the opcode. */
-    if (HLL_SPARSE_IS_ZERO(p)) {
-        is_zero = 1;
-        runlen = HLL_SPARSE_ZERO_LEN(p);
-    } else if (HLL_SPARSE_IS_XZERO(p)) {
-        is_xzero = 1;
-        runlen = HLL_SPARSE_XZERO_LEN(p);
-    } else {
-        is_val = 1;
-        runlen = HLL_SPARSE_VAL_LEN(p);
-    }
-
-    /* Step 2: After the loop:
-     *
-     * 'first' stores to the index of the first register covered
-     *  by the current opcode, which is pointed by 'p'.
-     *
-     * 'next' ad 'prev' store respectively the next and previous opcode,
-     *  or NULL if the opcode at 'p' is respectively the last or first.
-     *
-     * 'span' is set to the number of registers covered by the current
-     *  opcode.
-     *
-     * There are different cases in order to update the data structure
-     * in place without generating it from scratch:
-     *
-     * A) If it is a VAL opcode already set to a value >= our 'count'
-     *    no update is needed, regardless of the VAL run-length field.
-     *    In this case PFADD returns 0 since no changes are performed.
-     *
-     * B) If it is a VAL opcode with len = 1 (representing only our
-     *    register) and the value is less than 'count', we just update it
-     *    since this is a trivial case. */
-    if (is_val) {
-        oldcount = HLL_SPARSE_VAL_VALUE(p);
-        /* Case A. */
-        if (oldcount >= count) return 0;
-
-        /* Case B. */
-        if (runlen == 1) {
-            HLL_SPARSE_VAL_SET(p,count,1);
-            goto updated;
-        }
-    }
-
-    /* C) Another trivial to handle case is a ZERO opcode with a len of 1.
-     * We can just replace it with a VAL opcode with our value and len of 1. */
-    if (is_zero && runlen == 1) {
-        HLL_SPARSE_VAL_SET(p,count,1);
-        goto updated;
-    }
-
-    /* D) General case.
-     *
-     * The other cases are more complex: our register requires to be updated
-     * and is either currently represented by a VAL opcode with len > 1,
-     * by a ZERO opcode with len > 1, or by an XZERO opcode.
-     *
-     * In those cases the original opcode must be split into multiple
-     * opcodes. The worst case is an XZERO split in the middle resulting into
-     * XZERO - VAL - XZERO, so the resulting sequence max length is
-     * 5 bytes.
-     *
-     * We perform the split writing the new sequence into the 'new' buffer
-     * with 'newlen' as length. Later the new sequence is inserted in place
-     * of the old one, possibly moving what is on the right a few bytes
-     * if the new sequence is longer than the older one. */
-    uint8_t seq[5], *n = seq;
-    int last = first+span-1; /* Last register covered by the sequence. */
-    int len;
-
-    if (is_zero || is_xzero) {
-        /* Handle splitting of ZERO / XZERO. */
-        if (index != first) {
-            len = index-first;
-            if (len > HLL_SPARSE_ZERO_MAX_LEN) {
-                HLL_SPARSE_XZERO_SET(n,len);
-                n += 2;
-            } else {
-                HLL_SPARSE_ZERO_SET(n,len);
-                n++;
-            }
-        }
-        HLL_SPARSE_VAL_SET(n,count,1);
-        n++;
-        if (index != last) {
-            len = last-index;
-            if (len > HLL_SPARSE_ZERO_MAX_LEN) {
-                HLL_SPARSE_XZERO_SET(n,len);
-                n += 2;
-            } else {
-                HLL_SPARSE_ZERO_SET(n,len);
-                n++;
-            }
-        }
-    } else {
-        /* Handle splitting of VAL. */
-        int curval = HLL_SPARSE_VAL_VALUE(p);
-
-        if (index != first) {
-            len = index-first;
-            HLL_SPARSE_VAL_SET(n,curval,len);
-            n++;
-        }
-        HLL_SPARSE_VAL_SET(n,count,1);
-        n++;
-        if (index != last) {
-            len = last-index;
-            HLL_SPARSE_VAL_SET(n,curval,len);
-            n++;
-        }
-    }
-
-    /* Step 3: substitute the new sequence with the old one.
-     *
-     * Note that we already allocated space on the sds string
-     * calling sdsMakeRoomFor(). */
-     int seqlen = n-seq;
-     int oldlen = is_xzero ? 2 : 1;
-     int deltalen = seqlen-oldlen;
-
-     if (deltalen > 0 &&
-         sdslen(o->ptr)+deltalen > server.hll_sparse_max_bytes) goto promote;
-     if (deltalen && next) memmove(next+deltalen,next,end-next);
-     sdsIncrLen(o->ptr,deltalen);
-     memcpy(p,seq,seqlen);
-     end += deltalen;
-
-updated:
-    /* Step 4: Merge adjacent values if possible.
-     *
-     * The representation was updated, however the resulting representation
-     * may not be optimal: adjacent VAL opcodes can sometimes be merged into
-     * a single one. */
-    p = prev ? prev : sparse;
-    int scanlen = 5; /* Scan up to 5 upcodes starting from prev. */
-    while (p < end && scanlen--) {
-        if (HLL_SPARSE_IS_XZERO(p)) {
-            p += 2;
-            continue;
-        } else if (HLL_SPARSE_IS_ZERO(p)) {
-            p++;
-            continue;
-        }
-        /* We need two adjacent VAL opcodes to try a merge, having
-         * the same value, and a len that fits the VAL opcode max len. */
-        if (p+1 < end && HLL_SPARSE_IS_VAL(p+1)) {
-            int v1 = HLL_SPARSE_VAL_VALUE(p);
-            int v2 = HLL_SPARSE_VAL_VALUE(p+1);
-            if (v1 == v2) {
-                int len = HLL_SPARSE_VAL_LEN(p)+HLL_SPARSE_VAL_LEN(p+1);
-                if (len <= HLL_SPARSE_VAL_MAX_LEN) {
-                    HLL_SPARSE_VAL_SET(p+1,v1,len);
-                    memmove(p,p+1,end-p);
-                    sdsIncrLen(o->ptr,-1);
-                    end--;
-                    /* After a merge we reiterate without incrementing 'p'
-                     * in order to try to merge the just merged value with
-                     * a value on its right. */
-                    continue;
-                }
-            }
-        }
-        p++;
-    }
-
-    /* Invalidate the cached cardinality. */
-    hdr = o->ptr;
-    HLL_INVALIDATE_CACHE(hdr);
-    return 1;
-
-promote: /* Promote to dense representation. */
-    if (hllSparseToDense(o) == C_ERR) return -1; /* Corrupted HLL. */
-    hdr = o->ptr;
-
-    /* We need to call hllDenseAdd() to perform the operation after the
-     * conversion. However the result must be 1, since if we need to
-     * convert from sparse to dense a register requires to be updated.
-     *
-     * Note that this in turn means that PFADD will make sure the command
-     * is propagated to slaves / AOF, so if there is a sparse -> dense
-     * conversion, it will be performed in all the slaves as well. */
-    int dense_retval = hllDenseSet(hdr->registers,index,count);
-    serverAssert(dense_retval == 1);
-    return dense_retval;
-}
-
-/* "Add" the element in the sparse hyperloglog data structure.
- * Actually nothing is added, but the max 0 pattern counter of the subset
- * the element belongs to is incremented if needed.
- *
- * This function is actually a wrapper for hllSparseSet(), it only performs
- * the hashshing of the element to obtain the index and zeros run length. */
-int hllSparseAdd(robj *o, unsigned char *ele, size_t elesize) {
-    long index;
-    uint8_t count = hllPatLen(ele,elesize,&index);
-    /* Update the register if this element produced a longer run of zeroes. */
-    return hllSparseSet(o,index,count);
-}
-
-/* Compute the register histogram in the sparse representation. */
-void hllSparseRegHisto(uint8_t *sparse, int sparselen, int *invalid, int* reghisto) {
-    int idx = 0, runlen, regval;
-    uint8_t *end = sparse+sparselen, *p = sparse;
-
-    while(p < end) {
-        if (HLL_SPARSE_IS_ZERO(p)) {
-            runlen = HLL_SPARSE_ZERO_LEN(p);
-            idx += runlen;
-            reghisto[0] += runlen;
-            p++;
-        } else if (HLL_SPARSE_IS_XZERO(p)) {
-            runlen = HLL_SPARSE_XZERO_LEN(p);
-            idx += runlen;
-            reghisto[0] += runlen;
-            p += 2;
-        } else {
-            runlen = HLL_SPARSE_VAL_LEN(p);
-            regval = HLL_SPARSE_VAL_VALUE(p);
-            idx += runlen;
-            reghisto[regval] += runlen;
-            p++;
-        }
-    }
-    if (idx != HLL_REGISTERS && invalid) *invalid = 1;
-}
-
-/* ========================= HyperLogLog Count ==============================
- * This is the core of the algorithm where the approximated count is computed.
- * The function uses the lower level hllDenseRegHisto() and hllSparseRegHisto()
- * functions as helpers to compute histogram of register values part of the
- * computation, which is representation-specific, while all the rest is common. */
-
-/* Implements the register histogram calculation for uint8_t data type
- * which is only used internally as speedup for PFCOUNT with multiple keys. */
-void hllRawRegHisto(uint8_t *registers, int* reghisto) {
-    uint64_t *word = (uint64_t*) registers;
-    uint8_t *bytes;
-    int j;
-
-    for (j = 0; j < HLL_REGISTERS/8; j++) {
-        if (*word == 0) {
-            reghisto[0] += 8;
-        } else {
-            bytes = (uint8_t*) word;
-            reghisto[bytes[0]]++;
-            reghisto[bytes[1]]++;
-            reghisto[bytes[2]]++;
-            reghisto[bytes[3]]++;
-            reghisto[bytes[4]]++;
-            reghisto[bytes[5]]++;
-            reghisto[bytes[6]]++;
-            reghisto[bytes[7]]++;
-        }
-        word++;
-    }
-}
-
-/* Helper function sigma as defined in
- * "New cardinality estimation algorithms for HyperLogLog sketches"
- * Otmar Ertl, arXiv:1702.01284 */
-double hllSigma(double x) {
-    if (x == 1.) return INFINITY;
-    double zPrime;
-    double y = 1;
-    double z = x;
-    do {
-        x *= x;
-        zPrime = z;
-        z += x * y;
-        y += y;
-    } while(zPrime != z);
-    return z;
-}
-
-/* Helper function tau as defined in
- * "New cardinality estimation algorithms for HyperLogLog sketches"
- * Otmar Ertl, arXiv:1702.01284 */
-double hllTau(double x) {
-    if (x == 0. || x == 1.) return 0.;
-    double zPrime;
-    double y = 1.0;
-    double z = 1 - x;
-    do {
-        x = sqrt(x);
-        zPrime = z;
-        y *= 0.5;
-        z -= pow(1 - x, 2)*y;
-    } while(zPrime != z);
-    return z / 3;
-}
-
-/* Return the approximated cardinality of the set based on the harmonic
- * mean of the registers values. 'hdr' points to the start of the SDS
- * representing the String object holding the HLL representation.
- *
- * If the sparse representation of the HLL object is not valid, the integer
- * pointed by 'invalid' is set to non-zero, otherwise it is left untouched.
- *
- * hllCount() supports a special internal-only encoding of HLL_RAW, that
- * is, hdr->registers will point to an uint8_t array of HLL_REGISTERS element.
- * This is useful in order to speedup PFCOUNT when called against multiple
- * keys (no need to work with 6-bit integers encoding). */
-uint64_t hllCount(struct hllhdr *hdr, int *invalid) {
-    double m = HLL_REGISTERS;
-    double E;
-    int j;
-    /* Note that reghisto size could be just HLL_Q+2, because HLL_Q+1 is
-     * the maximum frequency of the "000...1" sequence the hash function is
-     * able to return. However it is slow to check for sanity of the
-     * input: instead we history array at a safe size: overflows will
-     * just write data to wrong, but correctly allocated, places. */
-    int reghisto[64] = {0};
-
-    /* Compute register histogram */
-    if (hdr->encoding == HLL_DENSE) {
-        hllDenseRegHisto(hdr->registers,reghisto);
-    } else if (hdr->encoding == HLL_SPARSE) {
-        hllSparseRegHisto(hdr->registers,
-                         sdslen((sds)hdr)-HLL_HDR_SIZE,invalid,reghisto);
-    } else if (hdr->encoding == HLL_RAW) {
-        hllRawRegHisto(hdr->registers,reghisto);
-    } else {
-        serverPanic("Unknown HyperLogLog encoding in hllCount()");
-    }
-
-    /* Estimate cardinality form register histogram. See:
-     * "New cardinality estimation algorithms for HyperLogLog sketches"
-     * Otmar Ertl, arXiv:1702.01284 */
-    double z = m * hllTau((m-reghisto[HLL_Q+1])/(double)m);
-    for (j = HLL_Q; j >= 1; --j) {
-        z += reghisto[j];
-        z *= 0.5;
-    }
-    z += m * hllSigma(reghisto[0]/(double)m);
-    E = llroundl(HLL_ALPHA_INF*m*m/z);
-
-    return (uint64_t) E;
-}
-
-/* Call hllDenseAdd() or hllSparseAdd() according to the HLL encoding. */
-int hllAdd(robj *o, unsigned char *ele, size_t elesize) {
-    struct hllhdr *hdr = o->ptr;
-    switch(hdr->encoding) {
-    case HLL_DENSE: return hllDenseAdd(hdr->registers,ele,elesize);
-    case HLL_SPARSE: return hllSparseAdd(o,ele,elesize);
-    default: return -1; /* Invalid representation. */
-    }
-}
-
-/* Merge by computing MAX(registers[i],hll[i]) the HyperLogLog 'hll'
- * with an array of uint8_t HLL_REGISTERS registers pointed by 'max'.
- *
- * The hll object must be already validated via isHLLObjectOrReply()
- * or in some other way.
- *
- * If the HyperLogLog is sparse and is found to be invalid, C_ERR
- * is returned, otherwise the function always succeeds. */
-int hllMerge(uint8_t *max, robj *hll) {
-    struct hllhdr *hdr = hll->ptr;
-    int i;
-
-    if (hdr->encoding == HLL_DENSE) {
-        uint8_t val;
-
-        for (i = 0; i < HLL_REGISTERS; i++) {
-            HLL_DENSE_GET_REGISTER(val,hdr->registers,i);
-            if (val > max[i]) max[i] = val;
-        }
-    } else {
-        uint8_t *p = hll->ptr, *end = p + sdslen(hll->ptr);
-        long runlen, regval;
-
-        p += HLL_HDR_SIZE;
-        i = 0;
-        while(p < end) {
-            if (HLL_SPARSE_IS_ZERO(p)) {
-                runlen = HLL_SPARSE_ZERO_LEN(p);
-                i += runlen;
-                p++;
-            } else if (HLL_SPARSE_IS_XZERO(p)) {
-                runlen = HLL_SPARSE_XZERO_LEN(p);
-                i += runlen;
-                p += 2;
-            } else {
-                runlen = HLL_SPARSE_VAL_LEN(p);
-                regval = HLL_SPARSE_VAL_VALUE(p);
-                if ((runlen + i) > HLL_REGISTERS) break; /* Overflow. */
-                while(runlen--) {
-                    if (regval > max[i]) max[i] = regval;
-                    i++;
-                }
-                p++;
-            }
-        }
-        if (i != HLL_REGISTERS) return C_ERR;
-    }
-    return C_OK;
-}
-
-/* ========================== HyperLogLog commands ========================== */
-
-/* Create an HLL object. We always create the HLL using sparse encoding.
- * This will be upgraded to the dense representation as needed. */
-robj *createHLLObject(void) {
-    robj *o;
-    struct hllhdr *hdr;
-    sds s;
-    uint8_t *p;
-    int sparselen = HLL_HDR_SIZE +
-                    (((HLL_REGISTERS+(HLL_SPARSE_XZERO_MAX_LEN-1)) /
-                     HLL_SPARSE_XZERO_MAX_LEN)*2);
-    int aux;
-
-    /* Populate the sparse representation with as many XZERO opcodes as
-     * needed to represent all the registers. */
-    aux = HLL_REGISTERS;
-    s = sdsnewlen(NULL,sparselen);
-    p = (uint8_t*)s + HLL_HDR_SIZE;
-    while(aux) {
-        int xzero = HLL_SPARSE_XZERO_MAX_LEN;
-        if (xzero > aux) xzero = aux;
-        HLL_SPARSE_XZERO_SET(p,xzero);
-        p += 2;
-        aux -= xzero;
-    }
-    serverAssert((p-(uint8_t*)s) == sparselen);
-
-    /* Create the actual object. */
-    o = createObject(OBJ_STRING,s);
-    hdr = o->ptr;
-    memcpy(hdr->magic,"HYLL",4);
-    hdr->encoding = HLL_SPARSE;
-    return o;
-}
-
-/* Check if the object is a String with a valid HLL representation.
- * Return C_OK if this is true, otherwise reply to the client
- * with an error and return C_ERR. */
-int isHLLObjectOrReply(client *c, robj *o) {
-    struct hllhdr *hdr;
-
-    /* Key exists, check type */
-    if (checkType(c,o,OBJ_STRING))
-        return C_ERR; /* Error already sent. */
-
-    if (!sdsEncodedObject(o)) goto invalid;
-    if (stringObjectLen(o) < sizeof(*hdr)) goto invalid;
-    hdr = o->ptr;
-
-    /* Magic should be "HYLL". */
-    if (hdr->magic[0] != 'H' || hdr->magic[1] != 'Y' ||
-        hdr->magic[2] != 'L' || hdr->magic[3] != 'L') goto invalid;
-
-    if (hdr->encoding > HLL_MAX_ENCODING) goto invalid;
-
-    /* Dense representation string length should match exactly. */
-    if (hdr->encoding == HLL_DENSE &&
-        stringObjectLen(o) != HLL_DENSE_SIZE) goto invalid;
-
-    /* All tests passed. */
-    return C_OK;
-
-invalid:
-    addReplyError(c,"-WRONGTYPE Key is not a valid "
-               "HyperLogLog string value.");
-    return C_ERR;
-}
-
-/* PFADD var ele ele ele ... ele => :0 or :1 */
-void pfaddCommand(client *c) {
-    robj *o = lookupKeyWrite(c->db,c->argv[1]);
-    struct hllhdr *hdr;
-    int updated = 0, j;
-
-    if (o == NULL) {
-        /* Create the key with a string value of the exact length to
-         * hold our HLL data structure. sdsnewlen() when NULL is passed
-         * is guaranteed to return bytes initialized to zero. */
-        o = createHLLObject();
-        dbAdd(c->db,c->argv[1],o);
-        updated++;
-    } else {
-        if (isHLLObjectOrReply(c,o) != C_OK) return;
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-    }
-    /* Perform the low level ADD operation for every element. */
-    for (j = 2; j < c->argc; j++) {
-        int retval = hllAdd(o, (unsigned char*)c->argv[j]->ptr,
-                               sdslen(c->argv[j]->ptr));
-        switch(retval) {
-        case 1:
-            updated++;
-            break;
-        case -1:
-            addReplyError(c,invalid_hll_err);
-            return;
-        }
-    }
-    hdr = o->ptr;
-    if (updated) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_STRING,"pfadd",c->argv[1],c->db->id);
-        server.dirty += updated;
-        HLL_INVALIDATE_CACHE(hdr);
-    }
-    addReply(c, updated ? shared.cone : shared.czero);
-}
-
-/* PFCOUNT var -> approximated cardinality of set. */
-void pfcountCommand(client *c) {
-    robj *o;
-    struct hllhdr *hdr;
-    uint64_t card;
-
-    /* Case 1: multi-key keys, cardinality of the union.
-     *
-     * When multiple keys are specified, PFCOUNT actually computes
-     * the cardinality of the merge of the N HLLs specified. */
-    if (c->argc > 2) {
-        uint8_t max[HLL_HDR_SIZE+HLL_REGISTERS], *registers;
-        int j;
-
-        /* Compute an HLL with M[i] = MAX(M[i]_j). */
-        memset(max,0,sizeof(max));
-        hdr = (struct hllhdr*) max;
-        hdr->encoding = HLL_RAW; /* Special internal-only encoding. */
-        registers = max + HLL_HDR_SIZE;
-        for (j = 1; j < c->argc; j++) {
-            /* Check type and size. */
-            robj *o = lookupKeyRead(c->db,c->argv[j]);
-            if (o == NULL) continue; /* Assume empty HLL for non existing var.*/
-            if (isHLLObjectOrReply(c,o) != C_OK) return;
-
-            /* Merge with this HLL with our 'max' HLL by setting max[i]
-             * to MAX(max[i],hll[i]). */
-            if (hllMerge(registers,o) == C_ERR) {
-                addReplyError(c,invalid_hll_err);
-                return;
-            }
-        }
-
-        /* Compute cardinality of the resulting set. */
-        addReplyLongLong(c,hllCount(hdr,NULL));
-        return;
-    }
-
-    /* Case 2: cardinality of the single HLL.
-     *
-     * The user specified a single key. Either return the cached value
-     * or compute one and update the cache. */
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (o == NULL) {
-        /* No key? Cardinality is zero since no element was added, otherwise
-         * we would have a key as HLLADD creates it as a side effect. */
-        addReply(c,shared.czero);
-    } else {
-        if (isHLLObjectOrReply(c,o) != C_OK) return;
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-
-        /* Check if the cached cardinality is valid. */
-        hdr = o->ptr;
-        if (HLL_VALID_CACHE(hdr)) {
-            /* Just return the cached value. */
-            card = (uint64_t)hdr->card[0];
-            card |= (uint64_t)hdr->card[1] << 8;
-            card |= (uint64_t)hdr->card[2] << 16;
-            card |= (uint64_t)hdr->card[3] << 24;
-            card |= (uint64_t)hdr->card[4] << 32;
-            card |= (uint64_t)hdr->card[5] << 40;
-            card |= (uint64_t)hdr->card[6] << 48;
-            card |= (uint64_t)hdr->card[7] << 56;
-        } else {
-            int invalid = 0;
-            /* Recompute it and update the cached value. */
-            card = hllCount(hdr,&invalid);
-            if (invalid) {
-                addReplyError(c,invalid_hll_err);
-                return;
-            }
-            hdr->card[0] = card & 0xff;
-            hdr->card[1] = (card >> 8) & 0xff;
-            hdr->card[2] = (card >> 16) & 0xff;
-            hdr->card[3] = (card >> 24) & 0xff;
-            hdr->card[4] = (card >> 32) & 0xff;
-            hdr->card[5] = (card >> 40) & 0xff;
-            hdr->card[6] = (card >> 48) & 0xff;
-            hdr->card[7] = (card >> 56) & 0xff;
-            /* This is not considered a read-only command even if the
-             * data structure is not modified, since the cached value
-             * may be modified and given that the HLL is a Redis string
-             * we need to propagate the change. */
-            signalModifiedKey(c,c->db,c->argv[1]);
-            server.dirty++;
-        }
-        addReplyLongLong(c,card);
-    }
-}
-
-/* PFMERGE dest src1 src2 src3 ... srcN => OK */
-void pfmergeCommand(client *c) {
-    uint8_t max[HLL_REGISTERS];
-    struct hllhdr *hdr;
-    int j;
-    int use_dense = 0; /* Use dense representation as target? */
-
-    /* Compute an HLL with M[i] = MAX(M[i]_j).
-     * We store the maximum into the max array of registers. We'll write
-     * it to the target variable later. */
-    memset(max,0,sizeof(max));
-    for (j = 1; j < c->argc; j++) {
-        /* Check type and size. */
-        robj *o = lookupKeyRead(c->db,c->argv[j]);
-        if (o == NULL) continue; /* Assume empty HLL for non existing var. */
-        if (isHLLObjectOrReply(c,o) != C_OK) return;
-
-        /* If at least one involved HLL is dense, use the dense representation
-         * as target ASAP to save time and avoid the conversion step. */
-        hdr = o->ptr;
-        if (hdr->encoding == HLL_DENSE) use_dense = 1;
-
-        /* Merge with this HLL with our 'max' HLL by setting max[i]
-         * to MAX(max[i],hll[i]). */
-        if (hllMerge(max,o) == C_ERR) {
-            addReplyError(c,invalid_hll_err);
-            return;
-        }
-    }
-
-    /* Create / unshare the destination key's value if needed. */
-    robj *o = lookupKeyWrite(c->db,c->argv[1]);
-    if (o == NULL) {
-        /* Create the key with a string value of the exact length to
-         * hold our HLL data structure. sdsnewlen() when NULL is passed
-         * is guaranteed to return bytes initialized to zero. */
-        o = createHLLObject();
-        dbAdd(c->db,c->argv[1],o);
-    } else {
-        /* If key exists we are sure it's of the right type/size
-         * since we checked when merging the different HLLs, so we
-         * don't check again. */
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-    }
-
-    /* Convert the destination object to dense representation if at least
-     * one of the inputs was dense. */
-    if (use_dense && hllSparseToDense(o) == C_ERR) {
-        addReplyError(c,invalid_hll_err);
-        return;
-    }
-
-    /* Write the resulting HLL to the destination HLL registers and
-     * invalidate the cached value. */
-    for (j = 0; j < HLL_REGISTERS; j++) {
-        if (max[j] == 0) continue;
-        hdr = o->ptr;
-        switch(hdr->encoding) {
-        case HLL_DENSE: hllDenseSet(hdr->registers,j,max[j]); break;
-        case HLL_SPARSE: hllSparseSet(o,j,max[j]); break;
-        }
-    }
-    hdr = o->ptr; /* o->ptr may be different now, as a side effect of
-                     last hllSparseSet() call. */
-    HLL_INVALIDATE_CACHE(hdr);
-
-    signalModifiedKey(c,c->db,c->argv[1]);
-    /* We generate a PFADD event for PFMERGE for semantical simplicity
-     * since in theory this is a mass-add of elements. */
-    notifyKeyspaceEvent(NOTIFY_STRING,"pfadd",c->argv[1],c->db->id);
-    server.dirty++;
-    addReply(c,shared.ok);
-}
-
-/* ========================== Testing / Debugging  ========================== */
-
-/* PFSELFTEST
- * This command performs a self-test of the HLL registers implementation.
- * Something that is not easy to test from within the outside. */
-#define HLL_TEST_CYCLES 1000
-void pfselftestCommand(client *c) {
-    unsigned int j, i;
-    sds bitcounters = sdsnewlen(NULL,HLL_DENSE_SIZE);
-    struct hllhdr *hdr = (struct hllhdr*) bitcounters, *hdr2;
-    robj *o = NULL;
-    uint8_t bytecounters[HLL_REGISTERS];
-
-    /* Test 1: access registers.
-     * The test is conceived to test that the different counters of our data
-     * structure are accessible and that setting their values both result in
-     * the correct value to be retained and not affect adjacent values. */
-    for (j = 0; j < HLL_TEST_CYCLES; j++) {
-        /* Set the HLL counters and an array of unsigned byes of the
-         * same size to the same set of random values. */
-        for (i = 0; i < HLL_REGISTERS; i++) {
-            unsigned int r = rand() & HLL_REGISTER_MAX;
-
-            bytecounters[i] = r;
-            HLL_DENSE_SET_REGISTER(hdr->registers,i,r);
-        }
-        /* Check that we are able to retrieve the same values. */
-        for (i = 0; i < HLL_REGISTERS; i++) {
-            unsigned int val;
-
-            HLL_DENSE_GET_REGISTER(val,hdr->registers,i);
-            if (val != bytecounters[i]) {
-                addReplyErrorFormat(c,
-                    "TESTFAILED Register %d should be %d but is %d",
-                    i, (int) bytecounters[i], (int) val);
-                goto cleanup;
-            }
-        }
-    }
-
-    /* Test 2: approximation error.
-     * The test adds unique elements and check that the estimated value
-     * is always reasonable bounds.
-     *
-     * We check that the error is smaller than a few times than the expected
-     * standard error, to make it very unlikely for the test to fail because
-     * of a "bad" run.
-     *
-     * The test is performed with both dense and sparse HLLs at the same
-     * time also verifying that the computed cardinality is the same. */
-    memset(hdr->registers,0,HLL_DENSE_SIZE-HLL_HDR_SIZE);
-    o = createHLLObject();
-    double relerr = 1.04/sqrt(HLL_REGISTERS);
-    int64_t checkpoint = 1;
-    uint64_t seed = (uint64_t)rand() | (uint64_t)rand() << 32;
-    uint64_t ele;
-    for (j = 1; j <= 10000000; j++) {
-        ele = j ^ seed;
-        hllDenseAdd(hdr->registers,(unsigned char*)&ele,sizeof(ele));
-        hllAdd(o,(unsigned char*)&ele,sizeof(ele));
-
-        /* Make sure that for small cardinalities we use sparse
-         * encoding. */
-        if (j == checkpoint && j < server.hll_sparse_max_bytes/2) {
-            hdr2 = o->ptr;
-            if (hdr2->encoding != HLL_SPARSE) {
-                addReplyError(c, "TESTFAILED sparse encoding not used");
-                goto cleanup;
-            }
-        }
-
-        /* Check that dense and sparse representations agree. */
-        if (j == checkpoint && hllCount(hdr,NULL) != hllCount(o->ptr,NULL)) {
-                addReplyError(c, "TESTFAILED dense/sparse disagree");
-                goto cleanup;
-        }
-
-        /* Check error. */
-        if (j == checkpoint) {
-            int64_t abserr = checkpoint - (int64_t)hllCount(hdr,NULL);
-            uint64_t maxerr = ceil(relerr*6*checkpoint);
-
-            /* Adjust the max error we expect for cardinality 10
-             * since from time to time it is statistically likely to get
-             * much higher error due to collision, resulting into a false
-             * positive. */
-            if (j == 10) maxerr = 1;
-
-            if (abserr < 0) abserr = -abserr;
-            if (abserr > (int64_t)maxerr) {
-                addReplyErrorFormat(c,
-                    "TESTFAILED Too big error. card:%llu abserr:%llu",
-                    (unsigned long long) checkpoint,
-                    (unsigned long long) abserr);
-                goto cleanup;
-            }
-            checkpoint *= 10;
-        }
-    }
-
-    /* Success! */
-    addReply(c,shared.ok);
-
-cleanup:
-    sdsfree(bitcounters);
-    if (o) decrRefCount(o);
-}
-
-/* PFDEBUG <subcommand> <key> ... args ...
- * Different debugging related operations about the HLL implementation. */
-void pfdebugCommand(client *c) {
-    char *cmd = c->argv[1]->ptr;
-    struct hllhdr *hdr;
-    robj *o;
-    int j;
-
-    o = lookupKeyWrite(c->db,c->argv[2]);
-    if (o == NULL) {
-        addReplyError(c,"The specified key does not exist");
-        return;
-    }
-    if (isHLLObjectOrReply(c,o) != C_OK) return;
-    o = dbUnshareStringValue(c->db,c->argv[2],o);
-    hdr = o->ptr;
-
-    /* PFDEBUG GETREG <key> */
-    if (!strcasecmp(cmd,"getreg")) {
-        if (c->argc != 3) goto arityerr;
-
-        if (hdr->encoding == HLL_SPARSE) {
-            if (hllSparseToDense(o) == C_ERR) {
-                addReplyError(c,invalid_hll_err);
-                return;
-            }
-            server.dirty++; /* Force propagation on encoding change. */
-        }
-
-        hdr = o->ptr;
-        addReplyArrayLen(c,HLL_REGISTERS);
-        for (j = 0; j < HLL_REGISTERS; j++) {
-            uint8_t val;
-
-            HLL_DENSE_GET_REGISTER(val,hdr->registers,j);
-            addReplyLongLong(c,val);
-        }
-    }
-    /* PFDEBUG DECODE <key> */
-    else if (!strcasecmp(cmd,"decode")) {
-        if (c->argc != 3) goto arityerr;
-
-        uint8_t *p = o->ptr, *end = p+sdslen(o->ptr);
-        sds decoded = sdsempty();
-
-        if (hdr->encoding != HLL_SPARSE) {
-            sdsfree(decoded);
-            addReplyError(c,"HLL encoding is not sparse");
-            return;
-        }
-
-        p += HLL_HDR_SIZE;
-        while(p < end) {
-            int runlen, regval;
-
-            if (HLL_SPARSE_IS_ZERO(p)) {
-                runlen = HLL_SPARSE_ZERO_LEN(p);
-                p++;
-                decoded = sdscatprintf(decoded,"z:%d ",runlen);
-            } else if (HLL_SPARSE_IS_XZERO(p)) {
-                runlen = HLL_SPARSE_XZERO_LEN(p);
-                p += 2;
-                decoded = sdscatprintf(decoded,"Z:%d ",runlen);
-            } else {
-                runlen = HLL_SPARSE_VAL_LEN(p);
-                regval = HLL_SPARSE_VAL_VALUE(p);
-                p++;
-                decoded = sdscatprintf(decoded,"v:%d,%d ",regval,runlen);
-            }
-        }
-        decoded = sdstrim(decoded," ");
-        addReplyBulkCBuffer(c,decoded,sdslen(decoded));
-        sdsfree(decoded);
-    }
-    /* PFDEBUG ENCODING <key> */
-    else if (!strcasecmp(cmd,"encoding")) {
-        char *encodingstr[2] = {"dense","sparse"};
-        if (c->argc != 3) goto arityerr;
-
-        addReplyStatus(c,encodingstr[hdr->encoding]);
-    }
-    /* PFDEBUG TODENSE <key> */
-    else if (!strcasecmp(cmd,"todense")) {
-        int conv = 0;
-        if (c->argc != 3) goto arityerr;
-
-        if (hdr->encoding == HLL_SPARSE) {
-            if (hllSparseToDense(o) == C_ERR) {
-                addReplyError(c,invalid_hll_err);
-                return;
-            }
-            conv = 1;
-            server.dirty++; /* Force propagation on encoding change. */
-        }
-        addReply(c,conv ? shared.cone : shared.czero);
-    } else {
-        addReplyErrorFormat(c,"Unknown PFDEBUG subcommand '%s'", cmd);
-    }
-    return;
-
-arityerr:
-    addReplyErrorFormat(c,
-        "Wrong number of arguments for the '%s' subcommand",cmd);
-}
-
diff --git a/redis-stable/src/intset.c b/redis-stable/src/intset.c
deleted file mode 100644
index e3668513..00000000
--- a/redis-stable/src/intset.c
+++ /dev/null
@@ -1,547 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include "intset.h"
-#include "zmalloc.h"
-#include "endianconv.h"
-#include "redisassert.h"
-
-/* Note that these encodings are ordered, so:
- * INTSET_ENC_INT16 < INTSET_ENC_INT32 < INTSET_ENC_INT64. */
-#define INTSET_ENC_INT16 (sizeof(int16_t))
-#define INTSET_ENC_INT32 (sizeof(int32_t))
-#define INTSET_ENC_INT64 (sizeof(int64_t))
-
-/* Return the required encoding for the provided value. */
-static uint8_t _intsetValueEncoding(int64_t v) {
-    if (v < INT32_MIN || v > INT32_MAX)
-        return INTSET_ENC_INT64;
-    else if (v < INT16_MIN || v > INT16_MAX)
-        return INTSET_ENC_INT32;
-    else
-        return INTSET_ENC_INT16;
-}
-
-/* Return the value at pos, given an encoding. */
-static int64_t _intsetGetEncoded(intset *is, int pos, uint8_t enc) {
-    int64_t v64;
-    int32_t v32;
-    int16_t v16;
-
-    if (enc == INTSET_ENC_INT64) {
-        memcpy(&v64,((int64_t*)is->contents)+pos,sizeof(v64));
-        memrev64ifbe(&v64);
-        return v64;
-    } else if (enc == INTSET_ENC_INT32) {
-        memcpy(&v32,((int32_t*)is->contents)+pos,sizeof(v32));
-        memrev32ifbe(&v32);
-        return v32;
-    } else {
-        memcpy(&v16,((int16_t*)is->contents)+pos,sizeof(v16));
-        memrev16ifbe(&v16);
-        return v16;
-    }
-}
-
-/* Return the value at pos, using the configured encoding. */
-static int64_t _intsetGet(intset *is, int pos) {
-    return _intsetGetEncoded(is,pos,intrev32ifbe(is->encoding));
-}
-
-/* Set the value at pos, using the configured encoding. */
-static void _intsetSet(intset *is, int pos, int64_t value) {
-    uint32_t encoding = intrev32ifbe(is->encoding);
-
-    if (encoding == INTSET_ENC_INT64) {
-        ((int64_t*)is->contents)[pos] = value;
-        memrev64ifbe(((int64_t*)is->contents)+pos);
-    } else if (encoding == INTSET_ENC_INT32) {
-        ((int32_t*)is->contents)[pos] = value;
-        memrev32ifbe(((int32_t*)is->contents)+pos);
-    } else {
-        ((int16_t*)is->contents)[pos] = value;
-        memrev16ifbe(((int16_t*)is->contents)+pos);
-    }
-}
-
-/* Create an empty intset. */
-intset *intsetNew(void) {
-    intset *is = zmalloc(sizeof(intset));
-    is->encoding = intrev32ifbe(INTSET_ENC_INT16);
-    is->length = 0;
-    return is;
-}
-
-/* Resize the intset */
-static intset *intsetResize(intset *is, uint32_t len) {
-    uint64_t size = (uint64_t)len*intrev32ifbe(is->encoding);
-    assert(size <= SIZE_MAX - sizeof(intset));
-    is = zrealloc(is,sizeof(intset)+size);
-    return is;
-}
-
-/* Search for the position of "value". Return 1 when the value was found and
- * sets "pos" to the position of the value within the intset. Return 0 when
- * the value is not present in the intset and sets "pos" to the position
- * where "value" can be inserted. */
-static uint8_t intsetSearch(intset *is, int64_t value, uint32_t *pos) {
-    int min = 0, max = intrev32ifbe(is->length)-1, mid = -1;
-    int64_t cur = -1;
-
-    /* The value can never be found when the set is empty */
-    if (intrev32ifbe(is->length) == 0) {
-        if (pos) *pos = 0;
-        return 0;
-    } else {
-        /* Check for the case where we know we cannot find the value,
-         * but do know the insert position. */
-        if (value > _intsetGet(is,max)) {
-            if (pos) *pos = intrev32ifbe(is->length);
-            return 0;
-        } else if (value < _intsetGet(is,0)) {
-            if (pos) *pos = 0;
-            return 0;
-        }
-    }
-
-    while(max >= min) {
-        mid = ((unsigned int)min + (unsigned int)max) >> 1;
-        cur = _intsetGet(is,mid);
-        if (value > cur) {
-            min = mid+1;
-        } else if (value < cur) {
-            max = mid-1;
-        } else {
-            break;
-        }
-    }
-
-    if (value == cur) {
-        if (pos) *pos = mid;
-        return 1;
-    } else {
-        if (pos) *pos = min;
-        return 0;
-    }
-}
-
-/* Upgrades the intset to a larger encoding and inserts the given integer. */
-static intset *intsetUpgradeAndAdd(intset *is, int64_t value) {
-    uint8_t curenc = intrev32ifbe(is->encoding);
-    uint8_t newenc = _intsetValueEncoding(value);
-    int length = intrev32ifbe(is->length);
-    int prepend = value < 0 ? 1 : 0;
-
-    /* First set new encoding and resize */
-    is->encoding = intrev32ifbe(newenc);
-    is = intsetResize(is,intrev32ifbe(is->length)+1);
-
-    /* Upgrade back-to-front so we don't overwrite values.
-     * Note that the "prepend" variable is used to make sure we have an empty
-     * space at either the beginning or the end of the intset. */
-    while(length--)
-        _intsetSet(is,length+prepend,_intsetGetEncoded(is,length,curenc));
-
-    /* Set the value at the beginning or the end. */
-    if (prepend)
-        _intsetSet(is,0,value);
-    else
-        _intsetSet(is,intrev32ifbe(is->length),value);
-    is->length = intrev32ifbe(intrev32ifbe(is->length)+1);
-    return is;
-}
-
-static void intsetMoveTail(intset *is, uint32_t from, uint32_t to) {
-    void *src, *dst;
-    uint32_t bytes = intrev32ifbe(is->length)-from;
-    uint32_t encoding = intrev32ifbe(is->encoding);
-
-    if (encoding == INTSET_ENC_INT64) {
-        src = (int64_t*)is->contents+from;
-        dst = (int64_t*)is->contents+to;
-        bytes *= sizeof(int64_t);
-    } else if (encoding == INTSET_ENC_INT32) {
-        src = (int32_t*)is->contents+from;
-        dst = (int32_t*)is->contents+to;
-        bytes *= sizeof(int32_t);
-    } else {
-        src = (int16_t*)is->contents+from;
-        dst = (int16_t*)is->contents+to;
-        bytes *= sizeof(int16_t);
-    }
-    memmove(dst,src,bytes);
-}
-
-/* Insert an integer in the intset */
-intset *intsetAdd(intset *is, int64_t value, uint8_t *success) {
-    uint8_t valenc = _intsetValueEncoding(value);
-    uint32_t pos;
-    if (success) *success = 1;
-
-    /* Upgrade encoding if necessary. If we need to upgrade, we know that
-     * this value should be either appended (if > 0) or prepended (if < 0),
-     * because it lies outside the range of existing values. */
-    if (valenc > intrev32ifbe(is->encoding)) {
-        /* This always succeeds, so we don't need to curry *success. */
-        return intsetUpgradeAndAdd(is,value);
-    } else {
-        /* Abort if the value is already present in the set.
-         * This call will populate "pos" with the right position to insert
-         * the value when it cannot be found. */
-        if (intsetSearch(is,value,&pos)) {
-            if (success) *success = 0;
-            return is;
-        }
-
-        is = intsetResize(is,intrev32ifbe(is->length)+1);
-        if (pos < intrev32ifbe(is->length)) intsetMoveTail(is,pos,pos+1);
-    }
-
-    _intsetSet(is,pos,value);
-    is->length = intrev32ifbe(intrev32ifbe(is->length)+1);
-    return is;
-}
-
-/* Delete integer from intset */
-intset *intsetRemove(intset *is, int64_t value, int *success) {
-    uint8_t valenc = _intsetValueEncoding(value);
-    uint32_t pos;
-    if (success) *success = 0;
-
-    if (valenc <= intrev32ifbe(is->encoding) && intsetSearch(is,value,&pos)) {
-        uint32_t len = intrev32ifbe(is->length);
-
-        /* We know we can delete */
-        if (success) *success = 1;
-
-        /* Overwrite value with tail and update length */
-        if (pos < (len-1)) intsetMoveTail(is,pos+1,pos);
-        is = intsetResize(is,len-1);
-        is->length = intrev32ifbe(len-1);
-    }
-    return is;
-}
-
-/* Determine whether a value belongs to this set */
-uint8_t intsetFind(intset *is, int64_t value) {
-    uint8_t valenc = _intsetValueEncoding(value);
-    return valenc <= intrev32ifbe(is->encoding) && intsetSearch(is,value,NULL);
-}
-
-/* Return random member */
-int64_t intsetRandom(intset *is) {
-    uint32_t len = intrev32ifbe(is->length);
-    assert(len); /* avoid division by zero on corrupt intset payload. */
-    return _intsetGet(is,rand()%len);
-}
-
-/* Get the value at the given position. When this position is
- * out of range the function returns 0, when in range it returns 1. */
-uint8_t intsetGet(intset *is, uint32_t pos, int64_t *value) {
-    if (pos < intrev32ifbe(is->length)) {
-        *value = _intsetGet(is,pos);
-        return 1;
-    }
-    return 0;
-}
-
-/* Return intset length */
-uint32_t intsetLen(const intset *is) {
-    return intrev32ifbe(is->length);
-}
-
-/* Return intset blob size in bytes. */
-size_t intsetBlobLen(intset *is) {
-    return sizeof(intset)+(size_t)intrev32ifbe(is->length)*intrev32ifbe(is->encoding);
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we make sure there are no duplicate or out of order records. */
-int intsetValidateIntegrity(const unsigned char *p, size_t size, int deep) {
-    intset *is = (intset *)p;
-    /* check that we can actually read the header. */
-    if (size < sizeof(*is))
-        return 0;
-
-    uint32_t encoding = intrev32ifbe(is->encoding);
-
-    size_t record_size;
-    if (encoding == INTSET_ENC_INT64) {
-        record_size = INTSET_ENC_INT64;
-    } else if (encoding == INTSET_ENC_INT32) {
-        record_size = INTSET_ENC_INT32;
-    } else if (encoding == INTSET_ENC_INT16){
-        record_size = INTSET_ENC_INT16;
-    } else {
-        return 0;
-    }
-
-    /* check that the size matchies (all records are inside the buffer). */
-    uint32_t count = intrev32ifbe(is->length);
-    if (sizeof(*is) + count*record_size != size)
-        return 0;
-
-    /* check that the set is not empty. */
-    if (count==0)
-        return 0;
-
-    if (!deep)
-        return 1;
-
-    /* check that there are no dup or out of order records. */
-    int64_t prev = _intsetGet(is,0);
-    for (uint32_t i=1; i<count; i++) {
-        int64_t cur = _intsetGet(is,i);
-        if (cur <= prev)
-            return 0;
-        prev = cur;
-    }
-
-    return 1;
-}
-
-#ifdef REDIS_TEST
-#include <sys/time.h>
-#include <time.h>
-
-#if 0
-static void intsetRepr(intset *is) {
-    for (uint32_t i = 0; i < intrev32ifbe(is->length); i++) {
-        printf("%lld\n", (uint64_t)_intsetGet(is,i));
-    }
-    printf("\n");
-}
-
-static void error(char *err) {
-    printf("%s\n", err);
-    exit(1);
-}
-#endif
-
-static void ok(void) {
-    printf("OK\n");
-}
-
-static long long usec(void) {
-    struct timeval tv;
-    gettimeofday(&tv,NULL);
-    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
-}
-
-static intset *createSet(int bits, int size) {
-    uint64_t mask = (1<<bits)-1;
-    uint64_t value;
-    intset *is = intsetNew();
-
-    for (int i = 0; i < size; i++) {
-        if (bits > 32) {
-            value = (rand()*rand()) & mask;
-        } else {
-            value = rand() & mask;
-        }
-        is = intsetAdd(is,value,NULL);
-    }
-    return is;
-}
-
-static void checkConsistency(intset *is) {
-    for (uint32_t i = 0; i < (intrev32ifbe(is->length)-1); i++) {
-        uint32_t encoding = intrev32ifbe(is->encoding);
-
-        if (encoding == INTSET_ENC_INT16) {
-            int16_t *i16 = (int16_t*)is->contents;
-            assert(i16[i] < i16[i+1]);
-        } else if (encoding == INTSET_ENC_INT32) {
-            int32_t *i32 = (int32_t*)is->contents;
-            assert(i32[i] < i32[i+1]);
-        } else {
-            int64_t *i64 = (int64_t*)is->contents;
-            assert(i64[i] < i64[i+1]);
-        }
-    }
-}
-
-#define UNUSED(x) (void)(x)
-int intsetTest(int argc, char **argv, int accurate) {
-    uint8_t success;
-    int i;
-    intset *is;
-    srand(time(NULL));
-
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    printf("Value encodings: "); {
-        assert(_intsetValueEncoding(-32768) == INTSET_ENC_INT16);
-        assert(_intsetValueEncoding(+32767) == INTSET_ENC_INT16);
-        assert(_intsetValueEncoding(-32769) == INTSET_ENC_INT32);
-        assert(_intsetValueEncoding(+32768) == INTSET_ENC_INT32);
-        assert(_intsetValueEncoding(-2147483648) == INTSET_ENC_INT32);
-        assert(_intsetValueEncoding(+2147483647) == INTSET_ENC_INT32);
-        assert(_intsetValueEncoding(-2147483649) == INTSET_ENC_INT64);
-        assert(_intsetValueEncoding(+2147483648) == INTSET_ENC_INT64);
-        assert(_intsetValueEncoding(-9223372036854775808ull) ==
-                    INTSET_ENC_INT64);
-        assert(_intsetValueEncoding(+9223372036854775807ull) ==
-                    INTSET_ENC_INT64);
-        ok();
-    }
-
-    printf("Basic adding: "); {
-        is = intsetNew();
-        is = intsetAdd(is,5,&success); assert(success);
-        is = intsetAdd(is,6,&success); assert(success);
-        is = intsetAdd(is,4,&success); assert(success);
-        is = intsetAdd(is,4,&success); assert(!success);
-        ok();
-        zfree(is);
-    }
-
-    printf("Large number of random adds: "); {
-        uint32_t inserts = 0;
-        is = intsetNew();
-        for (i = 0; i < 1024; i++) {
-            is = intsetAdd(is,rand()%0x800,&success);
-            if (success) inserts++;
-        }
-        assert(intrev32ifbe(is->length) == inserts);
-        checkConsistency(is);
-        ok();
-        zfree(is);
-    }
-
-    printf("Upgrade from int16 to int32: "); {
-        is = intsetNew();
-        is = intsetAdd(is,32,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
-        is = intsetAdd(is,65535,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
-        assert(intsetFind(is,32));
-        assert(intsetFind(is,65535));
-        checkConsistency(is);
-        zfree(is);
-
-        is = intsetNew();
-        is = intsetAdd(is,32,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
-        is = intsetAdd(is,-65535,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
-        assert(intsetFind(is,32));
-        assert(intsetFind(is,-65535));
-        checkConsistency(is);
-        ok();
-        zfree(is);
-    }
-
-    printf("Upgrade from int16 to int64: "); {
-        is = intsetNew();
-        is = intsetAdd(is,32,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
-        is = intsetAdd(is,4294967295,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
-        assert(intsetFind(is,32));
-        assert(intsetFind(is,4294967295));
-        checkConsistency(is);
-        zfree(is);
-
-        is = intsetNew();
-        is = intsetAdd(is,32,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT16);
-        is = intsetAdd(is,-4294967295,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
-        assert(intsetFind(is,32));
-        assert(intsetFind(is,-4294967295));
-        checkConsistency(is);
-        ok();
-        zfree(is);
-    }
-
-    printf("Upgrade from int32 to int64: "); {
-        is = intsetNew();
-        is = intsetAdd(is,65535,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
-        is = intsetAdd(is,4294967295,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
-        assert(intsetFind(is,65535));
-        assert(intsetFind(is,4294967295));
-        checkConsistency(is);
-        zfree(is);
-
-        is = intsetNew();
-        is = intsetAdd(is,65535,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT32);
-        is = intsetAdd(is,-4294967295,NULL);
-        assert(intrev32ifbe(is->encoding) == INTSET_ENC_INT64);
-        assert(intsetFind(is,65535));
-        assert(intsetFind(is,-4294967295));
-        checkConsistency(is);
-        ok();
-        zfree(is);
-    }
-
-    printf("Stress lookups: "); {
-        long num = 100000, size = 10000;
-        int i, bits = 20;
-        long long start;
-        is = createSet(bits,size);
-        checkConsistency(is);
-
-        start = usec();
-        for (i = 0; i < num; i++) intsetSearch(is,rand() % ((1<<bits)-1),NULL);
-        printf("%ld lookups, %ld element set, %lldusec\n",
-               num,size,usec()-start);
-        zfree(is);
-    }
-
-    printf("Stress add+delete: "); {
-        int i, v1, v2;
-        is = intsetNew();
-        for (i = 0; i < 0xffff; i++) {
-            v1 = rand() % 0xfff;
-            is = intsetAdd(is,v1,NULL);
-            assert(intsetFind(is,v1));
-
-            v2 = rand() % 0xfff;
-            is = intsetRemove(is,v2,NULL);
-            assert(!intsetFind(is,v2));
-        }
-        checkConsistency(is);
-        ok();
-        zfree(is);
-    }
-
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/intset.h b/redis-stable/src/intset.h
deleted file mode 100644
index 22ea5feb..00000000
--- a/redis-stable/src/intset.h
+++ /dev/null
@@ -1,55 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __INTSET_H
-#define __INTSET_H
-#include <stdint.h>
-
-typedef struct intset {
-    uint32_t encoding;
-    uint32_t length;
-    int8_t contents[];
-} intset;
-
-intset *intsetNew(void);
-intset *intsetAdd(intset *is, int64_t value, uint8_t *success);
-intset *intsetRemove(intset *is, int64_t value, int *success);
-uint8_t intsetFind(intset *is, int64_t value);
-int64_t intsetRandom(intset *is);
-uint8_t intsetGet(intset *is, uint32_t pos, int64_t *value);
-uint32_t intsetLen(const intset *is);
-size_t intsetBlobLen(intset *is);
-int intsetValidateIntegrity(const unsigned char *is, size_t size, int deep);
-
-#ifdef REDIS_TEST
-int intsetTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif // __INTSET_H
diff --git a/redis-stable/src/latency.c b/redis-stable/src/latency.c
deleted file mode 100644
index a5dfc5a7..00000000
--- a/redis-stable/src/latency.c
+++ /dev/null
@@ -1,658 +0,0 @@
-/* The latency monitor allows to easily observe the sources of latency
- * in a Redis instance using the LATENCY command. Different latency
- * sources are monitored, like disk I/O, execution of commands, fork
- * system call, and so forth.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* Dictionary type for latency events. */
-int dictStringKeyCompare(void *privdata, const void *key1, const void *key2) {
-    UNUSED(privdata);
-    return strcmp(key1,key2) == 0;
-}
-
-uint64_t dictStringHash(const void *key) {
-    return dictGenHashFunction(key, strlen(key));
-}
-
-void dictVanillaFree(void *privdata, void *val);
-
-dictType latencyTimeSeriesDictType = {
-    dictStringHash,             /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictStringKeyCompare,       /* key compare */
-    dictVanillaFree,            /* key destructor */
-    dictVanillaFree,            /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* ------------------------- Utility functions ------------------------------ */
-
-#ifdef __linux__
-#include <sys/prctl.h>
-/* Returns 1 if Transparent Huge Pages support is enabled in the kernel.
- * Otherwise (or if we are unable to check) 0 is returned. */
-int THPIsEnabled(void) {
-    char buf[1024];
-
-    FILE *fp = fopen("/sys/kernel/mm/transparent_hugepage/enabled","r");
-    if (!fp) return 0;
-    if (fgets(buf,sizeof(buf),fp) == NULL) {
-        fclose(fp);
-        return 0;
-    }
-    fclose(fp);
-    return (strstr(buf,"[always]") != NULL) ? 1 : 0;
-}
-
-/* since linux-3.5, kernel supports to set the state of the "THP disable" flag
- * for the calling thread. PR_SET_THP_DISABLE is defined in linux/prctl.h */
-int THPDisable(void) {
-    int ret = -EINVAL;
-
-    if (!server.disable_thp)
-        return ret;
-
-#ifdef PR_SET_THP_DISABLE
-    ret = prctl(PR_SET_THP_DISABLE, 1, 0, 0, 0);
-#endif
-
-    return ret;
-}
-#endif
-
-/* Report the amount of AnonHugePages in smap, in bytes. If the return
- * value of the function is non-zero, the process is being targeted by
- * THP support, and is likely to have memory usage / latency issues. */
-int THPGetAnonHugePagesSize(void) {
-    return zmalloc_get_smap_bytes_by_field("AnonHugePages:",-1);
-}
-
-/* ---------------------------- Latency API --------------------------------- */
-
-/* Latency monitor initialization. We just need to create the dictionary
- * of time series, each time series is created on demand in order to avoid
- * having a fixed list to maintain. */
-void latencyMonitorInit(void) {
-    server.latency_events = dictCreate(&latencyTimeSeriesDictType,NULL);
-}
-
-/* Add the specified sample to the specified time series "event".
- * This function is usually called via latencyAddSampleIfNeeded(), that
- * is a macro that only adds the sample if the latency is higher than
- * server.latency_monitor_threshold. */
-void latencyAddSample(const char *event, mstime_t latency) {
-    struct latencyTimeSeries *ts = dictFetchValue(server.latency_events,event);
-    time_t now = time(NULL);
-    int prev;
-
-    /* Create the time series if it does not exist. */
-    if (ts == NULL) {
-        ts = zmalloc(sizeof(*ts));
-        ts->idx = 0;
-        ts->max = 0;
-        memset(ts->samples,0,sizeof(ts->samples));
-        dictAdd(server.latency_events,zstrdup(event),ts);
-    }
-
-    if (latency > ts->max) ts->max = latency;
-
-    /* If the previous sample is in the same second, we update our old sample
-     * if this latency is > of the old one, or just return. */
-    prev = (ts->idx + LATENCY_TS_LEN - 1) % LATENCY_TS_LEN;
-    if (ts->samples[prev].time == now) {
-        if (latency > ts->samples[prev].latency)
-            ts->samples[prev].latency = latency;
-        return;
-    }
-
-    ts->samples[ts->idx].time = time(NULL);
-    ts->samples[ts->idx].latency = latency;
-
-    ts->idx++;
-    if (ts->idx == LATENCY_TS_LEN) ts->idx = 0;
-}
-
-/* Reset data for the specified event, or all the events data if 'event' is
- * NULL.
- *
- * Note: this is O(N) even when event_to_reset is not NULL because makes
- * the code simpler and we have a small fixed max number of events. */
-int latencyResetEvent(char *event_to_reset) {
-    dictIterator *di;
-    dictEntry *de;
-    int resets = 0;
-
-    di = dictGetSafeIterator(server.latency_events);
-    while((de = dictNext(di)) != NULL) {
-        char *event = dictGetKey(de);
-
-        if (event_to_reset == NULL || strcasecmp(event,event_to_reset) == 0) {
-            dictDelete(server.latency_events, event);
-            resets++;
-        }
-    }
-    dictReleaseIterator(di);
-    return resets;
-}
-
-/* ------------------------ Latency reporting (doctor) ---------------------- */
-
-/* Analyze the samples available for a given event and return a structure
- * populate with different metrics, average, MAD, min, max, and so forth.
- * Check latency.h definition of struct latencyStats for more info.
- * If the specified event has no elements the structure is populate with
- * zero values. */
-void analyzeLatencyForEvent(char *event, struct latencyStats *ls) {
-    struct latencyTimeSeries *ts = dictFetchValue(server.latency_events,event);
-    int j;
-    uint64_t sum;
-
-    ls->all_time_high = ts ? ts->max : 0;
-    ls->avg = 0;
-    ls->min = 0;
-    ls->max = 0;
-    ls->mad = 0;
-    ls->samples = 0;
-    ls->period = 0;
-    if (!ts) return;
-
-    /* First pass, populate everything but the MAD. */
-    sum = 0;
-    for (j = 0; j < LATENCY_TS_LEN; j++) {
-        if (ts->samples[j].time == 0) continue;
-        ls->samples++;
-        if (ls->samples == 1) {
-            ls->min = ls->max = ts->samples[j].latency;
-        } else {
-            if (ls->min > ts->samples[j].latency)
-                ls->min = ts->samples[j].latency;
-            if (ls->max < ts->samples[j].latency)
-                ls->max = ts->samples[j].latency;
-        }
-        sum += ts->samples[j].latency;
-
-        /* Track the oldest event time in ls->period. */
-        if (ls->period == 0 || ts->samples[j].time < ls->period)
-            ls->period = ts->samples[j].time;
-    }
-
-    /* So far avg is actually the sum of the latencies, and period is
-     * the oldest event time. We need to make the first an average and
-     * the second a range of seconds. */
-    if (ls->samples) {
-        ls->avg = sum / ls->samples;
-        ls->period = time(NULL) - ls->period;
-        if (ls->period == 0) ls->period = 1;
-    }
-
-    /* Second pass, compute MAD. */
-    sum = 0;
-    for (j = 0; j < LATENCY_TS_LEN; j++) {
-        int64_t delta;
-
-        if (ts->samples[j].time == 0) continue;
-        delta = (int64_t)ls->avg - ts->samples[j].latency;
-        if (delta < 0) delta = -delta;
-        sum += delta;
-    }
-    if (ls->samples) ls->mad = sum / ls->samples;
-}
-
-/* Create a human readable report of latency events for this Redis instance. */
-sds createLatencyReport(void) {
-    sds report = sdsempty();
-    int advise_better_vm = 0;       /* Better virtual machines. */
-    int advise_slowlog_enabled = 0; /* Enable slowlog. */
-    int advise_slowlog_tuning = 0;  /* Reconfigure slowlog. */
-    int advise_slowlog_inspect = 0; /* Check your slowlog. */
-    int advise_disk_contention = 0; /* Try to lower disk contention. */
-    int advise_scheduler = 0;       /* Intrinsic latency. */
-    int advise_data_writeback = 0;  /* data=writeback. */
-    int advise_no_appendfsync = 0;  /* don't fsync during rewrites. */
-    int advise_local_disk = 0;      /* Avoid remote disks. */
-    int advise_ssd = 0;             /* Use an SSD drive. */
-    int advise_write_load_info = 0; /* Print info about AOF and write load. */
-    int advise_hz = 0;              /* Use higher HZ. */
-    int advise_large_objects = 0;   /* Deletion of large objects. */
-    int advise_mass_eviction = 0;   /* Avoid mass eviction of keys. */
-    int advise_relax_fsync_policy = 0; /* appendfsync always is slow. */
-    int advise_disable_thp = 0;     /* AnonHugePages detected. */
-    int advices = 0;
-
-    /* Return ASAP if the latency engine is disabled and it looks like it
-     * was never enabled so far. */
-    if (dictSize(server.latency_events) == 0 &&
-        server.latency_monitor_threshold == 0)
-    {
-        report = sdscat(report,"I'm sorry, Dave, I can't do that. Latency monitoring is disabled in this Redis instance. You may use \"CONFIG SET latency-monitor-threshold <milliseconds>.\" in order to enable it. If we weren't in a deep space mission I'd suggest to take a look at https://redis.io/topics/latency-monitor.\n");
-        return report;
-    }
-
-    /* Show all the events stats and add for each event some event-related
-     * comment depending on the values. */
-    dictIterator *di;
-    dictEntry *de;
-    int eventnum = 0;
-
-    di = dictGetSafeIterator(server.latency_events);
-    while((de = dictNext(di)) != NULL) {
-        char *event = dictGetKey(de);
-        struct latencyTimeSeries *ts = dictGetVal(de);
-        struct latencyStats ls;
-
-        if (ts == NULL) continue;
-        eventnum++;
-        if (eventnum == 1) {
-            report = sdscat(report,"Dave, I have observed latency spikes in this Redis instance. You don't mind talking about it, do you Dave?\n\n");
-        }
-        analyzeLatencyForEvent(event,&ls);
-
-        report = sdscatprintf(report,
-            "%d. %s: %d latency spikes (average %lums, mean deviation %lums, period %.2f sec). Worst all time event %lums.",
-            eventnum, event,
-            ls.samples,
-            (unsigned long) ls.avg,
-            (unsigned long) ls.mad,
-            (double) ls.period/ls.samples,
-            (unsigned long) ts->max);
-
-        /* Fork */
-        if (!strcasecmp(event,"fork")) {
-            char *fork_quality;
-            if (server.stat_fork_rate < 10) {
-                fork_quality = "terrible";
-                advise_better_vm = 1;
-                advices++;
-            } else if (server.stat_fork_rate < 25) {
-                fork_quality = "poor";
-                advise_better_vm = 1;
-                advices++;
-            } else if (server.stat_fork_rate < 100) {
-                fork_quality = "good";
-            } else {
-                fork_quality = "excellent";
-            }
-            report = sdscatprintf(report,
-                " Fork rate is %.2f GB/sec (%s).", server.stat_fork_rate,
-                fork_quality);
-        }
-
-        /* Potentially commands. */
-        if (!strcasecmp(event,"command")) {
-            if (server.slowlog_log_slower_than < 0) {
-                advise_slowlog_enabled = 1;
-                advices++;
-            } else if (server.slowlog_log_slower_than/1000 >
-                       server.latency_monitor_threshold)
-            {
-                advise_slowlog_tuning = 1;
-                advices++;
-            }
-            advise_slowlog_inspect = 1;
-            advise_large_objects = 1;
-            advices += 2;
-        }
-
-        /* fast-command. */
-        if (!strcasecmp(event,"fast-command")) {
-            advise_scheduler = 1;
-            advices++;
-        }
-
-        /* AOF and I/O. */
-        if (!strcasecmp(event,"aof-write-pending-fsync")) {
-            advise_local_disk = 1;
-            advise_disk_contention = 1;
-            advise_ssd = 1;
-            advise_data_writeback = 1;
-            advices += 4;
-        }
-
-        if (!strcasecmp(event,"aof-write-active-child")) {
-            advise_no_appendfsync = 1;
-            advise_data_writeback = 1;
-            advise_ssd = 1;
-            advices += 3;
-        }
-
-        if (!strcasecmp(event,"aof-write-alone")) {
-            advise_local_disk = 1;
-            advise_data_writeback = 1;
-            advise_ssd = 1;
-            advices += 3;
-        }
-
-        if (!strcasecmp(event,"aof-fsync-always")) {
-            advise_relax_fsync_policy = 1;
-            advices++;
-        }
-
-        if (!strcasecmp(event,"aof-fstat") ||
-            !strcasecmp(event,"rdb-unlink-temp-file")) {
-            advise_disk_contention = 1;
-            advise_local_disk = 1;
-            advices += 2;
-        }
-
-        if (!strcasecmp(event,"aof-rewrite-diff-write") ||
-            !strcasecmp(event,"aof-rename")) {
-            advise_write_load_info = 1;
-            advise_data_writeback = 1;
-            advise_ssd = 1;
-            advise_local_disk = 1;
-            advices += 4;
-        }
-
-        /* Expire cycle. */
-        if (!strcasecmp(event,"expire-cycle")) {
-            advise_hz = 1;
-            advise_large_objects = 1;
-            advices += 2;
-        }
-
-        /* Eviction cycle. */
-        if (!strcasecmp(event,"eviction-del")) {
-            advise_large_objects = 1;
-            advices++;
-        }
-
-        if (!strcasecmp(event,"eviction-cycle")) {
-            advise_mass_eviction = 1;
-            advices++;
-        }
-
-        report = sdscatlen(report,"\n",1);
-    }
-    dictReleaseIterator(di);
-
-    /* Add non event based advices. */
-    if (THPGetAnonHugePagesSize() > 0) {
-        advise_disable_thp = 1;
-        advices++;
-    }
-
-    if (eventnum == 0 && advices == 0) {
-        report = sdscat(report,"Dave, no latency spike was observed during the lifetime of this Redis instance, not in the slightest bit. I honestly think you ought to sit down calmly, take a stress pill, and think things over.\n");
-    } else if (eventnum > 0 && advices == 0) {
-        report = sdscat(report,"\nWhile there are latency events logged, I'm not able to suggest any easy fix. Please use the Redis community to get some help, providing this report in your help request.\n");
-    } else {
-        /* Add all the suggestions accumulated so far. */
-
-        /* Better VM. */
-        report = sdscat(report,"\nI have a few advices for you:\n\n");
-        if (advise_better_vm) {
-            report = sdscat(report,"- If you are using a virtual machine, consider upgrading it with a faster one using a hypervisior that provides less latency during fork() calls. Xen is known to have poor fork() performance. Even in the context of the same VM provider, certain kinds of instances can execute fork faster than others.\n");
-        }
-
-        /* Slow log. */
-        if (advise_slowlog_enabled) {
-            report = sdscatprintf(report,"- There are latency issues with potentially slow commands you are using. Try to enable the Slow Log Redis feature using the command 'CONFIG SET slowlog-log-slower-than %llu'. If the Slow log is disabled Redis is not able to log slow commands execution for you.\n", (unsigned long long)server.latency_monitor_threshold*1000);
-        }
-
-        if (advise_slowlog_tuning) {
-            report = sdscatprintf(report,"- Your current Slow Log configuration only logs events that are slower than your configured latency monitor threshold. Please use 'CONFIG SET slowlog-log-slower-than %llu'.\n", (unsigned long long)server.latency_monitor_threshold*1000);
-        }
-
-        if (advise_slowlog_inspect) {
-            report = sdscat(report,"- Check your Slow Log to understand what are the commands you are running which are too slow to execute. Please check https://redis.io/commands/slowlog for more information.\n");
-        }
-
-        /* Intrinsic latency. */
-        if (advise_scheduler) {
-            report = sdscat(report,"- The system is slow to execute Redis code paths not containing system calls. This usually means the system does not provide Redis CPU time to run for long periods. You should try to:\n"
-            "  1) Lower the system load.\n"
-            "  2) Use a computer / VM just for Redis if you are running other software in the same system.\n"
-            "  3) Check if you have a \"noisy neighbour\" problem.\n"
-            "  4) Check with 'redis-cli --intrinsic-latency 100' what is the intrinsic latency in your system.\n"
-            "  5) Check if the problem is allocator-related by recompiling Redis with MALLOC=libc, if you are using Jemalloc. However this may create fragmentation problems.\n");
-        }
-
-        /* AOF / Disk latency. */
-        if (advise_local_disk) {
-            report = sdscat(report,"- It is strongly advised to use local disks for persistence, especially if you are using AOF. Remote disks provided by platform-as-a-service providers are known to be slow.\n");
-        }
-
-        if (advise_ssd) {
-            report = sdscat(report,"- SSD disks are able to reduce fsync latency, and total time needed for snapshotting and AOF log rewriting (resulting in smaller memory usage and smaller final AOF rewrite buffer flushes). With extremely high write load SSD disks can be a good option. However Redis should perform reasonably with high load using normal disks. Use this advice as a last resort.\n");
-        }
-
-        if (advise_data_writeback) {
-            report = sdscat(report,"- Mounting ext3/4 filesystems with data=writeback can provide a performance boost compared to data=ordered, however this mode of operation provides less guarantees, and sometimes it can happen that after a hard crash the AOF file will have a half-written command at the end and will require to be repaired before Redis restarts.\n");
-        }
-
-        if (advise_disk_contention) {
-            report = sdscat(report,"- Try to lower the disk contention. This is often caused by other disk intensive processes running in the same computer (including other Redis instances).\n");
-        }
-
-        if (advise_no_appendfsync) {
-            report = sdscat(report,"- Assuming from the point of view of data safety this is viable in your environment, you could try to enable the 'no-appendfsync-on-rewrite' option, so that fsync will not be performed while there is a child rewriting the AOF file or producing an RDB file (the moment where there is high disk contention).\n");
-        }
-
-        if (advise_relax_fsync_policy && server.aof_fsync == AOF_FSYNC_ALWAYS) {
-            report = sdscat(report,"- Your fsync policy is set to 'always'. It is very hard to get good performances with such a setup, if possible try to relax the fsync policy to 'onesec'.\n");
-        }
-
-        if (advise_write_load_info) {
-            report = sdscat(report,"- Latency during the AOF atomic rename operation or when the final difference is flushed to the AOF file at the end of the rewrite, sometimes is caused by very high write load, causing the AOF buffer to get very large. If possible try to send less commands to accomplish the same work, or use Lua scripts to group multiple operations into a single EVALSHA call.\n");
-        }
-
-        if (advise_hz && server.hz < 100) {
-            report = sdscat(report,"- In order to make the Redis keys expiring process more incremental, try to set the 'hz' configuration parameter to 100 using 'CONFIG SET hz 100'.\n");
-        }
-
-        if (advise_large_objects) {
-            report = sdscat(report,"- Deleting, expiring or evicting (because of maxmemory policy) large objects is a blocking operation. If you have very large objects that are often deleted, expired, or evicted, try to fragment those objects into multiple smaller objects.\n");
-        }
-
-        if (advise_mass_eviction) {
-            report = sdscat(report,"- Sudden changes to the 'maxmemory' setting via 'CONFIG SET', or allocation of large objects via sets or sorted sets intersections, STORE option of SORT, Redis Cluster large keys migrations (RESTORE command), may create sudden memory pressure forcing the server to block trying to evict keys. \n");
-        }
-
-        if (advise_disable_thp) {
-            report = sdscat(report,"- I detected a non zero amount of anonymous huge pages used by your process. This creates very serious latency events in different conditions, especially when Redis is persisting on disk. To disable THP support use the command 'echo never > /sys/kernel/mm/transparent_hugepage/enabled', make sure to also add it into /etc/rc.local so that the command will be executed again after a reboot. Note that even if you have already disabled THP, you still need to restart the Redis process to get rid of the huge pages already created.\n");
-        }
-    }
-
-    return report;
-}
-
-/* ---------------------- Latency command implementation -------------------- */
-
-/* latencyCommand() helper to produce a time-delay reply for all the samples
- * in memory for the specified time series. */
-void latencyCommandReplyWithSamples(client *c, struct latencyTimeSeries *ts) {
-    void *replylen = addReplyDeferredLen(c);
-    int samples = 0, j;
-
-    for (j = 0; j < LATENCY_TS_LEN; j++) {
-        int i = (ts->idx + j) % LATENCY_TS_LEN;
-
-        if (ts->samples[i].time == 0) continue;
-        addReplyArrayLen(c,2);
-        addReplyLongLong(c,ts->samples[i].time);
-        addReplyLongLong(c,ts->samples[i].latency);
-        samples++;
-    }
-    setDeferredArrayLen(c,replylen,samples);
-}
-
-/* latencyCommand() helper to produce the reply for the LATEST subcommand,
- * listing the last latency sample for every event type registered so far. */
-void latencyCommandReplyWithLatestEvents(client *c) {
-    dictIterator *di;
-    dictEntry *de;
-
-    addReplyArrayLen(c,dictSize(server.latency_events));
-    di = dictGetIterator(server.latency_events);
-    while((de = dictNext(di)) != NULL) {
-        char *event = dictGetKey(de);
-        struct latencyTimeSeries *ts = dictGetVal(de);
-        int last = (ts->idx + LATENCY_TS_LEN - 1) % LATENCY_TS_LEN;
-
-        addReplyArrayLen(c,4);
-        addReplyBulkCString(c,event);
-        addReplyLongLong(c,ts->samples[last].time);
-        addReplyLongLong(c,ts->samples[last].latency);
-        addReplyLongLong(c,ts->max);
-    }
-    dictReleaseIterator(di);
-}
-
-#define LATENCY_GRAPH_COLS 80
-sds latencyCommandGenSparkeline(char *event, struct latencyTimeSeries *ts) {
-    int j;
-    struct sequence *seq = createSparklineSequence();
-    sds graph = sdsempty();
-    uint32_t min = 0, max = 0;
-
-    for (j = 0; j < LATENCY_TS_LEN; j++) {
-        int i = (ts->idx + j) % LATENCY_TS_LEN;
-        int elapsed;
-        char buf[64];
-
-        if (ts->samples[i].time == 0) continue;
-        /* Update min and max. */
-        if (seq->length == 0) {
-            min = max = ts->samples[i].latency;
-        } else {
-            if (ts->samples[i].latency > max) max = ts->samples[i].latency;
-            if (ts->samples[i].latency < min) min = ts->samples[i].latency;
-        }
-        /* Use as label the number of seconds / minutes / hours / days
-         * ago the event happened. */
-        elapsed = time(NULL) - ts->samples[i].time;
-        if (elapsed < 60)
-            snprintf(buf,sizeof(buf),"%ds",elapsed);
-        else if (elapsed < 3600)
-            snprintf(buf,sizeof(buf),"%dm",elapsed/60);
-        else if (elapsed < 3600*24)
-            snprintf(buf,sizeof(buf),"%dh",elapsed/3600);
-        else
-            snprintf(buf,sizeof(buf),"%dd",elapsed/(3600*24));
-        sparklineSequenceAddSample(seq,ts->samples[i].latency,buf);
-    }
-
-    graph = sdscatprintf(graph,
-        "%s - high %lu ms, low %lu ms (all time high %lu ms)\n", event,
-        (unsigned long) max, (unsigned long) min, (unsigned long) ts->max);
-    for (j = 0; j < LATENCY_GRAPH_COLS; j++)
-        graph = sdscatlen(graph,"-",1);
-    graph = sdscatlen(graph,"\n",1);
-    graph = sparklineRender(graph,seq,LATENCY_GRAPH_COLS,4,SPARKLINE_FILL);
-    freeSparklineSequence(seq);
-    return graph;
-}
-
-/* LATENCY command implementations.
- *
- * LATENCY HISTORY: return time-latency samples for the specified event.
- * LATENCY LATEST: return the latest latency for all the events classes.
- * LATENCY DOCTOR: returns a human readable analysis of instance latency.
- * LATENCY GRAPH: provide an ASCII graph of the latency of the specified event.
- * LATENCY RESET: reset data of a specified event or all the data if no event provided.
- */
-void latencyCommand(client *c) {
-    struct latencyTimeSeries *ts;
-
-    if (!strcasecmp(c->argv[1]->ptr,"history") && c->argc == 3) {
-        /* LATENCY HISTORY <event> */
-        ts = dictFetchValue(server.latency_events,c->argv[2]->ptr);
-        if (ts == NULL) {
-            addReplyArrayLen(c,0);
-        } else {
-            latencyCommandReplyWithSamples(c,ts);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"graph") && c->argc == 3) {
-        /* LATENCY GRAPH <event> */
-        sds graph;
-        dictEntry *de;
-        char *event;
-
-        de = dictFind(server.latency_events,c->argv[2]->ptr);
-        if (de == NULL) goto nodataerr;
-        ts = dictGetVal(de);
-        event = dictGetKey(de);
-
-        graph = latencyCommandGenSparkeline(event,ts);
-        addReplyVerbatim(c,graph,sdslen(graph),"txt");
-        sdsfree(graph);
-    } else if (!strcasecmp(c->argv[1]->ptr,"latest") && c->argc == 2) {
-        /* LATENCY LATEST */
-        latencyCommandReplyWithLatestEvents(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"doctor") && c->argc == 2) {
-        /* LATENCY DOCTOR */
-        sds report = createLatencyReport();
-
-        addReplyVerbatim(c,report,sdslen(report),"txt");
-        sdsfree(report);
-    } else if (!strcasecmp(c->argv[1]->ptr,"reset") && c->argc >= 2) {
-        /* LATENCY RESET */
-        if (c->argc == 2) {
-            addReplyLongLong(c,latencyResetEvent(NULL));
-        } else {
-            int j, resets = 0;
-
-            for (j = 2; j < c->argc; j++)
-                resets += latencyResetEvent(c->argv[j]->ptr);
-            addReplyLongLong(c,resets);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"help") && c->argc == 2) {
-        const char *help[] = {
-"DOCTOR",
-"    Return a human readable latency analysis report.",
-"GRAPH <event>",
-"    Return an ASCII latency graph for the <event> class.",
-"HISTORY <event>",
-"    Return time-latency samples for the <event> class.",
-"LATEST",
-"    Return the latest latency samples for all events.",
-"RESET [<event> ...]",
-"    Reset latency data of one or more <event> classes.",
-"    (default: reset all data for all event classes)",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-    return;
-
-nodataerr:
-    /* Common error when the user asks for an event we have no latency
-     * information about. */
-    addReplyErrorFormat(c,
-        "No samples available for event '%s'", (char*) c->argv[2]->ptr);
-}
-
diff --git a/redis-stable/src/latency.h b/redis-stable/src/latency.h
deleted file mode 100644
index b17f403a..00000000
--- a/redis-stable/src/latency.h
+++ /dev/null
@@ -1,94 +0,0 @@
-/* latency.h -- latency monitor API header file
- * See latency.c for more information.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2014, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __LATENCY_H
-#define __LATENCY_H
-
-#define LATENCY_TS_LEN 160 /* History length for every monitored event. */
-
-/* Representation of a latency sample: the sampling time and the latency
- * observed in milliseconds. */
-struct latencySample {
-    int32_t time; /* We don't use time_t to force 4 bytes usage everywhere. */
-    uint32_t latency; /* Latency in milliseconds. */
-};
-
-/* The latency time series for a given event. */
-struct latencyTimeSeries {
-    int idx; /* Index of the next sample to store. */
-    uint32_t max; /* Max latency observed for this event. */
-    struct latencySample samples[LATENCY_TS_LEN]; /* Latest history. */
-};
-
-/* Latency statistics structure. */
-struct latencyStats {
-    uint32_t all_time_high; /* Absolute max observed since latest reset. */
-    uint32_t avg;           /* Average of current samples. */
-    uint32_t min;           /* Min of current samples. */
-    uint32_t max;           /* Max of current samples. */
-    uint32_t mad;           /* Mean absolute deviation. */
-    uint32_t samples;       /* Number of non-zero samples. */
-    time_t period;          /* Number of seconds since first event and now. */
-};
-
-void latencyMonitorInit(void);
-void latencyAddSample(const char *event, mstime_t latency);
-int THPIsEnabled(void);
-int THPDisable(void);
-
-/* Latency monitoring macros. */
-
-/* Start monitoring an event. We just set the current time. */
-#define latencyStartMonitor(var) if (server.latency_monitor_threshold) { \
-    var = mstime(); \
-} else { \
-    var = 0; \
-}
-
-/* End monitoring an event, compute the difference with the current time
- * to check the amount of time elapsed. */
-#define latencyEndMonitor(var) if (server.latency_monitor_threshold) { \
-    var = mstime() - var; \
-}
-
-/* Add the sample only if the elapsed time is >= to the configured threshold. */
-#define latencyAddSampleIfNeeded(event,var) \
-    if (server.latency_monitor_threshold && \
-        (var) >= server.latency_monitor_threshold) \
-          latencyAddSample((event),(var));
-
-/* Remove time from a nested event. */
-#define latencyRemoveNestedEvent(event_var,nested_var) \
-    event_var += nested_var;
-
-#endif /* __LATENCY_H */
diff --git a/redis-stable/src/lazyfree.c b/redis-stable/src/lazyfree.c
deleted file mode 100644
index 180a4349..00000000
--- a/redis-stable/src/lazyfree.c
+++ /dev/null
@@ -1,231 +0,0 @@
-#include "server.h"
-#include "bio.h"
-#include "atomicvar.h"
-#include "cluster.h"
-
-static redisAtomic size_t lazyfree_objects = 0;
-static redisAtomic size_t lazyfreed_objects = 0;
-
-/* Release objects from the lazyfree thread. It's just decrRefCount()
- * updating the count of objects to release. */
-void lazyfreeFreeObject(void *args[]) {
-    robj *o = (robj *) args[0];
-    decrRefCount(o);
-    atomicDecr(lazyfree_objects,1);
-    atomicIncr(lazyfreed_objects,1);
-}
-
-/* Release a database from the lazyfree thread. The 'db' pointer is the
- * database which was substituted with a fresh one in the main thread
- * when the database was logically deleted. */
-void lazyfreeFreeDatabase(void *args[]) {
-    dict *ht1 = (dict *) args[0];
-    dict *ht2 = (dict *) args[1];
-
-    size_t numkeys = dictSize(ht1);
-    dictRelease(ht1);
-    dictRelease(ht2);
-    atomicDecr(lazyfree_objects,numkeys);
-    atomicIncr(lazyfreed_objects,numkeys);
-}
-
-/* Release the skiplist mapping Redis Cluster keys to slots in the
- * lazyfree thread. */
-void lazyfreeFreeSlotsMap(void *args[]) {
-    rax *rt = args[0];
-    size_t len = rt->numele;
-    raxFree(rt);
-    atomicDecr(lazyfree_objects,len);
-    atomicIncr(lazyfreed_objects,len);
-}
-
-/* Release the key tracking table. */
-void lazyFreeTrackingTable(void *args[]) {
-    rax *rt = args[0];
-    size_t len = rt->numele;
-    freeTrackingRadixTree(rt);
-    atomicDecr(lazyfree_objects,len);
-    atomicIncr(lazyfreed_objects,len);
-}
-
-void lazyFreeLuaScripts(void *args[]) {
-    dict *lua_scripts = args[0];
-    long long len = dictSize(lua_scripts);
-    dictRelease(lua_scripts);
-    atomicDecr(lazyfree_objects,len);
-    atomicIncr(lazyfreed_objects,len);
-}
-
-/* Return the number of currently pending objects to free. */
-size_t lazyfreeGetPendingObjectsCount(void) {
-    size_t aux;
-    atomicGet(lazyfree_objects,aux);
-    return aux;
-}
-
-/* Return the number of objects that have been freed. */
-size_t lazyfreeGetFreedObjectsCount(void) {
-    size_t aux;
-    atomicGet(lazyfreed_objects,aux);
-    return aux;
-}
-
-/* Return the amount of work needed in order to free an object.
- * The return value is not always the actual number of allocations the
- * object is composed of, but a number proportional to it.
- *
- * For strings the function always returns 1.
- *
- * For aggregated objects represented by hash tables or other data structures
- * the function just returns the number of elements the object is composed of.
- *
- * Objects composed of single allocations are always reported as having a
- * single item even if they are actually logical composed of multiple
- * elements.
- *
- * For lists the function returns the number of elements in the quicklist
- * representing the list. */
-size_t lazyfreeGetFreeEffort(robj *key, robj *obj) {
-    if (obj->type == OBJ_LIST) {
-        quicklist *ql = obj->ptr;
-        return ql->len;
-    } else if (obj->type == OBJ_SET && obj->encoding == OBJ_ENCODING_HT) {
-        dict *ht = obj->ptr;
-        return dictSize(ht);
-    } else if (obj->type == OBJ_ZSET && obj->encoding == OBJ_ENCODING_SKIPLIST){
-        zset *zs = obj->ptr;
-        return zs->zsl->length;
-    } else if (obj->type == OBJ_HASH && obj->encoding == OBJ_ENCODING_HT) {
-        dict *ht = obj->ptr;
-        return dictSize(ht);
-    } else if (obj->type == OBJ_STREAM) {
-        size_t effort = 0;
-        stream *s = obj->ptr;
-
-        /* Make a best effort estimate to maintain constant runtime. Every macro
-         * node in the Stream is one allocation. */
-        effort += s->rax->numnodes;
-
-        /* Every consumer group is an allocation and so are the entries in its
-         * PEL. We use size of the first group's PEL as an estimate for all
-         * others. */
-        if (s->cgroups && raxSize(s->cgroups)) {
-            raxIterator ri;
-            streamCG *cg;
-            raxStart(&ri,s->cgroups);
-            raxSeek(&ri,"^",NULL,0);
-            /* There must be at least one group so the following should always
-             * work. */
-            serverAssert(raxNext(&ri));
-            cg = ri.data;
-            effort += raxSize(s->cgroups)*(1+raxSize(cg->pel));
-            raxStop(&ri);
-        }
-        return effort;
-    } else if (obj->type == OBJ_MODULE) {
-        moduleValue *mv = obj->ptr;
-        moduleType *mt = mv->type;
-        if (mt->free_effort != NULL) {
-            size_t effort  = mt->free_effort(key,mv->value);
-            /* If the module's free_effort returns 0, it will use asynchronous free
-             memory by default */
-            return effort == 0 ? ULONG_MAX : effort;
-        } else {
-            return 1;
-        }
-    } else {
-        return 1; /* Everything else is a single allocation. */
-    }
-}
-
-/* Delete a key, value, and associated expiration entry if any, from the DB.
- * If there are enough allocations to free the value object may be put into
- * a lazy free list instead of being freed synchronously. The lazy free list
- * will be reclaimed in a different bio.c thread. */
-#define LAZYFREE_THRESHOLD 64
-int dbAsyncDelete(redisDb *db, robj *key) {
-    /* Deleting an entry from the expires dict will not free the sds of
-     * the key, because it is shared with the main dictionary. */
-    if (dictSize(db->expires) > 0) dictDelete(db->expires,key->ptr);
-
-    /* If the value is composed of a few allocations, to free in a lazy way
-     * is actually just slower... So under a certain limit we just free
-     * the object synchronously. */
-    dictEntry *de = dictUnlink(db->dict,key->ptr);
-    if (de) {
-        robj *val = dictGetVal(de);
-
-        /* Tells the module that the key has been unlinked from the database. */
-        moduleNotifyKeyUnlink(key,val);
-
-        size_t free_effort = lazyfreeGetFreeEffort(key,val);
-
-        /* If releasing the object is too much work, do it in the background
-         * by adding the object to the lazy free list.
-         * Note that if the object is shared, to reclaim it now it is not
-         * possible. This rarely happens, however sometimes the implementation
-         * of parts of the Redis core may call incrRefCount() to protect
-         * objects, and then call dbDelete(). In this case we'll fall
-         * through and reach the dictFreeUnlinkedEntry() call, that will be
-         * equivalent to just calling decrRefCount(). */
-        if (free_effort > LAZYFREE_THRESHOLD && val->refcount == 1) {
-            atomicIncr(lazyfree_objects,1);
-            bioCreateLazyFreeJob(lazyfreeFreeObject,1, val);
-            dictSetVal(db->dict,de,NULL);
-        }
-    }
-
-    /* Release the key-val pair, or just the key if we set the val
-     * field to NULL in order to lazy free it later. */
-    if (de) {
-        dictFreeUnlinkedEntry(db->dict,de);
-        if (server.cluster_enabled) slotToKeyDel(key->ptr);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Free an object, if the object is huge enough, free it in async way. */
-void freeObjAsync(robj *key, robj *obj) {
-    size_t free_effort = lazyfreeGetFreeEffort(key,obj);
-    if (free_effort > LAZYFREE_THRESHOLD && obj->refcount == 1) {
-        atomicIncr(lazyfree_objects,1);
-        bioCreateLazyFreeJob(lazyfreeFreeObject,1,obj);
-    } else {
-        decrRefCount(obj);
-    }
-}
-
-/* Empty a Redis DB asynchronously. What the function does actually is to
- * create a new empty set of hash tables and scheduling the old ones for
- * lazy freeing. */
-void emptyDbAsync(redisDb *db) {
-    dict *oldht1 = db->dict, *oldht2 = db->expires;
-    db->dict = dictCreate(&dbDictType,NULL);
-    db->expires = dictCreate(&dbExpiresDictType,NULL);
-    atomicIncr(lazyfree_objects,dictSize(oldht1));
-    bioCreateLazyFreeJob(lazyfreeFreeDatabase,2,oldht1,oldht2);
-}
-
-/* Release the radix tree mapping Redis Cluster keys to slots asynchronously. */
-void freeSlotsToKeysMapAsync(rax *rt) {
-    atomicIncr(lazyfree_objects,rt->numele);
-    bioCreateLazyFreeJob(lazyfreeFreeSlotsMap,1,rt);
-}
-
-/* Free an object, if the object is huge enough, free it in async way. */
-void freeTrackingRadixTreeAsync(rax *tracking) {
-    atomicIncr(lazyfree_objects,tracking->numele);
-    bioCreateLazyFreeJob(lazyFreeTrackingTable,1,tracking);
-}
-
-/* Free lua_scripts dict, if the dict is huge enough, free it in async way. */
-void freeLuaScriptsAsync(dict *lua_scripts) {
-    if (dictSize(lua_scripts) > LAZYFREE_THRESHOLD) {
-        atomicIncr(lazyfree_objects,dictSize(lua_scripts));
-        bioCreateLazyFreeJob(lazyFreeLuaScripts,1,lua_scripts);
-    } else {
-        dictRelease(lua_scripts);
-    }
-}
diff --git a/redis-stable/src/listpack.c b/redis-stable/src/listpack.c
deleted file mode 100644
index 8424da87..00000000
--- a/redis-stable/src/listpack.c
+++ /dev/null
@@ -1,965 +0,0 @@
-/* Listpack -- A lists of strings serialization format
- *
- * This file implements the specification you can find at:
- *
- *  https://github.com/antirez/listpack
- *
- * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2020, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdint.h>
-#include <limits.h>
-#include <sys/types.h>
-#include <stdlib.h>
-#include <string.h>
-#include <stdio.h>
-
-#include "listpack.h"
-#include "listpack_malloc.h"
-#include "redisassert.h"
-
-#define LP_HDR_SIZE 6       /* 32 bit total len + 16 bit number of elements. */
-#define LP_HDR_NUMELE_UNKNOWN UINT16_MAX
-#define LP_MAX_INT_ENCODING_LEN 9
-#define LP_MAX_BACKLEN_SIZE 5
-#define LP_MAX_ENTRY_BACKLEN 34359738367ULL
-#define LP_ENCODING_INT 0
-#define LP_ENCODING_STRING 1
-
-#define LP_ENCODING_7BIT_UINT 0
-#define LP_ENCODING_7BIT_UINT_MASK 0x80
-#define LP_ENCODING_IS_7BIT_UINT(byte) (((byte)&LP_ENCODING_7BIT_UINT_MASK)==LP_ENCODING_7BIT_UINT)
-
-#define LP_ENCODING_6BIT_STR 0x80
-#define LP_ENCODING_6BIT_STR_MASK 0xC0
-#define LP_ENCODING_IS_6BIT_STR(byte) (((byte)&LP_ENCODING_6BIT_STR_MASK)==LP_ENCODING_6BIT_STR)
-
-#define LP_ENCODING_13BIT_INT 0xC0
-#define LP_ENCODING_13BIT_INT_MASK 0xE0
-#define LP_ENCODING_IS_13BIT_INT(byte) (((byte)&LP_ENCODING_13BIT_INT_MASK)==LP_ENCODING_13BIT_INT)
-
-#define LP_ENCODING_12BIT_STR 0xE0
-#define LP_ENCODING_12BIT_STR_MASK 0xF0
-#define LP_ENCODING_IS_12BIT_STR(byte) (((byte)&LP_ENCODING_12BIT_STR_MASK)==LP_ENCODING_12BIT_STR)
-
-#define LP_ENCODING_16BIT_INT 0xF1
-#define LP_ENCODING_16BIT_INT_MASK 0xFF
-#define LP_ENCODING_IS_16BIT_INT(byte) (((byte)&LP_ENCODING_16BIT_INT_MASK)==LP_ENCODING_16BIT_INT)
-
-#define LP_ENCODING_24BIT_INT 0xF2
-#define LP_ENCODING_24BIT_INT_MASK 0xFF
-#define LP_ENCODING_IS_24BIT_INT(byte) (((byte)&LP_ENCODING_24BIT_INT_MASK)==LP_ENCODING_24BIT_INT)
-
-#define LP_ENCODING_32BIT_INT 0xF3
-#define LP_ENCODING_32BIT_INT_MASK 0xFF
-#define LP_ENCODING_IS_32BIT_INT(byte) (((byte)&LP_ENCODING_32BIT_INT_MASK)==LP_ENCODING_32BIT_INT)
-
-#define LP_ENCODING_64BIT_INT 0xF4
-#define LP_ENCODING_64BIT_INT_MASK 0xFF
-#define LP_ENCODING_IS_64BIT_INT(byte) (((byte)&LP_ENCODING_64BIT_INT_MASK)==LP_ENCODING_64BIT_INT)
-
-#define LP_ENCODING_32BIT_STR 0xF0
-#define LP_ENCODING_32BIT_STR_MASK 0xFF
-#define LP_ENCODING_IS_32BIT_STR(byte) (((byte)&LP_ENCODING_32BIT_STR_MASK)==LP_ENCODING_32BIT_STR)
-
-#define LP_EOF 0xFF
-
-#define LP_ENCODING_6BIT_STR_LEN(p) ((p)[0] & 0x3F)
-#define LP_ENCODING_12BIT_STR_LEN(p) ((((p)[0] & 0xF) << 8) | (p)[1])
-#define LP_ENCODING_32BIT_STR_LEN(p) (((uint32_t)(p)[1]<<0) | \
-                                      ((uint32_t)(p)[2]<<8) | \
-                                      ((uint32_t)(p)[3]<<16) | \
-                                      ((uint32_t)(p)[4]<<24))
-
-#define lpGetTotalBytes(p)           (((uint32_t)(p)[0]<<0) | \
-                                      ((uint32_t)(p)[1]<<8) | \
-                                      ((uint32_t)(p)[2]<<16) | \
-                                      ((uint32_t)(p)[3]<<24))
-
-#define lpGetNumElements(p)          (((uint32_t)(p)[4]<<0) | \
-                                      ((uint32_t)(p)[5]<<8))
-#define lpSetTotalBytes(p,v) do { \
-    (p)[0] = (v)&0xff; \
-    (p)[1] = ((v)>>8)&0xff; \
-    (p)[2] = ((v)>>16)&0xff; \
-    (p)[3] = ((v)>>24)&0xff; \
-} while(0)
-
-#define lpSetNumElements(p,v) do { \
-    (p)[4] = (v)&0xff; \
-    (p)[5] = ((v)>>8)&0xff; \
-} while(0)
-
-/* Validates that 'p' is not ouside the listpack.
- * All function that return a pointer to an element in the listpack will assert
- * that this element is valid, so it can be freely used.
- * Generally functions such lpNext and lpDelete assume the input pointer is
- * already validated (since it's the return value of another function). */
-#define ASSERT_INTEGRITY(lp, p) do { \
-    assert((p) >= (lp)+LP_HDR_SIZE && (p) < (lp)+lpGetTotalBytes((lp))); \
-} while (0)
-
-/* Similar to the above, but validates the entire element lenth rather than just
- * it's pointer. */
-#define ASSERT_INTEGRITY_LEN(lp, p, len) do { \
-    assert((p) >= (lp)+LP_HDR_SIZE && (p)+(len) < (lp)+lpGetTotalBytes((lp))); \
-} while (0)
-
-static inline void lpAssertValidEntry(unsigned char* lp, size_t lpbytes, unsigned char *p);
-
-/* Convert a string into a signed 64 bit integer.
- * The function returns 1 if the string could be parsed into a (non-overflowing)
- * signed 64 bit int, 0 otherwise. The 'value' will be set to the parsed value
- * when the function returns success.
- *
- * Note that this function demands that the string strictly represents
- * a int64 value: no spaces or other characters before or after the string
- * representing the number are accepted, nor zeroes at the start if not
- * for the string "0" representing the zero number.
- *
- * Because of its strictness, it is safe to use this function to check if
- * you can convert a string into a long long, and obtain back the string
- * from the number without any loss in the string representation. *
- *
- * -----------------------------------------------------------------------------
- *
- * Credits: this function was adapted from the Redis source code, file
- * "utils.c", function string2ll(), and is copyright:
- *
- * Copyright(C) 2011, Pieter Noordhuis
- * Copyright(C) 2011, Salvatore Sanfilippo
- *
- * The function is released under the BSD 3-clause license.
- */
-int lpStringToInt64(const char *s, unsigned long slen, int64_t *value) {
-    const char *p = s;
-    unsigned long plen = 0;
-    int negative = 0;
-    uint64_t v;
-
-    if (plen == slen)
-        return 0;
-
-    /* Special case: first and only digit is 0. */
-    if (slen == 1 && p[0] == '0') {
-        if (value != NULL) *value = 0;
-        return 1;
-    }
-
-    if (p[0] == '-') {
-        negative = 1;
-        p++; plen++;
-
-        /* Abort on only a negative sign. */
-        if (plen == slen)
-            return 0;
-    }
-
-    /* First digit should be 1-9, otherwise the string should just be 0. */
-    if (p[0] >= '1' && p[0] <= '9') {
-        v = p[0]-'0';
-        p++; plen++;
-    } else if (p[0] == '0' && slen == 1) {
-        *value = 0;
-        return 1;
-    } else {
-        return 0;
-    }
-
-    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
-        if (v > (UINT64_MAX / 10)) /* Overflow. */
-            return 0;
-        v *= 10;
-
-        if (v > (UINT64_MAX - (p[0]-'0'))) /* Overflow. */
-            return 0;
-        v += p[0]-'0';
-
-        p++; plen++;
-    }
-
-    /* Return if not all bytes were used. */
-    if (plen < slen)
-        return 0;
-
-    if (negative) {
-        if (v > ((uint64_t)(-(INT64_MIN+1))+1)) /* Overflow. */
-            return 0;
-        if (value != NULL) *value = -v;
-    } else {
-        if (v > INT64_MAX) /* Overflow. */
-            return 0;
-        if (value != NULL) *value = v;
-    }
-    return 1;
-}
-
-/* Create a new, empty listpack.
- * On success the new listpack is returned, otherwise an error is returned.
- * Pre-allocate at least `capacity` bytes of memory,
- * over-allocated memory can be shrinked by `lpShrinkToFit`.
- * */
-unsigned char *lpNew(size_t capacity) {
-    unsigned char *lp = lp_malloc(capacity > LP_HDR_SIZE+1 ? capacity : LP_HDR_SIZE+1);
-    if (lp == NULL) return NULL;
-    lpSetTotalBytes(lp,LP_HDR_SIZE+1);
-    lpSetNumElements(lp,0);
-    lp[LP_HDR_SIZE] = LP_EOF;
-    return lp;
-}
-
-/* Free the specified listpack. */
-void lpFree(unsigned char *lp) {
-    lp_free(lp);
-}
-
-/* Shrink the memory to fit. */
-unsigned char* lpShrinkToFit(unsigned char *lp) {
-    size_t size = lpGetTotalBytes(lp);
-    if (size < lp_malloc_size(lp)) {
-        return lp_realloc(lp, size);
-    } else {
-        return lp;
-    }
-}
-
-/* Given an element 'ele' of size 'size', determine if the element can be
- * represented inside the listpack encoded as integer, and returns
- * LP_ENCODING_INT if so. Otherwise returns LP_ENCODING_STR if no integer
- * encoding is possible.
- *
- * If the LP_ENCODING_INT is returned, the function stores the integer encoded
- * representation of the element in the 'intenc' buffer.
- *
- * Regardless of the returned encoding, 'enclen' is populated by reference to
- * the number of bytes that the string or integer encoded element will require
- * in order to be represented. */
-int lpEncodeGetType(unsigned char *ele, uint32_t size, unsigned char *intenc, uint64_t *enclen) {
-    int64_t v;
-    if (lpStringToInt64((const char*)ele, size, &v)) {
-        if (v >= 0 && v <= 127) {
-            /* Single byte 0-127 integer. */
-            intenc[0] = v;
-            *enclen = 1;
-        } else if (v >= -4096 && v <= 4095) {
-            /* 13 bit integer. */
-            if (v < 0) v = ((int64_t)1<<13)+v;
-            intenc[0] = (v>>8)|LP_ENCODING_13BIT_INT;
-            intenc[1] = v&0xff;
-            *enclen = 2;
-        } else if (v >= -32768 && v <= 32767) {
-            /* 16 bit integer. */
-            if (v < 0) v = ((int64_t)1<<16)+v;
-            intenc[0] = LP_ENCODING_16BIT_INT;
-            intenc[1] = v&0xff;
-            intenc[2] = v>>8;
-            *enclen = 3;
-        } else if (v >= -8388608 && v <= 8388607) {
-            /* 24 bit integer. */
-            if (v < 0) v = ((int64_t)1<<24)+v;
-            intenc[0] = LP_ENCODING_24BIT_INT;
-            intenc[1] = v&0xff;
-            intenc[2] = (v>>8)&0xff;
-            intenc[3] = v>>16;
-            *enclen = 4;
-        } else if (v >= -2147483648 && v <= 2147483647) {
-            /* 32 bit integer. */
-            if (v < 0) v = ((int64_t)1<<32)+v;
-            intenc[0] = LP_ENCODING_32BIT_INT;
-            intenc[1] = v&0xff;
-            intenc[2] = (v>>8)&0xff;
-            intenc[3] = (v>>16)&0xff;
-            intenc[4] = v>>24;
-            *enclen = 5;
-        } else {
-            /* 64 bit integer. */
-            uint64_t uv = v;
-            intenc[0] = LP_ENCODING_64BIT_INT;
-            intenc[1] = uv&0xff;
-            intenc[2] = (uv>>8)&0xff;
-            intenc[3] = (uv>>16)&0xff;
-            intenc[4] = (uv>>24)&0xff;
-            intenc[5] = (uv>>32)&0xff;
-            intenc[6] = (uv>>40)&0xff;
-            intenc[7] = (uv>>48)&0xff;
-            intenc[8] = uv>>56;
-            *enclen = 9;
-        }
-        return LP_ENCODING_INT;
-    } else {
-        if (size < 64) *enclen = 1+size;
-        else if (size < 4096) *enclen = 2+size;
-        else *enclen = 5+(uint64_t)size;
-        return LP_ENCODING_STRING;
-    }
-}
-
-/* Store a reverse-encoded variable length field, representing the length
- * of the previous element of size 'l', in the target buffer 'buf'.
- * The function returns the number of bytes used to encode it, from
- * 1 to 5. If 'buf' is NULL the function just returns the number of bytes
- * needed in order to encode the backlen. */
-unsigned long lpEncodeBacklen(unsigned char *buf, uint64_t l) {
-    if (l <= 127) {
-        if (buf) buf[0] = l;
-        return 1;
-    } else if (l < 16383) {
-        if (buf) {
-            buf[0] = l>>7;
-            buf[1] = (l&127)|128;
-        }
-        return 2;
-    } else if (l < 2097151) {
-        if (buf) {
-            buf[0] = l>>14;
-            buf[1] = ((l>>7)&127)|128;
-            buf[2] = (l&127)|128;
-        }
-        return 3;
-    } else if (l < 268435455) {
-        if (buf) {
-            buf[0] = l>>21;
-            buf[1] = ((l>>14)&127)|128;
-            buf[2] = ((l>>7)&127)|128;
-            buf[3] = (l&127)|128;
-        }
-        return 4;
-    } else {
-        if (buf) {
-            buf[0] = l>>28;
-            buf[1] = ((l>>21)&127)|128;
-            buf[2] = ((l>>14)&127)|128;
-            buf[3] = ((l>>7)&127)|128;
-            buf[4] = (l&127)|128;
-        }
-        return 5;
-    }
-}
-
-/* Decode the backlen and returns it. If the encoding looks invalid (more than
- * 5 bytes are used), UINT64_MAX is returned to report the problem. */
-uint64_t lpDecodeBacklen(unsigned char *p) {
-    uint64_t val = 0;
-    uint64_t shift = 0;
-    do {
-        val |= (uint64_t)(p[0] & 127) << shift;
-        if (!(p[0] & 128)) break;
-        shift += 7;
-        p--;
-        if (shift > 28) return UINT64_MAX;
-    } while(1);
-    return val;
-}
-
-/* Encode the string element pointed by 's' of size 'len' in the target
- * buffer 's'. The function should be called with 'buf' having always enough
- * space for encoding the string. This is done by calling lpEncodeGetType()
- * before calling this function. */
-void lpEncodeString(unsigned char *buf, unsigned char *s, uint32_t len) {
-    if (len < 64) {
-        buf[0] = len | LP_ENCODING_6BIT_STR;
-        memcpy(buf+1,s,len);
-    } else if (len < 4096) {
-        buf[0] = (len >> 8) | LP_ENCODING_12BIT_STR;
-        buf[1] = len & 0xff;
-        memcpy(buf+2,s,len);
-    } else {
-        buf[0] = LP_ENCODING_32BIT_STR;
-        buf[1] = len & 0xff;
-        buf[2] = (len >> 8) & 0xff;
-        buf[3] = (len >> 16) & 0xff;
-        buf[4] = (len >> 24) & 0xff;
-        memcpy(buf+5,s,len);
-    }
-}
-
-/* Return the encoded length of the listpack element pointed by 'p'.
- * This includes the encoding byte, length bytes, and the element data itself.
- * If the element encoding is wrong then 0 is returned.
- * Note that this method may access additional bytes (in case of 12 and 32 bit
- * str), so should only be called when we know 'p' was already validated by
- * lpCurrentEncodedSizeBytes or ASSERT_INTEGRITY_LEN (possibly since 'p' is
- * a return value of another function that validated its return. */
-uint32_t lpCurrentEncodedSizeUnsafe(unsigned char *p) {
-    if (LP_ENCODING_IS_7BIT_UINT(p[0])) return 1;
-    if (LP_ENCODING_IS_6BIT_STR(p[0])) return 1+LP_ENCODING_6BIT_STR_LEN(p);
-    if (LP_ENCODING_IS_13BIT_INT(p[0])) return 2;
-    if (LP_ENCODING_IS_16BIT_INT(p[0])) return 3;
-    if (LP_ENCODING_IS_24BIT_INT(p[0])) return 4;
-    if (LP_ENCODING_IS_32BIT_INT(p[0])) return 5;
-    if (LP_ENCODING_IS_64BIT_INT(p[0])) return 9;
-    if (LP_ENCODING_IS_12BIT_STR(p[0])) return 2+LP_ENCODING_12BIT_STR_LEN(p);
-    if (LP_ENCODING_IS_32BIT_STR(p[0])) return 5+LP_ENCODING_32BIT_STR_LEN(p);
-    if (p[0] == LP_EOF) return 1;
-    return 0;
-}
-
-/* Return bytes needed to encode the length of the listpack element pointed by 'p'.
- * This includes just the encodign byte, and the bytes needed to encode the length
- * of the element (excluding the element data itself)
- * If the element encoding is wrong then 0 is returned. */
-uint32_t lpCurrentEncodedSizeBytes(unsigned char *p) {
-    if (LP_ENCODING_IS_7BIT_UINT(p[0])) return 1;
-    if (LP_ENCODING_IS_6BIT_STR(p[0])) return 1;
-    if (LP_ENCODING_IS_13BIT_INT(p[0])) return 1;
-    if (LP_ENCODING_IS_16BIT_INT(p[0])) return 1;
-    if (LP_ENCODING_IS_24BIT_INT(p[0])) return 1;
-    if (LP_ENCODING_IS_32BIT_INT(p[0])) return 1;
-    if (LP_ENCODING_IS_64BIT_INT(p[0])) return 1;
-    if (LP_ENCODING_IS_12BIT_STR(p[0])) return 2;
-    if (LP_ENCODING_IS_32BIT_STR(p[0])) return 5;
-    if (p[0] == LP_EOF) return 1;
-    return 0;
-}
-
-/* Skip the current entry returning the next. It is invalid to call this
- * function if the current element is the EOF element at the end of the
- * listpack, however, while this function is used to implement lpNext(),
- * it does not return NULL when the EOF element is encountered. */
-unsigned char *lpSkip(unsigned char *p) {
-    unsigned long entrylen = lpCurrentEncodedSizeUnsafe(p);
-    entrylen += lpEncodeBacklen(NULL,entrylen);
-    p += entrylen;
-    return p;
-}
-
-/* If 'p' points to an element of the listpack, calling lpNext() will return
- * the pointer to the next element (the one on the right), or NULL if 'p'
- * already pointed to the last element of the listpack. */
-unsigned char *lpNext(unsigned char *lp, unsigned char *p) {
-    assert(p);
-    p = lpSkip(p);
-    if (p[0] == LP_EOF) return NULL;
-    lpAssertValidEntry(lp, lpBytes(lp), p);
-    return p;
-}
-
-/* If 'p' points to an element of the listpack, calling lpPrev() will return
- * the pointer to the previous element (the one on the left), or NULL if 'p'
- * already pointed to the first element of the listpack. */
-unsigned char *lpPrev(unsigned char *lp, unsigned char *p) {
-    assert(p);
-    if (p-lp == LP_HDR_SIZE) return NULL;
-    p--; /* Seek the first backlen byte of the last element. */
-    uint64_t prevlen = lpDecodeBacklen(p);
-    prevlen += lpEncodeBacklen(NULL,prevlen);
-    p -= prevlen-1; /* Seek the first byte of the previous entry. */
-    lpAssertValidEntry(lp, lpBytes(lp), p);
-    return p;
-}
-
-/* Return a pointer to the first element of the listpack, or NULL if the
- * listpack has no elements. */
-unsigned char *lpFirst(unsigned char *lp) {
-    unsigned char *p = lp + LP_HDR_SIZE; /* Skip the header. */
-    if (p[0] == LP_EOF) return NULL;
-    lpAssertValidEntry(lp, lpBytes(lp), p);
-    return p;
-}
-
-/* Return a pointer to the last element of the listpack, or NULL if the
- * listpack has no elements. */
-unsigned char *lpLast(unsigned char *lp) {
-    unsigned char *p = lp+lpGetTotalBytes(lp)-1; /* Seek EOF element. */
-    return lpPrev(lp,p); /* Will return NULL if EOF is the only element. */
-}
-
-/* Return the number of elements inside the listpack. This function attempts
- * to use the cached value when within range, otherwise a full scan is
- * needed. As a side effect of calling this function, the listpack header
- * could be modified, because if the count is found to be already within
- * the 'numele' header field range, the new value is set. */
-uint32_t lpLength(unsigned char *lp) {
-    uint32_t numele = lpGetNumElements(lp);
-    if (numele != LP_HDR_NUMELE_UNKNOWN) return numele;
-
-    /* Too many elements inside the listpack. We need to scan in order
-     * to get the total number. */
-    uint32_t count = 0;
-    unsigned char *p = lpFirst(lp);
-    while(p) {
-        count++;
-        p = lpNext(lp,p);
-    }
-
-    /* If the count is again within range of the header numele field,
-     * set it. */
-    if (count < LP_HDR_NUMELE_UNKNOWN) lpSetNumElements(lp,count);
-    return count;
-}
-
-/* Return the listpack element pointed by 'p'.
- *
- * The function changes behavior depending on the passed 'intbuf' value.
- * Specifically, if 'intbuf' is NULL:
- *
- * If the element is internally encoded as an integer, the function returns
- * NULL and populates the integer value by reference in 'count'. Otherwise if
- * the element is encoded as a string a pointer to the string (pointing inside
- * the listpack itself) is returned, and 'count' is set to the length of the
- * string.
- *
- * If instead 'intbuf' points to a buffer passed by the caller, that must be
- * at least LP_INTBUF_SIZE bytes, the function always returns the element as
- * it was a string (returning the pointer to the string and setting the
- * 'count' argument to the string length by reference). However if the element
- * is encoded as an integer, the 'intbuf' buffer is used in order to store
- * the string representation.
- *
- * The user should use one or the other form depending on what the value will
- * be used for. If there is immediate usage for an integer value returned
- * by the function, than to pass a buffer (and convert it back to a number)
- * is of course useless.
- *
- * If the function is called against a badly encoded ziplist, so that there
- * is no valid way to parse it, the function returns like if there was an
- * integer encoded with value 12345678900000000 + <unrecognized byte>, this may
- * be an hint to understand that something is wrong. To crash in this case is
- * not sensible because of the different requirements of the application using
- * this lib.
- *
- * Similarly, there is no error returned since the listpack normally can be
- * assumed to be valid, so that would be a very high API cost. However a function
- * in order to check the integrity of the listpack at load time is provided,
- * check lpIsValid(). */
-unsigned char *lpGet(unsigned char *p, int64_t *count, unsigned char *intbuf) {
-    int64_t val;
-    uint64_t uval, negstart, negmax;
-
-    assert(p); /* assertion for valgrind (avoid NPD) */
-    if (LP_ENCODING_IS_7BIT_UINT(p[0])) {
-        negstart = UINT64_MAX; /* 7 bit ints are always positive. */
-        negmax = 0;
-        uval = p[0] & 0x7f;
-    } else if (LP_ENCODING_IS_6BIT_STR(p[0])) {
-        *count = LP_ENCODING_6BIT_STR_LEN(p);
-        return p+1;
-    } else if (LP_ENCODING_IS_13BIT_INT(p[0])) {
-        uval = ((p[0]&0x1f)<<8) | p[1];
-        negstart = (uint64_t)1<<12;
-        negmax = 8191;
-    } else if (LP_ENCODING_IS_16BIT_INT(p[0])) {
-        uval = (uint64_t)p[1] |
-               (uint64_t)p[2]<<8;
-        negstart = (uint64_t)1<<15;
-        negmax = UINT16_MAX;
-    } else if (LP_ENCODING_IS_24BIT_INT(p[0])) {
-        uval = (uint64_t)p[1] |
-               (uint64_t)p[2]<<8 |
-               (uint64_t)p[3]<<16;
-        negstart = (uint64_t)1<<23;
-        negmax = UINT32_MAX>>8;
-    } else if (LP_ENCODING_IS_32BIT_INT(p[0])) {
-        uval = (uint64_t)p[1] |
-               (uint64_t)p[2]<<8 |
-               (uint64_t)p[3]<<16 |
-               (uint64_t)p[4]<<24;
-        negstart = (uint64_t)1<<31;
-        negmax = UINT32_MAX;
-    } else if (LP_ENCODING_IS_64BIT_INT(p[0])) {
-        uval = (uint64_t)p[1] |
-               (uint64_t)p[2]<<8 |
-               (uint64_t)p[3]<<16 |
-               (uint64_t)p[4]<<24 |
-               (uint64_t)p[5]<<32 |
-               (uint64_t)p[6]<<40 |
-               (uint64_t)p[7]<<48 |
-               (uint64_t)p[8]<<56;
-        negstart = (uint64_t)1<<63;
-        negmax = UINT64_MAX;
-    } else if (LP_ENCODING_IS_12BIT_STR(p[0])) {
-        *count = LP_ENCODING_12BIT_STR_LEN(p);
-        return p+2;
-    } else if (LP_ENCODING_IS_32BIT_STR(p[0])) {
-        *count = LP_ENCODING_32BIT_STR_LEN(p);
-        return p+5;
-    } else {
-        uval = 12345678900000000ULL + p[0];
-        negstart = UINT64_MAX;
-        negmax = 0;
-    }
-
-    /* We reach this code path only for integer encodings.
-     * Convert the unsigned value to the signed one using two's complement
-     * rule. */
-    if (uval >= negstart) {
-        /* This three steps conversion should avoid undefined behaviors
-         * in the unsigned -> signed conversion. */
-        uval = negmax-uval;
-        val = uval;
-        val = -val-1;
-    } else {
-        val = uval;
-    }
-
-    /* Return the string representation of the integer or the value itself
-     * depending on intbuf being NULL or not. */
-    if (intbuf) {
-        *count = snprintf((char*)intbuf,LP_INTBUF_SIZE,"%lld",(long long)val);
-        return intbuf;
-    } else {
-        *count = val;
-        return NULL;
-    }
-}
-
-/* Insert, delete or replace the specified element 'ele' of length 'len' at
- * the specified position 'p', with 'p' being a listpack element pointer
- * obtained with lpFirst(), lpLast(), lpNext(), lpPrev() or lpSeek().
- *
- * The element is inserted before, after, or replaces the element pointed
- * by 'p' depending on the 'where' argument, that can be LP_BEFORE, LP_AFTER
- * or LP_REPLACE.
- *
- * If 'ele' is set to NULL, the function removes the element pointed by 'p'
- * instead of inserting one.
- *
- * Returns NULL on out of memory or when the listpack total length would exceed
- * the max allowed size of 2^32-1, otherwise the new pointer to the listpack
- * holding the new element is returned (and the old pointer passed is no longer
- * considered valid)
- *
- * If 'newp' is not NULL, at the end of a successful call '*newp' will be set
- * to the address of the element just added, so that it will be possible to
- * continue an interation with lpNext() and lpPrev().
- *
- * For deletion operations ('ele' set to NULL) 'newp' is set to the next
- * element, on the right of the deleted one, or to NULL if the deleted element
- * was the last one. */
-unsigned char *lpInsert(unsigned char *lp, unsigned char *ele, uint32_t size, unsigned char *p, int where, unsigned char **newp) {
-    unsigned char intenc[LP_MAX_INT_ENCODING_LEN];
-    unsigned char backlen[LP_MAX_BACKLEN_SIZE];
-
-    uint64_t enclen; /* The length of the encoded element. */
-
-    /* An element pointer set to NULL means deletion, which is conceptually
-     * replacing the element with a zero-length element. So whatever we
-     * get passed as 'where', set it to LP_REPLACE. */
-    if (ele == NULL) where = LP_REPLACE;
-
-    /* If we need to insert after the current element, we just jump to the
-     * next element (that could be the EOF one) and handle the case of
-     * inserting before. So the function will actually deal with just two
-     * cases: LP_BEFORE and LP_REPLACE. */
-    if (where == LP_AFTER) {
-        p = lpSkip(p);
-        where = LP_BEFORE;
-        ASSERT_INTEGRITY(lp, p);
-    }
-
-    /* Store the offset of the element 'p', so that we can obtain its
-     * address again after a reallocation. */
-    unsigned long poff = p-lp;
-
-    /* Calling lpEncodeGetType() results into the encoded version of the
-     * element to be stored into 'intenc' in case it is representable as
-     * an integer: in that case, the function returns LP_ENCODING_INT.
-     * Otherwise if LP_ENCODING_STR is returned, we'll have to call
-     * lpEncodeString() to actually write the encoded string on place later.
-     *
-     * Whatever the returned encoding is, 'enclen' is populated with the
-     * length of the encoded element. */
-    int enctype;
-    if (ele) {
-        enctype = lpEncodeGetType(ele,size,intenc,&enclen);
-    } else {
-        enctype = -1;
-        enclen = 0;
-    }
-
-    /* We need to also encode the backward-parsable length of the element
-     * and append it to the end: this allows to traverse the listpack from
-     * the end to the start. */
-    unsigned long backlen_size = ele ? lpEncodeBacklen(backlen,enclen) : 0;
-    uint64_t old_listpack_bytes = lpGetTotalBytes(lp);
-    uint32_t replaced_len  = 0;
-    if (where == LP_REPLACE) {
-        replaced_len = lpCurrentEncodedSizeUnsafe(p);
-        replaced_len += lpEncodeBacklen(NULL,replaced_len);
-        ASSERT_INTEGRITY_LEN(lp, p, replaced_len);
-    }
-
-    uint64_t new_listpack_bytes = old_listpack_bytes + enclen + backlen_size
-                                  - replaced_len;
-    if (new_listpack_bytes > UINT32_MAX) return NULL;
-
-    /* We now need to reallocate in order to make space or shrink the
-     * allocation (in case 'when' value is LP_REPLACE and the new element is
-     * smaller). However we do that before memmoving the memory to
-     * make room for the new element if the final allocation will get
-     * larger, or we do it after if the final allocation will get smaller. */
-
-    unsigned char *dst = lp + poff; /* May be updated after reallocation. */
-
-    /* Realloc before: we need more room. */
-    if (new_listpack_bytes > old_listpack_bytes &&
-        new_listpack_bytes > lp_malloc_size(lp)) {
-        if ((lp = lp_realloc(lp,new_listpack_bytes)) == NULL) return NULL;
-        dst = lp + poff;
-    }
-
-    /* Setup the listpack relocating the elements to make the exact room
-     * we need to store the new one. */
-    if (where == LP_BEFORE) {
-        memmove(dst+enclen+backlen_size,dst,old_listpack_bytes-poff);
-    } else { /* LP_REPLACE. */
-        long lendiff = (enclen+backlen_size)-replaced_len;
-        memmove(dst+replaced_len+lendiff,
-                dst+replaced_len,
-                old_listpack_bytes-poff-replaced_len);
-    }
-
-    /* Realloc after: we need to free space. */
-    if (new_listpack_bytes < old_listpack_bytes) {
-        if ((lp = lp_realloc(lp,new_listpack_bytes)) == NULL) return NULL;
-        dst = lp + poff;
-    }
-
-    /* Store the entry. */
-    if (newp) {
-        *newp = dst;
-        /* In case of deletion, set 'newp' to NULL if the next element is
-         * the EOF element. */
-        if (!ele && dst[0] == LP_EOF) *newp = NULL;
-    }
-    if (ele) {
-        if (enctype == LP_ENCODING_INT) {
-            memcpy(dst,intenc,enclen);
-        } else {
-            lpEncodeString(dst,ele,size);
-        }
-        dst += enclen;
-        memcpy(dst,backlen,backlen_size);
-        dst += backlen_size;
-    }
-
-    /* Update header. */
-    if (where != LP_REPLACE || ele == NULL) {
-        uint32_t num_elements = lpGetNumElements(lp);
-        if (num_elements != LP_HDR_NUMELE_UNKNOWN) {
-            if (ele)
-                lpSetNumElements(lp,num_elements+1);
-            else
-                lpSetNumElements(lp,num_elements-1);
-        }
-    }
-    lpSetTotalBytes(lp,new_listpack_bytes);
-
-#if 0
-    /* This code path is normally disabled: what it does is to force listpack
-     * to return *always* a new pointer after performing some modification to
-     * the listpack, even if the previous allocation was enough. This is useful
-     * in order to spot bugs in code using listpacks: by doing so we can find
-     * if the caller forgets to set the new pointer where the listpack reference
-     * is stored, after an update. */
-    unsigned char *oldlp = lp;
-    lp = lp_malloc(new_listpack_bytes);
-    memcpy(lp,oldlp,new_listpack_bytes);
-    if (newp) {
-        unsigned long offset = (*newp)-oldlp;
-        *newp = lp + offset;
-    }
-    /* Make sure the old allocation contains garbage. */
-    memset(oldlp,'A',new_listpack_bytes);
-    lp_free(oldlp);
-#endif
-
-    return lp;
-}
-
-/* Append the specified element 'ele' of length 'len' at the end of the
- * listpack. It is implemented in terms of lpInsert(), so the return value is
- * the same as lpInsert(). */
-unsigned char *lpAppend(unsigned char *lp, unsigned char *ele, uint32_t size) {
-    uint64_t listpack_bytes = lpGetTotalBytes(lp);
-    unsigned char *eofptr = lp + listpack_bytes - 1;
-    return lpInsert(lp,ele,size,eofptr,LP_BEFORE,NULL);
-}
-
-/* Remove the element pointed by 'p', and return the resulting listpack.
- * If 'newp' is not NULL, the next element pointer (to the right of the
- * deleted one) is returned by reference. If the deleted element was the
- * last one, '*newp' is set to NULL. */
-unsigned char *lpDelete(unsigned char *lp, unsigned char *p, unsigned char **newp) {
-    return lpInsert(lp,NULL,0,p,LP_REPLACE,newp);
-}
-
-/* Return the total number of bytes the listpack is composed of. */
-uint32_t lpBytes(unsigned char *lp) {
-    return lpGetTotalBytes(lp);
-}
-
-/* Seek the specified element and returns the pointer to the seeked element.
- * Positive indexes specify the zero-based element to seek from the head to
- * the tail, negative indexes specify elements starting from the tail, where
- * -1 means the last element, -2 the penultimate and so forth. If the index
- * is out of range, NULL is returned. */
-unsigned char *lpSeek(unsigned char *lp, long index) {
-    int forward = 1; /* Seek forward by default. */
-
-    /* We want to seek from left to right or the other way around
-     * depending on the listpack length and the element position.
-     * However if the listpack length cannot be obtained in constant time,
-     * we always seek from left to right. */
-    uint32_t numele = lpGetNumElements(lp);
-    if (numele != LP_HDR_NUMELE_UNKNOWN) {
-        if (index < 0) index = (long)numele+index;
-        if (index < 0) return NULL; /* Index still < 0 means out of range. */
-        if (index >= (long)numele) return NULL; /* Out of range the other side. */
-        /* We want to scan right-to-left if the element we are looking for
-         * is past the half of the listpack. */
-        if (index > (long)numele/2) {
-            forward = 0;
-            /* Right to left scanning always expects a negative index. Convert
-             * our index to negative form. */
-            index -= numele;
-        }
-    } else {
-        /* If the listpack length is unspecified, for negative indexes we
-         * want to always scan right-to-left. */
-        if (index < 0) forward = 0;
-    }
-
-    /* Forward and backward scanning is trivially based on lpNext()/lpPrev(). */
-    if (forward) {
-        unsigned char *ele = lpFirst(lp);
-        while (index > 0 && ele) {
-            ele = lpNext(lp,ele);
-            index--;
-        }
-        return ele;
-    } else {
-        unsigned char *ele = lpLast(lp);
-        while (index < -1 && ele) {
-            ele = lpPrev(lp,ele);
-            index++;
-        }
-        return ele;
-    }
-}
-
-/* Same as lpFirst but without validation assert, to be used right before lpValidateNext. */
-unsigned char *lpValidateFirst(unsigned char *lp) {
-    unsigned char *p = lp + LP_HDR_SIZE; /* Skip the header. */
-    if (p[0] == LP_EOF) return NULL;
-    return p;
-}
-
-/* Validate the integrity of a single listpack entry and move to the next one.
- * The input argument 'pp' is a reference to the current record and is advanced on exit.
- * Returns 1 if valid, 0 if invalid. */
-int lpValidateNext(unsigned char *lp, unsigned char **pp, size_t lpbytes) {
-#define OUT_OF_RANGE(p) ( \
-        (p) < lp + LP_HDR_SIZE || \
-        (p) > lp + lpbytes - 1)
-    unsigned char *p = *pp;
-    if (!p)
-        return 0;
-
-    /* Before accessing p, make sure it's valid. */
-    if (OUT_OF_RANGE(p))
-        return 0;
-
-    if (*p == LP_EOF) {
-        *pp = NULL;
-        return 1;
-    }
-
-    /* check that we can read the encoded size */
-    uint32_t lenbytes = lpCurrentEncodedSizeBytes(p);
-    if (!lenbytes)
-        return 0;
-
-    /* make sure the encoded entry length doesn't rech outside the edge of the listpack */
-    if (OUT_OF_RANGE(p + lenbytes))
-        return 0;
-
-    /* get the entry length and encoded backlen. */
-    unsigned long entrylen = lpCurrentEncodedSizeUnsafe(p);
-    unsigned long encodedBacklen = lpEncodeBacklen(NULL,entrylen);
-    entrylen += encodedBacklen;
-
-    /* make sure the entry doesn't rech outside the edge of the listpack */
-    if (OUT_OF_RANGE(p + entrylen))
-        return 0;
-
-    /* move to the next entry */
-    p += entrylen;
-
-    /* make sure the encoded length at the end patches the one at the beginning. */
-    uint64_t prevlen = lpDecodeBacklen(p-1);
-    if (prevlen + encodedBacklen != entrylen)
-        return 0;
-
-    *pp = p;
-    return 1;
-#undef OUT_OF_RANGE
-}
-
-/* Validate that the entry doesn't reach outside the listpack allocation. */
-static inline void lpAssertValidEntry(unsigned char* lp, size_t lpbytes, unsigned char *p) {
-    assert(lpValidateNext(lp, &p, lpbytes));
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we scan all the entries one by one. */
-int lpValidateIntegrity(unsigned char *lp, size_t size, int deep){
-    /* Check that we can actually read the header. (and EOF) */
-    if (size < LP_HDR_SIZE + 1)
-        return 0;
-
-    /* Check that the encoded size in the header must match the allocated size. */
-    size_t bytes = lpGetTotalBytes(lp);
-    if (bytes != size)
-        return 0;
-
-    /* The last byte must be the terminator. */
-    if (lp[size-1] != LP_EOF)
-        return 0;
-
-    if (!deep)
-        return 1;
-
-    /* Validate the invividual entries. */
-    uint32_t count = 0;
-    unsigned char *p = lp + LP_HDR_SIZE;
-    while(p && p[0] != LP_EOF) {
-        if (!lpValidateNext(lp, &p, bytes))
-            return 0;
-        count++;
-    }
-
-    /* Check that the count in the header is correct */
-    uint32_t numele = lpGetNumElements(lp);
-    if (numele != LP_HDR_NUMELE_UNKNOWN && numele != count)
-        return 0;
-
-    return 1;
-}
diff --git a/redis-stable/src/listpack.h b/redis-stable/src/listpack.h
deleted file mode 100644
index 9a5115ba..00000000
--- a/redis-stable/src/listpack.h
+++ /dev/null
@@ -1,66 +0,0 @@
-/* Listpack -- A lists of strings serialization format
- *
- * This file implements the specification you can find at:
- *
- *  https://github.com/antirez/listpack
- *
- * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __LISTPACK_H
-#define __LISTPACK_H
-
-#include <stdlib.h>
-#include <stdint.h>
-
-#define LP_INTBUF_SIZE 21 /* 20 digits of -2^63 + 1 null term = 21. */
-
-/* lpInsert() where argument possible values: */
-#define LP_BEFORE 0
-#define LP_AFTER 1
-#define LP_REPLACE 2
-
-unsigned char *lpNew(size_t capacity);
-void lpFree(unsigned char *lp);
-unsigned char* lpShrinkToFit(unsigned char *lp);
-unsigned char *lpInsert(unsigned char *lp, unsigned char *ele, uint32_t size, unsigned char *p, int where, unsigned char **newp);
-unsigned char *lpAppend(unsigned char *lp, unsigned char *ele, uint32_t size);
-unsigned char *lpDelete(unsigned char *lp, unsigned char *p, unsigned char **newp);
-uint32_t lpLength(unsigned char *lp);
-unsigned char *lpGet(unsigned char *p, int64_t *count, unsigned char *intbuf);
-unsigned char *lpFirst(unsigned char *lp);
-unsigned char *lpLast(unsigned char *lp);
-unsigned char *lpNext(unsigned char *lp, unsigned char *p);
-unsigned char *lpPrev(unsigned char *lp, unsigned char *p);
-uint32_t lpBytes(unsigned char *lp);
-unsigned char *lpSeek(unsigned char *lp, long index);
-int lpValidateIntegrity(unsigned char *lp, size_t size, int deep);
-unsigned char *lpValidateFirst(unsigned char *lp);
-int lpValidateNext(unsigned char *lp, unsigned char **pp, size_t lpbytes);
-
-#endif
diff --git a/redis-stable/src/listpack_malloc.h b/redis-stable/src/listpack_malloc.h
deleted file mode 100644
index 3a905005..00000000
--- a/redis-stable/src/listpack_malloc.h
+++ /dev/null
@@ -1,46 +0,0 @@
-/* Listpack -- A lists of strings serialization format
- * https://github.com/antirez/listpack
- *
- * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* Allocator selection.
- *
- * This file is used in order to change the Rax allocator at compile time.
- * Just define the following defines to what you want to use. Also add
- * the include of your alternate allocator if needed (not needed in order
- * to use the default libc allocator). */
-
-#ifndef LISTPACK_ALLOC_H
-#define LISTPACK_ALLOC_H
-#include "zmalloc.h"
-#define lp_malloc zmalloc
-#define lp_realloc zrealloc
-#define lp_free zfree
-#define lp_malloc_size zmalloc_usable_size
-#endif
diff --git a/redis-stable/src/localtime.c b/redis-stable/src/localtime.c
deleted file mode 100644
index e2ac81f9..00000000
--- a/redis-stable/src/localtime.c
+++ /dev/null
@@ -1,123 +0,0 @@
-/*
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <time.h>
-
-/* This is a safe version of localtime() which contains no locks and is
- * fork() friendly. Even the _r version of localtime() cannot be used safely
- * in Redis. Another thread may be calling localtime() while the main thread
- * forks(). Later when the child process calls localtime() again, for instance
- * in order to log something to the Redis log, it may deadlock: in the copy
- * of the address space of the forked process the lock will never be released.
- *
- * This function takes the timezone 'tz' as argument, and the 'dst' flag is
- * used to check if daylight saving time is currently in effect. The caller
- * of this function should obtain such information calling tzset() ASAP in the
- * main() function to obtain the timezone offset from the 'timezone' global
- * variable. To obtain the daylight information, if it is currently active or not,
- * one trick is to call localtime() in main() ASAP as well, and get the
- * information from the tm_isdst field of the tm structure. However the daylight
- * time may switch in the future for long running processes, so this information
- * should be refreshed at safe times.
- *
- * Note that this function does not work for dates < 1/1/1970, it is solely
- * designed to work with what time(NULL) may return, and to support Redis
- * logging of the dates, it's not really a complete implementation. */
-static int is_leap_year(time_t year) {
-    if (year % 4) return 0;         /* A year not divisible by 4 is not leap. */
-    else if (year % 100) return 1;  /* If div by 4 and not 100 is surely leap. */
-    else if (year % 400) return 0;  /* If div by 100 *and* not by 400 is not leap. */
-    else return 1;                  /* If div by 100 and 400 is leap. */
-}
-
-void nolocks_localtime(struct tm *tmp, time_t t, time_t tz, int dst) {
-    const time_t secs_min = 60;
-    const time_t secs_hour = 3600;
-    const time_t secs_day = 3600*24;
-
-    t -= tz;                            /* Adjust for timezone. */
-    t += 3600*dst;                      /* Adjust for daylight time. */
-    time_t days = t / secs_day;         /* Days passed since epoch. */
-    time_t seconds = t % secs_day;      /* Remaining seconds. */
-
-    tmp->tm_isdst = dst;
-    tmp->tm_hour = seconds / secs_hour;
-    tmp->tm_min = (seconds % secs_hour) / secs_min;
-    tmp->tm_sec = (seconds % secs_hour) % secs_min;
-
-    /* 1/1/1970 was a Thursday, that is, day 4 from the POV of the tm structure
-     * where sunday = 0, so to calculate the day of the week we have to add 4
-     * and take the modulo by 7. */
-    tmp->tm_wday = (days+4)%7;
-
-    /* Calculate the current year. */
-    tmp->tm_year = 1970;
-    while(1) {
-        /* Leap years have one day more. */
-        time_t days_this_year = 365 + is_leap_year(tmp->tm_year);
-        if (days_this_year > days) break;
-        days -= days_this_year;
-        tmp->tm_year++;
-    }
-    tmp->tm_yday = days;  /* Number of day of the current year. */
-
-    /* We need to calculate in which month and day of the month we are. To do
-     * so we need to skip days according to how many days there are in each
-     * month, and adjust for the leap year that has one more day in February. */
-    int mdays[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
-    mdays[1] += is_leap_year(tmp->tm_year);
-
-    tmp->tm_mon = 0;
-    while(days >= mdays[tmp->tm_mon]) {
-        days -= mdays[tmp->tm_mon];
-        tmp->tm_mon++;
-    }
-
-    tmp->tm_mday = days+1;  /* Add 1 since our 'days' is zero-based. */
-    tmp->tm_year -= 1900;   /* Surprisingly tm_year is year-1900. */
-}
-
-#ifdef LOCALTIME_TEST_MAIN
-#include <stdio.h>
-
-int main(void) {
-    /* Obtain timezone and daylight info. */
-    tzset(); /* Now 'timezome' global is populated. */
-    time_t t = time(NULL);
-    struct tm *aux = localtime(&t);
-    int daylight_active = aux->tm_isdst;
-
-    struct tm tm;
-    char buf[1024];
-
-    nolocks_localtime(&tm,t,timezone,daylight_active);
-    strftime(buf,sizeof(buf),"%d %b %H:%M:%S",&tm);
-    printf("[timezone: %d, dl: %d] %s\n", (int)timezone, (int)daylight_active, buf);
-}
-#endif
diff --git a/redis-stable/src/lolwut.c b/redis-stable/src/lolwut.c
deleted file mode 100644
index 931f311c..00000000
--- a/redis-stable/src/lolwut.c
+++ /dev/null
@@ -1,188 +0,0 @@
-/*
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * ----------------------------------------------------------------------------
- *
- * This file implements the LOLWUT command. The command should do something
- * fun and interesting, and should be replaced by a new implementation at
- * each new version of Redis.
- */
-
-#include "server.h"
-#include "lolwut.h"
-#include <math.h>
-
-void lolwut5Command(client *c);
-void lolwut6Command(client *c);
-
-/* The default target for LOLWUT if no matching version was found.
- * This is what unstable versions of Redis will display. */
-void lolwutUnstableCommand(client *c) {
-    sds rendered = sdsnew("Redis ver. ");
-    rendered = sdscat(rendered,REDIS_VERSION);
-    rendered = sdscatlen(rendered,"\n",1);
-    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
-    sdsfree(rendered);
-}
-
-/* LOLWUT [VERSION <version>] [... version specific arguments ...] */
-void lolwutCommand(client *c) {
-    char *v = REDIS_VERSION;
-    char verstr[64];
-
-    if (c->argc >= 3 && !strcasecmp(c->argv[1]->ptr,"version")) {
-        long ver;
-        if (getLongFromObjectOrReply(c,c->argv[2],&ver,NULL) != C_OK) return;
-        snprintf(verstr,sizeof(verstr),"%u.0.0",(unsigned int)ver);
-        v = verstr;
-
-        /* Adjust argv/argc to filter the "VERSION ..." option, since the
-         * specific LOLWUT version implementations don't know about it
-         * and expect their arguments. */
-        c->argv += 2;
-        c->argc -= 2;
-    }
-
-    if ((v[0] == '5' && v[1] == '.' && v[2] != '9') ||
-        (v[0] == '4' && v[1] == '.' && v[2] == '9'))
-        lolwut5Command(c);
-    else if ((v[0] == '6' && v[1] == '.' && v[2] != '9') ||
-             (v[0] == '5' && v[1] == '.' && v[2] == '9'))
-        lolwut6Command(c);
-    else
-        lolwutUnstableCommand(c);
-
-    /* Fix back argc/argv in case of VERSION argument. */
-    if (v == verstr) {
-        c->argv -= 2;
-        c->argc += 2;
-    }
-}
-
-/* ========================== LOLWUT Canvase ===============================
- * Many LOLWUT versions will likely print some computer art to the screen.
- * This is the case with LOLWUT 5 and LOLWUT 6, so here there is a generic
- * canvas implementation that can be reused.  */
-
-/* Allocate and return a new canvas of the specified size. */
-lwCanvas *lwCreateCanvas(int width, int height, int bgcolor) {
-    lwCanvas *canvas = zmalloc(sizeof(*canvas));
-    canvas->width = width;
-    canvas->height = height;
-    canvas->pixels = zmalloc((size_t)width*height);
-    memset(canvas->pixels,bgcolor,(size_t)width*height);
-    return canvas;
-}
-
-/* Free the canvas created by lwCreateCanvas(). */
-void lwFreeCanvas(lwCanvas *canvas) {
-    zfree(canvas->pixels);
-    zfree(canvas);
-}
-
-/* Set a pixel to the specified color. Color is 0 or 1, where zero means no
- * dot will be displayed, and 1 means dot will be displayed.
- * Coordinates are arranged so that left-top corner is 0,0. You can write
- * out of the size of the canvas without issues. */
-void lwDrawPixel(lwCanvas *canvas, int x, int y, int color) {
-    if (x < 0 || x >= canvas->width ||
-        y < 0 || y >= canvas->height) return;
-    canvas->pixels[x+y*canvas->width] = color;
-}
-
-/* Return the value of the specified pixel on the canvas. */
-int lwGetPixel(lwCanvas *canvas, int x, int y) {
-    if (x < 0 || x >= canvas->width ||
-        y < 0 || y >= canvas->height) return 0;
-    return canvas->pixels[x+y*canvas->width];
-}
-
-/* Draw a line from x1,y1 to x2,y2 using the Bresenham algorithm. */
-void lwDrawLine(lwCanvas *canvas, int x1, int y1, int x2, int y2, int color) {
-    int dx = abs(x2-x1);
-    int dy = abs(y2-y1);
-    int sx = (x1 < x2) ? 1 : -1;
-    int sy = (y1 < y2) ? 1 : -1;
-    int err = dx-dy, e2;
-
-    while(1) {
-        lwDrawPixel(canvas,x1,y1,color);
-        if (x1 == x2 && y1 == y2) break;
-        e2 = err*2;
-        if (e2 > -dy) {
-            err -= dy;
-            x1 += sx;
-        }
-        if (e2 < dx) {
-            err += dx;
-            y1 += sy;
-        }
-    }
-}
-
-/* Draw a square centered at the specified x,y coordinates, with the specified
- * rotation angle and size. In order to write a rotated square, we use the
- * trivial fact that the parametric equation:
- *
- *  x = sin(k)
- *  y = cos(k)
- *
- * Describes a circle for values going from 0 to 2*PI. So basically if we start
- * at 45 degrees, that is k = PI/4, with the first point, and then we find
- * the other three points incrementing K by PI/2 (90 degrees), we'll have the
- * points of the square. In order to rotate the square, we just start with
- * k = PI/4 + rotation_angle, and we are done.
- *
- * Of course the vanilla equations above will describe the square inside a
- * circle of radius 1, so in order to draw larger squares we'll have to
- * multiply the obtained coordinates, and then translate them. However this
- * is much simpler than implementing the abstract concept of 2D shape and then
- * performing the rotation/translation transformation, so for LOLWUT it's
- * a good approach. */
-void lwDrawSquare(lwCanvas *canvas, int x, int y, float size, float angle, int color) {
-    int px[4], py[4];
-
-    /* Adjust the desired size according to the fact that the square inscribed
-     * into a circle of radius 1 has the side of length SQRT(2). This way
-     * size becomes a simple multiplication factor we can use with our
-     * coordinates to magnify them. */
-    size /= 1.4142135623;
-    size = round(size);
-
-    /* Compute the four points. */
-    float k = M_PI/4 + angle;
-    for (int j = 0; j < 4; j++) {
-        px[j] = round(sin(k) * size + x);
-        py[j] = round(cos(k) * size + y);
-        k += M_PI/2;
-    }
-
-    /* Draw the square. */
-    for (int j = 0; j < 4; j++)
-        lwDrawLine(canvas,px[j],py[j],px[(j+1)%4],py[(j+1)%4],color);
-}
diff --git a/redis-stable/src/lolwut.h b/redis-stable/src/lolwut.h
deleted file mode 100644
index 682d0053..00000000
--- a/redis-stable/src/lolwut.h
+++ /dev/null
@@ -1,55 +0,0 @@
-/*
- * Copyright (c) 2018-2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* This structure represents our canvas. Drawing functions will take a pointer
- * to a canvas to write to it. Later the canvas can be rendered to a string
- * suitable to be printed on the screen, using unicode Braille characters. */
-
-/* This represents a very simple generic canvas in order to draw stuff.
- * It's up to each LOLWUT versions to translate what they draw to the
- * screen, depending on the result to accomplish. */
-
-#ifndef __LOLWUT_H
-#define __LOLWUT_H
-
-typedef struct lwCanvas {
-    int width;
-    int height;
-    char *pixels;
-} lwCanvas;
-
-/* Drawing functions implemented inside lolwut.c. */
-lwCanvas *lwCreateCanvas(int width, int height, int bgcolor);
-void lwFreeCanvas(lwCanvas *canvas);
-void lwDrawPixel(lwCanvas *canvas, int x, int y, int color);
-int lwGetPixel(lwCanvas *canvas, int x, int y);
-void lwDrawLine(lwCanvas *canvas, int x1, int y1, int x2, int y2, int color);
-void lwDrawSquare(lwCanvas *canvas, int x, int y, float size, float angle, int color);
-
-#endif
diff --git a/redis-stable/src/lolwut5.c b/redis-stable/src/lolwut5.c
deleted file mode 100644
index d864888b..00000000
--- a/redis-stable/src/lolwut5.c
+++ /dev/null
@@ -1,177 +0,0 @@
-/*
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * ----------------------------------------------------------------------------
- *
- * This file implements the LOLWUT command. The command should do something
- * fun and interesting, and should be replaced by a new implementation at
- * each new version of Redis.
- */
-
-#include "server.h"
-#include "lolwut.h"
-#include <math.h>
-
-/* Translate a group of 8 pixels (2x4 vertical rectangle) to the corresponding
- * braille character. The byte should correspond to the pixels arranged as
- * follows, where 0 is the least significant bit, and 7 the most significant
- * bit:
- *
- *   0 3
- *   1 4
- *   2 5
- *   6 7
- *
- * The corresponding utf8 encoded character is set into the three bytes
- * pointed by 'output'.
- */
-#include <stdio.h>
-void lwTranslatePixelsGroup(int byte, char *output) {
-    int code = 0x2800 + byte;
-    /* Convert to unicode. This is in the U0800-UFFFF range, so we need to
-     * emit it like this in three bytes:
-     * 1110xxxx 10xxxxxx 10xxxxxx. */
-    output[0] = 0xE0 | (code >> 12);          /* 1110-xxxx */
-    output[1] = 0x80 | ((code >> 6) & 0x3F);  /* 10-xxxxxx */
-    output[2] = 0x80 | (code & 0x3F);         /* 10-xxxxxx */
-}
-
-/* Schotter, the output of LOLWUT of Redis 5, is a computer graphic art piece
- * generated by Georg Nees in the 60s. It explores the relationship between
- * caos and order.
- *
- * The function creates the canvas itself, depending on the columns available
- * in the output display and the number of squares per row and per column
- * requested by the caller. */
-lwCanvas *lwDrawSchotter(int console_cols, int squares_per_row, int squares_per_col) {
-    /* Calculate the canvas size. */
-    int canvas_width = console_cols*2;
-    int padding = canvas_width > 4 ? 2 : 0;
-    float square_side = (float)(canvas_width-padding*2) / squares_per_row;
-    int canvas_height = square_side * squares_per_col + padding*2;
-    lwCanvas *canvas = lwCreateCanvas(canvas_width, canvas_height, 0);
-
-    for (int y = 0; y < squares_per_col; y++) {
-        for (int x = 0; x < squares_per_row; x++) {
-            int sx = x * square_side + square_side/2 + padding;
-            int sy = y * square_side + square_side/2 + padding;
-            /* Rotate and translate randomly as we go down to lower
-             * rows. */
-            float angle = 0;
-            if (y > 1) {
-                float r1 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
-                float r2 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
-                float r3 = (float)rand() / (float) RAND_MAX / squares_per_col * y;
-                if (rand() % 2) r1 = -r1;
-                if (rand() % 2) r2 = -r2;
-                if (rand() % 2) r3 = -r3;
-                angle = r1;
-                sx += r2*square_side/3;
-                sy += r3*square_side/3;
-            }
-            lwDrawSquare(canvas,sx,sy,square_side,angle,1);
-        }
-    }
-
-    return canvas;
-}
-
-/* Converts the canvas to an SDS string representing the UTF8 characters to
- * print to the terminal in order to obtain a graphical representaiton of the
- * logical canvas. The actual returned string will require a terminal that is
- * width/2 large and height/4 tall in order to hold the whole image without
- * overflowing or scrolling, since each Barille character is 2x4. */
-static sds renderCanvas(lwCanvas *canvas) {
-    sds text = sdsempty();
-    for (int y = 0; y < canvas->height; y += 4) {
-        for (int x = 0; x < canvas->width; x += 2) {
-            /* We need to emit groups of 8 bits according to a specific
-             * arrangement. See lwTranslatePixelsGroup() for more info. */
-            int byte = 0;
-            if (lwGetPixel(canvas,x,y)) byte |= (1<<0);
-            if (lwGetPixel(canvas,x,y+1)) byte |= (1<<1);
-            if (lwGetPixel(canvas,x,y+2)) byte |= (1<<2);
-            if (lwGetPixel(canvas,x+1,y)) byte |= (1<<3);
-            if (lwGetPixel(canvas,x+1,y+1)) byte |= (1<<4);
-            if (lwGetPixel(canvas,x+1,y+2)) byte |= (1<<5);
-            if (lwGetPixel(canvas,x,y+3)) byte |= (1<<6);
-            if (lwGetPixel(canvas,x+1,y+3)) byte |= (1<<7);
-            char unicode[3];
-            lwTranslatePixelsGroup(byte,unicode);
-            text = sdscatlen(text,unicode,3);
-        }
-        if (y != canvas->height-1) text = sdscatlen(text,"\n",1);
-    }
-    return text;
-}
-
-/* The LOLWUT command:
- *
- * LOLWUT [terminal columns] [squares-per-row] [squares-per-col]
- *
- * By default the command uses 66 columns, 8 squares per row, 12 squares
- * per column.
- */
-void lolwut5Command(client *c) {
-    long cols = 66;
-    long squares_per_row = 8;
-    long squares_per_col = 12;
-
-    /* Parse the optional arguments if any. */
-    if (c->argc > 1 &&
-        getLongFromObjectOrReply(c,c->argv[1],&cols,NULL) != C_OK)
-        return;
-
-    if (c->argc > 2 &&
-        getLongFromObjectOrReply(c,c->argv[2],&squares_per_row,NULL) != C_OK)
-        return;
-
-    if (c->argc > 3 &&
-        getLongFromObjectOrReply(c,c->argv[3],&squares_per_col,NULL) != C_OK)
-        return;
-
-    /* Limits. We want LOLWUT to be always reasonably fast and cheap to execute
-     * so we have maximum number of columns, rows, and output resolution. */
-    if (cols < 1) cols = 1;
-    if (cols > 1000) cols = 1000;
-    if (squares_per_row < 1) squares_per_row = 1;
-    if (squares_per_row > 200) squares_per_row = 200;
-    if (squares_per_col < 1) squares_per_col = 1;
-    if (squares_per_col > 200) squares_per_col = 200;
-
-    /* Generate some computer art and reply. */
-    lwCanvas *canvas = lwDrawSchotter(cols,squares_per_row,squares_per_col);
-    sds rendered = renderCanvas(canvas);
-    rendered = sdscat(rendered,
-        "\nGeorg Nees - schotter, plotter on paper, 1968. Redis ver. ");
-    rendered = sdscat(rendered,REDIS_VERSION);
-    rendered = sdscatlen(rendered,"\n",1);
-    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
-    sdsfree(rendered);
-    lwFreeCanvas(canvas);
-}
diff --git a/redis-stable/src/lolwut6.c b/redis-stable/src/lolwut6.c
deleted file mode 100644
index 471bf66c..00000000
--- a/redis-stable/src/lolwut6.c
+++ /dev/null
@@ -1,201 +0,0 @@
-/*
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * ----------------------------------------------------------------------------
- *
- * This file implements the LOLWUT command. The command should do something
- * fun and interesting, and should be replaced by a new implementation at
- * each new version of Redis.
- *
- * Thanks to Michele Hiki Falcone for the original image that ispired
- * the image, part of his game, Plaguemon.
- *
- * Thanks to the Shhh computer art collective for the help in tuning the
- * output to have a better artistic effect.
- */
-
-#include "server.h"
-#include "lolwut.h"
-
-/* Render the canvas using the four gray levels of the standard color
- * terminal: they match very well to the grayscale display of the gameboy. */
-static sds renderCanvas(lwCanvas *canvas) {
-    sds text = sdsempty();
-    for (int y = 0; y < canvas->height; y++) {
-        for (int x = 0; x < canvas->width; x++) {
-            int color = lwGetPixel(canvas,x,y);
-            char *ce; /* Color escape sequence. */
-
-            /* Note that we set both the foreground and background color.
-             * This way we are able to get a more consistent result among
-             * different terminals implementations. */
-            switch(color) {
-            case 0: ce = "0;30;40m"; break;    /* Black */
-            case 1: ce = "0;90;100m"; break;   /* Gray 1 */
-            case 2: ce = "0;37;47m"; break;    /* Gray 2 */
-            case 3: ce = "0;97;107m"; break;   /* White */
-            default: ce = "0;30;40m"; break;   /* Just for safety. */
-            }
-            text = sdscatprintf(text,"\033[%s \033[0m",ce);
-        }
-        if (y != canvas->height-1) text = sdscatlen(text,"\n",1);
-    }
-    return text;
-}
-
-/* Draw a skyscraper on the canvas, according to the parameters in the
- * 'skyscraper' structure. Window colors are random and are always one
- * of the two grays. */
-struct skyscraper {
-    int xoff;       /* X offset. */
-    int width;      /* Pixels width. */
-    int height;     /* Pixels height. */
-    int windows;    /* Draw windows if true. */
-    int color;      /* Color of the skyscraper. */
-};
-
-void generateSkyscraper(lwCanvas *canvas, struct skyscraper *si) {
-    int starty = canvas->height-1;
-    int endy = starty - si->height + 1;
-    for (int y = starty; y >= endy; y--) {
-        for (int x = si->xoff; x < si->xoff+si->width; x++) {
-            /* The roof is four pixels less wide. */
-            if (y == endy && (x <= si->xoff+1 || x >= si->xoff+si->width-2))
-                continue;
-            int color = si->color;
-            /* Alter the color if this is a place where we want to
-             * draw a window. We check that we are in the inner part of the
-             * skyscraper, so that windows are far from the borders. */
-            if (si->windows &&
-                x > si->xoff+1 &&
-                x < si->xoff+si->width-2 &&
-                y > endy+1 &&
-                y < starty-1)
-            {
-                /* Calculate the x,y position relative to the start of
-                 * the window area. */
-                int relx = x - (si->xoff+1);
-                int rely = y - (endy+1);
-
-                /* Note that we want the windows to be two pixels wide
-                 * but just one pixel tall, because terminal "pixels"
-                 * (characters) are not square. */
-                if (relx/2 % 2 && rely % 2) {
-                    do {
-                        color = 1 + rand() % 2;
-                    } while (color == si->color);
-                    /* Except we want adjacent pixels creating the same
-                     * window to be the same color. */
-                    if (relx % 2) color = lwGetPixel(canvas,x-1,y);
-                }
-            }
-            lwDrawPixel(canvas,x,y,color);
-        }
-    }
-}
-
-/* Generate a skyline inspired by the parallax backgrounds of 8 bit games. */
-void generateSkyline(lwCanvas *canvas) {
-    struct skyscraper si;
-
-    /* First draw the background skyscraper without windows, using the
-     * two different grays. We use two passes to make sure that the lighter
-     * ones are always in the background. */
-    for (int color = 2; color >= 1; color--) {
-        si.color = color;
-        for (int offset = -10; offset < canvas->width;) {
-            offset += rand() % 8;
-            si.xoff = offset;
-            si.width = 10 + rand()%9;
-            if (color == 2)
-                si.height = canvas->height/2 + rand()%canvas->height/2;
-            else
-                si.height = canvas->height/2 + rand()%canvas->height/3;
-            si.windows = 0;
-            generateSkyscraper(canvas, &si);
-            if (color == 2)
-                offset += si.width/2;
-            else
-                offset += si.width+1;
-        }
-    }
-
-    /* Now draw the foreground skyscraper with the windows. */
-    si.color = 0;
-    for (int offset = -10; offset < canvas->width;) {
-        offset += rand() % 8;
-        si.xoff = offset;
-        si.width = 5 + rand()%14;
-        if (si.width % 4) si.width += (si.width % 3);
-        si.height = canvas->height/3 + rand()%canvas->height/2;
-        si.windows = 1;
-        generateSkyscraper(canvas, &si);
-        offset += si.width+5;
-    }
-}
-
-/* The LOLWUT 6 command:
- *
- * LOLWUT [columns] [rows]
- *
- * By default the command uses 80 columns, 40 squares per row
- * per column.
- */
-void lolwut6Command(client *c) {
-    long cols = 80;
-    long rows = 20;
-
-    /* Parse the optional arguments if any. */
-    if (c->argc > 1 &&
-        getLongFromObjectOrReply(c,c->argv[1],&cols,NULL) != C_OK)
-        return;
-
-    if (c->argc > 2 &&
-        getLongFromObjectOrReply(c,c->argv[2],&rows,NULL) != C_OK)
-        return;
-
-    /* Limits. We want LOLWUT to be always reasonably fast and cheap to execute
-     * so we have maximum number of columns, rows, and output resulution. */
-    if (cols < 1) cols = 1;
-    if (cols > 1000) cols = 1000;
-    if (rows < 1) rows = 1;
-    if (rows > 1000) rows = 1000;
-
-    /* Generate the city skyline and reply. */
-    lwCanvas *canvas = lwCreateCanvas(cols,rows,3);
-    generateSkyline(canvas);
-    sds rendered = renderCanvas(canvas);
-    rendered = sdscat(rendered,
-        "\nDedicated to the 8 bit game developers of past and present.\n"
-        "Original 8 bit image from Plaguemon by hikikomori. Redis ver. ");
-    rendered = sdscat(rendered,REDIS_VERSION);
-    rendered = sdscatlen(rendered,"\n",1);
-    addReplyVerbatim(c,rendered,sdslen(rendered),"txt");
-    sdsfree(rendered);
-    lwFreeCanvas(canvas);
-}
diff --git a/redis-stable/src/lzf.h b/redis-stable/src/lzf.h
deleted file mode 100644
index 98e038f3..00000000
--- a/redis-stable/src/lzf.h
+++ /dev/null
@@ -1,100 +0,0 @@
-/*
- * Copyright (c) 2000-2008 Marc Alexander Lehmann <schmorp@schmorp.de>
- *
- * Redistribution and use in source and binary forms, with or without modifica-
- * tion, are permitted provided that the following conditions are met:
- *
- *   1.  Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *   2.  Redistributions in binary form must reproduce the above copyright
- *       notice, this list of conditions and the following disclaimer in the
- *       documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
- * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
- * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
- * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
- * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
- * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * Alternatively, the contents of this file may be used under the terms of
- * the GNU General Public License ("GPL") version 2 or any later version,
- * in which case the provisions of the GPL are applicable instead of
- * the above. If you wish to allow the use of your version of this file
- * only under the terms of the GPL and not to allow others to use your
- * version of this file under the BSD license, indicate your decision
- * by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL. If you do not delete the
- * provisions above, a recipient may use your version of this file under
- * either the BSD or the GPL.
- */
-
-#ifndef LZF_H
-#define LZF_H
-
-/***********************************************************************
-**
-**	lzf -- an extremely fast/free compression/decompression-method
-**	http://liblzf.plan9.de/
-**
-**	This algorithm is believed to be patent-free.
-**
-***********************************************************************/
-
-#define LZF_VERSION 0x0105 /* 1.5, API version */
-
-/*
- * Compress in_len bytes stored at the memory block starting at
- * in_data and write the result to out_data, up to a maximum length
- * of out_len bytes.
- *
- * If the output buffer is not large enough or any error occurs return 0,
- * otherwise return the number of bytes used, which might be considerably
- * more than in_len (but less than 104% of the original size), so it
- * makes sense to always use out_len == in_len - 1), to ensure _some_
- * compression, and store the data uncompressed otherwise (with a flag, of
- * course.
- *
- * lzf_compress might use different algorithms on different systems and
- * even different runs, thus might result in different compressed strings
- * depending on the phase of the moon or similar factors. However, all
- * these strings are architecture-independent and will result in the
- * original data when decompressed using lzf_decompress.
- *
- * The buffers must not be overlapping.
- *
- * If the option LZF_STATE_ARG is enabled, an extra argument must be
- * supplied which is not reflected in this header file. Refer to lzfP.h
- * and lzf_c.c.
- *
- */
-unsigned int
-lzf_compress (const void *const in_data,  unsigned int in_len,
-              void             *out_data, unsigned int out_len);
-
-/*
- * Decompress data compressed with some version of the lzf_compress
- * function and stored at location in_data and length in_len. The result
- * will be stored at out_data up to a maximum of out_len characters.
- *
- * If the output buffer is not large enough to hold the decompressed
- * data, a 0 is returned and errno is set to E2BIG. Otherwise the number
- * of decompressed bytes (i.e. the original length of the data) is
- * returned.
- *
- * If an error in the compressed data is detected, a zero is returned and
- * errno is set to EINVAL.
- *
- * This function is very fast, about as fast as a copying loop.
- */
-unsigned int
-lzf_decompress (const void *const in_data,  unsigned int in_len,
-                void             *out_data, unsigned int out_len);
-
-#endif
-
diff --git a/redis-stable/src/lzfP.h b/redis-stable/src/lzfP.h
deleted file mode 100644
index 78c858fa..00000000
--- a/redis-stable/src/lzfP.h
+++ /dev/null
@@ -1,189 +0,0 @@
-/*
- * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
- *
- * Redistribution and use in source and binary forms, with or without modifica-
- * tion, are permitted provided that the following conditions are met:
- *
- *   1.  Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *   2.  Redistributions in binary form must reproduce the above copyright
- *       notice, this list of conditions and the following disclaimer in the
- *       documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
- * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
- * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
- * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
- * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
- * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * Alternatively, the contents of this file may be used under the terms of
- * the GNU General Public License ("GPL") version 2 or any later version,
- * in which case the provisions of the GPL are applicable instead of
- * the above. If you wish to allow the use of your version of this file
- * only under the terms of the GPL and not to allow others to use your
- * version of this file under the BSD license, indicate your decision
- * by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL. If you do not delete the
- * provisions above, a recipient may use your version of this file under
- * either the BSD or the GPL.
- */
-
-#ifndef LZFP_h
-#define LZFP_h
-
-#define STANDALONE 1 /* at the moment, this is ok. */
-
-#ifndef STANDALONE
-# include "lzf.h"
-#endif
-
-/*
- * Size of hashtable is (1 << HLOG) * sizeof (char *)
- * decompression is independent of the hash table size
- * the difference between 15 and 14 is very small
- * for small blocks (and 14 is usually a bit faster).
- * For a low-memory/faster configuration, use HLOG == 13;
- * For best compression, use 15 or 16 (or more, up to 22).
- */
-#ifndef HLOG
-# define HLOG 16
-#endif
-
-/*
- * Sacrifice very little compression quality in favour of compression speed.
- * This gives almost the same compression as the default code, and is
- * (very roughly) 15% faster. This is the preferred mode of operation.
- */
-#ifndef VERY_FAST
-# define VERY_FAST 1
-#endif
-
-/*
- * Sacrifice some more compression quality in favour of compression speed.
- * (roughly 1-2% worse compression for large blocks and
- * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
- * In short: when in need for speed, enable this for binary data,
- * possibly disable this for text data.
- */
-#ifndef ULTRA_FAST
-# define ULTRA_FAST 0
-#endif
-
-/*
- * Unconditionally aligning does not cost very much, so do it if unsure
- */
-#ifndef STRICT_ALIGN
-# if !(defined(__i386) || defined (__amd64))
-#  define STRICT_ALIGN 1
-# else
-#  define STRICT_ALIGN 0
-# endif
-#endif
-
-/*
- * You may choose to pre-set the hash table (might be faster on some
- * modern cpus and large (>>64k) blocks, and also makes compression
- * deterministic/repeatable when the configuration otherwise is the same).
- */
-#ifndef INIT_HTAB
-# define INIT_HTAB 0
-#endif
-
-/*
- * Avoid assigning values to errno variable? for some embedding purposes
- * (linux kernel for example), this is necessary. NOTE: this breaks
- * the documentation in lzf.h. Avoiding errno has no speed impact.
- */
-#ifndef AVOID_ERRNO
-# define AVOID_ERRNO 0
-#endif
-
-/*
- * Whether to pass the LZF_STATE variable as argument, or allocate it
- * on the stack. For small-stack environments, define this to 1.
- * NOTE: this breaks the prototype in lzf.h.
- */
-#ifndef LZF_STATE_ARG
-# define LZF_STATE_ARG 0
-#endif
-
-/*
- * Whether to add extra checks for input validity in lzf_decompress
- * and return EINVAL if the input stream has been corrupted. This
- * only shields against overflowing the input buffer and will not
- * detect most corrupted streams.
- * This check is not normally noticeable on modern hardware
- * (<1% slowdown), but might slow down older cpus considerably.
- */
-#ifndef CHECK_INPUT
-# define CHECK_INPUT 1
-#endif
-
-/*
- * Whether to store pointers or offsets inside the hash table. On
- * 64 bit architectures, pointers take up twice as much space,
- * and might also be slower. Default is to autodetect.
- */
-/*#define LZF_USER_OFFSETS autodetect */
-
-/*****************************************************************************/
-/* nothing should be changed below */
-
-#ifdef __cplusplus
-# include <cstring>
-# include <climits>
-using namespace std;
-#else
-# include <string.h>
-# include <limits.h>
-#endif
-
-#ifndef LZF_USE_OFFSETS
-# if defined (WIN32)
-#  define LZF_USE_OFFSETS defined(_M_X64)
-# else
-#  if __cplusplus > 199711L
-#   include <cstdint>
-#  else
-#   include <stdint.h>
-#  endif
-#  define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
-# endif
-#endif
-
-typedef unsigned char u8;
-
-#if LZF_USE_OFFSETS
-# define LZF_HSLOT_BIAS ((const u8 *)in_data)
-  typedef unsigned int LZF_HSLOT;
-#else
-# define LZF_HSLOT_BIAS 0
-  typedef const u8 *LZF_HSLOT;
-#endif
-
-typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
-
-#if !STRICT_ALIGN
-/* for unaligned accesses we need a 16 bit datatype. */
-# if USHRT_MAX == 65535
-    typedef unsigned short u16;
-# elif UINT_MAX == 65535
-    typedef unsigned int u16;
-# else
-#  undef STRICT_ALIGN
-#  define STRICT_ALIGN 1
-# endif
-#endif
-
-#if ULTRA_FAST
-# undef VERY_FAST
-#endif
-
-#endif
-
diff --git a/redis-stable/src/lzf_c.c b/redis-stable/src/lzf_c.c
deleted file mode 100644
index e9c69a0b..00000000
--- a/redis-stable/src/lzf_c.c
+++ /dev/null
@@ -1,291 +0,0 @@
-/*
- * Copyright (c) 2000-2010 Marc Alexander Lehmann <schmorp@schmorp.de>
- *
- * Redistribution and use in source and binary forms, with or without modifica-
- * tion, are permitted provided that the following conditions are met:
- *
- *   1.  Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *   2.  Redistributions in binary form must reproduce the above copyright
- *       notice, this list of conditions and the following disclaimer in the
- *       documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
- * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
- * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
- * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
- * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
- * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * Alternatively, the contents of this file may be used under the terms of
- * the GNU General Public License ("GPL") version 2 or any later version,
- * in which case the provisions of the GPL are applicable instead of
- * the above. If you wish to allow the use of your version of this file
- * only under the terms of the GPL and not to allow others to use your
- * version of this file under the BSD license, indicate your decision
- * by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL. If you do not delete the
- * provisions above, a recipient may use your version of this file under
- * either the BSD or the GPL.
- */
-
-#include "lzfP.h"
-
-#define HSIZE (1 << (HLOG))
-
-/*
- * don't play with this unless you benchmark!
- * the data format is not dependent on the hash function.
- * the hash function might seem strange, just believe me,
- * it works ;)
- */
-#ifndef FRST
-# define FRST(p) (((p[0]) << 8) | p[1])
-# define NEXT(v,p) (((v) << 8) | p[2])
-# if ULTRA_FAST
-#  define IDX(h) ((( h             >> (3*8 - HLOG)) - h  ) & (HSIZE - 1))
-# elif VERY_FAST
-#  define IDX(h) ((( h             >> (3*8 - HLOG)) - h*5) & (HSIZE - 1))
-# else
-#  define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1))
-# endif
-#endif
-/*
- * IDX works because it is very similar to a multiplicative hash, e.g.
- * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1))
- * the latter is also quite fast on newer CPUs, and compresses similarly.
- *
- * the next one is also quite good, albeit slow ;)
- * (int)(cos(h & 0xffffff) * 1e6)
- */
-
-#if 0
-/* original lzv-like hash function, much worse and thus slower */
-# define FRST(p) (p[0] << 5) ^ p[1]
-# define NEXT(v,p) ((v) << 5) ^ p[2]
-# define IDX(h) ((h) & (HSIZE - 1))
-#endif
-
-#define        MAX_LIT        (1 <<  5)
-#define        MAX_OFF        (1 << 13)
-#define        MAX_REF        ((1 << 8) + (1 << 3))
-
-#if __GNUC__ >= 3
-# define expect(expr,value)         __builtin_expect ((expr),(value))
-# define inline                     inline
-#else
-# define expect(expr,value)         (expr)
-# define inline                     static
-#endif
-
-#define expect_false(expr) expect ((expr) != 0, 0)
-#define expect_true(expr)  expect ((expr) != 0, 1)
-
-/*
- * compressed format
- *
- * 000LLLLL <L+1>    ; literal, L+1=1..33 octets
- * LLLooooo oooooooo ; backref L+1=1..7 octets, o+1=1..4096 offset
- * 111ooooo LLLLLLLL oooooooo ; backref L+8 octets, o+1=1..4096 offset
- *
- */
-
-unsigned int
-lzf_compress (const void *const in_data, unsigned int in_len,
-	      void *out_data, unsigned int out_len
-#if LZF_STATE_ARG
-              , LZF_STATE htab
-#endif
-              )
-{
-#if !LZF_STATE_ARG
-  LZF_STATE htab;
-#endif
-  const u8 *ip = (const u8 *)in_data;
-        u8 *op = (u8 *)out_data;
-  const u8 *in_end  = ip + in_len;
-        u8 *out_end = op + out_len;
-  const u8 *ref;
-
-  /* off requires a type wide enough to hold a general pointer difference.
-   * ISO C doesn't have that (size_t might not be enough and ptrdiff_t only
-   * works for differences within a single object). We also assume that no
-   * no bit pattern traps. Since the only platform that is both non-POSIX
-   * and fails to support both assumptions is windows 64 bit, we make a
-   * special workaround for it.
-   */
-#if defined (WIN32) && defined (_M_X64)
-  unsigned _int64 off; /* workaround for missing POSIX compliance */
-#else
-  unsigned long off;
-#endif
-  unsigned int hval;
-  int lit;
-
-  if (!in_len || !out_len)
-    return 0;
-
-#if INIT_HTAB
-  memset (htab, 0, sizeof (htab));
-#endif
-
-  lit = 0; op++; /* start run */
-
-  hval = FRST (ip);
-  while (ip < in_end - 2)
-    {
-      LZF_HSLOT *hslot;
-
-      hval = NEXT (hval, ip);
-      hslot = htab + IDX (hval);
-      ref = *hslot + LZF_HSLOT_BIAS; *hslot = ip - LZF_HSLOT_BIAS;
-
-      if (1
-#if INIT_HTAB
-          && ref < ip /* the next test will actually take care of this, but this is faster */
-#endif
-          && (off = ip - ref - 1) < MAX_OFF
-          && ref > (u8 *)in_data
-          && ref[2] == ip[2]
-#if STRICT_ALIGN
-          && ((ref[1] << 8) | ref[0]) == ((ip[1] << 8) | ip[0])
-#else
-          && *(u16 *)ref == *(u16 *)ip
-#endif
-        )
-        {
-          /* match found at *ref++ */
-          unsigned int len = 2;
-          unsigned int maxlen = in_end - ip - len;
-          maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
-
-          if (expect_false (op + 3 + 1 >= out_end)) /* first a faster conservative test */
-            if (op - !lit + 3 + 1 >= out_end) /* second the exact but rare test */
-              return 0;
-
-          op [- lit - 1] = lit - 1; /* stop run */
-          op -= !lit; /* undo run if length is zero */
-
-          for (;;)
-            {
-              if (expect_true (maxlen > 16))
-                {
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                  len++; if (ref [len] != ip [len]) break;
-                }
-
-              do
-                len++;
-              while (len < maxlen && ref[len] == ip[len]);
-
-              break;
-            }
-
-          len -= 2; /* len is now #octets - 1 */
-          ip++;
-
-          if (len < 7)
-            {
-              *op++ = (off >> 8) + (len << 5);
-            }
-          else
-            {
-              *op++ = (off >> 8) + (  7 << 5);
-              *op++ = len - 7;
-            }
-
-          *op++ = off;
-
-          lit = 0; op++; /* start run */
-
-          ip += len + 1;
-
-          if (expect_false (ip >= in_end - 2))
-            break;
-
-#if ULTRA_FAST || VERY_FAST
-          --ip;
-# if VERY_FAST && !ULTRA_FAST
-          --ip;
-# endif
-          hval = FRST (ip);
-
-          hval = NEXT (hval, ip);
-          htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
-          ip++;
-
-# if VERY_FAST && !ULTRA_FAST
-          hval = NEXT (hval, ip);
-          htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
-          ip++;
-# endif
-#else
-          ip -= len + 1;
-
-          do
-            {
-              hval = NEXT (hval, ip);
-              htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
-              ip++;
-            }
-          while (len--);
-#endif
-        }
-      else
-        {
-          /* one more literal byte we must copy */
-          if (expect_false (op >= out_end))
-            return 0;
-
-          lit++; *op++ = *ip++;
-
-          if (expect_false (lit == MAX_LIT))
-            {
-              op [- lit - 1] = lit - 1; /* stop run */
-              lit = 0; op++; /* start run */
-            }
-        }
-    }
-
-  if (op + 3 > out_end) /* at most 3 bytes can be missing here */
-    return 0;
-
-  while (ip < in_end)
-    {
-      lit++; *op++ = *ip++;
-
-      if (expect_false (lit == MAX_LIT))
-        {
-          op [- lit - 1] = lit - 1; /* stop run */
-          lit = 0; op++; /* start run */
-        }
-    }
-
-  op [- lit - 1] = lit - 1; /* end run */
-  op -= !lit; /* undo run if length is zero */
-
-  return op - (u8 *)out_data;
-}
-
diff --git a/redis-stable/src/lzf_d.c b/redis-stable/src/lzf_d.c
deleted file mode 100644
index dbf1ae77..00000000
--- a/redis-stable/src/lzf_d.c
+++ /dev/null
@@ -1,191 +0,0 @@
-/*
- * Copyright (c) 2000-2010 Marc Alexander Lehmann <schmorp@schmorp.de>
- *
- * Redistribution and use in source and binary forms, with or without modifica-
- * tion, are permitted provided that the following conditions are met:
- *
- *   1.  Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *   2.  Redistributions in binary form must reproduce the above copyright
- *       notice, this list of conditions and the following disclaimer in the
- *       documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
- * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
- * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
- * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
- * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
- * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * Alternatively, the contents of this file may be used under the terms of
- * the GNU General Public License ("GPL") version 2 or any later version,
- * in which case the provisions of the GPL are applicable instead of
- * the above. If you wish to allow the use of your version of this file
- * only under the terms of the GPL and not to allow others to use your
- * version of this file under the BSD license, indicate your decision
- * by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL. If you do not delete the
- * provisions above, a recipient may use your version of this file under
- * either the BSD or the GPL.
- */
-
-#include "lzfP.h"
-
-#if AVOID_ERRNO
-# define SET_ERRNO(n)
-#else
-# include <errno.h>
-# define SET_ERRNO(n) errno = (n)
-#endif
-
-#if USE_REP_MOVSB /* small win on amd, big loss on intel */
-#if (__i386 || __amd64) && __GNUC__ >= 3
-# define lzf_movsb(dst, src, len)                \
-   asm ("rep movsb"                              \
-        : "=D" (dst), "=S" (src), "=c" (len)     \
-        :  "0" (dst),  "1" (src),  "2" (len));
-#endif
-#endif
-
-#if defined(__GNUC__) && __GNUC__ >= 7
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wimplicit-fallthrough"
-#endif
-unsigned int
-lzf_decompress (const void *const in_data,  unsigned int in_len,
-                void             *out_data, unsigned int out_len)
-{
-  u8 const *ip = (const u8 *)in_data;
-  u8       *op = (u8 *)out_data;
-  u8 const *const in_end  = ip + in_len;
-  u8       *const out_end = op + out_len;
-
-  while (ip < in_end)
-    {
-      unsigned int ctrl;
-      ctrl = *ip++;
-
-      if (ctrl < (1 << 5)) /* literal run */
-        {
-          ctrl++;
-
-          if (op + ctrl > out_end)
-            {
-              SET_ERRNO (E2BIG);
-              return 0;
-            }
-
-#if CHECK_INPUT
-          if (ip + ctrl > in_end)
-            {
-              SET_ERRNO (EINVAL);
-              return 0;
-            }
-#endif
-
-#ifdef lzf_movsb
-          lzf_movsb (op, ip, ctrl);
-#else
-          switch (ctrl)
-            {
-              case 32: *op++ = *ip++; case 31: *op++ = *ip++; case 30: *op++ = *ip++; case 29: *op++ = *ip++;
-              case 28: *op++ = *ip++; case 27: *op++ = *ip++; case 26: *op++ = *ip++; case 25: *op++ = *ip++;
-              case 24: *op++ = *ip++; case 23: *op++ = *ip++; case 22: *op++ = *ip++; case 21: *op++ = *ip++;
-              case 20: *op++ = *ip++; case 19: *op++ = *ip++; case 18: *op++ = *ip++; case 17: *op++ = *ip++;
-              case 16: *op++ = *ip++; case 15: *op++ = *ip++; case 14: *op++ = *ip++; case 13: *op++ = *ip++;
-              case 12: *op++ = *ip++; case 11: *op++ = *ip++; case 10: *op++ = *ip++; case  9: *op++ = *ip++;
-              case  8: *op++ = *ip++; case  7: *op++ = *ip++; case  6: *op++ = *ip++; case  5: *op++ = *ip++;
-              case  4: *op++ = *ip++; case  3: *op++ = *ip++; case  2: *op++ = *ip++; case  1: *op++ = *ip++;
-            }
-#endif
-        }
-      else /* back reference */
-        {
-          unsigned int len = ctrl >> 5;
-
-          u8 *ref = op - ((ctrl & 0x1f) << 8) - 1;
-
-#if CHECK_INPUT
-          if (ip >= in_end)
-            {
-              SET_ERRNO (EINVAL);
-              return 0;
-            }
-#endif
-          if (len == 7)
-            {
-              len += *ip++;
-#if CHECK_INPUT
-              if (ip >= in_end)
-                {
-                  SET_ERRNO (EINVAL);
-                  return 0;
-                }
-#endif
-            }
-
-          ref -= *ip++;
-
-          if (op + len + 2 > out_end)
-            {
-              SET_ERRNO (E2BIG);
-              return 0;
-            }
-
-          if (ref < (u8 *)out_data)
-            {
-              SET_ERRNO (EINVAL);
-              return 0;
-            }
-
-#ifdef lzf_movsb
-          len += 2;
-          lzf_movsb (op, ref, len);
-#else
-          switch (len)
-            {
-              default:
-                len += 2;
-
-                if (op >= ref + len)
-                  {
-                    /* disjunct areas */
-                    memcpy (op, ref, len);
-                    op += len;
-                  }
-                else
-                  {
-                    /* overlapping, use octte by octte copying */
-                    do
-                      *op++ = *ref++;
-                    while (--len);
-                  }
-
-                break;
-
-              case 9: *op++ = *ref++; /* fall-thru */
-              case 8: *op++ = *ref++; /* fall-thru */
-              case 7: *op++ = *ref++; /* fall-thru */
-              case 6: *op++ = *ref++; /* fall-thru */
-              case 5: *op++ = *ref++; /* fall-thru */
-              case 4: *op++ = *ref++; /* fall-thru */
-              case 3: *op++ = *ref++; /* fall-thru */
-              case 2: *op++ = *ref++; /* fall-thru */
-              case 1: *op++ = *ref++; /* fall-thru */
-              case 0: *op++ = *ref++; /* two octets more */
-                      *op++ = *ref++; /* fall-thru */
-            }
-#endif
-        }
-    }
-
-  return op - (u8 *)out_data;
-}
-#if defined(__GNUC__) && __GNUC__ >= 5
-#pragma GCC diagnostic pop
-#endif
diff --git a/redis-stable/src/memtest.c b/redis-stable/src/memtest.c
deleted file mode 100644
index bc0ac3a6..00000000
--- a/redis-stable/src/memtest.c
+++ /dev/null
@@ -1,365 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-#include <stdint.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <assert.h>
-#include <limits.h>
-#include <errno.h>
-#include <termios.h>
-#include <sys/ioctl.h>
-#if defined(__sun)
-#include <stropts.h>
-#endif
-#include "config.h"
-
-#if (ULONG_MAX == 4294967295UL)
-#define MEMTEST_32BIT
-#elif (ULONG_MAX == 18446744073709551615ULL)
-#define MEMTEST_64BIT
-#else
-#error "ULONG_MAX value not supported."
-#endif
-
-#ifdef MEMTEST_32BIT
-#define ULONG_ONEZERO 0xaaaaaaaaUL
-#define ULONG_ZEROONE 0x55555555UL
-#else
-#define ULONG_ONEZERO 0xaaaaaaaaaaaaaaaaUL
-#define ULONG_ZEROONE 0x5555555555555555UL
-#endif
-
-static struct winsize ws;
-size_t progress_printed; /* Printed chars in screen-wide progress bar. */
-size_t progress_full; /* How many chars to write to fill the progress bar. */
-
-void memtest_progress_start(char *title, int pass) {
-    int j;
-
-    printf("\x1b[H\x1b[2J");    /* Cursor home, clear screen. */
-    /* Fill with dots. */
-    for (j = 0; j < ws.ws_col*(ws.ws_row-2); j++) printf(".");
-    printf("Please keep the test running several minutes per GB of memory.\n");
-    printf("Also check http://www.memtest86.com/ and http://pyropus.ca/software/memtester/");
-    printf("\x1b[H\x1b[2K");          /* Cursor home, clear current line.  */
-    printf("%s [%d]\n", title, pass); /* Print title. */
-    progress_printed = 0;
-    progress_full = (size_t)ws.ws_col*(ws.ws_row-3);
-    fflush(stdout);
-}
-
-void memtest_progress_end(void) {
-    printf("\x1b[H\x1b[2J");    /* Cursor home, clear screen. */
-}
-
-void memtest_progress_step(size_t curr, size_t size, char c) {
-    size_t chars = ((unsigned long long)curr*progress_full)/size, j;
-
-    for (j = 0; j < chars-progress_printed; j++) printf("%c",c);
-    progress_printed = chars;
-    fflush(stdout);
-}
-
-/* Test that addressing is fine. Every location is populated with its own
- * address, and finally verified. This test is very fast but may detect
- * ASAP big issues with the memory subsystem. */
-int memtest_addressing(unsigned long *l, size_t bytes, int interactive) {
-    unsigned long words = bytes/sizeof(unsigned long);
-    unsigned long j, *p;
-
-    /* Fill */
-    p = l;
-    for (j = 0; j < words; j++) {
-        *p = (unsigned long)p;
-        p++;
-        if ((j & 0xffff) == 0 && interactive)
-            memtest_progress_step(j,words*2,'A');
-    }
-    /* Test */
-    p = l;
-    for (j = 0; j < words; j++) {
-        if (*p != (unsigned long)p) {
-            if (interactive) {
-                printf("\n*** MEMORY ADDRESSING ERROR: %p contains %lu\n",
-                    (void*) p, *p);
-                exit(1);
-            }
-            return 1;
-        }
-        p++;
-        if ((j & 0xffff) == 0 && interactive)
-            memtest_progress_step(j+words,words*2,'A');
-    }
-    return 0;
-}
-
-/* Fill words stepping a single page at every write, so we continue to
- * touch all the pages in the smallest amount of time reducing the
- * effectiveness of caches, and making it hard for the OS to transfer
- * pages on the swap.
- *
- * In this test we can't call rand() since the system may be completely
- * unable to handle library calls, so we have to resort to our own
- * PRNG that only uses local state. We use an xorshift* PRNG. */
-#define xorshift64star_next() do { \
-        rseed ^= rseed >> 12; \
-        rseed ^= rseed << 25; \
-        rseed ^= rseed >> 27; \
-        rout = rseed * UINT64_C(2685821657736338717); \
-} while(0)
-
-void memtest_fill_random(unsigned long *l, size_t bytes, int interactive) {
-    unsigned long step = 4096/sizeof(unsigned long);
-    unsigned long words = bytes/sizeof(unsigned long)/2;
-    unsigned long iwords = words/step;  /* words per iteration */
-    unsigned long off, w, *l1, *l2;
-    uint64_t rseed = UINT64_C(0xd13133de9afdb566); /* Just a random seed. */
-    uint64_t rout = 0;
-
-    assert((bytes & 4095) == 0);
-    for (off = 0; off < step; off++) {
-        l1 = l+off;
-        l2 = l1+words;
-        for (w = 0; w < iwords; w++) {
-            xorshift64star_next();
-            *l1 = *l2 = (unsigned long) rout;
-            l1 += step;
-            l2 += step;
-            if ((w & 0xffff) == 0 && interactive)
-                memtest_progress_step(w+iwords*off,words,'R');
-        }
-    }
-}
-
-/* Like memtest_fill_random() but uses the two specified values to fill
- * memory, in an alternated way (v1|v2|v1|v2|...) */
-void memtest_fill_value(unsigned long *l, size_t bytes, unsigned long v1,
-                        unsigned long v2, char sym, int interactive)
-{
-    unsigned long step = 4096/sizeof(unsigned long);
-    unsigned long words = bytes/sizeof(unsigned long)/2;
-    unsigned long iwords = words/step;  /* words per iteration */
-    unsigned long off, w, *l1, *l2, v;
-
-    assert((bytes & 4095) == 0);
-    for (off = 0; off < step; off++) {
-        l1 = l+off;
-        l2 = l1+words;
-        v = (off & 1) ? v2 : v1;
-        for (w = 0; w < iwords; w++) {
-#ifdef MEMTEST_32BIT
-            *l1 = *l2 = ((unsigned long)     v) |
-                        (((unsigned long)    v) << 16);
-#else
-            *l1 = *l2 = ((unsigned long)     v) |
-                        (((unsigned long)    v) << 16) |
-                        (((unsigned long)    v) << 32) |
-                        (((unsigned long)    v) << 48);
-#endif
-            l1 += step;
-            l2 += step;
-            if ((w & 0xffff) == 0 && interactive)
-                memtest_progress_step(w+iwords*off,words,sym);
-        }
-    }
-}
-
-int memtest_compare(unsigned long *l, size_t bytes, int interactive) {
-    unsigned long words = bytes/sizeof(unsigned long)/2;
-    unsigned long w, *l1, *l2;
-
-    assert((bytes & 4095) == 0);
-    l1 = l;
-    l2 = l1+words;
-    for (w = 0; w < words; w++) {
-        if (*l1 != *l2) {
-            if (interactive) {
-                printf("\n*** MEMORY ERROR DETECTED: %p != %p (%lu vs %lu)\n",
-                    (void*)l1, (void*)l2, *l1, *l2);
-                exit(1);
-            }
-            return 1;
-        }
-        l1 ++;
-        l2 ++;
-        if ((w & 0xffff) == 0 && interactive)
-            memtest_progress_step(w,words,'=');
-    }
-    return 0;
-}
-
-int memtest_compare_times(unsigned long *m, size_t bytes, int pass, int times,
-                          int interactive)
-{
-    int j;
-    int errors = 0;
-
-    for (j = 0; j < times; j++) {
-        if (interactive) memtest_progress_start("Compare",pass);
-        errors += memtest_compare(m,bytes,interactive);
-        if (interactive) memtest_progress_end();
-    }
-    return errors;
-}
-
-/* Test the specified memory. The number of bytes must be multiple of 4096.
- * If interactive is true the program exists with an error and prints
- * ASCII arts to show progresses. Instead when interactive is 0, it can
- * be used as an API call, and returns 1 if memory errors were found or
- * 0 if there were no errors detected. */
-int memtest_test(unsigned long *m, size_t bytes, int passes, int interactive) {
-    int pass = 0;
-    int errors = 0;
-
-    while (pass != passes) {
-        pass++;
-
-        if (interactive) memtest_progress_start("Addressing test",pass);
-        errors += memtest_addressing(m,bytes,interactive);
-        if (interactive) memtest_progress_end();
-
-        if (interactive) memtest_progress_start("Random fill",pass);
-        memtest_fill_random(m,bytes,interactive);
-        if (interactive) memtest_progress_end();
-        errors += memtest_compare_times(m,bytes,pass,4,interactive);
-
-        if (interactive) memtest_progress_start("Solid fill",pass);
-        memtest_fill_value(m,bytes,0,(unsigned long)-1,'S',interactive);
-        if (interactive) memtest_progress_end();
-        errors += memtest_compare_times(m,bytes,pass,4,interactive);
-
-        if (interactive) memtest_progress_start("Checkerboard fill",pass);
-        memtest_fill_value(m,bytes,ULONG_ONEZERO,ULONG_ZEROONE,'C',interactive);
-        if (interactive) memtest_progress_end();
-        errors += memtest_compare_times(m,bytes,pass,4,interactive);
-    }
-    return errors;
-}
-
-/* A version of memtest_test() that tests memory in small pieces
- * in order to restore the memory content at exit.
- *
- * One problem we have with this approach, is that the cache can avoid
- * real memory accesses, and we can't test big chunks of memory at the
- * same time, because we need to backup them on the stack (the allocator
- * may not be usable or we may be already in an out of memory condition).
- * So what we do is to try to trash the cache with useless memory accesses
- * between the fill and compare cycles. */
-#define MEMTEST_BACKUP_WORDS (1024*(1024/sizeof(long)))
-/* Random accesses of MEMTEST_DECACHE_SIZE are performed at the start and
- * end of the region between fill and compare cycles in order to trash
- * the cache. */
-#define MEMTEST_DECACHE_SIZE (1024*8)
-int memtest_preserving_test(unsigned long *m, size_t bytes, int passes) {
-    unsigned long backup[MEMTEST_BACKUP_WORDS];
-    unsigned long *p = m;
-    unsigned long *end = (unsigned long*) (((unsigned char*)m)+(bytes-MEMTEST_DECACHE_SIZE));
-    size_t left = bytes;
-    int errors = 0;
-
-    if (bytes & 4095) return 0; /* Can't test across 4k page boundaries. */
-    if (bytes < 4096*2) return 0; /* Can't test a single page. */
-
-    while(left) {
-        /* If we have to test a single final page, go back a single page
-         * so that we can test two pages, since the code can't test a single
-         * page but at least two. */
-        if (left == 4096) {
-            left += 4096;
-            p -= 4096/sizeof(unsigned long);
-        }
-
-        int pass = 0;
-        size_t len = (left > sizeof(backup)) ? sizeof(backup) : left;
-
-        /* Always test an even number of pages. */
-        if (len/4096 % 2) len -= 4096;
-
-        memcpy(backup,p,len); /* Backup. */
-        while(pass != passes) {
-            pass++;
-            errors += memtest_addressing(p,len,0);
-            memtest_fill_random(p,len,0);
-            if (bytes >= MEMTEST_DECACHE_SIZE) {
-                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
-                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
-            }
-            errors += memtest_compare_times(p,len,pass,4,0);
-            memtest_fill_value(p,len,0,(unsigned long)-1,'S',0);
-            if (bytes >= MEMTEST_DECACHE_SIZE) {
-                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
-                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
-            }
-            errors += memtest_compare_times(p,len,pass,4,0);
-            memtest_fill_value(p,len,ULONG_ONEZERO,ULONG_ZEROONE,'C',0);
-            if (bytes >= MEMTEST_DECACHE_SIZE) {
-                memtest_compare_times(m,MEMTEST_DECACHE_SIZE,pass,1,0);
-                memtest_compare_times(end,MEMTEST_DECACHE_SIZE,pass,1,0);
-            }
-            errors += memtest_compare_times(p,len,pass,4,0);
-        }
-        memcpy(p,backup,len); /* Restore. */
-        left -= len;
-        p += len/sizeof(unsigned long);
-    }
-    return errors;
-}
-
-/* Perform an interactive test allocating the specified number of megabytes. */
-void memtest_alloc_and_test(size_t megabytes, int passes) {
-    size_t bytes = megabytes*1024*1024;
-    unsigned long *m = malloc(bytes);
-
-    if (m == NULL) {
-        fprintf(stderr,"Unable to allocate %zu megabytes: %s",
-            megabytes, strerror(errno));
-        exit(1);
-    }
-    memtest_test(m,bytes,passes,1);
-    free(m);
-}
-
-void memtest(size_t megabytes, int passes) {
-#if !defined(__HAIKU__)
-    if (ioctl(1, TIOCGWINSZ, &ws) == -1) {
-        ws.ws_col = 80;
-        ws.ws_row = 20;
-    }
-#else
-    ws.ws_col = 80;
-    ws.ws_row = 20;
-#endif
-    memtest_alloc_and_test(megabytes,passes);
-    printf("\nYour memory passed this test.\n");
-    printf("Please if you are still in doubt use the following two tools:\n");
-    printf("1) memtest86: http://www.memtest86.com/\n");
-    printf("2) memtester: http://pyropus.ca/software/memtester/\n");
-    exit(0);
-}
diff --git a/redis-stable/src/mkreleasehdr.sh b/redis-stable/src/mkreleasehdr.sh
deleted file mode 100755
index 236c26c2..00000000
--- a/redis-stable/src/mkreleasehdr.sh
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/sh
-GIT_SHA1=`(git show-ref --head --hash=8 2> /dev/null || echo 00000000) | head -n1`
-GIT_DIRTY=`git diff --no-ext-diff 2> /dev/null | wc -l`
-BUILD_ID=`uname -n`"-"`date +%s`
-if [ -n "$SOURCE_DATE_EPOCH" ]; then
-  BUILD_ID=$(date -u -d "@$SOURCE_DATE_EPOCH" +%s 2>/dev/null || date -u -r "$SOURCE_DATE_EPOCH" +%s 2>/dev/null || date -u +%s)
-fi
-test -f release.h || touch release.h
-(cat release.h | grep SHA1 | grep $GIT_SHA1) && \
-(cat release.h | grep DIRTY | grep $GIT_DIRTY) && exit 0 # Already up-to-date
-echo "#define REDIS_GIT_SHA1 \"$GIT_SHA1\"" > release.h
-echo "#define REDIS_GIT_DIRTY \"$GIT_DIRTY\"" >> release.h
-echo "#define REDIS_BUILD_ID \"$BUILD_ID\"" >> release.h
-touch release.c # Force recompile of release.c
diff --git a/redis-stable/src/module.c b/redis-stable/src/module.c
deleted file mode 100644
index adca9dc9..00000000
--- a/redis-stable/src/module.c
+++ /dev/null
@@ -1,9506 +0,0 @@
-/*
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* --------------------------------------------------------------------------
- * Modules API documentation information
- *
- * The comments in this file are used to generate the API documentation on the
- * Redis website.
- *
- * Each function starting with RM_ and preceded by a block comment is included
- * in the API documentation. To hide an RM_ function, put a blank line between
- * the comment and the function definition or put the comment inside the
- * function body.
- *
- * The functions are divided into sections. Each section is preceded by a
- * documentation block, which is comment block starting with a markdown level 2
- * heading, i.e. a line starting with ##, on the first line of the comment block
- * (with the exception of a ----- line which can appear first). Other comment
- * blocks, which are not intended for the modules API user, such as this comment
- * block, do NOT start with a markdown level 2 heading, so they are included in
- * the generated a API documentation.
- *
- * The documentation comments may contain markdown formatting. Some automatic
- * replacements are done, such as the replacement of RM with RedisModule in
- * function names. For details, see the script src/modules/gendoc.rb.
- * -------------------------------------------------------------------------- */
-
-#include "server.h"
-#include "cluster.h"
-#include "slowlog.h"
-#include "rdb.h"
-#include "monotonic.h"
-#include <dlfcn.h>
-#include <sys/stat.h>
-#include <sys/wait.h>
-
-/* --------------------------------------------------------------------------
- * Private data structures used by the modules system. Those are data
- * structures that are never exposed to Redis Modules, if not as void
- * pointers that have an API the module can call with them)
- * -------------------------------------------------------------------------- */
-
-typedef struct RedisModuleInfoCtx {
-    struct RedisModule *module;
-    const char *requested_section;
-    sds info;           /* info string we collected so far */
-    int sections;       /* number of sections we collected so far */
-    int in_section;     /* indication if we're in an active section or not */
-    int in_dict_field;  /* indication that we're currently appending to a dict */
-} RedisModuleInfoCtx;
-
-typedef void (*RedisModuleInfoFunc)(RedisModuleInfoCtx *ctx, int for_crash_report);
-typedef void (*RedisModuleDefragFunc)(struct RedisModuleDefragCtx *ctx);
-
-/* This structure represents a module inside the system. */
-struct RedisModule {
-    void *handle;   /* Module dlopen() handle. */
-    char *name;     /* Module name. */
-    int ver;        /* Module version. We use just progressive integers. */
-    int apiver;     /* Module API version as requested during initialization.*/
-    list *types;    /* Module data types. */
-    list *usedby;   /* List of modules using APIs from this one. */
-    list *using;    /* List of modules we use some APIs of. */
-    list *filters;  /* List of filters the module has registered. */
-    int in_call;    /* RM_Call() nesting level */
-    int in_hook;    /* Hooks callback nesting level for this module (0 or 1). */
-    int options;    /* Module options and capabilities. */
-    int blocked_clients;         /* Count of RedisModuleBlockedClient in this module. */
-    RedisModuleInfoFunc info_cb; /* Callback for module to add INFO fields. */
-    RedisModuleDefragFunc defrag_cb;    /* Callback for global data defrag. */
-};
-typedef struct RedisModule RedisModule;
-
-/* This represents a shared API. Shared APIs will be used to populate
- * the server.sharedapi dictionary, mapping names of APIs exported by
- * modules for other modules to use, to their structure specifying the
- * function pointer that can be called. */
-struct RedisModuleSharedAPI {
-    void *func;
-    RedisModule *module;
-};
-typedef struct RedisModuleSharedAPI RedisModuleSharedAPI;
-
-static dict *modules; /* Hash table of modules. SDS -> RedisModule ptr.*/
-
-/* Entries in the context->amqueue array, representing objects to free
- * when the callback returns. */
-struct AutoMemEntry {
-    void *ptr;
-    int type;
-};
-
-/* AutMemEntry type field values. */
-#define REDISMODULE_AM_KEY 0
-#define REDISMODULE_AM_STRING 1
-#define REDISMODULE_AM_REPLY 2
-#define REDISMODULE_AM_FREED 3 /* Explicitly freed by user already. */
-#define REDISMODULE_AM_DICT 4
-#define REDISMODULE_AM_INFO 5
-
-/* The pool allocator block. Redis Modules can allocate memory via this special
- * allocator that will automatically release it all once the callback returns.
- * This means that it can only be used for ephemeral allocations. However
- * there are two advantages for modules to use this API:
- *
- * 1) The memory is automatically released when the callback returns.
- * 2) This allocator is faster for many small allocations since whole blocks
- *    are allocated, and small pieces returned to the caller just advancing
- *    the index of the allocation.
- *
- * Allocations are always rounded to the size of the void pointer in order
- * to always return aligned memory chunks. */
-
-#define REDISMODULE_POOL_ALLOC_MIN_SIZE (1024*8)
-#define REDISMODULE_POOL_ALLOC_ALIGN (sizeof(void*))
-
-typedef struct RedisModulePoolAllocBlock {
-    uint32_t size;
-    uint32_t used;
-    struct RedisModulePoolAllocBlock *next;
-    char memory[];
-} RedisModulePoolAllocBlock;
-
-/* This structure represents the context in which Redis modules operate.
- * Most APIs module can access, get a pointer to the context, so that the API
- * implementation can hold state across calls, or remember what to free after
- * the call and so forth.
- *
- * Note that not all the context structure is always filled with actual values
- * but only the fields needed in a given context. */
-
-struct RedisModuleBlockedClient;
-
-struct RedisModuleCtx {
-    void *getapifuncptr;            /* NOTE: Must be the first field. */
-    struct RedisModule *module;     /* Module reference. */
-    client *client;                 /* Client calling a command. */
-    struct RedisModuleBlockedClient *blocked_client; /* Blocked client for
-                                                        thread safe context. */
-    struct AutoMemEntry *amqueue;   /* Auto memory queue of objects to free. */
-    int amqueue_len;                /* Number of slots in amqueue. */
-    int amqueue_used;               /* Number of used slots in amqueue. */
-    int flags;                      /* REDISMODULE_CTX_... flags. */
-    void **postponed_arrays;        /* To set with RM_ReplySetArrayLength(). */
-    int postponed_arrays_count;     /* Number of entries in postponed_arrays. */
-    void *blocked_privdata;         /* Privdata set when unblocking a client. */
-    RedisModuleString *blocked_ready_key; /* Key ready when the reply callback
-                                             gets called for clients blocked
-                                             on keys. */
-
-    /* Used if there is the REDISMODULE_CTX_KEYS_POS_REQUEST flag set. */
-    getKeysResult *keys_result;
-
-    struct RedisModulePoolAllocBlock *pa_head;
-    redisOpArray saved_oparray;    /* When propagating commands in a callback
-                                      we reallocate the "also propagate" op
-                                      array. Here we save the old one to
-                                      restore it later. */
-};
-typedef struct RedisModuleCtx RedisModuleCtx;
-
-#define REDISMODULE_CTX_INIT {(void*)(unsigned long)&RM_GetApi, NULL, NULL, NULL, NULL, 0, 0, 0, NULL, 0, NULL, NULL, NULL, NULL, {0}}
-#define REDISMODULE_CTX_AUTO_MEMORY (1<<0)
-#define REDISMODULE_CTX_KEYS_POS_REQUEST (1<<1)
-#define REDISMODULE_CTX_BLOCKED_REPLY (1<<2)
-#define REDISMODULE_CTX_BLOCKED_TIMEOUT (1<<3)
-#define REDISMODULE_CTX_THREAD_SAFE (1<<4)
-#define REDISMODULE_CTX_BLOCKED_DISCONNECTED (1<<5)
-#define REDISMODULE_CTX_MODULE_COMMAND_CALL (1<<6)
-#define REDISMODULE_CTX_MULTI_EMITTED (1<<7)
-
-/* This represents a Redis key opened with RM_OpenKey(). */
-struct RedisModuleKey {
-    RedisModuleCtx *ctx;
-    redisDb *db;
-    robj *key;      /* Key name object. */
-    robj *value;    /* Value object, or NULL if the key was not found. */
-    void *iter;     /* Iterator. */
-    int mode;       /* Opening mode. */
-
-    union {
-        struct {
-            /* Zset iterator, use only if value->type == OBJ_ZSET */
-            uint32_t type;         /* REDISMODULE_ZSET_RANGE_* */
-            zrangespec rs;         /* Score range. */
-            zlexrangespec lrs;     /* Lex range. */
-            uint32_t start;        /* Start pos for positional ranges. */
-            uint32_t end;          /* End pos for positional ranges. */
-            void *current;         /* Zset iterator current node. */
-            int er;                /* Zset iterator end reached flag
-                                       (true if end was reached). */
-        } zset;
-        struct {
-            /* Stream, use only if value->type == OBJ_STREAM */
-            streamID currentid;    /* Current entry while iterating. */
-            int64_t numfieldsleft; /* Fields left to fetch for current entry. */
-            int signalready;       /* Flag that signalKeyAsReady() is needed. */
-        } stream;
-    } u;
-};
-typedef struct RedisModuleKey RedisModuleKey;
-
-/* RedisModuleKey 'ztype' values. */
-#define REDISMODULE_ZSET_RANGE_NONE 0       /* This must always be 0. */
-#define REDISMODULE_ZSET_RANGE_LEX 1
-#define REDISMODULE_ZSET_RANGE_SCORE 2
-#define REDISMODULE_ZSET_RANGE_POS 3
-
-/* Function pointer type of a function representing a command inside
- * a Redis module. */
-struct RedisModuleBlockedClient;
-typedef int (*RedisModuleCmdFunc) (RedisModuleCtx *ctx, void **argv, int argc);
-typedef void (*RedisModuleDisconnectFunc) (RedisModuleCtx *ctx, struct RedisModuleBlockedClient *bc);
-
-/* This struct holds the information about a command registered by a module.*/
-struct RedisModuleCommandProxy {
-    struct RedisModule *module;
-    RedisModuleCmdFunc func;
-    struct redisCommand *rediscmd;
-};
-typedef struct RedisModuleCommandProxy RedisModuleCommandProxy;
-
-#define REDISMODULE_REPLYFLAG_NONE 0
-#define REDISMODULE_REPLYFLAG_TOPARSE (1<<0) /* Protocol must be parsed. */
-#define REDISMODULE_REPLYFLAG_NESTED (1<<1)  /* Nested reply object. No proto
-                                                or struct free. */
-
-/* Reply of RM_Call() function. The function is filled in a lazy
- * way depending on the function called on the reply structure. By default
- * only the type, proto and protolen are filled. */
-typedef struct RedisModuleCallReply {
-    RedisModuleCtx *ctx;
-    int type;       /* REDISMODULE_REPLY_... */
-    int flags;      /* REDISMODULE_REPLYFLAG_...  */
-    size_t len;     /* Len of strings or num of elements of arrays. */
-    char *proto;    /* Raw reply protocol. An SDS string at top-level object. */
-    size_t protolen;/* Length of protocol. */
-    union {
-        const char *str; /* String pointer for string and error replies. This
-                            does not need to be freed, always points inside
-                            a reply->proto buffer of the reply object or, in
-                            case of array elements, of parent reply objects. */
-        long long ll;    /* Reply value for integer reply. */
-        struct RedisModuleCallReply *array; /* Array of sub-reply elements. */
-    } val;
-} RedisModuleCallReply;
-
-/* Structure representing a blocked client. We get a pointer to such
- * an object when blocking from modules. */
-typedef struct RedisModuleBlockedClient {
-    client *client;  /* Pointer to the blocked client. or NULL if the client
-                        was destroyed during the life of this object. */
-    RedisModule *module;    /* Module blocking the client. */
-    RedisModuleCmdFunc reply_callback; /* Reply callback on normal completion.*/
-    RedisModuleCmdFunc timeout_callback; /* Reply callback on timeout. */
-    RedisModuleDisconnectFunc disconnect_callback; /* Called on disconnection.*/
-    void (*free_privdata)(RedisModuleCtx*,void*);/* privdata cleanup callback.*/
-    void *privdata;     /* Module private data that may be used by the reply
-                           or timeout callback. It is set via the
-                           RedisModule_UnblockClient() API. */
-    client *reply_client;           /* Fake client used to accumulate replies
-                                       in thread safe contexts. */
-    int dbid;           /* Database number selected by the original client. */
-    int blocked_on_keys;    /* If blocked via RM_BlockClientOnKeys(). */
-    int unblocked;          /* Already on the moduleUnblocked list. */
-    monotime background_timer; /* Timer tracking the start of background work */
-    uint64_t background_duration; /* Current command background time duration.
-                                     Used for measuring latency of blocking cmds */
-} RedisModuleBlockedClient;
-
-static pthread_mutex_t moduleUnblockedClientsMutex = PTHREAD_MUTEX_INITIALIZER;
-static list *moduleUnblockedClients;
-
-/* We need a mutex that is unlocked / relocked in beforeSleep() in order to
- * allow thread safe contexts to execute commands at a safe moment. */
-static pthread_mutex_t moduleGIL = PTHREAD_MUTEX_INITIALIZER;
-
-
-/* Function pointer type for keyspace event notification subscriptions from modules. */
-typedef int (*RedisModuleNotificationFunc) (RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key);
-
-/* Keyspace notification subscriber information.
- * See RM_SubscribeToKeyspaceEvents() for more information. */
-typedef struct RedisModuleKeyspaceSubscriber {
-    /* The module subscribed to the event */
-    RedisModule *module;
-    /* Notification callback in the module*/
-    RedisModuleNotificationFunc notify_callback;
-    /* A bit mask of the events the module is interested in */
-    int event_mask;
-    /* Active flag set on entry, to avoid reentrant subscribers
-     * calling themselves */
-    int active;
-} RedisModuleKeyspaceSubscriber;
-
-/* The module keyspace notification subscribers list */
-static list *moduleKeyspaceSubscribers;
-
-/* Static client recycled for when we need to provide a context with a client
- * in a situation where there is no client to provide. This avoids allocating
- * a new client per round. For instance this is used in the keyspace
- * notifications, timers and cluster messages callbacks. */
-static client *moduleFreeContextReusedClient;
-
-/* Data structures related to the exported dictionary data structure. */
-typedef struct RedisModuleDict {
-    rax *rax;                       /* The radix tree. */
-} RedisModuleDict;
-
-typedef struct RedisModuleDictIter {
-    RedisModuleDict *dict;
-    raxIterator ri;
-} RedisModuleDictIter;
-
-typedef struct RedisModuleCommandFilterCtx {
-    RedisModuleString **argv;
-    int argc;
-} RedisModuleCommandFilterCtx;
-
-typedef void (*RedisModuleCommandFilterFunc) (RedisModuleCommandFilterCtx *filter);
-
-typedef struct RedisModuleCommandFilter {
-    /* The module that registered the filter */
-    RedisModule *module;
-    /* Filter callback function */
-    RedisModuleCommandFilterFunc callback;
-    /* REDISMODULE_CMDFILTER_* flags */
-    int flags;
-} RedisModuleCommandFilter;
-
-/* Registered filters */
-static list *moduleCommandFilters;
-
-typedef void (*RedisModuleForkDoneHandler) (int exitcode, int bysignal, void *user_data);
-
-static struct RedisModuleForkInfo {
-    RedisModuleForkDoneHandler done_handler;
-    void* done_handler_user_data;
-} moduleForkInfo = {0};
-
-typedef struct RedisModuleServerInfoData {
-    rax *rax;                       /* parsed info data. */
-} RedisModuleServerInfoData;
-
-/* Flags for moduleCreateArgvFromUserFormat(). */
-#define REDISMODULE_ARGV_REPLICATE (1<<0)
-#define REDISMODULE_ARGV_NO_AOF (1<<1)
-#define REDISMODULE_ARGV_NO_REPLICAS (1<<2)
-
-/* Determine whether Redis should signalModifiedKey implicitly.
- * In case 'ctx' has no 'module' member (and therefore no module->options),
- * we assume default behavior, that is, Redis signals.
- * (see RM_GetThreadSafeContext) */
-#define SHOULD_SIGNAL_MODIFIED_KEYS(ctx) \
-    ctx->module? !(ctx->module->options & REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED) : 1
-
-/* Server events hooks data structures and defines: this modules API
- * allow modules to subscribe to certain events in Redis, such as
- * the start and end of an RDB or AOF save, the change of role in replication,
- * and similar other events. */
-
-typedef struct RedisModuleEventListener {
-    RedisModule *module;
-    RedisModuleEvent event;
-    RedisModuleEventCallback callback;
-} RedisModuleEventListener;
-
-list *RedisModule_EventListeners; /* Global list of all the active events. */
-unsigned long long ModulesInHooks = 0; /* Total number of modules in hooks
-                                          callbacks right now. */
-
-/* Data structures related to the redis module users */
-
-/* This is the object returned by RM_CreateModuleUser(). The module API is
- * able to create users, set ACLs to such users, and later authenticate
- * clients using such newly created users. */
-typedef struct RedisModuleUser {
-    user *user; /* Reference to the real redis user */
-} RedisModuleUser;
-
-
-/* --------------------------------------------------------------------------
- * Prototypes
- * -------------------------------------------------------------------------- */
-
-void RM_FreeCallReply(RedisModuleCallReply *reply);
-void RM_CloseKey(RedisModuleKey *key);
-void autoMemoryCollect(RedisModuleCtx *ctx);
-robj **moduleCreateArgvFromUserFormat(const char *cmdname, const char *fmt, int *argcp, int *flags, va_list ap);
-void moduleReplicateMultiIfNeeded(RedisModuleCtx *ctx);
-void RM_ZsetRangeStop(RedisModuleKey *kp);
-static void zsetKeyReset(RedisModuleKey *key);
-static void moduleInitKeyTypeSpecific(RedisModuleKey *key);
-void RM_FreeDict(RedisModuleCtx *ctx, RedisModuleDict *d);
-void RM_FreeServerInfo(RedisModuleCtx *ctx, RedisModuleServerInfoData *data);
-
-/* --------------------------------------------------------------------------
- * ## Heap allocation raw functions
- *
- * Memory allocated with these functions are taken into account by Redis key
- * eviction algorithms and are reported in Redis memory usage information.
- * -------------------------------------------------------------------------- */
-
-/* Use like malloc(). Memory allocated with this function is reported in
- * Redis INFO memory, used for keys eviction according to maxmemory settings
- * and in general is taken into account as memory allocated by Redis.
- * You should avoid using malloc(). */
-void *RM_Alloc(size_t bytes) {
-    return zmalloc(bytes);
-}
-
-/* Use like calloc(). Memory allocated with this function is reported in
- * Redis INFO memory, used for keys eviction according to maxmemory settings
- * and in general is taken into account as memory allocated by Redis.
- * You should avoid using calloc() directly. */
-void *RM_Calloc(size_t nmemb, size_t size) {
-    return zcalloc(nmemb*size);
-}
-
-/* Use like realloc() for memory obtained with RedisModule_Alloc(). */
-void* RM_Realloc(void *ptr, size_t bytes) {
-    return zrealloc(ptr,bytes);
-}
-
-/* Use like free() for memory obtained by RedisModule_Alloc() and
- * RedisModule_Realloc(). However you should never try to free with
- * RedisModule_Free() memory allocated with malloc() inside your module. */
-void RM_Free(void *ptr) {
-    zfree(ptr);
-}
-
-/* Like strdup() but returns memory allocated with RedisModule_Alloc(). */
-char *RM_Strdup(const char *str) {
-    return zstrdup(str);
-}
-
-/* --------------------------------------------------------------------------
- * Pool allocator
- * -------------------------------------------------------------------------- */
-
-/* Release the chain of blocks used for pool allocations. */
-void poolAllocRelease(RedisModuleCtx *ctx) {
-    RedisModulePoolAllocBlock *head = ctx->pa_head, *next;
-
-    while(head != NULL) {
-        next = head->next;
-        zfree(head);
-        head = next;
-    }
-    ctx->pa_head = NULL;
-}
-
-/* Return heap allocated memory that will be freed automatically when the
- * module callback function returns. Mostly suitable for small allocations
- * that are short living and must be released when the callback returns
- * anyway. The returned memory is aligned to the architecture word size
- * if at least word size bytes are requested, otherwise it is just
- * aligned to the next power of two, so for example a 3 bytes request is
- * 4 bytes aligned while a 2 bytes request is 2 bytes aligned.
- *
- * There is no realloc style function since when this is needed to use the
- * pool allocator is not a good idea.
- *
- * The function returns NULL if `bytes` is 0. */
-void *RM_PoolAlloc(RedisModuleCtx *ctx, size_t bytes) {
-    if (bytes == 0) return NULL;
-    RedisModulePoolAllocBlock *b = ctx->pa_head;
-    size_t left = b ? b->size - b->used : 0;
-
-    /* Fix alignment. */
-    if (left >= bytes) {
-        size_t alignment = REDISMODULE_POOL_ALLOC_ALIGN;
-        while (bytes < alignment && alignment/2 >= bytes) alignment /= 2;
-        if (b->used % alignment)
-            b->used += alignment - (b->used % alignment);
-        left = (b->used > b->size) ? 0 : b->size - b->used;
-    }
-
-    /* Create a new block if needed. */
-    if (left < bytes) {
-        size_t blocksize = REDISMODULE_POOL_ALLOC_MIN_SIZE;
-        if (blocksize < bytes) blocksize = bytes;
-        b = zmalloc(sizeof(*b) + blocksize);
-        b->size = blocksize;
-        b->used = 0;
-        b->next = ctx->pa_head;
-        ctx->pa_head = b;
-    }
-
-    char *retval = b->memory + b->used;
-    b->used += bytes;
-    return retval;
-}
-
-/* --------------------------------------------------------------------------
- * Helpers for modules API implementation
- * -------------------------------------------------------------------------- */
-
-/* Create an empty key of the specified type. `key` must point to a key object
- * opened for writing where the `.value` member is set to NULL because the
- * key was found to be non existing.
- *
- * On success REDISMODULE_OK is returned and the key is populated with
- * the value of the specified type. The function fails and returns
- * REDISMODULE_ERR if:
- *
- * 1. The key is not open for writing.
- * 2. The key is not empty.
- * 3. The specified type is unknown.
- */
-int moduleCreateEmptyKey(RedisModuleKey *key, int type) {
-    robj *obj;
-
-    /* The key must be open for writing and non existing to proceed. */
-    if (!(key->mode & REDISMODULE_WRITE) || key->value)
-        return REDISMODULE_ERR;
-
-    switch(type) {
-    case REDISMODULE_KEYTYPE_LIST:
-        obj = createQuicklistObject();
-        quicklistSetOptions(obj->ptr, server.list_max_ziplist_size,
-                            server.list_compress_depth);
-        break;
-    case REDISMODULE_KEYTYPE_ZSET:
-        obj = createZsetZiplistObject();
-        break;
-    case REDISMODULE_KEYTYPE_HASH:
-        obj = createHashObject();
-        break;
-    case REDISMODULE_KEYTYPE_STREAM:
-        obj = createStreamObject();
-        break;
-    default: return REDISMODULE_ERR;
-    }
-    dbAdd(key->db,key->key,obj);
-    key->value = obj;
-    moduleInitKeyTypeSpecific(key);
-    return REDISMODULE_OK;
-}
-
-/* This function is called in low-level API implementation functions in order
- * to check if the value associated with the key remained empty after an
- * operation that removed elements from an aggregate data type.
- *
- * If this happens, the key is deleted from the DB and the key object state
- * is set to the right one in order to be targeted again by write operations
- * possibly recreating the key if needed.
- *
- * The function returns 1 if the key value object is found empty and is
- * deleted, otherwise 0 is returned. */
-int moduleDelKeyIfEmpty(RedisModuleKey *key) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL) return 0;
-    int isempty;
-    robj *o = key->value;
-
-    switch(o->type) {
-    case OBJ_LIST: isempty = listTypeLength(o) == 0; break;
-    case OBJ_SET: isempty = setTypeSize(o) == 0; break;
-    case OBJ_ZSET: isempty = zsetLength(o) == 0; break;
-    case OBJ_HASH: isempty = hashTypeLength(o) == 0; break;
-    case OBJ_STREAM: isempty = streamLength(o) == 0; break;
-    default: isempty = 0;
-    }
-
-    if (isempty) {
-        dbDelete(key->db,key->key);
-        key->value = NULL;
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* --------------------------------------------------------------------------
- * Service API exported to modules
- *
- * Note that all the exported APIs are called RM_<funcname> in the core
- * and RedisModule_<funcname> in the module side (defined as function
- * pointers in redismodule.h). In this way the dynamic linker does not
- * mess with our global function pointers, overriding it with the symbols
- * defined in the main executable having the same names.
- * -------------------------------------------------------------------------- */
-
-int RM_GetApi(const char *funcname, void **targetPtrPtr) {
-    /* Lookup the requested module API and store the function pointer into the
-     * target pointer. The function returns REDISMODULE_ERR if there is no such
-     * named API, otherwise REDISMODULE_OK.
-     *
-     * This function is not meant to be used by modules developer, it is only
-     * used implicitly by including redismodule.h. */
-    dictEntry *he = dictFind(server.moduleapi, funcname);
-    if (!he) return REDISMODULE_ERR;
-    *targetPtrPtr = dictGetVal(he);
-    return REDISMODULE_OK;
-}
-
-/* Helper function for when a command callback is called, in order to handle
- * details needed to correctly replicate commands. */
-void moduleHandlePropagationAfterCommandCallback(RedisModuleCtx *ctx) {
-    client *c = ctx->client;
-
-    /* We don't need to do anything here if the context was never used
-     * in order to propagate commands. */
-    if (!(ctx->flags & REDISMODULE_CTX_MULTI_EMITTED)) return;
-
-    /* We don't need to do anything here if the server isn't inside
-     * a transaction. */
-    if (!server.propagate_in_transaction) return;
-
-    /* If this command is executed from with Lua or MULTI/EXEC we do not
-     * need to propagate EXEC */
-    if (server.in_eval || server.in_exec) return;
-
-    /* Handle the replication of the final EXEC, since whatever a command
-     * emits is always wrapped around MULTI/EXEC. */
-    alsoPropagate(server.execCommand,c->db->id,&shared.exec,1,
-        PROPAGATE_AOF|PROPAGATE_REPL);
-    afterPropagateExec();
-
-    /* If this is not a module command context (but is instead a simple
-     * callback context), we have to handle directly the "also propagate"
-     * array and emit it. In a module command call this will be handled
-     * directly by call(). */
-    if (!(ctx->flags & REDISMODULE_CTX_MODULE_COMMAND_CALL) &&
-        server.also_propagate.numops)
-    {
-        for (int j = 0; j < server.also_propagate.numops; j++) {
-            redisOp *rop = &server.also_propagate.ops[j];
-            int target = rop->target;
-            if (target)
-                propagate(rop->cmd,rop->dbid,rop->argv,rop->argc,target);
-        }
-        redisOpArrayFree(&server.also_propagate);
-        /* Restore the previous oparray in case of nexted use of the API. */
-        server.also_propagate = ctx->saved_oparray;
-        /* We're done with saved_oparray, let's invalidate it. */
-        redisOpArrayInit(&ctx->saved_oparray);
-    }
-}
-
-/* Free the context after the user function was called. */
-void moduleFreeContext(RedisModuleCtx *ctx) {
-    moduleHandlePropagationAfterCommandCallback(ctx);
-    autoMemoryCollect(ctx);
-    poolAllocRelease(ctx);
-    if (ctx->postponed_arrays) {
-        zfree(ctx->postponed_arrays);
-        ctx->postponed_arrays_count = 0;
-        serverLog(LL_WARNING,
-            "API misuse detected in module %s: "
-            "RedisModule_ReplyWithArray(REDISMODULE_POSTPONED_ARRAY_LEN) "
-            "not matched by the same number of RedisModule_SetReplyArrayLen() "
-            "calls.",
-            ctx->module->name);
-    }
-    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) freeClient(ctx->client);
-}
-
-/* This Redis command binds the normal Redis command invocation with commands
- * exported by modules. */
-void RedisModuleCommandDispatcher(client *c) {
-    RedisModuleCommandProxy *cp = (void*)(unsigned long)c->cmd->getkeys_proc;
-    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-
-    ctx.flags |= REDISMODULE_CTX_MODULE_COMMAND_CALL;
-    ctx.module = cp->module;
-    ctx.client = c;
-    cp->func(&ctx,(void**)c->argv,c->argc);
-    moduleFreeContext(&ctx);
-
-    /* In some cases processMultibulkBuffer uses sdsMakeRoomFor to
-     * expand the query buffer, and in order to avoid a big object copy
-     * the query buffer SDS may be used directly as the SDS string backing
-     * the client argument vectors: sometimes this will result in the SDS
-     * string having unused space at the end. Later if a module takes ownership
-     * of the RedisString, such space will be wasted forever. Inside the
-     * Redis core this is not a problem because tryObjectEncoding() is called
-     * before storing strings in the key space. Here we need to do it
-     * for the module. */
-    for (int i = 0; i < c->argc; i++) {
-        /* Only do the work if the module took ownership of the object:
-         * in that case the refcount is no longer 1. */
-        if (c->argv[i]->refcount > 1)
-            trimStringObjectIfNeeded(c->argv[i]);
-    }
-}
-
-/* This function returns the list of keys, with the same interface as the
- * 'getkeys' function of the native commands, for module commands that exported
- * the "getkeys-api" flag during the registration. This is done when the
- * list of keys are not at fixed positions, so that first/last/step cannot
- * be used.
- *
- * In order to accomplish its work, the module command is called, flagging
- * the context in a way that the command can recognize this is a special
- * "get keys" call by calling RedisModule_IsKeysPositionRequest(ctx). */
-int moduleGetCommandKeysViaAPI(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result) {
-    RedisModuleCommandProxy *cp = (void*)(unsigned long)cmd->getkeys_proc;
-    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-
-    ctx.module = cp->module;
-    ctx.client = NULL;
-    ctx.flags |= REDISMODULE_CTX_KEYS_POS_REQUEST;
-
-    /* Initialize getKeysResult */
-    getKeysPrepareResult(result, MAX_KEYS_BUFFER);
-    ctx.keys_result = result;
-
-    cp->func(&ctx,(void**)argv,argc);
-    /* We currently always use the array allocated by RM_KeyAtPos() and don't try
-     * to optimize for the pre-allocated buffer.
-     */
-    moduleFreeContext(&ctx);
-    return result->numkeys;
-}
-
-/* --------------------------------------------------------------------------
- * ## Commands API
- *
- * These functions are used to implement custom Redis commands.
- *
- * For examples, see https://redis.io/topics/modules-intro.
- * -------------------------------------------------------------------------- */
-
-/* Return non-zero if a module command, that was declared with the
- * flag "getkeys-api", is called in a special way to get the keys positions
- * and not to get executed. Otherwise zero is returned. */
-int RM_IsKeysPositionRequest(RedisModuleCtx *ctx) {
-    return (ctx->flags & REDISMODULE_CTX_KEYS_POS_REQUEST) != 0;
-}
-
-/* When a module command is called in order to obtain the position of
- * keys, since it was flagged as "getkeys-api" during the registration,
- * the command implementation checks for this special call using the
- * RedisModule_IsKeysPositionRequest() API and uses this function in
- * order to report keys, like in the following example:
- *
- *     if (RedisModule_IsKeysPositionRequest(ctx)) {
- *         RedisModule_KeyAtPos(ctx,1);
- *         RedisModule_KeyAtPos(ctx,2);
- *     }
- *
- *  Note: in the example below the get keys API would not be needed since
- *  keys are at fixed positions. This interface is only used for commands
- *  with a more complex structure. */
-void RM_KeyAtPos(RedisModuleCtx *ctx, int pos) {
-    if (!(ctx->flags & REDISMODULE_CTX_KEYS_POS_REQUEST) || !ctx->keys_result) return;
-    if (pos <= 0) return;
-
-    getKeysResult *res = ctx->keys_result;
-
-    /* Check overflow */
-    if (res->numkeys == res->size) {
-        int newsize = res->size + (res->size > 8192 ? 8192 : res->size);
-        getKeysPrepareResult(res, newsize);
-    }
-
-    res->keys[res->numkeys++] = pos;
-}
-
-/* Helper for RM_CreateCommand(). Turns a string representing command
- * flags into the command flags used by the Redis core.
- *
- * It returns the set of flags, or -1 if unknown flags are found. */
-int64_t commandFlagsFromString(char *s) {
-    int count, j;
-    int64_t flags = 0;
-    sds *tokens = sdssplitlen(s,strlen(s)," ",1,&count);
-    for (j = 0; j < count; j++) {
-        char *t = tokens[j];
-        if (!strcasecmp(t,"write")) flags |= CMD_WRITE;
-        else if (!strcasecmp(t,"readonly")) flags |= CMD_READONLY;
-        else if (!strcasecmp(t,"admin")) flags |= CMD_ADMIN;
-        else if (!strcasecmp(t,"deny-oom")) flags |= CMD_DENYOOM;
-        else if (!strcasecmp(t,"deny-script")) flags |= CMD_NOSCRIPT;
-        else if (!strcasecmp(t,"allow-loading")) flags |= CMD_LOADING;
-        else if (!strcasecmp(t,"pubsub")) flags |= CMD_PUBSUB;
-        else if (!strcasecmp(t,"random")) flags |= CMD_RANDOM;
-        else if (!strcasecmp(t,"allow-stale")) flags |= CMD_STALE;
-        else if (!strcasecmp(t,"no-monitor")) flags |= CMD_SKIP_MONITOR;
-        else if (!strcasecmp(t,"no-slowlog")) flags |= CMD_SKIP_SLOWLOG;
-        else if (!strcasecmp(t,"fast")) flags |= CMD_FAST;
-        else if (!strcasecmp(t,"no-auth")) flags |= CMD_NO_AUTH;
-        else if (!strcasecmp(t,"may-replicate")) flags |= CMD_MAY_REPLICATE;
-        else if (!strcasecmp(t,"getkeys-api")) flags |= CMD_MODULE_GETKEYS;
-        else if (!strcasecmp(t,"no-cluster")) flags |= CMD_MODULE_NO_CLUSTER;
-        else break;
-    }
-    sdsfreesplitres(tokens,count);
-    if (j != count) return -1; /* Some token not processed correctly. */
-    return flags;
-}
-
-/* Register a new command in the Redis server, that will be handled by
- * calling the function pointer 'func' using the RedisModule calling
- * convention. The function returns REDISMODULE_ERR if the specified command
- * name is already busy or a set of invalid flags were passed, otherwise
- * REDISMODULE_OK is returned and the new command is registered.
- *
- * This function must be called during the initialization of the module
- * inside the RedisModule_OnLoad() function. Calling this function outside
- * of the initialization function is not defined.
- *
- * The command function type is the following:
- *
- *      int MyCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc);
- *
- * And is supposed to always return REDISMODULE_OK.
- *
- * The set of flags 'strflags' specify the behavior of the command, and should
- * be passed as a C string composed of space separated words, like for
- * example "write deny-oom". The set of flags are:
- *
- * * **"write"**:     The command may modify the data set (it may also read
- *                    from it).
- * * **"readonly"**:  The command returns data from keys but never writes.
- * * **"admin"**:     The command is an administrative command (may change
- *                    replication or perform similar tasks).
- * * **"deny-oom"**:  The command may use additional memory and should be
- *                    denied during out of memory conditions.
- * * **"deny-script"**:   Don't allow this command in Lua scripts.
- * * **"allow-loading"**: Allow this command while the server is loading data.
- *                        Only commands not interacting with the data set
- *                        should be allowed to run in this mode. If not sure
- *                        don't use this flag.
- * * **"pubsub"**:    The command publishes things on Pub/Sub channels.
- * * **"random"**:    The command may have different outputs even starting
- *                    from the same input arguments and key values.
- * * **"allow-stale"**: The command is allowed to run on slaves that don't
- *                      serve stale data. Don't use if you don't know what
- *                      this means.
- * * **"no-monitor"**: Don't propagate the command on monitor. Use this if
- *                     the command has sensible data among the arguments.
- * * **"no-slowlog"**: Don't log this command in the slowlog. Use this if
- *                     the command has sensible data among the arguments.
- * * **"fast"**:      The command time complexity is not greater
- *                    than O(log(N)) where N is the size of the collection or
- *                    anything else representing the normal scalability
- *                    issue with the command.
- * * **"getkeys-api"**: The command implements the interface to return
- *                      the arguments that are keys. Used when start/stop/step
- *                      is not enough because of the command syntax.
- * * **"no-cluster"**: The command should not register in Redis Cluster
- *                     since is not designed to work with it because, for
- *                     example, is unable to report the position of the
- *                     keys, programmatically creates key names, or any
- *                     other reason.
- * * **"no-auth"**:    This command can be run by an un-authenticated client.
- *                     Normally this is used by a command that is used
- *                     to authenticate a client. 
- * * **"may-replicate"**: This command may generate replication traffic, even
- *                        though it's not a write command.  
- */
-int RM_CreateCommand(RedisModuleCtx *ctx, const char *name, RedisModuleCmdFunc cmdfunc, const char *strflags, int firstkey, int lastkey, int keystep) {
-    int64_t flags = strflags ? commandFlagsFromString((char*)strflags) : 0;
-    if (flags == -1) return REDISMODULE_ERR;
-    if ((flags & CMD_MODULE_NO_CLUSTER) && server.cluster_enabled)
-        return REDISMODULE_ERR;
-
-    struct redisCommand *rediscmd;
-    RedisModuleCommandProxy *cp;
-    sds cmdname = sdsnew(name);
-
-    /* Check if the command name is busy. */
-    if (lookupCommand(cmdname) != NULL) {
-        sdsfree(cmdname);
-        return REDISMODULE_ERR;
-    }
-
-    /* Create a command "proxy", which is a structure that is referenced
-     * in the command table, so that the generic command that works as
-     * binding between modules and Redis, can know what function to call
-     * and what the module is.
-     *
-     * Note that we use the Redis command table 'getkeys_proc' in order to
-     * pass a reference to the command proxy structure. */
-    cp = zmalloc(sizeof(*cp));
-    cp->module = ctx->module;
-    cp->func = cmdfunc;
-    cp->rediscmd = zmalloc(sizeof(*rediscmd));
-    cp->rediscmd->name = cmdname;
-    cp->rediscmd->proc = RedisModuleCommandDispatcher;
-    cp->rediscmd->arity = -1;
-    cp->rediscmd->flags = flags | CMD_MODULE;
-    cp->rediscmd->getkeys_proc = (redisGetKeysProc*)(unsigned long)cp;
-    cp->rediscmd->firstkey = firstkey;
-    cp->rediscmd->lastkey = lastkey;
-    cp->rediscmd->keystep = keystep;
-    cp->rediscmd->microseconds = 0;
-    cp->rediscmd->calls = 0;
-    cp->rediscmd->rejected_calls = 0;
-    cp->rediscmd->failed_calls = 0;
-    dictAdd(server.commands,sdsdup(cmdname),cp->rediscmd);
-    dictAdd(server.orig_commands,sdsdup(cmdname),cp->rediscmd);
-    cp->rediscmd->id = ACLGetCommandID(cmdname); /* ID used for ACL. */
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Module information and time measurement
- * -------------------------------------------------------------------------- */
-
-void RM_SetModuleAttribs(RedisModuleCtx *ctx, const char *name, int ver, int apiver) {
-    /* Called by RM_Init() to setup the `ctx->module` structure.
-     *
-     * This is an internal function, Redis modules developers don't need
-     * to use it. */
-    RedisModule *module;
-
-    if (ctx->module != NULL) return;
-    module = zmalloc(sizeof(*module));
-    module->name = sdsnew((char*)name);
-    module->ver = ver;
-    module->apiver = apiver;
-    module->types = listCreate();
-    module->usedby = listCreate();
-    module->using = listCreate();
-    module->filters = listCreate();
-    module->in_call = 0;
-    module->in_hook = 0;
-    module->options = 0;
-    module->info_cb = 0;
-    module->defrag_cb = 0;
-    ctx->module = module;
-}
-
-/* Return non-zero if the module name is busy.
- * Otherwise zero is returned. */
-int RM_IsModuleNameBusy(const char *name) {
-    sds modulename = sdsnew(name);
-    dictEntry *de = dictFind(modules,modulename);
-    sdsfree(modulename);
-    return de != NULL;
-}
-
-/* Return the current UNIX time in milliseconds. */
-long long RM_Milliseconds(void) {
-    return mstime();
-}
-
-/* Mark a point in time that will be used as the start time to calculate
- * the elapsed execution time when RM_BlockedClientMeasureTimeEnd() is called.
- * Within the same command, you can call multiple times
- * RM_BlockedClientMeasureTimeStart() and RM_BlockedClientMeasureTimeEnd()
- * to accummulate indepedent time intervals to the background duration.
- * This method always return REDISMODULE_OK. */
-int RM_BlockedClientMeasureTimeStart(RedisModuleBlockedClient *bc) {
-    elapsedStart(&(bc->background_timer));
-    return REDISMODULE_OK;
-}
-
-/* Mark a point in time that will be used as the end time
- * to calculate the elapsed execution time.
- * On success REDISMODULE_OK is returned.
- * This method only returns REDISMODULE_ERR if no start time was
- * previously defined ( meaning RM_BlockedClientMeasureTimeStart was not called ). */
-int RM_BlockedClientMeasureTimeEnd(RedisModuleBlockedClient *bc) {
-    // If the counter is 0 then we haven't called RM_BlockedClientMeasureTimeStart
-    if (!bc->background_timer)
-        return REDISMODULE_ERR;
-    bc->background_duration += elapsedUs(bc->background_timer);
-    return REDISMODULE_OK;
-}
-
-/* Set flags defining capabilities or behavior bit flags.
- *
- * REDISMODULE_OPTIONS_HANDLE_IO_ERRORS:
- * Generally, modules don't need to bother with this, as the process will just
- * terminate if a read error happens, however, setting this flag would allow
- * repl-diskless-load to work if enabled.
- * The module should use RedisModule_IsIOError after reads, before using the
- * data that was read, and in case of error, propagate it upwards, and also be
- * able to release the partially populated value and all it's allocations.
- *
- * REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED:
- * See RM_SignalModifiedKey().
- */
-void RM_SetModuleOptions(RedisModuleCtx *ctx, int options) {
-    ctx->module->options = options;
-}
-
-/* Signals that the key is modified from user's perspective (i.e. invalidate WATCH
- * and client side caching).
- *
- * This is done automatically when a key opened for writing is closed, unless
- * the option REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED has been set using
- * RM_SetModuleOptions().
-*/
-int RM_SignalModifiedKey(RedisModuleCtx *ctx, RedisModuleString *keyname) {
-    signalModifiedKey(ctx->client,ctx->client->db,keyname);
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Automatic memory management for modules
- * -------------------------------------------------------------------------- */
-
-/* Enable automatic memory management.
- *
- * The function must be called as the first function of a command implementation
- * that wants to use automatic memory.
- *
- * When enabled, automatic memory management tracks and automatically frees
- * keys, call replies and Redis string objects once the command returns. In most
- * cases this eliminates the need of calling the following functions:
- *
- * 1. RedisModule_CloseKey()
- * 2. RedisModule_FreeCallReply()
- * 3. RedisModule_FreeString()
- *
- * These functions can still be used with automatic memory management enabled,
- * to optimize loops that make numerous allocations for example. */
-void RM_AutoMemory(RedisModuleCtx *ctx) {
-    ctx->flags |= REDISMODULE_CTX_AUTO_MEMORY;
-}
-
-/* Add a new object to release automatically when the callback returns. */
-void autoMemoryAdd(RedisModuleCtx *ctx, int type, void *ptr) {
-    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return;
-    if (ctx->amqueue_used == ctx->amqueue_len) {
-        ctx->amqueue_len *= 2;
-        if (ctx->amqueue_len < 16) ctx->amqueue_len = 16;
-        ctx->amqueue = zrealloc(ctx->amqueue,sizeof(struct AutoMemEntry)*ctx->amqueue_len);
-    }
-    ctx->amqueue[ctx->amqueue_used].type = type;
-    ctx->amqueue[ctx->amqueue_used].ptr = ptr;
-    ctx->amqueue_used++;
-}
-
-/* Mark an object as freed in the auto release queue, so that users can still
- * free things manually if they want.
- *
- * The function returns 1 if the object was actually found in the auto memory
- * pool, otherwise 0 is returned. */
-int autoMemoryFreed(RedisModuleCtx *ctx, int type, void *ptr) {
-    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return 0;
-
-    int count = (ctx->amqueue_used+1)/2;
-    for (int j = 0; j < count; j++) {
-        for (int side = 0; side < 2; side++) {
-            /* For side = 0 check right side of the array, for
-             * side = 1 check the left side instead (zig-zag scanning). */
-            int i = (side == 0) ? (ctx->amqueue_used - 1 - j) : j;
-            if (ctx->amqueue[i].type == type &&
-                ctx->amqueue[i].ptr == ptr)
-            {
-                ctx->amqueue[i].type = REDISMODULE_AM_FREED;
-
-                /* Switch the freed element and the last element, to avoid growing
-                 * the queue unnecessarily if we allocate/free in a loop */
-                if (i != ctx->amqueue_used-1) {
-                    ctx->amqueue[i] = ctx->amqueue[ctx->amqueue_used-1];
-                }
-
-                /* Reduce the size of the queue because we either moved the top
-                 * element elsewhere or freed it */
-                ctx->amqueue_used--;
-                return 1;
-            }
-        }
-    }
-    return 0;
-}
-
-/* Release all the objects in queue. */
-void autoMemoryCollect(RedisModuleCtx *ctx) {
-    if (!(ctx->flags & REDISMODULE_CTX_AUTO_MEMORY)) return;
-    /* Clear the AUTO_MEMORY flag from the context, otherwise the functions
-     * we call to free the resources, will try to scan the auto release
-     * queue to mark the entries as freed. */
-    ctx->flags &= ~REDISMODULE_CTX_AUTO_MEMORY;
-    int j;
-    for (j = 0; j < ctx->amqueue_used; j++) {
-        void *ptr = ctx->amqueue[j].ptr;
-        switch(ctx->amqueue[j].type) {
-        case REDISMODULE_AM_STRING: decrRefCount(ptr); break;
-        case REDISMODULE_AM_REPLY: RM_FreeCallReply(ptr); break;
-        case REDISMODULE_AM_KEY: RM_CloseKey(ptr); break;
-        case REDISMODULE_AM_DICT: RM_FreeDict(NULL,ptr); break;
-        case REDISMODULE_AM_INFO: RM_FreeServerInfo(NULL,ptr); break;
-        }
-    }
-    ctx->flags |= REDISMODULE_CTX_AUTO_MEMORY;
-    zfree(ctx->amqueue);
-    ctx->amqueue = NULL;
-    ctx->amqueue_len = 0;
-    ctx->amqueue_used = 0;
-}
-
-/* --------------------------------------------------------------------------
- * ## String objects APIs
- * -------------------------------------------------------------------------- */
-
-/* Create a new module string object. The returned string must be freed
- * with RedisModule_FreeString(), unless automatic memory is enabled.
- *
- * The string is created by copying the `len` bytes starting
- * at `ptr`. No reference is retained to the passed buffer.
- *
- * The module context 'ctx' is optional and may be NULL if you want to create
- * a string out of the context scope. However in that case, the automatic
- * memory management will not be available, and the string memory must be
- * managed manually. */
-RedisModuleString *RM_CreateString(RedisModuleCtx *ctx, const char *ptr, size_t len) {
-    RedisModuleString *o = createStringObject(ptr,len);
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
-    return o;
-}
-
-/* Create a new module string object from a printf format and arguments.
- * The returned string must be freed with RedisModule_FreeString(), unless
- * automatic memory is enabled.
- *
- * The string is created using the sds formatter function sdscatvprintf().
- *
- * The passed context 'ctx' may be NULL if necessary, see the
- * RedisModule_CreateString() documentation for more info. */
-RedisModuleString *RM_CreateStringPrintf(RedisModuleCtx *ctx, const char *fmt, ...) {
-    sds s = sdsempty();
-
-    va_list ap;
-    va_start(ap, fmt);
-    s = sdscatvprintf(s, fmt, ap);
-    va_end(ap);
-
-    RedisModuleString *o = createObject(OBJ_STRING, s);
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
-
-    return o;
-}
-
-
-/* Like RedisModule_CreatString(), but creates a string starting from a long long
- * integer instead of taking a buffer and its length.
- *
- * The returned string must be released with RedisModule_FreeString() or by
- * enabling automatic memory management.
- *
- * The passed context 'ctx' may be NULL if necessary, see the
- * RedisModule_CreateString() documentation for more info. */
-RedisModuleString *RM_CreateStringFromLongLong(RedisModuleCtx *ctx, long long ll) {
-    char buf[LONG_STR_SIZE];
-    size_t len = ll2string(buf,sizeof(buf),ll);
-    return RM_CreateString(ctx,buf,len);
-}
-
-/* Like RedisModule_CreatString(), but creates a string starting from a double
- * instead of taking a buffer and its length.
- *
- * The returned string must be released with RedisModule_FreeString() or by
- * enabling automatic memory management. */
-RedisModuleString *RM_CreateStringFromDouble(RedisModuleCtx *ctx, double d) {
-    char buf[128];
-    size_t len = d2string(buf,sizeof(buf),d);
-    return RM_CreateString(ctx,buf,len);
-}
-
-/* Like RedisModule_CreatString(), but creates a string starting from a long
- * double.
- *
- * The returned string must be released with RedisModule_FreeString() or by
- * enabling automatic memory management.
- *
- * The passed context 'ctx' may be NULL if necessary, see the
- * RedisModule_CreateString() documentation for more info. */
-RedisModuleString *RM_CreateStringFromLongDouble(RedisModuleCtx *ctx, long double ld, int humanfriendly) {
-    char buf[MAX_LONG_DOUBLE_CHARS];
-    size_t len = ld2string(buf,sizeof(buf),ld,
-        (humanfriendly ? LD_STR_HUMAN : LD_STR_AUTO));
-    return RM_CreateString(ctx,buf,len);
-}
-
-/* Like RedisModule_CreatString(), but creates a string starting from another
- * RedisModuleString.
- *
- * The returned string must be released with RedisModule_FreeString() or by
- * enabling automatic memory management.
- *
- * The passed context 'ctx' may be NULL if necessary, see the
- * RedisModule_CreateString() documentation for more info. */
-RedisModuleString *RM_CreateStringFromString(RedisModuleCtx *ctx, const RedisModuleString *str) {
-    RedisModuleString *o = dupStringObject(str);
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
-    return o;
-}
-
-/* Creates a string from a stream ID. The returned string must be released with
- * RedisModule_FreeString(), unless automatic memory is enabled.
- *
- * The passed context `ctx` may be NULL if necessary. See the
- * RedisModule_CreateString() documentation for more info. */
-RedisModuleString *RM_CreateStringFromStreamID(RedisModuleCtx *ctx, const RedisModuleStreamID *id) {
-    streamID streamid = {id->ms, id->seq};
-    RedisModuleString *o = createObjectFromStreamID(&streamid);
-    if (ctx != NULL) autoMemoryAdd(ctx, REDISMODULE_AM_STRING, o);
-    return o;
-}
-
-/* Free a module string object obtained with one of the Redis modules API calls
- * that return new string objects.
- *
- * It is possible to call this function even when automatic memory management
- * is enabled. In that case the string will be released ASAP and removed
- * from the pool of string to release at the end.
- *
- * If the string was created with a NULL context 'ctx', it is also possible to
- * pass ctx as NULL when releasing the string (but passing a context will not
- * create any issue). Strings created with a context should be freed also passing
- * the context, so if you want to free a string out of context later, make sure
- * to create it using a NULL context. */
-void RM_FreeString(RedisModuleCtx *ctx, RedisModuleString *str) {
-    decrRefCount(str);
-    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_STRING,str);
-}
-
-/* Every call to this function, will make the string 'str' requiring
- * an additional call to RedisModule_FreeString() in order to really
- * free the string. Note that the automatic freeing of the string obtained
- * enabling modules automatic memory management counts for one
- * RedisModule_FreeString() call (it is just executed automatically).
- *
- * Normally you want to call this function when, at the same time
- * the following conditions are true:
- *
- * 1. You have automatic memory management enabled.
- * 2. You want to create string objects.
- * 3. Those string objects you create need to live *after* the callback
- *    function(for example a command implementation) creating them returns.
- *
- * Usually you want this in order to store the created string object
- * into your own data structure, for example when implementing a new data
- * type.
- *
- * Note that when memory management is turned off, you don't need
- * any call to RetainString() since creating a string will always result
- * into a string that lives after the callback function returns, if
- * no FreeString() call is performed.
- *
- * It is possible to call this function with a NULL context. */
-void RM_RetainString(RedisModuleCtx *ctx, RedisModuleString *str) {
-    if (ctx == NULL || !autoMemoryFreed(ctx,REDISMODULE_AM_STRING,str)) {
-        /* Increment the string reference counting only if we can't
-         * just remove the object from the list of objects that should
-         * be reclaimed. Why we do that, instead of just incrementing
-         * the refcount in any case, and let the automatic FreeString()
-         * call at the end to bring the refcount back at the desired
-         * value? Because this way we ensure that the object refcount
-         * value is 1 (instead of going to 2 to be dropped later to 1)
-         * after the call to this function. This is needed for functions
-         * like RedisModule_StringAppendBuffer() to work. */
-        incrRefCount(str);
-    }
-}
-
-/**
-* This function can be used instead of RedisModule_RetainString().
-* The main difference between the two is that this function will always
-* succeed, whereas RedisModule_RetainString() may fail because of an
-* assertion.
-* 
-* The function returns a pointer to RedisModuleString, which is owned
-* by the caller. It requires a call to RedisModule_FreeString() to free
-* the string when automatic memory management is disabled for the context.
-* When automatic memory management is enabled, you can either call
-* RedisModule_FreeString() or let the automation free it.
-* 
-* This function is more efficient than RedisModule_CreateStringFromString()
-* because whenever possible, it avoids copying the underlying
-* RedisModuleString. The disadvantage of using this function is that it
-* might not be possible to use RedisModule_StringAppendBuffer() on the
-* returned RedisModuleString.
-* 
-* It is possible to call this function with a NULL context.
-*/
-RedisModuleString* RM_HoldString(RedisModuleCtx *ctx, RedisModuleString *str) {
-    if (str->refcount == OBJ_STATIC_REFCOUNT) {
-        return RM_CreateStringFromString(ctx, str);
-    }
-
-    incrRefCount(str);
-    if (ctx != NULL) {
-        /*
-         * Put the str in the auto memory management of the ctx.
-         * It might already be there, in this case, the ref count will
-         * be 2 and we will decrease the ref count twice and free the
-         * object in the auto memory free function.
-         *
-         * Why we can not do the same trick of just remove the object
-         * from the auto memory (like in RM_RetainString)?
-         * This code shows the issue:
-         *
-         * RM_AutoMemory(ctx);
-         * str1 = RM_CreateString(ctx, "test", 4);
-         * str2 = RM_HoldString(ctx, str1);
-         * RM_FreeString(str1);
-         * RM_FreeString(str2);
-         *
-         * If after the RM_HoldString we would just remove the string from
-         * the auto memory, this example will cause access to a freed memory
-         * on 'RM_FreeString(str2);' because the String will be free
-         * on 'RM_FreeString(str1);'.
-         *
-         * So it's safer to just increase the ref count
-         * and add the String to auto memory again.
-         *
-         * The limitation is that it is not possible to use RedisModule_StringAppendBuffer
-         * on the String.
-         */
-        autoMemoryAdd(ctx,REDISMODULE_AM_STRING,str);
-    }
-    return str;
-}
-
-/* Given a string module object, this function returns the string pointer
- * and length of the string. The returned pointer and length should only
- * be used for read only accesses and never modified. */
-const char *RM_StringPtrLen(const RedisModuleString *str, size_t *len) {
-    if (str == NULL) {
-        const char *errmsg = "(NULL string reply referenced in module)";
-        if (len) *len = strlen(errmsg);
-        return errmsg;
-    }
-    if (len) *len = sdslen(str->ptr);
-    return str->ptr;
-}
-
-/* --------------------------------------------------------------------------
- * Higher level string operations
- * ------------------------------------------------------------------------- */
-
-/* Convert the string into a long long integer, storing it at `*ll`.
- * Returns REDISMODULE_OK on success. If the string can't be parsed
- * as a valid, strict long long (no spaces before/after), REDISMODULE_ERR
- * is returned. */
-int RM_StringToLongLong(const RedisModuleString *str, long long *ll) {
-    return string2ll(str->ptr,sdslen(str->ptr),ll) ? REDISMODULE_OK :
-                                                     REDISMODULE_ERR;
-}
-
-/* Convert the string into a double, storing it at `*d`.
- * Returns REDISMODULE_OK on success or REDISMODULE_ERR if the string is
- * not a valid string representation of a double value. */
-int RM_StringToDouble(const RedisModuleString *str, double *d) {
-    int retval = getDoubleFromObject(str,d);
-    return (retval == C_OK) ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Convert the string into a long double, storing it at `*ld`.
- * Returns REDISMODULE_OK on success or REDISMODULE_ERR if the string is
- * not a valid string representation of a double value. */
-int RM_StringToLongDouble(const RedisModuleString *str, long double *ld) {
-    int retval = string2ld(str->ptr,sdslen(str->ptr),ld);
-    return retval ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Convert the string into a stream ID, storing it at `*id`.
- * Returns REDISMODULE_OK on success and returns REDISMODULE_ERR if the string
- * is not a valid string representation of a stream ID. The special IDs "+" and
- * "-" are allowed.
- */
-int RM_StringToStreamID(const RedisModuleString *str, RedisModuleStreamID *id) {
-    streamID streamid;
-    if (streamParseID(str, &streamid) == C_OK) {
-        id->ms = streamid.ms;
-        id->seq = streamid.seq;
-        return REDISMODULE_OK;
-    } else {
-        return REDISMODULE_ERR;
-    }
-}
-
-/* Compare two string objects, returning -1, 0 or 1 respectively if
- * a < b, a == b, a > b. Strings are compared byte by byte as two
- * binary blobs without any encoding care / collation attempt. */
-int RM_StringCompare(RedisModuleString *a, RedisModuleString *b) {
-    return compareStringObjects(a,b);
-}
-
-/* Return the (possibly modified in encoding) input 'str' object if
- * the string is unshared, otherwise NULL is returned. */
-RedisModuleString *moduleAssertUnsharedString(RedisModuleString *str) {
-    if (str->refcount != 1) {
-        serverLog(LL_WARNING,
-            "Module attempted to use an in-place string modify operation "
-            "with a string referenced multiple times. Please check the code "
-            "for API usage correctness.");
-        return NULL;
-    }
-    if (str->encoding == OBJ_ENCODING_EMBSTR) {
-        /* Note: here we "leak" the additional allocation that was
-         * used in order to store the embedded string in the object. */
-        str->ptr = sdsnewlen(str->ptr,sdslen(str->ptr));
-        str->encoding = OBJ_ENCODING_RAW;
-    } else if (str->encoding == OBJ_ENCODING_INT) {
-        /* Convert the string from integer to raw encoding. */
-        str->ptr = sdsfromlonglong((long)str->ptr);
-        str->encoding = OBJ_ENCODING_RAW;
-    }
-    return str;
-}
-
-/* Append the specified buffer to the string 'str'. The string must be a
- * string created by the user that is referenced only a single time, otherwise
- * REDISMODULE_ERR is returned and the operation is not performed. */
-int RM_StringAppendBuffer(RedisModuleCtx *ctx, RedisModuleString *str, const char *buf, size_t len) {
-    UNUSED(ctx);
-    str = moduleAssertUnsharedString(str);
-    if (str == NULL) return REDISMODULE_ERR;
-    str->ptr = sdscatlen(str->ptr,buf,len);
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Reply APIs
- *
- * These functions are used for sending replies to the client.
- *
- * Most functions always return REDISMODULE_OK so you can use it with
- * 'return' in order to return from the command implementation with:
- *
- *     if (... some condition ...)
- *         return RedisModule_ReplyWithLongLong(ctx,mycount);
- * -------------------------------------------------------------------------- */
-
-/* Send an error about the number of arguments given to the command,
- * citing the command name in the error message. Returns REDISMODULE_OK.
- *
- * Example:
- *
- *     if (argc != 3) return RedisModule_WrongArity(ctx);
- */
-int RM_WrongArity(RedisModuleCtx *ctx) {
-    addReplyErrorFormat(ctx->client,
-        "wrong number of arguments for '%s' command",
-        (char*)ctx->client->argv[0]->ptr);
-    return REDISMODULE_OK;
-}
-
-/* Return the client object the `RM_Reply*` functions should target.
- * Normally this is just `ctx->client`, that is the client that called
- * the module command, however in the case of thread safe contexts there
- * is no directly associated client (since it would not be safe to access
- * the client from a thread), so instead the blocked client object referenced
- * in the thread safe context, has a fake client that we just use to accumulate
- * the replies. Later, when the client is unblocked, the accumulated replies
- * are appended to the actual client.
- *
- * The function returns the client pointer depending on the context, or
- * NULL if there is no potential client. This happens when we are in the
- * context of a thread safe context that was not initialized with a blocked
- * client object. Other contexts without associated clients are the ones
- * initialized to run the timers callbacks. */
-client *moduleGetReplyClient(RedisModuleCtx *ctx) {
-    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) {
-        if (ctx->blocked_client)
-            return ctx->blocked_client->reply_client;
-        else
-            return NULL;
-    } else {
-        /* If this is a non thread safe context, just return the client
-         * that is running the command if any. This may be NULL as well
-         * in the case of contexts that are not executed with associated
-         * clients, like timer contexts. */
-        return ctx->client;
-    }
-}
-
-/* Send an integer reply to the client, with the specified long long value.
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithLongLong(RedisModuleCtx *ctx, long long ll) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyLongLong(c,ll);
-    return REDISMODULE_OK;
-}
-
-/* Reply with the error 'err'.
- *
- * Note that 'err' must contain all the error, including
- * the initial error code. The function only provides the initial "-", so
- * the usage is, for example:
- *
- *     RedisModule_ReplyWithError(ctx,"ERR Wrong Type");
- *
- * and not just:
- *
- *     RedisModule_ReplyWithError(ctx,"Wrong Type");
- *
- * The function always returns REDISMODULE_OK.
- */
-int RM_ReplyWithError(RedisModuleCtx *ctx, const char *err) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyErrorFormat(c,"-%s",err);
-    return REDISMODULE_OK;
-}
-
-/* Reply with a simple string (`+... \r\n` in RESP protocol). This replies
- * are suitable only when sending a small non-binary string with small
- * overhead, like "OK" or similar replies.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithSimpleString(RedisModuleCtx *ctx, const char *msg) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyProto(c,"+",1);
-    addReplyProto(c,msg,strlen(msg));
-    addReplyProto(c,"\r\n",2);
-    return REDISMODULE_OK;
-}
-
-/* Reply with an array type of 'len' elements. However 'len' other calls
- * to `ReplyWith*` style functions must follow in order to emit the elements
- * of the array.
- *
- * When producing arrays with a number of element that is not known beforehand
- * the function can be called with the special count
- * REDISMODULE_POSTPONED_ARRAY_LEN, and the actual number of elements can be
- * later set with RedisModule_ReplySetArrayLength() (which will set the
- * latest "open" count if there are multiple ones).
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithArray(RedisModuleCtx *ctx, long len) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    if (len == REDISMODULE_POSTPONED_ARRAY_LEN) {
-        ctx->postponed_arrays = zrealloc(ctx->postponed_arrays,sizeof(void*)*
-                (ctx->postponed_arrays_count+1));
-        ctx->postponed_arrays[ctx->postponed_arrays_count] =
-            addReplyDeferredLen(c);
-        ctx->postponed_arrays_count++;
-    } else {
-        addReplyArrayLen(c,len);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Reply to the client with a null array, simply null in RESP3 
- * null array in RESP2.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithNullArray(RedisModuleCtx *ctx) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyNullArray(c);
-    return REDISMODULE_OK;
-}
-
-/* Reply to the client with an empty array. 
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithEmptyArray(RedisModuleCtx *ctx) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReply(c,shared.emptyarray);
-    return REDISMODULE_OK;
-}
-
-/* When RedisModule_ReplyWithArray() is used with the argument
- * REDISMODULE_POSTPONED_ARRAY_LEN, because we don't know beforehand the number
- * of items we are going to output as elements of the array, this function
- * will take care to set the array length.
- *
- * Since it is possible to have multiple array replies pending with unknown
- * length, this function guarantees to always set the latest array length
- * that was created in a postponed way.
- *
- * For example in order to output an array like [1,[10,20,30]] we
- * could write:
- *
- *      RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
- *      RedisModule_ReplyWithLongLong(ctx,1);
- *      RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
- *      RedisModule_ReplyWithLongLong(ctx,10);
- *      RedisModule_ReplyWithLongLong(ctx,20);
- *      RedisModule_ReplyWithLongLong(ctx,30);
- *      RedisModule_ReplySetArrayLength(ctx,3); // Set len of 10,20,30 array.
- *      RedisModule_ReplySetArrayLength(ctx,2); // Set len of top array
- *
- * Note that in the above example there is no reason to postpone the array
- * length, since we produce a fixed number of elements, but in the practice
- * the code may use an iterator or other ways of creating the output so
- * that is not easy to calculate in advance the number of elements.
- */
-void RM_ReplySetArrayLength(RedisModuleCtx *ctx, long len) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return;
-    if (ctx->postponed_arrays_count == 0) {
-        serverLog(LL_WARNING,
-            "API misuse detected in module %s: "
-            "RedisModule_ReplySetArrayLength() called without previous "
-            "RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN) "
-            "call.", ctx->module->name);
-            return;
-    }
-    ctx->postponed_arrays_count--;
-    setDeferredArrayLen(c,
-            ctx->postponed_arrays[ctx->postponed_arrays_count],
-            len);
-    if (ctx->postponed_arrays_count == 0) {
-        zfree(ctx->postponed_arrays);
-        ctx->postponed_arrays = NULL;
-    }
-}
-
-/* Reply with a bulk string, taking in input a C buffer pointer and length.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithStringBuffer(RedisModuleCtx *ctx, const char *buf, size_t len) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyBulkCBuffer(c,(char*)buf,len);
-    return REDISMODULE_OK;
-}
-
-/* Reply with a bulk string, taking in input a C buffer pointer that is
- * assumed to be null-terminated.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithCString(RedisModuleCtx *ctx, const char *buf) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyBulkCString(c,(char*)buf);
-    return REDISMODULE_OK;
-}
-
-/* Reply with a bulk string, taking in input a RedisModuleString object.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithString(RedisModuleCtx *ctx, RedisModuleString *str) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyBulk(c,str);
-    return REDISMODULE_OK;
-}
-
-/* Reply with an empty string.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithEmptyString(RedisModuleCtx *ctx) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReply(c,shared.emptybulk);
-    return REDISMODULE_OK;
-}
-
-/* Reply with a binary safe string, which should not be escaped or filtered 
- * taking in input a C buffer pointer and length.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithVerbatimString(RedisModuleCtx *ctx, const char *buf, size_t len) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyVerbatim(c, buf, len, "txt");
-    return REDISMODULE_OK;
-}
-
-/* Reply to the client with a NULL.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithNull(RedisModuleCtx *ctx) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyNull(c);
-    return REDISMODULE_OK;
-}
-
-/* Reply exactly what a Redis command returned us with RedisModule_Call().
- * This function is useful when we use RedisModule_Call() in order to
- * execute some command, as we want to reply to the client exactly the
- * same reply we obtained by the command.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithCallReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    sds proto = sdsnewlen(reply->proto, reply->protolen);
-    addReplySds(c,proto);
-    return REDISMODULE_OK;
-}
-
-/* Send a string reply obtained converting the double 'd' into a bulk string.
- * This function is basically equivalent to converting a double into
- * a string into a C buffer, and then calling the function
- * RedisModule_ReplyWithStringBuffer() with the buffer and length.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithDouble(RedisModuleCtx *ctx, double d) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyDouble(c,d);
-    return REDISMODULE_OK;
-}
-
-/* Send a string reply obtained converting the long double 'ld' into a bulk
- * string. This function is basically equivalent to converting a long double
- * into a string into a C buffer, and then calling the function
- * RedisModule_ReplyWithStringBuffer() with the buffer and length.
- * The double string uses human readable formatting (see
- * `addReplyHumanLongDouble` in networking.c).
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplyWithLongDouble(RedisModuleCtx *ctx, long double ld) {
-    client *c = moduleGetReplyClient(ctx);
-    if (c == NULL) return REDISMODULE_OK;
-    addReplyHumanLongDouble(c, ld);
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Commands replication API
- * -------------------------------------------------------------------------- */
-
-/* Helper function to replicate MULTI the first time we replicate something
- * in the context of a command execution. EXEC will be handled by the
- * RedisModuleCommandDispatcher() function. */
-void moduleReplicateMultiIfNeeded(RedisModuleCtx *ctx) {
-    /* Skip this if client explicitly wrap the command with MULTI, or if
-     * the module command was called by a script. */
-    if (server.in_eval || server.in_exec) return;
-    /* If we already emitted MULTI return ASAP. */
-    if (server.propagate_in_transaction) return;
-    /* If this is a thread safe context, we do not want to wrap commands
-     * executed into MULTI/EXEC, they are executed as single commands
-     * from an external client in essence. */
-    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) return;
-    /* If this is a callback context, and not a module command execution
-     * context, we have to setup the op array for the "also propagate" API
-     * so that RM_Replicate() will work. */
-    if (!(ctx->flags & REDISMODULE_CTX_MODULE_COMMAND_CALL)) {
-        serverAssert(ctx->saved_oparray.ops == NULL);
-        ctx->saved_oparray = server.also_propagate;
-        redisOpArrayInit(&server.also_propagate);
-    }
-    execCommandPropagateMulti(ctx->client->db->id);
-    ctx->flags |= REDISMODULE_CTX_MULTI_EMITTED;
-}
-
-/* Replicate the specified command and arguments to slaves and AOF, as effect
- * of execution of the calling command implementation.
- *
- * The replicated commands are always wrapped into the MULTI/EXEC that
- * contains all the commands replicated in a given module command
- * execution. However the commands replicated with RedisModule_Call()
- * are the first items, the ones replicated with RedisModule_Replicate()
- * will all follow before the EXEC.
- *
- * Modules should try to use one interface or the other.
- *
- * This command follows exactly the same interface of RedisModule_Call(),
- * so a set of format specifiers must be passed, followed by arguments
- * matching the provided format specifiers.
- *
- * Please refer to RedisModule_Call() for more information.
- *
- * Using the special "A" and "R" modifiers, the caller can exclude either
- * the AOF or the replicas from the propagation of the specified command.
- * Otherwise, by default, the command will be propagated in both channels.
- *
- * #### Note about calling this function from a thread safe context:
- *
- * Normally when you call this function from the callback implementing a
- * module command, or any other callback provided by the Redis Module API,
- * Redis will accumulate all the calls to this function in the context of
- * the callback, and will propagate all the commands wrapped in a MULTI/EXEC
- * transaction. However when calling this function from a threaded safe context
- * that can live an undefined amount of time, and can be locked/unlocked in
- * at will, the behavior is different: MULTI/EXEC wrapper is not emitted
- * and the command specified is inserted in the AOF and replication stream
- * immediately.
- *
- * #### Return value
- *
- * The command returns REDISMODULE_ERR if the format specifiers are invalid
- * or the command name does not belong to a known command. */
-int RM_Replicate(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) {
-    struct redisCommand *cmd;
-    robj **argv = NULL;
-    int argc = 0, flags = 0, j;
-    va_list ap;
-
-    cmd = lookupCommandByCString((char*)cmdname);
-    if (!cmd) return REDISMODULE_ERR;
-
-    /* Create the client and dispatch the command. */
-    va_start(ap, fmt);
-    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
-    va_end(ap);
-    if (argv == NULL) return REDISMODULE_ERR;
-
-    /* Select the propagation target. Usually is AOF + replicas, however
-     * the caller can exclude one or the other using the "A" or "R"
-     * modifiers. */
-    int target = 0;
-    if (!(flags & REDISMODULE_ARGV_NO_AOF)) target |= PROPAGATE_AOF;
-    if (!(flags & REDISMODULE_ARGV_NO_REPLICAS)) target |= PROPAGATE_REPL;
-
-    /* Replicate! When we are in a threaded context, we want to just insert
-     * the replicated command ASAP, since it is not clear when the context
-     * will stop being used, so accumulating stuff does not make much sense,
-     * nor we could easily use the alsoPropagate() API from threads. */
-    if (ctx->flags & REDISMODULE_CTX_THREAD_SAFE) {
-        propagate(cmd,ctx->client->db->id,argv,argc,target);
-    } else {
-        moduleReplicateMultiIfNeeded(ctx);
-        alsoPropagate(cmd,ctx->client->db->id,argv,argc,target);
-    }
-
-    /* Release the argv. */
-    for (j = 0; j < argc; j++) decrRefCount(argv[j]);
-    zfree(argv);
-    server.dirty++;
-    return REDISMODULE_OK;
-}
-
-/* This function will replicate the command exactly as it was invoked
- * by the client. Note that this function will not wrap the command into
- * a MULTI/EXEC stanza, so it should not be mixed with other replication
- * commands.
- *
- * Basically this form of replication is useful when you want to propagate
- * the command to the slaves and AOF file exactly as it was called, since
- * the command can just be re-executed to deterministically re-create the
- * new state starting from the old one.
- *
- * The function always returns REDISMODULE_OK. */
-int RM_ReplicateVerbatim(RedisModuleCtx *ctx) {
-    alsoPropagate(ctx->client->cmd,ctx->client->db->id,
-        ctx->client->argv,ctx->client->argc,
-        PROPAGATE_AOF|PROPAGATE_REPL);
-    server.dirty++;
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## DB and Key APIs -- Generic API
- * -------------------------------------------------------------------------- */
-
-/* Return the ID of the current client calling the currently active module
- * command. The returned ID has a few guarantees:
- *
- * 1. The ID is different for each different client, so if the same client
- *    executes a module command multiple times, it can be recognized as
- *    having the same ID, otherwise the ID will be different.
- * 2. The ID increases monotonically. Clients connecting to the server later
- *    are guaranteed to get IDs greater than any past ID previously seen.
- *
- * Valid IDs are from 1 to 2^64 - 1. If 0 is returned it means there is no way
- * to fetch the ID in the context the function was currently called.
- *
- * After obtaining the ID, it is possible to check if the command execution
- * is actually happening in the context of AOF loading, using this macro:
- *
- *      if (RedisModule_IsAOFClient(RedisModule_GetClientId(ctx)) {
- *          // Handle it differently.
- *      }
- */
-unsigned long long RM_GetClientId(RedisModuleCtx *ctx) {
-    if (ctx->client == NULL) return 0;
-    return ctx->client->id;
-}
-
-/* Return the ACL user name used by the client with the specified client ID.
- * Client ID can be obtained with RM_GetClientId() API. If the client does not
- * exist, NULL is returned and errno is set to ENOENT. If the client isn't 
- * using an ACL user, NULL is returned and errno is set to ENOTSUP */
-RedisModuleString *RM_GetClientUserNameById(RedisModuleCtx *ctx, uint64_t id) {
-    client *client = lookupClientByID(id);
-    if (client == NULL) {
-        errno = ENOENT;
-        return NULL;
-    }
-    
-    if (client->user == NULL) {
-        errno = ENOTSUP;
-        return NULL;
-    }
-
-    sds name = sdsnew(client->user->name);
-    robj *str = createObject(OBJ_STRING, name);
-    autoMemoryAdd(ctx, REDISMODULE_AM_STRING, str);
-    return str;
-}
-
-/* This is an helper for RM_GetClientInfoById() and other functions: given
- * a client, it populates the client info structure with the appropriate
- * fields depending on the version provided. If the version is not valid
- * then REDISMODULE_ERR is returned. Otherwise the function returns
- * REDISMODULE_OK and the structure pointed by 'ci' gets populated. */
-
-int modulePopulateClientInfoStructure(void *ci, client *client, int structver) {
-    if (structver != 1) return REDISMODULE_ERR;
-
-    RedisModuleClientInfoV1 *ci1 = ci;
-    memset(ci1,0,sizeof(*ci1));
-    ci1->version = structver;
-    if (client->flags & CLIENT_MULTI)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_MULTI;
-    if (client->flags & CLIENT_PUBSUB)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_PUBSUB;
-    if (client->flags & CLIENT_UNIX_SOCKET)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET;
-    if (client->flags & CLIENT_TRACKING)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_TRACKING;
-    if (client->flags & CLIENT_BLOCKED)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_BLOCKED;
-    if (connGetType(client->conn) == CONN_TYPE_TLS)
-        ci1->flags |= REDISMODULE_CLIENTINFO_FLAG_SSL;
-
-    int port;
-    connPeerToString(client->conn,ci1->addr,sizeof(ci1->addr),&port);
-    ci1->port = port;
-    ci1->db = client->db->id;
-    ci1->id = client->id;
-    return REDISMODULE_OK;
-}
-
-/* This is an helper for moduleFireServerEvent() and other functions:
- * It populates the replication info structure with the appropriate
- * fields depending on the version provided. If the version is not valid
- * then REDISMODULE_ERR is returned. Otherwise the function returns
- * REDISMODULE_OK and the structure pointed by 'ri' gets populated. */
-int modulePopulateReplicationInfoStructure(void *ri, int structver) {
-    if (structver != 1) return REDISMODULE_ERR;
-
-    RedisModuleReplicationInfoV1 *ri1 = ri;
-    memset(ri1,0,sizeof(*ri1));
-    ri1->version = structver;
-    ri1->master = server.masterhost==NULL;
-    ri1->masterhost = server.masterhost? server.masterhost: "";
-    ri1->masterport = server.masterport;
-    ri1->replid1 = server.replid;
-    ri1->replid2 = server.replid2;
-    ri1->repl1_offset = server.master_repl_offset;
-    ri1->repl2_offset = server.second_replid_offset;
-    return REDISMODULE_OK;
-}
-
-/* Return information about the client with the specified ID (that was
- * previously obtained via the RedisModule_GetClientId() API). If the
- * client exists, REDISMODULE_OK is returned, otherwise REDISMODULE_ERR
- * is returned.
- *
- * When the client exist and the `ci` pointer is not NULL, but points to
- * a structure of type RedisModuleClientInfo, previously initialized with
- * the correct REDISMODULE_CLIENTINFO_INITIALIZER, the structure is populated
- * with the following fields:
- *
- *      uint64_t flags;         // REDISMODULE_CLIENTINFO_FLAG_*
- *      uint64_t id;            // Client ID
- *      char addr[46];          // IPv4 or IPv6 address.
- *      uint16_t port;          // TCP port.
- *      uint16_t db;            // Selected DB.
- *
- * Note: the client ID is useless in the context of this call, since we
- *       already know, however the same structure could be used in other
- *       contexts where we don't know the client ID, yet the same structure
- *       is returned.
- *
- * With flags having the following meaning:
- *
- *     REDISMODULE_CLIENTINFO_FLAG_SSL          Client using SSL connection.
- *     REDISMODULE_CLIENTINFO_FLAG_PUBSUB       Client in Pub/Sub mode.
- *     REDISMODULE_CLIENTINFO_FLAG_BLOCKED      Client blocked in command.
- *     REDISMODULE_CLIENTINFO_FLAG_TRACKING     Client with keys tracking on.
- *     REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET   Client using unix domain socket.
- *     REDISMODULE_CLIENTINFO_FLAG_MULTI        Client in MULTI state.
- *
- * However passing NULL is a way to just check if the client exists in case
- * we are not interested in any additional information.
- *
- * This is the correct usage when we want the client info structure
- * returned:
- *
- *      RedisModuleClientInfo ci = REDISMODULE_CLIENTINFO_INITIALIZER;
- *      int retval = RedisModule_GetClientInfoById(&ci,client_id);
- *      if (retval == REDISMODULE_OK) {
- *          printf("Address: %s\n", ci.addr);
- *      }
- */
-int RM_GetClientInfoById(void *ci, uint64_t id) {
-    client *client = lookupClientByID(id);
-    if (client == NULL) return REDISMODULE_ERR;
-    if (ci == NULL) return REDISMODULE_OK;
-
-    /* Fill the info structure if passed. */
-    uint64_t structver = ((uint64_t*)ci)[0];
-    return modulePopulateClientInfoStructure(ci,client,structver);
-}
-
-/* Publish a message to subscribers (see PUBLISH command). */
-int RM_PublishMessage(RedisModuleCtx *ctx, RedisModuleString *channel, RedisModuleString *message) {
-    UNUSED(ctx);
-    int receivers = pubsubPublishMessage(channel, message);
-    if (server.cluster_enabled)
-        clusterPropagatePublish(channel, message);
-    return receivers;
-}
-
-/* Return the currently selected DB. */
-int RM_GetSelectedDb(RedisModuleCtx *ctx) {
-    return ctx->client->db->id;
-}
-
-
-/* Return the current context's flags. The flags provide information on the
- * current request context (whether the client is a Lua script or in a MULTI),
- * and about the Redis instance in general, i.e replication and persistence.
- *
- * It is possible to call this function even with a NULL context, however
- * in this case the following flags will not be reported:
- *
- *  * LUA, MULTI, REPLICATED, DIRTY (see below for more info).
- *
- * Available flags and their meaning:
- *
- *  * REDISMODULE_CTX_FLAGS_LUA: The command is running in a Lua script
- *
- *  * REDISMODULE_CTX_FLAGS_MULTI: The command is running inside a transaction
- *
- *  * REDISMODULE_CTX_FLAGS_REPLICATED: The command was sent over the replication
- *    link by the MASTER
- *
- *  * REDISMODULE_CTX_FLAGS_MASTER: The Redis instance is a master
- *
- *  * REDISMODULE_CTX_FLAGS_SLAVE: The Redis instance is a slave
- *
- *  * REDISMODULE_CTX_FLAGS_READONLY: The Redis instance is read-only
- *
- *  * REDISMODULE_CTX_FLAGS_CLUSTER: The Redis instance is in cluster mode
- *
- *  * REDISMODULE_CTX_FLAGS_AOF: The Redis instance has AOF enabled
- *
- *  * REDISMODULE_CTX_FLAGS_RDB: The instance has RDB enabled
- *
- *  * REDISMODULE_CTX_FLAGS_MAXMEMORY:  The instance has Maxmemory set
- *
- *  * REDISMODULE_CTX_FLAGS_EVICT:  Maxmemory is set and has an eviction
- *    policy that may delete keys
- *
- *  * REDISMODULE_CTX_FLAGS_OOM: Redis is out of memory according to the
- *    maxmemory setting.
- *
- *  * REDISMODULE_CTX_FLAGS_OOM_WARNING: Less than 25% of memory remains before
- *                                       reaching the maxmemory level.
- *
- *  * REDISMODULE_CTX_FLAGS_LOADING: Server is loading RDB/AOF
- *
- *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE: No active link with the master.
- *
- *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING: The replica is trying to
- *                                                 connect with the master.
- *
- *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING: Master -> Replica RDB
- *                                                   transfer is in progress.
- *
- *  * REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE: The replica has an active link
- *                                             with its master. This is the
- *                                             contrary of STALE state.
- *
- *  * REDISMODULE_CTX_FLAGS_ACTIVE_CHILD: There is currently some background
- *                                        process active (RDB, AUX or module).
- *
- *  * REDISMODULE_CTX_FLAGS_MULTI_DIRTY: The next EXEC will fail due to dirty
- *                                       CAS (touched keys).
- *
- *  * REDISMODULE_CTX_FLAGS_IS_CHILD: Redis is currently running inside
- *                                    background child process.
- */
-int RM_GetContextFlags(RedisModuleCtx *ctx) {
-    int flags = 0;
-
-    /* Client specific flags */
-    if (ctx) {
-        if (ctx->client) {
-            if (ctx->client->flags & CLIENT_DENY_BLOCKING)
-                flags |= REDISMODULE_CTX_FLAGS_DENY_BLOCKING;
-            /* Module command received from MASTER, is replicated. */
-            if (ctx->client->flags & CLIENT_MASTER)
-                flags |= REDISMODULE_CTX_FLAGS_REPLICATED;
-        }
-
-        /* For DIRTY flags, we need the blocked client if used */
-        client *c = ctx->blocked_client ? ctx->blocked_client->client : ctx->client;
-        if (c && (c->flags & (CLIENT_DIRTY_CAS|CLIENT_DIRTY_EXEC))) {
-            flags |= REDISMODULE_CTX_FLAGS_MULTI_DIRTY;
-        }
-    }
-
-    if (server.in_eval)
-        flags |= REDISMODULE_CTX_FLAGS_LUA;
-
-    if (server.in_exec)
-        flags |= REDISMODULE_CTX_FLAGS_MULTI;
-
-    if (server.cluster_enabled)
-        flags |= REDISMODULE_CTX_FLAGS_CLUSTER;
-
-    if (server.loading)
-        flags |= REDISMODULE_CTX_FLAGS_LOADING;
-
-    /* Maxmemory and eviction policy */
-    if (server.maxmemory > 0 && (!server.masterhost || !server.repl_slave_ignore_maxmemory)) {
-        flags |= REDISMODULE_CTX_FLAGS_MAXMEMORY;
-
-        if (server.maxmemory_policy != MAXMEMORY_NO_EVICTION)
-            flags |= REDISMODULE_CTX_FLAGS_EVICT;
-    }
-
-    /* Persistence flags */
-    if (server.aof_state != AOF_OFF)
-        flags |= REDISMODULE_CTX_FLAGS_AOF;
-    if (server.saveparamslen > 0)
-        flags |= REDISMODULE_CTX_FLAGS_RDB;
-
-    /* Replication flags */
-    if (server.masterhost == NULL) {
-        flags |= REDISMODULE_CTX_FLAGS_MASTER;
-    } else {
-        flags |= REDISMODULE_CTX_FLAGS_SLAVE;
-        if (server.repl_slave_ro)
-            flags |= REDISMODULE_CTX_FLAGS_READONLY;
-
-        /* Replica state flags. */
-        if (server.repl_state == REPL_STATE_CONNECT ||
-            server.repl_state == REPL_STATE_CONNECTING)
-        {
-            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING;
-        } else if (server.repl_state == REPL_STATE_TRANSFER) {
-            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING;
-        } else if (server.repl_state == REPL_STATE_CONNECTED) {
-            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE;
-        }
-
-        if (server.repl_state != REPL_STATE_CONNECTED)
-            flags |= REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE;
-    }
-
-    /* OOM flag. */
-    float level;
-    int retval = getMaxmemoryState(NULL,NULL,NULL,&level);
-    if (retval == C_ERR) flags |= REDISMODULE_CTX_FLAGS_OOM;
-    if (level > 0.75) flags |= REDISMODULE_CTX_FLAGS_OOM_WARNING;
-
-    /* Presence of children processes. */
-    if (hasActiveChildProcess()) flags |= REDISMODULE_CTX_FLAGS_ACTIVE_CHILD;
-    if (server.in_fork_child) flags |= REDISMODULE_CTX_FLAGS_IS_CHILD;
-
-    return flags;
-}
-
-/* Returns true if some client sent the CLIENT PAUSE command to the server or
- * if Redis Cluster is doing a manual failover, and paused tue clients.
- * This is needed when we have a master with replicas, and want to write,
- * without adding further data to the replication channel, that the replicas
- * replication offset, match the one of the master. When this happens, it is
- * safe to failover the master without data loss.
- *
- * However modules may generate traffic by calling RedisModule_Call() with
- * the "!" flag, or by calling RedisModule_Replicate(), in a context outside
- * commands execution, for instance in timeout callbacks, threads safe
- * contexts, and so forth. When modules will generate too much traffic, it
- * will be hard for the master and replicas offset to match, because there
- * is more data to send in the replication channel.
- *
- * So modules may want to try to avoid very heavy background work that has
- * the effect of creating data to the replication channel, when this function
- * returns true. This is mostly useful for modules that have background
- * garbage collection tasks, or that do writes and replicate such writes
- * periodically in timer callbacks or other periodic callbacks.
- */
-int RM_AvoidReplicaTraffic() {
-    return checkClientPauseTimeoutAndReturnIfPaused();
-}
-
-/* Change the currently selected DB. Returns an error if the id
- * is out of range.
- *
- * Note that the client will retain the currently selected DB even after
- * the Redis command implemented by the module calling this function
- * returns.
- *
- * If the module command wishes to change something in a different DB and
- * returns back to the original one, it should call RedisModule_GetSelectedDb()
- * before in order to restore the old DB number before returning. */
-int RM_SelectDb(RedisModuleCtx *ctx, int newid) {
-    int retval = selectDb(ctx->client,newid);
-    return (retval == C_OK) ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Initialize a RedisModuleKey struct */
-static void moduleInitKey(RedisModuleKey *kp, RedisModuleCtx *ctx, robj *keyname, robj *value, int mode){
-    kp->ctx = ctx;
-    kp->db = ctx->client->db;
-    kp->key = keyname;
-    incrRefCount(keyname);
-    kp->value = value;
-    kp->iter = NULL;
-    kp->mode = mode;
-    if (kp->value) moduleInitKeyTypeSpecific(kp);
-}
-
-/* Initialize the type-specific part of the key. Only when key has a value. */
-static void moduleInitKeyTypeSpecific(RedisModuleKey *key) {
-    switch (key->value->type) {
-    case OBJ_ZSET: zsetKeyReset(key); break;
-    case OBJ_STREAM: key->u.stream.signalready = 0; break;
-    }
-}
-
-/* Return an handle representing a Redis key, so that it is possible
- * to call other APIs with the key handle as argument to perform
- * operations on the key.
- *
- * The return value is the handle representing the key, that must be
- * closed with RM_CloseKey().
- *
- * If the key does not exist and WRITE mode is requested, the handle
- * is still returned, since it is possible to perform operations on
- * a yet not existing key (that will be created, for example, after
- * a list push operation). If the mode is just READ instead, and the
- * key does not exist, NULL is returned. However it is still safe to
- * call RedisModule_CloseKey() and RedisModule_KeyType() on a NULL
- * value. */
-void *RM_OpenKey(RedisModuleCtx *ctx, robj *keyname, int mode) {
-    RedisModuleKey *kp;
-    robj *value;
-    int flags = mode & REDISMODULE_OPEN_KEY_NOTOUCH? LOOKUP_NOTOUCH: 0;
-
-    if (mode & REDISMODULE_WRITE) {
-        value = lookupKeyWriteWithFlags(ctx->client->db,keyname, flags);
-    } else {
-        value = lookupKeyReadWithFlags(ctx->client->db,keyname, flags);
-        if (value == NULL) {
-            return NULL;
-        }
-    }
-
-    /* Setup the key handle. */
-    kp = zmalloc(sizeof(*kp));
-    moduleInitKey(kp, ctx, keyname, value, mode);
-    autoMemoryAdd(ctx,REDISMODULE_AM_KEY,kp);
-    return (void*)kp;
-}
-
-/* Destroy a RedisModuleKey struct (freeing is the responsibility of the caller). */
-static void moduleCloseKey(RedisModuleKey *key) {
-    int signal = SHOULD_SIGNAL_MODIFIED_KEYS(key->ctx);
-    if ((key->mode & REDISMODULE_WRITE) && signal)
-        signalModifiedKey(key->ctx->client,key->db,key->key);
-    if (key->iter) zfree(key->iter);
-    RM_ZsetRangeStop(key);
-    if (key && key->value && key->value->type == OBJ_STREAM &&
-        key->u.stream.signalready) {
-        /* One of more RM_StreamAdd() have been done. */
-        signalKeyAsReady(key->db, key->key, OBJ_STREAM);
-    }
-    decrRefCount(key->key);
-}
-
-/* Close a key handle. */
-void RM_CloseKey(RedisModuleKey *key) {
-    if (key == NULL) return;
-    moduleCloseKey(key);
-    autoMemoryFreed(key->ctx,REDISMODULE_AM_KEY,key);
-    zfree(key);
-}
-
-/* Return the type of the key. If the key pointer is NULL then
- * REDISMODULE_KEYTYPE_EMPTY is returned. */
-int RM_KeyType(RedisModuleKey *key) {
-    if (key == NULL || key->value ==  NULL) return REDISMODULE_KEYTYPE_EMPTY;
-    /* We map between defines so that we are free to change the internal
-     * defines as desired. */
-    switch(key->value->type) {
-    case OBJ_STRING: return REDISMODULE_KEYTYPE_STRING;
-    case OBJ_LIST: return REDISMODULE_KEYTYPE_LIST;
-    case OBJ_SET: return REDISMODULE_KEYTYPE_SET;
-    case OBJ_ZSET: return REDISMODULE_KEYTYPE_ZSET;
-    case OBJ_HASH: return REDISMODULE_KEYTYPE_HASH;
-    case OBJ_MODULE: return REDISMODULE_KEYTYPE_MODULE;
-    case OBJ_STREAM: return REDISMODULE_KEYTYPE_STREAM;
-    default: return REDISMODULE_KEYTYPE_EMPTY;
-    }
-}
-
-/* Return the length of the value associated with the key.
- * For strings this is the length of the string. For all the other types
- * is the number of elements (just counting keys for hashes).
- *
- * If the key pointer is NULL or the key is empty, zero is returned. */
-size_t RM_ValueLength(RedisModuleKey *key) {
-    if (key == NULL || key->value == NULL) return 0;
-    switch(key->value->type) {
-    case OBJ_STRING: return stringObjectLen(key->value);
-    case OBJ_LIST: return listTypeLength(key->value);
-    case OBJ_SET: return setTypeSize(key->value);
-    case OBJ_ZSET: return zsetLength(key->value);
-    case OBJ_HASH: return hashTypeLength(key->value);
-    case OBJ_STREAM: return streamLength(key->value);
-    default: return 0;
-    }
-}
-
-/* If the key is open for writing, remove it, and setup the key to
- * accept new writes as an empty key (that will be created on demand).
- * On success REDISMODULE_OK is returned. If the key is not open for
- * writing REDISMODULE_ERR is returned. */
-int RM_DeleteKey(RedisModuleKey *key) {
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value) {
-        dbDelete(key->db,key->key);
-        key->value = NULL;
-    }
-    return REDISMODULE_OK;
-}
-
-/* If the key is open for writing, unlink it (that is delete it in a
- * non-blocking way, not reclaiming memory immediately) and setup the key to
- * accept new writes as an empty key (that will be created on demand).
- * On success REDISMODULE_OK is returned. If the key is not open for
- * writing REDISMODULE_ERR is returned. */
-int RM_UnlinkKey(RedisModuleKey *key) {
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value) {
-        dbAsyncDelete(key->db,key->key);
-        key->value = NULL;
-    }
-    return REDISMODULE_OK;
-}
-
-/* Return the key expire value, as milliseconds of remaining TTL.
- * If no TTL is associated with the key or if the key is empty,
- * REDISMODULE_NO_EXPIRE is returned. */
-mstime_t RM_GetExpire(RedisModuleKey *key) {
-    mstime_t expire = getExpire(key->db,key->key);
-    if (expire == -1 || key->value == NULL) 
-        return REDISMODULE_NO_EXPIRE;
-    expire -= mstime();
-    return expire >= 0 ? expire : 0;
-}
-
-/* Set a new expire for the key. If the special expire
- * REDISMODULE_NO_EXPIRE is set, the expire is cancelled if there was
- * one (the same as the PERSIST command).
- *
- * Note that the expire must be provided as a positive integer representing
- * the number of milliseconds of TTL the key should have.
- *
- * The function returns REDISMODULE_OK on success or REDISMODULE_ERR if
- * the key was not open for writing or is an empty key. */
-int RM_SetExpire(RedisModuleKey *key, mstime_t expire) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL || (expire < 0 && expire != REDISMODULE_NO_EXPIRE))
-        return REDISMODULE_ERR;
-    if (expire != REDISMODULE_NO_EXPIRE) {
-        expire += mstime();
-        setExpire(key->ctx->client,key->db,key->key,expire);
-    } else {
-        removeExpire(key->db,key->key);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Return the key expire value, as absolute Unix timestamp.
- * If no TTL is associated with the key or if the key is empty,
- * REDISMODULE_NO_EXPIRE is returned. */
-mstime_t RM_GetAbsExpire(RedisModuleKey *key) {
-    mstime_t expire = getExpire(key->db,key->key);
-    if (expire == -1 || key->value == NULL) 
-        return REDISMODULE_NO_EXPIRE;
-    return expire;
-}
-
-/* Set a new expire for the key. If the special expire
- * REDISMODULE_NO_EXPIRE is set, the expire is cancelled if there was
- * one (the same as the PERSIST command).
- * 
- * Note that the expire must be provided as a positive integer representing
- * the absolute Unix timestamp the key should have.
- *
- * The function returns REDISMODULE_OK on success or REDISMODULE_ERR if
- * the key was not open for writing or is an empty key. */
-int RM_SetAbsExpire(RedisModuleKey *key, mstime_t expire) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->value == NULL || (expire < 0 && expire != REDISMODULE_NO_EXPIRE))
-        return REDISMODULE_ERR;
-    if (expire != REDISMODULE_NO_EXPIRE) {
-        setExpire(key->ctx->client,key->db,key->key,expire);
-    } else {
-        removeExpire(key->db,key->key);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Performs similar operation to FLUSHALL, and optionally start a new AOF file (if enabled)
- * If restart_aof is true, you must make sure the command that triggered this call is not
- * propagated to the AOF file.
- * When async is set to true, db contents will be freed by a background thread. */
-void RM_ResetDataset(int restart_aof, int async) {
-    if (restart_aof && server.aof_state != AOF_OFF) stopAppendOnly();
-    flushAllDataAndResetRDB(async? EMPTYDB_ASYNC: EMPTYDB_NO_FLAGS);
-    if (server.aof_enabled && restart_aof) restartAOFAfterSYNC();
-}
-
-/* Returns the number of keys in the current db. */
-unsigned long long RM_DbSize(RedisModuleCtx *ctx) {
-    return dictSize(ctx->client->db->dict);
-}
-
-/* Returns a name of a random key, or NULL if current db is empty. */
-RedisModuleString *RM_RandomKey(RedisModuleCtx *ctx) {
-    robj *key = dbRandomKey(ctx->client->db);
-    autoMemoryAdd(ctx,REDISMODULE_AM_STRING,key);
-    return key;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for String type
- *
- * See also RM_ValueLength(), which returns the length of a string.
- * -------------------------------------------------------------------------- */
-
-/* If the key is open for writing, set the specified string 'str' as the
- * value of the key, deleting the old value if any.
- * On success REDISMODULE_OK is returned. If the key is not open for
- * writing or there is an active iterator, REDISMODULE_ERR is returned. */
-int RM_StringSet(RedisModuleKey *key, RedisModuleString *str) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->iter) return REDISMODULE_ERR;
-    RM_DeleteKey(key);
-    genericSetKey(key->ctx->client,key->db,key->key,str,0,0);
-    key->value = str;
-    return REDISMODULE_OK;
-}
-
-/* Prepare the key associated string value for DMA access, and returns
- * a pointer and size (by reference), that the user can use to read or
- * modify the string in-place accessing it directly via pointer.
- *
- * The 'mode' is composed by bitwise OR-ing the following flags:
- *
- *     REDISMODULE_READ -- Read access
- *     REDISMODULE_WRITE -- Write access
- *
- * If the DMA is not requested for writing, the pointer returned should
- * only be accessed in a read-only fashion.
- *
- * On error (wrong type) NULL is returned.
- *
- * DMA access rules:
- *
- * 1. No other key writing function should be called since the moment
- * the pointer is obtained, for all the time we want to use DMA access
- * to read or modify the string.
- *
- * 2. Each time RM_StringTruncate() is called, to continue with the DMA
- * access, RM_StringDMA() should be called again to re-obtain
- * a new pointer and length.
- *
- * 3. If the returned pointer is not NULL, but the length is zero, no
- * byte can be touched (the string is empty, or the key itself is empty)
- * so a RM_StringTruncate() call should be used if there is to enlarge
- * the string, and later call StringDMA() again to get the pointer.
- */
-char *RM_StringDMA(RedisModuleKey *key, size_t *len, int mode) {
-    /* We need to return *some* pointer for empty keys, we just return
-     * a string literal pointer, that is the advantage to be mapped into
-     * a read only memory page, so the module will segfault if a write
-     * attempt is performed. */
-    char *emptystring = "<dma-empty-string>";
-    if (key->value == NULL) {
-        *len = 0;
-        return emptystring;
-    }
-
-    if (key->value->type != OBJ_STRING) return NULL;
-
-    /* For write access, and even for read access if the object is encoded,
-     * we unshare the string (that has the side effect of decoding it). */
-    if ((mode & REDISMODULE_WRITE) || key->value->encoding != OBJ_ENCODING_RAW)
-        key->value = dbUnshareStringValue(key->db, key->key, key->value);
-
-    *len = sdslen(key->value->ptr);
-    return key->value->ptr;
-}
-
-/* If the string is open for writing and is of string type, resize it, padding
- * with zero bytes if the new length is greater than the old one.
- *
- * After this call, RM_StringDMA() must be called again to continue
- * DMA access with the new pointer.
- *
- * The function returns REDISMODULE_OK on success, and REDISMODULE_ERR on
- * error, that is, the key is not open for writing, is not a string
- * or resizing for more than 512 MB is requested.
- *
- * If the key is empty, a string key is created with the new string value
- * unless the new length value requested is zero. */
-int RM_StringTruncate(RedisModuleKey *key, size_t newlen) {
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value && key->value->type != OBJ_STRING) return REDISMODULE_ERR;
-    if (newlen > 512*1024*1024) return REDISMODULE_ERR;
-
-    /* Empty key and new len set to 0. Just return REDISMODULE_OK without
-     * doing anything. */
-    if (key->value == NULL && newlen == 0) return REDISMODULE_OK;
-
-    if (key->value == NULL) {
-        /* Empty key: create it with the new size. */
-        robj *o = createObject(OBJ_STRING,sdsnewlen(NULL, newlen));
-        genericSetKey(key->ctx->client,key->db,key->key,o,0,0);
-        key->value = o;
-        decrRefCount(o);
-    } else {
-        /* Unshare and resize. */
-        key->value = dbUnshareStringValue(key->db, key->key, key->value);
-        size_t curlen = sdslen(key->value->ptr);
-        if (newlen > curlen) {
-            key->value->ptr = sdsgrowzero(key->value->ptr,newlen);
-        } else if (newlen < curlen) {
-            sdssubstr(key->value->ptr,0,newlen);
-            /* If the string is too wasteful, reallocate it. */
-            if (sdslen(key->value->ptr) < sdsavail(key->value->ptr))
-                key->value->ptr = sdsRemoveFreeSpace(key->value->ptr);
-        }
-    }
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for List type
- *
- * See also RM_ValueLength(), which returns the length of a list.
- * -------------------------------------------------------------------------- */
-
-/* Push an element into a list, on head or tail depending on 'where' argument.
- * If the key pointer is about an empty key opened for writing, the key
- * is created. On error (key opened for read-only operations or of the wrong
- * type) REDISMODULE_ERR is returned, otherwise REDISMODULE_OK is returned. */
-int RM_ListPush(RedisModuleKey *key, int where, RedisModuleString *ele) {
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value && key->value->type != OBJ_LIST) return REDISMODULE_ERR;
-    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_LIST);
-    listTypePush(key->value, ele,
-        (where == REDISMODULE_LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL);
-    return REDISMODULE_OK;
-}
-
-/* Pop an element from the list, and returns it as a module string object
- * that the user should be free with RM_FreeString() or by enabling
- * automatic memory. 'where' specifies if the element should be popped from
- * head or tail. The command returns NULL if:
- *
- * 1. The list is empty.
- * 2. The key was not open for writing.
- * 3. The key is not a list. */
-RedisModuleString *RM_ListPop(RedisModuleKey *key, int where) {
-    if (!(key->mode & REDISMODULE_WRITE) ||
-        key->value == NULL ||
-        key->value->type != OBJ_LIST) return NULL;
-    robj *ele = listTypePop(key->value,
-        (where == REDISMODULE_LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL);
-    robj *decoded = getDecodedObject(ele);
-    decrRefCount(ele);
-    moduleDelKeyIfEmpty(key);
-    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,decoded);
-    return decoded;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for Sorted Set type
- *
- * See also RM_ValueLength(), which returns the length of a sorted set.
- * -------------------------------------------------------------------------- */
-
-/* Conversion from/to public flags of the Modules API and our private flags,
- * so that we have everything decoupled. */
-int moduleZsetAddFlagsToCoreFlags(int flags) {
-    int retflags = 0;
-    if (flags & REDISMODULE_ZADD_XX) retflags |= ZADD_IN_XX;
-    if (flags & REDISMODULE_ZADD_NX) retflags |= ZADD_IN_NX;
-    if (flags & REDISMODULE_ZADD_GT) retflags |= ZADD_IN_GT;
-    if (flags & REDISMODULE_ZADD_LT) retflags |= ZADD_IN_LT;
-    return retflags;
-}
-
-/* See previous function comment. */
-int moduleZsetAddFlagsFromCoreFlags(int flags) {
-    int retflags = 0;
-    if (flags & ZADD_OUT_ADDED) retflags |= REDISMODULE_ZADD_ADDED;
-    if (flags & ZADD_OUT_UPDATED) retflags |= REDISMODULE_ZADD_UPDATED;
-    if (flags & ZADD_OUT_NOP) retflags |= REDISMODULE_ZADD_NOP;
-    return retflags;
-}
-
-/* Add a new element into a sorted set, with the specified 'score'.
- * If the element already exists, the score is updated.
- *
- * A new sorted set is created at value if the key is an empty open key
- * setup for writing.
- *
- * Additional flags can be passed to the function via a pointer, the flags
- * are both used to receive input and to communicate state when the function
- * returns. 'flagsptr' can be NULL if no special flags are used.
- *
- * The input flags are:
- *
- *     REDISMODULE_ZADD_XX: Element must already exist. Do nothing otherwise.
- *     REDISMODULE_ZADD_NX: Element must not exist. Do nothing otherwise.
- *     REDISMODULE_ZADD_GT: If element exists, new score must be greater than the current score. 
- *                          Do nothing otherwise. Can optionally be combined with XX.
- *     REDISMODULE_ZADD_LT: If element exists, new score must be less than the current score.
- *                          Do nothing otherwise. Can optionally be combined with XX.
- *
- * The output flags are:
- *
- *     REDISMODULE_ZADD_ADDED: The new element was added to the sorted set.
- *     REDISMODULE_ZADD_UPDATED: The score of the element was updated.
- *     REDISMODULE_ZADD_NOP: No operation was performed because XX or NX flags.
- *
- * On success the function returns REDISMODULE_OK. On the following errors
- * REDISMODULE_ERR is returned:
- *
- * * The key was not opened for writing.
- * * The key is of the wrong type.
- * * 'score' double value is not a number (NaN).
- */
-int RM_ZsetAdd(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr) {
-    int in_flags = 0, out_flags = 0;
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_ZSET);
-    if (flagsptr) in_flags = moduleZsetAddFlagsToCoreFlags(*flagsptr);
-    if (zsetAdd(key->value,score,ele->ptr,in_flags,&out_flags,NULL) == 0) {
-        if (flagsptr) *flagsptr = 0;
-        return REDISMODULE_ERR;
-    }
-    if (flagsptr) *flagsptr = moduleZsetAddFlagsFromCoreFlags(out_flags);
-    return REDISMODULE_OK;
-}
-
-/* This function works exactly like RM_ZsetAdd(), but instead of setting
- * a new score, the score of the existing element is incremented, or if the
- * element does not already exist, it is added assuming the old score was
- * zero.
- *
- * The input and output flags, and the return value, have the same exact
- * meaning, with the only difference that this function will return
- * REDISMODULE_ERR even when 'score' is a valid double number, but adding it
- * to the existing score results into a NaN (not a number) condition.
- *
- * This function has an additional field 'newscore', if not NULL is filled
- * with the new score of the element after the increment, if no error
- * is returned. */
-int RM_ZsetIncrby(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr, double *newscore) {
-    int in_flags = 0, out_flags = 0;
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_ZSET);
-    if (flagsptr) in_flags = moduleZsetAddFlagsToCoreFlags(*flagsptr);
-    in_flags |= ZADD_IN_INCR;
-    if (zsetAdd(key->value,score,ele->ptr,in_flags,&out_flags,newscore) == 0) {
-        if (flagsptr) *flagsptr = 0;
-        return REDISMODULE_ERR;
-    }
-    if (flagsptr) *flagsptr = moduleZsetAddFlagsFromCoreFlags(out_flags);
-    return REDISMODULE_OK;
-}
-
-/* Remove the specified element from the sorted set.
- * The function returns REDISMODULE_OK on success, and REDISMODULE_ERR
- * on one of the following conditions:
- *
- * * The key was not opened for writing.
- * * The key is of the wrong type.
- *
- * The return value does NOT indicate the fact the element was really
- * removed (since it existed) or not, just if the function was executed
- * with success.
- *
- * In order to know if the element was removed, the additional argument
- * 'deleted' must be passed, that populates the integer by reference
- * setting it to 1 or 0 depending on the outcome of the operation.
- * The 'deleted' argument can be NULL if the caller is not interested
- * to know if the element was really removed.
- *
- * Empty keys will be handled correctly by doing nothing. */
-int RM_ZsetRem(RedisModuleKey *key, RedisModuleString *ele, int *deleted) {
-    if (!(key->mode & REDISMODULE_WRITE)) return REDISMODULE_ERR;
-    if (key->value && key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-    if (key->value != NULL && zsetDel(key->value,ele->ptr)) {
-        if (deleted) *deleted = 1;
-        moduleDelKeyIfEmpty(key);
-    } else {
-        if (deleted) *deleted = 0;
-    }
-    return REDISMODULE_OK;
-}
-
-/* On success retrieve the double score associated at the sorted set element
- * 'ele' and returns REDISMODULE_OK. Otherwise REDISMODULE_ERR is returned
- * to signal one of the following conditions:
- *
- * * There is no such element 'ele' in the sorted set.
- * * The key is not a sorted set.
- * * The key is an open empty key.
- */
-int RM_ZsetScore(RedisModuleKey *key, RedisModuleString *ele, double *score) {
-    if (key->value == NULL) return REDISMODULE_ERR;
-    if (key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-    if (zsetScore(key->value,ele->ptr,score) == C_ERR) return REDISMODULE_ERR;
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for Sorted Set iterator
- * -------------------------------------------------------------------------- */
-
-void zsetKeyReset(RedisModuleKey *key) {
-    key->u.zset.type = REDISMODULE_ZSET_RANGE_NONE;
-    key->u.zset.current = NULL;
-    key->u.zset.er = 1;
-}
-
-/* Stop a sorted set iteration. */
-void RM_ZsetRangeStop(RedisModuleKey *key) {
-    if (!key->value || key->value->type != OBJ_ZSET) return;
-    /* Free resources if needed. */
-    if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX)
-        zslFreeLexRange(&key->u.zset.lrs);
-    /* Setup sensible values so that misused iteration API calls when an
-     * iterator is not active will result into something more sensible
-     * than crashing. */
-    zsetKeyReset(key);
-}
-
-/* Return the "End of range" flag value to signal the end of the iteration. */
-int RM_ZsetRangeEndReached(RedisModuleKey *key) {
-    if (!key->value || key->value->type != OBJ_ZSET) return 1;
-    return key->u.zset.er;
-}
-
-/* Helper function for RM_ZsetFirstInScoreRange() and RM_ZsetLastInScoreRange().
- * Setup the sorted set iteration according to the specified score range
- * (see the functions calling it for more info). If 'first' is true the
- * first element in the range is used as a starting point for the iterator
- * otherwise the last. Return REDISMODULE_OK on success otherwise
- * REDISMODULE_ERR. */
-int zsetInitScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex, int first) {
-    if (!key->value || key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-
-    RM_ZsetRangeStop(key);
-    key->u.zset.type = REDISMODULE_ZSET_RANGE_SCORE;
-    key->u.zset.er = 0;
-
-    /* Setup the range structure used by the sorted set core implementation
-     * in order to seek at the specified element. */
-    zrangespec *zrs = &key->u.zset.rs;
-    zrs->min = min;
-    zrs->max = max;
-    zrs->minex = minex;
-    zrs->maxex = maxex;
-
-    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
-        key->u.zset.current = first ? zzlFirstInRange(key->value->ptr,zrs) :
-                                      zzlLastInRange(key->value->ptr,zrs);
-    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = key->value->ptr;
-        zskiplist *zsl = zs->zsl;
-        key->u.zset.current = first ? zslFirstInRange(zsl,zrs) :
-                                      zslLastInRange(zsl,zrs);
-    } else {
-        serverPanic("Unsupported zset encoding");
-    }
-    if (key->u.zset.current == NULL) key->u.zset.er = 1;
-    return REDISMODULE_OK;
-}
-
-/* Setup a sorted set iterator seeking the first element in the specified
- * range. Returns REDISMODULE_OK if the iterator was correctly initialized
- * otherwise REDISMODULE_ERR is returned in the following conditions:
- *
- * 1. The value stored at key is not a sorted set or the key is empty.
- *
- * The range is specified according to the two double values 'min' and 'max'.
- * Both can be infinite using the following two macros:
- *
- * * REDISMODULE_POSITIVE_INFINITE for positive infinite value
- * * REDISMODULE_NEGATIVE_INFINITE for negative infinite value
- *
- * 'minex' and 'maxex' parameters, if true, respectively setup a range
- * where the min and max value are exclusive (not included) instead of
- * inclusive. */
-int RM_ZsetFirstInScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex) {
-    return zsetInitScoreRange(key,min,max,minex,maxex,1);
-}
-
-/* Exactly like RedisModule_ZsetFirstInScoreRange() but the last element of
- * the range is selected for the start of the iteration instead. */
-int RM_ZsetLastInScoreRange(RedisModuleKey *key, double min, double max, int minex, int maxex) {
-    return zsetInitScoreRange(key,min,max,minex,maxex,0);
-}
-
-/* Helper function for RM_ZsetFirstInLexRange() and RM_ZsetLastInLexRange().
- * Setup the sorted set iteration according to the specified lexicographical
- * range (see the functions calling it for more info). If 'first' is true the
- * first element in the range is used as a starting point for the iterator
- * otherwise the last. Return REDISMODULE_OK on success otherwise
- * REDISMODULE_ERR.
- *
- * Note that this function takes 'min' and 'max' in the same form of the
- * Redis ZRANGEBYLEX command. */
-int zsetInitLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max, int first) {
-    if (!key->value || key->value->type != OBJ_ZSET) return REDISMODULE_ERR;
-
-    RM_ZsetRangeStop(key);
-    key->u.zset.er = 0;
-
-    /* Setup the range structure used by the sorted set core implementation
-     * in order to seek at the specified element. */
-    zlexrangespec *zlrs = &key->u.zset.lrs;
-    if (zslParseLexRange(min, max, zlrs) == C_ERR) return REDISMODULE_ERR;
-
-    /* Set the range type to lex only after successfully parsing the range,
-     * otherwise we don't want the zlexrangespec to be freed. */
-    key->u.zset.type = REDISMODULE_ZSET_RANGE_LEX;
-
-    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
-        key->u.zset.current = first ? zzlFirstInLexRange(key->value->ptr,zlrs) :
-                                      zzlLastInLexRange(key->value->ptr,zlrs);
-    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = key->value->ptr;
-        zskiplist *zsl = zs->zsl;
-        key->u.zset.current = first ? zslFirstInLexRange(zsl,zlrs) :
-                                      zslLastInLexRange(zsl,zlrs);
-    } else {
-        serverPanic("Unsupported zset encoding");
-    }
-    if (key->u.zset.current == NULL) key->u.zset.er = 1;
-
-    return REDISMODULE_OK;
-}
-
-/* Setup a sorted set iterator seeking the first element in the specified
- * lexicographical range. Returns REDISMODULE_OK if the iterator was correctly
- * initialized otherwise REDISMODULE_ERR is returned in the
- * following conditions:
- *
- * 1. The value stored at key is not a sorted set or the key is empty.
- * 2. The lexicographical range 'min' and 'max' format is invalid.
- *
- * 'min' and 'max' should be provided as two RedisModuleString objects
- * in the same format as the parameters passed to the ZRANGEBYLEX command.
- * The function does not take ownership of the objects, so they can be released
- * ASAP after the iterator is setup. */
-int RM_ZsetFirstInLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) {
-    return zsetInitLexRange(key,min,max,1);
-}
-
-/* Exactly like RedisModule_ZsetFirstInLexRange() but the last element of
- * the range is selected for the start of the iteration instead. */
-int RM_ZsetLastInLexRange(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) {
-    return zsetInitLexRange(key,min,max,0);
-}
-
-/* Return the current sorted set element of an active sorted set iterator
- * or NULL if the range specified in the iterator does not include any
- * element. */
-RedisModuleString *RM_ZsetRangeCurrentElement(RedisModuleKey *key, double *score) {
-    RedisModuleString *str;
-
-    if (!key->value || key->value->type != OBJ_ZSET) return NULL;
-    if (key->u.zset.current == NULL) return NULL;
-    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *eptr, *sptr;
-        eptr = key->u.zset.current;
-        sds ele = ziplistGetObject(eptr);
-        if (score) {
-            sptr = ziplistNext(key->value->ptr,eptr);
-            *score = zzlGetScore(sptr);
-        }
-        str = createObject(OBJ_STRING,ele);
-    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
-        zskiplistNode *ln = key->u.zset.current;
-        if (score) *score = ln->score;
-        str = createStringObject(ln->ele,sdslen(ln->ele));
-    } else {
-        serverPanic("Unsupported zset encoding");
-    }
-    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,str);
-    return str;
-}
-
-/* Go to the next element of the sorted set iterator. Returns 1 if there was
- * a next element, 0 if we are already at the latest element or the range
- * does not include any item at all. */
-int RM_ZsetRangeNext(RedisModuleKey *key) {
-    if (!key->value || key->value->type != OBJ_ZSET) return 0;
-    if (!key->u.zset.type || !key->u.zset.current) return 0; /* No active iterator. */
-
-    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = key->value->ptr;
-        unsigned char *eptr = key->u.zset.current;
-        unsigned char *next;
-        next = ziplistNext(zl,eptr); /* Skip element. */
-        if (next) next = ziplistNext(zl,next); /* Skip score. */
-        if (next == NULL) {
-            key->u.zset.er = 1;
-            return 0;
-        } else {
-            /* Are we still within the range? */
-            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE) {
-                /* Fetch the next element score for the
-                 * range check. */
-                unsigned char *saved_next = next;
-                next = ziplistNext(zl,next); /* Skip next element. */
-                double score = zzlGetScore(next); /* Obtain the next score. */
-                if (!zslValueLteMax(score,&key->u.zset.rs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-                next = saved_next;
-            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
-                if (!zzlLexValueLteMax(next,&key->u.zset.lrs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-            }
-            key->u.zset.current = next;
-            return 1;
-        }
-    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
-        zskiplistNode *ln = key->u.zset.current, *next = ln->level[0].forward;
-        if (next == NULL) {
-            key->u.zset.er = 1;
-            return 0;
-        } else {
-            /* Are we still within the range? */
-            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE &&
-                !zslValueLteMax(next->score,&key->u.zset.rs))
-            {
-                key->u.zset.er = 1;
-                return 0;
-            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
-                if (!zslLexValueLteMax(next->ele,&key->u.zset.lrs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-            }
-            key->u.zset.current = next;
-            return 1;
-        }
-    } else {
-        serverPanic("Unsupported zset encoding");
-    }
-}
-
-/* Go to the previous element of the sorted set iterator. Returns 1 if there was
- * a previous element, 0 if we are already at the first element or the range
- * does not include any item at all. */
-int RM_ZsetRangePrev(RedisModuleKey *key) {
-    if (!key->value || key->value->type != OBJ_ZSET) return 0;
-    if (!key->u.zset.type || !key->u.zset.current) return 0; /* No active iterator. */
-
-    if (key->value->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = key->value->ptr;
-        unsigned char *eptr = key->u.zset.current;
-        unsigned char *prev;
-        prev = ziplistPrev(zl,eptr); /* Go back to previous score. */
-        if (prev) prev = ziplistPrev(zl,prev); /* Back to previous ele. */
-        if (prev == NULL) {
-            key->u.zset.er = 1;
-            return 0;
-        } else {
-            /* Are we still within the range? */
-            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE) {
-                /* Fetch the previous element score for the
-                 * range check. */
-                unsigned char *saved_prev = prev;
-                prev = ziplistNext(zl,prev); /* Skip element to get the score.*/
-                double score = zzlGetScore(prev); /* Obtain the prev score. */
-                if (!zslValueGteMin(score,&key->u.zset.rs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-                prev = saved_prev;
-            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
-                if (!zzlLexValueGteMin(prev,&key->u.zset.lrs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-            }
-            key->u.zset.current = prev;
-            return 1;
-        }
-    } else if (key->value->encoding == OBJ_ENCODING_SKIPLIST) {
-        zskiplistNode *ln = key->u.zset.current, *prev = ln->backward;
-        if (prev == NULL) {
-            key->u.zset.er = 1;
-            return 0;
-        } else {
-            /* Are we still within the range? */
-            if (key->u.zset.type == REDISMODULE_ZSET_RANGE_SCORE &&
-                !zslValueGteMin(prev->score,&key->u.zset.rs))
-            {
-                key->u.zset.er = 1;
-                return 0;
-            } else if (key->u.zset.type == REDISMODULE_ZSET_RANGE_LEX) {
-                if (!zslLexValueGteMin(prev->ele,&key->u.zset.lrs)) {
-                    key->u.zset.er = 1;
-                    return 0;
-                }
-            }
-            key->u.zset.current = prev;
-            return 1;
-        }
-    } else {
-        serverPanic("Unsupported zset encoding");
-    }
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for Hash type
- *
- * See also RM_ValueLength(), which returns the number of fields in a hash.
- * -------------------------------------------------------------------------- */
-
-/* Set the field of the specified hash field to the specified value.
- * If the key is an empty key open for writing, it is created with an empty
- * hash value, in order to set the specified field.
- *
- * The function is variadic and the user must specify pairs of field
- * names and values, both as RedisModuleString pointers (unless the
- * CFIELD option is set, see later). At the end of the field/value-ptr pairs, 
- * NULL must be specified as last argument to signal the end of the arguments 
- * in the variadic function.
- *
- * Example to set the hash argv[1] to the value argv[2]:
- *
- *      RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[1],argv[2],NULL);
- *
- * The function can also be used in order to delete fields (if they exist)
- * by setting them to the specified value of REDISMODULE_HASH_DELETE:
- *
- *      RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[1],
- *                          REDISMODULE_HASH_DELETE,NULL);
- *
- * The behavior of the command changes with the specified flags, that can be
- * set to REDISMODULE_HASH_NONE if no special behavior is needed.
- *
- *     REDISMODULE_HASH_NX: The operation is performed only if the field was not
- *                          already existing in the hash.
- *     REDISMODULE_HASH_XX: The operation is performed only if the field was
- *                          already existing, so that a new value could be
- *                          associated to an existing filed, but no new fields
- *                          are created.
- *     REDISMODULE_HASH_CFIELDS: The field names passed are null terminated C
- *                               strings instead of RedisModuleString objects.
- *     REDISMODULE_HASH_COUNT_ALL: Include the number of inserted fields in the
- *                                 returned number, in addition to the number of
- *                                 updated and deleted fields. (Added in Redis
- *                                 6.2.)
- *
- * Unless NX is specified, the command overwrites the old field value with
- * the new one.
- *
- * When using REDISMODULE_HASH_CFIELDS, field names are reported using
- * normal C strings, so for example to delete the field "foo" the following
- * code can be used:
- *
- *      RedisModule_HashSet(key,REDISMODULE_HASH_CFIELDS,"foo",
- *                          REDISMODULE_HASH_DELETE,NULL);
- *
- * Return value:
- *
- * The number of fields existing in the hash prior to the call, which have been
- * updated (its old value has been replaced by a new value) or deleted. If the
- * flag REDISMODULE_HASH_COUNT_ALL is set, insterted fields not previously
- * existing in the hash are also counted.
- *
- * If the return value is zero, `errno` is set (since Redis 6.2) as follows:
- *
- * - EINVAL if any unknown flags are set or if key is NULL.
- * - ENOTSUP if the key is associated with a non Hash value.
- * - EBADF if the key was not opened for writing.
- * - ENOENT if no fields were counted as described under Return value above.
- *   This is not actually an error. The return value can be zero if all fields
- *   were just created and the COUNT_ALL flag was unset, or if changes were held
- *   back due to the NX and XX flags.
- *
- * NOTICE: The return value semantics of this function are very different
- * between Redis 6.2 and older versions. Modules that use it should determine
- * the Redis version and handle it accordingly.
- */
-int RM_HashSet(RedisModuleKey *key, int flags, ...) {
-    va_list ap;
-    if (!key || (flags & ~(REDISMODULE_HASH_NX |
-                           REDISMODULE_HASH_XX |
-                           REDISMODULE_HASH_CFIELDS |
-                           REDISMODULE_HASH_COUNT_ALL))) {
-        errno = EINVAL;
-        return 0;
-    } else if (key->value && key->value->type != OBJ_HASH) {
-        errno = ENOTSUP;
-        return 0;
-    } else if (!(key->mode & REDISMODULE_WRITE)) {
-        errno = EBADF;
-        return 0;
-    }
-    if (key->value == NULL) moduleCreateEmptyKey(key,REDISMODULE_KEYTYPE_HASH);
-
-    int count = 0;
-    va_start(ap, flags);
-    while(1) {
-        RedisModuleString *field, *value;
-        /* Get the field and value objects. */
-        if (flags & REDISMODULE_HASH_CFIELDS) {
-            char *cfield = va_arg(ap,char*);
-            if (cfield == NULL) break;
-            field = createRawStringObject(cfield,strlen(cfield));
-        } else {
-            field = va_arg(ap,RedisModuleString*);
-            if (field == NULL) break;
-        }
-        value = va_arg(ap,RedisModuleString*);
-
-        /* Handle XX and NX */
-        if (flags & (REDISMODULE_HASH_XX|REDISMODULE_HASH_NX)) {
-            int exists = hashTypeExists(key->value, field->ptr);
-            if (((flags & REDISMODULE_HASH_XX) && !exists) ||
-                ((flags & REDISMODULE_HASH_NX) && exists))
-            {
-                if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
-                continue;
-            }
-        }
-
-        /* Handle deletion if value is REDISMODULE_HASH_DELETE. */
-        if (value == REDISMODULE_HASH_DELETE) {
-            count += hashTypeDelete(key->value, field->ptr);
-            if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
-            continue;
-        }
-
-        int low_flags = HASH_SET_COPY;
-        /* If CFIELDS is active, we can pass the ownership of the
-         * SDS object to the low level function that sets the field
-         * to avoid a useless copy. */
-        if (flags & REDISMODULE_HASH_CFIELDS)
-            low_flags |= HASH_SET_TAKE_FIELD;
-
-        robj *argv[2] = {field,value};
-        hashTypeTryConversion(key->value,argv,0,1);
-        int updated = hashTypeSet(key->value, field->ptr, value->ptr, low_flags);
-        count += (flags & REDISMODULE_HASH_COUNT_ALL) ? 1 : updated;
-
-        /* If CFIELDS is active, SDS string ownership is now of hashTypeSet(),
-         * however we still have to release the 'field' object shell. */
-        if (flags & REDISMODULE_HASH_CFIELDS) {
-           field->ptr = NULL; /* Prevent the SDS string from being freed. */
-           decrRefCount(field);
-        }
-    }
-    va_end(ap);
-    moduleDelKeyIfEmpty(key);
-    if (count == 0) errno = ENOENT;
-    return count;
-}
-
-/* Get fields from an hash value. This function is called using a variable
- * number of arguments, alternating a field name (as a RedisModuleString
- * pointer) with a pointer to a RedisModuleString pointer, that is set to the
- * value of the field if the field exists, or NULL if the field does not exist.
- * At the end of the field/value-ptr pairs, NULL must be specified as last
- * argument to signal the end of the arguments in the variadic function.
- *
- * This is an example usage:
- *
- *      RedisModuleString *first, *second;
- *      RedisModule_HashGet(mykey,REDISMODULE_HASH_NONE,argv[1],&first,
- *                          argv[2],&second,NULL);
- *
- * As with RedisModule_HashSet() the behavior of the command can be specified
- * passing flags different than REDISMODULE_HASH_NONE:
- *
- * REDISMODULE_HASH_CFIELDS: field names as null terminated C strings.
- *
- * REDISMODULE_HASH_EXISTS: instead of setting the value of the field
- * expecting a RedisModuleString pointer to pointer, the function just
- * reports if the field exists or not and expects an integer pointer
- * as the second element of each pair.
- *
- * Example of REDISMODULE_HASH_CFIELDS:
- *
- *      RedisModuleString *username, *hashedpass;
- *      RedisModule_HashGet(mykey,REDISMODULE_HASH_CFIELDS,"username",&username,"hp",&hashedpass, NULL);
- *
- * Example of REDISMODULE_HASH_EXISTS:
- *
- *      int exists;
- *      RedisModule_HashGet(mykey,REDISMODULE_HASH_EXISTS,argv[1],&exists,NULL);
- *
- * The function returns REDISMODULE_OK on success and REDISMODULE_ERR if
- * the key is not an hash value.
- *
- * Memory management:
- *
- * The returned RedisModuleString objects should be released with
- * RedisModule_FreeString(), or by enabling automatic memory management.
- */
-int RM_HashGet(RedisModuleKey *key, int flags, ...) {
-    va_list ap;
-    if (key->value && key->value->type != OBJ_HASH) return REDISMODULE_ERR;
-
-    va_start(ap, flags);
-    while(1) {
-        RedisModuleString *field, **valueptr;
-        int *existsptr;
-        /* Get the field object and the value pointer to pointer. */
-        if (flags & REDISMODULE_HASH_CFIELDS) {
-            char *cfield = va_arg(ap,char*);
-            if (cfield == NULL) break;
-            field = createRawStringObject(cfield,strlen(cfield));
-        } else {
-            field = va_arg(ap,RedisModuleString*);
-            if (field == NULL) break;
-        }
-
-        /* Query the hash for existence or value object. */
-        if (flags & REDISMODULE_HASH_EXISTS) {
-            existsptr = va_arg(ap,int*);
-            if (key->value)
-                *existsptr = hashTypeExists(key->value,field->ptr);
-            else
-                *existsptr = 0;
-        } else {
-            valueptr = va_arg(ap,RedisModuleString**);
-            if (key->value) {
-                *valueptr = hashTypeGetValueObject(key->value,field->ptr);
-                if (*valueptr) {
-                    robj *decoded = getDecodedObject(*valueptr);
-                    decrRefCount(*valueptr);
-                    *valueptr = decoded;
-                }
-                if (*valueptr)
-                    autoMemoryAdd(key->ctx,REDISMODULE_AM_STRING,*valueptr);
-            } else {
-                *valueptr = NULL;
-            }
-        }
-
-        /* Cleanup */
-        if (flags & REDISMODULE_HASH_CFIELDS) decrRefCount(field);
-    }
-    va_end(ap);
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key API for Stream type
- *
- * For an introduction to streams, see https://redis.io/topics/streams-intro.
- *
- * The type RedisModuleStreamID, which is used in stream functions, is a struct
- * with two 64-bit fields and is defined as
- *
- *     typedef struct RedisModuleStreamID {
- *         uint64_t ms;
- *         uint64_t seq;
- *     } RedisModuleStreamID;
- *
- * See also RM_ValueLength(), which returns the length of a stream, and the
- * conversion functions RM_StringToStreamID() and RM_CreateStringFromStreamID().
- * -------------------------------------------------------------------------- */
-
-/* Adds an entry to a stream. Like XADD without trimming.
- *
- * - `key`: The key where the stream is (or will be) stored
- * - `flags`: A bit field of
- *   - `REDISMODULE_STREAM_ADD_AUTOID`: Assign a stream ID automatically, like
- *     `*` in the XADD command.
- * - `id`: If the `AUTOID` flag is set, this is where the assigned ID is
- *   returned. Can be NULL if `AUTOID` is set, if you don't care to receive the
- *   ID. If `AUTOID` is not set, this is the requested ID.
- * - `argv`: A pointer to an array of size `numfields * 2` containing the
- *   fields and values.
- * - `numfields`: The number of field-value pairs in `argv`.
- *
- * Returns REDISMODULE_OK if an entry has been added. On failure,
- * REDISMODULE_ERR is returned and `errno` is set as follows:
- *
- * - EINVAL if called with invalid arguments
- * - ENOTSUP if the key refers to a value of a type other than stream
- * - EBADF if the key was not opened for writing
- * - EDOM if the given ID was 0-0 or not greater than all other IDs in the
- *   stream (only if the AUTOID flag is unset)
- * - EFBIG if the stream has reached the last possible ID
- * - ERANGE if the elements are too large to be stored.
- */
-int RM_StreamAdd(RedisModuleKey *key, int flags, RedisModuleStreamID *id, RedisModuleString **argv, long numfields) {
-    /* Validate args */
-    if (!key || (numfields != 0 && !argv) || /* invalid key or argv */
-        (flags & ~(REDISMODULE_STREAM_ADD_AUTOID)) || /* invalid flags */
-        (!(flags & REDISMODULE_STREAM_ADD_AUTOID) && !id)) { /* id required */
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (key->value && key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP; /* wrong type */
-        return REDISMODULE_ERR;
-    } else if (!(key->mode & REDISMODULE_WRITE)) {
-        errno = EBADF; /* key not open for writing */
-        return REDISMODULE_ERR;
-    } else if (!(flags & REDISMODULE_STREAM_ADD_AUTOID) &&
-               id->ms == 0 && id->seq == 0) {
-        errno = EDOM; /* ID out of range */
-        return REDISMODULE_ERR;
-    }
-
-    /* Create key if necessery */
-    int created = 0;
-    if (key->value == NULL) {
-        moduleCreateEmptyKey(key, REDISMODULE_KEYTYPE_STREAM);
-        created = 1;
-    }
-
-    stream *s = key->value->ptr;
-    if (s->last_id.ms == UINT64_MAX && s->last_id.seq == UINT64_MAX) {
-        /* The stream has reached the last possible ID */
-        errno = EFBIG;
-        return REDISMODULE_ERR;
-    }
-
-    streamID added_id;
-    streamID use_id;
-    streamID *use_id_ptr = NULL;
-    if (!(flags & REDISMODULE_STREAM_ADD_AUTOID)) {
-        use_id.ms = id->ms;
-        use_id.seq = id->seq;
-        use_id_ptr = &use_id;
-    }
-    if (streamAppendItem(s, argv, numfields, &added_id, use_id_ptr) == C_ERR) {
-        /* Either the ID not greater than all existing IDs in the stream, or
-         * the elements are too large to be stored. either way, errno is already
-         * set by streamAppendItem. */
-        return REDISMODULE_ERR;
-    }
-    /* Postponed signalKeyAsReady(). Done implicitly by moduleCreateEmptyKey()
-     * so not needed if the stream has just been created. */
-    if (!created) key->u.stream.signalready = 1;
-
-    if (id != NULL) {
-        id->ms = added_id.ms;
-        id->seq = added_id.seq;
-    }
-
-    return REDISMODULE_OK;
-}
-
-/* Deletes an entry from a stream.
- *
- * - `key`: A key opened for writing, with no stream iterator started.
- * - `id`: The stream ID of the entry to delete.
- *
- * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
- * and `errno` is set as follows:
- *
- * - EINVAL if called with invalid arguments
- * - ENOTSUP if the key refers to a value of a type other than stream or if the
- *   key is empty
- * - EBADF if the key was not opened for writing or if a stream iterator is
- *   associated with the key
- * - ENOENT if no entry with the given stream ID exists
- *
- * See also RM_StreamIteratorDelete() for deleting the current entry while
- * iterating using a stream iterator.
- */
-int RM_StreamDelete(RedisModuleKey *key, RedisModuleStreamID *id) {
-    if (!key || !id) {
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP; /* wrong type */
-        return REDISMODULE_ERR;
-    } else if (!(key->mode & REDISMODULE_WRITE) ||
-               key->iter != NULL) {
-        errno = EBADF; /* key not opened for writing or iterator started */
-        return REDISMODULE_ERR;
-    }
-    stream *s = key->value->ptr;
-    streamID streamid = {id->ms, id->seq};
-    if (streamDeleteItem(s, &streamid)) {
-        return REDISMODULE_OK;
-    } else {
-        errno = ENOENT; /* no entry with this id */
-        return REDISMODULE_ERR;
-    }
-}
-
-/* Sets up a stream iterator.
- *
- * - `key`: The stream key opened for reading using RedisModule_OpenKey().
- * - `flags`:
- *   - `REDISMODULE_STREAM_ITERATOR_EXCLUSIVE`: Don't include `start` and `end`
- *     in the iterated range.
- *   - `REDISMODULE_STREAM_ITERATOR_REVERSE`: Iterate in reverse order, starting
- *     from the `end` of the range.
- * - `start`: The lower bound of the range. Use NULL for the beginning of the
- *   stream.
- * - `end`: The upper bound of the range. Use NULL for the end of the stream.
- *
- * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
- * and `errno` is set as follows:
- *
- * - EINVAL if called with invalid arguments
- * - ENOTSUP if the key refers to a value of a type other than stream or if the
- *   key is empty
- * - EBADF if the key was not opened for writing or if a stream iterator is
- *   already associated with the key
- * - EDOM if `start` or `end` is outside the valid range
- *
- * Returns REDISMODULE_OK on success and REDISMODULE_ERR if the key doesn't
- * refer to a stream or if invalid arguments were given.
- *
- * The stream IDs are retrieved using RedisModule_StreamIteratorNextID() and
- * for each stream ID, the fields and values are retrieved using
- * RedisModule_StreamIteratorNextField(). The iterator is freed by calling
- * RedisModule_StreamIteratorStop().
- *
- * Example (error handling omitted):
- *
- *     RedisModule_StreamIteratorStart(key, 0, startid_ptr, endid_ptr);
- *     RedisModuleStreamID id;
- *     long numfields;
- *     while (RedisModule_StreamIteratorNextID(key, &id, &numfields) ==
- *            REDISMODULE_OK) {
- *         RedisModuleString *field, *value;
- *         while (RedisModule_StreamIteratorNextField(key, &field, &value) ==
- *                REDISMODULE_OK) {
- *             //
- *             // ... Do stuff ...
- *             //
- *             RedisModule_FreeString(ctx, field);
- *             RedisModule_FreeString(ctx, value);
- *         }
- *     }
- *     RedisModule_StreamIteratorStop(key);
- */
-int RM_StreamIteratorStart(RedisModuleKey *key, int flags, RedisModuleStreamID *start, RedisModuleStreamID *end) {
-    /* check args */
-    if (!key ||
-        (flags & ~(REDISMODULE_STREAM_ITERATOR_EXCLUSIVE |
-                   REDISMODULE_STREAM_ITERATOR_REVERSE))) {
-        errno = EINVAL; /* key missing or invalid flags */
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return REDISMODULE_ERR; /* not a stream */
-    } else if (key->iter) {
-        errno = EBADF; /* iterator already started */
-        return REDISMODULE_ERR;
-    }
-
-    /* define range for streamIteratorStart() */
-    streamID lower, upper;
-    if (start) lower = (streamID){start->ms, start->seq};
-    if (end)   upper = (streamID){end->ms,   end->seq};
-    if (flags & REDISMODULE_STREAM_ITERATOR_EXCLUSIVE) {
-        if ((start && streamIncrID(&lower) != C_OK) ||
-            (end   && streamDecrID(&upper) != C_OK)) {
-            errno = EDOM; /* end is 0-0 or start is MAX-MAX? */
-            return REDISMODULE_ERR;
-        }
-    }
-
-    /* create iterator */
-    stream *s = key->value->ptr;
-    int rev = flags & REDISMODULE_STREAM_ITERATOR_REVERSE;
-    streamIterator *si = zmalloc(sizeof(*si));
-    streamIteratorStart(si, s, start ? &lower : NULL, end ? &upper : NULL, rev);
-    key->iter = si;
-    key->u.stream.currentid.ms = 0; /* for RM_StreamIteratorDelete() */
-    key->u.stream.currentid.seq = 0;
-    key->u.stream.numfieldsleft = 0; /* for RM_StreamIteratorNextField() */
-    return REDISMODULE_OK;
-}
-
-/* Stops a stream iterator created using RedisModule_StreamIteratorStart() and
- * reclaims its memory.
- *
- * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
- * and `errno` is set as follows:
- *
- * - EINVAL if called with a NULL key
- * - ENOTSUP if the key refers to a value of a type other than stream or if the
- *   key is empty
- * - EBADF if the key was not opened for writing or if no stream iterator is
- *   associated with the key
- */
-int RM_StreamIteratorStop(RedisModuleKey *key) {
-    if (!key) {
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return REDISMODULE_ERR;
-    } else if (!key->iter) {
-        errno = EBADF;
-        return REDISMODULE_ERR;
-    }
-    zfree(key->iter);
-    key->iter = NULL;
-    return REDISMODULE_OK;
-}
-
-/* Finds the next stream entry and returns its stream ID and the number of
- * fields.
- *
- * - `key`: Key for which a stream iterator has been started using
- *   RedisModule_StreamIteratorStart().
- * - `id`: The stream ID returned. NULL if you don't care.
- * - `numfields`: The number of fields in the found stream entry. NULL if you
- *   don't care.
- *
- * Returns REDISMODULE_OK and sets `*id` and `*numfields` if an entry was found.
- * On failure, REDISMODULE_ERR is returned and `errno` is set as follows:
- *
- * - EINVAL if called with a NULL key
- * - ENOTSUP if the key refers to a value of a type other than stream or if the
- *   key is empty
- * - EBADF if no stream iterator is associated with the key
- * - ENOENT if there are no more entries in the range of the iterator
- *
- * In practice, if RM_StreamIteratorNextID() is called after a successful call
- * to RM_StreamIteratorStart() and with the same key, it is safe to assume that
- * an REDISMODULE_ERR return value means that there are no more entries.
- *
- * Use RedisModule_StreamIteratorNextField() to retrieve the fields and values.
- * See the example at RedisModule_StreamIteratorStart().
- */
-int RM_StreamIteratorNextID(RedisModuleKey *key, RedisModuleStreamID *id, long *numfields) {
-    if (!key) {
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return REDISMODULE_ERR;
-    } else if (!key->iter) {
-        errno = EBADF;
-        return REDISMODULE_ERR;
-    }
-    streamIterator *si = key->iter;
-    int64_t *num_ptr = &key->u.stream.numfieldsleft;
-    streamID *streamid_ptr = &key->u.stream.currentid;
-    if (streamIteratorGetID(si, streamid_ptr, num_ptr)) {
-        if (id) {
-            id->ms = streamid_ptr->ms;
-            id->seq = streamid_ptr->seq;
-        }
-        if (numfields) *numfields = *num_ptr;
-        return REDISMODULE_OK;
-    } else {
-        /* No entry found. */
-        key->u.stream.currentid.ms = 0; /* for RM_StreamIteratorDelete() */
-        key->u.stream.currentid.seq = 0;
-        key->u.stream.numfieldsleft = 0; /* for RM_StreamIteratorNextField() */
-        errno = ENOENT;
-        return REDISMODULE_ERR;
-    }
-}
-
-/* Retrieves the next field of the current stream ID and its corresponding value
- * in a stream iteration. This function should be called repeatedly after calling
- * RedisModule_StreamIteratorNextID() to fetch each field-value pair.
- *
- * - `key`: Key where a stream iterator has been started.
- * - `field_ptr`: This is where the field is returned.
- * - `value_ptr`: This is where the value is returned.
- *
- * Returns REDISMODULE_OK and points `*field_ptr` and `*value_ptr` to freshly
- * allocated RedisModuleString objects. The string objects are freed
- * automatically when the callback finishes if automatic memory is enabled. On
- * failure, REDISMODULE_ERR is returned and `errno` is set as follows:
- *
- * - EINVAL if called with a NULL key
- * - ENOTSUP if the key refers to a value of a type other than stream or if the
- *   key is empty
- * - EBADF if no stream iterator is associated with the key
- * - ENOENT if there are no more fields in the current stream entry
- *
- * In practice, if RM_StreamIteratorNextField() is called after a successful
- * call to RM_StreamIteratorNextID() and with the same key, it is safe to assume
- * that an REDISMODULE_ERR return value means that there are no more fields.
- *
- * See the example at RedisModule_StreamIteratorStart().
- */
-int RM_StreamIteratorNextField(RedisModuleKey *key, RedisModuleString **field_ptr, RedisModuleString **value_ptr) {
-    if (!key) {
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return REDISMODULE_ERR;
-    } else if (!key->iter) {
-        errno = EBADF;
-        return REDISMODULE_ERR;
-    } else if (key->u.stream.numfieldsleft <= 0) {
-        errno = ENOENT;
-        return REDISMODULE_ERR;
-    }
-    streamIterator *si = key->iter;
-    unsigned char *field, *value;
-    int64_t field_len, value_len;
-    streamIteratorGetField(si, &field, &value, &field_len, &value_len);
-    if (field_ptr) {
-        *field_ptr = createRawStringObject((char *)field, field_len);
-        autoMemoryAdd(key->ctx, REDISMODULE_AM_STRING, *field_ptr);
-    }
-    if (value_ptr) {
-        *value_ptr = createRawStringObject((char *)value, value_len);
-        autoMemoryAdd(key->ctx, REDISMODULE_AM_STRING, *value_ptr);
-    }
-    key->u.stream.numfieldsleft--;
-    return REDISMODULE_OK;
-}
-
-/* Deletes the current stream entry while iterating.
- *
- * This function can be called after RM_StreamIteratorNextID() or after any
- * calls to RM_StreamIteratorNextField().
- *
- * Returns REDISMODULE_OK on success. On failure, REDISMODULE_ERR is returned
- * and `errno` is set as follows:
- *
- * - EINVAL if key is NULL
- * - ENOTSUP if the key is empty or is of another type than stream
- * - EBADF if the key is not opened for writing, if no iterator has been started
- * - ENOENT if the iterator has no current stream entry
- */
-int RM_StreamIteratorDelete(RedisModuleKey *key) {
-    if (!key) {
-        errno = EINVAL;
-        return REDISMODULE_ERR;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return REDISMODULE_ERR;
-    } else if (!(key->mode & REDISMODULE_WRITE) || !key->iter) {
-        errno = EBADF;
-        return REDISMODULE_ERR;
-    } else if (key->u.stream.currentid.ms == 0 &&
-               key->u.stream.currentid.seq == 0) {
-        errno = ENOENT;
-        return REDISMODULE_ERR;
-    }
-    streamIterator *si = key->iter;
-    streamIteratorRemoveEntry(si, &key->u.stream.currentid);
-    key->u.stream.currentid.ms = 0; /* Make sure repeated Delete() fails */
-    key->u.stream.currentid.seq = 0;
-    key->u.stream.numfieldsleft = 0; /* Make sure NextField() fails */
-    return REDISMODULE_OK;
-}
-
-/* Trim a stream by length, similar to XTRIM with MAXLEN.
- *
- * - `key`: Key opened for writing.
- * - `flags`: A bitfield of
- *   - `REDISMODULE_STREAM_TRIM_APPROX`: Trim less if it improves performance,
- *     like XTRIM with `~`.
- * - `length`: The number of stream entries to keep after trimming.
- *
- * Returns the number of entries deleted. On failure, a negative value is
- * returned and `errno` is set as follows:
- *
- * - EINVAL if called with invalid arguments
- * - ENOTSUP if the key is empty or of a type other than stream
- * - EBADF if the key is not opened for writing
- */
-long long RM_StreamTrimByLength(RedisModuleKey *key, int flags, long long length) {
-    if (!key || (flags & ~(REDISMODULE_STREAM_TRIM_APPROX)) || length < 0) {
-        errno = EINVAL;
-        return -1;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return -1;
-    } else if (!(key->mode & REDISMODULE_WRITE)) {
-        errno = EBADF;
-        return -1;
-    }
-    int approx = flags & REDISMODULE_STREAM_TRIM_APPROX ? 1 : 0;
-    return streamTrimByLength((stream *)key->value->ptr, length, approx);
-}
-
-/* Trim a stream by ID, similar to XTRIM with MINID.
- *
- * - `key`: Key opened for writing.
- * - `flags`: A bitfield of
- *   - `REDISMODULE_STREAM_TRIM_APPROX`: Trim less if it improves performance,
- *     like XTRIM with `~`.
- * - `id`: The smallest stream ID to keep after trimming.
- *
- * Returns the number of entries deleted. On failure, a negative value is
- * returned and `errno` is set as follows:
- *
- * - EINVAL if called with invalid arguments
- * - ENOTSUP if the key is empty or of a type other than stream
- * - EBADF if the key is not opened for writing
- */
-long long RM_StreamTrimByID(RedisModuleKey *key, int flags, RedisModuleStreamID *id) {
-    if (!key || (flags & ~(REDISMODULE_STREAM_TRIM_APPROX)) || !id) {
-        errno = EINVAL;
-        return -1;
-    } else if (!key->value || key->value->type != OBJ_STREAM) {
-        errno = ENOTSUP;
-        return -1;
-    } else if (!(key->mode & REDISMODULE_WRITE)) {
-        errno = EBADF;
-        return -1;
-    }
-    int approx = flags & REDISMODULE_STREAM_TRIM_APPROX ? 1 : 0;
-    streamID minid = (streamID){id->ms, id->seq};
-    return streamTrimByID((stream *)key->value->ptr, minid, approx);
-}
-
-/* --------------------------------------------------------------------------
- * ## Calling Redis commands from modules
- *
- * RM_Call() sends a command to Redis. The remaining functions handle the reply.
- * -------------------------------------------------------------------------- */
-
-/* Create a new RedisModuleCallReply object. The processing of the reply
- * is lazy, the object is just populated with the raw protocol and later
- * is processed as needed. Initially we just make sure to set the right
- * reply type, which is extremely cheap to do. */
-RedisModuleCallReply *moduleCreateCallReplyFromProto(RedisModuleCtx *ctx, sds proto) {
-    RedisModuleCallReply *reply = zmalloc(sizeof(*reply));
-    reply->ctx = ctx;
-    reply->proto = proto;
-    reply->protolen = sdslen(proto);
-    reply->flags = REDISMODULE_REPLYFLAG_TOPARSE; /* Lazy parsing. */
-    switch(proto[0]) {
-    case '$':
-    case '+': reply->type = REDISMODULE_REPLY_STRING; break;
-    case '-': reply->type = REDISMODULE_REPLY_ERROR; break;
-    case ':': reply->type = REDISMODULE_REPLY_INTEGER; break;
-    case '*': reply->type = REDISMODULE_REPLY_ARRAY; break;
-    default: reply->type = REDISMODULE_REPLY_UNKNOWN; break;
-    }
-    if ((proto[0] == '*' || proto[0] == '$') && proto[1] == '-')
-        reply->type = REDISMODULE_REPLY_NULL;
-    return reply;
-}
-
-void moduleParseCallReply_Int(RedisModuleCallReply *reply);
-void moduleParseCallReply_BulkString(RedisModuleCallReply *reply);
-void moduleParseCallReply_SimpleString(RedisModuleCallReply *reply);
-void moduleParseCallReply_Array(RedisModuleCallReply *reply);
-
-/* Do nothing if REDISMODULE_REPLYFLAG_TOPARSE is false, otherwise
- * use the protocol of the reply in reply->proto in order to fill the
- * reply with parsed data according to the reply type. */
-void moduleParseCallReply(RedisModuleCallReply *reply) {
-    if (!(reply->flags & REDISMODULE_REPLYFLAG_TOPARSE)) return;
-    reply->flags &= ~REDISMODULE_REPLYFLAG_TOPARSE;
-
-    switch(reply->proto[0]) {
-    case ':': moduleParseCallReply_Int(reply); break;
-    case '$': moduleParseCallReply_BulkString(reply); break;
-    case '-': /* handled by next item. */
-    case '+': moduleParseCallReply_SimpleString(reply); break;
-    case '*': moduleParseCallReply_Array(reply); break;
-    }
-}
-
-void moduleParseCallReply_Int(RedisModuleCallReply *reply) {
-    char *proto = reply->proto;
-    char *p = strchr(proto+1,'\r');
-
-    string2ll(proto+1,p-proto-1,&reply->val.ll);
-    reply->protolen = p-proto+2;
-    reply->type = REDISMODULE_REPLY_INTEGER;
-}
-
-void moduleParseCallReply_BulkString(RedisModuleCallReply *reply) {
-    char *proto = reply->proto;
-    char *p = strchr(proto+1,'\r');
-    long long bulklen;
-
-    string2ll(proto+1,p-proto-1,&bulklen);
-    if (bulklen == -1) {
-        reply->protolen = p-proto+2;
-        reply->type = REDISMODULE_REPLY_NULL;
-    } else {
-        reply->val.str = p+2;
-        reply->len = bulklen;
-        reply->protolen = p-proto+2+bulklen+2;
-        reply->type = REDISMODULE_REPLY_STRING;
-    }
-}
-
-void moduleParseCallReply_SimpleString(RedisModuleCallReply *reply) {
-    char *proto = reply->proto;
-    char *p = strchr(proto+1,'\r');
-
-    reply->val.str = proto+1;
-    reply->len = p-proto-1;
-    reply->protolen = p-proto+2;
-    reply->type = proto[0] == '+' ? REDISMODULE_REPLY_STRING :
-                                    REDISMODULE_REPLY_ERROR;
-}
-
-void moduleParseCallReply_Array(RedisModuleCallReply *reply) {
-    char *proto = reply->proto;
-    char *p = strchr(proto+1,'\r');
-    long long arraylen, j;
-
-    string2ll(proto+1,p-proto-1,&arraylen);
-    p += 2;
-
-    if (arraylen == -1) {
-        reply->protolen = p-proto;
-        reply->type = REDISMODULE_REPLY_NULL;
-        return;
-    }
-
-    reply->val.array = zmalloc(sizeof(RedisModuleCallReply)*arraylen);
-    reply->len = arraylen;
-    for (j = 0; j < arraylen; j++) {
-        RedisModuleCallReply *ele = reply->val.array+j;
-        ele->flags = REDISMODULE_REPLYFLAG_NESTED |
-                     REDISMODULE_REPLYFLAG_TOPARSE;
-        ele->proto = p;
-        ele->ctx = reply->ctx;
-        moduleParseCallReply(ele);
-        p += ele->protolen;
-    }
-    reply->protolen = p-proto;
-    reply->type = REDISMODULE_REPLY_ARRAY;
-}
-
-/* Recursive free reply function. */
-void moduleFreeCallReplyRec(RedisModuleCallReply *reply, int freenested){
-    /* Don't free nested replies by default: the user must always free the
-     * toplevel reply. However be gentle and don't crash if the module
-     * misuses the API. */
-    if (!freenested && reply->flags & REDISMODULE_REPLYFLAG_NESTED) return;
-
-    if (!(reply->flags & REDISMODULE_REPLYFLAG_TOPARSE)) {
-        if (reply->type == REDISMODULE_REPLY_ARRAY) {
-            size_t j;
-            for (j = 0; j < reply->len; j++)
-                moduleFreeCallReplyRec(reply->val.array+j,1);
-            zfree(reply->val.array);
-        }
-    }
-
-    /* For nested replies, we don't free reply->proto (which if not NULL
-     * references the parent reply->proto buffer), nor the structure
-     * itself which is allocated as an array of structures, and is freed
-     * when the array value is released. */
-    if (!(reply->flags & REDISMODULE_REPLYFLAG_NESTED)) {
-        if (reply->proto) sdsfree(reply->proto);
-        zfree(reply);
-    }
-}
-
-/* Free a Call reply and all the nested replies it contains if it's an
- * array. */
-void RM_FreeCallReply(RedisModuleCallReply *reply) {
-    /* This is a wrapper for the recursive free reply function. This is needed
-     * in order to have the first level function to return on nested replies,
-     * but only if called by the module API. */
-    RedisModuleCtx *ctx = reply->ctx;
-    moduleFreeCallReplyRec(reply,0);
-    autoMemoryFreed(ctx,REDISMODULE_AM_REPLY,reply);
-}
-
-/* Return the reply type. */
-int RM_CallReplyType(RedisModuleCallReply *reply) {
-    if (!reply) return REDISMODULE_REPLY_UNKNOWN;
-    return reply->type;
-}
-
-/* Return the reply type length, where applicable. */
-size_t RM_CallReplyLength(RedisModuleCallReply *reply) {
-    moduleParseCallReply(reply);
-    switch(reply->type) {
-    case REDISMODULE_REPLY_STRING:
-    case REDISMODULE_REPLY_ERROR:
-    case REDISMODULE_REPLY_ARRAY:
-        return reply->len;
-    default:
-        return 0;
-    }
-}
-
-/* Return the 'idx'-th nested call reply element of an array reply, or NULL
- * if the reply type is wrong or the index is out of range. */
-RedisModuleCallReply *RM_CallReplyArrayElement(RedisModuleCallReply *reply, size_t idx) {
-    moduleParseCallReply(reply);
-    if (reply->type != REDISMODULE_REPLY_ARRAY) return NULL;
-    if (idx >= reply->len) return NULL;
-    return reply->val.array+idx;
-}
-
-/* Return the long long of an integer reply. */
-long long RM_CallReplyInteger(RedisModuleCallReply *reply) {
-    moduleParseCallReply(reply);
-    if (reply->type != REDISMODULE_REPLY_INTEGER) return LLONG_MIN;
-    return reply->val.ll;
-}
-
-/* Return the pointer and length of a string or error reply. */
-const char *RM_CallReplyStringPtr(RedisModuleCallReply *reply, size_t *len) {
-    moduleParseCallReply(reply);
-    if (reply->type != REDISMODULE_REPLY_STRING &&
-        reply->type != REDISMODULE_REPLY_ERROR) return NULL;
-    if (len) *len = reply->len;
-    return reply->val.str;
-}
-
-/* Return a new string object from a call reply of type string, error or
- * integer. Otherwise (wrong reply type) return NULL. */
-RedisModuleString *RM_CreateStringFromCallReply(RedisModuleCallReply *reply) {
-    moduleParseCallReply(reply);
-    switch(reply->type) {
-    case REDISMODULE_REPLY_STRING:
-    case REDISMODULE_REPLY_ERROR:
-        return RM_CreateString(reply->ctx,reply->val.str,reply->len);
-    case REDISMODULE_REPLY_INTEGER: {
-        char buf[64];
-        int len = ll2string(buf,sizeof(buf),reply->val.ll);
-        return RM_CreateString(reply->ctx,buf,len);
-        }
-    default: return NULL;
-    }
-}
-
-/* Returns an array of robj pointers, and populates *argc with the number
- * of items, by parsing the format specifier "fmt" as described for
- * the RM_Call(), RM_Replicate() and other module APIs.
- *
- * The integer pointed by 'flags' is populated with flags according
- * to special modifiers in "fmt". For now only one exists:
- *
- *     "!" -> REDISMODULE_ARGV_REPLICATE
- *     "A" -> REDISMODULE_ARGV_NO_AOF
- *     "R" -> REDISMODULE_ARGV_NO_REPLICAS
- *
- * On error (format specifier error) NULL is returned and nothing is
- * allocated. On success the argument vector is returned. */
-robj **moduleCreateArgvFromUserFormat(const char *cmdname, const char *fmt, int *argcp, int *flags, va_list ap) {
-    int argc = 0, argv_size, j;
-    robj **argv = NULL;
-
-    /* As a first guess to avoid useless reallocations, size argv to
-     * hold one argument for each char specifier in 'fmt'. */
-    argv_size = strlen(fmt)+1; /* +1 because of the command name. */
-    argv = zrealloc(argv,sizeof(robj*)*argv_size);
-
-    /* Build the arguments vector based on the format specifier. */
-    argv[0] = createStringObject(cmdname,strlen(cmdname));
-    argc++;
-
-    /* Create the client and dispatch the command. */
-    const char *p = fmt;
-    while(*p) {
-        if (*p == 'c') {
-            char *cstr = va_arg(ap,char*);
-            argv[argc++] = createStringObject(cstr,strlen(cstr));
-        } else if (*p == 's') {
-            robj *obj = va_arg(ap,void*);
-            if (obj->refcount == OBJ_STATIC_REFCOUNT)
-                obj = createStringObject(obj->ptr,sdslen(obj->ptr));
-            else
-                incrRefCount(obj);
-            argv[argc++] = obj;
-        } else if (*p == 'b') {
-            char *buf = va_arg(ap,char*);
-            size_t len = va_arg(ap,size_t);
-            argv[argc++] = createStringObject(buf,len);
-        } else if (*p == 'l') {
-            long long ll = va_arg(ap,long long);
-            argv[argc++] = createObject(OBJ_STRING,sdsfromlonglong(ll));
-        } else if (*p == 'v') {
-             /* A vector of strings */
-             robj **v = va_arg(ap, void*);
-             size_t vlen = va_arg(ap, size_t);
-
-             /* We need to grow argv to hold the vector's elements.
-              * We resize by vector_len-1 elements, because we held
-              * one element in argv for the vector already */
-             argv_size += vlen-1;
-             argv = zrealloc(argv,sizeof(robj*)*argv_size);
-
-             size_t i = 0;
-             for (i = 0; i < vlen; i++) {
-                 incrRefCount(v[i]);
-                 argv[argc++] = v[i];
-             }
-        } else if (*p == '!') {
-            if (flags) (*flags) |= REDISMODULE_ARGV_REPLICATE;
-        } else if (*p == 'A') {
-            if (flags) (*flags) |= REDISMODULE_ARGV_NO_AOF;
-        } else if (*p == 'R') {
-            if (flags) (*flags) |= REDISMODULE_ARGV_NO_REPLICAS;
-        } else {
-            goto fmterr;
-        }
-        p++;
-    }
-    *argcp = argc;
-    return argv;
-
-fmterr:
-    for (j = 0; j < argc; j++)
-        decrRefCount(argv[j]);
-    zfree(argv);
-    return NULL;
-}
-
-/* Exported API to call any Redis command from modules.
- *
- * * **cmdname**: The Redis command to call.
- * * **fmt**: A format specifier string for the command's arguments. Each
- *   of the arguments should be specified by a valid type specification. The
- *   format specifier can also contain the modifiers `!`, `A` and `R` which
- *   don't have a corresponding argument.
- *
- *     * `b` -- The argument is a buffer and is immediately followed by another
- *              argument that is the buffer's length.
- *     * `c` -- The argument is a pointer to a plain C string (null-terminated).
- *     * `l` -- The argument is long long integer.
- *     * `s` -- The argument is a RedisModuleString.
- *     * `v` -- The argument(s) is a vector of RedisModuleString.
- *     * `!` -- Sends the Redis command and its arguments to replicas and AOF.
- *     * `A` -- Suppress AOF propagation, send only to replicas (requires `!`).
- *     * `R` -- Suppress replicas propagation, send only to AOF (requires `!`).
- * * **...**: The actual arguments to the Redis command.
- *
- * On success a RedisModuleCallReply object is returned, otherwise
- * NULL is returned and errno is set to the following values:
- *
- * * EBADF: wrong format specifier.
- * * EINVAL: wrong command arity.
- * * ENOENT: command does not exist.
- * * EPERM: operation in Cluster instance with key in non local slot.
- * * EROFS: operation in Cluster instance when a write command is sent
- *          in a readonly state.
- * * ENETDOWN: operation in Cluster instance when cluster is down.
- *
- * Example code fragment:
- * 
- *      reply = RedisModule_Call(ctx,"INCRBY","sc",argv[1],"10");
- *      if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_INTEGER) {
- *        long long myval = RedisModule_CallReplyInteger(reply);
- *        // Do something with myval.
- *      }
- *
- * This API is documented here: https://redis.io/topics/modules-intro
- */
-RedisModuleCallReply *RM_Call(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) {
-    struct redisCommand *cmd;
-    client *c = NULL;
-    robj **argv = NULL;
-    int argc = 0, flags = 0;
-    va_list ap;
-    RedisModuleCallReply *reply = NULL;
-    int replicate = 0; /* Replicate this command? */
-
-    /* Handle arguments. */
-    va_start(ap, fmt);
-    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
-    replicate = flags & REDISMODULE_ARGV_REPLICATE;
-    va_end(ap);
-
-    /* Setup our fake client for command execution. */
-    if (server.module_client == NULL) {
-        /* This is the first RM_Call() ever. Create reusable client. */
-        c = server.module_client = createClient(NULL);
-    } else if (server.module_client->argv == NULL) {
-        /* The reusable module client is not busy with a command. Use it. */
-        c = server.module_client;
-    } else {
-        /* The reusable module client is busy. (It is probably used in a
-         * recursive call to this module.) */
-        c = createClient(NULL);
-    }
-    c->user = NULL; /* Root user. */
-    c->flags = CLIENT_MODULE;
-
-    /* We do not want to allow block, the module do not expect it */
-    c->flags |= CLIENT_DENY_BLOCKING;
-    c->db = ctx->client->db;
-    c->argv = argv;
-    c->argc = argc;
-    if (ctx->module) ctx->module->in_call++;
-
-    /* We handle the above format error only when the client is setup so that
-     * we can free it normally. */
-    if (argv == NULL) {
-        errno = EBADF;
-        goto cleanup;
-    }
-
-    /* Call command filters */
-    moduleCallCommandFilters(c);
-
-    /* Lookup command now, after filters had a chance to make modifications
-     * if necessary.
-     */
-    cmd = lookupCommand(c->argv[0]->ptr);
-    if (!cmd) {
-        errno = ENOENT;
-        goto cleanup;
-    }
-    c->cmd = c->lastcmd = cmd;
-
-    /* Basic arity checks. */
-    if ((cmd->arity > 0 && cmd->arity != argc) || (argc < -cmd->arity)) {
-        errno = EINVAL;
-        goto cleanup;
-    }
-
-    /* If this is a Redis Cluster node, we need to make sure the module is not
-     * trying to access non-local keys, with the exception of commands
-     * received from our master. */
-    if (server.cluster_enabled && !(ctx->client->flags & CLIENT_MASTER)) {
-        int error_code;
-        /* Duplicate relevant flags in the module client. */
-        c->flags &= ~(CLIENT_READONLY|CLIENT_ASKING);
-        c->flags |= ctx->client->flags & (CLIENT_READONLY|CLIENT_ASKING);
-        if (getNodeByQuery(c,c->cmd,c->argv,c->argc,NULL,&error_code) !=
-                           server.cluster->myself)
-        {
-            if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) { 
-                errno = EROFS;
-            } else if (error_code == CLUSTER_REDIR_DOWN_STATE) { 
-                errno = ENETDOWN;
-            } else {
-                errno = EPERM;
-            }
-            goto cleanup;
-        }
-    }
-
-    /* We need to use a global replication_allowed flag in order to prevent
-     * replication of nested RM_Calls. Example:
-     * 1. module1.foo does RM_Call of module2.bar without replication (i.e. no '!')
-     * 2. module2.bar internally calls RM_Call of INCR with '!'
-     * 3. at the end of module1.foo we call RM_ReplicateVerbatim
-     * We want the replica/AOF to see only module1.foo and not the INCR from module2.bar */
-    int prev_replication_allowed = server.replication_allowed;
-    server.replication_allowed = replicate && server.replication_allowed;
-
-    /* Run the command */
-    int call_flags = CMD_CALL_SLOWLOG | CMD_CALL_STATS | CMD_CALL_NOWRAP;
-    if (replicate) {
-        /* If we are using single commands replication, we need to wrap what
-         * we propagate into a MULTI/EXEC block, so that it will be atomic like
-         * a Lua script in the context of AOF and slaves. */
-        moduleReplicateMultiIfNeeded(ctx);
-
-        if (!(flags & REDISMODULE_ARGV_NO_AOF))
-            call_flags |= CMD_CALL_PROPAGATE_AOF;
-        if (!(flags & REDISMODULE_ARGV_NO_REPLICAS))
-            call_flags |= CMD_CALL_PROPAGATE_REPL;
-    }
-    call(c,call_flags);
-    server.replication_allowed = prev_replication_allowed;
-
-    serverAssert((c->flags & CLIENT_BLOCKED) == 0);
-
-    /* Convert the result of the Redis command into a module reply. */
-    sds proto = sdsnewlen(c->buf,c->bufpos);
-    c->bufpos = 0;
-    while(listLength(c->reply)) {
-        clientReplyBlock *o = listNodeValue(listFirst(c->reply));
-
-        proto = sdscatlen(proto,o->buf,o->used);
-        listDelNode(c->reply,listFirst(c->reply));
-    }
-    reply = moduleCreateCallReplyFromProto(ctx,proto);
-    autoMemoryAdd(ctx,REDISMODULE_AM_REPLY,reply);
-
-cleanup:
-    if (ctx->module) ctx->module->in_call--;
-    if (c == server.module_client) {
-        /* reset shared client so it can be reused */
-        discardTransaction(c);
-        pubsubUnsubscribeAllChannels(c,0);
-        pubsubUnsubscribeAllPatterns(c,0);
-        resetClient(c); /* frees the contents of argv */
-        zfree(c->argv);
-        c->argv = NULL;
-        c->resp = 2;
-    } else {
-        freeClient(c); /* temporary client */
-    }
-    return reply;
-}
-
-/* Return a pointer, and a length, to the protocol returned by the command
- * that returned the reply object. */
-const char *RM_CallReplyProto(RedisModuleCallReply *reply, size_t *len) {
-    if (reply->proto) *len = sdslen(reply->proto);
-    return reply->proto;
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules data types
- *
- * When String DMA or using existing data structures is not enough, it is
- * possible to create new data types from scratch and export them to
- * Redis. The module must provide a set of callbacks for handling the
- * new values exported (for example in order to provide RDB saving/loading,
- * AOF rewrite, and so forth). In this section we define this API.
- * -------------------------------------------------------------------------- */
-
-/* Turn a 9 chars name in the specified charset and a 10 bit encver into
- * a single 64 bit unsigned integer that represents this exact module name
- * and version. This final number is called a "type ID" and is used when
- * writing module exported values to RDB files, in order to re-associate the
- * value to the right module to load them during RDB loading.
- *
- * If the string is not of the right length or the charset is wrong, or
- * if encver is outside the unsigned 10 bit integer range, 0 is returned,
- * otherwise the function returns the right type ID.
- *
- * The resulting 64 bit integer is composed as follows:
- *
- *     (high order bits) 6|6|6|6|6|6|6|6|6|10 (low order bits)
- *
- * The first 6 bits value is the first character, name[0], while the last
- * 6 bits value, immediately before the 10 bits integer, is name[8].
- * The last 10 bits are the encoding version.
- *
- * Note that a name and encver combo of "AAAAAAAAA" and 0, will produce
- * zero as return value, that is the same we use to signal errors, thus
- * this combination is invalid, and also useless since type names should
- * try to be vary to avoid collisions. */
-
-const char *ModuleTypeNameCharSet =
-             "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
-             "abcdefghijklmnopqrstuvwxyz"
-             "0123456789-_";
-
-uint64_t moduleTypeEncodeId(const char *name, int encver) {
-    /* We use 64 symbols so that we can map each character into 6 bits
-     * of the final output. */
-    const char *cset = ModuleTypeNameCharSet;
-    if (strlen(name) != 9) return 0;
-    if (encver < 0 || encver > 1023) return 0;
-
-    uint64_t id = 0;
-    for (int j = 0; j < 9; j++) {
-        char *p = strchr(cset,name[j]);
-        if (!p) return 0;
-        unsigned long pos = p-cset;
-        id = (id << 6) | pos;
-    }
-    id = (id << 10) | encver;
-    return id;
-}
-
-/* Search, in the list of exported data types of all the modules registered,
- * a type with the same name as the one given. Returns the moduleType
- * structure pointer if such a module is found, or NULL otherwise. */
-moduleType *moduleTypeLookupModuleByName(const char *name) {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        listIter li;
-        listNode *ln;
-
-        listRewind(module->types,&li);
-        while((ln = listNext(&li))) {
-            moduleType *mt = ln->value;
-            if (memcmp(name,mt->name,sizeof(mt->name)) == 0) {
-                dictReleaseIterator(di);
-                return mt;
-            }
-        }
-    }
-    dictReleaseIterator(di);
-    return NULL;
-}
-
-/* Lookup a module by ID, with caching. This function is used during RDB
- * loading. Modules exporting data types should never be able to unload, so
- * our cache does not need to expire. */
-#define MODULE_LOOKUP_CACHE_SIZE 3
-
-moduleType *moduleTypeLookupModuleByID(uint64_t id) {
-    static struct {
-        uint64_t id;
-        moduleType *mt;
-    } cache[MODULE_LOOKUP_CACHE_SIZE];
-
-    /* Search in cache to start. */
-    int j;
-    for (j = 0; j < MODULE_LOOKUP_CACHE_SIZE && cache[j].mt != NULL; j++)
-        if (cache[j].id == id) return cache[j].mt;
-
-    /* Slow module by module lookup. */
-    moduleType *mt = NULL;
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL && mt == NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        listIter li;
-        listNode *ln;
-
-        listRewind(module->types,&li);
-        while((ln = listNext(&li))) {
-            moduleType *this_mt = ln->value;
-            /* Compare only the 54 bit module identifier and not the
-             * encoding version. */
-            if (this_mt->id >> 10 == id >> 10) {
-                mt = this_mt;
-                break;
-            }
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Add to cache if possible. */
-    if (mt && j < MODULE_LOOKUP_CACHE_SIZE) {
-        cache[j].id = id;
-        cache[j].mt = mt;
-    }
-    return mt;
-}
-
-/* Turn an (unresolved) module ID into a type name, to show the user an
- * error when RDB files contain module data we can't load.
- * The buffer pointed by 'name' must be 10 bytes at least. The function will
- * fill it with a null terminated module name. */
-void moduleTypeNameByID(char *name, uint64_t moduleid) {
-    const char *cset = ModuleTypeNameCharSet;
-
-    name[9] = '\0';
-    char *p = name+8;
-    moduleid >>= 10;
-    for (int j = 0; j < 9; j++) {
-        *p-- = cset[moduleid & 63];
-        moduleid >>= 6;
-    }
-}
-
-/* Return the name of the module that owns the specified moduleType. */
-const char *moduleTypeModuleName(moduleType *mt) {
-    if (!mt || !mt->module) return NULL;
-    return mt->module->name;
-}
-
-/* Create a copy of a module type value using the copy callback. If failed
- * or not supported, produce an error reply and return NULL.
- */
-robj *moduleTypeDupOrReply(client *c, robj *fromkey, robj *tokey, robj *value) {
-    moduleValue *mv = value->ptr;
-    moduleType *mt = mv->type;
-    if (!mt->copy) {
-        addReplyError(c, "not supported for this module key");
-        return NULL;
-    }
-    void *newval = mt->copy(fromkey, tokey, mv->value);
-    if (!newval) {
-        addReplyError(c, "module key failed to copy");
-        return NULL;
-    }
-    return createModuleObject(mt, newval);
-}
-
-/* Register a new data type exported by the module. The parameters are the
- * following. Please for in depth documentation check the modules API
- * documentation, especially https://redis.io/topics/modules-native-types.
- *
- * * **name**: A 9 characters data type name that MUST be unique in the Redis
- *   Modules ecosystem. Be creative... and there will be no collisions. Use
- *   the charset A-Z a-z 9-0, plus the two "-_" characters. A good
- *   idea is to use, for example `<typename>-<vendor>`. For example
- *   "tree-AntZ" may mean "Tree data structure by @antirez". To use both
- *   lower case and upper case letters helps in order to prevent collisions.
- * * **encver**: Encoding version, which is, the version of the serialization
- *   that a module used in order to persist data. As long as the "name"
- *   matches, the RDB loading will be dispatched to the type callbacks
- *   whatever 'encver' is used, however the module can understand if
- *   the encoding it must load are of an older version of the module.
- *   For example the module "tree-AntZ" initially used encver=0. Later
- *   after an upgrade, it started to serialize data in a different format
- *   and to register the type with encver=1. However this module may
- *   still load old data produced by an older version if the rdb_load
- *   callback is able to check the encver value and act accordingly.
- *   The encver must be a positive value between 0 and 1023.
- *
- * * **typemethods_ptr** is a pointer to a RedisModuleTypeMethods structure
- *   that should be populated with the methods callbacks and structure
- *   version, like in the following example:
- *
- *         RedisModuleTypeMethods tm = {
- *             .version = REDISMODULE_TYPE_METHOD_VERSION,
- *             .rdb_load = myType_RDBLoadCallBack,
- *             .rdb_save = myType_RDBSaveCallBack,
- *             .aof_rewrite = myType_AOFRewriteCallBack,
- *             .free = myType_FreeCallBack,
- *
- *             // Optional fields
- *             .digest = myType_DigestCallBack,
- *             .mem_usage = myType_MemUsageCallBack,
- *             .aux_load = myType_AuxRDBLoadCallBack,
- *             .aux_save = myType_AuxRDBSaveCallBack,
- *             .free_effort = myType_FreeEffortCallBack,
- *             .unlink = myType_UnlinkCallBack,
- *             .copy = myType_CopyCallback,
- *             .defrag = myType_DefragCallback
- *         }
- *
- * * **rdb_load**: A callback function pointer that loads data from RDB files.
- * * **rdb_save**: A callback function pointer that saves data to RDB files.
- * * **aof_rewrite**: A callback function pointer that rewrites data as commands.
- * * **digest**: A callback function pointer that is used for `DEBUG DIGEST`.
- * * **free**: A callback function pointer that can free a type value.
- * * **aux_save**: A callback function pointer that saves out of keyspace data to RDB files.
- *   'when' argument is either REDISMODULE_AUX_BEFORE_RDB or REDISMODULE_AUX_AFTER_RDB.
- * * **aux_load**: A callback function pointer that loads out of keyspace data from RDB files.
- *   Similar to aux_save, returns REDISMODULE_OK on success, and ERR otherwise.
- * * **free_effort**: A callback function pointer that used to determine whether the module's
- *   memory needs to be lazy reclaimed. The module should return the complexity involved by
- *   freeing the value. for example: how many pointers are gonna be freed. Note that if it 
- *   returns 0, we'll always do an async free.
- * * **unlink**: A callback function pointer that used to notifies the module that the key has 
- *   been removed from the DB by redis, and may soon be freed by a background thread. Note that 
- *   it won't be called on FLUSHALL/FLUSHDB (both sync and async), and the module can use the 
- *   RedisModuleEvent_FlushDB to hook into that.
- * * **copy**: A callback function pointer that is used to make a copy of the specified key.
- *   The module is expected to perform a deep copy of the specified value and return it.
- *   In addition, hints about the names of the source and destination keys is provided.
- *   A NULL return value is considered an error and the copy operation fails.
- *   Note: if the target key exists and is being overwritten, the copy callback will be
- *   called first, followed by a free callback to the value that is being replaced.
- * 
- * * **defrag**: A callback function pointer that is used to request the module to defrag
- *   a key. The module should then iterate pointers and call the relevant RM_Defrag*()
- *   functions to defragment pointers or complex types. The module should continue
- *   iterating as long as RM_DefragShouldStop() returns a zero value, and return a
- *   zero value if finished or non-zero value if more work is left to be done. If more work
- *   needs to be done, RM_DefragCursorSet() and RM_DefragCursorGet() can be used to track
- *   this work across different calls.
- *   Normally, the defrag mechanism invokes the callback without a time limit, so
- *   RM_DefragShouldStop() always returns zero. The "late defrag" mechanism which has
- *   a time limit and provides cursor support is used only for keys that are determined
- *   to have significant internal complexity. To determine this, the defrag mechanism
- *   uses the free_effort callback and the 'active-defrag-max-scan-fields' config directive.
- *   NOTE: The value is passed as a `void**` and the function is expected to update the
- *   pointer if the top-level value pointer is defragmented and consequentially changes.
- *
- * Note: the module name "AAAAAAAAA" is reserved and produces an error, it
- * happens to be pretty lame as well.
- *
- * If there is already a module registering a type with the same name,
- * and if the module name or encver is invalid, NULL is returned.
- * Otherwise the new type is registered into Redis, and a reference of
- * type RedisModuleType is returned: the caller of the function should store
- * this reference into a global variable to make future use of it in the
- * modules type API, since a single module may register multiple types.
- * Example code fragment:
- *
- *      static RedisModuleType *BalancedTreeType;
- *
- *      int RedisModule_OnLoad(RedisModuleCtx *ctx) {
- *          // some code here ...
- *          BalancedTreeType = RM_CreateDataType(...);
- *      }
- */
-moduleType *RM_CreateDataType(RedisModuleCtx *ctx, const char *name, int encver, void *typemethods_ptr) {
-    uint64_t id = moduleTypeEncodeId(name,encver);
-    if (id == 0) return NULL;
-    if (moduleTypeLookupModuleByName(name) != NULL) return NULL;
-
-    long typemethods_version = ((long*)typemethods_ptr)[0];
-    if (typemethods_version == 0) return NULL;
-
-    struct typemethods {
-        uint64_t version;
-        moduleTypeLoadFunc rdb_load;
-        moduleTypeSaveFunc rdb_save;
-        moduleTypeRewriteFunc aof_rewrite;
-        moduleTypeMemUsageFunc mem_usage;
-        moduleTypeDigestFunc digest;
-        moduleTypeFreeFunc free;
-        struct {
-            moduleTypeAuxLoadFunc aux_load;
-            moduleTypeAuxSaveFunc aux_save;
-            int aux_save_triggers;
-        } v2;
-        struct {
-            moduleTypeFreeEffortFunc free_effort;
-            moduleTypeUnlinkFunc unlink;
-            moduleTypeCopyFunc copy;
-            moduleTypeDefragFunc defrag;
-        } v3;
-    } *tms = (struct typemethods*) typemethods_ptr;
-
-    moduleType *mt = zcalloc(sizeof(*mt));
-    mt->id = id;
-    mt->module = ctx->module;
-    mt->rdb_load = tms->rdb_load;
-    mt->rdb_save = tms->rdb_save;
-    mt->aof_rewrite = tms->aof_rewrite;
-    mt->mem_usage = tms->mem_usage;
-    mt->digest = tms->digest;
-    mt->free = tms->free;
-    if (tms->version >= 2) {
-        mt->aux_load = tms->v2.aux_load;
-        mt->aux_save = tms->v2.aux_save;
-        mt->aux_save_triggers = tms->v2.aux_save_triggers;
-    }
-    if (tms->version >= 3) {
-        mt->free_effort = tms->v3.free_effort;
-        mt->unlink = tms->v3.unlink;
-        mt->copy = tms->v3.copy;
-        mt->defrag = tms->v3.defrag;
-    }
-    memcpy(mt->name,name,sizeof(mt->name));
-    listAddNodeTail(ctx->module->types,mt);
-    return mt;
-}
-
-/* If the key is open for writing, set the specified module type object
- * as the value of the key, deleting the old value if any.
- * On success REDISMODULE_OK is returned. If the key is not open for
- * writing or there is an active iterator, REDISMODULE_ERR is returned. */
-int RM_ModuleTypeSetValue(RedisModuleKey *key, moduleType *mt, void *value) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->iter) return REDISMODULE_ERR;
-    RM_DeleteKey(key);
-    robj *o = createModuleObject(mt,value);
-    genericSetKey(key->ctx->client,key->db,key->key,o,0,0);
-    decrRefCount(o);
-    key->value = o;
-    return REDISMODULE_OK;
-}
-
-/* Assuming RedisModule_KeyType() returned REDISMODULE_KEYTYPE_MODULE on
- * the key, returns the module type pointer of the value stored at key.
- *
- * If the key is NULL, is not associated with a module type, or is empty,
- * then NULL is returned instead. */
-moduleType *RM_ModuleTypeGetType(RedisModuleKey *key) {
-    if (key == NULL ||
-        key->value == NULL ||
-        RM_KeyType(key) != REDISMODULE_KEYTYPE_MODULE) return NULL;
-    moduleValue *mv = key->value->ptr;
-    return mv->type;
-}
-
-/* Assuming RedisModule_KeyType() returned REDISMODULE_KEYTYPE_MODULE on
- * the key, returns the module type low-level value stored at key, as
- * it was set by the user via RedisModule_ModuleTypeSetValue().
- *
- * If the key is NULL, is not associated with a module type, or is empty,
- * then NULL is returned instead. */
-void *RM_ModuleTypeGetValue(RedisModuleKey *key) {
-    if (key == NULL ||
-        key->value == NULL ||
-        RM_KeyType(key) != REDISMODULE_KEYTYPE_MODULE) return NULL;
-    moduleValue *mv = key->value->ptr;
-    return mv->value;
-}
-
-/* --------------------------------------------------------------------------
- * ## RDB loading and saving functions
- * -------------------------------------------------------------------------- */
-
-/* Called when there is a load error in the context of a module. On some
- * modules this cannot be recovered, but if the module declared capability
- * to handle errors, we'll raise a flag rather than exiting. */
-void moduleRDBLoadError(RedisModuleIO *io) {
-    if (io->type->module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS) {
-        io->error = 1;
-        return;
-    }
-    serverPanic(
-        "Error loading data from RDB (short read or EOF). "
-        "Read performed by module '%s' about type '%s' "
-        "after reading '%llu' bytes of a value "
-        "for key named: '%s'.",
-        io->type->module->name,
-        io->type->name,
-        (unsigned long long)io->bytes,
-        io->key? (char*)io->key->ptr: "(null)");
-}
-
-/* Returns 0 if there's at least one registered data type that did not declare
- * REDISMODULE_OPTIONS_HANDLE_IO_ERRORS, in which case diskless loading should
- * be avoided since it could cause data loss. */
-int moduleAllDatatypesHandleErrors() {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        if (listLength(module->types) &&
-            !(module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS))
-        {
-            dictReleaseIterator(di);
-            return 0;
-        }
-    }
-    dictReleaseIterator(di);
-    return 1;
-}
-
-/* Returns true if any previous IO API failed.
- * for `Load*` APIs the REDISMODULE_OPTIONS_HANDLE_IO_ERRORS flag must be set with
- * RedisModule_SetModuleOptions first. */
-int RM_IsIOError(RedisModuleIO *io) {
-    return io->error;
-}
-
-/* Save an unsigned 64 bit value into the RDB file. This function should only
- * be called in the context of the rdb_save method of modules implementing new
- * data types. */
-void RM_SaveUnsigned(RedisModuleIO *io, uint64_t value) {
-    if (io->error) return;
-    /* Save opcode. */
-    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_UINT);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    /* Save value. */
-    retval = rdbSaveLen(io->rio, value);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    return;
-
-saveerr:
-    io->error = 1;
-}
-
-/* Load an unsigned 64 bit value from the RDB file. This function should only
- * be called in the context of the `rdb_load` method of modules implementing
- * new data types. */
-uint64_t RM_LoadUnsigned(RedisModuleIO *io) {
-    if (io->error) return 0;
-    if (io->ver == 2) {
-        uint64_t opcode = rdbLoadLen(io->rio,NULL);
-        if (opcode != RDB_MODULE_OPCODE_UINT) goto loaderr;
-    }
-    uint64_t value;
-    int retval = rdbLoadLenByRef(io->rio, NULL, &value);
-    if (retval == -1) goto loaderr;
-    return value;
-
-loaderr:
-    moduleRDBLoadError(io);
-    return 0;
-}
-
-/* Like RedisModule_SaveUnsigned() but for signed 64 bit values. */
-void RM_SaveSigned(RedisModuleIO *io, int64_t value) {
-    union {uint64_t u; int64_t i;} conv;
-    conv.i = value;
-    RM_SaveUnsigned(io,conv.u);
-}
-
-/* Like RedisModule_LoadUnsigned() but for signed 64 bit values. */
-int64_t RM_LoadSigned(RedisModuleIO *io) {
-    union {uint64_t u; int64_t i;} conv;
-    conv.u = RM_LoadUnsigned(io);
-    return conv.i;
-}
-
-/* In the context of the rdb_save method of a module type, saves a
- * string into the RDB file taking as input a RedisModuleString.
- *
- * The string can be later loaded with RedisModule_LoadString() or
- * other Load family functions expecting a serialized string inside
- * the RDB file. */
-void RM_SaveString(RedisModuleIO *io, RedisModuleString *s) {
-    if (io->error) return;
-    /* Save opcode. */
-    ssize_t retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_STRING);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    /* Save value. */
-    retval = rdbSaveStringObject(io->rio, s);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    return;
-
-saveerr:
-    io->error = 1;
-}
-
-/* Like RedisModule_SaveString() but takes a raw C pointer and length
- * as input. */
-void RM_SaveStringBuffer(RedisModuleIO *io, const char *str, size_t len) {
-    if (io->error) return;
-    /* Save opcode. */
-    ssize_t retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_STRING);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    /* Save value. */
-    retval = rdbSaveRawString(io->rio, (unsigned char*)str,len);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    return;
-
-saveerr:
-    io->error = 1;
-}
-
-/* Implements RM_LoadString() and RM_LoadStringBuffer() */
-void *moduleLoadString(RedisModuleIO *io, int plain, size_t *lenptr) {
-    if (io->error) return NULL;
-    if (io->ver == 2) {
-        uint64_t opcode = rdbLoadLen(io->rio,NULL);
-        if (opcode != RDB_MODULE_OPCODE_STRING) goto loaderr;
-    }
-    void *s = rdbGenericLoadStringObject(io->rio,
-              plain ? RDB_LOAD_PLAIN : RDB_LOAD_NONE, lenptr);
-    if (s == NULL) goto loaderr;
-    return s;
-
-loaderr:
-    moduleRDBLoadError(io);
-    return NULL;
-}
-
-/* In the context of the rdb_load method of a module data type, loads a string
- * from the RDB file, that was previously saved with RedisModule_SaveString()
- * functions family.
- *
- * The returned string is a newly allocated RedisModuleString object, and
- * the user should at some point free it with a call to RedisModule_FreeString().
- *
- * If the data structure does not store strings as RedisModuleString objects,
- * the similar function RedisModule_LoadStringBuffer() could be used instead. */
-RedisModuleString *RM_LoadString(RedisModuleIO *io) {
-    return moduleLoadString(io,0,NULL);
-}
-
-/* Like RedisModule_LoadString() but returns an heap allocated string that
- * was allocated with RedisModule_Alloc(), and can be resized or freed with
- * RedisModule_Realloc() or RedisModule_Free().
- *
- * The size of the string is stored at '*lenptr' if not NULL.
- * The returned string is not automatically NULL terminated, it is loaded
- * exactly as it was stored inside the RDB file. */
-char *RM_LoadStringBuffer(RedisModuleIO *io, size_t *lenptr) {
-    return moduleLoadString(io,1,lenptr);
-}
-
-/* In the context of the rdb_save method of a module data type, saves a double
- * value to the RDB file. The double can be a valid number, a NaN or infinity.
- * It is possible to load back the value with RedisModule_LoadDouble(). */
-void RM_SaveDouble(RedisModuleIO *io, double value) {
-    if (io->error) return;
-    /* Save opcode. */
-    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_DOUBLE);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    /* Save value. */
-    retval = rdbSaveBinaryDoubleValue(io->rio, value);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    return;
-
-saveerr:
-    io->error = 1;
-}
-
-/* In the context of the rdb_save method of a module data type, loads back the
- * double value saved by RedisModule_SaveDouble(). */
-double RM_LoadDouble(RedisModuleIO *io) {
-    if (io->error) return 0;
-    if (io->ver == 2) {
-        uint64_t opcode = rdbLoadLen(io->rio,NULL);
-        if (opcode != RDB_MODULE_OPCODE_DOUBLE) goto loaderr;
-    }
-    double value;
-    int retval = rdbLoadBinaryDoubleValue(io->rio, &value);
-    if (retval == -1) goto loaderr;
-    return value;
-
-loaderr:
-    moduleRDBLoadError(io);
-    return 0;
-}
-
-/* In the context of the rdb_save method of a module data type, saves a float
- * value to the RDB file. The float can be a valid number, a NaN or infinity.
- * It is possible to load back the value with RedisModule_LoadFloat(). */
-void RM_SaveFloat(RedisModuleIO *io, float value) {
-    if (io->error) return;
-    /* Save opcode. */
-    int retval = rdbSaveLen(io->rio, RDB_MODULE_OPCODE_FLOAT);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    /* Save value. */
-    retval = rdbSaveBinaryFloatValue(io->rio, value);
-    if (retval == -1) goto saveerr;
-    io->bytes += retval;
-    return;
-
-saveerr:
-    io->error = 1;
-}
-
-/* In the context of the rdb_save method of a module data type, loads back the
- * float value saved by RedisModule_SaveFloat(). */
-float RM_LoadFloat(RedisModuleIO *io) {
-    if (io->error) return 0;
-    if (io->ver == 2) {
-        uint64_t opcode = rdbLoadLen(io->rio,NULL);
-        if (opcode != RDB_MODULE_OPCODE_FLOAT) goto loaderr;
-    }
-    float value;
-    int retval = rdbLoadBinaryFloatValue(io->rio, &value);
-    if (retval == -1) goto loaderr;
-    return value;
-
-loaderr:
-    moduleRDBLoadError(io);
-    return 0;
-}
-
-/* In the context of the rdb_save method of a module data type, saves a long double
- * value to the RDB file. The double can be a valid number, a NaN or infinity.
- * It is possible to load back the value with RedisModule_LoadLongDouble(). */
-void RM_SaveLongDouble(RedisModuleIO *io, long double value) {
-    if (io->error) return;
-    char buf[MAX_LONG_DOUBLE_CHARS];
-    /* Long double has different number of bits in different platforms, so we
-     * save it as a string type. */
-    size_t len = ld2string(buf,sizeof(buf),value,LD_STR_HEX);
-    RM_SaveStringBuffer(io,buf,len);
-}
-
-/* In the context of the rdb_save method of a module data type, loads back the
- * long double value saved by RedisModule_SaveLongDouble(). */
-long double RM_LoadLongDouble(RedisModuleIO *io) {
-    if (io->error) return 0;
-    long double value;
-    size_t len;
-    char* str = RM_LoadStringBuffer(io,&len);
-    if (!str) return 0;
-    string2ld(str,len,&value);
-    RM_Free(str);
-    return value;
-}
-
-/* Iterate over modules, and trigger rdb aux saving for the ones modules types
- * who asked for it. */
-ssize_t rdbSaveModulesAux(rio *rdb, int when) {
-    size_t total_written = 0;
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        listIter li;
-        listNode *ln;
-
-        listRewind(module->types,&li);
-        while((ln = listNext(&li))) {
-            moduleType *mt = ln->value;
-            if (!mt->aux_save || !(mt->aux_save_triggers & when))
-                continue;
-            ssize_t ret = rdbSaveSingleModuleAux(rdb, when, mt);
-            if (ret==-1) {
-                dictReleaseIterator(di);
-                return -1;
-            }
-            total_written += ret;
-        }
-    }
-
-    dictReleaseIterator(di);
-    return total_written;
-}
-
-/* --------------------------------------------------------------------------
- * ## Key digest API (DEBUG DIGEST interface for modules types)
- * -------------------------------------------------------------------------- */
-
-/* Add a new element to the digest. This function can be called multiple times
- * one element after the other, for all the elements that constitute a given
- * data structure. The function call must be followed by the call to
- * `RedisModule_DigestEndSequence` eventually, when all the elements that are
- * always in a given order are added. See the Redis Modules data types
- * documentation for more info. However this is a quick example that uses Redis
- * data types as an example.
- *
- * To add a sequence of unordered elements (for example in the case of a Redis
- * Set), the pattern to use is:
- *
- *     foreach element {
- *         AddElement(element);
- *         EndSequence();
- *     }
- *
- * Because Sets are not ordered, so every element added has a position that
- * does not depend from the other. However if instead our elements are
- * ordered in pairs, like field-value pairs of an Hash, then one should
- * use:
- *
- *     foreach key,value {
- *         AddElement(key);
- *         AddElement(value);
- *         EndSquence();
- *     }
- *
- * Because the key and value will be always in the above order, while instead
- * the single key-value pairs, can appear in any position into a Redis hash.
- *
- * A list of ordered elements would be implemented with:
- *
- *     foreach element {
- *         AddElement(element);
- *     }
- *     EndSequence();
- *
- */
-void RM_DigestAddStringBuffer(RedisModuleDigest *md, unsigned char *ele, size_t len) {
-    mixDigest(md->o,ele,len);
-}
-
-/* Like `RedisModule_DigestAddStringBuffer()` but takes a long long as input
- * that gets converted into a string before adding it to the digest. */
-void RM_DigestAddLongLong(RedisModuleDigest *md, long long ll) {
-    char buf[LONG_STR_SIZE];
-    size_t len = ll2string(buf,sizeof(buf),ll);
-    mixDigest(md->o,buf,len);
-}
-
-/* See the documentation for `RedisModule_DigestAddElement()`. */
-void RM_DigestEndSequence(RedisModuleDigest *md) {
-    xorDigest(md->x,md->o,sizeof(md->o));
-    memset(md->o,0,sizeof(md->o));
-}
-
-/* Decode a serialized representation of a module data type 'mt' from string
- * 'str' and return a newly allocated value, or NULL if decoding failed.
- *
- * This call basically reuses the 'rdb_load' callback which module data types
- * implement in order to allow a module to arbitrarily serialize/de-serialize
- * keys, similar to how the Redis 'DUMP' and 'RESTORE' commands are implemented.
- *
- * Modules should generally use the REDISMODULE_OPTIONS_HANDLE_IO_ERRORS flag and
- * make sure the de-serialization code properly checks and handles IO errors
- * (freeing allocated buffers and returning a NULL).
- *
- * If this is NOT done, Redis will handle corrupted (or just truncated) serialized
- * data by producing an error message and terminating the process.
- */
-void *RM_LoadDataTypeFromString(const RedisModuleString *str, const moduleType *mt) {
-    rio payload;
-    RedisModuleIO io;
-    void *ret;
-
-    rioInitWithBuffer(&payload, str->ptr);
-    moduleInitIOContext(io,(moduleType *)mt,&payload,NULL);
-
-    /* All RM_Save*() calls always write a version 2 compatible format, so we
-     * need to make sure we read the same.
-     */
-    io.ver = 2;
-    ret = mt->rdb_load(&io,0);
-    if (io.ctx) {
-        moduleFreeContext(io.ctx);
-        zfree(io.ctx);
-    }
-    return ret;
-}
-
-/* Encode a module data type 'mt' value 'data' into serialized form, and return it
- * as a newly allocated RedisModuleString.
- *
- * This call basically reuses the 'rdb_save' callback which module data types
- * implement in order to allow a module to arbitrarily serialize/de-serialize
- * keys, similar to how the Redis 'DUMP' and 'RESTORE' commands are implemented.
- */
-RedisModuleString *RM_SaveDataTypeToString(RedisModuleCtx *ctx, void *data, const moduleType *mt) {
-    rio payload;
-    RedisModuleIO io;
-
-    rioInitWithBuffer(&payload,sdsempty());
-    moduleInitIOContext(io,(moduleType *)mt,&payload,NULL);
-    mt->rdb_save(&io,data);
-    if (io.ctx) {
-        moduleFreeContext(io.ctx);
-        zfree(io.ctx);
-    }
-    if (io.error) {
-        return NULL;
-    } else {
-        robj *str = createObject(OBJ_STRING,payload.io.buffer.ptr);
-        if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,str);
-        return str;
-    }
-}
-
-/* --------------------------------------------------------------------------
- * ## AOF API for modules data types
- * -------------------------------------------------------------------------- */
-
-/* Emits a command into the AOF during the AOF rewriting process. This function
- * is only called in the context of the aof_rewrite method of data types exported
- * by a module. The command works exactly like RedisModule_Call() in the way
- * the parameters are passed, but it does not return anything as the error
- * handling is performed by Redis itself. */
-void RM_EmitAOF(RedisModuleIO *io, const char *cmdname, const char *fmt, ...) {
-    if (io->error) return;
-    struct redisCommand *cmd;
-    robj **argv = NULL;
-    int argc = 0, flags = 0, j;
-    va_list ap;
-
-    cmd = lookupCommandByCString((char*)cmdname);
-    if (!cmd) {
-        serverLog(LL_WARNING,
-            "Fatal: AOF method for module data type '%s' tried to "
-            "emit unknown command '%s'",
-            io->type->name, cmdname);
-        io->error = 1;
-        errno = EINVAL;
-        return;
-    }
-
-    /* Emit the arguments into the AOF in Redis protocol format. */
-    va_start(ap, fmt);
-    argv = moduleCreateArgvFromUserFormat(cmdname,fmt,&argc,&flags,ap);
-    va_end(ap);
-    if (argv == NULL) {
-        serverLog(LL_WARNING,
-            "Fatal: AOF method for module data type '%s' tried to "
-            "call RedisModule_EmitAOF() with wrong format specifiers '%s'",
-            io->type->name, fmt);
-        io->error = 1;
-        errno = EINVAL;
-        return;
-    }
-
-    /* Bulk count. */
-    if (!io->error && rioWriteBulkCount(io->rio,'*',argc) == 0)
-        io->error = 1;
-
-    /* Arguments. */
-    for (j = 0; j < argc; j++) {
-        if (!io->error && rioWriteBulkObject(io->rio,argv[j]) == 0)
-            io->error = 1;
-        decrRefCount(argv[j]);
-    }
-    zfree(argv);
-    return;
-}
-
-/* --------------------------------------------------------------------------
- * ## IO context handling
- * -------------------------------------------------------------------------- */
-
-RedisModuleCtx *RM_GetContextFromIO(RedisModuleIO *io) {
-    if (io->ctx) return io->ctx; /* Can't have more than one... */
-    RedisModuleCtx ctxtemplate = REDISMODULE_CTX_INIT;
-    io->ctx = zmalloc(sizeof(RedisModuleCtx));
-    *(io->ctx) = ctxtemplate;
-    io->ctx->module = io->type->module;
-    io->ctx->client = NULL;
-    return io->ctx;
-}
-
-/* Returns a RedisModuleString with the name of the key currently saving or
- * loading, when an IO data type callback is called.  There is no guarantee
- * that the key name is always available, so this may return NULL.
- */
-const RedisModuleString *RM_GetKeyNameFromIO(RedisModuleIO *io) {
-    return io->key;
-}
-
-/* Returns a RedisModuleString with the name of the key from RedisModuleKey. */
-const RedisModuleString *RM_GetKeyNameFromModuleKey(RedisModuleKey *key) {
-    return key ? key->key : NULL;
-}
-
-/* --------------------------------------------------------------------------
- * ## Logging
- * -------------------------------------------------------------------------- */
-
-/* This is the low level function implementing both:
- *
- *      RM_Log()
- *      RM_LogIOError()
- *
- */
-void moduleLogRaw(RedisModule *module, const char *levelstr, const char *fmt, va_list ap) {
-    char msg[LOG_MAX_LEN];
-    size_t name_len;
-    int level;
-
-    if (!strcasecmp(levelstr,"debug")) level = LL_DEBUG;
-    else if (!strcasecmp(levelstr,"verbose")) level = LL_VERBOSE;
-    else if (!strcasecmp(levelstr,"notice")) level = LL_NOTICE;
-    else if (!strcasecmp(levelstr,"warning")) level = LL_WARNING;
-    else level = LL_VERBOSE; /* Default. */
-
-    if (level < server.verbosity) return;
-
-    name_len = snprintf(msg, sizeof(msg),"<%s> ", module? module->name: "module");
-    vsnprintf(msg + name_len, sizeof(msg) - name_len, fmt, ap);
-    serverLogRaw(level,msg);
-}
-
-/* Produces a log message to the standard Redis log, the format accepts
- * printf-alike specifiers, while level is a string describing the log
- * level to use when emitting the log, and must be one of the following:
- *
- * * "debug" (`REDISMODULE_LOGLEVEL_DEBUG`)
- * * "verbose" (`REDISMODULE_LOGLEVEL_VERBOSE`)
- * * "notice" (`REDISMODULE_LOGLEVEL_NOTICE`)
- * * "warning" (`REDISMODULE_LOGLEVEL_WARNING`)
- *
- * If the specified log level is invalid, verbose is used by default.
- * There is a fixed limit to the length of the log line this function is able
- * to emit, this limit is not specified but is guaranteed to be more than
- * a few lines of text.
- *
- * The ctx argument may be NULL if cannot be provided in the context of the
- * caller for instance threads or callbacks, in which case a generic "module"
- * will be used instead of the module name.
- */
-void RM_Log(RedisModuleCtx *ctx, const char *levelstr, const char *fmt, ...) {
-    va_list ap;
-    va_start(ap, fmt);
-    moduleLogRaw(ctx? ctx->module: NULL,levelstr,fmt,ap);
-    va_end(ap);
-}
-
-/* Log errors from RDB / AOF serialization callbacks.
- *
- * This function should be used when a callback is returning a critical
- * error to the caller since cannot load or save the data for some
- * critical reason. */
-void RM_LogIOError(RedisModuleIO *io, const char *levelstr, const char *fmt, ...) {
-    va_list ap;
-    va_start(ap, fmt);
-    moduleLogRaw(io->type->module,levelstr,fmt,ap);
-    va_end(ap);
-}
-
-/* Redis-like assert function.
- *
- * The macro `RedisModule_Assert(expression)` is recommended, rather than
- * calling this function directly.
- *
- * A failed assertion will shut down the server and produce logging information
- * that looks identical to information generated by Redis itself.
- */
-void RM__Assert(const char *estr, const char *file, int line) {
-    _serverAssert(estr, file, line);
-}
-
-/* Allows adding event to the latency monitor to be observed by the LATENCY
- * command. The call is skipped if the latency is smaller than the configured
- * latency-monitor-threshold. */
-void RM_LatencyAddSample(const char *event, mstime_t latency) {
-    if (latency >= server.latency_monitor_threshold)
-        latencyAddSample(event, latency);
-}
-
-/* --------------------------------------------------------------------------
- * ## Blocking clients from modules
- *
- * For a guide about blocking commands in modules, see
- * https://redis.io/topics/modules-blocking-ops.
- * -------------------------------------------------------------------------- */
-
-/* Readable handler for the awake pipe. We do nothing here, the awake bytes
- * will be actually read in a more appropriate place in the
- * moduleHandleBlockedClients() function that is where clients are actually
- * served. */
-void moduleBlockedClientPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask) {
-    UNUSED(el);
-    UNUSED(fd);
-    UNUSED(mask);
-    UNUSED(privdata);
-}
-
-/* This is called from blocked.c in order to unblock a client: may be called
- * for multiple reasons while the client is in the middle of being blocked
- * because the client is terminated, but is also called for cleanup when a
- * client is unblocked in a clean way after replaying.
- *
- * What we do here is just to set the client to NULL in the redis module
- * blocked client handle. This way if the client is terminated while there
- * is a pending threaded operation involving the blocked client, we'll know
- * that the client no longer exists and no reply callback should be called.
- *
- * The structure RedisModuleBlockedClient will be always deallocated when
- * running the list of clients blocked by a module that need to be unblocked. */
-void unblockClientFromModule(client *c) {
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-
-    /* Call the disconnection callback if any. Note that
-     * bc->disconnect_callback is set to NULL if the client gets disconnected
-     * by the module itself or because of a timeout, so the callback will NOT
-     * get called if this is not an actual disconnection event. */
-    if (bc->disconnect_callback) {
-        RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-        ctx.blocked_privdata = bc->privdata;
-        ctx.module = bc->module;
-        ctx.client = bc->client;
-        bc->disconnect_callback(&ctx,bc);
-        moduleFreeContext(&ctx);
-    }
-
-    /* If we made it here and client is still blocked it means that the command
-     * timed-out, client was killed or disconnected and disconnect_callback was
-     * not implemented (or it was, but RM_UnblockClient was not called from
-     * within it, as it should).
-     * We must call moduleUnblockClient in order to free privdata and
-     * RedisModuleBlockedClient.
-     *
-     * Note that we only do that for clients that are blocked on keys, for which
-     * the contract is that the module should not call RM_UnblockClient under
-     * normal circumstances.
-     * Clients implementing threads and working with private data should be
-     * aware that calling RM_UnblockClient for every blocked client is their
-     * responsibility, and if they fail to do so memory may leak. Ideally they
-     * should implement the disconnect and timeout callbacks and call
-     * RM_UnblockClient, but any other way is also acceptable. */
-    if (bc->blocked_on_keys && !bc->unblocked)
-        moduleUnblockClient(c);
-
-    bc->client = NULL;
-}
-
-/* Block a client in the context of a module: this function implements both
- * RM_BlockClient() and RM_BlockClientOnKeys() depending on the fact the
- * keys are passed or not.
- *
- * When not blocking for keys, the keys, numkeys, and privdata parameters are
- * not needed. The privdata in that case must be NULL, since later is
- * RM_UnblockClient() that will provide some private data that the reply
- * callback will receive.
- *
- * Instead when blocking for keys, normally RM_UnblockClient() will not be
- * called (because the client will unblock when the key is modified), so
- * 'privdata' should be provided in that case, so that once the client is
- * unlocked and the reply callback is called, it will receive its associated
- * private data.
- *
- * Even when blocking on keys, RM_UnblockClient() can be called however, but
- * in that case the privdata argument is disregarded, because we pass the
- * reply callback the privdata that is set here while blocking.
- *
- */
-RedisModuleBlockedClient *moduleBlockClient(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) {
-    client *c = ctx->client;
-    int islua = server.in_eval;
-    int ismulti = server.in_exec;
-
-    c->bpop.module_blocked_handle = zmalloc(sizeof(RedisModuleBlockedClient));
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-    ctx->module->blocked_clients++;
-
-    /* We need to handle the invalid operation of calling modules blocking
-     * commands from Lua or MULTI. We actually create an already aborted
-     * (client set to NULL) blocked client handle, and actually reply with
-     * an error. */
-    mstime_t timeout = timeout_ms ? (mstime()+timeout_ms) : 0;
-    bc->client = (islua || ismulti) ? NULL : c;
-    bc->module = ctx->module;
-    bc->reply_callback = reply_callback;
-    bc->timeout_callback = timeout_callback;
-    bc->disconnect_callback = NULL; /* Set by RM_SetDisconnectCallback() */
-    bc->free_privdata = free_privdata;
-    bc->privdata = privdata;
-    bc->reply_client = createClient(NULL);
-    bc->reply_client->flags |= CLIENT_MODULE;
-    bc->dbid = c->db->id;
-    bc->blocked_on_keys = keys != NULL;
-    bc->unblocked = 0;
-    bc->background_timer = 0;
-    bc->background_duration = 0;
-    c->bpop.timeout = timeout;
-
-    if (islua || ismulti) {
-        c->bpop.module_blocked_handle = NULL;
-        addReplyError(c, islua ?
-            "Blocking module command called from Lua script" :
-            "Blocking module command called from transaction");
-    } else {
-        if (keys) {
-            blockForKeys(c,BLOCKED_MODULE,keys,numkeys,timeout,NULL,NULL,NULL);
-        } else {
-            blockClient(c,BLOCKED_MODULE);
-        }
-    }
-    return bc;
-}
-
-/* This function is called from module.c in order to check if a module
- * blocked for BLOCKED_MODULE and subtype 'on keys' (bc->blocked_on_keys true)
- * can really be unblocked, since the module was able to serve the client.
- * If the callback returns REDISMODULE_OK, then the client can be unblocked,
- * otherwise the client remains blocked and we'll retry again when one of
- * the keys it blocked for becomes "ready" again.
- * This function returns 1 if client was served (and should be unblocked) */
-int moduleTryServeClientBlockedOnKey(client *c, robj *key) {
-    int served = 0;
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-
-    /* Protect against re-processing: don't serve clients that are already
-     * in the unblocking list for any reason (including RM_UnblockClient()
-     * explicit call). See #6798. */
-    if (bc->unblocked) return 0;
-
-    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-    ctx.flags |= REDISMODULE_CTX_BLOCKED_REPLY;
-    ctx.blocked_ready_key = key;
-    ctx.blocked_privdata = bc->privdata;
-    ctx.module = bc->module;
-    ctx.client = bc->client;
-    ctx.blocked_client = bc;
-    if (bc->reply_callback(&ctx,(void**)c->argv,c->argc) == REDISMODULE_OK)
-        served = 1;
-    moduleFreeContext(&ctx);
-    return served;
-}
-
-/* Block a client in the context of a blocking command, returning an handle
- * which will be used, later, in order to unblock the client with a call to
- * RedisModule_UnblockClient(). The arguments specify callback functions
- * and a timeout after which the client is unblocked.
- *
- * The callbacks are called in the following contexts:
- *
- *     reply_callback:   called after a successful RedisModule_UnblockClient()
- *                       call in order to reply to the client and unblock it.
- *
- *     timeout_callback: called when the timeout is reached or if `CLIENT UNBLOCK`
- *                       is invoked, in order to send an error to the client.
- *
- *     free_privdata:    called in order to free the private data that is passed
- *                       by RedisModule_UnblockClient() call.
- *
- * Note: RedisModule_UnblockClient should be called for every blocked client,
- *       even if client was killed, timed-out or disconnected. Failing to do so
- *       will result in memory leaks.
- *
- * There are some cases where RedisModule_BlockClient() cannot be used:
- *
- * 1. If the client is a Lua script.
- * 2. If the client is executing a MULTI block.
- *
- * In these cases, a call to RedisModule_BlockClient() will **not** block the
- * client, but instead produce a specific error reply.
- *
- * A module that registers a timeout_callback function can also be unblocked
- * using the `CLIENT UNBLOCK` command, which will trigger the timeout callback.
- * If a callback function is not registered, then the blocked client will be
- * treated as if it is not in a blocked state and `CLIENT UNBLOCK` will return
- * a zero value.
- *
- * Measuring background time: By default the time spent in the blocked command
- * is not account for the total command duration. To include such time you should
- * use RM_BlockedClientMeasureTimeStart() and RM_BlockedClientMeasureTimeEnd() one,
- * or multiple times within the blocking command background work.
- */
-RedisModuleBlockedClient *RM_BlockClient(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms) {
-    return moduleBlockClient(ctx,reply_callback,timeout_callback,free_privdata,timeout_ms, NULL,0,NULL);
-}
-
-/* This call is similar to RedisModule_BlockClient(), however in this case we
- * don't just block the client, but also ask Redis to unblock it automatically
- * once certain keys become "ready", that is, contain more data.
- *
- * Basically this is similar to what a typical Redis command usually does,
- * like BLPOP or BZPOPMAX: the client blocks if it cannot be served ASAP,
- * and later when the key receives new data (a list push for instance), the
- * client is unblocked and served.
- *
- * However in the case of this module API, when the client is unblocked?
- *
- * 1. If you block on a key of a type that has blocking operations associated,
- *    like a list, a sorted set, a stream, and so forth, the client may be
- *    unblocked once the relevant key is targeted by an operation that normally
- *    unblocks the native blocking operations for that type. So if we block
- *    on a list key, an RPUSH command may unblock our client and so forth.
- * 2. If you are implementing your native data type, or if you want to add new
- *    unblocking conditions in addition to "1", you can call the modules API
- *    RedisModule_SignalKeyAsReady().
- *
- * Anyway we can't be sure if the client should be unblocked just because the
- * key is signaled as ready: for instance a successive operation may change the
- * key, or a client in queue before this one can be served, modifying the key
- * as well and making it empty again. So when a client is blocked with
- * RedisModule_BlockClientOnKeys() the reply callback is not called after
- * RM_UnblockClient() is called, but every time a key is signaled as ready:
- * if the reply callback can serve the client, it returns REDISMODULE_OK
- * and the client is unblocked, otherwise it will return REDISMODULE_ERR
- * and we'll try again later.
- *
- * The reply callback can access the key that was signaled as ready by
- * calling the API RedisModule_GetBlockedClientReadyKey(), that returns
- * just the string name of the key as a RedisModuleString object.
- *
- * Thanks to this system we can setup complex blocking scenarios, like
- * unblocking a client only if a list contains at least 5 items or other
- * more fancy logics.
- *
- * Note that another difference with RedisModule_BlockClient(), is that here
- * we pass the private data directly when blocking the client: it will
- * be accessible later in the reply callback. Normally when blocking with
- * RedisModule_BlockClient() the private data to reply to the client is
- * passed when calling RedisModule_UnblockClient() but here the unblocking
- * is performed by Redis itself, so we need to have some private data before
- * hand. The private data is used to store any information about the specific
- * unblocking operation that you are implementing. Such information will be
- * freed using the free_privdata callback provided by the user.
- *
- * However the reply callback will be able to access the argument vector of
- * the command, so the private data is often not needed.
- *
- * Note: Under normal circumstances RedisModule_UnblockClient should not be
- *       called for clients that are blocked on keys (Either the key will
- *       become ready or a timeout will occur). If for some reason you do want
- *       to call RedisModule_UnblockClient it is possible: Client will be
- *       handled as if it were timed-out (You must implement the timeout
- *       callback in that case).
- */
-RedisModuleBlockedClient *RM_BlockClientOnKeys(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) {
-    return moduleBlockClient(ctx,reply_callback,timeout_callback,free_privdata,timeout_ms, keys,numkeys,privdata);
-}
-
-/* This function is used in order to potentially unblock a client blocked
- * on keys with RedisModule_BlockClientOnKeys(). When this function is called,
- * all the clients blocked for this key will get their reply_callback called.
- *
- * Note: The function has no effect if the signaled key doesn't exist. */
-void RM_SignalKeyAsReady(RedisModuleCtx *ctx, RedisModuleString *key) {
-    signalKeyAsReady(ctx->client->db, key, OBJ_MODULE);
-}
-
-/* Implements RM_UnblockClient() and moduleUnblockClient(). */
-int moduleUnblockClientByHandle(RedisModuleBlockedClient *bc, void *privdata) {
-    pthread_mutex_lock(&moduleUnblockedClientsMutex);
-    if (!bc->blocked_on_keys) bc->privdata = privdata;
-    bc->unblocked = 1;
-    listAddNodeTail(moduleUnblockedClients,bc);
-    if (write(server.module_blocked_pipe[1],"A",1) != 1) {
-        /* Ignore the error, this is best-effort. */
-    }
-    pthread_mutex_unlock(&moduleUnblockedClientsMutex);
-    return REDISMODULE_OK;
-}
-
-/* This API is used by the Redis core to unblock a client that was blocked
- * by a module. */
-void moduleUnblockClient(client *c) {
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-    moduleUnblockClientByHandle(bc,NULL);
-}
-
-/* Return true if the client 'c' was blocked by a module using
- * RM_BlockClientOnKeys(). */
-int moduleClientIsBlockedOnKeys(client *c) {
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-    return bc->blocked_on_keys;
-}
-
-/* Unblock a client blocked by `RedisModule_BlockedClient`. This will trigger
- * the reply callbacks to be called in order to reply to the client.
- * The 'privdata' argument will be accessible by the reply callback, so
- * the caller of this function can pass any value that is needed in order to
- * actually reply to the client.
- *
- * A common usage for 'privdata' is a thread that computes something that
- * needs to be passed to the client, included but not limited some slow
- * to compute reply or some reply obtained via networking.
- *
- * Note 1: this function can be called from threads spawned by the module.
- *
- * Note 2: when we unblock a client that is blocked for keys using the API
- * RedisModule_BlockClientOnKeys(), the privdata argument here is not used.
- * Unblocking a client that was blocked for keys using this API will still
- * require the client to get some reply, so the function will use the
- * "timeout" handler in order to do so (The privdata provided in
- * RedisModule_BlockClientOnKeys() is accessible from the timeout
- * callback via RM_GetBlockedClientPrivateData). */
-int RM_UnblockClient(RedisModuleBlockedClient *bc, void *privdata) {
-    if (bc->blocked_on_keys) {
-        /* In theory the user should always pass the timeout handler as an
-         * argument, but better to be safe than sorry. */
-        if (bc->timeout_callback == NULL) return REDISMODULE_ERR;
-        if (bc->unblocked) return REDISMODULE_OK;
-        if (bc->client) moduleBlockedClientTimedOut(bc->client);
-    }
-    moduleUnblockClientByHandle(bc,privdata);
-    return REDISMODULE_OK;
-}
-
-/* Abort a blocked client blocking operation: the client will be unblocked
- * without firing any callback. */
-int RM_AbortBlock(RedisModuleBlockedClient *bc) {
-    bc->reply_callback = NULL;
-    bc->disconnect_callback = NULL;
-    return RM_UnblockClient(bc,NULL);
-}
-
-/* Set a callback that will be called if a blocked client disconnects
- * before the module has a chance to call RedisModule_UnblockClient()
- *
- * Usually what you want to do there, is to cleanup your module state
- * so that you can call RedisModule_UnblockClient() safely, otherwise
- * the client will remain blocked forever if the timeout is large.
- *
- * Notes:
- *
- * 1. It is not safe to call Reply* family functions here, it is also
- *    useless since the client is gone.
- *
- * 2. This callback is not called if the client disconnects because of
- *    a timeout. In such a case, the client is unblocked automatically
- *    and the timeout callback is called.
- */
-void RM_SetDisconnectCallback(RedisModuleBlockedClient *bc, RedisModuleDisconnectFunc callback) {
-    bc->disconnect_callback = callback;
-}
-
-/* This function will check the moduleUnblockedClients queue in order to
- * call the reply callback and really unblock the client.
- *
- * Clients end into this list because of calls to RM_UnblockClient(),
- * however it is possible that while the module was doing work for the
- * blocked client, it was terminated by Redis (for timeout or other reasons).
- * When this happens the RedisModuleBlockedClient structure in the queue
- * will have the 'client' field set to NULL. */
-void moduleHandleBlockedClients(void) {
-    listNode *ln;
-    RedisModuleBlockedClient *bc;
-
-    pthread_mutex_lock(&moduleUnblockedClientsMutex);
-    /* Here we unblock all the pending clients blocked in modules operations
-     * so we can read every pending "awake byte" in the pipe. */
-    char buf[1];
-    while (read(server.module_blocked_pipe[0],buf,1) == 1);
-    while (listLength(moduleUnblockedClients)) {
-        ln = listFirst(moduleUnblockedClients);
-        bc = ln->value;
-        client *c = bc->client;
-        listDelNode(moduleUnblockedClients,ln);
-        pthread_mutex_unlock(&moduleUnblockedClientsMutex);
-
-        /* Release the lock during the loop, as long as we don't
-         * touch the shared list. */
-
-        /* Call the reply callback if the client is valid and we have
-         * any callback. However the callback is not called if the client
-         * was blocked on keys (RM_BlockClientOnKeys()), because we already
-         * called such callback in moduleTryServeClientBlockedOnKey() when
-         * the key was signaled as ready. */
-        uint64_t reply_us = 0;
-        if (c && !bc->blocked_on_keys && bc->reply_callback) {
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-            ctx.flags |= REDISMODULE_CTX_BLOCKED_REPLY;
-            ctx.blocked_privdata = bc->privdata;
-            ctx.blocked_ready_key = NULL;
-            ctx.module = bc->module;
-            ctx.client = bc->client;
-            ctx.blocked_client = bc;
-            monotime replyTimer;
-            elapsedStart(&replyTimer);
-            bc->reply_callback(&ctx,(void**)c->argv,c->argc);
-            reply_us = elapsedUs(replyTimer);
-            moduleFreeContext(&ctx);
-        }
-        /* Update stats now that we've finished the blocking operation.
-         * This needs to be out of the reply callback above given that a
-         * module might not define any callback and still do blocking ops.
-         */
-        if (c && !bc->blocked_on_keys) {
-            updateStatsOnUnblock(c, bc->background_duration, reply_us);
-        }
-
-        /* Free privdata if any. */
-        if (bc->privdata && bc->free_privdata) {
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-            if (c == NULL)
-                ctx.flags |= REDISMODULE_CTX_BLOCKED_DISCONNECTED;
-            ctx.blocked_privdata = bc->privdata;
-            ctx.module = bc->module;
-            ctx.client = bc->client;
-            bc->free_privdata(&ctx,bc->privdata);
-            moduleFreeContext(&ctx);
-        }
-
-        /* It is possible that this blocked client object accumulated
-         * replies to send to the client in a thread safe context.
-         * We need to glue such replies to the client output buffer and
-         * free the temporary client we just used for the replies. */
-        if (c) AddReplyFromClient(c, bc->reply_client);
-        freeClient(bc->reply_client);
-
-        if (c != NULL) {
-            /* Before unblocking the client, set the disconnect callback
-             * to NULL, because if we reached this point, the client was
-             * properly unblocked by the module. */
-            bc->disconnect_callback = NULL;
-            unblockClient(c);
-            /* Put the client in the list of clients that need to write
-             * if there are pending replies here. This is needed since
-             * during a non blocking command the client may receive output. */
-            if (clientHasPendingReplies(c) &&
-                !(c->flags & CLIENT_PENDING_WRITE))
-            {
-                c->flags |= CLIENT_PENDING_WRITE;
-                listAddNodeHead(server.clients_pending_write,c);
-            }
-        }
-
-        /* Free 'bc' only after unblocking the client, since it is
-         * referenced in the client blocking context, and must be valid
-         * when calling unblockClient(). */
-        bc->module->blocked_clients--;
-        zfree(bc);
-
-        /* Lock again before to iterate the loop. */
-        pthread_mutex_lock(&moduleUnblockedClientsMutex);
-    }
-    pthread_mutex_unlock(&moduleUnblockedClientsMutex);
-}
-
-/* Check if the specified client can be safely timed out using
- * moduleBlockedClientTimedOut().
- */
-int moduleBlockedClientMayTimeout(client *c) {
-    if (c->btype != BLOCKED_MODULE)
-        return 1;
-
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-    return (bc && bc->timeout_callback != NULL);
-}
-
-/* Called when our client timed out. After this function unblockClient()
- * is called, and it will invalidate the blocked client. So this function
- * does not need to do any cleanup. Eventually the module will call the
- * API to unblock the client and the memory will be released. */
-void moduleBlockedClientTimedOut(client *c) {
-    RedisModuleBlockedClient *bc = c->bpop.module_blocked_handle;
-
-    /* Protect against re-processing: don't serve clients that are already
-     * in the unblocking list for any reason (including RM_UnblockClient()
-     * explicit call). See #6798. */
-    if (bc->unblocked) return;
-
-    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-    ctx.flags |= REDISMODULE_CTX_BLOCKED_TIMEOUT;
-    ctx.module = bc->module;
-    ctx.client = bc->client;
-    ctx.blocked_client = bc;
-    ctx.blocked_privdata = bc->privdata;
-    bc->timeout_callback(&ctx,(void**)c->argv,c->argc);
-    moduleFreeContext(&ctx);
-    if (!bc->blocked_on_keys) {
-        updateStatsOnUnblock(c, bc->background_duration, 0);
-    }
-    /* For timeout events, we do not want to call the disconnect callback,
-     * because the blocked client will be automatically disconnected in
-     * this case, and the user can still hook using the timeout callback. */
-    bc->disconnect_callback = NULL;
-}
-
-/* Return non-zero if a module command was called in order to fill the
- * reply for a blocked client. */
-int RM_IsBlockedReplyRequest(RedisModuleCtx *ctx) {
-    return (ctx->flags & REDISMODULE_CTX_BLOCKED_REPLY) != 0;
-}
-
-/* Return non-zero if a module command was called in order to fill the
- * reply for a blocked client that timed out. */
-int RM_IsBlockedTimeoutRequest(RedisModuleCtx *ctx) {
-    return (ctx->flags & REDISMODULE_CTX_BLOCKED_TIMEOUT) != 0;
-}
-
-/* Get the private data set by RedisModule_UnblockClient() */
-void *RM_GetBlockedClientPrivateData(RedisModuleCtx *ctx) {
-    return ctx->blocked_privdata;
-}
-
-/* Get the key that is ready when the reply callback is called in the context
- * of a client blocked by RedisModule_BlockClientOnKeys(). */
-RedisModuleString *RM_GetBlockedClientReadyKey(RedisModuleCtx *ctx) {
-    return ctx->blocked_ready_key;
-}
-
-/* Get the blocked client associated with a given context.
- * This is useful in the reply and timeout callbacks of blocked clients,
- * before sometimes the module has the blocked client handle references
- * around, and wants to cleanup it. */
-RedisModuleBlockedClient *RM_GetBlockedClientHandle(RedisModuleCtx *ctx) {
-    return ctx->blocked_client;
-}
-
-/* Return true if when the free callback of a blocked client is called,
- * the reason for the client to be unblocked is that it disconnected
- * while it was blocked. */
-int RM_BlockedClientDisconnected(RedisModuleCtx *ctx) {
-    return (ctx->flags & REDISMODULE_CTX_BLOCKED_DISCONNECTED) != 0;
-}
-
-/* --------------------------------------------------------------------------
- * ## Thread Safe Contexts
- * -------------------------------------------------------------------------- */
-
-/* Return a context which can be used inside threads to make Redis context
- * calls with certain modules APIs. If 'bc' is not NULL then the module will
- * be bound to a blocked client, and it will be possible to use the
- * `RedisModule_Reply*` family of functions to accumulate a reply for when the
- * client will be unblocked. Otherwise the thread safe context will be
- * detached by a specific client.
- *
- * To call non-reply APIs, the thread safe context must be prepared with:
- *
- *     RedisModule_ThreadSafeContextLock(ctx);
- *     ... make your call here ...
- *     RedisModule_ThreadSafeContextUnlock(ctx);
- *
- * This is not needed when using `RedisModule_Reply*` functions, assuming
- * that a blocked client was used when the context was created, otherwise
- * no RedisModule_Reply* call should be made at all.
- *
- * NOTE: If you're creating a detached thread safe context (bc is NULL),
- * consider using `RM_GetDetachedThreadSafeContext` which will also retain
- * the module ID and thus be more useful for logging. */
-RedisModuleCtx *RM_GetThreadSafeContext(RedisModuleBlockedClient *bc) {
-    RedisModuleCtx *ctx = zmalloc(sizeof(*ctx));
-    RedisModuleCtx empty = REDISMODULE_CTX_INIT;
-    memcpy(ctx,&empty,sizeof(empty));
-    if (bc) {
-        ctx->blocked_client = bc;
-        ctx->module = bc->module;
-    }
-    ctx->flags |= REDISMODULE_CTX_THREAD_SAFE;
-    /* Even when the context is associated with a blocked client, we can't
-     * access it safely from another thread, so we create a fake client here
-     * in order to keep things like the currently selected database and similar
-     * things. */
-    ctx->client = createClient(NULL);
-    if (bc) {
-        selectDb(ctx->client,bc->dbid);
-        if (bc->client) ctx->client->id = bc->client->id;
-    }
-    return ctx;
-}
-
-/* Return a detached thread safe context that is not associated with any
- * specific blocked client, but is associated with the module's context.
- *
- * This is useful for modules that wish to hold a global context over
- * a long term, for purposes such as logging. */
-RedisModuleCtx *RM_GetDetachedThreadSafeContext(RedisModuleCtx *ctx) {
-    RedisModuleCtx *new_ctx = zmalloc(sizeof(*new_ctx));
-    RedisModuleCtx empty = REDISMODULE_CTX_INIT;
-    memcpy(new_ctx,&empty,sizeof(empty));
-    new_ctx->module = ctx->module;
-    new_ctx->flags |= REDISMODULE_CTX_THREAD_SAFE;
-    new_ctx->client = createClient(NULL);
-    return new_ctx;
-}
-
-/* Release a thread safe context. */
-void RM_FreeThreadSafeContext(RedisModuleCtx *ctx) {
-    moduleFreeContext(ctx);
-    zfree(ctx);
-}
-
-/* Acquire the server lock before executing a thread safe API call.
- * This is not needed for `RedisModule_Reply*` calls when there is
- * a blocked client connected to the thread safe context. */
-void RM_ThreadSafeContextLock(RedisModuleCtx *ctx) {
-    UNUSED(ctx);
-    moduleAcquireGIL();
-}
-
-/* Similar to RM_ThreadSafeContextLock but this function
- * would not block if the server lock is already acquired.
- *
- * If successful (lock acquired) REDISMODULE_OK is returned,
- * otherwise REDISMODULE_ERR is returned and errno is set
- * accordingly. */
-int RM_ThreadSafeContextTryLock(RedisModuleCtx *ctx) {
-    UNUSED(ctx);
-
-    int res = moduleTryAcquireGIL();
-    if(res != 0) {
-        errno = res;
-        return REDISMODULE_ERR;
-    }
-    return REDISMODULE_OK;
-}
-
-/* Release the server lock after a thread safe API call was executed. */
-void RM_ThreadSafeContextUnlock(RedisModuleCtx *ctx) {
-    UNUSED(ctx);
-    moduleReleaseGIL();
-}
-
-void moduleAcquireGIL(void) {
-    pthread_mutex_lock(&moduleGIL);
-}
-
-int moduleTryAcquireGIL(void) {
-    return pthread_mutex_trylock(&moduleGIL);
-}
-
-void moduleReleaseGIL(void) {
-    pthread_mutex_unlock(&moduleGIL);
-}
-
-
-/* --------------------------------------------------------------------------
- * ## Module Keyspace Notifications API
- * -------------------------------------------------------------------------- */
-
-/* Subscribe to keyspace notifications. This is a low-level version of the
- * keyspace-notifications API. A module can register callbacks to be notified
- * when keyspace events occur.
- *
- * Notification events are filtered by their type (string events, set events,
- * etc), and the subscriber callback receives only events that match a specific
- * mask of event types.
- *
- * When subscribing to notifications with RedisModule_SubscribeToKeyspaceEvents 
- * the module must provide an event type-mask, denoting the events the subscriber
- * is interested in. This can be an ORed mask of any of the following flags:
- *
- *  - REDISMODULE_NOTIFY_GENERIC: Generic commands like DEL, EXPIRE, RENAME
- *  - REDISMODULE_NOTIFY_STRING: String events
- *  - REDISMODULE_NOTIFY_LIST: List events
- *  - REDISMODULE_NOTIFY_SET: Set events
- *  - REDISMODULE_NOTIFY_HASH: Hash events
- *  - REDISMODULE_NOTIFY_ZSET: Sorted Set events
- *  - REDISMODULE_NOTIFY_EXPIRED: Expiration events
- *  - REDISMODULE_NOTIFY_EVICTED: Eviction events
- *  - REDISMODULE_NOTIFY_STREAM: Stream events
- *  - REDISMODULE_NOTIFY_MODULE: Module types events
- *  - REDISMODULE_NOTIFY_KEYMISS: Key-miss events
- *  - REDISMODULE_NOTIFY_ALL: All events (Excluding REDISMODULE_NOTIFY_KEYMISS)
- *  - REDISMODULE_NOTIFY_LOADED: A special notification available only for modules,
- *                               indicates that the key was loaded from persistence.
- *                               Notice, when this event fires, the given key
- *                               can not be retained, use RM_CreateStringFromString
- *                               instead.
- *
- * We do not distinguish between key events and keyspace events, and it is up
- * to the module to filter the actions taken based on the key.
- *
- * The subscriber signature is:
- *
- *     int (*RedisModuleNotificationFunc) (RedisModuleCtx *ctx, int type,
- *                                         const char *event,
- *                                         RedisModuleString *key);
- *
- * `type` is the event type bit, that must match the mask given at registration
- * time. The event string is the actual command being executed, and key is the
- * relevant Redis key.
- *
- * Notification callback gets executed with a redis context that can not be
- * used to send anything to the client, and has the db number where the event
- * occurred as its selected db number.
- *
- * Notice that it is not necessary to enable notifications in redis.conf for
- * module notifications to work.
- *
- * Warning: the notification callbacks are performed in a synchronous manner,
- * so notification callbacks must to be fast, or they would slow Redis down.
- * If you need to take long actions, use threads to offload them.
- *
- * See https://redis.io/topics/notifications for more information.
- */
-int RM_SubscribeToKeyspaceEvents(RedisModuleCtx *ctx, int types, RedisModuleNotificationFunc callback) {
-    RedisModuleKeyspaceSubscriber *sub = zmalloc(sizeof(*sub));
-    sub->module = ctx->module;
-    sub->event_mask = types;
-    sub->notify_callback = callback;
-    sub->active = 0;
-
-    listAddNodeTail(moduleKeyspaceSubscribers, sub);
-    return REDISMODULE_OK;
-}
-
-/* Get the configured bitmap of notify-keyspace-events (Could be used
- * for additional filtering in RedisModuleNotificationFunc) */
-int RM_GetNotifyKeyspaceEvents() {
-    return server.notify_keyspace_events;
-}
-
-/* Expose notifyKeyspaceEvent to modules */
-int RM_NotifyKeyspaceEvent(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
-    if (!ctx || !ctx->client)
-        return REDISMODULE_ERR;
-    notifyKeyspaceEvent(type, (char *)event, key, ctx->client->db->id);
-    return REDISMODULE_OK;
-}
-
-/* Dispatcher for keyspace notifications to module subscriber functions.
- * This gets called  only if at least one module requested to be notified on
- * keyspace notifications */
-void moduleNotifyKeyspaceEvent(int type, const char *event, robj *key, int dbid) {
-    /* Don't do anything if there aren't any subscribers */
-    if (listLength(moduleKeyspaceSubscribers) == 0) return;
-
-    listIter li;
-    listNode *ln;
-    listRewind(moduleKeyspaceSubscribers,&li);
-
-    /* Remove irrelevant flags from the type mask */
-    type &= ~(NOTIFY_KEYEVENT | NOTIFY_KEYSPACE);
-
-    while((ln = listNext(&li))) {
-        RedisModuleKeyspaceSubscriber *sub = ln->value;
-        /* Only notify subscribers on events matching they registration,
-         * and avoid subscribers triggering themselves */
-        if ((sub->event_mask & type) && sub->active == 0) {
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-            ctx.module = sub->module;
-            ctx.client = moduleFreeContextReusedClient;
-            selectDb(ctx.client, dbid);
-
-            /* mark the handler as active to avoid reentrant loops.
-             * If the subscriber performs an action triggering itself,
-             * it will not be notified about it. */
-            sub->active = 1;
-            sub->notify_callback(&ctx, type, event, key);
-            sub->active = 0;
-            moduleFreeContext(&ctx);
-        }
-    }
-}
-
-/* Unsubscribe any notification subscribers this module has upon unloading */
-void moduleUnsubscribeNotifications(RedisModule *module) {
-    listIter li;
-    listNode *ln;
-    listRewind(moduleKeyspaceSubscribers,&li);
-    while((ln = listNext(&li))) {
-        RedisModuleKeyspaceSubscriber *sub = ln->value;
-        if (sub->module == module) {
-            listDelNode(moduleKeyspaceSubscribers, ln);
-            zfree(sub);
-        }
-    }
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules Cluster API
- * -------------------------------------------------------------------------- */
-
-/* The Cluster message callback function pointer type. */
-typedef void (*RedisModuleClusterMessageReceiver)(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len);
-
-/* This structure identifies a registered caller: it must match a given module
- * ID, for a given message type. The callback function is just the function
- * that was registered as receiver. */
-typedef struct moduleClusterReceiver {
-    uint64_t module_id;
-    RedisModuleClusterMessageReceiver callback;
-    struct RedisModule *module;
-    struct moduleClusterReceiver *next;
-} moduleClusterReceiver;
-
-typedef struct moduleClusterNodeInfo {
-    int flags;
-    char ip[NET_IP_STR_LEN];
-    int port;
-    char master_id[40]; /* Only if flags & REDISMODULE_NODE_MASTER is true. */
-} mdouleClusterNodeInfo;
-
-/* We have an array of message types: each bucket is a linked list of
- * configured receivers. */
-static moduleClusterReceiver *clusterReceivers[UINT8_MAX];
-
-/* Dispatch the message to the right module receiver. */
-void moduleCallClusterReceivers(const char *sender_id, uint64_t module_id, uint8_t type, const unsigned char *payload, uint32_t len) {
-    moduleClusterReceiver *r = clusterReceivers[type];
-    while(r) {
-        if (r->module_id == module_id) {
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-            ctx.module = r->module;
-            ctx.client = moduleFreeContextReusedClient;
-            selectDb(ctx.client, 0);
-            r->callback(&ctx,sender_id,type,payload,len);
-            moduleFreeContext(&ctx);
-            return;
-        }
-        r = r->next;
-    }
-}
-
-/* Register a callback receiver for cluster messages of type 'type'. If there
- * was already a registered callback, this will replace the callback function
- * with the one provided, otherwise if the callback is set to NULL and there
- * is already a callback for this function, the callback is unregistered
- * (so this API call is also used in order to delete the receiver). */
-void RM_RegisterClusterMessageReceiver(RedisModuleCtx *ctx, uint8_t type, RedisModuleClusterMessageReceiver callback) {
-    if (!server.cluster_enabled) return;
-
-    uint64_t module_id = moduleTypeEncodeId(ctx->module->name,0);
-    moduleClusterReceiver *r = clusterReceivers[type], *prev = NULL;
-    while(r) {
-        if (r->module_id == module_id) {
-            /* Found! Set or delete. */
-            if (callback) {
-                r->callback = callback;
-            } else {
-                /* Delete the receiver entry if the user is setting
-                 * it to NULL. Just unlink the receiver node from the
-                 * linked list. */
-                if (prev)
-                    prev->next = r->next;
-                else
-                    clusterReceivers[type]->next = r->next;
-                zfree(r);
-            }
-            return;
-        }
-        prev = r;
-        r = r->next;
-    }
-
-    /* Not found, let's add it. */
-    if (callback) {
-        r = zmalloc(sizeof(*r));
-        r->module_id = module_id;
-        r->module = ctx->module;
-        r->callback = callback;
-        r->next = clusterReceivers[type];
-        clusterReceivers[type] = r;
-    }
-}
-
-/* Send a message to all the nodes in the cluster if `target` is NULL, otherwise
- * at the specified target, which is a REDISMODULE_NODE_ID_LEN bytes node ID, as
- * returned by the receiver callback or by the nodes iteration functions.
- *
- * The function returns REDISMODULE_OK if the message was successfully sent,
- * otherwise if the node is not connected or such node ID does not map to any
- * known cluster node, REDISMODULE_ERR is returned. */
-int RM_SendClusterMessage(RedisModuleCtx *ctx, char *target_id, uint8_t type, unsigned char *msg, uint32_t len) {
-    if (!server.cluster_enabled) return REDISMODULE_ERR;
-    uint64_t module_id = moduleTypeEncodeId(ctx->module->name,0);
-    if (clusterSendModuleMessageToTarget(target_id,module_id,type,msg,len) == C_OK)
-        return REDISMODULE_OK;
-    else
-        return REDISMODULE_ERR;
-}
-
-/* Return an array of string pointers, each string pointer points to a cluster
- * node ID of exactly REDISMODULE_NODE_ID_SIZE bytes (without any null term).
- * The number of returned node IDs is stored into `*numnodes`.
- * However if this function is called by a module not running an a Redis
- * instance with Redis Cluster enabled, NULL is returned instead.
- *
- * The IDs returned can be used with RedisModule_GetClusterNodeInfo() in order
- * to get more information about single nodes.
- *
- * The array returned by this function must be freed using the function
- * RedisModule_FreeClusterNodesList().
- *
- * Example:
- *
- *     size_t count, j;
- *     char **ids = RedisModule_GetClusterNodesList(ctx,&count);
- *     for (j = 0; j < count; j++) {
- *         RedisModule_Log("notice","Node %.*s",
- *             REDISMODULE_NODE_ID_LEN,ids[j]);
- *     }
- *     RedisModule_FreeClusterNodesList(ids);
- */
-char **RM_GetClusterNodesList(RedisModuleCtx *ctx, size_t *numnodes) {
-    UNUSED(ctx);
-
-    if (!server.cluster_enabled) return NULL;
-    size_t count = dictSize(server.cluster->nodes);
-    char **ids = zmalloc((count+1)*REDISMODULE_NODE_ID_LEN);
-    dictIterator *di = dictGetIterator(server.cluster->nodes);
-    dictEntry *de;
-    int j = 0;
-    while((de = dictNext(di)) != NULL) {
-        clusterNode *node = dictGetVal(de);
-        if (node->flags & (CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE)) continue;
-        ids[j] = zmalloc(REDISMODULE_NODE_ID_LEN);
-        memcpy(ids[j],node->name,REDISMODULE_NODE_ID_LEN);
-        j++;
-    }
-    *numnodes = j;
-    ids[j] = NULL; /* Null term so that FreeClusterNodesList does not need
-                    * to also get the count argument. */
-    dictReleaseIterator(di);
-    return ids;
-}
-
-/* Free the node list obtained with RedisModule_GetClusterNodesList. */
-void RM_FreeClusterNodesList(char **ids) {
-    if (ids == NULL) return;
-    for (int j = 0; ids[j]; j++) zfree(ids[j]);
-    zfree(ids);
-}
-
-/* Return this node ID (REDISMODULE_CLUSTER_ID_LEN bytes) or NULL if the cluster
- * is disabled. */
-const char *RM_GetMyClusterID(void) {
-    if (!server.cluster_enabled) return NULL;
-    return server.cluster->myself->name;
-}
-
-/* Return the number of nodes in the cluster, regardless of their state
- * (handshake, noaddress, ...) so that the number of active nodes may actually
- * be smaller, but not greater than this number. If the instance is not in
- * cluster mode, zero is returned. */
-size_t RM_GetClusterSize(void) {
-    if (!server.cluster_enabled) return 0;
-    return dictSize(server.cluster->nodes);
-}
-
-clusterNode *clusterLookupNode(const char *name); /* We need access to internals */
-
-/* Populate the specified info for the node having as ID the specified 'id',
- * then returns REDISMODULE_OK. Otherwise if the node ID does not exist from
- * the POV of this local node, REDISMODULE_ERR is returned.
- *
- * The arguments `ip`, `master_id`, `port` and `flags` can be NULL in case we don't
- * need to populate back certain info. If an `ip` and `master_id` (only populated
- * if the instance is a slave) are specified, they point to buffers holding
- * at least REDISMODULE_NODE_ID_LEN bytes. The strings written back as `ip`
- * and `master_id` are not null terminated.
- *
- * The list of flags reported is the following:
- *
- * * REDISMODULE_NODE_MYSELF:       This node
- * * REDISMODULE_NODE_MASTER:       The node is a master
- * * REDISMODULE_NODE_SLAVE:        The node is a replica
- * * REDISMODULE_NODE_PFAIL:        We see the node as failing
- * * REDISMODULE_NODE_FAIL:         The cluster agrees the node is failing
- * * REDISMODULE_NODE_NOFAILOVER:   The slave is configured to never failover
- */
-int RM_GetClusterNodeInfo(RedisModuleCtx *ctx, const char *id, char *ip, char *master_id, int *port, int *flags) {
-    UNUSED(ctx);
-
-    clusterNode *node = clusterLookupNode(id);
-    if (node == NULL ||
-        node->flags & (CLUSTER_NODE_NOADDR|CLUSTER_NODE_HANDSHAKE))
-    {
-        return REDISMODULE_ERR;
-    }
-
-    if (ip) strncpy(ip,node->ip,NET_IP_STR_LEN);
-
-    if (master_id) {
-        /* If the information is not available, the function will set the
-         * field to zero bytes, so that when the field can't be populated the
-         * function kinda remains predictable. */
-        if (node->flags & CLUSTER_NODE_SLAVE && node->slaveof)
-            memcpy(master_id,node->slaveof->name,REDISMODULE_NODE_ID_LEN);
-        else
-            memset(master_id,0,REDISMODULE_NODE_ID_LEN);
-    }
-    if (port) *port = node->port;
-
-    /* As usually we have to remap flags for modules, in order to ensure
-     * we can provide binary compatibility. */
-    if (flags) {
-        *flags = 0;
-        if (node->flags & CLUSTER_NODE_MYSELF) *flags |= REDISMODULE_NODE_MYSELF;
-        if (node->flags & CLUSTER_NODE_MASTER) *flags |= REDISMODULE_NODE_MASTER;
-        if (node->flags & CLUSTER_NODE_SLAVE) *flags |= REDISMODULE_NODE_SLAVE;
-        if (node->flags & CLUSTER_NODE_PFAIL) *flags |= REDISMODULE_NODE_PFAIL;
-        if (node->flags & CLUSTER_NODE_FAIL) *flags |= REDISMODULE_NODE_FAIL;
-        if (node->flags & CLUSTER_NODE_NOFAILOVER) *flags |= REDISMODULE_NODE_NOFAILOVER;
-    }
-    return REDISMODULE_OK;
-}
-
-/* Set Redis Cluster flags in order to change the normal behavior of
- * Redis Cluster, especially with the goal of disabling certain functions.
- * This is useful for modules that use the Cluster API in order to create
- * a different distributed system, but still want to use the Redis Cluster
- * message bus. Flags that can be set:
- *
- * * CLUSTER_MODULE_FLAG_NO_FAILOVER
- * * CLUSTER_MODULE_FLAG_NO_REDIRECTION
- *
- * With the following effects:
- *
- * * NO_FAILOVER: prevent Redis Cluster slaves to failover a failing master.
- *                Also disables the replica migration feature.
- *
- * * NO_REDIRECTION: Every node will accept any key, without trying to perform
- *                   partitioning according to the user Redis Cluster algorithm.
- *                   Slots informations will still be propagated across the
- *                   cluster, but without effects. */
-void RM_SetClusterFlags(RedisModuleCtx *ctx, uint64_t flags) {
-    UNUSED(ctx);
-    if (flags & REDISMODULE_CLUSTER_FLAG_NO_FAILOVER)
-        server.cluster_module_flags |= CLUSTER_MODULE_FLAG_NO_FAILOVER;
-    if (flags & REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION)
-        server.cluster_module_flags |= CLUSTER_MODULE_FLAG_NO_REDIRECTION;
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules Timers API
- *
- * Module timers are an high precision "green timers" abstraction where
- * every module can register even millions of timers without problems, even if
- * the actual event loop will just have a single timer that is used to awake the
- * module timers subsystem in order to process the next event.
- *
- * All the timers are stored into a radix tree, ordered by expire time, when
- * the main Redis event loop timer callback is called, we try to process all
- * the timers already expired one after the other. Then we re-enter the event
- * loop registering a timer that will expire when the next to process module
- * timer will expire.
- *
- * Every time the list of active timers drops to zero, we unregister the
- * main event loop timer, so that there is no overhead when such feature is
- * not used.
- * -------------------------------------------------------------------------- */
-
-static rax *Timers;     /* The radix tree of all the timers sorted by expire. */
-long long aeTimer = -1; /* Main event loop (ae.c) timer identifier. */
-
-typedef void (*RedisModuleTimerProc)(RedisModuleCtx *ctx, void *data);
-
-/* The timer descriptor, stored as value in the radix tree. */
-typedef struct RedisModuleTimer {
-    RedisModule *module;                /* Module reference. */
-    RedisModuleTimerProc callback;      /* The callback to invoke on expire. */
-    void *data;                         /* Private data for the callback. */
-    int dbid;                           /* Database number selected by the original client. */
-} RedisModuleTimer;
-
-/* This is the timer handler that is called by the main event loop. We schedule
- * this timer to be called when the nearest of our module timers will expire. */
-int moduleTimerHandler(struct aeEventLoop *eventLoop, long long id, void *clientData) {
-    UNUSED(eventLoop);
-    UNUSED(id);
-    UNUSED(clientData);
-
-    /* To start let's try to fire all the timers already expired. */
-    raxIterator ri;
-    raxStart(&ri,Timers);
-    uint64_t now = ustime();
-    long long next_period = 0;
-    while(1) {
-        raxSeek(&ri,"^",NULL,0);
-        if (!raxNext(&ri)) break;
-        uint64_t expiretime;
-        memcpy(&expiretime,ri.key,sizeof(expiretime));
-        expiretime = ntohu64(expiretime);
-        if (now >= expiretime) {
-            RedisModuleTimer *timer = ri.data;
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-
-            ctx.module = timer->module;
-            ctx.client = moduleFreeContextReusedClient;
-            selectDb(ctx.client, timer->dbid);
-            timer->callback(&ctx,timer->data);
-            moduleFreeContext(&ctx);
-            raxRemove(Timers,(unsigned char*)ri.key,ri.key_len,NULL);
-            zfree(timer);
-        } else {
-            /* We call ustime() again instead of using the cached 'now' so that
-             * 'next_period' isn't affected by the time it took to execute
-             * previous calls to 'callback.
-             * We need to cast 'expiretime' so that the compiler will not treat
-             * the difference as unsigned (Causing next_period to be huge) in
-             * case expiretime < ustime() */
-            next_period = ((long long)expiretime-ustime())/1000; /* Scale to milliseconds. */
-            break;
-        }
-    }
-    raxStop(&ri);
-
-    /* Reschedule the next timer or cancel it. */
-    if (next_period <= 0) next_period = 1;
-    if (raxSize(Timers) > 0) {
-        return next_period;
-    } else {
-        aeTimer = -1;
-        return AE_NOMORE;
-    }
-}
-
-/* Create a new timer that will fire after `period` milliseconds, and will call
- * the specified function using `data` as argument. The returned timer ID can be
- * used to get information from the timer or to stop it before it fires.
- * Note that for the common use case of a repeating timer (Re-registration
- * of the timer inside the RedisModuleTimerProc callback) it matters when
- * this API is called:
- * If it is called at the beginning of 'callback' it means
- * the event will triggered every 'period'.
- * If it is called at the end of 'callback' it means
- * there will 'period' milliseconds gaps between events.
- * (If the time it takes to execute 'callback' is negligible the two
- * statements above mean the same) */
-RedisModuleTimerID RM_CreateTimer(RedisModuleCtx *ctx, mstime_t period, RedisModuleTimerProc callback, void *data) {
-    RedisModuleTimer *timer = zmalloc(sizeof(*timer));
-    timer->module = ctx->module;
-    timer->callback = callback;
-    timer->data = data;
-    timer->dbid = ctx->client ? ctx->client->db->id : 0;
-    uint64_t expiretime = ustime()+period*1000;
-    uint64_t key;
-
-    while(1) {
-        key = htonu64(expiretime);
-        if (raxFind(Timers, (unsigned char*)&key,sizeof(key)) == raxNotFound) {
-            raxInsert(Timers,(unsigned char*)&key,sizeof(key),timer,NULL);
-            break;
-        } else {
-            expiretime++;
-        }
-    }
-
-    /* We need to install the main event loop timer if it's not already
-     * installed, or we may need to refresh its period if we just installed
-     * a timer that will expire sooner than any other else (i.e. the timer
-     * we just installed is the first timer in the Timers rax). */
-    if (aeTimer != -1) {
-        raxIterator ri;
-        raxStart(&ri,Timers);
-        raxSeek(&ri,"^",NULL,0);
-        raxNext(&ri);
-        if (memcmp(ri.key,&key,sizeof(key)) == 0) {
-            /* This is the first key, we need to re-install the timer according
-             * to the just added event. */
-            aeDeleteTimeEvent(server.el,aeTimer);
-            aeTimer = -1;
-        }
-        raxStop(&ri);
-    }
-
-    /* If we have no main timer (the old one was invalidated, or this is the
-     * first module timer we have), install one. */
-    if (aeTimer == -1)
-        aeTimer = aeCreateTimeEvent(server.el,period,moduleTimerHandler,NULL,NULL);
-
-    return key;
-}
-
-/* Stop a timer, returns REDISMODULE_OK if the timer was found, belonged to the
- * calling module, and was stopped, otherwise REDISMODULE_ERR is returned.
- * If not NULL, the data pointer is set to the value of the data argument when
- * the timer was created. */
-int RM_StopTimer(RedisModuleCtx *ctx, RedisModuleTimerID id, void **data) {
-    RedisModuleTimer *timer = raxFind(Timers,(unsigned char*)&id,sizeof(id));
-    if (timer == raxNotFound || timer->module != ctx->module)
-        return REDISMODULE_ERR;
-    if (data) *data = timer->data;
-    raxRemove(Timers,(unsigned char*)&id,sizeof(id),NULL);
-    zfree(timer);
-    return REDISMODULE_OK;
-}
-
-/* Obtain information about a timer: its remaining time before firing
- * (in milliseconds), and the private data pointer associated with the timer.
- * If the timer specified does not exist or belongs to a different module
- * no information is returned and the function returns REDISMODULE_ERR, otherwise
- * REDISMODULE_OK is returned. The arguments remaining or data can be NULL if
- * the caller does not need certain information. */
-int RM_GetTimerInfo(RedisModuleCtx *ctx, RedisModuleTimerID id, uint64_t *remaining, void **data) {
-    RedisModuleTimer *timer = raxFind(Timers,(unsigned char*)&id,sizeof(id));
-    if (timer == raxNotFound || timer->module != ctx->module)
-        return REDISMODULE_ERR;
-    if (remaining) {
-        int64_t rem = ntohu64(id)-ustime();
-        if (rem < 0) rem = 0;
-        *remaining = rem/1000; /* Scale to milliseconds. */
-    }
-    if (data) *data = timer->data;
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules ACL API
- *
- * Implements a hook into the authentication and authorization within Redis. 
- * --------------------------------------------------------------------------*/
-
-/* This function is called when a client's user has changed and invokes the
- * client's user changed callback if it was set. This callback should
- * cleanup any state the module was tracking about this client. 
- * 
- * A client's user can be changed through the AUTH command, module 
- * authentication, and when a client is freed. */
-void moduleNotifyUserChanged(client *c) {
-    if (c->auth_callback) {
-        c->auth_callback(c->id, c->auth_callback_privdata);
-
-        /* The callback will fire exactly once, even if the user remains 
-         * the same. It is expected to completely clean up the state
-         * so all references are cleared here. */
-        c->auth_callback = NULL;
-        c->auth_callback_privdata = NULL;
-        c->auth_module = NULL;
-    }
-}
-
-void revokeClientAuthentication(client *c) {
-    /* Freeing the client would result in moduleNotifyUserChanged() to be
-     * called later, however since we use revokeClientAuthentication() also
-     * in moduleFreeAuthenticatedClients() to implement module unloading, we
-     * do this action ASAP: this way if the module is unloaded, when the client
-     * is eventually freed we don't rely on the module to still exist. */
-    moduleNotifyUserChanged(c);
-
-    c->user = DefaultUser;
-    c->authenticated = 0;
-    /* We will write replies to this client later, so we can't close it
-     * directly even if async. */
-    if (c == server.current_client) {
-        c->flags |= CLIENT_CLOSE_AFTER_COMMAND;
-    } else {
-        freeClientAsync(c);
-    }
-}
-
-/* Cleanup all clients that have been authenticated with this module. This
- * is called from onUnload() to give the module a chance to cleanup any
- * resources associated with clients it has authenticated. */
-static void moduleFreeAuthenticatedClients(RedisModule *module) {
-    listIter li;
-    listNode *ln;
-    listRewind(server.clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        client *c = listNodeValue(ln);
-        if (!c->auth_module) continue;
-
-        RedisModule *auth_module = (RedisModule *) c->auth_module;
-        if (auth_module == module) { 
-            revokeClientAuthentication(c);
-        }
-    }
-}
-
-/* Creates a Redis ACL user that the module can use to authenticate a client.
- * After obtaining the user, the module should set what such user can do
- * using the RM_SetUserACL() function. Once configured, the user
- * can be used in order to authenticate a connection, with the specified
- * ACL rules, using the RedisModule_AuthClientWithUser() function.
- *
- * Note that:
- *
- * * Users created here are not listed by the ACL command.
- * * Users created here are not checked for duplicated name, so it's up to
- *   the module calling this function to take care of not creating users
- *   with the same name.
- * * The created user can be used to authenticate multiple Redis connections.
- *
- * The caller can later free the user using the function
- * RM_FreeModuleUser(). When this function is called, if there are
- * still clients authenticated with this user, they are disconnected.
- * The function to free the user should only be used when the caller really
- * wants to invalidate the user to define a new one with different
- * capabilities. */
-RedisModuleUser *RM_CreateModuleUser(const char *name) {
-    RedisModuleUser *new_user = zmalloc(sizeof(RedisModuleUser));
-    new_user->user = ACLCreateUnlinkedUser();
-
-    /* Free the previous temporarily assigned name to assign the new one */
-    sdsfree(new_user->user->name);
-    new_user->user->name = sdsnew(name);
-    return new_user;
-}
-
-/* Frees a given user and disconnects all of the clients that have been
- * authenticated with it. See RM_CreateModuleUser for detailed usage.*/
-int RM_FreeModuleUser(RedisModuleUser *user) {
-    ACLFreeUserAndKillClients(user->user);
-    zfree(user);
-    return REDISMODULE_OK;
-}
-
-/* Sets the permissions of a user created through the redis module 
- * interface. The syntax is the same as ACL SETUSER, so refer to the 
- * documentation in acl.c for more information. See RM_CreateModuleUser
- * for detailed usage.
- * 
- * Returns REDISMODULE_OK on success and REDISMODULE_ERR on failure
- * and will set an errno describing why the operation failed. */
-int RM_SetModuleUserACL(RedisModuleUser *user, const char* acl) {
-    return ACLSetUser(user->user, acl, -1);
-}
-
-/* Authenticate the client associated with the context with 
- * the provided user. Returns REDISMODULE_OK on success and
- * REDISMODULE_ERR on error.
- * 
- * This authentication can be tracked with the optional callback and private
- * data fields. The callback will be called whenever the user of the client
- * changes. This callback should be used to cleanup any state that is being
- * kept in the module related to the client authentication. It will only be
- * called once, even when the user hasn't changed, in order to allow for a
- * new callback to be specified. If this authentication does not need to be
- * tracked, pass in NULL for the callback and privdata. 
- * 
- * If client_id is not NULL, it will be filled with the id of the client
- * that was authenticated. This can be used with the 
- * RM_DeauthenticateAndCloseClient() API in order to deauthenticate a 
- * previously authenticated client if the authentication is no longer valid. 
- * 
- * For expensive authentication operations, it is recommended to block the
- * client and do the authentication in the background and then attach the user
- * to the client in a threadsafe context.  */
-static int authenticateClientWithUser(RedisModuleCtx *ctx, user *user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
-    if (user->flags & USER_FLAG_DISABLED) {
-        return REDISMODULE_ERR;
-    }
-
-    /* Avoid settings which are meaningless and will be lost */
-    if (!ctx->client || (ctx->client->flags & CLIENT_MODULE)) {
-        return REDISMODULE_ERR;
-    }
-
-    moduleNotifyUserChanged(ctx->client);
-
-    ctx->client->user = user;
-    ctx->client->authenticated = 1;
-
-    if (callback) {
-        ctx->client->auth_callback = callback;
-        ctx->client->auth_callback_privdata = privdata;
-        ctx->client->auth_module = ctx->module;
-    }
-
-    if (client_id) {
-        *client_id = ctx->client->id;
-    }
-
-    return REDISMODULE_OK;
-}
-
-
-/* Authenticate the current context's user with the provided redis acl user. 
- * Returns REDISMODULE_ERR if the user is disabled.
- * 
- * See authenticateClientWithUser for information about callback, client_id,
- * and general usage for authentication. */
-int RM_AuthenticateClientWithUser(RedisModuleCtx *ctx, RedisModuleUser *module_user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
-    return authenticateClientWithUser(ctx, module_user->user, callback, privdata, client_id);
-}
-
-/* Authenticate the current context's user with the provided redis acl user. 
- * Returns REDISMODULE_ERR if the user is disabled or the user does not exist.
- * 
- * See authenticateClientWithUser for information about callback, client_id,
- * and general usage for authentication. */
-int RM_AuthenticateClientWithACLUser(RedisModuleCtx *ctx, const char *name, size_t len, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) {
-    user *acl_user = ACLGetUserByName(name, len);
-
-    if (!acl_user) {
-        return REDISMODULE_ERR;
-    }
-    return authenticateClientWithUser(ctx, acl_user, callback, privdata, client_id);
-}
-
-/* Deauthenticate and close the client. The client resources will not be
- * be immediately freed, but will be cleaned up in a background job. This is 
- * the recommended way to deauthenicate a client since most clients can't 
- * handle users becoming deauthenticated. Returns REDISMODULE_ERR when the
- * client doesn't exist and REDISMODULE_OK when the operation was successful. 
- * 
- * The client ID is returned from the RM_AuthenticateClientWithUser and
- * RM_AuthenticateClientWithACLUser APIs, but can be obtained through
- * the CLIENT api or through server events. 
- * 
- * This function is not thread safe, and must be executed within the context
- * of a command or thread safe context. */
-int RM_DeauthenticateAndCloseClient(RedisModuleCtx *ctx, uint64_t client_id) {
-    UNUSED(ctx);
-    client *c = lookupClientByID(client_id);
-    if (c == NULL) return REDISMODULE_ERR;
-
-    /* Revoke also marks client to be closed ASAP */
-    revokeClientAuthentication(c);
-    return REDISMODULE_OK;
-}
-
-/* Return the X.509 client-side certificate used by the client to authenticate
- * this connection.
- *
- * The return value is an allocated RedisModuleString that is a X.509 certificate
- * encoded in PEM (Base64) format. It should be freed (or auto-freed) by the caller.
- *
- * A NULL value is returned in the following conditions:
- *
- * - Connection ID does not exist
- * - Connection is not a TLS connection
- * - Connection is a TLS connection but no client ceritifcate was used
- */
-RedisModuleString *RM_GetClientCertificate(RedisModuleCtx *ctx, uint64_t client_id) {
-    client *c = lookupClientByID(client_id);
-    if (c == NULL) return NULL;
-
-    sds cert = connTLSGetPeerCert(c->conn);
-    if (!cert) return NULL;
-
-    RedisModuleString *s = createObject(OBJ_STRING, cert);
-    if (ctx != NULL) autoMemoryAdd(ctx, REDISMODULE_AM_STRING, s);
-
-    return s;
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules Dictionary API
- *
- * Implements a sorted dictionary (actually backed by a radix tree) with
- * the usual get / set / del / num-items API, together with an iterator
- * capable of going back and forth.
- * -------------------------------------------------------------------------- */
-
-/* Create a new dictionary. The 'ctx' pointer can be the current module context
- * or NULL, depending on what you want. Please follow the following rules:
- *
- * 1. Use a NULL context if you plan to retain a reference to this dictionary
- *    that will survive the time of the module callback where you created it.
- * 2. Use a NULL context if no context is available at the time you are creating
- *    the dictionary (of course...).
- * 3. However use the current callback context as 'ctx' argument if the
- *    dictionary time to live is just limited to the callback scope. In this
- *    case, if enabled, you can enjoy the automatic memory management that will
- *    reclaim the dictionary memory, as well as the strings returned by the
- *    Next / Prev dictionary iterator calls.
- */
-RedisModuleDict *RM_CreateDict(RedisModuleCtx *ctx) {
-    struct RedisModuleDict *d = zmalloc(sizeof(*d));
-    d->rax = raxNew();
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_DICT,d);
-    return d;
-}
-
-/* Free a dictionary created with RM_CreateDict(). You need to pass the
- * context pointer 'ctx' only if the dictionary was created using the
- * context instead of passing NULL. */
-void RM_FreeDict(RedisModuleCtx *ctx, RedisModuleDict *d) {
-    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_DICT,d);
-    raxFree(d->rax);
-    zfree(d);
-}
-
-/* Return the size of the dictionary (number of keys). */
-uint64_t RM_DictSize(RedisModuleDict *d) {
-    return raxSize(d->rax);
-}
-
-/* Store the specified key into the dictionary, setting its value to the
- * pointer 'ptr'. If the key was added with success, since it did not
- * already exist, REDISMODULE_OK is returned. Otherwise if the key already
- * exists the function returns REDISMODULE_ERR. */
-int RM_DictSetC(RedisModuleDict *d, void *key, size_t keylen, void *ptr) {
-    int retval = raxTryInsert(d->rax,key,keylen,ptr,NULL);
-    return (retval == 1) ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Like RedisModule_DictSetC() but will replace the key with the new
- * value if the key already exists. */
-int RM_DictReplaceC(RedisModuleDict *d, void *key, size_t keylen, void *ptr) {
-    int retval = raxInsert(d->rax,key,keylen,ptr,NULL);
-    return (retval == 1) ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Like RedisModule_DictSetC() but takes the key as a RedisModuleString. */
-int RM_DictSet(RedisModuleDict *d, RedisModuleString *key, void *ptr) {
-    return RM_DictSetC(d,key->ptr,sdslen(key->ptr),ptr);
-}
-
-/* Like RedisModule_DictReplaceC() but takes the key as a RedisModuleString. */
-int RM_DictReplace(RedisModuleDict *d, RedisModuleString *key, void *ptr) {
-    return RM_DictReplaceC(d,key->ptr,sdslen(key->ptr),ptr);
-}
-
-/* Return the value stored at the specified key. The function returns NULL
- * both in the case the key does not exist, or if you actually stored
- * NULL at key. So, optionally, if the 'nokey' pointer is not NULL, it will
- * be set by reference to 1 if the key does not exist, or to 0 if the key
- * exists. */
-void *RM_DictGetC(RedisModuleDict *d, void *key, size_t keylen, int *nokey) {
-    void *res = raxFind(d->rax,key,keylen);
-    if (nokey) *nokey = (res == raxNotFound);
-    return (res == raxNotFound) ? NULL : res;
-}
-
-/* Like RedisModule_DictGetC() but takes the key as a RedisModuleString. */
-void *RM_DictGet(RedisModuleDict *d, RedisModuleString *key, int *nokey) {
-    return RM_DictGetC(d,key->ptr,sdslen(key->ptr),nokey);
-}
-
-/* Remove the specified key from the dictionary, returning REDISMODULE_OK if
- * the key was found and delted, or REDISMODULE_ERR if instead there was
- * no such key in the dictionary. When the operation is successful, if
- * 'oldval' is not NULL, then '*oldval' is set to the value stored at the
- * key before it was deleted. Using this feature it is possible to get
- * a pointer to the value (for instance in order to release it), without
- * having to call RedisModule_DictGet() before deleting the key. */
-int RM_DictDelC(RedisModuleDict *d, void *key, size_t keylen, void *oldval) {
-    int retval = raxRemove(d->rax,key,keylen,oldval);
-    return retval ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Like RedisModule_DictDelC() but gets the key as a RedisModuleString. */
-int RM_DictDel(RedisModuleDict *d, RedisModuleString *key, void *oldval) {
-    return RM_DictDelC(d,key->ptr,sdslen(key->ptr),oldval);
-}
-
-/* Return an iterator, setup in order to start iterating from the specified
- * key by applying the operator 'op', which is just a string specifying the
- * comparison operator to use in order to seek the first element. The
- * operators available are:
- *
- * * `^`   -- Seek the first (lexicographically smaller) key.
- * * `$`   -- Seek the last  (lexicographically biffer) key.
- * * `>`   -- Seek the first element greater than the specified key.
- * * `>=`  -- Seek the first element greater or equal than the specified key.
- * * `<`   -- Seek the first element smaller than the specified key.
- * * `<=`  -- Seek the first element smaller or equal than the specified key.
- * * `==`  -- Seek the first element matching exactly the specified key.
- *
- * Note that for `^` and `$` the passed key is not used, and the user may
- * just pass NULL with a length of 0.
- *
- * If the element to start the iteration cannot be seeked based on the
- * key and operator passed, RedisModule_DictNext() / Prev() will just return
- * REDISMODULE_ERR at the first call, otherwise they'll produce elements.
- */
-RedisModuleDictIter *RM_DictIteratorStartC(RedisModuleDict *d, const char *op, void *key, size_t keylen) {
-    RedisModuleDictIter *di = zmalloc(sizeof(*di));
-    di->dict = d;
-    raxStart(&di->ri,d->rax);
-    raxSeek(&di->ri,op,key,keylen);
-    return di;
-}
-
-/* Exactly like RedisModule_DictIteratorStartC, but the key is passed as a
- * RedisModuleString. */
-RedisModuleDictIter *RM_DictIteratorStart(RedisModuleDict *d, const char *op, RedisModuleString *key) {
-    return RM_DictIteratorStartC(d,op,key->ptr,sdslen(key->ptr));
-}
-
-/* Release the iterator created with RedisModule_DictIteratorStart(). This call
- * is mandatory otherwise a memory leak is introduced in the module. */
-void RM_DictIteratorStop(RedisModuleDictIter *di) {
-    raxStop(&di->ri);
-    zfree(di);
-}
-
-/* After its creation with RedisModule_DictIteratorStart(), it is possible to
- * change the currently selected element of the iterator by using this
- * API call. The result based on the operator and key is exactly like
- * the function RedisModule_DictIteratorStart(), however in this case the
- * return value is just REDISMODULE_OK in case the seeked element was found,
- * or REDISMODULE_ERR in case it was not possible to seek the specified
- * element. It is possible to reseek an iterator as many times as you want. */
-int RM_DictIteratorReseekC(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) {
-    return raxSeek(&di->ri,op,key,keylen);
-}
-
-/* Like RedisModule_DictIteratorReseekC() but takes the key as as a
- * RedisModuleString. */
-int RM_DictIteratorReseek(RedisModuleDictIter *di, const char *op, RedisModuleString *key) {
-    return RM_DictIteratorReseekC(di,op,key->ptr,sdslen(key->ptr));
-}
-
-/* Return the current item of the dictionary iterator `di` and steps to the
- * next element. If the iterator already yield the last element and there
- * are no other elements to return, NULL is returned, otherwise a pointer
- * to a string representing the key is provided, and the `*keylen` length
- * is set by reference (if keylen is not NULL). The `*dataptr`, if not NULL
- * is set to the value of the pointer stored at the returned key as auxiliary
- * data (as set by the RedisModule_DictSet API).
- *
- * Usage example:
- *
- *      ... create the iterator here ...
- *      char *key;
- *      void *data;
- *      while((key = RedisModule_DictNextC(iter,&keylen,&data)) != NULL) {
- *          printf("%.*s %p\n", (int)keylen, key, data);
- *      }
- *
- * The returned pointer is of type void because sometimes it makes sense
- * to cast it to a `char*` sometimes to an unsigned `char*` depending on the
- * fact it contains or not binary data, so this API ends being more
- * comfortable to use.
- *
- * The validity of the returned pointer is until the next call to the
- * next/prev iterator step. Also the pointer is no longer valid once the
- * iterator is released. */
-void *RM_DictNextC(RedisModuleDictIter *di, size_t *keylen, void **dataptr) {
-    if (!raxNext(&di->ri)) return NULL;
-    if (keylen) *keylen = di->ri.key_len;
-    if (dataptr) *dataptr = di->ri.data;
-    return di->ri.key;
-}
-
-/* This function is exactly like RedisModule_DictNext() but after returning
- * the currently selected element in the iterator, it selects the previous
- * element (laxicographically smaller) instead of the next one. */
-void *RM_DictPrevC(RedisModuleDictIter *di, size_t *keylen, void **dataptr) {
-    if (!raxPrev(&di->ri)) return NULL;
-    if (keylen) *keylen = di->ri.key_len;
-    if (dataptr) *dataptr = di->ri.data;
-    return di->ri.key;
-}
-
-/* Like RedisModuleNextC(), but instead of returning an internally allocated
- * buffer and key length, it returns directly a module string object allocated
- * in the specified context 'ctx' (that may be NULL exactly like for the main
- * API RedisModule_CreateString).
- *
- * The returned string object should be deallocated after use, either manually
- * or by using a context that has automatic memory management active. */
-RedisModuleString *RM_DictNext(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) {
-    size_t keylen;
-    void *key = RM_DictNextC(di,&keylen,dataptr);
-    if (key == NULL) return NULL;
-    return RM_CreateString(ctx,key,keylen);
-}
-
-/* Like RedisModule_DictNext() but after returning the currently selected
- * element in the iterator, it selects the previous element (laxicographically
- * smaller) instead of the next one. */
-RedisModuleString *RM_DictPrev(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) {
-    size_t keylen;
-    void *key = RM_DictPrevC(di,&keylen,dataptr);
-    if (key == NULL) return NULL;
-    return RM_CreateString(ctx,key,keylen);
-}
-
-/* Compare the element currently pointed by the iterator to the specified
- * element given by key/keylen, according to the operator 'op' (the set of
- * valid operators are the same valid for RedisModule_DictIteratorStart).
- * If the comparision is successful the command returns REDISMODULE_OK
- * otherwise REDISMODULE_ERR is returned.
- *
- * This is useful when we want to just emit a lexicographical range, so
- * in the loop, as we iterate elements, we can also check if we are still
- * on range.
- *
- * The function return REDISMODULE_ERR if the iterator reached the
- * end of elements condition as well. */
-int RM_DictCompareC(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) {
-    if (raxEOF(&di->ri)) return REDISMODULE_ERR;
-    int res = raxCompare(&di->ri,op,key,keylen);
-    return res ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-/* Like RedisModule_DictCompareC but gets the key to compare with the current
- * iterator key as a RedisModuleString. */
-int RM_DictCompare(RedisModuleDictIter *di, const char *op, RedisModuleString *key) {
-    if (raxEOF(&di->ri)) return REDISMODULE_ERR;
-    int res = raxCompare(&di->ri,op,key->ptr,sdslen(key->ptr));
-    return res ? REDISMODULE_OK : REDISMODULE_ERR;
-}
-
-
-
-
-/* --------------------------------------------------------------------------
- * ## Modules Info fields
- * -------------------------------------------------------------------------- */
-
-int RM_InfoEndDictField(RedisModuleInfoCtx *ctx);
-
-/* Used to start a new section, before adding any fields. the section name will
- * be prefixed by `<modulename>_` and must only include A-Z,a-z,0-9.
- * NULL or empty string indicates the default section (only `<modulename>`) is used.
- * When return value is REDISMODULE_ERR, the section should and will be skipped. */
-int RM_InfoAddSection(RedisModuleInfoCtx *ctx, char *name) {
-    sds full_name = sdsdup(ctx->module->name);
-    if (name != NULL && strlen(name) > 0)
-        full_name = sdscatfmt(full_name, "_%s", name);
-
-    /* Implicitly end dicts, instead of returning an error which is likely un checked. */
-    if (ctx->in_dict_field)
-        RM_InfoEndDictField(ctx);
-
-    /* proceed only if:
-     * 1) no section was requested (emit all)
-     * 2) the module name was requested (emit all)
-     * 3) this specific section was requested. */
-    if (ctx->requested_section) {
-        if (strcasecmp(ctx->requested_section, full_name) &&
-            strcasecmp(ctx->requested_section, ctx->module->name)) {
-            sdsfree(full_name);
-            ctx->in_section = 0;
-            return REDISMODULE_ERR;
-        }
-    }
-    if (ctx->sections++) ctx->info = sdscat(ctx->info,"\r\n");
-    ctx->info = sdscatfmt(ctx->info, "# %S\r\n", full_name);
-    ctx->in_section = 1;
-    sdsfree(full_name);
-    return REDISMODULE_OK;
-}
-
-/* Starts a dict field, similar to the ones in INFO KEYSPACE. Use normal
- * RedisModule_InfoAddField* functions to add the items to this field, and
- * terminate with RedisModule_InfoEndDictField. */
-int RM_InfoBeginDictField(RedisModuleInfoCtx *ctx, char *name) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    /* Implicitly end dicts, instead of returning an error which is likely un checked. */
-    if (ctx->in_dict_field)
-        RM_InfoEndDictField(ctx);
-    char *tmpmodname, *tmpname;
-    ctx->info = sdscatfmt(ctx->info,
-        "%s_%s:",
-        getSafeInfoString(ctx->module->name, strlen(ctx->module->name), &tmpmodname),
-        getSafeInfoString(name, strlen(name), &tmpname));
-    if (tmpmodname != NULL) zfree(tmpmodname);
-    if (tmpname != NULL) zfree(tmpname);
-    ctx->in_dict_field = 1;
-    return REDISMODULE_OK;
-}
-
-/* Ends a dict field, see RedisModule_InfoBeginDictField */
-int RM_InfoEndDictField(RedisModuleInfoCtx *ctx) {
-    if (!ctx->in_dict_field)
-        return REDISMODULE_ERR;
-    /* trim the last ',' if found. */
-    if (ctx->info[sdslen(ctx->info)-1]==',')
-        sdsIncrLen(ctx->info, -1);
-    ctx->info = sdscat(ctx->info, "\r\n");
-    ctx->in_dict_field = 0;
-    return REDISMODULE_OK;
-}
-
-/* Used by RedisModuleInfoFunc to add info fields.
- * Each field will be automatically prefixed by `<modulename>_`.
- * Field names or values must not include `\r\n` or `:`. */
-int RM_InfoAddFieldString(RedisModuleInfoCtx *ctx, char *field, RedisModuleString *value) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    if (ctx->in_dict_field) {
-        ctx->info = sdscatfmt(ctx->info,
-            "%s=%S,",
-            field,
-            (sds)value->ptr);
-        return REDISMODULE_OK;
-    }
-    ctx->info = sdscatfmt(ctx->info,
-        "%s_%s:%S\r\n",
-        ctx->module->name,
-        field,
-        (sds)value->ptr);
-    return REDISMODULE_OK;
-}
-
-/* See RedisModule_InfoAddFieldString(). */
-int RM_InfoAddFieldCString(RedisModuleInfoCtx *ctx, char *field, char *value) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    if (ctx->in_dict_field) {
-        ctx->info = sdscatfmt(ctx->info,
-            "%s=%s,",
-            field,
-            value);
-        return REDISMODULE_OK;
-    }
-    ctx->info = sdscatfmt(ctx->info,
-        "%s_%s:%s\r\n",
-        ctx->module->name,
-        field,
-        value);
-    return REDISMODULE_OK;
-}
-
-/* See RedisModule_InfoAddFieldString(). */
-int RM_InfoAddFieldDouble(RedisModuleInfoCtx *ctx, char *field, double value) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    if (ctx->in_dict_field) {
-        ctx->info = sdscatprintf(ctx->info,
-            "%s=%.17g,",
-            field,
-            value);
-        return REDISMODULE_OK;
-    }
-    ctx->info = sdscatprintf(ctx->info,
-        "%s_%s:%.17g\r\n",
-        ctx->module->name,
-        field,
-        value);
-    return REDISMODULE_OK;
-}
-
-/* See RedisModule_InfoAddFieldString(). */
-int RM_InfoAddFieldLongLong(RedisModuleInfoCtx *ctx, char *field, long long value) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    if (ctx->in_dict_field) {
-        ctx->info = sdscatfmt(ctx->info,
-            "%s=%I,",
-            field,
-            value);
-        return REDISMODULE_OK;
-    }
-    ctx->info = sdscatfmt(ctx->info,
-        "%s_%s:%I\r\n",
-        ctx->module->name,
-        field,
-        value);
-    return REDISMODULE_OK;
-}
-
-/* See RedisModule_InfoAddFieldString(). */
-int RM_InfoAddFieldULongLong(RedisModuleInfoCtx *ctx, char *field, unsigned long long value) {
-    if (!ctx->in_section)
-        return REDISMODULE_ERR;
-    if (ctx->in_dict_field) {
-        ctx->info = sdscatfmt(ctx->info,
-            "%s=%U,",
-            field,
-            value);
-        return REDISMODULE_OK;
-    }
-    ctx->info = sdscatfmt(ctx->info,
-        "%s_%s:%U\r\n",
-        ctx->module->name,
-        field,
-        value);
-    return REDISMODULE_OK;
-}
-
-/* Registers callback for the INFO command. The callback should add INFO fields
- * by calling the `RedisModule_InfoAddField*()` functions. */
-int RM_RegisterInfoFunc(RedisModuleCtx *ctx, RedisModuleInfoFunc cb) {
-    ctx->module->info_cb = cb;
-    return REDISMODULE_OK;
-}
-
-sds modulesCollectInfo(sds info, const char *section, int for_crash_report, int sections) {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        if (!module->info_cb)
-            continue;
-        RedisModuleInfoCtx info_ctx = {module, section, info, sections, 0, 0};
-        module->info_cb(&info_ctx, for_crash_report);
-        /* Implicitly end dicts (no way to handle errors, and we must add the newline). */
-        if (info_ctx.in_dict_field)
-            RM_InfoEndDictField(&info_ctx);
-        info = info_ctx.info;
-        sections = info_ctx.sections;
-    }
-    dictReleaseIterator(di);
-    return info;
-}
-
-/* Get information about the server similar to the one that returns from the
- * INFO command. This function takes an optional 'section' argument that may
- * be NULL. The return value holds the output and can be used with
- * RedisModule_ServerInfoGetField and alike to get the individual fields.
- * When done, it needs to be freed with RedisModule_FreeServerInfo or with the
- * automatic memory management mechanism if enabled. */
-RedisModuleServerInfoData *RM_GetServerInfo(RedisModuleCtx *ctx, const char *section) {
-    struct RedisModuleServerInfoData *d = zmalloc(sizeof(*d));
-    d->rax = raxNew();
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_INFO,d);
-    sds info = genRedisInfoString(section);
-    int totlines, i;
-    sds *lines = sdssplitlen(info, sdslen(info), "\r\n", 2, &totlines);
-    for(i=0; i<totlines; i++) {
-        sds line = lines[i];
-        if (line[0]=='#') continue;
-        char *sep = strchr(line, ':');
-        if (!sep) continue;
-        unsigned char *key = (unsigned char*)line;
-        size_t keylen = (intptr_t)sep-(intptr_t)line;
-        sds val = sdsnewlen(sep+1,sdslen(line)-((intptr_t)sep-(intptr_t)line)-1);
-        if (!raxTryInsert(d->rax,key,keylen,val,NULL))
-            sdsfree(val);
-    }
-    sdsfree(info);
-    sdsfreesplitres(lines,totlines);
-    return d;
-}
-
-/* Free data created with RM_GetServerInfo(). You need to pass the
- * context pointer 'ctx' only if the dictionary was created using the
- * context instead of passing NULL. */
-void RM_FreeServerInfo(RedisModuleCtx *ctx, RedisModuleServerInfoData *data) {
-    if (ctx != NULL) autoMemoryFreed(ctx,REDISMODULE_AM_INFO,data);
-    raxIterator ri;
-    raxStart(&ri,data->rax);
-    while(1) {
-        raxSeek(&ri,"^",NULL,0);
-        if (!raxNext(&ri)) break;
-        raxRemove(data->rax,(unsigned char*)ri.key,ri.key_len,NULL);
-        sdsfree(ri.data);
-    }
-    raxStop(&ri);
-    raxFree(data->rax);
-    zfree(data);
-}
-
-/* Get the value of a field from data collected with RM_GetServerInfo(). You
- * need to pass the context pointer 'ctx' only if you want to use auto memory
- * mechanism to release the returned string. Return value will be NULL if the
- * field was not found. */
-RedisModuleString *RM_ServerInfoGetField(RedisModuleCtx *ctx, RedisModuleServerInfoData *data, const char* field) {
-    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
-    if (val == raxNotFound) return NULL;
-    RedisModuleString *o = createStringObject(val,sdslen(val));
-    if (ctx != NULL) autoMemoryAdd(ctx,REDISMODULE_AM_STRING,o);
-    return o;
-}
-
-/* Similar to RM_ServerInfoGetField, but returns a char* which should not be freed but the caller. */
-const char *RM_ServerInfoGetFieldC(RedisModuleServerInfoData *data, const char* field) {
-    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
-    if (val == raxNotFound) return NULL;
-    return val;
-}
-
-/* Get the value of a field from data collected with RM_GetServerInfo(). If the
- * field is not found, or is not numerical or out of range, return value will be
- * 0, and the optional out_err argument will be set to REDISMODULE_ERR. */
-long long RM_ServerInfoGetFieldSigned(RedisModuleServerInfoData *data, const char* field, int *out_err) {
-    long long ll;
-    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
-    if (val == raxNotFound) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (!string2ll(val,sdslen(val),&ll)) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (out_err) *out_err = REDISMODULE_OK;
-    return ll;
-}
-
-/* Get the value of a field from data collected with RM_GetServerInfo(). If the
- * field is not found, or is not numerical or out of range, return value will be
- * 0, and the optional out_err argument will be set to REDISMODULE_ERR. */
-unsigned long long RM_ServerInfoGetFieldUnsigned(RedisModuleServerInfoData *data, const char* field, int *out_err) {
-    unsigned long long ll;
-    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
-    if (val == raxNotFound) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (!string2ull(val,&ll)) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (out_err) *out_err = REDISMODULE_OK;
-    return ll;
-}
-
-/* Get the value of a field from data collected with RM_GetServerInfo(). If the
- * field is not found, or is not a double, return value will be 0, and the
- * optional out_err argument will be set to REDISMODULE_ERR. */
-double RM_ServerInfoGetFieldDouble(RedisModuleServerInfoData *data, const char* field, int *out_err) {
-    double dbl;
-    sds val = raxFind(data->rax, (unsigned char *)field, strlen(field));
-    if (val == raxNotFound) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (!string2d(val,sdslen(val),&dbl)) {
-        if (out_err) *out_err = REDISMODULE_ERR;
-        return 0;
-    }
-    if (out_err) *out_err = REDISMODULE_OK;
-    return dbl;
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules utility APIs
- * -------------------------------------------------------------------------- */
-
-/* Return random bytes using SHA1 in counter mode with a /dev/urandom
- * initialized seed. This function is fast so can be used to generate
- * many bytes without any effect on the operating system entropy pool.
- * Currently this function is not thread safe. */
-void RM_GetRandomBytes(unsigned char *dst, size_t len) {
-    getRandomBytes(dst,len);
-}
-
-/* Like RedisModule_GetRandomBytes() but instead of setting the string to
- * random bytes the string is set to random characters in the in the
- * hex charset [0-9a-f]. */
-void RM_GetRandomHexChars(char *dst, size_t len) {
-    getRandomHexChars(dst,len);
-}
-
-/* --------------------------------------------------------------------------
- * ## Modules API exporting / importing
- * -------------------------------------------------------------------------- */
-
-/* This function is called by a module in order to export some API with a
- * given name. Other modules will be able to use this API by calling the
- * symmetrical function RM_GetSharedAPI() and casting the return value to
- * the right function pointer.
- *
- * The function will return REDISMODULE_OK if the name is not already taken,
- * otherwise REDISMODULE_ERR will be returned and no operation will be
- * performed.
- *
- * IMPORTANT: the apiname argument should be a string literal with static
- * lifetime. The API relies on the fact that it will always be valid in
- * the future. */
-int RM_ExportSharedAPI(RedisModuleCtx *ctx, const char *apiname, void *func) {
-    RedisModuleSharedAPI *sapi = zmalloc(sizeof(*sapi));
-    sapi->module = ctx->module;
-    sapi->func = func;
-    if (dictAdd(server.sharedapi, (char*)apiname, sapi) != DICT_OK) {
-        zfree(sapi);
-        return REDISMODULE_ERR;
-    }
-    return REDISMODULE_OK;
-}
-
-/* Request an exported API pointer. The return value is just a void pointer
- * that the caller of this function will be required to cast to the right
- * function pointer, so this is a private contract between modules.
- *
- * If the requested API is not available then NULL is returned. Because
- * modules can be loaded at different times with different order, this
- * function calls should be put inside some module generic API registering
- * step, that is called every time a module attempts to execute a
- * command that requires external APIs: if some API cannot be resolved, the
- * command should return an error.
- *
- * Here is an example:
- *
- *     int ... myCommandImplementation() {
- *        if (getExternalAPIs() == 0) {
- *             reply with an error here if we cannot have the APIs
- *        }
- *        // Use the API:
- *        myFunctionPointer(foo);
- *     }
- *
- * And the function registerAPI() is:
- *
- *     int getExternalAPIs(void) {
- *         static int api_loaded = 0;
- *         if (api_loaded != 0) return 1; // APIs already resolved.
- *
- *         myFunctionPointer = RedisModule_GetOtherModuleAPI("...");
- *         if (myFunctionPointer == NULL) return 0;
- *
- *         return 1;
- *     }
- */
-void *RM_GetSharedAPI(RedisModuleCtx *ctx, const char *apiname) {
-    dictEntry *de = dictFind(server.sharedapi, apiname);
-    if (de == NULL) return NULL;
-    RedisModuleSharedAPI *sapi = dictGetVal(de);
-    if (listSearchKey(sapi->module->usedby,ctx->module) == NULL) {
-        listAddNodeTail(sapi->module->usedby,ctx->module);
-        listAddNodeTail(ctx->module->using,sapi->module);
-    }
-    return sapi->func;
-}
-
-/* Remove all the APIs registered by the specified module. Usually you
- * want this when the module is going to be unloaded. This function
- * assumes that's caller responsibility to make sure the APIs are not
- * used by other modules.
- *
- * The number of unregistered APIs is returned. */
-int moduleUnregisterSharedAPI(RedisModule *module) {
-    int count = 0;
-    dictIterator *di = dictGetSafeIterator(server.sharedapi);
-    dictEntry *de;
-    while ((de = dictNext(di)) != NULL) {
-        const char *apiname = dictGetKey(de);
-        RedisModuleSharedAPI *sapi = dictGetVal(de);
-        if (sapi->module == module) {
-            dictDelete(server.sharedapi,apiname);
-            zfree(sapi);
-            count++;
-        }
-    }
-    dictReleaseIterator(di);
-    return count;
-}
-
-/* Remove the specified module as an user of APIs of ever other module.
- * This is usually called when a module is unloaded.
- *
- * Returns the number of modules this module was using APIs from. */
-int moduleUnregisterUsedAPI(RedisModule *module) {
-    listIter li;
-    listNode *ln;
-    int count = 0;
-
-    listRewind(module->using,&li);
-    while((ln = listNext(&li))) {
-        RedisModule *used = ln->value;
-        listNode *ln = listSearchKey(used->usedby,module);
-        if (ln) {
-            listDelNode(used->usedby,ln);
-            count++;
-        }
-    }
-    return count;
-}
-
-/* Unregister all filters registered by a module.
- * This is called when a module is being unloaded.
- * 
- * Returns the number of filters unregistered. */
-int moduleUnregisterFilters(RedisModule *module) {
-    listIter li;
-    listNode *ln;
-    int count = 0;
-
-    listRewind(module->filters,&li);
-    while((ln = listNext(&li))) {
-        RedisModuleCommandFilter *filter = ln->value;
-        listNode *ln = listSearchKey(moduleCommandFilters,filter);
-        if (ln) {
-            listDelNode(moduleCommandFilters,ln);
-            count++;
-        }
-        zfree(filter);
-    }
-    return count;
-}
-
-/* --------------------------------------------------------------------------
- * ## Module Command Filter API
- * -------------------------------------------------------------------------- */
-
-/* Register a new command filter function.
- *
- * Command filtering makes it possible for modules to extend Redis by plugging
- * into the execution flow of all commands.
- *
- * A registered filter gets called before Redis executes *any* command.  This
- * includes both core Redis commands and commands registered by any module.  The
- * filter applies in all execution paths including:
- *
- * 1. Invocation by a client.
- * 2. Invocation through `RedisModule_Call()` by any module.
- * 3. Invocation through Lua 'redis.call()`.
- * 4. Replication of a command from a master.
- *
- * The filter executes in a special filter context, which is different and more
- * limited than a RedisModuleCtx.  Because the filter affects any command, it
- * must be implemented in a very efficient way to reduce the performance impact
- * on Redis.  All Redis Module API calls that require a valid context (such as
- * `RedisModule_Call()`, `RedisModule_OpenKey()`, etc.) are not supported in a
- * filter context.
- *
- * The `RedisModuleCommandFilterCtx` can be used to inspect or modify the
- * executed command and its arguments.  As the filter executes before Redis
- * begins processing the command, any change will affect the way the command is
- * processed.  For example, a module can override Redis commands this way:
- *
- * 1. Register a `MODULE.SET` command which implements an extended version of
- *    the Redis `SET` command.
- * 2. Register a command filter which detects invocation of `SET` on a specific
- *    pattern of keys.  Once detected, the filter will replace the first
- *    argument from `SET` to `MODULE.SET`.
- * 3. When filter execution is complete, Redis considers the new command name
- *    and therefore executes the module's own command.
- *
- * Note that in the above use case, if `MODULE.SET` itself uses
- * `RedisModule_Call()` the filter will be applied on that call as well.  If
- * that is not desired, the `REDISMODULE_CMDFILTER_NOSELF` flag can be set when
- * registering the filter.
- *
- * The `REDISMODULE_CMDFILTER_NOSELF` flag prevents execution flows that
- * originate from the module's own `RM_Call()` from reaching the filter.  This
- * flag is effective for all execution flows, including nested ones, as long as
- * the execution begins from the module's command context or a thread-safe
- * context that is associated with a blocking command.
- *
- * Detached thread-safe contexts are *not* associated with the module and cannot
- * be protected by this flag.
- *
- * If multiple filters are registered (by the same or different modules), they
- * are executed in the order of registration.
- */
-
-RedisModuleCommandFilter *RM_RegisterCommandFilter(RedisModuleCtx *ctx, RedisModuleCommandFilterFunc callback, int flags) {
-    RedisModuleCommandFilter *filter = zmalloc(sizeof(*filter));
-    filter->module = ctx->module;
-    filter->callback = callback;
-    filter->flags = flags;
-
-    listAddNodeTail(moduleCommandFilters, filter);
-    listAddNodeTail(ctx->module->filters, filter);
-    return filter;
-}
-
-/* Unregister a command filter.
- */
-int RM_UnregisterCommandFilter(RedisModuleCtx *ctx, RedisModuleCommandFilter *filter) {
-    listNode *ln;
-
-    /* A module can only remove its own filters */
-    if (filter->module != ctx->module) return REDISMODULE_ERR;
-
-    ln = listSearchKey(moduleCommandFilters,filter);
-    if (!ln) return REDISMODULE_ERR;
-    listDelNode(moduleCommandFilters,ln);
-
-    ln = listSearchKey(ctx->module->filters,filter);
-    if (!ln) return REDISMODULE_ERR;    /* Shouldn't happen */
-    listDelNode(ctx->module->filters,ln);
-
-    zfree(filter);
-
-    return REDISMODULE_OK;
-}
-
-void moduleCallCommandFilters(client *c) {
-    if (listLength(moduleCommandFilters) == 0) return;
-
-    listIter li;
-    listNode *ln;
-    listRewind(moduleCommandFilters,&li);
-
-    RedisModuleCommandFilterCtx filter = {
-        .argv = c->argv,
-        .argc = c->argc
-    };
-
-    while((ln = listNext(&li))) {
-        RedisModuleCommandFilter *f = ln->value;
-
-        /* Skip filter if REDISMODULE_CMDFILTER_NOSELF is set and module is
-         * currently processing a command.
-         */
-        if ((f->flags & REDISMODULE_CMDFILTER_NOSELF) && f->module->in_call) continue;
-
-        /* Call filter */
-        f->callback(&filter);
-    }
-
-    c->argv = filter.argv;
-    c->argc = filter.argc;
-}
-
-/* Return the number of arguments a filtered command has.  The number of
- * arguments include the command itself.
- */
-int RM_CommandFilterArgsCount(RedisModuleCommandFilterCtx *fctx)
-{
-    return fctx->argc;
-}
-
-/* Return the specified command argument.  The first argument (position 0) is
- * the command itself, and the rest are user-provided args.
- */
-const RedisModuleString *RM_CommandFilterArgGet(RedisModuleCommandFilterCtx *fctx, int pos)
-{
-    if (pos < 0 || pos >= fctx->argc) return NULL;
-    return fctx->argv[pos];
-}
-
-/* Modify the filtered command by inserting a new argument at the specified
- * position.  The specified RedisModuleString argument may be used by Redis
- * after the filter context is destroyed, so it must not be auto-memory
- * allocated, freed or used elsewhere.
- */
-int RM_CommandFilterArgInsert(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg)
-{
-    int i;
-
-    if (pos < 0 || pos > fctx->argc) return REDISMODULE_ERR;
-
-    fctx->argv = zrealloc(fctx->argv, (fctx->argc+1)*sizeof(RedisModuleString *));
-    for (i = fctx->argc; i > pos; i--) {
-        fctx->argv[i] = fctx->argv[i-1];
-    }
-    fctx->argv[pos] = arg;
-    fctx->argc++;
-
-    return REDISMODULE_OK;
-}
-
-/* Modify the filtered command by replacing an existing argument with a new one.
- * The specified RedisModuleString argument may be used by Redis after the
- * filter context is destroyed, so it must not be auto-memory allocated, freed
- * or used elsewhere.
- */
-int RM_CommandFilterArgReplace(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg)
-{
-    if (pos < 0 || pos >= fctx->argc) return REDISMODULE_ERR;
-
-    decrRefCount(fctx->argv[pos]);
-    fctx->argv[pos] = arg;
-
-    return REDISMODULE_OK;
-}
-
-/* Modify the filtered command by deleting an argument at the specified
- * position.
- */
-int RM_CommandFilterArgDelete(RedisModuleCommandFilterCtx *fctx, int pos)
-{
-    int i;
-    if (pos < 0 || pos >= fctx->argc) return REDISMODULE_ERR;
-
-    decrRefCount(fctx->argv[pos]);
-    for (i = pos; i < fctx->argc-1; i++) {
-        fctx->argv[i] = fctx->argv[i+1];
-    }
-    fctx->argc--;
-
-    return REDISMODULE_OK;
-}
-
-/* For a given pointer allocated via RedisModule_Alloc() or
- * RedisModule_Realloc(), return the amount of memory allocated for it.
- * Note that this may be different (larger) than the memory we allocated
- * with the allocation calls, since sometimes the underlying allocator
- * will allocate more memory.
- */
-size_t RM_MallocSize(void* ptr){
-    return zmalloc_size(ptr);
-}
-
-/* Return the a number between 0 to 1 indicating the amount of memory
- * currently used, relative to the Redis "maxmemory" configuration.
- *
- * * 0 - No memory limit configured.
- * * Between 0 and 1 - The percentage of the memory used normalized in 0-1 range.
- * * Exactly 1 - Memory limit reached.
- * * Greater 1 - More memory used than the configured limit.
- */
-float RM_GetUsedMemoryRatio(){
-    float level;
-    getMaxmemoryState(NULL, NULL, NULL, &level);
-    return level;
-}
-
-/* --------------------------------------------------------------------------
- * ## Scanning keyspace and hashes
- * -------------------------------------------------------------------------- */
-
-typedef void (*RedisModuleScanCB)(RedisModuleCtx *ctx, RedisModuleString *keyname, RedisModuleKey *key, void *privdata);
-typedef struct {
-    RedisModuleCtx *ctx;
-    void* user_data;
-    RedisModuleScanCB fn;
-} ScanCBData;
-
-typedef struct RedisModuleScanCursor{
-    int cursor;
-    int done;
-}RedisModuleScanCursor;
-
-static void moduleScanCallback(void *privdata, const dictEntry *de) {
-    ScanCBData *data = privdata;
-    sds key = dictGetKey(de);
-    robj* val = dictGetVal(de);
-    RedisModuleString *keyname = createObject(OBJ_STRING,sdsdup(key));
-
-    /* Setup the key handle. */
-    RedisModuleKey kp = {0};
-    moduleInitKey(&kp, data->ctx, keyname, val, REDISMODULE_READ);
-
-    data->fn(data->ctx, keyname, &kp, data->user_data);
-
-    moduleCloseKey(&kp);
-    decrRefCount(keyname);
-}
-
-/* Create a new cursor to be used with RedisModule_Scan */
-RedisModuleScanCursor *RM_ScanCursorCreate() {
-    RedisModuleScanCursor* cursor = zmalloc(sizeof(*cursor));
-    cursor->cursor = 0;
-    cursor->done = 0;
-    return cursor;
-}
-
-/* Restart an existing cursor. The keys will be rescanned. */
-void RM_ScanCursorRestart(RedisModuleScanCursor *cursor) {
-    cursor->cursor = 0;
-    cursor->done = 0;
-}
-
-/* Destroy the cursor struct. */
-void RM_ScanCursorDestroy(RedisModuleScanCursor *cursor) {
-    zfree(cursor);
-}
-
-/* Scan API that allows a module to scan all the keys and value in
- * the selected db.
- *
- * Callback for scan implementation.
- *
- *     void scan_callback(RedisModuleCtx *ctx, RedisModuleString *keyname,
- *                        RedisModuleKey *key, void *privdata);
- *
- * - `ctx`: the redis module context provided to for the scan.
- * - `keyname`: owned by the caller and need to be retained if used after this
- *   function.
- * - `key`: holds info on the key and value, it is provided as best effort, in
- *   some cases it might be NULL, in which case the user should (can) use
- *   RedisModule_OpenKey() (and CloseKey too).
- *   when it is provided, it is owned by the caller and will be free when the
- *   callback returns.
- * - `privdata`: the user data provided to RedisModule_Scan().
- *
- * The way it should be used:
- *
- *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
- *      while(RedisModule_Scan(ctx, c, callback, privateData));
- *      RedisModule_ScanCursorDestroy(c);
- *
- * It is also possible to use this API from another thread while the lock
- * is acquired during the actuall call to RM_Scan:
- *
- *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
- *      RedisModule_ThreadSafeContextLock(ctx);
- *      while(RedisModule_Scan(ctx, c, callback, privateData)){
- *          RedisModule_ThreadSafeContextUnlock(ctx);
- *          // do some background job
- *          RedisModule_ThreadSafeContextLock(ctx);
- *      }
- *      RedisModule_ScanCursorDestroy(c);
- *
- * The function will return 1 if there are more elements to scan and
- * 0 otherwise, possibly setting errno if the call failed.
- *
- * It is also possible to restart an existing cursor using RM_ScanCursorRestart.
- *
- * IMPORTANT: This API is very similar to the Redis SCAN command from the
- * point of view of the guarantees it provides. This means that the API
- * may report duplicated keys, but guarantees to report at least one time
- * every key that was there from the start to the end of the scanning process.
- *
- * NOTE: If you do database changes within the callback, you should be aware
- * that the internal state of the database may change. For instance it is safe
- * to delete or modify the current key, but may not be safe to delete any
- * other key.
- * Moreover playing with the Redis keyspace while iterating may have the
- * effect of returning more duplicates. A safe pattern is to store the keys
- * names you want to modify elsewhere, and perform the actions on the keys
- * later when the iteration is complete. However this can cost a lot of
- * memory, so it may make sense to just operate on the current key when
- * possible during the iteration, given that this is safe. */
-int RM_Scan(RedisModuleCtx *ctx, RedisModuleScanCursor *cursor, RedisModuleScanCB fn, void *privdata) {
-    if (cursor->done) {
-        errno = ENOENT;
-        return 0;
-    }
-    int ret = 1;
-    ScanCBData data = { ctx, privdata, fn };
-    cursor->cursor = dictScan(ctx->client->db->dict, cursor->cursor, moduleScanCallback, NULL, &data);
-    if (cursor->cursor == 0) {
-        cursor->done = 1;
-        ret = 0;
-    }
-    errno = 0;
-    return ret;
-}
-
-typedef void (*RedisModuleScanKeyCB)(RedisModuleKey *key, RedisModuleString *field, RedisModuleString *value, void *privdata);
-typedef struct {
-    RedisModuleKey *key;
-    void* user_data;
-    RedisModuleScanKeyCB fn;
-} ScanKeyCBData;
-
-static void moduleScanKeyCallback(void *privdata, const dictEntry *de) {
-    ScanKeyCBData *data = privdata;
-    sds key = dictGetKey(de);
-    robj *o = data->key->value;
-    robj *field = createStringObject(key, sdslen(key));
-    robj *value = NULL;
-    if (o->type == OBJ_SET) {
-        value = NULL;
-    } else if (o->type == OBJ_HASH) {
-        sds val = dictGetVal(de);
-        value = createStringObject(val, sdslen(val));
-    } else if (o->type == OBJ_ZSET) {
-        double *val = (double*)dictGetVal(de);
-        value = createStringObjectFromLongDouble(*val, 0);
-    }
-
-    data->fn(data->key, field, value, data->user_data);
-    decrRefCount(field);
-    if (value) decrRefCount(value);
-}
-
-/* Scan api that allows a module to scan the elements in a hash, set or sorted set key
- *
- * Callback for scan implementation.
- *
- *     void scan_callback(RedisModuleKey *key, RedisModuleString* field, RedisModuleString* value, void *privdata);
- *
- * - key - the redis key context provided to for the scan.
- * - field - field name, owned by the caller and need to be retained if used
- *   after this function.
- * - value - value string or NULL for set type, owned by the caller and need to
- *   be retained if used after this function.
- * - privdata - the user data provided to RedisModule_ScanKey.
- *
- * The way it should be used:
- *
- *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
- *      RedisModuleKey *key = RedisModule_OpenKey(...)
- *      while(RedisModule_ScanKey(key, c, callback, privateData));
- *      RedisModule_CloseKey(key);
- *      RedisModule_ScanCursorDestroy(c);
- *
- * It is also possible to use this API from another thread while the lock is acquired during
- * the actuall call to RM_ScanKey, and re-opening the key each time:
- *
- *      RedisModuleCursor *c = RedisModule_ScanCursorCreate();
- *      RedisModule_ThreadSafeContextLock(ctx);
- *      RedisModuleKey *key = RedisModule_OpenKey(...)
- *      while(RedisModule_ScanKey(ctx, c, callback, privateData)){
- *          RedisModule_CloseKey(key);
- *          RedisModule_ThreadSafeContextUnlock(ctx);
- *          // do some background job
- *          RedisModule_ThreadSafeContextLock(ctx);
- *          RedisModuleKey *key = RedisModule_OpenKey(...)
- *      }
- *      RedisModule_CloseKey(key);
- *      RedisModule_ScanCursorDestroy(c);
- *
- * The function will return 1 if there are more elements to scan and 0 otherwise,
- * possibly setting errno if the call failed.
- * It is also possible to restart an existing cursor using RM_ScanCursorRestart.
- *
- * NOTE: Certain operations are unsafe while iterating the object. For instance
- * while the API guarantees to return at least one time all the elements that
- * are present in the data structure consistently from the start to the end
- * of the iteration (see HSCAN and similar commands documentation), the more
- * you play with the elements, the more duplicates you may get. In general
- * deleting the current element of the data structure is safe, while removing
- * the key you are iterating is not safe. */
-int RM_ScanKey(RedisModuleKey *key, RedisModuleScanCursor *cursor, RedisModuleScanKeyCB fn, void *privdata) {
-    if (key == NULL || key->value == NULL) {
-        errno = EINVAL;
-        return 0;
-    }
-    dict *ht = NULL;
-    robj *o = key->value;
-    if (o->type == OBJ_SET) {
-        if (o->encoding == OBJ_ENCODING_HT)
-            ht = o->ptr;
-    } else if (o->type == OBJ_HASH) {
-        if (o->encoding == OBJ_ENCODING_HT)
-            ht = o->ptr;
-    } else if (o->type == OBJ_ZSET) {
-        if (o->encoding == OBJ_ENCODING_SKIPLIST)
-            ht = ((zset *)o->ptr)->dict;
-    } else {
-        errno = EINVAL;
-        return 0;
-    }
-    if (cursor->done) {
-        errno = ENOENT;
-        return 0;
-    }
-    int ret = 1;
-    if (ht) {
-        ScanKeyCBData data = { key, privdata, fn };
-        cursor->cursor = dictScan(ht, cursor->cursor, moduleScanKeyCallback, NULL, &data);
-        if (cursor->cursor == 0) {
-            cursor->done = 1;
-            ret = 0;
-        }
-    } else if (o->type == OBJ_SET && o->encoding == OBJ_ENCODING_INTSET) {
-        int pos = 0;
-        int64_t ll;
-        while(intsetGet(o->ptr,pos++,&ll)) {
-            robj *field = createObject(OBJ_STRING,sdsfromlonglong(ll));
-            fn(key, field, NULL, privdata);
-            decrRefCount(field);
-        }
-        cursor->cursor = 1;
-        cursor->done = 1;
-        ret = 0;
-    } else if (o->type == OBJ_HASH || o->type == OBJ_ZSET) {
-        unsigned char *p = ziplistIndex(o->ptr,0);
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vll;
-        while(p) {
-            ziplistGet(p,&vstr,&vlen,&vll);
-            robj *field = (vstr != NULL) ?
-                createStringObject((char*)vstr,vlen) :
-                createObject(OBJ_STRING,sdsfromlonglong(vll));
-            p = ziplistNext(o->ptr,p);
-            ziplistGet(p,&vstr,&vlen,&vll);
-            robj *value = (vstr != NULL) ?
-                createStringObject((char*)vstr,vlen) :
-                createObject(OBJ_STRING,sdsfromlonglong(vll));
-            fn(key, field, value, privdata);
-            p = ziplistNext(o->ptr,p);
-            decrRefCount(field);
-            decrRefCount(value);
-        }
-        cursor->cursor = 1;
-        cursor->done = 1;
-        ret = 0;
-    }
-    errno = 0;
-    return ret;
-}
-
-
-/* --------------------------------------------------------------------------
- * ## Module fork API
- * -------------------------------------------------------------------------- */
-
-/* Create a background child process with the current frozen snaphost of the
- * main process where you can do some processing in the background without
- * affecting / freezing the traffic and no need for threads and GIL locking.
- * Note that Redis allows for only one concurrent fork.
- * When the child wants to exit, it should call RedisModule_ExitFromChild.
- * If the parent wants to kill the child it should call RedisModule_KillForkChild
- * The done handler callback will be executed on the parent process when the
- * child existed (but not when killed)
- * Return: -1 on failure, on success the parent process will get a positive PID
- * of the child, and the child process will get 0.
- */
-int RM_Fork(RedisModuleForkDoneHandler cb, void *user_data) {
-    pid_t childpid;
-
-    if ((childpid = redisFork(CHILD_TYPE_MODULE)) == 0) {
-        /* Child */
-        redisSetProcTitle("redis-module-fork");
-    } else if (childpid == -1) {
-        serverLog(LL_WARNING,"Can't fork for module: %s", strerror(errno));
-    } else {
-        /* Parent */
-        moduleForkInfo.done_handler = cb;
-        moduleForkInfo.done_handler_user_data = user_data;
-        serverLog(LL_VERBOSE, "Module fork started pid: %ld ", (long) childpid);
-    }
-    return childpid;
-}
-
-/* The module is advised to call this function from the fork child once in a while,
- * so that it can report progress and COW memory to the parent which will be
- * reported in INFO.
- * The `progress` argument should between 0 and 1, or -1 when not available. */
-void RM_SendChildHeartbeat(double progress) {
-    sendChildInfoGeneric(CHILD_INFO_TYPE_CURRENT_INFO, 0, progress, "Module fork");
-}
-
-/* Call from the child process when you want to terminate it.
- * retcode will be provided to the done handler executed on the parent process.
- */
-int RM_ExitFromChild(int retcode) {
-    sendChildCowInfo(CHILD_INFO_TYPE_MODULE_COW_SIZE, "Module fork");
-    exitFromChild(retcode);
-    return REDISMODULE_OK;
-}
-
-/* Kill the active module forked child, if there is one active and the
- * pid matches, and returns C_OK. Otherwise if there is no active module
- * child or the pid does not match, return C_ERR without doing anything. */
-int TerminateModuleForkChild(int child_pid, int wait) {
-    /* Module child should be active and pid should match. */
-    if (server.child_type != CHILD_TYPE_MODULE ||
-        server.child_pid != child_pid) return C_ERR;
-
-    int statloc;
-    serverLog(LL_VERBOSE,"Killing running module fork child: %ld",
-        (long) server.child_pid);
-    if (kill(server.child_pid,SIGUSR1) != -1 && wait) {
-        while(waitpid(server.child_pid, &statloc, 0) !=
-              server.child_pid);
-    }
-    /* Reset the buffer accumulating changes while the child saves. */
-    resetChildState();
-    moduleForkInfo.done_handler = NULL;
-    moduleForkInfo.done_handler_user_data = NULL;
-    return C_OK;
-}
-
-/* Can be used to kill the forked child process from the parent process.
- * child_pid would be the return value of RedisModule_Fork. */
-int RM_KillForkChild(int child_pid) {
-    /* Kill module child, wait for child exit. */
-    if (TerminateModuleForkChild(child_pid,1) == C_OK)
-        return REDISMODULE_OK;
-    else
-        return REDISMODULE_ERR;
-}
-
-void ModuleForkDoneHandler(int exitcode, int bysignal) {
-    serverLog(LL_NOTICE,
-        "Module fork exited pid: %ld, retcode: %d, bysignal: %d",
-        (long) server.child_pid, exitcode, bysignal);
-    if (moduleForkInfo.done_handler) {
-        moduleForkInfo.done_handler(exitcode, bysignal,
-            moduleForkInfo.done_handler_user_data);
-    }
-
-    moduleForkInfo.done_handler = NULL;
-    moduleForkInfo.done_handler_user_data = NULL;
-}
-
-/* --------------------------------------------------------------------------
- * ## Server hooks implementation
- * -------------------------------------------------------------------------- */
-
-/* Register to be notified, via a callback, when the specified server event
- * happens. The callback is called with the event as argument, and an additional
- * argument which is a void pointer and should be cased to a specific type
- * that is event-specific (but many events will just use NULL since they do not
- * have additional information to pass to the callback).
- *
- * If the callback is NULL and there was a previous subscription, the module
- * will be unsubscribed. If there was a previous subscription and the callback
- * is not null, the old callback will be replaced with the new one.
- *
- * The callback must be of this type:
- *
- *     int (*RedisModuleEventCallback)(RedisModuleCtx *ctx,
- *                                     RedisModuleEvent eid,
- *                                     uint64_t subevent,
- *                                     void *data);
- *
- * The 'ctx' is a normal Redis module context that the callback can use in
- * order to call other modules APIs. The 'eid' is the event itself, this
- * is only useful in the case the module subscribed to multiple events: using
- * the 'id' field of this structure it is possible to check if the event
- * is one of the events we registered with this callback. The 'subevent' field
- * depends on the event that fired.
- *
- * Finally the 'data' pointer may be populated, only for certain events, with
- * more relevant data.
- *
- * Here is a list of events you can use as 'eid' and related sub events:
- *
- * * RedisModuleEvent_ReplicationRoleChanged:
- *
- *     This event is called when the instance switches from master
- *     to replica or the other way around, however the event is
- *     also called when the replica remains a replica but starts to
- *     replicate with a different master.
- *
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_REPLROLECHANGED_NOW_MASTER`
- *     * `REDISMODULE_SUBEVENT_REPLROLECHANGED_NOW_REPLICA`
- *
- *     The 'data' field can be casted by the callback to a
- *     `RedisModuleReplicationInfo` structure with the following fields:
- *
- *         int master; // true if master, false if replica
- *         char *masterhost; // master instance hostname for NOW_REPLICA
- *         int masterport; // master instance port for NOW_REPLICA
- *         char *replid1; // Main replication ID
- *         char *replid2; // Secondary replication ID
- *         uint64_t repl1_offset; // Main replication offset
- *         uint64_t repl2_offset; // Offset of replid2 validity
- *
- * * RedisModuleEvent_Persistence
- *
- *     This event is called when RDB saving or AOF rewriting starts
- *     and ends. The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START`
- *     * `REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START`
- *     * `REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START`
- *     * `REDISMODULE_SUBEVENT_PERSISTENCE_ENDED`
- *     * `REDISMODULE_SUBEVENT_PERSISTENCE_FAILED`
- *
- *     The above events are triggered not just when the user calls the
- *     relevant commands like BGSAVE, but also when a saving operation
- *     or AOF rewriting occurs because of internal server triggers.
- *     The SYNC_RDB_START sub events are happening in the forground due to
- *     SAVE command, FLUSHALL, or server shutdown, and the other RDB and
- *     AOF sub events are executed in a background fork child, so any
- *     action the module takes can only affect the generated AOF or RDB,
- *     but will not be reflected in the parent process and affect connected
- *     clients and commands. Also note that the AOF_START sub event may end
- *     up saving RDB content in case of an AOF with rdb-preamble.
- *
- * * RedisModuleEvent_FlushDB
- *
- *     The FLUSHALL, FLUSHDB or an internal flush (for instance
- *     because of replication, after the replica synchronization)
- *     happened. The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_FLUSHDB_START`
- *     * `REDISMODULE_SUBEVENT_FLUSHDB_END`
- *
- *     The data pointer can be casted to a RedisModuleFlushInfo
- *     structure with the following fields:
- *
- *         int32_t async;  // True if the flush is done in a thread.
- *                         // See for instance FLUSHALL ASYNC.
- *                         // In this case the END callback is invoked
- *                         // immediately after the database is put
- *                         // in the free list of the thread.
- *         int32_t dbnum;  // Flushed database number, -1 for all the DBs
- *                         // in the case of the FLUSHALL operation.
- *
- *     The start event is called *before* the operation is initated, thus
- *     allowing the callback to call DBSIZE or other operation on the
- *     yet-to-free keyspace.
- *
- * * RedisModuleEvent_Loading
- *
- *     Called on loading operations: at startup when the server is
- *     started, but also after a first synchronization when the
- *     replica is loading the RDB file from the master.
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_LOADING_RDB_START`
- *     * `REDISMODULE_SUBEVENT_LOADING_AOF_START`
- *     * `REDISMODULE_SUBEVENT_LOADING_REPL_START`
- *     * `REDISMODULE_SUBEVENT_LOADING_ENDED`
- *     * `REDISMODULE_SUBEVENT_LOADING_FAILED`
- *
- *     Note that AOF loading may start with an RDB data in case of
- *     rdb-preamble, in which case you'll only receive an AOF_START event.
- *
- * * RedisModuleEvent_ClientChange
- *
- *     Called when a client connects or disconnects.
- *     The data pointer can be casted to a RedisModuleClientInfo
- *     structure, documented in RedisModule_GetClientInfoById().
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED`
- *     * `REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED`
- *
- * * RedisModuleEvent_Shutdown
- *
- *     The server is shutting down. No subevents are available.
- *
- * * RedisModuleEvent_ReplicaChange
- *
- *     This event is called when the instance (that can be both a
- *     master or a replica) get a new online replica, or lose a
- *     replica since it gets disconnected.
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE`
- *     * `REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE`
- *
- *     No additional information is available so far: future versions
- *     of Redis will have an API in order to enumerate the replicas
- *     connected and their state.
- *
- * * RedisModuleEvent_CronLoop
- *
- *     This event is called every time Redis calls the serverCron()
- *     function in order to do certain bookkeeping. Modules that are
- *     required to do operations from time to time may use this callback.
- *     Normally Redis calls this function 10 times per second, but
- *     this changes depending on the "hz" configuration.
- *     No sub events are available.
- *
- *     The data pointer can be casted to a RedisModuleCronLoop
- *     structure with the following fields:
- *
- *         int32_t hz;  // Approximate number of events per second.
- *
- * * RedisModuleEvent_MasterLinkChange
- *
- *     This is called for replicas in order to notify when the
- *     replication link becomes functional (up) with our master,
- *     or when it goes down. Note that the link is not considered
- *     up when we just connected to the master, but only if the
- *     replication is happening correctly.
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_MASTER_LINK_UP`
- *     * `REDISMODULE_SUBEVENT_MASTER_LINK_DOWN`
- *
- * * RedisModuleEvent_ModuleChange
- *
- *     This event is called when a new module is loaded or one is unloaded.
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_MODULE_LOADED`
- *     * `REDISMODULE_SUBEVENT_MODULE_UNLOADED`
- *
- *     The data pointer can be casted to a RedisModuleModuleChange
- *     structure with the following fields:
- *
- *         const char* module_name;  // Name of module loaded or unloaded.
- *         int32_t module_version;  // Module version.
- *
- * * RedisModuleEvent_LoadingProgress
- *
- *     This event is called repeatedly called while an RDB or AOF file
- *     is being loaded.
- *     The following sub events are availble:
- *
- *     * `REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB`
- *     * `REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF`
- *
- *     The data pointer can be casted to a RedisModuleLoadingProgress
- *     structure with the following fields:
- *
- *         int32_t hz;  // Approximate number of events per second.
- *         int32_t progress;  // Approximate progress between 0 and 1024,
- *                            // or -1 if unknown.
- *
- * * RedisModuleEvent_SwapDB
- *
- *     This event is called when a SWAPDB command has been successfully
- *     Executed.
- *     For this event call currently there is no subevents available.
- *
- *     The data pointer can be casted to a RedisModuleSwapDbInfo
- *     structure with the following fields:
- *
- *         int32_t dbnum_first;    // Swap Db first dbnum
- *         int32_t dbnum_second;   // Swap Db second dbnum
- *
- * * RedisModuleEvent_ReplBackup
- *
- *     Called when diskless-repl-load config is set to swapdb,
- *     And redis needs to backup the the current database for the
- *     possibility to be restored later. A module with global data and
- *     maybe with aux_load and aux_save callbacks may need to use this
- *     notification to backup / restore / discard its globals.
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE`
- *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE`
- *     * `REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD`
- *
- * * RedisModuleEvent_ForkChild
- *
- *     Called when a fork child (AOFRW, RDBSAVE, module fork...) is born/dies
- *     The following sub events are available:
- *
- *     * `REDISMODULE_SUBEVENT_FORK_CHILD_BORN`
- *     * `REDISMODULE_SUBEVENT_FORK_CHILD_DIED`
- *
- * The function returns REDISMODULE_OK if the module was successfully subscribed
- * for the specified event. If the API is called from a wrong context or unsupported event
- * is given then REDISMODULE_ERR is returned. */
-int RM_SubscribeToServerEvent(RedisModuleCtx *ctx, RedisModuleEvent event, RedisModuleEventCallback callback) {
-    RedisModuleEventListener *el;
-
-    /* Protect in case of calls from contexts without a module reference. */
-    if (ctx->module == NULL) return REDISMODULE_ERR;
-    if (event.id >= _REDISMODULE_EVENT_NEXT) return REDISMODULE_ERR;
-
-    /* Search an event matching this module and event ID. */
-    listIter li;
-    listNode *ln;
-    listRewind(RedisModule_EventListeners,&li);
-    while((ln = listNext(&li))) {
-        el = ln->value;
-        if (el->module == ctx->module && el->event.id == event.id)
-            break; /* Matching event found. */
-    }
-
-    /* Modify or remove the event listener if we already had one. */
-    if (ln) {
-        if (callback == NULL) {
-            listDelNode(RedisModule_EventListeners,ln);
-            zfree(el);
-        } else {
-            el->callback = callback; /* Update the callback with the new one. */
-        }
-        return REDISMODULE_OK;
-    }
-
-    /* No event found, we need to add a new one. */
-    el = zmalloc(sizeof(*el));
-    el->module = ctx->module;
-    el->event = event;
-    el->callback = callback;
-    listAddNodeTail(RedisModule_EventListeners,el);
-    return REDISMODULE_OK;
-}
-
-/**
- * For a given server event and subevent, return zero if the
- * subevent is not supported and non-zero otherwise.
- */
-int RM_IsSubEventSupported(RedisModuleEvent event, int64_t subevent) {
-    switch (event.id) {
-    case REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED:
-        return subevent < _REDISMODULE_EVENT_REPLROLECHANGED_NEXT;
-    case REDISMODULE_EVENT_PERSISTENCE:
-        return subevent < _REDISMODULE_SUBEVENT_PERSISTENCE_NEXT;
-    case REDISMODULE_EVENT_FLUSHDB:
-        return subevent < _REDISMODULE_SUBEVENT_FLUSHDB_NEXT;
-    case REDISMODULE_EVENT_LOADING:
-        return subevent < _REDISMODULE_SUBEVENT_LOADING_NEXT;
-    case REDISMODULE_EVENT_CLIENT_CHANGE:
-        return subevent < _REDISMODULE_SUBEVENT_CLIENT_CHANGE_NEXT;
-    case REDISMODULE_EVENT_SHUTDOWN:
-        return subevent < _REDISMODULE_SUBEVENT_SHUTDOWN_NEXT;
-    case REDISMODULE_EVENT_REPLICA_CHANGE:
-        return subevent < _REDISMODULE_EVENT_REPLROLECHANGED_NEXT;
-    case REDISMODULE_EVENT_MASTER_LINK_CHANGE:
-        return subevent < _REDISMODULE_SUBEVENT_MASTER_NEXT;
-    case REDISMODULE_EVENT_CRON_LOOP:
-        return subevent < _REDISMODULE_SUBEVENT_CRON_LOOP_NEXT;
-    case REDISMODULE_EVENT_MODULE_CHANGE:
-        return subevent < _REDISMODULE_SUBEVENT_MODULE_NEXT;
-    case REDISMODULE_EVENT_LOADING_PROGRESS:
-        return subevent < _REDISMODULE_SUBEVENT_LOADING_PROGRESS_NEXT;
-    case REDISMODULE_EVENT_SWAPDB:
-        return subevent < _REDISMODULE_SUBEVENT_SWAPDB_NEXT;
-    case REDISMODULE_EVENT_REPL_BACKUP:
-        return subevent < _REDISMODULE_SUBEVENT_REPL_BACKUP_NEXT;
-    case REDISMODULE_EVENT_FORK_CHILD:
-        return subevent < _REDISMODULE_SUBEVENT_FORK_CHILD_NEXT;
-    default:
-        break;
-    }
-    return 0;
-}
-
-/* This is called by the Redis internals every time we want to fire an
- * event that can be interceppted by some module. The pointer 'data' is useful
- * in order to populate the event-specific structure when needed, in order
- * to return the structure with more information to the callback.
- *
- * 'eid' and 'subid' are just the main event ID and the sub event associated
- * with the event, depending on what exactly happened. */
-void moduleFireServerEvent(uint64_t eid, int subid, void *data) {
-    /* Fast path to return ASAP if there is nothing to do, avoiding to
-     * setup the iterator and so forth: we want this call to be extremely
-     * cheap if there are no registered modules. */
-    if (listLength(RedisModule_EventListeners) == 0) return;
-
-    int real_client_used = 0;
-    listIter li;
-    listNode *ln;
-    listRewind(RedisModule_EventListeners,&li);
-    while((ln = listNext(&li))) {
-        RedisModuleEventListener *el = ln->value;
-        if (el->event.id == eid) {
-            RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-            ctx.module = el->module;
-
-            if (eid == REDISMODULE_EVENT_CLIENT_CHANGE) {
-                /* In the case of client changes, we're pushing the real client
-                 * so the event handler can mutate it if needed. For example,
-                 * to change its authentication state in a way that does not
-                 * depend on specific commands executed later.
-                 */
-                ctx.client = (client *) data;
-                real_client_used = 1;
-            } else if (ModulesInHooks == 0) {
-                ctx.client = moduleFreeContextReusedClient;
-            } else {
-                ctx.client = createClient(NULL);
-                ctx.client->flags |= CLIENT_MODULE;
-                ctx.client->user = NULL; /* Root user. */
-            }
-
-            void *moduledata = NULL;
-            RedisModuleClientInfoV1 civ1;
-            RedisModuleReplicationInfoV1 riv1;
-            RedisModuleModuleChangeV1 mcv1;
-            /* Start at DB zero by default when calling the handler. It's
-             * up to the specific event setup to change it when it makes
-             * sense. For instance for FLUSHDB events we select the correct
-             * DB automatically. */
-            selectDb(ctx.client, 0);
-
-            /* Event specific context and data pointer setup. */
-            if (eid == REDISMODULE_EVENT_CLIENT_CHANGE) {
-                modulePopulateClientInfoStructure(&civ1,data,
-                                                  el->event.dataver);
-                moduledata = &civ1;
-            } else if (eid == REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED) {
-                modulePopulateReplicationInfoStructure(&riv1,el->event.dataver);
-                moduledata = &riv1;
-            } else if (eid == REDISMODULE_EVENT_FLUSHDB) {
-                moduledata = data;
-                RedisModuleFlushInfoV1 *fi = data;
-                if (fi->dbnum != -1)
-                    selectDb(ctx.client, fi->dbnum);
-            } else if (eid == REDISMODULE_EVENT_MODULE_CHANGE) {
-                RedisModule *m = data;
-                if (m == el->module)
-                    continue;
-                mcv1.version = REDISMODULE_MODULE_CHANGE_VERSION;
-                mcv1.module_name = m->name;
-                mcv1.module_version = m->ver;
-                moduledata = &mcv1;
-            } else if (eid == REDISMODULE_EVENT_LOADING_PROGRESS) {
-                moduledata = data;
-            } else if (eid == REDISMODULE_EVENT_CRON_LOOP) {
-                moduledata = data;
-            } else if (eid == REDISMODULE_EVENT_SWAPDB) {
-                moduledata = data;
-            }
-
-            ModulesInHooks++;
-            el->module->in_hook++;
-            el->callback(&ctx,el->event,subid,moduledata);
-            el->module->in_hook--;
-            ModulesInHooks--;
-
-            if (ModulesInHooks != 0 && !real_client_used) freeClient(ctx.client);
-            moduleFreeContext(&ctx);
-        }
-    }
-}
-
-/* Remove all the listeners for this module: this is used before unloading
- * a module. */
-void moduleUnsubscribeAllServerEvents(RedisModule *module) {
-    RedisModuleEventListener *el;
-    listIter li;
-    listNode *ln;
-    listRewind(RedisModule_EventListeners,&li);
-
-    while((ln = listNext(&li))) {
-        el = ln->value;
-        if (el->module == module) {
-            listDelNode(RedisModule_EventListeners,ln);
-            zfree(el);
-        }
-    }
-}
-
-void processModuleLoadingProgressEvent(int is_aof) {
-    long long now = server.ustime;
-    static long long next_event = 0;
-    if (now >= next_event) {
-        /* Fire the loading progress modules end event. */
-        int progress = -1;
-        if (server.loading_total_bytes)
-            progress = (server.loading_loaded_bytes<<10) / server.loading_total_bytes;
-        RedisModuleLoadingProgressV1 fi = {REDISMODULE_LOADING_PROGRESS_VERSION,
-                                     server.hz,
-                                     progress};
-        moduleFireServerEvent(REDISMODULE_EVENT_LOADING_PROGRESS,
-                              is_aof?
-                                REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF:
-                                REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB,
-                              &fi);
-        /* decide when the next event should fire. */
-        next_event = now + 1000000 / server.hz;
-    }
-}
-
-/* When a module key is deleted (in dbAsyncDelete/dbSyncDelete/dbOverwrite), it 
-*  will be called to tell the module which key is about to be released. */
-void moduleNotifyKeyUnlink(robj *key, robj *val) {
-    if (val->type == OBJ_MODULE) {
-        moduleValue *mv = val->ptr;
-        moduleType *mt = mv->type;
-        if (mt->unlink != NULL) {
-            mt->unlink(key,mv->value);
-        } 
-    }
-}
-
-/* --------------------------------------------------------------------------
- * Modules API internals
- * -------------------------------------------------------------------------- */
-
-/* server.moduleapi dictionary type. Only uses plain C strings since
- * this gets queries from modules. */
-
-uint64_t dictCStringKeyHash(const void *key) {
-    return dictGenHashFunction((unsigned char*)key, strlen((char*)key));
-}
-
-int dictCStringKeyCompare(void *privdata, const void *key1, const void *key2) {
-    UNUSED(privdata);
-    return strcmp(key1,key2) == 0;
-}
-
-dictType moduleAPIDictType = {
-    dictCStringKeyHash,        /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictCStringKeyCompare,     /* key compare */
-    NULL,                      /* key destructor */
-    NULL,                      /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-int moduleRegisterApi(const char *funcname, void *funcptr) {
-    return dictAdd(server.moduleapi, (char*)funcname, funcptr);
-}
-
-#define REGISTER_API(name) \
-    moduleRegisterApi("RedisModule_" #name, (void *)(unsigned long)RM_ ## name)
-
-/* Global initialization at Redis startup. */
-void moduleRegisterCoreAPI(void);
-
-/* Some steps in module initialization need to be done last after server
- * initialization.
- * For example, selectDb() in createClient() requires that server.db has
- * been initialized, see #7323. */
-void moduleInitModulesSystemLast(void) {
-    moduleFreeContextReusedClient = createClient(NULL);
-    moduleFreeContextReusedClient->flags |= CLIENT_MODULE;
-    moduleFreeContextReusedClient->user = NULL; /* root user. */
-}
-
-void moduleInitModulesSystem(void) {
-    moduleUnblockedClients = listCreate();
-    server.loadmodule_queue = listCreate();
-    modules = dictCreate(&modulesDictType,NULL);
-
-    /* Set up the keyspace notification subscriber list and static client */
-    moduleKeyspaceSubscribers = listCreate();
-
-    /* Set up filter list */
-    moduleCommandFilters = listCreate();
-
-    /* Reusable client for RM_Call() is created on first use */
-    server.module_client = NULL;
-
-    moduleRegisterCoreAPI();
-    if (pipe(server.module_blocked_pipe) == -1) {
-        serverLog(LL_WARNING,
-            "Can't create the pipe for module blocking commands: %s",
-            strerror(errno));
-        exit(1);
-    }
-    /* Make the pipe non blocking. This is just a best effort aware mechanism
-     * and we do not want to block not in the read nor in the write half. */
-    anetNonBlock(NULL,server.module_blocked_pipe[0]);
-    anetNonBlock(NULL,server.module_blocked_pipe[1]);
-
-    /* Enable close-on-exec flag on pipes in case of the fork-exec system calls in
-     * sentinels or redis servers. */
-    anetCloexec(server.module_blocked_pipe[0]);
-    anetCloexec(server.module_blocked_pipe[1]);
-
-    /* Create the timers radix tree. */
-    Timers = raxNew();
-
-    /* Setup the event listeners data structures. */
-    RedisModule_EventListeners = listCreate();
-
-    /* Our thread-safe contexts GIL must start with already locked:
-     * it is just unlocked when it's safe. */
-    pthread_mutex_lock(&moduleGIL);
-}
-
-/* Load all the modules in the server.loadmodule_queue list, which is
- * populated by `loadmodule` directives in the configuration file.
- * We can't load modules directly when processing the configuration file
- * because the server must be fully initialized before loading modules.
- *
- * The function aborts the server on errors, since to start with missing
- * modules is not considered sane: clients may rely on the existence of
- * given commands, loading AOF also may need some modules to exist, and
- * if this instance is a slave, it must understand commands from master. */
-void moduleLoadFromQueue(void) {
-    listIter li;
-    listNode *ln;
-
-    listRewind(server.loadmodule_queue,&li);
-    while((ln = listNext(&li))) {
-        struct moduleLoadQueueEntry *loadmod = ln->value;
-        if (moduleLoad(loadmod->path,(void **)loadmod->argv,loadmod->argc)
-            == C_ERR)
-        {
-            serverLog(LL_WARNING,
-                "Can't load module from %s: server aborting",
-                loadmod->path);
-            exit(1);
-        }
-    }
-}
-
-void moduleFreeModuleStructure(struct RedisModule *module) {
-    listRelease(module->types);
-    listRelease(module->filters);
-    listRelease(module->usedby);
-    listRelease(module->using);
-    sdsfree(module->name);
-    zfree(module);
-}
-
-void moduleUnregisterCommands(struct RedisModule *module) {
-    /* Unregister all the commands registered by this module. */
-    dictIterator *di = dictGetSafeIterator(server.commands);
-    dictEntry *de;
-    while ((de = dictNext(di)) != NULL) {
-        struct redisCommand *cmd = dictGetVal(de);
-        if (cmd->proc == RedisModuleCommandDispatcher) {
-            RedisModuleCommandProxy *cp =
-                (void*)(unsigned long)cmd->getkeys_proc;
-            sds cmdname = cp->rediscmd->name;
-            if (cp->module == module) {
-                dictDelete(server.commands,cmdname);
-                dictDelete(server.orig_commands,cmdname);
-                sdsfree(cmdname);
-                zfree(cp->rediscmd);
-                zfree(cp);
-            }
-        }
-    }
-    dictReleaseIterator(di);
-}
-
-/* Load a module and initialize it. On success C_OK is returned, otherwise
- * C_ERR is returned. */
-int moduleLoad(const char *path, void **module_argv, int module_argc) {
-    int (*onload)(void *, void **, int);
-    void *handle;
-    RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-    ctx.client = moduleFreeContextReusedClient;
-    selectDb(ctx.client, 0);
-
-    struct stat st;
-    if (stat(path, &st) == 0)
-    {   // this check is best effort
-        if (!(st.st_mode & (S_IXUSR  | S_IXGRP | S_IXOTH))) {
-            serverLog(LL_WARNING, "Module %s failed to load: It does not have execute permissions.", path);
-            return C_ERR;
-        }
-    }
-
-    handle = dlopen(path,RTLD_NOW|RTLD_LOCAL);
-    if (handle == NULL) {
-        serverLog(LL_WARNING, "Module %s failed to load: %s", path, dlerror());
-        return C_ERR;
-    }
-    onload = (int (*)(void *, void **, int))(unsigned long) dlsym(handle,"RedisModule_OnLoad");
-    if (onload == NULL) {
-        dlclose(handle);
-        serverLog(LL_WARNING,
-            "Module %s does not export RedisModule_OnLoad() "
-            "symbol. Module not loaded.",path);
-        return C_ERR;
-    }
-    if (onload((void*)&ctx,module_argv,module_argc) == REDISMODULE_ERR) {
-        if (ctx.module) {
-            moduleUnregisterCommands(ctx.module);
-            moduleUnregisterSharedAPI(ctx.module);
-            moduleUnregisterUsedAPI(ctx.module);
-            moduleFreeModuleStructure(ctx.module);
-        }
-        dlclose(handle);
-        serverLog(LL_WARNING,
-            "Module %s initialization failed. Module not loaded",path);
-        return C_ERR;
-    }
-
-    /* Redis module loaded! Register it. */
-    dictAdd(modules,ctx.module->name,ctx.module);
-    ctx.module->blocked_clients = 0;
-    ctx.module->handle = handle;
-    serverLog(LL_NOTICE,"Module '%s' loaded from %s",ctx.module->name,path);
-    /* Fire the loaded modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_MODULE_CHANGE,
-                          REDISMODULE_SUBEVENT_MODULE_LOADED,
-                          ctx.module);
-
-    moduleFreeContext(&ctx);
-    return C_OK;
-}
-
-
-/* Unload the module registered with the specified name. On success
- * C_OK is returned, otherwise C_ERR is returned and errno is set
- * to the following values depending on the type of error:
- *
- * * ENONET: No such module having the specified name.
- * * EBUSY: The module exports a new data type and can only be reloaded. */
-int moduleUnload(sds name) {
-    struct RedisModule *module = dictFetchValue(modules,name);
-
-    if (module == NULL) {
-        errno = ENOENT;
-        return REDISMODULE_ERR;
-    } else if (listLength(module->types)) {
-        errno = EBUSY;
-        return REDISMODULE_ERR;
-    } else if (listLength(module->usedby)) {
-        errno = EPERM;
-        return REDISMODULE_ERR;
-    } else if (module->blocked_clients) {
-        errno = EAGAIN;
-        return REDISMODULE_ERR;
-    }
-
-    /* Give module a chance to clean up. */
-    int (*onunload)(void *);
-    onunload = (int (*)(void *))(unsigned long) dlsym(module->handle, "RedisModule_OnUnload");
-    if (onunload) {
-        RedisModuleCtx ctx = REDISMODULE_CTX_INIT;
-        ctx.module = module;
-        ctx.client = moduleFreeContextReusedClient;
-        int unload_status = onunload((void*)&ctx);
-        moduleFreeContext(&ctx);
-
-        if (unload_status == REDISMODULE_ERR) {
-            serverLog(LL_WARNING, "Module %s OnUnload failed.  Unload canceled.", name);
-            errno = ECANCELED;
-            return REDISMODULE_ERR;
-        }
-    }
-
-    moduleFreeAuthenticatedClients(module);
-    moduleUnregisterCommands(module);
-    moduleUnregisterSharedAPI(module);
-    moduleUnregisterUsedAPI(module);
-    moduleUnregisterFilters(module);
-
-    /* Remove any notification subscribers this module might have */
-    moduleUnsubscribeNotifications(module);
-    moduleUnsubscribeAllServerEvents(module);
-
-    /* Unload the dynamic library. */
-    if (dlclose(module->handle) == -1) {
-        char *error = dlerror();
-        if (error == NULL) error = "Unknown error";
-        serverLog(LL_WARNING,"Error when trying to close the %s module: %s",
-            module->name, error);
-    }
-
-    /* Fire the unloaded modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_MODULE_CHANGE,
-                          REDISMODULE_SUBEVENT_MODULE_UNLOADED,
-                          module);
-
-    /* Remove from list of modules. */
-    serverLog(LL_NOTICE,"Module %s unloaded",module->name);
-    dictDelete(modules,module->name);
-    module->name = NULL; /* The name was already freed by dictDelete(). */
-    moduleFreeModuleStructure(module);
-
-    return REDISMODULE_OK;
-}
-
-/* Helper function for the MODULE and HELLO command: send the list of the
- * loaded modules to the client. */
-void addReplyLoadedModules(client *c) {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    addReplyArrayLen(c,dictSize(modules));
-    while ((de = dictNext(di)) != NULL) {
-        sds name = dictGetKey(de);
-        struct RedisModule *module = dictGetVal(de);
-        addReplyMapLen(c,2);
-        addReplyBulkCString(c,"name");
-        addReplyBulkCBuffer(c,name,sdslen(name));
-        addReplyBulkCString(c,"ver");
-        addReplyLongLong(c,module->ver);
-    }
-    dictReleaseIterator(di);
-}
-
-/* Helper for genModulesInfoString(): given a list of modules, return
- * am SDS string in the form "[modulename|modulename2|...]" */
-sds genModulesInfoStringRenderModulesList(list *l) {
-    listIter li;
-    listNode *ln;
-    listRewind(l,&li);
-    sds output = sdsnew("[");
-    while((ln = listNext(&li))) {
-        RedisModule *module = ln->value;
-        output = sdscat(output,module->name);
-        if (ln != listLast(l))
-            output = sdscat(output,"|");
-    }
-    output = sdscat(output,"]");
-    return output;
-}
-
-/* Helper for genModulesInfoString(): render module options as an SDS string. */
-sds genModulesInfoStringRenderModuleOptions(struct RedisModule *module) {
-    sds output = sdsnew("[");
-    if (module->options & REDISMODULE_OPTIONS_HANDLE_IO_ERRORS)
-        output = sdscat(output,"handle-io-errors|");
-    output = sdstrim(output,"|");
-    output = sdscat(output,"]");
-    return output;
-}
-
-
-/* Helper function for the INFO command: adds loaded modules as to info's
- * output.
- *
- * After the call, the passed sds info string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds genModulesInfoString(sds info) {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-
-    while ((de = dictNext(di)) != NULL) {
-        sds name = dictGetKey(de);
-        struct RedisModule *module = dictGetVal(de);
-
-        sds usedby = genModulesInfoStringRenderModulesList(module->usedby);
-        sds using = genModulesInfoStringRenderModulesList(module->using);
-        sds options = genModulesInfoStringRenderModuleOptions(module);
-        info = sdscatfmt(info,
-            "module:name=%S,ver=%i,api=%i,filters=%i,"
-            "usedby=%S,using=%S,options=%S\r\n",
-                name, module->ver, module->apiver,
-                (int)listLength(module->filters), usedby, using, options);
-        sdsfree(usedby);
-        sdsfree(using);
-        sdsfree(options);
-    }
-    dictReleaseIterator(di);
-    return info;
-}
-
-/* Redis MODULE command.
- *
- * MODULE LIST
- * MODULE LOAD <path> [args...]
- * MODULE UNLOAD <name>
- */
-void moduleCommand(client *c) {
-    char *subcmd = c->argv[1]->ptr;
-
-    if (c->argc == 2 && !strcasecmp(subcmd,"help")) {
-        const char *help[] = {
-"LIST",
-"    Return a list of loaded modules.",
-"LOAD <path> [<arg> ...]",
-"    Load a module library from <path>, passing to it any optional arguments.",
-"UNLOAD <name>",
-"    Unload a module.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else
-    if (!strcasecmp(subcmd,"load") && c->argc >= 3) {
-        robj **argv = NULL;
-        int argc = 0;
-
-        if (c->argc > 3) {
-            argc = c->argc - 3;
-            argv = &c->argv[3];
-        }
-
-        if (moduleLoad(c->argv[2]->ptr,(void **)argv,argc) == C_OK)
-            addReply(c,shared.ok);
-        else
-            addReplyError(c,
-                "Error loading the extension. Please check the server logs.");
-    } else if (!strcasecmp(subcmd,"unload") && c->argc == 3) {
-        if (moduleUnload(c->argv[2]->ptr) == C_OK)
-            addReply(c,shared.ok);
-        else {
-            char *errmsg;
-            switch(errno) {
-            case ENOENT:
-                errmsg = "no such module with that name";
-                break;
-            case EBUSY:
-                errmsg = "the module exports one or more module-side data "
-                         "types, can't unload";
-                break;
-            case EPERM:
-                errmsg = "the module exports APIs used by other modules. "
-                         "Please unload them first and try again";
-                break;
-            case EAGAIN:
-                errmsg = "the module has blocked clients. "
-                         "Please wait them unblocked and try again";
-                break;
-            default:
-                errmsg = "operation not possible.";
-                break;
-            }
-            addReplyErrorFormat(c,"Error unloading module: %s",errmsg);
-        }
-    } else if (!strcasecmp(subcmd,"list") && c->argc == 2) {
-        addReplyLoadedModules(c);
-    } else {
-        addReplySubcommandSyntaxError(c);
-        return;
-    }
-}
-
-/* Return the number of registered modules. */
-size_t moduleCount(void) {
-    return dictSize(modules);
-}
-
-/* --------------------------------------------------------------------------
- * ## Key eviction API
- * -------------------------------------------------------------------------- */
-
-/* Set the key last access time for LRU based eviction. not relevant if the
- * servers's maxmemory policy is LFU based. Value is idle time in milliseconds.
- * returns REDISMODULE_OK if the LRU was updated, REDISMODULE_ERR otherwise. */
-int RM_SetLRU(RedisModuleKey *key, mstime_t lru_idle) {
-    if (!key->value)
-        return REDISMODULE_ERR;
-    if (objectSetLRUOrLFU(key->value, -1, lru_idle, lru_idle>=0 ? LRU_CLOCK() : 0, 1))
-        return REDISMODULE_OK;
-    return REDISMODULE_ERR;
-}
-
-/* Gets the key last access time.
- * Value is idletime in milliseconds or -1 if the server's eviction policy is
- * LFU based.
- * returns REDISMODULE_OK if when key is valid. */
-int RM_GetLRU(RedisModuleKey *key, mstime_t *lru_idle) {
-    *lru_idle = -1;
-    if (!key->value)
-        return REDISMODULE_ERR;
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU)
-        return REDISMODULE_OK;
-    *lru_idle = estimateObjectIdleTime(key->value);
-    return REDISMODULE_OK;
-}
-
-/* Set the key access frequency. only relevant if the server's maxmemory policy
- * is LFU based.
- * The frequency is a logarithmic counter that provides an indication of
- * the access frequencyonly (must be <= 255).
- * returns REDISMODULE_OK if the LFU was updated, REDISMODULE_ERR otherwise. */
-int RM_SetLFU(RedisModuleKey *key, long long lfu_freq) {
-    if (!key->value)
-        return REDISMODULE_ERR;
-    if (objectSetLRUOrLFU(key->value, lfu_freq, -1, 0, 1))
-        return REDISMODULE_OK;
-    return REDISMODULE_ERR;
-}
-
-/* Gets the key access frequency or -1 if the server's eviction policy is not
- * LFU based.
- * returns REDISMODULE_OK if when key is valid. */
-int RM_GetLFU(RedisModuleKey *key, long long *lfu_freq) {
-    *lfu_freq = -1;
-    if (!key->value)
-        return REDISMODULE_ERR;
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU)
-        *lfu_freq = LFUDecrAndReturn(key->value);
-    return REDISMODULE_OK;
-}
-
-/* --------------------------------------------------------------------------
- * ## Miscellaneous APIs
- * -------------------------------------------------------------------------- */
-
-/**
- * Returns the full ContextFlags mask, using the return value
- * the module can check if a certain set of flags are supported
- * by the redis server version in use.
- * Example:
- *
- *        int supportedFlags = RM_GetContextFlagsAll();
- *        if (supportedFlags & REDISMODULE_CTX_FLAGS_MULTI) {
- *              // REDISMODULE_CTX_FLAGS_MULTI is supported
- *        } else{
- *              // REDISMODULE_CTX_FLAGS_MULTI is not supported
- *        }
- */
-int RM_GetContextFlagsAll() {
-    return _REDISMODULE_CTX_FLAGS_NEXT - 1;
-}
-
-/**
- * Returns the full KeyspaceNotification mask, using the return value
- * the module can check if a certain set of flags are supported
- * by the redis server version in use.
- * Example:
- *
- *        int supportedFlags = RM_GetKeyspaceNotificationFlagsAll();
- *        if (supportedFlags & REDISMODULE_NOTIFY_LOADED) {
- *              // REDISMODULE_NOTIFY_LOADED is supported
- *        } else{
- *              // REDISMODULE_NOTIFY_LOADED is not supported
- *        }
- */
-int RM_GetKeyspaceNotificationFlagsAll() {
-    return _REDISMODULE_NOTIFY_NEXT - 1;
-}
-
-/**
- * Return the redis version in format of 0x00MMmmpp.
- * Example for 6.0.7 the return value will be 0x00060007.
- */
-int RM_GetServerVersion() {
-    return REDIS_VERSION_NUM;
-}
-
-/**
- * Return the current redis-server runtime value of REDISMODULE_TYPE_METHOD_VERSION.
- * You can use that when calling RM_CreateDataType to know which fields of
- * RedisModuleTypeMethods are gonna be supported and which will be ignored.
- */
-int RM_GetTypeMethodVersion() {
-    return REDISMODULE_TYPE_METHOD_VERSION;
-}
-
-/* Replace the value assigned to a module type.
- *
- * The key must be open for writing, have an existing value, and have a moduleType
- * that matches the one specified by the caller.
- *
- * Unlike RM_ModuleTypeSetValue() which will free the old value, this function
- * simply swaps the old value with the new value.
- *
- * The function returns REDISMODULE_OK on success, REDISMODULE_ERR on errors
- * such as:
- *
- * 1. Key is not opened for writing.
- * 2. Key is not a module data type key.
- * 3. Key is a module datatype other than 'mt'.
- *
- * If old_value is non-NULL, the old value is returned by reference.
- */
-int RM_ModuleTypeReplaceValue(RedisModuleKey *key, moduleType *mt, void *new_value, void **old_value) {
-    if (!(key->mode & REDISMODULE_WRITE) || key->iter)
-        return REDISMODULE_ERR;
-    if (!key->value || key->value->type != OBJ_MODULE)
-        return REDISMODULE_ERR;
-
-    moduleValue *mv = key->value->ptr;
-    if (mv->type != mt)
-        return REDISMODULE_ERR;
-
-    if (old_value)
-        *old_value = mv->value;
-    mv->value = new_value;
-
-    return REDISMODULE_OK;
-}
-
-/* For a specified command, parse its arguments and return an array that
- * contains the indexes of all key name arguments. This function is
- * essnetially a more efficient way to do COMMAND GETKEYS.
- *
- * A NULL return value indicates the specified command has no keys, or
- * an error condition. Error conditions are indicated by setting errno
- * as folllows:
- *
- * * ENOENT: Specified command does not exist.
- * * EINVAL: Invalid command arity specified.
- *
- * NOTE: The returned array is not a Redis Module object so it does not
- * get automatically freed even when auto-memory is used. The caller
- * must explicitly call RM_Free() to free it.
- */
-int *RM_GetCommandKeys(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, int *num_keys) {
-    UNUSED(ctx);
-    struct redisCommand *cmd;
-    int *res = NULL;
-
-    /* Find command */
-    if ((cmd = lookupCommand(argv[0]->ptr)) == NULL) {
-        errno = ENOENT;
-        return NULL;
-    }
-
-    /* Bail out if command has no keys */
-    if (cmd->getkeys_proc == NULL && cmd->firstkey == 0) {
-        errno = 0;
-        return NULL;
-    }
-
-    if ((cmd->arity > 0 && cmd->arity != argc) || (argc < -cmd->arity)) {
-        errno = EINVAL;
-        return NULL;
-    }
-
-    getKeysResult result = GETKEYS_RESULT_INIT;
-    getKeysFromCommand(cmd, argv, argc, &result);
-
-    *num_keys = result.numkeys;
-    if (!result.numkeys) {
-        errno = 0;
-        getKeysFreeResult(&result);
-        return NULL;
-    }
-
-    if (result.keys == result.keysbuf) {
-        /* If the result is using a stack based array, copy it. */
-        unsigned long int size = sizeof(int) * result.numkeys;
-        res = zmalloc(size);
-        memcpy(res, result.keys, size);
-    } else {
-        /* We return the heap based array and intentionally avoid calling
-         * getKeysFreeResult() here, as it is the caller's responsibility
-         * to free this array.
-         */
-        res = result.keys;
-    }
-
-    return res;
-}
-
-/* Return the name of the command currently running */
-const char *RM_GetCurrentCommandName(RedisModuleCtx *ctx) {
-    if (!ctx || !ctx->client || !ctx->client->cmd)
-        return NULL;
-
-    return (const char*)ctx->client->cmd->name;
-}
-
-/* --------------------------------------------------------------------------
- * ## Defrag API
- * -------------------------------------------------------------------------- */
-
-/* The defrag context, used to manage state during calls to the data type
- * defrag callback.
- */
-typedef struct RedisModuleDefragCtx {
-    long defragged;
-    long long int endtime;
-    unsigned long *cursor;
-} RedisModuleDefragCtx;
-
-/* Register a defrag callback for global data, i.e. anything that the module
- * may allocate that is not tied to a specific data type.
- */
-int RM_RegisterDefragFunc(RedisModuleCtx *ctx, RedisModuleDefragFunc cb) {
-    ctx->module->defrag_cb = cb;
-    return REDISMODULE_OK;
-}
-
-/* When the data type defrag callback iterates complex structures, this
- * function should be called periodically. A zero (false) return
- * indicates the callback may continue its work. A non-zero value (true)
- * indicates it should stop.
- *
- * When stopped, the callback may use RM_DefragCursorSet() to store its
- * position so it can later use RM_DefragCursorGet() to resume defragging.
- *
- * When stopped and more work is left to be done, the callback should
- * return 1. Otherwise, it should return 0.
- *
- * NOTE: Modules should consider the frequency in which this function is called,
- * so it generally makes sense to do small batches of work in between calls.
- */
-int RM_DefragShouldStop(RedisModuleDefragCtx *ctx) {
-    return (ctx->endtime != 0 && ctx->endtime < ustime());
-}
-
-/* Store an arbitrary cursor value for future re-use.
- *
- * This should only be called if RM_DefragShouldStop() has returned a non-zero
- * value and the defrag callback is about to exit without fully iterating its
- * data type.
- *
- * This behavior is reserved to cases where late defrag is performed. Late
- * defrag is selected for keys that implement the `free_effort` callback and
- * return a `free_effort` value that is larger than the defrag
- * 'active-defrag-max-scan-fields' configuration directive.
- *
- * Smaller keys, keys that do not implement `free_effort` or the global
- * defrag callback are not called in late-defrag mode. In those cases, a
- * call to this function will return REDISMODULE_ERR.
- *
- * The cursor may be used by the module to represent some progress into the
- * module's data type. Modules may also store additional cursor-related
- * information locally and use the cursor as a flag that indicates when
- * traversal of a new key begins. This is possible because the API makes
- * a guarantee that concurrent defragmentation of multiple keys will
- * not be performed.
- */
-int RM_DefragCursorSet(RedisModuleDefragCtx *ctx, unsigned long cursor) {
-    if (!ctx->cursor)
-        return REDISMODULE_ERR;
-
-    *ctx->cursor = cursor;
-    return REDISMODULE_OK;
-}
-
-/* Fetch a cursor value that has been previously stored using RM_DefragCursorSet().
- *
- * If not called for a late defrag operation, REDISMODULE_ERR will be returned and
- * the cursor should be ignored. See RM_DefragCursorSet() for more details on
- * defrag cursors.
- */
-int RM_DefragCursorGet(RedisModuleDefragCtx *ctx, unsigned long *cursor) {
-    if (!ctx->cursor)
-        return REDISMODULE_ERR;
-
-    *cursor = *ctx->cursor;
-    return REDISMODULE_OK;
-}
-
-/* Defrag a memory allocation previously allocated by RM_Alloc, RM_Calloc, etc.
- * The defragmentation process involves allocating a new memory block and copying
- * the contents to it, like realloc().
- *
- * If defragmentation was not necessary, NULL is returned and the operation has
- * no other effect.
- *
- * If a non-NULL value is returned, the caller should use the new pointer instead
- * of the old one and update any reference to the old pointer, which must not
- * be used again.
- */
-void *RM_DefragAlloc(RedisModuleDefragCtx *ctx, void *ptr) {
-    void *newptr = activeDefragAlloc(ptr);
-    if (newptr)
-        ctx->defragged++;
-
-    return newptr;
-}
-
-/* Defrag a RedisModuleString previously allocated by RM_Alloc, RM_Calloc, etc.
- * See RM_DefragAlloc() for more information on how the defragmentation process
- * works.
- *
- * NOTE: It is only possible to defrag strings that have a single reference.
- * Typically this means strings retained with RM_RetainString or RM_HoldString
- * may not be defragmentable. One exception is command argvs which, if retained
- * by the module, will end up with a single reference (because the reference
- * on the Redis side is dropped as soon as the command callback returns).
- */
-RedisModuleString *RM_DefragRedisModuleString(RedisModuleDefragCtx *ctx, RedisModuleString *str) {
-    return activeDefragStringOb(str, &ctx->defragged);
-}
-
-
-/* Perform a late defrag of a module datatype key.
- *
- * Returns a zero value (and initializes the cursor) if no more needs to be done,
- * or a non-zero value otherwise.
- */
-int moduleLateDefrag(robj *key, robj *value, unsigned long *cursor, long long endtime, long long *defragged) {
-    moduleValue *mv = value->ptr;
-    moduleType *mt = mv->type;
-
-    RedisModuleDefragCtx defrag_ctx = { 0, endtime, cursor };
-
-    /* Invoke callback. Note that the callback may be missing if the key has been
-     * replaced with a different type since our last visit.
-     */
-    int ret = 0;
-    if (mt->defrag)
-        ret = mt->defrag(&defrag_ctx, key, &mv->value);
-
-    *defragged += defrag_ctx.defragged;
-    if (!ret) {
-        *cursor = 0;    /* No more work to do */
-        return 0;
-    }
-
-    return 1;
-}
-
-/* Attempt to defrag a module data type value. Depending on complexity,
- * the operation may happen immediately or be scheduled for later.
- *
- * Returns 1 if the operation has been completed or 0 if it needs to
- * be scheduled for late defrag.
- */
-int moduleDefragValue(robj *key, robj *value, long *defragged) {
-    moduleValue *mv = value->ptr;
-    moduleType *mt = mv->type;
-
-    /* Try to defrag moduleValue itself regardless of whether or not
-     * defrag callbacks are provided.
-     */
-    moduleValue *newmv = activeDefragAlloc(mv);
-    if (newmv) {
-        (*defragged)++;
-        value->ptr = mv = newmv;
-    }
-
-    if (!mt->defrag)
-        return 1;
-
-    /* Use free_effort to determine complexity of module value, and if
-     * necessary schedule it for defragLater instead of quick immediate
-     * defrag.
-     */
-    if (mt->free_effort) {
-        size_t effort = mt->free_effort(key, mv->value);
-        if (!effort)
-            effort = SIZE_MAX;
-        if (effort > server.active_defrag_max_scan_fields) {
-            return 0;  /* Defrag later */
-        }
-    }
-
-    RedisModuleDefragCtx defrag_ctx = { 0, 0, NULL };
-    mt->defrag(&defrag_ctx, key, &mv->value);
-    (*defragged) += defrag_ctx.defragged;
-    return 1;
-}
-
-/* Call registered module API defrag functions */
-long moduleDefragGlobals(void) {
-    dictIterator *di = dictGetIterator(modules);
-    dictEntry *de;
-    long defragged = 0;
-
-    while ((de = dictNext(di)) != NULL) {
-        struct RedisModule *module = dictGetVal(de);
-        if (!module->defrag_cb)
-            continue;
-        RedisModuleDefragCtx defrag_ctx = { 0, 0, NULL };
-        module->defrag_cb(&defrag_ctx);
-        defragged += defrag_ctx.defragged;
-    }
-    dictReleaseIterator(di);
-
-    return defragged;
-}
-
-/* Register all the APIs we export. Keep this function at the end of the
- * file so that's easy to seek it to add new entries. */
-void moduleRegisterCoreAPI(void) {
-    server.moduleapi = dictCreate(&moduleAPIDictType,NULL);
-    server.sharedapi = dictCreate(&moduleAPIDictType,NULL);
-    REGISTER_API(Alloc);
-    REGISTER_API(Calloc);
-    REGISTER_API(Realloc);
-    REGISTER_API(Free);
-    REGISTER_API(Strdup);
-    REGISTER_API(CreateCommand);
-    REGISTER_API(SetModuleAttribs);
-    REGISTER_API(IsModuleNameBusy);
-    REGISTER_API(WrongArity);
-    REGISTER_API(ReplyWithLongLong);
-    REGISTER_API(ReplyWithError);
-    REGISTER_API(ReplyWithSimpleString);
-    REGISTER_API(ReplyWithArray);
-    REGISTER_API(ReplyWithNullArray);
-    REGISTER_API(ReplyWithEmptyArray);
-    REGISTER_API(ReplySetArrayLength);
-    REGISTER_API(ReplyWithString);
-    REGISTER_API(ReplyWithEmptyString);
-    REGISTER_API(ReplyWithVerbatimString);
-    REGISTER_API(ReplyWithStringBuffer);
-    REGISTER_API(ReplyWithCString);
-    REGISTER_API(ReplyWithNull);
-    REGISTER_API(ReplyWithCallReply);
-    REGISTER_API(ReplyWithDouble);
-    REGISTER_API(ReplyWithLongDouble);
-    REGISTER_API(GetSelectedDb);
-    REGISTER_API(SelectDb);
-    REGISTER_API(OpenKey);
-    REGISTER_API(CloseKey);
-    REGISTER_API(KeyType);
-    REGISTER_API(ValueLength);
-    REGISTER_API(ListPush);
-    REGISTER_API(ListPop);
-    REGISTER_API(StringToLongLong);
-    REGISTER_API(StringToDouble);
-    REGISTER_API(StringToLongDouble);
-    REGISTER_API(StringToStreamID);
-    REGISTER_API(Call);
-    REGISTER_API(CallReplyProto);
-    REGISTER_API(FreeCallReply);
-    REGISTER_API(CallReplyInteger);
-    REGISTER_API(CallReplyType);
-    REGISTER_API(CallReplyLength);
-    REGISTER_API(CallReplyArrayElement);
-    REGISTER_API(CallReplyStringPtr);
-    REGISTER_API(CreateStringFromCallReply);
-    REGISTER_API(CreateString);
-    REGISTER_API(CreateStringFromLongLong);
-    REGISTER_API(CreateStringFromDouble);
-    REGISTER_API(CreateStringFromLongDouble);
-    REGISTER_API(CreateStringFromString);
-    REGISTER_API(CreateStringFromStreamID);
-    REGISTER_API(CreateStringPrintf);
-    REGISTER_API(FreeString);
-    REGISTER_API(StringPtrLen);
-    REGISTER_API(AutoMemory);
-    REGISTER_API(Replicate);
-    REGISTER_API(ReplicateVerbatim);
-    REGISTER_API(DeleteKey);
-    REGISTER_API(UnlinkKey);
-    REGISTER_API(StringSet);
-    REGISTER_API(StringDMA);
-    REGISTER_API(StringTruncate);
-    REGISTER_API(SetExpire);
-    REGISTER_API(GetExpire);
-    REGISTER_API(ResetDataset);
-    REGISTER_API(DbSize);
-    REGISTER_API(RandomKey);
-    REGISTER_API(ZsetAdd);
-    REGISTER_API(ZsetIncrby);
-    REGISTER_API(ZsetScore);
-    REGISTER_API(ZsetRem);
-    REGISTER_API(ZsetRangeStop);
-    REGISTER_API(ZsetFirstInScoreRange);
-    REGISTER_API(ZsetLastInScoreRange);
-    REGISTER_API(ZsetFirstInLexRange);
-    REGISTER_API(ZsetLastInLexRange);
-    REGISTER_API(ZsetRangeCurrentElement);
-    REGISTER_API(ZsetRangeNext);
-    REGISTER_API(ZsetRangePrev);
-    REGISTER_API(ZsetRangeEndReached);
-    REGISTER_API(HashSet);
-    REGISTER_API(HashGet);
-    REGISTER_API(StreamAdd);
-    REGISTER_API(StreamDelete);
-    REGISTER_API(StreamIteratorStart);
-    REGISTER_API(StreamIteratorStop);
-    REGISTER_API(StreamIteratorNextID);
-    REGISTER_API(StreamIteratorNextField);
-    REGISTER_API(StreamIteratorDelete);
-    REGISTER_API(StreamTrimByLength);
-    REGISTER_API(StreamTrimByID);
-    REGISTER_API(IsKeysPositionRequest);
-    REGISTER_API(KeyAtPos);
-    REGISTER_API(GetClientId);
-    REGISTER_API(GetClientUserNameById);
-    REGISTER_API(GetContextFlags);
-    REGISTER_API(AvoidReplicaTraffic);
-    REGISTER_API(PoolAlloc);
-    REGISTER_API(CreateDataType);
-    REGISTER_API(ModuleTypeSetValue);
-    REGISTER_API(ModuleTypeReplaceValue);
-    REGISTER_API(ModuleTypeGetType);
-    REGISTER_API(ModuleTypeGetValue);
-    REGISTER_API(IsIOError);
-    REGISTER_API(SetModuleOptions);
-    REGISTER_API(SignalModifiedKey);
-    REGISTER_API(SaveUnsigned);
-    REGISTER_API(LoadUnsigned);
-    REGISTER_API(SaveSigned);
-    REGISTER_API(LoadSigned);
-    REGISTER_API(SaveString);
-    REGISTER_API(SaveStringBuffer);
-    REGISTER_API(LoadString);
-    REGISTER_API(LoadStringBuffer);
-    REGISTER_API(SaveDouble);
-    REGISTER_API(LoadDouble);
-    REGISTER_API(SaveFloat);
-    REGISTER_API(LoadFloat);
-    REGISTER_API(SaveLongDouble);
-    REGISTER_API(LoadLongDouble);
-    REGISTER_API(SaveDataTypeToString);
-    REGISTER_API(LoadDataTypeFromString);
-    REGISTER_API(EmitAOF);
-    REGISTER_API(Log);
-    REGISTER_API(LogIOError);
-    REGISTER_API(_Assert);
-    REGISTER_API(LatencyAddSample);
-    REGISTER_API(StringAppendBuffer);
-    REGISTER_API(RetainString);
-    REGISTER_API(HoldString);
-    REGISTER_API(StringCompare);
-    REGISTER_API(GetContextFromIO);
-    REGISTER_API(GetKeyNameFromIO);
-    REGISTER_API(GetKeyNameFromModuleKey);
-    REGISTER_API(BlockClient);
-    REGISTER_API(UnblockClient);
-    REGISTER_API(IsBlockedReplyRequest);
-    REGISTER_API(IsBlockedTimeoutRequest);
-    REGISTER_API(GetBlockedClientPrivateData);
-    REGISTER_API(AbortBlock);
-    REGISTER_API(Milliseconds);
-    REGISTER_API(BlockedClientMeasureTimeStart);
-    REGISTER_API(BlockedClientMeasureTimeEnd);
-    REGISTER_API(GetThreadSafeContext);
-    REGISTER_API(GetDetachedThreadSafeContext);
-    REGISTER_API(FreeThreadSafeContext);
-    REGISTER_API(ThreadSafeContextLock);
-    REGISTER_API(ThreadSafeContextTryLock);
-    REGISTER_API(ThreadSafeContextUnlock);
-    REGISTER_API(DigestAddStringBuffer);
-    REGISTER_API(DigestAddLongLong);
-    REGISTER_API(DigestEndSequence);
-    REGISTER_API(NotifyKeyspaceEvent);
-    REGISTER_API(GetNotifyKeyspaceEvents);
-    REGISTER_API(SubscribeToKeyspaceEvents);
-    REGISTER_API(RegisterClusterMessageReceiver);
-    REGISTER_API(SendClusterMessage);
-    REGISTER_API(GetClusterNodeInfo);
-    REGISTER_API(GetClusterNodesList);
-    REGISTER_API(FreeClusterNodesList);
-    REGISTER_API(CreateTimer);
-    REGISTER_API(StopTimer);
-    REGISTER_API(GetTimerInfo);
-    REGISTER_API(GetMyClusterID);
-    REGISTER_API(GetClusterSize);
-    REGISTER_API(GetRandomBytes);
-    REGISTER_API(GetRandomHexChars);
-    REGISTER_API(BlockedClientDisconnected);
-    REGISTER_API(SetDisconnectCallback);
-    REGISTER_API(GetBlockedClientHandle);
-    REGISTER_API(SetClusterFlags);
-    REGISTER_API(CreateDict);
-    REGISTER_API(FreeDict);
-    REGISTER_API(DictSize);
-    REGISTER_API(DictSetC);
-    REGISTER_API(DictReplaceC);
-    REGISTER_API(DictSet);
-    REGISTER_API(DictReplace);
-    REGISTER_API(DictGetC);
-    REGISTER_API(DictGet);
-    REGISTER_API(DictDelC);
-    REGISTER_API(DictDel);
-    REGISTER_API(DictIteratorStartC);
-    REGISTER_API(DictIteratorStart);
-    REGISTER_API(DictIteratorStop);
-    REGISTER_API(DictIteratorReseekC);
-    REGISTER_API(DictIteratorReseek);
-    REGISTER_API(DictNextC);
-    REGISTER_API(DictPrevC);
-    REGISTER_API(DictNext);
-    REGISTER_API(DictPrev);
-    REGISTER_API(DictCompareC);
-    REGISTER_API(DictCompare);
-    REGISTER_API(ExportSharedAPI);
-    REGISTER_API(GetSharedAPI);
-    REGISTER_API(RegisterCommandFilter);
-    REGISTER_API(UnregisterCommandFilter);
-    REGISTER_API(CommandFilterArgsCount);
-    REGISTER_API(CommandFilterArgGet);
-    REGISTER_API(CommandFilterArgInsert);
-    REGISTER_API(CommandFilterArgReplace);
-    REGISTER_API(CommandFilterArgDelete);
-    REGISTER_API(Fork);
-    REGISTER_API(SendChildHeartbeat);
-    REGISTER_API(ExitFromChild);
-    REGISTER_API(KillForkChild);
-    REGISTER_API(RegisterInfoFunc);
-    REGISTER_API(InfoAddSection);
-    REGISTER_API(InfoBeginDictField);
-    REGISTER_API(InfoEndDictField);
-    REGISTER_API(InfoAddFieldString);
-    REGISTER_API(InfoAddFieldCString);
-    REGISTER_API(InfoAddFieldDouble);
-    REGISTER_API(InfoAddFieldLongLong);
-    REGISTER_API(InfoAddFieldULongLong);
-    REGISTER_API(GetServerInfo);
-    REGISTER_API(FreeServerInfo);
-    REGISTER_API(ServerInfoGetField);
-    REGISTER_API(ServerInfoGetFieldC);
-    REGISTER_API(ServerInfoGetFieldSigned);
-    REGISTER_API(ServerInfoGetFieldUnsigned);
-    REGISTER_API(ServerInfoGetFieldDouble);
-    REGISTER_API(GetClientInfoById);
-    REGISTER_API(PublishMessage);
-    REGISTER_API(SubscribeToServerEvent);
-    REGISTER_API(SetLRU);
-    REGISTER_API(GetLRU);
-    REGISTER_API(SetLFU);
-    REGISTER_API(GetLFU);
-    REGISTER_API(BlockClientOnKeys);
-    REGISTER_API(SignalKeyAsReady);
-    REGISTER_API(GetBlockedClientReadyKey);
-    REGISTER_API(GetUsedMemoryRatio);
-    REGISTER_API(MallocSize);
-    REGISTER_API(ScanCursorCreate);
-    REGISTER_API(ScanCursorDestroy);
-    REGISTER_API(ScanCursorRestart);
-    REGISTER_API(Scan);
-    REGISTER_API(ScanKey);
-    REGISTER_API(CreateModuleUser);
-    REGISTER_API(SetModuleUserACL);
-    REGISTER_API(FreeModuleUser);
-    REGISTER_API(DeauthenticateAndCloseClient);
-    REGISTER_API(AuthenticateClientWithACLUser);
-    REGISTER_API(AuthenticateClientWithUser);
-    REGISTER_API(GetContextFlagsAll);
-    REGISTER_API(GetKeyspaceNotificationFlagsAll);
-    REGISTER_API(IsSubEventSupported);
-    REGISTER_API(GetServerVersion);
-    REGISTER_API(GetClientCertificate);
-    REGISTER_API(GetCommandKeys);
-    REGISTER_API(GetCurrentCommandName);
-    REGISTER_API(GetTypeMethodVersion);
-    REGISTER_API(RegisterDefragFunc);
-    REGISTER_API(DefragAlloc);
-    REGISTER_API(DefragRedisModuleString);
-    REGISTER_API(DefragShouldStop);
-    REGISTER_API(DefragCursorSet);
-    REGISTER_API(DefragCursorGet);
-}
diff --git a/redis-stable/src/modules/.gitignore b/redis-stable/src/modules/.gitignore
deleted file mode 100644
index 4de1735e..00000000
--- a/redis-stable/src/modules/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-*.so
-*.xo
diff --git a/redis-stable/src/modules/Makefile b/redis-stable/src/modules/Makefile
deleted file mode 100644
index 3db19e79..00000000
--- a/redis-stable/src/modules/Makefile
+++ /dev/null
@@ -1,62 +0,0 @@
-
-# find the OS
-uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
-
-# Compile flags for linux / osx
-ifeq ($(uname_S),Linux)
-	SHOBJ_CFLAGS ?= -W -Wall -fno-common -g -ggdb -std=c99 -O2
-	SHOBJ_LDFLAGS ?= -shared
-else
-	SHOBJ_CFLAGS ?= -W -Wall -dynamic -fno-common -g -ggdb -std=c99 -O2
-	SHOBJ_LDFLAGS ?= -bundle -undefined dynamic_lookup
-endif
-
-.SUFFIXES: .c .so .xo .o
-
-all: helloworld.so hellotype.so helloblock.so hellocluster.so hellotimer.so hellodict.so hellohook.so helloacl.so
-
-.c.xo:
-	$(CC) -I. $(CFLAGS) $(SHOBJ_CFLAGS) -fPIC -c $< -o $@
-
-helloworld.xo: ../redismodule.h
-
-helloworld.so: helloworld.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-hellotype.xo: ../redismodule.h
-
-hellotype.so: hellotype.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-helloblock.xo: ../redismodule.h
-
-helloblock.so: helloblock.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lpthread -lc
-
-hellocluster.xo: ../redismodule.h
-
-hellocluster.so: hellocluster.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-hellotimer.xo: ../redismodule.h
-
-hellotimer.so: hellotimer.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-hellodict.xo: ../redismodule.h
-
-hellodict.so: hellodict.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-hellohook.xo: ../redismodule.h
-
-hellohook.so: hellohook.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-helloacl.xo: ../redismodule.h
-
-helloacl.so: helloacl.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LIBS) -lc
-
-clean:
-	rm -rf *.xo *.so
diff --git a/redis-stable/src/modules/gendoc.rb b/redis-stable/src/modules/gendoc.rb
deleted file mode 100644
index f83b1ad9..00000000
--- a/redis-stable/src/modules/gendoc.rb
+++ /dev/null
@@ -1,174 +0,0 @@
-# coding: utf-8
-# gendoc.rb -- Converts the top-comments inside module.c to modules API
-#              reference documentation in markdown format.
-
-# Convert the C comment to markdown
-def markdown(s)
-    s = s.gsub(/\*\/$/,"")
-    s = s.gsub(/^ ?\* ?/,"")
-    s = s.gsub(/^\/\*\*? ?/,"")
-    s.chop! while s[-1] == "\n" || s[-1] == " "
-    lines = s.split("\n")
-    newlines = []
-    # Fix some markdown, except in code blocks indented by 4 spaces.
-    lines.each{|l|
-        if not l.start_with?('    ')
-            # Rewrite RM_Xyz() to `RedisModule_Xyz()`. The () suffix is
-            # optional. Even RM_Xyz*() with * as wildcard is handled.
-            l = l.gsub(/(?<!`)RM_([A-z]+(?:\*?\(\))?)/, '`RedisModule_\1`')
-            # Add backquotes around RedisModule functions and type where missing.
-            l = l.gsub(/(?<!`)RedisModule[A-z]+(?:\*?\(\))?/){|x| "`#{x}`"}
-            # Add backquotes around c functions like malloc() where missing.
-            l = l.gsub(/(?<![`A-z])[a-z_]+\(\)/, '`\0`')
-            # Add backquotes around macro and var names containing underscores.
-            l = l.gsub(/(?<![`A-z\*])[A-Za-z]+_[A-Za-z0-9_]+/){|x| "`#{x}`"}
-            # Link URLs preceded by space or newline (not already linked)
-            l = l.gsub(/(^| )(https?:\/\/[A-Za-z0-9_\/\.\-]+[A-Za-z0-9\/])/,
-                       '\1[\2](\2)')
-            # Replace double-dash with unicode ndash
-            l = l.gsub(/ -- /, ' – ')
-        end
-        # Link function names to their definition within the page
-        l = l.gsub(/`(RedisModule_[A-z0-9]+)[()]*`/) {|x|
-            $index[$1] ? "[#{x}](\##{$1})" : x
-        }
-        newlines << l
-    }
-    return newlines.join("\n")
-end
-
-# Linebreak a prototype longer than 80 characters on the commas, but only
-# between balanced parentheses so that we don't linebreak args which are
-# function pointers, and then aligning each arg under each other.
-def linebreak_proto(proto, indent)
-    if proto.bytesize <= 80
-        return proto
-    end
-    parts = proto.split(/,\s*/);
-    if parts.length == 1
-        return proto;
-    end
-    align_pos = proto.index("(") + 1;
-    align = " " * align_pos
-    result = parts.shift;
-    bracket_balance = 0;
-    parts.each{|part|
-        if bracket_balance == 0
-            result += ",\n" + indent + align
-        else
-            result += ", "
-        end
-        result += part
-        bracket_balance += part.count("(") - part.count(")")
-    }
-    return result;
-end
-
-# Given the source code array and the index at which an exported symbol was
-# detected, extracts and outputs the documentation.
-def docufy(src,i)
-    m = /RM_[A-z0-9]+/.match(src[i])
-    name = m[0]
-    name = name.sub("RM_","RedisModule_")
-    proto = src[i].sub("{","").strip+";\n"
-    proto = proto.sub("RM_","RedisModule_")
-    proto = linebreak_proto(proto, "    ");
-    # Add a link target with the function name. (We don't trust the exact id of
-    # the generated one, which depends on the Markdown implementation.)
-    puts "<span id=\"#{name}\"></span>\n\n"
-    puts "### `#{name}`\n\n"
-    puts "    #{proto}\n"
-    comment = ""
-    while true
-        i = i-1
-        comment = src[i]+comment
-        break if src[i] =~ /\/\*/
-    end
-    comment = markdown(comment)
-    puts comment+"\n\n"
-end
-
-# Print a comment from line until */ is found, as markdown.
-def section_doc(src, i)
-    name = get_section_heading(src, i)
-    comment = "<span id=\"#{section_name_to_id(name)}\"></span>\n\n"
-    while true
-         # append line, except if it's a horizontal divider
-        comment = comment + src[i] if src[i] !~ /^[\/ ]?\*{1,2} ?-{50,}/
-        break if src[i] =~ /\*\//
-        i = i+1
-    end
-    comment = markdown(comment)
-    puts comment+"\n\n"
-end
-
-# generates an id suitable for links within the page
-def section_name_to_id(name)
-    return "section-" +
-           name.strip.downcase.gsub(/[^a-z0-9]+/, '-').gsub(/^-+|-+$/, '')
-end
-
-# Returns the name of the first section heading in the comment block for which
-# is_section_doc(src, i) is true
-def get_section_heading(src, i)
-    if src[i] =~ /^\/\*\*? \#+ *(.*)/
-        heading = $1
-    elsif src[i+1] =~ /^ ?\* \#+ *(.*)/
-        heading = $1
-    end
-    return heading.gsub(' -- ', ' – ')
-end
-
-# Returns true if the line is the start of a generic documentation section. Such
-# section must start with the # symbol, i.e. a markdown heading, on the first or
-# the second line.
-def is_section_doc(src, i)
-    return src[i] =~ /^\/\*\*? \#/ ||
-           (src[i] =~ /^\/\*/ && src[i+1] =~ /^ ?\* \#/)
-end
-
-def is_func_line(src, i)
-  line = src[i]
-  return line =~ /RM_/ &&
-         line[0] != ' ' && line[0] != '#' && line[0] != '/' &&
-         src[i-1] =~ /\*\//
-end
-
-puts "# Modules API reference\n\n"
-puts "<!-- This file is generated from module.c using gendoc.rb -->\n\n"
-src = File.open(File.dirname(__FILE__) ++ "/../module.c").to_a
-
-# Build function index
-$index = {}
-src.each_with_index do |line,i|
-    if is_func_line(src, i)
-        line =~ /RM_([A-z0-9]+)/
-        name = "RedisModule_#{$1}"
-        $index[name] = true
-    end
-end
-
-# Print TOC
-puts "## Sections\n\n"
-src.each_with_index do |_line,i|
-    if is_section_doc(src, i)
-        name = get_section_heading(src, i)
-        puts "* [#{name}](\##{section_name_to_id(name)})\n"
-    end
-end
-puts "* [Function index](#section-function-index)\n\n"
-
-# Docufy: Print function prototype and markdown docs
-src.each_with_index do |_line,i|
-    if is_func_line(src, i)
-        docufy(src, i)
-    elsif is_section_doc(src, i)
-        section_doc(src, i)
-    end
-end
-
-# Print function index
-puts "<span id=\"section-function-index\"></span>\n\n"
-puts "## Function index\n\n"
-$index.keys.sort.each{|x| puts "* [`#{x}`](\##{x})\n"}
-puts "\n"
diff --git a/redis-stable/src/modules/helloacl.c b/redis-stable/src/modules/helloacl.c
deleted file mode 100644
index 6766c0a5..00000000
--- a/redis-stable/src/modules/helloacl.c
+++ /dev/null
@@ -1,191 +0,0 @@
-/* ACL API example - An example for performing custom synchronous and
- * asynchronous password authentication.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright 2019 Amazon.com, Inc. or its affiliates.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <pthread.h>
-#include <unistd.h>
-
-// A simple global user
-static RedisModuleUser *global;
-static uint64_t global_auth_client_id = 0;
-
-/* HELLOACL.REVOKE 
- * Synchronously revoke access from a user. */
-int RevokeCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (global_auth_client_id) {
-        RedisModule_DeauthenticateAndCloseClient(ctx, global_auth_client_id);
-        return RedisModule_ReplyWithSimpleString(ctx, "OK");
-    } else {
-        return RedisModule_ReplyWithError(ctx, "Global user currently not used");    
-    }
-}
-
-/* HELLOACL.RESET 
- * Synchronously delete and re-create a module user. */
-int ResetCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_FreeModuleUser(global);
-    global = RedisModule_CreateModuleUser("global");
-    RedisModule_SetModuleUserACL(global, "allcommands");
-    RedisModule_SetModuleUserACL(global, "allkeys");
-    RedisModule_SetModuleUserACL(global, "on");
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* Callback handler for user changes, use this to notify a module of 
- * changes to users authenticated by the module */
-void HelloACL_UserChanged(uint64_t client_id, void *privdata) {
-    REDISMODULE_NOT_USED(privdata);
-    REDISMODULE_NOT_USED(client_id);
-    global_auth_client_id = 0;
-}
-
-/* HELLOACL.AUTHGLOBAL 
- * Synchronously assigns a module user to the current context. */
-int AuthGlobalCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (global_auth_client_id) {
-        return RedisModule_ReplyWithError(ctx, "Global user currently used");    
-    }
-
-    RedisModule_AuthenticateClientWithUser(ctx, global, HelloACL_UserChanged, NULL, &global_auth_client_id);
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-#define TIMEOUT_TIME 1000
-
-/* Reply callback for auth command HELLOACL.AUTHASYNC */
-int HelloACL_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    size_t length;
-
-    RedisModuleString *user_string = RedisModule_GetBlockedClientPrivateData(ctx);
-    const char *name = RedisModule_StringPtrLen(user_string, &length);
-
-    if (RedisModule_AuthenticateClientWithACLUser(ctx, name, length, NULL, NULL, NULL) == 
-            REDISMODULE_ERR) {
-        return RedisModule_ReplyWithError(ctx, "Invalid Username or password");    
-    }
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* Timeout callback for auth command HELLOACL.AUTHASYNC */
-int HelloACL_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
-}
-
-/* Private data frees data for HELLOACL.AUTHASYNC command. */
-void HelloACL_FreeData(RedisModuleCtx *ctx, void *privdata) {
-    REDISMODULE_NOT_USED(ctx);
-    RedisModule_FreeString(NULL, privdata);
-}
-
-/* Background authentication can happen here. */
-void *HelloACL_ThreadMain(void *args) {
-    void **targs = args;
-    RedisModuleBlockedClient *bc = targs[0];
-    RedisModuleString *user = targs[1];
-    RedisModule_Free(targs);
-
-    RedisModule_UnblockClient(bc,user);
-    return NULL;
-}
-
-/* HELLOACL.AUTHASYNC 
- * Asynchronously assigns an ACL user to the current context. */
-int AuthAsyncCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-
-    pthread_t tid;
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx, HelloACL_Reply, HelloACL_Timeout, HelloACL_FreeData, TIMEOUT_TIME);
-    
-
-    void **targs = RedisModule_Alloc(sizeof(void*)*2);
-    targs[0] = bc;
-    targs[1] = RedisModule_CreateStringFromString(NULL, argv[1]);
-
-    if (pthread_create(&tid, NULL, HelloACL_ThreadMain, targs) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx, "-ERR Can't start thread");
-    }
-
-    return REDISMODULE_OK;
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"helloacl",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"helloacl.reset",
-        ResetCommand_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"helloacl.revoke",
-        RevokeCommand_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"helloacl.authglobal",
-        AuthGlobalCommand_RedisCommand,"no-auth",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"helloacl.authasync",
-        AuthAsyncCommand_RedisCommand,"no-auth",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    global = RedisModule_CreateModuleUser("global");
-    RedisModule_SetModuleUserACL(global, "allcommands");
-    RedisModule_SetModuleUserACL(global, "allkeys");
-    RedisModule_SetModuleUserACL(global, "on");
-
-    global_auth_client_id = 0;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/helloblock.c b/redis-stable/src/modules/helloblock.c
deleted file mode 100644
index b90ccaa5..00000000
--- a/redis-stable/src/modules/helloblock.c
+++ /dev/null
@@ -1,219 +0,0 @@
-/* Helloblock module -- An example of blocking command implementation
- * with threads.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <pthread.h>
-#include <unistd.h>
-
-/* Reply callback for blocking command HELLO.BLOCK */
-int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    int *myint = RedisModule_GetBlockedClientPrivateData(ctx);
-    return RedisModule_ReplyWithLongLong(ctx,*myint);
-}
-
-/* Timeout callback for blocking command HELLO.BLOCK */
-int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
-}
-
-/* Private data freeing callback for HELLO.BLOCK command. */
-void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
-    REDISMODULE_NOT_USED(ctx);
-    RedisModule_Free(privdata);
-}
-
-/* The thread entry point that actually executes the blocking part
- * of the command HELLO.BLOCK. */
-void *HelloBlock_ThreadMain(void *arg) {
-    void **targ = arg;
-    RedisModuleBlockedClient *bc = targ[0];
-    long long delay = (unsigned long)targ[1];
-    RedisModule_Free(targ);
-
-    sleep(delay);
-    int *r = RedisModule_Alloc(sizeof(int));
-    *r = rand();
-    RedisModule_UnblockClient(bc,r);
-    return NULL;
-}
-
-/* An example blocked client disconnection callback.
- *
- * Note that in the case of the HELLO.BLOCK command, the blocked client is now
- * owned by the thread calling sleep(). In this specific case, there is not
- * much we can do, however normally we could instead implement a way to
- * signal the thread that the client disconnected, and sleep the specified
- * amount of seconds with a while loop calling sleep(1), so that once we
- * detect the client disconnection, we can terminate the thread ASAP. */
-void HelloBlock_Disconnected(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc) {
-    RedisModule_Log(ctx,"warning","Blocked client %p disconnected!",
-        (void*)bc);
-
-    /* Here you should cleanup your state / threads, and if possible
-     * call RedisModule_UnblockClient(), or notify the thread that will
-     * call the function ASAP. */
-}
-
-/* HELLO.BLOCK <delay> <timeout> -- Block for <count> seconds, then reply with
- * a random number. Timeout is the command timeout, so that you can test
- * what happens when the delay is greater than the timeout. */
-int HelloBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    long long delay;
-    long long timeout;
-
-    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    pthread_t tid;
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
-
-    /* Here we set a disconnection handler, however since this module will
-     * block in sleep() in a thread, there is not much we can do in the
-     * callback, so this is just to show you the API. */
-    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
-
-    /* Now that we setup a blocking client, we need to pass the control
-     * to the thread. However we need to pass arguments to the thread:
-     * the delay and a reference to the blocked client handle. */
-    void **targ = RedisModule_Alloc(sizeof(void*)*2);
-    targ[0] = bc;
-    targ[1] = (void*)(unsigned long) delay;
-
-    if (pthread_create(&tid,NULL,HelloBlock_ThreadMain,targ) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    }
-    return REDISMODULE_OK;
-}
-
-/* The thread entry point that actually executes the blocking part
- * of the command HELLO.KEYS.
- *
- * Note: this implementation is very simple on purpose, so no duplicated
- * keys (returned by SCAN) are filtered. However adding such a functionality
- * would be trivial just using any data structure implementing a dictionary
- * in order to filter the duplicated items. */
-void *HelloKeys_ThreadMain(void *arg) {
-    RedisModuleBlockedClient *bc = arg;
-    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bc);
-    long long cursor = 0;
-    size_t replylen = 0;
-
-    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
-    do {
-        RedisModule_ThreadSafeContextLock(ctx);
-        RedisModuleCallReply *reply = RedisModule_Call(ctx,
-            "SCAN","l",(long long)cursor);
-        RedisModule_ThreadSafeContextUnlock(ctx);
-
-        RedisModuleCallReply *cr_cursor =
-            RedisModule_CallReplyArrayElement(reply,0);
-        RedisModuleCallReply *cr_keys =
-            RedisModule_CallReplyArrayElement(reply,1);
-
-        RedisModuleString *s = RedisModule_CreateStringFromCallReply(cr_cursor);
-        RedisModule_StringToLongLong(s,&cursor);
-        RedisModule_FreeString(ctx,s);
-
-        size_t items = RedisModule_CallReplyLength(cr_keys);
-        for (size_t j = 0; j < items; j++) {
-            RedisModuleCallReply *ele =
-                RedisModule_CallReplyArrayElement(cr_keys,j);
-            RedisModule_ReplyWithCallReply(ctx,ele);
-            replylen++;
-        }
-        RedisModule_FreeCallReply(reply);
-    } while (cursor != 0);
-    RedisModule_ReplySetArrayLength(ctx,replylen);
-
-    RedisModule_FreeThreadSafeContext(ctx);
-    RedisModule_UnblockClient(bc,NULL);
-    return NULL;
-}
-
-/* HELLO.KEYS -- Return all the keys in the current database without blocking
- * the server. The keys do not represent a point-in-time state so only the keys
- * that were in the database from the start to the end are guaranteed to be
- * there. */
-int HelloKeys_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    if (argc != 1) return RedisModule_WrongArity(ctx);
-
-    pthread_t tid;
-
-    /* Note that when blocking the client we do not set any callback: no
-     * timeout is possible since we passed '0', nor we need a reply callback
-     * because we'll use the thread safe context to accumulate a reply. */
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,NULL,NULL,NULL,0);
-
-    /* Now that we setup a blocking client, we need to pass the control
-     * to the thread. However we need to pass arguments to the thread:
-     * the reference to the blocked client handle. */
-    if (pthread_create(&tid,NULL,HelloKeys_ThreadMain,bc) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    }
-    return REDISMODULE_OK;
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"helloblock",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.block",
-        HelloBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"hello.keys",
-        HelloKeys_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/hellocluster.c b/redis-stable/src/modules/hellocluster.c
deleted file mode 100644
index cb78187f..00000000
--- a/redis-stable/src/modules/hellocluster.c
+++ /dev/null
@@ -1,118 +0,0 @@
-/* Helloworld cluster -- A ping/pong cluster API example.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-
-#define MSGTYPE_PING 1
-#define MSGTYPE_PONG 2
-
-/* HELLOCLUSTER.PINGALL */
-int PingallCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_SendClusterMessage(ctx,NULL,MSGTYPE_PING,(unsigned char*)"Hey",3);
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* HELLOCLUSTER.LIST */
-int ListCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    size_t numnodes;
-    char **ids = RedisModule_GetClusterNodesList(ctx,&numnodes);
-    if (ids == NULL) {
-        return RedisModule_ReplyWithError(ctx,"Cluster not enabled");
-    }
-
-    RedisModule_ReplyWithArray(ctx,numnodes);
-    for (size_t j = 0; j < numnodes; j++) {
-        int port;
-        RedisModule_GetClusterNodeInfo(ctx,ids[j],NULL,NULL,&port,NULL);
-        RedisModule_ReplyWithArray(ctx,2);
-        RedisModule_ReplyWithStringBuffer(ctx,ids[j],REDISMODULE_NODE_ID_LEN);
-        RedisModule_ReplyWithLongLong(ctx,port);
-    }
-    RedisModule_FreeClusterNodesList(ids);
-    return REDISMODULE_OK;
-}
-
-/* Callback for message MSGTYPE_PING */
-void PingReceiver(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len) {
-    RedisModule_Log(ctx,"notice","PING (type %d) RECEIVED from %.*s: '%.*s'",
-        type,REDISMODULE_NODE_ID_LEN,sender_id,(int)len, payload);
-    RedisModule_SendClusterMessage(ctx,NULL,MSGTYPE_PONG,(unsigned char*)"Ohi!",4);
-    RedisModule_Call(ctx, "INCR", "c", "pings_received");
-}
-
-/* Callback for message MSGTYPE_PONG. */
-void PongReceiver(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len) {
-    RedisModule_Log(ctx,"notice","PONG (type %d) RECEIVED from %.*s: '%.*s'",
-        type,REDISMODULE_NODE_ID_LEN,sender_id,(int)len, payload);
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"hellocluster",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellocluster.pingall",
-        PingallCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellocluster.list",
-        ListCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    /* Disable Redis Cluster sharding and redirections. This way every node
-     * will be able to access every possible key, regardless of the hash slot.
-     * This way the PING message handler will be able to increment a specific
-     * variable. Normally you do that in order for the distributed system
-     * you create as a module to have total freedom in the keyspace
-     * manipulation. */
-    RedisModule_SetClusterFlags(ctx,REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION);
-
-    /* Register our handlers for different message types. */
-    RedisModule_RegisterClusterMessageReceiver(ctx,MSGTYPE_PING,PingReceiver);
-    RedisModule_RegisterClusterMessageReceiver(ctx,MSGTYPE_PONG,PongReceiver);
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/hellodict.c b/redis-stable/src/modules/hellodict.c
deleted file mode 100644
index 1428a138..00000000
--- a/redis-stable/src/modules/hellodict.c
+++ /dev/null
@@ -1,132 +0,0 @@
-/* Hellodict -- An example of modules dictionary API
- *
- * This module implements a volatile key-value store on top of the
- * dictionary exported by the Redis modules API.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-
-static RedisModuleDict *Keyspace;
-
-/* HELLODICT.SET <key> <value>
- *
- * Set the specified key to the specified value. */
-int cmd_SET(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    RedisModule_DictSet(Keyspace,argv[1],argv[2]);
-    /* We need to keep a reference to the value stored at the key, otherwise
-     * it would be freed when this callback returns. */
-    RedisModule_RetainString(NULL,argv[2]);
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* HELLODICT.GET <key>
- *
- * Return the value of the specified key, or a null reply if the key
- * is not defined. */
-int cmd_GET(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    RedisModuleString *val = RedisModule_DictGet(Keyspace,argv[1],NULL);
-    if (val == NULL) {
-        return RedisModule_ReplyWithNull(ctx);
-    } else {
-        return RedisModule_ReplyWithString(ctx, val);
-    }
-}
-
-/* HELLODICT.KEYRANGE <startkey> <endkey> <count>
- *
- * Return a list of matching keys, lexicographically between startkey
- * and endkey. No more than 'count' items are emitted. */
-int cmd_KEYRANGE(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-
-    /* Parse the count argument. */
-    long long count;
-    if (RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    /* Seek the iterator. */
-    RedisModuleDictIter *iter = RedisModule_DictIteratorStart(
-        Keyspace, ">=", argv[1]);
-
-    /* Reply with the matching items. */
-    char *key;
-    size_t keylen;
-    long long replylen = 0; /* Keep track of the amitted array len. */
-    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
-    while((key = RedisModule_DictNextC(iter,&keylen,NULL)) != NULL) {
-        if (replylen >= count) break;
-        if (RedisModule_DictCompare(iter,"<=",argv[2]) == REDISMODULE_ERR)
-            break;
-        RedisModule_ReplyWithStringBuffer(ctx,key,keylen);
-        replylen++;
-    }
-    RedisModule_ReplySetArrayLength(ctx,replylen);
-
-    /* Cleanup. */
-    RedisModule_DictIteratorStop(iter);
-    return REDISMODULE_OK;
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"hellodict",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellodict.set",
-        cmd_SET,"write deny-oom",1,1,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellodict.get",
-        cmd_GET,"readonly",1,1,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellodict.keyrange",
-        cmd_KEYRANGE,"readonly",1,1,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    /* Create our global dictionary. Here we'll set our keys and values. */
-    Keyspace = RedisModule_CreateDict(NULL);
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/hellohook.c b/redis-stable/src/modules/hellohook.c
deleted file mode 100644
index b451bd97..00000000
--- a/redis-stable/src/modules/hellohook.c
+++ /dev/null
@@ -1,93 +0,0 @@
-/* Server hooks API example
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-
-/* Client state change callback. */
-void clientChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(ctx);
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleClientInfo *ci = data;
-    printf("Client %s event for client #%llu %s:%d\n",
-        (sub == REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED) ?
-            "connection" : "disconnection",
-        (unsigned long long)ci->id,ci->addr,ci->port);
-}
-
-void flushdbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(ctx);
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleFlushInfo *fi = data;
-    if (sub == REDISMODULE_SUBEVENT_FLUSHDB_START) {
-        if (fi->dbnum != -1) {
-            RedisModuleCallReply *reply;
-            reply = RedisModule_Call(ctx,"DBSIZE","");
-            long long numkeys = RedisModule_CallReplyInteger(reply);
-            printf("FLUSHDB event of database %d started (%lld keys in DB)\n",
-                fi->dbnum, numkeys);
-            RedisModule_FreeCallReply(reply);
-        } else {
-            printf("FLUSHALL event started\n");
-        }
-    } else {
-        if (fi->dbnum != -1) {
-            printf("FLUSHDB event of database %d ended\n",fi->dbnum);
-        } else {
-            printf("FLUSHALL event ended\n");
-        }
-    }
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"hellohook",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ClientChange, clientChangeCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_FlushDB, flushdbCallback);
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/hellotimer.c b/redis-stable/src/modules/hellotimer.c
deleted file mode 100644
index f6700df2..00000000
--- a/redis-stable/src/modules/hellotimer.c
+++ /dev/null
@@ -1,76 +0,0 @@
-/* Timer API example -- Register and handle timer events
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-
-/* Timer callback. */
-void timerHandler(RedisModuleCtx *ctx, void *data) {
-    REDISMODULE_NOT_USED(ctx);
-    printf("Fired %s!\n", (char *)data);
-    RedisModule_Free(data);
-}
-
-/* HELLOTIMER.TIMER*/
-int TimerCommand_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    for (int j = 0; j < 10; j++) {
-        int delay = rand() % 5000;
-        char *buf = RedisModule_Alloc(256);
-        snprintf(buf,256,"After %d", delay);
-        RedisModuleTimerID tid = RedisModule_CreateTimer(ctx,delay,timerHandler,buf);
-        REDISMODULE_NOT_USED(tid);
-    }
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"hellotimer",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellotimer.timer",
-        TimerCommand_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/hellotype.c b/redis-stable/src/modules/hellotype.c
deleted file mode 100644
index 4f2d1d73..00000000
--- a/redis-stable/src/modules/hellotype.c
+++ /dev/null
@@ -1,362 +0,0 @@
-/* This file implements a new module native data type called "HELLOTYPE".
- * The data structure implemented is a very simple ordered linked list of
- * 64 bit integers, in order to have something that is real world enough, but
- * at the same time, extremely simple to understand, to show how the API
- * works, how a new data type is created, and how to write basic methods
- * for RDB loading, saving and AOF rewriting.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-#include <stdint.h>
-
-static RedisModuleType *HelloType;
-
-/* ========================== Internal data structure  =======================
- * This is just a linked list of 64 bit integers where elements are inserted
- * in-place, so it's ordered. There is no pop/push operation but just insert
- * because it is enough to show the implementation of new data types without
- * making things complex. */
-
-struct HelloTypeNode {
-    int64_t value;
-    struct HelloTypeNode *next;
-};
-
-struct HelloTypeObject {
-    struct HelloTypeNode *head;
-    size_t len; /* Number of elements added. */
-};
-
-struct HelloTypeObject *createHelloTypeObject(void) {
-    struct HelloTypeObject *o;
-    o = RedisModule_Alloc(sizeof(*o));
-    o->head = NULL;
-    o->len = 0;
-    return o;
-}
-
-void HelloTypeInsert(struct HelloTypeObject *o, int64_t ele) {
-    struct HelloTypeNode *next = o->head, *newnode, *prev = NULL;
-
-    while(next && next->value < ele) {
-        prev = next;
-        next = next->next;
-    }
-    newnode = RedisModule_Alloc(sizeof(*newnode));
-    newnode->value = ele;
-    newnode->next = next;
-    if (prev) {
-        prev->next = newnode;
-    } else {
-        o->head = newnode;
-    }
-    o->len++;
-}
-
-void HelloTypeReleaseObject(struct HelloTypeObject *o) {
-    struct HelloTypeNode *cur, *next;
-    cur = o->head;
-    while(cur) {
-        next = cur->next;
-        RedisModule_Free(cur);
-        cur = next;
-    }
-    RedisModule_Free(o);
-}
-
-/* ========================= "hellotype" type commands ======================= */
-
-/* HELLOTYPE.INSERT key value */
-int HelloTypeInsert_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != HelloType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    long long value;
-    if ((RedisModule_StringToLongLong(argv[2],&value) != REDISMODULE_OK)) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid value: must be a signed 64 bit integer");
-    }
-
-    /* Create an empty value object if the key is currently empty. */
-    struct HelloTypeObject *hto;
-    if (type == REDISMODULE_KEYTYPE_EMPTY) {
-        hto = createHelloTypeObject();
-        RedisModule_ModuleTypeSetValue(key,HelloType,hto);
-    } else {
-        hto = RedisModule_ModuleTypeGetValue(key);
-    }
-
-    /* Insert the new element. */
-    HelloTypeInsert(hto,value);
-    RedisModule_SignalKeyAsReady(ctx,argv[1]);
-
-    RedisModule_ReplyWithLongLong(ctx,hto->len);
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-/* HELLOTYPE.RANGE key first count */
-int HelloTypeRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != HelloType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    long long first, count;
-    if (RedisModule_StringToLongLong(argv[2],&first) != REDISMODULE_OK ||
-        RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK ||
-        first < 0 || count < 0)
-    {
-        return RedisModule_ReplyWithError(ctx,
-            "ERR invalid first or count parameters");
-    }
-
-    struct HelloTypeObject *hto = RedisModule_ModuleTypeGetValue(key);
-    struct HelloTypeNode *node = hto ? hto->head : NULL;
-    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
-    long long arraylen = 0;
-    while(node && count--) {
-        RedisModule_ReplyWithLongLong(ctx,node->value);
-        arraylen++;
-        node = node->next;
-    }
-    RedisModule_ReplySetArrayLength(ctx,arraylen);
-    return REDISMODULE_OK;
-}
-
-/* HELLOTYPE.LEN key */
-int HelloTypeLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != HelloType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    struct HelloTypeObject *hto = RedisModule_ModuleTypeGetValue(key);
-    RedisModule_ReplyWithLongLong(ctx,hto ? hto->len : 0);
-    return REDISMODULE_OK;
-}
-
-/* ====================== Example of a blocking command ==================== */
-
-/* Reply callback for blocking command HELLOTYPE.BRANGE, this will get
- * called when the key we blocked for is ready: we need to check if we
- * can really serve the client, and reply OK or ERR accordingly. */
-int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,keyname,REDISMODULE_READ);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_MODULE ||
-        RedisModule_ModuleTypeGetType(key) != HelloType)
-    {
-        RedisModule_CloseKey(key);
-        return REDISMODULE_ERR;
-    }
-
-    /* In case the key is able to serve our blocked client, let's directly
-     * use our original command implementation to make this example simpler. */
-    RedisModule_CloseKey(key);
-    return HelloTypeRange_RedisCommand(ctx,argv,argc-1);
-}
-
-/* Timeout callback for blocking command HELLOTYPE.BRANGE */
-int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
-}
-
-/* Private data freeing callback for HELLOTYPE.BRANGE command. */
-void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
-    REDISMODULE_NOT_USED(ctx);
-    RedisModule_Free(privdata);
-}
-
-/* HELLOTYPE.BRANGE key first count timeout -- This is a blocking verison of
- * the RANGE operation, in order to show how to use the API
- * RedisModule_BlockClientOnKeys(). */
-int HelloTypeBRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 5) return RedisModule_WrongArity(ctx);
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != HelloType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    /* Parse the timeout before even trying to serve the client synchronously,
-     * so that we always fail ASAP on syntax errors. */
-    long long timeout;
-    if (RedisModule_StringToLongLong(argv[4],&timeout) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,
-            "ERR invalid timeout parameter");
-    }
-
-    /* Can we serve the reply synchronously? */
-    if (type != REDISMODULE_KEYTYPE_EMPTY) {
-        return HelloTypeRange_RedisCommand(ctx,argv,argc-1);
-    }
-
-    /* Otherwise let's block on the key. */
-    void *privdata = RedisModule_Alloc(100);
-    RedisModule_BlockClientOnKeys(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout,argv+1,1,privdata);
-    return REDISMODULE_OK;
-}
-
-/* ========================== "hellotype" type methods ======================= */
-
-void *HelloTypeRdbLoad(RedisModuleIO *rdb, int encver) {
-    if (encver != 0) {
-        /* RedisModule_Log("warning","Can't load data with version %d", encver);*/
-        return NULL;
-    }
-    uint64_t elements = RedisModule_LoadUnsigned(rdb);
-    struct HelloTypeObject *hto = createHelloTypeObject();
-    while(elements--) {
-        int64_t ele = RedisModule_LoadSigned(rdb);
-        HelloTypeInsert(hto,ele);
-    }
-    return hto;
-}
-
-void HelloTypeRdbSave(RedisModuleIO *rdb, void *value) {
-    struct HelloTypeObject *hto = value;
-    struct HelloTypeNode *node = hto->head;
-    RedisModule_SaveUnsigned(rdb,hto->len);
-    while(node) {
-        RedisModule_SaveSigned(rdb,node->value);
-        node = node->next;
-    }
-}
-
-void HelloTypeAofRewrite(RedisModuleIO *aof, RedisModuleString *key, void *value) {
-    struct HelloTypeObject *hto = value;
-    struct HelloTypeNode *node = hto->head;
-    while(node) {
-        RedisModule_EmitAOF(aof,"HELLOTYPE.INSERT","sl",key,node->value);
-        node = node->next;
-    }
-}
-
-/* The goal of this function is to return the amount of memory used by
- * the HelloType value. */
-size_t HelloTypeMemUsage(const void *value) {
-    const struct HelloTypeObject *hto = value;
-    struct HelloTypeNode *node = hto->head;
-    return sizeof(*hto) + sizeof(*node)*hto->len;
-}
-
-void HelloTypeFree(void *value) {
-    HelloTypeReleaseObject(value);
-}
-
-void HelloTypeDigest(RedisModuleDigest *md, void *value) {
-    struct HelloTypeObject *hto = value;
-    struct HelloTypeNode *node = hto->head;
-    while(node) {
-        RedisModule_DigestAddLongLong(md,node->value);
-        node = node->next;
-    }
-    RedisModule_DigestEndSequence(md);
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"hellotype",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    RedisModuleTypeMethods tm = {
-        .version = REDISMODULE_TYPE_METHOD_VERSION,
-        .rdb_load = HelloTypeRdbLoad,
-        .rdb_save = HelloTypeRdbSave,
-        .aof_rewrite = HelloTypeAofRewrite,
-        .mem_usage = HelloTypeMemUsage,
-        .free = HelloTypeFree,
-        .digest = HelloTypeDigest
-    };
-
-    HelloType = RedisModule_CreateDataType(ctx,"hellotype",0,&tm);
-    if (HelloType == NULL) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellotype.insert",
-        HelloTypeInsert_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellotype.range",
-        HelloTypeRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellotype.len",
-        HelloTypeLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hellotype.brange",
-        HelloTypeBRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/modules/helloworld.c b/redis-stable/src/modules/helloworld.c
deleted file mode 100644
index 043f5be3..00000000
--- a/redis-stable/src/modules/helloworld.c
+++ /dev/null
@@ -1,621 +0,0 @@
-/* Helloworld module -- A few examples of the Redis Modules API in the form
- * of commands showing how to accomplish common tasks.
- *
- * This module does not do anything useful, if not for a few commands. The
- * examples are designed in order to show the API.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "../redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-
-/* HELLO.SIMPLE is among the simplest commands you can implement.
- * It just returns the currently selected DB id, a functionality which is
- * missing in Redis. The command uses two important API calls: one to
- * fetch the currently selected DB, the other in order to send the client
- * an integer reply as response. */
-int HelloSimple_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModule_ReplyWithLongLong(ctx,RedisModule_GetSelectedDb(ctx));
-    return REDISMODULE_OK;
-}
-
-/* HELLO.PUSH.NATIVE re-implements RPUSH, and shows the low level modules API
- * where you can "open" keys, make low level operations, create new keys by
- * pushing elements into non-existing keys, and so forth.
- *
- * You'll find this command to be roughly as fast as the actual RPUSH
- * command. */
-int HelloPushNative_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-
-    RedisModule_ListPush(key,REDISMODULE_LIST_TAIL,argv[2]);
-    size_t newlen = RedisModule_ValueLength(key);
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithLongLong(ctx,newlen);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.PUSH.CALL implements RPUSH using an higher level approach, calling
- * a Redis command instead of working with the key in a low level way. This
- * approach is useful when you need to call Redis commands that are not
- * available as low level APIs, or when you don't need the maximum speed
- * possible but instead prefer implementation simplicity. */
-int HelloPushCall_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply *reply;
-
-    reply = RedisModule_Call(ctx,"RPUSH","ss",argv[1],argv[2]);
-    long long len = RedisModule_CallReplyInteger(reply);
-    RedisModule_FreeCallReply(reply);
-    RedisModule_ReplyWithLongLong(ctx,len);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.PUSH.CALL2
- * This is exactly as HELLO.PUSH.CALL, but shows how we can reply to the
- * client using directly a reply object that Call() returned. */
-int HelloPushCall2_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply *reply;
-
-    reply = RedisModule_Call(ctx,"RPUSH","ss",argv[1],argv[2]);
-    RedisModule_ReplyWithCallReply(ctx,reply);
-    RedisModule_FreeCallReply(reply);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.LIST.SUM.LEN returns the total length of all the items inside
- * a Redis list, by using the high level Call() API.
- * This command is an example of the array reply access. */
-int HelloListSumLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply *reply;
-
-    reply = RedisModule_Call(ctx,"LRANGE","sll",argv[1],(long long)0,(long long)-1);
-    size_t strlen = 0;
-    size_t items = RedisModule_CallReplyLength(reply);
-    size_t j;
-    for (j = 0; j < items; j++) {
-        RedisModuleCallReply *ele = RedisModule_CallReplyArrayElement(reply,j);
-        strlen += RedisModule_CallReplyLength(ele);
-    }
-    RedisModule_FreeCallReply(reply);
-    RedisModule_ReplyWithLongLong(ctx,strlen);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.LIST.SPLICE srclist dstlist count
- * Moves 'count' elements from the tail of 'srclist' to the head of
- * 'dstlist'. If less than count elements are available, it moves as much
- * elements as possible. */
-int HelloListSplice_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *srckey = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    RedisModuleKey *dstkey = RedisModule_OpenKey(ctx,argv[2],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-
-    /* Src and dst key must be empty or lists. */
-    if ((RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_LIST &&
-         RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_EMPTY) ||
-        (RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_LIST &&
-         RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_EMPTY))
-    {
-        RedisModule_CloseKey(srckey);
-        RedisModule_CloseKey(dstkey);
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    long long count;
-    if ((RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) ||
-        (count < 0)) {
-        RedisModule_CloseKey(srckey);
-        RedisModule_CloseKey(dstkey);
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    while(count-- > 0) {
-        RedisModuleString *ele;
-
-        ele = RedisModule_ListPop(srckey,REDISMODULE_LIST_TAIL);
-        if (ele == NULL) break;
-        RedisModule_ListPush(dstkey,REDISMODULE_LIST_HEAD,ele);
-        RedisModule_FreeString(ctx,ele);
-    }
-
-    size_t len = RedisModule_ValueLength(srckey);
-    RedisModule_CloseKey(srckey);
-    RedisModule_CloseKey(dstkey);
-    RedisModule_ReplyWithLongLong(ctx,len);
-    return REDISMODULE_OK;
-}
-
-/* Like the HELLO.LIST.SPLICE above, but uses automatic memory management
- * in order to avoid freeing stuff. */
-int HelloListSpliceAuto_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-
-    RedisModule_AutoMemory(ctx);
-
-    RedisModuleKey *srckey = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    RedisModuleKey *dstkey = RedisModule_OpenKey(ctx,argv[2],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-
-    /* Src and dst key must be empty or lists. */
-    if ((RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_LIST &&
-         RedisModule_KeyType(srckey) != REDISMODULE_KEYTYPE_EMPTY) ||
-        (RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_LIST &&
-         RedisModule_KeyType(dstkey) != REDISMODULE_KEYTYPE_EMPTY))
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    long long count;
-    if ((RedisModule_StringToLongLong(argv[3],&count) != REDISMODULE_OK) ||
-        (count < 0))
-    {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    while(count-- > 0) {
-        RedisModuleString *ele;
-
-        ele = RedisModule_ListPop(srckey,REDISMODULE_LIST_TAIL);
-        if (ele == NULL) break;
-        RedisModule_ListPush(dstkey,REDISMODULE_LIST_HEAD,ele);
-    }
-
-    size_t len = RedisModule_ValueLength(srckey);
-    RedisModule_ReplyWithLongLong(ctx,len);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.RAND.ARRAY <count>
- * Shows how to generate arrays as commands replies.
- * It just outputs <count> random numbers. */
-int HelloRandArray_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    long long count;
-    if (RedisModule_StringToLongLong(argv[1],&count) != REDISMODULE_OK ||
-        count < 0)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-
-    /* To reply with an array, we call RedisModule_ReplyWithArray() followed
-     * by other "count" calls to other reply functions in order to generate
-     * the elements of the array. */
-    RedisModule_ReplyWithArray(ctx,count);
-    while(count--) RedisModule_ReplyWithLongLong(ctx,rand());
-    return REDISMODULE_OK;
-}
-
-/* This is a simple command to test replication. Because of the "!" modified
- * in the RedisModule_Call() call, the two INCRs get replicated.
- * Also note how the ECHO is replicated in an unexpected position (check
- * comments the function implementation). */
-int HelloRepl1_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModule_AutoMemory(ctx);
-
-    /* This will be replicated *after* the two INCR statements, since
-     * the Call() replication has precedence, so the actual replication
-     * stream will be:
-     *
-     * MULTI
-     * INCR foo
-     * INCR bar
-     * ECHO c foo
-     * EXEC
-     */
-    RedisModule_Replicate(ctx,"ECHO","c","foo");
-
-    /* Using the "!" modifier we replicate the command if it
-     * modified the dataset in some way. */
-    RedisModule_Call(ctx,"INCR","c!","foo");
-    RedisModule_Call(ctx,"INCR","c!","bar");
-
-    RedisModule_ReplyWithLongLong(ctx,0);
-
-    return REDISMODULE_OK;
-}
-
-/* Another command to show replication. In this case, we call
- * RedisModule_ReplicateVerbatim() to mean we want just the command to be
- * propagated to slaves / AOF exactly as it was called by the user.
- *
- * This command also shows how to work with string objects.
- * It takes a list, and increments all the elements (that must have
- * a numerical value) by 1, returning the sum of all the elements
- * as reply.
- *
- * Usage: HELLO.REPL2 <list-key> */
-int HelloRepl2_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-
-    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_LIST)
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-
-    size_t listlen = RedisModule_ValueLength(key);
-    long long sum = 0;
-
-    /* Rotate and increment. */
-    while(listlen--) {
-        RedisModuleString *ele = RedisModule_ListPop(key,REDISMODULE_LIST_TAIL);
-        long long val;
-        if (RedisModule_StringToLongLong(ele,&val) != REDISMODULE_OK) val = 0;
-        val++;
-        sum += val;
-        RedisModuleString *newele = RedisModule_CreateStringFromLongLong(ctx,val);
-        RedisModule_ListPush(key,REDISMODULE_LIST_HEAD,newele);
-    }
-    RedisModule_ReplyWithLongLong(ctx,sum);
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-/* This is an example of strings DMA access. Given a key containing a string
- * it toggles the case of each character from lower to upper case or the
- * other way around.
- *
- * No automatic memory management is used in this example (for the sake
- * of variety).
- *
- * HELLO.TOGGLE.CASE key */
-int HelloToggleCase_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-
-    int keytype = RedisModule_KeyType(key);
-    if (keytype != REDISMODULE_KEYTYPE_STRING &&
-        keytype != REDISMODULE_KEYTYPE_EMPTY)
-    {
-        RedisModule_CloseKey(key);
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    if (keytype == REDISMODULE_KEYTYPE_STRING) {
-        size_t len, j;
-        char *s = RedisModule_StringDMA(key,&len,REDISMODULE_WRITE);
-        for (j = 0; j < len; j++) {
-            if (isupper(s[j])) {
-                s[j] = tolower(s[j]);
-            } else {
-                s[j] = toupper(s[j]);
-            }
-        }
-    }
-
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.MORE.EXPIRE key milliseconds.
- *
- * If the key has already an associated TTL, extends it by "milliseconds"
- * milliseconds. Otherwise no operation is performed. */
-int HelloMoreExpire_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-
-    mstime_t addms, expire;
-
-    if (RedisModule_StringToLongLong(argv[2],&addms) != REDISMODULE_OK)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid expire time");
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    expire = RedisModule_GetExpire(key);
-    if (expire != REDISMODULE_NO_EXPIRE) {
-        expire += addms;
-        RedisModule_SetExpire(key,expire);
-    }
-    return RedisModule_ReplyWithSimpleString(ctx,"OK");
-}
-
-/* HELLO.ZSUMRANGE key startscore endscore
- * Return the sum of all the scores elements between startscore and endscore.
- *
- * The computation is performed two times, one time from start to end and
- * another time backward. The two scores, returned as a two element array,
- * should match.*/
-int HelloZsumRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    double score_start, score_end;
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-
-    if (RedisModule_StringToDouble(argv[2],&score_start) != REDISMODULE_OK ||
-        RedisModule_StringToDouble(argv[3],&score_end) != REDISMODULE_OK)
-    {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid range");
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_ZSET) {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    double scoresum_a = 0;
-    double scoresum_b = 0;
-
-    RedisModule_ZsetFirstInScoreRange(key,score_start,score_end,0,0);
-    while(!RedisModule_ZsetRangeEndReached(key)) {
-        double score;
-        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
-        RedisModule_FreeString(ctx,ele);
-        scoresum_a += score;
-        RedisModule_ZsetRangeNext(key);
-    }
-    RedisModule_ZsetRangeStop(key);
-
-    RedisModule_ZsetLastInScoreRange(key,score_start,score_end,0,0);
-    while(!RedisModule_ZsetRangeEndReached(key)) {
-        double score;
-        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
-        RedisModule_FreeString(ctx,ele);
-        scoresum_b += score;
-        RedisModule_ZsetRangePrev(key);
-    }
-
-    RedisModule_ZsetRangeStop(key);
-
-    RedisModule_CloseKey(key);
-
-    RedisModule_ReplyWithArray(ctx,2);
-    RedisModule_ReplyWithDouble(ctx,scoresum_a);
-    RedisModule_ReplyWithDouble(ctx,scoresum_b);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.LEXRANGE key min_lex max_lex min_age max_age
- * This command expects a sorted set stored at key in the following form:
- * - All the elements have score 0.
- * - Elements are pairs of "<name>:<age>", for example "Anna:52".
- * The command will return all the sorted set items that are lexicographically
- * between the specified range (using the same format as ZRANGEBYLEX)
- * and having an age between min_age and max_age. */
-int HelloLexRange_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 6) return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_ZSET) {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    if (RedisModule_ZsetFirstInLexRange(key,argv[2],argv[3]) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"invalid range");
-    }
-
-    int arraylen = 0;
-    RedisModule_ReplyWithArray(ctx,REDISMODULE_POSTPONED_ARRAY_LEN);
-    while(!RedisModule_ZsetRangeEndReached(key)) {
-        double score;
-        RedisModuleString *ele = RedisModule_ZsetRangeCurrentElement(key,&score);
-        RedisModule_ReplyWithString(ctx,ele);
-        RedisModule_FreeString(ctx,ele);
-        RedisModule_ZsetRangeNext(key);
-        arraylen++;
-    }
-    RedisModule_ZsetRangeStop(key);
-    RedisModule_ReplySetArrayLength(ctx,arraylen);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.HCOPY key srcfield dstfield
- * This is just an example command that sets the hash field dstfield to the
- * same value of srcfield. If srcfield does not exist no operation is
- * performed.
- *
- * The command returns 1 if the copy is performed (srcfield exists) otherwise
- * 0 is returned. */
-int HelloHCopy_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_HASH &&
-        type != REDISMODULE_KEYTYPE_EMPTY)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    /* Get the old field value. */
-    RedisModuleString *oldval;
-    RedisModule_HashGet(key,REDISMODULE_HASH_NONE,argv[2],&oldval,NULL);
-    if (oldval) {
-        RedisModule_HashSet(key,REDISMODULE_HASH_NONE,argv[3],oldval,NULL);
-    }
-    RedisModule_ReplyWithLongLong(ctx,oldval != NULL);
-    return REDISMODULE_OK;
-}
-
-/* HELLO.LEFTPAD str len ch
- * This is an implementation of the infamous LEFTPAD function, that
- * was at the center of an issue with the npm modules system in March 2016.
- *
- * LEFTPAD is a good example of using a Redis Modules API called
- * "pool allocator", that was a famous way to allocate memory in yet another
- * open source project, the Apache web server.
- *
- * The concept is very simple: there is memory that is useful to allocate
- * only in the context of serving a request, and must be freed anyway when
- * the callback implementing the command returns. So in that case the module
- * does not need to retain a reference to these allocations, it is just
- * required to free the memory before returning. When this is the case the
- * module can call RedisModule_PoolAlloc() instead, that works like malloc()
- * but will automatically free the memory when the module callback returns.
- *
- * Note that PoolAlloc() does not necessarily require AutoMemory to be
- * active. */
-int HelloLeftPad_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-    long long padlen;
-
-    if (argc != 4) return RedisModule_WrongArity(ctx);
-
-    if ((RedisModule_StringToLongLong(argv[2],&padlen) != REDISMODULE_OK) ||
-        (padlen< 0)) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid padding length");
-    }
-    size_t strlen, chlen;
-    const char *str = RedisModule_StringPtrLen(argv[1], &strlen);
-    const char *ch = RedisModule_StringPtrLen(argv[3], &chlen);
-
-    /* If the string is already larger than the target len, just return
-     * the string itself. */
-    if (strlen >= (size_t)padlen)
-        return RedisModule_ReplyWithString(ctx,argv[1]);
-
-    /* Padding must be a single character in this simple implementation. */
-    if (chlen != 1)
-        return RedisModule_ReplyWithError(ctx,
-            "ERR padding must be a single char");
-
-    /* Here we use our pool allocator, for our throw-away allocation. */
-    padlen -= strlen;
-    char *buf = RedisModule_PoolAlloc(ctx,padlen+strlen);
-    for (long long j = 0; j < padlen; j++) buf[j] = *ch;
-    memcpy(buf+padlen,str,strlen);
-
-    RedisModule_ReplyWithStringBuffer(ctx,buf,padlen+strlen);
-    return REDISMODULE_OK;
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (RedisModule_Init(ctx,"helloworld",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    /* Log the list of parameters passing loading the module. */
-    for (int j = 0; j < argc; j++) {
-        const char *s = RedisModule_StringPtrLen(argv[j],NULL);
-        printf("Module loaded with ARGV[%d] = %s\n", j, s);
-    }
-
-    if (RedisModule_CreateCommand(ctx,"hello.simple",
-        HelloSimple_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.push.native",
-        HelloPushNative_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.push.call",
-        HelloPushCall_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.push.call2",
-        HelloPushCall2_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.list.sum.len",
-        HelloListSumLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.list.splice",
-        HelloListSplice_RedisCommand,"write deny-oom",1,2,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.list.splice.auto",
-        HelloListSpliceAuto_RedisCommand,
-        "write deny-oom",1,2,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.rand.array",
-        HelloRandArray_RedisCommand,"readonly",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.repl1",
-        HelloRepl1_RedisCommand,"write",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.repl2",
-        HelloRepl2_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.toggle.case",
-        HelloToggleCase_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.more.expire",
-        HelloMoreExpire_RedisCommand,"write",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.zsumrange",
-        HelloZsumRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.lexrange",
-        HelloLexRange_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.hcopy",
-        HelloHCopy_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"hello.leftpad",
-        HelloLeftPad_RedisCommand,"",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/src/monotonic.c b/redis-stable/src/monotonic.c
deleted file mode 100644
index 5bb4f03b..00000000
--- a/redis-stable/src/monotonic.c
+++ /dev/null
@@ -1,170 +0,0 @@
-#include "monotonic.h"
-#include <stddef.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <time.h>
-
-#undef NDEBUG
-#include <assert.h>
-
-
-/* The function pointer for clock retrieval.  */
-monotime (*getMonotonicUs)(void) = NULL;
-
-static char monotonic_info_string[32];
-
-
-/* Using the processor clock (aka TSC on x86) can provide improved performance
- * throughout Redis wherever the monotonic clock is used.  The processor clock
- * is significantly faster than calling 'clock_getting' (POSIX).  While this is
- * generally safe on modern systems, this link provides additional information
- * about use of the x86 TSC: http://oliveryang.net/2015/09/pitfalls-of-TSC-usage
- *
- * To use the processor clock, either uncomment this line, or build with
- *   CFLAGS="-DUSE_PROCESSOR_CLOCK"
-#define USE_PROCESSOR_CLOCK
- */
-
-
-#if defined(USE_PROCESSOR_CLOCK) && defined(__x86_64__) && defined(__linux__)
-#include <regex.h>
-#include <x86intrin.h>
-
-static long mono_ticksPerMicrosecond = 0;
-
-static monotime getMonotonicUs_x86() {
-    return __rdtsc() / mono_ticksPerMicrosecond;
-}
-
-static void monotonicInit_x86linux() {
-    const int bufflen = 256;
-    char buf[bufflen];
-    regex_t cpuGhzRegex, constTscRegex;
-    const size_t nmatch = 2;
-    regmatch_t pmatch[nmatch];
-    int constantTsc = 0;
-    int rc;
-
-    /* Determine the number of TSC ticks in a micro-second.  This is
-     * a constant value matching the standard speed of the processor.
-     * On modern processors, this speed remains constant even though
-     * the actual clock speed varies dynamically for each core.  */
-    rc = regcomp(&cpuGhzRegex, "^model name\\s+:.*@ ([0-9.]+)GHz", REG_EXTENDED);
-    assert(rc == 0);
-
-    /* Also check that the constant_tsc flag is present.  (It should be
-     * unless this is a really old CPU.  */
-    rc = regcomp(&constTscRegex, "^flags\\s+:.* constant_tsc", REG_EXTENDED);
-    assert(rc == 0);
-
-    FILE *cpuinfo = fopen("/proc/cpuinfo", "r");
-    if (cpuinfo != NULL) {
-        while (fgets(buf, bufflen, cpuinfo) != NULL) {
-            if (regexec(&cpuGhzRegex, buf, nmatch, pmatch, 0) == 0) {
-                buf[pmatch[1].rm_eo] = '\0';
-                double ghz = atof(&buf[pmatch[1].rm_so]);
-                mono_ticksPerMicrosecond = (long)(ghz * 1000);
-                break;
-            }
-        }
-        while (fgets(buf, bufflen, cpuinfo) != NULL) {
-            if (regexec(&constTscRegex, buf, nmatch, pmatch, 0) == 0) {
-                constantTsc = 1;
-                break;
-            }
-        }
-
-        fclose(cpuinfo);
-    }
-    regfree(&cpuGhzRegex);
-    regfree(&constTscRegex);
-
-    if (mono_ticksPerMicrosecond == 0) {
-        fprintf(stderr, "monotonic: x86 linux, unable to determine clock rate");
-        return;
-    }
-    if (!constantTsc) {
-        fprintf(stderr, "monotonic: x86 linux, 'constant_tsc' flag not present");
-        return;
-    }
-
-    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
-            "X86 TSC @ %ld ticks/us", mono_ticksPerMicrosecond);
-    getMonotonicUs = getMonotonicUs_x86;
-}
-#endif
-
-
-#if defined(USE_PROCESSOR_CLOCK) && defined(__aarch64__)
-static long mono_ticksPerMicrosecond = 0;
-
-/* Read the clock value.  */
-static inline uint64_t __cntvct() {
-    uint64_t virtual_timer_value;
-    __asm__ volatile("mrs %0, cntvct_el0" : "=r"(virtual_timer_value));
-    return virtual_timer_value;
-}
-
-/* Read the Count-timer Frequency.  */
-static inline uint32_t cntfrq_hz() {
-    uint64_t virtual_freq_value;
-    __asm__ volatile("mrs %0, cntfrq_el0" : "=r"(virtual_freq_value));
-    return (uint32_t)virtual_freq_value;    /* top 32 bits are reserved */
-}
-
-static monotime getMonotonicUs_aarch64() {
-    return __cntvct() / mono_ticksPerMicrosecond;
-}
-
-static void monotonicInit_aarch64() {
-    mono_ticksPerMicrosecond = (long)cntfrq_hz() / 1000L / 1000L;
-    if (mono_ticksPerMicrosecond == 0) {
-        fprintf(stderr, "monotonic: aarch64, unable to determine clock rate");
-        return;
-    }
-
-    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
-            "ARM CNTVCT @ %ld ticks/us", mono_ticksPerMicrosecond);
-    getMonotonicUs = getMonotonicUs_aarch64;
-}
-#endif
-
-
-static monotime getMonotonicUs_posix() {
-    /* clock_gettime() is specified in POSIX.1b (1993).  Even so, some systems
-     * did not support this until much later.  CLOCK_MONOTONIC is technically
-     * optional and may not be supported - but it appears to be universal.
-     * If this is not supported, provide a system-specific alternate version.  */
-    struct timespec ts;
-    clock_gettime(CLOCK_MONOTONIC, &ts);
-    return ((uint64_t)ts.tv_sec) * 1000000 + ts.tv_nsec / 1000;
-}
-
-static void monotonicInit_posix() {
-    /* Ensure that CLOCK_MONOTONIC is supported.  This should be supported
-     * on any reasonably current OS.  If the assertion below fails, provide
-     * an appropriate alternate implementation.  */
-    struct timespec ts;
-    int rc = clock_gettime(CLOCK_MONOTONIC, &ts);
-    assert(rc == 0);
-
-    snprintf(monotonic_info_string, sizeof(monotonic_info_string),
-            "POSIX clock_gettime");
-    getMonotonicUs = getMonotonicUs_posix;
-}
-
-
-
-const char * monotonicInit() {
-    #if defined(USE_PROCESSOR_CLOCK) && defined(__x86_64__) && defined(__linux__)
-    if (getMonotonicUs == NULL) monotonicInit_x86linux();
-    #endif
-
-    #if defined(USE_PROCESSOR_CLOCK) && defined(__aarch64__)
-    if (getMonotonicUs == NULL) monotonicInit_aarch64();
-    #endif
-
-    if (getMonotonicUs == NULL) monotonicInit_posix();
-
-    return monotonic_info_string;
-}
diff --git a/redis-stable/src/monotonic.h b/redis-stable/src/monotonic.h
deleted file mode 100644
index 4e82f9d5..00000000
--- a/redis-stable/src/monotonic.h
+++ /dev/null
@@ -1,52 +0,0 @@
-#ifndef __MONOTONIC_H
-#define __MONOTONIC_H
-/* The monotonic clock is an always increasing clock source.  It is unrelated to
- * the actual time of day and should only be used for relative timings.  The
- * monotonic clock is also not guaranteed to be chronologically precise; there
- * may be slight skew/shift from a precise clock.
- *
- * Depending on system architecture, the monotonic time may be able to be
- * retrieved much faster than a normal clock source by using an instruction
- * counter on the CPU.  On x86 architectures (for example), the RDTSC
- * instruction is a very fast clock source for this purpose.
- */
-
-#include "fmacros.h"
-#include <stdint.h>
-#include <unistd.h>
-
-/* A counter in micro-seconds.  The 'monotime' type is provided for variables
- * holding a monotonic time.  This will help distinguish & document that the
- * variable is associated with the monotonic clock and should not be confused
- * with other types of time.*/
-typedef uint64_t monotime;
-
-/* Retrieve counter of micro-seconds relative to an arbitrary point in time.  */
-extern monotime (*getMonotonicUs)(void);
-
-
-/* Call once at startup to initialize the monotonic clock.  Though this only
- * needs to be called once, it may be called additional times without impact.
- * Returns a printable string indicating the type of clock initialized.
- * (The returned string is static and doesn't need to be freed.)  */
-const char * monotonicInit();
-
-
-/* Functions to measure elapsed time.  Example:
- *     monotime myTimer;
- *     elapsedStart(&myTimer);
- *     while (elapsedMs(myTimer) < 10) {} // loops for 10ms
- */
-static inline void elapsedStart(monotime *start_time) {
-    *start_time = getMonotonicUs();
-}
-
-static inline uint64_t elapsedUs(monotime start_time) {
-    return getMonotonicUs() - start_time;
-}
-
-static inline uint64_t elapsedMs(monotime start_time) {
-    return elapsedUs(start_time) / 1000;
-}
-
-#endif
diff --git a/redis-stable/src/mt19937-64.c b/redis-stable/src/mt19937-64.c
deleted file mode 100644
index a0c897ff..00000000
--- a/redis-stable/src/mt19937-64.c
+++ /dev/null
@@ -1,187 +0,0 @@
-/*
-   A C-program for MT19937-64 (2004/9/29 version).
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   This is a 64-bit version of Mersenne Twister pseudorandom number
-   generator.
-
-   Before using, initialize the state by using init_genrand64(seed)
-   or init_by_array64(init_key, key_length).
-
-   Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   References:
-   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
-     ACM Transactions on Modeling and
-     Computer Simulation 10. (2000) 348--357.
-   M. Matsumoto and T. Nishimura,
-     ``Mersenne Twister: a 623-dimensionally equidistributed
-       uniform pseudorandom number generator''
-     ACM Transactions on Modeling and
-     Computer Simulation 8. (Jan. 1998) 3--30.
-
-   Any feedback is very welcome.
-   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
-*/
-
-
-#include "mt19937-64.h"
-#include <stdio.h>
-
-#define NN 312
-#define MM 156
-#define MATRIX_A 0xB5026F5AA96619E9ULL
-#define UM 0xFFFFFFFF80000000ULL /* Most significant 33 bits */
-#define LM 0x7FFFFFFFULL /* Least significant 31 bits */
-
-
-/* The array for the state vector */
-static unsigned long long mt[NN];
-/* mti==NN+1 means mt[NN] is not initialized */
-static int mti=NN+1;
-
-/* initializes mt[NN] with a seed */
-void init_genrand64(unsigned long long seed)
-{
-    mt[0] = seed;
-    for (mti=1; mti<NN; mti++)
-        mt[mti] =  (6364136223846793005ULL * (mt[mti-1] ^ (mt[mti-1] >> 62)) + mti);
-}
-
-/* initialize by an array with array-length */
-/* init_key is the array for initializing keys */
-/* key_length is its length */
-void init_by_array64(unsigned long long init_key[],
-                     unsigned long long key_length)
-{
-    unsigned long long i, j, k;
-    init_genrand64(19650218ULL);
-    i=1; j=0;
-    k = (NN>key_length ? NN : key_length);
-    for (; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * 3935559000370003845ULL))
-          + init_key[j] + j; /* non linear */
-        i++; j++;
-        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
-        if (j>=key_length) j=0;
-    }
-    for (k=NN-1; k; k--) {
-        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 62)) * 2862933555777941757ULL))
-          - i; /* non linear */
-        i++;
-        if (i>=NN) { mt[0] = mt[NN-1]; i=1; }
-    }
-
-    mt[0] = 1ULL << 63; /* MSB is 1; assuring non-zero initial array */
-}
-
-/* generates a random number on [0, 2^64-1]-interval */
-unsigned long long genrand64_int64(void)
-{
-    int i;
-    unsigned long long x;
-    static unsigned long long mag01[2]={0ULL, MATRIX_A};
-
-    if (mti >= NN) { /* generate NN words at one time */
-
-        /* if init_genrand64() has not been called, */
-        /* a default initial seed is used     */
-        if (mti == NN+1)
-            init_genrand64(5489ULL);
-
-        for (i=0;i<NN-MM;i++) {
-            x = (mt[i]&UM)|(mt[i+1]&LM);
-            mt[i] = mt[i+MM] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
-        }
-        for (;i<NN-1;i++) {
-            x = (mt[i]&UM)|(mt[i+1]&LM);
-            mt[i] = mt[i+(MM-NN)] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
-        }
-        x = (mt[NN-1]&UM)|(mt[0]&LM);
-        mt[NN-1] = mt[MM-1] ^ (x>>1) ^ mag01[(int)(x&1ULL)];
-
-        mti = 0;
-    }
-
-    x = mt[mti++];
-
-    x ^= (x >> 29) & 0x5555555555555555ULL;
-    x ^= (x << 17) & 0x71D67FFFEDA60000ULL;
-    x ^= (x << 37) & 0xFFF7EEE000000000ULL;
-    x ^= (x >> 43);
-
-    return x;
-}
-
-/* generates a random number on [0, 2^63-1]-interval */
-long long genrand64_int63(void)
-{
-    return (long long)(genrand64_int64() >> 1);
-}
-
-/* generates a random number on [0,1]-real-interval */
-double genrand64_real1(void)
-{
-    return (genrand64_int64() >> 11) * (1.0/9007199254740991.0);
-}
-
-/* generates a random number on [0,1)-real-interval */
-double genrand64_real2(void)
-{
-    return (genrand64_int64() >> 11) * (1.0/9007199254740992.0);
-}
-
-/* generates a random number on (0,1)-real-interval */
-double genrand64_real3(void)
-{
-    return ((genrand64_int64() >> 12) + 0.5) * (1.0/4503599627370496.0);
-}
-
-#ifdef MT19937_64_MAIN
-int main(void)
-{
-    int i;
-    unsigned long long init[4]={0x12345ULL, 0x23456ULL, 0x34567ULL, 0x45678ULL}, length=4;
-    init_by_array64(init, length);
-    printf("1000 outputs of genrand64_int64()\n");
-    for (i=0; i<1000; i++) {
-      printf("%20llu ", genrand64_int64());
-      if (i%5==4) printf("\n");
-    }
-    printf("\n1000 outputs of genrand64_real2()\n");
-    for (i=0; i<1000; i++) {
-      printf("%10.8f ", genrand64_real2());
-      if (i%5==4) printf("\n");
-    }
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/mt19937-64.h b/redis-stable/src/mt19937-64.h
deleted file mode 100644
index b98348fd..00000000
--- a/redis-stable/src/mt19937-64.h
+++ /dev/null
@@ -1,87 +0,0 @@
-/*
-   A C-program for MT19937-64 (2004/9/29 version).
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   This is a 64-bit version of Mersenne Twister pseudorandom number
-   generator.
-
-   Before using, initialize the state by using init_genrand64(seed)
-   or init_by_array64(init_key, key_length).
-
-   Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   References:
-   T. Nishimura, ``Tables of 64-bit Mersenne Twisters''
-     ACM Transactions on Modeling and
-     Computer Simulation 10. (2000) 348--357.
-   M. Matsumoto and T. Nishimura,
-     ``Mersenne Twister: a 623-dimensionally equidistributed
-       uniform pseudorandom number generator''
-     ACM Transactions on Modeling and
-     Computer Simulation 8. (Jan. 1998) 3--30.
-
-   Any feedback is very welcome.
-   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)
-*/
-
-#ifndef __MT19937_64_H
-#define __MT19937_64_H
-
-/* initializes mt[NN] with a seed */
-void init_genrand64(unsigned long long seed);
-
-/* initialize by an array with array-length */
-/* init_key is the array for initializing keys */
-/* key_length is its length */
-void init_by_array64(unsigned long long init_key[],
-                     unsigned long long key_length);
-
-/* generates a random number on [0, 2^64-1]-interval */
-unsigned long long genrand64_int64(void);
-
-
-/* generates a random number on [0, 2^63-1]-interval */
-long long genrand64_int63(void);
-
-/* generates a random number on [0,1]-real-interval */
-double genrand64_real1(void);
-
-/* generates a random number on [0,1)-real-interval */
-double genrand64_real2(void);
-
-/* generates a random number on (0,1)-real-interval */
-double genrand64_real3(void);
-
-/* generates a random number on (0,1]-real-interval */
-double genrand64_real4(void);
-
-#endif
diff --git a/redis-stable/src/multi.c b/redis-stable/src/multi.c
deleted file mode 100644
index ebbdabbf..00000000
--- a/redis-stable/src/multi.c
+++ /dev/null
@@ -1,439 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* ================================ MULTI/EXEC ============================== */
-
-/* Client state initialization for MULTI/EXEC */
-void initClientMultiState(client *c) {
-    c->mstate.commands = NULL;
-    c->mstate.count = 0;
-    c->mstate.cmd_flags = 0;
-    c->mstate.cmd_inv_flags = 0;
-}
-
-/* Release all the resources associated with MULTI/EXEC state */
-void freeClientMultiState(client *c) {
-    int j;
-
-    for (j = 0; j < c->mstate.count; j++) {
-        int i;
-        multiCmd *mc = c->mstate.commands+j;
-
-        for (i = 0; i < mc->argc; i++)
-            decrRefCount(mc->argv[i]);
-        zfree(mc->argv);
-    }
-    zfree(c->mstate.commands);
-}
-
-/* Add a new command into the MULTI commands queue */
-void queueMultiCommand(client *c) {
-    multiCmd *mc;
-    int j;
-
-    /* No sense to waste memory if the transaction is already aborted.
-     * this is useful in case client sends these in a pipeline, or doesn't
-     * bother to read previous responses and didn't notice the multi was already
-     * aborted. */
-    if (c->flags & CLIENT_DIRTY_EXEC)
-        return;
-
-    c->mstate.commands = zrealloc(c->mstate.commands,
-            sizeof(multiCmd)*(c->mstate.count+1));
-    mc = c->mstate.commands+c->mstate.count;
-    mc->cmd = c->cmd;
-    mc->argc = c->argc;
-    mc->argv = zmalloc(sizeof(robj*)*c->argc);
-    memcpy(mc->argv,c->argv,sizeof(robj*)*c->argc);
-    for (j = 0; j < c->argc; j++)
-        incrRefCount(mc->argv[j]);
-    c->mstate.count++;
-    c->mstate.cmd_flags |= c->cmd->flags;
-    c->mstate.cmd_inv_flags |= ~c->cmd->flags;
-}
-
-void discardTransaction(client *c) {
-    freeClientMultiState(c);
-    initClientMultiState(c);
-    c->flags &= ~(CLIENT_MULTI|CLIENT_DIRTY_CAS|CLIENT_DIRTY_EXEC);
-    unwatchAllKeys(c);
-}
-
-/* Flag the transaction as DIRTY_EXEC so that EXEC will fail.
- * Should be called every time there is an error while queueing a command. */
-void flagTransaction(client *c) {
-    if (c->flags & CLIENT_MULTI)
-        c->flags |= CLIENT_DIRTY_EXEC;
-}
-
-void multiCommand(client *c) {
-    if (c->flags & CLIENT_MULTI) {
-        addReplyError(c,"MULTI calls can not be nested");
-        return;
-    }
-    c->flags |= CLIENT_MULTI;
-
-    addReply(c,shared.ok);
-}
-
-void discardCommand(client *c) {
-    if (!(c->flags & CLIENT_MULTI)) {
-        addReplyError(c,"DISCARD without MULTI");
-        return;
-    }
-    discardTransaction(c);
-    addReply(c,shared.ok);
-}
-
-void beforePropagateMulti() {
-    /* Propagating MULTI */
-    serverAssert(!server.propagate_in_transaction);
-    server.propagate_in_transaction = 1;
-}
-
-void afterPropagateExec() {
-    /* Propagating EXEC */
-    serverAssert(server.propagate_in_transaction == 1);
-    server.propagate_in_transaction = 0;
-}
-
-/* Send a MULTI command to all the slaves and AOF file. Check the execCommand
- * implementation for more information. */
-void execCommandPropagateMulti(int dbid) {
-    beforePropagateMulti();
-    propagate(server.multiCommand,dbid,&shared.multi,1,
-              PROPAGATE_AOF|PROPAGATE_REPL);
-}
-
-void execCommandPropagateExec(int dbid) {
-    propagate(server.execCommand,dbid,&shared.exec,1,
-              PROPAGATE_AOF|PROPAGATE_REPL);
-    afterPropagateExec();
-}
-
-/* Aborts a transaction, with a specific error message.
- * The transaction is always aborted with -EXECABORT so that the client knows
- * the server exited the multi state, but the actual reason for the abort is
- * included too.
- * Note: 'error' may or may not end with \r\n. see addReplyErrorFormat. */
-void execCommandAbort(client *c, sds error) {
-    discardTransaction(c);
-
-    if (error[0] == '-') error++;
-    addReplyErrorFormat(c, "-EXECABORT Transaction discarded because of: %s", error);
-
-    /* Send EXEC to clients waiting data from MONITOR. We did send a MULTI
-     * already, and didn't send any of the queued commands, now we'll just send
-     * EXEC so it is clear that the transaction is over. */
-    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
-}
-
-void execCommand(client *c) {
-    int j;
-    robj **orig_argv;
-    int orig_argc;
-    struct redisCommand *orig_cmd;
-    int was_master = server.masterhost == NULL;
-
-    if (!(c->flags & CLIENT_MULTI)) {
-        addReplyError(c,"EXEC without MULTI");
-        return;
-    }
-
-    /* EXEC with expired watched key is disallowed*/
-    if (isWatchedKeyExpired(c)) {
-        c->flags |= (CLIENT_DIRTY_CAS);
-    }
-
-    /* Check if we need to abort the EXEC because:
-     * 1) Some WATCHed key was touched.
-     * 2) There was a previous error while queueing commands.
-     * A failed EXEC in the first case returns a multi bulk nil object
-     * (technically it is not an error but a special behavior), while
-     * in the second an EXECABORT error is returned. */
-    if (c->flags & (CLIENT_DIRTY_CAS | CLIENT_DIRTY_EXEC)) {
-        if (c->flags & CLIENT_DIRTY_EXEC) {
-            addReplyErrorObject(c, shared.execaborterr);
-        } else {
-            addReply(c, shared.nullarray[c->resp]);
-        }
-
-        discardTransaction(c);
-        return;
-    }
-
-    uint64_t old_flags = c->flags;
-
-    /* we do not want to allow blocking commands inside multi */
-    c->flags |= CLIENT_DENY_BLOCKING;
-
-    /* Exec all the queued commands */
-    unwatchAllKeys(c); /* Unwatch ASAP otherwise we'll waste CPU cycles */
-
-    server.in_exec = 1;
-
-    orig_argv = c->argv;
-    orig_argc = c->argc;
-    orig_cmd = c->cmd;
-    addReplyArrayLen(c,c->mstate.count);
-    for (j = 0; j < c->mstate.count; j++) {
-        c->argc = c->mstate.commands[j].argc;
-        c->argv = c->mstate.commands[j].argv;
-        c->cmd = c->mstate.commands[j].cmd;
-
-        /* ACL permissions are also checked at the time of execution in case
-         * they were changed after the commands were queued. */
-        int acl_errpos;
-        int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
-        if (acl_retval != ACL_OK) {
-            char *reason;
-            switch (acl_retval) {
-            case ACL_DENIED_CMD:
-                reason = "no permission to execute the command or subcommand";
-                break;
-            case ACL_DENIED_KEY:
-                reason = "no permission to touch the specified keys";
-                break;
-            case ACL_DENIED_CHANNEL:
-                reason = "no permission to access one of the channels used "
-                         "as arguments";
-                break;
-            default:
-                reason = "no permission";
-                break;
-            }
-            addACLLogEntry(c,acl_retval,acl_errpos,NULL);
-            addReplyErrorFormat(c,
-                "-NOPERM ACLs rules changed between the moment the "
-                "transaction was accumulated and the EXEC call. "
-                "This command is no longer allowed for the "
-                "following reason: %s", reason);
-        } else {
-            call(c,server.loading ? CMD_CALL_NONE : CMD_CALL_FULL);
-            serverAssert((c->flags & CLIENT_BLOCKED) == 0);
-        }
-
-        /* Commands may alter argc/argv, restore mstate. */
-        c->mstate.commands[j].argc = c->argc;
-        c->mstate.commands[j].argv = c->argv;
-        c->mstate.commands[j].cmd = c->cmd;
-    }
-
-    // restore old DENY_BLOCKING value
-    if (!(old_flags & CLIENT_DENY_BLOCKING))
-        c->flags &= ~CLIENT_DENY_BLOCKING;
-
-    c->argv = orig_argv;
-    c->argc = orig_argc;
-    c->cmd = orig_cmd;
-    discardTransaction(c);
-
-    /* Make sure the EXEC command will be propagated as well if MULTI
-     * was already propagated. */
-    if (server.propagate_in_transaction) {
-        int is_master = server.masterhost == NULL;
-        server.dirty++;
-        /* If inside the MULTI/EXEC block this instance was suddenly
-         * switched from master to slave (using the SLAVEOF command), the
-         * initial MULTI was propagated into the replication backlog, but the
-         * rest was not. We need to make sure to at least terminate the
-         * backlog with the final EXEC. */
-        if (server.repl_backlog && was_master && !is_master) {
-            char *execcmd = "*1\r\n$4\r\nEXEC\r\n";
-            feedReplicationBacklog(execcmd,strlen(execcmd));
-        }
-        afterPropagateExec();
-    }
-
-    server.in_exec = 0;
-}
-
-/* ===================== WATCH (CAS alike for MULTI/EXEC) ===================
- *
- * The implementation uses a per-DB hash table mapping keys to list of clients
- * WATCHing those keys, so that given a key that is going to be modified
- * we can mark all the associated clients as dirty.
- *
- * Also every client contains a list of WATCHed keys so that's possible to
- * un-watch such keys when the client is freed or when UNWATCH is called. */
-
-/* In the client->watched_keys list we need to use watchedKey structures
- * as in order to identify a key in Redis we need both the key name and the
- * DB */
-typedef struct watchedKey {
-    robj *key;
-    redisDb *db;
-} watchedKey;
-
-/* Watch for the specified key */
-void watchForKey(client *c, robj *key) {
-    list *clients = NULL;
-    listIter li;
-    listNode *ln;
-    watchedKey *wk;
-
-    /* Check if we are already watching for this key */
-    listRewind(c->watched_keys,&li);
-    while((ln = listNext(&li))) {
-        wk = listNodeValue(ln);
-        if (wk->db == c->db && equalStringObjects(key,wk->key))
-            return; /* Key already watched */
-    }
-    /* This key is not already watched in this DB. Let's add it */
-    clients = dictFetchValue(c->db->watched_keys,key);
-    if (!clients) {
-        clients = listCreate();
-        dictAdd(c->db->watched_keys,key,clients);
-        incrRefCount(key);
-    }
-    listAddNodeTail(clients,c);
-    /* Add the new key to the list of keys watched by this client */
-    wk = zmalloc(sizeof(*wk));
-    wk->key = key;
-    wk->db = c->db;
-    incrRefCount(key);
-    listAddNodeTail(c->watched_keys,wk);
-}
-
-/* Unwatch all the keys watched by this client. To clean the EXEC dirty
- * flag is up to the caller. */
-void unwatchAllKeys(client *c) {
-    listIter li;
-    listNode *ln;
-
-    if (listLength(c->watched_keys) == 0) return;
-    listRewind(c->watched_keys,&li);
-    while((ln = listNext(&li))) {
-        list *clients;
-        watchedKey *wk;
-
-        /* Lookup the watched key -> clients list and remove the client
-         * from the list */
-        wk = listNodeValue(ln);
-        clients = dictFetchValue(wk->db->watched_keys, wk->key);
-        serverAssertWithInfo(c,NULL,clients != NULL);
-        listDelNode(clients,listSearchKey(clients,c));
-        /* Kill the entry at all if this was the only client */
-        if (listLength(clients) == 0)
-            dictDelete(wk->db->watched_keys, wk->key);
-        /* Remove this watched key from the client->watched list */
-        listDelNode(c->watched_keys,ln);
-        decrRefCount(wk->key);
-        zfree(wk);
-    }
-}
-
-/* iterates over the watched_keys list and
- * look for an expired key . */
-int isWatchedKeyExpired(client *c) {
-    listIter li;
-    listNode *ln;
-    watchedKey *wk;
-    if (listLength(c->watched_keys) == 0) return 0;
-    listRewind(c->watched_keys,&li);
-    while ((ln = listNext(&li))) {
-        wk = listNodeValue(ln);
-        if (keyIsExpired(wk->db, wk->key)) return 1;
-    }
-
-    return 0;
-}
-
-/* "Touch" a key, so that if this key is being WATCHed by some client the
- * next EXEC will fail. */
-void touchWatchedKey(redisDb *db, robj *key) {
-    list *clients;
-    listIter li;
-    listNode *ln;
-
-    if (dictSize(db->watched_keys) == 0) return;
-    clients = dictFetchValue(db->watched_keys, key);
-    if (!clients) return;
-
-    /* Mark all the clients watching this key as CLIENT_DIRTY_CAS */
-    /* Check if we are already watching for this key */
-    listRewind(clients,&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-
-        c->flags |= CLIENT_DIRTY_CAS;
-    }
-}
-
-/* Set CLIENT_DIRTY_CAS to all clients of DB when DB is dirty.
- * It may happen in the following situations:
- * FLUSHDB, FLUSHALL, SWAPDB
- *
- * replaced_with: for SWAPDB, the WATCH should be invalidated if
- * the key exists in either of them, and skipped only if it
- * doesn't exist in both. */
-void touchAllWatchedKeysInDb(redisDb *emptied, redisDb *replaced_with) {
-    listIter li;
-    listNode *ln;
-    dictEntry *de;
-
-    if (dictSize(emptied->watched_keys) == 0) return;
-
-    dictIterator *di = dictGetSafeIterator(emptied->watched_keys);
-    while((de = dictNext(di)) != NULL) {
-        robj *key = dictGetKey(de);
-        list *clients = dictGetVal(de);
-        if (!clients) continue;
-        listRewind(clients,&li);
-        while((ln = listNext(&li))) {
-            client *c = listNodeValue(ln);
-            if (dictFind(emptied->dict, key->ptr)) {
-                c->flags |= CLIENT_DIRTY_CAS;
-            } else if (replaced_with && dictFind(replaced_with->dict, key->ptr)) {
-                c->flags |= CLIENT_DIRTY_CAS;
-            }
-        }
-    }
-    dictReleaseIterator(di);
-}
-
-void watchCommand(client *c) {
-    int j;
-
-    if (c->flags & CLIENT_MULTI) {
-        addReplyError(c,"WATCH inside MULTI is not allowed");
-        return;
-    }
-    for (j = 1; j < c->argc; j++)
-        watchForKey(c,c->argv[j]);
-    addReply(c,shared.ok);
-}
-
-void unwatchCommand(client *c) {
-    unwatchAllKeys(c);
-    c->flags &= (~CLIENT_DIRTY_CAS);
-    addReply(c,shared.ok);
-}
diff --git a/redis-stable/src/networking.c b/redis-stable/src/networking.c
deleted file mode 100644
index bf4a8daa..00000000
--- a/redis-stable/src/networking.c
+++ /dev/null
@@ -1,3772 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "atomicvar.h"
-#include "cluster.h"
-#include <sys/socket.h>
-#include <sys/uio.h>
-#include <math.h>
-#include <ctype.h>
-
-static void setProtocolError(const char *errstr, client *c);
-int postponeClientRead(client *c);
-int ProcessingEventsWhileBlocked = 0; /* See processEventsWhileBlocked(). */
-
-/* Return the size consumed from the allocator, for the specified SDS string,
- * including internal fragmentation. This function is used in order to compute
- * the client output buffer size. */
-size_t sdsZmallocSize(sds s) {
-    void *sh = sdsAllocPtr(s);
-    return zmalloc_size(sh);
-}
-
-/* Return the amount of memory used by the sds string at object->ptr
- * for a string object. This includes internal fragmentation. */
-size_t getStringObjectSdsUsedMemory(robj *o) {
-    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-    switch(o->encoding) {
-    case OBJ_ENCODING_RAW: return sdsZmallocSize(o->ptr);
-    case OBJ_ENCODING_EMBSTR: return zmalloc_size(o)-sizeof(robj);
-    default: return 0; /* Just integer encoding for now. */
-    }
-}
-
-/* Return the length of a string object.
- * This does NOT includes internal fragmentation or sds unused space. */
-size_t getStringObjectLen(robj *o) {
-    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-    switch(o->encoding) {
-    case OBJ_ENCODING_RAW: return sdslen(o->ptr);
-    case OBJ_ENCODING_EMBSTR: return sdslen(o->ptr);
-    default: return 0; /* Just integer encoding for now. */
-    }
-}
-
-/* Client.reply list dup and free methods. */
-void *dupClientReplyValue(void *o) {
-    clientReplyBlock *old = o;
-    clientReplyBlock *buf = zmalloc(sizeof(clientReplyBlock) + old->size);
-    memcpy(buf, o, sizeof(clientReplyBlock) + old->size);
-    return buf;
-}
-
-void freeClientReplyValue(void *o) {
-    zfree(o);
-}
-
-int listMatchObjects(void *a, void *b) {
-    return equalStringObjects(a,b);
-}
-
-/* This function links the client to the global linked list of clients.
- * unlinkClient() does the opposite, among other things. */
-void linkClient(client *c) {
-    listAddNodeTail(server.clients,c);
-    /* Note that we remember the linked list node where the client is stored,
-     * this way removing the client in unlinkClient() will not require
-     * a linear scan, but just a constant time operation. */
-    c->client_list_node = listLast(server.clients);
-    uint64_t id = htonu64(c->id);
-    raxInsert(server.clients_index,(unsigned char*)&id,sizeof(id),c,NULL);
-}
-
-/* Initialize client authentication state.
- */
-static void clientSetDefaultAuth(client *c) {
-    /* If the default user does not require authentication, the user is
-     * directly authenticated. */
-    c->user = DefaultUser;
-    c->authenticated = (c->user->flags & USER_FLAG_NOPASS) &&
-                       !(c->user->flags & USER_FLAG_DISABLED);
-}
-
-int authRequired(client *c) {
-    /* Check if the user is authenticated. This check is skipped in case
-     * the default user is flagged as "nopass" and is active. */
-    int auth_required = (!(DefaultUser->flags & USER_FLAG_NOPASS) ||
-                          (DefaultUser->flags & USER_FLAG_DISABLED)) &&
-                        !c->authenticated;
-    return auth_required;
-}
-
-client *createClient(connection *conn) {
-    client *c = zmalloc(sizeof(client));
-
-    /* passing NULL as conn it is possible to create a non connected client.
-     * This is useful since all the commands needs to be executed
-     * in the context of a client. When commands are executed in other
-     * contexts (for instance a Lua script) we need a non connected client. */
-    if (conn) {
-        connNonBlock(conn);
-        connEnableTcpNoDelay(conn);
-        if (server.tcpkeepalive)
-            connKeepAlive(conn,server.tcpkeepalive);
-        connSetReadHandler(conn, readQueryFromClient);
-        connSetPrivateData(conn, c);
-    }
-
-    selectDb(c,0);
-    uint64_t client_id;
-    atomicGetIncr(server.next_client_id, client_id, 1);
-    c->id = client_id;
-    c->resp = 2;
-    c->conn = conn;
-    c->name = NULL;
-    c->bufpos = 0;
-    c->qb_pos = 0;
-    c->querybuf = sdsempty();
-    c->pending_querybuf = sdsempty();
-    c->querybuf_peak = 0;
-    c->reqtype = 0;
-    c->argc = 0;
-    c->argv = NULL;
-    c->argv_len_sum = 0;
-    c->original_argc = 0;
-    c->original_argv = NULL;
-    c->cmd = c->lastcmd = NULL;
-    c->multibulklen = 0;
-    c->bulklen = -1;
-    c->sentlen = 0;
-    c->flags = 0;
-    c->ctime = c->lastinteraction = server.unixtime;
-    clientSetDefaultAuth(c);
-    c->replstate = REPL_STATE_NONE;
-    c->repl_put_online_on_ack = 0;
-    c->reploff = 0;
-    c->read_reploff = 0;
-    c->repl_ack_off = 0;
-    c->repl_ack_time = 0;
-    c->repl_last_partial_write = 0;
-    c->slave_listening_port = 0;
-    c->slave_addr = NULL;
-    c->slave_capa = SLAVE_CAPA_NONE;
-    c->reply = listCreate();
-    c->reply_bytes = 0;
-    c->obuf_soft_limit_reached_time = 0;
-    listSetFreeMethod(c->reply,freeClientReplyValue);
-    listSetDupMethod(c->reply,dupClientReplyValue);
-    c->btype = BLOCKED_NONE;
-    c->bpop.timeout = 0;
-    c->bpop.keys = dictCreate(&objectKeyHeapPointerValueDictType,NULL);
-    c->bpop.target = NULL;
-    c->bpop.xread_group = NULL;
-    c->bpop.xread_consumer = NULL;
-    c->bpop.xread_group_noack = 0;
-    c->bpop.numreplicas = 0;
-    c->bpop.reploffset = 0;
-    c->woff = 0;
-    c->watched_keys = listCreate();
-    c->pubsub_channels = dictCreate(&objectKeyPointerValueDictType,NULL);
-    c->pubsub_patterns = listCreate();
-    c->peerid = NULL;
-    c->sockname = NULL;
-    c->client_list_node = NULL;
-    c->paused_list_node = NULL;
-    c->client_tracking_redirection = 0;
-    c->client_tracking_prefixes = NULL;
-    c->client_cron_last_memory_usage = 0;
-    c->client_cron_last_memory_type = CLIENT_TYPE_NORMAL;
-    c->auth_callback = NULL;
-    c->auth_callback_privdata = NULL;
-    c->auth_module = NULL;
-    listSetFreeMethod(c->pubsub_patterns,decrRefCountVoid);
-    listSetMatchMethod(c->pubsub_patterns,listMatchObjects);
-    if (conn) linkClient(c);
-    initClientMultiState(c);
-    return c;
-}
-
-/* This function puts the client in the queue of clients that should write
- * their output buffers to the socket. Note that it does not *yet* install
- * the write handler, to start clients are put in a queue of clients that need
- * to write, so we try to do that before returning in the event loop (see the
- * handleClientsWithPendingWrites() function).
- * If we fail and there is more data to write, compared to what the socket
- * buffers can hold, then we'll really install the handler. */
-void clientInstallWriteHandler(client *c) {
-    /* Schedule the client to write the output buffers to the socket only
-     * if not already done and, for slaves, if the slave can actually receive
-     * writes at this stage. */
-    if (!(c->flags & CLIENT_PENDING_WRITE) &&
-        (c->replstate == REPL_STATE_NONE ||
-         (c->replstate == SLAVE_STATE_ONLINE && !c->repl_put_online_on_ack)))
-    {
-        /* Here instead of installing the write handler, we just flag the
-         * client and put it into a list of clients that have something
-         * to write to the socket. This way before re-entering the event
-         * loop, we can try to directly write to the client sockets avoiding
-         * a system call. We'll only really install the write handler if
-         * we'll not be able to write the whole reply at once. */
-        c->flags |= CLIENT_PENDING_WRITE;
-        listAddNodeHead(server.clients_pending_write,c);
-    }
-}
-
-/* This function is called every time we are going to transmit new data
- * to the client. The behavior is the following:
- *
- * If the client should receive new data (normal clients will) the function
- * returns C_OK, and make sure to install the write handler in our event
- * loop so that when the socket is writable new data gets written.
- *
- * If the client should not receive new data, because it is a fake client
- * (used to load AOF in memory), a master or because the setup of the write
- * handler failed, the function returns C_ERR.
- *
- * The function may return C_OK without actually installing the write
- * event handler in the following cases:
- *
- * 1) The event handler should already be installed since the output buffer
- *    already contains something.
- * 2) The client is a slave but not yet online, so we want to just accumulate
- *    writes in the buffer but not actually sending them yet.
- *
- * Typically gets called every time a reply is built, before adding more
- * data to the clients output buffers. If the function returns C_ERR no
- * data should be appended to the output buffers. */
-int prepareClientToWrite(client *c) {
-    /* If it's the Lua client we always return ok without installing any
-     * handler since there is no socket at all. */
-    if (c->flags & (CLIENT_LUA|CLIENT_MODULE)) return C_OK;
-
-    /* If CLIENT_CLOSE_ASAP flag is set, we need not write anything. */
-    if (c->flags & CLIENT_CLOSE_ASAP) return C_ERR;
-
-    /* CLIENT REPLY OFF / SKIP handling: don't send replies. */
-    if (c->flags & (CLIENT_REPLY_OFF|CLIENT_REPLY_SKIP)) return C_ERR;
-
-    /* Masters don't receive replies, unless CLIENT_MASTER_FORCE_REPLY flag
-     * is set. */
-    if ((c->flags & CLIENT_MASTER) &&
-        !(c->flags & CLIENT_MASTER_FORCE_REPLY)) return C_ERR;
-
-    if (!c->conn) return C_ERR; /* Fake client for AOF loading. */
-
-    /* Schedule the client to write the output buffers to the socket, unless
-     * it should already be setup to do so (it has already pending data).
-     *
-     * If CLIENT_PENDING_READ is set, we're in an IO thread and should
-     * not install a write handler. Instead, it will be done by
-     * handleClientsWithPendingReadsUsingThreads() upon return.
-     */
-    if (!clientHasPendingReplies(c) && !(c->flags & CLIENT_PENDING_READ))
-            clientInstallWriteHandler(c);
-
-    /* Authorize the caller to queue in the output buffer of this client. */
-    return C_OK;
-}
-
-/* -----------------------------------------------------------------------------
- * Low level functions to add more data to output buffers.
- * -------------------------------------------------------------------------- */
-
-/* Attempts to add the reply to the static buffer in the client struct.
- * Returns C_ERR if the buffer is full, or the reply list is not empty,
- * in which case the reply must be added to the reply list. */
-int _addReplyToBuffer(client *c, const char *s, size_t len) {
-    size_t available = sizeof(c->buf)-c->bufpos;
-
-    if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return C_OK;
-
-    /* If there already are entries in the reply list, we cannot
-     * add anything more to the static buffer. */
-    if (listLength(c->reply) > 0) return C_ERR;
-
-    /* Check that the buffer has enough space available for this string. */
-    if (len > available) return C_ERR;
-
-    memcpy(c->buf+c->bufpos,s,len);
-    c->bufpos+=len;
-    return C_OK;
-}
-
-/* Adds the reply to the reply linked list.
- * Note: some edits to this function need to be relayed to AddReplyFromClient. */
-void _addReplyProtoToList(client *c, const char *s, size_t len) {
-    if (c->flags & CLIENT_CLOSE_AFTER_REPLY) return;
-
-    listNode *ln = listLast(c->reply);
-    clientReplyBlock *tail = ln? listNodeValue(ln): NULL;
-
-    /* Note that 'tail' may be NULL even if we have a tail node, because when
-     * addReplyDeferredLen() is used, it sets a dummy node to NULL just
-     * fo fill it later, when the size of the bulk length is set. */
-
-    /* Append to tail string when possible. */
-    if (tail) {
-        /* Copy the part we can fit into the tail, and leave the rest for a
-         * new node */
-        size_t avail = tail->size - tail->used;
-        size_t copy = avail >= len? len: avail;
-        memcpy(tail->buf + tail->used, s, copy);
-        tail->used += copy;
-        s += copy;
-        len -= copy;
-    }
-    if (len) {
-        /* Create a new node, make sure it is allocated to at
-         * least PROTO_REPLY_CHUNK_BYTES */
-        size_t size = len < PROTO_REPLY_CHUNK_BYTES? PROTO_REPLY_CHUNK_BYTES: len;
-        tail = zmalloc(size + sizeof(clientReplyBlock));
-        /* take over the allocation's internal fragmentation */
-        tail->size = zmalloc_usable_size(tail) - sizeof(clientReplyBlock);
-        tail->used = len;
-        memcpy(tail->buf, s, len);
-        listAddNodeTail(c->reply, tail);
-        c->reply_bytes += tail->size;
-
-        closeClientOnOutputBufferLimitReached(c, 1);
-    }
-}
-
-/* -----------------------------------------------------------------------------
- * Higher level functions to queue data on the client output buffer.
- * The following functions are the ones that commands implementations will call.
- * -------------------------------------------------------------------------- */
-
-/* Add the object 'obj' string representation to the client output buffer. */
-void addReply(client *c, robj *obj) {
-    if (prepareClientToWrite(c) != C_OK) return;
-
-    if (sdsEncodedObject(obj)) {
-        if (_addReplyToBuffer(c,obj->ptr,sdslen(obj->ptr)) != C_OK)
-            _addReplyProtoToList(c,obj->ptr,sdslen(obj->ptr));
-    } else if (obj->encoding == OBJ_ENCODING_INT) {
-        /* For integer encoded strings we just convert it into a string
-         * using our optimized function, and attach the resulting string
-         * to the output buffer. */
-        char buf[32];
-        size_t len = ll2string(buf,sizeof(buf),(long)obj->ptr);
-        if (_addReplyToBuffer(c,buf,len) != C_OK)
-            _addReplyProtoToList(c,buf,len);
-    } else {
-        serverPanic("Wrong obj->encoding in addReply()");
-    }
-}
-
-/* Add the SDS 's' string to the client output buffer, as a side effect
- * the SDS string is freed. */
-void addReplySds(client *c, sds s) {
-    if (prepareClientToWrite(c) != C_OK) {
-        /* The caller expects the sds to be free'd. */
-        sdsfree(s);
-        return;
-    }
-    if (_addReplyToBuffer(c,s,sdslen(s)) != C_OK)
-        _addReplyProtoToList(c,s,sdslen(s));
-    sdsfree(s);
-}
-
-/* This low level function just adds whatever protocol you send it to the
- * client buffer, trying the static buffer initially, and using the string
- * of objects if not possible.
- *
- * It is efficient because does not create an SDS object nor an Redis object
- * if not needed. The object will only be created by calling
- * _addReplyProtoToList() if we fail to extend the existing tail object
- * in the list of objects. */
-void addReplyProto(client *c, const char *s, size_t len) {
-    if (prepareClientToWrite(c) != C_OK) return;
-    if (_addReplyToBuffer(c,s,len) != C_OK)
-        _addReplyProtoToList(c,s,len);
-}
-
-/* Low level function called by the addReplyError...() functions.
- * It emits the protocol for a Redis error, in the form:
- *
- * -ERRORCODE Error Message<CR><LF>
- *
- * If the error code is already passed in the string 's', the error
- * code provided is used, otherwise the string "-ERR " for the generic
- * error code is automatically added.
- * Note that 's' must NOT end with \r\n. */
-void addReplyErrorLength(client *c, const char *s, size_t len) {
-    /* If the string already starts with "-..." then the error code
-     * is provided by the caller. Otherwise we use "-ERR". */
-    if (!len || s[0] != '-') addReplyProto(c,"-ERR ",5);
-    addReplyProto(c,s,len);
-    addReplyProto(c,"\r\n",2);
-}
-
-/* Do some actions after an error reply was sent (Log if needed, updates stats, etc.) */
-void afterErrorReply(client *c, const char *s, size_t len) {
-    /* Increment the global error counter */
-    server.stat_total_error_replies++;
-    /* Increment the error stats
-     * If the string already starts with "-..." then the error prefix
-     * is provided by the caller ( we limit the search to 32 chars). Otherwise we use "-ERR". */
-    if (s[0] != '-') {
-        incrementErrorCount("ERR", 3);
-    } else {
-        char *spaceloc = memchr(s, ' ', len < 32 ? len : 32);
-        if (spaceloc) {
-            const size_t errEndPos = (size_t)(spaceloc - s);
-            incrementErrorCount(s+1, errEndPos-1);
-        } else {
-            /* Fallback to ERR if we can't retrieve the error prefix */
-            incrementErrorCount("ERR", 3);
-        }
-    }
-
-    /* Sometimes it could be normal that a slave replies to a master with
-     * an error and this function gets called. Actually the error will never
-     * be sent because addReply*() against master clients has no effect...
-     * A notable example is:
-     *
-     *    EVAL 'redis.call("incr",KEYS[1]); redis.call("nonexisting")' 1 x
-     *
-     * Where the master must propagate the first change even if the second
-     * will produce an error. However it is useful to log such events since
-     * they are rare and may hint at errors in a script or a bug in Redis. */
-    int ctype = getClientType(c);
-    if (ctype == CLIENT_TYPE_MASTER || ctype == CLIENT_TYPE_SLAVE || c->id == CLIENT_ID_AOF) {
-        char *to, *from;
-
-        if (c->id == CLIENT_ID_AOF) {
-            to = "AOF-loading-client";
-            from = "server";
-        } else if (ctype == CLIENT_TYPE_MASTER) {
-            to = "master";
-            from = "replica";
-        } else {
-            to = "replica";
-            from = "master";
-        }
-
-        if (len > 4096) len = 4096;
-        char *cmdname = c->lastcmd ? c->lastcmd->name : "<unknown>";
-        serverLog(LL_WARNING,"== CRITICAL == This %s is sending an error "
-                             "to its %s: '%.*s' after processing the command "
-                             "'%s'", from, to, (int)len, s, cmdname);
-        if (ctype == CLIENT_TYPE_MASTER && server.repl_backlog &&
-            server.repl_backlog_histlen > 0)
-        {
-            showLatestBacklog();
-        }
-        server.stat_unexpected_error_replies++;
-    }
-}
-
-/* The 'err' object is expected to start with -ERRORCODE and end with \r\n.
- * Unlike addReplyErrorSds and others alike which rely on addReplyErrorLength. */
-void addReplyErrorObject(client *c, robj *err) {
-    addReply(c, err);
-    afterErrorReply(c, err->ptr, sdslen(err->ptr)-2); /* Ignore trailing \r\n */
-}
-
-/* See addReplyErrorLength for expectations from the input string. */
-void addReplyError(client *c, const char *err) {
-    addReplyErrorLength(c,err,strlen(err));
-    afterErrorReply(c,err,strlen(err));
-}
-
-/* See addReplyErrorLength for expectations from the input string. */
-/* As a side effect the SDS string is freed. */
-void addReplyErrorSds(client *c, sds err) {
-    addReplyErrorLength(c,err,sdslen(err));
-    afterErrorReply(c,err,sdslen(err));
-    sdsfree(err);
-}
-
-/* See addReplyErrorLength for expectations from the formatted string.
- * The formatted string is safe to contain \r and \n anywhere. */
-void addReplyErrorFormat(client *c, const char *fmt, ...) {
-    va_list ap;
-    va_start(ap,fmt);
-    sds s = sdscatvprintf(sdsempty(),fmt,ap);
-    va_end(ap);
-    /* Trim any newlines at the end (ones will be added by addReplyErrorLength) */
-    s = sdstrim(s, "\r\n");
-    /* Make sure there are no newlines in the middle of the string, otherwise
-     * invalid protocol is emitted. */
-    s = sdsmapchars(s, "\r\n", "  ",  2);
-    addReplyErrorLength(c,s,sdslen(s));
-    afterErrorReply(c,s,sdslen(s));
-    sdsfree(s);
-}
-
-void addReplyStatusLength(client *c, const char *s, size_t len) {
-    addReplyProto(c,"+",1);
-    addReplyProto(c,s,len);
-    addReplyProto(c,"\r\n",2);
-}
-
-void addReplyStatus(client *c, const char *status) {
-    addReplyStatusLength(c,status,strlen(status));
-}
-
-void addReplyStatusFormat(client *c, const char *fmt, ...) {
-    va_list ap;
-    va_start(ap,fmt);
-    sds s = sdscatvprintf(sdsempty(),fmt,ap);
-    va_end(ap);
-    addReplyStatusLength(c,s,sdslen(s));
-    sdsfree(s);
-}
-
-/* Sometimes we are forced to create a new reply node, and we can't append to
- * the previous one, when that happens, we wanna try to trim the unused space
- * at the end of the last reply node which we won't use anymore. */
-void trimReplyUnusedTailSpace(client *c) {
-    listNode *ln = listLast(c->reply);
-    clientReplyBlock *tail = ln? listNodeValue(ln): NULL;
-
-    /* Note that 'tail' may be NULL even if we have a tail node, because when
-     * addReplyDeferredLen() is used */
-    if (!tail) return;
-
-    /* We only try to trim the space is relatively high (more than a 1/4 of the
-     * allocation), otherwise there's a high chance realloc will NOP.
-     * Also, to avoid large memmove which happens as part of realloc, we only do
-     * that if the used part is small.  */
-    if (tail->size - tail->used > tail->size / 4 &&
-        tail->used < PROTO_REPLY_CHUNK_BYTES)
-    {
-        size_t old_size = tail->size;
-        tail = zrealloc(tail, tail->used + sizeof(clientReplyBlock));
-        /* take over the allocation's internal fragmentation (at least for
-         * memory usage tracking) */
-        tail->size = zmalloc_usable_size(tail) - sizeof(clientReplyBlock);
-        c->reply_bytes = c->reply_bytes + tail->size - old_size;
-        listNodeValue(ln) = tail;
-    }
-}
-
-/* Adds an empty object to the reply list that will contain the multi bulk
- * length, which is not known when this function is called. */
-void *addReplyDeferredLen(client *c) {
-    /* Note that we install the write event here even if the object is not
-     * ready to be sent, since we are sure that before returning to the
-     * event loop setDeferredAggregateLen() will be called. */
-    if (prepareClientToWrite(c) != C_OK) return NULL;
-    trimReplyUnusedTailSpace(c);
-    listAddNodeTail(c->reply,NULL); /* NULL is our placeholder. */
-    return listLast(c->reply);
-}
-
-void setDeferredReply(client *c, void *node, const char *s, size_t length) {
-    listNode *ln = (listNode*)node;
-    clientReplyBlock *next, *prev;
-
-    /* Abort when *node is NULL: when the client should not accept writes
-     * we return NULL in addReplyDeferredLen() */
-    if (node == NULL) return;
-    serverAssert(!listNodeValue(ln));
-
-    /* Normally we fill this dummy NULL node, added by addReplyDeferredLen(),
-     * with a new buffer structure containing the protocol needed to specify
-     * the length of the array following. However sometimes there might be room
-     * in the previous/next node so we can instead remove this NULL node, and
-     * suffix/prefix our data in the node immediately before/after it, in order
-     * to save a write(2) syscall later. Conditions needed to do it:
-     *
-     * - The prev node is non-NULL and has space in it or
-     * - The next node is non-NULL,
-     * - It has enough room already allocated
-     * - And not too large (avoid large memmove) */
-    if (ln->prev != NULL && (prev = listNodeValue(ln->prev)) &&
-        prev->size - prev->used > 0)
-    {
-        size_t len_to_copy = prev->size - prev->used;
-        if (len_to_copy > length)
-            len_to_copy = length;
-        memcpy(prev->buf + prev->used, s, len_to_copy);
-        prev->used += len_to_copy;
-        length -= len_to_copy;
-        if (length == 0) {
-            listDelNode(c->reply, ln);
-            return;
-        }
-        s += len_to_copy;
-    }
-
-    if (ln->next != NULL && (next = listNodeValue(ln->next)) &&
-        next->size - next->used >= length &&
-        next->used < PROTO_REPLY_CHUNK_BYTES * 4)
-    {
-        memmove(next->buf + length, next->buf, next->used);
-        memcpy(next->buf, s, length);
-        next->used += length;
-        listDelNode(c->reply,ln);
-    } else {
-        /* Create a new node */
-        clientReplyBlock *buf = zmalloc(length + sizeof(clientReplyBlock));
-        /* Take over the allocation's internal fragmentation */
-        buf->size = zmalloc_usable_size(buf) - sizeof(clientReplyBlock);
-        buf->used = length;
-        memcpy(buf->buf, s, length);
-        listNodeValue(ln) = buf;
-        c->reply_bytes += buf->size;
-
-        closeClientOnOutputBufferLimitReached(c, 1);
-    }
-}
-
-/* Populate the length object and try gluing it to the next chunk. */
-void setDeferredAggregateLen(client *c, void *node, long length, char prefix) {
-    serverAssert(length >= 0);
-
-    /* Abort when *node is NULL: when the client should not accept writes
-     * we return NULL in addReplyDeferredLen() */
-    if (node == NULL) return;
-
-    char lenstr[128];
-    size_t lenstr_len = sprintf(lenstr, "%c%ld\r\n", prefix, length);
-    setDeferredReply(c, node, lenstr, lenstr_len);
-}
-
-void setDeferredArrayLen(client *c, void *node, long length) {
-    setDeferredAggregateLen(c,node,length,'*');
-}
-
-void setDeferredMapLen(client *c, void *node, long length) {
-    int prefix = c->resp == 2 ? '*' : '%';
-    if (c->resp == 2) length *= 2;
-    setDeferredAggregateLen(c,node,length,prefix);
-}
-
-void setDeferredSetLen(client *c, void *node, long length) {
-    int prefix = c->resp == 2 ? '*' : '~';
-    setDeferredAggregateLen(c,node,length,prefix);
-}
-
-void setDeferredAttributeLen(client *c, void *node, long length) {
-    serverAssert(c->resp >= 3);
-    setDeferredAggregateLen(c,node,length,'|');
-}
-
-void setDeferredPushLen(client *c, void *node, long length) {
-    serverAssert(c->resp >= 3);
-    setDeferredAggregateLen(c,node,length,'>');
-}
-
-/* Add a double as a bulk reply */
-void addReplyDouble(client *c, double d) {
-    if (isinf(d)) {
-        /* Libc in odd systems (Hi Solaris!) will format infinite in a
-         * different way, so better to handle it in an explicit way. */
-        if (c->resp == 2) {
-            addReplyBulkCString(c, d > 0 ? "inf" : "-inf");
-        } else {
-            addReplyProto(c, d > 0 ? ",inf\r\n" : ",-inf\r\n",
-                              d > 0 ? 6 : 7);
-        }
-    } else {
-        char dbuf[MAX_LONG_DOUBLE_CHARS+3],
-             sbuf[MAX_LONG_DOUBLE_CHARS+32];
-        int dlen, slen;
-        if (c->resp == 2) {
-            dlen = snprintf(dbuf,sizeof(dbuf),"%.17g",d);
-            slen = snprintf(sbuf,sizeof(sbuf),"$%d\r\n%s\r\n",dlen,dbuf);
-            addReplyProto(c,sbuf,slen);
-        } else {
-            dlen = snprintf(dbuf,sizeof(dbuf),",%.17g\r\n",d);
-            addReplyProto(c,dbuf,dlen);
-        }
-    }
-}
-
-void addReplyBigNum(client *c, const char* num, size_t len) {
-    if (c->resp == 2) {
-        addReplyBulkCBuffer(c, num, len);
-    } else {
-        addReplyProto(c,"(",1);
-        addReplyProto(c,num,len);
-        addReply(c,shared.crlf);
-    }
-}
-
-/* Add a long double as a bulk reply, but uses a human readable formatting
- * of the double instead of exposing the crude behavior of doubles to the
- * dear user. */
-void addReplyHumanLongDouble(client *c, long double d) {
-    if (c->resp == 2) {
-        robj *o = createStringObjectFromLongDouble(d,1);
-        addReplyBulk(c,o);
-        decrRefCount(o);
-    } else {
-        char buf[MAX_LONG_DOUBLE_CHARS];
-        int len = ld2string(buf,sizeof(buf),d,LD_STR_HUMAN);
-        addReplyProto(c,",",1);
-        addReplyProto(c,buf,len);
-        addReplyProto(c,"\r\n",2);
-    }
-}
-
-/* Add a long long as integer reply or bulk len / multi bulk count.
- * Basically this is used to output <prefix><long long><crlf>. */
-void addReplyLongLongWithPrefix(client *c, long long ll, char prefix) {
-    char buf[128];
-    int len;
-
-    /* Things like $3\r\n or *2\r\n are emitted very often by the protocol
-     * so we have a few shared objects to use if the integer is small
-     * like it is most of the times. */
-    if (prefix == '*' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {
-        addReply(c,shared.mbulkhdr[ll]);
-        return;
-    } else if (prefix == '$' && ll < OBJ_SHARED_BULKHDR_LEN && ll >= 0) {
-        addReply(c,shared.bulkhdr[ll]);
-        return;
-    }
-
-    buf[0] = prefix;
-    len = ll2string(buf+1,sizeof(buf)-1,ll);
-    buf[len+1] = '\r';
-    buf[len+2] = '\n';
-    addReplyProto(c,buf,len+3);
-}
-
-void addReplyLongLong(client *c, long long ll) {
-    if (ll == 0)
-        addReply(c,shared.czero);
-    else if (ll == 1)
-        addReply(c,shared.cone);
-    else
-        addReplyLongLongWithPrefix(c,ll,':');
-}
-
-void addReplyAggregateLen(client *c, long length, int prefix) {
-    serverAssert(length >= 0);
-    addReplyLongLongWithPrefix(c,length,prefix);
-}
-
-void addReplyArrayLen(client *c, long length) {
-    addReplyAggregateLen(c,length,'*');
-}
-
-void addReplyMapLen(client *c, long length) {
-    int prefix = c->resp == 2 ? '*' : '%';
-    if (c->resp == 2) length *= 2;
-    addReplyAggregateLen(c,length,prefix);
-}
-
-void addReplySetLen(client *c, long length) {
-    int prefix = c->resp == 2 ? '*' : '~';
-    addReplyAggregateLen(c,length,prefix);
-}
-
-void addReplyAttributeLen(client *c, long length) {
-    serverAssert(c->resp >= 3);
-    addReplyAggregateLen(c,length,'|');
-}
-
-void addReplyPushLen(client *c, long length) {
-    serverAssert(c->resp >= 3);
-    addReplyAggregateLen(c,length,'>');
-}
-
-void addReplyNull(client *c) {
-    if (c->resp == 2) {
-        addReplyProto(c,"$-1\r\n",5);
-    } else {
-        addReplyProto(c,"_\r\n",3);
-    }
-}
-
-void addReplyBool(client *c, int b) {
-    if (c->resp == 2) {
-        addReply(c, b ? shared.cone : shared.czero);
-    } else {
-        addReplyProto(c, b ? "#t\r\n" : "#f\r\n",4);
-    }
-}
-
-/* A null array is a concept that no longer exists in RESP3. However
- * RESP2 had it, so API-wise we have this call, that will emit the correct
- * RESP2 protocol, however for RESP3 the reply will always be just the
- * Null type "_\r\n". */
-void addReplyNullArray(client *c) {
-    if (c->resp == 2) {
-        addReplyProto(c,"*-1\r\n",5);
-    } else {
-        addReplyProto(c,"_\r\n",3);
-    }
-}
-
-/* Create the length prefix of a bulk reply, example: $2234 */
-void addReplyBulkLen(client *c, robj *obj) {
-    size_t len = stringObjectLen(obj);
-
-    addReplyLongLongWithPrefix(c,len,'$');
-}
-
-/* Add a Redis Object as a bulk reply */
-void addReplyBulk(client *c, robj *obj) {
-    addReplyBulkLen(c,obj);
-    addReply(c,obj);
-    addReply(c,shared.crlf);
-}
-
-/* Add a C buffer as bulk reply */
-void addReplyBulkCBuffer(client *c, const void *p, size_t len) {
-    addReplyLongLongWithPrefix(c,len,'$');
-    addReplyProto(c,p,len);
-    addReply(c,shared.crlf);
-}
-
-/* Add sds to reply (takes ownership of sds and frees it) */
-void addReplyBulkSds(client *c, sds s)  {
-    addReplyLongLongWithPrefix(c,sdslen(s),'$');
-    addReplySds(c,s);
-    addReply(c,shared.crlf);
-}
-
-/* Set sds to a deferred reply (for symmetry with addReplyBulkSds it also frees the sds) */
-void setDeferredReplyBulkSds(client *c, void *node, sds s) {
-    sds reply = sdscatprintf(sdsempty(), "$%d\r\n%s\r\n", (unsigned)sdslen(s), s);
-    setDeferredReply(c, node, reply, sdslen(reply));
-    sdsfree(reply);
-    sdsfree(s);
-}
-
-/* Add a C null term string as bulk reply */
-void addReplyBulkCString(client *c, const char *s) {
-    if (s == NULL) {
-        addReplyNull(c);
-    } else {
-        addReplyBulkCBuffer(c,s,strlen(s));
-    }
-}
-
-/* Add a long long as a bulk reply */
-void addReplyBulkLongLong(client *c, long long ll) {
-    char buf[64];
-    int len;
-
-    len = ll2string(buf,64,ll);
-    addReplyBulkCBuffer(c,buf,len);
-}
-
-/* Reply with a verbatim type having the specified extension.
- *
- * The 'ext' is the "extension" of the file, actually just a three
- * character type that describes the format of the verbatim string.
- * For instance "txt" means it should be interpreted as a text only
- * file by the receiver, "md " as markdown, and so forth. Only the
- * three first characters of the extension are used, and if the
- * provided one is shorter than that, the remaining is filled with
- * spaces. */
-void addReplyVerbatim(client *c, const char *s, size_t len, const char *ext) {
-    if (c->resp == 2) {
-        addReplyBulkCBuffer(c,s,len);
-    } else {
-        char buf[32];
-        size_t preflen = snprintf(buf,sizeof(buf),"=%zu\r\nxxx:",len+4);
-        char *p = buf+preflen-4;
-        for (int i = 0; i < 3; i++) {
-            if (*ext == '\0') {
-                p[i] = ' ';
-            } else {
-                p[i] = *ext++;
-            }
-        }
-        addReplyProto(c,buf,preflen);
-        addReplyProto(c,s,len);
-        addReplyProto(c,"\r\n",2);
-    }
-}
-
-/* Add an array of C strings as status replies with a heading.
- * This function is typically invoked by from commands that support
- * subcommands in response to the 'help' subcommand. The help array
- * is terminated by NULL sentinel. */
-void addReplyHelp(client *c, const char **help) {
-    sds cmd = sdsnew((char*) c->argv[0]->ptr);
-    void *blenp = addReplyDeferredLen(c);
-    int blen = 0;
-
-    sdstoupper(cmd);
-    addReplyStatusFormat(c,
-        "%s <subcommand> [<arg> [value] [opt] ...]. Subcommands are:",cmd);
-    sdsfree(cmd);
-
-    while (help[blen]) addReplyStatus(c,help[blen++]);
-
-    addReplyStatus(c,"HELP");
-    addReplyStatus(c,"    Prints this help.");
-
-    blen += 1;  /* Account for the header. */
-    blen += 2;  /* Account for the footer. */
-    setDeferredArrayLen(c,blenp,blen);
-}
-
-/* Add a suggestive error reply.
- * This function is typically invoked by from commands that support
- * subcommands in response to an unknown subcommand or argument error. */
-void addReplySubcommandSyntaxError(client *c) {
-    sds cmd = sdsnew((char*) c->argv[0]->ptr);
-    sdstoupper(cmd);
-    addReplyErrorFormat(c,
-        "Unknown subcommand or wrong number of arguments for '%s'. Try %s HELP.",
-        (char*)c->argv[1]->ptr,cmd);
-    sdsfree(cmd);
-}
-
-/* Append 'src' client output buffers into 'dst' client output buffers.
- * This function clears the output buffers of 'src' */
-void AddReplyFromClient(client *dst, client *src) {
-    /* If the source client contains a partial response due to client output
-     * buffer limits, propagate that to the dest rather than copy a partial
-     * reply. We don't wanna run the risk of copying partial response in case
-     * for some reason the output limits don't reach the same decision (maybe
-     * they changed) */
-    if (src->flags & CLIENT_CLOSE_ASAP) {
-        sds client = catClientInfoString(sdsempty(),dst);
-        freeClientAsync(dst);
-        serverLog(LL_WARNING,"Client %s scheduled to be closed ASAP for overcoming of output buffer limits.", client);
-        sdsfree(client);
-        return;
-    }
-
-    /* First add the static buffer (either into the static buffer or reply list) */
-    addReplyProto(dst,src->buf, src->bufpos);
-
-    /* We need to check with prepareClientToWrite again (after addReplyProto)
-     * since addReplyProto may have changed something (like CLIENT_CLOSE_ASAP) */
-    if (prepareClientToWrite(dst) != C_OK)
-        return;
-
-    /* We're bypassing _addReplyProtoToList, so we need to add the pre/post
-     * checks in it. */
-    if (dst->flags & CLIENT_CLOSE_AFTER_REPLY) return;
-
-    /* Concatenate the reply list into the dest */
-    if (listLength(src->reply))
-        listJoin(dst->reply,src->reply);
-    dst->reply_bytes += src->reply_bytes;
-    src->reply_bytes = 0;
-    src->bufpos = 0;
-
-    /* Check output buffer limits */
-    closeClientOnOutputBufferLimitReached(dst, 1);
-}
-
-/* Copy 'src' client output buffers into 'dst' client output buffers.
- * The function takes care of freeing the old output buffers of the
- * destination client. */
-void copyClientOutputBuffer(client *dst, client *src) {
-    listRelease(dst->reply);
-    dst->sentlen = 0;
-    dst->reply = listDup(src->reply);
-    memcpy(dst->buf,src->buf,src->bufpos);
-    dst->bufpos = src->bufpos;
-    dst->reply_bytes = src->reply_bytes;
-}
-
-/* Return true if the specified client has pending reply buffers to write to
- * the socket. */
-int clientHasPendingReplies(client *c) {
-    return c->bufpos || listLength(c->reply);
-}
-
-void clientAcceptHandler(connection *conn) {
-    client *c = connGetPrivateData(conn);
-
-    if (connGetState(conn) != CONN_STATE_CONNECTED) {
-        serverLog(LL_WARNING,
-                "Error accepting a client connection: %s",
-                connGetLastError(conn));
-        freeClientAsync(c);
-        return;
-    }
-
-    /* If the server is running in protected mode (the default) and there
-     * is no password set, nor a specific interface is bound, we don't accept
-     * requests from non loopback interfaces. Instead we try to explain the
-     * user what to do to fix it if needed. */
-    if (server.protected_mode &&
-        server.bindaddr_count == 0 &&
-        DefaultUser->flags & USER_FLAG_NOPASS &&
-        !(c->flags & CLIENT_UNIX_SOCKET))
-    {
-        char cip[NET_IP_STR_LEN+1] = { 0 };
-        connPeerToString(conn, cip, sizeof(cip)-1, NULL);
-
-        if (strcmp(cip,"127.0.0.1") && strcmp(cip,"::1")) {
-            char *err =
-                "-DENIED Redis is running in protected mode because protected "
-                "mode is enabled, no bind address was specified, no "
-                "authentication password is requested to clients. In this mode "
-                "connections are only accepted from the loopback interface. "
-                "If you want to connect from external computers to Redis you "
-                "may adopt one of the following solutions: "
-                "1) Just disable protected mode sending the command "
-                "'CONFIG SET protected-mode no' from the loopback interface "
-                "by connecting to Redis from the same host the server is "
-                "running, however MAKE SURE Redis is not publicly accessible "
-                "from internet if you do so. Use CONFIG REWRITE to make this "
-                "change permanent. "
-                "2) Alternatively you can just disable the protected mode by "
-                "editing the Redis configuration file, and setting the protected "
-                "mode option to 'no', and then restarting the server. "
-                "3) If you started the server manually just for testing, restart "
-                "it with the '--protected-mode no' option. "
-                "4) Setup a bind address or an authentication password. "
-                "NOTE: You only need to do one of the above things in order for "
-                "the server to start accepting connections from the outside.\r\n";
-            if (connWrite(c->conn,err,strlen(err)) == -1) {
-                /* Nothing to do, Just to avoid the warning... */
-            }
-            server.stat_rejected_conn++;
-            freeClientAsync(c);
-            return;
-        }
-    }
-
-    server.stat_numconnections++;
-    moduleFireServerEvent(REDISMODULE_EVENT_CLIENT_CHANGE,
-                          REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED,
-                          c);
-}
-
-#define MAX_ACCEPTS_PER_CALL 1000
-static void acceptCommonHandler(connection *conn, int flags, char *ip) {
-    client *c;
-    char conninfo[100];
-    UNUSED(ip);
-
-    if (connGetState(conn) != CONN_STATE_ACCEPTING) {
-        serverLog(LL_VERBOSE,
-            "Accepted client connection in error state: %s (conn: %s)",
-            connGetLastError(conn),
-            connGetInfo(conn, conninfo, sizeof(conninfo)));
-        connClose(conn);
-        return;
-    }
-
-    /* Limit the number of connections we take at the same time.
-     *
-     * Admission control will happen before a client is created and connAccept()
-     * called, because we don't want to even start transport-level negotiation
-     * if rejected. */
-    if (listLength(server.clients) + getClusterConnectionsCount()
-        >= server.maxclients)
-    {
-        char *err;
-        if (server.cluster_enabled)
-            err = "-ERR max number of clients + cluster "
-                  "connections reached\r\n";
-        else
-            err = "-ERR max number of clients reached\r\n";
-
-        /* That's a best effort error message, don't check write errors.
-         * Note that for TLS connections, no handshake was done yet so nothing
-         * is written and the connection will just drop. */
-        if (connWrite(conn,err,strlen(err)) == -1) {
-            /* Nothing to do, Just to avoid the warning... */
-        }
-        server.stat_rejected_conn++;
-        connClose(conn);
-        return;
-    }
-
-    /* Create connection and client */
-    if ((c = createClient(conn)) == NULL) {
-        serverLog(LL_WARNING,
-            "Error registering fd event for the new client: %s (conn: %s)",
-            connGetLastError(conn),
-            connGetInfo(conn, conninfo, sizeof(conninfo)));
-        connClose(conn); /* May be already closed, just ignore errors */
-        return;
-    }
-
-    /* Last chance to keep flags */
-    c->flags |= flags;
-
-    /* Initiate accept.
-     *
-     * Note that connAccept() is free to do two things here:
-     * 1. Call clientAcceptHandler() immediately;
-     * 2. Schedule a future call to clientAcceptHandler().
-     *
-     * Because of that, we must do nothing else afterwards.
-     */
-    if (connAccept(conn, clientAcceptHandler) == C_ERR) {
-        char conninfo[100];
-        if (connGetState(conn) == CONN_STATE_ERROR)
-            serverLog(LL_WARNING,
-                    "Error accepting a client connection: %s (conn: %s)",
-                    connGetLastError(conn), connGetInfo(conn, conninfo, sizeof(conninfo)));
-        freeClient(connGetPrivateData(conn));
-        return;
-    }
-}
-
-void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    int cport, cfd, max = MAX_ACCEPTS_PER_CALL;
-    char cip[NET_IP_STR_LEN];
-    UNUSED(el);
-    UNUSED(mask);
-    UNUSED(privdata);
-
-    while(max--) {
-        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
-        if (cfd == ANET_ERR) {
-            if (errno != EWOULDBLOCK)
-                serverLog(LL_WARNING,
-                    "Accepting client connection: %s", server.neterr);
-            return;
-        }
-        anetCloexec(cfd);
-        serverLog(LL_VERBOSE,"Accepted %s:%d", cip, cport);
-        acceptCommonHandler(connCreateAcceptedSocket(cfd),0,cip);
-    }
-}
-
-void acceptTLSHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    int cport, cfd, max = MAX_ACCEPTS_PER_CALL;
-    char cip[NET_IP_STR_LEN];
-    UNUSED(el);
-    UNUSED(mask);
-    UNUSED(privdata);
-
-    while(max--) {
-        cfd = anetTcpAccept(server.neterr, fd, cip, sizeof(cip), &cport);
-        if (cfd == ANET_ERR) {
-            if (errno != EWOULDBLOCK)
-                serverLog(LL_WARNING,
-                    "Accepting client connection: %s", server.neterr);
-            return;
-        }
-        anetCloexec(cfd);
-        serverLog(LL_VERBOSE,"Accepted %s:%d", cip, cport);
-        acceptCommonHandler(connCreateAcceptedTLS(cfd, server.tls_auth_clients),0,cip);
-    }
-}
-
-void acceptUnixHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    int cfd, max = MAX_ACCEPTS_PER_CALL;
-    UNUSED(el);
-    UNUSED(mask);
-    UNUSED(privdata);
-
-    while(max--) {
-        cfd = anetUnixAccept(server.neterr, fd);
-        if (cfd == ANET_ERR) {
-            if (errno != EWOULDBLOCK)
-                serverLog(LL_WARNING,
-                    "Accepting client connection: %s", server.neterr);
-            return;
-        }
-        anetCloexec(cfd);
-        serverLog(LL_VERBOSE,"Accepted connection to %s", server.unixsocket);
-        acceptCommonHandler(connCreateAcceptedSocket(cfd),CLIENT_UNIX_SOCKET,NULL);
-    }
-}
-
-void freeClientOriginalArgv(client *c) {
-    /* We didn't rewrite this client */
-    if (!c->original_argv) return;
-
-    for (int j = 0; j < c->original_argc; j++)
-        decrRefCount(c->original_argv[j]);
-    zfree(c->original_argv);
-    c->original_argv = NULL;
-    c->original_argc = 0;
-}
-
-static void freeClientArgv(client *c) {
-    int j;
-    for (j = 0; j < c->argc; j++)
-        decrRefCount(c->argv[j]);
-    c->argc = 0;
-    c->cmd = NULL;
-    c->argv_len_sum = 0;
-}
-
-/* Close all the slaves connections. This is useful in chained replication
- * when we resync with our own master and want to force all our slaves to
- * resync with us as well. */
-void disconnectSlaves(void) {
-    listIter li;
-    listNode *ln;
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        freeClient((client*)ln->value);
-    }
-}
-
-/* Check if there is any other slave waiting dumping RDB finished expect me.
- * This function is useful to judge current dumping RDB can be used for full
- * synchronization or not. */
-int anyOtherSlaveWaitRdb(client *except_me) {
-    listIter li;
-    listNode *ln;
-
-    listRewind(server.slaves, &li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-        if (slave != except_me &&
-            slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END)
-        {
-            return 1;
-        }
-    }
-    return 0;
-}
-
-/* Remove the specified client from global lists where the client could
- * be referenced, not including the Pub/Sub channels.
- * This is used by freeClient() and replicationCacheMaster(). */
-void unlinkClient(client *c) {
-    listNode *ln;
-
-    /* If this is marked as current client unset it. */
-    if (server.current_client == c) server.current_client = NULL;
-
-    /* Certain operations must be done only if the client has an active connection.
-     * If the client was already unlinked or if it's a "fake client" the
-     * conn is already set to NULL. */
-    if (c->conn) {
-        /* Remove from the list of active clients. */
-        if (c->client_list_node) {
-            uint64_t id = htonu64(c->id);
-            raxRemove(server.clients_index,(unsigned char*)&id,sizeof(id),NULL);
-            listDelNode(server.clients,c->client_list_node);
-            c->client_list_node = NULL;
-        }
-
-        /* Check if this is a replica waiting for diskless replication (rdb pipe),
-         * in which case it needs to be cleaned from that list */
-        if (c->flags & CLIENT_SLAVE &&
-            c->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
-            server.rdb_pipe_conns)
-        {
-            int i;
-            for (i=0; i < server.rdb_pipe_numconns; i++) {
-                if (server.rdb_pipe_conns[i] == c->conn) {
-                    rdbPipeWriteHandlerConnRemoved(c->conn);
-                    server.rdb_pipe_conns[i] = NULL;
-                    break;
-                }
-            }
-        }
-        connClose(c->conn);
-        c->conn = NULL;
-    }
-
-    /* Remove from the list of pending writes if needed. */
-    if (c->flags & CLIENT_PENDING_WRITE) {
-        ln = listSearchKey(server.clients_pending_write,c);
-        serverAssert(ln != NULL);
-        listDelNode(server.clients_pending_write,ln);
-        c->flags &= ~CLIENT_PENDING_WRITE;
-    }
-
-    /* Remove from the list of pending reads if needed. */
-    if (c->flags & CLIENT_PENDING_READ) {
-        ln = listSearchKey(server.clients_pending_read,c);
-        serverAssert(ln != NULL);
-        listDelNode(server.clients_pending_read,ln);
-        c->flags &= ~CLIENT_PENDING_READ;
-    }
-
-    /* When client was just unblocked because of a blocking operation,
-     * remove it from the list of unblocked clients. */
-    if (c->flags & CLIENT_UNBLOCKED) {
-        ln = listSearchKey(server.unblocked_clients,c);
-        serverAssert(ln != NULL);
-        listDelNode(server.unblocked_clients,ln);
-        c->flags &= ~CLIENT_UNBLOCKED;
-    }
-
-    /* Clear the tracking status. */
-    if (c->flags & CLIENT_TRACKING) disableTracking(c);
-}
-
-void freeClient(client *c) {
-    listNode *ln;
-
-    /* If a client is protected, yet we need to free it right now, make sure
-     * to at least use asynchronous freeing. */
-    if (c->flags & CLIENT_PROTECTED) {
-        freeClientAsync(c);
-        return;
-    }
-
-    /* For connected clients, call the disconnection event of modules hooks. */
-    if (c->conn) {
-        moduleFireServerEvent(REDISMODULE_EVENT_CLIENT_CHANGE,
-                              REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED,
-                              c);
-    }
-
-    /* Notify module system that this client auth status changed. */
-    moduleNotifyUserChanged(c);
-
-    /* If this client was scheduled for async freeing we need to remove it
-     * from the queue. Note that we need to do this here, because later
-     * we may call replicationCacheMaster() and the client should already
-     * be removed from the list of clients to free. */
-    if (c->flags & CLIENT_CLOSE_ASAP) {
-        ln = listSearchKey(server.clients_to_close,c);
-        serverAssert(ln != NULL);
-        listDelNode(server.clients_to_close,ln);
-    }
-
-    /* If it is our master that's being disconnected we should make sure
-     * to cache the state to try a partial resynchronization later.
-     *
-     * Note that before doing this we make sure that the client is not in
-     * some unexpected state, by checking its flags. */
-    if (server.master && c->flags & CLIENT_MASTER) {
-        serverLog(LL_WARNING,"Connection with master lost.");
-        if (!(c->flags & (CLIENT_PROTOCOL_ERROR|CLIENT_BLOCKED))) {
-            c->flags &= ~(CLIENT_CLOSE_ASAP|CLIENT_CLOSE_AFTER_REPLY);
-            replicationCacheMaster(c);
-            return;
-        }
-    }
-
-    /* Log link disconnection with slave */
-    if (getClientType(c) == CLIENT_TYPE_SLAVE) {
-        serverLog(LL_WARNING,"Connection with replica %s lost.",
-            replicationGetSlaveName(c));
-    }
-
-    /* Free the query buffer */
-    sdsfree(c->querybuf);
-    sdsfree(c->pending_querybuf);
-    c->querybuf = NULL;
-
-    /* Deallocate structures used to block on blocking ops. */
-    if (c->flags & CLIENT_BLOCKED) unblockClient(c);
-    dictRelease(c->bpop.keys);
-
-    /* UNWATCH all the keys */
-    unwatchAllKeys(c);
-    listRelease(c->watched_keys);
-
-    /* Unsubscribe from all the pubsub channels */
-    pubsubUnsubscribeAllChannels(c,0);
-    pubsubUnsubscribeAllPatterns(c,0);
-    dictRelease(c->pubsub_channels);
-    listRelease(c->pubsub_patterns);
-
-    /* Free data structures. */
-    listRelease(c->reply);
-    freeClientArgv(c);
-    freeClientOriginalArgv(c);
-
-    /* Unlink the client: this will close the socket, remove the I/O
-     * handlers, and remove references of the client from different
-     * places where active clients may be referenced. */
-    unlinkClient(c);
-
-    /* Master/slave cleanup Case 1:
-     * we lost the connection with a slave. */
-    if (c->flags & CLIENT_SLAVE) {
-        /* If there is no any other slave waiting dumping RDB finished, the
-         * current child process need not continue to dump RDB, then we kill it.
-         * So child process won't use more memory, and we also can fork a new
-         * child process asap to dump rdb for next full synchronization or bgsave.
-         * But we also need to check if users enable 'save' RDB, if enable, we
-         * should not remove directly since that means RDB is important for users
-         * to keep data safe and we may delay configured 'save' for full sync. */
-        if (server.saveparamslen == 0 &&
-            c->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
-            server.child_type == CHILD_TYPE_RDB &&
-            server.rdb_child_type == RDB_CHILD_TYPE_DISK &&
-            anyOtherSlaveWaitRdb(c) == 0)
-        {
-            killRDBChild();
-        }
-        if (c->replstate == SLAVE_STATE_SEND_BULK) {
-            if (c->repldbfd != -1) close(c->repldbfd);
-            if (c->replpreamble) sdsfree(c->replpreamble);
-        }
-        list *l = (c->flags & CLIENT_MONITOR) ? server.monitors : server.slaves;
-        ln = listSearchKey(l,c);
-        serverAssert(ln != NULL);
-        listDelNode(l,ln);
-        /* We need to remember the time when we started to have zero
-         * attached slaves, as after some time we'll free the replication
-         * backlog. */
-        if (getClientType(c) == CLIENT_TYPE_SLAVE && listLength(server.slaves) == 0)
-            server.repl_no_slaves_since = server.unixtime;
-        refreshGoodSlavesCount();
-        /* Fire the replica change modules event. */
-        if (c->replstate == SLAVE_STATE_ONLINE)
-            moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
-                                  REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE,
-                                  NULL);
-    }
-
-    /* Master/slave cleanup Case 2:
-     * we lost the connection with the master. */
-    if (c->flags & CLIENT_MASTER) replicationHandleMasterDisconnection();
-
-   /* Remove the contribution that this client gave to our
-     * incrementally computed memory usage. */
-    server.stat_clients_type_memory[c->client_cron_last_memory_type] -=
-        c->client_cron_last_memory_usage;
-
-    /* Release other dynamically allocated client structure fields,
-     * and finally release the client structure itself. */
-    if (c->name) decrRefCount(c->name);
-    zfree(c->argv);
-    c->argv_len_sum = 0;
-    freeClientMultiState(c);
-    sdsfree(c->peerid);
-    sdsfree(c->sockname);
-    sdsfree(c->slave_addr);
-    zfree(c);
-}
-
-/* Schedule a client to free it at a safe time in the serverCron() function.
- * This function is useful when we need to terminate a client but we are in
- * a context where calling freeClient() is not possible, because the client
- * should be valid for the continuation of the flow of the program. */
-void freeClientAsync(client *c) {
-    /* We need to handle concurrent access to the server.clients_to_close list
-     * only in the freeClientAsync() function, since it's the only function that
-     * may access the list while Redis uses I/O threads. All the other accesses
-     * are in the context of the main thread while the other threads are
-     * idle. */
-    if (c->flags & CLIENT_CLOSE_ASAP || c->flags & CLIENT_LUA) return;
-    c->flags |= CLIENT_CLOSE_ASAP;
-    if (server.io_threads_num == 1) {
-        /* no need to bother with locking if there's just one thread (the main thread) */
-        listAddNodeTail(server.clients_to_close,c);
-        return;
-    }
-    static pthread_mutex_t async_free_queue_mutex = PTHREAD_MUTEX_INITIALIZER;
-    pthread_mutex_lock(&async_free_queue_mutex);
-    listAddNodeTail(server.clients_to_close,c);
-    pthread_mutex_unlock(&async_free_queue_mutex);
-}
-
-/* Free the clients marked as CLOSE_ASAP, return the number of clients
- * freed. */
-int freeClientsInAsyncFreeQueue(void) {
-    int freed = 0;
-    listIter li;
-    listNode *ln;
-
-    listRewind(server.clients_to_close,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        client *c = listNodeValue(ln);
-
-        if (c->flags & CLIENT_PROTECTED) continue;
-
-        c->flags &= ~CLIENT_CLOSE_ASAP;
-        freeClient(c);
-        listDelNode(server.clients_to_close,ln);
-        freed++;
-    }
-    return freed;
-}
-
-/* Return a client by ID, or NULL if the client ID is not in the set
- * of registered clients. Note that "fake clients", created with -1 as FD,
- * are not registered clients. */
-client *lookupClientByID(uint64_t id) {
-    id = htonu64(id);
-    client *c = raxFind(server.clients_index,(unsigned char*)&id,sizeof(id));
-    return (c == raxNotFound) ? NULL : c;
-}
-
-/* Write data in output buffers to client. Return C_OK if the client
- * is still valid after the call, C_ERR if it was freed because of some
- * error.  If handler_installed is set, it will attempt to clear the
- * write event.
- *
- * This function is called by threads, but always with handler_installed
- * set to 0. So when handler_installed is set to 0 the function must be
- * thread safe. */
-int writeToClient(client *c, int handler_installed) {
-    /* Update total number of writes on server */
-    atomicIncr(server.stat_total_writes_processed, 1);
-
-    ssize_t nwritten = 0, totwritten = 0;
-    size_t objlen;
-    clientReplyBlock *o;
-
-    while(clientHasPendingReplies(c)) {
-        if (c->bufpos > 0) {
-            nwritten = connWrite(c->conn,c->buf+c->sentlen,c->bufpos-c->sentlen);
-            if (nwritten <= 0) break;
-            c->sentlen += nwritten;
-            totwritten += nwritten;
-
-            /* If the buffer was sent, set bufpos to zero to continue with
-             * the remainder of the reply. */
-            if ((int)c->sentlen == c->bufpos) {
-                c->bufpos = 0;
-                c->sentlen = 0;
-            }
-        } else {
-            o = listNodeValue(listFirst(c->reply));
-            objlen = o->used;
-
-            if (objlen == 0) {
-                c->reply_bytes -= o->size;
-                listDelNode(c->reply,listFirst(c->reply));
-                continue;
-            }
-
-            nwritten = connWrite(c->conn, o->buf + c->sentlen, objlen - c->sentlen);
-            if (nwritten <= 0) break;
-            c->sentlen += nwritten;
-            totwritten += nwritten;
-
-            /* If we fully sent the object on head go to the next one */
-            if (c->sentlen == objlen) {
-                c->reply_bytes -= o->size;
-                listDelNode(c->reply,listFirst(c->reply));
-                c->sentlen = 0;
-                /* If there are no longer objects in the list, we expect
-                 * the count of reply bytes to be exactly zero. */
-                if (listLength(c->reply) == 0)
-                    serverAssert(c->reply_bytes == 0);
-            }
-        }
-        /* Note that we avoid to send more than NET_MAX_WRITES_PER_EVENT
-         * bytes, in a single threaded server it's a good idea to serve
-         * other clients as well, even if a very large request comes from
-         * super fast link that is always able to accept data (in real world
-         * scenario think about 'KEYS *' against the loopback interface).
-         *
-         * However if we are over the maxmemory limit we ignore that and
-         * just deliver as much data as it is possible to deliver.
-         *
-         * Moreover, we also send as much as possible if the client is
-         * a slave or a monitor (otherwise, on high-speed traffic, the
-         * replication/output buffer will grow indefinitely) */
-        if (totwritten > NET_MAX_WRITES_PER_EVENT &&
-            (server.maxmemory == 0 ||
-             zmalloc_used_memory() < server.maxmemory) &&
-            !(c->flags & CLIENT_SLAVE)) break;
-    }
-    atomicIncr(server.stat_net_output_bytes, totwritten);
-    if (nwritten == -1) {
-        if (connGetState(c->conn) != CONN_STATE_CONNECTED) {
-            serverLog(LL_VERBOSE,
-                "Error writing to client: %s", connGetLastError(c->conn));
-            freeClientAsync(c);
-            return C_ERR;
-        }
-    }
-    if (totwritten > 0) {
-        /* For clients representing masters we don't count sending data
-         * as an interaction, since we always send REPLCONF ACK commands
-         * that take some time to just fill the socket output buffer.
-         * We just rely on data / pings received for timeout detection. */
-        if (!(c->flags & CLIENT_MASTER)) c->lastinteraction = server.unixtime;
-    }
-    if (!clientHasPendingReplies(c)) {
-        c->sentlen = 0;
-        /* Note that writeToClient() is called in a threaded way, but
-         * adDeleteFileEvent() is not thread safe: however writeToClient()
-         * is always called with handler_installed set to 0 from threads
-         * so we are fine. */
-        if (handler_installed) connSetWriteHandler(c->conn, NULL);
-
-        /* Close connection after entire reply has been sent. */
-        if (c->flags & CLIENT_CLOSE_AFTER_REPLY) {
-            freeClientAsync(c);
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* Write event handler. Just send data to the client. */
-void sendReplyToClient(connection *conn) {
-    client *c = connGetPrivateData(conn);
-    writeToClient(c,1);
-}
-
-/* This function is called just before entering the event loop, in the hope
- * we can just write the replies to the client output buffer without any
- * need to use a syscall in order to install the writable event handler,
- * get it called, and so forth. */
-int handleClientsWithPendingWrites(void) {
-    listIter li;
-    listNode *ln;
-    int processed = listLength(server.clients_pending_write);
-
-    listRewind(server.clients_pending_write,&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-        c->flags &= ~CLIENT_PENDING_WRITE;
-        listDelNode(server.clients_pending_write,ln);
-
-        /* If a client is protected, don't do anything,
-         * that may trigger write error or recreate handler. */
-        if (c->flags & CLIENT_PROTECTED) continue;
-
-        /* Don't write to clients that are going to be closed anyway. */
-        if (c->flags & CLIENT_CLOSE_ASAP) continue;
-
-        /* Try to write buffers to the client socket. */
-        if (writeToClient(c,0) == C_ERR) continue;
-
-        /* If after the synchronous writes above we still have data to
-         * output to the client, we need to install the writable handler. */
-        if (clientHasPendingReplies(c)) {
-            int ae_barrier = 0;
-            /* For the fsync=always policy, we want that a given FD is never
-             * served for reading and writing in the same event loop iteration,
-             * so that in the middle of receiving the query, and serving it
-             * to the client, we'll call beforeSleep() that will do the
-             * actual fsync of AOF to disk. the write barrier ensures that. */
-            if (server.aof_state == AOF_ON &&
-                server.aof_fsync == AOF_FSYNC_ALWAYS)
-            {
-                ae_barrier = 1;
-            }
-            if (connSetWriteHandlerWithBarrier(c->conn, sendReplyToClient, ae_barrier) == C_ERR) {
-                freeClientAsync(c);
-            }
-        }
-    }
-    return processed;
-}
-
-/* resetClient prepare the client to process the next command */
-void resetClient(client *c) {
-    redisCommandProc *prevcmd = c->cmd ? c->cmd->proc : NULL;
-
-    freeClientArgv(c);
-    c->reqtype = 0;
-    c->multibulklen = 0;
-    c->bulklen = -1;
-
-    /* We clear the ASKING flag as well if we are not inside a MULTI, and
-     * if what we just executed is not the ASKING command itself. */
-    if (!(c->flags & CLIENT_MULTI) && prevcmd != askingCommand)
-        c->flags &= ~CLIENT_ASKING;
-
-    /* We do the same for the CACHING command as well. It also affects
-     * the next command or transaction executed, in a way very similar
-     * to ASKING. */
-    if (!(c->flags & CLIENT_MULTI) && prevcmd != clientCommand)
-        c->flags &= ~CLIENT_TRACKING_CACHING;
-
-    /* Remove the CLIENT_REPLY_SKIP flag if any so that the reply
-     * to the next command will be sent, but set the flag if the command
-     * we just processed was "CLIENT REPLY SKIP". */
-    c->flags &= ~CLIENT_REPLY_SKIP;
-    if (c->flags & CLIENT_REPLY_SKIP_NEXT) {
-        c->flags |= CLIENT_REPLY_SKIP;
-        c->flags &= ~CLIENT_REPLY_SKIP_NEXT;
-    }
-}
-
-/* This function is used when we want to re-enter the event loop but there
- * is the risk that the client we are dealing with will be freed in some
- * way. This happens for instance in:
- *
- * * DEBUG RELOAD and similar.
- * * When a Lua script is in -BUSY state.
- *
- * So the function will protect the client by doing two things:
- *
- * 1) It removes the file events. This way it is not possible that an
- *    error is signaled on the socket, freeing the client.
- * 2) Moreover it makes sure that if the client is freed in a different code
- *    path, it is not really released, but only marked for later release. */
-void protectClient(client *c) {
-    c->flags |= CLIENT_PROTECTED;
-    if (c->conn) {
-        connSetReadHandler(c->conn,NULL);
-        connSetWriteHandler(c->conn,NULL);
-    }
-}
-
-/* This will undo the client protection done by protectClient() */
-void unprotectClient(client *c) {
-    if (c->flags & CLIENT_PROTECTED) {
-        c->flags &= ~CLIENT_PROTECTED;
-        if (c->conn) {
-            connSetReadHandler(c->conn,readQueryFromClient);
-            if (clientHasPendingReplies(c)) clientInstallWriteHandler(c);
-        }
-    }
-}
-
-/* Like processMultibulkBuffer(), but for the inline protocol instead of RESP,
- * this function consumes the client query buffer and creates a command ready
- * to be executed inside the client structure. Returns C_OK if the command
- * is ready to be executed, or C_ERR if there is still protocol to read to
- * have a well formed command. The function also returns C_ERR when there is
- * a protocol error: in such a case the client structure is setup to reply
- * with the error and close the connection. */
-int processInlineBuffer(client *c) {
-    char *newline;
-    int argc, j, linefeed_chars = 1;
-    sds *argv, aux;
-    size_t querylen;
-
-    /* Search for end of line */
-    newline = strchr(c->querybuf+c->qb_pos,'\n');
-
-    /* Nothing to do without a \r\n */
-    if (newline == NULL) {
-        if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
-            addReplyError(c,"Protocol error: too big inline request");
-            setProtocolError("too big inline request",c);
-        }
-        return C_ERR;
-    }
-
-    /* Handle the \r\n case. */
-    if (newline != c->querybuf+c->qb_pos && *(newline-1) == '\r')
-        newline--, linefeed_chars++;
-
-    /* Split the input buffer up to the \r\n */
-    querylen = newline-(c->querybuf+c->qb_pos);
-    aux = sdsnewlen(c->querybuf+c->qb_pos,querylen);
-    argv = sdssplitargs(aux,&argc);
-    sdsfree(aux);
-    if (argv == NULL) {
-        addReplyError(c,"Protocol error: unbalanced quotes in request");
-        setProtocolError("unbalanced quotes in inline request",c);
-        return C_ERR;
-    }
-
-    /* Newline from slaves can be used to refresh the last ACK time.
-     * This is useful for a slave to ping back while loading a big
-     * RDB file. */
-    if (querylen == 0 && getClientType(c) == CLIENT_TYPE_SLAVE)
-        c->repl_ack_time = server.unixtime;
-
-    /* Masters should never send us inline protocol to run actual
-     * commands. If this happens, it is likely due to a bug in Redis where
-     * we got some desynchronization in the protocol, for example
-     * beause of a PSYNC gone bad.
-     *
-     * However the is an exception: masters may send us just a newline
-     * to keep the connection active. */
-    if (querylen != 0 && c->flags & CLIENT_MASTER) {
-        sdsfreesplitres(argv,argc);
-        serverLog(LL_WARNING,"WARNING: Receiving inline protocol from master, master stream corruption? Closing the master connection and discarding the cached master.");
-        setProtocolError("Master using the inline protocol. Desync?",c);
-        return C_ERR;
-    }
-
-    /* Move querybuffer position to the next query in the buffer. */
-    c->qb_pos += querylen+linefeed_chars;
-
-    /* Setup argv array on client structure */
-    if (argc) {
-        if (c->argv) zfree(c->argv);
-        c->argv = zmalloc(sizeof(robj*)*argc);
-        c->argv_len_sum = 0;
-    }
-
-    /* Create redis objects for all arguments. */
-    for (c->argc = 0, j = 0; j < argc; j++) {
-        c->argv[c->argc] = createObject(OBJ_STRING,argv[j]);
-        c->argc++;
-        c->argv_len_sum += sdslen(argv[j]);
-    }
-    zfree(argv);
-    return C_OK;
-}
-
-/* Helper function. Record protocol erro details in server log,
- * and set the client as CLIENT_CLOSE_AFTER_REPLY and
- * CLIENT_PROTOCOL_ERROR. */
-#define PROTO_DUMP_LEN 128
-static void setProtocolError(const char *errstr, client *c) {
-    if (server.verbosity <= LL_VERBOSE || c->flags & CLIENT_MASTER) {
-        sds client = catClientInfoString(sdsempty(),c);
-
-        /* Sample some protocol to given an idea about what was inside. */
-        char buf[256];
-        if (sdslen(c->querybuf)-c->qb_pos < PROTO_DUMP_LEN) {
-            snprintf(buf,sizeof(buf),"Query buffer during protocol error: '%s'", c->querybuf+c->qb_pos);
-        } else {
-            snprintf(buf,sizeof(buf),"Query buffer during protocol error: '%.*s' (... more %zu bytes ...) '%.*s'", PROTO_DUMP_LEN/2, c->querybuf+c->qb_pos, sdslen(c->querybuf)-c->qb_pos-PROTO_DUMP_LEN, PROTO_DUMP_LEN/2, c->querybuf+sdslen(c->querybuf)-PROTO_DUMP_LEN/2);
-        }
-
-        /* Remove non printable chars. */
-        char *p = buf;
-        while (*p != '\0') {
-            if (!isprint(*p)) *p = '.';
-            p++;
-        }
-
-        /* Log all the client and protocol info. */
-        int loglevel = (c->flags & CLIENT_MASTER) ? LL_WARNING :
-                                                    LL_VERBOSE;
-        serverLog(loglevel,
-            "Protocol error (%s) from client: %s. %s", errstr, client, buf);
-        sdsfree(client);
-    }
-    c->flags |= (CLIENT_CLOSE_AFTER_REPLY|CLIENT_PROTOCOL_ERROR);
-}
-
-/* Process the query buffer for client 'c', setting up the client argument
- * vector for command execution. Returns C_OK if after running the function
- * the client has a well-formed ready to be processed command, otherwise
- * C_ERR if there is still to read more buffer to get the full command.
- * The function also returns C_ERR when there is a protocol error: in such a
- * case the client structure is setup to reply with the error and close
- * the connection.
- *
- * This function is called if processInputBuffer() detects that the next
- * command is in RESP format, so the first byte in the command is found
- * to be '*'. Otherwise for inline commands processInlineBuffer() is called. */
-int processMultibulkBuffer(client *c) {
-    char *newline = NULL;
-    int ok;
-    long long ll;
-
-    if (c->multibulklen == 0) {
-        /* The client should have been reset */
-        serverAssertWithInfo(c,NULL,c->argc == 0);
-
-        /* Multi bulk length cannot be read without a \r\n */
-        newline = strchr(c->querybuf+c->qb_pos,'\r');
-        if (newline == NULL) {
-            if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
-                addReplyError(c,"Protocol error: too big mbulk count string");
-                setProtocolError("too big mbulk count string",c);
-            }
-            return C_ERR;
-        }
-
-        /* Buffer should also contain \n */
-        if (newline-(c->querybuf+c->qb_pos) > (ssize_t)(sdslen(c->querybuf)-c->qb_pos-2))
-            return C_ERR;
-
-        /* We know for sure there is a whole line since newline != NULL,
-         * so go ahead and find out the multi bulk length. */
-        serverAssertWithInfo(c,NULL,c->querybuf[c->qb_pos] == '*');
-        ok = string2ll(c->querybuf+1+c->qb_pos,newline-(c->querybuf+1+c->qb_pos),&ll);
-        if (!ok || ll > 1024*1024) {
-            addReplyError(c,"Protocol error: invalid multibulk length");
-            setProtocolError("invalid mbulk count",c);
-            return C_ERR;
-        } else if (ll > 10 && authRequired(c)) {
-            addReplyError(c, "Protocol error: unauthenticated multibulk length");
-            setProtocolError("unauth mbulk count", c);
-            return C_ERR;
-        }
-
-        c->qb_pos = (newline-c->querybuf)+2;
-
-        if (ll <= 0) return C_OK;
-
-        c->multibulklen = ll;
-
-        /* Setup argv array on client structure */
-        if (c->argv) zfree(c->argv);
-        c->argv = zmalloc(sizeof(robj*)*c->multibulklen);
-        c->argv_len_sum = 0;
-    }
-
-    serverAssertWithInfo(c,NULL,c->multibulklen > 0);
-    while(c->multibulklen) {
-        /* Read bulk length if unknown */
-        if (c->bulklen == -1) {
-            newline = strchr(c->querybuf+c->qb_pos,'\r');
-            if (newline == NULL) {
-                if (sdslen(c->querybuf)-c->qb_pos > PROTO_INLINE_MAX_SIZE) {
-                    addReplyError(c,
-                        "Protocol error: too big bulk count string");
-                    setProtocolError("too big bulk count string",c);
-                    return C_ERR;
-                }
-                break;
-            }
-
-            /* Buffer should also contain \n */
-            if (newline-(c->querybuf+c->qb_pos) > (ssize_t)(sdslen(c->querybuf)-c->qb_pos-2))
-                break;
-
-            if (c->querybuf[c->qb_pos] != '$') {
-                addReplyErrorFormat(c,
-                    "Protocol error: expected '$', got '%c'",
-                    c->querybuf[c->qb_pos]);
-                setProtocolError("expected $ but got something else",c);
-                return C_ERR;
-            }
-
-            ok = string2ll(c->querybuf+c->qb_pos+1,newline-(c->querybuf+c->qb_pos+1),&ll);
-            if (!ok || ll < 0 ||
-                (!(c->flags & CLIENT_MASTER) && ll > server.proto_max_bulk_len)) {
-                addReplyError(c,"Protocol error: invalid bulk length");
-                setProtocolError("invalid bulk length",c);
-                return C_ERR;
-            } else if (ll > 16384 && authRequired(c)) {
-                addReplyError(c, "Protocol error: unauthenticated bulk length");
-                setProtocolError("unauth bulk length", c);
-                return C_ERR;
-            }
-
-            c->qb_pos = newline-c->querybuf+2;
-            if (ll >= PROTO_MBULK_BIG_ARG) {
-                /* If we are going to read a large object from network
-                 * try to make it likely that it will start at c->querybuf
-                 * boundary so that we can optimize object creation
-                 * avoiding a large copy of data.
-                 *
-                 * But only when the data we have not parsed is less than
-                 * or equal to ll+2. If the data length is greater than
-                 * ll+2, trimming querybuf is just a waste of time, because
-                 * at this time the querybuf contains not only our bulk. */
-                if (sdslen(c->querybuf)-c->qb_pos <= (size_t)ll+2) {
-                    sdsrange(c->querybuf,c->qb_pos,-1);
-                    c->qb_pos = 0;
-                    /* Hint the sds library about the amount of bytes this string is
-                     * going to contain. */
-                    c->querybuf = sdsMakeRoomFor(c->querybuf,ll+2-sdslen(c->querybuf));
-                }
-            }
-            c->bulklen = ll;
-        }
-
-        /* Read bulk argument */
-        if (sdslen(c->querybuf)-c->qb_pos < (size_t)(c->bulklen+2)) {
-            /* Not enough data (+2 == trailing \r\n) */
-            break;
-        } else {
-            /* Optimization: if the buffer contains JUST our bulk element
-             * instead of creating a new object by *copying* the sds we
-             * just use the current sds string. */
-            if (c->qb_pos == 0 &&
-                c->bulklen >= PROTO_MBULK_BIG_ARG &&
-                sdslen(c->querybuf) == (size_t)(c->bulklen+2))
-            {
-                c->argv[c->argc++] = createObject(OBJ_STRING,c->querybuf);
-                c->argv_len_sum += c->bulklen;
-                sdsIncrLen(c->querybuf,-2); /* remove CRLF */
-                /* Assume that if we saw a fat argument we'll see another one
-                 * likely... */
-                c->querybuf = sdsnewlen(SDS_NOINIT,c->bulklen+2);
-                sdsclear(c->querybuf);
-            } else {
-                c->argv[c->argc++] =
-                    createStringObject(c->querybuf+c->qb_pos,c->bulklen);
-                c->argv_len_sum += c->bulklen;
-                c->qb_pos += c->bulklen+2;
-            }
-            c->bulklen = -1;
-            c->multibulklen--;
-        }
-    }
-
-    /* We're done when c->multibulk == 0 */
-    if (c->multibulklen == 0) return C_OK;
-
-    /* Still not ready to process the command */
-    return C_ERR;
-}
-
-/* Perform necessary tasks after a command was executed:
- *
- * 1. The client is reset unless there are reasons to avoid doing it.
- * 2. In the case of master clients, the replication offset is updated.
- * 3. Propagate commands we got from our master to replicas down the line. */
-void commandProcessed(client *c) {
-    /* If client is blocked(including paused), just return avoid reset and replicate.
-     *
-     * 1. Don't reset the client structure for blocked clients, so that the reply
-     *    callback will still be able to access the client argv and argc fields.
-     *    The client will be reset in unblockClient().
-     * 2. Don't update replication offset or propagate commands to replicas,
-     *    since we have not applied the command. */
-    if (c->flags & CLIENT_BLOCKED) return;
-
-    resetClient(c);
-
-    long long prev_offset = c->reploff;
-    if (c->flags & CLIENT_MASTER && !(c->flags & CLIENT_MULTI)) {
-        /* Update the applied replication offset of our master. */
-        c->reploff = c->read_reploff - sdslen(c->querybuf) + c->qb_pos;
-    }
-
-    /* If the client is a master we need to compute the difference
-     * between the applied offset before and after processing the buffer,
-     * to understand how much of the replication stream was actually
-     * applied to the master state: this quantity, and its corresponding
-     * part of the replication stream, will be propagated to the
-     * sub-replicas and to the replication backlog. */
-    if (c->flags & CLIENT_MASTER) {
-        long long applied = c->reploff - prev_offset;
-        if (applied) {
-            replicationFeedSlavesFromMasterStream(server.slaves,
-                    c->pending_querybuf, applied);
-            sdsrange(c->pending_querybuf,applied,-1);
-        }
-    }
-}
-
-/* This function calls processCommand(), but also performs a few sub tasks
- * for the client that are useful in that context:
- *
- * 1. It sets the current client to the client 'c'.
- * 2. calls commandProcessed() if the command was handled.
- *
- * The function returns C_ERR in case the client was freed as a side effect
- * of processing the command, otherwise C_OK is returned. */
-int processCommandAndResetClient(client *c) {
-    int deadclient = 0;
-    client *old_client = server.current_client;
-    server.current_client = c;
-    if (processCommand(c) == C_OK) {
-        commandProcessed(c);
-    }
-    if (server.current_client == NULL) deadclient = 1;
-    /*
-     * Restore the old client, this is needed because when a script
-     * times out, we will get into this code from processEventsWhileBlocked.
-     * Which will cause to set the server.current_client. If not restored
-     * we will return 1 to our caller which will falsely indicate the client
-     * is dead and will stop reading from its buffer.
-     */
-    server.current_client = old_client;
-    /* performEvictions may flush slave output buffers. This may
-     * result in a slave, that may be the active client, to be
-     * freed. */
-    return deadclient ? C_ERR : C_OK;
-}
-
-
-/* This function will execute any fully parsed commands pending on
- * the client. Returns C_ERR if the client is no longer valid after executing
- * the command, and C_OK for all other cases. */
-int processPendingCommandsAndResetClient(client *c) {
-    if (c->flags & CLIENT_PENDING_COMMAND) {
-        c->flags &= ~CLIENT_PENDING_COMMAND;
-        if (processCommandAndResetClient(c) == C_ERR) {
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* This function is called every time, in the client structure 'c', there is
- * more query buffer to process, because we read more data from the socket
- * or because a client was blocked and later reactivated, so there could be
- * pending query buffer, already representing a full command, to process. */
-void processInputBuffer(client *c) {
-    /* Keep processing while there is something in the input buffer */
-    while(c->qb_pos < sdslen(c->querybuf)) {
-        /* Immediately abort if the client is in the middle of something. */
-        if (c->flags & CLIENT_BLOCKED) break;
-
-        /* Don't process more buffers from clients that have already pending
-         * commands to execute in c->argv. */
-        if (c->flags & CLIENT_PENDING_COMMAND) break;
-
-        /* Don't process input from the master while there is a busy script
-         * condition on the slave. We want just to accumulate the replication
-         * stream (instead of replying -BUSY like we do with other clients) and
-         * later resume the processing. */
-        if (server.lua_timedout && c->flags & CLIENT_MASTER) break;
-
-        /* CLIENT_CLOSE_AFTER_REPLY closes the connection once the reply is
-         * written to the client. Make sure to not let the reply grow after
-         * this flag has been set (i.e. don't process more commands).
-         *
-         * The same applies for clients we want to terminate ASAP. */
-        if (c->flags & (CLIENT_CLOSE_AFTER_REPLY|CLIENT_CLOSE_ASAP)) break;
-
-        /* Determine request type when unknown. */
-        if (!c->reqtype) {
-            if (c->querybuf[c->qb_pos] == '*') {
-                c->reqtype = PROTO_REQ_MULTIBULK;
-            } else {
-                c->reqtype = PROTO_REQ_INLINE;
-            }
-        }
-
-        if (c->reqtype == PROTO_REQ_INLINE) {
-            if (processInlineBuffer(c) != C_OK) break;
-            /* If the Gopher mode and we got zero or one argument, process
-             * the request in Gopher mode. To avoid data race, Redis won't
-             * support Gopher if enable io threads to read queries. */
-            if (server.gopher_enabled && !server.io_threads_do_reads &&
-                ((c->argc == 1 && ((char*)(c->argv[0]->ptr))[0] == '/') ||
-                  c->argc == 0))
-            {
-                processGopherRequest(c);
-                resetClient(c);
-                c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-                break;
-            }
-        } else if (c->reqtype == PROTO_REQ_MULTIBULK) {
-            if (processMultibulkBuffer(c) != C_OK) break;
-        } else {
-            serverPanic("Unknown request type");
-        }
-
-        /* Multibulk processing could see a <= 0 length. */
-        if (c->argc == 0) {
-            resetClient(c);
-        } else {
-            /* If we are in the context of an I/O thread, we can't really
-             * execute the command here. All we can do is to flag the client
-             * as one that needs to process the command. */
-            if (c->flags & CLIENT_PENDING_READ) {
-                c->flags |= CLIENT_PENDING_COMMAND;
-                break;
-            }
-
-            /* We are finally ready to execute the command. */
-            if (processCommandAndResetClient(c) == C_ERR) {
-                /* If the client is no longer valid, we avoid exiting this
-                 * loop and trimming the client buffer later. So we return
-                 * ASAP in that case. */
-                return;
-            }
-        }
-    }
-
-    /* Trim to pos */
-    if (c->qb_pos) {
-        sdsrange(c->querybuf,c->qb_pos,-1);
-        c->qb_pos = 0;
-    }
-}
-
-void readQueryFromClient(connection *conn) {
-    client *c = connGetPrivateData(conn);
-    int nread, readlen;
-    size_t qblen;
-
-    /* Check if we want to read from the client later when exiting from
-     * the event loop. This is the case if threaded I/O is enabled. */
-    if (postponeClientRead(c)) return;
-
-    /* Update total number of reads on server */
-    atomicIncr(server.stat_total_reads_processed, 1);
-
-    readlen = PROTO_IOBUF_LEN;
-    /* If this is a multi bulk request, and we are processing a bulk reply
-     * that is large enough, try to maximize the probability that the query
-     * buffer contains exactly the SDS string representing the object, even
-     * at the risk of requiring more read(2) calls. This way the function
-     * processMultiBulkBuffer() can avoid copying buffers to create the
-     * Redis Object representing the argument. */
-    if (c->reqtype == PROTO_REQ_MULTIBULK && c->multibulklen && c->bulklen != -1
-        && c->bulklen >= PROTO_MBULK_BIG_ARG)
-    {
-        ssize_t remaining = (size_t)(c->bulklen+2)-sdslen(c->querybuf);
-
-        /* Note that the 'remaining' variable may be zero in some edge case,
-         * for example once we resume a blocked client after CLIENT PAUSE. */
-        if (remaining > 0 && remaining < readlen) readlen = remaining;
-    }
-
-    qblen = sdslen(c->querybuf);
-    if (c->querybuf_peak < qblen) c->querybuf_peak = qblen;
-    c->querybuf = sdsMakeRoomFor(c->querybuf, readlen);
-    nread = connRead(c->conn, c->querybuf+qblen, readlen);
-    if (nread == -1) {
-        if (connGetState(conn) == CONN_STATE_CONNECTED) {
-            return;
-        } else {
-            serverLog(LL_VERBOSE, "Reading from client: %s",connGetLastError(c->conn));
-            freeClientAsync(c);
-            return;
-        }
-    } else if (nread == 0) {
-        serverLog(LL_VERBOSE, "Client closed connection");
-        freeClientAsync(c);
-        return;
-    } else if (c->flags & CLIENT_MASTER) {
-        /* Append the query buffer to the pending (not applied) buffer
-         * of the master. We'll use this buffer later in order to have a
-         * copy of the string applied by the last command executed. */
-        c->pending_querybuf = sdscatlen(c->pending_querybuf,
-                                        c->querybuf+qblen,nread);
-    }
-
-    sdsIncrLen(c->querybuf,nread);
-    c->lastinteraction = server.unixtime;
-    if (c->flags & CLIENT_MASTER) c->read_reploff += nread;
-    atomicIncr(server.stat_net_input_bytes, nread);
-    if (sdslen(c->querybuf) > server.client_max_querybuf_len) {
-        sds ci = catClientInfoString(sdsempty(),c), bytes = sdsempty();
-
-        bytes = sdscatrepr(bytes,c->querybuf,64);
-        serverLog(LL_WARNING,"Closing client that reached max query buffer length: %s (qbuf initial bytes: %s)", ci, bytes);
-        sdsfree(ci);
-        sdsfree(bytes);
-        freeClientAsync(c);
-        return;
-    }
-
-    /* There is more data in the client input buffer, continue parsing it
-     * in case to check if there is a full command to execute. */
-     processInputBuffer(c);
-}
-
-void getClientsMaxBuffers(unsigned long *longest_output_list,
-                          unsigned long *biggest_input_buffer) {
-    client *c;
-    listNode *ln;
-    listIter li;
-    unsigned long lol = 0, bib = 0;
-
-    listRewind(server.clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        c = listNodeValue(ln);
-
-        if (listLength(c->reply) > lol) lol = listLength(c->reply);
-        if (sdslen(c->querybuf) > bib) bib = sdslen(c->querybuf);
-    }
-    *longest_output_list = lol;
-    *biggest_input_buffer = bib;
-}
-
-/* A Redis "Address String" is a colon separated ip:port pair.
- * For IPv4 it's in the form x.y.z.k:port, example: "127.0.0.1:1234".
- * For IPv6 addresses we use [] around the IP part, like in "[::1]:1234".
- * For Unix sockets we use path:0, like in "/tmp/redis:0".
- *
- * An Address String always fits inside a buffer of NET_ADDR_STR_LEN bytes,
- * including the null term.
- *
- * On failure the function still populates 'addr' with the "?:0" string in case
- * you want to relax error checking or need to display something anyway (see
- * anetFdToString implementation for more info). */
-void genClientAddrString(client *client, char *addr,
-                         size_t addr_len, int fd_to_str_type) {
-    if (client->flags & CLIENT_UNIX_SOCKET) {
-        /* Unix socket client. */
-        snprintf(addr,addr_len,"%s:0",server.unixsocket);
-    } else {
-        /* TCP client. */
-        connFormatFdAddr(client->conn,addr,addr_len,fd_to_str_type);
-    }
-}
-
-/* This function returns the client peer id, by creating and caching it
- * if client->peerid is NULL, otherwise returning the cached value.
- * The Peer ID never changes during the life of the client, however it
- * is expensive to compute. */
-char *getClientPeerId(client *c) {
-    char peerid[NET_ADDR_STR_LEN];
-
-    if (c->peerid == NULL) {
-        genClientAddrString(c,peerid,sizeof(peerid),FD_TO_PEER_NAME);
-        c->peerid = sdsnew(peerid);
-    }
-    return c->peerid;
-}
-
-/* This function returns the client bound socket name, by creating and caching
- * it if client->sockname is NULL, otherwise returning the cached value.
- * The Socket Name never changes during the life of the client, however it
- * is expensive to compute. */
-char *getClientSockname(client *c) {
-    char sockname[NET_ADDR_STR_LEN];
-
-    if (c->sockname == NULL) {
-        genClientAddrString(c,sockname,sizeof(sockname),FD_TO_SOCK_NAME);
-        c->sockname = sdsnew(sockname);
-    }
-    return c->sockname;
-}
-
-/* Concatenate a string representing the state of a client in a human
- * readable format, into the sds string 's'. */
-sds catClientInfoString(sds s, client *client) {
-    char flags[16], events[3], conninfo[CONN_INFO_LEN], *p;
-
-    p = flags;
-    if (client->flags & CLIENT_SLAVE) {
-        if (client->flags & CLIENT_MONITOR)
-            *p++ = 'O';
-        else
-            *p++ = 'S';
-    }
-    if (client->flags & CLIENT_MASTER) *p++ = 'M';
-    if (client->flags & CLIENT_PUBSUB) *p++ = 'P';
-    if (client->flags & CLIENT_MULTI) *p++ = 'x';
-    if (client->flags & CLIENT_BLOCKED) *p++ = 'b';
-    if (client->flags & CLIENT_TRACKING) *p++ = 't';
-    if (client->flags & CLIENT_TRACKING_BROKEN_REDIR) *p++ = 'R';
-    if (client->flags & CLIENT_TRACKING_BCAST) *p++ = 'B';
-    if (client->flags & CLIENT_DIRTY_CAS) *p++ = 'd';
-    if (client->flags & CLIENT_CLOSE_AFTER_REPLY) *p++ = 'c';
-    if (client->flags & CLIENT_UNBLOCKED) *p++ = 'u';
-    if (client->flags & CLIENT_CLOSE_ASAP) *p++ = 'A';
-    if (client->flags & CLIENT_UNIX_SOCKET) *p++ = 'U';
-    if (client->flags & CLIENT_READONLY) *p++ = 'r';
-    if (p == flags) *p++ = 'N';
-    *p++ = '\0';
-
-    p = events;
-    if (client->conn) {
-        if (connHasReadHandler(client->conn)) *p++ = 'r';
-        if (connHasWriteHandler(client->conn)) *p++ = 'w';
-    }
-    *p = '\0';
-
-    /* Compute the total memory consumed by this client. */
-    size_t obufmem = getClientOutputBufferMemoryUsage(client);
-    size_t total_mem = obufmem;
-    total_mem += zmalloc_size(client); /* includes client->buf */
-    total_mem += sdsZmallocSize(client->querybuf);
-    /* For efficiency (less work keeping track of the argv memory), it doesn't include the used memory
-     * i.e. unused sds space and internal fragmentation, just the string length. but this is enough to
-     * spot problematic clients. */
-    total_mem += client->argv_len_sum;
-    if (client->argv)
-        total_mem += zmalloc_size(client->argv);
-
-    return sdscatfmt(s,
-        "id=%U addr=%s laddr=%s %s name=%s age=%I idle=%I flags=%s db=%i sub=%i psub=%i multi=%i qbuf=%U qbuf-free=%U argv-mem=%U obl=%U oll=%U omem=%U tot-mem=%U events=%s cmd=%s user=%s redir=%I",
-        (unsigned long long) client->id,
-        getClientPeerId(client),
-        getClientSockname(client),
-        connGetInfo(client->conn, conninfo, sizeof(conninfo)),
-        client->name ? (char*)client->name->ptr : "",
-        (long long)(server.unixtime - client->ctime),
-        (long long)(server.unixtime - client->lastinteraction),
-        flags,
-        client->db->id,
-        (int) dictSize(client->pubsub_channels),
-        (int) listLength(client->pubsub_patterns),
-        (client->flags & CLIENT_MULTI) ? client->mstate.count : -1,
-        (unsigned long long) sdslen(client->querybuf),
-        (unsigned long long) sdsavail(client->querybuf),
-        (unsigned long long) client->argv_len_sum,
-        (unsigned long long) client->bufpos,
-        (unsigned long long) listLength(client->reply),
-        (unsigned long long) obufmem, /* should not include client->buf since we want to see 0 for static clients. */
-        (unsigned long long) total_mem,
-        events,
-        client->lastcmd ? client->lastcmd->name : "NULL",
-        client->user ? client->user->name : "(superuser)",
-        (client->flags & CLIENT_TRACKING) ? (long long) client->client_tracking_redirection : -1);
-}
-
-sds getAllClientsInfoString(int type) {
-    listNode *ln;
-    listIter li;
-    client *client;
-    sds o = sdsnewlen(SDS_NOINIT,200*listLength(server.clients));
-    sdsclear(o);
-    listRewind(server.clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        client = listNodeValue(ln);
-        if (type != -1 && getClientType(client) != type) continue;
-        o = catClientInfoString(o,client);
-        o = sdscatlen(o,"\n",1);
-    }
-    return o;
-}
-
-/* This function implements CLIENT SETNAME, including replying to the
- * user with an error if the charset is wrong (in that case C_ERR is
- * returned). If the function succeeeded C_OK is returned, and it's up
- * to the caller to send a reply if needed.
- *
- * Setting an empty string as name has the effect of unsetting the
- * currently set name: the client will remain unnamed.
- *
- * This function is also used to implement the HELLO SETNAME option. */
-int clientSetNameOrReply(client *c, robj *name) {
-    int len = sdslen(name->ptr);
-    char *p = name->ptr;
-
-    /* Setting the client name to an empty string actually removes
-     * the current name. */
-    if (len == 0) {
-        if (c->name) decrRefCount(c->name);
-        c->name = NULL;
-        return C_OK;
-    }
-
-    /* Otherwise check if the charset is ok. We need to do this otherwise
-     * CLIENT LIST format will break. You should always be able to
-     * split by space to get the different fields. */
-    for (int j = 0; j < len; j++) {
-        if (p[j] < '!' || p[j] > '~') { /* ASCII is assumed. */
-            addReplyError(c,
-                "Client names cannot contain spaces, "
-                "newlines or special characters.");
-            return C_ERR;
-        }
-    }
-    if (c->name) decrRefCount(c->name);
-    c->name = name;
-    incrRefCount(name);
-    return C_OK;
-}
-
-/* Reset the client state to resemble a newly connected client.
- */
-void resetCommand(client *c) {
-    listNode *ln;
-
-    /* MONITOR clients are also marked with CLIENT_SLAVE, we need to
-     * distinguish between the two.
-     */
-    if (c->flags & CLIENT_MONITOR) {
-        ln = listSearchKey(server.monitors,c);
-        serverAssert(ln != NULL);
-        listDelNode(server.monitors,ln);
-
-        c->flags &= ~(CLIENT_MONITOR|CLIENT_SLAVE);
-    }
-
-    if (c->flags & (CLIENT_SLAVE|CLIENT_MASTER|CLIENT_MODULE)) {
-        addReplyError(c,"can only reset normal client connections");
-        return;
-    }
-
-    if (c->flags & CLIENT_TRACKING) disableTracking(c);
-    selectDb(c,0);
-    c->resp = 2;
-
-    clientSetDefaultAuth(c);
-    moduleNotifyUserChanged(c);
-    discardTransaction(c);
-
-    pubsubUnsubscribeAllChannels(c,0);
-    pubsubUnsubscribeAllPatterns(c,0);
-
-    if (c->name) {
-        decrRefCount(c->name);
-        c->name = NULL;
-    }
-
-    /* Selectively clear state flags not covered above */
-    c->flags &= ~(CLIENT_ASKING|CLIENT_READONLY|CLIENT_PUBSUB|
-            CLIENT_REPLY_OFF|CLIENT_REPLY_SKIP_NEXT);
-
-    addReplyStatus(c,"RESET");
-}
-
-void clientCommand(client *c) {
-    listNode *ln;
-    listIter li;
-
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"CACHING (YES|NO)",
-"    Enable/disable tracking of the keys for next command in OPTIN/OPTOUT modes.",
-"GETREDIR",
-"    Return the client ID we are redirecting to when tracking is enabled.",
-"GETNAME",
-"    Return the name of the current connection.",
-"ID",
-"    Return the ID of the current connection.",
-"INFO",
-"    Return information about the current client connection.",
-"KILL <ip:port>",
-"    Kill connection made from <ip:port>.",
-"KILL <option> <value> [<option> <value> [...]]",
-"    Kill connections. Options are:",
-"    * ADDR (<ip:port>|<unixsocket>:0)",
-"      Kill connections made from the specified address",
-"    * LADDR (<ip:port>|<unixsocket>:0)",
-"      Kill connections made to specified local address",
-"    * TYPE (normal|master|replica|pubsub)",
-"      Kill connections by type.",
-"    * USER <username>",
-"      Kill connections authenticated by <username>.",
-"    * SKIPME (YES|NO)",
-"      Skip killing current connection (default: yes).",
-"LIST [options ...]",
-"    Return information about client connections. Options:",
-"    * TYPE (NORMAL|MASTER|REPLICA|PUBSUB)",
-"      Return clients of specified type.",
-"UNPAUSE",
-"    Stop the current client pause, resuming traffic.",
-"PAUSE <timeout> [WRITE|ALL]",
-"    Suspend all, or just write, clients for <timout> milliseconds.",
-"REPLY (ON|OFF|SKIP)",
-"    Control the replies sent to the current connection.",
-"SETNAME <name>",
-"    Assign the name <name> to the current connection.",
-"UNBLOCK <clientid> [TIMEOUT|ERROR]",
-"    Unblock the specified blocked client.",
-"TRACKING (ON|OFF) [REDIRECT <id>] [BCAST] [PREFIX <prefix> [...]]",
-"         [OPTIN] [OPTOUT]",
-"    Control server assisted client side caching.",
-"TRACKINGINFO",
-"    Report tracking status for the current connection.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"id") && c->argc == 2) {
-        /* CLIENT ID */
-        addReplyLongLong(c,c->id);
-    } else if (!strcasecmp(c->argv[1]->ptr,"info") && c->argc == 2) {
-        /* CLIENT INFO */
-        sds o = catClientInfoString(sdsempty(), c);
-        o = sdscatlen(o,"\n",1);
-        addReplyVerbatim(c,o,sdslen(o),"txt");
-        sdsfree(o);
-    } else if (!strcasecmp(c->argv[1]->ptr,"list")) {
-        /* CLIENT LIST */
-        int type = -1;
-        sds o = NULL;
-        if (c->argc == 4 && !strcasecmp(c->argv[2]->ptr,"type")) {
-            type = getClientTypeByName(c->argv[3]->ptr);
-            if (type == -1) {
-                addReplyErrorFormat(c,"Unknown client type '%s'",
-                    (char*) c->argv[3]->ptr);
-                return;
-            }
-        } else if (c->argc > 3 && !strcasecmp(c->argv[2]->ptr,"id")) {
-            int j;
-            o = sdsempty();
-            for (j = 3; j < c->argc; j++) {
-                long long cid;
-                if (getLongLongFromObjectOrReply(c, c->argv[j], &cid,
-                            "Invalid client ID")) {
-                    sdsfree(o);
-                    return;
-                }
-                client *cl = lookupClientByID(cid);
-                if (cl) {
-                    o = catClientInfoString(o, cl);
-                    o = sdscatlen(o, "\n", 1);
-                }
-            }
-        } else if (c->argc != 2) {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-
-        if (!o)
-            o = getAllClientsInfoString(type);
-        addReplyVerbatim(c,o,sdslen(o),"txt");
-        sdsfree(o);
-    } else if (!strcasecmp(c->argv[1]->ptr,"reply") && c->argc == 3) {
-        /* CLIENT REPLY ON|OFF|SKIP */
-        if (!strcasecmp(c->argv[2]->ptr,"on")) {
-            c->flags &= ~(CLIENT_REPLY_SKIP|CLIENT_REPLY_OFF);
-            addReply(c,shared.ok);
-        } else if (!strcasecmp(c->argv[2]->ptr,"off")) {
-            c->flags |= CLIENT_REPLY_OFF;
-        } else if (!strcasecmp(c->argv[2]->ptr,"skip")) {
-            if (!(c->flags & CLIENT_REPLY_OFF))
-                c->flags |= CLIENT_REPLY_SKIP_NEXT;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"kill")) {
-        /* CLIENT KILL <ip:port>
-         * CLIENT KILL <option> [value] ... <option> [value] */
-        char *addr = NULL;
-        char *laddr = NULL;
-        user *user = NULL;
-        int type = -1;
-        uint64_t id = 0;
-        int skipme = 1;
-        int killed = 0, close_this_client = 0;
-
-        if (c->argc == 3) {
-            /* Old style syntax: CLIENT KILL <addr> */
-            addr = c->argv[2]->ptr;
-            skipme = 0; /* With the old form, you can kill yourself. */
-        } else if (c->argc > 3) {
-            int i = 2; /* Next option index. */
-
-            /* New style syntax: parse options. */
-            while(i < c->argc) {
-                int moreargs = c->argc > i+1;
-
-                if (!strcasecmp(c->argv[i]->ptr,"id") && moreargs) {
-                    long long tmp;
-
-                    if (getLongLongFromObjectOrReply(c,c->argv[i+1],&tmp,NULL)
-                        != C_OK) return;
-                    id = tmp;
-                } else if (!strcasecmp(c->argv[i]->ptr,"type") && moreargs) {
-                    type = getClientTypeByName(c->argv[i+1]->ptr);
-                    if (type == -1) {
-                        addReplyErrorFormat(c,"Unknown client type '%s'",
-                            (char*) c->argv[i+1]->ptr);
-                        return;
-                    }
-                } else if (!strcasecmp(c->argv[i]->ptr,"addr") && moreargs) {
-                    addr = c->argv[i+1]->ptr;
-                } else if (!strcasecmp(c->argv[i]->ptr,"laddr") && moreargs) {
-                    laddr = c->argv[i+1]->ptr;
-                } else if (!strcasecmp(c->argv[i]->ptr,"user") && moreargs) {
-                    user = ACLGetUserByName(c->argv[i+1]->ptr,
-                                            sdslen(c->argv[i+1]->ptr));
-                    if (user == NULL) {
-                        addReplyErrorFormat(c,"No such user '%s'",
-                            (char*) c->argv[i+1]->ptr);
-                        return;
-                    }
-                } else if (!strcasecmp(c->argv[i]->ptr,"skipme") && moreargs) {
-                    if (!strcasecmp(c->argv[i+1]->ptr,"yes")) {
-                        skipme = 1;
-                    } else if (!strcasecmp(c->argv[i+1]->ptr,"no")) {
-                        skipme = 0;
-                    } else {
-                        addReplyErrorObject(c,shared.syntaxerr);
-                        return;
-                    }
-                } else {
-                    addReplyErrorObject(c,shared.syntaxerr);
-                    return;
-                }
-                i += 2;
-            }
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-
-        /* Iterate clients killing all the matching clients. */
-        listRewind(server.clients,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            client *client = listNodeValue(ln);
-            if (addr && strcmp(getClientPeerId(client),addr) != 0) continue;
-            if (laddr && strcmp(getClientSockname(client),laddr) != 0) continue;
-            if (type != -1 && getClientType(client) != type) continue;
-            if (id != 0 && client->id != id) continue;
-            if (user && client->user != user) continue;
-            if (c == client && skipme) continue;
-
-            /* Kill it. */
-            if (c == client) {
-                close_this_client = 1;
-            } else {
-                freeClient(client);
-            }
-            killed++;
-        }
-
-        /* Reply according to old/new format. */
-        if (c->argc == 3) {
-            if (killed == 0)
-                addReplyError(c,"No such client");
-            else
-                addReply(c,shared.ok);
-        } else {
-            addReplyLongLong(c,killed);
-        }
-
-        /* If this client has to be closed, flag it as CLOSE_AFTER_REPLY
-         * only after we queued the reply to its output buffers. */
-        if (close_this_client) c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-    } else if (!strcasecmp(c->argv[1]->ptr,"unblock") && (c->argc == 3 ||
-                                                          c->argc == 4))
-    {
-        /* CLIENT UNBLOCK <id> [timeout|error] */
-        long long id;
-        int unblock_error = 0;
-
-        if (c->argc == 4) {
-            if (!strcasecmp(c->argv[3]->ptr,"timeout")) {
-                unblock_error = 0;
-            } else if (!strcasecmp(c->argv[3]->ptr,"error")) {
-                unblock_error = 1;
-            } else {
-                addReplyError(c,
-                    "CLIENT UNBLOCK reason should be TIMEOUT or ERROR");
-                return;
-            }
-        }
-        if (getLongLongFromObjectOrReply(c,c->argv[2],&id,NULL)
-            != C_OK) return;
-        struct client *target = lookupClientByID(id);
-        if (target && target->flags & CLIENT_BLOCKED && moduleBlockedClientMayTimeout(target)) {
-            if (unblock_error)
-                addReplyError(target,
-                    "-UNBLOCKED client unblocked via CLIENT UNBLOCK");
-            else
-                replyToBlockedClientTimedOut(target);
-            unblockClient(target);
-            addReply(c,shared.cone);
-        } else {
-            addReply(c,shared.czero);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"setname") && c->argc == 3) {
-        /* CLIENT SETNAME */
-        if (clientSetNameOrReply(c,c->argv[2]) == C_OK)
-            addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"getname") && c->argc == 2) {
-        /* CLIENT GETNAME */
-        if (c->name)
-            addReplyBulk(c,c->name);
-        else
-            addReplyNull(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"unpause") && c->argc == 2) {
-        /* CLIENT UNPAUSE */
-        unpauseClients();
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"pause") && (c->argc == 3 ||
-                                                        c->argc == 4))
-    {
-        /* CLIENT PAUSE TIMEOUT [WRITE|ALL] */
-        mstime_t end;
-        int type = CLIENT_PAUSE_ALL;
-        if (c->argc == 4) {
-            if (!strcasecmp(c->argv[3]->ptr,"write")) {
-                type = CLIENT_PAUSE_WRITE;
-            } else if (!strcasecmp(c->argv[3]->ptr,"all")) {
-                type = CLIENT_PAUSE_ALL;
-            } else {
-                addReplyError(c,
-                    "CLIENT PAUSE mode must be WRITE or ALL");  
-                return;       
-            }
-        }
-
-        if (getTimeoutFromObjectOrReply(c,c->argv[2],&end,
-            UNIT_MILLISECONDS) != C_OK) return;
-        pauseClients(end, type);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"tracking") && c->argc >= 3) {
-        /* CLIENT TRACKING (on|off) [REDIRECT <id>] [BCAST] [PREFIX first]
-         *                          [PREFIX second] [OPTIN] [OPTOUT] ... */
-        long long redir = 0;
-        uint64_t options = 0;
-        robj **prefix = NULL;
-        size_t numprefix = 0;
-
-        /* Parse the options. */
-        for (int j = 3; j < c->argc; j++) {
-            int moreargs = (c->argc-1) - j;
-
-            if (!strcasecmp(c->argv[j]->ptr,"redirect") && moreargs) {
-                j++;
-                if (redir != 0) {
-                    addReplyError(c,"A client can only redirect to a single "
-                                    "other client");
-                    zfree(prefix);
-                    return;
-                }
-
-                if (getLongLongFromObjectOrReply(c,c->argv[j],&redir,NULL) !=
-                    C_OK)
-                {
-                    zfree(prefix);
-                    return;
-                }
-                /* We will require the client with the specified ID to exist
-                 * right now, even if it is possible that it gets disconnected
-                 * later. Still a valid sanity check. */
-                if (lookupClientByID(redir) == NULL) {
-                    addReplyError(c,"The client ID you want redirect to "
-                                    "does not exist");
-                    zfree(prefix);
-                    return;
-                }
-            } else if (!strcasecmp(c->argv[j]->ptr,"bcast")) {
-                options |= CLIENT_TRACKING_BCAST;
-            } else if (!strcasecmp(c->argv[j]->ptr,"optin")) {
-                options |= CLIENT_TRACKING_OPTIN;
-            } else if (!strcasecmp(c->argv[j]->ptr,"optout")) {
-                options |= CLIENT_TRACKING_OPTOUT;
-            } else if (!strcasecmp(c->argv[j]->ptr,"noloop")) {
-                options |= CLIENT_TRACKING_NOLOOP;
-            } else if (!strcasecmp(c->argv[j]->ptr,"prefix") && moreargs) {
-                j++;
-                prefix = zrealloc(prefix,sizeof(robj*)*(numprefix+1));
-                prefix[numprefix++] = c->argv[j];
-            } else {
-                zfree(prefix);
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-
-        /* Options are ok: enable or disable the tracking for this client. */
-        if (!strcasecmp(c->argv[2]->ptr,"on")) {
-            /* Before enabling tracking, make sure options are compatible
-             * among each other and with the current state of the client. */
-            if (!(options & CLIENT_TRACKING_BCAST) && numprefix) {
-                addReplyError(c,
-                    "PREFIX option requires BCAST mode to be enabled");
-                zfree(prefix);
-                return;
-            }
-
-            if (c->flags & CLIENT_TRACKING) {
-                int oldbcast = !!(c->flags & CLIENT_TRACKING_BCAST);
-                int newbcast = !!(options & CLIENT_TRACKING_BCAST);
-                if (oldbcast != newbcast) {
-                    addReplyError(c,
-                    "You can't switch BCAST mode on/off before disabling "
-                    "tracking for this client, and then re-enabling it with "
-                    "a different mode.");
-                    zfree(prefix);
-                    return;
-                }
-            }
-
-            if (options & CLIENT_TRACKING_BCAST &&
-                options & (CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT))
-            {
-                addReplyError(c,
-                "OPTIN and OPTOUT are not compatible with BCAST");
-                zfree(prefix);
-                return;
-            }
-
-            if (options & CLIENT_TRACKING_OPTIN && options & CLIENT_TRACKING_OPTOUT)
-            {
-                addReplyError(c,
-                "You can't specify both OPTIN mode and OPTOUT mode");
-                zfree(prefix);
-                return;
-            }
-
-            if ((options & CLIENT_TRACKING_OPTIN && c->flags & CLIENT_TRACKING_OPTOUT) ||
-                (options & CLIENT_TRACKING_OPTOUT && c->flags & CLIENT_TRACKING_OPTIN))
-            {
-                addReplyError(c,
-                "You can't switch OPTIN/OPTOUT mode before disabling "
-                "tracking for this client, and then re-enabling it with "
-                "a different mode.");
-                zfree(prefix);
-                return;
-            }
-
-            if (options & CLIENT_TRACKING_BCAST) {
-                if (!checkPrefixCollisionsOrReply(c,prefix,numprefix)) {
-                    zfree(prefix);
-                    return;
-                }
-            }
-
-            enableTracking(c,redir,options,prefix,numprefix);
-        } else if (!strcasecmp(c->argv[2]->ptr,"off")) {
-            disableTracking(c);
-        } else {
-            zfree(prefix);
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-        zfree(prefix);
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"caching") && c->argc >= 3) {
-        if (!(c->flags & CLIENT_TRACKING)) {
-            addReplyError(c,"CLIENT CACHING can be called only when the "
-                            "client is in tracking mode with OPTIN or "
-                            "OPTOUT mode enabled");
-            return;
-        }
-
-        char *opt = c->argv[2]->ptr;
-        if (!strcasecmp(opt,"yes")) {
-            if (c->flags & CLIENT_TRACKING_OPTIN) {
-                c->flags |= CLIENT_TRACKING_CACHING;
-            } else {
-                addReplyError(c,"CLIENT CACHING YES is only valid when tracking is enabled in OPTIN mode.");
-                return;
-            }
-        } else if (!strcasecmp(opt,"no")) {
-            if (c->flags & CLIENT_TRACKING_OPTOUT) {
-                c->flags |= CLIENT_TRACKING_CACHING;
-            } else {
-                addReplyError(c,"CLIENT CACHING NO is only valid when tracking is enabled in OPTOUT mode.");
-                return;
-            }
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-
-        /* Common reply for when we succeeded. */
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"getredir") && c->argc == 2) {
-        /* CLIENT GETREDIR */
-        if (c->flags & CLIENT_TRACKING) {
-            addReplyLongLong(c,c->client_tracking_redirection);
-        } else {
-            addReplyLongLong(c,-1);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"trackinginfo") && c->argc == 2) {
-        addReplyMapLen(c,3);
-
-        /* Flags */
-        addReplyBulkCString(c,"flags");
-        void *arraylen_ptr = addReplyDeferredLen(c);
-        int numflags = 0;
-        addReplyBulkCString(c,c->flags & CLIENT_TRACKING ? "on" : "off");
-        numflags++;
-        if (c->flags & CLIENT_TRACKING_BCAST) {
-            addReplyBulkCString(c,"bcast");
-            numflags++;
-        }
-        if (c->flags & CLIENT_TRACKING_OPTIN) {
-            addReplyBulkCString(c,"optin");
-            numflags++;
-            if (c->flags & CLIENT_TRACKING_CACHING) {
-                addReplyBulkCString(c,"caching-yes");
-                numflags++;        
-            }
-        }
-        if (c->flags & CLIENT_TRACKING_OPTOUT) {
-            addReplyBulkCString(c,"optout");
-            numflags++;
-            if (c->flags & CLIENT_TRACKING_CACHING) {
-                addReplyBulkCString(c,"caching-no");
-                numflags++;        
-            }
-        }
-        if (c->flags & CLIENT_TRACKING_NOLOOP) {
-            addReplyBulkCString(c,"noloop");
-            numflags++;
-        }
-        if (c->flags & CLIENT_TRACKING_BROKEN_REDIR) {
-            addReplyBulkCString(c,"broken_redirect");
-            numflags++;
-        }
-        setDeferredSetLen(c,arraylen_ptr,numflags);
-
-        /* Redirect */
-        addReplyBulkCString(c,"redirect");
-        if (c->flags & CLIENT_TRACKING) {
-            addReplyLongLong(c,c->client_tracking_redirection);
-        } else {
-            addReplyLongLong(c,-1);
-        }
-
-        /* Prefixes */
-        addReplyBulkCString(c,"prefixes");
-        if (c->client_tracking_prefixes) {
-            addReplyArrayLen(c,raxSize(c->client_tracking_prefixes));
-            raxIterator ri;
-            raxStart(&ri,c->client_tracking_prefixes);
-            raxSeek(&ri,"^",NULL,0);
-            while(raxNext(&ri)) {
-                addReplyBulkCBuffer(c,ri.key,ri.key_len);
-            }
-            raxStop(&ri);
-        } else {
-            addReplyArrayLen(c,0);
-        }
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* HELLO [<protocol-version> [AUTH <user> <password>] [SETNAME <name>] ] */
-void helloCommand(client *c) {
-    long long ver = 0;
-    int next_arg = 1;
-
-    if (c->argc >= 2) {
-        if (getLongLongFromObjectOrReply(c, c->argv[next_arg++], &ver,
-            "Protocol version is not an integer or out of range") != C_OK) {
-            return;
-        }
-
-        if (ver < 2 || ver > 3) {
-            addReplyError(c,"-NOPROTO unsupported protocol version");
-            return;
-        }
-    }
-
-    for (int j = next_arg; j < c->argc; j++) {
-        int moreargs = (c->argc-1) - j;
-        const char *opt = c->argv[j]->ptr;
-        if (!strcasecmp(opt,"AUTH") && moreargs >= 2) {
-            redactClientCommandArgument(c, j+1);
-            redactClientCommandArgument(c, j+2);
-            if (ACLAuthenticateUser(c, c->argv[j+1], c->argv[j+2]) == C_ERR) {
-                addReplyError(c,"-WRONGPASS invalid username-password pair or user is disabled.");
-                return;
-            }
-            j += 2;
-        } else if (!strcasecmp(opt,"SETNAME") && moreargs) {
-            if (clientSetNameOrReply(c, c->argv[j+1]) == C_ERR) return;
-            j++;
-        } else {
-            addReplyErrorFormat(c,"Syntax error in HELLO option '%s'",opt);
-            return;
-        }
-    }
-
-    /* At this point we need to be authenticated to continue. */
-    if (!c->authenticated) {
-        addReplyError(c,"-NOAUTH HELLO must be called with the client already "
-                        "authenticated, otherwise the HELLO AUTH <user> <pass> "
-                        "option can be used to authenticate the client and "
-                        "select the RESP protocol version at the same time");
-        return;
-    }
-
-    /* Let's switch to the specified RESP mode. */
-    if (ver) c->resp = ver;
-    addReplyMapLen(c,6 + !server.sentinel_mode);
-
-    addReplyBulkCString(c,"server");
-    addReplyBulkCString(c,"redis");
-
-    addReplyBulkCString(c,"version");
-    addReplyBulkCString(c,REDIS_VERSION);
-
-    addReplyBulkCString(c,"proto");
-    addReplyLongLong(c,c->resp);
-
-    addReplyBulkCString(c,"id");
-    addReplyLongLong(c,c->id);
-
-    addReplyBulkCString(c,"mode");
-    if (server.sentinel_mode) addReplyBulkCString(c,"sentinel");
-    else if (server.cluster_enabled) addReplyBulkCString(c,"cluster");
-    else addReplyBulkCString(c,"standalone");
-
-    if (!server.sentinel_mode) {
-        addReplyBulkCString(c,"role");
-        addReplyBulkCString(c,server.masterhost ? "replica" : "master");
-    }
-
-    addReplyBulkCString(c,"modules");
-    addReplyLoadedModules(c);
-}
-
-/* This callback is bound to POST and "Host:" command names. Those are not
- * really commands, but are used in security attacks in order to talk to
- * Redis instances via HTTP, with a technique called "cross protocol scripting"
- * which exploits the fact that services like Redis will discard invalid
- * HTTP headers and will process what follows.
- *
- * As a protection against this attack, Redis will terminate the connection
- * when a POST or "Host:" header is seen, and will log the event from
- * time to time (to avoid creating a DOS as a result of too many logs). */
-void securityWarningCommand(client *c) {
-    static time_t logged_time;
-    time_t now = time(NULL);
-
-    if (llabs(now-logged_time) > 60) {
-        serverLog(LL_WARNING,"Possible SECURITY ATTACK detected. It looks like somebody is sending POST or Host: commands to Redis. This is likely due to an attacker attempting to use Cross Protocol Scripting to compromise your Redis instance. Connection aborted.");
-        logged_time = now;
-    }
-    freeClientAsync(c);
-}
-
-/* Keep track of the original command arguments so that we can generate
- * an accurate slowlog entry after the command has been executed. */
-static void retainOriginalCommandVector(client *c) {
-    /* We already rewrote this command, so don't rewrite it again */
-    if (c->original_argv) return;
-    c->original_argc = c->argc;
-    c->original_argv = zmalloc(sizeof(robj*)*(c->argc));
-    for (int j = 0; j < c->argc; j++) {
-        c->original_argv[j] = c->argv[j];
-        incrRefCount(c->argv[j]);
-    }
-}
-
-/* Redact a given argument to prevent it from being shown
- * in the slowlog. This information is stored in the
- * original_argv array. */
-void redactClientCommandArgument(client *c, int argc) {
-    retainOriginalCommandVector(c);
-    decrRefCount(c->argv[argc]);
-    c->original_argv[argc] = shared.redacted;
-}
-
-/* Rewrite the command vector of the client. All the new objects ref count
- * is incremented. The old command vector is freed, and the old objects
- * ref count is decremented. */
-void rewriteClientCommandVector(client *c, int argc, ...) {
-    va_list ap;
-    int j;
-    robj **argv; /* The new argument vector */
-
-    argv = zmalloc(sizeof(robj*)*argc);
-    va_start(ap,argc);
-    for (j = 0; j < argc; j++) {
-        robj *a;
-
-        a = va_arg(ap, robj*);
-        argv[j] = a;
-        incrRefCount(a);
-    }
-    replaceClientCommandVector(c, argc, argv);
-    va_end(ap);
-}
-
-/* Completely replace the client command vector with the provided one. */
-void replaceClientCommandVector(client *c, int argc, robj **argv) {
-    int j;
-    retainOriginalCommandVector(c);
-    freeClientArgv(c);
-    zfree(c->argv);
-    c->argv = argv;
-    c->argc = argc;
-    c->argv_len_sum = 0;
-    for (j = 0; j < c->argc; j++)
-        if (c->argv[j])
-            c->argv_len_sum += getStringObjectLen(c->argv[j]);
-    c->cmd = lookupCommandOrOriginal(c->argv[0]->ptr);
-    serverAssertWithInfo(c,NULL,c->cmd != NULL);
-}
-
-/* Rewrite a single item in the command vector.
- * The new val ref count is incremented, and the old decremented.
- *
- * It is possible to specify an argument over the current size of the
- * argument vector: in this case the array of objects gets reallocated
- * and c->argc set to the max value. However it's up to the caller to
- *
- * 1. Make sure there are no "holes" and all the arguments are set.
- * 2. If the original argument vector was longer than the one we
- *    want to end with, it's up to the caller to set c->argc and
- *    free the no longer used objects on c->argv. */
-void rewriteClientCommandArgument(client *c, int i, robj *newval) {
-    robj *oldval;
-    retainOriginalCommandVector(c);
-    if (i >= c->argc) {
-        c->argv = zrealloc(c->argv,sizeof(robj*)*(i+1));
-        c->argc = i+1;
-        c->argv[i] = NULL;
-    }
-    oldval = c->argv[i];
-    if (oldval) c->argv_len_sum -= getStringObjectLen(oldval);
-    if (newval) c->argv_len_sum += getStringObjectLen(newval);
-    c->argv[i] = newval;
-    incrRefCount(newval);
-    if (oldval) decrRefCount(oldval);
-
-    /* If this is the command name make sure to fix c->cmd. */
-    if (i == 0) {
-        c->cmd = lookupCommandOrOriginal(c->argv[0]->ptr);
-        serverAssertWithInfo(c,NULL,c->cmd != NULL);
-    }
-}
-
-/* This function returns the number of bytes that Redis is
- * using to store the reply still not read by the client.
- *
- * Note: this function is very fast so can be called as many time as
- * the caller wishes. The main usage of this function currently is
- * enforcing the client output length limits. */
-unsigned long getClientOutputBufferMemoryUsage(client *c) {
-    unsigned long list_item_size = sizeof(listNode) + sizeof(clientReplyBlock);
-    return c->reply_bytes + (list_item_size*listLength(c->reply));
-}
-
-/* Get the class of a client, used in order to enforce limits to different
- * classes of clients.
- *
- * The function will return one of the following:
- * CLIENT_TYPE_NORMAL -> Normal client
- * CLIENT_TYPE_SLAVE  -> Slave
- * CLIENT_TYPE_PUBSUB -> Client subscribed to Pub/Sub channels
- * CLIENT_TYPE_MASTER -> The client representing our replication master.
- */
-int getClientType(client *c) {
-    if (c->flags & CLIENT_MASTER) return CLIENT_TYPE_MASTER;
-    /* Even though MONITOR clients are marked as replicas, we
-     * want the expose them as normal clients. */
-    if ((c->flags & CLIENT_SLAVE) && !(c->flags & CLIENT_MONITOR))
-        return CLIENT_TYPE_SLAVE;
-    if (c->flags & CLIENT_PUBSUB) return CLIENT_TYPE_PUBSUB;
-    return CLIENT_TYPE_NORMAL;
-}
-
-int getClientTypeByName(char *name) {
-    if (!strcasecmp(name,"normal")) return CLIENT_TYPE_NORMAL;
-    else if (!strcasecmp(name,"slave")) return CLIENT_TYPE_SLAVE;
-    else if (!strcasecmp(name,"replica")) return CLIENT_TYPE_SLAVE;
-    else if (!strcasecmp(name,"pubsub")) return CLIENT_TYPE_PUBSUB;
-    else if (!strcasecmp(name,"master")) return CLIENT_TYPE_MASTER;
-    else return -1;
-}
-
-char *getClientTypeName(int class) {
-    switch(class) {
-    case CLIENT_TYPE_NORMAL: return "normal";
-    case CLIENT_TYPE_SLAVE:  return "slave";
-    case CLIENT_TYPE_PUBSUB: return "pubsub";
-    case CLIENT_TYPE_MASTER: return "master";
-    default:                       return NULL;
-    }
-}
-
-/* The function checks if the client reached output buffer soft or hard
- * limit, and also update the state needed to check the soft limit as
- * a side effect.
- *
- * Return value: non-zero if the client reached the soft or the hard limit.
- *               Otherwise zero is returned. */
-int checkClientOutputBufferLimits(client *c) {
-    int soft = 0, hard = 0, class;
-    unsigned long used_mem = getClientOutputBufferMemoryUsage(c);
-
-    class = getClientType(c);
-    /* For the purpose of output buffer limiting, masters are handled
-     * like normal clients. */
-    if (class == CLIENT_TYPE_MASTER) class = CLIENT_TYPE_NORMAL;
-
-    if (server.client_obuf_limits[class].hard_limit_bytes &&
-        used_mem >= server.client_obuf_limits[class].hard_limit_bytes)
-        hard = 1;
-    if (server.client_obuf_limits[class].soft_limit_bytes &&
-        used_mem >= server.client_obuf_limits[class].soft_limit_bytes)
-        soft = 1;
-
-    /* We need to check if the soft limit is reached continuously for the
-     * specified amount of seconds. */
-    if (soft) {
-        if (c->obuf_soft_limit_reached_time == 0) {
-            c->obuf_soft_limit_reached_time = server.unixtime;
-            soft = 0; /* First time we see the soft limit reached */
-        } else {
-            time_t elapsed = server.unixtime - c->obuf_soft_limit_reached_time;
-
-            if (elapsed <=
-                server.client_obuf_limits[class].soft_limit_seconds) {
-                soft = 0; /* The client still did not reached the max number of
-                             seconds for the soft limit to be considered
-                             reached. */
-            }
-        }
-    } else {
-        c->obuf_soft_limit_reached_time = 0;
-    }
-    return soft || hard;
-}
-
-/* Asynchronously close a client if soft or hard limit is reached on the
- * output buffer size. The caller can check if the client will be closed
- * checking if the client CLIENT_CLOSE_ASAP flag is set.
- *
- * Note: we need to close the client asynchronously because this function is
- * called from contexts where the client can't be freed safely, i.e. from the
- * lower level functions pushing data inside the client output buffers.
- * When `async` is set to 0, we close the client immediately, this is
- * useful when called from cron.
- *
- * Returns 1 if client was (flagged) closed. */
-int closeClientOnOutputBufferLimitReached(client *c, int async) {
-    if (!c->conn) return 0; /* It is unsafe to free fake clients. */
-    serverAssert(c->reply_bytes < SIZE_MAX-(1024*64));
-    if (c->reply_bytes == 0 || c->flags & CLIENT_CLOSE_ASAP) return 0;
-    if (checkClientOutputBufferLimits(c)) {
-        sds client = catClientInfoString(sdsempty(),c);
-
-        if (async) {
-            freeClientAsync(c);
-            serverLog(LL_WARNING,
-                      "Client %s scheduled to be closed ASAP for overcoming of output buffer limits.",
-                      client);
-        } else {
-            freeClient(c);
-            serverLog(LL_WARNING,
-                      "Client %s closed for overcoming of output buffer limits.",
-                      client);
-        }
-        sdsfree(client);
-        return  1;
-    }
-    return 0;
-}
-
-/* Helper function used by performEvictions() in order to flush slaves
- * output buffers without returning control to the event loop.
- * This is also called by SHUTDOWN for a best-effort attempt to send
- * slaves the latest writes. */
-void flushSlavesOutputBuffers(void) {
-    listIter li;
-    listNode *ln;
-
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = listNodeValue(ln);
-        int can_receive_writes = connHasWriteHandler(slave->conn) ||
-                                 (slave->flags & CLIENT_PENDING_WRITE);
-
-        /* We don't want to send the pending data to the replica in a few
-         * cases:
-         *
-         * 1. For some reason there is neither the write handler installed
-         *    nor the client is flagged as to have pending writes: for some
-         *    reason this replica may not be set to receive data. This is
-         *    just for the sake of defensive programming.
-         *
-         * 2. The put_online_on_ack flag is true. To know why we don't want
-         *    to send data to the replica in this case, please grep for the
-         *    flag for this flag.
-         *
-         * 3. Obviously if the slave is not ONLINE.
-         */
-        if (slave->replstate == SLAVE_STATE_ONLINE &&
-            can_receive_writes &&
-            !slave->repl_put_online_on_ack &&
-            clientHasPendingReplies(slave))
-        {
-            writeToClient(slave,0);
-        }
-    }
-}
-
-/* Pause clients up to the specified unixtime (in ms) for a given type of
- * commands.
- *
- * A main use case of this function is to allow pausing replication traffic
- * so that a failover without data loss to occur. Replicas will continue to receive
- * traffic to faciliate this functionality.
- * 
- * This function is also internally used by Redis Cluster for the manual
- * failover procedure implemented by CLUSTER FAILOVER.
- *
- * The function always succeed, even if there is already a pause in progress.
- * In such a case, the duration is set to the maximum and new end time and the
- * type is set to the more restrictive type of pause. */
-void pauseClients(mstime_t end, pause_type type) {
-    if (type > server.client_pause_type) {
-        server.client_pause_type = type;
-    }
-
-    if (end > server.client_pause_end_time) {
-        server.client_pause_end_time = end;
-    }
-
-    /* We allow write commands that were queued
-     * up before and after to execute. We need
-     * to track this state so that we don't assert
-     * in propagate(). */
-    if (server.in_exec) {
-        server.client_pause_in_transaction = 1;
-    }
-}
-
-/* Unpause clients and queue them for reprocessing. */
-void unpauseClients(void) {
-    listNode *ln;
-    listIter li;
-    client *c;
-    
-    server.client_pause_type = CLIENT_PAUSE_OFF;
-    server.client_pause_end_time = 0;
-
-    /* Unblock all of the clients so they are reprocessed. */
-    listRewind(server.paused_clients,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        c = listNodeValue(ln);
-        unblockClient(c);
-    }
-}
-
-/* Returns true if clients are paused and false otherwise. */ 
-int areClientsPaused(void) {
-    return server.client_pause_type != CLIENT_PAUSE_OFF;
-}
-
-/* Checks if the current client pause has elapsed and unpause clients
- * if it has. Also returns true if clients are now paused and false 
- * otherwise. */
-int checkClientPauseTimeoutAndReturnIfPaused(void) {
-    if (!areClientsPaused())
-        return 0;
-    if (server.client_pause_end_time < server.mstime) {
-        unpauseClients();
-    }
-    return areClientsPaused();
-}
-
-/* This function is called by Redis in order to process a few events from
- * time to time while blocked into some not interruptible operation.
- * This allows to reply to clients with the -LOADING error while loading the
- * data set at startup or after a full resynchronization with the master
- * and so forth.
- *
- * It calls the event loop in order to process a few events. Specifically we
- * try to call the event loop 4 times as long as we receive acknowledge that
- * some event was processed, in order to go forward with the accept, read,
- * write, close sequence needed to serve a client.
- *
- * The function returns the total number of events processed. */
-void processEventsWhileBlocked(void) {
-    int iterations = 4; /* See the function top-comment. */
-
-    /* Update our cached time since it is used to create and update the last
-     * interaction time with clients and for other important things. */
-    updateCachedTime(0);
-
-    /* Note: when we are processing events while blocked (for instance during
-     * busy Lua scripts), we set a global flag. When such flag is set, we
-     * avoid handling the read part of clients using threaded I/O.
-     * See https://github.com/redis/redis/issues/6988 for more info. */
-    ProcessingEventsWhileBlocked = 1;
-    while (iterations--) {
-        long long startval = server.events_processed_while_blocked;
-        long long ae_events = aeProcessEvents(server.el,
-            AE_FILE_EVENTS|AE_DONT_WAIT|
-            AE_CALL_BEFORE_SLEEP|AE_CALL_AFTER_SLEEP);
-        /* Note that server.events_processed_while_blocked will also get
-         * incremeted by callbacks called by the event loop handlers. */
-        server.events_processed_while_blocked += ae_events;
-        long long events = server.events_processed_while_blocked - startval;
-        if (!events) break;
-    }
-
-    whileBlockedCron();
-
-    ProcessingEventsWhileBlocked = 0;
-}
-
-/* ==========================================================================
- * Threaded I/O
- * ========================================================================== */
-
-#define IO_THREADS_MAX_NUM 128
-#define IO_THREADS_OP_READ 0
-#define IO_THREADS_OP_WRITE 1
-
-pthread_t io_threads[IO_THREADS_MAX_NUM];
-pthread_mutex_t io_threads_mutex[IO_THREADS_MAX_NUM];
-redisAtomic unsigned long io_threads_pending[IO_THREADS_MAX_NUM];
-int io_threads_op;      /* IO_THREADS_OP_WRITE or IO_THREADS_OP_READ. */
-
-/* This is the list of clients each thread will serve when threaded I/O is
- * used. We spawn io_threads_num-1 threads, since one is the main thread
- * itself. */
-list *io_threads_list[IO_THREADS_MAX_NUM];
-
-static inline unsigned long getIOPendingCount(int i) {
-    unsigned long count = 0;
-    atomicGetWithSync(io_threads_pending[i], count);
-    return count;
-}
-
-static inline void setIOPendingCount(int i, unsigned long count) {
-    atomicSetWithSync(io_threads_pending[i], count);
-}
-
-void *IOThreadMain(void *myid) {
-    /* The ID is the thread number (from 0 to server.iothreads_num-1), and is
-     * used by the thread to just manipulate a single sub-array of clients. */
-    long id = (unsigned long)myid;
-    char thdname[16];
-
-    snprintf(thdname, sizeof(thdname), "io_thd_%ld", id);
-    redis_set_thread_title(thdname);
-    redisSetCpuAffinity(server.server_cpulist);
-    makeThreadKillable();
-
-    while(1) {
-        /* Wait for start */
-        for (int j = 0; j < 1000000; j++) {
-            if (getIOPendingCount(id) != 0) break;
-        }
-
-        /* Give the main thread a chance to stop this thread. */
-        if (getIOPendingCount(id) == 0) {
-            pthread_mutex_lock(&io_threads_mutex[id]);
-            pthread_mutex_unlock(&io_threads_mutex[id]);
-            continue;
-        }
-
-        serverAssert(getIOPendingCount(id) != 0);
-
-        /* Process: note that the main thread will never touch our list
-         * before we drop the pending count to 0. */
-        listIter li;
-        listNode *ln;
-        listRewind(io_threads_list[id],&li);
-        while((ln = listNext(&li))) {
-            client *c = listNodeValue(ln);
-            if (io_threads_op == IO_THREADS_OP_WRITE) {
-                writeToClient(c,0);
-            } else if (io_threads_op == IO_THREADS_OP_READ) {
-                readQueryFromClient(c->conn);
-            } else {
-                serverPanic("io_threads_op value is unknown");
-            }
-        }
-        listEmpty(io_threads_list[id]);
-        setIOPendingCount(id, 0);
-    }
-}
-
-/* Initialize the data structures needed for threaded I/O. */
-void initThreadedIO(void) {
-    server.io_threads_active = 0; /* We start with threads not active. */
-
-    /* Don't spawn any thread if the user selected a single thread:
-     * we'll handle I/O directly from the main thread. */
-    if (server.io_threads_num == 1) return;
-
-    if (server.io_threads_num > IO_THREADS_MAX_NUM) {
-        serverLog(LL_WARNING,"Fatal: too many I/O threads configured. "
-                             "The maximum number is %d.", IO_THREADS_MAX_NUM);
-        exit(1);
-    }
-
-    /* Spawn and initialize the I/O threads. */
-    for (int i = 0; i < server.io_threads_num; i++) {
-        /* Things we do for all the threads including the main thread. */
-        io_threads_list[i] = listCreate();
-        if (i == 0) continue; /* Thread 0 is the main thread. */
-
-        /* Things we do only for the additional threads. */
-        pthread_t tid;
-        pthread_mutex_init(&io_threads_mutex[i],NULL);
-        setIOPendingCount(i, 0);
-        pthread_mutex_lock(&io_threads_mutex[i]); /* Thread will be stopped. */
-        if (pthread_create(&tid,NULL,IOThreadMain,(void*)(long)i) != 0) {
-            serverLog(LL_WARNING,"Fatal: Can't initialize IO thread.");
-            exit(1);
-        }
-        io_threads[i] = tid;
-    }
-}
-
-void killIOThreads(void) {
-    int err, j;
-    for (j = 0; j < server.io_threads_num; j++) {
-        if (io_threads[j] == pthread_self()) continue;
-        if (io_threads[j] && pthread_cancel(io_threads[j]) == 0) {
-            if ((err = pthread_join(io_threads[j],NULL)) != 0) {
-                serverLog(LL_WARNING,
-                    "IO thread(tid:%lu) can not be joined: %s",
-                        (unsigned long)io_threads[j], strerror(err));
-            } else {
-                serverLog(LL_WARNING,
-                    "IO thread(tid:%lu) terminated",(unsigned long)io_threads[j]);
-            }
-        }
-    }
-}
-
-void startThreadedIO(void) {
-    serverAssert(server.io_threads_active == 0);
-    for (int j = 1; j < server.io_threads_num; j++)
-        pthread_mutex_unlock(&io_threads_mutex[j]);
-    server.io_threads_active = 1;
-}
-
-void stopThreadedIO(void) {
-    /* We may have still clients with pending reads when this function
-     * is called: handle them before stopping the threads. */
-    handleClientsWithPendingReadsUsingThreads();
-    serverAssert(server.io_threads_active == 1);
-    for (int j = 1; j < server.io_threads_num; j++)
-        pthread_mutex_lock(&io_threads_mutex[j]);
-    server.io_threads_active = 0;
-}
-
-/* This function checks if there are not enough pending clients to justify
- * taking the I/O threads active: in that case I/O threads are stopped if
- * currently active. We track the pending writes as a measure of clients
- * we need to handle in parallel, however the I/O threading is disabled
- * globally for reads as well if we have too little pending clients.
- *
- * The function returns 0 if the I/O threading should be used because there
- * are enough active threads, otherwise 1 is returned and the I/O threads
- * could be possibly stopped (if already active) as a side effect. */
-int stopThreadedIOIfNeeded(void) {
-    int pending = listLength(server.clients_pending_write);
-
-    /* Return ASAP if IO threads are disabled (single threaded mode). */
-    if (server.io_threads_num == 1) return 1;
-
-    if (pending < (server.io_threads_num*2)) {
-        if (server.io_threads_active) stopThreadedIO();
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-int handleClientsWithPendingWritesUsingThreads(void) {
-    int processed = listLength(server.clients_pending_write);
-    if (processed == 0) return 0; /* Return ASAP if there are no clients. */
-
-    /* If I/O threads are disabled or we have few clients to serve, don't
-     * use I/O threads, but the boring synchronous code. */
-    if (server.io_threads_num == 1 || stopThreadedIOIfNeeded()) {
-        return handleClientsWithPendingWrites();
-    }
-
-    /* Start threads if needed. */
-    if (!server.io_threads_active) startThreadedIO();
-
-    /* Distribute the clients across N different lists. */
-    listIter li;
-    listNode *ln;
-    listRewind(server.clients_pending_write,&li);
-    int item_id = 0;
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-        c->flags &= ~CLIENT_PENDING_WRITE;
-
-        /* Remove clients from the list of pending writes since
-         * they are going to be closed ASAP. */
-        if (c->flags & CLIENT_CLOSE_ASAP) {
-            listDelNode(server.clients_pending_write, ln);
-            continue;
-        }
-
-        int target_id = item_id % server.io_threads_num;
-        listAddNodeTail(io_threads_list[target_id],c);
-        item_id++;
-    }
-
-    /* Give the start condition to the waiting threads, by setting the
-     * start condition atomic var. */
-    io_threads_op = IO_THREADS_OP_WRITE;
-    for (int j = 1; j < server.io_threads_num; j++) {
-        int count = listLength(io_threads_list[j]);
-        setIOPendingCount(j, count);
-    }
-
-    /* Also use the main thread to process a slice of clients. */
-    listRewind(io_threads_list[0],&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-        writeToClient(c,0);
-    }
-    listEmpty(io_threads_list[0]);
-
-    /* Wait for all the other threads to end their work. */
-    while(1) {
-        unsigned long pending = 0;
-        for (int j = 1; j < server.io_threads_num; j++)
-            pending += getIOPendingCount(j);
-        if (pending == 0) break;
-    }
-
-    /* Run the list of clients again to install the write handler where
-     * needed. */
-    listRewind(server.clients_pending_write,&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-
-        /* Install the write handler if there are pending writes in some
-         * of the clients. */
-        if (clientHasPendingReplies(c) &&
-                connSetWriteHandler(c->conn, sendReplyToClient) == AE_ERR)
-        {
-            freeClientAsync(c);
-        }
-    }
-    listEmpty(server.clients_pending_write);
-
-    /* Update processed count on server */
-    server.stat_io_writes_processed += processed;
-
-    return processed;
-}
-
-/* Return 1 if we want to handle the client read later using threaded I/O.
- * This is called by the readable handler of the event loop.
- * As a side effect of calling this function the client is put in the
- * pending read clients and flagged as such. */
-int postponeClientRead(client *c) {
-    if (server.io_threads_active &&
-        server.io_threads_do_reads &&
-        !ProcessingEventsWhileBlocked &&
-        !(c->flags & (CLIENT_MASTER|CLIENT_SLAVE|CLIENT_PENDING_READ|CLIENT_BLOCKED))) 
-    {
-        c->flags |= CLIENT_PENDING_READ;
-        listAddNodeHead(server.clients_pending_read,c);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* When threaded I/O is also enabled for the reading + parsing side, the
- * readable handler will just put normal clients into a queue of clients to
- * process (instead of serving them synchronously). This function runs
- * the queue using the I/O threads, and process them in order to accumulate
- * the reads in the buffers, and also parse the first command available
- * rendering it in the client structures. */
-int handleClientsWithPendingReadsUsingThreads(void) {
-    if (!server.io_threads_active || !server.io_threads_do_reads) return 0;
-    int processed = listLength(server.clients_pending_read);
-    if (processed == 0) return 0;
-
-    /* Distribute the clients across N different lists. */
-    listIter li;
-    listNode *ln;
-    listRewind(server.clients_pending_read,&li);
-    int item_id = 0;
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-        int target_id = item_id % server.io_threads_num;
-        listAddNodeTail(io_threads_list[target_id],c);
-        item_id++;
-    }
-
-    /* Give the start condition to the waiting threads, by setting the
-     * start condition atomic var. */
-    io_threads_op = IO_THREADS_OP_READ;
-    for (int j = 1; j < server.io_threads_num; j++) {
-        int count = listLength(io_threads_list[j]);
-        setIOPendingCount(j, count);
-    }
-
-    /* Also use the main thread to process a slice of clients. */
-    listRewind(io_threads_list[0],&li);
-    while((ln = listNext(&li))) {
-        client *c = listNodeValue(ln);
-        readQueryFromClient(c->conn);
-    }
-    listEmpty(io_threads_list[0]);
-
-    /* Wait for all the other threads to end their work. */
-    while(1) {
-        unsigned long pending = 0;
-        for (int j = 1; j < server.io_threads_num; j++)
-            pending += getIOPendingCount(j);
-        if (pending == 0) break;
-    }
-
-    /* Run the list of clients again to process the new buffers. */
-    while(listLength(server.clients_pending_read)) {
-        ln = listFirst(server.clients_pending_read);
-        client *c = listNodeValue(ln);
-        c->flags &= ~CLIENT_PENDING_READ;
-        listDelNode(server.clients_pending_read,ln);
-
-        serverAssert(!(c->flags & CLIENT_BLOCKED));
-        if (processPendingCommandsAndResetClient(c) == C_ERR) {
-            /* If the client is no longer valid, we avoid
-             * processing the client later. So we just go
-             * to the next. */
-            continue;
-        }
-
-        processInputBuffer(c);
-
-        /* We may have pending replies if a thread readQueryFromClient() produced
-         * replies and did not install a write handler (it can't).
-         */
-        if (!(c->flags & CLIENT_PENDING_WRITE) && clientHasPendingReplies(c))
-            clientInstallWriteHandler(c);
-    }
-
-    /* Update processed count on server */
-    server.stat_io_reads_processed += processed;
-
-    return processed;
-}
diff --git a/redis-stable/src/notify.c b/redis-stable/src/notify.c
deleted file mode 100644
index afaddbfc..00000000
--- a/redis-stable/src/notify.c
+++ /dev/null
@@ -1,142 +0,0 @@
-/*
- * Copyright (c) 2013, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* This file implements keyspace events notification via Pub/Sub and
- * described at https://redis.io/topics/notifications. */
-
-/* Turn a string representing notification classes into an integer
- * representing notification classes flags xored.
- *
- * The function returns -1 if the input contains characters not mapping to
- * any class. */
-int keyspaceEventsStringToFlags(char *classes) {
-    char *p = classes;
-    int c, flags = 0;
-
-    while((c = *p++) != '\0') {
-        switch(c) {
-        case 'A': flags |= NOTIFY_ALL; break;
-        case 'g': flags |= NOTIFY_GENERIC; break;
-        case '$': flags |= NOTIFY_STRING; break;
-        case 'l': flags |= NOTIFY_LIST; break;
-        case 's': flags |= NOTIFY_SET; break;
-        case 'h': flags |= NOTIFY_HASH; break;
-        case 'z': flags |= NOTIFY_ZSET; break;
-        case 'x': flags |= NOTIFY_EXPIRED; break;
-        case 'e': flags |= NOTIFY_EVICTED; break;
-        case 'K': flags |= NOTIFY_KEYSPACE; break;
-        case 'E': flags |= NOTIFY_KEYEVENT; break;
-        case 't': flags |= NOTIFY_STREAM; break;
-        case 'm': flags |= NOTIFY_KEY_MISS; break;
-        case 'd': flags |= NOTIFY_MODULE; break;
-        default: return -1;
-        }
-    }
-    return flags;
-}
-
-/* This function does exactly the reverse of the function above: it gets
- * as input an integer with the xored flags and returns a string representing
- * the selected classes. The string returned is an sds string that needs to
- * be released with sdsfree(). */
-sds keyspaceEventsFlagsToString(int flags) {
-    sds res;
-
-    res = sdsempty();
-    if ((flags & NOTIFY_ALL) == NOTIFY_ALL) {
-        res = sdscatlen(res,"A",1);
-    } else {
-        if (flags & NOTIFY_GENERIC) res = sdscatlen(res,"g",1);
-        if (flags & NOTIFY_STRING) res = sdscatlen(res,"$",1);
-        if (flags & NOTIFY_LIST) res = sdscatlen(res,"l",1);
-        if (flags & NOTIFY_SET) res = sdscatlen(res,"s",1);
-        if (flags & NOTIFY_HASH) res = sdscatlen(res,"h",1);
-        if (flags & NOTIFY_ZSET) res = sdscatlen(res,"z",1);
-        if (flags & NOTIFY_EXPIRED) res = sdscatlen(res,"x",1);
-        if (flags & NOTIFY_EVICTED) res = sdscatlen(res,"e",1);
-        if (flags & NOTIFY_STREAM) res = sdscatlen(res,"t",1);
-        if (flags & NOTIFY_MODULE) res = sdscatlen(res,"d",1);
-    }
-    if (flags & NOTIFY_KEYSPACE) res = sdscatlen(res,"K",1);
-    if (flags & NOTIFY_KEYEVENT) res = sdscatlen(res,"E",1);
-    if (flags & NOTIFY_KEY_MISS) res = sdscatlen(res,"m",1);
-    return res;
-}
-
-/* The API provided to the rest of the Redis core is a simple function:
- *
- * notifyKeyspaceEvent(char *event, robj *key, int dbid);
- *
- * 'event' is a C string representing the event name.
- * 'key' is a Redis object representing the key name.
- * 'dbid' is the database ID where the key lives.  */
-void notifyKeyspaceEvent(int type, char *event, robj *key, int dbid) {
-    sds chan;
-    robj *chanobj, *eventobj;
-    int len = -1;
-    char buf[24];
-
-    /* If any modules are interested in events, notify the module system now.
-     * This bypasses the notifications configuration, but the module engine
-     * will only call event subscribers if the event type matches the types
-     * they are interested in. */
-     moduleNotifyKeyspaceEvent(type, event, key, dbid);
-
-    /* If notifications for this class of events are off, return ASAP. */
-    if (!(server.notify_keyspace_events & type)) return;
-
-    eventobj = createStringObject(event,strlen(event));
-
-    /* __keyspace@<db>__:<key> <event> notifications. */
-    if (server.notify_keyspace_events & NOTIFY_KEYSPACE) {
-        chan = sdsnewlen("__keyspace@",11);
-        len = ll2string(buf,sizeof(buf),dbid);
-        chan = sdscatlen(chan, buf, len);
-        chan = sdscatlen(chan, "__:", 3);
-        chan = sdscatsds(chan, key->ptr);
-        chanobj = createObject(OBJ_STRING, chan);
-        pubsubPublishMessage(chanobj, eventobj);
-        decrRefCount(chanobj);
-    }
-
-    /* __keyevent@<db>__:<event> <key> notifications. */
-    if (server.notify_keyspace_events & NOTIFY_KEYEVENT) {
-        chan = sdsnewlen("__keyevent@",11);
-        if (len == -1) len = ll2string(buf,sizeof(buf),dbid);
-        chan = sdscatlen(chan, buf, len);
-        chan = sdscatlen(chan, "__:", 3);
-        chan = sdscatsds(chan, eventobj->ptr);
-        chanobj = createObject(OBJ_STRING, chan);
-        pubsubPublishMessage(chanobj, key);
-        decrRefCount(chanobj);
-    }
-    decrRefCount(eventobj);
-}
diff --git a/redis-stable/src/object.c b/redis-stable/src/object.c
deleted file mode 100644
index 8a5e80a6..00000000
--- a/redis-stable/src/object.c
+++ /dev/null
@@ -1,1472 +0,0 @@
-/* Redis Object implementation.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <math.h>
-#include <ctype.h>
-
-#ifdef __CYGWIN__
-#define strtold(a,b) ((long double)strtod((a),(b)))
-#endif
-
-/* ===================== Creation and parsing of objects ==================== */
-
-robj *createObject(int type, void *ptr) {
-    robj *o = zmalloc(sizeof(*o));
-    o->type = type;
-    o->encoding = OBJ_ENCODING_RAW;
-    o->ptr = ptr;
-    o->refcount = 1;
-
-    /* Set the LRU to the current lruclock (minutes resolution), or
-     * alternatively the LFU counter. */
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-        o->lru = (LFUGetTimeInMinutes()<<8) | LFU_INIT_VAL;
-    } else {
-        o->lru = LRU_CLOCK();
-    }
-    return o;
-}
-
-/* Set a special refcount in the object to make it "shared":
- * incrRefCount and decrRefCount() will test for this special refcount
- * and will not touch the object. This way it is free to access shared
- * objects such as small integers from different threads without any
- * mutex.
- *
- * A common patter to create shared objects:
- *
- * robj *myobject = makeObjectShared(createObject(...));
- *
- */
-robj *makeObjectShared(robj *o) {
-    serverAssert(o->refcount == 1);
-    o->refcount = OBJ_SHARED_REFCOUNT;
-    return o;
-}
-
-/* Create a string object with encoding OBJ_ENCODING_RAW, that is a plain
- * string object where o->ptr points to a proper sds string. */
-robj *createRawStringObject(const char *ptr, size_t len) {
-    return createObject(OBJ_STRING, sdsnewlen(ptr,len));
-}
-
-/* Create a string object with encoding OBJ_ENCODING_EMBSTR, that is
- * an object where the sds string is actually an unmodifiable string
- * allocated in the same chunk as the object itself. */
-robj *createEmbeddedStringObject(const char *ptr, size_t len) {
-    robj *o = zmalloc(sizeof(robj)+sizeof(struct sdshdr8)+len+1);
-    struct sdshdr8 *sh = (void*)(o+1);
-
-    o->type = OBJ_STRING;
-    o->encoding = OBJ_ENCODING_EMBSTR;
-    o->ptr = sh+1;
-    o->refcount = 1;
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-        o->lru = (LFUGetTimeInMinutes()<<8) | LFU_INIT_VAL;
-    } else {
-        o->lru = LRU_CLOCK();
-    }
-
-    sh->len = len;
-    sh->alloc = len;
-    sh->flags = SDS_TYPE_8;
-    if (ptr == SDS_NOINIT)
-        sh->buf[len] = '\0';
-    else if (ptr) {
-        memcpy(sh->buf,ptr,len);
-        sh->buf[len] = '\0';
-    } else {
-        memset(sh->buf,0,len+1);
-    }
-    return o;
-}
-
-/* Create a string object with EMBSTR encoding if it is smaller than
- * OBJ_ENCODING_EMBSTR_SIZE_LIMIT, otherwise the RAW encoding is
- * used.
- *
- * The current limit of 44 is chosen so that the biggest string object
- * we allocate as EMBSTR will still fit into the 64 byte arena of jemalloc. */
-#define OBJ_ENCODING_EMBSTR_SIZE_LIMIT 44
-robj *createStringObject(const char *ptr, size_t len) {
-    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT)
-        return createEmbeddedStringObject(ptr,len);
-    else
-        return createRawStringObject(ptr,len);
-}
-
-/* Same as CreateRawStringObject, can return NULL if allocation fails */
-robj *tryCreateRawStringObject(const char *ptr, size_t len) {
-    sds str = sdstrynewlen(ptr,len);
-    if (!str) return NULL;
-    return createObject(OBJ_STRING, str);
-}
-
-/* Same as createStringObject, can return NULL if allocation fails */
-robj *tryCreateStringObject(const char *ptr, size_t len) {
-    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT)
-        return createEmbeddedStringObject(ptr,len);
-    else
-        return tryCreateRawStringObject(ptr,len);
-}
-
-/* Create a string object from a long long value. When possible returns a
- * shared integer object, or at least an integer encoded one.
- *
- * If valueobj is non zero, the function avoids returning a shared
- * integer, because the object is going to be used as value in the Redis key
- * space (for instance when the INCR command is used), so we want LFU/LRU
- * values specific for each key. */
-robj *createStringObjectFromLongLongWithOptions(long long value, int valueobj) {
-    robj *o;
-
-    if (server.maxmemory == 0 ||
-        !(server.maxmemory_policy & MAXMEMORY_FLAG_NO_SHARED_INTEGERS))
-    {
-        /* If the maxmemory policy permits, we can still return shared integers
-         * even if valueobj is true. */
-        valueobj = 0;
-    }
-
-    if (value >= 0 && value < OBJ_SHARED_INTEGERS && valueobj == 0) {
-        incrRefCount(shared.integers[value]);
-        o = shared.integers[value];
-    } else {
-        if (value >= LONG_MIN && value <= LONG_MAX) {
-            o = createObject(OBJ_STRING, NULL);
-            o->encoding = OBJ_ENCODING_INT;
-            o->ptr = (void*)((long)value);
-        } else {
-            o = createObject(OBJ_STRING,sdsfromlonglong(value));
-        }
-    }
-    return o;
-}
-
-/* Wrapper for createStringObjectFromLongLongWithOptions() always demanding
- * to create a shared object if possible. */
-robj *createStringObjectFromLongLong(long long value) {
-    return createStringObjectFromLongLongWithOptions(value,0);
-}
-
-/* Wrapper for createStringObjectFromLongLongWithOptions() avoiding a shared
- * object when LFU/LRU info are needed, that is, when the object is used
- * as a value in the key space, and Redis is configured to evict based on
- * LFU/LRU. */
-robj *createStringObjectFromLongLongForValue(long long value) {
-    return createStringObjectFromLongLongWithOptions(value,1);
-}
-
-/* Create a string object from a long double. If humanfriendly is non-zero
- * it does not use exponential format and trims trailing zeroes at the end,
- * however this results in loss of precision. Otherwise exp format is used
- * and the output of snprintf() is not modified.
- *
- * The 'humanfriendly' option is used for INCRBYFLOAT and HINCRBYFLOAT. */
-robj *createStringObjectFromLongDouble(long double value, int humanfriendly) {
-    char buf[MAX_LONG_DOUBLE_CHARS];
-    int len = ld2string(buf,sizeof(buf),value,humanfriendly? LD_STR_HUMAN: LD_STR_AUTO);
-    return createStringObject(buf,len);
-}
-
-/* Duplicate a string object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * This function also guarantees that duplicating a small integer object
- * (or a string object that contains a representation of a small integer)
- * will always result in a fresh object that is unshared (refcount == 1).
- *
- * The resulting object always has refcount set to 1. */
-robj *dupStringObject(const robj *o) {
-    robj *d;
-
-    serverAssert(o->type == OBJ_STRING);
-
-    switch(o->encoding) {
-    case OBJ_ENCODING_RAW:
-        return createRawStringObject(o->ptr,sdslen(o->ptr));
-    case OBJ_ENCODING_EMBSTR:
-        return createEmbeddedStringObject(o->ptr,sdslen(o->ptr));
-    case OBJ_ENCODING_INT:
-        d = createObject(OBJ_STRING, NULL);
-        d->encoding = OBJ_ENCODING_INT;
-        d->ptr = o->ptr;
-        return d;
-    default:
-        serverPanic("Wrong encoding.");
-        break;
-    }
-}
-
-robj *createQuicklistObject(void) {
-    quicklist *l = quicklistCreate();
-    robj *o = createObject(OBJ_LIST,l);
-    o->encoding = OBJ_ENCODING_QUICKLIST;
-    return o;
-}
-
-robj *createZiplistObject(void) {
-    unsigned char *zl = ziplistNew();
-    robj *o = createObject(OBJ_LIST,zl);
-    o->encoding = OBJ_ENCODING_ZIPLIST;
-    return o;
-}
-
-robj *createSetObject(void) {
-    dict *d = dictCreate(&setDictType,NULL);
-    robj *o = createObject(OBJ_SET,d);
-    o->encoding = OBJ_ENCODING_HT;
-    return o;
-}
-
-robj *createIntsetObject(void) {
-    intset *is = intsetNew();
-    robj *o = createObject(OBJ_SET,is);
-    o->encoding = OBJ_ENCODING_INTSET;
-    return o;
-}
-
-robj *createHashObject(void) {
-    unsigned char *zl = ziplistNew();
-    robj *o = createObject(OBJ_HASH, zl);
-    o->encoding = OBJ_ENCODING_ZIPLIST;
-    return o;
-}
-
-robj *createZsetObject(void) {
-    zset *zs = zmalloc(sizeof(*zs));
-    robj *o;
-
-    zs->dict = dictCreate(&zsetDictType,NULL);
-    zs->zsl = zslCreate();
-    o = createObject(OBJ_ZSET,zs);
-    o->encoding = OBJ_ENCODING_SKIPLIST;
-    return o;
-}
-
-robj *createZsetZiplistObject(void) {
-    unsigned char *zl = ziplistNew();
-    robj *o = createObject(OBJ_ZSET,zl);
-    o->encoding = OBJ_ENCODING_ZIPLIST;
-    return o;
-}
-
-robj *createStreamObject(void) {
-    stream *s = streamNew();
-    robj *o = createObject(OBJ_STREAM,s);
-    o->encoding = OBJ_ENCODING_STREAM;
-    return o;
-}
-
-robj *createModuleObject(moduleType *mt, void *value) {
-    moduleValue *mv = zmalloc(sizeof(*mv));
-    mv->type = mt;
-    mv->value = value;
-    return createObject(OBJ_MODULE,mv);
-}
-
-void freeStringObject(robj *o) {
-    if (o->encoding == OBJ_ENCODING_RAW) {
-        sdsfree(o->ptr);
-    }
-}
-
-void freeListObject(robj *o) {
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklistRelease(o->ptr);
-    } else {
-        serverPanic("Unknown list encoding type");
-    }
-}
-
-void freeSetObject(robj *o) {
-    switch (o->encoding) {
-    case OBJ_ENCODING_HT:
-        dictRelease((dict*) o->ptr);
-        break;
-    case OBJ_ENCODING_INTSET:
-        zfree(o->ptr);
-        break;
-    default:
-        serverPanic("Unknown set encoding type");
-    }
-}
-
-void freeZsetObject(robj *o) {
-    zset *zs;
-    switch (o->encoding) {
-    case OBJ_ENCODING_SKIPLIST:
-        zs = o->ptr;
-        dictRelease(zs->dict);
-        zslFree(zs->zsl);
-        zfree(zs);
-        break;
-    case OBJ_ENCODING_ZIPLIST:
-        zfree(o->ptr);
-        break;
-    default:
-        serverPanic("Unknown sorted set encoding");
-    }
-}
-
-void freeHashObject(robj *o) {
-    switch (o->encoding) {
-    case OBJ_ENCODING_HT:
-        dictRelease((dict*) o->ptr);
-        break;
-    case OBJ_ENCODING_ZIPLIST:
-        zfree(o->ptr);
-        break;
-    default:
-        serverPanic("Unknown hash encoding type");
-        break;
-    }
-}
-
-void freeModuleObject(robj *o) {
-    moduleValue *mv = o->ptr;
-    mv->type->free(mv->value);
-    zfree(mv);
-}
-
-void freeStreamObject(robj *o) {
-    freeStream(o->ptr);
-}
-
-void incrRefCount(robj *o) {
-    if (o->refcount < OBJ_FIRST_SPECIAL_REFCOUNT) {
-        o->refcount++;
-    } else {
-        if (o->refcount == OBJ_SHARED_REFCOUNT) {
-            /* Nothing to do: this refcount is immutable. */
-        } else if (o->refcount == OBJ_STATIC_REFCOUNT) {
-            serverPanic("You tried to retain an object allocated in the stack");
-        }
-    }
-}
-
-void decrRefCount(robj *o) {
-    if (o->refcount == 1) {
-        switch(o->type) {
-        case OBJ_STRING: freeStringObject(o); break;
-        case OBJ_LIST: freeListObject(o); break;
-        case OBJ_SET: freeSetObject(o); break;
-        case OBJ_ZSET: freeZsetObject(o); break;
-        case OBJ_HASH: freeHashObject(o); break;
-        case OBJ_MODULE: freeModuleObject(o); break;
-        case OBJ_STREAM: freeStreamObject(o); break;
-        default: serverPanic("Unknown object type"); break;
-        }
-        zfree(o);
-    } else {
-        if (o->refcount <= 0) serverPanic("decrRefCount against refcount <= 0");
-        if (o->refcount != OBJ_SHARED_REFCOUNT) o->refcount--;
-    }
-}
-
-/* This variant of decrRefCount() gets its argument as void, and is useful
- * as free method in data structures that expect a 'void free_object(void*)'
- * prototype for the free method. */
-void decrRefCountVoid(void *o) {
-    decrRefCount(o);
-}
-
-int checkType(client *c, robj *o, int type) {
-    /* A NULL is considered an empty key */
-    if (o && o->type != type) {
-        addReplyErrorObject(c,shared.wrongtypeerr);
-        return 1;
-    }
-    return 0;
-}
-
-int isSdsRepresentableAsLongLong(sds s, long long *llval) {
-    return string2ll(s,sdslen(s),llval) ? C_OK : C_ERR;
-}
-
-int isObjectRepresentableAsLongLong(robj *o, long long *llval) {
-    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-    if (o->encoding == OBJ_ENCODING_INT) {
-        if (llval) *llval = (long) o->ptr;
-        return C_OK;
-    } else {
-        return isSdsRepresentableAsLongLong(o->ptr,llval);
-    }
-}
-
-/* Optimize the SDS string inside the string object to require little space,
- * in case there is more than 10% of free space at the end of the SDS
- * string. This happens because SDS strings tend to overallocate to avoid
- * wasting too much time in allocations when appending to the string. */
-void trimStringObjectIfNeeded(robj *o) {
-    if (o->encoding == OBJ_ENCODING_RAW &&
-        sdsavail(o->ptr) > sdslen(o->ptr)/10)
-    {
-        o->ptr = sdsRemoveFreeSpace(o->ptr);
-    }
-}
-
-/* Try to encode a string object in order to save space */
-robj *tryObjectEncoding(robj *o) {
-    long value;
-    sds s = o->ptr;
-    size_t len;
-
-    /* Make sure this is a string object, the only type we encode
-     * in this function. Other types use encoded memory efficient
-     * representations but are handled by the commands implementing
-     * the type. */
-    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-
-    /* We try some specialized encoding only for objects that are
-     * RAW or EMBSTR encoded, in other words objects that are still
-     * in represented by an actually array of chars. */
-    if (!sdsEncodedObject(o)) return o;
-
-    /* It's not safe to encode shared objects: shared objects can be shared
-     * everywhere in the "object space" of Redis and may end in places where
-     * they are not handled. We handle them only as values in the keyspace. */
-     if (o->refcount > 1) return o;
-
-    /* Check if we can represent this string as a long integer.
-     * Note that we are sure that a string larger than 20 chars is not
-     * representable as a 32 nor 64 bit integer. */
-    len = sdslen(s);
-    if (len <= 20 && string2l(s,len,&value)) {
-        /* This object is encodable as a long. Try to use a shared object.
-         * Note that we avoid using shared integers when maxmemory is used
-         * because every object needs to have a private LRU field for the LRU
-         * algorithm to work well. */
-        if ((server.maxmemory == 0 ||
-            !(server.maxmemory_policy & MAXMEMORY_FLAG_NO_SHARED_INTEGERS)) &&
-            value >= 0 &&
-            value < OBJ_SHARED_INTEGERS)
-        {
-            decrRefCount(o);
-            incrRefCount(shared.integers[value]);
-            return shared.integers[value];
-        } else {
-            if (o->encoding == OBJ_ENCODING_RAW) {
-                sdsfree(o->ptr);
-                o->encoding = OBJ_ENCODING_INT;
-                o->ptr = (void*) value;
-                return o;
-            } else if (o->encoding == OBJ_ENCODING_EMBSTR) {
-                decrRefCount(o);
-                return createStringObjectFromLongLongForValue(value);
-            }
-        }
-    }
-
-    /* If the string is small and is still RAW encoded,
-     * try the EMBSTR encoding which is more efficient.
-     * In this representation the object and the SDS string are allocated
-     * in the same chunk of memory to save space and cache misses. */
-    if (len <= OBJ_ENCODING_EMBSTR_SIZE_LIMIT) {
-        robj *emb;
-
-        if (o->encoding == OBJ_ENCODING_EMBSTR) return o;
-        emb = createEmbeddedStringObject(s,sdslen(s));
-        decrRefCount(o);
-        return emb;
-    }
-
-    /* We can't encode the object...
-     *
-     * Do the last try, and at least optimize the SDS string inside
-     * the string object to require little space, in case there
-     * is more than 10% of free space at the end of the SDS string.
-     *
-     * We do that only for relatively large strings as this branch
-     * is only entered if the length of the string is greater than
-     * OBJ_ENCODING_EMBSTR_SIZE_LIMIT. */
-    trimStringObjectIfNeeded(o);
-
-    /* Return the original object. */
-    return o;
-}
-
-/* Get a decoded version of an encoded object (returned as a new object).
- * If the object is already raw-encoded just increment the ref count. */
-robj *getDecodedObject(robj *o) {
-    robj *dec;
-
-    if (sdsEncodedObject(o)) {
-        incrRefCount(o);
-        return o;
-    }
-    if (o->type == OBJ_STRING && o->encoding == OBJ_ENCODING_INT) {
-        char buf[32];
-
-        ll2string(buf,32,(long)o->ptr);
-        dec = createStringObject(buf,strlen(buf));
-        return dec;
-    } else {
-        serverPanic("Unknown encoding type");
-    }
-}
-
-/* Compare two string objects via strcmp() or strcoll() depending on flags.
- * Note that the objects may be integer-encoded. In such a case we
- * use ll2string() to get a string representation of the numbers on the stack
- * and compare the strings, it's much faster than calling getDecodedObject().
- *
- * Important note: when REDIS_COMPARE_BINARY is used a binary-safe comparison
- * is used. */
-
-#define REDIS_COMPARE_BINARY (1<<0)
-#define REDIS_COMPARE_COLL (1<<1)
-
-int compareStringObjectsWithFlags(robj *a, robj *b, int flags) {
-    serverAssertWithInfo(NULL,a,a->type == OBJ_STRING && b->type == OBJ_STRING);
-    char bufa[128], bufb[128], *astr, *bstr;
-    size_t alen, blen, minlen;
-
-    if (a == b) return 0;
-    if (sdsEncodedObject(a)) {
-        astr = a->ptr;
-        alen = sdslen(astr);
-    } else {
-        alen = ll2string(bufa,sizeof(bufa),(long) a->ptr);
-        astr = bufa;
-    }
-    if (sdsEncodedObject(b)) {
-        bstr = b->ptr;
-        blen = sdslen(bstr);
-    } else {
-        blen = ll2string(bufb,sizeof(bufb),(long) b->ptr);
-        bstr = bufb;
-    }
-    if (flags & REDIS_COMPARE_COLL) {
-        return strcoll(astr,bstr);
-    } else {
-        int cmp;
-
-        minlen = (alen < blen) ? alen : blen;
-        cmp = memcmp(astr,bstr,minlen);
-        if (cmp == 0) return alen-blen;
-        return cmp;
-    }
-}
-
-/* Wrapper for compareStringObjectsWithFlags() using binary comparison. */
-int compareStringObjects(robj *a, robj *b) {
-    return compareStringObjectsWithFlags(a,b,REDIS_COMPARE_BINARY);
-}
-
-/* Wrapper for compareStringObjectsWithFlags() using collation. */
-int collateStringObjects(robj *a, robj *b) {
-    return compareStringObjectsWithFlags(a,b,REDIS_COMPARE_COLL);
-}
-
-/* Equal string objects return 1 if the two objects are the same from the
- * point of view of a string comparison, otherwise 0 is returned. Note that
- * this function is faster then checking for (compareStringObject(a,b) == 0)
- * because it can perform some more optimization. */
-int equalStringObjects(robj *a, robj *b) {
-    if (a->encoding == OBJ_ENCODING_INT &&
-        b->encoding == OBJ_ENCODING_INT){
-        /* If both strings are integer encoded just check if the stored
-         * long is the same. */
-        return a->ptr == b->ptr;
-    } else {
-        return compareStringObjects(a,b) == 0;
-    }
-}
-
-size_t stringObjectLen(robj *o) {
-    serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-    if (sdsEncodedObject(o)) {
-        return sdslen(o->ptr);
-    } else {
-        return sdigits10((long)o->ptr);
-    }
-}
-
-int getDoubleFromObject(const robj *o, double *target) {
-    double value;
-
-    if (o == NULL) {
-        value = 0;
-    } else {
-        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-        if (sdsEncodedObject(o)) {
-            if (!string2d(o->ptr, sdslen(o->ptr), &value))
-                return C_ERR;
-        } else if (o->encoding == OBJ_ENCODING_INT) {
-            value = (long)o->ptr;
-        } else {
-            serverPanic("Unknown string encoding");
-        }
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getDoubleFromObjectOrReply(client *c, robj *o, double *target, const char *msg) {
-    double value;
-    if (getDoubleFromObject(o, &value) != C_OK) {
-        if (msg != NULL) {
-            addReplyError(c,(char*)msg);
-        } else {
-            addReplyError(c,"value is not a valid float");
-        }
-        return C_ERR;
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getLongDoubleFromObject(robj *o, long double *target) {
-    long double value;
-
-    if (o == NULL) {
-        value = 0;
-    } else {
-        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-        if (sdsEncodedObject(o)) {
-            if (!string2ld(o->ptr, sdslen(o->ptr), &value))
-                return C_ERR;
-        } else if (o->encoding == OBJ_ENCODING_INT) {
-            value = (long)o->ptr;
-        } else {
-            serverPanic("Unknown string encoding");
-        }
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getLongDoubleFromObjectOrReply(client *c, robj *o, long double *target, const char *msg) {
-    long double value;
-    if (getLongDoubleFromObject(o, &value) != C_OK) {
-        if (msg != NULL) {
-            addReplyError(c,(char*)msg);
-        } else {
-            addReplyError(c,"value is not a valid float");
-        }
-        return C_ERR;
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getLongLongFromObject(robj *o, long long *target) {
-    long long value;
-
-    if (o == NULL) {
-        value = 0;
-    } else {
-        serverAssertWithInfo(NULL,o,o->type == OBJ_STRING);
-        if (sdsEncodedObject(o)) {
-            if (string2ll(o->ptr,sdslen(o->ptr),&value) == 0) return C_ERR;
-        } else if (o->encoding == OBJ_ENCODING_INT) {
-            value = (long)o->ptr;
-        } else {
-            serverPanic("Unknown string encoding");
-        }
-    }
-    if (target) *target = value;
-    return C_OK;
-}
-
-int getLongLongFromObjectOrReply(client *c, robj *o, long long *target, const char *msg) {
-    long long value;
-    if (getLongLongFromObject(o, &value) != C_OK) {
-        if (msg != NULL) {
-            addReplyError(c,(char*)msg);
-        } else {
-            addReplyError(c,"value is not an integer or out of range");
-        }
-        return C_ERR;
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg) {
-    long long value;
-
-    if (getLongLongFromObjectOrReply(c, o, &value, msg) != C_OK) return C_ERR;
-    if (value < LONG_MIN || value > LONG_MAX) {
-        if (msg != NULL) {
-            addReplyError(c,(char*)msg);
-        } else {
-            addReplyError(c,"value is out of range");
-        }
-        return C_ERR;
-    }
-    *target = value;
-    return C_OK;
-}
-
-int getRangeLongFromObjectOrReply(client *c, robj *o, long min, long max, long *target, const char *msg) {
-    if (getLongFromObjectOrReply(c, o, target, msg) != C_OK) return C_ERR;
-    if (*target < min || *target > max) {
-        if (msg != NULL) {
-            addReplyError(c,(char*)msg);
-        } else {
-            addReplyErrorFormat(c,"value is out of range, value must between %ld and %ld", min, max);
-        }
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-int getPositiveLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg) {
-    if (msg) {
-        return getRangeLongFromObjectOrReply(c, o, 0, LONG_MAX, target, msg);
-    } else {
-        return getRangeLongFromObjectOrReply(c, o, 0, LONG_MAX, target, "value is out of range, must be positive");
-    }
-}
-
-int getIntFromObjectOrReply(client *c, robj *o, int *target, const char *msg) {
-    long value;
-
-    if (getRangeLongFromObjectOrReply(c, o, INT_MIN, INT_MAX, &value, msg) != C_OK)
-        return C_ERR;
-
-    *target = value;
-    return C_OK;
-}
-
-char *strEncoding(int encoding) {
-    switch(encoding) {
-    case OBJ_ENCODING_RAW: return "raw";
-    case OBJ_ENCODING_INT: return "int";
-    case OBJ_ENCODING_HT: return "hashtable";
-    case OBJ_ENCODING_QUICKLIST: return "quicklist";
-    case OBJ_ENCODING_ZIPLIST: return "ziplist";
-    case OBJ_ENCODING_INTSET: return "intset";
-    case OBJ_ENCODING_SKIPLIST: return "skiplist";
-    case OBJ_ENCODING_EMBSTR: return "embstr";
-    case OBJ_ENCODING_STREAM: return "stream";
-    default: return "unknown";
-    }
-}
-
-/* =========================== Memory introspection ========================= */
-
-
-/* This is an helper function with the goal of estimating the memory
- * size of a radix tree that is used to store Stream IDs.
- *
- * Note: to guess the size of the radix tree is not trivial, so we
- * approximate it considering 16 bytes of data overhead for each
- * key (the ID), and then adding the number of bare nodes, plus some
- * overhead due by the data and child pointers. This secret recipe
- * was obtained by checking the average radix tree created by real
- * workloads, and then adjusting the constants to get numbers that
- * more or less match the real memory usage.
- *
- * Actually the number of nodes and keys may be different depending
- * on the insertion speed and thus the ability of the radix tree
- * to compress prefixes. */
-size_t streamRadixTreeMemoryUsage(rax *rax) {
-    size_t size;
-    size = rax->numele * sizeof(streamID);
-    size += rax->numnodes * sizeof(raxNode);
-    /* Add a fixed overhead due to the aux data pointer, children, ... */
-    size += rax->numnodes * sizeof(long)*30;
-    return size;
-}
-
-/* Returns the size in bytes consumed by the key's value in RAM.
- * Note that the returned value is just an approximation, especially in the
- * case of aggregated data types where only "sample_size" elements
- * are checked and averaged to estimate the total size. */
-#define OBJ_COMPUTE_SIZE_DEF_SAMPLES 5 /* Default sample size. */
-size_t objectComputeSize(robj *o, size_t sample_size) {
-    sds ele, ele2;
-    dict *d;
-    dictIterator *di;
-    struct dictEntry *de;
-    size_t asize = 0, elesize = 0, samples = 0;
-
-    if (o->type == OBJ_STRING) {
-        if(o->encoding == OBJ_ENCODING_INT) {
-            asize = sizeof(*o);
-        } else if(o->encoding == OBJ_ENCODING_RAW) {
-            asize = sdsZmallocSize(o->ptr)+sizeof(*o);
-        } else if(o->encoding == OBJ_ENCODING_EMBSTR) {
-            asize = sdslen(o->ptr)+2+sizeof(*o);
-        } else {
-            serverPanic("Unknown string encoding");
-        }
-    } else if (o->type == OBJ_LIST) {
-        if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-            quicklist *ql = o->ptr;
-            quicklistNode *node = ql->head;
-            asize = sizeof(*o)+sizeof(quicklist);
-            do {
-                elesize += sizeof(quicklistNode)+ziplistBlobLen(node->zl);
-                samples++;
-            } while ((node = node->next) && samples < sample_size);
-            asize += (double)elesize/samples*ql->len;
-        } else if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            asize = sizeof(*o)+ziplistBlobLen(o->ptr);
-        } else {
-            serverPanic("Unknown list encoding");
-        }
-    } else if (o->type == OBJ_SET) {
-        if (o->encoding == OBJ_ENCODING_HT) {
-            d = o->ptr;
-            di = dictGetIterator(d);
-            asize = sizeof(*o)+sizeof(dict)+(sizeof(struct dictEntry*)*dictSlots(d));
-            while((de = dictNext(di)) != NULL && samples < sample_size) {
-                ele = dictGetKey(de);
-                elesize += sizeof(struct dictEntry) + sdsZmallocSize(ele);
-                samples++;
-            }
-            dictReleaseIterator(di);
-            if (samples) asize += (double)elesize/samples*dictSize(d);
-        } else if (o->encoding == OBJ_ENCODING_INTSET) {
-            intset *is = o->ptr;
-            asize = sizeof(*o)+sizeof(*is)+(size_t)is->encoding*is->length;
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (o->type == OBJ_ZSET) {
-        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            asize = sizeof(*o)+(ziplistBlobLen(o->ptr));
-        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
-            d = ((zset*)o->ptr)->dict;
-            zskiplist *zsl = ((zset*)o->ptr)->zsl;
-            zskiplistNode *znode = zsl->header->level[0].forward;
-            asize = sizeof(*o)+sizeof(zset)+sizeof(zskiplist)+sizeof(dict)+
-                    (sizeof(struct dictEntry*)*dictSlots(d))+
-                    zmalloc_size(zsl->header);
-            while(znode != NULL && samples < sample_size) {
-                elesize += sdsZmallocSize(znode->ele);
-                elesize += sizeof(struct dictEntry) + zmalloc_size(znode);
-                samples++;
-                znode = znode->level[0].forward;
-            }
-            if (samples) asize += (double)elesize/samples*dictSize(d);
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else if (o->type == OBJ_HASH) {
-        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            asize = sizeof(*o)+(ziplistBlobLen(o->ptr));
-        } else if (o->encoding == OBJ_ENCODING_HT) {
-            d = o->ptr;
-            di = dictGetIterator(d);
-            asize = sizeof(*o)+sizeof(dict)+(sizeof(struct dictEntry*)*dictSlots(d));
-            while((de = dictNext(di)) != NULL && samples < sample_size) {
-                ele = dictGetKey(de);
-                ele2 = dictGetVal(de);
-                elesize += sdsZmallocSize(ele) + sdsZmallocSize(ele2);
-                elesize += sizeof(struct dictEntry);
-                samples++;
-            }
-            dictReleaseIterator(di);
-            if (samples) asize += (double)elesize/samples*dictSize(d);
-        } else {
-            serverPanic("Unknown hash encoding");
-        }
-    } else if (o->type == OBJ_STREAM) {
-        stream *s = o->ptr;
-        asize = sizeof(*o)+sizeof(*s);
-        asize += streamRadixTreeMemoryUsage(s->rax);
-
-        /* Now we have to add the listpacks. The last listpack is often non
-         * complete, so we estimate the size of the first N listpacks, and
-         * use the average to compute the size of the first N-1 listpacks, and
-         * finally add the real size of the last node. */
-        raxIterator ri;
-        raxStart(&ri,s->rax);
-        raxSeek(&ri,"^",NULL,0);
-        size_t lpsize = 0, samples = 0;
-        while(samples < sample_size && raxNext(&ri)) {
-            unsigned char *lp = ri.data;
-            lpsize += lpBytes(lp);
-            samples++;
-        }
-        if (s->rax->numele <= samples) {
-            asize += lpsize;
-        } else {
-            if (samples) lpsize /= samples; /* Compute the average. */
-            asize += lpsize * (s->rax->numele-1);
-            /* No need to check if seek succeeded, we enter this branch only
-             * if there are a few elements in the radix tree. */
-            raxSeek(&ri,"$",NULL,0);
-            raxNext(&ri);
-            asize += lpBytes(ri.data);
-        }
-        raxStop(&ri);
-
-        /* Consumer groups also have a non trivial memory overhead if there
-         * are many consumers and many groups, let's count at least the
-         * overhead of the pending entries in the groups and consumers
-         * PELs. */
-        if (s->cgroups) {
-            raxStart(&ri,s->cgroups);
-            raxSeek(&ri,"^",NULL,0);
-            while(raxNext(&ri)) {
-                streamCG *cg = ri.data;
-                asize += sizeof(*cg);
-                asize += streamRadixTreeMemoryUsage(cg->pel);
-                asize += sizeof(streamNACK)*raxSize(cg->pel);
-
-                /* For each consumer we also need to add the basic data
-                 * structures and the PEL memory usage. */
-                raxIterator cri;
-                raxStart(&cri,cg->consumers);
-                raxSeek(&cri,"^",NULL,0);
-                while(raxNext(&cri)) {
-                    streamConsumer *consumer = cri.data;
-                    asize += sizeof(*consumer);
-                    asize += sdslen(consumer->name);
-                    asize += streamRadixTreeMemoryUsage(consumer->pel);
-                    /* Don't count NACKs again, they are shared with the
-                     * consumer group PEL. */
-                }
-                raxStop(&cri);
-            }
-            raxStop(&ri);
-        }
-    } else if (o->type == OBJ_MODULE) {
-        moduleValue *mv = o->ptr;
-        moduleType *mt = mv->type;
-        if (mt->mem_usage != NULL) {
-            asize = mt->mem_usage(mv->value);
-        } else {
-            asize = 0;
-        }
-    } else {
-        serverPanic("Unknown object type");
-    }
-    return asize;
-}
-
-/* Release data obtained with getMemoryOverheadData(). */
-void freeMemoryOverheadData(struct redisMemOverhead *mh) {
-    zfree(mh->db);
-    zfree(mh);
-}
-
-/* Return a struct redisMemOverhead filled with memory overhead
- * information used for the MEMORY OVERHEAD and INFO command. The returned
- * structure pointer should be freed calling freeMemoryOverheadData(). */
-struct redisMemOverhead *getMemoryOverheadData(void) {
-    int j;
-    size_t mem_total = 0;
-    size_t mem = 0;
-    size_t zmalloc_used = zmalloc_used_memory();
-    struct redisMemOverhead *mh = zcalloc(sizeof(*mh));
-
-    mh->total_allocated = zmalloc_used;
-    mh->startup_allocated = server.initial_memory_usage;
-    mh->peak_allocated = server.stat_peak_memory;
-    mh->total_frag =
-        (float)server.cron_malloc_stats.process_rss / server.cron_malloc_stats.zmalloc_used;
-    mh->total_frag_bytes =
-        server.cron_malloc_stats.process_rss - server.cron_malloc_stats.zmalloc_used;
-    mh->allocator_frag =
-        (float)server.cron_malloc_stats.allocator_active / server.cron_malloc_stats.allocator_allocated;
-    mh->allocator_frag_bytes =
-        server.cron_malloc_stats.allocator_active - server.cron_malloc_stats.allocator_allocated;
-    mh->allocator_rss =
-        (float)server.cron_malloc_stats.allocator_resident / server.cron_malloc_stats.allocator_active;
-    mh->allocator_rss_bytes =
-        server.cron_malloc_stats.allocator_resident - server.cron_malloc_stats.allocator_active;
-    mh->rss_extra =
-        (float)server.cron_malloc_stats.process_rss / server.cron_malloc_stats.allocator_resident;
-    mh->rss_extra_bytes =
-        server.cron_malloc_stats.process_rss - server.cron_malloc_stats.allocator_resident;
-
-    mem_total += server.initial_memory_usage;
-
-    mem = 0;
-    if (server.repl_backlog)
-        mem += zmalloc_size(server.repl_backlog);
-    mh->repl_backlog = mem;
-    mem_total += mem;
-
-    /* Computing the memory used by the clients would be O(N) if done
-     * here online. We use our values computed incrementally by
-     * clientsCronTrackClientsMemUsage(). */
-    mh->clients_slaves = server.stat_clients_type_memory[CLIENT_TYPE_SLAVE];
-    mh->clients_normal = server.stat_clients_type_memory[CLIENT_TYPE_MASTER]+
-                         server.stat_clients_type_memory[CLIENT_TYPE_PUBSUB]+
-                         server.stat_clients_type_memory[CLIENT_TYPE_NORMAL];
-    mem_total += mh->clients_slaves;
-    mem_total += mh->clients_normal;
-
-    mem = 0;
-    if (server.aof_state != AOF_OFF) {
-        mem += sdsZmallocSize(server.aof_buf);
-        mem += aofRewriteBufferSize();
-    }
-    mh->aof_buffer = mem;
-    mem_total+=mem;
-
-    mem = server.lua_scripts_mem;
-    mem += dictSize(server.lua_scripts) * sizeof(dictEntry) +
-        dictSlots(server.lua_scripts) * sizeof(dictEntry*);
-    mem += dictSize(server.repl_scriptcache_dict) * sizeof(dictEntry) +
-        dictSlots(server.repl_scriptcache_dict) * sizeof(dictEntry*);
-    if (listLength(server.repl_scriptcache_fifo) > 0) {
-        mem += listLength(server.repl_scriptcache_fifo) * (sizeof(listNode) +
-            sdsZmallocSize(listNodeValue(listFirst(server.repl_scriptcache_fifo))));
-    }
-    mh->lua_caches = mem;
-    mem_total+=mem;
-
-    for (j = 0; j < server.dbnum; j++) {
-        redisDb *db = server.db+j;
-        long long keyscount = dictSize(db->dict);
-        if (keyscount==0) continue;
-
-        mh->total_keys += keyscount;
-        mh->db = zrealloc(mh->db,sizeof(mh->db[0])*(mh->num_dbs+1));
-        mh->db[mh->num_dbs].dbid = j;
-
-        mem = dictSize(db->dict) * sizeof(dictEntry) +
-              dictSlots(db->dict) * sizeof(dictEntry*) +
-              dictSize(db->dict) * sizeof(robj);
-        mh->db[mh->num_dbs].overhead_ht_main = mem;
-        mem_total+=mem;
-
-        mem = dictSize(db->expires) * sizeof(dictEntry) +
-              dictSlots(db->expires) * sizeof(dictEntry*);
-        mh->db[mh->num_dbs].overhead_ht_expires = mem;
-        mem_total+=mem;
-
-        mh->num_dbs++;
-    }
-
-    mh->overhead_total = mem_total;
-    mh->dataset = zmalloc_used - mem_total;
-    mh->peak_perc = (float)zmalloc_used*100/mh->peak_allocated;
-
-    /* Metrics computed after subtracting the startup memory from
-     * the total memory. */
-    size_t net_usage = 1;
-    if (zmalloc_used > mh->startup_allocated)
-        net_usage = zmalloc_used - mh->startup_allocated;
-    mh->dataset_perc = (float)mh->dataset*100/net_usage;
-    mh->bytes_per_key = mh->total_keys ? (net_usage / mh->total_keys) : 0;
-
-    return mh;
-}
-
-/* Helper for "MEMORY allocator-stats", used as a callback for the jemalloc
- * stats output. */
-void inputCatSds(void *result, const char *str) {
-    /* result is actually a (sds *), so re-cast it here */
-    sds *info = (sds *)result;
-    *info = sdscat(*info, str);
-}
-
-/* This implements MEMORY DOCTOR. An human readable analysis of the Redis
- * memory condition. */
-sds getMemoryDoctorReport(void) {
-    int empty = 0;          /* Instance is empty or almost empty. */
-    int big_peak = 0;       /* Memory peak is much larger than used mem. */
-    int high_frag = 0;      /* High fragmentation. */
-    int high_alloc_frag = 0;/* High allocator fragmentation. */
-    int high_proc_rss = 0;  /* High process rss overhead. */
-    int high_alloc_rss = 0; /* High rss overhead. */
-    int big_slave_buf = 0;  /* Slave buffers are too big. */
-    int big_client_buf = 0; /* Client buffers are too big. */
-    int many_scripts = 0;   /* Script cache has too many scripts. */
-    int num_reports = 0;
-    struct redisMemOverhead *mh = getMemoryOverheadData();
-
-    if (mh->total_allocated < (1024*1024*5)) {
-        empty = 1;
-        num_reports++;
-    } else {
-        /* Peak is > 150% of current used memory? */
-        if (((float)mh->peak_allocated / mh->total_allocated) > 1.5) {
-            big_peak = 1;
-            num_reports++;
-        }
-
-        /* Fragmentation is higher than 1.4 and 10MB ?*/
-        if (mh->total_frag > 1.4 && mh->total_frag_bytes > 10<<20) {
-            high_frag = 1;
-            num_reports++;
-        }
-
-        /* External fragmentation is higher than 1.1 and 10MB? */
-        if (mh->allocator_frag > 1.1 && mh->allocator_frag_bytes > 10<<20) {
-            high_alloc_frag = 1;
-            num_reports++;
-        }
-
-        /* Allocator rss is higher than 1.1 and 10MB ? */
-        if (mh->allocator_rss > 1.1 && mh->allocator_rss_bytes > 10<<20) {
-            high_alloc_rss = 1;
-            num_reports++;
-        }
-
-        /* Non-Allocator rss is higher than 1.1 and 10MB ? */
-        if (mh->rss_extra > 1.1 && mh->rss_extra_bytes > 10<<20) {
-            high_proc_rss = 1;
-            num_reports++;
-        }
-
-        /* Clients using more than 200k each average? */
-        long numslaves = listLength(server.slaves);
-        long numclients = listLength(server.clients)-numslaves;
-        if (mh->clients_normal / numclients > (1024*200)) {
-            big_client_buf = 1;
-            num_reports++;
-        }
-
-        /* Slaves using more than 10 MB each? */
-        if (numslaves > 0 && mh->clients_slaves / numslaves > (1024*1024*10)) {
-            big_slave_buf = 1;
-            num_reports++;
-        }
-
-        /* Too many scripts are cached? */
-        if (dictSize(server.lua_scripts) > 1000) {
-            many_scripts = 1;
-            num_reports++;
-        }
-    }
-
-    sds s;
-    if (num_reports == 0) {
-        s = sdsnew(
-        "Hi Sam, I can't find any memory issue in your instance. "
-        "I can only account for what occurs on this base.\n");
-    } else if (empty == 1) {
-        s = sdsnew(
-        "Hi Sam, this instance is empty or is using very little memory, "
-        "my issues detector can't be used in these conditions. "
-        "Please, leave for your mission on Earth and fill it with some data. "
-        "The new Sam and I will be back to our programming as soon as I "
-        "finished rebooting.\n");
-    } else {
-        s = sdsnew("Sam, I detected a few issues in this Redis instance memory implants:\n\n");
-        if (big_peak) {
-            s = sdscat(s," * Peak memory: In the past this instance used more than 150% the memory that is currently using. The allocator is normally not able to release memory after a peak, so you can expect to see a big fragmentation ratio, however this is actually harmless and is only due to the memory peak, and if the Redis instance Resident Set Size (RSS) is currently bigger than expected, the memory will be used as soon as you fill the Redis instance with more data. If the memory peak was only occasional and you want to try to reclaim memory, please try the MEMORY PURGE command, otherwise the only other option is to shutdown and restart the instance.\n\n");
-        }
-        if (high_frag) {
-            s = sdscatprintf(s," * High total RSS: This instance has a memory fragmentation and RSS overhead greater than 1.4 (this means that the Resident Set Size of the Redis process is much larger than the sum of the logical allocations Redis performed). This problem is usually due either to a large peak memory (check if there is a peak memory entry above in the report) or may result from a workload that causes the allocator to fragment memory a lot. If the problem is a large peak memory, then there is no issue. Otherwise, make sure you are using the Jemalloc allocator and not the default libc malloc. Note: The currently used allocator is \"%s\".\n\n", ZMALLOC_LIB);
-        }
-        if (high_alloc_frag) {
-            s = sdscatprintf(s," * High allocator fragmentation: This instance has an allocator external fragmentation greater than 1.1. This problem is usually due either to a large peak memory (check if there is a peak memory entry above in the report) or may result from a workload that causes the allocator to fragment memory a lot. You can try enabling 'activedefrag' config option.\n\n");
-        }
-        if (high_alloc_rss) {
-            s = sdscatprintf(s," * High allocator RSS overhead: This instance has an RSS memory overhead is greater than 1.1 (this means that the Resident Set Size of the allocator is much larger than the sum what the allocator actually holds). This problem is usually due to a large peak memory (check if there is a peak memory entry above in the report), you can try the MEMORY PURGE command to reclaim it.\n\n");
-        }
-        if (high_proc_rss) {
-            s = sdscatprintf(s," * High process RSS overhead: This instance has non-allocator RSS memory overhead is greater than 1.1 (this means that the Resident Set Size of the Redis process is much larger than the RSS the allocator holds). This problem may be due to Lua scripts or Modules.\n\n");
-        }
-        if (big_slave_buf) {
-            s = sdscat(s," * Big replica buffers: The replica output buffers in this instance are greater than 10MB for each replica (on average). This likely means that there is some replica instance that is struggling receiving data, either because it is too slow or because of networking issues. As a result, data piles on the master output buffers. Please try to identify what replica is not receiving data correctly and why. You can use the INFO output in order to check the replicas delays and the CLIENT LIST command to check the output buffers of each replica.\n\n");
-        }
-        if (big_client_buf) {
-            s = sdscat(s," * Big client buffers: The clients output buffers in this instance are greater than 200K per client (on average). This may result from different causes, like Pub/Sub clients subscribed to channels bot not receiving data fast enough, so that data piles on the Redis instance output buffer, or clients sending commands with large replies or very large sequences of commands in the same pipeline. Please use the CLIENT LIST command in order to investigate the issue if it causes problems in your instance, or to understand better why certain clients are using a big amount of memory.\n\n");
-        }
-        if (many_scripts) {
-            s = sdscat(s," * Many scripts: There seem to be many cached scripts in this instance (more than 1000). This may be because scripts are generated and `EVAL`ed, instead of being parameterized (with KEYS and ARGV), `SCRIPT LOAD`ed and `EVALSHA`ed. Unless `SCRIPT FLUSH` is called periodically, the scripts' caches may end up consuming most of your memory.\n\n");
-        }
-        s = sdscat(s,"I'm here to keep you safe, Sam. I want to help you.\n");
-    }
-    freeMemoryOverheadData(mh);
-    return s;
-}
-
-/* Set the object LRU/LFU depending on server.maxmemory_policy.
- * The lfu_freq arg is only relevant if policy is MAXMEMORY_FLAG_LFU.
- * The lru_idle and lru_clock args are only relevant if policy
- * is MAXMEMORY_FLAG_LRU.
- * Either or both of them may be <0, in that case, nothing is set. */
-int objectSetLRUOrLFU(robj *val, long long lfu_freq, long long lru_idle,
-                       long long lru_clock, int lru_multiplier) {
-    if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-        if (lfu_freq >= 0) {
-            serverAssert(lfu_freq <= 255);
-            val->lru = (LFUGetTimeInMinutes()<<8) | lfu_freq;
-            return 1;
-        }
-    } else if (lru_idle >= 0) {
-        /* Provided LRU idle time is in seconds. Scale
-         * according to the LRU clock resolution this Redis
-         * instance was compiled with (normally 1000 ms, so the
-         * below statement will expand to lru_idle*1000/1000. */
-        lru_idle = lru_idle*lru_multiplier/LRU_CLOCK_RESOLUTION;
-        long lru_abs = lru_clock - lru_idle; /* Absolute access time. */
-        /* If the LRU field underflows (since LRU it is a wrapping
-         * clock), the best we can do is to provide a large enough LRU
-         * that is half-way in the circlular LRU clock we use: this way
-         * the computed idle time for this object will stay high for quite
-         * some time. */
-        if (lru_abs < 0)
-            lru_abs = (lru_clock+(LRU_CLOCK_MAX/2)) % LRU_CLOCK_MAX;
-        val->lru = lru_abs;
-        return 1;
-    }
-    return 0;
-}
-
-/* ======================= The OBJECT and MEMORY commands =================== */
-
-/* This is a helper function for the OBJECT command. We need to lookup keys
- * without any modification of LRU or other parameters. */
-robj *objectCommandLookup(client *c, robj *key) {
-    return lookupKeyReadWithFlags(c->db,key,LOOKUP_NOTOUCH|LOOKUP_NONOTIFY);
-}
-
-robj *objectCommandLookupOrReply(client *c, robj *key, robj *reply) {
-    robj *o = objectCommandLookup(c,key);
-    if (!o) SentReplyOnKeyMiss(c, reply);
-    return o;
-}
-
-/* Object command allows to inspect the internals of a Redis Object.
- * Usage: OBJECT <refcount|encoding|idletime|freq> <key> */
-void objectCommand(client *c) {
-    robj *o;
-
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"ENCODING <key>",
-"    Return the kind of internal representation used in order to store the value",
-"    associated with a <key>.",
-"FREQ <key>",
-"    Return the access frequency index of the <key>. The returned integer is",
-"    proportional to the logarithm of the recent access frequency of the key.",
-"IDLETIME <key>",
-"    Return the idle time of the <key>, that is the approximated number of",
-"    seconds elapsed since the last access to the key.",
-"REFCOUNT <key>",
-"    Return the number of references of the value associated with the specified",
-"    <key>.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"refcount") && c->argc == 3) {
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
-                == NULL) return;
-        addReplyLongLong(c,o->refcount);
-    } else if (!strcasecmp(c->argv[1]->ptr,"encoding") && c->argc == 3) {
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
-                == NULL) return;
-        addReplyBulkCString(c,strEncoding(o->encoding));
-    } else if (!strcasecmp(c->argv[1]->ptr,"idletime") && c->argc == 3) {
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
-                == NULL) return;
-        if (server.maxmemory_policy & MAXMEMORY_FLAG_LFU) {
-            addReplyError(c,"An LFU maxmemory policy is selected, idle time not tracked. Please note that when switching between policies at runtime LRU and LFU data will take some time to adjust.");
-            return;
-        }
-        addReplyLongLong(c,estimateObjectIdleTime(o)/1000);
-    } else if (!strcasecmp(c->argv[1]->ptr,"freq") && c->argc == 3) {
-        if ((o = objectCommandLookupOrReply(c,c->argv[2],shared.null[c->resp]))
-                == NULL) return;
-        if (!(server.maxmemory_policy & MAXMEMORY_FLAG_LFU)) {
-            addReplyError(c,"An LFU maxmemory policy is not selected, access frequency not tracked. Please note that when switching between policies at runtime LRU and LFU data will take some time to adjust.");
-            return;
-        }
-        /* LFUDecrAndReturn should be called
-         * in case of the key has not been accessed for a long time,
-         * because we update the access time only
-         * when the key is read or overwritten. */
-        addReplyLongLong(c,LFUDecrAndReturn(o));
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* The memory command will eventually be a complete interface for the
- * memory introspection capabilities of Redis.
- *
- * Usage: MEMORY usage <key> */
-void memoryCommand(client *c) {
-    if (!strcasecmp(c->argv[1]->ptr,"help") && c->argc == 2) {
-        const char *help[] = {
-"DOCTOR",
-"    Return memory problems reports.",
-"MALLOC-STATS"
-"    Return internal statistics report from the memory allocator.",
-"PURGE",
-"    Attempt to purge dirty pages for reclamation by the allocator.",
-"STATS",
-"    Return information about the memory usage of the server.",
-"USAGE <key> [SAMPLES <count>]",
-"    Return memory in bytes used by <key> and its value. Nested values are",
-"    sampled up to <count> times (default: 5).",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"usage") && c->argc >= 3) {
-        dictEntry *de;
-        long long samples = OBJ_COMPUTE_SIZE_DEF_SAMPLES;
-        for (int j = 3; j < c->argc; j++) {
-            if (!strcasecmp(c->argv[j]->ptr,"samples") &&
-                j+1 < c->argc)
-            {
-                if (getLongLongFromObjectOrReply(c,c->argv[j+1],&samples,NULL)
-                     == C_ERR) return;
-                if (samples < 0) {
-                    addReplyErrorObject(c,shared.syntaxerr);
-                    return;
-                }
-                if (samples == 0) samples = LLONG_MAX;
-                j++; /* skip option argument. */
-            } else {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-        if ((de = dictFind(c->db->dict,c->argv[2]->ptr)) == NULL) {
-            addReplyNull(c);
-            return;
-        }
-        size_t usage = objectComputeSize(dictGetVal(de),samples);
-        usage += sdsZmallocSize(dictGetKey(de));
-        usage += sizeof(dictEntry);
-        addReplyLongLong(c,usage);
-    } else if (!strcasecmp(c->argv[1]->ptr,"stats") && c->argc == 2) {
-        struct redisMemOverhead *mh = getMemoryOverheadData();
-
-        addReplyMapLen(c,25+mh->num_dbs);
-
-        addReplyBulkCString(c,"peak.allocated");
-        addReplyLongLong(c,mh->peak_allocated);
-
-        addReplyBulkCString(c,"total.allocated");
-        addReplyLongLong(c,mh->total_allocated);
-
-        addReplyBulkCString(c,"startup.allocated");
-        addReplyLongLong(c,mh->startup_allocated);
-
-        addReplyBulkCString(c,"replication.backlog");
-        addReplyLongLong(c,mh->repl_backlog);
-
-        addReplyBulkCString(c,"clients.slaves");
-        addReplyLongLong(c,mh->clients_slaves);
-
-        addReplyBulkCString(c,"clients.normal");
-        addReplyLongLong(c,mh->clients_normal);
-
-        addReplyBulkCString(c,"aof.buffer");
-        addReplyLongLong(c,mh->aof_buffer);
-
-        addReplyBulkCString(c,"lua.caches");
-        addReplyLongLong(c,mh->lua_caches);
-
-        for (size_t j = 0; j < mh->num_dbs; j++) {
-            char dbname[32];
-            snprintf(dbname,sizeof(dbname),"db.%zd",mh->db[j].dbid);
-            addReplyBulkCString(c,dbname);
-            addReplyMapLen(c,2);
-
-            addReplyBulkCString(c,"overhead.hashtable.main");
-            addReplyLongLong(c,mh->db[j].overhead_ht_main);
-
-            addReplyBulkCString(c,"overhead.hashtable.expires");
-            addReplyLongLong(c,mh->db[j].overhead_ht_expires);
-        }
-
-        addReplyBulkCString(c,"overhead.total");
-        addReplyLongLong(c,mh->overhead_total);
-
-        addReplyBulkCString(c,"keys.count");
-        addReplyLongLong(c,mh->total_keys);
-
-        addReplyBulkCString(c,"keys.bytes-per-key");
-        addReplyLongLong(c,mh->bytes_per_key);
-
-        addReplyBulkCString(c,"dataset.bytes");
-        addReplyLongLong(c,mh->dataset);
-
-        addReplyBulkCString(c,"dataset.percentage");
-        addReplyDouble(c,mh->dataset_perc);
-
-        addReplyBulkCString(c,"peak.percentage");
-        addReplyDouble(c,mh->peak_perc);
-
-        addReplyBulkCString(c,"allocator.allocated");
-        addReplyLongLong(c,server.cron_malloc_stats.allocator_allocated);
-
-        addReplyBulkCString(c,"allocator.active");
-        addReplyLongLong(c,server.cron_malloc_stats.allocator_active);
-
-        addReplyBulkCString(c,"allocator.resident");
-        addReplyLongLong(c,server.cron_malloc_stats.allocator_resident);
-
-        addReplyBulkCString(c,"allocator-fragmentation.ratio");
-        addReplyDouble(c,mh->allocator_frag);
-
-        addReplyBulkCString(c,"allocator-fragmentation.bytes");
-        addReplyLongLong(c,mh->allocator_frag_bytes);
-
-        addReplyBulkCString(c,"allocator-rss.ratio");
-        addReplyDouble(c,mh->allocator_rss);
-
-        addReplyBulkCString(c,"allocator-rss.bytes");
-        addReplyLongLong(c,mh->allocator_rss_bytes);
-
-        addReplyBulkCString(c,"rss-overhead.ratio");
-        addReplyDouble(c,mh->rss_extra);
-
-        addReplyBulkCString(c,"rss-overhead.bytes");
-        addReplyLongLong(c,mh->rss_extra_bytes);
-
-        addReplyBulkCString(c,"fragmentation"); /* this is the total RSS overhead, including fragmentation */
-        addReplyDouble(c,mh->total_frag); /* it is kept here for backwards compatibility */
-
-        addReplyBulkCString(c,"fragmentation.bytes");
-        addReplyLongLong(c,mh->total_frag_bytes);
-
-        freeMemoryOverheadData(mh);
-    } else if (!strcasecmp(c->argv[1]->ptr,"malloc-stats") && c->argc == 2) {
-#if defined(USE_JEMALLOC)
-        sds info = sdsempty();
-        je_malloc_stats_print(inputCatSds, &info, NULL);
-        addReplyVerbatim(c,info,sdslen(info),"txt");
-        sdsfree(info);
-#else
-        addReplyBulkCString(c,"Stats not supported for the current allocator");
-#endif
-    } else if (!strcasecmp(c->argv[1]->ptr,"doctor") && c->argc == 2) {
-        sds report = getMemoryDoctorReport();
-        addReplyVerbatim(c,report,sdslen(report),"txt");
-        sdsfree(report);
-    } else if (!strcasecmp(c->argv[1]->ptr,"purge") && c->argc == 2) {
-        if (jemalloc_purge() == 0)
-            addReply(c, shared.ok);
-        else
-            addReplyError(c, "Error purging dirty pages");
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
diff --git a/redis-stable/src/pqsort.c b/redis-stable/src/pqsort.c
deleted file mode 100644
index 508c09f9..00000000
--- a/redis-stable/src/pqsort.c
+++ /dev/null
@@ -1,185 +0,0 @@
-/* The following is the NetBSD libc qsort implementation modified in order to
- * support partial sorting of ranges for Redis.
- *
- * Copyright(C) 2009-2012 Salvatore Sanfilippo. All rights reserved.
- *
- * The original copyright notice follows. */
-
-
-/*	$NetBSD: qsort.c,v 1.19 2009/01/30 23:38:44 lukem Exp $	*/
-
-/*-
- * Copyright (c) 1992, 1993
- *	The Regents of the University of California.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. Neither the name of the University nor the names of its contributors
- *    may be used to endorse or promote products derived from this software
- *    without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-#include <sys/types.h>
-
-#include <errno.h>
-#include <stdlib.h>
-
-static inline char	*med3 (char *, char *, char *,
-    int (*)(const void *, const void *));
-static inline void	 swapfunc (char *, char *, size_t, int);
-
-#define min(a, b)	(a) < (b) ? a : b
-
-/*
- * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
- */
-#define swapcode(TYPE, parmi, parmj, n) { 		\
-	size_t i = (n) / sizeof (TYPE); 		\
-	TYPE *pi = (TYPE *)(void *)(parmi); 		\
-	TYPE *pj = (TYPE *)(void *)(parmj); 		\
-	do { 						\
-		TYPE	t = *pi;			\
-		*pi++ = *pj;				\
-		*pj++ = t;				\
-        } while (--i > 0);				\
-}
-
-#define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \
-	es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1;
-
-static inline void
-swapfunc(char *a, char *b, size_t n, int swaptype)
-{
-
-	if (swaptype <= 1)
-		swapcode(long, a, b, n)
-	else
-		swapcode(char, a, b, n)
-}
-
-#define swap(a, b)						\
-	if (swaptype == 0) {					\
-		long t = *(long *)(void *)(a);			\
-		*(long *)(void *)(a) = *(long *)(void *)(b);	\
-		*(long *)(void *)(b) = t;			\
-	} else							\
-		swapfunc(a, b, es, swaptype)
-
-#define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype)
-
-static inline char *
-med3(char *a, char *b, char *c,
-    int (*cmp) (const void *, const void *))
-{
-
-	return cmp(a, b) < 0 ?
-	       (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
-              :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
-}
-
-static void
-_pqsort(void *a, size_t n, size_t es,
-    int (*cmp) (const void *, const void *), void *lrange, void *rrange)
-{
-	char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
-	size_t d, r;
-	int swaptype, cmp_result;
-
-loop:	SWAPINIT(a, es);
-	if (n < 7) {
-		for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es)
-			for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
-			     pl -= es)
-				swap(pl, pl - es);
-		return;
-	}
-	pm = (char *) a + (n / 2) * es;
-	if (n > 7) {
-		pl = (char *) a;
-		pn = (char *) a + (n - 1) * es;
-		if (n > 40) {
-			d = (n / 8) * es;
-			pl = med3(pl, pl + d, pl + 2 * d, cmp);
-			pm = med3(pm - d, pm, pm + d, cmp);
-			pn = med3(pn - 2 * d, pn - d, pn, cmp);
-		}
-		pm = med3(pl, pm, pn, cmp);
-	}
-	swap(a, pm);
-	pa = pb = (char *) a + es;
-
-	pc = pd = (char *) a + (n - 1) * es;
-	for (;;) {
-		while (pb <= pc && (cmp_result = cmp(pb, a)) <= 0) {
-			if (cmp_result == 0) {
-				swap(pa, pb);
-				pa += es;
-			}
-			pb += es;
-		}
-		while (pb <= pc && (cmp_result = cmp(pc, a)) >= 0) {
-			if (cmp_result == 0) {
-				swap(pc, pd);
-				pd -= es;
-			}
-			pc -= es;
-		}
-		if (pb > pc)
-			break;
-		swap(pb, pc);
-		pb += es;
-		pc -= es;
-	}
-
-	pn = (char *) a + n * es;
-	r = min(pa - (char *) a, pb - pa);
-	vecswap(a, pb - r, r);
-	r = min((size_t)(pd - pc), pn - pd - es);
-	vecswap(pb, pn - r, r);
-	if ((r = pb - pa) > es) {
-                void *_l = a, *_r = ((unsigned char*)a)+r-1;
-                if (!((lrange < _l && rrange < _l) ||
-                    (lrange > _r && rrange > _r)))
-		    _pqsort(a, r / es, es, cmp, lrange, rrange);
-        }
-	if ((r = pd - pc) > es) {
-                void *_l, *_r;
-
-		/* Iterate rather than recurse to save stack space */
-		a = pn - r;
-		n = r / es;
-
-                _l = a;
-                _r = ((unsigned char*)a)+r-1;
-                if (!((lrange < _l && rrange < _l) ||
-                    (lrange > _r && rrange > _r)))
-		    goto loop;
-	}
-/*		qsort(pn - r, r / es, es, cmp);*/
-}
-
-void
-pqsort(void *a, size_t n, size_t es,
-    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange)
-{
-    _pqsort(a,n,es,cmp,((unsigned char*)a)+(lrange*es),
-                       ((unsigned char*)a)+((rrange+1)*es)-1);
-}
diff --git a/redis-stable/src/pqsort.h b/redis-stable/src/pqsort.h
deleted file mode 100644
index 824ab5c0..00000000
--- a/redis-stable/src/pqsort.h
+++ /dev/null
@@ -1,40 +0,0 @@
-/* The following is the NetBSD libc qsort implementation modified in order to
- * support partial sorting of ranges for Redis.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- *
- * See the pqsort.c file for the original copyright notice. */
-
-#ifndef __PQSORT_H
-#define __PQSORT_H
-
-void
-pqsort(void *a, size_t n, size_t es,
-    int (*cmp) (const void *, const void *), size_t lrange, size_t rrange);
-
-#endif
diff --git a/redis-stable/src/pubsub.c b/redis-stable/src/pubsub.c
deleted file mode 100644
index 3409deac..00000000
--- a/redis-stable/src/pubsub.c
+++ /dev/null
@@ -1,469 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-int clientSubscriptionsCount(client *c);
-
-/*-----------------------------------------------------------------------------
- * Pubsub client replies API
- *----------------------------------------------------------------------------*/
-
-/* Send a pubsub message of type "message" to the client.
- * Normally 'msg' is a Redis object containing the string to send as
- * message. However if the caller sets 'msg' as NULL, it will be able
- * to send a special message (for instance an Array type) by using the
- * addReply*() API family. */
-void addReplyPubsubMessage(client *c, robj *channel, robj *msg) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[3]);
-    else
-        addReplyPushLen(c,3);
-    addReply(c,shared.messagebulk);
-    addReplyBulk(c,channel);
-    if (msg) addReplyBulk(c,msg);
-}
-
-/* Send a pubsub message of type "pmessage" to the client. The difference
- * with the "message" type delivered by addReplyPubsubMessage() is that
- * this message format also includes the pattern that matched the message. */
-void addReplyPubsubPatMessage(client *c, robj *pat, robj *channel, robj *msg) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[4]);
-    else
-        addReplyPushLen(c,4);
-    addReply(c,shared.pmessagebulk);
-    addReplyBulk(c,pat);
-    addReplyBulk(c,channel);
-    addReplyBulk(c,msg);
-}
-
-/* Send the pubsub subscription notification to the client. */
-void addReplyPubsubSubscribed(client *c, robj *channel) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[3]);
-    else
-        addReplyPushLen(c,3);
-    addReply(c,shared.subscribebulk);
-    addReplyBulk(c,channel);
-    addReplyLongLong(c,clientSubscriptionsCount(c));
-}
-
-/* Send the pubsub unsubscription notification to the client.
- * Channel can be NULL: this is useful when the client sends a mass
- * unsubscribe command but there are no channels to unsubscribe from: we
- * still send a notification. */
-void addReplyPubsubUnsubscribed(client *c, robj *channel) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[3]);
-    else
-        addReplyPushLen(c,3);
-    addReply(c,shared.unsubscribebulk);
-    if (channel)
-        addReplyBulk(c,channel);
-    else
-        addReplyNull(c);
-    addReplyLongLong(c,clientSubscriptionsCount(c));
-}
-
-/* Send the pubsub pattern subscription notification to the client. */
-void addReplyPubsubPatSubscribed(client *c, robj *pattern) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[3]);
-    else
-        addReplyPushLen(c,3);
-    addReply(c,shared.psubscribebulk);
-    addReplyBulk(c,pattern);
-    addReplyLongLong(c,clientSubscriptionsCount(c));
-}
-
-/* Send the pubsub pattern unsubscription notification to the client.
- * Pattern can be NULL: this is useful when the client sends a mass
- * punsubscribe command but there are no pattern to unsubscribe from: we
- * still send a notification. */
-void addReplyPubsubPatUnsubscribed(client *c, robj *pattern) {
-    if (c->resp == 2)
-        addReply(c,shared.mbulkhdr[3]);
-    else
-        addReplyPushLen(c,3);
-    addReply(c,shared.punsubscribebulk);
-    if (pattern)
-        addReplyBulk(c,pattern);
-    else
-        addReplyNull(c);
-    addReplyLongLong(c,clientSubscriptionsCount(c));
-}
-
-/*-----------------------------------------------------------------------------
- * Pubsub low level API
- *----------------------------------------------------------------------------*/
-
-/* Return the number of channels + patterns a client is subscribed to. */
-int clientSubscriptionsCount(client *c) {
-    return dictSize(c->pubsub_channels)+
-           listLength(c->pubsub_patterns);
-}
-
-/* Subscribe a client to a channel. Returns 1 if the operation succeeded, or
- * 0 if the client was already subscribed to that channel. */
-int pubsubSubscribeChannel(client *c, robj *channel) {
-    dictEntry *de;
-    list *clients = NULL;
-    int retval = 0;
-
-    /* Add the channel to the client -> channels hash table */
-    if (dictAdd(c->pubsub_channels,channel,NULL) == DICT_OK) {
-        retval = 1;
-        incrRefCount(channel);
-        /* Add the client to the channel -> list of clients hash table */
-        de = dictFind(server.pubsub_channels,channel);
-        if (de == NULL) {
-            clients = listCreate();
-            dictAdd(server.pubsub_channels,channel,clients);
-            incrRefCount(channel);
-        } else {
-            clients = dictGetVal(de);
-        }
-        listAddNodeTail(clients,c);
-    }
-    /* Notify the client */
-    addReplyPubsubSubscribed(c,channel);
-    return retval;
-}
-
-/* Unsubscribe a client from a channel. Returns 1 if the operation succeeded, or
- * 0 if the client was not subscribed to the specified channel. */
-int pubsubUnsubscribeChannel(client *c, robj *channel, int notify) {
-    dictEntry *de;
-    list *clients;
-    listNode *ln;
-    int retval = 0;
-
-    /* Remove the channel from the client -> channels hash table */
-    incrRefCount(channel); /* channel may be just a pointer to the same object
-                            we have in the hash tables. Protect it... */
-    if (dictDelete(c->pubsub_channels,channel) == DICT_OK) {
-        retval = 1;
-        /* Remove the client from the channel -> clients list hash table */
-        de = dictFind(server.pubsub_channels,channel);
-        serverAssertWithInfo(c,NULL,de != NULL);
-        clients = dictGetVal(de);
-        ln = listSearchKey(clients,c);
-        serverAssertWithInfo(c,NULL,ln != NULL);
-        listDelNode(clients,ln);
-        if (listLength(clients) == 0) {
-            /* Free the list and associated hash entry at all if this was
-             * the latest client, so that it will be possible to abuse
-             * Redis PUBSUB creating millions of channels. */
-            dictDelete(server.pubsub_channels,channel);
-        }
-    }
-    /* Notify the client */
-    if (notify) addReplyPubsubUnsubscribed(c,channel);
-    decrRefCount(channel); /* it is finally safe to release it */
-    return retval;
-}
-
-/* Subscribe a client to a pattern. Returns 1 if the operation succeeded, or 0 if the client was already subscribed to that pattern. */
-int pubsubSubscribePattern(client *c, robj *pattern) {
-    dictEntry *de;
-    list *clients;
-    int retval = 0;
-
-    if (listSearchKey(c->pubsub_patterns,pattern) == NULL) {
-        retval = 1;
-        listAddNodeTail(c->pubsub_patterns,pattern);
-        incrRefCount(pattern);
-        /* Add the client to the pattern -> list of clients hash table */
-        de = dictFind(server.pubsub_patterns,pattern);
-        if (de == NULL) {
-            clients = listCreate();
-            dictAdd(server.pubsub_patterns,pattern,clients);
-            incrRefCount(pattern);
-        } else {
-            clients = dictGetVal(de);
-        }
-        listAddNodeTail(clients,c);
-    }
-    /* Notify the client */
-    addReplyPubsubPatSubscribed(c,pattern);
-    return retval;
-}
-
-/* Unsubscribe a client from a channel. Returns 1 if the operation succeeded, or
- * 0 if the client was not subscribed to the specified channel. */
-int pubsubUnsubscribePattern(client *c, robj *pattern, int notify) {
-    dictEntry *de;
-    list *clients;
-    listNode *ln;
-    int retval = 0;
-
-    incrRefCount(pattern); /* Protect the object. May be the same we remove */
-    if ((ln = listSearchKey(c->pubsub_patterns,pattern)) != NULL) {
-        retval = 1;
-        listDelNode(c->pubsub_patterns,ln);
-        /* Remove the client from the pattern -> clients list hash table */
-        de = dictFind(server.pubsub_patterns,pattern);
-        serverAssertWithInfo(c,NULL,de != NULL);
-        clients = dictGetVal(de);
-        ln = listSearchKey(clients,c);
-        serverAssertWithInfo(c,NULL,ln != NULL);
-        listDelNode(clients,ln);
-        if (listLength(clients) == 0) {
-            /* Free the list and associated hash entry at all if this was
-             * the latest client. */
-            dictDelete(server.pubsub_patterns,pattern);
-        }
-    }
-    /* Notify the client */
-    if (notify) addReplyPubsubPatUnsubscribed(c,pattern);
-    decrRefCount(pattern);
-    return retval;
-}
-
-/* Unsubscribe from all the channels. Return the number of channels the
- * client was subscribed to. */
-int pubsubUnsubscribeAllChannels(client *c, int notify) {
-    int count = 0;
-    if (dictSize(c->pubsub_channels) > 0) {
-        dictIterator *di = dictGetSafeIterator(c->pubsub_channels);
-        dictEntry *de;
-
-        while((de = dictNext(di)) != NULL) {
-            robj *channel = dictGetKey(de);
-
-            count += pubsubUnsubscribeChannel(c,channel,notify);
-        }
-        dictReleaseIterator(di);
-    }
-    /* We were subscribed to nothing? Still reply to the client. */
-    if (notify && count == 0) addReplyPubsubUnsubscribed(c,NULL);
-    return count;
-}
-
-/* Unsubscribe from all the patterns. Return the number of patterns the
- * client was subscribed from. */
-int pubsubUnsubscribeAllPatterns(client *c, int notify) {
-    listNode *ln;
-    listIter li;
-    int count = 0;
-
-    listRewind(c->pubsub_patterns,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        robj *pattern = ln->value;
-
-        count += pubsubUnsubscribePattern(c,pattern,notify);
-    }
-    if (notify && count == 0) addReplyPubsubPatUnsubscribed(c,NULL);
-    return count;
-}
-
-/* Publish a message */
-int pubsubPublishMessage(robj *channel, robj *message) {
-    int receivers = 0;
-    dictEntry *de;
-    dictIterator *di;
-    listNode *ln;
-    listIter li;
-
-    /* Send to clients listening for that channel */
-    de = dictFind(server.pubsub_channels,channel);
-    if (de) {
-        list *list = dictGetVal(de);
-        listNode *ln;
-        listIter li;
-
-        listRewind(list,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            client *c = ln->value;
-            addReplyPubsubMessage(c,channel,message);
-            receivers++;
-        }
-    }
-    /* Send to clients listening to matching channels */
-    di = dictGetIterator(server.pubsub_patterns);
-    if (di) {
-        channel = getDecodedObject(channel);
-        while((de = dictNext(di)) != NULL) {
-            robj *pattern = dictGetKey(de);
-            list *clients = dictGetVal(de);
-            if (!stringmatchlen((char*)pattern->ptr,
-                                sdslen(pattern->ptr),
-                                (char*)channel->ptr,
-                                sdslen(channel->ptr),0)) continue;
-
-            listRewind(clients,&li);
-            while ((ln = listNext(&li)) != NULL) {
-                client *c = listNodeValue(ln);
-                addReplyPubsubPatMessage(c,pattern,channel,message);
-                receivers++;
-            }
-        }
-        decrRefCount(channel);
-        dictReleaseIterator(di);
-    }
-    return receivers;
-}
-
-/*-----------------------------------------------------------------------------
- * Pubsub commands implementation
- *----------------------------------------------------------------------------*/
-
-/* SUBSCRIBE channel [channel ...] */
-void subscribeCommand(client *c) {
-    int j;
-    if ((c->flags & CLIENT_DENY_BLOCKING) && !(c->flags & CLIENT_MULTI)) {
-        /**
-         * A client that has CLIENT_DENY_BLOCKING flag on
-         * expect a reply per command and so can not execute subscribe.
-         *
-         * Notice that we have a special treatment for multi because of
-         * backword compatibility
-         */
-        addReplyError(c, "SUBSCRIBE isn't allowed for a DENY BLOCKING client");
-        return;
-    }
-
-    for (j = 1; j < c->argc; j++)
-        pubsubSubscribeChannel(c,c->argv[j]);
-    c->flags |= CLIENT_PUBSUB;
-}
-
-/* UNSUBSCRIBE [channel [channel ...]] */
-void unsubscribeCommand(client *c) {
-    if (c->argc == 1) {
-        pubsubUnsubscribeAllChannels(c,1);
-    } else {
-        int j;
-
-        for (j = 1; j < c->argc; j++)
-            pubsubUnsubscribeChannel(c,c->argv[j],1);
-    }
-    if (clientSubscriptionsCount(c) == 0) c->flags &= ~CLIENT_PUBSUB;
-}
-
-/* PSUBSCRIBE pattern [pattern ...] */
-void psubscribeCommand(client *c) {
-    int j;
-    if ((c->flags & CLIENT_DENY_BLOCKING) && !(c->flags & CLIENT_MULTI)) {
-        /**
-         * A client that has CLIENT_DENY_BLOCKING flag on
-         * expect a reply per command and so can not execute subscribe.
-         *
-         * Notice that we have a special treatment for multi because of
-         * backword compatibility
-         */
-        addReplyError(c, "PSUBSCRIBE isn't allowed for a DENY BLOCKING client");
-        return;
-    }
-
-    for (j = 1; j < c->argc; j++)
-        pubsubSubscribePattern(c,c->argv[j]);
-    c->flags |= CLIENT_PUBSUB;
-}
-
-/* PUNSUBSCRIBE [pattern [pattern ...]] */
-void punsubscribeCommand(client *c) {
-    if (c->argc == 1) {
-        pubsubUnsubscribeAllPatterns(c,1);
-    } else {
-        int j;
-
-        for (j = 1; j < c->argc; j++)
-            pubsubUnsubscribePattern(c,c->argv[j],1);
-    }
-    if (clientSubscriptionsCount(c) == 0) c->flags &= ~CLIENT_PUBSUB;
-}
-
-/* PUBLISH <channel> <message> */
-void publishCommand(client *c) {
-    int receivers = pubsubPublishMessage(c->argv[1],c->argv[2]);
-    if (server.cluster_enabled)
-        clusterPropagatePublish(c->argv[1],c->argv[2]);
-    else
-        forceCommandPropagation(c,PROPAGATE_REPL);
-    addReplyLongLong(c,receivers);
-}
-
-/* PUBSUB command for Pub/Sub introspection. */
-void pubsubCommand(client *c) {
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"CHANNELS [<pattern>]",
-"    Return the currently active channels matching a <pattern> (default: '*').",
-"NUMPAT",
-"    Return number of subscriptions to patterns.",
-"NUMSUB [<channel> ...]",
-"    Return the number of subscribers for the specified channels, excluding",
-"    pattern subscriptions(default: no channels).",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"channels") &&
-        (c->argc == 2 || c->argc == 3))
-    {
-        /* PUBSUB CHANNELS [<pattern>] */
-        sds pat = (c->argc == 2) ? NULL : c->argv[2]->ptr;
-        dictIterator *di = dictGetIterator(server.pubsub_channels);
-        dictEntry *de;
-        long mblen = 0;
-        void *replylen;
-
-        replylen = addReplyDeferredLen(c);
-        while((de = dictNext(di)) != NULL) {
-            robj *cobj = dictGetKey(de);
-            sds channel = cobj->ptr;
-
-            if (!pat || stringmatchlen(pat, sdslen(pat),
-                                       channel, sdslen(channel),0))
-            {
-                addReplyBulk(c,cobj);
-                mblen++;
-            }
-        }
-        dictReleaseIterator(di);
-        setDeferredArrayLen(c,replylen,mblen);
-    } else if (!strcasecmp(c->argv[1]->ptr,"numsub") && c->argc >= 2) {
-        /* PUBSUB NUMSUB [Channel_1 ... Channel_N] */
-        int j;
-
-        addReplyArrayLen(c,(c->argc-2)*2);
-        for (j = 2; j < c->argc; j++) {
-            list *l = dictFetchValue(server.pubsub_channels,c->argv[j]);
-
-            addReplyBulk(c,c->argv[j]);
-            addReplyLongLong(c,l ? listLength(l) : 0);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"numpat") && c->argc == 2) {
-        /* PUBSUB NUMPAT */
-        addReplyLongLong(c,dictSize(server.pubsub_patterns));
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
diff --git a/redis-stable/src/quicklist.c b/redis-stable/src/quicklist.c
deleted file mode 100644
index a9f8b43b..00000000
--- a/redis-stable/src/quicklist.c
+++ /dev/null
@@ -1,2785 +0,0 @@
-/* quicklist.c - A doubly linked list of ziplists
- *
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must start the above copyright notice,
- *     this quicklist of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this quicklist of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <string.h> /* for memcpy */
-#include "quicklist.h"
-#include "zmalloc.h"
-#include "config.h"
-#include "ziplist.h"
-#include "util.h" /* for ll2string */
-#include "lzf.h"
-#include "redisassert.h"
-
-#if defined(REDIS_TEST) || defined(REDIS_TEST_VERBOSE)
-#include <stdio.h> /* for printf (debug printing), snprintf (genstr) */
-#endif
-
-#ifndef REDIS_STATIC
-#define REDIS_STATIC static
-#endif
-
-/* Optimization levels for size-based filling.
- * Note that the largest possible limit is 16k, so even if each record takes
- * just one byte, it still won't overflow the 16 bit count field. */
-static const size_t optimization_level[] = {4096, 8192, 16384, 32768, 65536};
-
-/* Maximum size in bytes of any multi-element ziplist.
- * Larger values will live in their own isolated ziplists.
- * This is used only if we're limited by record count. when we're limited by
- * size, the maximum limit is bigger, but still safe.
- * 8k is a recommended / default size limit */
-#define SIZE_SAFETY_LIMIT 8192
-
-/* Minimum ziplist size in bytes for attempting compression. */
-#define MIN_COMPRESS_BYTES 48
-
-/* Minimum size reduction in bytes to store compressed quicklistNode data.
- * This also prevents us from storing compression if the compression
- * resulted in a larger size than the original data. */
-#define MIN_COMPRESS_IMPROVE 8
-
-/* If not verbose testing, remove all debug printing. */
-#ifndef REDIS_TEST_VERBOSE
-#define D(...)
-#else
-#define D(...)                                                                 \
-    do {                                                                       \
-        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
-        printf(__VA_ARGS__);                                                   \
-        printf("\n");                                                          \
-    } while (0)
-#endif
-
-/* Bookmarks forward declarations */
-#define QL_MAX_BM ((1 << QL_BM_BITS)-1)
-quicklistBookmark *_quicklistBookmarkFindByName(quicklist *ql, const char *name);
-quicklistBookmark *_quicklistBookmarkFindByNode(quicklist *ql, quicklistNode *node);
-void _quicklistBookmarkDelete(quicklist *ql, quicklistBookmark *bm);
-
-/* Simple way to give quicklistEntry structs default values with one call. */
-#define initEntry(e)                                                           \
-    do {                                                                       \
-        (e)->zi = (e)->value = NULL;                                           \
-        (e)->longval = -123456789;                                             \
-        (e)->quicklist = NULL;                                                 \
-        (e)->node = NULL;                                                      \
-        (e)->offset = 123456789;                                               \
-        (e)->sz = 0;                                                           \
-    } while (0)
-
-/* Create a new quicklist.
- * Free with quicklistRelease(). */
-quicklist *quicklistCreate(void) {
-    struct quicklist *quicklist;
-
-    quicklist = zmalloc(sizeof(*quicklist));
-    quicklist->head = quicklist->tail = NULL;
-    quicklist->len = 0;
-    quicklist->count = 0;
-    quicklist->compress = 0;
-    quicklist->fill = -2;
-    quicklist->bookmark_count = 0;
-    return quicklist;
-}
-
-#define COMPRESS_MAX ((1 << QL_COMP_BITS)-1)
-void quicklistSetCompressDepth(quicklist *quicklist, int compress) {
-    if (compress > COMPRESS_MAX) {
-        compress = COMPRESS_MAX;
-    } else if (compress < 0) {
-        compress = 0;
-    }
-    quicklist->compress = compress;
-}
-
-#define FILL_MAX ((1 << (QL_FILL_BITS-1))-1)
-void quicklistSetFill(quicklist *quicklist, int fill) {
-    if (fill > FILL_MAX) {
-        fill = FILL_MAX;
-    } else if (fill < -5) {
-        fill = -5;
-    }
-    quicklist->fill = fill;
-}
-
-void quicklistSetOptions(quicklist *quicklist, int fill, int depth) {
-    quicklistSetFill(quicklist, fill);
-    quicklistSetCompressDepth(quicklist, depth);
-}
-
-/* Create a new quicklist with some default parameters. */
-quicklist *quicklistNew(int fill, int compress) {
-    quicklist *quicklist = quicklistCreate();
-    quicklistSetOptions(quicklist, fill, compress);
-    return quicklist;
-}
-
-REDIS_STATIC quicklistNode *quicklistCreateNode(void) {
-    quicklistNode *node;
-    node = zmalloc(sizeof(*node));
-    node->zl = NULL;
-    node->count = 0;
-    node->sz = 0;
-    node->next = node->prev = NULL;
-    node->encoding = QUICKLIST_NODE_ENCODING_RAW;
-    node->container = QUICKLIST_NODE_CONTAINER_ZIPLIST;
-    node->recompress = 0;
-    return node;
-}
-
-/* Return cached quicklist count */
-unsigned long quicklistCount(const quicklist *ql) { return ql->count; }
-
-/* Free entire quicklist. */
-void quicklistRelease(quicklist *quicklist) {
-    unsigned long len;
-    quicklistNode *current, *next;
-
-    current = quicklist->head;
-    len = quicklist->len;
-    while (len--) {
-        next = current->next;
-
-        zfree(current->zl);
-        quicklist->count -= current->count;
-
-        zfree(current);
-
-        quicklist->len--;
-        current = next;
-    }
-    quicklistBookmarksClear(quicklist);
-    zfree(quicklist);
-}
-
-/* Compress the ziplist in 'node' and update encoding details.
- * Returns 1 if ziplist compressed successfully.
- * Returns 0 if compression failed or if ziplist too small to compress. */
-REDIS_STATIC int __quicklistCompressNode(quicklistNode *node) {
-#ifdef REDIS_TEST
-    node->attempted_compress = 1;
-#endif
-
-    /* Don't bother compressing small values */
-    if (node->sz < MIN_COMPRESS_BYTES)
-        return 0;
-
-    quicklistLZF *lzf = zmalloc(sizeof(*lzf) + node->sz);
-
-    /* Cancel if compression fails or doesn't compress small enough */
-    if (((lzf->sz = lzf_compress(node->zl, node->sz, lzf->compressed,
-                                 node->sz)) == 0) ||
-        lzf->sz + MIN_COMPRESS_IMPROVE >= node->sz) {
-        /* lzf_compress aborts/rejects compression if value not compressable. */
-        zfree(lzf);
-        return 0;
-    }
-    lzf = zrealloc(lzf, sizeof(*lzf) + lzf->sz);
-    zfree(node->zl);
-    node->zl = (unsigned char *)lzf;
-    node->encoding = QUICKLIST_NODE_ENCODING_LZF;
-    node->recompress = 0;
-    return 1;
-}
-
-/* Compress only uncompressed nodes. */
-#define quicklistCompressNode(_node)                                           \
-    do {                                                                       \
-        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_RAW) {     \
-            __quicklistCompressNode((_node));                                  \
-        }                                                                      \
-    } while (0)
-
-/* Uncompress the ziplist in 'node' and update encoding details.
- * Returns 1 on successful decode, 0 on failure to decode. */
-REDIS_STATIC int __quicklistDecompressNode(quicklistNode *node) {
-#ifdef REDIS_TEST
-    node->attempted_compress = 0;
-#endif
-
-    void *decompressed = zmalloc(node->sz);
-    quicklistLZF *lzf = (quicklistLZF *)node->zl;
-    if (lzf_decompress(lzf->compressed, lzf->sz, decompressed, node->sz) == 0) {
-        /* Someone requested decompress, but we can't decompress.  Not good. */
-        zfree(decompressed);
-        return 0;
-    }
-    zfree(lzf);
-    node->zl = decompressed;
-    node->encoding = QUICKLIST_NODE_ENCODING_RAW;
-    return 1;
-}
-
-/* Decompress only compressed nodes. */
-#define quicklistDecompressNode(_node)                                         \
-    do {                                                                       \
-        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_LZF) {     \
-            __quicklistDecompressNode((_node));                                \
-        }                                                                      \
-    } while (0)
-
-/* Force node to not be immediately re-compresable */
-#define quicklistDecompressNodeForUse(_node)                                   \
-    do {                                                                       \
-        if ((_node) && (_node)->encoding == QUICKLIST_NODE_ENCODING_LZF) {     \
-            __quicklistDecompressNode((_node));                                \
-            (_node)->recompress = 1;                                           \
-        }                                                                      \
-    } while (0)
-
-/* Extract the raw LZF data from this quicklistNode.
- * Pointer to LZF data is assigned to '*data'.
- * Return value is the length of compressed LZF data. */
-size_t quicklistGetLzf(const quicklistNode *node, void **data) {
-    quicklistLZF *lzf = (quicklistLZF *)node->zl;
-    *data = lzf->compressed;
-    return lzf->sz;
-}
-
-#define quicklistAllowsCompression(_ql) ((_ql)->compress != 0)
-
-/* Force 'quicklist' to meet compression guidelines set by compress depth.
- * The only way to guarantee interior nodes get compressed is to iterate
- * to our "interior" compress depth then compress the next node we find.
- * If compress depth is larger than the entire list, we return immediately. */
-REDIS_STATIC void __quicklistCompress(const quicklist *quicklist,
-                                      quicklistNode *node) {
-    /* If length is less than our compress depth (from both sides),
-     * we can't compress anything. */
-    if (!quicklistAllowsCompression(quicklist) ||
-        quicklist->len < (unsigned int)(quicklist->compress * 2))
-        return;
-
-#if 0
-    /* Optimized cases for small depth counts */
-    if (quicklist->compress == 1) {
-        quicklistNode *h = quicklist->head, *t = quicklist->tail;
-        quicklistDecompressNode(h);
-        quicklistDecompressNode(t);
-        if (h != node && t != node)
-            quicklistCompressNode(node);
-        return;
-    } else if (quicklist->compress == 2) {
-        quicklistNode *h = quicklist->head, *hn = h->next, *hnn = hn->next;
-        quicklistNode *t = quicklist->tail, *tp = t->prev, *tpp = tp->prev;
-        quicklistDecompressNode(h);
-        quicklistDecompressNode(hn);
-        quicklistDecompressNode(t);
-        quicklistDecompressNode(tp);
-        if (h != node && hn != node && t != node && tp != node) {
-            quicklistCompressNode(node);
-        }
-        if (hnn != t) {
-            quicklistCompressNode(hnn);
-        }
-        if (tpp != h) {
-            quicklistCompressNode(tpp);
-        }
-        return;
-    }
-#endif
-
-    /* Iterate until we reach compress depth for both sides of the list.a
-     * Note: because we do length checks at the *top* of this function,
-     *       we can skip explicit null checks below. Everything exists. */
-    quicklistNode *forward = quicklist->head;
-    quicklistNode *reverse = quicklist->tail;
-    int depth = 0;
-    int in_depth = 0;
-    while (depth++ < quicklist->compress) {
-        quicklistDecompressNode(forward);
-        quicklistDecompressNode(reverse);
-
-        if (forward == node || reverse == node)
-            in_depth = 1;
-
-        /* We passed into compress depth of opposite side of the quicklist
-         * so there's no need to compress anything and we can exit. */
-        if (forward == reverse || forward->next == reverse)
-            return;
-
-        forward = forward->next;
-        reverse = reverse->prev;
-    }
-
-    if (!in_depth)
-        quicklistCompressNode(node);
-
-    /* At this point, forward and reverse are one node beyond depth */
-    quicklistCompressNode(forward);
-    quicklistCompressNode(reverse);
-}
-
-#define quicklistCompress(_ql, _node)                                          \
-    do {                                                                       \
-        if ((_node)->recompress)                                               \
-            quicklistCompressNode((_node));                                    \
-        else                                                                   \
-            __quicklistCompress((_ql), (_node));                               \
-    } while (0)
-
-/* If we previously used quicklistDecompressNodeForUse(), just recompress. */
-#define quicklistRecompressOnly(_ql, _node)                                    \
-    do {                                                                       \
-        if ((_node)->recompress)                                               \
-            quicklistCompressNode((_node));                                    \
-    } while (0)
-
-/* Insert 'new_node' after 'old_node' if 'after' is 1.
- * Insert 'new_node' before 'old_node' if 'after' is 0.
- * Note: 'new_node' is *always* uncompressed, so if we assign it to
- *       head or tail, we do not need to uncompress it. */
-REDIS_STATIC void __quicklistInsertNode(quicklist *quicklist,
-                                        quicklistNode *old_node,
-                                        quicklistNode *new_node, int after) {
-    if (after) {
-        new_node->prev = old_node;
-        if (old_node) {
-            new_node->next = old_node->next;
-            if (old_node->next)
-                old_node->next->prev = new_node;
-            old_node->next = new_node;
-        }
-        if (quicklist->tail == old_node)
-            quicklist->tail = new_node;
-    } else {
-        new_node->next = old_node;
-        if (old_node) {
-            new_node->prev = old_node->prev;
-            if (old_node->prev)
-                old_node->prev->next = new_node;
-            old_node->prev = new_node;
-        }
-        if (quicklist->head == old_node)
-            quicklist->head = new_node;
-    }
-    /* If this insert creates the only element so far, initialize head/tail. */
-    if (quicklist->len == 0) {
-        quicklist->head = quicklist->tail = new_node;
-    }
-
-    /* Update len first, so in __quicklistCompress we know exactly len */
-    quicklist->len++;
-
-    if (old_node)
-        quicklistCompress(quicklist, old_node);
-}
-
-/* Wrappers for node inserting around existing node. */
-REDIS_STATIC void _quicklistInsertNodeBefore(quicklist *quicklist,
-                                             quicklistNode *old_node,
-                                             quicklistNode *new_node) {
-    __quicklistInsertNode(quicklist, old_node, new_node, 0);
-}
-
-REDIS_STATIC void _quicklistInsertNodeAfter(quicklist *quicklist,
-                                            quicklistNode *old_node,
-                                            quicklistNode *new_node) {
-    __quicklistInsertNode(quicklist, old_node, new_node, 1);
-}
-
-REDIS_STATIC int
-_quicklistNodeSizeMeetsOptimizationRequirement(const size_t sz,
-                                               const int fill) {
-    if (fill >= 0)
-        return 0;
-
-    size_t offset = (-fill) - 1;
-    if (offset < (sizeof(optimization_level) / sizeof(*optimization_level))) {
-        if (sz <= optimization_level[offset]) {
-            return 1;
-        } else {
-            return 0;
-        }
-    } else {
-        return 0;
-    }
-}
-
-#define sizeMeetsSafetyLimit(sz) ((sz) <= SIZE_SAFETY_LIMIT)
-
-REDIS_STATIC int _quicklistNodeAllowInsert(const quicklistNode *node,
-                                           const int fill, const size_t sz) {
-    if (unlikely(!node))
-        return 0;
-
-    int ziplist_overhead;
-    /* size of previous offset */
-    if (sz < 254)
-        ziplist_overhead = 1;
-    else
-        ziplist_overhead = 5;
-
-    /* size of forward offset */
-    if (sz < 64)
-        ziplist_overhead += 1;
-    else if (likely(sz < 16384))
-        ziplist_overhead += 2;
-    else
-        ziplist_overhead += 5;
-
-    /* new_sz overestimates if 'sz' encodes to an integer type */
-    unsigned int new_sz = node->sz + sz + ziplist_overhead;
-    if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(new_sz, fill)))
-        return 1;
-    /* when we return 1 above we know that the limit is a size limit (which is
-     * safe, see comments next to optimization_level and SIZE_SAFETY_LIMIT) */
-    else if (!sizeMeetsSafetyLimit(new_sz))
-        return 0;
-    else if ((int)node->count < fill)
-        return 1;
-    else
-        return 0;
-}
-
-REDIS_STATIC int _quicklistNodeAllowMerge(const quicklistNode *a,
-                                          const quicklistNode *b,
-                                          const int fill) {
-    if (!a || !b)
-        return 0;
-
-    /* approximate merged ziplist size (- 11 to remove one ziplist
-     * header/trailer) */
-    unsigned int merge_sz = a->sz + b->sz - 11;
-    if (likely(_quicklistNodeSizeMeetsOptimizationRequirement(merge_sz, fill)))
-        return 1;
-    /* when we return 1 above we know that the limit is a size limit (which is
-     * safe, see comments next to optimization_level and SIZE_SAFETY_LIMIT) */
-    else if (!sizeMeetsSafetyLimit(merge_sz))
-        return 0;
-    else if ((int)(a->count + b->count) <= fill)
-        return 1;
-    else
-        return 0;
-}
-
-#define quicklistNodeUpdateSz(node)                                            \
-    do {                                                                       \
-        (node)->sz = ziplistBlobLen((node)->zl);                               \
-    } while (0)
-
-/* Add new entry to head node of quicklist.
- *
- * Returns 0 if used existing head.
- * Returns 1 if new head created. */
-int quicklistPushHead(quicklist *quicklist, void *value, size_t sz) {
-    quicklistNode *orig_head = quicklist->head;
-    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
-    if (likely(
-            _quicklistNodeAllowInsert(quicklist->head, quicklist->fill, sz))) {
-        quicklist->head->zl =
-            ziplistPush(quicklist->head->zl, value, sz, ZIPLIST_HEAD);
-        quicklistNodeUpdateSz(quicklist->head);
-    } else {
-        quicklistNode *node = quicklistCreateNode();
-        node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
-
-        quicklistNodeUpdateSz(node);
-        _quicklistInsertNodeBefore(quicklist, quicklist->head, node);
-    }
-    quicklist->count++;
-    quicklist->head->count++;
-    return (orig_head != quicklist->head);
-}
-
-/* Add new entry to tail node of quicklist.
- *
- * Returns 0 if used existing tail.
- * Returns 1 if new tail created. */
-int quicklistPushTail(quicklist *quicklist, void *value, size_t sz) {
-    quicklistNode *orig_tail = quicklist->tail;
-    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
-    if (likely(
-            _quicklistNodeAllowInsert(quicklist->tail, quicklist->fill, sz))) {
-        quicklist->tail->zl =
-            ziplistPush(quicklist->tail->zl, value, sz, ZIPLIST_TAIL);
-        quicklistNodeUpdateSz(quicklist->tail);
-    } else {
-        quicklistNode *node = quicklistCreateNode();
-        node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_TAIL);
-
-        quicklistNodeUpdateSz(node);
-        _quicklistInsertNodeAfter(quicklist, quicklist->tail, node);
-    }
-    quicklist->count++;
-    quicklist->tail->count++;
-    return (orig_tail != quicklist->tail);
-}
-
-/* Create new node consisting of a pre-formed ziplist.
- * Used for loading RDBs where entire ziplists have been stored
- * to be retrieved later. */
-void quicklistAppendZiplist(quicklist *quicklist, unsigned char *zl) {
-    quicklistNode *node = quicklistCreateNode();
-
-    node->zl = zl;
-    node->count = ziplistLen(node->zl);
-    node->sz = ziplistBlobLen(zl);
-
-    _quicklistInsertNodeAfter(quicklist, quicklist->tail, node);
-    quicklist->count += node->count;
-}
-
-/* Append all values of ziplist 'zl' individually into 'quicklist'.
- *
- * This allows us to restore old RDB ziplists into new quicklists
- * with smaller ziplist sizes than the saved RDB ziplist.
- *
- * Returns 'quicklist' argument. Frees passed-in ziplist 'zl' */
-quicklist *quicklistAppendValuesFromZiplist(quicklist *quicklist,
-                                            unsigned char *zl) {
-    unsigned char *value;
-    unsigned int sz;
-    long long longval;
-    char longstr[32] = {0};
-
-    unsigned char *p = ziplistIndex(zl, 0);
-    while (ziplistGet(p, &value, &sz, &longval)) {
-        if (!value) {
-            /* Write the longval as a string so we can re-add it */
-            sz = ll2string(longstr, sizeof(longstr), longval);
-            value = (unsigned char *)longstr;
-        }
-        quicklistPushTail(quicklist, value, sz);
-        p = ziplistNext(zl, p);
-    }
-    zfree(zl);
-    return quicklist;
-}
-
-/* Create new (potentially multi-node) quicklist from a single existing ziplist.
- *
- * Returns new quicklist.  Frees passed-in ziplist 'zl'. */
-quicklist *quicklistCreateFromZiplist(int fill, int compress,
-                                      unsigned char *zl) {
-    return quicklistAppendValuesFromZiplist(quicklistNew(fill, compress), zl);
-}
-
-#define quicklistDeleteIfEmpty(ql, n)                                          \
-    do {                                                                       \
-        if ((n)->count == 0) {                                                 \
-            __quicklistDelNode((ql), (n));                                     \
-            (n) = NULL;                                                        \
-        }                                                                      \
-    } while (0)
-
-REDIS_STATIC void __quicklistDelNode(quicklist *quicklist,
-                                     quicklistNode *node) {
-    /* Update the bookmark if any */
-    quicklistBookmark *bm = _quicklistBookmarkFindByNode(quicklist, node);
-    if (bm) {
-        bm->node = node->next;
-        /* if the bookmark was to the last node, delete it. */
-        if (!bm->node)
-            _quicklistBookmarkDelete(quicklist, bm);
-    }
-
-    if (node->next)
-        node->next->prev = node->prev;
-    if (node->prev)
-        node->prev->next = node->next;
-
-    if (node == quicklist->tail) {
-        quicklist->tail = node->prev;
-    }
-
-    if (node == quicklist->head) {
-        quicklist->head = node->next;
-    }
-
-    /* Update len first, so in __quicklistCompress we know exactly len */
-    quicklist->len--;
-    quicklist->count -= node->count;
-
-    /* If we deleted a node within our compress depth, we
-     * now have compressed nodes needing to be decompressed. */
-    __quicklistCompress(quicklist, NULL);
-
-    zfree(node->zl);
-    zfree(node);
-}
-
-/* Delete one entry from list given the node for the entry and a pointer
- * to the entry in the node.
- *
- * Note: quicklistDelIndex() *requires* uncompressed nodes because you
- *       already had to get *p from an uncompressed node somewhere.
- *
- * Returns 1 if the entire node was deleted, 0 if node still exists.
- * Also updates in/out param 'p' with the next offset in the ziplist. */
-REDIS_STATIC int quicklistDelIndex(quicklist *quicklist, quicklistNode *node,
-                                   unsigned char **p) {
-    int gone = 0;
-
-    node->zl = ziplistDelete(node->zl, p);
-    node->count--;
-    if (node->count == 0) {
-        gone = 1;
-        __quicklistDelNode(quicklist, node);
-    } else {
-        quicklistNodeUpdateSz(node);
-    }
-    quicklist->count--;
-    /* If we deleted the node, the original node is no longer valid */
-    return gone ? 1 : 0;
-}
-
-/* Delete one element represented by 'entry'
- *
- * 'entry' stores enough metadata to delete the proper position in
- * the correct ziplist in the correct quicklist node. */
-void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry) {
-    quicklistNode *prev = entry->node->prev;
-    quicklistNode *next = entry->node->next;
-    int deleted_node = quicklistDelIndex((quicklist *)entry->quicklist,
-                                         entry->node, &entry->zi);
-
-    /* after delete, the zi is now invalid for any future usage. */
-    iter->zi = NULL;
-
-    /* If current node is deleted, we must update iterator node and offset. */
-    if (deleted_node) {
-        if (iter->direction == AL_START_HEAD) {
-            iter->current = next;
-            iter->offset = 0;
-        } else if (iter->direction == AL_START_TAIL) {
-            iter->current = prev;
-            iter->offset = -1;
-        }
-    }
-    /* else if (!deleted_node), no changes needed.
-     * we already reset iter->zi above, and the existing iter->offset
-     * doesn't move again because:
-     *   - [1, 2, 3] => delete offset 1 => [1, 3]: next element still offset 1
-     *   - [1, 2, 3] => delete offset 0 => [2, 3]: next element still offset 0
-     *  if we deleted the last element at offet N and now
-     *  length of this ziplist is N-1, the next call into
-     *  quicklistNext() will jump to the next node. */
-}
-
-/* Replace quicklist entry at offset 'index' by 'data' with length 'sz'.
- *
- * Returns 1 if replace happened.
- * Returns 0 if replace failed and no changes happened. */
-int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data,
-                            int sz) {
-    quicklistEntry entry;
-    if (likely(quicklistIndex(quicklist, index, &entry))) {
-        /* quicklistIndex provides an uncompressed node */
-        entry.node->zl = ziplistReplace(entry.node->zl, entry.zi, data, sz);
-        quicklistNodeUpdateSz(entry.node);
-        quicklistCompress(quicklist, entry.node);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Given two nodes, try to merge their ziplists.
- *
- * This helps us not have a quicklist with 3 element ziplists if
- * our fill factor can handle much higher levels.
- *
- * Note: 'a' must be to the LEFT of 'b'.
- *
- * After calling this function, both 'a' and 'b' should be considered
- * unusable.  The return value from this function must be used
- * instead of re-using any of the quicklistNode input arguments.
- *
- * Returns the input node picked to merge against or NULL if
- * merging was not possible. */
-REDIS_STATIC quicklistNode *_quicklistZiplistMerge(quicklist *quicklist,
-                                                   quicklistNode *a,
-                                                   quicklistNode *b) {
-    D("Requested merge (a,b) (%u, %u)", a->count, b->count);
-
-    quicklistDecompressNode(a);
-    quicklistDecompressNode(b);
-    if ((ziplistMerge(&a->zl, &b->zl))) {
-        /* We merged ziplists! Now remove the unused quicklistNode. */
-        quicklistNode *keep = NULL, *nokeep = NULL;
-        if (!a->zl) {
-            nokeep = a;
-            keep = b;
-        } else if (!b->zl) {
-            nokeep = b;
-            keep = a;
-        }
-        keep->count = ziplistLen(keep->zl);
-        quicklistNodeUpdateSz(keep);
-
-        nokeep->count = 0;
-        __quicklistDelNode(quicklist, nokeep);
-        quicklistCompress(quicklist, keep);
-        return keep;
-    } else {
-        /* else, the merge returned NULL and nothing changed. */
-        return NULL;
-    }
-}
-
-/* Attempt to merge ziplists within two nodes on either side of 'center'.
- *
- * We attempt to merge:
- *   - (center->prev->prev, center->prev)
- *   - (center->next, center->next->next)
- *   - (center->prev, center)
- *   - (center, center->next)
- */
-REDIS_STATIC void _quicklistMergeNodes(quicklist *quicklist,
-                                       quicklistNode *center) {
-    int fill = quicklist->fill;
-    quicklistNode *prev, *prev_prev, *next, *next_next, *target;
-    prev = prev_prev = next = next_next = target = NULL;
-
-    if (center->prev) {
-        prev = center->prev;
-        if (center->prev->prev)
-            prev_prev = center->prev->prev;
-    }
-
-    if (center->next) {
-        next = center->next;
-        if (center->next->next)
-            next_next = center->next->next;
-    }
-
-    /* Try to merge prev_prev and prev */
-    if (_quicklistNodeAllowMerge(prev, prev_prev, fill)) {
-        _quicklistZiplistMerge(quicklist, prev_prev, prev);
-        prev_prev = prev = NULL; /* they could have moved, invalidate them. */
-    }
-
-    /* Try to merge next and next_next */
-    if (_quicklistNodeAllowMerge(next, next_next, fill)) {
-        _quicklistZiplistMerge(quicklist, next, next_next);
-        next = next_next = NULL; /* they could have moved, invalidate them. */
-    }
-
-    /* Try to merge center node and previous node */
-    if (_quicklistNodeAllowMerge(center, center->prev, fill)) {
-        target = _quicklistZiplistMerge(quicklist, center->prev, center);
-        center = NULL; /* center could have been deleted, invalidate it. */
-    } else {
-        /* else, we didn't merge here, but target needs to be valid below. */
-        target = center;
-    }
-
-    /* Use result of center merge (or original) to merge with next node. */
-    if (_quicklistNodeAllowMerge(target, target->next, fill)) {
-        _quicklistZiplistMerge(quicklist, target, target->next);
-    }
-}
-
-/* Split 'node' into two parts, parameterized by 'offset' and 'after'.
- *
- * The 'after' argument controls which quicklistNode gets returned.
- * If 'after'==1, returned node has elements after 'offset'.
- *                input node keeps elements up to 'offset', including 'offset'.
- * If 'after'==0, returned node has elements up to 'offset'.
- *                input node keeps elements after 'offset', including 'offset'.
- *
- * Or in other words:
- * If 'after'==1, returned node will have elements after 'offset'.
- *                The returned node will have elements [OFFSET+1, END].
- *                The input node keeps elements [0, OFFSET].
- * If 'after'==0, returned node will keep elements up to but not including 'offset'.
- *                The returned node will have elements [0, OFFSET-1].
- *                The input node keeps elements [OFFSET, END].
- *
- * The input node keeps all elements not taken by the returned node.
- *
- * Returns newly created node or NULL if split not possible. */
-REDIS_STATIC quicklistNode *_quicklistSplitNode(quicklistNode *node, int offset,
-                                                int after) {
-    size_t zl_sz = node->sz;
-
-    quicklistNode *new_node = quicklistCreateNode();
-    new_node->zl = zmalloc(zl_sz);
-
-    /* Copy original ziplist so we can split it */
-    memcpy(new_node->zl, node->zl, zl_sz);
-
-    /* Ranges to be trimmed: -1 here means "continue deleting until the list ends" */
-    int orig_start = after ? offset + 1 : 0;
-    int orig_extent = after ? -1 : offset;
-    int new_start = after ? 0 : offset;
-    int new_extent = after ? offset + 1 : -1;
-
-    D("After %d (%d); ranges: [%d, %d], [%d, %d]", after, offset, orig_start,
-      orig_extent, new_start, new_extent);
-
-    node->zl = ziplistDeleteRange(node->zl, orig_start, orig_extent);
-    node->count = ziplistLen(node->zl);
-    quicklistNodeUpdateSz(node);
-
-    new_node->zl = ziplistDeleteRange(new_node->zl, new_start, new_extent);
-    new_node->count = ziplistLen(new_node->zl);
-    quicklistNodeUpdateSz(new_node);
-
-    D("After split lengths: orig (%d), new (%d)", node->count, new_node->count);
-    return new_node;
-}
-
-/* Insert a new entry before or after existing entry 'entry'.
- *
- * If after==1, the new value is inserted after 'entry', otherwise
- * the new value is inserted before 'entry'. */
-REDIS_STATIC void _quicklistInsert(quicklist *quicklist, quicklistEntry *entry,
-                                   void *value, const size_t sz, int after) {
-    int full = 0, at_tail = 0, at_head = 0, full_next = 0, full_prev = 0;
-    int fill = quicklist->fill;
-    quicklistNode *node = entry->node;
-    quicklistNode *new_node = NULL;
-    assert(sz < UINT32_MAX); /* TODO: add support for quicklist nodes that are sds encoded (not zipped) */
-
-    if (!node) {
-        /* we have no reference node, so let's create only node in the list */
-        D("No node given!");
-        new_node = quicklistCreateNode();
-        new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
-        __quicklistInsertNode(quicklist, NULL, new_node, after);
-        new_node->count++;
-        quicklist->count++;
-        return;
-    }
-
-    /* Populate accounting flags for easier boolean checks later */
-    if (!_quicklistNodeAllowInsert(node, fill, sz)) {
-        D("Current node is full with count %d with requested fill %lu",
-          node->count, fill);
-        full = 1;
-    }
-
-    if (after && (entry->offset == node->count)) {
-        D("At Tail of current ziplist");
-        at_tail = 1;
-        if (!_quicklistNodeAllowInsert(node->next, fill, sz)) {
-            D("Next node is full too.");
-            full_next = 1;
-        }
-    }
-
-    if (!after && (entry->offset == 0)) {
-        D("At Head");
-        at_head = 1;
-        if (!_quicklistNodeAllowInsert(node->prev, fill, sz)) {
-            D("Prev node is full too.");
-            full_prev = 1;
-        }
-    }
-
-    /* Now determine where and how to insert the new element */
-    if (!full && after) {
-        D("Not full, inserting after current position.");
-        quicklistDecompressNodeForUse(node);
-        unsigned char *next = ziplistNext(node->zl, entry->zi);
-        if (next == NULL) {
-            node->zl = ziplistPush(node->zl, value, sz, ZIPLIST_TAIL);
-        } else {
-            node->zl = ziplistInsert(node->zl, next, value, sz);
-        }
-        node->count++;
-        quicklistNodeUpdateSz(node);
-        quicklistRecompressOnly(quicklist, node);
-    } else if (!full && !after) {
-        D("Not full, inserting before current position.");
-        quicklistDecompressNodeForUse(node);
-        node->zl = ziplistInsert(node->zl, entry->zi, value, sz);
-        node->count++;
-        quicklistNodeUpdateSz(node);
-        quicklistRecompressOnly(quicklist, node);
-    } else if (full && at_tail && node->next && !full_next && after) {
-        /* If we are: at tail, next has free space, and inserting after:
-         *   - insert entry at head of next node. */
-        D("Full and tail, but next isn't full; inserting next node head");
-        new_node = node->next;
-        quicklistDecompressNodeForUse(new_node);
-        new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_HEAD);
-        new_node->count++;
-        quicklistNodeUpdateSz(new_node);
-        quicklistRecompressOnly(quicklist, new_node);
-    } else if (full && at_head && node->prev && !full_prev && !after) {
-        /* If we are: at head, previous has free space, and inserting before:
-         *   - insert entry at tail of previous node. */
-        D("Full and head, but prev isn't full, inserting prev node tail");
-        new_node = node->prev;
-        quicklistDecompressNodeForUse(new_node);
-        new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_TAIL);
-        new_node->count++;
-        quicklistNodeUpdateSz(new_node);
-        quicklistRecompressOnly(quicklist, new_node);
-    } else if (full && ((at_tail && node->next && full_next && after) ||
-                        (at_head && node->prev && full_prev && !after))) {
-        /* If we are: full, and our prev/next is full, then:
-         *   - create new node and attach to quicklist */
-        D("\tprovisioning new node...");
-        new_node = quicklistCreateNode();
-        new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD);
-        new_node->count++;
-        quicklistNodeUpdateSz(new_node);
-        __quicklistInsertNode(quicklist, node, new_node, after);
-    } else if (full) {
-        /* else, node is full we need to split it. */
-        /* covers both after and !after cases */
-        D("\tsplitting node...");
-        quicklistDecompressNodeForUse(node);
-        new_node = _quicklistSplitNode(node, entry->offset, after);
-        new_node->zl = ziplistPush(new_node->zl, value, sz,
-                                   after ? ZIPLIST_HEAD : ZIPLIST_TAIL);
-        new_node->count++;
-        quicklistNodeUpdateSz(new_node);
-        __quicklistInsertNode(quicklist, node, new_node, after);
-        _quicklistMergeNodes(quicklist, node);
-    }
-
-    quicklist->count++;
-}
-
-void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *entry,
-                           void *value, const size_t sz) {
-    _quicklistInsert(quicklist, entry, value, sz, 0);
-}
-
-void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *entry,
-                          void *value, const size_t sz) {
-    _quicklistInsert(quicklist, entry, value, sz, 1);
-}
-
-/* Delete a range of elements from the quicklist.
- *
- * elements may span across multiple quicklistNodes, so we
- * have to be careful about tracking where we start and end.
- *
- * Returns 1 if entries were deleted, 0 if nothing was deleted. */
-int quicklistDelRange(quicklist *quicklist, const long start,
-                      const long count) {
-    if (count <= 0)
-        return 0;
-
-    unsigned long extent = count; /* range is inclusive of start position */
-
-    if (start >= 0 && extent > (quicklist->count - start)) {
-        /* if requesting delete more elements than exist, limit to list size. */
-        extent = quicklist->count - start;
-    } else if (start < 0 && extent > (unsigned long)(-start)) {
-        /* else, if at negative offset, limit max size to rest of list. */
-        extent = -start; /* c.f. LREM -29 29; just delete until end. */
-    }
-
-    quicklistEntry entry;
-    if (!quicklistIndex(quicklist, start, &entry))
-        return 0;
-
-    D("Quicklist delete request for start %ld, count %ld, extent: %ld", start,
-      count, extent);
-    quicklistNode *node = entry.node;
-
-    /* iterate over next nodes until everything is deleted. */
-    while (extent) {
-        quicklistNode *next = node->next;
-
-        unsigned long del;
-        int delete_entire_node = 0;
-        if (entry.offset == 0 && extent >= node->count) {
-            /* If we are deleting more than the count of this node, we
-             * can just delete the entire node without ziplist math. */
-            delete_entire_node = 1;
-            del = node->count;
-        } else if (entry.offset >= 0 && extent + entry.offset >= node->count) {
-            /* If deleting more nodes after this one, calculate delete based
-             * on size of current node. */
-            del = node->count - entry.offset;
-        } else if (entry.offset < 0) {
-            /* If offset is negative, we are in the first run of this loop
-             * and we are deleting the entire range
-             * from this start offset to end of list.  Since the Negative
-             * offset is the number of elements until the tail of the list,
-             * just use it directly as the deletion count. */
-            del = -entry.offset;
-
-            /* If the positive offset is greater than the remaining extent,
-             * we only delete the remaining extent, not the entire offset.
-             */
-            if (del > extent)
-                del = extent;
-        } else {
-            /* else, we are deleting less than the extent of this node, so
-             * use extent directly. */
-            del = extent;
-        }
-
-        D("[%ld]: asking to del: %ld because offset: %d; (ENTIRE NODE: %d), "
-          "node count: %u",
-          extent, del, entry.offset, delete_entire_node, node->count);
-
-        if (delete_entire_node) {
-            __quicklistDelNode(quicklist, node);
-        } else {
-            quicklistDecompressNodeForUse(node);
-            node->zl = ziplistDeleteRange(node->zl, entry.offset, del);
-            quicklistNodeUpdateSz(node);
-            node->count -= del;
-            quicklist->count -= del;
-            quicklistDeleteIfEmpty(quicklist, node);
-            if (node)
-                quicklistRecompressOnly(quicklist, node);
-        }
-
-        extent -= del;
-
-        node = next;
-
-        entry.offset = 0;
-    }
-    return 1;
-}
-
-/* Passthrough to ziplistCompare() */
-int quicklistCompare(unsigned char *p1, unsigned char *p2, int p2_len) {
-    return ziplistCompare(p1, p2, p2_len);
-}
-
-/* Returns a quicklist iterator 'iter'. After the initialization every
- * call to quicklistNext() will return the next element of the quicklist. */
-quicklistIter *quicklistGetIterator(const quicklist *quicklist, int direction) {
-    quicklistIter *iter;
-
-    iter = zmalloc(sizeof(*iter));
-
-    if (direction == AL_START_HEAD) {
-        iter->current = quicklist->head;
-        iter->offset = 0;
-    } else if (direction == AL_START_TAIL) {
-        iter->current = quicklist->tail;
-        iter->offset = -1;
-    }
-
-    iter->direction = direction;
-    iter->quicklist = quicklist;
-
-    iter->zi = NULL;
-
-    return iter;
-}
-
-/* Initialize an iterator at a specific offset 'idx' and make the iterator
- * return nodes in 'direction' direction. */
-quicklistIter *quicklistGetIteratorAtIdx(const quicklist *quicklist,
-                                         const int direction,
-                                         const long long idx) {
-    quicklistEntry entry;
-
-    if (quicklistIndex(quicklist, idx, &entry)) {
-        quicklistIter *base = quicklistGetIterator(quicklist, direction);
-        base->zi = NULL;
-        base->current = entry.node;
-        base->offset = entry.offset;
-        return base;
-    } else {
-        return NULL;
-    }
-}
-
-/* Release iterator.
- * If we still have a valid current node, then re-encode current node. */
-void quicklistReleaseIterator(quicklistIter *iter) {
-    if (iter->current)
-        quicklistCompress(iter->quicklist, iter->current);
-
-    zfree(iter);
-}
-
-/* Get next element in iterator.
- *
- * Note: You must NOT insert into the list while iterating over it.
- * You *may* delete from the list while iterating using the
- * quicklistDelEntry() function.
- * If you insert into the quicklist while iterating, you should
- * re-create the iterator after your addition.
- *
- * iter = quicklistGetIterator(quicklist,<direction>);
- * quicklistEntry entry;
- * while (quicklistNext(iter, &entry)) {
- *     if (entry.value)
- *          [[ use entry.value with entry.sz ]]
- *     else
- *          [[ use entry.longval ]]
- * }
- *
- * Populates 'entry' with values for this iteration.
- * Returns 0 when iteration is complete or if iteration not possible.
- * If return value is 0, the contents of 'entry' are not valid.
- */
-int quicklistNext(quicklistIter *iter, quicklistEntry *entry) {
-    initEntry(entry);
-
-    if (!iter) {
-        D("Returning because no iter!");
-        return 0;
-    }
-
-    entry->quicklist = iter->quicklist;
-    entry->node = iter->current;
-
-    if (!iter->current) {
-        D("Returning because current node is NULL")
-        return 0;
-    }
-
-    unsigned char *(*nextFn)(unsigned char *, unsigned char *) = NULL;
-    int offset_update = 0;
-
-    if (!iter->zi) {
-        /* If !zi, use current index. */
-        quicklistDecompressNodeForUse(iter->current);
-        iter->zi = ziplistIndex(iter->current->zl, iter->offset);
-    } else {
-        /* else, use existing iterator offset and get prev/next as necessary. */
-        if (iter->direction == AL_START_HEAD) {
-            nextFn = ziplistNext;
-            offset_update = 1;
-        } else if (iter->direction == AL_START_TAIL) {
-            nextFn = ziplistPrev;
-            offset_update = -1;
-        }
-        iter->zi = nextFn(iter->current->zl, iter->zi);
-        iter->offset += offset_update;
-    }
-
-    entry->zi = iter->zi;
-    entry->offset = iter->offset;
-
-    if (iter->zi) {
-        /* Populate value from existing ziplist position */
-        ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval);
-        return 1;
-    } else {
-        /* We ran out of ziplist entries.
-         * Pick next node, update offset, then re-run retrieval. */
-        quicklistCompress(iter->quicklist, iter->current);
-        if (iter->direction == AL_START_HEAD) {
-            /* Forward traversal */
-            D("Jumping to start of next node");
-            iter->current = iter->current->next;
-            iter->offset = 0;
-        } else if (iter->direction == AL_START_TAIL) {
-            /* Reverse traversal */
-            D("Jumping to end of previous node");
-            iter->current = iter->current->prev;
-            iter->offset = -1;
-        }
-        iter->zi = NULL;
-        return quicklistNext(iter, entry);
-    }
-}
-
-/* Duplicate the quicklist.
- * On success a copy of the original quicklist is returned.
- *
- * The original quicklist both on success or error is never modified.
- *
- * Returns newly allocated quicklist. */
-quicklist *quicklistDup(quicklist *orig) {
-    quicklist *copy;
-
-    copy = quicklistNew(orig->fill, orig->compress);
-
-    for (quicklistNode *current = orig->head; current;
-         current = current->next) {
-        quicklistNode *node = quicklistCreateNode();
-
-        if (current->encoding == QUICKLIST_NODE_ENCODING_LZF) {
-            quicklistLZF *lzf = (quicklistLZF *)current->zl;
-            size_t lzf_sz = sizeof(*lzf) + lzf->sz;
-            node->zl = zmalloc(lzf_sz);
-            memcpy(node->zl, current->zl, lzf_sz);
-        } else if (current->encoding == QUICKLIST_NODE_ENCODING_RAW) {
-            node->zl = zmalloc(current->sz);
-            memcpy(node->zl, current->zl, current->sz);
-        }
-
-        node->count = current->count;
-        copy->count += node->count;
-        node->sz = current->sz;
-        node->encoding = current->encoding;
-
-        _quicklistInsertNodeAfter(copy, copy->tail, node);
-    }
-
-    /* copy->count must equal orig->count here */
-    return copy;
-}
-
-/* Populate 'entry' with the element at the specified zero-based index
- * where 0 is the head, 1 is the element next to head
- * and so on. Negative integers are used in order to count
- * from the tail, -1 is the last element, -2 the penultimate
- * and so on. If the index is out of range 0 is returned.
- *
- * Returns 1 if element found
- * Returns 0 if element not found */
-int quicklistIndex(const quicklist *quicklist, const long long idx,
-                   quicklistEntry *entry) {
-    quicklistNode *n;
-    unsigned long long accum = 0;
-    unsigned long long index;
-    int forward = idx < 0 ? 0 : 1; /* < 0 -> reverse, 0+ -> forward */
-
-    initEntry(entry);
-    entry->quicklist = quicklist;
-
-    if (!forward) {
-        index = (-idx) - 1;
-        n = quicklist->tail;
-    } else {
-        index = idx;
-        n = quicklist->head;
-    }
-
-    if (index >= quicklist->count)
-        return 0;
-
-    while (likely(n)) {
-        if ((accum + n->count) > index) {
-            break;
-        } else {
-            D("Skipping over (%p) %u at accum %lld", (void *)n, n->count,
-              accum);
-            accum += n->count;
-            n = forward ? n->next : n->prev;
-        }
-    }
-
-    if (!n)
-        return 0;
-
-    D("Found node: %p at accum %llu, idx %llu, sub+ %llu, sub- %llu", (void *)n,
-      accum, index, index - accum, (-index) - 1 + accum);
-
-    entry->node = n;
-    if (forward) {
-        /* forward = normal head-to-tail offset. */
-        entry->offset = index - accum;
-    } else {
-        /* reverse = need negative offset for tail-to-head, so undo
-         * the result of the original if (index < 0) above. */
-        entry->offset = (-index) - 1 + accum;
-    }
-
-    quicklistDecompressNodeForUse(entry->node);
-    entry->zi = ziplistIndex(entry->node->zl, entry->offset);
-    if (!ziplistGet(entry->zi, &entry->value, &entry->sz, &entry->longval))
-        assert(0); /* This can happen on corrupt ziplist with fake entry count. */
-    /* The caller will use our result, so we don't re-compress here.
-     * The caller can recompress or delete the node as needed. */
-    return 1;
-}
-
-/* Rotate quicklist by moving the tail element to the head. */
-void quicklistRotate(quicklist *quicklist) {
-    if (quicklist->count <= 1)
-        return;
-
-    /* First, get the tail entry */
-    unsigned char *p = ziplistIndex(quicklist->tail->zl, -1);
-    unsigned char *value, *tmp;
-    long long longval;
-    unsigned int sz;
-    char longstr[32] = {0};
-    ziplistGet(p, &tmp, &sz, &longval);
-
-    /* If value found is NULL, then ziplistGet populated longval instead */
-    if (!tmp) {
-        /* Write the longval as a string so we can re-add it */
-        sz = ll2string(longstr, sizeof(longstr), longval);
-        value = (unsigned char *)longstr;
-    } else if (quicklist->len == 1) {
-        /* Copy buffer since there could be a memory overlap when move
-         * entity from tail to head in the same ziplist. */
-        value = zmalloc(sz);
-        memcpy(value, tmp, sz);
-    } else {
-        value = tmp;
-    }
-
-    /* Add tail entry to head (must happen before tail is deleted). */
-    quicklistPushHead(quicklist, value, sz);
-
-    /* If quicklist has only one node, the head ziplist is also the
-     * tail ziplist and PushHead() could have reallocated our single ziplist,
-     * which would make our pre-existing 'p' unusable. */
-    if (quicklist->len == 1) {
-        p = ziplistIndex(quicklist->tail->zl, -1);
-    }
-
-    /* Remove tail entry. */
-    quicklistDelIndex(quicklist, quicklist->tail, &p);
-    if (value != (unsigned char*)longstr && value != tmp)
-        zfree(value);
-}
-
-/* pop from quicklist and return result in 'data' ptr.  Value of 'data'
- * is the return value of 'saver' function pointer if the data is NOT a number.
- *
- * If the quicklist element is a long long, then the return value is returned in
- * 'sval'.
- *
- * Return value of 0 means no elements available.
- * Return value of 1 means check 'data' and 'sval' for values.
- * If 'data' is set, use 'data' and 'sz'.  Otherwise, use 'sval'. */
-int quicklistPopCustom(quicklist *quicklist, int where, unsigned char **data,
-                       unsigned int *sz, long long *sval,
-                       void *(*saver)(unsigned char *data, unsigned int sz)) {
-    unsigned char *p;
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vlong;
-    int pos = (where == QUICKLIST_HEAD) ? 0 : -1;
-
-    if (quicklist->count == 0)
-        return 0;
-
-    if (data)
-        *data = NULL;
-    if (sz)
-        *sz = 0;
-    if (sval)
-        *sval = -123456789;
-
-    quicklistNode *node;
-    if (where == QUICKLIST_HEAD && quicklist->head) {
-        node = quicklist->head;
-    } else if (where == QUICKLIST_TAIL && quicklist->tail) {
-        node = quicklist->tail;
-    } else {
-        return 0;
-    }
-
-    p = ziplistIndex(node->zl, pos);
-    if (ziplistGet(p, &vstr, &vlen, &vlong)) {
-        if (vstr) {
-            if (data)
-                *data = saver(vstr, vlen);
-            if (sz)
-                *sz = vlen;
-        } else {
-            if (data)
-                *data = NULL;
-            if (sval)
-                *sval = vlong;
-        }
-        quicklistDelIndex(quicklist, node, &p);
-        return 1;
-    }
-    return 0;
-}
-
-/* Return a malloc'd copy of data passed in */
-REDIS_STATIC void *_quicklistSaver(unsigned char *data, unsigned int sz) {
-    unsigned char *vstr;
-    if (data) {
-        vstr = zmalloc(sz);
-        memcpy(vstr, data, sz);
-        return vstr;
-    }
-    return NULL;
-}
-
-/* Default pop function
- *
- * Returns malloc'd value from quicklist */
-int quicklistPop(quicklist *quicklist, int where, unsigned char **data,
-                 unsigned int *sz, long long *slong) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vlong;
-    if (quicklist->count == 0)
-        return 0;
-    int ret = quicklistPopCustom(quicklist, where, &vstr, &vlen, &vlong,
-                                 _quicklistSaver);
-    if (data)
-        *data = vstr;
-    if (slong)
-        *slong = vlong;
-    if (sz)
-        *sz = vlen;
-    return ret;
-}
-
-/* Wrapper to allow argument-based switching between HEAD/TAIL pop */
-void quicklistPush(quicklist *quicklist, void *value, const size_t sz,
-                   int where) {
-    if (where == QUICKLIST_HEAD) {
-        quicklistPushHead(quicklist, value, sz);
-    } else if (where == QUICKLIST_TAIL) {
-        quicklistPushTail(quicklist, value, sz);
-    }
-}
-
-/* Create or update a bookmark in the list which will be updated to the next node
- * automatically when the one referenced gets deleted.
- * Returns 1 on success (creation of new bookmark or override of an existing one).
- * Returns 0 on failure (reached the maximum supported number of bookmarks).
- * NOTE: use short simple names, so that string compare on find is quick.
- * NOTE: bookmark creation may re-allocate the quicklist, so the input pointer
-         may change and it's the caller responsibilty to update the reference.
- */
-int quicklistBookmarkCreate(quicklist **ql_ref, const char *name, quicklistNode *node) {
-    quicklist *ql = *ql_ref;
-    if (ql->bookmark_count >= QL_MAX_BM)
-        return 0;
-    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
-    if (bm) {
-        bm->node = node;
-        return 1;
-    }
-    ql = zrealloc(ql, sizeof(quicklist) + (ql->bookmark_count+1) * sizeof(quicklistBookmark));
-    *ql_ref = ql;
-    ql->bookmarks[ql->bookmark_count].node = node;
-    ql->bookmarks[ql->bookmark_count].name = zstrdup(name);
-    ql->bookmark_count++;
-    return 1;
-}
-
-/* Find the quicklist node referenced by a named bookmark.
- * When the bookmarked node is deleted the bookmark is updated to the next node,
- * and if that's the last node, the bookmark is deleted (so find returns NULL). */
-quicklistNode *quicklistBookmarkFind(quicklist *ql, const char *name) {
-    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
-    if (!bm) return NULL;
-    return bm->node;
-}
-
-/* Delete a named bookmark.
- * returns 0 if bookmark was not found, and 1 if deleted.
- * Note that the bookmark memory is not freed yet, and is kept for future use. */
-int quicklistBookmarkDelete(quicklist *ql, const char *name) {
-    quicklistBookmark *bm = _quicklistBookmarkFindByName(ql, name);
-    if (!bm)
-        return 0;
-    _quicklistBookmarkDelete(ql, bm);
-    return 1;
-}
-
-quicklistBookmark *_quicklistBookmarkFindByName(quicklist *ql, const char *name) {
-    unsigned i;
-    for (i=0; i<ql->bookmark_count; i++) {
-        if (!strcmp(ql->bookmarks[i].name, name)) {
-            return &ql->bookmarks[i];
-        }
-    }
-    return NULL;
-}
-
-quicklistBookmark *_quicklistBookmarkFindByNode(quicklist *ql, quicklistNode *node) {
-    unsigned i;
-    for (i=0; i<ql->bookmark_count; i++) {
-        if (ql->bookmarks[i].node == node) {
-            return &ql->bookmarks[i];
-        }
-    }
-    return NULL;
-}
-
-void _quicklistBookmarkDelete(quicklist *ql, quicklistBookmark *bm) {
-    int index = bm - ql->bookmarks;
-    zfree(bm->name);
-    ql->bookmark_count--;
-    memmove(bm, bm+1, (ql->bookmark_count - index)* sizeof(*bm));
-    /* NOTE: We do not shrink (realloc) the quicklist yet (to avoid resonance,
-     * it may be re-used later (a call to realloc may NOP). */
-}
-
-void quicklistBookmarksClear(quicklist *ql) {
-    while (ql->bookmark_count)
-        zfree(ql->bookmarks[--ql->bookmark_count].name);
-    /* NOTE: We do not shrink (realloc) the quick list. main use case for this
-     * function is just before releasing the allocation. */
-}
-
-/* The rest of this file is test cases and test helpers. */
-#ifdef REDIS_TEST
-#include <stdint.h>
-#include <sys/time.h>
-
-#define yell(str, ...) printf("ERROR! " str "\n\n", __VA_ARGS__)
-
-#define ERROR                                                                  \
-    do {                                                                       \
-        printf("\tERROR!\n");                                                  \
-        err++;                                                                 \
-    } while (0)
-
-#define ERR(x, ...)                                                            \
-    do {                                                                       \
-        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
-        printf("ERROR! " x "\n", __VA_ARGS__);                                 \
-        err++;                                                                 \
-    } while (0)
-
-#define TEST(name) printf("test — %s\n", name);
-#define TEST_DESC(name, ...) printf("test — " name "\n", __VA_ARGS__);
-
-#define QL_TEST_VERBOSE 0
-
-#define UNUSED(x) (void)(x)
-static void ql_info(quicklist *ql) {
-#if QL_TEST_VERBOSE
-    printf("Container length: %lu\n", ql->len);
-    printf("Container size: %lu\n", ql->count);
-    if (ql->head)
-        printf("\t(zsize head: %d)\n", ziplistLen(ql->head->zl));
-    if (ql->tail)
-        printf("\t(zsize tail: %d)\n", ziplistLen(ql->tail->zl));
-    printf("\n");
-#else
-    UNUSED(ql);
-#endif
-}
-
-/* Return the UNIX time in microseconds */
-static long long ustime(void) {
-    struct timeval tv;
-    long long ust;
-
-    gettimeofday(&tv, NULL);
-    ust = ((long long)tv.tv_sec) * 1000000;
-    ust += tv.tv_usec;
-    return ust;
-}
-
-/* Return the UNIX time in milliseconds */
-static long long mstime(void) { return ustime() / 1000; }
-
-/* Iterate over an entire quicklist.
- * Print the list if 'print' == 1.
- *
- * Returns physical count of elements found by iterating over the list. */
-static int _itrprintr(quicklist *ql, int print, int forward) {
-    quicklistIter *iter =
-        quicklistGetIterator(ql, forward ? AL_START_HEAD : AL_START_TAIL);
-    quicklistEntry entry;
-    int i = 0;
-    int p = 0;
-    quicklistNode *prev = NULL;
-    while (quicklistNext(iter, &entry)) {
-        if (entry.node != prev) {
-            /* Count the number of list nodes too */
-            p++;
-            prev = entry.node;
-        }
-        if (print) {
-            printf("[%3d (%2d)]: [%.*s] (%lld)\n", i, p, entry.sz,
-                   (char *)entry.value, entry.longval);
-        }
-        i++;
-    }
-    quicklistReleaseIterator(iter);
-    return i;
-}
-static int itrprintr(quicklist *ql, int print) {
-    return _itrprintr(ql, print, 1);
-}
-
-static int itrprintr_rev(quicklist *ql, int print) {
-    return _itrprintr(ql, print, 0);
-}
-
-#define ql_verify(a, b, c, d, e)                                               \
-    do {                                                                       \
-        err += _ql_verify((a), (b), (c), (d), (e));                            \
-    } while (0)
-
-/* Verify list metadata matches physical list contents. */
-static int _ql_verify(quicklist *ql, uint32_t len, uint32_t count,
-                      uint32_t head_count, uint32_t tail_count) {
-    int errors = 0;
-
-    ql_info(ql);
-    if (len != ql->len) {
-        yell("quicklist length wrong: expected %d, got %lu", len, ql->len);
-        errors++;
-    }
-
-    if (count != ql->count) {
-        yell("quicklist count wrong: expected %d, got %lu", count, ql->count);
-        errors++;
-    }
-
-    int loopr = itrprintr(ql, 0);
-    if (loopr != (int)ql->count) {
-        yell("quicklist cached count not match actual count: expected %lu, got "
-             "%d",
-             ql->count, loopr);
-        errors++;
-    }
-
-    int rloopr = itrprintr_rev(ql, 0);
-    if (loopr != rloopr) {
-        yell("quicklist has different forward count than reverse count!  "
-             "Forward count is %d, reverse count is %d.",
-             loopr, rloopr);
-        errors++;
-    }
-
-    if (ql->len == 0 && !errors) {
-        return errors;
-    }
-
-    if (ql->head && head_count != ql->head->count &&
-        head_count != ziplistLen(ql->head->zl)) {
-        yell("quicklist head count wrong: expected %d, "
-             "got cached %d vs. actual %d",
-             head_count, ql->head->count, ziplistLen(ql->head->zl));
-        errors++;
-    }
-
-    if (ql->tail && tail_count != ql->tail->count &&
-        tail_count != ziplistLen(ql->tail->zl)) {
-        yell("quicklist tail count wrong: expected %d, "
-             "got cached %u vs. actual %d",
-             tail_count, ql->tail->count, ziplistLen(ql->tail->zl));
-        errors++;
-    }
-
-    if (quicklistAllowsCompression(ql)) {
-        quicklistNode *node = ql->head;
-        unsigned int low_raw = ql->compress;
-        unsigned int high_raw = ql->len - ql->compress;
-
-        for (unsigned int at = 0; at < ql->len; at++, node = node->next) {
-            if (node && (at < low_raw || at >= high_raw)) {
-                if (node->encoding != QUICKLIST_NODE_ENCODING_RAW) {
-                    yell("Incorrect compression: node %d is "
-                         "compressed at depth %d ((%u, %u); total "
-                         "nodes: %lu; size: %u; recompress: %d)",
-                         at, ql->compress, low_raw, high_raw, ql->len, node->sz,
-                         node->recompress);
-                    errors++;
-                }
-            } else {
-                if (node->encoding != QUICKLIST_NODE_ENCODING_LZF &&
-                    !node->attempted_compress) {
-                    yell("Incorrect non-compression: node %d is NOT "
-                         "compressed at depth %d ((%u, %u); total "
-                         "nodes: %lu; size: %u; recompress: %d; attempted: %d)",
-                         at, ql->compress, low_raw, high_raw, ql->len, node->sz,
-                         node->recompress, node->attempted_compress);
-                    errors++;
-                }
-            }
-        }
-    }
-
-    return errors;
-}
-
-/* Generate new string concatenating integer i against string 'prefix' */
-static char *genstr(char *prefix, int i) {
-    static char result[64] = {0};
-    snprintf(result, sizeof(result), "%s%d", prefix, i);
-    return result;
-}
-
-/* main test, but callable from other files */
-int quicklistTest(int argc, char *argv[], int accurate) {
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    unsigned int err = 0;
-    int optimize_start =
-        -(int)(sizeof(optimization_level) / sizeof(*optimization_level));
-
-    printf("Starting optimization offset at: %d\n", optimize_start);
-
-    int options[] = {0, 1, 2, 3, 4, 5, 6, 10};
-    int fills[] = {-5, -4, -3, -2, -1, 0,
-                   1, 2, 32, 66, 128, 999};
-    size_t option_count = sizeof(options) / sizeof(*options);
-    int fill_count = (int)(sizeof(fills) / sizeof(*fills));
-    long long runtime[option_count];
-
-    for (int _i = 0; _i < (int)option_count; _i++) {
-        printf("Testing Compression option %d\n", options[_i]);
-        long long start = mstime();
-
-        TEST("create list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("add to tail of empty list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushTail(ql, "hello", 6);
-            /* 1 for head and 1 for tail because 1 node = head = tail */
-            ql_verify(ql, 1, 1, 1, 1);
-            quicklistRelease(ql);
-        }
-
-        TEST("add to head of empty list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushHead(ql, "hello", 6);
-            /* 1 for head and 1 for tail because 1 node = head = tail */
-            ql_verify(ql, 1, 1, 1, 1);
-            quicklistRelease(ql);
-        }
-
-        TEST_DESC("add to tail 5x at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 5; i++)
-                    quicklistPushTail(ql, genstr("hello", i), 32);
-                if (ql->count != 5)
-                    ERROR;
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 5, 5, 5);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("add to head 5x at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 5; i++)
-                    quicklistPushHead(ql, genstr("hello", i), 32);
-                if (ql->count != 5)
-                    ERROR;
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 5, 5, 5);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("add to tail 500x at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushTail(ql, genstr("hello", i), 64);
-                if (ql->count != 500)
-                    ERROR;
-                if (fills[f] == 32)
-                    ql_verify(ql, 16, 500, 32, 20);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("add to head 500x at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushHead(ql, genstr("hello", i), 32);
-                if (ql->count != 500)
-                    ERROR;
-                if (fills[f] == 32)
-                    ql_verify(ql, 16, 500, 20, 32);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST("rotate empty") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistRotate(ql);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("rotate one val once") {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                quicklistPushHead(ql, "hello", 6);
-                quicklistRotate(ql);
-                /* Ignore compression verify because ziplist is
-                 * too small to compress. */
-                ql_verify(ql, 1, 1, 1, 1);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("rotate 500 val 5000 times at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                quicklistPushHead(ql, "900", 3);
-                quicklistPushHead(ql, "7000", 4);
-                quicklistPushHead(ql, "-1200", 5);
-                quicklistPushHead(ql, "42", 2);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushHead(ql, genstr("hello", i), 64);
-                ql_info(ql);
-                for (int i = 0; i < 5000; i++) {
-                    ql_info(ql);
-                    quicklistRotate(ql);
-                }
-                if (fills[f] == 1)
-                    ql_verify(ql, 504, 504, 1, 1);
-                else if (fills[f] == 2)
-                    ql_verify(ql, 252, 504, 2, 2);
-                else if (fills[f] == 32)
-                    ql_verify(ql, 16, 504, 32, 24);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST("pop empty") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPop(ql, QUICKLIST_HEAD, NULL, NULL, NULL);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("pop 1 string from 1") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            char *populate = genstr("hello", 331);
-            quicklistPushHead(ql, populate, 32);
-            unsigned char *data;
-            unsigned int sz;
-            long long lv;
-            ql_info(ql);
-            quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
-            assert(data != NULL);
-            assert(sz == 32);
-            if (strcmp(populate, (char *)data))
-                ERR("Pop'd value (%.*s) didn't equal original value (%s)", sz,
-                    data, populate);
-            zfree(data);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("pop head 1 number from 1") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushHead(ql, "55513", 5);
-            unsigned char *data;
-            unsigned int sz;
-            long long lv;
-            ql_info(ql);
-            quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
-            assert(data == NULL);
-            assert(lv == 55513);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("pop head 500 from 500") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            for (int i = 0; i < 500; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            ql_info(ql);
-            for (int i = 0; i < 500; i++) {
-                unsigned char *data;
-                unsigned int sz;
-                long long lv;
-                int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
-                assert(ret == 1);
-                assert(data != NULL);
-                assert(sz == 32);
-                if (strcmp(genstr("hello", 499 - i), (char *)data))
-                    ERR("Pop'd value (%.*s) didn't equal original value (%s)",
-                        sz, data, genstr("hello", 499 - i));
-                zfree(data);
-            }
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("pop head 5000 from 500") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            for (int i = 0; i < 500; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            for (int i = 0; i < 5000; i++) {
-                unsigned char *data;
-                unsigned int sz;
-                long long lv;
-                int ret = quicklistPop(ql, QUICKLIST_HEAD, &data, &sz, &lv);
-                if (i < 500) {
-                    assert(ret == 1);
-                    assert(data != NULL);
-                    assert(sz == 32);
-                    if (strcmp(genstr("hello", 499 - i), (char *)data))
-                        ERR("Pop'd value (%.*s) didn't equal original value "
-                            "(%s)",
-                            sz, data, genstr("hello", 499 - i));
-                    zfree(data);
-                } else {
-                    assert(ret == 0);
-                }
-            }
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("iterate forward over 500 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
-            quicklistEntry entry;
-            int i = 499, count = 0;
-            while (quicklistNext(iter, &entry)) {
-                char *h = genstr("hello", i);
-                if (strcmp((char *)entry.value, h))
-                    ERR("value [%s] didn't match [%s] at position %d",
-                        entry.value, h, i);
-                i--;
-                count++;
-            }
-            if (count != 500)
-                ERR("Didn't iterate over exactly 500 elements (%d)", i);
-            ql_verify(ql, 16, 500, 20, 32);
-            quicklistReleaseIterator(iter);
-            quicklistRelease(ql);
-        }
-
-        TEST("iterate reverse over 500 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            quicklistIter *iter = quicklistGetIterator(ql, AL_START_TAIL);
-            quicklistEntry entry;
-            int i = 0;
-            while (quicklistNext(iter, &entry)) {
-                char *h = genstr("hello", i);
-                if (strcmp((char *)entry.value, h))
-                    ERR("value [%s] didn't match [%s] at position %d",
-                        entry.value, h, i);
-                i++;
-            }
-            if (i != 500)
-                ERR("Didn't iterate over exactly 500 elements (%d)", i);
-            ql_verify(ql, 16, 500, 20, 32);
-            quicklistReleaseIterator(iter);
-            quicklistRelease(ql);
-        }
-
-        TEST("insert before with 0 elements") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistEntry entry;
-            quicklistIndex(ql, 0, &entry);
-            quicklistInsertBefore(ql, &entry, "abc", 4);
-            ql_verify(ql, 1, 1, 1, 1);
-            quicklistRelease(ql);
-        }
-
-        TEST("insert after with 0 elements") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistEntry entry;
-            quicklistIndex(ql, 0, &entry);
-            quicklistInsertAfter(ql, &entry, "abc", 4);
-            ql_verify(ql, 1, 1, 1, 1);
-            quicklistRelease(ql);
-        }
-
-        TEST("insert after 1 element") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushHead(ql, "hello", 6);
-            quicklistEntry entry;
-            quicklistIndex(ql, 0, &entry);
-            quicklistInsertAfter(ql, &entry, "abc", 4);
-            ql_verify(ql, 1, 2, 2, 2);
-            quicklistRelease(ql);
-        }
-
-        TEST("insert before 1 element") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushHead(ql, "hello", 6);
-            quicklistEntry entry;
-            quicklistIndex(ql, 0, &entry);
-            quicklistInsertAfter(ql, &entry, "abc", 4);
-            ql_verify(ql, 1, 2, 2, 2);
-            quicklistRelease(ql);
-        }
-
-        TEST_DESC("insert once in elements while iterating at compress %d",
-                  options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                quicklistPushTail(ql, "abc", 3);
-                quicklistSetFill(ql, 1);
-                quicklistPushTail(ql, "def", 3); /* force to unique node */
-                quicklistSetFill(ql, f);
-                quicklistPushTail(ql, "bob", 3); /* force to reset for +3 */
-                quicklistPushTail(ql, "foo", 3);
-                quicklistPushTail(ql, "zoo", 3);
-
-                itrprintr(ql, 0);
-                /* insert "bar" before "bob" while iterating over list. */
-                quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
-                quicklistEntry entry;
-                while (quicklistNext(iter, &entry)) {
-                    if (!strncmp((char *)entry.value, "bob", 3)) {
-                        /* Insert as fill = 1 so it spills into new node. */
-                        quicklistInsertBefore(ql, &entry, "bar", 3);
-                        break; /* didn't we fix insert-while-iterating? */
-                    }
-                }
-                itrprintr(ql, 0);
-
-                /* verify results */
-                quicklistIndex(ql, 0, &entry);
-                if (strncmp((char *)entry.value, "abc", 3))
-                    ERR("Value 0 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistIndex(ql, 1, &entry);
-                if (strncmp((char *)entry.value, "def", 3))
-                    ERR("Value 1 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistIndex(ql, 2, &entry);
-                if (strncmp((char *)entry.value, "bar", 3))
-                    ERR("Value 2 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistIndex(ql, 3, &entry);
-                if (strncmp((char *)entry.value, "bob", 3))
-                    ERR("Value 3 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistIndex(ql, 4, &entry);
-                if (strncmp((char *)entry.value, "foo", 3))
-                    ERR("Value 4 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistIndex(ql, 5, &entry);
-                if (strncmp((char *)entry.value, "zoo", 3))
-                    ERR("Value 5 didn't match, instead got: %.*s", entry.sz,
-                        entry.value);
-                quicklistReleaseIterator(iter);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("insert [before] 250 new in middle of 500 elements at compress %d",
-                  options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushTail(ql, genstr("hello", i), 32);
-                for (int i = 0; i < 250; i++) {
-                    quicklistEntry entry;
-                    quicklistIndex(ql, 250, &entry);
-                    quicklistInsertBefore(ql, &entry, genstr("abc", i), 32);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 25, 750, 32, 20);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("insert [after] 250 new in middle of 500 elements at compress %d",
-                  options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushHead(ql, genstr("hello", i), 32);
-                for (int i = 0; i < 250; i++) {
-                    quicklistEntry entry;
-                    quicklistIndex(ql, 250, &entry);
-                    quicklistInsertAfter(ql, &entry, genstr("abc", i), 32);
-                }
-
-                if (ql->count != 750)
-                    ERR("List size not 750, but rather %ld", ql->count);
-
-                if (fills[f] == 32)
-                    ql_verify(ql, 26, 750, 20, 32);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST("duplicate empty list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklist *copy = quicklistDup(ql);
-            ql_verify(copy, 0, 0, 0, 0);
-            quicklistRelease(ql);
-            quicklistRelease(copy);
-        }
-
-        TEST("duplicate list of 1 element") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushHead(ql, genstr("hello", 3), 32);
-            ql_verify(ql, 1, 1, 1, 1);
-            quicklist *copy = quicklistDup(ql);
-            ql_verify(copy, 1, 1, 1, 1);
-            quicklistRelease(ql);
-            quicklistRelease(copy);
-        }
-
-        TEST("duplicate list of 500") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            ql_verify(ql, 16, 500, 20, 32);
-
-            quicklist *copy = quicklistDup(ql);
-            ql_verify(copy, 16, 500, 20, 32);
-            quicklistRelease(ql);
-            quicklistRelease(copy);
-        }
-
-        for (int f = 0; f < fill_count; f++) {
-            TEST_DESC("index 1,200 from 500 list at fill %d at compress %d", f,
-                      options[_i]) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
-                quicklistEntry entry;
-                quicklistIndex(ql, 1, &entry);
-                if (strcmp((char *)entry.value, "hello2") != 0)
-                    ERR("Value: %s", entry.value);
-                quicklistIndex(ql, 200, &entry);
-                if (strcmp((char *)entry.value, "hello201") != 0)
-                    ERR("Value: %s", entry.value);
-                quicklistRelease(ql);
-            }
-
-            TEST_DESC("index -1,-2 from 500 list at fill %d at compress %d",
-                      fills[f], options[_i]) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
-                quicklistEntry entry;
-                quicklistIndex(ql, -1, &entry);
-                if (strcmp((char *)entry.value, "hello500") != 0)
-                    ERR("Value: %s", entry.value);
-                quicklistIndex(ql, -2, &entry);
-                if (strcmp((char *)entry.value, "hello499") != 0)
-                    ERR("Value: %s", entry.value);
-                quicklistRelease(ql);
-            }
-
-            TEST_DESC("index -100 from 500 list at fill %d at compress %d",
-                      fills[f], options[_i]) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 500; i++)
-                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
-                quicklistEntry entry;
-                quicklistIndex(ql, -100, &entry);
-                if (strcmp((char *)entry.value, "hello401") != 0)
-                    ERR("Value: %s", entry.value);
-                quicklistRelease(ql);
-            }
-
-            TEST_DESC("index too big +1 from 50 list at fill %d at compress %d",
-                      fills[f], options[_i]) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                for (int i = 0; i < 50; i++)
-                    quicklistPushTail(ql, genstr("hello", i + 1), 32);
-                quicklistEntry entry;
-                if (quicklistIndex(ql, 50, &entry))
-                    ERR("Index found at 50 with 50 list: %.*s", entry.sz,
-                        entry.value);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST("delete range empty list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistDelRange(ql, 5, 20);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete range of entire node in list of one node") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            for (int i = 0; i < 32; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            ql_verify(ql, 1, 32, 32, 32);
-            quicklistDelRange(ql, 0, 32);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete range of entire node with overflow counts") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            for (int i = 0; i < 32; i++)
-                quicklistPushHead(ql, genstr("hello", i), 32);
-            ql_verify(ql, 1, 32, 32, 32);
-            quicklistDelRange(ql, 0, 128);
-            ql_verify(ql, 0, 0, 0, 0);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete middle 100 of 500 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            ql_verify(ql, 16, 500, 32, 20);
-            quicklistDelRange(ql, 200, 100);
-            ql_verify(ql, 14, 400, 32, 20);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete less than fill but across nodes") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            ql_verify(ql, 16, 500, 32, 20);
-            quicklistDelRange(ql, 60, 10);
-            ql_verify(ql, 16, 490, 32, 20);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete negative 1 from 500 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            ql_verify(ql, 16, 500, 32, 20);
-            quicklistDelRange(ql, -1, 1);
-            ql_verify(ql, 16, 499, 32, 19);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete negative 1 from 500 list with overflow counts") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            ql_verify(ql, 16, 500, 32, 20);
-            quicklistDelRange(ql, -1, 128);
-            ql_verify(ql, 16, 499, 32, 19);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete negative 100 from 500 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 500; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            quicklistDelRange(ql, -100, 100);
-            ql_verify(ql, 13, 400, 32, 16);
-            quicklistRelease(ql);
-        }
-
-        TEST("delete -10 count 5 from 50 list") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            for (int i = 0; i < 50; i++)
-                quicklistPushTail(ql, genstr("hello", i + 1), 32);
-            ql_verify(ql, 2, 50, 32, 18);
-            quicklistDelRange(ql, -10, 5);
-            ql_verify(ql, 2, 45, 32, 13);
-            quicklistRelease(ql);
-        }
-
-        TEST("numbers only list read") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushTail(ql, "1111", 4);
-            quicklistPushTail(ql, "2222", 4);
-            quicklistPushTail(ql, "3333", 4);
-            quicklistPushTail(ql, "4444", 4);
-            ql_verify(ql, 1, 4, 4, 4);
-            quicklistEntry entry;
-            quicklistIndex(ql, 0, &entry);
-            if (entry.longval != 1111)
-                ERR("Not 1111, %lld", entry.longval);
-            quicklistIndex(ql, 1, &entry);
-            if (entry.longval != 2222)
-                ERR("Not 2222, %lld", entry.longval);
-            quicklistIndex(ql, 2, &entry);
-            if (entry.longval != 3333)
-                ERR("Not 3333, %lld", entry.longval);
-            quicklistIndex(ql, 3, &entry);
-            if (entry.longval != 4444)
-                ERR("Not 4444, %lld", entry.longval);
-            if (quicklistIndex(ql, 4, &entry))
-                ERR("Index past elements: %lld", entry.longval);
-            quicklistIndex(ql, -1, &entry);
-            if (entry.longval != 4444)
-                ERR("Not 4444 (reverse), %lld", entry.longval);
-            quicklistIndex(ql, -2, &entry);
-            if (entry.longval != 3333)
-                ERR("Not 3333 (reverse), %lld", entry.longval);
-            quicklistIndex(ql, -3, &entry);
-            if (entry.longval != 2222)
-                ERR("Not 2222 (reverse), %lld", entry.longval);
-            quicklistIndex(ql, -4, &entry);
-            if (entry.longval != 1111)
-                ERR("Not 1111 (reverse), %lld", entry.longval);
-            if (quicklistIndex(ql, -5, &entry))
-                ERR("Index past elements (reverse), %lld", entry.longval);
-            quicklistRelease(ql);
-        }
-
-        TEST("numbers larger list read") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistSetFill(ql, 32);
-            char num[32];
-            long long nums[5000];
-            for (int i = 0; i < 5000; i++) {
-                nums[i] = -5157318210846258176 + i;
-                int sz = ll2string(num, sizeof(num), nums[i]);
-                quicklistPushTail(ql, num, sz);
-            }
-            quicklistPushTail(ql, "xxxxxxxxxxxxxxxxxxxx", 20);
-            quicklistEntry entry;
-            for (int i = 0; i < 5000; i++) {
-                quicklistIndex(ql, i, &entry);
-                if (entry.longval != nums[i])
-                    ERR("[%d] Not longval %lld but rather %lld", i, nums[i],
-                        entry.longval);
-                entry.longval = 0xdeadbeef;
-            }
-            quicklistIndex(ql, 5000, &entry);
-            if (strncmp((char *)entry.value, "xxxxxxxxxxxxxxxxxxxx", 20))
-                ERR("String val not match: %s", entry.value);
-            ql_verify(ql, 157, 5001, 32, 9);
-            quicklistRelease(ql);
-        }
-
-        TEST("numbers larger list read B") {
-            quicklist *ql = quicklistNew(-2, options[_i]);
-            quicklistPushTail(ql, "99", 2);
-            quicklistPushTail(ql, "98", 2);
-            quicklistPushTail(ql, "xxxxxxxxxxxxxxxxxxxx", 20);
-            quicklistPushTail(ql, "96", 2);
-            quicklistPushTail(ql, "95", 2);
-            quicklistReplaceAtIndex(ql, 1, "foo", 3);
-            quicklistReplaceAtIndex(ql, -1, "bar", 3);
-            quicklistRelease(ql);
-        }
-
-        TEST_DESC("lrem test at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                char *words[] = {"abc", "foo", "bar",  "foobar", "foobared",
-                                 "zap", "bar", "test", "foo"};
-                char *result[] = {"abc", "foo",  "foobar", "foobared",
-                                  "zap", "test", "foo"};
-                char *resultB[] = {"abc",      "foo", "foobar",
-                                   "foobared", "zap", "test"};
-                for (int i = 0; i < 9; i++)
-                    quicklistPushTail(ql, words[i], strlen(words[i]));
-
-                /* lrem 0 bar */
-                quicklistIter *iter = quicklistGetIterator(ql, AL_START_HEAD);
-                quicklistEntry entry;
-                int i = 0;
-                while (quicklistNext(iter, &entry)) {
-                    if (quicklistCompare(entry.zi, (unsigned char *)"bar", 3)) {
-                        quicklistDelEntry(iter, &entry);
-                    }
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-
-                /* check result of lrem 0 bar */
-                iter = quicklistGetIterator(ql, AL_START_HEAD);
-                i = 0;
-                while (quicklistNext(iter, &entry)) {
-                    /* Result must be: abc, foo, foobar, foobared, zap, test,
-                     * foo */
-                    if (strncmp((char *)entry.value, result[i], entry.sz)) {
-                        ERR("No match at position %d, got %.*s instead of %s",
-                            i, entry.sz, entry.value, result[i]);
-                    }
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-
-                quicklistPushTail(ql, "foo", 3);
-
-                /* lrem -2 foo */
-                iter = quicklistGetIterator(ql, AL_START_TAIL);
-                i = 0;
-                int del = 2;
-                while (quicklistNext(iter, &entry)) {
-                    if (quicklistCompare(entry.zi, (unsigned char *)"foo", 3)) {
-                        quicklistDelEntry(iter, &entry);
-                        del--;
-                    }
-                    if (!del)
-                        break;
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-
-                /* check result of lrem -2 foo */
-                /* (we're ignoring the '2' part and still deleting all foo
-                 * because
-                 * we only have two foo) */
-                iter = quicklistGetIterator(ql, AL_START_TAIL);
-                i = 0;
-                size_t resB = sizeof(resultB) / sizeof(*resultB);
-                while (quicklistNext(iter, &entry)) {
-                    /* Result must be: abc, foo, foobar, foobared, zap, test,
-                     * foo */
-                    if (strncmp((char *)entry.value, resultB[resB - 1 - i],
-                                entry.sz)) {
-                        ERR("No match at position %d, got %.*s instead of %s",
-                            i, entry.sz, entry.value, resultB[resB - 1 - i]);
-                    }
-                    i++;
-                }
-
-                quicklistReleaseIterator(iter);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("iterate reverse + delete at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                quicklistPushTail(ql, "abc", 3);
-                quicklistPushTail(ql, "def", 3);
-                quicklistPushTail(ql, "hij", 3);
-                quicklistPushTail(ql, "jkl", 3);
-                quicklistPushTail(ql, "oop", 3);
-
-                quicklistEntry entry;
-                quicklistIter *iter = quicklistGetIterator(ql, AL_START_TAIL);
-                int i = 0;
-                while (quicklistNext(iter, &entry)) {
-                    if (quicklistCompare(entry.zi, (unsigned char *)"hij", 3)) {
-                        quicklistDelEntry(iter, &entry);
-                    }
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-
-                if (i != 5)
-                    ERR("Didn't iterate 5 times, iterated %d times.", i);
-
-                /* Check results after deletion of "hij" */
-                iter = quicklistGetIterator(ql, AL_START_HEAD);
-                i = 0;
-                char *vals[] = {"abc", "def", "jkl", "oop"};
-                while (quicklistNext(iter, &entry)) {
-                    if (!quicklistCompare(entry.zi, (unsigned char *)vals[i],
-                                          3)) {
-                        ERR("Value at %d didn't match %s\n", i, vals[i]);
-                    }
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("iterator at index test at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                char num[32];
-                long long nums[5000];
-                for (int i = 0; i < 760; i++) {
-                    nums[i] = -5157318210846258176 + i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    quicklistPushTail(ql, num, sz);
-                }
-
-                quicklistEntry entry;
-                quicklistIter *iter =
-                    quicklistGetIteratorAtIdx(ql, AL_START_HEAD, 437);
-                int i = 437;
-                while (quicklistNext(iter, &entry)) {
-                    if (entry.longval != nums[i])
-                        ERR("Expected %lld, but got %lld", entry.longval,
-                            nums[i]);
-                    i++;
-                }
-                quicklistReleaseIterator(iter);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("ltrim test A at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                char num[32];
-                long long nums[5000];
-                for (int i = 0; i < 32; i++) {
-                    nums[i] = -5157318210846258176 + i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    quicklistPushTail(ql, num, sz);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 32, 32, 32);
-                /* ltrim 25 53 (keep [25,32] inclusive = 7 remaining) */
-                quicklistDelRange(ql, 0, 25);
-                quicklistDelRange(ql, 0, 0);
-                quicklistEntry entry;
-                for (int i = 0; i < 7; i++) {
-                    quicklistIndex(ql, i, &entry);
-                    if (entry.longval != nums[25 + i])
-                        ERR("Deleted invalid range!  Expected %lld but got "
-                            "%lld",
-                            entry.longval, nums[25 + i]);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 7, 7, 7);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("ltrim test B at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                /* Force-disable compression because our 33 sequential
-                 * integers don't compress and the check always fails. */
-                quicklist *ql = quicklistNew(fills[f], QUICKLIST_NOCOMPRESS);
-                char num[32];
-                long long nums[5000];
-                for (int i = 0; i < 33; i++) {
-                    nums[i] = i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    quicklistPushTail(ql, num, sz);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 2, 33, 32, 1);
-                /* ltrim 5 16 (keep [5,16] inclusive = 12 remaining) */
-                quicklistDelRange(ql, 0, 5);
-                quicklistDelRange(ql, -16, 16);
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 12, 12, 12);
-                quicklistEntry entry;
-                quicklistIndex(ql, 0, &entry);
-                if (entry.longval != 5)
-                    ERR("A: longval not 5, but %lld", entry.longval);
-                quicklistIndex(ql, -1, &entry);
-                if (entry.longval != 16)
-                    ERR("B! got instead: %lld", entry.longval);
-                quicklistPushTail(ql, "bobobob", 7);
-                quicklistIndex(ql, -1, &entry);
-                if (strncmp((char *)entry.value, "bobobob", 7))
-                    ERR("Tail doesn't match bobobob, it's %.*s instead",
-                        entry.sz, entry.value);
-                for (int i = 0; i < 12; i++) {
-                    quicklistIndex(ql, i, &entry);
-                    if (entry.longval != nums[5 + i])
-                        ERR("Deleted invalid range!  Expected %lld but got "
-                            "%lld",
-                            entry.longval, nums[5 + i]);
-                }
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("ltrim test C at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                char num[32];
-                long long nums[5000];
-                for (int i = 0; i < 33; i++) {
-                    nums[i] = -5157318210846258176 + i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    quicklistPushTail(ql, num, sz);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 2, 33, 32, 1);
-                /* ltrim 3 3 (keep [3,3] inclusive = 1 remaining) */
-                quicklistDelRange(ql, 0, 3);
-                quicklistDelRange(ql, -29,
-                                  4000); /* make sure not loop forever */
-                if (fills[f] == 32)
-                    ql_verify(ql, 1, 1, 1, 1);
-                quicklistEntry entry;
-                quicklistIndex(ql, 0, &entry);
-                if (entry.longval != -5157318210846258173)
-                    ERROR;
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("ltrim test D at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                quicklist *ql = quicklistNew(fills[f], options[_i]);
-                char num[32];
-                long long nums[5000];
-                for (int i = 0; i < 33; i++) {
-                    nums[i] = -5157318210846258176 + i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    quicklistPushTail(ql, num, sz);
-                }
-                if (fills[f] == 32)
-                    ql_verify(ql, 2, 33, 32, 1);
-                quicklistDelRange(ql, -12, 3);
-                if (ql->count != 30)
-                    ERR("Didn't delete exactly three elements!  Count is: %lu",
-                        ql->count);
-                quicklistRelease(ql);
-            }
-        }
-
-        TEST_DESC("create quicklist from ziplist at compress %d", options[_i]) {
-            for (int f = 0; f < fill_count; f++) {
-                unsigned char *zl = ziplistNew();
-                long long nums[64];
-                char num[64];
-                for (int i = 0; i < 33; i++) {
-                    nums[i] = -5157318210846258176 + i;
-                    int sz = ll2string(num, sizeof(num), nums[i]);
-                    zl =
-                        ziplistPush(zl, (unsigned char *)num, sz, ZIPLIST_TAIL);
-                }
-                for (int i = 0; i < 33; i++) {
-                    zl = ziplistPush(zl, (unsigned char *)genstr("hello", i),
-                                     32, ZIPLIST_TAIL);
-                }
-                quicklist *ql = quicklistCreateFromZiplist(fills[f], options[_i], zl);
-                if (fills[f] == 1)
-                    ql_verify(ql, 66, 66, 1, 1);
-                else if (fills[f] == 32)
-                    ql_verify(ql, 3, 66, 32, 2);
-                else if (fills[f] == 66)
-                    ql_verify(ql, 1, 66, 66, 66);
-                quicklistRelease(ql);
-            }
-        }
-
-        long long stop = mstime();
-        runtime[_i] = stop - start;
-    }
-
-    /* Run a longer test of compression depth outside of primary test loop. */
-    int list_sizes[] = {250, 251, 500, 999, 1000};
-    long long start = mstime();
-    int list_count = accurate ? (int)(sizeof(list_sizes) / sizeof(*list_sizes)) : 1;
-    for (int list = 0; list < list_count; list++) {
-        TEST_DESC("verify specific compression of interior nodes with %d list ",
-                  list_sizes[list]) {
-            for (int f = 0; f < fill_count; f++) {
-                for (int depth = 1; depth < 40; depth++) {
-                    /* skip over many redundant test cases */
-                    quicklist *ql = quicklistNew(fills[f], depth);
-                    for (int i = 0; i < list_sizes[list]; i++) {
-                        quicklistPushTail(ql, genstr("hello TAIL", i + 1), 64);
-                        quicklistPushHead(ql, genstr("hello HEAD", i + 1), 64);
-                    }
-
-                    for (int step = 0; step < 2; step++) {
-                        /* test remove node */
-                        if (step == 1) {
-                            for (int i = 0; i < list_sizes[list] / 2; i++) {
-                                unsigned char *data;
-                                quicklistPop(ql, QUICKLIST_HEAD, &data, NULL, NULL);
-                                zfree(data);
-                                quicklistPop(ql, QUICKLIST_TAIL, &data, NULL, NULL);
-                                zfree(data);
-                            }
-                        }
-                        quicklistNode *node = ql->head;
-                        unsigned int low_raw = ql->compress;
-                        unsigned int high_raw = ql->len - ql->compress;
-
-                        for (unsigned int at = 0; at < ql->len;
-                            at++, node = node->next) {
-                            if (at < low_raw || at >= high_raw) {
-                                if (node->encoding != QUICKLIST_NODE_ENCODING_RAW) {
-                                    ERR("Incorrect compression: node %d is "
-                                        "compressed at depth %d ((%u, %u); total "
-                                        "nodes: %lu; size: %u)",
-                                        at, depth, low_raw, high_raw, ql->len,
-                                        node->sz);
-                                }
-                            } else {
-                                if (node->encoding != QUICKLIST_NODE_ENCODING_LZF) {
-                                    ERR("Incorrect non-compression: node %d is NOT "
-                                        "compressed at depth %d ((%u, %u); total "
-                                        "nodes: %lu; size: %u; attempted: %d)",
-                                        at, depth, low_raw, high_raw, ql->len,
-                                        node->sz, node->attempted_compress);
-                                }
-                            }
-                        }
-                    }
-
-                    quicklistRelease(ql);
-                }
-            }
-        }
-    }
-    long long stop = mstime();
-
-    printf("\n");
-    for (size_t i = 0; i < option_count; i++)
-        printf("Test Loop %02d: %0.2f seconds.\n", options[i],
-               (float)runtime[i] / 1000);
-    printf("Compressions: %0.2f seconds.\n", (float)(stop - start) / 1000);
-    printf("\n");
-
-    TEST("bookmark get updated to next item") {
-        quicklist *ql = quicklistNew(1, 0);
-        quicklistPushTail(ql, "1", 1);
-        quicklistPushTail(ql, "2", 1);
-        quicklistPushTail(ql, "3", 1);
-        quicklistPushTail(ql, "4", 1);
-        quicklistPushTail(ql, "5", 1);
-        assert(ql->len==5);
-        /* add two bookmarks, one pointing to the node before the last. */
-        assert(quicklistBookmarkCreate(&ql, "_dummy", ql->head->next));
-        assert(quicklistBookmarkCreate(&ql, "_test", ql->tail->prev));
-        /* test that the bookmark returns the right node, delete it and see that the bookmark points to the last node */
-        assert(quicklistBookmarkFind(ql, "_test") == ql->tail->prev);
-        assert(quicklistDelRange(ql, -2, 1));
-        assert(quicklistBookmarkFind(ql, "_test") == ql->tail);
-        /* delete the last node, and see that the bookmark was deleted. */
-        assert(quicklistDelRange(ql, -1, 1));
-        assert(quicklistBookmarkFind(ql, "_test") == NULL);
-        /* test that other bookmarks aren't affected */
-        assert(quicklistBookmarkFind(ql, "_dummy") == ql->head->next);
-        assert(quicklistBookmarkFind(ql, "_missing") == NULL);
-        assert(ql->len==3);
-        quicklistBookmarksClear(ql); /* for coverage */
-        assert(quicklistBookmarkFind(ql, "_dummy") == NULL);
-        quicklistRelease(ql);
-    }
-
-    TEST("bookmark limit") {
-        int i;
-        quicklist *ql = quicklistNew(1, 0);
-        quicklistPushHead(ql, "1", 1);
-        for (i=0; i<QL_MAX_BM; i++)
-            assert(quicklistBookmarkCreate(&ql, genstr("",i), ql->head));
-        /* when all bookmarks are used, creation fails */
-        assert(!quicklistBookmarkCreate(&ql, "_test", ql->head));
-        /* delete one and see that we can now create another */
-        assert(quicklistBookmarkDelete(ql, "0"));
-        assert(quicklistBookmarkCreate(&ql, "_test", ql->head));
-        /* delete one and see that the rest survive */
-        assert(quicklistBookmarkDelete(ql, "_test"));
-        for (i=1; i<QL_MAX_BM; i++)
-            assert(quicklistBookmarkFind(ql, genstr("",i)) == ql->head);
-        /* make sure the deleted ones are indeed gone */
-        assert(!quicklistBookmarkFind(ql, "0"));
-        assert(!quicklistBookmarkFind(ql, "_test"));
-        quicklistRelease(ql);
-    }
-
-    if (!err)
-        printf("ALL TESTS PASSED!\n");
-    else
-        ERR("Sorry, not all tests passed!  In fact, %d tests failed.", err);
-
-    return err;
-}
-#endif
diff --git a/redis-stable/src/quicklist.h b/redis-stable/src/quicklist.h
deleted file mode 100644
index c9f493d8..00000000
--- a/redis-stable/src/quicklist.h
+++ /dev/null
@@ -1,209 +0,0 @@
-/* quicklist.h - A generic doubly linked quicklist implementation
- *
- * Copyright (c) 2014, Matt Stancliff <matt@genges.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this quicklist of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this quicklist of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdint.h> // for UINTPTR_MAX
-
-#ifndef __QUICKLIST_H__
-#define __QUICKLIST_H__
-
-/* Node, quicklist, and Iterator are the only data structures used currently. */
-
-/* quicklistNode is a 32 byte struct describing a ziplist for a quicklist.
- * We use bit fields keep the quicklistNode at 32 bytes.
- * count: 16 bits, max 65536 (max zl bytes is 65k, so max count actually < 32k).
- * encoding: 2 bits, RAW=1, LZF=2.
- * container: 2 bits, NONE=1, ZIPLIST=2.
- * recompress: 1 bit, bool, true if node is temporary decompressed for usage.
- * attempted_compress: 1 bit, boolean, used for verifying during testing.
- * extra: 10 bits, free for future use; pads out the remainder of 32 bits */
-typedef struct quicklistNode {
-    struct quicklistNode *prev;
-    struct quicklistNode *next;
-    unsigned char *zl;
-    unsigned int sz;             /* ziplist size in bytes */
-    unsigned int count : 16;     /* count of items in ziplist */
-    unsigned int encoding : 2;   /* RAW==1 or LZF==2 */
-    unsigned int container : 2;  /* NONE==1 or ZIPLIST==2 */
-    unsigned int recompress : 1; /* was this node previous compressed? */
-    unsigned int attempted_compress : 1; /* node can't compress; too small */
-    unsigned int extra : 10; /* more bits to steal for future usage */
-} quicklistNode;
-
-/* quicklistLZF is a 4+N byte struct holding 'sz' followed by 'compressed'.
- * 'sz' is byte length of 'compressed' field.
- * 'compressed' is LZF data with total (compressed) length 'sz'
- * NOTE: uncompressed length is stored in quicklistNode->sz.
- * When quicklistNode->zl is compressed, node->zl points to a quicklistLZF */
-typedef struct quicklistLZF {
-    unsigned int sz; /* LZF size in bytes*/
-    char compressed[];
-} quicklistLZF;
-
-/* Bookmarks are padded with realloc at the end of of the quicklist struct.
- * They should only be used for very big lists if thousands of nodes were the
- * excess memory usage is negligible, and there's a real need to iterate on them
- * in portions.
- * When not used, they don't add any memory overhead, but when used and then
- * deleted, some overhead remains (to avoid resonance).
- * The number of bookmarks used should be kept to minimum since it also adds
- * overhead on node deletion (searching for a bookmark to update). */
-typedef struct quicklistBookmark {
-    quicklistNode *node;
-    char *name;
-} quicklistBookmark;
-
-#if UINTPTR_MAX == 0xffffffff
-/* 32-bit */
-#   define QL_FILL_BITS 14
-#   define QL_COMP_BITS 14
-#   define QL_BM_BITS 4
-#elif UINTPTR_MAX == 0xffffffffffffffff
-/* 64-bit */
-#   define QL_FILL_BITS 16
-#   define QL_COMP_BITS 16
-#   define QL_BM_BITS 4 /* we can encode more, but we rather limit the user
-                           since they cause performance degradation. */
-#else
-#   error unknown arch bits count
-#endif
-
-/* quicklist is a 40 byte struct (on 64-bit systems) describing a quicklist.
- * 'count' is the number of total entries.
- * 'len' is the number of quicklist nodes.
- * 'compress' is: 0 if compression disabled, otherwise it's the number
- *                of quicklistNodes to leave uncompressed at ends of quicklist.
- * 'fill' is the user-requested (or default) fill factor.
- * 'bookmakrs are an optional feature that is used by realloc this struct,
- *      so that they don't consume memory when not used. */
-typedef struct quicklist {
-    quicklistNode *head;
-    quicklistNode *tail;
-    unsigned long count;        /* total count of all entries in all ziplists */
-    unsigned long len;          /* number of quicklistNodes */
-    int fill : QL_FILL_BITS;              /* fill factor for individual nodes */
-    unsigned int compress : QL_COMP_BITS; /* depth of end nodes not to compress;0=off */
-    unsigned int bookmark_count: QL_BM_BITS;
-    quicklistBookmark bookmarks[];
-} quicklist;
-
-typedef struct quicklistIter {
-    const quicklist *quicklist;
-    quicklistNode *current;
-    unsigned char *zi;
-    long offset; /* offset in current ziplist */
-    int direction;
-} quicklistIter;
-
-typedef struct quicklistEntry {
-    const quicklist *quicklist;
-    quicklistNode *node;
-    unsigned char *zi;
-    unsigned char *value;
-    long long longval;
-    unsigned int sz;
-    int offset;
-} quicklistEntry;
-
-#define QUICKLIST_HEAD 0
-#define QUICKLIST_TAIL -1
-
-/* quicklist node encodings */
-#define QUICKLIST_NODE_ENCODING_RAW 1
-#define QUICKLIST_NODE_ENCODING_LZF 2
-
-/* quicklist compression disable */
-#define QUICKLIST_NOCOMPRESS 0
-
-/* quicklist container formats */
-#define QUICKLIST_NODE_CONTAINER_NONE 1
-#define QUICKLIST_NODE_CONTAINER_ZIPLIST 2
-
-#define quicklistNodeIsCompressed(node)                                        \
-    ((node)->encoding == QUICKLIST_NODE_ENCODING_LZF)
-
-/* Prototypes */
-quicklist *quicklistCreate(void);
-quicklist *quicklistNew(int fill, int compress);
-void quicklistSetCompressDepth(quicklist *quicklist, int depth);
-void quicklistSetFill(quicklist *quicklist, int fill);
-void quicklistSetOptions(quicklist *quicklist, int fill, int depth);
-void quicklistRelease(quicklist *quicklist);
-int quicklistPushHead(quicklist *quicklist, void *value, const size_t sz);
-int quicklistPushTail(quicklist *quicklist, void *value, const size_t sz);
-void quicklistPush(quicklist *quicklist, void *value, const size_t sz,
-                   int where);
-void quicklistAppendZiplist(quicklist *quicklist, unsigned char *zl);
-quicklist *quicklistAppendValuesFromZiplist(quicklist *quicklist,
-                                            unsigned char *zl);
-quicklist *quicklistCreateFromZiplist(int fill, int compress,
-                                      unsigned char *zl);
-void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *node,
-                          void *value, const size_t sz);
-void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *node,
-                           void *value, const size_t sz);
-void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry);
-int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data,
-                            int sz);
-int quicklistDelRange(quicklist *quicklist, const long start, const long stop);
-quicklistIter *quicklistGetIterator(const quicklist *quicklist, int direction);
-quicklistIter *quicklistGetIteratorAtIdx(const quicklist *quicklist,
-                                         int direction, const long long idx);
-int quicklistNext(quicklistIter *iter, quicklistEntry *node);
-void quicklistReleaseIterator(quicklistIter *iter);
-quicklist *quicklistDup(quicklist *orig);
-int quicklistIndex(const quicklist *quicklist, const long long index,
-                   quicklistEntry *entry);
-void quicklistRewind(quicklist *quicklist, quicklistIter *li);
-void quicklistRewindTail(quicklist *quicklist, quicklistIter *li);
-void quicklistRotate(quicklist *quicklist);
-int quicklistPopCustom(quicklist *quicklist, int where, unsigned char **data,
-                       unsigned int *sz, long long *sval,
-                       void *(*saver)(unsigned char *data, unsigned int sz));
-int quicklistPop(quicklist *quicklist, int where, unsigned char **data,
-                 unsigned int *sz, long long *slong);
-unsigned long quicklistCount(const quicklist *ql);
-int quicklistCompare(unsigned char *p1, unsigned char *p2, int p2_len);
-size_t quicklistGetLzf(const quicklistNode *node, void **data);
-
-/* bookmarks */
-int quicklistBookmarkCreate(quicklist **ql_ref, const char *name, quicklistNode *node);
-int quicklistBookmarkDelete(quicklist *ql, const char *name);
-quicklistNode *quicklistBookmarkFind(quicklist *ql, const char *name);
-void quicklistBookmarksClear(quicklist *ql);
-
-#ifdef REDIS_TEST
-int quicklistTest(int argc, char *argv[], int accurate);
-#endif
-
-/* Directions for iterators */
-#define AL_START_HEAD 0
-#define AL_START_TAIL 1
-
-#endif /* __QUICKLIST_H__ */
diff --git a/redis-stable/src/rand.c b/redis-stable/src/rand.c
deleted file mode 100644
index 09b0508f..00000000
--- a/redis-stable/src/rand.c
+++ /dev/null
@@ -1,93 +0,0 @@
-/* Pseudo random number generation functions derived from the drand48()
- * function obtained from pysam source code.
- *
- * This functions are used in order to replace the default math.random()
- * Lua implementation with something having exactly the same behavior
- * across different systems (by default Lua uses libc's rand() that is not
- * required to implement a specific PRNG generating the same sequence
- * in different systems if seeded with the same integer).
- *
- * The original code appears to be under the public domain.
- * I modified it removing the non needed functions and all the
- * 1960-style C coding stuff...
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2010-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdint.h>
-
-#define N	16
-#define MASK	((1 << (N - 1)) + (1 << (N - 1)) - 1)
-#define LOW(x)	((unsigned)(x) & MASK)
-#define HIGH(x)	LOW((x) >> N)
-#define MUL(x, y, z)	{ int32_t l = (long)(x) * (long)(y); \
-		(z)[0] = LOW(l); (z)[1] = HIGH(l); }
-#define CARRY(x, y)	((int32_t)(x) + (long)(y) > MASK)
-#define ADDEQU(x, y, z)	(z = CARRY(x, (y)), x = LOW(x + (y)))
-#define X0	0x330E
-#define X1	0xABCD
-#define X2	0x1234
-#define A0	0xE66D
-#define A1	0xDEEC
-#define A2	0x5
-#define C	0xB
-#define SET3(x, x0, x1, x2)	((x)[0] = (x0), (x)[1] = (x1), (x)[2] = (x2))
-#define SETLOW(x, y, n) SET3(x, LOW((y)[n]), LOW((y)[(n)+1]), LOW((y)[(n)+2]))
-#define SEED(x0, x1, x2) (SET3(x, x0, x1, x2), SET3(a, A0, A1, A2), c = C)
-#define REST(v)	for (i = 0; i < 3; i++) { xsubi[i] = x[i]; x[i] = temp[i]; } \
-		return (v);
-#define HI_BIT	(1L << (2 * N - 1))
-
-static uint32_t x[3] = { X0, X1, X2 }, a[3] = { A0, A1, A2 }, c = C;
-static void next(void);
-
-int32_t redisLrand48() {
-    next();
-    return (((int32_t)x[2] << (N - 1)) + (x[1] >> 1));
-}
-
-void redisSrand48(int32_t seedval) {
-    SEED(X0, LOW(seedval), HIGH(seedval));
-}
-
-static void next(void) {
-    uint32_t p[2], q[2], r[2], carry0, carry1;
-
-    MUL(a[0], x[0], p);
-    ADDEQU(p[0], c, carry0);
-    ADDEQU(p[1], carry0, carry1);
-    MUL(a[0], x[1], q);
-    ADDEQU(p[1], q[0], carry0);
-    MUL(a[1], x[0], r);
-    x[2] = LOW(carry0 + carry1 + CARRY(p[1], r[0]) + q[1] + r[1] +
-            a[0] * x[2] + a[1] * x[1] + a[2] * x[0]);
-    x[1] = LOW(p[1] + r[0]);
-    x[0] = LOW(p[0]);
-}
diff --git a/redis-stable/src/rand.h b/redis-stable/src/rand.h
deleted file mode 100644
index 1dce3e8b..00000000
--- a/redis-stable/src/rand.h
+++ /dev/null
@@ -1,38 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef REDIS_RANDOM_H
-#define REDIS_RANDOM_H
-
-int32_t redisLrand48();
-void redisSrand48(int32_t seedval);
-
-#define REDIS_LRAND48_MAX INT32_MAX
-
-#endif
diff --git a/redis-stable/src/rax.c b/redis-stable/src/rax.c
deleted file mode 100644
index 0826b974..00000000
--- a/redis-stable/src/rax.c
+++ /dev/null
@@ -1,1948 +0,0 @@
-/* Rax -- A radix tree implementation.
- *
- * Version 1.2 -- 7 February 2019
- *
- * Copyright (c) 2017-2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdlib.h>
-#include <string.h>
-#include <assert.h>
-#include <stdio.h>
-#include <errno.h>
-#include <math.h>
-#include "rax.h"
-
-#ifndef RAX_MALLOC_INCLUDE
-#define RAX_MALLOC_INCLUDE "rax_malloc.h"
-#endif
-
-#include RAX_MALLOC_INCLUDE
-
-/* This is a special pointer that is guaranteed to never have the same value
- * of a radix tree node. It's used in order to report "not found" error without
- * requiring the function to have multiple return values. */
-void *raxNotFound = (void*)"rax-not-found-pointer";
-
-/* -------------------------------- Debugging ------------------------------ */
-
-void raxDebugShowNode(const char *msg, raxNode *n);
-
-/* Turn debugging messages on/off by compiling with RAX_DEBUG_MSG macro on.
- * When RAX_DEBUG_MSG is defined by default Rax operations will emit a lot
- * of debugging info to the standard output, however you can still turn
- * debugging on/off in order to enable it only when you suspect there is an
- * operation causing a bug using the function raxSetDebugMsg(). */
-#ifdef RAX_DEBUG_MSG
-#define debugf(...)                                                            \
-    if (raxDebugMsg) {                                                         \
-        printf("%s:%s:%d:\t", __FILE__, __func__, __LINE__);                   \
-        printf(__VA_ARGS__);                                                   \
-        fflush(stdout);                                                        \
-    }
-
-#define debugnode(msg,n) raxDebugShowNode(msg,n)
-#else
-#define debugf(...)
-#define debugnode(msg,n)
-#endif
-
-/* By default log debug info if RAX_DEBUG_MSG is defined. */
-static int raxDebugMsg = 1;
-
-/* When debug messages are enabled, turn them on/off dynamically. By
- * default they are enabled. Set the state to 0 to disable, and 1 to
- * re-enable. */
-void raxSetDebugMsg(int onoff) {
-    raxDebugMsg = onoff;
-}
-
-/* ------------------------- raxStack functions --------------------------
- * The raxStack is a simple stack of pointers that is capable of switching
- * from using a stack-allocated array to dynamic heap once a given number of
- * items are reached. It is used in order to retain the list of parent nodes
- * while walking the radix tree in order to implement certain operations that
- * need to navigate the tree upward.
- * ------------------------------------------------------------------------- */
-
-/* Initialize the stack. */
-static inline void raxStackInit(raxStack *ts) {
-    ts->stack = ts->static_items;
-    ts->items = 0;
-    ts->maxitems = RAX_STACK_STATIC_ITEMS;
-    ts->oom = 0;
-}
-
-/* Push an item into the stack, returns 1 on success, 0 on out of memory. */
-static inline int raxStackPush(raxStack *ts, void *ptr) {
-    if (ts->items == ts->maxitems) {
-        if (ts->stack == ts->static_items) {
-            ts->stack = rax_malloc(sizeof(void*)*ts->maxitems*2);
-            if (ts->stack == NULL) {
-                ts->stack = ts->static_items;
-                ts->oom = 1;
-                errno = ENOMEM;
-                return 0;
-            }
-            memcpy(ts->stack,ts->static_items,sizeof(void*)*ts->maxitems);
-        } else {
-            void **newalloc = rax_realloc(ts->stack,sizeof(void*)*ts->maxitems*2);
-            if (newalloc == NULL) {
-                ts->oom = 1;
-                errno = ENOMEM;
-                return 0;
-            }
-            ts->stack = newalloc;
-        }
-        ts->maxitems *= 2;
-    }
-    ts->stack[ts->items] = ptr;
-    ts->items++;
-    return 1;
-}
-
-/* Pop an item from the stack, the function returns NULL if there are no
- * items to pop. */
-static inline void *raxStackPop(raxStack *ts) {
-    if (ts->items == 0) return NULL;
-    ts->items--;
-    return ts->stack[ts->items];
-}
-
-/* Return the stack item at the top of the stack without actually consuming
- * it. */
-static inline void *raxStackPeek(raxStack *ts) {
-    if (ts->items == 0) return NULL;
-    return ts->stack[ts->items-1];
-}
-
-/* Free the stack in case we used heap allocation. */
-static inline void raxStackFree(raxStack *ts) {
-    if (ts->stack != ts->static_items) rax_free(ts->stack);
-}
-
-/* ----------------------------------------------------------------------------
- * Radix tree implementation
- * --------------------------------------------------------------------------*/
-
-/* Return the padding needed in the characters section of a node having size
- * 'nodesize'. The padding is needed to store the child pointers to aligned
- * addresses. Note that we add 4 to the node size because the node has a four
- * bytes header. */
-#define raxPadding(nodesize) ((sizeof(void*)-((nodesize+4) % sizeof(void*))) & (sizeof(void*)-1))
-
-/* Return the pointer to the last child pointer in a node. For the compressed
- * nodes this is the only child pointer. */
-#define raxNodeLastChildPtr(n) ((raxNode**) ( \
-    ((char*)(n)) + \
-    raxNodeCurrentLength(n) - \
-    sizeof(raxNode*) - \
-    (((n)->iskey && !(n)->isnull) ? sizeof(void*) : 0) \
-))
-
-/* Return the pointer to the first child pointer. */
-#define raxNodeFirstChildPtr(n) ((raxNode**) ( \
-    (n)->data + \
-    (n)->size + \
-    raxPadding((n)->size)))
-
-/* Return the current total size of the node. Note that the second line
- * computes the padding after the string of characters, needed in order to
- * save pointers to aligned addresses. */
-#define raxNodeCurrentLength(n) ( \
-    sizeof(raxNode)+(n)->size+ \
-    raxPadding((n)->size)+ \
-    ((n)->iscompr ? sizeof(raxNode*) : sizeof(raxNode*)*(n)->size)+ \
-    (((n)->iskey && !(n)->isnull)*sizeof(void*)) \
-)
-
-/* Allocate a new non compressed node with the specified number of children.
- * If datafiled is true, the allocation is made large enough to hold the
- * associated data pointer.
- * Returns the new node pointer. On out of memory NULL is returned. */
-raxNode *raxNewNode(size_t children, int datafield) {
-    size_t nodesize = sizeof(raxNode)+children+raxPadding(children)+
-                      sizeof(raxNode*)*children;
-    if (datafield) nodesize += sizeof(void*);
-    raxNode *node = rax_malloc(nodesize);
-    if (node == NULL) return NULL;
-    node->iskey = 0;
-    node->isnull = 0;
-    node->iscompr = 0;
-    node->size = children;
-    return node;
-}
-
-/* Allocate a new rax and return its pointer. On out of memory the function
- * returns NULL. */
-rax *raxNew(void) {
-    rax *rax = rax_malloc(sizeof(*rax));
-    if (rax == NULL) return NULL;
-    rax->numele = 0;
-    rax->numnodes = 1;
-    rax->head = raxNewNode(0,0);
-    if (rax->head == NULL) {
-        rax_free(rax);
-        return NULL;
-    } else {
-        return rax;
-    }
-}
-
-/* realloc the node to make room for auxiliary data in order
- * to store an item in that node. On out of memory NULL is returned. */
-raxNode *raxReallocForData(raxNode *n, void *data) {
-    if (data == NULL) return n; /* No reallocation needed, setting isnull=1 */
-    size_t curlen = raxNodeCurrentLength(n);
-    return rax_realloc(n,curlen+sizeof(void*));
-}
-
-/* Set the node auxiliary data to the specified pointer. */
-void raxSetData(raxNode *n, void *data) {
-    n->iskey = 1;
-    if (data != NULL) {
-        n->isnull = 0;
-        void **ndata = (void**)
-            ((char*)n+raxNodeCurrentLength(n)-sizeof(void*));
-        memcpy(ndata,&data,sizeof(data));
-    } else {
-        n->isnull = 1;
-    }
-}
-
-/* Get the node auxiliary data. */
-void *raxGetData(raxNode *n) {
-    if (n->isnull) return NULL;
-    void **ndata =(void**)((char*)n+raxNodeCurrentLength(n)-sizeof(void*));
-    void *data;
-    memcpy(&data,ndata,sizeof(data));
-    return data;
-}
-
-/* Add a new child to the node 'n' representing the character 'c' and return
- * its new pointer, as well as the child pointer by reference. Additionally
- * '***parentlink' is populated with the raxNode pointer-to-pointer of where
- * the new child was stored, which is useful for the caller to replace the
- * child pointer if it gets reallocated.
- *
- * On success the new parent node pointer is returned (it may change because
- * of the realloc, so the caller should discard 'n' and use the new value).
- * On out of memory NULL is returned, and the old node is still valid. */
-raxNode *raxAddChild(raxNode *n, unsigned char c, raxNode **childptr, raxNode ***parentlink) {
-    assert(n->iscompr == 0);
-
-    size_t curlen = raxNodeCurrentLength(n);
-    n->size++;
-    size_t newlen = raxNodeCurrentLength(n);
-    n->size--; /* For now restore the orignal size. We'll update it only on
-                  success at the end. */
-
-    /* Alloc the new child we will link to 'n'. */
-    raxNode *child = raxNewNode(0,0);
-    if (child == NULL) return NULL;
-
-    /* Make space in the original node. */
-    raxNode *newn = rax_realloc(n,newlen);
-    if (newn == NULL) {
-        rax_free(child);
-        return NULL;
-    }
-    n = newn;
-
-    /* After the reallocation, we have up to 8/16 (depending on the system
-     * pointer size, and the required node padding) bytes at the end, that is,
-     * the additional char in the 'data' section, plus one pointer to the new
-     * child, plus the padding needed in order to store addresses into aligned
-     * locations.
-     *
-     * So if we start with the following node, having "abde" edges.
-     *
-     * Note:
-     * - We assume 4 bytes pointer for simplicity.
-     * - Each space below corresponds to one byte
-     *
-     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr]|AUXP|
-     *
-     * After the reallocation we need: 1 byte for the new edge character
-     * plus 4 bytes for a new child pointer (assuming 32 bit machine).
-     * However after adding 1 byte to the edge char, the header + the edge
-     * characters are no longer aligned, so we also need 3 bytes of padding.
-     * In total the reallocation will add 1+4+3 bytes = 8 bytes:
-     *
-     * (Blank bytes are represented by ".")
-     *
-     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr]|AUXP|[....][....]
-     *
-     * Let's find where to insert the new child in order to make sure
-     * it is inserted in-place lexicographically. Assuming we are adding
-     * a child "c" in our case pos will be = 2 after the end of the following
-     * loop. */
-    int pos;
-    for (pos = 0; pos < n->size; pos++) {
-        if (n->data[pos] > c) break;
-    }
-
-    /* Now, if present, move auxiliary data pointer at the end
-     * so that we can mess with the other data without overwriting it.
-     * We will obtain something like that:
-     *
-     * [HDR*][abde][Aptr][Bptr][Dptr][Eptr][....][....]|AUXP|
-     */
-    unsigned char *src, *dst;
-    if (n->iskey && !n->isnull) {
-        src = ((unsigned char*)n+curlen-sizeof(void*));
-        dst = ((unsigned char*)n+newlen-sizeof(void*));
-        memmove(dst,src,sizeof(void*));
-    }
-
-    /* Compute the "shift", that is, how many bytes we need to move the
-     * pointers section forward because of the addition of the new child
-     * byte in the string section. Note that if we had no padding, that
-     * would be always "1", since we are adding a single byte in the string
-     * section of the node (where now there is "abde" basically).
-     *
-     * However we have padding, so it could be zero, or up to 8.
-     *
-     * Another way to think at the shift is, how many bytes we need to
-     * move child pointers forward *other than* the obvious sizeof(void*)
-     * needed for the additional pointer itself. */
-    size_t shift = newlen - curlen - sizeof(void*);
-
-    /* We said we are adding a node with edge 'c'. The insertion
-     * point is between 'b' and 'd', so the 'pos' variable value is
-     * the index of the first child pointer that we need to move forward
-     * to make space for our new pointer.
-     *
-     * To start, move all the child pointers after the insertion point
-     * of shift+sizeof(pointer) bytes on the right, to obtain:
-     *
-     * [HDR*][abde][Aptr][Bptr][....][....][Dptr][Eptr]|AUXP|
-     */
-    src = n->data+n->size+
-          raxPadding(n->size)+
-          sizeof(raxNode*)*pos;
-    memmove(src+shift+sizeof(raxNode*),src,sizeof(raxNode*)*(n->size-pos));
-
-    /* Move the pointers to the left of the insertion position as well. Often
-     * we don't need to do anything if there was already some padding to use. In
-     * that case the final destination of the pointers will be the same, however
-     * in our example there was no pre-existing padding, so we added one byte
-     * plus thre bytes of padding. After the next memmove() things will look
-     * like thata:
-     *
-     * [HDR*][abde][....][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
-     */
-    if (shift) {
-        src = (unsigned char*) raxNodeFirstChildPtr(n);
-        memmove(src+shift,src,sizeof(raxNode*)*pos);
-    }
-
-    /* Now make the space for the additional char in the data section,
-     * but also move the pointers before the insertion point to the right
-     * by shift bytes, in order to obtain the following:
-     *
-     * [HDR*][ab.d][e...][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
-     */
-    src = n->data+pos;
-    memmove(src+1,src,n->size-pos);
-
-    /* We can now set the character and its child node pointer to get:
-     *
-     * [HDR*][abcd][e...][Aptr][Bptr][....][Dptr][Eptr]|AUXP|
-     * [HDR*][abcd][e...][Aptr][Bptr][Cptr][Dptr][Eptr]|AUXP|
-     */
-    n->data[pos] = c;
-    n->size++;
-    src = (unsigned char*) raxNodeFirstChildPtr(n);
-    raxNode **childfield = (raxNode**)(src+sizeof(raxNode*)*pos);
-    memcpy(childfield,&child,sizeof(child));
-    *childptr = child;
-    *parentlink = childfield;
-    return n;
-}
-
-/* Turn the node 'n', that must be a node without any children, into a
- * compressed node representing a set of nodes linked one after the other
- * and having exactly one child each. The node can be a key or not: this
- * property and the associated value if any will be preserved.
- *
- * The function also returns a child node, since the last node of the
- * compressed chain cannot be part of the chain: it has zero children while
- * we can only compress inner nodes with exactly one child each. */
-raxNode *raxCompressNode(raxNode *n, unsigned char *s, size_t len, raxNode **child) {
-    assert(n->size == 0 && n->iscompr == 0);
-    void *data = NULL; /* Initialized only to avoid warnings. */
-    size_t newsize;
-
-    debugf("Compress node: %.*s\n", (int)len,s);
-
-    /* Allocate the child to link to this node. */
-    *child = raxNewNode(0,0);
-    if (*child == NULL) return NULL;
-
-    /* Make space in the parent node. */
-    newsize = sizeof(raxNode)+len+raxPadding(len)+sizeof(raxNode*);
-    if (n->iskey) {
-        data = raxGetData(n); /* To restore it later. */
-        if (!n->isnull) newsize += sizeof(void*);
-    }
-    raxNode *newn = rax_realloc(n,newsize);
-    if (newn == NULL) {
-        rax_free(*child);
-        return NULL;
-    }
-    n = newn;
-
-    n->iscompr = 1;
-    n->size = len;
-    memcpy(n->data,s,len);
-    if (n->iskey) raxSetData(n,data);
-    raxNode **childfield = raxNodeLastChildPtr(n);
-    memcpy(childfield,child,sizeof(*child));
-    return n;
-}
-
-/* Low level function that walks the tree looking for the string
- * 's' of 'len' bytes. The function returns the number of characters
- * of the key that was possible to process: if the returned integer
- * is the same as 'len', then it means that the node corresponding to the
- * string was found (however it may not be a key in case the node->iskey is
- * zero or if simply we stopped in the middle of a compressed node, so that
- * 'splitpos' is non zero).
- *
- * Otherwise if the returned integer is not the same as 'len', there was an
- * early stop during the tree walk because of a character mismatch.
- *
- * The node where the search ended (because the full string was processed
- * or because there was an early stop) is returned by reference as
- * '*stopnode' if the passed pointer is not NULL. This node link in the
- * parent's node is returned as '*plink' if not NULL. Finally, if the
- * search stopped in a compressed node, '*splitpos' returns the index
- * inside the compressed node where the search ended. This is useful to
- * know where to split the node for insertion.
- *
- * Note that when we stop in the middle of a compressed node with
- * a perfect match, this function will return a length equal to the
- * 'len' argument (all the key matched), and will return a *splitpos which is
- * always positive (that will represent the index of the character immediately
- * *after* the last match in the current compressed node).
- *
- * When instead we stop at a compressed node and *splitpos is zero, it
- * means that the current node represents the key (that is, none of the
- * compressed node characters are needed to represent the key, just all
- * its parents nodes). */
-static inline size_t raxLowWalk(rax *rax, unsigned char *s, size_t len, raxNode **stopnode, raxNode ***plink, int *splitpos, raxStack *ts) {
-    raxNode *h = rax->head;
-    raxNode **parentlink = &rax->head;
-
-    size_t i = 0; /* Position in the string. */
-    size_t j = 0; /* Position in the node children (or bytes if compressed).*/
-    while(h->size && i < len) {
-        debugnode("Lookup current node",h);
-        unsigned char *v = h->data;
-
-        if (h->iscompr) {
-            for (j = 0; j < h->size && i < len; j++, i++) {
-                if (v[j] != s[i]) break;
-            }
-            if (j != h->size) break;
-        } else {
-            /* Even when h->size is large, linear scan provides good
-             * performances compared to other approaches that are in theory
-             * more sounding, like performing a binary search. */
-            for (j = 0; j < h->size; j++) {
-                if (v[j] == s[i]) break;
-            }
-            if (j == h->size) break;
-            i++;
-        }
-
-        if (ts) raxStackPush(ts,h); /* Save stack of parent nodes. */
-        raxNode **children = raxNodeFirstChildPtr(h);
-        if (h->iscompr) j = 0; /* Compressed node only child is at index 0. */
-        memcpy(&h,children+j,sizeof(h));
-        parentlink = children+j;
-        j = 0; /* If the new node is non compressed and we do not
-                  iterate again (since i == len) set the split
-                  position to 0 to signal this node represents
-                  the searched key. */
-    }
-    debugnode("Lookup stop node is",h);
-    if (stopnode) *stopnode = h;
-    if (plink) *plink = parentlink;
-    if (splitpos && h->iscompr) *splitpos = j;
-    return i;
-}
-
-/* Insert the element 's' of size 'len', setting as auxiliary data
- * the pointer 'data'. If the element is already present, the associated
- * data is updated (only if 'overwrite' is set to 1), and 0 is returned,
- * otherwise the element is inserted and 1 is returned. On out of memory the
- * function returns 0 as well but sets errno to ENOMEM, otherwise errno will
- * be set to 0.
- */
-int raxGenericInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old, int overwrite) {
-    size_t i;
-    int j = 0; /* Split position. If raxLowWalk() stops in a compressed
-                  node, the index 'j' represents the char we stopped within the
-                  compressed node, that is, the position where to split the
-                  node for insertion. */
-    raxNode *h, **parentlink;
-
-    debugf("### Insert %.*s with value %p\n", (int)len, s, data);
-    i = raxLowWalk(rax,s,len,&h,&parentlink,&j,NULL);
-
-    /* If i == len we walked following the whole string. If we are not
-     * in the middle of a compressed node, the string is either already
-     * inserted or this middle node is currently not a key, but can represent
-     * our key. We have just to reallocate the node and make space for the
-     * data pointer. */
-    if (i == len && (!h->iscompr || j == 0 /* not in the middle if j is 0 */)) {
-        debugf("### Insert: node representing key exists\n");
-        /* Make space for the value pointer if needed. */
-        if (!h->iskey || (h->isnull && overwrite)) {
-            h = raxReallocForData(h,data);
-            if (h) memcpy(parentlink,&h,sizeof(h));
-        }
-        if (h == NULL) {
-            errno = ENOMEM;
-            return 0;
-        }
-
-        /* Update the existing key if there is already one. */
-        if (h->iskey) {
-            if (old) *old = raxGetData(h);
-            if (overwrite) raxSetData(h,data);
-            errno = 0;
-            return 0; /* Element already exists. */
-        }
-
-        /* Otherwise set the node as a key. Note that raxSetData()
-         * will set h->iskey. */
-        raxSetData(h,data);
-        rax->numele++;
-        return 1; /* Element inserted. */
-    }
-
-    /* If the node we stopped at is a compressed node, we need to
-     * split it before to continue.
-     *
-     * Splitting a compressed node have a few possible cases.
-     * Imagine that the node 'h' we are currently at is a compressed
-     * node containing the string "ANNIBALE" (it means that it represents
-     * nodes A -> N -> N -> I -> B -> A -> L -> E with the only child
-     * pointer of this node pointing at the 'E' node, because remember that
-     * we have characters at the edges of the graph, not inside the nodes
-     * themselves.
-     *
-     * In order to show a real case imagine our node to also point to
-     * another compressed node, that finally points at the node without
-     * children, representing 'O':
-     *
-     *     "ANNIBALE" -> "SCO" -> []
-     *
-     * When inserting we may face the following cases. Note that all the cases
-     * require the insertion of a non compressed node with exactly two
-     * children, except for the last case which just requires splitting a
-     * compressed node.
-     *
-     * 1) Inserting "ANNIENTARE"
-     *
-     *               |B| -> "ALE" -> "SCO" -> []
-     *     "ANNI" -> |-|
-     *               |E| -> (... continue algo ...) "NTARE" -> []
-     *
-     * 2) Inserting "ANNIBALI"
-     *
-     *                  |E| -> "SCO" -> []
-     *     "ANNIBAL" -> |-|
-     *                  |I| -> (... continue algo ...) []
-     *
-     * 3) Inserting "AGO" (Like case 1, but set iscompr = 0 into original node)
-     *
-     *            |N| -> "NIBALE" -> "SCO" -> []
-     *     |A| -> |-|
-     *            |G| -> (... continue algo ...) |O| -> []
-     *
-     * 4) Inserting "CIAO"
-     *
-     *     |A| -> "NNIBALE" -> "SCO" -> []
-     *     |-|
-     *     |C| -> (... continue algo ...) "IAO" -> []
-     *
-     * 5) Inserting "ANNI"
-     *
-     *     "ANNI" -> "BALE" -> "SCO" -> []
-     *
-     * The final algorithm for insertion covering all the above cases is as
-     * follows.
-     *
-     * ============================= ALGO 1 =============================
-     *
-     * For the above cases 1 to 4, that is, all cases where we stopped in
-     * the middle of a compressed node for a character mismatch, do:
-     *
-     * Let $SPLITPOS be the zero-based index at which, in the
-     * compressed node array of characters, we found the mismatching
-     * character. For example if the node contains "ANNIBALE" and we add
-     * "ANNIENTARE" the $SPLITPOS is 4, that is, the index at which the
-     * mismatching character is found.
-     *
-     * 1. Save the current compressed node $NEXT pointer (the pointer to the
-     *    child element, that is always present in compressed nodes).
-     *
-     * 2. Create "split node" having as child the non common letter
-     *    at the compressed node. The other non common letter (at the key)
-     *    will be added later as we continue the normal insertion algorithm
-     *    at step "6".
-     *
-     * 3a. IF $SPLITPOS == 0:
-     *     Replace the old node with the split node, by copying the auxiliary
-     *     data if any. Fix parent's reference. Free old node eventually
-     *     (we still need its data for the next steps of the algorithm).
-     *
-     * 3b. IF $SPLITPOS != 0:
-     *     Trim the compressed node (reallocating it as well) in order to
-     *     contain $splitpos characters. Change child pointer in order to link
-     *     to the split node. If new compressed node len is just 1, set
-     *     iscompr to 0 (layout is the same). Fix parent's reference.
-     *
-     * 4a. IF the postfix len (the length of the remaining string of the
-     *     original compressed node after the split character) is non zero,
-     *     create a "postfix node". If the postfix node has just one character
-     *     set iscompr to 0, otherwise iscompr to 1. Set the postfix node
-     *     child pointer to $NEXT.
-     *
-     * 4b. IF the postfix len is zero, just use $NEXT as postfix pointer.
-     *
-     * 5. Set child[0] of split node to postfix node.
-     *
-     * 6. Set the split node as the current node, set current index at child[1]
-     *    and continue insertion algorithm as usually.
-     *
-     * ============================= ALGO 2 =============================
-     *
-     * For case 5, that is, if we stopped in the middle of a compressed
-     * node but no mismatch was found, do:
-     *
-     * Let $SPLITPOS be the zero-based index at which, in the
-     * compressed node array of characters, we stopped iterating because
-     * there were no more keys character to match. So in the example of
-     * the node "ANNIBALE", addig the string "ANNI", the $SPLITPOS is 4.
-     *
-     * 1. Save the current compressed node $NEXT pointer (the pointer to the
-     *    child element, that is always present in compressed nodes).
-     *
-     * 2. Create a "postfix node" containing all the characters from $SPLITPOS
-     *    to the end. Use $NEXT as the postfix node child pointer.
-     *    If the postfix node length is 1, set iscompr to 0.
-     *    Set the node as a key with the associated value of the new
-     *    inserted key.
-     *
-     * 3. Trim the current node to contain the first $SPLITPOS characters.
-     *    As usually if the new node length is just 1, set iscompr to 0.
-     *    Take the iskey / associated value as it was in the orignal node.
-     *    Fix the parent's reference.
-     *
-     * 4. Set the postfix node as the only child pointer of the trimmed
-     *    node created at step 1.
-     */
-
-    /* ------------------------- ALGORITHM 1 --------------------------- */
-    if (h->iscompr && i != len) {
-        debugf("ALGO 1: Stopped at compressed node %.*s (%p)\n",
-            h->size, h->data, (void*)h);
-        debugf("Still to insert: %.*s\n", (int)(len-i), s+i);
-        debugf("Splitting at %d: '%c'\n", j, ((char*)h->data)[j]);
-        debugf("Other (key) letter is '%c'\n", s[i]);
-
-        /* 1: Save next pointer. */
-        raxNode **childfield = raxNodeLastChildPtr(h);
-        raxNode *next;
-        memcpy(&next,childfield,sizeof(next));
-        debugf("Next is %p\n", (void*)next);
-        debugf("iskey %d\n", h->iskey);
-        if (h->iskey) {
-            debugf("key value is %p\n", raxGetData(h));
-        }
-
-        /* Set the length of the additional nodes we will need. */
-        size_t trimmedlen = j;
-        size_t postfixlen = h->size - j - 1;
-        int split_node_is_key = !trimmedlen && h->iskey && !h->isnull;
-        size_t nodesize;
-
-        /* 2: Create the split node. Also allocate the other nodes we'll need
-         *    ASAP, so that it will be simpler to handle OOM. */
-        raxNode *splitnode = raxNewNode(1, split_node_is_key);
-        raxNode *trimmed = NULL;
-        raxNode *postfix = NULL;
-
-        if (trimmedlen) {
-            nodesize = sizeof(raxNode)+trimmedlen+raxPadding(trimmedlen)+
-                       sizeof(raxNode*);
-            if (h->iskey && !h->isnull) nodesize += sizeof(void*);
-            trimmed = rax_malloc(nodesize);
-        }
-
-        if (postfixlen) {
-            nodesize = sizeof(raxNode)+postfixlen+raxPadding(postfixlen)+
-                       sizeof(raxNode*);
-            postfix = rax_malloc(nodesize);
-        }
-
-        /* OOM? Abort now that the tree is untouched. */
-        if (splitnode == NULL ||
-            (trimmedlen && trimmed == NULL) ||
-            (postfixlen && postfix == NULL))
-        {
-            rax_free(splitnode);
-            rax_free(trimmed);
-            rax_free(postfix);
-            errno = ENOMEM;
-            return 0;
-        }
-        splitnode->data[0] = h->data[j];
-
-        if (j == 0) {
-            /* 3a: Replace the old node with the split node. */
-            if (h->iskey) {
-                void *ndata = raxGetData(h);
-                raxSetData(splitnode,ndata);
-            }
-            memcpy(parentlink,&splitnode,sizeof(splitnode));
-        } else {
-            /* 3b: Trim the compressed node. */
-            trimmed->size = j;
-            memcpy(trimmed->data,h->data,j);
-            trimmed->iscompr = j > 1 ? 1 : 0;
-            trimmed->iskey = h->iskey;
-            trimmed->isnull = h->isnull;
-            if (h->iskey && !h->isnull) {
-                void *ndata = raxGetData(h);
-                raxSetData(trimmed,ndata);
-            }
-            raxNode **cp = raxNodeLastChildPtr(trimmed);
-            memcpy(cp,&splitnode,sizeof(splitnode));
-            memcpy(parentlink,&trimmed,sizeof(trimmed));
-            parentlink = cp; /* Set parentlink to splitnode parent. */
-            rax->numnodes++;
-        }
-
-        /* 4: Create the postfix node: what remains of the original
-         * compressed node after the split. */
-        if (postfixlen) {
-            /* 4a: create a postfix node. */
-            postfix->iskey = 0;
-            postfix->isnull = 0;
-            postfix->size = postfixlen;
-            postfix->iscompr = postfixlen > 1;
-            memcpy(postfix->data,h->data+j+1,postfixlen);
-            raxNode **cp = raxNodeLastChildPtr(postfix);
-            memcpy(cp,&next,sizeof(next));
-            rax->numnodes++;
-        } else {
-            /* 4b: just use next as postfix node. */
-            postfix = next;
-        }
-
-        /* 5: Set splitnode first child as the postfix node. */
-        raxNode **splitchild = raxNodeLastChildPtr(splitnode);
-        memcpy(splitchild,&postfix,sizeof(postfix));
-
-        /* 6. Continue insertion: this will cause the splitnode to
-         * get a new child (the non common character at the currently
-         * inserted key). */
-        rax_free(h);
-        h = splitnode;
-    } else if (h->iscompr && i == len) {
-    /* ------------------------- ALGORITHM 2 --------------------------- */
-        debugf("ALGO 2: Stopped at compressed node %.*s (%p) j = %d\n",
-            h->size, h->data, (void*)h, j);
-
-        /* Allocate postfix & trimmed nodes ASAP to fail for OOM gracefully. */
-        size_t postfixlen = h->size - j;
-        size_t nodesize = sizeof(raxNode)+postfixlen+raxPadding(postfixlen)+
-                          sizeof(raxNode*);
-        if (data != NULL) nodesize += sizeof(void*);
-        raxNode *postfix = rax_malloc(nodesize);
-
-        nodesize = sizeof(raxNode)+j+raxPadding(j)+sizeof(raxNode*);
-        if (h->iskey && !h->isnull) nodesize += sizeof(void*);
-        raxNode *trimmed = rax_malloc(nodesize);
-
-        if (postfix == NULL || trimmed == NULL) {
-            rax_free(postfix);
-            rax_free(trimmed);
-            errno = ENOMEM;
-            return 0;
-        }
-
-        /* 1: Save next pointer. */
-        raxNode **childfield = raxNodeLastChildPtr(h);
-        raxNode *next;
-        memcpy(&next,childfield,sizeof(next));
-
-        /* 2: Create the postfix node. */
-        postfix->size = postfixlen;
-        postfix->iscompr = postfixlen > 1;
-        postfix->iskey = 1;
-        postfix->isnull = 0;
-        memcpy(postfix->data,h->data+j,postfixlen);
-        raxSetData(postfix,data);
-        raxNode **cp = raxNodeLastChildPtr(postfix);
-        memcpy(cp,&next,sizeof(next));
-        rax->numnodes++;
-
-        /* 3: Trim the compressed node. */
-        trimmed->size = j;
-        trimmed->iscompr = j > 1;
-        trimmed->iskey = 0;
-        trimmed->isnull = 0;
-        memcpy(trimmed->data,h->data,j);
-        memcpy(parentlink,&trimmed,sizeof(trimmed));
-        if (h->iskey) {
-            void *aux = raxGetData(h);
-            raxSetData(trimmed,aux);
-        }
-
-        /* Fix the trimmed node child pointer to point to
-         * the postfix node. */
-        cp = raxNodeLastChildPtr(trimmed);
-        memcpy(cp,&postfix,sizeof(postfix));
-
-        /* Finish! We don't need to continue with the insertion
-         * algorithm for ALGO 2. The key is already inserted. */
-        rax->numele++;
-        rax_free(h);
-        return 1; /* Key inserted. */
-    }
-
-    /* We walked the radix tree as far as we could, but still there are left
-     * chars in our string. We need to insert the missing nodes. */
-    while(i < len) {
-        raxNode *child;
-
-        /* If this node is going to have a single child, and there
-         * are other characters, so that that would result in a chain
-         * of single-childed nodes, turn it into a compressed node. */
-        if (h->size == 0 && len-i > 1) {
-            debugf("Inserting compressed node\n");
-            size_t comprsize = len-i;
-            if (comprsize > RAX_NODE_MAX_SIZE)
-                comprsize = RAX_NODE_MAX_SIZE;
-            raxNode *newh = raxCompressNode(h,s+i,comprsize,&child);
-            if (newh == NULL) goto oom;
-            h = newh;
-            memcpy(parentlink,&h,sizeof(h));
-            parentlink = raxNodeLastChildPtr(h);
-            i += comprsize;
-        } else {
-            debugf("Inserting normal node\n");
-            raxNode **new_parentlink;
-            raxNode *newh = raxAddChild(h,s[i],&child,&new_parentlink);
-            if (newh == NULL) goto oom;
-            h = newh;
-            memcpy(parentlink,&h,sizeof(h));
-            parentlink = new_parentlink;
-            i++;
-        }
-        rax->numnodes++;
-        h = child;
-    }
-    raxNode *newh = raxReallocForData(h,data);
-    if (newh == NULL) goto oom;
-    h = newh;
-    if (!h->iskey) rax->numele++;
-    raxSetData(h,data);
-    memcpy(parentlink,&h,sizeof(h));
-    return 1; /* Element inserted. */
-
-oom:
-    /* This code path handles out of memory after part of the sub-tree was
-     * already modified. Set the node as a key, and then remove it. However we
-     * do that only if the node is a terminal node, otherwise if the OOM
-     * happened reallocating a node in the middle, we don't need to free
-     * anything. */
-    if (h->size == 0) {
-        h->isnull = 1;
-        h->iskey = 1;
-        rax->numele++; /* Compensate the next remove. */
-        assert(raxRemove(rax,s,i,NULL) != 0);
-    }
-    errno = ENOMEM;
-    return 0;
-}
-
-/* Overwriting insert. Just a wrapper for raxGenericInsert() that will
- * update the element if there is already one for the same key. */
-int raxInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old) {
-    return raxGenericInsert(rax,s,len,data,old,1);
-}
-
-/* Non overwriting insert function: this if an element with the same key
- * exists, the value is not updated and the function returns 0.
- * This is a just a wrapper for raxGenericInsert(). */
-int raxTryInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old) {
-    return raxGenericInsert(rax,s,len,data,old,0);
-}
-
-/* Find a key in the rax, returns raxNotFound special void pointer value
- * if the item was not found, otherwise the value associated with the
- * item is returned. */
-void *raxFind(rax *rax, unsigned char *s, size_t len) {
-    raxNode *h;
-
-    debugf("### Lookup: %.*s\n", (int)len, s);
-    int splitpos = 0;
-    size_t i = raxLowWalk(rax,s,len,&h,NULL,&splitpos,NULL);
-    if (i != len || (h->iscompr && splitpos != 0) || !h->iskey)
-        return raxNotFound;
-    return raxGetData(h);
-}
-
-/* Return the memory address where the 'parent' node stores the specified
- * 'child' pointer, so that the caller can update the pointer with another
- * one if needed. The function assumes it will find a match, otherwise the
- * operation is an undefined behavior (it will continue scanning the
- * memory without any bound checking). */
-raxNode **raxFindParentLink(raxNode *parent, raxNode *child) {
-    raxNode **cp = raxNodeFirstChildPtr(parent);
-    raxNode *c;
-    while(1) {
-        memcpy(&c,cp,sizeof(c));
-        if (c == child) break;
-        cp++;
-    }
-    return cp;
-}
-
-/* Low level child removal from node. The new node pointer (after the child
- * removal) is returned. Note that this function does not fix the pointer
- * of the parent node in its parent, so this task is up to the caller.
- * The function never fails for out of memory. */
-raxNode *raxRemoveChild(raxNode *parent, raxNode *child) {
-    debugnode("raxRemoveChild before", parent);
-    /* If parent is a compressed node (having a single child, as for definition
-     * of the data structure), the removal of the child consists into turning
-     * it into a normal node without children. */
-    if (parent->iscompr) {
-        void *data = NULL;
-        if (parent->iskey) data = raxGetData(parent);
-        parent->isnull = 0;
-        parent->iscompr = 0;
-        parent->size = 0;
-        if (parent->iskey) raxSetData(parent,data);
-        debugnode("raxRemoveChild after", parent);
-        return parent;
-    }
-
-    /* Otherwise we need to scan for the child pointer and memmove()
-     * accordingly.
-     *
-     * 1. To start we seek the first element in both the children
-     *    pointers and edge bytes in the node. */
-    raxNode **cp = raxNodeFirstChildPtr(parent);
-    raxNode **c = cp;
-    unsigned char *e = parent->data;
-
-    /* 2. Search the child pointer to remove inside the array of children
-     *    pointers. */
-    while(1) {
-        raxNode *aux;
-        memcpy(&aux,c,sizeof(aux));
-        if (aux == child) break;
-        c++;
-        e++;
-    }
-
-    /* 3. Remove the edge and the pointer by memmoving the remaining children
-     *    pointer and edge bytes one position before. */
-    int taillen = parent->size - (e - parent->data) - 1;
-    debugf("raxRemoveChild tail len: %d\n", taillen);
-    memmove(e,e+1,taillen);
-
-    /* Compute the shift, that is the amount of bytes we should move our
-     * child pointers to the left, since the removal of one edge character
-     * and the corresponding padding change, may change the layout.
-     * We just check if in the old version of the node there was at the
-     * end just a single byte and all padding: in that case removing one char
-     * will remove a whole sizeof(void*) word. */
-    size_t shift = ((parent->size+4) % sizeof(void*)) == 1 ? sizeof(void*) : 0;
-
-    /* Move the children pointers before the deletion point. */
-    if (shift)
-        memmove(((char*)cp)-shift,cp,(parent->size-taillen-1)*sizeof(raxNode**));
-
-    /* Move the remaining "tail" pointers at the right position as well. */
-    size_t valuelen = (parent->iskey && !parent->isnull) ? sizeof(void*) : 0;
-    memmove(((char*)c)-shift,c+1,taillen*sizeof(raxNode**)+valuelen);
-
-    /* 4. Update size. */
-    parent->size--;
-
-    /* realloc the node according to the theoretical memory usage, to free
-     * data if we are over-allocating right now. */
-    raxNode *newnode = rax_realloc(parent,raxNodeCurrentLength(parent));
-    if (newnode) {
-        debugnode("raxRemoveChild after", newnode);
-    }
-    /* Note: if rax_realloc() fails we just return the old address, which
-     * is valid. */
-    return newnode ? newnode : parent;
-}
-
-/* Remove the specified item. Returns 1 if the item was found and
- * deleted, 0 otherwise. */
-int raxRemove(rax *rax, unsigned char *s, size_t len, void **old) {
-    raxNode *h;
-    raxStack ts;
-
-    debugf("### Delete: %.*s\n", (int)len, s);
-    raxStackInit(&ts);
-    int splitpos = 0;
-    size_t i = raxLowWalk(rax,s,len,&h,NULL,&splitpos,&ts);
-    if (i != len || (h->iscompr && splitpos != 0) || !h->iskey) {
-        raxStackFree(&ts);
-        return 0;
-    }
-    if (old) *old = raxGetData(h);
-    h->iskey = 0;
-    rax->numele--;
-
-    /* If this node has no children, the deletion needs to reclaim the
-     * no longer used nodes. This is an iterative process that needs to
-     * walk the three upward, deleting all the nodes with just one child
-     * that are not keys, until the head of the rax is reached or the first
-     * node with more than one child is found. */
-
-    int trycompress = 0; /* Will be set to 1 if we should try to optimize the
-                            tree resulting from the deletion. */
-
-    if (h->size == 0) {
-        debugf("Key deleted in node without children. Cleanup needed.\n");
-        raxNode *child = NULL;
-        while(h != rax->head) {
-            child = h;
-            debugf("Freeing child %p [%.*s] key:%d\n", (void*)child,
-                (int)child->size, (char*)child->data, child->iskey);
-            rax_free(child);
-            rax->numnodes--;
-            h = raxStackPop(&ts);
-             /* If this node has more then one child, or actually holds
-              * a key, stop here. */
-            if (h->iskey || (!h->iscompr && h->size != 1)) break;
-        }
-        if (child) {
-            debugf("Unlinking child %p from parent %p\n",
-                (void*)child, (void*)h);
-            raxNode *new = raxRemoveChild(h,child);
-            if (new != h) {
-                raxNode *parent = raxStackPeek(&ts);
-                raxNode **parentlink;
-                if (parent == NULL) {
-                    parentlink = &rax->head;
-                } else {
-                    parentlink = raxFindParentLink(parent,h);
-                }
-                memcpy(parentlink,&new,sizeof(new));
-            }
-
-            /* If after the removal the node has just a single child
-             * and is not a key, we need to try to compress it. */
-            if (new->size == 1 && new->iskey == 0) {
-                trycompress = 1;
-                h = new;
-            }
-        }
-    } else if (h->size == 1) {
-        /* If the node had just one child, after the removal of the key
-         * further compression with adjacent nodes is potentially possible. */
-        trycompress = 1;
-    }
-
-    /* Don't try node compression if our nodes pointers stack is not
-     * complete because of OOM while executing raxLowWalk() */
-    if (trycompress && ts.oom) trycompress = 0;
-
-    /* Recompression: if trycompress is true, 'h' points to a radix tree node
-     * that changed in a way that could allow to compress nodes in this
-     * sub-branch. Compressed nodes represent chains of nodes that are not
-     * keys and have a single child, so there are two deletion events that
-     * may alter the tree so that further compression is needed:
-     *
-     * 1) A node with a single child was a key and now no longer is a key.
-     * 2) A node with two children now has just one child.
-     *
-     * We try to navigate upward till there are other nodes that can be
-     * compressed, when we reach the upper node which is not a key and has
-     * a single child, we scan the chain of children to collect the
-     * compressable part of the tree, and replace the current node with the
-     * new one, fixing the child pointer to reference the first non
-     * compressable node.
-     *
-     * Example of case "1". A tree stores the keys "FOO" = 1 and
-     * "FOOBAR" = 2:
-     *
-     *
-     * "FOO" -> "BAR" -> [] (2)
-     *           (1)
-     *
-     * After the removal of "FOO" the tree can be compressed as:
-     *
-     * "FOOBAR" -> [] (2)
-     *
-     *
-     * Example of case "2". A tree stores the keys "FOOBAR" = 1 and
-     * "FOOTER" = 2:
-     *
-     *          |B| -> "AR" -> [] (1)
-     * "FOO" -> |-|
-     *          |T| -> "ER" -> [] (2)
-     *
-     * After the removal of "FOOTER" the resulting tree is:
-     *
-     * "FOO" -> |B| -> "AR" -> [] (1)
-     *
-     * That can be compressed into:
-     *
-     * "FOOBAR" -> [] (1)
-     */
-    if (trycompress) {
-        debugf("After removing %.*s:\n", (int)len, s);
-        debugnode("Compression may be needed",h);
-        debugf("Seek start node\n");
-
-        /* Try to reach the upper node that is compressible.
-         * At the end of the loop 'h' will point to the first node we
-         * can try to compress and 'parent' to its parent. */
-        raxNode *parent;
-        while(1) {
-            parent = raxStackPop(&ts);
-            if (!parent || parent->iskey ||
-                (!parent->iscompr && parent->size != 1)) break;
-            h = parent;
-            debugnode("Going up to",h);
-        }
-        raxNode *start = h; /* Compression starting node. */
-
-        /* Scan chain of nodes we can compress. */
-        size_t comprsize = h->size;
-        int nodes = 1;
-        while(h->size != 0) {
-            raxNode **cp = raxNodeLastChildPtr(h);
-            memcpy(&h,cp,sizeof(h));
-            if (h->iskey || (!h->iscompr && h->size != 1)) break;
-            /* Stop here if going to the next node would result into
-             * a compressed node larger than h->size can hold. */
-            if (comprsize + h->size > RAX_NODE_MAX_SIZE) break;
-            nodes++;
-            comprsize += h->size;
-        }
-        if (nodes > 1) {
-            /* If we can compress, create the new node and populate it. */
-            size_t nodesize =
-                sizeof(raxNode)+comprsize+raxPadding(comprsize)+sizeof(raxNode*);
-            raxNode *new = rax_malloc(nodesize);
-            /* An out of memory here just means we cannot optimize this
-             * node, but the tree is left in a consistent state. */
-            if (new == NULL) {
-                raxStackFree(&ts);
-                return 1;
-            }
-            new->iskey = 0;
-            new->isnull = 0;
-            new->iscompr = 1;
-            new->size = comprsize;
-            rax->numnodes++;
-
-            /* Scan again, this time to populate the new node content and
-             * to fix the new node child pointer. At the same time we free
-             * all the nodes that we'll no longer use. */
-            comprsize = 0;
-            h = start;
-            while(h->size != 0) {
-                memcpy(new->data+comprsize,h->data,h->size);
-                comprsize += h->size;
-                raxNode **cp = raxNodeLastChildPtr(h);
-                raxNode *tofree = h;
-                memcpy(&h,cp,sizeof(h));
-                rax_free(tofree); rax->numnodes--;
-                if (h->iskey || (!h->iscompr && h->size != 1)) break;
-            }
-            debugnode("New node",new);
-
-            /* Now 'h' points to the first node that we still need to use,
-             * so our new node child pointer will point to it. */
-            raxNode **cp = raxNodeLastChildPtr(new);
-            memcpy(cp,&h,sizeof(h));
-
-            /* Fix parent link. */
-            if (parent) {
-                raxNode **parentlink = raxFindParentLink(parent,start);
-                memcpy(parentlink,&new,sizeof(new));
-            } else {
-                rax->head = new;
-            }
-
-            debugf("Compressed %d nodes, %d total bytes\n",
-                nodes, (int)comprsize);
-        }
-    }
-    raxStackFree(&ts);
-    return 1;
-}
-
-/* This is the core of raxFree(): performs a depth-first scan of the
- * tree and releases all the nodes found. */
-void raxRecursiveFree(rax *rax, raxNode *n, void (*free_callback)(void*)) {
-    debugnode("free traversing",n);
-    int numchildren = n->iscompr ? 1 : n->size;
-    raxNode **cp = raxNodeLastChildPtr(n);
-    while(numchildren--) {
-        raxNode *child;
-        memcpy(&child,cp,sizeof(child));
-        raxRecursiveFree(rax,child,free_callback);
-        cp--;
-    }
-    debugnode("free depth-first",n);
-    if (free_callback && n->iskey && !n->isnull)
-        free_callback(raxGetData(n));
-    rax_free(n);
-    rax->numnodes--;
-}
-
-/* Free a whole radix tree, calling the specified callback in order to
- * free the auxiliary data. */
-void raxFreeWithCallback(rax *rax, void (*free_callback)(void*)) {
-    raxRecursiveFree(rax,rax->head,free_callback);
-    assert(rax->numnodes == 0);
-    rax_free(rax);
-}
-
-/* Free a whole radix tree. */
-void raxFree(rax *rax) {
-    raxFreeWithCallback(rax,NULL);
-}
-
-/* ------------------------------- Iterator --------------------------------- */
-
-/* Initialize a Rax iterator. This call should be performed a single time
- * to initialize the iterator, and must be followed by a raxSeek() call,
- * otherwise the raxPrev()/raxNext() functions will just return EOF. */
-void raxStart(raxIterator *it, rax *rt) {
-    it->flags = RAX_ITER_EOF; /* No crash if the iterator is not seeked. */
-    it->rt = rt;
-    it->key_len = 0;
-    it->key = it->key_static_string;
-    it->key_max = RAX_ITER_STATIC_LEN;
-    it->data = NULL;
-    it->node_cb = NULL;
-    raxStackInit(&it->stack);
-}
-
-/* Append characters at the current key string of the iterator 'it'. This
- * is a low level function used to implement the iterator, not callable by
- * the user. Returns 0 on out of memory, otherwise 1 is returned. */
-int raxIteratorAddChars(raxIterator *it, unsigned char *s, size_t len) {
-    if (it->key_max < it->key_len+len) {
-        unsigned char *old = (it->key == it->key_static_string) ? NULL :
-                                                                  it->key;
-        size_t new_max = (it->key_len+len)*2;
-        it->key = rax_realloc(old,new_max);
-        if (it->key == NULL) {
-            it->key = (!old) ? it->key_static_string : old;
-            errno = ENOMEM;
-            return 0;
-        }
-        if (old == NULL) memcpy(it->key,it->key_static_string,it->key_len);
-        it->key_max = new_max;
-    }
-    /* Use memmove since there could be an overlap between 's' and
-     * it->key when we use the current key in order to re-seek. */
-    memmove(it->key+it->key_len,s,len);
-    it->key_len += len;
-    return 1;
-}
-
-/* Remove the specified number of chars from the right of the current
- * iterator key. */
-void raxIteratorDelChars(raxIterator *it, size_t count) {
-    it->key_len -= count;
-}
-
-/* Do an iteration step towards the next element. At the end of the step the
- * iterator key will represent the (new) current key. If it is not possible
- * to step in the specified direction since there are no longer elements, the
- * iterator is flagged with RAX_ITER_EOF.
- *
- * If 'noup' is true the function starts directly scanning for the next
- * lexicographically smaller children, and the current node is already assumed
- * to be the parent of the last key node, so the first operation to go back to
- * the parent will be skipped. This option is used by raxSeek() when
- * implementing seeking a non existing element with the ">" or "<" options:
- * the starting node is not a key in that particular case, so we start the scan
- * from a node that does not represent the key set.
- *
- * The function returns 1 on success or 0 on out of memory. */
-int raxIteratorNextStep(raxIterator *it, int noup) {
-    if (it->flags & RAX_ITER_EOF) {
-        return 1;
-    } else if (it->flags & RAX_ITER_JUST_SEEKED) {
-        it->flags &= ~RAX_ITER_JUST_SEEKED;
-        return 1;
-    }
-
-    /* Save key len, stack items and the node where we are currently
-     * so that on iterator EOF we can restore the current key and state. */
-    size_t orig_key_len = it->key_len;
-    size_t orig_stack_items = it->stack.items;
-    raxNode *orig_node = it->node;
-
-    while(1) {
-        int children = it->node->iscompr ? 1 : it->node->size;
-        if (!noup && children) {
-            debugf("GO DEEPER\n");
-            /* Seek the lexicographically smaller key in this subtree, which
-             * is the first one found always going towards the first child
-             * of every successive node. */
-            if (!raxStackPush(&it->stack,it->node)) return 0;
-            raxNode **cp = raxNodeFirstChildPtr(it->node);
-            if (!raxIteratorAddChars(it,it->node->data,
-                it->node->iscompr ? it->node->size : 1)) return 0;
-            memcpy(&it->node,cp,sizeof(it->node));
-            /* Call the node callback if any, and replace the node pointer
-             * if the callback returns true. */
-            if (it->node_cb && it->node_cb(&it->node))
-                memcpy(cp,&it->node,sizeof(it->node));
-            /* For "next" step, stop every time we find a key along the
-             * way, since the key is lexicograhically smaller compared to
-             * what follows in the sub-children. */
-            if (it->node->iskey) {
-                it->data = raxGetData(it->node);
-                return 1;
-            }
-        } else {
-            /* If we finished exploring the previous sub-tree, switch to the
-             * new one: go upper until a node is found where there are
-             * children representing keys lexicographically greater than the
-             * current key. */
-            while(1) {
-                int old_noup = noup;
-
-                /* Already on head? Can't go up, iteration finished. */
-                if (!noup && it->node == it->rt->head) {
-                    it->flags |= RAX_ITER_EOF;
-                    it->stack.items = orig_stack_items;
-                    it->key_len = orig_key_len;
-                    it->node = orig_node;
-                    return 1;
-                }
-                /* If there are no children at the current node, try parent's
-                 * next child. */
-                unsigned char prevchild = it->key[it->key_len-1];
-                if (!noup) {
-                    it->node = raxStackPop(&it->stack);
-                } else {
-                    noup = 0;
-                }
-                /* Adjust the current key to represent the node we are
-                 * at. */
-                int todel = it->node->iscompr ? it->node->size : 1;
-                raxIteratorDelChars(it,todel);
-
-                /* Try visiting the next child if there was at least one
-                 * additional child. */
-                if (!it->node->iscompr && it->node->size > (old_noup ? 0 : 1)) {
-                    raxNode **cp = raxNodeFirstChildPtr(it->node);
-                    int i = 0;
-                    while (i < it->node->size) {
-                        debugf("SCAN NEXT %c\n", it->node->data[i]);
-                        if (it->node->data[i] > prevchild) break;
-                        i++;
-                        cp++;
-                    }
-                    if (i != it->node->size) {
-                        debugf("SCAN found a new node\n");
-                        raxIteratorAddChars(it,it->node->data+i,1);
-                        if (!raxStackPush(&it->stack,it->node)) return 0;
-                        memcpy(&it->node,cp,sizeof(it->node));
-                        /* Call the node callback if any, and replace the node
-                         * pointer if the callback returns true. */
-                        if (it->node_cb && it->node_cb(&it->node))
-                            memcpy(cp,&it->node,sizeof(it->node));
-                        if (it->node->iskey) {
-                            it->data = raxGetData(it->node);
-                            return 1;
-                        }
-                        break;
-                    }
-                }
-            }
-        }
-    }
-}
-
-/* Seek the greatest key in the subtree at the current node. Return 0 on
- * out of memory, otherwise 1. This is an helper function for different
- * iteration functions below. */
-int raxSeekGreatest(raxIterator *it) {
-    while(it->node->size) {
-        if (it->node->iscompr) {
-            if (!raxIteratorAddChars(it,it->node->data,
-                it->node->size)) return 0;
-        } else {
-            if (!raxIteratorAddChars(it,it->node->data+it->node->size-1,1))
-                return 0;
-        }
-        raxNode **cp = raxNodeLastChildPtr(it->node);
-        if (!raxStackPush(&it->stack,it->node)) return 0;
-        memcpy(&it->node,cp,sizeof(it->node));
-    }
-    return 1;
-}
-
-/* Like raxIteratorNextStep() but implements an iteration step moving
- * to the lexicographically previous element. The 'noup' option has a similar
- * effect to the one of raxIteratorNextStep(). */
-int raxIteratorPrevStep(raxIterator *it, int noup) {
-    if (it->flags & RAX_ITER_EOF) {
-        return 1;
-    } else if (it->flags & RAX_ITER_JUST_SEEKED) {
-        it->flags &= ~RAX_ITER_JUST_SEEKED;
-        return 1;
-    }
-
-    /* Save key len, stack items and the node where we are currently
-     * so that on iterator EOF we can restore the current key and state. */
-    size_t orig_key_len = it->key_len;
-    size_t orig_stack_items = it->stack.items;
-    raxNode *orig_node = it->node;
-
-    while(1) {
-        int old_noup = noup;
-
-        /* Already on head? Can't go up, iteration finished. */
-        if (!noup && it->node == it->rt->head) {
-            it->flags |= RAX_ITER_EOF;
-            it->stack.items = orig_stack_items;
-            it->key_len = orig_key_len;
-            it->node = orig_node;
-            return 1;
-        }
-
-        unsigned char prevchild = it->key[it->key_len-1];
-        if (!noup) {
-            it->node = raxStackPop(&it->stack);
-        } else {
-            noup = 0;
-        }
-
-        /* Adjust the current key to represent the node we are
-         * at. */
-        int todel = it->node->iscompr ? it->node->size : 1;
-        raxIteratorDelChars(it,todel);
-
-        /* Try visiting the prev child if there is at least one
-         * child. */
-        if (!it->node->iscompr && it->node->size > (old_noup ? 0 : 1)) {
-            raxNode **cp = raxNodeLastChildPtr(it->node);
-            int i = it->node->size-1;
-            while (i >= 0) {
-                debugf("SCAN PREV %c\n", it->node->data[i]);
-                if (it->node->data[i] < prevchild) break;
-                i--;
-                cp--;
-            }
-            /* If we found a new subtree to explore in this node,
-             * go deeper following all the last children in order to
-             * find the key lexicographically greater. */
-            if (i != -1) {
-                debugf("SCAN found a new node\n");
-                /* Enter the node we just found. */
-                if (!raxIteratorAddChars(it,it->node->data+i,1)) return 0;
-                if (!raxStackPush(&it->stack,it->node)) return 0;
-                memcpy(&it->node,cp,sizeof(it->node));
-                /* Seek sub-tree max. */
-                if (!raxSeekGreatest(it)) return 0;
-            }
-        }
-
-        /* Return the key: this could be the key we found scanning a new
-         * subtree, or if we did not find a new subtree to explore here,
-         * before giving up with this node, check if it's a key itself. */
-        if (it->node->iskey) {
-            it->data = raxGetData(it->node);
-            return 1;
-        }
-    }
-}
-
-/* Seek an iterator at the specified element.
- * Return 0 if the seek failed for syntax error or out of memory. Otherwise
- * 1 is returned. When 0 is returned for out of memory, errno is set to
- * the ENOMEM value. */
-int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len) {
-    int eq = 0, lt = 0, gt = 0, first = 0, last = 0;
-
-    it->stack.items = 0; /* Just resetting. Initialized by raxStart(). */
-    it->flags |= RAX_ITER_JUST_SEEKED;
-    it->flags &= ~RAX_ITER_EOF;
-    it->key_len = 0;
-    it->node = NULL;
-
-    /* Set flags according to the operator used to perform the seek. */
-    if (op[0] == '>') {
-        gt = 1;
-        if (op[1] == '=') eq = 1;
-    } else if (op[0] == '<') {
-        lt = 1;
-        if (op[1] == '=') eq = 1;
-    } else if (op[0] == '=') {
-        eq = 1;
-    } else if (op[0] == '^') {
-        first = 1;
-    } else if (op[0] == '$') {
-        last = 1;
-    } else {
-        errno = 0;
-        return 0; /* Error. */
-    }
-
-    /* If there are no elements, set the EOF condition immediately and
-     * return. */
-    if (it->rt->numele == 0) {
-        it->flags |= RAX_ITER_EOF;
-        return 1;
-    }
-
-    if (first) {
-        /* Seeking the first key greater or equal to the empty string
-         * is equivalent to seeking the smaller key available. */
-        return raxSeek(it,">=",NULL,0);
-    }
-
-    if (last) {
-        /* Find the greatest key taking always the last child till a
-         * final node is found. */
-        it->node = it->rt->head;
-        if (!raxSeekGreatest(it)) return 0;
-        assert(it->node->iskey);
-        it->data = raxGetData(it->node);
-        return 1;
-    }
-
-    /* We need to seek the specified key. What we do here is to actually
-     * perform a lookup, and later invoke the prev/next key code that
-     * we already use for iteration. */
-    int splitpos = 0;
-    size_t i = raxLowWalk(it->rt,ele,len,&it->node,NULL,&splitpos,&it->stack);
-
-    /* Return OOM on incomplete stack info. */
-    if (it->stack.oom) return 0;
-
-    if (eq && i == len && (!it->node->iscompr || splitpos == 0) &&
-        it->node->iskey)
-    {
-        /* We found our node, since the key matches and we have an
-         * "equal" condition. */
-        if (!raxIteratorAddChars(it,ele,len)) return 0; /* OOM. */
-        it->data = raxGetData(it->node);
-    } else if (lt || gt) {
-        /* Exact key not found or eq flag not set. We have to set as current
-         * key the one represented by the node we stopped at, and perform
-         * a next/prev operation to seek. To reconstruct the key at this node
-         * we start from the parent and go to the current node, accumulating
-         * the characters found along the way. */
-        if (!raxStackPush(&it->stack,it->node)) return 0;
-        for (size_t j = 1; j < it->stack.items; j++) {
-            raxNode *parent = it->stack.stack[j-1];
-            raxNode *child = it->stack.stack[j];
-            if (parent->iscompr) {
-                if (!raxIteratorAddChars(it,parent->data,parent->size))
-                    return 0;
-            } else {
-                raxNode **cp = raxNodeFirstChildPtr(parent);
-                unsigned char *p = parent->data;
-                while(1) {
-                    raxNode *aux;
-                    memcpy(&aux,cp,sizeof(aux));
-                    if (aux == child) break;
-                    cp++;
-                    p++;
-                }
-                if (!raxIteratorAddChars(it,p,1)) return 0;
-            }
-        }
-        raxStackPop(&it->stack);
-
-        /* We need to set the iterator in the correct state to call next/prev
-         * step in order to seek the desired element. */
-        debugf("After initial seek: i=%d len=%d key=%.*s\n",
-            (int)i, (int)len, (int)it->key_len, it->key);
-        if (i != len && !it->node->iscompr) {
-            /* If we stopped in the middle of a normal node because of a
-             * mismatch, add the mismatching character to the current key
-             * and call the iterator with the 'noup' flag so that it will try
-             * to seek the next/prev child in the current node directly based
-             * on the mismatching character. */
-            if (!raxIteratorAddChars(it,ele+i,1)) return 0;
-            debugf("Seek normal node on mismatch: %.*s\n",
-                (int)it->key_len, (char*)it->key);
-
-            it->flags &= ~RAX_ITER_JUST_SEEKED;
-            if (lt && !raxIteratorPrevStep(it,1)) return 0;
-            if (gt && !raxIteratorNextStep(it,1)) return 0;
-            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
-        } else if (i != len && it->node->iscompr) {
-            debugf("Compressed mismatch: %.*s\n",
-                (int)it->key_len, (char*)it->key);
-            /* In case of a mismatch within a compressed node. */
-            int nodechar = it->node->data[splitpos];
-            int keychar = ele[i];
-            it->flags &= ~RAX_ITER_JUST_SEEKED;
-            if (gt) {
-                /* If the key the compressed node represents is greater
-                 * than our seek element, continue forward, otherwise set the
-                 * state in order to go back to the next sub-tree. */
-                if (nodechar > keychar) {
-                    if (!raxIteratorNextStep(it,0)) return 0;
-                } else {
-                    if (!raxIteratorAddChars(it,it->node->data,it->node->size))
-                        return 0;
-                    if (!raxIteratorNextStep(it,1)) return 0;
-                }
-            }
-            if (lt) {
-                /* If the key the compressed node represents is smaller
-                 * than our seek element, seek the greater key in this
-                 * subtree, otherwise set the state in order to go back to
-                 * the previous sub-tree. */
-                if (nodechar < keychar) {
-                    if (!raxSeekGreatest(it)) return 0;
-                    it->data = raxGetData(it->node);
-                } else {
-                    if (!raxIteratorAddChars(it,it->node->data,it->node->size))
-                        return 0;
-                    if (!raxIteratorPrevStep(it,1)) return 0;
-                }
-            }
-            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
-        } else {
-            debugf("No mismatch: %.*s\n",
-                (int)it->key_len, (char*)it->key);
-            /* If there was no mismatch we are into a node representing the
-             * key, (but which is not a key or the seek operator does not
-             * include 'eq'), or we stopped in the middle of a compressed node
-             * after processing all the key. Continue iterating as this was
-             * a legitimate key we stopped at. */
-            it->flags &= ~RAX_ITER_JUST_SEEKED;
-            if (it->node->iscompr && it->node->iskey && splitpos && lt) {
-                /* If we stopped in the middle of a compressed node with
-                 * perfect match, and the condition is to seek a key "<" than
-                 * the specified one, then if this node is a key it already
-                 * represents our match. For instance we may have nodes:
-                 *
-                 * "f" -> "oobar" = 1 -> "" = 2
-                 *
-                 * Representing keys "f" = 1, "foobar" = 2. A seek for
-                 * the key < "foo" will stop in the middle of the "oobar"
-                 * node, but will be our match, representing the key "f".
-                 *
-                 * So in that case, we don't seek backward. */
-                it->data = raxGetData(it->node);
-            } else {
-                if (gt && !raxIteratorNextStep(it,0)) return 0;
-                if (lt && !raxIteratorPrevStep(it,0)) return 0;
-            }
-            it->flags |= RAX_ITER_JUST_SEEKED; /* Ignore next call. */
-        }
-    } else {
-        /* If we are here just eq was set but no match was found. */
-        it->flags |= RAX_ITER_EOF;
-        return 1;
-    }
-    return 1;
-}
-
-/* Go to the next element in the scope of the iterator 'it'.
- * If EOF (or out of memory) is reached, 0 is returned, otherwise 1 is
- * returned. In case 0 is returned because of OOM, errno is set to ENOMEM. */
-int raxNext(raxIterator *it) {
-    if (!raxIteratorNextStep(it,0)) {
-        errno = ENOMEM;
-        return 0;
-    }
-    if (it->flags & RAX_ITER_EOF) {
-        errno = 0;
-        return 0;
-    }
-    return 1;
-}
-
-/* Go to the previous element in the scope of the iterator 'it'.
- * If EOF (or out of memory) is reached, 0 is returned, otherwise 1 is
- * returned. In case 0 is returned because of OOM, errno is set to ENOMEM. */
-int raxPrev(raxIterator *it) {
-    if (!raxIteratorPrevStep(it,0)) {
-        errno = ENOMEM;
-        return 0;
-    }
-    if (it->flags & RAX_ITER_EOF) {
-        errno = 0;
-        return 0;
-    }
-    return 1;
-}
-
-/* Perform a random walk starting in the current position of the iterator.
- * Return 0 if the tree is empty or on out of memory. Otherwise 1 is returned
- * and the iterator is set to the node reached after doing a random walk
- * of 'steps' steps. If the 'steps' argument is 0, the random walk is performed
- * using a random number of steps between 1 and two times the logarithm of
- * the number of elements.
- *
- * NOTE: if you use this function to generate random elements from the radix
- * tree, expect a disappointing distribution. A random walk produces good
- * random elements if the tree is not sparse, however in the case of a radix
- * tree certain keys will be reported much more often than others. At least
- * this function should be able to explore every possible element eventually. */
-int raxRandomWalk(raxIterator *it, size_t steps) {
-    if (it->rt->numele == 0) {
-        it->flags |= RAX_ITER_EOF;
-        return 0;
-    }
-
-    if (steps == 0) {
-        size_t fle = 1+floor(log(it->rt->numele));
-        fle *= 2;
-        steps = 1 + rand() % fle;
-    }
-
-    raxNode *n = it->node;
-    while(steps > 0 || !n->iskey) {
-        int numchildren = n->iscompr ? 1 : n->size;
-        int r = rand() % (numchildren+(n != it->rt->head));
-
-        if (r == numchildren) {
-            /* Go up to parent. */
-            n = raxStackPop(&it->stack);
-            int todel = n->iscompr ? n->size : 1;
-            raxIteratorDelChars(it,todel);
-        } else {
-            /* Select a random child. */
-            if (n->iscompr) {
-                if (!raxIteratorAddChars(it,n->data,n->size)) return 0;
-            } else {
-                if (!raxIteratorAddChars(it,n->data+r,1)) return 0;
-            }
-            raxNode **cp = raxNodeFirstChildPtr(n)+r;
-            if (!raxStackPush(&it->stack,n)) return 0;
-            memcpy(&n,cp,sizeof(n));
-        }
-        if (n->iskey) steps--;
-    }
-    it->node = n;
-    it->data = raxGetData(it->node);
-    return 1;
-}
-
-/* Compare the key currently pointed by the iterator to the specified
- * key according to the specified operator. Returns 1 if the comparison is
- * true, otherwise 0 is returned. */
-int raxCompare(raxIterator *iter, const char *op, unsigned char *key, size_t key_len) {
-    int eq = 0, lt = 0, gt = 0;
-
-    if (op[0] == '=' || op[1] == '=') eq = 1;
-    if (op[0] == '>') gt = 1;
-    else if (op[0] == '<') lt = 1;
-    else if (op[1] != '=') return 0; /* Syntax error. */
-
-    size_t minlen = key_len < iter->key_len ? key_len : iter->key_len;
-    int cmp = memcmp(iter->key,key,minlen);
-
-    /* Handle == */
-    if (lt == 0 && gt == 0) return cmp == 0 && key_len == iter->key_len;
-
-    /* Handle >, >=, <, <= */
-    if (cmp == 0) {
-        /* Same prefix: longer wins. */
-        if (eq && key_len == iter->key_len) return 1;
-        else if (lt) return iter->key_len < key_len;
-        else if (gt) return iter->key_len > key_len;
-        else return 0; /* Avoid warning, just 'eq' is handled before. */
-    } else if (cmp > 0) {
-        return gt ? 1 : 0;
-    } else /* (cmp < 0) */ {
-        return lt ? 1 : 0;
-    }
-}
-
-/* Free the iterator. */
-void raxStop(raxIterator *it) {
-    if (it->key != it->key_static_string) rax_free(it->key);
-    raxStackFree(&it->stack);
-}
-
-/* Return if the iterator is in an EOF state. This happens when raxSeek()
- * failed to seek an appropriate element, so that raxNext() or raxPrev()
- * will return zero, or when an EOF condition was reached while iterating
- * with raxNext() and raxPrev(). */
-int raxEOF(raxIterator *it) {
-    return it->flags & RAX_ITER_EOF;
-}
-
-/* Return the number of elements inside the radix tree. */
-uint64_t raxSize(rax *rax) {
-    return rax->numele;
-}
-
-/* ----------------------------- Introspection ------------------------------ */
-
-/* This function is mostly used for debugging and learning purposes.
- * It shows an ASCII representation of a tree on standard output, outline
- * all the nodes and the contained keys.
- *
- * The representation is as follow:
- *
- *  "foobar" (compressed node)
- *  [abc] (normal node with three children)
- *  [abc]=0x12345678 (node is a key, pointing to value 0x12345678)
- *  [] (a normal empty node)
- *
- *  Children are represented in new indented lines, each children prefixed by
- *  the "`-(x)" string, where "x" is the edge byte.
- *
- *  [abc]
- *   `-(a) "ladin"
- *   `-(b) [kj]
- *   `-(c) []
- *
- *  However when a node has a single child the following representation
- *  is used instead:
- *
- *  [abc] -> "ladin" -> []
- */
-
-/* The actual implementation of raxShow(). */
-void raxRecursiveShow(int level, int lpad, raxNode *n) {
-    char s = n->iscompr ? '"' : '[';
-    char e = n->iscompr ? '"' : ']';
-
-    int numchars = printf("%c%.*s%c", s, n->size, n->data, e);
-    if (n->iskey) {
-        numchars += printf("=%p",raxGetData(n));
-    }
-
-    int numchildren = n->iscompr ? 1 : n->size;
-    /* Note that 7 and 4 magic constants are the string length
-     * of " `-(x) " and " -> " respectively. */
-    if (level) {
-        lpad += (numchildren > 1) ? 7 : 4;
-        if (numchildren == 1) lpad += numchars;
-    }
-    raxNode **cp = raxNodeFirstChildPtr(n);
-    for (int i = 0; i < numchildren; i++) {
-        char *branch = " `-(%c) ";
-        if (numchildren > 1) {
-            printf("\n");
-            for (int j = 0; j < lpad; j++) putchar(' ');
-            printf(branch,n->data[i]);
-        } else {
-            printf(" -> ");
-        }
-        raxNode *child;
-        memcpy(&child,cp,sizeof(child));
-        raxRecursiveShow(level+1,lpad,child);
-        cp++;
-    }
-}
-
-/* Show a tree, as outlined in the comment above. */
-void raxShow(rax *rax) {
-    raxRecursiveShow(0,0,rax->head);
-    putchar('\n');
-}
-
-/* Used by debugnode() macro to show info about a given node. */
-void raxDebugShowNode(const char *msg, raxNode *n) {
-    if (raxDebugMsg == 0) return;
-    printf("%s: %p [%.*s] key:%u size:%u children:",
-        msg, (void*)n, (int)n->size, (char*)n->data, n->iskey, n->size);
-    int numcld = n->iscompr ? 1 : n->size;
-    raxNode **cldptr = raxNodeLastChildPtr(n) - (numcld-1);
-    while(numcld--) {
-        raxNode *child;
-        memcpy(&child,cldptr,sizeof(child));
-        cldptr++;
-        printf("%p ", (void*)child);
-    }
-    printf("\n");
-    fflush(stdout);
-}
-
-/* Touch all the nodes of a tree returning a check sum. This is useful
- * in order to make Valgrind detect if there is something wrong while
- * reading the data structure.
- *
- * This function was used in order to identify Rax bugs after a big refactoring
- * using this technique:
- *
- * 1. The rax-test is executed using Valgrind, adding a printf() so that for
- *    the fuzz tester we see what iteration in the loop we are in.
- * 2. After every modification of the radix tree made by the fuzz tester
- *    in rax-test.c, we add a call to raxTouch().
- * 3. Now as soon as an operation will corrupt the tree, raxTouch() will
- *    detect it (via Valgrind) immediately. We can add more calls to narrow
- *    the state.
- * 4. At this point a good idea is to enable Rax debugging messages immediately
- *    before the moment the tree is corrupted, to see what happens.
- */
-unsigned long raxTouch(raxNode *n) {
-    debugf("Touching %p\n", (void*)n);
-    unsigned long sum = 0;
-    if (n->iskey) {
-        sum += (unsigned long)raxGetData(n);
-    }
-
-    int numchildren = n->iscompr ? 1 : n->size;
-    raxNode **cp = raxNodeFirstChildPtr(n);
-    int count = 0;
-    for (int i = 0; i < numchildren; i++) {
-        if (numchildren > 1) {
-            sum += (long)n->data[i];
-        }
-        raxNode *child;
-        memcpy(&child,cp,sizeof(child));
-        if (child == (void*)0x65d1760) count++;
-        if (count > 1) exit(1);
-        sum += raxTouch(child);
-        cp++;
-    }
-    return sum;
-}
diff --git a/redis-stable/src/rax.h b/redis-stable/src/rax.h
deleted file mode 100644
index 6b1fd418..00000000
--- a/redis-stable/src/rax.h
+++ /dev/null
@@ -1,216 +0,0 @@
-/* Rax -- A radix tree implementation.
- *
- * Copyright (c) 2017-2018, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef RAX_H
-#define RAX_H
-
-#include <stdint.h>
-
-/* Representation of a radix tree as implemented in this file, that contains
- * the strings "foo", "foobar" and "footer" after the insertion of each
- * word. When the node represents a key inside the radix tree, we write it
- * between [], otherwise it is written between ().
- *
- * This is the vanilla representation:
- *
- *              (f) ""
- *                \
- *                (o) "f"
- *                  \
- *                  (o) "fo"
- *                    \
- *                  [t   b] "foo"
- *                  /     \
- *         "foot" (e)     (a) "foob"
- *                /         \
- *      "foote" (r)         (r) "fooba"
- *              /             \
- *    "footer" []             [] "foobar"
- *
- * However, this implementation implements a very common optimization where
- * successive nodes having a single child are "compressed" into the node
- * itself as a string of characters, each representing a next-level child,
- * and only the link to the node representing the last character node is
- * provided inside the representation. So the above representation is turned
- * into:
- *
- *                  ["foo"] ""
- *                     |
- *                  [t   b] "foo"
- *                  /     \
- *        "foot" ("er")    ("ar") "foob"
- *                 /          \
- *       "footer" []          [] "foobar"
- *
- * However this optimization makes the implementation a bit more complex.
- * For instance if a key "first" is added in the above radix tree, a
- * "node splitting" operation is needed, since the "foo" prefix is no longer
- * composed of nodes having a single child one after the other. This is the
- * above tree and the resulting node splitting after this event happens:
- *
- *
- *                    (f) ""
- *                    /
- *                 (i o) "f"
- *                 /   \
- *    "firs"  ("rst")  (o) "fo"
- *              /        \
- *    "first" []       [t   b] "foo"
- *                     /     \
- *           "foot" ("er")    ("ar") "foob"
- *                    /          \
- *          "footer" []          [] "foobar"
- *
- * Similarly after deletion, if a new chain of nodes having a single child
- * is created (the chain must also not include nodes that represent keys),
- * it must be compressed back into a single node.
- *
- */
-
-#define RAX_NODE_MAX_SIZE ((1<<29)-1)
-typedef struct raxNode {
-    uint32_t iskey:1;     /* Does this node contain a key? */
-    uint32_t isnull:1;    /* Associated value is NULL (don't store it). */
-    uint32_t iscompr:1;   /* Node is compressed. */
-    uint32_t size:29;     /* Number of children, or compressed string len. */
-    /* Data layout is as follows:
-     *
-     * If node is not compressed we have 'size' bytes, one for each children
-     * character, and 'size' raxNode pointers, point to each child node.
-     * Note how the character is not stored in the children but in the
-     * edge of the parents:
-     *
-     * [header iscompr=0][abc][a-ptr][b-ptr][c-ptr](value-ptr?)
-     *
-     * if node is compressed (iscompr bit is 1) the node has 1 children.
-     * In that case the 'size' bytes of the string stored immediately at
-     * the start of the data section, represent a sequence of successive
-     * nodes linked one after the other, for which only the last one in
-     * the sequence is actually represented as a node, and pointed to by
-     * the current compressed node.
-     *
-     * [header iscompr=1][xyz][z-ptr](value-ptr?)
-     *
-     * Both compressed and not compressed nodes can represent a key
-     * with associated data in the radix tree at any level (not just terminal
-     * nodes).
-     *
-     * If the node has an associated key (iskey=1) and is not NULL
-     * (isnull=0), then after the raxNode pointers pointing to the
-     * children, an additional value pointer is present (as you can see
-     * in the representation above as "value-ptr" field).
-     */
-    unsigned char data[];
-} raxNode;
-
-typedef struct rax {
-    raxNode *head;
-    uint64_t numele;
-    uint64_t numnodes;
-} rax;
-
-/* Stack data structure used by raxLowWalk() in order to, optionally, return
- * a list of parent nodes to the caller. The nodes do not have a "parent"
- * field for space concerns, so we use the auxiliary stack when needed. */
-#define RAX_STACK_STATIC_ITEMS 32
-typedef struct raxStack {
-    void **stack; /* Points to static_items or an heap allocated array. */
-    size_t items, maxitems; /* Number of items contained and total space. */
-    /* Up to RAXSTACK_STACK_ITEMS items we avoid to allocate on the heap
-     * and use this static array of pointers instead. */
-    void *static_items[RAX_STACK_STATIC_ITEMS];
-    int oom; /* True if pushing into this stack failed for OOM at some point. */
-} raxStack;
-
-/* Optional callback used for iterators and be notified on each rax node,
- * including nodes not representing keys. If the callback returns true
- * the callback changed the node pointer in the iterator structure, and the
- * iterator implementation will have to replace the pointer in the radix tree
- * internals. This allows the callback to reallocate the node to perform
- * very special operations, normally not needed by normal applications.
- *
- * This callback is used to perform very low level analysis of the radix tree
- * structure, scanning each possible node (but the root node), or in order to
- * reallocate the nodes to reduce the allocation fragmentation (this is the
- * Redis application for this callback).
- *
- * This is currently only supported in forward iterations (raxNext) */
-typedef int (*raxNodeCallback)(raxNode **noderef);
-
-/* Radix tree iterator state is encapsulated into this data structure. */
-#define RAX_ITER_STATIC_LEN 128
-#define RAX_ITER_JUST_SEEKED (1<<0) /* Iterator was just seeked. Return current
-                                       element for the first iteration and
-                                       clear the flag. */
-#define RAX_ITER_EOF (1<<1)    /* End of iteration reached. */
-#define RAX_ITER_SAFE (1<<2)   /* Safe iterator, allows operations while
-                                  iterating. But it is slower. */
-typedef struct raxIterator {
-    int flags;
-    rax *rt;                /* Radix tree we are iterating. */
-    unsigned char *key;     /* The current string. */
-    void *data;             /* Data associated to this key. */
-    size_t key_len;         /* Current key length. */
-    size_t key_max;         /* Max key len the current key buffer can hold. */
-    unsigned char key_static_string[RAX_ITER_STATIC_LEN];
-    raxNode *node;          /* Current node. Only for unsafe iteration. */
-    raxStack stack;         /* Stack used for unsafe iteration. */
-    raxNodeCallback node_cb; /* Optional node callback. Normally set to NULL. */
-} raxIterator;
-
-/* A special pointer returned for not found items. */
-extern void *raxNotFound;
-
-/* Exported API. */
-rax *raxNew(void);
-int raxInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old);
-int raxTryInsert(rax *rax, unsigned char *s, size_t len, void *data, void **old);
-int raxRemove(rax *rax, unsigned char *s, size_t len, void **old);
-void *raxFind(rax *rax, unsigned char *s, size_t len);
-void raxFree(rax *rax);
-void raxFreeWithCallback(rax *rax, void (*free_callback)(void*));
-void raxStart(raxIterator *it, rax *rt);
-int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len);
-int raxNext(raxIterator *it);
-int raxPrev(raxIterator *it);
-int raxRandomWalk(raxIterator *it, size_t steps);
-int raxCompare(raxIterator *iter, const char *op, unsigned char *key, size_t key_len);
-void raxStop(raxIterator *it);
-int raxEOF(raxIterator *it);
-void raxShow(rax *rax);
-uint64_t raxSize(rax *rax);
-unsigned long raxTouch(raxNode *n);
-void raxSetDebugMsg(int onoff);
-
-/* Internal API. May be used by the node callback in order to access rax nodes
- * in a low level way, so this function is exported as well. */
-void raxSetData(raxNode *n, void *data);
-
-#endif
diff --git a/redis-stable/src/rax_malloc.h b/redis-stable/src/rax_malloc.h
deleted file mode 100644
index 9295985c..00000000
--- a/redis-stable/src/rax_malloc.h
+++ /dev/null
@@ -1,44 +0,0 @@
-/* Rax -- A radix tree implementation.
- *
- * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* Allocator selection.
- *
- * This file is used in order to change the Rax allocator at compile time.
- * Just define the following defines to what you want to use. Also add
- * the include of your alternate allocator if needed (not needed in order
- * to use the default libc allocator). */
-
-#ifndef RAX_ALLOC_H
-#define RAX_ALLOC_H
-#include "zmalloc.h"
-#define rax_malloc zmalloc
-#define rax_realloc zrealloc
-#define rax_free zfree
-#endif
diff --git a/redis-stable/src/rdb.c b/redis-stable/src/rdb.c
deleted file mode 100644
index 3a1eeb91..00000000
--- a/redis-stable/src/rdb.c
+++ /dev/null
@@ -1,3070 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "lzf.h"    /* LZF compression library */
-#include "zipmap.h"
-#include "endianconv.h"
-#include "stream.h"
-
-#include <math.h>
-#include <fcntl.h>
-#include <sys/types.h>
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/wait.h>
-#include <arpa/inet.h>
-#include <sys/stat.h>
-#include <sys/param.h>
-
-/* This macro is called when the internal RDB structure is corrupt */
-#define rdbReportCorruptRDB(...) rdbReportError(1, __LINE__,__VA_ARGS__)
-/* This macro is called when RDB read failed (possibly a short read) */
-#define rdbReportReadError(...) rdbReportError(0, __LINE__,__VA_ARGS__)
-
-char* rdbFileBeingLoaded = NULL; /* used for rdb checking on read error */
-extern int rdbCheckMode;
-void rdbCheckError(const char *fmt, ...);
-void rdbCheckSetError(const char *fmt, ...);
-
-#ifdef __GNUC__
-void rdbReportError(int corruption_error, int linenum, char *reason, ...) __attribute__ ((format (printf, 3, 4)));
-#endif
-void rdbReportError(int corruption_error, int linenum, char *reason, ...) {
-    va_list ap;
-    char msg[1024];
-    int len;
-
-    len = snprintf(msg,sizeof(msg),
-        "Internal error in RDB reading offset %llu, function at rdb.c:%d -> ",
-        (unsigned long long)server.loading_loaded_bytes, linenum);
-    va_start(ap,reason);
-    vsnprintf(msg+len,sizeof(msg)-len,reason,ap);
-    va_end(ap);
-
-    if (!server.loading) {
-        /* If we're in the context of a RESTORE command, just propagate the error. */
-        /* log in VERBOSE, and return (don't exit). */
-        serverLog(LL_VERBOSE, "%s", msg);
-        return;
-    } else if (rdbCheckMode) {
-        /* If we're inside the rdb checker, let it handle the error. */
-        rdbCheckError("%s",msg);
-    } else if (rdbFileBeingLoaded) {
-        /* If we're loading an rdb file form disk, run rdb check (and exit) */
-        serverLog(LL_WARNING, "%s", msg);
-        char *argv[2] = {"",rdbFileBeingLoaded};
-        redis_check_rdb_main(2,argv,NULL);
-    } else if (corruption_error) {
-        /* In diskless loading, in case of corrupt file, log and exit. */
-        serverLog(LL_WARNING, "%s. Failure loading rdb format", msg);
-    } else {
-        /* In diskless loading, in case of a short read (not a corrupt
-         * file), log and proceed (don't exit). */
-        serverLog(LL_WARNING, "%s. Failure loading rdb format from socket, assuming connection error, resuming operation.", msg);
-        return;
-    }
-    serverLog(LL_WARNING, "Terminating server after rdb file reading failure.");
-    exit(1);
-}
-
-static ssize_t rdbWriteRaw(rio *rdb, void *p, size_t len) {
-    if (rdb && rioWrite(rdb,p,len) == 0)
-        return -1;
-    return len;
-}
-
-int rdbSaveType(rio *rdb, unsigned char type) {
-    return rdbWriteRaw(rdb,&type,1);
-}
-
-/* Load a "type" in RDB format, that is a one byte unsigned integer.
- * This function is not only used to load object types, but also special
- * "types" like the end-of-file type, the EXPIRE type, and so forth. */
-int rdbLoadType(rio *rdb) {
-    unsigned char type;
-    if (rioRead(rdb,&type,1) == 0) return -1;
-    return type;
-}
-
-/* This is only used to load old databases stored with the RDB_OPCODE_EXPIRETIME
- * opcode. New versions of Redis store using the RDB_OPCODE_EXPIRETIME_MS
- * opcode. On error -1 is returned, however this could be a valid time, so
- * to check for loading errors the caller should call rioGetReadError() after
- * calling this function. */
-time_t rdbLoadTime(rio *rdb) {
-    int32_t t32;
-    if (rioRead(rdb,&t32,4) == 0) return -1;
-    return (time_t)t32;
-}
-
-int rdbSaveMillisecondTime(rio *rdb, long long t) {
-    int64_t t64 = (int64_t) t;
-    memrev64ifbe(&t64); /* Store in little endian. */
-    return rdbWriteRaw(rdb,&t64,8);
-}
-
-/* This function loads a time from the RDB file. It gets the version of the
- * RDB because, unfortunately, before Redis 5 (RDB version 9), the function
- * failed to convert data to/from little endian, so RDB files with keys having
- * expires could not be shared between big endian and little endian systems
- * (because the expire time will be totally wrong). The fix for this is just
- * to call memrev64ifbe(), however if we fix this for all the RDB versions,
- * this call will introduce an incompatibility for big endian systems:
- * after upgrading to Redis version 5 they will no longer be able to load their
- * own old RDB files. Because of that, we instead fix the function only for new
- * RDB versions, and load older RDB versions as we used to do in the past,
- * allowing big endian systems to load their own old RDB files.
- *
- * On I/O error the function returns LLONG_MAX, however if this is also a
- * valid stored value, the caller should use rioGetReadError() to check for
- * errors after calling this function. */
-long long rdbLoadMillisecondTime(rio *rdb, int rdbver) {
-    int64_t t64;
-    if (rioRead(rdb,&t64,8) == 0) return LLONG_MAX;
-    if (rdbver >= 9) /* Check the top comment of this function. */
-        memrev64ifbe(&t64); /* Convert in big endian if the system is BE. */
-    return (long long)t64;
-}
-
-/* Saves an encoded length. The first two bits in the first byte are used to
- * hold the encoding type. See the RDB_* definitions for more information
- * on the types of encoding. */
-int rdbSaveLen(rio *rdb, uint64_t len) {
-    unsigned char buf[2];
-    size_t nwritten;
-
-    if (len < (1<<6)) {
-        /* Save a 6 bit len */
-        buf[0] = (len&0xFF)|(RDB_6BITLEN<<6);
-        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
-        nwritten = 1;
-    } else if (len < (1<<14)) {
-        /* Save a 14 bit len */
-        buf[0] = ((len>>8)&0xFF)|(RDB_14BITLEN<<6);
-        buf[1] = len&0xFF;
-        if (rdbWriteRaw(rdb,buf,2) == -1) return -1;
-        nwritten = 2;
-    } else if (len <= UINT32_MAX) {
-        /* Save a 32 bit len */
-        buf[0] = RDB_32BITLEN;
-        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
-        uint32_t len32 = htonl(len);
-        if (rdbWriteRaw(rdb,&len32,4) == -1) return -1;
-        nwritten = 1+4;
-    } else {
-        /* Save a 64 bit len */
-        buf[0] = RDB_64BITLEN;
-        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
-        len = htonu64(len);
-        if (rdbWriteRaw(rdb,&len,8) == -1) return -1;
-        nwritten = 1+8;
-    }
-    return nwritten;
-}
-
-
-/* Load an encoded length. If the loaded length is a normal length as stored
- * with rdbSaveLen(), the read length is set to '*lenptr'. If instead the
- * loaded length describes a special encoding that follows, then '*isencoded'
- * is set to 1 and the encoding format is stored at '*lenptr'.
- *
- * See the RDB_ENC_* definitions in rdb.h for more information on special
- * encodings.
- *
- * The function returns -1 on error, 0 on success. */
-int rdbLoadLenByRef(rio *rdb, int *isencoded, uint64_t *lenptr) {
-    unsigned char buf[2];
-    int type;
-
-    if (isencoded) *isencoded = 0;
-    if (rioRead(rdb,buf,1) == 0) return -1;
-    type = (buf[0]&0xC0)>>6;
-    if (type == RDB_ENCVAL) {
-        /* Read a 6 bit encoding type. */
-        if (isencoded) *isencoded = 1;
-        *lenptr = buf[0]&0x3F;
-    } else if (type == RDB_6BITLEN) {
-        /* Read a 6 bit len. */
-        *lenptr = buf[0]&0x3F;
-    } else if (type == RDB_14BITLEN) {
-        /* Read a 14 bit len. */
-        if (rioRead(rdb,buf+1,1) == 0) return -1;
-        *lenptr = ((buf[0]&0x3F)<<8)|buf[1];
-    } else if (buf[0] == RDB_32BITLEN) {
-        /* Read a 32 bit len. */
-        uint32_t len;
-        if (rioRead(rdb,&len,4) == 0) return -1;
-        *lenptr = ntohl(len);
-    } else if (buf[0] == RDB_64BITLEN) {
-        /* Read a 64 bit len. */
-        uint64_t len;
-        if (rioRead(rdb,&len,8) == 0) return -1;
-        *lenptr = ntohu64(len);
-    } else {
-        rdbReportCorruptRDB(
-            "Unknown length encoding %d in rdbLoadLen()",type);
-        return -1; /* Never reached. */
-    }
-    return 0;
-}
-
-/* This is like rdbLoadLenByRef() but directly returns the value read
- * from the RDB stream, signaling an error by returning RDB_LENERR
- * (since it is a too large count to be applicable in any Redis data
- * structure). */
-uint64_t rdbLoadLen(rio *rdb, int *isencoded) {
-    uint64_t len;
-
-    if (rdbLoadLenByRef(rdb,isencoded,&len) == -1) return RDB_LENERR;
-    return len;
-}
-
-/* Encodes the "value" argument as integer when it fits in the supported ranges
- * for encoded types. If the function successfully encodes the integer, the
- * representation is stored in the buffer pointer to by "enc" and the string
- * length is returned. Otherwise 0 is returned. */
-int rdbEncodeInteger(long long value, unsigned char *enc) {
-    if (value >= -(1<<7) && value <= (1<<7)-1) {
-        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT8;
-        enc[1] = value&0xFF;
-        return 2;
-    } else if (value >= -(1<<15) && value <= (1<<15)-1) {
-        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT16;
-        enc[1] = value&0xFF;
-        enc[2] = (value>>8)&0xFF;
-        return 3;
-    } else if (value >= -((long long)1<<31) && value <= ((long long)1<<31)-1) {
-        enc[0] = (RDB_ENCVAL<<6)|RDB_ENC_INT32;
-        enc[1] = value&0xFF;
-        enc[2] = (value>>8)&0xFF;
-        enc[3] = (value>>16)&0xFF;
-        enc[4] = (value>>24)&0xFF;
-        return 5;
-    } else {
-        return 0;
-    }
-}
-
-/* Loads an integer-encoded object with the specified encoding type "enctype".
- * The returned value changes according to the flags, see
- * rdbGenericLoadStringObject() for more info. */
-void *rdbLoadIntegerObject(rio *rdb, int enctype, int flags, size_t *lenptr) {
-    int plain = flags & RDB_LOAD_PLAIN;
-    int sds = flags & RDB_LOAD_SDS;
-    int encode = flags & RDB_LOAD_ENC;
-    unsigned char enc[4];
-    long long val;
-
-    if (enctype == RDB_ENC_INT8) {
-        if (rioRead(rdb,enc,1) == 0) return NULL;
-        val = (signed char)enc[0];
-    } else if (enctype == RDB_ENC_INT16) {
-        uint16_t v;
-        if (rioRead(rdb,enc,2) == 0) return NULL;
-        v = enc[0]|(enc[1]<<8);
-        val = (int16_t)v;
-    } else if (enctype == RDB_ENC_INT32) {
-        uint32_t v;
-        if (rioRead(rdb,enc,4) == 0) return NULL;
-        v = enc[0]|(enc[1]<<8)|(enc[2]<<16)|(enc[3]<<24);
-        val = (int32_t)v;
-    } else {
-        rdbReportCorruptRDB("Unknown RDB integer encoding type %d",enctype);
-        return NULL; /* Never reached. */
-    }
-    if (plain || sds) {
-        char buf[LONG_STR_SIZE], *p;
-        int len = ll2string(buf,sizeof(buf),val);
-        if (lenptr) *lenptr = len;
-        p = plain ? zmalloc(len) : sdsnewlen(SDS_NOINIT,len);
-        memcpy(p,buf,len);
-        return p;
-    } else if (encode) {
-        return createStringObjectFromLongLongForValue(val);
-    } else {
-        return createObject(OBJ_STRING,sdsfromlonglong(val));
-    }
-}
-
-/* String objects in the form "2391" "-100" without any space and with a
- * range of values that can fit in an 8, 16 or 32 bit signed value can be
- * encoded as integers to save space */
-int rdbTryIntegerEncoding(char *s, size_t len, unsigned char *enc) {
-    long long value;
-    char *endptr, buf[32];
-
-    /* Check if it's possible to encode this value as a number */
-    value = strtoll(s, &endptr, 10);
-    if (endptr[0] != '\0') return 0;
-    ll2string(buf,32,value);
-
-    /* If the number converted back into a string is not identical
-     * then it's not possible to encode the string as integer */
-    if (strlen(buf) != len || memcmp(buf,s,len)) return 0;
-
-    return rdbEncodeInteger(value,enc);
-}
-
-ssize_t rdbSaveLzfBlob(rio *rdb, void *data, size_t compress_len,
-                       size_t original_len) {
-    unsigned char byte;
-    ssize_t n, nwritten = 0;
-
-    /* Data compressed! Let's save it on disk */
-    byte = (RDB_ENCVAL<<6)|RDB_ENC_LZF;
-    if ((n = rdbWriteRaw(rdb,&byte,1)) == -1) goto writeerr;
-    nwritten += n;
-
-    if ((n = rdbSaveLen(rdb,compress_len)) == -1) goto writeerr;
-    nwritten += n;
-
-    if ((n = rdbSaveLen(rdb,original_len)) == -1) goto writeerr;
-    nwritten += n;
-
-    if ((n = rdbWriteRaw(rdb,data,compress_len)) == -1) goto writeerr;
-    nwritten += n;
-
-    return nwritten;
-
-writeerr:
-    return -1;
-}
-
-ssize_t rdbSaveLzfStringObject(rio *rdb, unsigned char *s, size_t len) {
-    size_t comprlen, outlen;
-    void *out;
-
-    /* We require at least four bytes compression for this to be worth it */
-    if (len <= 4) return 0;
-    outlen = len-4;
-    if ((out = zmalloc(outlen+1)) == NULL) return 0;
-    comprlen = lzf_compress(s, len, out, outlen);
-    if (comprlen == 0) {
-        zfree(out);
-        return 0;
-    }
-    ssize_t nwritten = rdbSaveLzfBlob(rdb, out, comprlen, len);
-    zfree(out);
-    return nwritten;
-}
-
-/* Load an LZF compressed string in RDB format. The returned value
- * changes according to 'flags'. For more info check the
- * rdbGenericLoadStringObject() function. */
-void *rdbLoadLzfStringObject(rio *rdb, int flags, size_t *lenptr) {
-    int plain = flags & RDB_LOAD_PLAIN;
-    int sds = flags & RDB_LOAD_SDS;
-    uint64_t len, clen;
-    unsigned char *c = NULL;
-    char *val = NULL;
-
-    if ((clen = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-    if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-    if ((c = ztrymalloc(clen)) == NULL) {
-        serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbLoadLzfStringObject failed allocating %llu bytes", (unsigned long long)clen);
-        goto err;
-    }
-
-    /* Allocate our target according to the uncompressed size. */
-    if (plain) {
-        val = ztrymalloc(len);
-    } else {
-        val = sdstrynewlen(SDS_NOINIT,len);
-    }
-    if (!val) {
-        serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbLoadLzfStringObject failed allocating %llu bytes", (unsigned long long)len);
-        goto err;
-    }
-
-    if (lenptr) *lenptr = len;
-
-    /* Load the compressed representation and uncompress it to target. */
-    if (rioRead(rdb,c,clen) == 0) goto err;
-    if (lzf_decompress(c,clen,val,len) != len) {
-        rdbReportCorruptRDB("Invalid LZF compressed string");
-        goto err;
-    }
-    zfree(c);
-
-    if (plain || sds) {
-        return val;
-    } else {
-        return createObject(OBJ_STRING,val);
-    }
-err:
-    zfree(c);
-    if (plain)
-        zfree(val);
-    else
-        sdsfree(val);
-    return NULL;
-}
-
-/* Save a string object as [len][data] on disk. If the object is a string
- * representation of an integer value we try to save it in a special form */
-ssize_t rdbSaveRawString(rio *rdb, unsigned char *s, size_t len) {
-    int enclen;
-    ssize_t n, nwritten = 0;
-
-    /* Try integer encoding */
-    if (len <= 11) {
-        unsigned char buf[5];
-        if ((enclen = rdbTryIntegerEncoding((char*)s,len,buf)) > 0) {
-            if (rdbWriteRaw(rdb,buf,enclen) == -1) return -1;
-            return enclen;
-        }
-    }
-
-    /* Try LZF compression - under 20 bytes it's unable to compress even
-     * aaaaaaaaaaaaaaaaaa so skip it */
-    if (server.rdb_compression && len > 20) {
-        n = rdbSaveLzfStringObject(rdb,s,len);
-        if (n == -1) return -1;
-        if (n > 0) return n;
-        /* Return value of 0 means data can't be compressed, save the old way */
-    }
-
-    /* Store verbatim */
-    if ((n = rdbSaveLen(rdb,len)) == -1) return -1;
-    nwritten += n;
-    if (len > 0) {
-        if (rdbWriteRaw(rdb,s,len) == -1) return -1;
-        nwritten += len;
-    }
-    return nwritten;
-}
-
-/* Save a long long value as either an encoded string or a string. */
-ssize_t rdbSaveLongLongAsStringObject(rio *rdb, long long value) {
-    unsigned char buf[32];
-    ssize_t n, nwritten = 0;
-    int enclen = rdbEncodeInteger(value,buf);
-    if (enclen > 0) {
-        return rdbWriteRaw(rdb,buf,enclen);
-    } else {
-        /* Encode as string */
-        enclen = ll2string((char*)buf,32,value);
-        serverAssert(enclen < 32);
-        if ((n = rdbSaveLen(rdb,enclen)) == -1) return -1;
-        nwritten += n;
-        if ((n = rdbWriteRaw(rdb,buf,enclen)) == -1) return -1;
-        nwritten += n;
-    }
-    return nwritten;
-}
-
-/* Like rdbSaveRawString() gets a Redis object instead. */
-ssize_t rdbSaveStringObject(rio *rdb, robj *obj) {
-    /* Avoid to decode the object, then encode it again, if the
-     * object is already integer encoded. */
-    if (obj->encoding == OBJ_ENCODING_INT) {
-        return rdbSaveLongLongAsStringObject(rdb,(long)obj->ptr);
-    } else {
-        serverAssertWithInfo(NULL,obj,sdsEncodedObject(obj));
-        return rdbSaveRawString(rdb,obj->ptr,sdslen(obj->ptr));
-    }
-}
-
-/* Load a string object from an RDB file according to flags:
- *
- * RDB_LOAD_NONE (no flags): load an RDB object, unencoded.
- * RDB_LOAD_ENC: If the returned type is a Redis object, try to
- *               encode it in a special way to be more memory
- *               efficient. When this flag is passed the function
- *               no longer guarantees that obj->ptr is an SDS string.
- * RDB_LOAD_PLAIN: Return a plain string allocated with zmalloc()
- *                 instead of a Redis object with an sds in it.
- * RDB_LOAD_SDS: Return an SDS string instead of a Redis object.
- *
- * On I/O error NULL is returned.
- */
-void *rdbGenericLoadStringObject(rio *rdb, int flags, size_t *lenptr) {
-    int encode = flags & RDB_LOAD_ENC;
-    int plain = flags & RDB_LOAD_PLAIN;
-    int sds = flags & RDB_LOAD_SDS;
-    int isencoded;
-    unsigned long long len;
-
-    len = rdbLoadLen(rdb,&isencoded);
-    if (len == RDB_LENERR) return NULL;
-
-    if (isencoded) {
-        switch(len) {
-        case RDB_ENC_INT8:
-        case RDB_ENC_INT16:
-        case RDB_ENC_INT32:
-            return rdbLoadIntegerObject(rdb,len,flags,lenptr);
-        case RDB_ENC_LZF:
-            return rdbLoadLzfStringObject(rdb,flags,lenptr);
-        default:
-            rdbReportCorruptRDB("Unknown RDB string encoding type %llu",len);
-            return NULL;
-        }
-    }
-
-    if (plain || sds) {
-        void *buf = plain ? ztrymalloc(len) : sdstrynewlen(SDS_NOINIT,len);
-        if (!buf) {
-            serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbGenericLoadStringObject failed allocating %llu bytes", len);
-            return NULL;
-        }
-        if (lenptr) *lenptr = len;
-        if (len && rioRead(rdb,buf,len) == 0) {
-            if (plain)
-                zfree(buf);
-            else
-                sdsfree(buf);
-            return NULL;
-        }
-        return buf;
-    } else {
-        robj *o = encode ? tryCreateStringObject(SDS_NOINIT,len) :
-                           tryCreateRawStringObject(SDS_NOINIT,len);
-        if (!o) {
-            serverLog(server.loading? LL_WARNING: LL_VERBOSE, "rdbGenericLoadStringObject failed allocating %llu bytes", len);
-            return NULL;
-        }
-        if (len && rioRead(rdb,o->ptr,len) == 0) {
-            decrRefCount(o);
-            return NULL;
-        }
-        return o;
-    }
-}
-
-robj *rdbLoadStringObject(rio *rdb) {
-    return rdbGenericLoadStringObject(rdb,RDB_LOAD_NONE,NULL);
-}
-
-robj *rdbLoadEncodedStringObject(rio *rdb) {
-    return rdbGenericLoadStringObject(rdb,RDB_LOAD_ENC,NULL);
-}
-
-/* Save a double value. Doubles are saved as strings prefixed by an unsigned
- * 8 bit integer specifying the length of the representation.
- * This 8 bit integer has special values in order to specify the following
- * conditions:
- * 253: not a number
- * 254: + inf
- * 255: - inf
- */
-int rdbSaveDoubleValue(rio *rdb, double val) {
-    unsigned char buf[128];
-    int len;
-
-    if (isnan(val)) {
-        buf[0] = 253;
-        len = 1;
-    } else if (!isfinite(val)) {
-        len = 1;
-        buf[0] = (val < 0) ? 255 : 254;
-    } else {
-#if (DBL_MANT_DIG >= 52) && (LLONG_MAX == 0x7fffffffffffffffLL)
-        /* Check if the float is in a safe range to be casted into a
-         * long long. We are assuming that long long is 64 bit here.
-         * Also we are assuming that there are no implementations around where
-         * double has precision < 52 bit.
-         *
-         * Under this assumptions we test if a double is inside an interval
-         * where casting to long long is safe. Then using two castings we
-         * make sure the decimal part is zero. If all this is true we use
-         * integer printing function that is much faster. */
-        double min = -4503599627370495; /* (2^52)-1 */
-        double max = 4503599627370496; /* -(2^52) */
-        if (val > min && val < max && val == ((double)((long long)val)))
-            ll2string((char*)buf+1,sizeof(buf)-1,(long long)val);
-        else
-#endif
-            snprintf((char*)buf+1,sizeof(buf)-1,"%.17g",val);
-        buf[0] = strlen((char*)buf+1);
-        len = buf[0]+1;
-    }
-    return rdbWriteRaw(rdb,buf,len);
-}
-
-/* For information about double serialization check rdbSaveDoubleValue() */
-int rdbLoadDoubleValue(rio *rdb, double *val) {
-    char buf[256];
-    unsigned char len;
-
-    if (rioRead(rdb,&len,1) == 0) return -1;
-    switch(len) {
-    case 255: *val = R_NegInf; return 0;
-    case 254: *val = R_PosInf; return 0;
-    case 253: *val = R_Nan; return 0;
-    default:
-        if (rioRead(rdb,buf,len) == 0) return -1;
-        buf[len] = '\0';
-        if (sscanf(buf, "%lg", val)!=1) return -1;
-        return 0;
-    }
-}
-
-/* Saves a double for RDB 8 or greater, where IE754 binary64 format is assumed.
- * We just make sure the integer is always stored in little endian, otherwise
- * the value is copied verbatim from memory to disk.
- *
- * Return -1 on error, the size of the serialized value on success. */
-int rdbSaveBinaryDoubleValue(rio *rdb, double val) {
-    memrev64ifbe(&val);
-    return rdbWriteRaw(rdb,&val,sizeof(val));
-}
-
-/* Loads a double from RDB 8 or greater. See rdbSaveBinaryDoubleValue() for
- * more info. On error -1 is returned, otherwise 0. */
-int rdbLoadBinaryDoubleValue(rio *rdb, double *val) {
-    if (rioRead(rdb,val,sizeof(*val)) == 0) return -1;
-    memrev64ifbe(val);
-    return 0;
-}
-
-/* Like rdbSaveBinaryDoubleValue() but single precision. */
-int rdbSaveBinaryFloatValue(rio *rdb, float val) {
-    memrev32ifbe(&val);
-    return rdbWriteRaw(rdb,&val,sizeof(val));
-}
-
-/* Like rdbLoadBinaryDoubleValue() but single precision. */
-int rdbLoadBinaryFloatValue(rio *rdb, float *val) {
-    if (rioRead(rdb,val,sizeof(*val)) == 0) return -1;
-    memrev32ifbe(val);
-    return 0;
-}
-
-/* Save the object type of object "o". */
-int rdbSaveObjectType(rio *rdb, robj *o) {
-    switch (o->type) {
-    case OBJ_STRING:
-        return rdbSaveType(rdb,RDB_TYPE_STRING);
-    case OBJ_LIST:
-        if (o->encoding == OBJ_ENCODING_QUICKLIST)
-            return rdbSaveType(rdb,RDB_TYPE_LIST_QUICKLIST);
-        else
-            serverPanic("Unknown list encoding");
-    case OBJ_SET:
-        if (o->encoding == OBJ_ENCODING_INTSET)
-            return rdbSaveType(rdb,RDB_TYPE_SET_INTSET);
-        else if (o->encoding == OBJ_ENCODING_HT)
-            return rdbSaveType(rdb,RDB_TYPE_SET);
-        else
-            serverPanic("Unknown set encoding");
-    case OBJ_ZSET:
-        if (o->encoding == OBJ_ENCODING_ZIPLIST)
-            return rdbSaveType(rdb,RDB_TYPE_ZSET_ZIPLIST);
-        else if (o->encoding == OBJ_ENCODING_SKIPLIST)
-            return rdbSaveType(rdb,RDB_TYPE_ZSET_2);
-        else
-            serverPanic("Unknown sorted set encoding");
-    case OBJ_HASH:
-        if (o->encoding == OBJ_ENCODING_ZIPLIST)
-            return rdbSaveType(rdb,RDB_TYPE_HASH_ZIPLIST);
-        else if (o->encoding == OBJ_ENCODING_HT)
-            return rdbSaveType(rdb,RDB_TYPE_HASH);
-        else
-            serverPanic("Unknown hash encoding");
-    case OBJ_STREAM:
-        return rdbSaveType(rdb,RDB_TYPE_STREAM_LISTPACKS);
-    case OBJ_MODULE:
-        return rdbSaveType(rdb,RDB_TYPE_MODULE_2);
-    default:
-        serverPanic("Unknown object type");
-    }
-    return -1; /* avoid warning */
-}
-
-/* Use rdbLoadType() to load a TYPE in RDB format, but returns -1 if the
- * type is not specifically a valid Object Type. */
-int rdbLoadObjectType(rio *rdb) {
-    int type;
-    if ((type = rdbLoadType(rdb)) == -1) return -1;
-    if (!rdbIsObjectType(type)) return -1;
-    return type;
-}
-
-/* This helper function serializes a consumer group Pending Entries List (PEL)
- * into the RDB file. The 'nacks' argument tells the function if also persist
- * the informations about the not acknowledged message, or if to persist
- * just the IDs: this is useful because for the global consumer group PEL
- * we serialized the NACKs as well, but when serializing the local consumer
- * PELs we just add the ID, that will be resolved inside the global PEL to
- * put a reference to the same structure. */
-ssize_t rdbSaveStreamPEL(rio *rdb, rax *pel, int nacks) {
-    ssize_t n, nwritten = 0;
-
-    /* Number of entries in the PEL. */
-    if ((n = rdbSaveLen(rdb,raxSize(pel))) == -1) return -1;
-    nwritten += n;
-
-    /* Save each entry. */
-    raxIterator ri;
-    raxStart(&ri,pel);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        /* We store IDs in raw form as 128 big big endian numbers, like
-         * they are inside the radix tree key. */
-        if ((n = rdbWriteRaw(rdb,ri.key,sizeof(streamID))) == -1) {
-            raxStop(&ri);
-            return -1;
-        }
-        nwritten += n;
-
-        if (nacks) {
-            streamNACK *nack = ri.data;
-            if ((n = rdbSaveMillisecondTime(rdb,nack->delivery_time)) == -1) {
-                raxStop(&ri);
-                return -1;
-            }
-            nwritten += n;
-            if ((n = rdbSaveLen(rdb,nack->delivery_count)) == -1) {
-                raxStop(&ri);
-                return -1;
-            }
-            nwritten += n;
-            /* We don't save the consumer name: we'll save the pending IDs
-             * for each consumer in the consumer PEL, and resolve the consumer
-             * at loading time. */
-        }
-    }
-    raxStop(&ri);
-    return nwritten;
-}
-
-/* Serialize the consumers of a stream consumer group into the RDB. Helper
- * function for the stream data type serialization. What we do here is to
- * persist the consumer metadata, and it's PEL, for each consumer. */
-size_t rdbSaveStreamConsumers(rio *rdb, streamCG *cg) {
-    ssize_t n, nwritten = 0;
-
-    /* Number of consumers in this consumer group. */
-    if ((n = rdbSaveLen(rdb,raxSize(cg->consumers))) == -1) return -1;
-    nwritten += n;
-
-    /* Save each consumer. */
-    raxIterator ri;
-    raxStart(&ri,cg->consumers);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        streamConsumer *consumer = ri.data;
-
-        /* Consumer name. */
-        if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
-            raxStop(&ri);
-            return -1;
-        }
-        nwritten += n;
-
-        /* Last seen time. */
-        if ((n = rdbSaveMillisecondTime(rdb,consumer->seen_time)) == -1) {
-            raxStop(&ri);
-            return -1;
-        }
-        nwritten += n;
-
-        /* Consumer PEL, without the ACKs (see last parameter of the function
-         * passed with value of 0), at loading time we'll lookup the ID
-         * in the consumer group global PEL and will put a reference in the
-         * consumer local PEL. */
-        if ((n = rdbSaveStreamPEL(rdb,consumer->pel,0)) == -1) {
-            raxStop(&ri);
-            return -1;
-        }
-        nwritten += n;
-    }
-    raxStop(&ri);
-    return nwritten;
-}
-
-/* Save a Redis object.
- * Returns -1 on error, number of bytes written on success. */
-ssize_t rdbSaveObject(rio *rdb, robj *o, robj *key) {
-    ssize_t n = 0, nwritten = 0;
-
-    if (o->type == OBJ_STRING) {
-        /* Save a string value */
-        if ((n = rdbSaveStringObject(rdb,o)) == -1) return -1;
-        nwritten += n;
-    } else if (o->type == OBJ_LIST) {
-        /* Save a list value */
-        if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-            quicklist *ql = o->ptr;
-            quicklistNode *node = ql->head;
-
-            if ((n = rdbSaveLen(rdb,ql->len)) == -1) return -1;
-            nwritten += n;
-
-            while(node) {
-                if (quicklistNodeIsCompressed(node)) {
-                    void *data;
-                    size_t compress_len = quicklistGetLzf(node, &data);
-                    if ((n = rdbSaveLzfBlob(rdb,data,compress_len,node->sz)) == -1) return -1;
-                    nwritten += n;
-                } else {
-                    if ((n = rdbSaveRawString(rdb,node->zl,node->sz)) == -1) return -1;
-                    nwritten += n;
-                }
-                node = node->next;
-            }
-        } else {
-            serverPanic("Unknown list encoding");
-        }
-    } else if (o->type == OBJ_SET) {
-        /* Save a set value */
-        if (o->encoding == OBJ_ENCODING_HT) {
-            dict *set = o->ptr;
-            dictIterator *di = dictGetIterator(set);
-            dictEntry *de;
-
-            if ((n = rdbSaveLen(rdb,dictSize(set))) == -1) {
-                dictReleaseIterator(di);
-                return -1;
-            }
-            nwritten += n;
-
-            while((de = dictNext(di)) != NULL) {
-                sds ele = dictGetKey(de);
-                if ((n = rdbSaveRawString(rdb,(unsigned char*)ele,sdslen(ele)))
-                    == -1)
-                {
-                    dictReleaseIterator(di);
-                    return -1;
-                }
-                nwritten += n;
-            }
-            dictReleaseIterator(di);
-        } else if (o->encoding == OBJ_ENCODING_INTSET) {
-            size_t l = intsetBlobLen((intset*)o->ptr);
-
-            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
-            nwritten += n;
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (o->type == OBJ_ZSET) {
-        /* Save a sorted set value */
-        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            size_t l = ziplistBlobLen((unsigned char*)o->ptr);
-
-            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
-            nwritten += n;
-        } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = o->ptr;
-            zskiplist *zsl = zs->zsl;
-
-            if ((n = rdbSaveLen(rdb,zsl->length)) == -1) return -1;
-            nwritten += n;
-
-            /* We save the skiplist elements from the greatest to the smallest
-             * (that's trivial since the elements are already ordered in the
-             * skiplist): this improves the load process, since the next loaded
-             * element will always be the smaller, so adding to the skiplist
-             * will always immediately stop at the head, making the insertion
-             * O(1) instead of O(log(N)). */
-            zskiplistNode *zn = zsl->tail;
-            while (zn != NULL) {
-                if ((n = rdbSaveRawString(rdb,
-                    (unsigned char*)zn->ele,sdslen(zn->ele))) == -1)
-                {
-                    return -1;
-                }
-                nwritten += n;
-                if ((n = rdbSaveBinaryDoubleValue(rdb,zn->score)) == -1)
-                    return -1;
-                nwritten += n;
-                zn = zn->backward;
-            }
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else if (o->type == OBJ_HASH) {
-        /* Save a hash value */
-        if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-            size_t l = ziplistBlobLen((unsigned char*)o->ptr);
-
-            if ((n = rdbSaveRawString(rdb,o->ptr,l)) == -1) return -1;
-            nwritten += n;
-
-        } else if (o->encoding == OBJ_ENCODING_HT) {
-            dictIterator *di = dictGetIterator(o->ptr);
-            dictEntry *de;
-
-            if ((n = rdbSaveLen(rdb,dictSize((dict*)o->ptr))) == -1) {
-                dictReleaseIterator(di);
-                return -1;
-            }
-            nwritten += n;
-
-            while((de = dictNext(di)) != NULL) {
-                sds field = dictGetKey(de);
-                sds value = dictGetVal(de);
-
-                if ((n = rdbSaveRawString(rdb,(unsigned char*)field,
-                        sdslen(field))) == -1)
-                {
-                    dictReleaseIterator(di);
-                    return -1;
-                }
-                nwritten += n;
-                if ((n = rdbSaveRawString(rdb,(unsigned char*)value,
-                        sdslen(value))) == -1)
-                {
-                    dictReleaseIterator(di);
-                    return -1;
-                }
-                nwritten += n;
-            }
-            dictReleaseIterator(di);
-        } else {
-            serverPanic("Unknown hash encoding");
-        }
-    } else if (o->type == OBJ_STREAM) {
-        /* Store how many listpacks we have inside the radix tree. */
-        stream *s = o->ptr;
-        rax *rax = s->rax;
-        if ((n = rdbSaveLen(rdb,raxSize(rax))) == -1) return -1;
-        nwritten += n;
-
-        /* Serialize all the listpacks inside the radix tree as they are,
-         * when loading back, we'll use the first entry of each listpack
-         * to insert it back into the radix tree. */
-        raxIterator ri;
-        raxStart(&ri,rax);
-        raxSeek(&ri,"^",NULL,0);
-        while (raxNext(&ri)) {
-            unsigned char *lp = ri.data;
-            size_t lp_bytes = lpBytes(lp);
-            if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
-                raxStop(&ri);
-                return -1;
-            }
-            nwritten += n;
-            if ((n = rdbSaveRawString(rdb,lp,lp_bytes)) == -1) {
-                raxStop(&ri);
-                return -1;
-            }
-            nwritten += n;
-        }
-        raxStop(&ri);
-
-        /* Save the number of elements inside the stream. We cannot obtain
-         * this easily later, since our macro nodes should be checked for
-         * number of items: not a great CPU / space tradeoff. */
-        if ((n = rdbSaveLen(rdb,s->length)) == -1) return -1;
-        nwritten += n;
-        /* Save the last entry ID. */
-        if ((n = rdbSaveLen(rdb,s->last_id.ms)) == -1) return -1;
-        nwritten += n;
-        if ((n = rdbSaveLen(rdb,s->last_id.seq)) == -1) return -1;
-        nwritten += n;
-
-        /* The consumer groups and their clients are part of the stream
-         * type, so serialize every consumer group. */
-
-        /* Save the number of groups. */
-        size_t num_cgroups = s->cgroups ? raxSize(s->cgroups) : 0;
-        if ((n = rdbSaveLen(rdb,num_cgroups)) == -1) return -1;
-        nwritten += n;
-
-        if (num_cgroups) {
-            /* Serialize each consumer group. */
-            raxStart(&ri,s->cgroups);
-            raxSeek(&ri,"^",NULL,0);
-            while(raxNext(&ri)) {
-                streamCG *cg = ri.data;
-
-                /* Save the group name. */
-                if ((n = rdbSaveRawString(rdb,ri.key,ri.key_len)) == -1) {
-                    raxStop(&ri);
-                    return -1;
-                }
-                nwritten += n;
-
-                /* Last ID. */
-                if ((n = rdbSaveLen(rdb,cg->last_id.ms)) == -1) {
-                    raxStop(&ri);
-                    return -1;
-                }
-                nwritten += n;
-                if ((n = rdbSaveLen(rdb,cg->last_id.seq)) == -1) {
-                    raxStop(&ri);
-                    return -1;
-                }
-                nwritten += n;
-
-                /* Save the global PEL. */
-                if ((n = rdbSaveStreamPEL(rdb,cg->pel,1)) == -1) {
-                    raxStop(&ri);
-                    return -1;
-                }
-                nwritten += n;
-
-                /* Save the consumers of this group. */
-                if ((n = rdbSaveStreamConsumers(rdb,cg)) == -1) {
-                    raxStop(&ri);
-                    return -1;
-                }
-                nwritten += n;
-            }
-            raxStop(&ri);
-        }
-    } else if (o->type == OBJ_MODULE) {
-        /* Save a module-specific value. */
-        RedisModuleIO io;
-        moduleValue *mv = o->ptr;
-        moduleType *mt = mv->type;
-
-        /* Write the "module" identifier as prefix, so that we'll be able
-         * to call the right module during loading. */
-        int retval = rdbSaveLen(rdb,mt->id);
-        if (retval == -1) return -1;
-        moduleInitIOContext(io,mt,rdb,key);
-        io.bytes += retval;
-
-        /* Then write the module-specific representation + EOF marker. */
-        mt->rdb_save(&io,mv->value);
-        retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_EOF);
-        if (retval == -1)
-            io.error = 1;
-        else
-            io.bytes += retval;
-
-        if (io.ctx) {
-            moduleFreeContext(io.ctx);
-            zfree(io.ctx);
-        }
-        return io.error ? -1 : (ssize_t)io.bytes;
-    } else {
-        serverPanic("Unknown object type");
-    }
-    return nwritten;
-}
-
-/* Return the length the object will have on disk if saved with
- * the rdbSaveObject() function. Currently we use a trick to get
- * this length with very little changes to the code. In the future
- * we could switch to a faster solution. */
-size_t rdbSavedObjectLen(robj *o, robj *key) {
-    ssize_t len = rdbSaveObject(NULL,o,key);
-    serverAssertWithInfo(NULL,o,len != -1);
-    return len;
-}
-
-/* Save a key-value pair, with expire time, type, key, value.
- * On error -1 is returned.
- * On success if the key was actually saved 1 is returned. */
-int rdbSaveKeyValuePair(rio *rdb, robj *key, robj *val, long long expiretime) {
-    int savelru = server.maxmemory_policy & MAXMEMORY_FLAG_LRU;
-    int savelfu = server.maxmemory_policy & MAXMEMORY_FLAG_LFU;
-
-    /* Save the expire time */
-    if (expiretime != -1) {
-        if (rdbSaveType(rdb,RDB_OPCODE_EXPIRETIME_MS) == -1) return -1;
-        if (rdbSaveMillisecondTime(rdb,expiretime) == -1) return -1;
-    }
-
-    /* Save the LRU info. */
-    if (savelru) {
-        uint64_t idletime = estimateObjectIdleTime(val);
-        idletime /= 1000; /* Using seconds is enough and requires less space.*/
-        if (rdbSaveType(rdb,RDB_OPCODE_IDLE) == -1) return -1;
-        if (rdbSaveLen(rdb,idletime) == -1) return -1;
-    }
-
-    /* Save the LFU info. */
-    if (savelfu) {
-        uint8_t buf[1];
-        buf[0] = LFUDecrAndReturn(val);
-        /* We can encode this in exactly two bytes: the opcode and an 8
-         * bit counter, since the frequency is logarithmic with a 0-255 range.
-         * Note that we do not store the halving time because to reset it
-         * a single time when loading does not affect the frequency much. */
-        if (rdbSaveType(rdb,RDB_OPCODE_FREQ) == -1) return -1;
-        if (rdbWriteRaw(rdb,buf,1) == -1) return -1;
-    }
-
-    /* Save type, key, value */
-    if (rdbSaveObjectType(rdb,val) == -1) return -1;
-    if (rdbSaveStringObject(rdb,key) == -1) return -1;
-    if (rdbSaveObject(rdb,val,key) == -1) return -1;
-
-    /* Delay return if required (for testing) */
-    if (server.rdb_key_save_delay)
-        debugDelay(server.rdb_key_save_delay);
-
-    return 1;
-}
-
-/* Save an AUX field. */
-ssize_t rdbSaveAuxField(rio *rdb, void *key, size_t keylen, void *val, size_t vallen) {
-    ssize_t ret, len = 0;
-    if ((ret = rdbSaveType(rdb,RDB_OPCODE_AUX)) == -1) return -1;
-    len += ret;
-    if ((ret = rdbSaveRawString(rdb,key,keylen)) == -1) return -1;
-    len += ret;
-    if ((ret = rdbSaveRawString(rdb,val,vallen)) == -1) return -1;
-    len += ret;
-    return len;
-}
-
-/* Wrapper for rdbSaveAuxField() used when key/val length can be obtained
- * with strlen(). */
-ssize_t rdbSaveAuxFieldStrStr(rio *rdb, char *key, char *val) {
-    return rdbSaveAuxField(rdb,key,strlen(key),val,strlen(val));
-}
-
-/* Wrapper for strlen(key) + integer type (up to long long range). */
-ssize_t rdbSaveAuxFieldStrInt(rio *rdb, char *key, long long val) {
-    char buf[LONG_STR_SIZE];
-    int vlen = ll2string(buf,sizeof(buf),val);
-    return rdbSaveAuxField(rdb,key,strlen(key),buf,vlen);
-}
-
-/* Save a few default AUX fields with information about the RDB generated. */
-int rdbSaveInfoAuxFields(rio *rdb, int rdbflags, rdbSaveInfo *rsi) {
-    int redis_bits = (sizeof(void*) == 8) ? 64 : 32;
-    int aof_preamble = (rdbflags & RDBFLAGS_AOF_PREAMBLE) != 0;
-
-    /* Add a few fields about the state when the RDB was created. */
-    if (rdbSaveAuxFieldStrStr(rdb,"redis-ver",REDIS_VERSION) == -1) return -1;
-    if (rdbSaveAuxFieldStrInt(rdb,"redis-bits",redis_bits) == -1) return -1;
-    if (rdbSaveAuxFieldStrInt(rdb,"ctime",time(NULL)) == -1) return -1;
-    if (rdbSaveAuxFieldStrInt(rdb,"used-mem",zmalloc_used_memory()) == -1) return -1;
-
-    /* Handle saving options that generate aux fields. */
-    if (rsi) {
-        if (rdbSaveAuxFieldStrInt(rdb,"repl-stream-db",rsi->repl_stream_db)
-            == -1) return -1;
-        if (rdbSaveAuxFieldStrStr(rdb,"repl-id",server.replid)
-            == -1) return -1;
-        if (rdbSaveAuxFieldStrInt(rdb,"repl-offset",server.master_repl_offset)
-            == -1) return -1;
-    }
-    if (rdbSaveAuxFieldStrInt(rdb,"aof-preamble",aof_preamble) == -1) return -1;
-    return 1;
-}
-
-ssize_t rdbSaveSingleModuleAux(rio *rdb, int when, moduleType *mt) {
-    /* Save a module-specific aux value. */
-    RedisModuleIO io;
-    int retval = rdbSaveType(rdb, RDB_OPCODE_MODULE_AUX);
-    if (retval == -1) return -1;
-    moduleInitIOContext(io,mt,rdb,NULL);
-    io.bytes += retval;
-
-    /* Write the "module" identifier as prefix, so that we'll be able
-     * to call the right module during loading. */
-    retval = rdbSaveLen(rdb,mt->id);
-    if (retval == -1) return -1;
-    io.bytes += retval;
-
-    /* write the 'when' so that we can provide it on loading. add a UINT opcode
-     * for backwards compatibility, everything after the MT needs to be prefixed
-     * by an opcode. */
-    retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_UINT);
-    if (retval == -1) return -1;
-    io.bytes += retval;
-    retval = rdbSaveLen(rdb,when);
-    if (retval == -1) return -1;
-    io.bytes += retval;
-
-    /* Then write the module-specific representation + EOF marker. */
-    mt->aux_save(&io,when);
-    retval = rdbSaveLen(rdb,RDB_MODULE_OPCODE_EOF);
-    if (retval == -1)
-        io.error = 1;
-    else
-        io.bytes += retval;
-
-    if (io.ctx) {
-        moduleFreeContext(io.ctx);
-        zfree(io.ctx);
-    }
-    if (io.error)
-        return -1;
-    return io.bytes;
-}
-
-/* Produces a dump of the database in RDB format sending it to the specified
- * Redis I/O channel. On success C_OK is returned, otherwise C_ERR
- * is returned and part of the output, or all the output, can be
- * missing because of I/O errors.
- *
- * When the function returns C_ERR and if 'error' is not NULL, the
- * integer pointed by 'error' is set to the value of errno just after the I/O
- * error. */
-int rdbSaveRio(rio *rdb, int *error, int rdbflags, rdbSaveInfo *rsi) {
-    dictIterator *di = NULL;
-    dictEntry *de;
-    char magic[10];
-    uint64_t cksum;
-    size_t processed = 0;
-    int j;
-    long key_count = 0;
-    long long info_updated_time = 0;
-    char *pname = (rdbflags & RDBFLAGS_AOF_PREAMBLE) ? "AOF rewrite" :  "RDB";
-
-    if (server.rdb_checksum)
-        rdb->update_cksum = rioGenericUpdateChecksum;
-    snprintf(magic,sizeof(magic),"REDIS%04d",RDB_VERSION);
-    if (rdbWriteRaw(rdb,magic,9) == -1) goto werr;
-    if (rdbSaveInfoAuxFields(rdb,rdbflags,rsi) == -1) goto werr;
-    if (rdbSaveModulesAux(rdb, REDISMODULE_AUX_BEFORE_RDB) == -1) goto werr;
-
-    for (j = 0; j < server.dbnum; j++) {
-        redisDb *db = server.db+j;
-        dict *d = db->dict;
-        if (dictSize(d) == 0) continue;
-        di = dictGetSafeIterator(d);
-
-        /* Write the SELECT DB opcode */
-        if (rdbSaveType(rdb,RDB_OPCODE_SELECTDB) == -1) goto werr;
-        if (rdbSaveLen(rdb,j) == -1) goto werr;
-
-        /* Write the RESIZE DB opcode. */
-        uint64_t db_size, expires_size;
-        db_size = dictSize(db->dict);
-        expires_size = dictSize(db->expires);
-        if (rdbSaveType(rdb,RDB_OPCODE_RESIZEDB) == -1) goto werr;
-        if (rdbSaveLen(rdb,db_size) == -1) goto werr;
-        if (rdbSaveLen(rdb,expires_size) == -1) goto werr;
-
-        /* Iterate this DB writing every entry */
-        while((de = dictNext(di)) != NULL) {
-            sds keystr = dictGetKey(de);
-            robj key, *o = dictGetVal(de);
-            long long expire;
-
-            initStaticStringObject(key,keystr);
-            expire = getExpire(db,&key);
-            if (rdbSaveKeyValuePair(rdb,&key,o,expire) == -1) goto werr;
-
-            /* When this RDB is produced as part of an AOF rewrite, move
-             * accumulated diff from parent to child while rewriting in
-             * order to have a smaller final write. */
-            if (rdbflags & RDBFLAGS_AOF_PREAMBLE &&
-                rdb->processed_bytes > processed+AOF_READ_DIFF_INTERVAL_BYTES)
-            {
-                processed = rdb->processed_bytes;
-                aofReadDiffFromParent();
-            }
-
-            /* Update child info every 1 second (approximately).
-             * in order to avoid calling mstime() on each iteration, we will
-             * check the diff every 1024 keys */
-            if ((key_count++ & 1023) == 0) {
-                long long now = mstime();
-                if (now - info_updated_time >= 1000) {
-                    sendChildInfo(CHILD_INFO_TYPE_CURRENT_INFO, key_count, pname);
-                    info_updated_time = now;
-                }
-            }
-        }
-        dictReleaseIterator(di);
-        di = NULL; /* So that we don't release it again on error. */
-    }
-
-    /* If we are storing the replication information on disk, persist
-     * the script cache as well: on successful PSYNC after a restart, we need
-     * to be able to process any EVALSHA inside the replication backlog the
-     * master will send us. */
-    if (rsi && dictSize(server.lua_scripts)) {
-        di = dictGetIterator(server.lua_scripts);
-        while((de = dictNext(di)) != NULL) {
-            robj *body = dictGetVal(de);
-            if (rdbSaveAuxField(rdb,"lua",3,body->ptr,sdslen(body->ptr)) == -1)
-                goto werr;
-        }
-        dictReleaseIterator(di);
-        di = NULL; /* So that we don't release it again on error. */
-    }
-
-    if (rdbSaveModulesAux(rdb, REDISMODULE_AUX_AFTER_RDB) == -1) goto werr;
-
-    /* EOF opcode */
-    if (rdbSaveType(rdb,RDB_OPCODE_EOF) == -1) goto werr;
-
-    /* CRC64 checksum. It will be zero if checksum computation is disabled, the
-     * loading code skips the check in this case. */
-    cksum = rdb->cksum;
-    memrev64ifbe(&cksum);
-    if (rioWrite(rdb,&cksum,8) == 0) goto werr;
-    return C_OK;
-
-werr:
-    if (error) *error = errno;
-    if (di) dictReleaseIterator(di);
-    return C_ERR;
-}
-
-/* This is just a wrapper to rdbSaveRio() that additionally adds a prefix
- * and a suffix to the generated RDB dump. The prefix is:
- *
- * $EOF:<40 bytes unguessable hex string>\r\n
- *
- * While the suffix is the 40 bytes hex string we announced in the prefix.
- * This way processes receiving the payload can understand when it ends
- * without doing any processing of the content. */
-int rdbSaveRioWithEOFMark(rio *rdb, int *error, rdbSaveInfo *rsi) {
-    char eofmark[RDB_EOF_MARK_SIZE];
-
-    startSaving(RDBFLAGS_REPLICATION);
-    getRandomHexChars(eofmark,RDB_EOF_MARK_SIZE);
-    if (error) *error = 0;
-    if (rioWrite(rdb,"$EOF:",5) == 0) goto werr;
-    if (rioWrite(rdb,eofmark,RDB_EOF_MARK_SIZE) == 0) goto werr;
-    if (rioWrite(rdb,"\r\n",2) == 0) goto werr;
-    if (rdbSaveRio(rdb,error,RDBFLAGS_NONE,rsi) == C_ERR) goto werr;
-    if (rioWrite(rdb,eofmark,RDB_EOF_MARK_SIZE) == 0) goto werr;
-    stopSaving(1);
-    return C_OK;
-
-werr: /* Write error. */
-    /* Set 'error' only if not already set by rdbSaveRio() call. */
-    if (error && *error == 0) *error = errno;
-    stopSaving(0);
-    return C_ERR;
-}
-
-/* Save the DB on disk. Return C_ERR on error, C_OK on success. */
-int rdbSave(char *filename, rdbSaveInfo *rsi) {
-    char tmpfile[256];
-    char cwd[MAXPATHLEN]; /* Current working dir path for error messages. */
-    FILE *fp = NULL;
-    rio rdb;
-    int error = 0;
-
-    snprintf(tmpfile,256,"temp-%d.rdb", (int) getpid());
-    fp = fopen(tmpfile,"w");
-    if (!fp) {
-        char *cwdp = getcwd(cwd,MAXPATHLEN);
-        serverLog(LL_WARNING,
-            "Failed opening the RDB file %s (in server root dir %s) "
-            "for saving: %s",
-            filename,
-            cwdp ? cwdp : "unknown",
-            strerror(errno));
-        return C_ERR;
-    }
-
-    rioInitWithFile(&rdb,fp);
-    startSaving(RDBFLAGS_NONE);
-
-    if (server.rdb_save_incremental_fsync)
-        rioSetAutoSync(&rdb,REDIS_AUTOSYNC_BYTES);
-
-    if (rdbSaveRio(&rdb,&error,RDBFLAGS_NONE,rsi) == C_ERR) {
-        errno = error;
-        goto werr;
-    }
-
-    /* Make sure data will not remain on the OS's output buffers */
-    if (fflush(fp)) goto werr;
-    if (fsync(fileno(fp))) goto werr;
-    if (fclose(fp)) { fp = NULL; goto werr; }
-    fp = NULL;
-    
-    /* Use RENAME to make sure the DB file is changed atomically only
-     * if the generate DB file is ok. */
-    if (rename(tmpfile,filename) == -1) {
-        char *cwdp = getcwd(cwd,MAXPATHLEN);
-        serverLog(LL_WARNING,
-            "Error moving temp DB file %s on the final "
-            "destination %s (in server root dir %s): %s",
-            tmpfile,
-            filename,
-            cwdp ? cwdp : "unknown",
-            strerror(errno));
-        unlink(tmpfile);
-        stopSaving(0);
-        return C_ERR;
-    }
-
-    serverLog(LL_NOTICE,"DB saved on disk");
-    server.dirty = 0;
-    server.lastsave = time(NULL);
-    server.lastbgsave_status = C_OK;
-    stopSaving(1);
-    return C_OK;
-
-werr:
-    serverLog(LL_WARNING,"Write error saving DB on disk: %s", strerror(errno));
-    if (fp) fclose(fp);
-    unlink(tmpfile);
-    stopSaving(0);
-    return C_ERR;
-}
-
-int rdbSaveBackground(char *filename, rdbSaveInfo *rsi) {
-    pid_t childpid;
-
-    if (hasActiveChildProcess()) return C_ERR;
-
-    server.dirty_before_bgsave = server.dirty;
-    server.lastbgsave_try = time(NULL);
-
-    if ((childpid = redisFork(CHILD_TYPE_RDB)) == 0) {
-        int retval;
-
-        /* Child */
-        redisSetProcTitle("redis-rdb-bgsave");
-        redisSetCpuAffinity(server.bgsave_cpulist);
-        retval = rdbSave(filename,rsi);
-        if (retval == C_OK) {
-            sendChildCowInfo(CHILD_INFO_TYPE_RDB_COW_SIZE, "RDB");
-        }
-        exitFromChild((retval == C_OK) ? 0 : 1);
-    } else {
-        /* Parent */
-        if (childpid == -1) {
-            server.lastbgsave_status = C_ERR;
-            serverLog(LL_WARNING,"Can't save in background: fork: %s",
-                strerror(errno));
-            return C_ERR;
-        }
-        serverLog(LL_NOTICE,"Background saving started by pid %ld",(long) childpid);
-        server.rdb_save_time_start = time(NULL);
-        server.rdb_child_type = RDB_CHILD_TYPE_DISK;
-        return C_OK;
-    }
-    return C_OK; /* unreached */
-}
-
-/* Note that we may call this function in signal handle 'sigShutdownHandler',
- * so we need guarantee all functions we call are async-signal-safe.
- * If  we call this function from signal handle, we won't call bg_unlink that
- * is not async-signal-safe. */
-void rdbRemoveTempFile(pid_t childpid, int from_signal) {
-    char tmpfile[256];
-    char pid[32];
-
-    /* Generate temp rdb file name using aync-signal safe functions. */
-    int pid_len = ll2string(pid, sizeof(pid), childpid);
-    strcpy(tmpfile, "temp-");
-    strncpy(tmpfile+5, pid, pid_len);
-    strcpy(tmpfile+5+pid_len, ".rdb");
-
-    if (from_signal) {
-        /* bg_unlink is not async-signal-safe, but in this case we don't really
-         * need to close the fd, it'll be released when the process exists. */
-        int fd = open(tmpfile, O_RDONLY|O_NONBLOCK);
-        UNUSED(fd);
-        unlink(tmpfile);
-    } else {
-        bg_unlink(tmpfile);
-    }
-}
-
-/* This function is called by rdbLoadObject() when the code is in RDB-check
- * mode and we find a module value of type 2 that can be parsed without
- * the need of the actual module. The value is parsed for errors, finally
- * a dummy redis object is returned just to conform to the API. */
-robj *rdbLoadCheckModuleValue(rio *rdb, char *modulename) {
-    uint64_t opcode;
-    while((opcode = rdbLoadLen(rdb,NULL)) != RDB_MODULE_OPCODE_EOF) {
-        if (opcode == RDB_MODULE_OPCODE_SINT ||
-            opcode == RDB_MODULE_OPCODE_UINT)
-        {
-            uint64_t len;
-            if (rdbLoadLenByRef(rdb,NULL,&len) == -1) {
-                rdbReportCorruptRDB(
-                    "Error reading integer from module %s value", modulename);
-            }
-        } else if (opcode == RDB_MODULE_OPCODE_STRING) {
-            robj *o = rdbGenericLoadStringObject(rdb,RDB_LOAD_NONE,NULL);
-            if (o == NULL) {
-                rdbReportCorruptRDB(
-                    "Error reading string from module %s value", modulename);
-            }
-            decrRefCount(o);
-        } else if (opcode == RDB_MODULE_OPCODE_FLOAT) {
-            float val;
-            if (rdbLoadBinaryFloatValue(rdb,&val) == -1) {
-                rdbReportCorruptRDB(
-                    "Error reading float from module %s value", modulename);
-            }
-        } else if (opcode == RDB_MODULE_OPCODE_DOUBLE) {
-            double val;
-            if (rdbLoadBinaryDoubleValue(rdb,&val) == -1) {
-                rdbReportCorruptRDB(
-                    "Error reading double from module %s value", modulename);
-            }
-        }
-    }
-    return createStringObject("module-dummy-value",18);
-}
-
-/* Load a Redis object of the specified type from the specified file.
- * On success a newly allocated object is returned, otherwise NULL.
- * When the function returns NULL and if 'error' is not NULL, the
- * integer pointed by 'error' is set to the type of error that occurred */
-robj *rdbLoadObject(int rdbtype, rio *rdb, sds key, int *error) {
-    robj *o = NULL, *ele, *dec;
-    uint64_t len;
-    unsigned int i;
-
-    /* Set default error of load object, it will be set to 0 on success. */
-    if (error) *error = RDB_LOAD_ERR_OTHER;
-
-    int deep_integrity_validation = server.sanitize_dump_payload == SANITIZE_DUMP_YES;
-    if (server.sanitize_dump_payload == SANITIZE_DUMP_CLIENTS) {
-        /* Skip sanitization when loading (an RDB), or getting a RESTORE command
-         * from either the master or a client using an ACL user with the skip-sanitize-payload flag. */
-        int skip = server.loading ||
-            (server.current_client && (server.current_client->flags & CLIENT_MASTER));
-        if (!skip && server.current_client && server.current_client->user)
-            skip = !!(server.current_client->user->flags & USER_FLAG_SANITIZE_PAYLOAD_SKIP);
-        deep_integrity_validation = !skip;
-    }
-
-    if (rdbtype == RDB_TYPE_STRING) {
-        /* Read string value */
-        if ((o = rdbLoadEncodedStringObject(rdb)) == NULL) return NULL;
-        o = tryObjectEncoding(o);
-    } else if (rdbtype == RDB_TYPE_LIST) {
-        /* Read list value */
-        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-        if (len == 0) goto emptykey;
-
-        o = createQuicklistObject();
-        quicklistSetOptions(o->ptr, server.list_max_ziplist_size,
-                            server.list_compress_depth);
-
-        /* Load every single element of the list */
-        while(len--) {
-            if ((ele = rdbLoadEncodedStringObject(rdb)) == NULL) {
-                decrRefCount(o);
-                return NULL;
-            }
-            dec = getDecodedObject(ele);
-            size_t len = sdslen(dec->ptr);
-            quicklistPushTail(o->ptr, dec->ptr, len);
-            decrRefCount(dec);
-            decrRefCount(ele);
-        }
-    } else if (rdbtype == RDB_TYPE_SET) {
-        /* Read Set value */
-        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-        if (len == 0) goto emptykey;
-
-        /* Use a regular set when there are too many entries. */
-        size_t max_entries = server.set_max_intset_entries;
-        if (max_entries >= 1<<30) max_entries = 1<<30;
-        if (len > max_entries) {
-            o = createSetObject();
-            /* It's faster to expand the dict to the right size asap in order
-             * to avoid rehashing */
-            if (len > DICT_HT_INITIAL_SIZE && dictTryExpand(o->ptr,len) != DICT_OK) {
-                rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
-                decrRefCount(o);
-                return NULL;
-            }
-        } else {
-            o = createIntsetObject();
-        }
-
-        /* Load every single element of the set */
-        for (i = 0; i < len; i++) {
-            long long llval;
-            sds sdsele;
-
-            if ((sdsele = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                decrRefCount(o);
-                return NULL;
-            }
-
-            if (o->encoding == OBJ_ENCODING_INTSET) {
-                /* Fetch integer value from element. */
-                if (isSdsRepresentableAsLongLong(sdsele,&llval) == C_OK) {
-                    uint8_t success;
-                    o->ptr = intsetAdd(o->ptr,llval,&success);
-                    if (!success) {
-                        rdbReportCorruptRDB("Duplicate set members detected");
-                        decrRefCount(o);
-                        sdsfree(sdsele);
-                        return NULL;
-                    }
-                } else {
-                    setTypeConvert(o,OBJ_ENCODING_HT);
-                    if (dictTryExpand(o->ptr,len) != DICT_OK) {
-                        rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
-                        sdsfree(sdsele);
-                        decrRefCount(o);
-                        return NULL;
-                    }
-                }
-            }
-
-            /* This will also be called when the set was just converted
-             * to a regular hash table encoded set. */
-            if (o->encoding == OBJ_ENCODING_HT) {
-                if (dictAdd((dict*)o->ptr,sdsele,NULL) != DICT_OK) {
-                    rdbReportCorruptRDB("Duplicate set members detected");
-                    decrRefCount(o);
-                    sdsfree(sdsele);
-                    return NULL;
-                }
-            } else {
-                sdsfree(sdsele);
-            }
-        }
-    } else if (rdbtype == RDB_TYPE_ZSET_2 || rdbtype == RDB_TYPE_ZSET) {
-        /* Read list/set value. */
-        uint64_t zsetlen;
-        size_t maxelelen = 0, totelelen = 0;
-        zset *zs;
-
-        if ((zsetlen = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-        if (zsetlen == 0) goto emptykey;
-
-        o = createZsetObject();
-        zs = o->ptr;
-
-        if (zsetlen > DICT_HT_INITIAL_SIZE && dictTryExpand(zs->dict,zsetlen) != DICT_OK) {
-            rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)zsetlen);
-            decrRefCount(o);
-            return NULL;
-        }
-
-        /* Load every single element of the sorted set. */
-        while(zsetlen--) {
-            sds sdsele;
-            double score;
-            zskiplistNode *znode;
-
-            if ((sdsele = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                decrRefCount(o);
-                return NULL;
-            }
-
-            if (rdbtype == RDB_TYPE_ZSET_2) {
-                if (rdbLoadBinaryDoubleValue(rdb,&score) == -1) {
-                    decrRefCount(o);
-                    sdsfree(sdsele);
-                    return NULL;
-                }
-            } else {
-                if (rdbLoadDoubleValue(rdb,&score) == -1) {
-                    decrRefCount(o);
-                    sdsfree(sdsele);
-                    return NULL;
-                }
-            }
-
-            /* Don't care about integer-encoded strings. */
-            if (sdslen(sdsele) > maxelelen) maxelelen = sdslen(sdsele);
-            totelelen += sdslen(sdsele);
-
-            znode = zslInsert(zs->zsl,score,sdsele);
-            if (dictAdd(zs->dict,sdsele,&znode->score) != DICT_OK) {
-                rdbReportCorruptRDB("Duplicate zset fields detected");
-                decrRefCount(o);
-                /* no need to free 'sdsele', will be released by zslFree together with 'o' */
-                return NULL;
-            }
-        }
-
-        /* Convert *after* loading, since sorted sets are not stored ordered. */
-        if (zsetLength(o) <= server.zset_max_ziplist_entries &&
-            maxelelen <= server.zset_max_ziplist_value &&
-            ziplistSafeToAdd(NULL, totelelen))
-        {
-            zsetConvert(o,OBJ_ENCODING_ZIPLIST);
-        }
-    } else if (rdbtype == RDB_TYPE_HASH) {
-        uint64_t len;
-        int ret;
-        sds field, value;
-        dict *dupSearchDict = NULL;
-
-        len = rdbLoadLen(rdb, NULL);
-        if (len == RDB_LENERR) return NULL;
-        if (len == 0) goto emptykey;
-
-        o = createHashObject();
-
-        /* Too many entries? Use a hash table right from the start. */
-        if (len > server.hash_max_ziplist_entries)
-            hashTypeConvert(o, OBJ_ENCODING_HT);
-        else if (deep_integrity_validation) {
-            /* In this mode, we need to guarantee that the server won't crash
-             * later when the ziplist is converted to a dict.
-             * Create a set (dict with no values) to for a dup search.
-             * We can dismiss it as soon as we convert the ziplist to a hash. */
-            dupSearchDict = dictCreate(&hashDictType, NULL);
-        }
-
-
-        /* Load every field and value into the ziplist */
-        while (o->encoding == OBJ_ENCODING_ZIPLIST && len > 0) {
-            len--;
-            /* Load raw strings */
-            if ((field = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                decrRefCount(o);
-                if (dupSearchDict) dictRelease(dupSearchDict);
-                return NULL;
-            }
-            if ((value = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                sdsfree(field);
-                decrRefCount(o);
-                if (dupSearchDict) dictRelease(dupSearchDict);
-                return NULL;
-            }
-
-            if (dupSearchDict) {
-                sds field_dup = sdsdup(field);
-                if (dictAdd(dupSearchDict, field_dup, NULL) != DICT_OK) {
-                    rdbReportCorruptRDB("Hash with dup elements");
-                    dictRelease(dupSearchDict);
-                    decrRefCount(o);
-                    sdsfree(field_dup);
-                    sdsfree(field);
-                    sdsfree(value);
-                    return NULL;
-                }
-            }
-
-            /* Convert to hash table if size threshold is exceeded */
-            if (sdslen(field) > server.hash_max_ziplist_value ||
-                sdslen(value) > server.hash_max_ziplist_value ||
-                !ziplistSafeToAdd(o->ptr, sdslen(field)+sdslen(value)))
-            {
-                hashTypeConvert(o, OBJ_ENCODING_HT);
-                ret = dictAdd((dict*)o->ptr, field, value);
-                if (ret == DICT_ERR) {
-                    rdbReportCorruptRDB("Duplicate hash fields detected");
-                    if (dupSearchDict) dictRelease(dupSearchDict);
-                    sdsfree(value);
-                    sdsfree(field);
-                    decrRefCount(o);
-                    return NULL;
-                }
-                break;
-            }
-
-            /* Add pair to ziplist */
-            o->ptr = ziplistPush(o->ptr, (unsigned char*)field,
-                    sdslen(field), ZIPLIST_TAIL);
-            o->ptr = ziplistPush(o->ptr, (unsigned char*)value,
-                    sdslen(value), ZIPLIST_TAIL);
-
-            sdsfree(field);
-            sdsfree(value);
-        }
-
-        if (dupSearchDict) {
-            /* We no longer need this, from now on the entries are added
-             * to a dict so the check is performed implicitly. */
-            dictRelease(dupSearchDict);
-            dupSearchDict = NULL;
-        }
-
-        if (o->encoding == OBJ_ENCODING_HT && len > DICT_HT_INITIAL_SIZE) {
-            if (dictTryExpand(o->ptr,len) != DICT_OK) {
-                rdbReportCorruptRDB("OOM in dictTryExpand %llu", (unsigned long long)len);
-                decrRefCount(o);
-                return NULL;
-            }
-        }
-
-        /* Load remaining fields and values into the hash table */
-        while (o->encoding == OBJ_ENCODING_HT && len > 0) {
-            len--;
-            /* Load encoded strings */
-            if ((field = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                decrRefCount(o);
-                return NULL;
-            }
-            if ((value = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL) {
-                sdsfree(field);
-                decrRefCount(o);
-                return NULL;
-            }
-
-            /* Add pair to hash table */
-            ret = dictAdd((dict*)o->ptr, field, value);
-            if (ret == DICT_ERR) {
-                rdbReportCorruptRDB("Duplicate hash fields detected");
-                sdsfree(value);
-                sdsfree(field);
-                decrRefCount(o);
-                return NULL;
-            }
-        }
-
-        /* All pairs should be read by now */
-        serverAssert(len == 0);
-    } else if (rdbtype == RDB_TYPE_LIST_QUICKLIST) {
-        if ((len = rdbLoadLen(rdb,NULL)) == RDB_LENERR) return NULL;
-        if (len == 0) goto emptykey;
-
-        o = createQuicklistObject();
-        quicklistSetOptions(o->ptr, server.list_max_ziplist_size,
-                            server.list_compress_depth);
-
-        while (len--) {
-            size_t encoded_len;
-            unsigned char *zl =
-                rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&encoded_len);
-            if (zl == NULL) {
-                decrRefCount(o);
-                return NULL;
-            }
-            if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-            if (!ziplistValidateIntegrity(zl, encoded_len, deep_integrity_validation, NULL, NULL)) {
-                rdbReportCorruptRDB("Ziplist integrity check failed.");
-                decrRefCount(o);
-                zfree(zl);
-                return NULL;
-            }
-
-            /* Silently skip empty ziplists, if we'll end up with empty quicklist we'll fail later. */
-            if (ziplistLen(zl) == 0) {
-                zfree(zl);
-                continue;
-            } else {
-                quicklistAppendZiplist(o->ptr, zl);
-            }
-        }
-
-        if (quicklistCount(o->ptr) == 0) {
-            decrRefCount(o);
-            goto emptykey;
-        }
-    } else if (rdbtype == RDB_TYPE_HASH_ZIPMAP  ||
-               rdbtype == RDB_TYPE_LIST_ZIPLIST ||
-               rdbtype == RDB_TYPE_SET_INTSET   ||
-               rdbtype == RDB_TYPE_ZSET_ZIPLIST ||
-               rdbtype == RDB_TYPE_HASH_ZIPLIST)
-    {
-        size_t encoded_len;
-        unsigned char *encoded =
-            rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&encoded_len);
-        if (encoded == NULL) return NULL;
-
-        o = createObject(OBJ_STRING,encoded); /* Obj type fixed below. */
-
-        /* Fix the object encoding, and make sure to convert the encoded
-         * data type into the base type if accordingly to the current
-         * configuration there are too many elements in the encoded data
-         * type. Note that we only check the length and not max element
-         * size as this is an O(N) scan. Eventually everything will get
-         * converted. */
-        switch(rdbtype) {
-            case RDB_TYPE_HASH_ZIPMAP:
-                /* Since we don't keep zipmaps anymore, the rdb loading for these
-                 * is O(n) anyway, use `deep` validation. */
-                if (!zipmapValidateIntegrity(encoded, encoded_len, 1)) {
-                    rdbReportCorruptRDB("Zipmap integrity check failed.");
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    return NULL;
-                }
-                /* Convert to ziplist encoded hash. This must be deprecated
-                 * when loading dumps created by Redis 2.4 gets deprecated. */
-                {
-                    unsigned char *zl = ziplistNew();
-                    unsigned char *zi = zipmapRewind(o->ptr);
-                    unsigned char *fstr, *vstr;
-                    unsigned int flen, vlen;
-                    unsigned int maxlen = 0;
-                    dict *dupSearchDict = dictCreate(&hashDictType, NULL);
-
-                    while ((zi = zipmapNext(zi, &fstr, &flen, &vstr, &vlen)) != NULL) {
-                        if (flen > maxlen) maxlen = flen;
-                        if (vlen > maxlen) maxlen = vlen;
-
-                        /* search for duplicate records */
-                        sds field = sdstrynewlen(fstr, flen);
-                        if (!field || dictAdd(dupSearchDict, field, NULL) != DICT_OK ||
-                            !ziplistSafeToAdd(zl, (size_t)flen + vlen)) {
-                            rdbReportCorruptRDB("Hash zipmap with dup elements, or big length (%u)", flen);
-                            dictRelease(dupSearchDict);
-                            sdsfree(field);
-                            zfree(encoded);
-                            o->ptr = NULL;
-                            decrRefCount(o);
-                            return NULL;
-                        }
-
-                        zl = ziplistPush(zl, fstr, flen, ZIPLIST_TAIL);
-                        zl = ziplistPush(zl, vstr, vlen, ZIPLIST_TAIL);
-                    }
-
-                    dictRelease(dupSearchDict);
-                    zfree(o->ptr);
-                    o->ptr = zl;
-                    o->type = OBJ_HASH;
-                    o->encoding = OBJ_ENCODING_ZIPLIST;
-
-                    if (hashTypeLength(o) > server.hash_max_ziplist_entries ||
-                        maxlen > server.hash_max_ziplist_value)
-                    {
-                        hashTypeConvert(o, OBJ_ENCODING_HT);
-                    }
-                }
-                break;
-            case RDB_TYPE_LIST_ZIPLIST:
-                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-                if (!ziplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation, NULL, NULL)) {
-                    rdbReportCorruptRDB("List ziplist integrity check failed.");
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    return NULL;
-                }
-
-                if (ziplistLen(encoded) == 0) {
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    goto emptykey;
-                }
-
-                o->type = OBJ_LIST;
-                o->encoding = OBJ_ENCODING_ZIPLIST;
-                listTypeConvert(o,OBJ_ENCODING_QUICKLIST);
-                break;
-            case RDB_TYPE_SET_INTSET:
-                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-                if (!intsetValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
-                    rdbReportCorruptRDB("Intset integrity check failed.");
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    return NULL;
-                }
-                o->type = OBJ_SET;
-                o->encoding = OBJ_ENCODING_INTSET;
-                if (intsetLen(o->ptr) > server.set_max_intset_entries)
-                    setTypeConvert(o,OBJ_ENCODING_HT);
-                break;
-            case RDB_TYPE_ZSET_ZIPLIST:
-                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-                if (!zsetZiplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
-                    rdbReportCorruptRDB("Zset ziplist integrity check failed.");
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    return NULL;
-                }
-                o->type = OBJ_ZSET;
-                o->encoding = OBJ_ENCODING_ZIPLIST;
-                if (zsetLength(o) == 0) {
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    goto emptykey;
-                }
-
-                if (zsetLength(o) > server.zset_max_ziplist_entries)
-                    zsetConvert(o,OBJ_ENCODING_SKIPLIST);
-                break;
-            case RDB_TYPE_HASH_ZIPLIST:
-                if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-                if (!hashZiplistValidateIntegrity(encoded, encoded_len, deep_integrity_validation)) {
-                    rdbReportCorruptRDB("Hash ziplist integrity check failed.");
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    return NULL;
-                }
-                o->type = OBJ_HASH;
-                o->encoding = OBJ_ENCODING_ZIPLIST;
-                if (hashTypeLength(o) == 0) {
-                    zfree(encoded);
-                    o->ptr = NULL;
-                    decrRefCount(o);
-                    goto emptykey;
-                }
-
-                if (hashTypeLength(o) > server.hash_max_ziplist_entries)
-                    hashTypeConvert(o, OBJ_ENCODING_HT);
-                break;
-            default:
-                /* totally unreachable */
-                rdbReportCorruptRDB("Unknown RDB encoding type %d",rdbtype);
-                break;
-        }
-    } else if (rdbtype == RDB_TYPE_STREAM_LISTPACKS) {
-        o = createStreamObject();
-        stream *s = o->ptr;
-        uint64_t listpacks = rdbLoadLen(rdb,NULL);
-        if (listpacks == RDB_LENERR) {
-            rdbReportReadError("Stream listpacks len loading failed.");
-            decrRefCount(o);
-            return NULL;
-        }
-
-        while(listpacks--) {
-            /* Get the master ID, the one we'll use as key of the radix tree
-             * node: the entries inside the listpack itself are delta-encoded
-             * relatively to this ID. */
-            sds nodekey = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
-            if (nodekey == NULL) {
-                rdbReportReadError("Stream master ID loading failed: invalid encoding or I/O error.");
-                decrRefCount(o);
-                return NULL;
-            }
-            if (sdslen(nodekey) != sizeof(streamID)) {
-                rdbReportCorruptRDB("Stream node key entry is not the "
-                                        "size of a stream ID");
-                sdsfree(nodekey);
-                decrRefCount(o);
-                return NULL;
-            }
-
-            /* Load the listpack. */
-            size_t lp_size;
-            unsigned char *lp =
-                rdbGenericLoadStringObject(rdb,RDB_LOAD_PLAIN,&lp_size);
-            if (lp == NULL) {
-                rdbReportReadError("Stream listpacks loading failed.");
-                sdsfree(nodekey);
-                decrRefCount(o);
-                return NULL;
-            }
-            if (deep_integrity_validation) server.stat_dump_payload_sanitizations++;
-            if (!streamValidateListpackIntegrity(lp, lp_size, deep_integrity_validation)) {
-                rdbReportCorruptRDB("Stream listpack integrity check failed.");
-                sdsfree(nodekey);
-                decrRefCount(o);
-                zfree(lp);
-                return NULL;
-            }
-
-            unsigned char *first = lpFirst(lp);
-            if (first == NULL) {
-                /* Serialized listpacks should never be empty, since on
-                 * deletion we should remove the radix tree key if the
-                 * resulting listpack is empty. */
-                rdbReportCorruptRDB("Empty listpack inside stream");
-                sdsfree(nodekey);
-                decrRefCount(o);
-                zfree(lp);
-                return NULL;
-            }
-
-            /* Insert the key in the radix tree. */
-            int retval = raxTryInsert(s->rax,
-                (unsigned char*)nodekey,sizeof(streamID),lp,NULL);
-            sdsfree(nodekey);
-            if (!retval) {
-                rdbReportCorruptRDB("Listpack re-added with existing key");
-                decrRefCount(o);
-                zfree(lp);
-                return NULL;
-            }
-        }
-        /* Load total number of items inside the stream. */
-        s->length = rdbLoadLen(rdb,NULL);
-
-        /* Load the last entry ID. */
-        s->last_id.ms = rdbLoadLen(rdb,NULL);
-        s->last_id.seq = rdbLoadLen(rdb,NULL);
-
-        if (rioGetReadError(rdb)) {
-            rdbReportReadError("Stream object metadata loading failed.");
-            decrRefCount(o);
-            return NULL;
-        }
-
-        /* Consumer groups loading */
-        uint64_t cgroups_count = rdbLoadLen(rdb,NULL);
-        if (cgroups_count == RDB_LENERR) {
-            rdbReportReadError("Stream cgroup count loading failed.");
-            decrRefCount(o);
-            return NULL;
-        }
-        while(cgroups_count--) {
-            /* Get the consumer group name and ID. We can then create the
-             * consumer group ASAP and populate its structure as
-             * we read more data. */
-            streamID cg_id;
-            sds cgname = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
-            if (cgname == NULL) {
-                rdbReportReadError(
-                    "Error reading the consumer group name from Stream");
-                decrRefCount(o);
-                return NULL;
-            }
-
-            cg_id.ms = rdbLoadLen(rdb,NULL);
-            cg_id.seq = rdbLoadLen(rdb,NULL);
-            if (rioGetReadError(rdb)) {
-                rdbReportReadError("Stream cgroup ID loading failed.");
-                sdsfree(cgname);
-                decrRefCount(o);
-                return NULL;
-            }
-
-            streamCG *cgroup = streamCreateCG(s,cgname,sdslen(cgname),&cg_id);
-            if (cgroup == NULL) {
-                rdbReportCorruptRDB("Duplicated consumer group name %s",
-                                         cgname);
-                decrRefCount(o);
-                sdsfree(cgname);
-                return NULL;
-            }
-            sdsfree(cgname);
-
-            /* Load the global PEL for this consumer group, however we'll
-             * not yet populate the NACK structures with the message
-             * owner, since consumers for this group and their messages will
-             * be read as a next step. So for now leave them not resolved
-             * and later populate it. */
-            uint64_t pel_size = rdbLoadLen(rdb,NULL);
-            if (pel_size == RDB_LENERR) {
-                rdbReportReadError("Stream PEL size loading failed.");
-                decrRefCount(o);
-                return NULL;
-            }
-            while(pel_size--) {
-                unsigned char rawid[sizeof(streamID)];
-                if (rioRead(rdb,rawid,sizeof(rawid)) == 0) {
-                    rdbReportReadError("Stream PEL ID loading failed.");
-                    decrRefCount(o);
-                    return NULL;
-                }
-                streamNACK *nack = streamCreateNACK(NULL);
-                nack->delivery_time = rdbLoadMillisecondTime(rdb,RDB_VERSION);
-                nack->delivery_count = rdbLoadLen(rdb,NULL);
-                if (rioGetReadError(rdb)) {
-                    rdbReportReadError("Stream PEL NACK loading failed.");
-                    decrRefCount(o);
-                    streamFreeNACK(nack);
-                    return NULL;
-                }
-                if (!raxTryInsert(cgroup->pel,rawid,sizeof(rawid),nack,NULL)) {
-                    rdbReportCorruptRDB("Duplicated global PEL entry "
-                                            "loading stream consumer group");
-                    decrRefCount(o);
-                    streamFreeNACK(nack);
-                    return NULL;
-                }
-            }
-
-            /* Now that we loaded our global PEL, we need to load the
-             * consumers and their local PELs. */
-            uint64_t consumers_num = rdbLoadLen(rdb,NULL);
-            if (consumers_num == RDB_LENERR) {
-                rdbReportReadError("Stream consumers num loading failed.");
-                decrRefCount(o);
-                return NULL;
-            }
-            while(consumers_num--) {
-                sds cname = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL);
-                if (cname == NULL) {
-                    rdbReportReadError(
-                        "Error reading the consumer name from Stream group.");
-                    decrRefCount(o);
-                    return NULL;
-                }
-                streamConsumer *consumer =
-                    streamLookupConsumer(cgroup,cname,SLC_NONE,NULL);
-                sdsfree(cname);
-                consumer->seen_time = rdbLoadMillisecondTime(rdb,RDB_VERSION);
-                if (rioGetReadError(rdb)) {
-                    rdbReportReadError("Stream short read reading seen time.");
-                    decrRefCount(o);
-                    return NULL;
-                }
-
-                /* Load the PEL about entries owned by this specific
-                 * consumer. */
-                pel_size = rdbLoadLen(rdb,NULL);
-                if (pel_size == RDB_LENERR) {
-                    rdbReportReadError(
-                        "Stream consumer PEL num loading failed.");
-                    decrRefCount(o);
-                    return NULL;
-                }
-                while(pel_size--) {
-                    unsigned char rawid[sizeof(streamID)];
-                    if (rioRead(rdb,rawid,sizeof(rawid)) == 0) {
-                        rdbReportReadError(
-                            "Stream short read reading PEL streamID.");
-                        decrRefCount(o);
-                        return NULL;
-                    }
-                    streamNACK *nack = raxFind(cgroup->pel,rawid,sizeof(rawid));
-                    if (nack == raxNotFound) {
-                        rdbReportCorruptRDB("Consumer entry not found in "
-                                                "group global PEL");
-                        decrRefCount(o);
-                        return NULL;
-                    }
-
-                    /* Set the NACK consumer, that was left to NULL when
-                     * loading the global PEL. Then set the same shared
-                     * NACK structure also in the consumer-specific PEL. */
-                    nack->consumer = consumer;
-                    if (!raxTryInsert(consumer->pel,rawid,sizeof(rawid),nack,NULL)) {
-                        rdbReportCorruptRDB("Duplicated consumer PEL entry "
-                                                " loading a stream consumer "
-                                                "group");
-                        decrRefCount(o);
-                        streamFreeNACK(nack);
-                        return NULL;
-                    }
-                }
-            }
-
-            /* Verify that each PEL eventually got a consumer assigned to it. */
-            if (deep_integrity_validation) {
-                raxIterator ri_cg_pel;
-                raxStart(&ri_cg_pel,cgroup->pel);
-                raxSeek(&ri_cg_pel,"^",NULL,0);
-                while(raxNext(&ri_cg_pel)) {
-                    streamNACK *nack = ri_cg_pel.data;
-                    if (!nack->consumer) {
-                        raxStop(&ri_cg_pel);
-                        rdbReportCorruptRDB("Stream CG PEL entry without consumer");
-                        decrRefCount(o);
-                        return NULL;
-                    }
-                }
-                raxStop(&ri_cg_pel);
-            }
-        }
-    } else if (rdbtype == RDB_TYPE_MODULE || rdbtype == RDB_TYPE_MODULE_2) {
-        uint64_t moduleid = rdbLoadLen(rdb,NULL);
-        if (rioGetReadError(rdb)) {
-            rdbReportReadError("Short read module id");
-            return NULL;
-        }
-        moduleType *mt = moduleTypeLookupModuleByID(moduleid);
-
-        if (rdbCheckMode && rdbtype == RDB_TYPE_MODULE_2) {
-            char name[10];
-            moduleTypeNameByID(name,moduleid);
-            return rdbLoadCheckModuleValue(rdb,name);
-        }
-
-        if (mt == NULL) {
-            char name[10];
-            moduleTypeNameByID(name,moduleid);
-            rdbReportCorruptRDB("The RDB file contains module data I can't load: no matching module type '%s'", name);
-            return NULL;
-        }
-        RedisModuleIO io;
-        robj keyobj;
-        initStaticStringObject(keyobj,key);
-        moduleInitIOContext(io,mt,rdb,&keyobj);
-        io.ver = (rdbtype == RDB_TYPE_MODULE) ? 1 : 2;
-        /* Call the rdb_load method of the module providing the 10 bit
-         * encoding version in the lower 10 bits of the module ID. */
-        void *ptr = mt->rdb_load(&io,moduleid&1023);
-        if (io.ctx) {
-            moduleFreeContext(io.ctx);
-            zfree(io.ctx);
-        }
-
-        /* Module v2 serialization has an EOF mark at the end. */
-        if (io.ver == 2) {
-            uint64_t eof = rdbLoadLen(rdb,NULL);
-            if (eof == RDB_LENERR) {
-                if (ptr) {
-                    o = createModuleObject(mt,ptr); /* creating just in order to easily destroy */
-                    decrRefCount(o);
-                }
-                return NULL;
-            }
-            if (eof != RDB_MODULE_OPCODE_EOF) {
-                rdbReportCorruptRDB("The RDB file contains module data for the module '%s' that is not terminated by "
-                                    "the proper module value EOF marker", moduleTypeModuleName(mt));
-                if (ptr) {
-                    o = createModuleObject(mt,ptr); /* creating just in order to easily destroy */
-                    decrRefCount(o);
-                }
-                return NULL;
-            }
-        }
-
-        if (ptr == NULL) {
-            rdbReportCorruptRDB("The RDB file contains module data for the module type '%s', that the responsible "
-                                "module is not able to load. Check for modules log above for additional clues.",
-                                moduleTypeModuleName(mt));
-            return NULL;
-        }
-        o = createModuleObject(mt,ptr);
-    } else {
-        rdbReportReadError("Unknown RDB encoding type %d",rdbtype);
-        return NULL;
-    }
-    if (error) *error = 0;
-    return o;
-
-emptykey:
-    if (error) *error = RDB_LOAD_ERR_EMPTY_KEY;
-    return NULL;
-}
-
-/* Mark that we are loading in the global state and setup the fields
- * needed to provide loading stats. */
-void startLoading(size_t size, int rdbflags) {
-    /* Load the DB */
-    server.loading = 1;
-    server.loading_start_time = time(NULL);
-    server.loading_loaded_bytes = 0;
-    server.loading_total_bytes = size;
-    server.loading_rdb_used_mem = 0;
-    blockingOperationStarts();
-
-    /* Fire the loading modules start event. */
-    int subevent;
-    if (rdbflags & RDBFLAGS_AOF_PREAMBLE)
-        subevent = REDISMODULE_SUBEVENT_LOADING_AOF_START;
-    else if(rdbflags & RDBFLAGS_REPLICATION)
-        subevent = REDISMODULE_SUBEVENT_LOADING_REPL_START;
-    else
-        subevent = REDISMODULE_SUBEVENT_LOADING_RDB_START;
-    moduleFireServerEvent(REDISMODULE_EVENT_LOADING,subevent,NULL);
-}
-
-/* Mark that we are loading in the global state and setup the fields
- * needed to provide loading stats.
- * 'filename' is optional and used for rdb-check on error */
-void startLoadingFile(FILE *fp, char* filename, int rdbflags) {
-    struct stat sb;
-    if (fstat(fileno(fp), &sb) == -1)
-        sb.st_size = 0;
-    rdbFileBeingLoaded = filename;
-    startLoading(sb.st_size, rdbflags);
-}
-
-/* Refresh the loading progress info */
-void loadingProgress(off_t pos) {
-    server.loading_loaded_bytes = pos;
-    if (server.stat_peak_memory < zmalloc_used_memory())
-        server.stat_peak_memory = zmalloc_used_memory();
-}
-
-/* Loading finished */
-void stopLoading(int success) {
-    server.loading = 0;
-    blockingOperationEnds();
-    rdbFileBeingLoaded = NULL;
-
-    /* Fire the loading modules end event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_LOADING,
-                          success?
-                            REDISMODULE_SUBEVENT_LOADING_ENDED:
-                            REDISMODULE_SUBEVENT_LOADING_FAILED,
-                          NULL);
-}
-
-void startSaving(int rdbflags) {
-    /* Fire the persistence modules end event. */
-    int subevent;
-    if (rdbflags & RDBFLAGS_AOF_PREAMBLE)
-        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START;
-    else if (getpid()!=server.pid)
-        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START;
-    else
-        subevent = REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START;
-    moduleFireServerEvent(REDISMODULE_EVENT_PERSISTENCE,subevent,NULL);
-}
-
-void stopSaving(int success) {
-    /* Fire the persistence modules end event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_PERSISTENCE,
-                          success?
-                            REDISMODULE_SUBEVENT_PERSISTENCE_ENDED:
-                            REDISMODULE_SUBEVENT_PERSISTENCE_FAILED,
-                          NULL);
-}
-
-/* Track loading progress in order to serve client's from time to time
-   and if needed calculate rdb checksum  */
-void rdbLoadProgressCallback(rio *r, const void *buf, size_t len) {
-    if (server.rdb_checksum)
-        rioGenericUpdateChecksum(r, buf, len);
-    if (server.loading_process_events_interval_bytes &&
-        (r->processed_bytes + len)/server.loading_process_events_interval_bytes > r->processed_bytes/server.loading_process_events_interval_bytes)
-    {
-        if (server.masterhost && server.repl_state == REPL_STATE_TRANSFER)
-            replicationSendNewlineToMaster();
-        loadingProgress(r->processed_bytes);
-        processEventsWhileBlocked();
-        processModuleLoadingProgressEvent(0);
-    }
-}
-
-/* Load an RDB file from the rio stream 'rdb'. On success C_OK is returned,
- * otherwise C_ERR is returned and 'errno' is set accordingly. */
-int rdbLoadRio(rio *rdb, int rdbflags, rdbSaveInfo *rsi) {
-    uint64_t dbid;
-    int type, rdbver;
-    redisDb *db = server.db+0;
-    char buf[1024];
-    int error;
-    long long empty_keys_skipped = 0, expired_keys_skipped = 0, keys_loaded = 0;
-
-    rdb->update_cksum = rdbLoadProgressCallback;
-    rdb->max_processing_chunk = server.loading_process_events_interval_bytes;
-    if (rioRead(rdb,buf,9) == 0) goto eoferr;
-    buf[9] = '\0';
-    if (memcmp(buf,"REDIS",5) != 0) {
-        serverLog(LL_WARNING,"Wrong signature trying to load DB from file");
-        errno = EINVAL;
-        return C_ERR;
-    }
-    rdbver = atoi(buf+5);
-    if (rdbver < 1 || rdbver > RDB_VERSION) {
-        serverLog(LL_WARNING,"Can't handle RDB format version %d",rdbver);
-        errno = EINVAL;
-        return C_ERR;
-    }
-
-    /* Key-specific attributes, set by opcodes before the key type. */
-    long long lru_idle = -1, lfu_freq = -1, expiretime = -1, now = mstime();
-    long long lru_clock = LRU_CLOCK();
-
-    while(1) {
-        sds key;
-        robj *val;
-
-        /* Read type. */
-        if ((type = rdbLoadType(rdb)) == -1) goto eoferr;
-
-        /* Handle special types. */
-        if (type == RDB_OPCODE_EXPIRETIME) {
-            /* EXPIRETIME: load an expire associated with the next key
-             * to load. Note that after loading an expire we need to
-             * load the actual type, and continue. */
-            expiretime = rdbLoadTime(rdb);
-            expiretime *= 1000;
-            if (rioGetReadError(rdb)) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_EXPIRETIME_MS) {
-            /* EXPIRETIME_MS: milliseconds precision expire times introduced
-             * with RDB v3. Like EXPIRETIME but no with more precision. */
-            expiretime = rdbLoadMillisecondTime(rdb,rdbver);
-            if (rioGetReadError(rdb)) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_FREQ) {
-            /* FREQ: LFU frequency. */
-            uint8_t byte;
-            if (rioRead(rdb,&byte,1) == 0) goto eoferr;
-            lfu_freq = byte;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_IDLE) {
-            /* IDLE: LRU idle time. */
-            uint64_t qword;
-            if ((qword = rdbLoadLen(rdb,NULL)) == RDB_LENERR) goto eoferr;
-            lru_idle = qword;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_EOF) {
-            /* EOF: End of file, exit the main loop. */
-            break;
-        } else if (type == RDB_OPCODE_SELECTDB) {
-            /* SELECTDB: Select the specified database. */
-            if ((dbid = rdbLoadLen(rdb,NULL)) == RDB_LENERR) goto eoferr;
-            if (dbid >= (unsigned)server.dbnum) {
-                serverLog(LL_WARNING,
-                    "FATAL: Data file was created with a Redis "
-                    "server configured to handle more than %d "
-                    "databases. Exiting\n", server.dbnum);
-                exit(1);
-            }
-            db = server.db+dbid;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_RESIZEDB) {
-            /* RESIZEDB: Hint about the size of the keys in the currently
-             * selected data base, in order to avoid useless rehashing. */
-            uint64_t db_size, expires_size;
-            if ((db_size = rdbLoadLen(rdb,NULL)) == RDB_LENERR)
-                goto eoferr;
-            if ((expires_size = rdbLoadLen(rdb,NULL)) == RDB_LENERR)
-                goto eoferr;
-            dictExpand(db->dict,db_size);
-            dictExpand(db->expires,expires_size);
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_AUX) {
-            /* AUX: generic string-string fields. Use to add state to RDB
-             * which is backward compatible. Implementations of RDB loading
-             * are required to skip AUX fields they don't understand.
-             *
-             * An AUX field is composed of two strings: key and value. */
-            robj *auxkey, *auxval;
-            if ((auxkey = rdbLoadStringObject(rdb)) == NULL) goto eoferr;
-            if ((auxval = rdbLoadStringObject(rdb)) == NULL) goto eoferr;
-
-            if (((char*)auxkey->ptr)[0] == '%') {
-                /* All the fields with a name staring with '%' are considered
-                 * information fields and are logged at startup with a log
-                 * level of NOTICE. */
-                serverLog(LL_NOTICE,"RDB '%s': %s",
-                    (char*)auxkey->ptr,
-                    (char*)auxval->ptr);
-            } else if (!strcasecmp(auxkey->ptr,"repl-stream-db")) {
-                if (rsi) rsi->repl_stream_db = atoi(auxval->ptr);
-            } else if (!strcasecmp(auxkey->ptr,"repl-id")) {
-                if (rsi && sdslen(auxval->ptr) == CONFIG_RUN_ID_SIZE) {
-                    memcpy(rsi->repl_id,auxval->ptr,CONFIG_RUN_ID_SIZE+1);
-                    rsi->repl_id_is_set = 1;
-                }
-            } else if (!strcasecmp(auxkey->ptr,"repl-offset")) {
-                if (rsi) rsi->repl_offset = strtoll(auxval->ptr,NULL,10);
-            } else if (!strcasecmp(auxkey->ptr,"lua")) {
-                /* Load the script back in memory. */
-                if (luaCreateFunction(NULL,server.lua,auxval) == NULL) {
-                    rdbReportCorruptRDB(
-                        "Can't load Lua script from RDB file! "
-                        "BODY: %s", (char*)auxval->ptr);
-                }
-            } else if (!strcasecmp(auxkey->ptr,"redis-ver")) {
-                serverLog(LL_NOTICE,"Loading RDB produced by version %s",
-                    (char*)auxval->ptr);
-            } else if (!strcasecmp(auxkey->ptr,"ctime")) {
-                time_t age = time(NULL)-strtol(auxval->ptr,NULL,10);
-                if (age < 0) age = 0;
-                serverLog(LL_NOTICE,"RDB age %ld seconds",
-                    (unsigned long) age);
-            } else if (!strcasecmp(auxkey->ptr,"used-mem")) {
-                long long usedmem = strtoll(auxval->ptr,NULL,10);
-                serverLog(LL_NOTICE,"RDB memory usage when created %.2f Mb",
-                    (double) usedmem / (1024*1024));
-                server.loading_rdb_used_mem = usedmem;
-            } else if (!strcasecmp(auxkey->ptr,"aof-preamble")) {
-                long long haspreamble = strtoll(auxval->ptr,NULL,10);
-                if (haspreamble) serverLog(LL_NOTICE,"RDB has an AOF tail");
-            } else if (!strcasecmp(auxkey->ptr,"redis-bits")) {
-                /* Just ignored. */
-            } else {
-                /* We ignore fields we don't understand, as by AUX field
-                 * contract. */
-                serverLog(LL_DEBUG,"Unrecognized RDB AUX field: '%s'",
-                    (char*)auxkey->ptr);
-            }
-
-            decrRefCount(auxkey);
-            decrRefCount(auxval);
-            continue; /* Read type again. */
-        } else if (type == RDB_OPCODE_MODULE_AUX) {
-            /* Load module data that is not related to the Redis key space.
-             * Such data can be potentially be stored both before and after the
-             * RDB keys-values section. */
-            uint64_t moduleid = rdbLoadLen(rdb,NULL);
-            int when_opcode = rdbLoadLen(rdb,NULL);
-            int when = rdbLoadLen(rdb,NULL);
-            if (rioGetReadError(rdb)) goto eoferr;
-            if (when_opcode != RDB_MODULE_OPCODE_UINT) {
-                rdbReportReadError("bad when_opcode");
-                goto eoferr;
-            }
-            moduleType *mt = moduleTypeLookupModuleByID(moduleid);
-            char name[10];
-            moduleTypeNameByID(name,moduleid);
-
-            if (!rdbCheckMode && mt == NULL) {
-                /* Unknown module. */
-                serverLog(LL_WARNING,"The RDB file contains AUX module data I can't load: no matching module '%s'", name);
-                exit(1);
-            } else if (!rdbCheckMode && mt != NULL) {
-                if (!mt->aux_load) {
-                    /* Module doesn't support AUX. */
-                    serverLog(LL_WARNING,"The RDB file contains module AUX data, but the module '%s' doesn't seem to support it.", name);
-                    exit(1);
-                }
-
-                RedisModuleIO io;
-                moduleInitIOContext(io,mt,rdb,NULL);
-                io.ver = 2;
-                /* Call the rdb_load method of the module providing the 10 bit
-                 * encoding version in the lower 10 bits of the module ID. */
-                if (mt->aux_load(&io,moduleid&1023, when) != REDISMODULE_OK || io.error) {
-                    moduleTypeNameByID(name,moduleid);
-                    serverLog(LL_WARNING,"The RDB file contains module AUX data for the module type '%s', that the responsible module is not able to load. Check for modules log above for additional clues.", name);
-                    goto eoferr;
-                }
-                if (io.ctx) {
-                    moduleFreeContext(io.ctx);
-                    zfree(io.ctx);
-                }
-                uint64_t eof = rdbLoadLen(rdb,NULL);
-                if (eof != RDB_MODULE_OPCODE_EOF) {
-                    serverLog(LL_WARNING,"The RDB file contains module AUX data for the module '%s' that is not terminated by the proper module value EOF marker", name);
-                    goto eoferr;
-                }
-                continue;
-            } else {
-                /* RDB check mode. */
-                robj *aux = rdbLoadCheckModuleValue(rdb,name);
-                decrRefCount(aux);
-                continue; /* Read next opcode. */
-            }
-        }
-
-        /* Read key */
-        if ((key = rdbGenericLoadStringObject(rdb,RDB_LOAD_SDS,NULL)) == NULL)
-            goto eoferr;
-        /* Read value */
-        val = rdbLoadObject(type,rdb,key,&error);
-
-        /* Check if the key already expired. This function is used when loading
-         * an RDB file from disk, either at startup, or when an RDB was
-         * received from the master. In the latter case, the master is
-         * responsible for key expiry. If we would expire keys here, the
-         * snapshot taken by the master may not be reflected on the slave.
-         * Similarly if the RDB is the preamble of an AOF file, we want to
-         * load all the keys as they are, since the log of operations later
-         * assume to work in an exact keyspace state. */
-        if (val == NULL) {
-            /* Since we used to have bug that could lead to empty keys
-             * (See #8453), we rather not fail when empty key is encountered
-             * in an RDB file, instead we will silently discard it and
-             * continue loading. */
-            if (error == RDB_LOAD_ERR_EMPTY_KEY) {
-                if(empty_keys_skipped++ < 10)
-                    serverLog(LL_WARNING, "rdbLoadObject skipping empty key: %s", key);
-                sdsfree(key);
-            } else {
-                sdsfree(key);
-                goto eoferr;
-            }
-        } else if (iAmMaster() &&
-            !(rdbflags&RDBFLAGS_AOF_PREAMBLE) &&
-            expiretime != -1 && expiretime < now)
-        {
-            sdsfree(key);
-            decrRefCount(val);
-            expired_keys_skipped++;
-        } else {
-            robj keyobj;
-            initStaticStringObject(keyobj,key);
-
-            /* Add the new object in the hash table */
-            int added = dbAddRDBLoad(db,key,val);
-            keys_loaded++;
-            if (!added) {
-                if (rdbflags & RDBFLAGS_ALLOW_DUP) {
-                    /* This flag is useful for DEBUG RELOAD special modes.
-                     * When it's set we allow new keys to replace the current
-                     * keys with the same name. */
-                    dbSyncDelete(db,&keyobj);
-                    dbAddRDBLoad(db,key,val);
-                } else {
-                    serverLog(LL_WARNING,
-                        "RDB has duplicated key '%s' in DB %d",key,db->id);
-                    serverPanic("Duplicated key found in RDB file");
-                }
-            }
-
-            /* Set the expire time if needed */
-            if (expiretime != -1) {
-                setExpire(NULL,db,&keyobj,expiretime);
-            }
-
-            /* Set usage information (for eviction). */
-            objectSetLRUOrLFU(val,lfu_freq,lru_idle,lru_clock,1000);
-
-            /* call key space notification on key loaded for modules only */
-            moduleNotifyKeyspaceEvent(NOTIFY_LOADED, "loaded", &keyobj, db->id);
-        }
-
-        /* Loading the database more slowly is useful in order to test
-         * certain edge cases. */
-        if (server.key_load_delay)
-            debugDelay(server.key_load_delay);
-
-        /* Reset the state that is key-specified and is populated by
-         * opcodes before the key, so that we start from scratch again. */
-        expiretime = -1;
-        lfu_freq = -1;
-        lru_idle = -1;
-    }
-    /* Verify the checksum if RDB version is >= 5 */
-    if (rdbver >= 5) {
-        uint64_t cksum, expected = rdb->cksum;
-
-        if (rioRead(rdb,&cksum,8) == 0) goto eoferr;
-        if (server.rdb_checksum && !server.skip_checksum_validation) {
-            memrev64ifbe(&cksum);
-            if (cksum == 0) {
-                serverLog(LL_WARNING,"RDB file was saved with checksum disabled: no check performed.");
-            } else if (cksum != expected) {
-                serverLog(LL_WARNING,"Wrong RDB checksum expected: (%llx) but "
-                    "got (%llx). Aborting now.",
-                        (unsigned long long)expected,
-                        (unsigned long long)cksum);
-                rdbReportCorruptRDB("RDB CRC error");
-                return C_ERR;
-            }
-        }
-    }
-
-    if (empty_keys_skipped) {
-        serverLog(LL_WARNING,
-            "Done loading RDB, keys loaded: %lld, keys expired: %lld, empty keys skipped: %lld.",
-                keys_loaded, expired_keys_skipped, empty_keys_skipped);
-    } else {
-        serverLog(LL_WARNING,
-            "Done loading RDB, keys loaded: %lld, keys expired: %lld.",
-                keys_loaded, expired_keys_skipped);
-    }
-    return C_OK;
-
-    /* Unexpected end of file is handled here calling rdbReportReadError():
-     * this will in turn either abort Redis in most cases, or if we are loading
-     * the RDB file from a socket during initial SYNC (diskless replica mode),
-     * we'll report the error to the caller, so that we can retry. */
-eoferr:
-    serverLog(LL_WARNING,
-        "Short read or OOM loading DB. Unrecoverable error, aborting now.");
-    rdbReportReadError("Unexpected EOF reading RDB file");
-    return C_ERR;
-}
-
-/* Like rdbLoadRio() but takes a filename instead of a rio stream. The
- * filename is open for reading and a rio stream object created in order
- * to do the actual loading. Moreover the ETA displayed in the INFO
- * output is initialized and finalized.
- *
- * If you pass an 'rsi' structure initialied with RDB_SAVE_OPTION_INIT, the
- * loading code will fiil the information fields in the structure. */
-int rdbLoad(char *filename, rdbSaveInfo *rsi, int rdbflags) {
-    FILE *fp;
-    rio rdb;
-    int retval;
-
-    if ((fp = fopen(filename,"r")) == NULL) return C_ERR;
-    startLoadingFile(fp, filename,rdbflags);
-    rioInitWithFile(&rdb,fp);
-    retval = rdbLoadRio(&rdb,rdbflags,rsi);
-    fclose(fp);
-    stopLoading(retval==C_OK);
-    return retval;
-}
-
-/* A background saving child (BGSAVE) terminated its work. Handle this.
- * This function covers the case of actual BGSAVEs. */
-static void backgroundSaveDoneHandlerDisk(int exitcode, int bysignal) {
-    if (!bysignal && exitcode == 0) {
-        serverLog(LL_NOTICE,
-            "Background saving terminated with success");
-        server.dirty = server.dirty - server.dirty_before_bgsave;
-        server.lastsave = time(NULL);
-        server.lastbgsave_status = C_OK;
-    } else if (!bysignal && exitcode != 0) {
-        serverLog(LL_WARNING, "Background saving error");
-        server.lastbgsave_status = C_ERR;
-    } else {
-        mstime_t latency;
-
-        serverLog(LL_WARNING,
-            "Background saving terminated by signal %d", bysignal);
-        latencyStartMonitor(latency);
-        rdbRemoveTempFile(server.child_pid, 0);
-        latencyEndMonitor(latency);
-        latencyAddSampleIfNeeded("rdb-unlink-temp-file",latency);
-        /* SIGUSR1 is whitelisted, so we have a way to kill a child without
-         * triggering an error condition. */
-        if (bysignal != SIGUSR1)
-            server.lastbgsave_status = C_ERR;
-    }
-}
-
-/* A background saving child (BGSAVE) terminated its work. Handle this.
- * This function covers the case of RDB -> Slaves socket transfers for
- * diskless replication. */
-static void backgroundSaveDoneHandlerSocket(int exitcode, int bysignal) {
-    if (!bysignal && exitcode == 0) {
-        serverLog(LL_NOTICE,
-            "Background RDB transfer terminated with success");
-    } else if (!bysignal && exitcode != 0) {
-        serverLog(LL_WARNING, "Background transfer error");
-    } else {
-        serverLog(LL_WARNING,
-            "Background transfer terminated by signal %d", bysignal);
-    }
-    if (server.rdb_child_exit_pipe!=-1)
-        close(server.rdb_child_exit_pipe);
-    aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
-    close(server.rdb_pipe_read);
-    server.rdb_child_exit_pipe = -1;
-    server.rdb_pipe_read = -1;
-    zfree(server.rdb_pipe_conns);
-    server.rdb_pipe_conns = NULL;
-    server.rdb_pipe_numconns = 0;
-    server.rdb_pipe_numconns_writing = 0;
-    zfree(server.rdb_pipe_buff);
-    server.rdb_pipe_buff = NULL;
-    server.rdb_pipe_bufflen = 0;
-}
-
-/* When a background RDB saving/transfer terminates, call the right handler. */
-void backgroundSaveDoneHandler(int exitcode, int bysignal) {
-    int type = server.rdb_child_type;
-    switch(server.rdb_child_type) {
-    case RDB_CHILD_TYPE_DISK:
-        backgroundSaveDoneHandlerDisk(exitcode,bysignal);
-        break;
-    case RDB_CHILD_TYPE_SOCKET:
-        backgroundSaveDoneHandlerSocket(exitcode,bysignal);
-        break;
-    default:
-        serverPanic("Unknown RDB child type.");
-        break;
-    }
-
-    server.rdb_child_type = RDB_CHILD_TYPE_NONE;
-    server.rdb_save_time_last = time(NULL)-server.rdb_save_time_start;
-    server.rdb_save_time_start = -1;
-    /* Possibly there are slaves waiting for a BGSAVE in order to be served
-     * (the first stage of SYNC is a bulk transfer of dump.rdb) */
-    updateSlavesWaitingBgsave((!bysignal && exitcode == 0) ? C_OK : C_ERR, type);
-}
-
-/* Kill the RDB saving child using SIGUSR1 (so that the parent will know
- * the child did not exit for an error, but because we wanted), and performs
- * the cleanup needed. */
-void killRDBChild(void) {
-    kill(server.child_pid, SIGUSR1);
-    /* Because we are not using here waitpid (like we have in killAppendOnlyChild
-     * and TerminateModuleForkChild), all the cleanup operations is done by
-     * checkChildrenDone, that later will find that the process killed.
-     * This includes:
-     * - resetChildState
-     * - rdbRemoveTempFile */
-}
-
-/* Spawn an RDB child that writes the RDB to the sockets of the slaves
- * that are currently in SLAVE_STATE_WAIT_BGSAVE_START state. */
-int rdbSaveToSlavesSockets(rdbSaveInfo *rsi) {
-    listNode *ln;
-    listIter li;
-    pid_t childpid;
-    int pipefds[2], rdb_pipe_write, safe_to_exit_pipe;
-
-    if (hasActiveChildProcess()) return C_ERR;
-
-    /* Even if the previous fork child exited, don't start a new one until we
-     * drained the pipe. */
-    if (server.rdb_pipe_conns) return C_ERR;
-
-    /* Before to fork, create a pipe that is used to transfer the rdb bytes to
-     * the parent, we can't let it write directly to the sockets, since in case
-     * of TLS we must let the parent handle a continuous TLS state when the
-     * child terminates and parent takes over. */
-    if (pipe(pipefds) == -1) return C_ERR;
-    server.rdb_pipe_read = pipefds[0]; /* read end */
-    rdb_pipe_write = pipefds[1]; /* write end */
-    anetNonBlock(NULL, server.rdb_pipe_read);
-
-    /* create another pipe that is used by the parent to signal to the child
-     * that it can exit. */
-    if (pipe(pipefds) == -1) {
-        close(rdb_pipe_write);
-        close(server.rdb_pipe_read);
-        return C_ERR;
-    }
-    safe_to_exit_pipe = pipefds[0]; /* read end */
-    server.rdb_child_exit_pipe = pipefds[1]; /* write end */
-
-    /* Collect the connections of the replicas we want to transfer
-     * the RDB to, which are i WAIT_BGSAVE_START state. */
-    server.rdb_pipe_conns = zmalloc(sizeof(connection *)*listLength(server.slaves));
-    server.rdb_pipe_numconns = 0;
-    server.rdb_pipe_numconns_writing = 0;
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-        if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
-            server.rdb_pipe_conns[server.rdb_pipe_numconns++] = slave->conn;
-            replicationSetupSlaveForFullResync(slave,getPsyncInitialOffset());
-        }
-    }
-
-    /* Create the child process. */
-    if ((childpid = redisFork(CHILD_TYPE_RDB)) == 0) {
-        /* Child */
-        int retval, dummy;
-        rio rdb;
-
-        rioInitWithFd(&rdb,rdb_pipe_write);
-
-        redisSetProcTitle("redis-rdb-to-slaves");
-        redisSetCpuAffinity(server.bgsave_cpulist);
-
-        retval = rdbSaveRioWithEOFMark(&rdb,NULL,rsi);
-        if (retval == C_OK && rioFlush(&rdb) == 0)
-            retval = C_ERR;
-
-        if (retval == C_OK) {
-            sendChildCowInfo(CHILD_INFO_TYPE_RDB_COW_SIZE, "RDB");
-        }
-
-        rioFreeFd(&rdb);
-        /* wake up the reader, tell it we're done. */
-        close(rdb_pipe_write);
-        close(server.rdb_child_exit_pipe); /* close write end so that we can detect the close on the parent. */
-        /* hold exit until the parent tells us it's safe. we're not expecting
-         * to read anything, just get the error when the pipe is closed. */
-        dummy = read(safe_to_exit_pipe, pipefds, 1);
-        UNUSED(dummy);
-        exitFromChild((retval == C_OK) ? 0 : 1);
-    } else {
-        /* Parent */
-        close(safe_to_exit_pipe);
-        if (childpid == -1) {
-            serverLog(LL_WARNING,"Can't save in background: fork: %s",
-                strerror(errno));
-
-            /* Undo the state change. The caller will perform cleanup on
-             * all the slaves in BGSAVE_START state, but an early call to
-             * replicationSetupSlaveForFullResync() turned it into BGSAVE_END */
-            listRewind(server.slaves,&li);
-            while((ln = listNext(&li))) {
-                client *slave = ln->value;
-                if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END) {
-                    slave->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
-                }
-            }
-            close(rdb_pipe_write);
-            close(server.rdb_pipe_read);
-            zfree(server.rdb_pipe_conns);
-            server.rdb_pipe_conns = NULL;
-            server.rdb_pipe_numconns = 0;
-            server.rdb_pipe_numconns_writing = 0;
-        } else {
-            serverLog(LL_NOTICE,"Background RDB transfer started by pid %ld",
-                (long) childpid);
-            server.rdb_save_time_start = time(NULL);
-            server.rdb_child_type = RDB_CHILD_TYPE_SOCKET;
-            close(rdb_pipe_write); /* close write in parent so that it can detect the close on the child. */
-            if (aeCreateFileEvent(server.el, server.rdb_pipe_read, AE_READABLE, rdbPipeReadHandler,NULL) == AE_ERR) {
-                serverPanic("Unrecoverable error creating server.rdb_pipe_read file event.");
-            }
-        }
-        return (childpid == -1) ? C_ERR : C_OK;
-    }
-    return C_OK; /* Unreached. */
-}
-
-void saveCommand(client *c) {
-    if (server.child_type == CHILD_TYPE_RDB) {
-        addReplyError(c,"Background save already in progress");
-        return;
-    }
-    rdbSaveInfo rsi, *rsiptr;
-    rsiptr = rdbPopulateSaveInfo(&rsi);
-    if (rdbSave(server.rdb_filename,rsiptr) == C_OK) {
-        addReply(c,shared.ok);
-    } else {
-        addReplyErrorObject(c,shared.err);
-    }
-}
-
-/* BGSAVE [SCHEDULE] */
-void bgsaveCommand(client *c) {
-    int schedule = 0;
-
-    /* The SCHEDULE option changes the behavior of BGSAVE when an AOF rewrite
-     * is in progress. Instead of returning an error a BGSAVE gets scheduled. */
-    if (c->argc > 1) {
-        if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"schedule")) {
-            schedule = 1;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    rdbSaveInfo rsi, *rsiptr;
-    rsiptr = rdbPopulateSaveInfo(&rsi);
-
-    if (server.child_type == CHILD_TYPE_RDB) {
-        addReplyError(c,"Background save already in progress");
-    } else if (hasActiveChildProcess()) {
-        if (schedule) {
-            server.rdb_bgsave_scheduled = 1;
-            addReplyStatus(c,"Background saving scheduled");
-        } else {
-            addReplyError(c,
-            "Another child process is active (AOF?): can't BGSAVE right now. "
-            "Use BGSAVE SCHEDULE in order to schedule a BGSAVE whenever "
-            "possible.");
-        }
-    } else if (rdbSaveBackground(server.rdb_filename,rsiptr) == C_OK) {
-        addReplyStatus(c,"Background saving started");
-    } else {
-        addReplyErrorObject(c,shared.err);
-    }
-}
-
-/* Populate the rdbSaveInfo structure used to persist the replication
- * information inside the RDB file. Currently the structure explicitly
- * contains just the currently selected DB from the master stream, however
- * if the rdbSave*() family functions receive a NULL rsi structure also
- * the Replication ID/offset is not saved. The function popultes 'rsi'
- * that is normally stack-allocated in the caller, returns the populated
- * pointer if the instance has a valid master client, otherwise NULL
- * is returned, and the RDB saving will not persist any replication related
- * information. */
-rdbSaveInfo *rdbPopulateSaveInfo(rdbSaveInfo *rsi) {
-    rdbSaveInfo rsi_init = RDB_SAVE_INFO_INIT;
-    *rsi = rsi_init;
-
-    /* If the instance is a master, we can populate the replication info
-     * only when repl_backlog is not NULL. If the repl_backlog is NULL,
-     * it means that the instance isn't in any replication chains. In this
-     * scenario the replication info is useless, because when a slave
-     * connects to us, the NULL repl_backlog will trigger a full
-     * synchronization, at the same time we will use a new replid and clear
-     * replid2. */
-    if (!server.masterhost && server.repl_backlog) {
-        /* Note that when server.slaveseldb is -1, it means that this master
-         * didn't apply any write commands after a full synchronization.
-         * So we can let repl_stream_db be 0, this allows a restarted slave
-         * to reload replication ID/offset, it's safe because the next write
-         * command must generate a SELECT statement. */
-        rsi->repl_stream_db = server.slaveseldb == -1 ? 0 : server.slaveseldb;
-        return rsi;
-    }
-
-    /* If the instance is a slave we need a connected master
-     * in order to fetch the currently selected DB. */
-    if (server.master) {
-        rsi->repl_stream_db = server.master->db->id;
-        return rsi;
-    }
-
-    /* If we have a cached master we can use it in order to populate the
-     * replication selected DB info inside the RDB file: the slave can
-     * increment the master_repl_offset only from data arriving from the
-     * master, so if we are disconnected the offset in the cached master
-     * is valid. */
-    if (server.cached_master) {
-        rsi->repl_stream_db = server.cached_master->db->id;
-        return rsi;
-    }
-    return NULL;
-}
diff --git a/redis-stable/src/rdb.h b/redis-stable/src/rdb.h
deleted file mode 100644
index ec34a208..00000000
--- a/redis-stable/src/rdb.h
+++ /dev/null
@@ -1,170 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __RDB_H
-#define __RDB_H
-
-#include <stdio.h>
-#include "rio.h"
-
-/* TBD: include only necessary headers. */
-#include "server.h"
-
-/* The current RDB version. When the format changes in a way that is no longer
- * backward compatible this number gets incremented. */
-#define RDB_VERSION 9
-
-/* Defines related to the dump file format. To store 32 bits lengths for short
- * keys requires a lot of space, so we check the most significant 2 bits of
- * the first byte to interpreter the length:
- *
- * 00|XXXXXX => if the two MSB are 00 the len is the 6 bits of this byte
- * 01|XXXXXX XXXXXXXX =>  01, the len is 14 bits, 6 bits + 8 bits of next byte
- * 10|000000 [32 bit integer] => A full 32 bit len in net byte order will follow
- * 10|000001 [64 bit integer] => A full 64 bit len in net byte order will follow
- * 11|OBKIND this means: specially encoded object will follow. The six bits
- *           number specify the kind of object that follows.
- *           See the RDB_ENC_* defines.
- *
- * Lengths up to 63 are stored using a single byte, most DB keys, and may
- * values, will fit inside. */
-#define RDB_6BITLEN 0
-#define RDB_14BITLEN 1
-#define RDB_32BITLEN 0x80
-#define RDB_64BITLEN 0x81
-#define RDB_ENCVAL 3
-#define RDB_LENERR UINT64_MAX
-
-/* When a length of a string object stored on disk has the first two bits
- * set, the remaining six bits specify a special encoding for the object
- * accordingly to the following defines: */
-#define RDB_ENC_INT8 0        /* 8 bit signed integer */
-#define RDB_ENC_INT16 1       /* 16 bit signed integer */
-#define RDB_ENC_INT32 2       /* 32 bit signed integer */
-#define RDB_ENC_LZF 3         /* string compressed with FASTLZ */
-
-/* Map object types to RDB object types. Macros starting with OBJ_ are for
- * memory storage and may change. Instead RDB types must be fixed because
- * we store them on disk. */
-#define RDB_TYPE_STRING 0
-#define RDB_TYPE_LIST   1
-#define RDB_TYPE_SET    2
-#define RDB_TYPE_ZSET   3
-#define RDB_TYPE_HASH   4
-#define RDB_TYPE_ZSET_2 5 /* ZSET version 2 with doubles stored in binary. */
-#define RDB_TYPE_MODULE 6
-#define RDB_TYPE_MODULE_2 7 /* Module value with annotations for parsing without
-                               the generating module being loaded. */
-/* NOTE: WHEN ADDING NEW RDB TYPE, UPDATE rdbIsObjectType() BELOW */
-
-/* Object types for encoded objects. */
-#define RDB_TYPE_HASH_ZIPMAP    9
-#define RDB_TYPE_LIST_ZIPLIST  10
-#define RDB_TYPE_SET_INTSET    11
-#define RDB_TYPE_ZSET_ZIPLIST  12
-#define RDB_TYPE_HASH_ZIPLIST  13
-#define RDB_TYPE_LIST_QUICKLIST 14
-#define RDB_TYPE_STREAM_LISTPACKS 15
-/* NOTE: WHEN ADDING NEW RDB TYPE, UPDATE rdbIsObjectType() BELOW */
-
-/* Test if a type is an object type. */
-#define rdbIsObjectType(t) ((t >= 0 && t <= 7) || (t >= 9 && t <= 15))
-
-/* Special RDB opcodes (saved/loaded with rdbSaveType/rdbLoadType). */
-#define RDB_OPCODE_MODULE_AUX 247   /* Module auxiliary data. */
-#define RDB_OPCODE_IDLE       248   /* LRU idle time. */
-#define RDB_OPCODE_FREQ       249   /* LFU frequency. */
-#define RDB_OPCODE_AUX        250   /* RDB aux field. */
-#define RDB_OPCODE_RESIZEDB   251   /* Hash table resize hint. */
-#define RDB_OPCODE_EXPIRETIME_MS 252    /* Expire time in milliseconds. */
-#define RDB_OPCODE_EXPIRETIME 253       /* Old expire time in seconds. */
-#define RDB_OPCODE_SELECTDB   254   /* DB number of the following keys. */
-#define RDB_OPCODE_EOF        255   /* End of the RDB file. */
-
-/* Module serialized values sub opcodes */
-#define RDB_MODULE_OPCODE_EOF   0   /* End of module value. */
-#define RDB_MODULE_OPCODE_SINT  1   /* Signed integer. */
-#define RDB_MODULE_OPCODE_UINT  2   /* Unsigned integer. */
-#define RDB_MODULE_OPCODE_FLOAT 3   /* Float. */
-#define RDB_MODULE_OPCODE_DOUBLE 4  /* Double. */
-#define RDB_MODULE_OPCODE_STRING 5  /* String. */
-
-/* rdbLoad...() functions flags. */
-#define RDB_LOAD_NONE   0
-#define RDB_LOAD_ENC    (1<<0)
-#define RDB_LOAD_PLAIN  (1<<1)
-#define RDB_LOAD_SDS    (1<<2)
-
-/* flags on the purpose of rdb save or load */
-#define RDBFLAGS_NONE 0                 /* No special RDB loading. */
-#define RDBFLAGS_AOF_PREAMBLE (1<<0)    /* Load/save the RDB as AOF preamble. */
-#define RDBFLAGS_REPLICATION (1<<1)     /* Load/save for SYNC. */
-#define RDBFLAGS_ALLOW_DUP (1<<2)       /* Allow duplicated keys when loading.*/
-
-/* When rdbLoadObject() returns NULL, the err flag is
- * set to hold the type of error that occurred */
-#define RDB_LOAD_ERR_EMPTY_KEY  1   /* Error of empty key */
-#define RDB_LOAD_ERR_OTHER      2   /* Any other errors */
-
-int rdbSaveType(rio *rdb, unsigned char type);
-int rdbLoadType(rio *rdb);
-int rdbSaveTime(rio *rdb, time_t t);
-time_t rdbLoadTime(rio *rdb);
-int rdbSaveLen(rio *rdb, uint64_t len);
-int rdbSaveMillisecondTime(rio *rdb, long long t);
-long long rdbLoadMillisecondTime(rio *rdb, int rdbver);
-uint64_t rdbLoadLen(rio *rdb, int *isencoded);
-int rdbLoadLenByRef(rio *rdb, int *isencoded, uint64_t *lenptr);
-int rdbSaveObjectType(rio *rdb, robj *o);
-int rdbLoadObjectType(rio *rdb);
-int rdbLoad(char *filename, rdbSaveInfo *rsi, int rdbflags);
-int rdbSaveBackground(char *filename, rdbSaveInfo *rsi);
-int rdbSaveToSlavesSockets(rdbSaveInfo *rsi);
-void rdbRemoveTempFile(pid_t childpid, int from_signal);
-int rdbSave(char *filename, rdbSaveInfo *rsi);
-ssize_t rdbSaveObject(rio *rdb, robj *o, robj *key);
-size_t rdbSavedObjectLen(robj *o, robj *key);
-robj *rdbLoadObject(int type, rio *rdb, sds key, int *error);
-void backgroundSaveDoneHandler(int exitcode, int bysignal);
-int rdbSaveKeyValuePair(rio *rdb, robj *key, robj *val, long long expiretime);
-ssize_t rdbSaveSingleModuleAux(rio *rdb, int when, moduleType *mt);
-robj *rdbLoadCheckModuleValue(rio *rdb, char *modulename);
-robj *rdbLoadStringObject(rio *rdb);
-ssize_t rdbSaveStringObject(rio *rdb, robj *obj);
-ssize_t rdbSaveRawString(rio *rdb, unsigned char *s, size_t len);
-void *rdbGenericLoadStringObject(rio *rdb, int flags, size_t *lenptr);
-int rdbSaveBinaryDoubleValue(rio *rdb, double val);
-int rdbLoadBinaryDoubleValue(rio *rdb, double *val);
-int rdbSaveBinaryFloatValue(rio *rdb, float val);
-int rdbLoadBinaryFloatValue(rio *rdb, float *val);
-int rdbLoadRio(rio *rdb, int rdbflags, rdbSaveInfo *rsi);
-int rdbSaveRio(rio *rdb, int *error, int rdbflags, rdbSaveInfo *rsi);
-rdbSaveInfo *rdbPopulateSaveInfo(rdbSaveInfo *rsi);
-
-#endif
diff --git a/redis-stable/src/redis-benchmark.c b/redis-stable/src/redis-benchmark.c
deleted file mode 100644
index 8d510d7d..00000000
--- a/redis-stable/src/redis-benchmark.c
+++ /dev/null
@@ -1,1982 +0,0 @@
-/* Redis benchmark utility.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include "version.h"
-
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <unistd.h>
-#include <errno.h>
-#include <time.h>
-#include <sys/time.h>
-#include <signal.h>
-#include <assert.h>
-#include <math.h>
-#include <pthread.h>
-
-#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
-#include <sds.h> /* Use hiredis sds. */
-#include "ae.h"
-#include <hiredis.h>
-#ifdef USE_OPENSSL
-#include <openssl/ssl.h>
-#include <openssl/err.h>
-#include <hiredis_ssl.h>
-#endif
-#include "adlist.h"
-#include "dict.h"
-#include "zmalloc.h"
-#include "atomicvar.h"
-#include "crc16_slottable.h"
-#include "hdr_histogram.h"
-#include "cli_common.h"
-#include "mt19937-64.h"
-
-#define UNUSED(V) ((void) V)
-#define RANDPTR_INITIAL_SIZE 8
-#define DEFAULT_LATENCY_PRECISION 3
-#define MAX_LATENCY_PRECISION 4
-#define MAX_THREADS 500
-#define CLUSTER_SLOTS 16384
-#define CONFIG_LATENCY_HISTOGRAM_MIN_VALUE 10L          /* >= 10 usecs */
-#define CONFIG_LATENCY_HISTOGRAM_MAX_VALUE 3000000L          /* <= 30 secs(us precision) */
-#define CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE 3000000L   /* <= 3 secs(us precision) */
-
-#define CLIENT_GET_EVENTLOOP(c) \
-    (c->thread_id >= 0 ? config.threads[c->thread_id]->el : config.el)
-
-struct benchmarkThread;
-struct clusterNode;
-struct redisConfig;
-
-static struct config {
-    aeEventLoop *el;
-    const char *hostip;
-    int hostport;
-    const char *hostsocket;
-    int tls;
-    struct cliSSLconfig sslconfig;
-    int numclients;
-    redisAtomic int liveclients;
-    int requests;
-    redisAtomic int requests_issued;
-    redisAtomic int requests_finished;
-    redisAtomic int previous_requests_finished;
-    int last_printed_bytes;
-    long long previous_tick;
-    int keysize;
-    int datasize;
-    int randomkeys;
-    int randomkeys_keyspacelen;
-    int keepalive;
-    int pipeline;
-    long long start;
-    long long totlatency;
-    const char *title;
-    list *clients;
-    int quiet;
-    int csv;
-    int loop;
-    int idlemode;
-    int dbnum;
-    sds dbnumstr;
-    char *tests;
-    char *auth;
-    const char *user;
-    int precision;
-    int num_threads;
-    struct benchmarkThread **threads;
-    int cluster_mode;
-    int cluster_node_count;
-    struct clusterNode **cluster_nodes;
-    struct redisConfig *redis_config;
-    struct hdr_histogram* latency_histogram;
-    struct hdr_histogram* current_sec_latency_histogram;
-    redisAtomic int is_fetching_slots;
-    redisAtomic int is_updating_slots;
-    redisAtomic int slots_last_update;
-    int enable_tracking;
-    pthread_mutex_t liveclients_mutex;
-    pthread_mutex_t is_updating_slots_mutex;
-} config;
-
-typedef struct _client {
-    redisContext *context;
-    sds obuf;
-    char **randptr;         /* Pointers to :rand: strings inside the command buf */
-    size_t randlen;         /* Number of pointers in client->randptr */
-    size_t randfree;        /* Number of unused pointers in client->randptr */
-    char **stagptr;         /* Pointers to slot hashtags (cluster mode only) */
-    size_t staglen;         /* Number of pointers in client->stagptr */
-    size_t stagfree;        /* Number of unused pointers in client->stagptr */
-    size_t written;         /* Bytes of 'obuf' already written */
-    long long start;        /* Start time of a request */
-    long long latency;      /* Request latency */
-    int pending;            /* Number of pending requests (replies to consume) */
-    int prefix_pending;     /* If non-zero, number of pending prefix commands. Commands
-                               such as auth and select are prefixed to the pipeline of
-                               benchmark commands and discarded after the first send. */
-    int prefixlen;          /* Size in bytes of the pending prefix commands */
-    int thread_id;
-    struct clusterNode *cluster_node;
-    int slots_last_update;
-} *client;
-
-/* Threads. */
-
-typedef struct benchmarkThread {
-    int index;
-    pthread_t thread;
-    aeEventLoop *el;
-} benchmarkThread;
-
-/* Cluster. */
-typedef struct clusterNode {
-    char *ip;
-    int port;
-    sds name;
-    int flags;
-    sds replicate;  /* Master ID if node is a slave */
-    int *slots;
-    int slots_count;
-    int current_slot_index;
-    int *updated_slots;         /* Used by updateClusterSlotsConfiguration */
-    int updated_slots_count;    /* Used by updateClusterSlotsConfiguration */
-    int replicas_count;
-    sds *migrating; /* An array of sds where even strings are slots and odd
-                     * strings are the destination node IDs. */
-    sds *importing; /* An array of sds where even strings are slots and odd
-                     * strings are the source node IDs. */
-    int migrating_count; /* Length of the migrating array (migrating slots*2) */
-    int importing_count; /* Length of the importing array (importing slots*2) */
-    struct redisConfig *redis_config;
-} clusterNode;
-
-typedef struct redisConfig {
-    sds save;
-    sds appendonly;
-} redisConfig;
-
-/* Prototypes */
-char *redisGitSHA1(void);
-char *redisGitDirty(void);
-static void writeHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-static void createMissingClients(client c);
-static benchmarkThread *createBenchmarkThread(int index);
-static void freeBenchmarkThread(benchmarkThread *thread);
-static void freeBenchmarkThreads();
-static void *execBenchmarkThread(void *ptr);
-static clusterNode *createClusterNode(char *ip, int port);
-static redisConfig *getRedisConfig(const char *ip, int port,
-                                   const char *hostsocket);
-static redisContext *getRedisContext(const char *ip, int port,
-                                     const char *hostsocket);
-static void freeRedisConfig(redisConfig *cfg);
-static int fetchClusterSlotsConfiguration(client c);
-static void updateClusterSlotsConfiguration();
-int showThroughput(struct aeEventLoop *eventLoop, long long id,
-                   void *clientData);
-
-static sds benchmarkVersion(void) {
-    sds version;
-    version = sdscatprintf(sdsempty(), "%s", REDIS_VERSION);
-
-    /* Add git commit and working tree status when available */
-    if (strtoll(redisGitSHA1(),NULL,16)) {
-        version = sdscatprintf(version, " (git:%s", redisGitSHA1());
-        if (strtoll(redisGitDirty(),NULL,10))
-            version = sdscatprintf(version, "-dirty");
-        version = sdscat(version, ")");
-    }
-    return version;
-}
-
-/* Dict callbacks */
-static uint64_t dictSdsHash(const void *key);
-static int dictSdsKeyCompare(void *privdata, const void *key1,
-    const void *key2);
-
-/* Implementation */
-static long long ustime(void) {
-    struct timeval tv;
-    long long ust;
-
-    gettimeofday(&tv, NULL);
-    ust = ((long)tv.tv_sec)*1000000;
-    ust += tv.tv_usec;
-    return ust;
-}
-
-static long long mstime(void) {
-    struct timeval tv;
-    long long mst;
-
-    gettimeofday(&tv, NULL);
-    mst = ((long long)tv.tv_sec)*1000;
-    mst += tv.tv_usec/1000;
-    return mst;
-}
-
-static uint64_t dictSdsHash(const void *key) {
-    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
-}
-
-static int dictSdsKeyCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    int l1,l2;
-    DICT_NOTUSED(privdata);
-
-    l1 = sdslen((sds)key1);
-    l2 = sdslen((sds)key2);
-    if (l1 != l2) return 0;
-    return memcmp(key1, key2, l1) == 0;
-}
-
-/* _serverAssert is needed by dict */
-void _serverAssert(const char *estr, const char *file, int line) {
-    fprintf(stderr, "=== ASSERTION FAILED ===");
-    fprintf(stderr, "==> %s:%d '%s' is not true",file,line,estr);
-    *((char*)-1) = 'x';
-}
-
-static redisContext *getRedisContext(const char *ip, int port,
-                                     const char *hostsocket)
-{
-    redisContext *ctx = NULL;
-    redisReply *reply =  NULL;
-    if (hostsocket == NULL)
-        ctx = redisConnect(ip, port);
-    else
-        ctx = redisConnectUnix(hostsocket);
-    if (ctx == NULL || ctx->err) {
-        fprintf(stderr,"Could not connect to Redis at ");
-        char *err = (ctx != NULL ? ctx->errstr : "");
-        if (hostsocket == NULL)
-            fprintf(stderr,"%s:%d: %s\n",ip,port,err);
-        else
-            fprintf(stderr,"%s: %s\n",hostsocket,err);
-        goto cleanup;
-    }
-    if (config.tls==1) {
-        const char *err = NULL;
-        if (cliSecureConnection(ctx, config.sslconfig, &err) == REDIS_ERR && err) {
-            fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
-            goto cleanup;
-        }
-    }
-    if (config.auth == NULL)
-        return ctx;
-    if (config.user == NULL)
-        reply = redisCommand(ctx,"AUTH %s", config.auth);
-    else
-        reply = redisCommand(ctx,"AUTH %s %s", config.user, config.auth);
-    if (reply != NULL) {
-        if (reply->type == REDIS_REPLY_ERROR) {
-            if (hostsocket == NULL)
-                fprintf(stderr, "Node %s:%d replied with error:\n%s\n", ip, port, reply->str);
-            else
-                fprintf(stderr, "Node %s replied with error:\n%s\n", hostsocket, reply->str);
-            freeReplyObject(reply);
-            redisFree(ctx);
-            exit(1);
-        }
-        freeReplyObject(reply);
-        return ctx;
-    }
-    fprintf(stderr, "ERROR: failed to fetch reply from ");
-    if (hostsocket == NULL)
-        fprintf(stderr, "%s:%d\n", ip, port);
-    else
-        fprintf(stderr, "%s\n", hostsocket);
-cleanup:
-    freeReplyObject(reply);
-    redisFree(ctx);
-    return NULL;
-}
-
-
-
-static redisConfig *getRedisConfig(const char *ip, int port,
-                                   const char *hostsocket)
-{
-    redisConfig *cfg = zcalloc(sizeof(*cfg));
-    if (!cfg) return NULL;
-    redisContext *c = NULL;
-    redisReply *reply = NULL, *sub_reply = NULL;
-    c = getRedisContext(ip, port, hostsocket);
-    if (c == NULL) {
-        freeRedisConfig(cfg);
-        return NULL;
-    }
-    redisAppendCommand(c, "CONFIG GET %s", "save");
-    redisAppendCommand(c, "CONFIG GET %s", "appendonly");
-    int i = 0;
-    void *r = NULL;
-    for (; i < 2; i++) {
-        int res = redisGetReply(c, &r);
-        if (reply) freeReplyObject(reply);
-        reply = res == REDIS_OK ? ((redisReply *) r) : NULL;
-        if (res != REDIS_OK || !r) goto fail;
-        if (reply->type == REDIS_REPLY_ERROR) {
-            fprintf(stderr, "ERROR: %s\n", reply->str);
-            goto fail;
-        }
-        if (reply->type != REDIS_REPLY_ARRAY || reply->elements < 2) goto fail;
-        sub_reply = reply->element[1];
-        char *value = sub_reply->str;
-        if (!value) value = "";
-        switch (i) {
-        case 0: cfg->save = sdsnew(value); break;
-        case 1: cfg->appendonly = sdsnew(value); break;
-        }
-    }
-    freeReplyObject(reply);
-    redisFree(c);
-    return cfg;
-fail:
-    fprintf(stderr, "ERROR: failed to fetch CONFIG from ");
-    if (hostsocket == NULL) fprintf(stderr, "%s:%d\n", ip, port);
-    else fprintf(stderr, "%s\n", hostsocket);
-    int abort_test = 0;
-    if (reply && reply->type == REDIS_REPLY_ERROR &&
-        (!strncmp(reply->str,"NOAUTH",5) ||
-         !strncmp(reply->str,"WRONGPASS",9) ||
-         !strncmp(reply->str,"NOPERM",5)))
-        abort_test = 1;
-    freeReplyObject(reply);
-    redisFree(c);
-    freeRedisConfig(cfg);
-    if (abort_test) exit(1);
-    return NULL;
-}
-static void freeRedisConfig(redisConfig *cfg) {
-    if (cfg->save) sdsfree(cfg->save);
-    if (cfg->appendonly) sdsfree(cfg->appendonly);
-    zfree(cfg);
-}
-
-static void freeClient(client c) {
-    aeEventLoop *el = CLIENT_GET_EVENTLOOP(c);
-    listNode *ln;
-    aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
-    aeDeleteFileEvent(el,c->context->fd,AE_READABLE);
-    if (c->thread_id >= 0) {
-        int requests_finished = 0;
-        atomicGet(config.requests_finished, requests_finished);
-        if (requests_finished >= config.requests) {
-            aeStop(el);
-        }
-    }
-    redisFree(c->context);
-    sdsfree(c->obuf);
-    zfree(c->randptr);
-    zfree(c->stagptr);
-    zfree(c);
-    if (config.num_threads) pthread_mutex_lock(&(config.liveclients_mutex));
-    config.liveclients--;
-    ln = listSearchKey(config.clients,c);
-    assert(ln != NULL);
-    listDelNode(config.clients,ln);
-    if (config.num_threads) pthread_mutex_unlock(&(config.liveclients_mutex));
-}
-
-static void freeAllClients(void) {
-    listNode *ln = config.clients->head, *next;
-
-    while(ln) {
-        next = ln->next;
-        freeClient(ln->value);
-        ln = next;
-    }
-}
-
-static void resetClient(client c) {
-    aeEventLoop *el = CLIENT_GET_EVENTLOOP(c);
-    aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
-    aeDeleteFileEvent(el,c->context->fd,AE_READABLE);
-    aeCreateFileEvent(el,c->context->fd,AE_WRITABLE,writeHandler,c);
-    c->written = 0;
-    c->pending = config.pipeline;
-}
-
-static void randomizeClientKey(client c) {
-    size_t i;
-
-    for (i = 0; i < c->randlen; i++) {
-        char *p = c->randptr[i]+11;
-        size_t r = 0;
-        if (config.randomkeys_keyspacelen != 0)
-            r = random() % config.randomkeys_keyspacelen;
-        size_t j;
-
-        for (j = 0; j < 12; j++) {
-            *p = '0'+r%10;
-            r/=10;
-            p--;
-        }
-    }
-}
-
-static void setClusterKeyHashTag(client c) {
-    assert(c->thread_id >= 0);
-    clusterNode *node = c->cluster_node;
-    assert(node);
-    assert(node->current_slot_index < node->slots_count);
-    int is_updating_slots = 0;
-    atomicGet(config.is_updating_slots, is_updating_slots);
-    /* If updateClusterSlotsConfiguration is updating the slots array,
-     * call updateClusterSlotsConfiguration is order to block the thread
-     * since the mutex is locked. When the slots will be updated by the
-     * thread that's actually performing the update, the execution of
-     * updateClusterSlotsConfiguration won't actually do anything, since
-     * the updated_slots_count array will be already NULL. */
-    if (is_updating_slots) updateClusterSlotsConfiguration();
-    int slot = node->slots[node->current_slot_index];
-    const char *tag = crc16_slot_table[slot];
-    int taglen = strlen(tag);
-    size_t i;
-    for (i = 0; i < c->staglen; i++) {
-        char *p = c->stagptr[i] + 1;
-        p[0] = tag[0];
-        p[1] = (taglen >= 2 ? tag[1] : '}');
-        p[2] = (taglen == 3 ? tag[2] : '}');
-    }
-}
-
-static void clientDone(client c) {
-    int requests_finished = 0;
-    atomicGet(config.requests_finished, requests_finished);
-    if (requests_finished >= config.requests) {
-        freeClient(c);
-        if (!config.num_threads && config.el) aeStop(config.el);
-        return;
-    }
-    if (config.keepalive) {
-        resetClient(c);
-    } else {
-        if (config.num_threads) pthread_mutex_lock(&(config.liveclients_mutex));
-        config.liveclients--;
-        createMissingClients(c);
-        config.liveclients++;
-        if (config.num_threads)
-            pthread_mutex_unlock(&(config.liveclients_mutex));
-        freeClient(c);
-    }
-}
-
-static void readHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    client c = privdata;
-    void *reply = NULL;
-    UNUSED(el);
-    UNUSED(fd);
-    UNUSED(mask);
-
-    /* Calculate latency only for the first read event. This means that the
-     * server already sent the reply and we need to parse it. Parsing overhead
-     * is not part of the latency, so calculate it only once, here. */
-    if (c->latency < 0) c->latency = ustime()-(c->start);
-
-    if (redisBufferRead(c->context) != REDIS_OK) {
-        fprintf(stderr,"Error: %s\n",c->context->errstr);
-        exit(1);
-    } else {
-        while(c->pending) {
-            if (redisGetReply(c->context,&reply) != REDIS_OK) {
-                fprintf(stderr,"Error: %s\n",c->context->errstr);
-                exit(1);
-            }
-            if (reply != NULL) {
-                if (reply == (void*)REDIS_REPLY_ERROR) {
-                    fprintf(stderr,"Unexpected error reply, exiting...\n");
-                    exit(1);
-                }
-                redisReply *r = reply;
-                if (r->type == REDIS_REPLY_ERROR) {
-                    /* Try to update slots configuration if reply error is
-                    * MOVED/ASK/CLUSTERDOWN and the key(s) used by the command
-                    * contain(s) the slot hash tag.
-                    * If the error is not topology-update related then we
-                    * immediately exit to avoid false results. */
-                    if (c->cluster_node && c->staglen) {
-                        int fetch_slots = 0, do_wait = 0;
-                        if (!strncmp(r->str,"MOVED",5) || !strncmp(r->str,"ASK",3))
-                            fetch_slots = 1;
-                        else if (!strncmp(r->str,"CLUSTERDOWN",11)) {
-                            /* Usually the cluster is able to recover itself after
-                            * a CLUSTERDOWN error, so try to sleep one second
-                            * before requesting the new configuration. */
-                            fetch_slots = 1;
-                            do_wait = 1;
-                            printf("Error from server %s:%d: %s.\n",
-                                   c->cluster_node->ip,
-                                   c->cluster_node->port,
-                                   r->str);
-                        }
-                        if (do_wait) sleep(1);
-                        if (fetch_slots && !fetchClusterSlotsConfiguration(c))
-                            exit(1);
-                    } else {
-                        if (c->cluster_node) {
-                            printf("Error from server %s:%d: %s\n",
-                                c->cluster_node->ip,
-                                c->cluster_node->port,
-                                r->str);
-                        } else printf("Error from server: %s\n", r->str);
-                        exit(1);
-                    }
-                }
-
-                freeReplyObject(reply);
-                /* This is an OK for prefix commands such as auth and select.*/
-                if (c->prefix_pending > 0) {
-                    c->prefix_pending--;
-                    c->pending--;
-                    /* Discard prefix commands on first response.*/
-                    if (c->prefixlen > 0) {
-                        size_t j;
-                        sdsrange(c->obuf, c->prefixlen, -1);
-                        /* We also need to fix the pointers to the strings
-                        * we need to randomize. */
-                        for (j = 0; j < c->randlen; j++)
-                            c->randptr[j] -= c->prefixlen;
-                        /* Fix the pointers to the slot hash tags */
-                        for (j = 0; j < c->staglen; j++)
-                            c->stagptr[j] -= c->prefixlen;
-                        c->prefixlen = 0;
-                    }
-                    continue;
-                }
-                int requests_finished = 0;
-                atomicGetIncr(config.requests_finished, requests_finished, 1);
-                if (requests_finished < config.requests){
-                        if (config.num_threads == 0) {
-                            hdr_record_value(
-                            config.latency_histogram,  // Histogram to record to
-                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_MAX_VALUE);  // Value to record
-                            hdr_record_value(
-                            config.current_sec_latency_histogram,  // Histogram to record to
-                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE);  // Value to record
-                        } else {
-                            hdr_record_value_atomic(
-                            config.latency_histogram,  // Histogram to record to
-                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_MAX_VALUE);  // Value to record
-                            hdr_record_value_atomic(
-                            config.current_sec_latency_histogram,  // Histogram to record to
-                            (long)c->latency<=CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE ? (long)c->latency : CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE);  // Value to record
-                        }
-                }
-                c->pending--;
-                if (c->pending == 0) {
-                    clientDone(c);
-                    break;
-                }
-            } else {
-                break;
-            }
-        }
-    }
-}
-
-static void writeHandler(aeEventLoop *el, int fd, void *privdata, int mask) {
-    client c = privdata;
-    UNUSED(el);
-    UNUSED(fd);
-    UNUSED(mask);
-
-    /* Initialize request when nothing was written. */
-    if (c->written == 0) {
-        /* Enforce upper bound to number of requests. */
-        int requests_issued = 0;
-        atomicGetIncr(config.requests_issued, requests_issued, config.pipeline);
-        if (requests_issued >= config.requests) {
-            return;
-        }
-
-        /* Really initialize: randomize keys and set start time. */
-        if (config.randomkeys) randomizeClientKey(c);
-        if (config.cluster_mode && c->staglen > 0) setClusterKeyHashTag(c);
-        atomicGet(config.slots_last_update, c->slots_last_update);
-        c->start = ustime();
-        c->latency = -1;
-    }
-    const ssize_t buflen = sdslen(c->obuf);
-    const ssize_t writeLen = buflen-c->written;
-    if (writeLen > 0) {
-        void *ptr = c->obuf+c->written;
-        while(1) {
-            /* Optimistically try to write before checking if the file descriptor
-             * is actually writable. At worst we get EAGAIN. */
-            const ssize_t nwritten = cliWriteConn(c->context,ptr,writeLen);
-            if (nwritten != writeLen) {
-                if (nwritten == -1 && errno != EAGAIN) {
-                    if (errno != EPIPE)
-                        fprintf(stderr, "Error writing to the server: %s\n", strerror(errno));
-                    freeClient(c);
-                    return;
-                }
-            } else {
-                aeDeleteFileEvent(el,c->context->fd,AE_WRITABLE);
-                aeCreateFileEvent(el,c->context->fd,AE_READABLE,readHandler,c);
-                return;
-            }
-        }
-    }
-}
-
-/* Create a benchmark client, configured to send the command passed as 'cmd' of
- * 'len' bytes.
- *
- * The command is copied N times in the client output buffer (that is reused
- * again and again to send the request to the server) accordingly to the configured
- * pipeline size.
- *
- * Also an initial SELECT command is prepended in order to make sure the right
- * database is selected, if needed. The initial SELECT will be discarded as soon
- * as the first reply is received.
- *
- * To create a client from scratch, the 'from' pointer is set to NULL. If instead
- * we want to create a client using another client as reference, the 'from' pointer
- * points to the client to use as reference. In such a case the following
- * information is take from the 'from' client:
- *
- * 1) The command line to use.
- * 2) The offsets of the __rand_int__ elements inside the command line, used
- *    for arguments randomization.
- *
- * Even when cloning another client, prefix commands are applied if needed.*/
-static client createClient(char *cmd, size_t len, client from, int thread_id) {
-    int j;
-    int is_cluster_client = (config.cluster_mode && thread_id >= 0);
-    client c = zmalloc(sizeof(struct _client));
-
-    const char *ip = NULL;
-    int port = 0;
-    c->cluster_node = NULL;
-    if (config.hostsocket == NULL || is_cluster_client) {
-        if (!is_cluster_client) {
-            ip = config.hostip;
-            port = config.hostport;
-        } else {
-            int node_idx = 0;
-            if (config.num_threads < config.cluster_node_count)
-                node_idx = config.liveclients % config.cluster_node_count;
-            else
-                node_idx = thread_id % config.cluster_node_count;
-            clusterNode *node = config.cluster_nodes[node_idx];
-            assert(node != NULL);
-            ip = (const char *) node->ip;
-            port = node->port;
-            c->cluster_node = node;
-        }
-        c->context = redisConnectNonBlock(ip,port);
-    } else {
-        c->context = redisConnectUnixNonBlock(config.hostsocket);
-    }
-    if (c->context->err) {
-        fprintf(stderr,"Could not connect to Redis at ");
-        if (config.hostsocket == NULL || is_cluster_client)
-            fprintf(stderr,"%s:%d: %s\n",ip,port,c->context->errstr);
-        else
-            fprintf(stderr,"%s: %s\n",config.hostsocket,c->context->errstr);
-        exit(1);
-    }
-    if (config.tls==1) {
-        const char *err = NULL;
-        if (cliSecureConnection(c->context, config.sslconfig, &err) == REDIS_ERR && err) {
-            fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
-            exit(1);
-        }
-    }
-    c->thread_id = thread_id;
-    /* Suppress hiredis cleanup of unused buffers for max speed. */
-    c->context->reader->maxbuf = 0;
-
-    /* Build the request buffer:
-     * Queue N requests accordingly to the pipeline size, or simply clone
-     * the example client buffer. */
-    c->obuf = sdsempty();
-    /* Prefix the request buffer with AUTH and/or SELECT commands, if applicable.
-     * These commands are discarded after the first response, so if the client is
-     * reused the commands will not be used again. */
-    c->prefix_pending = 0;
-    if (config.auth) {
-        char *buf = NULL;
-        int len;
-        if (config.user == NULL)
-            len = redisFormatCommand(&buf, "AUTH %s", config.auth);
-        else
-            len = redisFormatCommand(&buf, "AUTH %s %s",
-                                     config.user, config.auth);
-        c->obuf = sdscatlen(c->obuf, buf, len);
-        free(buf);
-        c->prefix_pending++;
-    }
-
-    if (config.enable_tracking) {
-        char *buf = NULL;
-        int len = redisFormatCommand(&buf, "CLIENT TRACKING on");
-        c->obuf = sdscatlen(c->obuf, buf, len);
-        free(buf);
-        c->prefix_pending++;
-    }
-
-    /* If a DB number different than zero is selected, prefix our request
-     * buffer with the SELECT command, that will be discarded the first
-     * time the replies are received, so if the client is reused the
-     * SELECT command will not be used again. */
-    if (config.dbnum != 0 && !is_cluster_client) {
-        c->obuf = sdscatprintf(c->obuf,"*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
-            (int)sdslen(config.dbnumstr),config.dbnumstr);
-        c->prefix_pending++;
-    }
-    c->prefixlen = sdslen(c->obuf);
-    /* Append the request itself. */
-    if (from) {
-        c->obuf = sdscatlen(c->obuf,
-            from->obuf+from->prefixlen,
-            sdslen(from->obuf)-from->prefixlen);
-    } else {
-        for (j = 0; j < config.pipeline; j++)
-            c->obuf = sdscatlen(c->obuf,cmd,len);
-    }
-
-    c->written = 0;
-    c->pending = config.pipeline+c->prefix_pending;
-    c->randptr = NULL;
-    c->randlen = 0;
-    c->stagptr = NULL;
-    c->staglen = 0;
-
-    /* Find substrings in the output buffer that need to be randomized. */
-    if (config.randomkeys) {
-        if (from) {
-            c->randlen = from->randlen;
-            c->randfree = 0;
-            c->randptr = zmalloc(sizeof(char*)*c->randlen);
-            /* copy the offsets. */
-            for (j = 0; j < (int)c->randlen; j++) {
-                c->randptr[j] = c->obuf + (from->randptr[j]-from->obuf);
-                /* Adjust for the different select prefix length. */
-                c->randptr[j] += c->prefixlen - from->prefixlen;
-            }
-        } else {
-            char *p = c->obuf;
-
-            c->randlen = 0;
-            c->randfree = RANDPTR_INITIAL_SIZE;
-            c->randptr = zmalloc(sizeof(char*)*c->randfree);
-            while ((p = strstr(p,"__rand_int__")) != NULL) {
-                if (c->randfree == 0) {
-                    c->randptr = zrealloc(c->randptr,sizeof(char*)*c->randlen*2);
-                    c->randfree += c->randlen;
-                }
-                c->randptr[c->randlen++] = p;
-                c->randfree--;
-                p += 12; /* 12 is strlen("__rand_int__). */
-            }
-        }
-    }
-    /* If cluster mode is enabled, set slot hashtags pointers. */
-    if (config.cluster_mode) {
-        if (from) {
-            c->staglen = from->staglen;
-            c->stagfree = 0;
-            c->stagptr = zmalloc(sizeof(char*)*c->staglen);
-            /* copy the offsets. */
-            for (j = 0; j < (int)c->staglen; j++) {
-                c->stagptr[j] = c->obuf + (from->stagptr[j]-from->obuf);
-                /* Adjust for the different select prefix length. */
-                c->stagptr[j] += c->prefixlen - from->prefixlen;
-            }
-        } else {
-            char *p = c->obuf;
-
-            c->staglen = 0;
-            c->stagfree = RANDPTR_INITIAL_SIZE;
-            c->stagptr = zmalloc(sizeof(char*)*c->stagfree);
-            while ((p = strstr(p,"{tag}")) != NULL) {
-                if (c->stagfree == 0) {
-                    c->stagptr = zrealloc(c->stagptr,
-                                          sizeof(char*) * c->staglen*2);
-                    c->stagfree += c->staglen;
-                }
-                c->stagptr[c->staglen++] = p;
-                c->stagfree--;
-                p += 5; /* 5 is strlen("{tag}"). */
-            }
-        }
-    }
-    aeEventLoop *el = NULL;
-    if (thread_id < 0) el = config.el;
-    else {
-        benchmarkThread *thread = config.threads[thread_id];
-        el = thread->el;
-    }
-    if (config.idlemode == 0)
-        aeCreateFileEvent(el,c->context->fd,AE_WRITABLE,writeHandler,c);
-    listAddNodeTail(config.clients,c);
-    atomicIncr(config.liveclients, 1);
-    atomicGet(config.slots_last_update, c->slots_last_update);
-    return c;
-}
-
-static void createMissingClients(client c) {
-    int n = 0;
-    while(config.liveclients < config.numclients) {
-        int thread_id = -1;
-        if (config.num_threads)
-            thread_id = config.liveclients % config.num_threads;
-        createClient(NULL,0,c,thread_id);
-
-        /* Listen backlog is quite limited on most systems */
-        if (++n > 64) {
-            usleep(50000);
-            n = 0;
-        }
-    }
-}
-
-static void showLatencyReport(void) {
-
-    const float reqpersec = (float)config.requests_finished/((float)config.totlatency/1000.0f);
-    const float p0 = ((float) hdr_min(config.latency_histogram))/1000.0f;
-    const float p50 = hdr_value_at_percentile(config.latency_histogram, 50.0 )/1000.0f;
-    const float p95 = hdr_value_at_percentile(config.latency_histogram, 95.0 )/1000.0f;
-    const float p99 = hdr_value_at_percentile(config.latency_histogram, 99.0 )/1000.0f;
-    const float p100 = ((float) hdr_max(config.latency_histogram))/1000.0f;
-    const float avg = hdr_mean(config.latency_histogram)/1000.0f;
-
-    if (!config.quiet && !config.csv) {
-        printf("%*s\r", config.last_printed_bytes, " "); // ensure there is a clean line
-        printf("====== %s ======\n", config.title);
-        printf("  %d requests completed in %.2f seconds\n", config.requests_finished,
-            (float)config.totlatency/1000);
-        printf("  %d parallel clients\n", config.numclients);
-        printf("  %d bytes payload\n", config.datasize);
-        printf("  keep alive: %d\n", config.keepalive);
-        if (config.cluster_mode) {
-            printf("  cluster mode: yes (%d masters)\n",
-                   config.cluster_node_count);
-            int m ;
-            for (m = 0; m < config.cluster_node_count; m++) {
-                clusterNode *node =  config.cluster_nodes[m];
-                redisConfig *cfg = node->redis_config;
-                if (cfg == NULL) continue;
-                printf("  node [%d] configuration:\n",m );
-                printf("    save: %s\n",
-                    sdslen(cfg->save) ? cfg->save : "NONE");
-                printf("    appendonly: %s\n", cfg->appendonly);
-            }
-        } else {
-            if (config.redis_config) {
-                printf("  host configuration \"save\": %s\n",
-                       config.redis_config->save);
-                printf("  host configuration \"appendonly\": %s\n",
-                       config.redis_config->appendonly);
-            }
-        }
-        printf("  multi-thread: %s\n", (config.num_threads ? "yes" : "no"));
-        if (config.num_threads)
-            printf("  threads: %d\n", config.num_threads);
-
-        printf("\n");
-        printf("Latency by percentile distribution:\n");
-        struct hdr_iter iter;
-        long long previous_cumulative_count = -1;
-        const long long total_count = config.latency_histogram->total_count;
-        hdr_iter_percentile_init(&iter, config.latency_histogram, 1);
-        struct hdr_iter_percentiles *percentiles = &iter.specifics.percentiles;
-        while (hdr_iter_next(&iter))
-        {
-            const double value = iter.highest_equivalent_value / 1000.0f;
-            const double percentile = percentiles->percentile;
-            const long long cumulative_count = iter.cumulative_count;
-            if( previous_cumulative_count != cumulative_count || cumulative_count == total_count ){
-                printf("%3.3f%% <= %.3f milliseconds (cumulative count %lld)\n", percentile, value, cumulative_count);
-            }
-            previous_cumulative_count = cumulative_count;
-        }
-        printf("\n");
-        printf("Cumulative distribution of latencies:\n");
-        previous_cumulative_count = -1;
-        hdr_iter_linear_init(&iter, config.latency_histogram, 100);
-        while (hdr_iter_next(&iter))
-        {
-            const double value = iter.highest_equivalent_value / 1000.0f;
-            const long long cumulative_count = iter.cumulative_count;
-            const double percentile = ((double)cumulative_count/(double)total_count)*100.0;
-            if( previous_cumulative_count != cumulative_count || cumulative_count == total_count ){
-                printf("%3.3f%% <= %.3f milliseconds (cumulative count %lld)\n", percentile, value, cumulative_count);
-            }
-            /* After the 2 milliseconds latency to have percentages split
-             * by decimals will just add a lot of noise to the output. */
-            if(iter.highest_equivalent_value > 2000){
-                hdr_iter_linear_set_value_units_per_bucket(&iter,1000);
-            }
-            previous_cumulative_count = cumulative_count;
-        }
-        printf("\n");
-        printf("Summary:\n");
-        printf("  throughput summary: %.2f requests per second\n", reqpersec);
-        printf("  latency summary (msec):\n");
-        printf("    %9s %9s %9s %9s %9s %9s\n", "avg", "min", "p50", "p95", "p99", "max");
-        printf("    %9.3f %9.3f %9.3f %9.3f %9.3f %9.3f\n", avg, p0, p50, p95, p99, p100);
-    } else if (config.csv) {
-        printf("\"%s\",\"%.2f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\",\"%.3f\"\n", config.title, reqpersec, avg, p0, p50, p95, p99, p100);
-    } else {
-        printf("%*s\r", config.last_printed_bytes, " "); // ensure there is a clean line
-        printf("%s: %.2f requests per second, p50=%.3f msec\n", config.title, reqpersec, p50);
-    }
-}
-
-static void initBenchmarkThreads() {
-    int i;
-    if (config.threads) freeBenchmarkThreads();
-    config.threads = zmalloc(config.num_threads * sizeof(benchmarkThread*));
-    for (i = 0; i < config.num_threads; i++) {
-        benchmarkThread *thread = createBenchmarkThread(i);
-        config.threads[i] = thread;
-    }
-}
-
-static void startBenchmarkThreads() {
-    int i;
-    for (i = 0; i < config.num_threads; i++) {
-        benchmarkThread *t = config.threads[i];
-        if (pthread_create(&(t->thread), NULL, execBenchmarkThread, t)){
-            fprintf(stderr, "FATAL: Failed to start thread %d.\n", i);
-            exit(1);
-        }
-    }
-    for (i = 0; i < config.num_threads; i++)
-        pthread_join(config.threads[i]->thread, NULL);
-}
-
-static void benchmark(char *title, char *cmd, int len) {
-    client c;
-
-    config.title = title;
-    config.requests_issued = 0;
-    config.requests_finished = 0;
-    config.previous_requests_finished = 0;
-    config.last_printed_bytes = 0;
-    hdr_init(
-        CONFIG_LATENCY_HISTOGRAM_MIN_VALUE,  // Minimum value
-        CONFIG_LATENCY_HISTOGRAM_MAX_VALUE,  // Maximum value
-        config.precision,  // Number of significant figures
-        &config.latency_histogram);  // Pointer to initialise
-    hdr_init(
-        CONFIG_LATENCY_HISTOGRAM_MIN_VALUE,  // Minimum value
-        CONFIG_LATENCY_HISTOGRAM_INSTANT_MAX_VALUE,  // Maximum value
-        config.precision,  // Number of significant figures
-        &config.current_sec_latency_histogram);  // Pointer to initialise
-
-    if (config.num_threads) initBenchmarkThreads();
-
-    int thread_id = config.num_threads > 0 ? 0 : -1;
-    c = createClient(cmd,len,NULL,thread_id);
-    createMissingClients(c);
-
-    config.start = mstime();
-    if (!config.num_threads) aeMain(config.el);
-    else startBenchmarkThreads();
-    config.totlatency = mstime()-config.start;
-
-    showLatencyReport();
-    freeAllClients();
-    if (config.threads) freeBenchmarkThreads();
-    if (config.current_sec_latency_histogram) hdr_close(config.current_sec_latency_histogram);
-    if (config.latency_histogram) hdr_close(config.latency_histogram);
-
-}
-
-/* Thread functions. */
-
-static benchmarkThread *createBenchmarkThread(int index) {
-    benchmarkThread *thread = zmalloc(sizeof(*thread));
-    if (thread == NULL) return NULL;
-    thread->index = index;
-    thread->el = aeCreateEventLoop(1024*10);
-    aeCreateTimeEvent(thread->el,1,showThroughput,NULL,NULL);
-    return thread;
-}
-
-static void freeBenchmarkThread(benchmarkThread *thread) {
-    if (thread->el) aeDeleteEventLoop(thread->el);
-    zfree(thread);
-}
-
-static void freeBenchmarkThreads() {
-    int i = 0;
-    for (; i < config.num_threads; i++) {
-        benchmarkThread *thread = config.threads[i];
-        if (thread) freeBenchmarkThread(thread);
-    }
-    zfree(config.threads);
-    config.threads = NULL;
-}
-
-static void *execBenchmarkThread(void *ptr) {
-    benchmarkThread *thread = (benchmarkThread *) ptr;
-    aeMain(thread->el);
-    return NULL;
-}
-
-/* Cluster helper functions. */
-
-static clusterNode *createClusterNode(char *ip, int port) {
-    clusterNode *node = zmalloc(sizeof(*node));
-    if (!node) return NULL;
-    node->ip = ip;
-    node->port = port;
-    node->name = NULL;
-    node->flags = 0;
-    node->replicate = NULL;
-    node->replicas_count = 0;
-    node->slots = zmalloc(CLUSTER_SLOTS * sizeof(int));
-    node->slots_count = 0;
-    node->current_slot_index = 0;
-    node->updated_slots = NULL;
-    node->updated_slots_count = 0;
-    node->migrating = NULL;
-    node->importing = NULL;
-    node->migrating_count = 0;
-    node->importing_count = 0;
-    node->redis_config = NULL;
-    return node;
-}
-
-static void freeClusterNode(clusterNode *node) {
-    int i;
-    if (node->name) sdsfree(node->name);
-    if (node->replicate) sdsfree(node->replicate);
-    if (node->migrating != NULL) {
-        for (i = 0; i < node->migrating_count; i++) sdsfree(node->migrating[i]);
-        zfree(node->migrating);
-    }
-    if (node->importing != NULL) {
-        for (i = 0; i < node->importing_count; i++) sdsfree(node->importing[i]);
-        zfree(node->importing);
-    }
-    /* If the node is not the reference node, that uses the address from
-     * config.hostip and config.hostport, then the node ip has been
-     * allocated by fetchClusterConfiguration, so it must be freed. */
-    if (node->ip && strcmp(node->ip, config.hostip) != 0) sdsfree(node->ip);
-    if (node->redis_config != NULL) freeRedisConfig(node->redis_config);
-    zfree(node->slots);
-    zfree(node);
-}
-
-static void freeClusterNodes() {
-    int i = 0;
-    for (; i < config.cluster_node_count; i++) {
-        clusterNode *n = config.cluster_nodes[i];
-        if (n) freeClusterNode(n);
-    }
-    zfree(config.cluster_nodes);
-    config.cluster_nodes = NULL;
-}
-
-static clusterNode **addClusterNode(clusterNode *node) {
-    int count = config.cluster_node_count + 1;
-    config.cluster_nodes = zrealloc(config.cluster_nodes,
-                                    count * sizeof(*node));
-    if (!config.cluster_nodes) return NULL;
-    config.cluster_nodes[config.cluster_node_count++] = node;
-    return config.cluster_nodes;
-}
-
-static int fetchClusterConfiguration() {
-    int success = 1;
-    redisContext *ctx = NULL;
-    redisReply *reply =  NULL;
-    ctx = getRedisContext(config.hostip, config.hostport, config.hostsocket);
-    if (ctx == NULL) {
-        exit(1);
-    }
-    clusterNode *firstNode = createClusterNode((char *) config.hostip,
-                                               config.hostport);
-    if (!firstNode) {success = 0; goto cleanup;}
-    reply = redisCommand(ctx, "CLUSTER NODES");
-    success = (reply != NULL);
-    if (!success) goto cleanup;
-    success = (reply->type != REDIS_REPLY_ERROR);
-    if (!success) {
-        if (config.hostsocket == NULL) {
-            fprintf(stderr, "Cluster node %s:%d replied with error:\n%s\n",
-                    config.hostip, config.hostport, reply->str);
-        } else {
-            fprintf(stderr, "Cluster node %s replied with error:\n%s\n",
-                    config.hostsocket, reply->str);
-        }
-        goto cleanup;
-    }
-    char *lines = reply->str, *p, *line;
-    while ((p = strstr(lines, "\n")) != NULL) {
-        *p = '\0';
-        line = lines;
-        lines = p + 1;
-        char *name = NULL, *addr = NULL, *flags = NULL, *master_id = NULL;
-        int i = 0;
-        while ((p = strchr(line, ' ')) != NULL) {
-            *p = '\0';
-            char *token = line;
-            line = p + 1;
-            switch(i++){
-            case 0: name = token; break;
-            case 1: addr = token; break;
-            case 2: flags = token; break;
-            case 3: master_id = token; break;
-            }
-            if (i == 8) break; // Slots
-        }
-        if (!flags) {
-            fprintf(stderr, "Invalid CLUSTER NODES reply: missing flags.\n");
-            success = 0;
-            goto cleanup;
-        }
-        int myself = (strstr(flags, "myself") != NULL);
-        int is_replica = (strstr(flags, "slave") != NULL ||
-                         (master_id != NULL && master_id[0] != '-'));
-        if (is_replica) continue;
-        if (addr == NULL) {
-            fprintf(stderr, "Invalid CLUSTER NODES reply: missing addr.\n");
-            success = 0;
-            goto cleanup;
-        }
-        clusterNode *node = NULL;
-        char *ip = NULL;
-        int port = 0;
-        char *paddr = strchr(addr, ':');
-        if (paddr != NULL) {
-            *paddr = '\0';
-            ip = addr;
-            addr = paddr + 1;
-            /* If internal bus is specified, then just drop it. */
-            if ((paddr = strchr(addr, '@')) != NULL) *paddr = '\0';
-            port = atoi(addr);
-        }
-        if (myself) {
-            node = firstNode;
-            if (ip != NULL && strcmp(node->ip, ip) != 0) {
-                node->ip = sdsnew(ip);
-                node->port = port;
-            }
-        } else {
-            node = createClusterNode(sdsnew(ip), port);
-        }
-        if (node == NULL) {
-            success = 0;
-            goto cleanup;
-        }
-        if (name != NULL) node->name = sdsnew(name);
-        if (i == 8) {
-            int remaining = strlen(line);
-            while (remaining > 0) {
-                p = strchr(line, ' ');
-                if (p == NULL) p = line + remaining;
-                remaining -= (p - line);
-
-                char *slotsdef = line;
-                *p = '\0';
-                if (remaining) {
-                    line = p + 1;
-                    remaining--;
-                } else line = p;
-                char *dash = NULL;
-                if (slotsdef[0] == '[') {
-                    slotsdef++;
-                    if ((p = strstr(slotsdef, "->-"))) { // Migrating
-                        *p = '\0';
-                        p += 3;
-                        char *closing_bracket = strchr(p, ']');
-                        if (closing_bracket) *closing_bracket = '\0';
-                        sds slot = sdsnew(slotsdef);
-                        sds dst = sdsnew(p);
-                        node->migrating_count += 2;
-                        node->migrating =
-                            zrealloc(node->migrating,
-                                (node->migrating_count * sizeof(sds)));
-                        node->migrating[node->migrating_count - 2] =
-                            slot;
-                        node->migrating[node->migrating_count - 1] =
-                            dst;
-                    }  else if ((p = strstr(slotsdef, "-<-"))) {//Importing
-                        *p = '\0';
-                        p += 3;
-                        char *closing_bracket = strchr(p, ']');
-                        if (closing_bracket) *closing_bracket = '\0';
-                        sds slot = sdsnew(slotsdef);
-                        sds src = sdsnew(p);
-                        node->importing_count += 2;
-                        node->importing = zrealloc(node->importing,
-                            (node->importing_count * sizeof(sds)));
-                        node->importing[node->importing_count - 2] =
-                            slot;
-                        node->importing[node->importing_count - 1] =
-                            src;
-                    }
-                } else if ((dash = strchr(slotsdef, '-')) != NULL) {
-                    p = dash;
-                    int start, stop;
-                    *p = '\0';
-                    start = atoi(slotsdef);
-                    stop = atoi(p + 1);
-                    while (start <= stop) {
-                        int slot = start++;
-                        node->slots[node->slots_count++] = slot;
-                    }
-                } else if (p > slotsdef) {
-                    int slot = atoi(slotsdef);
-                    node->slots[node->slots_count++] = slot;
-                }
-            }
-        }
-        if (node->slots_count == 0) {
-            printf("WARNING: master node %s:%d has no slots, skipping...\n",
-                   node->ip, node->port);
-            continue;
-        }
-        if (!addClusterNode(node)) {
-            success = 0;
-            goto cleanup;
-        }
-    }
-cleanup:
-    if (ctx) redisFree(ctx);
-    if (!success) {
-        if (config.cluster_nodes) freeClusterNodes();
-    }
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-/* Request the current cluster slots configuration by calling CLUSTER SLOTS
- * and atomically update the slots after a successful reply. */
-static int fetchClusterSlotsConfiguration(client c) {
-    UNUSED(c);
-    int success = 1, is_fetching_slots = 0, last_update = 0;
-    size_t i;
-    atomicGet(config.slots_last_update, last_update);
-    if (c->slots_last_update < last_update) {
-        c->slots_last_update = last_update;
-        return -1;
-    }
-    redisReply *reply = NULL;
-    atomicGetIncr(config.is_fetching_slots, is_fetching_slots, 1);
-    if (is_fetching_slots) return -1; //TODO: use other codes || errno ?
-    atomicSet(config.is_fetching_slots, 1);
-    printf("WARNING: Cluster slots configuration changed, fetching new one...\n");
-    const char *errmsg = "Failed to update cluster slots configuration";
-    static dictType dtype = {
-        dictSdsHash,               /* hash function */
-        NULL,                      /* key dup */
-        NULL,                      /* val dup */
-        dictSdsKeyCompare,         /* key compare */
-        NULL,                      /* key destructor */
-        NULL,                      /* val destructor */
-        NULL                       /* allow to expand */
-    };
-    /* printf("[%d] fetchClusterSlotsConfiguration\n", c->thread_id); */
-    dict *masters = dictCreate(&dtype, NULL);
-    redisContext *ctx = NULL;
-    for (i = 0; i < (size_t) config.cluster_node_count; i++) {
-        clusterNode *node = config.cluster_nodes[i];
-        assert(node->ip != NULL);
-        assert(node->name != NULL);
-        assert(node->port);
-        /* Use first node as entry point to connect to. */
-        if (ctx == NULL) {
-            ctx = getRedisContext(node->ip, node->port, NULL);
-            if (!ctx) {
-                success = 0;
-                goto cleanup;
-            }
-        }
-        if (node->updated_slots != NULL)
-            zfree(node->updated_slots);
-        node->updated_slots = NULL;
-        node->updated_slots_count = 0;
-        dictReplace(masters, node->name, node) ;
-    }
-    reply = redisCommand(ctx, "CLUSTER SLOTS");
-    if (reply == NULL || reply->type == REDIS_REPLY_ERROR) {
-        success = 0;
-        if (reply)
-            fprintf(stderr,"%s\nCLUSTER SLOTS ERROR: %s\n",errmsg,reply->str);
-        goto cleanup;
-    }
-    assert(reply->type == REDIS_REPLY_ARRAY);
-    for (i = 0; i < reply->elements; i++) {
-        redisReply *r = reply->element[i];
-        assert(r->type == REDIS_REPLY_ARRAY);
-        assert(r->elements >= 3);
-        int from, to, slot;
-        from = r->element[0]->integer;
-        to = r->element[1]->integer;
-        redisReply *nr =  r->element[2];
-        assert(nr->type == REDIS_REPLY_ARRAY && nr->elements >= 3);
-        assert(nr->element[2]->str != NULL);
-        sds name =  sdsnew(nr->element[2]->str);
-        dictEntry *entry = dictFind(masters, name);
-        if (entry == NULL) {
-            success = 0;
-            fprintf(stderr, "%s: could not find node with ID %s in current "
-                            "configuration.\n", errmsg, name);
-            if (name) sdsfree(name);
-            goto cleanup;
-        }
-        sdsfree(name);
-        clusterNode *node = dictGetVal(entry);
-        if (node->updated_slots == NULL)
-            node->updated_slots = zcalloc(CLUSTER_SLOTS * sizeof(int));
-        for (slot = from; slot <= to; slot++)
-            node->updated_slots[node->updated_slots_count++] = slot;
-    }
-    updateClusterSlotsConfiguration();
-cleanup:
-    freeReplyObject(reply);
-    redisFree(ctx);
-    dictRelease(masters);
-    atomicSet(config.is_fetching_slots, 0);
-    return success;
-}
-
-/* Atomically update the new slots configuration. */
-static void updateClusterSlotsConfiguration() {
-    pthread_mutex_lock(&config.is_updating_slots_mutex);
-    atomicSet(config.is_updating_slots, 1);
-    int i;
-    for (i = 0; i < config.cluster_node_count; i++) {
-        clusterNode *node = config.cluster_nodes[i];
-        if (node->updated_slots != NULL) {
-            int *oldslots = node->slots;
-            node->slots = node->updated_slots;
-            node->slots_count = node->updated_slots_count;
-            node->current_slot_index = 0;
-            node->updated_slots = NULL;
-            node->updated_slots_count = 0;
-            zfree(oldslots);
-        }
-    }
-    atomicSet(config.is_updating_slots, 0);
-    atomicIncr(config.slots_last_update, 1);
-    pthread_mutex_unlock(&config.is_updating_slots_mutex);
-}
-
-/* Generate random data for redis benchmark. See #7196. */
-static void genBenchmarkRandomData(char *data, int count) {
-    static uint32_t state = 1234;
-    int i = 0;
-
-    while (count--) {
-        state = (state*1103515245+12345);
-        data[i++] = '0'+((state>>16)&63);
-    }
-}
-
-/* Returns number of consumed options. */
-int parseOptions(int argc, const char **argv) {
-    int i;
-    int lastarg;
-    int exit_status = 1;
-
-    for (i = 1; i < argc; i++) {
-        lastarg = (i == (argc-1));
-
-        if (!strcmp(argv[i],"-c")) {
-            if (lastarg) goto invalid;
-            config.numclients = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"-v") || !strcmp(argv[i], "--version")) {
-            sds version = benchmarkVersion();
-            printf("redis-benchmark %s\n", version);
-            sdsfree(version);
-            exit(0);
-        } else if (!strcmp(argv[i],"-n")) {
-            if (lastarg) goto invalid;
-            config.requests = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"-k")) {
-            if (lastarg) goto invalid;
-            config.keepalive = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"-h")) {
-            if (lastarg) goto invalid;
-            config.hostip = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"-p")) {
-            if (lastarg) goto invalid;
-            config.hostport = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"-s")) {
-            if (lastarg) goto invalid;
-            config.hostsocket = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"-a") ) {
-            if (lastarg) goto invalid;
-            config.auth = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--user")) {
-            if (lastarg) goto invalid;
-            config.user = argv[++i];
-        } else if (!strcmp(argv[i],"-d")) {
-            if (lastarg) goto invalid;
-            config.datasize = atoi(argv[++i]);
-            if (config.datasize < 1) config.datasize=1;
-            if (config.datasize > 1024*1024*1024) config.datasize = 1024*1024*1024;
-        } else if (!strcmp(argv[i],"-P")) {
-            if (lastarg) goto invalid;
-            config.pipeline = atoi(argv[++i]);
-            if (config.pipeline <= 0) config.pipeline=1;
-        } else if (!strcmp(argv[i],"-r")) {
-            if (lastarg) goto invalid;
-            const char *next = argv[++i], *p = next;
-            if (*p == '-') {
-                p++;
-                if (*p < '0' || *p > '9') goto invalid;
-            }
-            config.randomkeys = 1;
-            config.randomkeys_keyspacelen = atoi(next);
-            if (config.randomkeys_keyspacelen < 0)
-                config.randomkeys_keyspacelen = 0;
-        } else if (!strcmp(argv[i],"-q")) {
-            config.quiet = 1;
-        } else if (!strcmp(argv[i],"--csv")) {
-            config.csv = 1;
-        } else if (!strcmp(argv[i],"-l")) {
-            config.loop = 1;
-        } else if (!strcmp(argv[i],"-I")) {
-            config.idlemode = 1;
-        } else if (!strcmp(argv[i],"-e")) {
-            printf("WARNING: -e option has been deprecated. "
-                   "We now immediatly exit on error to avoid false results.\n");
-        } else if (!strcmp(argv[i],"-t")) {
-            if (lastarg) goto invalid;
-            /* We get the list of tests to run as a string in the form
-             * get,set,lrange,...,test_N. Then we add a comma before and
-             * after the string in order to make sure that searching
-             * for ",testname," will always get a match if the test is
-             * enabled. */
-            config.tests = sdsnew(",");
-            config.tests = sdscat(config.tests,(char*)argv[++i]);
-            config.tests = sdscat(config.tests,",");
-            sdstolower(config.tests);
-        } else if (!strcmp(argv[i],"--dbnum")) {
-            if (lastarg) goto invalid;
-            config.dbnum = atoi(argv[++i]);
-            config.dbnumstr = sdsfromlonglong(config.dbnum);
-        } else if (!strcmp(argv[i],"--precision")) {
-            if (lastarg) goto invalid;
-            config.precision = atoi(argv[++i]);
-            if (config.precision < 0) config.precision = DEFAULT_LATENCY_PRECISION;
-            if (config.precision > MAX_LATENCY_PRECISION) config.precision = MAX_LATENCY_PRECISION;
-        } else if (!strcmp(argv[i],"--threads")) {
-             if (lastarg) goto invalid;
-             config.num_threads = atoi(argv[++i]);
-             if (config.num_threads > MAX_THREADS) {
-                printf("WARNING: too many threads, limiting threads to %d.\n",
-                       MAX_THREADS);
-                config.num_threads = MAX_THREADS;
-             } else if (config.num_threads < 0) config.num_threads = 0;
-        } else if (!strcmp(argv[i],"--cluster")) {
-            config.cluster_mode = 1;
-        } else if (!strcmp(argv[i],"--enable-tracking")) {
-            config.enable_tracking = 1;
-        } else if (!strcmp(argv[i],"--help")) {
-            exit_status = 0;
-            goto usage;
-        #ifdef USE_OPENSSL
-        } else if (!strcmp(argv[i],"--tls")) {
-            config.tls = 1;
-        } else if (!strcmp(argv[i],"--sni")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.sni = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--cacertdir")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.cacertdir = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--cacert")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.cacert = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--insecure")) {
-            config.sslconfig.skip_cert_verify = 1;
-        } else if (!strcmp(argv[i],"--cert")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.cert = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--key")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.key = strdup(argv[++i]);
-        } else if (!strcmp(argv[i],"--tls-ciphers")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.ciphers = strdup(argv[++i]);
-        #ifdef TLS1_3_VERSION
-        } else if (!strcmp(argv[i],"--tls-ciphersuites")) {
-            if (lastarg) goto invalid;
-            config.sslconfig.ciphersuites = strdup(argv[++i]);
-        #endif
-        #endif
-        } else {
-            /* Assume the user meant to provide an option when the arg starts
-             * with a dash. We're done otherwise and should use the remainder
-             * as the command and arguments for running the benchmark. */
-            if (argv[i][0] == '-') goto invalid;
-            return i;
-        }
-    }
-
-    return i;
-
-invalid:
-    printf("Invalid option \"%s\" or option argument missing\n\n",argv[i]);
-
-usage:
-    printf(
-"Usage: redis-benchmark [-h <host>] [-p <port>] [-c <clients>] [-n <requests>] [-k <boolean>]\n\n"
-" -h <hostname>      Server hostname (default 127.0.0.1)\n"
-" -p <port>          Server port (default 6379)\n"
-" -s <socket>        Server socket (overrides host and port)\n"
-" -a <password>      Password for Redis Auth\n"
-" --user <username>  Used to send ACL style 'AUTH username pass'. Needs -a.\n"
-" -c <clients>       Number of parallel connections (default 50)\n"
-" -n <requests>      Total number of requests (default 100000)\n"
-" -d <size>          Data size of SET/GET value in bytes (default 3)\n"
-" --dbnum <db>       SELECT the specified db number (default 0)\n"
-" --threads <num>    Enable multi-thread mode.\n"
-" --cluster          Enable cluster mode.\n"
-" --enable-tracking  Send CLIENT TRACKING on before starting benchmark.\n"
-" -k <boolean>       1=keep alive 0=reconnect (default 1)\n"
-" -r <keyspacelen>   Use random keys for SET/GET/INCR, random values for SADD,\n"
-"                    random members and scores for ZADD.\n"
-"  Using this option the benchmark will expand the string __rand_int__\n"
-"  inside an argument with a 12 digits number in the specified range\n"
-"  from 0 to keyspacelen-1. The substitution changes every time a command\n"
-"  is executed. Default tests use this to hit random keys in the\n"
-"  specified range.\n"
-" -P <numreq>        Pipeline <numreq> requests. Default 1 (no pipeline).\n"
-" -q                 Quiet. Just show query/sec values\n"
-" --precision        Number of decimal places to display in latency output (default 0)\n"
-" --csv              Output in CSV format\n"
-" -l                 Loop. Run the tests forever\n"
-" -t <tests>         Only run the comma separated list of tests. The test\n"
-"                    names are the same as the ones produced as output.\n"
-" -I                 Idle mode. Just open N idle connections and wait.\n"
-#ifdef USE_OPENSSL
-" --tls              Establish a secure TLS connection.\n"
-" --sni <host>       Server name indication for TLS.\n"
-" --cacert <file>    CA Certificate file to verify with.\n"
-" --cacertdir <dir>  Directory where trusted CA certificates are stored.\n"
-"                    If neither cacert nor cacertdir are specified, the default\n"
-"                    system-wide trusted root certs configuration will apply.\n"
-" --insecure         Allow insecure TLS connection by skipping cert validation.\n"
-" --cert <file>      Client certificate to authenticate with.\n"
-" --key <file>       Private key file to authenticate with.\n"
-" --tls-ciphers <list> Sets the list of prefered ciphers (TLSv1.2 and below)\n"
-"                    in order of preference from highest to lowest separated by colon (\":\").\n"
-"                    See the ciphers(1ssl) manpage for more information about the syntax of this string.\n"
-#ifdef TLS1_3_VERSION
-" --tls-ciphersuites <list> Sets the list of prefered ciphersuites (TLSv1.3)\n"
-"                    in order of preference from highest to lowest separated by colon (\":\").\n"
-"                    See the ciphers(1ssl) manpage for more information about the syntax of this string,\n"
-"                    and specifically for TLSv1.3 ciphersuites.\n"
-#endif
-#endif
-" --help             Output this help and exit.\n"
-" --version          Output version and exit.\n\n"
-"Examples:\n\n"
-" Run the benchmark with the default configuration against 127.0.0.1:6379:\n"
-"   $ redis-benchmark\n\n"
-" Use 20 parallel clients, for a total of 100k requests, against 192.168.1.1:\n"
-"   $ redis-benchmark -h 192.168.1.1 -p 6379 -n 100000 -c 20\n\n"
-" Fill 127.0.0.1:6379 with about 1 million keys only using the SET test:\n"
-"   $ redis-benchmark -t set -n 1000000 -r 100000000\n\n"
-" Benchmark 127.0.0.1:6379 for a few commands producing CSV output:\n"
-"   $ redis-benchmark -t ping,set,get -n 100000 --csv\n\n"
-" Benchmark a specific command line:\n"
-"   $ redis-benchmark -r 10000 -n 10000 eval 'return redis.call(\"ping\")' 0\n\n"
-" Fill a list with 10000 random elements:\n"
-"   $ redis-benchmark -r 10000 -n 10000 lpush mylist __rand_int__\n\n"
-" On user specified command lines __rand_int__ is replaced with a random integer\n"
-" with a range of values selected by the -r option.\n"
-    );
-    exit(exit_status);
-}
-
-int showThroughput(struct aeEventLoop *eventLoop, long long id, void *clientData) {
-    UNUSED(eventLoop);
-    UNUSED(id);
-    UNUSED(clientData);
-    int liveclients = 0;
-    int requests_finished = 0;
-    int previous_requests_finished = 0;
-    long long current_tick = mstime();
-    atomicGet(config.liveclients, liveclients);
-    atomicGet(config.requests_finished, requests_finished);
-    atomicGet(config.previous_requests_finished, previous_requests_finished);
-    
-    if (liveclients == 0 && requests_finished != config.requests) {
-        fprintf(stderr,"All clients disconnected... aborting.\n");
-        exit(1);
-    }
-    if (config.num_threads && requests_finished >= config.requests) {
-        aeStop(eventLoop);
-        return AE_NOMORE;
-    }
-    if (config.csv) return 250;
-    if (config.idlemode == 1) {
-        printf("clients: %d\r", config.liveclients);
-        fflush(stdout);
-	return 250;
-    }
-    const float dt = (float)(current_tick-config.start)/1000.0;
-    const float rps = (float)requests_finished/dt;
-    const float instantaneous_dt = (float)(current_tick-config.previous_tick)/1000.0;
-    const float instantaneous_rps = (float)(requests_finished-previous_requests_finished)/instantaneous_dt;
-    config.previous_tick = current_tick;
-    atomicSet(config.previous_requests_finished,requests_finished);
-    int printed_bytes = printf("%s: rps=%.1f (overall: %.1f) avg_msec=%.3f (overall: %.3f)\r", config.title, instantaneous_rps, rps, hdr_mean(config.current_sec_latency_histogram)/1000.0f, hdr_mean(config.latency_histogram)/1000.0f);
-    if (printed_bytes > config.last_printed_bytes){
-       config.last_printed_bytes = printed_bytes;
-    }
-    hdr_reset(config.current_sec_latency_histogram);
-    fflush(stdout);
-    return 250; /* every 250ms */
-}
-
-/* Return true if the named test was selected using the -t command line
- * switch, or if all the tests are selected (no -t passed by user). */
-int test_is_selected(char *name) {
-    char buf[256];
-    int l = strlen(name);
-
-    if (config.tests == NULL) return 1;
-    buf[0] = ',';
-    memcpy(buf+1,name,l);
-    buf[l+1] = ',';
-    buf[l+2] = '\0';
-    return strstr(config.tests,buf) != NULL;
-}
-
-int main(int argc, const char **argv) {
-    int i;
-    char *data, *cmd, *tag;
-    int len;
-
-    client c;
-
-    srandom(time(NULL) ^ getpid());
-    init_genrand64(ustime() ^ getpid());
-    signal(SIGHUP, SIG_IGN);
-    signal(SIGPIPE, SIG_IGN);
-
-    memset(&config.sslconfig, 0, sizeof(config.sslconfig));
-    config.numclients = 50;
-    config.requests = 100000;
-    config.liveclients = 0;
-    config.el = aeCreateEventLoop(1024*10);
-    aeCreateTimeEvent(config.el,1,showThroughput,NULL,NULL);
-    config.keepalive = 1;
-    config.datasize = 3;
-    config.pipeline = 1;
-    config.randomkeys = 0;
-    config.randomkeys_keyspacelen = 0;
-    config.quiet = 0;
-    config.csv = 0;
-    config.loop = 0;
-    config.idlemode = 0;
-    config.clients = listCreate();
-    config.hostip = "127.0.0.1";
-    config.hostport = 6379;
-    config.hostsocket = NULL;
-    config.tests = NULL;
-    config.dbnum = 0;
-    config.auth = NULL;
-    config.precision = DEFAULT_LATENCY_PRECISION;
-    config.num_threads = 0;
-    config.threads = NULL;
-    config.cluster_mode = 0;
-    config.cluster_node_count = 0;
-    config.cluster_nodes = NULL;
-    config.redis_config = NULL;
-    config.is_fetching_slots = 0;
-    config.is_updating_slots = 0;
-    config.slots_last_update = 0;
-    config.enable_tracking = 0;
-
-    i = parseOptions(argc,argv);
-    argc -= i;
-    argv += i;
-
-    tag = "";
-
-#ifdef USE_OPENSSL
-    if (config.tls) {
-        cliSecureInit();
-    }
-#endif
-
-    if (config.cluster_mode) {
-        // We only include the slot placeholder {tag} if cluster mode is enabled
-        tag = ":{tag}";
-
-        /* Fetch cluster configuration. */
-        if (!fetchClusterConfiguration() || !config.cluster_nodes) {
-            if (!config.hostsocket) {
-                fprintf(stderr, "Failed to fetch cluster configuration from "
-                                "%s:%d\n", config.hostip, config.hostport);
-            } else {
-                fprintf(stderr, "Failed to fetch cluster configuration from "
-                                "%s\n", config.hostsocket);
-            }
-            exit(1);
-        }
-        if (config.cluster_node_count <= 1) {
-            fprintf(stderr, "Invalid cluster: %d node(s).\n",
-                    config.cluster_node_count);
-            exit(1);
-        }
-        printf("Cluster has %d master nodes:\n\n", config.cluster_node_count);
-        int i = 0;
-        for (; i < config.cluster_node_count; i++) {
-            clusterNode *node = config.cluster_nodes[i];
-            if (!node) {
-                fprintf(stderr, "Invalid cluster node #%d\n", i);
-                exit(1);
-            }
-            printf("Master %d: ", i);
-            if (node->name) printf("%s ", node->name);
-            printf("%s:%d\n", node->ip, node->port);
-            node->redis_config = getRedisConfig(node->ip, node->port, NULL);
-            if (node->redis_config == NULL) {
-                fprintf(stderr, "WARN: could not fetch node CONFIG %s:%d\n",
-                        node->ip, node->port);
-            }
-        }
-        printf("\n");
-        /* Automatically set thread number to node count if not specified
-         * by the user. */
-        if (config.num_threads == 0)
-            config.num_threads = config.cluster_node_count;
-    } else {
-        config.redis_config =
-            getRedisConfig(config.hostip, config.hostport, config.hostsocket);
-        if (config.redis_config == NULL) {
-            fprintf(stderr, "WARN: could not fetch server CONFIG\n");
-        }
-    }
-    if (config.num_threads > 0) {
-        pthread_mutex_init(&(config.liveclients_mutex), NULL);
-        pthread_mutex_init(&(config.is_updating_slots_mutex), NULL);
-    }
-
-    if (config.keepalive == 0) {
-        printf("WARNING: keepalive disabled, you probably need 'echo 1 > /proc/sys/net/ipv4/tcp_tw_reuse' for Linux and 'sudo sysctl -w net.inet.tcp.msl=1000' for Mac OS X in order to use a lot of clients/requests\n");
-    }
-
-    if (config.idlemode) {
-        printf("Creating %d idle connections and waiting forever (Ctrl+C when done)\n", config.numclients);
-        int thread_id = -1, use_threads = (config.num_threads > 0);
-        if (use_threads) {
-            thread_id = 0;
-            initBenchmarkThreads();
-        }
-        c = createClient("",0,NULL,thread_id); /* will never receive a reply */
-        createMissingClients(c);
-        if (use_threads) startBenchmarkThreads();
-        else aeMain(config.el);
-        /* and will wait for every */
-    }
-    if(config.csv){
-        printf("\"test\",\"rps\",\"avg_latency_ms\",\"min_latency_ms\",\"p50_latency_ms\",\"p95_latency_ms\",\"p99_latency_ms\",\"max_latency_ms\"\n");
-    }
-    /* Run benchmark with command in the remainder of the arguments. */
-    if (argc) {
-        sds title = sdsnew(argv[0]);
-        for (i = 1; i < argc; i++) {
-            title = sdscatlen(title, " ", 1);
-            title = sdscatlen(title, (char*)argv[i], strlen(argv[i]));
-        }
-
-        do {
-            len = redisFormatCommandArgv(&cmd,argc,argv,NULL);
-            // adjust the datasize to the parsed command
-            config.datasize = len;
-            benchmark(title,cmd,len);
-            free(cmd);
-        } while(config.loop);
-
-        if (config.redis_config != NULL) freeRedisConfig(config.redis_config);
-        return 0;
-    }
-
-    /* Run default benchmark suite. */
-    data = zmalloc(config.datasize+1);
-    do {
-        genBenchmarkRandomData(data, config.datasize);
-        data[config.datasize] = '\0';
-
-        if (test_is_selected("ping_inline") || test_is_selected("ping"))
-            benchmark("PING_INLINE","PING\r\n",6);
-
-        if (test_is_selected("ping_mbulk") || test_is_selected("ping")) {
-            len = redisFormatCommand(&cmd,"PING");
-            benchmark("PING_MBULK",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("set")) {
-            len = redisFormatCommand(&cmd,"SET key%s:__rand_int__ %s",tag,data);
-            benchmark("SET",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("get")) {
-            len = redisFormatCommand(&cmd,"GET key%s:__rand_int__",tag);
-            benchmark("GET",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("incr")) {
-            len = redisFormatCommand(&cmd,"INCR counter%s:__rand_int__",tag);
-            benchmark("INCR",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lpush")) {
-            len = redisFormatCommand(&cmd,"LPUSH mylist%s %s",tag,data);
-            benchmark("LPUSH",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("rpush")) {
-            len = redisFormatCommand(&cmd,"RPUSH mylist%s %s",tag,data);
-            benchmark("RPUSH",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lpop")) {
-            len = redisFormatCommand(&cmd,"LPOP mylist%s",tag);
-            benchmark("LPOP",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("rpop")) {
-            len = redisFormatCommand(&cmd,"RPOP mylist%s",tag);
-            benchmark("RPOP",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("sadd")) {
-            len = redisFormatCommand(&cmd,
-                "SADD myset%s element:__rand_int__",tag);
-            benchmark("SADD",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("hset")) {
-            len = redisFormatCommand(&cmd,
-                "HSET myhash%s element:__rand_int__ %s",tag,data);
-            benchmark("HSET",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("spop")) {
-            len = redisFormatCommand(&cmd,"SPOP myset%s",tag);
-            benchmark("SPOP",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("zadd")) {
-            char *score = "0";
-            if (config.randomkeys) score = "__rand_int__";
-            len = redisFormatCommand(&cmd,
-                "ZADD myzset%s %s element:__rand_int__",tag,score);
-            benchmark("ZADD",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("zpopmin")) {
-            len = redisFormatCommand(&cmd,"ZPOPMIN myzset%s",tag);
-            benchmark("ZPOPMIN",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lrange") ||
-            test_is_selected("lrange_100") ||
-            test_is_selected("lrange_300") ||
-            test_is_selected("lrange_500") ||
-            test_is_selected("lrange_600"))
-        {
-            len = redisFormatCommand(&cmd,"LPUSH mylist%s %s",tag,data);
-            benchmark("LPUSH (needed to benchmark LRANGE)",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lrange") || test_is_selected("lrange_100")) {
-            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 99",tag);
-            benchmark("LRANGE_100 (first 100 elements)",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lrange") || test_is_selected("lrange_300")) {
-            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 299",tag);
-            benchmark("LRANGE_300 (first 300 elements)",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lrange") || test_is_selected("lrange_500")) {
-            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 499",tag);
-            benchmark("LRANGE_500 (first 500 elements)",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("lrange") || test_is_selected("lrange_600")) {
-            len = redisFormatCommand(&cmd,"LRANGE mylist%s 0 599",tag);
-            benchmark("LRANGE_600 (first 600 elements)",cmd,len);
-            free(cmd);
-        }
-
-        if (test_is_selected("mset")) {
-            const char *cmd_argv[21];
-            cmd_argv[0] = "MSET";
-            sds key_placeholder = sdscatprintf(sdsnew(""),"key%s:__rand_int__",tag);
-            for (i = 1; i < 21; i += 2) {
-                cmd_argv[i] = key_placeholder;
-                cmd_argv[i+1] = data;
-            }
-            len = redisFormatCommandArgv(&cmd,21,cmd_argv,NULL);
-            benchmark("MSET (10 keys)",cmd,len);
-            free(cmd);
-            sdsfree(key_placeholder);
-        }
-
-        if (!config.csv) printf("\n");
-    } while(config.loop);
-
-    zfree(data);
-    if (config.redis_config != NULL) freeRedisConfig(config.redis_config);
-
-    return 0;
-}
diff --git a/redis-stable/src/redis-check-aof.c b/redis-stable/src/redis-check-aof.c
deleted file mode 100644
index 1507e0a0..00000000
--- a/redis-stable/src/redis-check-aof.c
+++ /dev/null
@@ -1,235 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <sys/stat.h>
-
-#define ERROR(...) { \
-    char __buf[1024]; \
-    snprintf(__buf, sizeof(__buf), __VA_ARGS__); \
-    snprintf(error, sizeof(error), "0x%16llx: %s", (long long)epos, __buf); \
-}
-
-static char error[1044];
-static off_t epos;
-static long long line = 1;
-
-int consumeNewline(char *buf) {
-    if (strncmp(buf,"\r\n",2) != 0) {
-        ERROR("Expected \\r\\n, got: %02x%02x",buf[0],buf[1]);
-        return 0;
-    }
-    line += 1;
-    return 1;
-}
-
-int readLong(FILE *fp, char prefix, long *target) {
-    char buf[128], *eptr;
-    epos = ftello(fp);
-    if (fgets(buf,sizeof(buf),fp) == NULL) {
-        return 0;
-    }
-    if (buf[0] != prefix) {
-        ERROR("Expected prefix '%c', got: '%c'",prefix,buf[0]);
-        return 0;
-    }
-    *target = strtol(buf+1,&eptr,10);
-    return consumeNewline(eptr);
-}
-
-int readBytes(FILE *fp, char *target, long length) {
-    long real;
-    epos = ftello(fp);
-    real = fread(target,1,length,fp);
-    if (real != length) {
-        ERROR("Expected to read %ld bytes, got %ld bytes",length,real);
-        return 0;
-    }
-    return 1;
-}
-
-int readString(FILE *fp, char** target) {
-    long len;
-    *target = NULL;
-    if (!readLong(fp,'$',&len)) {
-        return 0;
-    }
-
-    /* Increase length to also consume \r\n */
-    len += 2;
-    *target = (char*)zmalloc(len);
-    if (!readBytes(fp,*target,len)) {
-        return 0;
-    }
-    if (!consumeNewline(*target+len-2)) {
-        return 0;
-    }
-    (*target)[len-2] = '\0';
-    return 1;
-}
-
-int readArgc(FILE *fp, long *target) {
-    return readLong(fp,'*',target);
-}
-
-off_t process(FILE *fp) {
-    long argc;
-    off_t pos = 0;
-    int i, multi = 0;
-    char *str;
-
-    while(1) {
-        if (!multi) pos = ftello(fp);
-        if (!readArgc(fp, &argc)) break;
-
-        for (i = 0; i < argc; i++) {
-            if (!readString(fp,&str)) break;
-            if (i == 0) {
-                if (strcasecmp(str, "multi") == 0) {
-                    if (multi++) {
-                        ERROR("Unexpected MULTI");
-                        break;
-                    }
-                } else if (strcasecmp(str, "exec") == 0) {
-                    if (--multi) {
-                        ERROR("Unexpected EXEC");
-                        break;
-                    }
-                }
-            }
-            zfree(str);
-        }
-
-        /* Stop if the loop did not finish */
-        if (i < argc) {
-            if (str) zfree(str);
-            break;
-        }
-    }
-
-    if (feof(fp) && multi && strlen(error) == 0) {
-        ERROR("Reached EOF before reading EXEC for MULTI");
-    }
-    if (strlen(error) > 0) {
-        printf("%s\n", error);
-    }
-    return pos;
-}
-
-int redis_check_aof_main(int argc, char **argv) {
-    char *filename;
-    int fix = 0;
-
-    if (argc < 2) {
-        printf("Usage: %s [--fix] <file.aof>\n", argv[0]);
-        exit(1);
-    } else if (argc == 2) {
-        filename = argv[1];
-    } else if (argc == 3) {
-        if (strcmp(argv[1],"--fix") != 0) {
-            printf("Invalid argument: %s\n", argv[1]);
-            exit(1);
-        }
-        filename = argv[2];
-        fix = 1;
-    } else {
-        printf("Invalid arguments\n");
-        exit(1);
-    }
-
-    FILE *fp = fopen(filename,"r+");
-    if (fp == NULL) {
-        printf("Cannot open file: %s\n", filename);
-        exit(1);
-    }
-
-    struct redis_stat sb;
-    if (redis_fstat(fileno(fp),&sb) == -1) {
-        printf("Cannot stat file: %s\n", filename);
-        exit(1);
-    }
-
-    off_t size = sb.st_size;
-    if (size == 0) {
-        printf("Empty file: %s\n", filename);
-        exit(1);
-    }
-
-    /* This AOF file may have an RDB preamble. Check this to start, and if this
-     * is the case, start processing the RDB part. */
-    if (size >= 8) {    /* There must be at least room for the RDB header. */
-        char sig[5];
-        int has_preamble = fread(sig,sizeof(sig),1,fp) == 1 &&
-                            memcmp(sig,"REDIS",sizeof(sig)) == 0;
-        rewind(fp);
-        if (has_preamble) {
-            printf("The AOF appears to start with an RDB preamble.\n"
-                   "Checking the RDB preamble to start:\n");
-            if (redis_check_rdb_main(argc,argv,fp) == C_ERR) {
-                printf("RDB preamble of AOF file is not sane, aborting.\n");
-                exit(1);
-            } else {
-                printf("RDB preamble is OK, proceeding with AOF tail...\n");
-            }
-        }
-    }
-
-    off_t pos = process(fp);
-    off_t diff = size-pos;
-    printf("AOF analyzed: size=%lld, ok_up_to=%lld, ok_up_to_line=%lld, diff=%lld\n",
-        (long long) size, (long long) pos, line, (long long) diff);
-    if (diff > 0) {
-        if (fix) {
-            char buf[2];
-            printf("This will shrink the AOF from %lld bytes, with %lld bytes, to %lld bytes\n",(long long)size,(long long)diff,(long long)pos);
-            printf("Continue? [y/N]: ");
-            if (fgets(buf,sizeof(buf),stdin) == NULL ||
-                strncasecmp(buf,"y",1) != 0) {
-                    printf("Aborting...\n");
-                    exit(1);
-            }
-            if (ftruncate(fileno(fp), pos) == -1) {
-                printf("Failed to truncate AOF\n");
-                exit(1);
-            } else {
-                printf("Successfully truncated AOF\n");
-            }
-        } else {
-            printf("AOF is not valid. "
-                   "Use the --fix option to try fixing it.\n");
-            exit(1);
-        }
-    } else {
-        printf("AOF is valid\n");
-    }
-
-    fclose(fp);
-    exit(0);
-}
diff --git a/redis-stable/src/redis-check-rdb.c b/redis-stable/src/redis-check-rdb.c
deleted file mode 100644
index bb655248..00000000
--- a/redis-stable/src/redis-check-rdb.c
+++ /dev/null
@@ -1,395 +0,0 @@
-/*
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "mt19937-64.h"
-#include "server.h"
-#include "rdb.h"
-
-#include <stdarg.h>
-#include <sys/time.h>
-#include <unistd.h>
-
-void createSharedObjects(void);
-void rdbLoadProgressCallback(rio *r, const void *buf, size_t len);
-int rdbCheckMode = 0;
-
-struct {
-    rio *rio;
-    robj *key;                      /* Current key we are reading. */
-    int key_type;                   /* Current key type if != -1. */
-    unsigned long keys;             /* Number of keys processed. */
-    unsigned long expires;          /* Number of keys with an expire. */
-    unsigned long already_expired;  /* Number of keys already expired. */
-    int doing;                      /* The state while reading the RDB. */
-    int error_set;                  /* True if error is populated. */
-    char error[1024];
-} rdbstate;
-
-/* At every loading step try to remember what we were about to do, so that
- * we can log this information when an error is encountered. */
-#define RDB_CHECK_DOING_START 0
-#define RDB_CHECK_DOING_READ_TYPE 1
-#define RDB_CHECK_DOING_READ_EXPIRE 2
-#define RDB_CHECK_DOING_READ_KEY 3
-#define RDB_CHECK_DOING_READ_OBJECT_VALUE 4
-#define RDB_CHECK_DOING_CHECK_SUM 5
-#define RDB_CHECK_DOING_READ_LEN 6
-#define RDB_CHECK_DOING_READ_AUX 7
-#define RDB_CHECK_DOING_READ_MODULE_AUX 8
-
-char *rdb_check_doing_string[] = {
-    "start",
-    "read-type",
-    "read-expire",
-    "read-key",
-    "read-object-value",
-    "check-sum",
-    "read-len",
-    "read-aux",
-    "read-module-aux"
-};
-
-char *rdb_type_string[] = {
-    "string",
-    "list-linked",
-    "set-hashtable",
-    "zset-v1",
-    "hash-hashtable",
-    "zset-v2",
-    "module-value",
-    "","",
-    "hash-zipmap",
-    "list-ziplist",
-    "set-intset",
-    "zset-ziplist",
-    "hash-ziplist",
-    "quicklist",
-    "stream"
-};
-
-/* Show a few stats collected into 'rdbstate' */
-void rdbShowGenericInfo(void) {
-    printf("[info] %lu keys read\n", rdbstate.keys);
-    printf("[info] %lu expires\n", rdbstate.expires);
-    printf("[info] %lu already expired\n", rdbstate.already_expired);
-}
-
-/* Called on RDB errors. Provides details about the RDB and the offset
- * we were when the error was detected. */
-void rdbCheckError(const char *fmt, ...) {
-    char msg[1024];
-    va_list ap;
-
-    va_start(ap, fmt);
-    vsnprintf(msg, sizeof(msg), fmt, ap);
-    va_end(ap);
-
-    printf("--- RDB ERROR DETECTED ---\n");
-    printf("[offset %llu] %s\n",
-        (unsigned long long) (rdbstate.rio ?
-            rdbstate.rio->processed_bytes : 0), msg);
-    printf("[additional info] While doing: %s\n",
-        rdb_check_doing_string[rdbstate.doing]);
-    if (rdbstate.key)
-        printf("[additional info] Reading key '%s'\n",
-            (char*)rdbstate.key->ptr);
-    if (rdbstate.key_type != -1)
-        printf("[additional info] Reading type %d (%s)\n",
-            rdbstate.key_type,
-            ((unsigned)rdbstate.key_type <
-             sizeof(rdb_type_string)/sizeof(char*)) ?
-                rdb_type_string[rdbstate.key_type] : "unknown");
-    rdbShowGenericInfo();
-}
-
-/* Print informations during RDB checking. */
-void rdbCheckInfo(const char *fmt, ...) {
-    char msg[1024];
-    va_list ap;
-
-    va_start(ap, fmt);
-    vsnprintf(msg, sizeof(msg), fmt, ap);
-    va_end(ap);
-
-    printf("[offset %llu] %s\n",
-        (unsigned long long) (rdbstate.rio ?
-            rdbstate.rio->processed_bytes : 0), msg);
-}
-
-/* Used inside rdb.c in order to log specific errors happening inside
- * the RDB loading internals. */
-void rdbCheckSetError(const char *fmt, ...) {
-    va_list ap;
-
-    va_start(ap, fmt);
-    vsnprintf(rdbstate.error, sizeof(rdbstate.error), fmt, ap);
-    va_end(ap);
-    rdbstate.error_set = 1;
-}
-
-/* During RDB check we setup a special signal handler for memory violations
- * and similar conditions, so that we can log the offending part of the RDB
- * if the crash is due to broken content. */
-void rdbCheckHandleCrash(int sig, siginfo_t *info, void *secret) {
-    UNUSED(sig);
-    UNUSED(info);
-    UNUSED(secret);
-
-    rdbCheckError("Server crash checking the specified RDB file!");
-    exit(1);
-}
-
-void rdbCheckSetupSignals(void) {
-    struct sigaction act;
-
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = SA_NODEFER | SA_RESETHAND | SA_SIGINFO;
-    act.sa_sigaction = rdbCheckHandleCrash;
-    sigaction(SIGSEGV, &act, NULL);
-    sigaction(SIGBUS, &act, NULL);
-    sigaction(SIGFPE, &act, NULL);
-    sigaction(SIGILL, &act, NULL);
-    sigaction(SIGABRT, &act, NULL);
-}
-
-/* Check the specified RDB file. Return 0 if the RDB looks sane, otherwise
- * 1 is returned.
- * The file is specified as a filename in 'rdbfilename' if 'fp' is not NULL,
- * otherwise the already open file 'fp' is checked. */
-int redis_check_rdb(char *rdbfilename, FILE *fp) {
-    uint64_t dbid;
-    int type, rdbver;
-    char buf[1024];
-    long long expiretime, now = mstime();
-    static rio rdb; /* Pointed by global struct riostate. */
-
-    int closefile = (fp == NULL);
-    if (fp == NULL && (fp = fopen(rdbfilename,"r")) == NULL) return 1;
-
-    startLoadingFile(fp, rdbfilename, RDBFLAGS_NONE);
-    rioInitWithFile(&rdb,fp);
-    rdbstate.rio = &rdb;
-    rdb.update_cksum = rdbLoadProgressCallback;
-    if (rioRead(&rdb,buf,9) == 0) goto eoferr;
-    buf[9] = '\0';
-    if (memcmp(buf,"REDIS",5) != 0) {
-        rdbCheckError("Wrong signature trying to load DB from file");
-        goto err;
-    }
-    rdbver = atoi(buf+5);
-    if (rdbver < 1 || rdbver > RDB_VERSION) {
-        rdbCheckError("Can't handle RDB format version %d",rdbver);
-        goto err;
-    }
-
-    expiretime = -1;
-    while(1) {
-        robj *key, *val;
-
-        /* Read type. */
-        rdbstate.doing = RDB_CHECK_DOING_READ_TYPE;
-        if ((type = rdbLoadType(&rdb)) == -1) goto eoferr;
-
-        /* Handle special types. */
-        if (type == RDB_OPCODE_EXPIRETIME) {
-            rdbstate.doing = RDB_CHECK_DOING_READ_EXPIRE;
-            /* EXPIRETIME: load an expire associated with the next key
-             * to load. Note that after loading an expire we need to
-             * load the actual type, and continue. */
-            expiretime = rdbLoadTime(&rdb);
-            expiretime *= 1000;
-            if (rioGetReadError(&rdb)) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_EXPIRETIME_MS) {
-            /* EXPIRETIME_MS: milliseconds precision expire times introduced
-             * with RDB v3. Like EXPIRETIME but no with more precision. */
-            rdbstate.doing = RDB_CHECK_DOING_READ_EXPIRE;
-            expiretime = rdbLoadMillisecondTime(&rdb, rdbver);
-            if (rioGetReadError(&rdb)) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_FREQ) {
-            /* FREQ: LFU frequency. */
-            uint8_t byte;
-            if (rioRead(&rdb,&byte,1) == 0) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_IDLE) {
-            /* IDLE: LRU idle time. */
-            if (rdbLoadLen(&rdb,NULL) == RDB_LENERR) goto eoferr;
-            continue; /* Read next opcode. */
-        } else if (type == RDB_OPCODE_EOF) {
-            /* EOF: End of file, exit the main loop. */
-            break;
-        } else if (type == RDB_OPCODE_SELECTDB) {
-            /* SELECTDB: Select the specified database. */
-            rdbstate.doing = RDB_CHECK_DOING_READ_LEN;
-            if ((dbid = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
-                goto eoferr;
-            rdbCheckInfo("Selecting DB ID %llu", (unsigned long long)dbid);
-            continue; /* Read type again. */
-        } else if (type == RDB_OPCODE_RESIZEDB) {
-            /* RESIZEDB: Hint about the size of the keys in the currently
-             * selected data base, in order to avoid useless rehashing. */
-            uint64_t db_size, expires_size;
-            rdbstate.doing = RDB_CHECK_DOING_READ_LEN;
-            if ((db_size = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
-                goto eoferr;
-            if ((expires_size = rdbLoadLen(&rdb,NULL)) == RDB_LENERR)
-                goto eoferr;
-            continue; /* Read type again. */
-        } else if (type == RDB_OPCODE_AUX) {
-            /* AUX: generic string-string fields. Use to add state to RDB
-             * which is backward compatible. Implementations of RDB loading
-             * are requierd to skip AUX fields they don't understand.
-             *
-             * An AUX field is composed of two strings: key and value. */
-            robj *auxkey, *auxval;
-            rdbstate.doing = RDB_CHECK_DOING_READ_AUX;
-            if ((auxkey = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
-            if ((auxval = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
-
-            rdbCheckInfo("AUX FIELD %s = '%s'",
-                (char*)auxkey->ptr, (char*)auxval->ptr);
-            decrRefCount(auxkey);
-            decrRefCount(auxval);
-            continue; /* Read type again. */
-        } else if (type == RDB_OPCODE_MODULE_AUX) {
-            /* AUX: Auxiliary data for modules. */
-            uint64_t moduleid, when_opcode, when;
-            rdbstate.doing = RDB_CHECK_DOING_READ_MODULE_AUX;
-            if ((moduleid = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
-            if ((when_opcode = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
-            if ((when = rdbLoadLen(&rdb,NULL)) == RDB_LENERR) goto eoferr;
-
-            char name[10];
-            moduleTypeNameByID(name,moduleid);
-            rdbCheckInfo("MODULE AUX for: %s", name);
-
-            robj *o = rdbLoadCheckModuleValue(&rdb,name);
-            decrRefCount(o);
-            continue; /* Read type again. */
-        } else {
-            if (!rdbIsObjectType(type)) {
-                rdbCheckError("Invalid object type: %d", type);
-                goto err;
-            }
-            rdbstate.key_type = type;
-        }
-
-        /* Read key */
-        rdbstate.doing = RDB_CHECK_DOING_READ_KEY;
-        if ((key = rdbLoadStringObject(&rdb)) == NULL) goto eoferr;
-        rdbstate.key = key;
-        rdbstate.keys++;
-        /* Read value */
-        rdbstate.doing = RDB_CHECK_DOING_READ_OBJECT_VALUE;
-        if ((val = rdbLoadObject(type,&rdb,key->ptr,NULL)) == NULL) goto eoferr;
-        /* Check if the key already expired. */
-        if (expiretime != -1 && expiretime < now)
-            rdbstate.already_expired++;
-        if (expiretime != -1) rdbstate.expires++;
-        rdbstate.key = NULL;
-        decrRefCount(key);
-        decrRefCount(val);
-        rdbstate.key_type = -1;
-        expiretime = -1;
-    }
-    /* Verify the checksum if RDB version is >= 5 */
-    if (rdbver >= 5 && server.rdb_checksum) {
-        uint64_t cksum, expected = rdb.cksum;
-
-        rdbstate.doing = RDB_CHECK_DOING_CHECK_SUM;
-        if (rioRead(&rdb,&cksum,8) == 0) goto eoferr;
-        memrev64ifbe(&cksum);
-        if (cksum == 0) {
-            rdbCheckInfo("RDB file was saved with checksum disabled: no check performed.");
-        } else if (cksum != expected) {
-            rdbCheckError("RDB CRC error");
-            goto err;
-        } else {
-            rdbCheckInfo("Checksum OK");
-        }
-    }
-
-    if (closefile) fclose(fp);
-    stopLoading(1);
-    return 0;
-
-eoferr: /* unexpected end of file is handled here with a fatal exit */
-    if (rdbstate.error_set) {
-        rdbCheckError(rdbstate.error);
-    } else {
-        rdbCheckError("Unexpected EOF reading RDB file");
-    }
-err:
-    if (closefile) fclose(fp);
-    stopLoading(0);
-    return 1;
-}
-
-/* RDB check main: called form server.c when Redis is executed with the
- * redis-check-rdb alias, on during RDB loading errors.
- *
- * The function works in two ways: can be called with argc/argv as a
- * standalone executable, or called with a non NULL 'fp' argument if we
- * already have an open file to check. This happens when the function
- * is used to check an RDB preamble inside an AOF file.
- *
- * When called with fp = NULL, the function never returns, but exits with the
- * status code according to success (RDB is sane) or error (RDB is corrupted).
- * Otherwise if called with a non NULL fp, the function returns C_OK or
- * C_ERR depending on the success or failure. */
-int redis_check_rdb_main(int argc, char **argv, FILE *fp) {
-    struct timeval tv;
-
-    if (argc != 2 && fp == NULL) {
-        fprintf(stderr, "Usage: %s <rdb-file-name>\n", argv[0]);
-        exit(1);
-    }
-
-    gettimeofday(&tv, NULL);
-    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
-
-    /* In order to call the loading functions we need to create the shared
-     * integer objects, however since this function may be called from
-     * an already initialized Redis instance, check if we really need to. */
-    if (shared.integers[0] == NULL)
-        createSharedObjects();
-    server.loading_process_events_interval_bytes = 0;
-    server.sanitize_dump_payload = SANITIZE_DUMP_YES;
-    rdbCheckMode = 1;
-    rdbCheckInfo("Checking RDB file %s", argv[1]);
-    rdbCheckSetupSignals();
-    int retval = redis_check_rdb(argv[1],fp);
-    if (retval == 0) {
-        rdbCheckInfo("\\o/ RDB looks OK! \\o/");
-        rdbShowGenericInfo();
-    }
-    if (fp) return (retval == 0) ? C_OK : C_ERR;
-    exit(retval);
-}
diff --git a/redis-stable/src/redis-cli.c b/redis-stable/src/redis-cli.c
deleted file mode 100644
index ace37858..00000000
--- a/redis-stable/src/redis-cli.c
+++ /dev/null
@@ -1,8472 +0,0 @@
-/* Redis CLI (command line interface)
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include "version.h"
-
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <signal.h>
-#include <unistd.h>
-#include <time.h>
-#include <ctype.h>
-#include <errno.h>
-#include <sys/stat.h>
-#include <sys/time.h>
-#include <assert.h>
-#include <fcntl.h>
-#include <limits.h>
-#include <math.h>
-
-#include <hiredis.h>
-#ifdef USE_OPENSSL
-#include <openssl/ssl.h>
-#include <openssl/err.h>
-#include <hiredis_ssl.h>
-#endif
-#include <sdscompat.h> /* Use hiredis' sds compat header that maps sds calls to their hi_ variants */
-#include <sds.h> /* use sds.h from hiredis, so that only one set of sds functions will be present in the binary */
-#include "dict.h"
-#include "adlist.h"
-#include "zmalloc.h"
-#include "linenoise.h"
-#include "help.h"
-#include "anet.h"
-#include "ae.h"
-#include "cli_common.h"
-#include "mt19937-64.h"
-
-#define UNUSED(V) ((void) V)
-
-#define OUTPUT_STANDARD 0
-#define OUTPUT_RAW 1
-#define OUTPUT_CSV 2
-#define REDIS_CLI_KEEPALIVE_INTERVAL 15 /* seconds */
-#define REDIS_CLI_DEFAULT_PIPE_TIMEOUT 30 /* seconds */
-#define REDIS_CLI_HISTFILE_ENV "REDISCLI_HISTFILE"
-#define REDIS_CLI_HISTFILE_DEFAULT ".rediscli_history"
-#define REDIS_CLI_RCFILE_ENV "REDISCLI_RCFILE"
-#define REDIS_CLI_RCFILE_DEFAULT ".redisclirc"
-#define REDIS_CLI_AUTH_ENV "REDISCLI_AUTH"
-#define REDIS_CLI_CLUSTER_YES_ENV "REDISCLI_CLUSTER_YES"
-
-#define CLUSTER_MANAGER_SLOTS               16384
-#define CLUSTER_MANAGER_MIGRATE_TIMEOUT     60000
-#define CLUSTER_MANAGER_MIGRATE_PIPELINE    10
-#define CLUSTER_MANAGER_REBALANCE_THRESHOLD 2
-
-#define CLUSTER_MANAGER_INVALID_HOST_ARG \
-    "[ERR] Invalid arguments: you need to pass either a valid " \
-    "address (ie. 120.0.0.1:7000) or space separated IP " \
-    "and port (ie. 120.0.0.1 7000)\n"
-#define CLUSTER_MANAGER_MODE() (config.cluster_manager_command.name != NULL)
-#define CLUSTER_MANAGER_MASTERS_COUNT(nodes, replicas) (nodes/(replicas + 1))
-#define CLUSTER_MANAGER_COMMAND(n,...) \
-        (redisCommand(n->context, __VA_ARGS__))
-
-#define CLUSTER_MANAGER_NODE_ARRAY_FREE(array) zfree(array->alloc)
-
-#define CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, err) \
-    clusterManagerLogErr("Node %s:%d replied with error:\n%s\n", \
-                         n->ip, n->port, err);
-
-#define clusterManagerLogInfo(...) \
-    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_INFO,__VA_ARGS__)
-
-#define clusterManagerLogErr(...) \
-    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_ERR,__VA_ARGS__)
-
-#define clusterManagerLogWarn(...) \
-    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_WARN,__VA_ARGS__)
-
-#define clusterManagerLogOk(...) \
-    clusterManagerLog(CLUSTER_MANAGER_LOG_LVL_SUCCESS,__VA_ARGS__)
-
-#define CLUSTER_MANAGER_FLAG_MYSELF     1 << 0
-#define CLUSTER_MANAGER_FLAG_SLAVE      1 << 1
-#define CLUSTER_MANAGER_FLAG_FRIEND     1 << 2
-#define CLUSTER_MANAGER_FLAG_NOADDR     1 << 3
-#define CLUSTER_MANAGER_FLAG_DISCONNECT 1 << 4
-#define CLUSTER_MANAGER_FLAG_FAIL       1 << 5
-
-#define CLUSTER_MANAGER_CMD_FLAG_FIX            1 << 0
-#define CLUSTER_MANAGER_CMD_FLAG_SLAVE          1 << 1
-#define CLUSTER_MANAGER_CMD_FLAG_YES            1 << 2
-#define CLUSTER_MANAGER_CMD_FLAG_AUTOWEIGHTS    1 << 3
-#define CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER    1 << 4
-#define CLUSTER_MANAGER_CMD_FLAG_SIMULATE       1 << 5
-#define CLUSTER_MANAGER_CMD_FLAG_REPLACE        1 << 6
-#define CLUSTER_MANAGER_CMD_FLAG_COPY           1 << 7
-#define CLUSTER_MANAGER_CMD_FLAG_COLOR          1 << 8
-#define CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS   1 << 9
-#define CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS 1 << 10
-#define CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY   1 << 11
-#define CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY    1 << 12
-
-#define CLUSTER_MANAGER_OPT_GETFRIENDS  1 << 0
-#define CLUSTER_MANAGER_OPT_COLD        1 << 1
-#define CLUSTER_MANAGER_OPT_UPDATE      1 << 2
-#define CLUSTER_MANAGER_OPT_QUIET       1 << 6
-#define CLUSTER_MANAGER_OPT_VERBOSE     1 << 7
-
-#define CLUSTER_MANAGER_LOG_LVL_INFO    1
-#define CLUSTER_MANAGER_LOG_LVL_WARN    2
-#define CLUSTER_MANAGER_LOG_LVL_ERR     3
-#define CLUSTER_MANAGER_LOG_LVL_SUCCESS 4
-
-#define CLUSTER_JOIN_CHECK_AFTER        20
-
-#define LOG_COLOR_BOLD      "29;1m"
-#define LOG_COLOR_RED       "31;1m"
-#define LOG_COLOR_GREEN     "32;1m"
-#define LOG_COLOR_YELLOW    "33;1m"
-#define LOG_COLOR_RESET     "0m"
-
-/* cliConnect() flags. */
-#define CC_FORCE (1<<0)         /* Re-connect if already connected. */
-#define CC_QUIET (1<<1)         /* Don't log connecting errors. */
-
-/* --latency-dist palettes. */
-int spectrum_palette_color_size = 19;
-int spectrum_palette_color[] = {0,233,234,235,237,239,241,243,245,247,144,143,142,184,226,214,208,202,196};
-
-int spectrum_palette_mono_size = 13;
-int spectrum_palette_mono[] = {0,233,234,235,237,239,241,243,245,247,249,251,253};
-
-/* The actual palette in use. */
-int *spectrum_palette;
-int spectrum_palette_size;
-
-/* Dict Helpers */
-
-static uint64_t dictSdsHash(const void *key);
-static int dictSdsKeyCompare(void *privdata, const void *key1,
-    const void *key2);
-static void dictSdsDestructor(void *privdata, void *val);
-static void dictListDestructor(void *privdata, void *val);
-
-/* Cluster Manager Command Info */
-typedef struct clusterManagerCommand {
-    char *name;
-    int argc;
-    char **argv;
-    int flags;
-    int replicas;
-    char *from;
-    char *to;
-    char **weight;
-    int weight_argc;
-    char *master_id;
-    int slots;
-    int timeout;
-    int pipeline;
-    float threshold;
-    char *backup_dir;
-    char *from_user;
-    char *from_pass;
-    int from_askpass;
-} clusterManagerCommand;
-
-static void createClusterManagerCommand(char *cmdname, int argc, char **argv);
-
-
-static redisContext *context;
-static struct config {
-    char *hostip;
-    int hostport;
-    char *hostsocket;
-    int tls;
-    cliSSLconfig sslconfig;
-    long repeat;
-    long interval;
-    int dbnum; /* db num currently selected */
-    int input_dbnum; /* db num user input */
-    int interactive;
-    int shutdown;
-    int monitor_mode;
-    int pubsub_mode;
-    int latency_mode;
-    int latency_dist_mode;
-    int latency_history;
-    int lru_test_mode;
-    long long lru_test_sample_size;
-    int cluster_mode;
-    int cluster_reissue_command;
-    int cluster_send_asking;
-    int slave_mode;
-    int pipe_mode;
-    int pipe_timeout;
-    int getrdb_mode;
-    int stat_mode;
-    int scan_mode;
-    int intrinsic_latency_mode;
-    int intrinsic_latency_duration;
-    sds pattern;
-    char *rdb_filename;
-    int bigkeys;
-    int memkeys;
-    unsigned memkeys_samples;
-    int hotkeys;
-    int stdinarg; /* get last arg from stdin. (-x option) */
-    char *auth;
-    int askpass;
-    char *user;
-    int quoted_input;   /* Force input args to be treated as quoted strings */
-    int output; /* output mode, see OUTPUT_* defines */
-    int push_output; /* Should we display spontaneous PUSH replies */
-    sds mb_delim;
-    sds cmd_delim;
-    char prompt[128];
-    char *eval;
-    int eval_ldb;
-    int eval_ldb_sync;  /* Ask for synchronous mode of the Lua debugger. */
-    int eval_ldb_end;   /* Lua debugging session ended. */
-    int enable_ldb_on_eval; /* Handle manual SCRIPT DEBUG + EVAL commands. */
-    int last_cmd_type;
-    int verbose;
-    int set_errcode;
-    clusterManagerCommand cluster_manager_command;
-    int no_auth_warning;
-    int resp3;
-    int in_multi;
-    int pre_multi_dbnum;
-} config;
-
-/* User preferences. */
-static struct pref {
-    int hints;
-} pref;
-
-static volatile sig_atomic_t force_cancel_loop = 0;
-static void usage(void);
-static void slaveMode(void);
-char *redisGitSHA1(void);
-char *redisGitDirty(void);
-static int cliConnect(int force);
-
-static char *getInfoField(char *info, char *field);
-static long getLongInfoField(char *info, char *field);
-
-/*------------------------------------------------------------------------------
- * Utility functions
- *--------------------------------------------------------------------------- */
-
-static void cliPushHandler(void *, void *);
-
-uint16_t crc16(const char *buf, int len);
-
-static long long ustime(void) {
-    struct timeval tv;
-    long long ust;
-
-    gettimeofday(&tv, NULL);
-    ust = ((long long)tv.tv_sec)*1000000;
-    ust += tv.tv_usec;
-    return ust;
-}
-
-static long long mstime(void) {
-    return ustime()/1000;
-}
-
-static void cliRefreshPrompt(void) {
-    if (config.eval_ldb) return;
-
-    sds prompt = sdsempty();
-    if (config.hostsocket != NULL) {
-        prompt = sdscatfmt(prompt,"redis %s",config.hostsocket);
-    } else {
-        char addr[256];
-        anetFormatAddr(addr, sizeof(addr), config.hostip, config.hostport);
-        prompt = sdscatlen(prompt,addr,strlen(addr));
-    }
-
-    /* Add [dbnum] if needed */
-    if (config.dbnum != 0)
-        prompt = sdscatfmt(prompt,"[%i]",config.dbnum);
-
-    /* Add TX if in transaction state*/
-    if (config.in_multi)  
-        prompt = sdscatlen(prompt,"(TX)",4);
-
-    /* Copy the prompt in the static buffer. */
-    prompt = sdscatlen(prompt,"> ",2);
-    snprintf(config.prompt,sizeof(config.prompt),"%s",prompt);
-    sdsfree(prompt);
-}
-
-/* Return the name of the dotfile for the specified 'dotfilename'.
- * Normally it just concatenates user $HOME to the file specified
- * in 'dotfilename'. However if the environment variable 'envoverride'
- * is set, its value is taken as the path.
- *
- * The function returns NULL (if the file is /dev/null or cannot be
- * obtained for some error), or an SDS string that must be freed by
- * the user. */
-static sds getDotfilePath(char *envoverride, char *dotfilename) {
-    char *path = NULL;
-    sds dotPath = NULL;
-
-    /* Check the env for a dotfile override. */
-    path = getenv(envoverride);
-    if (path != NULL && *path != '\0') {
-        if (!strcmp("/dev/null", path)) {
-            return NULL;
-        }
-
-        /* If the env is set, return it. */
-        dotPath = sdsnew(path);
-    } else {
-        char *home = getenv("HOME");
-        if (home != NULL && *home != '\0') {
-            /* If no override is set use $HOME/<dotfilename>. */
-            dotPath = sdscatprintf(sdsempty(), "%s/%s", home, dotfilename);
-        }
-    }
-    return dotPath;
-}
-
-/* URL-style percent decoding. */
-#define isHexChar(c) (isdigit(c) || (c >= 'a' && c <= 'f'))
-#define decodeHexChar(c) (isdigit(c) ? c - '0' : c - 'a' + 10)
-#define decodeHex(h, l) ((decodeHexChar(h) << 4) + decodeHexChar(l))
-
-static sds percentDecode(const char *pe, size_t len) {
-    const char *end = pe + len;
-    sds ret = sdsempty();
-    const char *curr = pe;
-
-    while (curr < end) {
-        if (*curr == '%') {
-            if ((end - curr) < 2) {
-                fprintf(stderr, "Incomplete URI encoding\n");
-                exit(1);
-            }
-
-            char h = tolower(*(++curr));
-            char l = tolower(*(++curr));
-            if (!isHexChar(h) || !isHexChar(l)) {
-                fprintf(stderr, "Illegal character in URI encoding\n");
-                exit(1);
-            }
-            char c = decodeHex(h, l);
-            ret = sdscatlen(ret, &c, 1);
-            curr++;
-        } else {
-            ret = sdscatlen(ret, curr++, 1);
-        }
-    }
-
-    return ret;
-}
-
-/* Parse a URI and extract the server connection information.
- * URI scheme is based on the the provisional specification[1] excluding support
- * for query parameters. Valid URIs are:
- *   scheme:    "redis://"
- *   authority: [[<username> ":"] <password> "@"] [<hostname> [":" <port>]]
- *   path:      ["/" [<db>]]
- *
- *  [1]: https://www.iana.org/assignments/uri-schemes/prov/redis */
-static void parseRedisUri(const char *uri) {
-
-    const char *scheme = "redis://";
-    const char *tlsscheme = "rediss://";
-    const char *curr = uri;
-    const char *end = uri + strlen(uri);
-    const char *userinfo, *username, *port, *host, *path;
-
-    /* URI must start with a valid scheme. */
-    if (!strncasecmp(tlsscheme, curr, strlen(tlsscheme))) {
-#ifdef USE_OPENSSL
-        config.tls = 1;
-        curr += strlen(tlsscheme);
-#else
-        fprintf(stderr,"rediss:// is only supported when redis-cli is compiled with OpenSSL\n");
-        exit(1);
-#endif
-    } else if (!strncasecmp(scheme, curr, strlen(scheme))) {
-        curr += strlen(scheme);
-    } else {
-        fprintf(stderr,"Invalid URI scheme\n");
-        exit(1);
-    }
-    if (curr == end) return;
-
-    /* Extract user info. */
-    if ((userinfo = strchr(curr,'@'))) {
-        if ((username = strchr(curr, ':')) && username < userinfo) {
-            config.user = percentDecode(curr, username - curr);
-            curr = username + 1;
-        }
-
-        config.auth = percentDecode(curr, userinfo - curr);
-        curr = userinfo + 1;
-    }
-    if (curr == end) return;
-
-    /* Extract host and port. */
-    path = strchr(curr, '/');
-    if (*curr != '/') {
-        host = path ? path - 1 : end;
-        if ((port = strchr(curr, ':'))) {
-            config.hostport = atoi(port + 1);
-            host = port - 1;
-        }
-        config.hostip = sdsnewlen(curr, host - curr + 1);
-    }
-    curr = path ? path + 1 : end;
-    if (curr == end) return;
-
-    /* Extract database number. */
-    config.input_dbnum = atoi(curr);
-}
-
-static uint64_t dictSdsHash(const void *key) {
-    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
-}
-
-static int dictSdsKeyCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    int l1,l2;
-    DICT_NOTUSED(privdata);
-
-    l1 = sdslen((sds)key1);
-    l2 = sdslen((sds)key2);
-    if (l1 != l2) return 0;
-    return memcmp(key1, key2, l1) == 0;
-}
-
-static void dictSdsDestructor(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-    sdsfree(val);
-}
-
-void dictListDestructor(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-    listRelease((list*)val);
-}
-
-/* _serverAssert is needed by dict */
-void _serverAssert(const char *estr, const char *file, int line) {
-    fprintf(stderr, "=== ASSERTION FAILED ===");
-    fprintf(stderr, "==> %s:%d '%s' is not true",file,line,estr);
-    *((char*)-1) = 'x';
-}
-
-/*------------------------------------------------------------------------------
- * Help functions
- *--------------------------------------------------------------------------- */
-
-#define CLI_HELP_COMMAND 1
-#define CLI_HELP_GROUP 2
-
-typedef struct {
-    int type;
-    int argc;
-    sds *argv;
-    sds full;
-
-    /* Only used for help on commands */
-    struct commandHelp *org;
-} helpEntry;
-
-static helpEntry *helpEntries;
-static int helpEntriesLen;
-
-static sds cliVersion(void) {
-    sds version;
-    version = sdscatprintf(sdsempty(), "%s", REDIS_VERSION);
-
-    /* Add git commit and working tree status when available */
-    if (strtoll(redisGitSHA1(),NULL,16)) {
-        version = sdscatprintf(version, " (git:%s", redisGitSHA1());
-        if (strtoll(redisGitDirty(),NULL,10))
-            version = sdscatprintf(version, "-dirty");
-        version = sdscat(version, ")");
-    }
-    return version;
-}
-
-static void cliInitHelp(void) {
-    int commandslen = sizeof(commandHelp)/sizeof(struct commandHelp);
-    int groupslen = sizeof(commandGroups)/sizeof(char*);
-    int i, len, pos = 0;
-    helpEntry tmp;
-
-    helpEntriesLen = len = commandslen+groupslen;
-    helpEntries = zmalloc(sizeof(helpEntry)*len);
-
-    for (i = 0; i < groupslen; i++) {
-        tmp.argc = 1;
-        tmp.argv = zmalloc(sizeof(sds));
-        tmp.argv[0] = sdscatprintf(sdsempty(),"@%s",commandGroups[i]);
-        tmp.full = tmp.argv[0];
-        tmp.type = CLI_HELP_GROUP;
-        tmp.org = NULL;
-        helpEntries[pos++] = tmp;
-    }
-
-    for (i = 0; i < commandslen; i++) {
-        tmp.argv = sdssplitargs(commandHelp[i].name,&tmp.argc);
-        tmp.full = sdsnew(commandHelp[i].name);
-        tmp.type = CLI_HELP_COMMAND;
-        tmp.org = &commandHelp[i];
-        helpEntries[pos++] = tmp;
-    }
-}
-
-/* cliInitHelp() setups the helpEntries array with the command and group
- * names from the help.h file. However the Redis instance we are connecting
- * to may support more commands, so this function integrates the previous
- * entries with additional entries obtained using the COMMAND command
- * available in recent versions of Redis. */
-static void cliIntegrateHelp(void) {
-    if (cliConnect(CC_QUIET) == REDIS_ERR) return;
-
-    redisReply *reply = redisCommand(context, "COMMAND");
-    if(reply == NULL || reply->type != REDIS_REPLY_ARRAY) return;
-
-    /* Scan the array reported by COMMAND and fill only the entries that
-     * don't already match what we have. */
-    for (size_t j = 0; j < reply->elements; j++) {
-        redisReply *entry = reply->element[j];
-        if (entry->type != REDIS_REPLY_ARRAY || entry->elements < 4 ||
-            entry->element[0]->type != REDIS_REPLY_STRING ||
-            entry->element[1]->type != REDIS_REPLY_INTEGER ||
-            entry->element[3]->type != REDIS_REPLY_INTEGER) return;
-        char *cmdname = entry->element[0]->str;
-        int i;
-
-        for (i = 0; i < helpEntriesLen; i++) {
-            helpEntry *he = helpEntries+i;
-            if (!strcasecmp(he->argv[0],cmdname))
-                break;
-        }
-        if (i != helpEntriesLen) continue;
-
-        helpEntriesLen++;
-        helpEntries = zrealloc(helpEntries,sizeof(helpEntry)*helpEntriesLen);
-        helpEntry *new = helpEntries+(helpEntriesLen-1);
-
-        new->argc = 1;
-        new->argv = zmalloc(sizeof(sds));
-        new->argv[0] = sdsnew(cmdname);
-        new->full = new->argv[0];
-        new->type = CLI_HELP_COMMAND;
-        sdstoupper(new->argv[0]);
-
-        struct commandHelp *ch = zmalloc(sizeof(*ch));
-        ch->name = new->argv[0];
-        ch->params = sdsempty();
-        int args = llabs(entry->element[1]->integer);
-        args--; /* Remove the command name itself. */
-        if (entry->element[3]->integer == 1) {
-            ch->params = sdscat(ch->params,"key ");
-            args--;
-        }
-        while(args-- > 0) ch->params = sdscat(ch->params,"arg ");
-        if (entry->element[1]->integer < 0)
-            ch->params = sdscat(ch->params,"...options...");
-        ch->summary = "Help not available";
-        ch->group = 0;
-        ch->since = "not known";
-        new->org = ch;
-    }
-    freeReplyObject(reply);
-}
-
-/* Output command help to stdout. */
-static void cliOutputCommandHelp(struct commandHelp *help, int group) {
-    printf("\r\n  \x1b[1m%s\x1b[0m \x1b[90m%s\x1b[0m\r\n", help->name, help->params);
-    printf("  \x1b[33msummary:\x1b[0m %s\r\n", help->summary);
-    printf("  \x1b[33msince:\x1b[0m %s\r\n", help->since);
-    if (group) {
-        printf("  \x1b[33mgroup:\x1b[0m %s\r\n", commandGroups[help->group]);
-    }
-}
-
-/* Print generic help. */
-static void cliOutputGenericHelp(void) {
-    sds version = cliVersion();
-    printf(
-        "redis-cli %s\n"
-        "To get help about Redis commands type:\n"
-        "      \"help @<group>\" to get a list of commands in <group>\n"
-        "      \"help <command>\" for help on <command>\n"
-        "      \"help <tab>\" to get a list of possible help topics\n"
-        "      \"quit\" to exit\n"
-        "\n"
-        "To set redis-cli preferences:\n"
-        "      \":set hints\" enable online hints\n"
-        "      \":set nohints\" disable online hints\n"
-        "Set your preferences in ~/.redisclirc\n",
-        version
-    );
-    sdsfree(version);
-}
-
-/* Output all command help, filtering by group or command name. */
-static void cliOutputHelp(int argc, char **argv) {
-    int i, j, len;
-    int group = -1;
-    helpEntry *entry;
-    struct commandHelp *help;
-
-    if (argc == 0) {
-        cliOutputGenericHelp();
-        return;
-    } else if (argc > 0 && argv[0][0] == '@') {
-        len = sizeof(commandGroups)/sizeof(char*);
-        for (i = 0; i < len; i++) {
-            if (strcasecmp(argv[0]+1,commandGroups[i]) == 0) {
-                group = i;
-                break;
-            }
-        }
-    }
-
-    assert(argc > 0);
-    for (i = 0; i < helpEntriesLen; i++) {
-        entry = &helpEntries[i];
-        if (entry->type != CLI_HELP_COMMAND) continue;
-
-        help = entry->org;
-        if (group == -1) {
-            /* Compare all arguments */
-            if (argc <= entry->argc) {
-                for (j = 0; j < argc; j++) {
-                    if (strcasecmp(argv[j],entry->argv[j]) != 0) break;
-                }
-                if (j == argc) {
-                    cliOutputCommandHelp(help,1);
-                }
-            }
-        } else {
-            if (group == help->group) {
-                cliOutputCommandHelp(help,0);
-            }
-        }
-    }
-    printf("\r\n");
-}
-
-/* Linenoise completion callback. */
-static void completionCallback(const char *buf, linenoiseCompletions *lc) {
-    size_t startpos = 0;
-    int mask;
-    int i;
-    size_t matchlen;
-    sds tmp;
-
-    if (strncasecmp(buf,"help ",5) == 0) {
-        startpos = 5;
-        while (isspace(buf[startpos])) startpos++;
-        mask = CLI_HELP_COMMAND | CLI_HELP_GROUP;
-    } else {
-        mask = CLI_HELP_COMMAND;
-    }
-
-    for (i = 0; i < helpEntriesLen; i++) {
-        if (!(helpEntries[i].type & mask)) continue;
-
-        matchlen = strlen(buf+startpos);
-        if (strncasecmp(buf+startpos,helpEntries[i].full,matchlen) == 0) {
-            tmp = sdsnewlen(buf,startpos);
-            tmp = sdscat(tmp,helpEntries[i].full);
-            linenoiseAddCompletion(lc,tmp);
-            sdsfree(tmp);
-        }
-    }
-}
-
-/* Linenoise hints callback. */
-static char *hintsCallback(const char *buf, int *color, int *bold) {
-    if (!pref.hints) return NULL;
-
-    int i, argc, buflen = strlen(buf);
-    sds *argv = sdssplitargs(buf,&argc);
-    int endspace = buflen && isspace(buf[buflen-1]);
-
-    /* Check if the argument list is empty and return ASAP. */
-    if (argc == 0) {
-        sdsfreesplitres(argv,argc);
-        return NULL;
-    }
-
-    for (i = 0; i < helpEntriesLen; i++) {
-        if (!(helpEntries[i].type & CLI_HELP_COMMAND)) continue;
-
-        if (strcasecmp(argv[0],helpEntries[i].full) == 0 ||
-            strcasecmp(buf,helpEntries[i].full) == 0)
-        {
-            *color = 90;
-            *bold = 0;
-            sds hint = sdsnew(helpEntries[i].org->params);
-
-            /* Remove arguments from the returned hint to show only the
-             * ones the user did not yet typed. */
-            int toremove = argc-1;
-            while(toremove > 0 && sdslen(hint)) {
-                if (hint[0] == '[') break;
-                if (hint[0] == ' ') toremove--;
-                sdsrange(hint,1,-1);
-            }
-
-            /* Add an initial space if needed. */
-            if (!endspace) {
-                sds newhint = sdsnewlen(" ",1);
-                newhint = sdscatsds(newhint,hint);
-                sdsfree(hint);
-                hint = newhint;
-            }
-
-            sdsfreesplitres(argv,argc);
-            return hint;
-        }
-    }
-    sdsfreesplitres(argv,argc);
-    return NULL;
-}
-
-static void freeHintsCallback(void *ptr) {
-    sdsfree(ptr);
-}
-
-/*------------------------------------------------------------------------------
- * Networking / parsing
- *--------------------------------------------------------------------------- */
-
-/* Unquote a null-terminated string and return it as a binary-safe sds. */
-static sds unquoteCString(char *str) {
-    int count;
-    sds *unquoted = sdssplitargs(str, &count);
-    sds res = NULL;
-
-    if (unquoted && count == 1) {
-        res = unquoted[0];
-        unquoted[0] = NULL;
-    }
-
-    if (unquoted)
-        sdsfreesplitres(unquoted, count);
-
-    return res;
-}
-
-/* Send AUTH command to the server */
-static int cliAuth(redisContext *ctx, char *user, char *auth) {
-    redisReply *reply;
-    if (auth == NULL) return REDIS_OK;
-
-    if (user == NULL)
-        reply = redisCommand(ctx,"AUTH %s",auth);
-    else
-        reply = redisCommand(ctx,"AUTH %s %s",user,auth);
-
-    if (reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        return REDIS_ERR;
-    }
-
-    int result = REDIS_OK;
-    if (reply->type == REDIS_REPLY_ERROR) {
-        result = REDIS_ERR;
-        fprintf(stderr, "AUTH failed: %s\n", reply->str);
-    }
-    freeReplyObject(reply);
-    return result;
-}
-
-/* Send SELECT input_dbnum to the server */
-static int cliSelect(void) {
-    redisReply *reply;
-    if (config.input_dbnum == config.dbnum) return REDIS_OK;
-
-    reply = redisCommand(context,"SELECT %d",config.input_dbnum);
-    if (reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        return REDIS_ERR;
-    }
-
-    int result = REDIS_OK;
-    if (reply->type == REDIS_REPLY_ERROR) {
-        result = REDIS_ERR;
-        fprintf(stderr,"SELECT %d failed: %s\n",config.input_dbnum,reply->str);
-    } else {
-        config.dbnum = config.input_dbnum;
-        cliRefreshPrompt();
-    }
-    freeReplyObject(reply);
-    return result;
-}
-
-/* Select RESP3 mode if redis-cli was started with the -3 option.  */
-static int cliSwitchProto(void) {
-    redisReply *reply;
-    if (config.resp3 == 0) return REDIS_OK;
-
-    reply = redisCommand(context,"HELLO 3");
-    if (reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        return REDIS_ERR;
-    }
-
-    int result = REDIS_OK;
-    if (reply->type == REDIS_REPLY_ERROR) {
-        result = REDIS_ERR;
-        fprintf(stderr,"HELLO 3 failed: %s\n",reply->str);
-    }
-    freeReplyObject(reply);
-    return result;
-}
-
-/* Connect to the server. It is possible to pass certain flags to the function:
- *      CC_FORCE: The connection is performed even if there is already
- *                a connected socket.
- *      CC_QUIET: Don't print errors if connection fails. */
-static int cliConnect(int flags) {
-    if (context == NULL || flags & CC_FORCE) {
-        if (context != NULL) {
-            redisFree(context);
-            config.dbnum = 0;
-            config.in_multi = 0;
-            cliRefreshPrompt();
-        }
-
-        /* Do not use hostsocket when we got redirected in cluster mode */
-        if (config.hostsocket == NULL ||
-            (config.cluster_mode && config.cluster_reissue_command)) {
-            context = redisConnect(config.hostip,config.hostport);
-        } else {
-            context = redisConnectUnix(config.hostsocket);
-        }
-
-        if (!context->err && config.tls) {
-            const char *err = NULL;
-            if (cliSecureConnection(context, config.sslconfig, &err) == REDIS_ERR && err) {
-                fprintf(stderr, "Could not negotiate a TLS connection: %s\n", err);
-                redisFree(context);
-                context = NULL;
-                return REDIS_ERR;
-            }
-        }
-
-        if (context->err) {
-            if (!(flags & CC_QUIET)) {
-                fprintf(stderr,"Could not connect to Redis at ");
-                if (config.hostsocket == NULL ||
-                    (config.cluster_mode && config.cluster_reissue_command))
-                {
-                    fprintf(stderr, "%s:%d: %s\n",
-                        config.hostip,config.hostport,context->errstr);
-                } else {
-                    fprintf(stderr,"%s: %s\n",
-                        config.hostsocket,context->errstr);
-                }
-            }
-            redisFree(context);
-            context = NULL;
-            return REDIS_ERR;
-        }
-
-
-        /* Set aggressive KEEP_ALIVE socket option in the Redis context socket
-         * in order to prevent timeouts caused by the execution of long
-         * commands. At the same time this improves the detection of real
-         * errors. */
-        anetKeepAlive(NULL, context->fd, REDIS_CLI_KEEPALIVE_INTERVAL);
-
-        /* Do AUTH, select the right DB, switch to RESP3 if needed. */
-        if (cliAuth(context, config.user, config.auth) != REDIS_OK)
-            return REDIS_ERR;
-        if (cliSelect() != REDIS_OK)
-            return REDIS_ERR;
-        if (cliSwitchProto() != REDIS_OK)
-            return REDIS_ERR;
-    }
-
-    /* Set a PUSH handler if configured to do so. */
-    if (config.push_output) {
-        redisSetPushCallback(context, cliPushHandler);
-    }
-
-    return REDIS_OK;
-}
-
-/* In cluster, if server replies ASK, we will redirect to a different node.
- * Before sending the real command, we need to send ASKING command first. */
-static int cliSendAsking() {
-    redisReply *reply;
-
-    config.cluster_send_asking = 0;
-    if (context == NULL) {
-        return REDIS_ERR;
-    }
-    reply = redisCommand(context,"ASKING");
-    if (reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        return REDIS_ERR;
-    }
-    int result = REDIS_OK;
-    if (reply->type == REDIS_REPLY_ERROR) {
-        result = REDIS_ERR;
-        fprintf(stderr,"ASKING failed: %s\n",reply->str);
-    }
-    freeReplyObject(reply);
-    return result;
-}
-
-static void cliPrintContextError(void) {
-    if (context == NULL) return;
-    fprintf(stderr,"Error: %s\n",context->errstr);
-}
-
-static int isInvalidateReply(redisReply *reply) {
-    return reply->type == REDIS_REPLY_PUSH && reply->elements == 2 &&
-        reply->element[0]->type == REDIS_REPLY_STRING &&
-        !strncmp(reply->element[0]->str, "invalidate", 10) &&
-        reply->element[1]->type == REDIS_REPLY_ARRAY;
-}
-
-/* Special display handler for RESP3 'invalidate' messages.
- * This function does not validate the reply, so it should
- * already be confirmed correct */
-static sds cliFormatInvalidateTTY(redisReply *r) {
-    sds out = sdsnew("-> invalidate: ");
-
-    for (size_t i = 0; i < r->element[1]->elements; i++) {
-        redisReply *key = r->element[1]->element[i];
-        assert(key->type == REDIS_REPLY_STRING);
-
-        out = sdscatfmt(out, "'%s'", key->str, key->len);
-        if (i < r->element[1]->elements - 1)
-            out = sdscatlen(out, ", ", 2);
-    }
-
-    return sdscatlen(out, "\n", 1);
-}
-
-static sds cliFormatReplyTTY(redisReply *r, char *prefix) {
-    sds out = sdsempty();
-    switch (r->type) {
-    case REDIS_REPLY_ERROR:
-        out = sdscatprintf(out,"(error) %s\n", r->str);
-    break;
-    case REDIS_REPLY_STATUS:
-        out = sdscat(out,r->str);
-        out = sdscat(out,"\n");
-    break;
-    case REDIS_REPLY_INTEGER:
-        out = sdscatprintf(out,"(integer) %lld\n",r->integer);
-    break;
-    case REDIS_REPLY_DOUBLE:
-        out = sdscatprintf(out,"(double) %s\n",r->str);
-    break;
-    case REDIS_REPLY_STRING:
-    case REDIS_REPLY_VERB:
-        /* If you are producing output for the standard output we want
-        * a more interesting output with quoted characters and so forth,
-        * unless it's a verbatim string type. */
-        if (r->type == REDIS_REPLY_STRING) {
-            out = sdscatrepr(out,r->str,r->len);
-            out = sdscat(out,"\n");
-        } else {
-            out = sdscatlen(out,r->str,r->len);
-            out = sdscat(out,"\n");
-        }
-    break;
-    case REDIS_REPLY_NIL:
-        out = sdscat(out,"(nil)\n");
-    break;
-    case REDIS_REPLY_BOOL:
-        out = sdscat(out,r->integer ? "(true)\n" : "(false)\n");
-    break;
-    case REDIS_REPLY_ARRAY:
-    case REDIS_REPLY_MAP:
-    case REDIS_REPLY_SET:
-    case REDIS_REPLY_PUSH:
-        if (r->elements == 0) {
-            if (r->type == REDIS_REPLY_ARRAY)
-                out = sdscat(out,"(empty array)\n");
-            else if (r->type == REDIS_REPLY_MAP)
-                out = sdscat(out,"(empty hash)\n");
-            else if (r->type == REDIS_REPLY_SET)
-                out = sdscat(out,"(empty set)\n");
-            else if (r->type == REDIS_REPLY_PUSH)
-                out = sdscat(out,"(empty push)\n");
-            else
-                out = sdscat(out,"(empty aggregate type)\n");
-        } else {
-            unsigned int i, idxlen = 0;
-            char _prefixlen[16];
-            char _prefixfmt[16];
-            sds _prefix;
-            sds tmp;
-
-            /* Calculate chars needed to represent the largest index */
-            i = r->elements;
-            if (r->type == REDIS_REPLY_MAP) i /= 2;
-            do {
-                idxlen++;
-                i /= 10;
-            } while(i);
-
-            /* Prefix for nested multi bulks should grow with idxlen+2 spaces */
-            memset(_prefixlen,' ',idxlen+2);
-            _prefixlen[idxlen+2] = '\0';
-            _prefix = sdscat(sdsnew(prefix),_prefixlen);
-
-            /* Setup prefix format for every entry */
-            char numsep;
-            if (r->type == REDIS_REPLY_SET) numsep = '~';
-            else if (r->type == REDIS_REPLY_MAP) numsep = '#';
-            else numsep = ')';
-            snprintf(_prefixfmt,sizeof(_prefixfmt),"%%s%%%ud%c ",idxlen,numsep);
-
-            for (i = 0; i < r->elements; i++) {
-                unsigned int human_idx = (r->type == REDIS_REPLY_MAP) ?
-                                         i/2 : i;
-                human_idx++; /* Make it 1-based. */
-
-                /* Don't use the prefix for the first element, as the parent
-                 * caller already prepended the index number. */
-                out = sdscatprintf(out,_prefixfmt,i == 0 ? "" : prefix,human_idx);
-
-                /* Format the multi bulk entry */
-                tmp = cliFormatReplyTTY(r->element[i],_prefix);
-                out = sdscatlen(out,tmp,sdslen(tmp));
-                sdsfree(tmp);
-
-                /* For maps, format the value as well. */
-                if (r->type == REDIS_REPLY_MAP) {
-                    i++;
-                    sdsrange(out,0,-2);
-                    out = sdscat(out," => ");
-                    tmp = cliFormatReplyTTY(r->element[i],_prefix);
-                    out = sdscatlen(out,tmp,sdslen(tmp));
-                    sdsfree(tmp);
-                }
-            }
-            sdsfree(_prefix);
-        }
-    break;
-    default:
-        fprintf(stderr,"Unknown reply type: %d\n", r->type);
-        exit(1);
-    }
-    return out;
-}
-
-int isColorTerm(void) {
-    char *t = getenv("TERM");
-    return t != NULL && strstr(t,"xterm") != NULL;
-}
-
-/* Helper  function for sdsCatColorizedLdbReply() appending colorize strings
- * to an SDS string. */
-sds sdscatcolor(sds o, char *s, size_t len, char *color) {
-    if (!isColorTerm()) return sdscatlen(o,s,len);
-
-    int bold = strstr(color,"bold") != NULL;
-    int ccode = 37; /* Defaults to white. */
-    if (strstr(color,"red")) ccode = 31;
-    else if (strstr(color,"green")) ccode = 32;
-    else if (strstr(color,"yellow")) ccode = 33;
-    else if (strstr(color,"blue")) ccode = 34;
-    else if (strstr(color,"magenta")) ccode = 35;
-    else if (strstr(color,"cyan")) ccode = 36;
-    else if (strstr(color,"white")) ccode = 37;
-
-    o = sdscatfmt(o,"\033[%i;%i;49m",bold,ccode);
-    o = sdscatlen(o,s,len);
-    o = sdscat(o,"\033[0m");
-    return o;
-}
-
-/* Colorize Lua debugger status replies according to the prefix they
- * have. */
-sds sdsCatColorizedLdbReply(sds o, char *s, size_t len) {
-    char *color = "white";
-
-    if (strstr(s,"<debug>")) color = "bold";
-    if (strstr(s,"<redis>")) color = "green";
-    if (strstr(s,"<reply>")) color = "cyan";
-    if (strstr(s,"<error>")) color = "red";
-    if (strstr(s,"<hint>")) color = "bold";
-    if (strstr(s,"<value>") || strstr(s,"<retval>")) color = "magenta";
-    if (len > 4 && isdigit(s[3])) {
-        if (s[1] == '>') color = "yellow"; /* Current line. */
-        else if (s[2] == '#') color = "bold"; /* Break point. */
-    }
-    return sdscatcolor(o,s,len,color);
-}
-
-static sds cliFormatReplyRaw(redisReply *r) {
-    sds out = sdsempty(), tmp;
-    size_t i;
-
-    switch (r->type) {
-    case REDIS_REPLY_NIL:
-        /* Nothing... */
-        break;
-    case REDIS_REPLY_ERROR:
-        out = sdscatlen(out,r->str,r->len);
-        out = sdscatlen(out,"\n",1);
-        break;
-    case REDIS_REPLY_STATUS:
-    case REDIS_REPLY_STRING:
-    case REDIS_REPLY_VERB:
-        if (r->type == REDIS_REPLY_STATUS && config.eval_ldb) {
-            /* The Lua debugger replies with arrays of simple (status)
-             * strings. We colorize the output for more fun if this
-             * is a debugging session. */
-
-            /* Detect the end of a debugging session. */
-            if (strstr(r->str,"<endsession>") == r->str) {
-                config.enable_ldb_on_eval = 0;
-                config.eval_ldb = 0;
-                config.eval_ldb_end = 1; /* Signal the caller session ended. */
-                config.output = OUTPUT_STANDARD;
-                cliRefreshPrompt();
-            } else {
-                out = sdsCatColorizedLdbReply(out,r->str,r->len);
-            }
-        } else {
-            out = sdscatlen(out,r->str,r->len);
-        }
-        break;
-    case REDIS_REPLY_BOOL:
-        out = sdscat(out,r->integer ? "(true)" : "(false)");
-    break;
-    case REDIS_REPLY_INTEGER:
-        out = sdscatprintf(out,"%lld",r->integer);
-        break;
-    case REDIS_REPLY_DOUBLE:
-        out = sdscatprintf(out,"%s",r->str);
-        break;
-    case REDIS_REPLY_SET:
-    case REDIS_REPLY_ARRAY:
-    case REDIS_REPLY_PUSH:
-        for (i = 0; i < r->elements; i++) {
-            if (i > 0) out = sdscat(out,config.mb_delim);
-            tmp = cliFormatReplyRaw(r->element[i]);
-            out = sdscatlen(out,tmp,sdslen(tmp));
-            sdsfree(tmp);
-        }
-        break;
-    case REDIS_REPLY_MAP:
-        for (i = 0; i < r->elements; i += 2) {
-            if (i > 0) out = sdscat(out,config.mb_delim);
-            tmp = cliFormatReplyRaw(r->element[i]);
-            out = sdscatlen(out,tmp,sdslen(tmp));
-            sdsfree(tmp);
-
-            out = sdscatlen(out," ",1);
-            tmp = cliFormatReplyRaw(r->element[i+1]);
-            out = sdscatlen(out,tmp,sdslen(tmp));
-            sdsfree(tmp);
-        }
-        break;
-    default:
-        fprintf(stderr,"Unknown reply type: %d\n", r->type);
-        exit(1);
-    }
-    return out;
-}
-
-static sds cliFormatReplyCSV(redisReply *r) {
-    unsigned int i;
-
-    sds out = sdsempty();
-    switch (r->type) {
-    case REDIS_REPLY_ERROR:
-        out = sdscat(out,"ERROR,");
-        out = sdscatrepr(out,r->str,strlen(r->str));
-    break;
-    case REDIS_REPLY_STATUS:
-        out = sdscatrepr(out,r->str,r->len);
-    break;
-    case REDIS_REPLY_INTEGER:
-        out = sdscatprintf(out,"%lld",r->integer);
-    break;
-    case REDIS_REPLY_DOUBLE:
-        out = sdscatprintf(out,"%s",r->str);
-        break;
-    case REDIS_REPLY_STRING:
-    case REDIS_REPLY_VERB:
-        out = sdscatrepr(out,r->str,r->len);
-    break;
-    case REDIS_REPLY_NIL:
-        out = sdscat(out,"NULL");
-    break;
-    case REDIS_REPLY_BOOL:
-        out = sdscat(out,r->integer ? "true" : "false");
-    break;
-    case REDIS_REPLY_ARRAY:
-    case REDIS_REPLY_SET:
-    case REDIS_REPLY_PUSH:
-    case REDIS_REPLY_MAP: /* CSV has no map type, just output flat list. */
-        for (i = 0; i < r->elements; i++) {
-            sds tmp = cliFormatReplyCSV(r->element[i]);
-            out = sdscatlen(out,tmp,sdslen(tmp));
-            if (i != r->elements-1) out = sdscat(out,",");
-            sdsfree(tmp);
-        }
-    break;
-    default:
-        fprintf(stderr,"Unknown reply type: %d\n", r->type);
-        exit(1);
-    }
-    return out;
-}
-
-/* Generate reply strings in various output modes */
-static sds cliFormatReply(redisReply *reply, int mode, int verbatim) {
-    sds out;
-
-    if (verbatim) {
-        out = cliFormatReplyRaw(reply);
-    }  else if (mode == OUTPUT_STANDARD) {
-        out = cliFormatReplyTTY(reply, "");
-    } else if (mode == OUTPUT_RAW) {
-        out = cliFormatReplyRaw(reply);
-        out = sdscatsds(out, config.cmd_delim);
-    } else if (mode == OUTPUT_CSV) {
-        out = cliFormatReplyCSV(reply);
-        out = sdscatlen(out, "\n", 1);
-    } else {
-        fprintf(stderr, "Error:  Unknown output encoding %d\n", mode);
-        exit(1);
-    }
-
-    return out;
-}
-
-/* Output any spontaneous PUSH reply we receive */
-static void cliPushHandler(void *privdata, void *reply) {
-    UNUSED(privdata);
-    sds out;
-
-    if (config.output == OUTPUT_STANDARD && isInvalidateReply(reply)) {
-        out = cliFormatInvalidateTTY(reply);
-    } else {
-        out = cliFormatReply(reply, config.output, 0);
-    }
-
-    fwrite(out, sdslen(out), 1, stdout);
-
-    freeReplyObject(reply);
-    sdsfree(out);
-}
-
-static int cliReadReply(int output_raw_strings) {
-    void *_reply;
-    redisReply *reply;
-    sds out = NULL;
-    int output = 1;
-
-    if (redisGetReply(context,&_reply) != REDIS_OK) {
-        if (config.shutdown) {
-            redisFree(context);
-            context = NULL;
-            return REDIS_OK;
-        }
-        if (config.interactive) {
-            /* Filter cases where we should reconnect */
-            if (context->err == REDIS_ERR_IO &&
-                (errno == ECONNRESET || errno == EPIPE))
-                return REDIS_ERR;
-            if (context->err == REDIS_ERR_EOF)
-                return REDIS_ERR;
-        }
-        cliPrintContextError();
-        exit(1);
-        return REDIS_ERR; /* avoid compiler warning */
-    }
-
-    reply = (redisReply*)_reply;
-
-    config.last_cmd_type = reply->type;
-
-    /* Check if we need to connect to a different node and reissue the
-     * request. */
-    if (config.cluster_mode && reply->type == REDIS_REPLY_ERROR &&
-        (!strncmp(reply->str,"MOVED ",6) || !strncmp(reply->str,"ASK ",4)))
-    {
-        char *p = reply->str, *s;
-        int slot;
-
-        output = 0;
-        /* Comments show the position of the pointer as:
-         *
-         * [S] for pointer 's'
-         * [P] for pointer 'p'
-         */
-        s = strchr(p,' ');      /* MOVED[S]3999 127.0.0.1:6381 */
-        p = strchr(s+1,' ');    /* MOVED[S]3999[P]127.0.0.1:6381 */
-        *p = '\0';
-        slot = atoi(s+1);
-        s = strrchr(p+1,':');    /* MOVED 3999[P]127.0.0.1[S]6381 */
-        *s = '\0';
-        sdsfree(config.hostip);
-        config.hostip = sdsnew(p+1);
-        config.hostport = atoi(s+1);
-        if (config.interactive)
-            printf("-> Redirected to slot [%d] located at %s:%d\n",
-                slot, config.hostip, config.hostport);
-        config.cluster_reissue_command = 1;
-        if (!strncmp(reply->str,"ASK ",4)) {
-            config.cluster_send_asking = 1;
-        }
-        cliRefreshPrompt();
-    } else if (!config.interactive && config.set_errcode && 
-        reply->type == REDIS_REPLY_ERROR) 
-    {
-        fprintf(stderr,"%s\n",reply->str);
-        exit(1);
-        return REDIS_ERR; /* avoid compiler warning */
-    }
-
-    if (output) {
-        out = cliFormatReply(reply, config.output, output_raw_strings);
-        fwrite(out,sdslen(out),1,stdout);
-        fflush(stdout);
-        sdsfree(out);
-    }
-    freeReplyObject(reply);
-    return REDIS_OK;
-}
-
-static int cliSendCommand(int argc, char **argv, long repeat) {
-    char *command = argv[0];
-    size_t *argvlen;
-    int j, output_raw;
-
-    if (!config.eval_ldb && /* In debugging mode, let's pass "help" to Redis. */
-        (!strcasecmp(command,"help") || !strcasecmp(command,"?"))) {
-        cliOutputHelp(--argc, ++argv);
-        return REDIS_OK;
-    }
-
-    if (context == NULL) return REDIS_ERR;
-
-    output_raw = 0;
-    if (!strcasecmp(command,"info") ||
-        !strcasecmp(command,"lolwut") ||
-        (argc >= 2 && !strcasecmp(command,"debug") &&
-                       !strcasecmp(argv[1],"htstats")) ||
-        (argc >= 2 && !strcasecmp(command,"debug") &&
-                       !strcasecmp(argv[1],"htstats-key")) ||
-        (argc >= 2 && !strcasecmp(command,"memory") &&
-                      (!strcasecmp(argv[1],"malloc-stats") ||
-                       !strcasecmp(argv[1],"doctor"))) ||
-        (argc == 2 && !strcasecmp(command,"cluster") &&
-                      (!strcasecmp(argv[1],"nodes") ||
-                       !strcasecmp(argv[1],"info"))) ||
-        (argc >= 2 && !strcasecmp(command,"client") &&
-                       (!strcasecmp(argv[1],"list") ||
-                        !strcasecmp(argv[1],"info"))) ||
-        (argc == 3 && !strcasecmp(command,"latency") &&
-                       !strcasecmp(argv[1],"graph")) ||
-        (argc == 2 && !strcasecmp(command,"latency") &&
-                       !strcasecmp(argv[1],"doctor")) ||
-        /* Format PROXY INFO command for Redis Cluster Proxy:
-         * https://github.com/artix75/redis-cluster-proxy */
-        (argc >= 2 && !strcasecmp(command,"proxy") &&
-                       !strcasecmp(argv[1],"info")))
-    {
-        output_raw = 1;
-    }
-
-    if (!strcasecmp(command,"shutdown")) config.shutdown = 1;
-    if (!strcasecmp(command,"monitor")) config.monitor_mode = 1;
-    if (!strcasecmp(command,"subscribe") ||
-        !strcasecmp(command,"psubscribe")) config.pubsub_mode = 1;
-    if (!strcasecmp(command,"sync") ||
-        !strcasecmp(command,"psync")) config.slave_mode = 1;
-
-    /* When the user manually calls SCRIPT DEBUG, setup the activation of
-     * debugging mode on the next eval if needed. */
-    if (argc == 3 && !strcasecmp(argv[0],"script") &&
-                     !strcasecmp(argv[1],"debug"))
-    {
-        if (!strcasecmp(argv[2],"yes") || !strcasecmp(argv[2],"sync")) {
-            config.enable_ldb_on_eval = 1;
-        } else {
-            config.enable_ldb_on_eval = 0;
-        }
-    }
-
-    /* Actually activate LDB on EVAL if needed. */
-    if (!strcasecmp(command,"eval") && config.enable_ldb_on_eval) {
-        config.eval_ldb = 1;
-        config.output = OUTPUT_RAW;
-    }
-
-    /* Setup argument length */
-    argvlen = zmalloc(argc*sizeof(size_t));
-    for (j = 0; j < argc; j++)
-        argvlen[j] = sdslen(argv[j]);
-
-    /* Negative repeat is allowed and causes infinite loop,
-       works well with the interval option. */
-    while(repeat < 0 || repeat-- > 0) {
-        redisAppendCommandArgv(context,argc,(const char**)argv,argvlen);
-        while (config.monitor_mode) {
-            if (cliReadReply(output_raw) != REDIS_OK) exit(1);
-            fflush(stdout);
-        }
-
-        if (config.pubsub_mode) {
-            if (config.output != OUTPUT_RAW)
-                printf("Reading messages... (press Ctrl-C to quit)\n");
-
-            /* Unset our default PUSH handler so this works in RESP2/RESP3 */
-            redisSetPushCallback(context, NULL);
-
-            while (config.pubsub_mode) {
-                if (cliReadReply(output_raw) != REDIS_OK) exit(1);
-                if (config.last_cmd_type == REDIS_REPLY_ERROR) {
-                    if (config.push_output) {
-                        redisSetPushCallback(context, cliPushHandler);
-                    }
-                    config.pubsub_mode = 0;
-                }
-            }
-            continue;
-        }
-
-        if (config.slave_mode) {
-            printf("Entering replica output mode...  (press Ctrl-C to quit)\n");
-            slaveMode();
-            config.slave_mode = 0;
-            zfree(argvlen);
-            return REDIS_ERR;  /* Error = slaveMode lost connection to master */
-        }
-
-        if (cliReadReply(output_raw) != REDIS_OK) {
-            zfree(argvlen);
-            return REDIS_ERR;
-        } else {
-            /* Store database number when SELECT was successfully executed. */
-            if (!strcasecmp(command,"select") && argc == 2 && 
-                config.last_cmd_type != REDIS_REPLY_ERROR) 
-            {
-                config.input_dbnum = config.dbnum = atoi(argv[1]);
-                cliRefreshPrompt();
-            } else if (!strcasecmp(command,"auth") && (argc == 2 || argc == 3)) {
-                cliSelect();
-            } else if (!strcasecmp(command,"multi") && argc == 1 &&
-                config.last_cmd_type != REDIS_REPLY_ERROR) 
-            {
-                config.in_multi = 1;
-                config.pre_multi_dbnum = config.dbnum;
-                cliRefreshPrompt();
-            } else if (!strcasecmp(command,"exec") && argc == 1 && config.in_multi) {
-                config.in_multi = 0;
-                if (config.last_cmd_type == REDIS_REPLY_ERROR ||
-                    config.last_cmd_type == REDIS_REPLY_NIL)
-                {
-                    config.input_dbnum = config.dbnum = config.pre_multi_dbnum;
-                }
-                cliRefreshPrompt();
-            } else if (!strcasecmp(command,"discard") && argc == 1 && 
-                config.last_cmd_type != REDIS_REPLY_ERROR) 
-            {
-                config.in_multi = 0;
-                config.input_dbnum = config.dbnum = config.pre_multi_dbnum;
-                cliRefreshPrompt();
-            } 
-        }
-        if (config.cluster_reissue_command){
-            /* If we need to reissue the command, break to prevent a
-               further 'repeat' number of dud interactions */
-            break;
-        }
-        if (config.interval) usleep(config.interval);
-        fflush(stdout); /* Make it grep friendly */
-    }
-
-    zfree(argvlen);
-    return REDIS_OK;
-}
-
-/* Send a command reconnecting the link if needed. */
-static redisReply *reconnectingRedisCommand(redisContext *c, const char *fmt, ...) {
-    redisReply *reply = NULL;
-    int tries = 0;
-    va_list ap;
-
-    assert(!c->err);
-    while(reply == NULL) {
-        while (c->err & (REDIS_ERR_IO | REDIS_ERR_EOF)) {
-            printf("\r\x1b[0K"); /* Cursor to left edge + clear line. */
-            printf("Reconnecting... %d\r", ++tries);
-            fflush(stdout);
-
-            redisFree(c);
-            c = redisConnect(config.hostip,config.hostport);
-            if (!c->err && config.tls) {
-                const char *err = NULL;
-                if (cliSecureConnection(c, config.sslconfig, &err) == REDIS_ERR && err) {
-                    fprintf(stderr, "TLS Error: %s\n", err);
-                    exit(1);
-                }
-            }
-            usleep(1000000);
-        }
-
-        va_start(ap,fmt);
-        reply = redisvCommand(c,fmt,ap);
-        va_end(ap);
-
-        if (c->err && !(c->err & (REDIS_ERR_IO | REDIS_ERR_EOF))) {
-            fprintf(stderr, "Error: %s\n", c->errstr);
-            exit(1);
-        } else if (tries > 0) {
-            printf("\r\x1b[0K"); /* Cursor to left edge + clear line. */
-        }
-    }
-
-    context = c;
-    return reply;
-}
-
-/*------------------------------------------------------------------------------
- * User interface
- *--------------------------------------------------------------------------- */
-
-static int parseOptions(int argc, char **argv) {
-    int i;
-
-    for (i = 1; i < argc; i++) {
-        int lastarg = i==argc-1;
-
-        if (!strcmp(argv[i],"-h") && !lastarg) {
-            sdsfree(config.hostip);
-            config.hostip = sdsnew(argv[++i]);
-        } else if (!strcmp(argv[i],"-h") && lastarg) {
-            usage();
-        } else if (!strcmp(argv[i],"--help")) {
-            usage();
-        } else if (!strcmp(argv[i],"-x")) {
-            config.stdinarg = 1;
-        } else if (!strcmp(argv[i],"-p") && !lastarg) {
-            config.hostport = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"-s") && !lastarg) {
-            config.hostsocket = argv[++i];
-        } else if (!strcmp(argv[i],"-r") && !lastarg) {
-            config.repeat = strtoll(argv[++i],NULL,10);
-        } else if (!strcmp(argv[i],"-i") && !lastarg) {
-            double seconds = atof(argv[++i]);
-            config.interval = seconds*1000000;
-        } else if (!strcmp(argv[i],"-n") && !lastarg) {
-            config.input_dbnum = atoi(argv[++i]);
-        } else if (!strcmp(argv[i], "--no-auth-warning")) {
-            config.no_auth_warning = 1;
-        } else if (!strcmp(argv[i], "--askpass")) {
-            config.askpass = 1;
-        } else if ((!strcmp(argv[i],"-a") || !strcmp(argv[i],"--pass"))
-                   && !lastarg)
-        {
-            config.auth = argv[++i];
-        } else if (!strcmp(argv[i],"--user") && !lastarg) {
-            config.user = argv[++i];
-        } else if (!strcmp(argv[i],"-u") && !lastarg) {
-            parseRedisUri(argv[++i]);
-        } else if (!strcmp(argv[i],"--raw")) {
-            config.output = OUTPUT_RAW;
-        } else if (!strcmp(argv[i],"--no-raw")) {
-            config.output = OUTPUT_STANDARD;
-        } else if (!strcmp(argv[i],"--quoted-input")) {
-            config.quoted_input = 1;
-        } else if (!strcmp(argv[i],"--csv")) {
-            config.output = OUTPUT_CSV;
-        } else if (!strcmp(argv[i],"--latency")) {
-            config.latency_mode = 1;
-        } else if (!strcmp(argv[i],"--latency-dist")) {
-            config.latency_dist_mode = 1;
-        } else if (!strcmp(argv[i],"--mono")) {
-            spectrum_palette = spectrum_palette_mono;
-            spectrum_palette_size = spectrum_palette_mono_size;
-        } else if (!strcmp(argv[i],"--latency-history")) {
-            config.latency_mode = 1;
-            config.latency_history = 1;
-        } else if (!strcmp(argv[i],"--lru-test") && !lastarg) {
-            config.lru_test_mode = 1;
-            config.lru_test_sample_size = strtoll(argv[++i],NULL,10);
-        } else if (!strcmp(argv[i],"--slave")) {
-            config.slave_mode = 1;
-        } else if (!strcmp(argv[i],"--replica")) {
-            config.slave_mode = 1;
-        } else if (!strcmp(argv[i],"--stat")) {
-            config.stat_mode = 1;
-        } else if (!strcmp(argv[i],"--scan")) {
-            config.scan_mode = 1;
-        } else if (!strcmp(argv[i],"--pattern") && !lastarg) {
-            sdsfree(config.pattern);
-            config.pattern = sdsnew(argv[++i]);
-        } else if (!strcmp(argv[i],"--quoted-pattern") && !lastarg) {
-            sdsfree(config.pattern);
-            config.pattern = unquoteCString(argv[++i]);
-            if (!config.pattern) {
-                fprintf(stderr,"Invalid quoted string specified for --quoted-pattern.\n");
-                exit(1);
-            }
-        } else if (!strcmp(argv[i],"--intrinsic-latency") && !lastarg) {
-            config.intrinsic_latency_mode = 1;
-            config.intrinsic_latency_duration = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--rdb") && !lastarg) {
-            config.getrdb_mode = 1;
-            config.rdb_filename = argv[++i];
-        } else if (!strcmp(argv[i],"--pipe")) {
-            config.pipe_mode = 1;
-        } else if (!strcmp(argv[i],"--pipe-timeout") && !lastarg) {
-            config.pipe_timeout = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--bigkeys")) {
-            config.bigkeys = 1;
-        } else if (!strcmp(argv[i],"--memkeys")) {
-            config.memkeys = 1;
-            config.memkeys_samples = 0; /* use redis default */
-        } else if (!strcmp(argv[i],"--memkeys-samples")) {
-            config.memkeys = 1;
-            config.memkeys_samples = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--hotkeys")) {
-            config.hotkeys = 1;
-        } else if (!strcmp(argv[i],"--eval") && !lastarg) {
-            config.eval = argv[++i];
-        } else if (!strcmp(argv[i],"--ldb")) {
-            config.eval_ldb = 1;
-            config.output = OUTPUT_RAW;
-        } else if (!strcmp(argv[i],"--ldb-sync-mode")) {
-            config.eval_ldb = 1;
-            config.eval_ldb_sync = 1;
-            config.output = OUTPUT_RAW;
-        } else if (!strcmp(argv[i],"-c")) {
-            config.cluster_mode = 1;
-        } else if (!strcmp(argv[i],"-d") && !lastarg) {
-            sdsfree(config.mb_delim);
-            config.mb_delim = sdsnew(argv[++i]);
-        } else if (!strcmp(argv[i],"-D") && !lastarg) {
-            sdsfree(config.cmd_delim);
-            config.cmd_delim = sdsnew(argv[++i]);
-        } else if (!strcmp(argv[i],"-e")) {
-            config.set_errcode = 1;
-        } else if (!strcmp(argv[i],"--verbose")) {
-            config.verbose = 1;
-        } else if (!strcmp(argv[i],"--cluster") && !lastarg) {
-            if (CLUSTER_MANAGER_MODE()) usage();
-            char *cmd = argv[++i];
-            int j = i;
-            while (j < argc && argv[j][0] != '-') j++;
-            if (j > i) j--;
-            createClusterManagerCommand(cmd, j - i, argv + i + 1);
-            i = j;
-        } else if (!strcmp(argv[i],"--cluster") && lastarg) {
-            usage();
-        } else if ((!strcmp(argv[i],"--cluster-only-masters"))) {
-            config.cluster_manager_command.flags |=
-                    CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY;
-        } else if ((!strcmp(argv[i],"--cluster-only-replicas"))) {
-            config.cluster_manager_command.flags |=
-                    CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY;
-        } else if (!strcmp(argv[i],"--cluster-replicas") && !lastarg) {
-            config.cluster_manager_command.replicas = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--cluster-master-id") && !lastarg) {
-            config.cluster_manager_command.master_id = argv[++i];
-        } else if (!strcmp(argv[i],"--cluster-from") && !lastarg) {
-            config.cluster_manager_command.from = argv[++i];
-        } else if (!strcmp(argv[i],"--cluster-to") && !lastarg) {
-            config.cluster_manager_command.to = argv[++i];
-        } else if (!strcmp(argv[i],"--cluster-from-user") && !lastarg) {
-            config.cluster_manager_command.from_user = argv[++i];
-        } else if (!strcmp(argv[i],"--cluster-from-pass") && !lastarg) {
-            config.cluster_manager_command.from_pass = argv[++i];
-        } else if (!strcmp(argv[i], "--cluster-from-askpass")) {
-            config.cluster_manager_command.from_askpass = 1;
-        } else if (!strcmp(argv[i],"--cluster-weight") && !lastarg) {
-            if (config.cluster_manager_command.weight != NULL) {
-                fprintf(stderr, "WARNING: you cannot use --cluster-weight "
-                                "more than once.\n"
-                                "You can set more weights by adding them "
-                                "as a space-separated list, ie:\n"
-                                "--cluster-weight n1=w n2=w\n");
-                exit(1);
-            }
-            int widx = i + 1;
-            char **weight = argv + widx;
-            int wargc = 0;
-            for (; widx < argc; widx++) {
-                if (strstr(argv[widx], "--") == argv[widx]) break;
-                if (strchr(argv[widx], '=') == NULL) break;
-                wargc++;
-            }
-            if (wargc > 0) {
-                config.cluster_manager_command.weight = weight;
-                config.cluster_manager_command.weight_argc = wargc;
-                i += wargc;
-            }
-        } else if (!strcmp(argv[i],"--cluster-slots") && !lastarg) {
-            config.cluster_manager_command.slots = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--cluster-timeout") && !lastarg) {
-            config.cluster_manager_command.timeout = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--cluster-pipeline") && !lastarg) {
-            config.cluster_manager_command.pipeline = atoi(argv[++i]);
-        } else if (!strcmp(argv[i],"--cluster-threshold") && !lastarg) {
-            config.cluster_manager_command.threshold = atof(argv[++i]);
-        } else if (!strcmp(argv[i],"--cluster-yes")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_YES;
-        } else if (!strcmp(argv[i],"--cluster-simulate")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_SIMULATE;
-        } else if (!strcmp(argv[i],"--cluster-replace")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_REPLACE;
-        } else if (!strcmp(argv[i],"--cluster-copy")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_COPY;
-        } else if (!strcmp(argv[i],"--cluster-slave")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_SLAVE;
-        } else if (!strcmp(argv[i],"--cluster-use-empty-masters")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER;
-        } else if (!strcmp(argv[i],"--cluster-search-multiple-owners")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS;
-        } else if (!strcmp(argv[i],"--cluster-fix-with-unreachable-masters")) {
-            config.cluster_manager_command.flags |=
-                CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
-#ifdef USE_OPENSSL
-        } else if (!strcmp(argv[i],"--tls")) {
-            config.tls = 1;
-        } else if (!strcmp(argv[i],"--sni") && !lastarg) {
-            config.sslconfig.sni = argv[++i];
-        } else if (!strcmp(argv[i],"--cacertdir") && !lastarg) {
-            config.sslconfig.cacertdir = argv[++i];
-        } else if (!strcmp(argv[i],"--cacert") && !lastarg) {
-            config.sslconfig.cacert = argv[++i];
-        } else if (!strcmp(argv[i],"--cert") && !lastarg) {
-            config.sslconfig.cert = argv[++i];
-        } else if (!strcmp(argv[i],"--key") && !lastarg) {
-            config.sslconfig.key = argv[++i];
-        } else if (!strcmp(argv[i],"--tls-ciphers") && !lastarg) {
-            config.sslconfig.ciphers = argv[++i];
-        } else if (!strcmp(argv[i],"--insecure")) {
-            config.sslconfig.skip_cert_verify = 1;
-        #ifdef TLS1_3_VERSION
-        } else if (!strcmp(argv[i],"--tls-ciphersuites") && !lastarg) {
-            config.sslconfig.ciphersuites = argv[++i];
-        #endif
-#endif
-        } else if (!strcmp(argv[i],"-v") || !strcmp(argv[i], "--version")) {
-            sds version = cliVersion();
-            printf("redis-cli %s\n", version);
-            sdsfree(version);
-            exit(0);
-        } else if (!strcmp(argv[i],"-3")) {
-            config.resp3 = 1;
-        } else if (!strcmp(argv[i],"--show-pushes") && !lastarg) {
-            char *argval = argv[++i];
-            if (!strncasecmp(argval, "n", 1)) {
-                config.push_output = 0;
-            } else if (!strncasecmp(argval, "y", 1)) {
-                config.push_output = 1;
-            } else {
-                fprintf(stderr, "Unknown --show-pushes value '%s' "
-                        "(valid: '[y]es', '[n]o')\n", argval);
-            }
-        } else if (CLUSTER_MANAGER_MODE() && argv[i][0] != '-') {
-            if (config.cluster_manager_command.argc == 0) {
-                int j = i + 1;
-                while (j < argc && argv[j][0] != '-') j++;
-                int cmd_argc = j - i;
-                config.cluster_manager_command.argc = cmd_argc;
-                config.cluster_manager_command.argv = argv + i;
-                if (cmd_argc > 1) i = j - 1;
-            }
-        } else {
-            if (argv[i][0] == '-') {
-                fprintf(stderr,
-                    "Unrecognized option or bad number of args for: '%s'\n",
-                    argv[i]);
-                exit(1);
-            } else {
-                /* Likely the command name, stop here. */
-                break;
-            }
-        }
-    }
-
-    if (config.hostsocket && config.cluster_mode) {
-        fprintf(stderr,"Options -c and -s are mutually exclusive.\n");
-        exit(1);
-    }
-
-    /* --ldb requires --eval. */
-    if (config.eval_ldb && config.eval == NULL) {
-        fprintf(stderr,"Options --ldb and --ldb-sync-mode require --eval.\n");
-        fprintf(stderr,"Try %s --help for more information.\n", argv[0]);
-        exit(1);
-    }
-
-    if (!config.no_auth_warning && config.auth != NULL) {
-        fputs("Warning: Using a password with '-a' or '-u' option on the command"
-              " line interface may not be safe.\n", stderr);
-    }
-
-    return i;
-}
-
-static void parseEnv() {
-    /* Set auth from env, but do not overwrite CLI arguments if passed */
-    char *auth = getenv(REDIS_CLI_AUTH_ENV);
-    if (auth != NULL && config.auth == NULL) {
-        config.auth = auth;
-    }
-
-    char *cluster_yes = getenv(REDIS_CLI_CLUSTER_YES_ENV);
-    if (cluster_yes != NULL && !strcmp(cluster_yes, "1")) {
-        config.cluster_manager_command.flags |= CLUSTER_MANAGER_CMD_FLAG_YES;
-    }
-}
-
-static sds readArgFromStdin(void) {
-    char buf[1024];
-    sds arg = sdsempty();
-
-    while(1) {
-        int nread = read(fileno(stdin),buf,1024);
-
-        if (nread == 0) break;
-        else if (nread == -1) {
-            perror("Reading from standard input");
-            exit(1);
-        }
-        arg = sdscatlen(arg,buf,nread);
-    }
-    return arg;
-}
-
-static void usage(void) {
-    sds version = cliVersion();
-    fprintf(stderr,
-"redis-cli %s\n"
-"\n"
-"Usage: redis-cli [OPTIONS] [cmd [arg [arg ...]]]\n"
-"  -h <hostname>      Server hostname (default: 127.0.0.1).\n"
-"  -p <port>          Server port (default: 6379).\n"
-"  -s <socket>        Server socket (overrides hostname and port).\n"
-"  -a <password>      Password to use when connecting to the server.\n"
-"                     You can also use the " REDIS_CLI_AUTH_ENV " environment\n"
-"                     variable to pass this password more safely\n"
-"                     (if both are used, this argument takes precedence).\n"
-"  --user <username>  Used to send ACL style 'AUTH username pass'. Needs -a.\n"
-"  --pass <password>  Alias of -a for consistency with the new --user option.\n"
-"  --askpass          Force user to input password with mask from STDIN.\n"
-"                     If this argument is used, '-a' and " REDIS_CLI_AUTH_ENV "\n"
-"                     environment variable will be ignored.\n"
-"  -u <uri>           Server URI.\n"
-"  -r <repeat>        Execute specified command N times.\n"
-"  -i <interval>      When -r is used, waits <interval> seconds per command.\n"
-"                     It is possible to specify sub-second times like -i 0.1.\n"
-"  -n <db>            Database number.\n"
-"  -3                 Start session in RESP3 protocol mode.\n"
-"  -x                 Read last argument from STDIN.\n"
-"  -d <delimiter>     Delimiter between response bulks for raw formatting (default: \\n).\n"
-"  -D <delimiter>     Delimiter between responses for raw formatting (default: \\n).\n"
-"  -c                 Enable cluster mode (follow -ASK and -MOVED redirections).\n"
-"  -e                 Return exit error code when command execution fails.\n"
-#ifdef USE_OPENSSL
-"  --tls              Establish a secure TLS connection.\n"
-"  --sni <host>       Server name indication for TLS.\n"
-"  --cacert <file>    CA Certificate file to verify with.\n"
-"  --cacertdir <dir>  Directory where trusted CA certificates are stored.\n"
-"                     If neither cacert nor cacertdir are specified, the default\n"
-"                     system-wide trusted root certs configuration will apply.\n"
-"  --insecure         Allow insecure TLS connection by skipping cert validation.\n"
-"  --cert <file>      Client certificate to authenticate with.\n"
-"  --key <file>       Private key file to authenticate with.\n"
-"  --tls-ciphers <list> Sets the list of prefered ciphers (TLSv1.2 and below)\n"
-"                     in order of preference from highest to lowest separated by colon (\":\").\n"
-"                     See the ciphers(1ssl) manpage for more information about the syntax of this string.\n"
-#ifdef TLS1_3_VERSION
-"  --tls-ciphersuites <list> Sets the list of prefered ciphersuites (TLSv1.3)\n"
-"                     in order of preference from highest to lowest separated by colon (\":\").\n"
-"                     See the ciphers(1ssl) manpage for more information about the syntax of this string,\n"
-"                     and specifically for TLSv1.3 ciphersuites.\n"
-#endif
-#endif
-"  --raw              Use raw formatting for replies (default when STDOUT is\n"
-"                     not a tty).\n"
-"  --no-raw           Force formatted output even when STDOUT is not a tty.\n"
-"  --quoted-input     Force input to be handled as quoted strings.\n"
-"  --csv              Output in CSV format.\n"
-"  --show-pushes <yn> Whether to print RESP3 PUSH messages.  Enabled by default when\n"
-"                     STDOUT is a tty but can be overriden with --show-pushes no.\n"
-"  --stat             Print rolling stats about server: mem, clients, ...\n"
-"  --latency          Enter a special mode continuously sampling latency.\n"
-"                     If you use this mode in an interactive session it runs\n"
-"                     forever displaying real-time stats. Otherwise if --raw or\n"
-"                     --csv is specified, or if you redirect the output to a non\n"
-"                     TTY, it samples the latency for 1 second (you can use\n"
-"                     -i to change the interval), then produces a single output\n"
-"                     and exits.\n",version);
-
-    fprintf(stderr,
-"  --latency-history  Like --latency but tracking latency changes over time.\n"
-"                     Default time interval is 15 sec. Change it using -i.\n"
-"  --latency-dist     Shows latency as a spectrum, requires xterm 256 colors.\n"
-"                     Default time interval is 1 sec. Change it using -i.\n"
-"  --lru-test <keys>  Simulate a cache workload with an 80-20 distribution.\n"
-"  --replica          Simulate a replica showing commands received from the master.\n"
-"  --rdb <filename>   Transfer an RDB dump from remote server to local file.\n"
-"                     Use filename of \"-\" to write to stdout.\n"
-"  --pipe             Transfer raw Redis protocol from stdin to server.\n"
-"  --pipe-timeout <n> In --pipe mode, abort with error if after sending all data.\n"
-"                     no reply is received within <n> seconds.\n"
-"                     Default timeout: %d. Use 0 to wait forever.\n",
-    REDIS_CLI_DEFAULT_PIPE_TIMEOUT);
-    fprintf(stderr,
-"  --bigkeys          Sample Redis keys looking for keys with many elements (complexity).\n"
-"  --memkeys          Sample Redis keys looking for keys consuming a lot of memory.\n"
-"  --memkeys-samples <n> Sample Redis keys looking for keys consuming a lot of memory.\n"
-"                     And define number of key elements to sample\n"
-"  --hotkeys          Sample Redis keys looking for hot keys.\n"
-"                     only works when maxmemory-policy is *lfu.\n"
-"  --scan             List all keys using the SCAN command.\n"
-"  --pattern <pat>    Keys pattern when using the --scan, --bigkeys or --hotkeys\n"
-"                     options (default: *).\n"
-"  --quoted-pattern <pat> Same as --pattern, but the specified string can be\n"
-"                         quoted, in order to pass an otherwise non binary-safe string.\n"
-"  --intrinsic-latency <sec> Run a test to measure intrinsic system latency.\n"
-"                     The test will run for the specified amount of seconds.\n"
-"  --eval <file>      Send an EVAL command using the Lua script at <file>.\n"
-"  --ldb              Used with --eval enable the Redis Lua debugger.\n"
-"  --ldb-sync-mode    Like --ldb but uses the synchronous Lua debugger, in\n"
-"                     this mode the server is blocked and script changes are\n"
-"                     not rolled back from the server memory.\n"
-"  --cluster <command> [args...] [opts...]\n"
-"                     Cluster Manager command and arguments (see below).\n"
-"  --verbose          Verbose mode.\n"
-"  --no-auth-warning  Don't show warning message when using password on command\n"
-"                     line interface.\n"
-"  --help             Output this help and exit.\n"
-"  --version          Output version and exit.\n"
-"\n");
-    /* Using another fprintf call to avoid -Woverlength-strings compile warning */
-    fprintf(stderr,
-"Cluster Manager Commands:\n"
-"  Use --cluster help to list all available cluster manager commands.\n"
-"\n"
-"Examples:\n"
-"  cat /etc/passwd | redis-cli -x set mypasswd\n"
-"  redis-cli get mypasswd\n"
-"  redis-cli -r 100 lpush mylist x\n"
-"  redis-cli -r 100 -i 1 info | grep used_memory_human:\n"
-"  redis-cli --quoted-input set '\"null-\\x00-separated\"' value\n"
-"  redis-cli --eval myscript.lua key1 key2 , arg1 arg2 arg3\n"
-"  redis-cli --scan --pattern '*:12345*'\n"
-"\n"
-"  (Note: when using --eval the comma separates KEYS[] from ARGV[] items)\n"
-"\n"
-"When no command is given, redis-cli starts in interactive mode.\n"
-"Type \"help\" in interactive mode for information on available commands\n"
-"and settings.\n"
-"\n");
-    sdsfree(version);
-    exit(1);
-}
-
-static int confirmWithYes(char *msg, int ignore_force) {
-    /* if --cluster-yes option is set and ignore_force is false,
-     * do not prompt for an answer */
-    if (!ignore_force &&
-        (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_YES)) {
-        return 1;
-    }
-
-    printf("%s (type 'yes' to accept): ", msg);
-    fflush(stdout);
-    char buf[4];
-    int nread = read(fileno(stdin),buf,4);
-    buf[3] = '\0';
-    return (nread != 0 && !strcmp("yes", buf));
-}
-
-/* Create an sds array from argv, either as-is or by dequoting every
- * element. When quoted is non-zero, may return a NULL to indicate an
- * invalid quoted string.
- */
-static sds *getSdsArrayFromArgv(int argc, char **argv, int quoted) {
-    sds *res = sds_malloc(sizeof(sds) * argc);
-
-    for (int j = 0; j < argc; j++) {
-        if (quoted) {
-            sds unquoted = unquoteCString(argv[j]);
-            if (!unquoted) {
-                while (--j >= 0) sdsfree(res[j]);
-                sds_free(res);
-                return NULL;
-            }
-            res[j] = unquoted;
-        } else {
-            res[j] = sdsnew(argv[j]);
-        }
-    }
-
-    return res;
-}
-
-static int issueCommandRepeat(int argc, char **argv, long repeat) {
-    while (1) {
-        if (config.cluster_reissue_command || context == NULL ||
-            context->err == REDIS_ERR_IO || context->err == REDIS_ERR_EOF)
-        {
-            if (cliConnect(CC_FORCE) != REDIS_OK) {
-                cliPrintContextError();
-                config.cluster_reissue_command = 0;
-                return REDIS_ERR;
-            }
-        }
-        config.cluster_reissue_command = 0;
-        if (config.cluster_send_asking) {
-            if (cliSendAsking() != REDIS_OK) {
-                cliPrintContextError();
-                return REDIS_ERR;
-            }
-        }
-        if (cliSendCommand(argc,argv,repeat) != REDIS_OK) {
-            cliPrintContextError();
-            return REDIS_ERR;
-        }
-
-        /* Issue the command again if we got redirected in cluster mode */
-        if (config.cluster_mode && config.cluster_reissue_command) {
-            continue;
-        }
-        break;
-    }
-    return REDIS_OK;
-}
-
-static int issueCommand(int argc, char **argv) {
-    return issueCommandRepeat(argc, argv, config.repeat);
-}
-
-/* Split the user provided command into multiple SDS arguments.
- * This function normally uses sdssplitargs() from sds.c which is able
- * to understand "quoted strings", escapes and so forth. However when
- * we are in Lua debugging mode and the "eval" command is used, we want
- * the remaining Lua script (after "e " or "eval ") to be passed verbatim
- * as a single big argument. */
-static sds *cliSplitArgs(char *line, int *argc) {
-    if (config.eval_ldb && (strstr(line,"eval ") == line ||
-                            strstr(line,"e ") == line))
-    {
-        sds *argv = sds_malloc(sizeof(sds)*2);
-        *argc = 2;
-        int len = strlen(line);
-        int elen = line[1] == ' ' ? 2 : 5; /* "e " or "eval "? */
-        argv[0] = sdsnewlen(line,elen-1);
-        argv[1] = sdsnewlen(line+elen,len-elen);
-        return argv;
-    } else {
-        return sdssplitargs(line,argc);
-    }
-}
-
-/* Set the CLI preferences. This function is invoked when an interactive
- * ":command" is called, or when reading ~/.redisclirc file, in order to
- * set user preferences. */
-void cliSetPreferences(char **argv, int argc, int interactive) {
-    if (!strcasecmp(argv[0],":set") && argc >= 2) {
-        if (!strcasecmp(argv[1],"hints")) pref.hints = 1;
-        else if (!strcasecmp(argv[1],"nohints")) pref.hints = 0;
-        else {
-            printf("%sunknown redis-cli preference '%s'\n",
-                interactive ? "" : ".redisclirc: ",
-                argv[1]);
-        }
-    } else {
-        printf("%sunknown redis-cli internal command '%s'\n",
-            interactive ? "" : ".redisclirc: ",
-            argv[0]);
-    }
-}
-
-/* Load the ~/.redisclirc file if any. */
-void cliLoadPreferences(void) {
-    sds rcfile = getDotfilePath(REDIS_CLI_RCFILE_ENV,REDIS_CLI_RCFILE_DEFAULT);
-    if (rcfile == NULL) return;
-    FILE *fp = fopen(rcfile,"r");
-    char buf[1024];
-
-    if (fp) {
-        while(fgets(buf,sizeof(buf),fp) != NULL) {
-            sds *argv;
-            int argc;
-
-            argv = sdssplitargs(buf,&argc);
-            if (argc > 0) cliSetPreferences(argv,argc,0);
-            sdsfreesplitres(argv,argc);
-        }
-        fclose(fp);
-    }
-    sdsfree(rcfile);
-}
-
-static void repl(void) {
-    sds historyfile = NULL;
-    int history = 0;
-    char *line;
-    int argc;
-    sds *argv;
-
-    /* Initialize the help and, if possible, use the COMMAND command in order
-     * to retrieve missing entries. */
-    cliInitHelp();
-    cliIntegrateHelp();
-
-    config.interactive = 1;
-    linenoiseSetMultiLine(1);
-    linenoiseSetCompletionCallback(completionCallback);
-    linenoiseSetHintsCallback(hintsCallback);
-    linenoiseSetFreeHintsCallback(freeHintsCallback);
-
-    /* Only use history and load the rc file when stdin is a tty. */
-    if (isatty(fileno(stdin))) {
-        historyfile = getDotfilePath(REDIS_CLI_HISTFILE_ENV,REDIS_CLI_HISTFILE_DEFAULT);
-        //keep in-memory history always regardless if history file can be determined
-        history = 1;
-        if (historyfile != NULL) {
-            linenoiseHistoryLoad(historyfile);
-        }
-        cliLoadPreferences();
-    }
-
-    cliRefreshPrompt();
-    while((line = linenoise(context ? config.prompt : "not connected> ")) != NULL) {
-        if (line[0] != '\0') {
-            long repeat = 1;
-            int skipargs = 0;
-            char *endptr = NULL;
-
-            argv = cliSplitArgs(line,&argc);
-
-            /* check if we have a repeat command option and
-             * need to skip the first arg */
-            if (argv && argc > 0) {
-                errno = 0;
-                repeat = strtol(argv[0], &endptr, 10);
-                if (argc > 1 && *endptr == '\0') {
-                    if (errno == ERANGE || errno == EINVAL || repeat <= 0) {
-                        fputs("Invalid redis-cli repeat command option value.\n", stdout);
-                        sdsfreesplitres(argv, argc);
-                        linenoiseFree(line);
-                        continue;
-                    }
-                    skipargs = 1;
-                } else {
-                    repeat = 1;
-                }
-            }
-
-            /* Won't save auth or acl setuser commands in history file */
-            int dangerous = 0;
-            if (argv && argc > 0) {
-                if (!strcasecmp(argv[skipargs], "auth")) {
-                    dangerous = 1;
-                } else if (skipargs+1 < argc &&
-                           !strcasecmp(argv[skipargs], "acl") &&
-                           !strcasecmp(argv[skipargs+1], "setuser"))
-                {
-                    dangerous = 1;
-                }
-            }
-
-            if (!dangerous) {
-                if (history) linenoiseHistoryAdd(line);
-                if (historyfile) linenoiseHistorySave(historyfile);
-            }
-
-            if (argv == NULL) {
-                printf("Invalid argument(s)\n");
-                fflush(stdout);
-                linenoiseFree(line);
-                continue;
-            } else if (argc > 0) {
-                if (strcasecmp(argv[0],"quit") == 0 ||
-                    strcasecmp(argv[0],"exit") == 0)
-                {
-                    exit(0);
-                } else if (argv[0][0] == ':') {
-                    cliSetPreferences(argv,argc,1);
-                    sdsfreesplitres(argv,argc);
-                    linenoiseFree(line);
-                    continue;
-                } else if (strcasecmp(argv[0],"restart") == 0) {
-                    if (config.eval) {
-                        config.eval_ldb = 1;
-                        config.output = OUTPUT_RAW;
-                        sdsfreesplitres(argv,argc);
-                        linenoiseFree(line);
-                        return; /* Return to evalMode to restart the session. */
-                    } else {
-                        printf("Use 'restart' only in Lua debugging mode.");
-                    }
-                } else if (argc == 3 && !strcasecmp(argv[0],"connect")) {
-                    sdsfree(config.hostip);
-                    config.hostip = sdsnew(argv[1]);
-                    config.hostport = atoi(argv[2]);
-                    cliRefreshPrompt();
-                    cliConnect(CC_FORCE);
-                } else if (argc == 1 && !strcasecmp(argv[0],"clear")) {
-                    linenoiseClearScreen();
-                } else {
-                    long long start_time = mstime(), elapsed;
-
-                    issueCommandRepeat(argc-skipargs, argv+skipargs, repeat);
-
-                    /* If our debugging session ended, show the EVAL final
-                     * reply. */
-                    if (config.eval_ldb_end) {
-                        config.eval_ldb_end = 0;
-                        cliReadReply(0);
-                        printf("\n(Lua debugging session ended%s)\n\n",
-                            config.eval_ldb_sync ? "" :
-                            " -- dataset changes rolled back");
-                    }
-
-                    elapsed = mstime()-start_time;
-                    if (elapsed >= 500 &&
-                        config.output == OUTPUT_STANDARD)
-                    {
-                        printf("(%.2fs)\n",(double)elapsed/1000);
-                    }
-                }
-            }
-            /* Free the argument vector */
-            sdsfreesplitres(argv,argc);
-        }
-        /* linenoise() returns malloc-ed lines like readline() */
-        linenoiseFree(line);
-    }
-    exit(0);
-}
-
-static int noninteractive(int argc, char **argv) {
-    int retval = 0;
-    sds *sds_args = getSdsArrayFromArgv(argc, argv, config.quoted_input);
-    if (!sds_args) {
-        printf("Invalid quoted string\n");
-        return 1;
-    }
-    if (config.stdinarg) {
-        sds_args = sds_realloc(sds_args, (argc + 1) * sizeof(sds));
-        sds_args[argc] = readArgFromStdin();
-        argc++;
-    }
-
-    retval = issueCommand(argc, sds_args);
-    sdsfreesplitres(sds_args, argc);
-    return retval;
-}
-
-/*------------------------------------------------------------------------------
- * Eval mode
- *--------------------------------------------------------------------------- */
-
-static int evalMode(int argc, char **argv) {
-    sds script = NULL;
-    FILE *fp;
-    char buf[1024];
-    size_t nread;
-    char **argv2;
-    int j, got_comma, keys;
-    int retval = REDIS_OK;
-
-    while(1) {
-        if (config.eval_ldb) {
-            printf(
-            "Lua debugging session started, please use:\n"
-            "quit    -- End the session.\n"
-            "restart -- Restart the script in debug mode again.\n"
-            "help    -- Show Lua script debugging commands.\n\n"
-            );
-        }
-
-        sdsfree(script);
-        script = sdsempty();
-        got_comma = 0;
-        keys = 0;
-
-        /* Load the script from the file, as an sds string. */
-        fp = fopen(config.eval,"r");
-        if (!fp) {
-            fprintf(stderr,
-                "Can't open file '%s': %s\n", config.eval, strerror(errno));
-            exit(1);
-        }
-        while((nread = fread(buf,1,sizeof(buf),fp)) != 0) {
-            script = sdscatlen(script,buf,nread);
-        }
-        fclose(fp);
-
-        /* If we are debugging a script, enable the Lua debugger. */
-        if (config.eval_ldb) {
-            redisReply *reply = redisCommand(context,
-                    config.eval_ldb_sync ?
-                    "SCRIPT DEBUG sync": "SCRIPT DEBUG yes");
-            if (reply) freeReplyObject(reply);
-        }
-
-        /* Create our argument vector */
-        argv2 = zmalloc(sizeof(sds)*(argc+3));
-        argv2[0] = sdsnew("EVAL");
-        argv2[1] = script;
-        for (j = 0; j < argc; j++) {
-            if (!got_comma && argv[j][0] == ',' && argv[j][1] == 0) {
-                got_comma = 1;
-                continue;
-            }
-            argv2[j+3-got_comma] = sdsnew(argv[j]);
-            if (!got_comma) keys++;
-        }
-        argv2[2] = sdscatprintf(sdsempty(),"%d",keys);
-
-        /* Call it */
-        int eval_ldb = config.eval_ldb; /* Save it, may be reverted. */
-        retval = issueCommand(argc+3-got_comma, argv2);
-        if (eval_ldb) {
-            if (!config.eval_ldb) {
-                /* If the debugging session ended immediately, there was an
-                 * error compiling the script. Show it and they don't enter
-                 * the REPL at all. */
-                printf("Eval debugging session can't start:\n");
-                cliReadReply(0);
-                break; /* Return to the caller. */
-            } else {
-                strncpy(config.prompt,"lua debugger> ",sizeof(config.prompt));
-                repl();
-                /* Restart the session if repl() returned. */
-                cliConnect(CC_FORCE);
-                printf("\n");
-            }
-        } else {
-            break; /* Return to the caller. */
-        }
-    }
-    return retval;
-}
-
-/*------------------------------------------------------------------------------
- * Cluster Manager
- *--------------------------------------------------------------------------- */
-
-/* The Cluster Manager global structure */
-static struct clusterManager {
-    list *nodes;    /* List of nodes in the configuration. */
-    list *errors;
-    int unreachable_masters;    /* Masters we are not able to reach. */
-} cluster_manager;
-
-/* Used by clusterManagerFixSlotsCoverage */
-dict *clusterManagerUncoveredSlots = NULL;
-
-typedef struct clusterManagerNode {
-    redisContext *context;
-    sds name;
-    char *ip;
-    int port;
-    uint64_t current_epoch;
-    time_t ping_sent;
-    time_t ping_recv;
-    int flags;
-    list *flags_str; /* Flags string representations */
-    sds replicate;  /* Master ID if node is a slave */
-    int dirty;      /* Node has changes that can be flushed */
-    uint8_t slots[CLUSTER_MANAGER_SLOTS];
-    int slots_count;
-    int replicas_count;
-    list *friends;
-    sds *migrating; /* An array of sds where even strings are slots and odd
-                     * strings are the destination node IDs. */
-    sds *importing; /* An array of sds where even strings are slots and odd
-                     * strings are the source node IDs. */
-    int migrating_count; /* Length of the migrating array (migrating slots*2) */
-    int importing_count; /* Length of the importing array (importing slots*2) */
-    float weight;   /* Weight used by rebalance */
-    int balance;    /* Used by rebalance */
-} clusterManagerNode;
-
-/* Data structure used to represent a sequence of cluster nodes. */
-typedef struct clusterManagerNodeArray {
-    clusterManagerNode **nodes; /* Actual nodes array */
-    clusterManagerNode **alloc; /* Pointer to the allocated memory */
-    int len;                    /* Actual length of the array */
-    int count;                  /* Non-NULL nodes count */
-} clusterManagerNodeArray;
-
-/* Used for the reshard table. */
-typedef struct clusterManagerReshardTableItem {
-    clusterManagerNode *source;
-    int slot;
-} clusterManagerReshardTableItem;
-
-/* Info about a cluster internal link. */
-
-typedef struct clusterManagerLink {
-    sds node_name;
-    sds node_addr;
-    int connected;
-    int handshaking;
-} clusterManagerLink;
-
-static dictType clusterManagerDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* key destructor */
-    dictSdsDestructor,         /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-static dictType clusterManagerLinkDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    dictSdsDestructor,         /* key destructor */
-    dictListDestructor,        /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-typedef int clusterManagerCommandProc(int argc, char **argv);
-typedef int (*clusterManagerOnReplyError)(redisReply *reply,
-    clusterManagerNode *n, int bulk_idx);
-
-/* Cluster Manager helper functions */
-
-static clusterManagerNode *clusterManagerNewNode(char *ip, int port);
-static clusterManagerNode *clusterManagerNodeByName(const char *name);
-static clusterManagerNode *clusterManagerNodeByAbbreviatedName(const char *n);
-static void clusterManagerNodeResetSlots(clusterManagerNode *node);
-static int clusterManagerNodeIsCluster(clusterManagerNode *node, char **err);
-static void clusterManagerPrintNotClusterNodeError(clusterManagerNode *node,
-                                                   char *err);
-static int clusterManagerNodeLoadInfo(clusterManagerNode *node, int opts,
-                                      char **err);
-static int clusterManagerLoadInfoFromNode(clusterManagerNode *node, int opts);
-static int clusterManagerNodeIsEmpty(clusterManagerNode *node, char **err);
-static int clusterManagerGetAntiAffinityScore(clusterManagerNodeArray *ipnodes,
-    int ip_count, clusterManagerNode ***offending, int *offending_len);
-static void clusterManagerOptimizeAntiAffinity(clusterManagerNodeArray *ipnodes,
-    int ip_count);
-static sds clusterManagerNodeInfo(clusterManagerNode *node, int indent);
-static void clusterManagerShowNodes(void);
-static void clusterManagerShowClusterInfo(void);
-static int clusterManagerFlushNodeConfig(clusterManagerNode *node, char **err);
-static void clusterManagerWaitForClusterJoin(void);
-static int clusterManagerCheckCluster(int quiet);
-static void clusterManagerLog(int level, const char* fmt, ...);
-static int clusterManagerIsConfigConsistent(void);
-static dict *clusterManagerGetLinkStatus(void);
-static void clusterManagerOnError(sds err);
-static void clusterManagerNodeArrayInit(clusterManagerNodeArray *array,
-                                        int len);
-static void clusterManagerNodeArrayReset(clusterManagerNodeArray *array);
-static void clusterManagerNodeArrayShift(clusterManagerNodeArray *array,
-                                         clusterManagerNode **nodeptr);
-static void clusterManagerNodeArrayAdd(clusterManagerNodeArray *array,
-                                       clusterManagerNode *node);
-
-/* Cluster Manager commands. */
-
-static int clusterManagerCommandCreate(int argc, char **argv);
-static int clusterManagerCommandAddNode(int argc, char **argv);
-static int clusterManagerCommandDeleteNode(int argc, char **argv);
-static int clusterManagerCommandInfo(int argc, char **argv);
-static int clusterManagerCommandCheck(int argc, char **argv);
-static int clusterManagerCommandFix(int argc, char **argv);
-static int clusterManagerCommandReshard(int argc, char **argv);
-static int clusterManagerCommandRebalance(int argc, char **argv);
-static int clusterManagerCommandSetTimeout(int argc, char **argv);
-static int clusterManagerCommandImport(int argc, char **argv);
-static int clusterManagerCommandCall(int argc, char **argv);
-static int clusterManagerCommandHelp(int argc, char **argv);
-static int clusterManagerCommandBackup(int argc, char **argv);
-
-typedef struct clusterManagerCommandDef {
-    char *name;
-    clusterManagerCommandProc *proc;
-    int arity;
-    char *args;
-    char *options;
-} clusterManagerCommandDef;
-
-clusterManagerCommandDef clusterManagerCommands[] = {
-    {"create", clusterManagerCommandCreate, -2, "host1:port1 ... hostN:portN",
-     "replicas <arg>"},
-    {"check", clusterManagerCommandCheck, -1, "host:port",
-     "search-multiple-owners"},
-    {"info", clusterManagerCommandInfo, -1, "host:port", NULL},
-    {"fix", clusterManagerCommandFix, -1, "host:port",
-     "search-multiple-owners,fix-with-unreachable-masters"},
-    {"reshard", clusterManagerCommandReshard, -1, "host:port",
-     "from <arg>,to <arg>,slots <arg>,yes,timeout <arg>,pipeline <arg>,"
-     "replace"},
-    {"rebalance", clusterManagerCommandRebalance, -1, "host:port",
-     "weight <node1=w1...nodeN=wN>,use-empty-masters,"
-     "timeout <arg>,simulate,pipeline <arg>,threshold <arg>,replace"},
-    {"add-node", clusterManagerCommandAddNode, 2,
-     "new_host:new_port existing_host:existing_port", "slave,master-id <arg>"},
-    {"del-node", clusterManagerCommandDeleteNode, 2, "host:port node_id",NULL},
-    {"call", clusterManagerCommandCall, -2,
-        "host:port command arg arg .. arg", "only-masters,only-replicas"},
-    {"set-timeout", clusterManagerCommandSetTimeout, 2,
-     "host:port milliseconds", NULL},
-    {"import", clusterManagerCommandImport, 1, "host:port",
-     "from <arg>,from-user <arg>,from-pass <arg>,from-askpass,copy,replace"},
-    {"backup", clusterManagerCommandBackup, 2,  "host:port backup_directory",
-     NULL},
-    {"help", clusterManagerCommandHelp, 0, NULL, NULL}
-};
-
-typedef struct clusterManagerOptionDef {
-    char *name;
-    char *desc;
-} clusterManagerOptionDef;
-
-clusterManagerOptionDef clusterManagerOptions[] = {
-    {"--cluster-yes", "Automatic yes to cluster commands prompts"}
-};
-
-static void getRDB(clusterManagerNode *node);
-
-static void createClusterManagerCommand(char *cmdname, int argc, char **argv) {
-    clusterManagerCommand *cmd = &config.cluster_manager_command;
-    cmd->name = cmdname;
-    cmd->argc = argc;
-    cmd->argv = argc ? argv : NULL;
-    if (isColorTerm()) cmd->flags |= CLUSTER_MANAGER_CMD_FLAG_COLOR;
-}
-
-
-static clusterManagerCommandProc *validateClusterManagerCommand(void) {
-    int i, commands_count = sizeof(clusterManagerCommands) /
-                            sizeof(clusterManagerCommandDef);
-    clusterManagerCommandProc *proc = NULL;
-    char *cmdname = config.cluster_manager_command.name;
-    int argc = config.cluster_manager_command.argc;
-    for (i = 0; i < commands_count; i++) {
-        clusterManagerCommandDef cmddef = clusterManagerCommands[i];
-        if (!strcmp(cmddef.name, cmdname)) {
-            if ((cmddef.arity > 0 && argc != cmddef.arity) ||
-                (cmddef.arity < 0 && argc < (cmddef.arity * -1))) {
-                fprintf(stderr, "[ERR] Wrong number of arguments for "
-                                "specified --cluster sub command\n");
-                return NULL;
-            }
-            proc = cmddef.proc;
-        }
-    }
-    if (!proc) fprintf(stderr, "Unknown --cluster subcommand\n");
-    return proc;
-}
-
-static int parseClusterNodeAddress(char *addr, char **ip_ptr, int *port_ptr,
-                                   int *bus_port_ptr)
-{
-    char *c = strrchr(addr, '@');
-    if (c != NULL) {
-        *c = '\0';
-        if (bus_port_ptr != NULL)
-            *bus_port_ptr = atoi(c + 1);
-    }
-    c = strrchr(addr, ':');
-    if (c != NULL) {
-        *c = '\0';
-        *ip_ptr = addr;
-        *port_ptr = atoi(++c);
-    } else return 0;
-    return 1;
-}
-
-/* Get host ip and port from command arguments. If only one argument has
- * been provided it must be in the form of 'ip:port', elsewhere
- * the first argument must be the ip and the second one the port.
- * If host and port can be detected, it returns 1 and it stores host and
- * port into variables referenced by'ip_ptr' and 'port_ptr' pointers,
- * elsewhere it returns 0. */
-static int getClusterHostFromCmdArgs(int argc, char **argv,
-                                     char **ip_ptr, int *port_ptr) {
-    int port = 0;
-    char *ip = NULL;
-    if (argc == 1) {
-        char *addr = argv[0];
-        if (!parseClusterNodeAddress(addr, &ip, &port, NULL)) return 0;
-    } else {
-        ip = argv[0];
-        port = atoi(argv[1]);
-    }
-    if (!ip || !port) return 0;
-    else {
-        *ip_ptr = ip;
-        *port_ptr = port;
-    }
-    return 1;
-}
-
-static void freeClusterManagerNodeFlags(list *flags) {
-    listIter li;
-    listNode *ln;
-    listRewind(flags, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        sds flag = ln->value;
-        sdsfree(flag);
-    }
-    listRelease(flags);
-}
-
-static void freeClusterManagerNode(clusterManagerNode *node) {
-    if (node->context != NULL) redisFree(node->context);
-    if (node->friends != NULL) {
-        listIter li;
-        listNode *ln;
-        listRewind(node->friends,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *fn = ln->value;
-            freeClusterManagerNode(fn);
-        }
-        listRelease(node->friends);
-        node->friends = NULL;
-    }
-    if (node->name != NULL) sdsfree(node->name);
-    if (node->replicate != NULL) sdsfree(node->replicate);
-    if ((node->flags & CLUSTER_MANAGER_FLAG_FRIEND) && node->ip)
-        sdsfree(node->ip);
-    int i;
-    if (node->migrating != NULL) {
-        for (i = 0; i < node->migrating_count; i++) sdsfree(node->migrating[i]);
-        zfree(node->migrating);
-    }
-    if (node->importing != NULL) {
-        for (i = 0; i < node->importing_count; i++) sdsfree(node->importing[i]);
-        zfree(node->importing);
-    }
-    if (node->flags_str != NULL) {
-        freeClusterManagerNodeFlags(node->flags_str);
-        node->flags_str = NULL;
-    }
-    zfree(node);
-}
-
-static void freeClusterManager(void) {
-    listIter li;
-    listNode *ln;
-    if (cluster_manager.nodes != NULL) {
-        listRewind(cluster_manager.nodes,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            freeClusterManagerNode(n);
-        }
-        listRelease(cluster_manager.nodes);
-        cluster_manager.nodes = NULL;
-    }
-    if (cluster_manager.errors != NULL) {
-        listRewind(cluster_manager.errors,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            sds err = ln->value;
-            sdsfree(err);
-        }
-        listRelease(cluster_manager.errors);
-        cluster_manager.errors = NULL;
-    }
-    if (clusterManagerUncoveredSlots != NULL)
-        dictRelease(clusterManagerUncoveredSlots);
-}
-
-static clusterManagerNode *clusterManagerNewNode(char *ip, int port) {
-    clusterManagerNode *node = zmalloc(sizeof(*node));
-    node->context = NULL;
-    node->name = NULL;
-    node->ip = ip;
-    node->port = port;
-    node->current_epoch = 0;
-    node->ping_sent = 0;
-    node->ping_recv = 0;
-    node->flags = 0;
-    node->flags_str = NULL;
-    node->replicate = NULL;
-    node->dirty = 0;
-    node->friends = NULL;
-    node->migrating = NULL;
-    node->importing = NULL;
-    node->migrating_count = 0;
-    node->importing_count = 0;
-    node->replicas_count = 0;
-    node->weight = 1.0f;
-    node->balance = 0;
-    clusterManagerNodeResetSlots(node);
-    return node;
-}
-
-static sds clusterManagerGetNodeRDBFilename(clusterManagerNode *node) {
-    assert(config.cluster_manager_command.backup_dir);
-    sds filename = sdsnew(config.cluster_manager_command.backup_dir);
-    if (filename[sdslen(filename) - 1] != '/')
-        filename = sdscat(filename, "/");
-    filename = sdscatprintf(filename, "redis-node-%s-%d-%s.rdb", node->ip,
-                            node->port, node->name);
-    return filename;
-}
-
-/* Check whether reply is NULL or its type is REDIS_REPLY_ERROR. In the
- * latest case, if the 'err' arg is not NULL, it gets allocated with a copy
- * of reply error (it's up to the caller function to free it), elsewhere
- * the error is directly printed. */
-static int clusterManagerCheckRedisReply(clusterManagerNode *n,
-                                         redisReply *r, char **err)
-{
-    int is_err = 0;
-    if (!r || (is_err = (r->type == REDIS_REPLY_ERROR))) {
-        if (is_err) {
-            if (err != NULL) {
-                *err = zmalloc((r->len + 1) * sizeof(char));
-                strcpy(*err, r->str);
-            } else CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, r->str);
-        }
-        return 0;
-    }
-    return 1;
-}
-
-/* Call MULTI command on a cluster node. */
-static int clusterManagerStartTransaction(clusterManagerNode *node) {
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "MULTI");
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-/* Call EXEC command on a cluster node. */
-static int clusterManagerExecTransaction(clusterManagerNode *node,
-                                         clusterManagerOnReplyError onerror)
-{
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "EXEC");
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (success) {
-        if (reply->type != REDIS_REPLY_ARRAY) {
-            success = 0;
-            goto cleanup;
-        }
-        size_t i;
-        for (i = 0; i < reply->elements; i++) {
-            redisReply *r = reply->element[i];
-            char *err = NULL;
-            success = clusterManagerCheckRedisReply(node, r, &err);
-            if (!success && onerror) success = onerror(r, node, i);
-            if (err) {
-                if (!success)
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-                zfree(err);
-            }
-            if (!success) break;
-        }
-    }
-cleanup:
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-static int clusterManagerNodeConnect(clusterManagerNode *node) {
-    if (node->context) redisFree(node->context);
-    node->context = redisConnect(node->ip, node->port);
-    if (!node->context->err && config.tls) {
-        const char *err = NULL;
-        if (cliSecureConnection(node->context, config.sslconfig, &err) == REDIS_ERR && err) {
-            fprintf(stderr,"TLS Error: %s\n", err);
-            redisFree(node->context);
-            node->context = NULL;
-            return 0;
-        }
-    }
-    if (node->context->err) {
-        fprintf(stderr,"Could not connect to Redis at ");
-        fprintf(stderr,"%s:%d: %s\n", node->ip, node->port,
-                node->context->errstr);
-        redisFree(node->context);
-        node->context = NULL;
-        return 0;
-    }
-    /* Set aggressive KEEP_ALIVE socket option in the Redis context socket
-     * in order to prevent timeouts caused by the execution of long
-     * commands. At the same time this improves the detection of real
-     * errors. */
-    anetKeepAlive(NULL, node->context->fd, REDIS_CLI_KEEPALIVE_INTERVAL);
-    if (config.auth) {
-        redisReply *reply;
-        if (config.user == NULL)
-            reply = redisCommand(node->context,"AUTH %s", config.auth);
-        else
-            reply = redisCommand(node->context,"AUTH %s %s",
-                                 config.user,config.auth);
-        int ok = clusterManagerCheckRedisReply(node, reply, NULL);
-        if (reply != NULL) freeReplyObject(reply);
-        if (!ok) return 0;
-    }
-    return 1;
-}
-
-static void clusterManagerRemoveNodeFromList(list *nodelist,
-                                             clusterManagerNode *node) {
-    listIter li;
-    listNode *ln;
-    listRewind(nodelist, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        if (node == ln->value) {
-            listDelNode(nodelist, ln);
-            break;
-        }
-    }
-}
-
-/* Return the node with the specified name (ID) or NULL. */
-static clusterManagerNode *clusterManagerNodeByName(const char *name) {
-    if (cluster_manager.nodes == NULL) return NULL;
-    clusterManagerNode *found = NULL;
-    sds lcname = sdsempty();
-    lcname = sdscpy(lcname, name);
-    sdstolower(lcname);
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->name && !sdscmp(n->name, lcname)) {
-            found = n;
-            break;
-        }
-    }
-    sdsfree(lcname);
-    return found;
-}
-
-/* Like clusterManagerNodeByName but the specified name can be just the first
- * part of the node ID as long as the prefix in unique across the
- * cluster.
- */
-static clusterManagerNode *clusterManagerNodeByAbbreviatedName(const char*name)
-{
-    if (cluster_manager.nodes == NULL) return NULL;
-    clusterManagerNode *found = NULL;
-    sds lcname = sdsempty();
-    lcname = sdscpy(lcname, name);
-    sdstolower(lcname);
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->name &&
-            strstr(n->name, lcname) == n->name) {
-            found = n;
-            break;
-        }
-    }
-    sdsfree(lcname);
-    return found;
-}
-
-static void clusterManagerNodeResetSlots(clusterManagerNode *node) {
-    memset(node->slots, 0, sizeof(node->slots));
-    node->slots_count = 0;
-}
-
-/* Call "INFO" redis command on the specified node and return the reply. */
-static redisReply *clusterManagerGetNodeRedisInfo(clusterManagerNode *node,
-                                                  char **err)
-{
-    redisReply *info = CLUSTER_MANAGER_COMMAND(node, "INFO");
-    if (err != NULL) *err = NULL;
-    if (info == NULL) return NULL;
-    if (info->type == REDIS_REPLY_ERROR) {
-        if (err != NULL) {
-            *err = zmalloc((info->len + 1) * sizeof(char));
-            strcpy(*err, info->str);
-        }
-        freeReplyObject(info);
-        return  NULL;
-    }
-    return info;
-}
-
-static int clusterManagerNodeIsCluster(clusterManagerNode *node, char **err) {
-    redisReply *info = clusterManagerGetNodeRedisInfo(node, err);
-    if (info == NULL) return 0;
-    int is_cluster = (int) getLongInfoField(info->str, "cluster_enabled");
-    freeReplyObject(info);
-    return is_cluster;
-}
-
-/* Checks whether the node is empty. Node is considered not-empty if it has
- * some key or if it already knows other nodes */
-static int clusterManagerNodeIsEmpty(clusterManagerNode *node, char **err) {
-    redisReply *info = clusterManagerGetNodeRedisInfo(node, err);
-    int is_empty = 1;
-    if (info == NULL) return 0;
-    if (strstr(info->str, "db0:") != NULL) {
-        is_empty = 0;
-        goto result;
-    }
-    freeReplyObject(info);
-    info = CLUSTER_MANAGER_COMMAND(node, "CLUSTER INFO");
-    if (err != NULL) *err = NULL;
-    if (!clusterManagerCheckRedisReply(node, info, err)) {
-        is_empty = 0;
-        goto result;
-    }
-    long known_nodes = getLongInfoField(info->str, "cluster_known_nodes");
-    is_empty = (known_nodes == 1);
-result:
-    freeReplyObject(info);
-    return is_empty;
-}
-
-/* Return the anti-affinity score, which is a measure of the amount of
- * violations of anti-affinity in the current cluster layout, that is, how
- * badly the masters and slaves are distributed in the different IP
- * addresses so that slaves of the same master are not in the master
- * host and are also in different hosts.
- *
- * The score is calculated as follows:
- *
- * SAME_AS_MASTER = 10000 * each slave in the same IP of its master.
- * SAME_AS_SLAVE  = 1 * each slave having the same IP as another slave
-                      of the same master.
- * FINAL_SCORE = SAME_AS_MASTER + SAME_AS_SLAVE
- *
- * So a greater score means a worse anti-affinity level, while zero
- * means perfect anti-affinity.
- *
- * The anti affinity optimizator will try to get a score as low as
- * possible. Since we do not want to sacrifice the fact that slaves should
- * not be in the same host as the master, we assign 10000 times the score
- * to this violation, so that we'll optimize for the second factor only
- * if it does not impact the first one.
- *
- * The ipnodes argument is an array of clusterManagerNodeArray, one for
- * each IP, while ip_count is the total number of IPs in the configuration.
- *
- * The function returns the above score, and the list of
- * offending slaves can be stored into the 'offending' argument,
- * so that the optimizer can try changing the configuration of the
- * slaves violating the anti-affinity goals. */
-static int clusterManagerGetAntiAffinityScore(clusterManagerNodeArray *ipnodes,
-    int ip_count, clusterManagerNode ***offending, int *offending_len)
-{
-    int score = 0, i, j;
-    int node_len = cluster_manager.nodes->len;
-    clusterManagerNode **offending_p = NULL;
-    if (offending != NULL) {
-        *offending = zcalloc(node_len * sizeof(clusterManagerNode*));
-        offending_p = *offending;
-    }
-    /* For each set of nodes in the same host, split by
-     * related nodes (masters and slaves which are involved in
-     * replication of each other) */
-    for (i = 0; i < ip_count; i++) {
-        clusterManagerNodeArray *node_array = &(ipnodes[i]);
-        dict *related = dictCreate(&clusterManagerDictType, NULL);
-        char *ip = NULL;
-        for (j = 0; j < node_array->len; j++) {
-            clusterManagerNode *node = node_array->nodes[j];
-            if (node == NULL) continue;
-            if (!ip) ip = node->ip;
-            sds types;
-            /* We always use the Master ID as key. */
-            sds key = (!node->replicate ? node->name : node->replicate);
-            assert(key != NULL);
-            dictEntry *entry = dictFind(related, key);
-            if (entry) types = sdsdup((sds) dictGetVal(entry));
-            else types = sdsempty();
-            /* Master type 'm' is always set as the first character of the
-             * types string. */
-            if (node->replicate) types = sdscat(types, "s");
-            else {
-                sds s = sdscatsds(sdsnew("m"), types);
-                sdsfree(types);
-                types = s;
-            }
-            dictReplace(related, key, types);
-        }
-        /* Now it's trivial to check, for each related group having the
-         * same host, what is their local score. */
-        dictIterator *iter = dictGetIterator(related);
-        dictEntry *entry;
-        while ((entry = dictNext(iter)) != NULL) {
-            sds types = (sds) dictGetVal(entry);
-            sds name = (sds) dictGetKey(entry);
-            int typeslen = sdslen(types);
-            if (typeslen < 2) continue;
-            if (types[0] == 'm') score += (10000 * (typeslen - 1));
-            else score += (1 * typeslen);
-            if (offending == NULL) continue;
-            /* Populate the list of offending nodes. */
-            listIter li;
-            listNode *ln;
-            listRewind(cluster_manager.nodes, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                clusterManagerNode *n = ln->value;
-                if (n->replicate == NULL) continue;
-                if (!strcmp(n->replicate, name) && !strcmp(n->ip, ip)) {
-                    *(offending_p++) = n;
-                    if (offending_len != NULL) (*offending_len)++;
-                    break;
-                }
-            }
-        }
-        //if (offending_len != NULL) *offending_len = offending_p - *offending;
-        dictReleaseIterator(iter);
-        dictRelease(related);
-    }
-    return score;
-}
-
-static void clusterManagerOptimizeAntiAffinity(clusterManagerNodeArray *ipnodes,
-    int ip_count)
-{
-    clusterManagerNode **offenders = NULL;
-    int score = clusterManagerGetAntiAffinityScore(ipnodes, ip_count,
-                                                   NULL, NULL);
-    if (score == 0) goto cleanup;
-    clusterManagerLogInfo(">>> Trying to optimize slaves allocation "
-                          "for anti-affinity\n");
-    int node_len = cluster_manager.nodes->len;
-    int maxiter = 500 * node_len; // Effort is proportional to cluster size...
-    srand(time(NULL));
-    while (maxiter > 0) {
-        int offending_len = 0;
-        if (offenders != NULL) {
-            zfree(offenders);
-            offenders = NULL;
-        }
-        score = clusterManagerGetAntiAffinityScore(ipnodes,
-                                                   ip_count,
-                                                   &offenders,
-                                                   &offending_len);
-        if (score == 0 || offending_len == 0) break; // Optimal anti affinity reached
-        /* We'll try to randomly swap a slave's assigned master causing
-         * an affinity problem with another random slave, to see if we
-         * can improve the affinity. */
-        int rand_idx = rand() % offending_len;
-        clusterManagerNode *first = offenders[rand_idx],
-                           *second = NULL;
-        clusterManagerNode **other_replicas = zcalloc((node_len - 1) *
-                                                      sizeof(*other_replicas));
-        int other_replicas_count = 0;
-        listIter li;
-        listNode *ln;
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n != first && n->replicate != NULL)
-                other_replicas[other_replicas_count++] = n;
-        }
-        if (other_replicas_count == 0) {
-            zfree(other_replicas);
-            break;
-        }
-        rand_idx = rand() % other_replicas_count;
-        second = other_replicas[rand_idx];
-        char *first_master = first->replicate,
-             *second_master = second->replicate;
-        first->replicate = second_master, first->dirty = 1;
-        second->replicate = first_master, second->dirty = 1;
-        int new_score = clusterManagerGetAntiAffinityScore(ipnodes,
-                                                           ip_count,
-                                                           NULL, NULL);
-        /* If the change actually makes thing worse, revert. Otherwise
-         * leave as it is because the best solution may need a few
-         * combined swaps. */
-        if (new_score > score) {
-            first->replicate = first_master;
-            second->replicate = second_master;
-        }
-        zfree(other_replicas);
-        maxiter--;
-    }
-    score = clusterManagerGetAntiAffinityScore(ipnodes, ip_count, NULL, NULL);
-    char *msg;
-    int perfect = (score == 0);
-    int log_level = (perfect ? CLUSTER_MANAGER_LOG_LVL_SUCCESS :
-                               CLUSTER_MANAGER_LOG_LVL_WARN);
-    if (perfect) msg = "[OK] Perfect anti-affinity obtained!";
-    else if (score >= 10000)
-        msg = ("[WARNING] Some slaves are in the same host as their master");
-    else
-        msg=("[WARNING] Some slaves of the same master are in the same host");
-    clusterManagerLog(log_level, "%s\n", msg);
-cleanup:
-    zfree(offenders);
-}
-
-/* Return a representable string of the node's flags */
-static sds clusterManagerNodeFlagString(clusterManagerNode *node) {
-    sds flags = sdsempty();
-    if (!node->flags_str) return flags;
-    int empty = 1;
-    listIter li;
-    listNode *ln;
-    listRewind(node->flags_str, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        sds flag = ln->value;
-        if (strcmp(flag, "myself") == 0) continue;
-        if (!empty) flags = sdscat(flags, ",");
-        flags = sdscatfmt(flags, "%S", flag);
-        empty = 0;
-    }
-    return flags;
-}
-
-/* Return a representable string of the node's slots */
-static sds clusterManagerNodeSlotsString(clusterManagerNode *node) {
-    sds slots = sdsempty();
-    int first_range_idx = -1, last_slot_idx = -1, i;
-    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
-        int has_slot = node->slots[i];
-        if (has_slot) {
-            if (first_range_idx == -1) {
-                if (sdslen(slots)) slots = sdscat(slots, ",");
-                first_range_idx = i;
-                slots = sdscatfmt(slots, "[%u", i);
-            }
-            last_slot_idx = i;
-        } else {
-            if (last_slot_idx >= 0) {
-                if (first_range_idx == last_slot_idx)
-                    slots = sdscat(slots, "]");
-                else slots = sdscatfmt(slots, "-%u]", last_slot_idx);
-            }
-            last_slot_idx = -1;
-            first_range_idx = -1;
-        }
-    }
-    if (last_slot_idx >= 0) {
-        if (first_range_idx == last_slot_idx) slots = sdscat(slots, "]");
-        else slots = sdscatfmt(slots, "-%u]", last_slot_idx);
-    }
-    return slots;
-}
-
-static sds clusterManagerNodeGetJSON(clusterManagerNode *node,
-                                     unsigned long error_count)
-{
-    sds json = sdsempty();
-    sds replicate = sdsempty();
-    if (node->replicate)
-        replicate = sdscatprintf(replicate, "\"%s\"", node->replicate);
-    else
-        replicate = sdscat(replicate, "null");
-    sds slots = clusterManagerNodeSlotsString(node);
-    sds flags = clusterManagerNodeFlagString(node);
-    char *p = slots;
-    while ((p = strchr(p, '-')) != NULL)
-        *(p++) = ',';
-    json = sdscatprintf(json,
-        "  {\n"
-        "    \"name\": \"%s\",\n"
-        "    \"host\": \"%s\",\n"
-        "    \"port\": %d,\n"
-        "    \"replicate\": %s,\n"
-        "    \"slots\": [%s],\n"
-        "    \"slots_count\": %d,\n"
-        "    \"flags\": \"%s\",\n"
-        "    \"current_epoch\": %llu",
-        node->name,
-        node->ip,
-        node->port,
-        replicate,
-        slots,
-        node->slots_count,
-        flags,
-        (unsigned long long)node->current_epoch
-    );
-    if (error_count > 0) {
-        json = sdscatprintf(json, ",\n    \"cluster_errors\": %lu",
-                            error_count);
-    }
-    if (node->migrating_count > 0 && node->migrating != NULL) {
-        int i = 0;
-        sds migrating = sdsempty();
-        for (; i < node->migrating_count; i += 2) {
-            sds slot = node->migrating[i];
-            sds dest = node->migrating[i + 1];
-            if (slot && dest) {
-                if (sdslen(migrating) > 0) migrating = sdscat(migrating, ",");
-                migrating = sdscatfmt(migrating, "\"%S\": \"%S\"", slot, dest);
-            }
-        }
-        if (sdslen(migrating) > 0)
-            json = sdscatfmt(json, ",\n    \"migrating\": {%S}", migrating);
-        sdsfree(migrating);
-    }
-    if (node->importing_count > 0 && node->importing != NULL) {
-        int i = 0;
-        sds importing = sdsempty();
-        for (; i < node->importing_count; i += 2) {
-            sds slot = node->importing[i];
-            sds from = node->importing[i + 1];
-            if (slot && from) {
-                if (sdslen(importing) > 0) importing = sdscat(importing, ",");
-                importing = sdscatfmt(importing, "\"%S\": \"%S\"", slot, from);
-            }
-        }
-        if (sdslen(importing) > 0)
-            json = sdscatfmt(json, ",\n    \"importing\": {%S}", importing);
-        sdsfree(importing);
-    }
-    json = sdscat(json, "\n  }");
-    sdsfree(replicate);
-    sdsfree(slots);
-    sdsfree(flags);
-    return json;
-}
-
-
-/* -----------------------------------------------------------------------------
- * Key space handling
- * -------------------------------------------------------------------------- */
-
-/* We have 16384 hash slots. The hash slot of a given key is obtained
- * as the least significant 14 bits of the crc16 of the key.
- *
- * However if the key contains the {...} pattern, only the part between
- * { and } is hashed. This may be useful in the future to force certain
- * keys to be in the same node (assuming no resharding is in progress). */
-static unsigned int clusterManagerKeyHashSlot(char *key, int keylen) {
-    int s, e; /* start-end indexes of { and } */
-
-    for (s = 0; s < keylen; s++)
-        if (key[s] == '{') break;
-
-    /* No '{' ? Hash the whole key. This is the base case. */
-    if (s == keylen) return crc16(key,keylen) & 0x3FFF;
-
-    /* '{' found? Check if we have the corresponding '}'. */
-    for (e = s+1; e < keylen; e++)
-        if (key[e] == '}') break;
-
-    /* No '}' or nothing between {} ? Hash the whole key. */
-    if (e == keylen || e == s+1) return crc16(key,keylen) & 0x3FFF;
-
-    /* If we are here there is both a { and a } on its right. Hash
-     * what is in the middle between { and }. */
-    return crc16(key+s+1,e-s-1) & 0x3FFF;
-}
-
-/* Return a string representation of the cluster node. */
-static sds clusterManagerNodeInfo(clusterManagerNode *node, int indent) {
-    sds info = sdsempty();
-    sds spaces = sdsempty();
-    int i;
-    for (i = 0; i < indent; i++) spaces = sdscat(spaces, " ");
-    if (indent) info = sdscat(info, spaces);
-    int is_master = !(node->flags & CLUSTER_MANAGER_FLAG_SLAVE);
-    char *role = (is_master ? "M" : "S");
-    sds slots = NULL;
-    if (node->dirty && node->replicate != NULL)
-        info = sdscatfmt(info, "S: %S %s:%u", node->name, node->ip, node->port);
-    else {
-        slots = clusterManagerNodeSlotsString(node);
-        sds flags = clusterManagerNodeFlagString(node);
-        info = sdscatfmt(info, "%s: %S %s:%u\n"
-                               "%s   slots:%S (%u slots) "
-                               "%S",
-                               role, node->name, node->ip, node->port, spaces,
-                               slots, node->slots_count, flags);
-        sdsfree(slots);
-        sdsfree(flags);
-    }
-    if (node->replicate != NULL)
-        info = sdscatfmt(info, "\n%s   replicates %S", spaces, node->replicate);
-    else if (node->replicas_count)
-        info = sdscatfmt(info, "\n%s   %U additional replica(s)",
-                         spaces, node->replicas_count);
-    sdsfree(spaces);
-    return info;
-}
-
-static void clusterManagerShowNodes(void) {
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        sds info = clusterManagerNodeInfo(node, 0);
-        printf("%s\n", (char *) info);
-        sdsfree(info);
-    }
-}
-
-static void clusterManagerShowClusterInfo(void) {
-    int masters = 0;
-    int keys = 0;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        if (!(node->flags & CLUSTER_MANAGER_FLAG_SLAVE)) {
-            if (!node->name) continue;
-            int replicas = 0;
-            int dbsize = -1;
-            char name[9];
-            memcpy(name, node->name, 8);
-            name[8] = '\0';
-            listIter ri;
-            listNode *rn;
-            listRewind(cluster_manager.nodes, &ri);
-            while ((rn = listNext(&ri)) != NULL) {
-                clusterManagerNode *n = rn->value;
-                if (n == node || !(n->flags & CLUSTER_MANAGER_FLAG_SLAVE))
-                    continue;
-                if (n->replicate && !strcmp(n->replicate, node->name))
-                    replicas++;
-            }
-            redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "DBSIZE");
-            if (reply != NULL && reply->type == REDIS_REPLY_INTEGER)
-                dbsize = reply->integer;
-            if (dbsize < 0) {
-                char *err = "";
-                if (reply != NULL && reply->type == REDIS_REPLY_ERROR)
-                    err = reply->str;
-                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-                if (reply != NULL) freeReplyObject(reply);
-                return;
-            };
-            if (reply != NULL) freeReplyObject(reply);
-            printf("%s:%d (%s...) -> %d keys | %d slots | %d slaves.\n",
-                   node->ip, node->port, name, dbsize,
-                   node->slots_count, replicas);
-            masters++;
-            keys += dbsize;
-        }
-    }
-    clusterManagerLogOk("[OK] %d keys in %d masters.\n", keys, masters);
-    float keys_per_slot = keys / (float) CLUSTER_MANAGER_SLOTS;
-    printf("%.2f keys per slot on average.\n", keys_per_slot);
-}
-
-/* Flush dirty slots configuration of the node by calling CLUSTER ADDSLOTS */
-static int clusterManagerAddSlots(clusterManagerNode *node, char**err)
-{
-    redisReply *reply = NULL;
-    void *_reply = NULL;
-    int success = 1;
-    /* First two args are used for the command itself. */
-    int argc = node->slots_count + 2;
-    sds *argv = zmalloc(argc * sizeof(*argv));
-    size_t *argvlen = zmalloc(argc * sizeof(*argvlen));
-    argv[0] = "CLUSTER";
-    argv[1] = "ADDSLOTS";
-    argvlen[0] = 7;
-    argvlen[1] = 8;
-    *err = NULL;
-    int i, argv_idx = 2;
-    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
-        if (argv_idx >= argc) break;
-        if (node->slots[i]) {
-            argv[argv_idx] = sdsfromlonglong((long long) i);
-            argvlen[argv_idx] = sdslen(argv[argv_idx]);
-            argv_idx++;
-        }
-    }
-    if (!argv_idx) {
-        success = 0;
-        goto cleanup;
-    }
-    redisAppendCommandArgv(node->context,argc,(const char**)argv,argvlen);
-    if (redisGetReply(node->context, &_reply) != REDIS_OK) {
-        success = 0;
-        goto cleanup;
-    }
-    reply = (redisReply*) _reply;
-    success = clusterManagerCheckRedisReply(node, reply, err);
-cleanup:
-    zfree(argvlen);
-    if (argv != NULL) {
-        for (i = 2; i < argc; i++) sdsfree(argv[i]);
-        zfree(argv);
-    }
-    if (reply != NULL) freeReplyObject(reply);
-    return success;
-}
-
-/* Get the node the slot is assigned to from the point of view of node *n.
- * If the slot is unassigned or if the reply is an error, return NULL.
- * Use the **err argument in order to check wether the slot is unassigned
- * or the reply resulted in an error. */
-static clusterManagerNode *clusterManagerGetSlotOwner(clusterManagerNode *n,
-                                                      int slot, char **err)
-{
-    assert(slot >= 0 && slot < CLUSTER_MANAGER_SLOTS);
-    clusterManagerNode *owner = NULL;
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(n, "CLUSTER SLOTS");
-    if (clusterManagerCheckRedisReply(n, reply, err)) {
-        assert(reply->type == REDIS_REPLY_ARRAY);
-        size_t i;
-        for (i = 0; i < reply->elements; i++) {
-            redisReply *r = reply->element[i];
-            assert(r->type == REDIS_REPLY_ARRAY && r->elements >= 3);
-            int from, to;
-            from = r->element[0]->integer;
-            to = r->element[1]->integer;
-            if (slot < from || slot > to) continue;
-            redisReply *nr =  r->element[2];
-            assert(nr->type == REDIS_REPLY_ARRAY && nr->elements >= 2);
-            char *name = NULL;
-            if (nr->elements >= 3)
-                name =  nr->element[2]->str;
-            if (name != NULL)
-                owner = clusterManagerNodeByName(name);
-            else {
-                char *ip = nr->element[0]->str;
-                assert(ip != NULL);
-                int port = (int) nr->element[1]->integer;
-                listIter li;
-                listNode *ln;
-                listRewind(cluster_manager.nodes, &li);
-                while ((ln = listNext(&li)) != NULL) {
-                    clusterManagerNode *nd = ln->value;
-                    if (strcmp(nd->ip, ip) == 0 && port == nd->port) {
-                        owner = nd;
-                        break;
-                    }
-                }
-            }
-            if (owner) break;
-        }
-    }
-    if (reply) freeReplyObject(reply);
-    return owner;
-}
-
-/* Set slot status to "importing" or "migrating" */
-static int clusterManagerSetSlot(clusterManagerNode *node1,
-                                 clusterManagerNode *node2,
-                                 int slot, const char *status, char **err) {
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node1, "CLUSTER "
-                                                "SETSLOT %d %s %s",
-                                                slot, status,
-                                                (char *) node2->name);
-    if (err != NULL) *err = NULL;
-    if (!reply) return 0;
-    int success = 1;
-    if (reply->type == REDIS_REPLY_ERROR) {
-        success = 0;
-        if (err != NULL) {
-            *err = zmalloc((reply->len + 1) * sizeof(char));
-            strcpy(*err, reply->str);
-        } else CLUSTER_MANAGER_PRINT_REPLY_ERROR(node1, reply->str);
-        goto cleanup;
-    }
-cleanup:
-    freeReplyObject(reply);
-    return success;
-}
-
-static int clusterManagerClearSlotStatus(clusterManagerNode *node, int slot) {
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
-        "CLUSTER SETSLOT %d %s", slot, "STABLE");
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-static int clusterManagerDelSlot(clusterManagerNode *node, int slot,
-                                 int ignore_unassigned_err)
-{
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
-        "CLUSTER DELSLOTS %d", slot);
-    char *err = NULL;
-    int success = clusterManagerCheckRedisReply(node, reply, &err);
-    if (!success && reply && reply->type == REDIS_REPLY_ERROR &&
-        ignore_unassigned_err)
-    {
-        char *get_owner_err = NULL;
-        clusterManagerNode *assigned_to =
-            clusterManagerGetSlotOwner(node, slot, &get_owner_err);
-        if (!assigned_to) {
-            if (get_owner_err == NULL) success = 1;
-            else {
-                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, get_owner_err);
-                zfree(get_owner_err);
-            }
-        }
-    }
-    if (!success && err != NULL) {
-        CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-        zfree(err);
-    }
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-static int clusterManagerAddSlot(clusterManagerNode *node, int slot) {
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
-        "CLUSTER ADDSLOTS %d", slot);
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-static signed int clusterManagerCountKeysInSlot(clusterManagerNode *node,
-                                                int slot)
-{
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node,
-        "CLUSTER COUNTKEYSINSLOT %d", slot);
-    int count = -1;
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (success && reply->type == REDIS_REPLY_INTEGER) count = reply->integer;
-    if (reply) freeReplyObject(reply);
-    return count;
-}
-
-static int clusterManagerBumpEpoch(clusterManagerNode *node) {
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER BUMPEPOCH");
-    int success = clusterManagerCheckRedisReply(node, reply, NULL);
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-/* Callback used by clusterManagerSetSlotOwner transaction. It should ignore
- * errors except for ADDSLOTS errors.
- * Return 1 if the error should be ignored. */
-static int clusterManagerOnSetOwnerErr(redisReply *reply,
-    clusterManagerNode *n, int bulk_idx)
-{
-    UNUSED(reply);
-    UNUSED(n);
-    /* Only raise error when ADDSLOTS fail (bulk_idx == 1). */
-    return (bulk_idx != 1);
-}
-
-static int clusterManagerSetSlotOwner(clusterManagerNode *owner,
-                                      int slot,
-                                      int do_clear)
-{
-    int success = clusterManagerStartTransaction(owner);
-    if (!success) return 0;
-    /* Ensure the slot is not already assigned. */
-    clusterManagerDelSlot(owner, slot, 1);
-    /* Add the slot and bump epoch. */
-    clusterManagerAddSlot(owner, slot);
-    if (do_clear) clusterManagerClearSlotStatus(owner, slot);
-    clusterManagerBumpEpoch(owner);
-    success = clusterManagerExecTransaction(owner, clusterManagerOnSetOwnerErr);
-    return success;
-}
-
-/* Get the hash for the values of the specified keys in *keys_reply for the
- * specified nodes *n1 and *n2, by calling DEBUG DIGEST-VALUE redis command
- * on both nodes. Every key with same name on both nodes but having different
- * values will be added to the *diffs list. Return 0 in case of reply
- * error. */
-static int clusterManagerCompareKeysValues(clusterManagerNode *n1,
-                                          clusterManagerNode *n2,
-                                          redisReply *keys_reply,
-                                          list *diffs)
-{
-    size_t i, argc = keys_reply->elements + 2;
-    static const char *hash_zero = "0000000000000000000000000000000000000000";
-    char **argv = zcalloc(argc * sizeof(char *));
-    size_t  *argv_len = zcalloc(argc * sizeof(size_t));
-    argv[0] = "DEBUG";
-    argv_len[0] = 5;
-    argv[1] = "DIGEST-VALUE";
-    argv_len[1] = 12;
-    for (i = 0; i < keys_reply->elements; i++) {
-        redisReply *entry = keys_reply->element[i];
-        int idx = i + 2;
-        argv[idx] = entry->str;
-        argv_len[idx] = entry->len;
-    }
-    int success = 0;
-    void *_reply1 = NULL, *_reply2 = NULL;
-    redisReply *r1 = NULL, *r2 = NULL;
-    redisAppendCommandArgv(n1->context,argc, (const char**)argv,argv_len);
-    success = (redisGetReply(n1->context, &_reply1) == REDIS_OK);
-    if (!success) goto cleanup;
-    r1 = (redisReply *) _reply1;
-    redisAppendCommandArgv(n2->context,argc, (const char**)argv,argv_len);
-    success = (redisGetReply(n2->context, &_reply2) == REDIS_OK);
-    if (!success) goto cleanup;
-    r2 = (redisReply *) _reply2;
-    success = (r1->type != REDIS_REPLY_ERROR && r2->type != REDIS_REPLY_ERROR);
-    if (r1->type == REDIS_REPLY_ERROR) {
-        CLUSTER_MANAGER_PRINT_REPLY_ERROR(n1, r1->str);
-        success = 0;
-    }
-    if (r2->type == REDIS_REPLY_ERROR) {
-        CLUSTER_MANAGER_PRINT_REPLY_ERROR(n2, r2->str);
-        success = 0;
-    }
-    if (!success) goto cleanup;
-    assert(keys_reply->elements == r1->elements &&
-           keys_reply->elements == r2->elements);
-    for (i = 0; i < keys_reply->elements; i++) {
-        char *key = keys_reply->element[i]->str;
-        char *hash1 = r1->element[i]->str;
-        char *hash2 = r2->element[i]->str;
-        /* Ignore keys that don't exist in both nodes. */
-        if (strcmp(hash1, hash_zero) == 0 || strcmp(hash2, hash_zero) == 0)
-            continue;
-        if (strcmp(hash1, hash2) != 0) listAddNodeTail(diffs, key);
-    }
-cleanup:
-    if (r1) freeReplyObject(r1);
-    if (r2) freeReplyObject(r2);
-    zfree(argv);
-    zfree(argv_len);
-    return success;
-}
-
-/* Migrate keys taken from reply->elements. It returns the reply from the
- * MIGRATE command, or NULL if something goes wrong. If the argument 'dots'
- * is not NULL, a dot will be printed for every migrated key. */
-static redisReply *clusterManagerMigrateKeysInReply(clusterManagerNode *source,
-                                                    clusterManagerNode *target,
-                                                    redisReply *reply,
-                                                    int replace, int timeout,
-                                                    char *dots)
-{
-    redisReply *migrate_reply = NULL;
-    char **argv = NULL;
-    size_t *argv_len = NULL;
-    int c = (replace ? 8 : 7);
-    if (config.auth) c += 2;
-    if (config.user) c += 1;
-    size_t argc = c + reply->elements;
-    size_t i, offset = 6; // Keys Offset
-    argv = zcalloc(argc * sizeof(char *));
-    argv_len = zcalloc(argc * sizeof(size_t));
-    char portstr[255];
-    char timeoutstr[255];
-    snprintf(portstr, 10, "%d", target->port);
-    snprintf(timeoutstr, 10, "%d", timeout);
-    argv[0] = "MIGRATE";
-    argv_len[0] = 7;
-    argv[1] = target->ip;
-    argv_len[1] = strlen(target->ip);
-    argv[2] = portstr;
-    argv_len[2] = strlen(portstr);
-    argv[3] = "";
-    argv_len[3] = 0;
-    argv[4] = "0";
-    argv_len[4] = 1;
-    argv[5] = timeoutstr;
-    argv_len[5] = strlen(timeoutstr);
-    if (replace) {
-        argv[offset] = "REPLACE";
-        argv_len[offset] = 7;
-        offset++;
-    }
-    if (config.auth) {
-        if (config.user) {
-            argv[offset] = "AUTH2";
-            argv_len[offset] = 5;
-            offset++;
-            argv[offset] = config.user;
-            argv_len[offset] = strlen(config.user);
-            offset++;
-            argv[offset] = config.auth;
-            argv_len[offset] = strlen(config.auth);
-            offset++;
-        } else {
-            argv[offset] = "AUTH";
-            argv_len[offset] = 4;
-            offset++;
-            argv[offset] = config.auth;
-            argv_len[offset] = strlen(config.auth);
-            offset++;
-        }
-    }
-    argv[offset] = "KEYS";
-    argv_len[offset] = 4;
-    offset++;
-    for (i = 0; i < reply->elements; i++) {
-        redisReply *entry = reply->element[i];
-        size_t idx = i + offset;
-        assert(entry->type == REDIS_REPLY_STRING);
-        argv[idx] = (char *) sdsnewlen(entry->str, entry->len);
-        argv_len[idx] = entry->len;
-        if (dots) dots[i] = '.';
-    }
-    if (dots) dots[reply->elements] = '\0';
-    void *_reply = NULL;
-    redisAppendCommandArgv(source->context,argc,
-                           (const char**)argv,argv_len);
-    int success = (redisGetReply(source->context, &_reply) == REDIS_OK);
-    for (i = 0; i < reply->elements; i++) sdsfree(argv[i + offset]);
-    if (!success) goto cleanup;
-    migrate_reply = (redisReply *) _reply;
-cleanup:
-    zfree(argv);
-    zfree(argv_len);
-    return migrate_reply;
-}
-
-/* Migrate all keys in the given slot from source to target.*/
-static int clusterManagerMigrateKeysInSlot(clusterManagerNode *source,
-                                           clusterManagerNode *target,
-                                           int slot, int timeout,
-                                           int pipeline, int verbose,
-                                           char **err)
-{
-    int success = 1;
-    int do_fix = config.cluster_manager_command.flags &
-                 CLUSTER_MANAGER_CMD_FLAG_FIX;
-    int do_replace = config.cluster_manager_command.flags &
-                     CLUSTER_MANAGER_CMD_FLAG_REPLACE;
-    while (1) {
-        char *dots = NULL;
-        redisReply *reply = NULL, *migrate_reply = NULL;
-        reply = CLUSTER_MANAGER_COMMAND(source, "CLUSTER "
-                                        "GETKEYSINSLOT %d %d", slot,
-                                        pipeline);
-        success = (reply != NULL);
-        if (!success) return 0;
-        if (reply->type == REDIS_REPLY_ERROR) {
-            success = 0;
-            if (err != NULL) {
-                *err = zmalloc((reply->len + 1) * sizeof(char));
-                strcpy(*err, reply->str);
-                CLUSTER_MANAGER_PRINT_REPLY_ERROR(source, *err);
-            }
-            goto next;
-        }
-        assert(reply->type == REDIS_REPLY_ARRAY);
-        size_t count = reply->elements;
-        if (count == 0) {
-            freeReplyObject(reply);
-            break;
-        }
-        if (verbose) dots = zmalloc((count+1) * sizeof(char));
-        /* Calling MIGRATE command. */
-        migrate_reply = clusterManagerMigrateKeysInReply(source, target,
-                                                         reply, 0, timeout,
-                                                         dots);
-        if (migrate_reply == NULL) goto next;
-        if (migrate_reply->type == REDIS_REPLY_ERROR) {
-            int is_busy = strstr(migrate_reply->str, "BUSYKEY") != NULL;
-            int not_served = 0;
-            if (!is_busy) {
-                /* Check if the slot is unassigned (not served) in the
-                 * source node's configuration. */
-                char *get_owner_err = NULL;
-                clusterManagerNode *served_by =
-                    clusterManagerGetSlotOwner(source, slot, &get_owner_err);
-                if (!served_by) {
-                    if (get_owner_err == NULL) not_served = 1;
-                    else {
-                        CLUSTER_MANAGER_PRINT_REPLY_ERROR(source,
-                                                          get_owner_err);
-                        zfree(get_owner_err);
-                    }
-                }
-            }
-            /* Try to handle errors. */
-            if (is_busy || not_served) {
-                /* If the key's slot is not served, try to assign slot
-                 * to the target node. */
-                if (do_fix && not_served) {
-                    clusterManagerLogWarn("*** Slot was not served, setting "
-                                          "owner to node %s:%d.\n",
-                                          target->ip, target->port);
-                    clusterManagerSetSlot(source, target, slot, "node", NULL);
-                }
-                /* If the key already exists in the target node (BUSYKEY),
-                 * check whether its value is the same in both nodes.
-                 * In case of equal values, retry migration with the
-                 * REPLACE option.
-                 * In case of different values:
-                 *  - If the migration is requested by the fix command, stop
-                 *    and warn the user.
-                 *  - In other cases (ie. reshard), proceed only if the user
-                 *    launched the command with the --cluster-replace option.*/
-                if (is_busy) {
-                    clusterManagerLogWarn("\n*** Target key exists\n");
-                    if (!do_replace) {
-                        clusterManagerLogWarn("*** Checking key values on "
-                                              "both nodes...\n");
-                        list *diffs = listCreate();
-                        success = clusterManagerCompareKeysValues(source,
-                            target, reply, diffs);
-                        if (!success) {
-                            clusterManagerLogErr("*** Value check failed!\n");
-                            listRelease(diffs);
-                            goto next;
-                        }
-                        if (listLength(diffs) > 0) {
-                            success = 0;
-                            clusterManagerLogErr(
-                                "*** Found %d key(s) in both source node and "
-                                "target node having different values.\n"
-                                "    Source node: %s:%d\n"
-                                "    Target node: %s:%d\n"
-                                "    Keys(s):\n",
-                                listLength(diffs),
-                                source->ip, source->port,
-                                target->ip, target->port);
-                            listIter dli;
-                            listNode *dln;
-                            listRewind(diffs, &dli);
-                            while((dln = listNext(&dli)) != NULL) {
-                                char *k = dln->value;
-                                clusterManagerLogErr("    - %s\n", k);
-                            }
-                            clusterManagerLogErr("Please fix the above key(s) "
-                                                 "manually and try again "
-                                                 "or relaunch the command \n"
-                                                 "with --cluster-replace "
-                                                 "option to force key "
-                                                 "overriding.\n");
-                            listRelease(diffs);
-                            goto next;
-                        }
-                        listRelease(diffs);
-                    }
-                    clusterManagerLogWarn("*** Replacing target keys...\n");
-                }
-                freeReplyObject(migrate_reply);
-                migrate_reply = clusterManagerMigrateKeysInReply(source,
-                                                                 target,
-                                                                 reply,
-                                                                 is_busy,
-                                                                 timeout,
-                                                                 NULL);
-                success = (migrate_reply != NULL &&
-                           migrate_reply->type != REDIS_REPLY_ERROR);
-            } else success = 0;
-            if (!success) {
-                if (migrate_reply != NULL) {
-                    if (err) {
-                        *err = zmalloc((migrate_reply->len + 1) * sizeof(char));
-                        strcpy(*err, migrate_reply->str);
-                    }
-                    printf("\n");
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(source,
-                                                      migrate_reply->str);
-                }
-                goto next;
-            }
-        }
-        if (verbose) {
-            printf("%s", dots);
-            fflush(stdout);
-        }
-next:
-        if (reply != NULL) freeReplyObject(reply);
-        if (migrate_reply != NULL) freeReplyObject(migrate_reply);
-        if (dots) zfree(dots);
-        if (!success) break;
-    }
-    return success;
-}
-
-/* Move slots between source and target nodes using MIGRATE.
- *
- * Options:
- * CLUSTER_MANAGER_OPT_VERBOSE -- Print a dot for every moved key.
- * CLUSTER_MANAGER_OPT_COLD    -- Move keys without opening slots /
- *                                reconfiguring the nodes.
- * CLUSTER_MANAGER_OPT_UPDATE  -- Update node->slots for source/target nodes.
- * CLUSTER_MANAGER_OPT_QUIET   -- Don't print info messages.
-*/
-static int clusterManagerMoveSlot(clusterManagerNode *source,
-                                  clusterManagerNode *target,
-                                  int slot, int opts,  char**err)
-{
-    if (!(opts & CLUSTER_MANAGER_OPT_QUIET)) {
-        printf("Moving slot %d from %s:%d to %s:%d: ", slot, source->ip,
-               source->port, target->ip, target->port);
-        fflush(stdout);
-    }
-    if (err != NULL) *err = NULL;
-    int pipeline = config.cluster_manager_command.pipeline,
-        timeout = config.cluster_manager_command.timeout,
-        print_dots = (opts & CLUSTER_MANAGER_OPT_VERBOSE),
-        option_cold = (opts & CLUSTER_MANAGER_OPT_COLD),
-        success = 1;
-    if (!option_cold) {
-        success = clusterManagerSetSlot(target, source, slot,
-                                        "importing", err);
-        if (!success) return 0;
-        success = clusterManagerSetSlot(source, target, slot,
-                                        "migrating", err);
-        if (!success) return 0;
-    }
-    success = clusterManagerMigrateKeysInSlot(source, target, slot, timeout,
-                                              pipeline, print_dots, err);
-    if (!(opts & CLUSTER_MANAGER_OPT_QUIET)) printf("\n");
-    if (!success) return 0;
-    /* Set the new node as the owner of the slot in all the known nodes. */
-    if (!option_cold) {
-        listIter li;
-        listNode *ln;
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER "
-                                                    "SETSLOT %d %s %s",
-                                                    slot, "node",
-                                                    target->name);
-            success = (r != NULL);
-            if (!success) return 0;
-            if (r->type == REDIS_REPLY_ERROR) {
-                success = 0;
-                if (err != NULL) {
-                    *err = zmalloc((r->len + 1) * sizeof(char));
-                    strcpy(*err, r->str);
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, *err);
-                }
-            }
-            freeReplyObject(r);
-            if (!success) return 0;
-        }
-    }
-    /* Update the node logical config */
-    if (opts & CLUSTER_MANAGER_OPT_UPDATE) {
-        source->slots[slot] = 0;
-        target->slots[slot] = 1;
-    }
-    return 1;
-}
-
-/* Flush the dirty node configuration by calling replicate for slaves or
- * adding the slots defined in the masters. */
-static int clusterManagerFlushNodeConfig(clusterManagerNode *node, char **err) {
-    if (!node->dirty) return 0;
-    redisReply *reply = NULL;
-    int is_err = 0, success = 1;
-    if (err != NULL) *err = NULL;
-    if (node->replicate != NULL) {
-        reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER REPLICATE %s",
-                                        node->replicate);
-        if (reply == NULL || (is_err = (reply->type == REDIS_REPLY_ERROR))) {
-            if (is_err && err != NULL) {
-                *err = zmalloc((reply->len + 1) * sizeof(char));
-                strcpy(*err, reply->str);
-            }
-            success = 0;
-            /* If the cluster did not already joined it is possible that
-             * the slave does not know the master node yet. So on errors
-             * we return ASAP leaving the dirty flag set, to flush the
-             * config later. */
-            goto cleanup;
-        }
-    } else {
-        int added = clusterManagerAddSlots(node, err);
-        if (!added || *err != NULL) success = 0;
-    }
-    node->dirty = 0;
-cleanup:
-    if (reply != NULL) freeReplyObject(reply);
-    return success;
-}
-
-/* Wait until the cluster configuration is consistent. */
-static void clusterManagerWaitForClusterJoin(void) {
-    printf("Waiting for the cluster to join\n");
-    int counter = 0,
-        check_after = CLUSTER_JOIN_CHECK_AFTER +
-                      (int)(listLength(cluster_manager.nodes) * 0.15f);
-    while(!clusterManagerIsConfigConsistent()) {
-        printf(".");
-        fflush(stdout);
-        sleep(1);
-        if (++counter > check_after) {
-            dict *status = clusterManagerGetLinkStatus();
-            dictIterator *iter = NULL;
-            if (status != NULL && dictSize(status) > 0) {
-                printf("\n");
-                clusterManagerLogErr("Warning: %d node(s) may "
-                                     "be unreachable\n", dictSize(status));
-                iter = dictGetIterator(status);
-                dictEntry *entry;
-                while ((entry = dictNext(iter)) != NULL) {
-                    sds nodeaddr = (sds) dictGetKey(entry);
-                    char *node_ip = NULL;
-                    int node_port = 0, node_bus_port = 0;
-                    list *from = (list *) dictGetVal(entry);
-                    if (parseClusterNodeAddress(nodeaddr, &node_ip,
-                        &node_port, &node_bus_port) && node_bus_port) {
-                        clusterManagerLogErr(" - The port %d of node %s may "
-                                             "be unreachable from:\n",
-                                             node_bus_port, node_ip);
-                    } else {
-                        clusterManagerLogErr(" - Node %s may be unreachable "
-                                             "from:\n", nodeaddr);
-                    }
-                    listIter li;
-                    listNode *ln;
-                    listRewind(from, &li);
-                    while ((ln = listNext(&li)) != NULL) {
-                        sds from_addr = ln->value;
-                        clusterManagerLogErr("   %s\n", from_addr);
-                        sdsfree(from_addr);
-                    }
-                    clusterManagerLogErr("Cluster bus ports must be reachable "
-                                         "by every node.\nRemember that "
-                                         "cluster bus ports are different "
-                                         "from standard instance ports.\n");
-                    listEmpty(from);
-                }
-            }
-            if (iter != NULL) dictReleaseIterator(iter);
-            if (status != NULL) dictRelease(status);
-            counter = 0;
-        }
-    }
-    printf("\n");
-}
-
-/* Load node's cluster configuration by calling "CLUSTER NODES" command.
- * Node's configuration (name, replicate, slots, ...) is then updated.
- * If CLUSTER_MANAGER_OPT_GETFRIENDS flag is set into 'opts' argument,
- * and node already knows other nodes, the node's friends list is populated
- * with the other nodes info. */
-static int clusterManagerNodeLoadInfo(clusterManagerNode *node, int opts,
-                                      char **err)
-{
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
-    int success = 1;
-    *err = NULL;
-    if (!clusterManagerCheckRedisReply(node, reply, err)) {
-        success = 0;
-        goto cleanup;
-    }
-    int getfriends = (opts & CLUSTER_MANAGER_OPT_GETFRIENDS);
-    char *lines = reply->str, *p, *line;
-    while ((p = strstr(lines, "\n")) != NULL) {
-        *p = '\0';
-        line = lines;
-        lines = p + 1;
-        char *name = NULL, *addr = NULL, *flags = NULL, *master_id = NULL,
-             *ping_sent = NULL, *ping_recv = NULL, *config_epoch = NULL,
-             *link_status = NULL;
-        UNUSED(link_status);
-        int i = 0;
-        while ((p = strchr(line, ' ')) != NULL) {
-            *p = '\0';
-            char *token = line;
-            line = p + 1;
-            switch(i++){
-            case 0: name = token; break;
-            case 1: addr = token; break;
-            case 2: flags = token; break;
-            case 3: master_id = token; break;
-            case 4: ping_sent = token; break;
-            case 5: ping_recv = token; break;
-            case 6: config_epoch = token; break;
-            case 7: link_status = token; break;
-            }
-            if (i == 8) break; // Slots
-        }
-        if (!flags) {
-            success = 0;
-            goto cleanup;
-        }
-        int myself = (strstr(flags, "myself") != NULL);
-        clusterManagerNode *currentNode = NULL;
-        if (myself) {
-            node->flags |= CLUSTER_MANAGER_FLAG_MYSELF;
-            currentNode = node;
-            clusterManagerNodeResetSlots(node);
-            if (i == 8) {
-                int remaining = strlen(line);
-                while (remaining > 0) {
-                    p = strchr(line, ' ');
-                    if (p == NULL) p = line + remaining;
-                    remaining -= (p - line);
-
-                    char *slotsdef = line;
-                    *p = '\0';
-                    if (remaining) {
-                        line = p + 1;
-                        remaining--;
-                    } else line = p;
-                    char *dash = NULL;
-                    if (slotsdef[0] == '[') {
-                        slotsdef++;
-                        if ((p = strstr(slotsdef, "->-"))) { // Migrating
-                            *p = '\0';
-                            p += 3;
-                            char *closing_bracket = strchr(p, ']');
-                            if (closing_bracket) *closing_bracket = '\0';
-                            sds slot = sdsnew(slotsdef);
-                            sds dst = sdsnew(p);
-                            node->migrating_count += 2;
-                            node->migrating = zrealloc(node->migrating,
-                                (node->migrating_count * sizeof(sds)));
-                            node->migrating[node->migrating_count - 2] =
-                                slot;
-                            node->migrating[node->migrating_count - 1] =
-                                dst;
-                        }  else if ((p = strstr(slotsdef, "-<-"))) {//Importing
-                            *p = '\0';
-                            p += 3;
-                            char *closing_bracket = strchr(p, ']');
-                            if (closing_bracket) *closing_bracket = '\0';
-                            sds slot = sdsnew(slotsdef);
-                            sds src = sdsnew(p);
-                            node->importing_count += 2;
-                            node->importing = zrealloc(node->importing,
-                                (node->importing_count * sizeof(sds)));
-                            node->importing[node->importing_count - 2] =
-                                slot;
-                            node->importing[node->importing_count - 1] =
-                                src;
-                        }
-                    } else if ((dash = strchr(slotsdef, '-')) != NULL) {
-                        p = dash;
-                        int start, stop;
-                        *p = '\0';
-                        start = atoi(slotsdef);
-                        stop = atoi(p + 1);
-                        node->slots_count += (stop - (start - 1));
-                        while (start <= stop) node->slots[start++] = 1;
-                    } else if (p > slotsdef) {
-                        node->slots[atoi(slotsdef)] = 1;
-                        node->slots_count++;
-                    }
-                }
-            }
-            node->dirty = 0;
-        } else if (!getfriends) {
-            if (!(node->flags & CLUSTER_MANAGER_FLAG_MYSELF)) continue;
-            else break;
-        } else {
-            if (addr == NULL) {
-                fprintf(stderr, "Error: invalid CLUSTER NODES reply\n");
-                success = 0;
-                goto cleanup;
-            }
-            char *c = strrchr(addr, '@');
-            if (c != NULL) *c = '\0';
-            c = strrchr(addr, ':');
-            if (c == NULL) {
-                fprintf(stderr, "Error: invalid CLUSTER NODES reply\n");
-                success = 0;
-                goto cleanup;
-            }
-            *c = '\0';
-            int port = atoi(++c);
-            currentNode = clusterManagerNewNode(sdsnew(addr), port);
-            currentNode->flags |= CLUSTER_MANAGER_FLAG_FRIEND;
-            if (node->friends == NULL) node->friends = listCreate();
-            listAddNodeTail(node->friends, currentNode);
-        }
-        if (name != NULL) {
-            if (currentNode->name) sdsfree(currentNode->name);
-            currentNode->name = sdsnew(name);
-        }
-        if (currentNode->flags_str != NULL)
-            freeClusterManagerNodeFlags(currentNode->flags_str);
-        currentNode->flags_str = listCreate();
-        int flag_len;
-        while ((flag_len = strlen(flags)) > 0) {
-            sds flag = NULL;
-            char *fp = strchr(flags, ',');
-            if (fp) {
-                *fp = '\0';
-                flag = sdsnew(flags);
-                flags = fp + 1;
-            } else {
-                flag = sdsnew(flags);
-                flags += flag_len;
-            }
-            if (strcmp(flag, "noaddr") == 0)
-                currentNode->flags |= CLUSTER_MANAGER_FLAG_NOADDR;
-            else if (strcmp(flag, "disconnected") == 0)
-                currentNode->flags |= CLUSTER_MANAGER_FLAG_DISCONNECT;
-            else if (strcmp(flag, "fail") == 0)
-                currentNode->flags |= CLUSTER_MANAGER_FLAG_FAIL;
-            else if (strcmp(flag, "slave") == 0) {
-                currentNode->flags |= CLUSTER_MANAGER_FLAG_SLAVE;
-                if (master_id != NULL) {
-                    if (currentNode->replicate) sdsfree(currentNode->replicate);
-                    currentNode->replicate = sdsnew(master_id);
-                }
-            }
-            listAddNodeTail(currentNode->flags_str, flag);
-        }
-        if (config_epoch != NULL)
-            currentNode->current_epoch = atoll(config_epoch);
-        if (ping_sent != NULL) currentNode->ping_sent = atoll(ping_sent);
-        if (ping_recv != NULL) currentNode->ping_recv = atoll(ping_recv);
-        if (!getfriends && myself) break;
-    }
-cleanup:
-    if (reply) freeReplyObject(reply);
-    return success;
-}
-
-/* Retrieves info about the cluster using argument 'node' as the starting
- * point. All nodes will be loaded inside the cluster_manager.nodes list.
- * Warning: if something goes wrong, it will free the starting node before
- * returning 0. */
-static int clusterManagerLoadInfoFromNode(clusterManagerNode *node, int opts) {
-    if (node->context == NULL && !clusterManagerNodeConnect(node)) {
-        freeClusterManagerNode(node);
-        return 0;
-    }
-    opts |= CLUSTER_MANAGER_OPT_GETFRIENDS;
-    char *e = NULL;
-    if (!clusterManagerNodeIsCluster(node, &e)) {
-        clusterManagerPrintNotClusterNodeError(node, e);
-        if (e) zfree(e);
-        freeClusterManagerNode(node);
-        return 0;
-    }
-    e = NULL;
-    if (!clusterManagerNodeLoadInfo(node, opts, &e)) {
-        if (e) {
-            CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, e);
-            zfree(e);
-        }
-        freeClusterManagerNode(node);
-        return 0;
-    }
-    listIter li;
-    listNode *ln;
-    if (cluster_manager.nodes != NULL) {
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL)
-            freeClusterManagerNode((clusterManagerNode *) ln->value);
-        listRelease(cluster_manager.nodes);
-    }
-    cluster_manager.nodes = listCreate();
-    listAddNodeTail(cluster_manager.nodes, node);
-    if (node->friends != NULL) {
-        listRewind(node->friends, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *friend = ln->value;
-            if (!friend->ip || !friend->port) goto invalid_friend;
-            if (!friend->context && !clusterManagerNodeConnect(friend))
-                goto invalid_friend;
-            e = NULL;
-            if (clusterManagerNodeLoadInfo(friend, 0, &e)) {
-                if (friend->flags & (CLUSTER_MANAGER_FLAG_NOADDR |
-                                     CLUSTER_MANAGER_FLAG_DISCONNECT |
-                                     CLUSTER_MANAGER_FLAG_FAIL))
-                {
-                    goto invalid_friend;
-                }
-                listAddNodeTail(cluster_manager.nodes, friend);
-            } else {
-                clusterManagerLogErr("[ERR] Unable to load info for "
-                                     "node %s:%d\n",
-                                     friend->ip, friend->port);
-                goto invalid_friend;
-            }
-            continue;
-invalid_friend:
-            if (!(friend->flags & CLUSTER_MANAGER_FLAG_SLAVE))
-                cluster_manager.unreachable_masters++;
-            freeClusterManagerNode(friend);
-        }
-        listRelease(node->friends);
-        node->friends = NULL;
-    }
-    // Count replicas for each node
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->replicate != NULL) {
-            clusterManagerNode *master = clusterManagerNodeByName(n->replicate);
-            if (master == NULL) {
-                clusterManagerLogWarn("*** WARNING: %s:%d claims to be "
-                                      "slave of unknown node ID %s.\n",
-                                      n->ip, n->port, n->replicate);
-            } else master->replicas_count++;
-        }
-    }
-    return 1;
-}
-
-/* Compare functions used by various sorting operations. */
-int clusterManagerSlotCompare(const void *slot1, const void *slot2) {
-    const char **i1 = (const char **)slot1;
-    const char **i2 = (const char **)slot2;
-    return strcmp(*i1, *i2);
-}
-
-int clusterManagerSlotCountCompareDesc(const void *n1, const void *n2) {
-    clusterManagerNode *node1 = *((clusterManagerNode **) n1);
-    clusterManagerNode *node2 = *((clusterManagerNode **) n2);
-    return node2->slots_count - node1->slots_count;
-}
-
-int clusterManagerCompareNodeBalance(const void *n1, const void *n2) {
-    clusterManagerNode *node1 = *((clusterManagerNode **) n1);
-    clusterManagerNode *node2 = *((clusterManagerNode **) n2);
-    return node1->balance - node2->balance;
-}
-
-static sds clusterManagerGetConfigSignature(clusterManagerNode *node) {
-    sds signature = NULL;
-    int node_count = 0, i = 0, name_len = 0;
-    char **node_configs = NULL;
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
-    if (reply == NULL || reply->type == REDIS_REPLY_ERROR)
-        goto cleanup;
-    char *lines = reply->str, *p, *line;
-    while ((p = strstr(lines, "\n")) != NULL) {
-        i = 0;
-        *p = '\0';
-        line = lines;
-        lines = p + 1;
-        char *nodename = NULL;
-        int tot_size = 0;
-        while ((p = strchr(line, ' ')) != NULL) {
-            *p = '\0';
-            char *token = line;
-            line = p + 1;
-            if (i == 0) {
-                nodename = token;
-                tot_size = (p - token);
-                name_len = tot_size++; // Make room for ':' in tot_size
-            }
-            if (++i == 8) break;
-        }
-        if (i != 8) continue;
-        if (nodename == NULL) continue;
-        int remaining = strlen(line);
-        if (remaining == 0) continue;
-        char **slots = NULL;
-        int c = 0;
-        while (remaining > 0) {
-            p = strchr(line, ' ');
-            if (p == NULL) p = line + remaining;
-            int size = (p - line);
-            remaining -= size;
-            tot_size += size;
-            char *slotsdef = line;
-            *p = '\0';
-            if (remaining) {
-                line = p + 1;
-                remaining--;
-            } else line = p;
-            if (slotsdef[0] != '[') {
-                c++;
-                slots = zrealloc(slots, (c * sizeof(char *)));
-                slots[c - 1] = slotsdef;
-            }
-        }
-        if (c > 0) {
-            if (c > 1)
-                qsort(slots, c, sizeof(char *), clusterManagerSlotCompare);
-            node_count++;
-            node_configs =
-                zrealloc(node_configs, (node_count * sizeof(char *)));
-            /* Make room for '|' separators. */
-            tot_size += (sizeof(char) * (c - 1));
-            char *cfg = zmalloc((sizeof(char) * tot_size) + 1);
-            memcpy(cfg, nodename, name_len);
-            char *sp = cfg + name_len;
-            *(sp++) = ':';
-            for (i = 0; i < c; i++) {
-                if (i > 0) *(sp++) = ',';
-                int slen = strlen(slots[i]);
-                memcpy(sp, slots[i], slen);
-                sp += slen;
-            }
-            *(sp++) = '\0';
-            node_configs[node_count - 1] = cfg;
-        }
-        zfree(slots);
-    }
-    if (node_count > 0) {
-        if (node_count > 1) {
-            qsort(node_configs, node_count, sizeof(char *),
-                  clusterManagerSlotCompare);
-        }
-        signature = sdsempty();
-        for (i = 0; i < node_count; i++) {
-            if (i > 0) signature = sdscatprintf(signature, "%c", '|');
-            signature = sdscatfmt(signature, "%s", node_configs[i]);
-        }
-    }
-cleanup:
-    if (reply != NULL) freeReplyObject(reply);
-    if (node_configs != NULL) {
-        for (i = 0; i < node_count; i++) zfree(node_configs[i]);
-        zfree(node_configs);
-    }
-    return signature;
-}
-
-static int clusterManagerIsConfigConsistent(void) {
-    if (cluster_manager.nodes == NULL) return 0;
-    int consistent = (listLength(cluster_manager.nodes) <= 1);
-    // If the Cluster has only one node, it's always consistent
-    if (consistent) return 1;
-    sds first_cfg = NULL;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        sds cfg = clusterManagerGetConfigSignature(node);
-        if (cfg == NULL) {
-            consistent = 0;
-            break;
-        }
-        if (first_cfg == NULL) first_cfg = cfg;
-        else {
-            consistent = !sdscmp(first_cfg, cfg);
-            sdsfree(cfg);
-            if (!consistent) break;
-        }
-    }
-    if (first_cfg != NULL) sdsfree(first_cfg);
-    return consistent;
-}
-
-static list *clusterManagerGetDisconnectedLinks(clusterManagerNode *node) {
-    list *links = NULL;
-    redisReply *reply = CLUSTER_MANAGER_COMMAND(node, "CLUSTER NODES");
-    if (!clusterManagerCheckRedisReply(node, reply, NULL)) goto cleanup;
-    links = listCreate();
-    char *lines = reply->str, *p, *line;
-    while ((p = strstr(lines, "\n")) != NULL) {
-        int i = 0;
-        *p = '\0';
-        line = lines;
-        lines = p + 1;
-        char *nodename = NULL, *addr = NULL, *flags = NULL, *link_status = NULL;
-        while ((p = strchr(line, ' ')) != NULL) {
-            *p = '\0';
-            char *token = line;
-            line = p + 1;
-            if (i == 0) nodename = token;
-            else if (i == 1) addr = token;
-            else if (i == 2) flags = token;
-            else if (i == 7) link_status = token;
-            else if (i == 8) break;
-            i++;
-        }
-        if (i == 7) link_status = line;
-        if (nodename == NULL || addr == NULL || flags == NULL ||
-            link_status == NULL) continue;
-        if (strstr(flags, "myself") != NULL) continue;
-        int disconnected = ((strstr(flags, "disconnected") != NULL) ||
-                            (strstr(link_status, "disconnected")));
-        int handshaking = (strstr(flags, "handshake") != NULL);
-        if (disconnected || handshaking) {
-            clusterManagerLink *link = zmalloc(sizeof(*link));
-            link->node_name = sdsnew(nodename);
-            link->node_addr = sdsnew(addr);
-            link->connected = 0;
-            link->handshaking = handshaking;
-            listAddNodeTail(links, link);
-        }
-    }
-cleanup:
-    if (reply != NULL) freeReplyObject(reply);
-    return links;
-}
-
-/* Check for disconnected cluster links. It returns a dict whose keys
- * are the unreachable node addresses and the values are lists of
- * node addresses that cannot reach the unreachable node. */
-static dict *clusterManagerGetLinkStatus(void) {
-    if (cluster_manager.nodes == NULL) return NULL;
-    dict *status = dictCreate(&clusterManagerLinkDictType, NULL);
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        list *links = clusterManagerGetDisconnectedLinks(node);
-        if (links) {
-            listIter lli;
-            listNode *lln;
-            listRewind(links, &lli);
-            while ((lln = listNext(&lli)) != NULL) {
-                clusterManagerLink *link = lln->value;
-                list *from = NULL;
-                dictEntry *entry = dictFind(status, link->node_addr);
-                if (entry) from = dictGetVal(entry);
-                else {
-                    from = listCreate();
-                    dictAdd(status, sdsdup(link->node_addr), from);
-                }
-                sds myaddr = sdsempty();
-                myaddr = sdscatfmt(myaddr, "%s:%u", node->ip, node->port);
-                listAddNodeTail(from, myaddr);
-                sdsfree(link->node_name);
-                sdsfree(link->node_addr);
-                zfree(link);
-            }
-            listRelease(links);
-        }
-    }
-    return status;
-}
-
-/* Add the error string to cluster_manager.errors and print it. */
-static void clusterManagerOnError(sds err) {
-    if (cluster_manager.errors == NULL)
-        cluster_manager.errors = listCreate();
-    listAddNodeTail(cluster_manager.errors, err);
-    clusterManagerLogErr("%s\n", (char *) err);
-}
-
-/* Check the slots coverage of the cluster. The 'all_slots' argument must be
- * and array of 16384 bytes. Every covered slot will be set to 1 in the
- * 'all_slots' array. The function returns the total number if covered slots.*/
-static int clusterManagerGetCoveredSlots(char *all_slots) {
-    if (cluster_manager.nodes == NULL) return 0;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    int totslots = 0, i;
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
-            if (node->slots[i] && !all_slots[i]) {
-                all_slots[i] = 1;
-                totslots++;
-            }
-        }
-    }
-    return totslots;
-}
-
-static void clusterManagerPrintSlotsList(list *slots) {
-    clusterManagerNode n = {0};
-    listIter li;
-    listNode *ln;
-    listRewind(slots, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        int slot = atoi(ln->value);
-        if (slot >= 0 && slot < CLUSTER_MANAGER_SLOTS)
-            n.slots[slot] = 1;
-    }
-    sds nodeslist = clusterManagerNodeSlotsString(&n);
-    printf("%s\n", nodeslist);
-    sdsfree(nodeslist);
-}
-
-/* Return the node, among 'nodes' with the greatest number of keys
- * in the specified slot. */
-static clusterManagerNode * clusterManagerGetNodeWithMostKeysInSlot(list *nodes,
-                                                                    int slot,
-                                                                    char **err)
-{
-    clusterManagerNode *node = NULL;
-    int numkeys = 0;
-    listIter li;
-    listNode *ln;
-    listRewind(nodes, &li);
-    if (err) *err = NULL;
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
-            continue;
-        redisReply *r =
-            CLUSTER_MANAGER_COMMAND(n, "CLUSTER COUNTKEYSINSLOT %d", slot);
-        int success = clusterManagerCheckRedisReply(n, r, err);
-        if (success) {
-            if (r->integer > numkeys || node == NULL) {
-                numkeys = r->integer;
-                node = n;
-            }
-        }
-        if (r != NULL) freeReplyObject(r);
-        /* If the reply contains errors */
-        if (!success) {
-            if (err != NULL && *err != NULL)
-                CLUSTER_MANAGER_PRINT_REPLY_ERROR(n, err);
-            node = NULL;
-            break;
-        }
-    }
-    return node;
-}
-
-/* This function returns the master that has the least number of replicas
- * in the cluster. If there are multiple masters with the same smaller
- * number of replicas, one at random is returned. */
-
-static clusterManagerNode *clusterManagerNodeWithLeastReplicas() {
-    clusterManagerNode *node = NULL;
-    int lowest_count = 0;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        if (node == NULL || n->replicas_count < lowest_count) {
-            node = n;
-            lowest_count = n->replicas_count;
-        }
-    }
-    return node;
-}
-
-/* This function returns a random master node, return NULL if none */
-
-static clusterManagerNode *clusterManagerNodeMasterRandom() {
-    int master_count = 0;
-    int idx;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        master_count++;
-    }
-
-    srand(time(NULL));
-    idx = rand() % master_count;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        if (!idx--) {
-            return n;
-        }
-    }
-    /* Can not be reached */
-    return NULL;
-}
-
-static int clusterManagerFixSlotsCoverage(char *all_slots) {
-    int force_fix = config.cluster_manager_command.flags &
-                    CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
-
-    if (cluster_manager.unreachable_masters > 0 && !force_fix) {
-        clusterManagerLogWarn("*** Fixing slots coverage with %d unreachable masters is dangerous: redis-cli will assume that slots about masters that are not reachable are not covered, and will try to reassign them to the reachable nodes. This can cause data loss and is rarely what you want to do. If you really want to proceed use the --cluster-fix-with-unreachable-masters option.\n", cluster_manager.unreachable_masters);
-        exit(1);
-    }
-
-    int i, fixed = 0;
-    list *none = NULL, *single = NULL, *multi = NULL;
-    clusterManagerLogInfo(">>> Fixing slots coverage...\n");
-    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
-        int covered = all_slots[i];
-        if (!covered) {
-            sds slot = sdsfromlonglong((long long) i);
-            list *slot_nodes = listCreate();
-            sds slot_nodes_str = sdsempty();
-            listIter li;
-            listNode *ln;
-            listRewind(cluster_manager.nodes, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                clusterManagerNode *n = ln->value;
-                if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
-                    continue;
-                redisReply *reply = CLUSTER_MANAGER_COMMAND(n,
-                    "CLUSTER GETKEYSINSLOT %d %d", i, 1);
-                if (!clusterManagerCheckRedisReply(n, reply, NULL)) {
-                    fixed = -1;
-                    if (reply) freeReplyObject(reply);
-                    goto cleanup;
-                }
-                assert(reply->type == REDIS_REPLY_ARRAY);
-                if (reply->elements > 0) {
-                    listAddNodeTail(slot_nodes, n);
-                    if (listLength(slot_nodes) > 1)
-                        slot_nodes_str = sdscat(slot_nodes_str, ", ");
-                    slot_nodes_str = sdscatfmt(slot_nodes_str,
-                                               "%s:%u", n->ip, n->port);
-                }
-                freeReplyObject(reply);
-            }
-            sdsfree(slot_nodes_str);
-            dictAdd(clusterManagerUncoveredSlots, slot, slot_nodes);
-        }
-    }
-
-    /* For every slot, take action depending on the actual condition:
-     * 1) No node has keys for this slot.
-     * 2) A single node has keys for this slot.
-     * 3) Multiple nodes have keys for this slot. */
-    none = listCreate();
-    single = listCreate();
-    multi = listCreate();
-    dictIterator *iter = dictGetIterator(clusterManagerUncoveredSlots);
-    dictEntry *entry;
-    while ((entry = dictNext(iter)) != NULL) {
-        sds slot = (sds) dictGetKey(entry);
-        list *nodes = (list *) dictGetVal(entry);
-        switch (listLength(nodes)){
-        case 0: listAddNodeTail(none, slot); break;
-        case 1: listAddNodeTail(single, slot); break;
-        default: listAddNodeTail(multi, slot); break;
-        }
-    }
-    dictReleaseIterator(iter);
-
-    /* we want explicit manual confirmation from users for all the fix cases */
-    int ignore_force = 1;
-
-    /*  Handle case "1": keys in no node. */
-    if (listLength(none) > 0) {
-        printf("The following uncovered slots have no keys "
-               "across the cluster:\n");
-        clusterManagerPrintSlotsList(none);
-        if (confirmWithYes("Fix these slots by covering with a random node?",
-                           ignore_force)) {
-            listIter li;
-            listNode *ln;
-            listRewind(none, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                sds slot = ln->value;
-                int s = atoi(slot);
-                clusterManagerNode *n = clusterManagerNodeMasterRandom();
-                clusterManagerLogInfo(">>> Covering slot %s with %s:%d\n",
-                                      slot, n->ip, n->port);
-                if (!clusterManagerSetSlotOwner(n, s, 0)) {
-                    fixed = -1;
-                    goto cleanup;
-                }
-                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
-                 * info into the node struct, in order to keep it synced */
-                n->slots[s] = 1;
-                fixed++;
-            }
-        }
-    }
-
-    /*  Handle case "2": keys only in one node. */
-    if (listLength(single) > 0) {
-        printf("The following uncovered slots have keys in just one node:\n");
-        clusterManagerPrintSlotsList(single);
-        if (confirmWithYes("Fix these slots by covering with those nodes?",
-                           ignore_force)) {
-            listIter li;
-            listNode *ln;
-            listRewind(single, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                sds slot = ln->value;
-                int s = atoi(slot);
-                dictEntry *entry = dictFind(clusterManagerUncoveredSlots, slot);
-                assert(entry != NULL);
-                list *nodes = (list *) dictGetVal(entry);
-                listNode *fn = listFirst(nodes);
-                assert(fn != NULL);
-                clusterManagerNode *n = fn->value;
-                clusterManagerLogInfo(">>> Covering slot %s with %s:%d\n",
-                                      slot, n->ip, n->port);
-                if (!clusterManagerSetSlotOwner(n, s, 0)) {
-                    fixed = -1;
-                    goto cleanup;
-                }
-                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
-                 * info into the node struct, in order to keep it synced */
-                n->slots[atoi(slot)] = 1;
-                fixed++;
-            }
-        }
-    }
-
-    /* Handle case "3": keys in multiple nodes. */
-    if (listLength(multi) > 0) {
-        printf("The following uncovered slots have keys in multiple nodes:\n");
-        clusterManagerPrintSlotsList(multi);
-        if (confirmWithYes("Fix these slots by moving keys "
-                           "into a single node?", ignore_force)) {
-            listIter li;
-            listNode *ln;
-            listRewind(multi, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                sds slot = ln->value;
-                dictEntry *entry = dictFind(clusterManagerUncoveredSlots, slot);
-                assert(entry != NULL);
-                list *nodes = (list *) dictGetVal(entry);
-                int s = atoi(slot);
-                clusterManagerNode *target =
-                    clusterManagerGetNodeWithMostKeysInSlot(nodes, s, NULL);
-                if (target == NULL) {
-                    fixed = -1;
-                    goto cleanup;
-                }
-                clusterManagerLogInfo(">>> Covering slot %s moving keys "
-                                      "to %s:%d\n", slot,
-                                      target->ip, target->port);
-                if (!clusterManagerSetSlotOwner(target, s, 1)) {
-                    fixed = -1;
-                    goto cleanup;
-                }
-                /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
-                 * info into the node struct, in order to keep it synced */
-                target->slots[atoi(slot)] = 1;
-                listIter nli;
-                listNode *nln;
-                listRewind(nodes, &nli);
-                while ((nln = listNext(&nli)) != NULL) {
-                    clusterManagerNode *src = nln->value;
-                    if (src == target) continue;
-                    /* Assign the slot to target node in the source node. */
-                    if (!clusterManagerSetSlot(src, target, s, "NODE", NULL))
-                        fixed = -1;
-                    if (fixed < 0) goto cleanup;
-                    /* Set the source node in 'importing' state
-                     * (even if we will actually migrate keys away)
-                     * in order to avoid receiving redirections
-                     * for MIGRATE. */
-                    if (!clusterManagerSetSlot(src, target, s,
-                                               "IMPORTING", NULL)) fixed = -1;
-                    if (fixed < 0) goto cleanup;
-                    int opts = CLUSTER_MANAGER_OPT_VERBOSE |
-                               CLUSTER_MANAGER_OPT_COLD;
-                    if (!clusterManagerMoveSlot(src, target, s, opts, NULL)) {
-                        fixed = -1;
-                        goto cleanup;
-                    }
-                    if (!clusterManagerClearSlotStatus(src, s))
-                        fixed = -1;
-                    if (fixed < 0) goto cleanup;
-                }
-                fixed++;
-            }
-        }
-    }
-cleanup:
-    if (none) listRelease(none);
-    if (single) listRelease(single);
-    if (multi) listRelease(multi);
-    return fixed;
-}
-
-/* Slot 'slot' was found to be in importing or migrating state in one or
- * more nodes. This function fixes this condition by migrating keys where
- * it seems more sensible. */
-static int clusterManagerFixOpenSlot(int slot) {
-    int force_fix = config.cluster_manager_command.flags &
-                    CLUSTER_MANAGER_CMD_FLAG_FIX_WITH_UNREACHABLE_MASTERS;
-
-    if (cluster_manager.unreachable_masters > 0 && !force_fix) {
-        clusterManagerLogWarn("*** Fixing open slots with %d unreachable masters is dangerous: redis-cli will assume that slots about masters that are not reachable are not covered, and will try to reassign them to the reachable nodes. This can cause data loss and is rarely what you want to do. If you really want to proceed use the --cluster-fix-with-unreachable-masters option.\n", cluster_manager.unreachable_masters);
-        exit(1);
-    }
-
-    clusterManagerLogInfo(">>> Fixing open slot %d\n", slot);
-    /* Try to obtain the current slot owner, according to the current
-     * nodes configuration. */
-    int success = 1;
-    list *owners = listCreate();    /* List of nodes claiming some ownership.
-                                       it could be stating in the configuration
-                                       to have the node ownership, or just
-                                       holding keys for such slot. */
-    list *migrating = listCreate();
-    list *importing = listCreate();
-    sds migrating_str = sdsempty();
-    sds importing_str = sdsempty();
-    clusterManagerNode *owner = NULL; /* The obvious slot owner if any. */
-
-    /* Iterate all the nodes, looking for potential owners of this slot. */
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        if (n->slots[slot]) {
-            listAddNodeTail(owners, n);
-        } else {
-            redisReply *r = CLUSTER_MANAGER_COMMAND(n,
-                "CLUSTER COUNTKEYSINSLOT %d", slot);
-            success = clusterManagerCheckRedisReply(n, r, NULL);
-            if (success && r->integer > 0) {
-                clusterManagerLogWarn("*** Found keys about slot %d "
-                                      "in non-owner node %s:%d!\n", slot,
-                                      n->ip, n->port);
-                listAddNodeTail(owners, n);
-            }
-            if (r) freeReplyObject(r);
-            if (!success) goto cleanup;
-        }
-    }
-
-    /* If we have only a single potential owner for this slot,
-     * set it as "owner". */
-    if (listLength(owners) == 1) owner = listFirst(owners)->value;
-
-    /* Scan the list of nodes again, in order to populate the
-     * list of nodes in importing or migrating state for
-     * this slot. */
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        int is_migrating = 0, is_importing = 0;
-        if (n->migrating) {
-            for (int i = 0; i < n->migrating_count; i += 2) {
-                sds migrating_slot = n->migrating[i];
-                if (atoi(migrating_slot) == slot) {
-                    char *sep = (listLength(migrating) == 0 ? "" : ",");
-                    migrating_str = sdscatfmt(migrating_str, "%s%s:%u",
-                                              sep, n->ip, n->port);
-                    listAddNodeTail(migrating, n);
-                    is_migrating = 1;
-                    break;
-                }
-            }
-        }
-        if (!is_migrating && n->importing) {
-            for (int i = 0; i < n->importing_count; i += 2) {
-                sds importing_slot = n->importing[i];
-                if (atoi(importing_slot) == slot) {
-                    char *sep = (listLength(importing) == 0 ? "" : ",");
-                    importing_str = sdscatfmt(importing_str, "%s%s:%u",
-                                              sep, n->ip, n->port);
-                    listAddNodeTail(importing, n);
-                    is_importing = 1;
-                    break;
-                }
-            }
-        }
-
-        /* If the node is neither migrating nor importing and it's not
-         * the owner, then is added to the importing list in case
-         * it has keys in the slot. */
-        if (!is_migrating && !is_importing && n != owner) {
-            redisReply *r = CLUSTER_MANAGER_COMMAND(n,
-                "CLUSTER COUNTKEYSINSLOT %d", slot);
-            success = clusterManagerCheckRedisReply(n, r, NULL);
-            if (success && r->integer > 0) {
-                clusterManagerLogWarn("*** Found keys about slot %d "
-                                      "in node %s:%d!\n", slot, n->ip,
-                                      n->port);
-                char *sep = (listLength(importing) == 0 ? "" : ",");
-                importing_str = sdscatfmt(importing_str, "%s%S:%u",
-                                          sep, n->ip, n->port);
-                listAddNodeTail(importing, n);
-            }
-            if (r) freeReplyObject(r);
-            if (!success) goto cleanup;
-        }
-    }
-    if (sdslen(migrating_str) > 0)
-        printf("Set as migrating in: %s\n", migrating_str);
-    if (sdslen(importing_str) > 0)
-        printf("Set as importing in: %s\n", importing_str);
-
-    /* If there is no slot owner, set as owner the node with the biggest
-     * number of keys, among the set of migrating / importing nodes. */
-    if (owner == NULL) {
-        clusterManagerLogInfo(">>> No single clear owner for the slot, "
-                              "selecting an owner by # of keys...\n");
-        owner = clusterManagerGetNodeWithMostKeysInSlot(cluster_manager.nodes,
-                                                        slot, NULL);
-        // If we still don't have an owner, we can't fix it.
-        if (owner == NULL) {
-            clusterManagerLogErr("[ERR] Can't select a slot owner. "
-                                 "Impossible to fix.\n");
-            success = 0;
-            goto cleanup;
-        }
-
-        // Use ADDSLOTS to assign the slot.
-        clusterManagerLogWarn("*** Configuring %s:%d as the slot owner\n",
-                              owner->ip, owner->port);
-        success = clusterManagerClearSlotStatus(owner, slot);
-        if (!success) goto cleanup;
-        success = clusterManagerSetSlotOwner(owner, slot, 0);
-        if (!success) goto cleanup;
-        /* Since CLUSTER ADDSLOTS succeeded, we also update the slot
-         * info into the node struct, in order to keep it synced */
-        owner->slots[slot] = 1;
-        /* Make sure this information will propagate. Not strictly needed
-         * since there is no past owner, so all the other nodes will accept
-         * whatever epoch this node will claim the slot with. */
-        success = clusterManagerBumpEpoch(owner);
-        if (!success) goto cleanup;
-        /* Remove the owner from the list of migrating/importing
-         * nodes. */
-        clusterManagerRemoveNodeFromList(migrating, owner);
-        clusterManagerRemoveNodeFromList(importing, owner);
-    }
-
-    /* If there are multiple owners of the slot, we need to fix it
-     * so that a single node is the owner and all the other nodes
-     * are in importing state. Later the fix can be handled by one
-     * of the base cases above.
-     *
-     * Note that this case also covers multiple nodes having the slot
-     * in migrating state, since migrating is a valid state only for
-     * slot owners. */
-    if (listLength(owners) > 1) {
-        /* Owner cannot be NULL at this point, since if there are more owners,
-         * the owner has been set in the previous condition (owner == NULL). */
-        assert(owner != NULL);
-        listRewind(owners, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n == owner) continue;
-            success = clusterManagerDelSlot(n, slot, 1);
-            if (!success) goto cleanup;
-            n->slots[slot] = 0;
-            /* Assign the slot to the owner in the node 'n' configuration.' */
-            success = clusterManagerSetSlot(n, owner, slot, "node", NULL);
-            if (!success) goto cleanup;
-            success = clusterManagerSetSlot(n, owner, slot, "importing", NULL);
-            if (!success) goto cleanup;
-            /* Avoid duplicates. */
-            clusterManagerRemoveNodeFromList(importing, n);
-            listAddNodeTail(importing, n);
-            /* Ensure that the node is not in the migrating list. */
-            clusterManagerRemoveNodeFromList(migrating, n);
-        }
-    }
-    int move_opts = CLUSTER_MANAGER_OPT_VERBOSE;
-
-    /* Case 1: The slot is in migrating state in one node, and in
-     *         importing state in 1 node. That's trivial to address. */
-    if (listLength(migrating) == 1 && listLength(importing) == 1) {
-        clusterManagerNode *src = listFirst(migrating)->value;
-        clusterManagerNode *dst = listFirst(importing)->value;
-        clusterManagerLogInfo(">>> Case 1: Moving slot %d from "
-                              "%s:%d to %s:%d\n", slot,
-                              src->ip, src->port, dst->ip, dst->port);
-        move_opts |= CLUSTER_MANAGER_OPT_UPDATE;
-        success = clusterManagerMoveSlot(src, dst, slot, move_opts, NULL);
-    }
-
-    /* Case 2: There are multiple nodes that claim the slot as importing,
-     * they probably got keys about the slot after a restart so opened
-     * the slot. In this case we just move all the keys to the owner
-     * according to the configuration. */
-    else if (listLength(migrating) == 0 && listLength(importing) > 0) {
-        clusterManagerLogInfo(">>> Case 2: Moving all the %d slot keys to its "
-                              "owner %s:%d\n", slot, owner->ip, owner->port);
-        move_opts |= CLUSTER_MANAGER_OPT_COLD;
-        listRewind(importing, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n == owner) continue;
-            success = clusterManagerMoveSlot(n, owner, slot, move_opts, NULL);
-            if (!success) goto cleanup;
-            clusterManagerLogInfo(">>> Setting %d as STABLE in "
-                                  "%s:%d\n", slot, n->ip, n->port);
-            success = clusterManagerClearSlotStatus(n, slot);
-            if (!success) goto cleanup;
-        }
-        /* Since the slot has been moved in "cold" mode, ensure that all the
-         * other nodes update their own configuration about the slot itself. */
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n == owner) continue;
-            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-            success = clusterManagerSetSlot(n, owner, slot, "NODE", NULL);
-            if (!success) goto cleanup;
-        }
-    }
-
-    /* Case 3: The slot is in migrating state in one node but multiple
-     * other nodes claim to be in importing state and don't have any key in
-     * the slot. We search for the importing node having the same ID as
-     * the destination node of the migrating node.
-     * In that case we move the slot from the migrating node to this node and
-     * we close the importing states on all the other importing nodes.
-     * If no importing node has the same ID as the destination node of the
-     * migrating node, the slot's state is closed on both the migrating node
-     * and the importing nodes. */
-    else if (listLength(migrating) == 1 && listLength(importing) > 1) {
-        int try_to_fix = 1;
-        clusterManagerNode *src = listFirst(migrating)->value;
-        clusterManagerNode *dst = NULL;
-        sds target_id = NULL;
-        for (int i = 0; i < src->migrating_count; i += 2) {
-            sds migrating_slot = src->migrating[i];
-            if (atoi(migrating_slot) == slot) {
-                target_id = src->migrating[i + 1];
-                break;
-            }
-        }
-        assert(target_id != NULL);
-        listIter li;
-        listNode *ln;
-        listRewind(importing, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            int count = clusterManagerCountKeysInSlot(n, slot);
-            if (count > 0) {
-                try_to_fix = 0;
-                break;
-            }
-            if (strcmp(n->name, target_id) == 0) dst = n;
-        }
-        if (!try_to_fix) goto unhandled_case;
-        if (dst != NULL) {
-            clusterManagerLogInfo(">>> Case 3: Moving slot %d from %s:%d to "
-                                  "%s:%d and closing it on all the other "
-                                  "importing nodes.\n",
-                                  slot, src->ip, src->port,
-                                  dst->ip, dst->port);
-            /* Move the slot to the destination node. */
-            success = clusterManagerMoveSlot(src, dst, slot, move_opts, NULL);
-            if (!success) goto cleanup;
-            /* Close slot on all the other importing nodes. */
-            listRewind(importing, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                clusterManagerNode *n = ln->value;
-                if (dst == n) continue;
-                success = clusterManagerClearSlotStatus(n, slot);
-                if (!success) goto cleanup;
-            }
-        } else {
-            clusterManagerLogInfo(">>> Case 3: Closing slot %d on both "
-                                  "migrating and importing nodes.\n", slot);
-            /* Close the slot on both the migrating node and the importing
-             * nodes. */
-            success = clusterManagerClearSlotStatus(src, slot);
-            if (!success) goto cleanup;
-            listRewind(importing, &li);
-            while ((ln = listNext(&li)) != NULL) {
-                clusterManagerNode *n = ln->value;
-                success = clusterManagerClearSlotStatus(n, slot);
-                if (!success) goto cleanup;
-            }
-        }
-    } else {
-        int try_to_close_slot = (listLength(importing) == 0 &&
-                                 listLength(migrating) == 1);
-        if (try_to_close_slot) {
-            clusterManagerNode *n = listFirst(migrating)->value;
-            if (!owner || owner != n) {
-                redisReply *r = CLUSTER_MANAGER_COMMAND(n,
-                    "CLUSTER GETKEYSINSLOT %d %d", slot, 10);
-                success = clusterManagerCheckRedisReply(n, r, NULL);
-                if (r) {
-                    if (success) try_to_close_slot = (r->elements == 0);
-                    freeReplyObject(r);
-                }
-                if (!success) goto cleanup;
-            }
-        }
-        /* Case 4: There are no slots claiming to be in importing state, but
-         * there is a migrating node that actually don't have any key or is the
-         * slot owner. We can just close the slot, probably a reshard
-         * interrupted in the middle. */
-        if (try_to_close_slot) {
-            clusterManagerNode *n = listFirst(migrating)->value;
-            clusterManagerLogInfo(">>> Case 4: Closing slot %d on %s:%d\n",
-                                  slot, n->ip, n->port);
-            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER SETSLOT %d %s",
-                                                    slot, "STABLE");
-            success = clusterManagerCheckRedisReply(n, r, NULL);
-            if (r) freeReplyObject(r);
-            if (!success) goto cleanup;
-        } else {
-unhandled_case:
-            success = 0;
-            clusterManagerLogErr("[ERR] Sorry, redis-cli can't fix this slot "
-                                 "yet (work in progress). Slot is set as "
-                                 "migrating in %s, as importing in %s, "
-                                 "owner is %s:%d\n", migrating_str,
-                                 importing_str, owner->ip, owner->port);
-        }
-    }
-cleanup:
-    listRelease(owners);
-    listRelease(migrating);
-    listRelease(importing);
-    sdsfree(migrating_str);
-    sdsfree(importing_str);
-    return success;
-}
-
-static int clusterManagerFixMultipleSlotOwners(int slot, list *owners) {
-    clusterManagerLogInfo(">>> Fixing multiple owners for slot %d...\n", slot);
-    int success = 0;
-    assert(listLength(owners) > 1);
-    clusterManagerNode *owner = clusterManagerGetNodeWithMostKeysInSlot(owners,
-                                                                        slot,
-                                                                        NULL);
-    if (!owner) owner = listFirst(owners)->value;
-    clusterManagerLogInfo(">>> Setting slot %d owner: %s:%d\n",
-                          slot, owner->ip, owner->port);
-    /* Set the slot owner. */
-    if (!clusterManagerSetSlotOwner(owner, slot, 0)) return 0;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    /* Update configuration in all the other master nodes by assigning the slot
-     * itself to the new owner, and by eventually migrating keys if the node
-     * has keys for the slot. */
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n == owner) continue;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-        int count = clusterManagerCountKeysInSlot(n, slot);
-        success = (count >= 0);
-        if (!success) break;
-        clusterManagerDelSlot(n, slot, 1);
-        if (!clusterManagerSetSlot(n, owner, slot, "node", NULL)) return 0;
-        if (count > 0) {
-            int opts = CLUSTER_MANAGER_OPT_VERBOSE |
-                       CLUSTER_MANAGER_OPT_COLD;
-            success = clusterManagerMoveSlot(n, owner, slot, opts, NULL);
-            if (!success) break;
-        }
-    }
-    return success;
-}
-
-static int clusterManagerCheckCluster(int quiet) {
-    listNode *ln = listFirst(cluster_manager.nodes);
-    if (!ln) return 0;
-    clusterManagerNode *node = ln->value;
-    clusterManagerLogInfo(">>> Performing Cluster Check (using node %s:%d)\n",
-                          node->ip, node->port);
-    int result = 1, consistent = 0;
-    int do_fix = config.cluster_manager_command.flags &
-                 CLUSTER_MANAGER_CMD_FLAG_FIX;
-    if (!quiet) clusterManagerShowNodes();
-    consistent = clusterManagerIsConfigConsistent();
-    if (!consistent) {
-        sds err = sdsnew("[ERR] Nodes don't agree about configuration!");
-        clusterManagerOnError(err);
-        result = 0;
-    } else {
-        clusterManagerLogOk("[OK] All nodes agree about slots "
-                            "configuration.\n");
-    }
-    /* Check open slots */
-    clusterManagerLogInfo(">>> Check for open slots...\n");
-    listIter li;
-    listRewind(cluster_manager.nodes, &li);
-    int i;
-    dict *open_slots = NULL;
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->migrating != NULL) {
-            if (open_slots == NULL)
-                open_slots = dictCreate(&clusterManagerDictType, NULL);
-            sds errstr = sdsempty();
-            errstr = sdscatprintf(errstr,
-                                "[WARNING] Node %s:%d has slots in "
-                                "migrating state ",
-                                n->ip,
-                                n->port);
-            for (i = 0; i < n->migrating_count; i += 2) {
-                sds slot = n->migrating[i];
-                dictReplace(open_slots, slot, sdsdup(n->migrating[i + 1]));
-                char *fmt = (i > 0 ? ",%S" : "%S");
-                errstr = sdscatfmt(errstr, fmt, slot);
-            }
-            errstr = sdscat(errstr, ".");
-            clusterManagerOnError(errstr);
-        }
-        if (n->importing != NULL) {
-            if (open_slots == NULL)
-                open_slots = dictCreate(&clusterManagerDictType, NULL);
-            sds errstr = sdsempty();
-            errstr = sdscatprintf(errstr,
-                                "[WARNING] Node %s:%d has slots in "
-                                "importing state ",
-                                n->ip,
-                                n->port);
-            for (i = 0; i < n->importing_count; i += 2) {
-                sds slot = n->importing[i];
-                dictReplace(open_slots, slot, sdsdup(n->importing[i + 1]));
-                char *fmt = (i > 0 ? ",%S" : "%S");
-                errstr = sdscatfmt(errstr, fmt, slot);
-            }
-            errstr = sdscat(errstr, ".");
-            clusterManagerOnError(errstr);
-        }
-    }
-    if (open_slots != NULL) {
-        result = 0;
-        dictIterator *iter = dictGetIterator(open_slots);
-        dictEntry *entry;
-        sds errstr = sdsnew("[WARNING] The following slots are open: ");
-        i = 0;
-        while ((entry = dictNext(iter)) != NULL) {
-            sds slot = (sds) dictGetKey(entry);
-            char *fmt = (i++ > 0 ? ",%S" : "%S");
-            errstr = sdscatfmt(errstr, fmt, slot);
-        }
-        clusterManagerLogErr("%s.\n", (char *) errstr);
-        sdsfree(errstr);
-        if (do_fix) {
-            /* Fix open slots. */
-            dictReleaseIterator(iter);
-            iter = dictGetIterator(open_slots);
-            while ((entry = dictNext(iter)) != NULL) {
-                sds slot = (sds) dictGetKey(entry);
-                result = clusterManagerFixOpenSlot(atoi(slot));
-                if (!result) break;
-            }
-        }
-        dictReleaseIterator(iter);
-        dictRelease(open_slots);
-    }
-    clusterManagerLogInfo(">>> Check slots coverage...\n");
-    char slots[CLUSTER_MANAGER_SLOTS];
-    memset(slots, 0, CLUSTER_MANAGER_SLOTS);
-    int coverage = clusterManagerGetCoveredSlots(slots);
-    if (coverage == CLUSTER_MANAGER_SLOTS) {
-        clusterManagerLogOk("[OK] All %d slots covered.\n",
-                            CLUSTER_MANAGER_SLOTS);
-    } else {
-        sds err = sdsempty();
-        err = sdscatprintf(err, "[ERR] Not all %d slots are "
-                                "covered by nodes.\n",
-                                CLUSTER_MANAGER_SLOTS);
-        clusterManagerOnError(err);
-        result = 0;
-        if (do_fix/* && result*/) {
-            dictType dtype = clusterManagerDictType;
-            dtype.keyDestructor = dictSdsDestructor;
-            dtype.valDestructor = dictListDestructor;
-            clusterManagerUncoveredSlots = dictCreate(&dtype, NULL);
-            int fixed = clusterManagerFixSlotsCoverage(slots);
-            if (fixed > 0) result = 1;
-        }
-    }
-    int search_multiple_owners = config.cluster_manager_command.flags &
-                                 CLUSTER_MANAGER_CMD_FLAG_CHECK_OWNERS;
-    if (search_multiple_owners) {
-        /* Check whether there are multiple owners, even when slots are
-         * fully covered and there are no open slots. */
-        clusterManagerLogInfo(">>> Check for multiple slot owners...\n");
-        int slot = 0, slots_with_multiple_owners = 0;
-        for (; slot < CLUSTER_MANAGER_SLOTS; slot++) {
-            listIter li;
-            listNode *ln;
-            listRewind(cluster_manager.nodes, &li);
-            list *owners = listCreate();
-            while ((ln = listNext(&li)) != NULL) {
-                clusterManagerNode *n = ln->value;
-                if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-                if (n->slots[slot]) listAddNodeTail(owners, n);
-                else {
-                    /* Nodes having keys for the slot will be considered
-                     * owners too. */
-                    int count = clusterManagerCountKeysInSlot(n, slot);
-                    if (count > 0) listAddNodeTail(owners, n);
-                }
-            }
-            if (listLength(owners) > 1) {
-                result = 0;
-                clusterManagerLogErr("[WARNING] Slot %d has %d owners:\n",
-                                     slot, listLength(owners));
-                listRewind(owners, &li);
-                while ((ln = listNext(&li)) != NULL) {
-                    clusterManagerNode *n = ln->value;
-                    clusterManagerLogErr("    %s:%d\n", n->ip, n->port);
-                }
-                slots_with_multiple_owners++;
-                if (do_fix) {
-                    result = clusterManagerFixMultipleSlotOwners(slot, owners);
-                    if (!result) {
-                        clusterManagerLogErr("Failed to fix multiple owners "
-                                             "for slot %d\n", slot);
-                        listRelease(owners);
-                        break;
-                    } else slots_with_multiple_owners--;
-                }
-            }
-            listRelease(owners);
-        }
-        if (slots_with_multiple_owners == 0)
-            clusterManagerLogOk("[OK] No multiple owners found.\n");
-    }
-    return result;
-}
-
-static clusterManagerNode *clusterNodeForResharding(char *id,
-                                                    clusterManagerNode *target,
-                                                    int *raise_err)
-{
-    clusterManagerNode *node = NULL;
-    const char *invalid_node_msg = "*** The specified node (%s) is not known "
-                                   "or not a master, please retry.\n";
-    node = clusterManagerNodeByName(id);
-    *raise_err = 0;
-    if (!node || node->flags & CLUSTER_MANAGER_FLAG_SLAVE) {
-        clusterManagerLogErr(invalid_node_msg, id);
-        *raise_err = 1;
-        return NULL;
-    } else if (target != NULL) {
-        if (!strcmp(node->name, target->name)) {
-            clusterManagerLogErr( "*** It is not possible to use "
-                                  "the target node as "
-                                  "source node.\n");
-            return NULL;
-        }
-    }
-    return node;
-}
-
-static list *clusterManagerComputeReshardTable(list *sources, int numslots) {
-    list *moved = listCreate();
-    int src_count = listLength(sources), i = 0, tot_slots = 0, j;
-    clusterManagerNode **sorted = zmalloc(src_count * sizeof(*sorted));
-    listIter li;
-    listNode *ln;
-    listRewind(sources, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *node = ln->value;
-        tot_slots += node->slots_count;
-        sorted[i++] = node;
-    }
-    qsort(sorted, src_count, sizeof(clusterManagerNode *),
-          clusterManagerSlotCountCompareDesc);
-    for (i = 0; i < src_count; i++) {
-        clusterManagerNode *node = sorted[i];
-        float n = ((float) numslots / tot_slots * node->slots_count);
-        if (i == 0) n = ceil(n);
-        else n = floor(n);
-        int max = (int) n, count = 0;
-        for (j = 0; j < CLUSTER_MANAGER_SLOTS; j++) {
-            int slot = node->slots[j];
-            if (!slot) continue;
-            if (count >= max || (int)listLength(moved) >= numslots) break;
-            clusterManagerReshardTableItem *item = zmalloc(sizeof(*item));
-            item->source = node;
-            item->slot = j;
-            listAddNodeTail(moved, item);
-            count++;
-        }
-    }
-    zfree(sorted);
-    return moved;
-}
-
-static void clusterManagerShowReshardTable(list *table) {
-    listIter li;
-    listNode *ln;
-    listRewind(table, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerReshardTableItem *item = ln->value;
-        clusterManagerNode *n = item->source;
-        printf("    Moving slot %d from %s\n", item->slot, (char *) n->name);
-    }
-}
-
-static void clusterManagerReleaseReshardTable(list *table) {
-    if (table != NULL) {
-        listIter li;
-        listNode *ln;
-        listRewind(table, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerReshardTableItem *item = ln->value;
-            zfree(item);
-        }
-        listRelease(table);
-    }
-}
-
-static void clusterManagerLog(int level, const char* fmt, ...) {
-    int use_colors =
-        (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_COLOR);
-    if (use_colors) {
-        printf("\033[");
-        switch (level) {
-        case CLUSTER_MANAGER_LOG_LVL_INFO: printf(LOG_COLOR_BOLD); break;
-        case CLUSTER_MANAGER_LOG_LVL_WARN: printf(LOG_COLOR_YELLOW); break;
-        case CLUSTER_MANAGER_LOG_LVL_ERR: printf(LOG_COLOR_RED); break;
-        case CLUSTER_MANAGER_LOG_LVL_SUCCESS: printf(LOG_COLOR_GREEN); break;
-        default: printf(LOG_COLOR_RESET); break;
-        }
-    }
-    va_list ap;
-    va_start(ap, fmt);
-    vprintf(fmt, ap);
-    va_end(ap);
-    if (use_colors) printf("\033[" LOG_COLOR_RESET);
-}
-
-static void clusterManagerNodeArrayInit(clusterManagerNodeArray *array,
-                                        int alloc_len)
-{
-    array->nodes = zcalloc(alloc_len * sizeof(clusterManagerNode*));
-    array->alloc = array->nodes;
-    array->len = alloc_len;
-    array->count = 0;
-}
-
-/* Reset array->nodes to the original array allocation and re-count non-NULL
- * nodes. */
-static void clusterManagerNodeArrayReset(clusterManagerNodeArray *array) {
-    if (array->nodes > array->alloc) {
-        array->len = array->nodes - array->alloc;
-        array->nodes = array->alloc;
-        array->count = 0;
-        int i = 0;
-        for(; i < array->len; i++) {
-            if (array->nodes[i] != NULL) array->count++;
-        }
-    }
-}
-
-/* Shift array->nodes and store the shifted node into 'nodeptr'. */
-static void clusterManagerNodeArrayShift(clusterManagerNodeArray *array,
-                                         clusterManagerNode **nodeptr)
-{
-    assert(array->len > 0);
-    /* If the first node to be shifted is not NULL, decrement count. */
-    if (*array->nodes != NULL) array->count--;
-    /* Store the first node to be shifted into 'nodeptr'. */
-    *nodeptr = *array->nodes;
-    /* Shift the nodes array and decrement length. */
-    array->nodes++;
-    array->len--;
-}
-
-static void clusterManagerNodeArrayAdd(clusterManagerNodeArray *array,
-                                       clusterManagerNode *node)
-{
-    assert(array->len > 0);
-    assert(node != NULL);
-    assert(array->count < array->len);
-    array->nodes[array->count++] = node;
-}
-
-static void clusterManagerPrintNotEmptyNodeError(clusterManagerNode *node,
-                                                 char *err)
-{
-    char *msg;
-    if (err) msg = err;
-    else {
-        msg = "is not empty. Either the node already knows other "
-              "nodes (check with CLUSTER NODES) or contains some "
-              "key in database 0.";
-    }
-    clusterManagerLogErr("[ERR] Node %s:%d %s\n", node->ip, node->port, msg);
-}
-
-static void clusterManagerPrintNotClusterNodeError(clusterManagerNode *node,
-                                                   char *err)
-{
-    char *msg = (err ? err : "is not configured as a cluster node.");
-    clusterManagerLogErr("[ERR] Node %s:%d %s\n", node->ip, node->port, msg);
-}
-
-/* Execute redis-cli in Cluster Manager mode */
-static void clusterManagerMode(clusterManagerCommandProc *proc) {
-    int argc = config.cluster_manager_command.argc;
-    char **argv = config.cluster_manager_command.argv;
-    cluster_manager.nodes = NULL;
-    if (!proc(argc, argv)) goto cluster_manager_err;
-    freeClusterManager();
-    exit(0);
-cluster_manager_err:
-    freeClusterManager();
-    exit(1);
-}
-
-/* Cluster Manager Commands */
-
-static int clusterManagerCommandCreate(int argc, char **argv) {
-    int i, j, success = 1;
-    cluster_manager.nodes = listCreate();
-    for (i = 0; i < argc; i++) {
-        char *addr = argv[i];
-        char *c = strrchr(addr, '@');
-        if (c != NULL) *c = '\0';
-        c = strrchr(addr, ':');
-        if (c == NULL) {
-            fprintf(stderr, "Invalid address format: %s\n", addr);
-            return 0;
-        }
-        *c = '\0';
-        char *ip = addr;
-        int port = atoi(++c);
-        clusterManagerNode *node = clusterManagerNewNode(ip, port);
-        if (!clusterManagerNodeConnect(node)) {
-            freeClusterManagerNode(node);
-            return 0;
-        }
-        char *err = NULL;
-        if (!clusterManagerNodeIsCluster(node, &err)) {
-            clusterManagerPrintNotClusterNodeError(node, err);
-            if (err) zfree(err);
-            freeClusterManagerNode(node);
-            return 0;
-        }
-        err = NULL;
-        if (!clusterManagerNodeLoadInfo(node, 0, &err)) {
-            if (err) {
-                CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-                zfree(err);
-            }
-            freeClusterManagerNode(node);
-            return 0;
-        }
-        err = NULL;
-        if (!clusterManagerNodeIsEmpty(node, &err)) {
-            clusterManagerPrintNotEmptyNodeError(node, err);
-            if (err) zfree(err);
-            freeClusterManagerNode(node);
-            return 0;
-        }
-        listAddNodeTail(cluster_manager.nodes, node);
-    }
-    int node_len = cluster_manager.nodes->len;
-    int replicas = config.cluster_manager_command.replicas;
-    int masters_count = CLUSTER_MANAGER_MASTERS_COUNT(node_len, replicas);
-    if (masters_count < 3) {
-        clusterManagerLogErr(
-            "*** ERROR: Invalid configuration for cluster creation.\n"
-            "*** Redis Cluster requires at least 3 master nodes.\n"
-            "*** This is not possible with %d nodes and %d replicas per node.",
-            node_len, replicas);
-        clusterManagerLogErr("\n*** At least %d nodes are required.\n",
-                             3 * (replicas + 1));
-        return 0;
-    }
-    clusterManagerLogInfo(">>> Performing hash slots allocation "
-                          "on %d nodes...\n", node_len);
-    int interleaved_len = 0, ip_count = 0;
-    clusterManagerNode **interleaved = zcalloc(node_len*sizeof(**interleaved));
-    char **ips = zcalloc(node_len * sizeof(char*));
-    clusterManagerNodeArray *ip_nodes = zcalloc(node_len * sizeof(*ip_nodes));
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        int found = 0;
-        for (i = 0; i < ip_count; i++) {
-            char *ip = ips[i];
-            if (!strcmp(ip, n->ip)) {
-                found = 1;
-                break;
-            }
-        }
-        if (!found) {
-            ips[ip_count++] = n->ip;
-        }
-        clusterManagerNodeArray *node_array = &(ip_nodes[i]);
-        if (node_array->nodes == NULL)
-            clusterManagerNodeArrayInit(node_array, node_len);
-        clusterManagerNodeArrayAdd(node_array, n);
-    }
-    while (interleaved_len < node_len) {
-        for (i = 0; i < ip_count; i++) {
-            clusterManagerNodeArray *node_array = &(ip_nodes[i]);
-            if (node_array->count > 0) {
-                clusterManagerNode *n = NULL;
-                clusterManagerNodeArrayShift(node_array, &n);
-                interleaved[interleaved_len++] = n;
-            }
-        }
-    }
-    clusterManagerNode **masters = interleaved;
-    interleaved += masters_count;
-    interleaved_len -= masters_count;
-    float slots_per_node = CLUSTER_MANAGER_SLOTS / (float) masters_count;
-    long first = 0;
-    float cursor = 0.0f;
-    for (i = 0; i < masters_count; i++) {
-        clusterManagerNode *master = masters[i];
-        long last = lround(cursor + slots_per_node - 1);
-        if (last > CLUSTER_MANAGER_SLOTS || i == (masters_count - 1))
-            last = CLUSTER_MANAGER_SLOTS - 1;
-        if (last < first) last = first;
-        printf("Master[%d] -> Slots %ld - %ld\n", i, first, last);
-        master->slots_count = 0;
-        for (j = first; j <= last; j++) {
-            master->slots[j] = 1;
-            master->slots_count++;
-        }
-        master->dirty = 1;
-        first = last + 1;
-        cursor += slots_per_node;
-    }
-
-    /* Rotating the list sometimes helps to get better initial
-     * anti-affinity before the optimizer runs. */
-    clusterManagerNode *first_node = interleaved[0];
-    for (i = 0; i < (interleaved_len - 1); i++)
-        interleaved[i] = interleaved[i + 1];
-    interleaved[interleaved_len - 1] = first_node;
-    int assign_unused = 0, available_count = interleaved_len;
-assign_replicas:
-    for (i = 0; i < masters_count; i++) {
-        clusterManagerNode *master = masters[i];
-        int assigned_replicas = 0;
-        while (assigned_replicas < replicas) {
-            if (available_count == 0) break;
-            clusterManagerNode *found = NULL, *slave = NULL;
-            int firstNodeIdx = -1;
-            for (j = 0; j < interleaved_len; j++) {
-                clusterManagerNode *n = interleaved[j];
-                if (n == NULL) continue;
-                if (strcmp(n->ip, master->ip)) {
-                    found = n;
-                    interleaved[j] = NULL;
-                    break;
-                }
-                if (firstNodeIdx < 0) firstNodeIdx = j;
-            }
-            if (found) slave = found;
-            else if (firstNodeIdx >= 0) {
-                slave = interleaved[firstNodeIdx];
-                interleaved_len -= (interleaved - (interleaved + firstNodeIdx));
-                interleaved += (firstNodeIdx + 1);
-            }
-            if (slave != NULL) {
-                assigned_replicas++;
-                available_count--;
-                if (slave->replicate) sdsfree(slave->replicate);
-                slave->replicate = sdsnew(master->name);
-                slave->dirty = 1;
-            } else break;
-            printf("Adding replica %s:%d to %s:%d\n", slave->ip, slave->port,
-                   master->ip, master->port);
-            if (assign_unused) break;
-        }
-    }
-    if (!assign_unused && available_count > 0) {
-        assign_unused = 1;
-        printf("Adding extra replicas...\n");
-        goto assign_replicas;
-    }
-    for (i = 0; i < ip_count; i++) {
-        clusterManagerNodeArray *node_array = ip_nodes + i;
-        clusterManagerNodeArrayReset(node_array);
-    }
-    clusterManagerOptimizeAntiAffinity(ip_nodes, ip_count);
-    clusterManagerShowNodes();
-    int ignore_force = 0;
-    if (confirmWithYes("Can I set the above configuration?", ignore_force)) {
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *node = ln->value;
-            char *err = NULL;
-            int flushed = clusterManagerFlushNodeConfig(node, &err);
-            if (!flushed && node->dirty && !node->replicate) {
-                if (err != NULL) {
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-                    zfree(err);
-                }
-                success = 0;
-                goto cleanup;
-            } else if (err != NULL) zfree(err);
-        }
-        clusterManagerLogInfo(">>> Nodes configuration updated\n");
-        clusterManagerLogInfo(">>> Assign a different config epoch to "
-                              "each node\n");
-        int config_epoch = 1;
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *node = ln->value;
-            redisReply *reply = NULL;
-            reply = CLUSTER_MANAGER_COMMAND(node,
-                                            "cluster set-config-epoch %d",
-                                            config_epoch++);
-            if (reply != NULL) freeReplyObject(reply);
-        }
-        clusterManagerLogInfo(">>> Sending CLUSTER MEET messages to join "
-                              "the cluster\n");
-        clusterManagerNode *first = NULL;
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *node = ln->value;
-            if (first == NULL) {
-                first = node;
-                continue;
-            }
-            redisReply *reply = NULL;
-            reply = CLUSTER_MANAGER_COMMAND(node, "cluster meet %s %d",
-                                            first->ip, first->port);
-            int is_err = 0;
-            if (reply != NULL) {
-                if ((is_err = reply->type == REDIS_REPLY_ERROR))
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, reply->str);
-                freeReplyObject(reply);
-            } else {
-                is_err = 1;
-                fprintf(stderr, "Failed to send CLUSTER MEET command.\n");
-            }
-            if (is_err) {
-                success = 0;
-                goto cleanup;
-            }
-        }
-        /* Give one second for the join to start, in order to avoid that
-         * waiting for cluster join will find all the nodes agree about
-         * the config as they are still empty with unassigned slots. */
-        sleep(1);
-        clusterManagerWaitForClusterJoin();
-        /* Useful for the replicas */
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *node = ln->value;
-            if (!node->dirty) continue;
-            char *err = NULL;
-            int flushed = clusterManagerFlushNodeConfig(node, &err);
-            if (!flushed && !node->replicate) {
-                if (err != NULL) {
-                    CLUSTER_MANAGER_PRINT_REPLY_ERROR(node, err);
-                    zfree(err);
-                }
-                success = 0;
-                goto cleanup;
-            }
-        }
-        // Reset Nodes
-        listRewind(cluster_manager.nodes, &li);
-        clusterManagerNode *first_node = NULL;
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *node = ln->value;
-            if (!first_node) first_node = node;
-            else freeClusterManagerNode(node);
-        }
-        listEmpty(cluster_manager.nodes);
-        if (!clusterManagerLoadInfoFromNode(first_node, 0)) {
-            success = 0;
-            goto cleanup;
-        }
-        clusterManagerCheckCluster(0);
-    }
-cleanup:
-    /* Free everything */
-    zfree(masters);
-    zfree(ips);
-    for (i = 0; i < node_len; i++) {
-        clusterManagerNodeArray *node_array = ip_nodes + i;
-        CLUSTER_MANAGER_NODE_ARRAY_FREE(node_array);
-    }
-    zfree(ip_nodes);
-    return success;
-}
-
-static int clusterManagerCommandAddNode(int argc, char **argv) {
-    int success = 1;
-    redisReply *reply = NULL;
-    char *ref_ip = NULL, *ip = NULL;
-    int ref_port = 0, port = 0;
-    if (!getClusterHostFromCmdArgs(argc - 1, argv + 1, &ref_ip, &ref_port))
-        goto invalid_args;
-    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port))
-        goto invalid_args;
-    clusterManagerLogInfo(">>> Adding node %s:%d to cluster %s:%d\n", ip, port,
-                          ref_ip, ref_port);
-    // Check the existing cluster
-    clusterManagerNode *refnode = clusterManagerNewNode(ref_ip, ref_port);
-    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
-    if (!clusterManagerCheckCluster(0)) return 0;
-
-    /* If --cluster-master-id was specified, try to resolve it now so that we
-     * abort before starting with the node configuration. */
-    clusterManagerNode *master_node = NULL;
-    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_SLAVE) {
-        char *master_id = config.cluster_manager_command.master_id;
-        if (master_id != NULL) {
-            master_node = clusterManagerNodeByName(master_id);
-            if (master_node == NULL) {
-                clusterManagerLogErr("[ERR] No such master ID %s\n", master_id);
-                return 0;
-            }
-        } else {
-            master_node = clusterManagerNodeWithLeastReplicas();
-            assert(master_node != NULL);
-            printf("Automatically selected master %s:%d\n", master_node->ip,
-                   master_node->port);
-        }
-    }
-
-    // Add the new node
-    clusterManagerNode *new_node = clusterManagerNewNode(ip, port);
-    int added = 0;
-    if (!clusterManagerNodeConnect(new_node)) {
-        clusterManagerLogErr("[ERR] Sorry, can't connect to node %s:%d\n",
-                             ip, port);
-        success = 0;
-        goto cleanup;
-    }
-    char *err = NULL;
-    if (!(success = clusterManagerNodeIsCluster(new_node, &err))) {
-        clusterManagerPrintNotClusterNodeError(new_node, err);
-        if (err) zfree(err);
-        goto cleanup;
-    }
-    if (!clusterManagerNodeLoadInfo(new_node, 0, &err)) {
-        if (err) {
-            CLUSTER_MANAGER_PRINT_REPLY_ERROR(new_node, err);
-            zfree(err);
-        }
-        success = 0;
-        goto cleanup;
-    }
-    if (!(success = clusterManagerNodeIsEmpty(new_node, &err))) {
-        clusterManagerPrintNotEmptyNodeError(new_node, err);
-        if (err) zfree(err);
-        goto cleanup;
-    }
-    clusterManagerNode *first = listFirst(cluster_manager.nodes)->value;
-    listAddNodeTail(cluster_manager.nodes, new_node);
-    added = 1;
-
-    // Send CLUSTER MEET command to the new node
-    clusterManagerLogInfo(">>> Send CLUSTER MEET to node %s:%d to make it "
-                          "join the cluster.\n", ip, port);
-    reply = CLUSTER_MANAGER_COMMAND(new_node, "CLUSTER MEET %s %d",
-                                    first->ip, first->port);
-    if (!(success = clusterManagerCheckRedisReply(new_node, reply, NULL)))
-        goto cleanup;
-
-    /* Additional configuration is needed if the node is added as a slave. */
-    if (master_node) {
-        sleep(1);
-        clusterManagerWaitForClusterJoin();
-        clusterManagerLogInfo(">>> Configure node as replica of %s:%d.\n",
-                              master_node->ip, master_node->port);
-        freeReplyObject(reply);
-        reply = CLUSTER_MANAGER_COMMAND(new_node, "CLUSTER REPLICATE %s",
-                                        master_node->name);
-        if (!(success = clusterManagerCheckRedisReply(new_node, reply, NULL)))
-            goto cleanup;
-    }
-    clusterManagerLogOk("[OK] New node added correctly.\n");
-cleanup:
-    if (!added && new_node) freeClusterManagerNode(new_node);
-    if (reply) freeReplyObject(reply);
-    return success;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandDeleteNode(int argc, char **argv) {
-    UNUSED(argc);
-    int success = 1;
-    int port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
-    char *node_id = argv[1];
-    clusterManagerLogInfo(">>> Removing node %s from cluster %s:%d\n",
-                          node_id, ip, port);
-    clusterManagerNode *ref_node = clusterManagerNewNode(ip, port);
-    clusterManagerNode *node = NULL;
-
-    // Load cluster information
-    if (!clusterManagerLoadInfoFromNode(ref_node, 0)) return 0;
-
-    // Check if the node exists and is not empty
-    node = clusterManagerNodeByName(node_id);
-    if (node == NULL) {
-        clusterManagerLogErr("[ERR] No such node ID %s\n", node_id);
-        return 0;
-    }
-    if (node->slots_count != 0) {
-        clusterManagerLogErr("[ERR] Node %s:%d is not empty! Reshard data "
-                             "away and try again.\n", node->ip, node->port);
-        return 0;
-    }
-
-    // Send CLUSTER FORGET to all the nodes but the node to remove
-    clusterManagerLogInfo(">>> Sending CLUSTER FORGET messages to the "
-                          "cluster...\n");
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n == node) continue;
-        if (n->replicate && !strcasecmp(n->replicate, node_id)) {
-            // Reconfigure the slave to replicate with some other node
-            clusterManagerNode *master = clusterManagerNodeWithLeastReplicas();
-            assert(master != NULL);
-            clusterManagerLogInfo(">>> %s:%d as replica of %s:%d\n",
-                                  n->ip, n->port, master->ip, master->port);
-            redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER REPLICATE %s",
-                                                    master->name);
-            success = clusterManagerCheckRedisReply(n, r, NULL);
-            if (r) freeReplyObject(r);
-            if (!success) return 0;
-        }
-        redisReply *r = CLUSTER_MANAGER_COMMAND(n, "CLUSTER FORGET %s",
-                                                node_id);
-        success = clusterManagerCheckRedisReply(n, r, NULL);
-        if (r) freeReplyObject(r);
-        if (!success) return 0;
-    }
-
-    /* Finally send CLUSTER RESET to the node. */
-    clusterManagerLogInfo(">>> Sending CLUSTER RESET SOFT to the "
-                          "deleted node.\n");
-    redisReply *r = redisCommand(node->context, "CLUSTER RESET %s", "SOFT");
-    success = clusterManagerCheckRedisReply(node, r, NULL);
-    if (r) freeReplyObject(r);
-    return success;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandInfo(int argc, char **argv) {
-    int port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *node = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
-    clusterManagerShowClusterInfo();
-    return 1;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandCheck(int argc, char **argv) {
-    int port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *node = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
-    clusterManagerShowClusterInfo();
-    return clusterManagerCheckCluster(0);
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandFix(int argc, char **argv) {
-    config.cluster_manager_command.flags |= CLUSTER_MANAGER_CMD_FLAG_FIX;
-    return clusterManagerCommandCheck(argc, argv);
-}
-
-static int clusterManagerCommandReshard(int argc, char **argv) {
-    int port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *node = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
-    clusterManagerCheckCluster(0);
-    if (cluster_manager.errors && listLength(cluster_manager.errors) > 0) {
-        fflush(stdout);
-        fprintf(stderr,
-                "*** Please fix your cluster problems before resharding\n");
-        return 0;
-    }
-    int slots = config.cluster_manager_command.slots;
-    if (!slots) {
-        while (slots <= 0 || slots > CLUSTER_MANAGER_SLOTS) {
-            printf("How many slots do you want to move (from 1 to %d)? ",
-                   CLUSTER_MANAGER_SLOTS);
-            fflush(stdout);
-            char buf[6];
-            int nread = read(fileno(stdin),buf,6);
-            if (nread <= 0) continue;
-            int last_idx = nread - 1;
-            if (buf[last_idx] != '\n') {
-                int ch;
-                while ((ch = getchar()) != '\n' && ch != EOF) {}
-            }
-            buf[last_idx] = '\0';
-            slots = atoi(buf);
-        }
-    }
-    char buf[255];
-    char *to = config.cluster_manager_command.to,
-         *from = config.cluster_manager_command.from;
-    while (to == NULL) {
-        printf("What is the receiving node ID? ");
-        fflush(stdout);
-        int nread = read(fileno(stdin),buf,255);
-        if (nread <= 0) continue;
-        int last_idx = nread - 1;
-        if (buf[last_idx] != '\n') {
-            int ch;
-            while ((ch = getchar()) != '\n' && ch != EOF) {}
-        }
-        buf[last_idx] = '\0';
-        if (strlen(buf) > 0) to = buf;
-    }
-    int raise_err = 0;
-    clusterManagerNode *target = clusterNodeForResharding(to, NULL, &raise_err);
-    if (target == NULL) return 0;
-    list *sources = listCreate();
-    list *table = NULL;
-    int all = 0, result = 1;
-    if (from == NULL) {
-        printf("Please enter all the source node IDs.\n");
-        printf("  Type 'all' to use all the nodes as source nodes for "
-               "the hash slots.\n");
-        printf("  Type 'done' once you entered all the source nodes IDs.\n");
-        while (1) {
-            printf("Source node #%lu: ", listLength(sources) + 1);
-            fflush(stdout);
-            int nread = read(fileno(stdin),buf,255);
-            if (nread <= 0) continue;
-            int last_idx = nread - 1;
-            if (buf[last_idx] != '\n') {
-                int ch;
-                while ((ch = getchar()) != '\n' && ch != EOF) {}
-            }
-            buf[last_idx] = '\0';
-            if (!strcmp(buf, "done")) break;
-            else if (!strcmp(buf, "all")) {
-                all = 1;
-                break;
-            } else {
-                clusterManagerNode *src =
-                    clusterNodeForResharding(buf, target, &raise_err);
-                if (src != NULL) listAddNodeTail(sources, src);
-                else if (raise_err) {
-                    result = 0;
-                    goto cleanup;
-                }
-            }
-        }
-    } else {
-        char *p;
-        while((p = strchr(from, ',')) != NULL) {
-            *p = '\0';
-            if (!strcmp(from, "all")) {
-                all = 1;
-                break;
-            } else {
-                clusterManagerNode *src =
-                    clusterNodeForResharding(from, target, &raise_err);
-                if (src != NULL) listAddNodeTail(sources, src);
-                else if (raise_err) {
-                    result = 0;
-                    goto cleanup;
-                }
-            }
-            from = p + 1;
-        }
-        /* Check if there's still another source to process. */
-        if (!all && strlen(from) > 0) {
-            if (!strcmp(from, "all")) all = 1;
-            if (!all) {
-                clusterManagerNode *src =
-                    clusterNodeForResharding(from, target, &raise_err);
-                if (src != NULL) listAddNodeTail(sources, src);
-                else if (raise_err) {
-                    result = 0;
-                    goto cleanup;
-                }
-            }
-        }
-    }
-    listIter li;
-    listNode *ln;
-    if (all) {
-        listEmpty(sources);
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
-                continue;
-            if (!sdscmp(n->name, target->name)) continue;
-            listAddNodeTail(sources, n);
-        }
-    }
-    if (listLength(sources) == 0) {
-        fprintf(stderr, "*** No source nodes given, operation aborted.\n");
-        result = 0;
-        goto cleanup;
-    }
-    printf("\nReady to move %d slots.\n", slots);
-    printf("  Source nodes:\n");
-    listRewind(sources, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *src = ln->value;
-        sds info = clusterManagerNodeInfo(src, 4);
-        printf("%s\n", info);
-        sdsfree(info);
-    }
-    printf("  Destination node:\n");
-    sds info = clusterManagerNodeInfo(target, 4);
-    printf("%s\n", info);
-    sdsfree(info);
-    table = clusterManagerComputeReshardTable(sources, slots);
-    printf("  Resharding plan:\n");
-    clusterManagerShowReshardTable(table);
-    if (!(config.cluster_manager_command.flags &
-          CLUSTER_MANAGER_CMD_FLAG_YES))
-    {
-        printf("Do you want to proceed with the proposed "
-               "reshard plan (yes/no)? ");
-        fflush(stdout);
-        char buf[4];
-        int nread = read(fileno(stdin),buf,4);
-        buf[3] = '\0';
-        if (nread <= 0 || strcmp("yes", buf) != 0) {
-            result = 0;
-            goto cleanup;
-        }
-    }
-    int opts = CLUSTER_MANAGER_OPT_VERBOSE;
-    listRewind(table, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerReshardTableItem *item = ln->value;
-        char *err = NULL;
-        result = clusterManagerMoveSlot(item->source, target, item->slot,
-                                        opts, &err);
-        if (!result) {
-            if (err != NULL) {
-                //clusterManagerLogErr("\n%s\n", err);
-                zfree(err);
-            }
-            goto cleanup;
-        }
-    }
-cleanup:
-    listRelease(sources);
-    clusterManagerReleaseReshardTable(table);
-    return result;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandRebalance(int argc, char **argv) {
-    int port = 0;
-    char *ip = NULL;
-    clusterManagerNode **weightedNodes = NULL;
-    list *involved = NULL;
-    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *node = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
-    int result = 1, i;
-    if (config.cluster_manager_command.weight != NULL) {
-        for (i = 0; i < config.cluster_manager_command.weight_argc; i++) {
-            char *name = config.cluster_manager_command.weight[i];
-            char *p = strchr(name, '=');
-            if (p == NULL) {
-                result = 0;
-                goto cleanup;
-            }
-            *p = '\0';
-            float w = atof(++p);
-            clusterManagerNode *n = clusterManagerNodeByAbbreviatedName(name);
-            if (n == NULL) {
-                clusterManagerLogErr("*** No such master node %s\n", name);
-                result = 0;
-                goto cleanup;
-            }
-            n->weight = w;
-        }
-    }
-    float total_weight = 0;
-    int nodes_involved = 0;
-    int use_empty = config.cluster_manager_command.flags &
-                    CLUSTER_MANAGER_CMD_FLAG_EMPTYMASTER;
-    involved = listCreate();
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    /* Compute the total cluster weight. */
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE || n->replicate)
-            continue;
-        if (!use_empty && n->slots_count == 0) {
-            n->weight = 0;
-            continue;
-        }
-        total_weight += n->weight;
-        nodes_involved++;
-        listAddNodeTail(involved, n);
-    }
-    weightedNodes = zmalloc(nodes_involved * sizeof(clusterManagerNode *));
-    if (weightedNodes == NULL) goto cleanup;
-    /* Check cluster, only proceed if it looks sane. */
-    clusterManagerCheckCluster(1);
-    if (cluster_manager.errors && listLength(cluster_manager.errors) > 0) {
-        clusterManagerLogErr("*** Please fix your cluster problems "
-                             "before rebalancing\n");
-        result = 0;
-        goto cleanup;
-    }
-    /* Calculate the slots balance for each node. It's the number of
-     * slots the node should lose (if positive) or gain (if negative)
-     * in order to be balanced. */
-    int threshold_reached = 0, total_balance = 0;
-    float threshold = config.cluster_manager_command.threshold;
-    i = 0;
-    listRewind(involved, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        weightedNodes[i++] = n;
-        int expected = (int) (((float)CLUSTER_MANAGER_SLOTS / total_weight) *
-                        n->weight);
-        n->balance = n->slots_count - expected;
-        total_balance += n->balance;
-        /* Compute the percentage of difference between the
-         * expected number of slots and the real one, to see
-         * if it's over the threshold specified by the user. */
-        int over_threshold = 0;
-        if (threshold > 0) {
-            if (n->slots_count > 0) {
-                float err_perc = fabs((100-(100.0*expected/n->slots_count)));
-                if (err_perc > threshold) over_threshold = 1;
-            } else if (expected > 1) {
-                over_threshold = 1;
-            }
-        }
-        if (over_threshold) threshold_reached = 1;
-    }
-    if (!threshold_reached) {
-        clusterManagerLogWarn("*** No rebalancing needed! "
-                             "All nodes are within the %.2f%% threshold.\n",
-                             config.cluster_manager_command.threshold);
-        goto cleanup;
-    }
-    /* Because of rounding, it is possible that the balance of all nodes
-     * summed does not give 0. Make sure that nodes that have to provide
-     * slots are always matched by nodes receiving slots. */
-    while (total_balance > 0) {
-        listRewind(involved, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n->balance <= 0 && total_balance > 0) {
-                n->balance--;
-                total_balance--;
-            }
-        }
-    }
-    /* Sort nodes by their slots balance. */
-    qsort(weightedNodes, nodes_involved, sizeof(clusterManagerNode *),
-          clusterManagerCompareNodeBalance);
-    clusterManagerLogInfo(">>> Rebalancing across %d nodes. "
-                          "Total weight = %.2f\n",
-                          nodes_involved, total_weight);
-    if (config.verbose) {
-        for (i = 0; i < nodes_involved; i++) {
-            clusterManagerNode *n = weightedNodes[i];
-            printf("%s:%d balance is %d slots\n", n->ip, n->port, n->balance);
-        }
-    }
-    /* Now we have at the start of the 'sn' array nodes that should get
-     * slots, at the end nodes that must give slots.
-     * We take two indexes, one at the start, and one at the end,
-     * incrementing or decrementing the indexes accordingly til we
-     * find nodes that need to get/provide slots. */
-    int dst_idx = 0;
-    int src_idx = nodes_involved - 1;
-    int simulate = config.cluster_manager_command.flags &
-                   CLUSTER_MANAGER_CMD_FLAG_SIMULATE;
-    while (dst_idx < src_idx) {
-        clusterManagerNode *dst = weightedNodes[dst_idx];
-        clusterManagerNode *src = weightedNodes[src_idx];
-        int db = abs(dst->balance);
-        int sb = abs(src->balance);
-        int numslots = (db < sb ? db : sb);
-        if (numslots > 0) {
-            printf("Moving %d slots from %s:%d to %s:%d\n", numslots,
-                                                            src->ip,
-                                                            src->port,
-                                                            dst->ip,
-                                                            dst->port);
-            /* Actually move the slots. */
-            list *lsrc = listCreate(), *table = NULL;
-            listAddNodeTail(lsrc, src);
-            table = clusterManagerComputeReshardTable(lsrc, numslots);
-            listRelease(lsrc);
-            int table_len = (int) listLength(table);
-            if (!table || table_len != numslots) {
-                clusterManagerLogErr("*** Assertion failed: Reshard table "
-                                     "!= number of slots");
-                result = 0;
-                goto end_move;
-            }
-            if (simulate) {
-                for (i = 0; i < table_len; i++) printf("#");
-            } else {
-                int opts = CLUSTER_MANAGER_OPT_QUIET |
-                           CLUSTER_MANAGER_OPT_UPDATE;
-                listRewind(table, &li);
-                while ((ln = listNext(&li)) != NULL) {
-                    clusterManagerReshardTableItem *item = ln->value;
-                    result = clusterManagerMoveSlot(item->source,
-                                                    dst,
-                                                    item->slot,
-                                                    opts, NULL);
-                    if (!result) goto end_move;
-                    printf("#");
-                    fflush(stdout);
-                }
-
-            }
-            printf("\n");
-end_move:
-            clusterManagerReleaseReshardTable(table);
-            if (!result) goto cleanup;
-        }
-        /* Update nodes balance. */
-        dst->balance += numslots;
-        src->balance -= numslots;
-        if (dst->balance == 0) dst_idx++;
-        if (src->balance == 0) src_idx --;
-    }
-cleanup:
-    if (involved != NULL) listRelease(involved);
-    if (weightedNodes != NULL) zfree(weightedNodes);
-    return result;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandSetTimeout(int argc, char **argv) {
-    UNUSED(argc);
-    int port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
-    int timeout = atoi(argv[1]);
-    if (timeout < 100) {
-        fprintf(stderr, "Setting a node timeout of less than 100 "
-                "milliseconds is a bad idea.\n");
-        return 0;
-    }
-    // Load cluster information
-    clusterManagerNode *node = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(node, 0)) return 0;
-    int ok_count = 0, err_count = 0;
-
-    clusterManagerLogInfo(">>> Reconfiguring node timeout in every "
-                          "cluster node...\n");
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        char *err = NULL;
-        redisReply *reply = CLUSTER_MANAGER_COMMAND(n, "CONFIG %s %s %d",
-                                                    "SET",
-                                                    "cluster-node-timeout",
-                                                    timeout);
-        if (reply == NULL) goto reply_err;
-        int ok = clusterManagerCheckRedisReply(n, reply, &err);
-        freeReplyObject(reply);
-        if (!ok) goto reply_err;
-        reply = CLUSTER_MANAGER_COMMAND(n, "CONFIG %s", "REWRITE");
-        if (reply == NULL) goto reply_err;
-        ok = clusterManagerCheckRedisReply(n, reply, &err);
-        freeReplyObject(reply);
-        if (!ok) goto reply_err;
-        clusterManagerLogWarn("*** New timeout set for %s:%d\n", n->ip,
-                              n->port);
-        ok_count++;
-        continue;
-reply_err:;
-        int need_free = 0;
-        if (err == NULL) err = "";
-        else need_free = 1;
-        clusterManagerLogErr("ERR setting node-timeot for %s:%d: %s\n", n->ip,
-                             n->port, err);
-        if (need_free) zfree(err);
-        err_count++;
-    }
-    clusterManagerLogInfo(">>> New node timeout set. %d OK, %d ERR.\n",
-                          ok_count, err_count);
-    return 1;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandImport(int argc, char **argv) {
-    int success = 1;
-    int port = 0, src_port = 0;
-    char *ip = NULL, *src_ip = NULL;
-    char *invalid_args_msg = NULL;
-    sds cmdfmt = NULL;
-    if (!getClusterHostFromCmdArgs(argc, argv, &ip, &port)) {
-        invalid_args_msg = CLUSTER_MANAGER_INVALID_HOST_ARG;
-        goto invalid_args;
-    }
-    if (config.cluster_manager_command.from == NULL) {
-        invalid_args_msg = "[ERR] Option '--cluster-from' is required for "
-                           "subcommand 'import'.\n";
-        goto invalid_args;
-    }
-    char *src_host[] = {config.cluster_manager_command.from};
-    if (!getClusterHostFromCmdArgs(1, src_host, &src_ip, &src_port)) {
-        invalid_args_msg = "[ERR] Invalid --cluster-from host. You need to "
-                           "pass a valid address (ie. 120.0.0.1:7000).\n";
-        goto invalid_args;
-    }
-    clusterManagerLogInfo(">>> Importing data from %s:%d to cluster %s:%d\n",
-                          src_ip, src_port, ip, port);
-
-    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
-    if (!clusterManagerCheckCluster(0)) return 0;
-    char *reply_err = NULL;
-    redisReply *src_reply = NULL;
-    // Connect to the source node.
-    redisContext *src_ctx = redisConnect(src_ip, src_port);
-    if (src_ctx->err) {
-        success = 0;
-        fprintf(stderr,"Could not connect to Redis at %s:%d: %s.\n", src_ip,
-                src_port, src_ctx->errstr);
-        goto cleanup;
-    }
-    // Auth for the source node. 
-    char *from_user = config.cluster_manager_command.from_user;
-    char *from_pass = config.cluster_manager_command.from_pass;
-    if (cliAuth(src_ctx, from_user, from_pass) == REDIS_ERR) {
-        success = 0;
-        goto cleanup;
-    }
-
-    src_reply = reconnectingRedisCommand(src_ctx, "INFO");
-    if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
-        if (src_reply && src_reply->str) reply_err = src_reply->str;
-        success = 0;
-        goto cleanup;
-    }
-    if (getLongInfoField(src_reply->str, "cluster_enabled")) {
-        clusterManagerLogErr("[ERR] The source node should not be a "
-                             "cluster node.\n");
-        success = 0;
-        goto cleanup;
-    }
-    freeReplyObject(src_reply);
-    src_reply = reconnectingRedisCommand(src_ctx, "DBSIZE");
-    if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
-        if (src_reply && src_reply->str) reply_err = src_reply->str;
-        success = 0;
-        goto cleanup;
-    }
-    int size = src_reply->integer, i;
-    clusterManagerLogWarn("*** Importing %d keys from DB 0\n", size);
-
-    // Build a slot -> node map
-    clusterManagerNode  *slots_map[CLUSTER_MANAGER_SLOTS];
-    memset(slots_map, 0, sizeof(slots_map));
-    listIter li;
-    listNode *ln;
-    for (i = 0; i < CLUSTER_MANAGER_SLOTS; i++) {
-        listRewind(cluster_manager.nodes, &li);
-        while ((ln = listNext(&li)) != NULL) {
-            clusterManagerNode *n = ln->value;
-            if (n->flags & CLUSTER_MANAGER_FLAG_SLAVE) continue;
-            if (n->slots_count == 0) continue;
-            if (n->slots[i]) {
-                slots_map[i] = n;
-                break;
-            }
-        }
-    }
-    cmdfmt = sdsnew("MIGRATE %s %d %s %d %d");
-    if (config.auth) {
-        if (config.user) {
-            cmdfmt = sdscatfmt(cmdfmt," AUTH2 %s %s", config.user, config.auth); 
-        } else {
-            cmdfmt = sdscatfmt(cmdfmt," AUTH %s", config.auth);
-        }
-    }
-
-    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_COPY)
-        cmdfmt = sdscat(cmdfmt," COPY");
-    if (config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_REPLACE)
-        cmdfmt = sdscat(cmdfmt," REPLACE");
-
-    /* Use SCAN to iterate over the keys, migrating to the
-     * right node as needed. */
-    int cursor = -999, timeout = config.cluster_manager_command.timeout;
-    while (cursor != 0) {
-        if (cursor < 0) cursor = 0;
-        freeReplyObject(src_reply);
-        src_reply = reconnectingRedisCommand(src_ctx, "SCAN %d COUNT %d",
-                                             cursor, 1000);
-        if (!src_reply || src_reply->type == REDIS_REPLY_ERROR) {
-            if (src_reply && src_reply->str) reply_err = src_reply->str;
-            success = 0;
-            goto cleanup;
-        }
-        assert(src_reply->type == REDIS_REPLY_ARRAY);
-        assert(src_reply->elements >= 2);
-        assert(src_reply->element[1]->type == REDIS_REPLY_ARRAY);
-        if (src_reply->element[0]->type == REDIS_REPLY_STRING)
-            cursor = atoi(src_reply->element[0]->str);
-        else if (src_reply->element[0]->type == REDIS_REPLY_INTEGER)
-            cursor = src_reply->element[0]->integer;
-        int keycount = src_reply->element[1]->elements;
-        for (i = 0; i < keycount; i++) {
-            redisReply *kr = src_reply->element[1]->element[i];
-            assert(kr->type == REDIS_REPLY_STRING);
-            char *key = kr->str;
-            uint16_t slot = clusterManagerKeyHashSlot(key, kr->len);
-            clusterManagerNode *target = slots_map[slot];
-            printf("Migrating %s to %s:%d: ", key, target->ip, target->port);
-            redisReply *r = reconnectingRedisCommand(src_ctx, cmdfmt,
-                                                     target->ip, target->port,
-                                                     key, 0, timeout);
-            if (!r || r->type == REDIS_REPLY_ERROR) {
-                if (r && r->str) {
-                    clusterManagerLogErr("Source %s:%d replied with "
-                                         "error:\n%s\n", src_ip, src_port,
-                                         r->str);
-                }
-                success = 0;
-            }
-            freeReplyObject(r);
-            if (!success) goto cleanup;
-            clusterManagerLogOk("OK\n");
-        }
-    }
-cleanup:
-    if (reply_err)
-        clusterManagerLogErr("Source %s:%d replied with error:\n%s\n",
-                             src_ip, src_port, reply_err);
-    if (src_ctx) redisFree(src_ctx);
-    if (src_reply) freeReplyObject(src_reply);
-    if (cmdfmt) sdsfree(cmdfmt);
-    return success;
-invalid_args:
-    fprintf(stderr, "%s", invalid_args_msg);
-    return 0;
-}
-
-static int clusterManagerCommandCall(int argc, char **argv) {
-    int port = 0, i;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
-    argc--;
-    argv++;
-    size_t *argvlen = zmalloc(argc*sizeof(size_t));
-    clusterManagerLogInfo(">>> Calling");
-    for (i = 0; i < argc; i++) {
-        argvlen[i] = strlen(argv[i]);
-        printf(" %s", argv[i]);
-    }
-    printf("\n");
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        clusterManagerNode *n = ln->value;
-        if ((config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_MASTERS_ONLY)
-              && (n->replicate != NULL)) continue;  // continue if node is slave
-        if ((config.cluster_manager_command.flags & CLUSTER_MANAGER_CMD_FLAG_SLAVES_ONLY)
-              && (n->replicate == NULL)) continue;   // continue if node is master
-        if (!n->context && !clusterManagerNodeConnect(n)) continue;
-        redisReply *reply = NULL;
-        redisAppendCommandArgv(n->context, argc, (const char **) argv, argvlen);
-        int status = redisGetReply(n->context, (void **)(&reply));
-        if (status != REDIS_OK || reply == NULL )
-            printf("%s:%d: Failed!\n", n->ip, n->port);
-        else {
-            sds formatted_reply = cliFormatReplyRaw(reply);
-            printf("%s:%d: %s\n", n->ip, n->port, (char *) formatted_reply);
-            sdsfree(formatted_reply);
-        }
-        if (reply != NULL) freeReplyObject(reply);
-    }
-    zfree(argvlen);
-    return 1;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandBackup(int argc, char **argv) {
-    UNUSED(argc);
-    int success = 1, port = 0;
-    char *ip = NULL;
-    if (!getClusterHostFromCmdArgs(1, argv, &ip, &port)) goto invalid_args;
-    clusterManagerNode *refnode = clusterManagerNewNode(ip, port);
-    if (!clusterManagerLoadInfoFromNode(refnode, 0)) return 0;
-    int no_issues = clusterManagerCheckCluster(0);
-    int cluster_errors_count = (no_issues ? 0 :
-                                listLength(cluster_manager.errors));
-    config.cluster_manager_command.backup_dir = argv[1];
-    /* TODO: check if backup_dir is a valid directory. */
-    sds json = sdsnew("[\n");
-    int first_node = 0;
-    listIter li;
-    listNode *ln;
-    listRewind(cluster_manager.nodes, &li);
-    while ((ln = listNext(&li)) != NULL) {
-        if (!first_node) first_node = 1;
-        else json = sdscat(json, ",\n");
-        clusterManagerNode *node = ln->value;
-        sds node_json = clusterManagerNodeGetJSON(node, cluster_errors_count);
-        json = sdscat(json, node_json);
-        sdsfree(node_json);
-        if (node->replicate)
-            continue;
-        clusterManagerLogInfo(">>> Node %s:%d -> Saving RDB...\n",
-                              node->ip, node->port);
-        fflush(stdout);
-        getRDB(node);
-    }
-    json = sdscat(json, "\n]");
-    sds jsonpath = sdsnew(config.cluster_manager_command.backup_dir);
-    if (jsonpath[sdslen(jsonpath) - 1] != '/')
-        jsonpath = sdscat(jsonpath, "/");
-    jsonpath = sdscat(jsonpath, "nodes.json");
-    fflush(stdout);
-    clusterManagerLogInfo("Saving cluster configuration to: %s\n", jsonpath);
-    FILE *out = fopen(jsonpath, "w+");
-    if (!out) {
-        clusterManagerLogErr("Could not save nodes to: %s\n", jsonpath);
-        success = 0;
-        goto cleanup;
-    }
-    fputs(json, out);
-    fclose(out);
-cleanup:
-    sdsfree(json);
-    sdsfree(jsonpath);
-    if (success) {
-        if (!no_issues) {
-            clusterManagerLogWarn("*** Cluster seems to have some problems, "
-                                  "please be aware of it if you're going "
-                                  "to restore this backup.\n");
-        }
-        clusterManagerLogOk("[OK] Backup created into: %s\n",
-                            config.cluster_manager_command.backup_dir);
-    } else clusterManagerLogOk("[ERR] Failed to back cluster!\n");
-    return success;
-invalid_args:
-    fprintf(stderr, CLUSTER_MANAGER_INVALID_HOST_ARG);
-    return 0;
-}
-
-static int clusterManagerCommandHelp(int argc, char **argv) {
-    UNUSED(argc);
-    UNUSED(argv);
-    int commands_count = sizeof(clusterManagerCommands) /
-                         sizeof(clusterManagerCommandDef);
-    int i = 0, j;
-    fprintf(stderr, "Cluster Manager Commands:\n");
-    int padding = 15;
-    for (; i < commands_count; i++) {
-        clusterManagerCommandDef *def = &(clusterManagerCommands[i]);
-        int namelen = strlen(def->name), padlen = padding - namelen;
-        fprintf(stderr, "  %s", def->name);
-        for (j = 0; j < padlen; j++) fprintf(stderr, " ");
-        fprintf(stderr, "%s\n", (def->args ? def->args : ""));
-        if (def->options != NULL) {
-            int optslen = strlen(def->options);
-            char *p = def->options, *eos = p + optslen;
-            char *comma = NULL;
-            while ((comma = strchr(p, ',')) != NULL) {
-                int deflen = (int)(comma - p);
-                char buf[255];
-                memcpy(buf, p, deflen);
-                buf[deflen] = '\0';
-                for (j = 0; j < padding; j++) fprintf(stderr, " ");
-                fprintf(stderr, "  --cluster-%s\n", buf);
-                p = comma + 1;
-                if (p >= eos) break;
-            }
-            if (p < eos) {
-                for (j = 0; j < padding; j++) fprintf(stderr, " ");
-                fprintf(stderr, "  --cluster-%s\n", p);
-            }
-        }
-    }
-    fprintf(stderr, "\nFor check, fix, reshard, del-node, set-timeout you "
-                    "can specify the host and port of any working node in "
-                    "the cluster.\n");
-
-    int options_count = sizeof(clusterManagerOptions) /
-                        sizeof(clusterManagerOptionDef);
-    i = 0;
-    fprintf(stderr, "\nCluster Manager Options:\n");
-    for (; i < options_count; i++) {
-        clusterManagerOptionDef *def = &(clusterManagerOptions[i]);
-        int namelen = strlen(def->name), padlen = padding - namelen;
-        fprintf(stderr, "  %s", def->name);
-        for (j = 0; j < padlen; j++) fprintf(stderr, " ");
-        fprintf(stderr, "%s\n", def->desc);
-    }
-
-    fprintf(stderr, "\n");
-    return 0;
-}
-
-/*------------------------------------------------------------------------------
- * Latency and latency history modes
- *--------------------------------------------------------------------------- */
-
-static void latencyModePrint(long long min, long long max, double avg, long long count) {
-    if (config.output == OUTPUT_STANDARD) {
-        printf("min: %lld, max: %lld, avg: %.2f (%lld samples)",
-                min, max, avg, count);
-        fflush(stdout);
-    } else if (config.output == OUTPUT_CSV) {
-        printf("%lld,%lld,%.2f,%lld\n", min, max, avg, count);
-    } else if (config.output == OUTPUT_RAW) {
-        printf("%lld %lld %.2f %lld\n", min, max, avg, count);
-    }
-}
-
-#define LATENCY_SAMPLE_RATE 10 /* milliseconds. */
-#define LATENCY_HISTORY_DEFAULT_INTERVAL 15000 /* milliseconds. */
-static void latencyMode(void) {
-    redisReply *reply;
-    long long start, latency, min = 0, max = 0, tot = 0, count = 0;
-    long long history_interval =
-        config.interval ? config.interval/1000 :
-                          LATENCY_HISTORY_DEFAULT_INTERVAL;
-    double avg;
-    long long history_start = mstime();
-
-    /* Set a default for the interval in case of --latency option
-     * with --raw, --csv or when it is redirected to non tty. */
-    if (config.interval == 0) {
-        config.interval = 1000;
-    } else {
-        config.interval /= 1000; /* We need to convert to milliseconds. */
-    }
-
-    if (!context) exit(1);
-    while(1) {
-        start = mstime();
-        reply = reconnectingRedisCommand(context,"PING");
-        if (reply == NULL) {
-            fprintf(stderr,"\nI/O error\n");
-            exit(1);
-        }
-        latency = mstime()-start;
-        freeReplyObject(reply);
-        count++;
-        if (count == 1) {
-            min = max = tot = latency;
-            avg = (double) latency;
-        } else {
-            if (latency < min) min = latency;
-            if (latency > max) max = latency;
-            tot += latency;
-            avg = (double) tot/count;
-        }
-
-        if (config.output == OUTPUT_STANDARD) {
-            printf("\x1b[0G\x1b[2K"); /* Clear the line. */
-            latencyModePrint(min,max,avg,count);
-        } else {
-            if (config.latency_history) {
-                latencyModePrint(min,max,avg,count);
-            } else if (mstime()-history_start > config.interval) {
-                latencyModePrint(min,max,avg,count);
-                exit(0);
-            }
-        }
-
-        if (config.latency_history && mstime()-history_start > history_interval)
-        {
-            printf(" -- %.2f seconds range\n", (float)(mstime()-history_start)/1000);
-            history_start = mstime();
-            min = max = tot = count = 0;
-        }
-        usleep(LATENCY_SAMPLE_RATE * 1000);
-    }
-}
-
-/*------------------------------------------------------------------------------
- * Latency distribution mode -- requires 256 colors xterm
- *--------------------------------------------------------------------------- */
-
-#define LATENCY_DIST_DEFAULT_INTERVAL 1000 /* milliseconds. */
-
-/* Structure to store samples distribution. */
-struct distsamples {
-    long long max;   /* Max latency to fit into this interval (usec). */
-    long long count; /* Number of samples in this interval. */
-    int character;   /* Associated character in visualization. */
-};
-
-/* Helper function for latencyDistMode(). Performs the spectrum visualization
- * of the collected samples targeting an xterm 256 terminal.
- *
- * Takes an array of distsamples structures, ordered from smaller to bigger
- * 'max' value. Last sample max must be 0, to mean that it olds all the
- * samples greater than the previous one, and is also the stop sentinel.
- *
- * "tot' is the total number of samples in the different buckets, so it
- * is the SUM(samples[i].count) for i to 0 up to the max sample.
- *
- * As a side effect the function sets all the buckets count to 0. */
-void showLatencyDistSamples(struct distsamples *samples, long long tot) {
-    int j;
-
-     /* We convert samples into an index inside the palette
-     * proportional to the percentage a given bucket represents.
-     * This way intensity of the different parts of the spectrum
-     * don't change relative to the number of requests, which avoids to
-     * pollute the visualization with non-latency related info. */
-    printf("\033[38;5;0m"); /* Set foreground color to black. */
-    for (j = 0; ; j++) {
-        int coloridx =
-            ceil((double) samples[j].count / tot * (spectrum_palette_size-1));
-        int color = spectrum_palette[coloridx];
-        printf("\033[48;5;%dm%c", (int)color, samples[j].character);
-        samples[j].count = 0;
-        if (samples[j].max == 0) break; /* Last sample. */
-    }
-    printf("\033[0m\n");
-    fflush(stdout);
-}
-
-/* Show the legend: different buckets values and colors meaning, so
- * that the spectrum is more easily readable. */
-void showLatencyDistLegend(void) {
-    int j;
-
-    printf("---------------------------------------------\n");
-    printf(". - * #          .01 .125 .25 .5 milliseconds\n");
-    printf("1,2,3,...,9      from 1 to 9     milliseconds\n");
-    printf("A,B,C,D,E        10,20,30,40,50  milliseconds\n");
-    printf("F,G,H,I,J        .1,.2,.3,.4,.5       seconds\n");
-    printf("K,L,M,N,O,P,Q,?  1,2,4,8,16,30,60,>60 seconds\n");
-    printf("From 0 to 100%%: ");
-    for (j = 0; j < spectrum_palette_size; j++) {
-        printf("\033[48;5;%dm ", spectrum_palette[j]);
-    }
-    printf("\033[0m\n");
-    printf("---------------------------------------------\n");
-}
-
-static void latencyDistMode(void) {
-    redisReply *reply;
-    long long start, latency, count = 0;
-    long long history_interval =
-        config.interval ? config.interval/1000 :
-                          LATENCY_DIST_DEFAULT_INTERVAL;
-    long long history_start = ustime();
-    int j, outputs = 0;
-
-    struct distsamples samples[] = {
-        /* We use a mostly logarithmic scale, with certain linear intervals
-         * which are more interesting than others, like 1-10 milliseconds
-         * range. */
-        {10,0,'.'},         /* 0.01 ms */
-        {125,0,'-'},        /* 0.125 ms */
-        {250,0,'*'},        /* 0.25 ms */
-        {500,0,'#'},        /* 0.5 ms */
-        {1000,0,'1'},       /* 1 ms */
-        {2000,0,'2'},       /* 2 ms */
-        {3000,0,'3'},       /* 3 ms */
-        {4000,0,'4'},       /* 4 ms */
-        {5000,0,'5'},       /* 5 ms */
-        {6000,0,'6'},       /* 6 ms */
-        {7000,0,'7'},       /* 7 ms */
-        {8000,0,'8'},       /* 8 ms */
-        {9000,0,'9'},       /* 9 ms */
-        {10000,0,'A'},      /* 10 ms */
-        {20000,0,'B'},      /* 20 ms */
-        {30000,0,'C'},      /* 30 ms */
-        {40000,0,'D'},      /* 40 ms */
-        {50000,0,'E'},      /* 50 ms */
-        {100000,0,'F'},     /* 0.1 s */
-        {200000,0,'G'},     /* 0.2 s */
-        {300000,0,'H'},     /* 0.3 s */
-        {400000,0,'I'},     /* 0.4 s */
-        {500000,0,'J'},     /* 0.5 s */
-        {1000000,0,'K'},    /* 1 s */
-        {2000000,0,'L'},    /* 2 s */
-        {4000000,0,'M'},    /* 4 s */
-        {8000000,0,'N'},    /* 8 s */
-        {16000000,0,'O'},   /* 16 s */
-        {30000000,0,'P'},   /* 30 s */
-        {60000000,0,'Q'},   /* 1 minute */
-        {0,0,'?'},          /* > 1 minute */
-    };
-
-    if (!context) exit(1);
-    while(1) {
-        start = ustime();
-        reply = reconnectingRedisCommand(context,"PING");
-        if (reply == NULL) {
-            fprintf(stderr,"\nI/O error\n");
-            exit(1);
-        }
-        latency = ustime()-start;
-        freeReplyObject(reply);
-        count++;
-
-        /* Populate the relevant bucket. */
-        for (j = 0; ; j++) {
-            if (samples[j].max == 0 || latency <= samples[j].max) {
-                samples[j].count++;
-                break;
-            }
-        }
-
-        /* From time to time show the spectrum. */
-        if (count && (ustime()-history_start)/1000 > history_interval) {
-            if ((outputs++ % 20) == 0)
-                showLatencyDistLegend();
-            showLatencyDistSamples(samples,count);
-            history_start = ustime();
-            count = 0;
-        }
-        usleep(LATENCY_SAMPLE_RATE * 1000);
-    }
-}
-
-/*------------------------------------------------------------------------------
- * Slave mode
- *--------------------------------------------------------------------------- */
-
-#define RDB_EOF_MARK_SIZE 40
-
-void sendReplconf(const char* arg1, const char* arg2) {
-    fprintf(stderr, "sending REPLCONF %s %s\n", arg1, arg2);
-    redisReply *reply = redisCommand(context, "REPLCONF %s %s", arg1, arg2);
-
-    /* Handle any error conditions */
-    if(reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        exit(1);
-    } else if(reply->type == REDIS_REPLY_ERROR) {
-        fprintf(stderr, "REPLCONF %s error: %s\n", arg1, reply->str);
-        /* non fatal, old versions may not support it */
-    }
-    freeReplyObject(reply);
-}
-
-void sendCapa() {
-    sendReplconf("capa", "eof");
-}
-
-void sendRdbOnly(void) {
-    sendReplconf("rdb-only", "1");
-}
-
-/* Read raw bytes through a redisContext. The read operation is not greedy
- * and may not fill the buffer entirely.
- */
-static ssize_t readConn(redisContext *c, char *buf, size_t len)
-{
-    return c->funcs->read(c, buf, len);
-}
-
-/* Sends SYNC and reads the number of bytes in the payload. Used both by
- * slaveMode() and getRDB().
- * returns 0 in case an EOF marker is used. */
-unsigned long long sendSync(redisContext *c, char *out_eof) {
-    /* To start we need to send the SYNC command and return the payload.
-     * The hiredis client lib does not understand this part of the protocol
-     * and we don't want to mess with its buffers, so everything is performed
-     * using direct low-level I/O. */
-    char buf[4096], *p;
-    ssize_t nread;
-
-    /* Send the SYNC command. */
-    if (cliWriteConn(c, "SYNC\r\n", 6) != 6) {
-        fprintf(stderr,"Error writing to master\n");
-        exit(1);
-    }
-
-    /* Read $<payload>\r\n, making sure to read just up to "\n" */
-    p = buf;
-    while(1) {
-        nread = readConn(c,p,1);
-        if (nread <= 0) {
-            fprintf(stderr,"Error reading bulk length while SYNCing\n");
-            exit(1);
-        }
-        if (*p == '\n' && p != buf) break;
-        if (*p != '\n') p++;
-    }
-    *p = '\0';
-    if (buf[0] == '-') {
-        fprintf(stderr, "SYNC with master failed: %s\n", buf);
-        exit(1);
-    }
-    if (strncmp(buf+1,"EOF:",4) == 0 && strlen(buf+5) >= RDB_EOF_MARK_SIZE) {
-        memcpy(out_eof, buf+5, RDB_EOF_MARK_SIZE);
-        return 0;
-    }
-    return strtoull(buf+1,NULL,10);
-}
-
-static void slaveMode(void) {
-    static char eofmark[RDB_EOF_MARK_SIZE];
-    static char lastbytes[RDB_EOF_MARK_SIZE];
-    static int usemark = 0;
-    unsigned long long payload = sendSync(context,eofmark);
-    char buf[1024];
-    int original_output = config.output;
-
-    if (payload == 0) {
-        payload = ULLONG_MAX;
-        memset(lastbytes,0,RDB_EOF_MARK_SIZE);
-        usemark = 1;
-        fprintf(stderr,"SYNC with master, discarding "
-                       "bytes of bulk transfer until EOF marker...\n");
-    } else {
-        fprintf(stderr,"SYNC with master, discarding %llu "
-                       "bytes of bulk transfer...\n", payload);
-    }
-
-
-    /* Discard the payload. */
-    while(payload) {
-        ssize_t nread;
-
-        nread = readConn(context,buf,(payload > sizeof(buf)) ? sizeof(buf) : payload);
-        if (nread <= 0) {
-            fprintf(stderr,"Error reading RDB payload while SYNCing\n");
-            exit(1);
-        }
-        payload -= nread;
-
-        if (usemark) {
-            /* Update the last bytes array, and check if it matches our delimiter.*/
-            if (nread >= RDB_EOF_MARK_SIZE) {
-                memcpy(lastbytes,buf+nread-RDB_EOF_MARK_SIZE,RDB_EOF_MARK_SIZE);
-            } else {
-                int rem = RDB_EOF_MARK_SIZE-nread;
-                memmove(lastbytes,lastbytes+nread,rem);
-                memcpy(lastbytes+rem,buf,nread);
-            }
-            if (memcmp(lastbytes,eofmark,RDB_EOF_MARK_SIZE) == 0)
-                break;
-        }
-    }
-
-    if (usemark) {
-        unsigned long long offset = ULLONG_MAX - payload;
-        fprintf(stderr,"SYNC done after %llu bytes. Logging commands from master.\n", offset);
-        /* put the slave online */
-        sleep(1);
-        sendReplconf("ACK", "0");
-    } else
-        fprintf(stderr,"SYNC done. Logging commands from master.\n");
-
-    /* Now we can use hiredis to read the incoming protocol. */
-    config.output = OUTPUT_CSV;
-    while (cliReadReply(0) == REDIS_OK);
-    config.output = original_output;
-}
-
-/*------------------------------------------------------------------------------
- * RDB transfer mode
- *--------------------------------------------------------------------------- */
-
-/* This function implements --rdb, so it uses the replication protocol in order
- * to fetch the RDB file from a remote server. */
-static void getRDB(clusterManagerNode *node) {
-    int fd;
-    redisContext *s;
-    char *filename;
-    if (node != NULL) {
-        assert(node->context);
-        s = node->context;
-        filename = clusterManagerGetNodeRDBFilename(node);
-    } else {
-        s = context;
-        filename = config.rdb_filename;
-    }
-    static char eofmark[RDB_EOF_MARK_SIZE];
-    static char lastbytes[RDB_EOF_MARK_SIZE];
-    static int usemark = 0;
-    unsigned long long payload = sendSync(s, eofmark);
-    char buf[4096];
-
-    if (payload == 0) {
-        payload = ULLONG_MAX;
-        memset(lastbytes,0,RDB_EOF_MARK_SIZE);
-        usemark = 1;
-        fprintf(stderr,"SYNC sent to master, writing bytes of bulk transfer "
-                "until EOF marker to '%s'\n", filename);
-    } else {
-        fprintf(stderr,"SYNC sent to master, writing %llu bytes to '%s'\n",
-            payload, filename);
-    }
-
-    int write_to_stdout = !strcmp(filename,"-");
-    /* Write to file. */
-    if (write_to_stdout) {
-        fd = STDOUT_FILENO;
-    } else {
-        fd = open(filename, O_CREAT|O_WRONLY, 0644);
-        if (fd == -1) {
-            fprintf(stderr, "Error opening '%s': %s\n", filename,
-                strerror(errno));
-            exit(1);
-        }
-    }
-
-    while(payload) {
-        ssize_t nread, nwritten;
-
-        nread = readConn(s,buf,(payload > sizeof(buf)) ? sizeof(buf) : payload);
-        if (nread <= 0) {
-            fprintf(stderr,"I/O Error reading RDB payload from socket\n");
-            exit(1);
-        }
-        nwritten = write(fd, buf, nread);
-        if (nwritten != nread) {
-            fprintf(stderr,"Error writing data to file: %s\n",
-                (nwritten == -1) ? strerror(errno) : "short write");
-            exit(1);
-        }
-        payload -= nread;
-
-        if (usemark) {
-            /* Update the last bytes array, and check if it matches our delimiter.*/
-            if (nread >= RDB_EOF_MARK_SIZE) {
-                memcpy(lastbytes,buf+nread-RDB_EOF_MARK_SIZE,RDB_EOF_MARK_SIZE);
-            } else {
-                int rem = RDB_EOF_MARK_SIZE-nread;
-                memmove(lastbytes,lastbytes+nread,rem);
-                memcpy(lastbytes+rem,buf,nread);
-            }
-            if (memcmp(lastbytes,eofmark,RDB_EOF_MARK_SIZE) == 0)
-                break;
-        }
-    }
-    if (usemark) {
-        payload = ULLONG_MAX - payload - RDB_EOF_MARK_SIZE;
-        if (!write_to_stdout && ftruncate(fd, payload) == -1)
-            fprintf(stderr,"ftruncate failed: %s.\n", strerror(errno));
-        fprintf(stderr,"Transfer finished with success after %llu bytes\n", payload);
-    } else {
-        fprintf(stderr,"Transfer finished with success.\n");
-    }
-    redisFree(s); /* Close the connection ASAP as fsync() may take time. */
-    if (node)
-        node->context = NULL;
-    if (!write_to_stdout && fsync(fd) == -1) {
-        fprintf(stderr,"Fail to fsync '%s': %s\n", filename, strerror(errno));
-        exit(1);
-    }
-    close(fd);
-    if (node) {
-        sdsfree(filename);
-        return;
-    }
-    exit(0);
-}
-
-/*------------------------------------------------------------------------------
- * Bulk import (pipe) mode
- *--------------------------------------------------------------------------- */
-
-#define PIPEMODE_WRITE_LOOP_MAX_BYTES (128*1024)
-static void pipeMode(void) {
-    long long errors = 0, replies = 0, obuf_len = 0, obuf_pos = 0;
-    char obuf[1024*16]; /* Output buffer */
-    char aneterr[ANET_ERR_LEN];
-    redisReply *reply;
-    int eof = 0; /* True once we consumed all the standard input. */
-    int done = 0;
-    char magic[20]; /* Special reply we recognize. */
-    time_t last_read_time = time(NULL);
-
-    srand(time(NULL));
-
-    /* Use non blocking I/O. */
-    if (anetNonBlock(aneterr,context->fd) == ANET_ERR) {
-        fprintf(stderr, "Can't set the socket in non blocking mode: %s\n",
-            aneterr);
-        exit(1);
-    }
-
-    context->flags &= ~REDIS_BLOCK;
-
-    /* Transfer raw protocol and read replies from the server at the same
-     * time. */
-    while(!done) {
-        int mask = AE_READABLE;
-
-        if (!eof || obuf_len != 0) mask |= AE_WRITABLE;
-        mask = aeWait(context->fd,mask,1000);
-
-        /* Handle the readable state: we can read replies from the server. */
-        if (mask & AE_READABLE) {
-            int read_error = 0;
-
-            do {
-                if (!read_error && redisBufferRead(context) == REDIS_ERR) {
-                    read_error = 1;
-                }
-
-                reply = NULL;
-                if (redisGetReply(context, (void **) &reply) == REDIS_ERR) {
-                    fprintf(stderr, "Error reading replies from server\n");
-                    exit(1);
-                }
-                if (reply) {
-                    last_read_time = time(NULL);
-                    if (reply->type == REDIS_REPLY_ERROR) {
-                        fprintf(stderr,"%s\n", reply->str);
-                        errors++;
-                    } else if (eof && reply->type == REDIS_REPLY_STRING &&
-                                      reply->len == 20) {
-                        /* Check if this is the reply to our final ECHO
-                         * command. If so everything was received
-                         * from the server. */
-                        if (memcmp(reply->str,magic,20) == 0) {
-                            printf("Last reply received from server.\n");
-                            done = 1;
-                            replies--;
-                        }
-                    }
-                    replies++;
-                    freeReplyObject(reply);
-                }
-            } while(reply);
-
-            /* Abort on read errors. We abort here because it is important
-             * to consume replies even after a read error: this way we can
-             * show a potential problem to the user. */
-            if (read_error) exit(1);
-        }
-
-        /* Handle the writable state: we can send protocol to the server. */
-        if (mask & AE_WRITABLE) {
-            ssize_t loop_nwritten = 0;
-
-            while(1) {
-                /* Transfer current buffer to server. */
-                if (obuf_len != 0) {
-                    ssize_t nwritten = cliWriteConn(context,obuf+obuf_pos,obuf_len);
-
-                    if (nwritten == -1) {
-                        if (errno != EAGAIN && errno != EINTR) {
-                            fprintf(stderr, "Error writing to the server: %s\n",
-                                strerror(errno));
-                            exit(1);
-                        } else {
-                            nwritten = 0;
-                        }
-                    }
-                    obuf_len -= nwritten;
-                    obuf_pos += nwritten;
-                    loop_nwritten += nwritten;
-                    if (obuf_len != 0) break; /* Can't accept more data. */
-                }
-                if (context->err) {
-                    fprintf(stderr, "Server I/O Error: %s\n", context->errstr);
-                    exit(1);
-                }
-                /* If buffer is empty, load from stdin. */
-                if (obuf_len == 0 && !eof) {
-                    ssize_t nread = read(STDIN_FILENO,obuf,sizeof(obuf));
-
-                    if (nread == 0) {
-                        /* The ECHO sequence starts with a "\r\n" so that if there
-                         * is garbage in the protocol we read from stdin, the ECHO
-                         * will likely still be properly formatted.
-                         * CRLF is ignored by Redis, so it has no effects. */
-                        char echo[] =
-                        "\r\n*2\r\n$4\r\nECHO\r\n$20\r\n01234567890123456789\r\n";
-                        int j;
-
-                        eof = 1;
-                        /* Everything transferred, so we queue a special
-                         * ECHO command that we can match in the replies
-                         * to make sure everything was read from the server. */
-                        for (j = 0; j < 20; j++)
-                            magic[j] = rand() & 0xff;
-                        memcpy(echo+21,magic,20);
-                        memcpy(obuf,echo,sizeof(echo)-1);
-                        obuf_len = sizeof(echo)-1;
-                        obuf_pos = 0;
-                        printf("All data transferred. Waiting for the last reply...\n");
-                    } else if (nread == -1) {
-                        fprintf(stderr, "Error reading from stdin: %s\n",
-                            strerror(errno));
-                        exit(1);
-                    } else {
-                        obuf_len = nread;
-                        obuf_pos = 0;
-                    }
-                }
-                if ((obuf_len == 0 && eof) ||
-                    loop_nwritten > PIPEMODE_WRITE_LOOP_MAX_BYTES) break;
-            }
-        }
-
-        /* Handle timeout, that is, we reached EOF, and we are not getting
-         * replies from the server for a few seconds, nor the final ECHO is
-         * received. */
-        if (eof && config.pipe_timeout > 0 &&
-            time(NULL)-last_read_time > config.pipe_timeout)
-        {
-            fprintf(stderr,"No replies for %d seconds: exiting.\n",
-                config.pipe_timeout);
-            errors++;
-            break;
-        }
-    }
-    printf("errors: %lld, replies: %lld\n", errors, replies);
-    if (errors)
-        exit(1);
-    else
-        exit(0);
-}
-
-/*------------------------------------------------------------------------------
- * Find big keys
- *--------------------------------------------------------------------------- */
-
-static redisReply *sendScan(unsigned long long *it) {
-    redisReply *reply;
-
-    if (config.pattern)
-        reply = redisCommand(context, "SCAN %llu MATCH %b",
-            *it, config.pattern, sdslen(config.pattern));
-    else
-        reply = redisCommand(context,"SCAN %llu",*it);
-
-    /* Handle any error conditions */
-    if(reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        exit(1);
-    } else if(reply->type == REDIS_REPLY_ERROR) {
-        fprintf(stderr, "SCAN error: %s\n", reply->str);
-        exit(1);
-    } else if(reply->type != REDIS_REPLY_ARRAY) {
-        fprintf(stderr, "Non ARRAY response from SCAN!\n");
-        exit(1);
-    } else if(reply->elements != 2) {
-        fprintf(stderr, "Invalid element count from SCAN!\n");
-        exit(1);
-    }
-
-    /* Validate our types are correct */
-    assert(reply->element[0]->type == REDIS_REPLY_STRING);
-    assert(reply->element[1]->type == REDIS_REPLY_ARRAY);
-
-    /* Update iterator */
-    *it = strtoull(reply->element[0]->str, NULL, 10);
-
-    return reply;
-}
-
-static int getDbSize(void) {
-    redisReply *reply;
-    int size;
-
-    reply = redisCommand(context, "DBSIZE");
-
-    if (reply == NULL) {
-        fprintf(stderr, "\nI/O error\n");
-        exit(1);
-    } else if (reply->type == REDIS_REPLY_ERROR) {
-        fprintf(stderr, "Couldn't determine DBSIZE: %s\n", reply->str);
-        exit(1);
-    } else if (reply->type != REDIS_REPLY_INTEGER) {
-        fprintf(stderr, "Non INTEGER response from DBSIZE!\n");
-        exit(1);
-    }
-
-    /* Grab the number of keys and free our reply */
-    size = reply->integer;
-    freeReplyObject(reply);
-
-    return size;
-}
-
-typedef struct {
-    char *name;
-    char *sizecmd;
-    char *sizeunit;
-    unsigned long long biggest;
-    unsigned long long count;
-    unsigned long long totalsize;
-    sds biggest_key;
-} typeinfo;
-
-typeinfo type_string = { "string", "STRLEN", "bytes" };
-typeinfo type_list = { "list", "LLEN", "items" };
-typeinfo type_set = { "set", "SCARD", "members" };
-typeinfo type_hash = { "hash", "HLEN", "fields" };
-typeinfo type_zset = { "zset", "ZCARD", "members" };
-typeinfo type_stream = { "stream", "XLEN", "entries" };
-typeinfo type_other = { "other", NULL, "?" };
-
-static typeinfo* typeinfo_add(dict *types, char* name, typeinfo* type_template) {
-    typeinfo *info = zmalloc(sizeof(typeinfo));
-    *info = *type_template;
-    info->name = sdsnew(name);
-    dictAdd(types, info->name, info);
-    return info;
-}
-
-void type_free(void* priv_data, void* val) {
-    typeinfo *info = val;
-    UNUSED(priv_data);
-    if (info->biggest_key)
-        sdsfree(info->biggest_key);
-    sdsfree(info->name);
-    zfree(info);
-}
-
-static dictType typeinfoDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* key destructor (owned by the value)*/
-    type_free,                 /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-static void getKeyTypes(dict *types_dict, redisReply *keys, typeinfo **types) {
-    redisReply *reply;
-    unsigned int i;
-
-    /* Pipeline TYPE commands */
-    for(i=0;i<keys->elements;i++) {
-        const char* argv[] = {"TYPE", keys->element[i]->str};
-        size_t lens[] = {4, keys->element[i]->len};
-        redisAppendCommandArgv(context, 2, argv, lens);
-    }
-
-    /* Retrieve types */
-    for(i=0;i<keys->elements;i++) {
-        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
-            fprintf(stderr, "Error getting type for key '%s' (%d: %s)\n",
-                keys->element[i]->str, context->err, context->errstr);
-            exit(1);
-        } else if(reply->type != REDIS_REPLY_STATUS) {
-            if(reply->type == REDIS_REPLY_ERROR) {
-                fprintf(stderr, "TYPE returned an error: %s\n", reply->str);
-            } else {
-                fprintf(stderr,
-                    "Invalid reply type (%d) for TYPE on key '%s'!\n",
-                    reply->type, keys->element[i]->str);
-            }
-            exit(1);
-        }
-
-        sds typereply = sdsnew(reply->str);
-        dictEntry *de = dictFind(types_dict, typereply);
-        sdsfree(typereply);
-        typeinfo *type = NULL;
-        if (de)
-            type = dictGetVal(de);
-        else if (strcmp(reply->str, "none")) /* create new types for modules, (but not for deleted keys) */
-            type = typeinfo_add(types_dict, reply->str, &type_other);
-        types[i] = type;
-        freeReplyObject(reply);
-    }
-}
-
-static void getKeySizes(redisReply *keys, typeinfo **types,
-                        unsigned long long *sizes, int memkeys,
-                        unsigned memkeys_samples)
-{
-    redisReply *reply;
-    unsigned int i;
-
-    /* Pipeline size commands */
-    for(i=0;i<keys->elements;i++) {
-        /* Skip keys that disappeared between SCAN and TYPE (or unknown types when not in memkeys mode) */
-        if(!types[i] || (!types[i]->sizecmd && !memkeys))
-            continue;
-
-        if (!memkeys) {
-            const char* argv[] = {types[i]->sizecmd, keys->element[i]->str};
-            size_t lens[] = {strlen(types[i]->sizecmd), keys->element[i]->len};
-            redisAppendCommandArgv(context, 2, argv, lens);
-        } else if (memkeys_samples==0) {
-            const char* argv[] = {"MEMORY", "USAGE", keys->element[i]->str};
-            size_t lens[] = {6, 5, keys->element[i]->len};
-            redisAppendCommandArgv(context, 3, argv, lens);
-        } else {
-            sds samplesstr = sdsfromlonglong(memkeys_samples);
-            const char* argv[] = {"MEMORY", "USAGE", keys->element[i]->str, "SAMPLES", samplesstr};
-            size_t lens[] = {6, 5, keys->element[i]->len, 7, sdslen(samplesstr)};
-            redisAppendCommandArgv(context, 5, argv, lens);
-            sdsfree(samplesstr);
-        }
-    }
-
-    /* Retrieve sizes */
-    for(i=0;i<keys->elements;i++) {
-        /* Skip keys that disappeared between SCAN and TYPE (or unknown types when not in memkeys mode) */
-        if(!types[i] || (!types[i]->sizecmd && !memkeys)) {
-            sizes[i] = 0;
-            continue;
-        }
-
-        /* Retrieve size */
-        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
-            fprintf(stderr, "Error getting size for key '%s' (%d: %s)\n",
-                keys->element[i]->str, context->err, context->errstr);
-            exit(1);
-        } else if(reply->type != REDIS_REPLY_INTEGER) {
-            /* Theoretically the key could have been removed and
-             * added as a different type between TYPE and SIZE */
-            fprintf(stderr,
-                "Warning:  %s on '%s' failed (may have changed type)\n",
-                !memkeys? types[i]->sizecmd: "MEMORY USAGE",
-                keys->element[i]->str);
-            sizes[i] = 0;
-        } else {
-            sizes[i] = reply->integer;
-        }
-
-        freeReplyObject(reply);
-    }
-}
-
-static void findBigKeys(int memkeys, unsigned memkeys_samples) {
-    unsigned long long sampled = 0, total_keys, totlen=0, *sizes=NULL, it=0;
-    redisReply *reply, *keys;
-    unsigned int arrsize=0, i;
-    dictIterator *di;
-    dictEntry *de;
-    typeinfo **types = NULL;
-    double pct;
-
-    dict *types_dict = dictCreate(&typeinfoDictType, NULL);
-    typeinfo_add(types_dict, "string", &type_string);
-    typeinfo_add(types_dict, "list", &type_list);
-    typeinfo_add(types_dict, "set", &type_set);
-    typeinfo_add(types_dict, "hash", &type_hash);
-    typeinfo_add(types_dict, "zset", &type_zset);
-    typeinfo_add(types_dict, "stream", &type_stream);
-
-    /* Total keys pre scanning */
-    total_keys = getDbSize();
-
-    /* Status message */
-    printf("\n# Scanning the entire keyspace to find biggest keys as well as\n");
-    printf("# average sizes per key type.  You can use -i 0.1 to sleep 0.1 sec\n");
-    printf("# per 100 SCAN commands (not usually needed).\n\n");
-
-    /* SCAN loop */
-    do {
-        /* Calculate approximate percentage completion */
-        pct = 100 * (double)sampled/total_keys;
-
-        /* Grab some keys and point to the keys array */
-        reply = sendScan(&it);
-        keys  = reply->element[1];
-
-        /* Reallocate our type and size array if we need to */
-        if(keys->elements > arrsize) {
-            types = zrealloc(types, sizeof(typeinfo*)*keys->elements);
-            sizes = zrealloc(sizes, sizeof(unsigned long long)*keys->elements);
-
-            if(!types || !sizes) {
-                fprintf(stderr, "Failed to allocate storage for keys!\n");
-                exit(1);
-            }
-
-            arrsize = keys->elements;
-        }
-
-        /* Retrieve types and then sizes */
-        getKeyTypes(types_dict, keys, types);
-        getKeySizes(keys, types, sizes, memkeys, memkeys_samples);
-
-        /* Now update our stats */
-        for(i=0;i<keys->elements;i++) {
-            typeinfo *type = types[i];
-            /* Skip keys that disappeared between SCAN and TYPE */
-            if(!type)
-                continue;
-
-            type->totalsize += sizes[i];
-            type->count++;
-            totlen += keys->element[i]->len;
-            sampled++;
-
-            if(type->biggest<sizes[i]) {
-                /* Keep track of biggest key name for this type */
-                if (type->biggest_key)
-                    sdsfree(type->biggest_key);
-                type->biggest_key = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
-                if(!type->biggest_key) {
-                    fprintf(stderr, "Failed to allocate memory for key!\n");
-                    exit(1);
-                }
-
-                printf(
-                   "[%05.2f%%] Biggest %-6s found so far '%s' with %llu %s\n",
-                   pct, type->name, type->biggest_key, sizes[i],
-                   !memkeys? type->sizeunit: "bytes");
-
-                /* Keep track of the biggest size for this type */
-                type->biggest = sizes[i];
-            }
-
-            /* Update overall progress */
-            if(sampled % 1000000 == 0) {
-                printf("[%05.2f%%] Sampled %llu keys so far\n", pct, sampled);
-            }
-        }
-
-        /* Sleep if we've been directed to do so */
-        if(sampled && (sampled %100) == 0 && config.interval) {
-            usleep(config.interval);
-        }
-
-        freeReplyObject(reply);
-    } while(it != 0);
-
-    if(types) zfree(types);
-    if(sizes) zfree(sizes);
-
-    /* We're done */
-    printf("\n-------- summary -------\n\n");
-
-    printf("Sampled %llu keys in the keyspace!\n", sampled);
-    printf("Total key length in bytes is %llu (avg len %.2f)\n\n",
-       totlen, totlen ? (double)totlen/sampled : 0);
-
-    /* Output the biggest keys we found, for types we did find */
-    di = dictGetIterator(types_dict);
-    while ((de = dictNext(di))) {
-        typeinfo *type = dictGetVal(de);
-        if(type->biggest_key) {
-            printf("Biggest %6s found '%s' has %llu %s\n", type->name, type->biggest_key,
-               type->biggest, !memkeys? type->sizeunit: "bytes");
-        }
-    }
-    dictReleaseIterator(di);
-
-    printf("\n");
-
-    di = dictGetIterator(types_dict);
-    while ((de = dictNext(di))) {
-        typeinfo *type = dictGetVal(de);
-        printf("%llu %ss with %llu %s (%05.2f%% of keys, avg size %.2f)\n",
-           type->count, type->name, type->totalsize, !memkeys? type->sizeunit: "bytes",
-           sampled ? 100 * (double)type->count/sampled : 0,
-           type->count ? (double)type->totalsize/type->count : 0);
-    }
-    dictReleaseIterator(di);
-
-    dictRelease(types_dict);
-
-    /* Success! */
-    exit(0);
-}
-
-static void getKeyFreqs(redisReply *keys, unsigned long long *freqs) {
-    redisReply *reply;
-    unsigned int i;
-
-    /* Pipeline OBJECT freq commands */
-    for(i=0;i<keys->elements;i++) {
-        const char* argv[] = {"OBJECT", "FREQ", keys->element[i]->str};
-        size_t lens[] = {6, 4, keys->element[i]->len};
-        redisAppendCommandArgv(context, 3, argv, lens);
-    }
-
-    /* Retrieve freqs */
-    for(i=0;i<keys->elements;i++) {
-        if(redisGetReply(context, (void**)&reply)!=REDIS_OK) {
-            sds keyname = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
-            fprintf(stderr, "Error getting freq for key '%s' (%d: %s)\n",
-                keyname, context->err, context->errstr);
-            sdsfree(keyname);
-            exit(1);
-        } else if(reply->type != REDIS_REPLY_INTEGER) {
-            if(reply->type == REDIS_REPLY_ERROR) {
-                fprintf(stderr, "Error: %s\n", reply->str);
-                exit(1);
-            } else {
-                sds keyname = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
-                fprintf(stderr, "Warning: OBJECT freq on '%s' failed (may have been deleted)\n", keyname);
-                sdsfree(keyname);
-                freqs[i] = 0;
-            }
-        } else {
-            freqs[i] = reply->integer;
-        }
-        freeReplyObject(reply);
-    }
-}
-
-#define HOTKEYS_SAMPLE 16
-static void findHotKeys(void) {
-    redisReply *keys, *reply;
-    unsigned long long counters[HOTKEYS_SAMPLE] = {0};
-    sds hotkeys[HOTKEYS_SAMPLE] = {NULL};
-    unsigned long long sampled = 0, total_keys, *freqs = NULL, it = 0;
-    unsigned int arrsize = 0, i, k;
-    double pct;
-
-    /* Total keys pre scanning */
-    total_keys = getDbSize();
-
-    /* Status message */
-    printf("\n# Scanning the entire keyspace to find hot keys as well as\n");
-    printf("# average sizes per key type.  You can use -i 0.1 to sleep 0.1 sec\n");
-    printf("# per 100 SCAN commands (not usually needed).\n\n");
-
-    /* SCAN loop */
-    do {
-        /* Calculate approximate percentage completion */
-        pct = 100 * (double)sampled/total_keys;
-
-        /* Grab some keys and point to the keys array */
-        reply = sendScan(&it);
-        keys  = reply->element[1];
-
-        /* Reallocate our freqs array if we need to */
-        if(keys->elements > arrsize) {
-            freqs = zrealloc(freqs, sizeof(unsigned long long)*keys->elements);
-
-            if(!freqs) {
-                fprintf(stderr, "Failed to allocate storage for keys!\n");
-                exit(1);
-            }
-
-            arrsize = keys->elements;
-        }
-
-        getKeyFreqs(keys, freqs);
-
-        /* Now update our stats */
-        for(i=0;i<keys->elements;i++) {
-            sampled++;
-            /* Update overall progress */
-            if(sampled % 1000000 == 0) {
-                printf("[%05.2f%%] Sampled %llu keys so far\n", pct, sampled);
-            }
-
-            /* Use eviction pool here */
-            k = 0;
-            while (k < HOTKEYS_SAMPLE && freqs[i] > counters[k]) k++;
-            if (k == 0) continue;
-            k--;
-            if (k == 0 || counters[k] == 0) {
-                sdsfree(hotkeys[k]);
-            } else {
-                sdsfree(hotkeys[0]);
-                memmove(counters,counters+1,sizeof(counters[0])*k);
-                memmove(hotkeys,hotkeys+1,sizeof(hotkeys[0])*k);
-            }
-            counters[k] = freqs[i];
-            hotkeys[k] = sdscatrepr(sdsempty(), keys->element[i]->str, keys->element[i]->len);
-            printf(
-               "[%05.2f%%] Hot key '%s' found so far with counter %llu\n",
-               pct, hotkeys[k], freqs[i]);
-        }
-
-        /* Sleep if we've been directed to do so */
-        if(sampled && (sampled %100) == 0 && config.interval) {
-            usleep(config.interval);
-        }
-
-        freeReplyObject(reply);
-    } while(it != 0);
-
-    if (freqs) zfree(freqs);
-
-    /* We're done */
-    printf("\n-------- summary -------\n\n");
-
-    printf("Sampled %llu keys in the keyspace!\n", sampled);
-
-    for (i=1; i<= HOTKEYS_SAMPLE; i++) {
-        k = HOTKEYS_SAMPLE - i;
-        if(counters[k]>0) {
-            printf("hot key found with counter: %llu\tkeyname: %s\n", counters[k], hotkeys[k]);
-            sdsfree(hotkeys[k]);
-        }
-    }
-
-    exit(0);
-}
-
-/*------------------------------------------------------------------------------
- * Stats mode
- *--------------------------------------------------------------------------- */
-
-/* Return the specified INFO field from the INFO command output "info".
- * A new buffer is allocated for the result, that needs to be free'd.
- * If the field is not found NULL is returned. */
-static char *getInfoField(char *info, char *field) {
-    char *p = strstr(info,field);
-    char *n1, *n2;
-    char *result;
-
-    if (!p) return NULL;
-    p += strlen(field)+1;
-    n1 = strchr(p,'\r');
-    n2 = strchr(p,',');
-    if (n2 && n2 < n1) n1 = n2;
-    result = zmalloc(sizeof(char)*(n1-p)+1);
-    memcpy(result,p,(n1-p));
-    result[n1-p] = '\0';
-    return result;
-}
-
-/* Like the above function but automatically convert the result into
- * a long. On error (missing field) LONG_MIN is returned. */
-static long getLongInfoField(char *info, char *field) {
-    char *value = getInfoField(info,field);
-    long l;
-
-    if (!value) return LONG_MIN;
-    l = strtol(value,NULL,10);
-    zfree(value);
-    return l;
-}
-
-/* Convert number of bytes into a human readable string of the form:
- * 100B, 2G, 100M, 4K, and so forth. */
-void bytesToHuman(char *s, long long n) {
-    double d;
-
-    if (n < 0) {
-        *s = '-';
-        s++;
-        n = -n;
-    }
-    if (n < 1024) {
-        /* Bytes */
-        sprintf(s,"%lldB",n);
-        return;
-    } else if (n < (1024*1024)) {
-        d = (double)n/(1024);
-        sprintf(s,"%.2fK",d);
-    } else if (n < (1024LL*1024*1024)) {
-        d = (double)n/(1024*1024);
-        sprintf(s,"%.2fM",d);
-    } else if (n < (1024LL*1024*1024*1024)) {
-        d = (double)n/(1024LL*1024*1024);
-        sprintf(s,"%.2fG",d);
-    }
-}
-
-static void statMode(void) {
-    redisReply *reply;
-    long aux, requests = 0;
-    int i = 0;
-
-    while(1) {
-        char buf[64];
-        int j;
-
-        reply = reconnectingRedisCommand(context,"INFO");
-        if (reply->type == REDIS_REPLY_ERROR) {
-            printf("ERROR: %s\n", reply->str);
-            exit(1);
-        }
-
-        if ((i++ % 20) == 0) {
-            printf(
-"------- data ------ --------------------- load -------------------- - child -\n"
-"keys       mem      clients blocked requests            connections          \n");
-        }
-
-        /* Keys */
-        aux = 0;
-        for (j = 0; j < 20; j++) {
-            long k;
-
-            sprintf(buf,"db%d:keys",j);
-            k = getLongInfoField(reply->str,buf);
-            if (k == LONG_MIN) continue;
-            aux += k;
-        }
-        sprintf(buf,"%ld",aux);
-        printf("%-11s",buf);
-
-        /* Used memory */
-        aux = getLongInfoField(reply->str,"used_memory");
-        bytesToHuman(buf,aux);
-        printf("%-8s",buf);
-
-        /* Clients */
-        aux = getLongInfoField(reply->str,"connected_clients");
-        sprintf(buf,"%ld",aux);
-        printf(" %-8s",buf);
-
-        /* Blocked (BLPOPPING) Clients */
-        aux = getLongInfoField(reply->str,"blocked_clients");
-        sprintf(buf,"%ld",aux);
-        printf("%-8s",buf);
-
-        /* Requests */
-        aux = getLongInfoField(reply->str,"total_commands_processed");
-        sprintf(buf,"%ld (+%ld)",aux,requests == 0 ? 0 : aux-requests);
-        printf("%-19s",buf);
-        requests = aux;
-
-        /* Connections */
-        aux = getLongInfoField(reply->str,"total_connections_received");
-        sprintf(buf,"%ld",aux);
-        printf(" %-12s",buf);
-
-        /* Children */
-        aux = getLongInfoField(reply->str,"bgsave_in_progress");
-        aux |= getLongInfoField(reply->str,"aof_rewrite_in_progress") << 1;
-        aux |= getLongInfoField(reply->str,"loading") << 2;
-        switch(aux) {
-        case 0: break;
-        case 1:
-            printf("SAVE");
-            break;
-        case 2:
-            printf("AOF");
-            break;
-        case 3:
-            printf("SAVE+AOF");
-            break;
-        case 4:
-            printf("LOAD");
-            break;
-        }
-
-        printf("\n");
-        freeReplyObject(reply);
-        usleep(config.interval);
-    }
-}
-
-/*------------------------------------------------------------------------------
- * Scan mode
- *--------------------------------------------------------------------------- */
-
-static void scanMode(void) {
-    redisReply *reply;
-    unsigned long long cur = 0;
-
-    do {
-        reply = sendScan(&cur);
-        for (unsigned int j = 0; j < reply->element[1]->elements; j++) {
-            if (config.output == OUTPUT_STANDARD) {
-                sds out = sdscatrepr(sdsempty(), reply->element[1]->element[j]->str,
-                                     reply->element[1]->element[j]->len);
-                printf("%s\n", out);
-                sdsfree(out);
-            } else {
-                printf("%s\n", reply->element[1]->element[j]->str);
-            }
-        }
-        freeReplyObject(reply);
-    } while(cur != 0);
-
-    exit(0);
-}
-
-/*------------------------------------------------------------------------------
- * LRU test mode
- *--------------------------------------------------------------------------- */
-
-/* Return an integer from min to max (both inclusive) using a power-law
- * distribution, depending on the value of alpha: the greater the alpha
- * the more bias towards lower values.
- *
- * With alpha = 6.2 the output follows the 80-20 rule where 20% of
- * the returned numbers will account for 80% of the frequency. */
-long long powerLawRand(long long min, long long max, double alpha) {
-    double pl, r;
-
-    max += 1;
-    r = ((double)rand()) / RAND_MAX;
-    pl = pow(
-        ((pow(max,alpha+1) - pow(min,alpha+1))*r + pow(min,alpha+1)),
-        (1.0/(alpha+1)));
-    return (max-1-(long long)pl)+min;
-}
-
-/* Generates a key name among a set of lru_test_sample_size keys, using
- * an 80-20 distribution. */
-void LRUTestGenKey(char *buf, size_t buflen) {
-    snprintf(buf, buflen, "lru:%lld",
-        powerLawRand(1, config.lru_test_sample_size, 6.2));
-}
-
-#define LRU_CYCLE_PERIOD 1000 /* 1000 milliseconds. */
-#define LRU_CYCLE_PIPELINE_SIZE 250
-static void LRUTestMode(void) {
-    redisReply *reply;
-    char key[128];
-    long long start_cycle;
-    int j;
-
-    srand(time(NULL)^getpid());
-    while(1) {
-        /* Perform cycles of 1 second with 50% writes and 50% reads.
-         * We use pipelining batching writes / reads N times per cycle in order
-         * to fill the target instance easily. */
-        start_cycle = mstime();
-        long long hits = 0, misses = 0;
-        while(mstime() - start_cycle < LRU_CYCLE_PERIOD) {
-            /* Write cycle. */
-            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
-                char val[6];
-                val[5] = '\0';
-                for (int i = 0; i < 5; i++) val[i] = 'A'+rand()%('z'-'A');
-                LRUTestGenKey(key,sizeof(key));
-                redisAppendCommand(context, "SET %s %s",key,val);
-            }
-            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++)
-                redisGetReply(context, (void**)&reply);
-
-            /* Read cycle. */
-            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
-                LRUTestGenKey(key,sizeof(key));
-                redisAppendCommand(context, "GET %s",key);
-            }
-            for (j = 0; j < LRU_CYCLE_PIPELINE_SIZE; j++) {
-                if (redisGetReply(context, (void**)&reply) == REDIS_OK) {
-                    switch(reply->type) {
-                        case REDIS_REPLY_ERROR:
-                            printf("%s\n", reply->str);
-                            break;
-                        case REDIS_REPLY_NIL:
-                            misses++;
-                            break;
-                        default:
-                            hits++;
-                            break;
-                    }
-                }
-            }
-
-            if (context->err) {
-                fprintf(stderr,"I/O error during LRU test\n");
-                exit(1);
-            }
-        }
-        /* Print stats. */
-        printf(
-            "%lld Gets/sec | Hits: %lld (%.2f%%) | Misses: %lld (%.2f%%)\n",
-            hits+misses,
-            hits, (double)hits/(hits+misses)*100,
-            misses, (double)misses/(hits+misses)*100);
-    }
-    exit(0);
-}
-
-/*------------------------------------------------------------------------------
- * Intrisic latency mode.
- *
- * Measure max latency of a running process that does not result from
- * syscalls. Basically this software should provide a hint about how much
- * time the kernel leaves the process without a chance to run.
- *--------------------------------------------------------------------------- */
-
-/* This is just some computation the compiler can't optimize out.
- * Should run in less than 100-200 microseconds even using very
- * slow hardware. Runs in less than 10 microseconds in modern HW. */
-unsigned long compute_something_fast(void) {
-    unsigned char s[256], i, j, t;
-    int count = 1000, k;
-    unsigned long output = 0;
-
-    for (k = 0; k < 256; k++) s[k] = k;
-
-    i = 0;
-    j = 0;
-    while(count--) {
-        i++;
-        j = j + s[i];
-        t = s[i];
-        s[i] = s[j];
-        s[j] = t;
-        output += s[(s[i]+s[j])&255];
-    }
-    return output;
-}
-
-static void intrinsicLatencyModeStop(int s) {
-    UNUSED(s);
-    force_cancel_loop = 1;
-}
-
-static void intrinsicLatencyMode(void) {
-    long long test_end, run_time, max_latency = 0, runs = 0;
-
-    run_time = config.intrinsic_latency_duration*1000000;
-    test_end = ustime() + run_time;
-    signal(SIGINT, intrinsicLatencyModeStop);
-
-    while(1) {
-        long long start, end, latency;
-
-        start = ustime();
-        compute_something_fast();
-        end = ustime();
-        latency = end-start;
-        runs++;
-        if (latency <= 0) continue;
-
-        /* Reporting */
-        if (latency > max_latency) {
-            max_latency = latency;
-            printf("Max latency so far: %lld microseconds.\n", max_latency);
-        }
-
-        double avg_us = (double)run_time/runs;
-        double avg_ns = avg_us * 1e3;
-        if (force_cancel_loop || end > test_end) {
-            printf("\n%lld total runs "
-                "(avg latency: "
-                "%.4f microseconds / %.2f nanoseconds per run).\n",
-                runs, avg_us, avg_ns);
-            printf("Worst run took %.0fx longer than the average latency.\n",
-                max_latency / avg_us);
-            exit(0);
-        }
-    }
-}
-
-static sds askPassword(const char *msg) {
-    linenoiseMaskModeEnable();
-    sds auth = linenoise(msg);
-    linenoiseMaskModeDisable();
-    return auth;
-}
-
-/*------------------------------------------------------------------------------
- * Program main()
- *--------------------------------------------------------------------------- */
-
-int main(int argc, char **argv) {
-    int firstarg;
-    struct timeval tv;
-
-    memset(&config.sslconfig, 0, sizeof(config.sslconfig));
-    config.hostip = sdsnew("127.0.0.1");
-    config.hostport = 6379;
-    config.hostsocket = NULL;
-    config.repeat = 1;
-    config.interval = 0;
-    config.dbnum = 0;
-    config.input_dbnum = 0;
-    config.interactive = 0;
-    config.shutdown = 0;
-    config.monitor_mode = 0;
-    config.pubsub_mode = 0;
-    config.latency_mode = 0;
-    config.latency_dist_mode = 0;
-    config.latency_history = 0;
-    config.lru_test_mode = 0;
-    config.lru_test_sample_size = 0;
-    config.cluster_mode = 0;
-    config.cluster_send_asking = 0;
-    config.slave_mode = 0;
-    config.getrdb_mode = 0;
-    config.stat_mode = 0;
-    config.scan_mode = 0;
-    config.intrinsic_latency_mode = 0;
-    config.pattern = NULL;
-    config.rdb_filename = NULL;
-    config.pipe_mode = 0;
-    config.pipe_timeout = REDIS_CLI_DEFAULT_PIPE_TIMEOUT;
-    config.bigkeys = 0;
-    config.hotkeys = 0;
-    config.stdinarg = 0;
-    config.auth = NULL;
-    config.askpass = 0;
-    config.user = NULL;
-    config.eval = NULL;
-    config.eval_ldb = 0;
-    config.eval_ldb_end = 0;
-    config.eval_ldb_sync = 0;
-    config.enable_ldb_on_eval = 0;
-    config.last_cmd_type = -1;
-    config.verbose = 0;
-    config.set_errcode = 0;
-    config.no_auth_warning = 0;
-    config.in_multi = 0;
-    config.cluster_manager_command.name = NULL;
-    config.cluster_manager_command.argc = 0;
-    config.cluster_manager_command.argv = NULL;
-    config.cluster_manager_command.flags = 0;
-    config.cluster_manager_command.replicas = 0;
-    config.cluster_manager_command.from = NULL;
-    config.cluster_manager_command.to = NULL;
-    config.cluster_manager_command.from_user = NULL;
-    config.cluster_manager_command.from_pass = NULL;
-    config.cluster_manager_command.from_askpass = 0;
-    config.cluster_manager_command.weight = NULL;
-    config.cluster_manager_command.weight_argc = 0;
-    config.cluster_manager_command.slots = 0;
-    config.cluster_manager_command.timeout = CLUSTER_MANAGER_MIGRATE_TIMEOUT;
-    config.cluster_manager_command.pipeline = CLUSTER_MANAGER_MIGRATE_PIPELINE;
-    config.cluster_manager_command.threshold =
-        CLUSTER_MANAGER_REBALANCE_THRESHOLD;
-    config.cluster_manager_command.backup_dir = NULL;
-    pref.hints = 1;
-
-    spectrum_palette = spectrum_palette_color;
-    spectrum_palette_size = spectrum_palette_color_size;
-
-    if (!isatty(fileno(stdout)) && (getenv("FAKETTY") == NULL)) {
-        config.output = OUTPUT_RAW;
-        config.push_output = 0;
-    } else {
-        config.output = OUTPUT_STANDARD;
-        config.push_output = 1;
-    }
-    config.mb_delim = sdsnew("\n");
-    config.cmd_delim = sdsnew("\n");
-
-    firstarg = parseOptions(argc,argv);
-    argc -= firstarg;
-    argv += firstarg;
-
-    parseEnv();
-
-    if (config.askpass) {
-        config.auth = askPassword("Please input password: ");
-    }
-
-    if (config.cluster_manager_command.from_askpass) {
-        config.cluster_manager_command.from_pass = askPassword(
-            "Please input import source node password: ");
-    }
-
-#ifdef USE_OPENSSL
-    if (config.tls) {
-        cliSecureInit();
-    }
-#endif
-
-    gettimeofday(&tv, NULL);
-    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
-
-    /* Cluster Manager mode */
-    if (CLUSTER_MANAGER_MODE()) {
-        clusterManagerCommandProc *proc = validateClusterManagerCommand();
-        if (!proc) {
-            exit(1);
-        }
-        clusterManagerMode(proc);
-    }
-
-    /* Latency mode */
-    if (config.latency_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        latencyMode();
-    }
-
-    /* Latency distribution mode */
-    if (config.latency_dist_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        latencyDistMode();
-    }
-
-    /* Slave mode */
-    if (config.slave_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        sendCapa();
-        slaveMode();
-    }
-
-    /* Get RDB mode. */
-    if (config.getrdb_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        sendCapa();
-        sendRdbOnly();
-        getRDB(NULL);
-    }
-
-    /* Pipe mode */
-    if (config.pipe_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        pipeMode();
-    }
-
-    /* Find big keys */
-    if (config.bigkeys) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        findBigKeys(0, 0);
-    }
-
-    /* Find large keys */
-    if (config.memkeys) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        findBigKeys(1, config.memkeys_samples);
-    }
-
-    /* Find hot keys */
-    if (config.hotkeys) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        findHotKeys();
-    }
-
-    /* Stat mode */
-    if (config.stat_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        if (config.interval == 0) config.interval = 1000000;
-        statMode();
-    }
-
-    /* Scan mode */
-    if (config.scan_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        scanMode();
-    }
-
-    /* LRU test mode */
-    if (config.lru_test_mode) {
-        if (cliConnect(0) == REDIS_ERR) exit(1);
-        LRUTestMode();
-    }
-
-    /* Intrinsic latency mode */
-    if (config.intrinsic_latency_mode) intrinsicLatencyMode();
-
-    /* Start interactive mode when no command is provided */
-    if (argc == 0 && !config.eval) {
-        /* Ignore SIGPIPE in interactive mode to force a reconnect */
-        signal(SIGPIPE, SIG_IGN);
-
-        /* Note that in repl mode we don't abort on connection error.
-         * A new attempt will be performed for every command send. */
-        cliConnect(0);
-        repl();
-    }
-
-    /* Otherwise, we have some arguments to execute */
-    if (cliConnect(0) != REDIS_OK) exit(1);
-    if (config.eval) {
-        return evalMode(argc,argv);
-    } else {
-        return noninteractive(argc,argv);
-    }
-}
diff --git a/redis-stable/src/redis-trib.rb b/redis-stable/src/redis-trib.rb
deleted file mode 100755
index b1af8306..00000000
--- a/redis-stable/src/redis-trib.rb
+++ /dev/null
@@ -1,129 +0,0 @@
-#!/usr/bin/env ruby
-
-def colorized(str, color)
-    return str if !(ENV['TERM'] || '')["xterm"]
-    color_code = {
-        white: 29,
-        bold: '29;1',
-        black: 30,
-        red: 31,
-        green: 32,
-        yellow: 33,
-        blue: 34,
-        magenta: 35,
-        cyan: 36,
-        gray: 37
-    }[color]
-    return str if !color_code
-    "\033[#{color_code}m#{str}\033[0m"
-end
-
-class String
-
-    %w(white bold black red green yellow blue magenta cyan gray).each{|color|
-        color = :"#{color}"
-        define_method(color){
-            colorized(self, color)
-        }
-    }
-
-end
-
-COMMANDS = %w(create check info fix reshard rebalance add-node 
-              del-node set-timeout call import help)
-
-ALLOWED_OPTIONS={
-    "create" => {"replicas" => true},
-    "add-node" => {"slave" => false, "master-id" => true},
-    "import" => {"from" => :required, "copy" => false, "replace" => false},
-    "reshard" => {"from" => true, "to" => true, "slots" => true, "yes" => false, "timeout" => true, "pipeline" => true},
-    "rebalance" => {"weight" => [], "auto-weights" => false, "use-empty-masters" => false, "timeout" => true, "simulate" => false, "pipeline" => true, "threshold" => true},
-    "fix" => {"timeout" => 0},
-}
-
-def parse_options(cmd)
-    cmd = cmd.downcase
-    idx = 0
-    options = {}
-    args = []
-    while (arg = ARGV.shift)
-        if arg[0..1] == "--"
-            option = arg[2..-1]
-
-            # --verbose is a global option
-            if option == "--verbose"
-                options['verbose'] = true
-                next
-            end
-            if ALLOWED_OPTIONS[cmd] == nil || 
-               ALLOWED_OPTIONS[cmd][option] == nil
-                next
-            end
-            if ALLOWED_OPTIONS[cmd][option] != false
-                value = ARGV.shift
-                next if !value
-            else
-                value = true
-            end
-
-            # If the option is set to [], it's a multiple arguments
-            # option. We just queue every new value into an array.
-            if ALLOWED_OPTIONS[cmd][option] == []
-                options[option] = [] if !options[option]
-                options[option] << value
-            else
-                options[option] = value
-            end
-        else
-            next if arg[0,1] == '-'
-            args << arg
-        end
-    end
-
-    return options,args
-end
-
-def command_example(cmd, args, opts)
-    cmd = "redis-cli --cluster #{cmd}"
-    args.each{|a| 
-        a = a.to_s
-        a = a.inspect if a[' ']
-        cmd << " #{a}"
-    }
-    opts.each{|opt, val|
-        opt = " --cluster-#{opt.downcase}"
-        if val != true
-            val = val.join(' ') if val.is_a? Array
-            opt << " #{val}"
-        end
-        cmd << opt
-    }
-    cmd
-end
-
-$command = ARGV.shift
-$opts, $args = parse_options($command) if $command
-
-puts "WARNING: redis-trib.rb is not longer available!".yellow
-puts "You should use #{'redis-cli'.bold} instead."
-puts ''
-puts "All commands and features belonging to redis-trib.rb "+
-     "have been moved\nto redis-cli."
-puts "In order to use them you should call redis-cli with the #{'--cluster'.bold}"
-puts "option followed by the subcommand name, arguments and options."
-puts ''
-puts "Use the following syntax:"
-puts "redis-cli --cluster SUBCOMMAND [ARGUMENTS] [OPTIONS]".bold
-puts ''
-puts "Example:"
-if $command
-    example = command_example $command, $args, $opts
-else
-    example = "redis-cli --cluster info 127.0.0.1:7000"
-end
-puts example.bold
-puts ''
-puts "To get help about all subcommands, type:"
-puts "redis-cli --cluster help".bold
-puts ''
-exit 1
diff --git a/redis-stable/src/redisassert.h b/redis-stable/src/redisassert.h
deleted file mode 100644
index dd792055..00000000
--- a/redis-stable/src/redisassert.h
+++ /dev/null
@@ -1,49 +0,0 @@
-/* redisassert.h -- Drop in replacements assert.h that prints the stack trace
- *                  in the Redis logs.
- *
- * This file should be included instead of "assert.h" inside libraries used by
- * Redis that are using assertions, so instead of Redis disappearing with
- * SIGABORT, we get the details and stack trace inside the log file.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __REDIS_ASSERT_H__
-#define __REDIS_ASSERT_H__
-
-#include "config.h"
-
-#define assert(_e) (likely((_e))?(void)0 : (_serverAssert(#_e,__FILE__,__LINE__),redis_unreachable()))
-#define panic(...) _serverPanic(__FILE__,__LINE__,__VA_ARGS__),redis_unreachable()
-
-void _serverAssert(char *estr, char *file, int line);
-void _serverPanic(const char *file, int line, const char *msg, ...);
-
-#endif
diff --git a/redis-stable/src/redismodule.h b/redis-stable/src/redismodule.h
deleted file mode 100644
index 48a3a9df..00000000
--- a/redis-stable/src/redismodule.h
+++ /dev/null
@@ -1,1137 +0,0 @@
-#ifndef REDISMODULE_H
-#define REDISMODULE_H
-
-#include <sys/types.h>
-#include <stdint.h>
-#include <stdio.h>
-
-/* ---------------- Defines common between core and modules --------------- */
-
-/* Error status return values. */
-#define REDISMODULE_OK 0
-#define REDISMODULE_ERR 1
-
-/* API versions. */
-#define REDISMODULE_APIVER_1 1
-
-/* Version of the RedisModuleTypeMethods structure. Once the RedisModuleTypeMethods 
- * structure is changed, this version number needs to be changed synchronistically. */
-#define REDISMODULE_TYPE_METHOD_VERSION 3
-
-/* API flags and constants */
-#define REDISMODULE_READ (1<<0)
-#define REDISMODULE_WRITE (1<<1)
-
-/* RedisModule_OpenKey extra flags for the 'mode' argument.
- * Avoid touching the LRU/LFU of the key when opened. */
-#define REDISMODULE_OPEN_KEY_NOTOUCH (1<<16)
-
-#define REDISMODULE_LIST_HEAD 0
-#define REDISMODULE_LIST_TAIL 1
-
-/* Key types. */
-#define REDISMODULE_KEYTYPE_EMPTY 0
-#define REDISMODULE_KEYTYPE_STRING 1
-#define REDISMODULE_KEYTYPE_LIST 2
-#define REDISMODULE_KEYTYPE_HASH 3
-#define REDISMODULE_KEYTYPE_SET 4
-#define REDISMODULE_KEYTYPE_ZSET 5
-#define REDISMODULE_KEYTYPE_MODULE 6
-#define REDISMODULE_KEYTYPE_STREAM 7
-
-/* Reply types. */
-#define REDISMODULE_REPLY_UNKNOWN -1
-#define REDISMODULE_REPLY_STRING 0
-#define REDISMODULE_REPLY_ERROR 1
-#define REDISMODULE_REPLY_INTEGER 2
-#define REDISMODULE_REPLY_ARRAY 3
-#define REDISMODULE_REPLY_NULL 4
-
-/* Postponed array length. */
-#define REDISMODULE_POSTPONED_ARRAY_LEN -1
-
-/* Expire */
-#define REDISMODULE_NO_EXPIRE -1
-
-/* Sorted set API flags. */
-#define REDISMODULE_ZADD_XX      (1<<0)
-#define REDISMODULE_ZADD_NX      (1<<1)
-#define REDISMODULE_ZADD_ADDED   (1<<2)
-#define REDISMODULE_ZADD_UPDATED (1<<3)
-#define REDISMODULE_ZADD_NOP     (1<<4)
-#define REDISMODULE_ZADD_GT      (1<<5)
-#define REDISMODULE_ZADD_LT      (1<<6)
-
-/* Hash API flags. */
-#define REDISMODULE_HASH_NONE       0
-#define REDISMODULE_HASH_NX         (1<<0)
-#define REDISMODULE_HASH_XX         (1<<1)
-#define REDISMODULE_HASH_CFIELDS    (1<<2)
-#define REDISMODULE_HASH_EXISTS     (1<<3)
-#define REDISMODULE_HASH_COUNT_ALL  (1<<4)
-
-/* StreamID type. */
-typedef struct RedisModuleStreamID {
-    uint64_t ms;
-    uint64_t seq;
-} RedisModuleStreamID;
-
-/* StreamAdd() flags. */
-#define REDISMODULE_STREAM_ADD_AUTOID (1<<0)
-/* StreamIteratorStart() flags. */
-#define REDISMODULE_STREAM_ITERATOR_EXCLUSIVE (1<<0)
-#define REDISMODULE_STREAM_ITERATOR_REVERSE (1<<1)
-/* StreamIteratorTrim*() flags. */
-#define REDISMODULE_STREAM_TRIM_APPROX (1<<0)
-
-/* Context Flags: Info about the current context returned by
- * RM_GetContextFlags(). */
-
-/* The command is running in the context of a Lua script */
-#define REDISMODULE_CTX_FLAGS_LUA (1<<0)
-/* The command is running inside a Redis transaction */
-#define REDISMODULE_CTX_FLAGS_MULTI (1<<1)
-/* The instance is a master */
-#define REDISMODULE_CTX_FLAGS_MASTER (1<<2)
-/* The instance is a slave */
-#define REDISMODULE_CTX_FLAGS_SLAVE (1<<3)
-/* The instance is read-only (usually meaning it's a slave as well) */
-#define REDISMODULE_CTX_FLAGS_READONLY (1<<4)
-/* The instance is running in cluster mode */
-#define REDISMODULE_CTX_FLAGS_CLUSTER (1<<5)
-/* The instance has AOF enabled */
-#define REDISMODULE_CTX_FLAGS_AOF (1<<6)
-/* The instance has RDB enabled */
-#define REDISMODULE_CTX_FLAGS_RDB (1<<7)
-/* The instance has Maxmemory set */
-#define REDISMODULE_CTX_FLAGS_MAXMEMORY (1<<8)
-/* Maxmemory is set and has an eviction policy that may delete keys */
-#define REDISMODULE_CTX_FLAGS_EVICT (1<<9)
-/* Redis is out of memory according to the maxmemory flag. */
-#define REDISMODULE_CTX_FLAGS_OOM (1<<10)
-/* Less than 25% of memory available according to maxmemory. */
-#define REDISMODULE_CTX_FLAGS_OOM_WARNING (1<<11)
-/* The command was sent over the replication link. */
-#define REDISMODULE_CTX_FLAGS_REPLICATED (1<<12)
-/* Redis is currently loading either from AOF or RDB. */
-#define REDISMODULE_CTX_FLAGS_LOADING (1<<13)
-/* The replica has no link with its master, note that
- * there is the inverse flag as well:
- *
- *  REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE
- *
- * The two flags are exclusive, one or the other can be set. */
-#define REDISMODULE_CTX_FLAGS_REPLICA_IS_STALE (1<<14)
-/* The replica is trying to connect with the master.
- * (REPL_STATE_CONNECT and REPL_STATE_CONNECTING states) */
-#define REDISMODULE_CTX_FLAGS_REPLICA_IS_CONNECTING (1<<15)
-/* THe replica is receiving an RDB file from its master. */
-#define REDISMODULE_CTX_FLAGS_REPLICA_IS_TRANSFERRING (1<<16)
-/* The replica is online, receiving updates from its master. */
-#define REDISMODULE_CTX_FLAGS_REPLICA_IS_ONLINE (1<<17)
-/* There is currently some background process active. */
-#define REDISMODULE_CTX_FLAGS_ACTIVE_CHILD (1<<18)
-/* The next EXEC will fail due to dirty CAS (touched keys). */
-#define REDISMODULE_CTX_FLAGS_MULTI_DIRTY (1<<19)
-/* Redis is currently running inside background child process. */
-#define REDISMODULE_CTX_FLAGS_IS_CHILD (1<<20)
-/* The current client does not allow blocking, either called from
- * within multi, lua, or from another module using RM_Call */
-#define REDISMODULE_CTX_FLAGS_DENY_BLOCKING (1<<21)
-
-/* Next context flag, must be updated when adding new flags above!
-This flag should not be used directly by the module.
- * Use RedisModule_GetContextFlagsAll instead. */
-#define _REDISMODULE_CTX_FLAGS_NEXT (1<<22)
-
-/* Keyspace changes notification classes. Every class is associated with a
- * character for configuration purposes.
- * NOTE: These have to be in sync with NOTIFY_* in server.h */
-#define REDISMODULE_NOTIFY_KEYSPACE (1<<0)    /* K */
-#define REDISMODULE_NOTIFY_KEYEVENT (1<<1)    /* E */
-#define REDISMODULE_NOTIFY_GENERIC (1<<2)     /* g */
-#define REDISMODULE_NOTIFY_STRING (1<<3)      /* $ */
-#define REDISMODULE_NOTIFY_LIST (1<<4)        /* l */
-#define REDISMODULE_NOTIFY_SET (1<<5)         /* s */
-#define REDISMODULE_NOTIFY_HASH (1<<6)        /* h */
-#define REDISMODULE_NOTIFY_ZSET (1<<7)        /* z */
-#define REDISMODULE_NOTIFY_EXPIRED (1<<8)     /* x */
-#define REDISMODULE_NOTIFY_EVICTED (1<<9)     /* e */
-#define REDISMODULE_NOTIFY_STREAM (1<<10)     /* t */
-#define REDISMODULE_NOTIFY_KEY_MISS (1<<11)   /* m (Note: This one is excluded from REDISMODULE_NOTIFY_ALL on purpose) */
-#define REDISMODULE_NOTIFY_LOADED (1<<12)     /* module only key space notification, indicate a key loaded from rdb */
-#define REDISMODULE_NOTIFY_MODULE (1<<13)     /* d, module key space notification */
-
-/* Next notification flag, must be updated when adding new flags above!
-This flag should not be used directly by the module.
- * Use RedisModule_GetKeyspaceNotificationFlagsAll instead. */
-#define _REDISMODULE_NOTIFY_NEXT (1<<14)
-
-#define REDISMODULE_NOTIFY_ALL (REDISMODULE_NOTIFY_GENERIC | REDISMODULE_NOTIFY_STRING | REDISMODULE_NOTIFY_LIST | REDISMODULE_NOTIFY_SET | REDISMODULE_NOTIFY_HASH | REDISMODULE_NOTIFY_ZSET | REDISMODULE_NOTIFY_EXPIRED | REDISMODULE_NOTIFY_EVICTED | REDISMODULE_NOTIFY_STREAM | REDISMODULE_NOTIFY_MODULE)      /* A */
-
-/* A special pointer that we can use between the core and the module to signal
- * field deletion, and that is impossible to be a valid pointer. */
-#define REDISMODULE_HASH_DELETE ((RedisModuleString*)(long)1)
-
-/* Error messages. */
-#define REDISMODULE_ERRORMSG_WRONGTYPE "WRONGTYPE Operation against a key holding the wrong kind of value"
-
-#define REDISMODULE_POSITIVE_INFINITE (1.0/0.0)
-#define REDISMODULE_NEGATIVE_INFINITE (-1.0/0.0)
-
-/* Cluster API defines. */
-#define REDISMODULE_NODE_ID_LEN 40
-#define REDISMODULE_NODE_MYSELF     (1<<0)
-#define REDISMODULE_NODE_MASTER     (1<<1)
-#define REDISMODULE_NODE_SLAVE      (1<<2)
-#define REDISMODULE_NODE_PFAIL      (1<<3)
-#define REDISMODULE_NODE_FAIL       (1<<4)
-#define REDISMODULE_NODE_NOFAILOVER (1<<5)
-
-#define REDISMODULE_CLUSTER_FLAG_NONE 0
-#define REDISMODULE_CLUSTER_FLAG_NO_FAILOVER (1<<1)
-#define REDISMODULE_CLUSTER_FLAG_NO_REDIRECTION (1<<2)
-
-#define REDISMODULE_NOT_USED(V) ((void) V)
-
-/* Logging level strings */
-#define REDISMODULE_LOGLEVEL_DEBUG "debug"
-#define REDISMODULE_LOGLEVEL_VERBOSE "verbose"
-#define REDISMODULE_LOGLEVEL_NOTICE "notice"
-#define REDISMODULE_LOGLEVEL_WARNING "warning"
-
-/* Bit flags for aux_save_triggers and the aux_load and aux_save callbacks */
-#define REDISMODULE_AUX_BEFORE_RDB (1<<0)
-#define REDISMODULE_AUX_AFTER_RDB (1<<1)
-
-/* This type represents a timer handle, and is returned when a timer is
- * registered and used in order to invalidate a timer. It's just a 64 bit
- * number, because this is how each timer is represented inside the radix tree
- * of timers that are going to expire, sorted by expire time. */
-typedef uint64_t RedisModuleTimerID;
-
-/* CommandFilter Flags */
-
-/* Do filter RedisModule_Call() commands initiated by module itself. */
-#define REDISMODULE_CMDFILTER_NOSELF    (1<<0)
-
-/* Declare that the module can handle errors with RedisModule_SetModuleOptions. */
-#define REDISMODULE_OPTIONS_HANDLE_IO_ERRORS    (1<<0)
-/* When set, Redis will not call RedisModule_SignalModifiedKey(), implicitly in
- * RedisModule_CloseKey, and the module needs to do that when manually when keys
- * are modified from the user's sperspective, to invalidate WATCH. */
-#define REDISMODULE_OPTION_NO_IMPLICIT_SIGNAL_MODIFIED (1<<1)
-
-/* Server events definitions.
- * Those flags should not be used directly by the module, instead
- * the module should use RedisModuleEvent_* variables */
-#define REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED 0
-#define REDISMODULE_EVENT_PERSISTENCE 1
-#define REDISMODULE_EVENT_FLUSHDB 2
-#define REDISMODULE_EVENT_LOADING 3
-#define REDISMODULE_EVENT_CLIENT_CHANGE 4
-#define REDISMODULE_EVENT_SHUTDOWN 5
-#define REDISMODULE_EVENT_REPLICA_CHANGE 6
-#define REDISMODULE_EVENT_MASTER_LINK_CHANGE 7
-#define REDISMODULE_EVENT_CRON_LOOP 8
-#define REDISMODULE_EVENT_MODULE_CHANGE 9
-#define REDISMODULE_EVENT_LOADING_PROGRESS 10
-#define REDISMODULE_EVENT_SWAPDB 11
-#define REDISMODULE_EVENT_REPL_BACKUP 12
-#define REDISMODULE_EVENT_FORK_CHILD 13
-#define _REDISMODULE_EVENT_NEXT 14 /* Next event flag, should be updated if a new event added. */
-
-typedef struct RedisModuleEvent {
-    uint64_t id;        /* REDISMODULE_EVENT_... defines. */
-    uint64_t dataver;   /* Version of the structure we pass as 'data'. */
-} RedisModuleEvent;
-
-struct RedisModuleCtx;
-struct RedisModuleDefragCtx;
-typedef void (*RedisModuleEventCallback)(struct RedisModuleCtx *ctx, RedisModuleEvent eid, uint64_t subevent, void *data);
-
-static const RedisModuleEvent
-    RedisModuleEvent_ReplicationRoleChanged = {
-        REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
-        1
-    },
-    RedisModuleEvent_Persistence = {
-        REDISMODULE_EVENT_PERSISTENCE,
-        1
-    },
-    RedisModuleEvent_FlushDB = {
-        REDISMODULE_EVENT_FLUSHDB,
-        1
-    },
-    RedisModuleEvent_Loading = {
-        REDISMODULE_EVENT_LOADING,
-        1
-    },
-    RedisModuleEvent_ClientChange = {
-        REDISMODULE_EVENT_CLIENT_CHANGE,
-        1
-    },
-    RedisModuleEvent_Shutdown = {
-        REDISMODULE_EVENT_SHUTDOWN,
-        1
-    },
-    RedisModuleEvent_ReplicaChange = {
-        REDISMODULE_EVENT_REPLICA_CHANGE,
-        1
-    },
-    RedisModuleEvent_CronLoop = {
-        REDISMODULE_EVENT_CRON_LOOP,
-        1
-    },
-    RedisModuleEvent_MasterLinkChange = {
-        REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-        1
-    },
-    RedisModuleEvent_ModuleChange = {
-        REDISMODULE_EVENT_MODULE_CHANGE,
-        1
-    },
-    RedisModuleEvent_LoadingProgress = {
-        REDISMODULE_EVENT_LOADING_PROGRESS,
-        1
-    },
-    RedisModuleEvent_SwapDB = {
-        REDISMODULE_EVENT_SWAPDB,
-        1
-    },
-    RedisModuleEvent_ReplBackup = {
-        REDISMODULE_EVENT_REPL_BACKUP,
-        1
-    },
-    RedisModuleEvent_ForkChild = {
-        REDISMODULE_EVENT_FORK_CHILD,
-        1
-    };
-
-/* Those are values that are used for the 'subevent' callback argument. */
-#define REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START 0
-#define REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START 1
-#define REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START 2
-#define REDISMODULE_SUBEVENT_PERSISTENCE_ENDED 3
-#define REDISMODULE_SUBEVENT_PERSISTENCE_FAILED 4
-#define _REDISMODULE_SUBEVENT_PERSISTENCE_NEXT 5
-
-#define REDISMODULE_SUBEVENT_LOADING_RDB_START 0
-#define REDISMODULE_SUBEVENT_LOADING_AOF_START 1
-#define REDISMODULE_SUBEVENT_LOADING_REPL_START 2
-#define REDISMODULE_SUBEVENT_LOADING_ENDED 3
-#define REDISMODULE_SUBEVENT_LOADING_FAILED 4
-#define _REDISMODULE_SUBEVENT_LOADING_NEXT 5
-
-#define REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED 0
-#define REDISMODULE_SUBEVENT_CLIENT_CHANGE_DISCONNECTED 1
-#define _REDISMODULE_SUBEVENT_CLIENT_CHANGE_NEXT 2
-
-#define REDISMODULE_SUBEVENT_MASTER_LINK_UP 0
-#define REDISMODULE_SUBEVENT_MASTER_LINK_DOWN 1
-#define _REDISMODULE_SUBEVENT_MASTER_NEXT 2
-
-#define REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE 0
-#define REDISMODULE_SUBEVENT_REPLICA_CHANGE_OFFLINE 1
-#define _REDISMODULE_SUBEVENT_REPLICA_CHANGE_NEXT 2
-
-#define REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER 0
-#define REDISMODULE_EVENT_REPLROLECHANGED_NOW_REPLICA 1
-#define _REDISMODULE_EVENT_REPLROLECHANGED_NEXT 2
-
-#define REDISMODULE_SUBEVENT_FLUSHDB_START 0
-#define REDISMODULE_SUBEVENT_FLUSHDB_END 1
-#define _REDISMODULE_SUBEVENT_FLUSHDB_NEXT 2
-
-#define REDISMODULE_SUBEVENT_MODULE_LOADED 0
-#define REDISMODULE_SUBEVENT_MODULE_UNLOADED 1
-#define _REDISMODULE_SUBEVENT_MODULE_NEXT 2
-
-#define REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB 0
-#define REDISMODULE_SUBEVENT_LOADING_PROGRESS_AOF 1
-#define _REDISMODULE_SUBEVENT_LOADING_PROGRESS_NEXT 2
-
-#define REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE 0
-#define REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE 1
-#define REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD 2
-#define _REDISMODULE_SUBEVENT_REPL_BACKUP_NEXT 3
-
-#define REDISMODULE_SUBEVENT_FORK_CHILD_BORN 0
-#define REDISMODULE_SUBEVENT_FORK_CHILD_DIED 1
-#define _REDISMODULE_SUBEVENT_FORK_CHILD_NEXT 2
-
-#define _REDISMODULE_SUBEVENT_SHUTDOWN_NEXT 0
-#define _REDISMODULE_SUBEVENT_CRON_LOOP_NEXT 0
-#define _REDISMODULE_SUBEVENT_SWAPDB_NEXT 0
-
-/* RedisModuleClientInfo flags. */
-#define REDISMODULE_CLIENTINFO_FLAG_SSL (1<<0)
-#define REDISMODULE_CLIENTINFO_FLAG_PUBSUB (1<<1)
-#define REDISMODULE_CLIENTINFO_FLAG_BLOCKED (1<<2)
-#define REDISMODULE_CLIENTINFO_FLAG_TRACKING (1<<3)
-#define REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET (1<<4)
-#define REDISMODULE_CLIENTINFO_FLAG_MULTI (1<<5)
-
-/* Here we take all the structures that the module pass to the core
- * and the other way around. Notably the list here contains the structures
- * used by the hooks API RedisModule_RegisterToServerEvent().
- *
- * The structures always start with a 'version' field. This is useful
- * when we want to pass a reference to the structure to the core APIs,
- * for the APIs to fill the structure. In that case, the structure 'version'
- * field is initialized before passing it to the core, so that the core is
- * able to cast the pointer to the appropriate structure version. In this
- * way we obtain ABI compatibility.
- *
- * Here we'll list all the structure versions in case they evolve over time,
- * however using a define, we'll make sure to use the last version as the
- * public name for the module to use. */
-
-#define REDISMODULE_CLIENTINFO_VERSION 1
-typedef struct RedisModuleClientInfo {
-    uint64_t version;       /* Version of this structure for ABI compat. */
-    uint64_t flags;         /* REDISMODULE_CLIENTINFO_FLAG_* */
-    uint64_t id;            /* Client ID. */
-    char addr[46];          /* IPv4 or IPv6 address. */
-    uint16_t port;          /* TCP port. */
-    uint16_t db;            /* Selected DB. */
-} RedisModuleClientInfoV1;
-
-#define RedisModuleClientInfo RedisModuleClientInfoV1
-
-#define REDISMODULE_REPLICATIONINFO_VERSION 1
-typedef struct RedisModuleReplicationInfo {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    int master;             /* true if master, false if replica */
-    char *masterhost;       /* master instance hostname for NOW_REPLICA */
-    int masterport;         /* master instance port for NOW_REPLICA */
-    char *replid1;          /* Main replication ID */
-    char *replid2;          /* Secondary replication ID */
-    uint64_t repl1_offset;  /* Main replication offset */
-    uint64_t repl2_offset;  /* Offset of replid2 validity */
-} RedisModuleReplicationInfoV1;
-
-#define RedisModuleReplicationInfo RedisModuleReplicationInfoV1
-
-#define REDISMODULE_FLUSHINFO_VERSION 1
-typedef struct RedisModuleFlushInfo {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    int32_t sync;           /* Synchronous or threaded flush?. */
-    int32_t dbnum;          /* Flushed database number, -1 for ALL. */
-} RedisModuleFlushInfoV1;
-
-#define RedisModuleFlushInfo RedisModuleFlushInfoV1
-
-#define REDISMODULE_MODULE_CHANGE_VERSION 1
-typedef struct RedisModuleModuleChange {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    const char* module_name;/* Name of module loaded or unloaded. */
-    int32_t module_version; /* Module version. */
-} RedisModuleModuleChangeV1;
-
-#define RedisModuleModuleChange RedisModuleModuleChangeV1
-
-#define REDISMODULE_CRON_LOOP_VERSION 1
-typedef struct RedisModuleCronLoopInfo {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    int32_t hz;             /* Approximate number of events per second. */
-} RedisModuleCronLoopV1;
-
-#define RedisModuleCronLoop RedisModuleCronLoopV1
-
-#define REDISMODULE_LOADING_PROGRESS_VERSION 1
-typedef struct RedisModuleLoadingProgressInfo {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    int32_t hz;             /* Approximate number of events per second. */
-    int32_t progress;       /* Approximate progress between 0 and 1024, or -1
-                             * if unknown. */
-} RedisModuleLoadingProgressV1;
-
-#define RedisModuleLoadingProgress RedisModuleLoadingProgressV1
-
-#define REDISMODULE_SWAPDBINFO_VERSION 1
-typedef struct RedisModuleSwapDbInfo {
-    uint64_t version;       /* Not used since this structure is never passed
-                               from the module to the core right now. Here
-                               for future compatibility. */
-    int32_t dbnum_first;    /* Swap Db first dbnum */
-    int32_t dbnum_second;   /* Swap Db second dbnum */
-} RedisModuleSwapDbInfoV1;
-
-#define RedisModuleSwapDbInfo RedisModuleSwapDbInfoV1
-
-/* ------------------------- End of common defines ------------------------ */
-
-#ifndef REDISMODULE_CORE
-
-typedef long long mstime_t;
-
-/* Macro definitions specific to individual compilers */
-#ifndef REDISMODULE_ATTR_UNUSED
-#    ifdef __GNUC__
-#        define REDISMODULE_ATTR_UNUSED __attribute__((unused))
-#    else
-#        define REDISMODULE_ATTR_UNUSED
-#    endif
-#endif
-
-#ifndef REDISMODULE_ATTR_PRINTF
-#    ifdef __GNUC__
-#        define REDISMODULE_ATTR_PRINTF(idx,cnt) __attribute__((format(printf,idx,cnt)))
-#    else
-#        define REDISMODULE_ATTR_PRINTF(idx,cnt)
-#    endif
-#endif
-
-#ifndef REDISMODULE_ATTR_COMMON
-#    if defined(__GNUC__) && !defined(__clang__)
-#        define REDISMODULE_ATTR_COMMON __attribute__((__common__))
-#    else
-#        define REDISMODULE_ATTR_COMMON
-#    endif
-#endif
-
-/* Incomplete structures for compiler checks but opaque access. */
-typedef struct RedisModuleCtx RedisModuleCtx;
-typedef struct RedisModuleKey RedisModuleKey;
-typedef struct RedisModuleString RedisModuleString;
-typedef struct RedisModuleCallReply RedisModuleCallReply;
-typedef struct RedisModuleIO RedisModuleIO;
-typedef struct RedisModuleType RedisModuleType;
-typedef struct RedisModuleDigest RedisModuleDigest;
-typedef struct RedisModuleBlockedClient RedisModuleBlockedClient;
-typedef struct RedisModuleClusterInfo RedisModuleClusterInfo;
-typedef struct RedisModuleDict RedisModuleDict;
-typedef struct RedisModuleDictIter RedisModuleDictIter;
-typedef struct RedisModuleCommandFilterCtx RedisModuleCommandFilterCtx;
-typedef struct RedisModuleCommandFilter RedisModuleCommandFilter;
-typedef struct RedisModuleInfoCtx RedisModuleInfoCtx;
-typedef struct RedisModuleServerInfoData RedisModuleServerInfoData;
-typedef struct RedisModuleScanCursor RedisModuleScanCursor;
-typedef struct RedisModuleDefragCtx RedisModuleDefragCtx;
-typedef struct RedisModuleUser RedisModuleUser;
-
-typedef int (*RedisModuleCmdFunc)(RedisModuleCtx *ctx, RedisModuleString **argv, int argc);
-typedef void (*RedisModuleDisconnectFunc)(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc);
-typedef int (*RedisModuleNotificationFunc)(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key);
-typedef void *(*RedisModuleTypeLoadFunc)(RedisModuleIO *rdb, int encver);
-typedef void (*RedisModuleTypeSaveFunc)(RedisModuleIO *rdb, void *value);
-typedef int (*RedisModuleTypeAuxLoadFunc)(RedisModuleIO *rdb, int encver, int when);
-typedef void (*RedisModuleTypeAuxSaveFunc)(RedisModuleIO *rdb, int when);
-typedef void (*RedisModuleTypeRewriteFunc)(RedisModuleIO *aof, RedisModuleString *key, void *value);
-typedef size_t (*RedisModuleTypeMemUsageFunc)(const void *value);
-typedef void (*RedisModuleTypeDigestFunc)(RedisModuleDigest *digest, void *value);
-typedef void (*RedisModuleTypeFreeFunc)(void *value);
-typedef size_t (*RedisModuleTypeFreeEffortFunc)(RedisModuleString *key, const void *value);
-typedef void (*RedisModuleTypeUnlinkFunc)(RedisModuleString *key, const void *value);
-typedef void *(*RedisModuleTypeCopyFunc)(RedisModuleString *fromkey, RedisModuleString *tokey, const void *value);
-typedef int (*RedisModuleTypeDefragFunc)(RedisModuleDefragCtx *ctx, RedisModuleString *key, void **value);
-typedef void (*RedisModuleClusterMessageReceiver)(RedisModuleCtx *ctx, const char *sender_id, uint8_t type, const unsigned char *payload, uint32_t len);
-typedef void (*RedisModuleTimerProc)(RedisModuleCtx *ctx, void *data);
-typedef void (*RedisModuleCommandFilterFunc) (RedisModuleCommandFilterCtx *filter);
-typedef void (*RedisModuleForkDoneHandler) (int exitcode, int bysignal, void *user_data);
-typedef void (*RedisModuleInfoFunc)(RedisModuleInfoCtx *ctx, int for_crash_report);
-typedef void (*RedisModuleScanCB)(RedisModuleCtx *ctx, RedisModuleString *keyname, RedisModuleKey *key, void *privdata);
-typedef void (*RedisModuleScanKeyCB)(RedisModuleKey *key, RedisModuleString *field, RedisModuleString *value, void *privdata);
-typedef void (*RedisModuleUserChangedFunc) (uint64_t client_id, void *privdata);
-typedef int (*RedisModuleDefragFunc)(RedisModuleDefragCtx *ctx);
-
-typedef struct RedisModuleTypeMethods {
-    uint64_t version;
-    RedisModuleTypeLoadFunc rdb_load;
-    RedisModuleTypeSaveFunc rdb_save;
-    RedisModuleTypeRewriteFunc aof_rewrite;
-    RedisModuleTypeMemUsageFunc mem_usage;
-    RedisModuleTypeDigestFunc digest;
-    RedisModuleTypeFreeFunc free;
-    RedisModuleTypeAuxLoadFunc aux_load;
-    RedisModuleTypeAuxSaveFunc aux_save;
-    int aux_save_triggers;
-    RedisModuleTypeFreeEffortFunc free_effort;
-    RedisModuleTypeUnlinkFunc unlink;
-    RedisModuleTypeCopyFunc copy;
-    RedisModuleTypeDefragFunc defrag;
-} RedisModuleTypeMethods;
-
-#define REDISMODULE_GET_API(name) \
-    RedisModule_GetApi("RedisModule_" #name, ((void **)&RedisModule_ ## name))
-
-/* Default API declaration prefix (not 'extern' for backwards compatibility) */
-#ifndef REDISMODULE_API
-#define REDISMODULE_API
-#endif
-
-/* Default API declaration suffix (compiler attributes) */
-#ifndef REDISMODULE_ATTR
-#define REDISMODULE_ATTR REDISMODULE_ATTR_COMMON
-#endif
-
-REDISMODULE_API void * (*RedisModule_Alloc)(size_t bytes) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_Realloc)(void *ptr, size_t bytes) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_Free)(void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_Calloc)(size_t nmemb, size_t size) REDISMODULE_ATTR;
-REDISMODULE_API char * (*RedisModule_Strdup)(const char *str) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetApi)(const char *, void *) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CreateCommand)(RedisModuleCtx *ctx, const char *name, RedisModuleCmdFunc cmdfunc, const char *strflags, int firstkey, int lastkey, int keystep) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SetModuleAttribs)(RedisModuleCtx *ctx, const char *name, int ver, int apiver) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsModuleNameBusy)(const char *name) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_WrongArity)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithLongLong)(RedisModuleCtx *ctx, long long ll) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetSelectedDb)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SelectDb)(RedisModuleCtx *ctx, int newid) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_OpenKey)(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_CloseKey)(RedisModuleKey *kp) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_KeyType)(RedisModuleKey *kp) REDISMODULE_ATTR;
-REDISMODULE_API size_t (*RedisModule_ValueLength)(RedisModuleKey *kp) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ListPush)(RedisModuleKey *kp, int where, RedisModuleString *ele) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_ListPop)(RedisModuleKey *key, int where) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCallReply * (*RedisModule_Call)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
-REDISMODULE_API const char * (*RedisModule_CallReplyProto)(RedisModuleCallReply *reply, size_t *len) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeCallReply)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CallReplyType)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API long long (*RedisModule_CallReplyInteger)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API size_t (*RedisModule_CallReplyLength)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCallReply * (*RedisModule_CallReplyArrayElement)(RedisModuleCallReply *reply, size_t idx) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateString)(RedisModuleCtx *ctx, const char *ptr, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromLongLong)(RedisModuleCtx *ctx, long long ll) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromDouble)(RedisModuleCtx *ctx, double d) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromLongDouble)(RedisModuleCtx *ctx, long double ld, int humanfriendly) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromString)(RedisModuleCtx *ctx, const RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromStreamID)(RedisModuleCtx *ctx, const RedisModuleStreamID *id) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringPrintf)(RedisModuleCtx *ctx, const char *fmt, ...) REDISMODULE_ATTR_PRINTF(2,3) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API const char * (*RedisModule_StringPtrLen)(const RedisModuleString *str, size_t *len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithError)(RedisModuleCtx *ctx, const char *err) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithSimpleString)(RedisModuleCtx *ctx, const char *msg) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithArray)(RedisModuleCtx *ctx, long len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithNullArray)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithEmptyArray)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ReplySetArrayLength)(RedisModuleCtx *ctx, long len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithStringBuffer)(RedisModuleCtx *ctx, const char *buf, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithCString)(RedisModuleCtx *ctx, const char *buf) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithEmptyString)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithVerbatimString)(RedisModuleCtx *ctx, const char *buf, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithNull)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithDouble)(RedisModuleCtx *ctx, double d) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithLongDouble)(RedisModuleCtx *ctx, long double d) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplyWithCallReply)(RedisModuleCtx *ctx, RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringToLongLong)(const RedisModuleString *str, long long *ll) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringToDouble)(const RedisModuleString *str, double *d) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringToLongDouble)(const RedisModuleString *str, long double *d) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringToStreamID)(const RedisModuleString *str, RedisModuleStreamID *id) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_AutoMemory)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_Replicate)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ReplicateVerbatim)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API const char * (*RedisModule_CallReplyStringPtr)(RedisModuleCallReply *reply, size_t *len) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_CreateStringFromCallReply)(RedisModuleCallReply *reply) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DeleteKey)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_UnlinkKey)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringSet)(RedisModuleKey *key, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API char * (*RedisModule_StringDMA)(RedisModuleKey *key, size_t *len, int mode) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringTruncate)(RedisModuleKey *key, size_t newlen) REDISMODULE_ATTR;
-REDISMODULE_API mstime_t (*RedisModule_GetExpire)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SetExpire)(RedisModuleKey *key, mstime_t expire) REDISMODULE_ATTR;
-REDISMODULE_API mstime_t (*RedisModule_GetAbsExpire)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SetAbsExpire)(RedisModuleKey *key, mstime_t expire) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ResetDataset)(int restart_aof, int async) REDISMODULE_ATTR;
-REDISMODULE_API unsigned long long (*RedisModule_DbSize)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_RandomKey)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetAdd)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetIncrby)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr, double *newscore) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetScore)(RedisModuleKey *key, RedisModuleString *ele, double *score) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetRem)(RedisModuleKey *key, RedisModuleString *ele, int *deleted) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ZsetRangeStop)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetFirstInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetLastInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetFirstInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetLastInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_ZsetRangeCurrentElement)(RedisModuleKey *key, double *score) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetRangeNext)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetRangePrev)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ZsetRangeEndReached)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_HashSet)(RedisModuleKey *key, int flags, ...) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_HashGet)(RedisModuleKey *key, int flags, ...) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamAdd)(RedisModuleKey *key, int flags, RedisModuleStreamID *id, RedisModuleString **argv, int64_t numfields) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamDelete)(RedisModuleKey *key, RedisModuleStreamID *id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamIteratorStart)(RedisModuleKey *key, int flags, RedisModuleStreamID *startid, RedisModuleStreamID *endid) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamIteratorStop)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamIteratorNextID)(RedisModuleKey *key, RedisModuleStreamID *id, long *numfields) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamIteratorNextField)(RedisModuleKey *key, RedisModuleString **field_ptr, RedisModuleString **value_ptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StreamIteratorDelete)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API long long (*RedisModule_StreamTrimByLength)(RedisModuleKey *key, int flags, long long length) REDISMODULE_ATTR;
-REDISMODULE_API long long (*RedisModule_StreamTrimByID)(RedisModuleKey *key, int flags, RedisModuleStreamID *id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsKeysPositionRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_KeyAtPos)(RedisModuleCtx *ctx, int pos) REDISMODULE_ATTR;
-REDISMODULE_API unsigned long long (*RedisModule_GetClientId)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_GetClientUserNameById)(RedisModuleCtx *ctx, uint64_t id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetClientInfoById)(void *ci, uint64_t id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_PublishMessage)(RedisModuleCtx *ctx, RedisModuleString *channel, RedisModuleString *message) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetContextFlags)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_AvoidReplicaTraffic)() REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_PoolAlloc)(RedisModuleCtx *ctx, size_t bytes) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleType * (*RedisModule_CreateDataType)(RedisModuleCtx *ctx, const char *name, int encver, RedisModuleTypeMethods *typemethods) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ModuleTypeSetValue)(RedisModuleKey *key, RedisModuleType *mt, void *value) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ModuleTypeReplaceValue)(RedisModuleKey *key, RedisModuleType *mt, void *new_value, void **old_value) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleType * (*RedisModule_ModuleTypeGetType)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_ModuleTypeGetValue)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsIOError)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SetModuleOptions)(RedisModuleCtx *ctx, int options) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SignalModifiedKey)(RedisModuleCtx *ctx, RedisModuleString *keyname) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveUnsigned)(RedisModuleIO *io, uint64_t value) REDISMODULE_ATTR;
-REDISMODULE_API uint64_t (*RedisModule_LoadUnsigned)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveSigned)(RedisModuleIO *io, int64_t value) REDISMODULE_ATTR;
-REDISMODULE_API int64_t (*RedisModule_LoadSigned)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_EmitAOF)(RedisModuleIO *io, const char *cmdname, const char *fmt, ...) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveString)(RedisModuleIO *io, RedisModuleString *s) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveStringBuffer)(RedisModuleIO *io, const char *str, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_LoadString)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API char * (*RedisModule_LoadStringBuffer)(RedisModuleIO *io, size_t *lenptr) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveDouble)(RedisModuleIO *io, double value) REDISMODULE_ATTR;
-REDISMODULE_API double (*RedisModule_LoadDouble)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveFloat)(RedisModuleIO *io, float value) REDISMODULE_ATTR;
-REDISMODULE_API float (*RedisModule_LoadFloat)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SaveLongDouble)(RedisModuleIO *io, long double value) REDISMODULE_ATTR;
-REDISMODULE_API long double (*RedisModule_LoadLongDouble)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_LoadDataTypeFromString)(const RedisModuleString *str, const RedisModuleType *mt) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_SaveDataTypeToString)(RedisModuleCtx *ctx, void *data, const RedisModuleType *mt) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_Log)(RedisModuleCtx *ctx, const char *level, const char *fmt, ...) REDISMODULE_ATTR REDISMODULE_ATTR_PRINTF(3,4);
-REDISMODULE_API void (*RedisModule_LogIOError)(RedisModuleIO *io, const char *levelstr, const char *fmt, ...) REDISMODULE_ATTR REDISMODULE_ATTR_PRINTF(3,4);
-REDISMODULE_API void (*RedisModule__Assert)(const char *estr, const char *file, int line) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_LatencyAddSample)(const char *event, mstime_t latency) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringAppendBuffer)(RedisModuleCtx *ctx, RedisModuleString *str, const char *buf, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_RetainString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_HoldString)(RedisModuleCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StringCompare)(RedisModuleString *a, RedisModuleString *b) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCtx * (*RedisModule_GetContextFromIO)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API const RedisModuleString * (*RedisModule_GetKeyNameFromIO)(RedisModuleIO *io) REDISMODULE_ATTR;
-REDISMODULE_API const RedisModuleString * (*RedisModule_GetKeyNameFromModuleKey)(RedisModuleKey *key) REDISMODULE_ATTR;
-REDISMODULE_API long long (*RedisModule_Milliseconds)(void) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_DigestAddStringBuffer)(RedisModuleDigest *md, unsigned char *ele, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_DigestAddLongLong)(RedisModuleDigest *md, long long ele) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_DigestEndSequence)(RedisModuleDigest *md) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleDict * (*RedisModule_CreateDict)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeDict)(RedisModuleCtx *ctx, RedisModuleDict *d) REDISMODULE_ATTR;
-REDISMODULE_API uint64_t (*RedisModule_DictSize)(RedisModuleDict *d) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictSetC)(RedisModuleDict *d, void *key, size_t keylen, void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictReplaceC)(RedisModuleDict *d, void *key, size_t keylen, void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictSet)(RedisModuleDict *d, RedisModuleString *key, void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictReplace)(RedisModuleDict *d, RedisModuleString *key, void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_DictGetC)(RedisModuleDict *d, void *key, size_t keylen, int *nokey) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_DictGet)(RedisModuleDict *d, RedisModuleString *key, int *nokey) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictDelC)(RedisModuleDict *d, void *key, size_t keylen, void *oldval) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictDel)(RedisModuleDict *d, RedisModuleString *key, void *oldval) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleDictIter * (*RedisModule_DictIteratorStartC)(RedisModuleDict *d, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleDictIter * (*RedisModule_DictIteratorStart)(RedisModuleDict *d, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_DictIteratorStop)(RedisModuleDictIter *di) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictIteratorReseekC)(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictIteratorReseek)(RedisModuleDictIter *di, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_DictNextC)(RedisModuleDictIter *di, size_t *keylen, void **dataptr) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_DictPrevC)(RedisModuleDictIter *di, size_t *keylen, void **dataptr) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_DictNext)(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_DictPrev)(RedisModuleCtx *ctx, RedisModuleDictIter *di, void **dataptr) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictCompareC)(RedisModuleDictIter *di, const char *op, void *key, size_t keylen) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DictCompare)(RedisModuleDictIter *di, const char *op, RedisModuleString *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_RegisterInfoFunc)(RedisModuleCtx *ctx, RedisModuleInfoFunc cb) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddSection)(RedisModuleInfoCtx *ctx, char *name) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoBeginDictField)(RedisModuleInfoCtx *ctx, char *name) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoEndDictField)(RedisModuleInfoCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddFieldString)(RedisModuleInfoCtx *ctx, char *field, RedisModuleString *value) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddFieldCString)(RedisModuleInfoCtx *ctx, char *field, char *value) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddFieldDouble)(RedisModuleInfoCtx *ctx, char *field, double value) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddFieldLongLong)(RedisModuleInfoCtx *ctx, char *field, long long value) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_InfoAddFieldULongLong)(RedisModuleInfoCtx *ctx, char *field, unsigned long long value) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleServerInfoData * (*RedisModule_GetServerInfo)(RedisModuleCtx *ctx, const char *section) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeServerInfo)(RedisModuleCtx *ctx, RedisModuleServerInfoData *data) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_ServerInfoGetField)(RedisModuleCtx *ctx, RedisModuleServerInfoData *data, const char* field) REDISMODULE_ATTR;
-REDISMODULE_API const char * (*RedisModule_ServerInfoGetFieldC)(RedisModuleServerInfoData *data, const char* field) REDISMODULE_ATTR;
-REDISMODULE_API long long (*RedisModule_ServerInfoGetFieldSigned)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
-REDISMODULE_API unsigned long long (*RedisModule_ServerInfoGetFieldUnsigned)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
-REDISMODULE_API double (*RedisModule_ServerInfoGetFieldDouble)(RedisModuleServerInfoData *data, const char* field, int *out_err) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SubscribeToServerEvent)(RedisModuleCtx *ctx, RedisModuleEvent event, RedisModuleEventCallback callback) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SetLRU)(RedisModuleKey *key, mstime_t lru_idle) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetLRU)(RedisModuleKey *key, mstime_t *lru_idle) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SetLFU)(RedisModuleKey *key, long long lfu_freq) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetLFU)(RedisModuleKey *key, long long *lfu_freq) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_BlockClientOnKeys)(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms, RedisModuleString **keys, int numkeys, void *privdata) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SignalKeyAsReady)(RedisModuleCtx *ctx, RedisModuleString *key) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_GetBlockedClientReadyKey)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleScanCursor * (*RedisModule_ScanCursorCreate)() REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ScanCursorRestart)(RedisModuleScanCursor *cursor) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ScanCursorDestroy)(RedisModuleScanCursor *cursor) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_Scan)(RedisModuleCtx *ctx, RedisModuleScanCursor *cursor, RedisModuleScanCB fn, void *privdata) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ScanKey)(RedisModuleKey *key, RedisModuleScanCursor *cursor, RedisModuleScanKeyCB fn, void *privdata) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetContextFlagsAll)() REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetKeyspaceNotificationFlagsAll)() REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsSubEventSupported)(RedisModuleEvent event, uint64_t subevent) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetServerVersion)() REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetTypeMethodVersion)() REDISMODULE_ATTR;
-
-/* Experimental APIs */
-#ifdef REDISMODULE_EXPERIMENTAL_API
-#define REDISMODULE_EXPERIMENTAL_API_VERSION 3
-REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_BlockClient)(RedisModuleCtx *ctx, RedisModuleCmdFunc reply_callback, RedisModuleCmdFunc timeout_callback, void (*free_privdata)(RedisModuleCtx*,void*), long long timeout_ms) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_UnblockClient)(RedisModuleBlockedClient *bc, void *privdata) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsBlockedReplyRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_IsBlockedTimeoutRequest)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_GetBlockedClientPrivateData)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleBlockedClient * (*RedisModule_GetBlockedClientHandle)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_AbortBlock)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_BlockedClientMeasureTimeStart)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_BlockedClientMeasureTimeEnd)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCtx * (*RedisModule_GetThreadSafeContext)(RedisModuleBlockedClient *bc) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCtx * (*RedisModule_GetDetachedThreadSafeContext)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeThreadSafeContext)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ThreadSafeContextLock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ThreadSafeContextTryLock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_ThreadSafeContextUnlock)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SubscribeToKeyspaceEvents)(RedisModuleCtx *ctx, int types, RedisModuleNotificationFunc cb) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_NotifyKeyspaceEvent)(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetNotifyKeyspaceEvents)() REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_BlockedClientDisconnected)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_RegisterClusterMessageReceiver)(RedisModuleCtx *ctx, uint8_t type, RedisModuleClusterMessageReceiver callback) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SendClusterMessage)(RedisModuleCtx *ctx, char *target_id, uint8_t type, unsigned char *msg, uint32_t len) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetClusterNodeInfo)(RedisModuleCtx *ctx, const char *id, char *ip, char *master_id, int *port, int *flags) REDISMODULE_ATTR;
-REDISMODULE_API char ** (*RedisModule_GetClusterNodesList)(RedisModuleCtx *ctx, size_t *numnodes) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeClusterNodesList)(char **ids) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleTimerID (*RedisModule_CreateTimer)(RedisModuleCtx *ctx, mstime_t period, RedisModuleTimerProc callback, void *data) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_StopTimer)(RedisModuleCtx *ctx, RedisModuleTimerID id, void **data) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_GetTimerInfo)(RedisModuleCtx *ctx, RedisModuleTimerID id, uint64_t *remaining, void **data) REDISMODULE_ATTR;
-REDISMODULE_API const char * (*RedisModule_GetMyClusterID)(void) REDISMODULE_ATTR;
-REDISMODULE_API size_t (*RedisModule_GetClusterSize)(void) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_GetRandomBytes)(unsigned char *dst, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_GetRandomHexChars)(char *dst, size_t len) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SetDisconnectCallback)(RedisModuleBlockedClient *bc, RedisModuleDisconnectFunc callback) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SetClusterFlags)(RedisModuleCtx *ctx, uint64_t flags) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ExportSharedAPI)(RedisModuleCtx *ctx, const char *apiname, void *func) REDISMODULE_ATTR;
-REDISMODULE_API void * (*RedisModule_GetSharedAPI)(RedisModuleCtx *ctx, const char *apiname) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleCommandFilter * (*RedisModule_RegisterCommandFilter)(RedisModuleCtx *ctx, RedisModuleCommandFilterFunc cb, int flags) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_UnregisterCommandFilter)(RedisModuleCtx *ctx, RedisModuleCommandFilter *filter) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CommandFilterArgsCount)(RedisModuleCommandFilterCtx *fctx) REDISMODULE_ATTR;
-REDISMODULE_API const RedisModuleString * (*RedisModule_CommandFilterArgGet)(RedisModuleCommandFilterCtx *fctx, int pos) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CommandFilterArgInsert)(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CommandFilterArgReplace)(RedisModuleCommandFilterCtx *fctx, int pos, RedisModuleString *arg) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_CommandFilterArgDelete)(RedisModuleCommandFilterCtx *fctx, int pos) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_Fork)(RedisModuleForkDoneHandler cb, void *user_data) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_SendChildHeartbeat)(double progress) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_ExitFromChild)(int retcode) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_KillForkChild)(int child_pid) REDISMODULE_ATTR;
-REDISMODULE_API float (*RedisModule_GetUsedMemoryRatio)() REDISMODULE_ATTR;
-REDISMODULE_API size_t (*RedisModule_MallocSize)(void* ptr) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleUser * (*RedisModule_CreateModuleUser)(const char *name) REDISMODULE_ATTR;
-REDISMODULE_API void (*RedisModule_FreeModuleUser)(RedisModuleUser *user) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_SetModuleUserACL)(RedisModuleUser *user, const char* acl) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_AuthenticateClientWithACLUser)(RedisModuleCtx *ctx, const char *name, size_t len, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_AuthenticateClientWithUser)(RedisModuleCtx *ctx, RedisModuleUser *user, RedisModuleUserChangedFunc callback, void *privdata, uint64_t *client_id) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DeauthenticateAndCloseClient)(RedisModuleCtx *ctx, uint64_t client_id) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString * (*RedisModule_GetClientCertificate)(RedisModuleCtx *ctx, uint64_t id) REDISMODULE_ATTR;
-REDISMODULE_API int *(*RedisModule_GetCommandKeys)(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, int *num_keys) REDISMODULE_ATTR;
-REDISMODULE_API const char *(*RedisModule_GetCurrentCommandName)(RedisModuleCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_RegisterDefragFunc)(RedisModuleCtx *ctx, RedisModuleDefragFunc func) REDISMODULE_ATTR;
-REDISMODULE_API void *(*RedisModule_DefragAlloc)(RedisModuleDefragCtx *ctx, void *ptr) REDISMODULE_ATTR;
-REDISMODULE_API RedisModuleString *(*RedisModule_DefragRedisModuleString)(RedisModuleDefragCtx *ctx, RedisModuleString *str) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DefragShouldStop)(RedisModuleDefragCtx *ctx) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DefragCursorSet)(RedisModuleDefragCtx *ctx, unsigned long cursor) REDISMODULE_ATTR;
-REDISMODULE_API int (*RedisModule_DefragCursorGet)(RedisModuleDefragCtx *ctx, unsigned long *cursor) REDISMODULE_ATTR;
-#endif
-
-#define RedisModule_IsAOFClient(id) ((id) == UINT64_MAX)
-
-/* This is included inline inside each Redis module. */
-static int RedisModule_Init(RedisModuleCtx *ctx, const char *name, int ver, int apiver) REDISMODULE_ATTR_UNUSED;
-static int RedisModule_Init(RedisModuleCtx *ctx, const char *name, int ver, int apiver) {
-    void *getapifuncptr = ((void**)ctx)[0];
-    RedisModule_GetApi = (int (*)(const char *, void *)) (unsigned long)getapifuncptr;
-    REDISMODULE_GET_API(Alloc);
-    REDISMODULE_GET_API(Calloc);
-    REDISMODULE_GET_API(Free);
-    REDISMODULE_GET_API(Realloc);
-    REDISMODULE_GET_API(Strdup);
-    REDISMODULE_GET_API(CreateCommand);
-    REDISMODULE_GET_API(SetModuleAttribs);
-    REDISMODULE_GET_API(IsModuleNameBusy);
-    REDISMODULE_GET_API(WrongArity);
-    REDISMODULE_GET_API(ReplyWithLongLong);
-    REDISMODULE_GET_API(ReplyWithError);
-    REDISMODULE_GET_API(ReplyWithSimpleString);
-    REDISMODULE_GET_API(ReplyWithArray);
-    REDISMODULE_GET_API(ReplyWithNullArray);
-    REDISMODULE_GET_API(ReplyWithEmptyArray);
-    REDISMODULE_GET_API(ReplySetArrayLength);
-    REDISMODULE_GET_API(ReplyWithStringBuffer);
-    REDISMODULE_GET_API(ReplyWithCString);
-    REDISMODULE_GET_API(ReplyWithString);
-    REDISMODULE_GET_API(ReplyWithEmptyString);
-    REDISMODULE_GET_API(ReplyWithVerbatimString);
-    REDISMODULE_GET_API(ReplyWithNull);
-    REDISMODULE_GET_API(ReplyWithCallReply);
-    REDISMODULE_GET_API(ReplyWithDouble);
-    REDISMODULE_GET_API(ReplyWithLongDouble);
-    REDISMODULE_GET_API(GetSelectedDb);
-    REDISMODULE_GET_API(SelectDb);
-    REDISMODULE_GET_API(OpenKey);
-    REDISMODULE_GET_API(CloseKey);
-    REDISMODULE_GET_API(KeyType);
-    REDISMODULE_GET_API(ValueLength);
-    REDISMODULE_GET_API(ListPush);
-    REDISMODULE_GET_API(ListPop);
-    REDISMODULE_GET_API(StringToLongLong);
-    REDISMODULE_GET_API(StringToDouble);
-    REDISMODULE_GET_API(StringToLongDouble);
-    REDISMODULE_GET_API(StringToStreamID);
-    REDISMODULE_GET_API(Call);
-    REDISMODULE_GET_API(CallReplyProto);
-    REDISMODULE_GET_API(FreeCallReply);
-    REDISMODULE_GET_API(CallReplyInteger);
-    REDISMODULE_GET_API(CallReplyType);
-    REDISMODULE_GET_API(CallReplyLength);
-    REDISMODULE_GET_API(CallReplyArrayElement);
-    REDISMODULE_GET_API(CallReplyStringPtr);
-    REDISMODULE_GET_API(CreateStringFromCallReply);
-    REDISMODULE_GET_API(CreateString);
-    REDISMODULE_GET_API(CreateStringFromLongLong);
-    REDISMODULE_GET_API(CreateStringFromDouble);
-    REDISMODULE_GET_API(CreateStringFromLongDouble);
-    REDISMODULE_GET_API(CreateStringFromString);
-    REDISMODULE_GET_API(CreateStringFromStreamID);
-    REDISMODULE_GET_API(CreateStringPrintf);
-    REDISMODULE_GET_API(FreeString);
-    REDISMODULE_GET_API(StringPtrLen);
-    REDISMODULE_GET_API(AutoMemory);
-    REDISMODULE_GET_API(Replicate);
-    REDISMODULE_GET_API(ReplicateVerbatim);
-    REDISMODULE_GET_API(DeleteKey);
-    REDISMODULE_GET_API(UnlinkKey);
-    REDISMODULE_GET_API(StringSet);
-    REDISMODULE_GET_API(StringDMA);
-    REDISMODULE_GET_API(StringTruncate);
-    REDISMODULE_GET_API(GetExpire);
-    REDISMODULE_GET_API(SetExpire);
-    REDISMODULE_GET_API(GetAbsExpire);
-    REDISMODULE_GET_API(SetAbsExpire);
-    REDISMODULE_GET_API(ResetDataset);
-    REDISMODULE_GET_API(DbSize);
-    REDISMODULE_GET_API(RandomKey);
-    REDISMODULE_GET_API(ZsetAdd);
-    REDISMODULE_GET_API(ZsetIncrby);
-    REDISMODULE_GET_API(ZsetScore);
-    REDISMODULE_GET_API(ZsetRem);
-    REDISMODULE_GET_API(ZsetRangeStop);
-    REDISMODULE_GET_API(ZsetFirstInScoreRange);
-    REDISMODULE_GET_API(ZsetLastInScoreRange);
-    REDISMODULE_GET_API(ZsetFirstInLexRange);
-    REDISMODULE_GET_API(ZsetLastInLexRange);
-    REDISMODULE_GET_API(ZsetRangeCurrentElement);
-    REDISMODULE_GET_API(ZsetRangeNext);
-    REDISMODULE_GET_API(ZsetRangePrev);
-    REDISMODULE_GET_API(ZsetRangeEndReached);
-    REDISMODULE_GET_API(HashSet);
-    REDISMODULE_GET_API(HashGet);
-    REDISMODULE_GET_API(StreamAdd);
-    REDISMODULE_GET_API(StreamDelete);
-    REDISMODULE_GET_API(StreamIteratorStart);
-    REDISMODULE_GET_API(StreamIteratorStop);
-    REDISMODULE_GET_API(StreamIteratorNextID);
-    REDISMODULE_GET_API(StreamIteratorNextField);
-    REDISMODULE_GET_API(StreamIteratorDelete);
-    REDISMODULE_GET_API(StreamTrimByLength);
-    REDISMODULE_GET_API(StreamTrimByID);
-    REDISMODULE_GET_API(IsKeysPositionRequest);
-    REDISMODULE_GET_API(KeyAtPos);
-    REDISMODULE_GET_API(GetClientId);
-    REDISMODULE_GET_API(GetClientUserNameById);
-    REDISMODULE_GET_API(GetContextFlags);
-    REDISMODULE_GET_API(AvoidReplicaTraffic);
-    REDISMODULE_GET_API(PoolAlloc);
-    REDISMODULE_GET_API(CreateDataType);
-    REDISMODULE_GET_API(ModuleTypeSetValue);
-    REDISMODULE_GET_API(ModuleTypeReplaceValue);
-    REDISMODULE_GET_API(ModuleTypeGetType);
-    REDISMODULE_GET_API(ModuleTypeGetValue);
-    REDISMODULE_GET_API(IsIOError);
-    REDISMODULE_GET_API(SetModuleOptions);
-    REDISMODULE_GET_API(SignalModifiedKey);
-    REDISMODULE_GET_API(SaveUnsigned);
-    REDISMODULE_GET_API(LoadUnsigned);
-    REDISMODULE_GET_API(SaveSigned);
-    REDISMODULE_GET_API(LoadSigned);
-    REDISMODULE_GET_API(SaveString);
-    REDISMODULE_GET_API(SaveStringBuffer);
-    REDISMODULE_GET_API(LoadString);
-    REDISMODULE_GET_API(LoadStringBuffer);
-    REDISMODULE_GET_API(SaveDouble);
-    REDISMODULE_GET_API(LoadDouble);
-    REDISMODULE_GET_API(SaveFloat);
-    REDISMODULE_GET_API(LoadFloat);
-    REDISMODULE_GET_API(SaveLongDouble);
-    REDISMODULE_GET_API(LoadLongDouble);
-    REDISMODULE_GET_API(SaveDataTypeToString);
-    REDISMODULE_GET_API(LoadDataTypeFromString);
-    REDISMODULE_GET_API(EmitAOF);
-    REDISMODULE_GET_API(Log);
-    REDISMODULE_GET_API(LogIOError);
-    REDISMODULE_GET_API(_Assert);
-    REDISMODULE_GET_API(LatencyAddSample);
-    REDISMODULE_GET_API(StringAppendBuffer);
-    REDISMODULE_GET_API(RetainString);
-    REDISMODULE_GET_API(HoldString);
-    REDISMODULE_GET_API(StringCompare);
-    REDISMODULE_GET_API(GetContextFromIO);
-    REDISMODULE_GET_API(GetKeyNameFromIO);
-    REDISMODULE_GET_API(GetKeyNameFromModuleKey);
-    REDISMODULE_GET_API(Milliseconds);
-    REDISMODULE_GET_API(DigestAddStringBuffer);
-    REDISMODULE_GET_API(DigestAddLongLong);
-    REDISMODULE_GET_API(DigestEndSequence);
-    REDISMODULE_GET_API(CreateDict);
-    REDISMODULE_GET_API(FreeDict);
-    REDISMODULE_GET_API(DictSize);
-    REDISMODULE_GET_API(DictSetC);
-    REDISMODULE_GET_API(DictReplaceC);
-    REDISMODULE_GET_API(DictSet);
-    REDISMODULE_GET_API(DictReplace);
-    REDISMODULE_GET_API(DictGetC);
-    REDISMODULE_GET_API(DictGet);
-    REDISMODULE_GET_API(DictDelC);
-    REDISMODULE_GET_API(DictDel);
-    REDISMODULE_GET_API(DictIteratorStartC);
-    REDISMODULE_GET_API(DictIteratorStart);
-    REDISMODULE_GET_API(DictIteratorStop);
-    REDISMODULE_GET_API(DictIteratorReseekC);
-    REDISMODULE_GET_API(DictIteratorReseek);
-    REDISMODULE_GET_API(DictNextC);
-    REDISMODULE_GET_API(DictPrevC);
-    REDISMODULE_GET_API(DictNext);
-    REDISMODULE_GET_API(DictPrev);
-    REDISMODULE_GET_API(DictCompare);
-    REDISMODULE_GET_API(DictCompareC);
-    REDISMODULE_GET_API(RegisterInfoFunc);
-    REDISMODULE_GET_API(InfoAddSection);
-    REDISMODULE_GET_API(InfoBeginDictField);
-    REDISMODULE_GET_API(InfoEndDictField);
-    REDISMODULE_GET_API(InfoAddFieldString);
-    REDISMODULE_GET_API(InfoAddFieldCString);
-    REDISMODULE_GET_API(InfoAddFieldDouble);
-    REDISMODULE_GET_API(InfoAddFieldLongLong);
-    REDISMODULE_GET_API(InfoAddFieldULongLong);
-    REDISMODULE_GET_API(GetServerInfo);
-    REDISMODULE_GET_API(FreeServerInfo);
-    REDISMODULE_GET_API(ServerInfoGetField);
-    REDISMODULE_GET_API(ServerInfoGetFieldC);
-    REDISMODULE_GET_API(ServerInfoGetFieldSigned);
-    REDISMODULE_GET_API(ServerInfoGetFieldUnsigned);
-    REDISMODULE_GET_API(ServerInfoGetFieldDouble);
-    REDISMODULE_GET_API(GetClientInfoById);
-    REDISMODULE_GET_API(PublishMessage);
-    REDISMODULE_GET_API(SubscribeToServerEvent);
-    REDISMODULE_GET_API(SetLRU);
-    REDISMODULE_GET_API(GetLRU);
-    REDISMODULE_GET_API(SetLFU);
-    REDISMODULE_GET_API(GetLFU);
-    REDISMODULE_GET_API(BlockClientOnKeys);
-    REDISMODULE_GET_API(SignalKeyAsReady);
-    REDISMODULE_GET_API(GetBlockedClientReadyKey);
-    REDISMODULE_GET_API(ScanCursorCreate);
-    REDISMODULE_GET_API(ScanCursorRestart);
-    REDISMODULE_GET_API(ScanCursorDestroy);
-    REDISMODULE_GET_API(Scan);
-    REDISMODULE_GET_API(ScanKey);
-    REDISMODULE_GET_API(GetContextFlagsAll);
-    REDISMODULE_GET_API(GetKeyspaceNotificationFlagsAll);
-    REDISMODULE_GET_API(IsSubEventSupported);
-    REDISMODULE_GET_API(GetServerVersion);
-    REDISMODULE_GET_API(GetTypeMethodVersion);
-
-#ifdef REDISMODULE_EXPERIMENTAL_API
-    REDISMODULE_GET_API(GetThreadSafeContext);
-    REDISMODULE_GET_API(GetDetachedThreadSafeContext);
-    REDISMODULE_GET_API(FreeThreadSafeContext);
-    REDISMODULE_GET_API(ThreadSafeContextLock);
-    REDISMODULE_GET_API(ThreadSafeContextTryLock);
-    REDISMODULE_GET_API(ThreadSafeContextUnlock);
-    REDISMODULE_GET_API(BlockClient);
-    REDISMODULE_GET_API(UnblockClient);
-    REDISMODULE_GET_API(IsBlockedReplyRequest);
-    REDISMODULE_GET_API(IsBlockedTimeoutRequest);
-    REDISMODULE_GET_API(GetBlockedClientPrivateData);
-    REDISMODULE_GET_API(GetBlockedClientHandle);
-    REDISMODULE_GET_API(AbortBlock);
-    REDISMODULE_GET_API(BlockedClientMeasureTimeStart);
-    REDISMODULE_GET_API(BlockedClientMeasureTimeEnd);
-    REDISMODULE_GET_API(SetDisconnectCallback);
-    REDISMODULE_GET_API(SubscribeToKeyspaceEvents);
-    REDISMODULE_GET_API(NotifyKeyspaceEvent);
-    REDISMODULE_GET_API(GetNotifyKeyspaceEvents);
-    REDISMODULE_GET_API(BlockedClientDisconnected);
-    REDISMODULE_GET_API(RegisterClusterMessageReceiver);
-    REDISMODULE_GET_API(SendClusterMessage);
-    REDISMODULE_GET_API(GetClusterNodeInfo);
-    REDISMODULE_GET_API(GetClusterNodesList);
-    REDISMODULE_GET_API(FreeClusterNodesList);
-    REDISMODULE_GET_API(CreateTimer);
-    REDISMODULE_GET_API(StopTimer);
-    REDISMODULE_GET_API(GetTimerInfo);
-    REDISMODULE_GET_API(GetMyClusterID);
-    REDISMODULE_GET_API(GetClusterSize);
-    REDISMODULE_GET_API(GetRandomBytes);
-    REDISMODULE_GET_API(GetRandomHexChars);
-    REDISMODULE_GET_API(SetClusterFlags);
-    REDISMODULE_GET_API(ExportSharedAPI);
-    REDISMODULE_GET_API(GetSharedAPI);
-    REDISMODULE_GET_API(RegisterCommandFilter);
-    REDISMODULE_GET_API(UnregisterCommandFilter);
-    REDISMODULE_GET_API(CommandFilterArgsCount);
-    REDISMODULE_GET_API(CommandFilterArgGet);
-    REDISMODULE_GET_API(CommandFilterArgInsert);
-    REDISMODULE_GET_API(CommandFilterArgReplace);
-    REDISMODULE_GET_API(CommandFilterArgDelete);
-    REDISMODULE_GET_API(Fork);
-    REDISMODULE_GET_API(SendChildHeartbeat);
-    REDISMODULE_GET_API(ExitFromChild);
-    REDISMODULE_GET_API(KillForkChild);
-    REDISMODULE_GET_API(GetUsedMemoryRatio);
-    REDISMODULE_GET_API(MallocSize);
-    REDISMODULE_GET_API(CreateModuleUser);
-    REDISMODULE_GET_API(FreeModuleUser);
-    REDISMODULE_GET_API(SetModuleUserACL);
-    REDISMODULE_GET_API(DeauthenticateAndCloseClient);
-    REDISMODULE_GET_API(AuthenticateClientWithACLUser);
-    REDISMODULE_GET_API(AuthenticateClientWithUser);
-    REDISMODULE_GET_API(GetClientCertificate);
-    REDISMODULE_GET_API(GetCommandKeys);
-    REDISMODULE_GET_API(GetCurrentCommandName);
-    REDISMODULE_GET_API(RegisterDefragFunc);
-    REDISMODULE_GET_API(DefragAlloc);
-    REDISMODULE_GET_API(DefragRedisModuleString);
-    REDISMODULE_GET_API(DefragShouldStop);
-    REDISMODULE_GET_API(DefragCursorSet);
-    REDISMODULE_GET_API(DefragCursorGet);
-#endif
-
-    if (RedisModule_IsModuleNameBusy && RedisModule_IsModuleNameBusy(name)) return REDISMODULE_ERR;
-    RedisModule_SetModuleAttribs(ctx,name,ver,apiver);
-    return REDISMODULE_OK;
-}
-
-#define RedisModule_Assert(_e) ((_e)?(void)0 : (RedisModule__Assert(#_e,__FILE__,__LINE__),exit(1)))
-
-#define RMAPI_FUNC_SUPPORTED(func) (func != NULL)
-
-#else
-
-/* Things only defined for the modules core, not exported to modules
- * including this file. */
-#define RedisModuleString robj
-
-#endif /* REDISMODULE_CORE */
-#endif /* REDISMODULE_H */
diff --git a/redis-stable/src/release.c b/redis-stable/src/release.c
deleted file mode 100644
index e0bd018f..00000000
--- a/redis-stable/src/release.c
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* Every time the Redis Git SHA1 or Dirty status changes only this small
- * file is recompiled, as we access this information in all the other
- * files using this functions. */
-
-#include <string.h>
-#include <stdio.h>
-
-#include "release.h"
-#include "version.h"
-#include "crc64.h"
-
-char *redisGitSHA1(void) {
-    return REDIS_GIT_SHA1;
-}
-
-char *redisGitDirty(void) {
-    return REDIS_GIT_DIRTY;
-}
-
-uint64_t redisBuildId(void) {
-    char *buildid = REDIS_VERSION REDIS_BUILD_ID REDIS_GIT_DIRTY REDIS_GIT_SHA1;
-
-    return crc64(0,(unsigned char*)buildid,strlen(buildid));
-}
-
-/* Return a cached value of the build string in order to avoid recomputing
- * and converting it in hex every time: this string is shown in the INFO
- * output that should be fast. */
-char *redisBuildIdString(void) {
-    static char buf[32];
-    static int cached = 0;
-    if (!cached) {
-        snprintf(buf,sizeof(buf),"%llx",(unsigned long long) redisBuildId());
-        cached = 1;
-    }
-    return buf;
-}
diff --git a/redis-stable/src/replication.c b/redis-stable/src/replication.c
deleted file mode 100644
index 932ce1de..00000000
--- a/redis-stable/src/replication.c
+++ /dev/null
@@ -1,3790 +0,0 @@
-/* Asynchronous replication implementation.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "server.h"
-#include "cluster.h"
-#include "bio.h"
-
-#include <sys/time.h>
-#include <unistd.h>
-#include <fcntl.h>
-#include <sys/socket.h>
-#include <sys/stat.h>
-
-void replicationDiscardCachedMaster(void);
-void replicationResurrectCachedMaster(connection *conn);
-void replicationSendAck(void);
-void putSlaveOnline(client *slave);
-int cancelReplicationHandshake(int reconnect);
-
-/* We take a global flag to remember if this instance generated an RDB
- * because of replication, so that we can remove the RDB file in case
- * the instance is configured to have no persistence. */
-int RDBGeneratedByReplication = 0;
-
-/* --------------------------- Utility functions ---------------------------- */
-
-/* Return the pointer to a string representing the slave ip:listening_port
- * pair. Mostly useful for logging, since we want to log a slave using its
- * IP address and its listening port which is more clear for the user, for
- * example: "Closing connection with replica 10.1.2.3:6380". */
-char *replicationGetSlaveName(client *c) {
-    static char buf[NET_HOST_PORT_STR_LEN];
-    char ip[NET_IP_STR_LEN];
-
-    ip[0] = '\0';
-    buf[0] = '\0';
-    if (c->slave_addr ||
-        connPeerToString(c->conn,ip,sizeof(ip),NULL) != -1)
-    {
-        char *addr = c->slave_addr ? c->slave_addr : ip;
-        if (c->slave_listening_port)
-            anetFormatAddr(buf,sizeof(buf),addr,c->slave_listening_port);
-        else
-            snprintf(buf,sizeof(buf),"%s:<unknown-replica-port>",addr);
-    } else {
-        snprintf(buf,sizeof(buf),"client id #%llu",
-            (unsigned long long) c->id);
-    }
-    return buf;
-}
-
-/* Plain unlink() can block for quite some time in order to actually apply
- * the file deletion to the filesystem. This call removes the file in a
- * background thread instead. We actually just do close() in the thread,
- * by using the fact that if there is another instance of the same file open,
- * the foreground unlink() will only remove the fs name, and deleting the
- * file's storage space will only happen once the last reference is lost. */
-int bg_unlink(const char *filename) {
-    int fd = open(filename,O_RDONLY|O_NONBLOCK);
-    if (fd == -1) {
-        /* Can't open the file? Fall back to unlinking in the main thread. */
-        return unlink(filename);
-    } else {
-        /* The following unlink() removes the name but doesn't free the
-         * file contents because a process still has it open. */
-        int retval = unlink(filename);
-        if (retval == -1) {
-            /* If we got an unlink error, we just return it, closing the
-             * new reference we have to the file. */
-            int old_errno = errno;
-            close(fd);  /* This would overwrite our errno. So we saved it. */
-            errno = old_errno;
-            return -1;
-        }
-        bioCreateCloseJob(fd);
-        return 0; /* Success. */
-    }
-}
-
-/* ---------------------------------- MASTER -------------------------------- */
-
-void createReplicationBacklog(void) {
-    serverAssert(server.repl_backlog == NULL);
-    server.repl_backlog = zmalloc(server.repl_backlog_size);
-    server.repl_backlog_histlen = 0;
-    server.repl_backlog_idx = 0;
-
-    /* We don't have any data inside our buffer, but virtually the first
-     * byte we have is the next byte that will be generated for the
-     * replication stream. */
-    server.repl_backlog_off = server.master_repl_offset+1;
-}
-
-/* This function is called when the user modifies the replication backlog
- * size at runtime. It is up to the function to both update the
- * server.repl_backlog_size and to resize the buffer and setup it so that
- * it contains the same data as the previous one (possibly less data, but
- * the most recent bytes, or the same data and more free space in case the
- * buffer is enlarged). */
-void resizeReplicationBacklog(long long newsize) {
-    if (newsize < CONFIG_REPL_BACKLOG_MIN_SIZE)
-        newsize = CONFIG_REPL_BACKLOG_MIN_SIZE;
-    if (server.repl_backlog_size == newsize) return;
-
-    server.repl_backlog_size = newsize;
-    if (server.repl_backlog != NULL) {
-        /* What we actually do is to flush the old buffer and realloc a new
-         * empty one. It will refill with new data incrementally.
-         * The reason is that copying a few gigabytes adds latency and even
-         * worse often we need to alloc additional space before freeing the
-         * old buffer. */
-        zfree(server.repl_backlog);
-        server.repl_backlog = zmalloc(server.repl_backlog_size);
-        server.repl_backlog_histlen = 0;
-        server.repl_backlog_idx = 0;
-        /* Next byte we have is... the next since the buffer is empty. */
-        server.repl_backlog_off = server.master_repl_offset+1;
-    }
-}
-
-void freeReplicationBacklog(void) {
-    serverAssert(listLength(server.slaves) == 0);
-    zfree(server.repl_backlog);
-    server.repl_backlog = NULL;
-}
-
-/* Add data to the replication backlog.
- * This function also increments the global replication offset stored at
- * server.master_repl_offset, because there is no case where we want to feed
- * the backlog without incrementing the offset. */
-void feedReplicationBacklog(void *ptr, size_t len) {
-    unsigned char *p = ptr;
-
-    server.master_repl_offset += len;
-
-    /* This is a circular buffer, so write as much data we can at every
-     * iteration and rewind the "idx" index if we reach the limit. */
-    while(len) {
-        size_t thislen = server.repl_backlog_size - server.repl_backlog_idx;
-        if (thislen > len) thislen = len;
-        memcpy(server.repl_backlog+server.repl_backlog_idx,p,thislen);
-        server.repl_backlog_idx += thislen;
-        if (server.repl_backlog_idx == server.repl_backlog_size)
-            server.repl_backlog_idx = 0;
-        len -= thislen;
-        p += thislen;
-        server.repl_backlog_histlen += thislen;
-    }
-    if (server.repl_backlog_histlen > server.repl_backlog_size)
-        server.repl_backlog_histlen = server.repl_backlog_size;
-    /* Set the offset of the first byte we have in the backlog. */
-    server.repl_backlog_off = server.master_repl_offset -
-                              server.repl_backlog_histlen + 1;
-}
-
-/* Wrapper for feedReplicationBacklog() that takes Redis string objects
- * as input. */
-void feedReplicationBacklogWithObject(robj *o) {
-    char llstr[LONG_STR_SIZE];
-    void *p;
-    size_t len;
-
-    if (o->encoding == OBJ_ENCODING_INT) {
-        len = ll2string(llstr,sizeof(llstr),(long)o->ptr);
-        p = llstr;
-    } else {
-        len = sdslen(o->ptr);
-        p = o->ptr;
-    }
-    feedReplicationBacklog(p,len);
-}
-
-int canFeedReplicaReplBuffer(client *replica) {
-    /* Don't feed replicas that only want the RDB. */
-    if (replica->flags & CLIENT_REPL_RDBONLY) return 0;
-
-    /* Don't feed replicas that are still waiting for BGSAVE to start. */
-    if (replica->replstate == SLAVE_STATE_WAIT_BGSAVE_START) return 0;
-
-    return 1;
-}
-
-/* Propagate write commands to slaves, and populate the replication backlog
- * as well. This function is used if the instance is a master: we use
- * the commands received by our clients in order to create the replication
- * stream. Instead if the instance is a slave and has sub-slaves attached,
- * we use replicationFeedSlavesFromMasterStream() */
-void replicationFeedSlaves(list *slaves, int dictid, robj **argv, int argc) {
-    listNode *ln;
-    listIter li;
-    int j, len;
-    char llstr[LONG_STR_SIZE];
-
-    /* If the instance is not a top level master, return ASAP: we'll just proxy
-     * the stream of data we receive from our master instead, in order to
-     * propagate *identical* replication stream. In this way this slave can
-     * advertise the same replication ID as the master (since it shares the
-     * master replication history and has the same backlog and offsets). */
-    if (server.masterhost != NULL) return;
-
-    /* If there aren't slaves, and there is no backlog buffer to populate,
-     * we can return ASAP. */
-    if (server.repl_backlog == NULL && listLength(slaves) == 0) return;
-
-    /* We can't have slaves attached and no backlog. */
-    serverAssert(!(listLength(slaves) != 0 && server.repl_backlog == NULL));
-
-    /* Send SELECT command to every slave if needed. */
-    if (server.slaveseldb != dictid) {
-        robj *selectcmd;
-
-        /* For a few DBs we have pre-computed SELECT command. */
-        if (dictid >= 0 && dictid < PROTO_SHARED_SELECT_CMDS) {
-            selectcmd = shared.select[dictid];
-        } else {
-            int dictid_len;
-
-            dictid_len = ll2string(llstr,sizeof(llstr),dictid);
-            selectcmd = createObject(OBJ_STRING,
-                sdscatprintf(sdsempty(),
-                "*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
-                dictid_len, llstr));
-        }
-
-        /* Add the SELECT command into the backlog. */
-        if (server.repl_backlog) feedReplicationBacklogWithObject(selectcmd);
-
-        /* Send it to slaves. */
-        listRewind(slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-
-            if (!canFeedReplicaReplBuffer(slave)) continue;
-            addReply(slave,selectcmd);
-        }
-
-        if (dictid < 0 || dictid >= PROTO_SHARED_SELECT_CMDS)
-            decrRefCount(selectcmd);
-    }
-    server.slaveseldb = dictid;
-
-    /* Write the command to the replication backlog if any. */
-    if (server.repl_backlog) {
-        char aux[LONG_STR_SIZE+3];
-
-        /* Add the multi bulk reply length. */
-        aux[0] = '*';
-        len = ll2string(aux+1,sizeof(aux)-1,argc);
-        aux[len+1] = '\r';
-        aux[len+2] = '\n';
-        feedReplicationBacklog(aux,len+3);
-
-        for (j = 0; j < argc; j++) {
-            long objlen = stringObjectLen(argv[j]);
-
-            /* We need to feed the buffer with the object as a bulk reply
-             * not just as a plain string, so create the $..CRLF payload len
-             * and add the final CRLF */
-            aux[0] = '$';
-            len = ll2string(aux+1,sizeof(aux)-1,objlen);
-            aux[len+1] = '\r';
-            aux[len+2] = '\n';
-            feedReplicationBacklog(aux,len+3);
-            feedReplicationBacklogWithObject(argv[j]);
-            feedReplicationBacklog(aux+len+1,2);
-        }
-    }
-
-    /* Write the command to every slave. */
-    listRewind(slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-
-        if (!canFeedReplicaReplBuffer(slave)) continue;
-
-        /* Feed slaves that are waiting for the initial SYNC (so these commands
-         * are queued in the output buffer until the initial SYNC completes),
-         * or are already in sync with the master. */
-
-        /* Add the multi bulk length. */
-        addReplyArrayLen(slave,argc);
-
-        /* Finally any additional argument that was not stored inside the
-         * static buffer if any (from j to argc). */
-        for (j = 0; j < argc; j++)
-            addReplyBulk(slave,argv[j]);
-    }
-}
-
-/* This is a debugging function that gets called when we detect something
- * wrong with the replication protocol: the goal is to peek into the
- * replication backlog and show a few final bytes to make simpler to
- * guess what kind of bug it could be. */
-void showLatestBacklog(void) {
-    if (server.repl_backlog == NULL) return;
-
-    long long dumplen = 256;
-    if (server.repl_backlog_histlen < dumplen)
-        dumplen = server.repl_backlog_histlen;
-
-    /* Identify the first byte to dump. */
-    long long idx =
-      (server.repl_backlog_idx + (server.repl_backlog_size - dumplen)) %
-       server.repl_backlog_size;
-
-    /* Scan the circular buffer to collect 'dumplen' bytes. */
-    sds dump = sdsempty();
-    while(dumplen) {
-        long long thislen =
-            ((server.repl_backlog_size - idx) < dumplen) ?
-            (server.repl_backlog_size - idx) : dumplen;
-
-        dump = sdscatrepr(dump,server.repl_backlog+idx,thislen);
-        dumplen -= thislen;
-        idx = 0;
-    }
-
-    /* Finally log such bytes: this is vital debugging info to
-     * understand what happened. */
-    serverLog(LL_WARNING,"Latest backlog is: '%s'", dump);
-    sdsfree(dump);
-}
-
-/* This function is used in order to proxy what we receive from our master
- * to our sub-slaves. */
-#include <ctype.h>
-void replicationFeedSlavesFromMasterStream(list *slaves, char *buf, size_t buflen) {
-    listNode *ln;
-    listIter li;
-
-    /* Debugging: this is handy to see the stream sent from master
-     * to slaves. Disabled with if(0). */
-    if (0) {
-        printf("%zu:",buflen);
-        for (size_t j = 0; j < buflen; j++) {
-            printf("%c", isprint(buf[j]) ? buf[j] : '.');
-        }
-        printf("\n");
-    }
-
-    if (server.repl_backlog) feedReplicationBacklog(buf,buflen);
-    listRewind(slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-
-        if (!canFeedReplicaReplBuffer(slave)) continue;
-        addReplyProto(slave,buf,buflen);
-    }
-}
-
-void replicationFeedMonitors(client *c, list *monitors, int dictid, robj **argv, int argc) {
-    if (!(listLength(server.monitors) && !server.loading)) return;
-    listNode *ln;
-    listIter li;
-    int j;
-    sds cmdrepr = sdsnew("+");
-    robj *cmdobj;
-    struct timeval tv;
-
-    gettimeofday(&tv,NULL);
-    cmdrepr = sdscatprintf(cmdrepr,"%ld.%06ld ",(long)tv.tv_sec,(long)tv.tv_usec);
-    if (c->flags & CLIENT_LUA) {
-        cmdrepr = sdscatprintf(cmdrepr,"[%d lua] ",dictid);
-    } else if (c->flags & CLIENT_UNIX_SOCKET) {
-        cmdrepr = sdscatprintf(cmdrepr,"[%d unix:%s] ",dictid,server.unixsocket);
-    } else {
-        cmdrepr = sdscatprintf(cmdrepr,"[%d %s] ",dictid,getClientPeerId(c));
-    }
-
-    for (j = 0; j < argc; j++) {
-        if (argv[j]->encoding == OBJ_ENCODING_INT) {
-            cmdrepr = sdscatprintf(cmdrepr, "\"%ld\"", (long)argv[j]->ptr);
-        } else {
-            cmdrepr = sdscatrepr(cmdrepr,(char*)argv[j]->ptr,
-                        sdslen(argv[j]->ptr));
-        }
-        if (j != argc-1)
-            cmdrepr = sdscatlen(cmdrepr," ",1);
-    }
-    cmdrepr = sdscatlen(cmdrepr,"\r\n",2);
-    cmdobj = createObject(OBJ_STRING,cmdrepr);
-
-    listRewind(monitors,&li);
-    while((ln = listNext(&li))) {
-        client *monitor = ln->value;
-        addReply(monitor,cmdobj);
-    }
-    decrRefCount(cmdobj);
-}
-
-/* Feed the slave 'c' with the replication backlog starting from the
- * specified 'offset' up to the end of the backlog. */
-long long addReplyReplicationBacklog(client *c, long long offset) {
-    long long j, skip, len;
-
-    serverLog(LL_DEBUG, "[PSYNC] Replica request offset: %lld", offset);
-
-    if (server.repl_backlog_histlen == 0) {
-        serverLog(LL_DEBUG, "[PSYNC] Backlog history len is zero");
-        return 0;
-    }
-
-    serverLog(LL_DEBUG, "[PSYNC] Backlog size: %lld",
-             server.repl_backlog_size);
-    serverLog(LL_DEBUG, "[PSYNC] First byte: %lld",
-             server.repl_backlog_off);
-    serverLog(LL_DEBUG, "[PSYNC] History len: %lld",
-             server.repl_backlog_histlen);
-    serverLog(LL_DEBUG, "[PSYNC] Current index: %lld",
-             server.repl_backlog_idx);
-
-    /* Compute the amount of bytes we need to discard. */
-    skip = offset - server.repl_backlog_off;
-    serverLog(LL_DEBUG, "[PSYNC] Skipping: %lld", skip);
-
-    /* Point j to the oldest byte, that is actually our
-     * server.repl_backlog_off byte. */
-    j = (server.repl_backlog_idx +
-        (server.repl_backlog_size-server.repl_backlog_histlen)) %
-        server.repl_backlog_size;
-    serverLog(LL_DEBUG, "[PSYNC] Index of first byte: %lld", j);
-
-    /* Discard the amount of data to seek to the specified 'offset'. */
-    j = (j + skip) % server.repl_backlog_size;
-
-    /* Feed slave with data. Since it is a circular buffer we have to
-     * split the reply in two parts if we are cross-boundary. */
-    len = server.repl_backlog_histlen - skip;
-    serverLog(LL_DEBUG, "[PSYNC] Reply total length: %lld", len);
-    while(len) {
-        long long thislen =
-            ((server.repl_backlog_size - j) < len) ?
-            (server.repl_backlog_size - j) : len;
-
-        serverLog(LL_DEBUG, "[PSYNC] addReply() length: %lld", thislen);
-        addReplySds(c,sdsnewlen(server.repl_backlog + j, thislen));
-        len -= thislen;
-        j = 0;
-    }
-    return server.repl_backlog_histlen - skip;
-}
-
-/* Return the offset to provide as reply to the PSYNC command received
- * from the slave. The returned value is only valid immediately after
- * the BGSAVE process started and before executing any other command
- * from clients. */
-long long getPsyncInitialOffset(void) {
-    return server.master_repl_offset;
-}
-
-/* Send a FULLRESYNC reply in the specific case of a full resynchronization,
- * as a side effect setup the slave for a full sync in different ways:
- *
- * 1) Remember, into the slave client structure, the replication offset
- *    we sent here, so that if new slaves will later attach to the same
- *    background RDB saving process (by duplicating this client output
- *    buffer), we can get the right offset from this slave.
- * 2) Set the replication state of the slave to WAIT_BGSAVE_END so that
- *    we start accumulating differences from this point.
- * 3) Force the replication stream to re-emit a SELECT statement so
- *    the new slave incremental differences will start selecting the
- *    right database number.
- *
- * Normally this function should be called immediately after a successful
- * BGSAVE for replication was started, or when there is one already in
- * progress that we attached our slave to. */
-int replicationSetupSlaveForFullResync(client *slave, long long offset) {
-    char buf[128];
-    int buflen;
-
-    slave->psync_initial_offset = offset;
-    slave->replstate = SLAVE_STATE_WAIT_BGSAVE_END;
-    /* We are going to accumulate the incremental changes for this
-     * slave as well. Set slaveseldb to -1 in order to force to re-emit
-     * a SELECT statement in the replication stream. */
-    server.slaveseldb = -1;
-
-    /* Don't send this reply to slaves that approached us with
-     * the old SYNC command. */
-    if (!(slave->flags & CLIENT_PRE_PSYNC)) {
-        buflen = snprintf(buf,sizeof(buf),"+FULLRESYNC %s %lld\r\n",
-                          server.replid,offset);
-        if (connWrite(slave->conn,buf,buflen) != buflen) {
-            freeClientAsync(slave);
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* This function handles the PSYNC command from the point of view of a
- * master receiving a request for partial resynchronization.
- *
- * On success return C_OK, otherwise C_ERR is returned and we proceed
- * with the usual full resync. */
-int masterTryPartialResynchronization(client *c) {
-    long long psync_offset, psync_len;
-    char *master_replid = c->argv[1]->ptr;
-    char buf[128];
-    int buflen;
-
-    /* Parse the replication offset asked by the slave. Go to full sync
-     * on parse error: this should never happen but we try to handle
-     * it in a robust way compared to aborting. */
-    if (getLongLongFromObjectOrReply(c,c->argv[2],&psync_offset,NULL) !=
-       C_OK) goto need_full_resync;
-
-    /* Is the replication ID of this master the same advertised by the wannabe
-     * slave via PSYNC? If the replication ID changed this master has a
-     * different replication history, and there is no way to continue.
-     *
-     * Note that there are two potentially valid replication IDs: the ID1
-     * and the ID2. The ID2 however is only valid up to a specific offset. */
-    if (strcasecmp(master_replid, server.replid) &&
-        (strcasecmp(master_replid, server.replid2) ||
-         psync_offset > server.second_replid_offset))
-    {
-        /* Replid "?" is used by slaves that want to force a full resync. */
-        if (master_replid[0] != '?') {
-            if (strcasecmp(master_replid, server.replid) &&
-                strcasecmp(master_replid, server.replid2))
-            {
-                serverLog(LL_NOTICE,"Partial resynchronization not accepted: "
-                    "Replication ID mismatch (Replica asked for '%s', my "
-                    "replication IDs are '%s' and '%s')",
-                    master_replid, server.replid, server.replid2);
-            } else {
-                serverLog(LL_NOTICE,"Partial resynchronization not accepted: "
-                    "Requested offset for second ID was %lld, but I can reply "
-                    "up to %lld", psync_offset, server.second_replid_offset);
-            }
-        } else {
-            serverLog(LL_NOTICE,"Full resync requested by replica %s",
-                replicationGetSlaveName(c));
-        }
-        goto need_full_resync;
-    }
-
-    /* We still have the data our slave is asking for? */
-    if (!server.repl_backlog ||
-        psync_offset < server.repl_backlog_off ||
-        psync_offset > (server.repl_backlog_off + server.repl_backlog_histlen))
-    {
-        serverLog(LL_NOTICE,
-            "Unable to partial resync with replica %s for lack of backlog (Replica request was: %lld).", replicationGetSlaveName(c), psync_offset);
-        if (psync_offset > server.master_repl_offset) {
-            serverLog(LL_WARNING,
-                "Warning: replica %s tried to PSYNC with an offset that is greater than the master replication offset.", replicationGetSlaveName(c));
-        }
-        goto need_full_resync;
-    }
-
-    /* If we reached this point, we are able to perform a partial resync:
-     * 1) Set client state to make it a slave.
-     * 2) Inform the client we can continue with +CONTINUE
-     * 3) Send the backlog data (from the offset to the end) to the slave. */
-    c->flags |= CLIENT_SLAVE;
-    c->replstate = SLAVE_STATE_ONLINE;
-    c->repl_ack_time = server.unixtime;
-    c->repl_put_online_on_ack = 0;
-    listAddNodeTail(server.slaves,c);
-    /* We can't use the connection buffers since they are used to accumulate
-     * new commands at this stage. But we are sure the socket send buffer is
-     * empty so this write will never fail actually. */
-    if (c->slave_capa & SLAVE_CAPA_PSYNC2) {
-        buflen = snprintf(buf,sizeof(buf),"+CONTINUE %s\r\n", server.replid);
-    } else {
-        buflen = snprintf(buf,sizeof(buf),"+CONTINUE\r\n");
-    }
-    if (connWrite(c->conn,buf,buflen) != buflen) {
-        freeClientAsync(c);
-        return C_OK;
-    }
-    psync_len = addReplyReplicationBacklog(c,psync_offset);
-    serverLog(LL_NOTICE,
-        "Partial resynchronization request from %s accepted. Sending %lld bytes of backlog starting from offset %lld.",
-            replicationGetSlaveName(c),
-            psync_len, psync_offset);
-    /* Note that we don't need to set the selected DB at server.slaveseldb
-     * to -1 to force the master to emit SELECT, since the slave already
-     * has this state from the previous connection with the master. */
-
-    refreshGoodSlavesCount();
-
-    /* Fire the replica change modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
-                          REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE,
-                          NULL);
-
-    return C_OK; /* The caller can return, no full resync needed. */
-
-need_full_resync:
-    /* We need a full resync for some reason... Note that we can't
-     * reply to PSYNC right now if a full SYNC is needed. The reply
-     * must include the master offset at the time the RDB file we transfer
-     * is generated, so we need to delay the reply to that moment. */
-    return C_ERR;
-}
-
-/* Start a BGSAVE for replication goals, which is, selecting the disk or
- * socket target depending on the configuration, and making sure that
- * the script cache is flushed before to start.
- *
- * The mincapa argument is the bitwise AND among all the slaves capabilities
- * of the slaves waiting for this BGSAVE, so represents the slave capabilities
- * all the slaves support. Can be tested via SLAVE_CAPA_* macros.
- *
- * Side effects, other than starting a BGSAVE:
- *
- * 1) Handle the slaves in WAIT_START state, by preparing them for a full
- *    sync if the BGSAVE was successfully started, or sending them an error
- *    and dropping them from the list of slaves.
- *
- * 2) Flush the Lua scripting script cache if the BGSAVE was actually
- *    started.
- *
- * Returns C_OK on success or C_ERR otherwise. */
-int startBgsaveForReplication(int mincapa) {
-    int retval;
-    int socket_target = server.repl_diskless_sync && (mincapa & SLAVE_CAPA_EOF);
-    listIter li;
-    listNode *ln;
-
-    serverLog(LL_NOTICE,"Starting BGSAVE for SYNC with target: %s",
-        socket_target ? "replicas sockets" : "disk");
-
-    rdbSaveInfo rsi, *rsiptr;
-    rsiptr = rdbPopulateSaveInfo(&rsi);
-    /* Only do rdbSave* when rsiptr is not NULL,
-     * otherwise slave will miss repl-stream-db. */
-    if (rsiptr) {
-        if (socket_target)
-            retval = rdbSaveToSlavesSockets(rsiptr);
-        else
-            retval = rdbSaveBackground(server.rdb_filename,rsiptr);
-    } else {
-        serverLog(LL_WARNING,"BGSAVE for replication: replication information not available, can't generate the RDB file right now. Try later.");
-        retval = C_ERR;
-    }
-
-    /* If we succeeded to start a BGSAVE with disk target, let's remember
-     * this fact, so that we can later delete the file if needed. Note
-     * that we don't set the flag to 1 if the feature is disabled, otherwise
-     * it would never be cleared: the file is not deleted. This way if
-     * the user enables it later with CONFIG SET, we are fine. */
-    if (retval == C_OK && !socket_target && server.rdb_del_sync_files)
-        RDBGeneratedByReplication = 1;
-
-    /* If we failed to BGSAVE, remove the slaves waiting for a full
-     * resynchronization from the list of slaves, inform them with
-     * an error about what happened, close the connection ASAP. */
-    if (retval == C_ERR) {
-        serverLog(LL_WARNING,"BGSAVE for replication failed");
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
-                slave->replstate = REPL_STATE_NONE;
-                slave->flags &= ~CLIENT_SLAVE;
-                listDelNode(server.slaves,ln);
-                addReplyError(slave,
-                    "BGSAVE failed, replication can't continue");
-                slave->flags |= CLIENT_CLOSE_AFTER_REPLY;
-            }
-        }
-        return retval;
-    }
-
-    /* If the target is socket, rdbSaveToSlavesSockets() already setup
-     * the slaves for a full resync. Otherwise for disk target do it now.*/
-    if (!socket_target) {
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
-                    replicationSetupSlaveForFullResync(slave,
-                            getPsyncInitialOffset());
-            }
-        }
-    }
-
-    /* Flush the script cache, since we need that slave differences are
-     * accumulated without requiring slaves to match our cached scripts. */
-    if (retval == C_OK) replicationScriptCacheFlush();
-    return retval;
-}
-
-/* SYNC and PSYNC command implementation. */
-void syncCommand(client *c) {
-    /* ignore SYNC if already slave or in monitor mode */
-    if (c->flags & CLIENT_SLAVE) return;
-
-    /* Check if this is a failover request to a replica with the same replid and
-     * become a master if so. */
-    if (c->argc > 3 && !strcasecmp(c->argv[0]->ptr,"psync") && 
-        !strcasecmp(c->argv[3]->ptr,"failover"))
-    {
-        serverLog(LL_WARNING, "Failover request received for replid %s.",
-            (unsigned char *)c->argv[1]->ptr);
-        if (!server.masterhost) {
-            addReplyError(c, "PSYNC FAILOVER can't be sent to a master.");
-            return;
-        }
-
-        if (!strcasecmp(c->argv[1]->ptr,server.replid)) {
-            replicationUnsetMaster();
-            sds client = catClientInfoString(sdsempty(),c);
-            serverLog(LL_NOTICE,
-                "MASTER MODE enabled (failover request from '%s')",client);
-            sdsfree(client);
-        } else {
-            addReplyError(c, "PSYNC FAILOVER replid must match my replid.");
-            return;            
-        }
-    }
-
-    /* Don't let replicas sync with us while we're failing over */
-    if (server.failover_state != NO_FAILOVER) {
-        addReplyError(c,"-NOMASTERLINK Can't SYNC while failing over");
-        return;
-    }
-
-    /* Refuse SYNC requests if we are a slave but the link with our master
-     * is not ok... */
-    if (server.masterhost && server.repl_state != REPL_STATE_CONNECTED) {
-        addReplyError(c,"-NOMASTERLINK Can't SYNC while not connected with my master");
-        return;
-    }
-
-    /* SYNC can't be issued when the server has pending data to send to
-     * the client about already issued commands. We need a fresh reply
-     * buffer registering the differences between the BGSAVE and the current
-     * dataset, so that we can copy to other slaves if needed. */
-    if (clientHasPendingReplies(c)) {
-        addReplyError(c,"SYNC and PSYNC are invalid with pending output");
-        return;
-    }
-
-    serverLog(LL_NOTICE,"Replica %s asks for synchronization",
-        replicationGetSlaveName(c));
-
-    /* Try a partial resynchronization if this is a PSYNC command.
-     * If it fails, we continue with usual full resynchronization, however
-     * when this happens masterTryPartialResynchronization() already
-     * replied with:
-     *
-     * +FULLRESYNC <replid> <offset>
-     *
-     * So the slave knows the new replid and offset to try a PSYNC later
-     * if the connection with the master is lost. */
-    if (!strcasecmp(c->argv[0]->ptr,"psync")) {
-        if (masterTryPartialResynchronization(c) == C_OK) {
-            server.stat_sync_partial_ok++;
-            return; /* No full resync needed, return. */
-        } else {
-            char *master_replid = c->argv[1]->ptr;
-
-            /* Increment stats for failed PSYNCs, but only if the
-             * replid is not "?", as this is used by slaves to force a full
-             * resync on purpose when they are not albe to partially
-             * resync. */
-            if (master_replid[0] != '?') server.stat_sync_partial_err++;
-        }
-    } else {
-        /* If a slave uses SYNC, we are dealing with an old implementation
-         * of the replication protocol (like redis-cli --slave). Flag the client
-         * so that we don't expect to receive REPLCONF ACK feedbacks. */
-        c->flags |= CLIENT_PRE_PSYNC;
-    }
-
-    /* Full resynchronization. */
-    server.stat_sync_full++;
-
-    /* Setup the slave as one waiting for BGSAVE to start. The following code
-     * paths will change the state if we handle the slave differently. */
-    c->replstate = SLAVE_STATE_WAIT_BGSAVE_START;
-    if (server.repl_disable_tcp_nodelay)
-        connDisableTcpNoDelay(c->conn); /* Non critical if it fails. */
-    c->repldbfd = -1;
-    c->flags |= CLIENT_SLAVE;
-    listAddNodeTail(server.slaves,c);
-
-    /* Create the replication backlog if needed. */
-    if (listLength(server.slaves) == 1 && server.repl_backlog == NULL) {
-        /* When we create the backlog from scratch, we always use a new
-         * replication ID and clear the ID2, since there is no valid
-         * past history. */
-        changeReplicationId();
-        clearReplicationId2();
-        createReplicationBacklog();
-        serverLog(LL_NOTICE,"Replication backlog created, my new "
-                            "replication IDs are '%s' and '%s'",
-                            server.replid, server.replid2);
-    }
-
-    /* CASE 1: BGSAVE is in progress, with disk target. */
-    if (server.child_type == CHILD_TYPE_RDB &&
-        server.rdb_child_type == RDB_CHILD_TYPE_DISK)
-    {
-        /* Ok a background save is in progress. Let's check if it is a good
-         * one for replication, i.e. if there is another slave that is
-         * registering differences since the server forked to save. */
-        client *slave;
-        listNode *ln;
-        listIter li;
-
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            slave = ln->value;
-            /* If the client needs a buffer of commands, we can't use
-             * a replica without replication buffer. */
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
-                (!(slave->flags & CLIENT_REPL_RDBONLY) ||
-                 (c->flags & CLIENT_REPL_RDBONLY)))
-                break;
-        }
-        /* To attach this slave, we check that it has at least all the
-         * capabilities of the slave that triggered the current BGSAVE. */
-        if (ln && ((c->slave_capa & slave->slave_capa) == slave->slave_capa)) {
-            /* Perfect, the server is already registering differences for
-             * another slave. Set the right state, and copy the buffer.
-             * We don't copy buffer if clients don't want. */
-            if (!(c->flags & CLIENT_REPL_RDBONLY)) copyClientOutputBuffer(c,slave);
-            replicationSetupSlaveForFullResync(c,slave->psync_initial_offset);
-            serverLog(LL_NOTICE,"Waiting for end of BGSAVE for SYNC");
-        } else {
-            /* No way, we need to wait for the next BGSAVE in order to
-             * register differences. */
-            serverLog(LL_NOTICE,"Can't attach the replica to the current BGSAVE. Waiting for next BGSAVE for SYNC");
-        }
-
-    /* CASE 2: BGSAVE is in progress, with socket target. */
-    } else if (server.child_type == CHILD_TYPE_RDB &&
-               server.rdb_child_type == RDB_CHILD_TYPE_SOCKET)
-    {
-        /* There is an RDB child process but it is writing directly to
-         * children sockets. We need to wait for the next BGSAVE
-         * in order to synchronize. */
-        serverLog(LL_NOTICE,"Current BGSAVE has socket target. Waiting for next BGSAVE for SYNC");
-
-    /* CASE 3: There is no BGSAVE is progress. */
-    } else {
-        if (server.repl_diskless_sync && (c->slave_capa & SLAVE_CAPA_EOF) &&
-            server.repl_diskless_sync_delay)
-        {
-            /* Diskless replication RDB child is created inside
-             * replicationCron() since we want to delay its start a
-             * few seconds to wait for more slaves to arrive. */
-            serverLog(LL_NOTICE,"Delay next BGSAVE for diskless SYNC");
-        } else {
-            /* We don't have a BGSAVE in progress, let's start one. Diskless
-             * or disk-based mode is determined by replica's capacity. */
-            if (!hasActiveChildProcess()) {
-                startBgsaveForReplication(c->slave_capa);
-            } else {
-                serverLog(LL_NOTICE,
-                    "No BGSAVE in progress, but another BG operation is active. "
-                    "BGSAVE for replication delayed");
-            }
-        }
-    }
-    return;
-}
-
-/* REPLCONF <option> <value> <option> <value> ...
- * This command is used by a replica in order to configure the replication
- * process before starting it with the SYNC command.
- * This command is also used by a master in order to get the replication
- * offset from a replica.
- *
- * Currently we support these options:
- *
- * - listening-port <port>
- * - ip-address <ip>
- * What is the listening ip and port of the Replica redis instance, so that
- * the master can accurately lists replicas and their listening ports in the
- * INFO output.
- *
- * - capa <eof|psync2>
- * What is the capabilities of this instance.
- * eof: supports EOF-style RDB transfer for diskless replication.
- * psync2: supports PSYNC v2, so understands +CONTINUE <new repl ID>.
- *
- * - ack <offset>
- * Replica informs the master the amount of replication stream that it
- * processed so far.
- *
- * - getack
- * Unlike other subcommands, this is used by master to get the replication
- * offset from a replica.
- *
- * - rdb-only
- * Only wants RDB snapshot without replication buffer. */
-void replconfCommand(client *c) {
-    int j;
-
-    if ((c->argc % 2) == 0) {
-        /* Number of arguments must be odd to make sure that every
-         * option has a corresponding value. */
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Process every option-value pair. */
-    for (j = 1; j < c->argc; j+=2) {
-        if (!strcasecmp(c->argv[j]->ptr,"listening-port")) {
-            long port;
-
-            if ((getLongFromObjectOrReply(c,c->argv[j+1],
-                    &port,NULL) != C_OK))
-                return;
-            c->slave_listening_port = port;
-        } else if (!strcasecmp(c->argv[j]->ptr,"ip-address")) {
-            sds addr = c->argv[j+1]->ptr;
-            if (sdslen(addr) < NET_HOST_STR_LEN) {
-                if (c->slave_addr) sdsfree(c->slave_addr);
-                c->slave_addr = sdsdup(addr);
-            } else {
-                addReplyErrorFormat(c,"REPLCONF ip-address provided by "
-                    "replica instance is too long: %zd bytes", sdslen(addr));
-                return;
-            }
-        } else if (!strcasecmp(c->argv[j]->ptr,"capa")) {
-            /* Ignore capabilities not understood by this master. */
-            if (!strcasecmp(c->argv[j+1]->ptr,"eof"))
-                c->slave_capa |= SLAVE_CAPA_EOF;
-            else if (!strcasecmp(c->argv[j+1]->ptr,"psync2"))
-                c->slave_capa |= SLAVE_CAPA_PSYNC2;
-        } else if (!strcasecmp(c->argv[j]->ptr,"ack")) {
-            /* REPLCONF ACK is used by slave to inform the master the amount
-             * of replication stream that it processed so far. It is an
-             * internal only command that normal clients should never use. */
-            long long offset;
-
-            if (!(c->flags & CLIENT_SLAVE)) return;
-            if ((getLongLongFromObject(c->argv[j+1], &offset) != C_OK))
-                return;
-            if (offset > c->repl_ack_off)
-                c->repl_ack_off = offset;
-            c->repl_ack_time = server.unixtime;
-            /* If this was a diskless replication, we need to really put
-             * the slave online when the first ACK is received (which
-             * confirms slave is online and ready to get more data). This
-             * allows for simpler and less CPU intensive EOF detection
-             * when streaming RDB files.
-             * There's a chance the ACK got to us before we detected that the
-             * bgsave is done (since that depends on cron ticks), so run a
-             * quick check first (instead of waiting for the next ACK. */
-            if (server.child_type == CHILD_TYPE_RDB && c->replstate == SLAVE_STATE_WAIT_BGSAVE_END)
-                checkChildrenDone();
-            if (c->repl_put_online_on_ack && c->replstate == SLAVE_STATE_ONLINE)
-                putSlaveOnline(c);
-            /* Note: this command does not reply anything! */
-            return;
-        } else if (!strcasecmp(c->argv[j]->ptr,"getack")) {
-            /* REPLCONF GETACK is used in order to request an ACK ASAP
-             * to the slave. */
-            if (server.masterhost && server.master) replicationSendAck();
-            return;
-        } else if (!strcasecmp(c->argv[j]->ptr,"rdb-only")) {
-           /* REPLCONF RDB-ONLY is used to identify the client only wants
-            * RDB snapshot without replication buffer. */
-            long rdb_only = 0;
-            if (getRangeLongFromObjectOrReply(c,c->argv[j+1],
-                    0,1,&rdb_only,NULL) != C_OK)
-                return;
-            if (rdb_only == 1) c->flags |= CLIENT_REPL_RDBONLY;
-            else c->flags &= ~CLIENT_REPL_RDBONLY;
-        } else {
-            addReplyErrorFormat(c,"Unrecognized REPLCONF option: %s",
-                (char*)c->argv[j]->ptr);
-            return;
-        }
-    }
-    addReply(c,shared.ok);
-}
-
-/* This function puts a replica in the online state, and should be called just
- * after a replica received the RDB file for the initial synchronization, and
- * we are finally ready to send the incremental stream of commands.
- *
- * It does a few things:
- * 1) Close the replica's connection async if it doesn't need replication
- *    commands buffer stream, since it actually isn't a valid replica.
- * 2) Put the slave in ONLINE state. Note that the function may also be called
- *    for a replicas that are already in ONLINE state, but having the flag
- *    repl_put_online_on_ack set to true: we still have to install the write
- *    handler in that case. This function will take care of that.
- * 3) Make sure the writable event is re-installed, since calling the SYNC
- *    command disables it, so that we can accumulate output buffer without
- *    sending it to the replica.
- * 4) Update the count of "good replicas". */
-void putSlaveOnline(client *slave) {
-    slave->replstate = SLAVE_STATE_ONLINE;
-    slave->repl_put_online_on_ack = 0;
-    slave->repl_ack_time = server.unixtime; /* Prevent false timeout. */
-
-    if (slave->flags & CLIENT_REPL_RDBONLY) {
-        serverLog(LL_NOTICE,
-            "Close the connection with replica %s as RDB transfer is complete",
-            replicationGetSlaveName(slave));
-        freeClientAsync(slave);
-        return;
-    }
-    if (connSetWriteHandler(slave->conn, sendReplyToClient) == C_ERR) {
-        serverLog(LL_WARNING,"Unable to register writable event for replica bulk transfer: %s", strerror(errno));
-        freeClient(slave);
-        return;
-    }
-    refreshGoodSlavesCount();
-    /* Fire the replica change modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_REPLICA_CHANGE,
-                          REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE,
-                          NULL);
-    serverLog(LL_NOTICE,"Synchronization with replica %s succeeded",
-        replicationGetSlaveName(slave));
-}
-
-/* We call this function periodically to remove an RDB file that was
- * generated because of replication, in an instance that is otherwise
- * without any persistence. We don't want instances without persistence
- * to take RDB files around, this violates certain policies in certain
- * environments. */
-void removeRDBUsedToSyncReplicas(void) {
-    /* If the feature is disabled, return ASAP but also clear the
-     * RDBGeneratedByReplication flag in case it was set. Otherwise if the
-     * feature was enabled, but gets disabled later with CONFIG SET, the
-     * flag may remain set to one: then next time the feature is re-enabled
-     * via CONFIG SET we have have it set even if no RDB was generated
-     * because of replication recently. */
-    if (!server.rdb_del_sync_files) {
-        RDBGeneratedByReplication = 0;
-        return;
-    }
-
-    if (allPersistenceDisabled() && RDBGeneratedByReplication) {
-        client *slave;
-        listNode *ln;
-        listIter li;
-
-        int delrdb = 1;
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            slave = ln->value;
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START ||
-                slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END ||
-                slave->replstate == SLAVE_STATE_SEND_BULK)
-            {
-                delrdb = 0;
-                break; /* No need to check the other replicas. */
-            }
-        }
-        if (delrdb) {
-            struct stat sb;
-            if (lstat(server.rdb_filename,&sb) != -1) {
-                RDBGeneratedByReplication = 0;
-                serverLog(LL_NOTICE,
-                    "Removing the RDB file used to feed replicas "
-                    "in a persistence-less instance");
-                bg_unlink(server.rdb_filename);
-            }
-        }
-    }
-}
-
-void sendBulkToSlave(connection *conn) {
-    client *slave = connGetPrivateData(conn);
-    char buf[PROTO_IOBUF_LEN];
-    ssize_t nwritten, buflen;
-
-    /* Before sending the RDB file, we send the preamble as configured by the
-     * replication process. Currently the preamble is just the bulk count of
-     * the file in the form "$<length>\r\n". */
-    if (slave->replpreamble) {
-        nwritten = connWrite(conn,slave->replpreamble,sdslen(slave->replpreamble));
-        if (nwritten == -1) {
-            serverLog(LL_VERBOSE,
-                "Write error sending RDB preamble to replica: %s",
-                connGetLastError(conn));
-            freeClient(slave);
-            return;
-        }
-        atomicIncr(server.stat_net_output_bytes, nwritten);
-        sdsrange(slave->replpreamble,nwritten,-1);
-        if (sdslen(slave->replpreamble) == 0) {
-            sdsfree(slave->replpreamble);
-            slave->replpreamble = NULL;
-            /* fall through sending data. */
-        } else {
-            return;
-        }
-    }
-
-    /* If the preamble was already transferred, send the RDB bulk data. */
-    lseek(slave->repldbfd,slave->repldboff,SEEK_SET);
-    buflen = read(slave->repldbfd,buf,PROTO_IOBUF_LEN);
-    if (buflen <= 0) {
-        serverLog(LL_WARNING,"Read error sending DB to replica: %s",
-            (buflen == 0) ? "premature EOF" : strerror(errno));
-        freeClient(slave);
-        return;
-    }
-    if ((nwritten = connWrite(conn,buf,buflen)) == -1) {
-        if (connGetState(conn) != CONN_STATE_CONNECTED) {
-            serverLog(LL_WARNING,"Write error sending DB to replica: %s",
-                connGetLastError(conn));
-            freeClient(slave);
-        }
-        return;
-    }
-    slave->repldboff += nwritten;
-    atomicIncr(server.stat_net_output_bytes, nwritten);
-    if (slave->repldboff == slave->repldbsize) {
-        close(slave->repldbfd);
-        slave->repldbfd = -1;
-        connSetWriteHandler(slave->conn,NULL);
-        putSlaveOnline(slave);
-    }
-}
-
-/* Remove one write handler from the list of connections waiting to be writable
- * during rdb pipe transfer. */
-void rdbPipeWriteHandlerConnRemoved(struct connection *conn) {
-    if (!connHasWriteHandler(conn))
-        return;
-    connSetWriteHandler(conn, NULL);
-    client *slave = connGetPrivateData(conn);
-    slave->repl_last_partial_write = 0;
-    server.rdb_pipe_numconns_writing--;
-    /* if there are no more writes for now for this conn, or write error: */
-    if (server.rdb_pipe_numconns_writing == 0) {
-        if (aeCreateFileEvent(server.el, server.rdb_pipe_read, AE_READABLE, rdbPipeReadHandler,NULL) == AE_ERR) {
-            serverPanic("Unrecoverable error creating server.rdb_pipe_read file event.");
-        }
-    }
-}
-
-/* Called in diskless master during transfer of data from the rdb pipe, when
- * the replica becomes writable again. */
-void rdbPipeWriteHandler(struct connection *conn) {
-    serverAssert(server.rdb_pipe_bufflen>0);
-    client *slave = connGetPrivateData(conn);
-    int nwritten;
-    if ((nwritten = connWrite(conn, server.rdb_pipe_buff + slave->repldboff,
-                              server.rdb_pipe_bufflen - slave->repldboff)) == -1)
-    {
-        if (connGetState(conn) == CONN_STATE_CONNECTED)
-            return; /* equivalent to EAGAIN */
-        serverLog(LL_WARNING,"Write error sending DB to replica: %s",
-            connGetLastError(conn));
-        freeClient(slave);
-        return;
-    } else {
-        slave->repldboff += nwritten;
-        atomicIncr(server.stat_net_output_bytes, nwritten);
-        if (slave->repldboff < server.rdb_pipe_bufflen) {
-            slave->repl_last_partial_write = server.unixtime;
-            return; /* more data to write.. */
-        }
-    }
-    rdbPipeWriteHandlerConnRemoved(conn);
-}
-
-/* Called in diskless master, when there's data to read from the child's rdb pipe */
-void rdbPipeReadHandler(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask) {
-    UNUSED(mask);
-    UNUSED(clientData);
-    UNUSED(eventLoop);
-    int i;
-    if (!server.rdb_pipe_buff)
-        server.rdb_pipe_buff = zmalloc(PROTO_IOBUF_LEN);
-    serverAssert(server.rdb_pipe_numconns_writing==0);
-
-    while (1) {
-        server.rdb_pipe_bufflen = read(fd, server.rdb_pipe_buff, PROTO_IOBUF_LEN);
-        if (server.rdb_pipe_bufflen < 0) {
-            if (errno == EAGAIN || errno == EWOULDBLOCK)
-                return;
-            serverLog(LL_WARNING,"Diskless rdb transfer, read error sending DB to replicas: %s", strerror(errno));
-            for (i=0; i < server.rdb_pipe_numconns; i++) {
-                connection *conn = server.rdb_pipe_conns[i];
-                if (!conn)
-                    continue;
-                client *slave = connGetPrivateData(conn);
-                freeClient(slave);
-                server.rdb_pipe_conns[i] = NULL;
-            }
-            killRDBChild();
-            return;
-        }
-
-        if (server.rdb_pipe_bufflen == 0) {
-            /* EOF - write end was closed. */
-            int stillUp = 0;
-            aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
-            for (i=0; i < server.rdb_pipe_numconns; i++)
-            {
-                connection *conn = server.rdb_pipe_conns[i];
-                if (!conn)
-                    continue;
-                stillUp++;
-            }
-            serverLog(LL_WARNING,"Diskless rdb transfer, done reading from pipe, %d replicas still up.", stillUp);
-            /* Now that the replicas have finished reading, notify the child that it's safe to exit. 
-             * When the server detectes the child has exited, it can mark the replica as online, and
-             * start streaming the replication buffers. */
-            close(server.rdb_child_exit_pipe);
-            server.rdb_child_exit_pipe = -1;
-            return;
-        }
-
-        int stillAlive = 0;
-        for (i=0; i < server.rdb_pipe_numconns; i++)
-        {
-            int nwritten;
-            connection *conn = server.rdb_pipe_conns[i];
-            if (!conn)
-                continue;
-
-            client *slave = connGetPrivateData(conn);
-            if ((nwritten = connWrite(conn, server.rdb_pipe_buff, server.rdb_pipe_bufflen)) == -1) {
-                if (connGetState(conn) != CONN_STATE_CONNECTED) {
-                    serverLog(LL_WARNING,"Diskless rdb transfer, write error sending DB to replica: %s",
-                        connGetLastError(conn));
-                    freeClient(slave);
-                    server.rdb_pipe_conns[i] = NULL;
-                    continue;
-                }
-                /* An error and still in connected state, is equivalent to EAGAIN */
-                slave->repldboff = 0;
-            } else {
-                /* Note: when use diskless replication, 'repldboff' is the offset
-                 * of 'rdb_pipe_buff' sent rather than the offset of entire RDB. */
-                slave->repldboff = nwritten;
-                atomicIncr(server.stat_net_output_bytes, nwritten);
-            }
-            /* If we were unable to write all the data to one of the replicas,
-             * setup write handler (and disable pipe read handler, below) */
-            if (nwritten != server.rdb_pipe_bufflen) {
-                slave->repl_last_partial_write = server.unixtime;
-                server.rdb_pipe_numconns_writing++;
-                connSetWriteHandler(conn, rdbPipeWriteHandler);
-            }
-            stillAlive++;
-        }
-
-        if (stillAlive == 0) {
-            serverLog(LL_WARNING,"Diskless rdb transfer, last replica dropped, killing fork child.");
-            killRDBChild();
-        }
-        /*  Remove the pipe read handler if at least one write handler was set. */
-        if (server.rdb_pipe_numconns_writing || stillAlive == 0) {
-            aeDeleteFileEvent(server.el, server.rdb_pipe_read, AE_READABLE);
-            break;
-        }
-    }
-}
-
-/* This function is called at the end of every background saving,
- * or when the replication RDB transfer strategy is modified from
- * disk to socket or the other way around.
- *
- * The goal of this function is to handle slaves waiting for a successful
- * background saving in order to perform non-blocking synchronization, and
- * to schedule a new BGSAVE if there are slaves that attached while a
- * BGSAVE was in progress, but it was not a good one for replication (no
- * other slave was accumulating differences).
- *
- * The argument bgsaveerr is C_OK if the background saving succeeded
- * otherwise C_ERR is passed to the function.
- * The 'type' argument is the type of the child that terminated
- * (if it had a disk or socket target). */
-void updateSlavesWaitingBgsave(int bgsaveerr, int type) {
-    listNode *ln;
-    listIter li;
-
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-
-        if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END) {
-            struct redis_stat buf;
-
-            if (bgsaveerr != C_OK) {
-                freeClient(slave);
-                serverLog(LL_WARNING,"SYNC failed. BGSAVE child returned an error");
-                continue;
-            }
-
-            /* If this was an RDB on disk save, we have to prepare to send
-             * the RDB from disk to the slave socket. Otherwise if this was
-             * already an RDB -> Slaves socket transfer, used in the case of
-             * diskless replication, our work is trivial, we can just put
-             * the slave online. */
-            if (type == RDB_CHILD_TYPE_SOCKET) {
-                serverLog(LL_NOTICE,
-                    "Streamed RDB transfer with replica %s succeeded (socket). Waiting for REPLCONF ACK from slave to enable streaming",
-                        replicationGetSlaveName(slave));
-                /* Note: we wait for a REPLCONF ACK message from the replica in
-                 * order to really put it online (install the write handler
-                 * so that the accumulated data can be transferred). However
-                 * we change the replication state ASAP, since our slave
-                 * is technically online now.
-                 *
-                 * So things work like that:
-                 *
-                 * 1. We end trasnferring the RDB file via socket.
-                 * 2. The replica is put ONLINE but the write handler
-                 *    is not installed.
-                 * 3. The replica however goes really online, and pings us
-                 *    back via REPLCONF ACK commands.
-                 * 4. Now we finally install the write handler, and send
-                 *    the buffers accumulated so far to the replica.
-                 *
-                 * But why we do that? Because the replica, when we stream
-                 * the RDB directly via the socket, must detect the RDB
-                 * EOF (end of file), that is a special random string at the
-                 * end of the RDB (for streamed RDBs we don't know the length
-                 * in advance). Detecting such final EOF string is much
-                 * simpler and less CPU intensive if no more data is sent
-                 * after such final EOF. So we don't want to glue the end of
-                 * the RDB trasfer with the start of the other replication
-                 * data. */
-                slave->replstate = SLAVE_STATE_ONLINE;
-                slave->repl_put_online_on_ack = 1;
-                slave->repl_ack_time = server.unixtime; /* Timeout otherwise. */
-            } else {
-                if ((slave->repldbfd = open(server.rdb_filename,O_RDONLY)) == -1 ||
-                    redis_fstat(slave->repldbfd,&buf) == -1) {
-                    freeClient(slave);
-                    serverLog(LL_WARNING,"SYNC failed. Can't open/stat DB after BGSAVE: %s", strerror(errno));
-                    continue;
-                }
-                slave->repldboff = 0;
-                slave->repldbsize = buf.st_size;
-                slave->replstate = SLAVE_STATE_SEND_BULK;
-                slave->replpreamble = sdscatprintf(sdsempty(),"$%lld\r\n",
-                    (unsigned long long) slave->repldbsize);
-
-                connSetWriteHandler(slave->conn,NULL);
-                if (connSetWriteHandler(slave->conn,sendBulkToSlave) == C_ERR) {
-                    freeClient(slave);
-                    continue;
-                }
-            }
-        }
-    }
-}
-
-/* Change the current instance replication ID with a new, random one.
- * This will prevent successful PSYNCs between this master and other
- * slaves, so the command should be called when something happens that
- * alters the current story of the dataset. */
-void changeReplicationId(void) {
-    getRandomHexChars(server.replid,CONFIG_RUN_ID_SIZE);
-    server.replid[CONFIG_RUN_ID_SIZE] = '\0';
-}
-
-/* Clear (invalidate) the secondary replication ID. This happens, for
- * example, after a full resynchronization, when we start a new replication
- * history. */
-void clearReplicationId2(void) {
-    memset(server.replid2,'0',sizeof(server.replid));
-    server.replid2[CONFIG_RUN_ID_SIZE] = '\0';
-    server.second_replid_offset = -1;
-}
-
-/* Use the current replication ID / offset as secondary replication
- * ID, and change the current one in order to start a new history.
- * This should be used when an instance is switched from slave to master
- * so that it can serve PSYNC requests performed using the master
- * replication ID. */
-void shiftReplicationId(void) {
-    memcpy(server.replid2,server.replid,sizeof(server.replid));
-    /* We set the second replid offset to the master offset + 1, since
-     * the slave will ask for the first byte it has not yet received, so
-     * we need to add one to the offset: for example if, as a slave, we are
-     * sure we have the same history as the master for 50 bytes, after we
-     * are turned into a master, we can accept a PSYNC request with offset
-     * 51, since the slave asking has the same history up to the 50th
-     * byte, and is asking for the new bytes starting at offset 51. */
-    server.second_replid_offset = server.master_repl_offset+1;
-    changeReplicationId();
-    serverLog(LL_WARNING,"Setting secondary replication ID to %s, valid up to offset: %lld. New replication ID is %s", server.replid2, server.second_replid_offset, server.replid);
-}
-
-/* ----------------------------------- SLAVE -------------------------------- */
-
-/* Returns 1 if the given replication state is a handshake state,
- * 0 otherwise. */
-int slaveIsInHandshakeState(void) {
-    return server.repl_state >= REPL_STATE_RECEIVE_PING_REPLY &&
-           server.repl_state <= REPL_STATE_RECEIVE_PSYNC_REPLY;
-}
-
-/* Avoid the master to detect the slave is timing out while loading the
- * RDB file in initial synchronization. We send a single newline character
- * that is valid protocol but is guaranteed to either be sent entirely or
- * not, since the byte is indivisible.
- *
- * The function is called in two contexts: while we flush the current
- * data with emptyDb(), and while we load the new data received as an
- * RDB file from the master. */
-void replicationSendNewlineToMaster(void) {
-    static time_t newline_sent;
-    if (time(NULL) != newline_sent) {
-        newline_sent = time(NULL);
-        /* Pinging back in this stage is best-effort. */
-        if (server.repl_transfer_s) connWrite(server.repl_transfer_s, "\n", 1);
-    }
-}
-
-/* Callback used by emptyDb() while flushing away old data to load
- * the new dataset received by the master. */
-void replicationEmptyDbCallback(void *privdata) {
-    UNUSED(privdata);
-    if (server.repl_state == REPL_STATE_TRANSFER)
-        replicationSendNewlineToMaster();
-}
-
-/* Once we have a link with the master and the synchronization was
- * performed, this function materializes the master client we store
- * at server.master, starting from the specified file descriptor. */
-void replicationCreateMasterClient(connection *conn, int dbid) {
-    server.master = createClient(conn);
-    if (conn)
-        connSetReadHandler(server.master->conn, readQueryFromClient);
-
-    /**
-     * Important note:
-     * The CLIENT_DENY_BLOCKING flag is not, and should not, be set here.
-     * For commands like BLPOP, it makes no sense to block the master
-     * connection, and such blocking attempt will probably cause deadlock and
-     * break the replication. We consider such a thing as a bug because
-     * commands as BLPOP should never be sent on the replication link.
-     * A possible use-case for blocking the replication link is if a module wants
-     * to pass the execution to a background thread and unblock after the
-     * execution is done. This is the reason why we allow blocking the replication
-     * connection. */
-    server.master->flags |= CLIENT_MASTER;
-
-    server.master->authenticated = 1;
-    server.master->reploff = server.master_initial_offset;
-    server.master->read_reploff = server.master->reploff;
-    server.master->user = NULL; /* This client can do everything. */
-    memcpy(server.master->replid, server.master_replid,
-        sizeof(server.master_replid));
-    /* If master offset is set to -1, this master is old and is not
-     * PSYNC capable, so we flag it accordingly. */
-    if (server.master->reploff == -1)
-        server.master->flags |= CLIENT_PRE_PSYNC;
-    if (dbid != -1) selectDb(server.master,dbid);
-}
-
-/* This function will try to re-enable the AOF file after the
- * master-replica synchronization: if it fails after multiple attempts
- * the replica cannot be considered reliable and exists with an
- * error. */
-void restartAOFAfterSYNC() {
-    unsigned int tries, max_tries = 10;
-    for (tries = 0; tries < max_tries; ++tries) {
-        if (startAppendOnly() == C_OK) break;
-        serverLog(LL_WARNING,
-            "Failed enabling the AOF after successful master synchronization! "
-            "Trying it again in one second.");
-        sleep(1);
-    }
-    if (tries == max_tries) {
-        serverLog(LL_WARNING,
-            "FATAL: this replica instance finished the synchronization with "
-            "its master, but the AOF can't be turned on. Exiting now.");
-        exit(1);
-    }
-}
-
-static int useDisklessLoad() {
-    /* compute boolean decision to use diskless load */
-    int enabled = server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB ||
-           (server.repl_diskless_load == REPL_DISKLESS_LOAD_WHEN_DB_EMPTY && dbTotalServerKeyCount()==0);
-    /* Check all modules handle read errors, otherwise it's not safe to use diskless load. */
-    if (enabled && !moduleAllDatatypesHandleErrors()) {
-        serverLog(LL_WARNING,
-            "Skipping diskless-load because there are modules that don't handle read errors.");
-        enabled = 0;
-    }
-    return enabled;
-}
-
-/* Helper function for readSyncBulkPayload() to make backups of the current
- * databases before socket-loading the new ones. The backups may be restored
- * by disklessLoadRestoreBackup or freed by disklessLoadDiscardBackup later. */
-dbBackup *disklessLoadMakeBackup(void) {
-    return backupDb();
-}
-
-/* Helper function for readSyncBulkPayload(): when replica-side diskless
- * database loading is used, Redis makes a backup of the existing databases
- * before loading the new ones from the socket.
- *
- * If the socket loading went wrong, we want to restore the old backups
- * into the server databases. */
-void disklessLoadRestoreBackup(dbBackup *buckup) {
-    restoreDbBackup(buckup);
-}
-
-/* Helper function for readSyncBulkPayload() to discard our old backups
- * when the loading succeeded. */
-void disklessLoadDiscardBackup(dbBackup *buckup, int flag) {
-    discardDbBackup(buckup, flag, replicationEmptyDbCallback);
-}
-
-/* Asynchronously read the SYNC payload we receive from a master */
-#define REPL_MAX_WRITTEN_BEFORE_FSYNC (1024*1024*8) /* 8 MB */
-void readSyncBulkPayload(connection *conn) {
-    char buf[PROTO_IOBUF_LEN];
-    ssize_t nread, readlen, nwritten;
-    int use_diskless_load = useDisklessLoad();
-    dbBackup *diskless_load_backup = NULL;
-    int empty_db_flags = server.repl_slave_lazy_flush ? EMPTYDB_ASYNC :
-                                                        EMPTYDB_NO_FLAGS;
-    off_t left;
-
-    /* Static vars used to hold the EOF mark, and the last bytes received
-     * from the server: when they match, we reached the end of the transfer. */
-    static char eofmark[CONFIG_RUN_ID_SIZE];
-    static char lastbytes[CONFIG_RUN_ID_SIZE];
-    static int usemark = 0;
-
-    /* If repl_transfer_size == -1 we still have to read the bulk length
-     * from the master reply. */
-    if (server.repl_transfer_size == -1) {
-        if (connSyncReadLine(conn,buf,1024,server.repl_syncio_timeout*1000) == -1) {
-            serverLog(LL_WARNING,
-                "I/O error reading bulk count from MASTER: %s",
-                strerror(errno));
-            goto error;
-        }
-
-        if (buf[0] == '-') {
-            serverLog(LL_WARNING,
-                "MASTER aborted replication with an error: %s",
-                buf+1);
-            goto error;
-        } else if (buf[0] == '\0') {
-            /* At this stage just a newline works as a PING in order to take
-             * the connection live. So we refresh our last interaction
-             * timestamp. */
-            server.repl_transfer_lastio = server.unixtime;
-            return;
-        } else if (buf[0] != '$') {
-            serverLog(LL_WARNING,"Bad protocol from MASTER, the first byte is not '$' (we received '%s'), are you sure the host and port are right?", buf);
-            goto error;
-        }
-
-        /* There are two possible forms for the bulk payload. One is the
-         * usual $<count> bulk format. The other is used for diskless transfers
-         * when the master does not know beforehand the size of the file to
-         * transfer. In the latter case, the following format is used:
-         *
-         * $EOF:<40 bytes delimiter>
-         *
-         * At the end of the file the announced delimiter is transmitted. The
-         * delimiter is long and random enough that the probability of a
-         * collision with the actual file content can be ignored. */
-        if (strncmp(buf+1,"EOF:",4) == 0 && strlen(buf+5) >= CONFIG_RUN_ID_SIZE) {
-            usemark = 1;
-            memcpy(eofmark,buf+5,CONFIG_RUN_ID_SIZE);
-            memset(lastbytes,0,CONFIG_RUN_ID_SIZE);
-            /* Set any repl_transfer_size to avoid entering this code path
-             * at the next call. */
-            server.repl_transfer_size = 0;
-            serverLog(LL_NOTICE,
-                "MASTER <-> REPLICA sync: receiving streamed RDB from master with EOF %s",
-                use_diskless_load? "to parser":"to disk");
-        } else {
-            usemark = 0;
-            server.repl_transfer_size = strtol(buf+1,NULL,10);
-            serverLog(LL_NOTICE,
-                "MASTER <-> REPLICA sync: receiving %lld bytes from master %s",
-                (long long) server.repl_transfer_size,
-                use_diskless_load? "to parser":"to disk");
-        }
-        return;
-    }
-
-    if (!use_diskless_load) {
-        /* Read the data from the socket, store it to a file and search
-         * for the EOF. */
-        if (usemark) {
-            readlen = sizeof(buf);
-        } else {
-            left = server.repl_transfer_size - server.repl_transfer_read;
-            readlen = (left < (signed)sizeof(buf)) ? left : (signed)sizeof(buf);
-        }
-
-        nread = connRead(conn,buf,readlen);
-        if (nread <= 0) {
-            if (connGetState(conn) == CONN_STATE_CONNECTED) {
-                /* equivalent to EAGAIN */
-                return;
-            }
-            serverLog(LL_WARNING,"I/O error trying to sync with MASTER: %s",
-                (nread == -1) ? strerror(errno) : "connection lost");
-            cancelReplicationHandshake(1);
-            return;
-        }
-        atomicIncr(server.stat_net_input_bytes, nread);
-
-        /* When a mark is used, we want to detect EOF asap in order to avoid
-         * writing the EOF mark into the file... */
-        int eof_reached = 0;
-
-        if (usemark) {
-            /* Update the last bytes array, and check if it matches our
-             * delimiter. */
-            if (nread >= CONFIG_RUN_ID_SIZE) {
-                memcpy(lastbytes,buf+nread-CONFIG_RUN_ID_SIZE,
-                       CONFIG_RUN_ID_SIZE);
-            } else {
-                int rem = CONFIG_RUN_ID_SIZE-nread;
-                memmove(lastbytes,lastbytes+nread,rem);
-                memcpy(lastbytes+rem,buf,nread);
-            }
-            if (memcmp(lastbytes,eofmark,CONFIG_RUN_ID_SIZE) == 0)
-                eof_reached = 1;
-        }
-
-        /* Update the last I/O time for the replication transfer (used in
-         * order to detect timeouts during replication), and write what we
-         * got from the socket to the dump file on disk. */
-        server.repl_transfer_lastio = server.unixtime;
-        if ((nwritten = write(server.repl_transfer_fd,buf,nread)) != nread) {
-            serverLog(LL_WARNING,
-                "Write error or short write writing to the DB dump file "
-                "needed for MASTER <-> REPLICA synchronization: %s",
-                (nwritten == -1) ? strerror(errno) : "short write");
-            goto error;
-        }
-        server.repl_transfer_read += nread;
-
-        /* Delete the last 40 bytes from the file if we reached EOF. */
-        if (usemark && eof_reached) {
-            if (ftruncate(server.repl_transfer_fd,
-                server.repl_transfer_read - CONFIG_RUN_ID_SIZE) == -1)
-            {
-                serverLog(LL_WARNING,
-                    "Error truncating the RDB file received from the master "
-                    "for SYNC: %s", strerror(errno));
-                goto error;
-            }
-        }
-
-        /* Sync data on disk from time to time, otherwise at the end of the
-         * transfer we may suffer a big delay as the memory buffers are copied
-         * into the actual disk. */
-        if (server.repl_transfer_read >=
-            server.repl_transfer_last_fsync_off + REPL_MAX_WRITTEN_BEFORE_FSYNC)
-        {
-            off_t sync_size = server.repl_transfer_read -
-                              server.repl_transfer_last_fsync_off;
-            rdb_fsync_range(server.repl_transfer_fd,
-                server.repl_transfer_last_fsync_off, sync_size);
-            server.repl_transfer_last_fsync_off += sync_size;
-        }
-
-        /* Check if the transfer is now complete */
-        if (!usemark) {
-            if (server.repl_transfer_read == server.repl_transfer_size)
-                eof_reached = 1;
-        }
-
-        /* If the transfer is yet not complete, we need to read more, so
-         * return ASAP and wait for the handler to be called again. */
-        if (!eof_reached) return;
-    }
-
-    /* We reach this point in one of the following cases:
-     *
-     * 1. The replica is using diskless replication, that is, it reads data
-     *    directly from the socket to the Redis memory, without using
-     *    a temporary RDB file on disk. In that case we just block and
-     *    read everything from the socket.
-     *
-     * 2. Or when we are done reading from the socket to the RDB file, in
-     *    such case we want just to read the RDB file in memory. */
-    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Flushing old data");
-
-    /* We need to stop any AOF rewriting child before flusing and parsing
-     * the RDB, otherwise we'll create a copy-on-write disaster. */
-    if (server.aof_state != AOF_OFF) stopAppendOnly();
-
-    /* When diskless RDB loading is used by replicas, it may be configured
-     * in order to save the current DB instead of throwing it away,
-     * so that we can restore it in case of failed transfer. */
-    if (use_diskless_load &&
-        server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB)
-    {
-        /* Create a backup of server.db[] and initialize to empty
-         * dictionaries. */
-        diskless_load_backup = disklessLoadMakeBackup();
-    }
-    /* We call to emptyDb even in case of REPL_DISKLESS_LOAD_SWAPDB
-     * (Where disklessLoadMakeBackup left server.db empty) because we
-     * want to execute all the auxiliary logic of emptyDb (Namely,
-     * fire module events) */
-    emptyDb(-1,empty_db_flags,replicationEmptyDbCallback);
-
-    /* Before loading the DB into memory we need to delete the readable
-     * handler, otherwise it will get called recursively since
-     * rdbLoad() will call the event loop to process events from time to
-     * time for non blocking loading. */
-    connSetReadHandler(conn, NULL);
-    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Loading DB in memory");
-    rdbSaveInfo rsi = RDB_SAVE_INFO_INIT;
-    if (use_diskless_load) {
-        rio rdb;
-        rioInitWithConn(&rdb,conn,server.repl_transfer_size);
-
-        /* Put the socket in blocking mode to simplify RDB transfer.
-         * We'll restore it when the RDB is received. */
-        connBlock(conn);
-        connRecvTimeout(conn, server.repl_timeout*1000);
-        startLoading(server.repl_transfer_size, RDBFLAGS_REPLICATION);
-
-        if (rdbLoadRio(&rdb,RDBFLAGS_REPLICATION,&rsi) != C_OK) {
-            /* RDB loading failed. */
-            stopLoading(0);
-            serverLog(LL_WARNING,
-                "Failed trying to load the MASTER synchronization DB "
-                "from socket");
-            cancelReplicationHandshake(1);
-            rioFreeConn(&rdb, NULL);
-
-            /* Remove the half-loaded data in case we started with
-             * an empty replica. */
-            emptyDb(-1,empty_db_flags,replicationEmptyDbCallback);
-
-            if (server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB) {
-                /* Restore the backed up databases. */
-                disklessLoadRestoreBackup(diskless_load_backup);
-            }
-
-            /* Note that there's no point in restarting the AOF on SYNC
-             * failure, it'll be restarted when sync succeeds or the replica
-             * gets promoted. */
-            return;
-        }
-
-        /* RDB loading succeeded if we reach this point. */
-        if (server.repl_diskless_load == REPL_DISKLESS_LOAD_SWAPDB) {
-            /* Delete the backup databases we created before starting to load
-             * the new RDB. Now the RDB was loaded with success so the old
-             * data is useless. */
-            disklessLoadDiscardBackup(diskless_load_backup, empty_db_flags);
-        }
-
-        /* Verify the end mark is correct. */
-        if (usemark) {
-            if (!rioRead(&rdb,buf,CONFIG_RUN_ID_SIZE) ||
-                memcmp(buf,eofmark,CONFIG_RUN_ID_SIZE) != 0)
-            {
-                stopLoading(0);
-                serverLog(LL_WARNING,"Replication stream EOF marker is broken");
-                cancelReplicationHandshake(1);
-                rioFreeConn(&rdb, NULL);
-                return;
-            }
-        }
-
-        stopLoading(1);
-
-        /* Cleanup and restore the socket to the original state to continue
-         * with the normal replication. */
-        rioFreeConn(&rdb, NULL);
-        connNonBlock(conn);
-        connRecvTimeout(conn,0);
-    } else {
-        /* Ensure background save doesn't overwrite synced data */
-        if (server.child_type == CHILD_TYPE_RDB) {
-            serverLog(LL_NOTICE,
-                "Replica is about to load the RDB file received from the "
-                "master, but there is a pending RDB child running. "
-                "Killing process %ld and removing its temp file to avoid "
-                "any race",
-                (long) server.child_pid);
-            killRDBChild();
-        }
-
-        /* Make sure the new file (also used for persistence) is fully synced
-         * (not covered by earlier calls to rdb_fsync_range). */
-        if (fsync(server.repl_transfer_fd) == -1) {
-            serverLog(LL_WARNING,
-                "Failed trying to sync the temp DB to disk in "
-                "MASTER <-> REPLICA synchronization: %s",
-                strerror(errno));
-            cancelReplicationHandshake(1);
-            return;
-        }
-
-        /* Rename rdb like renaming rewrite aof asynchronously. */
-        int old_rdb_fd = open(server.rdb_filename,O_RDONLY|O_NONBLOCK);
-        if (rename(server.repl_transfer_tmpfile,server.rdb_filename) == -1) {
-            serverLog(LL_WARNING,
-                "Failed trying to rename the temp DB into %s in "
-                "MASTER <-> REPLICA synchronization: %s",
-                server.rdb_filename, strerror(errno));
-            cancelReplicationHandshake(1);
-            if (old_rdb_fd != -1) close(old_rdb_fd);
-            return;
-        }
-        /* Close old rdb asynchronously. */
-        if (old_rdb_fd != -1) bioCreateCloseJob(old_rdb_fd);
-
-        if (rdbLoad(server.rdb_filename,&rsi,RDBFLAGS_REPLICATION) != C_OK) {
-            serverLog(LL_WARNING,
-                "Failed trying to load the MASTER synchronization "
-                "DB from disk");
-            cancelReplicationHandshake(1);
-            if (server.rdb_del_sync_files && allPersistenceDisabled()) {
-                serverLog(LL_NOTICE,"Removing the RDB file obtained from "
-                                    "the master. This replica has persistence "
-                                    "disabled");
-                bg_unlink(server.rdb_filename);
-            }
-            /* Note that there's no point in restarting the AOF on sync failure,
-               it'll be restarted when sync succeeds or replica promoted. */
-            return;
-        }
-
-        /* Cleanup. */
-        if (server.rdb_del_sync_files && allPersistenceDisabled()) {
-            serverLog(LL_NOTICE,"Removing the RDB file obtained from "
-                                "the master. This replica has persistence "
-                                "disabled");
-            bg_unlink(server.rdb_filename);
-        }
-
-        zfree(server.repl_transfer_tmpfile);
-        close(server.repl_transfer_fd);
-        server.repl_transfer_fd = -1;
-        server.repl_transfer_tmpfile = NULL;
-    }
-
-    /* Final setup of the connected slave <- master link */
-    replicationCreateMasterClient(server.repl_transfer_s,rsi.repl_stream_db);
-    server.repl_state = REPL_STATE_CONNECTED;
-    server.repl_down_since = 0;
-
-    /* Fire the master link modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-                          REDISMODULE_SUBEVENT_MASTER_LINK_UP,
-                          NULL);
-
-    /* After a full resynchronization we use the replication ID and
-     * offset of the master. The secondary ID / offset are cleared since
-     * we are starting a new history. */
-    memcpy(server.replid,server.master->replid,sizeof(server.replid));
-    server.master_repl_offset = server.master->reploff;
-    clearReplicationId2();
-
-    /* Let's create the replication backlog if needed. Slaves need to
-     * accumulate the backlog regardless of the fact they have sub-slaves
-     * or not, in order to behave correctly if they are promoted to
-     * masters after a failover. */
-    if (server.repl_backlog == NULL) createReplicationBacklog();
-    serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Finished with success");
-
-    if (server.supervised_mode == SUPERVISED_SYSTEMD) {
-        redisCommunicateSystemd("STATUS=MASTER <-> REPLICA sync: Finished with success. Ready to accept connections in read-write mode.\n");
-    }
-
-    /* Send the initial ACK immediately to put this replica in online state. */
-    if (usemark) replicationSendAck();
-
-    /* Restart the AOF subsystem now that we finished the sync. This
-     * will trigger an AOF rewrite, and when done will start appending
-     * to the new file. */
-    if (server.aof_enabled) restartAOFAfterSYNC();
-    return;
-
-error:
-    cancelReplicationHandshake(1);
-    return;
-}
-
-char *receiveSynchronousResponse(connection *conn) {
-    char buf[256];
-    /* Read the reply from the server. */
-    if (connSyncReadLine(conn,buf,sizeof(buf),server.repl_syncio_timeout*1000) == -1)
-    {
-        return sdscatprintf(sdsempty(),"-Reading from master: %s",
-                strerror(errno));
-    }
-    server.repl_transfer_lastio = server.unixtime;
-    return sdsnew(buf);
-}
-
-/* Send a pre-formatted multi-bulk command to the connection. */
-char* sendCommandRaw(connection *conn, sds cmd) {
-    if (connSyncWrite(conn,cmd,sdslen(cmd),server.repl_syncio_timeout*1000) == -1) {
-        return sdscatprintf(sdsempty(),"-Writing to master: %s",
-                connGetLastError(conn));
-    }
-    return NULL;
-}
-
-/* Compose a multi-bulk command and send it to the connection.
- * Used to send AUTH and REPLCONF commands to the master before starting the
- * replication.
- *
- * Takes a list of char* arguments, terminated by a NULL argument.
- *
- * The command returns an sds string representing the result of the
- * operation. On error the first byte is a "-".
- */
-char *sendCommand(connection *conn, ...) {
-    va_list ap;
-    sds cmd = sdsempty();
-    sds cmdargs = sdsempty();
-    size_t argslen = 0;
-    char *arg;
-
-    /* Create the command to send to the master, we use redis binary
-     * protocol to make sure correct arguments are sent. This function
-     * is not safe for all binary data. */
-    va_start(ap,conn);
-    while(1) {
-        arg = va_arg(ap, char*);
-        if (arg == NULL) break;
-        cmdargs = sdscatprintf(cmdargs,"$%zu\r\n%s\r\n",strlen(arg),arg);
-        argslen++;
-    }
-
-    cmd = sdscatprintf(cmd,"*%zu\r\n",argslen);
-    cmd = sdscatsds(cmd,cmdargs);
-    sdsfree(cmdargs);
-
-    va_end(ap);
-    char* err = sendCommandRaw(conn, cmd);
-    sdsfree(cmd);
-    if(err)
-        return err;
-    return NULL;
-}
-
-/* Compose a multi-bulk command and send it to the connection. 
- * Used to send AUTH and REPLCONF commands to the master before starting the
- * replication.
- *
- * argv_lens is optional, when NULL, strlen is used.
- *
- * The command returns an sds string representing the result of the
- * operation. On error the first byte is a "-".
- */
-char *sendCommandArgv(connection *conn, int argc, char **argv, size_t *argv_lens) {
-    sds cmd = sdsempty();
-    char *arg;
-    int i;
-
-    /* Create the command to send to the master. */
-    cmd = sdscatfmt(cmd,"*%i\r\n",argc);
-    for (i=0; i<argc; i++) {
-        int len;
-        arg = argv[i];
-        len = argv_lens ? argv_lens[i] : strlen(arg);
-        cmd = sdscatfmt(cmd,"$%i\r\n",len);
-        cmd = sdscatlen(cmd,arg,len);
-        cmd = sdscatlen(cmd,"\r\n",2);
-    }
-    char* err = sendCommandRaw(conn, cmd);
-    sdsfree(cmd);
-    if (err)
-        return err;
-    return NULL;
-}
-
-/* Try a partial resynchronization with the master if we are about to reconnect.
- * If there is no cached master structure, at least try to issue a
- * "PSYNC ? -1" command in order to trigger a full resync using the PSYNC
- * command in order to obtain the master replid and the master replication
- * global offset.
- *
- * This function is designed to be called from syncWithMaster(), so the
- * following assumptions are made:
- *
- * 1) We pass the function an already connected socket "fd".
- * 2) This function does not close the file descriptor "fd". However in case
- *    of successful partial resynchronization, the function will reuse
- *    'fd' as file descriptor of the server.master client structure.
- *
- * The function is split in two halves: if read_reply is 0, the function
- * writes the PSYNC command on the socket, and a new function call is
- * needed, with read_reply set to 1, in order to read the reply of the
- * command. This is useful in order to support non blocking operations, so
- * that we write, return into the event loop, and read when there are data.
- *
- * When read_reply is 0 the function returns PSYNC_WRITE_ERR if there
- * was a write error, or PSYNC_WAIT_REPLY to signal we need another call
- * with read_reply set to 1. However even when read_reply is set to 1
- * the function may return PSYNC_WAIT_REPLY again to signal there were
- * insufficient data to read to complete its work. We should re-enter
- * into the event loop and wait in such a case.
- *
- * The function returns:
- *
- * PSYNC_CONTINUE: If the PSYNC command succeeded and we can continue.
- * PSYNC_FULLRESYNC: If PSYNC is supported but a full resync is needed.
- *                   In this case the master replid and global replication
- *                   offset is saved.
- * PSYNC_NOT_SUPPORTED: If the server does not understand PSYNC at all and
- *                      the caller should fall back to SYNC.
- * PSYNC_WRITE_ERROR: There was an error writing the command to the socket.
- * PSYNC_WAIT_REPLY: Call again the function with read_reply set to 1.
- * PSYNC_TRY_LATER: Master is currently in a transient error condition.
- *
- * Notable side effects:
- *
- * 1) As a side effect of the function call the function removes the readable
- *    event handler from "fd", unless the return value is PSYNC_WAIT_REPLY.
- * 2) server.master_initial_offset is set to the right value according
- *    to the master reply. This will be used to populate the 'server.master'
- *    structure replication offset.
- */
-
-#define PSYNC_WRITE_ERROR 0
-#define PSYNC_WAIT_REPLY 1
-#define PSYNC_CONTINUE 2
-#define PSYNC_FULLRESYNC 3
-#define PSYNC_NOT_SUPPORTED 4
-#define PSYNC_TRY_LATER 5
-int slaveTryPartialResynchronization(connection *conn, int read_reply) {
-    char *psync_replid;
-    char psync_offset[32];
-    sds reply;
-
-    /* Writing half */
-    if (!read_reply) {
-        /* Initially set master_initial_offset to -1 to mark the current
-         * master replid and offset as not valid. Later if we'll be able to do
-         * a FULL resync using the PSYNC command we'll set the offset at the
-         * right value, so that this information will be propagated to the
-         * client structure representing the master into server.master. */
-        server.master_initial_offset = -1;
-
-        if (server.cached_master) {
-            psync_replid = server.cached_master->replid;
-            snprintf(psync_offset,sizeof(psync_offset),"%lld", server.cached_master->reploff+1);
-            serverLog(LL_NOTICE,"Trying a partial resynchronization (request %s:%s).", psync_replid, psync_offset);
-        } else {
-            serverLog(LL_NOTICE,"Partial resynchronization not possible (no cached master)");
-            psync_replid = "?";
-            memcpy(psync_offset,"-1",3);
-        }
-
-        /* Issue the PSYNC command, if this is a master with a failover in
-         * progress then send the failover argument to the replica to cause it
-         * to become a master */
-        if (server.failover_state == FAILOVER_IN_PROGRESS) {
-            reply = sendCommand(conn,"PSYNC",psync_replid,psync_offset,"FAILOVER",NULL);
-        } else {
-            reply = sendCommand(conn,"PSYNC",psync_replid,psync_offset,NULL);
-        }
-
-        if (reply != NULL) {
-            serverLog(LL_WARNING,"Unable to send PSYNC to master: %s",reply);
-            sdsfree(reply);
-            connSetReadHandler(conn, NULL);
-            return PSYNC_WRITE_ERROR;
-        }
-        return PSYNC_WAIT_REPLY;
-    }
-
-    /* Reading half */
-    reply = receiveSynchronousResponse(conn);
-    if (sdslen(reply) == 0) {
-        /* The master may send empty newlines after it receives PSYNC
-         * and before to reply, just to keep the connection alive. */
-        sdsfree(reply);
-        return PSYNC_WAIT_REPLY;
-    }
-
-    connSetReadHandler(conn, NULL);
-
-    if (!strncmp(reply,"+FULLRESYNC",11)) {
-        char *replid = NULL, *offset = NULL;
-
-        /* FULL RESYNC, parse the reply in order to extract the replid
-         * and the replication offset. */
-        replid = strchr(reply,' ');
-        if (replid) {
-            replid++;
-            offset = strchr(replid,' ');
-            if (offset) offset++;
-        }
-        if (!replid || !offset || (offset-replid-1) != CONFIG_RUN_ID_SIZE) {
-            serverLog(LL_WARNING,
-                "Master replied with wrong +FULLRESYNC syntax.");
-            /* This is an unexpected condition, actually the +FULLRESYNC
-             * reply means that the master supports PSYNC, but the reply
-             * format seems wrong. To stay safe we blank the master
-             * replid to make sure next PSYNCs will fail. */
-            memset(server.master_replid,0,CONFIG_RUN_ID_SIZE+1);
-        } else {
-            memcpy(server.master_replid, replid, offset-replid-1);
-            server.master_replid[CONFIG_RUN_ID_SIZE] = '\0';
-            server.master_initial_offset = strtoll(offset,NULL,10);
-            serverLog(LL_NOTICE,"Full resync from master: %s:%lld",
-                server.master_replid,
-                server.master_initial_offset);
-        }
-        /* We are going to full resync, discard the cached master structure. */
-        replicationDiscardCachedMaster();
-        sdsfree(reply);
-        return PSYNC_FULLRESYNC;
-    }
-
-    if (!strncmp(reply,"+CONTINUE",9)) {
-        /* Partial resync was accepted. */
-        serverLog(LL_NOTICE,
-            "Successful partial resynchronization with master.");
-
-        /* Check the new replication ID advertised by the master. If it
-         * changed, we need to set the new ID as primary ID, and set or
-         * secondary ID as the old master ID up to the current offset, so
-         * that our sub-slaves will be able to PSYNC with us after a
-         * disconnection. */
-        char *start = reply+10;
-        char *end = reply+9;
-        while(end[0] != '\r' && end[0] != '\n' && end[0] != '\0') end++;
-        if (end-start == CONFIG_RUN_ID_SIZE) {
-            char new[CONFIG_RUN_ID_SIZE+1];
-            memcpy(new,start,CONFIG_RUN_ID_SIZE);
-            new[CONFIG_RUN_ID_SIZE] = '\0';
-
-            if (strcmp(new,server.cached_master->replid)) {
-                /* Master ID changed. */
-                serverLog(LL_WARNING,"Master replication ID changed to %s",new);
-
-                /* Set the old ID as our ID2, up to the current offset+1. */
-                memcpy(server.replid2,server.cached_master->replid,
-                    sizeof(server.replid2));
-                server.second_replid_offset = server.master_repl_offset+1;
-
-                /* Update the cached master ID and our own primary ID to the
-                 * new one. */
-                memcpy(server.replid,new,sizeof(server.replid));
-                memcpy(server.cached_master->replid,new,sizeof(server.replid));
-
-                /* Disconnect all the sub-slaves: they need to be notified. */
-                disconnectSlaves();
-            }
-        }
-
-        /* Setup the replication to continue. */
-        sdsfree(reply);
-        replicationResurrectCachedMaster(conn);
-
-        /* If this instance was restarted and we read the metadata to
-         * PSYNC from the persistence file, our replication backlog could
-         * be still not initialized. Create it. */
-        if (server.repl_backlog == NULL) createReplicationBacklog();
-        return PSYNC_CONTINUE;
-    }
-
-    /* If we reach this point we received either an error (since the master does
-     * not understand PSYNC or because it is in a special state and cannot
-     * serve our request), or an unexpected reply from the master.
-     *
-     * Return PSYNC_NOT_SUPPORTED on errors we don't understand, otherwise
-     * return PSYNC_TRY_LATER if we believe this is a transient error. */
-
-    if (!strncmp(reply,"-NOMASTERLINK",13) ||
-        !strncmp(reply,"-LOADING",8))
-    {
-        serverLog(LL_NOTICE,
-            "Master is currently unable to PSYNC "
-            "but should be in the future: %s", reply);
-        sdsfree(reply);
-        return PSYNC_TRY_LATER;
-    }
-
-    if (strncmp(reply,"-ERR",4)) {
-        /* If it's not an error, log the unexpected event. */
-        serverLog(LL_WARNING,
-            "Unexpected reply to PSYNC from master: %s", reply);
-    } else {
-        serverLog(LL_NOTICE,
-            "Master does not support PSYNC or is in "
-            "error state (reply: %s)", reply);
-    }
-    sdsfree(reply);
-    replicationDiscardCachedMaster();
-    return PSYNC_NOT_SUPPORTED;
-}
-
-/* This handler fires when the non blocking connect was able to
- * establish a connection with the master. */
-void syncWithMaster(connection *conn) {
-    char tmpfile[256], *err = NULL;
-    int dfd = -1, maxtries = 5;
-    int psync_result;
-
-    /* If this event fired after the user turned the instance into a master
-     * with SLAVEOF NO ONE we must just return ASAP. */
-    if (server.repl_state == REPL_STATE_NONE) {
-        connClose(conn);
-        return;
-    }
-
-    /* Check for errors in the socket: after a non blocking connect() we
-     * may find that the socket is in error state. */
-    if (connGetState(conn) != CONN_STATE_CONNECTED) {
-        serverLog(LL_WARNING,"Error condition on socket for SYNC: %s",
-                connGetLastError(conn));
-        goto error;
-    }
-
-    /* Send a PING to check the master is able to reply without errors. */
-    if (server.repl_state == REPL_STATE_CONNECTING) {
-        serverLog(LL_NOTICE,"Non blocking connect for SYNC fired the event.");
-        /* Delete the writable event so that the readable event remains
-         * registered and we can wait for the PONG reply. */
-        connSetReadHandler(conn, syncWithMaster);
-        connSetWriteHandler(conn, NULL);
-        server.repl_state = REPL_STATE_RECEIVE_PING_REPLY;
-        /* Send the PING, don't check for errors at all, we have the timeout
-         * that will take care about this. */
-        err = sendCommand(conn,"PING",NULL);
-        if (err) goto write_error;
-        return;
-    }
-
-    /* Receive the PONG command. */
-    if (server.repl_state == REPL_STATE_RECEIVE_PING_REPLY) {
-        err = receiveSynchronousResponse(conn);
-
-        /* We accept only two replies as valid, a positive +PONG reply
-         * (we just check for "+") or an authentication error.
-         * Note that older versions of Redis replied with "operation not
-         * permitted" instead of using a proper error code, so we test
-         * both. */
-        if (err[0] != '+' &&
-            strncmp(err,"-NOAUTH",7) != 0 &&
-            strncmp(err,"-NOPERM",7) != 0 &&
-            strncmp(err,"-ERR operation not permitted",28) != 0)
-        {
-            serverLog(LL_WARNING,"Error reply to PING from master: '%s'",err);
-            sdsfree(err);
-            goto error;
-        } else {
-            serverLog(LL_NOTICE,
-                "Master replied to PING, replication can continue...");
-        }
-        sdsfree(err);
-        err = NULL;
-        server.repl_state = REPL_STATE_SEND_HANDSHAKE;
-    }
-
-    if (server.repl_state == REPL_STATE_SEND_HANDSHAKE) {
-        /* AUTH with the master if required. */
-        if (server.masterauth) {
-            char *args[3] = {"AUTH",NULL,NULL};
-            size_t lens[3] = {4,0,0};
-            int argc = 1;
-            if (server.masteruser) {
-                args[argc] = server.masteruser;
-                lens[argc] = strlen(server.masteruser);
-                argc++;
-            }
-            args[argc] = server.masterauth;
-            lens[argc] = sdslen(server.masterauth);
-            argc++;
-            err = sendCommandArgv(conn, argc, args, lens);
-            if (err) goto write_error;
-        }
-
-        /* Set the slave port, so that Master's INFO command can list the
-         * slave listening port correctly. */
-        {
-            int port;
-            if (server.slave_announce_port)
-                port = server.slave_announce_port;
-            else if (server.tls_replication && server.tls_port)
-                port = server.tls_port;
-            else
-                port = server.port;
-            sds portstr = sdsfromlonglong(port);
-            err = sendCommand(conn,"REPLCONF",
-                    "listening-port",portstr, NULL);
-            sdsfree(portstr);
-            if (err) goto write_error;
-        }
-
-        /* Set the slave ip, so that Master's INFO command can list the
-         * slave IP address port correctly in case of port forwarding or NAT.
-         * Skip REPLCONF ip-address if there is no slave-announce-ip option set. */
-        if (server.slave_announce_ip) {
-            err = sendCommand(conn,"REPLCONF",
-                    "ip-address",server.slave_announce_ip, NULL);
-            if (err) goto write_error;
-        }
-
-        /* Inform the master of our (slave) capabilities.
-         *
-         * EOF: supports EOF-style RDB transfer for diskless replication.
-         * PSYNC2: supports PSYNC v2, so understands +CONTINUE <new repl ID>.
-         *
-         * The master will ignore capabilities it does not understand. */
-        err = sendCommand(conn,"REPLCONF",
-                "capa","eof","capa","psync2",NULL);
-        if (err) goto write_error;
-
-        server.repl_state = REPL_STATE_RECEIVE_AUTH_REPLY;
-        return;
-    }
-
-    if (server.repl_state == REPL_STATE_RECEIVE_AUTH_REPLY && !server.masterauth)
-        server.repl_state = REPL_STATE_RECEIVE_PORT_REPLY;
-
-    /* Receive AUTH reply. */
-    if (server.repl_state == REPL_STATE_RECEIVE_AUTH_REPLY) {
-        err = receiveSynchronousResponse(conn);
-        if (err[0] == '-') {
-            serverLog(LL_WARNING,"Unable to AUTH to MASTER: %s",err);
-            sdsfree(err);
-            goto error;
-        }
-        sdsfree(err);
-        err = NULL;
-        server.repl_state = REPL_STATE_RECEIVE_PORT_REPLY;
-        return;
-    }
-
-    /* Receive REPLCONF listening-port reply. */
-    if (server.repl_state == REPL_STATE_RECEIVE_PORT_REPLY) {
-        err = receiveSynchronousResponse(conn);
-        /* Ignore the error if any, not all the Redis versions support
-         * REPLCONF listening-port. */
-        if (err[0] == '-') {
-            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
-                                "REPLCONF listening-port: %s", err);
-        }
-        sdsfree(err);
-        server.repl_state = REPL_STATE_RECEIVE_IP_REPLY;
-        return;
-    }
-
-    if (server.repl_state == REPL_STATE_RECEIVE_IP_REPLY && !server.slave_announce_ip)
-        server.repl_state = REPL_STATE_RECEIVE_CAPA_REPLY;
-
-    /* Receive REPLCONF ip-address reply. */
-    if (server.repl_state == REPL_STATE_RECEIVE_IP_REPLY) {
-        err = receiveSynchronousResponse(conn);
-        /* Ignore the error if any, not all the Redis versions support
-         * REPLCONF listening-port. */
-        if (err[0] == '-') {
-            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
-                                "REPLCONF ip-address: %s", err);
-        }
-        sdsfree(err);
-        server.repl_state = REPL_STATE_RECEIVE_CAPA_REPLY;
-        return;
-    }
-
-    /* Receive CAPA reply. */
-    if (server.repl_state == REPL_STATE_RECEIVE_CAPA_REPLY) {
-        err = receiveSynchronousResponse(conn);
-        /* Ignore the error if any, not all the Redis versions support
-         * REPLCONF capa. */
-        if (err[0] == '-') {
-            serverLog(LL_NOTICE,"(Non critical) Master does not understand "
-                                  "REPLCONF capa: %s", err);
-        }
-        sdsfree(err);
-        err = NULL;
-        server.repl_state = REPL_STATE_SEND_PSYNC;
-    }
-
-    /* Try a partial resynchonization. If we don't have a cached master
-     * slaveTryPartialResynchronization() will at least try to use PSYNC
-     * to start a full resynchronization so that we get the master replid
-     * and the global offset, to try a partial resync at the next
-     * reconnection attempt. */
-    if (server.repl_state == REPL_STATE_SEND_PSYNC) {
-        if (slaveTryPartialResynchronization(conn,0) == PSYNC_WRITE_ERROR) {
-            err = sdsnew("Write error sending the PSYNC command.");
-            abortFailover("Write error to failover target");
-            goto write_error;
-        }
-        server.repl_state = REPL_STATE_RECEIVE_PSYNC_REPLY;
-        return;
-    }
-
-    /* If reached this point, we should be in REPL_STATE_RECEIVE_PSYNC. */
-    if (server.repl_state != REPL_STATE_RECEIVE_PSYNC_REPLY) {
-        serverLog(LL_WARNING,"syncWithMaster(): state machine error, "
-                             "state should be RECEIVE_PSYNC but is %d",
-                             server.repl_state);
-        goto error;
-    }
-
-    psync_result = slaveTryPartialResynchronization(conn,1);
-    if (psync_result == PSYNC_WAIT_REPLY) return; /* Try again later... */
-
-    /* Check the status of the planned failover. We expect PSYNC_CONTINUE,
-     * but there is nothing technically wrong with a full resync which
-     * could happen in edge cases. */
-    if (server.failover_state == FAILOVER_IN_PROGRESS) {
-        if (psync_result == PSYNC_CONTINUE || psync_result == PSYNC_FULLRESYNC) {
-            clearFailoverState();
-        } else {
-            abortFailover("Failover target rejected psync request");
-            return;
-        }
-    }
-
-    /* If the master is in an transient error, we should try to PSYNC
-     * from scratch later, so go to the error path. This happens when
-     * the server is loading the dataset or is not connected with its
-     * master and so forth. */
-    if (psync_result == PSYNC_TRY_LATER) goto error;
-
-    /* Note: if PSYNC does not return WAIT_REPLY, it will take care of
-     * uninstalling the read handler from the file descriptor. */
-
-    if (psync_result == PSYNC_CONTINUE) {
-        serverLog(LL_NOTICE, "MASTER <-> REPLICA sync: Master accepted a Partial Resynchronization.");
-        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
-            redisCommunicateSystemd("STATUS=MASTER <-> REPLICA sync: Partial Resynchronization accepted. Ready to accept connections in read-write mode.\n");
-        }
-        return;
-    }
-
-    /* PSYNC failed or is not supported: we want our slaves to resync with us
-     * as well, if we have any sub-slaves. The master may transfer us an
-     * entirely different data set and we have no way to incrementally feed
-     * our slaves after that. */
-    disconnectSlaves(); /* Force our slaves to resync with us as well. */
-    freeReplicationBacklog(); /* Don't allow our chained slaves to PSYNC. */
-
-    /* Fall back to SYNC if needed. Otherwise psync_result == PSYNC_FULLRESYNC
-     * and the server.master_replid and master_initial_offset are
-     * already populated. */
-    if (psync_result == PSYNC_NOT_SUPPORTED) {
-        serverLog(LL_NOTICE,"Retrying with SYNC...");
-        if (connSyncWrite(conn,"SYNC\r\n",6,server.repl_syncio_timeout*1000) == -1) {
-            serverLog(LL_WARNING,"I/O error writing to MASTER: %s",
-                strerror(errno));
-            goto error;
-        }
-    }
-
-    /* Prepare a suitable temp file for bulk transfer */
-    if (!useDisklessLoad()) {
-        while(maxtries--) {
-            snprintf(tmpfile,256,
-                "temp-%d.%ld.rdb",(int)server.unixtime,(long int)getpid());
-            dfd = open(tmpfile,O_CREAT|O_WRONLY|O_EXCL,0644);
-            if (dfd != -1) break;
-            sleep(1);
-        }
-        if (dfd == -1) {
-            serverLog(LL_WARNING,"Opening the temp file needed for MASTER <-> REPLICA synchronization: %s",strerror(errno));
-            goto error;
-        }
-        server.repl_transfer_tmpfile = zstrdup(tmpfile);
-        server.repl_transfer_fd = dfd;
-    }
-
-    /* Setup the non blocking download of the bulk file. */
-    if (connSetReadHandler(conn, readSyncBulkPayload)
-            == C_ERR)
-    {
-        char conninfo[CONN_INFO_LEN];
-        serverLog(LL_WARNING,
-            "Can't create readable event for SYNC: %s (%s)",
-            strerror(errno), connGetInfo(conn, conninfo, sizeof(conninfo)));
-        goto error;
-    }
-
-    server.repl_state = REPL_STATE_TRANSFER;
-    server.repl_transfer_size = -1;
-    server.repl_transfer_read = 0;
-    server.repl_transfer_last_fsync_off = 0;
-    server.repl_transfer_lastio = server.unixtime;
-    return;
-
-error:
-    if (dfd != -1) close(dfd);
-    connClose(conn);
-    server.repl_transfer_s = NULL;
-    if (server.repl_transfer_fd != -1)
-        close(server.repl_transfer_fd);
-    if (server.repl_transfer_tmpfile)
-        zfree(server.repl_transfer_tmpfile);
-    server.repl_transfer_tmpfile = NULL;
-    server.repl_transfer_fd = -1;
-    server.repl_state = REPL_STATE_CONNECT;
-    return;
-
-write_error: /* Handle sendCommand() errors. */
-    serverLog(LL_WARNING,"Sending command to master in replication handshake: %s", err);
-    sdsfree(err);
-    goto error;
-}
-
-int connectWithMaster(void) {
-    server.repl_transfer_s = server.tls_replication ? connCreateTLS() : connCreateSocket();
-    if (connConnect(server.repl_transfer_s, server.masterhost, server.masterport,
-                NET_FIRST_BIND_ADDR, syncWithMaster) == C_ERR) {
-        serverLog(LL_WARNING,"Unable to connect to MASTER: %s",
-                connGetLastError(server.repl_transfer_s));
-        connClose(server.repl_transfer_s);
-        server.repl_transfer_s = NULL;
-        return C_ERR;
-    }
-
-
-    server.repl_transfer_lastio = server.unixtime;
-    server.repl_state = REPL_STATE_CONNECTING;
-    serverLog(LL_NOTICE,"MASTER <-> REPLICA sync started");
-    return C_OK;
-}
-
-/* This function can be called when a non blocking connection is currently
- * in progress to undo it.
- * Never call this function directly, use cancelReplicationHandshake() instead.
- */
-void undoConnectWithMaster(void) {
-    connClose(server.repl_transfer_s);
-    server.repl_transfer_s = NULL;
-}
-
-/* Abort the async download of the bulk dataset while SYNC-ing with master.
- * Never call this function directly, use cancelReplicationHandshake() instead.
- */
-void replicationAbortSyncTransfer(void) {
-    serverAssert(server.repl_state == REPL_STATE_TRANSFER);
-    undoConnectWithMaster();
-    if (server.repl_transfer_fd!=-1) {
-        close(server.repl_transfer_fd);
-        bg_unlink(server.repl_transfer_tmpfile);
-        zfree(server.repl_transfer_tmpfile);
-        server.repl_transfer_tmpfile = NULL;
-        server.repl_transfer_fd = -1;
-    }
-}
-
-/* This function aborts a non blocking replication attempt if there is one
- * in progress, by canceling the non-blocking connect attempt or
- * the initial bulk transfer.
- *
- * If there was a replication handshake in progress 1 is returned and
- * the replication state (server.repl_state) set to REPL_STATE_CONNECT.
- *
- * Otherwise zero is returned and no operation is performed at all. */
-int cancelReplicationHandshake(int reconnect) {
-    if (server.repl_state == REPL_STATE_TRANSFER) {
-        replicationAbortSyncTransfer();
-        server.repl_state = REPL_STATE_CONNECT;
-    } else if (server.repl_state == REPL_STATE_CONNECTING ||
-               slaveIsInHandshakeState())
-    {
-        undoConnectWithMaster();
-        server.repl_state = REPL_STATE_CONNECT;
-    } else {
-        return 0;
-    }
-
-    if (!reconnect)
-        return 1;
-
-    /* try to re-connect without waiting for replicationCron, this is needed
-     * for the "diskless loading short read" test. */
-    serverLog(LL_NOTICE,"Reconnecting to MASTER %s:%d after failure",
-        server.masterhost, server.masterport);
-    connectWithMaster();
-
-    return 1;
-}
-
-/* Set replication to the specified master address and port. */
-void replicationSetMaster(char *ip, int port) {
-    int was_master = server.masterhost == NULL;
-
-    sdsfree(server.masterhost);
-    server.masterhost = NULL;
-    if (server.master) {
-        freeClient(server.master);
-    }
-    disconnectAllBlockedClients(); /* Clients blocked in master, now slave. */
-
-    /* Setting masterhost only after the call to freeClient since it calls
-     * replicationHandleMasterDisconnection which can trigger a re-connect
-     * directly from within that call. */
-    server.masterhost = sdsnew(ip);
-    server.masterport = port;
-
-    /* Update oom_score_adj */
-    setOOMScoreAdj(-1);
-
-    /* Force our slaves to resync with us as well. They may hopefully be able
-     * to partially resync with us, but we can notify the replid change. */
-    disconnectSlaves();
-    cancelReplicationHandshake(0);
-    /* Before destroying our master state, create a cached master using
-     * our own parameters, to later PSYNC with the new master. */
-    if (was_master) {
-        replicationDiscardCachedMaster();
-        replicationCacheMasterUsingMyself();
-    }
-
-    /* Fire the role change modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
-                          REDISMODULE_EVENT_REPLROLECHANGED_NOW_REPLICA,
-                          NULL);
-
-    /* Fire the master link modules event. */
-    if (server.repl_state == REPL_STATE_CONNECTED)
-        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
-                              NULL);
-
-    server.repl_state = REPL_STATE_CONNECT;
-    serverLog(LL_NOTICE,"Connecting to MASTER %s:%d",
-        server.masterhost, server.masterport);
-    connectWithMaster();
-}
-
-/* Cancel replication, setting the instance as a master itself. */
-void replicationUnsetMaster(void) {
-    if (server.masterhost == NULL) return; /* Nothing to do. */
-
-    /* Fire the master link modules event. */
-    if (server.repl_state == REPL_STATE_CONNECTED)
-        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
-                              NULL);
-
-    /* Clear masterhost first, since the freeClient calls
-     * replicationHandleMasterDisconnection which can attempt to re-connect. */
-    sdsfree(server.masterhost);
-    server.masterhost = NULL;
-    if (server.master) freeClient(server.master);
-    replicationDiscardCachedMaster();
-    cancelReplicationHandshake(0);
-    /* When a slave is turned into a master, the current replication ID
-     * (that was inherited from the master at synchronization time) is
-     * used as secondary ID up to the current offset, and a new replication
-     * ID is created to continue with a new replication history.
-     *
-     * NOTE: this function MUST be called after we call
-     * freeClient(server.master), since there we adjust the replication
-     * offset trimming the final PINGs. See Github issue #7320. */
-    shiftReplicationId();
-    /* Disconnecting all the slaves is required: we need to inform slaves
-     * of the replication ID change (see shiftReplicationId() call). However
-     * the slaves will be able to partially resync with us, so it will be
-     * a very fast reconnection. */
-    disconnectSlaves();
-    server.repl_state = REPL_STATE_NONE;
-
-    /* We need to make sure the new master will start the replication stream
-     * with a SELECT statement. This is forced after a full resync, but
-     * with PSYNC version 2, there is no need for full resync after a
-     * master switch. */
-    server.slaveseldb = -1;
-
-    /* Update oom_score_adj */
-    setOOMScoreAdj(-1);
-
-    /* Once we turn from slave to master, we consider the starting time without
-     * slaves (that is used to count the replication backlog time to live) as
-     * starting from now. Otherwise the backlog will be freed after a
-     * failover if slaves do not connect immediately. */
-    server.repl_no_slaves_since = server.unixtime;
-    
-    /* Reset down time so it'll be ready for when we turn into replica again. */
-    server.repl_down_since = 0;
-
-    /* Fire the role change modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_REPLICATION_ROLE_CHANGED,
-                          REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER,
-                          NULL);
-
-    /* Restart the AOF subsystem in case we shut it down during a sync when
-     * we were still a slave. */
-    if (server.aof_enabled && server.aof_state == AOF_OFF) restartAOFAfterSYNC();
-}
-
-/* This function is called when the slave lose the connection with the
- * master into an unexpected way. */
-void replicationHandleMasterDisconnection(void) {
-    /* Fire the master link modules event. */
-    if (server.repl_state == REPL_STATE_CONNECTED)
-        moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-                              REDISMODULE_SUBEVENT_MASTER_LINK_DOWN,
-                              NULL);
-
-    server.master = NULL;
-    server.repl_state = REPL_STATE_CONNECT;
-    server.repl_down_since = server.unixtime;
-    /* We lost connection with our master, don't disconnect slaves yet,
-     * maybe we'll be able to PSYNC with our master later. We'll disconnect
-     * the slaves only if we'll have to do a full resync with our master. */
-
-    /* Try to re-connect immediately rather than wait for replicationCron
-     * waiting 1 second may risk backlog being recycled. */
-    if (server.masterhost) {
-        serverLog(LL_NOTICE,"Reconnecting to MASTER %s:%d",
-            server.masterhost, server.masterport);
-        connectWithMaster();
-    }
-}
-
-void replicaofCommand(client *c) {
-    /* SLAVEOF is not allowed in cluster mode as replication is automatically
-     * configured using the current address of the master node. */
-    if (server.cluster_enabled) {
-        addReplyError(c,"REPLICAOF not allowed in cluster mode.");
-        return;
-    }
-
-    if (server.failover_state != NO_FAILOVER) {
-        addReplyError(c,"REPLICAOF not allowed while failing over.");
-        return;
-    }
-
-    /* The special host/port combination "NO" "ONE" turns the instance
-     * into a master. Otherwise the new master address is set. */
-    if (!strcasecmp(c->argv[1]->ptr,"no") &&
-        !strcasecmp(c->argv[2]->ptr,"one")) {
-        if (server.masterhost) {
-            replicationUnsetMaster();
-            sds client = catClientInfoString(sdsempty(),c);
-            serverLog(LL_NOTICE,"MASTER MODE enabled (user request from '%s')",
-                client);
-            sdsfree(client);
-        }
-    } else {
-        long port;
-
-        if (c->flags & CLIENT_SLAVE)
-        {
-            /* If a client is already a replica they cannot run this command,
-             * because it involves flushing all replicas (including this
-             * client) */
-            addReplyError(c, "Command is not valid when client is a replica.");
-            return;
-        }
-
-        if ((getLongFromObjectOrReply(c, c->argv[2], &port, NULL) != C_OK))
-            return;
-
-        /* Check if we are already attached to the specified master */
-        if (server.masterhost && !strcasecmp(server.masterhost,c->argv[1]->ptr)
-            && server.masterport == port) {
-            serverLog(LL_NOTICE,"REPLICAOF would result into synchronization "
-                                "with the master we are already connected "
-                                "with. No operation performed.");
-            addReplySds(c,sdsnew("+OK Already connected to specified "
-                                 "master\r\n"));
-            return;
-        }
-        /* There was no previous master or the user specified a different one,
-         * we can continue. */
-        replicationSetMaster(c->argv[1]->ptr, port);
-        sds client = catClientInfoString(sdsempty(),c);
-        serverLog(LL_NOTICE,"REPLICAOF %s:%d enabled (user request from '%s')",
-            server.masterhost, server.masterport, client);
-        sdsfree(client);
-    }
-    addReply(c,shared.ok);
-}
-
-/* ROLE command: provide information about the role of the instance
- * (master or slave) and additional information related to replication
- * in an easy to process format. */
-void roleCommand(client *c) {
-    if (server.masterhost == NULL) {
-        listIter li;
-        listNode *ln;
-        void *mbcount;
-        int slaves = 0;
-
-        addReplyArrayLen(c,3);
-        addReplyBulkCBuffer(c,"master",6);
-        addReplyLongLong(c,server.master_repl_offset);
-        mbcount = addReplyDeferredLen(c);
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-            char ip[NET_IP_STR_LEN], *slaveaddr = slave->slave_addr;
-
-            if (!slaveaddr) {
-                if (connPeerToString(slave->conn,ip,sizeof(ip),NULL) == -1)
-                    continue;
-                slaveaddr = ip;
-            }
-            if (slave->replstate != SLAVE_STATE_ONLINE) continue;
-            addReplyArrayLen(c,3);
-            addReplyBulkCString(c,slaveaddr);
-            addReplyBulkLongLong(c,slave->slave_listening_port);
-            addReplyBulkLongLong(c,slave->repl_ack_off);
-            slaves++;
-        }
-        setDeferredArrayLen(c,mbcount,slaves);
-    } else {
-        char *slavestate = NULL;
-
-        addReplyArrayLen(c,5);
-        addReplyBulkCBuffer(c,"slave",5);
-        addReplyBulkCString(c,server.masterhost);
-        addReplyLongLong(c,server.masterport);
-        if (slaveIsInHandshakeState()) {
-            slavestate = "handshake";
-        } else {
-            switch(server.repl_state) {
-            case REPL_STATE_NONE: slavestate = "none"; break;
-            case REPL_STATE_CONNECT: slavestate = "connect"; break;
-            case REPL_STATE_CONNECTING: slavestate = "connecting"; break;
-            case REPL_STATE_TRANSFER: slavestate = "sync"; break;
-            case REPL_STATE_CONNECTED: slavestate = "connected"; break;
-            default: slavestate = "unknown"; break;
-            }
-        }
-        addReplyBulkCString(c,slavestate);
-        addReplyLongLong(c,server.master ? server.master->reploff : -1);
-    }
-}
-
-/* Send a REPLCONF ACK command to the master to inform it about the current
- * processed offset. If we are not connected with a master, the command has
- * no effects. */
-void replicationSendAck(void) {
-    client *c = server.master;
-
-    if (c != NULL) {
-        c->flags |= CLIENT_MASTER_FORCE_REPLY;
-        addReplyArrayLen(c,3);
-        addReplyBulkCString(c,"REPLCONF");
-        addReplyBulkCString(c,"ACK");
-        addReplyBulkLongLong(c,c->reploff);
-        c->flags &= ~CLIENT_MASTER_FORCE_REPLY;
-    }
-}
-
-/* ---------------------- MASTER CACHING FOR PSYNC -------------------------- */
-
-/* In order to implement partial synchronization we need to be able to cache
- * our master's client structure after a transient disconnection.
- * It is cached into server.cached_master and flushed away using the following
- * functions. */
-
-/* This function is called by freeClient() in order to cache the master
- * client structure instead of destroying it. freeClient() will return
- * ASAP after this function returns, so every action needed to avoid problems
- * with a client that is really "suspended" has to be done by this function.
- *
- * The other functions that will deal with the cached master are:
- *
- * replicationDiscardCachedMaster() that will make sure to kill the client
- * as for some reason we don't want to use it in the future.
- *
- * replicationResurrectCachedMaster() that is used after a successful PSYNC
- * handshake in order to reactivate the cached master.
- */
-void replicationCacheMaster(client *c) {
-    serverAssert(server.master != NULL && server.cached_master == NULL);
-    serverLog(LL_NOTICE,"Caching the disconnected master state.");
-
-    /* Unlink the client from the server structures. */
-    unlinkClient(c);
-
-    /* Reset the master client so that's ready to accept new commands:
-     * we want to discard te non processed query buffers and non processed
-     * offsets, including pending transactions, already populated arguments,
-     * pending outputs to the master. */
-    sdsclear(server.master->querybuf);
-    sdsclear(server.master->pending_querybuf);
-    server.master->read_reploff = server.master->reploff;
-    if (c->flags & CLIENT_MULTI) discardTransaction(c);
-    listEmpty(c->reply);
-    c->sentlen = 0;
-    c->reply_bytes = 0;
-    c->bufpos = 0;
-    resetClient(c);
-
-    /* Save the master. Server.master will be set to null later by
-     * replicationHandleMasterDisconnection(). */
-    server.cached_master = server.master;
-
-    /* Invalidate the Peer ID cache. */
-    if (c->peerid) {
-        sdsfree(c->peerid);
-        c->peerid = NULL;
-    }
-    /* Invalidate the Sock Name cache. */
-    if (c->sockname) {
-        sdsfree(c->sockname);
-        c->sockname = NULL;
-    }
-
-    /* Caching the master happens instead of the actual freeClient() call,
-     * so make sure to adjust the replication state. This function will
-     * also set server.master to NULL. */
-    replicationHandleMasterDisconnection();
-}
-
-/* This function is called when a master is turend into a slave, in order to
- * create from scratch a cached master for the new client, that will allow
- * to PSYNC with the slave that was promoted as the new master after a
- * failover.
- *
- * Assuming this instance was previously the master instance of the new master,
- * the new master will accept its replication ID, and potentiall also the
- * current offset if no data was lost during the failover. So we use our
- * current replication ID and offset in order to synthesize a cached master. */
-void replicationCacheMasterUsingMyself(void) {
-    serverLog(LL_NOTICE,
-        "Before turning into a replica, using my own master parameters "
-        "to synthesize a cached master: I may be able to synchronize with "
-        "the new master with just a partial transfer.");
-
-    /* This will be used to populate the field server.master->reploff
-     * by replicationCreateMasterClient(). We'll later set the created
-     * master as server.cached_master, so the replica will use such
-     * offset for PSYNC. */
-    server.master_initial_offset = server.master_repl_offset;
-
-    /* The master client we create can be set to any DBID, because
-     * the new master will start its replication stream with SELECT. */
-    replicationCreateMasterClient(NULL,-1);
-
-    /* Use our own ID / offset. */
-    memcpy(server.master->replid, server.replid, sizeof(server.replid));
-
-    /* Set as cached master. */
-    unlinkClient(server.master);
-    server.cached_master = server.master;
-    server.master = NULL;
-}
-
-/* Free a cached master, called when there are no longer the conditions for
- * a partial resync on reconnection. */
-void replicationDiscardCachedMaster(void) {
-    if (server.cached_master == NULL) return;
-
-    serverLog(LL_NOTICE,"Discarding previously cached master state.");
-    server.cached_master->flags &= ~CLIENT_MASTER;
-    freeClient(server.cached_master);
-    server.cached_master = NULL;
-}
-
-/* Turn the cached master into the current master, using the file descriptor
- * passed as argument as the socket for the new master.
- *
- * This function is called when successfully setup a partial resynchronization
- * so the stream of data that we'll receive will start from were this
- * master left. */
-void replicationResurrectCachedMaster(connection *conn) {
-    server.master = server.cached_master;
-    server.cached_master = NULL;
-    server.master->conn = conn;
-    connSetPrivateData(server.master->conn, server.master);
-    server.master->flags &= ~(CLIENT_CLOSE_AFTER_REPLY|CLIENT_CLOSE_ASAP);
-    server.master->authenticated = 1;
-    server.master->lastinteraction = server.unixtime;
-    server.repl_state = REPL_STATE_CONNECTED;
-    server.repl_down_since = 0;
-
-    /* Fire the master link modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_MASTER_LINK_CHANGE,
-                          REDISMODULE_SUBEVENT_MASTER_LINK_UP,
-                          NULL);
-
-    /* Re-add to the list of clients. */
-    linkClient(server.master);
-    if (connSetReadHandler(server.master->conn, readQueryFromClient)) {
-        serverLog(LL_WARNING,"Error resurrecting the cached master, impossible to add the readable handler: %s", strerror(errno));
-        freeClientAsync(server.master); /* Close ASAP. */
-    }
-
-    /* We may also need to install the write handler as well if there is
-     * pending data in the write buffers. */
-    if (clientHasPendingReplies(server.master)) {
-        if (connSetWriteHandler(server.master->conn, sendReplyToClient)) {
-            serverLog(LL_WARNING,"Error resurrecting the cached master, impossible to add the writable handler: %s", strerror(errno));
-            freeClientAsync(server.master); /* Close ASAP. */
-        }
-    }
-}
-
-/* ------------------------- MIN-SLAVES-TO-WRITE  --------------------------- */
-
-/* This function counts the number of slaves with lag <= min-slaves-max-lag.
- * If the option is active, the server will prevent writes if there are not
- * enough connected slaves with the specified lag (or less). */
-void refreshGoodSlavesCount(void) {
-    listIter li;
-    listNode *ln;
-    int good = 0;
-
-    if (!server.repl_min_slaves_to_write ||
-        !server.repl_min_slaves_max_lag) return;
-
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-        time_t lag = server.unixtime - slave->repl_ack_time;
-
-        if (slave->replstate == SLAVE_STATE_ONLINE &&
-            lag <= server.repl_min_slaves_max_lag) good++;
-    }
-    server.repl_good_slaves_count = good;
-}
-
-/* ----------------------- REPLICATION SCRIPT CACHE --------------------------
- * The goal of this code is to keep track of scripts already sent to every
- * connected slave, in order to be able to replicate EVALSHA as it is without
- * translating it to EVAL every time it is possible.
- *
- * We use a capped collection implemented by a hash table for fast lookup
- * of scripts we can send as EVALSHA, plus a linked list that is used for
- * eviction of the oldest entry when the max number of items is reached.
- *
- * We don't care about taking a different cache for every different slave
- * since to fill the cache again is not very costly, the goal of this code
- * is to avoid that the same big script is transmitted a big number of times
- * per second wasting bandwidth and processor speed, but it is not a problem
- * if we need to rebuild the cache from scratch from time to time, every used
- * script will need to be transmitted a single time to reappear in the cache.
- *
- * This is how the system works:
- *
- * 1) Every time a new slave connects, we flush the whole script cache.
- * 2) We only send as EVALSHA what was sent to the master as EVALSHA, without
- *    trying to convert EVAL into EVALSHA specifically for slaves.
- * 3) Every time we transmit a script as EVAL to the slaves, we also add the
- *    corresponding SHA1 of the script into the cache as we are sure every
- *    slave knows about the script starting from now.
- * 4) On SCRIPT FLUSH command, we replicate the command to all the slaves
- *    and at the same time flush the script cache.
- * 5) When the last slave disconnects, flush the cache.
- * 6) We handle SCRIPT LOAD as well since that's how scripts are loaded
- *    in the master sometimes.
- */
-
-/* Initialize the script cache, only called at startup. */
-void replicationScriptCacheInit(void) {
-    server.repl_scriptcache_size = 10000;
-    server.repl_scriptcache_dict = dictCreate(&replScriptCacheDictType,NULL);
-    server.repl_scriptcache_fifo = listCreate();
-}
-
-/* Empty the script cache. Should be called every time we are no longer sure
- * that every slave knows about all the scripts in our set, or when the
- * current AOF "context" is no longer aware of the script. In general we
- * should flush the cache:
- *
- * 1) Every time a new slave reconnects to this master and performs a
- *    full SYNC (PSYNC does not require flushing).
- * 2) Every time an AOF rewrite is performed.
- * 3) Every time we are left without slaves at all, and AOF is off, in order
- *    to reclaim otherwise unused memory.
- */
-void replicationScriptCacheFlush(void) {
-    dictEmpty(server.repl_scriptcache_dict,NULL);
-    listRelease(server.repl_scriptcache_fifo);
-    server.repl_scriptcache_fifo = listCreate();
-}
-
-/* Add an entry into the script cache, if we reach max number of entries the
- * oldest is removed from the list. */
-void replicationScriptCacheAdd(sds sha1) {
-    int retval;
-    sds key = sdsdup(sha1);
-
-    /* Evict oldest. */
-    if (listLength(server.repl_scriptcache_fifo) == server.repl_scriptcache_size)
-    {
-        listNode *ln = listLast(server.repl_scriptcache_fifo);
-        sds oldest = listNodeValue(ln);
-
-        retval = dictDelete(server.repl_scriptcache_dict,oldest);
-        serverAssert(retval == DICT_OK);
-        listDelNode(server.repl_scriptcache_fifo,ln);
-    }
-
-    /* Add current. */
-    retval = dictAdd(server.repl_scriptcache_dict,key,NULL);
-    listAddNodeHead(server.repl_scriptcache_fifo,key);
-    serverAssert(retval == DICT_OK);
-}
-
-/* Returns non-zero if the specified entry exists inside the cache, that is,
- * if all the slaves are aware of this script SHA1. */
-int replicationScriptCacheExists(sds sha1) {
-    return dictFind(server.repl_scriptcache_dict,sha1) != NULL;
-}
-
-/* ----------------------- SYNCHRONOUS REPLICATION --------------------------
- * Redis synchronous replication design can be summarized in points:
- *
- * - Redis masters have a global replication offset, used by PSYNC.
- * - Master increment the offset every time new commands are sent to slaves.
- * - Slaves ping back masters with the offset processed so far.
- *
- * So synchronous replication adds a new WAIT command in the form:
- *
- *   WAIT <num_replicas> <milliseconds_timeout>
- *
- * That returns the number of replicas that processed the query when
- * we finally have at least num_replicas, or when the timeout was
- * reached.
- *
- * The command is implemented in this way:
- *
- * - Every time a client processes a command, we remember the replication
- *   offset after sending that command to the slaves.
- * - When WAIT is called, we ask slaves to send an acknowledgement ASAP.
- *   The client is blocked at the same time (see blocked.c).
- * - Once we receive enough ACKs for a given offset or when the timeout
- *   is reached, the WAIT command is unblocked and the reply sent to the
- *   client.
- */
-
-/* This just set a flag so that we broadcast a REPLCONF GETACK command
- * to all the slaves in the beforeSleep() function. Note that this way
- * we "group" all the clients that want to wait for synchronous replication
- * in a given event loop iteration, and send a single GETACK for them all. */
-void replicationRequestAckFromSlaves(void) {
-    server.get_ack_from_slaves = 1;
-}
-
-/* Return the number of slaves that already acknowledged the specified
- * replication offset. */
-int replicationCountAcksByOffset(long long offset) {
-    listIter li;
-    listNode *ln;
-    int count = 0;
-
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-
-        if (slave->replstate != SLAVE_STATE_ONLINE) continue;
-        if (slave->repl_ack_off >= offset) count++;
-    }
-    return count;
-}
-
-/* WAIT for N replicas to acknowledge the processing of our latest
- * write command (and all the previous commands). */
-void waitCommand(client *c) {
-    mstime_t timeout;
-    long numreplicas, ackreplicas;
-    long long offset = c->woff;
-
-    if (server.masterhost) {
-        addReplyError(c,"WAIT cannot be used with replica instances. Please also note that since Redis 4.0 if a replica is configured to be writable (which is not the default) writes to replicas are just local and are not propagated.");
-        return;
-    }
-
-    /* Argument parsing. */
-    if (getLongFromObjectOrReply(c,c->argv[1],&numreplicas,NULL) != C_OK)
-        return;
-    if (getTimeoutFromObjectOrReply(c,c->argv[2],&timeout,UNIT_MILLISECONDS)
-        != C_OK) return;
-
-    /* First try without blocking at all. */
-    ackreplicas = replicationCountAcksByOffset(c->woff);
-    if (ackreplicas >= numreplicas || c->flags & CLIENT_MULTI) {
-        addReplyLongLong(c,ackreplicas);
-        return;
-    }
-
-    /* Otherwise block the client and put it into our list of clients
-     * waiting for ack from slaves. */
-    c->bpop.timeout = timeout;
-    c->bpop.reploffset = offset;
-    c->bpop.numreplicas = numreplicas;
-    listAddNodeHead(server.clients_waiting_acks,c);
-    blockClient(c,BLOCKED_WAIT);
-
-    /* Make sure that the server will send an ACK request to all the slaves
-     * before returning to the event loop. */
-    replicationRequestAckFromSlaves();
-}
-
-/* This is called by unblockClient() to perform the blocking op type
- * specific cleanup. We just remove the client from the list of clients
- * waiting for replica acks. Never call it directly, call unblockClient()
- * instead. */
-void unblockClientWaitingReplicas(client *c) {
-    listNode *ln = listSearchKey(server.clients_waiting_acks,c);
-    serverAssert(ln != NULL);
-    listDelNode(server.clients_waiting_acks,ln);
-}
-
-/* Check if there are clients blocked in WAIT that can be unblocked since
- * we received enough ACKs from slaves. */
-void processClientsWaitingReplicas(void) {
-    long long last_offset = 0;
-    int last_numreplicas = 0;
-
-    listIter li;
-    listNode *ln;
-
-    listRewind(server.clients_waiting_acks,&li);
-    while((ln = listNext(&li))) {
-        client *c = ln->value;
-
-        /* Every time we find a client that is satisfied for a given
-         * offset and number of replicas, we remember it so the next client
-         * may be unblocked without calling replicationCountAcksByOffset()
-         * if the requested offset / replicas were equal or less. */
-        if (last_offset && last_offset >= c->bpop.reploffset &&
-                           last_numreplicas >= c->bpop.numreplicas)
-        {
-            unblockClient(c);
-            addReplyLongLong(c,last_numreplicas);
-        } else {
-            int numreplicas = replicationCountAcksByOffset(c->bpop.reploffset);
-
-            if (numreplicas >= c->bpop.numreplicas) {
-                last_offset = c->bpop.reploffset;
-                last_numreplicas = numreplicas;
-                unblockClient(c);
-                addReplyLongLong(c,numreplicas);
-            }
-        }
-    }
-}
-
-/* Return the slave replication offset for this instance, that is
- * the offset for which we already processed the master replication stream. */
-long long replicationGetSlaveOffset(void) {
-    long long offset = 0;
-
-    if (server.masterhost != NULL) {
-        if (server.master) {
-            offset = server.master->reploff;
-        } else if (server.cached_master) {
-            offset = server.cached_master->reploff;
-        }
-    }
-    /* offset may be -1 when the master does not support it at all, however
-     * this function is designed to return an offset that can express the
-     * amount of data processed by the master, so we return a positive
-     * integer. */
-    if (offset < 0) offset = 0;
-    return offset;
-}
-
-/* --------------------------- REPLICATION CRON  ---------------------------- */
-
-/* Replication cron function, called 1 time per second. */
-void replicationCron(void) {
-    static long long replication_cron_loops = 0;
-
-    /* Check failover status first, to see if we need to start
-     * handling the failover. */
-    updateFailoverStatus();
-
-    /* Non blocking connection timeout? */
-    if (server.masterhost &&
-        (server.repl_state == REPL_STATE_CONNECTING ||
-         slaveIsInHandshakeState()) &&
-         (time(NULL)-server.repl_transfer_lastio) > server.repl_timeout)
-    {
-        serverLog(LL_WARNING,"Timeout connecting to the MASTER...");
-        cancelReplicationHandshake(1);
-    }
-
-    /* Bulk transfer I/O timeout? */
-    if (server.masterhost && server.repl_state == REPL_STATE_TRANSFER &&
-        (time(NULL)-server.repl_transfer_lastio) > server.repl_timeout)
-    {
-        serverLog(LL_WARNING,"Timeout receiving bulk data from MASTER... If the problem persists try to set the 'repl-timeout' parameter in redis.conf to a larger value.");
-        cancelReplicationHandshake(1);
-    }
-
-    /* Timed out master when we are an already connected slave? */
-    if (server.masterhost && server.repl_state == REPL_STATE_CONNECTED &&
-        (time(NULL)-server.master->lastinteraction) > server.repl_timeout)
-    {
-        serverLog(LL_WARNING,"MASTER timeout: no data nor PING received...");
-        freeClient(server.master);
-    }
-
-    /* Check if we should connect to a MASTER */
-    if (server.repl_state == REPL_STATE_CONNECT) {
-        serverLog(LL_NOTICE,"Connecting to MASTER %s:%d",
-            server.masterhost, server.masterport);
-        connectWithMaster();
-    }
-
-    /* Send ACK to master from time to time.
-     * Note that we do not send periodic acks to masters that don't
-     * support PSYNC and replication offsets. */
-    if (server.masterhost && server.master &&
-        !(server.master->flags & CLIENT_PRE_PSYNC))
-        replicationSendAck();
-
-    /* If we have attached slaves, PING them from time to time.
-     * So slaves can implement an explicit timeout to masters, and will
-     * be able to detect a link disconnection even if the TCP connection
-     * will not actually go down. */
-    listIter li;
-    listNode *ln;
-    robj *ping_argv[1];
-
-    /* First, send PING according to ping_slave_period. */
-    if ((replication_cron_loops % server.repl_ping_slave_period) == 0 &&
-        listLength(server.slaves))
-    {
-        /* Note that we don't send the PING if the clients are paused during
-         * a Redis Cluster manual failover: the PING we send will otherwise
-         * alter the replication offsets of master and slave, and will no longer
-         * match the one stored into 'mf_master_offset' state. */
-        int manual_failover_in_progress =
-            ((server.cluster_enabled &&
-              server.cluster->mf_end) ||
-            server.failover_end_time) &&
-            checkClientPauseTimeoutAndReturnIfPaused();
-
-        if (!manual_failover_in_progress) {
-            ping_argv[0] = shared.ping;
-            replicationFeedSlaves(server.slaves, server.slaveseldb,
-                ping_argv, 1);
-        }
-    }
-
-    /* Second, send a newline to all the slaves in pre-synchronization
-     * stage, that is, slaves waiting for the master to create the RDB file.
-     *
-     * Also send the a newline to all the chained slaves we have, if we lost
-     * connection from our master, to keep the slaves aware that their
-     * master is online. This is needed since sub-slaves only receive proxied
-     * data from top-level masters, so there is no explicit pinging in order
-     * to avoid altering the replication offsets. This special out of band
-     * pings (newlines) can be sent, they will have no effect in the offset.
-     *
-     * The newline will be ignored by the slave but will refresh the
-     * last interaction timer preventing a timeout. In this case we ignore the
-     * ping period and refresh the connection once per second since certain
-     * timeouts are set at a few seconds (example: PSYNC response). */
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        client *slave = ln->value;
-
-        int is_presync =
-            (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START ||
-            (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END &&
-             server.rdb_child_type != RDB_CHILD_TYPE_SOCKET));
-
-        if (is_presync) {
-            connWrite(slave->conn, "\n", 1);
-        }
-    }
-
-    /* Disconnect timedout slaves. */
-    if (listLength(server.slaves)) {
-        listIter li;
-        listNode *ln;
-
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-
-            if (slave->replstate == SLAVE_STATE_ONLINE) {
-                if (slave->flags & CLIENT_PRE_PSYNC)
-                    continue;
-                if ((server.unixtime - slave->repl_ack_time) > server.repl_timeout) {
-                    serverLog(LL_WARNING, "Disconnecting timedout replica (streaming sync): %s",
-                          replicationGetSlaveName(slave));
-                    freeClient(slave);
-                    continue;
-                }
-            }
-            /* We consider disconnecting only diskless replicas because disk-based replicas aren't fed
-             * by the fork child so if a disk-based replica is stuck it doesn't prevent the fork child
-             * from terminating. */
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_END && server.rdb_child_type == RDB_CHILD_TYPE_SOCKET) {
-                if (slave->repl_last_partial_write != 0 &&
-                    (server.unixtime - slave->repl_last_partial_write) > server.repl_timeout)
-                {
-                    serverLog(LL_WARNING, "Disconnecting timedout replica (full sync): %s",
-                          replicationGetSlaveName(slave));
-                    freeClient(slave);
-                    continue;
-                }
-            }
-        }
-    }
-
-    /* If this is a master without attached slaves and there is a replication
-     * backlog active, in order to reclaim memory we can free it after some
-     * (configured) time. Note that this cannot be done for slaves: slaves
-     * without sub-slaves attached should still accumulate data into the
-     * backlog, in order to reply to PSYNC queries if they are turned into
-     * masters after a failover. */
-    if (listLength(server.slaves) == 0 && server.repl_backlog_time_limit &&
-        server.repl_backlog && server.masterhost == NULL)
-    {
-        time_t idle = server.unixtime - server.repl_no_slaves_since;
-
-        if (idle > server.repl_backlog_time_limit) {
-            /* When we free the backlog, we always use a new
-             * replication ID and clear the ID2. This is needed
-             * because when there is no backlog, the master_repl_offset
-             * is not updated, but we would still retain our replication
-             * ID, leading to the following problem:
-             *
-             * 1. We are a master instance.
-             * 2. Our slave is promoted to master. It's repl-id-2 will
-             *    be the same as our repl-id.
-             * 3. We, yet as master, receive some updates, that will not
-             *    increment the master_repl_offset.
-             * 4. Later we are turned into a slave, connect to the new
-             *    master that will accept our PSYNC request by second
-             *    replication ID, but there will be data inconsistency
-             *    because we received writes. */
-            changeReplicationId();
-            clearReplicationId2();
-            freeReplicationBacklog();
-            serverLog(LL_NOTICE,
-                "Replication backlog freed after %d seconds "
-                "without connected replicas.",
-                (int) server.repl_backlog_time_limit);
-        }
-    }
-
-    /* If AOF is disabled and we no longer have attached slaves, we can
-     * free our Replication Script Cache as there is no need to propagate
-     * EVALSHA at all. */
-    if (listLength(server.slaves) == 0 &&
-        server.aof_state == AOF_OFF &&
-        listLength(server.repl_scriptcache_fifo) != 0)
-    {
-        replicationScriptCacheFlush();
-    }
-
-    replicationStartPendingFork();
-
-    /* Remove the RDB file used for replication if Redis is not running
-     * with any persistence. */
-    removeRDBUsedToSyncReplicas();
-
-    /* Refresh the number of slaves with lag <= min-slaves-max-lag. */
-    refreshGoodSlavesCount();
-    replication_cron_loops++; /* Incremented with frequency 1 HZ. */
-}
-
-void replicationStartPendingFork(void) {
-    /* Start a BGSAVE good for replication if we have slaves in
-     * WAIT_BGSAVE_START state.
-     *
-     * In case of diskless replication, we make sure to wait the specified
-     * number of seconds (according to configuration) so that other slaves
-     * have the time to arrive before we start streaming. */
-    if (!hasActiveChildProcess()) {
-        time_t idle, max_idle = 0;
-        int slaves_waiting = 0;
-        int mincapa = -1;
-        listNode *ln;
-        listIter li;
-
-        listRewind(server.slaves,&li);
-        while((ln = listNext(&li))) {
-            client *slave = ln->value;
-            if (slave->replstate == SLAVE_STATE_WAIT_BGSAVE_START) {
-                idle = server.unixtime - slave->lastinteraction;
-                if (idle > max_idle) max_idle = idle;
-                slaves_waiting++;
-                mincapa = (mincapa == -1) ? slave->slave_capa :
-                                            (mincapa & slave->slave_capa);
-            }
-        }
-
-        if (slaves_waiting &&
-            (!server.repl_diskless_sync ||
-             max_idle >= server.repl_diskless_sync_delay))
-        {
-            /* Start the BGSAVE. The called function may start a
-             * BGSAVE with socket target or disk target depending on the
-             * configuration and slaves capabilities. */
-            startBgsaveForReplication(mincapa);
-        }
-    }
-}
-
-/* Find replica at IP:PORT from replica list */
-static client *findReplica(char *host, int port) {
-    listIter li;
-    listNode *ln;
-    client *replica;
-
-    listRewind(server.slaves,&li);
-    while((ln = listNext(&li))) {
-        replica = ln->value;
-        char ip[NET_IP_STR_LEN], *replicaip = replica->slave_addr;
-
-        if (!replicaip) {
-            if (connPeerToString(replica->conn, ip, sizeof(ip), NULL) == -1)
-                continue;
-            replicaip = ip;
-        }
-
-        if (!strcasecmp(host, replicaip) &&
-                (port == replica->slave_listening_port))
-            return replica;
-    }
-
-    return NULL;
-}
-
-const char *getFailoverStateString() {
-    switch(server.failover_state) {
-        case NO_FAILOVER: return "no-failover";
-        case FAILOVER_IN_PROGRESS: return "failover-in-progress";
-        case FAILOVER_WAIT_FOR_SYNC: return "waiting-for-sync";
-        default: return "unknown";
-    }
-}
-
-/* Resets the internal failover configuration, this needs
- * to be called after a failover either succeeds or fails
- * as it includes the client unpause. */
-void clearFailoverState() {
-    server.failover_end_time = 0;
-    server.force_failover = 0;
-    zfree(server.target_replica_host);
-    server.target_replica_host = NULL;
-    server.target_replica_port = 0;
-    server.failover_state = NO_FAILOVER;
-    unpauseClients();
-}
-
-/* Abort an ongoing failover if one is going on. */
-void abortFailover(const char *err) {
-    if (server.failover_state == NO_FAILOVER) return;
-
-    if (server.target_replica_host) {
-        serverLog(LL_NOTICE,"FAILOVER to %s:%d aborted: %s",
-            server.target_replica_host,server.target_replica_port,err);  
-    } else {
-        serverLog(LL_NOTICE,"FAILOVER to any replica aborted: %s",err);  
-    }
-    if (server.failover_state == FAILOVER_IN_PROGRESS) {
-        replicationUnsetMaster();
-    }
-    clearFailoverState();
-}
-
-/* 
- * FAILOVER [TO <HOST> <PORT> [FORCE]] [ABORT] [TIMEOUT <timeout>]
- * 
- * This command will coordinate a failover between the master and one
- * of its replicas. The happy path contains the following steps:
- * 1) The master will initiate a client pause write, to stop replication
- * traffic.
- * 2) The master will periodically check if any of its replicas has
- * consumed the entire replication stream through acks. 
- * 3) Once any replica has caught up, the master will itself become a replica.
- * 4) The master will send a PSYNC FAILOVER request to the target replica, which
- * if accepted will cause the replica to become the new master and start a sync.
- * 
- * FAILOVER ABORT is the only way to abort a failover command, as replicaof
- * will be disabled. This may be needed if the failover is unable to progress. 
- * 
- * The optional arguments [TO <HOST> <IP>] allows designating a specific replica
- * to be failed over to.
- * 
- * FORCE flag indicates that even if the target replica is not caught up,
- * failover to it anyway. This must be specified with a timeout and a target
- * HOST and IP.
- * 
- * TIMEOUT <timeout> indicates how long should the primary wait for 
- * a replica to sync up before aborting. If not specified, the failover
- * will attempt forever and must be manually aborted.
- */
-void failoverCommand(client *c) {
-    if (server.cluster_enabled) {
-        addReplyError(c,"FAILOVER not allowed in cluster mode. "
-                        "Use CLUSTER FAILOVER command instead.");
-        return;
-    }
-    
-    /* Handle special case for abort */
-    if ((c->argc == 2) && !strcasecmp(c->argv[1]->ptr,"abort")) {
-        if (server.failover_state == NO_FAILOVER) {
-            addReplyError(c, "No failover in progress.");
-            return;
-        }
-
-        abortFailover("Failover manually aborted");
-        addReply(c,shared.ok);
-        return;
-    }
-
-    long timeout_in_ms = 0;
-    int force_flag = 0;
-    long port = 0;
-    char *host = NULL;
-
-    /* Parse the command for syntax and arguments. */
-    for (int j = 1; j < c->argc; j++) {
-        if (!strcasecmp(c->argv[j]->ptr,"timeout") && (j + 1 < c->argc) &&
-            timeout_in_ms == 0)
-        {
-            if (getLongFromObjectOrReply(c,c->argv[j + 1],
-                        &timeout_in_ms,NULL) != C_OK) return;
-            if (timeout_in_ms <= 0) {
-                addReplyError(c,"FAILOVER timeout must be greater than 0");
-                return;
-            }
-            j++;
-        } else if (!strcasecmp(c->argv[j]->ptr,"to") && (j + 2 < c->argc) &&
-            !host) 
-        {
-            if (getLongFromObjectOrReply(c,c->argv[j + 2],&port,NULL) != C_OK)
-                return;
-            host = c->argv[j + 1]->ptr;
-            j += 2;
-        } else if (!strcasecmp(c->argv[j]->ptr,"force") && !force_flag) {
-            force_flag = 1;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    if (server.failover_state != NO_FAILOVER) {
-        addReplyError(c,"FAILOVER already in progress.");
-        return;
-    }
-
-    if (server.masterhost) {
-        addReplyError(c,"FAILOVER is not valid when server is a replica.");
-        return;
-    }
-
-    if (listLength(server.slaves) == 0) {
-        addReplyError(c,"FAILOVER requires connected replicas.");
-        return; 
-    }
-
-    if (force_flag && (!timeout_in_ms || !host)) {
-        addReplyError(c,"FAILOVER with force option requires both a timeout "
-            "and target HOST and IP.");
-        return;     
-    }
-
-    /* If a replica address was provided, validate that it is connected. */
-    if (host) {
-        client *replica = findReplica(host, port);
-
-        if (replica == NULL) {
-            addReplyError(c,"FAILOVER target HOST and PORT is not "
-                            "a replica.");
-            return;
-        }
-
-        /* Check if requested replica is online */
-        if (replica->replstate != SLAVE_STATE_ONLINE) {
-            addReplyError(c,"FAILOVER target replica is not online.");
-            return;
-        }
-
-        server.target_replica_host = zstrdup(host);
-        server.target_replica_port = port;
-        serverLog(LL_NOTICE,"FAILOVER requested to %s:%ld.",host,port);
-    } else {
-        serverLog(LL_NOTICE,"FAILOVER requested to any replica.");
-    }
-
-    mstime_t now = mstime();
-    if (timeout_in_ms) {
-        server.failover_end_time = now + timeout_in_ms;
-    }
-    
-    server.force_failover = force_flag;
-    server.failover_state = FAILOVER_WAIT_FOR_SYNC;
-    /* Cluster failover will unpause eventually */
-    pauseClients(LLONG_MAX,CLIENT_PAUSE_WRITE);
-    addReply(c,shared.ok);
-}
-
-/* Failover cron function, checks coordinated failover state. 
- *
- * Implementation note: The current implementation calls replicationSetMaster()
- * to start the failover request, this has some unintended side effects if the
- * failover doesn't work like blocked clients will be unblocked and replicas will
- * be disconnected. This could be optimized further.
- */
-void updateFailoverStatus(void) {
-    if (server.failover_state != FAILOVER_WAIT_FOR_SYNC) return;
-    mstime_t now = server.mstime;
-
-    /* Check if failover operation has timed out */
-    if (server.failover_end_time && server.failover_end_time <= now) {
-        if (server.force_failover) {
-            serverLog(LL_NOTICE,
-                "FAILOVER to %s:%d time out exceeded, failing over.",
-                server.target_replica_host, server.target_replica_port);
-            server.failover_state = FAILOVER_IN_PROGRESS;
-            /* If timeout has expired force a failover if requested. */
-            replicationSetMaster(server.target_replica_host,
-                server.target_replica_port);
-            return;
-        } else {
-            /* Force was not requested, so timeout. */
-            abortFailover("Replica never caught up before timeout");
-            return;
-        }
-    }
-
-    /* Check to see if the replica has caught up so failover can start */
-    client *replica = NULL;
-    if (server.target_replica_host) {
-        replica = findReplica(server.target_replica_host, 
-            server.target_replica_port);
-    } else {
-        listIter li;
-        listNode *ln;
-
-        listRewind(server.slaves,&li);
-        /* Find any replica that has matched our repl_offset */
-        while((ln = listNext(&li))) {
-            replica = ln->value;
-            if (replica->repl_ack_off == server.master_repl_offset) {
-                char ip[NET_IP_STR_LEN], *replicaaddr = replica->slave_addr;
-
-                if (!replicaaddr) {
-                    if (connPeerToString(replica->conn,ip,sizeof(ip),NULL) == -1)
-                        continue;
-                    replicaaddr = ip;
-                }
-
-                /* We are now failing over to this specific node */
-                server.target_replica_host = zstrdup(replicaaddr);
-                server.target_replica_port = replica->slave_listening_port;
-                break;
-            }
-        }
-    }
-
-    /* We've found a replica that is caught up */
-    if (replica && (replica->repl_ack_off == server.master_repl_offset)) {
-        server.failover_state = FAILOVER_IN_PROGRESS;
-        serverLog(LL_NOTICE,
-                "Failover target %s:%d is synced, failing over.",
-                server.target_replica_host, server.target_replica_port);
-        /* Designated replica is caught up, failover to it. */
-        replicationSetMaster(server.target_replica_host,
-            server.target_replica_port);
-    }
-}
diff --git a/redis-stable/src/rio.c b/redis-stable/src/rio.c
deleted file mode 100644
index 0d107708..00000000
--- a/redis-stable/src/rio.c
+++ /dev/null
@@ -1,448 +0,0 @@
-/* rio.c is a simple stream-oriented I/O abstraction that provides an interface
- * to write code that can consume/produce data using different concrete input
- * and output devices. For instance the same rdb.c code using the rio
- * abstraction can be used to read and write the RDB format using in-memory
- * buffers or files.
- *
- * A rio object provides the following methods:
- *  read: read from stream.
- *  write: write to stream.
- *  tell: get the current offset.
- *
- * It is also possible to set a 'checksum' method that is used by rio.c in order
- * to compute a checksum of the data written or read, or to query the rio object
- * for the current checksum.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "fmacros.h"
-#include <string.h>
-#include <stdio.h>
-#include <unistd.h>
-#include "rio.h"
-#include "util.h"
-#include "crc64.h"
-#include "config.h"
-#include "server.h"
-
-/* ------------------------- Buffer I/O implementation ----------------------- */
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioBufferWrite(rio *r, const void *buf, size_t len) {
-    r->io.buffer.ptr = sdscatlen(r->io.buffer.ptr,(char*)buf,len);
-    r->io.buffer.pos += len;
-    return 1;
-}
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioBufferRead(rio *r, void *buf, size_t len) {
-    if (sdslen(r->io.buffer.ptr)-r->io.buffer.pos < len)
-        return 0; /* not enough buffer to return len bytes. */
-    memcpy(buf,r->io.buffer.ptr+r->io.buffer.pos,len);
-    r->io.buffer.pos += len;
-    return 1;
-}
-
-/* Returns read/write position in buffer. */
-static off_t rioBufferTell(rio *r) {
-    return r->io.buffer.pos;
-}
-
-/* Flushes any buffer to target device if applicable. Returns 1 on success
- * and 0 on failures. */
-static int rioBufferFlush(rio *r) {
-    UNUSED(r);
-    return 1; /* Nothing to do, our write just appends to the buffer. */
-}
-
-static const rio rioBufferIO = {
-    rioBufferRead,
-    rioBufferWrite,
-    rioBufferTell,
-    rioBufferFlush,
-    NULL,           /* update_checksum */
-    0,              /* current checksum */
-    0,              /* flags */
-    0,              /* bytes read or written */
-    0,              /* read/write chunk size */
-    { { NULL, 0 } } /* union for io-specific vars */
-};
-
-void rioInitWithBuffer(rio *r, sds s) {
-    *r = rioBufferIO;
-    r->io.buffer.ptr = s;
-    r->io.buffer.pos = 0;
-}
-
-/* --------------------- Stdio file pointer implementation ------------------- */
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioFileWrite(rio *r, const void *buf, size_t len) {
-    size_t retval;
-
-    retval = fwrite(buf,len,1,r->io.file.fp);
-    r->io.file.buffered += len;
-
-    if (r->io.file.autosync &&
-        r->io.file.buffered >= r->io.file.autosync)
-    {
-        fflush(r->io.file.fp);
-        if (redis_fsync(fileno(r->io.file.fp)) == -1) return 0;
-        r->io.file.buffered = 0;
-    }
-    return retval;
-}
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioFileRead(rio *r, void *buf, size_t len) {
-    return fread(buf,len,1,r->io.file.fp);
-}
-
-/* Returns read/write position in file. */
-static off_t rioFileTell(rio *r) {
-    return ftello(r->io.file.fp);
-}
-
-/* Flushes any buffer to target device if applicable. Returns 1 on success
- * and 0 on failures. */
-static int rioFileFlush(rio *r) {
-    return (fflush(r->io.file.fp) == 0) ? 1 : 0;
-}
-
-static const rio rioFileIO = {
-    rioFileRead,
-    rioFileWrite,
-    rioFileTell,
-    rioFileFlush,
-    NULL,           /* update_checksum */
-    0,              /* current checksum */
-    0,              /* flags */
-    0,              /* bytes read or written */
-    0,              /* read/write chunk size */
-    { { NULL, 0 } } /* union for io-specific vars */
-};
-
-void rioInitWithFile(rio *r, FILE *fp) {
-    *r = rioFileIO;
-    r->io.file.fp = fp;
-    r->io.file.buffered = 0;
-    r->io.file.autosync = 0;
-}
-
-/* ------------------- Connection implementation -------------------
- * We use this RIO implementation when reading an RDB file directly from
- * the connection to the memory via rdbLoadRio(), thus this implementation
- * only implements reading from a connection that is, normally,
- * just a socket. */
-
-static size_t rioConnWrite(rio *r, const void *buf, size_t len) {
-    UNUSED(r);
-    UNUSED(buf);
-    UNUSED(len);
-    return 0; /* Error, this target does not yet support writing. */
-}
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioConnRead(rio *r, void *buf, size_t len) {
-    size_t avail = sdslen(r->io.conn.buf)-r->io.conn.pos;
-
-    /* If the buffer is too small for the entire request: realloc. */
-    if (sdslen(r->io.conn.buf) + sdsavail(r->io.conn.buf) < len)
-        r->io.conn.buf = sdsMakeRoomFor(r->io.conn.buf, len - sdslen(r->io.conn.buf));
-
-    /* If the remaining unused buffer is not large enough: memmove so that we
-     * can read the rest. */
-    if (len > avail && sdsavail(r->io.conn.buf) < len - avail) {
-        sdsrange(r->io.conn.buf, r->io.conn.pos, -1);
-        r->io.conn.pos = 0;
-    }
-
-    /* If we don't already have all the data in the sds, read more */
-    while (len > sdslen(r->io.conn.buf) - r->io.conn.pos) {
-        size_t buffered = sdslen(r->io.conn.buf) - r->io.conn.pos;
-        size_t needs = len - buffered;
-        /* Read either what's missing, or PROTO_IOBUF_LEN, the bigger of
-         * the two. */
-        size_t toread = needs < PROTO_IOBUF_LEN ? PROTO_IOBUF_LEN: needs;
-        if (toread > sdsavail(r->io.conn.buf)) toread = sdsavail(r->io.conn.buf);
-        if (r->io.conn.read_limit != 0 &&
-            r->io.conn.read_so_far + buffered + toread > r->io.conn.read_limit)
-        {
-            /* Make sure the caller didn't request to read past the limit.
-             * If they didn't we'll buffer till the limit, if they did, we'll
-             * return an error. */
-            if (r->io.conn.read_limit >= r->io.conn.read_so_far + len)
-                toread = r->io.conn.read_limit - r->io.conn.read_so_far - buffered;
-            else {
-                errno = EOVERFLOW;
-                return 0;
-            }
-        }
-        int retval = connRead(r->io.conn.conn,
-                          (char*)r->io.conn.buf + sdslen(r->io.conn.buf),
-                          toread);
-        if (retval <= 0) {
-            if (errno == EWOULDBLOCK) errno = ETIMEDOUT;
-            return 0;
-        }
-        sdsIncrLen(r->io.conn.buf, retval);
-    }
-
-    memcpy(buf, (char*)r->io.conn.buf + r->io.conn.pos, len);
-    r->io.conn.read_so_far += len;
-    r->io.conn.pos += len;
-    return len;
-}
-
-/* Returns read/write position in file. */
-static off_t rioConnTell(rio *r) {
-    return r->io.conn.read_so_far;
-}
-
-/* Flushes any buffer to target device if applicable. Returns 1 on success
- * and 0 on failures. */
-static int rioConnFlush(rio *r) {
-    /* Our flush is implemented by the write method, that recognizes a
-     * buffer set to NULL with a count of zero as a flush request. */
-    return rioConnWrite(r,NULL,0);
-}
-
-static const rio rioConnIO = {
-    rioConnRead,
-    rioConnWrite,
-    rioConnTell,
-    rioConnFlush,
-    NULL,           /* update_checksum */
-    0,              /* current checksum */
-    0,              /* flags */
-    0,              /* bytes read or written */
-    0,              /* read/write chunk size */
-    { { NULL, 0 } } /* union for io-specific vars */
-};
-
-/* Create an RIO that implements a buffered read from an fd
- * read_limit argument stops buffering when the reaching the limit. */
-void rioInitWithConn(rio *r, connection *conn, size_t read_limit) {
-    *r = rioConnIO;
-    r->io.conn.conn = conn;
-    r->io.conn.pos = 0;
-    r->io.conn.read_limit = read_limit;
-    r->io.conn.read_so_far = 0;
-    r->io.conn.buf = sdsnewlen(NULL, PROTO_IOBUF_LEN);
-    sdsclear(r->io.conn.buf);
-}
-
-/* Release the RIO stream. Optionally returns the unread buffered data
- * when the SDS pointer 'remaining' is passed. */
-void rioFreeConn(rio *r, sds *remaining) {
-    if (remaining && (size_t)r->io.conn.pos < sdslen(r->io.conn.buf)) {
-        if (r->io.conn.pos > 0) sdsrange(r->io.conn.buf, r->io.conn.pos, -1);
-        *remaining = r->io.conn.buf;
-    } else {
-        sdsfree(r->io.conn.buf);
-        if (remaining) *remaining = NULL;
-    }
-    r->io.conn.buf = NULL;
-}
-
-/* ------------------- File descriptor implementation ------------------
- * This target is used to write the RDB file to pipe, when the master just
- * streams the data to the replicas without creating an RDB on-disk image
- * (diskless replication option).
- * It only implements writes. */
-
-/* Returns 1 or 0 for success/failure.
- *
- * When buf is NULL and len is 0, the function performs a flush operation
- * if there is some pending buffer, so this function is also used in order
- * to implement rioFdFlush(). */
-static size_t rioFdWrite(rio *r, const void *buf, size_t len) {
-    ssize_t retval;
-    unsigned char *p = (unsigned char*) buf;
-    int doflush = (buf == NULL && len == 0);
-
-    /* For small writes, we rather keep the data in user-space buffer, and flush
-     * it only when it grows. however for larger writes, we prefer to flush
-     * any pre-existing buffer, and write the new one directly without reallocs
-     * and memory copying. */
-    if (len > PROTO_IOBUF_LEN) {
-        /* First, flush any pre-existing buffered data. */
-        if (sdslen(r->io.fd.buf)) {
-            if (rioFdWrite(r, NULL, 0) == 0)
-                return 0;
-        }
-        /* Write the new data, keeping 'p' and 'len' from the input. */
-    } else {
-        if (len) {
-            r->io.fd.buf = sdscatlen(r->io.fd.buf,buf,len);
-            if (sdslen(r->io.fd.buf) > PROTO_IOBUF_LEN)
-                doflush = 1;
-            if (!doflush)
-                return 1;
-        }
-        /* Flusing the buffered data. set 'p' and 'len' accordintly. */
-        p = (unsigned char*) r->io.fd.buf;
-        len = sdslen(r->io.fd.buf);
-    }
-
-    size_t nwritten = 0;
-    while(nwritten != len) {
-        retval = write(r->io.fd.fd,p+nwritten,len-nwritten);
-        if (retval <= 0) {
-            /* With blocking io, which is the sole user of this
-             * rio target, EWOULDBLOCK is returned only because of
-             * the SO_SNDTIMEO socket option, so we translate the error
-             * into one more recognizable by the user. */
-            if (retval == -1 && errno == EWOULDBLOCK) errno = ETIMEDOUT;
-            return 0; /* error. */
-        }
-        nwritten += retval;
-    }
-
-    r->io.fd.pos += len;
-    sdsclear(r->io.fd.buf);
-    return 1;
-}
-
-/* Returns 1 or 0 for success/failure. */
-static size_t rioFdRead(rio *r, void *buf, size_t len) {
-    UNUSED(r);
-    UNUSED(buf);
-    UNUSED(len);
-    return 0; /* Error, this target does not support reading. */
-}
-
-/* Returns read/write position in file. */
-static off_t rioFdTell(rio *r) {
-    return r->io.fd.pos;
-}
-
-/* Flushes any buffer to target device if applicable. Returns 1 on success
- * and 0 on failures. */
-static int rioFdFlush(rio *r) {
-    /* Our flush is implemented by the write method, that recognizes a
-     * buffer set to NULL with a count of zero as a flush request. */
-    return rioFdWrite(r,NULL,0);
-}
-
-static const rio rioFdIO = {
-    rioFdRead,
-    rioFdWrite,
-    rioFdTell,
-    rioFdFlush,
-    NULL,           /* update_checksum */
-    0,              /* current checksum */
-    0,              /* flags */
-    0,              /* bytes read or written */
-    0,              /* read/write chunk size */
-    { { NULL, 0 } } /* union for io-specific vars */
-};
-
-void rioInitWithFd(rio *r, int fd) {
-    *r = rioFdIO;
-    r->io.fd.fd = fd;
-    r->io.fd.pos = 0;
-    r->io.fd.buf = sdsempty();
-}
-
-/* release the rio stream. */
-void rioFreeFd(rio *r) {
-    sdsfree(r->io.fd.buf);
-}
-
-/* ---------------------------- Generic functions ---------------------------- */
-
-/* This function can be installed both in memory and file streams when checksum
- * computation is needed. */
-void rioGenericUpdateChecksum(rio *r, const void *buf, size_t len) {
-    r->cksum = crc64(r->cksum,buf,len);
-}
-
-/* Set the file-based rio object to auto-fsync every 'bytes' file written.
- * By default this is set to zero that means no automatic file sync is
- * performed.
- *
- * This feature is useful in a few contexts since when we rely on OS write
- * buffers sometimes the OS buffers way too much, resulting in too many
- * disk I/O concentrated in very little time. When we fsync in an explicit
- * way instead the I/O pressure is more distributed across time. */
-void rioSetAutoSync(rio *r, off_t bytes) {
-    if(r->write != rioFileIO.write) return;
-    r->io.file.autosync = bytes;
-}
-
-/* --------------------------- Higher level interface --------------------------
- *
- * The following higher level functions use lower level rio.c functions to help
- * generating the Redis protocol for the Append Only File. */
-
-/* Write multi bulk count in the format: "*<count>\r\n". */
-size_t rioWriteBulkCount(rio *r, char prefix, long count) {
-    char cbuf[128];
-    int clen;
-
-    cbuf[0] = prefix;
-    clen = 1+ll2string(cbuf+1,sizeof(cbuf)-1,count);
-    cbuf[clen++] = '\r';
-    cbuf[clen++] = '\n';
-    if (rioWrite(r,cbuf,clen) == 0) return 0;
-    return clen;
-}
-
-/* Write binary-safe string in the format: "$<count>\r\n<payload>\r\n". */
-size_t rioWriteBulkString(rio *r, const char *buf, size_t len) {
-    size_t nwritten;
-
-    if ((nwritten = rioWriteBulkCount(r,'$',len)) == 0) return 0;
-    if (len > 0 && rioWrite(r,buf,len) == 0) return 0;
-    if (rioWrite(r,"\r\n",2) == 0) return 0;
-    return nwritten+len+2;
-}
-
-/* Write a long long value in format: "$<count>\r\n<payload>\r\n". */
-size_t rioWriteBulkLongLong(rio *r, long long l) {
-    char lbuf[32];
-    unsigned int llen;
-
-    llen = ll2string(lbuf,sizeof(lbuf),l);
-    return rioWriteBulkString(r,lbuf,llen);
-}
-
-/* Write a double value in the format: "$<count>\r\n<payload>\r\n" */
-size_t rioWriteBulkDouble(rio *r, double d) {
-    char dbuf[128];
-    unsigned int dlen;
-
-    dlen = snprintf(dbuf,sizeof(dbuf),"%.17g",d);
-    return rioWriteBulkString(r,dbuf,dlen);
-}
diff --git a/redis-stable/src/rio.h b/redis-stable/src/rio.h
deleted file mode 100644
index 9576335e..00000000
--- a/redis-stable/src/rio.h
+++ /dev/null
@@ -1,178 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#ifndef __REDIS_RIO_H
-#define __REDIS_RIO_H
-
-#include <stdio.h>
-#include <stdint.h>
-#include "sds.h"
-#include "connection.h"
-
-#define RIO_FLAG_READ_ERROR (1<<0)
-#define RIO_FLAG_WRITE_ERROR (1<<1)
-
-struct _rio {
-    /* Backend functions.
-     * Since this functions do not tolerate short writes or reads the return
-     * value is simplified to: zero on error, non zero on complete success. */
-    size_t (*read)(struct _rio *, void *buf, size_t len);
-    size_t (*write)(struct _rio *, const void *buf, size_t len);
-    off_t (*tell)(struct _rio *);
-    int (*flush)(struct _rio *);
-    /* The update_cksum method if not NULL is used to compute the checksum of
-     * all the data that was read or written so far. The method should be
-     * designed so that can be called with the current checksum, and the buf
-     * and len fields pointing to the new block of data to add to the checksum
-     * computation. */
-    void (*update_cksum)(struct _rio *, const void *buf, size_t len);
-
-    /* The current checksum and flags (see RIO_FLAG_*) */
-    uint64_t cksum, flags;
-
-    /* number of bytes read or written */
-    size_t processed_bytes;
-
-    /* maximum single read or write chunk size */
-    size_t max_processing_chunk;
-
-    /* Backend-specific vars. */
-    union {
-        /* In-memory buffer target. */
-        struct {
-            sds ptr;
-            off_t pos;
-        } buffer;
-        /* Stdio file pointer target. */
-        struct {
-            FILE *fp;
-            off_t buffered; /* Bytes written since last fsync. */
-            off_t autosync; /* fsync after 'autosync' bytes written. */
-        } file;
-        /* Connection object (used to read from socket) */
-        struct {
-            connection *conn;   /* Connection */
-            off_t pos;    /* pos in buf that was returned */
-            sds buf;      /* buffered data */
-            size_t read_limit;  /* don't allow to buffer/read more than that */
-            size_t read_so_far; /* amount of data read from the rio (not buffered) */
-        } conn;
-        /* FD target (used to write to pipe). */
-        struct {
-            int fd;       /* File descriptor. */
-            off_t pos;
-            sds buf;
-        } fd;
-    } io;
-};
-
-typedef struct _rio rio;
-
-/* The following functions are our interface with the stream. They'll call the
- * actual implementation of read / write / tell, and will update the checksum
- * if needed. */
-
-static inline size_t rioWrite(rio *r, const void *buf, size_t len) {
-    if (r->flags & RIO_FLAG_WRITE_ERROR) return 0;
-    while (len) {
-        size_t bytes_to_write = (r->max_processing_chunk && r->max_processing_chunk < len) ? r->max_processing_chunk : len;
-        if (r->update_cksum) r->update_cksum(r,buf,bytes_to_write);
-        if (r->write(r,buf,bytes_to_write) == 0) {
-            r->flags |= RIO_FLAG_WRITE_ERROR;
-            return 0;
-        }
-        buf = (char*)buf + bytes_to_write;
-        len -= bytes_to_write;
-        r->processed_bytes += bytes_to_write;
-    }
-    return 1;
-}
-
-static inline size_t rioRead(rio *r, void *buf, size_t len) {
-    if (r->flags & RIO_FLAG_READ_ERROR) return 0;
-    while (len) {
-        size_t bytes_to_read = (r->max_processing_chunk && r->max_processing_chunk < len) ? r->max_processing_chunk : len;
-        if (r->read(r,buf,bytes_to_read) == 0) {
-            r->flags |= RIO_FLAG_READ_ERROR;
-            return 0;
-        }
-        if (r->update_cksum) r->update_cksum(r,buf,bytes_to_read);
-        buf = (char*)buf + bytes_to_read;
-        len -= bytes_to_read;
-        r->processed_bytes += bytes_to_read;
-    }
-    return 1;
-}
-
-static inline off_t rioTell(rio *r) {
-    return r->tell(r);
-}
-
-static inline int rioFlush(rio *r) {
-    return r->flush(r);
-}
-
-/* This function allows to know if there was a read error in any past
- * operation, since the rio stream was created or since the last call
- * to rioClearError(). */
-static inline int rioGetReadError(rio *r) {
-    return (r->flags & RIO_FLAG_READ_ERROR) != 0;
-}
-
-/* Like rioGetReadError() but for write errors. */
-static inline int rioGetWriteError(rio *r) {
-    return (r->flags & RIO_FLAG_WRITE_ERROR) != 0;
-}
-
-static inline void rioClearErrors(rio *r) {
-    r->flags &= ~(RIO_FLAG_READ_ERROR|RIO_FLAG_WRITE_ERROR);
-}
-
-void rioInitWithFile(rio *r, FILE *fp);
-void rioInitWithBuffer(rio *r, sds s);
-void rioInitWithConn(rio *r, connection *conn, size_t read_limit);
-void rioInitWithFd(rio *r, int fd);
-
-void rioFreeFd(rio *r);
-void rioFreeConn(rio *r, sds* out_remainingBufferedData);
-
-size_t rioWriteBulkCount(rio *r, char prefix, long count);
-size_t rioWriteBulkString(rio *r, const char *buf, size_t len);
-size_t rioWriteBulkLongLong(rio *r, long long l);
-size_t rioWriteBulkDouble(rio *r, double d);
-
-struct redisObject;
-int rioWriteBulkObject(rio *r, struct redisObject *obj);
-
-void rioGenericUpdateChecksum(rio *r, const void *buf, size_t len);
-void rioSetAutoSync(rio *r, off_t bytes);
-
-#endif
diff --git a/redis-stable/src/scripting.c b/redis-stable/src/scripting.c
deleted file mode 100644
index 360df500..00000000
--- a/redis-stable/src/scripting.c
+++ /dev/null
@@ -1,2835 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "sha1.h"
-#include "rand.h"
-#include "cluster.h"
-#include "monotonic.h"
-
-#include <lua.h>
-#include <lauxlib.h>
-#include <lualib.h>
-#include <ctype.h>
-#include <math.h>
-
-char *redisProtocolToLuaType_Int(lua_State *lua, char *reply);
-char *redisProtocolToLuaType_Bulk(lua_State *lua, char *reply);
-char *redisProtocolToLuaType_Status(lua_State *lua, char *reply);
-char *redisProtocolToLuaType_Error(lua_State *lua, char *reply);
-char *redisProtocolToLuaType_Aggregate(lua_State *lua, char *reply, int atype);
-char *redisProtocolToLuaType_Null(lua_State *lua, char *reply);
-char *redisProtocolToLuaType_Bool(lua_State *lua, char *reply, int tf);
-char *redisProtocolToLuaType_Double(lua_State *lua, char *reply);
-int redis_math_random (lua_State *L);
-int redis_math_randomseed (lua_State *L);
-void ldbInit(void);
-void ldbDisable(client *c);
-void ldbEnable(client *c);
-void evalGenericCommandWithDebugging(client *c, int evalsha);
-void luaLdbLineHook(lua_State *lua, lua_Debug *ar);
-void ldbLog(sds entry);
-void ldbLogRedisReply(char *reply);
-sds ldbCatStackValue(sds s, lua_State *lua, int idx);
-
-/* Debugger shared state is stored inside this global structure. */
-#define LDB_BREAKPOINTS_MAX 64  /* Max number of breakpoints. */
-#define LDB_MAX_LEN_DEFAULT 256 /* Default len limit for replies / var dumps. */
-struct ldbState {
-    connection *conn; /* Connection of the debugging client. */
-    int active; /* Are we debugging EVAL right now? */
-    int forked; /* Is this a fork()ed debugging session? */
-    list *logs; /* List of messages to send to the client. */
-    list *traces; /* Messages about Redis commands executed since last stop.*/
-    list *children; /* All forked debugging sessions pids. */
-    int bp[LDB_BREAKPOINTS_MAX]; /* An array of breakpoints line numbers. */
-    int bpcount; /* Number of valid entries inside bp. */
-    int step;   /* Stop at next line regardless of breakpoints. */
-    int luabp;  /* Stop at next line because redis.breakpoint() was called. */
-    sds *src;   /* Lua script source code split by line. */
-    int lines;  /* Number of lines in 'src'. */
-    int currentline;    /* Current line number. */
-    sds cbuf;   /* Debugger client command buffer. */
-    size_t maxlen;  /* Max var dump / reply length. */
-    int maxlen_hint_sent; /* Did we already hint about "set maxlen"? */
-} ldb;
-
-/* ---------------------------------------------------------------------------
- * Utility functions.
- * ------------------------------------------------------------------------- */
-
-/* Perform the SHA1 of the input string. We use this both for hashing script
- * bodies in order to obtain the Lua function name, and in the implementation
- * of redis.sha1().
- *
- * 'digest' should point to a 41 bytes buffer: 40 for SHA1 converted into an
- * hexadecimal number, plus 1 byte for null term. */
-void sha1hex(char *digest, char *script, size_t len) {
-    SHA1_CTX ctx;
-    unsigned char hash[20];
-    char *cset = "0123456789abcdef";
-    int j;
-
-    SHA1Init(&ctx);
-    SHA1Update(&ctx,(unsigned char*)script,len);
-    SHA1Final(hash,&ctx);
-
-    for (j = 0; j < 20; j++) {
-        digest[j*2] = cset[((hash[j]&0xF0)>>4)];
-        digest[j*2+1] = cset[(hash[j]&0xF)];
-    }
-    digest[40] = '\0';
-}
-
-/* ---------------------------------------------------------------------------
- * Redis reply to Lua type conversion functions.
- * ------------------------------------------------------------------------- */
-
-/* Take a Redis reply in the Redis protocol format and convert it into a
- * Lua type. Thanks to this function, and the introduction of not connected
- * clients, it is trivial to implement the redis() lua function.
- *
- * Basically we take the arguments, execute the Redis command in the context
- * of a non connected client, then take the generated reply and convert it
- * into a suitable Lua type. With this trick the scripting feature does not
- * need the introduction of a full Redis internals API. The script
- * is like a normal client that bypasses all the slow I/O paths.
- *
- * Note: in this function we do not do any sanity check as the reply is
- * generated by Redis directly. This allows us to go faster.
- *
- * Errors are returned as a table with a single 'err' field set to the
- * error string.
- */
-
-char *redisProtocolToLuaType(lua_State *lua, char* reply) {
-
-    if (!lua_checkstack(lua, 5)) {
-        /*
-         * Increase the Lua stack if needed, to make sure there is enough room
-         * to push 5 elements to the stack. On failure, exit with panic.
-         * Notice that we need, in the worst case, 5 elements because redisProtocolToLuaType_Aggregate
-         * might push 5 elements to the Lua stack.*/
-        serverPanic("lua stack limit reach when parsing redis.call reply");
-    }
-
-    char *p = reply;
-
-    switch(*p) {
-    case ':': p = redisProtocolToLuaType_Int(lua,reply); break;
-    case '$': p = redisProtocolToLuaType_Bulk(lua,reply); break;
-    case '+': p = redisProtocolToLuaType_Status(lua,reply); break;
-    case '-': p = redisProtocolToLuaType_Error(lua,reply); break;
-    case '*': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
-    case '%': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
-    case '~': p = redisProtocolToLuaType_Aggregate(lua,reply,*p); break;
-    case '_': p = redisProtocolToLuaType_Null(lua,reply); break;
-    case '#': p = redisProtocolToLuaType_Bool(lua,reply,p[1]); break;
-    case ',': p = redisProtocolToLuaType_Double(lua,reply); break;
-    }
-    return p;
-}
-
-char *redisProtocolToLuaType_Int(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long value;
-
-    string2ll(reply+1,p-reply-1,&value);
-    lua_pushnumber(lua,(lua_Number)value);
-    return p+2;
-}
-
-char *redisProtocolToLuaType_Bulk(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long bulklen;
-
-    string2ll(reply+1,p-reply-1,&bulklen);
-    if (bulklen == -1) {
-        lua_pushboolean(lua,0);
-        return p+2;
-    } else {
-        lua_pushlstring(lua,p+2,bulklen);
-        return p+2+bulklen+2;
-    }
-}
-
-char *redisProtocolToLuaType_Status(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-
-    lua_newtable(lua);
-    lua_pushstring(lua,"ok");
-    lua_pushlstring(lua,reply+1,p-reply-1);
-    lua_settable(lua,-3);
-    return p+2;
-}
-
-char *redisProtocolToLuaType_Error(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-
-    lua_newtable(lua);
-    lua_pushstring(lua,"err");
-    lua_pushlstring(lua,reply+1,p-reply-1);
-    lua_settable(lua,-3);
-    return p+2;
-}
-
-char *redisProtocolToLuaType_Aggregate(lua_State *lua, char *reply, int atype) {
-    char *p = strchr(reply+1,'\r');
-    long long mbulklen;
-    int j = 0;
-
-    string2ll(reply+1,p-reply-1,&mbulklen);
-    if (server.lua_client->resp == 2 || atype == '*') {
-        p += 2;
-        if (mbulklen == -1) {
-            lua_pushboolean(lua,0);
-            return p;
-        }
-        lua_newtable(lua);
-        for (j = 0; j < mbulklen; j++) {
-            lua_pushnumber(lua,j+1);
-            p = redisProtocolToLuaType(lua,p);
-            lua_settable(lua,-3);
-        }
-    } else if (server.lua_client->resp == 3) {
-        /* Here we handle only Set and Map replies in RESP3 mode, since arrays
-         * follow the above RESP2 code path. Note that those are represented
-         * as a table with the "map" or "set" field populated with the actual
-         * table representing the set or the map type. */
-        p += 2;
-        lua_newtable(lua);
-        lua_pushstring(lua,atype == '%' ? "map" : "set");
-        lua_newtable(lua);
-        for (j = 0; j < mbulklen; j++) {
-            p = redisProtocolToLuaType(lua,p);
-            if (atype == '%') {
-                p = redisProtocolToLuaType(lua,p);
-            } else {
-                if (!lua_checkstack(lua, 1)) {
-                    /* Notice that here we need to check the stack again because the recursive
-                     * call to redisProtocolToLuaType might have use the room allocated in the stack */
-                    serverPanic("lua stack limit reach when parsing redis.call reply");
-                }
-                lua_pushboolean(lua,1);
-            }
-            lua_settable(lua,-3);
-        }
-        lua_settable(lua,-3);
-    }
-    return p;
-}
-
-char *redisProtocolToLuaType_Null(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    lua_pushnil(lua);
-    return p+2;
-}
-
-char *redisProtocolToLuaType_Bool(lua_State *lua, char *reply, int tf) {
-    char *p = strchr(reply+1,'\r');
-    lua_pushboolean(lua,tf == 't');
-    return p+2;
-}
-
-char *redisProtocolToLuaType_Double(lua_State *lua, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    char buf[MAX_LONG_DOUBLE_CHARS+1];
-    size_t len = p-reply-1;
-    double d;
-
-    if (len <= MAX_LONG_DOUBLE_CHARS) {
-        memcpy(buf,reply+1,len);
-        buf[len] = '\0';
-        d = strtod(buf,NULL); /* We expect a valid representation. */
-    } else {
-        d = 0;
-    }
-
-    lua_newtable(lua);
-    lua_pushstring(lua,"double");
-    lua_pushnumber(lua,d);
-    lua_settable(lua,-3);
-    return p+2;
-}
-
-/* This function is used in order to push an error on the Lua stack in the
- * format used by redis.pcall to return errors, which is a lua table
- * with a single "err" field set to the error string. Note that this
- * table is never a valid reply by proper commands, since the returned
- * tables are otherwise always indexed by integers, never by strings. */
-void luaPushError(lua_State *lua, char *error) {
-    lua_Debug dbg;
-
-    /* If debugging is active and in step mode, log errors resulting from
-     * Redis commands. */
-    if (ldb.active && ldb.step) {
-        ldbLog(sdscatprintf(sdsempty(),"<error> %s",error));
-    }
-
-    lua_newtable(lua);
-    lua_pushstring(lua,"err");
-
-    /* Attempt to figure out where this function was called, if possible */
-    if(lua_getstack(lua, 1, &dbg) && lua_getinfo(lua, "nSl", &dbg)) {
-        sds msg = sdscatprintf(sdsempty(), "%s: %d: %s",
-            dbg.source, dbg.currentline, error);
-        lua_pushstring(lua, msg);
-        sdsfree(msg);
-    } else {
-        lua_pushstring(lua, error);
-    }
-    lua_settable(lua,-3);
-}
-
-/* In case the error set into the Lua stack by luaPushError() was generated
- * by the non-error-trapping version of redis.pcall(), which is redis.call(),
- * this function will raise the Lua error so that the execution of the
- * script will be halted. */
-int luaRaiseError(lua_State *lua) {
-    lua_pushstring(lua,"err");
-    lua_gettable(lua,-2);
-    return lua_error(lua);
-}
-
-/* Sort the array currently in the stack. We do this to make the output
- * of commands like KEYS or SMEMBERS something deterministic when called
- * from Lua (to play well with AOf/replication).
- *
- * The array is sorted using table.sort itself, and assuming all the
- * list elements are strings. */
-void luaSortArray(lua_State *lua) {
-    /* Initial Stack: array */
-    lua_getglobal(lua,"table");
-    lua_pushstring(lua,"sort");
-    lua_gettable(lua,-2);       /* Stack: array, table, table.sort */
-    lua_pushvalue(lua,-3);      /* Stack: array, table, table.sort, array */
-    if (lua_pcall(lua,1,0,0)) {
-        /* Stack: array, table, error */
-
-        /* We are not interested in the error, we assume that the problem is
-         * that there are 'false' elements inside the array, so we try
-         * again with a slower function but able to handle this case, that
-         * is: table.sort(table, __redis__compare_helper) */
-        lua_pop(lua,1);             /* Stack: array, table */
-        lua_pushstring(lua,"sort"); /* Stack: array, table, sort */
-        lua_gettable(lua,-2);       /* Stack: array, table, table.sort */
-        lua_pushvalue(lua,-3);      /* Stack: array, table, table.sort, array */
-        lua_getglobal(lua,"__redis__compare_helper");
-        /* Stack: array, table, table.sort, array, __redis__compare_helper */
-        lua_call(lua,2,0);
-    }
-    /* Stack: array (sorted), table */
-    lua_pop(lua,1);             /* Stack: array (sorted) */
-}
-
-/* ---------------------------------------------------------------------------
- * Lua reply to Redis reply conversion functions.
- * ------------------------------------------------------------------------- */
-
-/* Reply to client 'c' converting the top element in the Lua stack to a
- * Redis reply. As a side effect the element is consumed from the stack.  */
-void luaReplyToRedisReply(client *c, lua_State *lua) {
-
-    if (!lua_checkstack(lua, 4)) {
-        /* Increase the Lua stack if needed to make sure there is enough room
-         * to push 4 elements to the stack. On failure, return error.
-         * Notice that we need, in the worst case, 4 elements because returning a map might
-         * require push 4 elements to the Lua stack.*/
-        addReplyErrorFormat(c, "reached lua stack limit");
-        lua_pop(lua,1); /* pop the element from the stack */
-        return;
-    }
-
-    int t = lua_type(lua,-1);
-
-    switch(t) {
-    case LUA_TSTRING:
-        addReplyBulkCBuffer(c,(char*)lua_tostring(lua,-1),lua_strlen(lua,-1));
-        break;
-    case LUA_TBOOLEAN:
-        if (server.lua_client->resp == 2)
-            addReply(c,lua_toboolean(lua,-1) ? shared.cone :
-                                               shared.null[c->resp]);
-        else
-            addReplyBool(c,lua_toboolean(lua,-1));
-        break;
-    case LUA_TNUMBER:
-        addReplyLongLong(c,(long long)lua_tonumber(lua,-1));
-        break;
-    case LUA_TTABLE:
-        /* We need to check if it is an array, an error, or a status reply.
-         * Error are returned as a single element table with 'err' field.
-         * Status replies are returned as single element table with 'ok'
-         * field. */
-
-        /* Handle error reply. */
-        /* we took care of the stack size on function start */
-        lua_pushstring(lua,"err");
-        lua_gettable(lua,-2);
-        t = lua_type(lua,-1);
-        if (t == LUA_TSTRING) {
-            addReplyErrorFormat(c,"-%s",lua_tostring(lua,-1));
-            lua_pop(lua,2);
-            return;
-        }
-        lua_pop(lua,1); /* Discard field name pushed before. */
-
-        /* Handle status reply. */
-        lua_pushstring(lua,"ok");
-        lua_gettable(lua,-2);
-        t = lua_type(lua,-1);
-        if (t == LUA_TSTRING) {
-            sds ok = sdsnew(lua_tostring(lua,-1));
-            sdsmapchars(ok,"\r\n","  ",2);
-            addReplySds(c,sdscatprintf(sdsempty(),"+%s\r\n",ok));
-            sdsfree(ok);
-            lua_pop(lua,2);
-            return;
-        }
-        lua_pop(lua,1); /* Discard field name pushed before. */
-
-        /* Handle double reply. */
-        lua_pushstring(lua,"double");
-        lua_gettable(lua,-2);
-        t = lua_type(lua,-1);
-        if (t == LUA_TNUMBER) {
-            addReplyDouble(c,lua_tonumber(lua,-1));
-            lua_pop(lua,2);
-            return;
-        }
-        lua_pop(lua,1); /* Discard field name pushed before. */
-
-        /* Handle map reply. */
-        lua_pushstring(lua,"map");
-        lua_gettable(lua,-2);
-        t = lua_type(lua,-1);
-        if (t == LUA_TTABLE) {
-            int maplen = 0;
-            void *replylen = addReplyDeferredLen(c);
-            /* we took care of the stack size on function start */
-            lua_pushnil(lua); /* Use nil to start iteration. */
-            while (lua_next(lua,-2)) {
-                /* Stack now: table, key, value */
-                lua_pushvalue(lua,-2);        /* Dup key before consuming. */
-                luaReplyToRedisReply(c, lua); /* Return key. */
-                luaReplyToRedisReply(c, lua); /* Return value. */
-                /* Stack now: table, key. */
-                maplen++;
-            }
-            setDeferredMapLen(c,replylen,maplen);
-            lua_pop(lua,2);
-            return;
-        }
-        lua_pop(lua,1); /* Discard field name pushed before. */
-
-        /* Handle set reply. */
-        lua_pushstring(lua,"set");
-        lua_gettable(lua,-2);
-        t = lua_type(lua,-1);
-        if (t == LUA_TTABLE) {
-            int setlen = 0;
-            void *replylen = addReplyDeferredLen(c);
-            /* we took care of the stack size on function start */
-            lua_pushnil(lua); /* Use nil to start iteration. */
-            while (lua_next(lua,-2)) {
-                /* Stack now: table, key, true */
-                lua_pop(lua,1);               /* Discard the boolean value. */
-                lua_pushvalue(lua,-1);        /* Dup key before consuming. */
-                luaReplyToRedisReply(c, lua); /* Return key. */
-                /* Stack now: table, key. */
-                setlen++;
-            }
-            setDeferredSetLen(c,replylen,setlen);
-            lua_pop(lua,2);
-            return;
-        }
-        lua_pop(lua,1); /* Discard field name pushed before. */
-
-        /* Handle the array reply. */
-        void *replylen = addReplyDeferredLen(c);
-        int j = 1, mbulklen = 0;
-        while(1) {
-            /* we took care of the stack size on function start */
-            lua_pushnumber(lua,j++);
-            lua_gettable(lua,-2);
-            t = lua_type(lua,-1);
-            if (t == LUA_TNIL) {
-                lua_pop(lua,1);
-                break;
-            }
-            luaReplyToRedisReply(c, lua);
-            mbulklen++;
-        }
-        setDeferredArrayLen(c,replylen,mbulklen);
-        break;
-    default:
-        addReplyNull(c);
-    }
-    lua_pop(lua,1);
-}
-
-/* ---------------------------------------------------------------------------
- * Lua redis.* functions implementations.
- * ------------------------------------------------------------------------- */
-
-#define LUA_CMD_OBJCACHE_SIZE 32
-#define LUA_CMD_OBJCACHE_MAX_LEN 64
-int luaRedisGenericCommand(lua_State *lua, int raise_error) {
-    int j, argc = lua_gettop(lua);
-    struct redisCommand *cmd;
-    client *c = server.lua_client;
-    sds reply;
-
-    /* Cached across calls. */
-    static robj **argv = NULL;
-    static int argv_size = 0;
-    static robj *cached_objects[LUA_CMD_OBJCACHE_SIZE];
-    static size_t cached_objects_len[LUA_CMD_OBJCACHE_SIZE];
-    static int inuse = 0;   /* Recursive calls detection. */
-
-    /* By using Lua debug hooks it is possible to trigger a recursive call
-     * to luaRedisGenericCommand(), which normally should never happen.
-     * To make this function reentrant is futile and makes it slower, but
-     * we should at least detect such a misuse, and abort. */
-    if (inuse) {
-        char *recursion_warning =
-            "luaRedisGenericCommand() recursive call detected. "
-            "Are you doing funny stuff with Lua debug hooks?";
-        serverLog(LL_WARNING,"%s",recursion_warning);
-        luaPushError(lua,recursion_warning);
-        return 1;
-    }
-    inuse++;
-
-    /* Require at least one argument */
-    if (argc == 0) {
-        luaPushError(lua,
-            "Please specify at least one argument for redis.call()");
-        inuse--;
-        return raise_error ? luaRaiseError(lua) : 1;
-    }
-
-    /* Build the arguments vector */
-    if (argv_size < argc) {
-        argv = zrealloc(argv,sizeof(robj*)*argc);
-        argv_size = argc;
-    }
-
-    for (j = 0; j < argc; j++) {
-        char *obj_s;
-        size_t obj_len;
-        char dbuf[64];
-
-        if (lua_type(lua,j+1) == LUA_TNUMBER) {
-            /* We can't use lua_tolstring() for number -> string conversion
-             * since Lua uses a format specifier that loses precision. */
-            lua_Number num = lua_tonumber(lua,j+1);
-
-            obj_len = snprintf(dbuf,sizeof(dbuf),"%.17g",(double)num);
-            obj_s = dbuf;
-        } else {
-            obj_s = (char*)lua_tolstring(lua,j+1,&obj_len);
-            if (obj_s == NULL) break; /* Not a string. */
-        }
-
-        /* Try to use a cached object. */
-        if (j < LUA_CMD_OBJCACHE_SIZE && cached_objects[j] &&
-            cached_objects_len[j] >= obj_len)
-        {
-            sds s = cached_objects[j]->ptr;
-            argv[j] = cached_objects[j];
-            cached_objects[j] = NULL;
-            memcpy(s,obj_s,obj_len+1);
-            sdssetlen(s, obj_len);
-        } else {
-            argv[j] = createStringObject(obj_s, obj_len);
-        }
-    }
-
-    /* Check if one of the arguments passed by the Lua script
-     * is not a string or an integer (lua_isstring() return true for
-     * integers as well). */
-    if (j != argc) {
-        j--;
-        while (j >= 0) {
-            decrRefCount(argv[j]);
-            j--;
-        }
-        luaPushError(lua,
-            "Lua redis() command arguments must be strings or integers");
-        inuse--;
-        return raise_error ? luaRaiseError(lua) : 1;
-    }
-
-    /* Setup our fake client for command execution */
-    c->argv = argv;
-    c->argc = argc;
-    c->user = server.lua_caller->user;
-
-    /* Process module hooks */
-    moduleCallCommandFilters(c);
-    argv = c->argv;
-    argc = c->argc;
-
-    /* Log the command if debugging is active. */
-    if (ldb.active && ldb.step) {
-        sds cmdlog = sdsnew("<redis>");
-        for (j = 0; j < c->argc; j++) {
-            if (j == 10) {
-                cmdlog = sdscatprintf(cmdlog," ... (%d more)",
-                    c->argc-j-1);
-                break;
-            } else {
-                cmdlog = sdscatlen(cmdlog," ",1);
-                cmdlog = sdscatsds(cmdlog,c->argv[j]->ptr);
-            }
-        }
-        ldbLog(cmdlog);
-    }
-
-    /* Command lookup */
-    cmd = lookupCommand(argv[0]->ptr);
-    if (!cmd || ((cmd->arity > 0 && cmd->arity != argc) ||
-                   (argc < -cmd->arity)))
-    {
-        if (cmd)
-            luaPushError(lua,
-                "Wrong number of args calling Redis command From Lua script");
-        else
-            luaPushError(lua,"Unknown Redis command called from Lua script");
-        goto cleanup;
-    }
-    c->cmd = c->lastcmd = cmd;
-
-    /* There are commands that are not allowed inside scripts. */
-    if (cmd->flags & CMD_NOSCRIPT) {
-        luaPushError(lua, "This Redis command is not allowed from scripts");
-        goto cleanup;
-    }
-
-    /* Check the ACLs. */
-    int acl_errpos;
-    int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
-    if (acl_retval != ACL_OK) {
-        addACLLogEntry(c,acl_retval,acl_errpos,NULL);
-        switch (acl_retval) {
-        case ACL_DENIED_CMD:
-            luaPushError(lua, "The user executing the script can't run this "
-                              "command or subcommand");
-            break;
-        case ACL_DENIED_KEY:
-            luaPushError(lua, "The user executing the script can't access "
-                              "at least one of the keys mentioned in the "
-                              "command arguments");
-            break;
-        case ACL_DENIED_CHANNEL:
-            luaPushError(lua, "The user executing the script can't publish "
-                              "to the channel mentioned in the command");
-            break;
-        default:
-            luaPushError(lua, "The user executing the script is lacking the "
-                              "permissions for the command");
-            break;
-        }
-        goto cleanup;
-    }
-
-    /* Write commands are forbidden against read-only slaves, or if a
-     * command marked as non-deterministic was already called in the context
-     * of this script. */
-    if (cmd->flags & CMD_WRITE) {
-        int deny_write_type = writeCommandsDeniedByDiskError();
-        if (server.lua_random_dirty && !server.lua_replicate_commands) {
-            luaPushError(lua,
-                "Write commands not allowed after non deterministic commands. Call redis.replicate_commands() at the start of your script in order to switch to single commands replication mode.");
-            goto cleanup;
-        } else if (server.masterhost && server.repl_slave_ro &&
-                   !server.loading &&
-                   !(server.lua_caller->flags & CLIENT_MASTER))
-        {
-            luaPushError(lua, shared.roslaveerr->ptr);
-            goto cleanup;
-        } else if (deny_write_type != DISK_ERROR_TYPE_NONE) {
-            if (deny_write_type == DISK_ERROR_TYPE_RDB) {
-                luaPushError(lua, shared.bgsaveerr->ptr);
-            } else {
-                sds aof_write_err = sdscatfmt(sdsempty(),
-                    "-MISCONF Errors writing to the AOF file: %s\r\n",
-                    strerror(server.aof_last_write_errno));
-                luaPushError(lua, aof_write_err);
-                sdsfree(aof_write_err);
-            }
-            goto cleanup;
-        }
-    }
-
-    /* If we reached the memory limit configured via maxmemory, commands that
-     * could enlarge the memory usage are not allowed, but only if this is the
-     * first write in the context of this script, otherwise we can't stop
-     * in the middle. */
-    if (server.maxmemory &&             /* Maxmemory is actually enabled. */
-        !server.loading &&              /* Don't care about mem if loading. */
-        !server.masterhost &&           /* Slave must execute the script. */
-        server.lua_write_dirty == 0 &&  /* Script had no side effects so far. */
-        server.lua_oom &&               /* Detected OOM when script start. */
-        (cmd->flags & CMD_DENYOOM))
-    {
-        luaPushError(lua, shared.oomerr->ptr);
-        goto cleanup;
-    }
-
-    if (cmd->flags & CMD_RANDOM) server.lua_random_dirty = 1;
-    if (cmd->flags & CMD_WRITE) server.lua_write_dirty = 1;
-
-    /* If this is a Redis Cluster node, we need to make sure Lua is not
-     * trying to access non-local keys, with the exception of commands
-     * received from our master or when loading the AOF back in memory. */
-    if (server.cluster_enabled && !server.loading &&
-        !(server.lua_caller->flags & CLIENT_MASTER))
-    {
-        int error_code;
-        /* Duplicate relevant flags in the lua client. */
-        c->flags &= ~(CLIENT_READONLY|CLIENT_ASKING);
-        c->flags |= server.lua_caller->flags & (CLIENT_READONLY|CLIENT_ASKING);
-        if (getNodeByQuery(c,c->cmd,c->argv,c->argc,NULL,&error_code) !=
-                           server.cluster->myself)
-        {
-            if (error_code == CLUSTER_REDIR_DOWN_RO_STATE) {
-                luaPushError(lua,
-                    "Lua script attempted to execute a write command while the "
-                    "cluster is down and readonly");
-            } else if (error_code == CLUSTER_REDIR_DOWN_STATE) {
-                luaPushError(lua,
-                    "Lua script attempted to execute a command while the "
-                    "cluster is down");
-            } else {
-                luaPushError(lua,
-                    "Lua script attempted to access a non local key in a "
-                    "cluster node");
-            }
-
-            goto cleanup;
-        }
-    }
-
-    /* If we are using single commands replication, we need to wrap what
-     * we propagate into a MULTI/EXEC block, so that it will be atomic like
-     * a Lua script in the context of AOF and slaves. */
-    if (server.lua_replicate_commands &&
-        !server.lua_multi_emitted &&
-        !(server.lua_caller->flags & CLIENT_MULTI) &&
-        server.lua_write_dirty &&
-        server.lua_repl != PROPAGATE_NONE)
-    {
-        execCommandPropagateMulti(server.lua_caller->db->id);
-        server.lua_multi_emitted = 1;
-        /* Now we are in the MULTI context, the lua_client should be
-         * flag as CLIENT_MULTI. */
-        c->flags |= CLIENT_MULTI;
-    }
-
-    /* Run the command */
-    int call_flags = CMD_CALL_SLOWLOG | CMD_CALL_STATS;
-    if (server.lua_replicate_commands) {
-        /* Set flags according to redis.set_repl() settings. */
-        if (server.lua_repl & PROPAGATE_AOF)
-            call_flags |= CMD_CALL_PROPAGATE_AOF;
-        if (server.lua_repl & PROPAGATE_REPL)
-            call_flags |= CMD_CALL_PROPAGATE_REPL;
-    }
-    call(c,call_flags);
-    serverAssert((c->flags & CLIENT_BLOCKED) == 0);
-
-    /* Convert the result of the Redis command into a suitable Lua type.
-     * The first thing we need is to create a single string from the client
-     * output buffers. */
-    if (listLength(c->reply) == 0 && c->bufpos < PROTO_REPLY_CHUNK_BYTES) {
-        /* This is a fast path for the common case of a reply inside the
-         * client static buffer. Don't create an SDS string but just use
-         * the client buffer directly. */
-        c->buf[c->bufpos] = '\0';
-        reply = c->buf;
-        c->bufpos = 0;
-    } else {
-        reply = sdsnewlen(c->buf,c->bufpos);
-        c->bufpos = 0;
-        while(listLength(c->reply)) {
-            clientReplyBlock *o = listNodeValue(listFirst(c->reply));
-
-            reply = sdscatlen(reply,o->buf,o->used);
-            listDelNode(c->reply,listFirst(c->reply));
-        }
-    }
-    if (raise_error && reply[0] != '-') raise_error = 0;
-    redisProtocolToLuaType(lua,reply);
-
-    /* If the debugger is active, log the reply from Redis. */
-    if (ldb.active && ldb.step)
-        ldbLogRedisReply(reply);
-
-    /* Sort the output array if needed, assuming it is a non-null multi bulk
-     * reply as expected. */
-    if ((cmd->flags & CMD_SORT_FOR_SCRIPT) &&
-        (server.lua_replicate_commands == 0) &&
-        (reply[0] == '*' && reply[1] != '-')) {
-            luaSortArray(lua);
-    }
-    if (reply != c->buf) sdsfree(reply);
-    c->reply_bytes = 0;
-
-cleanup:
-    /* Clean up. Command code may have changed argv/argc so we use the
-     * argv/argc of the client instead of the local variables. */
-    for (j = 0; j < c->argc; j++) {
-        robj *o = c->argv[j];
-
-        /* Try to cache the object in the cached_objects array.
-         * The object must be small, SDS-encoded, and with refcount = 1
-         * (we must be the only owner) for us to cache it. */
-        if (j < LUA_CMD_OBJCACHE_SIZE &&
-            o->refcount == 1 &&
-            (o->encoding == OBJ_ENCODING_RAW ||
-             o->encoding == OBJ_ENCODING_EMBSTR) &&
-            sdslen(o->ptr) <= LUA_CMD_OBJCACHE_MAX_LEN)
-        {
-            sds s = o->ptr;
-            if (cached_objects[j]) decrRefCount(cached_objects[j]);
-            cached_objects[j] = o;
-            cached_objects_len[j] = sdsalloc(s);
-        } else {
-            decrRefCount(o);
-        }
-    }
-
-    if (c->argv != argv) {
-        zfree(c->argv);
-        argv = NULL;
-        argv_size = 0;
-    }
-
-    c->user = NULL;
-
-    if (raise_error) {
-        /* If we are here we should have an error in the stack, in the
-         * form of a table with an "err" field. Extract the string to
-         * return the plain error. */
-        inuse--;
-        return luaRaiseError(lua);
-    }
-    inuse--;
-    return 1;
-}
-
-/* redis.call() */
-int luaRedisCallCommand(lua_State *lua) {
-    return luaRedisGenericCommand(lua,1);
-}
-
-/* redis.pcall() */
-int luaRedisPCallCommand(lua_State *lua) {
-    return luaRedisGenericCommand(lua,0);
-}
-
-/* This adds redis.sha1hex(string) to Lua scripts using the same hashing
- * function used for sha1ing lua scripts. */
-int luaRedisSha1hexCommand(lua_State *lua) {
-    int argc = lua_gettop(lua);
-    char digest[41];
-    size_t len;
-    char *s;
-
-    if (argc != 1) {
-        lua_pushstring(lua, "wrong number of arguments");
-        return lua_error(lua);
-    }
-
-    s = (char*)lua_tolstring(lua,1,&len);
-    sha1hex(digest,s,len);
-    lua_pushstring(lua,digest);
-    return 1;
-}
-
-/* Returns a table with a single field 'field' set to the string value
- * passed as argument. This helper function is handy when returning
- * a Redis Protocol error or status reply from Lua:
- *
- * return redis.error_reply("ERR Some Error")
- * return redis.status_reply("ERR Some Error")
- */
-int luaRedisReturnSingleFieldTable(lua_State *lua, char *field) {
-    if (lua_gettop(lua) != 1 || lua_type(lua,-1) != LUA_TSTRING) {
-        luaPushError(lua, "wrong number or type of arguments");
-        return 1;
-    }
-
-    lua_newtable(lua);
-    lua_pushstring(lua, field);
-    lua_pushvalue(lua, -3);
-    lua_settable(lua, -3);
-    return 1;
-}
-
-/* redis.error_reply() */
-int luaRedisErrorReplyCommand(lua_State *lua) {
-    return luaRedisReturnSingleFieldTable(lua,"err");
-}
-
-/* redis.status_reply() */
-int luaRedisStatusReplyCommand(lua_State *lua) {
-    return luaRedisReturnSingleFieldTable(lua,"ok");
-}
-
-/* redis.replicate_commands()
- *
- * Turn on single commands replication if the script never called
- * a write command so far, and returns true. Otherwise if the script
- * already started to write, returns false and stick to whole scripts
- * replication, which is our default. */
-int luaRedisReplicateCommandsCommand(lua_State *lua) {
-    if (server.lua_write_dirty) {
-        lua_pushboolean(lua,0);
-    } else {
-        server.lua_replicate_commands = 1;
-        /* When we switch to single commands replication, we can provide
-         * different math.random() sequences at every call, which is what
-         * the user normally expects. */
-        redisSrand48(rand());
-        lua_pushboolean(lua,1);
-    }
-    return 1;
-}
-
-/* redis.breakpoint()
- *
- * Allows to stop execution during a debugging session from within
- * the Lua code implementation, like if a breakpoint was set in the code
- * immediately after the function. */
-int luaRedisBreakpointCommand(lua_State *lua) {
-    if (ldb.active) {
-        ldb.luabp = 1;
-        lua_pushboolean(lua,1);
-    } else {
-        lua_pushboolean(lua,0);
-    }
-    return 1;
-}
-
-/* redis.debug()
- *
- * Log a string message into the output console.
- * Can take multiple arguments that will be separated by commas.
- * Nothing is returned to the caller. */
-int luaRedisDebugCommand(lua_State *lua) {
-    if (!ldb.active) return 0;
-    int argc = lua_gettop(lua);
-    sds log = sdscatprintf(sdsempty(),"<debug> line %d: ", ldb.currentline);
-    while(argc--) {
-        log = ldbCatStackValue(log,lua,-1 - argc);
-        if (argc != 0) log = sdscatlen(log,", ",2);
-    }
-    ldbLog(log);
-    return 0;
-}
-
-/* redis.set_repl()
- *
- * Set the propagation of write commands executed in the context of the
- * script to on/off for AOF and slaves. */
-int luaRedisSetReplCommand(lua_State *lua) {
-    int argc = lua_gettop(lua);
-    int flags;
-
-    if (server.lua_replicate_commands == 0) {
-        lua_pushstring(lua, "You can set the replication behavior only after turning on single commands replication with redis.replicate_commands().");
-        return lua_error(lua);
-    } else if (argc != 1) {
-        lua_pushstring(lua, "redis.set_repl() requires two arguments.");
-        return lua_error(lua);
-    }
-
-    flags = lua_tonumber(lua,-1);
-    if ((flags & ~(PROPAGATE_AOF|PROPAGATE_REPL)) != 0) {
-        lua_pushstring(lua, "Invalid replication flags. Use REPL_AOF, REPL_REPLICA, REPL_ALL or REPL_NONE.");
-        return lua_error(lua);
-    }
-    server.lua_repl = flags;
-    return 0;
-}
-
-/* redis.log() */
-int luaLogCommand(lua_State *lua) {
-    int j, argc = lua_gettop(lua);
-    int level;
-    sds log;
-
-    if (argc < 2) {
-        lua_pushstring(lua, "redis.log() requires two arguments or more.");
-        return lua_error(lua);
-    } else if (!lua_isnumber(lua,-argc)) {
-        lua_pushstring(lua, "First argument must be a number (log level).");
-        return lua_error(lua);
-    }
-    level = lua_tonumber(lua,-argc);
-    if (level < LL_DEBUG || level > LL_WARNING) {
-        lua_pushstring(lua, "Invalid debug level.");
-        return lua_error(lua);
-    }
-    if (level < server.verbosity) return 0;
-
-    /* Glue together all the arguments */
-    log = sdsempty();
-    for (j = 1; j < argc; j++) {
-        size_t len;
-        char *s;
-
-        s = (char*)lua_tolstring(lua,(-argc)+j,&len);
-        if (s) {
-            if (j != 1) log = sdscatlen(log," ",1);
-            log = sdscatlen(log,s,len);
-        }
-    }
-    serverLogRaw(level,log);
-    sdsfree(log);
-    return 0;
-}
-
-/* redis.setresp() */
-int luaSetResp(lua_State *lua) {
-    int argc = lua_gettop(lua);
-
-    if (argc != 1) {
-        lua_pushstring(lua, "redis.setresp() requires one argument.");
-        return lua_error(lua);
-    }
-
-    int resp = lua_tonumber(lua,-argc);
-    if (resp != 2 && resp != 3) {
-        lua_pushstring(lua, "RESP version must be 2 or 3.");
-        return lua_error(lua);
-    }
-
-    server.lua_client->resp = resp;
-    return 0;
-}
-
-/* ---------------------------------------------------------------------------
- * Lua engine initialization and reset.
- * ------------------------------------------------------------------------- */
-
-void luaLoadLib(lua_State *lua, const char *libname, lua_CFunction luafunc) {
-  lua_pushcfunction(lua, luafunc);
-  lua_pushstring(lua, libname);
-  lua_call(lua, 1, 0);
-}
-
-LUALIB_API int (luaopen_cjson) (lua_State *L);
-LUALIB_API int (luaopen_struct) (lua_State *L);
-LUALIB_API int (luaopen_cmsgpack) (lua_State *L);
-LUALIB_API int (luaopen_bit) (lua_State *L);
-
-void luaLoadLibraries(lua_State *lua) {
-    luaLoadLib(lua, "", luaopen_base);
-    luaLoadLib(lua, LUA_TABLIBNAME, luaopen_table);
-    luaLoadLib(lua, LUA_STRLIBNAME, luaopen_string);
-    luaLoadLib(lua, LUA_MATHLIBNAME, luaopen_math);
-    luaLoadLib(lua, LUA_DBLIBNAME, luaopen_debug);
-    luaLoadLib(lua, "cjson", luaopen_cjson);
-    luaLoadLib(lua, "struct", luaopen_struct);
-    luaLoadLib(lua, "cmsgpack", luaopen_cmsgpack);
-    luaLoadLib(lua, "bit", luaopen_bit);
-
-#if 0 /* Stuff that we don't load currently, for sandboxing concerns. */
-    luaLoadLib(lua, LUA_LOADLIBNAME, luaopen_package);
-    luaLoadLib(lua, LUA_OSLIBNAME, luaopen_os);
-#endif
-}
-
-/* Remove a functions that we don't want to expose to the Redis scripting
- * environment. */
-void luaRemoveUnsupportedFunctions(lua_State *lua) {
-    lua_pushnil(lua);
-    lua_setglobal(lua,"loadfile");
-    lua_pushnil(lua);
-    lua_setglobal(lua,"dofile");
-}
-
-/* This function installs metamethods in the global table _G that prevent
- * the creation of globals accidentally.
- *
- * It should be the last to be called in the scripting engine initialization
- * sequence, because it may interact with creation of globals. */
-void scriptingEnableGlobalsProtection(lua_State *lua) {
-    char *s[32];
-    sds code = sdsempty();
-    int j = 0;
-
-    /* strict.lua from: http://metalua.luaforge.net/src/lib/strict.lua.html.
-     * Modified to be adapted to Redis. */
-    s[j++]="local dbg=debug\n";
-    s[j++]="local mt = {}\n";
-    s[j++]="setmetatable(_G, mt)\n";
-    s[j++]="mt.__newindex = function (t, n, v)\n";
-    s[j++]="  if dbg.getinfo(2) then\n";
-    s[j++]="    local w = dbg.getinfo(2, \"S\").what\n";
-    s[j++]="    if w ~= \"main\" and w ~= \"C\" then\n";
-    s[j++]="      error(\"Script attempted to create global variable '\"..tostring(n)..\"'\", 2)\n";
-    s[j++]="    end\n";
-    s[j++]="  end\n";
-    s[j++]="  rawset(t, n, v)\n";
-    s[j++]="end\n";
-    s[j++]="mt.__index = function (t, n)\n";
-    s[j++]="  if dbg.getinfo(2) and dbg.getinfo(2, \"S\").what ~= \"C\" then\n";
-    s[j++]="    error(\"Script attempted to access nonexistent global variable '\"..tostring(n)..\"'\", 2)\n";
-    s[j++]="  end\n";
-    s[j++]="  return rawget(t, n)\n";
-    s[j++]="end\n";
-    s[j++]="debug = nil\n";
-    s[j++]=NULL;
-
-    for (j = 0; s[j] != NULL; j++) code = sdscatlen(code,s[j],strlen(s[j]));
-    luaL_loadbuffer(lua,code,sdslen(code),"@enable_strict_lua");
-    lua_pcall(lua,0,0,0);
-    sdsfree(code);
-}
-
-/* Initialize the scripting environment.
- *
- * This function is called the first time at server startup with
- * the 'setup' argument set to 1.
- *
- * It can be called again multiple times during the lifetime of the Redis
- * process, with 'setup' set to 0, and following a scriptingRelease() call,
- * in order to reset the Lua scripting environment.
- *
- * However it is simpler to just call scriptingReset() that does just that. */
-void scriptingInit(int setup) {
-    lua_State *lua = lua_open();
-
-    if (setup) {
-        server.lua_client = NULL;
-        server.lua_caller = NULL;
-        server.lua_cur_script = NULL;
-        server.lua_timedout = 0;
-        ldbInit();
-    }
-
-    luaLoadLibraries(lua);
-    luaRemoveUnsupportedFunctions(lua);
-
-    /* Initialize a dictionary we use to map SHAs to scripts.
-     * This is useful for replication, as we need to replicate EVALSHA
-     * as EVAL, so we need to remember the associated script. */
-    server.lua_scripts = dictCreate(&shaScriptObjectDictType,NULL);
-    server.lua_scripts_mem = 0;
-
-    /* Register the redis commands table and fields */
-    lua_newtable(lua);
-
-    /* redis.call */
-    lua_pushstring(lua,"call");
-    lua_pushcfunction(lua,luaRedisCallCommand);
-    lua_settable(lua,-3);
-
-    /* redis.pcall */
-    lua_pushstring(lua,"pcall");
-    lua_pushcfunction(lua,luaRedisPCallCommand);
-    lua_settable(lua,-3);
-
-    /* redis.log and log levels. */
-    lua_pushstring(lua,"log");
-    lua_pushcfunction(lua,luaLogCommand);
-    lua_settable(lua,-3);
-
-    /* redis.setresp */
-    lua_pushstring(lua,"setresp");
-    lua_pushcfunction(lua,luaSetResp);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"LOG_DEBUG");
-    lua_pushnumber(lua,LL_DEBUG);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"LOG_VERBOSE");
-    lua_pushnumber(lua,LL_VERBOSE);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"LOG_NOTICE");
-    lua_pushnumber(lua,LL_NOTICE);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"LOG_WARNING");
-    lua_pushnumber(lua,LL_WARNING);
-    lua_settable(lua,-3);
-
-    /* redis.sha1hex */
-    lua_pushstring(lua, "sha1hex");
-    lua_pushcfunction(lua, luaRedisSha1hexCommand);
-    lua_settable(lua, -3);
-
-    /* redis.error_reply and redis.status_reply */
-    lua_pushstring(lua, "error_reply");
-    lua_pushcfunction(lua, luaRedisErrorReplyCommand);
-    lua_settable(lua, -3);
-    lua_pushstring(lua, "status_reply");
-    lua_pushcfunction(lua, luaRedisStatusReplyCommand);
-    lua_settable(lua, -3);
-
-    /* redis.replicate_commands */
-    lua_pushstring(lua, "replicate_commands");
-    lua_pushcfunction(lua, luaRedisReplicateCommandsCommand);
-    lua_settable(lua, -3);
-
-    /* redis.set_repl and associated flags. */
-    lua_pushstring(lua,"set_repl");
-    lua_pushcfunction(lua,luaRedisSetReplCommand);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"REPL_NONE");
-    lua_pushnumber(lua,PROPAGATE_NONE);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"REPL_AOF");
-    lua_pushnumber(lua,PROPAGATE_AOF);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"REPL_SLAVE");
-    lua_pushnumber(lua,PROPAGATE_REPL);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"REPL_REPLICA");
-    lua_pushnumber(lua,PROPAGATE_REPL);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"REPL_ALL");
-    lua_pushnumber(lua,PROPAGATE_AOF|PROPAGATE_REPL);
-    lua_settable(lua,-3);
-
-    /* redis.breakpoint */
-    lua_pushstring(lua,"breakpoint");
-    lua_pushcfunction(lua,luaRedisBreakpointCommand);
-    lua_settable(lua,-3);
-
-    /* redis.debug */
-    lua_pushstring(lua,"debug");
-    lua_pushcfunction(lua,luaRedisDebugCommand);
-    lua_settable(lua,-3);
-
-    /* Finally set the table as 'redis' global var. */
-    lua_setglobal(lua,"redis");
-
-    /* Replace math.random and math.randomseed with our implementations. */
-    lua_getglobal(lua,"math");
-
-    lua_pushstring(lua,"random");
-    lua_pushcfunction(lua,redis_math_random);
-    lua_settable(lua,-3);
-
-    lua_pushstring(lua,"randomseed");
-    lua_pushcfunction(lua,redis_math_randomseed);
-    lua_settable(lua,-3);
-
-    lua_setglobal(lua,"math");
-
-    /* Add a helper function that we use to sort the multi bulk output of non
-     * deterministic commands, when containing 'false' elements. */
-    {
-        char *compare_func =    "function __redis__compare_helper(a,b)\n"
-                                "  if a == false then a = '' end\n"
-                                "  if b == false then b = '' end\n"
-                                "  return a<b\n"
-                                "end\n";
-        luaL_loadbuffer(lua,compare_func,strlen(compare_func),"@cmp_func_def");
-        lua_pcall(lua,0,0,0);
-    }
-
-    /* Add a helper function we use for pcall error reporting.
-     * Note that when the error is in the C function we want to report the
-     * information about the caller, that's what makes sense from the point
-     * of view of the user debugging a script. */
-    {
-        char *errh_func =       "local dbg = debug\n"
-                                "function __redis__err__handler(err)\n"
-                                "  local i = dbg.getinfo(2,'nSl')\n"
-                                "  if i and i.what == 'C' then\n"
-                                "    i = dbg.getinfo(3,'nSl')\n"
-                                "  end\n"
-                                "  if i then\n"
-                                "    return i.source .. ':' .. i.currentline .. ': ' .. err\n"
-                                "  else\n"
-                                "    return err\n"
-                                "  end\n"
-                                "end\n";
-        luaL_loadbuffer(lua,errh_func,strlen(errh_func),"@err_handler_def");
-        lua_pcall(lua,0,0,0);
-    }
-
-    /* Create the (non connected) client that we use to execute Redis commands
-     * inside the Lua interpreter.
-     * Note: there is no need to create it again when this function is called
-     * by scriptingReset(). */
-    if (server.lua_client == NULL) {
-        server.lua_client = createClient(NULL);
-        server.lua_client->flags |= CLIENT_LUA;
-
-        /* We do not want to allow blocking commands inside Lua */
-        server.lua_client->flags |= CLIENT_DENY_BLOCKING;
-    }
-
-    /* Lua beginners often don't use "local", this is likely to introduce
-     * subtle bugs in their code. To prevent problems we protect accesses
-     * to global variables. */
-    scriptingEnableGlobalsProtection(lua);
-
-    server.lua = lua;
-}
-
-/* Release resources related to Lua scripting.
- * This function is used in order to reset the scripting environment. */
-void scriptingRelease(int async) {
-    if (async)
-        freeLuaScriptsAsync(server.lua_scripts);
-    else
-        dictRelease(server.lua_scripts);
-    server.lua_scripts_mem = 0;
-    lua_close(server.lua);
-}
-
-void scriptingReset(int async) {
-    scriptingRelease(async);
-    scriptingInit(0);
-}
-
-/* Set an array of Redis String Objects as a Lua array (table) stored into a
- * global variable. */
-void luaSetGlobalArray(lua_State *lua, char *var, robj **elev, int elec) {
-    int j;
-
-    lua_newtable(lua);
-    for (j = 0; j < elec; j++) {
-        lua_pushlstring(lua,(char*)elev[j]->ptr,sdslen(elev[j]->ptr));
-        lua_rawseti(lua,-2,j+1);
-    }
-    lua_setglobal(lua,var);
-}
-
-/* ---------------------------------------------------------------------------
- * Redis provided math.random
- * ------------------------------------------------------------------------- */
-
-/* We replace math.random() with our implementation that is not affected
- * by specific libc random() implementations and will output the same sequence
- * (for the same seed) in every arch. */
-
-/* The following implementation is the one shipped with Lua itself but with
- * rand() replaced by redisLrand48(). */
-int redis_math_random (lua_State *L) {
-  /* the `%' avoids the (rare) case of r==1, and is needed also because on
-     some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
-  lua_Number r = (lua_Number)(redisLrand48()%REDIS_LRAND48_MAX) /
-                                (lua_Number)REDIS_LRAND48_MAX;
-  switch (lua_gettop(L)) {  /* check number of arguments */
-    case 0: {  /* no arguments */
-      lua_pushnumber(L, r);  /* Number between 0 and 1 */
-      break;
-    }
-    case 1: {  /* only upper limit */
-      int u = luaL_checkint(L, 1);
-      luaL_argcheck(L, 1<=u, 1, "interval is empty");
-      lua_pushnumber(L, floor(r*u)+1);  /* int between 1 and `u' */
-      break;
-    }
-    case 2: {  /* lower and upper limits */
-      int l = luaL_checkint(L, 1);
-      int u = luaL_checkint(L, 2);
-      luaL_argcheck(L, l<=u, 2, "interval is empty");
-      lua_pushnumber(L, floor(r*(u-l+1))+l);  /* int between `l' and `u' */
-      break;
-    }
-    default: return luaL_error(L, "wrong number of arguments");
-  }
-  return 1;
-}
-
-int redis_math_randomseed (lua_State *L) {
-  redisSrand48(luaL_checkint(L, 1));
-  return 0;
-}
-
-/* ---------------------------------------------------------------------------
- * EVAL and SCRIPT commands implementation
- * ------------------------------------------------------------------------- */
-
-/* Define a Lua function with the specified body.
- * The function name will be generated in the following form:
- *
- *   f_<hex sha1 sum>
- *
- * The function increments the reference count of the 'body' object as a
- * side effect of a successful call.
- *
- * On success a pointer to an SDS string representing the function SHA1 of the
- * just added function is returned (and will be valid until the next call
- * to scriptingReset() function), otherwise NULL is returned.
- *
- * The function handles the fact of being called with a script that already
- * exists, and in such a case, it behaves like in the success case.
- *
- * If 'c' is not NULL, on error the client is informed with an appropriate
- * error describing the nature of the problem and the Lua interpreter error. */
-sds luaCreateFunction(client *c, lua_State *lua, robj *body) {
-    char funcname[43];
-    dictEntry *de;
-
-    funcname[0] = 'f';
-    funcname[1] = '_';
-    sha1hex(funcname+2,body->ptr,sdslen(body->ptr));
-
-    sds sha = sdsnewlen(funcname+2,40);
-    if ((de = dictFind(server.lua_scripts,sha)) != NULL) {
-        sdsfree(sha);
-        return dictGetKey(de);
-    }
-
-    sds funcdef = sdsempty();
-    funcdef = sdscat(funcdef,"function ");
-    funcdef = sdscatlen(funcdef,funcname,42);
-    funcdef = sdscatlen(funcdef,"() ",3);
-    funcdef = sdscatlen(funcdef,body->ptr,sdslen(body->ptr));
-    funcdef = sdscatlen(funcdef,"\nend",4);
-
-    if (luaL_loadbuffer(lua,funcdef,sdslen(funcdef),"@user_script")) {
-        if (c != NULL) {
-            addReplyErrorFormat(c,
-                "Error compiling script (new function): %s\n",
-                lua_tostring(lua,-1));
-        }
-        lua_pop(lua,1);
-        sdsfree(sha);
-        sdsfree(funcdef);
-        return NULL;
-    }
-    sdsfree(funcdef);
-
-    if (lua_pcall(lua,0,0,0)) {
-        if (c != NULL) {
-            addReplyErrorFormat(c,"Error running script (new function): %s\n",
-                lua_tostring(lua,-1));
-        }
-        lua_pop(lua,1);
-        sdsfree(sha);
-        return NULL;
-    }
-
-    /* We also save a SHA1 -> Original script map in a dictionary
-     * so that we can replicate / write in the AOF all the
-     * EVALSHA commands as EVAL using the original script. */
-    int retval = dictAdd(server.lua_scripts,sha,body);
-    serverAssertWithInfo(c ? c : server.lua_client,NULL,retval == DICT_OK);
-    server.lua_scripts_mem += sdsZmallocSize(sha) + getStringObjectSdsUsedMemory(body);
-    incrRefCount(body);
-    return sha;
-}
-
-/* This is the Lua script "count" hook that we use to detect scripts timeout. */
-void luaMaskCountHook(lua_State *lua, lua_Debug *ar) {
-    long long elapsed = elapsedMs(server.lua_time_start);
-    UNUSED(ar);
-    UNUSED(lua);
-
-    /* Set the timeout condition if not already set and the maximum
-     * execution time was reached. */
-    if (elapsed >= server.lua_time_limit && server.lua_timedout == 0) {
-        serverLog(LL_WARNING,
-            "Lua slow script detected: still in execution after %lld milliseconds. "
-            "You can try killing the script using the SCRIPT KILL command. "
-            "Script SHA1 is: %s",
-            elapsed, server.lua_cur_script);
-        server.lua_timedout = 1;
-        blockingOperationStarts();
-        /* Once the script timeouts we reenter the event loop to permit others
-         * to call SCRIPT KILL or SHUTDOWN NOSAVE if needed. For this reason
-         * we need to mask the client executing the script from the event loop.
-         * If we don't do that the client may disconnect and could no longer be
-         * here when the EVAL command will return. */
-        protectClient(server.lua_caller);
-    }
-    if (server.lua_timedout) processEventsWhileBlocked();
-    if (server.lua_kill) {
-        serverLog(LL_WARNING,"Lua script killed by user with SCRIPT KILL.");
-
-        /*
-         * Set the hook to invoke all the time so the user
-         * will not be able to catch the error with pcall and invoke
-         * pcall again which will prevent the script from ever been killed
-         */
-        lua_sethook(lua, luaMaskCountHook, LUA_MASKLINE, 0);
-
-        lua_pushstring(lua,"Script killed by user with SCRIPT KILL...");
-        lua_error(lua);
-    }
-}
-
-void prepareLuaClient(void) {
-    /* Select the right DB in the context of the Lua client */
-    selectDb(server.lua_client,server.lua_caller->db->id);
-    server.lua_client->resp = 2; /* Default is RESP2, scripts can change it. */
-
-    /* If we are in MULTI context, flag Lua client as CLIENT_MULTI. */
-    if (server.lua_caller->flags & CLIENT_MULTI) {
-        server.lua_client->flags |= CLIENT_MULTI;
-    }
-}
-
-void resetLuaClient(void) {
-    /* After the script done, remove the MULTI state. */
-    server.lua_client->flags &= ~CLIENT_MULTI;
-}
-
-void evalGenericCommand(client *c, int evalsha) {
-    lua_State *lua = server.lua;
-    char funcname[43];
-    long long numkeys;
-    long long initial_server_dirty = server.dirty;
-    int delhook = 0, err;
-
-    /* When we replicate whole scripts, we want the same PRNG sequence at
-     * every call so that our PRNG is not affected by external state. */
-    redisSrand48(0);
-
-    /* We set this flag to zero to remember that so far no random command
-     * was called. This way we can allow the user to call commands like
-     * SRANDMEMBER or RANDOMKEY from Lua scripts as far as no write command
-     * is called (otherwise the replication and AOF would end with non
-     * deterministic sequences).
-     *
-     * Thanks to this flag we'll raise an error every time a write command
-     * is called after a random command was used. */
-    server.lua_random_dirty = 0;
-    server.lua_write_dirty = 0;
-    server.lua_replicate_commands = server.lua_always_replicate_commands;
-    server.lua_multi_emitted = 0;
-    server.lua_repl = PROPAGATE_AOF|PROPAGATE_REPL;
-
-    /* Get the number of arguments that are keys */
-    if (getLongLongFromObjectOrReply(c,c->argv[2],&numkeys,NULL) != C_OK)
-        return;
-    if (numkeys > (c->argc - 3)) {
-        addReplyError(c,"Number of keys can't be greater than number of args");
-        return;
-    } else if (numkeys < 0) {
-        addReplyError(c,"Number of keys can't be negative");
-        return;
-    }
-
-    /* We obtain the script SHA1, then check if this function is already
-     * defined into the Lua state */
-    funcname[0] = 'f';
-    funcname[1] = '_';
-    if (!evalsha) {
-        /* Hash the code if this is an EVAL call */
-        sha1hex(funcname+2,c->argv[1]->ptr,sdslen(c->argv[1]->ptr));
-    } else {
-        /* We already have the SHA if it is an EVALSHA */
-        int j;
-        char *sha = c->argv[1]->ptr;
-
-        /* Convert to lowercase. We don't use tolower since the function
-         * managed to always show up in the profiler output consuming
-         * a non trivial amount of time. */
-        for (j = 0; j < 40; j++)
-            funcname[j+2] = (sha[j] >= 'A' && sha[j] <= 'Z') ?
-                sha[j]+('a'-'A') : sha[j];
-        funcname[42] = '\0';
-    }
-
-    /* Push the pcall error handler function on the stack. */
-    lua_getglobal(lua, "__redis__err__handler");
-
-    /* Try to lookup the Lua function */
-    lua_getglobal(lua, funcname);
-    if (lua_isnil(lua,-1)) {
-        lua_pop(lua,1); /* remove the nil from the stack */
-        /* Function not defined... let's define it if we have the
-         * body of the function. If this is an EVALSHA call we can just
-         * return an error. */
-        if (evalsha) {
-            lua_pop(lua,1); /* remove the error handler from the stack. */
-            addReplyErrorObject(c, shared.noscripterr);
-            return;
-        }
-        if (luaCreateFunction(c,lua,c->argv[1]) == NULL) {
-            lua_pop(lua,1); /* remove the error handler from the stack. */
-            /* The error is sent to the client by luaCreateFunction()
-             * itself when it returns NULL. */
-            return;
-        }
-        /* Now the following is guaranteed to return non nil */
-        lua_getglobal(lua, funcname);
-        serverAssert(!lua_isnil(lua,-1));
-    }
-
-    /* Populate the argv and keys table accordingly to the arguments that
-     * EVAL received. */
-    luaSetGlobalArray(lua,"KEYS",c->argv+3,numkeys);
-    luaSetGlobalArray(lua,"ARGV",c->argv+3+numkeys,c->argc-3-numkeys);
-
-    /* Set a hook in order to be able to stop the script execution if it
-     * is running for too much time.
-     * We set the hook only if the time limit is enabled as the hook will
-     * make the Lua script execution slower.
-     *
-     * If we are debugging, we set instead a "line" hook so that the
-     * debugger is call-back at every line executed by the script. */
-    server.in_eval = 1;
-    server.lua_caller = c;
-    server.lua_cur_script = funcname + 2;
-    server.lua_time_start = getMonotonicUs();
-    server.lua_time_snapshot = mstime();
-    server.lua_kill = 0;
-    if (server.lua_time_limit > 0 && ldb.active == 0) {
-        lua_sethook(lua,luaMaskCountHook,LUA_MASKCOUNT,100000);
-        delhook = 1;
-    } else if (ldb.active) {
-        lua_sethook(server.lua,luaLdbLineHook,LUA_MASKLINE|LUA_MASKCOUNT,100000);
-        delhook = 1;
-    }
-
-    prepareLuaClient();
-
-    /* At this point whether this script was never seen before or if it was
-     * already defined, we can call it. We have zero arguments and expect
-     * a single return value. */
-    err = lua_pcall(lua,0,1,-2);
-
-    resetLuaClient();
-
-    /* Perform some cleanup that we need to do both on error and success. */
-    if (delhook) lua_sethook(lua,NULL,0,0); /* Disable hook */
-    if (server.lua_timedout) {
-        server.lua_timedout = 0;
-        blockingOperationEnds();
-        /* Restore the client that was protected when the script timeout
-         * was detected. */
-        unprotectClient(c);
-        if (server.masterhost && server.master)
-            queueClientForReprocessing(server.master);
-    }
-    server.in_eval = 0;
-    server.lua_caller = NULL;
-    server.lua_cur_script = NULL;
-
-    /* Call the Lua garbage collector from time to time to avoid a
-     * full cycle performed by Lua, which adds too latency.
-     *
-     * The call is performed every LUA_GC_CYCLE_PERIOD executed commands
-     * (and for LUA_GC_CYCLE_PERIOD collection steps) because calling it
-     * for every command uses too much CPU. */
-    #define LUA_GC_CYCLE_PERIOD 50
-    {
-        static long gc_count = 0;
-
-        gc_count++;
-        if (gc_count == LUA_GC_CYCLE_PERIOD) {
-            lua_gc(lua,LUA_GCSTEP,LUA_GC_CYCLE_PERIOD);
-            gc_count = 0;
-        }
-    }
-
-    if (err) {
-        addReplyErrorFormat(c,"Error running script (call to %s): %s\n",
-            funcname, lua_tostring(lua,-1));
-        lua_pop(lua,2); /* Consume the Lua reply and remove error handler. */
-    } else {
-        /* On success convert the Lua return value into Redis protocol, and
-         * send it to * the client. */
-        luaReplyToRedisReply(c,lua); /* Convert and consume the reply. */
-        lua_pop(lua,1); /* Remove the error handler. */
-    }
-
-    /* If we are using single commands replication, emit EXEC if there
-     * was at least a write. */
-    if (server.lua_replicate_commands) {
-        preventCommandPropagation(c);
-        if (server.lua_multi_emitted) {
-            execCommandPropagateExec(c->db->id);
-        }
-    }
-
-    /* EVALSHA should be propagated to Slave and AOF file as full EVAL, unless
-     * we are sure that the script was already in the context of all the
-     * attached slaves *and* the current AOF file if enabled.
-     *
-     * To do so we use a cache of SHA1s of scripts that we already propagated
-     * as full EVAL, that's called the Replication Script Cache.
-     *
-     * For replication, everytime a new slave attaches to the master, we need to
-     * flush our cache of scripts that can be replicated as EVALSHA, while
-     * for AOF we need to do so every time we rewrite the AOF file. */
-    if (evalsha && !server.lua_replicate_commands) {
-        if (!replicationScriptCacheExists(c->argv[1]->ptr)) {
-            /* This script is not in our script cache, replicate it as
-             * EVAL, then add it into the script cache, as from now on
-             * slaves and AOF know about it. */
-            robj *script = dictFetchValue(server.lua_scripts,c->argv[1]->ptr);
-
-            replicationScriptCacheAdd(c->argv[1]->ptr);
-            serverAssertWithInfo(c,NULL,script != NULL);
-
-            /* If the script did not produce any changes in the dataset we want
-             * just to replicate it as SCRIPT LOAD, otherwise we risk running
-             * an aborted script on slaves (that may then produce results there)
-             * or just running a CPU costly read-only script on the slaves. */
-            if (server.dirty == initial_server_dirty) {
-                rewriteClientCommandVector(c,3,
-                    shared.script,
-                    shared.load,
-                    script);
-            } else {
-                rewriteClientCommandArgument(c,0,shared.eval);
-                rewriteClientCommandArgument(c,1,script);
-            }
-            forceCommandPropagation(c,PROPAGATE_REPL|PROPAGATE_AOF);
-        }
-    }
-}
-
-void evalCommand(client *c) {
-    /* Explicitly feed monitor here so that lua commands appear after their
-     * script command. */
-    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
-    if (!(c->flags & CLIENT_LUA_DEBUG))
-        evalGenericCommand(c,0);
-    else
-        evalGenericCommandWithDebugging(c,0);
-}
-
-void evalShaCommand(client *c) {
-    /* Explicitly feed monitor here so that lua commands appear after their
-     * script command. */
-    replicationFeedMonitors(c,server.monitors,c->db->id,c->argv,c->argc);
-    if (sdslen(c->argv[1]->ptr) != 40) {
-        /* We know that a match is not possible if the provided SHA is
-         * not the right length. So we return an error ASAP, this way
-         * evalGenericCommand() can be implemented without string length
-         * sanity check */
-        addReplyErrorObject(c, shared.noscripterr);
-        return;
-    }
-    if (!(c->flags & CLIENT_LUA_DEBUG))
-        evalGenericCommand(c,1);
-    else {
-        addReplyError(c,"Please use EVAL instead of EVALSHA for debugging");
-        return;
-    }
-}
-
-void scriptCommand(client *c) {
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"DEBUG (YES|SYNC|NO)",
-"    Set the debug mode for subsequent scripts executed.",
-"EXISTS <sha1> [<sha1> ...]",
-"    Return information about the existence of the scripts in the script cache.",
-"FLUSH [ASYNC|SYNC]",
-"    Flush the Lua scripts cache. Very dangerous on replicas.",
-"    When called without the optional mode argument, the behavior is determined by the",
-"    lazyfree-lazy-user-flush configuration directive. Valid modes are:",
-"    * ASYNC: Asynchronously flush the scripts cache.",
-"    * SYNC: Synchronously flush the scripts cache.",
-"KILL",
-"    Kill the currently executing Lua script.",
-"LOAD <script>",
-"    Load a script into the scripts cache without executing it.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (c->argc >= 2 && !strcasecmp(c->argv[1]->ptr,"flush")) {
-        int async = 0;
-        if (c->argc == 3 && !strcasecmp(c->argv[2]->ptr,"sync")) {
-            async = 0;
-        } else if (c->argc == 3 && !strcasecmp(c->argv[2]->ptr,"async")) {
-            async = 1;
-        } else if (c->argc == 2) {
-            async = server.lazyfree_lazy_user_flush ? 1 : 0;
-        } else {
-            addReplyError(c,"SCRIPT FLUSH only support SYNC|ASYNC option");
-            return;
-        }
-        scriptingReset(async);
-        addReply(c,shared.ok);
-        replicationScriptCacheFlush();
-        server.dirty++; /* Propagating this command is a good idea. */
-    } else if (c->argc >= 2 && !strcasecmp(c->argv[1]->ptr,"exists")) {
-        int j;
-
-        addReplyArrayLen(c, c->argc-2);
-        for (j = 2; j < c->argc; j++) {
-            if (dictFind(server.lua_scripts,c->argv[j]->ptr))
-                addReply(c,shared.cone);
-            else
-                addReply(c,shared.czero);
-        }
-    } else if (c->argc == 3 && !strcasecmp(c->argv[1]->ptr,"load")) {
-        sds sha = luaCreateFunction(c,server.lua,c->argv[2]);
-        if (sha == NULL) return; /* The error was sent by luaCreateFunction(). */
-        addReplyBulkCBuffer(c,sha,40);
-        forceCommandPropagation(c,PROPAGATE_REPL|PROPAGATE_AOF);
-    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"kill")) {
-        if (server.lua_caller == NULL) {
-            addReplyError(c,"-NOTBUSY No scripts in execution right now.");
-        } else if (server.lua_caller->flags & CLIENT_MASTER) {
-            addReplyError(c,"-UNKILLABLE The busy script was sent by a master instance in the context of replication and cannot be killed.");
-        } else if (server.lua_write_dirty) {
-            addReplyError(c,"-UNKILLABLE Sorry the script already executed write commands against the dataset. You can either wait the script termination or kill the server in a hard way using the SHUTDOWN NOSAVE command.");
-        } else {
-            server.lua_kill = 1;
-            addReply(c,shared.ok);
-        }
-    } else if (c->argc == 3 && !strcasecmp(c->argv[1]->ptr,"debug")) {
-        if (clientHasPendingReplies(c)) {
-            addReplyError(c,"SCRIPT DEBUG must be called outside a pipeline");
-            return;
-        }
-        if (!strcasecmp(c->argv[2]->ptr,"no")) {
-            ldbDisable(c);
-            addReply(c,shared.ok);
-        } else if (!strcasecmp(c->argv[2]->ptr,"yes")) {
-            ldbEnable(c);
-            addReply(c,shared.ok);
-        } else if (!strcasecmp(c->argv[2]->ptr,"sync")) {
-            ldbEnable(c);
-            addReply(c,shared.ok);
-            c->flags |= CLIENT_LUA_DEBUG_SYNC;
-        } else {
-            addReplyError(c,"Use SCRIPT DEBUG YES/SYNC/NO");
-            return;
-        }
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* ---------------------------------------------------------------------------
- * LDB: Redis Lua debugging facilities
- * ------------------------------------------------------------------------- */
-
-/* Initialize Lua debugger data structures. */
-void ldbInit(void) {
-    ldb.conn = NULL;
-    ldb.active = 0;
-    ldb.logs = listCreate();
-    listSetFreeMethod(ldb.logs,(void (*)(void*))sdsfree);
-    ldb.children = listCreate();
-    ldb.src = NULL;
-    ldb.lines = 0;
-    ldb.cbuf = sdsempty();
-}
-
-/* Remove all the pending messages in the specified list. */
-void ldbFlushLog(list *log) {
-    listNode *ln;
-
-    while((ln = listFirst(log)) != NULL)
-        listDelNode(log,ln);
-}
-
-/* Enable debug mode of Lua scripts for this client. */
-void ldbEnable(client *c) {
-    c->flags |= CLIENT_LUA_DEBUG;
-    ldbFlushLog(ldb.logs);
-    ldb.conn = c->conn;
-    ldb.step = 1;
-    ldb.bpcount = 0;
-    ldb.luabp = 0;
-    sdsfree(ldb.cbuf);
-    ldb.cbuf = sdsempty();
-    ldb.maxlen = LDB_MAX_LEN_DEFAULT;
-    ldb.maxlen_hint_sent = 0;
-}
-
-/* Exit debugging mode from the POV of client. This function is not enough
- * to properly shut down a client debugging session, see ldbEndSession()
- * for more information. */
-void ldbDisable(client *c) {
-    c->flags &= ~(CLIENT_LUA_DEBUG|CLIENT_LUA_DEBUG_SYNC);
-}
-
-/* Append a log entry to the specified LDB log. */
-void ldbLog(sds entry) {
-    listAddNodeTail(ldb.logs,entry);
-}
-
-/* A version of ldbLog() which prevents producing logs greater than
- * ldb.maxlen. The first time the limit is reached a hint is generated
- * to inform the user that reply trimming can be disabled using the
- * debugger "maxlen" command. */
-void ldbLogWithMaxLen(sds entry) {
-    int trimmed = 0;
-    if (ldb.maxlen && sdslen(entry) > ldb.maxlen) {
-        sdsrange(entry,0,ldb.maxlen-1);
-        entry = sdscatlen(entry," ...",4);
-        trimmed = 1;
-    }
-    ldbLog(entry);
-    if (trimmed && ldb.maxlen_hint_sent == 0) {
-        ldb.maxlen_hint_sent = 1;
-        ldbLog(sdsnew(
-        "<hint> The above reply was trimmed. Use 'maxlen 0' to disable trimming."));
-    }
-}
-
-/* Send ldb.logs to the debugging client as a multi-bulk reply
- * consisting of simple strings. Log entries which include newlines have them
- * replaced with spaces. The entries sent are also consumed. */
-void ldbSendLogs(void) {
-    sds proto = sdsempty();
-    proto = sdscatfmt(proto,"*%i\r\n", (int)listLength(ldb.logs));
-    while(listLength(ldb.logs)) {
-        listNode *ln = listFirst(ldb.logs);
-        proto = sdscatlen(proto,"+",1);
-        sdsmapchars(ln->value,"\r\n","  ",2);
-        proto = sdscatsds(proto,ln->value);
-        proto = sdscatlen(proto,"\r\n",2);
-        listDelNode(ldb.logs,ln);
-    }
-    if (connWrite(ldb.conn,proto,sdslen(proto)) == -1) {
-        /* Avoid warning. We don't check the return value of write()
-         * since the next read() will catch the I/O error and will
-         * close the debugging session. */
-    }
-    sdsfree(proto);
-}
-
-/* Start a debugging session before calling EVAL implementation.
- * The technique we use is to capture the client socket file descriptor,
- * in order to perform direct I/O with it from within Lua hooks. This
- * way we don't have to re-enter Redis in order to handle I/O.
- *
- * The function returns 1 if the caller should proceed to call EVAL,
- * and 0 if instead the caller should abort the operation (this happens
- * for the parent in a forked session, since it's up to the children
- * to continue, or when fork returned an error).
- *
- * The caller should call ldbEndSession() only if ldbStartSession()
- * returned 1. */
-int ldbStartSession(client *c) {
-    ldb.forked = (c->flags & CLIENT_LUA_DEBUG_SYNC) == 0;
-    if (ldb.forked) {
-        pid_t cp = redisFork(CHILD_TYPE_LDB);
-        if (cp == -1) {
-            addReplyError(c,"Fork() failed: can't run EVAL in debugging mode.");
-            return 0;
-        } else if (cp == 0) {
-            /* Child. Let's ignore important signals handled by the parent. */
-            struct sigaction act;
-            sigemptyset(&act.sa_mask);
-            act.sa_flags = 0;
-            act.sa_handler = SIG_IGN;
-            sigaction(SIGTERM, &act, NULL);
-            sigaction(SIGINT, &act, NULL);
-
-            /* Log the creation of the child and close the listening
-             * socket to make sure if the parent crashes a reset is sent
-             * to the clients. */
-            serverLog(LL_WARNING,"Redis forked for debugging eval");
-        } else {
-            /* Parent */
-            listAddNodeTail(ldb.children,(void*)(unsigned long)cp);
-            freeClientAsync(c); /* Close the client in the parent side. */
-            return 0;
-        }
-    } else {
-        serverLog(LL_WARNING,
-            "Redis synchronous debugging eval session started");
-    }
-
-    /* Setup our debugging session. */
-    connBlock(ldb.conn);
-    connSendTimeout(ldb.conn,5000);
-    ldb.active = 1;
-
-    /* First argument of EVAL is the script itself. We split it into different
-     * lines since this is the way the debugger accesses the source code. */
-    sds srcstring = sdsdup(c->argv[1]->ptr);
-    size_t srclen = sdslen(srcstring);
-    while(srclen && (srcstring[srclen-1] == '\n' ||
-                     srcstring[srclen-1] == '\r'))
-    {
-        srcstring[--srclen] = '\0';
-    }
-    sdssetlen(srcstring,srclen);
-    ldb.src = sdssplitlen(srcstring,sdslen(srcstring),"\n",1,&ldb.lines);
-    sdsfree(srcstring);
-    return 1;
-}
-
-/* End a debugging session after the EVAL call with debugging enabled
- * returned. */
-void ldbEndSession(client *c) {
-    /* Emit the remaining logs and an <endsession> mark. */
-    ldbLog(sdsnew("<endsession>"));
-    ldbSendLogs();
-
-    /* If it's a fork()ed session, we just exit. */
-    if (ldb.forked) {
-        writeToClient(c,0);
-        serverLog(LL_WARNING,"Lua debugging session child exiting");
-        exitFromChild(0);
-    } else {
-        serverLog(LL_WARNING,
-            "Redis synchronous debugging eval session ended");
-    }
-
-    /* Otherwise let's restore client's state. */
-    connNonBlock(ldb.conn);
-    connSendTimeout(ldb.conn,0);
-
-    /* Close the client connection after sending the final EVAL reply
-     * in order to signal the end of the debugging session. */
-    c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-
-    /* Cleanup. */
-    sdsfreesplitres(ldb.src,ldb.lines);
-    ldb.lines = 0;
-    ldb.active = 0;
-}
-
-/* If the specified pid is among the list of children spawned for
- * forked debugging sessions, it is removed from the children list.
- * If the pid was found non-zero is returned. */
-int ldbRemoveChild(pid_t pid) {
-    listNode *ln = listSearchKey(ldb.children,(void*)(unsigned long)pid);
-    if (ln) {
-        listDelNode(ldb.children,ln);
-        return 1;
-    }
-    return 0;
-}
-
-/* Return the number of children we still did not receive termination
- * acknowledge via wait() in the parent process. */
-int ldbPendingChildren(void) {
-    return listLength(ldb.children);
-}
-
-/* Kill all the forked sessions. */
-void ldbKillForkedSessions(void) {
-    listIter li;
-    listNode *ln;
-
-    listRewind(ldb.children,&li);
-    while((ln = listNext(&li))) {
-        pid_t pid = (unsigned long) ln->value;
-        serverLog(LL_WARNING,"Killing debugging session %ld",(long)pid);
-        kill(pid,SIGKILL);
-    }
-    listRelease(ldb.children);
-    ldb.children = listCreate();
-}
-
-/* Wrapper for EVAL / EVALSHA that enables debugging, and makes sure
- * that when EVAL returns, whatever happened, the session is ended. */
-void evalGenericCommandWithDebugging(client *c, int evalsha) {
-    if (ldbStartSession(c)) {
-        evalGenericCommand(c,evalsha);
-        ldbEndSession(c);
-    } else {
-        ldbDisable(c);
-    }
-}
-
-/* Return a pointer to ldb.src source code line, considering line to be
- * one-based, and returning a special string for out of range lines. */
-char *ldbGetSourceLine(int line) {
-    int idx = line-1;
-    if (idx < 0 || idx >= ldb.lines) return "<out of range source code line>";
-    return ldb.src[idx];
-}
-
-/* Return true if there is a breakpoint in the specified line. */
-int ldbIsBreakpoint(int line) {
-    int j;
-
-    for (j = 0; j < ldb.bpcount; j++)
-        if (ldb.bp[j] == line) return 1;
-    return 0;
-}
-
-/* Add the specified breakpoint. Ignore it if we already reached the max.
- * Returns 1 if the breakpoint was added (or was already set). 0 if there is
- * no space for the breakpoint or if the line is invalid. */
-int ldbAddBreakpoint(int line) {
-    if (line <= 0 || line > ldb.lines) return 0;
-    if (!ldbIsBreakpoint(line) && ldb.bpcount != LDB_BREAKPOINTS_MAX) {
-        ldb.bp[ldb.bpcount++] = line;
-        return 1;
-    }
-    return 0;
-}
-
-/* Remove the specified breakpoint, returning 1 if the operation was
- * performed or 0 if there was no such breakpoint. */
-int ldbDelBreakpoint(int line) {
-    int j;
-
-    for (j = 0; j < ldb.bpcount; j++) {
-        if (ldb.bp[j] == line) {
-            ldb.bpcount--;
-            memmove(ldb.bp+j,ldb.bp+j+1,ldb.bpcount-j);
-            return 1;
-        }
-    }
-    return 0;
-}
-
-/* Expect a valid multi-bulk command in the debugging client query buffer.
- * On success the command is parsed and returned as an array of SDS strings,
- * otherwise NULL is returned and there is to read more buffer. */
-sds *ldbReplParseCommand(int *argcp, char** err) {
-    static char* protocol_error = "protocol error";
-    sds *argv = NULL;
-    int argc = 0;
-    if (sdslen(ldb.cbuf) == 0) return NULL;
-
-    /* Working on a copy is simpler in this case. We can modify it freely
-     * for the sake of simpler parsing. */
-    sds copy = sdsdup(ldb.cbuf);
-    char *p = copy;
-
-    /* This Redis protocol parser is a joke... just the simplest thing that
-     * works in this context. It is also very forgiving regarding broken
-     * protocol. */
-
-    /* Seek and parse *<count>\r\n. */
-    p = strchr(p,'*'); if (!p) goto protoerr;
-    char *plen = p+1; /* Multi bulk len pointer. */
-    p = strstr(p,"\r\n"); if (!p) goto keep_reading;
-    *p = '\0'; p += 2;
-    *argcp = atoi(plen);
-    if (*argcp <= 0 || *argcp > 1024) goto protoerr;
-
-    /* Parse each argument. */
-    argv = zmalloc(sizeof(sds)*(*argcp));
-    argc = 0;
-    while(argc < *argcp) {
-        /* reached the end but there should be more data to read */
-        if (*p == '\0') goto keep_reading;
-
-        if (*p != '$') goto protoerr;
-        plen = p+1; /* Bulk string len pointer. */
-        p = strstr(p,"\r\n"); if (!p) goto keep_reading;
-        *p = '\0'; p += 2;
-        int slen = atoi(plen); /* Length of this arg. */
-        if (slen <= 0 || slen > 1024) goto protoerr;
-        if ((size_t)(p + slen + 2 - copy) > sdslen(copy) ) goto keep_reading;
-        argv[argc++] = sdsnewlen(p,slen);
-        p += slen; /* Skip the already parsed argument. */
-        if (p[0] != '\r' || p[1] != '\n') goto protoerr;
-        p += 2; /* Skip \r\n. */
-    }
-    sdsfree(copy);
-    return argv;
-
-protoerr:
-    *err = protocol_error;
-keep_reading:
-    sdsfreesplitres(argv,argc);
-    sdsfree(copy);
-    return NULL;
-}
-
-/* Log the specified line in the Lua debugger output. */
-void ldbLogSourceLine(int lnum) {
-    char *line = ldbGetSourceLine(lnum);
-    char *prefix;
-    int bp = ldbIsBreakpoint(lnum);
-    int current = ldb.currentline == lnum;
-
-    if (current && bp)
-        prefix = "->#";
-    else if (current)
-        prefix = "-> ";
-    else if (bp)
-        prefix = "  #";
-    else
-        prefix = "   ";
-    sds thisline = sdscatprintf(sdsempty(),"%s%-3d %s", prefix, lnum, line);
-    ldbLog(thisline);
-}
-
-/* Implement the "list" command of the Lua debugger. If around is 0
- * the whole file is listed, otherwise only a small portion of the file
- * around the specified line is shown. When a line number is specified
- * the amount of context (lines before/after) is specified via the
- * 'context' argument. */
-void ldbList(int around, int context) {
-    int j;
-
-    for (j = 1; j <= ldb.lines; j++) {
-        if (around != 0 && abs(around-j) > context) continue;
-        ldbLogSourceLine(j);
-    }
-}
-
-/* Append a human readable representation of the Lua value at position 'idx'
- * on the stack of the 'lua' state, to the SDS string passed as argument.
- * The new SDS string with the represented value attached is returned.
- * Used in order to implement ldbLogStackValue().
- *
- * The element is not automatically removed from the stack, nor it is
- * converted to a different type. */
-#define LDB_MAX_VALUES_DEPTH (LUA_MINSTACK/2)
-sds ldbCatStackValueRec(sds s, lua_State *lua, int idx, int level) {
-    int t = lua_type(lua,idx);
-
-    if (level++ == LDB_MAX_VALUES_DEPTH)
-        return sdscat(s,"<max recursion level reached! Nested table?>");
-
-    switch(t) {
-    case LUA_TSTRING:
-        {
-        size_t strl;
-        char *strp = (char*)lua_tolstring(lua,idx,&strl);
-        s = sdscatrepr(s,strp,strl);
-        }
-        break;
-    case LUA_TBOOLEAN:
-        s = sdscat(s,lua_toboolean(lua,idx) ? "true" : "false");
-        break;
-    case LUA_TNUMBER:
-        s = sdscatprintf(s,"%g",(double)lua_tonumber(lua,idx));
-        break;
-    case LUA_TNIL:
-        s = sdscatlen(s,"nil",3);
-        break;
-    case LUA_TTABLE:
-        {
-        int expected_index = 1; /* First index we expect in an array. */
-        int is_array = 1; /* Will be set to null if check fails. */
-        /* Note: we create two representations at the same time, one
-         * assuming the table is an array, one assuming it is not. At the
-         * end we know what is true and select the right one. */
-        sds repr1 = sdsempty();
-        sds repr2 = sdsempty();
-        lua_pushnil(lua); /* The first key to start the iteration is nil. */
-        while (lua_next(lua,idx-1)) {
-            /* Test if so far the table looks like an array. */
-            if (is_array &&
-                (lua_type(lua,-2) != LUA_TNUMBER ||
-                 lua_tonumber(lua,-2) != expected_index)) is_array = 0;
-            /* Stack now: table, key, value */
-            /* Array repr. */
-            repr1 = ldbCatStackValueRec(repr1,lua,-1,level);
-            repr1 = sdscatlen(repr1,"; ",2);
-            /* Full repr. */
-            repr2 = sdscatlen(repr2,"[",1);
-            repr2 = ldbCatStackValueRec(repr2,lua,-2,level);
-            repr2 = sdscatlen(repr2,"]=",2);
-            repr2 = ldbCatStackValueRec(repr2,lua,-1,level);
-            repr2 = sdscatlen(repr2,"; ",2);
-            lua_pop(lua,1); /* Stack: table, key. Ready for next iteration. */
-            expected_index++;
-        }
-        /* Strip the last " ;" from both the representations. */
-        if (sdslen(repr1)) sdsrange(repr1,0,-3);
-        if (sdslen(repr2)) sdsrange(repr2,0,-3);
-        /* Select the right one and discard the other. */
-        s = sdscatlen(s,"{",1);
-        s = sdscatsds(s,is_array ? repr1 : repr2);
-        s = sdscatlen(s,"}",1);
-        sdsfree(repr1);
-        sdsfree(repr2);
-        }
-        break;
-    case LUA_TFUNCTION:
-    case LUA_TUSERDATA:
-    case LUA_TTHREAD:
-    case LUA_TLIGHTUSERDATA:
-        {
-        const void *p = lua_topointer(lua,idx);
-        char *typename = "unknown";
-        if (t == LUA_TFUNCTION) typename = "function";
-        else if (t == LUA_TUSERDATA) typename = "userdata";
-        else if (t == LUA_TTHREAD) typename = "thread";
-        else if (t == LUA_TLIGHTUSERDATA) typename = "light-userdata";
-        s = sdscatprintf(s,"\"%s@%p\"",typename,p);
-        }
-        break;
-    default:
-        s = sdscat(s,"\"<unknown-lua-type>\"");
-        break;
-    }
-    return s;
-}
-
-/* Higher level wrapper for ldbCatStackValueRec() that just uses an initial
- * recursion level of '0'. */
-sds ldbCatStackValue(sds s, lua_State *lua, int idx) {
-    return ldbCatStackValueRec(s,lua,idx,0);
-}
-
-/* Produce a debugger log entry representing the value of the Lua object
- * currently on the top of the stack. The element is ot popped nor modified.
- * Check ldbCatStackValue() for the actual implementation. */
-void ldbLogStackValue(lua_State *lua, char *prefix) {
-    sds s = sdsnew(prefix);
-    s = ldbCatStackValue(s,lua,-1);
-    ldbLogWithMaxLen(s);
-}
-
-char *ldbRedisProtocolToHuman_Int(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Bulk(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Status(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_MultiBulk(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Set(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Map(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Null(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Bool(sds *o, char *reply);
-char *ldbRedisProtocolToHuman_Double(sds *o, char *reply);
-
-/* Get Redis protocol from 'reply' and appends it in human readable form to
- * the passed SDS string 'o'.
- *
- * Note that the SDS string is passed by reference (pointer of pointer to
- * char*) so that we can return a modified pointer, as for SDS semantics. */
-char *ldbRedisProtocolToHuman(sds *o, char *reply) {
-    char *p = reply;
-    switch(*p) {
-    case ':': p = ldbRedisProtocolToHuman_Int(o,reply); break;
-    case '$': p = ldbRedisProtocolToHuman_Bulk(o,reply); break;
-    case '+': p = ldbRedisProtocolToHuman_Status(o,reply); break;
-    case '-': p = ldbRedisProtocolToHuman_Status(o,reply); break;
-    case '*': p = ldbRedisProtocolToHuman_MultiBulk(o,reply); break;
-    case '~': p = ldbRedisProtocolToHuman_Set(o,reply); break;
-    case '%': p = ldbRedisProtocolToHuman_Map(o,reply); break;
-    case '_': p = ldbRedisProtocolToHuman_Null(o,reply); break;
-    case '#': p = ldbRedisProtocolToHuman_Bool(o,reply); break;
-    case ',': p = ldbRedisProtocolToHuman_Double(o,reply); break;
-    }
-    return p;
-}
-
-/* The following functions are helpers for ldbRedisProtocolToHuman(), each
- * take care of a given Redis return type. */
-
-char *ldbRedisProtocolToHuman_Int(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    *o = sdscatlen(*o,reply+1,p-reply-1);
-    return p+2;
-}
-
-char *ldbRedisProtocolToHuman_Bulk(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long bulklen;
-
-    string2ll(reply+1,p-reply-1,&bulklen);
-    if (bulklen == -1) {
-        *o = sdscatlen(*o,"NULL",4);
-        return p+2;
-    } else {
-        *o = sdscatrepr(*o,p+2,bulklen);
-        return p+2+bulklen+2;
-    }
-}
-
-char *ldbRedisProtocolToHuman_Status(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-
-    *o = sdscatrepr(*o,reply,p-reply);
-    return p+2;
-}
-
-char *ldbRedisProtocolToHuman_MultiBulk(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long mbulklen;
-    int j = 0;
-
-    string2ll(reply+1,p-reply-1,&mbulklen);
-    p += 2;
-    if (mbulklen == -1) {
-        *o = sdscatlen(*o,"NULL",4);
-        return p;
-    }
-    *o = sdscatlen(*o,"[",1);
-    for (j = 0; j < mbulklen; j++) {
-        p = ldbRedisProtocolToHuman(o,p);
-        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
-    }
-    *o = sdscatlen(*o,"]",1);
-    return p;
-}
-
-char *ldbRedisProtocolToHuman_Set(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long mbulklen;
-    int j = 0;
-
-    string2ll(reply+1,p-reply-1,&mbulklen);
-    p += 2;
-    *o = sdscatlen(*o,"~(",2);
-    for (j = 0; j < mbulklen; j++) {
-        p = ldbRedisProtocolToHuman(o,p);
-        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
-    }
-    *o = sdscatlen(*o,")",1);
-    return p;
-}
-
-char *ldbRedisProtocolToHuman_Map(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    long long mbulklen;
-    int j = 0;
-
-    string2ll(reply+1,p-reply-1,&mbulklen);
-    p += 2;
-    *o = sdscatlen(*o,"{",1);
-    for (j = 0; j < mbulklen; j++) {
-        p = ldbRedisProtocolToHuman(o,p);
-        *o = sdscatlen(*o," => ",4);
-        p = ldbRedisProtocolToHuman(o,p);
-        if (j != mbulklen-1) *o = sdscatlen(*o,",",1);
-    }
-    *o = sdscatlen(*o,"}",1);
-    return p;
-}
-
-char *ldbRedisProtocolToHuman_Null(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    *o = sdscatlen(*o,"(null)",6);
-    return p+2;
-}
-
-char *ldbRedisProtocolToHuman_Bool(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    if (reply[1] == 't')
-        *o = sdscatlen(*o,"#true",5);
-    else
-        *o = sdscatlen(*o,"#false",6);
-    return p+2;
-}
-
-char *ldbRedisProtocolToHuman_Double(sds *o, char *reply) {
-    char *p = strchr(reply+1,'\r');
-    *o = sdscatlen(*o,"(double) ",9);
-    *o = sdscatlen(*o,reply+1,p-reply-1);
-    return p+2;
-}
-
-/* Log a Redis reply as debugger output, in a human readable format.
- * If the resulting string is longer than 'len' plus a few more chars
- * used as prefix, it gets truncated. */
-void ldbLogRedisReply(char *reply) {
-    sds log = sdsnew("<reply> ");
-    ldbRedisProtocolToHuman(&log,reply);
-    ldbLogWithMaxLen(log);
-}
-
-/* Implements the "print <var>" command of the Lua debugger. It scans for Lua
- * var "varname" starting from the current stack frame up to the top stack
- * frame. The first matching variable is printed. */
-void ldbPrint(lua_State *lua, char *varname) {
-    lua_Debug ar;
-
-    int l = 0; /* Stack level. */
-    while (lua_getstack(lua,l,&ar) != 0) {
-        l++;
-        const char *name;
-        int i = 1; /* Variable index. */
-        while((name = lua_getlocal(lua,&ar,i)) != NULL) {
-            i++;
-            if (strcmp(varname,name) == 0) {
-                ldbLogStackValue(lua,"<value> ");
-                lua_pop(lua,1);
-                return;
-            } else {
-                lua_pop(lua,1); /* Discard the var name on the stack. */
-            }
-        }
-    }
-
-    /* Let's try with global vars in two selected cases */
-    if (!strcmp(varname,"ARGV") || !strcmp(varname,"KEYS")) {
-        lua_getglobal(lua, varname);
-        ldbLogStackValue(lua,"<value> ");
-        lua_pop(lua,1);
-    } else {
-        ldbLog(sdsnew("No such variable."));
-    }
-}
-
-/* Implements the "print" command (without arguments) of the Lua debugger.
- * Prints all the variables in the current stack frame. */
-void ldbPrintAll(lua_State *lua) {
-    lua_Debug ar;
-    int vars = 0;
-
-    if (lua_getstack(lua,0,&ar) != 0) {
-        const char *name;
-        int i = 1; /* Variable index. */
-        while((name = lua_getlocal(lua,&ar,i)) != NULL) {
-            i++;
-            if (!strstr(name,"(*temporary)")) {
-                sds prefix = sdscatprintf(sdsempty(),"<value> %s = ",name);
-                ldbLogStackValue(lua,prefix);
-                sdsfree(prefix);
-                vars++;
-            }
-            lua_pop(lua,1);
-        }
-    }
-
-    if (vars == 0) {
-        ldbLog(sdsnew("No local variables in the current context."));
-    }
-}
-
-/* Implements the break command to list, add and remove breakpoints. */
-void ldbBreak(sds *argv, int argc) {
-    if (argc == 1) {
-        if (ldb.bpcount == 0) {
-            ldbLog(sdsnew("No breakpoints set. Use 'b <line>' to add one."));
-            return;
-        } else {
-            ldbLog(sdscatfmt(sdsempty(),"%i breakpoints set:",ldb.bpcount));
-            int j;
-            for (j = 0; j < ldb.bpcount; j++)
-                ldbLogSourceLine(ldb.bp[j]);
-        }
-    } else {
-        int j;
-        for (j = 1; j < argc; j++) {
-            char *arg = argv[j];
-            long line;
-            if (!string2l(arg,sdslen(arg),&line)) {
-                ldbLog(sdscatfmt(sdsempty(),"Invalid argument:'%s'",arg));
-            } else {
-                if (line == 0) {
-                    ldb.bpcount = 0;
-                    ldbLog(sdsnew("All breakpoints removed."));
-                } else if (line > 0) {
-                    if (ldb.bpcount == LDB_BREAKPOINTS_MAX) {
-                        ldbLog(sdsnew("Too many breakpoints set."));
-                    } else if (ldbAddBreakpoint(line)) {
-                        ldbList(line,1);
-                    } else {
-                        ldbLog(sdsnew("Wrong line number."));
-                    }
-                } else if (line < 0) {
-                    if (ldbDelBreakpoint(-line))
-                        ldbLog(sdsnew("Breakpoint removed."));
-                    else
-                        ldbLog(sdsnew("No breakpoint in the specified line."));
-                }
-            }
-        }
-    }
-}
-
-/* Implements the Lua debugger "eval" command. It just compiles the user
- * passed fragment of code and executes it, showing the result left on
- * the stack. */
-void ldbEval(lua_State *lua, sds *argv, int argc) {
-    /* Glue the script together if it is composed of multiple arguments. */
-    sds code = sdsjoinsds(argv+1,argc-1," ",1);
-    sds expr = sdscatsds(sdsnew("return "),code);
-
-    /* Try to compile it as an expression, prepending "return ". */
-    if (luaL_loadbuffer(lua,expr,sdslen(expr),"@ldb_eval")) {
-        lua_pop(lua,1);
-        /* Failed? Try as a statement. */
-        if (luaL_loadbuffer(lua,code,sdslen(code),"@ldb_eval")) {
-            ldbLog(sdscatfmt(sdsempty(),"<error> %s",lua_tostring(lua,-1)));
-            lua_pop(lua,1);
-            sdsfree(code);
-            sdsfree(expr);
-            return;
-        }
-    }
-
-    /* Call it. */
-    sdsfree(code);
-    sdsfree(expr);
-    if (lua_pcall(lua,0,1,0)) {
-        ldbLog(sdscatfmt(sdsempty(),"<error> %s",lua_tostring(lua,-1)));
-        lua_pop(lua,1);
-        return;
-    }
-    ldbLogStackValue(lua,"<retval> ");
-    lua_pop(lua,1);
-}
-
-/* Implement the debugger "redis" command. We use a trick in order to make
- * the implementation very simple: we just call the Lua redis.call() command
- * implementation, with ldb.step enabled, so as a side effect the Redis command
- * and its reply are logged. */
-void ldbRedis(lua_State *lua, sds *argv, int argc) {
-    int j, saved_rc = server.lua_replicate_commands;
-
-    if (!lua_checkstack(lua, argc + 1)) {
-        /* Increase the Lua stack if needed to make sure there is enough room
-         * to push 'argc + 1' elements to the stack. On failure, return error.
-         * Notice that we need, in worst case, 'argc + 1' elements because we push all the arguments
-         * given by the user (without the first argument) and we also push the 'redis' global table and
-         * 'redis.call' function so:
-         * (1 (redis table)) + (1 (redis.call function)) + (argc - 1 (all arguments without the first)) = argc + 1*/
-        ldbLogRedisReply("max lua stack reached");
-        return;
-    }
-
-    lua_getglobal(lua,"redis");
-    lua_pushstring(lua,"call");
-    lua_gettable(lua,-2);       /* Stack: redis, redis.call */
-    for (j = 1; j < argc; j++)
-        lua_pushlstring(lua,argv[j],sdslen(argv[j]));
-    ldb.step = 1;               /* Force redis.call() to log. */
-    server.lua_replicate_commands = 1;
-    lua_pcall(lua,argc-1,1,0);  /* Stack: redis, result */
-    ldb.step = 0;               /* Disable logging. */
-    server.lua_replicate_commands = saved_rc;
-    lua_pop(lua,2);             /* Discard the result and clean the stack. */
-}
-
-/* Implements "trace" command of the Lua debugger. It just prints a backtrace
- * querying Lua starting from the current callframe back to the outer one. */
-void ldbTrace(lua_State *lua) {
-    lua_Debug ar;
-    int level = 0;
-
-    while(lua_getstack(lua,level,&ar)) {
-        lua_getinfo(lua,"Snl",&ar);
-        if(strstr(ar.short_src,"user_script") != NULL) {
-            ldbLog(sdscatprintf(sdsempty(),"%s %s:",
-                (level == 0) ? "In" : "From",
-                ar.name ? ar.name : "top level"));
-            ldbLogSourceLine(ar.currentline);
-        }
-        level++;
-    }
-    if (level == 0) {
-        ldbLog(sdsnew("<error> Can't retrieve Lua stack."));
-    }
-}
-
-/* Implements the debugger "maxlen" command. It just queries or sets the
- * ldb.maxlen variable. */
-void ldbMaxlen(sds *argv, int argc) {
-    if (argc == 2) {
-        int newval = atoi(argv[1]);
-        ldb.maxlen_hint_sent = 1; /* User knows about this command. */
-        if (newval != 0 && newval <= 60) newval = 60;
-        ldb.maxlen = newval;
-    }
-    if (ldb.maxlen) {
-        ldbLog(sdscatprintf(sdsempty(),"<value> replies are truncated at %d bytes.",(int)ldb.maxlen));
-    } else {
-        ldbLog(sdscatprintf(sdsempty(),"<value> replies are unlimited."));
-    }
-}
-
-/* Read debugging commands from client.
- * Return C_OK if the debugging session is continuing, otherwise
- * C_ERR if the client closed the connection or is timing out. */
-int ldbRepl(lua_State *lua) {
-    sds *argv;
-    int argc;
-    char* err = NULL;
-
-    /* We continue processing commands until a command that should return
-     * to the Lua interpreter is found. */
-    while(1) {
-        while((argv = ldbReplParseCommand(&argc, &err)) == NULL) {
-            char buf[1024];
-            if (err) {
-                lua_pushstring(lua, err);
-                lua_error(lua);
-            }
-            int nread = connRead(ldb.conn,buf,sizeof(buf));
-            if (nread <= 0) {
-                /* Make sure the script runs without user input since the
-                 * client is no longer connected. */
-                ldb.step = 0;
-                ldb.bpcount = 0;
-                return C_ERR;
-            }
-            ldb.cbuf = sdscatlen(ldb.cbuf,buf,nread);
-            /* after 1M we will exit with an error
-             * so that the client will not blow the memory
-             */
-            if (sdslen(ldb.cbuf) > 1<<20) {
-                sdsfree(ldb.cbuf);
-                ldb.cbuf = sdsempty();
-                lua_pushstring(lua, "max client buffer reached");
-                lua_error(lua);
-            }
-        }
-
-        /* Flush the old buffer. */
-        sdsfree(ldb.cbuf);
-        ldb.cbuf = sdsempty();
-
-        /* Execute the command. */
-        if (!strcasecmp(argv[0],"h") || !strcasecmp(argv[0],"help")) {
-ldbLog(sdsnew("Redis Lua debugger help:"));
-ldbLog(sdsnew("[h]elp               Show this help."));
-ldbLog(sdsnew("[s]tep               Run current line and stop again."));
-ldbLog(sdsnew("[n]ext               Alias for step."));
-ldbLog(sdsnew("[c]continue          Run till next breakpoint."));
-ldbLog(sdsnew("[l]list              List source code around current line."));
-ldbLog(sdsnew("[l]list [line]       List source code around [line]."));
-ldbLog(sdsnew("                     line = 0 means: current position."));
-ldbLog(sdsnew("[l]list [line] [ctx] In this form [ctx] specifies how many lines"));
-ldbLog(sdsnew("                     to show before/after [line]."));
-ldbLog(sdsnew("[w]hole              List all source code. Alias for 'list 1 1000000'."));
-ldbLog(sdsnew("[p]rint              Show all the local variables."));
-ldbLog(sdsnew("[p]rint <var>        Show the value of the specified variable."));
-ldbLog(sdsnew("                     Can also show global vars KEYS and ARGV."));
-ldbLog(sdsnew("[b]reak              Show all breakpoints."));
-ldbLog(sdsnew("[b]reak <line>       Add a breakpoint to the specified line."));
-ldbLog(sdsnew("[b]reak -<line>      Remove breakpoint from the specified line."));
-ldbLog(sdsnew("[b]reak 0            Remove all breakpoints."));
-ldbLog(sdsnew("[t]race              Show a backtrace."));
-ldbLog(sdsnew("[e]eval <code>       Execute some Lua code (in a different callframe)."));
-ldbLog(sdsnew("[r]edis <cmd>        Execute a Redis command."));
-ldbLog(sdsnew("[m]axlen [len]       Trim logged Redis replies and Lua var dumps to len."));
-ldbLog(sdsnew("                     Specifying zero as <len> means unlimited."));
-ldbLog(sdsnew("[a]bort              Stop the execution of the script. In sync"));
-ldbLog(sdsnew("                     mode dataset changes will be retained."));
-ldbLog(sdsnew(""));
-ldbLog(sdsnew("Debugger functions you can call from Lua scripts:"));
-ldbLog(sdsnew("redis.debug()        Produce logs in the debugger console."));
-ldbLog(sdsnew("redis.breakpoint()   Stop execution like if there was a breakpoint in the"));
-ldbLog(sdsnew("                     next line of code."));
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"s") || !strcasecmp(argv[0],"step") ||
-                   !strcasecmp(argv[0],"n") || !strcasecmp(argv[0],"next")) {
-            ldb.step = 1;
-            break;
-        } else if (!strcasecmp(argv[0],"c") || !strcasecmp(argv[0],"continue")){
-            break;
-        } else if (!strcasecmp(argv[0],"t") || !strcasecmp(argv[0],"trace")) {
-            ldbTrace(lua);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"m") || !strcasecmp(argv[0],"maxlen")) {
-            ldbMaxlen(argv,argc);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"b") || !strcasecmp(argv[0],"break")) {
-            ldbBreak(argv,argc);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"e") || !strcasecmp(argv[0],"eval")) {
-            ldbEval(lua,argv,argc);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"a") || !strcasecmp(argv[0],"abort")) {
-            lua_pushstring(lua, "script aborted for user request");
-            lua_error(lua);
-        } else if (argc > 1 &&
-                   (!strcasecmp(argv[0],"r") || !strcasecmp(argv[0],"redis"))) {
-            ldbRedis(lua,argv,argc);
-            ldbSendLogs();
-        } else if ((!strcasecmp(argv[0],"p") || !strcasecmp(argv[0],"print"))) {
-            if (argc == 2)
-                ldbPrint(lua,argv[1]);
-            else
-                ldbPrintAll(lua);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"l") || !strcasecmp(argv[0],"list")){
-            int around = ldb.currentline, ctx = 5;
-            if (argc > 1) {
-                int num = atoi(argv[1]);
-                if (num > 0) around = num;
-            }
-            if (argc > 2) ctx = atoi(argv[2]);
-            ldbList(around,ctx);
-            ldbSendLogs();
-        } else if (!strcasecmp(argv[0],"w") || !strcasecmp(argv[0],"whole")){
-            ldbList(1,1000000);
-            ldbSendLogs();
-        } else {
-            ldbLog(sdsnew("<error> Unknown Redis Lua debugger command or "
-                          "wrong number of arguments."));
-            ldbSendLogs();
-        }
-
-        /* Free the command vector. */
-        sdsfreesplitres(argv,argc);
-    }
-
-    /* Free the current command argv if we break inside the while loop. */
-    sdsfreesplitres(argv,argc);
-    return C_OK;
-}
-
-/* This is the core of our Lua debugger, called each time Lua is about
- * to start executing a new line. */
-void luaLdbLineHook(lua_State *lua, lua_Debug *ar) {
-    lua_getstack(lua,0,ar);
-    lua_getinfo(lua,"Sl",ar);
-    ldb.currentline = ar->currentline;
-
-    int bp = ldbIsBreakpoint(ldb.currentline) || ldb.luabp;
-    int timeout = 0;
-
-    /* Events outside our script are not interesting. */
-    if(strstr(ar->short_src,"user_script") == NULL) return;
-
-    /* Check if a timeout occurred. */
-    if (ar->event == LUA_HOOKCOUNT && ldb.step == 0 && bp == 0) {
-        mstime_t elapsed = elapsedMs(server.lua_time_start);
-        mstime_t timelimit = server.lua_time_limit ?
-                             server.lua_time_limit : 5000;
-        if (elapsed >= timelimit) {
-            timeout = 1;
-            ldb.step = 1;
-        } else {
-            return; /* No timeout, ignore the COUNT event. */
-        }
-    }
-
-    if (ldb.step || bp) {
-        char *reason = "step over";
-        if (bp) reason = ldb.luabp ? "redis.breakpoint() called" :
-                                     "break point";
-        else if (timeout) reason = "timeout reached, infinite loop?";
-        ldb.step = 0;
-        ldb.luabp = 0;
-        ldbLog(sdscatprintf(sdsempty(),
-            "* Stopped at %d, stop reason = %s",
-            ldb.currentline, reason));
-        ldbLogSourceLine(ldb.currentline);
-        ldbSendLogs();
-        if (ldbRepl(lua) == C_ERR && timeout) {
-            /* If the client closed the connection and we have a timeout
-             * connection, let's kill the script otherwise the process
-             * will remain blocked indefinitely. */
-            lua_pushstring(lua, "timeout during Lua debugging with client closing connection");
-            lua_error(lua);
-        }
-        server.lua_time_start = getMonotonicUs();
-        server.lua_time_snapshot = mstime();
-    }
-}
diff --git a/redis-stable/src/sds.c b/redis-stable/src/sds.c
deleted file mode 100644
index 65fb3c71..00000000
--- a/redis-stable/src/sds.c
+++ /dev/null
@@ -1,1462 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Oran Agra
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <ctype.h>
-#include <assert.h>
-#include <limits.h>
-#include "sds.h"
-#include "sdsalloc.h"
-
-const char *SDS_NOINIT = "SDS_NOINIT";
-
-static inline int sdsHdrSize(char type) {
-    switch(type&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            return sizeof(struct sdshdr5);
-        case SDS_TYPE_8:
-            return sizeof(struct sdshdr8);
-        case SDS_TYPE_16:
-            return sizeof(struct sdshdr16);
-        case SDS_TYPE_32:
-            return sizeof(struct sdshdr32);
-        case SDS_TYPE_64:
-            return sizeof(struct sdshdr64);
-    }
-    return 0;
-}
-
-static inline char sdsReqType(size_t string_size) {
-    if (string_size < 1<<5)
-        return SDS_TYPE_5;
-    if (string_size < 1<<8)
-        return SDS_TYPE_8;
-    if (string_size < 1<<16)
-        return SDS_TYPE_16;
-#if (LONG_MAX == LLONG_MAX)
-    if (string_size < 1ll<<32)
-        return SDS_TYPE_32;
-    return SDS_TYPE_64;
-#else
-    return SDS_TYPE_32;
-#endif
-}
-
-static inline size_t sdsTypeMaxSize(char type) {
-    if (type == SDS_TYPE_5)
-        return (1<<5) - 1;
-    if (type == SDS_TYPE_8)
-        return (1<<8) - 1;
-    if (type == SDS_TYPE_16)
-        return (1<<16) - 1;
-#if (LONG_MAX == LLONG_MAX)
-    if (type == SDS_TYPE_32)
-        return (1ll<<32) - 1;
-#endif
-    return -1; /* this is equivalent to the max SDS_TYPE_64 or SDS_TYPE_32 */
-}
-
-/* Create a new sds string with the content specified by the 'init' pointer
- * and 'initlen'.
- * If NULL is used for 'init' the string is initialized with zero bytes.
- * If SDS_NOINIT is used, the buffer is left uninitialized;
- *
- * The string is always null-termined (all the sds strings are, always) so
- * even if you create an sds string with:
- *
- * mystring = sdsnewlen("abc",3);
- *
- * You can print the string with printf() as there is an implicit \0 at the
- * end of the string. However the string is binary safe and can contain
- * \0 characters in the middle, as the length is stored in the sds header. */
-sds _sdsnewlen(const void *init, size_t initlen, int trymalloc) {
-    void *sh;
-    sds s;
-    char type = sdsReqType(initlen);
-    /* Empty strings are usually created in order to append. Use type 8
-     * since type 5 is not good at this. */
-    if (type == SDS_TYPE_5 && initlen == 0) type = SDS_TYPE_8;
-    int hdrlen = sdsHdrSize(type);
-    unsigned char *fp; /* flags pointer. */
-    size_t usable;
-
-    assert(initlen + hdrlen + 1 > initlen); /* Catch size_t overflow */
-    sh = trymalloc?
-        s_trymalloc_usable(hdrlen+initlen+1, &usable) :
-        s_malloc_usable(hdrlen+initlen+1, &usable);
-    if (sh == NULL) return NULL;
-    if (init==SDS_NOINIT)
-        init = NULL;
-    else if (!init)
-        memset(sh, 0, hdrlen+initlen+1);
-    s = (char*)sh+hdrlen;
-    fp = ((unsigned char*)s)-1;
-    usable = usable-hdrlen-1;
-    if (usable > sdsTypeMaxSize(type))
-        usable = sdsTypeMaxSize(type);
-    switch(type) {
-        case SDS_TYPE_5: {
-            *fp = type | (initlen << SDS_TYPE_BITS);
-            break;
-        }
-        case SDS_TYPE_8: {
-            SDS_HDR_VAR(8,s);
-            sh->len = initlen;
-            sh->alloc = usable;
-            *fp = type;
-            break;
-        }
-        case SDS_TYPE_16: {
-            SDS_HDR_VAR(16,s);
-            sh->len = initlen;
-            sh->alloc = usable;
-            *fp = type;
-            break;
-        }
-        case SDS_TYPE_32: {
-            SDS_HDR_VAR(32,s);
-            sh->len = initlen;
-            sh->alloc = usable;
-            *fp = type;
-            break;
-        }
-        case SDS_TYPE_64: {
-            SDS_HDR_VAR(64,s);
-            sh->len = initlen;
-            sh->alloc = usable;
-            *fp = type;
-            break;
-        }
-    }
-    if (initlen && init)
-        memcpy(s, init, initlen);
-    s[initlen] = '\0';
-    return s;
-}
-
-sds sdsnewlen(const void *init, size_t initlen) {
-    return _sdsnewlen(init, initlen, 0);
-}
-
-sds sdstrynewlen(const void *init, size_t initlen) {
-    return _sdsnewlen(init, initlen, 1);
-}
-
-/* Create an empty (zero length) sds string. Even in this case the string
- * always has an implicit null term. */
-sds sdsempty(void) {
-    return sdsnewlen("",0);
-}
-
-/* Create a new sds string starting from a null terminated C string. */
-sds sdsnew(const char *init) {
-    size_t initlen = (init == NULL) ? 0 : strlen(init);
-    return sdsnewlen(init, initlen);
-}
-
-/* Duplicate an sds string. */
-sds sdsdup(const sds s) {
-    return sdsnewlen(s, sdslen(s));
-}
-
-/* Free an sds string. No operation is performed if 's' is NULL. */
-void sdsfree(sds s) {
-    if (s == NULL) return;
-    s_free((char*)s-sdsHdrSize(s[-1]));
-}
-
-/* Set the sds string length to the length as obtained with strlen(), so
- * considering as content only up to the first null term character.
- *
- * This function is useful when the sds string is hacked manually in some
- * way, like in the following example:
- *
- * s = sdsnew("foobar");
- * s[2] = '\0';
- * sdsupdatelen(s);
- * printf("%d\n", sdslen(s));
- *
- * The output will be "2", but if we comment out the call to sdsupdatelen()
- * the output will be "6" as the string was modified but the logical length
- * remains 6 bytes. */
-void sdsupdatelen(sds s) {
-    size_t reallen = strlen(s);
-    sdssetlen(s, reallen);
-}
-
-/* Modify an sds string in-place to make it empty (zero length).
- * However all the existing buffer is not discarded but set as free space
- * so that next append operations will not require allocations up to the
- * number of bytes previously available. */
-void sdsclear(sds s) {
-    sdssetlen(s, 0);
-    s[0] = '\0';
-}
-
-/* Enlarge the free space at the end of the sds string so that the caller
- * is sure that after calling this function can overwrite up to addlen
- * bytes after the end of the string, plus one more byte for nul term.
- *
- * Note: this does not change the *length* of the sds string as returned
- * by sdslen(), but only the free buffer space we have. */
-sds sdsMakeRoomFor(sds s, size_t addlen) {
-    void *sh, *newsh;
-    size_t avail = sdsavail(s);
-    size_t len, newlen, reqlen;
-    char type, oldtype = s[-1] & SDS_TYPE_MASK;
-    int hdrlen;
-    size_t usable;
-
-    /* Return ASAP if there is enough space left. */
-    if (avail >= addlen) return s;
-
-    len = sdslen(s);
-    sh = (char*)s-sdsHdrSize(oldtype);
-    reqlen = newlen = (len+addlen);
-    assert(newlen > len);   /* Catch size_t overflow */
-    if (newlen < SDS_MAX_PREALLOC)
-        newlen *= 2;
-    else
-        newlen += SDS_MAX_PREALLOC;
-
-    type = sdsReqType(newlen);
-
-    /* Don't use type 5: the user is appending to the string and type 5 is
-     * not able to remember empty space, so sdsMakeRoomFor() must be called
-     * at every appending operation. */
-    if (type == SDS_TYPE_5) type = SDS_TYPE_8;
-
-    hdrlen = sdsHdrSize(type);
-    assert(hdrlen + newlen + 1 > reqlen);  /* Catch size_t overflow */
-    if (oldtype==type) {
-        newsh = s_realloc_usable(sh, hdrlen+newlen+1, &usable);
-        if (newsh == NULL) return NULL;
-        s = (char*)newsh+hdrlen;
-    } else {
-        /* Since the header size changes, need to move the string forward,
-         * and can't use realloc */
-        newsh = s_malloc_usable(hdrlen+newlen+1, &usable);
-        if (newsh == NULL) return NULL;
-        memcpy((char*)newsh+hdrlen, s, len+1);
-        s_free(sh);
-        s = (char*)newsh+hdrlen;
-        s[-1] = type;
-        sdssetlen(s, len);
-    }
-    usable = usable-hdrlen-1;
-    if (usable > sdsTypeMaxSize(type))
-        usable = sdsTypeMaxSize(type);
-    sdssetalloc(s, usable);
-    return s;
-}
-
-/* Reallocate the sds string so that it has no free space at the end. The
- * contained string remains not altered, but next concatenation operations
- * will require a reallocation.
- *
- * After the call, the passed sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds sdsRemoveFreeSpace(sds s) {
-    void *sh, *newsh;
-    char type, oldtype = s[-1] & SDS_TYPE_MASK;
-    int hdrlen, oldhdrlen = sdsHdrSize(oldtype);
-    size_t len = sdslen(s);
-    size_t avail = sdsavail(s);
-    sh = (char*)s-oldhdrlen;
-
-    /* Return ASAP if there is no space left. */
-    if (avail == 0) return s;
-
-    /* Check what would be the minimum SDS header that is just good enough to
-     * fit this string. */
-    type = sdsReqType(len);
-    hdrlen = sdsHdrSize(type);
-
-    /* If the type is the same, or at least a large enough type is still
-     * required, we just realloc(), letting the allocator to do the copy
-     * only if really needed. Otherwise if the change is huge, we manually
-     * reallocate the string to use the different header type. */
-    if (oldtype==type || type > SDS_TYPE_8) {
-        newsh = s_realloc(sh, oldhdrlen+len+1);
-        if (newsh == NULL) return NULL;
-        s = (char*)newsh+oldhdrlen;
-    } else {
-        newsh = s_malloc(hdrlen+len+1);
-        if (newsh == NULL) return NULL;
-        memcpy((char*)newsh+hdrlen, s, len+1);
-        s_free(sh);
-        s = (char*)newsh+hdrlen;
-        s[-1] = type;
-        sdssetlen(s, len);
-    }
-    sdssetalloc(s, len);
-    return s;
-}
-
-/* Return the total size of the allocation of the specified sds string,
- * including:
- * 1) The sds header before the pointer.
- * 2) The string.
- * 3) The free buffer at the end if any.
- * 4) The implicit null term.
- */
-size_t sdsAllocSize(sds s) {
-    size_t alloc = sdsalloc(s);
-    return sdsHdrSize(s[-1])+alloc+1;
-}
-
-/* Return the pointer of the actual SDS allocation (normally SDS strings
- * are referenced by the start of the string buffer). */
-void *sdsAllocPtr(sds s) {
-    return (void*) (s-sdsHdrSize(s[-1]));
-}
-
-/* Increment the sds length and decrements the left free space at the
- * end of the string according to 'incr'. Also set the null term
- * in the new end of the string.
- *
- * This function is used in order to fix the string length after the
- * user calls sdsMakeRoomFor(), writes something after the end of
- * the current string, and finally needs to set the new length.
- *
- * Note: it is possible to use a negative increment in order to
- * right-trim the string.
- *
- * Usage example:
- *
- * Using sdsIncrLen() and sdsMakeRoomFor() it is possible to mount the
- * following schema, to cat bytes coming from the kernel to the end of an
- * sds string without copying into an intermediate buffer:
- *
- * oldlen = sdslen(s);
- * s = sdsMakeRoomFor(s, BUFFER_SIZE);
- * nread = read(fd, s+oldlen, BUFFER_SIZE);
- * ... check for nread <= 0 and handle it ...
- * sdsIncrLen(s, nread);
- */
-void sdsIncrLen(sds s, ssize_t incr) {
-    unsigned char flags = s[-1];
-    size_t len;
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5: {
-            unsigned char *fp = ((unsigned char*)s)-1;
-            unsigned char oldlen = SDS_TYPE_5_LEN(flags);
-            assert((incr > 0 && oldlen+incr < 32) || (incr < 0 && oldlen >= (unsigned int)(-incr)));
-            *fp = SDS_TYPE_5 | ((oldlen+incr) << SDS_TYPE_BITS);
-            len = oldlen+incr;
-            break;
-        }
-        case SDS_TYPE_8: {
-            SDS_HDR_VAR(8,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case SDS_TYPE_16: {
-            SDS_HDR_VAR(16,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case SDS_TYPE_32: {
-            SDS_HDR_VAR(32,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= (unsigned int)incr) || (incr < 0 && sh->len >= (unsigned int)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        case SDS_TYPE_64: {
-            SDS_HDR_VAR(64,s);
-            assert((incr >= 0 && sh->alloc-sh->len >= (uint64_t)incr) || (incr < 0 && sh->len >= (uint64_t)(-incr)));
-            len = (sh->len += incr);
-            break;
-        }
-        default: len = 0; /* Just to avoid compilation warnings. */
-    }
-    s[len] = '\0';
-}
-
-/* Grow the sds to have the specified length. Bytes that were not part of
- * the original length of the sds will be set to zero.
- *
- * if the specified length is smaller than the current length, no operation
- * is performed. */
-sds sdsgrowzero(sds s, size_t len) {
-    size_t curlen = sdslen(s);
-
-    if (len <= curlen) return s;
-    s = sdsMakeRoomFor(s,len-curlen);
-    if (s == NULL) return NULL;
-
-    /* Make sure added region doesn't contain garbage */
-    memset(s+curlen,0,(len-curlen+1)); /* also set trailing \0 byte */
-    sdssetlen(s, len);
-    return s;
-}
-
-/* Append the specified binary-safe string pointed by 't' of 'len' bytes to the
- * end of the specified sds string 's'.
- *
- * After the call, the passed sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds sdscatlen(sds s, const void *t, size_t len) {
-    size_t curlen = sdslen(s);
-
-    s = sdsMakeRoomFor(s,len);
-    if (s == NULL) return NULL;
-    memcpy(s+curlen, t, len);
-    sdssetlen(s, curlen+len);
-    s[curlen+len] = '\0';
-    return s;
-}
-
-/* Append the specified null terminated C string to the sds string 's'.
- *
- * After the call, the passed sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds sdscat(sds s, const char *t) {
-    return sdscatlen(s, t, strlen(t));
-}
-
-/* Append the specified sds 't' to the existing sds 's'.
- *
- * After the call, the modified sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds sdscatsds(sds s, const sds t) {
-    return sdscatlen(s, t, sdslen(t));
-}
-
-/* Destructively modify the sds string 's' to hold the specified binary
- * safe string pointed by 't' of length 'len' bytes. */
-sds sdscpylen(sds s, const char *t, size_t len) {
-    if (sdsalloc(s) < len) {
-        s = sdsMakeRoomFor(s,len-sdslen(s));
-        if (s == NULL) return NULL;
-    }
-    memcpy(s, t, len);
-    s[len] = '\0';
-    sdssetlen(s, len);
-    return s;
-}
-
-/* Like sdscpylen() but 't' must be a null-termined string so that the length
- * of the string is obtained with strlen(). */
-sds sdscpy(sds s, const char *t) {
-    return sdscpylen(s, t, strlen(t));
-}
-
-/* Helper for sdscatlonglong() doing the actual number -> string
- * conversion. 's' must point to a string with room for at least
- * SDS_LLSTR_SIZE bytes.
- *
- * The function returns the length of the null-terminated string
- * representation stored at 's'. */
-#define SDS_LLSTR_SIZE 21
-int sdsll2str(char *s, long long value) {
-    char *p, aux;
-    unsigned long long v;
-    size_t l;
-
-    /* Generate the string representation, this method produces
-     * a reversed string. */
-    v = (value < 0) ? -value : value;
-    p = s;
-    do {
-        *p++ = '0'+(v%10);
-        v /= 10;
-    } while(v);
-    if (value < 0) *p++ = '-';
-
-    /* Compute length and add null term. */
-    l = p-s;
-    *p = '\0';
-
-    /* Reverse the string. */
-    p--;
-    while(s < p) {
-        aux = *s;
-        *s = *p;
-        *p = aux;
-        s++;
-        p--;
-    }
-    return l;
-}
-
-/* Identical sdsll2str(), but for unsigned long long type. */
-int sdsull2str(char *s, unsigned long long v) {
-    char *p, aux;
-    size_t l;
-
-    /* Generate the string representation, this method produces
-     * a reversed string. */
-    p = s;
-    do {
-        *p++ = '0'+(v%10);
-        v /= 10;
-    } while(v);
-
-    /* Compute length and add null term. */
-    l = p-s;
-    *p = '\0';
-
-    /* Reverse the string. */
-    p--;
-    while(s < p) {
-        aux = *s;
-        *s = *p;
-        *p = aux;
-        s++;
-        p--;
-    }
-    return l;
-}
-
-/* Create an sds string from a long long value. It is much faster than:
- *
- * sdscatprintf(sdsempty(),"%lld\n", value);
- */
-sds sdsfromlonglong(long long value) {
-    char buf[SDS_LLSTR_SIZE];
-    int len = sdsll2str(buf,value);
-
-    return sdsnewlen(buf,len);
-}
-
-/* Like sdscatprintf() but gets va_list instead of being variadic. */
-sds sdscatvprintf(sds s, const char *fmt, va_list ap) {
-    va_list cpy;
-    char staticbuf[1024], *buf = staticbuf, *t;
-    size_t buflen = strlen(fmt)*2;
-    int bufstrlen;
-
-    /* We try to start using a static buffer for speed.
-     * If not possible we revert to heap allocation. */
-    if (buflen > sizeof(staticbuf)) {
-        buf = s_malloc(buflen);
-        if (buf == NULL) return NULL;
-    } else {
-        buflen = sizeof(staticbuf);
-    }
-
-    /* Alloc enough space for buffer and \0 after failing to
-     * fit the string in the current buffer size. */
-    while(1) {
-        va_copy(cpy,ap);
-        bufstrlen = vsnprintf(buf, buflen, fmt, cpy);
-        va_end(cpy);
-        if (bufstrlen < 0) {
-            if (buf != staticbuf) s_free(buf);
-            return NULL;
-        }
-        if (((size_t)bufstrlen) >= buflen) {
-            if (buf != staticbuf) s_free(buf);
-            buflen = ((size_t)bufstrlen) + 1;
-            buf = s_malloc(buflen);
-            if (buf == NULL) return NULL;
-            continue;
-        }
-        break;
-    }
-
-    /* Finally concat the obtained string to the SDS string and return it. */
-    t = sdscatlen(s, buf, bufstrlen);
-    if (buf != staticbuf) s_free(buf);
-    return t;
-}
-
-/* Append to the sds string 's' a string obtained using printf-alike format
- * specifier.
- *
- * After the call, the modified sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call.
- *
- * Example:
- *
- * s = sdsnew("Sum is: ");
- * s = sdscatprintf(s,"%d+%d = %d",a,b,a+b).
- *
- * Often you need to create a string from scratch with the printf-alike
- * format. When this is the need, just use sdsempty() as the target string:
- *
- * s = sdscatprintf(sdsempty(), "... your format ...", args);
- */
-sds sdscatprintf(sds s, const char *fmt, ...) {
-    va_list ap;
-    char *t;
-    va_start(ap, fmt);
-    t = sdscatvprintf(s,fmt,ap);
-    va_end(ap);
-    return t;
-}
-
-/* This function is similar to sdscatprintf, but much faster as it does
- * not rely on sprintf() family functions implemented by the libc that
- * are often very slow. Moreover directly handling the sds string as
- * new data is concatenated provides a performance improvement.
- *
- * However this function only handles an incompatible subset of printf-alike
- * format specifiers:
- *
- * %s - C String
- * %S - SDS string
- * %i - signed int
- * %I - 64 bit signed integer (long long, int64_t)
- * %u - unsigned int
- * %U - 64 bit unsigned integer (unsigned long long, uint64_t)
- * %% - Verbatim "%" character.
- */
-sds sdscatfmt(sds s, char const *fmt, ...) {
-    size_t initlen = sdslen(s);
-    const char *f = fmt;
-    long i;
-    va_list ap;
-
-    /* To avoid continuous reallocations, let's start with a buffer that
-     * can hold at least two times the format string itself. It's not the
-     * best heuristic but seems to work in practice. */
-    s = sdsMakeRoomFor(s, strlen(fmt)*2);
-    va_start(ap,fmt);
-    f = fmt;    /* Next format specifier byte to process. */
-    i = initlen; /* Position of the next byte to write to dest str. */
-    while(*f) {
-        char next, *str;
-        size_t l;
-        long long num;
-        unsigned long long unum;
-
-        /* Make sure there is always space for at least 1 char. */
-        if (sdsavail(s)==0) {
-            s = sdsMakeRoomFor(s,1);
-        }
-
-        switch(*f) {
-        case '%':
-            next = *(f+1);
-            f++;
-            switch(next) {
-            case 's':
-            case 'S':
-                str = va_arg(ap,char*);
-                l = (next == 's') ? strlen(str) : sdslen(str);
-                if (sdsavail(s) < l) {
-                    s = sdsMakeRoomFor(s,l);
-                }
-                memcpy(s+i,str,l);
-                sdsinclen(s,l);
-                i += l;
-                break;
-            case 'i':
-            case 'I':
-                if (next == 'i')
-                    num = va_arg(ap,int);
-                else
-                    num = va_arg(ap,long long);
-                {
-                    char buf[SDS_LLSTR_SIZE];
-                    l = sdsll2str(buf,num);
-                    if (sdsavail(s) < l) {
-                        s = sdsMakeRoomFor(s,l);
-                    }
-                    memcpy(s+i,buf,l);
-                    sdsinclen(s,l);
-                    i += l;
-                }
-                break;
-            case 'u':
-            case 'U':
-                if (next == 'u')
-                    unum = va_arg(ap,unsigned int);
-                else
-                    unum = va_arg(ap,unsigned long long);
-                {
-                    char buf[SDS_LLSTR_SIZE];
-                    l = sdsull2str(buf,unum);
-                    if (sdsavail(s) < l) {
-                        s = sdsMakeRoomFor(s,l);
-                    }
-                    memcpy(s+i,buf,l);
-                    sdsinclen(s,l);
-                    i += l;
-                }
-                break;
-            default: /* Handle %% and generally %<unknown>. */
-                s[i++] = next;
-                sdsinclen(s,1);
-                break;
-            }
-            break;
-        default:
-            s[i++] = *f;
-            sdsinclen(s,1);
-            break;
-        }
-        f++;
-    }
-    va_end(ap);
-
-    /* Add null-term */
-    s[i] = '\0';
-    return s;
-}
-
-/* Remove the part of the string from left and from right composed just of
- * contiguous characters found in 'cset', that is a null terminted C string.
- *
- * After the call, the modified sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call.
- *
- * Example:
- *
- * s = sdsnew("AA...AA.a.aa.aHelloWorld     :::");
- * s = sdstrim(s,"Aa. :");
- * printf("%s\n", s);
- *
- * Output will be just "HelloWorld".
- */
-sds sdstrim(sds s, const char *cset) {
-    char *start, *end, *sp, *ep;
-    size_t len;
-
-    sp = start = s;
-    ep = end = s+sdslen(s)-1;
-    while(sp <= end && strchr(cset, *sp)) sp++;
-    while(ep > sp && strchr(cset, *ep)) ep--;
-    len = (sp > ep) ? 0 : ((ep-sp)+1);
-    if (s != sp) memmove(s, sp, len);
-    s[len] = '\0';
-    sdssetlen(s,len);
-    return s;
-}
-
-/* Changes the input string to be a subset of the original.
- * It does not release the free space in the string, so a call to
- * sdsRemoveFreeSpace may be wise after. */
-void sdssubstr(sds s, size_t start, size_t len) {
-    /* Clamp out of range input */
-    size_t oldlen = sdslen(s);
-    if (start >= oldlen) start = len = 0;
-    if (len > oldlen-start) len = oldlen-start;
-
-    /* Move the data */
-    if (len) memmove(s, s+start, len);
-    s[len] = 0;
-    sdssetlen(s,len);
-}
-
-/* Turn the string into a smaller (or equal) string containing only the
- * substring specified by the 'start' and 'end' indexes.
- *
- * start and end can be negative, where -1 means the last character of the
- * string, -2 the penultimate character, and so forth.
- *
- * The interval is inclusive, so the start and end characters will be part
- * of the resulting string.
- *
- * The string is modified in-place.
- *
- * NOTE: this function can be misleading and can have unexpected behaviour,
- * specifically when you want the length of the new string to be 0.
- * Having start==end will result in a string with one character.
- * please consider using sdssubstr instead.
- *
- * Example:
- *
- * s = sdsnew("Hello World");
- * sdsrange(s,1,-1); => "ello World"
- */
-void sdsrange(sds s, ssize_t start, ssize_t end) {
-    size_t newlen, len = sdslen(s);
-    if (len == 0) return;
-    if (start < 0)
-        start = len + start;
-    if (end < 0)
-        end = len + end;
-    newlen = (start > end) ? 0 : (end-start)+1;
-    sdssubstr(s, start, newlen);
-}
-
-/* Apply tolower() to every character of the sds string 's'. */
-void sdstolower(sds s) {
-    size_t len = sdslen(s), j;
-
-    for (j = 0; j < len; j++) s[j] = tolower(s[j]);
-}
-
-/* Apply toupper() to every character of the sds string 's'. */
-void sdstoupper(sds s) {
-    size_t len = sdslen(s), j;
-
-    for (j = 0; j < len; j++) s[j] = toupper(s[j]);
-}
-
-/* Compare two sds strings s1 and s2 with memcmp().
- *
- * Return value:
- *
- *     positive if s1 > s2.
- *     negative if s1 < s2.
- *     0 if s1 and s2 are exactly the same binary string.
- *
- * If two strings share exactly the same prefix, but one of the two has
- * additional characters, the longer string is considered to be greater than
- * the smaller one. */
-int sdscmp(const sds s1, const sds s2) {
-    size_t l1, l2, minlen;
-    int cmp;
-
-    l1 = sdslen(s1);
-    l2 = sdslen(s2);
-    minlen = (l1 < l2) ? l1 : l2;
-    cmp = memcmp(s1,s2,minlen);
-    if (cmp == 0) return l1>l2? 1: (l1<l2? -1: 0);
-    return cmp;
-}
-
-/* Split 's' with separator in 'sep'. An array
- * of sds strings is returned. *count will be set
- * by reference to the number of tokens returned.
- *
- * On out of memory, zero length string, zero length
- * separator, NULL is returned.
- *
- * Note that 'sep' is able to split a string using
- * a multi-character separator. For example
- * sdssplit("foo_-_bar","_-_"); will return two
- * elements "foo" and "bar".
- *
- * This version of the function is binary-safe but
- * requires length arguments. sdssplit() is just the
- * same function but for zero-terminated strings.
- */
-sds *sdssplitlen(const char *s, ssize_t len, const char *sep, int seplen, int *count) {
-    int elements = 0, slots = 5;
-    long start = 0, j;
-    sds *tokens;
-
-    if (seplen < 1 || len < 0) return NULL;
-
-    tokens = s_malloc(sizeof(sds)*slots);
-    if (tokens == NULL) return NULL;
-
-    if (len == 0) {
-        *count = 0;
-        return tokens;
-    }
-    for (j = 0; j < (len-(seplen-1)); j++) {
-        /* make sure there is room for the next element and the final one */
-        if (slots < elements+2) {
-            sds *newtokens;
-
-            slots *= 2;
-            newtokens = s_realloc(tokens,sizeof(sds)*slots);
-            if (newtokens == NULL) goto cleanup;
-            tokens = newtokens;
-        }
-        /* search the separator */
-        if ((seplen == 1 && *(s+j) == sep[0]) || (memcmp(s+j,sep,seplen) == 0)) {
-            tokens[elements] = sdsnewlen(s+start,j-start);
-            if (tokens[elements] == NULL) goto cleanup;
-            elements++;
-            start = j+seplen;
-            j = j+seplen-1; /* skip the separator */
-        }
-    }
-    /* Add the final element. We are sure there is room in the tokens array. */
-    tokens[elements] = sdsnewlen(s+start,len-start);
-    if (tokens[elements] == NULL) goto cleanup;
-    elements++;
-    *count = elements;
-    return tokens;
-
-cleanup:
-    {
-        int i;
-        for (i = 0; i < elements; i++) sdsfree(tokens[i]);
-        s_free(tokens);
-        *count = 0;
-        return NULL;
-    }
-}
-
-/* Free the result returned by sdssplitlen(), or do nothing if 'tokens' is NULL. */
-void sdsfreesplitres(sds *tokens, int count) {
-    if (!tokens) return;
-    while(count--)
-        sdsfree(tokens[count]);
-    s_free(tokens);
-}
-
-/* Append to the sds string "s" an escaped string representation where
- * all the non-printable characters (tested with isprint()) are turned into
- * escapes in the form "\n\r\a...." or "\x<hex-number>".
- *
- * After the call, the modified sds string is no longer valid and all the
- * references must be substituted with the new pointer returned by the call. */
-sds sdscatrepr(sds s, const char *p, size_t len) {
-    s = sdscatlen(s,"\"",1);
-    while(len--) {
-        switch(*p) {
-        case '\\':
-        case '"':
-            s = sdscatprintf(s,"\\%c",*p);
-            break;
-        case '\n': s = sdscatlen(s,"\\n",2); break;
-        case '\r': s = sdscatlen(s,"\\r",2); break;
-        case '\t': s = sdscatlen(s,"\\t",2); break;
-        case '\a': s = sdscatlen(s,"\\a",2); break;
-        case '\b': s = sdscatlen(s,"\\b",2); break;
-        default:
-            if (isprint(*p))
-                s = sdscatprintf(s,"%c",*p);
-            else
-                s = sdscatprintf(s,"\\x%02x",(unsigned char)*p);
-            break;
-        }
-        p++;
-    }
-    return sdscatlen(s,"\"",1);
-}
-
-/* Helper function for sdssplitargs() that returns non zero if 'c'
- * is a valid hex digit. */
-int is_hex_digit(char c) {
-    return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
-           (c >= 'A' && c <= 'F');
-}
-
-/* Helper function for sdssplitargs() that converts a hex digit into an
- * integer from 0 to 15 */
-int hex_digit_to_int(char c) {
-    switch(c) {
-    case '0': return 0;
-    case '1': return 1;
-    case '2': return 2;
-    case '3': return 3;
-    case '4': return 4;
-    case '5': return 5;
-    case '6': return 6;
-    case '7': return 7;
-    case '8': return 8;
-    case '9': return 9;
-    case 'a': case 'A': return 10;
-    case 'b': case 'B': return 11;
-    case 'c': case 'C': return 12;
-    case 'd': case 'D': return 13;
-    case 'e': case 'E': return 14;
-    case 'f': case 'F': return 15;
-    default: return 0;
-    }
-}
-
-/* Split a line into arguments, where every argument can be in the
- * following programming-language REPL-alike form:
- *
- * foo bar "newline are supported\n" and "\xff\x00otherstuff"
- *
- * The number of arguments is stored into *argc, and an array
- * of sds is returned.
- *
- * The caller should free the resulting array of sds strings with
- * sdsfreesplitres().
- *
- * Note that sdscatrepr() is able to convert back a string into
- * a quoted string in the same format sdssplitargs() is able to parse.
- *
- * The function returns the allocated tokens on success, even when the
- * input string is empty, or NULL if the input contains unbalanced
- * quotes or closed quotes followed by non space characters
- * as in: "foo"bar or "foo'
- */
-sds *sdssplitargs(const char *line, int *argc) {
-    const char *p = line;
-    char *current = NULL;
-    char **vector = NULL;
-
-    *argc = 0;
-    while(1) {
-        /* skip blanks */
-        while(*p && isspace(*p)) p++;
-        if (*p) {
-            /* get a token */
-            int inq=0;  /* set to 1 if we are in "quotes" */
-            int insq=0; /* set to 1 if we are in 'single quotes' */
-            int done=0;
-
-            if (current == NULL) current = sdsempty();
-            while(!done) {
-                if (inq) {
-                    if (*p == '\\' && *(p+1) == 'x' &&
-                                             is_hex_digit(*(p+2)) &&
-                                             is_hex_digit(*(p+3)))
-                    {
-                        unsigned char byte;
-
-                        byte = (hex_digit_to_int(*(p+2))*16)+
-                                hex_digit_to_int(*(p+3));
-                        current = sdscatlen(current,(char*)&byte,1);
-                        p += 3;
-                    } else if (*p == '\\' && *(p+1)) {
-                        char c;
-
-                        p++;
-                        switch(*p) {
-                        case 'n': c = '\n'; break;
-                        case 'r': c = '\r'; break;
-                        case 't': c = '\t'; break;
-                        case 'b': c = '\b'; break;
-                        case 'a': c = '\a'; break;
-                        default: c = *p; break;
-                        }
-                        current = sdscatlen(current,&c,1);
-                    } else if (*p == '"') {
-                        /* closing quote must be followed by a space or
-                         * nothing at all. */
-                        if (*(p+1) && !isspace(*(p+1))) goto err;
-                        done=1;
-                    } else if (!*p) {
-                        /* unterminated quotes */
-                        goto err;
-                    } else {
-                        current = sdscatlen(current,p,1);
-                    }
-                } else if (insq) {
-                    if (*p == '\\' && *(p+1) == '\'') {
-                        p++;
-                        current = sdscatlen(current,"'",1);
-                    } else if (*p == '\'') {
-                        /* closing quote must be followed by a space or
-                         * nothing at all. */
-                        if (*(p+1) && !isspace(*(p+1))) goto err;
-                        done=1;
-                    } else if (!*p) {
-                        /* unterminated quotes */
-                        goto err;
-                    } else {
-                        current = sdscatlen(current,p,1);
-                    }
-                } else {
-                    switch(*p) {
-                    case ' ':
-                    case '\n':
-                    case '\r':
-                    case '\t':
-                    case '\0':
-                        done=1;
-                        break;
-                    case '"':
-                        inq=1;
-                        break;
-                    case '\'':
-                        insq=1;
-                        break;
-                    default:
-                        current = sdscatlen(current,p,1);
-                        break;
-                    }
-                }
-                if (*p) p++;
-            }
-            /* add the token to the vector */
-            vector = s_realloc(vector,((*argc)+1)*sizeof(char*));
-            vector[*argc] = current;
-            (*argc)++;
-            current = NULL;
-        } else {
-            /* Even on empty input string return something not NULL. */
-            if (vector == NULL) vector = s_malloc(sizeof(void*));
-            return vector;
-        }
-    }
-
-err:
-    while((*argc)--)
-        sdsfree(vector[*argc]);
-    s_free(vector);
-    if (current) sdsfree(current);
-    *argc = 0;
-    return NULL;
-}
-
-/* Modify the string substituting all the occurrences of the set of
- * characters specified in the 'from' string to the corresponding character
- * in the 'to' array.
- *
- * For instance: sdsmapchars(mystring, "ho", "01", 2)
- * will have the effect of turning the string "hello" into "0ell1".
- *
- * The function returns the sds string pointer, that is always the same
- * as the input pointer since no resize is needed. */
-sds sdsmapchars(sds s, const char *from, const char *to, size_t setlen) {
-    size_t j, i, l = sdslen(s);
-
-    for (j = 0; j < l; j++) {
-        for (i = 0; i < setlen; i++) {
-            if (s[j] == from[i]) {
-                s[j] = to[i];
-                break;
-            }
-        }
-    }
-    return s;
-}
-
-/* Join an array of C strings using the specified separator (also a C string).
- * Returns the result as an sds string. */
-sds sdsjoin(char **argv, int argc, char *sep) {
-    sds join = sdsempty();
-    int j;
-
-    for (j = 0; j < argc; j++) {
-        join = sdscat(join, argv[j]);
-        if (j != argc-1) join = sdscat(join,sep);
-    }
-    return join;
-}
-
-/* Like sdsjoin, but joins an array of SDS strings. */
-sds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen) {
-    sds join = sdsempty();
-    int j;
-
-    for (j = 0; j < argc; j++) {
-        join = sdscatsds(join, argv[j]);
-        if (j != argc-1) join = sdscatlen(join,sep,seplen);
-    }
-    return join;
-}
-
-/* Wrappers to the allocators used by SDS. Note that SDS will actually
- * just use the macros defined into sdsalloc.h in order to avoid to pay
- * the overhead of function calls. Here we define these wrappers only for
- * the programs SDS is linked to, if they want to touch the SDS internals
- * even if they use a different allocator. */
-void *sds_malloc(size_t size) { return s_malloc(size); }
-void *sds_realloc(void *ptr, size_t size) { return s_realloc(ptr,size); }
-void sds_free(void *ptr) { s_free(ptr); }
-
-/* Perform expansion of a template string and return the result as a newly
- * allocated sds.
- *
- * Template variables are specified using curly brackets, e.g. {variable}.
- * An opening bracket can be quoted by repeating it twice.
- */
-sds sdstemplate(const char *template, sdstemplate_callback_t cb_func, void *cb_arg)
-{
-    sds res = sdsempty();
-    const char *p = template;
-
-    while (*p) {
-        /* Find next variable, copy everything until there */
-        const char *sv = strchr(p, '{');
-        if (!sv) {
-            /* Not found: copy till rest of template and stop */
-            res = sdscat(res, p);
-            break;
-        } else if (sv > p) {
-            /* Found: copy anything up to the begining of the variable */
-            res = sdscatlen(res, p, sv - p);
-        }
-
-        /* Skip into variable name, handle premature end or quoting */
-        sv++;
-        if (!*sv) goto error;       /* Premature end of template */
-        if (*sv == '{') {
-            /* Quoted '{' */
-            p = sv + 1;
-            res = sdscat(res, "{");
-            continue;
-        }
-
-        /* Find end of variable name, handle premature end of template */
-        const char *ev = strchr(sv, '}');
-        if (!ev) goto error;
-
-        /* Pass variable name to callback and obtain value. If callback failed,
-         * abort. */
-        sds varname = sdsnewlen(sv, ev - sv);
-        sds value = cb_func(varname, cb_arg);
-        sdsfree(varname);
-        if (!value) goto error;
-
-        /* Append value to result and continue */
-        res = sdscat(res, value);
-        sdsfree(value);
-        p = ev + 1;
-    }
-
-    return res;
-
-error:
-    sdsfree(res);
-    return NULL;
-}
-
-#ifdef REDIS_TEST
-#include <stdio.h>
-#include <limits.h>
-#include "testhelp.h"
-
-#define UNUSED(x) (void)(x)
-
-static sds sdsTestTemplateCallback(sds varname, void *arg) {
-    UNUSED(arg);
-    static const char *_var1 = "variable1";
-    static const char *_var2 = "variable2";
-
-    if (!strcmp(varname, _var1)) return sdsnew("value1");
-    else if (!strcmp(varname, _var2)) return sdsnew("value2");
-    else return NULL;
-}
-
-int sdsTest(int argc, char **argv, int accurate) {
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    {
-        sds x = sdsnew("foo"), y;
-
-        test_cond("Create a string and obtain the length",
-            sdslen(x) == 3 && memcmp(x,"foo\0",4) == 0);
-
-        sdsfree(x);
-        x = sdsnewlen("foo",2);
-        test_cond("Create a string with specified length",
-            sdslen(x) == 2 && memcmp(x,"fo\0",3) == 0);
-
-        x = sdscat(x,"bar");
-        test_cond("Strings concatenation",
-            sdslen(x) == 5 && memcmp(x,"fobar\0",6) == 0);
-
-        x = sdscpy(x,"a");
-        test_cond("sdscpy() against an originally longer string",
-            sdslen(x) == 1 && memcmp(x,"a\0",2) == 0);
-
-        x = sdscpy(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk");
-        test_cond("sdscpy() against an originally shorter string",
-            sdslen(x) == 33 &&
-            memcmp(x,"xyzxxxxxxxxxxyyyyyyyyyykkkkkkkkkk\0",33) == 0);
-
-        sdsfree(x);
-        x = sdscatprintf(sdsempty(),"%d",123);
-        test_cond("sdscatprintf() seems working in the base case",
-            sdslen(x) == 3 && memcmp(x,"123\0",4) == 0);
-
-        sdsfree(x);
-        x = sdscatprintf(sdsempty(),"a%cb",0);
-        test_cond("sdscatprintf() seems working with \\0 inside of result",
-            sdslen(x) == 3 && memcmp(x,"a\0""b\0",4) == 0);
-
-        {
-            sdsfree(x);
-            char etalon[1024*1024];
-            for (size_t i = 0; i < sizeof(etalon); i++) {
-                etalon[i] = '0';
-            }
-            x = sdscatprintf(sdsempty(),"%0*d",(int)sizeof(etalon),0);
-            test_cond("sdscatprintf() can print 1MB",
-                sdslen(x) == sizeof(etalon) && memcmp(x,etalon,sizeof(etalon)) == 0);
-        }
-
-        sdsfree(x);
-        x = sdsnew("--");
-        x = sdscatfmt(x, "Hello %s World %I,%I--", "Hi!", LLONG_MIN,LLONG_MAX);
-        test_cond("sdscatfmt() seems working in the base case",
-            sdslen(x) == 60 &&
-            memcmp(x,"--Hello Hi! World -9223372036854775808,"
-                     "9223372036854775807--",60) == 0);
-        printf("[%s]\n",x);
-
-        sdsfree(x);
-        x = sdsnew("--");
-        x = sdscatfmt(x, "%u,%U--", UINT_MAX, ULLONG_MAX);
-        test_cond("sdscatfmt() seems working with unsigned numbers",
-            sdslen(x) == 35 &&
-            memcmp(x,"--4294967295,18446744073709551615--",35) == 0);
-
-        sdsfree(x);
-        x = sdsnew(" x ");
-        sdstrim(x," x");
-        test_cond("sdstrim() works when all chars match",
-            sdslen(x) == 0);
-
-        sdsfree(x);
-        x = sdsnew(" x ");
-        sdstrim(x," ");
-        test_cond("sdstrim() works when a single char remains",
-            sdslen(x) == 1 && x[0] == 'x');
-
-        sdsfree(x);
-        x = sdsnew("xxciaoyyy");
-        sdstrim(x,"xy");
-        test_cond("sdstrim() correctly trims characters",
-            sdslen(x) == 4 && memcmp(x,"ciao\0",5) == 0);
-
-        y = sdsdup(x);
-        sdsrange(y,1,1);
-        test_cond("sdsrange(...,1,1)",
-            sdslen(y) == 1 && memcmp(y,"i\0",2) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,1,-1);
-        test_cond("sdsrange(...,1,-1)",
-            sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,-2,-1);
-        test_cond("sdsrange(...,-2,-1)",
-            sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,2,1);
-        test_cond("sdsrange(...,2,1)",
-            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,1,100);
-        test_cond("sdsrange(...,1,100)",
-            sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,100,100);
-        test_cond("sdsrange(...,100,100)",
-            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,4,6);
-        test_cond("sdsrange(...,4,6)",
-            sdslen(y) == 0 && memcmp(y,"\0",1) == 0);
-
-        sdsfree(y);
-        y = sdsdup(x);
-        sdsrange(y,3,6);
-        test_cond("sdsrange(...,3,6)",
-            sdslen(y) == 1 && memcmp(y,"o\0",2) == 0);
-
-        sdsfree(y);
-        sdsfree(x);
-        x = sdsnew("foo");
-        y = sdsnew("foa");
-        test_cond("sdscmp(foo,foa)", sdscmp(x,y) > 0);
-
-        sdsfree(y);
-        sdsfree(x);
-        x = sdsnew("bar");
-        y = sdsnew("bar");
-        test_cond("sdscmp(bar,bar)", sdscmp(x,y) == 0);
-
-        sdsfree(y);
-        sdsfree(x);
-        x = sdsnew("aar");
-        y = sdsnew("bar");
-        test_cond("sdscmp(bar,bar)", sdscmp(x,y) < 0);
-
-        sdsfree(y);
-        sdsfree(x);
-        x = sdsnewlen("\a\n\0foo\r",7);
-        y = sdscatrepr(sdsempty(),x,sdslen(x));
-        test_cond("sdscatrepr(...data...)",
-            memcmp(y,"\"\\a\\n\\x00foo\\r\"",15) == 0);
-
-        {
-            unsigned int oldfree;
-            char *p;
-            int i;
-            size_t step = 10, j;
-
-            sdsfree(x);
-            sdsfree(y);
-            x = sdsnew("0");
-            test_cond("sdsnew() free/len buffers", sdslen(x) == 1 && sdsavail(x) == 0);
-
-            /* Run the test a few times in order to hit the first two
-             * SDS header types. */
-            for (i = 0; i < 10; i++) {
-                size_t oldlen = sdslen(x);
-                x = sdsMakeRoomFor(x,step);
-                int type = x[-1]&SDS_TYPE_MASK;
-
-                test_cond("sdsMakeRoomFor() len", sdslen(x) == oldlen);
-                if (type != SDS_TYPE_5) {
-                    test_cond("sdsMakeRoomFor() free", sdsavail(x) >= step);
-                    oldfree = sdsavail(x);
-                    UNUSED(oldfree);
-                }
-                p = x+oldlen;
-                for (j = 0; j < step; j++) {
-                    p[j] = 'A'+j;
-                }
-                sdsIncrLen(x,step);
-            }
-            test_cond("sdsMakeRoomFor() content",
-                memcmp("0ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ",x,101) == 0);
-            test_cond("sdsMakeRoomFor() final length",sdslen(x)==101);
-
-            sdsfree(x);
-        }
-
-        /* Simple template */
-        x = sdstemplate("v1={variable1} v2={variable2}", sdsTestTemplateCallback, NULL);
-        test_cond("sdstemplate() normal flow",
-                  memcmp(x,"v1=value1 v2=value2",19) == 0);
-        sdsfree(x);
-
-        /* Template with callback error */
-        x = sdstemplate("v1={variable1} v3={doesnotexist}", sdsTestTemplateCallback, NULL);
-        test_cond("sdstemplate() with callback error", x == NULL);
-
-        /* Template with empty var name */
-        x = sdstemplate("v1={", sdsTestTemplateCallback, NULL);
-        test_cond("sdstemplate() with empty var name", x == NULL);
-
-        /* Template with truncated var name */
-        x = sdstemplate("v1={start", sdsTestTemplateCallback, NULL);
-        test_cond("sdstemplate() with truncated var name", x == NULL);
-
-        /* Template with quoting */
-        x = sdstemplate("v1={{{variable1}} {{} v2={variable2}", sdsTestTemplateCallback, NULL);
-        test_cond("sdstemplate() with quoting",
-                  memcmp(x,"v1={value1} {} v2=value2",24) == 0);
-        sdsfree(x);
-    }
-    test_report();
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/sds.h b/redis-stable/src/sds.h
deleted file mode 100644
index 6699858c..00000000
--- a/redis-stable/src/sds.h
+++ /dev/null
@@ -1,284 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Oran Agra
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __SDS_H
-#define __SDS_H
-
-#define SDS_MAX_PREALLOC (1024*1024)
-extern const char *SDS_NOINIT;
-
-#include <sys/types.h>
-#include <stdarg.h>
-#include <stdint.h>
-
-typedef char *sds;
-
-/* Note: sdshdr5 is never used, we just access the flags byte directly.
- * However is here to document the layout of type 5 SDS strings. */
-struct __attribute__ ((__packed__)) sdshdr5 {
-    unsigned char flags; /* 3 lsb of type, and 5 msb of string length */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) sdshdr8 {
-    uint8_t len; /* used */
-    uint8_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) sdshdr16 {
-    uint16_t len; /* used */
-    uint16_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) sdshdr32 {
-    uint32_t len; /* used */
-    uint32_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-struct __attribute__ ((__packed__)) sdshdr64 {
-    uint64_t len; /* used */
-    uint64_t alloc; /* excluding the header and null terminator */
-    unsigned char flags; /* 3 lsb of type, 5 unused bits */
-    char buf[];
-};
-
-#define SDS_TYPE_5  0
-#define SDS_TYPE_8  1
-#define SDS_TYPE_16 2
-#define SDS_TYPE_32 3
-#define SDS_TYPE_64 4
-#define SDS_TYPE_MASK 7
-#define SDS_TYPE_BITS 3
-#define SDS_HDR_VAR(T,s) struct sdshdr##T *sh = (void*)((s)-(sizeof(struct sdshdr##T)));
-#define SDS_HDR(T,s) ((struct sdshdr##T *)((s)-(sizeof(struct sdshdr##T))))
-#define SDS_TYPE_5_LEN(f) ((f)>>SDS_TYPE_BITS)
-
-static inline size_t sdslen(const sds s) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            return SDS_TYPE_5_LEN(flags);
-        case SDS_TYPE_8:
-            return SDS_HDR(8,s)->len;
-        case SDS_TYPE_16:
-            return SDS_HDR(16,s)->len;
-        case SDS_TYPE_32:
-            return SDS_HDR(32,s)->len;
-        case SDS_TYPE_64:
-            return SDS_HDR(64,s)->len;
-    }
-    return 0;
-}
-
-static inline size_t sdsavail(const sds s) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5: {
-            return 0;
-        }
-        case SDS_TYPE_8: {
-            SDS_HDR_VAR(8,s);
-            return sh->alloc - sh->len;
-        }
-        case SDS_TYPE_16: {
-            SDS_HDR_VAR(16,s);
-            return sh->alloc - sh->len;
-        }
-        case SDS_TYPE_32: {
-            SDS_HDR_VAR(32,s);
-            return sh->alloc - sh->len;
-        }
-        case SDS_TYPE_64: {
-            SDS_HDR_VAR(64,s);
-            return sh->alloc - sh->len;
-        }
-    }
-    return 0;
-}
-
-static inline void sdssetlen(sds s, size_t newlen) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            {
-                unsigned char *fp = ((unsigned char*)s)-1;
-                *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);
-            }
-            break;
-        case SDS_TYPE_8:
-            SDS_HDR(8,s)->len = newlen;
-            break;
-        case SDS_TYPE_16:
-            SDS_HDR(16,s)->len = newlen;
-            break;
-        case SDS_TYPE_32:
-            SDS_HDR(32,s)->len = newlen;
-            break;
-        case SDS_TYPE_64:
-            SDS_HDR(64,s)->len = newlen;
-            break;
-    }
-}
-
-static inline void sdsinclen(sds s, size_t inc) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            {
-                unsigned char *fp = ((unsigned char*)s)-1;
-                unsigned char newlen = SDS_TYPE_5_LEN(flags)+inc;
-                *fp = SDS_TYPE_5 | (newlen << SDS_TYPE_BITS);
-            }
-            break;
-        case SDS_TYPE_8:
-            SDS_HDR(8,s)->len += inc;
-            break;
-        case SDS_TYPE_16:
-            SDS_HDR(16,s)->len += inc;
-            break;
-        case SDS_TYPE_32:
-            SDS_HDR(32,s)->len += inc;
-            break;
-        case SDS_TYPE_64:
-            SDS_HDR(64,s)->len += inc;
-            break;
-    }
-}
-
-/* sdsalloc() = sdsavail() + sdslen() */
-static inline size_t sdsalloc(const sds s) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            return SDS_TYPE_5_LEN(flags);
-        case SDS_TYPE_8:
-            return SDS_HDR(8,s)->alloc;
-        case SDS_TYPE_16:
-            return SDS_HDR(16,s)->alloc;
-        case SDS_TYPE_32:
-            return SDS_HDR(32,s)->alloc;
-        case SDS_TYPE_64:
-            return SDS_HDR(64,s)->alloc;
-    }
-    return 0;
-}
-
-static inline void sdssetalloc(sds s, size_t newlen) {
-    unsigned char flags = s[-1];
-    switch(flags&SDS_TYPE_MASK) {
-        case SDS_TYPE_5:
-            /* Nothing to do, this type has no total allocation info. */
-            break;
-        case SDS_TYPE_8:
-            SDS_HDR(8,s)->alloc = newlen;
-            break;
-        case SDS_TYPE_16:
-            SDS_HDR(16,s)->alloc = newlen;
-            break;
-        case SDS_TYPE_32:
-            SDS_HDR(32,s)->alloc = newlen;
-            break;
-        case SDS_TYPE_64:
-            SDS_HDR(64,s)->alloc = newlen;
-            break;
-    }
-}
-
-sds sdsnewlen(const void *init, size_t initlen);
-sds sdstrynewlen(const void *init, size_t initlen);
-sds sdsnew(const char *init);
-sds sdsempty(void);
-sds sdsdup(const sds s);
-void sdsfree(sds s);
-sds sdsgrowzero(sds s, size_t len);
-sds sdscatlen(sds s, const void *t, size_t len);
-sds sdscat(sds s, const char *t);
-sds sdscatsds(sds s, const sds t);
-sds sdscpylen(sds s, const char *t, size_t len);
-sds sdscpy(sds s, const char *t);
-
-sds sdscatvprintf(sds s, const char *fmt, va_list ap);
-#ifdef __GNUC__
-sds sdscatprintf(sds s, const char *fmt, ...)
-    __attribute__((format(printf, 2, 3)));
-#else
-sds sdscatprintf(sds s, const char *fmt, ...);
-#endif
-
-sds sdscatfmt(sds s, char const *fmt, ...);
-sds sdstrim(sds s, const char *cset);
-void sdssubstr(sds s, size_t start, size_t len);
-void sdsrange(sds s, ssize_t start, ssize_t end);
-void sdsupdatelen(sds s);
-void sdsclear(sds s);
-int sdscmp(const sds s1, const sds s2);
-sds *sdssplitlen(const char *s, ssize_t len, const char *sep, int seplen, int *count);
-void sdsfreesplitres(sds *tokens, int count);
-void sdstolower(sds s);
-void sdstoupper(sds s);
-sds sdsfromlonglong(long long value);
-sds sdscatrepr(sds s, const char *p, size_t len);
-sds *sdssplitargs(const char *line, int *argc);
-sds sdsmapchars(sds s, const char *from, const char *to, size_t setlen);
-sds sdsjoin(char **argv, int argc, char *sep);
-sds sdsjoinsds(sds *argv, int argc, const char *sep, size_t seplen);
-
-/* Callback for sdstemplate. The function gets called by sdstemplate
- * every time a variable needs to be expanded. The variable name is
- * provided as variable, and the callback is expected to return a
- * substitution value. Returning a NULL indicates an error.
- */
-typedef sds (*sdstemplate_callback_t)(const sds variable, void *arg);
-sds sdstemplate(const char *template, sdstemplate_callback_t cb_func, void *cb_arg);
-
-/* Low level functions exposed to the user API */
-sds sdsMakeRoomFor(sds s, size_t addlen);
-void sdsIncrLen(sds s, ssize_t incr);
-sds sdsRemoveFreeSpace(sds s);
-size_t sdsAllocSize(sds s);
-void *sdsAllocPtr(sds s);
-
-/* Export the allocator used by SDS to the program using SDS.
- * Sometimes the program SDS is linked to, may use a different set of
- * allocators, but may want to allocate or free things that SDS will
- * respectively free or allocate. */
-void *sds_malloc(size_t size);
-void *sds_realloc(void *ptr, size_t size);
-void sds_free(void *ptr);
-
-#ifdef REDIS_TEST
-int sdsTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif
diff --git a/redis-stable/src/sdsalloc.h b/redis-stable/src/sdsalloc.h
deleted file mode 100644
index a1c5584f..00000000
--- a/redis-stable/src/sdsalloc.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/* SDSLib 2.0 -- A C dynamic strings library
- *
- * Copyright (c) 2006-2015, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2015, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* SDS allocator selection.
- *
- * This file is used in order to change the SDS allocator at compile time.
- * Just define the following defines to what you want to use. Also add
- * the include of your alternate allocator if needed (not needed in order
- * to use the default libc allocator). */
-
-#ifndef __SDS_ALLOC_H__
-#define __SDS_ALLOC_H__
-
-#include "zmalloc.h"
-#define s_malloc zmalloc
-#define s_realloc zrealloc
-#define s_trymalloc ztrymalloc
-#define s_tryrealloc ztryrealloc
-#define s_free zfree
-#define s_malloc_usable zmalloc_usable
-#define s_realloc_usable zrealloc_usable
-#define s_trymalloc_usable ztrymalloc_usable
-#define s_tryrealloc_usable ztryrealloc_usable
-#define s_free_usable zfree_usable
-
-#endif
diff --git a/redis-stable/src/sentinel.c b/redis-stable/src/sentinel.c
deleted file mode 100644
index a9d123eb..00000000
--- a/redis-stable/src/sentinel.c
+++ /dev/null
@@ -1,5112 +0,0 @@
-/* Redis Sentinel implementation
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "hiredis.h"
-#ifdef USE_OPENSSL
-#include "openssl/ssl.h"
-#include "hiredis_ssl.h"
-#endif
-#include "async.h"
-
-#include <ctype.h>
-#include <arpa/inet.h>
-#include <sys/socket.h>
-#include <sys/wait.h>
-#include <fcntl.h>
-
-extern char **environ;
-
-#ifdef USE_OPENSSL
-extern SSL_CTX *redis_tls_ctx;
-extern SSL_CTX *redis_tls_client_ctx;
-#endif
-
-#define REDIS_SENTINEL_PORT 26379
-
-/* ======================== Sentinel global state =========================== */
-
-/* Address object, used to describe an ip:port pair. */
-typedef struct sentinelAddr {
-    char *hostname;         /* Hostname OR address, as specified */
-    char *ip;               /* Always a resolved address */
-    int port;
-} sentinelAddr;
-
-/* A Sentinel Redis Instance object is monitoring. */
-#define SRI_MASTER  (1<<0)
-#define SRI_SLAVE   (1<<1)
-#define SRI_SENTINEL (1<<2)
-#define SRI_S_DOWN (1<<3)   /* Subjectively down (no quorum). */
-#define SRI_O_DOWN (1<<4)   /* Objectively down (confirmed by others). */
-#define SRI_MASTER_DOWN (1<<5) /* A Sentinel with this flag set thinks that
-                                   its master is down. */
-#define SRI_FAILOVER_IN_PROGRESS (1<<6) /* Failover is in progress for
-                                           this master. */
-#define SRI_PROMOTED (1<<7)            /* Slave selected for promotion. */
-#define SRI_RECONF_SENT (1<<8)     /* SLAVEOF <newmaster> sent. */
-#define SRI_RECONF_INPROG (1<<9)   /* Slave synchronization in progress. */
-#define SRI_RECONF_DONE (1<<10)     /* Slave synchronized with new master. */
-#define SRI_FORCE_FAILOVER (1<<11)  /* Force failover with master up. */
-#define SRI_SCRIPT_KILL_SENT (1<<12) /* SCRIPT KILL already sent on -BUSY */
-
-/* Note: times are in milliseconds. */
-#define SENTINEL_INFO_PERIOD 10000
-#define SENTINEL_PING_PERIOD 1000
-#define SENTINEL_ASK_PERIOD 1000
-#define SENTINEL_PUBLISH_PERIOD 2000
-#define SENTINEL_DEFAULT_DOWN_AFTER 30000
-#define SENTINEL_HELLO_CHANNEL "__sentinel__:hello"
-#define SENTINEL_TILT_TRIGGER 2000
-#define SENTINEL_TILT_PERIOD (SENTINEL_PING_PERIOD*30)
-#define SENTINEL_DEFAULT_SLAVE_PRIORITY 100
-#define SENTINEL_SLAVE_RECONF_TIMEOUT 10000
-#define SENTINEL_DEFAULT_PARALLEL_SYNCS 1
-#define SENTINEL_MIN_LINK_RECONNECT_PERIOD 15000
-#define SENTINEL_DEFAULT_FAILOVER_TIMEOUT (60*3*1000)
-#define SENTINEL_MAX_PENDING_COMMANDS 100
-#define SENTINEL_ELECTION_TIMEOUT 10000
-#define SENTINEL_MAX_DESYNC 1000
-#define SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG 1
-#define SENTINEL_DEFAULT_RESOLVE_HOSTNAMES 0
-#define SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES 0
-
-/* Failover machine different states. */
-#define SENTINEL_FAILOVER_STATE_NONE 0  /* No failover in progress. */
-#define SENTINEL_FAILOVER_STATE_WAIT_START 1  /* Wait for failover_start_time*/
-#define SENTINEL_FAILOVER_STATE_SELECT_SLAVE 2 /* Select slave to promote */
-#define SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE 3 /* Slave -> Master */
-#define SENTINEL_FAILOVER_STATE_WAIT_PROMOTION 4 /* Wait slave to change role */
-#define SENTINEL_FAILOVER_STATE_RECONF_SLAVES 5 /* SLAVEOF newmaster */
-#define SENTINEL_FAILOVER_STATE_UPDATE_CONFIG 6 /* Monitor promoted slave. */
-
-#define SENTINEL_MASTER_LINK_STATUS_UP 0
-#define SENTINEL_MASTER_LINK_STATUS_DOWN 1
-
-/* Generic flags that can be used with different functions.
- * They use higher bits to avoid colliding with the function specific
- * flags. */
-#define SENTINEL_NO_FLAGS 0
-#define SENTINEL_GENERATE_EVENT (1<<16)
-#define SENTINEL_LEADER (1<<17)
-#define SENTINEL_OBSERVER (1<<18)
-
-/* Script execution flags and limits. */
-#define SENTINEL_SCRIPT_NONE 0
-#define SENTINEL_SCRIPT_RUNNING 1
-#define SENTINEL_SCRIPT_MAX_QUEUE 256
-#define SENTINEL_SCRIPT_MAX_RUNNING 16
-#define SENTINEL_SCRIPT_MAX_RUNTIME 60000 /* 60 seconds max exec time. */
-#define SENTINEL_SCRIPT_MAX_RETRY 10
-#define SENTINEL_SCRIPT_RETRY_DELAY 30000 /* 30 seconds between retries. */
-
-/* SENTINEL SIMULATE-FAILURE command flags. */
-#define SENTINEL_SIMFAILURE_NONE 0
-#define SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION (1<<0)
-#define SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION (1<<1)
-
-/* The link to a sentinelRedisInstance. When we have the same set of Sentinels
- * monitoring many masters, we have different instances representing the
- * same Sentinels, one per master, and we need to share the hiredis connections
- * among them. Otherwise if 5 Sentinels are monitoring 100 masters we create
- * 500 outgoing connections instead of 5.
- *
- * So this structure represents a reference counted link in terms of the two
- * hiredis connections for commands and Pub/Sub, and the fields needed for
- * failure detection, since the ping/pong time are now local to the link: if
- * the link is available, the instance is available. This way we don't just
- * have 5 connections instead of 500, we also send 5 pings instead of 500.
- *
- * Links are shared only for Sentinels: master and slave instances have
- * a link with refcount = 1, always. */
-typedef struct instanceLink {
-    int refcount;          /* Number of sentinelRedisInstance owners. */
-    int disconnected;      /* Non-zero if we need to reconnect cc or pc. */
-    int pending_commands;  /* Number of commands sent waiting for a reply. */
-    redisAsyncContext *cc; /* Hiredis context for commands. */
-    redisAsyncContext *pc; /* Hiredis context for Pub / Sub. */
-    mstime_t cc_conn_time; /* cc connection time. */
-    mstime_t pc_conn_time; /* pc connection time. */
-    mstime_t pc_last_activity; /* Last time we received any message. */
-    mstime_t last_avail_time; /* Last time the instance replied to ping with
-                                 a reply we consider valid. */
-    mstime_t act_ping_time;   /* Time at which the last pending ping (no pong
-                                 received after it) was sent. This field is
-                                 set to 0 when a pong is received, and set again
-                                 to the current time if the value is 0 and a new
-                                 ping is sent. */
-    mstime_t last_ping_time;  /* Time at which we sent the last ping. This is
-                                 only used to avoid sending too many pings
-                                 during failure. Idle time is computed using
-                                 the act_ping_time field. */
-    mstime_t last_pong_time;  /* Last time the instance replied to ping,
-                                 whatever the reply was. That's used to check
-                                 if the link is idle and must be reconnected. */
-    mstime_t last_reconn_time;  /* Last reconnection attempt performed when
-                                   the link was down. */
-} instanceLink;
-
-typedef struct sentinelRedisInstance {
-    int flags;      /* See SRI_... defines */
-    char *name;     /* Master name from the point of view of this sentinel. */
-    char *runid;    /* Run ID of this instance, or unique ID if is a Sentinel.*/
-    uint64_t config_epoch;  /* Configuration epoch. */
-    sentinelAddr *addr; /* Master host. */
-    instanceLink *link; /* Link to the instance, may be shared for Sentinels. */
-    mstime_t last_pub_time;   /* Last time we sent hello via Pub/Sub. */
-    mstime_t last_hello_time; /* Only used if SRI_SENTINEL is set. Last time
-                                 we received a hello from this Sentinel
-                                 via Pub/Sub. */
-    mstime_t last_master_down_reply_time; /* Time of last reply to
-                                             SENTINEL is-master-down command. */
-    mstime_t s_down_since_time; /* Subjectively down since time. */
-    mstime_t o_down_since_time; /* Objectively down since time. */
-    mstime_t down_after_period; /* Consider it down after that period. */
-    mstime_t info_refresh;  /* Time at which we received INFO output from it. */
-    dict *renamed_commands;     /* Commands renamed in this instance:
-                                   Sentinel will use the alternative commands
-                                   mapped on this table to send things like
-                                   SLAVEOF, CONFING, INFO, ... */
-
-    /* Role and the first time we observed it.
-     * This is useful in order to delay replacing what the instance reports
-     * with our own configuration. We need to always wait some time in order
-     * to give a chance to the leader to report the new configuration before
-     * we do silly things. */
-    int role_reported;
-    mstime_t role_reported_time;
-    mstime_t slave_conf_change_time; /* Last time slave master addr changed. */
-
-    /* Master specific. */
-    dict *sentinels;    /* Other sentinels monitoring the same master. */
-    dict *slaves;       /* Slaves for this master instance. */
-    unsigned int quorum;/* Number of sentinels that need to agree on failure. */
-    int parallel_syncs; /* How many slaves to reconfigure at same time. */
-    char *auth_pass;    /* Password to use for AUTH against master & replica. */
-    char *auth_user;    /* Username for ACLs AUTH against master & replica. */
-
-    /* Slave specific. */
-    mstime_t master_link_down_time; /* Slave replication link down time. */
-    int slave_priority; /* Slave priority according to its INFO output. */
-    int replica_announced; /* Replica announcing according to its INFO output. */
-    mstime_t slave_reconf_sent_time; /* Time at which we sent SLAVE OF <new> */
-    struct sentinelRedisInstance *master; /* Master instance if it's slave. */
-    char *slave_master_host;    /* Master host as reported by INFO */
-    int slave_master_port;      /* Master port as reported by INFO */
-    int slave_master_link_status; /* Master link status as reported by INFO */
-    unsigned long long slave_repl_offset; /* Slave replication offset. */
-    /* Failover */
-    char *leader;       /* If this is a master instance, this is the runid of
-                           the Sentinel that should perform the failover. If
-                           this is a Sentinel, this is the runid of the Sentinel
-                           that this Sentinel voted as leader. */
-    uint64_t leader_epoch; /* Epoch of the 'leader' field. */
-    uint64_t failover_epoch; /* Epoch of the currently started failover. */
-    int failover_state; /* See SENTINEL_FAILOVER_STATE_* defines. */
-    mstime_t failover_state_change_time;
-    mstime_t failover_start_time;   /* Last failover attempt start time. */
-    mstime_t failover_timeout;      /* Max time to refresh failover state. */
-    mstime_t failover_delay_logged; /* For what failover_start_time value we
-                                       logged the failover delay. */
-    struct sentinelRedisInstance *promoted_slave; /* Promoted slave instance. */
-    /* Scripts executed to notify admin or reconfigure clients: when they
-     * are set to NULL no script is executed. */
-    char *notification_script;
-    char *client_reconfig_script;
-    sds info; /* cached INFO output */
-} sentinelRedisInstance;
-
-/* Main state. */
-struct sentinelState {
-    char myid[CONFIG_RUN_ID_SIZE+1]; /* This sentinel ID. */
-    uint64_t current_epoch;         /* Current epoch. */
-    dict *masters;      /* Dictionary of master sentinelRedisInstances.
-                           Key is the instance name, value is the
-                           sentinelRedisInstance structure pointer. */
-    int tilt;           /* Are we in TILT mode? */
-    int running_scripts;    /* Number of scripts in execution right now. */
-    mstime_t tilt_start_time;       /* When TITL started. */
-    mstime_t previous_time;         /* Last time we ran the time handler. */
-    list *scripts_queue;            /* Queue of user scripts to execute. */
-    char *announce_ip;  /* IP addr that is gossiped to other sentinels if
-                           not NULL. */
-    int announce_port;  /* Port that is gossiped to other sentinels if
-                           non zero. */
-    unsigned long simfailure_flags; /* Failures simulation. */
-    int deny_scripts_reconfig; /* Allow SENTINEL SET ... to change script
-                                  paths at runtime? */
-    char *sentinel_auth_pass;    /* Password to use for AUTH against other sentinel */
-    char *sentinel_auth_user;    /* Username for ACLs AUTH against other sentinel. */
-    int resolve_hostnames;       /* Support use of hostnames, assuming DNS is well configured. */
-    int announce_hostnames;      /* Announce hostnames instead of IPs when we have them. */
-} sentinel;
-
-/* A script execution job. */
-typedef struct sentinelScriptJob {
-    int flags;              /* Script job flags: SENTINEL_SCRIPT_* */
-    int retry_num;          /* Number of times we tried to execute it. */
-    char **argv;            /* Arguments to call the script. */
-    mstime_t start_time;    /* Script execution time if the script is running,
-                               otherwise 0 if we are allowed to retry the
-                               execution at any time. If the script is not
-                               running and it's not 0, it means: do not run
-                               before the specified time. */
-    pid_t pid;              /* Script execution pid. */
-} sentinelScriptJob;
-
-/* ======================= hiredis ae.c adapters =============================
- * Note: this implementation is taken from hiredis/adapters/ae.h, however
- * we have our modified copy for Sentinel in order to use our allocator
- * and to have full control over how the adapter works. */
-
-typedef struct redisAeEvents {
-    redisAsyncContext *context;
-    aeEventLoop *loop;
-    int fd;
-    int reading, writing;
-} redisAeEvents;
-
-static void redisAeReadEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
-    ((void)el); ((void)fd); ((void)mask);
-
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAsyncHandleRead(e->context);
-}
-
-static void redisAeWriteEvent(aeEventLoop *el, int fd, void *privdata, int mask) {
-    ((void)el); ((void)fd); ((void)mask);
-
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAsyncHandleWrite(e->context);
-}
-
-static void redisAeAddRead(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (!e->reading) {
-        e->reading = 1;
-        aeCreateFileEvent(loop,e->fd,AE_READABLE,redisAeReadEvent,e);
-    }
-}
-
-static void redisAeDelRead(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (e->reading) {
-        e->reading = 0;
-        aeDeleteFileEvent(loop,e->fd,AE_READABLE);
-    }
-}
-
-static void redisAeAddWrite(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (!e->writing) {
-        e->writing = 1;
-        aeCreateFileEvent(loop,e->fd,AE_WRITABLE,redisAeWriteEvent,e);
-    }
-}
-
-static void redisAeDelWrite(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    aeEventLoop *loop = e->loop;
-    if (e->writing) {
-        e->writing = 0;
-        aeDeleteFileEvent(loop,e->fd,AE_WRITABLE);
-    }
-}
-
-static void redisAeCleanup(void *privdata) {
-    redisAeEvents *e = (redisAeEvents*)privdata;
-    redisAeDelRead(privdata);
-    redisAeDelWrite(privdata);
-    zfree(e);
-}
-
-static int redisAeAttach(aeEventLoop *loop, redisAsyncContext *ac) {
-    redisContext *c = &(ac->c);
-    redisAeEvents *e;
-
-    /* Nothing should be attached when something is already attached */
-    if (ac->ev.data != NULL)
-        return C_ERR;
-
-    /* Create container for context and r/w events */
-    e = (redisAeEvents*)zmalloc(sizeof(*e));
-    e->context = ac;
-    e->loop = loop;
-    e->fd = c->fd;
-    e->reading = e->writing = 0;
-
-    /* Register functions to start/stop listening for events */
-    ac->ev.addRead = redisAeAddRead;
-    ac->ev.delRead = redisAeDelRead;
-    ac->ev.addWrite = redisAeAddWrite;
-    ac->ev.delWrite = redisAeDelWrite;
-    ac->ev.cleanup = redisAeCleanup;
-    ac->ev.data = e;
-
-    return C_OK;
-}
-
-/* ============================= Prototypes ================================= */
-
-void sentinelLinkEstablishedCallback(const redisAsyncContext *c, int status);
-void sentinelDisconnectCallback(const redisAsyncContext *c, int status);
-void sentinelReceiveHelloMessages(redisAsyncContext *c, void *reply, void *privdata);
-sentinelRedisInstance *sentinelGetMasterByName(char *name);
-char *sentinelGetSubjectiveLeader(sentinelRedisInstance *master);
-char *sentinelGetObjectiveLeader(sentinelRedisInstance *master);
-int yesnotoi(char *s);
-void instanceLinkConnectionError(const redisAsyncContext *c);
-const char *sentinelRedisInstanceTypeStr(sentinelRedisInstance *ri);
-void sentinelAbortFailover(sentinelRedisInstance *ri);
-void sentinelEvent(int level, char *type, sentinelRedisInstance *ri, const char *fmt, ...);
-sentinelRedisInstance *sentinelSelectSlave(sentinelRedisInstance *master);
-void sentinelScheduleScriptExecution(char *path, ...);
-void sentinelStartFailover(sentinelRedisInstance *master);
-void sentinelDiscardReplyCallback(redisAsyncContext *c, void *reply, void *privdata);
-int sentinelSendSlaveOf(sentinelRedisInstance *ri, const sentinelAddr *addr);
-char *sentinelVoteLeader(sentinelRedisInstance *master, uint64_t req_epoch, char *req_runid, uint64_t *leader_epoch);
-void sentinelFlushConfig(void);
-void sentinelGenerateInitialMonitorEvents(void);
-int sentinelSendPing(sentinelRedisInstance *ri);
-int sentinelForceHelloUpdateForMaster(sentinelRedisInstance *master);
-sentinelRedisInstance *getSentinelRedisInstanceByAddrAndRunID(dict *instances, char *ip, int port, char *runid);
-void sentinelSimFailureCrash(void);
-
-/* ========================= Dictionary types =============================== */
-
-uint64_t dictSdsHash(const void *key);
-uint64_t dictSdsCaseHash(const void *key);
-int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
-int dictSdsKeyCaseCompare(void *privdata, const void *key1, const void *key2);
-void releaseSentinelRedisInstance(sentinelRedisInstance *ri);
-
-void dictInstancesValDestructor (void *privdata, void *obj) {
-    UNUSED(privdata);
-    releaseSentinelRedisInstance(obj);
-}
-
-/* Instance name (sds) -> instance (sentinelRedisInstance pointer)
- *
- * also used for: sentinelRedisInstance->sentinels dictionary that maps
- * sentinels ip:port to last seen time in Pub/Sub hello message. */
-dictType instancesDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* key destructor */
-    dictInstancesValDestructor,/* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* Instance runid (sds) -> votes (long casted to void*)
- *
- * This is useful into sentinelGetObjectiveLeader() function in order to
- * count the votes and understand who is the leader. */
-dictType leaderVotesDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* key destructor */
-    NULL,                      /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* Instance renamed commands table. */
-dictType renamedCommandsDictType = {
-    dictSdsCaseHash,           /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCaseCompare,     /* key compare */
-    dictSdsDestructor,         /* key destructor */
-    dictSdsDestructor,         /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* =========================== Initialization =============================== */
-
-void sentinelCommand(client *c);
-void sentinelInfoCommand(client *c);
-void sentinelSetCommand(client *c);
-void sentinelPublishCommand(client *c);
-void sentinelRoleCommand(client *c);
-void sentinelConfigGetCommand(client *c);
-void sentinelConfigSetCommand(client *c);
-
-struct redisCommand sentinelcmds[] = {
-    {"ping",pingCommand,1,"fast @connection",0,NULL,0,0,0,0,0},
-    {"sentinel",sentinelCommand,-2,"admin",0,NULL,0,0,0,0,0},
-    {"subscribe",subscribeCommand,-2,"pub-sub",0,NULL,0,0,0,0,0},
-    {"unsubscribe",unsubscribeCommand,-1,"pub-sub",0,NULL,0,0,0,0,0},
-    {"psubscribe",psubscribeCommand,-2,"pub-sub",0,NULL,0,0,0,0,0},
-    {"punsubscribe",punsubscribeCommand,-1,"pub-sub",0,NULL,0,0,0,0,0},
-    {"publish",sentinelPublishCommand,3,"pub-sub fast",0,NULL,0,0,0,0,0},
-    {"info",sentinelInfoCommand,-1,"random @dangerous",0,NULL,0,0,0,0,0},
-    {"role",sentinelRoleCommand,1,"fast read-only @dangerous",0,NULL,0,0,0,0,0},
-    {"client",clientCommand,-2,"admin random @connection",0,NULL,0,0,0,0,0},
-    {"shutdown",shutdownCommand,-1,"admin",0,NULL,0,0,0,0,0},
-    {"auth",authCommand,-2,"no-auth fast @connection",0,NULL,0,0,0,0,0},
-    {"hello",helloCommand,-1,"no-auth fast @connection",0,NULL,0,0,0,0,0},
-    {"acl",aclCommand,-2,"admin",0,NULL,0,0,0,0,0,0},
-    {"command",commandCommand,-1, "random @connection", 0,NULL,0,0,0,0,0,0}
-};
-
-/* this array is used for sentinel config lookup, which need to be loaded
- * before monitoring masters config to avoid dependency issues */
-const char *preMonitorCfgName[] = { 
-    "announce-ip",
-    "announce-port",
-    "deny-scripts-reconfig",
-    "sentinel-user",
-    "sentinel-pass",
-    "current-epoch",
-    "myid",
-    "resolve-hostnames",
-    "announce-hostnames"
-};
-
-/* This function overwrites a few normal Redis config default with Sentinel
- * specific defaults. */
-void initSentinelConfig(void) {
-    server.port = REDIS_SENTINEL_PORT;
-    server.protected_mode = 0; /* Sentinel must be exposed. */
-}
-
-void freeSentinelLoadQueueEntry(void *item);
-
-/* Perform the Sentinel mode initialization. */
-void initSentinel(void) {
-    unsigned int j;
-
-    /* Remove usual Redis commands from the command table, then just add
-     * the SENTINEL command. */
-    dictEmpty(server.commands,NULL);
-    dictEmpty(server.orig_commands,NULL);
-    ACLClearCommandID();
-    for (j = 0; j < sizeof(sentinelcmds)/sizeof(sentinelcmds[0]); j++) {
-        int retval;
-        struct redisCommand *cmd = sentinelcmds+j;
-        cmd->id = ACLGetCommandID(cmd->name); /* Assign the ID used for ACL. */
-        retval = dictAdd(server.commands, sdsnew(cmd->name), cmd);
-        serverAssert(retval == DICT_OK);
-        retval = dictAdd(server.orig_commands, sdsnew(cmd->name), cmd);
-        serverAssert(retval == DICT_OK);
-
-        /* Translate the command string flags description into an actual
-         * set of flags. */
-        if (populateCommandTableParseFlags(cmd,cmd->sflags) == C_ERR)
-            serverPanic("Unsupported command flag");
-    }
-
-    /* Initialize various data structures. */
-    sentinel.current_epoch = 0;
-    sentinel.masters = dictCreate(&instancesDictType,NULL);
-    sentinel.tilt = 0;
-    sentinel.tilt_start_time = 0;
-    sentinel.previous_time = mstime();
-    sentinel.running_scripts = 0;
-    sentinel.scripts_queue = listCreate();
-    sentinel.announce_ip = NULL;
-    sentinel.announce_port = 0;
-    sentinel.simfailure_flags = SENTINEL_SIMFAILURE_NONE;
-    sentinel.deny_scripts_reconfig = SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG;
-    sentinel.sentinel_auth_pass = NULL;
-    sentinel.sentinel_auth_user = NULL;
-    sentinel.resolve_hostnames = SENTINEL_DEFAULT_RESOLVE_HOSTNAMES;
-    sentinel.announce_hostnames = SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES;
-    memset(sentinel.myid,0,sizeof(sentinel.myid));
-    server.sentinel_config = NULL;
-}
-
-/* This function is for checking whether sentinel config file has been set,
- * also checking whether we have write permissions. */
-void sentinelCheckConfigFile(void) {
-    if (server.configfile == NULL) {
-        serverLog(LL_WARNING,
-            "Sentinel needs config file on disk to save state. Exiting...");
-        exit(1);
-    } else if (access(server.configfile,W_OK) == -1) {
-        serverLog(LL_WARNING,
-            "Sentinel config file %s is not writable: %s. Exiting...",
-            server.configfile,strerror(errno));
-        exit(1);
-    }
-}
-
-/* This function gets called when the server is in Sentinel mode, started,
- * loaded the configuration, and is ready for normal operations. */
-void sentinelIsRunning(void) {
-    int j;
-
-    /* If this Sentinel has yet no ID set in the configuration file, we
-     * pick a random one and persist the config on disk. From now on this
-     * will be this Sentinel ID across restarts. */
-    for (j = 0; j < CONFIG_RUN_ID_SIZE; j++)
-        if (sentinel.myid[j] != 0) break;
-
-    if (j == CONFIG_RUN_ID_SIZE) {
-        /* Pick ID and persist the config. */
-        getRandomHexChars(sentinel.myid,CONFIG_RUN_ID_SIZE);
-        sentinelFlushConfig();
-    }
-
-    /* Log its ID to make debugging of issues simpler. */
-    serverLog(LL_WARNING,"Sentinel ID is %s", sentinel.myid);
-
-    /* We want to generate a +monitor event for every configured master
-     * at startup. */
-    sentinelGenerateInitialMonitorEvents();
-}
-
-/* ============================== sentinelAddr ============================== */
-
-/* Create a sentinelAddr object and return it on success.
- * On error NULL is returned and errno is set to:
- *  ENOENT: Can't resolve the hostname.
- *  EINVAL: Invalid port number.
- */
-sentinelAddr *createSentinelAddr(char *hostname, int port) {
-    char ip[NET_IP_STR_LEN];
-    sentinelAddr *sa;
-
-    if (port < 0 || port > 65535) {
-        errno = EINVAL;
-        return NULL;
-    }
-    if (anetResolve(NULL,hostname,ip,sizeof(ip),
-                    sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR) {
-        errno = ENOENT;
-        return NULL;
-    }
-    sa = zmalloc(sizeof(*sa));
-    sa->hostname = sdsnew(hostname);
-    sa->ip = sdsnew(ip);
-    sa->port = port;
-    return sa;
-}
-
-/* Return a duplicate of the source address. */
-sentinelAddr *dupSentinelAddr(sentinelAddr *src) {
-    sentinelAddr *sa;
-
-    sa = zmalloc(sizeof(*sa));
-    sa->hostname = sdsnew(src->hostname);
-    sa->ip = sdsnew(src->ip);
-    sa->port = src->port;
-    return sa;
-}
-
-/* Free a Sentinel address. Can't fail. */
-void releaseSentinelAddr(sentinelAddr *sa) {
-    sdsfree(sa->hostname);
-    sdsfree(sa->ip);
-    zfree(sa);
-}
-
-/* Return non-zero if two addresses are equal. */
-int sentinelAddrIsEqual(sentinelAddr *a, sentinelAddr *b) {
-    return a->port == b->port && !strcasecmp(a->ip,b->ip);
-}
-
-/* Return non-zero if a hostname matches an address. */
-int sentinelAddrEqualsHostname(sentinelAddr *a, char *hostname) {
-    char ip[NET_IP_STR_LEN];
-
-    /* We always resolve the hostname and compare it to the address */
-    if (anetResolve(NULL, hostname, ip, sizeof(ip),
-                    sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR)
-        return 0;
-    return !strcasecmp(a->ip, ip);
-}
-
-const char *announceSentinelAddr(const sentinelAddr *a) {
-    return sentinel.announce_hostnames ? a->hostname : a->ip;
-}
-
-/* Return an allocated sds with hostname/address:port. IPv6
- * addresses are bracketed the same way anetFormatAddr() does.
- */
-sds announceSentinelAddrAndPort(const sentinelAddr *a) {
-    const char *addr = announceSentinelAddr(a);
-    if (strchr(addr, ':') != NULL)
-        return sdscatprintf(sdsempty(), "[%s]:%d", addr, a->port);
-    else
-        return sdscatprintf(sdsempty(), "%s:%d", addr, a->port);
-}
-
-/* =========================== Events notification ========================== */
-
-/* Send an event to log, pub/sub, user notification script.
- *
- * 'level' is the log level for logging. Only LL_WARNING events will trigger
- * the execution of the user notification script.
- *
- * 'type' is the message type, also used as a pub/sub channel name.
- *
- * 'ri', is the redis instance target of this event if applicable, and is
- * used to obtain the path of the notification script to execute.
- *
- * The remaining arguments are printf-alike.
- * If the format specifier starts with the two characters "%@" then ri is
- * not NULL, and the message is prefixed with an instance identifier in the
- * following format:
- *
- *  <instance type> <instance name> <ip> <port>
- *
- *  If the instance type is not master, than the additional string is
- *  added to specify the originating master:
- *
- *  @ <master name> <master ip> <master port>
- *
- *  Any other specifier after "%@" is processed by printf itself.
- */
-void sentinelEvent(int level, char *type, sentinelRedisInstance *ri,
-                   const char *fmt, ...) {
-    va_list ap;
-    char msg[LOG_MAX_LEN];
-    robj *channel, *payload;
-
-    /* Handle %@ */
-    if (fmt[0] == '%' && fmt[1] == '@') {
-        sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ?
-                                         NULL : ri->master;
-
-        if (master) {
-            snprintf(msg, sizeof(msg), "%s %s %s %d @ %s %s %d",
-                sentinelRedisInstanceTypeStr(ri),
-                ri->name, announceSentinelAddr(ri->addr), ri->addr->port,
-                master->name, announceSentinelAddr(master->addr), master->addr->port);
-        } else {
-            snprintf(msg, sizeof(msg), "%s %s %s %d",
-                sentinelRedisInstanceTypeStr(ri),
-                ri->name, announceSentinelAddr(ri->addr), ri->addr->port);
-        }
-        fmt += 2;
-    } else {
-        msg[0] = '\0';
-    }
-
-    /* Use vsprintf for the rest of the formatting if any. */
-    if (fmt[0] != '\0') {
-        va_start(ap, fmt);
-        vsnprintf(msg+strlen(msg), sizeof(msg)-strlen(msg), fmt, ap);
-        va_end(ap);
-    }
-
-    /* Log the message if the log level allows it to be logged. */
-    if (level >= server.verbosity)
-        serverLog(level,"%s %s",type,msg);
-
-    /* Publish the message via Pub/Sub if it's not a debugging one. */
-    if (level != LL_DEBUG) {
-        channel = createStringObject(type,strlen(type));
-        payload = createStringObject(msg,strlen(msg));
-        pubsubPublishMessage(channel,payload);
-        decrRefCount(channel);
-        decrRefCount(payload);
-    }
-
-    /* Call the notification script if applicable. */
-    if (level == LL_WARNING && ri != NULL) {
-        sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ?
-                                         ri : ri->master;
-        if (master && master->notification_script) {
-            sentinelScheduleScriptExecution(master->notification_script,
-                type,msg,NULL);
-        }
-    }
-}
-
-/* This function is called only at startup and is used to generate a
- * +monitor event for every configured master. The same events are also
- * generated when a master to monitor is added at runtime via the
- * SENTINEL MONITOR command. */
-void sentinelGenerateInitialMonitorEvents(void) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        sentinelEvent(LL_WARNING,"+monitor",ri,"%@ quorum %d",ri->quorum);
-    }
-    dictReleaseIterator(di);
-}
-
-/* ============================ script execution ============================ */
-
-/* Release a script job structure and all the associated data. */
-void sentinelReleaseScriptJob(sentinelScriptJob *sj) {
-    int j = 0;
-
-    while(sj->argv[j]) sdsfree(sj->argv[j++]);
-    zfree(sj->argv);
-    zfree(sj);
-}
-
-#define SENTINEL_SCRIPT_MAX_ARGS 16
-void sentinelScheduleScriptExecution(char *path, ...) {
-    va_list ap;
-    char *argv[SENTINEL_SCRIPT_MAX_ARGS+1];
-    int argc = 1;
-    sentinelScriptJob *sj;
-
-    va_start(ap, path);
-    while(argc < SENTINEL_SCRIPT_MAX_ARGS) {
-        argv[argc] = va_arg(ap,char*);
-        if (!argv[argc]) break;
-        argv[argc] = sdsnew(argv[argc]); /* Copy the string. */
-        argc++;
-    }
-    va_end(ap);
-    argv[0] = sdsnew(path);
-
-    sj = zmalloc(sizeof(*sj));
-    sj->flags = SENTINEL_SCRIPT_NONE;
-    sj->retry_num = 0;
-    sj->argv = zmalloc(sizeof(char*)*(argc+1));
-    sj->start_time = 0;
-    sj->pid = 0;
-    memcpy(sj->argv,argv,sizeof(char*)*(argc+1));
-
-    listAddNodeTail(sentinel.scripts_queue,sj);
-
-    /* Remove the oldest non running script if we already hit the limit. */
-    if (listLength(sentinel.scripts_queue) > SENTINEL_SCRIPT_MAX_QUEUE) {
-        listNode *ln;
-        listIter li;
-
-        listRewind(sentinel.scripts_queue,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            sj = ln->value;
-
-            if (sj->flags & SENTINEL_SCRIPT_RUNNING) continue;
-            /* The first node is the oldest as we add on tail. */
-            listDelNode(sentinel.scripts_queue,ln);
-            sentinelReleaseScriptJob(sj);
-            break;
-        }
-        serverAssert(listLength(sentinel.scripts_queue) <=
-                    SENTINEL_SCRIPT_MAX_QUEUE);
-    }
-}
-
-/* Lookup a script in the scripts queue via pid, and returns the list node
- * (so that we can easily remove it from the queue if needed). */
-listNode *sentinelGetScriptListNodeByPid(pid_t pid) {
-    listNode *ln;
-    listIter li;
-
-    listRewind(sentinel.scripts_queue,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        sentinelScriptJob *sj = ln->value;
-
-        if ((sj->flags & SENTINEL_SCRIPT_RUNNING) && sj->pid == pid)
-            return ln;
-    }
-    return NULL;
-}
-
-/* Run pending scripts if we are not already at max number of running
- * scripts. */
-void sentinelRunPendingScripts(void) {
-    listNode *ln;
-    listIter li;
-    mstime_t now = mstime();
-
-    /* Find jobs that are not running and run them, from the top to the
-     * tail of the queue, so we run older jobs first. */
-    listRewind(sentinel.scripts_queue,&li);
-    while (sentinel.running_scripts < SENTINEL_SCRIPT_MAX_RUNNING &&
-           (ln = listNext(&li)) != NULL)
-    {
-        sentinelScriptJob *sj = ln->value;
-        pid_t pid;
-
-        /* Skip if already running. */
-        if (sj->flags & SENTINEL_SCRIPT_RUNNING) continue;
-
-        /* Skip if it's a retry, but not enough time has elapsed. */
-        if (sj->start_time && sj->start_time > now) continue;
-
-        sj->flags |= SENTINEL_SCRIPT_RUNNING;
-        sj->start_time = mstime();
-        sj->retry_num++;
-        pid = fork();
-
-        if (pid == -1) {
-            /* Parent (fork error).
-             * We report fork errors as signal 99, in order to unify the
-             * reporting with other kind of errors. */
-            sentinelEvent(LL_WARNING,"-script-error",NULL,
-                          "%s %d %d", sj->argv[0], 99, 0);
-            sj->flags &= ~SENTINEL_SCRIPT_RUNNING;
-            sj->pid = 0;
-        } else if (pid == 0) {
-            /* Child */
-            tlsCleanup();
-            execve(sj->argv[0],sj->argv,environ);
-            /* If we are here an error occurred. */
-            _exit(2); /* Don't retry execution. */
-        } else {
-            sentinel.running_scripts++;
-            sj->pid = pid;
-            sentinelEvent(LL_DEBUG,"+script-child",NULL,"%ld",(long)pid);
-        }
-    }
-}
-
-/* How much to delay the execution of a script that we need to retry after
- * an error?
- *
- * We double the retry delay for every further retry we do. So for instance
- * if RETRY_DELAY is set to 30 seconds and the max number of retries is 10
- * starting from the second attempt to execute the script the delays are:
- * 30 sec, 60 sec, 2 min, 4 min, 8 min, 16 min, 32 min, 64 min, 128 min. */
-mstime_t sentinelScriptRetryDelay(int retry_num) {
-    mstime_t delay = SENTINEL_SCRIPT_RETRY_DELAY;
-
-    while (retry_num-- > 1) delay *= 2;
-    return delay;
-}
-
-/* Check for scripts that terminated, and remove them from the queue if the
- * script terminated successfully. If instead the script was terminated by
- * a signal, or returned exit code "1", it is scheduled to run again if
- * the max number of retries did not already elapsed. */
-void sentinelCollectTerminatedScripts(void) {
-    int statloc;
-    pid_t pid;
-
-    while ((pid = waitpid(-1, &statloc, WNOHANG)) > 0) {
-        int exitcode = WEXITSTATUS(statloc);
-        int bysignal = 0;
-        listNode *ln;
-        sentinelScriptJob *sj;
-
-        if (WIFSIGNALED(statloc)) bysignal = WTERMSIG(statloc);
-        sentinelEvent(LL_DEBUG,"-script-child",NULL,"%ld %d %d",
-            (long)pid, exitcode, bysignal);
-
-        ln = sentinelGetScriptListNodeByPid(pid);
-        if (ln == NULL) {
-            serverLog(LL_WARNING,"waitpid() returned a pid (%ld) we can't find in our scripts execution queue!", (long)pid);
-            continue;
-        }
-        sj = ln->value;
-
-        /* If the script was terminated by a signal or returns an
-         * exit code of "1" (that means: please retry), we reschedule it
-         * if the max number of retries is not already reached. */
-        if ((bysignal || exitcode == 1) &&
-            sj->retry_num != SENTINEL_SCRIPT_MAX_RETRY)
-        {
-            sj->flags &= ~SENTINEL_SCRIPT_RUNNING;
-            sj->pid = 0;
-            sj->start_time = mstime() +
-                             sentinelScriptRetryDelay(sj->retry_num);
-        } else {
-            /* Otherwise let's remove the script, but log the event if the
-             * execution did not terminated in the best of the ways. */
-            if (bysignal || exitcode != 0) {
-                sentinelEvent(LL_WARNING,"-script-error",NULL,
-                              "%s %d %d", sj->argv[0], bysignal, exitcode);
-            }
-            listDelNode(sentinel.scripts_queue,ln);
-            sentinelReleaseScriptJob(sj);
-        }
-        sentinel.running_scripts--;
-    }
-}
-
-/* Kill scripts in timeout, they'll be collected by the
- * sentinelCollectTerminatedScripts() function. */
-void sentinelKillTimedoutScripts(void) {
-    listNode *ln;
-    listIter li;
-    mstime_t now = mstime();
-
-    listRewind(sentinel.scripts_queue,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        sentinelScriptJob *sj = ln->value;
-
-        if (sj->flags & SENTINEL_SCRIPT_RUNNING &&
-            (now - sj->start_time) > SENTINEL_SCRIPT_MAX_RUNTIME)
-        {
-            sentinelEvent(LL_WARNING,"-script-timeout",NULL,"%s %ld",
-                sj->argv[0], (long)sj->pid);
-            kill(sj->pid,SIGKILL);
-        }
-    }
-}
-
-/* Implements SENTINEL PENDING-SCRIPTS command. */
-void sentinelPendingScriptsCommand(client *c) {
-    listNode *ln;
-    listIter li;
-
-    addReplyArrayLen(c,listLength(sentinel.scripts_queue));
-    listRewind(sentinel.scripts_queue,&li);
-    while ((ln = listNext(&li)) != NULL) {
-        sentinelScriptJob *sj = ln->value;
-        int j = 0;
-
-        addReplyMapLen(c,5);
-
-        addReplyBulkCString(c,"argv");
-        while (sj->argv[j]) j++;
-        addReplyArrayLen(c,j);
-        j = 0;
-        while (sj->argv[j]) addReplyBulkCString(c,sj->argv[j++]);
-
-        addReplyBulkCString(c,"flags");
-        addReplyBulkCString(c,
-            (sj->flags & SENTINEL_SCRIPT_RUNNING) ? "running" : "scheduled");
-
-        addReplyBulkCString(c,"pid");
-        addReplyBulkLongLong(c,sj->pid);
-
-        if (sj->flags & SENTINEL_SCRIPT_RUNNING) {
-            addReplyBulkCString(c,"run-time");
-            addReplyBulkLongLong(c,mstime() - sj->start_time);
-        } else {
-            mstime_t delay = sj->start_time ? (sj->start_time-mstime()) : 0;
-            if (delay < 0) delay = 0;
-            addReplyBulkCString(c,"run-delay");
-            addReplyBulkLongLong(c,delay);
-        }
-
-        addReplyBulkCString(c,"retry-num");
-        addReplyBulkLongLong(c,sj->retry_num);
-    }
-}
-
-/* This function calls, if any, the client reconfiguration script with the
- * following parameters:
- *
- * <master-name> <role> <state> <from-ip> <from-port> <to-ip> <to-port>
- *
- * It is called every time a failover is performed.
- *
- * <state> is currently always "failover".
- * <role> is either "leader" or "observer".
- *
- * from/to fields are respectively master -> promoted slave addresses for
- * "start" and "end". */
-void sentinelCallClientReconfScript(sentinelRedisInstance *master, int role, char *state, sentinelAddr *from, sentinelAddr *to) {
-    char fromport[32], toport[32];
-
-    if (master->client_reconfig_script == NULL) return;
-    ll2string(fromport,sizeof(fromport),from->port);
-    ll2string(toport,sizeof(toport),to->port);
-    sentinelScheduleScriptExecution(master->client_reconfig_script,
-        master->name,
-        (role == SENTINEL_LEADER) ? "leader" : "observer",
-        state, announceSentinelAddr(from), fromport,
-        announceSentinelAddr(to), toport, NULL);
-}
-
-/* =============================== instanceLink ============================= */
-
-/* Create a not yet connected link object. */
-instanceLink *createInstanceLink(void) {
-    instanceLink *link = zmalloc(sizeof(*link));
-
-    link->refcount = 1;
-    link->disconnected = 1;
-    link->pending_commands = 0;
-    link->cc = NULL;
-    link->pc = NULL;
-    link->cc_conn_time = 0;
-    link->pc_conn_time = 0;
-    link->last_reconn_time = 0;
-    link->pc_last_activity = 0;
-    /* We set the act_ping_time to "now" even if we actually don't have yet
-     * a connection with the node, nor we sent a ping.
-     * This is useful to detect a timeout in case we'll not be able to connect
-     * with the node at all. */
-    link->act_ping_time = mstime();
-    link->last_ping_time = 0;
-    link->last_avail_time = mstime();
-    link->last_pong_time = mstime();
-    return link;
-}
-
-/* Disconnect a hiredis connection in the context of an instance link. */
-void instanceLinkCloseConnection(instanceLink *link, redisAsyncContext *c) {
-    if (c == NULL) return;
-
-    if (link->cc == c) {
-        link->cc = NULL;
-        link->pending_commands = 0;
-    }
-    if (link->pc == c) link->pc = NULL;
-    c->data = NULL;
-    link->disconnected = 1;
-    redisAsyncFree(c);
-}
-
-/* Decrement the refcount of a link object, if it drops to zero, actually
- * free it and return NULL. Otherwise don't do anything and return the pointer
- * to the object.
- *
- * If we are not going to free the link and ri is not NULL, we rebind all the
- * pending requests in link->cc (hiredis connection for commands) to a
- * callback that will just ignore them. This is useful to avoid processing
- * replies for an instance that no longer exists. */
-instanceLink *releaseInstanceLink(instanceLink *link, sentinelRedisInstance *ri)
-{
-    serverAssert(link->refcount > 0);
-    link->refcount--;
-    if (link->refcount != 0) {
-        if (ri && ri->link->cc) {
-            /* This instance may have pending callbacks in the hiredis async
-             * context, having as 'privdata' the instance that we are going to
-             * free. Let's rewrite the callback list, directly exploiting
-             * hiredis internal data structures, in order to bind them with
-             * a callback that will ignore the reply at all. */
-            redisCallback *cb;
-            redisCallbackList *callbacks = &link->cc->replies;
-
-            cb = callbacks->head;
-            while(cb) {
-                if (cb->privdata == ri) {
-                    cb->fn = sentinelDiscardReplyCallback;
-                    cb->privdata = NULL; /* Not strictly needed. */
-                }
-                cb = cb->next;
-            }
-        }
-        return link; /* Other active users. */
-    }
-
-    instanceLinkCloseConnection(link,link->cc);
-    instanceLinkCloseConnection(link,link->pc);
-    zfree(link);
-    return NULL;
-}
-
-/* This function will attempt to share the instance link we already have
- * for the same Sentinel in the context of a different master, with the
- * instance we are passing as argument.
- *
- * This way multiple Sentinel objects that refer all to the same physical
- * Sentinel instance but in the context of different masters will use
- * a single connection, will send a single PING per second for failure
- * detection and so forth.
- *
- * Return C_OK if a matching Sentinel was found in the context of a
- * different master and sharing was performed. Otherwise C_ERR
- * is returned. */
-int sentinelTryConnectionSharing(sentinelRedisInstance *ri) {
-    serverAssert(ri->flags & SRI_SENTINEL);
-    dictIterator *di;
-    dictEntry *de;
-
-    if (ri->runid == NULL) return C_ERR; /* No way to identify it. */
-    if (ri->link->refcount > 1) return C_ERR; /* Already shared. */
-
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *master = dictGetVal(de), *match;
-        /* We want to share with the same physical Sentinel referenced
-         * in other masters, so skip our master. */
-        if (master == ri->master) continue;
-        match = getSentinelRedisInstanceByAddrAndRunID(master->sentinels,
-                                                       NULL,0,ri->runid);
-        if (match == NULL) continue; /* No match. */
-        if (match == ri) continue; /* Should never happen but... safer. */
-
-        /* We identified a matching Sentinel, great! Let's free our link
-         * and use the one of the matching Sentinel. */
-        releaseInstanceLink(ri->link,NULL);
-        ri->link = match->link;
-        match->link->refcount++;
-        dictReleaseIterator(di);
-        return C_OK;
-    }
-    dictReleaseIterator(di);
-    return C_ERR;
-}
-
-/* Drop all connections to other sentinels. Returns the number of connections
- * dropped.*/
-int sentinelDropConnections(void) {
-    dictIterator *di;
-    dictEntry *de;
-    int dropped = 0;
-
-    di = dictGetIterator(sentinel.masters);
-    while ((de = dictNext(di)) != NULL) {
-        dictIterator *sdi;
-        dictEntry *sde;
-
-        sentinelRedisInstance *ri = dictGetVal(de);
-        sdi = dictGetIterator(ri->sentinels);
-        while ((sde = dictNext(sdi)) != NULL) {
-            sentinelRedisInstance *si = dictGetVal(sde);
-            if (!si->link->disconnected) {
-                instanceLinkCloseConnection(si->link, si->link->pc);
-                instanceLinkCloseConnection(si->link, si->link->cc);
-                dropped++;
-            }
-        }
-        dictReleaseIterator(sdi);
-    }
-    dictReleaseIterator(di);
-
-    return dropped;
-}
-
-/* When we detect a Sentinel to switch address (reporting a different IP/port
- * pair in Hello messages), let's update all the matching Sentinels in the
- * context of other masters as well and disconnect the links, so that everybody
- * will be updated.
- *
- * Return the number of updated Sentinel addresses. */
-int sentinelUpdateSentinelAddressInAllMasters(sentinelRedisInstance *ri) {
-    serverAssert(ri->flags & SRI_SENTINEL);
-    dictIterator *di;
-    dictEntry *de;
-    int reconfigured = 0;
-
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *master = dictGetVal(de), *match;
-        match = getSentinelRedisInstanceByAddrAndRunID(master->sentinels,
-                                                       NULL,0,ri->runid);
-        /* If there is no match, this master does not know about this
-         * Sentinel, try with the next one. */
-        if (match == NULL) continue;
-
-        /* Disconnect the old links if connected. */
-        if (match->link->cc != NULL)
-            instanceLinkCloseConnection(match->link,match->link->cc);
-        if (match->link->pc != NULL)
-            instanceLinkCloseConnection(match->link,match->link->pc);
-
-        if (match == ri) continue; /* Address already updated for it. */
-
-        /* Update the address of the matching Sentinel by copying the address
-         * of the Sentinel object that received the address update. */
-        releaseSentinelAddr(match->addr);
-        match->addr = dupSentinelAddr(ri->addr);
-        reconfigured++;
-    }
-    dictReleaseIterator(di);
-    if (reconfigured)
-        sentinelEvent(LL_NOTICE,"+sentinel-address-update", ri,
-                    "%@ %d additional matching instances", reconfigured);
-    return reconfigured;
-}
-
-/* This function is called when a hiredis connection reported an error.
- * We set it to NULL and mark the link as disconnected so that it will be
- * reconnected again.
- *
- * Note: we don't free the hiredis context as hiredis will do it for us
- * for async connections. */
-void instanceLinkConnectionError(const redisAsyncContext *c) {
-    instanceLink *link = c->data;
-    int pubsub;
-
-    if (!link) return;
-
-    pubsub = (link->pc == c);
-    if (pubsub)
-        link->pc = NULL;
-    else
-        link->cc = NULL;
-    link->disconnected = 1;
-}
-
-/* Hiredis connection established / disconnected callbacks. We need them
- * just to cleanup our link state. */
-void sentinelLinkEstablishedCallback(const redisAsyncContext *c, int status) {
-    if (status != C_OK) instanceLinkConnectionError(c);
-}
-
-void sentinelDisconnectCallback(const redisAsyncContext *c, int status) {
-    UNUSED(status);
-    instanceLinkConnectionError(c);
-}
-
-/* ========================== sentinelRedisInstance ========================= */
-
-/* Create a redis instance, the following fields must be populated by the
- * caller if needed:
- * runid: set to NULL but will be populated once INFO output is received.
- * info_refresh: is set to 0 to mean that we never received INFO so far.
- *
- * If SRI_MASTER is set into initial flags the instance is added to
- * sentinel.masters table.
- *
- * if SRI_SLAVE or SRI_SENTINEL is set then 'master' must be not NULL and the
- * instance is added into master->slaves or master->sentinels table.
- *
- * If the instance is a slave or sentinel, the name parameter is ignored and
- * is created automatically as hostname:port.
- *
- * The function fails if hostname can't be resolved or port is out of range.
- * When this happens NULL is returned and errno is set accordingly to the
- * createSentinelAddr() function.
- *
- * The function may also fail and return NULL with errno set to EBUSY if
- * a master with the same name, a slave with the same address, or a sentinel
- * with the same ID already exists. */
-
-sentinelRedisInstance *createSentinelRedisInstance(char *name, int flags, char *hostname, int port, int quorum, sentinelRedisInstance *master) {
-    sentinelRedisInstance *ri;
-    sentinelAddr *addr;
-    dict *table = NULL;
-    sds sdsname;
-
-    serverAssert(flags & (SRI_MASTER|SRI_SLAVE|SRI_SENTINEL));
-    serverAssert((flags & SRI_MASTER) || master != NULL);
-
-    /* Check address validity. */
-    addr = createSentinelAddr(hostname,port);
-    if (addr == NULL) return NULL;
-
-    /* For slaves use ip/host:port as name. */
-    if (flags & SRI_SLAVE)
-        sdsname = announceSentinelAddrAndPort(addr);
-    else
-        sdsname = sdsnew(name);
-
-    /* Make sure the entry is not duplicated. This may happen when the same
-     * name for a master is used multiple times inside the configuration or
-     * if we try to add multiple times a slave or sentinel with same ip/port
-     * to a master. */
-    if (flags & SRI_MASTER) table = sentinel.masters;
-    else if (flags & SRI_SLAVE) table = master->slaves;
-    else if (flags & SRI_SENTINEL) table = master->sentinels;
-    if (dictFind(table,sdsname)) {
-        releaseSentinelAddr(addr);
-        sdsfree(sdsname);
-        errno = EBUSY;
-        return NULL;
-    }
-
-    /* Create the instance object. */
-    ri = zmalloc(sizeof(*ri));
-    /* Note that all the instances are started in the disconnected state,
-     * the event loop will take care of connecting them. */
-    ri->flags = flags;
-    ri->name = sdsname;
-    ri->runid = NULL;
-    ri->config_epoch = 0;
-    ri->addr = addr;
-    ri->link = createInstanceLink();
-    ri->last_pub_time = mstime();
-    ri->last_hello_time = mstime();
-    ri->last_master_down_reply_time = mstime();
-    ri->s_down_since_time = 0;
-    ri->o_down_since_time = 0;
-    ri->down_after_period = master ? master->down_after_period :
-                            SENTINEL_DEFAULT_DOWN_AFTER;
-    ri->master_link_down_time = 0;
-    ri->auth_pass = NULL;
-    ri->auth_user = NULL;
-    ri->slave_priority = SENTINEL_DEFAULT_SLAVE_PRIORITY;
-    ri->replica_announced = 1;
-    ri->slave_reconf_sent_time = 0;
-    ri->slave_master_host = NULL;
-    ri->slave_master_port = 0;
-    ri->slave_master_link_status = SENTINEL_MASTER_LINK_STATUS_DOWN;
-    ri->slave_repl_offset = 0;
-    ri->sentinels = dictCreate(&instancesDictType,NULL);
-    ri->quorum = quorum;
-    ri->parallel_syncs = SENTINEL_DEFAULT_PARALLEL_SYNCS;
-    ri->master = master;
-    ri->slaves = dictCreate(&instancesDictType,NULL);
-    ri->info_refresh = 0;
-    ri->renamed_commands = dictCreate(&renamedCommandsDictType,NULL);
-
-    /* Failover state. */
-    ri->leader = NULL;
-    ri->leader_epoch = 0;
-    ri->failover_epoch = 0;
-    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
-    ri->failover_state_change_time = 0;
-    ri->failover_start_time = 0;
-    ri->failover_timeout = SENTINEL_DEFAULT_FAILOVER_TIMEOUT;
-    ri->failover_delay_logged = 0;
-    ri->promoted_slave = NULL;
-    ri->notification_script = NULL;
-    ri->client_reconfig_script = NULL;
-    ri->info = NULL;
-
-    /* Role */
-    ri->role_reported = ri->flags & (SRI_MASTER|SRI_SLAVE);
-    ri->role_reported_time = mstime();
-    ri->slave_conf_change_time = mstime();
-
-    /* Add into the right table. */
-    dictAdd(table, ri->name, ri);
-    return ri;
-}
-
-/* Release this instance and all its slaves, sentinels, hiredis connections.
- * This function does not take care of unlinking the instance from the main
- * masters table (if it is a master) or from its master sentinels/slaves table
- * if it is a slave or sentinel. */
-void releaseSentinelRedisInstance(sentinelRedisInstance *ri) {
-    /* Release all its slaves or sentinels if any. */
-    dictRelease(ri->sentinels);
-    dictRelease(ri->slaves);
-
-    /* Disconnect the instance. */
-    releaseInstanceLink(ri->link,ri);
-
-    /* Free other resources. */
-    sdsfree(ri->name);
-    sdsfree(ri->runid);
-    sdsfree(ri->notification_script);
-    sdsfree(ri->client_reconfig_script);
-    sdsfree(ri->slave_master_host);
-    sdsfree(ri->leader);
-    sdsfree(ri->auth_pass);
-    sdsfree(ri->auth_user);
-    sdsfree(ri->info);
-    releaseSentinelAddr(ri->addr);
-    dictRelease(ri->renamed_commands);
-
-    /* Clear state into the master if needed. */
-    if ((ri->flags & SRI_SLAVE) && (ri->flags & SRI_PROMOTED) && ri->master)
-        ri->master->promoted_slave = NULL;
-
-    zfree(ri);
-}
-
-/* Lookup a slave in a master Redis instance, by ip and port. */
-sentinelRedisInstance *sentinelRedisInstanceLookupSlave(
-                sentinelRedisInstance *ri, char *slave_addr, int port)
-{
-    sds key;
-    sentinelRedisInstance *slave;
-    sentinelAddr *addr;
-
-    serverAssert(ri->flags & SRI_MASTER);
-
-    /* We need to handle a slave_addr that is potentially a hostname.
-     * If that is the case, depending on configuration we either resolve
-     * it and use the IP addres or fail.
-     */
-    addr = createSentinelAddr(slave_addr, port);
-    if (!addr) return NULL;
-    key = announceSentinelAddrAndPort(addr);
-    releaseSentinelAddr(addr);
-
-    slave = dictFetchValue(ri->slaves,key);
-    sdsfree(key);
-    return slave;
-}
-
-/* Return the name of the type of the instance as a string. */
-const char *sentinelRedisInstanceTypeStr(sentinelRedisInstance *ri) {
-    if (ri->flags & SRI_MASTER) return "master";
-    else if (ri->flags & SRI_SLAVE) return "slave";
-    else if (ri->flags & SRI_SENTINEL) return "sentinel";
-    else return "unknown";
-}
-
-/* This function remove the Sentinel with the specified ID from the
- * specified master.
- *
- * If "runid" is NULL the function returns ASAP.
- *
- * This function is useful because on Sentinels address switch, we want to
- * remove our old entry and add a new one for the same ID but with the new
- * address.
- *
- * The function returns 1 if the matching Sentinel was removed, otherwise
- * 0 if there was no Sentinel with this ID. */
-int removeMatchingSentinelFromMaster(sentinelRedisInstance *master, char *runid) {
-    dictIterator *di;
-    dictEntry *de;
-    int removed = 0;
-
-    if (runid == NULL) return 0;
-
-    di = dictGetSafeIterator(master->sentinels);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        if (ri->runid && strcmp(ri->runid,runid) == 0) {
-            dictDelete(master->sentinels,ri->name);
-            removed++;
-        }
-    }
-    dictReleaseIterator(di);
-    return removed;
-}
-
-/* Search an instance with the same runid, ip and port into a dictionary
- * of instances. Return NULL if not found, otherwise return the instance
- * pointer.
- *
- * runid or addr can be NULL. In such a case the search is performed only
- * by the non-NULL field. */
-sentinelRedisInstance *getSentinelRedisInstanceByAddrAndRunID(dict *instances, char *addr, int port, char *runid) {
-    dictIterator *di;
-    dictEntry *de;
-    sentinelRedisInstance *instance = NULL;
-    sentinelAddr *ri_addr = NULL;
-
-    serverAssert(addr || runid);   /* User must pass at least one search param. */
-    if (addr != NULL) {
-        /* Resolve addr, we use the IP as a key even if a hostname is used */
-        ri_addr = createSentinelAddr(addr, port);
-        if (!ri_addr) return NULL;
-    }
-    di = dictGetIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        if (runid && !ri->runid) continue;
-        if ((runid == NULL || strcmp(ri->runid, runid) == 0) &&
-            (addr == NULL || (strcmp(ri->addr->ip, ri_addr->ip) == 0 &&
-                            ri->addr->port == port)))
-        {
-            instance = ri;
-            break;
-        }
-    }
-    dictReleaseIterator(di);
-    if (ri_addr != NULL)
-        releaseSentinelAddr(ri_addr);
-
-    return instance;
-}
-
-/* Master lookup by name */
-sentinelRedisInstance *sentinelGetMasterByName(char *name) {
-    sentinelRedisInstance *ri;
-    sds sdsname = sdsnew(name);
-
-    ri = dictFetchValue(sentinel.masters,sdsname);
-    sdsfree(sdsname);
-    return ri;
-}
-
-/* Add the specified flags to all the instances in the specified dictionary. */
-void sentinelAddFlagsToDictOfRedisInstances(dict *instances, int flags) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        ri->flags |= flags;
-    }
-    dictReleaseIterator(di);
-}
-
-/* Remove the specified flags to all the instances in the specified
- * dictionary. */
-void sentinelDelFlagsToDictOfRedisInstances(dict *instances, int flags) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        ri->flags &= ~flags;
-    }
-    dictReleaseIterator(di);
-}
-
-/* Reset the state of a monitored master:
- * 1) Remove all slaves.
- * 2) Remove all sentinels.
- * 3) Remove most of the flags resulting from runtime operations.
- * 4) Reset timers to their default value. For example after a reset it will be
- *    possible to failover again the same master ASAP, without waiting the
- *    failover timeout delay.
- * 5) In the process of doing this undo the failover if in progress.
- * 6) Disconnect the connections with the master (will reconnect automatically).
- */
-
-#define SENTINEL_RESET_NO_SENTINELS (1<<0)
-void sentinelResetMaster(sentinelRedisInstance *ri, int flags) {
-    serverAssert(ri->flags & SRI_MASTER);
-    dictRelease(ri->slaves);
-    ri->slaves = dictCreate(&instancesDictType,NULL);
-    if (!(flags & SENTINEL_RESET_NO_SENTINELS)) {
-        dictRelease(ri->sentinels);
-        ri->sentinels = dictCreate(&instancesDictType,NULL);
-    }
-    instanceLinkCloseConnection(ri->link,ri->link->cc);
-    instanceLinkCloseConnection(ri->link,ri->link->pc);
-    ri->flags &= SRI_MASTER;
-    if (ri->leader) {
-        sdsfree(ri->leader);
-        ri->leader = NULL;
-    }
-    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
-    ri->failover_state_change_time = 0;
-    ri->failover_start_time = 0; /* We can failover again ASAP. */
-    ri->promoted_slave = NULL;
-    sdsfree(ri->runid);
-    sdsfree(ri->slave_master_host);
-    ri->runid = NULL;
-    ri->slave_master_host = NULL;
-    ri->link->act_ping_time = mstime();
-    ri->link->last_ping_time = 0;
-    ri->link->last_avail_time = mstime();
-    ri->link->last_pong_time = mstime();
-    ri->role_reported_time = mstime();
-    ri->role_reported = SRI_MASTER;
-    if (flags & SENTINEL_GENERATE_EVENT)
-        sentinelEvent(LL_WARNING,"+reset-master",ri,"%@");
-}
-
-/* Call sentinelResetMaster() on every master with a name matching the specified
- * pattern. */
-int sentinelResetMastersByPattern(char *pattern, int flags) {
-    dictIterator *di;
-    dictEntry *de;
-    int reset = 0;
-
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        if (ri->name) {
-            if (stringmatch(pattern,ri->name,0)) {
-                sentinelResetMaster(ri,flags);
-                reset++;
-            }
-        }
-    }
-    dictReleaseIterator(di);
-    return reset;
-}
-
-/* Reset the specified master with sentinelResetMaster(), and also change
- * the ip:port address, but take the name of the instance unmodified.
- *
- * This is used to handle the +switch-master event.
- *
- * The function returns C_ERR if the address can't be resolved for some
- * reason. Otherwise C_OK is returned.  */
-int sentinelResetMasterAndChangeAddress(sentinelRedisInstance *master, char *hostname, int port) {
-    sentinelAddr *oldaddr, *newaddr;
-    sentinelAddr **slaves = NULL;
-    int numslaves = 0, j;
-    dictIterator *di;
-    dictEntry *de;
-
-    newaddr = createSentinelAddr(hostname,port);
-    if (newaddr == NULL) return C_ERR;
-
-    /* There can be only 0 or 1 slave that has the newaddr.
-     * and It can add old master 1 more slave. 
-     * so It allocates dictSize(master->slaves) + 1          */
-    slaves = zmalloc(sizeof(sentinelAddr*)*(dictSize(master->slaves) + 1));
-    
-    /* Don't include the one having the address we are switching to. */
-    di = dictGetIterator(master->slaves);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *slave = dictGetVal(de);
-
-        if (sentinelAddrIsEqual(slave->addr,newaddr)) continue;
-        slaves[numslaves++] = dupSentinelAddr(slave->addr);
-    }
-    dictReleaseIterator(di);
-
-    /* If we are switching to a different address, include the old address
-     * as a slave as well, so that we'll be able to sense / reconfigure
-     * the old master. */
-    if (!sentinelAddrIsEqual(newaddr,master->addr)) {
-        slaves[numslaves++] = dupSentinelAddr(master->addr);
-    }
-
-    /* Reset and switch address. */
-    sentinelResetMaster(master,SENTINEL_RESET_NO_SENTINELS);
-    oldaddr = master->addr;
-    master->addr = newaddr;
-    master->o_down_since_time = 0;
-    master->s_down_since_time = 0;
-
-    /* Add slaves back. */
-    for (j = 0; j < numslaves; j++) {
-        sentinelRedisInstance *slave;
-
-        slave = createSentinelRedisInstance(NULL,SRI_SLAVE,slaves[j]->hostname,
-                    slaves[j]->port, master->quorum, master);
-        releaseSentinelAddr(slaves[j]);
-        if (slave) sentinelEvent(LL_NOTICE,"+slave",slave,"%@");
-    }
-    zfree(slaves);
-
-    /* Release the old address at the end so we are safe even if the function
-     * gets the master->addr->ip and master->addr->port as arguments. */
-    releaseSentinelAddr(oldaddr);
-    sentinelFlushConfig();
-    return C_OK;
-}
-
-/* Return non-zero if there was no SDOWN or ODOWN error associated to this
- * instance in the latest 'ms' milliseconds. */
-int sentinelRedisInstanceNoDownFor(sentinelRedisInstance *ri, mstime_t ms) {
-    mstime_t most_recent;
-
-    most_recent = ri->s_down_since_time;
-    if (ri->o_down_since_time > most_recent)
-        most_recent = ri->o_down_since_time;
-    return most_recent == 0 || (mstime() - most_recent) > ms;
-}
-
-/* Return the current master address, that is, its address or the address
- * of the promoted slave if already operational. */
-sentinelAddr *sentinelGetCurrentMasterAddress(sentinelRedisInstance *master) {
-    /* If we are failing over the master, and the state is already
-     * SENTINEL_FAILOVER_STATE_RECONF_SLAVES or greater, it means that we
-     * already have the new configuration epoch in the master, and the
-     * slave acknowledged the configuration switch. Advertise the new
-     * address. */
-    if ((master->flags & SRI_FAILOVER_IN_PROGRESS) &&
-        master->promoted_slave &&
-        master->failover_state >= SENTINEL_FAILOVER_STATE_RECONF_SLAVES)
-    {
-        return master->promoted_slave->addr;
-    } else {
-        return master->addr;
-    }
-}
-
-/* This function sets the down_after_period field value in 'master' to all
- * the slaves and sentinel instances connected to this master. */
-void sentinelPropagateDownAfterPeriod(sentinelRedisInstance *master) {
-    dictIterator *di;
-    dictEntry *de;
-    int j;
-    dict *d[] = {master->slaves, master->sentinels, NULL};
-
-    for (j = 0; d[j]; j++) {
-        di = dictGetIterator(d[j]);
-        while((de = dictNext(di)) != NULL) {
-            sentinelRedisInstance *ri = dictGetVal(de);
-            ri->down_after_period = master->down_after_period;
-        }
-        dictReleaseIterator(di);
-    }
-}
-
-/* This function is used in order to send commands to Redis instances: the
- * commands we send from Sentinel may be renamed, a common case is a master
- * with CONFIG and SLAVEOF commands renamed for security concerns. In that
- * case we check the ri->renamed_command table (or if the instance is a slave,
- * we check the one of the master), and map the command that we should send
- * to the set of renamed commands. However, if the command was not renamed,
- * we just return "command" itself. */
-char *sentinelInstanceMapCommand(sentinelRedisInstance *ri, char *command) {
-    sds sc = sdsnew(command);
-    if (ri->master) ri = ri->master;
-    char *retval = dictFetchValue(ri->renamed_commands, sc);
-    sdsfree(sc);
-    return retval ? retval : command;
-}
-
-/* ============================ Config handling ============================= */
-
-/* Generalise handling create instance error. Use SRI_MASTER, SRI_SLAVE or
- * SRI_SENTINEL as a role value. */
-const char *sentinelCheckCreateInstanceErrors(int role) {
-    switch(errno) {
-    case EBUSY:
-        switch (role) {
-        case SRI_MASTER:
-            return "Duplicate master name.";
-        case SRI_SLAVE:
-            return "Duplicate hostname and port for replica.";
-        case SRI_SENTINEL:
-            return "Duplicate runid for sentinel.";
-        default:
-            serverAssert(0);
-            break;
-        }
-        break;
-    case ENOENT:
-        return "Can't resolve instance hostname.";
-    case EINVAL:
-        return "Invalid port number.";
-    default:
-        return "Unknown Error for creating instances.";
-    }
-}
-
-/* init function for server.sentinel_config */
-void initializeSentinelConfig() {
-    server.sentinel_config = zmalloc(sizeof(struct sentinelConfig));
-    server.sentinel_config->monitor_cfg = listCreate();
-    server.sentinel_config->pre_monitor_cfg = listCreate();
-    server.sentinel_config->post_monitor_cfg = listCreate();
-    listSetFreeMethod(server.sentinel_config->monitor_cfg,freeSentinelLoadQueueEntry);
-    listSetFreeMethod(server.sentinel_config->pre_monitor_cfg,freeSentinelLoadQueueEntry);
-    listSetFreeMethod(server.sentinel_config->post_monitor_cfg,freeSentinelLoadQueueEntry);
-}
-
-/* destroy function for server.sentinel_config */
-void freeSentinelConfig() {
-    /* release these three config queues since we will not use it anymore */
-    listRelease(server.sentinel_config->pre_monitor_cfg);
-    listRelease(server.sentinel_config->monitor_cfg);
-    listRelease(server.sentinel_config->post_monitor_cfg);
-    zfree(server.sentinel_config);
-    server.sentinel_config = NULL;
-}
-
-/* Search config name in pre monitor config name array, return 1 if found,
- * 0 if not found. */
-int searchPreMonitorCfgName(const char *name) {
-    for (unsigned int i = 0; i < sizeof(preMonitorCfgName)/sizeof(preMonitorCfgName[0]); i++) {
-        if (!strcasecmp(preMonitorCfgName[i],name)) return 1;
-    }
-    return 0;
-}
-
-/* free method for sentinelLoadQueueEntry when release the list */
-void freeSentinelLoadQueueEntry(void *item) {
-    struct sentinelLoadQueueEntry *entry = item;
-    sdsfreesplitres(entry->argv,entry->argc);
-    sdsfree(entry->line);
-    zfree(entry);
-}
-
-/* This function is used for queuing sentinel configuration, the main
- * purpose of this function is to delay parsing the sentinel config option
- * in order to avoid the order dependent issue from the config. */
-void queueSentinelConfig(sds *argv, int argc, int linenum, sds line) {
-    int i;
-    struct sentinelLoadQueueEntry *entry;
-
-    /* initialize sentinel_config for the first call */
-    if (server.sentinel_config == NULL) initializeSentinelConfig();
-
-    entry = zmalloc(sizeof(struct sentinelLoadQueueEntry));
-    entry->argv = zmalloc(sizeof(char*)*argc);
-    entry->argc = argc;
-    entry->linenum = linenum;
-    entry->line = sdsdup(line);
-    for (i = 0; i < argc; i++) {
-        entry->argv[i] = sdsdup(argv[i]);
-    }
-    /*  Separate config lines with pre monitor config, monitor config and
-     *  post monitor config, in order to parsing config dependencies
-     *  correctly. */
-    if (!strcasecmp(argv[0],"monitor")) {
-        listAddNodeTail(server.sentinel_config->monitor_cfg,entry);
-    } else if (searchPreMonitorCfgName(argv[0])) {
-        listAddNodeTail(server.sentinel_config->pre_monitor_cfg,entry);
-    } else{
-        listAddNodeTail(server.sentinel_config->post_monitor_cfg,entry);
-    }
-}
-
-/* This function is used for loading the sentinel configuration from
- * pre_monitor_cfg, monitor_cfg and post_monitor_cfg list */
-void loadSentinelConfigFromQueue(void) {
-    const char *err = NULL;
-    listIter li;
-    listNode *ln;
-    int linenum = 0;
-    sds line = NULL;
-
-    /* if there is no sentinel_config entry, we can return immediately */
-    if (server.sentinel_config == NULL) return;
-
-    /* loading from pre monitor config queue first to avoid dependency issues */
-    listRewind(server.sentinel_config->pre_monitor_cfg,&li);
-    while((ln = listNext(&li))) {
-        struct sentinelLoadQueueEntry *entry = ln->value;
-        err = sentinelHandleConfiguration(entry->argv,entry->argc);
-        if (err) {
-            linenum = entry->linenum;
-            line = entry->line;
-            goto loaderr;
-        }
-    }
-
-    /* loading from monitor config queue */
-    listRewind(server.sentinel_config->monitor_cfg,&li);
-    while((ln = listNext(&li))) {
-        struct sentinelLoadQueueEntry *entry = ln->value;
-        err = sentinelHandleConfiguration(entry->argv,entry->argc);
-        if (err) {
-            linenum = entry->linenum;
-            line = entry->line;
-            goto loaderr;
-        }
-    }
-
-    /* loading from the post monitor config queue */
-    listRewind(server.sentinel_config->post_monitor_cfg,&li);
-    while((ln = listNext(&li))) {
-        struct sentinelLoadQueueEntry *entry = ln->value;
-        err = sentinelHandleConfiguration(entry->argv,entry->argc);
-        if (err) {
-            linenum = entry->linenum;
-            line = entry->line;
-            goto loaderr;
-        }
-    }
-
-    /* free sentinel_config when config loading is finished */
-    freeSentinelConfig();
-    return;
-
-loaderr:
-    fprintf(stderr, "\n*** FATAL CONFIG FILE ERROR (Redis %s) ***\n",
-        REDIS_VERSION);
-    fprintf(stderr, "Reading the configuration file, at line %d\n", linenum);
-    fprintf(stderr, ">>> '%s'\n", line);
-    fprintf(stderr, "%s\n", err);
-    exit(1);
-}
-
-const char *sentinelHandleConfiguration(char **argv, int argc) {
-
-    sentinelRedisInstance *ri;
-
-    if (!strcasecmp(argv[0],"monitor") && argc == 5) {
-        /* monitor <name> <host> <port> <quorum> */
-        int quorum = atoi(argv[4]);
-
-        if (quorum <= 0) return "Quorum must be 1 or greater.";
-        if (createSentinelRedisInstance(argv[1],SRI_MASTER,argv[2],
-                                        atoi(argv[3]),quorum,NULL) == NULL)
-        {
-            return sentinelCheckCreateInstanceErrors(SRI_MASTER);
-        }
-    } else if (!strcasecmp(argv[0],"down-after-milliseconds") && argc == 3) {
-        /* down-after-milliseconds <name> <milliseconds> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->down_after_period = atoi(argv[2]);
-        if (ri->down_after_period <= 0)
-            return "negative or zero time parameter.";
-        sentinelPropagateDownAfterPeriod(ri);
-    } else if (!strcasecmp(argv[0],"failover-timeout") && argc == 3) {
-        /* failover-timeout <name> <milliseconds> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->failover_timeout = atoi(argv[2]);
-        if (ri->failover_timeout <= 0)
-            return "negative or zero time parameter.";
-    } else if (!strcasecmp(argv[0],"parallel-syncs") && argc == 3) {
-        /* parallel-syncs <name> <milliseconds> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->parallel_syncs = atoi(argv[2]);
-    } else if (!strcasecmp(argv[0],"notification-script") && argc == 3) {
-        /* notification-script <name> <path> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        if (access(argv[2],X_OK) == -1)
-            return "Notification script seems non existing or non executable.";
-        ri->notification_script = sdsnew(argv[2]);
-    } else if (!strcasecmp(argv[0],"client-reconfig-script") && argc == 3) {
-        /* client-reconfig-script <name> <path> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        if (access(argv[2],X_OK) == -1)
-            return "Client reconfiguration script seems non existing or "
-                   "non executable.";
-        ri->client_reconfig_script = sdsnew(argv[2]);
-    } else if (!strcasecmp(argv[0],"auth-pass") && argc == 3) {
-        /* auth-pass <name> <password> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->auth_pass = sdsnew(argv[2]);
-    } else if (!strcasecmp(argv[0],"auth-user") && argc == 3) {
-        /* auth-user <name> <username> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->auth_user = sdsnew(argv[2]);
-    } else if (!strcasecmp(argv[0],"current-epoch") && argc == 2) {
-        /* current-epoch <epoch> */
-        unsigned long long current_epoch = strtoull(argv[1],NULL,10);
-        if (current_epoch > sentinel.current_epoch)
-            sentinel.current_epoch = current_epoch;
-    } else if (!strcasecmp(argv[0],"myid") && argc == 2) {
-        if (strlen(argv[1]) != CONFIG_RUN_ID_SIZE)
-            return "Malformed Sentinel id in myid option.";
-        memcpy(sentinel.myid,argv[1],CONFIG_RUN_ID_SIZE);
-    } else if (!strcasecmp(argv[0],"config-epoch") && argc == 3) {
-        /* config-epoch <name> <epoch> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->config_epoch = strtoull(argv[2],NULL,10);
-        /* The following update of current_epoch is not really useful as
-         * now the current epoch is persisted on the config file, but
-         * we leave this check here for redundancy. */
-        if (ri->config_epoch > sentinel.current_epoch)
-            sentinel.current_epoch = ri->config_epoch;
-    } else if (!strcasecmp(argv[0],"leader-epoch") && argc == 3) {
-        /* leader-epoch <name> <epoch> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        ri->leader_epoch = strtoull(argv[2],NULL,10);
-    } else if ((!strcasecmp(argv[0],"known-slave") ||
-                !strcasecmp(argv[0],"known-replica")) && argc == 4)
-    {
-        sentinelRedisInstance *slave;
-
-        /* known-replica <name> <ip> <port> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        if ((slave = createSentinelRedisInstance(NULL,SRI_SLAVE,argv[2],
-                    atoi(argv[3]), ri->quorum, ri)) == NULL)
-        {
-            return sentinelCheckCreateInstanceErrors(SRI_SLAVE);
-        }
-    } else if (!strcasecmp(argv[0],"known-sentinel") &&
-               (argc == 4 || argc == 5)) {
-        sentinelRedisInstance *si;
-
-        if (argc == 5) { /* Ignore the old form without runid. */
-            /* known-sentinel <name> <ip> <port> [runid] */
-            ri = sentinelGetMasterByName(argv[1]);
-            if (!ri) return "No such master with specified name.";
-            if ((si = createSentinelRedisInstance(argv[4],SRI_SENTINEL,argv[2],
-                        atoi(argv[3]), ri->quorum, ri)) == NULL)
-            {
-                return sentinelCheckCreateInstanceErrors(SRI_SENTINEL);
-            }
-            si->runid = sdsnew(argv[4]);
-            sentinelTryConnectionSharing(si);
-        }
-    } else if (!strcasecmp(argv[0],"rename-command") && argc == 4) {
-        /* rename-command <name> <command> <renamed-command> */
-        ri = sentinelGetMasterByName(argv[1]);
-        if (!ri) return "No such master with specified name.";
-        sds oldcmd = sdsnew(argv[2]);
-        sds newcmd = sdsnew(argv[3]);
-        if (dictAdd(ri->renamed_commands,oldcmd,newcmd) != DICT_OK) {
-            sdsfree(oldcmd);
-            sdsfree(newcmd);
-            return "Same command renamed multiple times with rename-command.";
-        }
-    } else if (!strcasecmp(argv[0],"announce-ip") && argc == 2) {
-        /* announce-ip <ip-address> */
-        if (strlen(argv[1]))
-            sentinel.announce_ip = sdsnew(argv[1]);
-    } else if (!strcasecmp(argv[0],"announce-port") && argc == 2) {
-        /* announce-port <port> */
-        sentinel.announce_port = atoi(argv[1]);
-    } else if (!strcasecmp(argv[0],"deny-scripts-reconfig") && argc == 2) {
-        /* deny-scripts-reconfig <yes|no> */
-        if ((sentinel.deny_scripts_reconfig = yesnotoi(argv[1])) == -1) {
-            return "Please specify yes or no for the "
-                   "deny-scripts-reconfig options.";
-        }
-    } else if (!strcasecmp(argv[0],"sentinel-user") && argc == 2) {
-        /* sentinel-user <user-name> */
-        if (strlen(argv[1]))
-            sentinel.sentinel_auth_user = sdsnew(argv[1]);
-    } else if (!strcasecmp(argv[0],"sentinel-pass") && argc == 2) {
-        /* sentinel-pass <password> */
-        if (strlen(argv[1]))
-            sentinel.sentinel_auth_pass = sdsnew(argv[1]);
-    } else if (!strcasecmp(argv[0],"resolve-hostnames") && argc == 2) {
-        /* resolve-hostnames <yes|no> */
-        if ((sentinel.resolve_hostnames = yesnotoi(argv[1])) == -1) {
-            return "Please specify yes or no for the resolve-hostnames option.";
-        }
-    } else if (!strcasecmp(argv[0],"announce-hostnames") && argc == 2) {
-        /* announce-hostnames <yes|no> */
-        if ((sentinel.announce_hostnames = yesnotoi(argv[1])) == -1) {
-            return "Please specify yes or no for the announce-hostnames option.";
-        }
-    } else {
-        return "Unrecognized sentinel configuration statement.";
-    }
-    return NULL;
-}
-
-/* Implements CONFIG REWRITE for "sentinel" option.
- * This is used not just to rewrite the configuration given by the user
- * (the configured masters) but also in order to retain the state of
- * Sentinel across restarts: config epoch of masters, associated slaves
- * and sentinel instances, and so forth. */
-void rewriteConfigSentinelOption(struct rewriteConfigState *state) {
-    dictIterator *di, *di2;
-    dictEntry *de;
-    sds line;
-
-    /* sentinel unique ID. */
-    line = sdscatprintf(sdsempty(), "sentinel myid %s", sentinel.myid);
-    rewriteConfigRewriteLine(state,"sentinel myid",line,1);
-
-    /* sentinel deny-scripts-reconfig. */
-    line = sdscatprintf(sdsempty(), "sentinel deny-scripts-reconfig %s",
-        sentinel.deny_scripts_reconfig ? "yes" : "no");
-    rewriteConfigRewriteLine(state,"sentinel deny-scripts-reconfig",line,
-        sentinel.deny_scripts_reconfig != SENTINEL_DEFAULT_DENY_SCRIPTS_RECONFIG);
-
-    /* sentinel resolve-hostnames.
-     * This must be included early in the file so it is already in effect
-     * when reading the file.
-     */
-    line = sdscatprintf(sdsempty(), "sentinel resolve-hostnames %s",
-                        sentinel.resolve_hostnames ? "yes" : "no");
-    rewriteConfigRewriteLine(state,"sentinel resolve-hostnames",line,
-                             sentinel.resolve_hostnames != SENTINEL_DEFAULT_RESOLVE_HOSTNAMES);
-
-    /* sentinel announce-hostnames. */
-    line = sdscatprintf(sdsempty(), "sentinel announce-hostnames %s",
-                        sentinel.announce_hostnames ? "yes" : "no");
-    rewriteConfigRewriteLine(state,"sentinel announce-hostnames",line,
-                             sentinel.announce_hostnames != SENTINEL_DEFAULT_ANNOUNCE_HOSTNAMES);
-
-    /* For every master emit a "sentinel monitor" config entry. */
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *master, *ri;
-        sentinelAddr *master_addr;
-
-        /* sentinel monitor */
-        master = dictGetVal(de);
-        master_addr = sentinelGetCurrentMasterAddress(master);
-        line = sdscatprintf(sdsempty(),"sentinel monitor %s %s %d %d",
-            master->name, announceSentinelAddr(master_addr), master_addr->port,
-            master->quorum);
-        rewriteConfigRewriteLine(state,"sentinel monitor",line,1);
-        /* rewriteConfigMarkAsProcessed is handled after the loop */
-
-        /* sentinel down-after-milliseconds */
-        if (master->down_after_period != SENTINEL_DEFAULT_DOWN_AFTER) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel down-after-milliseconds %s %ld",
-                master->name, (long) master->down_after_period);
-            rewriteConfigRewriteLine(state,"sentinel down-after-milliseconds",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        /* sentinel failover-timeout */
-        if (master->failover_timeout != SENTINEL_DEFAULT_FAILOVER_TIMEOUT) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel failover-timeout %s %ld",
-                master->name, (long) master->failover_timeout);
-            rewriteConfigRewriteLine(state,"sentinel failover-timeout",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-
-        }
-
-        /* sentinel parallel-syncs */
-        if (master->parallel_syncs != SENTINEL_DEFAULT_PARALLEL_SYNCS) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel parallel-syncs %s %d",
-                master->name, master->parallel_syncs);
-            rewriteConfigRewriteLine(state,"sentinel parallel-syncs",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        /* sentinel notification-script */
-        if (master->notification_script) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel notification-script %s %s",
-                master->name, master->notification_script);
-            rewriteConfigRewriteLine(state,"sentinel notification-script",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        /* sentinel client-reconfig-script */
-        if (master->client_reconfig_script) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel client-reconfig-script %s %s",
-                master->name, master->client_reconfig_script);
-            rewriteConfigRewriteLine(state,"sentinel client-reconfig-script",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        /* sentinel auth-pass & auth-user */
-        if (master->auth_pass) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel auth-pass %s %s",
-                master->name, master->auth_pass);
-            rewriteConfigRewriteLine(state,"sentinel auth-pass",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        if (master->auth_user) {
-            line = sdscatprintf(sdsempty(),
-                "sentinel auth-user %s %s",
-                master->name, master->auth_user);
-            rewriteConfigRewriteLine(state,"sentinel auth-user",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-
-        /* sentinel config-epoch */
-        line = sdscatprintf(sdsempty(),
-            "sentinel config-epoch %s %llu",
-            master->name, (unsigned long long) master->config_epoch);
-        rewriteConfigRewriteLine(state,"sentinel config-epoch",line,1);
-        /* rewriteConfigMarkAsProcessed is handled after the loop */
-
-
-        /* sentinel leader-epoch */
-        line = sdscatprintf(sdsempty(),
-            "sentinel leader-epoch %s %llu",
-            master->name, (unsigned long long) master->leader_epoch);
-        rewriteConfigRewriteLine(state,"sentinel leader-epoch",line,1);
-        /* rewriteConfigMarkAsProcessed is handled after the loop */
-
-        /* sentinel known-slave */
-        di2 = dictGetIterator(master->slaves);
-        while((de = dictNext(di2)) != NULL) {
-            sentinelAddr *slave_addr;
-
-            ri = dictGetVal(de);
-            slave_addr = ri->addr;
-
-            /* If master_addr (obtained using sentinelGetCurrentMasterAddress()
-             * so it may be the address of the promoted slave) is equal to this
-             * slave's address, a failover is in progress and the slave was
-             * already successfully promoted. So as the address of this slave
-             * we use the old master address instead. */
-            if (sentinelAddrIsEqual(slave_addr,master_addr))
-                slave_addr = master->addr;
-            line = sdscatprintf(sdsempty(),
-                "sentinel known-replica %s %s %d",
-                master->name, announceSentinelAddr(slave_addr), slave_addr->port);
-            rewriteConfigRewriteLine(state,"sentinel known-replica",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-        dictReleaseIterator(di2);
-
-        /* sentinel known-sentinel */
-        di2 = dictGetIterator(master->sentinels);
-        while((de = dictNext(di2)) != NULL) {
-            ri = dictGetVal(de);
-            if (ri->runid == NULL) continue;
-            line = sdscatprintf(sdsempty(),
-                "sentinel known-sentinel %s %s %d %s",
-                master->name, announceSentinelAddr(ri->addr), ri->addr->port, ri->runid);
-            rewriteConfigRewriteLine(state,"sentinel known-sentinel",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-        dictReleaseIterator(di2);
-
-        /* sentinel rename-command */
-        di2 = dictGetIterator(master->renamed_commands);
-        while((de = dictNext(di2)) != NULL) {
-            sds oldname = dictGetKey(de);
-            sds newname = dictGetVal(de);
-            line = sdscatprintf(sdsempty(),
-                "sentinel rename-command %s %s %s",
-                master->name, oldname, newname);
-            rewriteConfigRewriteLine(state,"sentinel rename-command",line,1);
-            /* rewriteConfigMarkAsProcessed is handled after the loop */
-        }
-        dictReleaseIterator(di2);
-    }
-
-    /* sentinel current-epoch is a global state valid for all the masters. */
-    line = sdscatprintf(sdsempty(),
-        "sentinel current-epoch %llu", (unsigned long long) sentinel.current_epoch);
-    rewriteConfigRewriteLine(state,"sentinel current-epoch",line,1);
-
-    /* sentinel announce-ip. */
-    if (sentinel.announce_ip) {
-        line = sdsnew("sentinel announce-ip ");
-        line = sdscatrepr(line, sentinel.announce_ip, sdslen(sentinel.announce_ip));
-        rewriteConfigRewriteLine(state,"sentinel announce-ip",line,1);
-    } else {
-        rewriteConfigMarkAsProcessed(state,"sentinel announce-ip");
-    }
-
-    /* sentinel announce-port. */
-    if (sentinel.announce_port) {
-        line = sdscatprintf(sdsempty(),"sentinel announce-port %d",
-                            sentinel.announce_port);
-        rewriteConfigRewriteLine(state,"sentinel announce-port",line,1);
-    } else {
-        rewriteConfigMarkAsProcessed(state,"sentinel announce-port");
-    }
-
-    /* sentinel sentinel-user. */
-    if (sentinel.sentinel_auth_user) {
-        line = sdscatprintf(sdsempty(), "sentinel sentinel-user %s", sentinel.sentinel_auth_user);
-        rewriteConfigRewriteLine(state,"sentinel sentinel-user",line,1);
-    } else {
-        rewriteConfigMarkAsProcessed(state,"sentinel sentinel-user");
-    }
-
-    /* sentinel sentinel-pass. */
-    if (sentinel.sentinel_auth_pass) {
-        line = sdscatprintf(sdsempty(), "sentinel sentinel-pass %s", sentinel.sentinel_auth_pass);
-        rewriteConfigRewriteLine(state,"sentinel sentinel-pass",line,1);
-    } else {
-        rewriteConfigMarkAsProcessed(state,"sentinel sentinel-pass");  
-    }
-
-    dictReleaseIterator(di);
-
-    /* NOTE: the purpose here is in case due to the state change, the config rewrite 
-     does not handle the configs, however, previously the config was set in the config file, 
-     rewriteConfigMarkAsProcessed should be put here to mark it as processed in order to 
-     delete the old config entry.
-    */
-    rewriteConfigMarkAsProcessed(state,"sentinel monitor");
-    rewriteConfigMarkAsProcessed(state,"sentinel down-after-milliseconds");
-    rewriteConfigMarkAsProcessed(state,"sentinel failover-timeout");
-    rewriteConfigMarkAsProcessed(state,"sentinel parallel-syncs");
-    rewriteConfigMarkAsProcessed(state,"sentinel notification-script");
-    rewriteConfigMarkAsProcessed(state,"sentinel client-reconfig-script");
-    rewriteConfigMarkAsProcessed(state,"sentinel auth-pass");
-    rewriteConfigMarkAsProcessed(state,"sentinel auth-user");
-    rewriteConfigMarkAsProcessed(state,"sentinel config-epoch");
-    rewriteConfigMarkAsProcessed(state,"sentinel leader-epoch");
-    rewriteConfigMarkAsProcessed(state,"sentinel known-replica");
-    rewriteConfigMarkAsProcessed(state,"sentinel known-sentinel");
-    rewriteConfigMarkAsProcessed(state,"sentinel rename-command");
-}
-
-/* This function uses the config rewriting Redis engine in order to persist
- * the state of the Sentinel in the current configuration file.
- *
- * Before returning the function calls fsync() against the generated
- * configuration file to make sure changes are committed to disk.
- *
- * On failure the function logs a warning on the Redis log. */
-void sentinelFlushConfig(void) {
-    int fd = -1;
-    int saved_hz = server.hz;
-    int rewrite_status;
-
-    server.hz = CONFIG_DEFAULT_HZ;
-    rewrite_status = rewriteConfig(server.configfile, 0);
-    server.hz = saved_hz;
-
-    if (rewrite_status == -1) goto werr;
-    if ((fd = open(server.configfile,O_RDONLY)) == -1) goto werr;
-    if (fsync(fd) == -1) goto werr;
-    if (close(fd) == EOF) goto werr;
-    return;
-
-werr:
-    serverLog(LL_WARNING,"WARNING: Sentinel was not able to save the new configuration on disk!!!: %s", strerror(errno));
-    if (fd != -1) close(fd);
-}
-
-/* ====================== hiredis connection handling ======================= */
-
-/* Send the AUTH command with the specified master password if needed.
- * Note that for slaves the password set for the master is used.
- *
- * In case this Sentinel requires a password as well, via the "requirepass"
- * configuration directive, we assume we should use the local password in
- * order to authenticate when connecting with the other Sentinels as well.
- * So basically all the Sentinels share the same password and use it to
- * authenticate reciprocally.
- *
- * We don't check at all if the command was successfully transmitted
- * to the instance as if it fails Sentinel will detect the instance down,
- * will disconnect and reconnect the link and so forth. */
-void sentinelSendAuthIfNeeded(sentinelRedisInstance *ri, redisAsyncContext *c) {
-    char *auth_pass = NULL;
-    char *auth_user = NULL;
-
-    if (ri->flags & SRI_MASTER) {
-        auth_pass = ri->auth_pass;
-        auth_user = ri->auth_user;
-    } else if (ri->flags & SRI_SLAVE) {
-        auth_pass = ri->master->auth_pass;
-        auth_user = ri->master->auth_user;
-    } else if (ri->flags & SRI_SENTINEL) {
-        /* If sentinel_auth_user is NULL, AUTH will use default user
-           with sentinel_auth_pass to authenticate */
-        if (sentinel.sentinel_auth_pass) {
-            auth_pass = sentinel.sentinel_auth_pass;
-            auth_user = sentinel.sentinel_auth_user;
-        } else {
-            /* Compatibility with old configs. requirepass is used
-             * for both incoming and outgoing authentication. */
-            auth_pass = server.requirepass;
-            auth_user = NULL;
-        }
-    }
-
-    if (auth_pass && auth_user == NULL) {
-        if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri, "%s %s",
-            sentinelInstanceMapCommand(ri,"AUTH"),
-            auth_pass) == C_OK) ri->link->pending_commands++;
-    } else if (auth_pass && auth_user) {
-        /* If we also have an username, use the ACL-style AUTH command
-         * with two arguments, username and password. */
-        if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri, "%s %s %s",
-            sentinelInstanceMapCommand(ri,"AUTH"),
-            auth_user, auth_pass) == C_OK) ri->link->pending_commands++;
-    }
-}
-
-/* Use CLIENT SETNAME to name the connection in the Redis instance as
- * sentinel-<first_8_chars_of_runid>-<connection_type>
- * The connection type is "cmd" or "pubsub" as specified by 'type'.
- *
- * This makes it possible to list all the sentinel instances connected
- * to a Redis server with CLIENT LIST, grepping for a specific name format. */
-void sentinelSetClientName(sentinelRedisInstance *ri, redisAsyncContext *c, char *type) {
-    char name[64];
-
-    snprintf(name,sizeof(name),"sentinel-%.8s-%s",sentinel.myid,type);
-    if (redisAsyncCommand(c, sentinelDiscardReplyCallback, ri,
-        "%s SETNAME %s",
-        sentinelInstanceMapCommand(ri,"CLIENT"),
-        name) == C_OK)
-    {
-        ri->link->pending_commands++;
-    }
-}
-
-static int instanceLinkNegotiateTLS(redisAsyncContext *context) {
-#ifndef USE_OPENSSL
-    (void) context;
-#else
-    if (!redis_tls_ctx) return C_ERR;
-    SSL *ssl = SSL_new(redis_tls_client_ctx ? redis_tls_client_ctx : redis_tls_ctx);
-    if (!ssl) return C_ERR;
-
-    if (redisInitiateSSL(&context->c, ssl) == REDIS_ERR) return C_ERR;
-#endif
-    return C_OK;
-}
-
-/* Create the async connections for the instance link if the link
- * is disconnected. Note that link->disconnected is true even if just
- * one of the two links (commands and pub/sub) is missing. */
-void sentinelReconnectInstance(sentinelRedisInstance *ri) {
-    if (ri->link->disconnected == 0) return;
-    if (ri->addr->port == 0) return; /* port == 0 means invalid address. */
-    instanceLink *link = ri->link;
-    mstime_t now = mstime();
-
-    if (now - ri->link->last_reconn_time < SENTINEL_PING_PERIOD) return;
-    ri->link->last_reconn_time = now;
-
-    /* Commands connection. */
-    if (link->cc == NULL) {
-        link->cc = redisAsyncConnectBind(ri->addr->ip,ri->addr->port,NET_FIRST_BIND_ADDR);
-        if (link->cc && !link->cc->err) anetCloexec(link->cc->c.fd);
-        if (!link->cc) {
-            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #Failed to establish connection");
-        } else if (!link->cc->err && server.tls_replication &&
-                (instanceLinkNegotiateTLS(link->cc) == C_ERR)) {
-            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #Failed to initialize TLS");
-            instanceLinkCloseConnection(link,link->cc);
-        } else if (link->cc->err) {
-            sentinelEvent(LL_DEBUG,"-cmd-link-reconnection",ri,"%@ #%s",
-                link->cc->errstr);
-            instanceLinkCloseConnection(link,link->cc);
-        } else {
-            link->pending_commands = 0;
-            link->cc_conn_time = mstime();
-            link->cc->data = link;
-            redisAeAttach(server.el,link->cc);
-            redisAsyncSetConnectCallback(link->cc,
-                    sentinelLinkEstablishedCallback);
-            redisAsyncSetDisconnectCallback(link->cc,
-                    sentinelDisconnectCallback);
-            sentinelSendAuthIfNeeded(ri,link->cc);
-            sentinelSetClientName(ri,link->cc,"cmd");
-
-            /* Send a PING ASAP when reconnecting. */
-            sentinelSendPing(ri);
-        }
-    }
-    /* Pub / Sub */
-    if ((ri->flags & (SRI_MASTER|SRI_SLAVE)) && link->pc == NULL) {
-        link->pc = redisAsyncConnectBind(ri->addr->ip,ri->addr->port,NET_FIRST_BIND_ADDR);
-        if (link->pc && !link->pc->err) anetCloexec(link->pc->c.fd);
-        if (!link->pc) {
-            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #Failed to establish connection");
-        } else if (!link->pc->err && server.tls_replication &&
-                (instanceLinkNegotiateTLS(link->pc) == C_ERR)) {
-            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #Failed to initialize TLS");
-        } else if (link->pc->err) {
-            sentinelEvent(LL_DEBUG,"-pubsub-link-reconnection",ri,"%@ #%s",
-                link->pc->errstr);
-            instanceLinkCloseConnection(link,link->pc);
-        } else {
-            int retval;
-            link->pc_conn_time = mstime();
-            link->pc->data = link;
-            redisAeAttach(server.el,link->pc);
-            redisAsyncSetConnectCallback(link->pc,
-                    sentinelLinkEstablishedCallback);
-            redisAsyncSetDisconnectCallback(link->pc,
-                    sentinelDisconnectCallback);
-            sentinelSendAuthIfNeeded(ri,link->pc);
-            sentinelSetClientName(ri,link->pc,"pubsub");
-            /* Now we subscribe to the Sentinels "Hello" channel. */
-            retval = redisAsyncCommand(link->pc,
-                sentinelReceiveHelloMessages, ri, "%s %s",
-                sentinelInstanceMapCommand(ri,"SUBSCRIBE"),
-                SENTINEL_HELLO_CHANNEL);
-            if (retval != C_OK) {
-                /* If we can't subscribe, the Pub/Sub connection is useless
-                 * and we can simply disconnect it and try again. */
-                instanceLinkCloseConnection(link,link->pc);
-                return;
-            }
-        }
-    }
-    /* Clear the disconnected status only if we have both the connections
-     * (or just the commands connection if this is a sentinel instance). */
-    if (link->cc && (ri->flags & SRI_SENTINEL || link->pc))
-        link->disconnected = 0;
-}
-
-/* ======================== Redis instances pinging  ======================== */
-
-/* Return true if master looks "sane", that is:
- * 1) It is actually a master in the current configuration.
- * 2) It reports itself as a master.
- * 3) It is not SDOWN or ODOWN.
- * 4) We obtained last INFO no more than two times the INFO period time ago. */
-int sentinelMasterLooksSane(sentinelRedisInstance *master) {
-    return
-        master->flags & SRI_MASTER &&
-        master->role_reported == SRI_MASTER &&
-        (master->flags & (SRI_S_DOWN|SRI_O_DOWN)) == 0 &&
-        (mstime() - master->info_refresh) < SENTINEL_INFO_PERIOD*2;
-}
-
-/* Process the INFO output from masters. */
-void sentinelRefreshInstanceInfo(sentinelRedisInstance *ri, const char *info) {
-    sds *lines;
-    int numlines, j;
-    int role = 0;
-
-    /* cache full INFO output for instance */
-    sdsfree(ri->info);
-    ri->info = sdsnew(info);
-
-    /* The following fields must be reset to a given value in the case they
-     * are not found at all in the INFO output. */
-    ri->master_link_down_time = 0;
-
-    /* Process line by line. */
-    lines = sdssplitlen(info,strlen(info),"\r\n",2,&numlines);
-    for (j = 0; j < numlines; j++) {
-        sentinelRedisInstance *slave;
-        sds l = lines[j];
-
-        /* run_id:<40 hex chars>*/
-        if (sdslen(l) >= 47 && !memcmp(l,"run_id:",7)) {
-            if (ri->runid == NULL) {
-                ri->runid = sdsnewlen(l+7,40);
-            } else {
-                if (strncmp(ri->runid,l+7,40) != 0) {
-                    sentinelEvent(LL_NOTICE,"+reboot",ri,"%@");
-                    sdsfree(ri->runid);
-                    ri->runid = sdsnewlen(l+7,40);
-                }
-            }
-        }
-
-        /* old versions: slave0:<ip>,<port>,<state>
-         * new versions: slave0:ip=127.0.0.1,port=9999,... */
-        if ((ri->flags & SRI_MASTER) &&
-            sdslen(l) >= 7 &&
-            !memcmp(l,"slave",5) && isdigit(l[5]))
-        {
-            char *ip, *port, *end;
-
-            if (strstr(l,"ip=") == NULL) {
-                /* Old format. */
-                ip = strchr(l,':'); if (!ip) continue;
-                ip++; /* Now ip points to start of ip address. */
-                port = strchr(ip,','); if (!port) continue;
-                *port = '\0'; /* nul term for easy access. */
-                port++; /* Now port points to start of port number. */
-                end = strchr(port,','); if (!end) continue;
-                *end = '\0'; /* nul term for easy access. */
-            } else {
-                /* New format. */
-                ip = strstr(l,"ip="); if (!ip) continue;
-                ip += 3; /* Now ip points to start of ip address. */
-                port = strstr(l,"port="); if (!port) continue;
-                port += 5; /* Now port points to start of port number. */
-                /* Nul term both fields for easy access. */
-                end = strchr(ip,','); if (end) *end = '\0';
-                end = strchr(port,','); if (end) *end = '\0';
-            }
-
-            /* Check if we already have this slave into our table,
-             * otherwise add it. */
-            if (sentinelRedisInstanceLookupSlave(ri,ip,atoi(port)) == NULL) {
-                if ((slave = createSentinelRedisInstance(NULL,SRI_SLAVE,ip,
-                            atoi(port), ri->quorum, ri)) != NULL)
-                {
-                    sentinelEvent(LL_NOTICE,"+slave",slave,"%@");
-                    sentinelFlushConfig();
-                }
-            }
-        }
-
-        /* master_link_down_since_seconds:<seconds> */
-        if (sdslen(l) >= 32 &&
-            !memcmp(l,"master_link_down_since_seconds",30))
-        {
-            ri->master_link_down_time = strtoll(l+31,NULL,10)*1000;
-        }
-
-        /* role:<role> */
-        if (sdslen(l) >= 11 && !memcmp(l,"role:master",11)) role = SRI_MASTER;
-        else if (sdslen(l) >= 10 && !memcmp(l,"role:slave",10)) role = SRI_SLAVE;
-
-        if (role == SRI_SLAVE) {
-            /* master_host:<host> */
-            if (sdslen(l) >= 12 && !memcmp(l,"master_host:",12)) {
-                if (ri->slave_master_host == NULL ||
-                    strcasecmp(l+12,ri->slave_master_host))
-                {
-                    sdsfree(ri->slave_master_host);
-                    ri->slave_master_host = sdsnew(l+12);
-                    ri->slave_conf_change_time = mstime();
-                }
-            }
-
-            /* master_port:<port> */
-            if (sdslen(l) >= 12 && !memcmp(l,"master_port:",12)) {
-                int slave_master_port = atoi(l+12);
-
-                if (ri->slave_master_port != slave_master_port) {
-                    ri->slave_master_port = slave_master_port;
-                    ri->slave_conf_change_time = mstime();
-                }
-            }
-
-            /* master_link_status:<status> */
-            if (sdslen(l) >= 19 && !memcmp(l,"master_link_status:",19)) {
-                ri->slave_master_link_status =
-                    (strcasecmp(l+19,"up") == 0) ?
-                    SENTINEL_MASTER_LINK_STATUS_UP :
-                    SENTINEL_MASTER_LINK_STATUS_DOWN;
-            }
-
-            /* slave_priority:<priority> */
-            if (sdslen(l) >= 15 && !memcmp(l,"slave_priority:",15))
-                ri->slave_priority = atoi(l+15);
-
-            /* slave_repl_offset:<offset> */
-            if (sdslen(l) >= 18 && !memcmp(l,"slave_repl_offset:",18))
-                ri->slave_repl_offset = strtoull(l+18,NULL,10);
-
-            /* replica_announced:<announcement> */
-            if (sdslen(l) >= 18 && !memcmp(l,"replica_announced:",18))
-                ri->replica_announced = atoi(l+18);
-        }
-    }
-    ri->info_refresh = mstime();
-    sdsfreesplitres(lines,numlines);
-
-    /* ---------------------------- Acting half -----------------------------
-     * Some things will not happen if sentinel.tilt is true, but some will
-     * still be processed. */
-
-    /* Remember when the role changed. */
-    if (role != ri->role_reported) {
-        ri->role_reported_time = mstime();
-        ri->role_reported = role;
-        if (role == SRI_SLAVE) ri->slave_conf_change_time = mstime();
-        /* Log the event with +role-change if the new role is coherent or
-         * with -role-change if there is a mismatch with the current config. */
-        sentinelEvent(LL_VERBOSE,
-            ((ri->flags & (SRI_MASTER|SRI_SLAVE)) == role) ?
-            "+role-change" : "-role-change",
-            ri, "%@ new reported role is %s",
-            role == SRI_MASTER ? "master" : "slave");
-    }
-
-    /* None of the following conditions are processed when in tilt mode, so
-     * return asap. */
-    if (sentinel.tilt) return;
-
-    /* Handle master -> slave role switch. */
-    if ((ri->flags & SRI_MASTER) && role == SRI_SLAVE) {
-        /* Nothing to do, but masters claiming to be slaves are
-         * considered to be unreachable by Sentinel, so eventually
-         * a failover will be triggered. */
-    }
-
-    /* Handle slave -> master role switch. */
-    if ((ri->flags & SRI_SLAVE) && role == SRI_MASTER) {
-        /* If this is a promoted slave we can change state to the
-         * failover state machine. */
-        if ((ri->flags & SRI_PROMOTED) &&
-            (ri->master->flags & SRI_FAILOVER_IN_PROGRESS) &&
-            (ri->master->failover_state ==
-                SENTINEL_FAILOVER_STATE_WAIT_PROMOTION))
-        {
-            /* Now that we are sure the slave was reconfigured as a master
-             * set the master configuration epoch to the epoch we won the
-             * election to perform this failover. This will force the other
-             * Sentinels to update their config (assuming there is not
-             * a newer one already available). */
-            ri->master->config_epoch = ri->master->failover_epoch;
-            ri->master->failover_state = SENTINEL_FAILOVER_STATE_RECONF_SLAVES;
-            ri->master->failover_state_change_time = mstime();
-            sentinelFlushConfig();
-            sentinelEvent(LL_WARNING,"+promoted-slave",ri,"%@");
-            if (sentinel.simfailure_flags &
-                SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION)
-                sentinelSimFailureCrash();
-            sentinelEvent(LL_WARNING,"+failover-state-reconf-slaves",
-                ri->master,"%@");
-            sentinelCallClientReconfScript(ri->master,SENTINEL_LEADER,
-                "start",ri->master->addr,ri->addr);
-            sentinelForceHelloUpdateForMaster(ri->master);
-        } else {
-            /* A slave turned into a master. We want to force our view and
-             * reconfigure as slave. Wait some time after the change before
-             * going forward, to receive new configs if any. */
-            mstime_t wait_time = SENTINEL_PUBLISH_PERIOD*4;
-
-            if (!(ri->flags & SRI_PROMOTED) &&
-                 sentinelMasterLooksSane(ri->master) &&
-                 sentinelRedisInstanceNoDownFor(ri,wait_time) &&
-                 mstime() - ri->role_reported_time > wait_time)
-            {
-                int retval = sentinelSendSlaveOf(ri,ri->master->addr);
-                if (retval == C_OK)
-                    sentinelEvent(LL_NOTICE,"+convert-to-slave",ri,"%@");
-            }
-        }
-    }
-
-    /* Handle slaves replicating to a different master address. */
-    if ((ri->flags & SRI_SLAVE) &&
-        role == SRI_SLAVE &&
-        (ri->slave_master_port != ri->master->addr->port ||
-         !sentinelAddrEqualsHostname(ri->master->addr, ri->slave_master_host)))
-    {
-        mstime_t wait_time = ri->master->failover_timeout;
-
-        /* Make sure the master is sane before reconfiguring this instance
-         * into a slave. */
-        if (sentinelMasterLooksSane(ri->master) &&
-            sentinelRedisInstanceNoDownFor(ri,wait_time) &&
-            mstime() - ri->slave_conf_change_time > wait_time)
-        {
-            int retval = sentinelSendSlaveOf(ri,ri->master->addr);
-            if (retval == C_OK)
-                sentinelEvent(LL_NOTICE,"+fix-slave-config",ri,"%@");
-        }
-    }
-
-    /* Detect if the slave that is in the process of being reconfigured
-     * changed state. */
-    if ((ri->flags & SRI_SLAVE) && role == SRI_SLAVE &&
-        (ri->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG)))
-    {
-        /* SRI_RECONF_SENT -> SRI_RECONF_INPROG. */
-        if ((ri->flags & SRI_RECONF_SENT) &&
-            ri->slave_master_host &&
-            sentinelAddrEqualsHostname(ri->master->promoted_slave->addr,
-                ri->slave_master_host) &&
-            ri->slave_master_port == ri->master->promoted_slave->addr->port)
-        {
-            ri->flags &= ~SRI_RECONF_SENT;
-            ri->flags |= SRI_RECONF_INPROG;
-            sentinelEvent(LL_NOTICE,"+slave-reconf-inprog",ri,"%@");
-        }
-
-        /* SRI_RECONF_INPROG -> SRI_RECONF_DONE */
-        if ((ri->flags & SRI_RECONF_INPROG) &&
-            ri->slave_master_link_status == SENTINEL_MASTER_LINK_STATUS_UP)
-        {
-            ri->flags &= ~SRI_RECONF_INPROG;
-            ri->flags |= SRI_RECONF_DONE;
-            sentinelEvent(LL_NOTICE,"+slave-reconf-done",ri,"%@");
-        }
-    }
-}
-
-void sentinelInfoReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
-    sentinelRedisInstance *ri = privdata;
-    instanceLink *link = c->data;
-    redisReply *r;
-
-    if (!reply || !link) return;
-    link->pending_commands--;
-    r = reply;
-
-    if (r->type == REDIS_REPLY_STRING)
-        sentinelRefreshInstanceInfo(ri,r->str);
-}
-
-/* Just discard the reply. We use this when we are not monitoring the return
- * value of the command but its effects directly. */
-void sentinelDiscardReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
-    instanceLink *link = c->data;
-    UNUSED(reply);
-    UNUSED(privdata);
-
-    if (link) link->pending_commands--;
-}
-
-void sentinelPingReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
-    sentinelRedisInstance *ri = privdata;
-    instanceLink *link = c->data;
-    redisReply *r;
-
-    if (!reply || !link) return;
-    link->pending_commands--;
-    r = reply;
-
-    if (r->type == REDIS_REPLY_STATUS ||
-        r->type == REDIS_REPLY_ERROR) {
-        /* Update the "instance available" field only if this is an
-         * acceptable reply. */
-        if (strncmp(r->str,"PONG",4) == 0 ||
-            strncmp(r->str,"LOADING",7) == 0 ||
-            strncmp(r->str,"MASTERDOWN",10) == 0)
-        {
-            link->last_avail_time = mstime();
-            link->act_ping_time = 0; /* Flag the pong as received. */
-        } else {
-            /* Send a SCRIPT KILL command if the instance appears to be
-             * down because of a busy script. */
-            if (strncmp(r->str,"BUSY",4) == 0 &&
-                (ri->flags & SRI_S_DOWN) &&
-                !(ri->flags & SRI_SCRIPT_KILL_SENT))
-            {
-                if (redisAsyncCommand(ri->link->cc,
-                        sentinelDiscardReplyCallback, ri,
-                        "%s KILL",
-                        sentinelInstanceMapCommand(ri,"SCRIPT")) == C_OK)
-                {
-                    ri->link->pending_commands++;
-                }
-                ri->flags |= SRI_SCRIPT_KILL_SENT;
-            }
-        }
-    }
-    link->last_pong_time = mstime();
-}
-
-/* This is called when we get the reply about the PUBLISH command we send
- * to the master to advertise this sentinel. */
-void sentinelPublishReplyCallback(redisAsyncContext *c, void *reply, void *privdata) {
-    sentinelRedisInstance *ri = privdata;
-    instanceLink *link = c->data;
-    redisReply *r;
-
-    if (!reply || !link) return;
-    link->pending_commands--;
-    r = reply;
-
-    /* Only update pub_time if we actually published our message. Otherwise
-     * we'll retry again in 100 milliseconds. */
-    if (r->type != REDIS_REPLY_ERROR)
-        ri->last_pub_time = mstime();
-}
-
-/* Process a hello message received via Pub/Sub in master or slave instance,
- * or sent directly to this sentinel via the (fake) PUBLISH command of Sentinel.
- *
- * If the master name specified in the message is not known, the message is
- * discarded. */
-void sentinelProcessHelloMessage(char *hello, int hello_len) {
-    /* Format is composed of 8 tokens:
-     * 0=ip,1=port,2=runid,3=current_epoch,4=master_name,
-     * 5=master_ip,6=master_port,7=master_config_epoch. */
-    int numtokens, port, removed, master_port;
-    uint64_t current_epoch, master_config_epoch;
-    char **token = sdssplitlen(hello, hello_len, ",", 1, &numtokens);
-    sentinelRedisInstance *si, *master;
-
-    if (numtokens == 8) {
-        /* Obtain a reference to the master this hello message is about */
-        master = sentinelGetMasterByName(token[4]);
-        if (!master) goto cleanup; /* Unknown master, skip the message. */
-
-        /* First, try to see if we already have this sentinel. */
-        port = atoi(token[1]);
-        master_port = atoi(token[6]);
-        si = getSentinelRedisInstanceByAddrAndRunID(
-                        master->sentinels,token[0],port,token[2]);
-        current_epoch = strtoull(token[3],NULL,10);
-        master_config_epoch = strtoull(token[7],NULL,10);
-
-        if (!si) {
-            /* If not, remove all the sentinels that have the same runid
-             * because there was an address change, and add the same Sentinel
-             * with the new address back. */
-            removed = removeMatchingSentinelFromMaster(master,token[2]);
-            if (removed) {
-                sentinelEvent(LL_NOTICE,"+sentinel-address-switch",master,
-                    "%@ ip %s port %d for %s", token[0],port,token[2]);
-            } else {
-                /* Check if there is another Sentinel with the same address this
-                 * new one is reporting. What we do if this happens is to set its
-                 * port to 0, to signal the address is invalid. We'll update it
-                 * later if we get an HELLO message. */
-                sentinelRedisInstance *other =
-                    getSentinelRedisInstanceByAddrAndRunID(
-                        master->sentinels, token[0],port,NULL);
-                if (other) {
-                    sentinelEvent(LL_NOTICE,"+sentinel-invalid-addr",other,"%@");
-                    other->addr->port = 0; /* It means: invalid address. */
-                    sentinelUpdateSentinelAddressInAllMasters(other);
-                }
-            }
-
-            /* Add the new sentinel. */
-            si = createSentinelRedisInstance(token[2],SRI_SENTINEL,
-                            token[0],port,master->quorum,master);
-
-            if (si) {
-                if (!removed) sentinelEvent(LL_NOTICE,"+sentinel",si,"%@");
-                /* The runid is NULL after a new instance creation and
-                 * for Sentinels we don't have a later chance to fill it,
-                 * so do it now. */
-                si->runid = sdsnew(token[2]);
-                sentinelTryConnectionSharing(si);
-                if (removed) sentinelUpdateSentinelAddressInAllMasters(si);
-                sentinelFlushConfig();
-            }
-        }
-
-        /* Update local current_epoch if received current_epoch is greater.*/
-        if (current_epoch > sentinel.current_epoch) {
-            sentinel.current_epoch = current_epoch;
-            sentinelFlushConfig();
-            sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
-                (unsigned long long) sentinel.current_epoch);
-        }
-
-        /* Update master info if received configuration is newer. */
-        if (si && master->config_epoch < master_config_epoch) {
-            master->config_epoch = master_config_epoch;
-            if (master_port != master->addr->port ||
-                !sentinelAddrEqualsHostname(master->addr, token[5]))
-            {
-                sentinelAddr *old_addr;
-
-                sentinelEvent(LL_WARNING,"+config-update-from",si,"%@");
-                sentinelEvent(LL_WARNING,"+switch-master",
-                    master,"%s %s %d %s %d",
-                    master->name,
-                    announceSentinelAddr(master->addr), master->addr->port,
-                    token[5], master_port);
-
-                old_addr = dupSentinelAddr(master->addr);
-                sentinelResetMasterAndChangeAddress(master, token[5], master_port);
-                sentinelCallClientReconfScript(master,
-                    SENTINEL_OBSERVER,"start",
-                    old_addr,master->addr);
-                releaseSentinelAddr(old_addr);
-            }
-        }
-
-        /* Update the state of the Sentinel. */
-        if (si) si->last_hello_time = mstime();
-    }
-
-cleanup:
-    sdsfreesplitres(token,numtokens);
-}
-
-
-/* This is our Pub/Sub callback for the Hello channel. It's useful in order
- * to discover other sentinels attached at the same master. */
-void sentinelReceiveHelloMessages(redisAsyncContext *c, void *reply, void *privdata) {
-    sentinelRedisInstance *ri = privdata;
-    redisReply *r;
-    UNUSED(c);
-
-    if (!reply || !ri) return;
-    r = reply;
-
-    /* Update the last activity in the pubsub channel. Note that since we
-     * receive our messages as well this timestamp can be used to detect
-     * if the link is probably disconnected even if it seems otherwise. */
-    ri->link->pc_last_activity = mstime();
-
-    /* Sanity check in the reply we expect, so that the code that follows
-     * can avoid to check for details. */
-    if (r->type != REDIS_REPLY_ARRAY ||
-        r->elements != 3 ||
-        r->element[0]->type != REDIS_REPLY_STRING ||
-        r->element[1]->type != REDIS_REPLY_STRING ||
-        r->element[2]->type != REDIS_REPLY_STRING ||
-        strcmp(r->element[0]->str,"message") != 0) return;
-
-    /* We are not interested in meeting ourselves */
-    if (strstr(r->element[2]->str,sentinel.myid) != NULL) return;
-
-    sentinelProcessHelloMessage(r->element[2]->str, r->element[2]->len);
-}
-
-/* Send a "Hello" message via Pub/Sub to the specified 'ri' Redis
- * instance in order to broadcast the current configuration for this
- * master, and to advertise the existence of this Sentinel at the same time.
- *
- * The message has the following format:
- *
- * sentinel_ip,sentinel_port,sentinel_runid,current_epoch,
- * master_name,master_ip,master_port,master_config_epoch.
- *
- * Returns C_OK if the PUBLISH was queued correctly, otherwise
- * C_ERR is returned. */
-int sentinelSendHello(sentinelRedisInstance *ri) {
-    char ip[NET_IP_STR_LEN];
-    char payload[NET_IP_STR_LEN+1024];
-    int retval;
-    char *announce_ip;
-    int announce_port;
-    sentinelRedisInstance *master = (ri->flags & SRI_MASTER) ? ri : ri->master;
-    sentinelAddr *master_addr = sentinelGetCurrentMasterAddress(master);
-
-    if (ri->link->disconnected) return C_ERR;
-
-    /* Use the specified announce address if specified, otherwise try to
-     * obtain our own IP address. */
-    if (sentinel.announce_ip) {
-        announce_ip = sentinel.announce_ip;
-    } else {
-        if (anetFdToString(ri->link->cc->c.fd,ip,sizeof(ip),NULL,FD_TO_SOCK_NAME) == -1)
-            return C_ERR;
-        announce_ip = ip;
-    }
-    if (sentinel.announce_port) announce_port = sentinel.announce_port;
-    else if (server.tls_replication && server.tls_port) announce_port = server.tls_port;
-    else announce_port = server.port;
-
-    /* Format and send the Hello message. */
-    snprintf(payload,sizeof(payload),
-        "%s,%d,%s,%llu," /* Info about this sentinel. */
-        "%s,%s,%d,%llu", /* Info about current master. */
-        announce_ip, announce_port, sentinel.myid,
-        (unsigned long long) sentinel.current_epoch,
-        /* --- */
-        master->name,announceSentinelAddr(master_addr),master_addr->port,
-        (unsigned long long) master->config_epoch);
-    retval = redisAsyncCommand(ri->link->cc,
-        sentinelPublishReplyCallback, ri, "%s %s %s",
-        sentinelInstanceMapCommand(ri,"PUBLISH"),
-        SENTINEL_HELLO_CHANNEL,payload);
-    if (retval != C_OK) return C_ERR;
-    ri->link->pending_commands++;
-    return C_OK;
-}
-
-/* Reset last_pub_time in all the instances in the specified dictionary
- * in order to force the delivery of a Hello update ASAP. */
-void sentinelForceHelloUpdateDictOfRedisInstances(dict *instances) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetSafeIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        if (ri->last_pub_time >= (SENTINEL_PUBLISH_PERIOD+1))
-            ri->last_pub_time -= (SENTINEL_PUBLISH_PERIOD+1);
-    }
-    dictReleaseIterator(di);
-}
-
-/* This function forces the delivery of a "Hello" message (see
- * sentinelSendHello() top comment for further information) to all the Redis
- * and Sentinel instances related to the specified 'master'.
- *
- * It is technically not needed since we send an update to every instance
- * with a period of SENTINEL_PUBLISH_PERIOD milliseconds, however when a
- * Sentinel upgrades a configuration it is a good idea to deliver an update
- * to the other Sentinels ASAP. */
-int sentinelForceHelloUpdateForMaster(sentinelRedisInstance *master) {
-    if (!(master->flags & SRI_MASTER)) return C_ERR;
-    if (master->last_pub_time >= (SENTINEL_PUBLISH_PERIOD+1))
-        master->last_pub_time -= (SENTINEL_PUBLISH_PERIOD+1);
-    sentinelForceHelloUpdateDictOfRedisInstances(master->sentinels);
-    sentinelForceHelloUpdateDictOfRedisInstances(master->slaves);
-    return C_OK;
-}
-
-/* Send a PING to the specified instance and refresh the act_ping_time
- * if it is zero (that is, if we received a pong for the previous ping).
- *
- * On error zero is returned, and we can't consider the PING command
- * queued in the connection. */
-int sentinelSendPing(sentinelRedisInstance *ri) {
-    int retval = redisAsyncCommand(ri->link->cc,
-        sentinelPingReplyCallback, ri, "%s",
-        sentinelInstanceMapCommand(ri,"PING"));
-    if (retval == C_OK) {
-        ri->link->pending_commands++;
-        ri->link->last_ping_time = mstime();
-        /* We update the active ping time only if we received the pong for
-         * the previous ping, otherwise we are technically waiting since the
-         * first ping that did not receive a reply. */
-        if (ri->link->act_ping_time == 0)
-            ri->link->act_ping_time = ri->link->last_ping_time;
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Send periodic PING, INFO, and PUBLISH to the Hello channel to
- * the specified master or slave instance. */
-void sentinelSendPeriodicCommands(sentinelRedisInstance *ri) {
-    mstime_t now = mstime();
-    mstime_t info_period, ping_period;
-    int retval;
-
-    /* Return ASAP if we have already a PING or INFO already pending, or
-     * in the case the instance is not properly connected. */
-    if (ri->link->disconnected) return;
-
-    /* For INFO, PING, PUBLISH that are not critical commands to send we
-     * also have a limit of SENTINEL_MAX_PENDING_COMMANDS. We don't
-     * want to use a lot of memory just because a link is not working
-     * properly (note that anyway there is a redundant protection about this,
-     * that is, the link will be disconnected and reconnected if a long
-     * timeout condition is detected. */
-    if (ri->link->pending_commands >=
-        SENTINEL_MAX_PENDING_COMMANDS * ri->link->refcount) return;
-
-    /* If this is a slave of a master in O_DOWN condition we start sending
-     * it INFO every second, instead of the usual SENTINEL_INFO_PERIOD
-     * period. In this state we want to closely monitor slaves in case they
-     * are turned into masters by another Sentinel, or by the sysadmin.
-     *
-     * Similarly we monitor the INFO output more often if the slave reports
-     * to be disconnected from the master, so that we can have a fresh
-     * disconnection time figure. */
-    if ((ri->flags & SRI_SLAVE) &&
-        ((ri->master->flags & (SRI_O_DOWN|SRI_FAILOVER_IN_PROGRESS)) ||
-         (ri->master_link_down_time != 0)))
-    {
-        info_period = 1000;
-    } else {
-        info_period = SENTINEL_INFO_PERIOD;
-    }
-
-    /* We ping instances every time the last received pong is older than
-     * the configured 'down-after-milliseconds' time, but every second
-     * anyway if 'down-after-milliseconds' is greater than 1 second. */
-    ping_period = ri->down_after_period;
-    if (ping_period > SENTINEL_PING_PERIOD) ping_period = SENTINEL_PING_PERIOD;
-
-    /* Send INFO to masters and slaves, not sentinels. */
-    if ((ri->flags & SRI_SENTINEL) == 0 &&
-        (ri->info_refresh == 0 ||
-        (now - ri->info_refresh) > info_period))
-    {
-        retval = redisAsyncCommand(ri->link->cc,
-            sentinelInfoReplyCallback, ri, "%s",
-            sentinelInstanceMapCommand(ri,"INFO"));
-        if (retval == C_OK) ri->link->pending_commands++;
-    }
-
-    /* Send PING to all the three kinds of instances. */
-    if ((now - ri->link->last_pong_time) > ping_period &&
-               (now - ri->link->last_ping_time) > ping_period/2) {
-        sentinelSendPing(ri);
-    }
-
-    /* PUBLISH hello messages to all the three kinds of instances. */
-    if ((now - ri->last_pub_time) > SENTINEL_PUBLISH_PERIOD) {
-        sentinelSendHello(ri);
-    }
-}
-
-/* =========================== SENTINEL command ============================= */
-
-/* SENTINEL CONFIG SET <option> */
-void sentinelConfigSetCommand(client *c) {
-    robj *o = c->argv[3];
-    robj *val = c->argv[4];
-    long long numval;
-    int drop_conns = 0;
-
-    if (!strcasecmp(o->ptr, "resolve-hostnames")) {
-        if ((numval = yesnotoi(val->ptr)) == -1) goto badfmt;
-        sentinel.resolve_hostnames = numval;
-    } else if (!strcasecmp(o->ptr, "announce-hostnames")) {
-        if ((numval = yesnotoi(val->ptr)) == -1) goto badfmt;
-        sentinel.announce_hostnames = numval;
-    } else if (!strcasecmp(o->ptr, "announce-ip")) {
-        if (sentinel.announce_ip) sdsfree(sentinel.announce_ip);
-        sentinel.announce_ip = sdsnew(val->ptr);
-    } else if (!strcasecmp(o->ptr, "announce-port")) {
-        if (getLongLongFromObject(val, &numval) == C_ERR ||
-            numval < 0 || numval > 65535)
-            goto badfmt;
-        sentinel.announce_port = numval;
-    } else if (!strcasecmp(o->ptr, "sentinel-user")) {
-        sdsfree(sentinel.sentinel_auth_user);
-        sentinel.sentinel_auth_user = sdslen(val->ptr) == 0 ?
-            NULL : sdsdup(val->ptr);
-        drop_conns = 1;
-    } else if (!strcasecmp(o->ptr, "sentinel-pass")) {
-        sdsfree(sentinel.sentinel_auth_pass);
-        sentinel.sentinel_auth_pass = sdslen(val->ptr) == 0 ?
-            NULL : sdsdup(val->ptr);
-        drop_conns = 1;
-    } else {
-        addReplyErrorFormat(c, "Invalid argument '%s' to SENTINEL CONFIG SET",
-                            (char *) o->ptr);
-        return;
-    }
-
-    sentinelFlushConfig();
-    addReply(c, shared.ok);
-
-    /* Drop Sentinel connections to initiate a reconnect if needed. */
-    if (drop_conns)
-        sentinelDropConnections();
-
-    return;
-
-badfmt:
-    addReplyErrorFormat(c, "Invalid value '%s' to SENTINEL CONFIG SET '%s'",
-                        (char *) val->ptr, (char *) o->ptr);
-}
-
-/* SENTINEL CONFIG GET <option> */
-void sentinelConfigGetCommand(client *c) {
-    robj *o = c->argv[3];
-    const char *pattern = o->ptr;
-    void *replylen = addReplyDeferredLen(c);
-    int matches = 0;
-
-    if (stringmatch(pattern,"resolve-hostnames",1)) {
-        addReplyBulkCString(c,"resolve-hostnames");
-        addReplyBulkCString(c,sentinel.resolve_hostnames ? "yes" : "no");
-        matches++;
-    }
-
-    if (stringmatch(pattern, "announce-hostnames", 1)) {
-        addReplyBulkCString(c,"announce-hostnames");
-        addReplyBulkCString(c,sentinel.announce_hostnames ? "yes" : "no");
-        matches++;
-    }
-
-    if (stringmatch(pattern, "announce-ip", 1)) {
-        addReplyBulkCString(c,"announce-ip");
-        addReplyBulkCString(c,sentinel.announce_ip ? sentinel.announce_ip : "");
-        matches++;
-    }
-
-    if (stringmatch(pattern, "announce-port", 1)) {
-        addReplyBulkCString(c, "announce-port");
-        addReplyBulkLongLong(c, sentinel.announce_port);
-        matches++;
-    }
-
-    if (stringmatch(pattern, "sentinel-user", 1)) {
-        addReplyBulkCString(c, "sentinel-user");
-        addReplyBulkCString(c, sentinel.sentinel_auth_user ? sentinel.sentinel_auth_user : "");
-        matches++;
-    }
-
-    if (stringmatch(pattern, "sentinel-pass", 1)) {
-        addReplyBulkCString(c, "sentinel-pass");
-        addReplyBulkCString(c, sentinel.sentinel_auth_pass ? sentinel.sentinel_auth_pass : "");
-        matches++;
-    }
-
-    setDeferredMapLen(c, replylen, matches);
-}
-
-const char *sentinelFailoverStateStr(int state) {
-    switch(state) {
-    case SENTINEL_FAILOVER_STATE_NONE: return "none";
-    case SENTINEL_FAILOVER_STATE_WAIT_START: return "wait_start";
-    case SENTINEL_FAILOVER_STATE_SELECT_SLAVE: return "select_slave";
-    case SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE: return "send_slaveof_noone";
-    case SENTINEL_FAILOVER_STATE_WAIT_PROMOTION: return "wait_promotion";
-    case SENTINEL_FAILOVER_STATE_RECONF_SLAVES: return "reconf_slaves";
-    case SENTINEL_FAILOVER_STATE_UPDATE_CONFIG: return "update_config";
-    default: return "unknown";
-    }
-}
-
-/* Redis instance to Redis protocol representation. */
-void addReplySentinelRedisInstance(client *c, sentinelRedisInstance *ri) {
-    char *flags = sdsempty();
-    void *mbl;
-    int fields = 0;
-
-    mbl = addReplyDeferredLen(c);
-
-    addReplyBulkCString(c,"name");
-    addReplyBulkCString(c,ri->name);
-    fields++;
-
-    addReplyBulkCString(c,"ip");
-    addReplyBulkCString(c,announceSentinelAddr(ri->addr));
-    fields++;
-
-    addReplyBulkCString(c,"port");
-    addReplyBulkLongLong(c,ri->addr->port);
-    fields++;
-
-    addReplyBulkCString(c,"runid");
-    addReplyBulkCString(c,ri->runid ? ri->runid : "");
-    fields++;
-
-    addReplyBulkCString(c,"flags");
-    if (ri->flags & SRI_S_DOWN) flags = sdscat(flags,"s_down,");
-    if (ri->flags & SRI_O_DOWN) flags = sdscat(flags,"o_down,");
-    if (ri->flags & SRI_MASTER) flags = sdscat(flags,"master,");
-    if (ri->flags & SRI_SLAVE) flags = sdscat(flags,"slave,");
-    if (ri->flags & SRI_SENTINEL) flags = sdscat(flags,"sentinel,");
-    if (ri->link->disconnected) flags = sdscat(flags,"disconnected,");
-    if (ri->flags & SRI_MASTER_DOWN) flags = sdscat(flags,"master_down,");
-    if (ri->flags & SRI_FAILOVER_IN_PROGRESS)
-        flags = sdscat(flags,"failover_in_progress,");
-    if (ri->flags & SRI_PROMOTED) flags = sdscat(flags,"promoted,");
-    if (ri->flags & SRI_RECONF_SENT) flags = sdscat(flags,"reconf_sent,");
-    if (ri->flags & SRI_RECONF_INPROG) flags = sdscat(flags,"reconf_inprog,");
-    if (ri->flags & SRI_RECONF_DONE) flags = sdscat(flags,"reconf_done,");
-    if (ri->flags & SRI_FORCE_FAILOVER) flags = sdscat(flags,"force_failover,");
-    if (ri->flags & SRI_SCRIPT_KILL_SENT) flags = sdscat(flags,"script_kill_sent,");
-
-    if (sdslen(flags) != 0) sdsrange(flags,0,-2); /* remove last "," */
-    addReplyBulkCString(c,flags);
-    sdsfree(flags);
-    fields++;
-
-    addReplyBulkCString(c,"link-pending-commands");
-    addReplyBulkLongLong(c,ri->link->pending_commands);
-    fields++;
-
-    addReplyBulkCString(c,"link-refcount");
-    addReplyBulkLongLong(c,ri->link->refcount);
-    fields++;
-
-    if (ri->flags & SRI_FAILOVER_IN_PROGRESS) {
-        addReplyBulkCString(c,"failover-state");
-        addReplyBulkCString(c,(char*)sentinelFailoverStateStr(ri->failover_state));
-        fields++;
-    }
-
-    addReplyBulkCString(c,"last-ping-sent");
-    addReplyBulkLongLong(c,
-        ri->link->act_ping_time ? (mstime() - ri->link->act_ping_time) : 0);
-    fields++;
-
-    addReplyBulkCString(c,"last-ok-ping-reply");
-    addReplyBulkLongLong(c,mstime() - ri->link->last_avail_time);
-    fields++;
-
-    addReplyBulkCString(c,"last-ping-reply");
-    addReplyBulkLongLong(c,mstime() - ri->link->last_pong_time);
-    fields++;
-
-    if (ri->flags & SRI_S_DOWN) {
-        addReplyBulkCString(c,"s-down-time");
-        addReplyBulkLongLong(c,mstime()-ri->s_down_since_time);
-        fields++;
-    }
-
-    if (ri->flags & SRI_O_DOWN) {
-        addReplyBulkCString(c,"o-down-time");
-        addReplyBulkLongLong(c,mstime()-ri->o_down_since_time);
-        fields++;
-    }
-
-    addReplyBulkCString(c,"down-after-milliseconds");
-    addReplyBulkLongLong(c,ri->down_after_period);
-    fields++;
-
-    /* Masters and Slaves */
-    if (ri->flags & (SRI_MASTER|SRI_SLAVE)) {
-        addReplyBulkCString(c,"info-refresh");
-        addReplyBulkLongLong(c,
-            ri->info_refresh ? (mstime() - ri->info_refresh) : 0);
-        fields++;
-
-        addReplyBulkCString(c,"role-reported");
-        addReplyBulkCString(c, (ri->role_reported == SRI_MASTER) ? "master" :
-                                                                   "slave");
-        fields++;
-
-        addReplyBulkCString(c,"role-reported-time");
-        addReplyBulkLongLong(c,mstime() - ri->role_reported_time);
-        fields++;
-    }
-
-    /* Only masters */
-    if (ri->flags & SRI_MASTER) {
-        addReplyBulkCString(c,"config-epoch");
-        addReplyBulkLongLong(c,ri->config_epoch);
-        fields++;
-
-        addReplyBulkCString(c,"num-slaves");
-        addReplyBulkLongLong(c,dictSize(ri->slaves));
-        fields++;
-
-        addReplyBulkCString(c,"num-other-sentinels");
-        addReplyBulkLongLong(c,dictSize(ri->sentinels));
-        fields++;
-
-        addReplyBulkCString(c,"quorum");
-        addReplyBulkLongLong(c,ri->quorum);
-        fields++;
-
-        addReplyBulkCString(c,"failover-timeout");
-        addReplyBulkLongLong(c,ri->failover_timeout);
-        fields++;
-
-        addReplyBulkCString(c,"parallel-syncs");
-        addReplyBulkLongLong(c,ri->parallel_syncs);
-        fields++;
-
-        if (ri->notification_script) {
-            addReplyBulkCString(c,"notification-script");
-            addReplyBulkCString(c,ri->notification_script);
-            fields++;
-        }
-
-        if (ri->client_reconfig_script) {
-            addReplyBulkCString(c,"client-reconfig-script");
-            addReplyBulkCString(c,ri->client_reconfig_script);
-            fields++;
-        }
-    }
-
-    /* Only slaves */
-    if (ri->flags & SRI_SLAVE) {
-        addReplyBulkCString(c,"master-link-down-time");
-        addReplyBulkLongLong(c,ri->master_link_down_time);
-        fields++;
-
-        addReplyBulkCString(c,"master-link-status");
-        addReplyBulkCString(c,
-            (ri->slave_master_link_status == SENTINEL_MASTER_LINK_STATUS_UP) ?
-            "ok" : "err");
-        fields++;
-
-        addReplyBulkCString(c,"master-host");
-        addReplyBulkCString(c,
-            ri->slave_master_host ? ri->slave_master_host : "?");
-        fields++;
-
-        addReplyBulkCString(c,"master-port");
-        addReplyBulkLongLong(c,ri->slave_master_port);
-        fields++;
-
-        addReplyBulkCString(c,"slave-priority");
-        addReplyBulkLongLong(c,ri->slave_priority);
-        fields++;
-
-        addReplyBulkCString(c,"slave-repl-offset");
-        addReplyBulkLongLong(c,ri->slave_repl_offset);
-        fields++;
-
-        addReplyBulkCString(c,"replica-announced");
-        addReplyBulkLongLong(c,ri->replica_announced);
-        fields++;
-    }
-
-    /* Only sentinels */
-    if (ri->flags & SRI_SENTINEL) {
-        addReplyBulkCString(c,"last-hello-message");
-        addReplyBulkLongLong(c,mstime() - ri->last_hello_time);
-        fields++;
-
-        addReplyBulkCString(c,"voted-leader");
-        addReplyBulkCString(c,ri->leader ? ri->leader : "?");
-        fields++;
-
-        addReplyBulkCString(c,"voted-leader-epoch");
-        addReplyBulkLongLong(c,ri->leader_epoch);
-        fields++;
-    }
-
-    setDeferredMapLen(c,mbl,fields);
-}
-
-/* Output a number of instances contained inside a dictionary as
- * Redis protocol. */
-void addReplyDictOfRedisInstances(client *c, dict *instances) {
-    dictIterator *di;
-    dictEntry *de;
-    long slaves = 0;
-    void *replylen = addReplyDeferredLen(c);
-
-    di = dictGetIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        /* don't announce unannounced replicas */
-        if (ri->flags & SRI_SLAVE && !ri->replica_announced) continue;
-        addReplySentinelRedisInstance(c,ri);
-        slaves++;
-    }
-    dictReleaseIterator(di);
-    setDeferredArrayLen(c, replylen, slaves);
-}
-
-/* Lookup the named master into sentinel.masters.
- * If the master is not found reply to the client with an error and returns
- * NULL. */
-sentinelRedisInstance *sentinelGetMasterByNameOrReplyError(client *c,
-                        robj *name)
-{
-    sentinelRedisInstance *ri;
-
-    ri = dictFetchValue(sentinel.masters,name->ptr);
-    if (!ri) {
-        addReplyError(c,"No such master with that name");
-        return NULL;
-    }
-    return ri;
-}
-
-#define SENTINEL_ISQR_OK 0
-#define SENTINEL_ISQR_NOQUORUM (1<<0)
-#define SENTINEL_ISQR_NOAUTH (1<<1)
-int sentinelIsQuorumReachable(sentinelRedisInstance *master, int *usableptr) {
-    dictIterator *di;
-    dictEntry *de;
-    int usable = 1; /* Number of usable Sentinels. Init to 1 to count myself. */
-    int result = SENTINEL_ISQR_OK;
-    int voters = dictSize(master->sentinels)+1; /* Known Sentinels + myself. */
-
-    di = dictGetIterator(master->sentinels);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        if (ri->flags & (SRI_S_DOWN|SRI_O_DOWN)) continue;
-        usable++;
-    }
-    dictReleaseIterator(di);
-
-    if (usable < (int)master->quorum) result |= SENTINEL_ISQR_NOQUORUM;
-    if (usable < voters/2+1) result |= SENTINEL_ISQR_NOAUTH;
-    if (usableptr) *usableptr = usable;
-    return result;
-}
-
-void sentinelCommand(client *c) {
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"CKQUORUM <master-name>",
-"    Check if the current Sentinel configuration is able to reach the quorum",
-"    needed to failover a master and the majority needed to authorize the",
-"    failover.",
-"CONFIG SET <param> <value>",
-"    Set a global Sentinel configuration parameter.",
-"CONFIG GET <param>",
-"    Get global Sentinel configuration parameter.",
-"GET-MASTER-ADDR-BY-NAME <master-name>",
-"    Return the ip and port number of the master with that name.",
-"FAILOVER <master-name>",
-"    Manually failover a master node without asking for agreement from other",
-"    Sentinels",
-"FLUSHCONFIG",
-"    Force Sentinel to rewrite its configuration on disk, including the current",
-"    Sentinel state.",
-"INFO-CACHE <master-name>",
-"    Return last cached INFO output from masters and all its replicas.",
-"IS-MASTER-DOWN-BY-ADDR <ip> <port> <current-epoch> <runid>",
-"    Check if the master specified by ip:port is down from current Sentinel's",
-"    point of view.",
-"MASTER <master-name>",
-"    Show the state and info of the specified master.",
-"MASTERS",
-"    Show a list of monitored masters and their state.",
-"MONITOR <name> <ip> <port> <quorum>",
-"    Start monitoring a new master with the specified name, ip, port and quorum.",
-"MYID",
-"    Return the ID of the Sentinel instance.",
-"PENDING-SCRIPTS",
-"    Get pending scripts information.",
-"REMOVE <master-name>",
-"    Remove master from Sentinel's monitor list.",
-"REPLICAS <master-name>",
-"    Show a list of replicas for this master and their state.",
-"RESET <pattern>",
-"    Reset masters for specific master name matching this pattern.",
-"SENTINELS <master-name>",
-"    Show a list of Sentinel instances for this master and their state.",
-"SET <master-name> <option> <value>",
-"    Set configuration paramters for certain masters.",
-"SIMULATE-FAILURE (CRASH-AFTER-ELECTION|CRASH-AFTER-PROMOTION|HELP)",
-"    Simulate a Sentinel crash.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(c->argv[1]->ptr,"masters")) {
-        /* SENTINEL MASTERS */
-        if (c->argc != 2) goto numargserr;
-        addReplyDictOfRedisInstances(c,sentinel.masters);
-    } else if (!strcasecmp(c->argv[1]->ptr,"master")) {
-        /* SENTINEL MASTER <name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
-            == NULL) return;
-        addReplySentinelRedisInstance(c,ri);
-    } else if (!strcasecmp(c->argv[1]->ptr,"slaves") ||
-               !strcasecmp(c->argv[1]->ptr,"replicas"))
-    {
-        /* SENTINEL REPLICAS <master-name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
-            return;
-        addReplyDictOfRedisInstances(c,ri->slaves);
-    } else if (!strcasecmp(c->argv[1]->ptr,"sentinels")) {
-        /* SENTINEL SENTINELS <master-name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
-            return;
-        addReplyDictOfRedisInstances(c,ri->sentinels);
-    } else if (!strcasecmp(c->argv[1]->ptr,"myid") && c->argc == 2) {
-        /* SENTINEL MYID */
-        addReplyBulkCBuffer(c,sentinel.myid,CONFIG_RUN_ID_SIZE);
-    } else if (!strcasecmp(c->argv[1]->ptr,"is-master-down-by-addr")) {
-        /* SENTINEL IS-MASTER-DOWN-BY-ADDR <ip> <port> <current-epoch> <runid>
-         *
-         * Arguments:
-         *
-         * ip and port are the ip and port of the master we want to be
-         * checked by Sentinel. Note that the command will not check by
-         * name but just by master, in theory different Sentinels may monitor
-         * different masters with the same name.
-         *
-         * current-epoch is needed in order to understand if we are allowed
-         * to vote for a failover leader or not. Each Sentinel can vote just
-         * one time per epoch.
-         *
-         * runid is "*" if we are not seeking for a vote from the Sentinel
-         * in order to elect the failover leader. Otherwise it is set to the
-         * runid we want the Sentinel to vote if it did not already voted.
-         */
-        sentinelRedisInstance *ri;
-        long long req_epoch;
-        uint64_t leader_epoch = 0;
-        char *leader = NULL;
-        long port;
-        int isdown = 0;
-
-        if (c->argc != 6) goto numargserr;
-        if (getLongFromObjectOrReply(c,c->argv[3],&port,NULL) != C_OK ||
-            getLongLongFromObjectOrReply(c,c->argv[4],&req_epoch,NULL)
-                                                              != C_OK)
-            return;
-        ri = getSentinelRedisInstanceByAddrAndRunID(sentinel.masters,
-            c->argv[2]->ptr,port,NULL);
-
-        /* It exists? Is actually a master? Is subjectively down? It's down.
-         * Note: if we are in tilt mode we always reply with "0". */
-        if (!sentinel.tilt && ri && (ri->flags & SRI_S_DOWN) &&
-                                    (ri->flags & SRI_MASTER))
-            isdown = 1;
-
-        /* Vote for the master (or fetch the previous vote) if the request
-         * includes a runid, otherwise the sender is not seeking for a vote. */
-        if (ri && ri->flags & SRI_MASTER && strcasecmp(c->argv[5]->ptr,"*")) {
-            leader = sentinelVoteLeader(ri,(uint64_t)req_epoch,
-                                            c->argv[5]->ptr,
-                                            &leader_epoch);
-        }
-
-        /* Reply with a three-elements multi-bulk reply:
-         * down state, leader, vote epoch. */
-        addReplyArrayLen(c,3);
-        addReply(c, isdown ? shared.cone : shared.czero);
-        addReplyBulkCString(c, leader ? leader : "*");
-        addReplyLongLong(c, (long long)leader_epoch);
-        if (leader) sdsfree(leader);
-    } else if (!strcasecmp(c->argv[1]->ptr,"reset")) {
-        /* SENTINEL RESET <pattern> */
-        if (c->argc != 3) goto numargserr;
-        addReplyLongLong(c,sentinelResetMastersByPattern(c->argv[2]->ptr,SENTINEL_GENERATE_EVENT));
-    } else if (!strcasecmp(c->argv[1]->ptr,"get-master-addr-by-name")) {
-        /* SENTINEL GET-MASTER-ADDR-BY-NAME <master-name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        ri = sentinelGetMasterByName(c->argv[2]->ptr);
-        if (ri == NULL) {
-            addReplyNullArray(c);
-        } else {
-            sentinelAddr *addr = sentinelGetCurrentMasterAddress(ri);
-
-            addReplyArrayLen(c,2);
-            addReplyBulkCString(c,announceSentinelAddr(addr));
-            addReplyBulkLongLong(c,addr->port);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"failover")) {
-        /* SENTINEL FAILOVER <master-name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2])) == NULL)
-            return;
-        if (ri->flags & SRI_FAILOVER_IN_PROGRESS) {
-            addReplySds(c,sdsnew("-INPROG Failover already in progress\r\n"));
-            return;
-        }
-        if (sentinelSelectSlave(ri) == NULL) {
-            addReplySds(c,sdsnew("-NOGOODSLAVE No suitable replica to promote\r\n"));
-            return;
-        }
-        serverLog(LL_WARNING,"Executing user requested FAILOVER of '%s'",
-            ri->name);
-        sentinelStartFailover(ri);
-        ri->flags |= SRI_FORCE_FAILOVER;
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"pending-scripts")) {
-        /* SENTINEL PENDING-SCRIPTS */
-
-        if (c->argc != 2) goto numargserr;
-        sentinelPendingScriptsCommand(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"monitor")) {
-        /* SENTINEL MONITOR <name> <ip> <port> <quorum> */
-        sentinelRedisInstance *ri;
-        long quorum, port;
-        char ip[NET_IP_STR_LEN];
-
-        if (c->argc != 6) goto numargserr;
-        if (getLongFromObjectOrReply(c,c->argv[5],&quorum,"Invalid quorum")
-            != C_OK) return;
-        if (getLongFromObjectOrReply(c,c->argv[4],&port,"Invalid port")
-            != C_OK) return;
-
-        if (quorum <= 0) {
-            addReplyError(c, "Quorum must be 1 or greater.");
-            return;
-        }
-
-        /* If resolve-hostnames is used, actual DNS resolution may take place.
-         * Otherwise just validate address.
-         */
-        if (anetResolve(NULL,c->argv[3]->ptr,ip,sizeof(ip),
-                        sentinel.resolve_hostnames ? ANET_NONE : ANET_IP_ONLY) == ANET_ERR) {
-            addReplyError(c, "Invalid IP address or hostname specified");
-            return;
-        }
-
-        /* Parameters are valid. Try to create the master instance. */
-        ri = createSentinelRedisInstance(c->argv[2]->ptr,SRI_MASTER,
-                c->argv[3]->ptr,port,quorum,NULL);
-        if (ri == NULL) {
-            addReplyError(c,sentinelCheckCreateInstanceErrors(SRI_MASTER));
-        } else {
-            sentinelFlushConfig();
-            sentinelEvent(LL_WARNING,"+monitor",ri,"%@ quorum %d",ri->quorum);
-            addReply(c,shared.ok);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"flushconfig")) {
-        if (c->argc != 2) goto numargserr;
-        sentinelFlushConfig();
-        addReply(c,shared.ok);
-        return;
-    } else if (!strcasecmp(c->argv[1]->ptr,"remove")) {
-        /* SENTINEL REMOVE <name> */
-        sentinelRedisInstance *ri;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
-            == NULL) return;
-        sentinelEvent(LL_WARNING,"-monitor",ri,"%@");
-        dictDelete(sentinel.masters,c->argv[2]->ptr);
-        sentinelFlushConfig();
-        addReply(c,shared.ok);
-    } else if (!strcasecmp(c->argv[1]->ptr,"ckquorum")) {
-        /* SENTINEL CKQUORUM <name> */
-        sentinelRedisInstance *ri;
-        int usable;
-
-        if (c->argc != 3) goto numargserr;
-        if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
-            == NULL) return;
-        int result = sentinelIsQuorumReachable(ri,&usable);
-        if (result == SENTINEL_ISQR_OK) {
-            addReplySds(c, sdscatfmt(sdsempty(),
-                "+OK %i usable Sentinels. Quorum and failover authorization "
-                "can be reached\r\n",usable));
-        } else {
-            sds e = sdscatfmt(sdsempty(),
-                "-NOQUORUM %i usable Sentinels. ",usable);
-            if (result & SENTINEL_ISQR_NOQUORUM)
-                e = sdscat(e,"Not enough available Sentinels to reach the"
-                             " specified quorum for this master");
-            if (result & SENTINEL_ISQR_NOAUTH) {
-                if (result & SENTINEL_ISQR_NOQUORUM) e = sdscat(e,". ");
-                e = sdscat(e, "Not enough available Sentinels to reach the"
-                              " majority and authorize a failover");
-            }
-            e = sdscat(e,"\r\n");
-            addReplySds(c,e);
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr,"set")) {
-        if (c->argc < 3) goto numargserr;
-        sentinelSetCommand(c);
-    } else if (!strcasecmp(c->argv[1]->ptr,"config")) {
-        if (c->argc < 3) goto numargserr;
-        if (!strcasecmp(c->argv[2]->ptr,"set") && c->argc == 5)
-            sentinelConfigSetCommand(c);
-        else if (!strcasecmp(c->argv[2]->ptr,"get") && c->argc == 4)
-            sentinelConfigGetCommand(c);
-        else
-            addReplyError(c, "Only SENTINEL CONFIG GET <option> / SET <option> <value> are supported.");
-    } else if (!strcasecmp(c->argv[1]->ptr,"info-cache")) {
-        /* SENTINEL INFO-CACHE <name> */
-        if (c->argc < 2) goto numargserr;
-        mstime_t now = mstime();
-
-        /* Create an ad-hoc dictionary type so that we can iterate
-         * a dictionary composed of just the master groups the user
-         * requested. */
-        dictType copy_keeper = instancesDictType;
-        copy_keeper.valDestructor = NULL;
-        dict *masters_local = sentinel.masters;
-        if (c->argc > 2) {
-            masters_local = dictCreate(&copy_keeper, NULL);
-
-            for (int i = 2; i < c->argc; i++) {
-                sentinelRedisInstance *ri;
-                ri = sentinelGetMasterByName(c->argv[i]->ptr);
-                if (!ri) continue; /* ignore non-existing names */
-                dictAdd(masters_local, ri->name, ri);
-            }
-        }
-
-        /* Reply format:
-         *   1.) master name
-         *   2.) 1.) info from master
-         *       2.) info from replica
-         *       ...
-         *   3.) other master name
-         *   ...
-         */
-        addReplyArrayLen(c,dictSize(masters_local) * 2);
-
-        dictIterator  *di;
-        dictEntry *de;
-        di = dictGetIterator(masters_local);
-        while ((de = dictNext(di)) != NULL) {
-            sentinelRedisInstance *ri = dictGetVal(de);
-            addReplyBulkCBuffer(c,ri->name,strlen(ri->name));
-            addReplyArrayLen(c,dictSize(ri->slaves) + 1); /* +1 for self */
-            addReplyArrayLen(c,2);
-            addReplyLongLong(c,
-                ri->info_refresh ? (now - ri->info_refresh) : 0);
-            if (ri->info)
-                addReplyBulkCBuffer(c,ri->info,sdslen(ri->info));
-            else
-                addReplyNull(c);
-
-            dictIterator *sdi;
-            dictEntry *sde;
-            sdi = dictGetIterator(ri->slaves);
-            while ((sde = dictNext(sdi)) != NULL) {
-                sentinelRedisInstance *sri = dictGetVal(sde);
-                addReplyArrayLen(c,2);
-                addReplyLongLong(c,
-                    ri->info_refresh ? (now - sri->info_refresh) : 0);
-                if (sri->info)
-                    addReplyBulkCBuffer(c,sri->info,sdslen(sri->info));
-                else
-                    addReplyNull(c);
-            }
-            dictReleaseIterator(sdi);
-        }
-        dictReleaseIterator(di);
-        if (masters_local != sentinel.masters) dictRelease(masters_local);
-    } else if (!strcasecmp(c->argv[1]->ptr,"simulate-failure")) {
-        /* SENTINEL SIMULATE-FAILURE <flag> <flag> ... <flag> */
-        int j;
-
-        sentinel.simfailure_flags = SENTINEL_SIMFAILURE_NONE;
-        for (j = 2; j < c->argc; j++) {
-            if (!strcasecmp(c->argv[j]->ptr,"crash-after-election")) {
-                sentinel.simfailure_flags |=
-                    SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION;
-                serverLog(LL_WARNING,"Failure simulation: this Sentinel "
-                    "will crash after being successfully elected as failover "
-                    "leader");
-            } else if (!strcasecmp(c->argv[j]->ptr,"crash-after-promotion")) {
-                sentinel.simfailure_flags |=
-                    SENTINEL_SIMFAILURE_CRASH_AFTER_PROMOTION;
-                serverLog(LL_WARNING,"Failure simulation: this Sentinel "
-                    "will crash after promoting the selected replica to master");
-            } else if (!strcasecmp(c->argv[j]->ptr,"help")) {
-                addReplyArrayLen(c,2);
-                addReplyBulkCString(c,"crash-after-election");
-                addReplyBulkCString(c,"crash-after-promotion");
-            } else {
-                addReplyError(c,"Unknown failure simulation specified");
-                return;
-            }
-        }
-        addReply(c,shared.ok);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-    return;
-
-numargserr:
-    addReplyErrorFormat(c,"Wrong number of arguments for 'sentinel %s'",
-                          (char*)c->argv[1]->ptr);
-}
-
-#define info_section_from_redis(section_name) do { \
-    if (defsections || allsections || !strcasecmp(section,section_name)) { \
-        sds redissection; \
-        if (sections++) info = sdscat(info,"\r\n"); \
-        redissection = genRedisInfoString(section_name); \
-        info = sdscatlen(info,redissection,sdslen(redissection)); \
-        sdsfree(redissection); \
-    } \
-} while(0)
-
-/* SENTINEL INFO [section] */
-void sentinelInfoCommand(client *c) {
-    if (c->argc > 2) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    int defsections = 0, allsections = 0;
-    char *section = c->argc == 2 ? c->argv[1]->ptr : NULL;
-    if (section) {
-        allsections = !strcasecmp(section,"all");
-        defsections = !strcasecmp(section,"default");
-    } else {
-        defsections = 1;
-    }
-
-    int sections = 0;
-    sds info = sdsempty();
-
-    info_section_from_redis("server");
-    info_section_from_redis("clients");
-    info_section_from_redis("cpu");
-    info_section_from_redis("stats");
-
-    if (defsections || allsections || !strcasecmp(section,"sentinel")) {
-        dictIterator *di;
-        dictEntry *de;
-        int master_id = 0;
-
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-            "# Sentinel\r\n"
-            "sentinel_masters:%lu\r\n"
-            "sentinel_tilt:%d\r\n"
-            "sentinel_running_scripts:%d\r\n"
-            "sentinel_scripts_queue_length:%ld\r\n"
-            "sentinel_simulate_failure_flags:%lu\r\n",
-            dictSize(sentinel.masters),
-            sentinel.tilt,
-            sentinel.running_scripts,
-            listLength(sentinel.scripts_queue),
-            sentinel.simfailure_flags);
-
-        di = dictGetIterator(sentinel.masters);
-        while((de = dictNext(di)) != NULL) {
-            sentinelRedisInstance *ri = dictGetVal(de);
-            char *status = "ok";
-
-            if (ri->flags & SRI_O_DOWN) status = "odown";
-            else if (ri->flags & SRI_S_DOWN) status = "sdown";
-            info = sdscatprintf(info,
-                "master%d:name=%s,status=%s,address=%s:%d,"
-                "slaves=%lu,sentinels=%lu\r\n",
-                master_id++, ri->name, status,
-                announceSentinelAddr(ri->addr), ri->addr->port,
-                dictSize(ri->slaves),
-                dictSize(ri->sentinels)+1);
-        }
-        dictReleaseIterator(di);
-    }
-
-    addReplyBulkSds(c, info);
-}
-
-/* Implements Sentinel version of the ROLE command. The output is
- * "sentinel" and the list of currently monitored master names. */
-void sentinelRoleCommand(client *c) {
-    dictIterator *di;
-    dictEntry *de;
-
-    addReplyArrayLen(c,2);
-    addReplyBulkCBuffer(c,"sentinel",8);
-    addReplyArrayLen(c,dictSize(sentinel.masters));
-
-    di = dictGetIterator(sentinel.masters);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        addReplyBulkCString(c,ri->name);
-    }
-    dictReleaseIterator(di);
-}
-
-/* SENTINEL SET <mastername> [<option> <value> ...] */
-void sentinelSetCommand(client *c) {
-    sentinelRedisInstance *ri;
-    int j, changes = 0;
-    int badarg = 0; /* Bad argument position for error reporting. */
-    char *option;
-
-    if ((ri = sentinelGetMasterByNameOrReplyError(c,c->argv[2]))
-        == NULL) return;
-
-    /* Process option - value pairs. */
-    for (j = 3; j < c->argc; j++) {
-        int moreargs = (c->argc-1) - j;
-        option = c->argv[j]->ptr;
-        long long ll;
-        int old_j = j; /* Used to know what to log as an event. */
-
-        if (!strcasecmp(option,"down-after-milliseconds") && moreargs > 0) {
-            /* down-after-millisecodns <milliseconds> */
-            robj *o = c->argv[++j];
-            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
-                badarg = j;
-                goto badfmt;
-            }
-            ri->down_after_period = ll;
-            sentinelPropagateDownAfterPeriod(ri);
-            changes++;
-        } else if (!strcasecmp(option,"failover-timeout") && moreargs > 0) {
-            /* failover-timeout <milliseconds> */
-            robj *o = c->argv[++j];
-            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
-                badarg = j;
-                goto badfmt;
-            }
-            ri->failover_timeout = ll;
-            changes++;
-        } else if (!strcasecmp(option,"parallel-syncs") && moreargs > 0) {
-            /* parallel-syncs <milliseconds> */
-            robj *o = c->argv[++j];
-            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
-                badarg = j;
-                goto badfmt;
-            }
-            ri->parallel_syncs = ll;
-            changes++;
-        } else if (!strcasecmp(option,"notification-script") && moreargs > 0) {
-            /* notification-script <path> */
-            char *value = c->argv[++j]->ptr;
-            if (sentinel.deny_scripts_reconfig) {
-                addReplyError(c,
-                    "Reconfiguration of scripts path is denied for "
-                    "security reasons. Check the deny-scripts-reconfig "
-                    "configuration directive in your Sentinel configuration");
-                goto seterr;
-            }
-
-            if (strlen(value) && access(value,X_OK) == -1) {
-                addReplyError(c,
-                    "Notification script seems non existing or non executable");
-                goto seterr;
-            }
-            sdsfree(ri->notification_script);
-            ri->notification_script = strlen(value) ? sdsnew(value) : NULL;
-            changes++;
-        } else if (!strcasecmp(option,"client-reconfig-script") && moreargs > 0) {
-            /* client-reconfig-script <path> */
-            char *value = c->argv[++j]->ptr;
-            if (sentinel.deny_scripts_reconfig) {
-                addReplyError(c,
-                    "Reconfiguration of scripts path is denied for "
-                    "security reasons. Check the deny-scripts-reconfig "
-                    "configuration directive in your Sentinel configuration");
-                goto seterr;
-            }
-
-            if (strlen(value) && access(value,X_OK) == -1) {
-                addReplyError(c,
-                    "Client reconfiguration script seems non existing or "
-                    "non executable");
-                goto seterr;
-            }
-            sdsfree(ri->client_reconfig_script);
-            ri->client_reconfig_script = strlen(value) ? sdsnew(value) : NULL;
-            changes++;
-        } else if (!strcasecmp(option,"auth-pass") && moreargs > 0) {
-            /* auth-pass <password> */
-            char *value = c->argv[++j]->ptr;
-            sdsfree(ri->auth_pass);
-            ri->auth_pass = strlen(value) ? sdsnew(value) : NULL;
-            changes++;
-        } else if (!strcasecmp(option,"auth-user") && moreargs > 0) {
-            /* auth-user <username> */
-            char *value = c->argv[++j]->ptr;
-            sdsfree(ri->auth_user);
-            ri->auth_user = strlen(value) ? sdsnew(value) : NULL;
-            changes++;
-        } else if (!strcasecmp(option,"quorum") && moreargs > 0) {
-            /* quorum <count> */
-            robj *o = c->argv[++j];
-            if (getLongLongFromObject(o,&ll) == C_ERR || ll <= 0) {
-                badarg = j;
-                goto badfmt;
-            }
-            ri->quorum = ll;
-            changes++;
-        } else if (!strcasecmp(option,"rename-command") && moreargs > 1) {
-            /* rename-command <oldname> <newname> */
-            sds oldname = c->argv[++j]->ptr;
-            sds newname = c->argv[++j]->ptr;
-
-            if ((sdslen(oldname) == 0) || (sdslen(newname) == 0)) {
-                badarg = sdslen(newname) ? j-1 : j;
-                goto badfmt;
-            }
-
-            /* Remove any older renaming for this command. */
-            dictDelete(ri->renamed_commands,oldname);
-
-            /* If the target name is the same as the source name there
-             * is no need to add an entry mapping to itself. */
-            if (!dictSdsKeyCaseCompare(NULL,oldname,newname)) {
-                oldname = sdsdup(oldname);
-                newname = sdsdup(newname);
-                dictAdd(ri->renamed_commands,oldname,newname);
-            }
-            changes++;
-        } else {
-            addReplyErrorFormat(c,"Unknown option or number of arguments for "
-                                  "SENTINEL SET '%s'", option);
-            goto seterr;
-        }
-
-        /* Log the event. */
-        int numargs = j-old_j+1;
-        switch(numargs) {
-        case 2:
-            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s %s",(char*)c->argv[old_j]->ptr,
-                                                          (char*)c->argv[old_j+1]->ptr);
-            break;
-        case 3:
-            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s %s %s",(char*)c->argv[old_j]->ptr,
-                                                             (char*)c->argv[old_j+1]->ptr,
-                                                             (char*)c->argv[old_j+2]->ptr);
-            break;
-        default:
-            sentinelEvent(LL_WARNING,"+set",ri,"%@ %s",(char*)c->argv[old_j]->ptr);
-            break;
-        }
-    }
-
-    if (changes) sentinelFlushConfig();
-    addReply(c,shared.ok);
-    return;
-
-badfmt: /* Bad format errors */
-    addReplyErrorFormat(c,"Invalid argument '%s' for SENTINEL SET '%s'",
-        (char*)c->argv[badarg]->ptr,option);
-seterr:
-    if (changes) sentinelFlushConfig();
-    return;
-}
-
-/* Our fake PUBLISH command: it is actually useful only to receive hello messages
- * from the other sentinel instances, and publishing to a channel other than
- * SENTINEL_HELLO_CHANNEL is forbidden.
- *
- * Because we have a Sentinel PUBLISH, the code to send hello messages is the same
- * for all the three kind of instances: masters, slaves, sentinels. */
-void sentinelPublishCommand(client *c) {
-    if (strcmp(c->argv[1]->ptr,SENTINEL_HELLO_CHANNEL)) {
-        addReplyError(c, "Only HELLO messages are accepted by Sentinel instances.");
-        return;
-    }
-    sentinelProcessHelloMessage(c->argv[2]->ptr,sdslen(c->argv[2]->ptr));
-    addReplyLongLong(c,1);
-}
-
-/* ===================== SENTINEL availability checks ======================= */
-
-/* Is this instance down from our point of view? */
-void sentinelCheckSubjectivelyDown(sentinelRedisInstance *ri) {
-    mstime_t elapsed = 0;
-
-    if (ri->link->act_ping_time)
-        elapsed = mstime() - ri->link->act_ping_time;
-    else if (ri->link->disconnected)
-        elapsed = mstime() - ri->link->last_avail_time;
-
-    /* Check if we are in need for a reconnection of one of the
-     * links, because we are detecting low activity.
-     *
-     * 1) Check if the command link seems connected, was connected not less
-     *    than SENTINEL_MIN_LINK_RECONNECT_PERIOD, but still we have a
-     *    pending ping for more than half the timeout. */
-    if (ri->link->cc &&
-        (mstime() - ri->link->cc_conn_time) >
-        SENTINEL_MIN_LINK_RECONNECT_PERIOD &&
-        ri->link->act_ping_time != 0 && /* There is a pending ping... */
-        /* The pending ping is delayed, and we did not receive
-         * error replies as well. */
-        (mstime() - ri->link->act_ping_time) > (ri->down_after_period/2) &&
-        (mstime() - ri->link->last_pong_time) > (ri->down_after_period/2))
-    {
-        instanceLinkCloseConnection(ri->link,ri->link->cc);
-    }
-
-    /* 2) Check if the pubsub link seems connected, was connected not less
-     *    than SENTINEL_MIN_LINK_RECONNECT_PERIOD, but still we have no
-     *    activity in the Pub/Sub channel for more than
-     *    SENTINEL_PUBLISH_PERIOD * 3.
-     */
-    if (ri->link->pc &&
-        (mstime() - ri->link->pc_conn_time) >
-         SENTINEL_MIN_LINK_RECONNECT_PERIOD &&
-        (mstime() - ri->link->pc_last_activity) > (SENTINEL_PUBLISH_PERIOD*3))
-    {
-        instanceLinkCloseConnection(ri->link,ri->link->pc);
-    }
-
-    /* Update the SDOWN flag. We believe the instance is SDOWN if:
-     *
-     * 1) It is not replying.
-     * 2) We believe it is a master, it reports to be a slave for enough time
-     *    to meet the down_after_period, plus enough time to get two times
-     *    INFO report from the instance. */
-    if (elapsed > ri->down_after_period ||
-        (ri->flags & SRI_MASTER &&
-         ri->role_reported == SRI_SLAVE &&
-         mstime() - ri->role_reported_time >
-          (ri->down_after_period+SENTINEL_INFO_PERIOD*2)))
-    {
-        /* Is subjectively down */
-        if ((ri->flags & SRI_S_DOWN) == 0) {
-            sentinelEvent(LL_WARNING,"+sdown",ri,"%@");
-            ri->s_down_since_time = mstime();
-            ri->flags |= SRI_S_DOWN;
-        }
-    } else {
-        /* Is subjectively up */
-        if (ri->flags & SRI_S_DOWN) {
-            sentinelEvent(LL_WARNING,"-sdown",ri,"%@");
-            ri->flags &= ~(SRI_S_DOWN|SRI_SCRIPT_KILL_SENT);
-        }
-    }
-}
-
-/* Is this instance down according to the configured quorum?
- *
- * Note that ODOWN is a weak quorum, it only means that enough Sentinels
- * reported in a given time range that the instance was not reachable.
- * However messages can be delayed so there are no strong guarantees about
- * N instances agreeing at the same time about the down state. */
-void sentinelCheckObjectivelyDown(sentinelRedisInstance *master) {
-    dictIterator *di;
-    dictEntry *de;
-    unsigned int quorum = 0, odown = 0;
-
-    if (master->flags & SRI_S_DOWN) {
-        /* Is down for enough sentinels? */
-        quorum = 1; /* the current sentinel. */
-        /* Count all the other sentinels. */
-        di = dictGetIterator(master->sentinels);
-        while((de = dictNext(di)) != NULL) {
-            sentinelRedisInstance *ri = dictGetVal(de);
-
-            if (ri->flags & SRI_MASTER_DOWN) quorum++;
-        }
-        dictReleaseIterator(di);
-        if (quorum >= master->quorum) odown = 1;
-    }
-
-    /* Set the flag accordingly to the outcome. */
-    if (odown) {
-        if ((master->flags & SRI_O_DOWN) == 0) {
-            sentinelEvent(LL_WARNING,"+odown",master,"%@ #quorum %d/%d",
-                quorum, master->quorum);
-            master->flags |= SRI_O_DOWN;
-            master->o_down_since_time = mstime();
-        }
-    } else {
-        if (master->flags & SRI_O_DOWN) {
-            sentinelEvent(LL_WARNING,"-odown",master,"%@");
-            master->flags &= ~SRI_O_DOWN;
-        }
-    }
-}
-
-/* Receive the SENTINEL is-master-down-by-addr reply, see the
- * sentinelAskMasterStateToOtherSentinels() function for more information. */
-void sentinelReceiveIsMasterDownReply(redisAsyncContext *c, void *reply, void *privdata) {
-    sentinelRedisInstance *ri = privdata;
-    instanceLink *link = c->data;
-    redisReply *r;
-
-    if (!reply || !link) return;
-    link->pending_commands--;
-    r = reply;
-
-    /* Ignore every error or unexpected reply.
-     * Note that if the command returns an error for any reason we'll
-     * end clearing the SRI_MASTER_DOWN flag for timeout anyway. */
-    if (r->type == REDIS_REPLY_ARRAY && r->elements == 3 &&
-        r->element[0]->type == REDIS_REPLY_INTEGER &&
-        r->element[1]->type == REDIS_REPLY_STRING &&
-        r->element[2]->type == REDIS_REPLY_INTEGER)
-    {
-        ri->last_master_down_reply_time = mstime();
-        if (r->element[0]->integer == 1) {
-            ri->flags |= SRI_MASTER_DOWN;
-        } else {
-            ri->flags &= ~SRI_MASTER_DOWN;
-        }
-        if (strcmp(r->element[1]->str,"*")) {
-            /* If the runid in the reply is not "*" the Sentinel actually
-             * replied with a vote. */
-            sdsfree(ri->leader);
-            if ((long long)ri->leader_epoch != r->element[2]->integer)
-                serverLog(LL_WARNING,
-                    "%s voted for %s %llu", ri->name,
-                    r->element[1]->str,
-                    (unsigned long long) r->element[2]->integer);
-            ri->leader = sdsnew(r->element[1]->str);
-            ri->leader_epoch = r->element[2]->integer;
-        }
-    }
-}
-
-/* If we think the master is down, we start sending
- * SENTINEL IS-MASTER-DOWN-BY-ADDR requests to other sentinels
- * in order to get the replies that allow to reach the quorum
- * needed to mark the master in ODOWN state and trigger a failover. */
-#define SENTINEL_ASK_FORCED (1<<0)
-void sentinelAskMasterStateToOtherSentinels(sentinelRedisInstance *master, int flags) {
-    dictIterator *di;
-    dictEntry *de;
-
-    di = dictGetIterator(master->sentinels);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        mstime_t elapsed = mstime() - ri->last_master_down_reply_time;
-        char port[32];
-        int retval;
-
-        /* If the master state from other sentinel is too old, we clear it. */
-        if (elapsed > SENTINEL_ASK_PERIOD*5) {
-            ri->flags &= ~SRI_MASTER_DOWN;
-            sdsfree(ri->leader);
-            ri->leader = NULL;
-        }
-
-        /* Only ask if master is down to other sentinels if:
-         *
-         * 1) We believe it is down, or there is a failover in progress.
-         * 2) Sentinel is connected.
-         * 3) We did not receive the info within SENTINEL_ASK_PERIOD ms. */
-        if ((master->flags & SRI_S_DOWN) == 0) continue;
-        if (ri->link->disconnected) continue;
-        if (!(flags & SENTINEL_ASK_FORCED) &&
-            mstime() - ri->last_master_down_reply_time < SENTINEL_ASK_PERIOD)
-            continue;
-
-        /* Ask */
-        ll2string(port,sizeof(port),master->addr->port);
-        retval = redisAsyncCommand(ri->link->cc,
-                    sentinelReceiveIsMasterDownReply, ri,
-                    "%s is-master-down-by-addr %s %s %llu %s",
-                    sentinelInstanceMapCommand(ri,"SENTINEL"),
-                    announceSentinelAddr(master->addr), port,
-                    sentinel.current_epoch,
-                    (master->failover_state > SENTINEL_FAILOVER_STATE_NONE) ?
-                    sentinel.myid : "*");
-        if (retval == C_OK) ri->link->pending_commands++;
-    }
-    dictReleaseIterator(di);
-}
-
-/* =============================== FAILOVER ================================= */
-
-/* Crash because of user request via SENTINEL simulate-failure command. */
-void sentinelSimFailureCrash(void) {
-    serverLog(LL_WARNING,
-        "Sentinel CRASH because of SENTINEL simulate-failure");
-    exit(99);
-}
-
-/* Vote for the sentinel with 'req_runid' or return the old vote if already
- * voted for the specified 'req_epoch' or one greater.
- *
- * If a vote is not available returns NULL, otherwise return the Sentinel
- * runid and populate the leader_epoch with the epoch of the vote. */
-char *sentinelVoteLeader(sentinelRedisInstance *master, uint64_t req_epoch, char *req_runid, uint64_t *leader_epoch) {
-    if (req_epoch > sentinel.current_epoch) {
-        sentinel.current_epoch = req_epoch;
-        sentinelFlushConfig();
-        sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
-            (unsigned long long) sentinel.current_epoch);
-    }
-
-    if (master->leader_epoch < req_epoch && sentinel.current_epoch <= req_epoch)
-    {
-        sdsfree(master->leader);
-        master->leader = sdsnew(req_runid);
-        master->leader_epoch = sentinel.current_epoch;
-        sentinelFlushConfig();
-        sentinelEvent(LL_WARNING,"+vote-for-leader",master,"%s %llu",
-            master->leader, (unsigned long long) master->leader_epoch);
-        /* If we did not voted for ourselves, set the master failover start
-         * time to now, in order to force a delay before we can start a
-         * failover for the same master. */
-        if (strcasecmp(master->leader,sentinel.myid))
-            master->failover_start_time = mstime()+rand()%SENTINEL_MAX_DESYNC;
-    }
-
-    *leader_epoch = master->leader_epoch;
-    return master->leader ? sdsnew(master->leader) : NULL;
-}
-
-struct sentinelLeader {
-    char *runid;
-    unsigned long votes;
-};
-
-/* Helper function for sentinelGetLeader, increment the counter
- * relative to the specified runid. */
-int sentinelLeaderIncr(dict *counters, char *runid) {
-    dictEntry *existing, *de;
-    uint64_t oldval;
-
-    de = dictAddRaw(counters,runid,&existing);
-    if (existing) {
-        oldval = dictGetUnsignedIntegerVal(existing);
-        dictSetUnsignedIntegerVal(existing,oldval+1);
-        return oldval+1;
-    } else {
-        serverAssert(de != NULL);
-        dictSetUnsignedIntegerVal(de,1);
-        return 1;
-    }
-}
-
-/* Scan all the Sentinels attached to this master to check if there
- * is a leader for the specified epoch.
- *
- * To be a leader for a given epoch, we should have the majority of
- * the Sentinels we know (ever seen since the last SENTINEL RESET) that
- * reported the same instance as leader for the same epoch. */
-char *sentinelGetLeader(sentinelRedisInstance *master, uint64_t epoch) {
-    dict *counters;
-    dictIterator *di;
-    dictEntry *de;
-    unsigned int voters = 0, voters_quorum;
-    char *myvote;
-    char *winner = NULL;
-    uint64_t leader_epoch;
-    uint64_t max_votes = 0;
-
-    serverAssert(master->flags & (SRI_O_DOWN|SRI_FAILOVER_IN_PROGRESS));
-    counters = dictCreate(&leaderVotesDictType,NULL);
-
-    voters = dictSize(master->sentinels)+1; /* All the other sentinels and me.*/
-
-    /* Count other sentinels votes */
-    di = dictGetIterator(master->sentinels);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-        if (ri->leader != NULL && ri->leader_epoch == sentinel.current_epoch)
-            sentinelLeaderIncr(counters,ri->leader);
-    }
-    dictReleaseIterator(di);
-
-    /* Check what's the winner. For the winner to win, it needs two conditions:
-     * 1) Absolute majority between voters (50% + 1).
-     * 2) And anyway at least master->quorum votes. */
-    di = dictGetIterator(counters);
-    while((de = dictNext(di)) != NULL) {
-        uint64_t votes = dictGetUnsignedIntegerVal(de);
-
-        if (votes > max_votes) {
-            max_votes = votes;
-            winner = dictGetKey(de);
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Count this Sentinel vote:
-     * if this Sentinel did not voted yet, either vote for the most
-     * common voted sentinel, or for itself if no vote exists at all. */
-    if (winner)
-        myvote = sentinelVoteLeader(master,epoch,winner,&leader_epoch);
-    else
-        myvote = sentinelVoteLeader(master,epoch,sentinel.myid,&leader_epoch);
-
-    if (myvote && leader_epoch == epoch) {
-        uint64_t votes = sentinelLeaderIncr(counters,myvote);
-
-        if (votes > max_votes) {
-            max_votes = votes;
-            winner = myvote;
-        }
-    }
-
-    voters_quorum = voters/2+1;
-    if (winner && (max_votes < voters_quorum || max_votes < master->quorum))
-        winner = NULL;
-
-    winner = winner ? sdsnew(winner) : NULL;
-    sdsfree(myvote);
-    dictRelease(counters);
-    return winner;
-}
-
-/* Send SLAVEOF to the specified instance, always followed by a
- * CONFIG REWRITE command in order to store the new configuration on disk
- * when possible (that is, if the Redis instance is recent enough to support
- * config rewriting, and if the server was started with a configuration file).
- *
- * If Host is NULL the function sends "SLAVEOF NO ONE".
- *
- * The command returns C_OK if the SLAVEOF command was accepted for
- * (later) delivery otherwise C_ERR. The command replies are just
- * discarded. */
-int sentinelSendSlaveOf(sentinelRedisInstance *ri, const sentinelAddr *addr) {
-    char portstr[32];
-    const char *host;
-    int retval;
-
-    /* If host is NULL we send SLAVEOF NO ONE that will turn the instance
-    * into a master. */
-    if (!addr) {
-        host = "NO";
-        memcpy(portstr,"ONE",4);
-    } else {
-        host = announceSentinelAddr(addr);
-        ll2string(portstr,sizeof(portstr),addr->port);
-    }
-
-    /* In order to send SLAVEOF in a safe way, we send a transaction performing
-     * the following tasks:
-     * 1) Reconfigure the instance according to the specified host/port params.
-     * 2) Rewrite the configuration.
-     * 3) Disconnect all clients (but this one sending the command) in order
-     *    to trigger the ask-master-on-reconnection protocol for connected
-     *    clients.
-     *
-     * Note that we don't check the replies returned by commands, since we
-     * will observe instead the effects in the next INFO output. */
-    retval = redisAsyncCommand(ri->link->cc,
-        sentinelDiscardReplyCallback, ri, "%s",
-        sentinelInstanceMapCommand(ri,"MULTI"));
-    if (retval == C_ERR) return retval;
-    ri->link->pending_commands++;
-
-    retval = redisAsyncCommand(ri->link->cc,
-        sentinelDiscardReplyCallback, ri, "%s %s %s",
-        sentinelInstanceMapCommand(ri,"SLAVEOF"),
-        host, portstr);
-    if (retval == C_ERR) return retval;
-    ri->link->pending_commands++;
-
-    retval = redisAsyncCommand(ri->link->cc,
-        sentinelDiscardReplyCallback, ri, "%s REWRITE",
-        sentinelInstanceMapCommand(ri,"CONFIG"));
-    if (retval == C_ERR) return retval;
-    ri->link->pending_commands++;
-
-    /* CLIENT KILL TYPE <type> is only supported starting from Redis 2.8.12,
-     * however sending it to an instance not understanding this command is not
-     * an issue because CLIENT is variadic command, so Redis will not
-     * recognized as a syntax error, and the transaction will not fail (but
-     * only the unsupported command will fail). */
-    for (int type = 0; type < 2; type++) {
-        retval = redisAsyncCommand(ri->link->cc,
-            sentinelDiscardReplyCallback, ri, "%s KILL TYPE %s",
-            sentinelInstanceMapCommand(ri,"CLIENT"),
-            type == 0 ? "normal" : "pubsub");
-        if (retval == C_ERR) return retval;
-        ri->link->pending_commands++;
-    }
-
-    retval = redisAsyncCommand(ri->link->cc,
-        sentinelDiscardReplyCallback, ri, "%s",
-        sentinelInstanceMapCommand(ri,"EXEC"));
-    if (retval == C_ERR) return retval;
-    ri->link->pending_commands++;
-
-    return C_OK;
-}
-
-/* Setup the master state to start a failover. */
-void sentinelStartFailover(sentinelRedisInstance *master) {
-    serverAssert(master->flags & SRI_MASTER);
-
-    master->failover_state = SENTINEL_FAILOVER_STATE_WAIT_START;
-    master->flags |= SRI_FAILOVER_IN_PROGRESS;
-    master->failover_epoch = ++sentinel.current_epoch;
-    sentinelEvent(LL_WARNING,"+new-epoch",master,"%llu",
-        (unsigned long long) sentinel.current_epoch);
-    sentinelEvent(LL_WARNING,"+try-failover",master,"%@");
-    master->failover_start_time = mstime()+rand()%SENTINEL_MAX_DESYNC;
-    master->failover_state_change_time = mstime();
-}
-
-/* This function checks if there are the conditions to start the failover,
- * that is:
- *
- * 1) Master must be in ODOWN condition.
- * 2) No failover already in progress.
- * 3) No failover already attempted recently.
- *
- * We still don't know if we'll win the election so it is possible that we
- * start the failover but that we'll not be able to act.
- *
- * Return non-zero if a failover was started. */
-int sentinelStartFailoverIfNeeded(sentinelRedisInstance *master) {
-    /* We can't failover if the master is not in O_DOWN state. */
-    if (!(master->flags & SRI_O_DOWN)) return 0;
-
-    /* Failover already in progress? */
-    if (master->flags & SRI_FAILOVER_IN_PROGRESS) return 0;
-
-    /* Last failover attempt started too little time ago? */
-    if (mstime() - master->failover_start_time <
-        master->failover_timeout*2)
-    {
-        if (master->failover_delay_logged != master->failover_start_time) {
-            time_t clock = (master->failover_start_time +
-                            master->failover_timeout*2) / 1000;
-            char ctimebuf[26];
-
-            ctime_r(&clock,ctimebuf);
-            ctimebuf[24] = '\0'; /* Remove newline. */
-            master->failover_delay_logged = master->failover_start_time;
-            serverLog(LL_WARNING,
-                "Next failover delay: I will not start a failover before %s",
-                ctimebuf);
-        }
-        return 0;
-    }
-
-    sentinelStartFailover(master);
-    return 1;
-}
-
-/* Select a suitable slave to promote. The current algorithm only uses
- * the following parameters:
- *
- * 1) None of the following conditions: S_DOWN, O_DOWN, DISCONNECTED.
- * 2) Last time the slave replied to ping no more than 5 times the PING period.
- * 3) info_refresh not older than 3 times the INFO refresh period.
- * 4) master_link_down_time no more than:
- *     (now - master->s_down_since_time) + (master->down_after_period * 10).
- *    Basically since the master is down from our POV, the slave reports
- *    to be disconnected no more than 10 times the configured down-after-period.
- *    This is pretty much black magic but the idea is, the master was not
- *    available so the slave may be lagging, but not over a certain time.
- *    Anyway we'll select the best slave according to replication offset.
- * 5) Slave priority can't be zero, otherwise the slave is discarded.
- *
- * Among all the slaves matching the above conditions we select the slave
- * with, in order of sorting key:
- *
- * - lower slave_priority.
- * - bigger processed replication offset.
- * - lexicographically smaller runid.
- *
- * Basically if runid is the same, the slave that processed more commands
- * from the master is selected.
- *
- * The function returns the pointer to the selected slave, otherwise
- * NULL if no suitable slave was found.
- */
-
-/* Helper for sentinelSelectSlave(). This is used by qsort() in order to
- * sort suitable slaves in a "better first" order, to take the first of
- * the list. */
-int compareSlavesForPromotion(const void *a, const void *b) {
-    sentinelRedisInstance **sa = (sentinelRedisInstance **)a,
-                          **sb = (sentinelRedisInstance **)b;
-    char *sa_runid, *sb_runid;
-
-    if ((*sa)->slave_priority != (*sb)->slave_priority)
-        return (*sa)->slave_priority - (*sb)->slave_priority;
-
-    /* If priority is the same, select the slave with greater replication
-     * offset (processed more data from the master). */
-    if ((*sa)->slave_repl_offset > (*sb)->slave_repl_offset) {
-        return -1; /* a < b */
-    } else if ((*sa)->slave_repl_offset < (*sb)->slave_repl_offset) {
-        return 1; /* a > b */
-    }
-
-    /* If the replication offset is the same select the slave with that has
-     * the lexicographically smaller runid. Note that we try to handle runid
-     * == NULL as there are old Redis versions that don't publish runid in
-     * INFO. A NULL runid is considered bigger than any other runid. */
-    sa_runid = (*sa)->runid;
-    sb_runid = (*sb)->runid;
-    if (sa_runid == NULL && sb_runid == NULL) return 0;
-    else if (sa_runid == NULL) return 1;  /* a > b */
-    else if (sb_runid == NULL) return -1; /* a < b */
-    return strcasecmp(sa_runid, sb_runid);
-}
-
-sentinelRedisInstance *sentinelSelectSlave(sentinelRedisInstance *master) {
-    sentinelRedisInstance **instance =
-        zmalloc(sizeof(instance[0])*dictSize(master->slaves));
-    sentinelRedisInstance *selected = NULL;
-    int instances = 0;
-    dictIterator *di;
-    dictEntry *de;
-    mstime_t max_master_down_time = 0;
-
-    if (master->flags & SRI_S_DOWN)
-        max_master_down_time += mstime() - master->s_down_since_time;
-    max_master_down_time += master->down_after_period * 10;
-
-    di = dictGetIterator(master->slaves);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *slave = dictGetVal(de);
-        mstime_t info_validity_time;
-
-        if (slave->flags & (SRI_S_DOWN|SRI_O_DOWN)) continue;
-        if (slave->link->disconnected) continue;
-        if (mstime() - slave->link->last_avail_time > SENTINEL_PING_PERIOD*5) continue;
-        if (slave->slave_priority == 0) continue;
-
-        /* If the master is in SDOWN state we get INFO for slaves every second.
-         * Otherwise we get it with the usual period so we need to account for
-         * a larger delay. */
-        if (master->flags & SRI_S_DOWN)
-            info_validity_time = SENTINEL_PING_PERIOD*5;
-        else
-            info_validity_time = SENTINEL_INFO_PERIOD*3;
-        if (mstime() - slave->info_refresh > info_validity_time) continue;
-        if (slave->master_link_down_time > max_master_down_time) continue;
-        instance[instances++] = slave;
-    }
-    dictReleaseIterator(di);
-    if (instances) {
-        qsort(instance,instances,sizeof(sentinelRedisInstance*),
-            compareSlavesForPromotion);
-        selected = instance[0];
-    }
-    zfree(instance);
-    return selected;
-}
-
-/* ---------------- Failover state machine implementation ------------------- */
-void sentinelFailoverWaitStart(sentinelRedisInstance *ri) {
-    char *leader;
-    int isleader;
-
-    /* Check if we are the leader for the failover epoch. */
-    leader = sentinelGetLeader(ri, ri->failover_epoch);
-    isleader = leader && strcasecmp(leader,sentinel.myid) == 0;
-    sdsfree(leader);
-
-    /* If I'm not the leader, and it is not a forced failover via
-     * SENTINEL FAILOVER, then I can't continue with the failover. */
-    if (!isleader && !(ri->flags & SRI_FORCE_FAILOVER)) {
-        int election_timeout = SENTINEL_ELECTION_TIMEOUT;
-
-        /* The election timeout is the MIN between SENTINEL_ELECTION_TIMEOUT
-         * and the configured failover timeout. */
-        if (election_timeout > ri->failover_timeout)
-            election_timeout = ri->failover_timeout;
-        /* Abort the failover if I'm not the leader after some time. */
-        if (mstime() - ri->failover_start_time > election_timeout) {
-            sentinelEvent(LL_WARNING,"-failover-abort-not-elected",ri,"%@");
-            sentinelAbortFailover(ri);
-        }
-        return;
-    }
-    sentinelEvent(LL_WARNING,"+elected-leader",ri,"%@");
-    if (sentinel.simfailure_flags & SENTINEL_SIMFAILURE_CRASH_AFTER_ELECTION)
-        sentinelSimFailureCrash();
-    ri->failover_state = SENTINEL_FAILOVER_STATE_SELECT_SLAVE;
-    ri->failover_state_change_time = mstime();
-    sentinelEvent(LL_WARNING,"+failover-state-select-slave",ri,"%@");
-}
-
-void sentinelFailoverSelectSlave(sentinelRedisInstance *ri) {
-    sentinelRedisInstance *slave = sentinelSelectSlave(ri);
-
-    /* We don't handle the timeout in this state as the function aborts
-     * the failover or go forward in the next state. */
-    if (slave == NULL) {
-        sentinelEvent(LL_WARNING,"-failover-abort-no-good-slave",ri,"%@");
-        sentinelAbortFailover(ri);
-    } else {
-        sentinelEvent(LL_WARNING,"+selected-slave",slave,"%@");
-        slave->flags |= SRI_PROMOTED;
-        ri->promoted_slave = slave;
-        ri->failover_state = SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE;
-        ri->failover_state_change_time = mstime();
-        sentinelEvent(LL_NOTICE,"+failover-state-send-slaveof-noone",
-            slave, "%@");
-    }
-}
-
-void sentinelFailoverSendSlaveOfNoOne(sentinelRedisInstance *ri) {
-    int retval;
-
-    /* We can't send the command to the promoted slave if it is now
-     * disconnected. Retry again and again with this state until the timeout
-     * is reached, then abort the failover. */
-    if (ri->promoted_slave->link->disconnected) {
-        if (mstime() - ri->failover_state_change_time > ri->failover_timeout) {
-            sentinelEvent(LL_WARNING,"-failover-abort-slave-timeout",ri,"%@");
-            sentinelAbortFailover(ri);
-        }
-        return;
-    }
-
-    /* Send SLAVEOF NO ONE command to turn the slave into a master.
-     * We actually register a generic callback for this command as we don't
-     * really care about the reply. We check if it worked indirectly observing
-     * if INFO returns a different role (master instead of slave). */
-    retval = sentinelSendSlaveOf(ri->promoted_slave,NULL);
-    if (retval != C_OK) return;
-    sentinelEvent(LL_NOTICE, "+failover-state-wait-promotion",
-        ri->promoted_slave,"%@");
-    ri->failover_state = SENTINEL_FAILOVER_STATE_WAIT_PROMOTION;
-    ri->failover_state_change_time = mstime();
-}
-
-/* We actually wait for promotion indirectly checking with INFO when the
- * slave turns into a master. */
-void sentinelFailoverWaitPromotion(sentinelRedisInstance *ri) {
-    /* Just handle the timeout. Switching to the next state is handled
-     * by the function parsing the INFO command of the promoted slave. */
-    if (mstime() - ri->failover_state_change_time > ri->failover_timeout) {
-        sentinelEvent(LL_WARNING,"-failover-abort-slave-timeout",ri,"%@");
-        sentinelAbortFailover(ri);
-    }
-}
-
-void sentinelFailoverDetectEnd(sentinelRedisInstance *master) {
-    int not_reconfigured = 0, timeout = 0;
-    dictIterator *di;
-    dictEntry *de;
-    mstime_t elapsed = mstime() - master->failover_state_change_time;
-
-    /* We can't consider failover finished if the promoted slave is
-     * not reachable. */
-    if (master->promoted_slave == NULL ||
-        master->promoted_slave->flags & SRI_S_DOWN) return;
-
-    /* The failover terminates once all the reachable slaves are properly
-     * configured. */
-    di = dictGetIterator(master->slaves);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *slave = dictGetVal(de);
-
-        if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE)) continue;
-        if (slave->flags & SRI_S_DOWN) continue;
-        not_reconfigured++;
-    }
-    dictReleaseIterator(di);
-
-    /* Force end of failover on timeout. */
-    if (elapsed > master->failover_timeout) {
-        not_reconfigured = 0;
-        timeout = 1;
-        sentinelEvent(LL_WARNING,"+failover-end-for-timeout",master,"%@");
-    }
-
-    if (not_reconfigured == 0) {
-        sentinelEvent(LL_WARNING,"+failover-end",master,"%@");
-        master->failover_state = SENTINEL_FAILOVER_STATE_UPDATE_CONFIG;
-        master->failover_state_change_time = mstime();
-    }
-
-    /* If I'm the leader it is a good idea to send a best effort SLAVEOF
-     * command to all the slaves still not reconfigured to replicate with
-     * the new master. */
-    if (timeout) {
-        dictIterator *di;
-        dictEntry *de;
-
-        di = dictGetIterator(master->slaves);
-        while((de = dictNext(di)) != NULL) {
-            sentinelRedisInstance *slave = dictGetVal(de);
-            int retval;
-
-            if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE|SRI_RECONF_SENT)) continue;
-            if (slave->link->disconnected) continue;
-
-            retval = sentinelSendSlaveOf(slave,master->promoted_slave->addr);
-            if (retval == C_OK) {
-                sentinelEvent(LL_NOTICE,"+slave-reconf-sent-be",slave,"%@");
-                slave->flags |= SRI_RECONF_SENT;
-            }
-        }
-        dictReleaseIterator(di);
-    }
-}
-
-/* Send SLAVE OF <new master address> to all the remaining slaves that
- * still don't appear to have the configuration updated. */
-void sentinelFailoverReconfNextSlave(sentinelRedisInstance *master) {
-    dictIterator *di;
-    dictEntry *de;
-    int in_progress = 0;
-
-    di = dictGetIterator(master->slaves);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *slave = dictGetVal(de);
-
-        if (slave->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG))
-            in_progress++;
-    }
-    dictReleaseIterator(di);
-
-    di = dictGetIterator(master->slaves);
-    while(in_progress < master->parallel_syncs &&
-          (de = dictNext(di)) != NULL)
-    {
-        sentinelRedisInstance *slave = dictGetVal(de);
-        int retval;
-
-        /* Skip the promoted slave, and already configured slaves. */
-        if (slave->flags & (SRI_PROMOTED|SRI_RECONF_DONE)) continue;
-
-        /* If too much time elapsed without the slave moving forward to
-         * the next state, consider it reconfigured even if it is not.
-         * Sentinels will detect the slave as misconfigured and fix its
-         * configuration later. */
-        if ((slave->flags & SRI_RECONF_SENT) &&
-            (mstime() - slave->slave_reconf_sent_time) >
-            SENTINEL_SLAVE_RECONF_TIMEOUT)
-        {
-            sentinelEvent(LL_NOTICE,"-slave-reconf-sent-timeout",slave,"%@");
-            slave->flags &= ~SRI_RECONF_SENT;
-            slave->flags |= SRI_RECONF_DONE;
-        }
-
-        /* Nothing to do for instances that are disconnected or already
-         * in RECONF_SENT state. */
-        if (slave->flags & (SRI_RECONF_SENT|SRI_RECONF_INPROG)) continue;
-        if (slave->link->disconnected) continue;
-
-        /* Send SLAVEOF <new master>. */
-        retval = sentinelSendSlaveOf(slave,master->promoted_slave->addr);
-        if (retval == C_OK) {
-            slave->flags |= SRI_RECONF_SENT;
-            slave->slave_reconf_sent_time = mstime();
-            sentinelEvent(LL_NOTICE,"+slave-reconf-sent",slave,"%@");
-            in_progress++;
-        }
-    }
-    dictReleaseIterator(di);
-
-    /* Check if all the slaves are reconfigured and handle timeout. */
-    sentinelFailoverDetectEnd(master);
-}
-
-/* This function is called when the slave is in
- * SENTINEL_FAILOVER_STATE_UPDATE_CONFIG state. In this state we need
- * to remove it from the master table and add the promoted slave instead. */
-void sentinelFailoverSwitchToPromotedSlave(sentinelRedisInstance *master) {
-    sentinelRedisInstance *ref = master->promoted_slave ?
-                                 master->promoted_slave : master;
-
-    sentinelEvent(LL_WARNING,"+switch-master",master,"%s %s %d %s %d",
-        master->name, announceSentinelAddr(master->addr), master->addr->port,
-        announceSentinelAddr(ref->addr), ref->addr->port);
-
-    sentinelResetMasterAndChangeAddress(master,ref->addr->hostname,ref->addr->port);
-}
-
-void sentinelFailoverStateMachine(sentinelRedisInstance *ri) {
-    serverAssert(ri->flags & SRI_MASTER);
-
-    if (!(ri->flags & SRI_FAILOVER_IN_PROGRESS)) return;
-
-    switch(ri->failover_state) {
-        case SENTINEL_FAILOVER_STATE_WAIT_START:
-            sentinelFailoverWaitStart(ri);
-            break;
-        case SENTINEL_FAILOVER_STATE_SELECT_SLAVE:
-            sentinelFailoverSelectSlave(ri);
-            break;
-        case SENTINEL_FAILOVER_STATE_SEND_SLAVEOF_NOONE:
-            sentinelFailoverSendSlaveOfNoOne(ri);
-            break;
-        case SENTINEL_FAILOVER_STATE_WAIT_PROMOTION:
-            sentinelFailoverWaitPromotion(ri);
-            break;
-        case SENTINEL_FAILOVER_STATE_RECONF_SLAVES:
-            sentinelFailoverReconfNextSlave(ri);
-            break;
-    }
-}
-
-/* Abort a failover in progress:
- *
- * This function can only be called before the promoted slave acknowledged
- * the slave -> master switch. Otherwise the failover can't be aborted and
- * will reach its end (possibly by timeout). */
-void sentinelAbortFailover(sentinelRedisInstance *ri) {
-    serverAssert(ri->flags & SRI_FAILOVER_IN_PROGRESS);
-    serverAssert(ri->failover_state <= SENTINEL_FAILOVER_STATE_WAIT_PROMOTION);
-
-    ri->flags &= ~(SRI_FAILOVER_IN_PROGRESS|SRI_FORCE_FAILOVER);
-    ri->failover_state = SENTINEL_FAILOVER_STATE_NONE;
-    ri->failover_state_change_time = mstime();
-    if (ri->promoted_slave) {
-        ri->promoted_slave->flags &= ~SRI_PROMOTED;
-        ri->promoted_slave = NULL;
-    }
-}
-
-/* ======================== SENTINEL timer handler ==========================
- * This is the "main" our Sentinel, being sentinel completely non blocking
- * in design. The function is called every second.
- * -------------------------------------------------------------------------- */
-
-/* Perform scheduled operations for the specified Redis instance. */
-void sentinelHandleRedisInstance(sentinelRedisInstance *ri) {
-    /* ========== MONITORING HALF ============ */
-    /* Every kind of instance */
-    sentinelReconnectInstance(ri);
-    sentinelSendPeriodicCommands(ri);
-
-    /* ============== ACTING HALF ============= */
-    /* We don't proceed with the acting half if we are in TILT mode.
-     * TILT happens when we find something odd with the time, like a
-     * sudden change in the clock. */
-    if (sentinel.tilt) {
-        if (mstime()-sentinel.tilt_start_time < SENTINEL_TILT_PERIOD) return;
-        sentinel.tilt = 0;
-        sentinelEvent(LL_WARNING,"-tilt",NULL,"#tilt mode exited");
-    }
-
-    /* Every kind of instance */
-    sentinelCheckSubjectivelyDown(ri);
-
-    /* Masters and slaves */
-    if (ri->flags & (SRI_MASTER|SRI_SLAVE)) {
-        /* Nothing so far. */
-    }
-
-    /* Only masters */
-    if (ri->flags & SRI_MASTER) {
-        sentinelCheckObjectivelyDown(ri);
-        if (sentinelStartFailoverIfNeeded(ri))
-            sentinelAskMasterStateToOtherSentinels(ri,SENTINEL_ASK_FORCED);
-        sentinelFailoverStateMachine(ri);
-        sentinelAskMasterStateToOtherSentinels(ri,SENTINEL_NO_FLAGS);
-    }
-}
-
-/* Perform scheduled operations for all the instances in the dictionary.
- * Recursively call the function against dictionaries of slaves. */
-void sentinelHandleDictOfRedisInstances(dict *instances) {
-    dictIterator *di;
-    dictEntry *de;
-    sentinelRedisInstance *switch_to_promoted = NULL;
-
-    /* There are a number of things we need to perform against every master. */
-    di = dictGetIterator(instances);
-    while((de = dictNext(di)) != NULL) {
-        sentinelRedisInstance *ri = dictGetVal(de);
-
-        sentinelHandleRedisInstance(ri);
-        if (ri->flags & SRI_MASTER) {
-            sentinelHandleDictOfRedisInstances(ri->slaves);
-            sentinelHandleDictOfRedisInstances(ri->sentinels);
-            if (ri->failover_state == SENTINEL_FAILOVER_STATE_UPDATE_CONFIG) {
-                switch_to_promoted = ri;
-            }
-        }
-    }
-    if (switch_to_promoted)
-        sentinelFailoverSwitchToPromotedSlave(switch_to_promoted);
-    dictReleaseIterator(di);
-}
-
-/* This function checks if we need to enter the TITL mode.
- *
- * The TILT mode is entered if we detect that between two invocations of the
- * timer interrupt, a negative amount of time, or too much time has passed.
- * Note that we expect that more or less just 100 milliseconds will pass
- * if everything is fine. However we'll see a negative number or a
- * difference bigger than SENTINEL_TILT_TRIGGER milliseconds if one of the
- * following conditions happen:
- *
- * 1) The Sentinel process for some time is blocked, for every kind of
- * random reason: the load is huge, the computer was frozen for some time
- * in I/O or alike, the process was stopped by a signal. Everything.
- * 2) The system clock was altered significantly.
- *
- * Under both this conditions we'll see everything as timed out and failing
- * without good reasons. Instead we enter the TILT mode and wait
- * for SENTINEL_TILT_PERIOD to elapse before starting to act again.
- *
- * During TILT time we still collect information, we just do not act. */
-void sentinelCheckTiltCondition(void) {
-    mstime_t now = mstime();
-    mstime_t delta = now - sentinel.previous_time;
-
-    if (delta < 0 || delta > SENTINEL_TILT_TRIGGER) {
-        sentinel.tilt = 1;
-        sentinel.tilt_start_time = mstime();
-        sentinelEvent(LL_WARNING,"+tilt",NULL,"#tilt mode entered");
-    }
-    sentinel.previous_time = mstime();
-}
-
-void sentinelTimer(void) {
-    sentinelCheckTiltCondition();
-    sentinelHandleDictOfRedisInstances(sentinel.masters);
-    sentinelRunPendingScripts();
-    sentinelCollectTerminatedScripts();
-    sentinelKillTimedoutScripts();
-
-    /* We continuously change the frequency of the Redis "timer interrupt"
-     * in order to desynchronize every Sentinel from every other.
-     * This non-determinism avoids that Sentinels started at the same time
-     * exactly continue to stay synchronized asking to be voted at the
-     * same time again and again (resulting in nobody likely winning the
-     * election because of split brain voting). */
-    server.hz = CONFIG_DEFAULT_HZ + rand() % CONFIG_DEFAULT_HZ;
-}
diff --git a/redis-stable/src/server.c b/redis-stable/src/server.c
deleted file mode 100644
index 58c0a3d6..00000000
--- a/redis-stable/src/server.c
+++ /dev/null
@@ -1,6406 +0,0 @@
-/*
- * Copyright (c) 2009-2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "monotonic.h"
-#include "cluster.h"
-#include "slowlog.h"
-#include "bio.h"
-#include "latency.h"
-#include "atomicvar.h"
-#include "mt19937-64.h"
-
-#include <time.h>
-#include <signal.h>
-#include <sys/wait.h>
-#include <errno.h>
-#include <assert.h>
-#include <ctype.h>
-#include <stdarg.h>
-#include <arpa/inet.h>
-#include <sys/stat.h>
-#include <fcntl.h>
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/uio.h>
-#include <sys/un.h>
-#include <limits.h>
-#include <float.h>
-#include <math.h>
-#include <sys/resource.h>
-#include <sys/utsname.h>
-#include <locale.h>
-#include <sys/socket.h>
-#include <sys/resource.h>
-
-#ifdef __linux__
-#include <sys/mman.h>
-#endif
-
-/* Our shared "common" objects */
-
-struct sharedObjectsStruct shared;
-
-/* Global vars that are actually used as constants. The following double
- * values are used for double on-disk serialization, and are initialized
- * at runtime to avoid strange compiler optimizations. */
-
-double R_Zero, R_PosInf, R_NegInf, R_Nan;
-
-/*================================= Globals ================================= */
-
-/* Global vars */
-struct redisServer server; /* Server global state */
-
-/* Our command table.
- *
- * Every entry is composed of the following fields:
- *
- * name:        A string representing the command name.
- *
- * function:    Pointer to the C function implementing the command.
- *
- * arity:       Number of arguments, it is possible to use -N to say >= N
- *
- * sflags:      Command flags as string. See below for a table of flags.
- *
- * flags:       Flags as bitmask. Computed by Redis using the 'sflags' field.
- *
- * get_keys_proc: An optional function to get key arguments from a command.
- *                This is only used when the following three fields are not
- *                enough to specify what arguments are keys.
- *
- * first_key_index: First argument that is a key
- *
- * last_key_index: Last argument that is a key
- *
- * key_step:    Step to get all the keys from first to last argument.
- *              For instance in MSET the step is two since arguments
- *              are key,val,key,val,...
- *
- * microseconds: Microseconds of total execution time for this command.
- *
- * calls:       Total number of calls of this command.
- *
- * id:          Command bit identifier for ACLs or other goals.
- *
- * The flags, microseconds and calls fields are computed by Redis and should
- * always be set to zero.
- *
- * Command flags are expressed using space separated strings, that are turned
- * into actual flags by the populateCommandTable() function.
- *
- * This is the meaning of the flags:
- *
- * write:       Write command (may modify the key space).
- *
- * read-only:   Commands just reading from keys without changing the content.
- *              Note that commands that don't read from the keyspace such as
- *              TIME, SELECT, INFO, administrative commands, and connection
- *              or transaction related commands (multi, exec, discard, ...)
- *              are not flagged as read-only commands, since they affect the
- *              server or the connection in other ways.
- *
- * use-memory:  May increase memory usage once called. Don't allow if out
- *              of memory.
- *
- * admin:       Administrative command, like SAVE or SHUTDOWN.
- *
- * pub-sub:     Pub/Sub related command.
- *
- * no-script:   Command not allowed in scripts.
- *
- * random:      Random command. Command is not deterministic, that is, the same
- *              command with the same arguments, with the same key space, may
- *              have different results. For instance SPOP and RANDOMKEY are
- *              two random commands.
- *
- * to-sort:     Sort command output array if called from script, so that the
- *              output is deterministic. When this flag is used (not always
- *              possible), then the "random" flag is not needed.
- *
- * ok-loading:  Allow the command while loading the database.
- *
- * ok-stale:    Allow the command while a slave has stale data but is not
- *              allowed to serve this data. Normally no command is accepted
- *              in this condition but just a few.
- *
- * no-monitor:  Do not automatically propagate the command on MONITOR.
- *
- * no-slowlog:  Do not automatically propagate the command to the slowlog.
- *
- * cluster-asking: Perform an implicit ASKING for this command, so the
- *              command will be accepted in cluster mode if the slot is marked
- *              as 'importing'.
- *
- * fast:        Fast command: O(1) or O(log(N)) command that should never
- *              delay its execution as long as the kernel scheduler is giving
- *              us time. Note that commands that may trigger a DEL as a side
- *              effect (like SET) are not fast commands.
- * 
- * may-replicate: Command may produce replication traffic, but should be 
- *                allowed under circumstances where write commands are disallowed. 
- *                Examples include PUBLISH, which replicates pubsub messages,and 
- *                EVAL, which may execute write commands, which are replicated, 
- *                or may just execute read commands. A command can not be marked 
- *                both "write" and "may-replicate"
- *
- * The following additional flags are only used in order to put commands
- * in a specific ACL category. Commands can have multiple ACL categories.
- *
- * @keyspace, @read, @write, @set, @sortedset, @list, @hash, @string, @bitmap,
- * @hyperloglog, @stream, @admin, @fast, @slow, @pubsub, @blocking, @dangerous,
- * @connection, @transaction, @scripting, @geo.
- *
- * Note that:
- *
- * 1) The read-only flag implies the @read ACL category.
- * 2) The write flag implies the @write ACL category.
- * 3) The fast flag implies the @fast ACL category.
- * 4) The admin flag implies the @admin and @dangerous ACL category.
- * 5) The pub-sub flag implies the @pubsub ACL category.
- * 6) The lack of fast flag implies the @slow ACL category.
- * 7) The non obvious "keyspace" category includes the commands
- *    that interact with keys without having anything to do with
- *    specific data structures, such as: DEL, RENAME, MOVE, SELECT,
- *    TYPE, EXPIRE*, PEXPIRE*, TTL, PTTL, ...
- */
-
-struct redisCommand redisCommandTable[] = {
-    {"module",moduleCommand,-2,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"get",getCommand,2,
-     "read-only fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"getex",getexCommand,-2,
-     "write fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"getdel",getdelCommand,2,
-     "write fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    /* Note that we can't flag set as fast, since it may perform an
-     * implicit DEL of a large key. */
-    {"set",setCommand,-3,
-     "write use-memory @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"setnx",setnxCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"setex",setexCommand,4,
-     "write use-memory @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"psetex",psetexCommand,4,
-     "write use-memory @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"append",appendCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"strlen",strlenCommand,2,
-     "read-only fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"del",delCommand,-2,
-     "write @keyspace",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"unlink",unlinkCommand,-2,
-     "write fast @keyspace",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"exists",existsCommand,-2,
-     "read-only fast @keyspace",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"setbit",setbitCommand,4,
-     "write use-memory @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"getbit",getbitCommand,3,
-     "read-only fast @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"bitfield",bitfieldCommand,-2,
-     "write use-memory @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"bitfield_ro",bitfieldroCommand,-2,
-     "read-only fast @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"setrange",setrangeCommand,4,
-     "write use-memory @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"getrange",getrangeCommand,4,
-     "read-only @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"substr",getrangeCommand,4,
-     "read-only @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"incr",incrCommand,2,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"decr",decrCommand,2,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"mget",mgetCommand,-2,
-     "read-only fast @string",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"rpush",rpushCommand,-3,
-     "write use-memory fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lpush",lpushCommand,-3,
-     "write use-memory fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"rpushx",rpushxCommand,-3,
-     "write use-memory fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lpushx",lpushxCommand,-3,
-     "write use-memory fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"linsert",linsertCommand,5,
-     "write use-memory @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"rpop",rpopCommand,-2,
-     "write fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lpop",lpopCommand,-2,
-     "write fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"brpop",brpopCommand,-3,
-     "write no-script @list @blocking",
-     0,NULL,1,-2,1,0,0,0},
-
-    {"brpoplpush",brpoplpushCommand,4,
-     "write use-memory no-script @list @blocking",
-     0,NULL,1,2,1,0,0,0},
-
-    {"blmove",blmoveCommand,6,
-     "write use-memory no-script @list @blocking",
-     0,NULL,1,2,1,0,0,0},
-
-    {"blpop",blpopCommand,-3,
-     "write no-script @list @blocking",
-     0,NULL,1,-2,1,0,0,0},
-
-    {"llen",llenCommand,2,
-     "read-only fast @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lindex",lindexCommand,3,
-     "read-only @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lset",lsetCommand,4,
-     "write use-memory @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lrange",lrangeCommand,4,
-     "read-only @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"ltrim",ltrimCommand,4,
-     "write @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lpos",lposCommand,-3,
-     "read-only @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"lrem",lremCommand,4,
-     "write @list",
-     0,NULL,1,1,1,0,0,0},
-
-    {"rpoplpush",rpoplpushCommand,3,
-     "write use-memory @list",
-     0,NULL,1,2,1,0,0,0},
-
-    {"lmove",lmoveCommand,5,
-     "write use-memory @list",
-     0,NULL,1,2,1,0,0,0},
-
-    {"sadd",saddCommand,-3,
-     "write use-memory fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"srem",sremCommand,-3,
-     "write fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"smove",smoveCommand,4,
-     "write fast @set",
-     0,NULL,1,2,1,0,0,0},
-
-    {"sismember",sismemberCommand,3,
-     "read-only fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"smismember",smismemberCommand,-3,
-     "read-only fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"scard",scardCommand,2,
-     "read-only fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"spop",spopCommand,-2,
-     "write random fast @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"srandmember",srandmemberCommand,-2,
-     "read-only random @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"sinter",sinterCommand,-2,
-     "read-only to-sort @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"sinterstore",sinterstoreCommand,-3,
-     "write use-memory @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"sunion",sunionCommand,-2,
-     "read-only to-sort @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"sunionstore",sunionstoreCommand,-3,
-     "write use-memory @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"sdiff",sdiffCommand,-2,
-     "read-only to-sort @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"sdiffstore",sdiffstoreCommand,-3,
-     "write use-memory @set",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"smembers",sinterCommand,2,
-     "read-only to-sort @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"sscan",sscanCommand,-3,
-     "read-only random @set",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zadd",zaddCommand,-4,
-     "write use-memory fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zincrby",zincrbyCommand,4,
-     "write use-memory fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrem",zremCommand,-3,
-     "write fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zremrangebyscore",zremrangebyscoreCommand,4,
-     "write @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zremrangebyrank",zremrangebyrankCommand,4,
-     "write @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zremrangebylex",zremrangebylexCommand,4,
-     "write @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zunionstore",zunionstoreCommand,-4,
-     "write use-memory @sortedset",
-     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
-
-    {"zinterstore",zinterstoreCommand,-4,
-     "write use-memory @sortedset",
-     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
-
-    {"zdiffstore",zdiffstoreCommand,-4,
-     "write use-memory @sortedset",
-     0,zunionInterDiffStoreGetKeys,1,1,1,0,0,0},
-
-    {"zunion",zunionCommand,-3,
-     "read-only @sortedset",
-     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
-
-    {"zinter",zinterCommand,-3,
-     "read-only @sortedset",
-     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
-
-    {"zdiff",zdiffCommand,-3,
-     "read-only @sortedset",
-     0,zunionInterDiffGetKeys,0,0,0,0,0,0},
-
-    {"zrange",zrangeCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrangestore",zrangestoreCommand,-5,
-     "write use-memory @sortedset",
-     0,NULL,1,2,1,0,0,0},
-
-    {"zrangebyscore",zrangebyscoreCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrevrangebyscore",zrevrangebyscoreCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrangebylex",zrangebylexCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrevrangebylex",zrevrangebylexCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zcount",zcountCommand,4,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zlexcount",zlexcountCommand,4,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrevrange",zrevrangeCommand,-4,
-     "read-only @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zcard",zcardCommand,2,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zscore",zscoreCommand,3,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zmscore",zmscoreCommand,-3,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrank",zrankCommand,3,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zrevrank",zrevrankCommand,3,
-     "read-only fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zscan",zscanCommand,-3,
-     "read-only random @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zpopmin",zpopminCommand,-2,
-     "write fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"zpopmax",zpopmaxCommand,-2,
-     "write fast @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"bzpopmin",bzpopminCommand,-3,
-     "write no-script fast @sortedset @blocking",
-     0,NULL,1,-2,1,0,0,0},
-
-    {"bzpopmax",bzpopmaxCommand,-3,
-     "write no-script fast @sortedset @blocking",
-     0,NULL,1,-2,1,0,0,0},
-
-    {"zrandmember",zrandmemberCommand,-2,
-     "read-only random @sortedset",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hset",hsetCommand,-4,
-     "write use-memory fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hsetnx",hsetnxCommand,4,
-     "write use-memory fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hget",hgetCommand,3,
-     "read-only fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hmset",hsetCommand,-4,
-     "write use-memory fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hmget",hmgetCommand,-3,
-     "read-only fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hincrby",hincrbyCommand,4,
-     "write use-memory fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hincrbyfloat",hincrbyfloatCommand,4,
-     "write use-memory fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hdel",hdelCommand,-3,
-     "write fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hlen",hlenCommand,2,
-     "read-only fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hstrlen",hstrlenCommand,3,
-     "read-only fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hkeys",hkeysCommand,2,
-     "read-only to-sort @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hvals",hvalsCommand,2,
-     "read-only to-sort @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hgetall",hgetallCommand,2,
-     "read-only random @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hexists",hexistsCommand,3,
-     "read-only fast @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hrandfield",hrandfieldCommand,-2,
-     "read-only random @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"hscan",hscanCommand,-3,
-     "read-only random @hash",
-     0,NULL,1,1,1,0,0,0},
-
-    {"incrby",incrbyCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"decrby",decrbyCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"incrbyfloat",incrbyfloatCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"getset",getsetCommand,3,
-     "write use-memory fast @string",
-     0,NULL,1,1,1,0,0,0},
-
-    {"mset",msetCommand,-3,
-     "write use-memory @string",
-     0,NULL,1,-1,2,0,0,0},
-
-    {"msetnx",msetnxCommand,-3,
-     "write use-memory @string",
-     0,NULL,1,-1,2,0,0,0},
-
-    {"randomkey",randomkeyCommand,1,
-     "read-only random @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"select",selectCommand,2,
-     "ok-loading fast ok-stale @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"swapdb",swapdbCommand,3,
-     "write fast @keyspace @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"move",moveCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"copy",copyCommand,-3,
-     "write use-memory @keyspace",
-     0,NULL,1,2,1,0,0,0},
-
-    /* Like for SET, we can't mark rename as a fast command because
-     * overwriting the target key may result in an implicit slow DEL. */
-    {"rename",renameCommand,3,
-     "write @keyspace",
-     0,NULL,1,2,1,0,0,0},
-
-    {"renamenx",renamenxCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,2,1,0,0,0},
-
-    {"expire",expireCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"expireat",expireatCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"pexpire",pexpireCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"pexpireat",pexpireatCommand,3,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"keys",keysCommand,2,
-     "read-only to-sort @keyspace @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"scan",scanCommand,-2,
-     "read-only random @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"dbsize",dbsizeCommand,1,
-     "read-only fast @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"auth",authCommand,-2,
-     "no-auth no-script ok-loading ok-stale fast @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    /* We don't allow PING during loading since in Redis PING is used as
-     * failure detection, and a loading server is considered to be
-     * not available. */
-    {"ping",pingCommand,-1,
-     "ok-stale fast @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    {"echo",echoCommand,2,
-     "fast @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    {"save",saveCommand,1,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"bgsave",bgsaveCommand,-1,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"bgrewriteaof",bgrewriteaofCommand,1,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"shutdown",shutdownCommand,-1,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"lastsave",lastsaveCommand,1,
-     "random fast ok-loading ok-stale @admin @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"type",typeCommand,2,
-     "read-only fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"multi",multiCommand,1,
-     "no-script fast ok-loading ok-stale @transaction",
-     0,NULL,0,0,0,0,0,0},
-
-    {"exec",execCommand,1,
-     "no-script no-slowlog ok-loading ok-stale @transaction",
-     0,NULL,0,0,0,0,0,0},
-
-    {"discard",discardCommand,1,
-     "no-script fast ok-loading ok-stale @transaction",
-     0,NULL,0,0,0,0,0,0},
-
-    {"sync",syncCommand,1,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"psync",syncCommand,-3,
-     "admin no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"replconf",replconfCommand,-1,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"flushdb",flushdbCommand,-1,
-     "write @keyspace @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"flushall",flushallCommand,-1,
-     "write @keyspace @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"sort",sortCommand,-2,
-     "write use-memory @list @set @sortedset @dangerous",
-     0,sortGetKeys,1,1,1,0,0,0},
-
-    {"info",infoCommand,-1,
-     "ok-loading ok-stale random @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"monitor",monitorCommand,1,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"ttl",ttlCommand,2,
-     "read-only fast random @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"touch",touchCommand,-2,
-     "read-only fast @keyspace",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"pttl",pttlCommand,2,
-     "read-only fast random @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"persist",persistCommand,2,
-     "write fast @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"slaveof",replicaofCommand,3,
-     "admin no-script ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"replicaof",replicaofCommand,3,
-     "admin no-script ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"role",roleCommand,1,
-     "ok-loading ok-stale no-script fast @dangerous",
-     0,NULL,0,0,0,0,0,0},
-
-    {"debug",debugCommand,-2,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"config",configCommand,-2,
-     "admin ok-loading ok-stale no-script",
-     0,NULL,0,0,0,0,0,0},
-
-    {"subscribe",subscribeCommand,-2,
-     "pub-sub no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"unsubscribe",unsubscribeCommand,-1,
-     "pub-sub no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"psubscribe",psubscribeCommand,-2,
-     "pub-sub no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"punsubscribe",punsubscribeCommand,-1,
-     "pub-sub no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"publish",publishCommand,3,
-     "pub-sub ok-loading ok-stale fast may-replicate",
-     0,NULL,0,0,0,0,0,0},
-
-    {"pubsub",pubsubCommand,-2,
-     "pub-sub ok-loading ok-stale random",
-     0,NULL,0,0,0,0,0,0},
-
-    {"watch",watchCommand,-2,
-     "no-script fast ok-loading ok-stale @transaction",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"unwatch",unwatchCommand,1,
-     "no-script fast ok-loading ok-stale @transaction",
-     0,NULL,0,0,0,0,0,0},
-
-    {"cluster",clusterCommand,-2,
-     "admin ok-stale random",
-     0,NULL,0,0,0,0,0,0},
-
-    {"restore",restoreCommand,-4,
-     "write use-memory @keyspace @dangerous",
-     0,NULL,1,1,1,0,0,0},
-
-    {"restore-asking",restoreCommand,-4,
-    "write use-memory cluster-asking @keyspace @dangerous",
-    0,NULL,1,1,1,0,0,0},
-
-    {"migrate",migrateCommand,-6,
-     "write random @keyspace @dangerous",
-     0,migrateGetKeys,3,3,1,0,0,0},
-
-    {"asking",askingCommand,1,
-     "fast @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"readonly",readonlyCommand,1,
-     "fast @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"readwrite",readwriteCommand,1,
-     "fast @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"dump",dumpCommand,2,
-     "read-only random @keyspace",
-     0,NULL,1,1,1,0,0,0},
-
-    {"object",objectCommand,-2,
-     "read-only random @keyspace",
-     0,NULL,2,2,1,0,0,0},
-
-    {"memory",memoryCommand,-2,
-     "random read-only",
-     0,memoryGetKeys,0,0,0,0,0,0},
-
-    {"client",clientCommand,-2,
-     "admin no-script random ok-loading ok-stale @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    {"hello",helloCommand,-1,
-     "no-auth no-script fast ok-loading ok-stale @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    /* EVAL can modify the dataset, however it is not flagged as a write
-     * command since we do the check while running commands from Lua.
-     * 
-     * EVAL and EVALSHA also feed monitors before the commands are executed,
-     * as opposed to after.
-      */
-    {"eval",evalCommand,-3,
-     "no-script no-monitor may-replicate @scripting",
-     0,evalGetKeys,0,0,0,0,0,0},
-
-    {"evalsha",evalShaCommand,-3,
-     "no-script no-monitor may-replicate @scripting",
-     0,evalGetKeys,0,0,0,0,0,0},
-
-    {"slowlog",slowlogCommand,-2,
-     "admin random ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"script",scriptCommand,-2,
-     "no-script may-replicate @scripting",
-     0,NULL,0,0,0,0,0,0},
-
-    {"time",timeCommand,1,
-     "random fast ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"bitop",bitopCommand,-4,
-     "write use-memory @bitmap",
-     0,NULL,2,-1,1,0,0,0},
-
-    {"bitcount",bitcountCommand,-2,
-     "read-only @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"bitpos",bitposCommand,-3,
-     "read-only @bitmap",
-     0,NULL,1,1,1,0,0,0},
-
-    {"wait",waitCommand,3,
-     "no-script @keyspace",
-     0,NULL,0,0,0,0,0,0},
-
-    {"command",commandCommand,-1,
-     "ok-loading ok-stale random @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    {"geoadd",geoaddCommand,-5,
-     "write use-memory @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    /* GEORADIUS has store options that may write. */
-    {"georadius",georadiusCommand,-6,
-     "write use-memory @geo",
-     0,georadiusGetKeys,1,1,1,0,0,0},
-
-    {"georadius_ro",georadiusroCommand,-6,
-     "read-only @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    {"georadiusbymember",georadiusbymemberCommand,-5,
-     "write use-memory @geo",
-     0,georadiusGetKeys,1,1,1,0,0,0},
-
-    {"georadiusbymember_ro",georadiusbymemberroCommand,-5,
-     "read-only @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    {"geohash",geohashCommand,-2,
-     "read-only @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    {"geopos",geoposCommand,-2,
-     "read-only @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    {"geodist",geodistCommand,-4,
-     "read-only @geo",
-     0,NULL,1,1,1,0,0,0},
-
-    {"geosearch",geosearchCommand,-7,
-     "read-only @geo",
-      0,NULL,1,1,1,0,0,0},
-
-    {"geosearchstore",geosearchstoreCommand,-8,
-     "write use-memory @geo",
-      0,NULL,1,2,1,0,0,0},
-
-    {"pfselftest",pfselftestCommand,1,
-     "admin @hyperloglog",
-      0,NULL,0,0,0,0,0,0},
-
-    {"pfadd",pfaddCommand,-2,
-     "write use-memory fast @hyperloglog",
-     0,NULL,1,1,1,0,0,0},
-
-    /* Technically speaking PFCOUNT may change the key since it changes the
-     * final bytes in the HyperLogLog representation. However in this case
-     * we claim that the representation, even if accessible, is an internal
-     * affair, and the command is semantically read only. */
-    {"pfcount",pfcountCommand,-2,
-     "read-only may-replicate @hyperloglog",
-     0,NULL,1,-1,1,0,0,0},
-
-    {"pfmerge",pfmergeCommand,-2,
-     "write use-memory @hyperloglog",
-     0,NULL,1,-1,1,0,0,0},
-
-    /* Unlike PFCOUNT that is considered as a read-only command (although
-     * it changes a bit), PFDEBUG may change the entire key when converting
-     * from sparse to dense representation */
-    {"pfdebug",pfdebugCommand,-3,
-     "admin write use-memory @hyperloglog",
-     0,NULL,2,2,1,0,0,0},
-
-    {"xadd",xaddCommand,-5,
-     "write use-memory fast random @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xrange",xrangeCommand,-4,
-     "read-only @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xrevrange",xrevrangeCommand,-4,
-     "read-only @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xlen",xlenCommand,2,
-     "read-only fast @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xread",xreadCommand,-4,
-     "read-only @stream @blocking",
-     0,xreadGetKeys,0,0,0,0,0,0},
-
-    {"xreadgroup",xreadCommand,-7,
-     "write @stream @blocking",
-     0,xreadGetKeys,0,0,0,0,0,0},
-
-    {"xgroup",xgroupCommand,-2,
-     "write use-memory @stream",
-     0,NULL,2,2,1,0,0,0},
-
-    {"xsetid",xsetidCommand,3,
-     "write use-memory fast @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xack",xackCommand,-4,
-     "write fast random @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xpending",xpendingCommand,-3,
-     "read-only random @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xclaim",xclaimCommand,-6,
-     "write random fast @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xautoclaim",xautoclaimCommand,-6,
-     "write random fast @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xinfo",xinfoCommand,-2,
-     "read-only random @stream",
-     0,NULL,2,2,1,0,0,0},
-
-    {"xdel",xdelCommand,-3,
-     "write fast @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"xtrim",xtrimCommand,-4,
-     "write random @stream",
-     0,NULL,1,1,1,0,0,0},
-
-    {"post",securityWarningCommand,-1,
-     "ok-loading ok-stale read-only",
-     0,NULL,0,0,0,0,0,0},
-
-    {"host:",securityWarningCommand,-1,
-     "ok-loading ok-stale read-only",
-     0,NULL,0,0,0,0,0,0},
-
-    {"latency",latencyCommand,-2,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"lolwut",lolwutCommand,-1,
-     "read-only fast",
-     0,NULL,0,0,0,0,0,0},
-
-    {"acl",aclCommand,-2,
-     "admin no-script ok-loading ok-stale",
-     0,NULL,0,0,0,0,0,0},
-
-    {"stralgo",stralgoCommand,-2,
-     "read-only @string",
-     0,lcsGetKeys,0,0,0,0,0,0},
-
-    {"reset",resetCommand,1,
-     "no-script ok-stale ok-loading fast @connection",
-     0,NULL,0,0,0,0,0,0},
-
-    {"failover",failoverCommand,-1,
-     "admin no-script ok-stale",
-     0,NULL,0,0,0,0,0,0}
-};
-
-/*============================ Utility functions ============================ */
-
-/* We use a private localtime implementation which is fork-safe. The logging
- * function of Redis may be called from other threads. */
-void nolocks_localtime(struct tm *tmp, time_t t, time_t tz, int dst);
-
-/* Low level logging. To use only for very big messages, otherwise
- * serverLog() is to prefer. */
-void serverLogRaw(int level, const char *msg) {
-    const int syslogLevelMap[] = { LOG_DEBUG, LOG_INFO, LOG_NOTICE, LOG_WARNING };
-    const char *c = ".-*#";
-    FILE *fp;
-    char buf[64];
-    int rawmode = (level & LL_RAW);
-    int log_to_stdout = server.logfile[0] == '\0';
-
-    level &= 0xff; /* clear flags */
-    if (level < server.verbosity) return;
-
-    fp = log_to_stdout ? stdout : fopen(server.logfile,"a");
-    if (!fp) return;
-
-    if (rawmode) {
-        fprintf(fp,"%s",msg);
-    } else {
-        int off;
-        struct timeval tv;
-        int role_char;
-        pid_t pid = getpid();
-
-        gettimeofday(&tv,NULL);
-        struct tm tm;
-        nolocks_localtime(&tm,tv.tv_sec,server.timezone,server.daylight_active);
-        off = strftime(buf,sizeof(buf),"%d %b %Y %H:%M:%S.",&tm);
-        snprintf(buf+off,sizeof(buf)-off,"%03d",(int)tv.tv_usec/1000);
-        if (server.sentinel_mode) {
-            role_char = 'X'; /* Sentinel. */
-        } else if (pid != server.pid) {
-            role_char = 'C'; /* RDB / AOF writing child. */
-        } else {
-            role_char = (server.masterhost ? 'S':'M'); /* Slave or Master. */
-        }
-        fprintf(fp,"%d:%c %s %c %s\n",
-            (int)getpid(),role_char, buf,c[level],msg);
-    }
-    fflush(fp);
-
-    if (!log_to_stdout) fclose(fp);
-    if (server.syslog_enabled) syslog(syslogLevelMap[level], "%s", msg);
-}
-
-/* Like serverLogRaw() but with printf-alike support. This is the function that
- * is used across the code. The raw version is only used in order to dump
- * the INFO output on crash. */
-void _serverLog(int level, const char *fmt, ...) {
-    va_list ap;
-    char msg[LOG_MAX_LEN];
-
-    va_start(ap, fmt);
-    vsnprintf(msg, sizeof(msg), fmt, ap);
-    va_end(ap);
-
-    serverLogRaw(level,msg);
-}
-
-/* Log a fixed message without printf-alike capabilities, in a way that is
- * safe to call from a signal handler.
- *
- * We actually use this only for signals that are not fatal from the point
- * of view of Redis. Signals that are going to kill the server anyway and
- * where we need printf-alike features are served by serverLog(). */
-void serverLogFromHandler(int level, const char *msg) {
-    int fd;
-    int log_to_stdout = server.logfile[0] == '\0';
-    char buf[64];
-
-    if ((level&0xff) < server.verbosity || (log_to_stdout && server.daemonize))
-        return;
-    fd = log_to_stdout ? STDOUT_FILENO :
-                         open(server.logfile, O_APPEND|O_CREAT|O_WRONLY, 0644);
-    if (fd == -1) return;
-    ll2string(buf,sizeof(buf),getpid());
-    if (write(fd,buf,strlen(buf)) == -1) goto err;
-    if (write(fd,":signal-handler (",17) == -1) goto err;
-    ll2string(buf,sizeof(buf),time(NULL));
-    if (write(fd,buf,strlen(buf)) == -1) goto err;
-    if (write(fd,") ",2) == -1) goto err;
-    if (write(fd,msg,strlen(msg)) == -1) goto err;
-    if (write(fd,"\n",1) == -1) goto err;
-err:
-    if (!log_to_stdout) close(fd);
-}
-
-/* Return the UNIX time in microseconds */
-long long ustime(void) {
-    struct timeval tv;
-    long long ust;
-
-    gettimeofday(&tv, NULL);
-    ust = ((long long)tv.tv_sec)*1000000;
-    ust += tv.tv_usec;
-    return ust;
-}
-
-/* Return the UNIX time in milliseconds */
-mstime_t mstime(void) {
-    return ustime()/1000;
-}
-
-/* After an RDB dump or AOF rewrite we exit from children using _exit() instead of
- * exit(), because the latter may interact with the same file objects used by
- * the parent process. However if we are testing the coverage normal exit() is
- * used in order to obtain the right coverage information. */
-void exitFromChild(int retcode) {
-#ifdef COVERAGE_TEST
-    exit(retcode);
-#else
-    _exit(retcode);
-#endif
-}
-
-/*====================== Hash table type implementation  ==================== */
-
-/* This is a hash table type that uses the SDS dynamic strings library as
- * keys and redis objects as values (objects can hold SDS strings,
- * lists, sets). */
-
-void dictVanillaFree(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-    zfree(val);
-}
-
-void dictListDestructor(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-    listRelease((list*)val);
-}
-
-int dictSdsKeyCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    int l1,l2;
-    DICT_NOTUSED(privdata);
-
-    l1 = sdslen((sds)key1);
-    l2 = sdslen((sds)key2);
-    if (l1 != l2) return 0;
-    return memcmp(key1, key2, l1) == 0;
-}
-
-/* A case insensitive version used for the command lookup table and other
- * places where case insensitive non binary-safe comparison is needed. */
-int dictSdsKeyCaseCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    DICT_NOTUSED(privdata);
-
-    return strcasecmp(key1, key2) == 0;
-}
-
-void dictObjectDestructor(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-
-    if (val == NULL) return; /* Lazy freeing will set value to NULL. */
-    decrRefCount(val);
-}
-
-void dictSdsDestructor(void *privdata, void *val)
-{
-    DICT_NOTUSED(privdata);
-
-    sdsfree(val);
-}
-
-int dictObjKeyCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    const robj *o1 = key1, *o2 = key2;
-    return dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);
-}
-
-uint64_t dictObjHash(const void *key) {
-    const robj *o = key;
-    return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
-}
-
-uint64_t dictSdsHash(const void *key) {
-    return dictGenHashFunction((unsigned char*)key, sdslen((char*)key));
-}
-
-uint64_t dictSdsCaseHash(const void *key) {
-    return dictGenCaseHashFunction((unsigned char*)key, sdslen((char*)key));
-}
-
-int dictEncObjKeyCompare(void *privdata, const void *key1,
-        const void *key2)
-{
-    robj *o1 = (robj*) key1, *o2 = (robj*) key2;
-    int cmp;
-
-    if (o1->encoding == OBJ_ENCODING_INT &&
-        o2->encoding == OBJ_ENCODING_INT)
-            return o1->ptr == o2->ptr;
-
-    /* Due to OBJ_STATIC_REFCOUNT, we avoid calling getDecodedObject() without
-     * good reasons, because it would incrRefCount() the object, which
-     * is invalid. So we check to make sure dictFind() works with static
-     * objects as well. */
-    if (o1->refcount != OBJ_STATIC_REFCOUNT) o1 = getDecodedObject(o1);
-    if (o2->refcount != OBJ_STATIC_REFCOUNT) o2 = getDecodedObject(o2);
-    cmp = dictSdsKeyCompare(privdata,o1->ptr,o2->ptr);
-    if (o1->refcount != OBJ_STATIC_REFCOUNT) decrRefCount(o1);
-    if (o2->refcount != OBJ_STATIC_REFCOUNT) decrRefCount(o2);
-    return cmp;
-}
-
-uint64_t dictEncObjHash(const void *key) {
-    robj *o = (robj*) key;
-
-    if (sdsEncodedObject(o)) {
-        return dictGenHashFunction(o->ptr, sdslen((sds)o->ptr));
-    } else if (o->encoding == OBJ_ENCODING_INT) {
-        char buf[32];
-        int len;
-
-        len = ll2string(buf,32,(long)o->ptr);
-        return dictGenHashFunction((unsigned char*)buf, len);
-    } else {
-        serverPanic("Unknown string encoding");
-    }
-}
-
-/* Return 1 if currently we allow dict to expand. Dict may allocate huge
- * memory to contain hash buckets when dict expands, that may lead redis
- * rejects user's requests or evicts some keys, we can stop dict to expand
- * provisionally if used memory will be over maxmemory after dict expands,
- * but to guarantee the performance of redis, we still allow dict to expand
- * if dict load factor exceeds HASHTABLE_MAX_LOAD_FACTOR. */
-int dictExpandAllowed(size_t moreMem, double usedRatio) {
-    if (usedRatio <= HASHTABLE_MAX_LOAD_FACTOR) {
-        return !overMaxmemoryAfterAlloc(moreMem);
-    } else {
-        return 1;
-    }
-}
-
-/* Generic hash table type where keys are Redis Objects, Values
- * dummy pointers. */
-dictType objectKeyPointerValueDictType = {
-    dictEncObjHash,            /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictEncObjKeyCompare,      /* key compare */
-    dictObjectDestructor,      /* key destructor */
-    NULL,                      /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* Like objectKeyPointerValueDictType(), but values can be destroyed, if
- * not NULL, calling zfree(). */
-dictType objectKeyHeapPointerValueDictType = {
-    dictEncObjHash,            /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictEncObjKeyCompare,      /* key compare */
-    dictObjectDestructor,      /* key destructor */
-    dictVanillaFree,           /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* Set dictionary type. Keys are SDS strings, values are not used. */
-dictType setDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    dictSdsDestructor,         /* key destructor */
-    NULL                       /* val destructor */
-};
-
-/* Sorted sets hash (note: a skiplist is used in addition to the hash table) */
-dictType zsetDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* Note: SDS string shared & freed by skiplist */
-    NULL,                      /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* Db->dict, keys are sds strings, vals are Redis objects. */
-dictType dbDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    dictObjectDestructor,       /* val destructor */
-    dictExpandAllowed           /* allow to expand */
-};
-
-/* server.lua_scripts sha (as sds string) -> scripts (as robj) cache. */
-dictType shaScriptObjectDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    dictObjectDestructor,       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Db->expires */
-dictType dbExpiresDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    NULL,                       /* key destructor */
-    NULL,                       /* val destructor */
-    dictExpandAllowed           /* allow to expand */
-};
-
-/* Command table. sds string -> command struct pointer. */
-dictType commandTableDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Hash type hash table (note that small hashes are represented with ziplists) */
-dictType hashDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    dictSdsDestructor,          /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Dict type without destructor */
-dictType sdsReplyDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    NULL,                       /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Keylist hash table type has unencoded redis objects as keys and
- * lists as values. It's used for blocking operations (BLPOP) and to
- * map swapped keys to a list of clients waiting for this keys to be loaded. */
-dictType keylistDictType = {
-    dictObjHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictObjKeyCompare,          /* key compare */
-    dictObjectDestructor,       /* key destructor */
-    dictListDestructor,         /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Cluster nodes hash table, mapping nodes addresses 1.2.3.4:6379 to
- * clusterNode structures. */
-dictType clusterNodesDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Cluster re-addition blacklist. This maps node IDs to the time
- * we can re-add this node. The goal is to avoid readding a removed
- * node for some time. */
-dictType clusterNodesBlackListDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Modules system dictionary type. Keys are module name,
- * values are pointer to RedisModule struct. */
-dictType modulesDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Migrate cache dict type. */
-dictType migrateCacheDictType = {
-    dictSdsHash,                /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCompare,          /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-/* Replication cached script dict (server.repl_scriptcache_dict).
- * Keys are sds SHA1 strings, while values are not used at all in the current
- * implementation. */
-dictType replScriptCacheDictType = {
-    dictSdsCaseHash,            /* hash function */
-    NULL,                       /* key dup */
-    NULL,                       /* val dup */
-    dictSdsKeyCaseCompare,      /* key compare */
-    dictSdsDestructor,          /* key destructor */
-    NULL,                       /* val destructor */
-    NULL                        /* allow to expand */
-};
-
-int htNeedsResize(dict *dict) {
-    long long size, used;
-
-    size = dictSlots(dict);
-    used = dictSize(dict);
-    return (size > DICT_HT_INITIAL_SIZE &&
-            (used*100/size < HASHTABLE_MIN_FILL));
-}
-
-/* If the percentage of used slots in the HT reaches HASHTABLE_MIN_FILL
- * we resize the hash table to save memory */
-void tryResizeHashTables(int dbid) {
-    if (htNeedsResize(server.db[dbid].dict))
-        dictResize(server.db[dbid].dict);
-    if (htNeedsResize(server.db[dbid].expires))
-        dictResize(server.db[dbid].expires);
-}
-
-/* Our hash table implementation performs rehashing incrementally while
- * we write/read from the hash table. Still if the server is idle, the hash
- * table will use two tables for a long time. So we try to use 1 millisecond
- * of CPU time at every call of this function to perform some rehashing.
- *
- * The function returns 1 if some rehashing was performed, otherwise 0
- * is returned. */
-int incrementallyRehash(int dbid) {
-    /* Keys dictionary */
-    if (dictIsRehashing(server.db[dbid].dict)) {
-        dictRehashMilliseconds(server.db[dbid].dict,1);
-        return 1; /* already used our millisecond for this loop... */
-    }
-    /* Expires */
-    if (dictIsRehashing(server.db[dbid].expires)) {
-        dictRehashMilliseconds(server.db[dbid].expires,1);
-        return 1; /* already used our millisecond for this loop... */
-    }
-    return 0;
-}
-
-/* This function is called once a background process of some kind terminates,
- * as we want to avoid resizing the hash tables when there is a child in order
- * to play well with copy-on-write (otherwise when a resize happens lots of
- * memory pages are copied). The goal of this function is to update the ability
- * for dict.c to resize the hash tables accordingly to the fact we have an
- * active fork child running. */
-void updateDictResizePolicy(void) {
-    if (!hasActiveChildProcess())
-        dictEnableResize();
-    else
-        dictDisableResize();
-}
-
-const char *strChildType(int type) {
-    switch(type) {
-        case CHILD_TYPE_RDB: return "RDB";
-        case CHILD_TYPE_AOF: return "AOF";
-        case CHILD_TYPE_LDB: return "LDB";
-        case CHILD_TYPE_MODULE: return "MODULE";
-        default: return "Unknown";
-    }
-}
-
-/* Return true if there are active children processes doing RDB saving,
- * AOF rewriting, or some side process spawned by a loaded module. */
-int hasActiveChildProcess() {
-    return server.child_pid != -1;
-}
-
-void resetChildState() {
-    server.child_type = CHILD_TYPE_NONE;
-    server.child_pid = -1;
-    server.stat_current_cow_bytes = 0;
-    server.stat_current_cow_updated = 0;
-    server.stat_current_save_keys_processed = 0;
-    server.stat_module_progress = 0;
-    server.stat_current_save_keys_total = 0;
-    updateDictResizePolicy();
-    closeChildInfoPipe();
-    moduleFireServerEvent(REDISMODULE_EVENT_FORK_CHILD,
-                          REDISMODULE_SUBEVENT_FORK_CHILD_DIED,
-                          NULL);
-}
-
-/* Return if child type is mutual exclusive with other fork children */
-int isMutuallyExclusiveChildType(int type) {
-    return type == CHILD_TYPE_RDB || type == CHILD_TYPE_AOF || type == CHILD_TYPE_MODULE;
-}
-
-/* Return true if this instance has persistence completely turned off:
- * both RDB and AOF are disabled. */
-int allPersistenceDisabled(void) {
-    return server.saveparamslen == 0 && server.aof_state == AOF_OFF;
-}
-
-/* ======================= Cron: called every 100 ms ======================== */
-
-/* Add a sample to the operations per second array of samples. */
-void trackInstantaneousMetric(int metric, long long current_reading) {
-    long long now = mstime();
-    long long t = now - server.inst_metric[metric].last_sample_time;
-    long long ops = current_reading -
-                    server.inst_metric[metric].last_sample_count;
-    long long ops_sec;
-
-    ops_sec = t > 0 ? (ops*1000/t) : 0;
-
-    server.inst_metric[metric].samples[server.inst_metric[metric].idx] =
-        ops_sec;
-    server.inst_metric[metric].idx++;
-    server.inst_metric[metric].idx %= STATS_METRIC_SAMPLES;
-    server.inst_metric[metric].last_sample_time = now;
-    server.inst_metric[metric].last_sample_count = current_reading;
-}
-
-/* Return the mean of all the samples. */
-long long getInstantaneousMetric(int metric) {
-    int j;
-    long long sum = 0;
-
-    for (j = 0; j < STATS_METRIC_SAMPLES; j++)
-        sum += server.inst_metric[metric].samples[j];
-    return sum / STATS_METRIC_SAMPLES;
-}
-
-/* The client query buffer is an sds.c string that can end with a lot of
- * free space not used, this function reclaims space if needed.
- *
- * The function always returns 0 as it never terminates the client. */
-int clientsCronResizeQueryBuffer(client *c) {
-    size_t querybuf_size = sdsAllocSize(c->querybuf);
-    time_t idletime = server.unixtime - c->lastinteraction;
-
-    /* There are two conditions to resize the query buffer:
-     * 1) Query buffer is > BIG_ARG and too big for latest peak.
-     * 2) Query buffer is > BIG_ARG and client is idle. */
-    if (querybuf_size > PROTO_MBULK_BIG_ARG &&
-         ((querybuf_size/(c->querybuf_peak+1)) > 2 ||
-          idletime > 2))
-    {
-        /* Only resize the query buffer if it is actually wasting
-         * at least a few kbytes. */
-        if (sdsavail(c->querybuf) > 1024*4) {
-            c->querybuf = sdsRemoveFreeSpace(c->querybuf);
-        }
-    }
-    /* Reset the peak again to capture the peak memory usage in the next
-     * cycle. */
-    c->querybuf_peak = 0;
-
-    /* Clients representing masters also use a "pending query buffer" that
-     * is the yet not applied part of the stream we are reading. Such buffer
-     * also needs resizing from time to time, otherwise after a very large
-     * transfer (a huge value or a big MIGRATE operation) it will keep using
-     * a lot of memory. */
-    if (c->flags & CLIENT_MASTER) {
-        /* There are two conditions to resize the pending query buffer:
-         * 1) Pending Query buffer is > LIMIT_PENDING_QUERYBUF.
-         * 2) Used length is smaller than pending_querybuf_size/2 */
-        size_t pending_querybuf_size = sdsAllocSize(c->pending_querybuf);
-        if(pending_querybuf_size > LIMIT_PENDING_QUERYBUF &&
-           sdslen(c->pending_querybuf) < (pending_querybuf_size/2))
-        {
-            c->pending_querybuf = sdsRemoveFreeSpace(c->pending_querybuf);
-        }
-    }
-    return 0;
-}
-
-/* This function is used in order to track clients using the biggest amount
- * of memory in the latest few seconds. This way we can provide such information
- * in the INFO output (clients section), without having to do an O(N) scan for
- * all the clients.
- *
- * This is how it works. We have an array of CLIENTS_PEAK_MEM_USAGE_SLOTS slots
- * where we track, for each, the biggest client output and input buffers we
- * saw in that slot. Every slot correspond to one of the latest seconds, since
- * the array is indexed by doing UNIXTIME % CLIENTS_PEAK_MEM_USAGE_SLOTS.
- *
- * When we want to know what was recently the peak memory usage, we just scan
- * such few slots searching for the maximum value. */
-#define CLIENTS_PEAK_MEM_USAGE_SLOTS 8
-size_t ClientsPeakMemInput[CLIENTS_PEAK_MEM_USAGE_SLOTS] = {0};
-size_t ClientsPeakMemOutput[CLIENTS_PEAK_MEM_USAGE_SLOTS] = {0};
-
-int clientsCronTrackExpansiveClients(client *c, int time_idx) {
-    size_t in_usage = sdsZmallocSize(c->querybuf) + c->argv_len_sum +
-	              (c->argv ? zmalloc_size(c->argv) : 0);
-    size_t out_usage = getClientOutputBufferMemoryUsage(c);
-
-    /* Track the biggest values observed so far in this slot. */
-    if (in_usage > ClientsPeakMemInput[time_idx]) ClientsPeakMemInput[time_idx] = in_usage;
-    if (out_usage > ClientsPeakMemOutput[time_idx]) ClientsPeakMemOutput[time_idx] = out_usage;
-
-    return 0; /* This function never terminates the client. */
-}
-
-/* Iterating all the clients in getMemoryOverheadData() is too slow and
- * in turn would make the INFO command too slow. So we perform this
- * computation incrementally and track the (not instantaneous but updated
- * to the second) total memory used by clients using clinetsCron() in
- * a more incremental way (depending on server.hz). */
-int clientsCronTrackClientsMemUsage(client *c) {
-    size_t mem = 0;
-    int type = getClientType(c);
-    mem += getClientOutputBufferMemoryUsage(c);
-    mem += sdsZmallocSize(c->querybuf);
-    mem += zmalloc_size(c);
-    mem += c->argv_len_sum;
-    if (c->argv) mem += zmalloc_size(c->argv);
-    /* Now that we have the memory used by the client, remove the old
-     * value from the old category, and add it back. */
-    server.stat_clients_type_memory[c->client_cron_last_memory_type] -=
-        c->client_cron_last_memory_usage;
-    server.stat_clients_type_memory[type] += mem;
-    /* Remember what we added and where, to remove it next time. */
-    c->client_cron_last_memory_usage = mem;
-    c->client_cron_last_memory_type = type;
-    return 0;
-}
-
-/* Return the max samples in the memory usage of clients tracked by
- * the function clientsCronTrackExpansiveClients(). */
-void getExpansiveClientsInfo(size_t *in_usage, size_t *out_usage) {
-    size_t i = 0, o = 0;
-    for (int j = 0; j < CLIENTS_PEAK_MEM_USAGE_SLOTS; j++) {
-        if (ClientsPeakMemInput[j] > i) i = ClientsPeakMemInput[j];
-        if (ClientsPeakMemOutput[j] > o) o = ClientsPeakMemOutput[j];
-    }
-    *in_usage = i;
-    *out_usage = o;
-}
-
-/* This function is called by serverCron() and is used in order to perform
- * operations on clients that are important to perform constantly. For instance
- * we use this function in order to disconnect clients after a timeout, including
- * clients blocked in some blocking command with a non-zero timeout.
- *
- * The function makes some effort to process all the clients every second, even
- * if this cannot be strictly guaranteed, since serverCron() may be called with
- * an actual frequency lower than server.hz in case of latency events like slow
- * commands.
- *
- * It is very important for this function, and the functions it calls, to be
- * very fast: sometimes Redis has tens of hundreds of connected clients, and the
- * default server.hz value is 10, so sometimes here we need to process thousands
- * of clients per second, turning this function into a source of latency.
- */
-#define CLIENTS_CRON_MIN_ITERATIONS 5
-void clientsCron(void) {
-    /* Try to process at least numclients/server.hz of clients
-     * per call. Since normally (if there are no big latency events) this
-     * function is called server.hz times per second, in the average case we
-     * process all the clients in 1 second. */
-    int numclients = listLength(server.clients);
-    int iterations = numclients/server.hz;
-    mstime_t now = mstime();
-
-    /* Process at least a few clients while we are at it, even if we need
-     * to process less than CLIENTS_CRON_MIN_ITERATIONS to meet our contract
-     * of processing each client once per second. */
-    if (iterations < CLIENTS_CRON_MIN_ITERATIONS)
-        iterations = (numclients < CLIENTS_CRON_MIN_ITERATIONS) ?
-                     numclients : CLIENTS_CRON_MIN_ITERATIONS;
-
-
-    int curr_peak_mem_usage_slot = server.unixtime % CLIENTS_PEAK_MEM_USAGE_SLOTS;
-    /* Always zero the next sample, so that when we switch to that second, we'll
-     * only register samples that are greater in that second without considering
-     * the history of such slot.
-     *
-     * Note: our index may jump to any random position if serverCron() is not
-     * called for some reason with the normal frequency, for instance because
-     * some slow command is called taking multiple seconds to execute. In that
-     * case our array may end containing data which is potentially older
-     * than CLIENTS_PEAK_MEM_USAGE_SLOTS seconds: however this is not a problem
-     * since here we want just to track if "recently" there were very expansive
-     * clients from the POV of memory usage. */
-    int zeroidx = (curr_peak_mem_usage_slot+1) % CLIENTS_PEAK_MEM_USAGE_SLOTS;
-    ClientsPeakMemInput[zeroidx] = 0;
-    ClientsPeakMemOutput[zeroidx] = 0;
-
-
-    while(listLength(server.clients) && iterations--) {
-        client *c;
-        listNode *head;
-
-        /* Rotate the list, take the current head, process.
-         * This way if the client must be removed from the list it's the
-         * first element and we don't incur into O(N) computation. */
-        listRotateTailToHead(server.clients);
-        head = listFirst(server.clients);
-        c = listNodeValue(head);
-        /* The following functions do different service checks on the client.
-         * The protocol is that they return non-zero if the client was
-         * terminated. */
-        if (clientsCronHandleTimeout(c,now)) continue;
-        if (clientsCronResizeQueryBuffer(c)) continue;
-        if (clientsCronTrackExpansiveClients(c, curr_peak_mem_usage_slot)) continue;
-        if (clientsCronTrackClientsMemUsage(c)) continue;
-        if (closeClientOnOutputBufferLimitReached(c, 0)) continue;
-    }
-}
-
-/* This function handles 'background' operations we are required to do
- * incrementally in Redis databases, such as active key expiring, resizing,
- * rehashing. */
-void databasesCron(void) {
-    /* Expire keys by random sampling. Not required for slaves
-     * as master will synthesize DELs for us. */
-    if (server.active_expire_enabled) {
-        if (iAmMaster()) {
-            activeExpireCycle(ACTIVE_EXPIRE_CYCLE_SLOW);
-        } else {
-            expireSlaveKeys();
-        }
-    }
-
-    /* Defrag keys gradually. */
-    activeDefragCycle();
-
-    /* Perform hash tables rehashing if needed, but only if there are no
-     * other processes saving the DB on disk. Otherwise rehashing is bad
-     * as will cause a lot of copy-on-write of memory pages. */
-    if (!hasActiveChildProcess()) {
-        /* We use global counters so if we stop the computation at a given
-         * DB we'll be able to start from the successive in the next
-         * cron loop iteration. */
-        static unsigned int resize_db = 0;
-        static unsigned int rehash_db = 0;
-        int dbs_per_call = CRON_DBS_PER_CALL;
-        int j;
-
-        /* Don't test more DBs than we have. */
-        if (dbs_per_call > server.dbnum) dbs_per_call = server.dbnum;
-
-        /* Resize */
-        for (j = 0; j < dbs_per_call; j++) {
-            tryResizeHashTables(resize_db % server.dbnum);
-            resize_db++;
-        }
-
-        /* Rehash */
-        if (server.activerehashing) {
-            for (j = 0; j < dbs_per_call; j++) {
-                int work_done = incrementallyRehash(rehash_db);
-                if (work_done) {
-                    /* If the function did some work, stop here, we'll do
-                     * more at the next cron loop. */
-                    break;
-                } else {
-                    /* If this db didn't need rehash, we'll try the next one. */
-                    rehash_db++;
-                    rehash_db %= server.dbnum;
-                }
-            }
-        }
-    }
-}
-
-/* We take a cached value of the unix time in the global state because with
- * virtual memory and aging there is to store the current time in objects at
- * every object access, and accuracy is not needed. To access a global var is
- * a lot faster than calling time(NULL).
- *
- * This function should be fast because it is called at every command execution
- * in call(), so it is possible to decide if to update the daylight saving
- * info or not using the 'update_daylight_info' argument. Normally we update
- * such info only when calling this function from serverCron() but not when
- * calling it from call(). */
-void updateCachedTime(int update_daylight_info) {
-    server.ustime = ustime();
-    server.mstime = server.ustime / 1000;
-    time_t unixtime = server.mstime / 1000;
-    atomicSet(server.unixtime, unixtime);
-
-    /* To get information about daylight saving time, we need to call
-     * localtime_r and cache the result. However calling localtime_r in this
-     * context is safe since we will never fork() while here, in the main
-     * thread. The logging function will call a thread safe version of
-     * localtime that has no locks. */
-    if (update_daylight_info) {
-        struct tm tm;
-        time_t ut = server.unixtime;
-        localtime_r(&ut,&tm);
-        server.daylight_active = tm.tm_isdst;
-    }
-}
-
-void checkChildrenDone(void) {
-    int statloc = 0;
-    pid_t pid;
-
-    if ((pid = waitpid(-1, &statloc, WNOHANG)) != 0) {
-        int exitcode = WIFEXITED(statloc) ? WEXITSTATUS(statloc) : -1;
-        int bysignal = 0;
-
-        if (WIFSIGNALED(statloc)) bysignal = WTERMSIG(statloc);
-
-        /* sigKillChildHandler catches the signal and calls exit(), but we
-         * must make sure not to flag lastbgsave_status, etc incorrectly.
-         * We could directly terminate the child process via SIGUSR1
-         * without handling it */
-        if (exitcode == SERVER_CHILD_NOERROR_RETVAL) {
-            bysignal = SIGUSR1;
-            exitcode = 1;
-        }
-
-        if (pid == -1) {
-            serverLog(LL_WARNING,"waitpid() returned an error: %s. "
-                "child_type: %s, child_pid = %d",
-                strerror(errno),
-                strChildType(server.child_type),
-                (int) server.child_pid);
-        } else if (pid == server.child_pid) {
-            if (server.child_type == CHILD_TYPE_RDB) {
-                backgroundSaveDoneHandler(exitcode, bysignal);
-            } else if (server.child_type == CHILD_TYPE_AOF) {
-                backgroundRewriteDoneHandler(exitcode, bysignal);
-            } else if (server.child_type == CHILD_TYPE_MODULE) {
-                ModuleForkDoneHandler(exitcode, bysignal);
-            } else {
-                serverPanic("Unknown child type %d for child pid %d", server.child_type, server.child_pid);
-                exit(1);
-            }
-            if (!bysignal && exitcode == 0) receiveChildInfo();
-            resetChildState();
-        } else {
-            if (!ldbRemoveChild(pid)) {
-                serverLog(LL_WARNING,
-                          "Warning, detected child with unmatched pid: %ld",
-                          (long) pid);
-            }
-        }
-
-        /* start any pending forks immediately. */
-        replicationStartPendingFork();
-    }
-}
-
-/* Called from serverCron and loadingCron to update cached memory metrics. */
-void cronUpdateMemoryStats() {
-    /* Record the max memory used since the server was started. */
-    if (zmalloc_used_memory() > server.stat_peak_memory)
-        server.stat_peak_memory = zmalloc_used_memory();
-
-    run_with_period(100) {
-        /* Sample the RSS and other metrics here since this is a relatively slow call.
-         * We must sample the zmalloc_used at the same time we take the rss, otherwise
-         * the frag ratio calculate may be off (ratio of two samples at different times) */
-        server.cron_malloc_stats.process_rss = zmalloc_get_rss();
-        server.cron_malloc_stats.zmalloc_used = zmalloc_used_memory();
-        /* Sampling the allocator info can be slow too.
-         * The fragmentation ratio it'll show is potentially more accurate
-         * it excludes other RSS pages such as: shared libraries, LUA and other non-zmalloc
-         * allocations, and allocator reserved pages that can be pursed (all not actual frag) */
-        zmalloc_get_allocator_info(&server.cron_malloc_stats.allocator_allocated,
-                                   &server.cron_malloc_stats.allocator_active,
-                                   &server.cron_malloc_stats.allocator_resident);
-        /* in case the allocator isn't providing these stats, fake them so that
-         * fragmentation info still shows some (inaccurate metrics) */
-        if (!server.cron_malloc_stats.allocator_resident) {
-            /* LUA memory isn't part of zmalloc_used, but it is part of the process RSS,
-             * so we must deduct it in order to be able to calculate correct
-             * "allocator fragmentation" ratio */
-            size_t lua_memory = lua_gc(server.lua,LUA_GCCOUNT,0)*1024LL;
-            server.cron_malloc_stats.allocator_resident = server.cron_malloc_stats.process_rss - lua_memory;
-        }
-        if (!server.cron_malloc_stats.allocator_active)
-            server.cron_malloc_stats.allocator_active = server.cron_malloc_stats.allocator_resident;
-        if (!server.cron_malloc_stats.allocator_allocated)
-            server.cron_malloc_stats.allocator_allocated = server.cron_malloc_stats.zmalloc_used;
-    }
-}
-
-/* This is our timer interrupt, called server.hz times per second.
- * Here is where we do a number of things that need to be done asynchronously.
- * For instance:
- *
- * - Active expired keys collection (it is also performed in a lazy way on
- *   lookup).
- * - Software watchdog.
- * - Update some statistic.
- * - Incremental rehashing of the DBs hash tables.
- * - Triggering BGSAVE / AOF rewrite, and handling of terminated children.
- * - Clients timeout of different kinds.
- * - Replication reconnection.
- * - Many more...
- *
- * Everything directly called here will be called server.hz times per second,
- * so in order to throttle execution of things we want to do less frequently
- * a macro is used: run_with_period(milliseconds) { .... }
- */
-
-int serverCron(struct aeEventLoop *eventLoop, long long id, void *clientData) {
-    int j;
-    UNUSED(eventLoop);
-    UNUSED(id);
-    UNUSED(clientData);
-
-    /* Software watchdog: deliver the SIGALRM that will reach the signal
-     * handler if we don't return here fast enough. */
-    if (server.watchdog_period) watchdogScheduleSignal(server.watchdog_period);
-
-    /* Update the time cache. */
-    updateCachedTime(1);
-
-    server.hz = server.config_hz;
-    /* Adapt the server.hz value to the number of configured clients. If we have
-     * many clients, we want to call serverCron() with an higher frequency. */
-    if (server.dynamic_hz) {
-        while (listLength(server.clients) / server.hz >
-               MAX_CLIENTS_PER_CLOCK_TICK)
-        {
-            server.hz *= 2;
-            if (server.hz > CONFIG_MAX_HZ) {
-                server.hz = CONFIG_MAX_HZ;
-                break;
-            }
-        }
-    }
-
-    run_with_period(100) {
-        long long stat_net_input_bytes, stat_net_output_bytes;
-        atomicGet(server.stat_net_input_bytes, stat_net_input_bytes);
-        atomicGet(server.stat_net_output_bytes, stat_net_output_bytes);
-
-        trackInstantaneousMetric(STATS_METRIC_COMMAND,server.stat_numcommands);
-        trackInstantaneousMetric(STATS_METRIC_NET_INPUT,
-                stat_net_input_bytes);
-        trackInstantaneousMetric(STATS_METRIC_NET_OUTPUT,
-                stat_net_output_bytes);
-    }
-
-    /* We have just LRU_BITS bits per object for LRU information.
-     * So we use an (eventually wrapping) LRU clock.
-     *
-     * Note that even if the counter wraps it's not a big problem,
-     * everything will still work but some object will appear younger
-     * to Redis. However for this to happen a given object should never be
-     * touched for all the time needed to the counter to wrap, which is
-     * not likely.
-     *
-     * Note that you can change the resolution altering the
-     * LRU_CLOCK_RESOLUTION define. */
-    unsigned int lruclock = getLRUClock();
-    atomicSet(server.lruclock,lruclock);
-
-    cronUpdateMemoryStats();
-
-    /* We received a SIGTERM, shutting down here in a safe way, as it is
-     * not ok doing so inside the signal handler. */
-    if (server.shutdown_asap) {
-        if (prepareForShutdown(SHUTDOWN_NOFLAGS) == C_OK) exit(0);
-        serverLog(LL_WARNING,"SIGTERM received but errors trying to shut down the server, check the logs for more information");
-        server.shutdown_asap = 0;
-    }
-
-    /* Show some info about non-empty databases */
-    if (server.verbosity <= LL_VERBOSE) {
-        run_with_period(5000) {
-            for (j = 0; j < server.dbnum; j++) {
-                long long size, used, vkeys;
-
-                size = dictSlots(server.db[j].dict);
-                used = dictSize(server.db[j].dict);
-                vkeys = dictSize(server.db[j].expires);
-                if (used || vkeys) {
-                    serverLog(LL_VERBOSE,"DB %d: %lld keys (%lld volatile) in %lld slots HT.",j,used,vkeys,size);
-                }
-            }
-        }
-    }
-
-    /* Show information about connected clients */
-    if (!server.sentinel_mode) {
-        run_with_period(5000) {
-            serverLog(LL_DEBUG,
-                "%lu clients connected (%lu replicas), %zu bytes in use",
-                listLength(server.clients)-listLength(server.slaves),
-                listLength(server.slaves),
-                zmalloc_used_memory());
-        }
-    }
-
-    /* We need to do a few operations on clients asynchronously. */
-    clientsCron();
-
-    /* Handle background operations on Redis databases. */
-    databasesCron();
-
-    /* Start a scheduled AOF rewrite if this was requested by the user while
-     * a BGSAVE was in progress. */
-    if (!hasActiveChildProcess() &&
-        server.aof_rewrite_scheduled)
-    {
-        rewriteAppendOnlyFileBackground();
-    }
-
-    /* Check if a background saving or AOF rewrite in progress terminated. */
-    if (hasActiveChildProcess() || ldbPendingChildren())
-    {
-        run_with_period(1000) receiveChildInfo();
-        checkChildrenDone();
-    } else {
-        /* If there is not a background saving/rewrite in progress check if
-         * we have to save/rewrite now. */
-        for (j = 0; j < server.saveparamslen; j++) {
-            struct saveparam *sp = server.saveparams+j;
-
-            /* Save if we reached the given amount of changes,
-             * the given amount of seconds, and if the latest bgsave was
-             * successful or if, in case of an error, at least
-             * CONFIG_BGSAVE_RETRY_DELAY seconds already elapsed. */
-            if (server.dirty >= sp->changes &&
-                server.unixtime-server.lastsave > sp->seconds &&
-                (server.unixtime-server.lastbgsave_try >
-                 CONFIG_BGSAVE_RETRY_DELAY ||
-                 server.lastbgsave_status == C_OK))
-            {
-                serverLog(LL_NOTICE,"%d changes in %d seconds. Saving...",
-                    sp->changes, (int)sp->seconds);
-                rdbSaveInfo rsi, *rsiptr;
-                rsiptr = rdbPopulateSaveInfo(&rsi);
-                rdbSaveBackground(server.rdb_filename,rsiptr);
-                break;
-            }
-        }
-
-        /* Trigger an AOF rewrite if needed. */
-        if (server.aof_state == AOF_ON &&
-            !hasActiveChildProcess() &&
-            server.aof_rewrite_perc &&
-            server.aof_current_size > server.aof_rewrite_min_size)
-        {
-            long long base = server.aof_rewrite_base_size ?
-                server.aof_rewrite_base_size : 1;
-            long long growth = (server.aof_current_size*100/base) - 100;
-            if (growth >= server.aof_rewrite_perc) {
-                serverLog(LL_NOTICE,"Starting automatic rewriting of AOF on %lld%% growth",growth);
-                rewriteAppendOnlyFileBackground();
-            }
-        }
-    }
-    /* Just for the sake of defensive programming, to avoid forgeting to
-     * call this function when need. */
-    updateDictResizePolicy();
-
-
-    /* AOF postponed flush: Try at every cron cycle if the slow fsync
-     * completed. */
-    if (server.aof_state == AOF_ON && server.aof_flush_postponed_start)
-        flushAppendOnlyFile(0);
-
-    /* AOF write errors: in this case we have a buffer to flush as well and
-     * clear the AOF error in case of success to make the DB writable again,
-     * however to try every second is enough in case of 'hz' is set to
-     * a higher frequency. */
-    run_with_period(1000) {
-        if (server.aof_state == AOF_ON && server.aof_last_write_status == C_ERR)
-            flushAppendOnlyFile(0);
-    }
-
-    /* Clear the paused clients state if needed. */
-    checkClientPauseTimeoutAndReturnIfPaused();
-
-    /* Replication cron function -- used to reconnect to master,
-     * detect transfer failures, start background RDB transfers and so forth. 
-     * 
-     * If Redis is trying to failover then run the replication cron faster so
-     * progress on the handshake happens more quickly. */
-    if (server.failover_state != NO_FAILOVER) {
-        run_with_period(100) replicationCron();
-    } else {
-        run_with_period(1000) replicationCron();
-    }
-
-    /* Run the Redis Cluster cron. */
-    run_with_period(100) {
-        if (server.cluster_enabled) clusterCron();
-    }
-
-    /* Run the Sentinel timer if we are in sentinel mode. */
-    if (server.sentinel_mode) sentinelTimer();
-
-    /* Cleanup expired MIGRATE cached sockets. */
-    run_with_period(1000) {
-        migrateCloseTimedoutSockets();
-    }
-
-    /* Stop the I/O threads if we don't have enough pending work. */
-    stopThreadedIOIfNeeded();
-
-    /* Resize tracking keys table if needed. This is also done at every
-     * command execution, but we want to be sure that if the last command
-     * executed changes the value via CONFIG SET, the server will perform
-     * the operation even if completely idle. */
-    if (server.tracking_clients) trackingLimitUsedSlots();
-
-    /* Start a scheduled BGSAVE if the corresponding flag is set. This is
-     * useful when we are forced to postpone a BGSAVE because an AOF
-     * rewrite is in progress.
-     *
-     * Note: this code must be after the replicationCron() call above so
-     * make sure when refactoring this file to keep this order. This is useful
-     * because we want to give priority to RDB savings for replication. */
-    if (!hasActiveChildProcess() &&
-        server.rdb_bgsave_scheduled &&
-        (server.unixtime-server.lastbgsave_try > CONFIG_BGSAVE_RETRY_DELAY ||
-         server.lastbgsave_status == C_OK))
-    {
-        rdbSaveInfo rsi, *rsiptr;
-        rsiptr = rdbPopulateSaveInfo(&rsi);
-        if (rdbSaveBackground(server.rdb_filename,rsiptr) == C_OK)
-            server.rdb_bgsave_scheduled = 0;
-    }
-
-    /* Fire the cron loop modules event. */
-    RedisModuleCronLoopV1 ei = {REDISMODULE_CRON_LOOP_VERSION,server.hz};
-    moduleFireServerEvent(REDISMODULE_EVENT_CRON_LOOP,
-                          0,
-                          &ei);
-
-    server.cronloops++;
-    return 1000/server.hz;
-}
-
-
-void blockingOperationStarts() {
-    if(!server.blocking_op_nesting++){
-        updateCachedTime(0);
-        server.blocked_last_cron = server.mstime;
-    }
-}
-
-void blockingOperationEnds() {
-    if(!(--server.blocking_op_nesting)){
-        server.blocked_last_cron = 0;
-    }
-}
-
-/* This function fill in the role of serverCron during RDB or AOF loading, and
- * also during blocked scripts.
- * It attempts to do its duties at a similar rate as the configured server.hz,
- * and updates cronloops variable so that similarly to serverCron, the
- * run_with_period can be used. */
-void whileBlockedCron() {
-    /* Here we may want to perform some cron jobs (normally done server.hz times
-     * per second). */
-
-    /* Since this function depends on a call to blockingOperationStarts, let's
-     * make sure it was done. */
-    serverAssert(server.blocked_last_cron);
-
-    /* In case we where called too soon, leave right away. This way one time
-     * jobs after the loop below don't need an if. and we don't bother to start
-     * latency monitor if this function is called too often. */
-    if (server.blocked_last_cron >= server.mstime)
-        return;
-
-    mstime_t latency;
-    latencyStartMonitor(latency);
-
-    /* In some cases we may be called with big intervals, so we may need to do
-     * extra work here. This is because some of the functions in serverCron rely
-     * on the fact that it is performed every 10 ms or so. For instance, if
-     * activeDefragCycle needs to utilize 25% cpu, it will utilize 2.5ms, so we
-     * need to call it multiple times. */
-    long hz_ms = 1000/server.hz;
-    while (server.blocked_last_cron < server.mstime) {
-
-        /* Defrag keys gradually. */
-        activeDefragCycle();
-
-        server.blocked_last_cron += hz_ms;
-
-        /* Increment cronloop so that run_with_period works. */
-        server.cronloops++;
-    }
-
-    /* Other cron jobs do not need to be done in a loop. No need to check
-     * server.blocked_last_cron since we have an early exit at the top. */
-
-    /* Update memory stats during loading (excluding blocked scripts) */
-    if (server.loading) cronUpdateMemoryStats();
-
-    latencyEndMonitor(latency);
-    latencyAddSampleIfNeeded("while-blocked-cron",latency);
-}
-
-extern int ProcessingEventsWhileBlocked;
-
-/* This function gets called every time Redis is entering the
- * main loop of the event driven library, that is, before to sleep
- * for ready file descriptors.
- *
- * Note: This function is (currently) called from two functions:
- * 1. aeMain - The main server loop
- * 2. processEventsWhileBlocked - Process clients during RDB/AOF load
- *
- * If it was called from processEventsWhileBlocked we don't want
- * to perform all actions (For example, we don't want to expire
- * keys), but we do need to perform some actions.
- *
- * The most important is freeClientsInAsyncFreeQueue but we also
- * call some other low-risk functions. */
-void beforeSleep(struct aeEventLoop *eventLoop) {
-    UNUSED(eventLoop);
-
-    size_t zmalloc_used = zmalloc_used_memory();
-    if (zmalloc_used > server.stat_peak_memory)
-        server.stat_peak_memory = zmalloc_used;
-
-    /* Just call a subset of vital functions in case we are re-entering
-     * the event loop from processEventsWhileBlocked(). Note that in this
-     * case we keep track of the number of events we are processing, since
-     * processEventsWhileBlocked() wants to stop ASAP if there are no longer
-     * events to handle. */
-    if (ProcessingEventsWhileBlocked) {
-        uint64_t processed = 0;
-        processed += handleClientsWithPendingReadsUsingThreads();
-        processed += tlsProcessPendingData();
-        processed += handleClientsWithPendingWrites();
-        processed += freeClientsInAsyncFreeQueue();
-        server.events_processed_while_blocked += processed;
-        return;
-    }
-
-    /* Handle precise timeouts of blocked clients. */
-    handleBlockedClientsTimeout();
-
-    /* We should handle pending reads clients ASAP after event loop. */
-    handleClientsWithPendingReadsUsingThreads();
-
-    /* Handle TLS pending data. (must be done before flushAppendOnlyFile) */
-    tlsProcessPendingData();
-
-    /* If tls still has pending unread data don't sleep at all. */
-    aeSetDontWait(server.el, tlsHasPendingData());
-
-    /* Call the Redis Cluster before sleep function. Note that this function
-     * may change the state of Redis Cluster (from ok to fail or vice versa),
-     * so it's a good idea to call it before serving the unblocked clients
-     * later in this function. */
-    if (server.cluster_enabled) clusterBeforeSleep();
-
-    /* Run a fast expire cycle (the called function will return
-     * ASAP if a fast cycle is not needed). */
-    if (server.active_expire_enabled && server.masterhost == NULL)
-        activeExpireCycle(ACTIVE_EXPIRE_CYCLE_FAST);
-
-    /* Unblock all the clients blocked for synchronous replication
-     * in WAIT. */
-    if (listLength(server.clients_waiting_acks))
-        processClientsWaitingReplicas();
-
-    /* Check if there are clients unblocked by modules that implement
-     * blocking commands. */
-    if (moduleCount()) moduleHandleBlockedClients();
-
-    /* Try to process pending commands for clients that were just unblocked. */
-    if (listLength(server.unblocked_clients))
-        processUnblockedClients();
-
-    /* Send all the slaves an ACK request if at least one client blocked
-     * during the previous event loop iteration. Note that we do this after
-     * processUnblockedClients(), so if there are multiple pipelined WAITs
-     * and the just unblocked WAIT gets blocked again, we don't have to wait
-     * a server cron cycle in absence of other event loop events. See #6623.
-     * 
-     * We also don't send the ACKs while clients are paused, since it can
-     * increment the replication backlog, they'll be sent after the pause
-     * if we are still the master. */
-    if (server.get_ack_from_slaves && !checkClientPauseTimeoutAndReturnIfPaused()) {
-        robj *argv[3];
-
-        argv[0] = shared.replconf;
-        argv[1] = shared.getack;
-        argv[2] = shared.special_asterick; /* Not used argument. */
-        replicationFeedSlaves(server.slaves, server.slaveseldb, argv, 3);
-        server.get_ack_from_slaves = 0;
-    }
-
-    /* We may have recieved updates from clients about their current offset. NOTE:
-     * this can't be done where the ACK is recieved since failover will disconnect 
-     * our clients. */
-    updateFailoverStatus();
-
-    /* Send the invalidation messages to clients participating to the
-     * client side caching protocol in broadcasting (BCAST) mode. */
-    trackingBroadcastInvalidationMessages();
-
-    /* Write the AOF buffer on disk */
-    if (server.aof_state == AOF_ON)
-        flushAppendOnlyFile(0);
-
-    /* Handle writes with pending output buffers. */
-    handleClientsWithPendingWritesUsingThreads();
-
-    /* Close clients that need to be closed asynchronous */
-    freeClientsInAsyncFreeQueue();
-
-    /* Try to process blocked clients every once in while. Example: A module
-     * calls RM_SignalKeyAsReady from within a timer callback (So we don't
-     * visit processCommand() at all). */
-    handleClientsBlockedOnKeys();
-
-    /* Before we are going to sleep, let the threads access the dataset by
-     * releasing the GIL. Redis main thread will not touch anything at this
-     * time. */
-    if (moduleCount()) moduleReleaseGIL();
-
-    /* Do NOT add anything below moduleReleaseGIL !!! */
-}
-
-/* This function is called immediately after the event loop multiplexing
- * API returned, and the control is going to soon return to Redis by invoking
- * the different events callbacks. */
-void afterSleep(struct aeEventLoop *eventLoop) {
-    UNUSED(eventLoop);
-
-    /* Do NOT add anything above moduleAcquireGIL !!! */
-
-    /* Aquire the modules GIL so that their threads won't touch anything. */
-    if (!ProcessingEventsWhileBlocked) {
-        if (moduleCount()) moduleAcquireGIL();
-    }
-}
-
-/* =========================== Server initialization ======================== */
-
-void createSharedObjects(void) {
-    int j;
-
-    /* Shared command responses */
-    shared.crlf = createObject(OBJ_STRING,sdsnew("\r\n"));
-    shared.ok = createObject(OBJ_STRING,sdsnew("+OK\r\n"));
-    shared.emptybulk = createObject(OBJ_STRING,sdsnew("$0\r\n\r\n"));
-    shared.czero = createObject(OBJ_STRING,sdsnew(":0\r\n"));
-    shared.cone = createObject(OBJ_STRING,sdsnew(":1\r\n"));
-    shared.emptyarray = createObject(OBJ_STRING,sdsnew("*0\r\n"));
-    shared.pong = createObject(OBJ_STRING,sdsnew("+PONG\r\n"));
-    shared.queued = createObject(OBJ_STRING,sdsnew("+QUEUED\r\n"));
-    shared.emptyscan = createObject(OBJ_STRING,sdsnew("*2\r\n$1\r\n0\r\n*0\r\n"));
-    shared.space = createObject(OBJ_STRING,sdsnew(" "));
-    shared.colon = createObject(OBJ_STRING,sdsnew(":"));
-    shared.plus = createObject(OBJ_STRING,sdsnew("+"));
-
-    /* Shared command error responses */
-    shared.wrongtypeerr = createObject(OBJ_STRING,sdsnew(
-        "-WRONGTYPE Operation against a key holding the wrong kind of value\r\n"));
-    shared.err = createObject(OBJ_STRING,sdsnew("-ERR\r\n"));
-    shared.nokeyerr = createObject(OBJ_STRING,sdsnew(
-        "-ERR no such key\r\n"));
-    shared.syntaxerr = createObject(OBJ_STRING,sdsnew(
-        "-ERR syntax error\r\n"));
-    shared.sameobjecterr = createObject(OBJ_STRING,sdsnew(
-        "-ERR source and destination objects are the same\r\n"));
-    shared.outofrangeerr = createObject(OBJ_STRING,sdsnew(
-        "-ERR index out of range\r\n"));
-    shared.noscripterr = createObject(OBJ_STRING,sdsnew(
-        "-NOSCRIPT No matching script. Please use EVAL.\r\n"));
-    shared.loadingerr = createObject(OBJ_STRING,sdsnew(
-        "-LOADING Redis is loading the dataset in memory\r\n"));
-    shared.slowscripterr = createObject(OBJ_STRING,sdsnew(
-        "-BUSY Redis is busy running a script. You can only call SCRIPT KILL or SHUTDOWN NOSAVE.\r\n"));
-    shared.masterdownerr = createObject(OBJ_STRING,sdsnew(
-        "-MASTERDOWN Link with MASTER is down and replica-serve-stale-data is set to 'no'.\r\n"));
-    shared.bgsaveerr = createObject(OBJ_STRING,sdsnew(
-        "-MISCONF Redis is configured to save RDB snapshots, but it is currently not able to persist on disk. Commands that may modify the data set are disabled, because this instance is configured to report errors during writes if RDB snapshotting fails (stop-writes-on-bgsave-error option). Please check the Redis logs for details about the RDB error.\r\n"));
-    shared.roslaveerr = createObject(OBJ_STRING,sdsnew(
-        "-READONLY You can't write against a read only replica.\r\n"));
-    shared.noautherr = createObject(OBJ_STRING,sdsnew(
-        "-NOAUTH Authentication required.\r\n"));
-    shared.oomerr = createObject(OBJ_STRING,sdsnew(
-        "-OOM command not allowed when used memory > 'maxmemory'.\r\n"));
-    shared.execaborterr = createObject(OBJ_STRING,sdsnew(
-        "-EXECABORT Transaction discarded because of previous errors.\r\n"));
-    shared.noreplicaserr = createObject(OBJ_STRING,sdsnew(
-        "-NOREPLICAS Not enough good replicas to write.\r\n"));
-    shared.busykeyerr = createObject(OBJ_STRING,sdsnew(
-        "-BUSYKEY Target key name already exists.\r\n"));
-
-    /* The shared NULL depends on the protocol version. */
-    shared.null[0] = NULL;
-    shared.null[1] = NULL;
-    shared.null[2] = createObject(OBJ_STRING,sdsnew("$-1\r\n"));
-    shared.null[3] = createObject(OBJ_STRING,sdsnew("_\r\n"));
-
-    shared.nullarray[0] = NULL;
-    shared.nullarray[1] = NULL;
-    shared.nullarray[2] = createObject(OBJ_STRING,sdsnew("*-1\r\n"));
-    shared.nullarray[3] = createObject(OBJ_STRING,sdsnew("_\r\n"));
-
-    shared.emptymap[0] = NULL;
-    shared.emptymap[1] = NULL;
-    shared.emptymap[2] = createObject(OBJ_STRING,sdsnew("*0\r\n"));
-    shared.emptymap[3] = createObject(OBJ_STRING,sdsnew("%0\r\n"));
-
-    shared.emptyset[0] = NULL;
-    shared.emptyset[1] = NULL;
-    shared.emptyset[2] = createObject(OBJ_STRING,sdsnew("*0\r\n"));
-    shared.emptyset[3] = createObject(OBJ_STRING,sdsnew("~0\r\n"));
-
-    for (j = 0; j < PROTO_SHARED_SELECT_CMDS; j++) {
-        char dictid_str[64];
-        int dictid_len;
-
-        dictid_len = ll2string(dictid_str,sizeof(dictid_str),j);
-        shared.select[j] = createObject(OBJ_STRING,
-            sdscatprintf(sdsempty(),
-                "*2\r\n$6\r\nSELECT\r\n$%d\r\n%s\r\n",
-                dictid_len, dictid_str));
-    }
-    shared.messagebulk = createStringObject("$7\r\nmessage\r\n",13);
-    shared.pmessagebulk = createStringObject("$8\r\npmessage\r\n",14);
-    shared.subscribebulk = createStringObject("$9\r\nsubscribe\r\n",15);
-    shared.unsubscribebulk = createStringObject("$11\r\nunsubscribe\r\n",18);
-    shared.psubscribebulk = createStringObject("$10\r\npsubscribe\r\n",17);
-    shared.punsubscribebulk = createStringObject("$12\r\npunsubscribe\r\n",19);
-
-    /* Shared command names */
-    shared.del = createStringObject("DEL",3);
-    shared.unlink = createStringObject("UNLINK",6);
-    shared.rpop = createStringObject("RPOP",4);
-    shared.lpop = createStringObject("LPOP",4);
-    shared.lpush = createStringObject("LPUSH",5);
-    shared.rpoplpush = createStringObject("RPOPLPUSH",9);
-    shared.lmove = createStringObject("LMOVE",5);
-    shared.blmove = createStringObject("BLMOVE",6);
-    shared.zpopmin = createStringObject("ZPOPMIN",7);
-    shared.zpopmax = createStringObject("ZPOPMAX",7);
-    shared.multi = createStringObject("MULTI",5);
-    shared.exec = createStringObject("EXEC",4);
-    shared.hset = createStringObject("HSET",4);
-    shared.srem = createStringObject("SREM",4);
-    shared.xgroup = createStringObject("XGROUP",6);
-    shared.xclaim = createStringObject("XCLAIM",6);
-    shared.script = createStringObject("SCRIPT",6);
-    shared.replconf = createStringObject("REPLCONF",8);
-    shared.pexpireat = createStringObject("PEXPIREAT",9);
-    shared.pexpire = createStringObject("PEXPIRE",7);
-    shared.persist = createStringObject("PERSIST",7);
-    shared.set = createStringObject("SET",3);
-    shared.eval = createStringObject("EVAL",4);
-
-    /* Shared command argument */
-    shared.left = createStringObject("left",4);
-    shared.right = createStringObject("right",5);
-    shared.pxat = createStringObject("PXAT", 4);
-    shared.px = createStringObject("PX",2);
-    shared.time = createStringObject("TIME",4);
-    shared.retrycount = createStringObject("RETRYCOUNT",10);
-    shared.force = createStringObject("FORCE",5);
-    shared.justid = createStringObject("JUSTID",6);
-    shared.lastid = createStringObject("LASTID",6);
-    shared.default_username = createStringObject("default",7);
-    shared.ping = createStringObject("ping",4);
-    shared.setid = createStringObject("SETID",5);
-    shared.keepttl = createStringObject("KEEPTTL",7);
-    shared.load = createStringObject("LOAD",4);
-    shared.createconsumer = createStringObject("CREATECONSUMER",14);
-    shared.getack = createStringObject("GETACK",6);
-    shared.special_asterick = createStringObject("*",1);
-    shared.special_equals = createStringObject("=",1);
-    shared.redacted = makeObjectShared(createStringObject("(redacted)",10));
-
-    for (j = 0; j < OBJ_SHARED_INTEGERS; j++) {
-        shared.integers[j] =
-            makeObjectShared(createObject(OBJ_STRING,(void*)(long)j));
-        shared.integers[j]->encoding = OBJ_ENCODING_INT;
-    }
-    for (j = 0; j < OBJ_SHARED_BULKHDR_LEN; j++) {
-        shared.mbulkhdr[j] = createObject(OBJ_STRING,
-            sdscatprintf(sdsempty(),"*%d\r\n",j));
-        shared.bulkhdr[j] = createObject(OBJ_STRING,
-            sdscatprintf(sdsempty(),"$%d\r\n",j));
-    }
-    /* The following two shared objects, minstring and maxstrings, are not
-     * actually used for their value but as a special object meaning
-     * respectively the minimum possible string and the maximum possible
-     * string in string comparisons for the ZRANGEBYLEX command. */
-    shared.minstring = sdsnew("minstring");
-    shared.maxstring = sdsnew("maxstring");
-}
-
-void initServerConfig(void) {
-    int j;
-
-    updateCachedTime(1);
-    getRandomHexChars(server.runid,CONFIG_RUN_ID_SIZE);
-    server.runid[CONFIG_RUN_ID_SIZE] = '\0';
-    changeReplicationId();
-    clearReplicationId2();
-    server.hz = CONFIG_DEFAULT_HZ; /* Initialize it ASAP, even if it may get
-                                      updated later after loading the config.
-                                      This value may be used before the server
-                                      is initialized. */
-    server.timezone = getTimeZone(); /* Initialized by tzset(). */
-    server.configfile = NULL;
-    server.executable = NULL;
-    server.arch_bits = (sizeof(long) == 8) ? 64 : 32;
-    server.bindaddr_count = 0;
-    server.unixsocketperm = CONFIG_DEFAULT_UNIX_SOCKET_PERM;
-    server.ipfd.count = 0;
-    server.tlsfd.count = 0;
-    server.sofd = -1;
-    server.active_expire_enabled = 1;
-    server.skip_checksum_validation = 0;
-    server.saveparams = NULL;
-    server.loading = 0;
-    server.loading_rdb_used_mem = 0;
-    server.logfile = zstrdup(CONFIG_DEFAULT_LOGFILE);
-    server.aof_state = AOF_OFF;
-    server.aof_rewrite_base_size = 0;
-    server.aof_rewrite_scheduled = 0;
-    server.aof_flush_sleep = 0;
-    server.aof_last_fsync = time(NULL);
-    atomicSet(server.aof_bio_fsync_status,C_OK);
-    server.aof_rewrite_time_last = -1;
-    server.aof_rewrite_time_start = -1;
-    server.aof_lastbgrewrite_status = C_OK;
-    server.aof_delayed_fsync = 0;
-    server.aof_fd = -1;
-    server.aof_selected_db = -1; /* Make sure the first time will not match */
-    server.aof_flush_postponed_start = 0;
-    server.pidfile = NULL;
-    server.active_defrag_running = 0;
-    server.notify_keyspace_events = 0;
-    server.blocked_clients = 0;
-    memset(server.blocked_clients_by_type,0,
-           sizeof(server.blocked_clients_by_type));
-    server.shutdown_asap = 0;
-    server.cluster_configfile = zstrdup(CONFIG_DEFAULT_CLUSTER_CONFIG_FILE);
-    server.cluster_module_flags = CLUSTER_MODULE_FLAG_NONE;
-    server.migrate_cached_sockets = dictCreate(&migrateCacheDictType,NULL);
-    server.next_client_id = 1; /* Client IDs, start from 1 .*/
-    server.loading_process_events_interval_bytes = (1024*1024*2);
-
-    unsigned int lruclock = getLRUClock();
-    atomicSet(server.lruclock,lruclock);
-    resetServerSaveParams();
-
-    appendServerSaveParams(60*60,1);  /* save after 1 hour and 1 change */
-    appendServerSaveParams(300,100);  /* save after 5 minutes and 100 changes */
-    appendServerSaveParams(60,10000); /* save after 1 minute and 10000 changes */
-
-    /* Replication related */
-    server.masterauth = NULL;
-    server.masterhost = NULL;
-    server.masterport = 6379;
-    server.master = NULL;
-    server.cached_master = NULL;
-    server.master_initial_offset = -1;
-    server.repl_state = REPL_STATE_NONE;
-    server.repl_transfer_tmpfile = NULL;
-    server.repl_transfer_fd = -1;
-    server.repl_transfer_s = NULL;
-    server.repl_syncio_timeout = CONFIG_REPL_SYNCIO_TIMEOUT;
-    server.repl_down_since = 0; /* Never connected, repl is down since EVER. */
-    server.master_repl_offset = 0;
-
-    /* Replication partial resync backlog */
-    server.repl_backlog = NULL;
-    server.repl_backlog_histlen = 0;
-    server.repl_backlog_idx = 0;
-    server.repl_backlog_off = 0;
-    server.repl_no_slaves_since = time(NULL);
-
-    /* Failover related */
-    server.failover_end_time = 0;
-    server.force_failover = 0;
-    server.target_replica_host = NULL;
-    server.target_replica_port = 0;
-    server.failover_state = NO_FAILOVER;
-
-    /* Client output buffer limits */
-    for (j = 0; j < CLIENT_TYPE_OBUF_COUNT; j++)
-        server.client_obuf_limits[j] = clientBufferLimitsDefaults[j];
-
-    /* Linux OOM Score config */
-    for (j = 0; j < CONFIG_OOM_COUNT; j++)
-        server.oom_score_adj_values[j] = configOOMScoreAdjValuesDefaults[j];
-
-    /* Double constants initialization */
-    R_Zero = 0.0;
-    R_PosInf = 1.0/R_Zero;
-    R_NegInf = -1.0/R_Zero;
-    R_Nan = R_Zero/R_Zero;
-
-    /* Command table -- we initialize it here as it is part of the
-     * initial configuration, since command names may be changed via
-     * redis.conf using the rename-command directive. */
-    server.commands = dictCreate(&commandTableDictType,NULL);
-    server.orig_commands = dictCreate(&commandTableDictType,NULL);
-    populateCommandTable();
-    server.delCommand = lookupCommandByCString("del");
-    server.multiCommand = lookupCommandByCString("multi");
-    server.lpushCommand = lookupCommandByCString("lpush");
-    server.lpopCommand = lookupCommandByCString("lpop");
-    server.rpopCommand = lookupCommandByCString("rpop");
-    server.zpopminCommand = lookupCommandByCString("zpopmin");
-    server.zpopmaxCommand = lookupCommandByCString("zpopmax");
-    server.sremCommand = lookupCommandByCString("srem");
-    server.execCommand = lookupCommandByCString("exec");
-    server.expireCommand = lookupCommandByCString("expire");
-    server.pexpireCommand = lookupCommandByCString("pexpire");
-    server.xclaimCommand = lookupCommandByCString("xclaim");
-    server.xgroupCommand = lookupCommandByCString("xgroup");
-    server.rpoplpushCommand = lookupCommandByCString("rpoplpush");
-    server.lmoveCommand = lookupCommandByCString("lmove");
-
-    /* Debugging */
-    server.watchdog_period = 0;
-
-    /* By default we want scripts to be always replicated by effects
-     * (single commands executed by the script), and not by sending the
-     * script to the slave / AOF. This is the new way starting from
-     * Redis 5. However it is possible to revert it via redis.conf. */
-    server.lua_always_replicate_commands = 1;
-
-    /* Client Pause related */
-    server.client_pause_type = CLIENT_PAUSE_OFF;
-    server.client_pause_end_time = 0;   
-
-    initConfigValues();
-}
-
-extern char **environ;
-
-/* Restart the server, executing the same executable that started this
- * instance, with the same arguments and configuration file.
- *
- * The function is designed to directly call execve() so that the new
- * server instance will retain the PID of the previous one.
- *
- * The list of flags, that may be bitwise ORed together, alter the
- * behavior of this function:
- *
- * RESTART_SERVER_NONE              No flags.
- * RESTART_SERVER_GRACEFULLY        Do a proper shutdown before restarting.
- * RESTART_SERVER_CONFIG_REWRITE    Rewrite the config file before restarting.
- *
- * On success the function does not return, because the process turns into
- * a different process. On error C_ERR is returned. */
-int restartServer(int flags, mstime_t delay) {
-    int j;
-
-    /* Check if we still have accesses to the executable that started this
-     * server instance. */
-    if (access(server.executable,X_OK) == -1) {
-        serverLog(LL_WARNING,"Can't restart: this process has no "
-                             "permissions to execute %s", server.executable);
-        return C_ERR;
-    }
-
-    /* Config rewriting. */
-    if (flags & RESTART_SERVER_CONFIG_REWRITE &&
-        server.configfile &&
-        rewriteConfig(server.configfile, 0) == -1)
-    {
-        serverLog(LL_WARNING,"Can't restart: configuration rewrite process "
-                             "failed");
-        return C_ERR;
-    }
-
-    /* Perform a proper shutdown. */
-    if (flags & RESTART_SERVER_GRACEFULLY &&
-        prepareForShutdown(SHUTDOWN_NOFLAGS) != C_OK)
-    {
-        serverLog(LL_WARNING,"Can't restart: error preparing for shutdown");
-        return C_ERR;
-    }
-
-    /* Close all file descriptors, with the exception of stdin, stdout, strerr
-     * which are useful if we restart a Redis server which is not daemonized. */
-    for (j = 3; j < (int)server.maxclients + 1024; j++) {
-        /* Test the descriptor validity before closing it, otherwise
-         * Valgrind issues a warning on close(). */
-        if (fcntl(j,F_GETFD) != -1) close(j);
-    }
-
-    /* Execute the server with the original command line. */
-    if (delay) usleep(delay*1000);
-    zfree(server.exec_argv[0]);
-    server.exec_argv[0] = zstrdup(server.executable);
-    execve(server.executable,server.exec_argv,environ);
-
-    /* If an error occurred here, there is nothing we can do, but exit. */
-    _exit(1);
-
-    return C_ERR; /* Never reached. */
-}
-
-static void readOOMScoreAdj(void) {
-#ifdef HAVE_PROC_OOM_SCORE_ADJ
-    char buf[64];
-    int fd = open("/proc/self/oom_score_adj", O_RDONLY);
-
-    if (fd < 0) return;
-    if (read(fd, buf, sizeof(buf)) > 0)
-        server.oom_score_adj_base = atoi(buf);
-    close(fd);
-#endif
-}
-
-/* This function will configure the current process's oom_score_adj according
- * to user specified configuration. This is currently implemented on Linux
- * only.
- *
- * A process_class value of -1 implies OOM_CONFIG_MASTER or OOM_CONFIG_REPLICA,
- * depending on current role.
- */
-int setOOMScoreAdj(int process_class) {
-
-    if (server.oom_score_adj == OOM_SCORE_ADJ_NO) return C_OK;
-    if (process_class == -1)
-        process_class = (server.masterhost ? CONFIG_OOM_REPLICA : CONFIG_OOM_MASTER);
-
-    serverAssert(process_class >= 0 && process_class < CONFIG_OOM_COUNT);
-
-#ifdef HAVE_PROC_OOM_SCORE_ADJ
-    int fd;
-    int val;
-    char buf[64];
-
-    val = server.oom_score_adj_values[process_class];
-    if (server.oom_score_adj == OOM_SCORE_RELATIVE)
-        val += server.oom_score_adj_base;
-    if (val > 1000) val = 1000;
-    if (val < -1000) val = -1000;
-
-    snprintf(buf, sizeof(buf) - 1, "%d\n", val);
-
-    fd = open("/proc/self/oom_score_adj", O_WRONLY);
-    if (fd < 0 || write(fd, buf, strlen(buf)) < 0) {
-        serverLog(LOG_WARNING, "Unable to write oom_score_adj: %s", strerror(errno));
-        if (fd != -1) close(fd);
-        return C_ERR;
-    }
-
-    close(fd);
-    return C_OK;
-#else
-    /* Unsupported */
-    return C_ERR;
-#endif
-}
-
-/* This function will try to raise the max number of open files accordingly to
- * the configured max number of clients. It also reserves a number of file
- * descriptors (CONFIG_MIN_RESERVED_FDS) for extra operations of
- * persistence, listening sockets, log files and so forth.
- *
- * If it will not be possible to set the limit accordingly to the configured
- * max number of clients, the function will do the reverse setting
- * server.maxclients to the value that we can actually handle. */
-void adjustOpenFilesLimit(void) {
-    rlim_t maxfiles = server.maxclients+CONFIG_MIN_RESERVED_FDS;
-    struct rlimit limit;
-
-    if (getrlimit(RLIMIT_NOFILE,&limit) == -1) {
-        serverLog(LL_WARNING,"Unable to obtain the current NOFILE limit (%s), assuming 1024 and setting the max clients configuration accordingly.",
-            strerror(errno));
-        server.maxclients = 1024-CONFIG_MIN_RESERVED_FDS;
-    } else {
-        rlim_t oldlimit = limit.rlim_cur;
-
-        /* Set the max number of files if the current limit is not enough
-         * for our needs. */
-        if (oldlimit < maxfiles) {
-            rlim_t bestlimit;
-            int setrlimit_error = 0;
-
-            /* Try to set the file limit to match 'maxfiles' or at least
-             * to the higher value supported less than maxfiles. */
-            bestlimit = maxfiles;
-            while(bestlimit > oldlimit) {
-                rlim_t decr_step = 16;
-
-                limit.rlim_cur = bestlimit;
-                limit.rlim_max = bestlimit;
-                if (setrlimit(RLIMIT_NOFILE,&limit) != -1) break;
-                setrlimit_error = errno;
-
-                /* We failed to set file limit to 'bestlimit'. Try with a
-                 * smaller limit decrementing by a few FDs per iteration. */
-                if (bestlimit < decr_step) break;
-                bestlimit -= decr_step;
-            }
-
-            /* Assume that the limit we get initially is still valid if
-             * our last try was even lower. */
-            if (bestlimit < oldlimit) bestlimit = oldlimit;
-
-            if (bestlimit < maxfiles) {
-                unsigned int old_maxclients = server.maxclients;
-                server.maxclients = bestlimit-CONFIG_MIN_RESERVED_FDS;
-                /* maxclients is unsigned so may overflow: in order
-                 * to check if maxclients is now logically less than 1
-                 * we test indirectly via bestlimit. */
-                if (bestlimit <= CONFIG_MIN_RESERVED_FDS) {
-                    serverLog(LL_WARNING,"Your current 'ulimit -n' "
-                        "of %llu is not enough for the server to start. "
-                        "Please increase your open file limit to at least "
-                        "%llu. Exiting.",
-                        (unsigned long long) oldlimit,
-                        (unsigned long long) maxfiles);
-                    exit(1);
-                }
-                serverLog(LL_WARNING,"You requested maxclients of %d "
-                    "requiring at least %llu max file descriptors.",
-                    old_maxclients,
-                    (unsigned long long) maxfiles);
-                serverLog(LL_WARNING,"Server can't set maximum open files "
-                    "to %llu because of OS error: %s.",
-                    (unsigned long long) maxfiles, strerror(setrlimit_error));
-                serverLog(LL_WARNING,"Current maximum open files is %llu. "
-                    "maxclients has been reduced to %d to compensate for "
-                    "low ulimit. "
-                    "If you need higher maxclients increase 'ulimit -n'.",
-                    (unsigned long long) bestlimit, server.maxclients);
-            } else {
-                serverLog(LL_NOTICE,"Increased maximum number of open files "
-                    "to %llu (it was originally set to %llu).",
-                    (unsigned long long) maxfiles,
-                    (unsigned long long) oldlimit);
-            }
-        }
-    }
-}
-
-/* Check that server.tcp_backlog can be actually enforced in Linux according
- * to the value of /proc/sys/net/core/somaxconn, or warn about it. */
-void checkTcpBacklogSettings(void) {
-#ifdef HAVE_PROC_SOMAXCONN
-    FILE *fp = fopen("/proc/sys/net/core/somaxconn","r");
-    char buf[1024];
-    if (!fp) return;
-    if (fgets(buf,sizeof(buf),fp) != NULL) {
-        int somaxconn = atoi(buf);
-        if (somaxconn > 0 && somaxconn < server.tcp_backlog) {
-            serverLog(LL_WARNING,"WARNING: The TCP backlog setting of %d cannot be enforced because /proc/sys/net/core/somaxconn is set to the lower value of %d.", server.tcp_backlog, somaxconn);
-        }
-    }
-    fclose(fp);
-#endif
-}
-
-void closeSocketListeners(socketFds *sfd) {
-    int j;
-
-    for (j = 0; j < sfd->count; j++) {
-        if (sfd->fd[j] == -1) continue;
-
-        aeDeleteFileEvent(server.el, sfd->fd[j], AE_READABLE);
-        close(sfd->fd[j]);
-    }
-
-    sfd->count = 0;
-}
-
-/* Create an event handler for accepting new connections in TCP or TLS domain sockets.
- * This works atomically for all socket fds */
-int createSocketAcceptHandler(socketFds *sfd, aeFileProc *accept_handler) {
-    int j;
-
-    for (j = 0; j < sfd->count; j++) {
-        if (aeCreateFileEvent(server.el, sfd->fd[j], AE_READABLE, accept_handler,NULL) == AE_ERR) {
-            /* Rollback */
-            for (j = j-1; j >= 0; j--) aeDeleteFileEvent(server.el, sfd->fd[j], AE_READABLE);
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* Initialize a set of file descriptors to listen to the specified 'port'
- * binding the addresses specified in the Redis server configuration.
- *
- * The listening file descriptors are stored in the integer array 'fds'
- * and their number is set in '*count'.
- *
- * The addresses to bind are specified in the global server.bindaddr array
- * and their number is server.bindaddr_count. If the server configuration
- * contains no specific addresses to bind, this function will try to
- * bind * (all addresses) for both the IPv4 and IPv6 protocols.
- *
- * On success the function returns C_OK.
- *
- * On error the function returns C_ERR. For the function to be on
- * error, at least one of the server.bindaddr addresses was
- * impossible to bind, or no bind addresses were specified in the server
- * configuration but the function is not able to bind * for at least
- * one of the IPv4 or IPv6 protocols. */
-int listenToPort(int port, socketFds *sfd) {
-    int j;
-    char **bindaddr = server.bindaddr;
-    int bindaddr_count = server.bindaddr_count;
-    char *default_bindaddr[2] = {"*", "-::*"};
-
-    /* Force binding of 0.0.0.0 if no bind address is specified. */
-    if (server.bindaddr_count == 0) {
-        bindaddr_count = 2;
-        bindaddr = default_bindaddr;
-    }
-
-    for (j = 0; j < bindaddr_count; j++) {
-        char* addr = bindaddr[j];
-        int optional = *addr == '-';
-        if (optional) addr++;
-        if (strchr(addr,':')) {
-            /* Bind IPv6 address. */
-            sfd->fd[sfd->count] = anetTcp6Server(server.neterr,port,addr,server.tcp_backlog);
-        } else {
-            /* Bind IPv4 address. */
-            sfd->fd[sfd->count] = anetTcpServer(server.neterr,port,addr,server.tcp_backlog);
-        }
-        if (sfd->fd[sfd->count] == ANET_ERR) {
-            int net_errno = errno;
-            serverLog(LL_WARNING,
-                "Warning: Could not create server TCP listening socket %s:%d: %s",
-                addr, port, server.neterr);
-            if (net_errno == EADDRNOTAVAIL && optional)
-                continue;
-            if (net_errno == ENOPROTOOPT     || net_errno == EPROTONOSUPPORT ||
-                net_errno == ESOCKTNOSUPPORT || net_errno == EPFNOSUPPORT ||
-                net_errno == EAFNOSUPPORT)
-                continue;
-
-            /* Rollback successful listens before exiting */
-            closeSocketListeners(sfd);
-            return C_ERR;
-        }
-        anetNonBlock(NULL,sfd->fd[sfd->count]);
-        anetCloexec(sfd->fd[sfd->count]);
-        sfd->count++;
-    }
-    return C_OK;
-}
-
-/* Resets the stats that we expose via INFO or other means that we want
- * to reset via CONFIG RESETSTAT. The function is also used in order to
- * initialize these fields in initServer() at server startup. */
-void resetServerStats(void) {
-    int j;
-
-    server.stat_numcommands = 0;
-    server.stat_numconnections = 0;
-    server.stat_expiredkeys = 0;
-    server.stat_expired_stale_perc = 0;
-    server.stat_expired_time_cap_reached_count = 0;
-    server.stat_expire_cycle_time_used = 0;
-    server.stat_evictedkeys = 0;
-    server.stat_keyspace_misses = 0;
-    server.stat_keyspace_hits = 0;
-    server.stat_active_defrag_hits = 0;
-    server.stat_active_defrag_misses = 0;
-    server.stat_active_defrag_key_hits = 0;
-    server.stat_active_defrag_key_misses = 0;
-    server.stat_active_defrag_scanned = 0;
-    server.stat_fork_time = 0;
-    server.stat_fork_rate = 0;
-    server.stat_total_forks = 0;
-    server.stat_rejected_conn = 0;
-    server.stat_sync_full = 0;
-    server.stat_sync_partial_ok = 0;
-    server.stat_sync_partial_err = 0;
-    server.stat_io_reads_processed = 0;
-    atomicSet(server.stat_total_reads_processed, 0);
-    server.stat_io_writes_processed = 0;
-    atomicSet(server.stat_total_writes_processed, 0);
-    for (j = 0; j < STATS_METRIC_COUNT; j++) {
-        server.inst_metric[j].idx = 0;
-        server.inst_metric[j].last_sample_time = mstime();
-        server.inst_metric[j].last_sample_count = 0;
-        memset(server.inst_metric[j].samples,0,
-            sizeof(server.inst_metric[j].samples));
-    }
-    atomicSet(server.stat_net_input_bytes, 0);
-    atomicSet(server.stat_net_output_bytes, 0);
-    server.stat_unexpected_error_replies = 0;
-    server.stat_total_error_replies = 0;
-    server.stat_dump_payload_sanitizations = 0;
-    server.aof_delayed_fsync = 0;
-}
-
-/* Make the thread killable at any time, so that kill threads functions
- * can work reliably (default cancelability type is PTHREAD_CANCEL_DEFERRED).
- * Needed for pthread_cancel used by the fast memory test used by the crash report. */
-void makeThreadKillable(void) {
-    pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
-    pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);
-}
-
-void initServer(void) {
-    int j;
-
-    signal(SIGHUP, SIG_IGN);
-    signal(SIGPIPE, SIG_IGN);
-    setupSignalHandlers();
-    makeThreadKillable();
-
-    if (server.syslog_enabled) {
-        openlog(server.syslog_ident, LOG_PID | LOG_NDELAY | LOG_NOWAIT,
-            server.syslog_facility);
-    }
-
-    /* Initialization after setting defaults from the config system. */
-    server.aof_state = server.aof_enabled ? AOF_ON : AOF_OFF;
-    server.hz = server.config_hz;
-    server.pid = getpid();
-    server.in_fork_child = CHILD_TYPE_NONE;
-    server.main_thread_id = pthread_self();
-    server.current_client = NULL;
-    server.errors = raxNew();
-    server.fixed_time_expire = 0;
-    server.clients = listCreate();
-    server.clients_index = raxNew();
-    server.clients_to_close = listCreate();
-    server.slaves = listCreate();
-    server.monitors = listCreate();
-    server.clients_pending_write = listCreate();
-    server.clients_pending_read = listCreate();
-    server.clients_timeout_table = raxNew();
-    server.replication_allowed = 1;
-    server.slaveseldb = -1; /* Force to emit the first SELECT command. */
-    server.unblocked_clients = listCreate();
-    server.ready_keys = listCreate();
-    server.clients_waiting_acks = listCreate();
-    server.get_ack_from_slaves = 0;
-    server.client_pause_type = 0;
-    server.paused_clients = listCreate();
-    server.events_processed_while_blocked = 0;
-    server.system_memory_size = zmalloc_get_memory_size();
-    server.blocked_last_cron = 0;
-    server.blocking_op_nesting = 0;
-
-    if ((server.tls_port || server.tls_replication || server.tls_cluster)
-                && tlsConfigure(&server.tls_ctx_config) == C_ERR) {
-        serverLog(LL_WARNING, "Failed to configure TLS. Check logs for more info.");
-        exit(1);
-    }
-
-    createSharedObjects();
-    adjustOpenFilesLimit();
-    const char *clk_msg = monotonicInit();
-    serverLog(LL_NOTICE, "monotonic clock: %s", clk_msg);
-    server.el = aeCreateEventLoop(server.maxclients+CONFIG_FDSET_INCR);
-    if (server.el == NULL) {
-        serverLog(LL_WARNING,
-            "Failed creating the event loop. Error message: '%s'",
-            strerror(errno));
-        exit(1);
-    }
-    server.db = zmalloc(sizeof(redisDb)*server.dbnum);
-
-    /* Open the TCP listening socket for the user commands. */
-    if (server.port != 0 &&
-        listenToPort(server.port,&server.ipfd) == C_ERR) {
-        serverLog(LL_WARNING, "Failed listening on port %u (TCP), aborting.", server.port);
-        exit(1);
-    }
-    if (server.tls_port != 0 &&
-        listenToPort(server.tls_port,&server.tlsfd) == C_ERR) {
-        serverLog(LL_WARNING, "Failed listening on port %u (TLS), aborting.", server.tls_port);
-        exit(1);
-    }
-
-    /* Open the listening Unix domain socket. */
-    if (server.unixsocket != NULL) {
-        unlink(server.unixsocket); /* don't care if this fails */
-        server.sofd = anetUnixServer(server.neterr,server.unixsocket,
-            server.unixsocketperm, server.tcp_backlog);
-        if (server.sofd == ANET_ERR) {
-            serverLog(LL_WARNING, "Opening Unix socket: %s", server.neterr);
-            exit(1);
-        }
-        anetNonBlock(NULL,server.sofd);
-        anetCloexec(server.sofd);
-    }
-
-    /* Abort if there are no listening sockets at all. */
-    if (server.ipfd.count == 0 && server.tlsfd.count == 0 && server.sofd < 0) {
-        serverLog(LL_WARNING, "Configured to not listen anywhere, exiting.");
-        exit(1);
-    }
-
-    /* Create the Redis databases, and initialize other internal state. */
-    for (j = 0; j < server.dbnum; j++) {
-        server.db[j].dict = dictCreate(&dbDictType,NULL);
-        server.db[j].expires = dictCreate(&dbExpiresDictType,NULL);
-        server.db[j].expires_cursor = 0;
-        server.db[j].blocking_keys = dictCreate(&keylistDictType,NULL);
-        server.db[j].ready_keys = dictCreate(&objectKeyPointerValueDictType,NULL);
-        server.db[j].watched_keys = dictCreate(&keylistDictType,NULL);
-        server.db[j].id = j;
-        server.db[j].avg_ttl = 0;
-        server.db[j].defrag_later = listCreate();
-        listSetFreeMethod(server.db[j].defrag_later,(void (*)(void*))sdsfree);
-    }
-    evictionPoolAlloc(); /* Initialize the LRU keys pool. */
-    server.pubsub_channels = dictCreate(&keylistDictType,NULL);
-    server.pubsub_patterns = dictCreate(&keylistDictType,NULL);
-    server.cronloops = 0;
-    server.in_eval = 0;
-    server.in_exec = 0;
-    server.propagate_in_transaction = 0;
-    server.client_pause_in_transaction = 0;
-    server.child_pid = -1;
-    server.child_type = CHILD_TYPE_NONE;
-    server.rdb_child_type = RDB_CHILD_TYPE_NONE;
-    server.rdb_pipe_conns = NULL;
-    server.rdb_pipe_numconns = 0;
-    server.rdb_pipe_numconns_writing = 0;
-    server.rdb_pipe_buff = NULL;
-    server.rdb_pipe_bufflen = 0;
-    server.rdb_bgsave_scheduled = 0;
-    server.child_info_pipe[0] = -1;
-    server.child_info_pipe[1] = -1;
-    server.child_info_nread = 0;
-    aofRewriteBufferReset();
-    server.aof_buf = sdsempty();
-    server.lastsave = time(NULL); /* At startup we consider the DB saved. */
-    server.lastbgsave_try = 0;    /* At startup we never tried to BGSAVE. */
-    server.rdb_save_time_last = -1;
-    server.rdb_save_time_start = -1;
-    server.dirty = 0;
-    resetServerStats();
-    /* A few stats we don't want to reset: server startup time, and peak mem. */
-    server.stat_starttime = time(NULL);
-    server.stat_peak_memory = 0;
-    server.stat_current_cow_bytes = 0;
-    server.stat_current_cow_updated = 0;
-    server.stat_current_save_keys_processed = 0;
-    server.stat_current_save_keys_total = 0;
-    server.stat_rdb_cow_bytes = 0;
-    server.stat_aof_cow_bytes = 0;
-    server.stat_module_cow_bytes = 0;
-    server.stat_module_progress = 0;
-    for (int j = 0; j < CLIENT_TYPE_COUNT; j++)
-        server.stat_clients_type_memory[j] = 0;
-    server.cron_malloc_stats.zmalloc_used = 0;
-    server.cron_malloc_stats.process_rss = 0;
-    server.cron_malloc_stats.allocator_allocated = 0;
-    server.cron_malloc_stats.allocator_active = 0;
-    server.cron_malloc_stats.allocator_resident = 0;
-    server.lastbgsave_status = C_OK;
-    server.aof_last_write_status = C_OK;
-    server.aof_last_write_errno = 0;
-    server.repl_good_slaves_count = 0;
-
-    /* Create the timer callback, this is our way to process many background
-     * operations incrementally, like clients timeout, eviction of unaccessed
-     * expired keys and so forth. */
-    if (aeCreateTimeEvent(server.el, 1, serverCron, NULL, NULL) == AE_ERR) {
-        serverPanic("Can't create event loop timers.");
-        exit(1);
-    }
-
-    /* Create an event handler for accepting new connections in TCP and Unix
-     * domain sockets. */
-    if (createSocketAcceptHandler(&server.ipfd, acceptTcpHandler) != C_OK) {
-        serverPanic("Unrecoverable error creating TCP socket accept handler.");
-    }
-    if (createSocketAcceptHandler(&server.tlsfd, acceptTLSHandler) != C_OK) {
-        serverPanic("Unrecoverable error creating TLS socket accept handler.");
-    }
-    if (server.sofd > 0 && aeCreateFileEvent(server.el,server.sofd,AE_READABLE,
-        acceptUnixHandler,NULL) == AE_ERR) serverPanic("Unrecoverable error creating server.sofd file event.");
-
-
-    /* Register a readable event for the pipe used to awake the event loop
-     * when a blocked client in a module needs attention. */
-    if (aeCreateFileEvent(server.el, server.module_blocked_pipe[0], AE_READABLE,
-        moduleBlockedClientPipeReadable,NULL) == AE_ERR) {
-            serverPanic(
-                "Error registering the readable event for the module "
-                "blocked clients subsystem.");
-    }
-
-    /* Register before and after sleep handlers (note this needs to be done
-     * before loading persistence since it is used by processEventsWhileBlocked. */
-    aeSetBeforeSleepProc(server.el,beforeSleep);
-    aeSetAfterSleepProc(server.el,afterSleep);
-
-    /* Open the AOF file if needed. */
-    if (server.aof_state == AOF_ON) {
-        server.aof_fd = open(server.aof_filename,
-                               O_WRONLY|O_APPEND|O_CREAT,0644);
-        if (server.aof_fd == -1) {
-            serverLog(LL_WARNING, "Can't open the append-only file: %s",
-                strerror(errno));
-            exit(1);
-        }
-    }
-
-    /* 32 bit instances are limited to 4GB of address space, so if there is
-     * no explicit limit in the user provided configuration we set a limit
-     * at 3 GB using maxmemory with 'noeviction' policy'. This avoids
-     * useless crashes of the Redis instance for out of memory. */
-    if (server.arch_bits == 32 && server.maxmemory == 0) {
-        serverLog(LL_WARNING,"Warning: 32 bit instance detected but no memory limit set. Setting 3 GB maxmemory limit with 'noeviction' policy now.");
-        server.maxmemory = 3072LL*(1024*1024); /* 3 GB */
-        server.maxmemory_policy = MAXMEMORY_NO_EVICTION;
-    }
-
-    if (server.cluster_enabled) clusterInit();
-    replicationScriptCacheInit();
-    scriptingInit(1);
-    slowlogInit();
-    latencyMonitorInit();
-    
-    /* Initialize ACL default password if it exists */
-    ACLUpdateDefaultUserPassword(server.requirepass);
-}
-
-/* Some steps in server initialization need to be done last (after modules
- * are loaded).
- * Specifically, creation of threads due to a race bug in ld.so, in which
- * Thread Local Storage initialization collides with dlopen call.
- * see: https://sourceware.org/bugzilla/show_bug.cgi?id=19329 */
-void InitServerLast() {
-    bioInit();
-    initThreadedIO();
-    set_jemalloc_bg_thread(server.jemalloc_bg_thread);
-    server.initial_memory_usage = zmalloc_used_memory();
-}
-
-/* Parse the flags string description 'strflags' and set them to the
- * command 'c'. If the flags are all valid C_OK is returned, otherwise
- * C_ERR is returned (yet the recognized flags are set in the command). */
-int populateCommandTableParseFlags(struct redisCommand *c, char *strflags) {
-    int argc;
-    sds *argv;
-
-    /* Split the line into arguments for processing. */
-    argv = sdssplitargs(strflags,&argc);
-    if (argv == NULL) return C_ERR;
-
-    for (int j = 0; j < argc; j++) {
-        char *flag = argv[j];
-        if (!strcasecmp(flag,"write")) {
-            c->flags |= CMD_WRITE|CMD_CATEGORY_WRITE;
-        } else if (!strcasecmp(flag,"read-only")) {
-            c->flags |= CMD_READONLY|CMD_CATEGORY_READ;
-        } else if (!strcasecmp(flag,"use-memory")) {
-            c->flags |= CMD_DENYOOM;
-        } else if (!strcasecmp(flag,"admin")) {
-            c->flags |= CMD_ADMIN|CMD_CATEGORY_ADMIN|CMD_CATEGORY_DANGEROUS;
-        } else if (!strcasecmp(flag,"pub-sub")) {
-            c->flags |= CMD_PUBSUB|CMD_CATEGORY_PUBSUB;
-        } else if (!strcasecmp(flag,"no-script")) {
-            c->flags |= CMD_NOSCRIPT;
-        } else if (!strcasecmp(flag,"random")) {
-            c->flags |= CMD_RANDOM;
-        } else if (!strcasecmp(flag,"to-sort")) {
-            c->flags |= CMD_SORT_FOR_SCRIPT;
-        } else if (!strcasecmp(flag,"ok-loading")) {
-            c->flags |= CMD_LOADING;
-        } else if (!strcasecmp(flag,"ok-stale")) {
-            c->flags |= CMD_STALE;
-        } else if (!strcasecmp(flag,"no-monitor")) {
-            c->flags |= CMD_SKIP_MONITOR;
-        } else if (!strcasecmp(flag,"no-slowlog")) {
-            c->flags |= CMD_SKIP_SLOWLOG;
-        } else if (!strcasecmp(flag,"cluster-asking")) {
-            c->flags |= CMD_ASKING;
-        } else if (!strcasecmp(flag,"fast")) {
-            c->flags |= CMD_FAST | CMD_CATEGORY_FAST;
-        } else if (!strcasecmp(flag,"no-auth")) {
-            c->flags |= CMD_NO_AUTH;
-        } else if (!strcasecmp(flag,"may-replicate")) {
-            c->flags |= CMD_MAY_REPLICATE;
-        } else {
-            /* Parse ACL categories here if the flag name starts with @. */
-            uint64_t catflag;
-            if (flag[0] == '@' &&
-                (catflag = ACLGetCommandCategoryFlagByName(flag+1)) != 0)
-            {
-                c->flags |= catflag;
-            } else {
-                sdsfreesplitres(argv,argc);
-                return C_ERR;
-            }
-        }
-    }
-    /* If it's not @fast is @slow in this binary world. */
-    if (!(c->flags & CMD_CATEGORY_FAST)) c->flags |= CMD_CATEGORY_SLOW;
-
-    sdsfreesplitres(argv,argc);
-    return C_OK;
-}
-
-/* Populates the Redis Command Table starting from the hard coded list
- * we have on top of server.c file. */
-void populateCommandTable(void) {
-    int j;
-    int numcommands = sizeof(redisCommandTable)/sizeof(struct redisCommand);
-
-    for (j = 0; j < numcommands; j++) {
-        struct redisCommand *c = redisCommandTable+j;
-        int retval1, retval2;
-
-        /* Translate the command string flags description into an actual
-         * set of flags. */
-        if (populateCommandTableParseFlags(c,c->sflags) == C_ERR)
-            serverPanic("Unsupported command flag");
-
-        c->id = ACLGetCommandID(c->name); /* Assign the ID used for ACL. */
-        retval1 = dictAdd(server.commands, sdsnew(c->name), c);
-        /* Populate an additional dictionary that will be unaffected
-         * by rename-command statements in redis.conf. */
-        retval2 = dictAdd(server.orig_commands, sdsnew(c->name), c);
-        serverAssert(retval1 == DICT_OK && retval2 == DICT_OK);
-    }
-}
-
-void resetCommandTableStats(void) {
-    struct redisCommand *c;
-    dictEntry *de;
-    dictIterator *di;
-
-    di = dictGetSafeIterator(server.commands);
-    while((de = dictNext(di)) != NULL) {
-        c = (struct redisCommand *) dictGetVal(de);
-        c->microseconds = 0;
-        c->calls = 0;
-        c->rejected_calls = 0;
-        c->failed_calls = 0;
-    }
-    dictReleaseIterator(di);
-
-}
-
-void resetErrorTableStats(void) {
-    raxFreeWithCallback(server.errors, zfree);
-    server.errors = raxNew();
-}
-
-/* ========================== Redis OP Array API ============================ */
-
-void redisOpArrayInit(redisOpArray *oa) {
-    oa->ops = NULL;
-    oa->numops = 0;
-}
-
-int redisOpArrayAppend(redisOpArray *oa, struct redisCommand *cmd, int dbid,
-                       robj **argv, int argc, int target)
-{
-    redisOp *op;
-
-    oa->ops = zrealloc(oa->ops,sizeof(redisOp)*(oa->numops+1));
-    op = oa->ops+oa->numops;
-    op->cmd = cmd;
-    op->dbid = dbid;
-    op->argv = argv;
-    op->argc = argc;
-    op->target = target;
-    oa->numops++;
-    return oa->numops;
-}
-
-void redisOpArrayFree(redisOpArray *oa) {
-    while(oa->numops) {
-        int j;
-        redisOp *op;
-
-        oa->numops--;
-        op = oa->ops+oa->numops;
-        for (j = 0; j < op->argc; j++)
-            decrRefCount(op->argv[j]);
-        zfree(op->argv);
-    }
-    zfree(oa->ops);
-    oa->ops = NULL;
-}
-
-/* ====================== Commands lookup and execution ===================== */
-
-struct redisCommand *lookupCommand(sds name) {
-    return dictFetchValue(server.commands, name);
-}
-
-struct redisCommand *lookupCommandByCString(const char *s) {
-    struct redisCommand *cmd;
-    sds name = sdsnew(s);
-
-    cmd = dictFetchValue(server.commands, name);
-    sdsfree(name);
-    return cmd;
-}
-
-/* Lookup the command in the current table, if not found also check in
- * the original table containing the original command names unaffected by
- * redis.conf rename-command statement.
- *
- * This is used by functions rewriting the argument vector such as
- * rewriteClientCommandVector() in order to set client->cmd pointer
- * correctly even if the command was renamed. */
-struct redisCommand *lookupCommandOrOriginal(sds name) {
-    struct redisCommand *cmd = dictFetchValue(server.commands, name);
-
-    if (!cmd) cmd = dictFetchValue(server.orig_commands,name);
-    return cmd;
-}
-
-/* Propagate the specified command (in the context of the specified database id)
- * to AOF and Slaves.
- *
- * flags are an xor between:
- * + PROPAGATE_NONE (no propagation of command at all)
- * + PROPAGATE_AOF (propagate into the AOF file if is enabled)
- * + PROPAGATE_REPL (propagate into the replication link)
- *
- * This should not be used inside commands implementation since it will not
- * wrap the resulting commands in MULTI/EXEC. Use instead alsoPropagate(),
- * preventCommandPropagation(), forceCommandPropagation().
- *
- * However for functions that need to (also) propagate out of the context of a
- * command execution, for example when serving a blocked client, you
- * want to use propagate().
- */
-void propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,
-               int flags)
-{
-    if (!server.replication_allowed)
-        return;
-
-    /* Propagate a MULTI request once we encounter the first command which
-     * is a write command.
-     * This way we'll deliver the MULTI/..../EXEC block as a whole and
-     * both the AOF and the replication link will have the same consistency
-     * and atomicity guarantees. */
-    if (server.in_exec && !server.propagate_in_transaction)
-        execCommandPropagateMulti(dbid);
-
-    /* This needs to be unreachable since the dataset should be fixed during 
-     * client pause, otherwise data may be lossed during a failover. */
-    serverAssert(!(areClientsPaused() && !server.client_pause_in_transaction));
-
-    if (server.aof_state != AOF_OFF && flags & PROPAGATE_AOF)
-        feedAppendOnlyFile(cmd,dbid,argv,argc);
-    if (flags & PROPAGATE_REPL)
-        replicationFeedSlaves(server.slaves,dbid,argv,argc);
-}
-
-/* Used inside commands to schedule the propagation of additional commands
- * after the current command is propagated to AOF / Replication.
- *
- * 'cmd' must be a pointer to the Redis command to replicate, dbid is the
- * database ID the command should be propagated into.
- * Arguments of the command to propagate are passed as an array of redis
- * objects pointers of len 'argc', using the 'argv' vector.
- *
- * The function does not take a reference to the passed 'argv' vector,
- * so it is up to the caller to release the passed argv (but it is usually
- * stack allocated).  The function automatically increments ref count of
- * passed objects, so the caller does not need to. */
-void alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc,
-                   int target)
-{
-    robj **argvcopy;
-    int j;
-
-    if (server.loading) return; /* No propagation during loading. */
-
-    argvcopy = zmalloc(sizeof(robj*)*argc);
-    for (j = 0; j < argc; j++) {
-        argvcopy[j] = argv[j];
-        incrRefCount(argv[j]);
-    }
-    redisOpArrayAppend(&server.also_propagate,cmd,dbid,argvcopy,argc,target);
-}
-
-/* It is possible to call the function forceCommandPropagation() inside a
- * Redis command implementation in order to to force the propagation of a
- * specific command execution into AOF / Replication. */
-void forceCommandPropagation(client *c, int flags) {
-    serverAssert(c->cmd->flags & (CMD_WRITE | CMD_MAY_REPLICATE));
-    if (flags & PROPAGATE_REPL) c->flags |= CLIENT_FORCE_REPL;
-    if (flags & PROPAGATE_AOF) c->flags |= CLIENT_FORCE_AOF;
-}
-
-/* Avoid that the executed command is propagated at all. This way we
- * are free to just propagate what we want using the alsoPropagate()
- * API. */
-void preventCommandPropagation(client *c) {
-    c->flags |= CLIENT_PREVENT_PROP;
-}
-
-/* AOF specific version of preventCommandPropagation(). */
-void preventCommandAOF(client *c) {
-    c->flags |= CLIENT_PREVENT_AOF_PROP;
-}
-
-/* Replication specific version of preventCommandPropagation(). */
-void preventCommandReplication(client *c) {
-    c->flags |= CLIENT_PREVENT_REPL_PROP;
-}
-
-/* Log the last command a client executed into the slowlog. */
-void slowlogPushCurrentCommand(client *c, struct redisCommand *cmd, ustime_t duration) {
-    /* Some commands may contain sensitive data that should not be available in the slowlog. */
-    if (cmd->flags & CMD_SKIP_SLOWLOG)
-        return;
-
-    /* If command argument vector was rewritten, use the original
-     * arguments. */
-    robj **argv = c->original_argv ? c->original_argv : c->argv;
-    int argc = c->original_argv ? c->original_argc : c->argc;
-    slowlogPushEntryIfNeeded(c,argv,argc,duration);
-}
-
-/* Call() is the core of Redis execution of a command.
- *
- * The following flags can be passed:
- * CMD_CALL_NONE        No flags.
- * CMD_CALL_SLOWLOG     Check command speed and log in the slow log if needed.
- * CMD_CALL_STATS       Populate command stats.
- * CMD_CALL_PROPAGATE_AOF   Append command to AOF if it modified the dataset
- *                          or if the client flags are forcing propagation.
- * CMD_CALL_PROPAGATE_REPL  Send command to slaves if it modified the dataset
- *                          or if the client flags are forcing propagation.
- * CMD_CALL_PROPAGATE   Alias for PROPAGATE_AOF|PROPAGATE_REPL.
- * CMD_CALL_FULL        Alias for SLOWLOG|STATS|PROPAGATE.
- *
- * The exact propagation behavior depends on the client flags.
- * Specifically:
- *
- * 1. If the client flags CLIENT_FORCE_AOF or CLIENT_FORCE_REPL are set
- *    and assuming the corresponding CMD_CALL_PROPAGATE_AOF/REPL is set
- *    in the call flags, then the command is propagated even if the
- *    dataset was not affected by the command.
- * 2. If the client flags CLIENT_PREVENT_REPL_PROP or CLIENT_PREVENT_AOF_PROP
- *    are set, the propagation into AOF or to slaves is not performed even
- *    if the command modified the dataset.
- *
- * Note that regardless of the client flags, if CMD_CALL_PROPAGATE_AOF
- * or CMD_CALL_PROPAGATE_REPL are not set, then respectively AOF or
- * slaves propagation will never occur.
- *
- * Client flags are modified by the implementation of a given command
- * using the following API:
- *
- * forceCommandPropagation(client *c, int flags);
- * preventCommandPropagation(client *c);
- * preventCommandAOF(client *c);
- * preventCommandReplication(client *c);
- *
- */
-void call(client *c, int flags) {
-    long long dirty;
-    monotime call_timer;
-    int client_old_flags = c->flags;
-    struct redisCommand *real_cmd = c->cmd;
-    static long long prev_err_count;
-
-    /* Initialization: clear the flags that must be set by the command on
-     * demand, and initialize the array for additional commands propagation. */
-    c->flags &= ~(CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
-    redisOpArray prev_also_propagate = server.also_propagate;
-    redisOpArrayInit(&server.also_propagate);
-
-    /* Call the command. */
-    dirty = server.dirty;
-    prev_err_count = server.stat_total_error_replies;
-
-    /* Update cache time, in case we have nested calls we want to
-     * update only on the first call*/
-    if (server.fixed_time_expire++ == 0) {
-        updateCachedTime(0);
-    }
-
-    elapsedStart(&call_timer);
-    c->cmd->proc(c);
-    const long duration = elapsedUs(call_timer);
-    c->duration = duration;
-    dirty = server.dirty-dirty;
-    if (dirty < 0) dirty = 0;
-
-    /* Update failed command calls if required.
-     * We leverage a static variable (prev_err_count) to retain
-     * the counter across nested function calls and avoid logging
-     * the same error twice. */
-    if ((server.stat_total_error_replies - prev_err_count) > 0) {
-        real_cmd->failed_calls++;
-    }
-
-    /* After executing command, we will close the client after writing entire
-     * reply if it is set 'CLIENT_CLOSE_AFTER_COMMAND' flag. */
-    if (c->flags & CLIENT_CLOSE_AFTER_COMMAND) {
-        c->flags &= ~CLIENT_CLOSE_AFTER_COMMAND;
-        c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-    }
-
-    /* When EVAL is called loading the AOF we don't want commands called
-     * from Lua to go into the slowlog or to populate statistics. */
-    if (server.loading && c->flags & CLIENT_LUA)
-        flags &= ~(CMD_CALL_SLOWLOG | CMD_CALL_STATS);
-
-    /* If the caller is Lua, we want to force the EVAL caller to propagate
-     * the script if the command flag or client flag are forcing the
-     * propagation. */
-    if (c->flags & CLIENT_LUA && server.lua_caller) {
-        if (c->flags & CLIENT_FORCE_REPL)
-            server.lua_caller->flags |= CLIENT_FORCE_REPL;
-        if (c->flags & CLIENT_FORCE_AOF)
-            server.lua_caller->flags |= CLIENT_FORCE_AOF;
-    }
-
-    /* Note: the code below uses the real command that was executed
-     * c->cmd and c->lastcmd may be different, in case of MULTI-EXEC or
-     * re-written commands such as EXPIRE, GEOADD, etc. */
-
-    /* Record the latency this command induced on the main thread.
-     * unless instructed by the caller not to log. (happens when processing
-     * a MULTI-EXEC from inside an AOF). */
-    if (flags & CMD_CALL_SLOWLOG) {
-        char *latency_event = (real_cmd->flags & CMD_FAST) ?
-                               "fast-command" : "command";
-        latencyAddSampleIfNeeded(latency_event,duration/1000);
-    }
-
-    /* Log the command into the Slow log if needed.
-     * If the client is blocked we will handle slowlog when it is unblocked. */
-    if ((flags & CMD_CALL_SLOWLOG) && !(c->flags & CLIENT_BLOCKED))
-        slowlogPushCurrentCommand(c, real_cmd, duration);
-
-    /* Send the command to clients in MONITOR mode if applicable.
-     * Administrative commands are considered too dangerous to be shown. */
-    if (!(c->cmd->flags & (CMD_SKIP_MONITOR|CMD_ADMIN))) {
-        robj **argv = c->original_argv ? c->original_argv : c->argv;
-        int argc = c->original_argv ? c->original_argc : c->argc;
-        replicationFeedMonitors(c,server.monitors,c->db->id,argv,argc);
-    }
-
-    /* Clear the original argv.
-     * If the client is blocked we will handle slowlog when it is unblocked. */
-    if (!(c->flags & CLIENT_BLOCKED))
-        freeClientOriginalArgv(c);
-
-    /* populate the per-command statistics that we show in INFO commandstats. */
-    if (flags & CMD_CALL_STATS) {
-        real_cmd->microseconds += duration;
-        real_cmd->calls++;
-    }
-
-    /* Propagate the command into the AOF and replication link */
-    if (flags & CMD_CALL_PROPAGATE &&
-        (c->flags & CLIENT_PREVENT_PROP) != CLIENT_PREVENT_PROP)
-    {
-        int propagate_flags = PROPAGATE_NONE;
-
-        /* Check if the command operated changes in the data set. If so
-         * set for replication / AOF propagation. */
-        if (dirty) propagate_flags |= (PROPAGATE_AOF|PROPAGATE_REPL);
-
-        /* If the client forced AOF / replication of the command, set
-         * the flags regardless of the command effects on the data set. */
-        if (c->flags & CLIENT_FORCE_REPL) propagate_flags |= PROPAGATE_REPL;
-        if (c->flags & CLIENT_FORCE_AOF) propagate_flags |= PROPAGATE_AOF;
-
-        /* However prevent AOF / replication propagation if the command
-         * implementation called preventCommandPropagation() or similar,
-         * or if we don't have the call() flags to do so. */
-        if (c->flags & CLIENT_PREVENT_REPL_PROP ||
-            !(flags & CMD_CALL_PROPAGATE_REPL))
-                propagate_flags &= ~PROPAGATE_REPL;
-        if (c->flags & CLIENT_PREVENT_AOF_PROP ||
-            !(flags & CMD_CALL_PROPAGATE_AOF))
-                propagate_flags &= ~PROPAGATE_AOF;
-
-        /* Call propagate() only if at least one of AOF / replication
-         * propagation is needed. Note that modules commands handle replication
-         * in an explicit way, so we never replicate them automatically. */
-        if (propagate_flags != PROPAGATE_NONE && !(c->cmd->flags & CMD_MODULE))
-            propagate(c->cmd,c->db->id,c->argv,c->argc,propagate_flags);
-    }
-
-    /* Restore the old replication flags, since call() can be executed
-     * recursively. */
-    c->flags &= ~(CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
-    c->flags |= client_old_flags &
-        (CLIENT_FORCE_AOF|CLIENT_FORCE_REPL|CLIENT_PREVENT_PROP);
-
-    /* Handle the alsoPropagate() API to handle commands that want to propagate
-     * multiple separated commands. Note that alsoPropagate() is not affected
-     * by CLIENT_PREVENT_PROP flag. */
-    if (server.also_propagate.numops) {
-        int j;
-        redisOp *rop;
-
-        if (flags & CMD_CALL_PROPAGATE) {
-            int multi_emitted = 0;
-            /* Wrap the commands in server.also_propagate array,
-             * but don't wrap it if we are already in MULTI context,
-             * in case the nested MULTI/EXEC.
-             *
-             * And if the array contains only one command, no need to
-             * wrap it, since the single command is atomic. */
-            if (server.also_propagate.numops > 1 &&
-                !(c->cmd->flags & CMD_MODULE) &&
-                !(c->flags & CLIENT_MULTI) &&
-                !(flags & CMD_CALL_NOWRAP))
-            {
-                execCommandPropagateMulti(c->db->id);
-                multi_emitted = 1;
-            }
-
-            for (j = 0; j < server.also_propagate.numops; j++) {
-                rop = &server.also_propagate.ops[j];
-                int target = rop->target;
-                /* Whatever the command wish is, we honor the call() flags. */
-                if (!(flags&CMD_CALL_PROPAGATE_AOF)) target &= ~PROPAGATE_AOF;
-                if (!(flags&CMD_CALL_PROPAGATE_REPL)) target &= ~PROPAGATE_REPL;
-                if (target)
-                    propagate(rop->cmd,rop->dbid,rop->argv,rop->argc,target);
-            }
-
-            if (multi_emitted) {
-                execCommandPropagateExec(c->db->id);
-            }
-        }
-        redisOpArrayFree(&server.also_propagate);
-    }
-    server.also_propagate = prev_also_propagate;
-
-    /* Client pause takes effect after a transaction has finished. This needs
-     * to be located after everything is propagated. */
-    if (!server.in_exec && server.client_pause_in_transaction) {
-        server.client_pause_in_transaction = 0;
-    }
-
-    /* If the client has keys tracking enabled for client side caching,
-     * make sure to remember the keys it fetched via this command. */
-    if (c->cmd->flags & CMD_READONLY) {
-        client *caller = (c->flags & CLIENT_LUA && server.lua_caller) ?
-                            server.lua_caller : c;
-        if (caller->flags & CLIENT_TRACKING &&
-            !(caller->flags & CLIENT_TRACKING_BCAST))
-        {
-            trackingRememberKeys(caller);
-        }
-    }
-
-    server.fixed_time_expire--;
-    server.stat_numcommands++;
-    prev_err_count = server.stat_total_error_replies;
-
-    /* Record peak memory after each command and before the eviction that runs
-     * before the next command. */
-    size_t zmalloc_used = zmalloc_used_memory();
-    if (zmalloc_used > server.stat_peak_memory)
-        server.stat_peak_memory = zmalloc_used;
-}
-
-/* Used when a command that is ready for execution needs to be rejected, due to
- * varios pre-execution checks. it returns the appropriate error to the client.
- * If there's a transaction is flags it as dirty, and if the command is EXEC,
- * it aborts the transaction.
- * Note: 'reply' is expected to end with \r\n */
-void rejectCommand(client *c, robj *reply) {
-    flagTransaction(c);
-    if (c->cmd) c->cmd->rejected_calls++;
-    if (c->cmd && c->cmd->proc == execCommand) {
-        execCommandAbort(c, reply->ptr);
-    } else {
-        /* using addReplyError* rather than addReply so that the error can be logged. */
-        addReplyErrorObject(c, reply);
-    }
-}
-
-void rejectCommandFormat(client *c, const char *fmt, ...) {
-    if (c->cmd) c->cmd->rejected_calls++;
-    flagTransaction(c);
-    va_list ap;
-    va_start(ap,fmt);
-    sds s = sdscatvprintf(sdsempty(),fmt,ap);
-    va_end(ap);
-    /* Make sure there are no newlines in the string, otherwise invalid protocol
-     * is emitted (The args come from the user, they may contain any character). */
-    sdsmapchars(s, "\r\n", "  ",  2);
-    if (c->cmd && c->cmd->proc == execCommand) {
-        execCommandAbort(c, s);
-        sdsfree(s);
-    } else {
-        /* The following frees 's'. */
-        addReplyErrorSds(c, s);
-    }
-}
-
-/* Returns 1 for commands that may have key names in their arguments, but have
- * no pre-determined key positions. */
-static int cmdHasMovableKeys(struct redisCommand *cmd) {
-    return (cmd->getkeys_proc && !(cmd->flags & CMD_MODULE)) ||
-            cmd->flags & CMD_MODULE_GETKEYS;
-}
-
-/* If this function gets called we already read a whole
- * command, arguments are in the client argv/argc fields.
- * processCommand() execute the command or prepare the
- * server for a bulk read from the client.
- *
- * If C_OK is returned the client is still alive and valid and
- * other operations can be performed by the caller. Otherwise
- * if C_ERR is returned the client was destroyed (i.e. after QUIT). */
-int processCommand(client *c) {
-    if (!server.lua_timedout) {
-        /* Both EXEC and EVAL call call() directly so there should be
-         * no way in_exec or in_eval or propagate_in_transaction is 1.
-         * That is unless lua_timedout, in which case client may run
-         * some commands. */
-        serverAssert(!server.propagate_in_transaction);
-        serverAssert(!server.in_exec);
-        serverAssert(!server.in_eval);
-    }
-
-    moduleCallCommandFilters(c);
-
-    /* The QUIT command is handled separately. Normal command procs will
-     * go through checking for replication and QUIT will cause trouble
-     * when FORCE_REPLICATION is enabled and would be implemented in
-     * a regular command proc. */
-    if (!strcasecmp(c->argv[0]->ptr,"quit")) {
-        addReply(c,shared.ok);
-        c->flags |= CLIENT_CLOSE_AFTER_REPLY;
-        return C_ERR;
-    }
-
-    /* Now lookup the command and check ASAP about trivial error conditions
-     * such as wrong arity, bad command name and so forth. */
-    c->cmd = c->lastcmd = lookupCommand(c->argv[0]->ptr);
-    if (!c->cmd) {
-        sds args = sdsempty();
-        int i;
-        for (i=1; i < c->argc && sdslen(args) < 128; i++)
-            args = sdscatprintf(args, "`%.*s`, ", 128-(int)sdslen(args), (char*)c->argv[i]->ptr);
-        rejectCommandFormat(c,"unknown command `%s`, with args beginning with: %s",
-            (char*)c->argv[0]->ptr, args);
-        sdsfree(args);
-        return C_OK;
-    } else if ((c->cmd->arity > 0 && c->cmd->arity != c->argc) ||
-               (c->argc < -c->cmd->arity)) {
-        rejectCommandFormat(c,"wrong number of arguments for '%s' command",
-            c->cmd->name);
-        return C_OK;
-    }
-
-    int is_read_command = (c->cmd->flags & CMD_READONLY) ||
-                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_READONLY));
-    int is_write_command = (c->cmd->flags & CMD_WRITE) ||
-                           (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_WRITE));
-    int is_denyoom_command = (c->cmd->flags & CMD_DENYOOM) ||
-                             (c->cmd->proc == execCommand && (c->mstate.cmd_flags & CMD_DENYOOM));
-    int is_denystale_command = !(c->cmd->flags & CMD_STALE) ||
-                               (c->cmd->proc == execCommand && (c->mstate.cmd_inv_flags & CMD_STALE));
-    int is_denyloading_command = !(c->cmd->flags & CMD_LOADING) ||
-                                 (c->cmd->proc == execCommand && (c->mstate.cmd_inv_flags & CMD_LOADING));
-    int is_may_replicate_command = (c->cmd->flags & (CMD_WRITE | CMD_MAY_REPLICATE)) ||
-                                   (c->cmd->proc == execCommand && (c->mstate.cmd_flags & (CMD_WRITE | CMD_MAY_REPLICATE)));
-
-    if (authRequired(c)) {
-        /* AUTH and HELLO and no auth commands are valid even in
-         * non-authenticated state. */
-        if (!(c->cmd->flags & CMD_NO_AUTH)) {
-            rejectCommand(c,shared.noautherr);
-            return C_OK;
-        }
-    }
-
-    /* Check if the user can run this command according to the current
-     * ACLs. */
-    int acl_errpos;
-    int acl_retval = ACLCheckAllPerm(c,&acl_errpos);
-    if (acl_retval != ACL_OK) {
-        addACLLogEntry(c,acl_retval,acl_errpos,NULL);
-        switch (acl_retval) {
-        case ACL_DENIED_CMD:
-            rejectCommandFormat(c,
-                "-NOPERM this user has no permissions to run "
-                "the '%s' command or its subcommand", c->cmd->name);
-            break;
-        case ACL_DENIED_KEY:
-            rejectCommandFormat(c,
-                "-NOPERM this user has no permissions to access "
-                "one of the keys used as arguments");
-            break;
-        case ACL_DENIED_CHANNEL:
-            rejectCommandFormat(c,
-                "-NOPERM this user has no permissions to access "
-                "one of the channels used as arguments");
-            break;
-        default:
-            rejectCommandFormat(c, "no permission");
-            break;
-        }
-        return C_OK;
-    }
-
-    /* If cluster is enabled perform the cluster redirection here.
-     * However we don't perform the redirection if:
-     * 1) The sender of this command is our master.
-     * 2) The command has no key arguments. */
-    if (server.cluster_enabled &&
-        !(c->flags & CLIENT_MASTER) &&
-        !(c->flags & CLIENT_LUA &&
-          server.lua_caller->flags & CLIENT_MASTER) &&
-        !(!cmdHasMovableKeys(c->cmd) && c->cmd->firstkey == 0 &&
-          c->cmd->proc != execCommand))
-    {
-        int hashslot;
-        int error_code;
-        clusterNode *n = getNodeByQuery(c,c->cmd,c->argv,c->argc,
-                                        &hashslot,&error_code);
-        if (n == NULL || n != server.cluster->myself) {
-            if (c->cmd->proc == execCommand) {
-                discardTransaction(c);
-            } else {
-                flagTransaction(c);
-            }
-            clusterRedirectClient(c,n,hashslot,error_code);
-            c->cmd->rejected_calls++;
-            return C_OK;
-        }
-    }
-
-    /* Handle the maxmemory directive.
-     *
-     * Note that we do not want to reclaim memory if we are here re-entering
-     * the event loop since there is a busy Lua script running in timeout
-     * condition, to avoid mixing the propagation of scripts with the
-     * propagation of DELs due to eviction. */
-    if (server.maxmemory && !server.lua_timedout) {
-        int out_of_memory = (performEvictions() == EVICT_FAIL);
-        /* performEvictions may flush slave output buffers. This may result
-         * in a slave, that may be the active client, to be freed. */
-        if (server.current_client == NULL) return C_ERR;
-
-        int reject_cmd_on_oom = is_denyoom_command;
-        /* If client is in MULTI/EXEC context, queuing may consume an unlimited
-         * amount of memory, so we want to stop that.
-         * However, we never want to reject DISCARD, or even EXEC (unless it
-         * contains denied commands, in which case is_denyoom_command is already
-         * set. */
-        if (c->flags & CLIENT_MULTI &&
-            c->cmd->proc != execCommand &&
-            c->cmd->proc != discardCommand &&
-            c->cmd->proc != resetCommand) {
-            reject_cmd_on_oom = 1;
-        }
-
-        if (out_of_memory && reject_cmd_on_oom) {
-            rejectCommand(c, shared.oomerr);
-            return C_OK;
-        }
-
-        /* Save out_of_memory result at script start, otherwise if we check OOM
-         * until first write within script, memory used by lua stack and
-         * arguments might interfere. */
-        if (c->cmd->proc == evalCommand || c->cmd->proc == evalShaCommand) {
-            server.lua_oom = out_of_memory;
-        }
-    }
-
-    /* Make sure to use a reasonable amount of memory for client side
-     * caching metadata. */
-    if (server.tracking_clients) trackingLimitUsedSlots();
-
-    /* Don't accept write commands if there are problems persisting on disk
-     * and if this is a master instance. */
-    int deny_write_type = writeCommandsDeniedByDiskError();
-    if (deny_write_type != DISK_ERROR_TYPE_NONE &&
-        server.masterhost == NULL &&
-        (is_write_command ||c->cmd->proc == pingCommand))
-    {
-        if (deny_write_type == DISK_ERROR_TYPE_RDB)
-            rejectCommand(c, shared.bgsaveerr);
-        else
-            rejectCommandFormat(c,
-                "-MISCONF Errors writing to the AOF file: %s",
-                strerror(server.aof_last_write_errno));
-        return C_OK;
-    }
-
-    /* Don't accept write commands if there are not enough good slaves and
-     * user configured the min-slaves-to-write option. */
-    if (server.masterhost == NULL &&
-        server.repl_min_slaves_to_write &&
-        server.repl_min_slaves_max_lag &&
-        is_write_command &&
-        server.repl_good_slaves_count < server.repl_min_slaves_to_write)
-    {
-        rejectCommand(c, shared.noreplicaserr);
-        return C_OK;
-    }
-
-    /* Don't accept write commands if this is a read only slave. But
-     * accept write commands if this is our master. */
-    if (server.masterhost && server.repl_slave_ro &&
-        !(c->flags & CLIENT_MASTER) &&
-        is_write_command)
-    {
-        rejectCommand(c, shared.roslaveerr);
-        return C_OK;
-    }
-
-    /* Only allow a subset of commands in the context of Pub/Sub if the
-     * connection is in RESP2 mode. With RESP3 there are no limits. */
-    if ((c->flags & CLIENT_PUBSUB && c->resp == 2) &&
-        c->cmd->proc != pingCommand &&
-        c->cmd->proc != subscribeCommand &&
-        c->cmd->proc != unsubscribeCommand &&
-        c->cmd->proc != psubscribeCommand &&
-        c->cmd->proc != punsubscribeCommand &&
-        c->cmd->proc != resetCommand) {
-        rejectCommandFormat(c,
-            "Can't execute '%s': only (P)SUBSCRIBE / "
-            "(P)UNSUBSCRIBE / PING / QUIT / RESET are allowed in this context",
-            c->cmd->name);
-        return C_OK;
-    }
-
-    /* Only allow commands with flag "t", such as INFO, SLAVEOF and so on,
-     * when slave-serve-stale-data is no and we are a slave with a broken
-     * link with master. */
-    if (server.masterhost && server.repl_state != REPL_STATE_CONNECTED &&
-        server.repl_serve_stale_data == 0 &&
-        is_denystale_command)
-    {
-        rejectCommand(c, shared.masterdownerr);
-        return C_OK;
-    }
-
-    /* Loading DB? Return an error if the command has not the
-     * CMD_LOADING flag. */
-    if (server.loading && is_denyloading_command) {
-        rejectCommand(c, shared.loadingerr);
-        return C_OK;
-    }
-
-    /* Lua script too slow? Only allow a limited number of commands.
-     * Note that we need to allow the transactions commands, otherwise clients
-     * sending a transaction with pipelining without error checking, may have
-     * the MULTI plus a few initial commands refused, then the timeout
-     * condition resolves, and the bottom-half of the transaction gets
-     * executed, see Github PR #7022. */
-    if (server.lua_timedout &&
-          c->cmd->proc != authCommand &&
-          c->cmd->proc != helloCommand &&
-          c->cmd->proc != replconfCommand &&
-          c->cmd->proc != multiCommand &&
-          c->cmd->proc != discardCommand &&
-          c->cmd->proc != watchCommand &&
-          c->cmd->proc != unwatchCommand &&
-          c->cmd->proc != resetCommand &&
-        !(c->cmd->proc == shutdownCommand &&
-          c->argc == 2 &&
-          tolower(((char*)c->argv[1]->ptr)[0]) == 'n') &&
-        !(c->cmd->proc == scriptCommand &&
-          c->argc == 2 &&
-          tolower(((char*)c->argv[1]->ptr)[0]) == 'k'))
-    {
-        rejectCommand(c, shared.slowscripterr);
-        return C_OK;
-    }
-
-    /* Prevent a replica from sending commands that access the keyspace.
-     * The main objective here is to prevent abuse of client pause check
-     * from which replicas are exempt. */
-    if ((c->flags & CLIENT_SLAVE) && (is_may_replicate_command || is_write_command || is_read_command)) {
-        rejectCommandFormat(c, "Replica can't interract with the keyspace");
-        return C_OK;
-    }
-
-    /* If the server is paused, block the client until
-     * the pause has ended. Replicas are never paused. */
-    if (!(c->flags & CLIENT_SLAVE) && 
-        ((server.client_pause_type == CLIENT_PAUSE_ALL) ||
-        (server.client_pause_type == CLIENT_PAUSE_WRITE && is_may_replicate_command)))
-    {
-        c->bpop.timeout = 0;
-        blockClient(c,BLOCKED_PAUSE);
-        return C_OK;       
-    }
-
-    /* Exec the command */
-    if (c->flags & CLIENT_MULTI &&
-        c->cmd->proc != execCommand && c->cmd->proc != discardCommand &&
-        c->cmd->proc != multiCommand && c->cmd->proc != watchCommand &&
-        c->cmd->proc != resetCommand)
-    {
-        queueMultiCommand(c);
-        addReply(c,shared.queued);
-    } else {
-        call(c,CMD_CALL_FULL);
-        c->woff = server.master_repl_offset;
-        if (listLength(server.ready_keys))
-            handleClientsBlockedOnKeys();
-    }
-
-    return C_OK;
-}
-
-/* ====================== Error lookup and execution ===================== */
-
-void incrementErrorCount(const char *fullerr, size_t namelen) {
-    struct redisError *error = raxFind(server.errors,(unsigned char*)fullerr,namelen);
-    if (error == raxNotFound) {
-        error = zmalloc(sizeof(*error));
-        error->count = 0;
-        raxInsert(server.errors,(unsigned char*)fullerr,namelen,error,NULL);
-    }
-    error->count++;
-}
-
-/*================================== Shutdown =============================== */
-
-/* Close listening sockets. Also unlink the unix domain socket if
- * unlink_unix_socket is non-zero. */
-void closeListeningSockets(int unlink_unix_socket) {
-    int j;
-
-    for (j = 0; j < server.ipfd.count; j++) close(server.ipfd.fd[j]);
-    for (j = 0; j < server.tlsfd.count; j++) close(server.tlsfd.fd[j]);
-    if (server.sofd != -1) close(server.sofd);
-    if (server.cluster_enabled)
-        for (j = 0; j < server.cfd.count; j++) close(server.cfd.fd[j]);
-    if (unlink_unix_socket && server.unixsocket) {
-        serverLog(LL_NOTICE,"Removing the unix socket file.");
-        unlink(server.unixsocket); /* don't care if this fails */
-    }
-}
-
-int prepareForShutdown(int flags) {
-    /* When SHUTDOWN is called while the server is loading a dataset in
-     * memory we need to make sure no attempt is performed to save
-     * the dataset on shutdown (otherwise it could overwrite the current DB
-     * with half-read data).
-     *
-     * Also when in Sentinel mode clear the SAVE flag and force NOSAVE. */
-    if (server.loading || server.sentinel_mode)
-        flags = (flags & ~SHUTDOWN_SAVE) | SHUTDOWN_NOSAVE;
-
-    int save = flags & SHUTDOWN_SAVE;
-    int nosave = flags & SHUTDOWN_NOSAVE;
-
-    serverLog(LL_WARNING,"User requested shutdown...");
-    if (server.supervised_mode == SUPERVISED_SYSTEMD)
-        redisCommunicateSystemd("STOPPING=1\n");
-
-    /* Kill all the Lua debugger forked sessions. */
-    ldbKillForkedSessions();
-
-    /* Kill the saving child if there is a background saving in progress.
-       We want to avoid race conditions, for instance our saving child may
-       overwrite the synchronous saving did by SHUTDOWN. */
-    if (server.child_type == CHILD_TYPE_RDB) {
-        serverLog(LL_WARNING,"There is a child saving an .rdb. Killing it!");
-        killRDBChild();
-        /* Note that, in killRDBChild normally has backgroundSaveDoneHandler
-         * doing it's cleanup, but in this case this code will not be reached,
-         * so we need to call rdbRemoveTempFile which will close fd(in order
-         * to unlink file actully) in background thread.
-         * The temp rdb file fd may won't be closed when redis exits quickly,
-         * but OS will close this fd when process exits. */
-        rdbRemoveTempFile(server.child_pid, 0);
-    }
-
-    /* Kill module child if there is one. */
-    if (server.child_type == CHILD_TYPE_MODULE) {
-        serverLog(LL_WARNING,"There is a module fork child. Killing it!");
-        TerminateModuleForkChild(server.child_pid,0);
-    }
-
-    if (server.aof_state != AOF_OFF) {
-        /* Kill the AOF saving child as the AOF we already have may be longer
-         * but contains the full dataset anyway. */
-        if (server.child_type == CHILD_TYPE_AOF) {
-            /* If we have AOF enabled but haven't written the AOF yet, don't
-             * shutdown or else the dataset will be lost. */
-            if (server.aof_state == AOF_WAIT_REWRITE) {
-                serverLog(LL_WARNING, "Writing initial AOF, can't exit.");
-                return C_ERR;
-            }
-            serverLog(LL_WARNING,
-                "There is a child rewriting the AOF. Killing it!");
-            killAppendOnlyChild();
-        }
-        /* Append only file: flush buffers and fsync() the AOF at exit */
-        serverLog(LL_NOTICE,"Calling fsync() on the AOF file.");
-        flushAppendOnlyFile(1);
-        if (redis_fsync(server.aof_fd) == -1) {
-            serverLog(LL_WARNING,"Fail to fsync the AOF file: %s.",
-                                 strerror(errno));
-        }
-    }
-
-    /* Create a new RDB file before exiting. */
-    if ((server.saveparamslen > 0 && !nosave) || save) {
-        serverLog(LL_NOTICE,"Saving the final RDB snapshot before exiting.");
-        if (server.supervised_mode == SUPERVISED_SYSTEMD)
-            redisCommunicateSystemd("STATUS=Saving the final RDB snapshot\n");
-        /* Snapshotting. Perform a SYNC SAVE and exit */
-        rdbSaveInfo rsi, *rsiptr;
-        rsiptr = rdbPopulateSaveInfo(&rsi);
-        if (rdbSave(server.rdb_filename,rsiptr) != C_OK) {
-            /* Ooops.. error saving! The best we can do is to continue
-             * operating. Note that if there was a background saving process,
-             * in the next cron() Redis will be notified that the background
-             * saving aborted, handling special stuff like slaves pending for
-             * synchronization... */
-            serverLog(LL_WARNING,"Error trying to save the DB, can't exit.");
-            if (server.supervised_mode == SUPERVISED_SYSTEMD)
-                redisCommunicateSystemd("STATUS=Error trying to save the DB, can't exit.\n");
-            return C_ERR;
-        }
-    }
-
-    /* Fire the shutdown modules event. */
-    moduleFireServerEvent(REDISMODULE_EVENT_SHUTDOWN,0,NULL);
-
-    /* Remove the pid file if possible and needed. */
-    if (server.daemonize || server.pidfile) {
-        serverLog(LL_NOTICE,"Removing the pid file.");
-        unlink(server.pidfile);
-    }
-
-    /* Best effort flush of slave output buffers, so that we hopefully
-     * send them pending writes. */
-    flushSlavesOutputBuffers();
-
-    /* Close the listening sockets. Apparently this allows faster restarts. */
-    closeListeningSockets(1);
-    serverLog(LL_WARNING,"%s is now ready to exit, bye bye...",
-        server.sentinel_mode ? "Sentinel" : "Redis");
-    return C_OK;
-}
-
-/*================================== Commands =============================== */
-
-/* Sometimes Redis cannot accept write commands because there is a persistence
- * error with the RDB or AOF file, and Redis is configured in order to stop
- * accepting writes in such situation. This function returns if such a
- * condition is active, and the type of the condition.
- *
- * Function return values:
- *
- * DISK_ERROR_TYPE_NONE:    No problems, we can accept writes.
- * DISK_ERROR_TYPE_AOF:     Don't accept writes: AOF errors.
- * DISK_ERROR_TYPE_RDB:     Don't accept writes: RDB errors.
- */
-int writeCommandsDeniedByDiskError(void) {
-    if (server.stop_writes_on_bgsave_err &&
-        server.saveparamslen > 0 &&
-        server.lastbgsave_status == C_ERR)
-    {
-        return DISK_ERROR_TYPE_RDB;
-    } else if (server.aof_state != AOF_OFF) {
-        if (server.aof_last_write_status == C_ERR) {
-            return DISK_ERROR_TYPE_AOF;
-        }
-        /* AOF fsync error. */
-        int aof_bio_fsync_status;
-        atomicGet(server.aof_bio_fsync_status,aof_bio_fsync_status);
-        if (aof_bio_fsync_status == C_ERR) {
-            atomicGet(server.aof_bio_fsync_errno,server.aof_last_write_errno);
-            return DISK_ERROR_TYPE_AOF;
-        }
-    }
-
-    return DISK_ERROR_TYPE_NONE;
-}
-
-/* The PING command. It works in a different way if the client is in
- * in Pub/Sub mode. */
-void pingCommand(client *c) {
-    /* The command takes zero or one arguments. */
-    if (c->argc > 2) {
-        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",
-            c->cmd->name);
-        return;
-    }
-
-    if (c->flags & CLIENT_PUBSUB && c->resp == 2) {
-        addReply(c,shared.mbulkhdr[2]);
-        addReplyBulkCBuffer(c,"pong",4);
-        if (c->argc == 1)
-            addReplyBulkCBuffer(c,"",0);
-        else
-            addReplyBulk(c,c->argv[1]);
-    } else {
-        if (c->argc == 1)
-            addReply(c,shared.pong);
-        else
-            addReplyBulk(c,c->argv[1]);
-    }
-}
-
-void echoCommand(client *c) {
-    addReplyBulk(c,c->argv[1]);
-}
-
-void timeCommand(client *c) {
-    struct timeval tv;
-
-    /* gettimeofday() can only fail if &tv is a bad address so we
-     * don't check for errors. */
-    gettimeofday(&tv,NULL);
-    addReplyArrayLen(c,2);
-    addReplyBulkLongLong(c,tv.tv_sec);
-    addReplyBulkLongLong(c,tv.tv_usec);
-}
-
-/* Helper function for addReplyCommand() to output flags. */
-int addReplyCommandFlag(client *c, struct redisCommand *cmd, int f, char *reply) {
-    if (cmd->flags & f) {
-        addReplyStatus(c, reply);
-        return 1;
-    }
-    return 0;
-}
-
-/* Output the representation of a Redis command. Used by the COMMAND command. */
-void addReplyCommand(client *c, struct redisCommand *cmd) {
-    if (!cmd) {
-        addReplyNull(c);
-    } else {
-        /* We are adding: command name, arg count, flags, first, last, offset, categories */
-        addReplyArrayLen(c, 7);
-        addReplyBulkCString(c, cmd->name);
-        addReplyLongLong(c, cmd->arity);
-
-        int flagcount = 0;
-        void *flaglen = addReplyDeferredLen(c);
-        flagcount += addReplyCommandFlag(c,cmd,CMD_WRITE, "write");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_READONLY, "readonly");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_DENYOOM, "denyoom");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_ADMIN, "admin");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_PUBSUB, "pubsub");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_NOSCRIPT, "noscript");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_RANDOM, "random");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_SORT_FOR_SCRIPT,"sort_for_script");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_LOADING, "loading");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_STALE, "stale");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_SKIP_MONITOR, "skip_monitor");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_SKIP_SLOWLOG, "skip_slowlog");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_ASKING, "asking");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_FAST, "fast");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_NO_AUTH, "no_auth");
-        flagcount += addReplyCommandFlag(c,cmd,CMD_MAY_REPLICATE, "may_replicate");
-        if (cmdHasMovableKeys(cmd)) {
-            addReplyStatus(c, "movablekeys");
-            flagcount += 1;
-        }
-        setDeferredSetLen(c, flaglen, flagcount);
-
-        addReplyLongLong(c, cmd->firstkey);
-        addReplyLongLong(c, cmd->lastkey);
-        addReplyLongLong(c, cmd->keystep);
-
-        addReplyCommandCategories(c,cmd);
-    }
-}
-
-/* COMMAND <subcommand> <args> */
-void commandCommand(client *c) {
-    dictIterator *di;
-    dictEntry *de;
-
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"(no subcommand)",
-"    Return details about all Redis commands.",
-"COUNT",
-"    Return the total number of commands in this Redis server.",
-"GETKEYS <full-command>",
-"    Return the keys from a full Redis command.",
-"INFO [<command-name> ...]",
-"    Return details about multiple Redis commands.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (c->argc == 1) {
-        addReplyArrayLen(c, dictSize(server.commands));
-        di = dictGetIterator(server.commands);
-        while ((de = dictNext(di)) != NULL) {
-            addReplyCommand(c, dictGetVal(de));
-        }
-        dictReleaseIterator(di);
-    } else if (!strcasecmp(c->argv[1]->ptr, "info")) {
-        int i;
-        addReplyArrayLen(c, c->argc-2);
-        for (i = 2; i < c->argc; i++) {
-            addReplyCommand(c, dictFetchValue(server.commands, c->argv[i]->ptr));
-        }
-    } else if (!strcasecmp(c->argv[1]->ptr, "count") && c->argc == 2) {
-        addReplyLongLong(c, dictSize(server.commands));
-    } else if (!strcasecmp(c->argv[1]->ptr,"getkeys") && c->argc >= 3) {
-        struct redisCommand *cmd = lookupCommand(c->argv[2]->ptr);
-        getKeysResult result = GETKEYS_RESULT_INIT;
-        int j;
-
-        if (!cmd) {
-            addReplyError(c,"Invalid command specified");
-            return;
-        } else if (cmd->getkeys_proc == NULL && cmd->firstkey == 0) {
-            addReplyError(c,"The command has no key arguments");
-            return;
-        } else if ((cmd->arity > 0 && cmd->arity != c->argc-2) ||
-                   ((c->argc-2) < -cmd->arity))
-        {
-            addReplyError(c,"Invalid number of arguments specified for command");
-            return;
-        }
-
-        if (!getKeysFromCommand(cmd,c->argv+2,c->argc-2,&result)) {
-            addReplyError(c,"Invalid arguments specified for command");
-        } else {
-            addReplyArrayLen(c,result.numkeys);
-            for (j = 0; j < result.numkeys; j++) addReplyBulk(c,c->argv[result.keys[j]+2]);
-        }
-        getKeysFreeResult(&result);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* Convert an amount of bytes into a human readable string in the form
- * of 100B, 2G, 100M, 4K, and so forth. */
-void bytesToHuman(char *s, unsigned long long n) {
-    double d;
-
-    if (n < 1024) {
-        /* Bytes */
-        sprintf(s,"%lluB",n);
-    } else if (n < (1024*1024)) {
-        d = (double)n/(1024);
-        sprintf(s,"%.2fK",d);
-    } else if (n < (1024LL*1024*1024)) {
-        d = (double)n/(1024*1024);
-        sprintf(s,"%.2fM",d);
-    } else if (n < (1024LL*1024*1024*1024)) {
-        d = (double)n/(1024LL*1024*1024);
-        sprintf(s,"%.2fG",d);
-    } else if (n < (1024LL*1024*1024*1024*1024)) {
-        d = (double)n/(1024LL*1024*1024*1024);
-        sprintf(s,"%.2fT",d);
-    } else if (n < (1024LL*1024*1024*1024*1024*1024)) {
-        d = (double)n/(1024LL*1024*1024*1024*1024);
-        sprintf(s,"%.2fP",d);
-    } else {
-        /* Let's hope we never need this */
-        sprintf(s,"%lluB",n);
-    }
-}
-
-/* Characters we sanitize on INFO output to maintain expected format. */
-static char unsafe_info_chars[] = "#:\n\r";
-static char unsafe_info_chars_substs[] = "____";   /* Must be same length as above */
-
-/* Returns a sanitized version of s that contains no unsafe info string chars.
- * If no unsafe characters are found, simply returns s. Caller needs to
- * free tmp if it is non-null on return.
- */
-const char *getSafeInfoString(const char *s, size_t len, char **tmp) {
-    *tmp = NULL;
-    if (mempbrk(s, len, unsafe_info_chars,sizeof(unsafe_info_chars)-1)
-        == NULL) return s;
-    char *new = *tmp = zmalloc(len + 1);
-    memcpy(new, s, len);
-    new[len] = '\0';
-    return memmapchars(new, len, unsafe_info_chars, unsafe_info_chars_substs,
-                       sizeof(unsafe_info_chars)-1);
-}
-
-/* Create the string returned by the INFO command. This is decoupled
- * by the INFO command itself as we need to report the same information
- * on memory corruption problems. */
-sds genRedisInfoString(const char *section) {
-    sds info = sdsempty();
-    time_t uptime = server.unixtime-server.stat_starttime;
-    int j;
-    int allsections = 0, defsections = 0, everything = 0, modules = 0;
-    int sections = 0;
-
-    if (section == NULL) section = "default";
-    allsections = strcasecmp(section,"all") == 0;
-    defsections = strcasecmp(section,"default") == 0;
-    everything = strcasecmp(section,"everything") == 0;
-    modules = strcasecmp(section,"modules") == 0;
-    if (everything) allsections = 1;
-
-    /* Server */
-    if (allsections || defsections || !strcasecmp(section,"server")) {
-        static int call_uname = 1;
-        static struct utsname name;
-        char *mode;
-        char *supervised;
-
-        if (server.cluster_enabled) mode = "cluster";
-        else if (server.sentinel_mode) mode = "sentinel";
-        else mode = "standalone";
-
-        if (server.supervised) {
-            if (server.supervised_mode == SUPERVISED_UPSTART) supervised = "upstart";
-            else if (server.supervised_mode == SUPERVISED_SYSTEMD) supervised = "systemd";
-            else supervised = "unknown";
-        } else {
-            supervised = "no";
-        }
-
-        if (sections++) info = sdscat(info,"\r\n");
-
-        if (call_uname) {
-            /* Uname can be slow and is always the same output. Cache it. */
-            uname(&name);
-            call_uname = 0;
-        }
-
-        unsigned int lruclock;
-        atomicGet(server.lruclock,lruclock);
-        info = sdscatfmt(info,
-            "# Server\r\n"
-            "redis_version:%s\r\n"
-            "redis_git_sha1:%s\r\n"
-            "redis_git_dirty:%i\r\n"
-            "redis_build_id:%s\r\n"
-            "redis_mode:%s\r\n"
-            "os:%s %s %s\r\n"
-            "arch_bits:%i\r\n"
-            "multiplexing_api:%s\r\n"
-            "atomicvar_api:%s\r\n"
-            "gcc_version:%i.%i.%i\r\n"
-            "process_id:%I\r\n"
-            "process_supervised:%s\r\n"
-            "run_id:%s\r\n"
-            "tcp_port:%i\r\n"
-            "server_time_usec:%I\r\n"
-            "uptime_in_seconds:%I\r\n"
-            "uptime_in_days:%I\r\n"
-            "hz:%i\r\n"
-            "configured_hz:%i\r\n"
-            "lru_clock:%u\r\n"
-            "executable:%s\r\n"
-            "config_file:%s\r\n"
-            "io_threads_active:%i\r\n",
-            REDIS_VERSION,
-            redisGitSHA1(),
-            strtol(redisGitDirty(),NULL,10) > 0,
-            redisBuildIdString(),
-            mode,
-            name.sysname, name.release, name.machine,
-            server.arch_bits,
-            aeGetApiName(),
-            REDIS_ATOMIC_API,
-#ifdef __GNUC__
-            __GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__,
-#else
-            0,0,0,
-#endif
-            (int64_t) getpid(),
-            supervised,
-            server.runid,
-            server.port ? server.port : server.tls_port,
-            (int64_t)server.ustime,
-            (int64_t)uptime,
-            (int64_t)(uptime/(3600*24)),
-            server.hz,
-            server.config_hz,
-            lruclock,
-            server.executable ? server.executable : "",
-            server.configfile ? server.configfile : "",
-            server.io_threads_active);
-    }
-
-    /* Clients */
-    if (allsections || defsections || !strcasecmp(section,"clients")) {
-        size_t maxin, maxout;
-        getExpansiveClientsInfo(&maxin,&maxout);
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-            "# Clients\r\n"
-            "connected_clients:%lu\r\n"
-            "cluster_connections:%lu\r\n"
-            "maxclients:%u\r\n"
-            "client_recent_max_input_buffer:%zu\r\n"
-            "client_recent_max_output_buffer:%zu\r\n"
-            "blocked_clients:%d\r\n"
-            "tracking_clients:%d\r\n"
-            "clients_in_timeout_table:%llu\r\n",
-            listLength(server.clients)-listLength(server.slaves),
-            getClusterConnectionsCount(),
-            server.maxclients,
-            maxin, maxout,
-            server.blocked_clients,
-            server.tracking_clients,
-            (unsigned long long) raxSize(server.clients_timeout_table));
-    }
-
-    /* Memory */
-    if (allsections || defsections || !strcasecmp(section,"memory")) {
-        char hmem[64];
-        char peak_hmem[64];
-        char total_system_hmem[64];
-        char used_memory_lua_hmem[64];
-        char used_memory_scripts_hmem[64];
-        char used_memory_rss_hmem[64];
-        char maxmemory_hmem[64];
-        size_t zmalloc_used = zmalloc_used_memory();
-        size_t total_system_mem = server.system_memory_size;
-        const char *evict_policy = evictPolicyToString();
-        long long memory_lua = server.lua ? (long long)lua_gc(server.lua,LUA_GCCOUNT,0)*1024 : 0;
-        struct redisMemOverhead *mh = getMemoryOverheadData();
-
-        /* Peak memory is updated from time to time by serverCron() so it
-         * may happen that the instantaneous value is slightly bigger than
-         * the peak value. This may confuse users, so we update the peak
-         * if found smaller than the current memory usage. */
-        if (zmalloc_used > server.stat_peak_memory)
-            server.stat_peak_memory = zmalloc_used;
-
-        bytesToHuman(hmem,zmalloc_used);
-        bytesToHuman(peak_hmem,server.stat_peak_memory);
-        bytesToHuman(total_system_hmem,total_system_mem);
-        bytesToHuman(used_memory_lua_hmem,memory_lua);
-        bytesToHuman(used_memory_scripts_hmem,mh->lua_caches);
-        bytesToHuman(used_memory_rss_hmem,server.cron_malloc_stats.process_rss);
-        bytesToHuman(maxmemory_hmem,server.maxmemory);
-
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-            "# Memory\r\n"
-            "used_memory:%zu\r\n"
-            "used_memory_human:%s\r\n"
-            "used_memory_rss:%zu\r\n"
-            "used_memory_rss_human:%s\r\n"
-            "used_memory_peak:%zu\r\n"
-            "used_memory_peak_human:%s\r\n"
-            "used_memory_peak_perc:%.2f%%\r\n"
-            "used_memory_overhead:%zu\r\n"
-            "used_memory_startup:%zu\r\n"
-            "used_memory_dataset:%zu\r\n"
-            "used_memory_dataset_perc:%.2f%%\r\n"
-            "allocator_allocated:%zu\r\n"
-            "allocator_active:%zu\r\n"
-            "allocator_resident:%zu\r\n"
-            "total_system_memory:%lu\r\n"
-            "total_system_memory_human:%s\r\n"
-            "used_memory_lua:%lld\r\n"
-            "used_memory_lua_human:%s\r\n"
-            "used_memory_scripts:%lld\r\n"
-            "used_memory_scripts_human:%s\r\n"
-            "number_of_cached_scripts:%lu\r\n"
-            "maxmemory:%lld\r\n"
-            "maxmemory_human:%s\r\n"
-            "maxmemory_policy:%s\r\n"
-            "allocator_frag_ratio:%.2f\r\n"
-            "allocator_frag_bytes:%zu\r\n"
-            "allocator_rss_ratio:%.2f\r\n"
-            "allocator_rss_bytes:%zd\r\n"
-            "rss_overhead_ratio:%.2f\r\n"
-            "rss_overhead_bytes:%zd\r\n"
-            "mem_fragmentation_ratio:%.2f\r\n"
-            "mem_fragmentation_bytes:%zd\r\n"
-            "mem_not_counted_for_evict:%zu\r\n"
-            "mem_replication_backlog:%zu\r\n"
-            "mem_clients_slaves:%zu\r\n"
-            "mem_clients_normal:%zu\r\n"
-            "mem_aof_buffer:%zu\r\n"
-            "mem_allocator:%s\r\n"
-            "active_defrag_running:%d\r\n"
-            "lazyfree_pending_objects:%zu\r\n"
-            "lazyfreed_objects:%zu\r\n",
-            zmalloc_used,
-            hmem,
-            server.cron_malloc_stats.process_rss,
-            used_memory_rss_hmem,
-            server.stat_peak_memory,
-            peak_hmem,
-            mh->peak_perc,
-            mh->overhead_total,
-            mh->startup_allocated,
-            mh->dataset,
-            mh->dataset_perc,
-            server.cron_malloc_stats.allocator_allocated,
-            server.cron_malloc_stats.allocator_active,
-            server.cron_malloc_stats.allocator_resident,
-            (unsigned long)total_system_mem,
-            total_system_hmem,
-            memory_lua,
-            used_memory_lua_hmem,
-            (long long) mh->lua_caches,
-            used_memory_scripts_hmem,
-            dictSize(server.lua_scripts),
-            server.maxmemory,
-            maxmemory_hmem,
-            evict_policy,
-            mh->allocator_frag,
-            mh->allocator_frag_bytes,
-            mh->allocator_rss,
-            mh->allocator_rss_bytes,
-            mh->rss_extra,
-            mh->rss_extra_bytes,
-            mh->total_frag,       /* This is the total RSS overhead, including
-                                     fragmentation, but not just it. This field
-                                     (and the next one) is named like that just
-                                     for backward compatibility. */
-            mh->total_frag_bytes,
-            freeMemoryGetNotCountedMemory(),
-            mh->repl_backlog,
-            mh->clients_slaves,
-            mh->clients_normal,
-            mh->aof_buffer,
-            ZMALLOC_LIB,
-            server.active_defrag_running,
-            lazyfreeGetPendingObjectsCount(),
-            lazyfreeGetFreedObjectsCount()
-        );
-        freeMemoryOverheadData(mh);
-    }
-
-    /* Persistence */
-    if (allsections || defsections || !strcasecmp(section,"persistence")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        double fork_perc = 0;
-        if (server.stat_module_progress) {
-            fork_perc = server.stat_module_progress * 100;
-        } else if (server.stat_current_save_keys_total) {
-            fork_perc = ((double)server.stat_current_save_keys_processed / server.stat_current_save_keys_total) * 100;
-        }
-        int aof_bio_fsync_status;
-        atomicGet(server.aof_bio_fsync_status,aof_bio_fsync_status);
-
-        info = sdscatprintf(info,
-            "# Persistence\r\n"
-            "loading:%d\r\n"
-            "current_cow_size:%zu\r\n"
-            "current_cow_size_age:%lu\r\n"
-            "current_fork_perc:%.2f\r\n"
-            "current_save_keys_processed:%zu\r\n"
-            "current_save_keys_total:%zu\r\n"
-            "rdb_changes_since_last_save:%lld\r\n"
-            "rdb_bgsave_in_progress:%d\r\n"
-            "rdb_last_save_time:%jd\r\n"
-            "rdb_last_bgsave_status:%s\r\n"
-            "rdb_last_bgsave_time_sec:%jd\r\n"
-            "rdb_current_bgsave_time_sec:%jd\r\n"
-            "rdb_last_cow_size:%zu\r\n"
-            "aof_enabled:%d\r\n"
-            "aof_rewrite_in_progress:%d\r\n"
-            "aof_rewrite_scheduled:%d\r\n"
-            "aof_last_rewrite_time_sec:%jd\r\n"
-            "aof_current_rewrite_time_sec:%jd\r\n"
-            "aof_last_bgrewrite_status:%s\r\n"
-            "aof_last_write_status:%s\r\n"
-            "aof_last_cow_size:%zu\r\n"
-            "module_fork_in_progress:%d\r\n"
-            "module_fork_last_cow_size:%zu\r\n",
-            (int)server.loading,
-            server.stat_current_cow_bytes,
-            server.stat_current_cow_updated ? (unsigned long) elapsedMs(server.stat_current_cow_updated) / 1000 : 0,
-            fork_perc,
-            server.stat_current_save_keys_processed,
-            server.stat_current_save_keys_total,
-            server.dirty,
-            server.child_type == CHILD_TYPE_RDB,
-            (intmax_t)server.lastsave,
-            (server.lastbgsave_status == C_OK) ? "ok" : "err",
-            (intmax_t)server.rdb_save_time_last,
-            (intmax_t)((server.child_type != CHILD_TYPE_RDB) ?
-                -1 : time(NULL)-server.rdb_save_time_start),
-            server.stat_rdb_cow_bytes,
-            server.aof_state != AOF_OFF,
-            server.child_type == CHILD_TYPE_AOF,
-            server.aof_rewrite_scheduled,
-            (intmax_t)server.aof_rewrite_time_last,
-            (intmax_t)((server.child_type != CHILD_TYPE_AOF) ?
-                -1 : time(NULL)-server.aof_rewrite_time_start),
-            (server.aof_lastbgrewrite_status == C_OK) ? "ok" : "err",
-            (server.aof_last_write_status == C_OK &&
-                aof_bio_fsync_status == C_OK) ? "ok" : "err",
-            server.stat_aof_cow_bytes,
-            server.child_type == CHILD_TYPE_MODULE,
-            server.stat_module_cow_bytes);
-
-        if (server.aof_enabled) {
-            info = sdscatprintf(info,
-                "aof_current_size:%lld\r\n"
-                "aof_base_size:%lld\r\n"
-                "aof_pending_rewrite:%d\r\n"
-                "aof_buffer_length:%zu\r\n"
-                "aof_rewrite_buffer_length:%lu\r\n"
-                "aof_pending_bio_fsync:%llu\r\n"
-                "aof_delayed_fsync:%lu\r\n",
-                (long long) server.aof_current_size,
-                (long long) server.aof_rewrite_base_size,
-                server.aof_rewrite_scheduled,
-                sdslen(server.aof_buf),
-                aofRewriteBufferSize(),
-                bioPendingJobsOfType(BIO_AOF_FSYNC),
-                server.aof_delayed_fsync);
-        }
-
-        if (server.loading) {
-            double perc = 0;
-            time_t eta, elapsed;
-            off_t remaining_bytes = 1;
-
-            if (server.loading_total_bytes) {
-                perc = ((double)server.loading_loaded_bytes / server.loading_total_bytes) * 100;
-                remaining_bytes = server.loading_total_bytes - server.loading_loaded_bytes;
-            } else if(server.loading_rdb_used_mem) {
-                perc = ((double)server.loading_loaded_bytes / server.loading_rdb_used_mem) * 100;
-                remaining_bytes = server.loading_rdb_used_mem - server.loading_loaded_bytes;
-                /* used mem is only a (bad) estimation of the rdb file size, avoid going over 100% */
-                if (perc > 99.99) perc = 99.99;
-                if (remaining_bytes < 1) remaining_bytes = 1;
-            }
-
-            elapsed = time(NULL)-server.loading_start_time;
-            if (elapsed == 0) {
-                eta = 1; /* A fake 1 second figure if we don't have
-                            enough info */
-            } else {
-                eta = (elapsed*remaining_bytes)/(server.loading_loaded_bytes+1);
-            }
-
-            info = sdscatprintf(info,
-                "loading_start_time:%jd\r\n"
-                "loading_total_bytes:%llu\r\n"
-                "loading_rdb_used_mem:%llu\r\n"
-                "loading_loaded_bytes:%llu\r\n"
-                "loading_loaded_perc:%.2f\r\n"
-                "loading_eta_seconds:%jd\r\n",
-                (intmax_t) server.loading_start_time,
-                (unsigned long long) server.loading_total_bytes,
-                (unsigned long long) server.loading_rdb_used_mem,
-                (unsigned long long) server.loading_loaded_bytes,
-                perc,
-                (intmax_t)eta
-            );
-        }
-    }
-
-    /* Stats */
-    if (allsections || defsections || !strcasecmp(section,"stats")) {
-        long long stat_total_reads_processed, stat_total_writes_processed;
-        long long stat_net_input_bytes, stat_net_output_bytes;
-        atomicGet(server.stat_total_reads_processed, stat_total_reads_processed);
-        atomicGet(server.stat_total_writes_processed, stat_total_writes_processed);
-        atomicGet(server.stat_net_input_bytes, stat_net_input_bytes);
-        atomicGet(server.stat_net_output_bytes, stat_net_output_bytes);
-
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-            "# Stats\r\n"
-            "total_connections_received:%lld\r\n"
-            "total_commands_processed:%lld\r\n"
-            "instantaneous_ops_per_sec:%lld\r\n"
-            "total_net_input_bytes:%lld\r\n"
-            "total_net_output_bytes:%lld\r\n"
-            "instantaneous_input_kbps:%.2f\r\n"
-            "instantaneous_output_kbps:%.2f\r\n"
-            "rejected_connections:%lld\r\n"
-            "sync_full:%lld\r\n"
-            "sync_partial_ok:%lld\r\n"
-            "sync_partial_err:%lld\r\n"
-            "expired_keys:%lld\r\n"
-            "expired_stale_perc:%.2f\r\n"
-            "expired_time_cap_reached_count:%lld\r\n"
-            "expire_cycle_cpu_milliseconds:%lld\r\n"
-            "evicted_keys:%lld\r\n"
-            "keyspace_hits:%lld\r\n"
-            "keyspace_misses:%lld\r\n"
-            "pubsub_channels:%ld\r\n"
-            "pubsub_patterns:%lu\r\n"
-            "latest_fork_usec:%lld\r\n"
-            "total_forks:%lld\r\n"
-            "migrate_cached_sockets:%ld\r\n"
-            "slave_expires_tracked_keys:%zu\r\n"
-            "active_defrag_hits:%lld\r\n"
-            "active_defrag_misses:%lld\r\n"
-            "active_defrag_key_hits:%lld\r\n"
-            "active_defrag_key_misses:%lld\r\n"
-            "tracking_total_keys:%lld\r\n"
-            "tracking_total_items:%lld\r\n"
-            "tracking_total_prefixes:%lld\r\n"
-            "unexpected_error_replies:%lld\r\n"
-            "total_error_replies:%lld\r\n"
-            "dump_payload_sanitizations:%lld\r\n"
-            "total_reads_processed:%lld\r\n"
-            "total_writes_processed:%lld\r\n"
-            "io_threaded_reads_processed:%lld\r\n"
-            "io_threaded_writes_processed:%lld\r\n",
-            server.stat_numconnections,
-            server.stat_numcommands,
-            getInstantaneousMetric(STATS_METRIC_COMMAND),
-            stat_net_input_bytes,
-            stat_net_output_bytes,
-            (float)getInstantaneousMetric(STATS_METRIC_NET_INPUT)/1024,
-            (float)getInstantaneousMetric(STATS_METRIC_NET_OUTPUT)/1024,
-            server.stat_rejected_conn,
-            server.stat_sync_full,
-            server.stat_sync_partial_ok,
-            server.stat_sync_partial_err,
-            server.stat_expiredkeys,
-            server.stat_expired_stale_perc*100,
-            server.stat_expired_time_cap_reached_count,
-            server.stat_expire_cycle_time_used/1000,
-            server.stat_evictedkeys,
-            server.stat_keyspace_hits,
-            server.stat_keyspace_misses,
-            dictSize(server.pubsub_channels),
-            dictSize(server.pubsub_patterns),
-            server.stat_fork_time,
-            server.stat_total_forks,
-            dictSize(server.migrate_cached_sockets),
-            getSlaveKeyWithExpireCount(),
-            server.stat_active_defrag_hits,
-            server.stat_active_defrag_misses,
-            server.stat_active_defrag_key_hits,
-            server.stat_active_defrag_key_misses,
-            (unsigned long long) trackingGetTotalKeys(),
-            (unsigned long long) trackingGetTotalItems(),
-            (unsigned long long) trackingGetTotalPrefixes(),
-            server.stat_unexpected_error_replies,
-            server.stat_total_error_replies,
-            server.stat_dump_payload_sanitizations,
-            stat_total_reads_processed,
-            stat_total_writes_processed,
-            server.stat_io_reads_processed,
-            server.stat_io_writes_processed);
-    }
-
-    /* Replication */
-    if (allsections || defsections || !strcasecmp(section,"replication")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-            "# Replication\r\n"
-            "role:%s\r\n",
-            server.masterhost == NULL ? "master" : "slave");
-        if (server.masterhost) {
-            long long slave_repl_offset = 1;
-            long long slave_read_repl_offset = 1;
-
-            if (server.master) {
-                slave_repl_offset = server.master->reploff;
-                slave_read_repl_offset = server.master->read_reploff;
-            } else if (server.cached_master) {
-                slave_repl_offset = server.cached_master->reploff;
-                slave_read_repl_offset = server.cached_master->read_reploff;
-            }
-
-            info = sdscatprintf(info,
-                "master_host:%s\r\n"
-                "master_port:%d\r\n"
-                "master_link_status:%s\r\n"
-                "master_last_io_seconds_ago:%d\r\n"
-                "master_sync_in_progress:%d\r\n"
-                "slave_read_repl_offset:%lld\r\n"
-                "slave_repl_offset:%lld\r\n"
-                ,server.masterhost,
-                server.masterport,
-                (server.repl_state == REPL_STATE_CONNECTED) ?
-                    "up" : "down",
-                server.master ?
-                ((int)(server.unixtime-server.master->lastinteraction)) : -1,
-                server.repl_state == REPL_STATE_TRANSFER,
-                slave_read_repl_offset,
-                slave_repl_offset
-            );
-
-            if (server.repl_state == REPL_STATE_TRANSFER) {
-                double perc = 0;
-                if (server.repl_transfer_size) {
-                    perc = ((double)server.repl_transfer_read / server.repl_transfer_size) * 100;
-                }
-                info = sdscatprintf(info,
-                    "master_sync_total_bytes:%lld\r\n"
-                    "master_sync_read_bytes:%lld\r\n"
-                    "master_sync_left_bytes:%lld\r\n"
-                    "master_sync_perc:%.2f\r\n"
-                    "master_sync_last_io_seconds_ago:%d\r\n",
-                    (long long) server.repl_transfer_size,
-                    (long long) server.repl_transfer_read,
-                    (long long) (server.repl_transfer_size - server.repl_transfer_read),
-                    perc,
-                    (int)(server.unixtime-server.repl_transfer_lastio)
-                );
-            }
-
-            if (server.repl_state != REPL_STATE_CONNECTED) {
-                info = sdscatprintf(info,
-                    "master_link_down_since_seconds:%jd\r\n",
-                    server.repl_down_since ?
-                    (intmax_t)(server.unixtime-server.repl_down_since) : -1);
-            }
-            info = sdscatprintf(info,
-                "slave_priority:%d\r\n"
-                "slave_read_only:%d\r\n"
-                "replica_announced:%d\r\n",
-                server.slave_priority,
-                server.repl_slave_ro,
-                server.replica_announced);
-        }
-
-        info = sdscatprintf(info,
-            "connected_slaves:%lu\r\n",
-            listLength(server.slaves));
-
-        /* If min-slaves-to-write is active, write the number of slaves
-         * currently considered 'good'. */
-        if (server.repl_min_slaves_to_write &&
-            server.repl_min_slaves_max_lag) {
-            info = sdscatprintf(info,
-                "min_slaves_good_slaves:%d\r\n",
-                server.repl_good_slaves_count);
-        }
-
-        if (listLength(server.slaves)) {
-            int slaveid = 0;
-            listNode *ln;
-            listIter li;
-
-            listRewind(server.slaves,&li);
-            while((ln = listNext(&li))) {
-                client *slave = listNodeValue(ln);
-                char *state = NULL;
-                char ip[NET_IP_STR_LEN], *slaveip = slave->slave_addr;
-                int port;
-                long lag = 0;
-
-                if (!slaveip) {
-                    if (connPeerToString(slave->conn,ip,sizeof(ip),&port) == -1)
-                        continue;
-                    slaveip = ip;
-                }
-                switch(slave->replstate) {
-                case SLAVE_STATE_WAIT_BGSAVE_START:
-                case SLAVE_STATE_WAIT_BGSAVE_END:
-                    state = "wait_bgsave";
-                    break;
-                case SLAVE_STATE_SEND_BULK:
-                    state = "send_bulk";
-                    break;
-                case SLAVE_STATE_ONLINE:
-                    state = "online";
-                    break;
-                }
-                if (state == NULL) continue;
-                if (slave->replstate == SLAVE_STATE_ONLINE)
-                    lag = time(NULL) - slave->repl_ack_time;
-
-                info = sdscatprintf(info,
-                    "slave%d:ip=%s,port=%d,state=%s,"
-                    "offset=%lld,lag=%ld\r\n",
-                    slaveid,slaveip,slave->slave_listening_port,state,
-                    slave->repl_ack_off, lag);
-                slaveid++;
-            }
-        }
-        info = sdscatprintf(info,
-            "master_failover_state:%s\r\n"
-            "master_replid:%s\r\n"
-            "master_replid2:%s\r\n"
-            "master_repl_offset:%lld\r\n"
-            "second_repl_offset:%lld\r\n"
-            "repl_backlog_active:%d\r\n"
-            "repl_backlog_size:%lld\r\n"
-            "repl_backlog_first_byte_offset:%lld\r\n"
-            "repl_backlog_histlen:%lld\r\n",
-            getFailoverStateString(),
-            server.replid,
-            server.replid2,
-            server.master_repl_offset,
-            server.second_replid_offset,
-            server.repl_backlog != NULL,
-            server.repl_backlog_size,
-            server.repl_backlog_off,
-            server.repl_backlog_histlen);
-    }
-
-    /* CPU */
-    if (allsections || defsections || !strcasecmp(section,"cpu")) {
-        if (sections++) info = sdscat(info,"\r\n");
-
-        struct rusage self_ru, c_ru;
-        getrusage(RUSAGE_SELF, &self_ru);
-        getrusage(RUSAGE_CHILDREN, &c_ru);
-        info = sdscatprintf(info,
-        "# CPU\r\n"
-        "used_cpu_sys:%ld.%06ld\r\n"
-        "used_cpu_user:%ld.%06ld\r\n"
-        "used_cpu_sys_children:%ld.%06ld\r\n"
-        "used_cpu_user_children:%ld.%06ld\r\n",
-        (long)self_ru.ru_stime.tv_sec, (long)self_ru.ru_stime.tv_usec,
-        (long)self_ru.ru_utime.tv_sec, (long)self_ru.ru_utime.tv_usec,
-        (long)c_ru.ru_stime.tv_sec, (long)c_ru.ru_stime.tv_usec,
-        (long)c_ru.ru_utime.tv_sec, (long)c_ru.ru_utime.tv_usec);
-#ifdef RUSAGE_THREAD
-        struct rusage m_ru;
-        getrusage(RUSAGE_THREAD, &m_ru);
-        info = sdscatprintf(info,
-            "used_cpu_sys_main_thread:%ld.%06ld\r\n"
-            "used_cpu_user_main_thread:%ld.%06ld\r\n",
-            (long)m_ru.ru_stime.tv_sec, (long)m_ru.ru_stime.tv_usec,
-            (long)m_ru.ru_utime.tv_sec, (long)m_ru.ru_utime.tv_usec);
-#endif  /* RUSAGE_THREAD */
-    }
-
-    /* Modules */
-    if (allsections || defsections || !strcasecmp(section,"modules")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,"# Modules\r\n");
-        info = genModulesInfoString(info);
-    }
-
-    /* Command statistics */
-    if (allsections || !strcasecmp(section,"commandstats")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info, "# Commandstats\r\n");
-
-        struct redisCommand *c;
-        dictEntry *de;
-        dictIterator *di;
-        di = dictGetSafeIterator(server.commands);
-        while((de = dictNext(di)) != NULL) {
-            char *tmpsafe;
-            c = (struct redisCommand *) dictGetVal(de);
-            if (!c->calls && !c->failed_calls && !c->rejected_calls)
-                continue;
-            info = sdscatprintf(info,
-                "cmdstat_%s:calls=%lld,usec=%lld,usec_per_call=%.2f"
-                ",rejected_calls=%lld,failed_calls=%lld\r\n",
-                getSafeInfoString(c->name, strlen(c->name), &tmpsafe), c->calls, c->microseconds,
-                (c->calls == 0) ? 0 : ((float)c->microseconds/c->calls),
-                c->rejected_calls, c->failed_calls);
-            if (tmpsafe != NULL) zfree(tmpsafe);
-        }
-        dictReleaseIterator(di);
-    }
-    /* Error statistics */
-    if (allsections || defsections || !strcasecmp(section,"errorstats")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscat(info, "# Errorstats\r\n");
-        raxIterator ri;
-        raxStart(&ri,server.errors);
-        raxSeek(&ri,"^",NULL,0);
-        struct redisError *e;
-        while(raxNext(&ri)) {
-            char *tmpsafe;
-            e = (struct redisError *) ri.data;
-            info = sdscatprintf(info,
-                "errorstat_%.*s:count=%lld\r\n",
-                (int)ri.key_len, getSafeInfoString((char *) ri.key, ri.key_len, &tmpsafe), e->count);
-            if (tmpsafe != NULL) zfree(tmpsafe);
-        }
-        raxStop(&ri);
-    }
-
-    /* Cluster */
-    if (allsections || defsections || !strcasecmp(section,"cluster")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info,
-        "# Cluster\r\n"
-        "cluster_enabled:%d\r\n",
-        server.cluster_enabled);
-    }
-
-    /* Key space */
-    if (allsections || defsections || !strcasecmp(section,"keyspace")) {
-        if (sections++) info = sdscat(info,"\r\n");
-        info = sdscatprintf(info, "# Keyspace\r\n");
-        for (j = 0; j < server.dbnum; j++) {
-            long long keys, vkeys;
-
-            keys = dictSize(server.db[j].dict);
-            vkeys = dictSize(server.db[j].expires);
-            if (keys || vkeys) {
-                info = sdscatprintf(info,
-                    "db%d:keys=%lld,expires=%lld,avg_ttl=%lld\r\n",
-                    j, keys, vkeys, server.db[j].avg_ttl);
-            }
-        }
-    }
-
-    /* Get info from modules.
-     * if user asked for "everything" or "modules", or a specific section
-     * that's not found yet. */
-    if (everything || modules ||
-        (!allsections && !defsections && sections==0)) {
-        info = modulesCollectInfo(info,
-                                  everything || modules ? NULL: section,
-                                  0, /* not a crash report */
-                                  sections);
-    }
-    return info;
-}
-
-void infoCommand(client *c) {
-    char *section = c->argc == 2 ? c->argv[1]->ptr : "default";
-
-    if (c->argc > 2) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-    sds info = genRedisInfoString(section);
-    addReplyVerbatim(c,info,sdslen(info),"txt");
-    sdsfree(info);
-}
-
-void monitorCommand(client *c) {
-    if (c->flags & CLIENT_DENY_BLOCKING) {
-        /**
-         * A client that has CLIENT_DENY_BLOCKING flag on
-         * expects a reply per command and so can't execute MONITOR. */
-        addReplyError(c, "MONITOR isn't allowed for DENY BLOCKING client");
-        return;
-    }
-
-    /* ignore MONITOR if already slave or in monitor mode */
-    if (c->flags & CLIENT_SLAVE) return;
-
-    c->flags |= (CLIENT_SLAVE|CLIENT_MONITOR);
-    listAddNodeTail(server.monitors,c);
-    addReply(c,shared.ok);
-}
-
-/* =================================== Main! ================================ */
-
-int checkIgnoreWarning(const char *warning) {
-    int argc, j;
-    sds *argv = sdssplitargs(server.ignore_warnings, &argc);
-    if (argv == NULL)
-        return 0;
-
-    for (j = 0; j < argc; j++) {
-        char *flag = argv[j];
-        if (!strcasecmp(flag, warning))
-            break;
-    }
-    sdsfreesplitres(argv,argc);
-    return j < argc;
-}
-
-#ifdef __linux__
-int linuxOvercommitMemoryValue(void) {
-    FILE *fp = fopen("/proc/sys/vm/overcommit_memory","r");
-    char buf[64];
-
-    if (!fp) return -1;
-    if (fgets(buf,64,fp) == NULL) {
-        fclose(fp);
-        return -1;
-    }
-    fclose(fp);
-
-    return atoi(buf);
-}
-
-void linuxMemoryWarnings(void) {
-    if (linuxOvercommitMemoryValue() == 0) {
-        serverLog(LL_WARNING,"WARNING overcommit_memory is set to 0! Background save may fail under low memory condition. To fix this issue add 'vm.overcommit_memory = 1' to /etc/sysctl.conf and then reboot or run the command 'sysctl vm.overcommit_memory=1' for this to take effect.");
-    }
-    if (THPIsEnabled() && THPDisable()) {
-        serverLog(LL_WARNING,"WARNING you have Transparent Huge Pages (THP) support enabled in your kernel. This will create latency and memory usage issues with Redis. To fix this issue run the command 'echo madvise > /sys/kernel/mm/transparent_hugepage/enabled' as root, and add it to your /etc/rc.local in order to retain the setting after a reboot. Redis must be restarted after THP is disabled (set to 'madvise' or 'never').");
-    }
-}
-
-#ifdef __arm64__
-
-/* Get size in kilobytes of the Shared_Dirty pages of the calling process for the
- * memory map corresponding to the provided address, or -1 on error. */
-static int smapsGetSharedDirty(unsigned long addr) {
-    int ret, in_mapping = 0, val = -1;
-    unsigned long from, to;
-    char buf[64];
-    FILE *f;
-
-    f = fopen("/proc/self/smaps", "r");
-    if (!f) return -1;
-
-    while (1) {
-        if (!fgets(buf, sizeof(buf), f))
-            break;
-
-        ret = sscanf(buf, "%lx-%lx", &from, &to);
-        if (ret == 2)
-            in_mapping = from <= addr && addr < to;
-
-        if (in_mapping && !memcmp(buf, "Shared_Dirty:", 13)) {
-            sscanf(buf, "%*s %d", &val);
-            /* If parsing fails, we remain with val == -1 */
-            break;
-        }
-    }
-
-    fclose(f);
-    return val;
-}
-
-/* Older arm64 Linux kernels have a bug that could lead to data corruption
- * during background save in certain scenarios. This function checks if the
- * kernel is affected.
- * The bug was fixed in commit ff1712f953e27f0b0718762ec17d0adb15c9fd0b
- * titled: "arm64: pgtable: Ensure dirty bit is preserved across pte_wrprotect()"
- * Return -1 on unexpected test failure, 1 if the kernel seems to be affected,
- * and 0 otherwise. */
-int linuxMadvFreeForkBugCheck(void) {
-    int ret, pipefd[2] = { -1, -1 };
-    pid_t pid;
-    char *p = NULL, *q;
-    int bug_found = 0;
-    long page_size = sysconf(_SC_PAGESIZE);
-    long map_size = 3 * page_size;
-
-    /* Create a memory map that's in our full control (not one used by the allocator). */
-    p = mmap(NULL, map_size, PROT_READ, MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
-    if (p == MAP_FAILED) {
-        serverLog(LL_WARNING, "Failed to mmap(): %s", strerror(errno));
-        return -1;
-    }
-
-    q = p + page_size;
-
-    /* Split the memory map in 3 pages by setting their protection as RO|RW|RO to prevent
-     * Linux from merging this memory map with adjacent VMAs. */
-    ret = mprotect(q, page_size, PROT_READ | PROT_WRITE);
-    if (ret < 0) {
-        serverLog(LL_WARNING, "Failed to mprotect(): %s", strerror(errno));
-        bug_found = -1;
-        goto exit;
-    }
-
-    /* Write to the page once to make it resident */
-    *(volatile char*)q = 0;
-
-    /* Tell the kernel that this page is free to be reclaimed. */
-#ifndef MADV_FREE
-#define MADV_FREE 8
-#endif
-    ret = madvise(q, page_size, MADV_FREE);
-    if (ret < 0) {
-        /* MADV_FREE is not available on older kernels that are presumably
-         * not affected. */
-        if (errno == EINVAL) goto exit;
-
-        serverLog(LL_WARNING, "Failed to madvise(): %s", strerror(errno));
-        bug_found = -1;
-        goto exit;
-    }
-
-    /* Write to the page after being marked for freeing, this is supposed to take
-     * ownership of that page again. */
-    *(volatile char*)q = 0;
-
-    /* Create a pipe for the child to return the info to the parent. */
-    ret = pipe(pipefd);
-    if (ret < 0) {
-        serverLog(LL_WARNING, "Failed to create pipe: %s", strerror(errno));
-        bug_found = -1;
-        goto exit;
-    }
-
-    /* Fork the process. */
-    pid = fork();
-    if (pid < 0) {
-        serverLog(LL_WARNING, "Failed to fork: %s", strerror(errno));
-        bug_found = -1;
-        goto exit;
-    } else if (!pid) {
-        /* Child: check if the page is marked as dirty, page_size in kb.
-         * A value of 0 means the kernel is affected by the bug. */
-        ret = smapsGetSharedDirty((unsigned long) q);
-        if (!ret)
-            bug_found = 1;
-        else if (ret == -1)     /* Failed to read */
-            bug_found = -1;
-
-        if (write(pipefd[1], &bug_found, sizeof(bug_found)) < 0)
-            serverLog(LL_WARNING, "Failed to write to parent: %s", strerror(errno));
-        exit(0);
-    } else {
-        /* Read the result from the child. */
-        ret = read(pipefd[0], &bug_found, sizeof(bug_found));
-        if (ret < 0) {
-            serverLog(LL_WARNING, "Failed to read from child: %s", strerror(errno));
-            bug_found = -1;
-        }
-
-        /* Reap the child pid. */
-        waitpid(pid, NULL, 0);
-    }
-
-exit:
-    /* Cleanup */
-    if (pipefd[0] != -1) close(pipefd[0]);
-    if (pipefd[1] != -1) close(pipefd[1]);
-    if (p != NULL) munmap(p, map_size);
-
-    return bug_found;
-}
-#endif /* __arm64__ */
-#endif /* __linux__ */
-
-void createPidFile(void) {
-    /* If pidfile requested, but no pidfile defined, use
-     * default pidfile path */
-    if (!server.pidfile) server.pidfile = zstrdup(CONFIG_DEFAULT_PID_FILE);
-
-    /* Try to write the pid file in a best-effort way. */
-    FILE *fp = fopen(server.pidfile,"w");
-    if (fp) {
-        fprintf(fp,"%d\n",(int)getpid());
-        fclose(fp);
-    }
-}
-
-void daemonize(void) {
-    int fd;
-
-    if (fork() != 0) exit(0); /* parent exits */
-    setsid(); /* create a new session */
-
-    /* Every output goes to /dev/null. If Redis is daemonized but
-     * the 'logfile' is set to 'stdout' in the configuration file
-     * it will not log at all. */
-    if ((fd = open("/dev/null", O_RDWR, 0)) != -1) {
-        dup2(fd, STDIN_FILENO);
-        dup2(fd, STDOUT_FILENO);
-        dup2(fd, STDERR_FILENO);
-        if (fd > STDERR_FILENO) close(fd);
-    }
-}
-
-void version(void) {
-    printf("Redis server v=%s sha=%s:%d malloc=%s bits=%d build=%llx\n",
-        REDIS_VERSION,
-        redisGitSHA1(),
-        atoi(redisGitDirty()) > 0,
-        ZMALLOC_LIB,
-        sizeof(long) == 4 ? 32 : 64,
-        (unsigned long long) redisBuildId());
-    exit(0);
-}
-
-void usage(void) {
-    fprintf(stderr,"Usage: ./redis-server [/path/to/redis.conf] [options] [-]\n");
-    fprintf(stderr,"       ./redis-server - (read config from stdin)\n");
-    fprintf(stderr,"       ./redis-server -v or --version\n");
-    fprintf(stderr,"       ./redis-server -h or --help\n");
-    fprintf(stderr,"       ./redis-server --test-memory <megabytes>\n\n");
-    fprintf(stderr,"Examples:\n");
-    fprintf(stderr,"       ./redis-server (run the server with default conf)\n");
-    fprintf(stderr,"       ./redis-server /etc/redis/6379.conf\n");
-    fprintf(stderr,"       ./redis-server --port 7777\n");
-    fprintf(stderr,"       ./redis-server --port 7777 --replicaof 127.0.0.1 8888\n");
-    fprintf(stderr,"       ./redis-server /etc/myredis.conf --loglevel verbose -\n");
-    fprintf(stderr,"       ./redis-server /etc/myredis.conf --loglevel verbose\n\n");
-    fprintf(stderr,"Sentinel mode:\n");
-    fprintf(stderr,"       ./redis-server /etc/sentinel.conf --sentinel\n");
-    exit(1);
-}
-
-void redisAsciiArt(void) {
-#include "asciilogo.h"
-    char *buf = zmalloc(1024*16);
-    char *mode;
-
-    if (server.cluster_enabled) mode = "cluster";
-    else if (server.sentinel_mode) mode = "sentinel";
-    else mode = "standalone";
-
-    /* Show the ASCII logo if: log file is stdout AND stdout is a
-     * tty AND syslog logging is disabled. Also show logo if the user
-     * forced us to do so via redis.conf. */
-    int show_logo = ((!server.syslog_enabled &&
-                      server.logfile[0] == '\0' &&
-                      isatty(fileno(stdout))) ||
-                     server.always_show_logo);
-
-    if (!show_logo) {
-        serverLog(LL_NOTICE,
-            "Running mode=%s, port=%d.",
-            mode, server.port ? server.port : server.tls_port
-        );
-    } else {
-        snprintf(buf,1024*16,ascii_logo,
-            REDIS_VERSION,
-            redisGitSHA1(),
-            strtol(redisGitDirty(),NULL,10) > 0,
-            (sizeof(long) == 8) ? "64" : "32",
-            mode, server.port ? server.port : server.tls_port,
-            (long) getpid()
-        );
-        serverLogRaw(LL_NOTICE|LL_RAW,buf);
-    }
-    zfree(buf);
-}
-
-int changeBindAddr(sds *addrlist, int addrlist_len) {
-    int i;
-    int result = C_OK;
-
-    char *prev_bindaddr[CONFIG_BINDADDR_MAX];
-    int prev_bindaddr_count;
-
-    /* Close old TCP and TLS servers */
-    closeSocketListeners(&server.ipfd);
-    closeSocketListeners(&server.tlsfd);
-
-    /* Keep previous settings */
-    prev_bindaddr_count = server.bindaddr_count;
-    memcpy(prev_bindaddr, server.bindaddr, sizeof(server.bindaddr));
-
-    /* Copy new settings */
-    memset(server.bindaddr, 0, sizeof(server.bindaddr));
-    for (i = 0; i < addrlist_len; i++) {
-        server.bindaddr[i] = zstrdup(addrlist[i]);
-    }
-    server.bindaddr_count = addrlist_len;
-
-    /* Bind to the new port */
-    if ((server.port != 0 && listenToPort(server.port, &server.ipfd) != C_OK) ||
-        (server.tls_port != 0 && listenToPort(server.tls_port, &server.tlsfd) != C_OK)) {
-        serverLog(LL_WARNING, "Failed to bind, trying to restore old listening sockets.");
-
-        /* Restore old bind addresses */
-        for (i = 0; i < addrlist_len; i++) {
-            zfree(server.bindaddr[i]);
-        }
-        memcpy(server.bindaddr, prev_bindaddr, sizeof(server.bindaddr));
-        server.bindaddr_count = prev_bindaddr_count;
-
-        /* Re-Listen TCP and TLS */
-        server.ipfd.count = 0;
-        if (server.port != 0 && listenToPort(server.port, &server.ipfd) != C_OK) {
-            serverPanic("Failed to restore old listening sockets.");
-        }
-
-        server.tlsfd.count = 0;
-        if (server.tls_port != 0 && listenToPort(server.tls_port, &server.tlsfd) != C_OK) {
-            serverPanic("Failed to restore old listening sockets.");
-        }
-
-        result = C_ERR;
-    } else {
-        /* Free old bind addresses */
-        for (i = 0; i < prev_bindaddr_count; i++) {
-            zfree(prev_bindaddr[i]);
-        }
-    }
-
-    /* Create TCP and TLS event handlers */
-    if (createSocketAcceptHandler(&server.ipfd, acceptTcpHandler) != C_OK) {
-        serverPanic("Unrecoverable error creating TCP socket accept handler.");
-    }
-    if (createSocketAcceptHandler(&server.tlsfd, acceptTLSHandler) != C_OK) {
-        serverPanic("Unrecoverable error creating TLS socket accept handler.");
-    }
-
-    if (server.set_proc_title) redisSetProcTitle(NULL);
-
-    return result;
-}
-
-int changeListenPort(int port, socketFds *sfd, aeFileProc *accept_handler) {
-    socketFds new_sfd = {{0}};
-
-    /* Just close the server if port disabled */
-    if (port == 0) {
-        closeSocketListeners(sfd);
-        if (server.set_proc_title) redisSetProcTitle(NULL);
-        return C_OK;
-    }
-
-    /* Bind to the new port */
-    if (listenToPort(port, &new_sfd) != C_OK) {
-        return C_ERR;
-    }
-
-    /* Create event handlers */
-    if (createSocketAcceptHandler(&new_sfd, accept_handler) != C_OK) {
-        closeSocketListeners(&new_sfd);
-        return C_ERR;
-    }
-
-    /* Close old servers */
-    closeSocketListeners(sfd);
-
-    /* Copy new descriptors */
-    sfd->count = new_sfd.count;
-    memcpy(sfd->fd, new_sfd.fd, sizeof(new_sfd.fd));
-
-    if (server.set_proc_title) redisSetProcTitle(NULL);
-
-    return C_OK;
-}
-
-static void sigShutdownHandler(int sig) {
-    char *msg;
-
-    switch (sig) {
-    case SIGINT:
-        msg = "Received SIGINT scheduling shutdown...";
-        break;
-    case SIGTERM:
-        msg = "Received SIGTERM scheduling shutdown...";
-        break;
-    default:
-        msg = "Received shutdown signal, scheduling shutdown...";
-    };
-
-    /* SIGINT is often delivered via Ctrl+C in an interactive session.
-     * If we receive the signal the second time, we interpret this as
-     * the user really wanting to quit ASAP without waiting to persist
-     * on disk. */
-    if (server.shutdown_asap && sig == SIGINT) {
-        serverLogFromHandler(LL_WARNING, "You insist... exiting now.");
-        rdbRemoveTempFile(getpid(), 1);
-        exit(1); /* Exit with an error since this was not a clean shutdown. */
-    } else if (server.loading) {
-        serverLogFromHandler(LL_WARNING, "Received shutdown signal during loading, exiting now.");
-        exit(0);
-    }
-
-    serverLogFromHandler(LL_WARNING, msg);
-    server.shutdown_asap = 1;
-}
-
-void setupSignalHandlers(void) {
-    struct sigaction act;
-
-    /* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction is used.
-     * Otherwise, sa_handler is used. */
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = 0;
-    act.sa_handler = sigShutdownHandler;
-    sigaction(SIGTERM, &act, NULL);
-    sigaction(SIGINT, &act, NULL);
-
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = SA_NODEFER | SA_RESETHAND | SA_SIGINFO;
-    act.sa_sigaction = sigsegvHandler;
-    if(server.crashlog_enabled) {
-        sigaction(SIGSEGV, &act, NULL);
-        sigaction(SIGBUS, &act, NULL);
-        sigaction(SIGFPE, &act, NULL);
-        sigaction(SIGILL, &act, NULL);
-        sigaction(SIGABRT, &act, NULL);
-    }
-    return;
-}
-
-void removeSignalHandlers(void) {
-    struct sigaction act;
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = SA_NODEFER | SA_RESETHAND;
-    act.sa_handler = SIG_DFL;
-    sigaction(SIGSEGV, &act, NULL);
-    sigaction(SIGBUS, &act, NULL);
-    sigaction(SIGFPE, &act, NULL);
-    sigaction(SIGILL, &act, NULL);
-    sigaction(SIGABRT, &act, NULL);
-}
-
-/* This is the signal handler for children process. It is currently useful
- * in order to track the SIGUSR1, that we send to a child in order to terminate
- * it in a clean way, without the parent detecting an error and stop
- * accepting writes because of a write error condition. */
-static void sigKillChildHandler(int sig) {
-    UNUSED(sig);
-    int level = server.in_fork_child == CHILD_TYPE_MODULE? LL_VERBOSE: LL_WARNING;
-    serverLogFromHandler(level, "Received SIGUSR1 in child, exiting now.");
-    exitFromChild(SERVER_CHILD_NOERROR_RETVAL);
-}
-
-void setupChildSignalHandlers(void) {
-    struct sigaction act;
-
-    /* When the SA_SIGINFO flag is set in sa_flags then sa_sigaction is used.
-     * Otherwise, sa_handler is used. */
-    sigemptyset(&act.sa_mask);
-    act.sa_flags = 0;
-    act.sa_handler = sigKillChildHandler;
-    sigaction(SIGUSR1, &act, NULL);
-    return;
-}
-
-/* After fork, the child process will inherit the resources
- * of the parent process, e.g. fd(socket or flock) etc.
- * should close the resources not used by the child process, so that if the
- * parent restarts it can bind/lock despite the child possibly still running. */
-void closeChildUnusedResourceAfterFork() {
-    closeListeningSockets(0);
-    if (server.cluster_enabled && server.cluster_config_file_lock_fd != -1)
-        close(server.cluster_config_file_lock_fd);  /* don't care if this fails */
-
-    /* Clear server.pidfile, this is the parent pidfile which should not
-     * be touched (or deleted) by the child (on exit / crash) */
-    zfree(server.pidfile);
-    server.pidfile = NULL;
-}
-
-/* purpose is one of CHILD_TYPE_ types */
-int redisFork(int purpose) {
-    if (isMutuallyExclusiveChildType(purpose)) {
-        if (hasActiveChildProcess())
-            return -1;
-
-        openChildInfoPipe();
-    }
-
-    int childpid;
-    long long start = ustime();
-    if ((childpid = fork()) == 0) {
-        /* Child */
-        server.in_fork_child = purpose;
-        setOOMScoreAdj(CONFIG_OOM_BGCHILD);
-        setupChildSignalHandlers();
-        closeChildUnusedResourceAfterFork();
-    } else {
-        /* Parent */
-        server.stat_total_forks++;
-        server.stat_fork_time = ustime()-start;
-        server.stat_fork_rate = (double) zmalloc_used_memory() * 1000000 / server.stat_fork_time / (1024*1024*1024); /* GB per second. */
-        latencyAddSampleIfNeeded("fork",server.stat_fork_time/1000);
-        if (childpid == -1) {
-            if (isMutuallyExclusiveChildType(purpose)) closeChildInfoPipe();
-            return -1;
-        }
-
-        /* The child_pid and child_type are only for mutual exclusive children.
-         * other child types should handle and store their pid's in dedicated variables.
-         *
-         * Today, we allows CHILD_TYPE_LDB to run in parallel with the other fork types:
-         * - it isn't used for production, so it will not make the server be less efficient
-         * - used for debugging, and we don't want to block it from running while other
-         *   forks are running (like RDB and AOF) */
-        if (isMutuallyExclusiveChildType(purpose)) {
-            server.child_pid = childpid;
-            server.child_type = purpose;
-            server.stat_current_cow_bytes = 0;
-            server.stat_current_cow_updated = 0;
-            server.stat_current_save_keys_processed = 0;
-            server.stat_module_progress = 0;
-            server.stat_current_save_keys_total = dbTotalServerKeyCount();
-        }
-
-        updateDictResizePolicy();
-        moduleFireServerEvent(REDISMODULE_EVENT_FORK_CHILD,
-                              REDISMODULE_SUBEVENT_FORK_CHILD_BORN,
-                              NULL);
-    }
-    return childpid;
-}
-
-void sendChildCowInfo(childInfoType info_type, char *pname) {
-    sendChildInfoGeneric(info_type, 0, -1, pname);
-}
-
-void sendChildInfo(childInfoType info_type, size_t keys, char *pname) {
-    sendChildInfoGeneric(info_type, keys, -1, pname);
-}
-
-void memtest(size_t megabytes, int passes);
-
-/* Returns 1 if there is --sentinel among the arguments or if
- * argv[0] contains "redis-sentinel". */
-int checkForSentinelMode(int argc, char **argv) {
-    int j;
-
-    if (strstr(argv[0],"redis-sentinel") != NULL) return 1;
-    for (j = 1; j < argc; j++)
-        if (!strcmp(argv[j],"--sentinel")) return 1;
-    return 0;
-}
-
-/* Function called at startup to load RDB or AOF file in memory. */
-void loadDataFromDisk(void) {
-    long long start = ustime();
-    if (server.aof_state == AOF_ON) {
-        if (loadAppendOnlyFile(server.aof_filename) == C_OK)
-            serverLog(LL_NOTICE,"DB loaded from append only file: %.3f seconds",(float)(ustime()-start)/1000000);
-    } else {
-        rdbSaveInfo rsi = RDB_SAVE_INFO_INIT;
-        errno = 0; /* Prevent a stale value from affecting error checking */
-        if (rdbLoad(server.rdb_filename,&rsi,RDBFLAGS_NONE) == C_OK) {
-            serverLog(LL_NOTICE,"DB loaded from disk: %.3f seconds",
-                (float)(ustime()-start)/1000000);
-
-            /* Restore the replication ID / offset from the RDB file. */
-            if ((server.masterhost ||
-                (server.cluster_enabled &&
-                nodeIsSlave(server.cluster->myself))) &&
-                rsi.repl_id_is_set &&
-                rsi.repl_offset != -1 &&
-                /* Note that older implementations may save a repl_stream_db
-                 * of -1 inside the RDB file in a wrong way, see more
-                 * information in function rdbPopulateSaveInfo. */
-                rsi.repl_stream_db != -1)
-            {
-                memcpy(server.replid,rsi.repl_id,sizeof(server.replid));
-                server.master_repl_offset = rsi.repl_offset;
-                /* If we are a slave, create a cached master from this
-                 * information, in order to allow partial resynchronizations
-                 * with masters. */
-                replicationCacheMasterUsingMyself();
-                selectDb(server.cached_master,rsi.repl_stream_db);
-            }
-        } else if (errno != ENOENT) {
-            serverLog(LL_WARNING,"Fatal error loading the DB: %s. Exiting.",strerror(errno));
-            exit(1);
-        }
-    }
-}
-
-void redisOutOfMemoryHandler(size_t allocation_size) {
-    serverLog(LL_WARNING,"Out Of Memory allocating %zu bytes!",
-        allocation_size);
-    serverPanic("Redis aborting for OUT OF MEMORY. Allocating %zu bytes!",
-        allocation_size);
-}
-
-/* Callback for sdstemplate on proc-title-template. See redis.conf for
- * supported variables.
- */
-static sds redisProcTitleGetVariable(const sds varname, void *arg)
-{
-    if (!strcmp(varname, "title")) {
-        return sdsnew(arg);
-    } else if (!strcmp(varname, "listen-addr")) {
-        if (server.port || server.tls_port)
-            return sdscatprintf(sdsempty(), "%s:%u",
-                                server.bindaddr_count ? server.bindaddr[0] : "*",
-                                server.port ? server.port : server.tls_port);
-        else
-            return sdscatprintf(sdsempty(), "unixsocket:%s", server.unixsocket);
-    } else if (!strcmp(varname, "server-mode")) {
-        if (server.cluster_enabled) return sdsnew("[cluster]");
-        else if (server.sentinel_mode) return sdsnew("[sentinel]");
-        else return sdsempty();
-    } else if (!strcmp(varname, "config-file")) {
-        return sdsnew(server.configfile ? server.configfile : "-");
-    } else if (!strcmp(varname, "port")) {
-        return sdscatprintf(sdsempty(), "%u", server.port);
-    } else if (!strcmp(varname, "tls-port")) {
-        return sdscatprintf(sdsempty(), "%u", server.tls_port);
-    } else if (!strcmp(varname, "unixsocket")) {
-        return sdsnew(server.unixsocket);
-    } else
-        return NULL;    /* Unknown variable name */
-}
-
-/* Expand the specified proc-title-template string and return a newly
- * allocated sds, or NULL. */
-static sds expandProcTitleTemplate(const char *template, const char *title) {
-    sds res = sdstemplate(template, redisProcTitleGetVariable, (void *) title);
-    if (!res)
-        return NULL;
-    return sdstrim(res, " ");
-}
-/* Validate the specified template, returns 1 if valid or 0 otherwise. */
-int validateProcTitleTemplate(const char *template) {
-    int ok = 1;
-    sds res = expandProcTitleTemplate(template, "");
-    if (!res)
-        return 0;
-    if (sdslen(res) == 0) ok = 0;
-    sdsfree(res);
-    return ok;
-}
-
-int redisSetProcTitle(char *title) {
-#ifdef USE_SETPROCTITLE
-    if (!title) title = server.exec_argv[0];
-    sds proc_title = expandProcTitleTemplate(server.proc_title_template, title);
-    if (!proc_title) return C_ERR;  /* Not likely, proc_title_template is validated */
-
-    setproctitle("%s", proc_title);
-    sdsfree(proc_title);
-#else
-    UNUSED(title);
-#endif
-
-    return C_OK;
-}
-
-void redisSetCpuAffinity(const char *cpulist) {
-#ifdef USE_SETCPUAFFINITY
-    setcpuaffinity(cpulist);
-#else
-    UNUSED(cpulist);
-#endif
-}
-
-/* Send a notify message to systemd. Returns sd_notify return code which is
- * a positive number on success. */
-int redisCommunicateSystemd(const char *sd_notify_msg) {
-#ifdef HAVE_LIBSYSTEMD
-    int ret = sd_notify(0, sd_notify_msg);
-
-    if (ret == 0)
-        serverLog(LL_WARNING, "systemd supervision error: NOTIFY_SOCKET not found!");
-    else if (ret < 0)
-        serverLog(LL_WARNING, "systemd supervision error: sd_notify: %d", ret);
-    return ret;
-#else
-    UNUSED(sd_notify_msg);
-    return 0;
-#endif
-}
-
-/* Attempt to set up upstart supervision. Returns 1 if successful. */
-static int redisSupervisedUpstart(void) {
-    const char *upstart_job = getenv("UPSTART_JOB");
-
-    if (!upstart_job) {
-        serverLog(LL_WARNING,
-                "upstart supervision requested, but UPSTART_JOB not found!");
-        return 0;
-    }
-
-    serverLog(LL_NOTICE, "supervised by upstart, will stop to signal readiness.");
-    raise(SIGSTOP);
-    unsetenv("UPSTART_JOB");
-    return 1;
-}
-
-/* Attempt to set up systemd supervision. Returns 1 if successful. */
-static int redisSupervisedSystemd(void) {
-#ifndef HAVE_LIBSYSTEMD
-    serverLog(LL_WARNING,
-            "systemd supervision requested or auto-detected, but Redis is compiled without libsystemd support!");
-    return 0;
-#else
-    if (redisCommunicateSystemd("STATUS=Redis is loading...\n") <= 0)
-        return 0;
-    serverLog(LL_NOTICE,
-        "Supervised by systemd. Please make sure you set appropriate values for TimeoutStartSec and TimeoutStopSec in your service unit.");
-    return 1;
-#endif
-}
-
-int redisIsSupervised(int mode) {
-    int ret = 0;
-
-    if (mode == SUPERVISED_AUTODETECT) {
-        if (getenv("UPSTART_JOB")) {
-            serverLog(LL_VERBOSE, "Upstart supervision detected.");
-            mode = SUPERVISED_UPSTART;
-        } else if (getenv("NOTIFY_SOCKET")) {
-            serverLog(LL_VERBOSE, "Systemd supervision detected.");
-            mode = SUPERVISED_SYSTEMD;
-        }
-    }
-
-    switch (mode) {
-        case SUPERVISED_UPSTART:
-            ret = redisSupervisedUpstart();
-            break;
-        case SUPERVISED_SYSTEMD:
-            ret = redisSupervisedSystemd();
-            break;
-        default:
-            break;
-    }
-
-    if (ret)
-        server.supervised_mode = mode;
-
-    return ret;
-}
-
-int iAmMaster(void) {
-    return ((!server.cluster_enabled && server.masterhost == NULL) ||
-            (server.cluster_enabled && nodeIsMaster(server.cluster->myself)));
-}
-
-#ifdef REDIS_TEST
-typedef int redisTestProc(int argc, char **argv, int accurate);
-struct redisTest {
-    char *name;
-    redisTestProc *proc;
-    int failed;
-} redisTests[] = {
-    {"ziplist", ziplistTest},
-    {"quicklist", quicklistTest},
-    {"intset", intsetTest},
-    {"zipmap", zipmapTest},
-    {"sha1test", sha1Test},
-    {"util", utilTest},
-    {"endianconv", endianconvTest},
-    {"crc64", crc64Test},
-    {"zmalloc", zmalloc_test},
-    {"sds", sdsTest},
-    {"dict", dictTest}
-};
-redisTestProc *getTestProcByName(const char *name) {
-    int numtests = sizeof(redisTests)/sizeof(struct redisTest);
-    for (int j = 0; j < numtests; j++) {
-        if (!strcasecmp(name,redisTests[j].name)) {
-            return redisTests[j].proc;
-        }
-    }
-    return NULL;
-}
-#endif
-
-int main(int argc, char **argv) {
-    struct timeval tv;
-    int j;
-    char config_from_stdin = 0;
-
-#ifdef REDIS_TEST
-    if (argc >= 3 && !strcasecmp(argv[1], "test")) {
-        int accurate = 0;
-        for (j = 3; j < argc; j++) {
-            if (!strcasecmp(argv[j], "--accurate")) {
-                accurate = 1;
-            }
-        }
-
-        if (!strcasecmp(argv[2], "all")) {
-            int numtests = sizeof(redisTests)/sizeof(struct redisTest);
-            for (j = 0; j < numtests; j++) {
-                redisTests[j].failed = (redisTests[j].proc(argc,argv,accurate) != 0);
-            }
-
-            /* Report tests result */
-            int failed_num = 0;
-            for (j = 0; j < numtests; j++) {
-                if (redisTests[j].failed) {
-                    failed_num++;
-                    printf("[failed] Test - %s\n", redisTests[j].name);
-                } else {
-                    printf("[ok] Test - %s\n", redisTests[j].name);
-                }
-            }
-
-            printf("%d tests, %d passed, %d failed\n", numtests,
-                   numtests-failed_num, failed_num);
-
-            return failed_num == 0 ? 0 : 1;
-        } else {
-            redisTestProc *proc = getTestProcByName(argv[2]);
-            if (!proc) return -1; /* test not found */
-            return proc(argc,argv,accurate);
-        }
-
-        return 0;
-    }
-#endif
-
-    /* We need to initialize our libraries, and the server configuration. */
-#ifdef INIT_SETPROCTITLE_REPLACEMENT
-    spt_init(argc, argv);
-#endif
-    setlocale(LC_COLLATE,"");
-    tzset(); /* Populates 'timezone' global. */
-    zmalloc_set_oom_handler(redisOutOfMemoryHandler);
-    srand(time(NULL)^getpid());
-    srandom(time(NULL)^getpid());
-    gettimeofday(&tv,NULL);
-    init_genrand64(((long long) tv.tv_sec * 1000000 + tv.tv_usec) ^ getpid());
-    crc64_init();
-
-    /* Store umask value. Because umask(2) only offers a set-and-get API we have
-     * to reset it and restore it back. We do this early to avoid a potential
-     * race condition with threads that could be creating files or directories.
-     */
-    umask(server.umask = umask(0777));
-
-    uint8_t hashseed[16];
-    getRandomBytes(hashseed,sizeof(hashseed));
-    dictSetHashFunctionSeed(hashseed);
-    server.sentinel_mode = checkForSentinelMode(argc,argv);
-    initServerConfig();
-    ACLInit(); /* The ACL subsystem must be initialized ASAP because the
-                  basic networking code and client creation depends on it. */
-    moduleInitModulesSystem();
-    tlsInit();
-
-    /* Store the executable path and arguments in a safe place in order
-     * to be able to restart the server later. */
-    server.executable = getAbsolutePath(argv[0]);
-    server.exec_argv = zmalloc(sizeof(char*)*(argc+1));
-    server.exec_argv[argc] = NULL;
-    for (j = 0; j < argc; j++) server.exec_argv[j] = zstrdup(argv[j]);
-
-    /* We need to init sentinel right now as parsing the configuration file
-     * in sentinel mode will have the effect of populating the sentinel
-     * data structures with master nodes to monitor. */
-    if (server.sentinel_mode) {
-        initSentinelConfig();
-        initSentinel();
-    }
-
-    /* Check if we need to start in redis-check-rdb/aof mode. We just execute
-     * the program main. However the program is part of the Redis executable
-     * so that we can easily execute an RDB check on loading errors. */
-    if (strstr(argv[0],"redis-check-rdb") != NULL)
-        redis_check_rdb_main(argc,argv,NULL);
-    else if (strstr(argv[0],"redis-check-aof") != NULL)
-        redis_check_aof_main(argc,argv);
-
-    if (argc >= 2) {
-        j = 1; /* First option to parse in argv[] */
-        sds options = sdsempty();
-
-        /* Handle special options --help and --version */
-        if (strcmp(argv[1], "-v") == 0 ||
-            strcmp(argv[1], "--version") == 0) version();
-        if (strcmp(argv[1], "--help") == 0 ||
-            strcmp(argv[1], "-h") == 0) usage();
-        if (strcmp(argv[1], "--test-memory") == 0) {
-            if (argc == 3) {
-                memtest(atoi(argv[2]),50);
-                exit(0);
-            } else {
-                fprintf(stderr,"Please specify the amount of memory to test in megabytes.\n");
-                fprintf(stderr,"Example: ./redis-server --test-memory 4096\n\n");
-                exit(1);
-            }
-        }
-        /* Parse command line options
-         * Precedence wise, File, stdin, explicit options -- last config is the one that matters.
-         *
-         * First argument is the config file name? */
-        if (argv[1][0] != '-') {
-            /* Replace the config file in server.exec_argv with its absolute path. */
-            server.configfile = getAbsolutePath(argv[1]);
-            zfree(server.exec_argv[1]);
-            server.exec_argv[1] = zstrdup(server.configfile);
-            j = 2; // Skip this arg when parsing options
-        }
-        while(j < argc) {
-            /* Either first or last argument - Should we read config from stdin? */
-            if (argv[j][0] == '-' && argv[j][1] == '\0' && (j == 1 || j == argc-1)) {
-                config_from_stdin = 1;
-            }
-            /* All the other options are parsed and conceptually appended to the
-             * configuration file. For instance --port 6380 will generate the
-             * string "port 6380\n" to be parsed after the actual config file
-             * and stdin input are parsed (if they exist). */
-            else if (argv[j][0] == '-' && argv[j][1] == '-') {
-                /* Option name */
-                if (sdslen(options)) options = sdscat(options,"\n");
-                options = sdscat(options,argv[j]+2);
-                options = sdscat(options," ");
-            } else {
-                /* Option argument */
-                options = sdscatrepr(options,argv[j],strlen(argv[j]));
-                options = sdscat(options," ");
-            }
-            j++;
-        }
-
-        loadServerConfig(server.configfile, config_from_stdin, options);
-        if (server.sentinel_mode) loadSentinelConfigFromQueue();
-        sdsfree(options);
-    }
-    if (server.sentinel_mode) sentinelCheckConfigFile();
-    server.supervised = redisIsSupervised(server.supervised_mode);
-    int background = server.daemonize && !server.supervised;
-    if (background) daemonize();
-
-    serverLog(LL_WARNING, "oO0OoO0OoO0Oo Redis is starting oO0OoO0OoO0Oo");
-    serverLog(LL_WARNING,
-        "Redis version=%s, bits=%d, commit=%s, modified=%d, pid=%d, just started",
-            REDIS_VERSION,
-            (sizeof(long) == 8) ? 64 : 32,
-            redisGitSHA1(),
-            strtol(redisGitDirty(),NULL,10) > 0,
-            (int)getpid());
-
-    if (argc == 1) {
-        serverLog(LL_WARNING, "Warning: no config file specified, using the default config. In order to specify a config file use %s /path/to/redis.conf", argv[0]);
-    } else {
-        serverLog(LL_WARNING, "Configuration loaded");
-    }
-
-    readOOMScoreAdj();
-    initServer();
-    if (background || server.pidfile) createPidFile();
-    if (server.set_proc_title) redisSetProcTitle(NULL);
-    redisAsciiArt();
-    checkTcpBacklogSettings();
-
-    if (!server.sentinel_mode) {
-        /* Things not needed when running in Sentinel mode. */
-        serverLog(LL_WARNING,"Server initialized");
-    #ifdef __linux__
-        linuxMemoryWarnings();
-    #if defined (__arm64__)
-        int ret;
-        if ((ret = linuxMadvFreeForkBugCheck())) {
-            if (ret == 1)
-                serverLog(LL_WARNING,"WARNING Your kernel has a bug that could lead to data corruption during background save. "
-                                     "Please upgrade to the latest stable kernel.");
-            else
-                serverLog(LL_WARNING, "Failed to test the kernel for a bug that could lead to data corruption during background save. "
-                                      "Your system could be affected, please report this error.");
-            if (!checkIgnoreWarning("ARM64-COW-BUG")) {
-                serverLog(LL_WARNING,"Redis will now exit to prevent data corruption. "
-                                     "Note that it is possible to suppress this warning by setting the following config: ignore-warnings ARM64-COW-BUG");
-                exit(1);
-            }
-        }
-    #endif /* __arm64__ */
-    #endif /* __linux__ */
-        moduleInitModulesSystemLast();
-        moduleLoadFromQueue();
-        ACLLoadUsersAtStartup();
-        InitServerLast();
-        loadDataFromDisk();
-        if (server.cluster_enabled) {
-            if (verifyClusterConfigWithData() == C_ERR) {
-                serverLog(LL_WARNING,
-                    "You can't have keys in a DB different than DB 0 when in "
-                    "Cluster mode. Exiting.");
-                exit(1);
-            }
-        }
-        if (server.ipfd.count > 0 || server.tlsfd.count > 0)
-            serverLog(LL_NOTICE,"Ready to accept connections");
-        if (server.sofd > 0)
-            serverLog(LL_NOTICE,"The server is now ready to accept connections at %s", server.unixsocket);
-        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
-            if (!server.masterhost) {
-                redisCommunicateSystemd("STATUS=Ready to accept connections\n");
-            } else {
-                redisCommunicateSystemd("STATUS=Ready to accept connections in read-only mode. Waiting for MASTER <-> REPLICA sync\n");
-            }
-            redisCommunicateSystemd("READY=1\n");
-        }
-    } else {
-        ACLLoadUsersAtStartup();
-        InitServerLast();
-        sentinelIsRunning();
-        if (server.supervised_mode == SUPERVISED_SYSTEMD) {
-            redisCommunicateSystemd("STATUS=Ready to accept connections\n");
-            redisCommunicateSystemd("READY=1\n");
-        }
-    }
-
-    /* Warning the user about suspicious maxmemory setting. */
-    if (server.maxmemory > 0 && server.maxmemory < 1024*1024) {
-        serverLog(LL_WARNING,"WARNING: You specified a maxmemory value that is less than 1MB (current value is %llu bytes). Are you sure this is what you really want?", server.maxmemory);
-    }
-
-    redisSetCpuAffinity(server.server_cpulist);
-    setOOMScoreAdj(-1);
-
-    aeMain(server.el);
-    aeDeleteEventLoop(server.el);
-    return 0;
-}
-
-/* The End */
diff --git a/redis-stable/src/server.h b/redis-stable/src/server.h
deleted file mode 100644
index 4edb7d3a..00000000
--- a/redis-stable/src/server.h
+++ /dev/null
@@ -1,2759 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __REDIS_H
-#define __REDIS_H
-
-#include "fmacros.h"
-#include "config.h"
-#include "solarisfixes.h"
-#include "rio.h"
-#include "atomicvar.h"
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <time.h>
-#include <limits.h>
-#include <unistd.h>
-#include <errno.h>
-#include <inttypes.h>
-#include <pthread.h>
-#include <syslog.h>
-#include <netinet/in.h>
-#include <sys/socket.h>
-#include <lua.h>
-#include <signal.h>
-
-#ifdef HAVE_LIBSYSTEMD
-#include <systemd/sd-daemon.h>
-#endif
-
-typedef long long mstime_t; /* millisecond time type. */
-typedef long long ustime_t; /* microsecond time type. */
-
-#include "ae.h"      /* Event driven programming library */
-#include "sds.h"     /* Dynamic safe strings */
-#include "dict.h"    /* Hash tables */
-#include "adlist.h"  /* Linked lists */
-#include "zmalloc.h" /* total memory usage aware version of malloc/free */
-#include "anet.h"    /* Networking the easy way */
-#include "ziplist.h" /* Compact list data structure */
-#include "intset.h"  /* Compact integer set structure */
-#include "version.h" /* Version macro */
-#include "util.h"    /* Misc functions useful in many places */
-#include "latency.h" /* Latency monitor API */
-#include "sparkline.h" /* ASCII graphs API */
-#include "quicklist.h"  /* Lists are encoded as linked lists of
-                           N-elements flat arrays */
-#include "rax.h"     /* Radix tree */
-#include "connection.h" /* Connection abstraction */
-
-#define REDISMODULE_CORE 1
-#include "redismodule.h"    /* Redis modules API defines. */
-
-/* Following includes allow test functions to be called from Redis main() */
-#include "zipmap.h"
-#include "sha1.h"
-#include "endianconv.h"
-#include "crc64.h"
-
-/* Error codes */
-#define C_OK                    0
-#define C_ERR                   -1
-
-/* Static server configuration */
-#define CONFIG_DEFAULT_HZ        10             /* Time interrupt calls/sec. */
-#define CONFIG_MIN_HZ            1
-#define CONFIG_MAX_HZ            500
-#define MAX_CLIENTS_PER_CLOCK_TICK 200          /* HZ is adapted based on that. */
-#define CONFIG_MAX_LINE    1024
-#define CRON_DBS_PER_CALL 16
-#define NET_MAX_WRITES_PER_EVENT (1024*64)
-#define PROTO_SHARED_SELECT_CMDS 10
-#define OBJ_SHARED_INTEGERS 10000
-#define OBJ_SHARED_BULKHDR_LEN 32
-#define LOG_MAX_LEN    1024 /* Default maximum length of syslog messages.*/
-#define AOF_REWRITE_ITEMS_PER_CMD 64
-#define AOF_READ_DIFF_INTERVAL_BYTES (1024*10)
-#define CONFIG_AUTHPASS_MAX_LEN 512
-#define CONFIG_RUN_ID_SIZE 40
-#define RDB_EOF_MARK_SIZE 40
-#define CONFIG_REPL_BACKLOG_MIN_SIZE (1024*16)          /* 16k */
-#define CONFIG_BGSAVE_RETRY_DELAY 5 /* Wait a few secs before trying again. */
-#define CONFIG_DEFAULT_PID_FILE "/var/run/redis.pid"
-#define CONFIG_DEFAULT_CLUSTER_CONFIG_FILE "nodes.conf"
-#define CONFIG_DEFAULT_UNIX_SOCKET_PERM 0
-#define CONFIG_DEFAULT_LOGFILE ""
-#define NET_HOST_STR_LEN 256 /* Longest valid hostname */
-#define NET_IP_STR_LEN 46 /* INET6_ADDRSTRLEN is 46, but we need to be sure */
-#define NET_ADDR_STR_LEN (NET_IP_STR_LEN+32) /* Must be enough for ip:port */
-#define NET_HOST_PORT_STR_LEN (NET_HOST_STR_LEN+32) /* Must be enough for hostname:port */
-#define CONFIG_BINDADDR_MAX 16
-#define CONFIG_MIN_RESERVED_FDS 32
-#define CONFIG_DEFAULT_PROC_TITLE_TEMPLATE "{title} {listen-addr} {server-mode}"
-
-#define ACTIVE_EXPIRE_CYCLE_SLOW 0
-#define ACTIVE_EXPIRE_CYCLE_FAST 1
-
-/* Children process will exit with this status code to signal that the
- * process terminated without an error: this is useful in order to kill
- * a saving child (RDB or AOF one), without triggering in the parent the
- * write protection that is normally turned on on write errors.
- * Usually children that are terminated with SIGUSR1 will exit with this
- * special code. */
-#define SERVER_CHILD_NOERROR_RETVAL    255
-
-/* Reading copy-on-write info is sometimes expensive and may slow down child
- * processes that report it continuously. We measure the cost of obtaining it
- * and hold back additional reading based on this factor. */
-#define CHILD_COW_DUTY_CYCLE           100
-
-/* Instantaneous metrics tracking. */
-#define STATS_METRIC_SAMPLES 16     /* Number of samples per metric. */
-#define STATS_METRIC_COMMAND 0      /* Number of commands executed. */
-#define STATS_METRIC_NET_INPUT 1    /* Bytes read to network .*/
-#define STATS_METRIC_NET_OUTPUT 2   /* Bytes written to network. */
-#define STATS_METRIC_COUNT 3
-
-/* Protocol and I/O related defines */
-#define PROTO_IOBUF_LEN         (1024*16)  /* Generic I/O buffer size */
-#define PROTO_REPLY_CHUNK_BYTES (16*1024) /* 16k output buffer */
-#define PROTO_INLINE_MAX_SIZE   (1024*64) /* Max size of inline reads */
-#define PROTO_MBULK_BIG_ARG     (1024*32)
-#define LONG_STR_SIZE      21          /* Bytes needed for long -> str + '\0' */
-#define REDIS_AUTOSYNC_BYTES (1024*1024*32) /* fdatasync every 32MB */
-
-#define LIMIT_PENDING_QUERYBUF (4*1024*1024) /* 4mb */
-
-/* When configuring the server eventloop, we setup it so that the total number
- * of file descriptors we can handle are server.maxclients + RESERVED_FDS +
- * a few more to stay safe. Since RESERVED_FDS defaults to 32, we add 96
- * in order to make sure of not over provisioning more than 128 fds. */
-#define CONFIG_FDSET_INCR (CONFIG_MIN_RESERVED_FDS+96)
-
-/* OOM Score Adjustment classes. */
-#define CONFIG_OOM_MASTER 0
-#define CONFIG_OOM_REPLICA 1
-#define CONFIG_OOM_BGCHILD 2
-#define CONFIG_OOM_COUNT 3
-
-extern int configOOMScoreAdjValuesDefaults[CONFIG_OOM_COUNT];
-
-/* Hash table parameters */
-#define HASHTABLE_MIN_FILL        10      /* Minimal hash table fill 10% */
-#define HASHTABLE_MAX_LOAD_FACTOR 1.618   /* Maximum hash table load factor. */
-
-/* Command flags. Please check the command table defined in the server.c file
- * for more information about the meaning of every flag. */
-#define CMD_WRITE (1ULL<<0)            /* "write" flag */
-#define CMD_READONLY (1ULL<<1)         /* "read-only" flag */
-#define CMD_DENYOOM (1ULL<<2)          /* "use-memory" flag */
-#define CMD_MODULE (1ULL<<3)           /* Command exported by module. */
-#define CMD_ADMIN (1ULL<<4)            /* "admin" flag */
-#define CMD_PUBSUB (1ULL<<5)           /* "pub-sub" flag */
-#define CMD_NOSCRIPT (1ULL<<6)         /* "no-script" flag */
-#define CMD_RANDOM (1ULL<<7)           /* "random" flag */
-#define CMD_SORT_FOR_SCRIPT (1ULL<<8)  /* "to-sort" flag */
-#define CMD_LOADING (1ULL<<9)          /* "ok-loading" flag */
-#define CMD_STALE (1ULL<<10)           /* "ok-stale" flag */
-#define CMD_SKIP_MONITOR (1ULL<<11)    /* "no-monitor" flag */
-#define CMD_SKIP_SLOWLOG (1ULL<<12)    /* "no-slowlog" flag */
-#define CMD_ASKING (1ULL<<13)          /* "cluster-asking" flag */
-#define CMD_FAST (1ULL<<14)            /* "fast" flag */
-#define CMD_NO_AUTH (1ULL<<15)         /* "no-auth" flag */
-#define CMD_MAY_REPLICATE (1ULL<<16)   /* "may-replicate" flag */
-
-/* Command flags used by the module system. */
-#define CMD_MODULE_GETKEYS (1ULL<<17)  /* Use the modules getkeys interface. */
-#define CMD_MODULE_NO_CLUSTER (1ULL<<18) /* Deny on Redis Cluster. */
-
-/* Command flags that describe ACLs categories. */
-#define CMD_CATEGORY_KEYSPACE (1ULL<<19)
-#define CMD_CATEGORY_READ (1ULL<<20)
-#define CMD_CATEGORY_WRITE (1ULL<<21)
-#define CMD_CATEGORY_SET (1ULL<<22)
-#define CMD_CATEGORY_SORTEDSET (1ULL<<23)
-#define CMD_CATEGORY_LIST (1ULL<<24)
-#define CMD_CATEGORY_HASH (1ULL<<25)
-#define CMD_CATEGORY_STRING (1ULL<<26)
-#define CMD_CATEGORY_BITMAP (1ULL<<27)
-#define CMD_CATEGORY_HYPERLOGLOG (1ULL<<28)
-#define CMD_CATEGORY_GEO (1ULL<<29)
-#define CMD_CATEGORY_STREAM (1ULL<<30)
-#define CMD_CATEGORY_PUBSUB (1ULL<<31)
-#define CMD_CATEGORY_ADMIN (1ULL<<32)
-#define CMD_CATEGORY_FAST (1ULL<<33)
-#define CMD_CATEGORY_SLOW (1ULL<<34)
-#define CMD_CATEGORY_BLOCKING (1ULL<<35)
-#define CMD_CATEGORY_DANGEROUS (1ULL<<36)
-#define CMD_CATEGORY_CONNECTION (1ULL<<37)
-#define CMD_CATEGORY_TRANSACTION (1ULL<<38)
-#define CMD_CATEGORY_SCRIPTING (1ULL<<39)
-
-/* AOF states */
-#define AOF_OFF 0             /* AOF is off */
-#define AOF_ON 1              /* AOF is on */
-#define AOF_WAIT_REWRITE 2    /* AOF waits rewrite to start appending */
-
-/* Client flags */
-#define CLIENT_SLAVE (1<<0)   /* This client is a replica */
-#define CLIENT_MASTER (1<<1)  /* This client is a master */
-#define CLIENT_MONITOR (1<<2) /* This client is a slave monitor, see MONITOR */
-#define CLIENT_MULTI (1<<3)   /* This client is in a MULTI context */
-#define CLIENT_BLOCKED (1<<4) /* The client is waiting in a blocking operation */
-#define CLIENT_DIRTY_CAS (1<<5) /* Watched keys modified. EXEC will fail. */
-#define CLIENT_CLOSE_AFTER_REPLY (1<<6) /* Close after writing entire reply. */
-#define CLIENT_UNBLOCKED (1<<7) /* This client was unblocked and is stored in
-                                  server.unblocked_clients */
-#define CLIENT_LUA (1<<8) /* This is a non connected client used by Lua */
-#define CLIENT_ASKING (1<<9)     /* Client issued the ASKING command */
-#define CLIENT_CLOSE_ASAP (1<<10)/* Close this client ASAP */
-#define CLIENT_UNIX_SOCKET (1<<11) /* Client connected via Unix domain socket */
-#define CLIENT_DIRTY_EXEC (1<<12)  /* EXEC will fail for errors while queueing */
-#define CLIENT_MASTER_FORCE_REPLY (1<<13)  /* Queue replies even if is master */
-#define CLIENT_FORCE_AOF (1<<14)   /* Force AOF propagation of current cmd. */
-#define CLIENT_FORCE_REPL (1<<15)  /* Force replication of current cmd. */
-#define CLIENT_PRE_PSYNC (1<<16)   /* Instance don't understand PSYNC. */
-#define CLIENT_READONLY (1<<17)    /* Cluster client is in read-only state. */
-#define CLIENT_PUBSUB (1<<18)      /* Client is in Pub/Sub mode. */
-#define CLIENT_PREVENT_AOF_PROP (1<<19)  /* Don't propagate to AOF. */
-#define CLIENT_PREVENT_REPL_PROP (1<<20)  /* Don't propagate to slaves. */
-#define CLIENT_PREVENT_PROP (CLIENT_PREVENT_AOF_PROP|CLIENT_PREVENT_REPL_PROP)
-#define CLIENT_PENDING_WRITE (1<<21) /* Client has output to send but a write
-                                        handler is yet not installed. */
-#define CLIENT_REPLY_OFF (1<<22)   /* Don't send replies to client. */
-#define CLIENT_REPLY_SKIP_NEXT (1<<23)  /* Set CLIENT_REPLY_SKIP for next cmd */
-#define CLIENT_REPLY_SKIP (1<<24)  /* Don't send just this reply. */
-#define CLIENT_LUA_DEBUG (1<<25)  /* Run EVAL in debug mode. */
-#define CLIENT_LUA_DEBUG_SYNC (1<<26)  /* EVAL debugging without fork() */
-#define CLIENT_MODULE (1<<27) /* Non connected client used by some module. */
-#define CLIENT_PROTECTED (1<<28) /* Client should not be freed for now. */
-#define CLIENT_PENDING_READ (1<<29) /* The client has pending reads and was put
-                                       in the list of clients we can read
-                                       from. */
-#define CLIENT_PENDING_COMMAND (1<<30) /* Indicates the client has a fully
-                                        * parsed command ready for execution. */
-#define CLIENT_TRACKING (1ULL<<31) /* Client enabled keys tracking in order to
-                                   perform client side caching. */
-#define CLIENT_TRACKING_BROKEN_REDIR (1ULL<<32) /* Target client is invalid. */
-#define CLIENT_TRACKING_BCAST (1ULL<<33) /* Tracking in BCAST mode. */
-#define CLIENT_TRACKING_OPTIN (1ULL<<34)  /* Tracking in opt-in mode. */
-#define CLIENT_TRACKING_OPTOUT (1ULL<<35) /* Tracking in opt-out mode. */
-#define CLIENT_TRACKING_CACHING (1ULL<<36) /* CACHING yes/no was given,
-                                              depending on optin/optout mode. */
-#define CLIENT_TRACKING_NOLOOP (1ULL<<37) /* Don't send invalidation messages
-                                             about writes performed by myself.*/
-#define CLIENT_IN_TO_TABLE (1ULL<<38) /* This client is in the timeout table. */
-#define CLIENT_PROTOCOL_ERROR (1ULL<<39) /* Protocol error chatting with it. */
-#define CLIENT_CLOSE_AFTER_COMMAND (1ULL<<40) /* Close after executing commands
-                                               * and writing entire reply. */
-#define CLIENT_DENY_BLOCKING (1ULL<<41) /* Indicate that the client should not be blocked.
-                                           currently, turned on inside MULTI, Lua, RM_Call,
-                                           and AOF client */
-#define CLIENT_REPL_RDBONLY (1ULL<<42) /* This client is a replica that only wants
-                                          RDB without replication buffer. */
-
-/* Client block type (btype field in client structure)
- * if CLIENT_BLOCKED flag is set. */
-#define BLOCKED_NONE 0    /* Not blocked, no CLIENT_BLOCKED flag set. */
-#define BLOCKED_LIST 1    /* BLPOP & co. */
-#define BLOCKED_WAIT 2    /* WAIT for synchronous replication. */
-#define BLOCKED_MODULE 3  /* Blocked by a loadable module. */
-#define BLOCKED_STREAM 4  /* XREAD. */
-#define BLOCKED_ZSET 5    /* BZPOP et al. */
-#define BLOCKED_PAUSE 6   /* Blocked by CLIENT PAUSE */
-#define BLOCKED_NUM 7     /* Number of blocked states. */
-
-/* Client request types */
-#define PROTO_REQ_INLINE 1
-#define PROTO_REQ_MULTIBULK 2
-
-/* Client classes for client limits, currently used only for
- * the max-client-output-buffer limit implementation. */
-#define CLIENT_TYPE_NORMAL 0 /* Normal req-reply clients + MONITORs */
-#define CLIENT_TYPE_SLAVE 1  /* Slaves. */
-#define CLIENT_TYPE_PUBSUB 2 /* Clients subscribed to PubSub channels. */
-#define CLIENT_TYPE_MASTER 3 /* Master. */
-#define CLIENT_TYPE_COUNT 4  /* Total number of client types. */
-#define CLIENT_TYPE_OBUF_COUNT 3 /* Number of clients to expose to output
-                                    buffer configuration. Just the first
-                                    three: normal, slave, pubsub. */
-
-/* Slave replication state. Used in server.repl_state for slaves to remember
- * what to do next. */
-typedef enum {
-    REPL_STATE_NONE = 0,            /* No active replication */
-    REPL_STATE_CONNECT,             /* Must connect to master */
-    REPL_STATE_CONNECTING,          /* Connecting to master */
-    /* --- Handshake states, must be ordered --- */
-    REPL_STATE_RECEIVE_PING_REPLY,  /* Wait for PING reply */
-    REPL_STATE_SEND_HANDSHAKE,      /* Send handshake sequance to master */
-    REPL_STATE_RECEIVE_AUTH_REPLY,  /* Wait for AUTH reply */
-    REPL_STATE_RECEIVE_PORT_REPLY,  /* Wait for REPLCONF reply */
-    REPL_STATE_RECEIVE_IP_REPLY,    /* Wait for REPLCONF reply */
-    REPL_STATE_RECEIVE_CAPA_REPLY,  /* Wait for REPLCONF reply */
-    REPL_STATE_SEND_PSYNC,          /* Send PSYNC */
-    REPL_STATE_RECEIVE_PSYNC_REPLY, /* Wait for PSYNC reply */
-    /* --- End of handshake states --- */
-    REPL_STATE_TRANSFER,        /* Receiving .rdb from master */
-    REPL_STATE_CONNECTED,       /* Connected to master */
-} repl_state;
-
-/* The state of an in progress coordinated failover */
-typedef enum {
-    NO_FAILOVER = 0,        /* No failover in progress */
-    FAILOVER_WAIT_FOR_SYNC, /* Waiting for target replica to catch up */
-    FAILOVER_IN_PROGRESS    /* Waiting for target replica to accept
-                             * PSYNC FAILOVER request. */
-} failover_state;
-
-/* State of slaves from the POV of the master. Used in client->replstate.
- * In SEND_BULK and ONLINE state the slave receives new updates
- * in its output queue. In the WAIT_BGSAVE states instead the server is waiting
- * to start the next background saving in order to send updates to it. */
-#define SLAVE_STATE_WAIT_BGSAVE_START 6 /* We need to produce a new RDB file. */
-#define SLAVE_STATE_WAIT_BGSAVE_END 7 /* Waiting RDB file creation to finish. */
-#define SLAVE_STATE_SEND_BULK 8 /* Sending RDB file to slave. */
-#define SLAVE_STATE_ONLINE 9 /* RDB file transmitted, sending just updates. */
-
-/* Slave capabilities. */
-#define SLAVE_CAPA_NONE 0
-#define SLAVE_CAPA_EOF (1<<0)    /* Can parse the RDB EOF streaming format. */
-#define SLAVE_CAPA_PSYNC2 (1<<1) /* Supports PSYNC2 protocol. */
-
-/* Synchronous read timeout - slave side */
-#define CONFIG_REPL_SYNCIO_TIMEOUT 5
-
-/* List related stuff */
-#define LIST_HEAD 0
-#define LIST_TAIL 1
-#define ZSET_MIN 0
-#define ZSET_MAX 1
-
-/* Sort operations */
-#define SORT_OP_GET 0
-
-/* Log levels */
-#define LL_DEBUG 0
-#define LL_VERBOSE 1
-#define LL_NOTICE 2
-#define LL_WARNING 3
-#define LL_RAW (1<<10) /* Modifier to log without timestamp */
-
-/* Supervision options */
-#define SUPERVISED_NONE 0
-#define SUPERVISED_AUTODETECT 1
-#define SUPERVISED_SYSTEMD 2
-#define SUPERVISED_UPSTART 3
-
-/* Anti-warning macro... */
-#define UNUSED(V) ((void) V)
-
-#define ZSKIPLIST_MAXLEVEL 32 /* Should be enough for 2^64 elements */
-#define ZSKIPLIST_P 0.25      /* Skiplist P = 1/4 */
-
-/* Append only defines */
-#define AOF_FSYNC_NO 0
-#define AOF_FSYNC_ALWAYS 1
-#define AOF_FSYNC_EVERYSEC 2
-
-/* Replication diskless load defines */
-#define REPL_DISKLESS_LOAD_DISABLED 0
-#define REPL_DISKLESS_LOAD_WHEN_DB_EMPTY 1
-#define REPL_DISKLESS_LOAD_SWAPDB 2
-
-/* TLS Client Authentication */
-#define TLS_CLIENT_AUTH_NO 0
-#define TLS_CLIENT_AUTH_YES 1
-#define TLS_CLIENT_AUTH_OPTIONAL 2
-
-/* Sanitize dump payload */
-#define SANITIZE_DUMP_NO 0
-#define SANITIZE_DUMP_YES 1
-#define SANITIZE_DUMP_CLIENTS 2
-
-/* Sets operations codes */
-#define SET_OP_UNION 0
-#define SET_OP_DIFF 1
-#define SET_OP_INTER 2
-
-/* oom-score-adj defines */
-#define OOM_SCORE_ADJ_NO 0
-#define OOM_SCORE_RELATIVE 1
-#define OOM_SCORE_ADJ_ABSOLUTE 2
-
-/* Redis maxmemory strategies. Instead of using just incremental number
- * for this defines, we use a set of flags so that testing for certain
- * properties common to multiple policies is faster. */
-#define MAXMEMORY_FLAG_LRU (1<<0)
-#define MAXMEMORY_FLAG_LFU (1<<1)
-#define MAXMEMORY_FLAG_ALLKEYS (1<<2)
-#define MAXMEMORY_FLAG_NO_SHARED_INTEGERS \
-    (MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_LFU)
-
-#define MAXMEMORY_VOLATILE_LRU ((0<<8)|MAXMEMORY_FLAG_LRU)
-#define MAXMEMORY_VOLATILE_LFU ((1<<8)|MAXMEMORY_FLAG_LFU)
-#define MAXMEMORY_VOLATILE_TTL (2<<8)
-#define MAXMEMORY_VOLATILE_RANDOM (3<<8)
-#define MAXMEMORY_ALLKEYS_LRU ((4<<8)|MAXMEMORY_FLAG_LRU|MAXMEMORY_FLAG_ALLKEYS)
-#define MAXMEMORY_ALLKEYS_LFU ((5<<8)|MAXMEMORY_FLAG_LFU|MAXMEMORY_FLAG_ALLKEYS)
-#define MAXMEMORY_ALLKEYS_RANDOM ((6<<8)|MAXMEMORY_FLAG_ALLKEYS)
-#define MAXMEMORY_NO_EVICTION (7<<8)
-
-/* Units */
-#define UNIT_SECONDS 0
-#define UNIT_MILLISECONDS 1
-
-/* SHUTDOWN flags */
-#define SHUTDOWN_NOFLAGS 0      /* No flags. */
-#define SHUTDOWN_SAVE 1         /* Force SAVE on SHUTDOWN even if no save
-                                   points are configured. */
-#define SHUTDOWN_NOSAVE 2       /* Don't SAVE on SHUTDOWN. */
-
-/* Command call flags, see call() function */
-#define CMD_CALL_NONE 0
-#define CMD_CALL_SLOWLOG (1<<0)
-#define CMD_CALL_STATS (1<<1)
-#define CMD_CALL_PROPAGATE_AOF (1<<2)
-#define CMD_CALL_PROPAGATE_REPL (1<<3)
-#define CMD_CALL_PROPAGATE (CMD_CALL_PROPAGATE_AOF|CMD_CALL_PROPAGATE_REPL)
-#define CMD_CALL_FULL (CMD_CALL_SLOWLOG | CMD_CALL_STATS | CMD_CALL_PROPAGATE)
-#define CMD_CALL_NOWRAP (1<<4)  /* Don't wrap also propagate array into
-                                   MULTI/EXEC: the caller will handle it.  */
-
-/* Command propagation flags, see propagate() function */
-#define PROPAGATE_NONE 0
-#define PROPAGATE_AOF 1
-#define PROPAGATE_REPL 2
-
-/* Client pause types, larger types are more restrictive
- * pause types than smaller pause types. */
-typedef enum {
-    CLIENT_PAUSE_OFF = 0, /* Pause no commands */
-    CLIENT_PAUSE_WRITE,   /* Pause write commands */
-    CLIENT_PAUSE_ALL      /* Pause all commands */
-} pause_type;
-
-/* RDB active child save type. */
-#define RDB_CHILD_TYPE_NONE 0
-#define RDB_CHILD_TYPE_DISK 1     /* RDB is written to disk. */
-#define RDB_CHILD_TYPE_SOCKET 2   /* RDB is written to slave socket. */
-
-/* Keyspace changes notification classes. Every class is associated with a
- * character for configuration purposes. */
-#define NOTIFY_KEYSPACE (1<<0)    /* K */
-#define NOTIFY_KEYEVENT (1<<1)    /* E */
-#define NOTIFY_GENERIC (1<<2)     /* g */
-#define NOTIFY_STRING (1<<3)      /* $ */
-#define NOTIFY_LIST (1<<4)        /* l */
-#define NOTIFY_SET (1<<5)         /* s */
-#define NOTIFY_HASH (1<<6)        /* h */
-#define NOTIFY_ZSET (1<<7)        /* z */
-#define NOTIFY_EXPIRED (1<<8)     /* x */
-#define NOTIFY_EVICTED (1<<9)     /* e */
-#define NOTIFY_STREAM (1<<10)     /* t */
-#define NOTIFY_KEY_MISS (1<<11)   /* m (Note: This one is excluded from NOTIFY_ALL on purpose) */
-#define NOTIFY_LOADED (1<<12)     /* module only key space notification, indicate a key loaded from rdb */
-#define NOTIFY_MODULE (1<<13)     /* d, module key space notification */
-#define NOTIFY_ALL (NOTIFY_GENERIC | NOTIFY_STRING | NOTIFY_LIST | NOTIFY_SET | NOTIFY_HASH | NOTIFY_ZSET | NOTIFY_EXPIRED | NOTIFY_EVICTED | NOTIFY_STREAM | NOTIFY_MODULE) /* A flag */
-
-/* Get the first bind addr or NULL */
-#define NET_FIRST_BIND_ADDR (server.bindaddr_count ? server.bindaddr[0] : NULL)
-
-/* Using the following macro you can run code inside serverCron() with the
- * specified period, specified in milliseconds.
- * The actual resolution depends on server.hz. */
-#define run_with_period(_ms_) if ((_ms_ <= 1000/server.hz) || !(server.cronloops%((_ms_)/(1000/server.hz))))
-
-/* We can print the stacktrace, so our assert is defined this way: */
-#define serverAssertWithInfo(_c,_o,_e) ((_e)?(void)0 : (_serverAssertWithInfo(_c,_o,#_e,__FILE__,__LINE__),redis_unreachable()))
-#define serverAssert(_e) ((_e)?(void)0 : (_serverAssert(#_e,__FILE__,__LINE__),redis_unreachable()))
-#define serverPanic(...) _serverPanic(__FILE__,__LINE__,__VA_ARGS__),redis_unreachable()
-
-/*-----------------------------------------------------------------------------
- * Data types
- *----------------------------------------------------------------------------*/
-
-/* A redis object, that is a type able to hold a string / list / set */
-
-/* The actual Redis Object */
-#define OBJ_STRING 0    /* String object. */
-#define OBJ_LIST 1      /* List object. */
-#define OBJ_SET 2       /* Set object. */
-#define OBJ_ZSET 3      /* Sorted set object. */
-#define OBJ_HASH 4      /* Hash object. */
-
-/* The "module" object type is a special one that signals that the object
- * is one directly managed by a Redis module. In this case the value points
- * to a moduleValue struct, which contains the object value (which is only
- * handled by the module itself) and the RedisModuleType struct which lists
- * function pointers in order to serialize, deserialize, AOF-rewrite and
- * free the object.
- *
- * Inside the RDB file, module types are encoded as OBJ_MODULE followed
- * by a 64 bit module type ID, which has a 54 bits module-specific signature
- * in order to dispatch the loading to the right module, plus a 10 bits
- * encoding version. */
-#define OBJ_MODULE 5    /* Module object. */
-#define OBJ_STREAM 6    /* Stream object. */
-
-/* Extract encver / signature from a module type ID. */
-#define REDISMODULE_TYPE_ENCVER_BITS 10
-#define REDISMODULE_TYPE_ENCVER_MASK ((1<<REDISMODULE_TYPE_ENCVER_BITS)-1)
-#define REDISMODULE_TYPE_ENCVER(id) (id & REDISMODULE_TYPE_ENCVER_MASK)
-#define REDISMODULE_TYPE_SIGN(id) ((id & ~((uint64_t)REDISMODULE_TYPE_ENCVER_MASK)) >>REDISMODULE_TYPE_ENCVER_BITS)
-
-/* Bit flags for moduleTypeAuxSaveFunc */
-#define REDISMODULE_AUX_BEFORE_RDB (1<<0)
-#define REDISMODULE_AUX_AFTER_RDB (1<<1)
-
-struct RedisModule;
-struct RedisModuleIO;
-struct RedisModuleDigest;
-struct RedisModuleCtx;
-struct redisObject;
-struct RedisModuleDefragCtx;
-
-/* Each module type implementation should export a set of methods in order
- * to serialize and deserialize the value in the RDB file, rewrite the AOF
- * log, create the digest for "DEBUG DIGEST", and free the value when a key
- * is deleted. */
-typedef void *(*moduleTypeLoadFunc)(struct RedisModuleIO *io, int encver);
-typedef void (*moduleTypeSaveFunc)(struct RedisModuleIO *io, void *value);
-typedef int (*moduleTypeAuxLoadFunc)(struct RedisModuleIO *rdb, int encver, int when);
-typedef void (*moduleTypeAuxSaveFunc)(struct RedisModuleIO *rdb, int when);
-typedef void (*moduleTypeRewriteFunc)(struct RedisModuleIO *io, struct redisObject *key, void *value);
-typedef void (*moduleTypeDigestFunc)(struct RedisModuleDigest *digest, void *value);
-typedef size_t (*moduleTypeMemUsageFunc)(const void *value);
-typedef void (*moduleTypeFreeFunc)(void *value);
-typedef size_t (*moduleTypeFreeEffortFunc)(struct redisObject *key, const void *value);
-typedef void (*moduleTypeUnlinkFunc)(struct redisObject *key, void *value);
-typedef void *(*moduleTypeCopyFunc)(struct redisObject *fromkey, struct redisObject *tokey, const void *value);
-typedef int (*moduleTypeDefragFunc)(struct RedisModuleDefragCtx *ctx, struct redisObject *key, void **value);
-
-/* This callback type is called by moduleNotifyUserChanged() every time
- * a user authenticated via the module API is associated with a different
- * user or gets disconnected. This needs to be exposed since you can't cast
- * a function pointer to (void *). */
-typedef void (*RedisModuleUserChangedFunc) (uint64_t client_id, void *privdata);
-
-
-/* The module type, which is referenced in each value of a given type, defines
- * the methods and links to the module exporting the type. */
-typedef struct RedisModuleType {
-    uint64_t id; /* Higher 54 bits of type ID + 10 lower bits of encoding ver. */
-    struct RedisModule *module;
-    moduleTypeLoadFunc rdb_load;
-    moduleTypeSaveFunc rdb_save;
-    moduleTypeRewriteFunc aof_rewrite;
-    moduleTypeMemUsageFunc mem_usage;
-    moduleTypeDigestFunc digest;
-    moduleTypeFreeFunc free;
-    moduleTypeFreeEffortFunc free_effort;
-    moduleTypeUnlinkFunc unlink;
-    moduleTypeCopyFunc copy;
-    moduleTypeDefragFunc defrag;
-    moduleTypeAuxLoadFunc aux_load;
-    moduleTypeAuxSaveFunc aux_save;
-    int aux_save_triggers;
-    char name[10]; /* 9 bytes name + null term. Charset: A-Z a-z 0-9 _- */
-} moduleType;
-
-/* In Redis objects 'robj' structures of type OBJ_MODULE, the value pointer
- * is set to the following structure, referencing the moduleType structure
- * in order to work with the value, and at the same time providing a raw
- * pointer to the value, as created by the module commands operating with
- * the module type.
- *
- * So for example in order to free such a value, it is possible to use
- * the following code:
- *
- *  if (robj->type == OBJ_MODULE) {
- *      moduleValue *mt = robj->ptr;
- *      mt->type->free(mt->value);
- *      zfree(mt); // We need to release this in-the-middle struct as well.
- *  }
- */
-typedef struct moduleValue {
-    moduleType *type;
-    void *value;
-} moduleValue;
-
-/* This is a wrapper for the 'rio' streams used inside rdb.c in Redis, so that
- * the user does not have to take the total count of the written bytes nor
- * to care about error conditions. */
-typedef struct RedisModuleIO {
-    size_t bytes;       /* Bytes read / written so far. */
-    rio *rio;           /* Rio stream. */
-    moduleType *type;   /* Module type doing the operation. */
-    int error;          /* True if error condition happened. */
-    int ver;            /* Module serialization version: 1 (old),
-                         * 2 (current version with opcodes annotation). */
-    struct RedisModuleCtx *ctx; /* Optional context, see RM_GetContextFromIO()*/
-    struct redisObject *key;    /* Optional name of key processed */
-} RedisModuleIO;
-
-/* Macro to initialize an IO context. Note that the 'ver' field is populated
- * inside rdb.c according to the version of the value to load. */
-#define moduleInitIOContext(iovar,mtype,rioptr,keyptr) do { \
-    iovar.rio = rioptr; \
-    iovar.type = mtype; \
-    iovar.bytes = 0; \
-    iovar.error = 0; \
-    iovar.ver = 0; \
-    iovar.key = keyptr; \
-    iovar.ctx = NULL; \
-} while(0)
-
-/* This is a structure used to export DEBUG DIGEST capabilities to Redis
- * modules. We want to capture both the ordered and unordered elements of
- * a data structure, so that a digest can be created in a way that correctly
- * reflects the values. See the DEBUG DIGEST command implementation for more
- * background. */
-typedef struct RedisModuleDigest {
-    unsigned char o[20];    /* Ordered elements. */
-    unsigned char x[20];    /* Xored elements. */
-} RedisModuleDigest;
-
-/* Just start with a digest composed of all zero bytes. */
-#define moduleInitDigestContext(mdvar) do { \
-    memset(mdvar.o,0,sizeof(mdvar.o)); \
-    memset(mdvar.x,0,sizeof(mdvar.x)); \
-} while(0)
-
-/* Objects encoding. Some kind of objects like Strings and Hashes can be
- * internally represented in multiple ways. The 'encoding' field of the object
- * is set to one of this fields for this object. */
-#define OBJ_ENCODING_RAW 0     /* Raw representation */
-#define OBJ_ENCODING_INT 1     /* Encoded as integer */
-#define OBJ_ENCODING_HT 2      /* Encoded as hash table */
-#define OBJ_ENCODING_ZIPMAP 3  /* Encoded as zipmap */
-#define OBJ_ENCODING_LINKEDLIST 4 /* No longer used: old list encoding. */
-#define OBJ_ENCODING_ZIPLIST 5 /* Encoded as ziplist */
-#define OBJ_ENCODING_INTSET 6  /* Encoded as intset */
-#define OBJ_ENCODING_SKIPLIST 7  /* Encoded as skiplist */
-#define OBJ_ENCODING_EMBSTR 8  /* Embedded sds string encoding */
-#define OBJ_ENCODING_QUICKLIST 9 /* Encoded as linked list of ziplists */
-#define OBJ_ENCODING_STREAM 10 /* Encoded as a radix tree of listpacks */
-
-#define LRU_BITS 24
-#define LRU_CLOCK_MAX ((1<<LRU_BITS)-1) /* Max value of obj->lru */
-#define LRU_CLOCK_RESOLUTION 1000 /* LRU clock resolution in ms */
-
-#define OBJ_SHARED_REFCOUNT INT_MAX     /* Global object never destroyed. */
-#define OBJ_STATIC_REFCOUNT (INT_MAX-1) /* Object allocated in the stack. */
-#define OBJ_FIRST_SPECIAL_REFCOUNT OBJ_STATIC_REFCOUNT
-typedef struct redisObject {
-    unsigned type:4;
-    unsigned encoding:4;
-    unsigned lru:LRU_BITS; /* LRU time (relative to global lru_clock) or
-                            * LFU data (least significant 8 bits frequency
-                            * and most significant 16 bits access time). */
-    int refcount;
-    void *ptr;
-} robj;
-
-/* The a string name for an object's type as listed above
- * Native types are checked against the OBJ_STRING, OBJ_LIST, OBJ_* defines,
- * and Module types have their registered name returned. */
-char *getObjectTypeName(robj*);
-
-/* Macro used to initialize a Redis object allocated on the stack.
- * Note that this macro is taken near the structure definition to make sure
- * we'll update it when the structure is changed, to avoid bugs like
- * bug #85 introduced exactly in this way. */
-#define initStaticStringObject(_var,_ptr) do { \
-    _var.refcount = OBJ_STATIC_REFCOUNT; \
-    _var.type = OBJ_STRING; \
-    _var.encoding = OBJ_ENCODING_RAW; \
-    _var.ptr = _ptr; \
-} while(0)
-
-struct evictionPoolEntry; /* Defined in evict.c */
-
-/* This structure is used in order to represent the output buffer of a client,
- * which is actually a linked list of blocks like that, that is: client->reply. */
-typedef struct clientReplyBlock {
-    size_t size, used;
-    char buf[];
-} clientReplyBlock;
-
-/* Redis database representation. There are multiple databases identified
- * by integers from 0 (the default database) up to the max configured
- * database. The database number is the 'id' field in the structure. */
-typedef struct redisDb {
-    dict *dict;                 /* The keyspace for this DB */
-    dict *expires;              /* Timeout of keys with a timeout set */
-    dict *blocking_keys;        /* Keys with clients waiting for data (BLPOP)*/
-    dict *ready_keys;           /* Blocked keys that received a PUSH */
-    dict *watched_keys;         /* WATCHED keys for MULTI/EXEC CAS */
-    int id;                     /* Database ID */
-    long long avg_ttl;          /* Average TTL, just for stats */
-    unsigned long expires_cursor; /* Cursor of the active expire cycle. */
-    list *defrag_later;         /* List of key names to attempt to defrag one by one, gradually. */
-} redisDb;
-
-/* Declare database backup that include redis main DBs and slots to keys map.
- * Definition is in db.c. We can't define it here since we define CLUSTER_SLOTS
- * in cluster.h. */
-typedef struct dbBackup dbBackup;
-
-/* Client MULTI/EXEC state */
-typedef struct multiCmd {
-    robj **argv;
-    int argc;
-    struct redisCommand *cmd;
-} multiCmd;
-
-typedef struct multiState {
-    multiCmd *commands;     /* Array of MULTI commands */
-    int count;              /* Total number of MULTI commands */
-    int cmd_flags;          /* The accumulated command flags OR-ed together.
-                               So if at least a command has a given flag, it
-                               will be set in this field. */
-    int cmd_inv_flags;      /* Same as cmd_flags, OR-ing the ~flags. so that it
-                               is possible to know if all the commands have a
-                               certain flag. */
-} multiState;
-
-/* This structure holds the blocking operation state for a client.
- * The fields used depend on client->btype. */
-typedef struct blockingState {
-    /* Generic fields. */
-    mstime_t timeout;       /* Blocking operation timeout. If UNIX current time
-                             * is > timeout then the operation timed out. */
-
-    /* BLOCKED_LIST, BLOCKED_ZSET and BLOCKED_STREAM */
-    dict *keys;             /* The keys we are waiting to terminate a blocking
-                             * operation such as BLPOP or XREAD. Or NULL. */
-    robj *target;           /* The key that should receive the element,
-                             * for BLMOVE. */
-    struct listPos {
-        int wherefrom;      /* Where to pop from */
-        int whereto;        /* Where to push to */
-    } listpos;              /* The positions in the src/dst lists
-                             * where we want to pop/push an element
-                             * for BLPOP, BRPOP and BLMOVE. */
-
-    /* BLOCK_STREAM */
-    size_t xread_count;     /* XREAD COUNT option. */
-    robj *xread_group;      /* XREADGROUP group name. */
-    robj *xread_consumer;   /* XREADGROUP consumer name. */
-    int xread_group_noack;
-
-    /* BLOCKED_WAIT */
-    int numreplicas;        /* Number of replicas we are waiting for ACK. */
-    long long reploffset;   /* Replication offset to reach. */
-
-    /* BLOCKED_MODULE */
-    void *module_blocked_handle; /* RedisModuleBlockedClient structure.
-                                    which is opaque for the Redis core, only
-                                    handled in module.c. */
-} blockingState;
-
-/* The following structure represents a node in the server.ready_keys list,
- * where we accumulate all the keys that had clients blocked with a blocking
- * operation such as B[LR]POP, but received new data in the context of the
- * last executed command.
- *
- * After the execution of every command or script, we run this list to check
- * if as a result we should serve data to clients blocked, unblocking them.
- * Note that server.ready_keys will not have duplicates as there dictionary
- * also called ready_keys in every structure representing a Redis database,
- * where we make sure to remember if a given key was already added in the
- * server.ready_keys list. */
-typedef struct readyList {
-    redisDb *db;
-    robj *key;
-} readyList;
-
-/* This structure represents a Redis user. This is useful for ACLs, the
- * user is associated to the connection after the connection is authenticated.
- * If there is no associated user, the connection uses the default user. */
-#define USER_COMMAND_BITS_COUNT 1024    /* The total number of command bits
-                                           in the user structure. The last valid
-                                           command ID we can set in the user
-                                           is USER_COMMAND_BITS_COUNT-1. */
-#define USER_FLAG_ENABLED (1<<0)        /* The user is active. */
-#define USER_FLAG_DISABLED (1<<1)       /* The user is disabled. */
-#define USER_FLAG_ALLKEYS (1<<2)        /* The user can mention any key. */
-#define USER_FLAG_ALLCOMMANDS (1<<3)    /* The user can run all commands. */
-#define USER_FLAG_NOPASS      (1<<4)    /* The user requires no password, any
-                                           provided password will work. For the
-                                           default user, this also means that
-                                           no AUTH is needed, and every
-                                           connection is immediately
-                                           authenticated. */
-#define USER_FLAG_ALLCHANNELS (1<<5)    /* The user can mention any Pub/Sub
-                                           channel. */
-#define USER_FLAG_SANITIZE_PAYLOAD (1<<6)       /* The user require a deep RESTORE
-                                                 * payload sanitization. */
-#define USER_FLAG_SANITIZE_PAYLOAD_SKIP (1<<7)  /* The user should skip the
-                                                 * deep sanitization of RESTORE
-                                                 * payload. */
-
-typedef struct {
-    sds name;       /* The username as an SDS string. */
-    uint64_t flags; /* See USER_FLAG_* */
-
-    /* The bit in allowed_commands is set if this user has the right to
-     * execute this command. In commands having subcommands, if this bit is
-     * set, then all the subcommands are also available.
-     *
-     * If the bit for a given command is NOT set and the command has
-     * subcommands, Redis will also check allowed_subcommands in order to
-     * understand if the command can be executed. */
-    uint64_t allowed_commands[USER_COMMAND_BITS_COUNT/64];
-
-    /* This array points, for each command ID (corresponding to the command
-     * bit set in allowed_commands), to an array of SDS strings, terminated by
-     * a NULL pointer, with all the sub commands that can be executed for
-     * this command. When no subcommands matching is used, the field is just
-     * set to NULL to avoid allocating USER_COMMAND_BITS_COUNT pointers. */
-    sds **allowed_subcommands;
-    list *passwords; /* A list of SDS valid passwords for this user. */
-    list *patterns;  /* A list of allowed key patterns. If this field is NULL
-                        the user cannot mention any key in a command, unless
-                        the flag ALLKEYS is set in the user. */
-    list *channels;  /* A list of allowed Pub/Sub channel patterns. If this
-                        field is NULL the user cannot mention any channel in a
-                        `PUBLISH` or [P][UNSUBSCRIBE] command, unless the flag
-                        ALLCHANNELS is set in the user. */
-} user;
-
-/* With multiplexing we need to take per-client state.
- * Clients are taken in a linked list. */
-
-#define CLIENT_ID_AOF (UINT64_MAX) /* Reserved ID for the AOF client. If you
-                                      need more reserved IDs use UINT64_MAX-1,
-                                      -2, ... and so forth. */
-
-typedef struct client {
-    uint64_t id;            /* Client incremental unique ID. */
-    connection *conn;
-    int resp;               /* RESP protocol version. Can be 2 or 3. */
-    redisDb *db;            /* Pointer to currently SELECTed DB. */
-    robj *name;             /* As set by CLIENT SETNAME. */
-    sds querybuf;           /* Buffer we use to accumulate client queries. */
-    size_t qb_pos;          /* The position we have read in querybuf. */
-    sds pending_querybuf;   /* If this client is flagged as master, this buffer
-                               represents the yet not applied portion of the
-                               replication stream that we are receiving from
-                               the master. */
-    size_t querybuf_peak;   /* Recent (100ms or more) peak of querybuf size. */
-    int argc;               /* Num of arguments of current command. */
-    robj **argv;            /* Arguments of current command. */
-    int original_argc;      /* Num of arguments of original command if arguments were rewritten. */
-    robj **original_argv;   /* Arguments of original command if arguments were rewritten. */
-    size_t argv_len_sum;    /* Sum of lengths of objects in argv list. */
-    struct redisCommand *cmd, *lastcmd;  /* Last command executed. */
-    user *user;             /* User associated with this connection. If the
-                               user is set to NULL the connection can do
-                               anything (admin). */
-    int reqtype;            /* Request protocol type: PROTO_REQ_* */
-    int multibulklen;       /* Number of multi bulk arguments left to read. */
-    long bulklen;           /* Length of bulk argument in multi bulk request. */
-    list *reply;            /* List of reply objects to send to the client. */
-    unsigned long long reply_bytes; /* Tot bytes of objects in reply list. */
-    size_t sentlen;         /* Amount of bytes already sent in the current
-                               buffer or object being sent. */
-    time_t ctime;           /* Client creation time. */
-    long duration;          /* Current command duration. Used for measuring latency of blocking/non-blocking cmds */
-    time_t lastinteraction; /* Time of the last interaction, used for timeout */
-    time_t obuf_soft_limit_reached_time;
-    uint64_t flags;         /* Client flags: CLIENT_* macros. */
-    int authenticated;      /* Needed when the default user requires auth. */
-    int replstate;          /* Replication state if this is a slave. */
-    int repl_put_online_on_ack; /* Install slave write handler on first ACK. */
-    int repldbfd;           /* Replication DB file descriptor. */
-    off_t repldboff;        /* Replication DB file offset. */
-    off_t repldbsize;       /* Replication DB file size. */
-    sds replpreamble;       /* Replication DB preamble. */
-    long long read_reploff; /* Read replication offset if this is a master. */
-    long long reploff;      /* Applied replication offset if this is a master. */
-    long long repl_ack_off; /* Replication ack offset, if this is a slave. */
-    long long repl_ack_time;/* Replication ack time, if this is a slave. */
-    long long repl_last_partial_write; /* The last time the server did a partial write from the RDB child pipe to this replica  */
-    long long psync_initial_offset; /* FULLRESYNC reply offset other slaves
-                                       copying this slave output buffer
-                                       should use. */
-    char replid[CONFIG_RUN_ID_SIZE+1]; /* Master replication ID (if master). */
-    int slave_listening_port; /* As configured with: REPLCONF listening-port */
-    char *slave_addr;       /* Optionally given by REPLCONF ip-address */
-    int slave_capa;         /* Slave capabilities: SLAVE_CAPA_* bitwise OR. */
-    multiState mstate;      /* MULTI/EXEC state */
-    int btype;              /* Type of blocking op if CLIENT_BLOCKED. */
-    blockingState bpop;     /* blocking state */
-    long long woff;         /* Last write global replication offset. */
-    list *watched_keys;     /* Keys WATCHED for MULTI/EXEC CAS */
-    dict *pubsub_channels;  /* channels a client is interested in (SUBSCRIBE) */
-    list *pubsub_patterns;  /* patterns a client is interested in (SUBSCRIBE) */
-    sds peerid;             /* Cached peer ID. */
-    sds sockname;           /* Cached connection target address. */
-    listNode *client_list_node; /* list node in client list */
-    listNode *paused_list_node; /* list node within the pause list */
-    RedisModuleUserChangedFunc auth_callback; /* Module callback to execute
-                                               * when the authenticated user
-                                               * changes. */
-    void *auth_callback_privdata; /* Private data that is passed when the auth
-                                   * changed callback is executed. Opaque for
-                                   * Redis Core. */
-    void *auth_module;      /* The module that owns the callback, which is used
-                             * to disconnect the client if the module is
-                             * unloaded for cleanup. Opaque for Redis Core.*/
-
-    /* If this client is in tracking mode and this field is non zero,
-     * invalidation messages for keys fetched by this client will be send to
-     * the specified client ID. */
-    uint64_t client_tracking_redirection;
-    rax *client_tracking_prefixes; /* A dictionary of prefixes we are already
-                                      subscribed to in BCAST mode, in the
-                                      context of client side caching. */
-    /* In clientsCronTrackClientsMemUsage() we track the memory usage of
-     * each client and add it to the sum of all the clients of a given type,
-     * however we need to remember what was the old contribution of each
-     * client, and in which categoty the client was, in order to remove it
-     * before adding it the new value. */
-    uint64_t client_cron_last_memory_usage;
-    int      client_cron_last_memory_type;
-    /* Response buffer */
-    int bufpos;
-    char buf[PROTO_REPLY_CHUNK_BYTES];
-} client;
-
-struct saveparam {
-    time_t seconds;
-    int changes;
-};
-
-struct moduleLoadQueueEntry {
-    sds path;
-    int argc;
-    robj **argv;
-};
-
-struct sentinelLoadQueueEntry {
-    int argc;
-    sds *argv;
-    int linenum;
-    sds line;
-};
-
-struct sentinelConfig {
-    list *pre_monitor_cfg;
-    list *monitor_cfg;
-    list *post_monitor_cfg;
-};
-
-struct sharedObjectsStruct {
-    robj *crlf, *ok, *err, *emptybulk, *czero, *cone, *pong, *space,
-    *colon, *queued, *null[4], *nullarray[4], *emptymap[4], *emptyset[4],
-    *emptyarray, *wrongtypeerr, *nokeyerr, *syntaxerr, *sameobjecterr,
-    *outofrangeerr, *noscripterr, *loadingerr, *slowscripterr, *bgsaveerr,
-    *masterdownerr, *roslaveerr, *execaborterr, *noautherr, *noreplicaserr,
-    *busykeyerr, *oomerr, *plus, *messagebulk, *pmessagebulk, *subscribebulk,
-    *unsubscribebulk, *psubscribebulk, *punsubscribebulk, *del, *unlink,
-    *rpop, *lpop, *lpush, *rpoplpush, *lmove, *blmove, *zpopmin, *zpopmax,
-    *emptyscan, *multi, *exec, *left, *right, *hset, *srem, *xgroup, *xclaim,  
-    *script, *replconf, *eval, *persist, *set, *pexpireat, *pexpire, 
-    *time, *pxat, *px, *retrycount, *force, *justid, 
-    *lastid, *ping, *setid, *keepttl, *load, *createconsumer,
-    *getack, *special_asterick, *special_equals, *default_username, *redacted,
-    *select[PROTO_SHARED_SELECT_CMDS],
-    *integers[OBJ_SHARED_INTEGERS],
-    *mbulkhdr[OBJ_SHARED_BULKHDR_LEN], /* "*<value>\r\n" */
-    *bulkhdr[OBJ_SHARED_BULKHDR_LEN];  /* "$<value>\r\n" */
-    sds minstring, maxstring;
-};
-
-/* ZSETs use a specialized version of Skiplists */
-typedef struct zskiplistNode {
-    sds ele;
-    double score;
-    struct zskiplistNode *backward;
-    struct zskiplistLevel {
-        struct zskiplistNode *forward;
-        unsigned long span;
-    } level[];
-} zskiplistNode;
-
-typedef struct zskiplist {
-    struct zskiplistNode *header, *tail;
-    unsigned long length;
-    int level;
-} zskiplist;
-
-typedef struct zset {
-    dict *dict;
-    zskiplist *zsl;
-} zset;
-
-typedef struct clientBufferLimitsConfig {
-    unsigned long long hard_limit_bytes;
-    unsigned long long soft_limit_bytes;
-    time_t soft_limit_seconds;
-} clientBufferLimitsConfig;
-
-extern clientBufferLimitsConfig clientBufferLimitsDefaults[CLIENT_TYPE_OBUF_COUNT];
-
-/* The redisOp structure defines a Redis Operation, that is an instance of
- * a command with an argument vector, database ID, propagation target
- * (PROPAGATE_*), and command pointer.
- *
- * Currently only used to additionally propagate more commands to AOF/Replication
- * after the propagation of the executed command. */
-typedef struct redisOp {
-    robj **argv;
-    int argc, dbid, target;
-    struct redisCommand *cmd;
-} redisOp;
-
-/* Defines an array of Redis operations. There is an API to add to this
- * structure in an easy way.
- *
- * redisOpArrayInit();
- * redisOpArrayAppend();
- * redisOpArrayFree();
- */
-typedef struct redisOpArray {
-    redisOp *ops;
-    int numops;
-} redisOpArray;
-
-/* This structure is returned by the getMemoryOverheadData() function in
- * order to return memory overhead information. */
-struct redisMemOverhead {
-    size_t peak_allocated;
-    size_t total_allocated;
-    size_t startup_allocated;
-    size_t repl_backlog;
-    size_t clients_slaves;
-    size_t clients_normal;
-    size_t aof_buffer;
-    size_t lua_caches;
-    size_t overhead_total;
-    size_t dataset;
-    size_t total_keys;
-    size_t bytes_per_key;
-    float dataset_perc;
-    float peak_perc;
-    float total_frag;
-    ssize_t total_frag_bytes;
-    float allocator_frag;
-    ssize_t allocator_frag_bytes;
-    float allocator_rss;
-    ssize_t allocator_rss_bytes;
-    float rss_extra;
-    size_t rss_extra_bytes;
-    size_t num_dbs;
-    struct {
-        size_t dbid;
-        size_t overhead_ht_main;
-        size_t overhead_ht_expires;
-    } *db;
-};
-
-/* This structure can be optionally passed to RDB save/load functions in
- * order to implement additional functionalities, by storing and loading
- * metadata to the RDB file.
- *
- * Currently the only use is to select a DB at load time, useful in
- * replication in order to make sure that chained slaves (slaves of slaves)
- * select the correct DB and are able to accept the stream coming from the
- * top-level master. */
-typedef struct rdbSaveInfo {
-    /* Used saving and loading. */
-    int repl_stream_db;  /* DB to select in server.master client. */
-
-    /* Used only loading. */
-    int repl_id_is_set;  /* True if repl_id field is set. */
-    char repl_id[CONFIG_RUN_ID_SIZE+1];     /* Replication ID. */
-    long long repl_offset;                  /* Replication offset. */
-} rdbSaveInfo;
-
-#define RDB_SAVE_INFO_INIT {-1,0,"0000000000000000000000000000000000000000",-1}
-
-struct malloc_stats {
-    size_t zmalloc_used;
-    size_t process_rss;
-    size_t allocator_allocated;
-    size_t allocator_active;
-    size_t allocator_resident;
-};
-
-typedef struct socketFds {
-    int fd[CONFIG_BINDADDR_MAX];
-    int count;
-} socketFds;
-
-/*-----------------------------------------------------------------------------
- * TLS Context Configuration
- *----------------------------------------------------------------------------*/
-
-typedef struct redisTLSContextConfig {
-    char *cert_file;                /* Server side and optionally client side cert file name */
-    char *key_file;                 /* Private key filename for cert_file */
-    char *key_file_pass;            /* Optional password for key_file */
-    char *client_cert_file;         /* Certificate to use as a client; if none, use cert_file */
-    char *client_key_file;          /* Private key filename for client_cert_file */
-    char *client_key_file_pass;     /* Optional password for client_key_file */
-    char *dh_params_file;
-    char *ca_cert_file;
-    char *ca_cert_dir;
-    char *protocols;
-    char *ciphers;
-    char *ciphersuites;
-    int prefer_server_ciphers;
-    int session_caching;
-    int session_cache_size;
-    int session_cache_timeout;
-} redisTLSContextConfig;
-
-/*-----------------------------------------------------------------------------
- * Global server state
- *----------------------------------------------------------------------------*/
-
-struct clusterState;
-
-/* AIX defines hz to __hz, we don't use this define and in order to allow
- * Redis build on AIX we need to undef it. */
-#ifdef _AIX
-#undef hz
-#endif
-
-#define CHILD_TYPE_NONE 0
-#define CHILD_TYPE_RDB 1
-#define CHILD_TYPE_AOF 2
-#define CHILD_TYPE_LDB 3
-#define CHILD_TYPE_MODULE 4
-
-typedef enum childInfoType {
-    CHILD_INFO_TYPE_CURRENT_INFO,
-    CHILD_INFO_TYPE_AOF_COW_SIZE,
-    CHILD_INFO_TYPE_RDB_COW_SIZE,
-    CHILD_INFO_TYPE_MODULE_COW_SIZE
-} childInfoType;
-
-struct redisServer {
-    /* General */
-    pid_t pid;                  /* Main process pid. */
-    pthread_t main_thread_id;         /* Main thread id */
-    char *configfile;           /* Absolute config file path, or NULL */
-    char *executable;           /* Absolute executable file path. */
-    char **exec_argv;           /* Executable argv vector (copy). */
-    int dynamic_hz;             /* Change hz value depending on # of clients. */
-    int config_hz;              /* Configured HZ value. May be different than
-                                   the actual 'hz' field value if dynamic-hz
-                                   is enabled. */
-    mode_t umask;               /* The umask value of the process on startup */
-    int hz;                     /* serverCron() calls frequency in hertz */
-    int in_fork_child;          /* indication that this is a fork child */
-    redisDb *db;
-    dict *commands;             /* Command table */
-    dict *orig_commands;        /* Command table before command renaming. */
-    aeEventLoop *el;
-    rax *errors;                /* Errors table */
-    redisAtomic unsigned int lruclock; /* Clock for LRU eviction */
-    volatile sig_atomic_t shutdown_asap; /* SHUTDOWN needed ASAP */
-    int activerehashing;        /* Incremental rehash in serverCron() */
-    int active_defrag_running;  /* Active defragmentation running (holds current scan aggressiveness) */
-    char *pidfile;              /* PID file path */
-    int arch_bits;              /* 32 or 64 depending on sizeof(long) */
-    int cronloops;              /* Number of times the cron function run */
-    char runid[CONFIG_RUN_ID_SIZE+1];  /* ID always different at every exec. */
-    int sentinel_mode;          /* True if this instance is a Sentinel. */
-    size_t initial_memory_usage; /* Bytes used after initialization. */
-    int always_show_logo;       /* Show logo even for non-stdout logging. */
-    int in_eval;                /* Are we inside EVAL? */
-    int in_exec;                /* Are we inside EXEC? */
-    int propagate_in_transaction;  /* Make sure we don't propagate nested MULTI/EXEC */
-    char *ignore_warnings;      /* Config: warnings that should be ignored. */
-    int client_pause_in_transaction; /* Was a client pause executed during this Exec? */
-    /* Modules */
-    dict *moduleapi;            /* Exported core APIs dictionary for modules. */
-    dict *sharedapi;            /* Like moduleapi but containing the APIs that
-                                   modules share with each other. */
-    list *loadmodule_queue;     /* List of modules to load at startup. */
-    int module_blocked_pipe[2]; /* Pipe used to awake the event loop if a
-                                   client blocked on a module command needs
-                                   to be processed. */
-    pid_t child_pid;            /* PID of current child */
-    int child_type;             /* Type of current child */
-    client *module_client;      /* "Fake" client to call Redis from modules */
-    /* Networking */
-    int port;                   /* TCP listening port */
-    int tls_port;               /* TLS listening port */
-    int tcp_backlog;            /* TCP listen() backlog */
-    char *bindaddr[CONFIG_BINDADDR_MAX]; /* Addresses we should bind to */
-    int bindaddr_count;         /* Number of addresses in server.bindaddr[] */
-    char *unixsocket;           /* UNIX socket path */
-    mode_t unixsocketperm;      /* UNIX socket permission */
-    socketFds ipfd;             /* TCP socket file descriptors */
-    socketFds tlsfd;            /* TLS socket file descriptors */
-    int sofd;                   /* Unix socket file descriptor */
-    socketFds cfd;              /* Cluster bus listening socket */
-    list *clients;              /* List of active clients */
-    list *clients_to_close;     /* Clients to close asynchronously */
-    list *clients_pending_write; /* There is to write or install handler. */
-    list *clients_pending_read;  /* Client has pending read socket buffers. */
-    list *slaves, *monitors;    /* List of slaves and MONITORs */
-    client *current_client;     /* Current client executing the command. */
-    rax *clients_timeout_table; /* Radix tree for blocked clients timeouts. */
-    long fixed_time_expire;     /* If > 0, expire keys against server.mstime. */
-    rax *clients_index;         /* Active clients dictionary by client ID. */
-    pause_type client_pause_type;      /* True if clients are currently paused */
-    list *paused_clients;       /* List of pause clients */
-    mstime_t client_pause_end_time;    /* Time when we undo clients_paused */
-    char neterr[ANET_ERR_LEN];   /* Error buffer for anet.c */
-    dict *migrate_cached_sockets;/* MIGRATE cached sockets */
-    redisAtomic uint64_t next_client_id; /* Next client unique ID. Incremental. */
-    int protected_mode;         /* Don't accept external connections. */
-    int gopher_enabled;         /* If true the server will reply to gopher
-                                   queries. Will still serve RESP2 queries. */
-    int io_threads_num;         /* Number of IO threads to use. */
-    int io_threads_do_reads;    /* Read and parse from IO threads? */
-    int io_threads_active;      /* Is IO threads currently active? */
-    long long events_processed_while_blocked; /* processEventsWhileBlocked() */
-
-    /* RDB / AOF loading information */
-    volatile sig_atomic_t loading; /* We are loading data from disk if true */
-    off_t loading_total_bytes;
-    off_t loading_rdb_used_mem;
-    off_t loading_loaded_bytes;
-    time_t loading_start_time;
-    off_t loading_process_events_interval_bytes;
-    /* Fast pointers to often looked up command */
-    struct redisCommand *delCommand, *multiCommand, *lpushCommand,
-                        *lpopCommand, *rpopCommand, *zpopminCommand,
-                        *zpopmaxCommand, *sremCommand, *execCommand,
-                        *expireCommand, *pexpireCommand, *xclaimCommand,
-                        *xgroupCommand, *rpoplpushCommand, *lmoveCommand;
-    /* Fields used only for stats */
-    time_t stat_starttime;          /* Server start time */
-    long long stat_numcommands;     /* Number of processed commands */
-    long long stat_numconnections;  /* Number of connections received */
-    long long stat_expiredkeys;     /* Number of expired keys */
-    double stat_expired_stale_perc; /* Percentage of keys probably expired */
-    long long stat_expired_time_cap_reached_count; /* Early expire cylce stops.*/
-    long long stat_expire_cycle_time_used; /* Cumulative microseconds used. */
-    long long stat_evictedkeys;     /* Number of evicted keys (maxmemory) */
-    long long stat_keyspace_hits;   /* Number of successful lookups of keys */
-    long long stat_keyspace_misses; /* Number of failed lookups of keys */
-    long long stat_active_defrag_hits;      /* number of allocations moved */
-    long long stat_active_defrag_misses;    /* number of allocations scanned but not moved */
-    long long stat_active_defrag_key_hits;  /* number of keys with moved allocations */
-    long long stat_active_defrag_key_misses;/* number of keys scanned and not moved */
-    long long stat_active_defrag_scanned;   /* number of dictEntries scanned */
-    size_t stat_peak_memory;        /* Max used memory record */
-    long long stat_fork_time;       /* Time needed to perform latest fork() */
-    double stat_fork_rate;          /* Fork rate in GB/sec. */
-    long long stat_total_forks;     /* Total count of fork. */
-    long long stat_rejected_conn;   /* Clients rejected because of maxclients */
-    long long stat_sync_full;       /* Number of full resyncs with slaves. */
-    long long stat_sync_partial_ok; /* Number of accepted PSYNC requests. */
-    long long stat_sync_partial_err;/* Number of unaccepted PSYNC requests. */
-    list *slowlog;                  /* SLOWLOG list of commands */
-    long long slowlog_entry_id;     /* SLOWLOG current entry ID */
-    long long slowlog_log_slower_than; /* SLOWLOG time limit (to get logged) */
-    unsigned long slowlog_max_len;     /* SLOWLOG max number of items logged */
-    struct malloc_stats cron_malloc_stats; /* sampled in serverCron(). */
-    redisAtomic long long stat_net_input_bytes; /* Bytes read from network. */
-    redisAtomic long long stat_net_output_bytes; /* Bytes written to network. */
-    size_t stat_current_cow_bytes;  /* Copy on write bytes while child is active. */
-    monotime stat_current_cow_updated;  /* Last update time of stat_current_cow_bytes */
-    size_t stat_current_save_keys_processed;  /* Processed keys while child is active. */
-    size_t stat_current_save_keys_total;  /* Number of keys when child started. */
-    size_t stat_rdb_cow_bytes;      /* Copy on write bytes during RDB saving. */
-    size_t stat_aof_cow_bytes;      /* Copy on write bytes during AOF rewrite. */
-    size_t stat_module_cow_bytes;   /* Copy on write bytes during module fork. */
-    double stat_module_progress;   /* Module save progress. */
-    uint64_t stat_clients_type_memory[CLIENT_TYPE_COUNT];/* Mem usage by type */
-    long long stat_unexpected_error_replies; /* Number of unexpected (aof-loading, replica to master, etc.) error replies */
-    long long stat_total_error_replies; /* Total number of issued error replies ( command + rejected errors ) */
-    long long stat_dump_payload_sanitizations; /* Number deep dump payloads integrity validations. */
-    long long stat_io_reads_processed; /* Number of read events processed by IO / Main threads */
-    long long stat_io_writes_processed; /* Number of write events processed by IO / Main threads */
-    redisAtomic long long stat_total_reads_processed; /* Total number of read events processed */
-    redisAtomic long long stat_total_writes_processed; /* Total number of write events processed */
-    /* The following two are used to track instantaneous metrics, like
-     * number of operations per second, network traffic. */
-    struct {
-        long long last_sample_time; /* Timestamp of last sample in ms */
-        long long last_sample_count;/* Count in last sample */
-        long long samples[STATS_METRIC_SAMPLES];
-        int idx;
-    } inst_metric[STATS_METRIC_COUNT];
-    /* Configuration */
-    int verbosity;                  /* Loglevel in redis.conf */
-    int maxidletime;                /* Client timeout in seconds */
-    int tcpkeepalive;               /* Set SO_KEEPALIVE if non-zero. */
-    int active_expire_enabled;      /* Can be disabled for testing purposes. */
-    int active_expire_effort;       /* From 1 (default) to 10, active effort. */
-    int active_defrag_enabled;
-    int sanitize_dump_payload;      /* Enables deep sanitization for ziplist and listpack in RDB and RESTORE. */
-    int skip_checksum_validation;   /* Disables checksum validateion for RDB and RESTORE payload. */
-    int jemalloc_bg_thread;         /* Enable jemalloc background thread */
-    size_t active_defrag_ignore_bytes; /* minimum amount of fragmentation waste to start active defrag */
-    int active_defrag_threshold_lower; /* minimum percentage of fragmentation to start active defrag */
-    int active_defrag_threshold_upper; /* maximum percentage of fragmentation at which we use maximum effort */
-    int active_defrag_cycle_min;       /* minimal effort for defrag in CPU percentage */
-    int active_defrag_cycle_max;       /* maximal effort for defrag in CPU percentage */
-    unsigned long active_defrag_max_scan_fields; /* maximum number of fields of set/hash/zset/list to process from within the main dict scan */
-    size_t client_max_querybuf_len; /* Limit for client query buffer length */
-    int dbnum;                      /* Total number of configured DBs */
-    int supervised;                 /* 1 if supervised, 0 otherwise. */
-    int supervised_mode;            /* See SUPERVISED_* */
-    int daemonize;                  /* True if running as a daemon */
-    int set_proc_title;             /* True if change proc title */
-    char *proc_title_template;      /* Process title template format */
-    clientBufferLimitsConfig client_obuf_limits[CLIENT_TYPE_OBUF_COUNT];
-    /* AOF persistence */
-    int aof_enabled;                /* AOF configuration */
-    int aof_state;                  /* AOF_(ON|OFF|WAIT_REWRITE) */
-    int aof_fsync;                  /* Kind of fsync() policy */
-    char *aof_filename;             /* Name of the AOF file */
-    int aof_no_fsync_on_rewrite;    /* Don't fsync if a rewrite is in prog. */
-    int aof_rewrite_perc;           /* Rewrite AOF if % growth is > M and... */
-    off_t aof_rewrite_min_size;     /* the AOF file is at least N bytes. */
-    off_t aof_rewrite_base_size;    /* AOF size on latest startup or rewrite. */
-    off_t aof_current_size;         /* AOF current size. */
-    off_t aof_fsync_offset;         /* AOF offset which is already synced to disk. */
-    int aof_flush_sleep;            /* Micros to sleep before flush. (used by tests) */
-    int aof_rewrite_scheduled;      /* Rewrite once BGSAVE terminates. */
-    list *aof_rewrite_buf_blocks;   /* Hold changes during an AOF rewrite. */
-    sds aof_buf;      /* AOF buffer, written before entering the event loop */
-    int aof_fd;       /* File descriptor of currently selected AOF file */
-    int aof_selected_db; /* Currently selected DB in AOF */
-    time_t aof_flush_postponed_start; /* UNIX time of postponed AOF flush */
-    time_t aof_last_fsync;            /* UNIX time of last fsync() */
-    time_t aof_rewrite_time_last;   /* Time used by last AOF rewrite run. */
-    time_t aof_rewrite_time_start;  /* Current AOF rewrite start time. */
-    int aof_lastbgrewrite_status;   /* C_OK or C_ERR */
-    unsigned long aof_delayed_fsync;  /* delayed AOF fsync() counter */
-    int aof_rewrite_incremental_fsync;/* fsync incrementally while aof rewriting? */
-    int rdb_save_incremental_fsync;   /* fsync incrementally while rdb saving? */
-    int aof_last_write_status;      /* C_OK or C_ERR */
-    int aof_last_write_errno;       /* Valid if aof write/fsync status is ERR */
-    int aof_load_truncated;         /* Don't stop on unexpected AOF EOF. */
-    int aof_use_rdb_preamble;       /* Use RDB preamble on AOF rewrites. */
-    redisAtomic int aof_bio_fsync_status; /* Status of AOF fsync in bio job. */
-    redisAtomic int aof_bio_fsync_errno;  /* Errno of AOF fsync in bio job. */
-    /* AOF pipes used to communicate between parent and child during rewrite. */
-    int aof_pipe_write_data_to_child;
-    int aof_pipe_read_data_from_parent;
-    int aof_pipe_write_ack_to_parent;
-    int aof_pipe_read_ack_from_child;
-    int aof_pipe_write_ack_to_child;
-    int aof_pipe_read_ack_from_parent;
-    int aof_stop_sending_diff;     /* If true stop sending accumulated diffs
-                                      to child process. */
-    sds aof_child_diff;             /* AOF diff accumulator child side. */
-    /* RDB persistence */
-    long long dirty;                /* Changes to DB from the last save */
-    long long dirty_before_bgsave;  /* Used to restore dirty on failed BGSAVE */
-    struct saveparam *saveparams;   /* Save points array for RDB */
-    int saveparamslen;              /* Number of saving points */
-    char *rdb_filename;             /* Name of RDB file */
-    int rdb_compression;            /* Use compression in RDB? */
-    int rdb_checksum;               /* Use RDB checksum? */
-    int rdb_del_sync_files;         /* Remove RDB files used only for SYNC if
-                                       the instance does not use persistence. */
-    time_t lastsave;                /* Unix time of last successful save */
-    time_t lastbgsave_try;          /* Unix time of last attempted bgsave */
-    time_t rdb_save_time_last;      /* Time used by last RDB save run. */
-    time_t rdb_save_time_start;     /* Current RDB save start time. */
-    int rdb_bgsave_scheduled;       /* BGSAVE when possible if true. */
-    int rdb_child_type;             /* Type of save by active child. */
-    int lastbgsave_status;          /* C_OK or C_ERR */
-    int stop_writes_on_bgsave_err;  /* Don't allow writes if can't BGSAVE */
-    int rdb_pipe_read;              /* RDB pipe used to transfer the rdb data */
-                                    /* to the parent process in diskless repl. */
-    int rdb_child_exit_pipe;        /* Used by the diskless parent allow child exit. */
-    connection **rdb_pipe_conns;    /* Connections which are currently the */
-    int rdb_pipe_numconns;          /* target of diskless rdb fork child. */
-    int rdb_pipe_numconns_writing;  /* Number of rdb conns with pending writes. */
-    char *rdb_pipe_buff;            /* In diskless replication, this buffer holds data */
-    int rdb_pipe_bufflen;           /* that was read from the the rdb pipe. */
-    int rdb_key_save_delay;         /* Delay in microseconds between keys while
-                                     * writing the RDB. (for testings). negative
-                                     * value means fractions of microsecons (on average). */
-    int key_load_delay;             /* Delay in microseconds between keys while
-                                     * loading aof or rdb. (for testings). negative
-                                     * value means fractions of microsecons (on average). */
-    /* Pipe and data structures for child -> parent info sharing. */
-    int child_info_pipe[2];         /* Pipe used to write the child_info_data. */
-    int child_info_nread;           /* Num of bytes of the last read from pipe */
-    /* Propagation of commands in AOF / replication */
-    redisOpArray also_propagate;    /* Additional command to propagate. */
-    int replication_allowed;        /* Are we allowed to replicate? */
-    /* Logging */
-    char *logfile;                  /* Path of log file */
-    int syslog_enabled;             /* Is syslog enabled? */
-    char *syslog_ident;             /* Syslog ident */
-    int syslog_facility;            /* Syslog facility */
-    int crashlog_enabled;           /* Enable signal handler for crashlog.
-                                     * disable for clean core dumps. */
-    int memcheck_enabled;           /* Enable memory check on crash. */
-    int use_exit_on_panic;          /* Use exit() on panic and assert rather than
-                                     * abort(). useful for Valgrind. */
-    /* Replication (master) */
-    char replid[CONFIG_RUN_ID_SIZE+1];  /* My current replication ID. */
-    char replid2[CONFIG_RUN_ID_SIZE+1]; /* replid inherited from master*/
-    long long master_repl_offset;   /* My current replication offset */
-    long long second_replid_offset; /* Accept offsets up to this for replid2. */
-    int slaveseldb;                 /* Last SELECTed DB in replication output */
-    int repl_ping_slave_period;     /* Master pings the slave every N seconds */
-    char *repl_backlog;             /* Replication backlog for partial syncs */
-    long long repl_backlog_size;    /* Backlog circular buffer size */
-    long long repl_backlog_histlen; /* Backlog actual data length */
-    long long repl_backlog_idx;     /* Backlog circular buffer current offset,
-                                       that is the next byte will'll write to.*/
-    long long repl_backlog_off;     /* Replication "master offset" of first
-                                       byte in the replication backlog buffer.*/
-    time_t repl_backlog_time_limit; /* Time without slaves after the backlog
-                                       gets released. */
-    time_t repl_no_slaves_since;    /* We have no slaves since that time.
-                                       Only valid if server.slaves len is 0. */
-    int repl_min_slaves_to_write;   /* Min number of slaves to write. */
-    int repl_min_slaves_max_lag;    /* Max lag of <count> slaves to write. */
-    int repl_good_slaves_count;     /* Number of slaves with lag <= max_lag. */
-    int repl_diskless_sync;         /* Master send RDB to slaves sockets directly. */
-    int repl_diskless_load;         /* Slave parse RDB directly from the socket.
-                                     * see REPL_DISKLESS_LOAD_* enum */
-    int repl_diskless_sync_delay;   /* Delay to start a diskless repl BGSAVE. */
-    /* Replication (slave) */
-    char *masteruser;               /* AUTH with this user and masterauth with master */
-    sds masterauth;                 /* AUTH with this password with master */
-    char *masterhost;               /* Hostname of master */
-    int masterport;                 /* Port of master */
-    int repl_timeout;               /* Timeout after N seconds of master idle */
-    client *master;     /* Client that is master for this slave */
-    client *cached_master; /* Cached master to be reused for PSYNC. */
-    int repl_syncio_timeout; /* Timeout for synchronous I/O calls */
-    int repl_state;          /* Replication status if the instance is a slave */
-    off_t repl_transfer_size; /* Size of RDB to read from master during sync. */
-    off_t repl_transfer_read; /* Amount of RDB read from master during sync. */
-    off_t repl_transfer_last_fsync_off; /* Offset when we fsync-ed last time. */
-    connection *repl_transfer_s;     /* Slave -> Master SYNC connection */
-    int repl_transfer_fd;    /* Slave -> Master SYNC temp file descriptor */
-    char *repl_transfer_tmpfile; /* Slave-> master SYNC temp file name */
-    time_t repl_transfer_lastio; /* Unix time of the latest read, for timeout */
-    int repl_serve_stale_data; /* Serve stale data when link is down? */
-    int repl_slave_ro;          /* Slave is read only? */
-    int repl_slave_ignore_maxmemory;    /* If true slaves do not evict. */
-    time_t repl_down_since; /* Unix time at which link with master went down */
-    int repl_disable_tcp_nodelay;   /* Disable TCP_NODELAY after SYNC? */
-    int slave_priority;             /* Reported in INFO and used by Sentinel. */
-    int replica_announced;          /* If true, replica is announced by Sentinel */
-    int slave_announce_port;        /* Give the master this listening port. */
-    char *slave_announce_ip;        /* Give the master this ip address. */
-    /* The following two fields is where we store master PSYNC replid/offset
-     * while the PSYNC is in progress. At the end we'll copy the fields into
-     * the server->master client structure. */
-    char master_replid[CONFIG_RUN_ID_SIZE+1];  /* Master PSYNC runid. */
-    long long master_initial_offset;           /* Master PSYNC offset. */
-    int repl_slave_lazy_flush;          /* Lazy FLUSHALL before loading DB? */
-    /* Replication script cache. */
-    dict *repl_scriptcache_dict;        /* SHA1 all slaves are aware of. */
-    list *repl_scriptcache_fifo;        /* First in, first out LRU eviction. */
-    unsigned int repl_scriptcache_size; /* Max number of elements. */
-    /* Synchronous replication. */
-    list *clients_waiting_acks;         /* Clients waiting in WAIT command. */
-    int get_ack_from_slaves;            /* If true we send REPLCONF GETACK. */
-    /* Limits */
-    unsigned int maxclients;            /* Max number of simultaneous clients */
-    unsigned long long maxmemory;   /* Max number of memory bytes to use */
-    int maxmemory_policy;           /* Policy for key eviction */
-    int maxmemory_samples;          /* Precision of random sampling */
-    int maxmemory_eviction_tenacity;/* Aggressiveness of eviction processing */
-    int lfu_log_factor;             /* LFU logarithmic counter factor. */
-    int lfu_decay_time;             /* LFU counter decay factor. */
-    long long proto_max_bulk_len;   /* Protocol bulk length maximum size. */
-    int oom_score_adj_base;         /* Base oom_score_adj value, as observed on startup */
-    int oom_score_adj_values[CONFIG_OOM_COUNT];   /* Linux oom_score_adj configuration */
-    int oom_score_adj;                            /* If true, oom_score_adj is managed */
-    int disable_thp;                              /* If true, disable THP by syscall */
-    /* Blocked clients */
-    unsigned int blocked_clients;   /* # of clients executing a blocking cmd.*/
-    unsigned int blocked_clients_by_type[BLOCKED_NUM];
-    list *unblocked_clients; /* list of clients to unblock before next loop */
-    list *ready_keys;        /* List of readyList structures for BLPOP & co */
-    /* Client side caching. */
-    unsigned int tracking_clients;  /* # of clients with tracking enabled.*/
-    size_t tracking_table_max_keys; /* Max number of keys in tracking table. */
-    /* Sort parameters - qsort_r() is only available under BSD so we
-     * have to take this state global, in order to pass it to sortCompare() */
-    int sort_desc;
-    int sort_alpha;
-    int sort_bypattern;
-    int sort_store;
-    /* Zip structure config, see redis.conf for more information  */
-    size_t hash_max_ziplist_entries;
-    size_t hash_max_ziplist_value;
-    size_t set_max_intset_entries;
-    size_t zset_max_ziplist_entries;
-    size_t zset_max_ziplist_value;
-    size_t hll_sparse_max_bytes;
-    size_t stream_node_max_bytes;
-    long long stream_node_max_entries;
-    /* List parameters */
-    int list_max_ziplist_size;
-    int list_compress_depth;
-    /* time cache */
-    redisAtomic time_t unixtime; /* Unix time sampled every cron cycle. */
-    time_t timezone;            /* Cached timezone. As set by tzset(). */
-    int daylight_active;        /* Currently in daylight saving time. */
-    mstime_t mstime;            /* 'unixtime' in milliseconds. */
-    ustime_t ustime;            /* 'unixtime' in microseconds. */
-    size_t blocking_op_nesting; /* Nesting level of blocking operation, used to reset blocked_last_cron. */
-    long long blocked_last_cron; /* Indicate the mstime of the last time we did cron jobs from a blocking operation */
-    /* Pubsub */
-    dict *pubsub_channels;  /* Map channels to list of subscribed clients */
-    dict *pubsub_patterns;  /* A dict of pubsub_patterns */
-    int notify_keyspace_events; /* Events to propagate via Pub/Sub. This is an
-                                   xor of NOTIFY_... flags. */
-    /* Cluster */
-    int cluster_enabled;      /* Is cluster enabled? */
-    mstime_t cluster_node_timeout; /* Cluster node timeout. */
-    char *cluster_configfile; /* Cluster auto-generated config file name. */
-    struct clusterState *cluster;  /* State of the cluster */
-    int cluster_migration_barrier; /* Cluster replicas migration barrier. */
-    int cluster_allow_replica_migration; /* Automatic replica migrations to orphaned masters and from empty masters */
-    int cluster_slave_validity_factor; /* Slave max data age for failover. */
-    int cluster_require_full_coverage; /* If true, put the cluster down if
-                                          there is at least an uncovered slot.*/
-    int cluster_slave_no_failover;  /* Prevent slave from starting a failover
-                                       if the master is in failure state. */
-    char *cluster_announce_ip;  /* IP address to announce on cluster bus. */
-    int cluster_announce_port;     /* base port to announce on cluster bus. */
-    int cluster_announce_tls_port; /* TLS port to announce on cluster bus. */
-    int cluster_announce_bus_port; /* bus port to announce on cluster bus. */
-    int cluster_module_flags;      /* Set of flags that Redis modules are able
-                                      to set in order to suppress certain
-                                      native Redis Cluster features. Check the
-                                      REDISMODULE_CLUSTER_FLAG_*. */
-    int cluster_allow_reads_when_down; /* Are reads allowed when the cluster
-                                        is down? */
-    int cluster_config_file_lock_fd;   /* cluster config fd, will be flock */
-    /* Scripting */
-    lua_State *lua; /* The Lua interpreter. We use just one for all clients */
-    client *lua_client;   /* The "fake client" to query Redis from Lua */
-    client *lua_caller;   /* The client running EVAL right now, or NULL */
-    char* lua_cur_script; /* SHA1 of the script currently running, or NULL */
-    dict *lua_scripts;         /* A dictionary of SHA1 -> Lua scripts */
-    unsigned long long lua_scripts_mem;  /* Cached scripts' memory + oh */
-    mstime_t lua_time_limit;  /* Script timeout in milliseconds */
-    monotime lua_time_start;  /* monotonic timer to detect timed-out script */
-    mstime_t lua_time_snapshot; /* Snapshot of mstime when script is started */
-    int lua_write_dirty;  /* True if a write command was called during the
-                             execution of the current script. */
-    int lua_random_dirty; /* True if a random command was called during the
-                             execution of the current script. */
-    int lua_replicate_commands; /* True if we are doing single commands repl. */
-    int lua_multi_emitted;/* True if we already propagated MULTI. */
-    int lua_repl;         /* Script replication flags for redis.set_repl(). */
-    int lua_timedout;     /* True if we reached the time limit for script
-                             execution. */
-    int lua_kill;         /* Kill the script if true. */
-    int lua_always_replicate_commands; /* Default replication type. */
-    int lua_oom;          /* OOM detected when script start? */
-    /* Lazy free */
-    int lazyfree_lazy_eviction;
-    int lazyfree_lazy_expire;
-    int lazyfree_lazy_server_del;
-    int lazyfree_lazy_user_del;
-    int lazyfree_lazy_user_flush;
-    /* Latency monitor */
-    long long latency_monitor_threshold;
-    dict *latency_events;
-    /* ACLs */
-    char *acl_filename;           /* ACL Users file. NULL if not configured. */
-    unsigned long acllog_max_len; /* Maximum length of the ACL LOG list. */
-    sds requirepass;              /* Remember the cleartext password set with
-                                     the old "requirepass" directive for
-                                     backward compatibility with Redis <= 5. */
-    int acl_pubsub_default;      /* Default ACL pub/sub channels flag */
-    /* Assert & bug reporting */
-    int watchdog_period;  /* Software watchdog period in ms. 0 = off */
-    /* System hardware info */
-    size_t system_memory_size;  /* Total memory in system as reported by OS */
-    /* TLS Configuration */
-    int tls_cluster;
-    int tls_replication;
-    int tls_auth_clients;
-    redisTLSContextConfig tls_ctx_config;
-    /* cpu affinity */
-    char *server_cpulist; /* cpu affinity list of redis server main/io thread. */
-    char *bio_cpulist; /* cpu affinity list of bio thread. */
-    char *aof_rewrite_cpulist; /* cpu affinity list of aof rewrite process. */
-    char *bgsave_cpulist; /* cpu affinity list of bgsave process. */
-    /* Sentinel config */
-    struct sentinelConfig *sentinel_config; /* sentinel config to load at startup time. */
-    /* Coordinate failover info */
-    mstime_t failover_end_time; /* Deadline for failover command. */
-    int force_failover; /* If true then failover will be foreced at the
-                         * deadline, otherwise failover is aborted. */
-    char *target_replica_host; /* Failover target host. If null during a
-                                * failover then any replica can be used. */
-    int target_replica_port; /* Failover target port */
-    int failover_state; /* Failover state */
-};
-
-#define MAX_KEYS_BUFFER 256
-
-/* A result structure for the various getkeys function calls. It lists the
- * keys as indices to the provided argv.
- */
-typedef struct {
-    int keysbuf[MAX_KEYS_BUFFER];       /* Pre-allocated buffer, to save heap allocations */
-    int *keys;                          /* Key indices array, points to keysbuf or heap */
-    int numkeys;                        /* Number of key indices return */
-    int size;                           /* Available array size */
-} getKeysResult;
-#define GETKEYS_RESULT_INIT { {0}, NULL, 0, MAX_KEYS_BUFFER }
-
-typedef void redisCommandProc(client *c);
-typedef int redisGetKeysProc(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-struct redisCommand {
-    char *name;
-    redisCommandProc *proc;
-    int arity;
-    char *sflags;   /* Flags as string representation, one char per flag. */
-    uint64_t flags; /* The actual flags, obtained from the 'sflags' field. */
-    /* Use a function to determine keys arguments in a command line.
-     * Used for Redis Cluster redirect. */
-    redisGetKeysProc *getkeys_proc;
-    /* What keys should be loaded in background when calling this command? */
-    int firstkey; /* The first argument that's a key (0 = no keys) */
-    int lastkey;  /* The last argument that's a key */
-    int keystep;  /* The step between first and last key */
-    long long microseconds, calls, rejected_calls, failed_calls;
-    int id;     /* Command ID. This is a progressive ID starting from 0 that
-                   is assigned at runtime, and is used in order to check
-                   ACLs. A connection is able to execute a given command if
-                   the user associated to the connection has this command
-                   bit set in the bitmap of allowed commands. */
-};
-
-struct redisError {
-    long long count;
-};
-
-struct redisFunctionSym {
-    char *name;
-    unsigned long pointer;
-};
-
-typedef struct _redisSortObject {
-    robj *obj;
-    union {
-        double score;
-        robj *cmpobj;
-    } u;
-} redisSortObject;
-
-typedef struct _redisSortOperation {
-    int type;
-    robj *pattern;
-} redisSortOperation;
-
-/* Structure to hold list iteration abstraction. */
-typedef struct {
-    robj *subject;
-    unsigned char encoding;
-    unsigned char direction; /* Iteration direction */
-    quicklistIter *iter;
-} listTypeIterator;
-
-/* Structure for an entry while iterating over a list. */
-typedef struct {
-    listTypeIterator *li;
-    quicklistEntry entry; /* Entry in quicklist */
-} listTypeEntry;
-
-/* Structure to hold set iteration abstraction. */
-typedef struct {
-    robj *subject;
-    int encoding;
-    int ii; /* intset iterator */
-    dictIterator *di;
-} setTypeIterator;
-
-/* Structure to hold hash iteration abstraction. Note that iteration over
- * hashes involves both fields and values. Because it is possible that
- * not both are required, store pointers in the iterator to avoid
- * unnecessary memory allocation for fields/values. */
-typedef struct {
-    robj *subject;
-    int encoding;
-
-    unsigned char *fptr, *vptr;
-
-    dictIterator *di;
-    dictEntry *de;
-} hashTypeIterator;
-
-#include "stream.h"  /* Stream data type header file. */
-
-#define OBJ_HASH_KEY 1
-#define OBJ_HASH_VALUE 2
-
-/*-----------------------------------------------------------------------------
- * Extern declarations
- *----------------------------------------------------------------------------*/
-
-extern struct redisServer server;
-extern struct sharedObjectsStruct shared;
-extern dictType objectKeyPointerValueDictType;
-extern dictType objectKeyHeapPointerValueDictType;
-extern dictType setDictType;
-extern dictType zsetDictType;
-extern dictType clusterNodesDictType;
-extern dictType clusterNodesBlackListDictType;
-extern dictType dbDictType;
-extern dictType shaScriptObjectDictType;
-extern double R_Zero, R_PosInf, R_NegInf, R_Nan;
-extern dictType hashDictType;
-extern dictType replScriptCacheDictType;
-extern dictType dbExpiresDictType;
-extern dictType modulesDictType;
-extern dictType sdsReplyDictType;
-
-/*-----------------------------------------------------------------------------
- * Functions prototypes
- *----------------------------------------------------------------------------*/
-
-/* Modules */
-void moduleInitModulesSystem(void);
-void moduleInitModulesSystemLast(void);
-int moduleLoad(const char *path, void **argv, int argc);
-void moduleLoadFromQueue(void);
-int moduleGetCommandKeysViaAPI(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-moduleType *moduleTypeLookupModuleByID(uint64_t id);
-void moduleTypeNameByID(char *name, uint64_t moduleid);
-const char *moduleTypeModuleName(moduleType *mt);
-void moduleFreeContext(struct RedisModuleCtx *ctx);
-void unblockClientFromModule(client *c);
-void moduleHandleBlockedClients(void);
-void moduleBlockedClientTimedOut(client *c);
-void moduleBlockedClientPipeReadable(aeEventLoop *el, int fd, void *privdata, int mask);
-size_t moduleCount(void);
-void moduleAcquireGIL(void);
-int moduleTryAcquireGIL(void);
-void moduleReleaseGIL(void);
-void moduleNotifyKeyspaceEvent(int type, const char *event, robj *key, int dbid);
-void moduleCallCommandFilters(client *c);
-void ModuleForkDoneHandler(int exitcode, int bysignal);
-int TerminateModuleForkChild(int child_pid, int wait);
-ssize_t rdbSaveModulesAux(rio *rdb, int when);
-int moduleAllDatatypesHandleErrors();
-sds modulesCollectInfo(sds info, const char *section, int for_crash_report, int sections);
-void moduleFireServerEvent(uint64_t eid, int subid, void *data);
-void processModuleLoadingProgressEvent(int is_aof);
-int moduleTryServeClientBlockedOnKey(client *c, robj *key);
-void moduleUnblockClient(client *c);
-int moduleBlockedClientMayTimeout(client *c);
-int moduleClientIsBlockedOnKeys(client *c);
-void moduleNotifyUserChanged(client *c);
-void moduleNotifyKeyUnlink(robj *key, robj *val);
-robj *moduleTypeDupOrReply(client *c, robj *fromkey, robj *tokey, robj *value);
-int moduleDefragValue(robj *key, robj *obj, long *defragged);
-int moduleLateDefrag(robj *key, robj *value, unsigned long *cursor, long long endtime, long long *defragged);
-long moduleDefragGlobals(void);
-
-/* Utils */
-long long ustime(void);
-long long mstime(void);
-void getRandomHexChars(char *p, size_t len);
-void getRandomBytes(unsigned char *p, size_t len);
-uint64_t crc64(uint64_t crc, const unsigned char *s, uint64_t l);
-void exitFromChild(int retcode);
-long long redisPopcount(void *s, long count);
-int redisSetProcTitle(char *title);
-int validateProcTitleTemplate(const char *template);
-int redisCommunicateSystemd(const char *sd_notify_msg);
-void redisSetCpuAffinity(const char *cpulist);
-
-/* networking.c -- Networking and Client related operations */
-client *createClient(connection *conn);
-void closeTimedoutClients(void);
-void freeClient(client *c);
-void freeClientAsync(client *c);
-void resetClient(client *c);
-void freeClientOriginalArgv(client *c);
-void sendReplyToClient(connection *conn);
-void *addReplyDeferredLen(client *c);
-void setDeferredArrayLen(client *c, void *node, long length);
-void setDeferredMapLen(client *c, void *node, long length);
-void setDeferredSetLen(client *c, void *node, long length);
-void setDeferredAttributeLen(client *c, void *node, long length);
-void setDeferredPushLen(client *c, void *node, long length);
-void processInputBuffer(client *c);
-void processGopherRequest(client *c);
-void acceptHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-void acceptTcpHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-void acceptTLSHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-void acceptUnixHandler(aeEventLoop *el, int fd, void *privdata, int mask);
-void readQueryFromClient(connection *conn);
-void addReplyNull(client *c);
-void addReplyNullArray(client *c);
-void addReplyBool(client *c, int b);
-void addReplyVerbatim(client *c, const char *s, size_t len, const char *ext);
-void addReplyProto(client *c, const char *s, size_t len);
-void AddReplyFromClient(client *c, client *src);
-void addReplyBulk(client *c, robj *obj);
-void addReplyBulkCString(client *c, const char *s);
-void addReplyBulkCBuffer(client *c, const void *p, size_t len);
-void addReplyBulkLongLong(client *c, long long ll);
-void addReply(client *c, robj *obj);
-void addReplySds(client *c, sds s);
-void addReplyBulkSds(client *c, sds s);
-void setDeferredReplyBulkSds(client *c, void *node, sds s);
-void addReplyErrorObject(client *c, robj *err);
-void addReplyErrorSds(client *c, sds err);
-void addReplyError(client *c, const char *err);
-void addReplyStatus(client *c, const char *status);
-void addReplyDouble(client *c, double d);
-void addReplyBigNum(client *c, const char* num, size_t len);
-void addReplyHumanLongDouble(client *c, long double d);
-void addReplyLongLong(client *c, long long ll);
-void addReplyArrayLen(client *c, long length);
-void addReplyMapLen(client *c, long length);
-void addReplySetLen(client *c, long length);
-void addReplyAttributeLen(client *c, long length);
-void addReplyPushLen(client *c, long length);
-void addReplyHelp(client *c, const char **help);
-void addReplySubcommandSyntaxError(client *c);
-void addReplyLoadedModules(client *c);
-void copyClientOutputBuffer(client *dst, client *src);
-size_t sdsZmallocSize(sds s);
-size_t getStringObjectSdsUsedMemory(robj *o);
-void freeClientReplyValue(void *o);
-void *dupClientReplyValue(void *o);
-void getClientsMaxBuffers(unsigned long *longest_output_list,
-                          unsigned long *biggest_input_buffer);
-char *getClientPeerId(client *client);
-char *getClientSockName(client *client);
-sds catClientInfoString(sds s, client *client);
-sds getAllClientsInfoString(int type);
-void rewriteClientCommandVector(client *c, int argc, ...);
-void rewriteClientCommandArgument(client *c, int i, robj *newval);
-void replaceClientCommandVector(client *c, int argc, robj **argv);
-void redactClientCommandArgument(client *c, int argc);
-unsigned long getClientOutputBufferMemoryUsage(client *c);
-int freeClientsInAsyncFreeQueue(void);
-int closeClientOnOutputBufferLimitReached(client *c, int async);
-int getClientType(client *c);
-int getClientTypeByName(char *name);
-char *getClientTypeName(int class);
-void flushSlavesOutputBuffers(void);
-void disconnectSlaves(void);
-int listenToPort(int port, socketFds *fds);
-void pauseClients(mstime_t duration, pause_type type);
-void unpauseClients(void);
-int areClientsPaused(void);
-int checkClientPauseTimeoutAndReturnIfPaused(void);
-void processEventsWhileBlocked(void);
-void loadingCron(void);
-void whileBlockedCron();
-void blockingOperationStarts();
-void blockingOperationEnds();
-int handleClientsWithPendingWrites(void);
-int handleClientsWithPendingWritesUsingThreads(void);
-int handleClientsWithPendingReadsUsingThreads(void);
-int stopThreadedIOIfNeeded(void);
-int clientHasPendingReplies(client *c);
-void unlinkClient(client *c);
-int writeToClient(client *c, int handler_installed);
-void linkClient(client *c);
-void protectClient(client *c);
-void unprotectClient(client *c);
-void initThreadedIO(void);
-client *lookupClientByID(uint64_t id);
-int authRequired(client *c);
-
-#ifdef __GNUC__
-void addReplyErrorFormat(client *c, const char *fmt, ...)
-    __attribute__((format(printf, 2, 3)));
-void addReplyStatusFormat(client *c, const char *fmt, ...)
-    __attribute__((format(printf, 2, 3)));
-#else
-void addReplyErrorFormat(client *c, const char *fmt, ...);
-void addReplyStatusFormat(client *c, const char *fmt, ...);
-#endif
-
-/* Client side caching (tracking mode) */
-void enableTracking(client *c, uint64_t redirect_to, uint64_t options, robj **prefix, size_t numprefix);
-void disableTracking(client *c);
-void trackingRememberKeys(client *c);
-void trackingInvalidateKey(client *c, robj *keyobj);
-void trackingInvalidateKeysOnFlush(int async);
-void freeTrackingRadixTree(rax *rt);
-void freeTrackingRadixTreeAsync(rax *rt);
-void trackingLimitUsedSlots(void);
-uint64_t trackingGetTotalItems(void);
-uint64_t trackingGetTotalKeys(void);
-uint64_t trackingGetTotalPrefixes(void);
-void trackingBroadcastInvalidationMessages(void);
-int checkPrefixCollisionsOrReply(client *c, robj **prefix, size_t numprefix);
-
-/* List data type */
-void listTypeTryConversion(robj *subject, robj *value);
-void listTypePush(robj *subject, robj *value, int where);
-robj *listTypePop(robj *subject, int where);
-unsigned long listTypeLength(const robj *subject);
-listTypeIterator *listTypeInitIterator(robj *subject, long index, unsigned char direction);
-void listTypeReleaseIterator(listTypeIterator *li);
-int listTypeNext(listTypeIterator *li, listTypeEntry *entry);
-robj *listTypeGet(listTypeEntry *entry);
-void listTypeInsert(listTypeEntry *entry, robj *value, int where);
-int listTypeEqual(listTypeEntry *entry, robj *o);
-void listTypeDelete(listTypeIterator *iter, listTypeEntry *entry);
-void listTypeConvert(robj *subject, int enc);
-robj *listTypeDup(robj *o);
-void unblockClientWaitingData(client *c);
-void popGenericCommand(client *c, int where);
-void listElementsRemoved(client *c, robj *key, int where, robj *o, long count);
-
-/* MULTI/EXEC/WATCH... */
-void unwatchAllKeys(client *c);
-void initClientMultiState(client *c);
-void freeClientMultiState(client *c);
-void queueMultiCommand(client *c);
-void touchWatchedKey(redisDb *db, robj *key);
-int isWatchedKeyExpired(client *c);
-void touchAllWatchedKeysInDb(redisDb *emptied, redisDb *replaced_with);
-void discardTransaction(client *c);
-void flagTransaction(client *c);
-void execCommandAbort(client *c, sds error);
-void execCommandPropagateMulti(int dbid);
-void execCommandPropagateExec(int dbid);
-void beforePropagateMulti();
-void afterPropagateExec();
-
-/* Redis object implementation */
-void decrRefCount(robj *o);
-void decrRefCountVoid(void *o);
-void incrRefCount(robj *o);
-robj *makeObjectShared(robj *o);
-robj *resetRefCount(robj *obj);
-void freeStringObject(robj *o);
-void freeListObject(robj *o);
-void freeSetObject(robj *o);
-void freeZsetObject(robj *o);
-void freeHashObject(robj *o);
-robj *createObject(int type, void *ptr);
-robj *createStringObject(const char *ptr, size_t len);
-robj *createRawStringObject(const char *ptr, size_t len);
-robj *createEmbeddedStringObject(const char *ptr, size_t len);
-robj *tryCreateRawStringObject(const char *ptr, size_t len);
-robj *tryCreateStringObject(const char *ptr, size_t len);
-robj *dupStringObject(const robj *o);
-int isSdsRepresentableAsLongLong(sds s, long long *llval);
-int isObjectRepresentableAsLongLong(robj *o, long long *llongval);
-robj *tryObjectEncoding(robj *o);
-robj *getDecodedObject(robj *o);
-size_t stringObjectLen(robj *o);
-robj *createStringObjectFromLongLong(long long value);
-robj *createStringObjectFromLongLongForValue(long long value);
-robj *createStringObjectFromLongDouble(long double value, int humanfriendly);
-robj *createQuicklistObject(void);
-robj *createZiplistObject(void);
-robj *createSetObject(void);
-robj *createIntsetObject(void);
-robj *createHashObject(void);
-robj *createZsetObject(void);
-robj *createZsetZiplistObject(void);
-robj *createStreamObject(void);
-robj *createModuleObject(moduleType *mt, void *value);
-int getLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg);
-int getPositiveLongFromObjectOrReply(client *c, robj *o, long *target, const char *msg);
-int getRangeLongFromObjectOrReply(client *c, robj *o, long min, long max, long *target, const char *msg);
-int checkType(client *c, robj *o, int type);
-int getLongLongFromObjectOrReply(client *c, robj *o, long long *target, const char *msg);
-int getDoubleFromObjectOrReply(client *c, robj *o, double *target, const char *msg);
-int getDoubleFromObject(const robj *o, double *target);
-int getLongLongFromObject(robj *o, long long *target);
-int getLongDoubleFromObject(robj *o, long double *target);
-int getLongDoubleFromObjectOrReply(client *c, robj *o, long double *target, const char *msg);
-int getIntFromObjectOrReply(client *c, robj *o, int *target, const char *msg);
-char *strEncoding(int encoding);
-int compareStringObjects(robj *a, robj *b);
-int collateStringObjects(robj *a, robj *b);
-int equalStringObjects(robj *a, robj *b);
-unsigned long long estimateObjectIdleTime(robj *o);
-void trimStringObjectIfNeeded(robj *o);
-#define sdsEncodedObject(objptr) (objptr->encoding == OBJ_ENCODING_RAW || objptr->encoding == OBJ_ENCODING_EMBSTR)
-
-/* Synchronous I/O with timeout */
-ssize_t syncWrite(int fd, char *ptr, ssize_t size, long long timeout);
-ssize_t syncRead(int fd, char *ptr, ssize_t size, long long timeout);
-ssize_t syncReadLine(int fd, char *ptr, ssize_t size, long long timeout);
-
-/* Replication */
-void replicationFeedSlaves(list *slaves, int dictid, robj **argv, int argc);
-void replicationFeedSlavesFromMasterStream(list *slaves, char *buf, size_t buflen);
-void replicationFeedMonitors(client *c, list *monitors, int dictid, robj **argv, int argc);
-void updateSlavesWaitingBgsave(int bgsaveerr, int type);
-void replicationCron(void);
-void replicationStartPendingFork(void);
-void replicationHandleMasterDisconnection(void);
-void replicationCacheMaster(client *c);
-void resizeReplicationBacklog(long long newsize);
-void replicationSetMaster(char *ip, int port);
-void replicationUnsetMaster(void);
-void refreshGoodSlavesCount(void);
-void replicationScriptCacheInit(void);
-void replicationScriptCacheFlush(void);
-void replicationScriptCacheAdd(sds sha1);
-int replicationScriptCacheExists(sds sha1);
-void processClientsWaitingReplicas(void);
-void unblockClientWaitingReplicas(client *c);
-int replicationCountAcksByOffset(long long offset);
-void replicationSendNewlineToMaster(void);
-long long replicationGetSlaveOffset(void);
-char *replicationGetSlaveName(client *c);
-long long getPsyncInitialOffset(void);
-int replicationSetupSlaveForFullResync(client *slave, long long offset);
-void changeReplicationId(void);
-void clearReplicationId2(void);
-void chopReplicationBacklog(void);
-void replicationCacheMasterUsingMyself(void);
-void feedReplicationBacklog(void *ptr, size_t len);
-void showLatestBacklog(void);
-void rdbPipeReadHandler(struct aeEventLoop *eventLoop, int fd, void *clientData, int mask);
-void rdbPipeWriteHandlerConnRemoved(struct connection *conn);
-void clearFailoverState(void);
-void updateFailoverStatus(void);
-void abortFailover(const char *err);
-const char *getFailoverStateString();
-
-/* Generic persistence functions */
-void startLoadingFile(FILE* fp, char* filename, int rdbflags);
-void startLoading(size_t size, int rdbflags);
-void loadingProgress(off_t pos);
-void stopLoading(int success);
-void startSaving(int rdbflags);
-void stopSaving(int success);
-int allPersistenceDisabled(void);
-
-#define DISK_ERROR_TYPE_AOF 1       /* Don't accept writes: AOF errors. */
-#define DISK_ERROR_TYPE_RDB 2       /* Don't accept writes: RDB errors. */
-#define DISK_ERROR_TYPE_NONE 0      /* No problems, we can accept writes. */
-int writeCommandsDeniedByDiskError(void);
-
-/* RDB persistence */
-#include "rdb.h"
-void killRDBChild(void);
-int bg_unlink(const char *filename);
-
-/* AOF persistence */
-void flushAppendOnlyFile(int force);
-void feedAppendOnlyFile(struct redisCommand *cmd, int dictid, robj **argv, int argc);
-void aofRemoveTempFile(pid_t childpid);
-int rewriteAppendOnlyFileBackground(void);
-int loadAppendOnlyFile(char *filename);
-void stopAppendOnly(void);
-int startAppendOnly(void);
-void backgroundRewriteDoneHandler(int exitcode, int bysignal);
-void aofRewriteBufferReset(void);
-unsigned long aofRewriteBufferSize(void);
-ssize_t aofReadDiffFromParent(void);
-void killAppendOnlyChild(void);
-void restartAOFAfterSYNC();
-
-/* Child info */
-void openChildInfoPipe(void);
-void closeChildInfoPipe(void);
-void sendChildInfoGeneric(childInfoType info_type, size_t keys, double progress, char *pname);
-void sendChildCowInfo(childInfoType info_type, char *pname);
-void sendChildInfo(childInfoType info_type, size_t keys, char *pname);
-void receiveChildInfo(void);
-
-/* Fork helpers */
-int redisFork(int type);
-int hasActiveChildProcess();
-void resetChildState();
-int isMutuallyExclusiveChildType(int type);
-
-/* acl.c -- Authentication related prototypes. */
-extern rax *Users;
-extern user *DefaultUser;
-void ACLInit(void);
-/* Return values for ACLCheckAllPerm(). */
-#define ACL_OK 0
-#define ACL_DENIED_CMD 1
-#define ACL_DENIED_KEY 2
-#define ACL_DENIED_AUTH 3 /* Only used for ACL LOG entries. */
-#define ACL_DENIED_CHANNEL 4 /* Only used for pub/sub commands */
-int ACLCheckUserCredentials(robj *username, robj *password);
-int ACLAuthenticateUser(client *c, robj *username, robj *password);
-unsigned long ACLGetCommandID(const char *cmdname);
-void ACLClearCommandID(void);
-user *ACLGetUserByName(const char *name, size_t namelen);
-int ACLCheckAllPerm(client *c, int *idxptr);
-int ACLSetUser(user *u, const char *op, ssize_t oplen);
-sds ACLDefaultUserFirstPassword(void);
-uint64_t ACLGetCommandCategoryFlagByName(const char *name);
-int ACLAppendUserForLoading(sds *argv, int argc, int *argc_err);
-const char *ACLSetUserStringError(void);
-int ACLLoadConfiguredUsers(void);
-sds ACLDescribeUser(user *u);
-void ACLLoadUsersAtStartup(void);
-void addReplyCommandCategories(client *c, struct redisCommand *cmd);
-user *ACLCreateUnlinkedUser();
-void ACLFreeUserAndKillClients(user *u);
-void addACLLogEntry(client *c, int reason, int keypos, sds username);
-void ACLUpdateDefaultUserPassword(sds password);
-
-/* Sorted sets data type */
-
-/* Input flags. */
-#define ZADD_IN_NONE 0
-#define ZADD_IN_INCR (1<<0)    /* Increment the score instead of setting it. */
-#define ZADD_IN_NX (1<<1)      /* Don't touch elements not already existing. */
-#define ZADD_IN_XX (1<<2)      /* Only touch elements already existing. */
-#define ZADD_IN_GT (1<<3)      /* Only update existing when new scores are higher. */
-#define ZADD_IN_LT (1<<4)      /* Only update existing when new scores are lower. */
-
-/* Output flags. */
-#define ZADD_OUT_NOP (1<<0)     /* Operation not performed because of conditionals.*/
-#define ZADD_OUT_NAN (1<<1)     /* Only touch elements already existing. */
-#define ZADD_OUT_ADDED (1<<2)   /* The element was new and was added. */
-#define ZADD_OUT_UPDATED (1<<3) /* The element already existed, score updated. */
-
-/* Struct to hold an inclusive/exclusive range spec by score comparison. */
-typedef struct {
-    double min, max;
-    int minex, maxex; /* are min or max exclusive? */
-} zrangespec;
-
-/* Struct to hold an inclusive/exclusive range spec by lexicographic comparison. */
-typedef struct {
-    sds min, max;     /* May be set to shared.(minstring|maxstring) */
-    int minex, maxex; /* are min or max exclusive? */
-} zlexrangespec;
-
-zskiplist *zslCreate(void);
-void zslFree(zskiplist *zsl);
-zskiplistNode *zslInsert(zskiplist *zsl, double score, sds ele);
-unsigned char *zzlInsert(unsigned char *zl, sds ele, double score);
-int zslDelete(zskiplist *zsl, double score, sds ele, zskiplistNode **node);
-zskiplistNode *zslFirstInRange(zskiplist *zsl, zrangespec *range);
-zskiplistNode *zslLastInRange(zskiplist *zsl, zrangespec *range);
-double zzlGetScore(unsigned char *sptr);
-void zzlNext(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
-void zzlPrev(unsigned char *zl, unsigned char **eptr, unsigned char **sptr);
-unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range);
-unsigned char *zzlLastInRange(unsigned char *zl, zrangespec *range);
-unsigned long zsetLength(const robj *zobj);
-void zsetConvert(robj *zobj, int encoding);
-void zsetConvertToZiplistIfNeeded(robj *zobj, size_t maxelelen, size_t totelelen);
-int zsetScore(robj *zobj, sds member, double *score);
-unsigned long zslGetRank(zskiplist *zsl, double score, sds o);
-int zsetAdd(robj *zobj, double score, sds ele, int in_flags, int *out_flags, double *newscore);
-long zsetRank(robj *zobj, sds ele, int reverse);
-int zsetDel(robj *zobj, sds ele);
-robj *zsetDup(robj *o);
-int zsetZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep);
-void genericZpopCommand(client *c, robj **keyv, int keyc, int where, int emitkey, robj *countarg);
-sds ziplistGetObject(unsigned char *sptr);
-int zslValueGteMin(double value, zrangespec *spec);
-int zslValueLteMax(double value, zrangespec *spec);
-void zslFreeLexRange(zlexrangespec *spec);
-int zslParseLexRange(robj *min, robj *max, zlexrangespec *spec);
-unsigned char *zzlFirstInLexRange(unsigned char *zl, zlexrangespec *range);
-unsigned char *zzlLastInLexRange(unsigned char *zl, zlexrangespec *range);
-zskiplistNode *zslFirstInLexRange(zskiplist *zsl, zlexrangespec *range);
-zskiplistNode *zslLastInLexRange(zskiplist *zsl, zlexrangespec *range);
-int zzlLexValueGteMin(unsigned char *p, zlexrangespec *spec);
-int zzlLexValueLteMax(unsigned char *p, zlexrangespec *spec);
-int zslLexValueGteMin(sds value, zlexrangespec *spec);
-int zslLexValueLteMax(sds value, zlexrangespec *spec);
-
-/* Core functions */
-int getMaxmemoryState(size_t *total, size_t *logical, size_t *tofree, float *level);
-size_t freeMemoryGetNotCountedMemory();
-int overMaxmemoryAfterAlloc(size_t moremem);
-int processCommand(client *c);
-int processPendingCommandsAndResetClient(client *c);
-void setupSignalHandlers(void);
-void removeSignalHandlers(void);
-int createSocketAcceptHandler(socketFds *sfd, aeFileProc *accept_handler);
-int changeListenPort(int port, socketFds *sfd, aeFileProc *accept_handler);
-int changeBindAddr(sds *addrlist, int addrlist_len);
-struct redisCommand *lookupCommand(sds name);
-struct redisCommand *lookupCommandByCString(const char *s);
-struct redisCommand *lookupCommandOrOriginal(sds name);
-void call(client *c, int flags);
-void propagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int flags);
-void alsoPropagate(struct redisCommand *cmd, int dbid, robj **argv, int argc, int target);
-void redisOpArrayInit(redisOpArray *oa);
-void redisOpArrayFree(redisOpArray *oa);
-void forceCommandPropagation(client *c, int flags);
-void preventCommandPropagation(client *c);
-void preventCommandAOF(client *c);
-void preventCommandReplication(client *c);
-void slowlogPushCurrentCommand(client *c, struct redisCommand *cmd, ustime_t duration);
-int prepareForShutdown(int flags);
-#ifdef __GNUC__
-void _serverLog(int level, const char *fmt, ...)
-    __attribute__((format(printf, 2, 3)));
-#else
-void _serverLog(int level, const char *fmt, ...);
-#endif
-void serverLogRaw(int level, const char *msg);
-void serverLogFromHandler(int level, const char *msg);
-void usage(void);
-void updateDictResizePolicy(void);
-int htNeedsResize(dict *dict);
-void populateCommandTable(void);
-void resetCommandTableStats(void);
-void resetErrorTableStats(void);
-void adjustOpenFilesLimit(void);
-void incrementErrorCount(const char *fullerr, size_t namelen);
-void closeListeningSockets(int unlink_unix_socket);
-void updateCachedTime(int update_daylight_info);
-void resetServerStats(void);
-void activeDefragCycle(void);
-unsigned int getLRUClock(void);
-unsigned int LRU_CLOCK(void);
-const char *evictPolicyToString(void);
-struct redisMemOverhead *getMemoryOverheadData(void);
-void freeMemoryOverheadData(struct redisMemOverhead *mh);
-void checkChildrenDone(void);
-int setOOMScoreAdj(int process_class);
-void rejectCommandFormat(client *c, const char *fmt, ...);
-void *activeDefragAlloc(void *ptr);
-robj *activeDefragStringOb(robj* ob, long *defragged);
-
-#define RESTART_SERVER_NONE 0
-#define RESTART_SERVER_GRACEFULLY (1<<0)     /* Do proper shutdown. */
-#define RESTART_SERVER_CONFIG_REWRITE (1<<1) /* CONFIG REWRITE before restart.*/
-int restartServer(int flags, mstime_t delay);
-
-/* Set data type */
-robj *setTypeCreate(sds value);
-int setTypeAdd(robj *subject, sds value);
-int setTypeRemove(robj *subject, sds value);
-int setTypeIsMember(robj *subject, sds value);
-setTypeIterator *setTypeInitIterator(robj *subject);
-void setTypeReleaseIterator(setTypeIterator *si);
-int setTypeNext(setTypeIterator *si, sds *sdsele, int64_t *llele);
-sds setTypeNextObject(setTypeIterator *si);
-int setTypeRandomElement(robj *setobj, sds *sdsele, int64_t *llele);
-unsigned long setTypeRandomElements(robj *set, unsigned long count, robj *aux_set);
-unsigned long setTypeSize(const robj *subject);
-void setTypeConvert(robj *subject, int enc);
-robj *setTypeDup(robj *o);
-
-/* Hash data type */
-#define HASH_SET_TAKE_FIELD (1<<0)
-#define HASH_SET_TAKE_VALUE (1<<1)
-#define HASH_SET_COPY 0
-
-void hashTypeConvert(robj *o, int enc);
-void hashTypeTryConversion(robj *subject, robj **argv, int start, int end);
-int hashTypeExists(robj *o, sds key);
-int hashTypeDelete(robj *o, sds key);
-unsigned long hashTypeLength(const robj *o);
-hashTypeIterator *hashTypeInitIterator(robj *subject);
-void hashTypeReleaseIterator(hashTypeIterator *hi);
-int hashTypeNext(hashTypeIterator *hi);
-void hashTypeCurrentFromZiplist(hashTypeIterator *hi, int what,
-                                unsigned char **vstr,
-                                unsigned int *vlen,
-                                long long *vll);
-sds hashTypeCurrentFromHashTable(hashTypeIterator *hi, int what);
-void hashTypeCurrentObject(hashTypeIterator *hi, int what, unsigned char **vstr, unsigned int *vlen, long long *vll);
-sds hashTypeCurrentObjectNewSds(hashTypeIterator *hi, int what);
-robj *hashTypeLookupWriteOrCreate(client *c, robj *key);
-robj *hashTypeGetValueObject(robj *o, sds field);
-int hashTypeSet(robj *o, sds field, sds value, int flags);
-robj *hashTypeDup(robj *o);
-int hashZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep);
-
-/* Pub / Sub */
-int pubsubUnsubscribeAllChannels(client *c, int notify);
-int pubsubUnsubscribeAllPatterns(client *c, int notify);
-int pubsubPublishMessage(robj *channel, robj *message);
-void addReplyPubsubMessage(client *c, robj *channel, robj *msg);
-
-/* Keyspace events notification */
-void notifyKeyspaceEvent(int type, char *event, robj *key, int dbid);
-int keyspaceEventsStringToFlags(char *classes);
-sds keyspaceEventsFlagsToString(int flags);
-
-/* Configuration */
-void loadServerConfig(char *filename, char config_from_stdin, char *options);
-void appendServerSaveParams(time_t seconds, int changes);
-void resetServerSaveParams(void);
-struct rewriteConfigState; /* Forward declaration to export API. */
-void rewriteConfigRewriteLine(struct rewriteConfigState *state, const char *option, sds line, int force);
-void rewriteConfigMarkAsProcessed(struct rewriteConfigState *state, const char *option);
-int rewriteConfig(char *path, int force_all);
-void initConfigValues();
-
-/* db.c -- Keyspace access API */
-int removeExpire(redisDb *db, robj *key);
-void deleteExpiredKeyAndPropagate(redisDb *db, robj *keyobj);
-void propagateExpire(redisDb *db, robj *key, int lazy);
-int keyIsExpired(redisDb *db, robj *key);
-int expireIfNeeded(redisDb *db, robj *key);
-long long getExpire(redisDb *db, robj *key);
-void setExpire(client *c, redisDb *db, robj *key, long long when);
-int checkAlreadyExpired(long long when);
-robj *lookupKey(redisDb *db, robj *key, int flags);
-robj *lookupKeyRead(redisDb *db, robj *key);
-robj *lookupKeyWrite(redisDb *db, robj *key);
-robj *lookupKeyReadOrReply(client *c, robj *key, robj *reply);
-robj *lookupKeyWriteOrReply(client *c, robj *key, robj *reply);
-robj *lookupKeyReadWithFlags(redisDb *db, robj *key, int flags);
-robj *lookupKeyWriteWithFlags(redisDb *db, robj *key, int flags);
-robj *objectCommandLookup(client *c, robj *key);
-robj *objectCommandLookupOrReply(client *c, robj *key, robj *reply);
-void SentReplyOnKeyMiss(client *c, robj *reply);
-int objectSetLRUOrLFU(robj *val, long long lfu_freq, long long lru_idle,
-                       long long lru_clock, int lru_multiplier);
-#define LOOKUP_NONE 0
-#define LOOKUP_NOTOUCH (1<<0)
-#define LOOKUP_NONOTIFY (1<<1)
-void dbAdd(redisDb *db, robj *key, robj *val);
-int dbAddRDBLoad(redisDb *db, sds key, robj *val);
-void dbOverwrite(redisDb *db, robj *key, robj *val);
-void genericSetKey(client *c, redisDb *db, robj *key, robj *val, int keepttl, int signal);
-void setKey(client *c, redisDb *db, robj *key, robj *val);
-robj *dbRandomKey(redisDb *db);
-int dbSyncDelete(redisDb *db, robj *key);
-int dbDelete(redisDb *db, robj *key);
-robj *dbUnshareStringValue(redisDb *db, robj *key, robj *o);
-
-#define EMPTYDB_NO_FLAGS 0      /* No flags. */
-#define EMPTYDB_ASYNC (1<<0)    /* Reclaim memory in another thread. */
-long long emptyDb(int dbnum, int flags, void(callback)(void*));
-long long emptyDbStructure(redisDb *dbarray, int dbnum, int async, void(callback)(void*));
-void flushAllDataAndResetRDB(int flags);
-long long dbTotalServerKeyCount();
-dbBackup *backupDb(void);
-void restoreDbBackup(dbBackup *buckup);
-void discardDbBackup(dbBackup *buckup, int flags, void(callback)(void*));
-
-
-int selectDb(client *c, int id);
-void signalModifiedKey(client *c, redisDb *db, robj *key);
-void signalFlushedDb(int dbid, int async);
-unsigned int getKeysInSlot(unsigned int hashslot, robj **keys, unsigned int count);
-unsigned int countKeysInSlot(unsigned int hashslot);
-unsigned int delKeysInSlot(unsigned int hashslot);
-int verifyClusterConfigWithData(void);
-void scanGenericCommand(client *c, robj *o, unsigned long cursor);
-int parseScanCursorOrReply(client *c, robj *o, unsigned long *cursor);
-void slotToKeyAdd(sds key);
-void slotToKeyDel(sds key);
-int dbAsyncDelete(redisDb *db, robj *key);
-void emptyDbAsync(redisDb *db);
-void slotToKeyFlush(int async);
-size_t lazyfreeGetPendingObjectsCount(void);
-size_t lazyfreeGetFreedObjectsCount(void);
-void freeObjAsync(robj *key, robj *obj);
-void freeSlotsToKeysMapAsync(rax *rt);
-void freeSlotsToKeysMap(rax *rt, int async);
-
-
-/* API to get key arguments from commands */
-int *getKeysPrepareResult(getKeysResult *result, int numkeys);
-int getKeysFromCommand(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-void getKeysFreeResult(getKeysResult *result);
-int zunionInterDiffGetKeys(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result);
-int zunionInterDiffStoreGetKeys(struct redisCommand *cmd,robj **argv, int argc, getKeysResult *result);
-int evalGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int sortGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int migrateGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int georadiusGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int xreadGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int memoryGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-int lcsGetKeys(struct redisCommand *cmd, robj **argv, int argc, getKeysResult *result);
-
-/* Cluster */
-void clusterInit(void);
-unsigned short crc16(const char *buf, int len);
-unsigned int keyHashSlot(char *key, int keylen);
-void clusterCron(void);
-void clusterPropagatePublish(robj *channel, robj *message);
-void migrateCloseTimedoutSockets(void);
-void clusterBeforeSleep(void);
-int clusterSendModuleMessageToTarget(const char *target, uint64_t module_id, uint8_t type, unsigned char *payload, uint32_t len);
-
-/* Sentinel */
-void initSentinelConfig(void);
-void initSentinel(void);
-void sentinelTimer(void);
-const char *sentinelHandleConfiguration(char **argv, int argc);
-void queueSentinelConfig(sds *argv, int argc, int linenum, sds line);
-void loadSentinelConfigFromQueue(void);
-void sentinelIsRunning(void);
-void sentinelCheckConfigFile(void);
-
-/* redis-check-rdb & aof */
-int redis_check_rdb(char *rdbfilename, FILE *fp);
-int redis_check_rdb_main(int argc, char **argv, FILE *fp);
-int redis_check_aof_main(int argc, char **argv);
-
-/* Scripting */
-void scriptingInit(int setup);
-int ldbRemoveChild(pid_t pid);
-void ldbKillForkedSessions(void);
-int ldbPendingChildren(void);
-sds luaCreateFunction(client *c, lua_State *lua, robj *body);
-void freeLuaScriptsAsync(dict *lua_scripts);
-
-/* Blocked clients */
-void processUnblockedClients(void);
-void blockClient(client *c, int btype);
-void unblockClient(client *c);
-void queueClientForReprocessing(client *c);
-void replyToBlockedClientTimedOut(client *c);
-int getTimeoutFromObjectOrReply(client *c, robj *object, mstime_t *timeout, int unit);
-void disconnectAllBlockedClients(void);
-void handleClientsBlockedOnKeys(void);
-void signalKeyAsReady(redisDb *db, robj *key, int type);
-void blockForKeys(client *c, int btype, robj **keys, int numkeys, mstime_t timeout, robj *target, struct listPos *listpos, streamID *ids);
-void updateStatsOnUnblock(client *c, long blocked_us, long reply_us);
-
-/* timeout.c -- Blocked clients timeout and connections timeout. */
-void addClientToTimeoutTable(client *c);
-void removeClientFromTimeoutTable(client *c);
-void handleBlockedClientsTimeout(void);
-int clientsCronHandleTimeout(client *c, mstime_t now_ms);
-
-/* expire.c -- Handling of expired keys */
-void activeExpireCycle(int type);
-void expireSlaveKeys(void);
-void rememberSlaveKeyWithExpire(redisDb *db, robj *key);
-void flushSlaveKeysWithExpireList(void);
-size_t getSlaveKeyWithExpireCount(void);
-
-/* evict.c -- maxmemory handling and LRU eviction. */
-void evictionPoolAlloc(void);
-#define LFU_INIT_VAL 5
-unsigned long LFUGetTimeInMinutes(void);
-uint8_t LFULogIncr(uint8_t value);
-unsigned long LFUDecrAndReturn(robj *o);
-#define EVICT_OK 0
-#define EVICT_RUNNING 1
-#define EVICT_FAIL 2
-int performEvictions(void);
-
-
-/* Keys hashing / comparison functions for dict.c hash tables. */
-uint64_t dictSdsHash(const void *key);
-int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
-void dictSdsDestructor(void *privdata, void *val);
-
-/* Git SHA1 */
-char *redisGitSHA1(void);
-char *redisGitDirty(void);
-uint64_t redisBuildId(void);
-char *redisBuildIdString(void);
-
-/* Commands prototypes */
-void authCommand(client *c);
-void pingCommand(client *c);
-void echoCommand(client *c);
-void commandCommand(client *c);
-void setCommand(client *c);
-void setnxCommand(client *c);
-void setexCommand(client *c);
-void psetexCommand(client *c);
-void getCommand(client *c);
-void getexCommand(client *c);
-void getdelCommand(client *c);
-void delCommand(client *c);
-void unlinkCommand(client *c);
-void existsCommand(client *c);
-void setbitCommand(client *c);
-void getbitCommand(client *c);
-void bitfieldCommand(client *c);
-void bitfieldroCommand(client *c);
-void setrangeCommand(client *c);
-void getrangeCommand(client *c);
-void incrCommand(client *c);
-void decrCommand(client *c);
-void incrbyCommand(client *c);
-void decrbyCommand(client *c);
-void incrbyfloatCommand(client *c);
-void selectCommand(client *c);
-void swapdbCommand(client *c);
-void randomkeyCommand(client *c);
-void keysCommand(client *c);
-void scanCommand(client *c);
-void dbsizeCommand(client *c);
-void lastsaveCommand(client *c);
-void saveCommand(client *c);
-void bgsaveCommand(client *c);
-void bgrewriteaofCommand(client *c);
-void shutdownCommand(client *c);
-void moveCommand(client *c);
-void copyCommand(client *c);
-void renameCommand(client *c);
-void renamenxCommand(client *c);
-void lpushCommand(client *c);
-void rpushCommand(client *c);
-void lpushxCommand(client *c);
-void rpushxCommand(client *c);
-void linsertCommand(client *c);
-void lpopCommand(client *c);
-void rpopCommand(client *c);
-void llenCommand(client *c);
-void lindexCommand(client *c);
-void lrangeCommand(client *c);
-void ltrimCommand(client *c);
-void typeCommand(client *c);
-void lsetCommand(client *c);
-void saddCommand(client *c);
-void sremCommand(client *c);
-void smoveCommand(client *c);
-void sismemberCommand(client *c);
-void smismemberCommand(client *c);
-void scardCommand(client *c);
-void spopCommand(client *c);
-void srandmemberCommand(client *c);
-void sinterCommand(client *c);
-void sinterstoreCommand(client *c);
-void sunionCommand(client *c);
-void sunionstoreCommand(client *c);
-void sdiffCommand(client *c);
-void sdiffstoreCommand(client *c);
-void sscanCommand(client *c);
-void syncCommand(client *c);
-void flushdbCommand(client *c);
-void flushallCommand(client *c);
-void sortCommand(client *c);
-void lremCommand(client *c);
-void lposCommand(client *c);
-void rpoplpushCommand(client *c);
-void lmoveCommand(client *c);
-void infoCommand(client *c);
-void mgetCommand(client *c);
-void monitorCommand(client *c);
-void expireCommand(client *c);
-void expireatCommand(client *c);
-void pexpireCommand(client *c);
-void pexpireatCommand(client *c);
-void getsetCommand(client *c);
-void ttlCommand(client *c);
-void touchCommand(client *c);
-void pttlCommand(client *c);
-void persistCommand(client *c);
-void replicaofCommand(client *c);
-void roleCommand(client *c);
-void debugCommand(client *c);
-void msetCommand(client *c);
-void msetnxCommand(client *c);
-void zaddCommand(client *c);
-void zincrbyCommand(client *c);
-void zrangeCommand(client *c);
-void zrangebyscoreCommand(client *c);
-void zrevrangebyscoreCommand(client *c);
-void zrangebylexCommand(client *c);
-void zrevrangebylexCommand(client *c);
-void zcountCommand(client *c);
-void zlexcountCommand(client *c);
-void zrevrangeCommand(client *c);
-void zcardCommand(client *c);
-void zremCommand(client *c);
-void zscoreCommand(client *c);
-void zmscoreCommand(client *c);
-void zremrangebyscoreCommand(client *c);
-void zremrangebylexCommand(client *c);
-void zpopminCommand(client *c);
-void zpopmaxCommand(client *c);
-void bzpopminCommand(client *c);
-void bzpopmaxCommand(client *c);
-void zrandmemberCommand(client *c);
-void multiCommand(client *c);
-void execCommand(client *c);
-void discardCommand(client *c);
-void blpopCommand(client *c);
-void brpopCommand(client *c);
-void brpoplpushCommand(client *c);
-void blmoveCommand(client *c);
-void appendCommand(client *c);
-void strlenCommand(client *c);
-void zrankCommand(client *c);
-void zrevrankCommand(client *c);
-void hsetCommand(client *c);
-void hsetnxCommand(client *c);
-void hgetCommand(client *c);
-void hmsetCommand(client *c);
-void hmgetCommand(client *c);
-void hdelCommand(client *c);
-void hlenCommand(client *c);
-void hstrlenCommand(client *c);
-void zremrangebyrankCommand(client *c);
-void zunionstoreCommand(client *c);
-void zinterstoreCommand(client *c);
-void zdiffstoreCommand(client *c);
-void zunionCommand(client *c);
-void zinterCommand(client *c);
-void zrangestoreCommand(client *c);
-void zdiffCommand(client *c);
-void zscanCommand(client *c);
-void hkeysCommand(client *c);
-void hvalsCommand(client *c);
-void hgetallCommand(client *c);
-void hexistsCommand(client *c);
-void hscanCommand(client *c);
-void hrandfieldCommand(client *c);
-void configCommand(client *c);
-void hincrbyCommand(client *c);
-void hincrbyfloatCommand(client *c);
-void subscribeCommand(client *c);
-void unsubscribeCommand(client *c);
-void psubscribeCommand(client *c);
-void punsubscribeCommand(client *c);
-void publishCommand(client *c);
-void pubsubCommand(client *c);
-void watchCommand(client *c);
-void unwatchCommand(client *c);
-void clusterCommand(client *c);
-void restoreCommand(client *c);
-void migrateCommand(client *c);
-void askingCommand(client *c);
-void readonlyCommand(client *c);
-void readwriteCommand(client *c);
-void dumpCommand(client *c);
-void objectCommand(client *c);
-void memoryCommand(client *c);
-void clientCommand(client *c);
-void helloCommand(client *c);
-void evalCommand(client *c);
-void evalShaCommand(client *c);
-void scriptCommand(client *c);
-void timeCommand(client *c);
-void bitopCommand(client *c);
-void bitcountCommand(client *c);
-void bitposCommand(client *c);
-void replconfCommand(client *c);
-void waitCommand(client *c);
-void geoencodeCommand(client *c);
-void geodecodeCommand(client *c);
-void georadiusbymemberCommand(client *c);
-void georadiusbymemberroCommand(client *c);
-void georadiusCommand(client *c);
-void georadiusroCommand(client *c);
-void geoaddCommand(client *c);
-void geohashCommand(client *c);
-void geoposCommand(client *c);
-void geodistCommand(client *c);
-void geosearchCommand(client *c);
-void geosearchstoreCommand(client *c);
-void pfselftestCommand(client *c);
-void pfaddCommand(client *c);
-void pfcountCommand(client *c);
-void pfmergeCommand(client *c);
-void pfdebugCommand(client *c);
-void latencyCommand(client *c);
-void moduleCommand(client *c);
-void securityWarningCommand(client *c);
-void xaddCommand(client *c);
-void xrangeCommand(client *c);
-void xrevrangeCommand(client *c);
-void xlenCommand(client *c);
-void xreadCommand(client *c);
-void xgroupCommand(client *c);
-void xsetidCommand(client *c);
-void xackCommand(client *c);
-void xpendingCommand(client *c);
-void xclaimCommand(client *c);
-void xautoclaimCommand(client *c);
-void xinfoCommand(client *c);
-void xdelCommand(client *c);
-void xtrimCommand(client *c);
-void lolwutCommand(client *c);
-void aclCommand(client *c);
-void stralgoCommand(client *c);
-void resetCommand(client *c);
-void failoverCommand(client *c);
-
-#if defined(__GNUC__)
-void *calloc(size_t count, size_t size) __attribute__ ((deprecated));
-void free(void *ptr) __attribute__ ((deprecated));
-void *malloc(size_t size) __attribute__ ((deprecated));
-void *realloc(void *ptr, size_t size) __attribute__ ((deprecated));
-#endif
-
-/* Debugging stuff */
-void _serverAssertWithInfo(const client *c, const robj *o, const char *estr, const char *file, int line);
-void _serverAssert(const char *estr, const char *file, int line);
-#ifdef __GNUC__
-void _serverPanic(const char *file, int line, const char *msg, ...)
-    __attribute__ ((format (printf, 3, 4)));
-#else
-void _serverPanic(const char *file, int line, const char *msg, ...);
-#endif
-void serverLogObjectDebugInfo(const robj *o);
-void sigsegvHandler(int sig, siginfo_t *info, void *secret);
-const char *getSafeInfoString(const char *s, size_t len, char **tmp);
-sds genRedisInfoString(const char *section);
-sds genModulesInfoString(sds info);
-void enableWatchdog(int period);
-void disableWatchdog(void);
-void watchdogScheduleSignal(int period);
-void serverLogHexDump(int level, char *descr, void *value, size_t len);
-int memtest_preserving_test(unsigned long *m, size_t bytes, int passes);
-void mixDigest(unsigned char *digest, void *ptr, size_t len);
-void xorDigest(unsigned char *digest, void *ptr, size_t len);
-int populateCommandTableParseFlags(struct redisCommand *c, char *strflags);
-void debugDelay(int usec);
-void killIOThreads(void);
-void killThreads(void);
-void makeThreadKillable(void);
-
-/* Use macro for checking log level to avoid evaluating arguments in cases log
- * should be ignored due to low level. */
-#define serverLog(level, ...) do {\
-        if (((level)&0xff) < server.verbosity) break;\
-        _serverLog(level, __VA_ARGS__);\
-    } while(0)
-
-/* TLS stuff */
-void tlsInit(void);
-void tlsCleanup(void);
-int tlsConfigure(redisTLSContextConfig *ctx_config);
-
-#define redisDebug(fmt, ...) \
-    printf("DEBUG %s:%d > " fmt "\n", __FILE__, __LINE__, __VA_ARGS__)
-#define redisDebugMark() \
-    printf("-- MARK %s:%d --\n", __FILE__, __LINE__)
-
-int iAmMaster(void);
-
-#endif
diff --git a/redis-stable/src/setcpuaffinity.c b/redis-stable/src/setcpuaffinity.c
deleted file mode 100644
index 77b16210..00000000
--- a/redis-stable/src/setcpuaffinity.c
+++ /dev/null
@@ -1,155 +0,0 @@
-/* ==========================================================================
- * setcpuaffinity.c - Linux/BSD setcpuaffinity.
- * --------------------------------------------------------------------------
- * Copyright (C) 2020  zhenwei pi
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to permit
- * persons to whom the Software is furnished to do so, subject to the
- * following conditions:
- *
- * The above copyright notice and this permission notice shall be included
- * in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
- * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
- * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- * ==========================================================================
- */
-#ifndef _GNU_SOURCE
-#define _GNU_SOURCE
-#endif
-#include <stdlib.h>
-#include <string.h>
-#include <ctype.h>
-#ifdef __linux__
-#include <sched.h>
-#endif
-#ifdef __FreeBSD__
-#include <sys/param.h>
-#include <sys/cpuset.h>
-#endif
-#ifdef __DragonFly__
-#include <pthread.h>
-#include <pthread_np.h>
-#endif
-#ifdef __NetBSD__
-#include <pthread.h>
-#include <sched.h>
-#endif
-#include "config.h"
-
-#ifdef USE_SETCPUAFFINITY
-static const char *next_token(const char *q,  int sep) {
-    if (q)
-        q = strchr(q, sep);
-    if (q)
-        q++;
-
-    return q;
-}
-
-static int next_num(const char *str, char **end, int *result) {
-    if (!str || *str == '\0' || !isdigit(*str))
-        return -1;
-
-    *result = strtoul(str, end, 10);
-    if (str == *end)
-        return -1;
-
-    return 0;
-}
-
-/* set current thread cpu affinity to cpu list, this function works like
- * taskset command (actually cpulist parsing logic reference to util-linux).
- * example of this function: "0,2,3", "0,2-3", "0-20:2". */
-void setcpuaffinity(const char *cpulist) {
-    const char *p, *q;
-    char *end = NULL;
-#ifdef __linux__
-    cpu_set_t cpuset;
-#endif
-#if defined (__FreeBSD__) || defined(__DragonFly__)
-    cpuset_t cpuset;
-#endif
-#ifdef __NetBSD__
-    cpuset_t *cpuset;
-#endif
-
-    if (!cpulist)
-        return;
-
-#ifndef __NetBSD__
-    CPU_ZERO(&cpuset);
-#else
-    cpuset = cpuset_create();
-#endif
-
-    q = cpulist;
-    while (p = q, q = next_token(q, ','), p) {
-        int a, b, s;
-        const char *c1, *c2;
-
-        if (next_num(p, &end, &a) != 0)
-            return;
-
-        b = a;
-        s = 1;
-        p = end;
-
-        c1 = next_token(p, '-');
-        c2 = next_token(p, ',');
-
-        if (c1 != NULL && (c2 == NULL || c1 < c2)) {
-            if (next_num(c1, &end, &b) != 0)
-                return;
-
-            c1 = end && *end ? next_token(end, ':') : NULL;
-            if (c1 != NULL && (c2 == NULL || c1 < c2)) {
-                if (next_num(c1, &end, &s) != 0)
-                    return;
-
-                if (s == 0)
-                    return;
-            }
-        }
-
-        if ((a > b))
-            return;
-
-        while (a <= b) {
-#ifndef __NetBSD__
-            CPU_SET(a, &cpuset);
-#else
-            cpuset_set(a, cpuset);
-#endif
-            a += s;
-        }
-    }
-
-    if (end && *end)
-        return;
-
-#ifdef __linux__
-    sched_setaffinity(0, sizeof(cpuset), &cpuset);
-#endif
-#ifdef __FreeBSD__
-    cpuset_setaffinity(CPU_LEVEL_WHICH, CPU_WHICH_TID, -1, sizeof(cpuset), &cpuset);
-#endif
-#ifdef __DragonFly__
-    pthread_setaffinity_np(pthread_self(), sizeof(cpuset), &cpuset);
-#endif
-#ifdef __NetBSD__
-    pthread_setaffinity_np(pthread_self(), cpuset_size(cpuset), cpuset);
-    cpuset_destroy(cpuset);
-#endif
-}
-
-#endif /* USE_SETCPUAFFINITY */
diff --git a/redis-stable/src/setproctitle.c b/redis-stable/src/setproctitle.c
deleted file mode 100644
index 01940234..00000000
--- a/redis-stable/src/setproctitle.c
+++ /dev/null
@@ -1,331 +0,0 @@
-/* ==========================================================================
- * setproctitle.c - Linux/Darwin setproctitle.
- * --------------------------------------------------------------------------
- * Copyright (C) 2010  William Ahern
- * Copyright (C) 2013  Salvatore Sanfilippo
- * Copyright (C) 2013  Stam He
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to permit
- * persons to whom the Software is furnished to do so, subject to the
- * following conditions:
- *
- * The above copyright notice and this permission notice shall be included
- * in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
- * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
- * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- * ==========================================================================
- */
-#ifndef _GNU_SOURCE
-#define _GNU_SOURCE
-#endif
-
-#include <stddef.h>	/* NULL size_t */
-#include <stdarg.h>	/* va_list va_start va_end */
-#include <stdlib.h>	/* malloc(3) setenv(3) clearenv(3) setproctitle(3) getprogname(3) */
-#include <stdio.h>	/* vsnprintf(3) snprintf(3) */
-
-#include <string.h>	/* strlen(3) strchr(3) strdup(3) memset(3) memcpy(3) */
-
-#include <errno.h>	/* errno program_invocation_name program_invocation_short_name */
-
-#if !defined(HAVE_SETPROCTITLE)
-#if (defined __NetBSD__ || defined __FreeBSD__ || defined __OpenBSD__ || defined __DragonFly__)
-#define HAVE_SETPROCTITLE 1
-#else
-#define HAVE_SETPROCTITLE 0
-#endif
-#endif
-
-
-#if !HAVE_SETPROCTITLE
-#if (defined __linux || defined __APPLE__)
-
-#ifdef __GLIBC__
-#define HAVE_CLEARENV
-#endif
-
-extern char **environ;
-
-static struct {
-	/* original value */
-	const char *arg0;
-
-	/* title space available */
-	char *base, *end;
-
-	 /* pointer to original nul character within base */
-	char *nul;
-
-	_Bool reset;
-	int error;
-} SPT;
-
-
-#ifndef SPT_MIN
-#define SPT_MIN(a, b) (((a) < (b))? (a) : (b))
-#endif
-
-static inline size_t spt_min(size_t a, size_t b) {
-	return SPT_MIN(a, b);
-} /* spt_min() */
-
-
-/*
- * For discussion on the portability of the various methods, see
- * http://lists.freebsd.org/pipermail/freebsd-stable/2008-June/043136.html
- */
-int spt_clearenv(void) {
-#ifdef HAVE_CLEARENV
-	return clearenv();
-#else
-	extern char **environ;
-	static char **tmp;
-
-	if (!(tmp = malloc(sizeof *tmp)))
-		return errno;
-
-	tmp[0]  = NULL;
-	environ = tmp;
-
-	return 0;
-#endif
-} /* spt_clearenv() */
-
-
-static int spt_copyenv(int envc, char *oldenv[]) {
-	extern char **environ;
-	char **envcopy = NULL;
-	char *eq;
-	int i, error;
-	int envsize;
-
-	if (environ != oldenv)
-		return 0;
-
-	/* Copy environ into envcopy before clearing it. Shallow copy is
-	 * enough as clearenv() only clears the environ array.
-	 */
-	envsize = (envc + 1) * sizeof(char *);
-	envcopy = malloc(envsize);
-	if (!envcopy)
-		return ENOMEM;
-	memcpy(envcopy, oldenv, envsize);
-
-	/* Note that the state after clearenv() failure is undefined, but we'll
-	 * just assume an error means it was left unchanged.
-	 */
-	if ((error = spt_clearenv())) {
-		environ = oldenv;
-		free(envcopy);
-		return error;
-	}
-
-	/* Set environ from envcopy */
-	for (i = 0; envcopy[i]; i++) {
-		if (!(eq = strchr(envcopy[i], '=')))
-			continue;
-
-		*eq = '\0';
-		error = (0 != setenv(envcopy[i], eq + 1, 1))? errno : 0;
-		*eq = '=';
-
-		/* On error, do our best to restore state */
-		if (error) {
-#ifdef HAVE_CLEARENV
-			/* We don't assume it is safe to free environ, so we
-			 * may leak it. As clearenv() was shallow using envcopy
-			 * here is safe.
-			 */
-			environ = envcopy;
-#else
-			free(envcopy);
-			free(environ);  /* Safe to free, we have just alloc'd it */
-			environ = oldenv;
-#endif
-			return error;
-		}
-	}
-
-	free(envcopy);
-	return 0;
-} /* spt_copyenv() */
-
-
-static int spt_copyargs(int argc, char *argv[]) {
-	char *tmp;
-	int i;
-
-	for (i = 1; i < argc || (i >= argc && argv[i]); i++) {
-		if (!argv[i])
-			continue;
-
-		if (!(tmp = strdup(argv[i])))
-			return errno;
-
-		argv[i] = tmp;
-	}
-
-	return 0;
-} /* spt_copyargs() */
-
-/* Initialize and populate SPT to allow a future setproctitle()
- * call.
- *
- * As setproctitle() basically needs to overwrite argv[0], we're
- * trying to determine what is the largest contiguous block
- * starting at argv[0] we can use for this purpose.
- *
- * As this range will overwrite some or all of the argv and environ
- * strings, a deep copy of these two arrays is performed.
- */
-void spt_init(int argc, char *argv[]) {
-        char **envp = environ;
-	char *base, *end, *nul, *tmp;
-	int i, error, envc;
-
-	if (!(base = argv[0]))
-		return;
-
-	/* We start with end pointing at the end of argv[0] */
-	nul = &base[strlen(base)];
-	end = nul + 1;
-
-	/* Attempt to extend end as far as we can, while making sure
-	 * that the range between base and end is only allocated to
-	 * argv, or anything that immediately follows argv (presumably
-	 * envp).
-	 */
-	for (i = 0; i < argc || (i >= argc && argv[i]); i++) {
-		if (!argv[i] || argv[i] < end)
-			continue;
-
-		if (end >= argv[i] && end <= argv[i] + strlen(argv[i]))
-			end = argv[i] + strlen(argv[i]) + 1;
-	}
-
-	/* In case the envp array was not an immediate extension to argv,
-	 * scan it explicitly.
-	 */
-	for (i = 0; envp[i]; i++) {
-		if (envp[i] < end)
-			continue;
-
-		if (end >= envp[i] && end <= envp[i] + strlen(envp[i]))
-			end = envp[i] + strlen(envp[i]) + 1;
-	}
-	envc = i;
-
-	/* We're going to deep copy argv[], but argv[0] will still point to
-	 * the old memory for the purpose of updating the title so we need
-	 * to keep the original value elsewhere.
-	 */
-	if (!(SPT.arg0 = strdup(argv[0])))
-		goto syerr;
-
-#if __linux__
-	if (!(tmp = strdup(program_invocation_name)))
-		goto syerr;
-
-	program_invocation_name = tmp;
-
-	if (!(tmp = strdup(program_invocation_short_name)))
-		goto syerr;
-
-	program_invocation_short_name = tmp;
-#elif __APPLE__
-	if (!(tmp = strdup(getprogname())))
-		goto syerr;
-
-	setprogname(tmp);
-#endif
-
-    /* Now make a full deep copy of the environment and argv[] */
-	if ((error = spt_copyenv(envc, envp)))
-		goto error;
-
-	if ((error = spt_copyargs(argc, argv)))
-		goto error;
-
-	SPT.nul  = nul;
-	SPT.base = base;
-	SPT.end  = end;
-
-	return;
-syerr:
-	error = errno;
-error:
-	SPT.error = error;
-} /* spt_init() */
-
-
-#ifndef SPT_MAXTITLE
-#define SPT_MAXTITLE 255
-#endif
-
-void setproctitle(const char *fmt, ...) {
-	char buf[SPT_MAXTITLE + 1]; /* use buffer in case argv[0] is passed */
-	va_list ap;
-	char *nul;
-	int len, error;
-
-	if (!SPT.base)
-		return;
-
-	if (fmt) {
-		va_start(ap, fmt);
-		len = vsnprintf(buf, sizeof buf, fmt, ap);
-		va_end(ap);
-	} else {
-		len = snprintf(buf, sizeof buf, "%s", SPT.arg0);
-	}
-
-	if (len <= 0)
-		{ error = errno; goto error; }
-
-	if (!SPT.reset) {
-		memset(SPT.base, 0, SPT.end - SPT.base);
-		SPT.reset = 1;
-	} else {
-		memset(SPT.base, 0, spt_min(sizeof buf, SPT.end - SPT.base));
-	}
-
-	len = spt_min(len, spt_min(sizeof buf, SPT.end - SPT.base) - 1);
-	memcpy(SPT.base, buf, len);
-	nul = &SPT.base[len];
-
-	if (nul < SPT.nul) {
-		*SPT.nul = '.';
-	} else if (nul == SPT.nul && &nul[1] < SPT.end) {
-		*SPT.nul = ' ';
-		*++nul = '\0';
-	}
-
-	return;
-error:
-	SPT.error = error;
-} /* setproctitle() */
-
-
-#endif /* __linux || __APPLE__ */
-#endif /* !HAVE_SETPROCTITLE */
-
-#ifdef SETPROCTITLE_TEST_MAIN
-int main(int argc, char *argv[]) {
-	spt_init(argc, argv);
-
-	printf("SPT.arg0: [%p] '%s'\n", SPT.arg0, SPT.arg0);
-	printf("SPT.base: [%p] '%s'\n", SPT.base, SPT.base);
-	printf("SPT.end: [%p] (%d bytes after base)'\n", SPT.end, (int) (SPT.end - SPT.base));
-	return 0;
-}
-#endif
diff --git a/redis-stable/src/sha1.c b/redis-stable/src/sha1.c
deleted file mode 100644
index f2423c05..00000000
--- a/redis-stable/src/sha1.c
+++ /dev/null
@@ -1,228 +0,0 @@
-
-/* from valgrind tests */
-
-/* ================ sha1.c ================ */
-/*
-SHA-1 in C
-By Steve Reid <steve@edmweb.com>
-100% Public Domain
-
-Test Vectors (from FIPS PUB 180-1)
-"abc"
-  A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
-"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
-  84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
-A million repetitions of "a"
-  34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
-*/
-
-/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */
-/* #define SHA1HANDSOFF * Copies data before messing with it. */
-
-#define SHA1HANDSOFF
-
-#include <stdio.h>
-#include <string.h>
-#include <stdint.h>
-#include "solarisfixes.h"
-#include "sha1.h"
-#include "config.h"
-
-#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
-
-/* blk0() and blk() perform the initial expand. */
-/* I got the idea of expanding during the round function from SSLeay */
-#if BYTE_ORDER == LITTLE_ENDIAN
-#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
-    |(rol(block->l[i],8)&0x00FF00FF))
-#elif BYTE_ORDER == BIG_ENDIAN
-#define blk0(i) block->l[i]
-#else
-#error "Endianness not defined!"
-#endif
-#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
-    ^block->l[(i+2)&15]^block->l[i&15],1))
-
-/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
-#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
-#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
-#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
-
-
-/* Hash a single 512-bit block. This is the core of the algorithm. */
-
-void SHA1Transform(uint32_t state[5], const unsigned char buffer[64])
-{
-    uint32_t a, b, c, d, e;
-    typedef union {
-        unsigned char c[64];
-        uint32_t l[16];
-    } CHAR64LONG16;
-#ifdef SHA1HANDSOFF
-    CHAR64LONG16 block[1];  /* use array to appear as a pointer */
-    memcpy(block, buffer, 64);
-#else
-    /* The following had better never be used because it causes the
-     * pointer-to-const buffer to be cast into a pointer to non-const.
-     * And the result is written through.  I threw a "const" in, hoping
-     * this will cause a diagnostic.
-     */
-    CHAR64LONG16* block = (const CHAR64LONG16*)buffer;
-#endif
-    /* Copy context->state[] to working vars */
-    a = state[0];
-    b = state[1];
-    c = state[2];
-    d = state[3];
-    e = state[4];
-    /* 4 rounds of 20 operations each. Loop unrolled. */
-    R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
-    R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
-    R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
-    R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
-    R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
-    R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
-    R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
-    R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
-    R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
-    R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
-    R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
-    R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
-    R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
-    R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
-    R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
-    R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
-    R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
-    R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
-    R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
-    R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
-    /* Add the working vars back into context.state[] */
-    state[0] += a;
-    state[1] += b;
-    state[2] += c;
-    state[3] += d;
-    state[4] += e;
-    /* Wipe variables */
-    a = b = c = d = e = 0;
-#ifdef SHA1HANDSOFF
-    memset(block, '\0', sizeof(block));
-#endif
-}
-
-
-/* SHA1Init - Initialize new context */
-
-void SHA1Init(SHA1_CTX* context)
-{
-    /* SHA1 initialization constants */
-    context->state[0] = 0x67452301;
-    context->state[1] = 0xEFCDAB89;
-    context->state[2] = 0x98BADCFE;
-    context->state[3] = 0x10325476;
-    context->state[4] = 0xC3D2E1F0;
-    context->count[0] = context->count[1] = 0;
-}
-
-
-/* Run your data through this. */
-
-void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len)
-{
-    uint32_t i, j;
-
-    j = context->count[0];
-    if ((context->count[0] += len << 3) < j)
-        context->count[1]++;
-    context->count[1] += (len>>29);
-    j = (j >> 3) & 63;
-    if ((j + len) > 63) {
-        memcpy(&context->buffer[j], data, (i = 64-j));
-        SHA1Transform(context->state, context->buffer);
-        for ( ; i + 63 < len; i += 64) {
-            SHA1Transform(context->state, &data[i]);
-        }
-        j = 0;
-    }
-    else i = 0;
-    memcpy(&context->buffer[j], &data[i], len - i);
-}
-
-
-/* Add padding and return the message digest. */
-
-void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
-{
-    unsigned i;
-    unsigned char finalcount[8];
-    unsigned char c;
-
-#if 0	/* untested "improvement" by DHR */
-    /* Convert context->count to a sequence of bytes
-     * in finalcount.  Second element first, but
-     * big-endian order within element.
-     * But we do it all backwards.
-     */
-    unsigned char *fcp = &finalcount[8];
-
-    for (i = 0; i < 2; i++)
-       {
-        uint32_t t = context->count[i];
-        int j;
-
-        for (j = 0; j < 4; t >>= 8, j++)
-	          *--fcp = (unsigned char) t;
-    }
-#else
-    for (i = 0; i < 8; i++) {
-        finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
-         >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
-    }
-#endif
-    c = 0200;
-    SHA1Update(context, &c, 1);
-    while ((context->count[0] & 504) != 448) {
-	c = 0000;
-        SHA1Update(context, &c, 1);
-    }
-    SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
-    for (i = 0; i < 20; i++) {
-        digest[i] = (unsigned char)
-         ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
-    }
-    /* Wipe variables */
-    memset(context, '\0', sizeof(*context));
-    memset(&finalcount, '\0', sizeof(finalcount));
-}
-/* ================ end of sha1.c ================ */
-
-#ifdef REDIS_TEST
-#define BUFSIZE 4096
-
-#define UNUSED(x) (void)(x)
-int sha1Test(int argc, char **argv, int accurate)
-{
-    SHA1_CTX ctx;
-    unsigned char hash[20], buf[BUFSIZE];
-    int i;
-
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    for(i=0;i<BUFSIZE;i++)
-        buf[i] = i;
-
-    SHA1Init(&ctx);
-    for(i=0;i<1000;i++)
-        SHA1Update(&ctx, buf, BUFSIZE);
-    SHA1Final(hash, &ctx);
-
-    printf("SHA1=");
-    for(i=0;i<20;i++)
-        printf("%02x", hash[i]);
-    printf("\n");
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/sha1.h b/redis-stable/src/sha1.h
deleted file mode 100644
index 9056f864..00000000
--- a/redis-stable/src/sha1.h
+++ /dev/null
@@ -1,24 +0,0 @@
-#ifndef SHA1_H
-#define SHA1_H
-/* ================ sha1.h ================ */
-/*
-SHA-1 in C
-By Steve Reid <steve@edmweb.com>
-100% Public Domain
-*/
-
-typedef struct {
-    uint32_t state[5];
-    uint32_t count[2];
-    unsigned char buffer[64];
-} SHA1_CTX;
-
-void SHA1Transform(uint32_t state[5], const unsigned char buffer[64]);
-void SHA1Init(SHA1_CTX* context);
-void SHA1Update(SHA1_CTX* context, const unsigned char* data, uint32_t len);
-void SHA1Final(unsigned char digest[20], SHA1_CTX* context);
-
-#ifdef REDIS_TEST
-int sha1Test(int argc, char **argv, int accurate);
-#endif
-#endif
diff --git a/redis-stable/src/sha256.c b/redis-stable/src/sha256.c
deleted file mode 100644
index d644d2d4..00000000
--- a/redis-stable/src/sha256.c
+++ /dev/null
@@ -1,158 +0,0 @@
-/*********************************************************************
-* Filename:   sha256.c
-* Author:     Brad Conte (brad AT bradconte.com)
-* Copyright:
-* Disclaimer: This code is presented "as is" without any guarantees.
-* Details:    Implementation of the SHA-256 hashing algorithm.
-              SHA-256 is one of the three algorithms in the SHA2
-              specification. The others, SHA-384 and SHA-512, are not
-              offered in this implementation.
-              Algorithm specification can be found here:
-               * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
-              This implementation uses little endian byte order.
-*********************************************************************/
-
-/*************************** HEADER FILES ***************************/
-#include <stdlib.h>
-#include <string.h>
-#include "sha256.h"
-
-/****************************** MACROS ******************************/
-#define ROTLEFT(a,b) (((a) << (b)) | ((a) >> (32-(b))))
-#define ROTRIGHT(a,b) (((a) >> (b)) | ((a) << (32-(b))))
-
-#define CH(x,y,z) (((x) & (y)) ^ (~(x) & (z)))
-#define MAJ(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
-#define EP0(x) (ROTRIGHT(x,2) ^ ROTRIGHT(x,13) ^ ROTRIGHT(x,22))
-#define EP1(x) (ROTRIGHT(x,6) ^ ROTRIGHT(x,11) ^ ROTRIGHT(x,25))
-#define SIG0(x) (ROTRIGHT(x,7) ^ ROTRIGHT(x,18) ^ ((x) >> 3))
-#define SIG1(x) (ROTRIGHT(x,17) ^ ROTRIGHT(x,19) ^ ((x) >> 10))
-
-/**************************** VARIABLES *****************************/
-static const WORD k[64] = {
-	0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5,0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5,
-	0xd807aa98,0x12835b01,0x243185be,0x550c7dc3,0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174,
-	0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc,0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da,
-	0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7,0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967,
-	0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13,0x650a7354,0x766a0abb,0x81c2c92e,0x92722c85,
-	0xa2bfe8a1,0xa81a664b,0xc24b8b70,0xc76c51a3,0xd192e819,0xd6990624,0xf40e3585,0x106aa070,
-	0x19a4c116,0x1e376c08,0x2748774c,0x34b0bcb5,0x391c0cb3,0x4ed8aa4a,0x5b9cca4f,0x682e6ff3,
-	0x748f82ee,0x78a5636f,0x84c87814,0x8cc70208,0x90befffa,0xa4506ceb,0xbef9a3f7,0xc67178f2
-};
-
-/*********************** FUNCTION DEFINITIONS ***********************/
-void sha256_transform(SHA256_CTX *ctx, const BYTE data[])
-{
-	WORD a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
-
-	for (i = 0, j = 0; i < 16; ++i, j += 4)
-		m[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | (data[j + 3]);
-	for ( ; i < 64; ++i)
-		m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(m[i - 15]) + m[i - 16];
-
-	a = ctx->state[0];
-	b = ctx->state[1];
-	c = ctx->state[2];
-	d = ctx->state[3];
-	e = ctx->state[4];
-	f = ctx->state[5];
-	g = ctx->state[6];
-	h = ctx->state[7];
-
-	for (i = 0; i < 64; ++i) {
-		t1 = h + EP1(e) + CH(e,f,g) + k[i] + m[i];
-		t2 = EP0(a) + MAJ(a,b,c);
-		h = g;
-		g = f;
-		f = e;
-		e = d + t1;
-		d = c;
-		c = b;
-		b = a;
-		a = t1 + t2;
-	}
-
-	ctx->state[0] += a;
-	ctx->state[1] += b;
-	ctx->state[2] += c;
-	ctx->state[3] += d;
-	ctx->state[4] += e;
-	ctx->state[5] += f;
-	ctx->state[6] += g;
-	ctx->state[7] += h;
-}
-
-void sha256_init(SHA256_CTX *ctx)
-{
-	ctx->datalen = 0;
-	ctx->bitlen = 0;
-	ctx->state[0] = 0x6a09e667;
-	ctx->state[1] = 0xbb67ae85;
-	ctx->state[2] = 0x3c6ef372;
-	ctx->state[3] = 0xa54ff53a;
-	ctx->state[4] = 0x510e527f;
-	ctx->state[5] = 0x9b05688c;
-	ctx->state[6] = 0x1f83d9ab;
-	ctx->state[7] = 0x5be0cd19;
-}
-
-void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len)
-{
-	WORD i;
-
-	for (i = 0; i < len; ++i) {
-		ctx->data[ctx->datalen] = data[i];
-		ctx->datalen++;
-		if (ctx->datalen == 64) {
-			sha256_transform(ctx, ctx->data);
-			ctx->bitlen += 512;
-			ctx->datalen = 0;
-		}
-	}
-}
-
-void sha256_final(SHA256_CTX *ctx, BYTE hash[])
-{
-	WORD i;
-
-	i = ctx->datalen;
-
-	// Pad whatever data is left in the buffer.
-	if (ctx->datalen < 56) {
-		ctx->data[i++] = 0x80;
-		while (i < 56)
-			ctx->data[i++] = 0x00;
-	}
-	else {
-		ctx->data[i++] = 0x80;
-		while (i < 64)
-			ctx->data[i++] = 0x00;
-		sha256_transform(ctx, ctx->data);
-		memset(ctx->data, 0, 56);
-	}
-
-	// Append to the padding the total message's length in bits and transform.
-	ctx->bitlen += ctx->datalen * 8;
-	ctx->data[63] = ctx->bitlen;
-	ctx->data[62] = ctx->bitlen >> 8;
-	ctx->data[61] = ctx->bitlen >> 16;
-	ctx->data[60] = ctx->bitlen >> 24;
-	ctx->data[59] = ctx->bitlen >> 32;
-	ctx->data[58] = ctx->bitlen >> 40;
-	ctx->data[57] = ctx->bitlen >> 48;
-	ctx->data[56] = ctx->bitlen >> 56;
-	sha256_transform(ctx, ctx->data);
-
-	// Since this implementation uses little endian byte ordering and SHA uses big endian,
-	// reverse all the bytes when copying the final state to the output hash.
-	for (i = 0; i < 4; ++i) {
-		hash[i]      = (ctx->state[0] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 4]  = (ctx->state[1] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 8]  = (ctx->state[2] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 20] = (ctx->state[5] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 24] = (ctx->state[6] >> (24 - i * 8)) & 0x000000ff;
-		hash[i + 28] = (ctx->state[7] >> (24 - i * 8)) & 0x000000ff;
-	}
-}
diff --git a/redis-stable/src/sha256.h b/redis-stable/src/sha256.h
deleted file mode 100644
index dc53ead2..00000000
--- a/redis-stable/src/sha256.h
+++ /dev/null
@@ -1,35 +0,0 @@
-/*********************************************************************
-* Filename:   sha256.h
-* Author:     Brad Conte (brad AT bradconte.com)
-* Copyright:
-* Disclaimer: This code is presented "as is" without any guarantees.
-* Details:    Defines the API for the corresponding SHA1 implementation.
-*********************************************************************/
-
-#ifndef SHA256_H
-#define SHA256_H
-
-/*************************** HEADER FILES ***************************/
-#include <stddef.h>
-#include <stdint.h>
-
-/****************************** MACROS ******************************/
-#define SHA256_BLOCK_SIZE 32            // SHA256 outputs a 32 byte digest
-
-/**************************** DATA TYPES ****************************/
-typedef uint8_t BYTE;   // 8-bit byte
-typedef uint32_t WORD;  // 32-bit word
-
-typedef struct {
-	BYTE data[64];
-	WORD datalen;
-	unsigned long long bitlen;
-	WORD state[8];
-} SHA256_CTX;
-
-/*********************** FUNCTION DECLARATIONS **********************/
-void sha256_init(SHA256_CTX *ctx);
-void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len);
-void sha256_final(SHA256_CTX *ctx, BYTE hash[]);
-
-#endif   // SHA256_H
diff --git a/redis-stable/src/siphash.c b/redis-stable/src/siphash.c
deleted file mode 100644
index 30c15c04..00000000
--- a/redis-stable/src/siphash.c
+++ /dev/null
@@ -1,361 +0,0 @@
-/*
-   SipHash reference C implementation
-
-   Copyright (c) 2012-2016 Jean-Philippe Aumasson
-   <jeanphilippe.aumasson@gmail.com>
-   Copyright (c) 2012-2014 Daniel J. Bernstein <djb@cr.yp.to>
-   Copyright (c) 2017 Salvatore Sanfilippo <antirez@gmail.com>
-
-   To the extent possible under law, the author(s) have dedicated all copyright
-   and related and neighboring rights to this software to the public domain
-   worldwide. This software is distributed without any warranty.
-
-   You should have received a copy of the CC0 Public Domain Dedication along
-   with this software. If not, see
-   <http://creativecommons.org/publicdomain/zero/1.0/>.
-
-   ----------------------------------------------------------------------------
-
-   This version was modified by Salvatore Sanfilippo <antirez@gmail.com>
-   in the following ways:
-
-   1. We use SipHash 1-2. This is not believed to be as strong as the
-      suggested 2-4 variant, but AFAIK there are not trivial attacks
-      against this reduced-rounds version, and it runs at the same speed
-      as Murmurhash2 that we used previously, while the 2-4 variant slowed
-      down Redis by a 4% figure more or less.
-   2. Hard-code rounds in the hope the compiler can optimize it more
-      in this raw from. Anyway we always want the standard 2-4 variant.
-   3. Modify the prototype and implementation so that the function directly
-      returns an uint64_t value, the hash itself, instead of receiving an
-      output buffer. This also means that the output size is set to 8 bytes
-      and the 16 bytes output code handling was removed.
-   4. Provide a case insensitive variant to be used when hashing strings that
-      must be considered identical by the hash table regardless of the case.
-      If we don't have directly a case insensitive hash function, we need to
-      perform a text transformation in some temporary buffer, which is costly.
-   5. Remove debugging code.
-   6. Modified the original test.c file to be a stand-alone function testing
-      the function in the new form (returning an uint64_t) using just the
-      relevant test vector.
- */
-#include <assert.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <string.h>
-#include <ctype.h>
-
-/* Fast tolower() alike function that does not care about locale
- * but just returns a-z instead of A-Z. */
-int siptlw(int c) {
-    if (c >= 'A' && c <= 'Z') {
-        return c+('a'-'A');
-    } else {
-        return c;
-    }
-}
-
-/* Test of the CPU is Little Endian and supports not aligned accesses.
- * Two interesting conditions to speedup the function that happen to be
- * in most of x86 servers. */
-#if defined(__X86_64__) || defined(__x86_64__) || defined (__i386__) \
-	|| defined (__aarch64__) || defined (__arm64__)
-#define UNALIGNED_LE_CPU
-#endif
-
-#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))
-
-#define U32TO8_LE(p, v)                                                        \
-    (p)[0] = (uint8_t)((v));                                                   \
-    (p)[1] = (uint8_t)((v) >> 8);                                              \
-    (p)[2] = (uint8_t)((v) >> 16);                                             \
-    (p)[3] = (uint8_t)((v) >> 24);
-
-#define U64TO8_LE(p, v)                                                        \
-    U32TO8_LE((p), (uint32_t)((v)));                                           \
-    U32TO8_LE((p) + 4, (uint32_t)((v) >> 32));
-
-#ifdef UNALIGNED_LE_CPU
-#define U8TO64_LE(p) (*((uint64_t*)(p)))
-#else
-#define U8TO64_LE(p)                                                           \
-    (((uint64_t)((p)[0])) | ((uint64_t)((p)[1]) << 8) |                        \
-     ((uint64_t)((p)[2]) << 16) | ((uint64_t)((p)[3]) << 24) |                 \
-     ((uint64_t)((p)[4]) << 32) | ((uint64_t)((p)[5]) << 40) |                 \
-     ((uint64_t)((p)[6]) << 48) | ((uint64_t)((p)[7]) << 56))
-#endif
-
-#define U8TO64_LE_NOCASE(p)                                                    \
-    (((uint64_t)(siptlw((p)[0]))) |                                           \
-     ((uint64_t)(siptlw((p)[1])) << 8) |                                      \
-     ((uint64_t)(siptlw((p)[2])) << 16) |                                     \
-     ((uint64_t)(siptlw((p)[3])) << 24) |                                     \
-     ((uint64_t)(siptlw((p)[4])) << 32) |                                              \
-     ((uint64_t)(siptlw((p)[5])) << 40) |                                              \
-     ((uint64_t)(siptlw((p)[6])) << 48) |                                              \
-     ((uint64_t)(siptlw((p)[7])) << 56))
-
-#define SIPROUND                                                               \
-    do {                                                                       \
-        v0 += v1;                                                              \
-        v1 = ROTL(v1, 13);                                                     \
-        v1 ^= v0;                                                              \
-        v0 = ROTL(v0, 32);                                                     \
-        v2 += v3;                                                              \
-        v3 = ROTL(v3, 16);                                                     \
-        v3 ^= v2;                                                              \
-        v0 += v3;                                                              \
-        v3 = ROTL(v3, 21);                                                     \
-        v3 ^= v0;                                                              \
-        v2 += v1;                                                              \
-        v1 = ROTL(v1, 17);                                                     \
-        v1 ^= v2;                                                              \
-        v2 = ROTL(v2, 32);                                                     \
-    } while (0)
-
-uint64_t siphash(const uint8_t *in, const size_t inlen, const uint8_t *k) {
-#ifndef UNALIGNED_LE_CPU
-    uint64_t hash;
-    uint8_t *out = (uint8_t*) &hash;
-#endif
-    uint64_t v0 = 0x736f6d6570736575ULL;
-    uint64_t v1 = 0x646f72616e646f6dULL;
-    uint64_t v2 = 0x6c7967656e657261ULL;
-    uint64_t v3 = 0x7465646279746573ULL;
-    uint64_t k0 = U8TO64_LE(k);
-    uint64_t k1 = U8TO64_LE(k + 8);
-    uint64_t m;
-    const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t));
-    const int left = inlen & 7;
-    uint64_t b = ((uint64_t)inlen) << 56;
-    v3 ^= k1;
-    v2 ^= k0;
-    v1 ^= k1;
-    v0 ^= k0;
-
-    for (; in != end; in += 8) {
-        m = U8TO64_LE(in);
-        v3 ^= m;
-
-        SIPROUND;
-
-        v0 ^= m;
-    }
-
-    switch (left) {
-    case 7: b |= ((uint64_t)in[6]) << 48; /* fall-thru */
-    case 6: b |= ((uint64_t)in[5]) << 40; /* fall-thru */
-    case 5: b |= ((uint64_t)in[4]) << 32; /* fall-thru */
-    case 4: b |= ((uint64_t)in[3]) << 24; /* fall-thru */
-    case 3: b |= ((uint64_t)in[2]) << 16; /* fall-thru */
-    case 2: b |= ((uint64_t)in[1]) << 8; /* fall-thru */
-    case 1: b |= ((uint64_t)in[0]); break;
-    case 0: break;
-    }
-
-    v3 ^= b;
-
-    SIPROUND;
-
-    v0 ^= b;
-    v2 ^= 0xff;
-
-    SIPROUND;
-    SIPROUND;
-
-    b = v0 ^ v1 ^ v2 ^ v3;
-#ifndef UNALIGNED_LE_CPU
-    U64TO8_LE(out, b);
-    return hash;
-#else
-    return b;
-#endif
-}
-
-uint64_t siphash_nocase(const uint8_t *in, const size_t inlen, const uint8_t *k)
-{
-#ifndef UNALIGNED_LE_CPU
-    uint64_t hash;
-    uint8_t *out = (uint8_t*) &hash;
-#endif
-    uint64_t v0 = 0x736f6d6570736575ULL;
-    uint64_t v1 = 0x646f72616e646f6dULL;
-    uint64_t v2 = 0x6c7967656e657261ULL;
-    uint64_t v3 = 0x7465646279746573ULL;
-    uint64_t k0 = U8TO64_LE(k);
-    uint64_t k1 = U8TO64_LE(k + 8);
-    uint64_t m;
-    const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t));
-    const int left = inlen & 7;
-    uint64_t b = ((uint64_t)inlen) << 56;
-    v3 ^= k1;
-    v2 ^= k0;
-    v1 ^= k1;
-    v0 ^= k0;
-
-    for (; in != end; in += 8) {
-        m = U8TO64_LE_NOCASE(in);
-        v3 ^= m;
-
-        SIPROUND;
-
-        v0 ^= m;
-    }
-
-    switch (left) {
-    case 7: b |= ((uint64_t)siptlw(in[6])) << 48; /* fall-thru */
-    case 6: b |= ((uint64_t)siptlw(in[5])) << 40; /* fall-thru */
-    case 5: b |= ((uint64_t)siptlw(in[4])) << 32; /* fall-thru */
-    case 4: b |= ((uint64_t)siptlw(in[3])) << 24; /* fall-thru */
-    case 3: b |= ((uint64_t)siptlw(in[2])) << 16; /* fall-thru */
-    case 2: b |= ((uint64_t)siptlw(in[1])) << 8; /* fall-thru */
-    case 1: b |= ((uint64_t)siptlw(in[0])); break;
-    case 0: break;
-    }
-
-    v3 ^= b;
-
-    SIPROUND;
-
-    v0 ^= b;
-    v2 ^= 0xff;
-
-    SIPROUND;
-    SIPROUND;
-
-    b = v0 ^ v1 ^ v2 ^ v3;
-#ifndef UNALIGNED_LE_CPU
-    U64TO8_LE(out, b);
-    return hash;
-#else
-    return b;
-#endif
-}
-
-
-/* --------------------------------- TEST ------------------------------------ */
-
-#ifdef SIPHASH_TEST
-
-const uint8_t vectors_sip64[64][8] = {
-    { 0x31, 0x0e, 0x0e, 0xdd, 0x47, 0xdb, 0x6f, 0x72, },
-    { 0xfd, 0x67, 0xdc, 0x93, 0xc5, 0x39, 0xf8, 0x74, },
-    { 0x5a, 0x4f, 0xa9, 0xd9, 0x09, 0x80, 0x6c, 0x0d, },
-    { 0x2d, 0x7e, 0xfb, 0xd7, 0x96, 0x66, 0x67, 0x85, },
-    { 0xb7, 0x87, 0x71, 0x27, 0xe0, 0x94, 0x27, 0xcf, },
-    { 0x8d, 0xa6, 0x99, 0xcd, 0x64, 0x55, 0x76, 0x18, },
-    { 0xce, 0xe3, 0xfe, 0x58, 0x6e, 0x46, 0xc9, 0xcb, },
-    { 0x37, 0xd1, 0x01, 0x8b, 0xf5, 0x00, 0x02, 0xab, },
-    { 0x62, 0x24, 0x93, 0x9a, 0x79, 0xf5, 0xf5, 0x93, },
-    { 0xb0, 0xe4, 0xa9, 0x0b, 0xdf, 0x82, 0x00, 0x9e, },
-    { 0xf3, 0xb9, 0xdd, 0x94, 0xc5, 0xbb, 0x5d, 0x7a, },
-    { 0xa7, 0xad, 0x6b, 0x22, 0x46, 0x2f, 0xb3, 0xf4, },
-    { 0xfb, 0xe5, 0x0e, 0x86, 0xbc, 0x8f, 0x1e, 0x75, },
-    { 0x90, 0x3d, 0x84, 0xc0, 0x27, 0x56, 0xea, 0x14, },
-    { 0xee, 0xf2, 0x7a, 0x8e, 0x90, 0xca, 0x23, 0xf7, },
-    { 0xe5, 0x45, 0xbe, 0x49, 0x61, 0xca, 0x29, 0xa1, },
-    { 0xdb, 0x9b, 0xc2, 0x57, 0x7f, 0xcc, 0x2a, 0x3f, },
-    { 0x94, 0x47, 0xbe, 0x2c, 0xf5, 0xe9, 0x9a, 0x69, },
-    { 0x9c, 0xd3, 0x8d, 0x96, 0xf0, 0xb3, 0xc1, 0x4b, },
-    { 0xbd, 0x61, 0x79, 0xa7, 0x1d, 0xc9, 0x6d, 0xbb, },
-    { 0x98, 0xee, 0xa2, 0x1a, 0xf2, 0x5c, 0xd6, 0xbe, },
-    { 0xc7, 0x67, 0x3b, 0x2e, 0xb0, 0xcb, 0xf2, 0xd0, },
-    { 0x88, 0x3e, 0xa3, 0xe3, 0x95, 0x67, 0x53, 0x93, },
-    { 0xc8, 0xce, 0x5c, 0xcd, 0x8c, 0x03, 0x0c, 0xa8, },
-    { 0x94, 0xaf, 0x49, 0xf6, 0xc6, 0x50, 0xad, 0xb8, },
-    { 0xea, 0xb8, 0x85, 0x8a, 0xde, 0x92, 0xe1, 0xbc, },
-    { 0xf3, 0x15, 0xbb, 0x5b, 0xb8, 0x35, 0xd8, 0x17, },
-    { 0xad, 0xcf, 0x6b, 0x07, 0x63, 0x61, 0x2e, 0x2f, },
-    { 0xa5, 0xc9, 0x1d, 0xa7, 0xac, 0xaa, 0x4d, 0xde, },
-    { 0x71, 0x65, 0x95, 0x87, 0x66, 0x50, 0xa2, 0xa6, },
-    { 0x28, 0xef, 0x49, 0x5c, 0x53, 0xa3, 0x87, 0xad, },
-    { 0x42, 0xc3, 0x41, 0xd8, 0xfa, 0x92, 0xd8, 0x32, },
-    { 0xce, 0x7c, 0xf2, 0x72, 0x2f, 0x51, 0x27, 0x71, },
-    { 0xe3, 0x78, 0x59, 0xf9, 0x46, 0x23, 0xf3, 0xa7, },
-    { 0x38, 0x12, 0x05, 0xbb, 0x1a, 0xb0, 0xe0, 0x12, },
-    { 0xae, 0x97, 0xa1, 0x0f, 0xd4, 0x34, 0xe0, 0x15, },
-    { 0xb4, 0xa3, 0x15, 0x08, 0xbe, 0xff, 0x4d, 0x31, },
-    { 0x81, 0x39, 0x62, 0x29, 0xf0, 0x90, 0x79, 0x02, },
-    { 0x4d, 0x0c, 0xf4, 0x9e, 0xe5, 0xd4, 0xdc, 0xca, },
-    { 0x5c, 0x73, 0x33, 0x6a, 0x76, 0xd8, 0xbf, 0x9a, },
-    { 0xd0, 0xa7, 0x04, 0x53, 0x6b, 0xa9, 0x3e, 0x0e, },
-    { 0x92, 0x59, 0x58, 0xfc, 0xd6, 0x42, 0x0c, 0xad, },
-    { 0xa9, 0x15, 0xc2, 0x9b, 0xc8, 0x06, 0x73, 0x18, },
-    { 0x95, 0x2b, 0x79, 0xf3, 0xbc, 0x0a, 0xa6, 0xd4, },
-    { 0xf2, 0x1d, 0xf2, 0xe4, 0x1d, 0x45, 0x35, 0xf9, },
-    { 0x87, 0x57, 0x75, 0x19, 0x04, 0x8f, 0x53, 0xa9, },
-    { 0x10, 0xa5, 0x6c, 0xf5, 0xdf, 0xcd, 0x9a, 0xdb, },
-    { 0xeb, 0x75, 0x09, 0x5c, 0xcd, 0x98, 0x6c, 0xd0, },
-    { 0x51, 0xa9, 0xcb, 0x9e, 0xcb, 0xa3, 0x12, 0xe6, },
-    { 0x96, 0xaf, 0xad, 0xfc, 0x2c, 0xe6, 0x66, 0xc7, },
-    { 0x72, 0xfe, 0x52, 0x97, 0x5a, 0x43, 0x64, 0xee, },
-    { 0x5a, 0x16, 0x45, 0xb2, 0x76, 0xd5, 0x92, 0xa1, },
-    { 0xb2, 0x74, 0xcb, 0x8e, 0xbf, 0x87, 0x87, 0x0a, },
-    { 0x6f, 0x9b, 0xb4, 0x20, 0x3d, 0xe7, 0xb3, 0x81, },
-    { 0xea, 0xec, 0xb2, 0xa3, 0x0b, 0x22, 0xa8, 0x7f, },
-    { 0x99, 0x24, 0xa4, 0x3c, 0xc1, 0x31, 0x57, 0x24, },
-    { 0xbd, 0x83, 0x8d, 0x3a, 0xaf, 0xbf, 0x8d, 0xb7, },
-    { 0x0b, 0x1a, 0x2a, 0x32, 0x65, 0xd5, 0x1a, 0xea, },
-    { 0x13, 0x50, 0x79, 0xa3, 0x23, 0x1c, 0xe6, 0x60, },
-    { 0x93, 0x2b, 0x28, 0x46, 0xe4, 0xd7, 0x06, 0x66, },
-    { 0xe1, 0x91, 0x5f, 0x5c, 0xb1, 0xec, 0xa4, 0x6c, },
-    { 0xf3, 0x25, 0x96, 0x5c, 0xa1, 0x6d, 0x62, 0x9f, },
-    { 0x57, 0x5f, 0xf2, 0x8e, 0x60, 0x38, 0x1b, 0xe5, },
-    { 0x72, 0x45, 0x06, 0xeb, 0x4c, 0x32, 0x8a, 0x95, },
-};
-
-
-/* Test siphash using a test vector. Returns 0 if the function passed
- * all the tests, otherwise 1 is returned.
- *
- * IMPORTANT: The test vector is for SipHash 2-4. Before running
- * the test revert back the siphash() function to 2-4 rounds since
- * now it uses 1-2 rounds. */
-int siphash_test(void) {
-    uint8_t in[64], k[16];
-    int i;
-    int fails = 0;
-
-    for (i = 0; i < 16; ++i)
-        k[i] = i;
-
-    for (i = 0; i < 64; ++i) {
-        in[i] = i;
-        uint64_t hash = siphash(in, i, k);
-        const uint8_t *v = NULL;
-        v = (uint8_t *)vectors_sip64;
-        if (memcmp(&hash, v + (i * 8), 8)) {
-            /* printf("fail for %d bytes\n", i); */
-            fails++;
-        }
-    }
-
-    /* Run a few basic tests with the case insensitive version. */
-    uint64_t h1, h2;
-    h1 = siphash((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
-    h2 = siphash_nocase((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
-    if (h1 != h2) fails++;
-
-    h1 = siphash((uint8_t*)"hello world",11,(uint8_t*)"1234567812345678");
-    h2 = siphash_nocase((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
-    if (h1 != h2) fails++;
-
-    h1 = siphash((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
-    h2 = siphash_nocase((uint8_t*)"HELLO world",11,(uint8_t*)"1234567812345678");
-    if (h1 == h2) fails++;
-
-    if (!fails) return 0;
-    return 1;
-}
-
-int main(void) {
-    if (siphash_test() == 0) {
-        printf("SipHash test: OK\n");
-        return 0;
-    } else {
-        printf("SipHash test: FAILED\n");
-        return 1;
-    }
-}
-
-#endif
diff --git a/redis-stable/src/slowlog.c b/redis-stable/src/slowlog.c
deleted file mode 100644
index b8c13f1c..00000000
--- a/redis-stable/src/slowlog.c
+++ /dev/null
@@ -1,196 +0,0 @@
-/* Slowlog implements a system that is able to remember the latest N
- * queries that took more than M microseconds to execute.
- *
- * The execution time to reach to be logged in the slow log is set
- * using the 'slowlog-log-slower-than' config directive, that is also
- * readable and writable using the CONFIG SET/GET command.
- *
- * The slow queries log is actually not "logged" in the Redis log file
- * but is accessible thanks to the SLOWLOG command.
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "server.h"
-#include "slowlog.h"
-
-/* Create a new slowlog entry.
- * Incrementing the ref count of all the objects retained is up to
- * this function. */
-slowlogEntry *slowlogCreateEntry(client *c, robj **argv, int argc, long long duration) {
-    slowlogEntry *se = zmalloc(sizeof(*se));
-    int j, slargc = argc;
-
-    if (slargc > SLOWLOG_ENTRY_MAX_ARGC) slargc = SLOWLOG_ENTRY_MAX_ARGC;
-    se->argc = slargc;
-    se->argv = zmalloc(sizeof(robj*)*slargc);
-    for (j = 0; j < slargc; j++) {
-        /* Logging too many arguments is a useless memory waste, so we stop
-         * at SLOWLOG_ENTRY_MAX_ARGC, but use the last argument to specify
-         * how many remaining arguments there were in the original command. */
-        if (slargc != argc && j == slargc-1) {
-            se->argv[j] = createObject(OBJ_STRING,
-                sdscatprintf(sdsempty(),"... (%d more arguments)",
-                argc-slargc+1));
-        } else {
-            /* Trim too long strings as well... */
-            if (argv[j]->type == OBJ_STRING &&
-                sdsEncodedObject(argv[j]) &&
-                sdslen(argv[j]->ptr) > SLOWLOG_ENTRY_MAX_STRING)
-            {
-                sds s = sdsnewlen(argv[j]->ptr, SLOWLOG_ENTRY_MAX_STRING);
-
-                s = sdscatprintf(s,"... (%lu more bytes)",
-                    (unsigned long)
-                    sdslen(argv[j]->ptr) - SLOWLOG_ENTRY_MAX_STRING);
-                se->argv[j] = createObject(OBJ_STRING,s);
-            } else if (argv[j]->refcount == OBJ_SHARED_REFCOUNT) {
-                se->argv[j] = argv[j];
-            } else {
-                /* Here we need to duplicate the string objects composing the
-                 * argument vector of the command, because those may otherwise
-                 * end shared with string objects stored into keys. Having
-                 * shared objects between any part of Redis, and the data
-                 * structure holding the data, is a problem: FLUSHALL ASYNC
-                 * may release the shared string object and create a race. */
-                se->argv[j] = dupStringObject(argv[j]);
-            }
-        }
-    }
-    se->time = time(NULL);
-    se->duration = duration;
-    se->id = server.slowlog_entry_id++;
-    se->peerid = sdsnew(getClientPeerId(c));
-    se->cname = c->name ? sdsnew(c->name->ptr) : sdsempty();
-    return se;
-}
-
-/* Free a slow log entry. The argument is void so that the prototype of this
- * function matches the one of the 'free' method of adlist.c.
- *
- * This function will take care to release all the retained object. */
-void slowlogFreeEntry(void *septr) {
-    slowlogEntry *se = septr;
-    int j;
-
-    for (j = 0; j < se->argc; j++)
-        decrRefCount(se->argv[j]);
-    zfree(se->argv);
-    sdsfree(se->peerid);
-    sdsfree(se->cname);
-    zfree(se);
-}
-
-/* Initialize the slow log. This function should be called a single time
- * at server startup. */
-void slowlogInit(void) {
-    server.slowlog = listCreate();
-    server.slowlog_entry_id = 0;
-    listSetFreeMethod(server.slowlog,slowlogFreeEntry);
-}
-
-/* Push a new entry into the slow log.
- * This function will make sure to trim the slow log accordingly to the
- * configured max length. */
-void slowlogPushEntryIfNeeded(client *c, robj **argv, int argc, long long duration) {
-    if (server.slowlog_log_slower_than < 0) return; /* Slowlog disabled */
-    if (duration >= server.slowlog_log_slower_than)
-        listAddNodeHead(server.slowlog,
-                        slowlogCreateEntry(c,argv,argc,duration));
-
-    /* Remove old entries if needed. */
-    while (listLength(server.slowlog) > server.slowlog_max_len)
-        listDelNode(server.slowlog,listLast(server.slowlog));
-}
-
-/* Remove all the entries from the current slow log. */
-void slowlogReset(void) {
-    while (listLength(server.slowlog) > 0)
-        listDelNode(server.slowlog,listLast(server.slowlog));
-}
-
-/* The SLOWLOG command. Implements all the subcommands needed to handle the
- * Redis slow log. */
-void slowlogCommand(client *c) {
-    if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"help")) {
-        const char *help[] = {
-"GET [<count>]",
-"    Return top <count> entries from the slowlog (default: 10). Entries are",
-"    made of:",
-"    id, timestamp, time in microseconds, arguments array, client IP and port,",
-"    client name",
-"LEN",
-"    Return the length of the slowlog.",
-"RESET",
-"    Reset the slowlog.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"reset")) {
-        slowlogReset();
-        addReply(c,shared.ok);
-    } else if (c->argc == 2 && !strcasecmp(c->argv[1]->ptr,"len")) {
-        addReplyLongLong(c,listLength(server.slowlog));
-    } else if ((c->argc == 2 || c->argc == 3) &&
-               !strcasecmp(c->argv[1]->ptr,"get"))
-    {
-        long count = 10, sent = 0;
-        listIter li;
-        void *totentries;
-        listNode *ln;
-        slowlogEntry *se;
-
-        if (c->argc == 3 &&
-            getLongFromObjectOrReply(c,c->argv[2],&count,NULL) != C_OK)
-            return;
-
-        listRewind(server.slowlog,&li);
-        totentries = addReplyDeferredLen(c);
-        while(count-- && (ln = listNext(&li))) {
-            int j;
-
-            se = ln->value;
-            addReplyArrayLen(c,6);
-            addReplyLongLong(c,se->id);
-            addReplyLongLong(c,se->time);
-            addReplyLongLong(c,se->duration);
-            addReplyArrayLen(c,se->argc);
-            for (j = 0; j < se->argc; j++)
-                addReplyBulk(c,se->argv[j]);
-            addReplyBulkCBuffer(c,se->peerid,sdslen(se->peerid));
-            addReplyBulkCBuffer(c,se->cname,sdslen(se->cname));
-            sent++;
-        }
-        setDeferredArrayLen(c,totentries,sent);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
diff --git a/redis-stable/src/slowlog.h b/redis-stable/src/slowlog.h
deleted file mode 100644
index 50e54389..00000000
--- a/redis-stable/src/slowlog.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __SLOWLOG_H__
-#define __SLOWLOG_H__
-
-#define SLOWLOG_ENTRY_MAX_ARGC 32
-#define SLOWLOG_ENTRY_MAX_STRING 128
-
-/* This structure defines an entry inside the slow log list */
-typedef struct slowlogEntry {
-    robj **argv;
-    int argc;
-    long long id;       /* Unique entry identifier. */
-    long long duration; /* Time spent by the query, in microseconds. */
-    time_t time;        /* Unix time at which the query was executed. */
-    sds cname;          /* Client name. */
-    sds peerid;         /* Client network address. */
-} slowlogEntry;
-
-/* Exported API */
-void slowlogInit(void);
-void slowlogPushEntryIfNeeded(client *c, robj **argv, int argc, long long duration);
-
-/* Exported commands */
-void slowlogCommand(client *c);
-
-#endif /* __SLOWLOG_H__ */
diff --git a/redis-stable/src/solarisfixes.h b/redis-stable/src/solarisfixes.h
deleted file mode 100644
index 3e53ba67..00000000
--- a/redis-stable/src/solarisfixes.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/* Solaris specific fixes.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#if defined(__sun)
-
-#if defined(__GNUC__)
-#include <math.h>
-#undef isnan
-#define isnan(x) \
-     __extension__({ __typeof (x) __x_a = (x); \
-     __builtin_expect(__x_a != __x_a, 0); })
-
-#undef isfinite
-#define isfinite(x) \
-     __extension__ ({ __typeof (x) __x_f = (x); \
-     __builtin_expect(!isnan(__x_f - __x_f), 1); })
-
-#undef isinf
-#define isinf(x) \
-     __extension__ ({ __typeof (x) __x_i = (x); \
-     __builtin_expect(!isnan(__x_i) && !isfinite(__x_i), 0); })
-
-#define u_int uint
-#define u_int32_t uint32_t
-#endif /* __GNUC__ */
-
-#endif /* __sun */
diff --git a/redis-stable/src/sort.c b/redis-stable/src/sort.c
deleted file mode 100644
index 3b67cc63..00000000
--- a/redis-stable/src/sort.c
+++ /dev/null
@@ -1,597 +0,0 @@
-/* SORT command and helper functions.
- *
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "server.h"
-#include "pqsort.h" /* Partial qsort for SORT+LIMIT */
-#include <math.h> /* isnan() */
-
-zskiplistNode* zslGetElementByRank(zskiplist *zsl, unsigned long rank);
-
-redisSortOperation *createSortOperation(int type, robj *pattern) {
-    redisSortOperation *so = zmalloc(sizeof(*so));
-    so->type = type;
-    so->pattern = pattern;
-    return so;
-}
-
-/* Return the value associated to the key with a name obtained using
- * the following rules:
- *
- * 1) The first occurrence of '*' in 'pattern' is substituted with 'subst'.
- *
- * 2) If 'pattern' matches the "->" string, everything on the left of
- *    the arrow is treated as the name of a hash field, and the part on the
- *    left as the key name containing a hash. The value of the specified
- *    field is returned.
- *
- * 3) If 'pattern' equals "#", the function simply returns 'subst' itself so
- *    that the SORT command can be used like: SORT key GET # to retrieve
- *    the Set/List elements directly.
- *
- * The returned object will always have its refcount increased by 1
- * when it is non-NULL. */
-robj *lookupKeyByPattern(redisDb *db, robj *pattern, robj *subst, int writeflag) {
-    char *p, *f, *k;
-    sds spat, ssub;
-    robj *keyobj, *fieldobj = NULL, *o;
-    int prefixlen, sublen, postfixlen, fieldlen;
-
-    /* If the pattern is "#" return the substitution object itself in order
-     * to implement the "SORT ... GET #" feature. */
-    spat = pattern->ptr;
-    if (spat[0] == '#' && spat[1] == '\0') {
-        incrRefCount(subst);
-        return subst;
-    }
-
-    /* The substitution object may be specially encoded. If so we create
-     * a decoded object on the fly. Otherwise getDecodedObject will just
-     * increment the ref count, that we'll decrement later. */
-    subst = getDecodedObject(subst);
-    ssub = subst->ptr;
-
-    /* If we can't find '*' in the pattern we return NULL as to GET a
-     * fixed key does not make sense. */
-    p = strchr(spat,'*');
-    if (!p) {
-        decrRefCount(subst);
-        return NULL;
-    }
-
-    /* Find out if we're dealing with a hash dereference. */
-    if ((f = strstr(p+1, "->")) != NULL && *(f+2) != '\0') {
-        fieldlen = sdslen(spat)-(f-spat)-2;
-        fieldobj = createStringObject(f+2,fieldlen);
-    } else {
-        fieldlen = 0;
-    }
-
-    /* Perform the '*' substitution. */
-    prefixlen = p-spat;
-    sublen = sdslen(ssub);
-    postfixlen = sdslen(spat)-(prefixlen+1)-(fieldlen ? fieldlen+2 : 0);
-    keyobj = createStringObject(NULL,prefixlen+sublen+postfixlen);
-    k = keyobj->ptr;
-    memcpy(k,spat,prefixlen);
-    memcpy(k+prefixlen,ssub,sublen);
-    memcpy(k+prefixlen+sublen,p+1,postfixlen);
-    decrRefCount(subst); /* Incremented by decodeObject() */
-
-    /* Lookup substituted key */
-    if (!writeflag)
-        o = lookupKeyRead(db,keyobj);
-    else
-        o = lookupKeyWrite(db,keyobj);
-    if (o == NULL) goto noobj;
-
-    if (fieldobj) {
-        if (o->type != OBJ_HASH) goto noobj;
-
-        /* Retrieve value from hash by the field name. The returned object
-         * is a new object with refcount already incremented. */
-        o = hashTypeGetValueObject(o, fieldobj->ptr);
-    } else {
-        if (o->type != OBJ_STRING) goto noobj;
-
-        /* Every object that this function returns needs to have its refcount
-         * increased. sortCommand decreases it again. */
-        incrRefCount(o);
-    }
-    decrRefCount(keyobj);
-    if (fieldobj) decrRefCount(fieldobj);
-    return o;
-
-noobj:
-    decrRefCount(keyobj);
-    if (fieldlen) decrRefCount(fieldobj);
-    return NULL;
-}
-
-/* sortCompare() is used by qsort in sortCommand(). Given that qsort_r with
- * the additional parameter is not standard but a BSD-specific we have to
- * pass sorting parameters via the global 'server' structure */
-int sortCompare(const void *s1, const void *s2) {
-    const redisSortObject *so1 = s1, *so2 = s2;
-    int cmp;
-
-    if (!server.sort_alpha) {
-        /* Numeric sorting. Here it's trivial as we precomputed scores */
-        if (so1->u.score > so2->u.score) {
-            cmp = 1;
-        } else if (so1->u.score < so2->u.score) {
-            cmp = -1;
-        } else {
-            /* Objects have the same score, but we don't want the comparison
-             * to be undefined, so we compare objects lexicographically.
-             * This way the result of SORT is deterministic. */
-            cmp = compareStringObjects(so1->obj,so2->obj);
-        }
-    } else {
-        /* Alphanumeric sorting */
-        if (server.sort_bypattern) {
-            if (!so1->u.cmpobj || !so2->u.cmpobj) {
-                /* At least one compare object is NULL */
-                if (so1->u.cmpobj == so2->u.cmpobj)
-                    cmp = 0;
-                else if (so1->u.cmpobj == NULL)
-                    cmp = -1;
-                else
-                    cmp = 1;
-            } else {
-                /* We have both the objects, compare them. */
-                if (server.sort_store) {
-                    cmp = compareStringObjects(so1->u.cmpobj,so2->u.cmpobj);
-                } else {
-                    /* Here we can use strcoll() directly as we are sure that
-                     * the objects are decoded string objects. */
-                    cmp = strcoll(so1->u.cmpobj->ptr,so2->u.cmpobj->ptr);
-                }
-            }
-        } else {
-            /* Compare elements directly. */
-            if (server.sort_store) {
-                cmp = compareStringObjects(so1->obj,so2->obj);
-            } else {
-                cmp = collateStringObjects(so1->obj,so2->obj);
-            }
-        }
-    }
-    return server.sort_desc ? -cmp : cmp;
-}
-
-/* The SORT command is the most complex command in Redis. Warning: this code
- * is optimized for speed and a bit less for readability */
-void sortCommand(client *c) {
-    list *operations;
-    unsigned int outputlen = 0;
-    int desc = 0, alpha = 0;
-    long limit_start = 0, limit_count = -1, start, end;
-    int j, dontsort = 0, vectorlen;
-    int getop = 0; /* GET operation counter */
-    int int_conversion_error = 0;
-    int syntax_error = 0;
-    robj *sortval, *sortby = NULL, *storekey = NULL;
-    redisSortObject *vector; /* Resulting vector to sort */
-
-    /* Create a list of operations to perform for every sorted element.
-     * Operations can be GET */
-    operations = listCreate();
-    listSetFreeMethod(operations,zfree);
-    j = 2; /* options start at argv[2] */
-
-    /* The SORT command has an SQL-alike syntax, parse it */
-    while(j < c->argc) {
-        int leftargs = c->argc-j-1;
-        if (!strcasecmp(c->argv[j]->ptr,"asc")) {
-            desc = 0;
-        } else if (!strcasecmp(c->argv[j]->ptr,"desc")) {
-            desc = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"alpha")) {
-            alpha = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"limit") && leftargs >= 2) {
-            if ((getLongFromObjectOrReply(c, c->argv[j+1], &limit_start, NULL)
-                 != C_OK) ||
-                (getLongFromObjectOrReply(c, c->argv[j+2], &limit_count, NULL)
-                 != C_OK))
-            {
-                syntax_error++;
-                break;
-            }
-            j+=2;
-        } else if (!strcasecmp(c->argv[j]->ptr,"store") && leftargs >= 1) {
-            storekey = c->argv[j+1];
-            j++;
-        } else if (!strcasecmp(c->argv[j]->ptr,"by") && leftargs >= 1) {
-            sortby = c->argv[j+1];
-            /* If the BY pattern does not contain '*', i.e. it is constant,
-             * we don't need to sort nor to lookup the weight keys. */
-            if (strchr(c->argv[j+1]->ptr,'*') == NULL) {
-                dontsort = 1;
-            } else {
-                /* If BY is specified with a real patter, we can't accept
-                 * it in cluster mode. */
-                if (server.cluster_enabled) {
-                    addReplyError(c,"BY option of SORT denied in Cluster mode.");
-                    syntax_error++;
-                    break;
-                }
-            }
-            j++;
-        } else if (!strcasecmp(c->argv[j]->ptr,"get") && leftargs >= 1) {
-            if (server.cluster_enabled) {
-                addReplyError(c,"GET option of SORT denied in Cluster mode.");
-                syntax_error++;
-                break;
-            }
-            listAddNodeTail(operations,createSortOperation(
-                SORT_OP_GET,c->argv[j+1]));
-            getop++;
-            j++;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            syntax_error++;
-            break;
-        }
-        j++;
-    }
-
-    /* Handle syntax errors set during options parsing. */
-    if (syntax_error) {
-        listRelease(operations);
-        return;
-    }
-
-    /* Lookup the key to sort. It must be of the right types */
-    if (!storekey)
-        sortval = lookupKeyRead(c->db,c->argv[1]);
-    else
-        sortval = lookupKeyWrite(c->db,c->argv[1]);
-    if (sortval && sortval->type != OBJ_SET &&
-                   sortval->type != OBJ_LIST &&
-                   sortval->type != OBJ_ZSET)
-    {
-        listRelease(operations);
-        addReplyErrorObject(c,shared.wrongtypeerr);
-        return;
-    }
-
-    /* Now we need to protect sortval incrementing its count, in the future
-     * SORT may have options able to overwrite/delete keys during the sorting
-     * and the sorted key itself may get destroyed */
-    if (sortval)
-        incrRefCount(sortval);
-    else
-        sortval = createQuicklistObject();
-
-
-    /* When sorting a set with no sort specified, we must sort the output
-     * so the result is consistent across scripting and replication.
-     *
-     * The other types (list, sorted set) will retain their native order
-     * even if no sort order is requested, so they remain stable across
-     * scripting and replication. */
-    if (dontsort &&
-        sortval->type == OBJ_SET &&
-        (storekey || c->flags & CLIENT_LUA))
-    {
-        /* Force ALPHA sorting */
-        dontsort = 0;
-        alpha = 1;
-        sortby = NULL;
-    }
-
-    /* Destructively convert encoded sorted sets for SORT. */
-    if (sortval->type == OBJ_ZSET)
-        zsetConvert(sortval, OBJ_ENCODING_SKIPLIST);
-
-    /* Objtain the length of the object to sort. */
-    switch(sortval->type) {
-    case OBJ_LIST: vectorlen = listTypeLength(sortval); break;
-    case OBJ_SET: vectorlen =  setTypeSize(sortval); break;
-    case OBJ_ZSET: vectorlen = dictSize(((zset*)sortval->ptr)->dict); break;
-    default: vectorlen = 0; serverPanic("Bad SORT type"); /* Avoid GCC warning */
-    }
-
-    /* Perform LIMIT start,count sanity checking. */
-    start = (limit_start < 0) ? 0 : limit_start;
-    end = (limit_count < 0) ? vectorlen-1 : start+limit_count-1;
-    if (start >= vectorlen) {
-        start = vectorlen-1;
-        end = vectorlen-2;
-    }
-    if (end >= vectorlen) end = vectorlen-1;
-
-    /* Whenever possible, we load elements into the output array in a more
-     * direct way. This is possible if:
-     *
-     * 1) The object to sort is a sorted set or a list (internally sorted).
-     * 2) There is nothing to sort as dontsort is true (BY <constant string>).
-     *
-     * In this special case, if we have a LIMIT option that actually reduces
-     * the number of elements to fetch, we also optimize to just load the
-     * range we are interested in and allocating a vector that is big enough
-     * for the selected range length. */
-    if ((sortval->type == OBJ_ZSET || sortval->type == OBJ_LIST) &&
-        dontsort &&
-        (start != 0 || end != vectorlen-1))
-    {
-        vectorlen = end-start+1;
-    }
-
-    /* Load the sorting vector with all the objects to sort */
-    vector = zmalloc(sizeof(redisSortObject)*vectorlen);
-    j = 0;
-
-    if (sortval->type == OBJ_LIST && dontsort) {
-        /* Special handling for a list, if 'dontsort' is true.
-         * This makes sure we return elements in the list original
-         * ordering, accordingly to DESC / ASC options.
-         *
-         * Note that in this case we also handle LIMIT here in a direct
-         * way, just getting the required range, as an optimization. */
-        if (end >= start) {
-            listTypeIterator *li;
-            listTypeEntry entry;
-            li = listTypeInitIterator(sortval,
-                    desc ? (long)(listTypeLength(sortval) - start - 1) : start,
-                    desc ? LIST_HEAD : LIST_TAIL);
-
-            while(j < vectorlen && listTypeNext(li,&entry)) {
-                vector[j].obj = listTypeGet(&entry);
-                vector[j].u.score = 0;
-                vector[j].u.cmpobj = NULL;
-                j++;
-            }
-            listTypeReleaseIterator(li);
-            /* Fix start/end: output code is not aware of this optimization. */
-            end -= start;
-            start = 0;
-        }
-    } else if (sortval->type == OBJ_LIST) {
-        listTypeIterator *li = listTypeInitIterator(sortval,0,LIST_TAIL);
-        listTypeEntry entry;
-        while(listTypeNext(li,&entry)) {
-            vector[j].obj = listTypeGet(&entry);
-            vector[j].u.score = 0;
-            vector[j].u.cmpobj = NULL;
-            j++;
-        }
-        listTypeReleaseIterator(li);
-    } else if (sortval->type == OBJ_SET) {
-        setTypeIterator *si = setTypeInitIterator(sortval);
-        sds sdsele;
-        while((sdsele = setTypeNextObject(si)) != NULL) {
-            vector[j].obj = createObject(OBJ_STRING,sdsele);
-            vector[j].u.score = 0;
-            vector[j].u.cmpobj = NULL;
-            j++;
-        }
-        setTypeReleaseIterator(si);
-    } else if (sortval->type == OBJ_ZSET && dontsort) {
-        /* Special handling for a sorted set, if 'dontsort' is true.
-         * This makes sure we return elements in the sorted set original
-         * ordering, accordingly to DESC / ASC options.
-         *
-         * Note that in this case we also handle LIMIT here in a direct
-         * way, just getting the required range, as an optimization. */
-
-        zset *zs = sortval->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-        sds sdsele;
-        int rangelen = vectorlen;
-
-        /* Check if starting point is trivial, before doing log(N) lookup. */
-        if (desc) {
-            long zsetlen = dictSize(((zset*)sortval->ptr)->dict);
-
-            ln = zsl->tail;
-            if (start > 0)
-                ln = zslGetElementByRank(zsl,zsetlen-start);
-        } else {
-            ln = zsl->header->level[0].forward;
-            if (start > 0)
-                ln = zslGetElementByRank(zsl,start+1);
-        }
-
-        while(rangelen--) {
-            serverAssertWithInfo(c,sortval,ln != NULL);
-            sdsele = ln->ele;
-            vector[j].obj = createStringObject(sdsele,sdslen(sdsele));
-            vector[j].u.score = 0;
-            vector[j].u.cmpobj = NULL;
-            j++;
-            ln = desc ? ln->backward : ln->level[0].forward;
-        }
-        /* Fix start/end: output code is not aware of this optimization. */
-        end -= start;
-        start = 0;
-    } else if (sortval->type == OBJ_ZSET) {
-        dict *set = ((zset*)sortval->ptr)->dict;
-        dictIterator *di;
-        dictEntry *setele;
-        sds sdsele;
-        di = dictGetIterator(set);
-        while((setele = dictNext(di)) != NULL) {
-            sdsele =  dictGetKey(setele);
-            vector[j].obj = createStringObject(sdsele,sdslen(sdsele));
-            vector[j].u.score = 0;
-            vector[j].u.cmpobj = NULL;
-            j++;
-        }
-        dictReleaseIterator(di);
-    } else {
-        serverPanic("Unknown type");
-    }
-    serverAssertWithInfo(c,sortval,j == vectorlen);
-
-    /* Now it's time to load the right scores in the sorting vector */
-    if (!dontsort) {
-        for (j = 0; j < vectorlen; j++) {
-            robj *byval;
-            if (sortby) {
-                /* lookup value to sort by */
-                byval = lookupKeyByPattern(c->db,sortby,vector[j].obj,storekey!=NULL);
-                if (!byval) continue;
-            } else {
-                /* use object itself to sort by */
-                byval = vector[j].obj;
-            }
-
-            if (alpha) {
-                if (sortby) vector[j].u.cmpobj = getDecodedObject(byval);
-            } else {
-                if (sdsEncodedObject(byval)) {
-                    char *eptr;
-
-                    vector[j].u.score = strtod(byval->ptr,&eptr);
-                    if (eptr[0] != '\0' || errno == ERANGE ||
-                        isnan(vector[j].u.score))
-                    {
-                        int_conversion_error = 1;
-                    }
-                } else if (byval->encoding == OBJ_ENCODING_INT) {
-                    /* Don't need to decode the object if it's
-                     * integer-encoded (the only encoding supported) so
-                     * far. We can just cast it */
-                    vector[j].u.score = (long)byval->ptr;
-                } else {
-                    serverAssertWithInfo(c,sortval,1 != 1);
-                }
-            }
-
-            /* when the object was retrieved using lookupKeyByPattern,
-             * its refcount needs to be decreased. */
-            if (sortby) {
-                decrRefCount(byval);
-            }
-        }
-
-        server.sort_desc = desc;
-        server.sort_alpha = alpha;
-        server.sort_bypattern = sortby ? 1 : 0;
-        server.sort_store = storekey ? 1 : 0;
-        if (sortby && (start != 0 || end != vectorlen-1))
-            pqsort(vector,vectorlen,sizeof(redisSortObject),sortCompare, start,end);
-        else
-            qsort(vector,vectorlen,sizeof(redisSortObject),sortCompare);
-    }
-
-    /* Send command output to the output buffer, performing the specified
-     * GET/DEL/INCR/DECR operations if any. */
-    outputlen = getop ? getop*(end-start+1) : end-start+1;
-    if (int_conversion_error) {
-        addReplyError(c,"One or more scores can't be converted into double");
-    } else if (storekey == NULL) {
-        /* STORE option not specified, sent the sorting result to client */
-        addReplyArrayLen(c,outputlen);
-        for (j = start; j <= end; j++) {
-            listNode *ln;
-            listIter li;
-
-            if (!getop) addReplyBulk(c,vector[j].obj);
-            listRewind(operations,&li);
-            while((ln = listNext(&li))) {
-                redisSortOperation *sop = ln->value;
-                robj *val = lookupKeyByPattern(c->db,sop->pattern,
-                    vector[j].obj,storekey!=NULL);
-
-                if (sop->type == SORT_OP_GET) {
-                    if (!val) {
-                        addReplyNull(c);
-                    } else {
-                        addReplyBulk(c,val);
-                        decrRefCount(val);
-                    }
-                } else {
-                    /* Always fails */
-                    serverAssertWithInfo(c,sortval,sop->type == SORT_OP_GET);
-                }
-            }
-        }
-    } else {
-        robj *sobj = createQuicklistObject();
-
-        /* STORE option specified, set the sorting result as a List object */
-        for (j = start; j <= end; j++) {
-            listNode *ln;
-            listIter li;
-
-            if (!getop) {
-                listTypePush(sobj,vector[j].obj,LIST_TAIL);
-            } else {
-                listRewind(operations,&li);
-                while((ln = listNext(&li))) {
-                    redisSortOperation *sop = ln->value;
-                    robj *val = lookupKeyByPattern(c->db,sop->pattern,
-                        vector[j].obj,storekey!=NULL);
-
-                    if (sop->type == SORT_OP_GET) {
-                        if (!val) val = createStringObject("",0);
-
-                        /* listTypePush does an incrRefCount, so we should take care
-                         * care of the incremented refcount caused by either
-                         * lookupKeyByPattern or createStringObject("",0) */
-                        listTypePush(sobj,val,LIST_TAIL);
-                        decrRefCount(val);
-                    } else {
-                        /* Always fails */
-                        serverAssertWithInfo(c,sortval,sop->type == SORT_OP_GET);
-                    }
-                }
-            }
-        }
-        if (outputlen) {
-            setKey(c,c->db,storekey,sobj);
-            notifyKeyspaceEvent(NOTIFY_LIST,"sortstore",storekey,
-                                c->db->id);
-            server.dirty += outputlen;
-        } else if (dbDelete(c->db,storekey)) {
-            signalModifiedKey(c,c->db,storekey);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",storekey,c->db->id);
-            server.dirty++;
-        }
-        decrRefCount(sobj);
-        addReplyLongLong(c,outputlen);
-    }
-
-    /* Cleanup */
-    for (j = 0; j < vectorlen; j++)
-        decrRefCount(vector[j].obj);
-
-    decrRefCount(sortval);
-    listRelease(operations);
-    for (j = 0; j < vectorlen; j++) {
-        if (alpha && vector[j].u.cmpobj)
-            decrRefCount(vector[j].u.cmpobj);
-    }
-    zfree(vector);
-}
diff --git a/redis-stable/src/sparkline.c b/redis-stable/src/sparkline.c
deleted file mode 100644
index 67482c77..00000000
--- a/redis-stable/src/sparkline.c
+++ /dev/null
@@ -1,176 +0,0 @@
-/* sparkline.c -- ASCII Sparklines
- * This code is modified from http://github.com/antirez/aspark and adapted
- * in order to return SDS strings instead of outputting directly to
- * the terminal.
- *
- * ---------------------------------------------------------------------------
- *
- * Copyright(C) 2011-2014 Salvatore Sanfilippo <antirez@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-#include <math.h>
-
-/* This is the charset used to display the graphs, but multiple rows are used
- * to increase the resolution. */
-static char charset[] = "_-`";
-static char charset_fill[] = "_o#";
-static int charset_len = sizeof(charset)-1;
-static int label_margin_top = 1;
-
-/* ----------------------------------------------------------------------------
- * Sequences are arrays of samples we use to represent data to turn
- * into sparklines. This is the API in order to generate a sparkline:
- *
- * struct sequence *seq = createSparklineSequence();
- * sparklineSequenceAddSample(seq, 10, NULL);
- * sparklineSequenceAddSample(seq, 20, NULL);
- * sparklineSequenceAddSample(seq, 30, "last sample label");
- * sds output = sparklineRender(sdsempty(), seq, 80, 4, SPARKLINE_FILL);
- * freeSparklineSequence(seq);
- * ------------------------------------------------------------------------- */
-
-/* Create a new sequence. */
-struct sequence *createSparklineSequence(void) {
-    struct sequence *seq = zmalloc(sizeof(*seq));
-    seq->length = 0;
-    seq->samples = NULL;
-    return seq;
-}
-
-/* Add a new sample into a sequence. */
-void sparklineSequenceAddSample(struct sequence *seq, double value, char *label) {
-    label = (label == NULL || label[0] == '\0') ? NULL : zstrdup(label);
-    if (seq->length == 0) {
-        seq->min = seq->max = value;
-    } else {
-        if (value < seq->min) seq->min = value;
-        else if (value > seq->max) seq->max = value;
-    }
-    seq->samples = zrealloc(seq->samples,sizeof(struct sample)*(seq->length+1));
-    seq->samples[seq->length].value = value;
-    seq->samples[seq->length].label = label;
-    seq->length++;
-    if (label) seq->labels++;
-}
-
-/* Free a sequence. */
-void freeSparklineSequence(struct sequence *seq) {
-    int j;
-
-    for (j = 0; j < seq->length; j++)
-        zfree(seq->samples[j].label);
-    zfree(seq->samples);
-    zfree(seq);
-}
-
-/* ----------------------------------------------------------------------------
- * ASCII rendering of sequence
- * ------------------------------------------------------------------------- */
-
-/* Render part of a sequence, so that render_sequence() call call this function
- * with different parts in order to create the full output without overflowing
- * the current terminal columns. */
-sds sparklineRenderRange(sds output, struct sequence *seq, int rows, int offset, int len, int flags) {
-    int j;
-    double relmax = seq->max - seq->min;
-    int steps = charset_len*rows;
-    int row = 0;
-    char *chars = zmalloc(len);
-    int loop = 1;
-    int opt_fill = flags & SPARKLINE_FILL;
-    int opt_log = flags & SPARKLINE_LOG_SCALE;
-
-    if (opt_log) {
-        relmax = log(relmax+1);
-    } else if (relmax == 0) {
-        relmax = 1;
-    }
-
-    while(loop) {
-        loop = 0;
-        memset(chars,' ',len);
-        for (j = 0; j < len; j++) {
-            struct sample *s = &seq->samples[j+offset];
-            double relval = s->value - seq->min;
-            int step;
-
-            if (opt_log) relval = log(relval+1);
-            step = (int) (relval*steps)/relmax;
-            if (step < 0) step = 0;
-            if (step >= steps) step = steps-1;
-
-            if (row < rows) {
-                /* Print the character needed to create the sparkline */
-                int charidx = step-((rows-row-1)*charset_len);
-                loop = 1;
-                if (charidx >= 0 && charidx < charset_len) {
-                    chars[j] = opt_fill ? charset_fill[charidx] :
-                                          charset[charidx];
-                } else if(opt_fill && charidx >= charset_len) {
-                    chars[j] = '|';
-                }
-            } else {
-                /* Labels spacing */
-                if (seq->labels && row-rows < label_margin_top) {
-                    loop = 1;
-                    break;
-                }
-                /* Print the label if needed. */
-                if (s->label) {
-                    int label_len = strlen(s->label);
-                    int label_char = row - rows - label_margin_top;
-
-                    if (label_len > label_char) {
-                        loop = 1;
-                        chars[j] = s->label[label_char];
-                    }
-                }
-            }
-        }
-        if (loop) {
-            row++;
-            output = sdscatlen(output,chars,len);
-            output = sdscatlen(output,"\n",1);
-        }
-    }
-    zfree(chars);
-    return output;
-}
-
-/* Turn a sequence into its ASCII representation */
-sds sparklineRender(sds output, struct sequence *seq, int columns, int rows, int flags) {
-    int j;
-
-    for (j = 0; j < seq->length; j += columns) {
-        int sublen = (seq->length-j) < columns ? (seq->length-j) : columns;
-
-        if (j != 0) output = sdscatlen(output,"\n",1);
-        output = sparklineRenderRange(output, seq, rows, j, sublen, flags);
-    }
-    return output;
-}
-
diff --git a/redis-stable/src/sparkline.h b/redis-stable/src/sparkline.h
deleted file mode 100644
index 6025d2b9..00000000
--- a/redis-stable/src/sparkline.h
+++ /dev/null
@@ -1,56 +0,0 @@
-/* sparkline.h -- ASCII Sparklines header file
- *
- * ---------------------------------------------------------------------------
- *
- * Copyright(C) 2011-2014 Salvatore Sanfilippo <antirez@gmail.com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __SPARKLINE_H
-#define __SPARKLINE_H
-
-/* A sequence is represented of many "samples" */
-struct sample {
-    double value;
-    char *label;
-};
-
-struct sequence {
-    int length;
-    int labels;
-    struct sample *samples;
-    double min, max;
-};
-
-#define SPARKLINE_NO_FLAGS 0
-#define SPARKLINE_FILL 1      /* Fill the area under the curve. */
-#define SPARKLINE_LOG_SCALE 2 /* Use logarithmic scale. */
-
-struct sequence *createSparklineSequence(void);
-void sparklineSequenceAddSample(struct sequence *seq, double value, char *label);
-void freeSparklineSequence(struct sequence *seq);
-sds sparklineRenderRange(sds output, struct sequence *seq, int rows, int offset, int len, int flags);
-sds sparklineRender(sds output, struct sequence *seq, int columns, int rows, int flags);
-
-#endif /* __SPARKLINE_H */
diff --git a/redis-stable/src/stream.h b/redis-stable/src/stream.h
deleted file mode 100644
index 1f213236..00000000
--- a/redis-stable/src/stream.h
+++ /dev/null
@@ -1,132 +0,0 @@
-#ifndef STREAM_H
-#define STREAM_H
-
-#include "rax.h"
-#include "listpack.h"
-
-/* Stream item ID: a 128 bit number composed of a milliseconds time and
- * a sequence counter. IDs generated in the same millisecond (or in a past
- * millisecond if the clock jumped backward) will use the millisecond time
- * of the latest generated ID and an incremented sequence. */
-typedef struct streamID {
-    uint64_t ms;        /* Unix time in milliseconds. */
-    uint64_t seq;       /* Sequence number. */
-} streamID;
-
-typedef struct stream {
-    rax *rax;               /* The radix tree holding the stream. */
-    uint64_t length;        /* Number of elements inside this stream. */
-    streamID last_id;       /* Zero if there are yet no items. */
-    rax *cgroups;           /* Consumer groups dictionary: name -> streamCG */
-} stream;
-
-/* We define an iterator to iterate stream items in an abstract way, without
- * caring about the radix tree + listpack representation. Technically speaking
- * the iterator is only used inside streamReplyWithRange(), so could just
- * be implemented inside the function, but practically there is the AOF
- * rewriting code that also needs to iterate the stream to emit the XADD
- * commands. */
-typedef struct streamIterator {
-    stream *stream;         /* The stream we are iterating. */
-    streamID master_id;     /* ID of the master entry at listpack head. */
-    uint64_t master_fields_count;       /* Master entries # of fields. */
-    unsigned char *master_fields_start; /* Master entries start in listpack. */
-    unsigned char *master_fields_ptr;   /* Master field to emit next. */
-    int entry_flags;                    /* Flags of entry we are emitting. */
-    int rev;                /* True if iterating end to start (reverse). */
-    uint64_t start_key[2];  /* Start key as 128 bit big endian. */
-    uint64_t end_key[2];    /* End key as 128 bit big endian. */
-    raxIterator ri;         /* Rax iterator. */
-    unsigned char *lp;      /* Current listpack. */
-    unsigned char *lp_ele;  /* Current listpack cursor. */
-    unsigned char *lp_flags; /* Current entry flags pointer. */
-    /* Buffers used to hold the string of lpGet() when the element is
-     * integer encoded, so that there is no string representation of the
-     * element inside the listpack itself. */
-    unsigned char field_buf[LP_INTBUF_SIZE];
-    unsigned char value_buf[LP_INTBUF_SIZE];
-} streamIterator;
-
-/* Consumer group. */
-typedef struct streamCG {
-    streamID last_id;       /* Last delivered (not acknowledged) ID for this
-                               group. Consumers that will just ask for more
-                               messages will served with IDs > than this. */
-    rax *pel;               /* Pending entries list. This is a radix tree that
-                               has every message delivered to consumers (without
-                               the NOACK option) that was yet not acknowledged
-                               as processed. The key of the radix tree is the
-                               ID as a 64 bit big endian number, while the
-                               associated value is a streamNACK structure.*/
-    rax *consumers;         /* A radix tree representing the consumers by name
-                               and their associated representation in the form
-                               of streamConsumer structures. */
-} streamCG;
-
-/* A specific consumer in a consumer group.  */
-typedef struct streamConsumer {
-    mstime_t seen_time;         /* Last time this consumer was active. */
-    sds name;                   /* Consumer name. This is how the consumer
-                                   will be identified in the consumer group
-                                   protocol. Case sensitive. */
-    rax *pel;                   /* Consumer specific pending entries list: all
-                                   the pending messages delivered to this
-                                   consumer not yet acknowledged. Keys are
-                                   big endian message IDs, while values are
-                                   the same streamNACK structure referenced
-                                   in the "pel" of the consumer group structure
-                                   itself, so the value is shared. */
-} streamConsumer;
-
-/* Pending (yet not acknowledged) message in a consumer group. */
-typedef struct streamNACK {
-    mstime_t delivery_time;     /* Last time this message was delivered. */
-    uint64_t delivery_count;    /* Number of times this message was delivered.*/
-    streamConsumer *consumer;   /* The consumer this message was delivered to
-                                   in the last delivery. */
-} streamNACK;
-
-/* Stream propagation informations, passed to functions in order to propagate
- * XCLAIM commands to AOF and slaves. */
-typedef struct streamPropInfo {
-    robj *keyname;
-    robj *groupname;
-} streamPropInfo;
-
-/* Prototypes of exported APIs. */
-struct client;
-
-/* Flags for streamLookupConsumer */
-#define SLC_NONE      0
-#define SLC_NOCREAT   (1<<0) /* Do not create the consumer if it doesn't exist */
-#define SLC_NOREFRESH (1<<1) /* Do not update consumer's seen-time */
-
-stream *streamNew(void);
-void freeStream(stream *s);
-unsigned long streamLength(const robj *subject);
-size_t streamReplyWithRange(client *c, stream *s, streamID *start, streamID *end, size_t count, int rev, streamCG *group, streamConsumer *consumer, int flags, streamPropInfo *spi);
-void streamIteratorStart(streamIterator *si, stream *s, streamID *start, streamID *end, int rev);
-int streamIteratorGetID(streamIterator *si, streamID *id, int64_t *numfields);
-void streamIteratorGetField(streamIterator *si, unsigned char **fieldptr, unsigned char **valueptr, int64_t *fieldlen, int64_t *valuelen);
-void streamIteratorRemoveEntry(streamIterator *si, streamID *current);
-void streamIteratorStop(streamIterator *si);
-streamCG *streamLookupCG(stream *s, sds groupname);
-streamConsumer *streamLookupConsumer(streamCG *cg, sds name, int flags, int *created);
-streamCG *streamCreateCG(stream *s, char *name, size_t namelen, streamID *id);
-streamNACK *streamCreateNACK(streamConsumer *consumer);
-void streamDecodeID(void *buf, streamID *id);
-int streamCompareID(streamID *a, streamID *b);
-void streamFreeNACK(streamNACK *na);
-int streamIncrID(streamID *id);
-int streamDecrID(streamID *id);
-void streamPropagateConsumerCreation(client *c, robj *key, robj *groupname, sds consumername);
-robj *streamDup(robj *o);
-int streamValidateListpackIntegrity(unsigned char *lp, size_t size, int deep);
-int streamParseID(const robj *o, streamID *id);
-robj *createObjectFromStreamID(streamID *id);
-int streamAppendItem(stream *s, robj **argv, int64_t numfields, streamID *added_id, streamID *use_id);
-int streamDeleteItem(stream *s, streamID *id);
-int64_t streamTrimByLength(stream *s, long long maxlen, int approx);
-int64_t streamTrimByID(stream *s, streamID minid, int approx);
-
-#endif
diff --git a/redis-stable/src/syncio.c b/redis-stable/src/syncio.c
deleted file mode 100644
index b2843d5f..00000000
--- a/redis-stable/src/syncio.c
+++ /dev/null
@@ -1,145 +0,0 @@
-/* Synchronous socket and file I/O operations useful across the core.
- *
- * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* ----------------- Blocking sockets I/O with timeouts --------------------- */
-
-/* Redis performs most of the I/O in a nonblocking way, with the exception
- * of the SYNC command where the slave does it in a blocking way, and
- * the MIGRATE command that must be blocking in order to be atomic from the
- * point of view of the two instances (one migrating the key and one receiving
- * the key). This is why need the following blocking I/O functions.
- *
- * All the functions take the timeout in milliseconds. */
-
-#define SYNCIO__RESOLUTION 10 /* Resolution in milliseconds */
-
-/* Write the specified payload to 'fd'. If writing the whole payload will be
- * done within 'timeout' milliseconds the operation succeeds and 'size' is
- * returned. Otherwise the operation fails, -1 is returned, and an unspecified
- * partial write could be performed against the file descriptor. */
-ssize_t syncWrite(int fd, char *ptr, ssize_t size, long long timeout) {
-    ssize_t nwritten, ret = size;
-    long long start = mstime();
-    long long remaining = timeout;
-
-    while(1) {
-        long long wait = (remaining > SYNCIO__RESOLUTION) ?
-                          remaining : SYNCIO__RESOLUTION;
-        long long elapsed;
-
-        /* Optimistically try to write before checking if the file descriptor
-         * is actually writable. At worst we get EAGAIN. */
-        nwritten = write(fd,ptr,size);
-        if (nwritten == -1) {
-            if (errno != EAGAIN) return -1;
-        } else {
-            ptr += nwritten;
-            size -= nwritten;
-        }
-        if (size == 0) return ret;
-
-        /* Wait */
-        aeWait(fd,AE_WRITABLE,wait);
-        elapsed = mstime() - start;
-        if (elapsed >= timeout) {
-            errno = ETIMEDOUT;
-            return -1;
-        }
-        remaining = timeout - elapsed;
-    }
-}
-
-/* Read the specified amount of bytes from 'fd'. If all the bytes are read
- * within 'timeout' milliseconds the operation succeed and 'size' is returned.
- * Otherwise the operation fails, -1 is returned, and an unspecified amount of
- * data could be read from the file descriptor. */
-ssize_t syncRead(int fd, char *ptr, ssize_t size, long long timeout) {
-    ssize_t nread, totread = 0;
-    long long start = mstime();
-    long long remaining = timeout;
-
-    if (size == 0) return 0;
-    while(1) {
-        long long wait = (remaining > SYNCIO__RESOLUTION) ?
-                          remaining : SYNCIO__RESOLUTION;
-        long long elapsed;
-
-        /* Optimistically try to read before checking if the file descriptor
-         * is actually readable. At worst we get EAGAIN. */
-        nread = read(fd,ptr,size);
-        if (nread == 0) return -1; /* short read. */
-        if (nread == -1) {
-            if (errno != EAGAIN) return -1;
-        } else {
-            ptr += nread;
-            size -= nread;
-            totread += nread;
-        }
-        if (size == 0) return totread;
-
-        /* Wait */
-        aeWait(fd,AE_READABLE,wait);
-        elapsed = mstime() - start;
-        if (elapsed >= timeout) {
-            errno = ETIMEDOUT;
-            return -1;
-        }
-        remaining = timeout - elapsed;
-    }
-}
-
-/* Read a line making sure that every char will not require more than 'timeout'
- * milliseconds to be read.
- *
- * On success the number of bytes read is returned, otherwise -1.
- * On success the string is always correctly terminated with a 0 byte. */
-ssize_t syncReadLine(int fd, char *ptr, ssize_t size, long long timeout) {
-    ssize_t nread = 0;
-
-    size--;
-    while(size) {
-        char c;
-
-        if (syncRead(fd,&c,1,timeout) == -1) return -1;
-        if (c == '\n') {
-            *ptr = '\0';
-            if (nread && *(ptr-1) == '\r') *(ptr-1) = '\0';
-            return nread;
-        } else {
-            *ptr++ = c;
-            *ptr = '\0';
-            nread++;
-        }
-        size--;
-    }
-    return nread;
-}
diff --git a/redis-stable/src/t_hash.c b/redis-stable/src/t_hash.c
deleted file mode 100644
index 2720fdbc..00000000
--- a/redis-stable/src/t_hash.c
+++ /dev/null
@@ -1,1209 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <math.h>
-
-/*-----------------------------------------------------------------------------
- * Hash type API
- *----------------------------------------------------------------------------*/
-
-/* Check the length of a number of objects to see if we need to convert a
- * ziplist to a real hash. Note that we only check string encoded objects
- * as their string length can be queried in constant time. */
-void hashTypeTryConversion(robj *o, robj **argv, int start, int end) {
-    int i;
-    size_t sum = 0;
-
-    if (o->encoding != OBJ_ENCODING_ZIPLIST) return;
-
-    for (i = start; i <= end; i++) {
-        if (!sdsEncodedObject(argv[i]))
-            continue;
-        size_t len = sdslen(argv[i]->ptr);
-        if (len > server.hash_max_ziplist_value) {
-            hashTypeConvert(o, OBJ_ENCODING_HT);
-            return;
-        }
-        sum += len;
-    }
-    if (!ziplistSafeToAdd(o->ptr, sum))
-        hashTypeConvert(o, OBJ_ENCODING_HT);
-}
-
-/* Get the value from a ziplist encoded hash, identified by field.
- * Returns -1 when the field cannot be found. */
-int hashTypeGetFromZiplist(robj *o, sds field,
-                           unsigned char **vstr,
-                           unsigned int *vlen,
-                           long long *vll)
-{
-    unsigned char *zl, *fptr = NULL, *vptr = NULL;
-    int ret;
-
-    serverAssert(o->encoding == OBJ_ENCODING_ZIPLIST);
-
-    zl = o->ptr;
-    fptr = ziplistIndex(zl, ZIPLIST_HEAD);
-    if (fptr != NULL) {
-        fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
-        if (fptr != NULL) {
-            /* Grab pointer to the value (fptr points to the field) */
-            vptr = ziplistNext(zl, fptr);
-            serverAssert(vptr != NULL);
-        }
-    }
-
-    if (vptr != NULL) {
-        ret = ziplistGet(vptr, vstr, vlen, vll);
-        serverAssert(ret);
-        return 0;
-    }
-
-    return -1;
-}
-
-/* Get the value from a hash table encoded hash, identified by field.
- * Returns NULL when the field cannot be found, otherwise the SDS value
- * is returned. */
-sds hashTypeGetFromHashTable(robj *o, sds field) {
-    dictEntry *de;
-
-    serverAssert(o->encoding == OBJ_ENCODING_HT);
-
-    de = dictFind(o->ptr, field);
-    if (de == NULL) return NULL;
-    return dictGetVal(de);
-}
-
-/* Higher level function of hashTypeGet*() that returns the hash value
- * associated with the specified field. If the field is found C_OK
- * is returned, otherwise C_ERR. The returned object is returned by
- * reference in either *vstr and *vlen if it's returned in string form,
- * or stored in *vll if it's returned as a number.
- *
- * If *vll is populated *vstr is set to NULL, so the caller
- * can always check the function return by checking the return value
- * for C_OK and checking if vll (or vstr) is NULL. */
-int hashTypeGetValue(robj *o, sds field, unsigned char **vstr, unsigned int *vlen, long long *vll) {
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        *vstr = NULL;
-        if (hashTypeGetFromZiplist(o, field, vstr, vlen, vll) == 0)
-            return C_OK;
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        sds value;
-        if ((value = hashTypeGetFromHashTable(o, field)) != NULL) {
-            *vstr = (unsigned char*) value;
-            *vlen = sdslen(value);
-            return C_OK;
-        }
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return C_ERR;
-}
-
-/* Like hashTypeGetValue() but returns a Redis object, which is useful for
- * interaction with the hash type outside t_hash.c.
- * The function returns NULL if the field is not found in the hash. Otherwise
- * a newly allocated string object with the value is returned. */
-robj *hashTypeGetValueObject(robj *o, sds field) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vll;
-
-    if (hashTypeGetValue(o,field,&vstr,&vlen,&vll) == C_ERR) return NULL;
-    if (vstr) return createStringObject((char*)vstr,vlen);
-    else return createStringObjectFromLongLong(vll);
-}
-
-/* Higher level function using hashTypeGet*() to return the length of the
- * object associated with the requested field, or 0 if the field does not
- * exist. */
-size_t hashTypeGetValueLength(robj *o, sds field) {
-    size_t len = 0;
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *vstr = NULL;
-        unsigned int vlen = UINT_MAX;
-        long long vll = LLONG_MAX;
-
-        if (hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll) == 0)
-            len = vstr ? vlen : sdigits10(vll);
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        sds aux;
-
-        if ((aux = hashTypeGetFromHashTable(o, field)) != NULL)
-            len = sdslen(aux);
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return len;
-}
-
-/* Test if the specified field exists in the given hash. Returns 1 if the field
- * exists, and 0 when it doesn't. */
-int hashTypeExists(robj *o, sds field) {
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *vstr = NULL;
-        unsigned int vlen = UINT_MAX;
-        long long vll = LLONG_MAX;
-
-        if (hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll) == 0) return 1;
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        if (hashTypeGetFromHashTable(o, field) != NULL) return 1;
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return 0;
-}
-
-/* Add a new field, overwrite the old with the new value if it already exists.
- * Return 0 on insert and 1 on update.
- *
- * By default, the key and value SDS strings are copied if needed, so the
- * caller retains ownership of the strings passed. However this behavior
- * can be effected by passing appropriate flags (possibly bitwise OR-ed):
- *
- * HASH_SET_TAKE_FIELD -- The SDS field ownership passes to the function.
- * HASH_SET_TAKE_VALUE -- The SDS value ownership passes to the function.
- *
- * When the flags are used the caller does not need to release the passed
- * SDS string(s). It's up to the function to use the string to create a new
- * entry or to free the SDS string before returning to the caller.
- *
- * HASH_SET_COPY corresponds to no flags passed, and means the default
- * semantics of copying the values if needed.
- *
- */
-#define HASH_SET_TAKE_FIELD (1<<0)
-#define HASH_SET_TAKE_VALUE (1<<1)
-#define HASH_SET_COPY 0
-int hashTypeSet(robj *o, sds field, sds value, int flags) {
-    int update = 0;
-
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl, *fptr, *vptr;
-
-        zl = o->ptr;
-        fptr = ziplistIndex(zl, ZIPLIST_HEAD);
-        if (fptr != NULL) {
-            fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
-            if (fptr != NULL) {
-                /* Grab pointer to the value (fptr points to the field) */
-                vptr = ziplistNext(zl, fptr);
-                serverAssert(vptr != NULL);
-                update = 1;
-
-                /* Replace value */
-                zl = ziplistReplace(zl, vptr, (unsigned char*)value,
-                        sdslen(value));
-            }
-        }
-
-        if (!update) {
-            /* Push new field/value pair onto the tail of the ziplist */
-            zl = ziplistPush(zl, (unsigned char*)field, sdslen(field),
-                    ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)value, sdslen(value),
-                    ZIPLIST_TAIL);
-        }
-        o->ptr = zl;
-
-        /* Check if the ziplist needs to be converted to a hash table */
-        if (hashTypeLength(o) > server.hash_max_ziplist_entries)
-            hashTypeConvert(o, OBJ_ENCODING_HT);
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        dictEntry *de = dictFind(o->ptr,field);
-        if (de) {
-            sdsfree(dictGetVal(de));
-            if (flags & HASH_SET_TAKE_VALUE) {
-                dictGetVal(de) = value;
-                value = NULL;
-            } else {
-                dictGetVal(de) = sdsdup(value);
-            }
-            update = 1;
-        } else {
-            sds f,v;
-            if (flags & HASH_SET_TAKE_FIELD) {
-                f = field;
-                field = NULL;
-            } else {
-                f = sdsdup(field);
-            }
-            if (flags & HASH_SET_TAKE_VALUE) {
-                v = value;
-                value = NULL;
-            } else {
-                v = sdsdup(value);
-            }
-            dictAdd(o->ptr,f,v);
-        }
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-
-    /* Free SDS strings we did not referenced elsewhere if the flags
-     * want this function to be responsible. */
-    if (flags & HASH_SET_TAKE_FIELD && field) sdsfree(field);
-    if (flags & HASH_SET_TAKE_VALUE && value) sdsfree(value);
-    return update;
-}
-
-/* Delete an element from a hash.
- * Return 1 on deleted and 0 on not found. */
-int hashTypeDelete(robj *o, sds field) {
-    int deleted = 0;
-
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl, *fptr;
-
-        zl = o->ptr;
-        fptr = ziplistIndex(zl, ZIPLIST_HEAD);
-        if (fptr != NULL) {
-            fptr = ziplistFind(zl, fptr, (unsigned char*)field, sdslen(field), 1);
-            if (fptr != NULL) {
-                zl = ziplistDelete(zl,&fptr); /* Delete the key. */
-                zl = ziplistDelete(zl,&fptr); /* Delete the value. */
-                o->ptr = zl;
-                deleted = 1;
-            }
-        }
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        if (dictDelete((dict*)o->ptr, field) == C_OK) {
-            deleted = 1;
-
-            /* Always check if the dictionary needs a resize after a delete. */
-            if (htNeedsResize(o->ptr)) dictResize(o->ptr);
-        }
-
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return deleted;
-}
-
-/* Return the number of elements in a hash. */
-unsigned long hashTypeLength(const robj *o) {
-    unsigned long length = ULONG_MAX;
-
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        length = ziplistLen(o->ptr) / 2;
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        length = dictSize((const dict*)o->ptr);
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return length;
-}
-
-hashTypeIterator *hashTypeInitIterator(robj *subject) {
-    hashTypeIterator *hi = zmalloc(sizeof(hashTypeIterator));
-    hi->subject = subject;
-    hi->encoding = subject->encoding;
-
-    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
-        hi->fptr = NULL;
-        hi->vptr = NULL;
-    } else if (hi->encoding == OBJ_ENCODING_HT) {
-        hi->di = dictGetIterator(subject->ptr);
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return hi;
-}
-
-void hashTypeReleaseIterator(hashTypeIterator *hi) {
-    if (hi->encoding == OBJ_ENCODING_HT)
-        dictReleaseIterator(hi->di);
-    zfree(hi);
-}
-
-/* Move to the next entry in the hash. Return C_OK when the next entry
- * could be found and C_ERR when the iterator reaches the end. */
-int hashTypeNext(hashTypeIterator *hi) {
-    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl;
-        unsigned char *fptr, *vptr;
-
-        zl = hi->subject->ptr;
-        fptr = hi->fptr;
-        vptr = hi->vptr;
-
-        if (fptr == NULL) {
-            /* Initialize cursor */
-            serverAssert(vptr == NULL);
-            fptr = ziplistIndex(zl, 0);
-        } else {
-            /* Advance cursor */
-            serverAssert(vptr != NULL);
-            fptr = ziplistNext(zl, vptr);
-        }
-        if (fptr == NULL) return C_ERR;
-
-        /* Grab pointer to the value (fptr points to the field) */
-        vptr = ziplistNext(zl, fptr);
-        serverAssert(vptr != NULL);
-
-        /* fptr, vptr now point to the first or next pair */
-        hi->fptr = fptr;
-        hi->vptr = vptr;
-    } else if (hi->encoding == OBJ_ENCODING_HT) {
-        if ((hi->de = dictNext(hi->di)) == NULL) return C_ERR;
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return C_OK;
-}
-
-/* Get the field or value at iterator cursor, for an iterator on a hash value
- * encoded as a ziplist. Prototype is similar to `hashTypeGetFromZiplist`. */
-void hashTypeCurrentFromZiplist(hashTypeIterator *hi, int what,
-                                unsigned char **vstr,
-                                unsigned int *vlen,
-                                long long *vll)
-{
-    int ret;
-
-    serverAssert(hi->encoding == OBJ_ENCODING_ZIPLIST);
-
-    if (what & OBJ_HASH_KEY) {
-        ret = ziplistGet(hi->fptr, vstr, vlen, vll);
-        serverAssert(ret);
-    } else {
-        ret = ziplistGet(hi->vptr, vstr, vlen, vll);
-        serverAssert(ret);
-    }
-}
-
-/* Get the field or value at iterator cursor, for an iterator on a hash value
- * encoded as a hash table. Prototype is similar to
- * `hashTypeGetFromHashTable`. */
-sds hashTypeCurrentFromHashTable(hashTypeIterator *hi, int what) {
-    serverAssert(hi->encoding == OBJ_ENCODING_HT);
-
-    if (what & OBJ_HASH_KEY) {
-        return dictGetKey(hi->de);
-    } else {
-        return dictGetVal(hi->de);
-    }
-}
-
-/* Higher level function of hashTypeCurrent*() that returns the hash value
- * at current iterator position.
- *
- * The returned element is returned by reference in either *vstr and *vlen if
- * it's returned in string form, or stored in *vll if it's returned as
- * a number.
- *
- * If *vll is populated *vstr is set to NULL, so the caller
- * can always check the function return by checking the return value
- * type checking if vstr == NULL. */
-void hashTypeCurrentObject(hashTypeIterator *hi, int what, unsigned char **vstr, unsigned int *vlen, long long *vll) {
-    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
-        *vstr = NULL;
-        hashTypeCurrentFromZiplist(hi, what, vstr, vlen, vll);
-    } else if (hi->encoding == OBJ_ENCODING_HT) {
-        sds ele = hashTypeCurrentFromHashTable(hi, what);
-        *vstr = (unsigned char*) ele;
-        *vlen = sdslen(ele);
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-/* Return the key or value at the current iterator position as a new
- * SDS string. */
-sds hashTypeCurrentObjectNewSds(hashTypeIterator *hi, int what) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vll;
-
-    hashTypeCurrentObject(hi,what,&vstr,&vlen,&vll);
-    if (vstr) return sdsnewlen(vstr,vlen);
-    return sdsfromlonglong(vll);
-}
-
-robj *hashTypeLookupWriteOrCreate(client *c, robj *key) {
-    robj *o = lookupKeyWrite(c->db,key);
-    if (checkType(c,o,OBJ_HASH)) return NULL;
-
-    if (o == NULL) {
-        o = createHashObject();
-        dbAdd(c->db,key,o);
-    }
-    return o;
-}
-
-void hashTypeConvertZiplist(robj *o, int enc) {
-    serverAssert(o->encoding == OBJ_ENCODING_ZIPLIST);
-
-    if (enc == OBJ_ENCODING_ZIPLIST) {
-        /* Nothing to do... */
-
-    } else if (enc == OBJ_ENCODING_HT) {
-        hashTypeIterator *hi;
-        dict *dict;
-        int ret;
-
-        hi = hashTypeInitIterator(o);
-        dict = dictCreate(&hashDictType, NULL);
-
-        while (hashTypeNext(hi) != C_ERR) {
-            sds key, value;
-
-            key = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
-            value = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
-            ret = dictAdd(dict, key, value);
-            if (ret != DICT_OK) {
-                serverLogHexDump(LL_WARNING,"ziplist with dup elements dump",
-                    o->ptr,ziplistBlobLen(o->ptr));
-                serverPanic("Ziplist corruption detected");
-            }
-        }
-        hashTypeReleaseIterator(hi);
-        zfree(o->ptr);
-        o->encoding = OBJ_ENCODING_HT;
-        o->ptr = dict;
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-void hashTypeConvert(robj *o, int enc) {
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        hashTypeConvertZiplist(o, enc);
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        serverPanic("Not implemented");
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-/* This is a helper function for the COPY command.
- * Duplicate a hash object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * The resulting object always has refcount set to 1 */
-robj *hashTypeDup(robj *o) {
-    robj *hobj;
-    hashTypeIterator *hi;
-
-    serverAssert(o->type == OBJ_HASH);
-
-    if(o->encoding == OBJ_ENCODING_ZIPLIST){
-        unsigned char *zl = o->ptr;
-        size_t sz = ziplistBlobLen(zl);
-        unsigned char *new_zl = zmalloc(sz);
-        memcpy(new_zl, zl, sz);
-        hobj = createObject(OBJ_HASH, new_zl);
-        hobj->encoding = OBJ_ENCODING_ZIPLIST;
-    } else if(o->encoding == OBJ_ENCODING_HT){
-        dict *d = dictCreate(&hashDictType, NULL);
-        dictExpand(d, dictSize((const dict*)o->ptr));
-
-        hi = hashTypeInitIterator(o);
-        while (hashTypeNext(hi) != C_ERR) {
-            sds field, value;
-            sds newfield, newvalue;
-            /* Extract a field-value pair from an original hash object.*/
-            field = hashTypeCurrentFromHashTable(hi, OBJ_HASH_KEY);
-            value = hashTypeCurrentFromHashTable(hi, OBJ_HASH_VALUE);
-            newfield = sdsdup(field);
-            newvalue = sdsdup(value);
-
-            /* Add a field-value pair to a new hash object. */
-            dictAdd(d,newfield,newvalue);
-        }
-        hashTypeReleaseIterator(hi);
-
-        hobj = createObject(OBJ_HASH, d);
-        hobj->encoding = OBJ_ENCODING_HT;
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-    return hobj;
-}
-
-/* callback for to check the ziplist doesn't have duplicate recoreds */
-static int _hashZiplistEntryValidation(unsigned char *p, void *userdata) {
-    struct {
-        long count;
-        dict *fields;
-    } *data = userdata;
-
-    /* Odd records are field names, add to dict and check that's not a dup */
-    if (((data->count) & 1) == 0) {
-        unsigned char *str;
-        unsigned int slen;
-        long long vll;
-        if (!ziplistGet(p, &str, &slen, &vll))
-            return 0;
-        sds field = str? sdsnewlen(str, slen): sdsfromlonglong(vll);;
-        if (dictAdd(data->fields, field, NULL) != DICT_OK) {
-            /* Duplicate, return an error */
-            sdsfree(field);
-            return 0;
-        }
-    }
-
-    (data->count)++;
-    return 1;
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we scan all the entries one by one. */
-int hashZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep) {
-    if (!deep)
-        return ziplistValidateIntegrity(zl, size, 0, NULL, NULL);
-
-    /* Keep track of the field names to locate duplicate ones */
-    struct {
-        long count;
-        dict *fields;
-    } data = {0, dictCreate(&hashDictType, NULL)};
-
-    int ret = ziplistValidateIntegrity(zl, size, 1, _hashZiplistEntryValidation, &data);
-
-    /* make sure we have an even number of records. */
-    if (data.count & 1)
-        ret = 0;
-
-    dictRelease(data.fields);
-    return ret;
-}
-
-/* Create a new sds string from the ziplist entry. */
-sds hashSdsFromZiplistEntry(ziplistEntry *e) {
-    return e->sval ? sdsnewlen(e->sval, e->slen) : sdsfromlonglong(e->lval);
-}
-
-/* Reply with bulk string from the ziplist entry. */
-void hashReplyFromZiplistEntry(client *c, ziplistEntry *e) {
-    if (e->sval)
-        addReplyBulkCBuffer(c, e->sval, e->slen);
-    else
-        addReplyBulkLongLong(c, e->lval);
-}
-
-/* Return random element from a non empty hash.
- * 'key' and 'val' will be set to hold the element.
- * The memory in them is not to be freed or modified by the caller.
- * 'val' can be NULL in which case it's not extracted. */
-void hashTypeRandomElement(robj *hashobj, unsigned long hashsize, ziplistEntry *key, ziplistEntry *val) {
-    if (hashobj->encoding == OBJ_ENCODING_HT) {
-        dictEntry *de = dictGetFairRandomKey(hashobj->ptr);
-        sds s = dictGetKey(de);
-        key->sval = (unsigned char*)s;
-        key->slen = sdslen(s);
-        if (val) {
-            sds s = dictGetVal(de);
-            val->sval = (unsigned char*)s;
-            val->slen = sdslen(s);
-        }
-    } else if (hashobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        ziplistRandomPair(hashobj->ptr, hashsize, key, val);
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-
-/*-----------------------------------------------------------------------------
- * Hash type commands
- *----------------------------------------------------------------------------*/
-
-void hsetnxCommand(client *c) {
-    robj *o;
-    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
-    hashTypeTryConversion(o,c->argv,2,3);
-
-    if (hashTypeExists(o, c->argv[2]->ptr)) {
-        addReply(c, shared.czero);
-    } else {
-        hashTypeSet(o,c->argv[2]->ptr,c->argv[3]->ptr,HASH_SET_COPY);
-        addReply(c, shared.cone);
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_HASH,"hset",c->argv[1],c->db->id);
-        server.dirty++;
-    }
-}
-
-void hsetCommand(client *c) {
-    int i, created = 0;
-    robj *o;
-
-    if ((c->argc % 2) == 1) {
-        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",c->cmd->name);
-        return;
-    }
-
-    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
-    hashTypeTryConversion(o,c->argv,2,c->argc-1);
-
-    for (i = 2; i < c->argc; i += 2)
-        created += !hashTypeSet(o,c->argv[i]->ptr,c->argv[i+1]->ptr,HASH_SET_COPY);
-
-    /* HMSET (deprecated) and HSET return value is different. */
-    char *cmdname = c->argv[0]->ptr;
-    if (cmdname[1] == 's' || cmdname[1] == 'S') {
-        /* HSET */
-        addReplyLongLong(c, created);
-    } else {
-        /* HMSET */
-        addReply(c, shared.ok);
-    }
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_HASH,"hset",c->argv[1],c->db->id);
-    server.dirty += (c->argc - 2)/2;
-}
-
-void hincrbyCommand(client *c) {
-    long long value, incr, oldvalue;
-    robj *o;
-    sds new;
-    unsigned char *vstr;
-    unsigned int vlen;
-
-    if (getLongLongFromObjectOrReply(c,c->argv[3],&incr,NULL) != C_OK) return;
-    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
-    if (hashTypeGetValue(o,c->argv[2]->ptr,&vstr,&vlen,&value) == C_OK) {
-        if (vstr) {
-            if (string2ll((char*)vstr,vlen,&value) == 0) {
-                addReplyError(c,"hash value is not an integer");
-                return;
-            }
-        } /* Else hashTypeGetValue() already stored it into &value */
-    } else {
-        value = 0;
-    }
-
-    oldvalue = value;
-    if ((incr < 0 && oldvalue < 0 && incr < (LLONG_MIN-oldvalue)) ||
-        (incr > 0 && oldvalue > 0 && incr > (LLONG_MAX-oldvalue))) {
-        addReplyError(c,"increment or decrement would overflow");
-        return;
-    }
-    value += incr;
-    new = sdsfromlonglong(value);
-    hashTypeSet(o,c->argv[2]->ptr,new,HASH_SET_TAKE_VALUE);
-    addReplyLongLong(c,value);
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_HASH,"hincrby",c->argv[1],c->db->id);
-    server.dirty++;
-}
-
-void hincrbyfloatCommand(client *c) {
-    long double value, incr;
-    long long ll;
-    robj *o;
-    sds new;
-    unsigned char *vstr;
-    unsigned int vlen;
-
-    if (getLongDoubleFromObjectOrReply(c,c->argv[3],&incr,NULL) != C_OK) return;
-    if ((o = hashTypeLookupWriteOrCreate(c,c->argv[1])) == NULL) return;
-    if (hashTypeGetValue(o,c->argv[2]->ptr,&vstr,&vlen,&ll) == C_OK) {
-        if (vstr) {
-            if (string2ld((char*)vstr,vlen,&value) == 0) {
-                addReplyError(c,"hash value is not a float");
-                return;
-            }
-        } else {
-            value = (long double)ll;
-        }
-    } else {
-        value = 0;
-    }
-
-    value += incr;
-    if (isnan(value) || isinf(value)) {
-        addReplyError(c,"increment would produce NaN or Infinity");
-        return;
-    }
-
-    char buf[MAX_LONG_DOUBLE_CHARS];
-    int len = ld2string(buf,sizeof(buf),value,LD_STR_HUMAN);
-    new = sdsnewlen(buf,len);
-    hashTypeSet(o,c->argv[2]->ptr,new,HASH_SET_TAKE_VALUE);
-    addReplyBulkCBuffer(c,buf,len);
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_HASH,"hincrbyfloat",c->argv[1],c->db->id);
-    server.dirty++;
-
-    /* Always replicate HINCRBYFLOAT as an HSET command with the final value
-     * in order to make sure that differences in float precision or formatting
-     * will not create differences in replicas or after an AOF restart. */
-    robj *newobj;
-    newobj = createRawStringObject(buf,len);
-    rewriteClientCommandArgument(c,0,shared.hset);
-    rewriteClientCommandArgument(c,3,newobj);
-    decrRefCount(newobj);
-}
-
-static void addHashFieldToReply(client *c, robj *o, sds field) {
-    int ret;
-
-    if (o == NULL) {
-        addReplyNull(c);
-        return;
-    }
-
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *vstr = NULL;
-        unsigned int vlen = UINT_MAX;
-        long long vll = LLONG_MAX;
-
-        ret = hashTypeGetFromZiplist(o, field, &vstr, &vlen, &vll);
-        if (ret < 0) {
-            addReplyNull(c);
-        } else {
-            if (vstr) {
-                addReplyBulkCBuffer(c, vstr, vlen);
-            } else {
-                addReplyBulkLongLong(c, vll);
-            }
-        }
-
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        sds value = hashTypeGetFromHashTable(o, field);
-        if (value == NULL)
-            addReplyNull(c);
-        else
-            addReplyBulkCBuffer(c, value, sdslen(value));
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-void hgetCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-
-    addHashFieldToReply(c, o, c->argv[2]->ptr);
-}
-
-void hmgetCommand(client *c) {
-    robj *o;
-    int i;
-
-    /* Don't abort when the key cannot be found. Non-existing keys are empty
-     * hashes, where HMGET should respond with a series of null bulks. */
-    o = lookupKeyRead(c->db, c->argv[1]);
-    if (checkType(c,o,OBJ_HASH)) return;
-
-    addReplyArrayLen(c, c->argc-2);
-    for (i = 2; i < c->argc; i++) {
-        addHashFieldToReply(c, o, c->argv[i]->ptr);
-    }
-}
-
-void hdelCommand(client *c) {
-    robj *o;
-    int j, deleted = 0, keyremoved = 0;
-
-    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-
-    for (j = 2; j < c->argc; j++) {
-        if (hashTypeDelete(o,c->argv[j]->ptr)) {
-            deleted++;
-            if (hashTypeLength(o) == 0) {
-                dbDelete(c->db,c->argv[1]);
-                keyremoved = 1;
-                break;
-            }
-        }
-    }
-    if (deleted) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_HASH,"hdel",c->argv[1],c->db->id);
-        if (keyremoved)
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],
-                                c->db->id);
-        server.dirty += deleted;
-    }
-    addReplyLongLong(c,deleted);
-}
-
-void hlenCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-
-    addReplyLongLong(c,hashTypeLength(o));
-}
-
-void hstrlenCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-    addReplyLongLong(c,hashTypeGetValueLength(o,c->argv[2]->ptr));
-}
-
-static void addHashIteratorCursorToReply(client *c, hashTypeIterator *hi, int what) {
-    if (hi->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *vstr = NULL;
-        unsigned int vlen = UINT_MAX;
-        long long vll = LLONG_MAX;
-
-        hashTypeCurrentFromZiplist(hi, what, &vstr, &vlen, &vll);
-        if (vstr)
-            addReplyBulkCBuffer(c, vstr, vlen);
-        else
-            addReplyBulkLongLong(c, vll);
-    } else if (hi->encoding == OBJ_ENCODING_HT) {
-        sds value = hashTypeCurrentFromHashTable(hi, what);
-        addReplyBulkCBuffer(c, value, sdslen(value));
-    } else {
-        serverPanic("Unknown hash encoding");
-    }
-}
-
-void genericHgetallCommand(client *c, int flags) {
-    robj *o;
-    hashTypeIterator *hi;
-    int length, count = 0;
-
-    robj *emptyResp = (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) ?
-        shared.emptymap[c->resp] : shared.emptyarray;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],emptyResp))
-        == NULL || checkType(c,o,OBJ_HASH)) return;
-
-    /* We return a map if the user requested keys and values, like in the
-     * HGETALL case. Otherwise to use a flat array makes more sense. */
-    length = hashTypeLength(o);
-    if (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) {
-        addReplyMapLen(c, length);
-    } else {
-        addReplyArrayLen(c, length);
-    }
-
-    hi = hashTypeInitIterator(o);
-    while (hashTypeNext(hi) != C_ERR) {
-        if (flags & OBJ_HASH_KEY) {
-            addHashIteratorCursorToReply(c, hi, OBJ_HASH_KEY);
-            count++;
-        }
-        if (flags & OBJ_HASH_VALUE) {
-            addHashIteratorCursorToReply(c, hi, OBJ_HASH_VALUE);
-            count++;
-        }
-    }
-
-    hashTypeReleaseIterator(hi);
-
-    /* Make sure we returned the right number of elements. */
-    if (flags & OBJ_HASH_KEY && flags & OBJ_HASH_VALUE) count /= 2;
-    serverAssert(count == length);
-}
-
-void hkeysCommand(client *c) {
-    genericHgetallCommand(c,OBJ_HASH_KEY);
-}
-
-void hvalsCommand(client *c) {
-    genericHgetallCommand(c,OBJ_HASH_VALUE);
-}
-
-void hgetallCommand(client *c) {
-    genericHgetallCommand(c,OBJ_HASH_KEY|OBJ_HASH_VALUE);
-}
-
-void hexistsCommand(client *c) {
-    robj *o;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-
-    addReply(c, hashTypeExists(o,c->argv[2]->ptr) ? shared.cone : shared.czero);
-}
-
-void hscanCommand(client *c) {
-    robj *o;
-    unsigned long cursor;
-
-    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
-        checkType(c,o,OBJ_HASH)) return;
-    scanGenericCommand(c,o,cursor);
-}
-
-static void harndfieldReplyWithZiplist(client *c, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
-    for (unsigned long i = 0; i < count; i++) {
-        if (vals && c->resp > 2)
-            addReplyArrayLen(c,2);
-        if (keys[i].sval)
-            addReplyBulkCBuffer(c, keys[i].sval, keys[i].slen);
-        else
-            addReplyBulkLongLong(c, keys[i].lval);
-        if (vals) {
-            if (vals[i].sval)
-                addReplyBulkCBuffer(c, vals[i].sval, vals[i].slen);
-            else
-                addReplyBulkLongLong(c, vals[i].lval);
-        }
-    }
-}
-
-/* How many times bigger should be the hash compared to the requested size
- * for us to not use the "remove elements" strategy? Read later in the
- * implementation for more info. */
-#define HRANDFIELD_SUB_STRATEGY_MUL 3
-
-/* If client is trying to ask for a very large number of random elements,
- * queuing may consume an unlimited amount of memory, so we want to limit
- * the number of randoms per time. */
-#define HRANDFIELD_RANDOM_SAMPLE_LIMIT 1000
-
-void hrandfieldWithCountCommand(client *c, long l, int withvalues) {
-    unsigned long count, size;
-    int uniq = 1;
-    robj *hash;
-
-    if ((hash = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray))
-        == NULL || checkType(c,hash,OBJ_HASH)) return;
-    size = hashTypeLength(hash);
-
-    if(l >= 0) {
-        count = (unsigned long) l;
-    } else {
-        count = -l;
-        uniq = 0;
-    }
-
-    /* If count is zero, serve it ASAP to avoid special cases later. */
-    if (count == 0) {
-        addReply(c,shared.emptyarray);
-        return;
-    }
-
-    /* CASE 1: The count was negative, so the extraction method is just:
-     * "return N random elements" sampling the whole set every time.
-     * This case is trivial and can be served without auxiliary data
-     * structures. This case is the only one that also needs to return the
-     * elements in random order. */
-    if (!uniq || count == 1) {
-        if (withvalues && c->resp == 2)
-            addReplyArrayLen(c, count*2);
-        else
-            addReplyArrayLen(c, count);
-        if (hash->encoding == OBJ_ENCODING_HT) {
-            sds key, value;
-            while (count--) {
-                dictEntry *de = dictGetFairRandomKey(hash->ptr);
-                key = dictGetKey(de);
-                value = dictGetVal(de);
-                if (withvalues && c->resp > 2)
-                    addReplyArrayLen(c,2);
-                addReplyBulkCBuffer(c, key, sdslen(key));
-                if (withvalues)
-                    addReplyBulkCBuffer(c, value, sdslen(value));
-            }
-        } else if (hash->encoding == OBJ_ENCODING_ZIPLIST) {
-            ziplistEntry *keys, *vals = NULL;
-            unsigned long limit, sample_count;
-            limit = count > HRANDFIELD_RANDOM_SAMPLE_LIMIT ? HRANDFIELD_RANDOM_SAMPLE_LIMIT : count;
-            keys = zmalloc(sizeof(ziplistEntry)*limit);
-            if (withvalues)
-                vals = zmalloc(sizeof(ziplistEntry)*limit);
-            while (count) {
-                sample_count = count > limit ? limit : count;
-                count -= sample_count;
-                ziplistRandomPairs(hash->ptr, sample_count, keys, vals);
-                harndfieldReplyWithZiplist(c, sample_count, keys, vals);
-            }
-            zfree(keys);
-            zfree(vals);
-        }
-        return;
-    }
-
-    /* Initiate reply count, RESP3 responds with nested array, RESP2 with flat one. */
-    long reply_size = count < size ? count : size;
-    if (withvalues && c->resp == 2)
-        addReplyArrayLen(c, reply_size*2);
-    else
-        addReplyArrayLen(c, reply_size);
-
-    /* CASE 2:
-    * The number of requested elements is greater than the number of
-    * elements inside the hash: simply return the whole hash. */
-    if(count >= size) {
-        hashTypeIterator *hi = hashTypeInitIterator(hash);
-        while (hashTypeNext(hi) != C_ERR) {
-            if (withvalues && c->resp > 2)
-                addReplyArrayLen(c,2);
-            addHashIteratorCursorToReply(c, hi, OBJ_HASH_KEY);
-            if (withvalues)
-                addHashIteratorCursorToReply(c, hi, OBJ_HASH_VALUE);
-        }
-        hashTypeReleaseIterator(hi);
-        return;
-    }
-
-    /* CASE 3:
-     * The number of elements inside the hash is not greater than
-     * HRANDFIELD_SUB_STRATEGY_MUL times the number of requested elements.
-     * In this case we create a hash from scratch with all the elements, and
-     * subtract random elements to reach the requested number of elements.
-     *
-     * This is done because if the number of requested elements is just
-     * a bit less than the number of elements in the hash, the natural approach
-     * used into CASE 4 is highly inefficient. */
-    if (count*HRANDFIELD_SUB_STRATEGY_MUL > size) {
-        dict *d = dictCreate(&sdsReplyDictType, NULL);
-        dictExpand(d, size);
-        hashTypeIterator *hi = hashTypeInitIterator(hash);
-
-        /* Add all the elements into the temporary dictionary. */
-        while ((hashTypeNext(hi)) != C_ERR) {
-            int ret = DICT_ERR;
-            sds key, value = NULL;
-
-            key = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_KEY);
-            if (withvalues)
-                value = hashTypeCurrentObjectNewSds(hi,OBJ_HASH_VALUE);
-            ret = dictAdd(d, key, value);
-
-            serverAssert(ret == DICT_OK);
-        }
-        serverAssert(dictSize(d) == size);
-        hashTypeReleaseIterator(hi);
-
-        /* Remove random elements to reach the right count. */
-        while (size > count) {
-            dictEntry *de;
-            de = dictGetRandomKey(d);
-            dictUnlink(d,dictGetKey(de));
-            sdsfree(dictGetKey(de));
-            sdsfree(dictGetVal(de));
-            dictFreeUnlinkedEntry(d,de);
-            size--;
-        }
-
-        /* Reply with what's in the dict and release memory */
-        dictIterator *di;
-        dictEntry *de;
-        di = dictGetIterator(d);
-        while ((de = dictNext(di)) != NULL) {
-            sds key = dictGetKey(de);
-            sds value = dictGetVal(de);
-            if (withvalues && c->resp > 2)
-                addReplyArrayLen(c,2);
-            addReplyBulkSds(c, key);
-            if (withvalues)
-                addReplyBulkSds(c, value);
-        }
-
-        dictReleaseIterator(di);
-        dictRelease(d);
-    }
-
-    /* CASE 4: We have a big hash compared to the requested number of elements.
-     * In this case we can simply get random elements from the hash and add
-     * to the temporary hash, trying to eventually get enough unique elements
-     * to reach the specified count. */
-    else {
-        if (hash->encoding == OBJ_ENCODING_ZIPLIST) {
-            /* it is inefficient to repeatedly pick one random element from a
-             * ziplist. so we use this instead: */
-            ziplistEntry *keys, *vals = NULL;
-            keys = zmalloc(sizeof(ziplistEntry)*count);
-            if (withvalues)
-                vals = zmalloc(sizeof(ziplistEntry)*count);
-            serverAssert(ziplistRandomPairsUnique(hash->ptr, count, keys, vals) == count);
-            harndfieldReplyWithZiplist(c, count, keys, vals);
-            zfree(keys);
-            zfree(vals);
-            return;
-        }
-
-        /* Hashtable encoding (generic implementation) */
-        unsigned long added = 0;
-        ziplistEntry key, value;
-        dict *d = dictCreate(&hashDictType, NULL);
-        dictExpand(d, count);
-        while(added < count) {
-            hashTypeRandomElement(hash, size, &key, withvalues? &value : NULL);
-
-            /* Try to add the object to the dictionary. If it already exists
-            * free it, otherwise increment the number of objects we have
-            * in the result dictionary. */
-            sds skey = hashSdsFromZiplistEntry(&key);
-            if (dictAdd(d,skey,NULL) != DICT_OK) {
-                sdsfree(skey);
-                continue;
-            }
-            added++;
-
-            /* We can reply right away, so that we don't need to store the value in the dict. */
-            if (withvalues && c->resp > 2)
-                addReplyArrayLen(c,2);
-            hashReplyFromZiplistEntry(c, &key);
-            if (withvalues)
-                hashReplyFromZiplistEntry(c, &value);
-        }
-
-        /* Release memory */
-        dictRelease(d);
-    }
-}
-
-/* HRANDFIELD key [<count> [WITHVALUES]] */
-void hrandfieldCommand(client *c) {
-    long l;
-    int withvalues = 0;
-    robj *hash;
-    ziplistEntry ele;
-
-    if (c->argc >= 3) {
-        if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
-        if (c->argc > 4 || (c->argc == 4 && strcasecmp(c->argv[3]->ptr,"withvalues"))) {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        } else if (c->argc == 4)
-            withvalues = 1;
-        hrandfieldWithCountCommand(c, l, withvalues);
-        return;
-    }
-
-    /* Handle variant without <count> argument. Reply with simple bulk string */
-    if ((hash = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))== NULL ||
-        checkType(c,hash,OBJ_HASH)) {
-        return;
-    }
-
-    hashTypeRandomElement(hash,hashTypeLength(hash),&ele,NULL);
-    hashReplyFromZiplistEntry(c, &ele);
-}
diff --git a/redis-stable/src/t_list.c b/redis-stable/src/t_list.c
deleted file mode 100644
index 66c9e3c9..00000000
--- a/redis-stable/src/t_list.c
+++ /dev/null
@@ -1,1032 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-#define LIST_MAX_ITEM_SIZE ((1ull<<32)-1024)
-
-/*-----------------------------------------------------------------------------
- * List API
- *----------------------------------------------------------------------------*/
-
-/* The function pushes an element to the specified list object 'subject',
- * at head or tail position as specified by 'where'.
- *
- * There is no need for the caller to increment the refcount of 'value' as
- * the function takes care of it if needed. */
-void listTypePush(robj *subject, robj *value, int where) {
-    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
-        int pos = (where == LIST_HEAD) ? QUICKLIST_HEAD : QUICKLIST_TAIL;
-        if (value->encoding == OBJ_ENCODING_INT) {
-            char buf[32];
-            ll2string(buf, 32, (long)value->ptr);
-            quicklistPush(subject->ptr, buf, strlen(buf), pos);
-        } else {
-            quicklistPush(subject->ptr, value->ptr, sdslen(value->ptr), pos);
-        }
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-void *listPopSaver(unsigned char *data, unsigned int sz) {
-    return createStringObject((char*)data,sz);
-}
-
-robj *listTypePop(robj *subject, int where) {
-    long long vlong;
-    robj *value = NULL;
-
-    int ql_where = where == LIST_HEAD ? QUICKLIST_HEAD : QUICKLIST_TAIL;
-    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
-        if (quicklistPopCustom(subject->ptr, ql_where, (unsigned char **)&value,
-                               NULL, &vlong, listPopSaver)) {
-            if (!value)
-                value = createStringObjectFromLongLong(vlong);
-        }
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-    return value;
-}
-
-unsigned long listTypeLength(const robj *subject) {
-    if (subject->encoding == OBJ_ENCODING_QUICKLIST) {
-        return quicklistCount(subject->ptr);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* Initialize an iterator at the specified index. */
-listTypeIterator *listTypeInitIterator(robj *subject, long index,
-                                       unsigned char direction) {
-    listTypeIterator *li = zmalloc(sizeof(listTypeIterator));
-    li->subject = subject;
-    li->encoding = subject->encoding;
-    li->direction = direction;
-    li->iter = NULL;
-    /* LIST_HEAD means start at TAIL and move *towards* head.
-     * LIST_TAIL means start at HEAD and move *towards tail. */
-    int iter_direction =
-        direction == LIST_HEAD ? AL_START_TAIL : AL_START_HEAD;
-    if (li->encoding == OBJ_ENCODING_QUICKLIST) {
-        li->iter = quicklistGetIteratorAtIdx(li->subject->ptr,
-                                             iter_direction, index);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-    return li;
-}
-
-/* Clean up the iterator. */
-void listTypeReleaseIterator(listTypeIterator *li) {
-    zfree(li->iter);
-    zfree(li);
-}
-
-/* Stores pointer to current the entry in the provided entry structure
- * and advances the position of the iterator. Returns 1 when the current
- * entry is in fact an entry, 0 otherwise. */
-int listTypeNext(listTypeIterator *li, listTypeEntry *entry) {
-    /* Protect from converting when iterating */
-    serverAssert(li->subject->encoding == li->encoding);
-
-    entry->li = li;
-    if (li->encoding == OBJ_ENCODING_QUICKLIST) {
-        return quicklistNext(li->iter, &entry->entry);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-    return 0;
-}
-
-/* Return entry or NULL at the current position of the iterator. */
-robj *listTypeGet(listTypeEntry *entry) {
-    robj *value = NULL;
-    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
-        if (entry->entry.value) {
-            value = createStringObject((char *)entry->entry.value,
-                                       entry->entry.sz);
-        } else {
-            value = createStringObjectFromLongLong(entry->entry.longval);
-        }
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-    return value;
-}
-
-void listTypeInsert(listTypeEntry *entry, robj *value, int where) {
-    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
-        value = getDecodedObject(value);
-        sds str = value->ptr;
-        size_t len = sdslen(str);
-        if (where == LIST_TAIL) {
-            quicklistInsertAfter((quicklist *)entry->entry.quicklist,
-                                 &entry->entry, str, len);
-        } else if (where == LIST_HEAD) {
-            quicklistInsertBefore((quicklist *)entry->entry.quicklist,
-                                  &entry->entry, str, len);
-        }
-        decrRefCount(value);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* Compare the given object with the entry at the current position. */
-int listTypeEqual(listTypeEntry *entry, robj *o) {
-    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
-        serverAssertWithInfo(NULL,o,sdsEncodedObject(o));
-        return quicklistCompare(entry->entry.zi,o->ptr,sdslen(o->ptr));
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* Delete the element pointed to. */
-void listTypeDelete(listTypeIterator *iter, listTypeEntry *entry) {
-    if (entry->li->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklistDelEntry(iter->iter, &entry->entry);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* Create a quicklist from a single ziplist */
-void listTypeConvert(robj *subject, int enc) {
-    serverAssertWithInfo(NULL,subject,subject->type==OBJ_LIST);
-    serverAssertWithInfo(NULL,subject,subject->encoding==OBJ_ENCODING_ZIPLIST);
-
-    if (enc == OBJ_ENCODING_QUICKLIST) {
-        size_t zlen = server.list_max_ziplist_size;
-        int depth = server.list_compress_depth;
-        subject->ptr = quicklistCreateFromZiplist(zlen, depth, subject->ptr);
-        subject->encoding = OBJ_ENCODING_QUICKLIST;
-    } else {
-        serverPanic("Unsupported list conversion");
-    }
-}
-
-/* This is a helper function for the COPY command.
- * Duplicate a list object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * The resulting object always has refcount set to 1 */
-robj *listTypeDup(robj *o) {
-    robj *lobj;
-
-    serverAssert(o->type == OBJ_LIST);
-
-    switch (o->encoding) {
-        case OBJ_ENCODING_QUICKLIST:
-            lobj = createObject(OBJ_LIST, quicklistDup(o->ptr));
-            lobj->encoding = OBJ_ENCODING_QUICKLIST;
-            break;
-        default:
-            serverPanic("Unknown list encoding");
-            break;
-    }
-    return lobj;
-}
-
-/*-----------------------------------------------------------------------------
- * List Commands
- *----------------------------------------------------------------------------*/
-
-/* Implements LPUSH/RPUSH/LPUSHX/RPUSHX. 
- * 'xx': push if key exists. */
-void pushGenericCommand(client *c, int where, int xx) {
-    int j;
-
-    for (j = 2; j < c->argc; j++) {
-        if (sdslen(c->argv[j]->ptr) > LIST_MAX_ITEM_SIZE) {
-            addReplyError(c, "Element too large");
-            return;
-        }
-    }
-
-    robj *lobj = lookupKeyWrite(c->db, c->argv[1]);
-    if (checkType(c,lobj,OBJ_LIST)) return;
-    if (!lobj) {
-        if (xx) {
-            addReply(c, shared.czero);
-            return;
-        }
-
-        lobj = createQuicklistObject();
-        quicklistSetOptions(lobj->ptr, server.list_max_ziplist_size,
-                            server.list_compress_depth);
-        dbAdd(c->db,c->argv[1],lobj);
-    }
-
-    for (j = 2; j < c->argc; j++) {
-        listTypePush(lobj,c->argv[j],where);
-        server.dirty++;
-    }
-
-    addReplyLongLong(c, listTypeLength(lobj));
-
-    char *event = (where == LIST_HEAD) ? "lpush" : "rpush";
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_LIST,event,c->argv[1],c->db->id);
-}
-
-/* LPUSH <key> <element> [<element> ...] */
-void lpushCommand(client *c) {
-    pushGenericCommand(c,LIST_HEAD,0);
-}
-
-/* RPUSH <key> <element> [<element> ...] */
-void rpushCommand(client *c) {
-    pushGenericCommand(c,LIST_TAIL,0);
-}
-
-/* LPUSHX <key> <element> [<element> ...] */
-void lpushxCommand(client *c) {
-    pushGenericCommand(c,LIST_HEAD,1);
-}
-
-/* RPUSH <key> <element> [<element> ...] */
-void rpushxCommand(client *c) {
-    pushGenericCommand(c,LIST_TAIL,1);
-}
-
-/* LINSERT <key> (BEFORE|AFTER) <pivot> <element> */
-void linsertCommand(client *c) {
-    int where;
-    robj *subject;
-    listTypeIterator *iter;
-    listTypeEntry entry;
-    int inserted = 0;
-
-    if (strcasecmp(c->argv[2]->ptr,"after") == 0) {
-        where = LIST_TAIL;
-    } else if (strcasecmp(c->argv[2]->ptr,"before") == 0) {
-        where = LIST_HEAD;
-    } else {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    if (sdslen(c->argv[4]->ptr) > LIST_MAX_ITEM_SIZE) {
-        addReplyError(c, "Element too large");
-        return;
-    }
-
-    if ((subject = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,subject,OBJ_LIST)) return;
-
-    /* Seek pivot from head to tail */
-    iter = listTypeInitIterator(subject,0,LIST_TAIL);
-    while (listTypeNext(iter,&entry)) {
-        if (listTypeEqual(&entry,c->argv[3])) {
-            listTypeInsert(&entry,c->argv[4],where);
-            inserted = 1;
-            break;
-        }
-    }
-    listTypeReleaseIterator(iter);
-
-    if (inserted) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_LIST,"linsert",
-                            c->argv[1],c->db->id);
-        server.dirty++;
-    } else {
-        /* Notify client of a failed insert */
-        addReplyLongLong(c,-1);
-        return;
-    }
-
-    addReplyLongLong(c,listTypeLength(subject));
-}
-
-/* LLEN <key> */
-void llenCommand(client *c) {
-    robj *o = lookupKeyReadOrReply(c,c->argv[1],shared.czero);
-    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
-    addReplyLongLong(c,listTypeLength(o));
-}
-
-/* LINDEX <key> <index> */
-void lindexCommand(client *c) {
-    robj *o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]);
-    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
-    long index;
-
-    if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK))
-        return;
-
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklistEntry entry;
-        if (quicklistIndex(o->ptr, index, &entry)) {
-            if (entry.value) {
-                addReplyBulkCBuffer(c, entry.value, entry.sz);
-            } else {
-                addReplyBulkLongLong(c, entry.longval);
-            }
-        } else {
-            addReplyNull(c);
-        }
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* LSET <key> <index> <element> */
-void lsetCommand(client *c) {
-    robj *o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr);
-    if (o == NULL || checkType(c,o,OBJ_LIST)) return;
-    long index;
-    robj *value = c->argv[3];
-
-    if (sdslen(value->ptr) > LIST_MAX_ITEM_SIZE) {
-        addReplyError(c, "Element too large");
-        return;
-    }
-
-    if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK))
-        return;
-
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklist *ql = o->ptr;
-        int replaced = quicklistReplaceAtIndex(ql, index,
-                                               value->ptr, sdslen(value->ptr));
-        if (!replaced) {
-            addReplyErrorObject(c,shared.outofrangeerr);
-        } else {
-            addReply(c,shared.ok);
-            signalModifiedKey(c,c->db,c->argv[1]);
-            notifyKeyspaceEvent(NOTIFY_LIST,"lset",c->argv[1],c->db->id);
-            server.dirty++;
-        }
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* A helper for replying with a list's range between the inclusive start and end
- * indexes as multi-bulk, with support for negative indexes. Note that start
- * must be less than end or an empty array is returned. When the reverse
- * argument is set to a non-zero value, the reply is reversed so that elements
- * are returned from end to start. */
-void addListRangeReply(client *c, robj *o, long start, long end, int reverse) {
-    long rangelen, llen = listTypeLength(o);
-
-    /* Convert negative indexes. */
-    if (start < 0) start = llen+start;
-    if (end < 0) end = llen+end;
-    if (start < 0) start = 0;
-
-    /* Invariant: start >= 0, so this test will be true when end < 0.
-     * The range is empty when start > end or start >= length. */
-    if (start > end || start >= llen) {
-        addReply(c,shared.emptyarray);
-        return;
-    }
-    if (end >= llen) end = llen-1;
-    rangelen = (end-start)+1;
-
-    /* Return the result in form of a multi-bulk reply */
-    addReplyArrayLen(c,rangelen);
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        int from = reverse ? end : start;
-        int direction = reverse ? LIST_HEAD : LIST_TAIL;
-        listTypeIterator *iter = listTypeInitIterator(o,from,direction);
-
-        while(rangelen--) {
-            listTypeEntry entry;
-            listTypeNext(iter, &entry);
-            quicklistEntry *qe = &entry.entry;
-            if (qe->value) {
-                addReplyBulkCBuffer(c,qe->value,qe->sz);
-            } else {
-                addReplyBulkLongLong(c,qe->longval);
-            }
-        }
-        listTypeReleaseIterator(iter);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-}
-
-/* A housekeeping helper for list elements popping tasks. */
-void listElementsRemoved(client *c, robj *key, int where, robj *o, long count) {
-    char *event = (where == LIST_HEAD) ? "lpop" : "rpop";
-
-    notifyKeyspaceEvent(NOTIFY_LIST, event, key, c->db->id);
-    if (listTypeLength(o) == 0) {
-        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", key, c->db->id);
-        dbDelete(c->db, key);
-    }
-    signalModifiedKey(c, c->db, key);
-    server.dirty += count;
-}
-
-/* Implements the generic list pop operation for LPOP/RPOP.
- * The where argument specifies which end of the list is operated on. An
- * optional count may be provided as the third argument of the client's
- * command. */
-void popGenericCommand(client *c, int where) {
-    long count = 0;
-    robj *value;
-
-    if (c->argc > 3) {
-        addReplyErrorFormat(c,"wrong number of arguments for '%s' command",
-                            c->cmd->name);
-        return;
-    } else if (c->argc == 3) {
-        /* Parse the optional count argument. */
-        if (getPositiveLongFromObjectOrReply(c,c->argv[2],&count,NULL) != C_OK) 
-            return;
-        if (count == 0) {
-            /* Fast exit path. */
-            addReplyNullArray(c);
-            return;
-        }
-    }
-
-    robj *o = lookupKeyWriteOrReply(c, c->argv[1], shared.null[c->resp]);
-    if (o == NULL || checkType(c, o, OBJ_LIST))
-        return;
-
-    if (!count) {
-        /* Pop a single element. This is POP's original behavior that replies
-         * with a bulk string. */
-        value = listTypePop(o,where);
-        serverAssert(value != NULL);
-        addReplyBulk(c,value);
-        decrRefCount(value);
-        listElementsRemoved(c,c->argv[1],where,o,1);
-    } else {
-        /* Pop a range of elements. An addition to the original POP command,
-         *  which replies with a multi-bulk. */
-        long llen = listTypeLength(o);
-        long rangelen = (count > llen) ? llen : count;
-        long rangestart = (where == LIST_HEAD) ? 0 : -rangelen;
-        long rangeend = (where == LIST_HEAD) ? rangelen - 1 : -1;
-        int reverse = (where == LIST_HEAD) ? 0 : 1;
-
-        addListRangeReply(c,o,rangestart,rangeend,reverse);
-        quicklistDelRange(o->ptr,rangestart,rangelen);
-        listElementsRemoved(c,c->argv[1],where,o,rangelen);
-    }
-}
-
-/* LPOP <key> [count] */
-void lpopCommand(client *c) {
-    popGenericCommand(c,LIST_HEAD);
-}
-
-/* RPOP <key> [count] */
-void rpopCommand(client *c) {
-    popGenericCommand(c,LIST_TAIL);
-}
-
-/* LRANGE <key> <start> <stop> */
-void lrangeCommand(client *c) {
-    robj *o;
-    long start, end;
-
-    if ((getLongFromObjectOrReply(c, c->argv[2], &start, NULL) != C_OK) ||
-        (getLongFromObjectOrReply(c, c->argv[3], &end, NULL) != C_OK)) return;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray)) == NULL
-         || checkType(c,o,OBJ_LIST)) return;
-
-    addListRangeReply(c,o,start,end,0);
-}
-
-/* LTRIM <key> <start> <stop> */
-void ltrimCommand(client *c) {
-    robj *o;
-    long start, end, llen, ltrim, rtrim;
-
-    if ((getLongFromObjectOrReply(c, c->argv[2], &start, NULL) != C_OK) ||
-        (getLongFromObjectOrReply(c, c->argv[3], &end, NULL) != C_OK)) return;
-
-    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.ok)) == NULL ||
-        checkType(c,o,OBJ_LIST)) return;
-    llen = listTypeLength(o);
-
-    /* convert negative indexes */
-    if (start < 0) start = llen+start;
-    if (end < 0) end = llen+end;
-    if (start < 0) start = 0;
-
-    /* Invariant: start >= 0, so this test will be true when end < 0.
-     * The range is empty when start > end or start >= length. */
-    if (start > end || start >= llen) {
-        /* Out of range start or start > end result in empty list */
-        ltrim = llen;
-        rtrim = 0;
-    } else {
-        if (end >= llen) end = llen-1;
-        ltrim = start;
-        rtrim = llen-end-1;
-    }
-
-    /* Remove list elements to perform the trim */
-    if (o->encoding == OBJ_ENCODING_QUICKLIST) {
-        quicklistDelRange(o->ptr,0,ltrim);
-        quicklistDelRange(o->ptr,-rtrim,rtrim);
-    } else {
-        serverPanic("Unknown list encoding");
-    }
-
-    notifyKeyspaceEvent(NOTIFY_LIST,"ltrim",c->argv[1],c->db->id);
-    if (listTypeLength(o) == 0) {
-        dbDelete(c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
-    }
-    signalModifiedKey(c,c->db,c->argv[1]);
-    server.dirty += (ltrim + rtrim);
-    addReply(c,shared.ok);
-}
-
-/* LPOS key element [RANK rank] [COUNT num-matches] [MAXLEN len]
- *
- * The "rank" is the position of the match, so if it is 1, the first match
- * is returned, if it is 2 the second match is returned and so forth.
- * It is 1 by default. If negative has the same meaning but the search is
- * performed starting from the end of the list.
- *
- * If COUNT is given, instead of returning the single element, a list of
- * all the matching elements up to "num-matches" are returned. COUNT can
- * be combiled with RANK in order to returning only the element starting
- * from the Nth. If COUNT is zero, all the matching elements are returned.
- *
- * MAXLEN tells the command to scan a max of len elements. If zero (the
- * default), all the elements in the list are scanned if needed.
- *
- * The returned elements indexes are always referring to what LINDEX
- * would return. So first element from head is 0, and so forth. */
-void lposCommand(client *c) {
-    robj *o, *ele;
-    ele = c->argv[2];
-    int direction = LIST_TAIL;
-    long rank = 1, count = -1, maxlen = 0; /* Count -1: option not given. */
-
-    if (sdslen(ele->ptr) > LIST_MAX_ITEM_SIZE) {
-        addReplyError(c, "Element too large");
-        return;
-    }
-
-    /* Parse the optional arguments. */
-    for (int j = 3; j < c->argc; j++) {
-        char *opt = c->argv[j]->ptr;
-        int moreargs = (c->argc-1)-j;
-
-        if (!strcasecmp(opt,"RANK") && moreargs) {
-            j++;
-            if (getLongFromObjectOrReply(c, c->argv[j], &rank, NULL) != C_OK)
-                return;
-            if (rank == 0) {
-                addReplyError(c,"RANK can't be zero: use 1 to start from "
-                                "the first match, 2 from the second, ...");
-                return;
-            }
-        } else if (!strcasecmp(opt,"COUNT") && moreargs) {
-            j++;
-            if (getPositiveLongFromObjectOrReply(c, c->argv[j], &count,
-              "COUNT can't be negative") != C_OK)
-                return;
-        } else if (!strcasecmp(opt,"MAXLEN") && moreargs) {
-            j++;
-            if (getPositiveLongFromObjectOrReply(c, c->argv[j], &maxlen, 
-              "MAXLEN can't be negative") != C_OK)
-                return;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    /* A negative rank means start from the tail. */
-    if (rank < 0) {
-        rank = -rank;
-        direction = LIST_HEAD;
-    }
-
-    /* We return NULL or an empty array if there is no such key (or
-     * if we find no matches, depending on the presence of the COUNT option. */
-    if ((o = lookupKeyRead(c->db,c->argv[1])) == NULL) {
-        if (count != -1)
-            addReply(c,shared.emptyarray);
-        else
-            addReply(c,shared.null[c->resp]);
-        return;
-    }
-    if (checkType(c,o,OBJ_LIST)) return;
-
-    /* If we got the COUNT option, prepare to emit an array. */
-    void *arraylenptr = NULL;
-    if (count != -1) arraylenptr = addReplyDeferredLen(c);
-
-    /* Seek the element. */
-    listTypeIterator *li;
-    li = listTypeInitIterator(o,direction == LIST_HEAD ? -1 : 0,direction);
-    listTypeEntry entry;
-    long llen = listTypeLength(o);
-    long index = 0, matches = 0, matchindex = -1, arraylen = 0;
-    while (listTypeNext(li,&entry) && (maxlen == 0 || index < maxlen)) {
-        if (listTypeEqual(&entry,ele)) {
-            matches++;
-            matchindex = (direction == LIST_TAIL) ? index : llen - index - 1;
-            if (matches >= rank) {
-                if (arraylenptr) {
-                    arraylen++;
-                    addReplyLongLong(c,matchindex);
-                    if (count && matches-rank+1 >= count) break;
-                } else {
-                    break;
-                }
-            }
-        }
-        index++;
-        matchindex = -1; /* Remember if we exit the loop without a match. */
-    }
-    listTypeReleaseIterator(li);
-
-    /* Reply to the client. Note that arraylenptr is not NULL only if
-     * the COUNT option was selected. */
-    if (arraylenptr != NULL) {
-        setDeferredArrayLen(c,arraylenptr,arraylen);
-    } else {
-        if (matchindex != -1)
-            addReplyLongLong(c,matchindex);
-        else
-            addReply(c,shared.null[c->resp]);
-    }
-}
-
-/* LREM <key> <count> <element> */
-void lremCommand(client *c) {
-    robj *subject, *obj;
-    obj = c->argv[3];
-    long toremove;
-    long removed = 0;
-
-    if (sdslen(obj->ptr) > LIST_MAX_ITEM_SIZE) {
-        addReplyError(c, "Element too large");
-        return;
-    }
-
-    if ((getLongFromObjectOrReply(c, c->argv[2], &toremove, NULL) != C_OK))
-        return;
-
-    subject = lookupKeyWriteOrReply(c,c->argv[1],shared.czero);
-    if (subject == NULL || checkType(c,subject,OBJ_LIST)) return;
-
-    listTypeIterator *li;
-    if (toremove < 0) {
-        toremove = -toremove;
-        li = listTypeInitIterator(subject,-1,LIST_HEAD);
-    } else {
-        li = listTypeInitIterator(subject,0,LIST_TAIL);
-    }
-
-    listTypeEntry entry;
-    while (listTypeNext(li,&entry)) {
-        if (listTypeEqual(&entry,obj)) {
-            listTypeDelete(li, &entry);
-            server.dirty++;
-            removed++;
-            if (toremove && removed == toremove) break;
-        }
-    }
-    listTypeReleaseIterator(li);
-
-    if (removed) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_LIST,"lrem",c->argv[1],c->db->id);
-    }
-
-    if (listTypeLength(subject) == 0) {
-        dbDelete(c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
-    }
-
-    addReplyLongLong(c,removed);
-}
-
-void lmoveHandlePush(client *c, robj *dstkey, robj *dstobj, robj *value,
-                     int where) {
-    /* Create the list if the key does not exist */
-    if (!dstobj) {
-        dstobj = createQuicklistObject();
-        quicklistSetOptions(dstobj->ptr, server.list_max_ziplist_size,
-                            server.list_compress_depth);
-        dbAdd(c->db,dstkey,dstobj);
-    }
-    signalModifiedKey(c,c->db,dstkey);
-    listTypePush(dstobj,value,where);
-    notifyKeyspaceEvent(NOTIFY_LIST,
-                        where == LIST_HEAD ? "lpush" : "rpush",
-                        dstkey,
-                        c->db->id);
-    /* Always send the pushed value to the client. */
-    addReplyBulk(c,value);
-}
-
-int getListPositionFromObjectOrReply(client *c, robj *arg, int *position) {
-    if (strcasecmp(arg->ptr,"right") == 0) {
-        *position = LIST_TAIL;
-    } else if (strcasecmp(arg->ptr,"left") == 0) {
-        *position = LIST_HEAD;
-    } else {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-robj *getStringObjectFromListPosition(int position) {
-    if (position == LIST_HEAD) {
-        return shared.left;
-    } else {
-        // LIST_TAIL
-        return shared.right;
-    }
-}
-
-void lmoveGenericCommand(client *c, int wherefrom, int whereto) {
-    robj *sobj, *value;
-    if ((sobj = lookupKeyWriteOrReply(c,c->argv[1],shared.null[c->resp]))
-        == NULL || checkType(c,sobj,OBJ_LIST)) return;
-
-    if (listTypeLength(sobj) == 0) {
-        /* This may only happen after loading very old RDB files. Recent
-         * versions of Redis delete keys of empty lists. */
-        addReplyNull(c);
-    } else {
-        robj *dobj = lookupKeyWrite(c->db,c->argv[2]);
-        robj *touchedkey = c->argv[1];
-
-        if (checkType(c,dobj,OBJ_LIST)) return;
-        value = listTypePop(sobj,wherefrom);
-        serverAssert(value); /* assertion for valgrind (avoid NPD) */
-        lmoveHandlePush(c,c->argv[2],dobj,value,whereto);
-
-        /* listTypePop returns an object with its refcount incremented */
-        decrRefCount(value);
-
-        /* Delete the source list when it is empty */
-        notifyKeyspaceEvent(NOTIFY_LIST,
-                            wherefrom == LIST_HEAD ? "lpop" : "rpop",
-                            touchedkey,
-                            c->db->id);
-        if (listTypeLength(sobj) == 0) {
-            dbDelete(c->db,touchedkey);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",
-                                touchedkey,c->db->id);
-        }
-        signalModifiedKey(c,c->db,touchedkey);
-        server.dirty++;
-        if (c->cmd->proc == blmoveCommand) {
-            rewriteClientCommandVector(c,5,shared.lmove,
-                                       c->argv[1],c->argv[2],c->argv[3],c->argv[4]);
-        } else if (c->cmd->proc == brpoplpushCommand) {
-            rewriteClientCommandVector(c,3,shared.rpoplpush,
-                                       c->argv[1],c->argv[2]);
-        }
-    }
-}
-
-/* LMOVE <source> <destination> (LEFT|RIGHT) (LEFT|RIGHT) */
-void lmoveCommand(client *c) {
-    int wherefrom, whereto;
-    if (getListPositionFromObjectOrReply(c,c->argv[3],&wherefrom)
-        != C_OK) return;
-    if (getListPositionFromObjectOrReply(c,c->argv[4],&whereto)
-        != C_OK) return;
-    lmoveGenericCommand(c, wherefrom, whereto);
-}
-
-/* This is the semantic of this command:
- *  RPOPLPUSH srclist dstlist:
- *    IF LLEN(srclist) > 0
- *      element = RPOP srclist
- *      LPUSH dstlist element
- *      RETURN element
- *    ELSE
- *      RETURN nil
- *    END
- *  END
- *
- * The idea is to be able to get an element from a list in a reliable way
- * since the element is not just returned but pushed against another list
- * as well. This command was originally proposed by Ezra Zygmuntowicz.
- */
-void rpoplpushCommand(client *c) {
-    lmoveGenericCommand(c, LIST_TAIL, LIST_HEAD);
-}
-
-/*-----------------------------------------------------------------------------
- * Blocking POP operations
- *----------------------------------------------------------------------------*/
-
-/* This is a helper function for handleClientsBlockedOnKeys(). Its work
- * is to serve a specific client (receiver) that is blocked on 'key'
- * in the context of the specified 'db', doing the following:
- *
- * 1) Provide the client with the 'value' element.
- * 2) If the dstkey is not NULL (we are serving a BLMOVE) also push the
- *    'value' element on the destination list (the "push" side of the command).
- * 3) Propagate the resulting BRPOP, BLPOP and additional xPUSH if any into
- *    the AOF and replication channel.
- *
- * The argument 'wherefrom' is LIST_TAIL or LIST_HEAD, and indicates if the
- * 'value' element was popped from the head (BLPOP) or tail (BRPOP) so that
- * we can propagate the command properly.
- *
- * The argument 'whereto' is LIST_TAIL or LIST_HEAD, and indicates if the
- * 'value' element is to be pushed to the head or tail so that we can
- * propagate the command properly.
- *
- * The function returns C_OK if we are able to serve the client, otherwise
- * C_ERR is returned to signal the caller that the list POP operation
- * should be undone as the client was not served: This only happens for
- * BLMOVE that fails to push the value to the destination key as it is
- * of the wrong type. */
-int serveClientBlockedOnList(client *receiver, robj *key, robj *dstkey, redisDb *db, robj *value, int wherefrom, int whereto)
-{
-    robj *argv[5];
-
-    if (dstkey == NULL) {
-        /* Propagate the [LR]POP operation. */
-        argv[0] = (wherefrom == LIST_HEAD) ? shared.lpop :
-                                             shared.rpop;
-        argv[1] = key;
-        propagate((wherefrom == LIST_HEAD) ?
-            server.lpopCommand : server.rpopCommand,
-            db->id,argv,2,PROPAGATE_AOF|PROPAGATE_REPL);
-
-        /* BRPOP/BLPOP */
-        addReplyArrayLen(receiver,2);
-        addReplyBulk(receiver,key);
-        addReplyBulk(receiver,value);
-
-        /* Notify event. */
-        char *event = (wherefrom == LIST_HEAD) ? "lpop" : "rpop";
-        notifyKeyspaceEvent(NOTIFY_LIST,event,key,receiver->db->id);
-    } else {
-        /* BLMOVE */
-        robj *dstobj =
-            lookupKeyWrite(receiver->db,dstkey);
-        if (!(dstobj &&
-             checkType(receiver,dstobj,OBJ_LIST)))
-        {
-            lmoveHandlePush(receiver,dstkey,dstobj,value,whereto);
-            /* Propagate the LMOVE/RPOPLPUSH operation. */
-            int isbrpoplpush = (receiver->lastcmd->proc == brpoplpushCommand);
-            argv[0] = isbrpoplpush ? shared.rpoplpush : shared.lmove;
-            argv[1] = key;
-            argv[2] = dstkey;
-            argv[3] = getStringObjectFromListPosition(wherefrom);
-            argv[4] = getStringObjectFromListPosition(whereto);
-            propagate(isbrpoplpush ? server.rpoplpushCommand : server.lmoveCommand,
-                db->id,argv,(isbrpoplpush ? 3 : 5),
-                PROPAGATE_AOF|
-                PROPAGATE_REPL);
-
-            /* Notify event ("lpush" or "rpush" was notified by lmoveHandlePush). */
-            notifyKeyspaceEvent(NOTIFY_LIST,wherefrom == LIST_TAIL ? "rpop" : "lpop",
-                                key,receiver->db->id);
-        } else {
-            /* BLMOVE failed because of wrong
-             * destination type. */
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* Blocking RPOP/LPOP */
-void blockingPopGenericCommand(client *c, int where) {
-    robj *o;
-    mstime_t timeout;
-    int j;
-
-    if (getTimeoutFromObjectOrReply(c,c->argv[c->argc-1],&timeout,UNIT_SECONDS)
-        != C_OK) return;
-
-    for (j = 1; j < c->argc-1; j++) {
-        o = lookupKeyWrite(c->db,c->argv[j]);
-        if (o != NULL) {
-            if (checkType(c,o,OBJ_LIST)) {
-                return;
-            } else {
-                if (listTypeLength(o) != 0) {
-                    /* Non empty list, this is like a normal [LR]POP. */
-                    robj *value = listTypePop(o,where);
-                    serverAssert(value != NULL);
-
-                    addReplyArrayLen(c,2);
-                    addReplyBulk(c,c->argv[j]);
-                    addReplyBulk(c,value);
-                    decrRefCount(value);
-                    listElementsRemoved(c,c->argv[j],where,o,1);
-
-                    /* Replicate it as an [LR]POP instead of B[LR]POP. */
-                    rewriteClientCommandVector(c,2,
-                        (where == LIST_HEAD) ? shared.lpop : shared.rpop,
-                        c->argv[j]);
-                    return;
-                }
-            }
-        }
-    }
-
-    /* If we are not allowed to block the client, the only thing
-     * we can do is treating it as a timeout (even with timeout 0). */
-    if (c->flags & CLIENT_DENY_BLOCKING) {
-        addReplyNullArray(c);
-        return;
-    }
-
-    /* If the keys do not exist we must block */
-    struct listPos pos = {where};
-    blockForKeys(c,BLOCKED_LIST,c->argv + 1,c->argc - 2,timeout,NULL,&pos,NULL);
-}
-
-/* BLPOP <key> [<key> ...] <timeout> */
-void blpopCommand(client *c) {
-    blockingPopGenericCommand(c,LIST_HEAD);
-}
-
-/* BLPOP <key> [<key> ...] <timeout> */
-void brpopCommand(client *c) {
-    blockingPopGenericCommand(c,LIST_TAIL);
-}
-
-void blmoveGenericCommand(client *c, int wherefrom, int whereto, mstime_t timeout) {
-    robj *key = lookupKeyWrite(c->db, c->argv[1]);
-    if (checkType(c,key,OBJ_LIST)) return;
-
-    if (key == NULL) {
-        if (c->flags & CLIENT_DENY_BLOCKING) {
-            /* Blocking against an empty list when blocking is not allowed
-             * returns immediately. */
-            addReplyNull(c);
-        } else {
-            /* The list is empty and the client blocks. */
-            struct listPos pos = {wherefrom, whereto};
-            blockForKeys(c,BLOCKED_LIST,c->argv + 1,1,timeout,c->argv[2],&pos,NULL);
-        }
-    } else {
-        /* The list exists and has elements, so
-         * the regular lmoveCommand is executed. */
-        serverAssertWithInfo(c,key,listTypeLength(key) > 0);
-        lmoveGenericCommand(c,wherefrom,whereto);
-    }
-}
-
-/* BLMOVE <source> <destination> (LEFT|RIGHT) (LEFT|RIGHT) <timeout> */
-void blmoveCommand(client *c) {
-    mstime_t timeout;
-    int wherefrom, whereto;
-    if (getListPositionFromObjectOrReply(c,c->argv[3],&wherefrom)
-        != C_OK) return;
-    if (getListPositionFromObjectOrReply(c,c->argv[4],&whereto)
-        != C_OK) return;
-    if (getTimeoutFromObjectOrReply(c,c->argv[5],&timeout,UNIT_SECONDS)
-        != C_OK) return;
-    blmoveGenericCommand(c,wherefrom,whereto,timeout);
-}
-
-/* BRPOPLPUSH <source> <destination> <timeout> */
-void brpoplpushCommand(client *c) {
-    mstime_t timeout;
-    if (getTimeoutFromObjectOrReply(c,c->argv[3],&timeout,UNIT_SECONDS)
-        != C_OK) return;
-    blmoveGenericCommand(c, LIST_TAIL, LIST_HEAD, timeout);
-}
diff --git a/redis-stable/src/t_set.c b/redis-stable/src/t_set.c
deleted file mode 100644
index a4fc5311..00000000
--- a/redis-stable/src/t_set.c
+++ /dev/null
@@ -1,1196 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/*-----------------------------------------------------------------------------
- * Set Commands
- *----------------------------------------------------------------------------*/
-
-void sunionDiffGenericCommand(client *c, robj **setkeys, int setnum,
-                              robj *dstkey, int op);
-
-/* Factory method to return a set that *can* hold "value". When the object has
- * an integer-encodable value, an intset will be returned. Otherwise a regular
- * hash table. */
-robj *setTypeCreate(sds value) {
-    if (isSdsRepresentableAsLongLong(value,NULL) == C_OK)
-        return createIntsetObject();
-    return createSetObject();
-}
-
-/* Add the specified value into a set.
- *
- * If the value was already member of the set, nothing is done and 0 is
- * returned, otherwise the new element is added and 1 is returned. */
-int setTypeAdd(robj *subject, sds value) {
-    long long llval;
-    if (subject->encoding == OBJ_ENCODING_HT) {
-        dict *ht = subject->ptr;
-        dictEntry *de = dictAddRaw(ht,value,NULL);
-        if (de) {
-            dictSetKey(ht,de,sdsdup(value));
-            dictSetVal(ht,de,NULL);
-            return 1;
-        }
-    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
-        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
-            uint8_t success = 0;
-            subject->ptr = intsetAdd(subject->ptr,llval,&success);
-            if (success) {
-                /* Convert to regular set when the intset contains
-                 * too many entries. */
-                size_t max_entries = server.set_max_intset_entries;
-                /* limit to 1G entries due to intset internals. */
-                if (max_entries >= 1<<30) max_entries = 1<<30;
-                if (intsetLen(subject->ptr) > max_entries)
-                    setTypeConvert(subject,OBJ_ENCODING_HT);
-                return 1;
-            }
-        } else {
-            /* Failed to get integer from object, convert to regular set. */
-            setTypeConvert(subject,OBJ_ENCODING_HT);
-
-            /* The set *was* an intset and this value is not integer
-             * encodable, so dictAdd should always work. */
-            serverAssert(dictAdd(subject->ptr,sdsdup(value),NULL) == DICT_OK);
-            return 1;
-        }
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return 0;
-}
-
-int setTypeRemove(robj *setobj, sds value) {
-    long long llval;
-    if (setobj->encoding == OBJ_ENCODING_HT) {
-        if (dictDelete(setobj->ptr,value) == DICT_OK) {
-            if (htNeedsResize(setobj->ptr)) dictResize(setobj->ptr);
-            return 1;
-        }
-    } else if (setobj->encoding == OBJ_ENCODING_INTSET) {
-        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
-            int success;
-            setobj->ptr = intsetRemove(setobj->ptr,llval,&success);
-            if (success) return 1;
-        }
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return 0;
-}
-
-int setTypeIsMember(robj *subject, sds value) {
-    long long llval;
-    if (subject->encoding == OBJ_ENCODING_HT) {
-        return dictFind((dict*)subject->ptr,value) != NULL;
-    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
-        if (isSdsRepresentableAsLongLong(value,&llval) == C_OK) {
-            return intsetFind((intset*)subject->ptr,llval);
-        }
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return 0;
-}
-
-setTypeIterator *setTypeInitIterator(robj *subject) {
-    setTypeIterator *si = zmalloc(sizeof(setTypeIterator));
-    si->subject = subject;
-    si->encoding = subject->encoding;
-    if (si->encoding == OBJ_ENCODING_HT) {
-        si->di = dictGetIterator(subject->ptr);
-    } else if (si->encoding == OBJ_ENCODING_INTSET) {
-        si->ii = 0;
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return si;
-}
-
-void setTypeReleaseIterator(setTypeIterator *si) {
-    if (si->encoding == OBJ_ENCODING_HT)
-        dictReleaseIterator(si->di);
-    zfree(si);
-}
-
-/* Move to the next entry in the set. Returns the object at the current
- * position.
- *
- * Since set elements can be internally be stored as SDS strings or
- * simple arrays of integers, setTypeNext returns the encoding of the
- * set object you are iterating, and will populate the appropriate pointer
- * (sdsele) or (llele) accordingly.
- *
- * Note that both the sdsele and llele pointers should be passed and cannot
- * be NULL since the function will try to defensively populate the non
- * used field with values which are easy to trap if misused.
- *
- * When there are no longer elements -1 is returned. */
-int setTypeNext(setTypeIterator *si, sds *sdsele, int64_t *llele) {
-    if (si->encoding == OBJ_ENCODING_HT) {
-        dictEntry *de = dictNext(si->di);
-        if (de == NULL) return -1;
-        *sdsele = dictGetKey(de);
-        *llele = -123456789; /* Not needed. Defensive. */
-    } else if (si->encoding == OBJ_ENCODING_INTSET) {
-        if (!intsetGet(si->subject->ptr,si->ii++,llele))
-            return -1;
-        *sdsele = NULL; /* Not needed. Defensive. */
-    } else {
-        serverPanic("Wrong set encoding in setTypeNext");
-    }
-    return si->encoding;
-}
-
-/* The not copy on write friendly version but easy to use version
- * of setTypeNext() is setTypeNextObject(), returning new SDS
- * strings. So if you don't retain a pointer to this object you should call
- * sdsfree() against it.
- *
- * This function is the way to go for write operations where COW is not
- * an issue. */
-sds setTypeNextObject(setTypeIterator *si) {
-    int64_t intele;
-    sds sdsele;
-    int encoding;
-
-    encoding = setTypeNext(si,&sdsele,&intele);
-    switch(encoding) {
-        case -1:    return NULL;
-        case OBJ_ENCODING_INTSET:
-            return sdsfromlonglong(intele);
-        case OBJ_ENCODING_HT:
-            return sdsdup(sdsele);
-        default:
-            serverPanic("Unsupported encoding");
-    }
-    return NULL; /* just to suppress warnings */
-}
-
-/* Return random element from a non empty set.
- * The returned element can be an int64_t value if the set is encoded
- * as an "intset" blob of integers, or an SDS string if the set
- * is a regular set.
- *
- * The caller provides both pointers to be populated with the right
- * object. The return value of the function is the object->encoding
- * field of the object and is used by the caller to check if the
- * int64_t pointer or the redis object pointer was populated.
- *
- * Note that both the sdsele and llele pointers should be passed and cannot
- * be NULL since the function will try to defensively populate the non
- * used field with values which are easy to trap if misused. */
-int setTypeRandomElement(robj *setobj, sds *sdsele, int64_t *llele) {
-    if (setobj->encoding == OBJ_ENCODING_HT) {
-        dictEntry *de = dictGetFairRandomKey(setobj->ptr);
-        *sdsele = dictGetKey(de);
-        *llele = -123456789; /* Not needed. Defensive. */
-    } else if (setobj->encoding == OBJ_ENCODING_INTSET) {
-        *llele = intsetRandom(setobj->ptr);
-        *sdsele = NULL; /* Not needed. Defensive. */
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return setobj->encoding;
-}
-
-unsigned long setTypeSize(const robj *subject) {
-    if (subject->encoding == OBJ_ENCODING_HT) {
-        return dictSize((const dict*)subject->ptr);
-    } else if (subject->encoding == OBJ_ENCODING_INTSET) {
-        return intsetLen((const intset*)subject->ptr);
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-}
-
-/* Convert the set to specified encoding. The resulting dict (when converting
- * to a hash table) is presized to hold the number of elements in the original
- * set. */
-void setTypeConvert(robj *setobj, int enc) {
-    setTypeIterator *si;
-    serverAssertWithInfo(NULL,setobj,setobj->type == OBJ_SET &&
-                             setobj->encoding == OBJ_ENCODING_INTSET);
-
-    if (enc == OBJ_ENCODING_HT) {
-        int64_t intele;
-        dict *d = dictCreate(&setDictType,NULL);
-        sds element;
-
-        /* Presize the dict to avoid rehashing */
-        dictExpand(d,intsetLen(setobj->ptr));
-
-        /* To add the elements we extract integers and create redis objects */
-        si = setTypeInitIterator(setobj);
-        while (setTypeNext(si,&element,&intele) != -1) {
-            element = sdsfromlonglong(intele);
-            serverAssert(dictAdd(d,element,NULL) == DICT_OK);
-        }
-        setTypeReleaseIterator(si);
-
-        setobj->encoding = OBJ_ENCODING_HT;
-        zfree(setobj->ptr);
-        setobj->ptr = d;
-    } else {
-        serverPanic("Unsupported set conversion");
-    }
-}
-
-/* This is a helper function for the COPY command.
- * Duplicate a set object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * The resulting object always has refcount set to 1 */
-robj *setTypeDup(robj *o) {
-    robj *set;
-    setTypeIterator *si;
-    sds elesds;
-    int64_t intobj;
-
-    serverAssert(o->type == OBJ_SET);
-
-    /* Create a new set object that have the same encoding as the original object's encoding */
-    if (o->encoding == OBJ_ENCODING_INTSET) {
-        intset *is = o->ptr;
-        size_t size = intsetBlobLen(is);
-        intset *newis = zmalloc(size);
-        memcpy(newis,is,size);
-        set = createObject(OBJ_SET, newis);
-        set->encoding = OBJ_ENCODING_INTSET;
-    } else if (o->encoding == OBJ_ENCODING_HT) {
-        set = createSetObject();
-        dict *d = o->ptr;
-        dictExpand(set->ptr, dictSize(d));
-        si = setTypeInitIterator(o);
-        while (setTypeNext(si, &elesds, &intobj) != -1) {
-            setTypeAdd(set, elesds);
-        }
-        setTypeReleaseIterator(si);
-    } else {
-        serverPanic("Unknown set encoding");
-    }
-    return set;
-}
-
-void saddCommand(client *c) {
-    robj *set;
-    int j, added = 0;
-
-    set = lookupKeyWrite(c->db,c->argv[1]);
-    if (checkType(c,set,OBJ_SET)) return;
-    
-    if (set == NULL) {
-        set = setTypeCreate(c->argv[2]->ptr);
-        dbAdd(c->db,c->argv[1],set);
-    }
-
-    for (j = 2; j < c->argc; j++) {
-        if (setTypeAdd(set,c->argv[j]->ptr)) added++;
-    }
-    if (added) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_SET,"sadd",c->argv[1],c->db->id);
-    }
-    server.dirty += added;
-    addReplyLongLong(c,added);
-}
-
-void sremCommand(client *c) {
-    robj *set;
-    int j, deleted = 0, keyremoved = 0;
-
-    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,set,OBJ_SET)) return;
-
-    for (j = 2; j < c->argc; j++) {
-        if (setTypeRemove(set,c->argv[j]->ptr)) {
-            deleted++;
-            if (setTypeSize(set) == 0) {
-                dbDelete(c->db,c->argv[1]);
-                keyremoved = 1;
-                break;
-            }
-        }
-    }
-    if (deleted) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_SET,"srem",c->argv[1],c->db->id);
-        if (keyremoved)
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],
-                                c->db->id);
-        server.dirty += deleted;
-    }
-    addReplyLongLong(c,deleted);
-}
-
-void smoveCommand(client *c) {
-    robj *srcset, *dstset, *ele;
-    srcset = lookupKeyWrite(c->db,c->argv[1]);
-    dstset = lookupKeyWrite(c->db,c->argv[2]);
-    ele = c->argv[3];
-
-    /* If the source key does not exist return 0 */
-    if (srcset == NULL) {
-        addReply(c,shared.czero);
-        return;
-    }
-
-    /* If the source key has the wrong type, or the destination key
-     * is set and has the wrong type, return with an error. */
-    if (checkType(c,srcset,OBJ_SET) ||
-        checkType(c,dstset,OBJ_SET)) return;
-
-    /* If srcset and dstset are equal, SMOVE is a no-op */
-    if (srcset == dstset) {
-        addReply(c,setTypeIsMember(srcset,ele->ptr) ?
-            shared.cone : shared.czero);
-        return;
-    }
-
-    /* If the element cannot be removed from the src set, return 0. */
-    if (!setTypeRemove(srcset,ele->ptr)) {
-        addReply(c,shared.czero);
-        return;
-    }
-    notifyKeyspaceEvent(NOTIFY_SET,"srem",c->argv[1],c->db->id);
-
-    /* Remove the src set from the database when empty */
-    if (setTypeSize(srcset) == 0) {
-        dbDelete(c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
-    }
-
-    /* Create the destination set when it doesn't exist */
-    if (!dstset) {
-        dstset = setTypeCreate(ele->ptr);
-        dbAdd(c->db,c->argv[2],dstset);
-    }
-
-    signalModifiedKey(c,c->db,c->argv[1]);
-    server.dirty++;
-
-    /* An extra key has changed when ele was successfully added to dstset */
-    if (setTypeAdd(dstset,ele->ptr)) {
-        server.dirty++;
-        signalModifiedKey(c,c->db,c->argv[2]);
-        notifyKeyspaceEvent(NOTIFY_SET,"sadd",c->argv[2],c->db->id);
-    }
-    addReply(c,shared.cone);
-}
-
-void sismemberCommand(client *c) {
-    robj *set;
-
-    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,set,OBJ_SET)) return;
-
-    if (setTypeIsMember(set,c->argv[2]->ptr))
-        addReply(c,shared.cone);
-    else
-        addReply(c,shared.czero);
-}
-
-void smismemberCommand(client *c) {
-    robj *set;
-    int j;
-
-    /* Don't abort when the key cannot be found. Non-existing keys are empty
-     * sets, where SMISMEMBER should respond with a series of zeros. */
-    set = lookupKeyRead(c->db,c->argv[1]);
-    if (set && checkType(c,set,OBJ_SET)) return;
-
-    addReplyArrayLen(c,c->argc - 2);
-
-    for (j = 2; j < c->argc; j++) {
-        if (set && setTypeIsMember(set,c->argv[j]->ptr))
-            addReply(c,shared.cone);
-        else
-            addReply(c,shared.czero);
-    }
-}
-
-void scardCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_SET)) return;
-
-    addReplyLongLong(c,setTypeSize(o));
-}
-
-/* Handle the "SPOP key <count>" variant. The normal version of the
- * command is handled by the spopCommand() function itself. */
-
-/* How many times bigger should be the set compared to the remaining size
- * for us to use the "create new set" strategy? Read later in the
- * implementation for more info. */
-#define SPOP_MOVE_STRATEGY_MUL 5
-
-void spopWithCountCommand(client *c) {
-    long l;
-    unsigned long count, size;
-    robj *set;
-
-    /* Get the count argument */
-    if (getPositiveLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
-    count = (unsigned long) l;
-
-    /* Make sure a key with the name inputted exists, and that it's type is
-     * indeed a set. Otherwise, return nil */
-    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.emptyset[c->resp]))
-        == NULL || checkType(c,set,OBJ_SET)) return;
-
-    /* If count is zero, serve an empty set ASAP to avoid special
-     * cases later. */
-    if (count == 0) {
-        addReply(c,shared.emptyset[c->resp]);
-        return;
-    }
-
-    size = setTypeSize(set);
-
-    /* Generate an SPOP keyspace notification */
-    notifyKeyspaceEvent(NOTIFY_SET,"spop",c->argv[1],c->db->id);
-    server.dirty += (count >= size) ? size : count;
-
-    /* CASE 1:
-     * The number of requested elements is greater than or equal to
-     * the number of elements inside the set: simply return the whole set. */
-    if (count >= size) {
-        /* We just return the entire set */
-        sunionDiffGenericCommand(c,c->argv+1,1,NULL,SET_OP_UNION);
-
-        /* Delete the set as it is now empty */
-        dbDelete(c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
-
-        /* Propagate this command as a DEL operation */
-        rewriteClientCommandVector(c,2,shared.del,c->argv[1]);
-        signalModifiedKey(c,c->db,c->argv[1]);
-        return;
-    }
-
-    /* Case 2 and 3 require to replicate SPOP as a set of SREM commands.
-     * Prepare our replication argument vector. Also send the array length
-     * which is common to both the code paths. */
-    robj *propargv[3];
-    propargv[0] = shared.srem;
-    propargv[1] = c->argv[1];
-    addReplySetLen(c,count);
-
-    /* Common iteration vars. */
-    sds sdsele;
-    robj *objele;
-    int encoding;
-    int64_t llele;
-    unsigned long remaining = size-count; /* Elements left after SPOP. */
-
-    /* If we are here, the number of requested elements is less than the
-     * number of elements inside the set. Also we are sure that count < size.
-     * Use two different strategies.
-     *
-     * CASE 2: The number of elements to return is small compared to the
-     * set size. We can just extract random elements and return them to
-     * the set. */
-    if (remaining*SPOP_MOVE_STRATEGY_MUL > count) {
-        while(count--) {
-            /* Emit and remove. */
-            encoding = setTypeRandomElement(set,&sdsele,&llele);
-            if (encoding == OBJ_ENCODING_INTSET) {
-                addReplyBulkLongLong(c,llele);
-                objele = createStringObjectFromLongLong(llele);
-                set->ptr = intsetRemove(set->ptr,llele,NULL);
-            } else {
-                addReplyBulkCBuffer(c,sdsele,sdslen(sdsele));
-                objele = createStringObject(sdsele,sdslen(sdsele));
-                setTypeRemove(set,sdsele);
-            }
-
-            /* Replicate/AOF this command as an SREM operation */
-            propargv[2] = objele;
-            alsoPropagate(server.sremCommand,c->db->id,propargv,3,
-                PROPAGATE_AOF|PROPAGATE_REPL);
-            decrRefCount(objele);
-        }
-    } else {
-    /* CASE 3: The number of elements to return is very big, approaching
-     * the size of the set itself. After some time extracting random elements
-     * from such a set becomes computationally expensive, so we use
-     * a different strategy, we extract random elements that we don't
-     * want to return (the elements that will remain part of the set),
-     * creating a new set as we do this (that will be stored as the original
-     * set). Then we return the elements left in the original set and
-     * release it. */
-        robj *newset = NULL;
-
-        /* Create a new set with just the remaining elements. */
-        while(remaining--) {
-            encoding = setTypeRandomElement(set,&sdsele,&llele);
-            if (encoding == OBJ_ENCODING_INTSET) {
-                sdsele = sdsfromlonglong(llele);
-            } else {
-                sdsele = sdsdup(sdsele);
-            }
-            if (!newset) newset = setTypeCreate(sdsele);
-            setTypeAdd(newset,sdsele);
-            setTypeRemove(set,sdsele);
-            sdsfree(sdsele);
-        }
-
-        /* Transfer the old set to the client. */
-        setTypeIterator *si;
-        si = setTypeInitIterator(set);
-        while((encoding = setTypeNext(si,&sdsele,&llele)) != -1) {
-            if (encoding == OBJ_ENCODING_INTSET) {
-                addReplyBulkLongLong(c,llele);
-                objele = createStringObjectFromLongLong(llele);
-            } else {
-                addReplyBulkCBuffer(c,sdsele,sdslen(sdsele));
-                objele = createStringObject(sdsele,sdslen(sdsele));
-            }
-
-            /* Replicate/AOF this command as an SREM operation */
-            propargv[2] = objele;
-            alsoPropagate(server.sremCommand,c->db->id,propargv,3,
-                PROPAGATE_AOF|PROPAGATE_REPL);
-            decrRefCount(objele);
-        }
-        setTypeReleaseIterator(si);
-
-        /* Assign the new set as the key value. */
-        dbOverwrite(c->db,c->argv[1],newset);
-    }
-
-    /* Don't propagate the command itself even if we incremented the
-     * dirty counter. We don't want to propagate an SPOP command since
-     * we propagated the command as a set of SREMs operations using
-     * the alsoPropagate() API. */
-    preventCommandPropagation(c);
-    signalModifiedKey(c,c->db,c->argv[1]);
-}
-
-void spopCommand(client *c) {
-    robj *set, *ele;
-    sds sdsele;
-    int64_t llele;
-    int encoding;
-
-    if (c->argc == 3) {
-        spopWithCountCommand(c);
-        return;
-    } else if (c->argc > 3) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Make sure a key with the name inputted exists, and that it's type is
-     * indeed a set */
-    if ((set = lookupKeyWriteOrReply(c,c->argv[1],shared.null[c->resp]))
-         == NULL || checkType(c,set,OBJ_SET)) return;
-
-    /* Get a random element from the set */
-    encoding = setTypeRandomElement(set,&sdsele,&llele);
-
-    /* Remove the element from the set */
-    if (encoding == OBJ_ENCODING_INTSET) {
-        ele = createStringObjectFromLongLong(llele);
-        set->ptr = intsetRemove(set->ptr,llele,NULL);
-    } else {
-        ele = createStringObject(sdsele,sdslen(sdsele));
-        setTypeRemove(set,ele->ptr);
-    }
-
-    notifyKeyspaceEvent(NOTIFY_SET,"spop",c->argv[1],c->db->id);
-
-    /* Replicate/AOF this command as an SREM operation */
-    rewriteClientCommandVector(c,3,shared.srem,c->argv[1],ele);
-
-    /* Add the element to the reply */
-    addReplyBulk(c,ele);
-    decrRefCount(ele);
-
-    /* Delete the set if it's empty */
-    if (setTypeSize(set) == 0) {
-        dbDelete(c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"del",c->argv[1],c->db->id);
-    }
-
-    /* Set has been modified */
-    signalModifiedKey(c,c->db,c->argv[1]);
-    server.dirty++;
-}
-
-/* handle the "SRANDMEMBER key <count>" variant. The normal version of the
- * command is handled by the srandmemberCommand() function itself. */
-
-/* How many times bigger should be the set compared to the requested size
- * for us to don't use the "remove elements" strategy? Read later in the
- * implementation for more info. */
-#define SRANDMEMBER_SUB_STRATEGY_MUL 3
-
-void srandmemberWithCountCommand(client *c) {
-    long l;
-    unsigned long count, size;
-    int uniq = 1;
-    robj *set;
-    sds ele;
-    int64_t llele;
-    int encoding;
-
-    dict *d;
-
-    if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
-    if (l >= 0) {
-        count = (unsigned long) l;
-    } else {
-        /* A negative count means: return the same elements multiple times
-         * (i.e. don't remove the extracted element after every extraction). */
-        count = -l;
-        uniq = 0;
-    }
-
-    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray))
-        == NULL || checkType(c,set,OBJ_SET)) return;
-    size = setTypeSize(set);
-
-    /* If count is zero, serve it ASAP to avoid special cases later. */
-    if (count == 0) {
-        addReply(c,shared.emptyarray);
-        return;
-    }
-
-    /* CASE 1: The count was negative, so the extraction method is just:
-     * "return N random elements" sampling the whole set every time.
-     * This case is trivial and can be served without auxiliary data
-     * structures. This case is the only one that also needs to return the
-     * elements in random order. */
-    if (!uniq || count == 1) {
-        addReplyArrayLen(c,count);
-        while(count--) {
-            encoding = setTypeRandomElement(set,&ele,&llele);
-            if (encoding == OBJ_ENCODING_INTSET) {
-                addReplyBulkLongLong(c,llele);
-            } else {
-                addReplyBulkCBuffer(c,ele,sdslen(ele));
-            }
-        }
-        return;
-    }
-
-    /* CASE 2:
-     * The number of requested elements is greater than the number of
-     * elements inside the set: simply return the whole set. */
-    if (count >= size) {
-        setTypeIterator *si;
-        addReplyArrayLen(c,size);
-        si = setTypeInitIterator(set);
-        while ((encoding = setTypeNext(si,&ele,&llele)) != -1) {
-            if (encoding == OBJ_ENCODING_INTSET) {
-                addReplyBulkLongLong(c,llele);
-            } else {
-                addReplyBulkCBuffer(c,ele,sdslen(ele));
-            }
-            size--;
-        }
-        setTypeReleaseIterator(si);
-        serverAssert(size==0);
-        return;
-    }
-
-    /* For CASE 3 and CASE 4 we need an auxiliary dictionary. */
-    d = dictCreate(&sdsReplyDictType,NULL);
-
-    /* CASE 3:
-     * The number of elements inside the set is not greater than
-     * SRANDMEMBER_SUB_STRATEGY_MUL times the number of requested elements.
-     * In this case we create a set from scratch with all the elements, and
-     * subtract random elements to reach the requested number of elements.
-     *
-     * This is done because if the number of requested elements is just
-     * a bit less than the number of elements in the set, the natural approach
-     * used into CASE 4 is highly inefficient. */
-    if (count*SRANDMEMBER_SUB_STRATEGY_MUL > size) {
-        setTypeIterator *si;
-
-        /* Add all the elements into the temporary dictionary. */
-        si = setTypeInitIterator(set);
-        dictExpand(d, size);
-        while ((encoding = setTypeNext(si,&ele,&llele)) != -1) {
-            int retval = DICT_ERR;
-
-            if (encoding == OBJ_ENCODING_INTSET) {
-                retval = dictAdd(d,sdsfromlonglong(llele),NULL);
-            } else {
-                retval = dictAdd(d,sdsdup(ele),NULL);
-            }
-            serverAssert(retval == DICT_OK);
-        }
-        setTypeReleaseIterator(si);
-        serverAssert(dictSize(d) == size);
-
-        /* Remove random elements to reach the right count. */
-        while (size > count) {
-            dictEntry *de;
-            de = dictGetRandomKey(d);
-            dictUnlink(d,dictGetKey(de));
-            sdsfree(dictGetKey(de));
-            dictFreeUnlinkedEntry(d,de);
-            size--;
-        }
-    }
-
-    /* CASE 4: We have a big set compared to the requested number of elements.
-     * In this case we can simply get random elements from the set and add
-     * to the temporary set, trying to eventually get enough unique elements
-     * to reach the specified count. */
-    else {
-        unsigned long added = 0;
-        sds sdsele;
-
-        dictExpand(d, count);
-        while (added < count) {
-            encoding = setTypeRandomElement(set,&ele,&llele);
-            if (encoding == OBJ_ENCODING_INTSET) {
-                sdsele = sdsfromlonglong(llele);
-            } else {
-                sdsele = sdsdup(ele);
-            }
-            /* Try to add the object to the dictionary. If it already exists
-             * free it, otherwise increment the number of objects we have
-             * in the result dictionary. */
-            if (dictAdd(d,sdsele,NULL) == DICT_OK)
-                added++;
-            else
-                sdsfree(sdsele);
-        }
-    }
-
-    /* CASE 3 & 4: send the result to the user. */
-    {
-        dictIterator *di;
-        dictEntry *de;
-
-        addReplyArrayLen(c,count);
-        di = dictGetIterator(d);
-        while((de = dictNext(di)) != NULL)
-            addReplyBulkSds(c,dictGetKey(de));
-        dictReleaseIterator(di);
-        dictRelease(d);
-    }
-}
-
-/* SRANDMEMBER [<count>] */
-void srandmemberCommand(client *c) {
-    robj *set;
-    sds ele;
-    int64_t llele;
-    int encoding;
-
-    if (c->argc == 3) {
-        srandmemberWithCountCommand(c);
-        return;
-    } else if (c->argc > 3) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Handle variant without <count> argument. Reply with simple bulk string */
-    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))
-        == NULL || checkType(c,set,OBJ_SET)) return;
-
-    encoding = setTypeRandomElement(set,&ele,&llele);
-    if (encoding == OBJ_ENCODING_INTSET) {
-        addReplyBulkLongLong(c,llele);
-    } else {
-        addReplyBulkCBuffer(c,ele,sdslen(ele));
-    }
-}
-
-int qsortCompareSetsByCardinality(const void *s1, const void *s2) {
-    if (setTypeSize(*(robj**)s1) > setTypeSize(*(robj**)s2)) return 1;
-    if (setTypeSize(*(robj**)s1) < setTypeSize(*(robj**)s2)) return -1;
-    return 0;
-}
-
-/* This is used by SDIFF and in this case we can receive NULL that should
- * be handled as empty sets. */
-int qsortCompareSetsByRevCardinality(const void *s1, const void *s2) {
-    robj *o1 = *(robj**)s1, *o2 = *(robj**)s2;
-    unsigned long first = o1 ? setTypeSize(o1) : 0;
-    unsigned long second = o2 ? setTypeSize(o2) : 0;
-
-    if (first < second) return 1;
-    if (first > second) return -1;
-    return 0;
-}
-
-void sinterGenericCommand(client *c, robj **setkeys,
-                          unsigned long setnum, robj *dstkey) {
-    robj **sets = zmalloc(sizeof(robj*)*setnum);
-    setTypeIterator *si;
-    robj *dstset = NULL;
-    sds elesds;
-    int64_t intobj;
-    void *replylen = NULL;
-    unsigned long j, cardinality = 0;
-    int encoding, empty = 0;
-
-    for (j = 0; j < setnum; j++) {
-        robj *setobj = dstkey ?
-            lookupKeyWrite(c->db,setkeys[j]) :
-            lookupKeyRead(c->db,setkeys[j]);
-        if (!setobj) {
-            /* A NULL is considered an empty set */
-            empty += 1;
-            sets[j] = NULL;
-            continue;
-        }
-        if (checkType(c,setobj,OBJ_SET)) {
-            zfree(sets);
-            return;
-        }
-        sets[j] = setobj;
-    }
-
-    /* Set intersection with an empty set always results in an empty set.
-     * Return ASAP if there is an empty set. */
-    if (empty > 0) {
-        zfree(sets);
-        if (dstkey) {
-            if (dbDelete(c->db,dstkey)) {
-                signalModifiedKey(c,c->db,dstkey);
-                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
-                server.dirty++;
-            }
-            addReply(c,shared.czero);
-        } else {
-            addReply(c,shared.emptyset[c->resp]);
-        }
-        return;
-    }
-
-    /* Sort sets from the smallest to largest, this will improve our
-     * algorithm's performance */
-    qsort(sets,setnum,sizeof(robj*),qsortCompareSetsByCardinality);
-
-    /* The first thing we should output is the total number of elements...
-     * since this is a multi-bulk write, but at this stage we don't know
-     * the intersection set size, so we use a trick, append an empty object
-     * to the output list and save the pointer to later modify it with the
-     * right length */
-    if (!dstkey) {
-        replylen = addReplyDeferredLen(c);
-    } else {
-        /* If we have a target key where to store the resulting set
-         * create this key with an empty set inside */
-        dstset = createIntsetObject();
-    }
-
-    /* Iterate all the elements of the first (smallest) set, and test
-     * the element against all the other sets, if at least one set does
-     * not include the element it is discarded */
-    si = setTypeInitIterator(sets[0]);
-    while((encoding = setTypeNext(si,&elesds,&intobj)) != -1) {
-        for (j = 1; j < setnum; j++) {
-            if (sets[j] == sets[0]) continue;
-            if (encoding == OBJ_ENCODING_INTSET) {
-                /* intset with intset is simple... and fast */
-                if (sets[j]->encoding == OBJ_ENCODING_INTSET &&
-                    !intsetFind((intset*)sets[j]->ptr,intobj))
-                {
-                    break;
-                /* in order to compare an integer with an object we
-                 * have to use the generic function, creating an object
-                 * for this */
-                } else if (sets[j]->encoding == OBJ_ENCODING_HT) {
-                    elesds = sdsfromlonglong(intobj);
-                    if (!setTypeIsMember(sets[j],elesds)) {
-                        sdsfree(elesds);
-                        break;
-                    }
-                    sdsfree(elesds);
-                }
-            } else if (encoding == OBJ_ENCODING_HT) {
-                if (!setTypeIsMember(sets[j],elesds)) {
-                    break;
-                }
-            }
-        }
-
-        /* Only take action when all sets contain the member */
-        if (j == setnum) {
-            if (!dstkey) {
-                if (encoding == OBJ_ENCODING_HT)
-                    addReplyBulkCBuffer(c,elesds,sdslen(elesds));
-                else
-                    addReplyBulkLongLong(c,intobj);
-                cardinality++;
-            } else {
-                if (encoding == OBJ_ENCODING_INTSET) {
-                    elesds = sdsfromlonglong(intobj);
-                    setTypeAdd(dstset,elesds);
-                    sdsfree(elesds);
-                } else {
-                    setTypeAdd(dstset,elesds);
-                }
-            }
-        }
-    }
-    setTypeReleaseIterator(si);
-
-    if (dstkey) {
-        /* Store the resulting set into the target, if the intersection
-         * is not an empty set. */
-        if (setTypeSize(dstset) > 0) {
-            setKey(c,c->db,dstkey,dstset);
-            addReplyLongLong(c,setTypeSize(dstset));
-            notifyKeyspaceEvent(NOTIFY_SET,"sinterstore",
-                dstkey,c->db->id);
-            server.dirty++;
-        } else {
-            addReply(c,shared.czero);
-            if (dbDelete(c->db,dstkey)) {
-                server.dirty++;
-                signalModifiedKey(c,c->db,dstkey);
-                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
-            }
-        }
-        decrRefCount(dstset);
-    } else {
-        setDeferredSetLen(c,replylen,cardinality);
-    }
-    zfree(sets);
-}
-
-/* SINTER key [key ...] */
-void sinterCommand(client *c) {
-    sinterGenericCommand(c,c->argv+1,c->argc-1,NULL);
-}
-
-/* SINTERSTORE destination key [key ...] */
-void sinterstoreCommand(client *c) {
-    sinterGenericCommand(c,c->argv+2,c->argc-2,c->argv[1]);
-}
-
-#define SET_OP_UNION 0
-#define SET_OP_DIFF 1
-#define SET_OP_INTER 2
-
-void sunionDiffGenericCommand(client *c, robj **setkeys, int setnum,
-                              robj *dstkey, int op) {
-    robj **sets = zmalloc(sizeof(robj*)*setnum);
-    setTypeIterator *si;
-    robj *dstset = NULL;
-    sds ele;
-    int j, cardinality = 0;
-    int diff_algo = 1;
-
-    for (j = 0; j < setnum; j++) {
-        robj *setobj = dstkey ?
-            lookupKeyWrite(c->db,setkeys[j]) :
-            lookupKeyRead(c->db,setkeys[j]);
-        if (!setobj) {
-            sets[j] = NULL;
-            continue;
-        }
-        if (checkType(c,setobj,OBJ_SET)) {
-            zfree(sets);
-            return;
-        }
-        sets[j] = setobj;
-    }
-
-    /* Select what DIFF algorithm to use.
-     *
-     * Algorithm 1 is O(N*M) where N is the size of the element first set
-     * and M the total number of sets.
-     *
-     * Algorithm 2 is O(N) where N is the total number of elements in all
-     * the sets.
-     *
-     * We compute what is the best bet with the current input here. */
-    if (op == SET_OP_DIFF && sets[0]) {
-        long long algo_one_work = 0, algo_two_work = 0;
-
-        for (j = 0; j < setnum; j++) {
-            if (sets[j] == NULL) continue;
-
-            algo_one_work += setTypeSize(sets[0]);
-            algo_two_work += setTypeSize(sets[j]);
-        }
-
-        /* Algorithm 1 has better constant times and performs less operations
-         * if there are elements in common. Give it some advantage. */
-        algo_one_work /= 2;
-        diff_algo = (algo_one_work <= algo_two_work) ? 1 : 2;
-
-        if (diff_algo == 1 && setnum > 1) {
-            /* With algorithm 1 it is better to order the sets to subtract
-             * by decreasing size, so that we are more likely to find
-             * duplicated elements ASAP. */
-            qsort(sets+1,setnum-1,sizeof(robj*),
-                qsortCompareSetsByRevCardinality);
-        }
-    }
-
-    /* We need a temp set object to store our union. If the dstkey
-     * is not NULL (that is, we are inside an SUNIONSTORE operation) then
-     * this set object will be the resulting object to set into the target key*/
-    dstset = createIntsetObject();
-
-    if (op == SET_OP_UNION) {
-        /* Union is trivial, just add every element of every set to the
-         * temporary set. */
-        for (j = 0; j < setnum; j++) {
-            if (!sets[j]) continue; /* non existing keys are like empty sets */
-
-            si = setTypeInitIterator(sets[j]);
-            while((ele = setTypeNextObject(si)) != NULL) {
-                if (setTypeAdd(dstset,ele)) cardinality++;
-                sdsfree(ele);
-            }
-            setTypeReleaseIterator(si);
-        }
-    } else if (op == SET_OP_DIFF && sets[0] && diff_algo == 1) {
-        /* DIFF Algorithm 1:
-         *
-         * We perform the diff by iterating all the elements of the first set,
-         * and only adding it to the target set if the element does not exist
-         * into all the other sets.
-         *
-         * This way we perform at max N*M operations, where N is the size of
-         * the first set, and M the number of sets. */
-        si = setTypeInitIterator(sets[0]);
-        while((ele = setTypeNextObject(si)) != NULL) {
-            for (j = 1; j < setnum; j++) {
-                if (!sets[j]) continue; /* no key is an empty set. */
-                if (sets[j] == sets[0]) break; /* same set! */
-                if (setTypeIsMember(sets[j],ele)) break;
-            }
-            if (j == setnum) {
-                /* There is no other set with this element. Add it. */
-                setTypeAdd(dstset,ele);
-                cardinality++;
-            }
-            sdsfree(ele);
-        }
-        setTypeReleaseIterator(si);
-    } else if (op == SET_OP_DIFF && sets[0] && diff_algo == 2) {
-        /* DIFF Algorithm 2:
-         *
-         * Add all the elements of the first set to the auxiliary set.
-         * Then remove all the elements of all the next sets from it.
-         *
-         * This is O(N) where N is the sum of all the elements in every
-         * set. */
-        for (j = 0; j < setnum; j++) {
-            if (!sets[j]) continue; /* non existing keys are like empty sets */
-
-            si = setTypeInitIterator(sets[j]);
-            while((ele = setTypeNextObject(si)) != NULL) {
-                if (j == 0) {
-                    if (setTypeAdd(dstset,ele)) cardinality++;
-                } else {
-                    if (setTypeRemove(dstset,ele)) cardinality--;
-                }
-                sdsfree(ele);
-            }
-            setTypeReleaseIterator(si);
-
-            /* Exit if result set is empty as any additional removal
-             * of elements will have no effect. */
-            if (cardinality == 0) break;
-        }
-    }
-
-    /* Output the content of the resulting set, if not in STORE mode */
-    if (!dstkey) {
-        addReplySetLen(c,cardinality);
-        si = setTypeInitIterator(dstset);
-        while((ele = setTypeNextObject(si)) != NULL) {
-            addReplyBulkCBuffer(c,ele,sdslen(ele));
-            sdsfree(ele);
-        }
-        setTypeReleaseIterator(si);
-        server.lazyfree_lazy_server_del ? freeObjAsync(NULL, dstset) :
-                                          decrRefCount(dstset);
-    } else {
-        /* If we have a target key where to store the resulting set
-         * create this key with the result set inside */
-        if (setTypeSize(dstset) > 0) {
-            setKey(c,c->db,dstkey,dstset);
-            addReplyLongLong(c,setTypeSize(dstset));
-            notifyKeyspaceEvent(NOTIFY_SET,
-                op == SET_OP_UNION ? "sunionstore" : "sdiffstore",
-                dstkey,c->db->id);
-            server.dirty++;
-        } else {
-            addReply(c,shared.czero);
-            if (dbDelete(c->db,dstkey)) {
-                server.dirty++;
-                signalModifiedKey(c,c->db,dstkey);
-                notifyKeyspaceEvent(NOTIFY_GENERIC,"del",dstkey,c->db->id);
-            }
-        }
-        decrRefCount(dstset);
-    }
-    zfree(sets);
-}
-
-/* SUNION key [key ...] */
-void sunionCommand(client *c) {
-    sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,SET_OP_UNION);
-}
-
-/* SUNIONSTORE destination key [key ...] */
-void sunionstoreCommand(client *c) {
-    sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],SET_OP_UNION);
-}
-
-/* SDIFF key [key ...] */
-void sdiffCommand(client *c) {
-    sunionDiffGenericCommand(c,c->argv+1,c->argc-1,NULL,SET_OP_DIFF);
-}
-
-/* SDIFFSTORE destination key [key ...] */
-void sdiffstoreCommand(client *c) {
-    sunionDiffGenericCommand(c,c->argv+2,c->argc-2,c->argv[1],SET_OP_DIFF);
-}
-
-void sscanCommand(client *c) {
-    robj *set;
-    unsigned long cursor;
-
-    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
-    if ((set = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
-        checkType(c,set,OBJ_SET)) return;
-    scanGenericCommand(c,set,cursor);
-}
diff --git a/redis-stable/src/t_stream.c b/redis-stable/src/t_stream.c
deleted file mode 100644
index 51ac2a31..00000000
--- a/redis-stable/src/t_stream.c
+++ /dev/null
@@ -1,3668 +0,0 @@
-/*
- * Copyright (c) 2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "endianconv.h"
-#include "stream.h"
-
-/* Every stream item inside the listpack, has a flags field that is used to
- * mark the entry as deleted, or having the same field as the "master"
- * entry at the start of the listpack> */
-#define STREAM_ITEM_FLAG_NONE 0             /* No special flags. */
-#define STREAM_ITEM_FLAG_DELETED (1<<0)     /* Entry is deleted. Skip it. */
-#define STREAM_ITEM_FLAG_SAMEFIELDS (1<<1)  /* Same fields as master entry. */
-
-/* For stream commands that require multiple IDs
- * when the number of IDs is less than 'STREAMID_STATIC_VECTOR_LEN',
- * avoid malloc allocation.*/
-#define STREAMID_STATIC_VECTOR_LEN 8
-
-/* Max pre-allocation for listpack. This is done to avoid abuse of a user
- * setting stream_node_max_bytes to a huge number. */
-#define STREAM_LISTPACK_MAX_PRE_ALLOCATE 4096
-
-/* Don't let listpacks grow too big, even if the user config allows it.
- * doing so can lead to an overflow (trying to store more than 32bit length
- * into the listpack header), or actually an assertion since lpInsert
- * will return NULL. */
-#define STREAM_LISTPACK_MAX_SIZE (1<<30)
-
-void streamFreeCG(streamCG *cg);
-void streamFreeNACK(streamNACK *na);
-size_t streamReplyWithRangeFromConsumerPEL(client *c, stream *s, streamID *start, streamID *end, size_t count, streamConsumer *consumer);
-int streamParseStrictIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq);
-int streamParseIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq);
-
-/* -----------------------------------------------------------------------
- * Low level stream encoding: a radix tree of listpacks.
- * ----------------------------------------------------------------------- */
-
-/* Create a new stream data structure. */
-stream *streamNew(void) {
-    stream *s = zmalloc(sizeof(*s));
-    s->rax = raxNew();
-    s->length = 0;
-    s->last_id.ms = 0;
-    s->last_id.seq = 0;
-    s->cgroups = NULL; /* Created on demand to save memory when not used. */
-    return s;
-}
-
-/* Free a stream, including the listpacks stored inside the radix tree. */
-void freeStream(stream *s) {
-    raxFreeWithCallback(s->rax,(void(*)(void*))lpFree);
-    if (s->cgroups)
-        raxFreeWithCallback(s->cgroups,(void(*)(void*))streamFreeCG);
-    zfree(s);
-}
-
-/* Return the length of a stream. */
-unsigned long streamLength(const robj *subject) {
-    stream *s = subject->ptr;
-    return s->length;
-}
-
-/* Set 'id' to be its successor stream ID.
- * If 'id' is the maximal possible id, it is wrapped around to 0-0 and a
- * C_ERR is returned. */
-int streamIncrID(streamID *id) {
-    int ret = C_OK;
-    if (id->seq == UINT64_MAX) {
-        if (id->ms == UINT64_MAX) {
-            /* Special case where 'id' is the last possible streamID... */
-            id->ms = id->seq = 0;
-            ret = C_ERR;
-        } else {
-            id->ms++;
-            id->seq = 0;
-        }
-    } else {
-        id->seq++;
-    }
-    return ret;
-}
-
-/* Set 'id' to be its predecessor stream ID.
- * If 'id' is the minimal possible id, it remains 0-0 and a C_ERR is
- * returned. */
-int streamDecrID(streamID *id) {
-    int ret = C_OK;
-    if (id->seq == 0) {
-        if (id->ms == 0) {
-            /* Special case where 'id' is the first possible streamID... */
-            id->ms = id->seq = UINT64_MAX;
-            ret = C_ERR;
-        } else {
-            id->ms--;
-            id->seq = UINT64_MAX;
-        }
-    } else {
-        id->seq--;
-    }
-    return ret;
-}
-
-/* Generate the next stream item ID given the previous one. If the current
- * milliseconds Unix time is greater than the previous one, just use this
- * as time part and start with sequence part of zero. Otherwise we use the
- * previous time (and never go backward) and increment the sequence. */
-void streamNextID(streamID *last_id, streamID *new_id) {
-    uint64_t ms = mstime();
-    if (ms > last_id->ms) {
-        new_id->ms = ms;
-        new_id->seq = 0;
-    } else {
-        *new_id = *last_id;
-        streamIncrID(new_id);
-    }
-}
-
-/* This is a helper function for the COPY command.
- * Duplicate a Stream object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * The resulting object always has refcount set to 1 */
-robj *streamDup(robj *o) {
-    robj *sobj;
-
-    serverAssert(o->type == OBJ_STREAM);
-
-    switch (o->encoding) {
-        case OBJ_ENCODING_STREAM:
-            sobj = createStreamObject();
-            break;
-        default:
-            serverPanic("Wrong encoding.");
-            break;
-    }
-
-    stream *s;
-    stream *new_s;
-    s = o->ptr;
-    new_s = sobj->ptr;
-
-    raxIterator ri;
-    uint64_t rax_key[2];
-    raxStart(&ri, s->rax);
-    raxSeek(&ri, "^", NULL, 0);
-    size_t lp_bytes = 0;      /* Total bytes in the listpack. */
-    unsigned char *lp = NULL; /* listpack pointer. */
-    /* Get a reference to the listpack node. */
-    while (raxNext(&ri)) {
-        lp = ri.data;
-        lp_bytes = lpBytes(lp);
-        unsigned char *new_lp = zmalloc(lp_bytes);
-        memcpy(new_lp, lp, lp_bytes);
-        memcpy(rax_key, ri.key, sizeof(rax_key));
-        raxInsert(new_s->rax, (unsigned char *)&rax_key, sizeof(rax_key),
-                  new_lp, NULL);
-    }
-    new_s->length = s->length;
-    new_s->last_id = s->last_id;
-    raxStop(&ri);
-
-    if (s->cgroups == NULL) return sobj;
-
-    /* Consumer Groups */
-    raxIterator ri_cgroups;
-    raxStart(&ri_cgroups, s->cgroups);
-    raxSeek(&ri_cgroups, "^", NULL, 0);
-    while (raxNext(&ri_cgroups)) {
-        streamCG *cg = ri_cgroups.data;
-        streamCG *new_cg = streamCreateCG(new_s, (char *)ri_cgroups.key,
-                                          ri_cgroups.key_len, &cg->last_id);
-
-        serverAssert(new_cg != NULL);
-
-        /* Consumer Group PEL */
-        raxIterator ri_cg_pel;
-        raxStart(&ri_cg_pel,cg->pel);
-        raxSeek(&ri_cg_pel,"^",NULL,0);
-        while(raxNext(&ri_cg_pel)){
-            streamNACK *nack = ri_cg_pel.data;
-            streamNACK *new_nack = streamCreateNACK(NULL);
-            new_nack->delivery_time = nack->delivery_time;
-            new_nack->delivery_count = nack->delivery_count;
-            raxInsert(new_cg->pel, ri_cg_pel.key, sizeof(streamID), new_nack, NULL);
-        }
-        raxStop(&ri_cg_pel);
-
-        /* Consumers */
-        raxIterator ri_consumers;
-        raxStart(&ri_consumers, cg->consumers);
-        raxSeek(&ri_consumers, "^", NULL, 0);
-        while (raxNext(&ri_consumers)) {
-            streamConsumer *consumer = ri_consumers.data;
-            streamConsumer *new_consumer;
-            new_consumer = zmalloc(sizeof(*new_consumer));
-            new_consumer->name = sdsdup(consumer->name);
-            new_consumer->pel = raxNew();
-            raxInsert(new_cg->consumers,(unsigned char *)new_consumer->name,
-                        sdslen(new_consumer->name), new_consumer, NULL);
-            new_consumer->seen_time = consumer->seen_time;
-
-            /* Consumer PEL */
-            raxIterator ri_cpel;
-            raxStart(&ri_cpel, consumer->pel);
-            raxSeek(&ri_cpel, "^", NULL, 0);
-            while (raxNext(&ri_cpel)) {
-                streamNACK *new_nack = raxFind(new_cg->pel,ri_cpel.key,sizeof(streamID));
-
-                serverAssert(new_nack != raxNotFound);
-
-                new_nack->consumer = new_consumer;
-                raxInsert(new_consumer->pel,ri_cpel.key,sizeof(streamID),new_nack,NULL);
-            }
-            raxStop(&ri_cpel);
-        }
-        raxStop(&ri_consumers);
-    }
-    raxStop(&ri_cgroups);
-    return sobj;
-}
-
-/* This is just a wrapper for lpAppend() to directly use a 64 bit integer
- * instead of a string. */
-unsigned char *lpAppendInteger(unsigned char *lp, int64_t value) {
-    char buf[LONG_STR_SIZE];
-    int slen = ll2string(buf,sizeof(buf),value);
-    return lpAppend(lp,(unsigned char*)buf,slen);
-}
-
-/* This is just a wrapper for lpReplace() to directly use a 64 bit integer
- * instead of a string to replace the current element. The function returns
- * the new listpack as return value, and also updates the current cursor
- * by updating '*pos'. */
-unsigned char *lpReplaceInteger(unsigned char *lp, unsigned char **pos, int64_t value) {
-    char buf[LONG_STR_SIZE];
-    int slen = ll2string(buf,sizeof(buf),value);
-    return lpInsert(lp, (unsigned char*)buf, slen, *pos, LP_REPLACE, pos);
-}
-
-/* This is a wrapper function for lpGet() to directly get an integer value
- * from the listpack (that may store numbers as a string), converting
- * the string if needed.
- * The 'valid" argument is an optional output parameter to get an indication
- * if the record was valid, when this parameter is NULL, the function will
- * fail with an assertion. */
-static inline int64_t lpGetIntegerIfValid(unsigned char *ele, int *valid) {
-    int64_t v;
-    unsigned char *e = lpGet(ele,&v,NULL);
-    if (e == NULL) {
-        if (valid)
-            *valid = 1;
-        return v;
-    }
-    /* The following code path should never be used for how listpacks work:
-     * they should always be able to store an int64_t value in integer
-     * encoded form. However the implementation may change. */
-    long long ll;
-    int ret = string2ll((char*)e,v,&ll);
-    if (valid)
-        *valid = ret;
-    else
-        serverAssert(ret != 0);
-    v = ll;
-    return v;
-}
-
-#define lpGetInteger(ele) lpGetIntegerIfValid(ele, NULL)
-
-/* Get an edge streamID of a given listpack.
- * 'master_id' is an input param, used to build the 'edge_id' output param */
-int lpGetEdgeStreamID(unsigned char *lp, int first, streamID *master_id, streamID *edge_id)
-{
-   if (lp == NULL)
-       return 0;
-
-   unsigned char *lp_ele;
-
-   /* We need to seek either the first or the last entry depending
-    * on the direction of the iteration. */
-   if (first) {
-       /* Get the master fields count. */
-       lp_ele = lpFirst(lp);        /* Seek items count */
-       lp_ele = lpNext(lp, lp_ele); /* Seek deleted count. */
-       lp_ele = lpNext(lp, lp_ele); /* Seek num fields. */
-       int64_t master_fields_count = lpGetInteger(lp_ele);
-       lp_ele = lpNext(lp, lp_ele); /* Seek first field. */
-
-       /* If we are iterating in normal order, skip the master fields
-        * to seek the first actual entry. */
-       for (int64_t i = 0; i < master_fields_count; i++)
-           lp_ele = lpNext(lp, lp_ele);
-
-       /* If we are going forward, skip the previous entry's
-        * lp-count field (or in case of the master entry, the zero
-        * term field) */
-       lp_ele = lpNext(lp, lp_ele);
-       if (lp_ele == NULL)
-           return 0;
-   } else {
-       /* If we are iterating in reverse direction, just seek the
-        * last part of the last entry in the listpack (that is, the
-        * fields count). */
-       lp_ele = lpLast(lp);
-
-       /* If we are going backward, read the number of elements this
-        * entry is composed of, and jump backward N times to seek
-        * its start. */
-       int64_t lp_count = lpGetInteger(lp_ele);
-       if (lp_count == 0) /* We reached the master entry. */
-           return 0;
-
-       while (lp_count--)
-           lp_ele = lpPrev(lp, lp_ele);
-   }
-
-   lp_ele = lpNext(lp, lp_ele); /* Seek ID (lp_ele currently points to 'flags'). */
-
-   /* Get the ID: it is encoded as difference between the master
-    * ID and this entry ID. */
-   streamID id = *master_id;
-   id.ms += lpGetInteger(lp_ele);
-   lp_ele = lpNext(lp, lp_ele);
-   id.seq += lpGetInteger(lp_ele);
-   *edge_id = id;
-   return 1;
-}
-
-/* Debugging function to log the full content of a listpack. Useful
- * for development and debugging. */
-void streamLogListpackContent(unsigned char *lp) {
-    unsigned char *p = lpFirst(lp);
-    while(p) {
-        unsigned char buf[LP_INTBUF_SIZE];
-        int64_t v;
-        unsigned char *ele = lpGet(p,&v,buf);
-        serverLog(LL_WARNING,"- [%d] '%.*s'", (int)v, (int)v, ele);
-        p = lpNext(lp,p);
-    }
-}
-
-/* Convert the specified stream entry ID as a 128 bit big endian number, so
- * that the IDs can be sorted lexicographically. */
-void streamEncodeID(void *buf, streamID *id) {
-    uint64_t e[2];
-    e[0] = htonu64(id->ms);
-    e[1] = htonu64(id->seq);
-    memcpy(buf,e,sizeof(e));
-}
-
-/* This is the reverse of streamEncodeID(): the decoded ID will be stored
- * in the 'id' structure passed by reference. The buffer 'buf' must point
- * to a 128 bit big-endian encoded ID. */
-void streamDecodeID(void *buf, streamID *id) {
-    uint64_t e[2];
-    memcpy(e,buf,sizeof(e));
-    id->ms = ntohu64(e[0]);
-    id->seq = ntohu64(e[1]);
-}
-
-/* Compare two stream IDs. Return -1 if a < b, 0 if a == b, 1 if a > b. */
-int streamCompareID(streamID *a, streamID *b) {
-    if (a->ms > b->ms) return 1;
-    else if (a->ms < b->ms) return -1;
-    /* The ms part is the same. Check the sequence part. */
-    else if (a->seq > b->seq) return 1;
-    else if (a->seq < b->seq) return -1;
-    /* Everything is the same: IDs are equal. */
-    return 0;
-}
-
-void streamGetEdgeID(stream *s, int first, streamID *edge_id)
-{
-    raxIterator ri;
-    raxStart(&ri, s->rax);
-    int empty;
-    if (first) {
-        raxSeek(&ri, "^", NULL, 0);
-        empty = !raxNext(&ri);
-    } else {
-        raxSeek(&ri, "$", NULL, 0);
-        empty = !raxPrev(&ri);
-    }
-
-    if (empty) {
-        /* Stream is empty, mark edge ID as lowest/highest possible. */
-        edge_id->ms = first ? UINT64_MAX : 0;
-        edge_id->seq = first ? UINT64_MAX : 0;
-        raxStop(&ri);
-        return;
-    }
-
-    unsigned char *lp = ri.data;
-
-    /* Read the master ID from the radix tree key. */
-    streamID master_id;
-    streamDecodeID(ri.key, &master_id);
-
-    /* Construct edge ID. */
-    lpGetEdgeStreamID(lp, first, &master_id, edge_id);
-
-    raxStop(&ri);
-}
-
-/* Adds a new item into the stream 's' having the specified number of
- * field-value pairs as specified in 'numfields' and stored into 'argv'.
- * Returns the new entry ID populating the 'added_id' structure.
- *
- * If 'use_id' is not NULL, the ID is not auto-generated by the function,
- * but instead the passed ID is used to add the new entry. In this case
- * adding the entry may fail as specified later in this comment.
- *
- * The function returns C_OK if the item was added, this is always true
- * if the ID was generated by the function. However the function may return
- * C_ERR in several cases:
- * 1. If an ID was given via 'use_id', but adding it failed since the
- *    current top ID is greater or equal. errno will be set to EDOM.
- * 2. If a size of a single element or the sum of the elements is too big to
- *    be stored into the stream. errno will be set to ERANGE. */
-int streamAppendItem(stream *s, robj **argv, int64_t numfields, streamID *added_id, streamID *use_id) {
-
-    /* Generate the new entry ID. */
-    streamID id;
-    if (use_id)
-        id = *use_id;
-    else
-        streamNextID(&s->last_id,&id);
-
-    /* Check that the new ID is greater than the last entry ID
-     * or return an error. Automatically generated IDs might
-     * overflow (and wrap-around) when incrementing the sequence
-       part. */
-    if (streamCompareID(&id,&s->last_id) <= 0) {
-        errno = EDOM;
-        return C_ERR;
-    }
-
-    /* Avoid overflow when trying to add an element to the stream (listpack
-     * can only host up to 32bit length sttrings, and also a total listpack size
-     * can't be bigger than 32bit length. */
-    size_t totelelen = 0;
-    for (int64_t i = 0; i < numfields*2; i++) {
-        sds ele = argv[i]->ptr;
-        totelelen += sdslen(ele);
-    }
-    if (totelelen > STREAM_LISTPACK_MAX_SIZE) {
-        errno = ERANGE;
-        return C_ERR;
-    }
-
-    /* Add the new entry. */
-    raxIterator ri;
-    raxStart(&ri,s->rax);
-    raxSeek(&ri,"$",NULL,0);
-
-    size_t lp_bytes = 0;        /* Total bytes in the tail listpack. */
-    unsigned char *lp = NULL;   /* Tail listpack pointer. */
-
-    /* Get a reference to the tail node listpack. */
-    if (raxNext(&ri)) {
-        lp = ri.data;
-        lp_bytes = lpBytes(lp);
-    }
-    raxStop(&ri);
-
-    /* We have to add the key into the radix tree in lexicographic order,
-     * to do so we consider the ID as a single 128 bit number written in
-     * big endian, so that the most significant bytes are the first ones. */
-    uint64_t rax_key[2];    /* Key in the radix tree containing the listpack.*/
-    streamID master_id;     /* ID of the master entry in the listpack. */
-
-    /* Create a new listpack and radix tree node if needed. Note that when
-     * a new listpack is created, we populate it with a "master entry". This
-     * is just a set of fields that is taken as references in order to compress
-     * the stream entries that we'll add inside the listpack.
-     *
-     * Note that while we use the first added entry fields to create
-     * the master entry, the first added entry is NOT represented in the master
-     * entry, which is a stand alone object. But of course, the first entry
-     * will compress well because it's used as reference.
-     *
-     * The master entry is composed like in the following example:
-     *
-     * +-------+---------+------------+---------+--/--+---------+---------+-+
-     * | count | deleted | num-fields | field_1 | field_2 | ... | field_N |0|
-     * +-------+---------+------------+---------+--/--+---------+---------+-+
-     *
-     * count and deleted just represent respectively the total number of
-     * entries inside the listpack that are valid, and marked as deleted
-     * (deleted flag in the entry flags set). So the total number of items
-     * actually inside the listpack (both deleted and not) is count+deleted.
-     *
-     * The real entries will be encoded with an ID that is just the
-     * millisecond and sequence difference compared to the key stored at
-     * the radix tree node containing the listpack (delta encoding), and
-     * if the fields of the entry are the same as the master entry fields, the
-     * entry flags will specify this fact and the entry fields and number
-     * of fields will be omitted (see later in the code of this function).
-     *
-     * The "0" entry at the end is the same as the 'lp-count' entry in the
-     * regular stream entries (see below), and marks the fact that there are
-     * no more entries, when we scan the stream from right to left. */
-
-    /* First of all, check if we can append to the current macro node or
-     * if we need to switch to the next one. 'lp' will be set to NULL if
-     * the current node is full. */
-    if (lp != NULL) {
-        size_t node_max_bytes = server.stream_node_max_bytes;
-        if (node_max_bytes == 0 || node_max_bytes > STREAM_LISTPACK_MAX_SIZE)
-            node_max_bytes = STREAM_LISTPACK_MAX_SIZE;
-        if (lp_bytes + totelelen >= node_max_bytes) {
-            lp = NULL;
-        } else if (server.stream_node_max_entries) {
-            unsigned char *lp_ele = lpFirst(lp);
-            /* Count both live entries and deleted ones. */
-            int64_t count = lpGetInteger(lp_ele) + lpGetInteger(lpNext(lp,lp_ele));
-            if (count >= server.stream_node_max_entries) {
-                /* Shrink extra pre-allocated memory */
-                lp = lpShrinkToFit(lp);
-                if (ri.data != lp)
-                    raxInsert(s->rax,ri.key,ri.key_len,lp,NULL);
-                lp = NULL;
-            }
-        }
-    }
-
-    int flags = STREAM_ITEM_FLAG_NONE;
-    if (lp == NULL) {
-        master_id = id;
-        streamEncodeID(rax_key,&id);
-        /* Create the listpack having the master entry ID and fields.
-         * Pre-allocate some bytes when creating listpack to avoid realloc on
-         * every XADD. Since listpack.c uses malloc_size, it'll grow in steps,
-         * and won't realloc on every XADD.
-         * When listpack reaches max number of entries, we'll shrink the
-         * allocation to fit the data. */
-        size_t prealloc = STREAM_LISTPACK_MAX_PRE_ALLOCATE;
-        if (server.stream_node_max_bytes > 0 && server.stream_node_max_bytes < prealloc) {
-            prealloc = server.stream_node_max_bytes;
-        }
-        lp = lpNew(prealloc);
-        lp = lpAppendInteger(lp,1); /* One item, the one we are adding. */
-        lp = lpAppendInteger(lp,0); /* Zero deleted so far. */
-        lp = lpAppendInteger(lp,numfields);
-        for (int64_t i = 0; i < numfields; i++) {
-            sds field = argv[i*2]->ptr;
-            lp = lpAppend(lp,(unsigned char*)field,sdslen(field));
-        }
-        lp = lpAppendInteger(lp,0); /* Master entry zero terminator. */
-        raxInsert(s->rax,(unsigned char*)&rax_key,sizeof(rax_key),lp,NULL);
-        /* The first entry we insert, has obviously the same fields of the
-         * master entry. */
-        flags |= STREAM_ITEM_FLAG_SAMEFIELDS;
-    } else {
-        serverAssert(ri.key_len == sizeof(rax_key));
-        memcpy(rax_key,ri.key,sizeof(rax_key));
-
-        /* Read the master ID from the radix tree key. */
-        streamDecodeID(rax_key,&master_id);
-        unsigned char *lp_ele = lpFirst(lp);
-
-        /* Update count and skip the deleted fields. */
-        int64_t count = lpGetInteger(lp_ele);
-        lp = lpReplaceInteger(lp,&lp_ele,count+1);
-        lp_ele = lpNext(lp,lp_ele); /* seek deleted. */
-        lp_ele = lpNext(lp,lp_ele); /* seek master entry num fields. */
-
-        /* Check if the entry we are adding, have the same fields
-         * as the master entry. */
-        int64_t master_fields_count = lpGetInteger(lp_ele);
-        lp_ele = lpNext(lp,lp_ele);
-        if (numfields == master_fields_count) {
-            int64_t i;
-            for (i = 0; i < master_fields_count; i++) {
-                sds field = argv[i*2]->ptr;
-                int64_t e_len;
-                unsigned char buf[LP_INTBUF_SIZE];
-                unsigned char *e = lpGet(lp_ele,&e_len,buf);
-                /* Stop if there is a mismatch. */
-                if (sdslen(field) != (size_t)e_len ||
-                    memcmp(e,field,e_len) != 0) break;
-                lp_ele = lpNext(lp,lp_ele);
-            }
-            /* All fields are the same! We can compress the field names
-             * setting a single bit in the flags. */
-            if (i == master_fields_count) flags |= STREAM_ITEM_FLAG_SAMEFIELDS;
-        }
-    }
-
-    /* Populate the listpack with the new entry. We use the following
-     * encoding:
-     *
-     * +-----+--------+----------+-------+-------+-/-+-------+-------+--------+
-     * |flags|entry-id|num-fields|field-1|value-1|...|field-N|value-N|lp-count|
-     * +-----+--------+----------+-------+-------+-/-+-------+-------+--------+
-     *
-     * However if the SAMEFIELD flag is set, we have just to populate
-     * the entry with the values, so it becomes:
-     *
-     * +-----+--------+-------+-/-+-------+--------+
-     * |flags|entry-id|value-1|...|value-N|lp-count|
-     * +-----+--------+-------+-/-+-------+--------+
-     *
-     * The entry-id field is actually two separated fields: the ms
-     * and seq difference compared to the master entry.
-     *
-     * The lp-count field is a number that states the number of listpack pieces
-     * that compose the entry, so that it's possible to travel the entry
-     * in reverse order: we can just start from the end of the listpack, read
-     * the entry, and jump back N times to seek the "flags" field to read
-     * the stream full entry. */
-    lp = lpAppendInteger(lp,flags);
-    lp = lpAppendInteger(lp,id.ms - master_id.ms);
-    lp = lpAppendInteger(lp,id.seq - master_id.seq);
-    if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS))
-        lp = lpAppendInteger(lp,numfields);
-    for (int64_t i = 0; i < numfields; i++) {
-        sds field = argv[i*2]->ptr, value = argv[i*2+1]->ptr;
-        if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS))
-            lp = lpAppend(lp,(unsigned char*)field,sdslen(field));
-        lp = lpAppend(lp,(unsigned char*)value,sdslen(value));
-    }
-    /* Compute and store the lp-count field. */
-    int64_t lp_count = numfields;
-    lp_count += 3; /* Add the 3 fixed fields flags + ms-diff + seq-diff. */
-    if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) {
-        /* If the item is not compressed, it also has the fields other than
-         * the values, and an additional num-fileds field. */
-        lp_count += numfields+1;
-    }
-    lp = lpAppendInteger(lp,lp_count);
-
-    /* Insert back into the tree in order to update the listpack pointer. */
-    if (ri.data != lp)
-        raxInsert(s->rax,(unsigned char*)&rax_key,sizeof(rax_key),lp,NULL);
-    s->length++;
-    s->last_id = id;
-    if (added_id) *added_id = id;
-    return C_OK;
-}
-
-typedef struct {
-    /* XADD options */
-    streamID id; /* User-provided ID, for XADD only. */
-    int id_given; /* Was an ID different than "*" specified? for XADD only. */
-    int no_mkstream; /* if set to 1 do not create new stream */
-
-    /* XADD + XTRIM common options */
-    int trim_strategy; /* TRIM_STRATEGY_* */
-    int trim_strategy_arg_idx; /* Index of the count in MAXLEN/MINID, for rewriting. */
-    int approx_trim; /* If 1 only delete whole radix tree nodes, so
-                      * the trim argument is not applied verbatim. */
-    long long limit; /* Maximum amount of entries to trim. If 0, no limitation
-                      * on the amount of trimming work is enforced. */
-    /* TRIM_STRATEGY_MAXLEN options */
-    long long maxlen; /* After trimming, leave stream at this length . */
-    /* TRIM_STRATEGY_MINID options */
-    streamID minid; /* Trim by ID (No stream entries with ID < 'minid' will remain) */
-} streamAddTrimArgs;
-
-#define TRIM_STRATEGY_NONE 0
-#define TRIM_STRATEGY_MAXLEN 1
-#define TRIM_STRATEGY_MINID 2
-
-/* Trim the stream 's' according to args->trim_strategy, and return the
- * number of elements removed from the stream. The 'approx' option, if non-zero,
- * specifies that the trimming must be performed in a approximated way in
- * order to maximize performances. This means that the stream may contain
- * entries with IDs < 'id' in case of MINID (or more elements than 'maxlen'
- * in case of MAXLEN), and elements are only removed if we can remove
- * a *whole* node of the radix tree. The elements are removed from the head
- * of the stream (older elements).
- *
- * The function may return zero if:
- *
- * 1) The minimal entry ID of the stream is already < 'id' (MINID); or
- * 2) The stream is already shorter or equal to the specified max length (MAXLEN); or
- * 3) The 'approx' option is true and the head node did not have enough elements
- *    to be deleted.
- *
- * args->limit is the maximum number of entries to delete. The purpose is to
- * prevent this function from taking to long.
- * If 'limit' is 0 then we do not limit the number of deleted entries.
- * Much like the 'approx', if 'limit' is smaller than the number of entries
- * that should be trimmed, there is a chance we will still have entries with
- * IDs < 'id' (or number of elements >= maxlen in case of MAXLEN).
- */
-int64_t streamTrim(stream *s, streamAddTrimArgs *args) {
-    size_t maxlen = args->maxlen;
-    streamID *id = &args->minid;
-    int approx = args->approx_trim;
-    int64_t limit = args->limit;
-    int trim_strategy = args->trim_strategy;
-
-    if (trim_strategy == TRIM_STRATEGY_NONE)
-        return 0;
-
-    raxIterator ri;
-    raxStart(&ri,s->rax);
-    raxSeek(&ri,"^",NULL,0);
-
-    int64_t deleted = 0;
-    while (raxNext(&ri)) {
-        if (trim_strategy == TRIM_STRATEGY_MAXLEN && s->length <= maxlen)
-            break;
-
-        unsigned char *lp = ri.data, *p = lpFirst(lp);
-        int64_t entries = lpGetInteger(p);
-
-        /* Check if we exceeded the amount of work we could do */
-        if (limit && (deleted + entries) > limit)
-            break;
-
-        /* Check if we can remove the whole node. */
-        int remove_node;
-        streamID master_id = {0}; /* For MINID */
-        if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
-            remove_node = s->length - entries >= maxlen;
-        } else {
-            /* Read the master ID from the radix tree key. */
-            streamDecodeID(ri.key, &master_id);
-
-            /* Read last ID. */
-            streamID last_id;
-            lpGetEdgeStreamID(lp, 0, &master_id, &last_id);
-
-            /* We can remove the entire node id its last ID < 'id' */
-            remove_node = streamCompareID(&last_id, id) < 0;
-        }
-
-        if (remove_node) {
-            lpFree(lp);
-            raxRemove(s->rax,ri.key,ri.key_len,NULL);
-            raxSeek(&ri,">=",ri.key,ri.key_len);
-            s->length -= entries;
-            deleted += entries;
-            continue;
-        }
-
-        /* If we cannot remove a whole element, and approx is true,
-         * stop here. */
-        if (approx) break;
-
-        /* Now we have to trim entries from within 'lp' */
-        int64_t deleted_from_lp = 0;
-
-        p = lpNext(lp, p); /* Skip deleted field. */
-        p = lpNext(lp, p); /* Skip num-of-fields in the master entry. */
-
-        /* Skip all the master fields. */
-        int64_t master_fields_count = lpGetInteger(p);
-        p = lpNext(lp,p); /* Skip the first field. */
-        for (int64_t j = 0; j < master_fields_count; j++)
-            p = lpNext(lp,p); /* Skip all master fields. */
-        p = lpNext(lp,p); /* Skip the zero master entry terminator. */
-
-        /* 'p' is now pointing to the first entry inside the listpack.
-         * We have to run entry after entry, marking entries as deleted
-         * if they are already not deleted. */
-        while (p) {
-            /* We keep a copy of p (which point to flags part) in order to
-             * update it after (and if) we actually remove the entry */
-            unsigned char *pcopy = p;
-
-            int flags = lpGetInteger(p);
-            p = lpNext(lp, p); /* Skip flags. */
-            int to_skip;
-
-            int ms_delta = lpGetInteger(p);
-            p = lpNext(lp, p); /* Skip ID ms delta */
-            int seq_delta = lpGetInteger(p);
-            p = lpNext(lp, p); /* Skip ID seq delta */
-
-            streamID currid = {0}; /* For MINID */
-            if (trim_strategy == TRIM_STRATEGY_MINID) {
-                currid.ms = master_id.ms + ms_delta;
-                currid.seq = master_id.seq + seq_delta;
-            }
-
-            int stop;
-            if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
-                stop = s->length <= maxlen;
-            } else {
-                /* Following IDs will definitely be greater because the rax
-                 * tree is sorted, no point of continuing. */
-                stop = streamCompareID(&currid, id) >= 0;
-            }
-            if (stop)
-                break;
-
-            if (flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
-                to_skip = master_fields_count;
-            } else {
-                to_skip = lpGetInteger(p); /* Get num-fields. */
-                p = lpNext(lp,p); /* Skip num-fields. */
-                to_skip *= 2; /* Fields and values. */
-            }
-
-            while(to_skip--) p = lpNext(lp,p); /* Skip the whole entry. */
-            p = lpNext(lp,p); /* Skip the final lp-count field. */
-
-            /* Mark the entry as deleted. */
-            if (!(flags & STREAM_ITEM_FLAG_DELETED)) {
-                intptr_t delta = p - lp;
-                flags |= STREAM_ITEM_FLAG_DELETED;
-                lp = lpReplaceInteger(lp, &pcopy, flags);
-                deleted_from_lp++;
-                s->length--;
-                p = lp + delta;
-            }
-        }
-        deleted += deleted_from_lp;
-
-        /* Now we the entries/deleted counters. */
-        p = lpFirst(lp);
-        lp = lpReplaceInteger(lp,&p,entries-deleted_from_lp);
-        p = lpNext(lp,p); /* Skip deleted field. */
-        int64_t marked_deleted = lpGetInteger(p);
-        lp = lpReplaceInteger(lp,&p,marked_deleted+deleted_from_lp);
-        p = lpNext(lp,p); /* Skip num-of-fields in the master entry. */
-
-        /* Here we should perform garbage collection in case at this point
-         * there are too many entries deleted inside the listpack. */
-        entries -= deleted_from_lp;
-        marked_deleted += deleted_from_lp;
-        if (entries + marked_deleted > 10 && marked_deleted > entries/2) {
-            /* TODO: perform a garbage collection. */
-        }
-
-        /* Update the listpack with the new pointer. */
-        raxInsert(s->rax,ri.key,ri.key_len,lp,NULL);
-
-        break; /* If we are here, there was enough to delete in the current
-                  node, so no need to go to the next node. */
-    }
-
-    raxStop(&ri);
-    return deleted;
-}
-
-/* Trims a stream by length. Returns the number of deleted items. */
-int64_t streamTrimByLength(stream *s, long long maxlen, int approx) {
-    streamAddTrimArgs args = {
-        .trim_strategy = TRIM_STRATEGY_MAXLEN,
-        .approx_trim = approx,
-        .limit = approx ? 100 * server.stream_node_max_entries : 0,
-        .maxlen = maxlen
-    };
-    return streamTrim(s, &args);
-}
-
-/* Trims a stream by minimum ID. Returns the number of deleted items. */
-int64_t streamTrimByID(stream *s, streamID minid, int approx) {
-    streamAddTrimArgs args = {
-        .trim_strategy = TRIM_STRATEGY_MINID,
-        .approx_trim = approx,
-        .limit = approx ? 100 * server.stream_node_max_entries : 0,
-        .minid = minid
-    };
-    return streamTrim(s, &args);
-}
-
-/* Parse the arguments of XADD/XTRIM.
- *
- * See streamAddTrimArgs for more details about the arguments handled.
- *
- * This function returns the position of the ID argument (relevant only to XADD).
- * On error -1 is returned and a reply is sent. */
-static int streamParseAddOrTrimArgsOrReply(client *c, streamAddTrimArgs *args, int xadd) {
-    /* Initialize arguments to defaults */
-    memset(args, 0, sizeof(*args));
-
-    /* Parse options. */
-    int i = 2; /* This is the first argument position where we could
-                  find an option, or the ID. */
-    int limit_given = 0;
-    for (; i < c->argc; i++) {
-        int moreargs = (c->argc-1) - i; /* Number of additional arguments. */
-        char *opt = c->argv[i]->ptr;
-        if (xadd && opt[0] == '*' && opt[1] == '\0') {
-            /* This is just a fast path for the common case of auto-ID
-             * creation. */
-            break;
-        } else if (!strcasecmp(opt,"maxlen") && moreargs) {
-            if (args->trim_strategy != TRIM_STRATEGY_NONE) {
-                addReplyError(c,"syntax error, MAXLEN and MINID options at the same time are not compatible");
-                return -1;
-            }
-            args->approx_trim = 0;
-            char *next = c->argv[i+1]->ptr;
-            /* Check for the form MAXLEN ~ <count>. */
-            if (moreargs >= 2 && next[0] == '~' && next[1] == '\0') {
-                args->approx_trim = 1;
-                i++;
-            } else if (moreargs >= 2 && next[0] == '=' && next[1] == '\0') {
-                i++;
-            }
-            if (getLongLongFromObjectOrReply(c,c->argv[i+1],&args->maxlen,NULL)
-                != C_OK) return -1;
-
-            if (args->maxlen < 0) {
-                addReplyError(c,"The MAXLEN argument must be >= 0.");
-                return -1;
-            }
-            i++;
-            args->trim_strategy = TRIM_STRATEGY_MAXLEN;
-            args->trim_strategy_arg_idx = i;
-        } else if (!strcasecmp(opt,"minid") && moreargs) {
-            if (args->trim_strategy != TRIM_STRATEGY_NONE) {
-                addReplyError(c,"syntax error, MAXLEN and MINID options at the same time are not compatible");
-                return -1;
-            }
-            args->approx_trim = 0;
-            char *next = c->argv[i+1]->ptr;
-            /* Check for the form MINID ~ <id>|<age>. */
-            if (moreargs >= 2 && next[0] == '~' && next[1] == '\0') {
-                args->approx_trim = 1;
-                i++;
-            } else if (moreargs >= 2 && next[0] == '=' && next[1] == '\0') {
-                i++;
-            }
-
-            if (streamParseStrictIDOrReply(c,c->argv[i+1],&args->minid,0) != C_OK)
-                return -1;
-            
-            i++;
-            args->trim_strategy = TRIM_STRATEGY_MINID;
-            args->trim_strategy_arg_idx = i;
-        } else if (!strcasecmp(opt,"limit") && moreargs) {
-            /* Note about LIMIT: If it was not provided by the caller we set
-             * it to 100*server.stream_node_max_entries, and that's to prevent the
-             * trimming from taking too long, on the expense of not deleting entries
-             * that should be trimmed.
-             * If user wanted exact trimming (i.e. no '~') we never limit the number
-             * of trimmed entries */
-            if (getLongLongFromObjectOrReply(c,c->argv[i+1],&args->limit,NULL) != C_OK)
-                return -1;
-
-            if (args->limit < 0) {
-                addReplyError(c,"The LIMIT argument must be >= 0.");
-                return -1;
-            }
-            limit_given = 1;
-            i++;
-        } else if (xadd && !strcasecmp(opt,"nomkstream")) {
-            args->no_mkstream = 1;
-        } else if (xadd) {
-            /* If we are here is a syntax error or a valid ID. */
-            if (streamParseStrictIDOrReply(c,c->argv[i],&args->id,0) != C_OK)
-                return -1;
-            args->id_given = 1;
-            break;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return -1;
-        }
-    }
-
-    if (args->limit && args->trim_strategy == TRIM_STRATEGY_NONE) {
-        addReplyError(c,"syntax error, LIMIT cannot be used without specifying a trimming strategy");
-        return -1;
-    }
-
-    if (!xadd && args->trim_strategy == TRIM_STRATEGY_NONE) {
-        addReplyError(c,"syntax error, XTRIM must be called with a trimming strategy");
-        return -1;
-    }
-
-    if (c == server.master || c->id == CLIENT_ID_AOF) {
-        /* If command cam from master or from AOF we must not enforce maxnodes
-         * (The maxlen/minid argument was re-written to make sure there's no
-         * inconsistency). */
-        args->limit = 0;
-    } else {
-        /* We need to set the limit (only if we got '~') */
-        if (limit_given) {
-            if (!args->approx_trim) {
-                /* LIMIT was provided without ~ */
-                addReplyError(c,"syntax error, LIMIT cannot be used without the special ~ option");
-                return -1;
-            }
-        } else {
-            /* User didn't provide LIMIT, we must set it. */
-
-            if (args->approx_trim) {
-                /* In order to prevent from trimming to do too much work and cause
-                 * latency spikes we limit the amount of work it can do */
-                args->limit = 100 * server.stream_node_max_entries; /* Maximum 100 rax nodes. */
-            } else {
-                /* No LIMIT for exact trimming */
-                args->limit = 0;
-            }
-        }
-    }
-
-    return i;
-}
-
-/* Initialize the stream iterator, so that we can call iterating functions
- * to get the next items. This requires a corresponding streamIteratorStop()
- * at the end. The 'rev' parameter controls the direction. If it's zero the
- * iteration is from the start to the end element (inclusive), otherwise
- * if rev is non-zero, the iteration is reversed.
- *
- * Once the iterator is initialized, we iterate like this:
- *
- *  streamIterator myiterator;
- *  streamIteratorStart(&myiterator,...);
- *  int64_t numfields;
- *  while(streamIteratorGetID(&myiterator,&ID,&numfields)) {
- *      while(numfields--) {
- *          unsigned char *key, *value;
- *          size_t key_len, value_len;
- *          streamIteratorGetField(&myiterator,&key,&value,&key_len,&value_len);
- *
- *          ... do what you want with key and value ...
- *      }
- *  }
- *  streamIteratorStop(&myiterator); */
-void streamIteratorStart(streamIterator *si, stream *s, streamID *start, streamID *end, int rev) {
-    /* Initialize the iterator and translates the iteration start/stop
-     * elements into a 128 big big-endian number. */
-    if (start) {
-        streamEncodeID(si->start_key,start);
-    } else {
-        si->start_key[0] = 0;
-        si->start_key[1] = 0;
-    }
-
-    if (end) {
-        streamEncodeID(si->end_key,end);
-    } else {
-        si->end_key[0] = UINT64_MAX;
-        si->end_key[1] = UINT64_MAX;
-    }
-
-    /* Seek the correct node in the radix tree. */
-    raxStart(&si->ri,s->rax);
-    if (!rev) {
-        if (start && (start->ms || start->seq)) {
-            raxSeek(&si->ri,"<=",(unsigned char*)si->start_key,
-                    sizeof(si->start_key));
-            if (raxEOF(&si->ri)) raxSeek(&si->ri,"^",NULL,0);
-        } else {
-            raxSeek(&si->ri,"^",NULL,0);
-        }
-    } else {
-        if (end && (end->ms || end->seq)) {
-            raxSeek(&si->ri,"<=",(unsigned char*)si->end_key,
-                    sizeof(si->end_key));
-            if (raxEOF(&si->ri)) raxSeek(&si->ri,"$",NULL,0);
-        } else {
-            raxSeek(&si->ri,"$",NULL,0);
-        }
-    }
-    si->stream = s;
-    si->lp = NULL; /* There is no current listpack right now. */
-    si->lp_ele = NULL; /* Current listpack cursor. */
-    si->rev = rev;  /* Direction, if non-zero reversed, from end to start. */
-}
-
-/* Return 1 and store the current item ID at 'id' if there are still
- * elements within the iteration range, otherwise return 0 in order to
- * signal the iteration terminated. */
-int streamIteratorGetID(streamIterator *si, streamID *id, int64_t *numfields) {
-    while(1) { /* Will stop when element > stop_key or end of radix tree. */
-        /* If the current listpack is set to NULL, this is the start of the
-         * iteration or the previous listpack was completely iterated.
-         * Go to the next node. */
-        if (si->lp == NULL || si->lp_ele == NULL) {
-            if (!si->rev && !raxNext(&si->ri)) return 0;
-            else if (si->rev && !raxPrev(&si->ri)) return 0;
-            serverAssert(si->ri.key_len == sizeof(streamID));
-            /* Get the master ID. */
-            streamDecodeID(si->ri.key,&si->master_id);
-            /* Get the master fields count. */
-            si->lp = si->ri.data;
-            si->lp_ele = lpFirst(si->lp);           /* Seek items count */
-            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek deleted count. */
-            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek num fields. */
-            si->master_fields_count = lpGetInteger(si->lp_ele);
-            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek first field. */
-            si->master_fields_start = si->lp_ele;
-            /* We are now pointing to the first field of the master entry.
-             * We need to seek either the first or the last entry depending
-             * on the direction of the iteration. */
-            if (!si->rev) {
-                /* If we are iterating in normal order, skip the master fields
-                 * to seek the first actual entry. */
-                for (uint64_t i = 0; i < si->master_fields_count; i++)
-                    si->lp_ele = lpNext(si->lp,si->lp_ele);
-            } else {
-                /* If we are iterating in reverse direction, just seek the
-                 * last part of the last entry in the listpack (that is, the
-                 * fields count). */
-                si->lp_ele = lpLast(si->lp);
-            }
-        } else if (si->rev) {
-            /* If we are iterating in the reverse order, and this is not
-             * the first entry emitted for this listpack, then we already
-             * emitted the current entry, and have to go back to the previous
-             * one. */
-            int lp_count = lpGetInteger(si->lp_ele);
-            while(lp_count--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
-            /* Seek lp-count of prev entry. */
-            si->lp_ele = lpPrev(si->lp,si->lp_ele);
-        }
-
-        /* For every radix tree node, iterate the corresponding listpack,
-         * returning elements when they are within range. */
-        while(1) {
-            if (!si->rev) {
-                /* If we are going forward, skip the previous entry
-                 * lp-count field (or in case of the master entry, the zero
-                 * term field) */
-                si->lp_ele = lpNext(si->lp,si->lp_ele);
-                if (si->lp_ele == NULL) break;
-            } else {
-                /* If we are going backward, read the number of elements this
-                 * entry is composed of, and jump backward N times to seek
-                 * its start. */
-                int64_t lp_count = lpGetInteger(si->lp_ele);
-                if (lp_count == 0) { /* We reached the master entry. */
-                    si->lp = NULL;
-                    si->lp_ele = NULL;
-                    break;
-                }
-                while(lp_count--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
-            }
-
-            /* Get the flags entry. */
-            si->lp_flags = si->lp_ele;
-            int flags = lpGetInteger(si->lp_ele);
-            si->lp_ele = lpNext(si->lp,si->lp_ele); /* Seek ID. */
-
-            /* Get the ID: it is encoded as difference between the master
-             * ID and this entry ID. */
-            *id = si->master_id;
-            id->ms += lpGetInteger(si->lp_ele);
-            si->lp_ele = lpNext(si->lp,si->lp_ele);
-            id->seq += lpGetInteger(si->lp_ele);
-            si->lp_ele = lpNext(si->lp,si->lp_ele);
-            unsigned char buf[sizeof(streamID)];
-            streamEncodeID(buf,id);
-
-            /* The number of entries is here or not depending on the
-             * flags. */
-            if (flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
-                *numfields = si->master_fields_count;
-            } else {
-                *numfields = lpGetInteger(si->lp_ele);
-                si->lp_ele = lpNext(si->lp,si->lp_ele);
-            }
-            serverAssert(*numfields>=0);
-
-            /* If current >= start, and the entry is not marked as
-             * deleted, emit it. */
-            if (!si->rev) {
-                if (memcmp(buf,si->start_key,sizeof(streamID)) >= 0 &&
-                    !(flags & STREAM_ITEM_FLAG_DELETED))
-                {
-                    if (memcmp(buf,si->end_key,sizeof(streamID)) > 0)
-                        return 0; /* We are already out of range. */
-                    si->entry_flags = flags;
-                    if (flags & STREAM_ITEM_FLAG_SAMEFIELDS)
-                        si->master_fields_ptr = si->master_fields_start;
-                    return 1; /* Valid item returned. */
-                }
-            } else {
-                if (memcmp(buf,si->end_key,sizeof(streamID)) <= 0 &&
-                    !(flags & STREAM_ITEM_FLAG_DELETED))
-                {
-                    if (memcmp(buf,si->start_key,sizeof(streamID)) < 0)
-                        return 0; /* We are already out of range. */
-                    si->entry_flags = flags;
-                    if (flags & STREAM_ITEM_FLAG_SAMEFIELDS)
-                        si->master_fields_ptr = si->master_fields_start;
-                    return 1; /* Valid item returned. */
-                }
-            }
-
-            /* If we do not emit, we have to discard if we are going
-             * forward, or seek the previous entry if we are going
-             * backward. */
-            if (!si->rev) {
-                int64_t to_discard = (flags & STREAM_ITEM_FLAG_SAMEFIELDS) ?
-                                      *numfields : *numfields*2;
-                for (int64_t i = 0; i < to_discard; i++)
-                    si->lp_ele = lpNext(si->lp,si->lp_ele);
-            } else {
-                int64_t prev_times = 4; /* flag + id ms + id seq + one more to
-                                           go back to the previous entry "count"
-                                           field. */
-                /* If the entry was not flagged SAMEFIELD we also read the
-                 * number of fields, so go back one more. */
-                if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) prev_times++;
-                while(prev_times--) si->lp_ele = lpPrev(si->lp,si->lp_ele);
-            }
-        }
-
-        /* End of listpack reached. Try the next/prev radix tree node. */
-    }
-}
-
-/* Get the field and value of the current item we are iterating. This should
- * be called immediately after streamIteratorGetID(), and for each field
- * according to the number of fields returned by streamIteratorGetID().
- * The function populates the field and value pointers and the corresponding
- * lengths by reference, that are valid until the next iterator call, assuming
- * no one touches the stream meanwhile. */
-void streamIteratorGetField(streamIterator *si, unsigned char **fieldptr, unsigned char **valueptr, int64_t *fieldlen, int64_t *valuelen) {
-    if (si->entry_flags & STREAM_ITEM_FLAG_SAMEFIELDS) {
-        *fieldptr = lpGet(si->master_fields_ptr,fieldlen,si->field_buf);
-        si->master_fields_ptr = lpNext(si->lp,si->master_fields_ptr);
-    } else {
-        *fieldptr = lpGet(si->lp_ele,fieldlen,si->field_buf);
-        si->lp_ele = lpNext(si->lp,si->lp_ele);
-    }
-    *valueptr = lpGet(si->lp_ele,valuelen,si->value_buf);
-    si->lp_ele = lpNext(si->lp,si->lp_ele);
-}
-
-/* Remove the current entry from the stream: can be called after the
- * GetID() API or after any GetField() call, however we need to iterate
- * a valid entry while calling this function. Moreover the function
- * requires the entry ID we are currently iterating, that was previously
- * returned by GetID().
- *
- * Note that after calling this function, next calls to GetField() can't
- * be performed: the entry is now deleted. Instead the iterator will
- * automatically re-seek to the next entry, so the caller should continue
- * with GetID(). */
-void streamIteratorRemoveEntry(streamIterator *si, streamID *current) {
-    unsigned char *lp = si->lp;
-    int64_t aux;
-
-    /* We do not really delete the entry here. Instead we mark it as
-     * deleted flagging it, and also incrementing the count of the
-     * deleted entries in the listpack header.
-     *
-     * We start flagging: */
-    int flags = lpGetInteger(si->lp_flags);
-    flags |= STREAM_ITEM_FLAG_DELETED;
-    lp = lpReplaceInteger(lp,&si->lp_flags,flags);
-
-    /* Change the valid/deleted entries count in the master entry. */
-    unsigned char *p = lpFirst(lp);
-    aux = lpGetInteger(p);
-
-    if (aux == 1) {
-        /* If this is the last element in the listpack, we can remove the whole
-         * node. */
-        lpFree(lp);
-        raxRemove(si->stream->rax,si->ri.key,si->ri.key_len,NULL);
-    } else {
-        /* In the base case we alter the counters of valid/deleted entries. */
-        lp = lpReplaceInteger(lp,&p,aux-1);
-        p = lpNext(lp,p); /* Seek deleted field. */
-        aux = lpGetInteger(p);
-        lp = lpReplaceInteger(lp,&p,aux+1);
-
-        /* Update the listpack with the new pointer. */
-        if (si->lp != lp)
-            raxInsert(si->stream->rax,si->ri.key,si->ri.key_len,lp,NULL);
-    }
-
-    /* Update the number of entries counter. */
-    si->stream->length--;
-
-    /* Re-seek the iterator to fix the now messed up state. */
-    streamID start, end;
-    if (si->rev) {
-        streamDecodeID(si->start_key,&start);
-        end = *current;
-    } else {
-        start = *current;
-        streamDecodeID(si->end_key,&end);
-    }
-    streamIteratorStop(si);
-    streamIteratorStart(si,si->stream,&start,&end,si->rev);
-
-    /* TODO: perform a garbage collection here if the ration between
-     * deleted and valid goes over a certain limit. */
-}
-
-/* Stop the stream iterator. The only cleanup we need is to free the rax
- * iterator, since the stream iterator itself is supposed to be stack
- * allocated. */
-void streamIteratorStop(streamIterator *si) {
-    raxStop(&si->ri);
-}
-
-/* Delete the specified item ID from the stream, returning 1 if the item
- * was deleted 0 otherwise (if it does not exist). */
-int streamDeleteItem(stream *s, streamID *id) {
-    int deleted = 0;
-    streamIterator si;
-    streamIteratorStart(&si,s,id,id,0);
-    streamID myid;
-    int64_t numfields;
-    if (streamIteratorGetID(&si,&myid,&numfields)) {
-        streamIteratorRemoveEntry(&si,&myid);
-        deleted = 1;
-    }
-    streamIteratorStop(&si);
-    return deleted;
-}
-
-/* Get the last valid (non-tombstone) streamID of 's'. */
-void streamLastValidID(stream *s, streamID *maxid)
-{
-    streamIterator si;
-    streamIteratorStart(&si,s,NULL,NULL,1);
-    int64_t numfields;
-    if (!streamIteratorGetID(&si,maxid,&numfields) && s->length)
-        serverPanic("Corrupt stream, length is %llu, but no max id", (unsigned long long)s->length);
-    streamIteratorStop(&si);
-}
-
-/* Emit a reply in the client output buffer by formatting a Stream ID
- * in the standard <ms>-<seq> format, using the simple string protocol
- * of REPL. */
-void addReplyStreamID(client *c, streamID *id) {
-    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
-    addReplyBulkSds(c,replyid);
-}
-
-void setDeferredReplyStreamID(client *c, void *dr, streamID *id) {
-    sds replyid = sdscatfmt(sdsempty(),"%U-%U",id->ms,id->seq);
-    setDeferredReplyBulkSds(c, dr, replyid);
-}
-
-/* Similar to the above function, but just creates an object, usually useful
- * for replication purposes to create arguments. */
-robj *createObjectFromStreamID(streamID *id) {
-    return createObject(OBJ_STRING, sdscatfmt(sdsempty(),"%U-%U",
-                        id->ms,id->seq));
-}
-
-/* As a result of an explicit XCLAIM or XREADGROUP command, new entries
- * are created in the pending list of the stream and consumers. We need
- * to propagate this changes in the form of XCLAIM commands. */
-void streamPropagateXCLAIM(client *c, robj *key, streamCG *group, robj *groupname, robj *id, streamNACK *nack) {
-    /* We need to generate an XCLAIM that will work in a idempotent fashion:
-     *
-     * XCLAIM <key> <group> <consumer> 0 <id> TIME <milliseconds-unix-time>
-     *        RETRYCOUNT <count> FORCE JUSTID LASTID <id>.
-     *
-     * Note that JUSTID is useful in order to avoid that XCLAIM will do
-     * useless work in the slave side, trying to fetch the stream item. */
-    robj *argv[14];
-    argv[0] = shared.xclaim;
-    argv[1] = key;
-    argv[2] = groupname;
-    argv[3] = createStringObject(nack->consumer->name,sdslen(nack->consumer->name));
-    argv[4] = shared.integers[0];
-    argv[5] = id;
-    argv[6] = shared.time;
-    argv[7] = createStringObjectFromLongLong(nack->delivery_time);
-    argv[8] = shared.retrycount;
-    argv[9] = createStringObjectFromLongLong(nack->delivery_count);
-    argv[10] = shared.force;
-    argv[11] = shared.justid;
-    argv[12] = shared.lastid;
-    argv[13] = createObjectFromStreamID(&group->last_id);
-
-    /* We use progagate() because this code path is not always called from
-     * the command execution context. Moreover this will just alter the
-     * consumer group state, and we don't need MULTI/EXEC wrapping because
-     * there is no message state cross-message atomicity required. */
-    propagate(server.xclaimCommand,c->db->id,argv,14,PROPAGATE_AOF|PROPAGATE_REPL);
-    decrRefCount(argv[3]);
-    decrRefCount(argv[7]);
-    decrRefCount(argv[9]);
-    decrRefCount(argv[13]);
-}
-
-/* We need this when we want to propoagate the new last-id of a consumer group
- * that was consumed by XREADGROUP with the NOACK option: in that case we can't
- * propagate the last ID just using the XCLAIM LASTID option, so we emit
- *
- *  XGROUP SETID <key> <groupname> <id>
- */
-void streamPropagateGroupID(client *c, robj *key, streamCG *group, robj *groupname) {
-    robj *argv[5];
-    argv[0] = shared.xgroup;
-    argv[1] = shared.setid;
-    argv[2] = key;
-    argv[3] = groupname;
-    argv[4] = createObjectFromStreamID(&group->last_id);
-
-    /* We use progagate() because this code path is not always called from
-     * the command execution context. Moreover this will just alter the
-     * consumer group state, and we don't need MULTI/EXEC wrapping because
-     * there is no message state cross-message atomicity required. */
-    propagate(server.xgroupCommand,c->db->id,argv,5,PROPAGATE_AOF|PROPAGATE_REPL);
-    decrRefCount(argv[4]);
-}
-
-/* We need this when we want to propagate creation of consumer that was created
- * by XREADGROUP with the NOACK option. In that case, the only way to create
- * the consumer at the replica is by using XGROUP CREATECONSUMER (see issue #7140)
- *
- *  XGROUP CREATECONSUMER <key> <groupname> <consumername>
- */
-void streamPropagateConsumerCreation(client *c, robj *key, robj *groupname, sds consumername) {
-    robj *argv[5];
-    argv[0] = shared.xgroup;
-    argv[1] = shared.createconsumer;
-    argv[2] = key;
-    argv[3] = groupname;
-    argv[4] = createObject(OBJ_STRING,sdsdup(consumername));
-
-    /* We use progagate() because this code path is not always called from
-     * the command execution context. Moreover this will just alter the
-     * consumer group state, and we don't need MULTI/EXEC wrapping because
-     * there is no message state cross-message atomicity required. */
-    propagate(server.xgroupCommand,c->db->id,argv,5,PROPAGATE_AOF|PROPAGATE_REPL);
-    decrRefCount(argv[4]);
-}
-
-/* Send the stream items in the specified range to the client 'c'. The range
- * the client will receive is between start and end inclusive, if 'count' is
- * non zero, no more than 'count' elements are sent.
- *
- * The 'end' pointer can be NULL to mean that we want all the elements from
- * 'start' till the end of the stream. If 'rev' is non zero, elements are
- * produced in reversed order from end to start.
- *
- * The function returns the number of entries emitted.
- *
- * If group and consumer are not NULL, the function performs additional work:
- * 1. It updates the last delivered ID in the group in case we are
- *    sending IDs greater than the current last ID.
- * 2. If the requested IDs are already assigned to some other consumer, the
- *    function will not return it to the client.
- * 3. An entry in the pending list will be created for every entry delivered
- *    for the first time to this consumer.
- *
- * The behavior may be modified passing non-zero flags:
- *
- * STREAM_RWR_NOACK: Do not create PEL entries, that is, the point "3" above
- *                   is not performed.
- * STREAM_RWR_RAWENTRIES: Do not emit array boundaries, but just the entries,
- *                        and return the number of entries emitted as usually.
- *                        This is used when the function is just used in order
- *                        to emit data and there is some higher level logic.
- *
- * The final argument 'spi' (stream propagation info pointer) is a structure
- * filled with information needed to propagate the command execution to AOF
- * and slaves, in the case a consumer group was passed: we need to generate
- * XCLAIM commands to create the pending list into AOF/slaves in that case.
- *
- * If 'spi' is set to NULL no propagation will happen even if the group was
- * given, but currently such a feature is never used by the code base that
- * will always pass 'spi' and propagate when a group is passed.
- *
- * Note that this function is recursive in certain cases. When it's called
- * with a non NULL group and consumer argument, it may call
- * streamReplyWithRangeFromConsumerPEL() in order to get entries from the
- * consumer pending entries list. However such a function will then call
- * streamReplyWithRange() in order to emit single entries (found in the
- * PEL by ID) to the client. This is the use case for the STREAM_RWR_RAWENTRIES
- * flag.
- */
-#define STREAM_RWR_NOACK (1<<0)         /* Do not create entries in the PEL. */
-#define STREAM_RWR_RAWENTRIES (1<<1)    /* Do not emit protocol for array
-                                           boundaries, just the entries. */
-#define STREAM_RWR_HISTORY (1<<2)       /* Only serve consumer local PEL. */
-size_t streamReplyWithRange(client *c, stream *s, streamID *start, streamID *end, size_t count, int rev, streamCG *group, streamConsumer *consumer, int flags, streamPropInfo *spi) {
-    void *arraylen_ptr = NULL;
-    size_t arraylen = 0;
-    streamIterator si;
-    int64_t numfields;
-    streamID id;
-    int propagate_last_id = 0;
-    int noack = flags & STREAM_RWR_NOACK;
-
-    /* If the client is asking for some history, we serve it using a
-     * different function, so that we return entries *solely* from its
-     * own PEL. This ensures each consumer will always and only see
-     * the history of messages delivered to it and not yet confirmed
-     * as delivered. */
-    if (group && (flags & STREAM_RWR_HISTORY)) {
-        return streamReplyWithRangeFromConsumerPEL(c,s,start,end,count,
-                                                   consumer);
-    }
-
-    if (!(flags & STREAM_RWR_RAWENTRIES))
-        arraylen_ptr = addReplyDeferredLen(c);
-    streamIteratorStart(&si,s,start,end,rev);
-    while(streamIteratorGetID(&si,&id,&numfields)) {
-        /* Update the group last_id if needed. */
-        if (group && streamCompareID(&id,&group->last_id) > 0) {
-            group->last_id = id;
-            /* Group last ID should be propagated only if NOACK was
-             * specified, otherwise the last id will be included
-             * in the propagation of XCLAIM itself. */
-            if (noack) propagate_last_id = 1;
-        }
-
-        /* Emit a two elements array for each item. The first is
-         * the ID, the second is an array of field-value pairs. */
-        addReplyArrayLen(c,2);
-        addReplyStreamID(c,&id);
-
-        addReplyArrayLen(c,numfields*2);
-
-        /* Emit the field-value pairs. */
-        while(numfields--) {
-            unsigned char *key, *value;
-            int64_t key_len, value_len;
-            streamIteratorGetField(&si,&key,&value,&key_len,&value_len);
-            addReplyBulkCBuffer(c,key,key_len);
-            addReplyBulkCBuffer(c,value,value_len);
-        }
-
-        /* If a group is passed, we need to create an entry in the
-         * PEL (pending entries list) of this group *and* this consumer.
-         *
-         * Note that we cannot be sure about the fact the message is not
-         * already owned by another consumer, because the admin is able
-         * to change the consumer group last delivered ID using the
-         * XGROUP SETID command. So if we find that there is already
-         * a NACK for the entry, we need to associate it to the new
-         * consumer. */
-        if (group && !noack) {
-            unsigned char buf[sizeof(streamID)];
-            streamEncodeID(buf,&id);
-
-            /* Try to add a new NACK. Most of the time this will work and
-             * will not require extra lookups. We'll fix the problem later
-             * if we find that there is already a entry for this ID. */
-            streamNACK *nack = streamCreateNACK(consumer);
-            int group_inserted =
-                raxTryInsert(group->pel,buf,sizeof(buf),nack,NULL);
-            int consumer_inserted =
-                raxTryInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
-
-            /* Now we can check if the entry was already busy, and
-             * in that case reassign the entry to the new consumer,
-             * or update it if the consumer is the same as before. */
-            if (group_inserted == 0) {
-                streamFreeNACK(nack);
-                nack = raxFind(group->pel,buf,sizeof(buf));
-                serverAssert(nack != raxNotFound);
-                raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
-                /* Update the consumer and NACK metadata. */
-                nack->consumer = consumer;
-                nack->delivery_time = mstime();
-                nack->delivery_count = 1;
-                /* Add the entry in the new consumer local PEL. */
-                raxInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
-            } else if (group_inserted == 1 && consumer_inserted == 0) {
-                serverPanic("NACK half-created. Should not be possible.");
-            }
-
-            /* Propagate as XCLAIM. */
-            if (spi) {
-                robj *idarg = createObjectFromStreamID(&id);
-                streamPropagateXCLAIM(c,spi->keyname,group,spi->groupname,idarg,nack);
-                decrRefCount(idarg);
-            }
-        }
-
-        arraylen++;
-        if (count && count == arraylen) break;
-    }
-
-    if (spi && propagate_last_id)
-        streamPropagateGroupID(c,spi->keyname,group,spi->groupname);
-
-    streamIteratorStop(&si);
-    if (arraylen_ptr) setDeferredArrayLen(c,arraylen_ptr,arraylen);
-    return arraylen;
-}
-
-/* This is an helper function for streamReplyWithRange() when called with
- * group and consumer arguments, but with a range that is referring to already
- * delivered messages. In this case we just emit messages that are already
- * in the history of the consumer, fetching the IDs from its PEL.
- *
- * Note that this function does not have a 'rev' argument because it's not
- * possible to iterate in reverse using a group. Basically this function
- * is only called as a result of the XREADGROUP command.
- *
- * This function is more expensive because it needs to inspect the PEL and then
- * seek into the radix tree of the messages in order to emit the full message
- * to the client. However clients only reach this code path when they are
- * fetching the history of already retrieved messages, which is rare. */
-size_t streamReplyWithRangeFromConsumerPEL(client *c, stream *s, streamID *start, streamID *end, size_t count, streamConsumer *consumer) {
-    raxIterator ri;
-    unsigned char startkey[sizeof(streamID)];
-    unsigned char endkey[sizeof(streamID)];
-    streamEncodeID(startkey,start);
-    if (end) streamEncodeID(endkey,end);
-
-    size_t arraylen = 0;
-    void *arraylen_ptr = addReplyDeferredLen(c);
-    raxStart(&ri,consumer->pel);
-    raxSeek(&ri,">=",startkey,sizeof(startkey));
-    while(raxNext(&ri) && (!count || arraylen < count)) {
-        if (end && memcmp(ri.key,end,ri.key_len) > 0) break;
-        streamID thisid;
-        streamDecodeID(ri.key,&thisid);
-        if (streamReplyWithRange(c,s,&thisid,&thisid,1,0,NULL,NULL,
-                                 STREAM_RWR_RAWENTRIES,NULL) == 0)
-        {
-            /* Note that we may have a not acknowledged entry in the PEL
-             * about a message that's no longer here because was removed
-             * by the user by other means. In that case we signal it emitting
-             * the ID but then a NULL entry for the fields. */
-            addReplyArrayLen(c,2);
-            addReplyStreamID(c,&thisid);
-            addReplyNullArray(c);
-        } else {
-            streamNACK *nack = ri.data;
-            nack->delivery_time = mstime();
-            nack->delivery_count++;
-        }
-        arraylen++;
-    }
-    raxStop(&ri);
-    setDeferredArrayLen(c,arraylen_ptr,arraylen);
-    return arraylen;
-}
-
-/* -----------------------------------------------------------------------
- * Stream commands implementation
- * ----------------------------------------------------------------------- */
-
-/* Look the stream at 'key' and return the corresponding stream object.
- * The function creates a key setting it to an empty stream if needed. */
-robj *streamTypeLookupWriteOrCreate(client *c, robj *key, int no_create) {
-    robj *o = lookupKeyWrite(c->db,key);
-    if (checkType(c,o,OBJ_STREAM)) return NULL;
-    if (o == NULL) {
-        if (no_create) {
-            addReplyNull(c);
-            return NULL;
-        }
-        o = createStreamObject();
-        dbAdd(c->db,key,o);
-    }
-    return o;
-}
-
-/* Parse a stream ID in the format given by clients to Redis, that is
- * <ms>-<seq>, and converts it into a streamID structure. If
- * the specified ID is invalid C_ERR is returned and an error is reported
- * to the client, otherwise C_OK is returned. The ID may be in incomplete
- * form, just stating the milliseconds time part of the stream. In such a case
- * the missing part is set according to the value of 'missing_seq' parameter.
- *
- * The IDs "-" and "+" specify respectively the minimum and maximum IDs
- * that can be represented. If 'strict' is set to 1, "-" and "+" will be
- * treated as an invalid ID.
- *
- * If 'c' is set to NULL, no reply is sent to the client. */
-int streamGenericParseIDOrReply(client *c, const robj *o, streamID *id, uint64_t missing_seq, int strict) {
-    char buf[128];
-    if (sdslen(o->ptr) > sizeof(buf)-1) goto invalid;
-    memcpy(buf,o->ptr,sdslen(o->ptr)+1);
-
-    if (strict && (buf[0] == '-' || buf[0] == '+') && buf[1] == '\0')
-        goto invalid;
-
-    /* Handle the "-" and "+" special cases. */
-    if (buf[0] == '-' && buf[1] == '\0') {
-        id->ms = 0;
-        id->seq = 0;
-        return C_OK;
-    } else if (buf[0] == '+' && buf[1] == '\0') {
-        id->ms = UINT64_MAX;
-        id->seq = UINT64_MAX;
-        return C_OK;
-    }
-
-    /* Parse <ms>-<seq> form. */
-    char *dot = strchr(buf,'-');
-    if (dot) *dot = '\0';
-    unsigned long long ms, seq;
-    if (string2ull(buf,&ms) == 0) goto invalid;
-    if (dot && string2ull(dot+1,&seq) == 0) goto invalid;
-    if (!dot) seq = missing_seq;
-    id->ms = ms;
-    id->seq = seq;
-    return C_OK;
-
-invalid:
-    if (c) addReplyError(c,"Invalid stream ID specified as stream "
-                           "command argument");
-    return C_ERR;
-}
-
-/* Wrapper for streamGenericParseIDOrReply() used by module API. */
-int streamParseID(const robj *o, streamID *id) {
-    return streamGenericParseIDOrReply(NULL, o, id, 0, 0);
-}
-
-/* Wrapper for streamGenericParseIDOrReply() with 'strict' argument set to
- * 0, to be used when - and + are acceptable IDs. */
-int streamParseIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq) {
-    return streamGenericParseIDOrReply(c,o,id,missing_seq,0);
-}
-
-/* Wrapper for streamGenericParseIDOrReply() with 'strict' argument set to
- * 1, to be used when we want to return an error if the special IDs + or -
- * are provided. */
-int streamParseStrictIDOrReply(client *c, robj *o, streamID *id, uint64_t missing_seq) {
-    return streamGenericParseIDOrReply(c,o,id,missing_seq,1);
-}
-
-/* Helper for parsing a stream ID that is a range query interval. When the
- * exclude argument is NULL, streamParseIDOrReply() is called and the interval
- * is treated as close (inclusive). Otherwise, the exclude argument is set if 
- * the interval is open (the "(" prefix) and streamParseStrictIDOrReply() is
- * called in that case.
- */
-int streamParseIntervalIDOrReply(client *c, robj *o, streamID *id, int *exclude, uint64_t missing_seq) {
-    char *p = o->ptr;
-    size_t len = sdslen(p);
-    int invalid = 0;
-    
-    if (exclude != NULL) *exclude = (len > 1 && p[0] == '(');
-    if (exclude != NULL && *exclude) {
-        robj *t = createStringObject(p+1,len-1);
-        invalid = (streamParseStrictIDOrReply(c,t,id,missing_seq) == C_ERR);
-        decrRefCount(t);
-    } else 
-        invalid = (streamParseIDOrReply(c,o,id,missing_seq) == C_ERR);
-    if (invalid)
-        return C_ERR;
-    return C_OK;
-}
-
-void streamRewriteApproxSpecifier(client *c, int idx) {
-    rewriteClientCommandArgument(c,idx,shared.special_equals);
-}
-
-/* We propagate MAXLEN/MINID ~ <count> as MAXLEN/MINID = <resulting-len-of-stream>
- * otherwise trimming is no longer deterministic on replicas / AOF. */
-void streamRewriteTrimArgument(client *c, stream *s, int trim_strategy, int idx) {
-    robj *arg;
-    if (trim_strategy == TRIM_STRATEGY_MAXLEN) {
-        arg = createStringObjectFromLongLong(s->length);
-    } else {
-        streamID first_id;
-        streamGetEdgeID(s, 1, &first_id);
-        arg = createObjectFromStreamID(&first_id);
-    }
-
-    rewriteClientCommandArgument(c,idx,arg);
-    decrRefCount(arg);
-}
-
-/* XADD key [(MAXLEN [~|=] <count> | MINID [~|=] <id>) [LIMIT <entries>]] [NOMKSTREAM] <ID or *> [field value] [field value] ... */
-void xaddCommand(client *c) {
-    /* Parse options. */
-    streamAddTrimArgs parsed_args;
-    int idpos = streamParseAddOrTrimArgsOrReply(c, &parsed_args, 1);
-    if (idpos < 0)
-        return; /* streamParseAddOrTrimArgsOrReply already replied. */
-    int field_pos = idpos+1; /* The ID is always one argument before the first field */
-
-    /* Check arity. */
-    if ((c->argc - field_pos) < 2 || ((c->argc-field_pos) % 2) == 1) {
-        addReplyError(c,"wrong number of arguments for XADD");
-        return;
-    }
-
-    /* Return ASAP if minimal ID (0-0) was given so we avoid possibly creating
-     * a new stream and have streamAppendItem fail, leaving an empty key in the
-     * database. */
-    if (parsed_args.id_given &&
-        parsed_args.id.ms == 0 && parsed_args.id.seq == 0)
-    {
-        addReplyError(c,"The ID specified in XADD must be greater than 0-0");
-        return;
-    }
-
-    /* Lookup the stream at key. */
-    robj *o;
-    stream *s;
-    if ((o = streamTypeLookupWriteOrCreate(c,c->argv[1],parsed_args.no_mkstream)) == NULL) return;
-    s = o->ptr;
-
-    /* Return ASAP if the stream has reached the last possible ID */
-    if (s->last_id.ms == UINT64_MAX && s->last_id.seq == UINT64_MAX) {
-        addReplyError(c,"The stream has exhausted the last possible ID, "
-                        "unable to add more items");
-        return;
-    }
-
-    /* Append using the low level function and return the ID. */
-    streamID id;
-    if (streamAppendItem(s,c->argv+field_pos,(c->argc-field_pos)/2,
-        &id, parsed_args.id_given ? &parsed_args.id : NULL) == C_ERR)
-    {
-        if (errno == EDOM)
-            addReplyError(c,"The ID specified in XADD is equal or smaller than "
-                            "the target stream top item");
-        else
-            addReplyError(c,"Elements are too large to be stored");
-        return;
-    }
-    addReplyStreamID(c,&id);
-
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_STREAM,"xadd",c->argv[1],c->db->id);
-    server.dirty++;
-
-    /* Trim if needed. */
-    if (parsed_args.trim_strategy != TRIM_STRATEGY_NONE) {
-        if (streamTrim(s, &parsed_args)) {
-            notifyKeyspaceEvent(NOTIFY_STREAM,"xtrim",c->argv[1],c->db->id);
-        }
-        if (parsed_args.approx_trim) {
-            /* In case our trimming was limited (by LIMIT or by ~) we must
-             * re-write the relevant trim argument to make sure there will be
-             * no inconsistencies in AOF loading or in the replica.
-             * It's enough to check only args->approx because there is no
-             * way LIMIT is given without the ~ option. */
-            streamRewriteApproxSpecifier(c,parsed_args.trim_strategy_arg_idx-1);
-            streamRewriteTrimArgument(c,s,parsed_args.trim_strategy,parsed_args.trim_strategy_arg_idx);
-        }
-    }
-
-    /* Let's rewrite the ID argument with the one actually generated for
-     * AOF/replication propagation. */
-    robj *idarg = createObjectFromStreamID(&id);
-    rewriteClientCommandArgument(c,idpos,idarg);
-    decrRefCount(idarg);
-
-    /* We need to signal to blocked clients that there is new data on this
-     * stream. */
-    signalKeyAsReady(c->db, c->argv[1], OBJ_STREAM);
-}
-
-/* XRANGE/XREVRANGE actual implementation.
- * The 'start' and 'end' IDs are parsed as follows:
- *   Incomplete 'start' has its sequence set to 0, and 'end' to UINT64_MAX.
- *   "-" and "+"" mean the minimal and maximal ID values, respectively.
- *   The "(" prefix means an open (exclusive) range, so XRANGE stream (1-0 (2-0
- *   will match anything from 1-1 and 1-UINT64_MAX.
- */
-void xrangeGenericCommand(client *c, int rev) {
-    robj *o;
-    stream *s;
-    streamID startid, endid;
-    long long count = -1;
-    robj *startarg = rev ? c->argv[3] : c->argv[2];
-    robj *endarg = rev ? c->argv[2] : c->argv[3];
-    int startex = 0, endex = 0;
-    
-    /* Parse start and end IDs. */
-    if (streamParseIntervalIDOrReply(c,startarg,&startid,&startex,0) != C_OK)
-        return;
-    if (startex && streamIncrID(&startid) != C_OK) {
-        addReplyError(c,"invalid start ID for the interval");
-        return;
-    }
-    if (streamParseIntervalIDOrReply(c,endarg,&endid,&endex,UINT64_MAX) != C_OK)
-        return;
-    if (endex && streamDecrID(&endid) != C_OK) {
-        addReplyError(c,"invalid end ID for the interval");
-        return;
-    }
-
-    /* Parse the COUNT option if any. */
-    if (c->argc > 4) {
-        for (int j = 4; j < c->argc; j++) {
-            int additional = c->argc-j-1;
-            if (strcasecmp(c->argv[j]->ptr,"COUNT") == 0 && additional >= 1) {
-                if (getLongLongFromObjectOrReply(c,c->argv[j+1],&count,NULL)
-                    != C_OK) return;
-                if (count < 0) count = 0;
-                j++; /* Consume additional arg. */
-            } else {
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-    }
-
-    /* Return the specified range to the user. */
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyarray)) == NULL ||
-         checkType(c,o,OBJ_STREAM)) return;
-
-    s = o->ptr;
-
-    if (count == 0) {
-        addReplyNullArray(c);
-    } else {
-        if (count == -1) count = 0;
-        streamReplyWithRange(c,s,&startid,&endid,count,rev,NULL,NULL,0,NULL);
-    }
-}
-
-/* XRANGE key start end [COUNT <n>] */
-void xrangeCommand(client *c) {
-    xrangeGenericCommand(c,0);
-}
-
-/* XREVRANGE key end start [COUNT <n>] */
-void xrevrangeCommand(client *c) {
-    xrangeGenericCommand(c,1);
-}
-
-/* XLEN */
-void xlenCommand(client *c) {
-    robj *o;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL
-        || checkType(c,o,OBJ_STREAM)) return;
-    stream *s = o->ptr;
-    addReplyLongLong(c,s->length);
-}
-
-/* XREAD [BLOCK <milliseconds>] [COUNT <count>] STREAMS key_1 key_2 ... key_N
- *       ID_1 ID_2 ... ID_N
- *
- * This function also implements the XREAD-GROUP command, which is like XREAD
- * but accepting the [GROUP group-name consumer-name] additional option.
- * This is useful because while XREAD is a read command and can be called
- * on slaves, XREAD-GROUP is not. */
-#define XREAD_BLOCKED_DEFAULT_COUNT 1000
-void xreadCommand(client *c) {
-    long long timeout = -1; /* -1 means, no BLOCK argument given. */
-    long long count = 0;
-    int streams_count = 0;
-    int streams_arg = 0;
-    int noack = 0;          /* True if NOACK option was specified. */
-    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
-    streamID *ids = static_ids;
-    streamCG **groups = NULL;
-    int xreadgroup = sdslen(c->argv[0]->ptr) == 10; /* XREAD or XREADGROUP? */
-    robj *groupname = NULL;
-    robj *consumername = NULL;
-
-    /* Parse arguments. */
-    for (int i = 1; i < c->argc; i++) {
-        int moreargs = c->argc-i-1;
-        char *o = c->argv[i]->ptr;
-        if (!strcasecmp(o,"BLOCK") && moreargs) {
-            if (c->flags & CLIENT_LUA) {
-                /*
-                 * Although the CLIENT_DENY_BLOCKING flag should protect from blocking the client
-                 * on Lua/MULTI/RM_Call we want special treatment for Lua to keep backword compatibility.
-                 * There is no sense to use BLOCK option within Lua. */
-                addReplyErrorFormat(c, "%s command is not allowed with BLOCK option from scripts", (char *)c->argv[0]->ptr);
-                return;
-            }
-            i++;
-            if (getTimeoutFromObjectOrReply(c,c->argv[i],&timeout,
-                UNIT_MILLISECONDS) != C_OK) return;
-        } else if (!strcasecmp(o,"COUNT") && moreargs) {
-            i++;
-            if (getLongLongFromObjectOrReply(c,c->argv[i],&count,NULL) != C_OK)
-                return;
-            if (count < 0) count = 0;
-        } else if (!strcasecmp(o,"STREAMS") && moreargs) {
-            streams_arg = i+1;
-            streams_count = (c->argc-streams_arg);
-            if ((streams_count % 2) != 0) {
-                addReplyError(c,"Unbalanced XREAD list of streams: "
-                                "for each stream key an ID or '$' must be "
-                                "specified.");
-                return;
-            }
-            streams_count /= 2; /* We have two arguments for each stream. */
-            break;
-        } else if (!strcasecmp(o,"GROUP") && moreargs >= 2) {
-            if (!xreadgroup) {
-                addReplyError(c,"The GROUP option is only supported by "
-                                "XREADGROUP. You called XREAD instead.");
-                return;
-            }
-            groupname = c->argv[i+1];
-            consumername = c->argv[i+2];
-            i += 2;
-        } else if (!strcasecmp(o,"NOACK")) {
-            if (!xreadgroup) {
-                addReplyError(c,"The NOACK option is only supported by "
-                                "XREADGROUP. You called XREAD instead.");
-                return;
-            }
-            noack = 1;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    /* STREAMS option is mandatory. */
-    if (streams_arg == 0) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* If the user specified XREADGROUP then it must also
-     * provide the GROUP option. */
-    if (xreadgroup && groupname == NULL) {
-        addReplyError(c,"Missing GROUP option for XREADGROUP");
-        return;
-    }
-
-    /* Parse the IDs and resolve the group name. */
-    if (streams_count > STREAMID_STATIC_VECTOR_LEN)
-        ids = zmalloc(sizeof(streamID)*streams_count);
-    if (groupname) groups = zmalloc(sizeof(streamCG*)*streams_count);
-
-    for (int i = streams_arg + streams_count; i < c->argc; i++) {
-        /* Specifying "$" as last-known-id means that the client wants to be
-         * served with just the messages that will arrive into the stream
-         * starting from now. */
-        int id_idx = i - streams_arg - streams_count;
-        robj *key = c->argv[i-streams_count];
-        robj *o = lookupKeyRead(c->db,key);
-        if (checkType(c,o,OBJ_STREAM)) goto cleanup;
-        streamCG *group = NULL;
-
-        /* If a group was specified, than we need to be sure that the
-         * key and group actually exist. */
-        if (groupname) {
-            if (o == NULL ||
-                (group = streamLookupCG(o->ptr,groupname->ptr)) == NULL)
-            {
-                addReplyErrorFormat(c, "-NOGROUP No such key '%s' or consumer "
-                                       "group '%s' in XREADGROUP with GROUP "
-                                       "option",
-                                    (char*)key->ptr,(char*)groupname->ptr);
-                goto cleanup;
-            }
-            groups[id_idx] = group;
-        }
-
-        if (strcmp(c->argv[i]->ptr,"$") == 0) {
-            if (xreadgroup) {
-                addReplyError(c,"The $ ID is meaningless in the context of "
-                                "XREADGROUP: you want to read the history of "
-                                "this consumer by specifying a proper ID, or "
-                                "use the > ID to get new messages. The $ ID would "
-                                "just return an empty result set.");
-                goto cleanup;
-            }
-            if (o) {
-                stream *s = o->ptr;
-                ids[id_idx] = s->last_id;
-            } else {
-                ids[id_idx].ms = 0;
-                ids[id_idx].seq = 0;
-            }
-            continue;
-        } else if (strcmp(c->argv[i]->ptr,">") == 0) {
-            if (!xreadgroup) {
-                addReplyError(c,"The > ID can be specified only when calling "
-                                "XREADGROUP using the GROUP <group> "
-                                "<consumer> option.");
-                goto cleanup;
-            }
-            /* We use just the maximum ID to signal this is a ">" ID, anyway
-             * the code handling the blocking clients will have to update the
-             * ID later in order to match the changing consumer group last ID. */
-            ids[id_idx].ms = UINT64_MAX;
-            ids[id_idx].seq = UINT64_MAX;
-            continue;
-        }
-        if (streamParseStrictIDOrReply(c,c->argv[i],ids+id_idx,0) != C_OK)
-            goto cleanup;
-    }
-
-    /* Try to serve the client synchronously. */
-    size_t arraylen = 0;
-    void *arraylen_ptr = NULL;
-    for (int i = 0; i < streams_count; i++) {
-        robj *o = lookupKeyRead(c->db,c->argv[streams_arg+i]);
-        if (o == NULL) continue;
-        stream *s = o->ptr;
-        streamID *gt = ids+i; /* ID must be greater than this. */
-        int serve_synchronously = 0;
-        int serve_history = 0; /* True for XREADGROUP with ID != ">". */
-
-        /* Check if there are the conditions to serve the client
-         * synchronously. */
-        if (groups) {
-            /* If the consumer is blocked on a group, we always serve it
-             * synchronously (serving its local history) if the ID specified
-             * was not the special ">" ID. */
-            if (gt->ms != UINT64_MAX ||
-                gt->seq != UINT64_MAX)
-            {
-                serve_synchronously = 1;
-                serve_history = 1;
-            } else if (s->length) {
-                /* We also want to serve a consumer in a consumer group
-                 * synchronously in case the group top item delivered is smaller
-                 * than what the stream has inside. */
-                streamID maxid, *last = &groups[i]->last_id;
-                streamLastValidID(s, &maxid);
-                if (streamCompareID(&maxid, last) > 0) {
-                    serve_synchronously = 1;
-                    *gt = *last;
-                }
-            }
-        } else if (s->length) {
-            /* For consumers without a group, we serve synchronously if we can
-             * actually provide at least one item from the stream. */
-            streamID maxid;
-            streamLastValidID(s, &maxid);
-            if (streamCompareID(&maxid, gt) > 0) {
-                serve_synchronously = 1;
-            }
-        }
-
-        if (serve_synchronously) {
-            arraylen++;
-            if (arraylen == 1) arraylen_ptr = addReplyDeferredLen(c);
-            /* streamReplyWithRange() handles the 'start' ID as inclusive,
-             * so start from the next ID, since we want only messages with
-             * IDs greater than start. */
-            streamID start = *gt;
-            streamIncrID(&start);
-
-            /* Emit the two elements sub-array consisting of the name
-             * of the stream and the data we extracted from it. */
-            if (c->resp == 2) addReplyArrayLen(c,2);
-            addReplyBulk(c,c->argv[streams_arg+i]);
-            int created = 0;
-            streamConsumer *consumer = NULL;
-            if (groups) consumer = streamLookupConsumer(groups[i],
-                                                        consumername->ptr,
-                                                        SLC_NONE,
-                                                        &created);
-            streamPropInfo spi = {c->argv[i+streams_arg],groupname};
-            if (created && noack)
-                streamPropagateConsumerCreation(c,spi.keyname,
-                                                spi.groupname,
-                                                consumer->name);
-            int flags = 0;
-            if (noack) flags |= STREAM_RWR_NOACK;
-            if (serve_history) flags |= STREAM_RWR_HISTORY;
-            streamReplyWithRange(c,s,&start,NULL,count,0,
-                                 groups ? groups[i] : NULL,
-                                 consumer, flags, &spi);
-            if (groups) server.dirty++;
-        }
-    }
-
-     /* We replied synchronously! Set the top array len and return to caller. */
-    if (arraylen) {
-        if (c->resp == 2)
-            setDeferredArrayLen(c,arraylen_ptr,arraylen);
-        else
-            setDeferredMapLen(c,arraylen_ptr,arraylen);
-        goto cleanup;
-    }
-
-    /* Block if needed. */
-    if (timeout != -1) {
-        /* If we are not allowed to block the client, the only thing
-         * we can do is treating it as a timeout (even with timeout 0). */
-        if (c->flags & CLIENT_DENY_BLOCKING) {
-            addReplyNullArray(c);
-            goto cleanup;
-        }
-        blockForKeys(c, BLOCKED_STREAM, c->argv+streams_arg, streams_count,
-                     timeout, NULL, NULL, ids);
-        /* If no COUNT is given and we block, set a relatively small count:
-         * in case the ID provided is too low, we do not want the server to
-         * block just to serve this client a huge stream of messages. */
-        c->bpop.xread_count = count ? count : XREAD_BLOCKED_DEFAULT_COUNT;
-
-        /* If this is a XREADGROUP + GROUP we need to remember for which
-         * group and consumer name we are blocking, so later when one of the
-         * keys receive more data, we can call streamReplyWithRange() passing
-         * the right arguments. */
-        if (groupname) {
-            incrRefCount(groupname);
-            incrRefCount(consumername);
-            c->bpop.xread_group = groupname;
-            c->bpop.xread_consumer = consumername;
-            c->bpop.xread_group_noack = noack;
-        } else {
-            c->bpop.xread_group = NULL;
-            c->bpop.xread_consumer = NULL;
-        }
-        goto cleanup;
-    }
-
-    /* No BLOCK option, nor any stream we can serve. Reply as with a
-     * timeout happened. */
-    addReplyNullArray(c);
-    /* Continue to cleanup... */
-
-cleanup: /* Cleanup. */
-
-    /* The command is propagated (in the READGROUP form) as a side effect
-     * of calling lower level APIs. So stop any implicit propagation. */
-    preventCommandPropagation(c);
-    if (ids != static_ids) zfree(ids);
-    zfree(groups);
-}
-
-/* -----------------------------------------------------------------------
- * Low level implementation of consumer groups
- * ----------------------------------------------------------------------- */
-
-/* Create a NACK entry setting the delivery count to 1 and the delivery
- * time to the current time. The NACK consumer will be set to the one
- * specified as argument of the function. */
-streamNACK *streamCreateNACK(streamConsumer *consumer) {
-    streamNACK *nack = zmalloc(sizeof(*nack));
-    nack->delivery_time = mstime();
-    nack->delivery_count = 1;
-    nack->consumer = consumer;
-    return nack;
-}
-
-/* Free a NACK entry. */
-void streamFreeNACK(streamNACK *na) {
-    zfree(na);
-}
-
-/* Free a consumer and associated data structures. Note that this function
- * will not reassign the pending messages associated with this consumer
- * nor will delete them from the stream, so when this function is called
- * to delete a consumer, and not when the whole stream is destroyed, the caller
- * should do some work before. */
-void streamFreeConsumer(streamConsumer *sc) {
-    raxFree(sc->pel); /* No value free callback: the PEL entries are shared
-                         between the consumer and the main stream PEL. */
-    sdsfree(sc->name);
-    zfree(sc);
-}
-
-/* Create a new consumer group in the context of the stream 's', having the
- * specified name and last server ID. If a consumer group with the same name
- * already existed NULL is returned, otherwise the pointer to the consumer
- * group is returned. */
-streamCG *streamCreateCG(stream *s, char *name, size_t namelen, streamID *id) {
-    if (s->cgroups == NULL) s->cgroups = raxNew();
-    if (raxFind(s->cgroups,(unsigned char*)name,namelen) != raxNotFound)
-        return NULL;
-
-    streamCG *cg = zmalloc(sizeof(*cg));
-    cg->pel = raxNew();
-    cg->consumers = raxNew();
-    cg->last_id = *id;
-    raxInsert(s->cgroups,(unsigned char*)name,namelen,cg,NULL);
-    return cg;
-}
-
-/* Free a consumer group and all its associated data. */
-void streamFreeCG(streamCG *cg) {
-    raxFreeWithCallback(cg->pel,(void(*)(void*))streamFreeNACK);
-    raxFreeWithCallback(cg->consumers,(void(*)(void*))streamFreeConsumer);
-    zfree(cg);
-}
-
-/* Lookup the consumer group in the specified stream and returns its
- * pointer, otherwise if there is no such group, NULL is returned. */
-streamCG *streamLookupCG(stream *s, sds groupname) {
-    if (s->cgroups == NULL) return NULL;
-    streamCG *cg = raxFind(s->cgroups,(unsigned char*)groupname,
-                           sdslen(groupname));
-    return (cg == raxNotFound) ? NULL : cg;
-}
-
-/* Lookup the consumer with the specified name in the group 'cg': if the
- * consumer does not exist it is created unless SLC_NOCREAT flag was specified.
- * Its last seen time is updated unless SLC_NOREFRESH flag was specified. */
-streamConsumer *streamLookupConsumer(streamCG *cg, sds name, int flags, int *created) {
-    if (created) *created = 0;
-    int create = !(flags & SLC_NOCREAT);
-    int refresh = !(flags & SLC_NOREFRESH);
-    streamConsumer *consumer = raxFind(cg->consumers,(unsigned char*)name,
-                               sdslen(name));
-    if (consumer == raxNotFound) {
-        if (!create) return NULL;
-        consumer = zmalloc(sizeof(*consumer));
-        consumer->name = sdsdup(name);
-        consumer->pel = raxNew();
-        raxInsert(cg->consumers,(unsigned char*)name,sdslen(name),
-                  consumer,NULL);
-        consumer->seen_time = mstime();
-        if (created) *created = 1;
-    } else if (refresh)
-        consumer->seen_time = mstime();
-    return consumer;
-}
-
-/* Delete the consumer specified in the consumer group 'cg'. The consumer
- * may have pending messages: they are removed from the PEL, and the number
- * of pending messages "lost" is returned. */
-uint64_t streamDelConsumer(streamCG *cg, sds name) {
-    streamConsumer *consumer =
-        streamLookupConsumer(cg,name,SLC_NOCREAT|SLC_NOREFRESH,NULL);
-    if (consumer == NULL) return 0;
-
-    uint64_t retval = raxSize(consumer->pel);
-
-    /* Iterate all the consumer pending messages, deleting every corresponding
-     * entry from the global entry. */
-    raxIterator ri;
-    raxStart(&ri,consumer->pel);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        streamNACK *nack = ri.data;
-        raxRemove(cg->pel,ri.key,ri.key_len,NULL);
-        streamFreeNACK(nack);
-    }
-    raxStop(&ri);
-
-    /* Deallocate the consumer. */
-    raxRemove(cg->consumers,(unsigned char*)name,sdslen(name),NULL);
-    streamFreeConsumer(consumer);
-    return retval;
-}
-
-/* -----------------------------------------------------------------------
- * Consumer groups commands
- * ----------------------------------------------------------------------- */
-
-/* XGROUP CREATE <key> <groupname> <id or $> [MKSTREAM]
- * XGROUP SETID <key> <groupname> <id or $>
- * XGROUP DESTROY <key> <groupname>
- * XGROUP CREATECONSUMER <key> <groupname> <consumer>
- * XGROUP DELCONSUMER <key> <groupname> <consumername> */
-void xgroupCommand(client *c) {
-    stream *s = NULL;
-    sds grpname = NULL;
-    streamCG *cg = NULL;
-    char *opt = c->argv[1]->ptr; /* Subcommand name. */
-    int mkstream = 0;
-    robj *o;
-
-    /* CREATE has an MKSTREAM option that creates the stream if it
-     * does not exist. */
-    if (c->argc == 6 && !strcasecmp(opt,"CREATE")) {
-        if (strcasecmp(c->argv[5]->ptr,"MKSTREAM")) {
-            addReplySubcommandSyntaxError(c);
-            return;
-        }
-        mkstream = 1;
-        grpname = c->argv[3]->ptr;
-    }
-
-    /* Everything but the "HELP" option requires a key and group name. */
-    if (c->argc >= 4) {
-        o = lookupKeyWrite(c->db,c->argv[2]);
-        if (o) {
-            if (checkType(c,o,OBJ_STREAM)) return;
-            s = o->ptr;
-        }
-        grpname = c->argv[3]->ptr;
-    }
-
-    /* Check for missing key/group. */
-    if (c->argc >= 4 && !mkstream) {
-        /* At this point key must exist, or there is an error. */
-        if (s == NULL) {
-            addReplyError(c,
-                "The XGROUP subcommand requires the key to exist. "
-                "Note that for CREATE you may want to use the MKSTREAM "
-                "option to create an empty stream automatically.");
-            return;
-        }
-
-        /* Certain subcommands require the group to exist. */
-        if ((cg = streamLookupCG(s,grpname)) == NULL &&
-            (!strcasecmp(opt,"SETID") ||
-             !strcasecmp(opt,"CREATECONSUMER") ||
-             !strcasecmp(opt,"DELCONSUMER")))
-        {
-            addReplyErrorFormat(c, "-NOGROUP No such consumer group '%s' "
-                                   "for key name '%s'",
-                                   (char*)grpname, (char*)c->argv[2]->ptr);
-            return;
-        }
-    }
-
-    /* Dispatch the different subcommands. */
-    if (c->argc == 2 && !strcasecmp(opt,"HELP")) {
-        const char *help[] = {
-"CREATE <key> <groupname> <id|$> [option]",
-"    Create a new consumer group. Options are:",
-"    * MKSTREAM",
-"      Create the empty stream if it does not exist.",
-"CREATECONSUMER <key> <groupname> <consumer>",
-"    Create a new consumer in the specified group.",
-"DELCONSUMER <key> <groupname> <consumer>",
-"    Remove the specified consumer.",
-"DESTROY <key> <groupname>"
-"    Remove the specified group.",
-"SETID <key> <groupname> <id|$>",
-"    Set the current group ID.",
-NULL
-        };
-        addReplyHelp(c, help);
-    } else if (!strcasecmp(opt,"CREATE") && (c->argc == 5 || c->argc == 6)) {
-        streamID id;
-        if (!strcmp(c->argv[4]->ptr,"$")) {
-            if (s) {
-                id = s->last_id;
-            } else {
-                id.ms = 0;
-                id.seq = 0;
-            }
-        } else if (streamParseStrictIDOrReply(c,c->argv[4],&id,0) != C_OK) {
-            return;
-        }
-
-        /* Handle the MKSTREAM option now that the command can no longer fail. */
-        if (s == NULL) {
-            serverAssert(mkstream);
-            o = createStreamObject();
-            dbAdd(c->db,c->argv[2],o);
-            s = o->ptr;
-            signalModifiedKey(c,c->db,c->argv[2]);
-        }
-
-        streamCG *cg = streamCreateCG(s,grpname,sdslen(grpname),&id);
-        if (cg) {
-            addReply(c,shared.ok);
-            server.dirty++;
-            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-create",
-                                c->argv[2],c->db->id);
-        } else {
-            addReplyError(c,"-BUSYGROUP Consumer Group name already exists");
-        }
-    } else if (!strcasecmp(opt,"SETID") && c->argc == 5) {
-        streamID id;
-        if (!strcmp(c->argv[4]->ptr,"$")) {
-            id = s->last_id;
-        } else if (streamParseIDOrReply(c,c->argv[4],&id,0) != C_OK) {
-            return;
-        }
-        cg->last_id = id;
-        addReply(c,shared.ok);
-        server.dirty++;
-        notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-setid",c->argv[2],c->db->id);
-    } else if (!strcasecmp(opt,"DESTROY") && c->argc == 4) {
-        if (cg) {
-            raxRemove(s->cgroups,(unsigned char*)grpname,sdslen(grpname),NULL);
-            streamFreeCG(cg);
-            addReply(c,shared.cone);
-            server.dirty++;
-            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-destroy",
-                                c->argv[2],c->db->id);
-            /* We want to unblock any XREADGROUP consumers with -NOGROUP. */
-            signalKeyAsReady(c->db,c->argv[2],OBJ_STREAM);
-        } else {
-            addReply(c,shared.czero);
-        }
-    } else if (!strcasecmp(opt,"CREATECONSUMER") && c->argc == 5) {
-        int created = 0;
-        streamLookupConsumer(cg,c->argv[4]->ptr,SLC_NOREFRESH,&created);
-        if (created) {
-            server.dirty++;
-            notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-createconsumer",
-                                c->argv[2],c->db->id);
-        }
-        addReplyLongLong(c,created);
-    } else if (!strcasecmp(opt,"DELCONSUMER") && c->argc == 5) {
-        /* Delete the consumer and returns the number of pending messages
-         * that were yet associated with such a consumer. */
-        long long pending = streamDelConsumer(cg,c->argv[4]->ptr);
-        addReplyLongLong(c,pending);
-        server.dirty++;
-        notifyKeyspaceEvent(NOTIFY_STREAM,"xgroup-delconsumer",
-                            c->argv[2],c->db->id);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* XSETID <stream> <id>
- *
- * Set the internal "last ID" of a stream. */
-void xsetidCommand(client *c) {
-    robj *o = lookupKeyWriteOrReply(c,c->argv[1],shared.nokeyerr);
-    if (o == NULL || checkType(c,o,OBJ_STREAM)) return;
-
-    stream *s = o->ptr;
-    streamID id;
-    if (streamParseStrictIDOrReply(c,c->argv[2],&id,0) != C_OK) return;
-
-    /* If the stream has at least one item, we want to check that the user
-     * is setting a last ID that is equal or greater than the current top
-     * item, otherwise the fundamental ID monotonicity assumption is violated. */
-    if (s->length > 0) {
-        streamID maxid;
-        streamLastValidID(s,&maxid);
-
-        if (streamCompareID(&id,&maxid) < 0) {
-            addReplyError(c,"The ID specified in XSETID is smaller than the "
-                            "target stream top item");
-            return;
-        }
-    }
-    s->last_id = id;
-    addReply(c,shared.ok);
-    server.dirty++;
-    notifyKeyspaceEvent(NOTIFY_STREAM,"xsetid",c->argv[1],c->db->id);
-}
-
-/* XACK <key> <group> <id> <id> ... <id>
- *
- * Acknowledge a message as processed. In practical terms we just check the
- * pendine entries list (PEL) of the group, and delete the PEL entry both from
- * the group and the consumer (pending messages are referenced in both places).
- *
- * Return value of the command is the number of messages successfully
- * acknowledged, that is, the IDs we were actually able to resolve in the PEL.
- */
-void xackCommand(client *c) {
-    streamCG *group = NULL;
-    robj *o = lookupKeyRead(c->db,c->argv[1]);
-    if (o) {
-        if (checkType(c,o,OBJ_STREAM)) return; /* Type error. */
-        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
-    }
-
-    /* No key or group? Nothing to ack. */
-    if (o == NULL || group == NULL) {
-        addReply(c,shared.czero);
-        return;
-    }
-
-    /* Start parsing the IDs, so that we abort ASAP if there is a syntax
-     * error: the return value of this command cannot be an error in case
-     * the client successfully acknowledged some messages, so it should be
-     * executed in a "all or nothing" fashion. */
-    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
-    streamID *ids = static_ids;
-    int id_count = c->argc-3;
-    if (id_count > STREAMID_STATIC_VECTOR_LEN)
-        ids = zmalloc(sizeof(streamID)*id_count);
-    for (int j = 3; j < c->argc; j++) {
-        if (streamParseStrictIDOrReply(c,c->argv[j],&ids[j-3],0) != C_OK) goto cleanup;
-    }
-
-    int acknowledged = 0;
-    for (int j = 3; j < c->argc; j++) {
-        unsigned char buf[sizeof(streamID)];
-        streamEncodeID(buf,&ids[j-3]);
-
-        /* Lookup the ID in the group PEL: it will have a reference to the
-         * NACK structure that will have a reference to the consumer, so that
-         * we are able to remove the entry from both PELs. */
-        streamNACK *nack = raxFind(group->pel,buf,sizeof(buf));
-        if (nack != raxNotFound) {
-            raxRemove(group->pel,buf,sizeof(buf),NULL);
-            raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
-            streamFreeNACK(nack);
-            acknowledged++;
-            server.dirty++;
-        }
-    }
-    addReplyLongLong(c,acknowledged);
-cleanup:
-    if (ids != static_ids) zfree(ids);
-}
-
-/* XPENDING <key> <group> [[IDLE <idle>] <start> <stop> <count> [<consumer>]]
- *
- * If start and stop are omitted, the command just outputs information about
- * the amount of pending messages for the key/group pair, together with
- * the minimum and maximum ID of pending messages.
- *
- * If start and stop are provided instead, the pending messages are returned
- * with information about the current owner, number of deliveries and last
- * delivery time and so forth. */
-void xpendingCommand(client *c) {
-    int justinfo = c->argc == 3; /* Without the range just outputs general
-                                    informations about the PEL. */
-    robj *key = c->argv[1];
-    robj *groupname = c->argv[2];
-    robj *consumername = NULL;
-    streamID startid, endid;
-    long long count = 0;
-    long long minidle = 0;
-    int startex = 0, endex = 0;
-
-    /* Start and stop, and the consumer, can be omitted. Also the IDLE modifier. */
-    if (c->argc != 3 && (c->argc < 6 || c->argc > 9)) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* Parse start/end/count arguments ASAP if needed, in order to report
-     * syntax errors before any other error. */
-    if (c->argc >= 6) {
-        int startidx = 3; /* Without IDLE */
-
-        if (!strcasecmp(c->argv[3]->ptr, "IDLE")) {
-            if (getLongLongFromObjectOrReply(c, c->argv[4], &minidle, NULL) == C_ERR)
-                return;
-            if (c->argc < 8) {
-                /* If IDLE was provided we must have at least 'start end count' */
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-            /* Search for rest of arguments after 'IDLE <idle>' */
-            startidx += 2;
-        }
-
-        /* count argument. */
-        if (getLongLongFromObjectOrReply(c,c->argv[startidx+2],&count,NULL) == C_ERR)
-            return;
-        if (count < 0) count = 0;
-
-        /* start and end arguments. */
-        if (streamParseIntervalIDOrReply(c,c->argv[startidx],&startid,&startex,0) != C_OK)
-            return;
-        if (startex && streamIncrID(&startid) != C_OK) {
-            addReplyError(c,"invalid start ID for the interval");
-            return;
-        }
-        if (streamParseIntervalIDOrReply(c,c->argv[startidx+1],&endid,&endex,UINT64_MAX) != C_OK)
-            return;
-        if (endex && streamDecrID(&endid) != C_OK) {
-            addReplyError(c,"invalid end ID for the interval");
-            return;
-        }
-
-        if (startidx+3 < c->argc) {
-            /* 'consumer' was provided */
-            consumername = c->argv[startidx+3];
-        }
-    }
-
-    /* Lookup the key and the group inside the stream. */
-    robj *o = lookupKeyRead(c->db,c->argv[1]);
-    streamCG *group;
-
-    if (checkType(c,o,OBJ_STREAM)) return;
-    if (o == NULL ||
-        (group = streamLookupCG(o->ptr,groupname->ptr)) == NULL)
-    {
-        addReplyErrorFormat(c, "-NOGROUP No such key '%s' or consumer "
-                               "group '%s'",
-                               (char*)key->ptr,(char*)groupname->ptr);
-        return;
-    }
-
-    /* XPENDING <key> <group> variant. */
-    if (justinfo) {
-        addReplyArrayLen(c,4);
-        /* Total number of messages in the PEL. */
-        addReplyLongLong(c,raxSize(group->pel));
-        /* First and last IDs. */
-        if (raxSize(group->pel) == 0) {
-            addReplyNull(c); /* Start. */
-            addReplyNull(c); /* End. */
-            addReplyNullArray(c); /* Clients. */
-        } else {
-            /* Start. */
-            raxIterator ri;
-            raxStart(&ri,group->pel);
-            raxSeek(&ri,"^",NULL,0);
-            raxNext(&ri);
-            streamDecodeID(ri.key,&startid);
-            addReplyStreamID(c,&startid);
-
-            /* End. */
-            raxSeek(&ri,"$",NULL,0);
-            raxNext(&ri);
-            streamDecodeID(ri.key,&endid);
-            addReplyStreamID(c,&endid);
-            raxStop(&ri);
-
-            /* Consumers with pending messages. */
-            raxStart(&ri,group->consumers);
-            raxSeek(&ri,"^",NULL,0);
-            void *arraylen_ptr = addReplyDeferredLen(c);
-            size_t arraylen = 0;
-            while(raxNext(&ri)) {
-                streamConsumer *consumer = ri.data;
-                if (raxSize(consumer->pel) == 0) continue;
-                addReplyArrayLen(c,2);
-                addReplyBulkCBuffer(c,ri.key,ri.key_len);
-                addReplyBulkLongLong(c,raxSize(consumer->pel));
-                arraylen++;
-            }
-            setDeferredArrayLen(c,arraylen_ptr,arraylen);
-            raxStop(&ri);
-        }
-    } else { /* <start>, <stop> and <count> provided, return actual pending entries (not just info) */
-        streamConsumer *consumer = NULL;
-        if (consumername) {
-            consumer = streamLookupConsumer(group,
-                                            consumername->ptr,
-                                            SLC_NOCREAT|SLC_NOREFRESH,
-                                            NULL);
-
-            /* If a consumer name was mentioned but it does not exist, we can
-             * just return an empty array. */
-            if (consumer == NULL) {
-                addReplyArrayLen(c,0);
-                return;
-            }
-        }
-
-        rax *pel = consumer ? consumer->pel : group->pel;
-        unsigned char startkey[sizeof(streamID)];
-        unsigned char endkey[sizeof(streamID)];
-        raxIterator ri;
-        mstime_t now = mstime();
-
-        streamEncodeID(startkey,&startid);
-        streamEncodeID(endkey,&endid);
-        raxStart(&ri,pel);
-        raxSeek(&ri,">=",startkey,sizeof(startkey));
-        void *arraylen_ptr = addReplyDeferredLen(c);
-        size_t arraylen = 0;
-
-        while(count && raxNext(&ri) && memcmp(ri.key,endkey,ri.key_len) <= 0) {
-            streamNACK *nack = ri.data;
-
-            if (minidle) {
-                mstime_t this_idle = now - nack->delivery_time;
-                if (this_idle < minidle) continue;
-            }
-
-            arraylen++;
-            count--;
-            addReplyArrayLen(c,4);
-
-            /* Entry ID. */
-            streamID id;
-            streamDecodeID(ri.key,&id);
-            addReplyStreamID(c,&id);
-
-            /* Consumer name. */
-            addReplyBulkCBuffer(c,nack->consumer->name,
-                                sdslen(nack->consumer->name));
-
-            /* Milliseconds elapsed since last delivery. */
-            mstime_t elapsed = now - nack->delivery_time;
-            if (elapsed < 0) elapsed = 0;
-            addReplyLongLong(c,elapsed);
-
-            /* Number of deliveries. */
-            addReplyLongLong(c,nack->delivery_count);
-        }
-        raxStop(&ri);
-        setDeferredArrayLen(c,arraylen_ptr,arraylen);
-    }
-}
-
-/* XCLAIM <key> <group> <consumer> <min-idle-time> <ID-1> <ID-2>
- *        [IDLE <milliseconds>] [TIME <mstime>] [RETRYCOUNT <count>]
- *        [FORCE] [JUSTID]
- *
- * Gets ownership of one or multiple messages in the Pending Entries List
- * of a given stream consumer group.
- *
- * If the message ID (among the specified ones) exists, and its idle
- * time greater or equal to <min-idle-time>, then the message new owner
- * becomes the specified <consumer>. If the minimum idle time specified
- * is zero, messages are claimed regardless of their idle time.
- *
- * All the messages that cannot be found inside the pending entries list
- * are ignored, but in case the FORCE option is used. In that case we
- * create the NACK (representing a not yet acknowledged message) entry in
- * the consumer group PEL.
- *
- * This command creates the consumer as side effect if it does not yet
- * exists. Moreover the command reset the idle time of the message to 0,
- * even if by using the IDLE or TIME options, the user can control the
- * new idle time.
- *
- * The options at the end can be used in order to specify more attributes
- * to set in the representation of the pending message:
- *
- * 1. IDLE <ms>:
- *      Set the idle time (last time it was delivered) of the message.
- *      If IDLE is not specified, an IDLE of 0 is assumed, that is,
- *      the time count is reset because the message has now a new
- *      owner trying to process it.
- *
- * 2. TIME <ms-unix-time>:
- *      This is the same as IDLE but instead of a relative amount of
- *      milliseconds, it sets the idle time to a specific unix time
- *      (in milliseconds). This is useful in order to rewrite the AOF
- *      file generating XCLAIM commands.
- *
- * 3. RETRYCOUNT <count>:
- *      Set the retry counter to the specified value. This counter is
- *      incremented every time a message is delivered again. Normally
- *      XCLAIM does not alter this counter, which is just served to clients
- *      when the XPENDING command is called: this way clients can detect
- *      anomalies, like messages that are never processed for some reason
- *      after a big number of delivery attempts.
- *
- * 4. FORCE:
- *      Creates the pending message entry in the PEL even if certain
- *      specified IDs are not already in the PEL assigned to a different
- *      client. However the message must be exist in the stream, otherwise
- *      the IDs of non existing messages are ignored.
- *
- * 5. JUSTID:
- *      Return just an array of IDs of messages successfully claimed,
- *      without returning the actual message.
- *
- * 6. LASTID <id>:
- *      Update the consumer group last ID with the specified ID if the
- *      current last ID is smaller than the provided one.
- *      This is used for replication / AOF, so that when we read from a
- *      consumer group, the XCLAIM that gets propagated to give ownership
- *      to the consumer, is also used in order to update the group current
- *      ID.
- *
- * The command returns an array of messages that the user
- * successfully claimed, so that the caller is able to understand
- * what messages it is now in charge of. */
-void xclaimCommand(client *c) {
-    streamCG *group = NULL;
-    robj *o = lookupKeyRead(c->db,c->argv[1]);
-    long long minidle; /* Minimum idle time argument. */
-    long long retrycount = -1;   /* -1 means RETRYCOUNT option not given. */
-    mstime_t deliverytime = -1;  /* -1 means IDLE/TIME options not given. */
-    int force = 0;
-    int justid = 0;
-
-    if (o) {
-        if (checkType(c,o,OBJ_STREAM)) return; /* Type error. */
-        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
-    }
-
-    /* No key or group? Send an error given that the group creation
-     * is mandatory. */
-    if (o == NULL || group == NULL) {
-        addReplyErrorFormat(c,"-NOGROUP No such key '%s' or "
-                              "consumer group '%s'", (char*)c->argv[1]->ptr,
-                              (char*)c->argv[2]->ptr);
-        return;
-    }
-
-    if (getLongLongFromObjectOrReply(c,c->argv[4],&minidle,
-        "Invalid min-idle-time argument for XCLAIM")
-        != C_OK) return;
-    if (minidle < 0) minidle = 0;
-
-    /* Start parsing the IDs, so that we abort ASAP if there is a syntax
-     * error: the return value of this command cannot be an error in case
-     * the client successfully claimed some message, so it should be
-     * executed in a "all or nothing" fashion. */
-    int j;
-    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
-    streamID *ids = static_ids;
-    int id_count = c->argc-5;
-    if (id_count > STREAMID_STATIC_VECTOR_LEN)
-        ids = zmalloc(sizeof(streamID)*id_count);
-    for (j = 5; j < c->argc; j++) {
-        if (streamParseStrictIDOrReply(NULL,c->argv[j],&ids[j-5],0) != C_OK) break;
-    }
-    int last_id_arg = j-1; /* Next time we iterate the IDs we now the range. */
-
-    /* If we stopped because some IDs cannot be parsed, perhaps they
-     * are trailing options. */
-    mstime_t now = mstime();
-    streamID last_id = {0,0};
-    int propagate_last_id = 0;
-    for (; j < c->argc; j++) {
-        int moreargs = (c->argc-1) - j; /* Number of additional arguments. */
-        char *opt = c->argv[j]->ptr;
-        if (!strcasecmp(opt,"FORCE")) {
-            force = 1;
-        } else if (!strcasecmp(opt,"JUSTID")) {
-            justid = 1;
-        } else if (!strcasecmp(opt,"IDLE") && moreargs) {
-            j++;
-            if (getLongLongFromObjectOrReply(c,c->argv[j],&deliverytime,
-                "Invalid IDLE option argument for XCLAIM")
-                != C_OK) goto cleanup;
-            deliverytime = now - deliverytime;
-        } else if (!strcasecmp(opt,"TIME") && moreargs) {
-            j++;
-            if (getLongLongFromObjectOrReply(c,c->argv[j],&deliverytime,
-                "Invalid TIME option argument for XCLAIM")
-                != C_OK) goto cleanup;
-        } else if (!strcasecmp(opt,"RETRYCOUNT") && moreargs) {
-            j++;
-            if (getLongLongFromObjectOrReply(c,c->argv[j],&retrycount,
-                "Invalid RETRYCOUNT option argument for XCLAIM")
-                != C_OK) goto cleanup;
-        } else if (!strcasecmp(opt,"LASTID") && moreargs) {
-            j++;
-            if (streamParseStrictIDOrReply(c,c->argv[j],&last_id,0) != C_OK) goto cleanup;
-        } else {
-            addReplyErrorFormat(c,"Unrecognized XCLAIM option '%s'",opt);
-            goto cleanup;
-        }
-    }
-
-    if (streamCompareID(&last_id,&group->last_id) > 0) {
-        group->last_id = last_id;
-        propagate_last_id = 1;
-    }
-
-    if (deliverytime != -1) {
-        /* If a delivery time was passed, either with IDLE or TIME, we
-         * do some sanity check on it, and set the deliverytime to now
-         * (which is a sane choice usually) if the value is bogus.
-         * To raise an error here is not wise because clients may compute
-         * the idle time doing some math starting from their local time,
-         * and this is not a good excuse to fail in case, for instance,
-         * the computer time is a bit in the future from our POV. */
-        if (deliverytime < 0 || deliverytime > now) deliverytime = now;
-    } else {
-        /* If no IDLE/TIME option was passed, we want the last delivery
-         * time to be now, so that the idle time of the message will be
-         * zero. */
-        deliverytime = now;
-    }
-
-    /* Do the actual claiming. */
-    streamConsumer *consumer = NULL;
-    void *arraylenptr = addReplyDeferredLen(c);
-    size_t arraylen = 0;
-    for (int j = 5; j <= last_id_arg; j++) {
-        streamID id = ids[j-5];
-        unsigned char buf[sizeof(streamID)];
-        streamEncodeID(buf,&id);
-
-        /* Lookup the ID in the group PEL. */
-        streamNACK *nack = raxFind(group->pel,buf,sizeof(buf));
-
-        /* If FORCE is passed, let's check if at least the entry
-         * exists in the Stream. In such case, we'll crate a new
-         * entry in the PEL from scratch, so that XCLAIM can also
-         * be used to create entries in the PEL. Useful for AOF
-         * and replication of consumer groups. */
-        if (force && nack == raxNotFound) {
-            streamIterator myiterator;
-            streamIteratorStart(&myiterator,o->ptr,&id,&id,0);
-            int64_t numfields;
-            int found = 0;
-            streamID item_id;
-            if (streamIteratorGetID(&myiterator,&item_id,&numfields)) found = 1;
-            streamIteratorStop(&myiterator);
-
-            /* Item must exist for us to create a NACK for it. */
-            if (!found) continue;
-
-            /* Create the NACK. */
-            nack = streamCreateNACK(NULL);
-            raxInsert(group->pel,buf,sizeof(buf),nack,NULL);
-        }
-
-        if (nack != raxNotFound) {
-            /* We need to check if the minimum idle time requested
-             * by the caller is satisfied by this entry.
-             *
-             * Note that the nack could be created by FORCE, in this
-             * case there was no pre-existing entry and minidle should
-             * be ignored, but in that case nack->consumer is NULL. */
-            if (nack->consumer && minidle) {
-                mstime_t this_idle = now - nack->delivery_time;
-                if (this_idle < minidle) continue;
-            }
-            if (consumer == NULL)
-                consumer = streamLookupConsumer(group,c->argv[3]->ptr,SLC_NONE,NULL);
-            if (nack->consumer != consumer) {
-                /* Remove the entry from the old consumer.
-                 * Note that nack->consumer is NULL if we created the
-                 * NACK above because of the FORCE option. */
-                if (nack->consumer)
-                    raxRemove(nack->consumer->pel,buf,sizeof(buf),NULL);
-            }
-            nack->delivery_time = deliverytime;
-            /* Set the delivery attempts counter if given, otherwise
-             * autoincrement unless JUSTID option provided */
-            if (retrycount >= 0) {
-                nack->delivery_count = retrycount;
-            } else if (!justid) {
-                nack->delivery_count++;
-            }
-            if (nack->consumer != consumer) {
-                /* Add the entry in the new consumer local PEL. */
-                raxInsert(consumer->pel,buf,sizeof(buf),nack,NULL);
-                nack->consumer = consumer;
-            }
-            /* Send the reply for this entry. */
-            if (justid) {
-                addReplyStreamID(c,&id);
-            } else {
-                size_t emitted = streamReplyWithRange(c,o->ptr,&id,&id,1,0,
-                                    NULL,NULL,STREAM_RWR_RAWENTRIES,NULL);
-                if (!emitted) addReplyNull(c);
-            }
-            arraylen++;
-
-            /* Propagate this change. */
-            streamPropagateXCLAIM(c,c->argv[1],group,c->argv[2],c->argv[j],nack);
-            propagate_last_id = 0; /* Will be propagated by XCLAIM itself. */
-            server.dirty++;
-        }
-    }
-    if (propagate_last_id) {
-        streamPropagateGroupID(c,c->argv[1],group,c->argv[2]);
-        server.dirty++;
-    }
-    setDeferredArrayLen(c,arraylenptr,arraylen);
-    preventCommandPropagation(c);
-cleanup:
-    if (ids != static_ids) zfree(ids);
-}
-
-/* XAUTOCLAIM <key> <group> <consumer> <min-idle-time> <start> [COUNT <count>] [JUSTID]
- *
- * Gets ownership of one or multiple messages in the Pending Entries List
- * of a given stream consumer group.
- *
- * For each PEL entry, if its idle time greater or equal to <min-idle-time>,
- * then the message new owner becomes the specified <consumer>.
- * If the minimum idle time specified is zero, messages are claimed
- * regardless of their idle time.
- *
- * This command creates the consumer as side effect if it does not yet
- * exists. Moreover the command reset the idle time of the message to 0.
- *
- * The command returns an array of messages that the user
- * successfully claimed, so that the caller is able to understand
- * what messages it is now in charge of. */
-void xautoclaimCommand(client *c) {
-    streamCG *group = NULL;
-    robj *o = lookupKeyRead(c->db,c->argv[1]);
-    long long minidle; /* Minimum idle time argument, in milliseconds. */
-    long count = 100; /* Maximum entries to claim. */
-    streamID startid;
-    int startex;
-    int justid = 0;
-
-    /* Parse idle/start/end/count arguments ASAP if needed, in order to report
-     * syntax errors before any other error. */
-    if (getLongLongFromObjectOrReply(c,c->argv[4],&minidle,"Invalid min-idle-time argument for XAUTOCLAIM") != C_OK)
-        return;
-    if (minidle < 0) minidle = 0;
-
-    if (streamParseIntervalIDOrReply(c,c->argv[5],&startid,&startex,0) != C_OK)
-        return;
-    if (startex && streamIncrID(&startid) != C_OK) {
-        addReplyError(c,"invalid start ID for the interval");
-        return;
-    }
-
-    int j = 6; /* options start at argv[6] */
-    while(j < c->argc) {
-        int moreargs = (c->argc-1) - j; /* Number of additional arguments. */
-        char *opt = c->argv[j]->ptr;
-        if (!strcasecmp(opt,"COUNT") && moreargs) {
-            if (getRangeLongFromObjectOrReply(c,c->argv[j+1],1,LONG_MAX,&count,"COUNT must be > 0") != C_OK)
-                return;
-            j++;
-        } else if (!strcasecmp(opt,"JUSTID")) {
-            justid = 1;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-        j++;
-    }
-
-    if (o) {
-        if (checkType(c,o,OBJ_STREAM))
-            return; /* Type error. */
-        group = streamLookupCG(o->ptr,c->argv[2]->ptr);
-    }
-
-    /* No key or group? Send an error given that the group creation
-     * is mandatory. */
-    if (o == NULL || group == NULL) {
-        addReplyErrorFormat(c,"-NOGROUP No such key '%s' or consumer group '%s'",
-                            (char*)c->argv[1]->ptr,
-                            (char*)c->argv[2]->ptr);
-        return;
-    }
-
-    /* Do the actual claiming. */
-    streamConsumer *consumer = NULL;
-    long long attempts = count*10;
-
-    addReplyArrayLen(c, 2);
-    void *endidptr = addReplyDeferredLen(c);
-    void *arraylenptr = addReplyDeferredLen(c);
-
-    unsigned char startkey[sizeof(streamID)];
-    streamEncodeID(startkey,&startid);
-    raxIterator ri;
-    raxStart(&ri,group->pel);
-    raxSeek(&ri,">=",startkey,sizeof(startkey));
-    size_t arraylen = 0;
-    mstime_t now = mstime();
-    while (attempts-- && count && raxNext(&ri)) {
-        streamNACK *nack = ri.data;
-
-        if (minidle) {
-            mstime_t this_idle = now - nack->delivery_time;
-            if (this_idle < minidle)
-                continue;
-        }
-
-        streamID id;
-        streamDecodeID(ri.key, &id);
-
-        if (consumer == NULL)
-            consumer = streamLookupConsumer(group,c->argv[3]->ptr,SLC_NONE,NULL);
-        if (nack->consumer != consumer) {
-            /* Remove the entry from the old consumer.
-             * Note that nack->consumer is NULL if we created the
-             * NACK above because of the FORCE option. */
-            if (nack->consumer)
-                raxRemove(nack->consumer->pel,ri.key,ri.key_len,NULL);
-        }
-
-        /* Update the consumer and idle time. */
-        nack->delivery_time = now;
-        /* Increment the delivery attempts counter unless JUSTID option provided */
-        if (!justid)
-            nack->delivery_count++;
-
-        if (nack->consumer != consumer) {
-            /* Add the entry in the new consumer local PEL. */
-            raxInsert(consumer->pel,ri.key,ri.key_len,nack,NULL);
-            nack->consumer = consumer;
-        }
-
-        /* Send the reply for this entry. */
-        if (justid) {
-            addReplyStreamID(c,&id);
-        } else {
-            size_t emitted =
-                streamReplyWithRange(c,o->ptr,&id,&id,1,0,NULL,NULL,
-                                     STREAM_RWR_RAWENTRIES,NULL);
-            if (!emitted)
-                addReplyNull(c);
-        }
-        arraylen++;
-        count--;
-
-        /* Propagate this change. */
-        robj *idstr = createObjectFromStreamID(&id);
-        streamPropagateXCLAIM(c,c->argv[1],group,c->argv[2],idstr,nack);
-        decrRefCount(idstr);
-        server.dirty++;
-    }
-
-    /* We need to return the next entry as a cursor for the next XAUTOCLAIM call */
-    raxNext(&ri);
-
-    streamID endid;
-    if (raxEOF(&ri)) {
-        endid.ms = endid.seq = 0;
-    } else {
-        streamDecodeID(ri.key, &endid);
-    }
-    raxStop(&ri);
-
-    setDeferredArrayLen(c,arraylenptr,arraylen);
-    setDeferredReplyStreamID(c,endidptr,&endid);
-
-    preventCommandPropagation(c);
-}
-
-/* XDEL <key> [<ID1> <ID2> ... <IDN>]
- *
- * Removes the specified entries from the stream. Returns the number
- * of items actually deleted, that may be different from the number
- * of IDs passed in case certain IDs do not exist. */
-void xdelCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL
-        || checkType(c,o,OBJ_STREAM)) return;
-    stream *s = o->ptr;
-
-    /* We need to sanity check the IDs passed to start. Even if not
-     * a big issue, it is not great that the command is only partially
-     * executed because at some point an invalid ID is parsed. */
-    streamID static_ids[STREAMID_STATIC_VECTOR_LEN];
-    streamID *ids = static_ids;
-    int id_count = c->argc-2;
-    if (id_count > STREAMID_STATIC_VECTOR_LEN)
-        ids = zmalloc(sizeof(streamID)*id_count);
-    for (int j = 2; j < c->argc; j++) {
-        if (streamParseStrictIDOrReply(c,c->argv[j],&ids[j-2],0) != C_OK) goto cleanup;
-    }
-
-    /* Actually apply the command. */
-    int deleted = 0;
-    for (int j = 2; j < c->argc; j++) {
-        deleted += streamDeleteItem(s,&ids[j-2]);
-    }
-
-    /* Propagate the write if needed. */
-    if (deleted) {
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_STREAM,"xdel",c->argv[1],c->db->id);
-        server.dirty += deleted;
-    }
-    addReplyLongLong(c,deleted);
-cleanup:
-    if (ids != static_ids) zfree(ids);
-}
-
-/* General form: XTRIM <key> [... options ...]
- *
- * List of options:
- *
- * Trim strategies:
- *
- * MAXLEN [~|=] <count>     -- Trim so that the stream will be capped at
- *                             the specified length. Use ~ before the
- *                             count in order to demand approximated trimming
- *                             (like XADD MAXLEN option).
- * MINID [~|=] <id>         -- Trim so that the stream will not contain entries
- *                             with IDs smaller than 'id'. Use ~ before the
- *                             count in order to demand approximated trimming
- *                             (like XADD MINID option).
- *
- * Other options:
- *
- * LIMIT <entries>          -- The maximum number of entries to trim.
- *                             0 means unlimited. Unless specified, it is set
- *                             to a default of 100*server.stream_node_max_entries,
- *                             and that's in order to keep the trimming time sane.
- *                             Has meaning only if `~` was provided.
- */
-void xtrimCommand(client *c) {
-    robj *o;
-
-    /* Argument parsing. */
-    streamAddTrimArgs parsed_args;
-    if (streamParseAddOrTrimArgsOrReply(c, &parsed_args, 0) < 0)
-        return; /* streamParseAddOrTrimArgsOrReply already replied. */
-
-    /* If the key does not exist, we are ok returning zero, that is, the
-     * number of elements removed from the stream. */
-    if ((o = lookupKeyWriteOrReply(c,c->argv[1],shared.czero)) == NULL
-        || checkType(c,o,OBJ_STREAM)) return;
-    stream *s = o->ptr;
-
-    /* Perform the trimming. */
-    int64_t deleted = streamTrim(s, &parsed_args);
-    if (deleted) {
-        notifyKeyspaceEvent(NOTIFY_STREAM,"xtrim",c->argv[1],c->db->id);
-        if (parsed_args.approx_trim) {
-            /* In case our trimming was limited (by LIMIT or by ~) we must
-             * re-write the relevant trim argument to make sure there will be
-             * no inconsistencies in AOF loading or in the replica.
-             * It's enough to check only args->approx because there is no
-             * way LIMIT is given without the ~ option. */
-            streamRewriteApproxSpecifier(c,parsed_args.trim_strategy_arg_idx-1);
-            streamRewriteTrimArgument(c,s,parsed_args.trim_strategy,parsed_args.trim_strategy_arg_idx);
-        }
-
-        /* Propagate the write. */
-        signalModifiedKey(c, c->db,c->argv[1]);
-        server.dirty += deleted;
-    }
-    addReplyLongLong(c,deleted);
-}
-
-/* Helper function for xinfoCommand.
- * Handles the variants of XINFO STREAM */
-void xinfoReplyWithStreamInfo(client *c, stream *s) {
-    int full = 1;
-    long long count = 10; /* Default COUNT is 10 so we don't block the server */
-    robj **optv = c->argv + 3; /* Options start after XINFO STREAM <key> */
-    int optc = c->argc - 3;
-
-    /* Parse options. */
-    if (optc == 0) {
-        full = 0;
-    } else {
-        /* Valid options are [FULL] or [FULL COUNT <count>] */
-        if (optc != 1 && optc != 3) {
-            addReplySubcommandSyntaxError(c);
-            return;
-        }
-
-        /* First option must be "FULL" */
-        if (strcasecmp(optv[0]->ptr,"full")) {
-            addReplySubcommandSyntaxError(c);
-            return;
-        }
-
-        if (optc == 3) {
-            /* First option must be "FULL" */
-            if (strcasecmp(optv[1]->ptr,"count")) {
-                addReplySubcommandSyntaxError(c);
-                return;
-            }
-            if (getLongLongFromObjectOrReply(c,optv[2],&count,NULL) == C_ERR)
-                return;
-            if (count < 0) count = 10;
-        }
-    }
-
-    addReplyMapLen(c,full ? 6 : 7);
-    addReplyBulkCString(c,"length");
-    addReplyLongLong(c,s->length);
-    addReplyBulkCString(c,"radix-tree-keys");
-    addReplyLongLong(c,raxSize(s->rax));
-    addReplyBulkCString(c,"radix-tree-nodes");
-    addReplyLongLong(c,s->rax->numnodes);
-    addReplyBulkCString(c,"last-generated-id");
-    addReplyStreamID(c,&s->last_id);
-
-    if (!full) {
-        /* XINFO STREAM <key> */
-
-        addReplyBulkCString(c,"groups");
-        addReplyLongLong(c,s->cgroups ? raxSize(s->cgroups) : 0);
-
-        /* To emit the first/last entry we use streamReplyWithRange(). */
-        int emitted;
-        streamID start, end;
-        start.ms = start.seq = 0;
-        end.ms = end.seq = UINT64_MAX;
-        addReplyBulkCString(c,"first-entry");
-        emitted = streamReplyWithRange(c,s,&start,&end,1,0,NULL,NULL,
-                                       STREAM_RWR_RAWENTRIES,NULL);
-        if (!emitted) addReplyNull(c);
-        addReplyBulkCString(c,"last-entry");
-        emitted = streamReplyWithRange(c,s,&start,&end,1,1,NULL,NULL,
-                                       STREAM_RWR_RAWENTRIES,NULL);
-        if (!emitted) addReplyNull(c);
-    } else {
-        /* XINFO STREAM <key> FULL [COUNT <count>] */
-
-        /* Stream entries */
-        addReplyBulkCString(c,"entries");
-        streamReplyWithRange(c,s,NULL,NULL,count,0,NULL,NULL,0,NULL);
-
-        /* Consumer groups */
-        addReplyBulkCString(c,"groups");
-        if (s->cgroups == NULL) {
-            addReplyArrayLen(c,0);
-        } else {
-            addReplyArrayLen(c,raxSize(s->cgroups));
-            raxIterator ri_cgroups;
-            raxStart(&ri_cgroups,s->cgroups);
-            raxSeek(&ri_cgroups,"^",NULL,0);
-            while(raxNext(&ri_cgroups)) {
-                streamCG *cg = ri_cgroups.data;
-                addReplyMapLen(c,5);
-
-                /* Name */
-                addReplyBulkCString(c,"name");
-                addReplyBulkCBuffer(c,ri_cgroups.key,ri_cgroups.key_len);
-
-                /* Last delivered ID */
-                addReplyBulkCString(c,"last-delivered-id");
-                addReplyStreamID(c,&cg->last_id);
-
-                /* Group PEL count */
-                addReplyBulkCString(c,"pel-count");
-                addReplyLongLong(c,raxSize(cg->pel));
-
-                /* Group PEL */
-                addReplyBulkCString(c,"pending");
-                long long arraylen_cg_pel = 0;
-                void *arrayptr_cg_pel = addReplyDeferredLen(c);
-                raxIterator ri_cg_pel;
-                raxStart(&ri_cg_pel,cg->pel);
-                raxSeek(&ri_cg_pel,"^",NULL,0);
-                while(raxNext(&ri_cg_pel) && (!count || arraylen_cg_pel < count)) {
-                    streamNACK *nack = ri_cg_pel.data;
-                    addReplyArrayLen(c,4);
-
-                    /* Entry ID. */
-                    streamID id;
-                    streamDecodeID(ri_cg_pel.key,&id);
-                    addReplyStreamID(c,&id);
-
-                    /* Consumer name. */
-                    serverAssert(nack->consumer); /* assertion for valgrind (avoid NPD) */
-                    addReplyBulkCBuffer(c,nack->consumer->name,
-                                        sdslen(nack->consumer->name));
-
-                    /* Last delivery. */
-                    addReplyLongLong(c,nack->delivery_time);
-
-                    /* Number of deliveries. */
-                    addReplyLongLong(c,nack->delivery_count);
-
-                    arraylen_cg_pel++;
-                }
-                setDeferredArrayLen(c,arrayptr_cg_pel,arraylen_cg_pel);
-                raxStop(&ri_cg_pel);
-
-                /* Consumers */
-                addReplyBulkCString(c,"consumers");
-                addReplyArrayLen(c,raxSize(cg->consumers));
-                raxIterator ri_consumers;
-                raxStart(&ri_consumers,cg->consumers);
-                raxSeek(&ri_consumers,"^",NULL,0);
-                while(raxNext(&ri_consumers)) {
-                    streamConsumer *consumer = ri_consumers.data;
-                    addReplyMapLen(c,4);
-
-                    /* Consumer name */
-                    addReplyBulkCString(c,"name");
-                    addReplyBulkCBuffer(c,consumer->name,sdslen(consumer->name));
-
-                    /* Seen-time */
-                    addReplyBulkCString(c,"seen-time");
-                    addReplyLongLong(c,consumer->seen_time);
-
-                    /* Consumer PEL count */
-                    addReplyBulkCString(c,"pel-count");
-                    addReplyLongLong(c,raxSize(consumer->pel));
-
-                    /* Consumer PEL */
-                    addReplyBulkCString(c,"pending");
-                    long long arraylen_cpel = 0;
-                    void *arrayptr_cpel = addReplyDeferredLen(c);
-                    raxIterator ri_cpel;
-                    raxStart(&ri_cpel,consumer->pel);
-                    raxSeek(&ri_cpel,"^",NULL,0);
-                    while(raxNext(&ri_cpel) && (!count || arraylen_cpel < count)) {
-                        streamNACK *nack = ri_cpel.data;
-                        addReplyArrayLen(c,3);
-
-                        /* Entry ID. */
-                        streamID id;
-                        streamDecodeID(ri_cpel.key,&id);
-                        addReplyStreamID(c,&id);
-
-                        /* Last delivery. */
-                        addReplyLongLong(c,nack->delivery_time);
-
-                        /* Number of deliveries. */
-                        addReplyLongLong(c,nack->delivery_count);
-
-                        arraylen_cpel++;
-                    }
-                    setDeferredArrayLen(c,arrayptr_cpel,arraylen_cpel);
-                    raxStop(&ri_cpel);
-                }
-                raxStop(&ri_consumers);
-            }
-            raxStop(&ri_cgroups);
-        }
-    }
-}
-
-/* XINFO CONSUMERS <key> <group>
- * XINFO GROUPS <key>
- * XINFO STREAM <key> [FULL [COUNT <count>]]
- * XINFO HELP. */
-void xinfoCommand(client *c) {
-    stream *s = NULL;
-    char *opt;
-    robj *key;
-
-    /* HELP is special. Handle it ASAP. */
-    if (!strcasecmp(c->argv[1]->ptr,"HELP")) {
-        const char *help[] = {
-"CONSUMERS <key> <groupname>",
-"    Show consumers of <groupname>.",
-"GROUPS <key>",
-"    Show the stream consumer groups.",
-"STREAM <key> [FULL [COUNT <count>]",
-"    Show information about the stream.",
-NULL
-        };
-        addReplyHelp(c, help);
-        return;
-    } else if (c->argc < 3) {
-        addReplySubcommandSyntaxError(c);
-        return;
-    }
-
-    /* With the exception of HELP handled before any other sub commands, all
-     * the ones are in the form of "<subcommand> <key>". */
-    opt = c->argv[1]->ptr;
-    key = c->argv[2];
-
-    /* Lookup the key now, this is common for all the subcommands but HELP. */
-    robj *o = lookupKeyReadOrReply(c,key,shared.nokeyerr);
-    if (o == NULL || checkType(c,o,OBJ_STREAM)) return;
-    s = o->ptr;
-
-    /* Dispatch the different subcommands. */
-    if (!strcasecmp(opt,"CONSUMERS") && c->argc == 4) {
-        /* XINFO CONSUMERS <key> <group>. */
-        streamCG *cg = streamLookupCG(s,c->argv[3]->ptr);
-        if (cg == NULL) {
-            addReplyErrorFormat(c, "-NOGROUP No such consumer group '%s' "
-                                   "for key name '%s'",
-                                   (char*)c->argv[3]->ptr, (char*)key->ptr);
-            return;
-        }
-
-        addReplyArrayLen(c,raxSize(cg->consumers));
-        raxIterator ri;
-        raxStart(&ri,cg->consumers);
-        raxSeek(&ri,"^",NULL,0);
-        mstime_t now = mstime();
-        while(raxNext(&ri)) {
-            streamConsumer *consumer = ri.data;
-            mstime_t idle = now - consumer->seen_time;
-            if (idle < 0) idle = 0;
-
-            addReplyMapLen(c,3);
-            addReplyBulkCString(c,"name");
-            addReplyBulkCBuffer(c,consumer->name,sdslen(consumer->name));
-            addReplyBulkCString(c,"pending");
-            addReplyLongLong(c,raxSize(consumer->pel));
-            addReplyBulkCString(c,"idle");
-            addReplyLongLong(c,idle);
-        }
-        raxStop(&ri);
-    } else if (!strcasecmp(opt,"GROUPS") && c->argc == 3) {
-        /* XINFO GROUPS <key>. */
-        if (s->cgroups == NULL) {
-            addReplyArrayLen(c,0);
-            return;
-        }
-
-        addReplyArrayLen(c,raxSize(s->cgroups));
-        raxIterator ri;
-        raxStart(&ri,s->cgroups);
-        raxSeek(&ri,"^",NULL,0);
-        while(raxNext(&ri)) {
-            streamCG *cg = ri.data;
-            addReplyMapLen(c,4);
-            addReplyBulkCString(c,"name");
-            addReplyBulkCBuffer(c,ri.key,ri.key_len);
-            addReplyBulkCString(c,"consumers");
-            addReplyLongLong(c,raxSize(cg->consumers));
-            addReplyBulkCString(c,"pending");
-            addReplyLongLong(c,raxSize(cg->pel));
-            addReplyBulkCString(c,"last-delivered-id");
-            addReplyStreamID(c,&cg->last_id);
-        }
-        raxStop(&ri);
-    } else if (!strcasecmp(opt,"STREAM")) {
-        /* XINFO STREAM <key> [FULL [COUNT <count>]]. */
-        xinfoReplyWithStreamInfo(c,s);
-    } else {
-        addReplySubcommandSyntaxError(c);
-    }
-}
-
-/* Validate the integrity stream listpack entries structure. Both in term of a
- * valid listpack, but also that the structure of the entires matches a valid
- * stream. return 1 if valid 0 if not valid. */
-int streamValidateListpackIntegrity(unsigned char *lp, size_t size, int deep) {
-    int valid_record;
-    unsigned char *p, *next;
-
-    /* Since we don't want to run validation of all records twice, we'll
-     * run the listpack validation of just the header and do the rest here. */
-    if (!lpValidateIntegrity(lp, size, 0))
-        return 0;
-
-    /* In non-deep mode we just validated the listpack header (encoded size) */
-    if (!deep) return 1;
-
-    next = p = lpValidateFirst(lp);
-    if (!lpValidateNext(lp, &next, size)) return 0;
-    if (!p) return 0;
-
-    /* entry count */
-    int64_t entry_count = lpGetIntegerIfValid(p, &valid_record);
-    if (!valid_record) return 0;
-    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-    /* deleted */
-    int64_t deleted_count = lpGetIntegerIfValid(p, &valid_record);
-    if (!valid_record) return 0;
-    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-    /* num-of-fields */
-    int64_t master_fields = lpGetIntegerIfValid(p, &valid_record);
-    if (!valid_record) return 0;
-    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-    /* the field names */
-    for (int64_t j = 0; j < master_fields; j++) {
-        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-    }
-
-    /* the zero master entry terminator. */
-    int64_t zero = lpGetIntegerIfValid(p, &valid_record);
-    if (!valid_record || zero != 0) return 0;
-    p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-    entry_count += deleted_count;
-    while (entry_count--) {
-        if (!p) return 0;
-        int64_t fields = master_fields, extra_fields = 3;
-        int64_t flags = lpGetIntegerIfValid(p, &valid_record);
-        if (!valid_record) return 0;
-        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-        /* entry id */
-        lpGetIntegerIfValid(p, &valid_record);
-        if (!valid_record) return 0;
-        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-        lpGetIntegerIfValid(p, &valid_record);
-        if (!valid_record) return 0;
-        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-        if (!(flags & STREAM_ITEM_FLAG_SAMEFIELDS)) {
-            /* num-of-fields */
-            fields = lpGetIntegerIfValid(p, &valid_record);
-            if (!valid_record) return 0;
-            p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-
-            /* the field names */
-            for (int64_t j = 0; j < fields; j++) {
-                p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-            }
-
-            extra_fields += fields + 1;
-        }
-
-        /* the values */
-        for (int64_t j = 0; j < fields; j++) {
-            p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-        }
-
-        /* lp-count */
-        int64_t lp_count = lpGetIntegerIfValid(p, &valid_record);
-        if (!valid_record) return 0;
-        if (lp_count != fields + extra_fields) return 0;
-        p = next; if (!lpValidateNext(lp, &next, size)) return 0;
-    }
-
-    if (next)
-        return 0;
-
-    return 1;
-}
diff --git a/redis-stable/src/t_string.c b/redis-stable/src/t_string.c
deleted file mode 100644
index 587d3aeb..00000000
--- a/redis-stable/src/t_string.c
+++ /dev/null
@@ -1,956 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include <math.h> /* isnan(), isinf() */
-
-/* Forward declarations */
-int getGenericCommand(client *c);
-
-/*-----------------------------------------------------------------------------
- * String Commands
- *----------------------------------------------------------------------------*/
-
-static int checkStringLength(client *c, long long size) {
-    if (!(c->flags & CLIENT_MASTER) && size > server.proto_max_bulk_len) {
-        addReplyError(c,"string exceeds maximum allowed size (proto-max-bulk-len)");
-        return C_ERR;
-    }
-    return C_OK;
-}
-
-/* The setGenericCommand() function implements the SET operation with different
- * options and variants. This function is called in order to implement the
- * following commands: SET, SETEX, PSETEX, SETNX, GETSET.
- *
- * 'flags' changes the behavior of the command (NX, XX or GET, see below).
- *
- * 'expire' represents an expire to set in form of a Redis object as passed
- * by the user. It is interpreted according to the specified 'unit'.
- *
- * 'ok_reply' and 'abort_reply' is what the function will reply to the client
- * if the operation is performed, or when it is not because of NX or
- * XX flags.
- *
- * If ok_reply is NULL "+OK" is used.
- * If abort_reply is NULL, "$-1" is used. */
-
-#define OBJ_NO_FLAGS 0
-#define OBJ_SET_NX (1<<0)          /* Set if key not exists. */
-#define OBJ_SET_XX (1<<1)          /* Set if key exists. */
-#define OBJ_EX (1<<2)              /* Set if time in seconds is given */
-#define OBJ_PX (1<<3)              /* Set if time in ms in given */
-#define OBJ_KEEPTTL (1<<4)         /* Set and keep the ttl */
-#define OBJ_SET_GET (1<<5)         /* Set if want to get key before set */
-#define OBJ_EXAT (1<<6)            /* Set if timestamp in second is given */
-#define OBJ_PXAT (1<<7)            /* Set if timestamp in ms is given */
-#define OBJ_PERSIST (1<<8)         /* Set if we need to remove the ttl */
-
-void setGenericCommand(client *c, int flags, robj *key, robj *val, robj *expire, int unit, robj *ok_reply, robj *abort_reply) {
-    long long milliseconds = 0, when = 0; /* initialized to avoid any harmness warning */
-
-    if (expire) {
-        if (getLongLongFromObjectOrReply(c, expire, &milliseconds, NULL) != C_OK)
-            return;
-        if (milliseconds <= 0 || (unit == UNIT_SECONDS && milliseconds > LLONG_MAX / 1000)) {
-            /* Negative value provided or multiplication is gonna overflow. */
-            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
-            return;
-        }
-        if (unit == UNIT_SECONDS) milliseconds *= 1000;
-        when = milliseconds;
-        if ((flags & OBJ_PX) || (flags & OBJ_EX))
-            when += mstime();
-        if (when <= 0) {
-            /* Overflow detected. */
-            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
-            return;
-        }
-    }
-
-    if ((flags & OBJ_SET_NX && lookupKeyWrite(c->db,key) != NULL) ||
-        (flags & OBJ_SET_XX && lookupKeyWrite(c->db,key) == NULL))
-    {
-        addReply(c, abort_reply ? abort_reply : shared.null[c->resp]);
-        return;
-    }
-
-    if (flags & OBJ_SET_GET) {
-        if (getGenericCommand(c) == C_ERR) return;
-    }
-
-    genericSetKey(c,c->db,key, val,flags & OBJ_KEEPTTL,1);
-    server.dirty++;
-    notifyKeyspaceEvent(NOTIFY_STRING,"set",key,c->db->id);
-    if (expire) {
-        setExpire(c,c->db,key,when);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",key,c->db->id);
-
-        /* Propagate as SET Key Value PXAT millisecond-timestamp if there is EXAT/PXAT or
-         * propagate as SET Key Value PX millisecond if there is EX/PX flag.
-         *
-         * Additionally when we propagate the SET with PX (relative millisecond) we translate
-         * it again to SET with PXAT for the AOF.
-         *
-         * Additional care is required while modifying the argument order. AOF relies on the
-         * exp argument being at index 3. (see feedAppendOnlyFile)
-         * */
-        robj *exp = (flags & OBJ_PXAT) || (flags & OBJ_EXAT) ? shared.pxat : shared.px;
-        robj *millisecondObj = createStringObjectFromLongLong(milliseconds);
-        rewriteClientCommandVector(c,5,shared.set,key,val,exp,millisecondObj);
-        decrRefCount(millisecondObj);
-    }
-    if (!(flags & OBJ_SET_GET)) {
-        addReply(c, ok_reply ? ok_reply : shared.ok);
-    }
-
-    /* Propagate without the GET argument (Isn't needed if we had expire since in that case we completely re-written the command argv) */
-    if ((flags & OBJ_SET_GET) && !expire) {
-        int argc = 0;
-        int j;
-        robj **argv = zmalloc((c->argc-1)*sizeof(robj*));
-        for (j=0; j < c->argc; j++) {
-            char *a = c->argv[j]->ptr;
-            /* Skip GET which may be repeated multiple times. */
-            if (j >= 3 &&
-                (a[0] == 'g' || a[0] == 'G') &&
-                (a[1] == 'e' || a[1] == 'E') &&
-                (a[2] == 't' || a[2] == 'T') && a[3] == '\0')
-                continue;
-            argv[argc++] = c->argv[j];
-            incrRefCount(c->argv[j]);
-        }
-        replaceClientCommandVector(c, argc, argv);
-    }
-}
-
-#define COMMAND_GET 0
-#define COMMAND_SET 1
-/*
- * The parseExtendedStringArgumentsOrReply() function performs the common validation for extended
- * string arguments used in SET and GET command.
- *
- * Get specific commands - PERSIST/DEL
- * Set specific commands - XX/NX/GET
- * Common commands - EX/EXAT/PX/PXAT/KEEPTTL
- *
- * Function takes pointers to client, flags, unit, pointer to pointer of expire obj if needed
- * to be determined and command_type which can be COMMAND_GET or COMMAND_SET.
- *
- * If there are any syntax violations C_ERR is returned else C_OK is returned.
- *
- * Input flags are updated upon parsing the arguments. Unit and expire are updated if there are any
- * EX/EXAT/PX/PXAT arguments. Unit is updated to millisecond if PX/PXAT is set.
- */
-int parseExtendedStringArgumentsOrReply(client *c, int *flags, int *unit, robj **expire, int command_type) {
-
-    int j = command_type == COMMAND_GET ? 2 : 3;
-    for (; j < c->argc; j++) {
-        char *opt = c->argv[j]->ptr;
-        robj *next = (j == c->argc-1) ? NULL : c->argv[j+1];
-
-        if ((opt[0] == 'n' || opt[0] == 'N') &&
-            (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
-            !(*flags & OBJ_SET_XX) && !(*flags & OBJ_SET_GET) && (command_type == COMMAND_SET))
-        {
-            *flags |= OBJ_SET_NX;
-        } else if ((opt[0] == 'x' || opt[0] == 'X') &&
-                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
-                   !(*flags & OBJ_SET_NX) && (command_type == COMMAND_SET))
-        {
-            *flags |= OBJ_SET_XX;
-        } else if ((opt[0] == 'g' || opt[0] == 'G') &&
-                   (opt[1] == 'e' || opt[1] == 'E') &&
-                   (opt[2] == 't' || opt[2] == 'T') && opt[3] == '\0' &&
-                   !(*flags & OBJ_SET_NX) && (command_type == COMMAND_SET))
-        {
-            *flags |= OBJ_SET_GET;
-        } else if (!strcasecmp(opt, "KEEPTTL") && !(*flags & OBJ_PERSIST) &&
-            !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
-            !(*flags & OBJ_PX) && !(*flags & OBJ_PXAT) && (command_type == COMMAND_SET))
-        {
-            *flags |= OBJ_KEEPTTL;
-        } else if (!strcasecmp(opt,"PERSIST") && (command_type == COMMAND_GET) &&
-               !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
-               !(*flags & OBJ_PX) && !(*flags & OBJ_PXAT) &&
-               !(*flags & OBJ_KEEPTTL))
-        {
-            *flags |= OBJ_PERSIST;
-        } else if ((opt[0] == 'e' || opt[0] == 'E') &&
-                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
-                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
-                   !(*flags & OBJ_EXAT) && !(*flags & OBJ_PX) &&
-                   !(*flags & OBJ_PXAT) && next)
-        {
-            *flags |= OBJ_EX;
-            *expire = next;
-            j++;
-        } else if ((opt[0] == 'p' || opt[0] == 'P') &&
-                   (opt[1] == 'x' || opt[1] == 'X') && opt[2] == '\0' &&
-                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
-                   !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
-                   !(*flags & OBJ_PXAT) && next)
-        {
-            *flags |= OBJ_PX;
-            *unit = UNIT_MILLISECONDS;
-            *expire = next;
-            j++;
-        } else if ((opt[0] == 'e' || opt[0] == 'E') &&
-                   (opt[1] == 'x' || opt[1] == 'X') &&
-                   (opt[2] == 'a' || opt[2] == 'A') &&
-                   (opt[3] == 't' || opt[3] == 'T') && opt[4] == '\0' &&
-                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
-                   !(*flags & OBJ_EX) && !(*flags & OBJ_PX) &&
-                   !(*flags & OBJ_PXAT) && next)
-        {
-            *flags |= OBJ_EXAT;
-            *expire = next;
-            j++;
-        } else if ((opt[0] == 'p' || opt[0] == 'P') &&
-                   (opt[1] == 'x' || opt[1] == 'X') &&
-                   (opt[2] == 'a' || opt[2] == 'A') &&
-                   (opt[3] == 't' || opt[3] == 'T') && opt[4] == '\0' &&
-                   !(*flags & OBJ_KEEPTTL) && !(*flags & OBJ_PERSIST) &&
-                   !(*flags & OBJ_EX) && !(*flags & OBJ_EXAT) &&
-                   !(*flags & OBJ_PX) && next)
-        {
-            *flags |= OBJ_PXAT;
-            *unit = UNIT_MILLISECONDS;
-            *expire = next;
-            j++;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return C_ERR;
-        }
-    }
-    return C_OK;
-}
-
-/* SET key value [NX] [XX] [KEEPTTL] [GET] [EX <seconds>] [PX <milliseconds>]
- *     [EXAT <seconds-timestamp>][PXAT <milliseconds-timestamp>] */
-void setCommand(client *c) {
-    robj *expire = NULL;
-    int unit = UNIT_SECONDS;
-    int flags = OBJ_NO_FLAGS;
-
-    if (parseExtendedStringArgumentsOrReply(c,&flags,&unit,&expire,COMMAND_SET) != C_OK) {
-        return;
-    }
-
-    c->argv[2] = tryObjectEncoding(c->argv[2]);
-    setGenericCommand(c,flags,c->argv[1],c->argv[2],expire,unit,NULL,NULL);
-}
-
-void setnxCommand(client *c) {
-    c->argv[2] = tryObjectEncoding(c->argv[2]);
-    setGenericCommand(c,OBJ_SET_NX,c->argv[1],c->argv[2],NULL,0,shared.cone,shared.czero);
-}
-
-void setexCommand(client *c) {
-    c->argv[3] = tryObjectEncoding(c->argv[3]);
-    setGenericCommand(c,OBJ_EX,c->argv[1],c->argv[3],c->argv[2],UNIT_SECONDS,NULL,NULL);
-}
-
-void psetexCommand(client *c) {
-    c->argv[3] = tryObjectEncoding(c->argv[3]);
-    setGenericCommand(c,OBJ_PX,c->argv[1],c->argv[3],c->argv[2],UNIT_MILLISECONDS,NULL,NULL);
-}
-
-int getGenericCommand(client *c) {
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL)
-        return C_OK;
-
-    if (checkType(c,o,OBJ_STRING)) {
-        return C_ERR;
-    }
-
-    addReplyBulk(c,o);
-    return C_OK;
-}
-
-void getCommand(client *c) {
-    getGenericCommand(c);
-}
-
-/*
- * GETEX <key> [PERSIST][EX seconds][PX milliseconds][EXAT seconds-timestamp][PXAT milliseconds-timestamp]
- *
- * The getexCommand() function implements extended options and variants of the GET command. Unlike GET
- * command this command is not read-only.
- *
- * The default behavior when no options are specified is same as GET and does not alter any TTL.
- *
- * Only one of the below options can be used at a given time.
- *
- * 1. PERSIST removes any TTL associated with the key.
- * 2. EX Set expiry TTL in seconds.
- * 3. PX Set expiry TTL in milliseconds.
- * 4. EXAT Same like EX instead of specifying the number of seconds representing the TTL
- *      (time to live), it takes an absolute Unix timestamp
- * 5. PXAT Same like PX instead of specifying the number of milliseconds representing the TTL
- *      (time to live), it takes an absolute Unix timestamp
- *
- * Command would either return the bulk string, error or nil.
- */
-void getexCommand(client *c) {
-    robj *expire = NULL;
-    int unit = UNIT_SECONDS;
-    int flags = OBJ_NO_FLAGS;
-
-    if (parseExtendedStringArgumentsOrReply(c,&flags,&unit,&expire,COMMAND_GET) != C_OK) {
-        return;
-    }
-
-    robj *o;
-
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp])) == NULL)
-        return;
-
-    if (checkType(c,o,OBJ_STRING)) {
-        return;
-    }
-
-    long long milliseconds = 0, when = 0;
-
-    /* Validate the expiration time value first */
-    if (expire) {
-        if (getLongLongFromObjectOrReply(c, expire, &milliseconds, NULL) != C_OK)
-            return;
-        if (milliseconds <= 0 || (unit == UNIT_SECONDS && milliseconds > LLONG_MAX / 1000)) {
-            /* Negative value provided or multiplication is gonna overflow. */
-            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
-            return;
-        }
-        if (unit == UNIT_SECONDS) milliseconds *= 1000;
-        when = milliseconds;
-        if ((flags & OBJ_PX) || (flags & OBJ_EX))
-            when += mstime();
-        if (when <= 0) {
-            /* Overflow detected. */
-            addReplyErrorFormat(c, "invalid expire time in %s", c->cmd->name);
-            return;
-        }
-    }
-
-    /* We need to do this before we expire the key or delete it */
-    addReplyBulk(c,o);
-
-    /* This command is never propagated as is. It is either propagated as PEXPIRE[AT],DEL,UNLINK or PERSIST.
-     * This why it doesn't need special handling in feedAppendOnlyFile to convert relative expire time to absolute one. */
-    if (((flags & OBJ_PXAT) || (flags & OBJ_EXAT)) && checkAlreadyExpired(milliseconds)) {
-        /* When PXAT/EXAT absolute timestamp is specified, there can be a chance that timestamp
-         * has already elapsed so delete the key in that case. */
-        int deleted = server.lazyfree_lazy_expire ? dbAsyncDelete(c->db, c->argv[1]) :
-                      dbSyncDelete(c->db, c->argv[1]);
-        serverAssert(deleted);
-        robj *aux = server.lazyfree_lazy_expire ? shared.unlink : shared.del;
-        rewriteClientCommandVector(c,2,aux,c->argv[1]);
-        signalModifiedKey(c, c->db, c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", c->argv[1], c->db->id);
-        server.dirty++;
-    } else if (expire) {
-        setExpire(c,c->db,c->argv[1],when);
-        /* Propagate */
-        robj *exp = (flags & OBJ_PXAT) || (flags & OBJ_EXAT) ? shared.pexpireat : shared.pexpire;
-        robj* millisecondObj = createStringObjectFromLongLong(milliseconds);
-        rewriteClientCommandVector(c,3,exp,c->argv[1],millisecondObj);
-        decrRefCount(millisecondObj);
-        signalModifiedKey(c, c->db, c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC,"expire",c->argv[1],c->db->id);
-        server.dirty++;
-    } else if (flags & OBJ_PERSIST) {
-        if (removeExpire(c->db, c->argv[1])) {
-            signalModifiedKey(c, c->db, c->argv[1]);
-            rewriteClientCommandVector(c, 2, shared.persist, c->argv[1]);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"persist",c->argv[1],c->db->id);
-            server.dirty++;
-        }
-    }
-}
-
-void getdelCommand(client *c) {
-    if (getGenericCommand(c) == C_ERR) return;
-    int deleted = server.lazyfree_lazy_user_del ? dbAsyncDelete(c->db, c->argv[1]) :
-                  dbSyncDelete(c->db, c->argv[1]);
-    if (deleted) {
-        /* Propagate as DEL/UNLINK command */
-        robj *aux = server.lazyfree_lazy_user_del ? shared.unlink : shared.del;
-        rewriteClientCommandVector(c,2,aux,c->argv[1]);
-        signalModifiedKey(c, c->db, c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_GENERIC, "del", c->argv[1], c->db->id);
-        server.dirty++;
-    }
-}
-
-void getsetCommand(client *c) {
-    if (getGenericCommand(c) == C_ERR) return;
-    c->argv[2] = tryObjectEncoding(c->argv[2]);
-    setKey(c,c->db,c->argv[1],c->argv[2]);
-    notifyKeyspaceEvent(NOTIFY_STRING,"set",c->argv[1],c->db->id);
-    server.dirty++;
-
-    /* Propagate as SET command */
-    rewriteClientCommandArgument(c,0,shared.set);
-}
-
-void setrangeCommand(client *c) {
-    robj *o;
-    long offset;
-    sds value = c->argv[3]->ptr;
-
-    if (getLongFromObjectOrReply(c,c->argv[2],&offset,NULL) != C_OK)
-        return;
-
-    if (offset < 0) {
-        addReplyError(c,"offset is out of range");
-        return;
-    }
-
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (o == NULL) {
-        /* Return 0 when setting nothing on a non-existing string */
-        if (sdslen(value) == 0) {
-            addReply(c,shared.czero);
-            return;
-        }
-
-        /* Return when the resulting string exceeds allowed size */
-        if (checkStringLength(c,offset+sdslen(value)) != C_OK)
-            return;
-
-        o = createObject(OBJ_STRING,sdsnewlen(NULL, offset+sdslen(value)));
-        dbAdd(c->db,c->argv[1],o);
-    } else {
-        size_t olen;
-
-        /* Key exists, check type */
-        if (checkType(c,o,OBJ_STRING))
-            return;
-
-        /* Return existing string length when setting nothing */
-        olen = stringObjectLen(o);
-        if (sdslen(value) == 0) {
-            addReplyLongLong(c,olen);
-            return;
-        }
-
-        /* Return when the resulting string exceeds allowed size */
-        if (checkStringLength(c,offset+sdslen(value)) != C_OK)
-            return;
-
-        /* Create a copy when the object is shared or encoded. */
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-    }
-
-    if (sdslen(value) > 0) {
-        o->ptr = sdsgrowzero(o->ptr,offset+sdslen(value));
-        memcpy((char*)o->ptr+offset,value,sdslen(value));
-        signalModifiedKey(c,c->db,c->argv[1]);
-        notifyKeyspaceEvent(NOTIFY_STRING,
-            "setrange",c->argv[1],c->db->id);
-        server.dirty++;
-    }
-    addReplyLongLong(c,sdslen(o->ptr));
-}
-
-void getrangeCommand(client *c) {
-    robj *o;
-    long long start, end;
-    char *str, llbuf[32];
-    size_t strlen;
-
-    if (getLongLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK)
-        return;
-    if (getLongLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK)
-        return;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptybulk)) == NULL ||
-        checkType(c,o,OBJ_STRING)) return;
-
-    if (o->encoding == OBJ_ENCODING_INT) {
-        str = llbuf;
-        strlen = ll2string(llbuf,sizeof(llbuf),(long)o->ptr);
-    } else {
-        str = o->ptr;
-        strlen = sdslen(str);
-    }
-
-    /* Convert negative indexes */
-    if (start < 0 && end < 0 && start > end) {
-        addReply(c,shared.emptybulk);
-        return;
-    }
-    if (start < 0) start = strlen+start;
-    if (end < 0) end = strlen+end;
-    if (start < 0) start = 0;
-    if (end < 0) end = 0;
-    if ((unsigned long long)end >= strlen) end = strlen-1;
-
-    /* Precondition: end >= 0 && end < strlen, so the only condition where
-     * nothing can be returned is: start > end. */
-    if (start > end || strlen == 0) {
-        addReply(c,shared.emptybulk);
-    } else {
-        addReplyBulkCBuffer(c,(char*)str+start,end-start+1);
-    }
-}
-
-void mgetCommand(client *c) {
-    int j;
-
-    addReplyArrayLen(c,c->argc-1);
-    for (j = 1; j < c->argc; j++) {
-        robj *o = lookupKeyRead(c->db,c->argv[j]);
-        if (o == NULL) {
-            addReplyNull(c);
-        } else {
-            if (o->type != OBJ_STRING) {
-                addReplyNull(c);
-            } else {
-                addReplyBulk(c,o);
-            }
-        }
-    }
-}
-
-void msetGenericCommand(client *c, int nx) {
-    int j;
-
-    if ((c->argc % 2) == 0) {
-        addReplyError(c,"wrong number of arguments for MSET");
-        return;
-    }
-
-    /* Handle the NX flag. The MSETNX semantic is to return zero and don't
-     * set anything if at least one key already exists. */
-    if (nx) {
-        for (j = 1; j < c->argc; j += 2) {
-            if (lookupKeyWrite(c->db,c->argv[j]) != NULL) {
-                addReply(c, shared.czero);
-                return;
-            }
-        }
-    }
-
-    for (j = 1; j < c->argc; j += 2) {
-        c->argv[j+1] = tryObjectEncoding(c->argv[j+1]);
-        setKey(c,c->db,c->argv[j],c->argv[j+1]);
-        notifyKeyspaceEvent(NOTIFY_STRING,"set",c->argv[j],c->db->id);
-    }
-    server.dirty += (c->argc-1)/2;
-    addReply(c, nx ? shared.cone : shared.ok);
-}
-
-void msetCommand(client *c) {
-    msetGenericCommand(c,0);
-}
-
-void msetnxCommand(client *c) {
-    msetGenericCommand(c,1);
-}
-
-void incrDecrCommand(client *c, long long incr) {
-    long long value, oldvalue;
-    robj *o, *new;
-
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (checkType(c,o,OBJ_STRING)) return;
-    if (getLongLongFromObjectOrReply(c,o,&value,NULL) != C_OK) return;
-
-    oldvalue = value;
-    if ((incr < 0 && oldvalue < 0 && incr < (LLONG_MIN-oldvalue)) ||
-        (incr > 0 && oldvalue > 0 && incr > (LLONG_MAX-oldvalue))) {
-        addReplyError(c,"increment or decrement would overflow");
-        return;
-    }
-    value += incr;
-
-    if (o && o->refcount == 1 && o->encoding == OBJ_ENCODING_INT &&
-        (value < 0 || value >= OBJ_SHARED_INTEGERS) &&
-        value >= LONG_MIN && value <= LONG_MAX)
-    {
-        new = o;
-        o->ptr = (void*)((long)value);
-    } else {
-        new = createStringObjectFromLongLongForValue(value);
-        if (o) {
-            dbOverwrite(c->db,c->argv[1],new);
-        } else {
-            dbAdd(c->db,c->argv[1],new);
-        }
-    }
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_STRING,"incrby",c->argv[1],c->db->id);
-    server.dirty++;
-    addReply(c,shared.colon);
-    addReply(c,new);
-    addReply(c,shared.crlf);
-}
-
-void incrCommand(client *c) {
-    incrDecrCommand(c,1);
-}
-
-void decrCommand(client *c) {
-    incrDecrCommand(c,-1);
-}
-
-void incrbyCommand(client *c) {
-    long long incr;
-
-    if (getLongLongFromObjectOrReply(c, c->argv[2], &incr, NULL) != C_OK) return;
-    incrDecrCommand(c,incr);
-}
-
-void decrbyCommand(client *c) {
-    long long incr;
-
-    if (getLongLongFromObjectOrReply(c, c->argv[2], &incr, NULL) != C_OK) return;
-    incrDecrCommand(c,-incr);
-}
-
-void incrbyfloatCommand(client *c) {
-    long double incr, value;
-    robj *o, *new;
-
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (checkType(c,o,OBJ_STRING)) return;
-    if (getLongDoubleFromObjectOrReply(c,o,&value,NULL) != C_OK ||
-        getLongDoubleFromObjectOrReply(c,c->argv[2],&incr,NULL) != C_OK)
-        return;
-
-    value += incr;
-    if (isnan(value) || isinf(value)) {
-        addReplyError(c,"increment would produce NaN or Infinity");
-        return;
-    }
-    new = createStringObjectFromLongDouble(value,1);
-    if (o)
-        dbOverwrite(c->db,c->argv[1],new);
-    else
-        dbAdd(c->db,c->argv[1],new);
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_STRING,"incrbyfloat",c->argv[1],c->db->id);
-    server.dirty++;
-    addReplyBulk(c,new);
-
-    /* Always replicate INCRBYFLOAT as a SET command with the final value
-     * in order to make sure that differences in float precision or formatting
-     * will not create differences in replicas or after an AOF restart. */
-    rewriteClientCommandArgument(c,0,shared.set);
-    rewriteClientCommandArgument(c,2,new);
-    rewriteClientCommandArgument(c,3,shared.keepttl);
-}
-
-void appendCommand(client *c) {
-    size_t totlen;
-    robj *o, *append;
-
-    o = lookupKeyWrite(c->db,c->argv[1]);
-    if (o == NULL) {
-        /* Create the key */
-        c->argv[2] = tryObjectEncoding(c->argv[2]);
-        dbAdd(c->db,c->argv[1],c->argv[2]);
-        incrRefCount(c->argv[2]);
-        totlen = stringObjectLen(c->argv[2]);
-    } else {
-        /* Key exists, check type */
-        if (checkType(c,o,OBJ_STRING))
-            return;
-
-        /* "append" is an argument, so always an sds */
-        append = c->argv[2];
-        totlen = stringObjectLen(o)+sdslen(append->ptr);
-        if (checkStringLength(c,totlen) != C_OK)
-            return;
-
-        /* Append the value */
-        o = dbUnshareStringValue(c->db,c->argv[1],o);
-        o->ptr = sdscatlen(o->ptr,append->ptr,sdslen(append->ptr));
-        totlen = sdslen(o->ptr);
-    }
-    signalModifiedKey(c,c->db,c->argv[1]);
-    notifyKeyspaceEvent(NOTIFY_STRING,"append",c->argv[1],c->db->id);
-    server.dirty++;
-    addReplyLongLong(c,totlen);
-}
-
-void strlenCommand(client *c) {
-    robj *o;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.czero)) == NULL ||
-        checkType(c,o,OBJ_STRING)) return;
-    addReplyLongLong(c,stringObjectLen(o));
-}
-
-
-/* STRALGO -- Implement complex algorithms on strings.
- *
- * STRALGO <algorithm> ... arguments ... */
-void stralgoLCS(client *c);     /* This implements the LCS algorithm. */
-void stralgoCommand(client *c) {
-    /* Select the algorithm. */
-    if (!strcasecmp(c->argv[1]->ptr,"lcs")) {
-        stralgoLCS(c);
-    } else {
-        addReplyErrorObject(c,shared.syntaxerr);
-    }
-}
-
-/* STRALGO <algo> [IDX] [LEN] [MINMATCHLEN <len>] [WITHMATCHLEN]
- *     STRINGS <string> <string> | KEYS <keya> <keyb>
- */
-void stralgoLCS(client *c) {
-    uint32_t i, j;
-    long long minmatchlen = 0;
-    sds a = NULL, b = NULL;
-    int getlen = 0, getidx = 0, withmatchlen = 0;
-    robj *obja = NULL, *objb = NULL;
-
-    for (j = 2; j < (uint32_t)c->argc; j++) {
-        char *opt = c->argv[j]->ptr;
-        int moreargs = (c->argc-1) - j;
-
-        if (!strcasecmp(opt,"IDX")) {
-            getidx = 1;
-        } else if (!strcasecmp(opt,"LEN")) {
-            getlen = 1;
-        } else if (!strcasecmp(opt,"WITHMATCHLEN")) {
-            withmatchlen = 1;
-        } else if (!strcasecmp(opt,"MINMATCHLEN") && moreargs) {
-            if (getLongLongFromObjectOrReply(c,c->argv[j+1],&minmatchlen,NULL)
-                != C_OK) goto cleanup;
-            if (minmatchlen < 0) minmatchlen = 0;
-            j++;
-        } else if (!strcasecmp(opt,"STRINGS") && moreargs > 1) {
-            if (a != NULL) {
-                addReplyError(c,"Either use STRINGS or KEYS");
-                goto cleanup;
-            }
-            a = c->argv[j+1]->ptr;
-            b = c->argv[j+2]->ptr;
-            j += 2;
-        } else if (!strcasecmp(opt,"KEYS") && moreargs > 1) {
-            if (a != NULL) {
-                addReplyError(c,"Either use STRINGS or KEYS");
-                goto cleanup;
-            }
-            obja = lookupKeyRead(c->db,c->argv[j+1]);
-            objb = lookupKeyRead(c->db,c->argv[j+2]);
-            if ((obja && obja->type != OBJ_STRING) ||
-                (objb && objb->type != OBJ_STRING))
-            {
-                addReplyError(c,
-                    "The specified keys must contain string values");
-                /* Don't cleanup the objects, we need to do that
-                 * only after calling getDecodedObject(). */
-                obja = NULL;
-                objb = NULL;
-                goto cleanup;
-            }
-            obja = obja ? getDecodedObject(obja) : createStringObject("",0);
-            objb = objb ? getDecodedObject(objb) : createStringObject("",0);
-            a = obja->ptr;
-            b = objb->ptr;
-            j += 2;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            goto cleanup;
-        }
-    }
-
-    /* Complain if the user passed ambiguous parameters. */
-    if (a == NULL) {
-        addReplyError(c,"Please specify two strings: "
-                        "STRINGS or KEYS options are mandatory");
-        goto cleanup;
-    } else if (getlen && getidx) {
-        addReplyError(c,
-            "If you want both the length and indexes, please "
-            "just use IDX.");
-        goto cleanup;
-    }
-
-    /* Detect string truncation or later overflows. */
-    if (sdslen(a) >= UINT32_MAX-1 || sdslen(b) >= UINT32_MAX-1) {
-        addReplyError(c, "String too long for LCS");
-        goto cleanup;
-    }
-
-    /* Compute the LCS using the vanilla dynamic programming technique of
-     * building a table of LCS(x,y) substrings. */
-    uint32_t alen = sdslen(a);
-    uint32_t blen = sdslen(b);
-
-    /* Setup an uint32_t array to store at LCS[i,j] the length of the
-     * LCS A0..i-1, B0..j-1. Note that we have a linear array here, so
-     * we index it as LCS[j+(blen+1)*j] */
-    #define LCS(A,B) lcs[(B)+((A)*(blen+1))]
-
-    /* Try to allocate the LCS table, and abort on overflow or insufficient memory. */
-    unsigned long long lcssize = (unsigned long long)(alen+1)*(blen+1); /* Can't overflow due to the size limits above. */
-    unsigned long long lcsalloc = lcssize * sizeof(uint32_t);
-    uint32_t *lcs = NULL;
-    if (lcsalloc < SIZE_MAX && lcsalloc / lcssize == sizeof(uint32_t))
-        lcs = ztrymalloc(lcsalloc);
-    if (!lcs) {
-        addReplyError(c, "Insufficient memory");
-        goto cleanup;
-    }
-
-    /* Start building the LCS table. */
-    for (uint32_t i = 0; i <= alen; i++) {
-        for (uint32_t j = 0; j <= blen; j++) {
-            if (i == 0 || j == 0) {
-                /* If one substring has length of zero, the
-                 * LCS length is zero. */
-                LCS(i,j) = 0;
-            } else if (a[i-1] == b[j-1]) {
-                /* The len LCS (and the LCS itself) of two
-                 * sequences with the same final character, is the
-                 * LCS of the two sequences without the last char
-                 * plus that last char. */
-                LCS(i,j) = LCS(i-1,j-1)+1;
-            } else {
-                /* If the last character is different, take the longest
-                 * between the LCS of the first string and the second
-                 * minus the last char, and the reverse. */
-                uint32_t lcs1 = LCS(i-1,j);
-                uint32_t lcs2 = LCS(i,j-1);
-                LCS(i,j) = lcs1 > lcs2 ? lcs1 : lcs2;
-            }
-        }
-    }
-
-    /* Store the actual LCS string in "result" if needed. We create
-     * it backward, but the length is already known, we store it into idx. */
-    uint32_t idx = LCS(alen,blen);
-    sds result = NULL;        /* Resulting LCS string. */
-    void *arraylenptr = NULL; /* Deffered length of the array for IDX. */
-    uint32_t arange_start = alen, /* alen signals that values are not set. */
-             arange_end = 0,
-             brange_start = 0,
-             brange_end = 0;
-
-    /* Do we need to compute the actual LCS string? Allocate it in that case. */
-    int computelcs = getidx || !getlen;
-    if (computelcs) result = sdsnewlen(SDS_NOINIT,idx);
-
-    /* Start with a deferred array if we have to emit the ranges. */
-    uint32_t arraylen = 0;  /* Number of ranges emitted in the array. */
-    if (getidx) {
-        addReplyMapLen(c,2);
-        addReplyBulkCString(c,"matches");
-        arraylenptr = addReplyDeferredLen(c);
-    }
-
-    i = alen, j = blen;
-    while (computelcs && i > 0 && j > 0) {
-        int emit_range = 0;
-        if (a[i-1] == b[j-1]) {
-            /* If there is a match, store the character and reduce
-             * the indexes to look for a new match. */
-            result[idx-1] = a[i-1];
-
-            /* Track the current range. */
-            if (arange_start == alen) {
-                arange_start = i-1;
-                arange_end = i-1;
-                brange_start = j-1;
-                brange_end = j-1;
-            } else {
-                /* Let's see if we can extend the range backward since
-                 * it is contiguous. */
-                if (arange_start == i && brange_start == j) {
-                    arange_start--;
-                    brange_start--;
-                } else {
-                    emit_range = 1;
-                }
-            }
-            /* Emit the range if we matched with the first byte of
-             * one of the two strings. We'll exit the loop ASAP. */
-            if (arange_start == 0 || brange_start == 0) emit_range = 1;
-            idx--; i--; j--;
-        } else {
-            /* Otherwise reduce i and j depending on the largest
-             * LCS between, to understand what direction we need to go. */
-            uint32_t lcs1 = LCS(i-1,j);
-            uint32_t lcs2 = LCS(i,j-1);
-            if (lcs1 > lcs2)
-                i--;
-            else
-                j--;
-            if (arange_start != alen) emit_range = 1;
-        }
-
-        /* Emit the current range if needed. */
-        uint32_t match_len = arange_end - arange_start + 1;
-        if (emit_range) {
-            if (minmatchlen == 0 || match_len >= minmatchlen) {
-                if (arraylenptr) {
-                    addReplyArrayLen(c,2+withmatchlen);
-                    addReplyArrayLen(c,2);
-                    addReplyLongLong(c,arange_start);
-                    addReplyLongLong(c,arange_end);
-                    addReplyArrayLen(c,2);
-                    addReplyLongLong(c,brange_start);
-                    addReplyLongLong(c,brange_end);
-                    if (withmatchlen) addReplyLongLong(c,match_len);
-                    arraylen++;
-                }
-            }
-            arange_start = alen; /* Restart at the next match. */
-        }
-    }
-
-    /* Signal modified key, increment dirty, ... */
-
-    /* Reply depending on the given options. */
-    if (arraylenptr) {
-        addReplyBulkCString(c,"len");
-        addReplyLongLong(c,LCS(alen,blen));
-        setDeferredArrayLen(c,arraylenptr,arraylen);
-    } else if (getlen) {
-        addReplyLongLong(c,LCS(alen,blen));
-    } else {
-        addReplyBulkSds(c,result);
-        result = NULL;
-    }
-
-    /* Cleanup. */
-    sdsfree(result);
-    zfree(lcs);
-
-cleanup:
-    if (obja) decrRefCount(obja);
-    if (objb) decrRefCount(objb);
-    return;
-}
-
diff --git a/redis-stable/src/t_zset.c b/redis-stable/src/t_zset.c
deleted file mode 100644
index 2abc1b49..00000000
--- a/redis-stable/src/t_zset.c
+++ /dev/null
@@ -1,4233 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/*-----------------------------------------------------------------------------
- * Sorted set API
- *----------------------------------------------------------------------------*/
-
-/* ZSETs are ordered sets using two data structures to hold the same elements
- * in order to get O(log(N)) INSERT and REMOVE operations into a sorted
- * data structure.
- *
- * The elements are added to a hash table mapping Redis objects to scores.
- * At the same time the elements are added to a skip list mapping scores
- * to Redis objects (so objects are sorted by scores in this "view").
- *
- * Note that the SDS string representing the element is the same in both
- * the hash table and skiplist in order to save memory. What we do in order
- * to manage the shared SDS string more easily is to free the SDS string
- * only in zslFreeNode(). The dictionary has no value free method set.
- * So we should always remove an element from the dictionary, and later from
- * the skiplist.
- *
- * This skiplist implementation is almost a C translation of the original
- * algorithm described by William Pugh in "Skip Lists: A Probabilistic
- * Alternative to Balanced Trees", modified in three ways:
- * a) this implementation allows for repeated scores.
- * b) the comparison is not just by key (our 'score') but by satellite data.
- * c) there is a back pointer, so it's a doubly linked list with the back
- * pointers being only at "level 1". This allows to traverse the list
- * from tail to head, useful for ZREVRANGE. */
-
-#include "server.h"
-#include <math.h>
-
-/*-----------------------------------------------------------------------------
- * Skiplist implementation of the low level API
- *----------------------------------------------------------------------------*/
-
-int zslLexValueGteMin(sds value, zlexrangespec *spec);
-int zslLexValueLteMax(sds value, zlexrangespec *spec);
-
-/* Create a skiplist node with the specified number of levels.
- * The SDS string 'ele' is referenced by the node after the call. */
-zskiplistNode *zslCreateNode(int level, double score, sds ele) {
-    zskiplistNode *zn =
-        zmalloc(sizeof(*zn)+level*sizeof(struct zskiplistLevel));
-    zn->score = score;
-    zn->ele = ele;
-    return zn;
-}
-
-/* Create a new skiplist. */
-zskiplist *zslCreate(void) {
-    int j;
-    zskiplist *zsl;
-
-    zsl = zmalloc(sizeof(*zsl));
-    zsl->level = 1;
-    zsl->length = 0;
-    zsl->header = zslCreateNode(ZSKIPLIST_MAXLEVEL,0,NULL);
-    for (j = 0; j < ZSKIPLIST_MAXLEVEL; j++) {
-        zsl->header->level[j].forward = NULL;
-        zsl->header->level[j].span = 0;
-    }
-    zsl->header->backward = NULL;
-    zsl->tail = NULL;
-    return zsl;
-}
-
-/* Free the specified skiplist node. The referenced SDS string representation
- * of the element is freed too, unless node->ele is set to NULL before calling
- * this function. */
-void zslFreeNode(zskiplistNode *node) {
-    sdsfree(node->ele);
-    zfree(node);
-}
-
-/* Free a whole skiplist. */
-void zslFree(zskiplist *zsl) {
-    zskiplistNode *node = zsl->header->level[0].forward, *next;
-
-    zfree(zsl->header);
-    while(node) {
-        next = node->level[0].forward;
-        zslFreeNode(node);
-        node = next;
-    }
-    zfree(zsl);
-}
-
-/* Returns a random level for the new skiplist node we are going to create.
- * The return value of this function is between 1 and ZSKIPLIST_MAXLEVEL
- * (both inclusive), with a powerlaw-alike distribution where higher
- * levels are less likely to be returned. */
-int zslRandomLevel(void) {
-    int level = 1;
-    while ((random()&0xFFFF) < (ZSKIPLIST_P * 0xFFFF))
-        level += 1;
-    return (level<ZSKIPLIST_MAXLEVEL) ? level : ZSKIPLIST_MAXLEVEL;
-}
-
-/* Insert a new node in the skiplist. Assumes the element does not already
- * exist (up to the caller to enforce that). The skiplist takes ownership
- * of the passed SDS string 'ele'. */
-zskiplistNode *zslInsert(zskiplist *zsl, double score, sds ele) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    unsigned int rank[ZSKIPLIST_MAXLEVEL];
-    int i, level;
-
-    serverAssert(!isnan(score));
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        /* store rank that is crossed to reach the insert position */
-        rank[i] = i == (zsl->level-1) ? 0 : rank[i+1];
-        while (x->level[i].forward &&
-                (x->level[i].forward->score < score ||
-                    (x->level[i].forward->score == score &&
-                    sdscmp(x->level[i].forward->ele,ele) < 0)))
-        {
-            rank[i] += x->level[i].span;
-            x = x->level[i].forward;
-        }
-        update[i] = x;
-    }
-    /* we assume the element is not already inside, since we allow duplicated
-     * scores, reinserting the same element should never happen since the
-     * caller of zslInsert() should test in the hash table if the element is
-     * already inside or not. */
-    level = zslRandomLevel();
-    if (level > zsl->level) {
-        for (i = zsl->level; i < level; i++) {
-            rank[i] = 0;
-            update[i] = zsl->header;
-            update[i]->level[i].span = zsl->length;
-        }
-        zsl->level = level;
-    }
-    x = zslCreateNode(level,score,ele);
-    for (i = 0; i < level; i++) {
-        x->level[i].forward = update[i]->level[i].forward;
-        update[i]->level[i].forward = x;
-
-        /* update span covered by update[i] as x is inserted here */
-        x->level[i].span = update[i]->level[i].span - (rank[0] - rank[i]);
-        update[i]->level[i].span = (rank[0] - rank[i]) + 1;
-    }
-
-    /* increment span for untouched levels */
-    for (i = level; i < zsl->level; i++) {
-        update[i]->level[i].span++;
-    }
-
-    x->backward = (update[0] == zsl->header) ? NULL : update[0];
-    if (x->level[0].forward)
-        x->level[0].forward->backward = x;
-    else
-        zsl->tail = x;
-    zsl->length++;
-    return x;
-}
-
-/* Internal function used by zslDelete, zslDeleteRangeByScore and
- * zslDeleteRangeByRank. */
-void zslDeleteNode(zskiplist *zsl, zskiplistNode *x, zskiplistNode **update) {
-    int i;
-    for (i = 0; i < zsl->level; i++) {
-        if (update[i]->level[i].forward == x) {
-            update[i]->level[i].span += x->level[i].span - 1;
-            update[i]->level[i].forward = x->level[i].forward;
-        } else {
-            update[i]->level[i].span -= 1;
-        }
-    }
-    if (x->level[0].forward) {
-        x->level[0].forward->backward = x->backward;
-    } else {
-        zsl->tail = x->backward;
-    }
-    while(zsl->level > 1 && zsl->header->level[zsl->level-1].forward == NULL)
-        zsl->level--;
-    zsl->length--;
-}
-
-/* Delete an element with matching score/element from the skiplist.
- * The function returns 1 if the node was found and deleted, otherwise
- * 0 is returned.
- *
- * If 'node' is NULL the deleted node is freed by zslFreeNode(), otherwise
- * it is not freed (but just unlinked) and *node is set to the node pointer,
- * so that it is possible for the caller to reuse the node (including the
- * referenced SDS string at node->ele). */
-int zslDelete(zskiplist *zsl, double score, sds ele, zskiplistNode **node) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    int i;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-                (x->level[i].forward->score < score ||
-                    (x->level[i].forward->score == score &&
-                     sdscmp(x->level[i].forward->ele,ele) < 0)))
-        {
-            x = x->level[i].forward;
-        }
-        update[i] = x;
-    }
-    /* We may have multiple elements with the same score, what we need
-     * is to find the element with both the right score and object. */
-    x = x->level[0].forward;
-    if (x && score == x->score && sdscmp(x->ele,ele) == 0) {
-        zslDeleteNode(zsl, x, update);
-        if (!node)
-            zslFreeNode(x);
-        else
-            *node = x;
-        return 1;
-    }
-    return 0; /* not found */
-}
-
-/* Update the score of an element inside the sorted set skiplist.
- * Note that the element must exist and must match 'score'.
- * This function does not update the score in the hash table side, the
- * caller should take care of it.
- *
- * Note that this function attempts to just update the node, in case after
- * the score update, the node would be exactly at the same position.
- * Otherwise the skiplist is modified by removing and re-adding a new
- * element, which is more costly.
- *
- * The function returns the updated element skiplist node pointer. */
-zskiplistNode *zslUpdateScore(zskiplist *zsl, double curscore, sds ele, double newscore) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    int i;
-
-    /* We need to seek to element to update to start: this is useful anyway,
-     * we'll have to update or remove it. */
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-                (x->level[i].forward->score < curscore ||
-                    (x->level[i].forward->score == curscore &&
-                     sdscmp(x->level[i].forward->ele,ele) < 0)))
-        {
-            x = x->level[i].forward;
-        }
-        update[i] = x;
-    }
-
-    /* Jump to our element: note that this function assumes that the
-     * element with the matching score exists. */
-    x = x->level[0].forward;
-    serverAssert(x && curscore == x->score && sdscmp(x->ele,ele) == 0);
-
-    /* If the node, after the score update, would be still exactly
-     * at the same position, we can just update the score without
-     * actually removing and re-inserting the element in the skiplist. */
-    if ((x->backward == NULL || x->backward->score < newscore) &&
-        (x->level[0].forward == NULL || x->level[0].forward->score > newscore))
-    {
-        x->score = newscore;
-        return x;
-    }
-
-    /* No way to reuse the old node: we need to remove and insert a new
-     * one at a different place. */
-    zslDeleteNode(zsl, x, update);
-    zskiplistNode *newnode = zslInsert(zsl,newscore,x->ele);
-    /* We reused the old node x->ele SDS string, free the node now
-     * since zslInsert created a new one. */
-    x->ele = NULL;
-    zslFreeNode(x);
-    return newnode;
-}
-
-int zslValueGteMin(double value, zrangespec *spec) {
-    return spec->minex ? (value > spec->min) : (value >= spec->min);
-}
-
-int zslValueLteMax(double value, zrangespec *spec) {
-    return spec->maxex ? (value < spec->max) : (value <= spec->max);
-}
-
-/* Returns if there is a part of the zset is in range. */
-int zslIsInRange(zskiplist *zsl, zrangespec *range) {
-    zskiplistNode *x;
-
-    /* Test for ranges that will always be empty. */
-    if (range->min > range->max ||
-            (range->min == range->max && (range->minex || range->maxex)))
-        return 0;
-    x = zsl->tail;
-    if (x == NULL || !zslValueGteMin(x->score,range))
-        return 0;
-    x = zsl->header->level[0].forward;
-    if (x == NULL || !zslValueLteMax(x->score,range))
-        return 0;
-    return 1;
-}
-
-/* Find the first node that is contained in the specified range.
- * Returns NULL when no element is contained in the range. */
-zskiplistNode *zslFirstInRange(zskiplist *zsl, zrangespec *range) {
-    zskiplistNode *x;
-    int i;
-
-    /* If everything is out of range, return early. */
-    if (!zslIsInRange(zsl,range)) return NULL;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        /* Go forward while *OUT* of range. */
-        while (x->level[i].forward &&
-            !zslValueGteMin(x->level[i].forward->score,range))
-                x = x->level[i].forward;
-    }
-
-    /* This is an inner range, so the next node cannot be NULL. */
-    x = x->level[0].forward;
-    serverAssert(x != NULL);
-
-    /* Check if score <= max. */
-    if (!zslValueLteMax(x->score,range)) return NULL;
-    return x;
-}
-
-/* Find the last node that is contained in the specified range.
- * Returns NULL when no element is contained in the range. */
-zskiplistNode *zslLastInRange(zskiplist *zsl, zrangespec *range) {
-    zskiplistNode *x;
-    int i;
-
-    /* If everything is out of range, return early. */
-    if (!zslIsInRange(zsl,range)) return NULL;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        /* Go forward while *IN* range. */
-        while (x->level[i].forward &&
-            zslValueLteMax(x->level[i].forward->score,range))
-                x = x->level[i].forward;
-    }
-
-    /* This is an inner range, so this node cannot be NULL. */
-    serverAssert(x != NULL);
-
-    /* Check if score >= min. */
-    if (!zslValueGteMin(x->score,range)) return NULL;
-    return x;
-}
-
-/* Delete all the elements with score between min and max from the skiplist.
- * Both min and max can be inclusive or exclusive (see range->minex and
- * range->maxex). When inclusive a score >= min && score <= max is deleted.
- * Note that this function takes the reference to the hash table view of the
- * sorted set, in order to remove the elements from the hash table too. */
-unsigned long zslDeleteRangeByScore(zskiplist *zsl, zrangespec *range, dict *dict) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    unsigned long removed = 0;
-    int i;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-            !zslValueGteMin(x->level[i].forward->score, range))
-                x = x->level[i].forward;
-        update[i] = x;
-    }
-
-    /* Current node is the last with score < or <= min. */
-    x = x->level[0].forward;
-
-    /* Delete nodes while in range. */
-    while (x && zslValueLteMax(x->score, range)) {
-        zskiplistNode *next = x->level[0].forward;
-        zslDeleteNode(zsl,x,update);
-        dictDelete(dict,x->ele);
-        zslFreeNode(x); /* Here is where x->ele is actually released. */
-        removed++;
-        x = next;
-    }
-    return removed;
-}
-
-unsigned long zslDeleteRangeByLex(zskiplist *zsl, zlexrangespec *range, dict *dict) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    unsigned long removed = 0;
-    int i;
-
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-            !zslLexValueGteMin(x->level[i].forward->ele,range))
-                x = x->level[i].forward;
-        update[i] = x;
-    }
-
-    /* Current node is the last with score < or <= min. */
-    x = x->level[0].forward;
-
-    /* Delete nodes while in range. */
-    while (x && zslLexValueLteMax(x->ele,range)) {
-        zskiplistNode *next = x->level[0].forward;
-        zslDeleteNode(zsl,x,update);
-        dictDelete(dict,x->ele);
-        zslFreeNode(x); /* Here is where x->ele is actually released. */
-        removed++;
-        x = next;
-    }
-    return removed;
-}
-
-/* Delete all the elements with rank between start and end from the skiplist.
- * Start and end are inclusive. Note that start and end need to be 1-based */
-unsigned long zslDeleteRangeByRank(zskiplist *zsl, unsigned int start, unsigned int end, dict *dict) {
-    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
-    unsigned long traversed = 0, removed = 0;
-    int i;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward && (traversed + x->level[i].span) < start) {
-            traversed += x->level[i].span;
-            x = x->level[i].forward;
-        }
-        update[i] = x;
-    }
-
-    traversed++;
-    x = x->level[0].forward;
-    while (x && traversed <= end) {
-        zskiplistNode *next = x->level[0].forward;
-        zslDeleteNode(zsl,x,update);
-        dictDelete(dict,x->ele);
-        zslFreeNode(x);
-        removed++;
-        traversed++;
-        x = next;
-    }
-    return removed;
-}
-
-/* Find the rank for an element by both score and key.
- * Returns 0 when the element cannot be found, rank otherwise.
- * Note that the rank is 1-based due to the span of zsl->header to the
- * first element. */
-unsigned long zslGetRank(zskiplist *zsl, double score, sds ele) {
-    zskiplistNode *x;
-    unsigned long rank = 0;
-    int i;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward &&
-            (x->level[i].forward->score < score ||
-                (x->level[i].forward->score == score &&
-                sdscmp(x->level[i].forward->ele,ele) <= 0))) {
-            rank += x->level[i].span;
-            x = x->level[i].forward;
-        }
-
-        /* x might be equal to zsl->header, so test if obj is non-NULL */
-        if (x->ele && sdscmp(x->ele,ele) == 0) {
-            return rank;
-        }
-    }
-    return 0;
-}
-
-/* Finds an element by its rank. The rank argument needs to be 1-based. */
-zskiplistNode* zslGetElementByRank(zskiplist *zsl, unsigned long rank) {
-    zskiplistNode *x;
-    unsigned long traversed = 0;
-    int i;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        while (x->level[i].forward && (traversed + x->level[i].span) <= rank)
-        {
-            traversed += x->level[i].span;
-            x = x->level[i].forward;
-        }
-        if (traversed == rank) {
-            return x;
-        }
-    }
-    return NULL;
-}
-
-/* Populate the rangespec according to the objects min and max. */
-static int zslParseRange(robj *min, robj *max, zrangespec *spec) {
-    char *eptr;
-    spec->minex = spec->maxex = 0;
-
-    /* Parse the min-max interval. If one of the values is prefixed
-     * by the "(" character, it's considered "open". For instance
-     * ZRANGEBYSCORE zset (1.5 (2.5 will match min < x < max
-     * ZRANGEBYSCORE zset 1.5 2.5 will instead match min <= x <= max */
-    if (min->encoding == OBJ_ENCODING_INT) {
-        spec->min = (long)min->ptr;
-    } else {
-        if (((char*)min->ptr)[0] == '(') {
-            spec->min = strtod((char*)min->ptr+1,&eptr);
-            if (eptr[0] != '\0' || isnan(spec->min)) return C_ERR;
-            spec->minex = 1;
-        } else {
-            spec->min = strtod((char*)min->ptr,&eptr);
-            if (eptr[0] != '\0' || isnan(spec->min)) return C_ERR;
-        }
-    }
-    if (max->encoding == OBJ_ENCODING_INT) {
-        spec->max = (long)max->ptr;
-    } else {
-        if (((char*)max->ptr)[0] == '(') {
-            spec->max = strtod((char*)max->ptr+1,&eptr);
-            if (eptr[0] != '\0' || isnan(spec->max)) return C_ERR;
-            spec->maxex = 1;
-        } else {
-            spec->max = strtod((char*)max->ptr,&eptr);
-            if (eptr[0] != '\0' || isnan(spec->max)) return C_ERR;
-        }
-    }
-
-    return C_OK;
-}
-
-/* ------------------------ Lexicographic ranges ---------------------------- */
-
-/* Parse max or min argument of ZRANGEBYLEX.
-  * (foo means foo (open interval)
-  * [foo means foo (closed interval)
-  * - means the min string possible
-  * + means the max string possible
-  *
-  * If the string is valid the *dest pointer is set to the redis object
-  * that will be used for the comparison, and ex will be set to 0 or 1
-  * respectively if the item is exclusive or inclusive. C_OK will be
-  * returned.
-  *
-  * If the string is not a valid range C_ERR is returned, and the value
-  * of *dest and *ex is undefined. */
-int zslParseLexRangeItem(robj *item, sds *dest, int *ex) {
-    char *c = item->ptr;
-
-    switch(c[0]) {
-    case '+':
-        if (c[1] != '\0') return C_ERR;
-        *ex = 1;
-        *dest = shared.maxstring;
-        return C_OK;
-    case '-':
-        if (c[1] != '\0') return C_ERR;
-        *ex = 1;
-        *dest = shared.minstring;
-        return C_OK;
-    case '(':
-        *ex = 1;
-        *dest = sdsnewlen(c+1,sdslen(c)-1);
-        return C_OK;
-    case '[':
-        *ex = 0;
-        *dest = sdsnewlen(c+1,sdslen(c)-1);
-        return C_OK;
-    default:
-        return C_ERR;
-    }
-}
-
-/* Free a lex range structure, must be called only after zelParseLexRange()
- * populated the structure with success (C_OK returned). */
-void zslFreeLexRange(zlexrangespec *spec) {
-    if (spec->min != shared.minstring &&
-        spec->min != shared.maxstring) sdsfree(spec->min);
-    if (spec->max != shared.minstring &&
-        spec->max != shared.maxstring) sdsfree(spec->max);
-}
-
-/* Populate the lex rangespec according to the objects min and max.
- *
- * Return C_OK on success. On error C_ERR is returned.
- * When OK is returned the structure must be freed with zslFreeLexRange(),
- * otherwise no release is needed. */
-int zslParseLexRange(robj *min, robj *max, zlexrangespec *spec) {
-    /* The range can't be valid if objects are integer encoded.
-     * Every item must start with ( or [. */
-    if (min->encoding == OBJ_ENCODING_INT ||
-        max->encoding == OBJ_ENCODING_INT) return C_ERR;
-
-    spec->min = spec->max = NULL;
-    if (zslParseLexRangeItem(min, &spec->min, &spec->minex) == C_ERR ||
-        zslParseLexRangeItem(max, &spec->max, &spec->maxex) == C_ERR) {
-        zslFreeLexRange(spec);
-        return C_ERR;
-    } else {
-        return C_OK;
-    }
-}
-
-/* This is just a wrapper to sdscmp() that is able to
- * handle shared.minstring and shared.maxstring as the equivalent of
- * -inf and +inf for strings */
-int sdscmplex(sds a, sds b) {
-    if (a == b) return 0;
-    if (a == shared.minstring || b == shared.maxstring) return -1;
-    if (a == shared.maxstring || b == shared.minstring) return 1;
-    return sdscmp(a,b);
-}
-
-int zslLexValueGteMin(sds value, zlexrangespec *spec) {
-    return spec->minex ?
-        (sdscmplex(value,spec->min) > 0) :
-        (sdscmplex(value,spec->min) >= 0);
-}
-
-int zslLexValueLteMax(sds value, zlexrangespec *spec) {
-    return spec->maxex ?
-        (sdscmplex(value,spec->max) < 0) :
-        (sdscmplex(value,spec->max) <= 0);
-}
-
-/* Returns if there is a part of the zset is in the lex range. */
-int zslIsInLexRange(zskiplist *zsl, zlexrangespec *range) {
-    zskiplistNode *x;
-
-    /* Test for ranges that will always be empty. */
-    int cmp = sdscmplex(range->min,range->max);
-    if (cmp > 0 || (cmp == 0 && (range->minex || range->maxex)))
-        return 0;
-    x = zsl->tail;
-    if (x == NULL || !zslLexValueGteMin(x->ele,range))
-        return 0;
-    x = zsl->header->level[0].forward;
-    if (x == NULL || !zslLexValueLteMax(x->ele,range))
-        return 0;
-    return 1;
-}
-
-/* Find the first node that is contained in the specified lex range.
- * Returns NULL when no element is contained in the range. */
-zskiplistNode *zslFirstInLexRange(zskiplist *zsl, zlexrangespec *range) {
-    zskiplistNode *x;
-    int i;
-
-    /* If everything is out of range, return early. */
-    if (!zslIsInLexRange(zsl,range)) return NULL;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        /* Go forward while *OUT* of range. */
-        while (x->level[i].forward &&
-            !zslLexValueGteMin(x->level[i].forward->ele,range))
-                x = x->level[i].forward;
-    }
-
-    /* This is an inner range, so the next node cannot be NULL. */
-    x = x->level[0].forward;
-    serverAssert(x != NULL);
-
-    /* Check if score <= max. */
-    if (!zslLexValueLteMax(x->ele,range)) return NULL;
-    return x;
-}
-
-/* Find the last node that is contained in the specified range.
- * Returns NULL when no element is contained in the range. */
-zskiplistNode *zslLastInLexRange(zskiplist *zsl, zlexrangespec *range) {
-    zskiplistNode *x;
-    int i;
-
-    /* If everything is out of range, return early. */
-    if (!zslIsInLexRange(zsl,range)) return NULL;
-
-    x = zsl->header;
-    for (i = zsl->level-1; i >= 0; i--) {
-        /* Go forward while *IN* range. */
-        while (x->level[i].forward &&
-            zslLexValueLteMax(x->level[i].forward->ele,range))
-                x = x->level[i].forward;
-    }
-
-    /* This is an inner range, so this node cannot be NULL. */
-    serverAssert(x != NULL);
-
-    /* Check if score >= min. */
-    if (!zslLexValueGteMin(x->ele,range)) return NULL;
-    return x;
-}
-
-/*-----------------------------------------------------------------------------
- * Ziplist-backed sorted set API
- *----------------------------------------------------------------------------*/
-
-double zzlStrtod(unsigned char *vstr, unsigned int vlen) {
-    char buf[128];
-    if (vlen > sizeof(buf))
-        vlen = sizeof(buf);
-    memcpy(buf,vstr,vlen);
-    buf[vlen] = '\0';
-    return strtod(buf,NULL);
- }
-
-double zzlGetScore(unsigned char *sptr) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vlong;
-    double score;
-
-    serverAssert(sptr != NULL);
-    serverAssert(ziplistGet(sptr,&vstr,&vlen,&vlong));
-
-    if (vstr) {
-        score = zzlStrtod(vstr,vlen);
-    } else {
-        score = vlong;
-    }
-
-    return score;
-}
-
-/* Return a ziplist element as an SDS string. */
-sds ziplistGetObject(unsigned char *sptr) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vlong;
-
-    serverAssert(sptr != NULL);
-    serverAssert(ziplistGet(sptr,&vstr,&vlen,&vlong));
-
-    if (vstr) {
-        return sdsnewlen((char*)vstr,vlen);
-    } else {
-        return sdsfromlonglong(vlong);
-    }
-}
-
-/* Compare element in sorted set with given element. */
-int zzlCompareElements(unsigned char *eptr, unsigned char *cstr, unsigned int clen) {
-    unsigned char *vstr;
-    unsigned int vlen;
-    long long vlong;
-    unsigned char vbuf[32];
-    int minlen, cmp;
-
-    serverAssert(ziplistGet(eptr,&vstr,&vlen,&vlong));
-    if (vstr == NULL) {
-        /* Store string representation of long long in buf. */
-        vlen = ll2string((char*)vbuf,sizeof(vbuf),vlong);
-        vstr = vbuf;
-    }
-
-    minlen = (vlen < clen) ? vlen : clen;
-    cmp = memcmp(vstr,cstr,minlen);
-    if (cmp == 0) return vlen-clen;
-    return cmp;
-}
-
-unsigned int zzlLength(unsigned char *zl) {
-    return ziplistLen(zl)/2;
-}
-
-/* Move to next entry based on the values in eptr and sptr. Both are set to
- * NULL when there is no next entry. */
-void zzlNext(unsigned char *zl, unsigned char **eptr, unsigned char **sptr) {
-    unsigned char *_eptr, *_sptr;
-    serverAssert(*eptr != NULL && *sptr != NULL);
-
-    _eptr = ziplistNext(zl,*sptr);
-    if (_eptr != NULL) {
-        _sptr = ziplistNext(zl,_eptr);
-        serverAssert(_sptr != NULL);
-    } else {
-        /* No next entry. */
-        _sptr = NULL;
-    }
-
-    *eptr = _eptr;
-    *sptr = _sptr;
-}
-
-/* Move to the previous entry based on the values in eptr and sptr. Both are
- * set to NULL when there is no next entry. */
-void zzlPrev(unsigned char *zl, unsigned char **eptr, unsigned char **sptr) {
-    unsigned char *_eptr, *_sptr;
-    serverAssert(*eptr != NULL && *sptr != NULL);
-
-    _sptr = ziplistPrev(zl,*eptr);
-    if (_sptr != NULL) {
-        _eptr = ziplistPrev(zl,_sptr);
-        serverAssert(_eptr != NULL);
-    } else {
-        /* No previous entry. */
-        _eptr = NULL;
-    }
-
-    *eptr = _eptr;
-    *sptr = _sptr;
-}
-
-/* Returns if there is a part of the zset is in range. Should only be used
- * internally by zzlFirstInRange and zzlLastInRange. */
-int zzlIsInRange(unsigned char *zl, zrangespec *range) {
-    unsigned char *p;
-    double score;
-
-    /* Test for ranges that will always be empty. */
-    if (range->min > range->max ||
-            (range->min == range->max && (range->minex || range->maxex)))
-        return 0;
-
-    p = ziplistIndex(zl,-1); /* Last score. */
-    if (p == NULL) return 0; /* Empty sorted set */
-    score = zzlGetScore(p);
-    if (!zslValueGteMin(score,range))
-        return 0;
-
-    p = ziplistIndex(zl,1); /* First score. */
-    serverAssert(p != NULL);
-    score = zzlGetScore(p);
-    if (!zslValueLteMax(score,range))
-        return 0;
-
-    return 1;
-}
-
-/* Find pointer to the first element contained in the specified range.
- * Returns NULL when no element is contained in the range. */
-unsigned char *zzlFirstInRange(unsigned char *zl, zrangespec *range) {
-    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
-    double score;
-
-    /* If everything is out of range, return early. */
-    if (!zzlIsInRange(zl,range)) return NULL;
-
-    while (eptr != NULL) {
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-
-        score = zzlGetScore(sptr);
-        if (zslValueGteMin(score,range)) {
-            /* Check if score <= max. */
-            if (zslValueLteMax(score,range))
-                return eptr;
-            return NULL;
-        }
-
-        /* Move to next element. */
-        eptr = ziplistNext(zl,sptr);
-    }
-
-    return NULL;
-}
-
-/* Find pointer to the last element contained in the specified range.
- * Returns NULL when no element is contained in the range. */
-unsigned char *zzlLastInRange(unsigned char *zl, zrangespec *range) {
-    unsigned char *eptr = ziplistIndex(zl,-2), *sptr;
-    double score;
-
-    /* If everything is out of range, return early. */
-    if (!zzlIsInRange(zl,range)) return NULL;
-
-    while (eptr != NULL) {
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-
-        score = zzlGetScore(sptr);
-        if (zslValueLteMax(score,range)) {
-            /* Check if score >= min. */
-            if (zslValueGteMin(score,range))
-                return eptr;
-            return NULL;
-        }
-
-        /* Move to previous element by moving to the score of previous element.
-         * When this returns NULL, we know there also is no element. */
-        sptr = ziplistPrev(zl,eptr);
-        if (sptr != NULL)
-            serverAssert((eptr = ziplistPrev(zl,sptr)) != NULL);
-        else
-            eptr = NULL;
-    }
-
-    return NULL;
-}
-
-int zzlLexValueGteMin(unsigned char *p, zlexrangespec *spec) {
-    sds value = ziplistGetObject(p);
-    int res = zslLexValueGteMin(value,spec);
-    sdsfree(value);
-    return res;
-}
-
-int zzlLexValueLteMax(unsigned char *p, zlexrangespec *spec) {
-    sds value = ziplistGetObject(p);
-    int res = zslLexValueLteMax(value,spec);
-    sdsfree(value);
-    return res;
-}
-
-/* Returns if there is a part of the zset is in range. Should only be used
- * internally by zzlFirstInRange and zzlLastInRange. */
-int zzlIsInLexRange(unsigned char *zl, zlexrangespec *range) {
-    unsigned char *p;
-
-    /* Test for ranges that will always be empty. */
-    int cmp = sdscmplex(range->min,range->max);
-    if (cmp > 0 || (cmp == 0 && (range->minex || range->maxex)))
-        return 0;
-
-    p = ziplistIndex(zl,-2); /* Last element. */
-    if (p == NULL) return 0;
-    if (!zzlLexValueGteMin(p,range))
-        return 0;
-
-    p = ziplistIndex(zl,0); /* First element. */
-    serverAssert(p != NULL);
-    if (!zzlLexValueLteMax(p,range))
-        return 0;
-
-    return 1;
-}
-
-/* Find pointer to the first element contained in the specified lex range.
- * Returns NULL when no element is contained in the range. */
-unsigned char *zzlFirstInLexRange(unsigned char *zl, zlexrangespec *range) {
-    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
-
-    /* If everything is out of range, return early. */
-    if (!zzlIsInLexRange(zl,range)) return NULL;
-
-    while (eptr != NULL) {
-        if (zzlLexValueGteMin(eptr,range)) {
-            /* Check if score <= max. */
-            if (zzlLexValueLteMax(eptr,range))
-                return eptr;
-            return NULL;
-        }
-
-        /* Move to next element. */
-        sptr = ziplistNext(zl,eptr); /* This element score. Skip it. */
-        serverAssert(sptr != NULL);
-        eptr = ziplistNext(zl,sptr); /* Next element. */
-    }
-
-    return NULL;
-}
-
-/* Find pointer to the last element contained in the specified lex range.
- * Returns NULL when no element is contained in the range. */
-unsigned char *zzlLastInLexRange(unsigned char *zl, zlexrangespec *range) {
-    unsigned char *eptr = ziplistIndex(zl,-2), *sptr;
-
-    /* If everything is out of range, return early. */
-    if (!zzlIsInLexRange(zl,range)) return NULL;
-
-    while (eptr != NULL) {
-        if (zzlLexValueLteMax(eptr,range)) {
-            /* Check if score >= min. */
-            if (zzlLexValueGteMin(eptr,range))
-                return eptr;
-            return NULL;
-        }
-
-        /* Move to previous element by moving to the score of previous element.
-         * When this returns NULL, we know there also is no element. */
-        sptr = ziplistPrev(zl,eptr);
-        if (sptr != NULL)
-            serverAssert((eptr = ziplistPrev(zl,sptr)) != NULL);
-        else
-            eptr = NULL;
-    }
-
-    return NULL;
-}
-
-unsigned char *zzlFind(unsigned char *zl, sds ele, double *score) {
-    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
-
-    while (eptr != NULL) {
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-
-        if (ziplistCompare(eptr,(unsigned char*)ele,sdslen(ele))) {
-            /* Matching element, pull out score. */
-            if (score != NULL) *score = zzlGetScore(sptr);
-            return eptr;
-        }
-
-        /* Move to next element. */
-        eptr = ziplistNext(zl,sptr);
-    }
-    return NULL;
-}
-
-/* Delete (element,score) pair from ziplist. Use local copy of eptr because we
- * don't want to modify the one given as argument. */
-unsigned char *zzlDelete(unsigned char *zl, unsigned char *eptr) {
-    unsigned char *p = eptr;
-
-    /* TODO: add function to ziplist API to delete N elements from offset. */
-    zl = ziplistDelete(zl,&p);
-    zl = ziplistDelete(zl,&p);
-    return zl;
-}
-
-unsigned char *zzlInsertAt(unsigned char *zl, unsigned char *eptr, sds ele, double score) {
-    unsigned char *sptr;
-    char scorebuf[128];
-    int scorelen;
-    size_t offset;
-
-    scorelen = d2string(scorebuf,sizeof(scorebuf),score);
-    if (eptr == NULL) {
-        zl = ziplistPush(zl,(unsigned char*)ele,sdslen(ele),ZIPLIST_TAIL);
-        zl = ziplistPush(zl,(unsigned char*)scorebuf,scorelen,ZIPLIST_TAIL);
-    } else {
-        /* Keep offset relative to zl, as it might be re-allocated. */
-        offset = eptr-zl;
-        zl = ziplistInsert(zl,eptr,(unsigned char*)ele,sdslen(ele));
-        eptr = zl+offset;
-
-        /* Insert score after the element. */
-        serverAssert((sptr = ziplistNext(zl,eptr)) != NULL);
-        zl = ziplistInsert(zl,sptr,(unsigned char*)scorebuf,scorelen);
-    }
-    return zl;
-}
-
-/* Insert (element,score) pair in ziplist. This function assumes the element is
- * not yet present in the list. */
-unsigned char *zzlInsert(unsigned char *zl, sds ele, double score) {
-    unsigned char *eptr = ziplistIndex(zl,0), *sptr;
-    double s;
-
-    while (eptr != NULL) {
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-        s = zzlGetScore(sptr);
-
-        if (s > score) {
-            /* First element with score larger than score for element to be
-             * inserted. This means we should take its spot in the list to
-             * maintain ordering. */
-            zl = zzlInsertAt(zl,eptr,ele,score);
-            break;
-        } else if (s == score) {
-            /* Ensure lexicographical ordering for elements. */
-            if (zzlCompareElements(eptr,(unsigned char*)ele,sdslen(ele)) > 0) {
-                zl = zzlInsertAt(zl,eptr,ele,score);
-                break;
-            }
-        }
-
-        /* Move to next element. */
-        eptr = ziplistNext(zl,sptr);
-    }
-
-    /* Push on tail of list when it was not yet inserted. */
-    if (eptr == NULL)
-        zl = zzlInsertAt(zl,NULL,ele,score);
-    return zl;
-}
-
-unsigned char *zzlDeleteRangeByScore(unsigned char *zl, zrangespec *range, unsigned long *deleted) {
-    unsigned char *eptr, *sptr;
-    double score;
-    unsigned long num = 0;
-
-    if (deleted != NULL) *deleted = 0;
-
-    eptr = zzlFirstInRange(zl,range);
-    if (eptr == NULL) return zl;
-
-    /* When the tail of the ziplist is deleted, eptr will point to the sentinel
-     * byte and ziplistNext will return NULL. */
-    while ((sptr = ziplistNext(zl,eptr)) != NULL) {
-        score = zzlGetScore(sptr);
-        if (zslValueLteMax(score,range)) {
-            /* Delete both the element and the score. */
-            zl = ziplistDelete(zl,&eptr);
-            zl = ziplistDelete(zl,&eptr);
-            num++;
-        } else {
-            /* No longer in range. */
-            break;
-        }
-    }
-
-    if (deleted != NULL) *deleted = num;
-    return zl;
-}
-
-unsigned char *zzlDeleteRangeByLex(unsigned char *zl, zlexrangespec *range, unsigned long *deleted) {
-    unsigned char *eptr, *sptr;
-    unsigned long num = 0;
-
-    if (deleted != NULL) *deleted = 0;
-
-    eptr = zzlFirstInLexRange(zl,range);
-    if (eptr == NULL) return zl;
-
-    /* When the tail of the ziplist is deleted, eptr will point to the sentinel
-     * byte and ziplistNext will return NULL. */
-    while ((sptr = ziplistNext(zl,eptr)) != NULL) {
-        if (zzlLexValueLteMax(eptr,range)) {
-            /* Delete both the element and the score. */
-            zl = ziplistDelete(zl,&eptr);
-            zl = ziplistDelete(zl,&eptr);
-            num++;
-        } else {
-            /* No longer in range. */
-            break;
-        }
-    }
-
-    if (deleted != NULL) *deleted = num;
-    return zl;
-}
-
-/* Delete all the elements with rank between start and end from the skiplist.
- * Start and end are inclusive. Note that start and end need to be 1-based */
-unsigned char *zzlDeleteRangeByRank(unsigned char *zl, unsigned int start, unsigned int end, unsigned long *deleted) {
-    unsigned int num = (end-start)+1;
-    if (deleted) *deleted = num;
-    zl = ziplistDeleteRange(zl,2*(start-1),2*num);
-    return zl;
-}
-
-/*-----------------------------------------------------------------------------
- * Common sorted set API
- *----------------------------------------------------------------------------*/
-
-unsigned long zsetLength(const robj *zobj) {
-    unsigned long length = 0;
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        length = zzlLength(zobj->ptr);
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        length = ((const zset*)zobj->ptr)->zsl->length;
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-    return length;
-}
-
-void zsetConvert(robj *zobj, int encoding) {
-    zset *zs;
-    zskiplistNode *node, *next;
-    sds ele;
-    double score;
-
-    if (zobj->encoding == encoding) return;
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vlong;
-
-        if (encoding != OBJ_ENCODING_SKIPLIST)
-            serverPanic("Unknown target encoding");
-
-        zs = zmalloc(sizeof(*zs));
-        zs->dict = dictCreate(&zsetDictType,NULL);
-        zs->zsl = zslCreate();
-
-        eptr = ziplistIndex(zl,0);
-        serverAssertWithInfo(NULL,zobj,eptr != NULL);
-        sptr = ziplistNext(zl,eptr);
-        serverAssertWithInfo(NULL,zobj,sptr != NULL);
-
-        while (eptr != NULL) {
-            score = zzlGetScore(sptr);
-            serverAssertWithInfo(NULL,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
-            if (vstr == NULL)
-                ele = sdsfromlonglong(vlong);
-            else
-                ele = sdsnewlen((char*)vstr,vlen);
-
-            node = zslInsert(zs->zsl,score,ele);
-            serverAssert(dictAdd(zs->dict,ele,&node->score) == DICT_OK);
-            zzlNext(zl,&eptr,&sptr);
-        }
-
-        zfree(zobj->ptr);
-        zobj->ptr = zs;
-        zobj->encoding = OBJ_ENCODING_SKIPLIST;
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        unsigned char *zl = ziplistNew();
-
-        if (encoding != OBJ_ENCODING_ZIPLIST)
-            serverPanic("Unknown target encoding");
-
-        /* Approach similar to zslFree(), since we want to free the skiplist at
-         * the same time as creating the ziplist. */
-        zs = zobj->ptr;
-        dictRelease(zs->dict);
-        node = zs->zsl->header->level[0].forward;
-        zfree(zs->zsl->header);
-        zfree(zs->zsl);
-
-        while (node) {
-            zl = zzlInsertAt(zl,NULL,node->ele,node->score);
-            next = node->level[0].forward;
-            zslFreeNode(node);
-            node = next;
-        }
-
-        zfree(zs);
-        zobj->ptr = zl;
-        zobj->encoding = OBJ_ENCODING_ZIPLIST;
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-}
-
-/* Convert the sorted set object into a ziplist if it is not already a ziplist
- * and if the number of elements and the maximum element size and total elements size
- * are within the expected ranges. */
-void zsetConvertToZiplistIfNeeded(robj *zobj, size_t maxelelen, size_t totelelen) {
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) return;
-    zset *zset = zobj->ptr;
-
-    if (zset->zsl->length <= server.zset_max_ziplist_entries &&
-        maxelelen <= server.zset_max_ziplist_value &&
-        ziplistSafeToAdd(NULL, totelelen))
-    {
-        zsetConvert(zobj,OBJ_ENCODING_ZIPLIST);
-    }
-}
-
-/* Return (by reference) the score of the specified member of the sorted set
- * storing it into *score. If the element does not exist C_ERR is returned
- * otherwise C_OK is returned and *score is correctly populated.
- * If 'zobj' or 'member' is NULL, C_ERR is returned. */
-int zsetScore(robj *zobj, sds member, double *score) {
-    if (!zobj || !member) return C_ERR;
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        if (zzlFind(zobj->ptr, member, score) == NULL) return C_ERR;
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        dictEntry *de = dictFind(zs->dict, member);
-        if (de == NULL) return C_ERR;
-        *score = *(double*)dictGetVal(de);
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-    return C_OK;
-}
-
-/* Add a new element or update the score of an existing element in a sorted
- * set, regardless of its encoding.
- *
- * The set of flags change the command behavior. 
- *
- * The input flags are the following:
- *
- * ZADD_INCR: Increment the current element score by 'score' instead of updating
- *            the current element score. If the element does not exist, we
- *            assume 0 as previous score.
- * ZADD_NX:   Perform the operation only if the element does not exist.
- * ZADD_XX:   Perform the operation only if the element already exist.
- * ZADD_GT:   Perform the operation on existing elements only if the new score is 
- *            greater than the current score.
- * ZADD_LT:   Perform the operation on existing elements only if the new score is 
- *            less than the current score.
- *
- * When ZADD_INCR is used, the new score of the element is stored in
- * '*newscore' if 'newscore' is not NULL.
- *
- * The returned flags are the following:
- *
- * ZADD_NAN:     The resulting score is not a number.
- * ZADD_ADDED:   The element was added (not present before the call).
- * ZADD_UPDATED: The element score was updated.
- * ZADD_NOP:     No operation was performed because of NX or XX.
- *
- * Return value:
- *
- * The function returns 1 on success, and sets the appropriate flags
- * ADDED or UPDATED to signal what happened during the operation (note that
- * none could be set if we re-added an element using the same score it used
- * to have, or in the case a zero increment is used).
- *
- * The function returns 0 on error, currently only when the increment
- * produces a NAN condition, or when the 'score' value is NAN since the
- * start.
- *
- * The command as a side effect of adding a new element may convert the sorted
- * set internal encoding from ziplist to hashtable+skiplist.
- *
- * Memory management of 'ele':
- *
- * The function does not take ownership of the 'ele' SDS string, but copies
- * it if needed. */
-int zsetAdd(robj *zobj, double score, sds ele, int in_flags, int *out_flags, double *newscore) {
-    /* Turn options into simple to check vars. */
-    int incr = (in_flags & ZADD_IN_INCR) != 0;
-    int nx = (in_flags & ZADD_IN_NX) != 0;
-    int xx = (in_flags & ZADD_IN_XX) != 0;
-    int gt = (in_flags & ZADD_IN_GT) != 0;
-    int lt = (in_flags & ZADD_IN_LT) != 0;
-    *out_flags = 0; /* We'll return our response flags. */
-    double curscore;
-
-    /* NaN as input is an error regardless of all the other parameters. */
-    if (isnan(score)) {
-        *out_flags = ZADD_OUT_NAN;
-        return 0;
-    }
-
-    /* Update the sorted set according to its encoding. */
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *eptr;
-
-        if ((eptr = zzlFind(zobj->ptr,ele,&curscore)) != NULL) {
-            /* NX? Return, same element already exists. */
-            if (nx) {
-                *out_flags |= ZADD_OUT_NOP;
-                return 1;
-            }
-
-            /* Prepare the score for the increment if needed. */
-            if (incr) {
-                score += curscore;
-                if (isnan(score)) {
-                    *out_flags |= ZADD_OUT_NAN;
-                    return 0;
-                }
-            }
-
-            /* GT/LT? Only update if score is greater/less than current. */
-            if ((lt && score >= curscore) || (gt && score <= curscore)) {
-                *out_flags |= ZADD_OUT_NOP;
-                return 1;
-            }
-
-            if (newscore) *newscore = score;
-
-            /* Remove and re-insert when score changed. */
-            if (score != curscore) {
-                zobj->ptr = zzlDelete(zobj->ptr,eptr);
-                zobj->ptr = zzlInsert(zobj->ptr,ele,score);
-                *out_flags |= ZADD_OUT_UPDATED;
-            }
-            return 1;
-        } else if (!xx) {
-            /* check if the element is too large or the list
-             * becomes too long *before* executing zzlInsert. */
-            if (zzlLength(zobj->ptr)+1 > server.zset_max_ziplist_entries ||
-                sdslen(ele) > server.zset_max_ziplist_value ||
-                !ziplistSafeToAdd(zobj->ptr, sdslen(ele)))
-            {
-                zsetConvert(zobj,OBJ_ENCODING_SKIPLIST);
-            } else {
-                zobj->ptr = zzlInsert(zobj->ptr,ele,score);
-                if (newscore) *newscore = score;
-                *out_flags |= ZADD_OUT_ADDED;
-                return 1;
-            }
-        } else {
-            *out_flags |= ZADD_OUT_NOP;
-            return 1;
-        }
-    }
-
-    /* Note that the above block handling ziplist would have either returned or
-     * converted the key to skiplist. */
-    if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplistNode *znode;
-        dictEntry *de;
-
-        de = dictFind(zs->dict,ele);
-        if (de != NULL) {
-            /* NX? Return, same element already exists. */
-            if (nx) {
-                *out_flags |= ZADD_OUT_NOP;
-                return 1;
-            }
-
-            curscore = *(double*)dictGetVal(de);
-
-            /* Prepare the score for the increment if needed. */
-            if (incr) {
-                score += curscore;
-                if (isnan(score)) {
-                    *out_flags |= ZADD_OUT_NAN;
-                    return 0;
-                }
-            }
-
-            /* GT/LT? Only update if score is greater/less than current. */
-            if ((lt && score >= curscore) || (gt && score <= curscore)) {
-                *out_flags |= ZADD_OUT_NOP;
-                return 1;
-            }
-
-            if (newscore) *newscore = score;
-
-            /* Remove and re-insert when score changes. */
-            if (score != curscore) {
-                znode = zslUpdateScore(zs->zsl,curscore,ele,score);
-                /* Note that we did not removed the original element from
-                 * the hash table representing the sorted set, so we just
-                 * update the score. */
-                dictGetVal(de) = &znode->score; /* Update score ptr. */
-                *out_flags |= ZADD_OUT_UPDATED;
-            }
-            return 1;
-        } else if (!xx) {
-            ele = sdsdup(ele);
-            znode = zslInsert(zs->zsl,score,ele);
-            serverAssert(dictAdd(zs->dict,ele,&znode->score) == DICT_OK);
-            *out_flags |= ZADD_OUT_ADDED;
-            if (newscore) *newscore = score;
-            return 1;
-        } else {
-            *out_flags |= ZADD_OUT_NOP;
-            return 1;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-    return 0; /* Never reached. */
-}
-
-/* Deletes the element 'ele' from the sorted set encoded as a skiplist+dict,
- * returning 1 if the element existed and was deleted, 0 otherwise (the
- * element was not there). It does not resize the dict after deleting the
- * element. */
-static int zsetRemoveFromSkiplist(zset *zs, sds ele) {
-    dictEntry *de;
-    double score;
-
-    de = dictUnlink(zs->dict,ele);
-    if (de != NULL) {
-        /* Get the score in order to delete from the skiplist later. */
-        score = *(double*)dictGetVal(de);
-
-        /* Delete from the hash table and later from the skiplist.
-         * Note that the order is important: deleting from the skiplist
-         * actually releases the SDS string representing the element,
-         * which is shared between the skiplist and the hash table, so
-         * we need to delete from the skiplist as the final step. */
-        dictFreeUnlinkedEntry(zs->dict,de);
-
-        /* Delete from skiplist. */
-        int retval = zslDelete(zs->zsl,score,ele,NULL);
-        serverAssert(retval);
-
-        return 1;
-    }
-
-    return 0;
-}
-
-/* Delete the element 'ele' from the sorted set, returning 1 if the element
- * existed and was deleted, 0 otherwise (the element was not there). */
-int zsetDel(robj *zobj, sds ele) {
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *eptr;
-
-        if ((eptr = zzlFind(zobj->ptr,ele,NULL)) != NULL) {
-            zobj->ptr = zzlDelete(zobj->ptr,eptr);
-            return 1;
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        if (zsetRemoveFromSkiplist(zs, ele)) {
-            if (htNeedsResize(zs->dict)) dictResize(zs->dict);
-            return 1;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-    return 0; /* No such element found. */
-}
-
-/* Given a sorted set object returns the 0-based rank of the object or
- * -1 if the object does not exist.
- *
- * For rank we mean the position of the element in the sorted collection
- * of elements. So the first element has rank 0, the second rank 1, and so
- * forth up to length-1 elements.
- *
- * If 'reverse' is false, the rank is returned considering as first element
- * the one with the lowest score. Otherwise if 'reverse' is non-zero
- * the rank is computed considering as element with rank 0 the one with
- * the highest score. */
-long zsetRank(robj *zobj, sds ele, int reverse) {
-    unsigned long llen;
-    unsigned long rank;
-
-    llen = zsetLength(zobj);
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-
-        eptr = ziplistIndex(zl,0);
-        serverAssert(eptr != NULL);
-        sptr = ziplistNext(zl,eptr);
-        serverAssert(sptr != NULL);
-
-        rank = 1;
-        while(eptr != NULL) {
-            if (ziplistCompare(eptr,(unsigned char*)ele,sdslen(ele)))
-                break;
-            rank++;
-            zzlNext(zl,&eptr,&sptr);
-        }
-
-        if (eptr != NULL) {
-            if (reverse)
-                return llen-rank;
-            else
-                return rank-1;
-        } else {
-            return -1;
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        dictEntry *de;
-        double score;
-
-        de = dictFind(zs->dict,ele);
-        if (de != NULL) {
-            score = *(double*)dictGetVal(de);
-            rank = zslGetRank(zsl,score,ele);
-            /* Existing elements always have a rank. */
-            serverAssert(rank != 0);
-            if (reverse)
-                return llen-rank;
-            else
-                return rank-1;
-        } else {
-            return -1;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-}
-
-/* This is a helper function for the COPY command.
- * Duplicate a sorted set object, with the guarantee that the returned object
- * has the same encoding as the original one.
- *
- * The resulting object always has refcount set to 1 */
-robj *zsetDup(robj *o) {
-    robj *zobj;
-    zset *zs;
-    zset *new_zs;
-
-    serverAssert(o->type == OBJ_ZSET);
-
-    /* Create a new sorted set object that have the same encoding as the original object's encoding */
-    if (o->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = o->ptr;
-        size_t sz = ziplistBlobLen(zl);
-        unsigned char *new_zl = zmalloc(sz);
-        memcpy(new_zl, zl, sz);
-        zobj = createObject(OBJ_ZSET, new_zl);
-        zobj->encoding = OBJ_ENCODING_ZIPLIST;
-    } else if (o->encoding == OBJ_ENCODING_SKIPLIST) {
-        zobj = createZsetObject();
-        zs = o->ptr;
-        new_zs = zobj->ptr;
-        dictExpand(new_zs->dict,dictSize(zs->dict));
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-        sds ele;
-        long llen = zsetLength(o);
-
-        /* We copy the skiplist elements from the greatest to the
-         * smallest (that's trivial since the elements are already ordered in
-         * the skiplist): this improves the load process, since the next loaded
-         * element will always be the smaller, so adding to the skiplist
-         * will always immediately stop at the head, making the insertion
-         * O(1) instead of O(log(N)). */
-        ln = zsl->tail;
-        while (llen--) {
-            ele = ln->ele;
-            sds new_ele = sdsdup(ele);
-            zskiplistNode *znode = zslInsert(new_zs->zsl,ln->score,new_ele);
-            dictAdd(new_zs->dict,new_ele,&znode->score);
-            ln = ln->backward;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-    return zobj;
-}
-
-/* callback for to check the ziplist doesn't have duplicate recoreds */
-static int _zsetZiplistValidateIntegrity(unsigned char *p, void *userdata) {
-    struct {
-        long count;
-        dict *fields;
-    } *data = userdata;
-
-    /* Even records are field names, add to dict and check that's not a dup */
-    if (((data->count) & 1) == 0) {
-        unsigned char *str;
-        unsigned int slen;
-        long long vll;
-        if (!ziplistGet(p, &str, &slen, &vll))
-            return 0;
-        sds field = str? sdsnewlen(str, slen): sdsfromlonglong(vll);;
-        if (dictAdd(data->fields, field, NULL) != DICT_OK) {
-            /* Duplicate, return an error */
-            sdsfree(field);
-            return 0;
-        }
-    }
-
-    (data->count)++;
-    return 1;
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we scan all the entries one by one. */
-int zsetZiplistValidateIntegrity(unsigned char *zl, size_t size, int deep) {
-    if (!deep)
-        return ziplistValidateIntegrity(zl, size, 0, NULL, NULL);
-
-    /* Keep track of the field names to locate duplicate ones */
-    struct {
-        long count;
-        dict *fields;
-    } data = {0, dictCreate(&hashDictType, NULL)};
-
-    int ret = ziplistValidateIntegrity(zl, size, 1, _zsetZiplistValidateIntegrity, &data);
-
-    /* make sure we have an even number of records. */
-    if (data.count & 1)
-        ret = 0;
-
-    dictRelease(data.fields);
-    return ret;
-}
-
-/* Create a new sds string from the ziplist entry. */
-sds zsetSdsFromZiplistEntry(ziplistEntry *e) {
-    return e->sval ? sdsnewlen(e->sval, e->slen) : sdsfromlonglong(e->lval);
-}
-
-/* Reply with bulk string from the ziplist entry. */
-void zsetReplyFromZiplistEntry(client *c, ziplistEntry *e) {
-    if (e->sval)
-        addReplyBulkCBuffer(c, e->sval, e->slen);
-    else
-        addReplyBulkLongLong(c, e->lval);
-}
-
-
-/* Return random element from a non empty zset.
- * 'key' and 'val' will be set to hold the element.
- * The memory in `key` is not to be freed or modified by the caller.
- * 'score' can be NULL in which case it's not extracted. */
-void zsetTypeRandomElement(robj *zsetobj, unsigned long zsetsize, ziplistEntry *key, double *score) {
-    if (zsetobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zsetobj->ptr;
-        dictEntry *de = dictGetFairRandomKey(zs->dict);
-        sds s = dictGetKey(de);
-        key->sval = (unsigned char*)s;
-        key->slen = sdslen(s);
-        if (score)
-            *score = *(double*)dictGetVal(de);
-    } else if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        ziplistEntry val;
-        ziplistRandomPair(zsetobj->ptr, zsetsize, key, &val);
-        if (score) {
-            if (val.sval) {
-                *score = zzlStrtod(val.sval,val.slen);
-            } else {
-                *score = (double)val.lval;
-            }
-        }
-    } else {
-        serverPanic("Unknown zset encoding");
-    }
-}
-
-/*-----------------------------------------------------------------------------
- * Sorted set commands
- *----------------------------------------------------------------------------*/
-
-/* This generic command implements both ZADD and ZINCRBY. */
-void zaddGenericCommand(client *c, int flags) {
-    static char *nanerr = "resulting score is not a number (NaN)";
-    robj *key = c->argv[1];
-    robj *zobj;
-    sds ele;
-    double score = 0, *scores = NULL;
-    int j, elements, ch = 0;
-    int scoreidx = 0;
-    /* The following vars are used in order to track what the command actually
-     * did during the execution, to reply to the client and to trigger the
-     * notification of keyspace change. */
-    int added = 0;      /* Number of new elements added. */
-    int updated = 0;    /* Number of elements with updated score. */
-    int processed = 0;  /* Number of elements processed, may remain zero with
-                           options like XX. */
-
-    /* Parse options. At the end 'scoreidx' is set to the argument position
-     * of the score of the first score-element pair. */
-    scoreidx = 2;
-    while(scoreidx < c->argc) {
-        char *opt = c->argv[scoreidx]->ptr;
-        if (!strcasecmp(opt,"nx")) flags |= ZADD_IN_NX;
-        else if (!strcasecmp(opt,"xx")) flags |= ZADD_IN_XX;
-        else if (!strcasecmp(opt,"ch")) ch = 1; /* Return num of elements added or updated. */
-        else if (!strcasecmp(opt,"incr")) flags |= ZADD_IN_INCR;
-        else if (!strcasecmp(opt,"gt")) flags |= ZADD_IN_GT;
-        else if (!strcasecmp(opt,"lt")) flags |= ZADD_IN_LT;
-        else break;
-        scoreidx++;
-    }
-
-    /* Turn options into simple to check vars. */
-    int incr = (flags & ZADD_IN_INCR) != 0;
-    int nx = (flags & ZADD_IN_NX) != 0;
-    int xx = (flags & ZADD_IN_XX) != 0;
-    int gt = (flags & ZADD_IN_GT) != 0;
-    int lt = (flags & ZADD_IN_LT) != 0;
-
-    /* After the options, we expect to have an even number of args, since
-     * we expect any number of score-element pairs. */
-    elements = c->argc-scoreidx;
-    if (elements % 2 || !elements) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-    elements /= 2; /* Now this holds the number of score-element pairs. */
-
-    /* Check for incompatible options. */
-    if (nx && xx) {
-        addReplyError(c,
-            "XX and NX options at the same time are not compatible");
-        return;
-    }
-    
-    if ((gt && nx) || (lt && nx) || (gt && lt)) {
-        addReplyError(c,
-            "GT, LT, and/or NX options at the same time are not compatible");
-        return;
-    }
-    /* Note that XX is compatible with either GT or LT */
-
-    if (incr && elements > 1) {
-        addReplyError(c,
-            "INCR option supports a single increment-element pair");
-        return;
-    }
-
-    /* Start parsing all the scores, we need to emit any syntax error
-     * before executing additions to the sorted set, as the command should
-     * either execute fully or nothing at all. */
-    scores = zmalloc(sizeof(double)*elements);
-    for (j = 0; j < elements; j++) {
-        if (getDoubleFromObjectOrReply(c,c->argv[scoreidx+j*2],&scores[j],NULL)
-            != C_OK) goto cleanup;
-    }
-
-    /* Lookup the key and create the sorted set if does not exist. */
-    zobj = lookupKeyWrite(c->db,key);
-    if (checkType(c,zobj,OBJ_ZSET)) goto cleanup;
-    if (zobj == NULL) {
-        if (xx) goto reply_to_client; /* No key + XX option: nothing to do. */
-        if (server.zset_max_ziplist_entries == 0 ||
-            server.zset_max_ziplist_value < sdslen(c->argv[scoreidx+1]->ptr))
-        {
-            zobj = createZsetObject();
-        } else {
-            zobj = createZsetZiplistObject();
-        }
-        dbAdd(c->db,key,zobj);
-    }
-
-    for (j = 0; j < elements; j++) {
-        double newscore;
-        score = scores[j];
-        int retflags = 0;
-
-        ele = c->argv[scoreidx+1+j*2]->ptr;
-        int retval = zsetAdd(zobj, score, ele, flags, &retflags, &newscore);
-        if (retval == 0) {
-            addReplyError(c,nanerr);
-            goto cleanup;
-        }
-        if (retflags & ZADD_OUT_ADDED) added++;
-        if (retflags & ZADD_OUT_UPDATED) updated++;
-        if (!(retflags & ZADD_OUT_NOP)) processed++;
-        score = newscore;
-    }
-    server.dirty += (added+updated);
-
-reply_to_client:
-    if (incr) { /* ZINCRBY or INCR option. */
-        if (processed)
-            addReplyDouble(c,score);
-        else
-            addReplyNull(c);
-    } else { /* ZADD. */
-        addReplyLongLong(c,ch ? added+updated : added);
-    }
-
-cleanup:
-    zfree(scores);
-    if (added || updated) {
-        signalModifiedKey(c,c->db,key);
-        notifyKeyspaceEvent(NOTIFY_ZSET,
-            incr ? "zincr" : "zadd", key, c->db->id);
-    }
-}
-
-void zaddCommand(client *c) {
-    zaddGenericCommand(c,ZADD_IN_NONE);
-}
-
-void zincrbyCommand(client *c) {
-    zaddGenericCommand(c,ZADD_IN_INCR);
-}
-
-void zremCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    int deleted = 0, keyremoved = 0, j;
-
-    if ((zobj = lookupKeyWriteOrReply(c,key,shared.czero)) == NULL ||
-        checkType(c,zobj,OBJ_ZSET)) return;
-
-    for (j = 2; j < c->argc; j++) {
-        if (zsetDel(zobj,c->argv[j]->ptr)) deleted++;
-        if (zsetLength(zobj) == 0) {
-            dbDelete(c->db,key);
-            keyremoved = 1;
-            break;
-        }
-    }
-
-    if (deleted) {
-        notifyKeyspaceEvent(NOTIFY_ZSET,"zrem",key,c->db->id);
-        if (keyremoved)
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
-        signalModifiedKey(c,c->db,key);
-        server.dirty += deleted;
-    }
-    addReplyLongLong(c,deleted);
-}
-
-typedef enum {
-    ZRANGE_AUTO = 0,
-    ZRANGE_RANK,
-    ZRANGE_SCORE,
-    ZRANGE_LEX,
-} zrange_type;
-
-/* Implements ZREMRANGEBYRANK, ZREMRANGEBYSCORE, ZREMRANGEBYLEX commands. */
-void zremrangeGenericCommand(client *c, zrange_type rangetype) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    int keyremoved = 0;
-    unsigned long deleted = 0;
-    zrangespec range;
-    zlexrangespec lexrange;
-    long start, end, llen;
-    char *notify_type = NULL;
-
-    /* Step 1: Parse the range. */
-    if (rangetype == ZRANGE_RANK) {
-        notify_type = "zremrangebyrank";
-        if ((getLongFromObjectOrReply(c,c->argv[2],&start,NULL) != C_OK) ||
-            (getLongFromObjectOrReply(c,c->argv[3],&end,NULL) != C_OK))
-            return;
-    } else if (rangetype == ZRANGE_SCORE) {
-        notify_type = "zremrangebyscore";
-        if (zslParseRange(c->argv[2],c->argv[3],&range) != C_OK) {
-            addReplyError(c,"min or max is not a float");
-            return;
-        }
-    } else if (rangetype == ZRANGE_LEX) {
-        notify_type = "zremrangebylex";
-        if (zslParseLexRange(c->argv[2],c->argv[3],&lexrange) != C_OK) {
-            addReplyError(c,"min or max not valid string range item");
-            return;
-        }
-    } else {
-        serverPanic("unknown rangetype %d", (int)rangetype);
-    }
-
-    /* Step 2: Lookup & range sanity checks if needed. */
-    if ((zobj = lookupKeyWriteOrReply(c,key,shared.czero)) == NULL ||
-        checkType(c,zobj,OBJ_ZSET)) goto cleanup;
-
-    if (rangetype == ZRANGE_RANK) {
-        /* Sanitize indexes. */
-        llen = zsetLength(zobj);
-        if (start < 0) start = llen+start;
-        if (end < 0) end = llen+end;
-        if (start < 0) start = 0;
-
-        /* Invariant: start >= 0, so this test will be true when end < 0.
-         * The range is empty when start > end or start >= length. */
-        if (start > end || start >= llen) {
-            addReply(c,shared.czero);
-            goto cleanup;
-        }
-        if (end >= llen) end = llen-1;
-    }
-
-    /* Step 3: Perform the range deletion operation. */
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        switch(rangetype) {
-        case ZRANGE_AUTO:
-        case ZRANGE_RANK:
-            zobj->ptr = zzlDeleteRangeByRank(zobj->ptr,start+1,end+1,&deleted);
-            break;
-        case ZRANGE_SCORE:
-            zobj->ptr = zzlDeleteRangeByScore(zobj->ptr,&range,&deleted);
-            break;
-        case ZRANGE_LEX:
-            zobj->ptr = zzlDeleteRangeByLex(zobj->ptr,&lexrange,&deleted);
-            break;
-        }
-        if (zzlLength(zobj->ptr) == 0) {
-            dbDelete(c->db,key);
-            keyremoved = 1;
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        switch(rangetype) {
-        case ZRANGE_AUTO:
-        case ZRANGE_RANK:
-            deleted = zslDeleteRangeByRank(zs->zsl,start+1,end+1,zs->dict);
-            break;
-        case ZRANGE_SCORE:
-            deleted = zslDeleteRangeByScore(zs->zsl,&range,zs->dict);
-            break;
-        case ZRANGE_LEX:
-            deleted = zslDeleteRangeByLex(zs->zsl,&lexrange,zs->dict);
-            break;
-        }
-        if (htNeedsResize(zs->dict)) dictResize(zs->dict);
-        if (dictSize(zs->dict) == 0) {
-            dbDelete(c->db,key);
-            keyremoved = 1;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    /* Step 4: Notifications and reply. */
-    if (deleted) {
-        signalModifiedKey(c,c->db,key);
-        notifyKeyspaceEvent(NOTIFY_ZSET,notify_type,key,c->db->id);
-        if (keyremoved)
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
-    }
-    server.dirty += deleted;
-    addReplyLongLong(c,deleted);
-
-cleanup:
-    if (rangetype == ZRANGE_LEX) zslFreeLexRange(&lexrange);
-}
-
-void zremrangebyrankCommand(client *c) {
-    zremrangeGenericCommand(c,ZRANGE_RANK);
-}
-
-void zremrangebyscoreCommand(client *c) {
-    zremrangeGenericCommand(c,ZRANGE_SCORE);
-}
-
-void zremrangebylexCommand(client *c) {
-    zremrangeGenericCommand(c,ZRANGE_LEX);
-}
-
-typedef struct {
-    robj *subject;
-    int type; /* Set, sorted set */
-    int encoding;
-    double weight;
-
-    union {
-        /* Set iterators. */
-        union _iterset {
-            struct {
-                intset *is;
-                int ii;
-            } is;
-            struct {
-                dict *dict;
-                dictIterator *di;
-                dictEntry *de;
-            } ht;
-        } set;
-
-        /* Sorted set iterators. */
-        union _iterzset {
-            struct {
-                unsigned char *zl;
-                unsigned char *eptr, *sptr;
-            } zl;
-            struct {
-                zset *zs;
-                zskiplistNode *node;
-            } sl;
-        } zset;
-    } iter;
-} zsetopsrc;
-
-
-/* Use dirty flags for pointers that need to be cleaned up in the next
- * iteration over the zsetopval. The dirty flag for the long long value is
- * special, since long long values don't need cleanup. Instead, it means that
- * we already checked that "ell" holds a long long, or tried to convert another
- * representation into a long long value. When this was successful,
- * OPVAL_VALID_LL is set as well. */
-#define OPVAL_DIRTY_SDS 1
-#define OPVAL_DIRTY_LL 2
-#define OPVAL_VALID_LL 4
-
-/* Store value retrieved from the iterator. */
-typedef struct {
-    int flags;
-    unsigned char _buf[32]; /* Private buffer. */
-    sds ele;
-    unsigned char *estr;
-    unsigned int elen;
-    long long ell;
-    double score;
-} zsetopval;
-
-typedef union _iterset iterset;
-typedef union _iterzset iterzset;
-
-void zuiInitIterator(zsetopsrc *op) {
-    if (op->subject == NULL)
-        return;
-
-    if (op->type == OBJ_SET) {
-        iterset *it = &op->iter.set;
-        if (op->encoding == OBJ_ENCODING_INTSET) {
-            it->is.is = op->subject->ptr;
-            it->is.ii = 0;
-        } else if (op->encoding == OBJ_ENCODING_HT) {
-            it->ht.dict = op->subject->ptr;
-            it->ht.di = dictGetIterator(op->subject->ptr);
-            it->ht.de = dictNext(it->ht.di);
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (op->type == OBJ_ZSET) {
-        /* Sorted sets are traversed in reverse order to optimize for
-         * the insertion of the elements in a new list as in
-         * ZDIFF/ZINTER/ZUNION */
-        iterzset *it = &op->iter.zset;
-        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
-            it->zl.zl = op->subject->ptr;
-            it->zl.eptr = ziplistIndex(it->zl.zl,-2);
-            if (it->zl.eptr != NULL) {
-                it->zl.sptr = ziplistNext(it->zl.zl,it->zl.eptr);
-                serverAssert(it->zl.sptr != NULL);
-            }
-        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
-            it->sl.zs = op->subject->ptr;
-            it->sl.node = it->sl.zs->zsl->tail;
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else {
-        serverPanic("Unsupported type");
-    }
-}
-
-void zuiClearIterator(zsetopsrc *op) {
-    if (op->subject == NULL)
-        return;
-
-    if (op->type == OBJ_SET) {
-        iterset *it = &op->iter.set;
-        if (op->encoding == OBJ_ENCODING_INTSET) {
-            UNUSED(it); /* skip */
-        } else if (op->encoding == OBJ_ENCODING_HT) {
-            dictReleaseIterator(it->ht.di);
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (op->type == OBJ_ZSET) {
-        iterzset *it = &op->iter.zset;
-        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
-            UNUSED(it); /* skip */
-        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
-            UNUSED(it); /* skip */
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else {
-        serverPanic("Unsupported type");
-    }
-}
-
-unsigned long zuiLength(zsetopsrc *op) {
-    if (op->subject == NULL)
-        return 0;
-
-    if (op->type == OBJ_SET) {
-        if (op->encoding == OBJ_ENCODING_INTSET) {
-            return intsetLen(op->subject->ptr);
-        } else if (op->encoding == OBJ_ENCODING_HT) {
-            dict *ht = op->subject->ptr;
-            return dictSize(ht);
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (op->type == OBJ_ZSET) {
-        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
-            return zzlLength(op->subject->ptr);
-        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = op->subject->ptr;
-            return zs->zsl->length;
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else {
-        serverPanic("Unsupported type");
-    }
-}
-
-/* Check if the current value is valid. If so, store it in the passed structure
- * and move to the next element. If not valid, this means we have reached the
- * end of the structure and can abort. */
-int zuiNext(zsetopsrc *op, zsetopval *val) {
-    if (op->subject == NULL)
-        return 0;
-
-    if (val->flags & OPVAL_DIRTY_SDS)
-        sdsfree(val->ele);
-
-    memset(val,0,sizeof(zsetopval));
-
-    if (op->type == OBJ_SET) {
-        iterset *it = &op->iter.set;
-        if (op->encoding == OBJ_ENCODING_INTSET) {
-            int64_t ell;
-
-            if (!intsetGet(it->is.is,it->is.ii,&ell))
-                return 0;
-            val->ell = ell;
-            val->score = 1.0;
-
-            /* Move to next element. */
-            it->is.ii++;
-        } else if (op->encoding == OBJ_ENCODING_HT) {
-            if (it->ht.de == NULL)
-                return 0;
-            val->ele = dictGetKey(it->ht.de);
-            val->score = 1.0;
-
-            /* Move to next element. */
-            it->ht.de = dictNext(it->ht.di);
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (op->type == OBJ_ZSET) {
-        iterzset *it = &op->iter.zset;
-        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
-            /* No need to check both, but better be explicit. */
-            if (it->zl.eptr == NULL || it->zl.sptr == NULL)
-                return 0;
-            serverAssert(ziplistGet(it->zl.eptr,&val->estr,&val->elen,&val->ell));
-            val->score = zzlGetScore(it->zl.sptr);
-
-            /* Move to next element (going backwards, see zuiInitIterator). */
-            zzlPrev(it->zl.zl,&it->zl.eptr,&it->zl.sptr);
-        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
-            if (it->sl.node == NULL)
-                return 0;
-            val->ele = it->sl.node->ele;
-            val->score = it->sl.node->score;
-
-            /* Move to next element. (going backwards, see zuiInitIterator) */
-            it->sl.node = it->sl.node->backward;
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else {
-        serverPanic("Unsupported type");
-    }
-    return 1;
-}
-
-int zuiLongLongFromValue(zsetopval *val) {
-    if (!(val->flags & OPVAL_DIRTY_LL)) {
-        val->flags |= OPVAL_DIRTY_LL;
-
-        if (val->ele != NULL) {
-            if (string2ll(val->ele,sdslen(val->ele),&val->ell))
-                val->flags |= OPVAL_VALID_LL;
-        } else if (val->estr != NULL) {
-            if (string2ll((char*)val->estr,val->elen,&val->ell))
-                val->flags |= OPVAL_VALID_LL;
-        } else {
-            /* The long long was already set, flag as valid. */
-            val->flags |= OPVAL_VALID_LL;
-        }
-    }
-    return val->flags & OPVAL_VALID_LL;
-}
-
-sds zuiSdsFromValue(zsetopval *val) {
-    if (val->ele == NULL) {
-        if (val->estr != NULL) {
-            val->ele = sdsnewlen((char*)val->estr,val->elen);
-        } else {
-            val->ele = sdsfromlonglong(val->ell);
-        }
-        val->flags |= OPVAL_DIRTY_SDS;
-    }
-    return val->ele;
-}
-
-/* This is different from zuiSdsFromValue since returns a new SDS string
- * which is up to the caller to free. */
-sds zuiNewSdsFromValue(zsetopval *val) {
-    if (val->flags & OPVAL_DIRTY_SDS) {
-        /* We have already one to return! */
-        sds ele = val->ele;
-        val->flags &= ~OPVAL_DIRTY_SDS;
-        val->ele = NULL;
-        return ele;
-    } else if (val->ele) {
-        return sdsdup(val->ele);
-    } else if (val->estr) {
-        return sdsnewlen((char*)val->estr,val->elen);
-    } else {
-        return sdsfromlonglong(val->ell);
-    }
-}
-
-int zuiBufferFromValue(zsetopval *val) {
-    if (val->estr == NULL) {
-        if (val->ele != NULL) {
-            val->elen = sdslen(val->ele);
-            val->estr = (unsigned char*)val->ele;
-        } else {
-            val->elen = ll2string((char*)val->_buf,sizeof(val->_buf),val->ell);
-            val->estr = val->_buf;
-        }
-    }
-    return 1;
-}
-
-/* Find value pointed to by val in the source pointer to by op. When found,
- * return 1 and store its score in target. Return 0 otherwise. */
-int zuiFind(zsetopsrc *op, zsetopval *val, double *score) {
-    if (op->subject == NULL)
-        return 0;
-
-    if (op->type == OBJ_SET) {
-        if (op->encoding == OBJ_ENCODING_INTSET) {
-            if (zuiLongLongFromValue(val) &&
-                intsetFind(op->subject->ptr,val->ell))
-            {
-                *score = 1.0;
-                return 1;
-            } else {
-                return 0;
-            }
-        } else if (op->encoding == OBJ_ENCODING_HT) {
-            dict *ht = op->subject->ptr;
-            zuiSdsFromValue(val);
-            if (dictFind(ht,val->ele) != NULL) {
-                *score = 1.0;
-                return 1;
-            } else {
-                return 0;
-            }
-        } else {
-            serverPanic("Unknown set encoding");
-        }
-    } else if (op->type == OBJ_ZSET) {
-        zuiSdsFromValue(val);
-
-        if (op->encoding == OBJ_ENCODING_ZIPLIST) {
-            if (zzlFind(op->subject->ptr,val->ele,score) != NULL) {
-                /* Score is already set by zzlFind. */
-                return 1;
-            } else {
-                return 0;
-            }
-        } else if (op->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = op->subject->ptr;
-            dictEntry *de;
-            if ((de = dictFind(zs->dict,val->ele)) != NULL) {
-                *score = *(double*)dictGetVal(de);
-                return 1;
-            } else {
-                return 0;
-            }
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-    } else {
-        serverPanic("Unsupported type");
-    }
-}
-
-int zuiCompareByCardinality(const void *s1, const void *s2) {
-    unsigned long first = zuiLength((zsetopsrc*)s1);
-    unsigned long second = zuiLength((zsetopsrc*)s2);
-    if (first > second) return 1;
-    if (first < second) return -1;
-    return 0;
-}
-
-static int zuiCompareByRevCardinality(const void *s1, const void *s2) {
-    return zuiCompareByCardinality(s1, s2) * -1;
-}
-
-#define REDIS_AGGR_SUM 1
-#define REDIS_AGGR_MIN 2
-#define REDIS_AGGR_MAX 3
-#define zunionInterDictValue(_e) (dictGetVal(_e) == NULL ? 1.0 : *(double*)dictGetVal(_e))
-
-inline static void zunionInterAggregate(double *target, double val, int aggregate) {
-    if (aggregate == REDIS_AGGR_SUM) {
-        *target = *target + val;
-        /* The result of adding two doubles is NaN when one variable
-         * is +inf and the other is -inf. When these numbers are added,
-         * we maintain the convention of the result being 0.0. */
-        if (isnan(*target)) *target = 0.0;
-    } else if (aggregate == REDIS_AGGR_MIN) {
-        *target = val < *target ? val : *target;
-    } else if (aggregate == REDIS_AGGR_MAX) {
-        *target = val > *target ? val : *target;
-    } else {
-        /* safety net */
-        serverPanic("Unknown ZUNION/INTER aggregate type");
-    }
-}
-
-static size_t zsetDictGetMaxElementLength(dict *d, size_t *totallen) {
-    dictIterator *di;
-    dictEntry *de;
-    size_t maxelelen = 0;
-
-    di = dictGetIterator(d);
-
-    while((de = dictNext(di)) != NULL) {
-        sds ele = dictGetKey(de);
-        if (sdslen(ele) > maxelelen) maxelelen = sdslen(ele);
-        if (totallen)
-            (*totallen) += sdslen(ele);
-    }
-
-    dictReleaseIterator(di);
-
-    return maxelelen;
-}
-
-static void zdiffAlgorithm1(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
-    /* DIFF Algorithm 1:
-     *
-     * We perform the diff by iterating all the elements of the first set,
-     * and only adding it to the target set if the element does not exist
-     * into all the other sets.
-     *
-     * This way we perform at max N*M operations, where N is the size of
-     * the first set, and M the number of sets.
-     *
-     * There is also a O(K*log(K)) cost for adding the resulting elements
-     * to the target set, where K is the final size of the target set.
-     *
-     * The final complexity of this algorithm is O(N*M + K*log(K)). */
-    int j;
-    zsetopval zval;
-    zskiplistNode *znode;
-    sds tmp;
-
-    /* With algorithm 1 it is better to order the sets to subtract
-     * by decreasing size, so that we are more likely to find
-     * duplicated elements ASAP. */
-    qsort(src+1,setnum-1,sizeof(zsetopsrc),zuiCompareByRevCardinality);
-
-    memset(&zval, 0, sizeof(zval));
-    zuiInitIterator(&src[0]);
-    while (zuiNext(&src[0],&zval)) {
-        double value;
-        int exists = 0;
-
-        for (j = 1; j < setnum; j++) {
-            /* It is not safe to access the zset we are
-             * iterating, so explicitly check for equal object.
-             * This check isn't really needed anymore since we already
-             * check for a duplicate set in the zsetChooseDiffAlgorithm
-             * function, but we're leaving it for future-proofing. */
-            if (src[j].subject == src[0].subject ||
-                zuiFind(&src[j],&zval,&value)) {
-                exists = 1;
-                break;
-            }
-        }
-
-        if (!exists) {
-            tmp = zuiNewSdsFromValue(&zval);
-            znode = zslInsert(dstzset->zsl,zval.score,tmp);
-            dictAdd(dstzset->dict,tmp,&znode->score);
-            if (sdslen(tmp) > *maxelelen) *maxelelen = sdslen(tmp);
-            (*totelelen) += sdslen(tmp);
-        }
-    }
-    zuiClearIterator(&src[0]);
-}
-
-
-static void zdiffAlgorithm2(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
-    /* DIFF Algorithm 2:
-     *
-     * Add all the elements of the first set to the auxiliary set.
-     * Then remove all the elements of all the next sets from it.
-     *
-
-     * This is O(L + (N-K)log(N)) where L is the sum of all the elements in every
-     * set, N is the size of the first set, and K is the size of the result set.
-     *
-     * Note that from the (L-N) dict searches, (N-K) got to the zsetRemoveFromSkiplist
-     * which costs log(N)
-     *
-     * There is also a O(K) cost at the end for finding the largest element
-     * size, but this doesn't change the algorithm complexity since K < L, and
-     * O(2L) is the same as O(L). */
-    int j;
-    int cardinality = 0;
-    zsetopval zval;
-    zskiplistNode *znode;
-    sds tmp;
-
-    for (j = 0; j < setnum; j++) {
-        if (zuiLength(&src[j]) == 0) continue;
-
-        memset(&zval, 0, sizeof(zval));
-        zuiInitIterator(&src[j]);
-        while (zuiNext(&src[j],&zval)) {
-            if (j == 0) {
-                tmp = zuiNewSdsFromValue(&zval);
-                znode = zslInsert(dstzset->zsl,zval.score,tmp);
-                dictAdd(dstzset->dict,tmp,&znode->score);
-                cardinality++;
-            } else {
-                tmp = zuiSdsFromValue(&zval);
-                if (zsetRemoveFromSkiplist(dstzset, tmp)) {
-                    cardinality--;
-                }
-            }
-
-            /* Exit if result set is empty as any additional removal
-                * of elements will have no effect. */
-            if (cardinality == 0) break;
-        }
-        zuiClearIterator(&src[j]);
-
-        if (cardinality == 0) break;
-    }
-
-    /* Redize dict if needed after removing multiple elements */
-    if (htNeedsResize(dstzset->dict)) dictResize(dstzset->dict);
-
-    /* Using this algorithm, we can't calculate the max element as we go,
-     * we have to iterate through all elements to find the max one after. */
-    *maxelelen = zsetDictGetMaxElementLength(dstzset->dict, totelelen);
-}
-
-static int zsetChooseDiffAlgorithm(zsetopsrc *src, long setnum) {
-    int j;
-
-    /* Select what DIFF algorithm to use.
-     *
-     * Algorithm 1 is O(N*M + K*log(K)) where N is the size of the
-     * first set, M the total number of sets, and K is the size of the
-     * result set.
-     *
-     * Algorithm 2 is O(L + (N-K)log(N)) where L is the total number of elements
-     * in all the sets, N is the size of the first set, and K is the size of the
-     * result set.
-     *
-     * We compute what is the best bet with the current input here. */
-    long long algo_one_work = 0;
-    long long algo_two_work = 0;
-
-    for (j = 0; j < setnum; j++) {
-        /* If any other set is equal to the first set, there is nothing to be
-         * done, since we would remove all elements anyway. */
-        if (j > 0 && src[0].subject == src[j].subject) {
-            return 0;
-        }
-
-        algo_one_work += zuiLength(&src[0]);
-        algo_two_work += zuiLength(&src[j]);
-    }
-
-    /* Algorithm 1 has better constant times and performs less operations
-     * if there are elements in common. Give it some advantage. */
-    algo_one_work /= 2;
-    return (algo_one_work <= algo_two_work) ? 1 : 2;
-}
-
-static void zdiff(zsetopsrc *src, long setnum, zset *dstzset, size_t *maxelelen, size_t *totelelen) {
-    /* Skip everything if the smallest input is empty. */
-    if (zuiLength(&src[0]) > 0) {
-        int diff_algo = zsetChooseDiffAlgorithm(src, setnum);
-        if (diff_algo == 1) {
-            zdiffAlgorithm1(src, setnum, dstzset, maxelelen, totelelen);
-        } else if (diff_algo == 2) {
-            zdiffAlgorithm2(src, setnum, dstzset, maxelelen, totelelen);
-        } else if (diff_algo != 0) {
-            serverPanic("Unknown algorithm");
-        }
-    }
-}
-
-uint64_t dictSdsHash(const void *key);
-int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2);
-
-dictType setAccumulatorDictType = {
-    dictSdsHash,               /* hash function */
-    NULL,                      /* key dup */
-    NULL,                      /* val dup */
-    dictSdsKeyCompare,         /* key compare */
-    NULL,                      /* key destructor */
-    NULL,                      /* val destructor */
-    NULL                       /* allow to expand */
-};
-
-/* The zunionInterDiffGenericCommand() function is called in order to implement the
- * following commands: ZUNION, ZINTER, ZDIFF, ZUNIONSTORE, ZINTERSTORE, ZDIFFSTORE.
- *
- * 'numkeysIndex' parameter position of key number. for ZUNION/ZINTER/ZDIFF command,
- * this value is 1, for ZUNIONSTORE/ZINTERSTORE/ZDIFFSTORE command, this value is 2.
- *
- * 'op' SET_OP_INTER, SET_OP_UNION or SET_OP_DIFF.
- */
-void zunionInterDiffGenericCommand(client *c, robj *dstkey, int numkeysIndex, int op) {
-    int i, j;
-    long setnum;
-    int aggregate = REDIS_AGGR_SUM;
-    zsetopsrc *src;
-    zsetopval zval;
-    sds tmp;
-    size_t maxelelen = 0, totelelen = 0;
-    robj *dstobj;
-    zset *dstzset;
-    zskiplistNode *znode;
-    int withscores = 0;
-
-    /* expect setnum input keys to be given */
-    if ((getLongFromObjectOrReply(c, c->argv[numkeysIndex], &setnum, NULL) != C_OK))
-        return;
-
-    if (setnum < 1) {
-        addReplyErrorFormat(c,
-            "at least 1 input key is needed for %s", c->cmd->name);
-        return;
-    }
-
-    /* test if the expected number of keys would overflow */
-    if (setnum > (c->argc-(numkeysIndex+1))) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-
-    /* read keys to be used for input */
-    src = zcalloc(sizeof(zsetopsrc) * setnum);
-    for (i = 0, j = numkeysIndex+1; i < setnum; i++, j++) {
-        robj *obj = dstkey ?
-            lookupKeyWrite(c->db,c->argv[j]) :
-            lookupKeyRead(c->db,c->argv[j]);
-        if (obj != NULL) {
-            if (obj->type != OBJ_ZSET && obj->type != OBJ_SET) {
-                zfree(src);
-                addReplyErrorObject(c,shared.wrongtypeerr);
-                return;
-            }
-
-            src[i].subject = obj;
-            src[i].type = obj->type;
-            src[i].encoding = obj->encoding;
-        } else {
-            src[i].subject = NULL;
-        }
-
-        /* Default all weights to 1. */
-        src[i].weight = 1.0;
-    }
-
-    /* parse optional extra arguments */
-    if (j < c->argc) {
-        int remaining = c->argc - j;
-
-        while (remaining) {
-            if (op != SET_OP_DIFF &&
-                remaining >= (setnum + 1) &&
-                !strcasecmp(c->argv[j]->ptr,"weights"))
-            {
-                j++; remaining--;
-                for (i = 0; i < setnum; i++, j++, remaining--) {
-                    if (getDoubleFromObjectOrReply(c,c->argv[j],&src[i].weight,
-                            "weight value is not a float") != C_OK)
-                    {
-                        zfree(src);
-                        return;
-                    }
-                }
-            } else if (op != SET_OP_DIFF &&
-                       remaining >= 2 &&
-                       !strcasecmp(c->argv[j]->ptr,"aggregate"))
-            {
-                j++; remaining--;
-                if (!strcasecmp(c->argv[j]->ptr,"sum")) {
-                    aggregate = REDIS_AGGR_SUM;
-                } else if (!strcasecmp(c->argv[j]->ptr,"min")) {
-                    aggregate = REDIS_AGGR_MIN;
-                } else if (!strcasecmp(c->argv[j]->ptr,"max")) {
-                    aggregate = REDIS_AGGR_MAX;
-                } else {
-                    zfree(src);
-                    addReplyErrorObject(c,shared.syntaxerr);
-                    return;
-                }
-                j++; remaining--;
-            } else if (remaining >= 1 &&
-                       !dstkey &&
-                       !strcasecmp(c->argv[j]->ptr,"withscores"))
-            {
-                j++; remaining--;
-                withscores = 1;
-            } else {
-                zfree(src);
-                addReplyErrorObject(c,shared.syntaxerr);
-                return;
-            }
-        }
-    }
-
-    if (op != SET_OP_DIFF) {
-        /* sort sets from the smallest to largest, this will improve our
-        * algorithm's performance */
-        qsort(src,setnum,sizeof(zsetopsrc),zuiCompareByCardinality);
-    }
-
-    dstobj = createZsetObject();
-    dstzset = dstobj->ptr;
-    memset(&zval, 0, sizeof(zval));
-
-    if (op == SET_OP_INTER) {
-        /* Skip everything if the smallest input is empty. */
-        if (zuiLength(&src[0]) > 0) {
-            /* Precondition: as src[0] is non-empty and the inputs are ordered
-             * by size, all src[i > 0] are non-empty too. */
-            zuiInitIterator(&src[0]);
-            while (zuiNext(&src[0],&zval)) {
-                double score, value;
-
-                score = src[0].weight * zval.score;
-                if (isnan(score)) score = 0;
-
-                for (j = 1; j < setnum; j++) {
-                    /* It is not safe to access the zset we are
-                     * iterating, so explicitly check for equal object. */
-                    if (src[j].subject == src[0].subject) {
-                        value = zval.score*src[j].weight;
-                        zunionInterAggregate(&score,value,aggregate);
-                    } else if (zuiFind(&src[j],&zval,&value)) {
-                        value *= src[j].weight;
-                        zunionInterAggregate(&score,value,aggregate);
-                    } else {
-                        break;
-                    }
-                }
-
-                /* Only continue when present in every input. */
-                if (j == setnum) {
-                    tmp = zuiNewSdsFromValue(&zval);
-                    znode = zslInsert(dstzset->zsl,score,tmp);
-                    dictAdd(dstzset->dict,tmp,&znode->score);
-                    totelelen += sdslen(tmp);
-                    if (sdslen(tmp) > maxelelen) maxelelen = sdslen(tmp);
-                }
-            }
-            zuiClearIterator(&src[0]);
-        }
-    } else if (op == SET_OP_UNION) {
-        dict *accumulator = dictCreate(&setAccumulatorDictType,NULL);
-        dictIterator *di;
-        dictEntry *de, *existing;
-        double score;
-
-        if (setnum) {
-            /* Our union is at least as large as the largest set.
-             * Resize the dictionary ASAP to avoid useless rehashing. */
-            dictExpand(accumulator,zuiLength(&src[setnum-1]));
-        }
-
-        /* Step 1: Create a dictionary of elements -> aggregated-scores
-         * by iterating one sorted set after the other. */
-        for (i = 0; i < setnum; i++) {
-            if (zuiLength(&src[i]) == 0) continue;
-
-            zuiInitIterator(&src[i]);
-            while (zuiNext(&src[i],&zval)) {
-                /* Initialize value */
-                score = src[i].weight * zval.score;
-                if (isnan(score)) score = 0;
-
-                /* Search for this element in the accumulating dictionary. */
-                de = dictAddRaw(accumulator,zuiSdsFromValue(&zval),&existing);
-                /* If we don't have it, we need to create a new entry. */
-                if (!existing) {
-                    tmp = zuiNewSdsFromValue(&zval);
-                    /* Remember the longest single element encountered,
-                     * to understand if it's possible to convert to ziplist
-                     * at the end. */
-                     totelelen += sdslen(tmp);
-                     if (sdslen(tmp) > maxelelen) maxelelen = sdslen(tmp);
-                    /* Update the element with its initial score. */
-                    dictSetKey(accumulator, de, tmp);
-                    dictSetDoubleVal(de,score);
-                } else {
-                    /* Update the score with the score of the new instance
-                     * of the element found in the current sorted set.
-                     *
-                     * Here we access directly the dictEntry double
-                     * value inside the union as it is a big speedup
-                     * compared to using the getDouble/setDouble API. */
-                    zunionInterAggregate(&existing->v.d,score,aggregate);
-                }
-            }
-            zuiClearIterator(&src[i]);
-        }
-
-        /* Step 2: convert the dictionary into the final sorted set. */
-        di = dictGetIterator(accumulator);
-
-        /* We now are aware of the final size of the resulting sorted set,
-         * let's resize the dictionary embedded inside the sorted set to the
-         * right size, in order to save rehashing time. */
-        dictExpand(dstzset->dict,dictSize(accumulator));
-
-        while((de = dictNext(di)) != NULL) {
-            sds ele = dictGetKey(de);
-            score = dictGetDoubleVal(de);
-            znode = zslInsert(dstzset->zsl,score,ele);
-            dictAdd(dstzset->dict,ele,&znode->score);
-        }
-        dictReleaseIterator(di);
-        dictRelease(accumulator);
-    } else if (op == SET_OP_DIFF) {
-        zdiff(src, setnum, dstzset, &maxelelen, &totelelen);
-    } else {
-        serverPanic("Unknown operator");
-    }
-
-    if (dstkey) {
-        if (dstzset->zsl->length) {
-            zsetConvertToZiplistIfNeeded(dstobj, maxelelen, totelelen);
-            setKey(c, c->db, dstkey, dstobj);
-            addReplyLongLong(c, zsetLength(dstobj));
-            notifyKeyspaceEvent(NOTIFY_ZSET,
-                                (op == SET_OP_UNION) ? "zunionstore" :
-                                    (op == SET_OP_INTER ? "zinterstore" : "zdiffstore"),
-                                dstkey, c->db->id);
-            server.dirty++;
-        } else {
-            addReply(c, shared.czero);
-            if (dbDelete(c->db, dstkey)) {
-                signalModifiedKey(c, c->db, dstkey);
-                notifyKeyspaceEvent(NOTIFY_GENERIC, "del", dstkey, c->db->id);
-                server.dirty++;
-            }
-        }
-    } else {
-        unsigned long length = dstzset->zsl->length;
-        zskiplist *zsl = dstzset->zsl;
-        zskiplistNode *zn = zsl->header->level[0].forward;
-        /* In case of WITHSCORES, respond with a single array in RESP2, and
-         * nested arrays in RESP3. We can't use a map response type since the
-         * client library needs to know to respect the order. */
-        if (withscores && c->resp == 2)
-            addReplyArrayLen(c, length*2);
-        else
-            addReplyArrayLen(c, length);
-
-        while (zn != NULL) {
-            if (withscores && c->resp > 2) addReplyArrayLen(c,2);
-            addReplyBulkCBuffer(c,zn->ele,sdslen(zn->ele));
-            if (withscores) addReplyDouble(c,zn->score);
-            zn = zn->level[0].forward;
-        }
-    }
-    decrRefCount(dstobj);
-    zfree(src);
-}
-
-void zunionstoreCommand(client *c) {
-    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_UNION);
-}
-
-void zinterstoreCommand(client *c) {
-    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_INTER);
-}
-
-void zdiffstoreCommand(client *c) {
-    zunionInterDiffGenericCommand(c, c->argv[1], 2, SET_OP_DIFF);
-}
-
-void zunionCommand(client *c) {
-    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_UNION);
-}
-
-void zinterCommand(client *c) {
-    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_INTER);
-}
-
-void zdiffCommand(client *c) {
-    zunionInterDiffGenericCommand(c, NULL, 1, SET_OP_DIFF);
-}
-
-typedef enum {
-    ZRANGE_DIRECTION_AUTO = 0,
-    ZRANGE_DIRECTION_FORWARD,
-    ZRANGE_DIRECTION_REVERSE
-} zrange_direction;
-
-typedef enum {
-    ZRANGE_CONSUMER_TYPE_CLIENT = 0,
-    ZRANGE_CONSUMER_TYPE_INTERNAL
-} zrange_consumer_type;
-
-typedef struct zrange_result_handler zrange_result_handler;
-
-typedef void (*zrangeResultBeginFunction)(zrange_result_handler *c);
-typedef void (*zrangeResultFinalizeFunction)(
-    zrange_result_handler *c, size_t result_count);
-typedef void (*zrangeResultEmitCBufferFunction)(
-    zrange_result_handler *c, const void *p, size_t len, double score);
-typedef void (*zrangeResultEmitLongLongFunction)(
-    zrange_result_handler *c, long long ll, double score);
-
-void zrangeGenericCommand (zrange_result_handler *handler, int argc_start, int store,
-                           zrange_type rangetype, zrange_direction direction);
-
-/* Interface struct for ZRANGE/ZRANGESTORE generic implementation.
- * There is one implementation of this interface that sends a RESP reply to clients.
- * and one implementation that stores the range result into a zset object. */
-struct zrange_result_handler {
-    zrange_consumer_type                 type;
-    client                              *client;
-    robj                                *dstkey;
-    robj                                *dstobj;
-    void                                *userdata;
-    int                                  withscores;
-    int                                  should_emit_array_length;
-    zrangeResultBeginFunction            beginResultEmission;
-    zrangeResultFinalizeFunction         finalizeResultEmission;
-    zrangeResultEmitCBufferFunction      emitResultFromCBuffer;
-    zrangeResultEmitLongLongFunction     emitResultFromLongLong;
-};
-
-/* Result handler methods for responding the ZRANGE to clients. */
-static void zrangeResultBeginClient(zrange_result_handler *handler) {
-    handler->userdata = addReplyDeferredLen(handler->client);
-}
-
-static void zrangeResultEmitCBufferToClient(zrange_result_handler *handler,
-    const void *value, size_t value_length_in_bytes, double score)
-{
-    if (handler->should_emit_array_length) {
-        addReplyArrayLen(handler->client, 2);
-    }
-
-    addReplyBulkCBuffer(handler->client, value, value_length_in_bytes);
-
-    if (handler->withscores) {
-        addReplyDouble(handler->client, score);
-    }
-}
-
-static void zrangeResultEmitLongLongToClient(zrange_result_handler *handler,
-    long long value, double score)
-{
-    if (handler->should_emit_array_length) {
-        addReplyArrayLen(handler->client, 2);
-    }
-
-    addReplyBulkLongLong(handler->client, value);
-
-    if (handler->withscores) {
-        addReplyDouble(handler->client, score);
-    }
-}
-
-static void zrangeResultFinalizeClient(zrange_result_handler *handler,
-    size_t result_count)
-{
-    /* In case of WITHSCORES, respond with a single array in RESP2, and
-     * nested arrays in RESP3. We can't use a map response type since the
-     * client library needs to know to respect the order. */
-    if (handler->withscores && (handler->client->resp == 2)) {
-        result_count *= 2;
-    }
-
-    setDeferredArrayLen(handler->client, handler->userdata, result_count);
-}
-
-/* Result handler methods for storing the ZRANGESTORE to a zset. */
-static void zrangeResultBeginStore(zrange_result_handler *handler)
-{
-    handler->dstobj = createZsetZiplistObject();
-}
-
-static void zrangeResultEmitCBufferForStore(zrange_result_handler *handler,
-    const void *value, size_t value_length_in_bytes, double score)
-{
-    double newscore;
-    int retflags = 0;
-    sds ele = sdsnewlen(value, value_length_in_bytes);
-    int retval = zsetAdd(handler->dstobj, score, ele, ZADD_IN_NONE, &retflags, &newscore);
-    sdsfree(ele);
-    serverAssert(retval);
-}
-
-static void zrangeResultEmitLongLongForStore(zrange_result_handler *handler,
-    long long value, double score)
-{
-    double newscore;
-    int retflags = 0;
-    sds ele = sdsfromlonglong(value);
-    int retval = zsetAdd(handler->dstobj, score, ele, ZADD_IN_NONE, &retflags, &newscore);
-    sdsfree(ele);
-    serverAssert(retval);
-}
-
-static void zrangeResultFinalizeStore(zrange_result_handler *handler, size_t result_count)
-{
-    if (result_count) {
-        setKey(handler->client, handler->client->db, handler->dstkey, handler->dstobj);
-        addReplyLongLong(handler->client, result_count);
-        notifyKeyspaceEvent(NOTIFY_ZSET, "zrangestore", handler->dstkey, handler->client->db->id);
-        server.dirty++;
-    } else {
-        addReply(handler->client, shared.czero);
-        if (dbDelete(handler->client->db, handler->dstkey)) {
-            signalModifiedKey(handler->client, handler->client->db, handler->dstkey);
-            notifyKeyspaceEvent(NOTIFY_GENERIC, "del", handler->dstkey, handler->client->db->id);
-            server.dirty++;
-        }
-    }
-    decrRefCount(handler->dstobj);
-}
-
-/* Initialize the consumer interface type with the requested type. */
-static void zrangeResultHandlerInit(zrange_result_handler *handler,
-    client *client, zrange_consumer_type type)
-{
-    memset(handler, 0, sizeof(*handler));
-
-    handler->client = client;
-
-    switch (type) {
-    case ZRANGE_CONSUMER_TYPE_CLIENT:
-        handler->beginResultEmission = zrangeResultBeginClient;
-        handler->finalizeResultEmission = zrangeResultFinalizeClient;
-        handler->emitResultFromCBuffer = zrangeResultEmitCBufferToClient;
-        handler->emitResultFromLongLong = zrangeResultEmitLongLongToClient;
-        break;
-
-    case ZRANGE_CONSUMER_TYPE_INTERNAL:
-        handler->beginResultEmission = zrangeResultBeginStore;
-        handler->finalizeResultEmission = zrangeResultFinalizeStore;
-        handler->emitResultFromCBuffer = zrangeResultEmitCBufferForStore;
-        handler->emitResultFromLongLong = zrangeResultEmitLongLongForStore;
-        break;
-    }
-}
-
-static void zrangeResultHandlerScoreEmissionEnable(zrange_result_handler *handler) {
-    handler->withscores = 1;
-    handler->should_emit_array_length = (handler->client->resp > 2);
-}
-
-static void zrangeResultHandlerDestinationKeySet (zrange_result_handler *handler,
-    robj *dstkey)
-{
-    handler->dstkey = dstkey;
-}
-
-/* This command implements ZRANGE, ZREVRANGE. */
-void genericZrangebyrankCommand(zrange_result_handler *handler,
-    robj *zobj, long start, long end, int withscores, int reverse) {
-
-    client *c = handler->client;
-    long llen;
-    long rangelen;
-    size_t result_cardinality;
-
-    /* Sanitize indexes. */
-    llen = zsetLength(zobj);
-    if (start < 0) start = llen+start;
-    if (end < 0) end = llen+end;
-    if (start < 0) start = 0;
-
-    handler->beginResultEmission(handler);
-
-    /* Invariant: start >= 0, so this test will be true when end < 0.
-     * The range is empty when start > end or start >= length. */
-    if (start > end || start >= llen) {
-        handler->finalizeResultEmission(handler, 0);
-        return;
-    }
-    if (end >= llen) end = llen-1;
-    rangelen = (end-start)+1;
-    result_cardinality = rangelen;
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vlong;
-        double score = 0.0;
-
-        if (reverse)
-            eptr = ziplistIndex(zl,-2-(2*start));
-        else
-            eptr = ziplistIndex(zl,2*start);
-
-        serverAssertWithInfo(c,zobj,eptr != NULL);
-        sptr = ziplistNext(zl,eptr);
-
-        while (rangelen--) {
-            serverAssertWithInfo(c,zobj,eptr != NULL && sptr != NULL);
-            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
-
-            if (withscores) /* don't bother to extract the score if it's gonna be ignored. */
-                score = zzlGetScore(sptr);
-
-            if (vstr == NULL) {
-                handler->emitResultFromLongLong(handler, vlong, score);
-            } else {
-                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
-            }
-
-            if (reverse)
-                zzlPrev(zl,&eptr,&sptr);
-            else
-                zzlNext(zl,&eptr,&sptr);
-        }
-
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-
-        /* Check if starting point is trivial, before doing log(N) lookup. */
-        if (reverse) {
-            ln = zsl->tail;
-            if (start > 0)
-                ln = zslGetElementByRank(zsl,llen-start);
-        } else {
-            ln = zsl->header->level[0].forward;
-            if (start > 0)
-                ln = zslGetElementByRank(zsl,start+1);
-        }
-
-        while(rangelen--) {
-            serverAssertWithInfo(c,zobj,ln != NULL);
-            sds ele = ln->ele;
-            handler->emitResultFromCBuffer(handler, ele, sdslen(ele), ln->score);
-            ln = reverse ? ln->backward : ln->level[0].forward;
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    handler->finalizeResultEmission(handler, result_cardinality);
-}
-
-/* ZRANGESTORE <dst> <src> <min> <max> [BYSCORE | BYLEX] [REV] [LIMIT offset count] */
-void zrangestoreCommand (client *c) {
-    robj *dstkey = c->argv[1];
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_INTERNAL);
-    zrangeResultHandlerDestinationKeySet(&handler, dstkey);
-    zrangeGenericCommand(&handler, 2, 1, ZRANGE_AUTO, ZRANGE_DIRECTION_AUTO);
-}
-
-/* ZRANGE <key> <min> <max> [BYSCORE | BYLEX] [REV] [WITHSCORES] [LIMIT offset count] */
-void zrangeCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_AUTO, ZRANGE_DIRECTION_AUTO);
-}
-
-/* ZREVRANGE <key> <min> <max> [WITHSCORES] */
-void zrevrangeCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_RANK, ZRANGE_DIRECTION_REVERSE);
-}
-
-/* This command implements ZRANGEBYSCORE, ZREVRANGEBYSCORE. */
-void genericZrangebyscoreCommand(zrange_result_handler *handler,
-    zrangespec *range, robj *zobj, long offset, long limit, 
-    int reverse) {
-
-    client *c = handler->client;
-    unsigned long rangelen = 0;
-
-    handler->beginResultEmission(handler);
-
-    /* For invalid offset, return directly. */
-    if (offset > 0 && offset >= (long)zsetLength(zobj)) {
-        handler->finalizeResultEmission(handler, 0);
-        return;
-    }
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vlong;
-
-        /* If reversed, get the last node in range as starting point. */
-        if (reverse) {
-            eptr = zzlLastInRange(zl,range);
-        } else {
-            eptr = zzlFirstInRange(zl,range);
-        }
-
-        /* Get score pointer for the first element. */
-        if (eptr)
-            sptr = ziplistNext(zl,eptr);
-
-        /* If there is an offset, just traverse the number of elements without
-         * checking the score because that is done in the next loop. */
-        while (eptr && offset--) {
-            if (reverse) {
-                zzlPrev(zl,&eptr,&sptr);
-            } else {
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-
-        while (eptr && limit--) {
-            double score = zzlGetScore(sptr);
-
-            /* Abort when the node is no longer in range. */
-            if (reverse) {
-                if (!zslValueGteMin(score,range)) break;
-            } else {
-                if (!zslValueLteMax(score,range)) break;
-            }
-
-            /* We know the element exists, so ziplistGet should always
-             * succeed */
-            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
-
-            rangelen++;
-            if (vstr == NULL) {
-                handler->emitResultFromLongLong(handler, vlong, score);
-            } else {
-                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
-            }
-
-            /* Move to next node */
-            if (reverse) {
-                zzlPrev(zl,&eptr,&sptr);
-            } else {
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-
-        /* If reversed, get the last node in range as starting point. */
-        if (reverse) {
-            ln = zslLastInRange(zsl,range);
-        } else {
-            ln = zslFirstInRange(zsl,range);
-        }
-
-        /* If there is an offset, just traverse the number of elements without
-         * checking the score because that is done in the next loop. */
-        while (ln && offset--) {
-            if (reverse) {
-                ln = ln->backward;
-            } else {
-                ln = ln->level[0].forward;
-            }
-        }
-
-        while (ln && limit--) {
-            /* Abort when the node is no longer in range. */
-            if (reverse) {
-                if (!zslValueGteMin(ln->score,range)) break;
-            } else {
-                if (!zslValueLteMax(ln->score,range)) break;
-            }
-
-            rangelen++;
-            handler->emitResultFromCBuffer(handler, ln->ele, sdslen(ln->ele), ln->score);
-
-            /* Move to next node */
-            if (reverse) {
-                ln = ln->backward;
-            } else {
-                ln = ln->level[0].forward;
-            }
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    handler->finalizeResultEmission(handler, rangelen);
-}
-
-/* ZRANGEBYSCORE <key> <min> <max> [WITHSCORES] [LIMIT offset count] */
-void zrangebyscoreCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_SCORE, ZRANGE_DIRECTION_FORWARD);
-}
-
-/* ZREVRANGEBYSCORE <key> <min> <max> [WITHSCORES] [LIMIT offset count] */
-void zrevrangebyscoreCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_SCORE, ZRANGE_DIRECTION_REVERSE);
-}
-
-void zcountCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    zrangespec range;
-    unsigned long count = 0;
-
-    /* Parse the range arguments */
-    if (zslParseRange(c->argv[2],c->argv[3],&range) != C_OK) {
-        addReplyError(c,"min or max is not a float");
-        return;
-    }
-
-    /* Lookup the sorted set */
-    if ((zobj = lookupKeyReadOrReply(c, key, shared.czero)) == NULL ||
-        checkType(c, zobj, OBJ_ZSET)) return;
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        double score;
-
-        /* Use the first element in range as the starting point */
-        eptr = zzlFirstInRange(zl,&range);
-
-        /* No "first" element */
-        if (eptr == NULL) {
-            addReply(c, shared.czero);
-            return;
-        }
-
-        /* First element is in range */
-        sptr = ziplistNext(zl,eptr);
-        score = zzlGetScore(sptr);
-        serverAssertWithInfo(c,zobj,zslValueLteMax(score,&range));
-
-        /* Iterate over elements in range */
-        while (eptr) {
-            score = zzlGetScore(sptr);
-
-            /* Abort when the node is no longer in range. */
-            if (!zslValueLteMax(score,&range)) {
-                break;
-            } else {
-                count++;
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *zn;
-        unsigned long rank;
-
-        /* Find first element in range */
-        zn = zslFirstInRange(zsl, &range);
-
-        /* Use rank of first element, if any, to determine preliminary count */
-        if (zn != NULL) {
-            rank = zslGetRank(zsl, zn->score, zn->ele);
-            count = (zsl->length - (rank - 1));
-
-            /* Find last element in range */
-            zn = zslLastInRange(zsl, &range);
-
-            /* Use rank of last element, if any, to determine the actual count */
-            if (zn != NULL) {
-                rank = zslGetRank(zsl, zn->score, zn->ele);
-                count -= (zsl->length - rank);
-            }
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    addReplyLongLong(c, count);
-}
-
-void zlexcountCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    zlexrangespec range;
-    unsigned long count = 0;
-
-    /* Parse the range arguments */
-    if (zslParseLexRange(c->argv[2],c->argv[3],&range) != C_OK) {
-        addReplyError(c,"min or max not valid string range item");
-        return;
-    }
-
-    /* Lookup the sorted set */
-    if ((zobj = lookupKeyReadOrReply(c, key, shared.czero)) == NULL ||
-        checkType(c, zobj, OBJ_ZSET))
-    {
-        zslFreeLexRange(&range);
-        return;
-    }
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-
-        /* Use the first element in range as the starting point */
-        eptr = zzlFirstInLexRange(zl,&range);
-
-        /* No "first" element */
-        if (eptr == NULL) {
-            zslFreeLexRange(&range);
-            addReply(c, shared.czero);
-            return;
-        }
-
-        /* First element is in range */
-        sptr = ziplistNext(zl,eptr);
-        serverAssertWithInfo(c,zobj,zzlLexValueLteMax(eptr,&range));
-
-        /* Iterate over elements in range */
-        while (eptr) {
-            /* Abort when the node is no longer in range. */
-            if (!zzlLexValueLteMax(eptr,&range)) {
-                break;
-            } else {
-                count++;
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *zn;
-        unsigned long rank;
-
-        /* Find first element in range */
-        zn = zslFirstInLexRange(zsl, &range);
-
-        /* Use rank of first element, if any, to determine preliminary count */
-        if (zn != NULL) {
-            rank = zslGetRank(zsl, zn->score, zn->ele);
-            count = (zsl->length - (rank - 1));
-
-            /* Find last element in range */
-            zn = zslLastInLexRange(zsl, &range);
-
-            /* Use rank of last element, if any, to determine the actual count */
-            if (zn != NULL) {
-                rank = zslGetRank(zsl, zn->score, zn->ele);
-                count -= (zsl->length - rank);
-            }
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    zslFreeLexRange(&range);
-    addReplyLongLong(c, count);
-}
-
-/* This command implements ZRANGEBYLEX, ZREVRANGEBYLEX. */
-void genericZrangebylexCommand(zrange_result_handler *handler,
-    zlexrangespec *range, robj *zobj, int withscores, long offset, long limit,
-    int reverse)
-{
-    client *c = handler->client;
-    unsigned long rangelen = 0;
-
-    handler->beginResultEmission(handler);
-
-    if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-        unsigned char *zl = zobj->ptr;
-        unsigned char *eptr, *sptr;
-        unsigned char *vstr;
-        unsigned int vlen;
-        long long vlong;
-
-        /* If reversed, get the last node in range as starting point. */
-        if (reverse) {
-            eptr = zzlLastInLexRange(zl,range);
-        } else {
-            eptr = zzlFirstInLexRange(zl,range);
-        }
-
-        /* Get score pointer for the first element. */
-        if (eptr)
-            sptr = ziplistNext(zl,eptr);
-
-        /* If there is an offset, just traverse the number of elements without
-         * checking the score because that is done in the next loop. */
-        while (eptr && offset--) {
-            if (reverse) {
-                zzlPrev(zl,&eptr,&sptr);
-            } else {
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-
-        while (eptr && limit--) {
-            double score = 0;
-            if (withscores) /* don't bother to extract the score if it's gonna be ignored. */
-                score = zzlGetScore(sptr);
-
-            /* Abort when the node is no longer in range. */
-            if (reverse) {
-                if (!zzlLexValueGteMin(eptr,range)) break;
-            } else {
-                if (!zzlLexValueLteMax(eptr,range)) break;
-            }
-
-            /* We know the element exists, so ziplistGet should always
-             * succeed. */
-            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
-
-            rangelen++;
-            if (vstr == NULL) {
-                handler->emitResultFromLongLong(handler, vlong, score);
-            } else {
-                handler->emitResultFromCBuffer(handler, vstr, vlen, score);
-            }
-
-            /* Move to next node */
-            if (reverse) {
-                zzlPrev(zl,&eptr,&sptr);
-            } else {
-                zzlNext(zl,&eptr,&sptr);
-            }
-        }
-    } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-        zset *zs = zobj->ptr;
-        zskiplist *zsl = zs->zsl;
-        zskiplistNode *ln;
-
-        /* If reversed, get the last node in range as starting point. */
-        if (reverse) {
-            ln = zslLastInLexRange(zsl,range);
-        } else {
-            ln = zslFirstInLexRange(zsl,range);
-        }
-
-        /* If there is an offset, just traverse the number of elements without
-         * checking the score because that is done in the next loop. */
-        while (ln && offset--) {
-            if (reverse) {
-                ln = ln->backward;
-            } else {
-                ln = ln->level[0].forward;
-            }
-        }
-
-        while (ln && limit--) {
-            /* Abort when the node is no longer in range. */
-            if (reverse) {
-                if (!zslLexValueGteMin(ln->ele,range)) break;
-            } else {
-                if (!zslLexValueLteMax(ln->ele,range)) break;
-            }
-
-            rangelen++;
-            handler->emitResultFromCBuffer(handler, ln->ele, sdslen(ln->ele), ln->score);
-
-            /* Move to next node */
-            if (reverse) {
-                ln = ln->backward;
-            } else {
-                ln = ln->level[0].forward;
-            }
-        }
-    } else {
-        serverPanic("Unknown sorted set encoding");
-    }
-
-    handler->finalizeResultEmission(handler, rangelen);
-}
-
-/* ZRANGEBYLEX <key> <min> <max> [LIMIT offset count] */
-void zrangebylexCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_LEX, ZRANGE_DIRECTION_FORWARD);
-}
-
-/* ZREVRANGEBYLEX <key> <min> <max> [LIMIT offset count] */
-void zrevrangebylexCommand(client *c) {
-    zrange_result_handler handler;
-    zrangeResultHandlerInit(&handler, c, ZRANGE_CONSUMER_TYPE_CLIENT);
-    zrangeGenericCommand(&handler, 1, 0, ZRANGE_LEX, ZRANGE_DIRECTION_REVERSE);
-}
-
-/**
- * This function handles ZRANGE and ZRANGESTORE, and also the deprecated
- * Z[REV]RANGE[BYPOS|BYLEX] commands.
- *
- * The simple ZRANGE and ZRANGESTORE can take _AUTO in rangetype and direction,
- * other command pass explicit value.
- *
- * The argc_start points to the src key argument, so following syntax is like:
- * <src> <min> <max> [BYSCORE | BYLEX] [REV] [WITHSCORES] [LIMIT offset count]
- */
-void zrangeGenericCommand(zrange_result_handler *handler, int argc_start, int store,
-                          zrange_type rangetype, zrange_direction direction)
-{
-    client *c = handler->client;
-    robj *key = c->argv[argc_start];
-    robj *zobj;
-    zrangespec range;
-    zlexrangespec lexrange;
-    int minidx = argc_start + 1;
-    int maxidx = argc_start + 2;
-
-    /* Options common to all */
-    long opt_start = 0;
-    long opt_end = 0;
-    int opt_withscores = 0;
-    long opt_offset = 0;
-    long opt_limit = -1;
-
-    /* Step 1: Skip the <src> <min> <max> args and parse remaining optional arguments. */
-    for (int j=argc_start + 3; j < c->argc; j++) {
-        int leftargs = c->argc-j-1;
-        if (!store && !strcasecmp(c->argv[j]->ptr,"withscores")) {
-            opt_withscores = 1;
-        } else if (!strcasecmp(c->argv[j]->ptr,"limit") && leftargs >= 2) {
-            if ((getLongFromObjectOrReply(c, c->argv[j+1], &opt_offset, NULL) != C_OK) ||
-                (getLongFromObjectOrReply(c, c->argv[j+2], &opt_limit, NULL) != C_OK))
-            {
-                return;
-            }
-            j += 2;
-        } else if (direction == ZRANGE_DIRECTION_AUTO &&
-                   !strcasecmp(c->argv[j]->ptr,"rev"))
-        {
-            direction = ZRANGE_DIRECTION_REVERSE;
-        } else if (rangetype == ZRANGE_AUTO &&
-                   !strcasecmp(c->argv[j]->ptr,"bylex"))
-        {
-            rangetype = ZRANGE_LEX;
-        } else if (rangetype == ZRANGE_AUTO &&
-                   !strcasecmp(c->argv[j]->ptr,"byscore"))
-        {
-            rangetype = ZRANGE_SCORE;
-        } else {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        }
-    }
-
-    /* Use defaults if not overriden by arguments. */
-    if (direction == ZRANGE_DIRECTION_AUTO)
-        direction = ZRANGE_DIRECTION_FORWARD;
-    if (rangetype == ZRANGE_AUTO)
-        rangetype = ZRANGE_RANK;
-
-    /* Check for conflicting arguments. */
-    if (opt_limit != -1 && rangetype == ZRANGE_RANK) {
-        addReplyError(c,"syntax error, LIMIT is only supported in combination with either BYSCORE or BYLEX");
-        return;
-    }
-    if (opt_withscores && rangetype == ZRANGE_LEX) {
-        addReplyError(c,"syntax error, WITHSCORES not supported in combination with BYLEX");
-        return;
-    }
-
-    if (direction == ZRANGE_DIRECTION_REVERSE &&
-        ((ZRANGE_SCORE == rangetype) || (ZRANGE_LEX == rangetype)))
-    {
-        /* Range is given as [max,min] */
-        int tmp = maxidx;
-        maxidx = minidx;
-        minidx = tmp;
-    }
-
-    /* Step 2: Parse the range. */
-    switch (rangetype) {
-    case ZRANGE_AUTO:
-    case ZRANGE_RANK:
-        /* Z[REV]RANGE, ZRANGESTORE [REV]RANGE */
-        if ((getLongFromObjectOrReply(c, c->argv[minidx], &opt_start,NULL) != C_OK) ||
-            (getLongFromObjectOrReply(c, c->argv[maxidx], &opt_end,NULL) != C_OK))
-        {
-            return;
-        }
-        break;
-
-    case ZRANGE_SCORE:
-        /* Z[REV]RANGEBYSCORE, ZRANGESTORE [REV]RANGEBYSCORE */
-        if (zslParseRange(c->argv[minidx], c->argv[maxidx], &range) != C_OK) {
-            addReplyError(c, "min or max is not a float");
-            return;
-        }
-        break;
-
-    case ZRANGE_LEX:
-        /* Z[REV]RANGEBYLEX, ZRANGESTORE [REV]RANGEBYLEX */
-        if (zslParseLexRange(c->argv[minidx], c->argv[maxidx], &lexrange) != C_OK) {
-            addReplyError(c, "min or max not valid string range item");
-            return;
-        }
-        break;
-    }
-
-    if (opt_withscores || store) {
-        zrangeResultHandlerScoreEmissionEnable(handler);
-    }
-
-    /* Step 3: Lookup the key and get the range. */
-    zobj = handler->dstkey ?
-        lookupKeyWrite(c->db,key) :
-        lookupKeyRead(c->db,key);
-    if (zobj == NULL) {
-        if (store) {
-            handler->beginResultEmission(handler);
-            handler->finalizeResultEmission(handler, 0);
-        } else {
-            addReply(c, shared.emptyarray);
-        }
-        goto cleanup;
-    }
-
-    if (checkType(c,zobj,OBJ_ZSET)) goto cleanup;
-
-    /* Step 4: Pass this to the command-specific handler. */
-    switch (rangetype) {
-    case ZRANGE_AUTO:
-    case ZRANGE_RANK:
-        genericZrangebyrankCommand(handler, zobj, opt_start, opt_end,
-            opt_withscores || store, direction == ZRANGE_DIRECTION_REVERSE);
-        break;
-
-    case ZRANGE_SCORE:
-        genericZrangebyscoreCommand(handler, &range, zobj, opt_offset,
-            opt_limit, direction == ZRANGE_DIRECTION_REVERSE);
-        break;
-
-    case ZRANGE_LEX:
-        genericZrangebylexCommand(handler, &lexrange, zobj, opt_withscores || store,
-            opt_offset, opt_limit, direction == ZRANGE_DIRECTION_REVERSE);
-        break;
-    }
-
-    /* Instead of returning here, we'll just fall-through the clean-up. */
-
-cleanup:
-
-    if (rangetype == ZRANGE_LEX) {
-        zslFreeLexRange(&lexrange);
-    }
-}
-
-void zcardCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-
-    if ((zobj = lookupKeyReadOrReply(c,key,shared.czero)) == NULL ||
-        checkType(c,zobj,OBJ_ZSET)) return;
-
-    addReplyLongLong(c,zsetLength(zobj));
-}
-
-void zscoreCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    double score;
-
-    if ((zobj = lookupKeyReadOrReply(c,key,shared.null[c->resp])) == NULL ||
-        checkType(c,zobj,OBJ_ZSET)) return;
-
-    if (zsetScore(zobj,c->argv[2]->ptr,&score) == C_ERR) {
-        addReplyNull(c);
-    } else {
-        addReplyDouble(c,score);
-    }
-}
-
-void zmscoreCommand(client *c) {
-    robj *key = c->argv[1];
-    robj *zobj;
-    double score;
-    zobj = lookupKeyRead(c->db,key);
-    if (checkType(c,zobj,OBJ_ZSET)) return;
-
-    addReplyArrayLen(c,c->argc - 2);
-    for (int j = 2; j < c->argc; j++) {
-        /* Treat a missing set the same way as an empty set */
-        if (zobj == NULL || zsetScore(zobj,c->argv[j]->ptr,&score) == C_ERR) {
-            addReplyNull(c);
-        } else {
-            addReplyDouble(c,score);
-        }
-    }
-}
-
-void zrankGenericCommand(client *c, int reverse) {
-    robj *key = c->argv[1];
-    robj *ele = c->argv[2];
-    robj *zobj;
-    long rank;
-
-    if ((zobj = lookupKeyReadOrReply(c,key,shared.null[c->resp])) == NULL ||
-        checkType(c,zobj,OBJ_ZSET)) return;
-
-    serverAssertWithInfo(c,ele,sdsEncodedObject(ele));
-    rank = zsetRank(zobj,ele->ptr,reverse);
-    if (rank >= 0) {
-        addReplyLongLong(c,rank);
-    } else {
-        addReplyNull(c);
-    }
-}
-
-void zrankCommand(client *c) {
-    zrankGenericCommand(c, 0);
-}
-
-void zrevrankCommand(client *c) {
-    zrankGenericCommand(c, 1);
-}
-
-void zscanCommand(client *c) {
-    robj *o;
-    unsigned long cursor;
-
-    if (parseScanCursorOrReply(c,c->argv[2],&cursor) == C_ERR) return;
-    if ((o = lookupKeyReadOrReply(c,c->argv[1],shared.emptyscan)) == NULL ||
-        checkType(c,o,OBJ_ZSET)) return;
-    scanGenericCommand(c,o,cursor);
-}
-
-/* This command implements the generic zpop operation, used by:
- * ZPOPMIN, ZPOPMAX, BZPOPMIN and BZPOPMAX. This function is also used
- * inside blocked.c in the unblocking stage of BZPOPMIN and BZPOPMAX.
- *
- * If 'emitkey' is true also the key name is emitted, useful for the blocking
- * behavior of BZPOP[MIN|MAX], since we can block into multiple keys.
- *
- * The synchronous version instead does not need to emit the key, but may
- * use the 'count' argument to return multiple items if available. */
-void genericZpopCommand(client *c, robj **keyv, int keyc, int where, int emitkey, robj *countarg) {
-    int idx;
-    robj *key = NULL;
-    robj *zobj = NULL;
-    sds ele;
-    double score;
-    long count = 1;
-
-    /* If a count argument as passed, parse it or return an error. */
-    if (countarg) {
-        if (getLongFromObjectOrReply(c,countarg,&count,NULL) != C_OK)
-            return;
-        if (count <= 0) {
-            addReply(c,shared.emptyarray);
-            return;
-        }
-    }
-
-    /* Check type and break on the first error, otherwise identify candidate. */
-    idx = 0;
-    while (idx < keyc) {
-        key = keyv[idx++];
-        zobj = lookupKeyWrite(c->db,key);
-        if (!zobj) continue;
-        if (checkType(c,zobj,OBJ_ZSET)) return;
-        break;
-    }
-
-    /* No candidate for zpopping, return empty. */
-    if (!zobj) {
-        addReply(c,shared.emptyarray);
-        return;
-    }
-
-    void *arraylen_ptr = addReplyDeferredLen(c);
-    long result_count = 0;
-
-    /* We emit the key only for the blocking variant. */
-    if (emitkey) addReplyBulk(c,key);
-
-    /* Respond with a single (flat) array in RESP2 or if countarg is not
-     * provided (returning a single element). In RESP3, when countarg is
-     * provided, use nested array.  */
-    int use_nested_array = c->resp > 2 && countarg != NULL;
-
-    /* Remove the element. */
-    do {
-        if (zobj->encoding == OBJ_ENCODING_ZIPLIST) {
-            unsigned char *zl = zobj->ptr;
-            unsigned char *eptr, *sptr;
-            unsigned char *vstr;
-            unsigned int vlen;
-            long long vlong;
-
-            /* Get the first or last element in the sorted set. */
-            eptr = ziplistIndex(zl,where == ZSET_MAX ? -2 : 0);
-            serverAssertWithInfo(c,zobj,eptr != NULL);
-            serverAssertWithInfo(c,zobj,ziplistGet(eptr,&vstr,&vlen,&vlong));
-            if (vstr == NULL)
-                ele = sdsfromlonglong(vlong);
-            else
-                ele = sdsnewlen(vstr,vlen);
-
-            /* Get the score. */
-            sptr = ziplistNext(zl,eptr);
-            serverAssertWithInfo(c,zobj,sptr != NULL);
-            score = zzlGetScore(sptr);
-        } else if (zobj->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = zobj->ptr;
-            zskiplist *zsl = zs->zsl;
-            zskiplistNode *zln;
-
-            /* Get the first or last element in the sorted set. */
-            zln = (where == ZSET_MAX ? zsl->tail :
-                                       zsl->header->level[0].forward);
-
-            /* There must be an element in the sorted set. */
-            serverAssertWithInfo(c,zobj,zln != NULL);
-            ele = sdsdup(zln->ele);
-            score = zln->score;
-        } else {
-            serverPanic("Unknown sorted set encoding");
-        }
-
-        serverAssertWithInfo(c,zobj,zsetDel(zobj,ele));
-        server.dirty++;
-
-        if (result_count == 0) { /* Do this only for the first iteration. */
-            char *events[2] = {"zpopmin","zpopmax"};
-            notifyKeyspaceEvent(NOTIFY_ZSET,events[where],key,c->db->id);
-            signalModifiedKey(c,c->db,key);
-        }
-
-        if (use_nested_array) {
-            addReplyArrayLen(c,2);
-        }
-        addReplyBulkCBuffer(c,ele,sdslen(ele));
-        addReplyDouble(c,score);
-        sdsfree(ele);
-        ++result_count;
-
-        /* Remove the key, if indeed needed. */
-        if (zsetLength(zobj) == 0) {
-            dbDelete(c->db,key);
-            notifyKeyspaceEvent(NOTIFY_GENERIC,"del",key,c->db->id);
-            break;
-        }
-    } while(--count);
-
-    if (!use_nested_array) {
-        result_count *= 2;
-    }
-    setDeferredArrayLen(c,arraylen_ptr,result_count + (emitkey != 0));
-}
-
-/* ZPOPMIN key [<count>] */
-void zpopminCommand(client *c) {
-    if (c->argc > 3) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-    genericZpopCommand(c,&c->argv[1],1,ZSET_MIN,0,
-        c->argc == 3 ? c->argv[2] : NULL);
-}
-
-/* ZMAXPOP key [<count>] */
-void zpopmaxCommand(client *c) {
-    if (c->argc > 3) {
-        addReplyErrorObject(c,shared.syntaxerr);
-        return;
-    }
-    genericZpopCommand(c,&c->argv[1],1,ZSET_MAX,0,
-        c->argc == 3 ? c->argv[2] : NULL);
-}
-
-/* BZPOPMIN / BZPOPMAX actual implementation. */
-void blockingGenericZpopCommand(client *c, int where) {
-    robj *o;
-    mstime_t timeout;
-    int j;
-
-    if (getTimeoutFromObjectOrReply(c,c->argv[c->argc-1],&timeout,UNIT_SECONDS)
-        != C_OK) return;
-
-    for (j = 1; j < c->argc-1; j++) {
-        o = lookupKeyWrite(c->db,c->argv[j]);
-        if (checkType(c,o,OBJ_ZSET)) return;
-        if (o != NULL) {
-            if (zsetLength(o) != 0) {
-                /* Non empty zset, this is like a normal ZPOP[MIN|MAX]. */
-                genericZpopCommand(c,&c->argv[j],1,where,1,NULL);
-                /* Replicate it as an ZPOP[MIN|MAX] instead of BZPOP[MIN|MAX]. */
-                rewriteClientCommandVector(c,2,
-                    where == ZSET_MAX ? shared.zpopmax : shared.zpopmin,
-                    c->argv[j]);
-                return;
-            }
-        }
-    }
-
-    /* If we are not allowed to block the client and the zset is empty the only thing
-     * we can do is treating it as a timeout (even with timeout 0). */
-    if (c->flags & CLIENT_DENY_BLOCKING) {
-        addReplyNullArray(c);
-        return;
-    }
-
-    /* If the keys do not exist we must block */
-    blockForKeys(c,BLOCKED_ZSET,c->argv + 1,c->argc - 2,timeout,NULL,NULL,NULL);
-}
-
-// BZPOPMIN key [key ...] timeout
-void bzpopminCommand(client *c) {
-    blockingGenericZpopCommand(c,ZSET_MIN);
-}
-
-// BZPOPMAX key [key ...] timeout
-void bzpopmaxCommand(client *c) {
-    blockingGenericZpopCommand(c,ZSET_MAX);
-}
-
-static void zarndmemberReplyWithZiplist(client *c, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
-    for (unsigned long i = 0; i < count; i++) {
-        if (vals && c->resp > 2)
-            addReplyArrayLen(c,2);
-        if (keys[i].sval)
-            addReplyBulkCBuffer(c, keys[i].sval, keys[i].slen);
-        else
-            addReplyBulkLongLong(c, keys[i].lval);
-        if (vals) {
-            if (vals[i].sval) {
-                addReplyDouble(c, zzlStrtod(vals[i].sval,vals[i].slen));
-            } else
-                addReplyDouble(c, vals[i].lval);
-        }
-    }
-}
-
-/* How many times bigger should be the zset compared to the requested size
- * for us to not use the "remove elements" strategy? Read later in the
- * implementation for more info. */
-#define ZRANDMEMBER_SUB_STRATEGY_MUL 3
-
-/* If client is trying to ask for a very large number of random elements,
- * queuing may consume an unlimited amount of memory, so we want to limit
- * the number of randoms per time. */
-#define ZRANDMEMBER_RANDOM_SAMPLE_LIMIT 1000
-
-void zrandmemberWithCountCommand(client *c, long l, int withscores) {
-    unsigned long count, size;
-    int uniq = 1;
-    robj *zsetobj;
-
-    if ((zsetobj = lookupKeyReadOrReply(c, c->argv[1], shared.emptyarray))
-        == NULL || checkType(c, zsetobj, OBJ_ZSET)) return;
-    size = zsetLength(zsetobj);
-
-    if(l >= 0) {
-        count = (unsigned long) l;
-    } else {
-        count = -l;
-        uniq = 0;
-    }
-
-    /* If count is zero, serve it ASAP to avoid special cases later. */
-    if (count == 0) {
-        addReply(c,shared.emptyarray);
-        return;
-    }
-
-    /* CASE 1: The count was negative, so the extraction method is just:
-     * "return N random elements" sampling the whole set every time.
-     * This case is trivial and can be served without auxiliary data
-     * structures. This case is the only one that also needs to return the
-     * elements in random order. */
-    if (!uniq || count == 1) {
-        if (withscores && c->resp == 2)
-            addReplyArrayLen(c, count*2);
-        else
-            addReplyArrayLen(c, count);
-        if (zsetobj->encoding == OBJ_ENCODING_SKIPLIST) {
-            zset *zs = zsetobj->ptr;
-            while (count--) {
-                dictEntry *de = dictGetFairRandomKey(zs->dict);
-                sds key = dictGetKey(de);
-                if (withscores && c->resp > 2)
-                    addReplyArrayLen(c,2);
-                addReplyBulkCBuffer(c, key, sdslen(key));
-                if (withscores)
-                    addReplyDouble(c, *(double*)dictGetVal(de));
-            }
-        } else if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
-            ziplistEntry *keys, *vals = NULL;
-            unsigned long limit, sample_count;
-            limit = count > ZRANDMEMBER_RANDOM_SAMPLE_LIMIT ? ZRANDMEMBER_RANDOM_SAMPLE_LIMIT : count;
-            keys = zmalloc(sizeof(ziplistEntry)*limit);
-            if (withscores)
-                vals = zmalloc(sizeof(ziplistEntry)*limit);
-            while (count) {
-                sample_count = count > limit ? limit : count;
-                count -= sample_count;
-                ziplistRandomPairs(zsetobj->ptr, sample_count, keys, vals);
-                zarndmemberReplyWithZiplist(c, sample_count, keys, vals);
-            }
-            zfree(keys);
-            zfree(vals);
-        }
-        return;
-    }
-
-    zsetopsrc src;
-    zsetopval zval;
-    src.subject = zsetobj;
-    src.type = zsetobj->type;
-    src.encoding = zsetobj->encoding;
-    zuiInitIterator(&src);
-    memset(&zval, 0, sizeof(zval));
-
-    /* Initiate reply count, RESP3 responds with nested array, RESP2 with flat one. */
-    long reply_size = count < size ? count : size;
-    if (withscores && c->resp == 2)
-        addReplyArrayLen(c, reply_size*2);
-    else
-        addReplyArrayLen(c, reply_size);
-
-    /* CASE 2:
-    * The number of requested elements is greater than the number of
-    * elements inside the zset: simply return the whole zset. */
-    if (count >= size) {
-        while (zuiNext(&src, &zval)) {
-            if (withscores && c->resp > 2)
-                addReplyArrayLen(c,2);
-            addReplyBulkSds(c, zuiNewSdsFromValue(&zval));
-            if (withscores)
-                addReplyDouble(c, zval.score);
-        }
-        return;
-    }
-
-    /* CASE 3:
-     * The number of elements inside the zset is not greater than
-     * ZRANDMEMBER_SUB_STRATEGY_MUL times the number of requested elements.
-     * In this case we create a dict from scratch with all the elements, and
-     * subtract random elements to reach the requested number of elements.
-     *
-     * This is done because if the number of requested elements is just
-     * a bit less than the number of elements in the set, the natural approach
-     * used into CASE 4 is highly inefficient. */
-    if (count*ZRANDMEMBER_SUB_STRATEGY_MUL > size) {
-        dict *d = dictCreate(&sdsReplyDictType, NULL);
-        dictExpand(d, size);
-        /* Add all the elements into the temporary dictionary. */
-        while (zuiNext(&src, &zval)) {
-            sds key = zuiNewSdsFromValue(&zval);
-            dictEntry *de = dictAddRaw(d, key, NULL);
-            serverAssert(de);
-            if (withscores)
-                dictSetDoubleVal(de, zval.score);
-        }
-        serverAssert(dictSize(d) == size);
-
-        /* Remove random elements to reach the right count. */
-        while (size > count) {
-            dictEntry *de;
-            de = dictGetRandomKey(d);
-            dictUnlink(d,dictGetKey(de));
-            sdsfree(dictGetKey(de));
-            dictFreeUnlinkedEntry(d,de);
-            size--;
-        }
-
-        /* Reply with what's in the dict and release memory */
-        dictIterator *di;
-        dictEntry *de;
-        di = dictGetIterator(d);
-        while ((de = dictNext(di)) != NULL) {
-            if (withscores && c->resp > 2)
-                addReplyArrayLen(c,2);
-            addReplyBulkSds(c, dictGetKey(de));
-            if (withscores)
-                addReplyDouble(c, dictGetDoubleVal(de));
-        }
-
-        dictReleaseIterator(di);
-        dictRelease(d);
-    }
-
-    /* CASE 4: We have a big zset compared to the requested number of elements.
-     * In this case we can simply get random elements from the zset and add
-     * to the temporary set, trying to eventually get enough unique elements
-     * to reach the specified count. */
-    else {
-        if (zsetobj->encoding == OBJ_ENCODING_ZIPLIST) {
-            /* it is inefficient to repeatedly pick one random element from a
-             * ziplist. so we use this instead: */
-            ziplistEntry *keys, *vals = NULL;
-            keys = zmalloc(sizeof(ziplistEntry)*count);
-            if (withscores)
-                vals = zmalloc(sizeof(ziplistEntry)*count);
-            serverAssert(ziplistRandomPairsUnique(zsetobj->ptr, count, keys, vals) == count);
-            zarndmemberReplyWithZiplist(c, count, keys, vals);
-            zfree(keys);
-            zfree(vals);
-            return;
-        }
-
-        /* Hashtable encoding (generic implementation) */
-        unsigned long added = 0;
-        dict *d = dictCreate(&hashDictType, NULL);
-        dictExpand(d, count);
-
-        while (added < count) {
-            ziplistEntry key;
-            double score;
-            zsetTypeRandomElement(zsetobj, size, &key, withscores ? &score: NULL);
-
-            /* Try to add the object to the dictionary. If it already exists
-            * free it, otherwise increment the number of objects we have
-            * in the result dictionary. */
-            sds skey = zsetSdsFromZiplistEntry(&key);
-            if (dictAdd(d,skey,NULL) != DICT_OK) {
-                sdsfree(skey);
-                continue;
-            }
-            added++;
-
-            if (withscores && c->resp > 2)
-                addReplyArrayLen(c,2);
-            zsetReplyFromZiplistEntry(c, &key);
-            if (withscores)
-                addReplyDouble(c, score);
-        }
-
-        /* Release memory */
-        dictRelease(d);
-    }
-}
-
-/* ZRANDMEMBER key [<count> [WITHSCORES]] */
-void zrandmemberCommand(client *c) {
-    long l;
-    int withscores = 0;
-    robj *zset;
-    ziplistEntry ele;
-
-    if (c->argc >= 3) {
-        if (getLongFromObjectOrReply(c,c->argv[2],&l,NULL) != C_OK) return;
-        if (c->argc > 4 || (c->argc == 4 && strcasecmp(c->argv[3]->ptr,"withscores"))) {
-            addReplyErrorObject(c,shared.syntaxerr);
-            return;
-        } else if (c->argc == 4)
-            withscores = 1;
-        zrandmemberWithCountCommand(c, l, withscores);
-        return;
-    }
-
-    /* Handle variant without <count> argument. Reply with simple bulk string */
-    if ((zset = lookupKeyReadOrReply(c,c->argv[1],shared.null[c->resp]))== NULL ||
-        checkType(c,zset,OBJ_ZSET)) {
-        return;
-    }
-
-    zsetTypeRandomElement(zset, zsetLength(zset), &ele,NULL);
-    zsetReplyFromZiplistEntry(c,&ele);
-}
diff --git a/redis-stable/src/testhelp.h b/redis-stable/src/testhelp.h
deleted file mode 100644
index c6c1b55b..00000000
--- a/redis-stable/src/testhelp.h
+++ /dev/null
@@ -1,57 +0,0 @@
-/* This is a really minimal testing framework for C.
- *
- * Example:
- *
- * test_cond("Check if 1 == 1", 1==1)
- * test_cond("Check if 5 > 10", 5 > 10)
- * test_report()
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2010-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __TESTHELP_H
-#define __TESTHELP_H
-
-int __failed_tests = 0;
-int __test_num = 0;
-#define test_cond(descr,_c) do { \
-    __test_num++; printf("%d - %s: ", __test_num, descr); \
-    if(_c) printf("PASSED\n"); else {printf("FAILED\n"); __failed_tests++;} \
-} while(0)
-#define test_report() do { \
-    printf("%d tests, %d passed, %d failed\n", __test_num, \
-                    __test_num-__failed_tests, __failed_tests); \
-    if (__failed_tests) { \
-        printf("=== WARNING === We have failed tests here...\n"); \
-        exit(1); \
-    } \
-} while(0)
-
-#endif
diff --git a/redis-stable/src/timeout.c b/redis-stable/src/timeout.c
deleted file mode 100644
index d4c4690e..00000000
--- a/redis-stable/src/timeout.c
+++ /dev/null
@@ -1,190 +0,0 @@
-/* Copyright (c) 2009-2020, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-#include "cluster.h"
-
-/* ========================== Clients timeouts ============================= */
-
-/* Check if this blocked client timedout (does nothing if the client is
- * not blocked right now). If so send a reply, unblock it, and return 1.
- * Otherwise 0 is returned and no operation is performed. */
-int checkBlockedClientTimeout(client *c, mstime_t now) {
-    if (c->flags & CLIENT_BLOCKED &&
-        c->bpop.timeout != 0
-        && c->bpop.timeout < now)
-    {
-        /* Handle blocking operation specific timeout. */
-        replyToBlockedClientTimedOut(c);
-        unblockClient(c);
-        return 1;
-    } else {
-        return 0;
-    }
-}
-
-/* Check for timeouts. Returns non-zero if the client was terminated.
- * The function gets the current time in milliseconds as argument since
- * it gets called multiple times in a loop, so calling gettimeofday() for
- * each iteration would be costly without any actual gain. */
-int clientsCronHandleTimeout(client *c, mstime_t now_ms) {
-    time_t now = now_ms/1000;
-
-    if (server.maxidletime &&
-        /* This handles the idle clients connection timeout if set. */
-        !(c->flags & CLIENT_SLAVE) &&   /* No timeout for slaves and monitors */
-        !(c->flags & CLIENT_MASTER) &&  /* No timeout for masters */
-        !(c->flags & CLIENT_BLOCKED) && /* No timeout for BLPOP */
-        !(c->flags & CLIENT_PUBSUB) &&  /* No timeout for Pub/Sub clients */
-        (now - c->lastinteraction > server.maxidletime))
-    {
-        serverLog(LL_VERBOSE,"Closing idle client");
-        freeClient(c);
-        return 1;
-    } else if (c->flags & CLIENT_BLOCKED) {
-        /* Cluster: handle unblock & redirect of clients blocked
-         * into keys no longer served by this server. */
-        if (server.cluster_enabled) {
-            if (clusterRedirectBlockedClientIfNeeded(c))
-                unblockClient(c);
-        }
-    }
-    return 0;
-}
-
-/* For blocked clients timeouts we populate a radix tree of 128 bit keys
- * composed as such:
- *
- *  [8 byte big endian expire time]+[8 byte client ID]
- *
- * We don't do any cleanup in the Radix tree: when we run the clients that
- * reached the timeout already, if they are no longer existing or no longer
- * blocked with such timeout, we just go forward.
- *
- * Every time a client blocks with a timeout, we add the client in
- * the tree. In beforeSleep() we call handleBlockedClientsTimeout() to run
- * the tree and unblock the clients. */
-
-#define CLIENT_ST_KEYLEN 16    /* 8 bytes mstime + 8 bytes client ID. */
-
-/* Given client ID and timeout, write the resulting radix tree key in buf. */
-void encodeTimeoutKey(unsigned char *buf, uint64_t timeout, client *c) {
-    timeout = htonu64(timeout);
-    memcpy(buf,&timeout,sizeof(timeout));
-    memcpy(buf+8,&c,sizeof(c));
-    if (sizeof(c) == 4) memset(buf+12,0,4); /* Zero padding for 32bit target. */
-}
-
-/* Given a key encoded with encodeTimeoutKey(), resolve the fields and write
- * the timeout into *toptr and the client pointer into *cptr. */
-void decodeTimeoutKey(unsigned char *buf, uint64_t *toptr, client **cptr) {
-    memcpy(toptr,buf,sizeof(*toptr));
-    *toptr = ntohu64(*toptr);
-    memcpy(cptr,buf+8,sizeof(*cptr));
-}
-
-/* Add the specified client id / timeout as a key in the radix tree we use
- * to handle blocked clients timeouts. The client is not added to the list
- * if its timeout is zero (block forever). */
-void addClientToTimeoutTable(client *c) {
-    if (c->bpop.timeout == 0) return;
-    uint64_t timeout = c->bpop.timeout;
-    unsigned char buf[CLIENT_ST_KEYLEN];
-    encodeTimeoutKey(buf,timeout,c);
-    if (raxTryInsert(server.clients_timeout_table,buf,sizeof(buf),NULL,NULL))
-        c->flags |= CLIENT_IN_TO_TABLE;
-}
-
-/* Remove the client from the table when it is unblocked for reasons
- * different than timing out. */
-void removeClientFromTimeoutTable(client *c) {
-    if (!(c->flags & CLIENT_IN_TO_TABLE)) return;
-    c->flags &= ~CLIENT_IN_TO_TABLE;
-    uint64_t timeout = c->bpop.timeout;
-    unsigned char buf[CLIENT_ST_KEYLEN];
-    encodeTimeoutKey(buf,timeout,c);
-    raxRemove(server.clients_timeout_table,buf,sizeof(buf),NULL);
-}
-
-/* This function is called in beforeSleep() in order to unblock clients
- * that are waiting in blocking operations with a timeout set. */
-void handleBlockedClientsTimeout(void) {
-    if (raxSize(server.clients_timeout_table) == 0) return;
-    uint64_t now = mstime();
-    raxIterator ri;
-    raxStart(&ri,server.clients_timeout_table);
-    raxSeek(&ri,"^",NULL,0);
-
-    while(raxNext(&ri)) {
-        uint64_t timeout;
-        client *c;
-        decodeTimeoutKey(ri.key,&timeout,&c);
-        if (timeout >= now) break; /* All the timeouts are in the future. */
-        c->flags &= ~CLIENT_IN_TO_TABLE;
-        checkBlockedClientTimeout(c,now);
-        raxRemove(server.clients_timeout_table,ri.key,ri.key_len,NULL);
-        raxSeek(&ri,"^",NULL,0);
-    }
-    raxStop(&ri);
-}
-
-/* Get a timeout value from an object and store it into 'timeout'.
- * The final timeout is always stored as milliseconds as a time where the
- * timeout will expire, however the parsing is performed according to
- * the 'unit' that can be seconds or milliseconds.
- *
- * Note that if the timeout is zero (usually from the point of view of
- * commands API this means no timeout) the value stored into 'timeout'
- * is zero. */
-int getTimeoutFromObjectOrReply(client *c, robj *object, mstime_t *timeout, int unit) {
-    long long tval;
-    long double ftval;
-
-    if (unit == UNIT_SECONDS) {
-        if (getLongDoubleFromObjectOrReply(c,object,&ftval,
-            "timeout is not a float or out of range") != C_OK)
-            return C_ERR;
-        tval = (long long) (ftval * 1000.0);
-    } else {
-        if (getLongLongFromObjectOrReply(c,object,&tval,
-            "timeout is not an integer or out of range") != C_OK)
-            return C_ERR;
-    }
-
-    if (tval < 0) {
-        addReplyError(c,"timeout is negative");
-        return C_ERR;
-    }
-
-    if (tval > 0) {
-        tval += mstime();
-    }
-    *timeout = tval;
-
-    return C_OK;
-}
diff --git a/redis-stable/src/tls.c b/redis-stable/src/tls.c
deleted file mode 100644
index c36cc98f..00000000
--- a/redis-stable/src/tls.c
+++ /dev/null
@@ -1,1021 +0,0 @@
-/*
- * Copyright (c) 2019, Redis Labs
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-
-#include "server.h"
-#include "connhelpers.h"
-#include "adlist.h"
-
-#ifdef USE_OPENSSL
-
-#include <openssl/conf.h>
-#include <openssl/ssl.h>
-#include <openssl/err.h>
-#include <openssl/rand.h>
-#include <openssl/pem.h>
-
-#define REDIS_TLS_PROTO_TLSv1       (1<<0)
-#define REDIS_TLS_PROTO_TLSv1_1     (1<<1)
-#define REDIS_TLS_PROTO_TLSv1_2     (1<<2)
-#define REDIS_TLS_PROTO_TLSv1_3     (1<<3)
-
-/* Use safe defaults */
-#ifdef TLS1_3_VERSION
-#define REDIS_TLS_PROTO_DEFAULT     (REDIS_TLS_PROTO_TLSv1_2|REDIS_TLS_PROTO_TLSv1_3)
-#else
-#define REDIS_TLS_PROTO_DEFAULT     (REDIS_TLS_PROTO_TLSv1_2)
-#endif
-
-extern ConnectionType CT_Socket;
-
-SSL_CTX *redis_tls_ctx = NULL;
-SSL_CTX *redis_tls_client_ctx = NULL;
-
-static int parseProtocolsConfig(const char *str) {
-    int i, count = 0;
-    int protocols = 0;
-
-    if (!str) return REDIS_TLS_PROTO_DEFAULT;
-    sds *tokens = sdssplitlen(str, strlen(str), " ", 1, &count);
-
-    if (!tokens) { 
-        serverLog(LL_WARNING, "Invalid tls-protocols configuration string");
-        return -1;
-    }
-    for (i = 0; i < count; i++) {
-        if (!strcasecmp(tokens[i], "tlsv1")) protocols |= REDIS_TLS_PROTO_TLSv1;
-        else if (!strcasecmp(tokens[i], "tlsv1.1")) protocols |= REDIS_TLS_PROTO_TLSv1_1;
-        else if (!strcasecmp(tokens[i], "tlsv1.2")) protocols |= REDIS_TLS_PROTO_TLSv1_2;
-        else if (!strcasecmp(tokens[i], "tlsv1.3")) {
-#ifdef TLS1_3_VERSION
-            protocols |= REDIS_TLS_PROTO_TLSv1_3;
-#else
-            serverLog(LL_WARNING, "TLSv1.3 is specified in tls-protocols but not supported by OpenSSL.");
-            protocols = -1;
-            break;
-#endif
-        } else {
-            serverLog(LL_WARNING, "Invalid tls-protocols specified. "
-                    "Use a combination of 'TLSv1', 'TLSv1.1', 'TLSv1.2' and 'TLSv1.3'.");
-            protocols = -1;
-            break;
-        }
-    }
-    sdsfreesplitres(tokens, count);
-
-    return protocols;
-}
-
-/* list of connections with pending data already read from the socket, but not
- * served to the reader yet. */
-static list *pending_list = NULL;
-
-/**
- * OpenSSL global initialization and locking handling callbacks.
- * Note that this is only required for OpenSSL < 1.1.0.
- */
-
-#if OPENSSL_VERSION_NUMBER < 0x10100000L
-#define USE_CRYPTO_LOCKS
-#endif
-
-#ifdef USE_CRYPTO_LOCKS
-
-static pthread_mutex_t *openssl_locks;
-
-static void sslLockingCallback(int mode, int lock_id, const char *f, int line) {
-    pthread_mutex_t *mt = openssl_locks + lock_id;
-
-    if (mode & CRYPTO_LOCK) {
-        pthread_mutex_lock(mt);
-    } else {
-        pthread_mutex_unlock(mt);
-    }
-
-    (void)f;
-    (void)line;
-}
-
-static void initCryptoLocks(void) {
-    unsigned i, nlocks;
-    if (CRYPTO_get_locking_callback() != NULL) {
-        /* Someone already set the callback before us. Don't destroy it! */
-        return;
-    }
-    nlocks = CRYPTO_num_locks();
-    openssl_locks = zmalloc(sizeof(*openssl_locks) * nlocks);
-    for (i = 0; i < nlocks; i++) {
-        pthread_mutex_init(openssl_locks + i, NULL);
-    }
-    CRYPTO_set_locking_callback(sslLockingCallback);
-}
-#endif /* USE_CRYPTO_LOCKS */
-
-void tlsInit(void) {
-    /* Enable configuring OpenSSL using the standard openssl.cnf
-     * OPENSSL_config()/OPENSSL_init_crypto() should be the first 
-     * call to the OpenSSL* library.
-     *  - OPENSSL_config() should be used for OpenSSL versions < 1.1.0
-     *  - OPENSSL_init_crypto() should be used for OpenSSL versions >= 1.1.0
-     */
-    #if OPENSSL_VERSION_NUMBER < 0x10100000L
-    OPENSSL_config(NULL);
-    #elif OPENSSL_VERSION_NUMBER < 0x10101000L
-    OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG, NULL);
-    #else
-    OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CONFIG|OPENSSL_INIT_ATFORK, NULL);
-    #endif
-    ERR_load_crypto_strings();
-    SSL_load_error_strings();
-    SSL_library_init();
-
-#ifdef USE_CRYPTO_LOCKS
-    initCryptoLocks();
-#endif
-
-    if (!RAND_poll()) {
-        serverLog(LL_WARNING, "OpenSSL: Failed to seed random number generator.");
-    }
-
-    pending_list = listCreate();
-}
-
-void tlsCleanup(void) {
-    if (redis_tls_ctx) {
-        SSL_CTX_free(redis_tls_ctx);
-        redis_tls_ctx = NULL;
-    }
-    if (redis_tls_client_ctx) {
-        SSL_CTX_free(redis_tls_client_ctx);
-        redis_tls_client_ctx = NULL;
-    }
-
-    #if OPENSSL_VERSION_NUMBER >= 0x10100000L && !defined(LIBRESSL_VERSION_NUMBER)
-    // unavailable on LibreSSL
-    OPENSSL_cleanup();
-    #endif
-}
-
-/* Callback for passing a keyfile password stored as an sds to OpenSSL */
-static int tlsPasswordCallback(char *buf, int size, int rwflag, void *u) {
-    UNUSED(rwflag);
-
-    const char *pass = u;
-    size_t pass_len;
-
-    if (!pass) return -1;
-    pass_len = strlen(pass);
-    if (pass_len > (size_t) size) return -1;
-    memcpy(buf, pass, pass_len);
-
-    return (int) pass_len;
-}
-
-/* Create a *base* SSL_CTX using the SSL configuration provided. The base context
- * includes everything that's common for both client-side and server-side connections.
- */
-static SSL_CTX *createSSLContext(redisTLSContextConfig *ctx_config, int protocols, int client) {
-    const char *cert_file = client ? ctx_config->client_cert_file : ctx_config->cert_file;
-    const char *key_file = client ? ctx_config->client_key_file : ctx_config->key_file;
-    const char *key_file_pass = client ? ctx_config->client_key_file_pass : ctx_config->key_file_pass;
-    char errbuf[256];
-    SSL_CTX *ctx = NULL;
-
-    ctx = SSL_CTX_new(SSLv23_method());
-
-    SSL_CTX_set_options(ctx, SSL_OP_NO_SSLv2|SSL_OP_NO_SSLv3);
-
-#ifdef SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS
-    SSL_CTX_set_options(ctx, SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS);
-#endif
-
-    if (!(protocols & REDIS_TLS_PROTO_TLSv1))
-        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1);
-    if (!(protocols & REDIS_TLS_PROTO_TLSv1_1))
-        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_1);
-#ifdef SSL_OP_NO_TLSv1_2
-    if (!(protocols & REDIS_TLS_PROTO_TLSv1_2))
-        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_2);
-#endif
-#ifdef SSL_OP_NO_TLSv1_3
-    if (!(protocols & REDIS_TLS_PROTO_TLSv1_3))
-        SSL_CTX_set_options(ctx, SSL_OP_NO_TLSv1_3);
-#endif
-
-#ifdef SSL_OP_NO_COMPRESSION
-    SSL_CTX_set_options(ctx, SSL_OP_NO_COMPRESSION);
-#endif
-
-    SSL_CTX_set_mode(ctx, SSL_MODE_ENABLE_PARTIAL_WRITE|SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
-    SSL_CTX_set_verify(ctx, SSL_VERIFY_PEER|SSL_VERIFY_FAIL_IF_NO_PEER_CERT, NULL);
-
-    SSL_CTX_set_default_passwd_cb(ctx, tlsPasswordCallback);
-    SSL_CTX_set_default_passwd_cb_userdata(ctx, (void *) key_file_pass);
-
-    if (SSL_CTX_use_certificate_chain_file(ctx, cert_file) <= 0) {
-        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
-        serverLog(LL_WARNING, "Failed to load certificate: %s: %s", cert_file, errbuf);
-        goto error;
-    }
-
-    if (SSL_CTX_use_PrivateKey_file(ctx, key_file, SSL_FILETYPE_PEM) <= 0) {
-        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
-        serverLog(LL_WARNING, "Failed to load private key: %s: %s", key_file, errbuf);
-        goto error;
-    }
-
-    if ((ctx_config->ca_cert_file || ctx_config->ca_cert_dir) &&
-        SSL_CTX_load_verify_locations(ctx, ctx_config->ca_cert_file, ctx_config->ca_cert_dir) <= 0) {
-        ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
-        serverLog(LL_WARNING, "Failed to configure CA certificate(s) file/directory: %s", errbuf);
-        goto error;
-    }
-
-    if (ctx_config->ciphers && !SSL_CTX_set_cipher_list(ctx, ctx_config->ciphers)) {
-        serverLog(LL_WARNING, "Failed to configure ciphers: %s", ctx_config->ciphers);
-        goto error;
-    }
-
-#ifdef TLS1_3_VERSION
-    if (ctx_config->ciphersuites && !SSL_CTX_set_ciphersuites(ctx, ctx_config->ciphersuites)) {
-        serverLog(LL_WARNING, "Failed to configure ciphersuites: %s", ctx_config->ciphersuites);
-        goto error;
-    }
-#endif
-
-    return ctx;
-
-error:
-    if (ctx) SSL_CTX_free(ctx);
-    return NULL;
-}
-
-/* Attempt to configure/reconfigure TLS. This operation is atomic and will
- * leave the SSL_CTX unchanged if fails.
- */
-int tlsConfigure(redisTLSContextConfig *ctx_config) {
-    char errbuf[256];
-    SSL_CTX *ctx = NULL;
-    SSL_CTX *client_ctx = NULL;
-
-    if (!ctx_config->cert_file) {
-        serverLog(LL_WARNING, "No tls-cert-file configured!");
-        goto error;
-    }
-
-    if (!ctx_config->key_file) {
-        serverLog(LL_WARNING, "No tls-key-file configured!");
-        goto error;
-    }
-
-    if (((server.tls_auth_clients != TLS_CLIENT_AUTH_NO) || server.tls_cluster || server.tls_replication) &&
-            !ctx_config->ca_cert_file && !ctx_config->ca_cert_dir) {
-        serverLog(LL_WARNING, "Either tls-ca-cert-file or tls-ca-cert-dir must be specified when tls-cluster, tls-replication or tls-auth-clients are enabled!");
-        goto error;
-    }
-
-    int protocols = parseProtocolsConfig(ctx_config->protocols);
-    if (protocols == -1) goto error;
-
-    /* Create server side/generla context */
-    ctx = createSSLContext(ctx_config, protocols, 0);
-    if (!ctx) goto error;
-
-    if (ctx_config->session_caching) {
-        SSL_CTX_set_session_cache_mode(ctx, SSL_SESS_CACHE_SERVER);
-        SSL_CTX_sess_set_cache_size(ctx, ctx_config->session_cache_size);
-        SSL_CTX_set_timeout(ctx, ctx_config->session_cache_timeout);
-        SSL_CTX_set_session_id_context(ctx, (void *) "redis", 5);
-    } else {
-        SSL_CTX_set_session_cache_mode(ctx, SSL_SESS_CACHE_OFF);
-    }
-
-#ifdef SSL_OP_NO_CLIENT_RENEGOTIATION
-    SSL_CTX_set_options(ctx, SSL_OP_NO_CLIENT_RENEGOTIATION);
-#endif
-
-    if (ctx_config->prefer_server_ciphers)
-        SSL_CTX_set_options(ctx, SSL_OP_CIPHER_SERVER_PREFERENCE);
-
-#if defined(SSL_CTX_set_ecdh_auto)
-    SSL_CTX_set_ecdh_auto(ctx, 1);
-#endif
-    SSL_CTX_set_options(ctx, SSL_OP_SINGLE_DH_USE);
-
-    if (ctx_config->dh_params_file) {
-        FILE *dhfile = fopen(ctx_config->dh_params_file, "r");
-        DH *dh = NULL;
-        if (!dhfile) {
-            serverLog(LL_WARNING, "Failed to load %s: %s", ctx_config->dh_params_file, strerror(errno));
-            goto error;
-        }
-
-        dh = PEM_read_DHparams(dhfile, NULL, NULL, NULL);
-        fclose(dhfile);
-        if (!dh) {
-            serverLog(LL_WARNING, "%s: failed to read DH params.", ctx_config->dh_params_file);
-            goto error;
-        }
-
-        if (SSL_CTX_set_tmp_dh(ctx, dh) <= 0) {
-            ERR_error_string_n(ERR_get_error(), errbuf, sizeof(errbuf));
-            serverLog(LL_WARNING, "Failed to load DH params file: %s: %s", ctx_config->dh_params_file, errbuf);
-            DH_free(dh);
-            goto error;
-        }
-
-        DH_free(dh);
-    }
-
-    /* If a client-side certificate is configured, create an explicit client context */
-    if (ctx_config->client_cert_file && ctx_config->client_key_file) {
-        client_ctx = createSSLContext(ctx_config, protocols, 1);
-        if (!client_ctx) goto error;
-    }
-
-    SSL_CTX_free(redis_tls_ctx);
-    SSL_CTX_free(redis_tls_client_ctx);
-    redis_tls_ctx = ctx;
-    redis_tls_client_ctx = client_ctx;
-
-    return C_OK;
-
-error:
-    if (ctx) SSL_CTX_free(ctx);
-    if (client_ctx) SSL_CTX_free(client_ctx);
-    return C_ERR;
-}
-
-#ifdef TLS_DEBUGGING
-#define TLSCONN_DEBUG(fmt, ...) \
-    serverLog(LL_DEBUG, "TLSCONN: " fmt, __VA_ARGS__)
-#else
-#define TLSCONN_DEBUG(fmt, ...)
-#endif
-
-ConnectionType CT_TLS;
-
-/* Normal socket connections have a simple events/handler correlation.
- *
- * With TLS connections we need to handle cases where during a logical read
- * or write operation, the SSL library asks to block for the opposite
- * socket operation.
- *
- * When this happens, we need to do two things:
- * 1. Make sure we register for the event.
- * 2. Make sure we know which handler needs to execute when the
- *    event fires.  That is, if we notify the caller of a write operation
- *    that it blocks, and SSL asks for a read, we need to trigger the
- *    write handler again on the next read event.
- *
- */
-
-typedef enum {
-    WANT_READ = 1,
-    WANT_WRITE
-} WantIOType;
-
-#define TLS_CONN_FLAG_READ_WANT_WRITE   (1<<0)
-#define TLS_CONN_FLAG_WRITE_WANT_READ   (1<<1)
-#define TLS_CONN_FLAG_FD_SET            (1<<2)
-
-typedef struct tls_connection {
-    connection c;
-    int flags;
-    SSL *ssl;
-    char *ssl_error;
-    listNode *pending_list_node;
-} tls_connection;
-
-static connection *createTLSConnection(int client_side) {
-    SSL_CTX *ctx = redis_tls_ctx;
-    if (client_side && redis_tls_client_ctx)
-        ctx = redis_tls_client_ctx;
-    tls_connection *conn = zcalloc(sizeof(tls_connection));
-    conn->c.type = &CT_TLS;
-    conn->c.fd = -1;
-    conn->ssl = SSL_new(ctx);
-    return (connection *) conn;
-}
-
-connection *connCreateTLS(void) {
-    return createTLSConnection(1);
-}
-
-/* Fetch the latest OpenSSL error and store it in the connection */
-static void updateTLSError(tls_connection *conn) {
-    conn->c.last_errno = 0;
-    if (conn->ssl_error) zfree(conn->ssl_error);
-    conn->ssl_error = zmalloc(512);
-    ERR_error_string_n(ERR_get_error(), conn->ssl_error, 512);
-}
-
-/* Create a new TLS connection that is already associated with
- * an accepted underlying file descriptor.
- *
- * The socket is not ready for I/O until connAccept() was called and
- * invoked the connection-level accept handler.
- *
- * Callers should use connGetState() and verify the created connection
- * is not in an error state.
- */
-connection *connCreateAcceptedTLS(int fd, int require_auth) {
-    tls_connection *conn = (tls_connection *) createTLSConnection(0);
-    conn->c.fd = fd;
-    conn->c.state = CONN_STATE_ACCEPTING;
-
-    if (!conn->ssl) {
-        updateTLSError(conn);
-        conn->c.state = CONN_STATE_ERROR;
-        return (connection *) conn;
-    }
-
-    switch (require_auth) {
-        case TLS_CLIENT_AUTH_NO:
-            SSL_set_verify(conn->ssl, SSL_VERIFY_NONE, NULL);
-            break;
-        case TLS_CLIENT_AUTH_OPTIONAL:
-            SSL_set_verify(conn->ssl, SSL_VERIFY_PEER, NULL);
-            break;
-        default: /* TLS_CLIENT_AUTH_YES, also fall-secure */
-            SSL_set_verify(conn->ssl, SSL_VERIFY_PEER|SSL_VERIFY_FAIL_IF_NO_PEER_CERT, NULL);
-            break;
-    }
-
-    SSL_set_fd(conn->ssl, conn->c.fd);
-    SSL_set_accept_state(conn->ssl);
-
-    return (connection *) conn;
-}
-
-static void tlsEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask);
-
-/* Process the return code received from OpenSSL>
- * Update the want parameter with expected I/O.
- * Update the connection's error state if a real error has occured.
- * Returns an SSL error code, or 0 if no further handling is required.
- */
-static int handleSSLReturnCode(tls_connection *conn, int ret_value, WantIOType *want) {
-    if (ret_value <= 0) {
-        int ssl_err = SSL_get_error(conn->ssl, ret_value);
-        switch (ssl_err) {
-            case SSL_ERROR_WANT_WRITE:
-                *want = WANT_WRITE;
-                return 0;
-            case SSL_ERROR_WANT_READ:
-                *want = WANT_READ;
-                return 0;
-            case SSL_ERROR_SYSCALL:
-                conn->c.last_errno = errno;
-                if (conn->ssl_error) zfree(conn->ssl_error);
-                conn->ssl_error = errno ? zstrdup(strerror(errno)) : NULL;
-                break;
-            default:
-                /* Error! */
-                updateTLSError(conn);
-                break;
-        }
-
-        return ssl_err;
-    }
-
-    return 0;
-}
-
-void registerSSLEvent(tls_connection *conn, WantIOType want) {
-    int mask = aeGetFileEvents(server.el, conn->c.fd);
-
-    switch (want) {
-        case WANT_READ:
-            if (mask & AE_WRITABLE) aeDeleteFileEvent(server.el, conn->c.fd, AE_WRITABLE);
-            if (!(mask & AE_READABLE)) aeCreateFileEvent(server.el, conn->c.fd, AE_READABLE,
-                        tlsEventHandler, conn);
-            break;
-        case WANT_WRITE:
-            if (mask & AE_READABLE) aeDeleteFileEvent(server.el, conn->c.fd, AE_READABLE);
-            if (!(mask & AE_WRITABLE)) aeCreateFileEvent(server.el, conn->c.fd, AE_WRITABLE,
-                        tlsEventHandler, conn);
-            break;
-        default:
-            serverAssert(0);
-            break;
-    }
-}
-
-void updateSSLEvent(tls_connection *conn) {
-    int mask = aeGetFileEvents(server.el, conn->c.fd);
-    int need_read = conn->c.read_handler || (conn->flags & TLS_CONN_FLAG_WRITE_WANT_READ);
-    int need_write = conn->c.write_handler || (conn->flags & TLS_CONN_FLAG_READ_WANT_WRITE);
-
-    if (need_read && !(mask & AE_READABLE))
-        aeCreateFileEvent(server.el, conn->c.fd, AE_READABLE, tlsEventHandler, conn);
-    if (!need_read && (mask & AE_READABLE))
-        aeDeleteFileEvent(server.el, conn->c.fd, AE_READABLE);
-
-    if (need_write && !(mask & AE_WRITABLE))
-        aeCreateFileEvent(server.el, conn->c.fd, AE_WRITABLE, tlsEventHandler, conn);
-    if (!need_write && (mask & AE_WRITABLE))
-        aeDeleteFileEvent(server.el, conn->c.fd, AE_WRITABLE);
-}
-
-static void tlsHandleEvent(tls_connection *conn, int mask) {
-    int ret, conn_error;
-
-    TLSCONN_DEBUG("tlsEventHandler(): fd=%d, state=%d, mask=%d, r=%d, w=%d, flags=%d",
-            fd, conn->c.state, mask, conn->c.read_handler != NULL, conn->c.write_handler != NULL,
-            conn->flags);
-
-    ERR_clear_error();
-
-    switch (conn->c.state) {
-        case CONN_STATE_CONNECTING:
-            conn_error = connGetSocketError((connection *) conn);
-            if (conn_error) {
-                conn->c.last_errno = conn_error;
-                conn->c.state = CONN_STATE_ERROR;
-            } else {
-                if (!(conn->flags & TLS_CONN_FLAG_FD_SET)) {
-                    SSL_set_fd(conn->ssl, conn->c.fd);
-                    conn->flags |= TLS_CONN_FLAG_FD_SET;
-                }
-                ret = SSL_connect(conn->ssl);
-                if (ret <= 0) {
-                    WantIOType want = 0;
-                    if (!handleSSLReturnCode(conn, ret, &want)) {
-                        registerSSLEvent(conn, want);
-
-                        /* Avoid hitting UpdateSSLEvent, which knows nothing
-                         * of what SSL_connect() wants and instead looks at our
-                         * R/W handlers.
-                         */
-                        return;
-                    }
-
-                    /* If not handled, it's an error */
-                    conn->c.state = CONN_STATE_ERROR;
-                } else {
-                    conn->c.state = CONN_STATE_CONNECTED;
-                }
-            }
-
-            if (!callHandler((connection *) conn, conn->c.conn_handler)) return;
-            conn->c.conn_handler = NULL;
-            break;
-        case CONN_STATE_ACCEPTING:
-            ret = SSL_accept(conn->ssl);
-            if (ret <= 0) {
-                WantIOType want = 0;
-                if (!handleSSLReturnCode(conn, ret, &want)) {
-                    /* Avoid hitting UpdateSSLEvent, which knows nothing
-                     * of what SSL_connect() wants and instead looks at our
-                     * R/W handlers.
-                     */
-                    registerSSLEvent(conn, want);
-                    return;
-                }
-
-                /* If not handled, it's an error */
-                conn->c.state = CONN_STATE_ERROR;
-            } else {
-                conn->c.state = CONN_STATE_CONNECTED;
-            }
-
-            if (!callHandler((connection *) conn, conn->c.conn_handler)) return;
-            conn->c.conn_handler = NULL;
-            break;
-        case CONN_STATE_CONNECTED:
-        {
-            int call_read = ((mask & AE_READABLE) && conn->c.read_handler) ||
-                ((mask & AE_WRITABLE) && (conn->flags & TLS_CONN_FLAG_READ_WANT_WRITE));
-            int call_write = ((mask & AE_WRITABLE) && conn->c.write_handler) ||
-                ((mask & AE_READABLE) && (conn->flags & TLS_CONN_FLAG_WRITE_WANT_READ));
-
-            /* Normally we execute the readable event first, and the writable
-             * event laster. This is useful as sometimes we may be able
-             * to serve the reply of a query immediately after processing the
-             * query.
-             *
-             * However if WRITE_BARRIER is set in the mask, our application is
-             * asking us to do the reverse: never fire the writable event
-             * after the readable. In such a case, we invert the calls.
-             * This is useful when, for instance, we want to do things
-             * in the beforeSleep() hook, like fsynching a file to disk,
-             * before replying to a client. */
-            int invert = conn->c.flags & CONN_FLAG_WRITE_BARRIER;
-
-            if (!invert && call_read) {
-                conn->flags &= ~TLS_CONN_FLAG_READ_WANT_WRITE;
-                if (!callHandler((connection *) conn, conn->c.read_handler)) return;
-            }
-
-            /* Fire the writable event. */
-            if (call_write) {
-                conn->flags &= ~TLS_CONN_FLAG_WRITE_WANT_READ;
-                if (!callHandler((connection *) conn, conn->c.write_handler)) return;
-            }
-
-            /* If we have to invert the call, fire the readable event now
-             * after the writable one. */
-            if (invert && call_read) {
-                conn->flags &= ~TLS_CONN_FLAG_READ_WANT_WRITE;
-                if (!callHandler((connection *) conn, conn->c.read_handler)) return;
-            }
-
-            /* If SSL has pending that, already read from the socket, we're at
-             * risk of not calling the read handler again, make sure to add it
-             * to a list of pending connection that should be handled anyway. */
-            if ((mask & AE_READABLE)) {
-                if (SSL_pending(conn->ssl) > 0) {
-                    if (!conn->pending_list_node) {
-                        listAddNodeTail(pending_list, conn);
-                        conn->pending_list_node = listLast(pending_list);
-                    }
-                } else if (conn->pending_list_node) {
-                    listDelNode(pending_list, conn->pending_list_node);
-                    conn->pending_list_node = NULL;
-                }
-            }
-
-            break;
-        }
-        default:
-            break;
-    }
-
-    updateSSLEvent(conn);
-}
-
-static void tlsEventHandler(struct aeEventLoop *el, int fd, void *clientData, int mask) {
-    UNUSED(el);
-    UNUSED(fd);
-    tls_connection *conn = clientData;
-    tlsHandleEvent(conn, mask);
-}
-
-static void connTLSClose(connection *conn_) {
-    tls_connection *conn = (tls_connection *) conn_;
-
-    if (conn->ssl) {
-        SSL_free(conn->ssl);
-        conn->ssl = NULL;
-    }
-
-    if (conn->ssl_error) {
-        zfree(conn->ssl_error);
-        conn->ssl_error = NULL;
-    }
-
-    if (conn->pending_list_node) {
-        listDelNode(pending_list, conn->pending_list_node);
-        conn->pending_list_node = NULL;
-    }
-
-    CT_Socket.close(conn_);
-}
-
-static int connTLSAccept(connection *_conn, ConnectionCallbackFunc accept_handler) {
-    tls_connection *conn = (tls_connection *) _conn;
-    int ret;
-
-    if (conn->c.state != CONN_STATE_ACCEPTING) return C_ERR;
-    ERR_clear_error();
-
-    /* Try to accept */
-    conn->c.conn_handler = accept_handler;
-    ret = SSL_accept(conn->ssl);
-
-    if (ret <= 0) {
-        WantIOType want = 0;
-        if (!handleSSLReturnCode(conn, ret, &want)) {
-            registerSSLEvent(conn, want);   /* We'll fire back */
-            return C_OK;
-        } else {
-            conn->c.state = CONN_STATE_ERROR;
-            return C_ERR;
-        }
-    }
-
-    conn->c.state = CONN_STATE_CONNECTED;
-    if (!callHandler((connection *) conn, conn->c.conn_handler)) return C_OK;
-    conn->c.conn_handler = NULL;
-
-    return C_OK;
-}
-
-static int connTLSConnect(connection *conn_, const char *addr, int port, const char *src_addr, ConnectionCallbackFunc connect_handler) {
-    tls_connection *conn = (tls_connection *) conn_;
-
-    if (conn->c.state != CONN_STATE_NONE) return C_ERR;
-    ERR_clear_error();
-
-    /* Initiate Socket connection first */
-    if (CT_Socket.connect(conn_, addr, port, src_addr, connect_handler) == C_ERR) return C_ERR;
-
-    /* Return now, once the socket is connected we'll initiate
-     * TLS connection from the event handler.
-     */
-    return C_OK;
-}
-
-static int connTLSWrite(connection *conn_, const void *data, size_t data_len) {
-    tls_connection *conn = (tls_connection *) conn_;
-    int ret, ssl_err;
-
-    if (conn->c.state != CONN_STATE_CONNECTED) return -1;
-    ERR_clear_error();
-    ret = SSL_write(conn->ssl, data, data_len);
-
-    if (ret <= 0) {
-        WantIOType want = 0;
-        if (!(ssl_err = handleSSLReturnCode(conn, ret, &want))) {
-            if (want == WANT_READ) conn->flags |= TLS_CONN_FLAG_WRITE_WANT_READ;
-            updateSSLEvent(conn);
-            errno = EAGAIN;
-            return -1;
-        } else {
-            if (ssl_err == SSL_ERROR_ZERO_RETURN ||
-                    ((ssl_err == SSL_ERROR_SYSCALL && !errno))) {
-                conn->c.state = CONN_STATE_CLOSED;
-                return 0;
-            } else {
-                conn->c.state = CONN_STATE_ERROR;
-                return -1;
-            }
-        }
-    }
-
-    return ret;
-}
-
-static int connTLSRead(connection *conn_, void *buf, size_t buf_len) {
-    tls_connection *conn = (tls_connection *) conn_;
-    int ret;
-    int ssl_err;
-
-    if (conn->c.state != CONN_STATE_CONNECTED) return -1;
-    ERR_clear_error();
-    ret = SSL_read(conn->ssl, buf, buf_len);
-    if (ret <= 0) {
-        WantIOType want = 0;
-        if (!(ssl_err = handleSSLReturnCode(conn, ret, &want))) {
-            if (want == WANT_WRITE) conn->flags |= TLS_CONN_FLAG_READ_WANT_WRITE;
-            updateSSLEvent(conn);
-
-            errno = EAGAIN;
-            return -1;
-        } else {
-            if (ssl_err == SSL_ERROR_ZERO_RETURN ||
-                    ((ssl_err == SSL_ERROR_SYSCALL) && !errno)) {
-                conn->c.state = CONN_STATE_CLOSED;
-                return 0;
-            } else {
-                conn->c.state = CONN_STATE_ERROR;
-                return -1;
-            }
-        }
-    }
-
-    return ret;
-}
-
-static const char *connTLSGetLastError(connection *conn_) {
-    tls_connection *conn = (tls_connection *) conn_;
-
-    if (conn->ssl_error) return conn->ssl_error;
-    return NULL;
-}
-
-int connTLSSetWriteHandler(connection *conn, ConnectionCallbackFunc func, int barrier) {
-    conn->write_handler = func;
-    if (barrier)
-        conn->flags |= CONN_FLAG_WRITE_BARRIER;
-    else
-        conn->flags &= ~CONN_FLAG_WRITE_BARRIER;
-    updateSSLEvent((tls_connection *) conn);
-    return C_OK;
-}
-
-int connTLSSetReadHandler(connection *conn, ConnectionCallbackFunc func) {
-    conn->read_handler = func;
-    updateSSLEvent((tls_connection *) conn);
-    return C_OK;
-}
-
-static void setBlockingTimeout(tls_connection *conn, long long timeout) {
-    anetBlock(NULL, conn->c.fd);
-    anetSendTimeout(NULL, conn->c.fd, timeout);
-    anetRecvTimeout(NULL, conn->c.fd, timeout);
-}
-
-static void unsetBlockingTimeout(tls_connection *conn) {
-    anetNonBlock(NULL, conn->c.fd);
-    anetSendTimeout(NULL, conn->c.fd, 0);
-    anetRecvTimeout(NULL, conn->c.fd, 0);
-}
-
-static int connTLSBlockingConnect(connection *conn_, const char *addr, int port, long long timeout) {
-    tls_connection *conn = (tls_connection *) conn_;
-    int ret;
-
-    if (conn->c.state != CONN_STATE_NONE) return C_ERR;
-
-    /* Initiate socket blocking connect first */
-    if (CT_Socket.blocking_connect(conn_, addr, port, timeout) == C_ERR) return C_ERR;
-
-    /* Initiate TLS connection now.  We set up a send/recv timeout on the socket,
-     * which means the specified timeout will not be enforced accurately. */
-    SSL_set_fd(conn->ssl, conn->c.fd);
-    setBlockingTimeout(conn, timeout);
-
-    if ((ret = SSL_connect(conn->ssl)) <= 0) {
-        conn->c.state = CONN_STATE_ERROR;
-        return C_ERR;
-    }
-    unsetBlockingTimeout(conn);
-
-    conn->c.state = CONN_STATE_CONNECTED;
-    return C_OK;
-}
-
-static ssize_t connTLSSyncWrite(connection *conn_, char *ptr, ssize_t size, long long timeout) {
-    tls_connection *conn = (tls_connection *) conn_;
-
-    setBlockingTimeout(conn, timeout);
-    SSL_clear_mode(conn->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE);
-    int ret = SSL_write(conn->ssl, ptr, size);
-    SSL_set_mode(conn->ssl, SSL_MODE_ENABLE_PARTIAL_WRITE);
-    unsetBlockingTimeout(conn);
-
-    return ret;
-}
-
-static ssize_t connTLSSyncRead(connection *conn_, char *ptr, ssize_t size, long long timeout) {
-    tls_connection *conn = (tls_connection *) conn_;
-
-    setBlockingTimeout(conn, timeout);
-    int ret = SSL_read(conn->ssl, ptr, size);
-    unsetBlockingTimeout(conn);
-
-    return ret;
-}
-
-static ssize_t connTLSSyncReadLine(connection *conn_, char *ptr, ssize_t size, long long timeout) {
-    tls_connection *conn = (tls_connection *) conn_;
-    ssize_t nread = 0;
-
-    setBlockingTimeout(conn, timeout);
-
-    size--;
-    while(size) {
-        char c;
-
-        if (SSL_read(conn->ssl,&c,1) <= 0) {
-            nread = -1;
-            goto exit;
-        }
-        if (c == '\n') {
-            *ptr = '\0';
-            if (nread && *(ptr-1) == '\r') *(ptr-1) = '\0';
-            goto exit;
-        } else {
-            *ptr++ = c;
-            *ptr = '\0';
-            nread++;
-        }
-        size--;
-    }
-exit:
-    unsetBlockingTimeout(conn);
-    return nread;
-}
-
-static int connTLSGetType(connection *conn_) {
-    (void) conn_;
-
-    return CONN_TYPE_TLS;
-}
-
-ConnectionType CT_TLS = {
-    .ae_handler = tlsEventHandler,
-    .accept = connTLSAccept,
-    .connect = connTLSConnect,
-    .blocking_connect = connTLSBlockingConnect,
-    .read = connTLSRead,
-    .write = connTLSWrite,
-    .close = connTLSClose,
-    .set_write_handler = connTLSSetWriteHandler,
-    .set_read_handler = connTLSSetReadHandler,
-    .get_last_error = connTLSGetLastError,
-    .sync_write = connTLSSyncWrite,
-    .sync_read = connTLSSyncRead,
-    .sync_readline = connTLSSyncReadLine,
-    .get_type = connTLSGetType
-};
-
-int tlsHasPendingData() {
-    if (!pending_list)
-        return 0;
-    return listLength(pending_list) > 0;
-}
-
-int tlsProcessPendingData() {
-    listIter li;
-    listNode *ln;
-
-    int processed = listLength(pending_list);
-    listRewind(pending_list,&li);
-    while((ln = listNext(&li))) {
-        tls_connection *conn = listNodeValue(ln);
-        tlsHandleEvent(conn, AE_READABLE);
-    }
-    return processed;
-}
-
-/* Fetch the peer certificate used for authentication on the specified
- * connection and return it as a PEM-encoded sds.
- */
-sds connTLSGetPeerCert(connection *conn_) {
-    tls_connection *conn = (tls_connection *) conn_;
-    if (conn_->type->get_type(conn_) != CONN_TYPE_TLS || !conn->ssl) return NULL;
-
-    X509 *cert = SSL_get_peer_certificate(conn->ssl);
-    if (!cert) return NULL;
-
-    BIO *bio = BIO_new(BIO_s_mem());
-    if (bio == NULL || !PEM_write_bio_X509(bio, cert)) {
-        if (bio != NULL) BIO_free(bio);
-        return NULL;
-    }
-
-    const char *bio_ptr;
-    long long bio_len = BIO_get_mem_data(bio, &bio_ptr);
-    sds cert_pem = sdsnewlen(bio_ptr, bio_len);
-    BIO_free(bio);
-
-    return cert_pem;
-}
-
-#else   /* USE_OPENSSL */
-
-void tlsInit(void) {
-}
-
-void tlsCleanup(void) {
-}
-
-int tlsConfigure(redisTLSContextConfig *ctx_config) {
-    UNUSED(ctx_config);
-    return C_OK;
-}
-
-connection *connCreateTLS(void) { 
-    return NULL;
-}
-
-connection *connCreateAcceptedTLS(int fd, int require_auth) {
-    UNUSED(fd);
-    UNUSED(require_auth);
-
-    return NULL;
-}
-
-int tlsHasPendingData() {
-    return 0;
-}
-
-int tlsProcessPendingData() {
-    return 0;
-}
-
-sds connTLSGetPeerCert(connection *conn_) {
-    (void) conn_;
-    return NULL;
-}
-
-#endif
diff --git a/redis-stable/src/tracking.c b/redis-stable/src/tracking.c
deleted file mode 100644
index a57f062c..00000000
--- a/redis-stable/src/tracking.c
+++ /dev/null
@@ -1,604 +0,0 @@
-/* tracking.c - Client side caching: keys tracking and invalidation
- *
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "server.h"
-
-/* The tracking table is constituted by a radix tree of keys, each pointing
- * to a radix tree of client IDs, used to track the clients that may have
- * certain keys in their local, client side, cache.
- *
- * When a client enables tracking with "CLIENT TRACKING on", each key served to
- * the client is remembered in the table mapping the keys to the client IDs.
- * Later, when a key is modified, all the clients that may have local copy
- * of such key will receive an invalidation message.
- *
- * Clients will normally take frequently requested objects in memory, removing
- * them when invalidation messages are received. */
-rax *TrackingTable = NULL;
-rax *PrefixTable = NULL;
-uint64_t TrackingTableTotalItems = 0; /* Total number of IDs stored across
-                                         the whole tracking table. This gives
-                                         an hint about the total memory we
-                                         are using server side for CSC. */
-robj *TrackingChannelName;
-
-/* This is the structure that we have as value of the PrefixTable, and
- * represents the list of keys modified, and the list of clients that need
- * to be notified, for a given prefix. */
-typedef struct bcastState {
-    rax *keys;      /* Keys modified in the current event loop cycle. */
-    rax *clients;   /* Clients subscribed to the notification events for this
-                       prefix. */
-} bcastState;
-
-/* Remove the tracking state from the client 'c'. Note that there is not much
- * to do for us here, if not to decrement the counter of the clients in
- * tracking mode, because we just store the ID of the client in the tracking
- * table, so we'll remove the ID reference in a lazy way. Otherwise when a
- * client with many entries in the table is removed, it would cost a lot of
- * time to do the cleanup. */
-void disableTracking(client *c) {
-    /* If this client is in broadcasting mode, we need to unsubscribe it
-     * from all the prefixes it is registered to. */
-    if (c->flags & CLIENT_TRACKING_BCAST) {
-        raxIterator ri;
-        raxStart(&ri,c->client_tracking_prefixes);
-        raxSeek(&ri,"^",NULL,0);
-        while(raxNext(&ri)) {
-            bcastState *bs = raxFind(PrefixTable,ri.key,ri.key_len);
-            serverAssert(bs != raxNotFound);
-            raxRemove(bs->clients,(unsigned char*)&c,sizeof(c),NULL);
-            /* Was it the last client? Remove the prefix from the
-             * table. */
-            if (raxSize(bs->clients) == 0) {
-                raxFree(bs->clients);
-                raxFree(bs->keys);
-                zfree(bs);
-                raxRemove(PrefixTable,ri.key,ri.key_len,NULL);
-            }
-        }
-        raxStop(&ri);
-        raxFree(c->client_tracking_prefixes);
-        c->client_tracking_prefixes = NULL;
-    }
-
-    /* Clear flags and adjust the count. */
-    if (c->flags & CLIENT_TRACKING) {
-        server.tracking_clients--;
-        c->flags &= ~(CLIENT_TRACKING|CLIENT_TRACKING_BROKEN_REDIR|
-                      CLIENT_TRACKING_BCAST|CLIENT_TRACKING_OPTIN|
-                      CLIENT_TRACKING_OPTOUT|CLIENT_TRACKING_CACHING|
-                      CLIENT_TRACKING_NOLOOP);
-    }
-}
-
-static int stringCheckPrefix(unsigned char *s1, size_t s1_len, unsigned char *s2, size_t s2_len) {
-    size_t min_length = s1_len < s2_len ? s1_len : s2_len;
-    return memcmp(s1,s2,min_length) == 0;   
-}
-
-/* Check if any of the provided prefixes collide with one another or
- * with an existing prefix for the client. A collision is defined as two 
- * prefixes that will emit an invalidation for the same key. If no prefix 
- * collision is found, 1 is return, otherwise 0 is returned and the client 
- * has an error emitted describing the error. */
-int checkPrefixCollisionsOrReply(client *c, robj **prefixes, size_t numprefix) {
-    for (size_t i = 0; i < numprefix; i++) {
-        /* Check input list has no overlap with existing prefixes. */
-        if (c->client_tracking_prefixes) {
-            raxIterator ri;
-            raxStart(&ri,c->client_tracking_prefixes);
-            raxSeek(&ri,"^",NULL,0);
-            while(raxNext(&ri)) {
-                if (stringCheckPrefix(ri.key,ri.key_len,
-                    prefixes[i]->ptr,sdslen(prefixes[i]->ptr))) 
-                {
-                    sds collision = sdsnewlen(ri.key,ri.key_len);
-                    addReplyErrorFormat(c,
-                        "Prefix '%s' overlaps with an existing prefix '%s'. "
-                        "Prefixes for a single client must not overlap.",
-                        (unsigned char *)prefixes[i]->ptr,
-                        (unsigned char *)collision);
-                    sdsfree(collision);
-                    raxStop(&ri);
-                    return 0;
-                }
-            }
-            raxStop(&ri);
-        }
-        /* Check input has no overlap with itself. */
-        for (size_t j = i + 1; j < numprefix; j++) {
-            if (stringCheckPrefix(prefixes[i]->ptr,sdslen(prefixes[i]->ptr),
-                prefixes[j]->ptr,sdslen(prefixes[j]->ptr)))
-            {
-                addReplyErrorFormat(c,
-                    "Prefix '%s' overlaps with another provided prefix '%s'. "
-                    "Prefixes for a single client must not overlap.",
-                    (unsigned char *)prefixes[i]->ptr,
-                    (unsigned char *)prefixes[j]->ptr);
-                return i;
-            }
-        }
-    }
-    return 1;
-}
-
-/* Set the client 'c' to track the prefix 'prefix'. If the client 'c' is
- * already registered for the specified prefix, no operation is performed. */
-void enableBcastTrackingForPrefix(client *c, char *prefix, size_t plen) {
-    bcastState *bs = raxFind(PrefixTable,(unsigned char*)prefix,plen);
-    /* If this is the first client subscribing to such prefix, create
-     * the prefix in the table. */
-    if (bs == raxNotFound) {
-        bs = zmalloc(sizeof(*bs));
-        bs->keys = raxNew();
-        bs->clients = raxNew();
-        raxInsert(PrefixTable,(unsigned char*)prefix,plen,bs,NULL);
-    }
-    if (raxTryInsert(bs->clients,(unsigned char*)&c,sizeof(c),NULL,NULL)) {
-        if (c->client_tracking_prefixes == NULL)
-            c->client_tracking_prefixes = raxNew();
-        raxInsert(c->client_tracking_prefixes,
-                  (unsigned char*)prefix,plen,NULL,NULL);
-    }
-}
-
-/* Enable the tracking state for the client 'c', and as a side effect allocates
- * the tracking table if needed. If the 'redirect_to' argument is non zero, the
- * invalidation messages for this client will be sent to the client ID
- * specified by the 'redirect_to' argument. Note that if such client will
- * eventually get freed, we'll send a message to the original client to
- * inform it of the condition. Multiple clients can redirect the invalidation
- * messages to the same client ID. */
-void enableTracking(client *c, uint64_t redirect_to, uint64_t options, robj **prefix, size_t numprefix) {
-    if (!(c->flags & CLIENT_TRACKING)) server.tracking_clients++;
-    c->flags |= CLIENT_TRACKING;
-    c->flags &= ~(CLIENT_TRACKING_BROKEN_REDIR|CLIENT_TRACKING_BCAST|
-                  CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT|
-                  CLIENT_TRACKING_NOLOOP);
-    c->client_tracking_redirection = redirect_to;
-
-    /* This may be the first client we ever enable. Create the tracking
-     * table if it does not exist. */
-    if (TrackingTable == NULL) {
-        TrackingTable = raxNew();
-        PrefixTable = raxNew();
-        TrackingChannelName = createStringObject("__redis__:invalidate",20);
-    }
-
-    /* For broadcasting, set the list of prefixes in the client. */
-    if (options & CLIENT_TRACKING_BCAST) {
-        c->flags |= CLIENT_TRACKING_BCAST;
-        if (numprefix == 0) enableBcastTrackingForPrefix(c,"",0);
-        for (size_t j = 0; j < numprefix; j++) {
-            sds sdsprefix = prefix[j]->ptr;
-            enableBcastTrackingForPrefix(c,sdsprefix,sdslen(sdsprefix));
-        }
-    }
-
-    /* Set the remaining flags that don't need any special handling. */
-    c->flags |= options & (CLIENT_TRACKING_OPTIN|CLIENT_TRACKING_OPTOUT|
-                           CLIENT_TRACKING_NOLOOP);
-}
-
-/* This function is called after the execution of a readonly command in the
- * case the client 'c' has keys tracking enabled and the tracking is not
- * in BCAST mode. It will populate the tracking invalidation table according
- * to the keys the user fetched, so that Redis will know what are the clients
- * that should receive an invalidation message with certain groups of keys
- * are modified. */
-void trackingRememberKeys(client *c) {
-    /* Return if we are in optin/out mode and the right CACHING command
-     * was/wasn't given in order to modify the default behavior. */
-    uint64_t optin = c->flags & CLIENT_TRACKING_OPTIN;
-    uint64_t optout = c->flags & CLIENT_TRACKING_OPTOUT;
-    uint64_t caching_given = c->flags & CLIENT_TRACKING_CACHING;
-    if ((optin && !caching_given) || (optout && caching_given)) return;
-
-    getKeysResult result = GETKEYS_RESULT_INIT;
-    int numkeys = getKeysFromCommand(c->cmd,c->argv,c->argc,&result);
-    if (!numkeys) {
-        getKeysFreeResult(&result);
-        return;
-    }
-
-    int *keys = result.keys;
-
-    for(int j = 0; j < numkeys; j++) {
-        int idx = keys[j];
-        sds sdskey = c->argv[idx]->ptr;
-        rax *ids = raxFind(TrackingTable,(unsigned char*)sdskey,sdslen(sdskey));
-        if (ids == raxNotFound) {
-            ids = raxNew();
-            int inserted = raxTryInsert(TrackingTable,(unsigned char*)sdskey,
-                                        sdslen(sdskey),ids, NULL);
-            serverAssert(inserted == 1);
-        }
-        if (raxTryInsert(ids,(unsigned char*)&c->id,sizeof(c->id),NULL,NULL))
-            TrackingTableTotalItems++;
-    }
-    getKeysFreeResult(&result);
-}
-
-/* Given a key name, this function sends an invalidation message in the
- * proper channel (depending on RESP version: PubSub or Push message) and
- * to the proper client (in case fo redirection), in the context of the
- * client 'c' with tracking enabled.
- *
- * In case the 'proto' argument is non zero, the function will assume that
- * 'keyname' points to a buffer of 'keylen' bytes already expressed in the
- * form of Redis RESP protocol. This is used for:
- * - In BCAST mode, to send an array of invalidated keys to all
- *   applicable clients
- * - Following a flush command, to send a single RESP NULL to indicate
- *   that all keys are now invalid. */
-void sendTrackingMessage(client *c, char *keyname, size_t keylen, int proto) {
-    int using_redirection = 0;
-    if (c->client_tracking_redirection) {
-        client *redir = lookupClientByID(c->client_tracking_redirection);
-        if (!redir) {
-            c->flags |= CLIENT_TRACKING_BROKEN_REDIR;
-            /* We need to signal to the original connection that we
-             * are unable to send invalidation messages to the redirected
-             * connection, because the client no longer exist. */
-            if (c->resp > 2) {
-                addReplyPushLen(c,2);
-                addReplyBulkCBuffer(c,"tracking-redir-broken",21);
-                addReplyLongLong(c,c->client_tracking_redirection);
-            }
-            return;
-        }
-        c = redir;
-        using_redirection = 1;
-    }
-
-    /* Only send such info for clients in RESP version 3 or more. However
-     * if redirection is active, and the connection we redirect to is
-     * in Pub/Sub mode, we can support the feature with RESP 2 as well,
-     * by sending Pub/Sub messages in the __redis__:invalidate channel. */
-    if (c->resp > 2) {
-        addReplyPushLen(c,2);
-        addReplyBulkCBuffer(c,"invalidate",10);
-    } else if (using_redirection && c->flags & CLIENT_PUBSUB) {
-        /* We use a static object to speedup things, however we assume
-         * that addReplyPubsubMessage() will not take a reference. */
-        addReplyPubsubMessage(c,TrackingChannelName,NULL);
-    } else {
-        /* If are here, the client is not using RESP3, nor is
-         * redirecting to another client. We can't send anything to
-         * it since RESP2 does not support push messages in the same
-         * connection. */
-        return;
-    }
-
-    /* Send the "value" part, which is the array of keys. */
-    if (proto) {
-        addReplyProto(c,keyname,keylen);
-    } else {
-        addReplyArrayLen(c,1);
-        addReplyBulkCBuffer(c,keyname,keylen);
-    }
-}
-
-/* This function is called when a key is modified in Redis and in the case
- * we have at least one client with the BCAST mode enabled.
- * Its goal is to set the key in the right broadcast state if the key
- * matches one or more prefixes in the prefix table. Later when we
- * return to the event loop, we'll send invalidation messages to the
- * clients subscribed to each prefix. */
-void trackingRememberKeyToBroadcast(client *c, char *keyname, size_t keylen) {
-    raxIterator ri;
-    raxStart(&ri,PrefixTable);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        if (ri.key_len > keylen) continue;
-        if (ri.key_len != 0 && memcmp(ri.key,keyname,ri.key_len) != 0)
-            continue;
-        bcastState *bs = ri.data;
-        /* We insert the client pointer as associated value in the radix
-         * tree. This way we know who was the client that did the last
-         * change to the key, and can avoid sending the notification in the
-         * case the client is in NOLOOP mode. */
-        raxInsert(bs->keys,(unsigned char*)keyname,keylen,c,NULL);
-    }
-    raxStop(&ri);
-}
-
-/* This function is called from signalModifiedKey() or other places in Redis
- * when a key changes value. In the context of keys tracking, our task here is
- * to send a notification to every client that may have keys about such caching
- * slot.
- *
- * Note that 'c' may be NULL in case the operation was performed outside the
- * context of a client modifying the database (for instance when we delete a
- * key because of expire).
- *
- * The last argument 'bcast' tells the function if it should also schedule
- * the key for broadcasting to clients in BCAST mode. This is the case when
- * the function is called from the Redis core once a key is modified, however
- * we also call the function in order to evict keys in the key table in case
- * of memory pressure: in that case the key didn't really change, so we want
- * just to notify the clients that are in the table for this key, that would
- * otherwise miss the fact we are no longer tracking the key for them. */
-void trackingInvalidateKeyRaw(client *c, char *key, size_t keylen, int bcast) {
-    if (TrackingTable == NULL) return;
-
-    if (bcast && raxSize(PrefixTable) > 0)
-        trackingRememberKeyToBroadcast(c,key,keylen);
-
-    rax *ids = raxFind(TrackingTable,(unsigned char*)key,keylen);
-    if (ids == raxNotFound) return;
-
-    raxIterator ri;
-    raxStart(&ri,ids);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        uint64_t id;
-        memcpy(&id,ri.key,sizeof(id));
-        client *target = lookupClientByID(id);
-        /* Note that if the client is in BCAST mode, we don't want to
-         * send invalidation messages that were pending in the case
-         * previously the client was not in BCAST mode. This can happen if
-         * TRACKING is enabled normally, and then the client switches to
-         * BCAST mode. */
-        if (target == NULL ||
-            !(target->flags & CLIENT_TRACKING)||
-            target->flags & CLIENT_TRACKING_BCAST)
-        {
-            continue;
-        }
-
-        /* If the client enabled the NOLOOP mode, don't send notifications
-         * about keys changed by the client itself. */
-        if (target->flags & CLIENT_TRACKING_NOLOOP &&
-            target == c)
-        {
-            continue;
-        }
-
-        sendTrackingMessage(target,key,keylen,0);
-    }
-    raxStop(&ri);
-
-    /* Free the tracking table: we'll create the radix tree and populate it
-     * again if more keys will be modified in this caching slot. */
-    TrackingTableTotalItems -= raxSize(ids);
-    raxFree(ids);
-    raxRemove(TrackingTable,(unsigned char*)key,keylen,NULL);
-}
-
-/* Wrapper (the one actually called across the core) to pass the key
- * as object. */
-void trackingInvalidateKey(client *c, robj *keyobj) {
-    trackingInvalidateKeyRaw(c,keyobj->ptr,sdslen(keyobj->ptr),1);
-}
-
-/* This function is called when one or all the Redis databases are
- * flushed. Caching keys are not specific for each DB but are global: 
- * currently what we do is send a special notification to clients with 
- * tracking enabled, sending a RESP NULL, which means, "all the keys", 
- * in order to avoid flooding clients with many invalidation messages 
- * for all the keys they may hold.
- */
-void freeTrackingRadixTreeCallback(void *rt) {
-    raxFree(rt);
-}
-
-void freeTrackingRadixTree(rax *rt) {
-    raxFreeWithCallback(rt,freeTrackingRadixTreeCallback);
-}
-
-/* A RESP NULL is sent to indicate that all keys are invalid */
-void trackingInvalidateKeysOnFlush(int async) {
-    if (server.tracking_clients) {
-        listNode *ln;
-        listIter li;
-        listRewind(server.clients,&li);
-        while ((ln = listNext(&li)) != NULL) {
-            client *c = listNodeValue(ln);
-            if (c->flags & CLIENT_TRACKING) {
-                sendTrackingMessage(c,shared.null[c->resp]->ptr,sdslen(shared.null[c->resp]->ptr),1);
-            }
-        }
-    }
-
-    /* In case of FLUSHALL, reclaim all the memory used by tracking. */
-    if (TrackingTable) {
-        if (async) {
-            freeTrackingRadixTreeAsync(TrackingTable);
-        } else {
-            freeTrackingRadixTree(TrackingTable);
-        }
-        TrackingTable = raxNew();
-        TrackingTableTotalItems = 0;
-    }
-}
-
-/* Tracking forces Redis to remember information about which client may have
- * certain keys. In workloads where there are a lot of reads, but keys are
- * hardly modified, the amount of information we have to remember server side
- * could be a lot, with the number of keys being totally not bound.
- *
- * So Redis allows the user to configure a maximum number of keys for the
- * invalidation table. This function makes sure that we don't go over the
- * specified fill rate: if we are over, we can just evict informations about
- * a random key, and send invalidation messages to clients like if the key was
- * modified. */
-void trackingLimitUsedSlots(void) {
-    static unsigned int timeout_counter = 0;
-    if (TrackingTable == NULL) return;
-    if (server.tracking_table_max_keys == 0) return; /* No limits set. */
-    size_t max_keys = server.tracking_table_max_keys;
-    if (raxSize(TrackingTable) <= max_keys) {
-        timeout_counter = 0;
-        return; /* Limit not reached. */
-    }
-
-    /* We have to invalidate a few keys to reach the limit again. The effort
-     * we do here is proportional to the number of times we entered this
-     * function and found that we are still over the limit. */
-    int effort = 100 * (timeout_counter+1);
-
-    /* We just remove one key after another by using a random walk. */
-    raxIterator ri;
-    raxStart(&ri,TrackingTable);
-    while(effort > 0) {
-        effort--;
-        raxSeek(&ri,"^",NULL,0);
-        raxRandomWalk(&ri,0);
-        if (raxEOF(&ri)) break;
-        trackingInvalidateKeyRaw(NULL,(char*)ri.key,ri.key_len,0);
-        if (raxSize(TrackingTable) <= max_keys) {
-            timeout_counter = 0;
-            raxStop(&ri);
-            return; /* Return ASAP: we are again under the limit. */
-        }
-    }
-
-    /* If we reach this point, we were not able to go under the configured
-     * limit using the maximum effort we had for this run. */
-    raxStop(&ri);
-    timeout_counter++;
-}
-
-/* Generate Redis protocol for an array containing all the key names
- * in the 'keys' radix tree. If the client is not NULL, the list will not
- * include keys that were modified the last time by this client, in order
- * to implement the NOLOOP option.
- *
- * If the resultin array would be empty, NULL is returned instead. */
-sds trackingBuildBroadcastReply(client *c, rax *keys) {
-    raxIterator ri;
-    uint64_t count;
-
-    if (c == NULL) {
-        count = raxSize(keys);
-    } else {
-        count = 0;
-        raxStart(&ri,keys);
-        raxSeek(&ri,"^",NULL,0);
-        while(raxNext(&ri)) {
-            if (ri.data != c) count++;
-        }
-        raxStop(&ri);
-
-        if (count == 0) return NULL;
-    }
-
-    /* Create the array reply with the list of keys once, then send
-    * it to all the clients subscribed to this prefix. */
-    char buf[32];
-    size_t len = ll2string(buf,sizeof(buf),count);
-    sds proto = sdsempty();
-    proto = sdsMakeRoomFor(proto,count*15);
-    proto = sdscatlen(proto,"*",1);
-    proto = sdscatlen(proto,buf,len);
-    proto = sdscatlen(proto,"\r\n",2);
-    raxStart(&ri,keys);
-    raxSeek(&ri,"^",NULL,0);
-    while(raxNext(&ri)) {
-        if (c && ri.data == c) continue;
-        len = ll2string(buf,sizeof(buf),ri.key_len);
-        proto = sdscatlen(proto,"$",1);
-        proto = sdscatlen(proto,buf,len);
-        proto = sdscatlen(proto,"\r\n",2);
-        proto = sdscatlen(proto,ri.key,ri.key_len);
-        proto = sdscatlen(proto,"\r\n",2);
-    }
-    raxStop(&ri);
-    return proto;
-}
-
-/* This function will run the prefixes of clients in BCAST mode and
- * keys that were modified about each prefix, and will send the
- * notifications to each client in each prefix. */
-void trackingBroadcastInvalidationMessages(void) {
-    raxIterator ri, ri2;
-
-    /* Return ASAP if there is nothing to do here. */
-    if (TrackingTable == NULL || !server.tracking_clients) return;
-
-    raxStart(&ri,PrefixTable);
-    raxSeek(&ri,"^",NULL,0);
-
-    /* For each prefix... */
-    while(raxNext(&ri)) {
-        bcastState *bs = ri.data;
-
-        if (raxSize(bs->keys)) {
-            /* Generate the common protocol for all the clients that are
-             * not using the NOLOOP option. */
-            sds proto = trackingBuildBroadcastReply(NULL,bs->keys);
-
-            /* Send this array of keys to every client in the list. */
-            raxStart(&ri2,bs->clients);
-            raxSeek(&ri2,"^",NULL,0);
-            while(raxNext(&ri2)) {
-                client *c;
-                memcpy(&c,ri2.key,sizeof(c));
-                if (c->flags & CLIENT_TRACKING_NOLOOP) {
-                    /* This client may have certain keys excluded. */
-                    sds adhoc = trackingBuildBroadcastReply(c,bs->keys);
-                    if (adhoc) {
-                        sendTrackingMessage(c,adhoc,sdslen(adhoc),1);
-                        sdsfree(adhoc);
-                    }
-                } else {
-                    sendTrackingMessage(c,proto,sdslen(proto),1);
-                }
-            }
-            raxStop(&ri2);
-
-            /* Clean up: we can remove everything from this state, because we
-             * want to only track the new keys that will be accumulated starting
-             * from now. */
-            sdsfree(proto);
-        }
-        raxFree(bs->keys);
-        bs->keys = raxNew();
-    }
-    raxStop(&ri);
-}
-
-/* This is just used in order to access the amount of used slots in the
- * tracking table. */
-uint64_t trackingGetTotalItems(void) {
-    return TrackingTableTotalItems;
-}
-
-uint64_t trackingGetTotalKeys(void) {
-    if (TrackingTable == NULL) return 0;
-    return raxSize(TrackingTable);
-}
-
-uint64_t trackingGetTotalPrefixes(void) {
-    if (PrefixTable == NULL) return 0;
-    return raxSize(PrefixTable);
-}
diff --git a/redis-stable/src/util.c b/redis-stable/src/util.c
deleted file mode 100644
index df7a489a..00000000
--- a/redis-stable/src/util.c
+++ /dev/null
@@ -1,959 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "fmacros.h"
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <ctype.h>
-#include <limits.h>
-#include <math.h>
-#include <unistd.h>
-#include <sys/time.h>
-#include <float.h>
-#include <stdint.h>
-#include <errno.h>
-#include <time.h>
-
-#include "util.h"
-#include "sha256.h"
-
-/* Glob-style pattern matching. */
-int stringmatchlen(const char *pattern, int patternLen,
-        const char *string, int stringLen, int nocase)
-{
-    while(patternLen && stringLen) {
-        switch(pattern[0]) {
-        case '*':
-            while (patternLen && pattern[1] == '*') {
-                pattern++;
-                patternLen--;
-            }
-            if (patternLen == 1)
-                return 1; /* match */
-            while(stringLen) {
-                if (stringmatchlen(pattern+1, patternLen-1,
-                            string, stringLen, nocase))
-                    return 1; /* match */
-                string++;
-                stringLen--;
-            }
-            return 0; /* no match */
-            break;
-        case '?':
-            string++;
-            stringLen--;
-            break;
-        case '[':
-        {
-            int not, match;
-
-            pattern++;
-            patternLen--;
-            not = pattern[0] == '^';
-            if (not) {
-                pattern++;
-                patternLen--;
-            }
-            match = 0;
-            while(1) {
-                if (pattern[0] == '\\' && patternLen >= 2) {
-                    pattern++;
-                    patternLen--;
-                    if (pattern[0] == string[0])
-                        match = 1;
-                } else if (pattern[0] == ']') {
-                    break;
-                } else if (patternLen == 0) {
-                    pattern--;
-                    patternLen++;
-                    break;
-                } else if (patternLen >= 3 && pattern[1] == '-') {
-                    int start = pattern[0];
-                    int end = pattern[2];
-                    int c = string[0];
-                    if (start > end) {
-                        int t = start;
-                        start = end;
-                        end = t;
-                    }
-                    if (nocase) {
-                        start = tolower(start);
-                        end = tolower(end);
-                        c = tolower(c);
-                    }
-                    pattern += 2;
-                    patternLen -= 2;
-                    if (c >= start && c <= end)
-                        match = 1;
-                } else {
-                    if (!nocase) {
-                        if (pattern[0] == string[0])
-                            match = 1;
-                    } else {
-                        if (tolower((int)pattern[0]) == tolower((int)string[0]))
-                            match = 1;
-                    }
-                }
-                pattern++;
-                patternLen--;
-            }
-            if (not)
-                match = !match;
-            if (!match)
-                return 0; /* no match */
-            string++;
-            stringLen--;
-            break;
-        }
-        case '\\':
-            if (patternLen >= 2) {
-                pattern++;
-                patternLen--;
-            }
-            /* fall through */
-        default:
-            if (!nocase) {
-                if (pattern[0] != string[0])
-                    return 0; /* no match */
-            } else {
-                if (tolower((int)pattern[0]) != tolower((int)string[0]))
-                    return 0; /* no match */
-            }
-            string++;
-            stringLen--;
-            break;
-        }
-        pattern++;
-        patternLen--;
-        if (stringLen == 0) {
-            while(*pattern == '*') {
-                pattern++;
-                patternLen--;
-            }
-            break;
-        }
-    }
-    if (patternLen == 0 && stringLen == 0)
-        return 1;
-    return 0;
-}
-
-int stringmatch(const char *pattern, const char *string, int nocase) {
-    return stringmatchlen(pattern,strlen(pattern),string,strlen(string),nocase);
-}
-
-/* Fuzz stringmatchlen() trying to crash it with bad input. */
-int stringmatchlen_fuzz_test(void) {
-    char str[32];
-    char pat[32];
-    int cycles = 10000000;
-    int total_matches = 0;
-    while(cycles--) {
-        int strlen = rand() % sizeof(str);
-        int patlen = rand() % sizeof(pat);
-        for (int j = 0; j < strlen; j++) str[j] = rand() % 128;
-        for (int j = 0; j < patlen; j++) pat[j] = rand() % 128;
-        total_matches += stringmatchlen(pat, patlen, str, strlen, 0);
-    }
-    return total_matches;
-}
-
-/* Convert a string representing an amount of memory into the number of
- * bytes, so for instance memtoll("1Gb") will return 1073741824 that is
- * (1024*1024*1024).
- *
- * On parsing error, if *err is not NULL, it's set to 1, otherwise it's
- * set to 0. On error the function return value is 0, regardless of the
- * fact 'err' is NULL or not. */
-long long memtoll(const char *p, int *err) {
-    const char *u;
-    char buf[128];
-    long mul; /* unit multiplier */
-    long long val;
-    unsigned int digits;
-
-    if (err) *err = 0;
-
-    /* Search the first non digit character. */
-    u = p;
-    if (*u == '-') u++;
-    while(*u && isdigit(*u)) u++;
-    if (*u == '\0' || !strcasecmp(u,"b")) {
-        mul = 1;
-    } else if (!strcasecmp(u,"k")) {
-        mul = 1000;
-    } else if (!strcasecmp(u,"kb")) {
-        mul = 1024;
-    } else if (!strcasecmp(u,"m")) {
-        mul = 1000*1000;
-    } else if (!strcasecmp(u,"mb")) {
-        mul = 1024*1024;
-    } else if (!strcasecmp(u,"g")) {
-        mul = 1000L*1000*1000;
-    } else if (!strcasecmp(u,"gb")) {
-        mul = 1024L*1024*1024;
-    } else {
-        if (err) *err = 1;
-        return 0;
-    }
-
-    /* Copy the digits into a buffer, we'll use strtoll() to convert
-     * the digit (without the unit) into a number. */
-    digits = u-p;
-    if (digits >= sizeof(buf)) {
-        if (err) *err = 1;
-        return 0;
-    }
-    memcpy(buf,p,digits);
-    buf[digits] = '\0';
-
-    char *endptr;
-    errno = 0;
-    val = strtoll(buf,&endptr,10);
-    if ((val == 0 && errno == EINVAL) || *endptr != '\0') {
-        if (err) *err = 1;
-        return 0;
-    }
-    return val*mul;
-}
-
-/* Search a memory buffer for any set of bytes, like strpbrk().
- * Returns pointer to first found char or NULL.
- */
-const char *mempbrk(const char *s, size_t len, const char *chars, size_t charslen) {
-    for (size_t j = 0; j < len; j++) {
-        for (size_t n = 0; n < charslen; n++)
-            if (s[j] == chars[n]) return &s[j];
-    }
-
-    return NULL;
-}
-
-/* Modify the buffer replacing all occurrences of chars from the 'from'
- * set with the corresponding char in the 'to' set. Always returns s.
- */
-char *memmapchars(char *s, size_t len, const char *from, const char *to, size_t setlen) {
-    for (size_t j = 0; j < len; j++) {
-        for (size_t i = 0; i < setlen; i++) {
-            if (s[j] == from[i]) {
-                s[j] = to[i];
-                break;
-            }
-        }
-    }
-    return s;
-}
-
-/* Return the number of digits of 'v' when converted to string in radix 10.
- * See ll2string() for more information. */
-uint32_t digits10(uint64_t v) {
-    if (v < 10) return 1;
-    if (v < 100) return 2;
-    if (v < 1000) return 3;
-    if (v < 1000000000000UL) {
-        if (v < 100000000UL) {
-            if (v < 1000000) {
-                if (v < 10000) return 4;
-                return 5 + (v >= 100000);
-            }
-            return 7 + (v >= 10000000UL);
-        }
-        if (v < 10000000000UL) {
-            return 9 + (v >= 1000000000UL);
-        }
-        return 11 + (v >= 100000000000UL);
-    }
-    return 12 + digits10(v / 1000000000000UL);
-}
-
-/* Like digits10() but for signed values. */
-uint32_t sdigits10(int64_t v) {
-    if (v < 0) {
-        /* Abs value of LLONG_MIN requires special handling. */
-        uint64_t uv = (v != LLONG_MIN) ?
-                      (uint64_t)-v : ((uint64_t) LLONG_MAX)+1;
-        return digits10(uv)+1; /* +1 for the minus. */
-    } else {
-        return digits10(v);
-    }
-}
-
-/* Convert a long long into a string. Returns the number of
- * characters needed to represent the number.
- * If the buffer is not big enough to store the string, 0 is returned.
- *
- * Based on the following article (that apparently does not provide a
- * novel approach but only publicizes an already used technique):
- *
- * https://www.facebook.com/notes/facebook-engineering/three-optimization-tips-for-c/10151361643253920
- *
- * Modified in order to handle signed integers since the original code was
- * designed for unsigned integers. */
-int ll2string(char *dst, size_t dstlen, long long svalue) {
-    static const char digits[201] =
-        "0001020304050607080910111213141516171819"
-        "2021222324252627282930313233343536373839"
-        "4041424344454647484950515253545556575859"
-        "6061626364656667686970717273747576777879"
-        "8081828384858687888990919293949596979899";
-    int negative;
-    unsigned long long value;
-
-    /* The main loop works with 64bit unsigned integers for simplicity, so
-     * we convert the number here and remember if it is negative. */
-    if (svalue < 0) {
-        if (svalue != LLONG_MIN) {
-            value = -svalue;
-        } else {
-            value = ((unsigned long long) LLONG_MAX)+1;
-        }
-        negative = 1;
-    } else {
-        value = svalue;
-        negative = 0;
-    }
-
-    /* Check length. */
-    uint32_t const length = digits10(value)+negative;
-    if (length >= dstlen) return 0;
-
-    /* Null term. */
-    uint32_t next = length;
-    dst[next] = '\0';
-    next--;
-    while (value >= 100) {
-        int const i = (value % 100) * 2;
-        value /= 100;
-        dst[next] = digits[i + 1];
-        dst[next - 1] = digits[i];
-        next -= 2;
-    }
-
-    /* Handle last 1-2 digits. */
-    if (value < 10) {
-        dst[next] = '0' + (uint32_t) value;
-    } else {
-        int i = (uint32_t) value * 2;
-        dst[next] = digits[i + 1];
-        dst[next - 1] = digits[i];
-    }
-
-    /* Add sign. */
-    if (negative) dst[0] = '-';
-    return length;
-}
-
-/* Convert a string into a long long. Returns 1 if the string could be parsed
- * into a (non-overflowing) long long, 0 otherwise. The value will be set to
- * the parsed value when appropriate.
- *
- * Note that this function demands that the string strictly represents
- * a long long: no spaces or other characters before or after the string
- * representing the number are accepted, nor zeroes at the start if not
- * for the string "0" representing the zero number.
- *
- * Because of its strictness, it is safe to use this function to check if
- * you can convert a string into a long long, and obtain back the string
- * from the number without any loss in the string representation. */
-int string2ll(const char *s, size_t slen, long long *value) {
-    const char *p = s;
-    size_t plen = 0;
-    int negative = 0;
-    unsigned long long v;
-
-    /* A zero length string is not a valid number. */
-    if (plen == slen)
-        return 0;
-
-    /* Special case: first and only digit is 0. */
-    if (slen == 1 && p[0] == '0') {
-        if (value != NULL) *value = 0;
-        return 1;
-    }
-
-    /* Handle negative numbers: just set a flag and continue like if it
-     * was a positive number. Later convert into negative. */
-    if (p[0] == '-') {
-        negative = 1;
-        p++; plen++;
-
-        /* Abort on only a negative sign. */
-        if (plen == slen)
-            return 0;
-    }
-
-    /* First digit should be 1-9, otherwise the string should just be 0. */
-    if (p[0] >= '1' && p[0] <= '9') {
-        v = p[0]-'0';
-        p++; plen++;
-    } else {
-        return 0;
-    }
-
-    /* Parse all the other digits, checking for overflow at every step. */
-    while (plen < slen && p[0] >= '0' && p[0] <= '9') {
-        if (v > (ULLONG_MAX / 10)) /* Overflow. */
-            return 0;
-        v *= 10;
-
-        if (v > (ULLONG_MAX - (p[0]-'0'))) /* Overflow. */
-            return 0;
-        v += p[0]-'0';
-
-        p++; plen++;
-    }
-
-    /* Return if not all bytes were used. */
-    if (plen < slen)
-        return 0;
-
-    /* Convert to negative if needed, and do the final overflow check when
-     * converting from unsigned long long to long long. */
-    if (negative) {
-        if (v > ((unsigned long long)(-(LLONG_MIN+1))+1)) /* Overflow. */
-            return 0;
-        if (value != NULL) *value = -v;
-    } else {
-        if (v > LLONG_MAX) /* Overflow. */
-            return 0;
-        if (value != NULL) *value = v;
-    }
-    return 1;
-}
-
-/* Helper function to convert a string to an unsigned long long value.
- * The function attempts to use the faster string2ll() function inside
- * Redis: if it fails, strtoull() is used instead. The function returns
- * 1 if the conversion happened successfully or 0 if the number is
- * invalid or out of range. */
-int string2ull(const char *s, unsigned long long *value) {
-    long long ll;
-    if (string2ll(s,strlen(s),&ll)) {
-        if (ll < 0) return 0; /* Negative values are out of range. */
-        *value = ll;
-        return 1;
-    }
-    errno = 0;
-    char *endptr = NULL;
-    *value = strtoull(s,&endptr,10);
-    if (errno == EINVAL || errno == ERANGE || !(*s != '\0' && *endptr == '\0'))
-        return 0; /* strtoull() failed. */
-    return 1; /* Conversion done! */
-}
-
-/* Convert a string into a long. Returns 1 if the string could be parsed into a
- * (non-overflowing) long, 0 otherwise. The value will be set to the parsed
- * value when appropriate. */
-int string2l(const char *s, size_t slen, long *lval) {
-    long long llval;
-
-    if (!string2ll(s,slen,&llval))
-        return 0;
-
-    if (llval < LONG_MIN || llval > LONG_MAX)
-        return 0;
-
-    *lval = (long)llval;
-    return 1;
-}
-
-/* Convert a string into a double. Returns 1 if the string could be parsed
- * into a (non-overflowing) double, 0 otherwise. The value will be set to
- * the parsed value when appropriate.
- *
- * Note that this function demands that the string strictly represents
- * a double: no spaces or other characters before or after the string
- * representing the number are accepted. */
-int string2ld(const char *s, size_t slen, long double *dp) {
-    char buf[MAX_LONG_DOUBLE_CHARS];
-    long double value;
-    char *eptr;
-
-    if (slen == 0 || slen >= sizeof(buf)) return 0;
-    memcpy(buf,s,slen);
-    buf[slen] = '\0';
-
-    errno = 0;
-    value = strtold(buf, &eptr);
-    if (isspace(buf[0]) || eptr[0] != '\0' ||
-        (size_t)(eptr-buf) != slen ||
-        (errno == ERANGE &&
-            (value == HUGE_VAL || value == -HUGE_VAL || value == 0)) ||
-        errno == EINVAL ||
-        isnan(value))
-        return 0;
-
-    if (dp) *dp = value;
-    return 1;
-}
-
-/* Convert a string into a double. Returns 1 if the string could be parsed
- * into a (non-overflowing) double, 0 otherwise. The value will be set to
- * the parsed value when appropriate.
- *
- * Note that this function demands that the string strictly represents
- * a double: no spaces or other characters before or after the string
- * representing the number are accepted. */
-int string2d(const char *s, size_t slen, double *dp) {
-    errno = 0;
-    char *eptr;
-    *dp = strtod(s, &eptr);
-    if (slen == 0 ||
-        isspace(((const char*)s)[0]) ||
-        (size_t)(eptr-(char*)s) != slen ||
-        (errno == ERANGE &&
-            (*dp == HUGE_VAL || *dp == -HUGE_VAL || *dp == 0)) ||
-        isnan(*dp))
-        return 0;
-    return 1;
-}
-
-/* Convert a double to a string representation. Returns the number of bytes
- * required. The representation should always be parsable by strtod(3).
- * This function does not support human-friendly formatting like ld2string
- * does. It is intended mainly to be used inside t_zset.c when writing scores
- * into a ziplist representing a sorted set. */
-int d2string(char *buf, size_t len, double value) {
-    if (isnan(value)) {
-        len = snprintf(buf,len,"nan");
-    } else if (isinf(value)) {
-        if (value < 0)
-            len = snprintf(buf,len,"-inf");
-        else
-            len = snprintf(buf,len,"inf");
-    } else if (value == 0) {
-        /* See: http://en.wikipedia.org/wiki/Signed_zero, "Comparisons". */
-        if (1.0/value < 0)
-            len = snprintf(buf,len,"-0");
-        else
-            len = snprintf(buf,len,"0");
-    } else {
-#if (DBL_MANT_DIG >= 52) && (LLONG_MAX == 0x7fffffffffffffffLL)
-        /* Check if the float is in a safe range to be casted into a
-         * long long. We are assuming that long long is 64 bit here.
-         * Also we are assuming that there are no implementations around where
-         * double has precision < 52 bit.
-         *
-         * Under this assumptions we test if a double is inside an interval
-         * where casting to long long is safe. Then using two castings we
-         * make sure the decimal part is zero. If all this is true we use
-         * integer printing function that is much faster. */
-        double min = -4503599627370495; /* (2^52)-1 */
-        double max = 4503599627370496; /* -(2^52) */
-        if (value > min && value < max && value == ((double)((long long)value)))
-            len = ll2string(buf,len,(long long)value);
-        else
-#endif
-            len = snprintf(buf,len,"%.17g",value);
-    }
-
-    return len;
-}
-
-/* Create a string object from a long double.
- * If mode is humanfriendly it does not use exponential format and trims trailing
- * zeroes at the end (may result in loss of precision).
- * If mode is default exp format is used and the output of snprintf()
- * is not modified (may result in loss of precision).
- * If mode is hex hexadecimal format is used (no loss of precision)
- *
- * The function returns the length of the string or zero if there was not
- * enough buffer room to store it. */
-int ld2string(char *buf, size_t len, long double value, ld2string_mode mode) {
-    size_t l = 0;
-
-    if (isinf(value)) {
-        /* Libc in odd systems (Hi Solaris!) will format infinite in a
-         * different way, so better to handle it in an explicit way. */
-        if (len < 5) return 0; /* No room. 5 is "-inf\0" */
-        if (value > 0) {
-            memcpy(buf,"inf",3);
-            l = 3;
-        } else {
-            memcpy(buf,"-inf",4);
-            l = 4;
-        }
-    } else {
-        switch (mode) {
-        case LD_STR_AUTO:
-            l = snprintf(buf,len,"%.17Lg",value);
-            if (l+1 > len) return 0; /* No room. */
-            break;
-        case LD_STR_HEX:
-            l = snprintf(buf,len,"%La",value);
-            if (l+1 > len) return 0; /* No room. */
-            break;
-        case LD_STR_HUMAN:
-            /* We use 17 digits precision since with 128 bit floats that precision
-             * after rounding is able to represent most small decimal numbers in a
-             * way that is "non surprising" for the user (that is, most small
-             * decimal numbers will be represented in a way that when converted
-             * back into a string are exactly the same as what the user typed.) */
-            l = snprintf(buf,len,"%.17Lf",value);
-            if (l+1 > len) return 0; /* No room. */
-            /* Now remove trailing zeroes after the '.' */
-            if (strchr(buf,'.') != NULL) {
-                char *p = buf+l-1;
-                while(*p == '0') {
-                    p--;
-                    l--;
-                }
-                if (*p == '.') l--;
-            }
-            if (l == 2 && buf[0] == '-' && buf[1] == '0') {
-                buf[0] = '0';
-                l = 1;
-            }
-            break;
-        default: return 0; /* Invalid mode. */
-        }
-    }
-    buf[l] = '\0';
-    return l;
-}
-
-/* Get random bytes, attempts to get an initial seed from /dev/urandom and
- * the uses a one way hash function in counter mode to generate a random
- * stream. However if /dev/urandom is not available, a weaker seed is used.
- *
- * This function is not thread safe, since the state is global. */
-void getRandomBytes(unsigned char *p, size_t len) {
-    /* Global state. */
-    static int seed_initialized = 0;
-    static unsigned char seed[64]; /* 512 bit internal block size. */
-    static uint64_t counter = 0; /* The counter we hash with the seed. */
-
-    if (!seed_initialized) {
-        /* Initialize a seed and use SHA1 in counter mode, where we hash
-         * the same seed with a progressive counter. For the goals of this
-         * function we just need non-colliding strings, there are no
-         * cryptographic security needs. */
-        FILE *fp = fopen("/dev/urandom","r");
-        if (fp == NULL || fread(seed,sizeof(seed),1,fp) != 1) {
-            /* Revert to a weaker seed, and in this case reseed again
-             * at every call.*/
-            for (unsigned int j = 0; j < sizeof(seed); j++) {
-                struct timeval tv;
-                gettimeofday(&tv,NULL);
-                pid_t pid = getpid();
-                seed[j] = tv.tv_sec ^ tv.tv_usec ^ pid ^ (long)fp;
-            }
-        } else {
-            seed_initialized = 1;
-        }
-        if (fp) fclose(fp);
-    }
-
-    while(len) {
-        /* This implements SHA256-HMAC. */
-        unsigned char digest[SHA256_BLOCK_SIZE];
-        unsigned char kxor[64];
-        unsigned int copylen =
-            len > SHA256_BLOCK_SIZE ? SHA256_BLOCK_SIZE : len;
-
-        /* IKEY: key xored with 0x36. */
-        memcpy(kxor,seed,sizeof(kxor));
-        for (unsigned int i = 0; i < sizeof(kxor); i++) kxor[i] ^= 0x36;
-
-        /* Obtain HASH(IKEY||MESSAGE). */
-        SHA256_CTX ctx;
-        sha256_init(&ctx);
-        sha256_update(&ctx,kxor,sizeof(kxor));
-        sha256_update(&ctx,(unsigned char*)&counter,sizeof(counter));
-        sha256_final(&ctx,digest);
-
-        /* OKEY: key xored with 0x5c. */
-        memcpy(kxor,seed,sizeof(kxor));
-        for (unsigned int i = 0; i < sizeof(kxor); i++) kxor[i] ^= 0x5C;
-
-        /* Obtain HASH(OKEY || HASH(IKEY||MESSAGE)). */
-        sha256_init(&ctx);
-        sha256_update(&ctx,kxor,sizeof(kxor));
-        sha256_update(&ctx,digest,SHA256_BLOCK_SIZE);
-        sha256_final(&ctx,digest);
-
-        /* Increment the counter for the next iteration. */
-        counter++;
-
-        memcpy(p,digest,copylen);
-        len -= copylen;
-        p += copylen;
-    }
-}
-
-/* Generate the Redis "Run ID", a SHA1-sized random number that identifies a
- * given execution of Redis, so that if you are talking with an instance
- * having run_id == A, and you reconnect and it has run_id == B, you can be
- * sure that it is either a different instance or it was restarted. */
-void getRandomHexChars(char *p, size_t len) {
-    char *charset = "0123456789abcdef";
-    size_t j;
-
-    getRandomBytes((unsigned char*)p,len);
-    for (j = 0; j < len; j++) p[j] = charset[p[j] & 0x0F];
-}
-
-/* Given the filename, return the absolute path as an SDS string, or NULL
- * if it fails for some reason. Note that "filename" may be an absolute path
- * already, this will be detected and handled correctly.
- *
- * The function does not try to normalize everything, but only the obvious
- * case of one or more "../" appearing at the start of "filename"
- * relative path. */
-sds getAbsolutePath(char *filename) {
-    char cwd[1024];
-    sds abspath;
-    sds relpath = sdsnew(filename);
-
-    relpath = sdstrim(relpath," \r\n\t");
-    if (relpath[0] == '/') return relpath; /* Path is already absolute. */
-
-    /* If path is relative, join cwd and relative path. */
-    if (getcwd(cwd,sizeof(cwd)) == NULL) {
-        sdsfree(relpath);
-        return NULL;
-    }
-    abspath = sdsnew(cwd);
-    if (sdslen(abspath) && abspath[sdslen(abspath)-1] != '/')
-        abspath = sdscat(abspath,"/");
-
-    /* At this point we have the current path always ending with "/", and
-     * the trimmed relative path. Try to normalize the obvious case of
-     * trailing ../ elements at the start of the path.
-     *
-     * For every "../" we find in the filename, we remove it and also remove
-     * the last element of the cwd, unless the current cwd is "/". */
-    while (sdslen(relpath) >= 3 &&
-           relpath[0] == '.' && relpath[1] == '.' && relpath[2] == '/')
-    {
-        sdsrange(relpath,3,-1);
-        if (sdslen(abspath) > 1) {
-            char *p = abspath + sdslen(abspath)-2;
-            int trimlen = 1;
-
-            while(*p != '/') {
-                p--;
-                trimlen++;
-            }
-            sdsrange(abspath,0,-(trimlen+1));
-        }
-    }
-
-    /* Finally glue the two parts together. */
-    abspath = sdscatsds(abspath,relpath);
-    sdsfree(relpath);
-    return abspath;
-}
-
-/*
- * Gets the proper timezone in a more portable fashion
- * i.e timezone variables are linux specific.
- */
-long getTimeZone(void) {
-#if defined(__linux__) || defined(__sun)
-    return timezone;
-#else
-    struct timeval tv;
-    struct timezone tz;
-
-    gettimeofday(&tv, &tz);
-
-    return tz.tz_minuteswest * 60L;
-#endif
-}
-
-/* Return true if the specified path is just a file basename without any
- * relative or absolute path. This function just checks that no / or \
- * character exists inside the specified path, that's enough in the
- * environments where Redis runs. */
-int pathIsBaseName(char *path) {
-    return strchr(path,'/') == NULL && strchr(path,'\\') == NULL;
-}
-
-#ifdef REDIS_TEST
-#include <assert.h>
-
-static void test_string2ll(void) {
-    char buf[32];
-    long long v;
-
-    /* May not start with +. */
-    strcpy(buf,"+1");
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-
-    /* Leading space. */
-    strcpy(buf," 1");
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-
-    /* Trailing space. */
-    strcpy(buf,"1 ");
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-
-    /* May not start with 0. */
-    strcpy(buf,"01");
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-
-    strcpy(buf,"-1");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == -1);
-
-    strcpy(buf,"0");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == 0);
-
-    strcpy(buf,"1");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == 1);
-
-    strcpy(buf,"99");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == 99);
-
-    strcpy(buf,"-99");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == -99);
-
-    strcpy(buf,"-9223372036854775808");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == LLONG_MIN);
-
-    strcpy(buf,"-9223372036854775809"); /* overflow */
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-
-    strcpy(buf,"9223372036854775807");
-    assert(string2ll(buf,strlen(buf),&v) == 1);
-    assert(v == LLONG_MAX);
-
-    strcpy(buf,"9223372036854775808"); /* overflow */
-    assert(string2ll(buf,strlen(buf),&v) == 0);
-}
-
-static void test_string2l(void) {
-    char buf[32];
-    long v;
-
-    /* May not start with +. */
-    strcpy(buf,"+1");
-    assert(string2l(buf,strlen(buf),&v) == 0);
-
-    /* May not start with 0. */
-    strcpy(buf,"01");
-    assert(string2l(buf,strlen(buf),&v) == 0);
-
-    strcpy(buf,"-1");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == -1);
-
-    strcpy(buf,"0");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == 0);
-
-    strcpy(buf,"1");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == 1);
-
-    strcpy(buf,"99");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == 99);
-
-    strcpy(buf,"-99");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == -99);
-
-#if LONG_MAX != LLONG_MAX
-    strcpy(buf,"-2147483648");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == LONG_MIN);
-
-    strcpy(buf,"-2147483649"); /* overflow */
-    assert(string2l(buf,strlen(buf),&v) == 0);
-
-    strcpy(buf,"2147483647");
-    assert(string2l(buf,strlen(buf),&v) == 1);
-    assert(v == LONG_MAX);
-
-    strcpy(buf,"2147483648"); /* overflow */
-    assert(string2l(buf,strlen(buf),&v) == 0);
-#endif
-}
-
-static void test_ll2string(void) {
-    char buf[32];
-    long long v;
-    int sz;
-
-    v = 0;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 1);
-    assert(!strcmp(buf, "0"));
-
-    v = -1;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 2);
-    assert(!strcmp(buf, "-1"));
-
-    v = 99;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 2);
-    assert(!strcmp(buf, "99"));
-
-    v = -99;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 3);
-    assert(!strcmp(buf, "-99"));
-
-    v = -2147483648;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 11);
-    assert(!strcmp(buf, "-2147483648"));
-
-    v = LLONG_MIN;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 20);
-    assert(!strcmp(buf, "-9223372036854775808"));
-
-    v = LLONG_MAX;
-    sz = ll2string(buf, sizeof buf, v);
-    assert(sz == 19);
-    assert(!strcmp(buf, "9223372036854775807"));
-}
-
-#define UNUSED(x) (void)(x)
-int utilTest(int argc, char **argv, int accurate) {
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    test_string2ll();
-    test_string2l();
-    test_ll2string();
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/util.h b/redis-stable/src/util.h
deleted file mode 100644
index 3bf8907c..00000000
--- a/redis-stable/src/util.h
+++ /dev/null
@@ -1,72 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __REDIS_UTIL_H
-#define __REDIS_UTIL_H
-
-#include <stdint.h>
-#include "sds.h"
-
-/* The maximum number of characters needed to represent a long double
- * as a string (long double has a huge range).
- * This should be the size of the buffer given to ld2string */
-#define MAX_LONG_DOUBLE_CHARS 5*1024
-
-/* long double to string convertion options */
-typedef enum {
-    LD_STR_AUTO,     /* %.17Lg */
-    LD_STR_HUMAN,    /* %.17Lf + Trimming of trailing zeros */
-    LD_STR_HEX       /* %La */
-} ld2string_mode;
-
-int stringmatchlen(const char *p, int plen, const char *s, int slen, int nocase);
-int stringmatch(const char *p, const char *s, int nocase);
-int stringmatchlen_fuzz_test(void);
-long long memtoll(const char *p, int *err);
-const char *mempbrk(const char *s, size_t len, const char *chars, size_t charslen);
-char *memmapchars(char *s, size_t len, const char *from, const char *to, size_t setlen);
-uint32_t digits10(uint64_t v);
-uint32_t sdigits10(int64_t v);
-int ll2string(char *s, size_t len, long long value);
-int string2ll(const char *s, size_t slen, long long *value);
-int string2ull(const char *s, unsigned long long *value);
-int string2l(const char *s, size_t slen, long *value);
-int string2ld(const char *s, size_t slen, long double *dp);
-int string2d(const char *s, size_t slen, double *dp);
-int d2string(char *buf, size_t len, double value);
-int ld2string(char *buf, size_t len, long double value, ld2string_mode mode);
-sds getAbsolutePath(char *filename);
-long getTimeZone(void);
-int pathIsBaseName(char *path);
-
-#ifdef REDIS_TEST
-int utilTest(int argc, char **argv, int accurate);
-#endif
-
-#endif
diff --git a/redis-stable/src/valgrind.sup b/redis-stable/src/valgrind.sup
deleted file mode 100644
index 5d6367e3..00000000
--- a/redis-stable/src/valgrind.sup
+++ /dev/null
@@ -1,26 +0,0 @@
-{
-   <lzf_uninitialized_hash_table>
-   Memcheck:Cond
-   fun:lzf_compress
-}
-
-{
-   <lzf_uninitialized_hash_table>
-   Memcheck:Value4
-   fun:lzf_compress
-}
-
-{
-   <lzf_uninitialized_hash_table>
-   Memcheck:Value8
-   fun:lzf_compress
-}
-
-{
-   <negative size allocatoin, see integration/corrupt-dump>
-   Memcheck:FishyValue
-   malloc(size)
-   fun:malloc
-   fun:ztrymalloc_usable
-   fun:ztrymalloc
-}
diff --git a/redis-stable/src/version.h b/redis-stable/src/version.h
deleted file mode 100644
index e07d557e..00000000
--- a/redis-stable/src/version.h
+++ /dev/null
@@ -1,2 +0,0 @@
-#define REDIS_VERSION "6.2.6"
-#define REDIS_VERSION_NUM 0x00060206
diff --git a/redis-stable/src/ziplist.c b/redis-stable/src/ziplist.c
deleted file mode 100644
index b3b27ce3..00000000
--- a/redis-stable/src/ziplist.c
+++ /dev/null
@@ -1,2582 +0,0 @@
-/* The ziplist is a specially encoded dually linked list that is designed
- * to be very memory efficient. It stores both strings and integer values,
- * where integers are encoded as actual integers instead of a series of
- * characters. It allows push and pop operations on either side of the list
- * in O(1) time. However, because every operation requires a reallocation of
- * the memory used by the ziplist, the actual complexity is related to the
- * amount of memory used by the ziplist.
- *
- * ----------------------------------------------------------------------------
- *
- * ZIPLIST OVERALL LAYOUT
- * ======================
- *
- * The general layout of the ziplist is as follows:
- *
- * <zlbytes> <zltail> <zllen> <entry> <entry> ... <entry> <zlend>
- *
- * NOTE: all fields are stored in little endian, if not specified otherwise.
- *
- * <uint32_t zlbytes> is an unsigned integer to hold the number of bytes that
- * the ziplist occupies, including the four bytes of the zlbytes field itself.
- * This value needs to be stored to be able to resize the entire structure
- * without the need to traverse it first.
- *
- * <uint32_t zltail> is the offset to the last entry in the list. This allows
- * a pop operation on the far side of the list without the need for full
- * traversal.
- *
- * <uint16_t zllen> is the number of entries. When there are more than
- * 2^16-2 entries, this value is set to 2^16-1 and we need to traverse the
- * entire list to know how many items it holds.
- *
- * <uint8_t zlend> is a special entry representing the end of the ziplist.
- * Is encoded as a single byte equal to 255. No other normal entry starts
- * with a byte set to the value of 255.
- *
- * ZIPLIST ENTRIES
- * ===============
- *
- * Every entry in the ziplist is prefixed by metadata that contains two pieces
- * of information. First, the length of the previous entry is stored to be
- * able to traverse the list from back to front. Second, the entry encoding is
- * provided. It represents the entry type, integer or string, and in the case
- * of strings it also represents the length of the string payload.
- * So a complete entry is stored like this:
- *
- * <prevlen> <encoding> <entry-data>
- *
- * Sometimes the encoding represents the entry itself, like for small integers
- * as we'll see later. In such a case the <entry-data> part is missing, and we
- * could have just:
- *
- * <prevlen> <encoding>
- *
- * The length of the previous entry, <prevlen>, is encoded in the following way:
- * If this length is smaller than 254 bytes, it will only consume a single
- * byte representing the length as an unsinged 8 bit integer. When the length
- * is greater than or equal to 254, it will consume 5 bytes. The first byte is
- * set to 254 (FE) to indicate a larger value is following. The remaining 4
- * bytes take the length of the previous entry as value.
- *
- * So practically an entry is encoded in the following way:
- *
- * <prevlen from 0 to 253> <encoding> <entry>
- *
- * Or alternatively if the previous entry length is greater than 253 bytes
- * the following encoding is used:
- *
- * 0xFE <4 bytes unsigned little endian prevlen> <encoding> <entry>
- *
- * The encoding field of the entry depends on the content of the
- * entry. When the entry is a string, the first 2 bits of the encoding first
- * byte will hold the type of encoding used to store the length of the string,
- * followed by the actual length of the string. When the entry is an integer
- * the first 2 bits are both set to 1. The following 2 bits are used to specify
- * what kind of integer will be stored after this header. An overview of the
- * different types and encodings is as follows. The first byte is always enough
- * to determine the kind of entry.
- *
- * |00pppppp| - 1 byte
- *      String value with length less than or equal to 63 bytes (6 bits).
- *      "pppppp" represents the unsigned 6 bit length.
- * |01pppppp|qqqqqqqq| - 2 bytes
- *      String value with length less than or equal to 16383 bytes (14 bits).
- *      IMPORTANT: The 14 bit number is stored in big endian.
- * |10000000|qqqqqqqq|rrrrrrrr|ssssssss|tttttttt| - 5 bytes
- *      String value with length greater than or equal to 16384 bytes.
- *      Only the 4 bytes following the first byte represents the length
- *      up to 2^32-1. The 6 lower bits of the first byte are not used and
- *      are set to zero.
- *      IMPORTANT: The 32 bit number is stored in big endian.
- * |11000000| - 3 bytes
- *      Integer encoded as int16_t (2 bytes).
- * |11010000| - 5 bytes
- *      Integer encoded as int32_t (4 bytes).
- * |11100000| - 9 bytes
- *      Integer encoded as int64_t (8 bytes).
- * |11110000| - 4 bytes
- *      Integer encoded as 24 bit signed (3 bytes).
- * |11111110| - 2 bytes
- *      Integer encoded as 8 bit signed (1 byte).
- * |1111xxxx| - (with xxxx between 0001 and 1101) immediate 4 bit integer.
- *      Unsigned integer from 0 to 12. The encoded value is actually from
- *      1 to 13 because 0000 and 1111 can not be used, so 1 should be
- *      subtracted from the encoded 4 bit value to obtain the right value.
- * |11111111| - End of ziplist special entry.
- *
- * Like for the ziplist header, all the integers are represented in little
- * endian byte order, even when this code is compiled in big endian systems.
- *
- * EXAMPLES OF ACTUAL ZIPLISTS
- * ===========================
- *
- * The following is a ziplist containing the two elements representing
- * the strings "2" and "5". It is composed of 15 bytes, that we visually
- * split into sections:
- *
- *  [0f 00 00 00] [0c 00 00 00] [02 00] [00 f3] [02 f6] [ff]
- *        |             |          |       |       |     |
- *     zlbytes        zltail    entries   "2"     "5"   end
- *
- * The first 4 bytes represent the number 15, that is the number of bytes
- * the whole ziplist is composed of. The second 4 bytes are the offset
- * at which the last ziplist entry is found, that is 12, in fact the
- * last entry, that is "5", is at offset 12 inside the ziplist.
- * The next 16 bit integer represents the number of elements inside the
- * ziplist, its value is 2 since there are just two elements inside.
- * Finally "00 f3" is the first entry representing the number 2. It is
- * composed of the previous entry length, which is zero because this is
- * our first entry, and the byte F3 which corresponds to the encoding
- * |1111xxxx| with xxxx between 0001 and 1101. We need to remove the "F"
- * higher order bits 1111, and subtract 1 from the "3", so the entry value
- * is "2". The next entry has a prevlen of 02, since the first entry is
- * composed of exactly two bytes. The entry itself, F6, is encoded exactly
- * like the first entry, and 6-1 = 5, so the value of the entry is 5.
- * Finally the special entry FF signals the end of the ziplist.
- *
- * Adding another element to the above string with the value "Hello World"
- * allows us to show how the ziplist encodes small strings. We'll just show
- * the hex dump of the entry itself. Imagine the bytes as following the
- * entry that stores "5" in the ziplist above:
- *
- * [02] [0b] [48 65 6c 6c 6f 20 57 6f 72 6c 64]
- *
- * The first byte, 02, is the length of the previous entry. The next
- * byte represents the encoding in the pattern |00pppppp| that means
- * that the entry is a string of length <pppppp>, so 0B means that
- * an 11 bytes string follows. From the third byte (48) to the last (64)
- * there are just the ASCII characters for "Hello World".
- *
- * ----------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2017, Salvatore Sanfilippo <antirez at gmail dot com>
- * Copyright (c) 2020, Redis Labs, Inc
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <stdint.h>
-#include <limits.h>
-#include "zmalloc.h"
-#include "util.h"
-#include "ziplist.h"
-#include "config.h"
-#include "endianconv.h"
-#include "redisassert.h"
-
-#define ZIP_END 255         /* Special "end of ziplist" entry. */
-#define ZIP_BIG_PREVLEN 254 /* ZIP_BIG_PREVLEN - 1 is the max number of bytes of
-                               the previous entry, for the "prevlen" field prefixing
-                               each entry, to be represented with just a single byte.
-                               Otherwise it is represented as FE AA BB CC DD, where
-                               AA BB CC DD are a 4 bytes unsigned integer
-                               representing the previous entry len. */
-
-/* Different encoding/length possibilities */
-#define ZIP_STR_MASK 0xc0
-#define ZIP_INT_MASK 0x30
-#define ZIP_STR_06B (0 << 6)
-#define ZIP_STR_14B (1 << 6)
-#define ZIP_STR_32B (2 << 6)
-#define ZIP_INT_16B (0xc0 | 0<<4)
-#define ZIP_INT_32B (0xc0 | 1<<4)
-#define ZIP_INT_64B (0xc0 | 2<<4)
-#define ZIP_INT_24B (0xc0 | 3<<4)
-#define ZIP_INT_8B 0xfe
-
-/* 4 bit integer immediate encoding |1111xxxx| with xxxx between
- * 0001 and 1101. */
-#define ZIP_INT_IMM_MASK 0x0f   /* Mask to extract the 4 bits value. To add
-                                   one is needed to reconstruct the value. */
-#define ZIP_INT_IMM_MIN 0xf1    /* 11110001 */
-#define ZIP_INT_IMM_MAX 0xfd    /* 11111101 */
-
-#define INT24_MAX 0x7fffff
-#define INT24_MIN (-INT24_MAX - 1)
-
-/* Macro to determine if the entry is a string. String entries never start
- * with "11" as most significant bits of the first byte. */
-#define ZIP_IS_STR(enc) (((enc) & ZIP_STR_MASK) < ZIP_STR_MASK)
-
-/* Utility macros.*/
-
-/* Return total bytes a ziplist is composed of. */
-#define ZIPLIST_BYTES(zl)       (*((uint32_t*)(zl)))
-
-/* Return the offset of the last item inside the ziplist. */
-#define ZIPLIST_TAIL_OFFSET(zl) (*((uint32_t*)((zl)+sizeof(uint32_t))))
-
-/* Return the length of a ziplist, or UINT16_MAX if the length cannot be
- * determined without scanning the whole ziplist. */
-#define ZIPLIST_LENGTH(zl)      (*((uint16_t*)((zl)+sizeof(uint32_t)*2)))
-
-/* The size of a ziplist header: two 32 bit integers for the total
- * bytes count and last item offset. One 16 bit integer for the number
- * of items field. */
-#define ZIPLIST_HEADER_SIZE     (sizeof(uint32_t)*2+sizeof(uint16_t))
-
-/* Size of the "end of ziplist" entry. Just one byte. */
-#define ZIPLIST_END_SIZE        (sizeof(uint8_t))
-
-/* Return the pointer to the first entry of a ziplist. */
-#define ZIPLIST_ENTRY_HEAD(zl)  ((zl)+ZIPLIST_HEADER_SIZE)
-
-/* Return the pointer to the last entry of a ziplist, using the
- * last entry offset inside the ziplist header. */
-#define ZIPLIST_ENTRY_TAIL(zl)  ((zl)+intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)))
-
-/* Return the pointer to the last byte of a ziplist, which is, the
- * end of ziplist FF entry. */
-#define ZIPLIST_ENTRY_END(zl)   ((zl)+intrev32ifbe(ZIPLIST_BYTES(zl))-1)
-
-/* Increment the number of items field in the ziplist header. Note that this
- * macro should never overflow the unsigned 16 bit integer, since entries are
- * always pushed one at a time. When UINT16_MAX is reached we want the count
- * to stay there to signal that a full scan is needed to get the number of
- * items inside the ziplist. */
-#define ZIPLIST_INCR_LENGTH(zl,incr) { \
-    if (intrev16ifbe(ZIPLIST_LENGTH(zl)) < UINT16_MAX) \
-        ZIPLIST_LENGTH(zl) = intrev16ifbe(intrev16ifbe(ZIPLIST_LENGTH(zl))+incr); \
-}
-
-/* Don't let ziplists grow over 1GB in any case, don't wanna risk overflow in
- * zlbytes*/
-#define ZIPLIST_MAX_SAFETY_SIZE (1<<30)
-int ziplistSafeToAdd(unsigned char* zl, size_t add) {
-    size_t len = zl? ziplistBlobLen(zl): 0;
-    if (len + add > ZIPLIST_MAX_SAFETY_SIZE)
-        return 0;
-    return 1;
-}
-
-
-/* We use this function to receive information about a ziplist entry.
- * Note that this is not how the data is actually encoded, is just what we
- * get filled by a function in order to operate more easily. */
-typedef struct zlentry {
-    unsigned int prevrawlensize; /* Bytes used to encode the previous entry len*/
-    unsigned int prevrawlen;     /* Previous entry len. */
-    unsigned int lensize;        /* Bytes used to encode this entry type/len.
-                                    For example strings have a 1, 2 or 5 bytes
-                                    header. Integers always use a single byte.*/
-    unsigned int len;            /* Bytes used to represent the actual entry.
-                                    For strings this is just the string length
-                                    while for integers it is 1, 2, 3, 4, 8 or
-                                    0 (for 4 bit immediate) depending on the
-                                    number range. */
-    unsigned int headersize;     /* prevrawlensize + lensize. */
-    unsigned char encoding;      /* Set to ZIP_STR_* or ZIP_INT_* depending on
-                                    the entry encoding. However for 4 bits
-                                    immediate integers this can assume a range
-                                    of values and must be range-checked. */
-    unsigned char *p;            /* Pointer to the very start of the entry, that
-                                    is, this points to prev-entry-len field. */
-} zlentry;
-
-#define ZIPLIST_ENTRY_ZERO(zle) { \
-    (zle)->prevrawlensize = (zle)->prevrawlen = 0; \
-    (zle)->lensize = (zle)->len = (zle)->headersize = 0; \
-    (zle)->encoding = 0; \
-    (zle)->p = NULL; \
-}
-
-/* Extract the encoding from the byte pointed by 'ptr' and set it into
- * 'encoding' field of the zlentry structure. */
-#define ZIP_ENTRY_ENCODING(ptr, encoding) do {  \
-    (encoding) = ((ptr)[0]); \
-    if ((encoding) < ZIP_STR_MASK) (encoding) &= ZIP_STR_MASK; \
-} while(0)
-
-#define ZIP_ENCODING_SIZE_INVALID 0xff
-/* Return the number of bytes required to encode the entry type + length.
- * On error, return ZIP_ENCODING_SIZE_INVALID */
-static inline unsigned int zipEncodingLenSize(unsigned char encoding) {
-    if (encoding == ZIP_INT_16B || encoding == ZIP_INT_32B ||
-        encoding == ZIP_INT_24B || encoding == ZIP_INT_64B ||
-        encoding == ZIP_INT_8B)
-        return 1;
-    if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)
-        return 1;
-    if (encoding == ZIP_STR_06B)
-        return 1;
-    if (encoding == ZIP_STR_14B)
-        return 2;
-    if (encoding == ZIP_STR_32B)
-        return 5;
-    return ZIP_ENCODING_SIZE_INVALID;
-}
-
-#define ZIP_ASSERT_ENCODING(encoding) do {                                     \
-    assert(zipEncodingLenSize(encoding) != ZIP_ENCODING_SIZE_INVALID);         \
-} while (0)
-
-/* Return bytes needed to store integer encoded by 'encoding' */
-static inline unsigned int zipIntSize(unsigned char encoding) {
-    switch(encoding) {
-    case ZIP_INT_8B:  return 1;
-    case ZIP_INT_16B: return 2;
-    case ZIP_INT_24B: return 3;
-    case ZIP_INT_32B: return 4;
-    case ZIP_INT_64B: return 8;
-    }
-    if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)
-        return 0; /* 4 bit immediate */
-    /* bad encoding, covered by a previous call to ZIP_ASSERT_ENCODING */
-    redis_unreachable();
-    return 0;
-}
-
-/* Write the encoding header of the entry in 'p'. If p is NULL it just returns
- * the amount of bytes required to encode such a length. Arguments:
- *
- * 'encoding' is the encoding we are using for the entry. It could be
- * ZIP_INT_* or ZIP_STR_* or between ZIP_INT_IMM_MIN and ZIP_INT_IMM_MAX
- * for single-byte small immediate integers.
- *
- * 'rawlen' is only used for ZIP_STR_* encodings and is the length of the
- * string that this entry represents.
- *
- * The function returns the number of bytes used by the encoding/length
- * header stored in 'p'. */
-unsigned int zipStoreEntryEncoding(unsigned char *p, unsigned char encoding, unsigned int rawlen) {
-    unsigned char len = 1, buf[5];
-
-    if (ZIP_IS_STR(encoding)) {
-        /* Although encoding is given it may not be set for strings,
-         * so we determine it here using the raw length. */
-        if (rawlen <= 0x3f) {
-            if (!p) return len;
-            buf[0] = ZIP_STR_06B | rawlen;
-        } else if (rawlen <= 0x3fff) {
-            len += 1;
-            if (!p) return len;
-            buf[0] = ZIP_STR_14B | ((rawlen >> 8) & 0x3f);
-            buf[1] = rawlen & 0xff;
-        } else {
-            len += 4;
-            if (!p) return len;
-            buf[0] = ZIP_STR_32B;
-            buf[1] = (rawlen >> 24) & 0xff;
-            buf[2] = (rawlen >> 16) & 0xff;
-            buf[3] = (rawlen >> 8) & 0xff;
-            buf[4] = rawlen & 0xff;
-        }
-    } else {
-        /* Implies integer encoding, so length is always 1. */
-        if (!p) return len;
-        buf[0] = encoding;
-    }
-
-    /* Store this length at p. */
-    memcpy(p,buf,len);
-    return len;
-}
-
-/* Decode the entry encoding type and data length (string length for strings,
- * number of bytes used for the integer for integer entries) encoded in 'ptr'.
- * The 'encoding' variable is input, extracted by the caller, the 'lensize'
- * variable will hold the number of bytes required to encode the entry
- * length, and the 'len' variable will hold the entry length.
- * On invalid encoding error, lensize is set to 0. */
-#define ZIP_DECODE_LENGTH(ptr, encoding, lensize, len) do {                    \
-    if ((encoding) < ZIP_STR_MASK) {                                           \
-        if ((encoding) == ZIP_STR_06B) {                                       \
-            (lensize) = 1;                                                     \
-            (len) = (ptr)[0] & 0x3f;                                           \
-        } else if ((encoding) == ZIP_STR_14B) {                                \
-            (lensize) = 2;                                                     \
-            (len) = (((ptr)[0] & 0x3f) << 8) | (ptr)[1];                       \
-        } else if ((encoding) == ZIP_STR_32B) {                                \
-            (lensize) = 5;                                                     \
-            (len) = ((ptr)[1] << 24) |                                         \
-                    ((ptr)[2] << 16) |                                         \
-                    ((ptr)[3] <<  8) |                                         \
-                    ((ptr)[4]);                                                \
-        } else {                                                               \
-            (lensize) = 0; /* bad encoding, should be covered by a previous */ \
-            (len) = 0;     /* ZIP_ASSERT_ENCODING / zipEncodingLenSize, or  */ \
-                           /* match the lensize after this macro with 0.    */ \
-        }                                                                      \
-    } else {                                                                   \
-        (lensize) = 1;                                                         \
-        if ((encoding) == ZIP_INT_8B)  (len) = 1;                              \
-        else if ((encoding) == ZIP_INT_16B) (len) = 2;                         \
-        else if ((encoding) == ZIP_INT_24B) (len) = 3;                         \
-        else if ((encoding) == ZIP_INT_32B) (len) = 4;                         \
-        else if ((encoding) == ZIP_INT_64B) (len) = 8;                         \
-        else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX)   \
-            (len) = 0; /* 4 bit immediate */                                   \
-        else                                                                   \
-            (lensize) = (len) = 0; /* bad encoding */                          \
-    }                                                                          \
-} while(0)
-
-/* Encode the length of the previous entry and write it to "p". This only
- * uses the larger encoding (required in __ziplistCascadeUpdate). */
-int zipStorePrevEntryLengthLarge(unsigned char *p, unsigned int len) {
-    uint32_t u32;
-    if (p != NULL) {
-        p[0] = ZIP_BIG_PREVLEN;
-        u32 = len;
-        memcpy(p+1,&u32,sizeof(u32));
-        memrev32ifbe(p+1);
-    }
-    return 1 + sizeof(uint32_t);
-}
-
-/* Encode the length of the previous entry and write it to "p". Return the
- * number of bytes needed to encode this length if "p" is NULL. */
-unsigned int zipStorePrevEntryLength(unsigned char *p, unsigned int len) {
-    if (p == NULL) {
-        return (len < ZIP_BIG_PREVLEN) ? 1 : sizeof(uint32_t) + 1;
-    } else {
-        if (len < ZIP_BIG_PREVLEN) {
-            p[0] = len;
-            return 1;
-        } else {
-            return zipStorePrevEntryLengthLarge(p,len);
-        }
-    }
-}
-
-/* Return the number of bytes used to encode the length of the previous
- * entry. The length is returned by setting the var 'prevlensize'. */
-#define ZIP_DECODE_PREVLENSIZE(ptr, prevlensize) do {                          \
-    if ((ptr)[0] < ZIP_BIG_PREVLEN) {                                          \
-        (prevlensize) = 1;                                                     \
-    } else {                                                                   \
-        (prevlensize) = 5;                                                     \
-    }                                                                          \
-} while(0)
-
-/* Return the length of the previous element, and the number of bytes that
- * are used in order to encode the previous element length.
- * 'ptr' must point to the prevlen prefix of an entry (that encodes the
- * length of the previous entry in order to navigate the elements backward).
- * The length of the previous entry is stored in 'prevlen', the number of
- * bytes needed to encode the previous entry length are stored in
- * 'prevlensize'. */
-#define ZIP_DECODE_PREVLEN(ptr, prevlensize, prevlen) do {                     \
-    ZIP_DECODE_PREVLENSIZE(ptr, prevlensize);                                  \
-    if ((prevlensize) == 1) {                                                  \
-        (prevlen) = (ptr)[0];                                                  \
-    } else { /* prevlensize == 5 */                                            \
-        (prevlen) = ((ptr)[4] << 24) |                                         \
-                    ((ptr)[3] << 16) |                                         \
-                    ((ptr)[2] <<  8) |                                         \
-                    ((ptr)[1]);                                                \
-    }                                                                          \
-} while(0)
-
-/* Given a pointer 'p' to the prevlen info that prefixes an entry, this
- * function returns the difference in number of bytes needed to encode
- * the prevlen if the previous entry changes of size.
- *
- * So if A is the number of bytes used right now to encode the 'prevlen'
- * field.
- *
- * And B is the number of bytes that are needed in order to encode the
- * 'prevlen' if the previous element will be updated to one of size 'len'.
- *
- * Then the function returns B - A
- *
- * So the function returns a positive number if more space is needed,
- * a negative number if less space is needed, or zero if the same space
- * is needed. */
-int zipPrevLenByteDiff(unsigned char *p, unsigned int len) {
-    unsigned int prevlensize;
-    ZIP_DECODE_PREVLENSIZE(p, prevlensize);
-    return zipStorePrevEntryLength(NULL, len) - prevlensize;
-}
-
-/* Check if string pointed to by 'entry' can be encoded as an integer.
- * Stores the integer value in 'v' and its encoding in 'encoding'. */
-int zipTryEncoding(unsigned char *entry, unsigned int entrylen, long long *v, unsigned char *encoding) {
-    long long value;
-
-    if (entrylen >= 32 || entrylen == 0) return 0;
-    if (string2ll((char*)entry,entrylen,&value)) {
-        /* Great, the string can be encoded. Check what's the smallest
-         * of our encoding types that can hold this value. */
-        if (value >= 0 && value <= 12) {
-            *encoding = ZIP_INT_IMM_MIN+value;
-        } else if (value >= INT8_MIN && value <= INT8_MAX) {
-            *encoding = ZIP_INT_8B;
-        } else if (value >= INT16_MIN && value <= INT16_MAX) {
-            *encoding = ZIP_INT_16B;
-        } else if (value >= INT24_MIN && value <= INT24_MAX) {
-            *encoding = ZIP_INT_24B;
-        } else if (value >= INT32_MIN && value <= INT32_MAX) {
-            *encoding = ZIP_INT_32B;
-        } else {
-            *encoding = ZIP_INT_64B;
-        }
-        *v = value;
-        return 1;
-    }
-    return 0;
-}
-
-/* Store integer 'value' at 'p', encoded as 'encoding' */
-void zipSaveInteger(unsigned char *p, int64_t value, unsigned char encoding) {
-    int16_t i16;
-    int32_t i32;
-    int64_t i64;
-    if (encoding == ZIP_INT_8B) {
-        ((int8_t*)p)[0] = (int8_t)value;
-    } else if (encoding == ZIP_INT_16B) {
-        i16 = value;
-        memcpy(p,&i16,sizeof(i16));
-        memrev16ifbe(p);
-    } else if (encoding == ZIP_INT_24B) {
-        i32 = value<<8;
-        memrev32ifbe(&i32);
-        memcpy(p,((uint8_t*)&i32)+1,sizeof(i32)-sizeof(uint8_t));
-    } else if (encoding == ZIP_INT_32B) {
-        i32 = value;
-        memcpy(p,&i32,sizeof(i32));
-        memrev32ifbe(p);
-    } else if (encoding == ZIP_INT_64B) {
-        i64 = value;
-        memcpy(p,&i64,sizeof(i64));
-        memrev64ifbe(p);
-    } else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX) {
-        /* Nothing to do, the value is stored in the encoding itself. */
-    } else {
-        assert(NULL);
-    }
-}
-
-/* Read integer encoded as 'encoding' from 'p' */
-int64_t zipLoadInteger(unsigned char *p, unsigned char encoding) {
-    int16_t i16;
-    int32_t i32;
-    int64_t i64, ret = 0;
-    if (encoding == ZIP_INT_8B) {
-        ret = ((int8_t*)p)[0];
-    } else if (encoding == ZIP_INT_16B) {
-        memcpy(&i16,p,sizeof(i16));
-        memrev16ifbe(&i16);
-        ret = i16;
-    } else if (encoding == ZIP_INT_32B) {
-        memcpy(&i32,p,sizeof(i32));
-        memrev32ifbe(&i32);
-        ret = i32;
-    } else if (encoding == ZIP_INT_24B) {
-        i32 = 0;
-        memcpy(((uint8_t*)&i32)+1,p,sizeof(i32)-sizeof(uint8_t));
-        memrev32ifbe(&i32);
-        ret = i32>>8;
-    } else if (encoding == ZIP_INT_64B) {
-        memcpy(&i64,p,sizeof(i64));
-        memrev64ifbe(&i64);
-        ret = i64;
-    } else if (encoding >= ZIP_INT_IMM_MIN && encoding <= ZIP_INT_IMM_MAX) {
-        ret = (encoding & ZIP_INT_IMM_MASK)-1;
-    } else {
-        assert(NULL);
-    }
-    return ret;
-}
-
-/* Fills a struct with all information about an entry.
- * This function is the "unsafe" alternative to the one blow.
- * Generally, all function that return a pointer to an element in the ziplist
- * will assert that this element is valid, so it can be freely used.
- * Generally functions such ziplistGet assume the input pointer is already
- * validated (since it's the return value of another function). */
-static inline void zipEntry(unsigned char *p, zlentry *e) {
-    ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
-    ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
-    ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
-    assert(e->lensize != 0); /* check that encoding was valid. */
-    e->headersize = e->prevrawlensize + e->lensize;
-    e->p = p;
-}
-
-/* Fills a struct with all information about an entry.
- * This function is safe to use on untrusted pointers, it'll make sure not to
- * try to access memory outside the ziplist payload.
- * Returns 1 if the entry is valid, and 0 otherwise. */
-static inline int zipEntrySafe(unsigned char* zl, size_t zlbytes, unsigned char *p, zlentry *e, int validate_prevlen) {
-    unsigned char *zlfirst = zl + ZIPLIST_HEADER_SIZE;
-    unsigned char *zllast = zl + zlbytes - ZIPLIST_END_SIZE;
-#define OUT_OF_RANGE(p) (unlikely((p) < zlfirst || (p) > zllast))
-
-    /* If threre's no possibility for the header to reach outside the ziplist,
-     * take the fast path. (max lensize and prevrawlensize are both 5 bytes) */
-    if (p >= zlfirst && p + 10 < zllast) {
-        ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
-        ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
-        ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
-        e->headersize = e->prevrawlensize + e->lensize;
-        e->p = p;
-        /* We didn't call ZIP_ASSERT_ENCODING, so we check lensize was set to 0. */
-        if (unlikely(e->lensize == 0))
-            return 0;
-        /* Make sure the entry doesn't rech outside the edge of the ziplist */
-        if (OUT_OF_RANGE(p + e->headersize + e->len))
-            return 0;
-        /* Make sure prevlen doesn't rech outside the edge of the ziplist */
-        if (validate_prevlen && OUT_OF_RANGE(p - e->prevrawlen))
-            return 0;
-        return 1;
-    }
-
-    /* Make sure the pointer doesn't rech outside the edge of the ziplist */
-    if (OUT_OF_RANGE(p))
-        return 0;
-
-    /* Make sure the encoded prevlen header doesn't reach outside the allocation */
-    ZIP_DECODE_PREVLENSIZE(p, e->prevrawlensize);
-    if (OUT_OF_RANGE(p + e->prevrawlensize))
-        return 0;
-
-    /* Make sure encoded entry header is valid. */
-    ZIP_ENTRY_ENCODING(p + e->prevrawlensize, e->encoding);
-    e->lensize = zipEncodingLenSize(e->encoding);
-    if (unlikely(e->lensize == ZIP_ENCODING_SIZE_INVALID))
-        return 0;
-
-    /* Make sure the encoded entry header doesn't reach outside the allocation */
-    if (OUT_OF_RANGE(p + e->prevrawlensize + e->lensize))
-        return 0;
-
-    /* Decode the prevlen and entry len headers. */
-    ZIP_DECODE_PREVLEN(p, e->prevrawlensize, e->prevrawlen);
-    ZIP_DECODE_LENGTH(p + e->prevrawlensize, e->encoding, e->lensize, e->len);
-    e->headersize = e->prevrawlensize + e->lensize;
-
-    /* Make sure the entry doesn't rech outside the edge of the ziplist */
-    if (OUT_OF_RANGE(p + e->headersize + e->len))
-        return 0;
-
-    /* Make sure prevlen doesn't rech outside the edge of the ziplist */
-    if (validate_prevlen && OUT_OF_RANGE(p - e->prevrawlen))
-        return 0;
-
-    e->p = p;
-    return 1;
-#undef OUT_OF_RANGE
-}
-
-/* Return the total number of bytes used by the entry pointed to by 'p'. */
-static inline unsigned int zipRawEntryLengthSafe(unsigned char* zl, size_t zlbytes, unsigned char *p) {
-    zlentry e;
-    assert(zipEntrySafe(zl, zlbytes, p, &e, 0));
-    return e.headersize + e.len;
-}
-
-/* Return the total number of bytes used by the entry pointed to by 'p'. */
-static inline unsigned int zipRawEntryLength(unsigned char *p) {
-    zlentry e;
-    zipEntry(p, &e);
-    return e.headersize + e.len;
-}
-
-/* Validate that the entry doesn't reach outside the ziplist allocation. */
-static inline void zipAssertValidEntry(unsigned char* zl, size_t zlbytes, unsigned char *p) {
-    zlentry e;
-    assert(zipEntrySafe(zl, zlbytes, p, &e, 1));
-}
-
-/* Create a new empty ziplist. */
-unsigned char *ziplistNew(void) {
-    unsigned int bytes = ZIPLIST_HEADER_SIZE+ZIPLIST_END_SIZE;
-    unsigned char *zl = zmalloc(bytes);
-    ZIPLIST_BYTES(zl) = intrev32ifbe(bytes);
-    ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(ZIPLIST_HEADER_SIZE);
-    ZIPLIST_LENGTH(zl) = 0;
-    zl[bytes-1] = ZIP_END;
-    return zl;
-}
-
-/* Resize the ziplist. */
-unsigned char *ziplistResize(unsigned char *zl, size_t len) {
-    assert(len < UINT32_MAX);
-    zl = zrealloc(zl,len);
-    ZIPLIST_BYTES(zl) = intrev32ifbe(len);
-    zl[len-1] = ZIP_END;
-    return zl;
-}
-
-/* When an entry is inserted, we need to set the prevlen field of the next
- * entry to equal the length of the inserted entry. It can occur that this
- * length cannot be encoded in 1 byte and the next entry needs to be grow
- * a bit larger to hold the 5-byte encoded prevlen. This can be done for free,
- * because this only happens when an entry is already being inserted (which
- * causes a realloc and memmove). However, encoding the prevlen may require
- * that this entry is grown as well. This effect may cascade throughout
- * the ziplist when there are consecutive entries with a size close to
- * ZIP_BIG_PREVLEN, so we need to check that the prevlen can be encoded in
- * every consecutive entry.
- *
- * Note that this effect can also happen in reverse, where the bytes required
- * to encode the prevlen field can shrink. This effect is deliberately ignored,
- * because it can cause a "flapping" effect where a chain prevlen fields is
- * first grown and then shrunk again after consecutive inserts. Rather, the
- * field is allowed to stay larger than necessary, because a large prevlen
- * field implies the ziplist is holding large entries anyway.
- *
- * The pointer "p" points to the first entry that does NOT need to be
- * updated, i.e. consecutive fields MAY need an update. */
-unsigned char *__ziplistCascadeUpdate(unsigned char *zl, unsigned char *p) {
-    zlentry cur;
-    size_t prevlen, prevlensize, prevoffset; /* Informat of the last changed entry. */
-    size_t firstentrylen; /* Used to handle insert at head. */
-    size_t rawlen, curlen = intrev32ifbe(ZIPLIST_BYTES(zl));
-    size_t extra = 0, cnt = 0, offset;
-    size_t delta = 4; /* Extra bytes needed to update a entry's prevlen (5-1). */
-    unsigned char *tail = zl + intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl));
-
-    /* Empty ziplist */
-    if (p[0] == ZIP_END) return zl;
-
-    zipEntry(p, &cur); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
-    firstentrylen = prevlen = cur.headersize + cur.len;
-    prevlensize = zipStorePrevEntryLength(NULL, prevlen);
-    prevoffset = p - zl;
-    p += prevlen;
-
-    /* Iterate ziplist to find out how many extra bytes do we need to update it. */
-    while (p[0] != ZIP_END) {
-        assert(zipEntrySafe(zl, curlen, p, &cur, 0));
-
-        /* Abort when "prevlen" has not changed. */
-        if (cur.prevrawlen == prevlen) break;
-
-        /* Abort when entry's "prevlensize" is big enough. */
-        if (cur.prevrawlensize >= prevlensize) {
-            if (cur.prevrawlensize == prevlensize) {
-                zipStorePrevEntryLength(p, prevlen);
-            } else {
-                /* This would result in shrinking, which we want to avoid.
-                 * So, set "prevlen" in the available bytes. */
-                zipStorePrevEntryLengthLarge(p, prevlen);
-            }
-            break;
-        }
-
-        /* cur.prevrawlen means cur is the former head entry. */
-        assert(cur.prevrawlen == 0 || cur.prevrawlen + delta == prevlen);
-
-        /* Update prev entry's info and advance the cursor. */
-        rawlen = cur.headersize + cur.len;
-        prevlen = rawlen + delta; 
-        prevlensize = zipStorePrevEntryLength(NULL, prevlen);
-        prevoffset = p - zl;
-        p += rawlen;
-        extra += delta;
-        cnt++;
-    }
-
-    /* Extra bytes is zero all update has been done(or no need to update). */
-    if (extra == 0) return zl;
-
-    /* Update tail offset after loop. */
-    if (tail == zl + prevoffset) {
-        /* When the the last entry we need to update is also the tail, update tail offset
-         * unless this is the only entry that was updated (so the tail offset didn't change). */
-        if (extra - delta != 0) {
-            ZIPLIST_TAIL_OFFSET(zl) =
-                intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+extra-delta);
-        }
-    } else {
-        /* Update the tail offset in cases where the last entry we updated is not the tail. */
-        ZIPLIST_TAIL_OFFSET(zl) =
-            intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+extra);
-    }
-
-    /* Now "p" points at the first unchanged byte in original ziplist,
-     * move data after that to new ziplist. */
-    offset = p - zl;
-    zl = ziplistResize(zl, curlen + extra);
-    p = zl + offset;
-    memmove(p + extra, p, curlen - offset - 1);
-    p += extra;
-
-    /* Iterate all entries that need to be updated tail to head. */
-    while (cnt) {
-        zipEntry(zl + prevoffset, &cur); /* no need for "safe" variant since we already iterated on all these entries above. */
-        rawlen = cur.headersize + cur.len;
-        /* Move entry to tail and reset prevlen. */
-        memmove(p - (rawlen - cur.prevrawlensize), 
-                zl + prevoffset + cur.prevrawlensize, 
-                rawlen - cur.prevrawlensize);
-        p -= (rawlen + delta);
-        if (cur.prevrawlen == 0) {
-            /* "cur" is the previous head entry, update its prevlen with firstentrylen. */
-            zipStorePrevEntryLength(p, firstentrylen);
-        } else {
-            /* An entry's prevlen can only increment 4 bytes. */
-            zipStorePrevEntryLength(p, cur.prevrawlen+delta);
-        }
-        /* Foward to previous entry. */
-        prevoffset -= cur.prevrawlen;
-        cnt--;
-    }
-    return zl;
-}
-
-/* Delete "num" entries, starting at "p". Returns pointer to the ziplist. */
-unsigned char *__ziplistDelete(unsigned char *zl, unsigned char *p, unsigned int num) {
-    unsigned int i, totlen, deleted = 0;
-    size_t offset;
-    int nextdiff = 0;
-    zlentry first, tail;
-    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-
-    zipEntry(p, &first); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
-    for (i = 0; p[0] != ZIP_END && i < num; i++) {
-        p += zipRawEntryLengthSafe(zl, zlbytes, p);
-        deleted++;
-    }
-
-    assert(p >= first.p);
-    totlen = p-first.p; /* Bytes taken by the element(s) to delete. */
-    if (totlen > 0) {
-        uint32_t set_tail;
-        if (p[0] != ZIP_END) {
-            /* Storing `prevrawlen` in this entry may increase or decrease the
-             * number of bytes required compare to the current `prevrawlen`.
-             * There always is room to store this, because it was previously
-             * stored by an entry that is now being deleted. */
-            nextdiff = zipPrevLenByteDiff(p,first.prevrawlen);
-
-            /* Note that there is always space when p jumps backward: if
-             * the new previous entry is large, one of the deleted elements
-             * had a 5 bytes prevlen header, so there is for sure at least
-             * 5 bytes free and we need just 4. */
-            p -= nextdiff;
-            assert(p >= first.p && p<zl+zlbytes-1);
-            zipStorePrevEntryLength(p,first.prevrawlen);
-
-            /* Update offset for tail */
-            set_tail = intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))-totlen;
-
-            /* When the tail contains more than one entry, we need to take
-             * "nextdiff" in account as well. Otherwise, a change in the
-             * size of prevlen doesn't have an effect on the *tail* offset. */
-            assert(zipEntrySafe(zl, zlbytes, p, &tail, 1));
-            if (p[tail.headersize+tail.len] != ZIP_END) {
-                set_tail = set_tail + nextdiff;
-            }
-
-            /* Move tail to the front of the ziplist */
-            /* since we asserted that p >= first.p. we know totlen >= 0,
-             * so we know that p > first.p and this is guaranteed not to reach
-             * beyond the allocation, even if the entries lens are corrupted. */
-            size_t bytes_to_move = zlbytes-(p-zl)-1;
-            memmove(first.p,p,bytes_to_move);
-        } else {
-            /* The entire tail was deleted. No need to move memory. */
-            set_tail = (first.p-zl)-first.prevrawlen;
-        }
-
-        /* Resize the ziplist */
-        offset = first.p-zl;
-        zlbytes -= totlen - nextdiff;
-        zl = ziplistResize(zl, zlbytes);
-        p = zl+offset;
-
-        /* Update record count */
-        ZIPLIST_INCR_LENGTH(zl,-deleted);
-
-        /* Set the tail offset computed above */
-        assert(set_tail <= zlbytes - ZIPLIST_END_SIZE);
-        ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(set_tail);
-
-        /* When nextdiff != 0, the raw length of the next entry has changed, so
-         * we need to cascade the update throughout the ziplist */
-        if (nextdiff != 0)
-            zl = __ziplistCascadeUpdate(zl,p);
-    }
-    return zl;
-}
-
-/* Insert item at "p". */
-unsigned char *__ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
-    size_t curlen = intrev32ifbe(ZIPLIST_BYTES(zl)), reqlen, newlen;
-    unsigned int prevlensize, prevlen = 0;
-    size_t offset;
-    int nextdiff = 0;
-    unsigned char encoding = 0;
-    long long value = 123456789; /* initialized to avoid warning. Using a value
-                                    that is easy to see if for some reason
-                                    we use it uninitialized. */
-    zlentry tail;
-
-    /* Find out prevlen for the entry that is inserted. */
-    if (p[0] != ZIP_END) {
-        ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
-    } else {
-        unsigned char *ptail = ZIPLIST_ENTRY_TAIL(zl);
-        if (ptail[0] != ZIP_END) {
-            prevlen = zipRawEntryLengthSafe(zl, curlen, ptail);
-        }
-    }
-
-    /* See if the entry can be encoded */
-    if (zipTryEncoding(s,slen,&value,&encoding)) {
-        /* 'encoding' is set to the appropriate integer encoding */
-        reqlen = zipIntSize(encoding);
-    } else {
-        /* 'encoding' is untouched, however zipStoreEntryEncoding will use the
-         * string length to figure out how to encode it. */
-        reqlen = slen;
-    }
-    /* We need space for both the length of the previous entry and
-     * the length of the payload. */
-    reqlen += zipStorePrevEntryLength(NULL,prevlen);
-    reqlen += zipStoreEntryEncoding(NULL,encoding,slen);
-
-    /* When the insert position is not equal to the tail, we need to
-     * make sure that the next entry can hold this entry's length in
-     * its prevlen field. */
-    int forcelarge = 0;
-    nextdiff = (p[0] != ZIP_END) ? zipPrevLenByteDiff(p,reqlen) : 0;
-    if (nextdiff == -4 && reqlen < 4) {
-        nextdiff = 0;
-        forcelarge = 1;
-    }
-
-    /* Store offset because a realloc may change the address of zl. */
-    offset = p-zl;
-    newlen = curlen+reqlen+nextdiff;
-    zl = ziplistResize(zl,newlen);
-    p = zl+offset;
-
-    /* Apply memory move when necessary and update tail offset. */
-    if (p[0] != ZIP_END) {
-        /* Subtract one because of the ZIP_END bytes */
-        memmove(p+reqlen,p-nextdiff,curlen-offset-1+nextdiff);
-
-        /* Encode this entry's raw length in the next entry. */
-        if (forcelarge)
-            zipStorePrevEntryLengthLarge(p+reqlen,reqlen);
-        else
-            zipStorePrevEntryLength(p+reqlen,reqlen);
-
-        /* Update offset for tail */
-        ZIPLIST_TAIL_OFFSET(zl) =
-            intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+reqlen);
-
-        /* When the tail contains more than one entry, we need to take
-         * "nextdiff" in account as well. Otherwise, a change in the
-         * size of prevlen doesn't have an effect on the *tail* offset. */
-        assert(zipEntrySafe(zl, newlen, p+reqlen, &tail, 1));
-        if (p[reqlen+tail.headersize+tail.len] != ZIP_END) {
-            ZIPLIST_TAIL_OFFSET(zl) =
-                intrev32ifbe(intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl))+nextdiff);
-        }
-    } else {
-        /* This element will be the new tail. */
-        ZIPLIST_TAIL_OFFSET(zl) = intrev32ifbe(p-zl);
-    }
-
-    /* When nextdiff != 0, the raw length of the next entry has changed, so
-     * we need to cascade the update throughout the ziplist */
-    if (nextdiff != 0) {
-        offset = p-zl;
-        zl = __ziplistCascadeUpdate(zl,p+reqlen);
-        p = zl+offset;
-    }
-
-    /* Write the entry */
-    p += zipStorePrevEntryLength(p,prevlen);
-    p += zipStoreEntryEncoding(p,encoding,slen);
-    if (ZIP_IS_STR(encoding)) {
-        memcpy(p,s,slen);
-    } else {
-        zipSaveInteger(p,value,encoding);
-    }
-    ZIPLIST_INCR_LENGTH(zl,1);
-    return zl;
-}
-
-/* Merge ziplists 'first' and 'second' by appending 'second' to 'first'.
- *
- * NOTE: The larger ziplist is reallocated to contain the new merged ziplist.
- * Either 'first' or 'second' can be used for the result.  The parameter not
- * used will be free'd and set to NULL.
- *
- * After calling this function, the input parameters are no longer valid since
- * they are changed and free'd in-place.
- *
- * The result ziplist is the contents of 'first' followed by 'second'.
- *
- * On failure: returns NULL if the merge is impossible.
- * On success: returns the merged ziplist (which is expanded version of either
- * 'first' or 'second', also frees the other unused input ziplist, and sets the
- * input ziplist argument equal to newly reallocated ziplist return value. */
-unsigned char *ziplistMerge(unsigned char **first, unsigned char **second) {
-    /* If any params are null, we can't merge, so NULL. */
-    if (first == NULL || *first == NULL || second == NULL || *second == NULL)
-        return NULL;
-
-    /* Can't merge same list into itself. */
-    if (*first == *second)
-        return NULL;
-
-    size_t first_bytes = intrev32ifbe(ZIPLIST_BYTES(*first));
-    size_t first_len = intrev16ifbe(ZIPLIST_LENGTH(*first));
-
-    size_t second_bytes = intrev32ifbe(ZIPLIST_BYTES(*second));
-    size_t second_len = intrev16ifbe(ZIPLIST_LENGTH(*second));
-
-    int append;
-    unsigned char *source, *target;
-    size_t target_bytes, source_bytes;
-    /* Pick the largest ziplist so we can resize easily in-place.
-     * We must also track if we are now appending or prepending to
-     * the target ziplist. */
-    if (first_len >= second_len) {
-        /* retain first, append second to first. */
-        target = *first;
-        target_bytes = first_bytes;
-        source = *second;
-        source_bytes = second_bytes;
-        append = 1;
-    } else {
-        /* else, retain second, prepend first to second. */
-        target = *second;
-        target_bytes = second_bytes;
-        source = *first;
-        source_bytes = first_bytes;
-        append = 0;
-    }
-
-    /* Calculate final bytes (subtract one pair of metadata) */
-    size_t zlbytes = first_bytes + second_bytes -
-                     ZIPLIST_HEADER_SIZE - ZIPLIST_END_SIZE;
-    size_t zllength = first_len + second_len;
-
-    /* Combined zl length should be limited within UINT16_MAX */
-    zllength = zllength < UINT16_MAX ? zllength : UINT16_MAX;
-
-    /* larger values can't be stored into ZIPLIST_BYTES */
-    assert(zlbytes < UINT32_MAX);
-
-    /* Save offset positions before we start ripping memory apart. */
-    size_t first_offset = intrev32ifbe(ZIPLIST_TAIL_OFFSET(*first));
-    size_t second_offset = intrev32ifbe(ZIPLIST_TAIL_OFFSET(*second));
-
-    /* Extend target to new zlbytes then append or prepend source. */
-    target = zrealloc(target, zlbytes);
-    if (append) {
-        /* append == appending to target */
-        /* Copy source after target (copying over original [END]):
-         *   [TARGET - END, SOURCE - HEADER] */
-        memcpy(target + target_bytes - ZIPLIST_END_SIZE,
-               source + ZIPLIST_HEADER_SIZE,
-               source_bytes - ZIPLIST_HEADER_SIZE);
-    } else {
-        /* !append == prepending to target */
-        /* Move target *contents* exactly size of (source - [END]),
-         * then copy source into vacated space (source - [END]):
-         *   [SOURCE - END, TARGET - HEADER] */
-        memmove(target + source_bytes - ZIPLIST_END_SIZE,
-                target + ZIPLIST_HEADER_SIZE,
-                target_bytes - ZIPLIST_HEADER_SIZE);
-        memcpy(target, source, source_bytes - ZIPLIST_END_SIZE);
-    }
-
-    /* Update header metadata. */
-    ZIPLIST_BYTES(target) = intrev32ifbe(zlbytes);
-    ZIPLIST_LENGTH(target) = intrev16ifbe(zllength);
-    /* New tail offset is:
-     *   + N bytes of first ziplist
-     *   - 1 byte for [END] of first ziplist
-     *   + M bytes for the offset of the original tail of the second ziplist
-     *   - J bytes for HEADER because second_offset keeps no header. */
-    ZIPLIST_TAIL_OFFSET(target) = intrev32ifbe(
-                                   (first_bytes - ZIPLIST_END_SIZE) +
-                                   (second_offset - ZIPLIST_HEADER_SIZE));
-
-    /* __ziplistCascadeUpdate just fixes the prev length values until it finds a
-     * correct prev length value (then it assumes the rest of the list is okay).
-     * We tell CascadeUpdate to start at the first ziplist's tail element to fix
-     * the merge seam. */
-    target = __ziplistCascadeUpdate(target, target+first_offset);
-
-    /* Now free and NULL out what we didn't realloc */
-    if (append) {
-        zfree(*second);
-        *second = NULL;
-        *first = target;
-    } else {
-        zfree(*first);
-        *first = NULL;
-        *second = target;
-    }
-    return target;
-}
-
-unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where) {
-    unsigned char *p;
-    p = (where == ZIPLIST_HEAD) ? ZIPLIST_ENTRY_HEAD(zl) : ZIPLIST_ENTRY_END(zl);
-    return __ziplistInsert(zl,p,s,slen);
-}
-
-/* Returns an offset to use for iterating with ziplistNext. When the given
- * index is negative, the list is traversed back to front. When the list
- * doesn't contain an element at the provided index, NULL is returned. */
-unsigned char *ziplistIndex(unsigned char *zl, int index) {
-    unsigned char *p;
-    unsigned int prevlensize, prevlen = 0;
-    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-    if (index < 0) {
-        index = (-index)-1;
-        p = ZIPLIST_ENTRY_TAIL(zl);
-        if (p[0] != ZIP_END) {
-            /* No need for "safe" check: when going backwards, we know the header
-             * we're parsing is in the range, we just need to assert (below) that
-             * the size we take doesn't cause p to go outside the allocation. */
-            ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
-            while (prevlen > 0 && index--) {
-                p -= prevlen;
-                assert(p >= zl + ZIPLIST_HEADER_SIZE && p < zl + zlbytes - ZIPLIST_END_SIZE);
-                ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
-            }
-        }
-    } else {
-        p = ZIPLIST_ENTRY_HEAD(zl);
-        while (index--) {
-            /* Use the "safe" length: When we go forward, we need to be careful
-             * not to decode an entry header if it's past the ziplist allocation. */
-            p += zipRawEntryLengthSafe(zl, zlbytes, p);
-            if (p[0] == ZIP_END)
-                break;
-        }
-    }
-    if (p[0] == ZIP_END || index > 0)
-        return NULL;
-    zipAssertValidEntry(zl, zlbytes, p);
-    return p;
-}
-
-/* Return pointer to next entry in ziplist.
- *
- * zl is the pointer to the ziplist
- * p is the pointer to the current element
- *
- * The element after 'p' is returned, otherwise NULL if we are at the end. */
-unsigned char *ziplistNext(unsigned char *zl, unsigned char *p) {
-    ((void) zl);
-    size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-
-    /* "p" could be equal to ZIP_END, caused by ziplistDelete,
-     * and we should return NULL. Otherwise, we should return NULL
-     * when the *next* element is ZIP_END (there is no next entry). */
-    if (p[0] == ZIP_END) {
-        return NULL;
-    }
-
-    p += zipRawEntryLength(p);
-    if (p[0] == ZIP_END) {
-        return NULL;
-    }
-
-    zipAssertValidEntry(zl, zlbytes, p);
-    return p;
-}
-
-/* Return pointer to previous entry in ziplist. */
-unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p) {
-    unsigned int prevlensize, prevlen = 0;
-
-    /* Iterating backwards from ZIP_END should return the tail. When "p" is
-     * equal to the first element of the list, we're already at the head,
-     * and should return NULL. */
-    if (p[0] == ZIP_END) {
-        p = ZIPLIST_ENTRY_TAIL(zl);
-        return (p[0] == ZIP_END) ? NULL : p;
-    } else if (p == ZIPLIST_ENTRY_HEAD(zl)) {
-        return NULL;
-    } else {
-        ZIP_DECODE_PREVLEN(p, prevlensize, prevlen);
-        assert(prevlen > 0);
-        p-=prevlen;
-        size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-        zipAssertValidEntry(zl, zlbytes, p);
-        return p;
-    }
-}
-
-/* Get entry pointed to by 'p' and store in either '*sstr' or 'sval' depending
- * on the encoding of the entry. '*sstr' is always set to NULL to be able
- * to find out whether the string pointer or the integer value was set.
- * Return 0 if 'p' points to the end of the ziplist, 1 otherwise. */
-unsigned int ziplistGet(unsigned char *p, unsigned char **sstr, unsigned int *slen, long long *sval) {
-    zlentry entry;
-    if (p == NULL || p[0] == ZIP_END) return 0;
-    if (sstr) *sstr = NULL;
-
-    zipEntry(p, &entry); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
-    if (ZIP_IS_STR(entry.encoding)) {
-        if (sstr) {
-            *slen = entry.len;
-            *sstr = p+entry.headersize;
-        }
-    } else {
-        if (sval) {
-            *sval = zipLoadInteger(p+entry.headersize,entry.encoding);
-        }
-    }
-    return 1;
-}
-
-/* Insert an entry at "p". */
-unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
-    return __ziplistInsert(zl,p,s,slen);
-}
-
-/* Delete a single entry from the ziplist, pointed to by *p.
- * Also update *p in place, to be able to iterate over the
- * ziplist, while deleting entries. */
-unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p) {
-    size_t offset = *p-zl;
-    zl = __ziplistDelete(zl,*p,1);
-
-    /* Store pointer to current element in p, because ziplistDelete will
-     * do a realloc which might result in a different "zl"-pointer.
-     * When the delete direction is back to front, we might delete the last
-     * entry and end up with "p" pointing to ZIP_END, so check this. */
-    *p = zl+offset;
-    return zl;
-}
-
-/* Delete a range of entries from the ziplist. */
-unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num) {
-    unsigned char *p = ziplistIndex(zl,index);
-    return (p == NULL) ? zl : __ziplistDelete(zl,p,num);
-}
-
-/* Replaces the entry at p. This is equivalent to a delete and an insert,
- * but avoids some overhead when replacing a value of the same size. */
-unsigned char *ziplistReplace(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen) {
-
-    /* get metadata of the current entry */
-    zlentry entry;
-    zipEntry(p, &entry);
-
-    /* compute length of entry to store, excluding prevlen */
-    unsigned int reqlen;
-    unsigned char encoding = 0;
-    long long value = 123456789; /* initialized to avoid warning. */
-    if (zipTryEncoding(s,slen,&value,&encoding)) {
-        reqlen = zipIntSize(encoding); /* encoding is set */
-    } else {
-        reqlen = slen; /* encoding == 0 */
-    }
-    reqlen += zipStoreEntryEncoding(NULL,encoding,slen);
-
-    if (reqlen == entry.lensize + entry.len) {
-        /* Simply overwrite the element. */
-        p += entry.prevrawlensize;
-        p += zipStoreEntryEncoding(p,encoding,slen);
-        if (ZIP_IS_STR(encoding)) {
-            memcpy(p,s,slen);
-        } else {
-            zipSaveInteger(p,value,encoding);
-        }
-    } else {
-        /* Fallback. */
-        zl = ziplistDelete(zl,&p);
-        zl = ziplistInsert(zl,p,s,slen);
-    }
-    return zl;
-}
-
-/* Compare entry pointer to by 'p' with 'sstr' of length 'slen'. */
-/* Return 1 if equal. */
-unsigned int ziplistCompare(unsigned char *p, unsigned char *sstr, unsigned int slen) {
-    zlentry entry;
-    unsigned char sencoding;
-    long long zval, sval;
-    if (p[0] == ZIP_END) return 0;
-
-    zipEntry(p, &entry); /* no need for "safe" variant since the input pointer was validated by the function that returned it. */
-    if (ZIP_IS_STR(entry.encoding)) {
-        /* Raw compare */
-        if (entry.len == slen) {
-            return memcmp(p+entry.headersize,sstr,slen) == 0;
-        } else {
-            return 0;
-        }
-    } else {
-        /* Try to compare encoded values. Don't compare encoding because
-         * different implementations may encoded integers differently. */
-        if (zipTryEncoding(sstr,slen,&sval,&sencoding)) {
-          zval = zipLoadInteger(p+entry.headersize,entry.encoding);
-          return zval == sval;
-        }
-    }
-    return 0;
-}
-
-/* Find pointer to the entry equal to the specified entry. Skip 'skip' entries
- * between every comparison. Returns NULL when the field could not be found. */
-unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip) {
-    int skipcnt = 0;
-    unsigned char vencoding = 0;
-    long long vll = 0;
-    size_t zlbytes = ziplistBlobLen(zl);
-
-    while (p[0] != ZIP_END) {
-        struct zlentry e;
-        unsigned char *q;
-
-        assert(zipEntrySafe(zl, zlbytes, p, &e, 1));
-        q = p + e.prevrawlensize + e.lensize;
-
-        if (skipcnt == 0) {
-            /* Compare current entry with specified entry */
-            if (ZIP_IS_STR(e.encoding)) {
-                if (e.len == vlen && memcmp(q, vstr, vlen) == 0) {
-                    return p;
-                }
-            } else {
-                /* Find out if the searched field can be encoded. Note that
-                 * we do it only the first time, once done vencoding is set
-                 * to non-zero and vll is set to the integer value. */
-                if (vencoding == 0) {
-                    if (!zipTryEncoding(vstr, vlen, &vll, &vencoding)) {
-                        /* If the entry can't be encoded we set it to
-                         * UCHAR_MAX so that we don't retry again the next
-                         * time. */
-                        vencoding = UCHAR_MAX;
-                    }
-                    /* Must be non-zero by now */
-                    assert(vencoding);
-                }
-
-                /* Compare current entry with specified entry, do it only
-                 * if vencoding != UCHAR_MAX because if there is no encoding
-                 * possible for the field it can't be a valid integer. */
-                if (vencoding != UCHAR_MAX) {
-                    long long ll = zipLoadInteger(q, e.encoding);
-                    if (ll == vll) {
-                        return p;
-                    }
-                }
-            }
-
-            /* Reset skip count */
-            skipcnt = skip;
-        } else {
-            /* Skip entry */
-            skipcnt--;
-        }
-
-        /* Move to next entry */
-        p = q + e.len;
-    }
-
-    return NULL;
-}
-
-/* Return length of ziplist. */
-unsigned int ziplistLen(unsigned char *zl) {
-    unsigned int len = 0;
-    if (intrev16ifbe(ZIPLIST_LENGTH(zl)) < UINT16_MAX) {
-        len = intrev16ifbe(ZIPLIST_LENGTH(zl));
-    } else {
-        unsigned char *p = zl+ZIPLIST_HEADER_SIZE;
-        size_t zlbytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-        while (*p != ZIP_END) {
-            p += zipRawEntryLengthSafe(zl, zlbytes, p);
-            len++;
-        }
-
-        /* Re-store length if small enough */
-        if (len < UINT16_MAX) ZIPLIST_LENGTH(zl) = intrev16ifbe(len);
-    }
-    return len;
-}
-
-/* Return ziplist blob size in bytes. */
-size_t ziplistBlobLen(unsigned char *zl) {
-    return intrev32ifbe(ZIPLIST_BYTES(zl));
-}
-
-void ziplistRepr(unsigned char *zl) {
-    unsigned char *p;
-    int index = 0;
-    zlentry entry;
-    size_t zlbytes = ziplistBlobLen(zl);
-
-    printf(
-        "{total bytes %u} "
-        "{num entries %u}\n"
-        "{tail offset %u}\n",
-        intrev32ifbe(ZIPLIST_BYTES(zl)),
-        intrev16ifbe(ZIPLIST_LENGTH(zl)),
-        intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)));
-    p = ZIPLIST_ENTRY_HEAD(zl);
-    while(*p != ZIP_END) {
-        assert(zipEntrySafe(zl, zlbytes, p, &entry, 1));
-        printf(
-            "{\n"
-                "\taddr 0x%08lx,\n"
-                "\tindex %2d,\n"
-                "\toffset %5lu,\n"
-                "\thdr+entry len: %5u,\n"
-                "\thdr len%2u,\n"
-                "\tprevrawlen: %5u,\n"
-                "\tprevrawlensize: %2u,\n"
-                "\tpayload %5u\n",
-            (long unsigned)p,
-            index,
-            (unsigned long) (p-zl),
-            entry.headersize+entry.len,
-            entry.headersize,
-            entry.prevrawlen,
-            entry.prevrawlensize,
-            entry.len);
-        printf("\tbytes: ");
-        for (unsigned int i = 0; i < entry.headersize+entry.len; i++) {
-            printf("%02x|",p[i]);
-        }
-        printf("\n");
-        p += entry.headersize;
-        if (ZIP_IS_STR(entry.encoding)) {
-            printf("\t[str]");
-            if (entry.len > 40) {
-                if (fwrite(p,40,1,stdout) == 0) perror("fwrite");
-                printf("...");
-            } else {
-                if (entry.len &&
-                    fwrite(p,entry.len,1,stdout) == 0) perror("fwrite");
-            }
-        } else {
-            printf("\t[int]%lld", (long long) zipLoadInteger(p,entry.encoding));
-        }
-        printf("\n}\n");
-        p += entry.len;
-        index++;
-    }
-    printf("{end}\n\n");
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we scan all the entries one by one. */
-int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
-    ziplistValidateEntryCB entry_cb, void *cb_userdata) {
-    /* check that we can actually read the header. (and ZIP_END) */
-    if (size < ZIPLIST_HEADER_SIZE + ZIPLIST_END_SIZE)
-        return 0;
-
-    /* check that the encoded size in the header must match the allocated size. */
-    size_t bytes = intrev32ifbe(ZIPLIST_BYTES(zl));
-    if (bytes != size)
-        return 0;
-
-    /* the last byte must be the terminator. */
-    if (zl[size - ZIPLIST_END_SIZE] != ZIP_END)
-        return 0;
-
-    /* make sure the tail offset isn't reaching outside the allocation. */
-    if (intrev32ifbe(ZIPLIST_TAIL_OFFSET(zl)) > size - ZIPLIST_END_SIZE)
-        return 0;
-
-    if (!deep)
-        return 1;
-
-    unsigned int count = 0;
-    unsigned char *p = ZIPLIST_ENTRY_HEAD(zl);
-    unsigned char *prev = NULL;
-    size_t prev_raw_size = 0;
-    while(*p != ZIP_END) {
-        struct zlentry e;
-        /* Decode the entry headers and fail if invalid or reaches outside the allocation */
-        if (!zipEntrySafe(zl, size, p, &e, 1))
-            return 0;
-
-        /* Make sure the record stating the prev entry size is correct. */
-        if (e.prevrawlen != prev_raw_size)
-            return 0;
-
-        /* Optionally let the caller validate the entry too. */
-        if (entry_cb && !entry_cb(p, cb_userdata))
-            return 0;
-
-        /* Move to the next entry */
-        prev_raw_size = e.headersize + e.len;
-        prev = p;
-        p += e.headersize + e.len;
-        count++;
-    }
-
-    /* Make sure 'p' really does point to the end of the ziplist. */
-    if (p != zl + bytes - ZIPLIST_END_SIZE)
-        return 0;
-
-    /* Make sure the <zltail> entry really do point to the start of the last entry. */
-    if (prev != NULL && prev != ZIPLIST_ENTRY_TAIL(zl))
-        return 0;
-
-    /* Check that the count in the header is correct */
-    unsigned int header_count = intrev16ifbe(ZIPLIST_LENGTH(zl));
-    if (header_count != UINT16_MAX && count != header_count)
-        return 0;
-
-    return 1;
-}
-
-/* Randomly select a pair of key and value.
- * total_count is a pre-computed length/2 of the ziplist (to avoid calls to ziplistLen)
- * 'key' and 'val' are used to store the result key value pair.
- * 'val' can be NULL if the value is not needed. */
-void ziplistRandomPair(unsigned char *zl, unsigned long total_count, ziplistEntry *key, ziplistEntry *val) {
-    int ret;
-    unsigned char *p;
-
-    /* Avoid div by zero on corrupt ziplist */
-    assert(total_count);
-
-    /* Generate even numbers, because ziplist saved K-V pair */
-    int r = (rand() % total_count) * 2;
-    p = ziplistIndex(zl, r);
-    ret = ziplistGet(p, &key->sval, &key->slen, &key->lval);
-    assert(ret != 0);
-
-    if (!val)
-        return;
-    p = ziplistNext(zl, p);
-    ret = ziplistGet(p, &val->sval, &val->slen, &val->lval);
-    assert(ret != 0);
-}
-
-/* int compare for qsort */
-int uintCompare(const void *a, const void *b) {
-    return (*(unsigned int *) a - *(unsigned int *) b);
-}
-
-/* Helper method to store a string into from val or lval into dest */
-static inline void ziplistSaveValue(unsigned char *val, unsigned int len, long long lval, ziplistEntry *dest) {
-    dest->sval = val;
-    dest->slen = len;
-    dest->lval = lval;
-}
-
-/* Randomly select count of key value pairs and store into 'keys' and
- * 'vals' args. The order of the picked entries is random, and the selections
- * are non-unique (repetitions are possible).
- * The 'vals' arg can be NULL in which case we skip these. */
-void ziplistRandomPairs(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
-    unsigned char *p, *key, *value;
-    unsigned int klen = 0, vlen = 0;
-    long long klval = 0, vlval = 0;
-
-    /* Notice: the index member must be first due to the use in uintCompare */
-    typedef struct {
-        unsigned int index;
-        unsigned int order;
-    } rand_pick;
-    rand_pick *picks = zmalloc(sizeof(rand_pick)*count);
-    unsigned int total_size = ziplistLen(zl)/2;
-
-    /* Avoid div by zero on corrupt ziplist */
-    assert(total_size);
-
-    /* create a pool of random indexes (some may be duplicate). */
-    for (unsigned int i = 0; i < count; i++) {
-        picks[i].index = (rand() % total_size) * 2; /* Generate even indexes */
-        /* keep track of the order we picked them */
-        picks[i].order = i;
-    }
-
-    /* sort by indexes. */
-    qsort(picks, count, sizeof(rand_pick), uintCompare);
-
-    /* fetch the elements form the ziplist into a output array respecting the original order. */
-    unsigned int zipindex = 0, pickindex = 0;
-    p = ziplistIndex(zl, 0);
-    while (ziplistGet(p, &key, &klen, &klval) && pickindex < count) {
-        p = ziplistNext(zl, p);
-        assert(ziplistGet(p, &value, &vlen, &vlval));
-        while (pickindex < count && zipindex == picks[pickindex].index) {
-            int storeorder = picks[pickindex].order;
-            ziplistSaveValue(key, klen, klval, &keys[storeorder]);
-            if (vals)
-                ziplistSaveValue(value, vlen, vlval, &vals[storeorder]);
-             pickindex++;
-        }
-        zipindex += 2;
-        p = ziplistNext(zl, p);
-    }
-
-    zfree(picks);
-}
-
-/* Randomly select count of key value pairs and store into 'keys' and
- * 'vals' args. The selections are unique (no repetitions), and the order of
- * the picked entries is NOT-random.
- * The 'vals' arg can be NULL in which case we skip these.
- * The return value is the number of items picked which can be lower than the
- * requested count if the ziplist doesn't hold enough pairs. */
-unsigned int ziplistRandomPairsUnique(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals) {
-    unsigned char *p, *key;
-    unsigned int klen = 0;
-    long long klval = 0;
-    unsigned int total_size = ziplistLen(zl)/2;
-    unsigned int index = 0;
-    if (count > total_size)
-        count = total_size;
-
-    /* To only iterate once, every time we try to pick a member, the probability
-     * we pick it is the quotient of the count left we want to pick and the
-     * count still we haven't visited in the dict, this way, we could make every
-     * member be equally picked.*/
-    p = ziplistIndex(zl, 0);
-    unsigned int picked = 0, remaining = count;
-    while (picked < count && p) {
-        double randomDouble = ((double)rand()) / RAND_MAX;
-        double threshold = ((double)remaining) / (total_size - index);
-        if (randomDouble <= threshold) {
-            assert(ziplistGet(p, &key, &klen, &klval));
-            ziplistSaveValue(key, klen, klval, &keys[picked]);
-            p = ziplistNext(zl, p);
-            assert(p);
-            if (vals) {
-                assert(ziplistGet(p, &key, &klen, &klval));
-                ziplistSaveValue(key, klen, klval, &vals[picked]);
-            }
-            remaining--;
-            picked++;
-        } else {
-            p = ziplistNext(zl, p);
-            assert(p);
-        }
-        p = ziplistNext(zl, p);
-        index++;
-    }
-    return picked;
-}
-
-#ifdef REDIS_TEST
-#include <sys/time.h>
-#include "adlist.h"
-#include "sds.h"
-
-#define debug(f, ...) { if (DEBUG) printf(f, __VA_ARGS__); }
-
-static unsigned char *createList() {
-    unsigned char *zl = ziplistNew();
-    zl = ziplistPush(zl, (unsigned char*)"foo", 3, ZIPLIST_TAIL);
-    zl = ziplistPush(zl, (unsigned char*)"quux", 4, ZIPLIST_TAIL);
-    zl = ziplistPush(zl, (unsigned char*)"hello", 5, ZIPLIST_HEAD);
-    zl = ziplistPush(zl, (unsigned char*)"1024", 4, ZIPLIST_TAIL);
-    return zl;
-}
-
-static unsigned char *createIntList() {
-    unsigned char *zl = ziplistNew();
-    char buf[32];
-
-    sprintf(buf, "100");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
-    sprintf(buf, "128000");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
-    sprintf(buf, "-100");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_HEAD);
-    sprintf(buf, "4294967296");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_HEAD);
-    sprintf(buf, "non integer");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
-    sprintf(buf, "much much longer non integer");
-    zl = ziplistPush(zl, (unsigned char*)buf, strlen(buf), ZIPLIST_TAIL);
-    return zl;
-}
-
-static long long usec(void) {
-    struct timeval tv;
-    gettimeofday(&tv,NULL);
-    return (((long long)tv.tv_sec)*1000000)+tv.tv_usec;
-}
-
-static void stress(int pos, int num, int maxsize, int dnum) {
-    int i,j,k;
-    unsigned char *zl;
-    char posstr[2][5] = { "HEAD", "TAIL" };
-    long long start;
-    for (i = 0; i < maxsize; i+=dnum) {
-        zl = ziplistNew();
-        for (j = 0; j < i; j++) {
-            zl = ziplistPush(zl,(unsigned char*)"quux",4,ZIPLIST_TAIL);
-        }
-
-        /* Do num times a push+pop from pos */
-        start = usec();
-        for (k = 0; k < num; k++) {
-            zl = ziplistPush(zl,(unsigned char*)"quux",4,pos);
-            zl = ziplistDeleteRange(zl,0,1);
-        }
-        printf("List size: %8d, bytes: %8d, %dx push+pop (%s): %6lld usec\n",
-            i,intrev32ifbe(ZIPLIST_BYTES(zl)),num,posstr[pos],usec()-start);
-        zfree(zl);
-    }
-}
-
-static unsigned char *pop(unsigned char *zl, int where) {
-    unsigned char *p, *vstr;
-    unsigned int vlen;
-    long long vlong;
-
-    p = ziplistIndex(zl,where == ZIPLIST_HEAD ? 0 : -1);
-    if (ziplistGet(p,&vstr,&vlen,&vlong)) {
-        if (where == ZIPLIST_HEAD)
-            printf("Pop head: ");
-        else
-            printf("Pop tail: ");
-
-        if (vstr) {
-            if (vlen && fwrite(vstr,vlen,1,stdout) == 0) perror("fwrite");
-        }
-        else {
-            printf("%lld", vlong);
-        }
-
-        printf("\n");
-        return ziplistDelete(zl,&p);
-    } else {
-        printf("ERROR: Could not pop\n");
-        exit(1);
-    }
-}
-
-static int randstring(char *target, unsigned int min, unsigned int max) {
-    int p = 0;
-    int len = min+rand()%(max-min+1);
-    int minval, maxval;
-    switch(rand() % 3) {
-    case 0:
-        minval = 0;
-        maxval = 255;
-    break;
-    case 1:
-        minval = 48;
-        maxval = 122;
-    break;
-    case 2:
-        minval = 48;
-        maxval = 52;
-    break;
-    default:
-        assert(NULL);
-    }
-
-    while(p < len)
-        target[p++] = minval+rand()%(maxval-minval+1);
-    return len;
-}
-
-static void verify(unsigned char *zl, zlentry *e) {
-    int len = ziplistLen(zl);
-    zlentry _e;
-
-    ZIPLIST_ENTRY_ZERO(&_e);
-
-    for (int i = 0; i < len; i++) {
-        memset(&e[i], 0, sizeof(zlentry));
-        zipEntry(ziplistIndex(zl, i), &e[i]);
-
-        memset(&_e, 0, sizeof(zlentry));
-        zipEntry(ziplistIndex(zl, -len+i), &_e);
-
-        assert(memcmp(&e[i], &_e, sizeof(zlentry)) == 0);
-    }
-}
-
-static unsigned char *insertHelper(unsigned char *zl, char ch, size_t len, unsigned char *pos) {
-    assert(len <= ZIP_BIG_PREVLEN);
-    unsigned char data[ZIP_BIG_PREVLEN] = {0};
-    memset(data, ch, len);
-    return ziplistInsert(zl, pos, data, len);
-}
-
-static int compareHelper(unsigned char *zl, char ch, size_t len, int index) {
-    assert(len <= ZIP_BIG_PREVLEN);
-    unsigned char data[ZIP_BIG_PREVLEN] = {0};
-    memset(data, ch, len);
-    unsigned char *p = ziplistIndex(zl, index);
-    assert(p != NULL);
-    return ziplistCompare(p, data, len);
-}
-
-static size_t strEntryBytesSmall(size_t slen) {
-    return slen + zipStorePrevEntryLength(NULL, 0) + zipStoreEntryEncoding(NULL, 0, slen);
-}
-
-static size_t strEntryBytesLarge(size_t slen) {
-    return slen + zipStorePrevEntryLength(NULL, ZIP_BIG_PREVLEN) + zipStoreEntryEncoding(NULL, 0, slen);
-}
-
-/* ./redis-server test ziplist <randomseed> --accurate */
-int ziplistTest(int argc, char **argv, int accurate) {
-    unsigned char *zl, *p;
-    unsigned char *entry;
-    unsigned int elen;
-    long long value;
-    int iteration;
-
-    /* If an argument is given, use it as the random seed. */
-    if (argc >= 4)
-        srand(atoi(argv[3]));
-
-    zl = createIntList();
-    ziplistRepr(zl);
-
-    zfree(zl);
-
-    zl = createList();
-    ziplistRepr(zl);
-
-    zl = pop(zl,ZIPLIST_TAIL);
-    ziplistRepr(zl);
-
-    zl = pop(zl,ZIPLIST_HEAD);
-    ziplistRepr(zl);
-
-    zl = pop(zl,ZIPLIST_TAIL);
-    ziplistRepr(zl);
-
-    zl = pop(zl,ZIPLIST_TAIL);
-    ziplistRepr(zl);
-
-    zfree(zl);
-
-    printf("Get element at index 3:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 3);
-        if (!ziplistGet(p, &entry, &elen, &value)) {
-            printf("ERROR: Could not access index 3\n");
-            return 1;
-        }
-        if (entry) {
-            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            printf("\n");
-        } else {
-            printf("%lld\n", value);
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Get element at index 4 (out of range):\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 4);
-        if (p == NULL) {
-            printf("No entry\n");
-        } else {
-            printf("ERROR: Out of range index should return NULL, returned offset: %ld\n", (long)(p-zl));
-            return 1;
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Get element at index -1 (last element):\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, -1);
-        if (!ziplistGet(p, &entry, &elen, &value)) {
-            printf("ERROR: Could not access index -1\n");
-            return 1;
-        }
-        if (entry) {
-            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            printf("\n");
-        } else {
-            printf("%lld\n", value);
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Get element at index -4 (first element):\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, -4);
-        if (!ziplistGet(p, &entry, &elen, &value)) {
-            printf("ERROR: Could not access index -4\n");
-            return 1;
-        }
-        if (entry) {
-            if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            printf("\n");
-        } else {
-            printf("%lld\n", value);
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Get element at index -5 (reverse out of range):\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, -5);
-        if (p == NULL) {
-            printf("No entry\n");
-        } else {
-            printf("ERROR: Out of range index should return NULL, returned offset: %ld\n", (long)(p-zl));
-            return 1;
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate list from 0 to end:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 0);
-        while (ziplistGet(p, &entry, &elen, &value)) {
-            printf("Entry: ");
-            if (entry) {
-                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            } else {
-                printf("%lld", value);
-            }
-            p = ziplistNext(zl,p);
-            printf("\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate list from 1 to end:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 1);
-        while (ziplistGet(p, &entry, &elen, &value)) {
-            printf("Entry: ");
-            if (entry) {
-                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            } else {
-                printf("%lld", value);
-            }
-            p = ziplistNext(zl,p);
-            printf("\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate list from 2 to end:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 2);
-        while (ziplistGet(p, &entry, &elen, &value)) {
-            printf("Entry: ");
-            if (entry) {
-                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            } else {
-                printf("%lld", value);
-            }
-            p = ziplistNext(zl,p);
-            printf("\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate starting out of range:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, 4);
-        if (!ziplistGet(p, &entry, &elen, &value)) {
-            printf("No entry\n");
-        } else {
-            printf("ERROR\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate from back to front:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, -1);
-        while (ziplistGet(p, &entry, &elen, &value)) {
-            printf("Entry: ");
-            if (entry) {
-                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            } else {
-                printf("%lld", value);
-            }
-            p = ziplistPrev(zl,p);
-            printf("\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Iterate from back to front, deleting all items:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl, -1);
-        while (ziplistGet(p, &entry, &elen, &value)) {
-            printf("Entry: ");
-            if (entry) {
-                if (elen && fwrite(entry,elen,1,stdout) == 0) perror("fwrite");
-            } else {
-                printf("%lld", value);
-            }
-            zl = ziplistDelete(zl,&p);
-            p = ziplistPrev(zl,p);
-            printf("\n");
-        }
-        printf("\n");
-        zfree(zl);
-    }
-
-    printf("Delete inclusive range 0,0:\n");
-    {
-        zl = createList();
-        zl = ziplistDeleteRange(zl, 0, 1);
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Delete inclusive range 0,1:\n");
-    {
-        zl = createList();
-        zl = ziplistDeleteRange(zl, 0, 2);
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Delete inclusive range 1,2:\n");
-    {
-        zl = createList();
-        zl = ziplistDeleteRange(zl, 1, 2);
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Delete with start index out of range:\n");
-    {
-        zl = createList();
-        zl = ziplistDeleteRange(zl, 5, 1);
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Delete with num overflow:\n");
-    {
-        zl = createList();
-        zl = ziplistDeleteRange(zl, 1, 5);
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Delete foo while iterating:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl,0);
-        while (ziplistGet(p,&entry,&elen,&value)) {
-            if (entry && strncmp("foo",(char*)entry,elen) == 0) {
-                printf("Delete foo\n");
-                zl = ziplistDelete(zl,&p);
-            } else {
-                printf("Entry: ");
-                if (entry) {
-                    if (elen && fwrite(entry,elen,1,stdout) == 0)
-                        perror("fwrite");
-                } else {
-                    printf("%lld",value);
-                }
-                p = ziplistNext(zl,p);
-                printf("\n");
-            }
-        }
-        printf("\n");
-        ziplistRepr(zl);
-        zfree(zl);
-    }
-
-    printf("Replace with same size:\n");
-    {
-        zl = createList(); /* "hello", "foo", "quux", "1024" */
-        unsigned char *orig_zl = zl;
-        p = ziplistIndex(zl, 0);
-        zl = ziplistReplace(zl, p, (unsigned char*)"zoink", 5);
-        p = ziplistIndex(zl, 3);
-        zl = ziplistReplace(zl, p, (unsigned char*)"yy", 2);
-        p = ziplistIndex(zl, 1);
-        zl = ziplistReplace(zl, p, (unsigned char*)"65536", 5);
-        p = ziplistIndex(zl, 0);
-        assert(!memcmp((char*)p,
-                       "\x00\x05zoink"
-                       "\x07\xf0\x00\x00\x01" /* 65536 as int24 */
-                       "\x05\x04quux" "\x06\x02yy" "\xff",
-                       23));
-        assert(zl == orig_zl); /* no reallocations have happened */
-        zfree(zl);
-        printf("SUCCESS\n\n");
-    }
-
-    printf("Replace with different size:\n");
-    {
-        zl = createList(); /* "hello", "foo", "quux", "1024" */
-        p = ziplistIndex(zl, 1);
-        zl = ziplistReplace(zl, p, (unsigned char*)"squirrel", 8);
-        p = ziplistIndex(zl, 0);
-        assert(!strncmp((char*)p,
-                        "\x00\x05hello" "\x07\x08squirrel" "\x0a\x04quux"
-                        "\x06\xc0\x00\x04" "\xff",
-                        28));
-        zfree(zl);
-        printf("SUCCESS\n\n");
-    }
-
-    printf("Regression test for >255 byte strings:\n");
-    {
-        char v1[257] = {0}, v2[257] = {0};
-        memset(v1,'x',256);
-        memset(v2,'y',256);
-        zl = ziplistNew();
-        zl = ziplistPush(zl,(unsigned char*)v1,strlen(v1),ZIPLIST_TAIL);
-        zl = ziplistPush(zl,(unsigned char*)v2,strlen(v2),ZIPLIST_TAIL);
-
-        /* Pop values again and compare their value. */
-        p = ziplistIndex(zl,0);
-        assert(ziplistGet(p,&entry,&elen,&value));
-        assert(strncmp(v1,(char*)entry,elen) == 0);
-        p = ziplistIndex(zl,1);
-        assert(ziplistGet(p,&entry,&elen,&value));
-        assert(strncmp(v2,(char*)entry,elen) == 0);
-        printf("SUCCESS\n\n");
-        zfree(zl);
-    }
-
-    printf("Regression test deleting next to last entries:\n");
-    {
-        char v[3][257] = {{0}};
-        zlentry e[3] = {{.prevrawlensize = 0, .prevrawlen = 0, .lensize = 0,
-                         .len = 0, .headersize = 0, .encoding = 0, .p = NULL}};
-        size_t i;
-
-        for (i = 0; i < (sizeof(v)/sizeof(v[0])); i++) {
-            memset(v[i], 'a' + i, sizeof(v[0]));
-        }
-
-        v[0][256] = '\0';
-        v[1][  1] = '\0';
-        v[2][256] = '\0';
-
-        zl = ziplistNew();
-        for (i = 0; i < (sizeof(v)/sizeof(v[0])); i++) {
-            zl = ziplistPush(zl, (unsigned char *) v[i], strlen(v[i]), ZIPLIST_TAIL);
-        }
-
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1);
-        assert(e[1].prevrawlensize == 5);
-        assert(e[2].prevrawlensize == 1);
-
-        /* Deleting entry 1 will increase `prevrawlensize` for entry 2 */
-        unsigned char *p = e[1].p;
-        zl = ziplistDelete(zl, &p);
-
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1);
-        assert(e[1].prevrawlensize == 5);
-
-        printf("SUCCESS\n\n");
-        zfree(zl);
-    }
-
-    printf("Create long list and check indices:\n");
-    {
-        unsigned long long start = usec();
-        zl = ziplistNew();
-        char buf[32];
-        int i,len;
-        for (i = 0; i < 1000; i++) {
-            len = sprintf(buf,"%d",i);
-            zl = ziplistPush(zl,(unsigned char*)buf,len,ZIPLIST_TAIL);
-        }
-        for (i = 0; i < 1000; i++) {
-            p = ziplistIndex(zl,i);
-            assert(ziplistGet(p,NULL,NULL,&value));
-            assert(i == value);
-
-            p = ziplistIndex(zl,-i-1);
-            assert(ziplistGet(p,NULL,NULL,&value));
-            assert(999-i == value);
-        }
-        printf("SUCCESS. usec=%lld\n\n", usec()-start);
-        zfree(zl);
-    }
-
-    printf("Compare strings with ziplist entries:\n");
-    {
-        zl = createList();
-        p = ziplistIndex(zl,0);
-        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
-            printf("ERROR: not \"hello\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
-            printf("ERROR: \"hella\"\n");
-            return 1;
-        }
-
-        p = ziplistIndex(zl,3);
-        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
-            printf("ERROR: not \"1024\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
-            printf("ERROR: \"1025\"\n");
-            return 1;
-        }
-        printf("SUCCESS\n\n");
-        zfree(zl);
-    }
-
-    printf("Merge test:\n");
-    {
-        /* create list gives us: [hello, foo, quux, 1024] */
-        zl = createList();
-        unsigned char *zl2 = createList();
-
-        unsigned char *zl3 = ziplistNew();
-        unsigned char *zl4 = ziplistNew();
-
-        if (ziplistMerge(&zl4, &zl4)) {
-            printf("ERROR: Allowed merging of one ziplist into itself.\n");
-            return 1;
-        }
-
-        /* Merge two empty ziplists, get empty result back. */
-        zl4 = ziplistMerge(&zl3, &zl4);
-        ziplistRepr(zl4);
-        if (ziplistLen(zl4)) {
-            printf("ERROR: Merging two empty ziplists created entries.\n");
-            return 1;
-        }
-        zfree(zl4);
-
-        zl2 = ziplistMerge(&zl, &zl2);
-        /* merge gives us: [hello, foo, quux, 1024, hello, foo, quux, 1024] */
-        ziplistRepr(zl2);
-
-        if (ziplistLen(zl2) != 8) {
-            printf("ERROR: Merged length not 8, but: %u\n", ziplistLen(zl2));
-            return 1;
-        }
-
-        p = ziplistIndex(zl2,0);
-        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
-            printf("ERROR: not \"hello\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
-            printf("ERROR: \"hella\"\n");
-            return 1;
-        }
-
-        p = ziplistIndex(zl2,3);
-        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
-            printf("ERROR: not \"1024\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
-            printf("ERROR: \"1025\"\n");
-            return 1;
-        }
-
-        p = ziplistIndex(zl2,4);
-        if (!ziplistCompare(p,(unsigned char*)"hello",5)) {
-            printf("ERROR: not \"hello\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"hella",5)) {
-            printf("ERROR: \"hella\"\n");
-            return 1;
-        }
-
-        p = ziplistIndex(zl2,7);
-        if (!ziplistCompare(p,(unsigned char*)"1024",4)) {
-            printf("ERROR: not \"1024\"\n");
-            return 1;
-        }
-        if (ziplistCompare(p,(unsigned char*)"1025",4)) {
-            printf("ERROR: \"1025\"\n");
-            return 1;
-        }
-        printf("SUCCESS\n\n");
-        zfree(zl);
-    }
-
-    printf("Stress with random payloads of different encoding:\n");
-    {
-        unsigned long long start = usec();
-        int i,j,len,where;
-        unsigned char *p;
-        char buf[1024];
-        int buflen;
-        list *ref;
-        listNode *refnode;
-
-        /* Hold temp vars from ziplist */
-        unsigned char *sstr;
-        unsigned int slen;
-        long long sval;
-
-        iteration = accurate ? 20000 : 20;
-        for (i = 0; i < iteration; i++) {
-            zl = ziplistNew();
-            ref = listCreate();
-            listSetFreeMethod(ref,(void (*)(void*))sdsfree);
-            len = rand() % 256;
-
-            /* Create lists */
-            for (j = 0; j < len; j++) {
-                where = (rand() & 1) ? ZIPLIST_HEAD : ZIPLIST_TAIL;
-                if (rand() % 2) {
-                    buflen = randstring(buf,1,sizeof(buf)-1);
-                } else {
-                    switch(rand() % 3) {
-                    case 0:
-                        buflen = sprintf(buf,"%lld",(0LL + rand()) >> 20);
-                        break;
-                    case 1:
-                        buflen = sprintf(buf,"%lld",(0LL + rand()));
-                        break;
-                    case 2:
-                        buflen = sprintf(buf,"%lld",(0LL + rand()) << 20);
-                        break;
-                    default:
-                        assert(NULL);
-                    }
-                }
-
-                /* Add to ziplist */
-                zl = ziplistPush(zl, (unsigned char*)buf, buflen, where);
-
-                /* Add to reference list */
-                if (where == ZIPLIST_HEAD) {
-                    listAddNodeHead(ref,sdsnewlen(buf, buflen));
-                } else if (where == ZIPLIST_TAIL) {
-                    listAddNodeTail(ref,sdsnewlen(buf, buflen));
-                } else {
-                    assert(NULL);
-                }
-            }
-
-            assert(listLength(ref) == ziplistLen(zl));
-            for (j = 0; j < len; j++) {
-                /* Naive way to get elements, but similar to the stresser
-                 * executed from the Tcl test suite. */
-                p = ziplistIndex(zl,j);
-                refnode = listIndex(ref,j);
-
-                assert(ziplistGet(p,&sstr,&slen,&sval));
-                if (sstr == NULL) {
-                    buflen = sprintf(buf,"%lld",sval);
-                } else {
-                    buflen = slen;
-                    memcpy(buf,sstr,buflen);
-                    buf[buflen] = '\0';
-                }
-                assert(memcmp(buf,listNodeValue(refnode),buflen) == 0);
-            }
-            zfree(zl);
-            listRelease(ref);
-        }
-        printf("Done. usec=%lld\n\n", usec()-start);
-    }
-
-    printf("Stress with variable ziplist size:\n");
-    {
-        unsigned long long start = usec();
-        int maxsize = accurate ? 16384 : 16;
-        stress(ZIPLIST_HEAD,100000,maxsize,256);
-        stress(ZIPLIST_TAIL,100000,maxsize,256);
-        printf("Done. usec=%lld\n\n", usec()-start);
-    }
-
-    /* Benchmarks */
-    {
-        zl = ziplistNew();
-        iteration = accurate ? 100000 : 100;
-        for (int i=0; i<iteration; i++) {
-            char buf[4096] = "asdf";
-            zl = ziplistPush(zl, (unsigned char*)buf, 4, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)buf, 40, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)buf, 400, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)buf, 4000, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"1", 1, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"10", 2, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"100", 3, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"1000", 4, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"10000", 5, ZIPLIST_TAIL);
-            zl = ziplistPush(zl, (unsigned char*)"100000", 6, ZIPLIST_TAIL);
-        }
-
-        printf("Benchmark ziplistFind:\n");
-        {
-            unsigned long long start = usec();
-            for (int i = 0; i < 2000; i++) {
-                unsigned char *fptr = ziplistIndex(zl, ZIPLIST_HEAD);
-                fptr = ziplistFind(zl, fptr, (unsigned char*)"nothing", 7, 1);
-            }
-            printf("%lld\n", usec()-start);
-        }
-
-        printf("Benchmark ziplistIndex:\n");
-        {
-            unsigned long long start = usec();
-            for (int i = 0; i < 2000; i++) {
-                ziplistIndex(zl, 99999);
-            }
-            printf("%lld\n", usec()-start);
-        }
-
-        printf("Benchmark ziplistValidateIntegrity:\n");
-        {
-            unsigned long long start = usec();
-            for (int i = 0; i < 2000; i++) {
-                ziplistValidateIntegrity(zl, ziplistBlobLen(zl), 1, NULL, NULL);
-            }
-            printf("%lld\n", usec()-start);
-        }
-
-        zfree(zl);
-    }
-
-    printf("Stress __ziplistCascadeUpdate:\n");
-    {
-        char data[ZIP_BIG_PREVLEN];
-        zl = ziplistNew();
-        iteration = accurate ? 100000 : 100;
-        for (int i = 0; i < iteration; i++) {
-            zl = ziplistPush(zl, (unsigned char*)data, ZIP_BIG_PREVLEN-4, ZIPLIST_TAIL);
-        }
-        unsigned long long start = usec();
-        zl = ziplistPush(zl, (unsigned char*)data, ZIP_BIG_PREVLEN-3, ZIPLIST_HEAD);
-        printf("Done. usec=%lld\n\n", usec()-start);
-        zfree(zl);
-    }
-
-    printf("Edge cases of __ziplistCascadeUpdate:\n");
-    {
-        /* Inserting a entry with data length greater than ZIP_BIG_PREVLEN-4 
-         * will leads to cascade update. */
-        size_t s1 = ZIP_BIG_PREVLEN-4, s2 = ZIP_BIG_PREVLEN-3;
-        zl = ziplistNew();
-
-        zlentry e[4] = {{.prevrawlensize = 0, .prevrawlen = 0, .lensize = 0,
-                         .len = 0, .headersize = 0, .encoding = 0, .p = NULL}};
-
-        zl = insertHelper(zl, 'a', s1, ZIPLIST_ENTRY_HEAD(zl));
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
-        assert(compareHelper(zl, 'a', s1, 0));
-        ziplistRepr(zl);
-
-        /* No expand. */
-        zl = insertHelper(zl, 'b', s1, ZIPLIST_ENTRY_HEAD(zl));
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
-        assert(compareHelper(zl, 'b', s1, 0));
-
-        assert(e[1].prevrawlensize == 1 && e[1].prevrawlen == strEntryBytesSmall(s1));
-        assert(compareHelper(zl, 'a', s1, 1));
-
-        ziplistRepr(zl);
-
-        /* Expand(tail included). */
-        zl = insertHelper(zl, 'c', s2, ZIPLIST_ENTRY_HEAD(zl));
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
-        assert(compareHelper(zl, 'c', s2, 0));
-
-        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
-        assert(compareHelper(zl, 'b', s1, 1));
-
-        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s1));
-        assert(compareHelper(zl, 'a', s1, 2));
-
-        ziplistRepr(zl);
-
-        /* Expand(only previous head entry). */
-        zl = insertHelper(zl, 'd', s2, ZIPLIST_ENTRY_HEAD(zl));
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
-        assert(compareHelper(zl, 'd', s2, 0));
-
-        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
-        assert(compareHelper(zl, 'c', s2, 1));
-
-        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s2));
-        assert(compareHelper(zl, 'b', s1, 2));
-
-        assert(e[3].prevrawlensize == 5 && e[3].prevrawlen == strEntryBytesLarge(s1));
-        assert(compareHelper(zl, 'a', s1, 3));
-
-        ziplistRepr(zl);
-
-        /* Delete from mid. */
-        unsigned char *p = ziplistIndex(zl, 2);
-        zl = ziplistDelete(zl, &p);
-        verify(zl, e);
-
-        assert(e[0].prevrawlensize == 1 && e[0].prevrawlen == 0);
-        assert(compareHelper(zl, 'd', s2, 0));
-
-        assert(e[1].prevrawlensize == 5 && e[1].prevrawlen == strEntryBytesSmall(s2));
-        assert(compareHelper(zl, 'c', s2, 1));
-
-        assert(e[2].prevrawlensize == 5 && e[2].prevrawlen == strEntryBytesLarge(s2));
-        assert(compareHelper(zl, 'a', s1, 2));
-
-        ziplistRepr(zl);
-
-        zfree(zl);
-    }
-
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/ziplist.h b/redis-stable/src/ziplist.h
deleted file mode 100644
index 569e1259..00000000
--- a/redis-stable/src/ziplist.h
+++ /dev/null
@@ -1,74 +0,0 @@
-/*
- * Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
- * Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef _ZIPLIST_H
-#define _ZIPLIST_H
-
-#define ZIPLIST_HEAD 0
-#define ZIPLIST_TAIL 1
-
-/* Each entry in the ziplist is either a string or an integer. */
-typedef struct {
-    /* When string is used, it is provided with the length (slen). */
-    unsigned char *sval;
-    unsigned int slen;
-    /* When integer is used, 'sval' is NULL, and lval holds the value. */
-    long long lval;
-} ziplistEntry;
-
-unsigned char *ziplistNew(void);
-unsigned char *ziplistMerge(unsigned char **first, unsigned char **second);
-unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where);
-unsigned char *ziplistIndex(unsigned char *zl, int index);
-unsigned char *ziplistNext(unsigned char *zl, unsigned char *p);
-unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p);
-unsigned int ziplistGet(unsigned char *p, unsigned char **sval, unsigned int *slen, long long *lval);
-unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
-unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p);
-unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
-unsigned char *ziplistReplace(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
-unsigned int ziplistCompare(unsigned char *p, unsigned char *s, unsigned int slen);
-unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip);
-unsigned int ziplistLen(unsigned char *zl);
-size_t ziplistBlobLen(unsigned char *zl);
-void ziplistRepr(unsigned char *zl);
-typedef int (*ziplistValidateEntryCB)(unsigned char* p, void* userdata);
-int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
-                             ziplistValidateEntryCB entry_cb, void *cb_userdata);
-void ziplistRandomPair(unsigned char *zl, unsigned long total_count, ziplistEntry *key, ziplistEntry *val);
-void ziplistRandomPairs(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals);
-unsigned int ziplistRandomPairsUnique(unsigned char *zl, unsigned int count, ziplistEntry *keys, ziplistEntry *vals);
-int ziplistSafeToAdd(unsigned char* zl, size_t add);
-
-#ifdef REDIS_TEST
-int ziplistTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif /* _ZIPLIST_H */
diff --git a/redis-stable/src/zipmap.c b/redis-stable/src/zipmap.c
deleted file mode 100644
index 21a60884..00000000
--- a/redis-stable/src/zipmap.c
+++ /dev/null
@@ -1,542 +0,0 @@
-/* String -> String Map data structure optimized for size.
- * This file implements a data structure mapping strings to other strings
- * implementing an O(n) lookup data structure designed to be very memory
- * efficient.
- *
- * The Redis Hash type uses this data structure for hashes composed of a small
- * number of elements, to switch to a hash table once a given number of
- * elements is reached.
- *
- * Given that many times Redis Hashes are used to represent objects composed
- * of few fields, this is a very big win in terms of used memory.
- *
- * --------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-/* Memory layout of a zipmap, for the map "foo" => "bar", "hello" => "world":
- *
- * <zmlen><len>"foo"<len><free>"bar"<len>"hello"<len><free>"world"
- *
- * <zmlen> is 1 byte length that holds the current size of the zipmap.
- * When the zipmap length is greater than or equal to 254, this value
- * is not used and the zipmap needs to be traversed to find out the length.
- *
- * <len> is the length of the following string (key or value).
- * <len> lengths are encoded in a single value or in a 5 bytes value.
- * If the first byte value (as an unsigned 8 bit value) is between 0 and
- * 253, it's a single-byte length. If it is 254 then a four bytes unsigned
- * integer follows (in the host byte ordering). A value of 255 is used to
- * signal the end of the hash.
- *
- * <free> is the number of free unused bytes after the string, resulting
- * from modification of values associated to a key. For instance if "foo"
- * is set to "bar", and later "foo" will be set to "hi", it will have a
- * free byte to use if the value will enlarge again later, or even in
- * order to add a key/value pair if it fits.
- *
- * <free> is always an unsigned 8 bit number, because if after an
- * update operation there are more than a few free bytes, the zipmap will be
- * reallocated to make sure it is as small as possible.
- *
- * The most compact representation of the above two elements hash is actually:
- *
- * "\x02\x03foo\x03\x00bar\x05hello\x05\x00world\xff"
- *
- * Note that because keys and values are prefixed length "objects",
- * the lookup will take O(N) where N is the number of elements
- * in the zipmap and *not* the number of bytes needed to represent the zipmap.
- * This lowers the constant times considerably.
- */
-
-#include <stdio.h>
-#include <string.h>
-#include "zmalloc.h"
-#include "endianconv.h"
-
-#define ZIPMAP_BIGLEN 254
-#define ZIPMAP_END 255
-
-/* The following defines the max value for the <free> field described in the
- * comments above, that is, the max number of trailing bytes in a value. */
-#define ZIPMAP_VALUE_MAX_FREE 4
-
-/* The following macro returns the number of bytes needed to encode the length
- * for the integer value _l, that is, 1 byte for lengths < ZIPMAP_BIGLEN and
- * 5 bytes for all the other lengths. */
-#define ZIPMAP_LEN_BYTES(_l) (((_l) < ZIPMAP_BIGLEN) ? 1 : sizeof(unsigned int)+1)
-
-/* Create a new empty zipmap. */
-unsigned char *zipmapNew(void) {
-    unsigned char *zm = zmalloc(2);
-
-    zm[0] = 0; /* Length */
-    zm[1] = ZIPMAP_END;
-    return zm;
-}
-
-/* Decode the encoded length pointed by 'p' */
-static unsigned int zipmapDecodeLength(unsigned char *p) {
-    unsigned int len = *p;
-
-    if (len < ZIPMAP_BIGLEN) return len;
-    memcpy(&len,p+1,sizeof(unsigned int));
-    memrev32ifbe(&len);
-    return len;
-}
-
-static unsigned int zipmapGetEncodedLengthSize(unsigned char *p) {
-    return (*p < ZIPMAP_BIGLEN) ? 1: 5;
-}
-
-/* Encode the length 'l' writing it in 'p'. If p is NULL it just returns
- * the amount of bytes required to encode such a length. */
-static unsigned int zipmapEncodeLength(unsigned char *p, unsigned int len) {
-    if (p == NULL) {
-        return ZIPMAP_LEN_BYTES(len);
-    } else {
-        if (len < ZIPMAP_BIGLEN) {
-            p[0] = len;
-            return 1;
-        } else {
-            p[0] = ZIPMAP_BIGLEN;
-            memcpy(p+1,&len,sizeof(len));
-            memrev32ifbe(p+1);
-            return 1+sizeof(len);
-        }
-    }
-}
-
-/* Search for a matching key, returning a pointer to the entry inside the
- * zipmap. Returns NULL if the key is not found.
- *
- * If NULL is returned, and totlen is not NULL, it is set to the entire
- * size of the zipmap, so that the calling function will be able to
- * reallocate the original zipmap to make room for more entries. */
-static unsigned char *zipmapLookupRaw(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned int *totlen) {
-    unsigned char *p = zm+1, *k = NULL;
-    unsigned int l,llen;
-
-    while(*p != ZIPMAP_END) {
-        unsigned char free;
-
-        /* Match or skip the key */
-        l = zipmapDecodeLength(p);
-        llen = zipmapEncodeLength(NULL,l);
-        if (key != NULL && k == NULL && l == klen && !memcmp(p+llen,key,l)) {
-            /* Only return when the user doesn't care
-             * for the total length of the zipmap. */
-            if (totlen != NULL) {
-                k = p;
-            } else {
-                return p;
-            }
-        }
-        p += llen+l;
-        /* Skip the value as well */
-        l = zipmapDecodeLength(p);
-        p += zipmapEncodeLength(NULL,l);
-        free = p[0];
-        p += l+1+free; /* +1 to skip the free byte */
-    }
-    if (totlen != NULL) *totlen = (unsigned int)(p-zm)+1;
-    return k;
-}
-
-static unsigned long zipmapRequiredLength(unsigned int klen, unsigned int vlen) {
-    unsigned int l;
-
-    l = klen+vlen+3;
-    if (klen >= ZIPMAP_BIGLEN) l += 4;
-    if (vlen >= ZIPMAP_BIGLEN) l += 4;
-    return l;
-}
-
-/* Return the total amount used by a key (encoded length + payload) */
-static unsigned int zipmapRawKeyLength(unsigned char *p) {
-    unsigned int l = zipmapDecodeLength(p);
-    return zipmapEncodeLength(NULL,l) + l;
-}
-
-/* Return the total amount used by a value
- * (encoded length + single byte free count + payload) */
-static unsigned int zipmapRawValueLength(unsigned char *p) {
-    unsigned int l = zipmapDecodeLength(p);
-    unsigned int used;
-
-    used = zipmapEncodeLength(NULL,l);
-    used += p[used] + 1 + l;
-    return used;
-}
-
-/* If 'p' points to a key, this function returns the total amount of
- * bytes used to store this entry (entry = key + associated value + trailing
- * free space if any). */
-static unsigned int zipmapRawEntryLength(unsigned char *p) {
-    unsigned int l = zipmapRawKeyLength(p);
-    return l + zipmapRawValueLength(p+l);
-}
-
-static inline unsigned char *zipmapResize(unsigned char *zm, unsigned int len) {
-    zm = zrealloc(zm, len);
-    zm[len-1] = ZIPMAP_END;
-    return zm;
-}
-
-/* Set key to value, creating the key if it does not already exist.
- * If 'update' is not NULL, *update is set to 1 if the key was
- * already preset, otherwise to 0. */
-unsigned char *zipmapSet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char *val, unsigned int vlen, int *update) {
-    unsigned int zmlen, offset;
-    unsigned int freelen, reqlen = zipmapRequiredLength(klen,vlen);
-    unsigned int empty, vempty;
-    unsigned char *p;
-
-    freelen = reqlen;
-    if (update) *update = 0;
-    p = zipmapLookupRaw(zm,key,klen,&zmlen);
-    if (p == NULL) {
-        /* Key not found: enlarge */
-        zm = zipmapResize(zm, zmlen+reqlen);
-        p = zm+zmlen-1;
-        zmlen = zmlen+reqlen;
-
-        /* Increase zipmap length (this is an insert) */
-        if (zm[0] < ZIPMAP_BIGLEN) zm[0]++;
-    } else {
-        /* Key found. Is there enough space for the new value? */
-        /* Compute the total length: */
-        if (update) *update = 1;
-        freelen = zipmapRawEntryLength(p);
-        if (freelen < reqlen) {
-            /* Store the offset of this key within the current zipmap, so
-             * it can be resized. Then, move the tail backwards so this
-             * pair fits at the current position. */
-            offset = p-zm;
-            zm = zipmapResize(zm, zmlen-freelen+reqlen);
-            p = zm+offset;
-
-            /* The +1 in the number of bytes to be moved is caused by the
-             * end-of-zipmap byte. Note: the *original* zmlen is used. */
-            memmove(p+reqlen, p+freelen, zmlen-(offset+freelen+1));
-            zmlen = zmlen-freelen+reqlen;
-            freelen = reqlen;
-        }
-    }
-
-    /* We now have a suitable block where the key/value entry can
-     * be written. If there is too much free space, move the tail
-     * of the zipmap a few bytes to the front and shrink the zipmap,
-     * as we want zipmaps to be very space efficient. */
-    empty = freelen-reqlen;
-    if (empty >= ZIPMAP_VALUE_MAX_FREE) {
-        /* First, move the tail <empty> bytes to the front, then resize
-         * the zipmap to be <empty> bytes smaller. */
-        offset = p-zm;
-        memmove(p+reqlen, p+freelen, zmlen-(offset+freelen+1));
-        zmlen -= empty;
-        zm = zipmapResize(zm, zmlen);
-        p = zm+offset;
-        vempty = 0;
-    } else {
-        vempty = empty;
-    }
-
-    /* Just write the key + value and we are done. */
-    /* Key: */
-    p += zipmapEncodeLength(p,klen);
-    memcpy(p,key,klen);
-    p += klen;
-    /* Value: */
-    p += zipmapEncodeLength(p,vlen);
-    *p++ = vempty;
-    memcpy(p,val,vlen);
-    return zm;
-}
-
-/* Remove the specified key. If 'deleted' is not NULL the pointed integer is
- * set to 0 if the key was not found, to 1 if it was found and deleted. */
-unsigned char *zipmapDel(unsigned char *zm, unsigned char *key, unsigned int klen, int *deleted) {
-    unsigned int zmlen, freelen;
-    unsigned char *p = zipmapLookupRaw(zm,key,klen,&zmlen);
-    if (p) {
-        freelen = zipmapRawEntryLength(p);
-        memmove(p, p+freelen, zmlen-((p-zm)+freelen+1));
-        zm = zipmapResize(zm, zmlen-freelen);
-
-        /* Decrease zipmap length */
-        if (zm[0] < ZIPMAP_BIGLEN) zm[0]--;
-
-        if (deleted) *deleted = 1;
-    } else {
-        if (deleted) *deleted = 0;
-    }
-    return zm;
-}
-
-/* Call before iterating through elements via zipmapNext() */
-unsigned char *zipmapRewind(unsigned char *zm) {
-    return zm+1;
-}
-
-/* This function is used to iterate through all the zipmap elements.
- * In the first call the first argument is the pointer to the zipmap + 1.
- * In the next calls what zipmapNext returns is used as first argument.
- * Example:
- *
- * unsigned char *i = zipmapRewind(my_zipmap);
- * while((i = zipmapNext(i,&key,&klen,&value,&vlen)) != NULL) {
- *     printf("%d bytes key at $p\n", klen, key);
- *     printf("%d bytes value at $p\n", vlen, value);
- * }
- */
-unsigned char *zipmapNext(unsigned char *zm, unsigned char **key, unsigned int *klen, unsigned char **value, unsigned int *vlen) {
-    if (zm[0] == ZIPMAP_END) return NULL;
-    if (key) {
-        *key = zm;
-        *klen = zipmapDecodeLength(zm);
-        *key += ZIPMAP_LEN_BYTES(*klen);
-    }
-    zm += zipmapRawKeyLength(zm);
-    if (value) {
-        *value = zm+1;
-        *vlen = zipmapDecodeLength(zm);
-        *value += ZIPMAP_LEN_BYTES(*vlen);
-    }
-    zm += zipmapRawValueLength(zm);
-    return zm;
-}
-
-/* Search a key and retrieve the pointer and len of the associated value.
- * If the key is found the function returns 1, otherwise 0. */
-int zipmapGet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char **value, unsigned int *vlen) {
-    unsigned char *p;
-
-    if ((p = zipmapLookupRaw(zm,key,klen,NULL)) == NULL) return 0;
-    p += zipmapRawKeyLength(p);
-    *vlen = zipmapDecodeLength(p);
-    *value = p + ZIPMAP_LEN_BYTES(*vlen) + 1;
-    return 1;
-}
-
-/* Return 1 if the key exists, otherwise 0 is returned. */
-int zipmapExists(unsigned char *zm, unsigned char *key, unsigned int klen) {
-    return zipmapLookupRaw(zm,key,klen,NULL) != NULL;
-}
-
-/* Return the number of entries inside a zipmap */
-unsigned int zipmapLen(unsigned char *zm) {
-    unsigned int len = 0;
-    if (zm[0] < ZIPMAP_BIGLEN) {
-        len = zm[0];
-    } else {
-        unsigned char *p = zipmapRewind(zm);
-        while((p = zipmapNext(p,NULL,NULL,NULL,NULL)) != NULL) len++;
-
-        /* Re-store length if small enough */
-        if (len < ZIPMAP_BIGLEN) zm[0] = len;
-    }
-    return len;
-}
-
-/* Return the raw size in bytes of a zipmap, so that we can serialize
- * the zipmap on disk (or everywhere is needed) just writing the returned
- * amount of bytes of the C array starting at the zipmap pointer. */
-size_t zipmapBlobLen(unsigned char *zm) {
-    unsigned int totlen;
-    zipmapLookupRaw(zm,NULL,0,&totlen);
-    return totlen;
-}
-
-/* Validate the integrity of the data structure.
- * when `deep` is 0, only the integrity of the header is validated.
- * when `deep` is 1, we scan all the entries one by one. */
-int zipmapValidateIntegrity(unsigned char *zm, size_t size, int deep) {
-#define OUT_OF_RANGE(p) ( \
-        (p) < zm + 2 || \
-        (p) > zm + size - 1)
-    unsigned int l, s, e;
-
-    /* check that we can actually read the header (or ZIPMAP_END). */
-    if (size < 2)
-        return 0;
-
-    /* the last byte must be the terminator. */
-    if (zm[size-1] != ZIPMAP_END)
-        return 0;
-
-    if (!deep)
-        return 1;
-
-    unsigned int count = 0;
-    unsigned char *p = zm + 1; /* skip the count */
-    while(*p != ZIPMAP_END) {
-        /* read the field name length encoding type */
-        s = zipmapGetEncodedLengthSize(p);
-        /* make sure the entry length doesn't rech outside the edge of the zipmap */
-        if (OUT_OF_RANGE(p+s))
-            return 0;
-
-        /* read the field name length */
-        l = zipmapDecodeLength(p);
-        p += s; /* skip the encoded field size */
-        p += l; /* skip the field */
-
-        /* make sure the entry doesn't rech outside the edge of the zipmap */
-        if (OUT_OF_RANGE(p))
-            return 0;
-
-        /* read the value length encoding type */
-        s = zipmapGetEncodedLengthSize(p);
-        /* make sure the entry length doesn't rech outside the edge of the zipmap */
-        if (OUT_OF_RANGE(p+s))
-            return 0;
-
-        /* read the value length */
-        l = zipmapDecodeLength(p);
-        p += s; /* skip the encoded value size*/
-        e = *p++; /* skip the encoded free space (always encoded in one byte) */
-        p += l+e; /* skip the value and free space */
-        count++;
-
-        /* make sure the entry doesn't rech outside the edge of the zipmap */
-        if (OUT_OF_RANGE(p))
-            return 0;
-    }
-
-    /* check that the zipmap is not empty. */
-    if (count == 0) return 0;
-
-    /* check that the count in the header is correct */
-    if (zm[0] != ZIPMAP_BIGLEN && zm[0] != count)
-        return 0;
-
-    return 1;
-#undef OUT_OF_RANGE
-}
-
-#ifdef REDIS_TEST
-static void zipmapRepr(unsigned char *p) {
-    unsigned int l;
-
-    printf("{status %u}",*p++);
-    while(1) {
-        if (p[0] == ZIPMAP_END) {
-            printf("{end}");
-            break;
-        } else {
-            unsigned char e;
-
-            l = zipmapDecodeLength(p);
-            printf("{key %u}",l);
-            p += zipmapEncodeLength(NULL,l);
-            if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");
-            p += l;
-
-            l = zipmapDecodeLength(p);
-            printf("{value %u}",l);
-            p += zipmapEncodeLength(NULL,l);
-            e = *p++;
-            if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");
-            p += l+e;
-            if (e) {
-                printf("[");
-                while(e--) printf(".");
-                printf("]");
-            }
-        }
-    }
-    printf("\n");
-}
-
-#define UNUSED(x) (void)(x)
-int zipmapTest(int argc, char *argv[], int accurate) {
-    unsigned char *zm;
-
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-
-    zm = zipmapNew();
-
-    zm = zipmapSet(zm,(unsigned char*) "name",4, (unsigned char*) "foo",3,NULL);
-    zm = zipmapSet(zm,(unsigned char*) "surname",7, (unsigned char*) "foo",3,NULL);
-    zm = zipmapSet(zm,(unsigned char*) "age",3, (unsigned char*) "foo",3,NULL);
-    zipmapRepr(zm);
-
-    zm = zipmapSet(zm,(unsigned char*) "hello",5, (unsigned char*) "world!",6,NULL);
-    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "bar",3,NULL);
-    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "!",1,NULL);
-    zipmapRepr(zm);
-    zm = zipmapSet(zm,(unsigned char*) "foo",3, (unsigned char*) "12345",5,NULL);
-    zipmapRepr(zm);
-    zm = zipmapSet(zm,(unsigned char*) "new",3, (unsigned char*) "xx",2,NULL);
-    zm = zipmapSet(zm,(unsigned char*) "noval",5, (unsigned char*) "",0,NULL);
-    zipmapRepr(zm);
-    zm = zipmapDel(zm,(unsigned char*) "new",3,NULL);
-    zipmapRepr(zm);
-
-    printf("\nLook up large key:\n");
-    {
-        unsigned char buf[512];
-        unsigned char *value;
-        unsigned int vlen, i;
-        for (i = 0; i < 512; i++) buf[i] = 'a';
-
-        zm = zipmapSet(zm,buf,512,(unsigned char*) "long",4,NULL);
-        if (zipmapGet(zm,buf,512,&value,&vlen)) {
-            printf("  <long key> is associated to the %d bytes value: %.*s\n",
-                vlen, vlen, value);
-        }
-    }
-
-    printf("\nPerform a direct lookup:\n");
-    {
-        unsigned char *value;
-        unsigned int vlen;
-
-        if (zipmapGet(zm,(unsigned char*) "foo",3,&value,&vlen)) {
-            printf("  foo is associated to the %d bytes value: %.*s\n",
-                vlen, vlen, value);
-        }
-    }
-    printf("\nIterate through elements:\n");
-    {
-        unsigned char *i = zipmapRewind(zm);
-        unsigned char *key, *value;
-        unsigned int klen, vlen;
-
-        while((i = zipmapNext(i,&key,&klen,&value,&vlen)) != NULL) {
-            printf("  %d:%.*s => %d:%.*s\n", klen, klen, key, vlen, vlen, value);
-        }
-    }
-    zfree(zm);
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/zipmap.h b/redis-stable/src/zipmap.h
deleted file mode 100644
index 1b34a32a..00000000
--- a/redis-stable/src/zipmap.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/* String -> String Map data structure optimized for size.
- *
- * See zipmap.c for more info.
- *
- * --------------------------------------------------------------------------
- *
- * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef _ZIPMAP_H
-#define _ZIPMAP_H
-
-unsigned char *zipmapNew(void);
-unsigned char *zipmapSet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char *val, unsigned int vlen, int *update);
-unsigned char *zipmapDel(unsigned char *zm, unsigned char *key, unsigned int klen, int *deleted);
-unsigned char *zipmapRewind(unsigned char *zm);
-unsigned char *zipmapNext(unsigned char *zm, unsigned char **key, unsigned int *klen, unsigned char **value, unsigned int *vlen);
-int zipmapGet(unsigned char *zm, unsigned char *key, unsigned int klen, unsigned char **value, unsigned int *vlen);
-int zipmapExists(unsigned char *zm, unsigned char *key, unsigned int klen);
-unsigned int zipmapLen(unsigned char *zm);
-size_t zipmapBlobLen(unsigned char *zm);
-void zipmapRepr(unsigned char *p);
-int zipmapValidateIntegrity(unsigned char *zm, size_t size, int deep);
-
-#ifdef REDIS_TEST
-int zipmapTest(int argc, char *argv[], int accurate);
-#endif
-
-#endif
diff --git a/redis-stable/src/zmalloc.c b/redis-stable/src/zmalloc.c
deleted file mode 100644
index 3645efcf..00000000
--- a/redis-stable/src/zmalloc.c
+++ /dev/null
@@ -1,699 +0,0 @@
-/* zmalloc - total amount of allocated memory aware version of malloc()
- *
- * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <unistd.h>
-#include <assert.h>
-
-/* This function provide us access to the original libc free(). This is useful
- * for instance to free results obtained by backtrace_symbols(). We need
- * to define this function before including zmalloc.h that may shadow the
- * free implementation if we use jemalloc or another non standard allocator. */
-void zlibc_free(void *ptr) {
-    free(ptr);
-}
-
-#include <string.h>
-#include <pthread.h>
-#include "config.h"
-#include "zmalloc.h"
-#include "atomicvar.h"
-
-#ifdef HAVE_MALLOC_SIZE
-#define PREFIX_SIZE (0)
-#define ASSERT_NO_SIZE_OVERFLOW(sz)
-#else
-#if defined(__sun) || defined(__sparc) || defined(__sparc__)
-#define PREFIX_SIZE (sizeof(long long))
-#else
-#define PREFIX_SIZE (sizeof(size_t))
-#endif
-#define ASSERT_NO_SIZE_OVERFLOW(sz) assert((sz) + PREFIX_SIZE > (sz))
-#endif
-
-/* When using the libc allocator, use a minimum allocation size to match the
- * jemalloc behavior that doesn't return NULL in this case.
- */
-#define MALLOC_MIN_SIZE(x) ((x) > 0 ? (x) : sizeof(long))
-
-/* Explicitly override malloc/free etc when using tcmalloc. */
-#if defined(USE_TCMALLOC)
-#define malloc(size) tc_malloc(size)
-#define calloc(count,size) tc_calloc(count,size)
-#define realloc(ptr,size) tc_realloc(ptr,size)
-#define free(ptr) tc_free(ptr)
-#elif defined(USE_JEMALLOC)
-#define malloc(size) je_malloc(size)
-#define calloc(count,size) je_calloc(count,size)
-#define realloc(ptr,size) je_realloc(ptr,size)
-#define free(ptr) je_free(ptr)
-#define mallocx(size,flags) je_mallocx(size,flags)
-#define dallocx(ptr,flags) je_dallocx(ptr,flags)
-#endif
-
-#define update_zmalloc_stat_alloc(__n) atomicIncr(used_memory,(__n))
-#define update_zmalloc_stat_free(__n) atomicDecr(used_memory,(__n))
-
-static redisAtomic size_t used_memory = 0;
-
-static void zmalloc_default_oom(size_t size) {
-    fprintf(stderr, "zmalloc: Out of memory trying to allocate %zu bytes\n",
-        size);
-    fflush(stderr);
-    abort();
-}
-
-static void (*zmalloc_oom_handler)(size_t) = zmalloc_default_oom;
-
-/* Try allocating memory, and return NULL if failed.
- * '*usable' is set to the usable size if non NULL. */
-void *ztrymalloc_usable(size_t size, size_t *usable) {
-    ASSERT_NO_SIZE_OVERFLOW(size);
-    void *ptr = malloc(MALLOC_MIN_SIZE(size)+PREFIX_SIZE);
-
-    if (!ptr) return NULL;
-#ifdef HAVE_MALLOC_SIZE
-    size = zmalloc_size(ptr);
-    update_zmalloc_stat_alloc(size);
-    if (usable) *usable = size;
-    return ptr;
-#else
-    *((size_t*)ptr) = size;
-    update_zmalloc_stat_alloc(size+PREFIX_SIZE);
-    if (usable) *usable = size;
-    return (char*)ptr+PREFIX_SIZE;
-#endif
-}
-
-/* Allocate memory or panic */
-void *zmalloc(size_t size) {
-    void *ptr = ztrymalloc_usable(size, NULL);
-    if (!ptr) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Try allocating memory, and return NULL if failed. */
-void *ztrymalloc(size_t size) {
-    void *ptr = ztrymalloc_usable(size, NULL);
-    return ptr;
-}
-
-/* Allocate memory or panic.
- * '*usable' is set to the usable size if non NULL. */
-void *zmalloc_usable(size_t size, size_t *usable) {
-    void *ptr = ztrymalloc_usable(size, usable);
-    if (!ptr) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Allocation and free functions that bypass the thread cache
- * and go straight to the allocator arena bins.
- * Currently implemented only for jemalloc. Used for online defragmentation. */
-#ifdef HAVE_DEFRAG
-void *zmalloc_no_tcache(size_t size) {
-    ASSERT_NO_SIZE_OVERFLOW(size);
-    void *ptr = mallocx(size+PREFIX_SIZE, MALLOCX_TCACHE_NONE);
-    if (!ptr) zmalloc_oom_handler(size);
-    update_zmalloc_stat_alloc(zmalloc_size(ptr));
-    return ptr;
-}
-
-void zfree_no_tcache(void *ptr) {
-    if (ptr == NULL) return;
-    update_zmalloc_stat_free(zmalloc_size(ptr));
-    dallocx(ptr, MALLOCX_TCACHE_NONE);
-}
-#endif
-
-/* Try allocating memory and zero it, and return NULL if failed.
- * '*usable' is set to the usable size if non NULL. */
-void *ztrycalloc_usable(size_t size, size_t *usable) {
-    ASSERT_NO_SIZE_OVERFLOW(size);
-    void *ptr = calloc(1, MALLOC_MIN_SIZE(size)+PREFIX_SIZE);
-    if (ptr == NULL) return NULL;
-
-#ifdef HAVE_MALLOC_SIZE
-    size = zmalloc_size(ptr);
-    update_zmalloc_stat_alloc(size);
-    if (usable) *usable = size;
-    return ptr;
-#else
-    *((size_t*)ptr) = size;
-    update_zmalloc_stat_alloc(size+PREFIX_SIZE);
-    if (usable) *usable = size;
-    return (char*)ptr+PREFIX_SIZE;
-#endif
-}
-
-/* Allocate memory and zero it or panic */
-void *zcalloc(size_t size) {
-    void *ptr = ztrycalloc_usable(size, NULL);
-    if (!ptr) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Try allocating memory, and return NULL if failed. */
-void *ztrycalloc(size_t size) {
-    void *ptr = ztrycalloc_usable(size, NULL);
-    return ptr;
-}
-
-/* Allocate memory or panic.
- * '*usable' is set to the usable size if non NULL. */
-void *zcalloc_usable(size_t size, size_t *usable) {
-    void *ptr = ztrycalloc_usable(size, usable);
-    if (!ptr) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Try reallocating memory, and return NULL if failed.
- * '*usable' is set to the usable size if non NULL. */
-void *ztryrealloc_usable(void *ptr, size_t size, size_t *usable) {
-    ASSERT_NO_SIZE_OVERFLOW(size);
-#ifndef HAVE_MALLOC_SIZE
-    void *realptr;
-#endif
-    size_t oldsize;
-    void *newptr;
-
-    /* not allocating anything, just redirect to free. */
-    if (size == 0 && ptr != NULL) {
-        zfree(ptr);
-        if (usable) *usable = 0;
-        return NULL;
-    }
-    /* Not freeing anything, just redirect to malloc. */
-    if (ptr == NULL)
-        return ztrymalloc_usable(size, usable);
-
-#ifdef HAVE_MALLOC_SIZE
-    oldsize = zmalloc_size(ptr);
-    newptr = realloc(ptr,size);
-    if (newptr == NULL) {
-        if (usable) *usable = 0;
-        return NULL;
-    }
-
-    update_zmalloc_stat_free(oldsize);
-    size = zmalloc_size(newptr);
-    update_zmalloc_stat_alloc(size);
-    if (usable) *usable = size;
-    return newptr;
-#else
-    realptr = (char*)ptr-PREFIX_SIZE;
-    oldsize = *((size_t*)realptr);
-    newptr = realloc(realptr,size+PREFIX_SIZE);
-    if (newptr == NULL) {
-        if (usable) *usable = 0;
-        return NULL;
-    }
-
-    *((size_t*)newptr) = size;
-    update_zmalloc_stat_free(oldsize);
-    update_zmalloc_stat_alloc(size);
-    if (usable) *usable = size;
-    return (char*)newptr+PREFIX_SIZE;
-#endif
-}
-
-/* Reallocate memory and zero it or panic */
-void *zrealloc(void *ptr, size_t size) {
-    ptr = ztryrealloc_usable(ptr, size, NULL);
-    if (!ptr && size != 0) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Try Reallocating memory, and return NULL if failed. */
-void *ztryrealloc(void *ptr, size_t size) {
-    ptr = ztryrealloc_usable(ptr, size, NULL);
-    return ptr;
-}
-
-/* Reallocate memory or panic.
- * '*usable' is set to the usable size if non NULL. */
-void *zrealloc_usable(void *ptr, size_t size, size_t *usable) {
-    ptr = ztryrealloc_usable(ptr, size, usable);
-    if (!ptr && size != 0) zmalloc_oom_handler(size);
-    return ptr;
-}
-
-/* Provide zmalloc_size() for systems where this function is not provided by
- * malloc itself, given that in that case we store a header with this
- * information as the first bytes of every allocation. */
-#ifndef HAVE_MALLOC_SIZE
-size_t zmalloc_size(void *ptr) {
-    void *realptr = (char*)ptr-PREFIX_SIZE;
-    size_t size = *((size_t*)realptr);
-    return size+PREFIX_SIZE;
-}
-size_t zmalloc_usable_size(void *ptr) {
-    return zmalloc_size(ptr)-PREFIX_SIZE;
-}
-#endif
-
-void zfree(void *ptr) {
-#ifndef HAVE_MALLOC_SIZE
-    void *realptr;
-    size_t oldsize;
-#endif
-
-    if (ptr == NULL) return;
-#ifdef HAVE_MALLOC_SIZE
-    update_zmalloc_stat_free(zmalloc_size(ptr));
-    free(ptr);
-#else
-    realptr = (char*)ptr-PREFIX_SIZE;
-    oldsize = *((size_t*)realptr);
-    update_zmalloc_stat_free(oldsize+PREFIX_SIZE);
-    free(realptr);
-#endif
-}
-
-/* Similar to zfree, '*usable' is set to the usable size being freed. */
-void zfree_usable(void *ptr, size_t *usable) {
-#ifndef HAVE_MALLOC_SIZE
-    void *realptr;
-    size_t oldsize;
-#endif
-
-    if (ptr == NULL) return;
-#ifdef HAVE_MALLOC_SIZE
-    update_zmalloc_stat_free(*usable = zmalloc_size(ptr));
-    free(ptr);
-#else
-    realptr = (char*)ptr-PREFIX_SIZE;
-    *usable = oldsize = *((size_t*)realptr);
-    update_zmalloc_stat_free(oldsize+PREFIX_SIZE);
-    free(realptr);
-#endif
-}
-
-char *zstrdup(const char *s) {
-    size_t l = strlen(s)+1;
-    char *p = zmalloc(l);
-
-    memcpy(p,s,l);
-    return p;
-}
-
-size_t zmalloc_used_memory(void) {
-    size_t um;
-    atomicGet(used_memory,um);
-    return um;
-}
-
-void zmalloc_set_oom_handler(void (*oom_handler)(size_t)) {
-    zmalloc_oom_handler = oom_handler;
-}
-
-/* Get the RSS information in an OS-specific way.
- *
- * WARNING: the function zmalloc_get_rss() is not designed to be fast
- * and may not be called in the busy loops where Redis tries to release
- * memory expiring or swapping out objects.
- *
- * For this kind of "fast RSS reporting" usages use instead the
- * function RedisEstimateRSS() that is a much faster (and less precise)
- * version of the function. */
-
-#if defined(HAVE_PROC_STAT)
-#include <sys/types.h>
-#include <sys/stat.h>
-#include <fcntl.h>
-
-size_t zmalloc_get_rss(void) {
-    int page = sysconf(_SC_PAGESIZE);
-    size_t rss;
-    char buf[4096];
-    char filename[256];
-    int fd, count;
-    char *p, *x;
-
-    snprintf(filename,256,"/proc/%ld/stat",(long) getpid());
-    if ((fd = open(filename,O_RDONLY)) == -1) return 0;
-    if (read(fd,buf,4096) <= 0) {
-        close(fd);
-        return 0;
-    }
-    close(fd);
-
-    p = buf;
-    count = 23; /* RSS is the 24th field in /proc/<pid>/stat */
-    while(p && count--) {
-        p = strchr(p,' ');
-        if (p) p++;
-    }
-    if (!p) return 0;
-    x = strchr(p,' ');
-    if (!x) return 0;
-    *x = '\0';
-
-    rss = strtoll(p,NULL,10);
-    rss *= page;
-    return rss;
-}
-#elif defined(HAVE_TASKINFO)
-#include <sys/types.h>
-#include <sys/sysctl.h>
-#include <mach/task.h>
-#include <mach/mach_init.h>
-
-size_t zmalloc_get_rss(void) {
-    task_t task = MACH_PORT_NULL;
-    struct task_basic_info t_info;
-    mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
-
-    if (task_for_pid(current_task(), getpid(), &task) != KERN_SUCCESS)
-        return 0;
-    task_info(task, TASK_BASIC_INFO, (task_info_t)&t_info, &t_info_count);
-
-    return t_info.resident_size;
-}
-#elif defined(__FreeBSD__) || defined(__DragonFly__)
-#include <sys/types.h>
-#include <sys/sysctl.h>
-#include <sys/user.h>
-
-size_t zmalloc_get_rss(void) {
-    struct kinfo_proc info;
-    size_t infolen = sizeof(info);
-    int mib[4];
-    mib[0] = CTL_KERN;
-    mib[1] = KERN_PROC;
-    mib[2] = KERN_PROC_PID;
-    mib[3] = getpid();
-
-    if (sysctl(mib, 4, &info, &infolen, NULL, 0) == 0)
-#if defined(__FreeBSD__)
-        return (size_t)info.ki_rssize * getpagesize();
-#else
-        return (size_t)info.kp_vm_rssize * getpagesize();
-#endif
-
-    return 0L;
-}
-#elif defined(__NetBSD__)
-#include <sys/types.h>
-#include <sys/sysctl.h>
-
-size_t zmalloc_get_rss(void) {
-    struct kinfo_proc2 info;
-    size_t infolen = sizeof(info);
-    int mib[6];
-    mib[0] = CTL_KERN;
-    mib[1] = KERN_PROC;
-    mib[2] = KERN_PROC_PID;
-    mib[3] = getpid();
-    mib[4] = sizeof(info);
-    mib[5] = 1;
-    if (sysctl(mib, 4, &info, &infolen, NULL, 0) == 0)
-        return (size_t)info.p_vm_rssize * getpagesize();
-
-    return 0L;
-}
-#elif defined(HAVE_PSINFO)
-#include <unistd.h>
-#include <sys/procfs.h>
-#include <fcntl.h>
-
-size_t zmalloc_get_rss(void) {
-    struct prpsinfo info;
-    char filename[256];
-    int fd;
-
-    snprintf(filename,256,"/proc/%ld/psinfo",(long) getpid());
-
-    if ((fd = open(filename,O_RDONLY)) == -1) return 0;
-    if (ioctl(fd, PIOCPSINFO, &info) == -1) {
-        close(fd);
-	return 0;
-    }
-
-    close(fd);
-    return info.pr_rssize;
-}
-#else
-size_t zmalloc_get_rss(void) {
-    /* If we can't get the RSS in an OS-specific way for this system just
-     * return the memory usage we estimated in zmalloc()..
-     *
-     * Fragmentation will appear to be always 1 (no fragmentation)
-     * of course... */
-    return zmalloc_used_memory();
-}
-#endif
-
-#if defined(USE_JEMALLOC)
-
-int zmalloc_get_allocator_info(size_t *allocated,
-                               size_t *active,
-                               size_t *resident) {
-    uint64_t epoch = 1;
-    size_t sz;
-    *allocated = *resident = *active = 0;
-    /* Update the statistics cached by mallctl. */
-    sz = sizeof(epoch);
-    je_mallctl("epoch", &epoch, &sz, &epoch, sz);
-    sz = sizeof(size_t);
-    /* Unlike RSS, this does not include RSS from shared libraries and other non
-     * heap mappings. */
-    je_mallctl("stats.resident", resident, &sz, NULL, 0);
-    /* Unlike resident, this doesn't not include the pages jemalloc reserves
-     * for re-use (purge will clean that). */
-    je_mallctl("stats.active", active, &sz, NULL, 0);
-    /* Unlike zmalloc_used_memory, this matches the stats.resident by taking
-     * into account all allocations done by this process (not only zmalloc). */
-    je_mallctl("stats.allocated", allocated, &sz, NULL, 0);
-    return 1;
-}
-
-void set_jemalloc_bg_thread(int enable) {
-    /* let jemalloc do purging asynchronously, required when there's no traffic 
-     * after flushdb */
-    char val = !!enable;
-    je_mallctl("background_thread", NULL, 0, &val, 1);
-}
-
-int jemalloc_purge() {
-    /* return all unused (reserved) pages to the OS */
-    char tmp[32];
-    unsigned narenas = 0;
-    size_t sz = sizeof(unsigned);
-    if (!je_mallctl("arenas.narenas", &narenas, &sz, NULL, 0)) {
-        sprintf(tmp, "arena.%d.purge", narenas);
-        if (!je_mallctl(tmp, NULL, 0, NULL, 0))
-            return 0;
-    }
-    return -1;
-}
-
-#else
-
-int zmalloc_get_allocator_info(size_t *allocated,
-                               size_t *active,
-                               size_t *resident) {
-    *allocated = *resident = *active = 0;
-    return 1;
-}
-
-void set_jemalloc_bg_thread(int enable) {
-    ((void)(enable));
-}
-
-int jemalloc_purge() {
-    return 0;
-}
-
-#endif
-
-#if defined(__APPLE__)
-/* For proc_pidinfo() used later in zmalloc_get_smap_bytes_by_field().
- * Note that this file cannot be included in zmalloc.h because it includes
- * a Darwin queue.h file where there is a "LIST_HEAD" macro (!) defined
- * conficting with Redis user code. */
-#include <libproc.h>
-#endif
-
-/* Get the sum of the specified field (converted form kb to bytes) in
- * /proc/self/smaps. The field must be specified with trailing ":" as it
- * apperas in the smaps output.
- *
- * If a pid is specified, the information is extracted for such a pid,
- * otherwise if pid is -1 the information is reported is about the
- * current process.
- *
- * Example: zmalloc_get_smap_bytes_by_field("Rss:",-1);
- */
-#if defined(HAVE_PROC_SMAPS)
-size_t zmalloc_get_smap_bytes_by_field(char *field, long pid) {
-    char line[1024];
-    size_t bytes = 0;
-    int flen = strlen(field);
-    FILE *fp;
-
-    if (pid == -1) {
-        fp = fopen("/proc/self/smaps","r");
-    } else {
-        char filename[128];
-        snprintf(filename,sizeof(filename),"/proc/%ld/smaps",pid);
-        fp = fopen(filename,"r");
-    }
-
-    if (!fp) return 0;
-    while(fgets(line,sizeof(line),fp) != NULL) {
-        if (strncmp(line,field,flen) == 0) {
-            char *p = strchr(line,'k');
-            if (p) {
-                *p = '\0';
-                bytes += strtol(line+flen,NULL,10) * 1024;
-            }
-        }
-    }
-    fclose(fp);
-    return bytes;
-}
-#else
-/* Get sum of the specified field from libproc api call.
- * As there are per page value basis we need to convert
- * them accordingly.
- *
- * Note that AnonHugePages is a no-op as THP feature
- * is not supported in this platform
- */
-size_t zmalloc_get_smap_bytes_by_field(char *field, long pid) {
-#if defined(__APPLE__)
-    struct proc_regioninfo pri;
-    if (pid == -1) pid = getpid();
-    if (proc_pidinfo(pid, PROC_PIDREGIONINFO, 0, &pri,
-                     PROC_PIDREGIONINFO_SIZE) == PROC_PIDREGIONINFO_SIZE)
-    {
-        int pagesize = getpagesize();
-        if (!strcmp(field, "Private_Dirty:")) {
-            return (size_t)pri.pri_pages_dirtied * pagesize;
-        } else if (!strcmp(field, "Rss:")) {
-            return (size_t)pri.pri_pages_resident * pagesize;
-        } else if (!strcmp(field, "AnonHugePages:")) {
-            return 0;
-        }
-    }
-    return 0;
-#endif
-    ((void) field);
-    ((void) pid);
-    return 0;
-}
-#endif
-
-/* Return the total number bytes in pages marked as Private Dirty.
- *
- * Note: depending on the platform and memory footprint of the process, this
- * call can be slow, exceeding 1000ms!
- */
-size_t zmalloc_get_private_dirty(long pid) {
-    return zmalloc_get_smap_bytes_by_field("Private_Dirty:",pid);
-}
-
-/* Returns the size of physical memory (RAM) in bytes.
- * It looks ugly, but this is the cleanest way to achieve cross platform results.
- * Cleaned up from:
- *
- * http://nadeausoftware.com/articles/2012/09/c_c_tip_how_get_physical_memory_size_system
- *
- * Note that this function:
- * 1) Was released under the following CC attribution license:
- *    http://creativecommons.org/licenses/by/3.0/deed.en_US.
- * 2) Was originally implemented by David Robert Nadeau.
- * 3) Was modified for Redis by Matt Stancliff.
- * 4) This note exists in order to comply with the original license.
- */
-size_t zmalloc_get_memory_size(void) {
-#if defined(__unix__) || defined(__unix) || defined(unix) || \
-    (defined(__APPLE__) && defined(__MACH__))
-#if defined(CTL_HW) && (defined(HW_MEMSIZE) || defined(HW_PHYSMEM64))
-    int mib[2];
-    mib[0] = CTL_HW;
-#if defined(HW_MEMSIZE)
-    mib[1] = HW_MEMSIZE;            /* OSX. --------------------- */
-#elif defined(HW_PHYSMEM64)
-    mib[1] = HW_PHYSMEM64;          /* NetBSD, OpenBSD. --------- */
-#endif
-    int64_t size = 0;               /* 64-bit */
-    size_t len = sizeof(size);
-    if (sysctl( mib, 2, &size, &len, NULL, 0) == 0)
-        return (size_t)size;
-    return 0L;          /* Failed? */
-
-#elif defined(_SC_PHYS_PAGES) && defined(_SC_PAGESIZE)
-    /* FreeBSD, Linux, OpenBSD, and Solaris. -------------------- */
-    return (size_t)sysconf(_SC_PHYS_PAGES) * (size_t)sysconf(_SC_PAGESIZE);
-
-#elif defined(CTL_HW) && (defined(HW_PHYSMEM) || defined(HW_REALMEM))
-    /* DragonFly BSD, FreeBSD, NetBSD, OpenBSD, and OSX. -------- */
-    int mib[2];
-    mib[0] = CTL_HW;
-#if defined(HW_REALMEM)
-    mib[1] = HW_REALMEM;        /* FreeBSD. ----------------- */
-#elif defined(HW_PHYSMEM)
-    mib[1] = HW_PHYSMEM;        /* Others. ------------------ */
-#endif
-    unsigned int size = 0;      /* 32-bit */
-    size_t len = sizeof(size);
-    if (sysctl(mib, 2, &size, &len, NULL, 0) == 0)
-        return (size_t)size;
-    return 0L;          /* Failed? */
-#else
-    return 0L;          /* Unknown method to get the data. */
-#endif
-#else
-    return 0L;          /* Unknown OS. */
-#endif
-}
-
-#ifdef REDIS_TEST
-#define UNUSED(x) ((void)(x))
-int zmalloc_test(int argc, char **argv, int accurate) {
-    void *ptr;
-
-    UNUSED(argc);
-    UNUSED(argv);
-    UNUSED(accurate);
-    printf("Malloc prefix size: %d\n", (int) PREFIX_SIZE);
-    printf("Initial used memory: %zu\n", zmalloc_used_memory());
-    ptr = zmalloc(123);
-    printf("Allocated 123 bytes; used: %zu\n", zmalloc_used_memory());
-    ptr = zrealloc(ptr, 456);
-    printf("Reallocated to 456 bytes; used: %zu\n", zmalloc_used_memory());
-    zfree(ptr);
-    printf("Freed pointer; used: %zu\n", zmalloc_used_memory());
-    return 0;
-}
-#endif
diff --git a/redis-stable/src/zmalloc.h b/redis-stable/src/zmalloc.h
deleted file mode 100644
index bb4cbddb..00000000
--- a/redis-stable/src/zmalloc.h
+++ /dev/null
@@ -1,141 +0,0 @@
-/* zmalloc - total amount of allocated memory aware version of malloc()
- *
- * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#ifndef __ZMALLOC_H
-#define __ZMALLOC_H
-
-/* Double expansion needed for stringification of macro values. */
-#define __xstr(s) __str(s)
-#define __str(s) #s
-
-#if defined(USE_TCMALLOC)
-#define ZMALLOC_LIB ("tcmalloc-" __xstr(TC_VERSION_MAJOR) "." __xstr(TC_VERSION_MINOR))
-#include <google/tcmalloc.h>
-#if (TC_VERSION_MAJOR == 1 && TC_VERSION_MINOR >= 6) || (TC_VERSION_MAJOR > 1)
-#define HAVE_MALLOC_SIZE 1
-#define zmalloc_size(p) tc_malloc_size(p)
-#else
-#error "Newer version of tcmalloc required"
-#endif
-
-#elif defined(USE_JEMALLOC)
-#define ZMALLOC_LIB ("jemalloc-" __xstr(JEMALLOC_VERSION_MAJOR) "." __xstr(JEMALLOC_VERSION_MINOR) "." __xstr(JEMALLOC_VERSION_BUGFIX))
-#include <jemalloc/jemalloc.h>
-#if (JEMALLOC_VERSION_MAJOR == 2 && JEMALLOC_VERSION_MINOR >= 1) || (JEMALLOC_VERSION_MAJOR > 2)
-#define HAVE_MALLOC_SIZE 1
-#define zmalloc_size(p) je_malloc_usable_size(p)
-#else
-#error "Newer version of jemalloc required"
-#endif
-
-#elif defined(__APPLE__)
-#include <malloc/malloc.h>
-#define HAVE_MALLOC_SIZE 1
-#define zmalloc_size(p) malloc_size(p)
-#endif
-
-/* On native libc implementations, we should still do our best to provide a
- * HAVE_MALLOC_SIZE capability. This can be set explicitly as well:
- *
- * NO_MALLOC_USABLE_SIZE disables it on all platforms, even if they are
- *      known to support it.
- * USE_MALLOC_USABLE_SIZE forces use of malloc_usable_size() regardless
- *      of platform.
- */
-#ifndef ZMALLOC_LIB
-#define ZMALLOC_LIB "libc"
-
-#if !defined(NO_MALLOC_USABLE_SIZE) && \
-    (defined(__GLIBC__) || defined(__FreeBSD__) || \
-     defined(USE_MALLOC_USABLE_SIZE))
-
-/* Includes for malloc_usable_size() */
-#ifdef __FreeBSD__
-#include <malloc_np.h>
-#else
-#include <malloc.h>
-#endif
-
-#define HAVE_MALLOC_SIZE 1
-#define zmalloc_size(p) malloc_usable_size(p)
-
-#endif
-#endif
-
-/* We can enable the Redis defrag capabilities only if we are using Jemalloc
- * and the version used is our special version modified for Redis having
- * the ability to return per-allocation fragmentation hints. */
-#if defined(USE_JEMALLOC) && defined(JEMALLOC_FRAG_HINT)
-#define HAVE_DEFRAG
-#endif
-
-void *zmalloc(size_t size);
-void *zcalloc(size_t size);
-void *zrealloc(void *ptr, size_t size);
-void *ztrymalloc(size_t size);
-void *ztrycalloc(size_t size);
-void *ztryrealloc(void *ptr, size_t size);
-void zfree(void *ptr);
-void *zmalloc_usable(size_t size, size_t *usable);
-void *zcalloc_usable(size_t size, size_t *usable);
-void *zrealloc_usable(void *ptr, size_t size, size_t *usable);
-void *ztrymalloc_usable(size_t size, size_t *usable);
-void *ztrycalloc_usable(size_t size, size_t *usable);
-void *ztryrealloc_usable(void *ptr, size_t size, size_t *usable);
-void zfree_usable(void *ptr, size_t *usable);
-char *zstrdup(const char *s);
-size_t zmalloc_used_memory(void);
-void zmalloc_set_oom_handler(void (*oom_handler)(size_t));
-size_t zmalloc_get_rss(void);
-int zmalloc_get_allocator_info(size_t *allocated, size_t *active, size_t *resident);
-void set_jemalloc_bg_thread(int enable);
-int jemalloc_purge();
-size_t zmalloc_get_private_dirty(long pid);
-size_t zmalloc_get_smap_bytes_by_field(char *field, long pid);
-size_t zmalloc_get_memory_size(void);
-void zlibc_free(void *ptr);
-
-#ifdef HAVE_DEFRAG
-void zfree_no_tcache(void *ptr);
-void *zmalloc_no_tcache(size_t size);
-#endif
-
-#ifndef HAVE_MALLOC_SIZE
-size_t zmalloc_size(void *ptr);
-size_t zmalloc_usable_size(void *ptr);
-#else
-#define zmalloc_usable_size(p) zmalloc_size(p)
-#endif
-
-#ifdef REDIS_TEST
-int zmalloc_test(int argc, char **argv, int accurate);
-#endif
-
-#endif /* __ZMALLOC_H */
diff --git a/redis-stable/tests/assets/corrupt_empty_keys.rdb b/redis-stable/tests/assets/corrupt_empty_keys.rdb
deleted file mode 100644
index 8f260d49333fbe04e749d0d4ea2f9a7349994cc1..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 261
zcmWG?b@2=~Ffg$E#aWb^l3A=<mRiJZWNNAh#lN^9!bzDW#RnXIu_l*f=B6H!*A-0s
z#Zg+EnxdPVntN!$FCK<pJc;>fx&=k4iMdHRsRtPTG5qFWU}4EfEY4tHVlGZCVc_AZ
z0#fl+nFTqS#U<R_3=9lhK+M4KpO*)u44Vuq3rG(G7Y|4aHU)fqV41?w%;anki-AuD
bRUke!x1gjFrj-%d+W+2-JHH3bzRv;x7j#nz

diff --git a/redis-stable/tests/assets/corrupt_ziplist.rdb b/redis-stable/tests/assets/corrupt_ziplist.rdb
deleted file mode 100644
index b40ada8d634d094ba2f20d728f20b19596e3e7ef..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1415
zcmaJ>yH3ME5WE!T6@e)D2D(_g=jTyTKtT%yJ;@ao7$n<4$tUnlG*No~f$uO9#!1cy
z*|V&CI%%|?ot<6X?e*2o9T6q<VPR)kIeE3k*cjuxQy=Z%hpZ}Bm$f&ovfQrU)W>~&
zFfZ+FlG}X!`94<P>MK_2^wBOaS~?d==q)zU!&yf={A4d*K4oP!@_nV$d3(I}+y1iu
z&()~2>C61Nvc;cTI$n)>btn+(lX1ELPr^eUtzCYvzbM9d*I!=`yS@i_ig{uQPjG&y
zy{3)DaZjgVn9o|!Pgo}tVIIahnXzxo0py_+*QFHeClYX>E=5=;8Qd3{ZcloCh5}D2
z%q77(nK4c&o(mJkN%B);{rtPnVE+R>+<$}TNQr=_xGrg--&n|J!OsZiGYkI2!oEp<
bM#3J39Y65RY~Brk>u~62;CyS^7jGLs8LoRE

diff --git a/redis-stable/tests/assets/default.conf b/redis-stable/tests/assets/default.conf
deleted file mode 100644
index d7b8a75c..00000000
--- a/redis-stable/tests/assets/default.conf
+++ /dev/null
@@ -1,27 +0,0 @@
-# Redis configuration for testing.
-
-always-show-logo yes
-notify-keyspace-events KEA
-daemonize no
-pidfile /var/run/redis.pid
-port 6379
-timeout 0
-bind 127.0.0.1
-loglevel verbose
-logfile ''
-databases 16
-latency-monitor-threshold 1
-
-save 900 1
-save 300 10
-save 60 10000
-
-rdbcompression yes
-dbfilename dump.rdb
-dir ./
-
-slave-serve-stale-data yes
-appendonly no
-appendfsync everysec
-no-appendfsync-on-rewrite no
-activerehashing yes
diff --git a/redis-stable/tests/assets/encodings.rdb b/redis-stable/tests/assets/encodings.rdb
deleted file mode 100644
index 9fd9b705d16220065ee117a1c1c094f40fb122f2..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 667
zcmbVKu}UOC5UuKJ7oAzb-~v%NHW5S&dS+bpFfmX#Qw_|N?w&>$M|aur5EcU?;j)7>
zGV&XY4SF>ZBR^rkz`zf1tzKQwOdP0r-Cfn)uU@~+^|g&HrPRU;knEK1xGIbhsS?(T
zOp!5$Ql%uLiRxVU_K~%gGG1r2V@aAV)EAeQf1$=iXe|<j22;{nQ=$}F%p{Ms<cW%_
ze93O7(Q3JTH<=IsAUO~O5Ram`Xq3aeQk<FL7zOYM(hCl*LQQB0Ej?bHBUE~DbLEiB
z`cNs4+l`~W__r&HW^KFKE^?^a=3%St%Ccb!cQ>~B7q#x40{=g8Nhbr35aH0(af04|
z31?FkfXdOIL*v>$`m`ZiW?H~$fQQSK0B})18Q{+2^#ErNo(A|lG8gy_c?x0;Mx(`{
zoa#1QiP|F?FVK2I8DyCB=mk$S8nlC&4|~3w8;|#Ox&QtGwHmXU=HND1)gUq}8+2xM
zS?Yc@4yO2OwUpuPICQ~2@KI=m_~m`huJS+FRQ_l1RQDc;oztC1%JaPY56L<A!Cyg&
F{wu@0q2B-i

diff --git a/redis-stable/tests/assets/hash-zipmap.rdb b/redis-stable/tests/assets/hash-zipmap.rdb
deleted file mode 100644
index 27a42ed4bb494cee9d67b7f0feccce7e4136d50a..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 35
pcmWG?b@2=~FfcIw$H2*wkyxA|z{Heh$iz@)$dqOTq>TRm2LPS*34j0q

diff --git a/redis-stable/tests/assets/minimal.conf b/redis-stable/tests/assets/minimal.conf
deleted file mode 100644
index ae14ae87..00000000
--- a/redis-stable/tests/assets/minimal.conf
+++ /dev/null
@@ -1,5 +0,0 @@
-# Minimal configuration for testing.
-always-show-logo yes
-daemonize no
-pidfile /var/run/redis.pid
-loglevel verbose
diff --git a/redis-stable/tests/assets/nodefaultuser.acl b/redis-stable/tests/assets/nodefaultuser.acl
deleted file mode 100644
index 2557c7fe..00000000
--- a/redis-stable/tests/assets/nodefaultuser.acl
+++ /dev/null
@@ -1,2 +0,0 @@
-user alice on nopass ~* +@all
-user bob on nopass ~* &* +@all
\ No newline at end of file
diff --git a/redis-stable/tests/assets/user.acl b/redis-stable/tests/assets/user.acl
deleted file mode 100644
index 67303512..00000000
--- a/redis-stable/tests/assets/user.acl
+++ /dev/null
@@ -1,3 +0,0 @@
-user alice on allcommands allkeys >alice
-user bob on -@all +@set +acl ~set* >bob
-user default on nopass ~* +@all
diff --git a/redis-stable/tests/cluster/cluster.tcl b/redis-stable/tests/cluster/cluster.tcl
deleted file mode 100644
index e9578928..00000000
--- a/redis-stable/tests/cluster/cluster.tcl
+++ /dev/null
@@ -1,177 +0,0 @@
-# Cluster-specific test functions.
-#
-# Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
-# This software is released under the BSD License. See the COPYING file for
-# more information.
-
-# Track cluster configuration as created by create_cluster below
-set ::cluster_master_nodes 0
-set ::cluster_replica_nodes 0
-
-# Returns a parsed CLUSTER NODES output as a list of dictionaries.
-proc get_cluster_nodes id {
-    set lines [split [R $id cluster nodes] "\r\n"]
-    set nodes {}
-    foreach l $lines {
-        set l [string trim $l]
-        if {$l eq {}} continue
-        set args [split $l]
-        set node [dict create \
-            id [lindex $args 0] \
-            addr [lindex $args 1] \
-            flags [split [lindex $args 2] ,] \
-            slaveof [lindex $args 3] \
-            ping_sent [lindex $args 4] \
-            pong_recv [lindex $args 5] \
-            config_epoch [lindex $args 6] \
-            linkstate [lindex $args 7] \
-            slots [lrange $args 8 end] \
-        ]
-        lappend nodes $node
-    }
-    return $nodes
-}
-
-# Test node for flag.
-proc has_flag {node flag} {
-    expr {[lsearch -exact [dict get $node flags] $flag] != -1}
-}
-
-# Returns the parsed myself node entry as a dictionary.
-proc get_myself id {
-    set nodes [get_cluster_nodes $id]
-    foreach n $nodes {
-        if {[has_flag $n myself]} {return $n}
-    }
-    return {}
-}
-
-# Get a specific node by ID by parsing the CLUSTER NODES output
-# of the instance Number 'instance_id'
-proc get_node_by_id {instance_id node_id} {
-    set nodes [get_cluster_nodes $instance_id]
-    foreach n $nodes {
-        if {[dict get $n id] eq $node_id} {return $n}
-    }
-    return {}
-}
-
-# Return the value of the specified CLUSTER INFO field.
-proc CI {n field} {
-    get_info_field [R $n cluster info] $field
-}
-
-# Return the value of the specified INFO field.
-proc s {n field} {
-    get_info_field [R $n info] $field
-}
-
-# Assuming nodes are reest, this function performs slots allocation.
-# Only the first 'n' nodes are used.
-proc cluster_allocate_slots {n} {
-    set slot 16383
-    while {$slot >= 0} {
-        # Allocate successive slots to random nodes.
-        set node [randomInt $n]
-        lappend slots_$node $slot
-        incr slot -1
-    }
-    for {set j 0} {$j < $n} {incr j} {
-        R $j cluster addslots {*}[set slots_${j}]
-    }
-}
-
-# Check that cluster nodes agree about "state", or raise an error.
-proc assert_cluster_state {state} {
-    foreach_redis_id id {
-        if {[instance_is_killed redis $id]} continue
-        wait_for_condition 1000 50 {
-            [CI $id cluster_state] eq $state
-        } else {
-            fail "Cluster node $id cluster_state:[CI $id cluster_state]"
-        }
-    }
-}
-
-# Search the first node starting from ID $first that is not
-# already configured as a slave.
-proc cluster_find_available_slave {first} {
-    foreach_redis_id id {
-        if {$id < $first} continue
-        if {[instance_is_killed redis $id]} continue
-        set me [get_myself $id]
-        if {[dict get $me slaveof] eq {-}} {return $id}
-    }
-    fail "No available slaves"
-}
-
-# Add 'slaves' slaves to a cluster composed of 'masters' masters.
-# It assumes that masters are allocated sequentially from instance ID 0
-# to N-1.
-proc cluster_allocate_slaves {masters slaves} {
-    for {set j 0} {$j < $slaves} {incr j} {
-        set master_id [expr {$j % $masters}]
-        set slave_id [cluster_find_available_slave $masters]
-        set master_myself [get_myself $master_id]
-        R $slave_id cluster replicate [dict get $master_myself id]
-    }
-}
-
-# Create a cluster composed of the specified number of masters and slaves.
-proc create_cluster {masters slaves} {
-    cluster_allocate_slots $masters
-    if {$slaves} {
-        cluster_allocate_slaves $masters $slaves
-    }
-    assert_cluster_state ok
-
-    set ::cluster_master_nodes $masters
-    set ::cluster_replica_nodes $slaves
-}
-
-# Set the cluster node-timeout to all the reachalbe nodes.
-proc set_cluster_node_timeout {to} {
-    foreach_redis_id id {
-        catch {R $id CONFIG SET cluster-node-timeout $to}
-    }
-}
-
-# Check if the cluster is writable and readable. Use node "id"
-# as a starting point to talk with the cluster.
-proc cluster_write_test {id} {
-    set prefix [randstring 20 20 alpha]
-    set port [get_instance_attrib redis $id port]
-    set cluster [redis_cluster 127.0.0.1:$port]
-    for {set j 0} {$j < 100} {incr j} {
-        $cluster set key.$j $prefix.$j
-    }
-    for {set j 0} {$j < 100} {incr j} {
-        assert {[$cluster get key.$j] eq "$prefix.$j"}
-    }
-    $cluster close
-}
-
-# Check if cluster configuration is consistent.
-proc cluster_config_consistent {} {
-    for {set j 0} {$j < $::cluster_master_nodes + $::cluster_replica_nodes} {incr j} {
-        if {$j == 0} {
-            set base_cfg [R $j cluster slots]
-        } else {
-            set cfg [R $j cluster slots]
-            if {$cfg != $base_cfg} {
-                return 0
-            }
-        }
-    }
-
-    return 1
-}
-
-# Wait for cluster configuration to propagate and be consistent across nodes.
-proc wait_for_cluster_propagation {} {
-    wait_for_condition 50 100 {
-        [cluster_config_consistent] eq 1
-    } else {
-        fail "cluster config did not reach a consistent state"
-    }
-}
diff --git a/redis-stable/tests/cluster/run.tcl b/redis-stable/tests/cluster/run.tcl
deleted file mode 100644
index d9a7d7ee..00000000
--- a/redis-stable/tests/cluster/run.tcl
+++ /dev/null
@@ -1,29 +0,0 @@
-# Cluster test suite. Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
-# This software is released under the BSD License. See the COPYING file for
-# more information.
-
-cd tests/cluster
-source cluster.tcl
-source ../instances.tcl
-source ../../support/cluster.tcl ; # Redis Cluster client.
-
-set ::instances_count 20 ; # How many instances we use at max.
-set ::tlsdir "../../tls"
-
-proc main {} {
-    parse_options
-    spawn_instance redis $::redis_base_port $::instances_count {
-        "cluster-enabled yes"
-        "appendonly yes"
-    }
-    run_tests
-    cleanup
-    end_tests
-}
-
-if {[catch main e]} {
-    puts $::errorInfo
-    if {$::pause_on_error} pause_on_error
-    cleanup
-    exit 1
-}
diff --git a/redis-stable/tests/cluster/tests/00-base.tcl b/redis-stable/tests/cluster/tests/00-base.tcl
deleted file mode 100644
index 280befb9..00000000
--- a/redis-stable/tests/cluster/tests/00-base.tcl
+++ /dev/null
@@ -1,59 +0,0 @@
-# Check the basic monitoring and failover capabilities.
-
-source "../tests/includes/init-tests.tcl"
-
-if {$::simulate_error} {
-    test "This test will fail" {
-        fail "Simulated error"
-    }
-}
-
-test "Different nodes have different IDs" {
-    set ids {}
-    set numnodes 0
-    foreach_redis_id id {
-        incr numnodes
-        # Every node should just know itself.
-        set nodeid [dict get [get_myself $id] id]
-        assert {$nodeid ne {}}
-        lappend ids $nodeid
-    }
-    set numids [llength [lsort -unique $ids]]
-    assert {$numids == $numnodes}
-}
-
-test "It is possible to perform slot allocation" {
-    cluster_allocate_slots 5
-}
-
-test "After the join, every node gets a different config epoch" {
-    set trynum 60
-    while {[incr trynum -1] != 0} {
-        # We check that this condition is true for *all* the nodes.
-        set ok 1 ; # Will be set to 0 every time a node is not ok.
-        foreach_redis_id id {
-            set epochs {}
-            foreach n [get_cluster_nodes $id] {
-                lappend epochs [dict get $n config_epoch]
-            }
-            if {[lsort $epochs] != [lsort -unique $epochs]} {
-                set ok 0 ; # At least one collision!
-            }
-        }
-        if {$ok} break
-        after 1000
-        puts -nonewline .
-        flush stdout
-    }
-    if {$trynum == 0} {
-        fail "Config epoch conflict resolution is not working."
-    }
-}
-
-test "Nodes should report cluster_state is ok now" {
-    assert_cluster_state ok
-}
-
-test "It is possible to write and read from the cluster" {
-    cluster_write_test 0
-}
diff --git a/redis-stable/tests/cluster/tests/01-faildet.tcl b/redis-stable/tests/cluster/tests/01-faildet.tcl
deleted file mode 100644
index 8fe87c91..00000000
--- a/redis-stable/tests/cluster/tests/01-faildet.tcl
+++ /dev/null
@@ -1,38 +0,0 @@
-# Check the basic monitoring and failover capabilities.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-test "Killing two slave nodes" {
-    kill_instance redis 5
-    kill_instance redis 6
-}
-
-test "Cluster should be still up" {
-    assert_cluster_state ok
-}
-
-test "Killing one master node" {
-    kill_instance redis 0
-}
-
-# Note: the only slave of instance 0 is already down so no
-# failover is possible, that would change the state back to ok.
-test "Cluster should be down now" {
-    assert_cluster_state fail
-}
-
-test "Restarting master node" {
-    restart_instance redis 0
-}
-
-test "Cluster should be up again" {
-    assert_cluster_state ok
-}
diff --git a/redis-stable/tests/cluster/tests/02-failover.tcl b/redis-stable/tests/cluster/tests/02-failover.tcl
deleted file mode 100644
index 6b2fd09a..00000000
--- a/redis-stable/tests/cluster/tests/02-failover.tcl
+++ /dev/null
@@ -1,65 +0,0 @@
-# Check the basic monitoring and failover capabilities.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-set current_epoch [CI 1 cluster_current_epoch]
-
-test "Killing one master node" {
-    kill_instance redis 0
-}
-
-test "Wait for failover" {
-    wait_for_condition 1000 50 {
-        [CI 1 cluster_current_epoch] > $current_epoch
-    } else {
-        fail "No failover detected"
-    }
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 1
-}
-
-test "Instance #5 is now a master" {
-    assert {[RI 5 role] eq {master}}
-}
-
-test "Restarting the previously killed master node" {
-    restart_instance redis 0
-}
-
-test "Instance #0 gets converted into a slave" {
-    wait_for_condition 1000 50 {
-        [RI 0 role] eq {slave}
-    } else {
-        fail "Old master was not converted into slave"
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/03-failover-loop.tcl b/redis-stable/tests/cluster/tests/03-failover-loop.tcl
deleted file mode 100644
index 8e1bcd6f..00000000
--- a/redis-stable/tests/cluster/tests/03-failover-loop.tcl
+++ /dev/null
@@ -1,115 +0,0 @@
-# Failover stress test.
-# In this test a different node is killed in a loop for N
-# iterations. The test checks that certain properties
-# are preseved across iterations.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-set iterations 20
-set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-
-while {[incr iterations -1]} {
-    set tokill [randomInt 10]
-    set other [expr {($tokill+1)%10}] ; # Some other instance.
-    set key [randstring 20 20 alpha]
-    set val [randstring 20 20 alpha]
-    set role [RI $tokill role]
-    if {$role eq {master}} {
-        set slave {}
-        set myid [dict get [get_myself $tokill] id]
-        foreach_redis_id id {
-            if {$id == $tokill} continue
-            if {[dict get [get_myself $id] slaveof] eq $myid} {
-                set slave $id
-            }
-        }
-        if {$slave eq {}} {
-            fail "Unable to retrieve slave's ID for master #$tokill"
-        }
-    }
-
-    puts "--- Iteration $iterations ---"
-
-    if {$role eq {master}} {
-        test "Wait for slave of #$tokill to sync" {
-            wait_for_condition 1000 50 {
-                [string match {*state=online*} [RI $tokill slave0]]
-            } else {
-                fail "Slave of node #$tokill is not ok"
-            }
-        }
-        set slave_config_epoch [CI $slave cluster_my_epoch]
-    }
-
-    test "Cluster is writable before failover" {
-        for {set i 0} {$i < 100} {incr i} {
-            catch {$cluster set $key:$i $val:$i} err
-            assert {$err eq {OK}}
-        }
-        # Wait for the write to propagate to the slave if we
-        # are going to kill a master.
-        if {$role eq {master}} {
-            R $tokill wait 1 20000
-        }
-    }
-
-    test "Killing node #$tokill" {
-        kill_instance redis $tokill
-    }
-
-    if {$role eq {master}} {
-        test "Wait failover by #$slave with old epoch $slave_config_epoch" {
-            wait_for_condition 1000 50 {
-                [CI $slave cluster_my_epoch] > $slave_config_epoch
-            } else {
-                fail "No failover detected, epoch is still [CI $slave cluster_my_epoch]"
-            }
-        }
-    }
-
-    test "Cluster should eventually be up again" {
-        assert_cluster_state ok
-    }
-
-    test "Cluster is writable again" {
-        for {set i 0} {$i < 100} {incr i} {
-            catch {$cluster set $key:$i:2 $val:$i:2} err
-            assert {$err eq {OK}}
-        }
-    }
-
-    test "Restarting node #$tokill" {
-        restart_instance redis $tokill
-    }
-
-    test "Instance #$tokill is now a slave" {
-        wait_for_condition 1000 50 {
-            [RI $tokill role] eq {slave}
-        } else {
-            fail "Restarted instance is not a slave"
-        }
-    }
-
-    test "We can read back the value we set before" {
-        for {set i 0} {$i < 100} {incr i} {
-            catch {$cluster get $key:$i} err
-            assert {$err eq "$val:$i"}
-            catch {$cluster get $key:$i:2} err
-            assert {$err eq "$val:$i:2"}
-        }
-    }
-}
-
-test "Post condition: current_epoch >= my_epoch everywhere" {
-    foreach_redis_id id {
-        assert {[CI $id cluster_current_epoch] >= [CI $id cluster_my_epoch]}
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/04-resharding.tcl b/redis-stable/tests/cluster/tests/04-resharding.tcl
deleted file mode 100644
index 4d31d314..00000000
--- a/redis-stable/tests/cluster/tests/04-resharding.tcl
+++ /dev/null
@@ -1,194 +0,0 @@
-# Failover stress test.
-# In this test a different node is killed in a loop for N
-# iterations. The test checks that certain properties
-# are preserved across iterations.
-
-source "../tests/includes/init-tests.tcl"
-source "../../../tests/support/cli.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Enable AOF in all the instances" {
-    foreach_redis_id id {
-        R $id config set appendonly yes
-        # We use "appendfsync no" because it's fast but also guarantees that
-        # write(2) is performed before replying to client.
-        R $id config set appendfsync no
-    }
-
-    foreach_redis_id id {
-        wait_for_condition 1000 500 {
-            [RI $id aof_rewrite_in_progress] == 0 &&
-            [RI $id aof_enabled] == 1
-        } else {
-            fail "Failed to enable AOF on instance #$id"
-        }
-    }
-}
-
-# Return non-zero if the specified PID is about a process still in execution,
-# otherwise 0 is returned.
-proc process_is_running {pid} {
-    # PS should return with an error if PID is non existing,
-    # and catch will return non-zero. We want to return non-zero if
-    # the PID exists, so we invert the return value with expr not operator.
-    expr {![catch {exec ps -p $pid}]}
-}
-
-# Our resharding test performs the following actions:
-#
-# - N commands are sent to the cluster in the course of the test.
-# - Every command selects a random key from key:0 to key:MAX-1.
-# - The operation RPUSH key <randomvalue> is performed.
-# - Tcl remembers into an array all the values pushed to each list.
-# - After N/2 commands, the resharding process is started in background.
-# - The test continues while the resharding is in progress.
-# - At the end of the test, we wait for the resharding process to stop.
-# - Finally the keys are checked to see if they contain the value they should.
-
-set numkeys 50000
-set numops 200000
-set start_node_port [get_instance_attrib redis 0 port]
-set cluster [redis_cluster 127.0.0.1:$start_node_port]
-if {$::tls} {
-    # setup a non-TLS cluster client to the TLS cluster
-    set plaintext_port [get_instance_attrib redis 0 plaintext-port]
-    set cluster_plaintext [redis_cluster 127.0.0.1:$plaintext_port 0]
-    puts "Testing TLS cluster on start node 127.0.0.1:$start_node_port, plaintext port $plaintext_port"
-} else {
-    set cluster_plaintext $cluster
-    puts "Testing using non-TLS cluster"
-}
-catch {unset content}
-array set content {}
-set tribpid {}
-
-test "Cluster consistency during live resharding" {
-    set ele 0
-    for {set j 0} {$j < $numops} {incr j} {
-        # Trigger the resharding once we execute half the ops.
-        if {$tribpid ne {} &&
-            ($j % 10000) == 0 &&
-            ![process_is_running $tribpid]} {
-            set tribpid {}
-        }
-
-        if {$j >= $numops/2 && $tribpid eq {}} {
-            puts -nonewline "...Starting resharding..."
-            flush stdout
-            set target [dict get [get_myself [randomInt 5]] id]
-            set tribpid [lindex [exec \
-                ../../../src/redis-cli --cluster reshard \
-                127.0.0.1:[get_instance_attrib redis 0 port] \
-                --cluster-from all \
-                --cluster-to $target \
-                --cluster-slots 100 \
-                --cluster-yes \
-                {*}[rediscli_tls_config "../../../tests"] \
-                | [info nameofexecutable] \
-                ../tests/helpers/onlydots.tcl \
-                &] 0]
-        }
-
-        # Write random data to random list.
-        set listid [randomInt $numkeys]
-        set key "key:$listid"
-        incr ele
-        # We write both with Lua scripts and with plain commands.
-        # This way we are able to stress Lua -> Redis command invocation
-        # as well, that has tests to prevent Lua to write into wrong
-        # hash slots.
-        # We also use both TLS and plaintext connections.
-        if {$listid % 3 == 0} {
-            $cluster rpush $key $ele
-        } elseif {$listid % 3 == 1} {
-            $cluster_plaintext rpush $key $ele
-        } else {
-            $cluster eval {redis.call("rpush",KEYS[1],ARGV[1])} 1 $key $ele
-        }
-        lappend content($key) $ele
-
-        if {($j % 1000) == 0} {
-            puts -nonewline W; flush stdout
-        }
-    }
-
-    # Wait for the resharding process to end
-    wait_for_condition 1000 500 {
-        [process_is_running $tribpid] == 0
-    } else {
-        fail "Resharding is not terminating after some time."
-    }
-
-}
-
-test "Verify $numkeys keys for consistency with logical content" {
-    # Check that the Redis Cluster content matches our logical content.
-    foreach {key value} [array get content] {
-        if {[$cluster lrange $key 0 -1] ne $value} {
-            fail "Key $key expected to hold '$value' but actual content is [$cluster lrange $key 0 -1]"
-        }
-    }
-}
-
-test "Crash and restart all the instances" {
-    foreach_redis_id id {
-        kill_instance redis $id
-        restart_instance redis $id
-    }
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Verify $numkeys keys after the crash & restart" {
-    # Check that the Redis Cluster content matches our logical content.
-    foreach {key value} [array get content] {
-        if {[$cluster lrange $key 0 -1] ne $value} {
-            fail "Key $key expected to hold '$value' but actual content is [$cluster lrange $key 0 -1]"
-        }
-    }
-}
-
-test "Disable AOF in all the instances" {
-    foreach_redis_id id {
-        R $id config set appendonly no
-    }
-}
-
-test "Verify slaves consistency" {
-    set verified_masters 0
-    foreach_redis_id id {
-        set role [R $id role]
-        lassign $role myrole myoffset slaves
-        if {$myrole eq {slave}} continue
-        set masterport [get_instance_attrib redis $id port]
-        set masterdigest [R $id debug digest]
-        foreach_redis_id sid {
-            set srole [R $sid role]
-            if {[lindex $srole 0] eq {master}} continue
-            if {[lindex $srole 2] != $masterport} continue
-            wait_for_condition 1000 500 {
-                [R $sid debug digest] eq $masterdigest
-            } else {
-                fail "Master and slave data digest are different"
-            }
-            incr verified_masters
-        }
-    }
-    assert {$verified_masters >= 5}
-}
-
-test "Dump sanitization was skipped for migrations" {
-    set verified_masters 0
-    foreach_redis_id id {
-        assert {[RI $id dump_payload_sanitizations] == 0}
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/05-slave-selection.tcl b/redis-stable/tests/cluster/tests/05-slave-selection.tcl
deleted file mode 100644
index 6769d307..00000000
--- a/redis-stable/tests/cluster/tests/05-slave-selection.tcl
+++ /dev/null
@@ -1,171 +0,0 @@
-# Slave selection test
-# Check the algorithm trying to pick the slave with the most complete history.
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 5 master and 10 slaves, so that we have 2
-# slaves for each master.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 10
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "The first master has actually two slaves" {
-    assert {[llength [lindex [R 0 role] 2]] == 2}
-}
-
-test {Slaves of #0 are instance #5 and #10 as expected} {
-    set port0 [get_instance_attrib redis 0 port]
-    assert {[lindex [R 5 role] 2] == $port0}
-    assert {[lindex [R 10 role] 2] == $port0}
-}
-
-test "Instance #5 and #10 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up} &&
-        [RI 10 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 or #10 master link status is not up"
-    }
-}
-
-set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-
-test "Slaves are both able to receive and acknowledge writes" {
-    for {set j 0} {$j < 100} {incr j} {
-        $cluster set $j $j
-    }
-    assert {[R 0 wait 2 60000] == 2}
-}
-
-test "Write data while slave #10 is paused and can't receive it" {
-    # Stop the slave with a multi/exec transaction so that the master will
-    # be killed as soon as it can accept writes again.
-    R 10 multi
-    R 10 debug sleep 10
-    R 10 client kill 127.0.0.1:$port0
-    R 10 deferred 1
-    R 10 exec
-
-    # Write some data the slave can't receive.
-    for {set j 0} {$j < 100} {incr j} {
-        $cluster set $j $j
-    }
-
-    # Prevent the master from accepting new slaves.
-    # Use a large pause value since we'll kill it anyway.
-    R 0 CLIENT PAUSE 60000
-
-    # Wait for the slave to return available again
-    R 10 deferred 0
-    assert {[R 10 read] eq {OK OK}}
-
-    # Kill the master so that a reconnection will not be possible.
-    kill_instance redis 0
-}
-
-test "Wait for instance #5 (and not #10) to turn into a master" {
-    wait_for_condition 1000 50 {
-        [RI 5 role] eq {master}
-    } else {
-        fail "No failover detected"
-    }
-}
-
-test "Wait for the node #10 to return alive before ending the test" {
-    R 10 ping
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Node #10 should eventually replicate node #5" {
-    set port5 [get_instance_attrib redis 5 port]
-    wait_for_condition 1000 50 {
-        ([lindex [R 10 role] 2] == $port5) &&
-        ([lindex [R 10 role] 3] eq {connected})
-    } else {
-        fail "#10 didn't became slave of #5"
-    }
-}
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 3 master and 15 slaves, so that we have 5
-# slaves for eatch master.
-test "Create a 3 nodes cluster" {
-    create_cluster 3 15
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "The first master has actually 5 slaves" {
-    assert {[llength [lindex [R 0 role] 2]] == 5}
-}
-
-test {Slaves of #0 are instance #3, #6, #9, #12 and #15 as expected} {
-    set port0 [get_instance_attrib redis 0 port]
-    assert {[lindex [R 3 role] 2] == $port0}
-    assert {[lindex [R 6 role] 2] == $port0}
-    assert {[lindex [R 9 role] 2] == $port0}
-    assert {[lindex [R 12 role] 2] == $port0}
-    assert {[lindex [R 15 role] 2] == $port0}
-}
-
-test {Instance #3, #6, #9, #12 and #15 synced with the master} {
-    wait_for_condition 1000 50 {
-        [RI 3 master_link_status] eq {up} &&
-        [RI 6 master_link_status] eq {up} &&
-        [RI 9 master_link_status] eq {up} &&
-        [RI 12 master_link_status] eq {up} &&
-        [RI 15 master_link_status] eq {up}
-    } else {
-        fail "Instance #3 or #6 or #9 or #12 or #15 master link status is not up"
-    }
-}
-
-proc master_detected {instances} {
-    foreach instance [dict keys $instances] {
-        if {[RI $instance role] eq {master}} {
-            return true
-        }
-    }
-
-    return false
-}
-
-test "New Master down consecutively" {
-    set instances [dict create 0 1 3 1 6 1 9 1 12 1 15 1]
-
-    set loops [expr {[dict size $instances]-1}]
-    for {set i 0} {$i < $loops} {incr i} {
-        set master_id -1
-        foreach instance [dict keys $instances] {
-            if {[RI $instance role] eq {master}} {
-                set master_id $instance
-                break;
-            }
-        }
-
-        if {$master_id eq -1} {
-            fail "no master detected, #loop $i"
-        }
-
-        set instances [dict remove $instances $master_id]
-
-        kill_instance redis $master_id
-        wait_for_condition 1000 50 {
-            [master_detected $instances]
-        } else {
-            fail "No failover detected when master $master_id fails"
-        }
-
-        assert_cluster_state ok
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl b/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
deleted file mode 100644
index f2e67050..00000000
--- a/redis-stable/tests/cluster/tests/06-slave-stop-cond.tcl
+++ /dev/null
@@ -1,73 +0,0 @@
-# Slave stop condition test
-# Check that if there is a disconnection time limit, the slave will not try
-# to failover its master.
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 5 master and 5 slaves.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "The first master has actually one slave" {
-    assert {[llength [lindex [R 0 role] 2]] == 1}
-}
-
-test {Slaves of #0 is instance #5 as expected} {
-    set port0 [get_instance_attrib redis 0 port]
-    assert {[lindex [R 5 role] 2] == $port0}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-test "Lower the slave validity factor of #5 to the value of 2" {
-    assert {[R 5 config set cluster-slave-validity-factor 2] eq {OK}}
-}
-
-test "Break master-slave link and prevent further reconnections" {
-    # Stop the slave with a multi/exec transaction so that the master will
-    # be killed as soon as it can accept writes again.
-    R 5 multi
-    R 5 client kill 127.0.0.1:$port0
-    # here we should sleep 6 or more seconds (node_timeout * slave_validity)
-    # but the actual validity time is actually incremented by the
-    # repl-ping-slave-period value which is 10 seconds by default. So we
-    # need to wait more than 16 seconds.
-    R 5 debug sleep 20
-    R 5 deferred 1
-    R 5 exec
-
-    # Prevent the master from accepting new slaves.
-    # Use a large pause value since we'll kill it anyway.
-    R 0 CLIENT PAUSE 60000
-
-    # Wait for the slave to return available again
-    R 5 deferred 0
-    assert {[R 5 read] eq {OK OK}}
-
-    # Kill the master so that a reconnection will not be possible.
-    kill_instance redis 0
-}
-
-test "Slave #5 is reachable and alive" {
-    assert {[R 5 ping] eq {PONG}}
-}
-
-test "Slave #5 should not be able to failover" {
-    after 10000
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Cluster should be down" {
-    assert_cluster_state fail
-}
diff --git a/redis-stable/tests/cluster/tests/07-replica-migration.tcl b/redis-stable/tests/cluster/tests/07-replica-migration.tcl
deleted file mode 100644
index 68231cd2..00000000
--- a/redis-stable/tests/cluster/tests/07-replica-migration.tcl
+++ /dev/null
@@ -1,103 +0,0 @@
-# Replica migration test.
-# Check that orphaned masters are joined by replicas of masters having
-# multiple replicas attached, according to the migration barrier settings.
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 5 master and 10 slaves, so that we have 2
-# slaves for each master.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 10
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Each master should have two replicas attached" {
-    foreach_redis_id id {
-        if {$id < 5} {
-            wait_for_condition 1000 50 {
-                [llength [lindex [R 0 role] 2]] == 2
-            } else {
-                fail "Master #$id does not have 2 slaves as expected"
-            }
-        }
-    }
-}
-
-test "Killing all the slaves of master #0 and #1" {
-    kill_instance redis 5
-    kill_instance redis 10
-    kill_instance redis 6
-    kill_instance redis 11
-    after 4000
-}
-
-foreach_redis_id id {
-    if {$id < 5} {
-        test "Master #$id should have at least one replica" {
-            wait_for_condition 1000 50 {
-                [llength [lindex [R $id role] 2]] >= 1
-            } else {
-                fail "Master #$id has no replicas"
-            }
-        }
-    }
-}
-
-# Now test the migration to a master which used to be a slave, after
-# a failver.
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 5 master and 10 slaves, so that we have 2
-# slaves for each master.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 10
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Kill slave #7 of master #2. Only slave left is #12 now" {
-    kill_instance redis 7
-}
-
-set current_epoch [CI 1 cluster_current_epoch]
-
-test "Killing master node #2, #12 should failover" {
-    kill_instance redis 2
-}
-
-test "Wait for failover" {
-    wait_for_condition 1000 50 {
-        [CI 1 cluster_current_epoch] > $current_epoch
-    } else {
-        fail "No failover detected"
-    }
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 1
-}
-
-test "Instance 12 is now a master without slaves" {
-    assert {[RI 12 role] eq {master}}
-}
-
-# The remaining instance is now without slaves. Some other slave
-# should migrate to it.
-
-test "Master #12 should get at least one migrated replica" {
-    wait_for_condition 1000 50 {
-        [llength [lindex [R 12 role] 2]] >= 1
-    } else {
-        fail "Master #12 has no replicas"
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/08-update-msg.tcl b/redis-stable/tests/cluster/tests/08-update-msg.tcl
deleted file mode 100644
index 6f9661db..00000000
--- a/redis-stable/tests/cluster/tests/08-update-msg.tcl
+++ /dev/null
@@ -1,90 +0,0 @@
-# Test UPDATE messages sent by other nodes when the currently authorirative
-# master is unavaialble. The test is performed in the following steps:
-#
-# 1) Master goes down.
-# 2) Slave failover and becomes new master.
-# 3) New master is partitoned away.
-# 4) Old master returns.
-# 5) At this point we expect the old master to turn into a slave ASAP because
-#    of the UPDATE messages it will receive from the other nodes when its
-#    configuration will be found to be outdated.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-set current_epoch [CI 1 cluster_current_epoch]
-
-test "Killing one master node" {
-    kill_instance redis 0
-}
-
-test "Wait for failover" {
-    wait_for_condition 1000 50 {
-        [CI 1 cluster_current_epoch] > $current_epoch
-    } else {
-        fail "No failover detected"
-    }
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 1
-}
-
-test "Instance #5 is now a master" {
-    assert {[RI 5 role] eq {master}}
-}
-
-test "Killing the new master #5" {
-    kill_instance redis 5
-}
-
-test "Cluster should be down now" {
-    assert_cluster_state fail
-}
-
-test "Restarting the old master node" {
-    restart_instance redis 0
-}
-
-test "Instance #0 gets converted into a slave" {
-    wait_for_condition 1000 50 {
-        [RI 0 role] eq {slave}
-    } else {
-        fail "Old master was not converted into slave"
-    }
-}
-
-test "Restarting the new master node" {
-    restart_instance redis 5
-}
-
-test "Cluster is up again" {
-    assert_cluster_state ok
-}
diff --git a/redis-stable/tests/cluster/tests/09-pubsub.tcl b/redis-stable/tests/cluster/tests/09-pubsub.tcl
deleted file mode 100644
index e62b91c4..00000000
--- a/redis-stable/tests/cluster/tests/09-pubsub.tcl
+++ /dev/null
@@ -1,40 +0,0 @@
-# Test PUBLISH propagation across the cluster.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-proc test_cluster_publish {instance instances} {
-    # Subscribe all the instances but the one we use to send.
-    for {set j 0} {$j < $instances} {incr j} {
-        if {$j != $instance} {
-            R $j deferred 1
-            R $j subscribe testchannel
-            R $j read; # Read the subscribe reply
-        }
-    }
-
-    set data [randomValue]
-    R $instance PUBLISH testchannel $data
-
-    # Read the message back from all the nodes.
-    for {set j 0} {$j < $instances} {incr j} {
-        if {$j != $instance} {
-            set msg [R $j read]
-            assert {$data eq [lindex $msg 2]}
-            R $j unsubscribe testchannel
-            R $j read; # Read the unsubscribe reply
-            R $j deferred 0
-        }
-    }
-}
-
-test "Test publishing to master" {
-    test_cluster_publish 0 10
-}
-
-test "Test publishing to slave" {
-    test_cluster_publish 5 10
-}
diff --git a/redis-stable/tests/cluster/tests/10-manual-failover.tcl b/redis-stable/tests/cluster/tests/10-manual-failover.tcl
deleted file mode 100644
index 5441b79f..00000000
--- a/redis-stable/tests/cluster/tests/10-manual-failover.tcl
+++ /dev/null
@@ -1,192 +0,0 @@
-# Check the manual failover
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-set current_epoch [CI 1 cluster_current_epoch]
-
-set numkeys 50000
-set numops 10000
-set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-catch {unset content}
-array set content {}
-
-test "Send CLUSTER FAILOVER to #5, during load" {
-    for {set j 0} {$j < $numops} {incr j} {
-        # Write random data to random list.
-        set listid [randomInt $numkeys]
-        set key "key:$listid"
-        set ele [randomValue]
-        # We write both with Lua scripts and with plain commands.
-        # This way we are able to stress Lua -> Redis command invocation
-        # as well, that has tests to prevent Lua to write into wrong
-        # hash slots.
-        if {$listid % 2} {
-            $cluster rpush $key $ele
-        } else {
-           $cluster eval {redis.call("rpush",KEYS[1],ARGV[1])} 1 $key $ele
-        }
-        lappend content($key) $ele
-
-        if {($j % 1000) == 0} {
-            puts -nonewline W; flush stdout
-        }
-
-        if {$j == $numops/2} {R 5 cluster failover}
-    }
-}
-
-test "Wait for failover" {
-    wait_for_condition 1000 50 {
-        [CI 1 cluster_current_epoch] > $current_epoch
-    } else {
-        fail "No failover detected"
-    }
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 1
-}
-
-test "Instance #5 is now a master" {
-    assert {[RI 5 role] eq {master}}
-}
-
-test "Verify $numkeys keys for consistency with logical content" {
-    # Check that the Redis Cluster content matches our logical content.
-    foreach {key value} [array get content] {
-        assert {[$cluster lrange $key 0 -1] eq $value}
-    }
-}
-
-test "Instance #0 gets converted into a slave" {
-    wait_for_condition 1000 50 {
-        [RI 0 role] eq {slave}
-    } else {
-        fail "Old master was not converted into slave"
-    }
-}
-
-## Check that manual failover does not happen if we can't talk with the master.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-test "Make instance #0 unreachable without killing it" {
-    R 0 deferred 1
-    R 0 DEBUG SLEEP 10
-}
-
-test "Send CLUSTER FAILOVER to instance #5" {
-    R 5 cluster failover
-}
-
-test "Instance #5 is still a slave after some time (no failover)" {
-    after 5000
-    assert {[RI 5 role] eq {master}}
-}
-
-test "Wait for instance #0 to return back alive" {
-    R 0 deferred 0
-    assert {[R 0 read] eq {OK}}
-}
-
-## Check with "force" failover happens anyway.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-test "Make instance #0 unreachable without killing it" {
-    R 0 deferred 1
-    R 0 DEBUG SLEEP 10
-}
-
-test "Send CLUSTER FAILOVER to instance #5" {
-    R 5 cluster failover force
-}
-
-test "Instance #5 is a master after some time" {
-    wait_for_condition 1000 50 {
-        [RI 5 role] eq {master}
-    } else {
-        fail "Instance #5 is not a master after some time regardless of FORCE"
-    }
-}
-
-test "Wait for instance #0 to return back alive" {
-    R 0 deferred 0
-    assert {[R 0 read] eq {OK}}
-}
diff --git a/redis-stable/tests/cluster/tests/11-manual-takeover.tcl b/redis-stable/tests/cluster/tests/11-manual-takeover.tcl
deleted file mode 100644
index f567c696..00000000
--- a/redis-stable/tests/cluster/tests/11-manual-takeover.tcl
+++ /dev/null
@@ -1,59 +0,0 @@
-# Manual takeover test
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Killing majority of master nodes" {
-    kill_instance redis 0
-    kill_instance redis 1
-    kill_instance redis 2
-}
-
-test "Cluster should eventually be down" {
-    assert_cluster_state fail
-}
-
-test "Use takeover to bring slaves back" {
-    R 5 cluster failover takeover
-    R 6 cluster failover takeover
-    R 7 cluster failover takeover
-}
-
-test "Cluster should eventually be up again" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 4
-}
-
-test "Instance #5, #6, #7 are now masters" {
-    assert {[RI 5 role] eq {master}}
-    assert {[RI 6 role] eq {master}}
-    assert {[RI 7 role] eq {master}}
-}
-
-test "Restarting the previously killed master nodes" {
-    restart_instance redis 0
-    restart_instance redis 1
-    restart_instance redis 2
-}
-
-test "Instance #0, #1, #2 gets converted into a slaves" {
-    wait_for_condition 1000 50 {
-        [RI 0 role] eq {slave} && [RI 1 role] eq {slave} && [RI 2 role] eq {slave}
-    } else {
-        fail "Old masters not converted into slaves"
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl b/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
deleted file mode 100644
index ea80d81d..00000000
--- a/redis-stable/tests/cluster/tests/12-replica-migration-2.tcl
+++ /dev/null
@@ -1,74 +0,0 @@
-# Replica migration test #2.
-#
-# Check that the status of master that can be targeted by replica migration
-# is acquired again, after being getting slots again, in a cluster where the
-# other masters have slaves.
-
-source "../tests/includes/init-tests.tcl"
-source "../../../tests/support/cli.tcl"
-
-# Create a cluster with 5 master and 15 slaves, to make sure there are no
-# empty masters and make rebalancing simpler to handle during the test.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 15
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Each master should have at least two replicas attached" {
-    foreach_redis_id id {
-        if {$id < 5} {
-            wait_for_condition 1000 50 {
-                [llength [lindex [R 0 role] 2]] >= 2
-            } else {
-                fail "Master #$id does not have 2 slaves as expected"
-            }
-        }
-    }
-}
-
-test "Set allow-replica-migration yes" {
-    foreach_redis_id id {
-        R $id CONFIG SET cluster-allow-replica-migration yes
-    }
-}
-
-set master0_id [dict get [get_myself 0] id]
-test "Resharding all the master #0 slots away from it" {
-    set output [exec \
-        ../../../src/redis-cli --cluster rebalance \
-        127.0.0.1:[get_instance_attrib redis 0 port] \
-        {*}[rediscli_tls_config "../../../tests"] \
-        --cluster-weight ${master0_id}=0 >@ stdout ]
-
-}
-
-test "Master #0 should lose its replicas" {
-    wait_for_condition 1000 50 {
-        [llength [lindex [R 0 role] 2]] == 0
-    } else {
-        fail "Master #0 still has replicas"
-    }
-}
-
-test "Resharding back some slot to master #0" {
-    # Wait for the cluster config to propagate before attempting a
-    # new resharding.
-    after 10000
-    set output [exec \
-        ../../../src/redis-cli --cluster rebalance \
-        127.0.0.1:[get_instance_attrib redis 0 port] \
-        {*}[rediscli_tls_config "../../../tests"] \
-        --cluster-weight ${master0_id}=.01 \
-        --cluster-use-empty-masters  >@ stdout]
-}
-
-test "Master #0 should re-acquire one or more replicas" {
-    wait_for_condition 1000 50 {
-        [llength [lindex [R 0 role] 2]] >= 1
-    } else {
-        fail "Master #0 has no has replicas"
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl b/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
deleted file mode 100644
index 46a9f79e..00000000
--- a/redis-stable/tests/cluster/tests/12.1-replica-migration-3.tcl
+++ /dev/null
@@ -1,71 +0,0 @@
-# Replica migration test #2.
-#
-# Check that if 'cluster-allow-replica-migration' is set to 'no', slaves do not
-# migrate when master becomes empty.
-
-source "../tests/includes/init-tests.tcl"
-
-# Create a cluster with 5 master and 15 slaves, to make sure there are no
-# empty masters and make rebalancing simpler to handle during the test.
-test "Create a 5 nodes cluster" {
-    create_cluster 5 15
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Each master should have at least two replicas attached" {
-    foreach_redis_id id {
-        if {$id < 5} {
-            wait_for_condition 1000 50 {
-                [llength [lindex [R 0 role] 2]] >= 2
-            } else {
-                fail "Master #$id does not have 2 slaves as expected"
-            }
-        }
-    }
-}
-
-test "Set allow-replica-migration no" {
-    foreach_redis_id id {
-        R $id CONFIG SET cluster-allow-replica-migration no
-    }
-}
-
-set master0_id [dict get [get_myself 0] id]
-test "Resharding all the master #0 slots away from it" {
-    set output [exec \
-        ../../../src/redis-cli --cluster rebalance \
-        127.0.0.1:[get_instance_attrib redis 0 port] \
-        {*}[rediscli_tls_config "../../../tests"] \
-        --cluster-weight ${master0_id}=0 >@ stdout ]
-}
-
-test "Wait cluster to be stable" {
-    wait_for_condition 1000 50 {
-        [catch {exec ../../../src/redis-cli --cluster \
-            check 127.0.0.1:[get_instance_attrib redis 0 port] \
-            {*}[rediscli_tls_config "../../../tests"] \
-            }] == 0
-    } else {
-        fail "Cluster doesn't stabilize"
-    }
-}
-
-test "Master #0 stil should have its replicas" {
-    assert { [llength [lindex [R 0 role] 2]] >= 2 }
-}
-
-test "Each master should have at least two replicas attached" {
-    foreach_redis_id id {
-        if {$id < 5} {
-            wait_for_condition 1000 50 {
-                [llength [lindex [R 0 role] 2]] >= 2
-            } else {
-                fail "Master #$id does not have 2 slaves as expected"
-            }
-        }
-    }
-}
-
diff --git a/redis-stable/tests/cluster/tests/13-no-failover-option.tcl b/redis-stable/tests/cluster/tests/13-no-failover-option.tcl
deleted file mode 100644
index befa598d..00000000
--- a/redis-stable/tests/cluster/tests/13-no-failover-option.tcl
+++ /dev/null
@@ -1,61 +0,0 @@
-# Check that the no-failover option works
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-
-    # Configure it to never failover the master
-    R 5 CONFIG SET cluster-slave-no-failover yes
-}
-
-test "Instance #5 synced with the master" {
-    wait_for_condition 1000 50 {
-        [RI 5 master_link_status] eq {up}
-    } else {
-        fail "Instance #5 master link status is not up"
-    }
-}
-
-test "The nofailover flag is propagated" {
-    set slave5_id [dict get [get_myself 5] id]
-
-    foreach_redis_id id {
-        wait_for_condition 1000 50 {
-            [has_flag [get_node_by_id $id $slave5_id] nofailover]
-        } else {
-            fail "Instance $id can't see the nofailover flag of slave"
-        }
-    }
-}
-
-set current_epoch [CI 1 cluster_current_epoch]
-
-test "Killing one master node" {
-    kill_instance redis 0
-}
-
-test "Cluster should be still down after some time" {
-    after 10000
-    assert_cluster_state fail
-}
-
-test "Instance #5 is still a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "Restarting the previously killed master node" {
-    restart_instance redis 0
-}
diff --git a/redis-stable/tests/cluster/tests/14-consistency-check.tcl b/redis-stable/tests/cluster/tests/14-consistency-check.tcl
deleted file mode 100644
index ddc0570e..00000000
--- a/redis-stable/tests/cluster/tests/14-consistency-check.tcl
+++ /dev/null
@@ -1,117 +0,0 @@
-source "../tests/includes/init-tests.tcl"
-source "../../../tests/support/cli.tcl"
-
-test "Create a 5 nodes cluster" {
-    create_cluster 5 5
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-proc find_non_empty_master {} {
-    set master_id_no {}
-    foreach_redis_id id {
-        if {[RI $id role] eq {master} && [R $id dbsize] > 0} {
-            set master_id_no $id
-        }
-    }
-    return $master_id_no
-}
-
-proc get_one_of_my_replica {id} {
-    set replica_port [lindex [lindex [lindex [R $id role] 2] 0] 1]
-    set replica_id_num [get_instance_id_by_port redis $replica_port]
-    return $replica_id_num
-}
-
-proc cluster_write_keys_with_expire {id ttl} {
-    set prefix [randstring 20 20 alpha]
-    set port [get_instance_attrib redis $id port]
-    set cluster [redis_cluster 127.0.0.1:$port]
-    for {set j 100} {$j < 200} {incr j} {
-        $cluster setex key_expire.$j $ttl $prefix.$j
-    }
-    $cluster close
-}
-
-# make sure that replica who restarts from persistence will load keys
-# that have already expired, critical for correct execution of commands
-# that arrive from the master
-proc test_slave_load_expired_keys {aof} {
-    test "Slave expired keys is loaded when restarted: appendonly=$aof" {
-        set master_id [find_non_empty_master]
-        set replica_id [get_one_of_my_replica $master_id]
-
-        set master_dbsize_0 [R $master_id dbsize]
-        set replica_dbsize_0 [R $replica_id dbsize]
-        assert_equal $master_dbsize_0 $replica_dbsize_0
-
-        # config the replica persistency and rewrite the config file to survive restart
-        # note that this needs to be done before populating the volatile keys since
-        # that triggers and AOFRW, and we rather the AOF file to have SETEX commands
-        # rather than an RDB with volatile keys
-        R $replica_id config set appendonly $aof
-        R $replica_id config rewrite
-
-        # fill with 100 keys with 3 second TTL
-        set data_ttl 3
-        cluster_write_keys_with_expire $master_id $data_ttl
-
-        # wait for replica to be in sync with master
-        wait_for_condition 500 10 {
-            [R $replica_id dbsize] eq [R $master_id dbsize]
-        } else {
-            fail "replica didn't sync"
-        }
-        
-        set replica_dbsize_1 [R $replica_id dbsize]
-        assert {$replica_dbsize_1 > $replica_dbsize_0}
-
-        # make replica create persistence file
-        if {$aof == "yes"} {
-            # we need to wait for the initial AOFRW to be done, otherwise
-            # kill_instance (which now uses SIGTERM will fail ("Writing initial AOF, can't exit")
-            wait_for_condition 100 10 {
-                [RI $replica_id aof_rewrite_in_progress] eq 0
-            } else {
-                fail "keys didn't expire"
-            }
-        } else {
-            R $replica_id save
-        }
-
-        # kill the replica (would stay down until re-started)
-        kill_instance redis $replica_id
-
-        # Make sure the master doesn't do active expire (sending DELs to the replica)
-        R $master_id DEBUG SET-ACTIVE-EXPIRE 0
-
-        # wait for all the keys to get logically expired
-        after [expr $data_ttl*1000]
-
-        # start the replica again (loading an RDB or AOF file)
-        restart_instance redis $replica_id
-
-        # make sure the keys are still there
-        set replica_dbsize_3 [R $replica_id dbsize]
-        assert {$replica_dbsize_3 > $replica_dbsize_0}
-        
-        # restore settings
-        R $master_id DEBUG SET-ACTIVE-EXPIRE 1
-
-        # wait for the master to expire all keys and replica to get the DELs
-        wait_for_condition 500 10 {
-            [R $replica_id dbsize] eq $master_dbsize_0
-        } else {
-            fail "keys didn't expire"
-        }
-    }
-}
-
-test_slave_load_expired_keys no
-test_slave_load_expired_keys yes
diff --git a/redis-stable/tests/cluster/tests/15-cluster-slots.tcl b/redis-stable/tests/cluster/tests/15-cluster-slots.tcl
deleted file mode 100644
index f154b727..00000000
--- a/redis-stable/tests/cluster/tests/15-cluster-slots.tcl
+++ /dev/null
@@ -1,63 +0,0 @@
-source "../tests/includes/init-tests.tcl"
-
-proc cluster_allocate_mixedSlots {n} {
-    set slot 16383
-    while {$slot >= 0} {
-        set node [expr {$slot % $n}]
-        lappend slots_$node $slot
-        incr slot -1
-    }
-    for {set j 0} {$j < $n} {incr j} {
-        R $j cluster addslots {*}[set slots_${j}]
-    }
-}
-
-proc create_cluster_with_mixedSlot {masters slaves} {
-    cluster_allocate_mixedSlots $masters
-    if {$slaves} {
-        cluster_allocate_slaves $masters $slaves
-    }
-    assert_cluster_state ok
-}
-
-test "Create a 5 nodes cluster" {
-    create_cluster_with_mixedSlot 5 15
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Instance #5 is a slave" {
-    assert {[RI 5 role] eq {slave}}
-}
-
-test "client do not break when cluster slot" {
-    R 0 config set client-output-buffer-limit "normal 33554432 16777216 60"
-    if { [catch {R 0 cluster slots}] } {
-        fail "output overflow when cluster slots"
-    }
-}
-
-test "client can handle keys with hash tag" {
-    set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-    $cluster set foo{tag} bar
-    $cluster close
-}
-
-if {$::tls} {
-    test {CLUSTER SLOTS from non-TLS client in TLS cluster} {
-        set slots_tls [R 0 cluster slots]
-        set host [get_instance_attrib redis 0 host]
-        set plaintext_port [get_instance_attrib redis 0 plaintext-port]
-        set client_plain [redis $host $plaintext_port 0 0]
-        set slots_plain [$client_plain cluster slots]
-        $client_plain close
-        # Compare the ports in the first row
-        assert_no_match [lindex $slots_tls 0 3 1] [lindex $slots_plain 0 3 1]
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl b/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
deleted file mode 100644
index baed15fb..00000000
--- a/redis-stable/tests/cluster/tests/16-transactions-on-replica.tcl
+++ /dev/null
@@ -1,71 +0,0 @@
-# Check basic transactions on a replica.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a primary with a replica" {
-    create_cluster 1 1
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-set primary [Rn 0]
-set replica [Rn 1]
-
-test "Cant read from replica without READONLY" {
-    $primary SET a 1
-    wait_for_ofs_sync $primary $replica
-    catch {$replica GET a} err
-    assert {[string range $err 0 4] eq {MOVED}}
-}
-
-test "Can read from replica after READONLY" {
-    $replica READONLY
-    assert {[$replica GET a] eq {1}}
-}
-
-test "Can preform HSET primary and HGET from replica" {
-    $primary HSET h a 1
-    $primary HSET h b 2
-    $primary HSET h c 3
-    wait_for_ofs_sync $primary $replica
-    assert {[$replica HGET h a] eq {1}}
-    assert {[$replica HGET h b] eq {2}}
-    assert {[$replica HGET h c] eq {3}}
-}
-
-test "Can MULTI-EXEC transaction of HGET operations from replica" {
-    $replica MULTI
-    assert {[$replica HGET h a] eq {QUEUED}}
-    assert {[$replica HGET h b] eq {QUEUED}}
-    assert {[$replica HGET h c] eq {QUEUED}}
-    assert {[$replica EXEC] eq {1 2 3}}
-}
-
-test "MULTI-EXEC with write operations is MOVED" {
-    $replica MULTI
-    catch {$replica HSET h b 4} err
-    assert {[string range $err 0 4] eq {MOVED}}
-    catch {$replica exec} err
-    assert {[string range $err 0 8] eq {EXECABORT}}
-}
-
-test "read-only blocking operations from replica" {
-    set rd [redis_deferring_client redis 1]
-    $rd readonly
-    $rd read
-    $rd XREAD BLOCK 0 STREAMS k 0
-
-    wait_for_condition 1000 50 {
-        [RI 1 blocked_clients] eq {1}
-    } else {
-        fail "client wasn't blocked"
-    }
-
-    $primary XADD k * foo bar
-    set res [$rd read]
-    set res [lindex [lindex [lindex [lindex $res 0] 1] 0] 1]
-    assert {$res eq {foo bar}}
-    $rd close
-}
diff --git a/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl b/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
deleted file mode 100644
index 516e5170..00000000
--- a/redis-stable/tests/cluster/tests/17-diskless-load-swapdb.tcl
+++ /dev/null
@@ -1,86 +0,0 @@
-# Check replica can restore database buckup correctly if fail to diskless load.
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a primary with a replica" {
-    create_cluster 1 1
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-test "Cluster is writable" {
-    cluster_write_test 0
-}
-
-test "Right to restore backups when fail to diskless load " {
-    set master [Rn 0]
-    set replica [Rn 1]
-    set master_id 0
-    set replica_id 1
-
-    $replica READONLY
-    $replica config set repl-diskless-load swapdb
-    $replica config set appendonly no
-    $replica config set save ""
-    $replica config rewrite
-    $master config set repl-backlog-size 1024
-    $master config set repl-diskless-sync yes
-    $master config set repl-diskless-sync-delay 0
-    $master config set rdb-key-save-delay 10000
-    $master config set rdbcompression no
-    $master config set appendonly no
-    $master config set save ""
-
-    # Write a key that belongs to slot 0
-    set slot0_key "06S"
-    $master set $slot0_key 1
-    wait_for_ofs_sync $master $replica
-    assert_equal {1} [$replica get $slot0_key]
-    assert_equal $slot0_key [$replica CLUSTER GETKEYSINSLOT 0 1]
-
-    # Save an RDB and kill the replica
-    $replica save
-    kill_instance redis $replica_id
-
-    # Delete the key from master
-    $master del $slot0_key
-
-    # Replica must full sync with master when start because replication
-    # backlog size is very small, and dumping rdb will cost several seconds.
-    set num 10000
-    set value [string repeat A 1024]
-    set rd [redis_deferring_client redis $master_id]
-    for {set j 0} {$j < $num} {incr j} {
-        $rd set $j $value
-    }
-    for {set j 0} {$j < $num} {incr j} {
-        $rd read
-    }
-
-    # Start the replica again
-    restart_instance redis $replica_id
-    $replica READONLY
-
-    # Start full sync, wait till after db is flushed (backed up)
-    wait_for_condition 500 10 {
-        [s $replica_id loading] eq 1
-    } else {
-        fail "Fail to full sync"
-    }
-
-    # Kill master, abort full sync
-    kill_instance redis $master_id
-
-    # Start full sync, wait till the replica detects the disconnection
-    wait_for_condition 500 10 {
-        [s $replica_id loading] eq 0
-    } else {
-        fail "Fail to full sync"
-    }
-
-    # Replica keys and keys to slots map still both are right
-    assert_equal {1} [$replica get $slot0_key]
-    assert_equal $slot0_key [$replica CLUSTER GETKEYSINSLOT 0 1]
-}
diff --git a/redis-stable/tests/cluster/tests/18-info.tcl b/redis-stable/tests/cluster/tests/18-info.tcl
deleted file mode 100644
index 978d9d1d..00000000
--- a/redis-stable/tests/cluster/tests/18-info.tcl
+++ /dev/null
@@ -1,45 +0,0 @@
-# Check cluster info stats
-
-source "../tests/includes/init-tests.tcl"
-
-test "Create a primary with a replica" {
-    create_cluster 2 0
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-set primary1 [Rn 0]
-set primary2 [Rn 1]
-
-proc cmdstat {instace cmd} {
-    return [cmdrstat $cmd $instace]
-}
-
-proc errorstat {instace cmd} {
-    return [errorrstat $cmd $instace]
-}
-
-test "errorstats: rejected call due to MOVED Redirection" {
-    $primary1 config resetstat
-    $primary2 config resetstat
-    assert_match {} [errorstat $primary1 MOVED]
-    assert_match {} [errorstat $primary2 MOVED]
-    # we know that one will have a MOVED reply and one will succeed
-    catch {$primary1 set key b} replyP1
-    catch {$primary2 set key b} replyP2
-    # sort servers so we know which one failed
-    if {$replyP1 eq {OK}} {
-        assert_match {MOVED*} $replyP2
-        set pok $primary1
-        set perr $primary2
-    } else {
-        assert_match {MOVED*} $replyP1
-        set pok $primary2
-        set perr $primary1
-    }
-    assert_match {} [errorstat $pok MOVED]
-    assert_match {*count=1*} [errorstat $perr MOVED]
-    assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat $perr set]
-}
diff --git a/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl b/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
deleted file mode 100644
index 80f68d5d..00000000
--- a/redis-stable/tests/cluster/tests/19-cluster-nodes-slots.tcl
+++ /dev/null
@@ -1,71 +0,0 @@
-# Optimize CLUSTER NODES command by generating all nodes slot topology firstly
-
-source "../tests/includes/init-tests.tcl"
-
-proc cluster_allocate_with_continuous_slots {n} {
-    set slot 16383
-    set avg [expr ($slot+1) / $n]
-    while {$slot >= 0} {
-        set node [expr $slot/$avg >= $n ? $n-1 : $slot/$avg]
-        lappend slots_$node $slot
-        incr slot -1
-    }
-    for {set j 0} {$j < $n} {incr j} {
-        R $j cluster addslots {*}[set slots_${j}]
-    }
-}
-
-proc cluster_create_with_continuous_slots {masters slaves} {
-    cluster_allocate_with_continuous_slots $masters
-    if {$slaves} {
-        cluster_allocate_slaves $masters $slaves
-    }
-    assert_cluster_state ok
-}
-
-test "Create a 2 nodes cluster" {
-    cluster_create_with_continuous_slots 2 2
-}
-
-test "Cluster should start ok" {
-    assert_cluster_state ok
-}
-
-set master1 [Rn 0]
-set master2 [Rn 1]
-
-test "Continuous slots distribution" {
-    assert_match "* 0-8191*" [$master1 CLUSTER NODES]
-    assert_match "* 8192-16383*" [$master2 CLUSTER NODES]
-    assert_match "*0 8191*" [$master1 CLUSTER SLOTS]
-    assert_match "*8192 16383*" [$master2 CLUSTER SLOTS]
-
-    $master1 CLUSTER DELSLOTS 4096
-    assert_match "* 0-4095 4097-8191*" [$master1 CLUSTER NODES]
-    assert_match "*0 4095*4097 8191*" [$master1 CLUSTER SLOTS]
-
-
-    $master2 CLUSTER DELSLOTS 12288
-    assert_match "* 8192-12287 12289-16383*" [$master2 CLUSTER NODES]
-    assert_match "*8192 12287*12289 16383*" [$master2 CLUSTER SLOTS]
-}
-
-test "Discontinuous slots distribution" {
-    # Remove middle slots
-    $master1 CLUSTER DELSLOTS 4092 4094
-    assert_match "* 0-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES]
-    assert_match "*0 4091*4093 4093*4095 4095*4097 8191*" [$master1 CLUSTER SLOTS]
-    $master2 CLUSTER DELSLOTS 12284 12286
-    assert_match "* 8192-12283 12285 12287 12289-16383*" [$master2 CLUSTER NODES]
-    assert_match "*8192 12283*12285 12285*12287 12287*12289 16383*" [$master2 CLUSTER SLOTS]
-
-    # Remove head slots
-    $master1 CLUSTER DELSLOTS 0 2
-    assert_match "* 1 3-4091 4093 4095 4097-8191*" [$master1 CLUSTER NODES]
-    assert_match "*1 1*3 4091*4093 4093*4095 4095*4097 8191*" [$master1 CLUSTER SLOTS]
-
-    # Remove tail slots
-    $master2 CLUSTER DELSLOTS 16380 16382 16383
-    assert_match "* 8192-12283 12285 12287 12289-16379 16381*" [$master2 CLUSTER NODES]
-    assert_match "*8192 12283*12285 12285*12287 12287*12289 16379*16381 16381*" [$master2 CLUSTER SLOTS]
-}
diff --git a/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl b/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
deleted file mode 100644
index 229b3a86..00000000
--- a/redis-stable/tests/cluster/tests/20-half-migrated-slot.tcl
+++ /dev/null
@@ -1,98 +0,0 @@
-# Tests for fixing migrating slot at all stages:
-# 1. when migration is half inited on "migrating" node
-# 2. when migration is half inited on "importing" node
-# 3. migration inited, but not finished
-# 4. migration is half finished on "migrating" node
-# 5. migration is half finished on "importing" node
-
-# TODO: Test is currently disabled until it is stabilized (fixing the test
-# itself or real issues in Redis).
-
-if {false} {
-source "../tests/includes/init-tests.tcl"
-source "../tests/includes/utils.tcl"
-
-test "Create a 2 nodes cluster" {
-    create_cluster 2 0
-    config_set_all_nodes cluster-allow-replica-migration no
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-catch {unset nodefrom}
-catch {unset nodeto}
-
-proc reset_cluster {} {
-    uplevel 1 {
-        $cluster refresh_nodes_map
-        array set nodefrom [$cluster masternode_for_slot 609]
-        array set nodeto [$cluster masternode_notfor_slot 609]
-    }
-}
-
-reset_cluster
-
-$cluster set aga xyz
-
-test "Half init migration in 'migrating' is fixable" {
-    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
-    fix_cluster $nodefrom(addr)
-    assert_equal "xyz" [$cluster get aga]
-}
-
-test "Half init migration in 'importing' is fixable" {
-    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
-    fix_cluster $nodefrom(addr)
-    assert_equal "xyz" [$cluster get aga]
-}
-
-test "Init migration and move key" {
-    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
-    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
-    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
-    wait_for_cluster_propagation
-    assert_equal "xyz" [$cluster get aga]
-    fix_cluster $nodefrom(addr)
-    assert_equal "xyz" [$cluster get aga]
-}
-
-reset_cluster
-
-test "Move key again" {
-    wait_for_cluster_propagation
-    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
-    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
-    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
-    wait_for_cluster_propagation
-    assert_equal "xyz" [$cluster get aga]
-}
-
-test "Half-finish migration" {
-    # half finish migration on 'migrating' node
-    assert_equal {OK} [$nodefrom(link) cluster setslot 609 node $nodeto(id)]
-    fix_cluster $nodefrom(addr)
-    assert_equal "xyz" [$cluster get aga]
-}
-
-reset_cluster
-
-test "Move key back" {
-    # 'aga' key is in 609 slot
-    assert_equal {OK} [$nodefrom(link) cluster setslot 609 migrating $nodeto(id)]
-    assert_equal {OK} [$nodeto(link) cluster setslot 609 importing $nodefrom(id)]
-    assert_equal {OK} [$nodefrom(link) migrate $nodeto(host) $nodeto(port) aga 0 10000]
-    assert_equal "xyz" [$cluster get aga]
-}
-
-test "Half-finish importing" {
-    # Now we half finish 'importing' node
-    assert_equal {OK} [$nodeto(link) cluster setslot 609 node $nodeto(id)]
-    fix_cluster $nodefrom(addr)
-    assert_equal "xyz" [$cluster get aga]
-}
-
-config_set_all_nodes cluster-allow-replica-migration yes
-}
diff --git a/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl b/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
deleted file mode 100644
index ccfff74e..00000000
--- a/redis-stable/tests/cluster/tests/21-many-slot-migration.tcl
+++ /dev/null
@@ -1,64 +0,0 @@
-# Tests for many simlutaneous migrations.
-
-# TODO: Test is currently disabled until it is stabilized (fixing the test
-# itself or real issues in Redis).
-
-if {false} {
-
-source "../tests/includes/init-tests.tcl"
-source "../tests/includes/utils.tcl"
-
-# TODO: This test currently runs without replicas, as failovers (which may
-# happen on lower-end CI platforms) are still not handled properly by the
-# cluster during slot migration (related to #6339).
-
-test "Create a 10 nodes cluster" {
-    create_cluster 10 0
-    config_set_all_nodes cluster-allow-replica-migration no
-}
-
-test "Cluster is up" {
-    assert_cluster_state ok
-}
-
-set cluster [redis_cluster 127.0.0.1:[get_instance_attrib redis 0 port]]
-catch {unset nodefrom}
-catch {unset nodeto}
-
-$cluster refresh_nodes_map
-
-test "Set many keys" {
-    for {set i 0} {$i < 40000} {incr i} {
-        $cluster set key:$i val:$i
-    }
-}
-
-test "Keys are accessible" {
-    for {set i 0} {$i < 40000} {incr i} {
-        assert { [$cluster get key:$i] eq "val:$i" }
-    }
-}
-
-test "Init migration of many slots" {
-    for {set slot 0} {$slot < 1000} {incr slot} {
-        array set nodefrom [$cluster masternode_for_slot $slot]
-        array set nodeto [$cluster masternode_notfor_slot $slot]
-
-        $nodefrom(link) cluster setslot $slot migrating $nodeto(id)
-        $nodeto(link) cluster setslot $slot importing $nodefrom(id)
-    }
-}
-
-test "Fix cluster" {
-    wait_for_cluster_propagation
-    fix_cluster $nodefrom(addr)
-}
-
-test "Keys are accessible" {
-    for {set i 0} {$i < 40000} {incr i} {
-        assert { [$cluster get key:$i] eq "val:$i" }
-    }
-}
-
-config_set_all_nodes cluster-allow-replica-migration yes
-}
diff --git a/redis-stable/tests/cluster/tests/helpers/onlydots.tcl b/redis-stable/tests/cluster/tests/helpers/onlydots.tcl
deleted file mode 100644
index 4a6d1aee..00000000
--- a/redis-stable/tests/cluster/tests/helpers/onlydots.tcl
+++ /dev/null
@@ -1,16 +0,0 @@
-# Read the standard input and only shows dots in the output, filtering out
-# all the other characters. Designed to avoid bufferization so that when
-# we get the output of redis-trib and want to show just the dots, we'll see
-# the dots as soon as redis-trib will output them.
-
-fconfigure stdin -buffering none
-
-while 1 {
-    set c [read stdin 1]
-    if {$c eq {}} {
-        exit 0; # EOF
-    } elseif {$c eq {.}} {
-        puts -nonewline .
-        flush stdout
-    }
-}
diff --git a/redis-stable/tests/cluster/tests/includes/init-tests.tcl b/redis-stable/tests/cluster/tests/includes/init-tests.tcl
deleted file mode 100644
index 466ab8f2..00000000
--- a/redis-stable/tests/cluster/tests/includes/init-tests.tcl
+++ /dev/null
@@ -1,70 +0,0 @@
-# Initialization tests -- most units will start including this.
-
-test "(init) Restart killed instances" {
-    foreach type {redis} {
-        foreach_${type}_id id {
-            if {[get_instance_attrib $type $id pid] == -1} {
-                puts -nonewline "$type/$id "
-                flush stdout
-                restart_instance $type $id
-            }
-        }
-    }
-}
-
-test "Cluster nodes are reachable" {
-    foreach_redis_id id {
-        # Every node should be reachable.
-        wait_for_condition 1000 50 {
-            ([catch {R $id ping} ping_reply] == 0) &&
-            ($ping_reply eq {PONG})
-        } else {
-            catch {R $id ping} err
-            fail "Node #$id keeps replying '$err' to PING."
-        }
-    }
-}
-
-test "Cluster nodes hard reset" {
-    foreach_redis_id id {
-        if {$::valgrind} {
-            set node_timeout 10000
-        } else {
-            set node_timeout 3000
-        }
-        catch {R $id flushall} ; # May fail for readonly slaves.
-        R $id MULTI
-        R $id cluster reset hard
-        R $id cluster set-config-epoch [expr {$id+1}]
-        R $id EXEC
-        R $id config set cluster-node-timeout $node_timeout
-        R $id config set cluster-slave-validity-factor 10
-        R $id config rewrite
-    }
-}
-
-test "Cluster Join and auto-discovery test" {
-    # Join node 0 with 1, 1 with 2, ... and so forth.
-    # If auto-discovery works all nodes will know every other node
-    # eventually.
-    set ids {}
-    foreach_redis_id id {lappend ids $id}
-    for {set j 0} {$j < [expr [llength $ids]-1]} {incr j} {
-        set a [lindex $ids $j]
-        set b [lindex $ids [expr $j+1]]
-        set b_port [get_instance_attrib redis $b port]
-        R $a cluster meet 127.0.0.1 $b_port
-    }
-
-    foreach_redis_id id {
-        wait_for_condition 1000 50 {
-            [llength [get_cluster_nodes $id]] == [llength $ids]
-        } else {
-            fail "Cluster failed to join into a full mesh."
-        }
-    }
-}
-
-test "Before slots allocation, all nodes report cluster failure" {
-    assert_cluster_state fail
-}
diff --git a/redis-stable/tests/cluster/tests/includes/utils.tcl b/redis-stable/tests/cluster/tests/includes/utils.tcl
deleted file mode 100644
index 48c40a05..00000000
--- a/redis-stable/tests/cluster/tests/includes/utils.tcl
+++ /dev/null
@@ -1,25 +0,0 @@
-source "../../../tests/support/cli.tcl"
-
-proc config_set_all_nodes {keyword value} {
-    foreach_redis_id id {
-        R $id config set $keyword $value
-    }
-}
-
-proc fix_cluster {addr} {
-    set code [catch {
-        exec ../../../src/redis-cli {*}[rediscli_tls_config "../../../tests"] --cluster fix $addr << yes
-    } result]
-    if {$code != 0} {
-        puts "redis-cli --cluster fix returns non-zero exit code, output below:\n$result"
-    }
-    # Note: redis-cli --cluster fix may return a non-zero exit code if nodes don't agree,
-    # but we can ignore that and rely on the check below.
-    assert_cluster_state ok
-    wait_for_condition 100 100 {
-        [catch {exec ../../../src/redis-cli {*}[rediscli_tls_config "../../../tests"] --cluster check $addr} result] == 0
-    } else {
-        puts "redis-cli --cluster check returns non-zero exit code, output below:\n$result"
-        fail "Cluster could not settle with configuration"
-    }
-}
diff --git a/redis-stable/tests/cluster/tmp/.gitignore b/redis-stable/tests/cluster/tmp/.gitignore
deleted file mode 100644
index f581f73e..00000000
--- a/redis-stable/tests/cluster/tmp/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-redis_*
-sentinel_*
diff --git a/redis-stable/tests/helpers/bg_block_op.tcl b/redis-stable/tests/helpers/bg_block_op.tcl
deleted file mode 100644
index dc4e1a99..00000000
--- a/redis-stable/tests/helpers/bg_block_op.tcl
+++ /dev/null
@@ -1,55 +0,0 @@
-source tests/support/redis.tcl
-source tests/support/util.tcl
-
-set ::tlsdir "tests/tls"
-
-# This function sometimes writes sometimes blocking-reads from lists/sorted
-# sets. There are multiple processes like this executing at the same time
-# so that we have some chance to trap some corner condition if there is
-# a regression. For this to happen it is important that we narrow the key
-# space to just a few elements, and balance the operations so that it is
-# unlikely that lists and zsets just get more data without ever causing
-# blocking.
-proc bg_block_op {host port db ops tls} {
-    set r [redis $host $port 0 $tls]
-    $r client setname LOAD_HANDLER
-    $r select $db
-
-    for {set j 0} {$j < $ops} {incr j} {
-
-        # List side
-        set k list_[randomInt 10]
-        set k2 list_[randomInt 10]
-        set v [randomValue]
-
-        randpath {
-            randpath {
-                $r rpush $k $v
-            } {
-                $r lpush $k $v
-            }
-        } {
-            $r blpop $k 2
-        } {
-            $r blpop $k $k2 2
-        }
-
-        # Zset side
-        set k zset_[randomInt 10]
-        set k2 zset_[randomInt 10]
-        set v1 [randomValue]
-        set v2 [randomValue]
-
-        randpath {
-            $r zadd $k [randomInt 10000] $v
-        } {
-            $r zadd $k [randomInt 10000] $v [randomInt 10000] $v2
-        } {
-            $r bzpopmin $k 2
-        } {
-            $r bzpopmax $k 2
-        }
-    }
-}
-
-bg_block_op [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3] [lindex $argv 4]
diff --git a/redis-stable/tests/helpers/bg_complex_data.tcl b/redis-stable/tests/helpers/bg_complex_data.tcl
deleted file mode 100644
index 9c0044e7..00000000
--- a/redis-stable/tests/helpers/bg_complex_data.tcl
+++ /dev/null
@@ -1,13 +0,0 @@
-source tests/support/redis.tcl
-source tests/support/util.tcl
-
-set ::tlsdir "tests/tls"
-
-proc bg_complex_data {host port db ops tls} {
-    set r [redis $host $port 0 $tls]
-    $r client setname LOAD_HANDLER
-    $r select $db
-    createComplexDataset $r $ops
-}
-
-bg_complex_data [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3] [lindex $argv 4]
diff --git a/redis-stable/tests/helpers/fake_redis_node.tcl b/redis-stable/tests/helpers/fake_redis_node.tcl
deleted file mode 100644
index a12d87fe..00000000
--- a/redis-stable/tests/helpers/fake_redis_node.tcl
+++ /dev/null
@@ -1,58 +0,0 @@
-# A fake Redis node for replaying predefined/expected traffic with a client.
-#
-# Usage: tclsh fake_redis_node.tcl PORT COMMAND REPLY [ COMMAND REPLY [ ... ] ]
-#
-# Commands are given as space-separated strings, e.g. "GET foo", and replies as
-# RESP-encoded replies minus the trailing \r\n, e.g. "+OK".
-
-set port [lindex $argv 0];
-set expected_traffic [lrange $argv 1 end];
-
-# Reads and parses a command from a socket and returns it as a space-separated
-# string, e.g. "set foo bar".
-proc read_command {sock} {
-    set char [read $sock 1]
-    switch $char {
-        * {
-            set numargs [gets $sock]
-            set result {}
-            for {set i 0} {$i<$numargs} {incr i} {
-                read $sock 1;       # dollar sign
-                set len [gets $sock]
-                set str [read $sock $len]
-                gets $sock;         # trailing \r\n
-                lappend result $str
-            }
-            return $result
-        }
-        {} {
-            # EOF
-            return {}
-        }
-        default {
-            # Non-RESP command
-            set rest [gets $sock]
-            return "$char$rest"
-        }
-    }
-}
-
-proc accept {sock host port} {
-    global expected_traffic
-    foreach {expect_cmd reply} $expected_traffic {
-        if {[eof $sock]} {break}
-        set cmd [read_command $sock]
-        if {[string equal -nocase $cmd $expect_cmd]} {
-            puts $sock $reply
-            flush $sock
-        } else {
-            puts $sock "-ERR unexpected command $cmd"
-            break
-        }
-    }
-    close $sock
-}
-
-socket -server accept $port
-after 5000 set done timeout
-vwait done
diff --git a/redis-stable/tests/helpers/gen_write_load.tcl b/redis-stable/tests/helpers/gen_write_load.tcl
deleted file mode 100644
index 568f5cde..00000000
--- a/redis-stable/tests/helpers/gen_write_load.tcl
+++ /dev/null
@@ -1,18 +0,0 @@
-source tests/support/redis.tcl
-
-set ::tlsdir "tests/tls"
-
-proc gen_write_load {host port seconds tls} {
-    set start_time [clock seconds]
-    set r [redis $host $port 1 $tls]
-    $r client setname LOAD_HANDLER
-    $r select 9
-    while 1 {
-        $r set [expr rand()] [expr rand()]
-        if {[clock seconds]-$start_time > $seconds} {
-            exit 0
-        }
-    }
-}
-
-gen_write_load [lindex $argv 0] [lindex $argv 1] [lindex $argv 2] [lindex $argv 3]
diff --git a/redis-stable/tests/instances.tcl b/redis-stable/tests/instances.tcl
deleted file mode 100644
index 1395efa0..00000000
--- a/redis-stable/tests/instances.tcl
+++ /dev/null
@@ -1,673 +0,0 @@
-# Multi-instance test framework.
-# This is used in order to test Sentinel and Redis Cluster, and provides
-# basic capabilities for spawning and handling N parallel Redis / Sentinel
-# instances.
-#
-# Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
-# This software is released under the BSD License. See the COPYING file for
-# more information.
-
-package require Tcl 8.5
-
-set tcl_precision 17
-source ../support/redis.tcl
-source ../support/util.tcl
-source ../support/server.tcl
-source ../support/test.tcl
-
-set ::verbose 0
-set ::valgrind 0
-set ::tls 0
-set ::pause_on_error 0
-set ::dont_clean 0
-set ::simulate_error 0
-set ::failed 0
-set ::sentinel_instances {}
-set ::redis_instances {}
-set ::global_config {}
-set ::sentinel_base_port 20000
-set ::redis_base_port 30000
-set ::redis_port_count 1024
-set ::host "127.0.0.1"
-set ::leaked_fds_file [file normalize "tmp/leaked_fds.txt"]
-set ::pids {} ; # We kill everything at exit
-set ::dirs {} ; # We remove all the temp dirs at exit
-set ::run_matching {} ; # If non empty, only tests matching pattern are run.
-
-if {[catch {cd tmp}]} {
-    puts "tmp directory not found."
-    puts "Please run this test from the Redis source root."
-    exit 1
-}
-
-# Execute the specified instance of the server specified by 'type', using
-# the provided configuration file. Returns the PID of the process.
-proc exec_instance {type dirname cfgfile} {
-    if {$type eq "redis"} {
-        set prgname redis-server
-    } elseif {$type eq "sentinel"} {
-        set prgname redis-sentinel
-    } else {
-        error "Unknown instance type."
-    }
-
-    set errfile [file join $dirname err.txt]
-    if {$::valgrind} {
-        set pid [exec valgrind --track-origins=yes --suppressions=../../../src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full ../../../src/${prgname} $cfgfile 2>> $errfile &]
-    } else {
-        set pid [exec ../../../src/${prgname} $cfgfile 2>> $errfile &]
-    }
-    return $pid
-}
-
-# Spawn a redis or sentinel instance, depending on 'type'.
-proc spawn_instance {type base_port count {conf {}} {base_conf_file ""}} {
-    for {set j 0} {$j < $count} {incr j} {
-        set port [find_available_port $base_port $::redis_port_count]
-        # plaintext port (only used for TLS cluster)
-        set pport 0
-        # Create a directory for this instance.
-        set dirname "${type}_${j}"
-        lappend ::dirs $dirname
-        catch {exec rm -rf $dirname}
-        file mkdir $dirname
-
-        # Write the instance config file.
-        set cfgfile [file join $dirname $type.conf]
-        if {$base_conf_file ne ""} {
-            file copy -- $base_conf_file $cfgfile
-            set cfg [open $cfgfile a+]
-        } else {
-            set cfg [open $cfgfile w]
-        }
-
-        if {$::tls} {
-            puts $cfg "tls-port $port"
-            puts $cfg "tls-replication yes"
-            puts $cfg "tls-cluster yes"
-            # plaintext port, only used by plaintext clients in a TLS cluster
-            set pport [find_available_port $base_port $::redis_port_count]
-            puts $cfg "port $pport"
-            puts $cfg [format "tls-cert-file %s/../../tls/server.crt" [pwd]]
-            puts $cfg [format "tls-key-file %s/../../tls/server.key" [pwd]]
-            puts $cfg [format "tls-client-cert-file %s/../../tls/client.crt" [pwd]]
-            puts $cfg [format "tls-client-key-file %s/../../tls/client.key" [pwd]]
-            puts $cfg [format "tls-dh-params-file %s/../../tls/redis.dh" [pwd]]
-            puts $cfg [format "tls-ca-cert-file %s/../../tls/ca.crt" [pwd]]
-            puts $cfg "loglevel debug"
-        } else {
-            puts $cfg "port $port"
-        }
-        puts $cfg "dir ./$dirname"
-        puts $cfg "logfile log.txt"
-        # Add additional config files
-        foreach directive $conf {
-            puts $cfg $directive
-        }
-        dict for {name val} $::global_config {
-            puts $cfg "$name $val"
-        }
-        close $cfg
-
-        # Finally exec it and remember the pid for later cleanup.
-        set retry 100
-        while {$retry} {
-            set pid [exec_instance $type $dirname $cfgfile]
-
-            # Check availability
-            if {[server_is_up 127.0.0.1 $port 100] == 0} {
-                puts "Starting $type #$j at port $port failed, try another"
-                incr retry -1
-                set port [find_available_port $base_port $::redis_port_count]
-                set cfg [open $cfgfile a+]
-                if {$::tls} {
-                    puts $cfg "tls-port $port"
-                    set pport [find_available_port $base_port $::redis_port_count]
-                    puts $cfg "port $pport"
-                } else {
-                    puts $cfg "port $port"
-                }
-                close $cfg
-            } else {
-                puts "Starting $type #$j at port $port"
-                lappend ::pids $pid
-                break
-            }
-        }
-
-        # Check availability finally
-        if {[server_is_up $::host $port 100] == 0} {
-            set logfile [file join $dirname log.txt]
-            puts [exec tail $logfile]
-            abort_sentinel_test "Problems starting $type #$j: ping timeout, maybe server start failed, check $logfile"
-        }
-
-        # Push the instance into the right list
-        set link [redis $::host $port 0 $::tls]
-        $link reconnect 1
-        lappend ::${type}_instances [list \
-            pid $pid \
-            host $::host \
-            port $port \
-            plaintext-port $pport \
-            link $link \
-        ]
-    }
-}
-
-proc log_crashes {} {
-    set start_pattern {*REDIS BUG REPORT START*}
-    set logs [glob */log.txt]
-    foreach log $logs {
-        set fd [open $log]
-        set found 0
-        while {[gets $fd line] >= 0} {
-            if {[string match $start_pattern $line]} {
-                puts "\n*** Crash report found in $log ***"
-                set found 1
-            }
-            if {$found} {
-                puts $line
-                incr ::failed
-            }
-        }
-    }
-
-    set logs [glob */err.txt]
-    foreach log $logs {
-        set res [find_valgrind_errors $log true]
-        if {$res != ""} {
-            puts $res
-            incr ::failed
-        }
-    }
-}
-
-proc is_alive pid {
-    if {[catch {exec ps -p $pid} err]} {
-        return 0
-    } else {
-        return 1
-    }
-}
-
-proc stop_instance pid {
-    catch {exec kill $pid}
-    # Node might have been stopped in the test
-    catch {exec kill -SIGCONT $pid}
-    if {$::valgrind} {
-        set max_wait 60000
-    } else {
-        set max_wait 10000
-    }
-    while {[is_alive $pid]} {
-        incr wait 10
-
-        if {$wait >= $max_wait} {
-            puts "Forcing process $pid to exit..."
-            catch {exec kill -KILL $pid}
-        } elseif {$wait % 1000 == 0} {
-            puts "Waiting for process $pid to exit..."
-        }
-        after 10
-    }
-}
-
-proc cleanup {} {
-    puts "Cleaning up..."
-    foreach pid $::pids {
-        puts "killing stale instance $pid"
-        stop_instance $pid
-    }
-    log_crashes
-    if {$::dont_clean} {
-        return
-    }
-    foreach dir $::dirs {
-        catch {exec rm -rf $dir}
-    }
-}
-
-proc abort_sentinel_test msg {
-    incr ::failed
-    puts "WARNING: Aborting the test."
-    puts ">>>>>>>> $msg"
-    if {$::pause_on_error} pause_on_error
-    cleanup
-    exit 1
-}
-
-proc parse_options {} {
-    for {set j 0} {$j < [llength $::argv]} {incr j} {
-        set opt [lindex $::argv $j]
-        set val [lindex $::argv [expr $j+1]]
-        if {$opt eq "--single"} {
-            incr j
-            set ::run_matching "*${val}*"
-        } elseif {$opt eq "--pause-on-error"} {
-            set ::pause_on_error 1
-        } elseif {$opt eq {--dont-clean}} {
-            set ::dont_clean 1
-        } elseif {$opt eq "--fail"} {
-            set ::simulate_error 1
-        } elseif {$opt eq {--valgrind}} {
-            set ::valgrind 1
-        } elseif {$opt eq {--host}} {
-            incr j
-            set ::host ${val}
-        } elseif {$opt eq {--tls}} {
-            package require tls 1.6
-            ::tls::init \
-                -cafile "$::tlsdir/ca.crt" \
-                -certfile "$::tlsdir/client.crt" \
-                -keyfile "$::tlsdir/client.key"
-            set ::tls 1
-        } elseif {$opt eq {--config}} {
-            set val2 [lindex $::argv [expr $j+2]]
-            dict set ::global_config $val $val2
-            incr j 2
-        } elseif {$opt eq "--help"} {
-            puts "--single <pattern>      Only runs tests specified by pattern."
-            puts "--dont-clean            Keep log files on exit."
-            puts "--pause-on-error        Pause for manual inspection on error."
-            puts "--fail                  Simulate a test failure."
-            puts "--valgrind              Run with valgrind."
-            puts "--tls                   Run tests in TLS mode."
-            puts "--host <host>           Use hostname instead of 127.0.0.1."
-            puts "--config <k> <v>        Extra config argument(s)."
-            puts "--help                  Shows this help."
-            exit 0
-        } else {
-            puts "Unknown option $opt"
-            exit 1
-        }
-    }
-}
-
-# If --pause-on-error option was passed at startup this function is called
-# on error in order to give the developer a chance to understand more about
-# the error condition while the instances are still running.
-proc pause_on_error {} {
-    puts ""
-    puts [colorstr yellow "*** Please inspect the error now ***"]
-    puts "\nType \"continue\" to resume the test, \"help\" for help screen.\n"
-    while 1 {
-        puts -nonewline "> "
-        flush stdout
-        set line [gets stdin]
-        set argv [split $line " "]
-        set cmd [lindex $argv 0]
-        if {$cmd eq {continue}} {
-            break
-        } elseif {$cmd eq {show-redis-logs}} {
-            set count 10
-            if {[lindex $argv 1] ne {}} {set count [lindex $argv 1]}
-            foreach_redis_id id {
-                puts "=== REDIS $id ===="
-                puts [exec tail -$count redis_$id/log.txt]
-                puts "---------------------\n"
-            }
-        } elseif {$cmd eq {show-sentinel-logs}} {
-            set count 10
-            if {[lindex $argv 1] ne {}} {set count [lindex $argv 1]}
-            foreach_sentinel_id id {
-                puts "=== SENTINEL $id ===="
-                puts [exec tail -$count sentinel_$id/log.txt]
-                puts "---------------------\n"
-            }
-        } elseif {$cmd eq {ls}} {
-            foreach_redis_id id {
-                puts -nonewline "Redis $id"
-                set errcode [catch {
-                    set str {}
-                    append str "@[RI $id tcp_port]: "
-                    append str "[RI $id role] "
-                    if {[RI $id role] eq {slave}} {
-                        append str "[RI $id master_host]:[RI $id master_port]"
-                    }
-                    set str
-                } retval]
-                if {$errcode} {
-                    puts " -- $retval"
-                } else {
-                    puts $retval
-                }
-            }
-            foreach_sentinel_id id {
-                puts -nonewline "Sentinel $id"
-                set errcode [catch {
-                    set str {}
-                    append str "@[SI $id tcp_port]: "
-                    append str "[join [S $id sentinel get-master-addr-by-name mymaster]]"
-                    set str
-                } retval]
-                if {$errcode} {
-                    puts " -- $retval"
-                } else {
-                    puts $retval
-                }
-            }
-        } elseif {$cmd eq {help}} {
-            puts "ls                     List Sentinel and Redis instances."
-            puts "show-sentinel-logs \[N\] Show latest N lines of logs."
-            puts "show-redis-logs \[N\]    Show latest N lines of logs."
-            puts "S <id> cmd ... arg     Call command in Sentinel <id>."
-            puts "R <id> cmd ... arg     Call command in Redis <id>."
-            puts "SI <id> <field>        Show Sentinel <id> INFO <field>."
-            puts "RI <id> <field>        Show Redis <id> INFO <field>."
-            puts "continue               Resume test."
-        } else {
-            set errcode [catch {eval $line} retval]
-            if {$retval ne {}} {puts "$retval"}
-        }
-    }
-}
-
-# We redefine 'test' as for Sentinel we don't use the server-client
-# architecture for the test, everything is sequential.
-proc test {descr code} {
-    set ts [clock format [clock seconds] -format %H:%M:%S]
-    puts -nonewline "$ts> $descr: "
-    flush stdout
-
-    if {[catch {set retval [uplevel 1 $code]} error]} {
-        incr ::failed
-        if {[string match "assertion:*" $error]} {
-            set msg [string range $error 10 end]
-            puts [colorstr red $msg]
-            if {$::pause_on_error} pause_on_error
-            puts "(Jumping to next unit after error)"
-            return -code continue
-        } else {
-            # Re-raise, let handler up the stack take care of this.
-            error $error $::errorInfo
-        }
-    } else {
-        puts [colorstr green OK]
-    }
-}
-
-# Check memory leaks when running on OSX using the "leaks" utility.
-proc check_leaks instance_types {
-    if {[string match {*Darwin*} [exec uname -a]]} {
-        puts -nonewline "Testing for memory leaks..."; flush stdout
-        foreach type $instance_types {
-            foreach_instance_id [set ::${type}_instances] id {
-                if {[instance_is_killed $type $id]} continue
-                set pid [get_instance_attrib $type $id pid]
-                set output {0 leaks}
-                catch {exec leaks $pid} output
-                if {[string match {*process does not exist*} $output] ||
-                    [string match {*cannot examine*} $output]} {
-                    # In a few tests we kill the server process.
-                    set output "0 leaks"
-                } else {
-                    puts -nonewline "$type/$pid "
-                    flush stdout
-                }
-                if {![string match {*0 leaks*} $output]} {
-                    puts [colorstr red "=== MEMORY LEAK DETECTED ==="]
-                    puts "Instance type $type, ID $id:"
-                    puts $output
-                    puts "==="
-                    incr ::failed
-                }
-            }
-        }
-        puts ""
-    }
-}
-
-# Execute all the units inside the 'tests' directory.
-proc run_tests {} {
-    set tests [lsort [glob ../tests/*]]
-    foreach test $tests {
-        # Remove leaked_fds file before starting
-        if {$::leaked_fds_file != "" && [file exists $::leaked_fds_file]} {
-            file delete $::leaked_fds_file
-        }
-
-        if {$::run_matching ne {} && [string match $::run_matching $test] == 0} {
-            continue
-        }
-        if {[file isdirectory $test]} continue
-        puts [colorstr yellow "Testing unit: [lindex [file split $test] end]"]
-        source $test
-        check_leaks {redis sentinel}
-
-        # Check if a leaked fds file was created and abort the test.
-        if {$::leaked_fds_file != "" && [file exists $::leaked_fds_file]} {
-            puts [colorstr red "ERROR: Sentinel has leaked fds to scripts:"]
-            puts [exec cat $::leaked_fds_file]
-            puts "----"
-            incr ::failed
-        }
-    }
-}
-
-# Print a message and exists with 0 / 1 according to zero or more failures.
-proc end_tests {} {
-    if {$::failed == 0 } {
-        puts "GOOD! No errors."
-        exit 0
-    } else {
-        puts "WARNING $::failed test(s) failed."
-        exit 1
-    }
-}
-
-# The "S" command is used to interact with the N-th Sentinel.
-# The general form is:
-#
-# S <sentinel-id> command arg arg arg ...
-#
-# Example to ping the Sentinel 0 (first instance): S 0 PING
-proc S {n args} {
-    set s [lindex $::sentinel_instances $n]
-    [dict get $s link] {*}$args
-}
-
-# Returns a Redis instance by index.
-# Example:
-#     [Rn 0] info
-proc Rn {n} {
-    return [dict get [lindex $::redis_instances $n] link]
-}
-
-# Like R but to chat with Redis instances.
-proc R {n args} {
-    [Rn $n] {*}$args
-}
-
-proc get_info_field {info field} {
-    set fl [string length $field]
-    append field :
-    foreach line [split $info "\n"] {
-        set line [string trim $line "\r\n "]
-        if {[string range $line 0 $fl] eq $field} {
-            return [string range $line [expr {$fl+1}] end]
-        }
-    }
-    return {}
-}
-
-proc SI {n field} {
-    get_info_field [S $n info] $field
-}
-
-proc RI {n field} {
-    get_info_field [R $n info] $field
-}
-
-proc RPort {n} {
-    if {$::tls} {
-        return [lindex [R $n config get tls-port] 1]
-    } else {
-        return [lindex [R $n config get port] 1]
-    }
-}
-
-# Iterate over IDs of sentinel or redis instances.
-proc foreach_instance_id {instances idvar code} {
-    upvar 1 $idvar id
-    for {set id 0} {$id < [llength $instances]} {incr id} {
-        set errcode [catch {uplevel 1 $code} result]
-        if {$errcode == 1} {
-            error $result $::errorInfo $::errorCode
-        } elseif {$errcode == 4} {
-            continue
-        } elseif {$errcode == 3} {
-            break
-        } elseif {$errcode != 0} {
-            return -code $errcode $result
-        }
-    }
-}
-
-proc foreach_sentinel_id {idvar code} {
-    set errcode [catch {uplevel 1 [list foreach_instance_id $::sentinel_instances $idvar $code]} result]
-    return -code $errcode $result
-}
-
-proc foreach_redis_id {idvar code} {
-    set errcode [catch {uplevel 1 [list foreach_instance_id $::redis_instances $idvar $code]} result]
-    return -code $errcode $result
-}
-
-# Get the specific attribute of the specified instance type, id.
-proc get_instance_attrib {type id attrib} {
-    dict get [lindex [set ::${type}_instances] $id] $attrib
-}
-
-# Set the specific attribute of the specified instance type, id.
-proc set_instance_attrib {type id attrib newval} {
-    set d [lindex [set ::${type}_instances] $id]
-    dict set d $attrib $newval
-    lset ::${type}_instances $id $d
-}
-
-# Create a master-slave cluster of the given number of total instances.
-# The first instance "0" is the master, all others are configured as
-# slaves.
-proc create_redis_master_slave_cluster n {
-    foreach_redis_id id {
-        if {$id == 0} {
-            # Our master.
-            R $id slaveof no one
-            R $id flushall
-        } elseif {$id < $n} {
-            R $id slaveof [get_instance_attrib redis 0 host] \
-                          [get_instance_attrib redis 0 port]
-        } else {
-            # Instances not part of the cluster.
-            R $id slaveof no one
-        }
-    }
-    # Wait for all the slaves to sync.
-    wait_for_condition 1000 50 {
-        [RI 0 connected_slaves] == ($n-1)
-    } else {
-        fail "Unable to create a master-slaves cluster."
-    }
-}
-
-proc get_instance_id_by_port {type port} {
-    foreach_${type}_id id {
-        if {[get_instance_attrib $type $id port] == $port} {
-            return $id
-        }
-    }
-    fail "Instance $type port $port not found."
-}
-
-# Kill an instance of the specified type/id with SIGKILL.
-# This function will mark the instance PID as -1 to remember that this instance
-# is no longer running and will remove its PID from the list of pids that
-# we kill at cleanup.
-#
-# The instance can be restarted with restart-instance.
-proc kill_instance {type id} {
-    set pid [get_instance_attrib $type $id pid]
-    set port [get_instance_attrib $type $id port]
-
-    if {$pid == -1} {
-        error "You tried to kill $type $id twice."
-    }
-
-    stop_instance $pid
-    set_instance_attrib $type $id pid -1
-    set_instance_attrib $type $id link you_tried_to_talk_with_killed_instance
-
-    # Remove the PID from the list of pids to kill at exit.
-    set ::pids [lsearch -all -inline -not -exact $::pids $pid]
-
-    # Wait for the port it was using to be available again, so that's not
-    # an issue to start a new server ASAP with the same port.
-    set retry 100
-    while {[incr retry -1]} {
-        set port_is_free [catch {set s [socket 127.0.0.1 $port]}]
-        if {$port_is_free} break
-        catch {close $s}
-        after 100
-    }
-    if {$retry == 0} {
-        error "Port $port does not return available after killing instance."
-    }
-}
-
-# Return true of the instance of the specified type/id is killed.
-proc instance_is_killed {type id} {
-    set pid [get_instance_attrib $type $id pid]
-    expr {$pid == -1}
-}
-
-# Restart an instance previously killed by kill_instance
-proc restart_instance {type id} {
-    set dirname "${type}_${id}"
-    set cfgfile [file join $dirname $type.conf]
-    set port [get_instance_attrib $type $id port]
-
-    # Execute the instance with its old setup and append the new pid
-    # file for cleanup.
-    set pid [exec_instance $type $dirname $cfgfile]
-    set_instance_attrib $type $id pid $pid
-    lappend ::pids $pid
-
-    # Check that the instance is running
-    if {[server_is_up 127.0.0.1 $port 100] == 0} {
-        set logfile [file join $dirname log.txt]
-        puts [exec tail $logfile]
-        abort_sentinel_test "Problems starting $type #$id: ping timeout, maybe server start failed, check $logfile"
-    }
-
-    # Connect with it with a fresh link
-    set link [redis 127.0.0.1 $port 0 $::tls]
-    $link reconnect 1
-    set_instance_attrib $type $id link $link
-
-    # Make sure the instance is not loading the dataset when this
-    # function returns.
-    while 1 {
-        catch {[$link ping]} retval
-        if {[string match {*LOADING*} $retval]} {
-            after 100
-            continue
-        } else {
-            break
-        }
-    }
-}
-
-proc redis_deferring_client {type id} {
-    set port [get_instance_attrib $type $id port]
-    set host [get_instance_attrib $type $id host]
-    set client [redis $host $port 1 $::tls]
-    return $client
-}
-
-proc redis_client {type id} {
-    set port [get_instance_attrib $type $id port]
-    set host [get_instance_attrib $type $id host]
-    set client [redis $host $port 0 $::tls]
-    return $client
-}
diff --git a/redis-stable/tests/integration/aof-race.tcl b/redis-stable/tests/integration/aof-race.tcl
deleted file mode 100644
index 2991e796..00000000
--- a/redis-stable/tests/integration/aof-race.tcl
+++ /dev/null
@@ -1,36 +0,0 @@
-set defaults { appendonly {yes} appendfilename {appendonly.aof} aof-use-rdb-preamble {no} }
-set server_path [tmpdir server.aof]
-set aof_path "$server_path/appendonly.aof"
-
-proc start_server_aof {overrides code} {
-    upvar defaults defaults srv srv server_path server_path
-    set config [concat $defaults $overrides]
-    start_server [list overrides $config] $code
-}
-
-tags {"aof"} {
-    # Specific test for a regression where internal buffers were not properly
-    # cleaned after a child responsible for an AOF rewrite exited. This buffer
-    # was subsequently appended to the new AOF, resulting in duplicate commands.
-    start_server_aof [list dir $server_path] {
-        set client [redis [srv host] [srv port] 0 $::tls]
-        set bench [open "|src/redis-benchmark -q -s [srv unixsocket] -c 20 -n 20000 incr foo" "r+"]
-
-        after 100
-
-        # Benchmark should be running by now: start background rewrite
-        $client bgrewriteaof
-
-        # Read until benchmark pipe reaches EOF
-        while {[string length [read $bench]] > 0} {}
-
-        # Check contents of foo
-        assert_equal 20000 [$client get foo]
-    }
-
-    # Restart server to replay AOF
-    start_server_aof [list dir $server_path] {
-        set client [redis [srv host] [srv port] 0 $::tls]
-        assert_equal 20000 [$client get foo]
-    }
-}
diff --git a/redis-stable/tests/integration/aof.tcl b/redis-stable/tests/integration/aof.tcl
deleted file mode 100644
index abe2dc10..00000000
--- a/redis-stable/tests/integration/aof.tcl
+++ /dev/null
@@ -1,298 +0,0 @@
-set defaults { appendonly {yes} appendfilename {appendonly.aof} }
-set server_path [tmpdir server.aof]
-set aof_path "$server_path/appendonly.aof"
-
-proc append_to_aof {str} {
-    upvar fp fp
-    puts -nonewline $fp $str
-}
-
-proc create_aof {code} {
-    upvar fp fp aof_path aof_path
-    set fp [open $aof_path w+]
-    uplevel 1 $code
-    close $fp
-}
-
-proc start_server_aof {overrides code} {
-    upvar defaults defaults srv srv server_path server_path
-    set config [concat $defaults $overrides]
-    set srv [start_server [list overrides $config]]
-    uplevel 1 $code
-    kill_server $srv
-}
-
-tags {"aof"} {
-    ## Server can start when aof-load-truncated is set to yes and AOF
-    ## is truncated, with an incomplete MULTI block.
-    create_aof {
-        append_to_aof [formatCommand set foo hello]
-        append_to_aof [formatCommand multi]
-        append_to_aof [formatCommand set bar world]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated yes] {
-        test "Unfinished MULTI: Server should start if load-truncated is yes" {
-            assert_equal 1 [is_alive $srv]
-        }
-    }
-
-    ## Should also start with truncated AOF without incomplete MULTI block.
-    create_aof {
-        append_to_aof [formatCommand incr foo]
-        append_to_aof [formatCommand incr foo]
-        append_to_aof [formatCommand incr foo]
-        append_to_aof [formatCommand incr foo]
-        append_to_aof [formatCommand incr foo]
-        append_to_aof [string range [formatCommand incr foo] 0 end-1]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated yes] {
-        test "Short read: Server should start if load-truncated is yes" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "Truncated AOF loaded: we expect foo to be equal to 5" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert {[$client get foo] eq "5"}
-        }
-
-        test "Append a new command after loading an incomplete AOF" {
-            $client incr foo
-        }
-    }
-
-    # Now the AOF file is expected to be correct
-    start_server_aof [list dir $server_path aof-load-truncated yes] {
-        test "Short read + command: Server should start" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "Truncated AOF loaded: we expect foo to be equal to 6 now" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert {[$client get foo] eq "6"}
-        }
-    }
-
-    ## Test that the server exits when the AOF contains a format error
-    create_aof {
-        append_to_aof [formatCommand set foo hello]
-        append_to_aof "!!!"
-        append_to_aof [formatCommand set foo hello]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated yes] {
-        test "Bad format: Server should have logged an error" {
-            set pattern "*Bad file format reading the append only file*"
-            set retry 10
-            while {$retry} {
-                set result [exec tail -1 < [dict get $srv stdout]]
-                if {[string match $pattern $result]} {
-                    break
-                }
-                incr retry -1
-                after 1000
-            }
-            if {$retry == 0} {
-                error "assertion:expected error not found on config file"
-            }
-        }
-    }
-
-    ## Test the server doesn't start when the AOF contains an unfinished MULTI
-    create_aof {
-        append_to_aof [formatCommand set foo hello]
-        append_to_aof [formatCommand multi]
-        append_to_aof [formatCommand set bar world]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated no] {
-        test "Unfinished MULTI: Server should have logged an error" {
-            set pattern "*Unexpected end of file reading the append only file*"
-            set retry 10
-            while {$retry} {
-                set result [exec tail -1 < [dict get $srv stdout]]
-                if {[string match $pattern $result]} {
-                    break
-                }
-                incr retry -1
-                after 1000
-            }
-            if {$retry == 0} {
-                error "assertion:expected error not found on config file"
-            }
-        }
-    }
-
-    ## Test that the server exits when the AOF contains a short read
-    create_aof {
-        append_to_aof [formatCommand set foo hello]
-        append_to_aof [string range [formatCommand set bar world] 0 end-1]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated no] {
-        test "Short read: Server should have logged an error" {
-            set pattern "*Unexpected end of file reading the append only file*"
-            set retry 10
-            while {$retry} {
-                set result [exec tail -1 < [dict get $srv stdout]]
-                if {[string match $pattern $result]} {
-                    break
-                }
-                incr retry -1
-                after 1000
-            }
-            if {$retry == 0} {
-                error "assertion:expected error not found on config file"
-            }
-        }
-    }
-
-    ## Test that redis-check-aof indeed sees this AOF is not valid
-    test "Short read: Utility should confirm the AOF is not valid" {
-        catch {
-            exec src/redis-check-aof $aof_path
-        } result
-        assert_match "*not valid*" $result
-    }
-
-    test "Short read: Utility should show the abnormal line num in AOF" {
-        create_aof {
-            append_to_aof [formatCommand set foo hello]
-            append_to_aof "!!!"
-        }
-
-        catch {
-            exec src/redis-check-aof $aof_path
-        } result
-        assert_match "*ok_up_to_line=8*" $result
-    }
-
-    test "Short read: Utility should be able to fix the AOF" {
-        set result [exec src/redis-check-aof --fix $aof_path << "y\n"]
-        assert_match "*Successfully truncated AOF*" $result
-    }
-
-    ## Test that the server can be started using the truncated AOF
-    start_server_aof [list dir $server_path aof-load-truncated no] {
-        test "Fixed AOF: Server should have been started" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "Fixed AOF: Keyspace should contain values that were parseable" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert_equal "hello" [$client get foo]
-            assert_equal "" [$client get bar]
-        }
-    }
-
-    ## Test that SPOP (that modifies the client's argc/argv) is correctly free'd
-    create_aof {
-        append_to_aof [formatCommand sadd set foo]
-        append_to_aof [formatCommand sadd set bar]
-        append_to_aof [formatCommand spop set]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated no] {
-        test "AOF+SPOP: Server should have been started" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "AOF+SPOP: Set should have 1 member" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert_equal 1 [$client scard set]
-        }
-    }
-
-    ## Uses the alsoPropagate() API.
-    create_aof {
-        append_to_aof [formatCommand sadd set foo]
-        append_to_aof [formatCommand sadd set bar]
-        append_to_aof [formatCommand sadd set gah]
-        append_to_aof [formatCommand spop set 2]
-    }
-
-    start_server_aof [list dir $server_path] {
-        test "AOF+SPOP: Server should have been started" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "AOF+SPOP: Set should have 1 member" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert_equal 1 [$client scard set]
-        }
-    }
-
-    ## Test that EXPIREAT is loaded correctly
-    create_aof {
-        append_to_aof [formatCommand rpush list foo]
-        append_to_aof [formatCommand expireat list 1000]
-        append_to_aof [formatCommand rpush list bar]
-    }
-
-    start_server_aof [list dir $server_path aof-load-truncated no] {
-        test "AOF+EXPIRE: Server should have been started" {
-            assert_equal 1 [is_alive $srv]
-        }
-
-        test "AOF+EXPIRE: List should be empty" {
-            set client [redis [dict get $srv host] [dict get $srv port] 0 $::tls]
-            wait_done_loading $client
-            assert_equal 0 [$client llen list]
-        }
-    }
-
-    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof}}} {
-        test {Redis should not try to convert DEL into EXPIREAT for EXPIRE -1} {
-            r set x 10
-            r expire x -1
-        }
-    }
-
-    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof} appendfsync always}} {
-        test {AOF fsync always barrier issue} {
-            set rd [redis_deferring_client]
-            # Set a sleep when aof is flushed, so that we have a chance to look
-            # at the aof size and detect if the response of an incr command
-            # arrives before the data was written (and hopefully fsynced)
-            # We create a big reply, which will hopefully not have room in the
-            # socket buffers, and will install a write handler, then we sleep
-            # a big and issue the incr command, hoping that the last portion of
-            # the output buffer write, and the processing of the incr will happen
-            # in the same event loop cycle.
-            # Since the socket buffers and timing are unpredictable, we fuzz this
-            # test with slightly different sizes and sleeps a few times.
-            for {set i 0} {$i < 10} {incr i} {
-                r debug aof-flush-sleep 0
-                r del x
-                r setrange x [expr {int(rand()*5000000)+10000000}] x
-                r debug aof-flush-sleep 500000
-                set aof [file join [lindex [r config get dir] 1] appendonly.aof]
-                set size1 [file size $aof]
-                $rd get x
-                after [expr {int(rand()*30)}]
-                $rd incr new_value
-                $rd read
-                $rd read
-                set size2 [file size $aof]
-                assert {$size1 != $size2}
-            }
-        }
-    }
-
-    start_server {overrides {appendonly {yes} appendfilename {appendonly.aof}}} {
-        test {GETEX should not append to AOF} {
-            set aof [file join [lindex [r config get dir] 1] appendonly.aof]
-            r set foo bar
-            set before [file size $aof]
-            r getex foo
-            set after [file size $aof]
-            assert_equal $before $after
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/block-repl.tcl b/redis-stable/tests/integration/block-repl.tcl
deleted file mode 100644
index 7c2ba840..00000000
--- a/redis-stable/tests/integration/block-repl.tcl
+++ /dev/null
@@ -1,51 +0,0 @@
-# Test replication of blocking lists and zset operations.
-# Unlike stream operations such operations are "pop" style, so they consume
-# the list or sorted set, and must be replicated correctly.
-
-proc start_bg_block_op {host port db ops tls} {
-    set tclsh [info nameofexecutable]
-    exec $tclsh tests/helpers/bg_block_op.tcl $host $port $db $ops $tls &
-}
-
-proc stop_bg_block_op {handle} {
-    catch {exec /bin/kill -9 $handle}
-}
-
-start_server {tags {"repl"}} {
-    start_server {} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        set load_handle0 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
-        set load_handle1 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
-        set load_handle2 [start_bg_block_op $master_host $master_port 9 100000 $::tls]
-
-        test {First server should have role slave after SLAVEOF} {
-            $slave slaveof $master_host $master_port
-            after 1000
-            s 0 role
-        } {slave}
-
-        test {Test replication with blocking lists and sorted sets operations} {
-            after 25000
-            stop_bg_block_op $load_handle0
-            stop_bg_block_op $load_handle1
-            stop_bg_block_op $load_handle2
-            wait_for_condition 100 100 {
-                [$master debug digest] == [$slave debug digest]
-            } else {
-                set csv1 [csvdump r]
-                set csv2 [csvdump {r -1}]
-                set fd [open /tmp/repldump1.txt w]
-                puts -nonewline $fd $csv1
-                close $fd
-                set fd [open /tmp/repldump2.txt w]
-                puts -nonewline $fd $csv2
-                close $fd
-                fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl b/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
deleted file mode 100644
index cf3577f2..00000000
--- a/redis-stable/tests/integration/convert-zipmap-hash-on-load.tcl
+++ /dev/null
@@ -1,35 +0,0 @@
-# Copy RDB with zipmap encoded hash to server path
-set server_path [tmpdir "server.convert-zipmap-hash-on-load"]
-
-exec cp -f tests/assets/hash-zipmap.rdb $server_path
-start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb"]] {
-  test "RDB load zipmap hash: converts to ziplist" {
-    r select 0
-
-    assert_match "*ziplist*" [r debug object hash]
-    assert_equal 2 [r hlen hash]
-    assert_match {v1 v2} [r hmget hash f1 f2]
-  }
-}
-
-exec cp -f tests/assets/hash-zipmap.rdb $server_path
-start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb" "hash-max-ziplist-entries" 1]] {
-  test "RDB load zipmap hash: converts to hash table when hash-max-ziplist-entries is exceeded" {
-    r select 0
-
-    assert_match "*hashtable*" [r debug object hash]
-    assert_equal 2 [r hlen hash]
-    assert_match {v1 v2} [r hmget hash f1 f2]
-  }
-}
-
-exec cp -f tests/assets/hash-zipmap.rdb $server_path
-start_server [list overrides [list "dir" $server_path "dbfilename" "hash-zipmap.rdb" "hash-max-ziplist-value" 1]] {
-  test "RDB load zipmap hash: converts to hash table when hash-max-ziplist-value is exceeded" {
-    r select 0
-
-    assert_match "*hashtable*" [r debug object hash]
-    assert_equal 2 [r hlen hash]
-    assert_match {v1 v2} [r hmget hash f1 f2]
-  }
-}
diff --git a/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl b/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
deleted file mode 100644
index 86cd8121..00000000
--- a/redis-stable/tests/integration/corrupt-dump-fuzzer.tcl
+++ /dev/null
@@ -1,208 +0,0 @@
-# tests of corrupt ziplist payload with valid CRC
-
-tags {"dump" "corruption"} {
-
-proc generate_collections {suffix elements} {
-    set rd [redis_deferring_client]
-    for {set j 0} {$j < $elements} {incr j} {
-        # add both string values and integers
-        if {$j % 2 == 0} {set val $j} else {set val "_$j"}
-        $rd hset hash$suffix $j $val
-        $rd lpush list$suffix $val
-        $rd zadd zset$suffix $j $val
-        $rd sadd set$suffix $val
-        $rd xadd stream$suffix * item 1 value $val
-    }
-    for {set j 0} {$j < $elements * 5} {incr j} {
-        $rd read ; # Discard replies
-    }
-    $rd close
-}
-
-# generate keys with various types and encodings
-proc generate_types {} {
-    r config set list-max-ziplist-size 5
-    r config set hash-max-ziplist-entries 5
-    r config set zset-max-ziplist-entries 5
-    r config set stream-node-max-entries 5
-
-    # create small (ziplist / listpack encoded) objects with 3 items
-    generate_collections "" 3
-
-    # add some metadata to the stream
-    r xgroup create stream mygroup 0
-    set records [r xreadgroup GROUP mygroup Alice COUNT 2 STREAMS stream >]
-    r xdel stream [lindex [lindex [lindex [lindex $records 0] 1] 1] 0]
-    r xack stream mygroup [lindex [lindex [lindex [lindex $records 0] 1] 0] 0]
-
-    # create other non-collection types
-    r incr int
-    r set string str
-
-    # create bigger objects with 10 items (more than a single ziplist / listpack)
-    generate_collections big 10
-
-    # make sure our big stream also has a listpack record that has different
-    # field names than the master recored
-    r xadd streambig * item 1 value 1
-    r xadd streambig * item 1 unique value
-}
-
-proc corrupt_payload {payload} {
-    set len [string length $payload]
-    set count 1 ;# usually corrupt only one byte
-    if {rand() > 0.9} { set count 2 }
-    while { $count > 0 } {
-        set idx [expr {int(rand() * $len)}]
-        set ch [binary format c [expr {int(rand()*255)}]]
-        set payload [string replace $payload $idx $idx $ch]
-        incr count -1
-    }
-    return $payload
-}
-
-# fuzzy tester for corrupt RESTORE payloads
-# valgrind will make sure there were no leaks in the rdb loader error handling code
-foreach sanitize_dump {no yes} {
-    if {$::accurate} {
-        set min_duration [expr {60 * 10}] ;# run at least 10 minutes
-        set min_cycles 1000 ;# run at least 1k cycles (max 16 minutes)
-    } else {
-        set min_duration 10 ; # run at least 10 seconds
-        set min_cycles 10 ; # run at least 10 cycles
-    }
-
-    # Don't execute this on FreeBSD due to a yet-undiscovered memory issue
-    # which causes tclsh to bloat.
-    if {[exec uname] == "FreeBSD"} {
-        set min_cycles 1
-        set min_duration 1
-    }
-
-    test "Fuzzer corrupt restore payloads - sanitize_dump: $sanitize_dump" {
-        if {$min_duration * 2 > $::timeout} {
-            fail "insufficient timeout"
-        }
-        # start a server, fill with data and save an RDB file once (avoid re-save)
-        start_server [list overrides [list "save" "" use-exit-on-panic yes crash-memcheck-enabled no loglevel verbose] ] {
-            set stdout [srv 0 stdout]
-            r config set sanitize-dump-payload $sanitize_dump
-            r debug set-skip-checksum-validation 1
-            set start_time [clock seconds]
-            generate_types
-            set dbsize [r dbsize]
-            r save
-            set cycle 0
-            set stat_terminated_in_restore 0
-            set stat_terminated_in_traffic 0
-            set stat_terminated_by_signal 0
-            set stat_successful_restore 0
-            set stat_rejected_restore 0
-            set stat_traffic_commands_sent 0
-            # repeatedly DUMP a random key, corrupt it and try RESTORE into a new key
-            while true {
-                set k [r randomkey]
-                set dump [r dump $k]
-                set dump [corrupt_payload $dump]
-                set printable_dump [string2printable $dump]
-                set restore_failed false
-                set report_and_restart false
-                set sent {}
-                # RESTORE can fail, but hopefully not terminate
-                if { [catch { r restore "_$k" 0 $dump REPLACE } err] } {
-                    set restore_failed true
-                    # skip if return failed with an error response.
-                    if {[string match "ERR*" $err]} {
-                        incr stat_rejected_restore
-                    } else {
-                        set report_and_restart true
-                        incr stat_terminated_in_restore
-                        write_log_line 0 "corrupt payload: $printable_dump"
-                        if {$sanitize_dump == yes} {
-                            puts "Server crashed in RESTORE with payload: $printable_dump"
-                        }
-                    }
-                } else {
-                    r ping ;# an attempt to check if the server didn't terminate (this will throw an error that will terminate the tests)
-                }
-
-                set print_commands false
-                if {!$restore_failed} {
-                    # if RESTORE didn't fail or terminate, run some random traffic on the new key
-                    incr stat_successful_restore
-                    if { [ catch {
-                        set sent [generate_fuzzy_traffic_on_key "_$k" 1] ;# traffic for 1 second
-                        incr stat_traffic_commands_sent [llength $sent]
-                        r del "_$k" ;# in case the server terminated, here's where we'll detect it.
-                        if {$dbsize != [r dbsize]} {
-                            puts "unexpected keys"
-                            puts "keys: [r keys *]"
-                            puts $sent
-                            exit 1
-                        }
-                    } err ] } {
-                        # if the server terminated update stats and restart it
-                        set report_and_restart true
-                        incr stat_terminated_in_traffic
-                        set by_signal [count_log_message 0 "crashed by signal"]
-                        incr stat_terminated_by_signal $by_signal
-
-                        if {$by_signal != 0 || $sanitize_dump == yes} {
-                            puts "Server crashed (by signal: $by_signal), with payload: $printable_dump"
-                            set print_commands true
-                        }
-                    }
-                }
-
-                # check valgrind report for invalid reads after each RESTORE
-                # payload so that we have a report that is easier to reproduce
-                set valgrind_errors [find_valgrind_errors [srv 0 stderr] false]
-                if {$valgrind_errors != ""} {
-                    puts "valgrind found an issue for payload: $printable_dump"
-                    set report_and_restart true
-                    set print_commands true
-                }
-
-                if {$report_and_restart} {
-                    if {$print_commands} {
-                        puts "violating commands:"
-                        foreach cmd $sent {
-                            foreach arg $cmd {
-                                puts -nonewline "[string2printable $arg] "
-                            }
-                            puts ""
-                        }
-                    }
-
-                    # restart the server and re-apply debug configuration
-                    write_log_line 0 "corrupt payload: $printable_dump"
-                    restart_server 0 true true
-                    r config set sanitize-dump-payload $sanitize_dump
-                    r debug set-skip-checksum-validation 1
-                }
-
-                incr cycle
-                if { ([clock seconds]-$start_time) >= $min_duration && $cycle >= $min_cycles} {
-                    break
-                }
-            }
-            if {$::verbose} {
-                puts "Done $cycle cycles in [expr {[clock seconds]-$start_time}] seconds."
-                puts "RESTORE: successful: $stat_successful_restore, rejected: $stat_rejected_restore"
-                puts "Total commands sent in traffic: $stat_traffic_commands_sent, crashes during traffic: $stat_terminated_in_traffic ($stat_terminated_by_signal by signal)."
-            }
-        }
-        # if we run sanitization we never expect the server to crash at runtime
-        if {$sanitize_dump == yes} {
-            assert_equal $stat_terminated_in_restore 0
-            assert_equal $stat_terminated_in_traffic 0
-        }
-        # make sure all terminations where due to assertion and not a SIGSEGV
-        assert_equal $stat_terminated_by_signal 0
-    }
-}
-
-
-
-} ;# tags
-
diff --git a/redis-stable/tests/integration/corrupt-dump.tcl b/redis-stable/tests/integration/corrupt-dump.tcl
deleted file mode 100644
index fbdd3c37..00000000
--- a/redis-stable/tests/integration/corrupt-dump.tcl
+++ /dev/null
@@ -1,702 +0,0 @@
-# tests of corrupt ziplist payload with valid CRC
-# * setting crash-memcheck-enabled to no to avoid issues with valgrind
-# * setting use-exit-on-panic to yes so that valgrind can search for leaks
-# * settng debug set-skip-checksum-validation to 1 on some tests for which we
-#   didn't bother to fake a valid checksum
-# * some tests set sanitize-dump-payload to no and some to yet, depending on
-#   what we want to test
-
-tags {"dump" "corruption"} {
-
-set corrupt_payload_7445 "\x0E\x01\x1D\x1D\x00\x00\x00\x16\x00\x00\x00\x03\x00\x00\x04\x43\x43\x43\x43\x06\x04\x42\x42\x42\x42\x06\x3F\x41\x41\x41\x41\xFF\x09\x00\x88\xA5\xCA\xA8\xC5\x41\xF4\x35"
-
-test {corrupt payload: #7445 - with sanitize} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        catch {
-            r restore key 0 $corrupt_payload_7445
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: #7445 - without sanitize - 1} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 $corrupt_payload_7445
-        catch {r lindex key 2}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: #7445 - without sanitize - 2} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 $corrupt_payload_7445
-        catch {r lset key 2 "BEEF"}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: hash with valid zip list header, invalid entry len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0D\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x14\x63\x00\x04\x02\x64\x00\xFF\x09\x00\xD9\x10\x54\x92\x15\xF5\x5F\x52"
-        r config set hash-max-ziplist-entries 1
-        catch {r hset key b b}
-        verify_log_message 0 "*zipEntrySafe*" 0
-    }
-}
-
-test {corrupt payload: invalid zlbytes header} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        catch {
-            r restore key 0 "\x0D\x1B\x25\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x02\x63\x00\x04\x02\x64\x00\xFF\x09\x00\xB7\xF7\x6E\x9F\x43\x43\x14\xC6"
-        } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: valid zipped hash header, dup records} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0D\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02\x61\x00\x04\x02\x62\x00\x04\x02\x61\x00\x04\x02\x64\x00\xFF\x09\x00\xA1\x98\x36\x78\xCC\x8E\x93\x2E"
-        r config set hash-max-ziplist-entries 1
-        # cause an assertion when converting to hash table
-        catch {r hset key b b}
-        verify_log_message 0 "*ziplist with dup elements dump*" 0
-    }
-}
-
-test {corrupt payload: quicklist big ziplist prev len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x0E\x02\x62\x00\xFF\x09\x00\x49\x97\x30\xB2\x0D\xA1\xED\xAA"
-        catch {r lindex key -2}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: quicklist small ziplist prev len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        catch {
-            r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x02\x02\x62\x00\xFF\x09\x00\xC7\x71\x03\x97\x07\x75\xB0\x63"
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: quicklist ziplist wrong count} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0E\x01\x13\x13\x00\x00\x00\x0E\x00\x00\x00\x03\x00\x00\x02\x61\x00\x04\x02\x62\x00\xFF\x09\x00\x4D\xE2\x0A\x2F\x08\x25\xDF\x91"
-        # we'll be able to push, but iterating on the list will assert
-        r lpush key header
-        r rpush key footer
-        catch { [r lrange key -1 -1] }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: #3080 - quicklist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        catch {
-            r RESTORE key 0 "\x0E\x01\x80\x00\x00\x00\x10\x41\x41\x41\x41\x41\x41\x41\x41\x02\x00\x00\x80\x41\x41\x41\x41\x07\x00\x03\xC7\x1D\xEF\x54\x68\xCC\xF3"
-            r DUMP key ;# DUMP was used in the original issue, but now even with shallow sanitization restore safely fails, so this is dead code
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: quicklist with empty ziplist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {r restore key 0 "\x0E\x01\x0B\x0B\x00\x00\x00\x0A\x00\x00\x00\x00\x00\xFF\x09\x00\xC2\x69\x37\x83\x3C\x7F\xFE\x6F" replace} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: #3080 - ziplist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        # shallow sanitization is enough for restore to safely reject the payload with wrong size
-        r config set sanitize-dump-payload no
-        catch {
-            r RESTORE key 0 "\x0A\x80\x00\x00\x00\x10\x41\x41\x41\x41\x41\x41\x41\x41\x02\x00\x00\x80\x41\x41\x41\x41\x07\x00\x39\x5B\x49\xE0\xC1\xC6\xDD\x76"
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: load corrupted rdb with no CRC - #3505} {
-    set server_path [tmpdir "server.rdb-corruption-test"]
-    exec cp tests/assets/corrupt_ziplist.rdb $server_path
-    set srv [start_server [list overrides [list "dir" $server_path "dbfilename" "corrupt_ziplist.rdb" loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no sanitize-dump-payload no]]]
-
-    # wait for termination
-    wait_for_condition 100 50 {
-        ! [is_alive $srv]
-    } else {
-        fail "rdb loading didn't fail"
-    }
-
-    set stdout [dict get $srv stdout]
-    assert_equal [count_message_lines $stdout "Terminating server after rdb file reading failure."]  1
-    assert_lessthan 1 [count_message_lines $stdout "integrity check failed"]
-    kill_server $srv ;# let valgrind look for issues
-}
-
-foreach sanitize_dump {no yes} {
-    test {corrupt payload: load corrupted rdb with empty keys} {
-        set server_path [tmpdir "server.rdb-corruption-empty-keys-test"]
-        exec cp tests/assets/corrupt_empty_keys.rdb $server_path
-        start_server [list overrides [list "dir" $server_path "dbfilename" "corrupt_empty_keys.rdb" "sanitize-dump-payload" $sanitize_dump]] {
-            r select 0
-            assert_equal [r dbsize] 0
-
-            verify_log_message 0 "*skipping empty key: set*" 0
-            verify_log_message 0 "*skipping empty key: list_quicklist*" 0
-            verify_log_message 0 "*skipping empty key: list_quicklist_empty_ziplist*" 0
-            verify_log_message 0 "*skipping empty key: list_ziplist*" 0
-            verify_log_message 0 "*skipping empty key: hash*" 0
-            verify_log_message 0 "*skipping empty key: hash_ziplist*" 0
-            verify_log_message 0 "*skipping empty key: zset*" 0
-            verify_log_message 0 "*skipping empty key: zset_ziplist*" 0
-            verify_log_message 0 "*empty keys skipped: 8*" 0
-        }
-    }
-}
-
-test {corrupt payload: listpack invalid size header} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        catch {
-            r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x5F\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x45\x91\x0A\x87\x2F\xA5\xF9\x2E"
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*Stream listpack integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: listpack too long entry len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x89\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x40\x63\xC9\x37\x03\xA2\xE5\x68"
-        catch {
-            r xinfo stream key full
-        } err
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: listpack very long entry len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x01\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x9C\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x63\x6F\x42\x8E\x7C\xB5\xA2\x9D"
-        catch {
-            r xinfo stream key full
-        } err
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: listpack too long entry prev len} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        catch {
-            r restore key 0 "\x0F\x01\x10\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x02\x40\x55\x55\x00\x00\x00\x0F\x00\x01\x01\x00\x15\x02\x01\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x00\x01\x00\x01\x00\x01\x00\x01\x02\x02\x88\x31\x00\x00\x00\x00\x00\x00\x00\x09\x88\x61\x00\x00\x00\x00\x00\x00\x00\x09\x88\x32\x00\x00\x00\x00\x00\x00\x00\x09\x88\x62\x00\x00\x00\x00\x00\x00\x00\x09\x08\x01\xFF\x0A\x01\x00\x00\x09\x00\x06\xFB\x44\x24\x0A\x8E\x75\xEA"
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*Stream listpack integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: hash ziplist with duplicate records} {
-    # when we do perform full sanitization, we expect duplicate records to fail the restore
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _hash 0 "\x0D\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x13\x00\xF5\x02\xF5\x02\xF2\x02\x53\x5F\x31\x04\xF3\x02\xF3\x02\xF7\x02\xF7\x02\xF8\x02\x02\x5F\x37\x04\xF1\x02\xF1\x02\xF6\x02\x02\x5F\x35\x04\xF4\x02\x02\x5F\x33\x04\xFA\x02\x02\x5F\x39\x04\xF9\x02\xF9\xFF\x09\x00\xB5\x48\xDE\x62\x31\xD0\xE5\x63" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: hash ziplist uneven record count} {
-    # when we do perform full sanitization, we expect duplicate records to fail the restore
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _hash 0 "\r\x1b\x1b\x00\x00\x00\x16\x00\x00\x00\x04\x00\x00\x02a\x00\x04\x02b\x00\x04\x02a\x00\x04\x02d\x00\xff\t\x00\xa1\x98\x36x\xcc\x8e\x93\x2e" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: hash dupliacte records} {
-    # when we do perform full sanitization, we expect duplicate records to fail the restore
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _hash 0 "\x04\x02\x01a\x01b\x01a\x01d\t\x00\xc6\x9c\xab\xbc\bk\x0c\x06" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: hash empty zipmap} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _hash 0 "\x09\x02\x00\xFF\x09\x00\xC0\xF1\xB8\x67\x4C\x16\xAC\xE3" } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*Zipmap integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: fuzzer findings - NPD in streamIteratorGetID} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {
-            r RESTORE key 0 "\x0F\x01\x10\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x48\x01\xFF\x03\x81\x00\x00\x01\x73\xBD\x68\x48\x71\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x01\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x72\x48\x68\xBD\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x72\x48\x68\xBD\x73\x01\x00\x00\x01\x00\x00\x01\x73\xBD\x68\x48\x71\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x80\xCD\xB0\xD5\x1A\xCE\xFF\x10"
-            r XREVRANGE key 725 233
-        }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - listpack NPD on invalid stream} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {
-            r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x1F\x01\x00\x01\x01\x01\x6D\x5F\x31\x03\x05\x01\x02\x01\x29\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDC\xB6\x6C\x1A\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x01\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x4B\x6C\xB6\xDC\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x3D\x6C\xB6\xDC\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDC\xB6\x6B\xF1\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xC7\x7D\x1C\xD7\x04\xFF\xE6\x9D"
-            r XREAD STREAMS _stream 519389898758
-        }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - NPD in quicklistIndex} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {
-            r RESTORE key 0 "\x0E\x01\x13\x13\x00\x00\x00\x10\x00\x00\x00\x03\x12\x00\xF3\x02\x02\x5F\x31\x04\xF1\xFF\x09\x00\xC9\x4B\x31\xFE\x61\xC0\x96\xFE"
-            r LSET key 290 290
-        }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - invalid read in ziplistFind} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {
-            r RESTORE key 0 "\x0D\x19\x19\x00\x00\x00\x16\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\xF2\x02\x02\x5F\x31\x04\x99\x02\xF3\xFF\x09\x00\xC5\xB8\x10\xC0\x8A\xF9\x16\xDF"
-            r HEXISTS key -688319650333
-        }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-
-test {corrupt payload: fuzzer findings - invalid ziplist encoding} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {
-            r RESTORE _listbig 0 "\x0E\x02\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\x02\x5F\x39\x04\xF9\x02\x86\x5F\x37\x04\xF7\x02\x02\x5F\x35\xFF\x19\x19\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\xF5\x02\x02\x5F\x33\x04\xF3\x02\x02\x5F\x31\x04\xF1\xFF\x09\x00\x0C\xFC\x99\x2C\x23\x45\x15\x60"
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: fuzzer findings - hash crash} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        r RESTORE _hash 0 "\x0D\x19\x19\x00\x00\x00\x16\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\xF2\x02\x02\x5F\x31\x04\xF3\x02\xF3\xFF\x09\x00\x38\xB8\x10\xC0\x8A\xF9\x16\xDF"
-        r HSET _hash 394891450 1635910264
-        r HMGET _hash 887312884855
-    }
-}
-
-test {corrupt payload: fuzzer findings - uneven entry count in hash} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _hashbig 0 "\x0D\x3D\x3D\x00\x00\x00\x38\x00\x00\x00\x14\x00\x00\xF2\x02\x02\x5F\x31\x04\x1C\x02\xF7\x02\xF1\x02\xF1\x02\xF5\x02\xF5\x02\xF4\x02\x02\x5F\x33\x04\xF6\x02\x02\x5F\x35\x04\xF8\x02\x02\x5F\x37\x04\xF9\x02\xF9\x02\xF3\x02\xF3\x02\xFA\x02\x02\x5F\x39\xFF\x09\x00\x73\xB7\x68\xC8\x97\x24\x8E\x88"
-        catch { r HSCAN _hashbig -250 }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - invalid read in lzf_decompress} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _setbig 0 "\x02\x03\x02\x5F\x31\xC0\x02\xC3\x00\x09\x00\xE6\xDC\x76\x44\xFF\xEB\x3D\xFE" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: fuzzer findings - leak in rdbloading due to dup entry in set} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _setbig 0 "\x02\x0A\x02\x5F\x39\xC0\x06\x02\x5F\x31\xC0\x00\xC0\x04\x02\x5F\x35\xC0\x02\xC0\x08\x02\x5F\x31\x02\x5F\x33\x09\x00\x7A\x5A\xFB\x90\x3A\xE9\x3C\xBE" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: fuzzer findings - empty intset} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {r RESTORE _setbig 0 "\x02\xC0\xC0\x06\x02\x5F\x39\xC0\x02\x02\x5F\x33\xC0\x00\x02\x5F\x31\xC0\x04\xC0\x08\x02\x5F\x37\x02\x5F\x35\x09\x00\xC5\xD4\x6D\xBA\xAD\x14\xB7\xE7"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind ziplist - crash report prints freed memory} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _zsetbig 0 "\x0C\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x00\x00\xF1\x02\xF1\x02\x02\x5F\x31\x04\xF2\x02\xF3\x02\xF3\x02\x02\x5F\x33\x04\xF4\x02\xEE\x02\xF5\x02\x02\x5F\x35\x04\xF6\x02\xF7\x02\xF7\x02\x02\x5F\x37\x04\xF8\x02\xF9\x02\xF9\x02\x02\x5F\x39\x04\xFA\xFF\x09\x00\xAE\xF9\x77\x2A\x47\x24\x33\xF6"
-        catch { r ZREMRANGEBYSCORE _zsetbig -1050966020 724 }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind ziplist prevlen reaches outside the ziplist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _listbig 0 "\x0E\x02\x1B\x1B\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\x02\x5F\x39\x04\xF9\x02\x02\x5F\x37\x04\xF7\x02\x02\x5F\x35\xFF\x19\x19\x00\x00\x00\x16\x00\x00\x00\x05\x00\x00\xF5\x02\x02\x5F\x33\x04\xF3\x95\x02\x5F\x31\x04\xF1\xFF\x09\x00\x0C\xFC\x99\x2C\x23\x45\x15\x60"
-        catch { r RPOP _listbig }
-        catch { r RPOP _listbig }
-        catch { r RPUSH _listbig 949682325 }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind - bad rdbLoadDoubleValue} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _list 0 "\x03\x01\x11\x11\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xD0\x07\x1A\xE9\x02\xFF\x09\x00\x1A\x06\x07\x32\x41\x28\x3A\x46" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind ziplist prev too big} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _list 0 "\x0E\x01\x13\x13\x00\x00\x00\x10\x00\x00\x00\x03\x00\x00\xF3\x02\x02\x5F\x31\xC1\xF1\xFF\x09\x00\xC9\x4B\x31\xFE\x61\xC0\x96\xFE"
-        catch { r RPUSHX _list -45 }
-        catch { r LREM _list -748 -840}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - lzf decompression fails, avoid valgrind invalid read} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {r RESTORE _stream 0 "\x0F\x02\x10\x00\x00\x01\x73\xDD\xAA\x2A\xB9\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4B\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x07\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x40\x00\x00\x02\x60\x19\x40\x27\x40\x19\x00\x33\x60\x19\x40\x29\x02\x01\x01\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x73\xDD\xAA\x2A\xBC\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4D\x40\x5E\x18\x5E\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x17\x0B\x03\x01\x01\x06\x01\x40\x0B\x00\x01\x60\x0D\x02\x82\x5F\x37\x60\x19\x80\x00\x00\x08\x60\x19\x80\x27\x02\x82\x5F\x39\x20\x19\x00\xFF\x0A\x81\x00\x00\x01\x73\xDD\xAA\x2A\xBE\x00\x00\x09\x00\x21\x85\x77\x43\x71\x7B\x17\x88"} err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream bad lp_count} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x56\x01\x02\x01\x22\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x2C\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDE\xDF\x7D\xC7\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\xF9\x7D\xDF\xDE\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xEB\x7D\xDF\xDE\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xB2\xA8\xA7\x5F\x1B\x61\x72\xD5"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream bad lp_count - unsanitized} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x56\x01\x02\x01\x22\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x2C\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x73\xDE\xDF\x7D\xC7\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\xF9\x7D\xDF\xDE\x73\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xEB\x7D\xDF\xDE\x73\x01\x00\x00\x01\x00\x00\x01\x73\xDE\xDF\x7D\x9B\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xB2\xA8\xA7\x5F\x1B\x61\x72\xD5"
-        catch { r XREVRANGE _stream 638932639 738}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream integrity check issue} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _stream 0 "\x0F\x02\x10\x00\x00\x01\x75\x2D\xA2\x90\x67\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x4A\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x75\x2D\xA2\x90\x67\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x56\x40\x60\x18\x60\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x80\x0B\x00\x02\x20\x0B\x02\x82\x5F\x37\x60\x19\x03\x01\x01\xDF\xFB\x20\x05\x00\x08\x60\x1A\x20\x0C\x00\xFC\x20\x05\x02\x82\x5F\x39\x20\x1B\x00\xFF\x0A\x81\x00\x00\x01\x75\x2D\xA2\x90\x68\x01\x00\x09\x00\x1D\x6F\xC0\x69\x8A\xDE\xF7\x92" } err
-        assert_match "*Bad data format*" $err
-    }
-}
-
-test {corrupt payload: fuzzer findings - infinite loop} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x82\x5F\x31\x03\xFD\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x75\x3A\xA6\xD0\x93\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x01\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x94\xD0\xA6\x3A\x75\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x94\xD0\xA6\x3A\x75\x01\x00\x00\x01\x00\x00\x01\x75\x3A\xA6\xD0\x93\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xC4\x09\xAD\x69\x7E\xEE\xA6\x2F"
-        catch { r XREVRANGE _stream 288270516 971031845 }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - hash convert asserts on RESTORE with shallow sanitization} {
-    # if we don't perform full sanitization, and the next command can assert on converting
-    # a ziplist to hash records, then we're ok with that happning in RESTORE too
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE _hash 0 "\x0D\x3D\x3D\x00\x00\x00\x3A\x00\x00\x00\x14\x13\x00\xF5\x02\xF5\x02\xF2\x02\x53\x5F\x31\x04\xF3\x02\xF3\x02\xF7\x02\xF7\x02\xF8\x02\x02\x5F\x37\x04\xF1\x02\xF1\x02\xF6\x02\x02\x5F\x35\x04\xF4\x02\x02\x5F\x33\x04\xFA\x02\x02\x5F\x39\x04\xF9\x02\xF9\xFF\x09\x00\xB5\x48\xDE\x62\x31\xD0\xE5\x63" }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: OOM in rdbGenericLoadStringObject} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        catch { r RESTORE x 0 "\x0A\x81\x7F\xFF\xFF\xFF\xFF\xFF\xFF\xFF\x13\x00\x00\x00\x0E\x00\x00\x00\x02\x00\x00\x02\x61\x00\x04\x02\x62\x00\xFF\x09\x00\x57\x04\xE5\xCD\xD4\x37\x6C\x57" } err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - OOM in dictExpand} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch { r RESTORE x 0 "\x02\x81\x02\x5F\x31\xC0\x00\xC0\x02\x09\x00\xCD\x84\x2C\xB7\xE8\xA4\x49\x57" } err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - invalid tail offset after removal} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _zset 0 "\x0C\x19\x19\x00\x00\x00\x02\x00\x00\x00\x06\x00\x00\xF1\x02\xF1\x02\x02\x5F\x31\x04\xF2\x02\xF3\x02\xF3\xFF\x09\x00\x4D\x72\x7B\x97\xCD\x9A\x70\xC1"
-        catch {r ZPOPMIN _zset}
-        catch {r ZPOPMAX _zset}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - negative reply length} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r RESTORE _stream 0 "\x0F\x01\x10\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x03\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x02\x01\x00\x01\x01\x01\x01\x01\x14\x5F\x31\x03\x05\x01\x02\x01\x00\x01\x02\x01\x01\x01\x02\x01\x05\x01\xFF\x03\x81\x00\x00\x01\x75\xCF\xA1\x16\xA7\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x75\xCF\xA1\x16\xA7\x01\x01\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x01\xA7\x16\xA1\xCF\x75\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xA7\x16\xA1\xCF\x75\x01\x00\x00\x01\x00\x00\x01\x75\xCF\xA1\x16\xA7\x00\x00\x00\x00\x00\x00\x00\x01\x09\x00\x1B\x42\x52\xB8\xDD\x5C\xE5\x4E"
-        catch {r XADD _stream * -956 -2601503852}
-        catch {r XINFO STREAM _stream FULL}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind negative malloc} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r RESTORE _key 0 "\x0E\x01\x81\xD6\xD6\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\x40\xC8\x6F\x2F\x36\xE2\xDF\xE3\x2E\x26\x64\x8B\x87\xD1\x7A\xBD\xFF\xEF\xEF\x63\x65\xF6\xF8\x8C\x4E\xEC\x96\x89\x56\x88\xF8\x3D\x96\x5A\x32\xBD\xD1\x36\xD8\x02\xE6\x66\x37\xCB\x34\x34\xC4\x52\xA7\x2A\xD5\x6F\x2F\x7E\xEE\xA2\x94\xD9\xEB\xA9\x09\x38\x3B\xE1\xA9\x60\xB6\x4E\x09\x44\x1F\x70\x24\xAA\x47\xA8\x6E\x30\xE1\x13\x49\x4E\xA1\x92\xC4\x6C\xF0\x35\x83\xD9\x4F\xD9\x9C\x0A\x0D\x7A\xE7\xB1\x61\xF5\xC1\x2D\xDC\xC3\x0E\x87\xA6\x80\x15\x18\xBA\x7F\x72\xDD\x14\x75\x46\x44\x0B\xCA\x9C\x8F\x1C\x3C\xD7\xDA\x06\x62\x18\x7E\x15\x17\x24\xAB\x45\x21\x27\xC2\xBC\xBB\x86\x6E\xD8\xBD\x8E\x50\xE0\xE0\x88\xA4\x9B\x9D\x15\x2A\x98\xFF\x5E\x78\x6C\x81\xFC\xA8\xC9\xC8\xE6\x61\xC8\xD1\x4A\x7F\x81\xD6\xA6\x1A\xAD\x4C\xC1\xA2\x1C\x90\x68\x15\x2A\x8A\x36\xC0\x58\xC3\xCC\xA6\x54\x19\x12\x0F\xEB\x46\xFF\x6E\xE3\xA7\x92\xF8\xFF\x09\x00\xD0\x71\xF7\x9F\xF7\x6A\xD6\x2E"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - valgrind invalid read} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r RESTORE _key 0 "\x05\x0A\x02\x5F\x39\x00\x00\x00\x00\x00\x00\x22\x40\xC0\x08\x00\x00\x00\x00\x00\x00\x20\x40\x02\x5F\x37\x00\x00\x00\x00\x00\x00\x1C\x40\xC0\x06\x00\x00\x00\x00\x00\x00\x18\x40\x02\x5F\x33\x00\x00\x00\x00\x00\x00\x14\x40\xC0\x04\x00\x00\x00\x00\x00\x00\x10\x40\x02\x5F\x33\x00\x00\x00\x00\x00\x00\x08\x40\xC0\x02\x00\x00\x00\x00\x00\x00\x00\x40\x02\x5F\x31\x00\x00\x00\x00\x00\x00\xF0\x3F\xC0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x3C\x66\xD7\x14\xA9\xDA\x3C\x69"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - empty hash ziplist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r RESTORE _int 0 "\x04\xC0\x01\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream with no records} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x78\x4D\x55\x68\x09\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x3E\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x50\x01\x00\x01\x01\x01\x02\x01\x05\x23\xFF\x02\x81\x00\x00\x01\x78\x4D\x55\x68\x59\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x01\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x00\x00\x00\x00\x00\x00\x00\x9F\x68\x55\x4D\x78\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x85\x68\x55\x4D\x78\x01\x00\x00\x01\x00\x00\x01\x78\x4D\x55\x68\x47\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xF1\xC0\x72\x70\x39\x40\x1E\xA9" replace
-        catch {r XREAD STREAMS _stream $}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "Guru Meditation"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - quicklist ziplist tail followed by extra data which start with 0xff} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {
-            r restore key 0 "\x0E\x01\x11\x11\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xF6\xFF\xB0\x6C\x9C\xFF\x09\x00\x9C\x37\x47\x49\x4D\xDE\x94\xF5" replace
-        } err
-        assert_match "*Bad data format*" $err
-        verify_log_message 0 "*integrity check failed*" 0
-    }
-}
-
-test {corrupt payload: fuzzer findings - dict init to huge size} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        catch {r restore key 0 "\x02\x81\xC0\x00\x02\x5F\x31\xC0\x02\x09\x00\xB2\x1B\xE5\x17\x2E\x15\xF4\x6C" replace} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - huge string} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore key 0 "\x00\x81\x01\x09\x00\xF6\x2B\xB6\x7A\x85\x87\x72\x4D"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream PEL without consumer} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x3B\x40\x42\x19\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x20\x10\x00\x00\x20\x01\x00\x01\x20\x03\x02\x05\x01\x03\x20\x05\x40\x00\x04\x82\x5F\x31\x03\x05\x60\x19\x80\x32\x02\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x08\xF0\xB2\x34\x02\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x08\xF0\xB2\x34\x01\x01\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x01\x35\xB2\xF0\x08\x7B\x01\x00\x00\x01\x01\x13\x41\x6C\x69\x63\x65\x35\xB2\xF0\x08\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x08\xF0\xB2\x34\x00\x00\x00\x00\x00\x00\x00\x01\x09\x00\x28\x2F\xE0\xC5\x04\xBB\xA7\x31"} err
-        assert_match "*Bad data format*" $err
-        #catch {r XINFO STREAM _stream FULL }
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream listpack valgrind issue} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x09\x5E\x94\xFF\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x25\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x32\x01\x00\x01\x01\x01\x02\x01\xF0\x01\xFF\x02\x81\x00\x00\x01\x7B\x09\x5E\x95\x31\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x01\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x00\x00\x00\x00\x00\x00\x00\x5C\x95\x5E\x09\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x4B\x95\x5E\x09\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x09\x5E\x95\x24\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\x19\x29\x94\xDF\x76\xF8\x1A\xC6"
-        catch {r XINFO STREAM _stream FULL }
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream with bad lpFirst} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore _stream 0 "\x0F\x01\x10\x00\x00\x01\x7B\x0E\x52\xD2\xEC\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\xF7\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x05\x01\x03\x01\x01\x01\x00\x01\x01\x01\x82\x5F\x31\x03\x05\x01\x02\x01\x01\x01\x01\x01\x01\x01\x02\x01\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x0E\x52\xD2\xED\x01\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x01\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x00\x00\x00\x00\x00\x00\x00\xED\xD2\x52\x0E\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\xED\xD2\x52\x0E\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x0E\x52\xD2\xED\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xAC\x05\xC9\x97\x5D\x45\x80\xB3"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream listpack lpPrev valgrind issue} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload no
-        r debug set-skip-checksum-validation 1
-        r restore _stream 0  "\x0F\x01\x10\x00\x00\x01\x7B\x0E\xAE\x66\x36\x00\x00\x00\x00\x00\x00\x00\x00\x40\x42\x42\x00\x00\x00\x18\x00\x02\x01\x01\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x00\x01\x02\x01\x00\x01\x00\x01\x01\x01\x00\x01\x1D\x01\x03\x01\x24\x01\x00\x01\x01\x69\x82\x5F\x31\x03\x05\x01\x02\x01\x33\x01\x00\x01\x01\x01\x02\x01\x05\x01\xFF\x02\x81\x00\x00\x01\x7B\x0E\xAE\x66\x69\x00\x01\x07\x6D\x79\x67\x72\x6F\x75\x70\x81\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x01\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x00\x00\x00\x00\x00\x00\x00\x94\x66\xAE\x0E\x7B\x01\x00\x00\x01\x01\x05\x41\x6C\x69\x63\x65\x83\x66\xAE\x0E\x7B\x01\x00\x00\x01\x00\x00\x01\x7B\x0E\xAE\x66\x5A\x00\x00\x00\x00\x00\x00\x00\x00\x09\x00\xD5\xD7\xA5\x5C\x63\x1C\x09\x40"
-        catch {r XREVRANGE _stream 1618622681 606195012389}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream with non-integer entry id} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore _streambig 0 "\x0F\x03\x10\x00\x00\x01\x7B\x13\x34\xC3\xB2\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x80\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x13\x34\xC3\xB2\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x56\x40\x61\x18\x61\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x40\x0B\x03\x01\x01\xDF\xFB\x20\x05\x02\x82\x5F\x37\x60\x1A\x20\x0E\x00\xFC\x20\x05\x00\x08\xC0\x1B\x00\xFD\x20\x0C\x02\x82\x5F\x39\x20\x1B\x00\xFF\x10\x00\x00\x01\x7B\x13\x34\xC3\xB3\x00\x00\x00\x00\x00\x00\x00\x03\xC3\x3D\x40\x4A\x18\x4A\x00\x00\x00\x15\x00\x02\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x40\x00\x00\x05\x60\x07\x02\xDF\xFD\x02\xC0\x23\x09\x01\x01\x86\x75\x6E\x69\x71\x75\x65\x07\xA0\x2D\x02\x08\x01\xFF\x0C\x81\x00\x00\x01\x7B\x13\x34\xC3\xB4\x00\x00\x09\x00\x9D\xBD\xD5\xB9\x33\xC4\xC5\xFF"} err
-        #catch {r XINFO STREAM _streambig FULL }
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - empty quicklist} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {
-            r restore key 0 "\x0E\xC0\x2B\x15\x00\x00\x00\x0A\x00\x00\x00\x01\x00\x00\xE0\x62\x58\xEA\xDF\x22\x00\x00\x00\xFF\x09\x00\xDF\x35\xD2\x67\xDC\x0E\x89\xAB" replace
-        } err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - empty zset} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore key 0 "\x05\xC0\x01\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - hash with len of 0} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r config set sanitize-dump-payload yes
-        r debug set-skip-checksum-validation 1
-        catch {r restore key 0 "\x04\xC0\x21\x09\x00\xF6\x8A\xB6\x7A\x85\x87\x72\x4D"} err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-test {corrupt payload: fuzzer findings - stream double free listpack when insert dup node to rax returns 0} {
-    start_server [list overrides [list loglevel verbose use-exit-on-panic yes crash-memcheck-enabled no] ] {
-        r debug set-skip-checksum-validation 1
-        r config set sanitize-dump-payload yes
-        catch { r restore _stream 0 "\x0F\x03\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x40\x4F\x40\x5C\x18\x5C\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x00\x01\x20\x03\x00\x05\x20\x1C\x40\x09\x05\x01\x01\x82\x5F\x31\x03\x80\x0D\x00\x02\x20\x0D\x00\x02\xA0\x19\x00\x03\x20\x0B\x02\x82\x5F\x33\xA0\x19\x00\x04\x20\x0D\x00\x04\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x05\xC3\x40\x51\x40\x5E\x18\x5E\x00\x00\x00\x24\x00\x05\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x06\x01\x01\x82\x5F\x35\x03\x05\x20\x1E\x40\x0B\x03\x01\x01\x06\x01\x80\x0B\x00\x02\x20\x0B\x02\x82\x5F\x37\xA0\x19\x00\x03\x20\x0D\x00\x08\xA0\x19\x00\x04\x20\x0B\x02\x82\x5F\x39\x20\x19\x00\xFF\x10\x00\x00\x01\x7B\x60\x5A\x23\x79\x00\x00\x00\x00\x00\x00\x00\x00\xC3\x3B\x40\x49\x18\x49\x00\x00\x00\x15\x00\x02\x01\x00\x01\x02\x01\x84\x69\x74\x65\x6D\x05\x85\x76\x61\x6C\x75\x65\x06\x40\x10\x00\x00\x20\x01\x40\x00\x00\x05\x20\x07\x40\x09\xC0\x22\x09\x01\x01\x86\x75\x6E\x69\x71\x75\x65\x07\xA0\x2C\x02\x08\x01\xFF\x0C\x81\x00\x00\x01\x7B\x60\x5A\x23\x7A\x01\x00\x09\x00\x9C\x8F\x1E\xBF\x2E\x05\x59\x09" replace } err
-        assert_match "*Bad data format*" $err
-        r ping
-    }
-}
-
-} ;# tags
-
diff --git a/redis-stable/tests/integration/failover.tcl b/redis-stable/tests/integration/failover.tcl
deleted file mode 100644
index 10642eb3..00000000
--- a/redis-stable/tests/integration/failover.tcl
+++ /dev/null
@@ -1,294 +0,0 @@
-start_server {tags {"failover"}} {
-start_server {} {
-start_server {} {
-    set node_0 [srv 0 client]
-    set node_0_host [srv 0 host]
-    set node_0_port [srv 0 port]
-    set node_0_pid [srv 0 pid]
-
-    set node_1 [srv -1 client]
-    set node_1_host [srv -1 host]
-    set node_1_port [srv -1 port]
-    set node_1_pid [srv -1 pid]
-
-    set node_2 [srv -2 client]
-    set node_2_host [srv -2 host]
-    set node_2_port [srv -2 port]
-    set node_2_pid [srv -2 pid]
-
-    proc assert_digests_match {n1 n2 n3} {
-        assert_equal [$n1 debug digest] [$n2 debug digest]
-        assert_equal [$n2 debug digest] [$n3 debug digest]
-    }
-
-    test {failover command fails without connected replica} {
-        catch { $node_0 failover to $node_1_host $node_1_port } err
-        if {! [string match "ERR*" $err]} {
-            fail "failover command succeeded when replica not connected"
-        }
-    }
-
-    test {setup replication for following tests} {
-        $node_1 replicaof $node_0_host $node_0_port
-        $node_2 replicaof $node_0_host $node_0_port
-        wait_for_sync $node_1
-        wait_for_sync $node_2
-    }
-
-    test {failover command fails with invalid host} {
-        catch { $node_0 failover to invalidhost $node_1_port } err
-        assert_match "ERR*" $err
-    }
-
-    test {failover command fails with invalid port} {
-        catch { $node_0 failover to $node_1_host invalidport } err
-        assert_match "ERR*" $err
-    }
-
-    test {failover command fails with just force and timeout} {
-        catch { $node_0 FAILOVER FORCE TIMEOUT 100} err
-        assert_match "ERR*" $err
-    }
-
-    test {failover command fails when sent to a replica} {
-        catch { $node_1 failover to $node_1_host $node_1_port } err
-        assert_match "ERR*" $err
-    }
-
-    test {failover command fails with force without timeout} {
-        catch { $node_0 failover to $node_1_host $node_1_port FORCE } err
-        assert_match "ERR*" $err
-    }
-
-    test {failover command to specific replica works} {
-        set initial_psyncs [s -1 sync_partial_ok]
-        set initial_syncs [s -1 sync_full]
-
-        # Generate a delta between primary and replica
-        set load_handler [start_write_load $node_0_host $node_0_port 5]
-        exec kill -SIGSTOP [srv -1 pid]
-        wait_for_condition 50 100 {
-            [s 0 total_commands_processed] > 100
-        } else {
-            fail "Node 0 did not accept writes"
-        }
-        exec kill -SIGCONT [srv -1 pid]
-
-        # Execute the failover
-        $node_0 failover to $node_1_host $node_1_port
-
-        # Wait for failover to end
-        wait_for_condition 50 100 {
-            [s 0 master_failover_state] == "no-failover"
-        } else {
-            fail "Failover from node 0 to node 1 did not finish"
-        }
-
-        # stop the write load and make sure no more commands processed
-        stop_write_load $load_handler
-        wait_load_handlers_disconnected
-
-        $node_2 replicaof $node_1_host $node_1_port
-        wait_for_sync $node_0
-        wait_for_sync $node_2
-
-        assert_match *slave* [$node_0 role]
-        assert_match *master* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        # We should accept psyncs from both nodes
-        assert_equal [expr [s -1 sync_partial_ok] - $initial_psyncs] 2
-        assert_equal [expr [s -1 sync_full] - $initial_psyncs] 0
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-
-    test {failover command to any replica works} {
-        set initial_psyncs [s -2 sync_partial_ok]
-        set initial_syncs [s -2 sync_full]
-
-        wait_for_ofs_sync $node_1 $node_2
-        # We stop node 0 to and make sure node 2 is selected
-        exec kill -SIGSTOP $node_0_pid
-        $node_1 set CASE 1
-        $node_1 FAILOVER
-
-        # Wait for failover to end
-        wait_for_condition 50 100 {
-            [s -1 master_failover_state] == "no-failover"
-        } else {
-            fail "Failover from node 1 to node 2 did not finish"
-        }
-        exec kill -SIGCONT $node_0_pid
-        $node_0 replicaof $node_2_host $node_2_port
-
-        wait_for_sync $node_0
-        wait_for_sync $node_1
-
-        assert_match *slave* [$node_0 role]
-        assert_match *slave* [$node_1 role]
-        assert_match *master* [$node_2 role]
-
-        # We should accept Psyncs from both nodes
-        assert_equal [expr [s -2 sync_partial_ok] - $initial_psyncs] 2
-        assert_equal [expr [s -1 sync_full] - $initial_psyncs] 0
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-
-    test {failover to a replica with force works} {
-        set initial_psyncs [s 0 sync_partial_ok]
-        set initial_syncs [s 0 sync_full]
-
-        exec kill -SIGSTOP $node_0_pid
-        # node 0 will never acknowledge this write
-        $node_2 set case 2
-        $node_2 failover to $node_0_host $node_0_port TIMEOUT 100 FORCE
-
-        # Wait for node 0 to give up on sync attempt and start failover
-        wait_for_condition 50 100 {
-            [s -2 master_failover_state] == "failover-in-progress"
-        } else {
-            fail "Failover from node 2 to node 0 did not timeout"
-        }
-
-        # Quick check that everyone is a replica, we never want a 
-        # state where there are two masters.
-        assert_match *slave* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        exec kill -SIGCONT $node_0_pid
-
-        # Wait for failover to end
-        wait_for_condition 50 100 {
-            [s -2 master_failover_state] == "no-failover"
-        } else {
-            fail "Failover from node 2 to node 0 did not finish"
-        }
-        $node_1 replicaof $node_0_host $node_0_port
-
-        wait_for_sync $node_1
-        wait_for_sync $node_2
-
-        assert_match *master* [$node_0 role]
-        assert_match *slave* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        assert_equal [count_log_message -2 "time out exceeded, failing over."] 1
-
-        # We should accept both psyncs, although this is the condition we might not
-        # since we didn't catch up.
-        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 2
-        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-
-    test {failover with timeout aborts if replica never catches up} {
-        set initial_psyncs [s 0 sync_partial_ok]
-        set initial_syncs [s 0 sync_full]
-
-        # Stop replica so it never catches up
-        exec kill -SIGSTOP [srv -1 pid]
-        $node_0 SET CASE 1
-        
-        $node_0 failover to [srv -1 host] [srv -1 port] TIMEOUT 500
-        # Wait for failover to end
-        wait_for_condition 50 20 {
-            [s 0 master_failover_state] == "no-failover"
-        } else {
-            fail "Failover from node_0 to replica did not finish"
-        }
-
-        exec kill -SIGCONT [srv -1 pid]
-
-        # We need to make sure the nodes actually sync back up
-        wait_for_ofs_sync $node_0 $node_1
-        wait_for_ofs_sync $node_0 $node_2
-
-        assert_match *master* [$node_0 role]
-        assert_match *slave* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        # Since we never caught up, there should be no syncs
-        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 0
-        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-
-    test {failovers can be aborted} {
-        set initial_psyncs [s 0 sync_partial_ok]
-        set initial_syncs [s 0 sync_full]
-    
-        # Stop replica so it never catches up
-        exec kill -SIGSTOP [srv -1 pid]
-        $node_0 SET CASE 2
-        
-        $node_0 failover to [srv -1 host] [srv -1 port] TIMEOUT 60000
-        assert_match [s 0 master_failover_state] "waiting-for-sync"
-
-        # Sanity check that read commands are still accepted
-        $node_0 GET CASE
-
-        $node_0 failover abort
-        assert_match [s 0 master_failover_state] "no-failover"
-
-        exec kill -SIGCONT [srv -1 pid]
-
-        # Just make sure everything is still synced
-        wait_for_ofs_sync $node_0 $node_1
-        wait_for_ofs_sync $node_0 $node_2
-
-        assert_match *master* [$node_0 role]
-        assert_match *slave* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        # Since we never caught up, there should be no syncs
-        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 0
-        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-
-    test {failover aborts if target rejects sync request} {
-        set initial_psyncs [s 0 sync_partial_ok]
-        set initial_syncs [s 0 sync_full]
-
-        # We block psync, so the failover will fail
-        $node_1 acl setuser default -psync
-
-        # We pause the target long enough to send a write command
-        # during the pause. This write will not be interrupted.
-        exec kill -SIGSTOP [srv -1 pid]
-        set rd [redis_deferring_client]
-        $rd SET FOO BAR
-        $node_0 failover to $node_1_host $node_1_port
-        exec kill -SIGCONT [srv -1 pid]
-
-        # Wait for failover to end
-        wait_for_condition 50 100 {
-            [s 0 master_failover_state] == "no-failover"
-        } else {
-            fail "Failover from node_0 to replica did not finish"
-        }
-
-        assert_equal [$rd read] "OK"
-        $rd close
-
-        # restore access to psync
-        $node_1 acl setuser default +psync
-
-        # We need to make sure the nodes actually sync back up
-        wait_for_sync $node_1
-        wait_for_sync $node_2
-
-        assert_match *master* [$node_0 role]
-        assert_match *slave* [$node_1 role]
-        assert_match *slave* [$node_2 role]
-
-        # We will cycle all of our replicas here and force a psync.
-        assert_equal [expr [s 0 sync_partial_ok] - $initial_psyncs] 2
-        assert_equal [expr [s 0 sync_full] - $initial_syncs] 0
-
-        assert_equal [count_log_message 0 "Failover target rejected psync request"] 1
-        assert_digests_match $node_0 $node_1 $node_2
-    }
-}
-}
-}
diff --git a/redis-stable/tests/integration/logging.tcl b/redis-stable/tests/integration/logging.tcl
deleted file mode 100644
index fec14ff2..00000000
--- a/redis-stable/tests/integration/logging.tcl
+++ /dev/null
@@ -1,51 +0,0 @@
-set system_name [string tolower [exec uname -s]]
-set system_supported 0
-
-# We only support darwin or Linux with glibc
-if {$system_name eq {darwin}} {
-    set system_supported 1
-} elseif {$system_name eq {linux}} {
-    # Avoid the test on libmusl, which does not support backtrace
-    set ldd [exec ldd src/redis-server]
-    if {![string match {*libc.musl*} $ldd]} {
-        set system_supported 1
-    }
-}
-
-if {$system_supported} {
-    set server_path [tmpdir server.log]
-    start_server [list overrides [list dir $server_path]] {
-        test "Server is able to generate a stack trace on selected systems" {
-            r config set watchdog-period 200
-            r debug sleep 1
-            set pattern "*debugCommand*"
-            set retry 10
-            while {$retry} {
-                set result [exec tail -100 < [srv 0 stdout]]
-                if {[string match $pattern $result]} {
-                    break
-                }
-                incr retry -1
-                after 1000
-            }
-            if {$retry == 0} {
-                error "assertion:expected stack trace not found into log file"
-            }
-        }
-    }
-
-    # Valgrind will complain that the process terminated by a signal, skip it.
-    if {!$::valgrind} {
-        set server_path [tmpdir server1.log]
-        start_server [list overrides [list dir $server_path]] {
-            test "Crash report generated on SIGABRT" {
-                set pid [s process_id]
-                exec kill -SIGABRT $pid
-                set pattern "*STACK TRACE*"
-                set result [exec tail -1000 < [srv 0 stdout]]
-                assert {[string match $pattern $result]}
-            }
-        }
-    }
-
-}
diff --git a/redis-stable/tests/integration/psync2-pingoff.tcl b/redis-stable/tests/integration/psync2-pingoff.tcl
deleted file mode 100644
index 7744010a..00000000
--- a/redis-stable/tests/integration/psync2-pingoff.tcl
+++ /dev/null
@@ -1,244 +0,0 @@
-# These tests were added together with the meaningful offset implementation
-# in redis 6.0.0, which was later abandoned in 6.0.4, they used to test that
-# servers are able to PSYNC with replicas even if the replication stream has
-# PINGs at the end which present in one sever and missing on another.
-# We keep these tests just because they reproduce edge cases in the replication
-# logic in hope they'll be able to spot some problem in the future.
-
-start_server {tags {"psync2"}} {
-start_server {} {
-    # Config
-    set debug_msg 0                 ; # Enable additional debug messages
-
-    for {set j 0} {$j < 2} {incr j} {
-        set R($j) [srv [expr 0-$j] client]
-        set R_host($j) [srv [expr 0-$j] host]
-        set R_port($j) [srv [expr 0-$j] port]
-        $R($j) CONFIG SET repl-ping-replica-period 1
-        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
-    }
-
-    # Setup replication
-    test "PSYNC2 pingoff: setup" {
-        $R(1) replicaof $R_host(0) $R_port(0)
-        $R(0) set foo bar
-        wait_for_condition 50 1000 {
-            [status $R(1) master_link_status] == "up" &&
-            [$R(0) dbsize] == 1 && [$R(1) dbsize] == 1
-        } else {
-            fail "Replicas not replicating from master"
-        }
-    }
-
-    test "PSYNC2 pingoff: write and wait replication" {
-        $R(0) INCR counter
-        $R(0) INCR counter
-        $R(0) INCR counter
-        wait_for_condition 50 1000 {
-            [$R(0) GET counter] eq [$R(1) GET counter]
-        } else {
-            fail "Master and replica don't agree about counter"
-        }
-    }
-
-    # In this test we'll make sure the replica will get stuck, but with
-    # an active connection: this way the master will continue to send PINGs
-    # every second (we modified the PING period earlier)
-    test "PSYNC2 pingoff: pause replica and promote it" {
-        $R(1) MULTI
-        $R(1) DEBUG SLEEP 5
-        $R(1) SLAVEOF NO ONE
-        $R(1) EXEC
-        $R(1) ping ; # Wait for it to return back available
-    }
-
-    test "Make the old master a replica of the new one and check conditions" {
-        assert_equal [status $R(1) sync_full] 0
-        $R(0) REPLICAOF $R_host(1) $R_port(1)
-        wait_for_condition 50 1000 {
-            [status $R(1) sync_full] == 1
-        } else {
-            fail "The new master was not able to sync"
-        }
-
-        # make sure replication is still alive and kicking
-        $R(1) incr x
-        wait_for_condition 50 1000 {
-            [status $R(0) loading] == 0 &&
-            [$R(0) get x] == 1
-        } else {
-            fail "replica didn't get incr"
-        }
-        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
-    }
-}}
-
-
-start_server {tags {"psync2"}} {
-start_server {} {
-start_server {} {
-start_server {} {
-start_server {} {
-    test {test various edge cases of repl topology changes with missing pings at the end} {
-        set master [srv -4 client]
-        set master_host [srv -4 host]
-        set master_port [srv -4 port]
-        set replica1 [srv -3 client]
-        set replica2 [srv -2 client]
-        set replica3 [srv -1 client]
-        set replica4 [srv -0 client]
-
-        $replica1 replicaof $master_host $master_port
-        $replica2 replicaof $master_host $master_port
-        $replica3 replicaof $master_host $master_port
-        $replica4 replicaof $master_host $master_port
-        wait_for_condition 50 1000 {
-            [status $master connected_slaves] == 4
-        } else {
-            fail "replicas didn't connect"
-        }
-
-        $master incr x
-        wait_for_condition 50 1000 {
-            [$replica1 get x] == 1 && [$replica2 get x] == 1 &&
-            [$replica3 get x] == 1 && [$replica4 get x] == 1
-        } else {
-            fail "replicas didn't get incr"
-        }
-
-        # disconnect replica1 and replica2
-        # and wait for the master to send a ping to replica3 and replica4
-        $replica1 replicaof no one
-        $replica2 replicaof 127.0.0.1 1 ;# we can't promote it to master since that will cycle the replication id
-        $master config set repl-ping-replica-period 1
-        set replofs [status $master master_repl_offset]
-        wait_for_condition 50 100 {
-            [status $replica3 master_repl_offset] > $replofs &&
-            [status $replica4 master_repl_offset] > $replofs
-        } else {
-            fail "replica didn't sync in time"
-        }
-
-        # make everyone sync from the replica1 that didn't get the last ping from the old master
-        # replica4 will keep syncing from the old master which now syncs from replica1
-        # and replica2 will re-connect to the old master (which went back in time)
-        set new_master_host [srv -3 host]
-        set new_master_port [srv -3 port]
-        $replica3 replicaof $new_master_host $new_master_port
-        $master replicaof $new_master_host $new_master_port
-        $replica2 replicaof $master_host $master_port
-        wait_for_condition 50 1000 {
-            [status $replica2 master_link_status] == "up" &&
-            [status $replica3 master_link_status] == "up" &&
-            [status $replica4 master_link_status] == "up" &&
-            [status $master master_link_status] == "up"
-        } else {
-            fail "replicas didn't connect"
-        }
-
-        # make sure replication is still alive and kicking
-        $replica1 incr x
-        wait_for_condition 50 1000 {
-            [$replica2 get x] == 2 &&
-            [$replica3 get x] == 2 &&
-            [$replica4 get x] == 2 &&
-            [$master get x] == 2
-        } else {
-            fail "replicas didn't get incr"
-        }
-
-        # make sure we have the right amount of full syncs
-        assert_equal [status $master sync_full] 6
-        assert_equal [status $replica1 sync_full] 2
-        assert_equal [status $replica2 sync_full] 0
-        assert_equal [status $replica3 sync_full] 0
-        assert_equal [status $replica4 sync_full] 0
-
-        # force psync
-        $master client kill type master
-        $replica2 client kill type master
-        $replica3 client kill type master
-        $replica4 client kill type master
-
-        # make sure replication is still alive and kicking
-        $replica1 incr x
-        wait_for_condition 50 1000 {
-            [$replica2 get x] == 3 &&
-            [$replica3 get x] == 3 &&
-            [$replica4 get x] == 3 &&
-            [$master get x] == 3
-        } else {
-            fail "replicas didn't get incr"
-        }
-
-        # make sure we have the right amount of full syncs
-        assert_equal [status $master sync_full] 6
-        assert_equal [status $replica1 sync_full] 2
-        assert_equal [status $replica2 sync_full] 0
-        assert_equal [status $replica3 sync_full] 0
-        assert_equal [status $replica4 sync_full] 0
-}
-}}}}}
-
-start_server {tags {"psync2"}} {
-start_server {} {
-start_server {} {
-
-    for {set j 0} {$j < 3} {incr j} {
-        set R($j) [srv [expr 0-$j] client]
-        set R_host($j) [srv [expr 0-$j] host]
-        set R_port($j) [srv [expr 0-$j] port]
-        $R($j) CONFIG SET repl-ping-replica-period 1
-    }
-
-    test "Chained replicas disconnect when replica re-connect with the same master" {
-        # Add a second replica as a chained replica of the current replica
-        $R(1) replicaof $R_host(0) $R_port(0)
-        $R(2) replicaof $R_host(1) $R_port(1)
-        wait_for_condition 50 1000 {
-            [status $R(2) master_link_status] == "up"
-        } else {
-            fail "Chained replica not replicating from its master"
-        }
-
-        # Do a write on the master, and wait for the master to
-        # send some PINGs to its replica
-        $R(0) INCR counter2
-        set replofs [status $R(0) master_repl_offset]
-        wait_for_condition 50 100 {
-            [status $R(1) master_repl_offset] > $replofs &&
-            [status $R(2) master_repl_offset] > $replofs
-        } else {
-            fail "replica didn't sync in time"
-        }
-        set sync_partial_master [status $R(0) sync_partial_ok]
-        set sync_partial_replica [status $R(1) sync_partial_ok]
-        $R(0) CONFIG SET repl-ping-replica-period 100
-
-        # Disconnect the master's direct replica
-        $R(0) client kill type replica
-        wait_for_condition 50 1000 {
-            [status $R(1) master_link_status] == "up" && 
-            [status $R(2) master_link_status] == "up" &&
-            [status $R(0) sync_partial_ok] == $sync_partial_master + 1 &&
-            [status $R(1) sync_partial_ok] == $sync_partial_replica
-        } else {
-            fail "Disconnected replica failed to PSYNC with master"
-        }
-
-        # Verify that the replica and its replica's meaningful and real
-        # offsets match with the master
-        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
-        assert_equal [status $R(0) master_repl_offset] [status $R(2) master_repl_offset]
-
-        # make sure replication is still alive and kicking
-        $R(0) incr counter2
-        wait_for_condition 50 1000 {
-            [$R(1) get counter2] == 2 && [$R(2) get counter2] == 2
-        } else {
-            fail "replicas didn't get incr"
-        }
-        assert_equal [status $R(0) master_repl_offset] [status $R(1) master_repl_offset]
-        assert_equal [status $R(0) master_repl_offset] [status $R(2) master_repl_offset]
-    }
-}}}
diff --git a/redis-stable/tests/integration/psync2-reg.tcl b/redis-stable/tests/integration/psync2-reg.tcl
deleted file mode 100644
index 71a1c0eb..00000000
--- a/redis-stable/tests/integration/psync2-reg.tcl
+++ /dev/null
@@ -1,82 +0,0 @@
-# Issue 3899 regression test.
-# We create a chain of three instances: master -> slave -> slave2
-# and continuously break the link while traffic is generated by
-# redis-benchmark. At the end we check that the data is the same
-# everywhere.
-
-start_server {tags {"psync2"}} {
-start_server {} {
-start_server {} {
-    # Config
-    set debug_msg 0                 ; # Enable additional debug messages
-
-    set no_exit 0                   ; # Do not exit at end of the test
-
-    set duration 20                 ; # Total test seconds
-
-    for {set j 0} {$j < 3} {incr j} {
-        set R($j) [srv [expr 0-$j] client]
-        set R_host($j) [srv [expr 0-$j] host]
-        set R_port($j) [srv [expr 0-$j] port]
-        set R_unixsocket($j) [srv [expr 0-$j] unixsocket]
-        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
-    }
-
-    # Setup the replication and backlog parameters
-    test "PSYNC2 #3899 regression: setup" {
-        $R(1) slaveof $R_host(0) $R_port(0)
-        $R(2) slaveof $R_host(0) $R_port(0)
-        $R(0) set foo bar
-        wait_for_condition 50 1000 {
-            [status $R(1) master_link_status] == "up" &&
-            [status $R(2) master_link_status] == "up" &&
-            [$R(1) dbsize] == 1 &&
-            [$R(2) dbsize] == 1
-        } else {
-            fail "Replicas not replicating from master"
-        }
-        $R(0) config set repl-backlog-size 10mb
-        $R(1) config set repl-backlog-size 10mb
-    }
-
-    set cycle_start_time [clock milliseconds]
-    set bench_pid [exec src/redis-benchmark -s $R_unixsocket(0) -n 10000000 -r 1000 incr __rand_int__ > /dev/null &]
-    while 1 {
-        set elapsed [expr {[clock milliseconds]-$cycle_start_time}]
-        if {$elapsed > $duration*1000} break
-        if {rand() < .05} {
-            test "PSYNC2 #3899 regression: kill first replica" {
-                $R(1) client kill type master
-            }
-        }
-        if {rand() < .05} {
-            test "PSYNC2 #3899 regression: kill chained replica" {
-                $R(2) client kill type master
-            }
-        }
-        after 100
-    }
-    exec kill -9 $bench_pid
-
-    if {$debug_msg} {
-        for {set j 0} {$j < 100} {incr j} {
-            if {
-                [$R(0) debug digest] == [$R(1) debug digest] &&
-                [$R(1) debug digest] == [$R(2) debug digest]
-            } break
-            puts [$R(0) debug digest]
-            puts [$R(1) debug digest]
-            puts [$R(2) debug digest]
-            after 1000
-        }
-    }
-
-    test "PSYNC2 #3899 regression: verify consistency" {
-        wait_for_condition 50 1000 {
-            ([$R(0) debug digest] eq [$R(1) debug digest]) &&
-            ([$R(1) debug digest] eq [$R(2) debug digest])
-        } else {
-            fail "The three instances have different data sets"
-        }
-    }
-}}}
diff --git a/redis-stable/tests/integration/psync2.tcl b/redis-stable/tests/integration/psync2.tcl
deleted file mode 100644
index 8f8db5a9..00000000
--- a/redis-stable/tests/integration/psync2.tcl
+++ /dev/null
@@ -1,373 +0,0 @@
-
-proc show_cluster_status {} {
-    uplevel 1 {
-        # The following is the regexp we use to match the log line
-        # time info. Logs are in the following form:
-        #
-        # 11296:M 25 May 2020 17:37:14.652 # Server initialized
-        set log_regexp {^[0-9]+:[A-Z] [0-9]+ [A-z]+ [0-9]+ ([0-9:.]+) .*}
-        set repl_regexp {(master|repl|sync|backlog|meaningful|offset)}
-
-        puts "Master ID is $master_id"
-        for {set j 0} {$j < 5} {incr j} {
-            puts "$j: sync_full: [status $R($j) sync_full]"
-            puts "$j: id1      : [status $R($j) master_replid]:[status $R($j) master_repl_offset]"
-            puts "$j: id2      : [status $R($j) master_replid2]:[status $R($j) second_repl_offset]"
-            puts "$j: backlog  : firstbyte=[status $R($j) repl_backlog_first_byte_offset] len=[status $R($j) repl_backlog_histlen]"
-            puts "$j: x var is : [$R($j) GET x]"
-            puts "---"
-        }
-
-        # Show the replication logs of every instance, interleaving
-        # them by the log date.
-        #
-        # First: load the lines as lists for each instance.
-        array set log {}
-        for {set j 0} {$j < 5} {incr j} {
-            set fd [open $R_log($j)]
-            while {[gets $fd l] >= 0} {
-                if {[regexp $log_regexp $l] &&
-                    [regexp -nocase $repl_regexp $l]} {
-                    lappend log($j) $l
-                }
-            }
-            close $fd
-        }
-
-        # To interleave the lines, at every step consume the element of
-        # the list with the lowest time and remove it. Do it until
-        # all the lists are empty.
-        #
-        # regexp {^[0-9]+:[A-Z] [0-9]+ [A-z]+ [0-9]+ ([0-9:.]+) .*} $l - logdate
-        while 1 {
-            # Find the log with smallest time.
-            set empty 0
-            set best 0
-            set bestdate {}
-            for {set j 0} {$j < 5} {incr j} {
-                if {[llength $log($j)] == 0} {
-                    incr empty
-                    continue
-                }
-                regexp $log_regexp [lindex $log($j) 0] - date
-                if {$bestdate eq {}} {
-                    set best $j
-                    set bestdate $date
-                } else {
-                    if {[string compare $bestdate $date] > 0} {
-                        set best $j
-                        set bestdate $date
-                    }
-                }
-            }
-            if {$empty == 5} break ; # Our exit condition: no more logs
-
-            # Emit the one with the smallest time (that is the first
-            # event in the time line).
-            puts "\[$best port $R_port($best)\] [lindex $log($best) 0]"
-            set log($best) [lrange $log($best) 1 end]
-        }
-    }
-}
-
-start_server {tags {"psync2"}} {
-start_server {} {
-start_server {} {
-start_server {} {
-start_server {} {
-    set master_id 0                 ; # Current master
-    set start_time [clock seconds]  ; # Test start time
-    set counter_value 0             ; # Current value of the Redis counter "x"
-
-    # Config
-    set debug_msg 0                 ; # Enable additional debug messages
-
-    set no_exit 0                   ; # Do not exit at end of the test
-
-    set duration 40                 ; # Total test seconds
-
-    set genload 1                   ; # Load master with writes at every cycle
-
-    set genload_time 5000           ; # Writes duration time in ms
-
-    set disconnect 1                ; # Break replication link between random
-                                      # master and slave instances while the
-                                      # master is loaded with writes.
-
-    set disconnect_period 1000      ; # Disconnect repl link every N ms.
-
-    for {set j 0} {$j < 5} {incr j} {
-        set R($j) [srv [expr 0-$j] client]
-        set R_host($j) [srv [expr 0-$j] host]
-        set R_port($j) [srv [expr 0-$j] port]
-        set R_log($j) [srv [expr 0-$j] stdout]
-        if {$debug_msg} {puts "Log file: [srv [expr 0-$j] stdout]"}
-    }
-
-    set cycle 1
-    while {([clock seconds]-$start_time) < $duration} {
-        test "PSYNC2: --- CYCLE $cycle ---" {}
-        incr cycle
-
-        # Create a random replication layout.
-        # Start with switching master (this simulates a failover).
-
-        # 1) Select the new master.
-        set master_id [randomInt 5]
-        set used [list $master_id]
-        test "PSYNC2: \[NEW LAYOUT\] Set #$master_id as master" {
-            $R($master_id) slaveof no one
-            $R($master_id) config set repl-ping-replica-period 1 ;# increse the chance that random ping will cause issues
-            if {$counter_value == 0} {
-                $R($master_id) set x $counter_value
-            }
-        }
-
-        # 2) Attach all the slaves to a random instance
-        while {[llength $used] != 5} {
-            while 1 {
-                set slave_id [randomInt 5]
-                if {[lsearch -exact $used $slave_id] == -1} break
-            }
-            set rand [randomInt [llength $used]]
-            set mid [lindex $used $rand]
-            set master_host $R_host($mid)
-            set master_port $R_port($mid)
-
-            test "PSYNC2: Set #$slave_id to replicate from #$mid" {
-                $R($slave_id) slaveof $master_host $master_port
-            }
-            lappend used $slave_id
-        }
-
-        # Wait for replicas to sync. so next loop won't get -LOADING error
-        wait_for_condition 50 1000 {
-            [status $R([expr {($master_id+1)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+2)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+3)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+4)%5}]) master_link_status] == "up"
-        } else {
-            show_cluster_status
-            fail "Replica not reconnecting"
-        }
-
-        # 3) Increment the counter and wait for all the instances
-        # to converge.
-        test "PSYNC2: cluster is consistent after failover" {
-            $R($master_id) incr x; incr counter_value
-            for {set j 0} {$j < 5} {incr j} {
-                wait_for_condition 50 1000 {
-                    [$R($j) get x] == $counter_value
-                } else {
-                    show_cluster_status
-                    fail "Instance #$j x variable is inconsistent"
-                }
-            }
-        }
-
-        # 4) Generate load while breaking the connection of random
-        # slave-master pairs.
-        test "PSYNC2: generate load while killing replication links" {
-            set t [clock milliseconds]
-            set next_break [expr {$t+$disconnect_period}]
-            while {[clock milliseconds]-$t < $genload_time} {
-                if {$genload} {
-                    $R($master_id) incr x; incr counter_value
-                }
-                if {[clock milliseconds] == $next_break} {
-                    set next_break \
-                        [expr {[clock milliseconds]+$disconnect_period}]
-                    set slave_id [randomInt 5]
-                    if {$disconnect} {
-                        $R($slave_id) client kill type master
-                        if {$debug_msg} {
-                            puts "+++ Breaking link for replica #$slave_id"
-                        }
-                    }
-                }
-            }
-        }
-
-        # 5) Increment the counter and wait for all the instances
-        set x [$R($master_id) get x]
-        test "PSYNC2: cluster is consistent after load (x = $x)" {
-            for {set j 0} {$j < 5} {incr j} {
-                wait_for_condition 50 1000 {
-                    [$R($j) get x] == $counter_value
-                } else {
-                    show_cluster_status
-                    fail "Instance #$j x variable is inconsistent"
-                }
-            }
-        }
-
-        # wait for all the slaves to be in sync.
-        set masteroff [status $R($master_id) master_repl_offset]
-        wait_for_condition 500 100 {
-            [status $R(0) master_repl_offset] >= $masteroff &&
-            [status $R(1) master_repl_offset] >= $masteroff &&
-            [status $R(2) master_repl_offset] >= $masteroff &&
-            [status $R(3) master_repl_offset] >= $masteroff &&
-            [status $R(4) master_repl_offset] >= $masteroff
-        } else {
-            show_cluster_status
-            fail "Replicas offsets didn't catch up with the master after too long time."
-        }
-
-        if {$debug_msg} {
-            show_cluster_status
-        }
-
-        test "PSYNC2: total sum of full synchronizations is exactly 4" {
-            set sum 0
-            for {set j 0} {$j < 5} {incr j} {
-                incr sum [status $R($j) sync_full]
-            }
-            if {$sum != 4} {
-                show_cluster_status
-                assert {$sum == 4}
-            }
-        }
-
-        # In absence of pings, are the instances really able to have
-        # the exact same offset?
-        $R($master_id) config set repl-ping-replica-period 3600
-        wait_for_condition 500 100 {
-            [status $R($master_id) master_repl_offset] == [status $R(0) master_repl_offset] &&
-            [status $R($master_id) master_repl_offset] == [status $R(1) master_repl_offset] &&
-            [status $R($master_id) master_repl_offset] == [status $R(2) master_repl_offset] &&
-            [status $R($master_id) master_repl_offset] == [status $R(3) master_repl_offset] &&
-            [status $R($master_id) master_repl_offset] == [status $R(4) master_repl_offset]
-        } else {
-            show_cluster_status
-            fail "Replicas and master offsets were unable to match *exactly*."
-        }
-
-        # Limit anyway the maximum number of cycles. This is useful when the
-        # test is skipped via --only option of the test suite. In that case
-        # we don't want to see many seconds of this test being just skipped.
-        if {$cycle > 50} break
-    }
-
-    test "PSYNC2: Bring the master back again for next test" {
-        $R($master_id) slaveof no one
-        set master_host $R_host($master_id)
-        set master_port $R_port($master_id)
-        for {set j 0} {$j < 5} {incr j} {
-            if {$j == $master_id} continue
-            $R($j) slaveof $master_host $master_port
-        }
-
-        # Wait for replicas to sync. it is not enough to just wait for connected_slaves==4
-        # since we might do the check before the master realized that they're disconnected
-        wait_for_condition 50 1000 {
-            [status $R($master_id) connected_slaves] == 4 &&
-            [status $R([expr {($master_id+1)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+2)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+3)%5}]) master_link_status] == "up" &&
-            [status $R([expr {($master_id+4)%5}]) master_link_status] == "up"
-        } else {
-            show_cluster_status
-            fail "Replica not reconnecting"
-        }
-    }
-
-    test "PSYNC2: Partial resync after restart using RDB aux fields" {
-        # Pick a random slave
-        set slave_id [expr {($master_id+1)%5}]
-        set sync_count [status $R($master_id) sync_full]
-        set sync_partial [status $R($master_id) sync_partial_ok]
-        set sync_partial_err [status $R($master_id) sync_partial_err]
-        catch {
-            $R($slave_id) config rewrite
-            restart_server [expr {0-$slave_id}] true false
-            set R($slave_id) [srv [expr {0-$slave_id}] client]
-        }
-        # note: just waiting for connected_slaves==4 has a race condition since
-        # we might do the check before the master realized that the slave disconnected
-        wait_for_condition 50 1000 {
-            [status $R($master_id) sync_partial_ok] == $sync_partial + 1
-        } else {
-            puts "prev sync_full: $sync_count"
-            puts "prev sync_partial_ok: $sync_partial"
-            puts "prev sync_partial_err: $sync_partial_err"
-            puts [$R($master_id) info stats]
-            show_cluster_status
-            fail "Replica didn't partial sync"
-        }
-        set new_sync_count [status $R($master_id) sync_full]
-        assert {$sync_count == $new_sync_count}
-    }
-
-    test "PSYNC2: Replica RDB restart with EVALSHA in backlog issue #4483" {
-        # Pick a random slave
-        set slave_id [expr {($master_id+1)%5}]
-        set sync_count [status $R($master_id) sync_full]
-
-        # Make sure to replicate the first EVAL while the salve is online
-        # so that it's part of the scripts the master believes it's safe
-        # to propagate as EVALSHA.
-        $R($master_id) EVAL {return redis.call("incr","__mycounter")} 0
-        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
-
-        # Wait for the two to sync
-        wait_for_condition 50 1000 {
-            [$R($master_id) debug digest] == [$R($slave_id) debug digest]
-        } else {
-            show_cluster_status
-            fail "Replica not reconnecting"
-        }
-
-        # Prevent the slave from receiving master updates, and at
-        # the same time send a new script several times to the
-        # master, so that we'll end with EVALSHA into the backlog.
-        $R($slave_id) slaveof 127.0.0.1 0
-
-        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
-        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
-        $R($master_id) EVALSHA e6e0b547500efcec21eddb619ac3724081afee89 0
-
-        catch {
-            $R($slave_id) config rewrite
-            restart_server [expr {0-$slave_id}] true false
-            set R($slave_id) [srv [expr {0-$slave_id}] client]
-        }
-
-        # Reconfigure the slave correctly again, when it's back online.
-        set retry 50
-        while {$retry} {
-            if {[catch {
-                $R($slave_id) slaveof $master_host $master_port
-            }]} {
-                after 1000
-            } else {
-                break
-            }
-            incr retry -1
-        }
-
-        # The master should be back at 4 slaves eventually
-        wait_for_condition 50 1000 {
-            [status $R($master_id) connected_slaves] == 4
-        } else {
-            show_cluster_status
-            fail "Replica not reconnecting"
-        }
-        set new_sync_count [status $R($master_id) sync_full]
-        assert {$sync_count == $new_sync_count}
-
-        # However if the slave started with the full state of the
-        # scripting engine, we should now have the same digest.
-        wait_for_condition 50 1000 {
-            [$R($master_id) debug digest] == [$R($slave_id) debug digest]
-        } else {
-            show_cluster_status
-            fail "Debug digest mismatch between master and replica in post-restart handshake"
-        }
-    }
-
-    if {$no_exit} {
-        while 1 { puts -nonewline .; flush stdout; after 1000}
-    }
-
-}}}}}
diff --git a/redis-stable/tests/integration/rdb.tcl b/redis-stable/tests/integration/rdb.tcl
deleted file mode 100644
index e652e557..00000000
--- a/redis-stable/tests/integration/rdb.tcl
+++ /dev/null
@@ -1,314 +0,0 @@
-tags {"rdb"} {
-
-set server_path [tmpdir "server.rdb-encoding-test"]
-
-# Copy RDB with different encodings in server path
-exec cp tests/assets/encodings.rdb $server_path
-
-start_server [list overrides [list "dir" $server_path "dbfilename" "encodings.rdb"]] {
-  test "RDB encoding loading test" {
-    r select 0
-    csvdump r
-  } {"0","compressible","string","aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
-"0","hash","hash","a","1","aa","10","aaa","100","b","2","bb","20","bbb","200","c","3","cc","30","ccc","300","ddd","400","eee","5000000000",
-"0","hash_zipped","hash","a","1","b","2","c","3",
-"0","list","list","1","2","3","a","b","c","100000","6000000000","1","2","3","a","b","c","100000","6000000000","1","2","3","a","b","c","100000","6000000000",
-"0","list_zipped","list","1","2","3","a","b","c","100000","6000000000",
-"0","number","string","10"
-"0","set","set","1","100000","2","3","6000000000","a","b","c",
-"0","set_zipped_1","set","1","2","3","4",
-"0","set_zipped_2","set","100000","200000","300000","400000",
-"0","set_zipped_3","set","1000000000","2000000000","3000000000","4000000000","5000000000","6000000000",
-"0","string","string","Hello World"
-"0","zset","zset","a","1","b","2","c","3","aa","10","bb","20","cc","30","aaa","100","bbb","200","ccc","300","aaaa","1000","cccc","123456789","bbbb","5000000000",
-"0","zset_zipped","zset","a","1","b","2","c","3",
-}
-}
-
-set server_path [tmpdir "server.rdb-startup-test"]
-
-start_server [list overrides [list "dir" $server_path] keep_persistence true] {
-    test {Server started empty with non-existing RDB file} {
-        r debug digest
-    } {0000000000000000000000000000000000000000}
-    # Save an RDB file, needed for the next test.
-    r save
-}
-
-start_server [list overrides [list "dir" $server_path] keep_persistence true] {
-    test {Server started empty with empty RDB file} {
-        r debug digest
-    } {0000000000000000000000000000000000000000}
-}
-
-start_server [list overrides [list "dir" $server_path] keep_persistence true] {
-    test {Test RDB stream encoding} {
-        for {set j 0} {$j < 1000} {incr j} {
-            if {rand() < 0.9} {
-                r xadd stream * foo abc
-            } else {
-                r xadd stream * bar $j
-            }
-        }
-        r xgroup create stream mygroup 0
-        set records [r xreadgroup GROUP mygroup Alice COUNT 2 STREAMS stream >]
-        r xdel stream [lindex [lindex [lindex [lindex $records 0] 1] 1] 0]
-        r xack stream mygroup [lindex [lindex [lindex [lindex $records 0] 1] 0] 0]
-        set digest [r debug digest]
-        r config set sanitize-dump-payload no
-        r debug reload
-        set newdigest [r debug digest]
-        assert {$digest eq $newdigest}
-    }
-    test {Test RDB stream encoding - sanitize dump} {
-        r config set sanitize-dump-payload yes
-        r debug reload
-        set newdigest [r debug digest]
-        assert {$digest eq $newdigest}
-    }
-    # delete the stream, maybe valgrind will find something
-    r del stream
-}
-
-# Helper function to start a server and kill it, just to check the error
-# logged.
-set defaults {}
-proc start_server_and_kill_it {overrides code} {
-    upvar defaults defaults srv srv server_path server_path
-    set config [concat $defaults $overrides]
-    set srv [start_server [list overrides $config keep_persistence true]]
-    uplevel 1 $code
-    kill_server $srv
-}
-
-# Make the RDB file unreadable
-file attributes [file join $server_path dump.rdb] -permissions 0222
-
-# Detect root account (it is able to read the file even with 002 perm)
-set isroot 0
-catch {
-    open [file join $server_path dump.rdb]
-    set isroot 1
-}
-
-# Now make sure the server aborted with an error
-if {!$isroot} {
-    start_server_and_kill_it [list "dir" $server_path] {
-        test {Server should not start if RDB file can't be open} {
-            wait_for_condition 50 100 {
-                [string match {*Fatal error loading*} \
-                    [exec tail -1 < [dict get $srv stdout]]]
-            } else {
-                fail "Server started even if RDB was unreadable!"
-            }
-        }
-    }
-}
-
-# Fix permissions of the RDB file.
-file attributes [file join $server_path dump.rdb] -permissions 0666
-
-# Corrupt its CRC64 checksum.
-set filesize [file size [file join $server_path dump.rdb]]
-set fd [open [file join $server_path dump.rdb] r+]
-fconfigure $fd -translation binary
-seek $fd -8 end
-puts -nonewline $fd "foobar00"; # Corrupt the checksum
-close $fd
-
-# Now make sure the server aborted with an error
-start_server_and_kill_it [list "dir" $server_path] {
-    test {Server should not start if RDB is corrupted} {
-        wait_for_condition 50 100 {
-            [string match {*CRC error*} \
-                [exec tail -10 < [dict get $srv stdout]]]
-        } else {
-            fail "Server started even if RDB was corrupted!"
-        }
-    }
-}
-
-start_server {} {
-    test {Test FLUSHALL aborts bgsave} {
-        # 1000 keys with 1ms sleep per key shuld take 1 second
-        r config set rdb-key-save-delay 1000
-        r debug populate 1000
-        r bgsave
-        assert_equal [s rdb_bgsave_in_progress] 1
-        r flushall
-        # wait half a second max
-        wait_for_condition 5 100 {
-            [s rdb_bgsave_in_progress] == 0
-        } else {
-            fail "bgsave not aborted"
-        }
-        # veirfy that bgsave failed, by checking that the change counter is still high
-        assert_lessthan 999 [s rdb_changes_since_last_save]
-        # make sure the server is still writable
-        r set x xx
-    }
-
-    test {bgsave resets the change counter} {
-        r config set rdb-key-save-delay 0
-        r bgsave
-        wait_for_condition 50 100 {
-            [s rdb_bgsave_in_progress] == 0
-        } else {
-            fail "bgsave not done"
-        }
-        assert_equal [s rdb_changes_since_last_save] 0
-    }
-}
-
-test {client freed during loading} {
-    start_server [list overrides [list key-load-delay 10 rdbcompression no]] {
-        # create a big rdb that will take long to load. it is important
-        # for keys to be big since the server processes events only once in 2mb.
-        # 100mb of rdb, 100k keys will load in more than 1 second
-        r debug populate 100000 key 1000
-
-        restart_server 0 false false
-
-        # make sure it's still loading
-        assert_equal [s loading] 1
-
-        # connect and disconnect 10 clients
-        set clients {}
-        for {set j 0} {$j < 10} {incr j} {
-            lappend clients [redis_deferring_client]
-        }
-        foreach rd $clients {
-            $rd debug log bla
-        }
-        foreach rd $clients {
-            $rd read
-        }
-        foreach rd $clients {
-            $rd close
-        }
-
-        # make sure the server freed the clients
-        wait_for_condition 100 100 {
-            [s connected_clients] < 3
-        } else {
-            fail "clients didn't disconnect"
-        }
-
-        # make sure it's still loading
-        assert_equal [s loading] 1
-
-        # no need to keep waiting for loading to complete
-        exec kill [srv 0 pid]
-    }
-}
-
-# Our COW metrics (Private_Dirty) work only on Linux
-set system_name [string tolower [exec uname -s]]
-if {$system_name eq {linux}} {
-
-start_server {overrides {save ""}} {
-    test {Test child sending info} {
-        # make sure that rdb_last_cow_size and current_cow_size are zero (the test using new server),
-        # so that the comparisons during the test will be valid
-        assert {[s current_cow_size] == 0}
-        assert {[s current_save_keys_processed] == 0}
-        assert {[s current_save_keys_total] == 0}
-
-        assert {[s rdb_last_cow_size] == 0}
-
-        # using a 200us delay, the bgsave is empirically taking about 10 seconds.
-        # we need it to take more than some 5 seconds, since redis only report COW once a second.
-        r config set rdb-key-save-delay 200
-        r config set loglevel debug
-
-        # populate the db with 10k keys of 4k each
-        set rd [redis_deferring_client 0]
-        set size 4096
-        set cmd_count 10000
-        for {set k 0} {$k < $cmd_count} {incr k} {
-            $rd set key$k [string repeat A $size]
-        }
-
-        for {set k 0} {$k < $cmd_count} {incr k} {
-            catch { $rd read }
-        }
-
-        $rd close
-
-        # start background rdb save
-        r bgsave
-
-        set current_save_keys_total [s current_save_keys_total]
-        if {$::verbose} {
-            puts "Keys before bgsave start: current_save_keys_total"
-        }
-
-        # on each iteration, we will write some key to the server to trigger copy-on-write, and
-        # wait to see that it reflected in INFO.
-        set iteration 1
-        while 1 {
-            # take samples before writing new data to the server
-            set cow_size [s current_cow_size]
-            if {$::verbose} {
-                puts "COW info before copy-on-write: $cow_size"
-            }
-
-            set keys_processed [s current_save_keys_processed]
-            if {$::verbose} {
-                puts "current_save_keys_processed info : $keys_processed"
-            }
-
-            # trigger copy-on-write
-            r setrange key$iteration 0 [string repeat B $size]
-
-            # wait to see that current_cow_size value updated (as long as the child is in progress)
-            wait_for_condition 80 100 {
-                [s rdb_bgsave_in_progress] == 0 ||
-                [s current_cow_size] >= $cow_size + $size && 
-                [s current_save_keys_processed] > $keys_processed &&
-                [s current_fork_perc] > 0
-            } else {
-                if {$::verbose} {
-                    puts "COW info on fail: [s current_cow_size]"
-                    puts [exec tail -n 100 < [srv 0 stdout]]
-                }
-                fail "COW info wasn't reported"
-            }
-
-            # assert that $keys_processed is not greater than total keys.
-            assert_morethan_equal $current_save_keys_total $keys_processed
-
-            # for no accurate, stop after 2 iterations
-            if {!$::accurate && $iteration == 2} {
-                break
-            }
-
-            # stop iterating if the bgsave completed
-            if { [s rdb_bgsave_in_progress] == 0 } {
-                break
-            }
-
-            incr iteration 1
-        }
-
-        # make sure we saw report of current_cow_size
-        if {$iteration < 2 && $::verbose} {
-            puts [exec tail -n 100 < [srv 0 stdout]]
-        }
-        assert_morethan_equal $iteration 2
-
-        # if bgsave completed, check that rdb_last_cow_size (fork exit report)
-        # is at least 90% of last rdb_active_cow_size.
-        if { [s rdb_bgsave_in_progress] == 0 } {
-            set final_cow [s rdb_last_cow_size]
-            set cow_size [expr $cow_size * 0.9]
-            if {$final_cow < $cow_size && $::verbose} {
-                puts [exec tail -n 100 < [srv 0 stdout]]
-            }
-            assert_morethan_equal $final_cow $cow_size
-        }
-    }
-}
-} ;# system_name
-
-} ;# tags
diff --git a/redis-stable/tests/integration/redis-benchmark.tcl b/redis-stable/tests/integration/redis-benchmark.tcl
deleted file mode 100644
index 3684d7c3..00000000
--- a/redis-stable/tests/integration/redis-benchmark.tcl
+++ /dev/null
@@ -1,168 +0,0 @@
-source tests/support/benchmark.tcl
-
-
-proc cmdstat {cmd} {
-    return [cmdrstat $cmd r]
-}
-
-start_server {tags {"benchmark network"}} {
-    start_server {} {
-        set master_host [srv 0 host]
-        set master_port [srv 0 port]
-
-        test {benchmark: set,get} {
-            r config resetstat
-            r flushall
-            set cmd [redisbenchmark $master_host $master_port "-c 5 -n 10 -e -t set,get"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            assert_match  {*calls=10,*} [cmdstat set]
-            assert_match  {*calls=10,*} [cmdstat get]
-            # assert one of the non benchmarked commands is not present
-            assert_match  {} [cmdstat lrange]
-        }
-
-        test {benchmark: full test suite} {
-            r config resetstat
-            set cmd [redisbenchmark $master_host $master_port "-c 10 -n 100 -e"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            # ping total calls are 2*issued commands per test due to PING_INLINE and PING_MBULK
-            assert_match  {*calls=200,*} [cmdstat ping]
-            assert_match  {*calls=100,*} [cmdstat set]
-            assert_match  {*calls=100,*} [cmdstat get]
-            assert_match  {*calls=100,*} [cmdstat incr]
-            # lpush total calls are 2*issued commands per test due to the lrange tests
-            assert_match  {*calls=200,*} [cmdstat lpush]
-            assert_match  {*calls=100,*} [cmdstat rpush]
-            assert_match  {*calls=100,*} [cmdstat lpop]
-            assert_match  {*calls=100,*} [cmdstat rpop]
-            assert_match  {*calls=100,*} [cmdstat sadd]
-            assert_match  {*calls=100,*} [cmdstat hset]
-            assert_match  {*calls=100,*} [cmdstat spop]
-            assert_match  {*calls=100,*} [cmdstat zadd]
-            assert_match  {*calls=100,*} [cmdstat zpopmin]
-            assert_match  {*calls=400,*} [cmdstat lrange]
-            assert_match  {*calls=100,*} [cmdstat mset]
-            # assert one of the non benchmarked commands is not present
-            assert_match {} [cmdstat rpoplpush]
-        }
-
-        test {benchmark: multi-thread set,get} {
-            r config resetstat
-            r flushall
-            set cmd [redisbenchmark $master_host $master_port "--threads 10 -c 5 -n 10 -e -t set,get"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            assert_match  {*calls=10,*} [cmdstat set]
-            assert_match  {*calls=10,*} [cmdstat get]
-            # assert one of the non benchmarked commands is not present
-            assert_match  {} [cmdstat lrange]
-
-            # ensure only one key was populated
-            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
-        }
-
-        test {benchmark: pipelined full set,get} {
-            r config resetstat
-            r flushall
-            set cmd [redisbenchmark $master_host $master_port "-P 5 -c 10 -n 10010 -e -t set,get"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            assert_match  {*calls=10010,*} [cmdstat set]
-            assert_match  {*calls=10010,*} [cmdstat get]
-            # assert one of the non benchmarked commands is not present
-            assert_match  {} [cmdstat lrange]
-
-            # ensure only one key was populated
-            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
-        }
-
-        test {benchmark: arbitrary command} {
-            r config resetstat
-            r flushall
-            set cmd [redisbenchmark $master_host $master_port "-c 5 -n 150 -e INCRBYFLOAT mykey 10.0"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            assert_match  {*calls=150,*} [cmdstat incrbyfloat]
-            # assert one of the non benchmarked commands is not present
-            assert_match  {} [cmdstat get]
-
-            # ensure only one key was populated
-            assert_match  {1} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
-        }
-
-        test {benchmark: keyspace length} {
-            r flushall
-            r config resetstat
-            set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000"]
-            if {[catch { exec {*}$cmd } error]} {
-                set first_line [lindex [split $error "\n"] 0]
-                puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                fail "redis-benchmark non zero code. first line: $first_line"
-            }
-            assert_match  {*calls=1000,*} [cmdstat set]
-            # assert one of the non benchmarked commands is not present
-            assert_match  {} [cmdstat get]
-
-            # ensure the keyspace has the desired size
-            assert_match  {50} [scan [regexp -inline {keys\=([\d]*)} [r info keyspace]] keys=%d]
-        }
-
-        # tls specific tests
-        if {$::tls} {
-            test {benchmark: specific tls-ciphers} {
-                r flushall
-                r config resetstat
-                set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000 --tls-ciphers \"DEFAULT:-AES128-SHA256\""]
-                if {[catch { exec {*}$cmd } error]} {
-                    set first_line [lindex [split $error "\n"] 0]
-                    puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                    fail "redis-benchmark non zero code. first line: $first_line"
-                }
-                assert_match  {*calls=1000,*} [cmdstat set]
-                # assert one of the non benchmarked commands is not present
-                assert_match  {} [cmdstat get]
-            }
-
-            test {benchmark: specific tls-ciphersuites} {
-                r flushall
-                r config resetstat
-                set ciphersuites_supported 1
-                set cmd [redisbenchmark $master_host $master_port "-r 50 -t set -n 1000 --tls-ciphersuites \"TLS_AES_128_GCM_SHA256\""]
-                if {[catch { exec {*}$cmd } error]} {
-                    set first_line [lindex [split $error "\n"] 0]
-                    if {[string match "*Invalid option*" $first_line]} {
-                        set ciphersuites_supported 0
-                        if {$::verbose} {
-                            puts "Skipping test, TLSv1.3 not supported."
-                        }
-                    } else {
-                        puts [colorstr red "redis-benchmark non zero code. first line: $first_line"]
-                        fail "redis-benchmark non zero code. first line: $first_line"
-                    }
-                }
-                if {$ciphersuites_supported} {
-                    assert_match  {*calls=1000,*} [cmdstat set]
-                    # assert one of the non benchmarked commands is not present
-                    assert_match  {} [cmdstat get]
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/redis-cli.tcl b/redis-stable/tests/integration/redis-cli.tcl
deleted file mode 100644
index 3117cb6a..00000000
--- a/redis-stable/tests/integration/redis-cli.tcl
+++ /dev/null
@@ -1,374 +0,0 @@
-source tests/support/cli.tcl
-
-start_server {tags {"cli"}} {
-    proc open_cli {{opts "-n 9"} {infile ""}} {
-        set ::env(TERM) dumb
-        set cmdline [rediscli [srv host] [srv port] $opts]
-        if {$infile ne ""} {
-            set cmdline "$cmdline < $infile"
-            set mode "r"
-        } else {
-            set mode "r+"
-        }
-        set fd [open "|$cmdline" $mode]
-        fconfigure $fd -buffering none
-        fconfigure $fd -blocking false
-        fconfigure $fd -translation binary
-        set _ $fd
-    }
-
-    proc close_cli {fd} {
-        close $fd
-    }
-
-    proc read_cli {fd} {
-        set buf [read $fd]
-        while {[string length $buf] == 0} {
-            # wait some time and try again
-            after 10
-            set buf [read $fd]
-        }
-        set _ $buf
-    }
-
-    proc write_cli {fd buf} {
-        puts $fd $buf
-        flush $fd
-    }
-
-    # Helpers to run tests in interactive mode
-
-    proc format_output {output} {
-        set _ [string trimright [regsub -all "\r" $output ""] "\n"]
-    }
-
-    proc run_command {fd cmd} {
-        write_cli $fd $cmd
-        set _ [format_output [read_cli $fd]]
-    }
-
-    proc test_interactive_cli {name code} {
-        set ::env(FAKETTY) 1
-        set fd [open_cli]
-        test "Interactive CLI: $name" $code
-        close_cli $fd
-        unset ::env(FAKETTY)
-    }
-
-    # Helpers to run tests where stdout is not a tty
-    proc write_tmpfile {contents} {
-        set tmp [tmpfile "cli"]
-        set tmpfd [open $tmp "w"]
-        puts -nonewline $tmpfd $contents
-        close $tmpfd
-        set _ $tmp
-    }
-
-    proc _run_cli {host port db opts args} {
-        set cmd [rediscli $host $port [list -n $db {*}$args]]
-        foreach {key value} $opts {
-            if {$key eq "pipe"} {
-                set cmd "sh -c \"$value | $cmd\""
-            }
-            if {$key eq "path"} {
-                set cmd "$cmd < $value"
-            }
-        }
-
-        set fd [open "|$cmd" "r"]
-        fconfigure $fd -buffering none
-        fconfigure $fd -translation binary
-        set resp [read $fd 1048576]
-        close $fd
-        set _ [format_output $resp]
-    }
-
-    proc run_cli {args} {
-        _run_cli [srv host] [srv port] 9 {} {*}$args
-    }
-
-    proc run_cli_with_input_pipe {cmd args} {
-        _run_cli [srv host] [srv port] 9 [list pipe $cmd] -x {*}$args
-    }
-
-    proc run_cli_with_input_file {path args} {
-        _run_cli [srv host] [srv port] 9 [list path $path] -x {*}$args
-    }
-
-    proc run_cli_host_port_db {host port db args} {
-        _run_cli $host $port $db {} {*}$args
-    }
-
-    proc test_nontty_cli {name code} {
-        test "Non-interactive non-TTY CLI: $name" $code
-    }
-
-    # Helpers to run tests where stdout is a tty (fake it)
-    proc test_tty_cli {name code} {
-        set ::env(FAKETTY) 1
-        test "Non-interactive TTY CLI: $name" $code
-        unset ::env(FAKETTY)
-    }
-
-    test_interactive_cli "INFO response should be printed raw" {
-        set lines [split [run_command $fd info] "\n"]
-        foreach line $lines {
-            assert [regexp {^$|^#|^[^#:]+:} $line]
-        }
-    }
-
-    test_interactive_cli "Status reply" {
-        assert_equal "OK" [run_command $fd "set key foo"]
-    }
-
-    test_interactive_cli "Integer reply" {
-        assert_equal "(integer) 1" [run_command $fd "incr counter"]
-    }
-
-    test_interactive_cli "Bulk reply" {
-        r set key foo
-        assert_equal "\"foo\"" [run_command $fd "get key"]
-    }
-
-    test_interactive_cli "Multi-bulk reply" {
-        r rpush list foo
-        r rpush list bar
-        assert_equal "1) \"foo\"\n2) \"bar\"" [run_command $fd "lrange list 0 -1"]
-    }
-
-    test_interactive_cli "Parsing quotes" {
-        assert_equal "OK" [run_command $fd "set key \"bar\""]
-        assert_equal "bar" [r get key]
-        assert_equal "OK" [run_command $fd "set key \" bar \""]
-        assert_equal " bar " [r get key]
-        assert_equal "OK" [run_command $fd "set key \"\\\"bar\\\"\""]
-        assert_equal "\"bar\"" [r get key]
-        assert_equal "OK" [run_command $fd "set key \"\tbar\t\""]
-        assert_equal "\tbar\t" [r get key]
-
-        # invalid quotation
-        assert_equal "Invalid argument(s)" [run_command $fd "get \"\"key"]
-        assert_equal "Invalid argument(s)" [run_command $fd "get \"key\"x"]
-
-        # quotes after the argument are weird, but should be allowed
-        assert_equal "OK" [run_command $fd "set key\"\" bar"]
-        assert_equal "bar" [r get key]
-    }
-
-    test_tty_cli "Status reply" {
-        assert_equal "OK" [run_cli set key bar]
-        assert_equal "bar" [r get key]
-    }
-
-    test_tty_cli "Integer reply" {
-        r del counter
-        assert_equal "(integer) 1" [run_cli incr counter]
-    }
-
-    test_tty_cli "Bulk reply" {
-        r set key "tab\tnewline\n"
-        assert_equal "\"tab\\tnewline\\n\"" [run_cli get key]
-    }
-
-    test_tty_cli "Multi-bulk reply" {
-        r del list
-        r rpush list foo
-        r rpush list bar
-        assert_equal "1) \"foo\"\n2) \"bar\"" [run_cli lrange list 0 -1]
-    }
-
-    test_tty_cli "Read last argument from pipe" {
-        assert_equal "OK" [run_cli_with_input_pipe "echo foo" set key]
-        assert_equal "foo\n" [r get key]
-    }
-
-    test_tty_cli "Read last argument from file" {
-        set tmpfile [write_tmpfile "from file"]
-        assert_equal "OK" [run_cli_with_input_file $tmpfile set key]
-        assert_equal "from file" [r get key]
-        file delete $tmpfile
-    }
-
-    test_nontty_cli "Status reply" {
-        assert_equal "OK" [run_cli set key bar]
-        assert_equal "bar" [r get key]
-    }
-
-    test_nontty_cli "Integer reply" {
-        r del counter
-        assert_equal "1" [run_cli incr counter]
-    }
-
-    test_nontty_cli "Bulk reply" {
-        r set key "tab\tnewline\n"
-        assert_equal "tab\tnewline" [run_cli get key]
-    }
-
-    test_nontty_cli "Multi-bulk reply" {
-        r del list
-        r rpush list foo
-        r rpush list bar
-        assert_equal "foo\nbar" [run_cli lrange list 0 -1]
-    }
-
-if {!$::tls} { ;# fake_redis_node doesn't support TLS
-    test_nontty_cli "ASK redirect test" {
-        # Set up two fake Redis nodes.
-        set tclsh [info nameofexecutable]
-        set script "tests/helpers/fake_redis_node.tcl"
-        set port1 [find_available_port $::baseport $::portcount]
-        set port2 [find_available_port $::baseport $::portcount]
-        set p1 [exec $tclsh $script $port1 \
-                "SET foo bar" "-ASK 12182 127.0.0.1:$port2" &]
-        set p2 [exec $tclsh $script $port2 \
-                "ASKING" "+OK" \
-                "SET foo bar" "+OK" &]
-        # Make sure both fake nodes have started listening
-        wait_for_condition 50 50 {
-            [catch {close [socket "127.0.0.1" $port1]}] == 0 && \
-            [catch {close [socket "127.0.0.1" $port2]}] == 0
-        } else {
-            fail "Failed to start fake Redis nodes"
-        }
-        # Run the cli
-        assert_equal "OK" [run_cli_host_port_db "127.0.0.1" $port1 0 -c SET foo bar]
-    }
-}
-
-    test_nontty_cli "Quoted input arguments" {
-        r set "\x00\x00" "value"
-        assert_equal "value" [run_cli --quoted-input get {"\x00\x00"}]
-    }
-
-    test_nontty_cli "No accidental unquoting of input arguments" {
-        run_cli --quoted-input set {"\x41\x41"} quoted-val
-        run_cli set {"\x41\x41"} unquoted-val
-        assert_equal "quoted-val" [r get AA]
-        assert_equal "unquoted-val" [r get {"\x41\x41"}]
-    }
-
-    test_nontty_cli "Invalid quoted input arguments" {
-        catch {run_cli --quoted-input set {"Unterminated}} err
-        assert_match {*exited abnormally*} $err
-
-        # A single arg that unquotes to two arguments is also not expected
-        catch {run_cli --quoted-input set {"arg1" "arg2"}} err
-        assert_match {*exited abnormally*} $err
-    }
-
-    test_nontty_cli "Read last argument from pipe" {
-        assert_equal "OK" [run_cli_with_input_pipe "echo foo" set key]
-        assert_equal "foo\n" [r get key]
-    }
-
-    test_nontty_cli "Read last argument from file" {
-        set tmpfile [write_tmpfile "from file"]
-        assert_equal "OK" [run_cli_with_input_file $tmpfile set key]
-        assert_equal "from file" [r get key]
-        file delete $tmpfile
-    }
-
-    proc test_redis_cli_rdb_dump {} {
-        r flushdb
-
-        set dir [lindex [r config get dir] 1]
-
-        assert_equal "OK" [r debug populate 100000 key 1000]
-        catch {run_cli --rdb "$dir/cli.rdb"} output
-        assert_match {*Transfer finished with success*} $output
-
-        file delete "$dir/dump.rdb"
-        file rename "$dir/cli.rdb" "$dir/dump.rdb"
-
-        assert_equal "OK" [r set should-not-exist 1]
-        assert_equal "OK" [r debug reload nosave]
-        assert_equal {} [r get should-not-exist]
-    }
-
-    test "Dumping an RDB" {
-        # Disk-based master
-        assert_match "OK" [r config set repl-diskless-sync no]
-        test_redis_cli_rdb_dump
-
-        # Disk-less master
-        assert_match "OK" [r config set repl-diskless-sync yes]
-        assert_match "OK" [r config set repl-diskless-sync-delay 0]
-        test_redis_cli_rdb_dump
-    }
-
-    test "Scan mode" {
-        r flushdb
-        populate 1000 key: 1
-
-        # basic use
-        assert_equal 1000 [llength [split [run_cli --scan]]]
-
-        # pattern
-        assert_equal {key:2} [run_cli --scan --pattern "*:2"]
-
-        # pattern matching with a quoted string
-        assert_equal {key:2} [run_cli --scan --quoted-pattern {"*:\x32"}]
-    }
-
-    proc test_redis_cli_repl {} {
-        set fd [open_cli "--replica"]
-        wait_for_condition 500 100 {
-            [string match {*slave0:*state=online*} [r info]]
-        } else {
-            fail "redis-cli --replica did not connect"
-        }
-
-        for {set i 0} {$i < 100} {incr i} {
-           r set test-key test-value-$i
-        }
-
-        wait_for_condition 500 100 {
-            [string match {*test-value-99*} [read_cli $fd]]
-        } else {
-            fail "redis-cli --replica didn't read commands"
-        }
-
-        fconfigure $fd -blocking true
-        r client kill type slave
-        catch { close_cli $fd } err
-        assert_match {*Server closed the connection*} $err
-    }
-
-    test "Connecting as a replica" {
-        # Disk-based master
-        assert_match "OK" [r config set repl-diskless-sync no]
-        test_redis_cli_repl
-
-        # Disk-less master
-        assert_match "OK" [r config set repl-diskless-sync yes]
-        assert_match "OK" [r config set repl-diskless-sync-delay 0]
-        test_redis_cli_repl
-    } {}
-
-    test "Piping raw protocol" {
-        set cmds [tmpfile "cli_cmds"]
-        set cmds_fd [open $cmds "w"]
-
-        puts $cmds_fd [formatCommand select 9]
-        puts $cmds_fd [formatCommand del test-counter]
-
-        for {set i 0} {$i < 1000} {incr i} {
-            puts $cmds_fd [formatCommand incr test-counter]
-            puts $cmds_fd [formatCommand set large-key [string repeat "x" 20000]]
-        }
-
-        for {set i 0} {$i < 100} {incr i} {
-            puts $cmds_fd [formatCommand set very-large-key [string repeat "x" 512000]]
-        }
-        close $cmds_fd
-
-        set cli_fd [open_cli "--pipe" $cmds]
-        fconfigure $cli_fd -blocking true
-        set output [read_cli $cli_fd]
-
-        assert_equal {1000} [r get test-counter]
-        assert_match {*All data transferred*errors: 0*replies: 2102*} $output
-
-        file delete $cmds
-    }
-}
diff --git a/redis-stable/tests/integration/replication-2.tcl b/redis-stable/tests/integration/replication-2.tcl
deleted file mode 100644
index 9524f356..00000000
--- a/redis-stable/tests/integration/replication-2.tcl
+++ /dev/null
@@ -1,92 +0,0 @@
-start_server {tags {"repl"}} {
-    start_server {} {
-        test {First server should have role slave after SLAVEOF} {
-            r -1 slaveof [srv 0 host] [srv 0 port]
-            wait_for_condition 50 100 {
-                [s -1 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        test {If min-slaves-to-write is honored, write is accepted} {
-            r config set min-slaves-to-write 1
-            r config set min-slaves-max-lag 10
-            r set foo 12345
-            wait_for_condition 50 100 {
-                [r -1 get foo] eq {12345}
-            } else {
-                fail "Write did not reached replica"
-            }
-        }
-
-        test {No write if min-slaves-to-write is < attached slaves} {
-            r config set min-slaves-to-write 2
-            r config set min-slaves-max-lag 10
-            catch {r set foo 12345} err
-            set err
-        } {NOREPLICAS*}
-
-        test {If min-slaves-to-write is honored, write is accepted (again)} {
-            r config set min-slaves-to-write 1
-            r config set min-slaves-max-lag 10
-            r set foo 12345
-            wait_for_condition 50 100 {
-                [r -1 get foo] eq {12345}
-            } else {
-                fail "Write did not reached replica"
-            }
-        }
-
-        test {No write if min-slaves-max-lag is > of the slave lag} {
-            r config set min-slaves-to-write 1
-            r config set min-slaves-max-lag 2
-            exec kill -SIGSTOP [srv -1 pid]
-            assert {[r set foo 12345] eq {OK}}
-            wait_for_condition 100 100 {
-                [catch {r set foo 12345}] != 0
-            } else {
-                fail "Master didn't become readonly"
-            }
-            catch {r set foo 12345} err
-            assert_match {NOREPLICAS*} $err
-        }
-        exec kill -SIGCONT [srv -1 pid]
-
-        test {min-slaves-to-write is ignored by slaves} {
-            r config set min-slaves-to-write 1
-            r config set min-slaves-max-lag 10
-            r -1 config set min-slaves-to-write 1
-            r -1 config set min-slaves-max-lag 10
-            r set foo aaabbb
-            wait_for_condition 50 100 {
-                [r -1 get foo] eq {aaabbb}
-            } else {
-                fail "Write did not reached replica"
-            }
-        }
-
-        # Fix parameters for the next test to work
-        r config set min-slaves-to-write 0
-        r -1 config set min-slaves-to-write 0
-        r flushall
-
-        test {MASTER and SLAVE dataset should be identical after complex ops} {
-            createComplexDataset r 10000
-            after 500
-            if {[r debug digest] ne [r -1 debug digest]} {
-                set csv1 [csvdump r]
-                set csv2 [csvdump {r -1}]
-                set fd [open /tmp/repldump1.txt w]
-                puts -nonewline $fd $csv1
-                close $fd
-                set fd [open /tmp/repldump2.txt w]
-                puts -nonewline $fd $csv2
-                close $fd
-                puts "Master - Replica inconsistency"
-                puts "Run diff -u against /tmp/repldump*.txt for more info"
-            }
-            assert_equal [r debug digest] [r -1 debug digest]
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/replication-3.tcl b/redis-stable/tests/integration/replication-3.tcl
deleted file mode 100644
index 43eb5353..00000000
--- a/redis-stable/tests/integration/replication-3.tcl
+++ /dev/null
@@ -1,134 +0,0 @@
-start_server {tags {"repl"}} {
-    start_server {} {
-        test {First server should have role slave after SLAVEOF} {
-            r -1 slaveof [srv 0 host] [srv 0 port]
-            wait_for_condition 50 100 {
-                [s -1 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        if {$::accurate} {set numops 50000} else {set numops 5000}
-
-        test {MASTER and SLAVE consistency with expire} {
-            createComplexDataset r $numops useexpire
-            after 4000 ;# Make sure everything expired before taking the digest
-            r keys *   ;# Force DEL syntesizing to slave
-            after 1000 ;# Wait another second. Now everything should be fine.
-            if {[r debug digest] ne [r -1 debug digest]} {
-                set csv1 [csvdump r]
-                set csv2 [csvdump {r -1}]
-                set fd [open /tmp/repldump1.txt w]
-                puts -nonewline $fd $csv1
-                close $fd
-                set fd [open /tmp/repldump2.txt w]
-                puts -nonewline $fd $csv2
-                close $fd
-                puts "Master - Replica inconsistency"
-                puts "Run diff -u against /tmp/repldump*.txt for more info"
-            }
-            assert_equal [r debug digest] [r -1 debug digest]
-        }
-
-        test {Slave is able to evict keys created in writable slaves} {
-            r -1 select 5
-            assert {[r -1 dbsize] == 0}
-            r -1 config set slave-read-only no
-            r -1 set key1 1 ex 5
-            r -1 set key2 2 ex 5
-            r -1 set key3 3 ex 5
-            assert {[r -1 dbsize] == 3}
-            after 6000
-            r -1 dbsize
-        } {0}
-    }
-}
-
-start_server {tags {"repl"}} {
-    start_server {} {
-        test {First server should have role slave after SLAVEOF} {
-            r -1 slaveof [srv 0 host] [srv 0 port]
-            wait_for_condition 50 100 {
-                [s -1 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        set numops 20000 ;# Enough to trigger the Script Cache LRU eviction.
-
-        # While we are at it, enable AOF to test it will be consistent as well
-        # after the test.
-        r config set appendonly yes
-
-        test {MASTER and SLAVE consistency with EVALSHA replication} {
-            array set oldsha {}
-            for {set j 0} {$j < $numops} {incr j} {
-                set key "key:$j"
-                # Make sure to create scripts that have different SHA1s
-                set script "return redis.call('incr','$key')"
-                set sha1 [r eval "return redis.sha1hex(\"$script\")" 0]
-                set oldsha($j) $sha1
-                r eval $script 0
-                set res [r evalsha $sha1 0]
-                assert {$res == 2}
-                # Additionally call one of the old scripts as well, at random.
-                set res [r evalsha $oldsha([randomInt $j]) 0]
-                assert {$res > 2}
-
-                # Trigger an AOF rewrite while we are half-way, this also
-                # forces the flush of the script cache, and we will cover
-                # more code as a result.
-                if {$j == $numops / 2} {
-                    catch {r bgrewriteaof}
-                }
-            }
-
-            wait_for_condition 50 100 {
-                [r dbsize] == $numops &&
-                [r -1 dbsize] == $numops &&
-                [r debug digest] eq [r -1 debug digest]
-            } else {
-                set csv1 [csvdump r]
-                set csv2 [csvdump {r -1}]
-                set fd [open /tmp/repldump1.txt w]
-                puts -nonewline $fd $csv1
-                close $fd
-                set fd [open /tmp/repldump2.txt w]
-                puts -nonewline $fd $csv2
-                close $fd
-                puts "Master - Replica inconsistency"
-                puts "Run diff -u against /tmp/repldump*.txt for more info"
-            }
-
-            set old_digest [r debug digest]
-            r config set appendonly no
-            r debug loadaof
-            set new_digest [r debug digest]
-            assert {$old_digest eq $new_digest}
-        }
-
-        test {SLAVE can reload "lua" AUX RDB fields of duplicated scripts} {
-            # Force a Slave full resynchronization
-            r debug change-repl-id
-            r -1 client kill type master
-
-            # Check that after a full resync the slave can still load
-            # correctly the RDB file: such file will contain "lua" AUX
-            # sections with scripts already in the memory of the master.
-
-            wait_for_condition 500 100 {
-                [s -1 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-
-            wait_for_condition 50 100 {
-                [r debug digest] eq [r -1 debug digest]
-            } else {
-                fail "DEBUG DIGEST mismatch after full SYNC with many scripts"
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/replication-4.tcl b/redis-stable/tests/integration/replication-4.tcl
deleted file mode 100644
index e4ac83e1..00000000
--- a/redis-stable/tests/integration/replication-4.tcl
+++ /dev/null
@@ -1,143 +0,0 @@
-start_server {tags {"repl network"}} {
-    start_server {} {
-
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000]
-        set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000]
-        set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000]
-
-        test {First server should have role slave after SLAVEOF} {
-            $slave slaveof $master_host $master_port
-            after 1000
-            s 0 role
-        } {slave}
-
-        test {Test replication with parallel clients writing in different DBs} {
-            after 5000
-            stop_bg_complex_data $load_handle0
-            stop_bg_complex_data $load_handle1
-            stop_bg_complex_data $load_handle2
-            wait_for_condition 100 100 {
-                [$master debug digest] == [$slave debug digest]
-            } else {
-                set csv1 [csvdump r]
-                set csv2 [csvdump {r -1}]
-                set fd [open /tmp/repldump1.txt w]
-                puts -nonewline $fd $csv1
-                close $fd
-                set fd [open /tmp/repldump2.txt w]
-                puts -nonewline $fd $csv2
-                close $fd
-                fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
-            }
-            assert {[$master dbsize] > 0}
-        }
-    }
-}
-
-start_server {tags {"repl"}} {
-    start_server {} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        test {First server should have role slave after SLAVEOF} {
-            $slave slaveof $master_host $master_port
-            wait_for_condition 50 100 {
-                [s 0 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        test {With min-slaves-to-write (1,3): master should be writable} {
-            $master config set min-slaves-max-lag 3
-            $master config set min-slaves-to-write 1
-            $master set foo bar
-        } {OK}
-
-        test {With min-slaves-to-write (2,3): master should not be writable} {
-            $master config set min-slaves-max-lag 3
-            $master config set min-slaves-to-write 2
-            catch {$master set foo bar} e
-            set e
-        } {NOREPLICAS*}
-
-        test {With min-slaves-to-write: master not writable with lagged slave} {
-            $master config set min-slaves-max-lag 2
-            $master config set min-slaves-to-write 1
-            assert {[$master set foo bar] eq {OK}}
-            exec kill -SIGSTOP [srv 0 pid]
-            wait_for_condition 100 100 {
-                [catch {$master set foo bar}] != 0
-            } else {
-                fail "Master didn't become readonly"
-            }
-            catch {$master set foo bar} err
-            assert_match {NOREPLICAS*} $err
-            exec kill -SIGCONT [srv 0 pid]
-        }
-    }
-}
-
-start_server {tags {"repl"}} {
-    start_server {} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        test {First server should have role slave after SLAVEOF} {
-            $slave slaveof $master_host $master_port
-            wait_for_condition 50 100 {
-                [s 0 role] eq {slave}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        test {Replication: commands with many arguments (issue #1221)} {
-            # We now issue large MSET commands, that may trigger a specific
-            # class of bugs, see issue #1221.
-            for {set j 0} {$j < 100} {incr j} {
-                set cmd [list mset]
-                for {set x 0} {$x < 1000} {incr x} {
-                    lappend cmd [randomKey] [randomValue]
-                }
-                $master {*}$cmd
-            }
-
-            set retry 10
-            while {$retry && ([$master debug digest] ne [$slave debug digest])}\
-            {
-                after 1000
-                incr retry -1
-            }
-            assert {[$master dbsize] > 0}
-        }
-
-        test {Replication of SPOP command -- alsoPropagate() API} {
-            $master del myset
-            set size [expr 1+[randomInt 100]]
-            set content {}
-            for {set j 0} {$j < $size} {incr j} {
-                lappend content [randomValue]
-            }
-            $master sadd myset {*}$content
-
-            set count [randomInt 100]
-            set result [$master spop myset $count]
-
-            wait_for_condition 50 100 {
-                [$master debug digest] eq [$slave debug digest]
-            } else {
-                fail "SPOP replication inconsistency"
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/integration/replication-psync.tcl b/redis-stable/tests/integration/replication-psync.tcl
deleted file mode 100644
index 08e21d31..00000000
--- a/redis-stable/tests/integration/replication-psync.tcl
+++ /dev/null
@@ -1,141 +0,0 @@
-# Creates a master-slave pair and breaks the link continuously to force
-# partial resyncs attempts, all this while flooding the master with
-# write queries.
-#
-# You can specify backlog size, ttl, delay before reconnection, test duration
-# in seconds, and an additional condition to verify at the end.
-#
-# If reconnect is > 0, the test actually try to break the connection and
-# reconnect with the master, otherwise just the initial synchronization is
-# checked for consistency.
-proc test_psync {descr duration backlog_size backlog_ttl delay cond mdl sdl reconnect} {
-    start_server {tags {"repl"}} {
-        start_server {} {
-
-            set master [srv -1 client]
-            set master_host [srv -1 host]
-            set master_port [srv -1 port]
-            set slave [srv 0 client]
-
-            $master config set repl-backlog-size $backlog_size
-            $master config set repl-backlog-ttl $backlog_ttl
-            $master config set repl-diskless-sync $mdl
-            $master config set repl-diskless-sync-delay 1
-            $slave config set repl-diskless-load $sdl
-
-            set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000]
-            set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000]
-            set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000]
-
-            test {Slave should be able to synchronize with the master} {
-                $slave slaveof $master_host $master_port
-                wait_for_condition 50 100 {
-                    [lindex [r role] 0] eq {slave} &&
-                    [lindex [r role] 3] eq {connected}
-                } else {
-                    fail "Replication not started."
-                }
-            }
-
-            # Check that the background clients are actually writing.
-            test {Detect write load to master} {
-                wait_for_condition 50 1000 {
-                    [$master dbsize] > 100
-                } else {
-                    fail "Can't detect write load from background clients."
-                }
-            }
-
-            test "Test replication partial resync: $descr (diskless: $mdl, $sdl, reconnect: $reconnect)" {
-                # Now while the clients are writing data, break the maste-slave
-                # link multiple times.
-                if ($reconnect) {
-                    for {set j 0} {$j < $duration*10} {incr j} {
-                        after 100
-                        # catch {puts "MASTER [$master dbsize] keys, REPLICA [$slave dbsize] keys"}
-
-                        if {($j % 20) == 0} {
-                            catch {
-                                if {$delay} {
-                                    $slave multi
-                                    $slave client kill $master_host:$master_port
-                                    $slave debug sleep $delay
-                                    $slave exec
-                                } else {
-                                    $slave client kill $master_host:$master_port
-                                }
-                            }
-                        }
-                    }
-                }
-                stop_bg_complex_data $load_handle0
-                stop_bg_complex_data $load_handle1
-                stop_bg_complex_data $load_handle2
-
-                # Wait for the slave to reach the "online"
-                # state from the POV of the master.
-                set retry 5000
-                while {$retry} {
-                    set info [$master info]
-                    if {[string match {*slave0:*state=online*} $info]} {
-                        break
-                    } else {
-                        incr retry -1
-                        after 100
-                    }
-                }
-                if {$retry == 0} {
-                    error "assertion:Slave not correctly synchronized"
-                }
-
-                # Wait that slave acknowledge it is online so
-                # we are sure that DBSIZE and DEBUG DIGEST will not
-                # fail because of timing issues. (-LOADING error)
-                wait_for_condition 5000 100 {
-                    [lindex [$slave role] 3] eq {connected}
-                } else {
-                    fail "Slave still not connected after some time"
-                }  
-
-                wait_for_condition 100 100 {
-                    [$master debug digest] == [$slave debug digest]
-                } else {
-                    set csv1 [csvdump r]
-                    set csv2 [csvdump {r -1}]
-                    set fd [open /tmp/repldump1.txt w]
-                    puts -nonewline $fd $csv1
-                    close $fd
-                    set fd [open /tmp/repldump2.txt w]
-                    puts -nonewline $fd $csv2
-                    close $fd
-                    fail "Master - Replica inconsistency, Run diff -u against /tmp/repldump*.txt for more info"
-                }
-                assert {[$master dbsize] > 0}
-                eval $cond
-            }
-        }
-    }
-}
-
-foreach mdl {no yes} {
-    foreach sdl {disabled swapdb} {
-        test_psync {no reconnection, just sync} 6 1000000 3600 0 {
-        } $mdl $sdl 0
-
-        test_psync {ok psync} 6 100000000 3600 0 {
-        assert {[s -1 sync_partial_ok] > 0}
-        } $mdl $sdl 1
-
-        test_psync {no backlog} 6 100 3600 0.5 {
-        assert {[s -1 sync_partial_err] > 0}
-        } $mdl $sdl 1
-
-        test_psync {ok after delay} 3 100000000 3600 3 {
-        assert {[s -1 sync_partial_ok] > 0}
-        } $mdl $sdl 1
-
-        test_psync {backlog expired} 3 100000000 1 3 {
-        assert {[s -1 sync_partial_err] > 0}
-        } $mdl $sdl 1
-    }
-}
diff --git a/redis-stable/tests/integration/replication.tcl b/redis-stable/tests/integration/replication.tcl
deleted file mode 100644
index 916dd324..00000000
--- a/redis-stable/tests/integration/replication.tcl
+++ /dev/null
@@ -1,928 +0,0 @@
-proc log_file_matches {log pattern} {
-    set fp [open $log r]
-    set content [read $fp]
-    close $fp
-    string match $pattern $content
-}
-
-start_server {tags {"repl network"}} {
-    set slave [srv 0 client]
-    set slave_host [srv 0 host]
-    set slave_port [srv 0 port]
-    set slave_log [srv 0 stdout]
-    start_server {} {
-        set master [srv 0 client]
-        set master_host [srv 0 host]
-        set master_port [srv 0 port]
-
-        # Configure the master in order to hang waiting for the BGSAVE
-        # operation, so that the slave remains in the handshake state.
-        $master config set repl-diskless-sync yes
-        $master config set repl-diskless-sync-delay 1000
-
-        # Use a short replication timeout on the slave, so that if there
-        # are no bugs the timeout is triggered in a reasonable amount
-        # of time.
-        $slave config set repl-timeout 5
-
-        # Start the replication process...
-        $slave slaveof $master_host $master_port
-
-        test {Slave enters handshake} {
-            wait_for_condition 50 1000 {
-                [string match *handshake* [$slave role]]
-            } else {
-                fail "Replica does not enter handshake state"
-            }
-        }
-
-        # But make the master unable to send
-        # the periodic newlines to refresh the connection. The slave
-        # should detect the timeout.
-        $master debug sleep 10
-
-        test {Slave is able to detect timeout during handshake} {
-            wait_for_condition 50 1000 {
-                [log_file_matches $slave_log "*Timeout connecting to the MASTER*"]
-            } else {
-                fail "Replica is not able to detect timeout"
-            }
-        }
-    }
-}
-
-start_server {tags {"repl"}} {
-    set A [srv 0 client]
-    set A_host [srv 0 host]
-    set A_port [srv 0 port]
-    start_server {} {
-        set B [srv 0 client]
-        set B_host [srv 0 host]
-        set B_port [srv 0 port]
-
-        test {Set instance A as slave of B} {
-            $A slaveof $B_host $B_port
-            wait_for_condition 50 100 {
-                [lindex [$A role] 0] eq {slave} &&
-                [string match {*master_link_status:up*} [$A info replication]]
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-        }
-
-        test {INCRBYFLOAT replication, should not remove expire} {
-            r set test 1 EX 100
-            r incrbyfloat test 0.1
-            after 1000
-            assert_equal [$A debug digest] [$B debug digest]
-        }
-
-        test {GETSET replication} {
-            $A config resetstat
-            $A config set loglevel debug
-            $B config set loglevel debug
-            r set test foo
-            assert_equal [r getset test bar] foo
-            wait_for_condition 500 10 {
-                [$A get test] eq "bar"
-            } else {
-                fail "getset wasn't propagated"
-            }
-            assert_equal [r set test vaz get] bar
-            wait_for_condition 500 10 {
-                [$A get test] eq "vaz"
-            } else {
-                fail "set get wasn't propagated"
-            }
-            assert_match {*calls=3,*} [cmdrstat set $A]
-            assert_match {} [cmdrstat getset $A]
-        }
-
-        test {BRPOPLPUSH replication, when blocking against empty list} {
-            $A config resetstat
-            set rd [redis_deferring_client]
-            $rd brpoplpush a b 5
-            r lpush a foo
-            wait_for_condition 50 100 {
-                [$A debug digest] eq [$B debug digest]
-            } else {
-                fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
-            }
-            assert_match {*calls=1,*} [cmdrstat rpoplpush $A]
-            assert_match {} [cmdrstat lmove $A]
-        }
-
-        test {BRPOPLPUSH replication, list exists} {
-            $A config resetstat
-            set rd [redis_deferring_client]
-            r lpush c 1
-            r lpush c 2
-            r lpush c 3
-            $rd brpoplpush c d 5
-            after 1000
-            assert_equal [$A debug digest] [$B debug digest]
-            assert_match {*calls=1,*} [cmdrstat rpoplpush $A]
-            assert_match {} [cmdrstat lmove $A]
-        }
-
-        foreach wherefrom {left right} {
-            foreach whereto {left right} {
-                test "BLMOVE ($wherefrom, $whereto) replication, when blocking against empty list" {
-                    $A config resetstat
-                    set rd [redis_deferring_client]
-                    $rd blmove a b $wherefrom $whereto 5
-                    r lpush a foo
-                    wait_for_condition 50 100 {
-                        [$A debug digest] eq [$B debug digest]
-                    } else {
-                        fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
-                    }
-                    assert_match {*calls=1,*} [cmdrstat lmove $A]
-                    assert_match {} [cmdrstat rpoplpush $A]
-                }
-
-                test "BLMOVE ($wherefrom, $whereto) replication, list exists" {
-                    $A config resetstat
-                    set rd [redis_deferring_client]
-                    r lpush c 1
-                    r lpush c 2
-                    r lpush c 3
-                    $rd blmove c d $wherefrom $whereto 5
-                    after 1000
-                    assert_equal [$A debug digest] [$B debug digest]
-                    assert_match {*calls=1,*} [cmdrstat lmove $A]
-                    assert_match {} [cmdrstat rpoplpush $A]
-                }
-            }
-        }
-
-        test {BLPOP followed by role change, issue #2473} {
-            set rd [redis_deferring_client]
-            $rd blpop foo 0 ; # Block while B is a master
-
-            # Turn B into master of A
-            $A slaveof no one
-            $B slaveof $A_host $A_port
-            wait_for_condition 50 100 {
-                [lindex [$B role] 0] eq {slave} &&
-                [string match {*master_link_status:up*} [$B info replication]]
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-
-            # Push elements into the "foo" list of the new replica.
-            # If the client is still attached to the instance, we'll get
-            # a desync between the two instances.
-            $A rpush foo a b c
-            after 100
-
-            wait_for_condition 50 100 {
-                [$A debug digest] eq [$B debug digest] &&
-                [$A lrange foo 0 -1] eq {a b c} &&
-                [$B lrange foo 0 -1] eq {a b c}
-            } else {
-                fail "Master and replica have different digest: [$A debug digest] VS [$B debug digest]"
-            }
-        }
-    }
-}
-
-start_server {tags {"repl"}} {
-    r set mykey foo
-
-    start_server {} {
-        test {Second server should have role master at first} {
-            s role
-        } {master}
-
-        test {SLAVEOF should start with link status "down"} {
-            r multi
-            r slaveof [srv -1 host] [srv -1 port]
-            r info replication
-            r exec
-        } {*master_link_status:down*}
-
-        test {The role should immediately be changed to "replica"} {
-            s role
-        } {slave}
-
-        wait_for_sync r
-        test {Sync should have transferred keys from master} {
-            r get mykey
-        } {foo}
-
-        test {The link status should be up} {
-            s master_link_status
-        } {up}
-
-        test {SET on the master should immediately propagate} {
-            r -1 set mykey bar
-
-            wait_for_condition 500 100 {
-                [r  0 get mykey] eq {bar}
-            } else {
-                fail "SET on master did not propagated on replica"
-            }
-        }
-
-        test {FLUSHALL should replicate} {
-            r -1 flushall
-            if {$::valgrind} {after 2000}
-            list [r -1 dbsize] [r 0 dbsize]
-        } {0 0}
-
-        test {ROLE in master reports master with a slave} {
-            set res [r -1 role]
-            lassign $res role offset slaves
-            assert {$role eq {master}}
-            assert {$offset > 0}
-            assert {[llength $slaves] == 1}
-            lassign [lindex $slaves 0] master_host master_port slave_offset
-            assert {$slave_offset <= $offset}
-        }
-
-        test {ROLE in slave reports slave in connected state} {
-            set res [r role]
-            lassign $res role master_host master_port slave_state slave_offset
-            assert {$role eq {slave}}
-            assert {$slave_state eq {connected}}
-        }
-    }
-}
-
-foreach mdl {no yes} {
-    foreach sdl {disabled swapdb} {
-        start_server {tags {"repl"}} {
-            set master [srv 0 client]
-            $master config set repl-diskless-sync $mdl
-            $master config set repl-diskless-sync-delay 1
-            set master_host [srv 0 host]
-            set master_port [srv 0 port]
-            set slaves {}
-            start_server {} {
-                lappend slaves [srv 0 client]
-                start_server {} {
-                    lappend slaves [srv 0 client]
-                    start_server {} {
-                        lappend slaves [srv 0 client]
-                        test "Connect multiple replicas at the same time (issue #141), master diskless=$mdl, replica diskless=$sdl" {
-                            # start load handles only inside the test, so that the test can be skipped
-                            set load_handle0 [start_bg_complex_data $master_host $master_port 9 100000000]
-                            set load_handle1 [start_bg_complex_data $master_host $master_port 11 100000000]
-                            set load_handle2 [start_bg_complex_data $master_host $master_port 12 100000000]
-                            set load_handle3 [start_write_load $master_host $master_port 8]
-                            set load_handle4 [start_write_load $master_host $master_port 4]
-                            after 5000 ;# wait for some data to accumulate so that we have RDB part for the fork
-
-                            # Send SLAVEOF commands to slaves
-                            [lindex $slaves 0] config set repl-diskless-load $sdl
-                            [lindex $slaves 1] config set repl-diskless-load $sdl
-                            [lindex $slaves 2] config set repl-diskless-load $sdl
-                            [lindex $slaves 0] slaveof $master_host $master_port
-                            [lindex $slaves 1] slaveof $master_host $master_port
-                            [lindex $slaves 2] slaveof $master_host $master_port
-
-                            # Wait for all the three slaves to reach the "online"
-                            # state from the POV of the master.
-                            set retry 500
-                            while {$retry} {
-                                set info [r -3 info]
-                                if {[string match {*slave0:*state=online*slave1:*state=online*slave2:*state=online*} $info]} {
-                                    break
-                                } else {
-                                    incr retry -1
-                                    after 100
-                                }
-                            }
-                            if {$retry == 0} {
-                                error "assertion:Slaves not correctly synchronized"
-                            }
-
-                            # Wait that slaves acknowledge they are online so
-                            # we are sure that DBSIZE and DEBUG DIGEST will not
-                            # fail because of timing issues.
-                            wait_for_condition 500 100 {
-                                [lindex [[lindex $slaves 0] role] 3] eq {connected} &&
-                                [lindex [[lindex $slaves 1] role] 3] eq {connected} &&
-                                [lindex [[lindex $slaves 2] role] 3] eq {connected}
-                            } else {
-                                fail "Slaves still not connected after some time"
-                            }
-
-                            # Stop the write load
-                            stop_bg_complex_data $load_handle0
-                            stop_bg_complex_data $load_handle1
-                            stop_bg_complex_data $load_handle2
-                            stop_write_load $load_handle3
-                            stop_write_load $load_handle4
-
-                            # Make sure no more commands processed
-                            wait_load_handlers_disconnected
-
-                            wait_for_ofs_sync $master [lindex $slaves 0]
-                            wait_for_ofs_sync $master [lindex $slaves 1]
-                            wait_for_ofs_sync $master [lindex $slaves 2]
-
-                            # Check digests
-                            set digest [$master debug digest]
-                            set digest0 [[lindex $slaves 0] debug digest]
-                            set digest1 [[lindex $slaves 1] debug digest]
-                            set digest2 [[lindex $slaves 2] debug digest]
-                            assert {$digest ne 0000000000000000000000000000000000000000}
-                            assert {$digest eq $digest0}
-                            assert {$digest eq $digest1}
-                            assert {$digest eq $digest2}
-                        }
-                   }
-                }
-            }
-        }
-    }
-}
-
-start_server {tags {"repl"}} {
-    set master [srv 0 client]
-    set master_host [srv 0 host]
-    set master_port [srv 0 port]
-    start_server {} {
-        test "Master stream is correctly processed while the replica has a script in -BUSY state" {
-            set load_handle0 [start_write_load $master_host $master_port 3]
-            set slave [srv 0 client]
-            $slave config set lua-time-limit 500
-            $slave slaveof $master_host $master_port
-
-            # Wait for the slave to be online
-            wait_for_condition 500 100 {
-                [lindex [$slave role] 3] eq {connected}
-            } else {
-                fail "Replica still not connected after some time"
-            }
-
-            # Wait some time to make sure the master is sending data
-            # to the slave.
-            after 5000
-
-            # Stop the ability of the slave to process data by sendig
-            # a script that will put it in BUSY state.
-            $slave eval {for i=1,3000000000 do end} 0
-
-            # Wait some time again so that more master stream will
-            # be processed.
-            after 2000
-
-            # Stop the write load
-            stop_write_load $load_handle0
-
-            # number of keys
-            wait_for_condition 500 100 {
-                [$master debug digest] eq [$slave debug digest]
-            } else {
-                fail "Different datasets between replica and master"
-            }
-        }
-    }
-}
-
-test {slave fails full sync and diskless load swapdb recovers it} {
-    start_server {tags {"repl"}} {
-        set slave [srv 0 client]
-        set slave_host [srv 0 host]
-        set slave_port [srv 0 port]
-        set slave_log [srv 0 stdout]
-        start_server {} {
-            set master [srv 0 client]
-            set master_host [srv 0 host]
-            set master_port [srv 0 port]
-
-            # Put different data sets on the master and slave
-            # we need to put large keys on the master since the slave replies to info only once in 2mb
-            $slave debug populate 2000 slave 10
-            $master debug populate 200 master 100000
-            $master config set rdbcompression no
-
-            # Set master and slave to use diskless replication
-            $master config set repl-diskless-sync yes
-            $master config set repl-diskless-sync-delay 0
-            $slave config set repl-diskless-load swapdb
-
-            # Set master with a slow rdb generation, so that we can easily disconnect it mid sync
-            # 10ms per key, with 200 keys is 2 seconds
-            $master config set rdb-key-save-delay 10000
-
-            # Start the replication process...
-            $slave slaveof $master_host $master_port
-
-            # wait for the slave to start reading the rdb
-            wait_for_condition 50 100 {
-                [s -1 loading] eq 1
-            } else {
-                fail "Replica didn't get into loading mode"
-            }
-
-            # make sure that next sync will not start immediately so that we can catch the slave in betweeen syncs
-            $master config set repl-diskless-sync-delay 5
-            # for faster server shutdown, make rdb saving fast again (the fork is already uses the slow one)
-            $master config set rdb-key-save-delay 0
-
-            # waiting slave to do flushdb (key count drop)
-            wait_for_condition 50 100 {
-                2000 != [scan [regexp -inline {keys\=([\d]*)} [$slave info keyspace]] keys=%d]
-            } else {
-                fail "Replica didn't flush"
-            }
-
-            # make sure we're still loading
-            assert_equal [s -1 loading] 1
-
-            # kill the slave connection on the master
-            set killed [$master client kill type slave]
-
-            # wait for loading to stop (fail)
-            wait_for_condition 50 100 {
-                [s -1 loading] eq 0
-            } else {
-                fail "Replica didn't disconnect"
-            }
-
-            # make sure the original keys were restored
-            assert_equal [$slave dbsize] 2000
-        }
-    }
-}
-
-test {diskless loading short read} {
-    start_server {tags {"repl"}} {
-        set replica [srv 0 client]
-        set replica_host [srv 0 host]
-        set replica_port [srv 0 port]
-        start_server {} {
-            set master [srv 0 client]
-            set master_host [srv 0 host]
-            set master_port [srv 0 port]
-
-            # Set master and replica to use diskless replication
-            $master config set repl-diskless-sync yes
-            $master config set rdbcompression no
-            $replica config set repl-diskless-load swapdb
-            $master config set hz 500
-            $replica config set hz 500
-            $master config set dynamic-hz no
-            $replica config set dynamic-hz no
-            # Try to fill the master with all types of data types / encodings
-            set start [clock clicks -milliseconds]
-            for {set k 0} {$k < 3} {incr k} {
-                for {set i 0} {$i < 10} {incr i} {
-                    r set "$k int_$i" [expr {int(rand()*10000)}]
-                    r expire "$k int_$i" [expr {int(rand()*10000)}]
-                    r set "$k string_$i" [string repeat A [expr {int(rand()*1000000)}]]
-                    r hset "$k hash_small" [string repeat A [expr {int(rand()*10)}]]  0[string repeat A [expr {int(rand()*10)}]]
-                    r hset "$k hash_large" [string repeat A [expr {int(rand()*10000)}]] [string repeat A [expr {int(rand()*1000000)}]]
-                    r sadd "$k set_small" [string repeat A [expr {int(rand()*10)}]]
-                    r sadd "$k set_large" [string repeat A [expr {int(rand()*1000000)}]]
-                    r zadd "$k zset_small" [expr {rand()}] [string repeat A [expr {int(rand()*10)}]]
-                    r zadd "$k zset_large" [expr {rand()}] [string repeat A [expr {int(rand()*1000000)}]]
-                    r lpush "$k list_small" [string repeat A [expr {int(rand()*10)}]]
-                    r lpush "$k list_large" [string repeat A [expr {int(rand()*1000000)}]]
-                    for {set j 0} {$j < 10} {incr j} {
-                        r xadd "$k stream" * foo "asdf" bar "1234"
-                    }
-                    r xgroup create "$k stream" "mygroup_$i" 0
-                    r xreadgroup GROUP "mygroup_$i" Alice COUNT 1 STREAMS "$k stream" >
-                }
-            }
-
-            if {$::verbose} {
-                set end [clock clicks -milliseconds]
-                set duration [expr $end - $start]
-                puts "filling took $duration ms (TODO: use pipeline)"
-                set start [clock clicks -milliseconds]
-            }
-
-            # Start the replication process...
-            set loglines [count_log_lines -1]
-            $master config set repl-diskless-sync-delay 0
-            $replica replicaof $master_host $master_port
-
-            # kill the replication at various points
-            set attempts 100
-            if {$::accurate} { set attempts 500 }
-            for {set i 0} {$i < $attempts} {incr i} {
-                # wait for the replica to start reading the rdb
-                # using the log file since the replica only responds to INFO once in 2mb
-                set res [wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 2000 1]
-                set loglines [lindex $res 1]
-
-                # add some additional random sleep so that we kill the master on a different place each time
-                after [expr {int(rand()*50)}]
-
-                # kill the replica connection on the master
-                set killed [$master client kill type replica]
-
-                set res [wait_for_log_messages -1 {"*Internal error in RDB*" "*Finished with success*" "*Successful partial resynchronization*"} $loglines 1000 1]
-                if {$::verbose} { puts $res }
-                set log_text [lindex $res 0]
-                set loglines [lindex $res 1]
-                if {![string match "*Internal error in RDB*" $log_text]} {
-                    # force the replica to try another full sync
-                    $master multi
-                    $master client kill type replica
-                    $master set asdf asdf
-                    # the side effect of resizing the backlog is that it is flushed (16k is the min size)
-                    $master config set repl-backlog-size [expr {16384 + $i}]
-                    $master exec
-                }
-                # wait for loading to stop (fail)
-                wait_for_condition 1000 1 {
-                    [s -1 loading] eq 0
-                } else {
-                    fail "Replica didn't disconnect"
-                }
-            }
-            if {$::verbose} {
-                set end [clock clicks -milliseconds]
-                set duration [expr $end - $start]
-                puts "test took $duration ms"
-            }
-            # enable fast shutdown
-            $master config set rdb-key-save-delay 0
-        }
-    }
-}
-
-# get current stime and utime metrics for a thread (since it's creation)
-proc get_cpu_metrics { statfile } {
-    if { [ catch {
-        set fid   [ open $statfile r ]
-        set data  [ read $fid 1024 ]
-        ::close $fid
-        set data  [ split $data ]
-
-        ;## number of jiffies it has been scheduled...
-        set utime [ lindex $data 13 ]
-        set stime [ lindex $data 14 ]
-    } err ] } {
-        error "assertion:can't parse /proc: $err"
-    }
-    set mstime [clock milliseconds]
-    return [ list $mstime $utime $stime ]
-}
-
-# compute %utime and %stime of a thread between two measurements
-proc compute_cpu_usage {start end} {
-    set clock_ticks [exec getconf CLK_TCK]
-    # convert ms time to jiffies and calc delta
-    set dtime [ expr { ([lindex $end 0] - [lindex $start 0]) * double($clock_ticks) / 1000 } ]
-    set utime [ expr { [lindex $end 1] - [lindex $start 1] } ]
-    set stime [ expr { [lindex $end 2] - [lindex $start 2] } ]
-    set pucpu  [ expr { ($utime / $dtime) * 100 } ]
-    set pscpu  [ expr { ($stime / $dtime) * 100 } ]
-    return [ list $pucpu $pscpu ]
-}
-
-
-# test diskless rdb pipe with multiple replicas, which may drop half way
-start_server {tags {"repl"}} {
-    set master [srv 0 client]
-    $master config set repl-diskless-sync yes
-    $master config set repl-diskless-sync-delay 1
-    set master_host [srv 0 host]
-    set master_port [srv 0 port]
-    set master_pid [srv 0 pid]
-    # put enough data in the db that the rdb file will be bigger than the socket buffers
-    # and since we'll have key-load-delay of 100, 20000 keys will take at least 2 seconds
-    # we also need the replica to process requests during transfer (which it does only once in 2mb)
-    $master debug populate 20000 test 10000
-    $master config set rdbcompression no
-    # If running on Linux, we also measure utime/stime to detect possible I/O handling issues
-    set os [catch {exec uname}]
-    set measure_time [expr {$os == "Linux"} ? 1 : 0]
-    foreach all_drop {no slow fast all timeout} {
-        test "diskless $all_drop replicas drop during rdb pipe" {
-            set replicas {}
-            set replicas_alive {}
-            # start one replica that will read the rdb fast, and one that will be slow
-            start_server {} {
-                lappend replicas [srv 0 client]
-                lappend replicas_alive [srv 0 client]
-                start_server {} {
-                    lappend replicas [srv 0 client]
-                    lappend replicas_alive [srv 0 client]
-
-                    # start replication
-                    # it's enough for just one replica to be slow, and have it's write handler enabled
-                    # so that the whole rdb generation process is bound to that
-                    set loglines [count_log_lines -1]
-                    [lindex $replicas 0] config set repl-diskless-load swapdb
-                    [lindex $replicas 0] config set key-load-delay 100 ;# 20k keys and 100 microseconds sleep means at least 2 seconds
-                    [lindex $replicas 0] replicaof $master_host $master_port
-                    [lindex $replicas 1] replicaof $master_host $master_port
-
-                    # wait for the replicas to start reading the rdb
-                    # using the log file since the replica only responds to INFO once in 2mb
-                    wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 800 10
-
-                    if {$measure_time} {
-                        set master_statfile "/proc/$master_pid/stat"
-                        set master_start_metrics [get_cpu_metrics $master_statfile]
-                        set start_time [clock seconds]
-                    }
-
-                    # wait a while so that the pipe socket writer will be
-                    # blocked on write (since replica 0 is slow to read from the socket)
-                    after 500
-
-                    # add some command to be present in the command stream after the rdb.
-                    $master incr $all_drop
-
-                    # disconnect replicas depending on the current test
-                    set loglines [count_log_lines -2]
-                    if {$all_drop == "all" || $all_drop == "fast"} {
-                        exec kill [srv 0 pid]
-                        set replicas_alive [lreplace $replicas_alive 1 1]
-                    }
-                    if {$all_drop == "all" || $all_drop == "slow"} {
-                        exec kill [srv -1 pid]
-                        set replicas_alive [lreplace $replicas_alive 0 0]
-                    }
-                    if {$all_drop == "timeout"} {
-                        $master config set repl-timeout 2
-                        # we want the slow replica to hang on a key for very long so it'll reach repl-timeout
-                        exec kill -SIGSTOP [srv -1 pid]
-                        after 2000
-                    }
-
-                    # wait for rdb child to exit
-                    wait_for_condition 500 100 {
-                        [s -2 rdb_bgsave_in_progress] == 0
-                    } else {
-                        fail "rdb child didn't terminate"
-                    }
-
-                    # make sure we got what we were aiming for, by looking for the message in the log file
-                    if {$all_drop == "all"} {
-                        wait_for_log_messages -2 {"*Diskless rdb transfer, last replica dropped, killing fork child*"} $loglines 1 1
-                    }
-                    if {$all_drop == "no"} {
-                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 2 replicas still up*"} $loglines 1 1
-                    }
-                    if {$all_drop == "slow" || $all_drop == "fast"} {
-                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 1 replicas still up*"} $loglines 1 1
-                    }
-                    if {$all_drop == "timeout"} {
-                        wait_for_log_messages -2 {"*Disconnecting timedout replica (full sync)*"} $loglines 1 1
-                        wait_for_log_messages -2 {"*Diskless rdb transfer, done reading from pipe, 1 replicas still up*"} $loglines 1 1
-                        # master disconnected the slow replica, remove from array
-                        set replicas_alive [lreplace $replicas_alive 0 0]
-                        # release it
-                        exec kill -SIGCONT [srv -1 pid]
-                    }
-
-                    # make sure we don't have a busy loop going thought epoll_wait
-                    if {$measure_time} {
-                        set master_end_metrics [get_cpu_metrics $master_statfile]
-                        set time_elapsed [expr {[clock seconds]-$start_time}]
-                        set master_cpu [compute_cpu_usage $master_start_metrics $master_end_metrics]
-                        set master_utime [lindex $master_cpu 0]
-                        set master_stime [lindex $master_cpu 1]
-                        if {$::verbose} {
-                            puts "elapsed: $time_elapsed"
-                            puts "master utime: $master_utime"
-                            puts "master stime: $master_stime"
-                        }
-                        if {!$::no_latency && ($all_drop == "all" || $all_drop == "slow" || $all_drop == "timeout")} {
-                            assert {$master_utime < 70}
-                            assert {$master_stime < 70}
-                        }
-                        if {!$::no_latency && ($all_drop == "none" || $all_drop == "fast")} {
-                            assert {$master_utime < 15}
-                            assert {$master_stime < 15}
-                        }
-                    }
-
-                    # verify the data integrity
-                    foreach replica $replicas_alive {
-                        # Wait that replicas acknowledge they are online so
-                        # we are sure that DBSIZE and DEBUG DIGEST will not
-                        # fail because of timing issues.
-                        wait_for_condition 150 100 {
-                            [lindex [$replica role] 3] eq {connected}
-                        } else {
-                            fail "replicas still not connected after some time"
-                        }
-
-                        # Make sure that replicas and master have same
-                        # number of keys
-                        wait_for_condition 50 100 {
-                            [$master dbsize] == [$replica dbsize]
-                        } else {
-                            fail "Different number of keys between master and replicas after too long time."
-                        }
-
-                        # Check digests
-                        set digest [$master debug digest]
-                        set digest0 [$replica debug digest]
-                        assert {$digest ne 0000000000000000000000000000000000000000}
-                        assert {$digest eq $digest0}
-                    }
-                }
-            }
-        }
-    }
-}
-
-test "diskless replication child being killed is collected" {
-    # when diskless master is waiting for the replica to become writable
-    # it removes the read event from the rdb pipe so if the child gets killed
-    # the replica will hung. and the master may not collect the pid with waitpid
-    start_server {tags {"repl"}} {
-        set master [srv 0 client]
-        set master_host [srv 0 host]
-        set master_port [srv 0 port]
-        set master_pid [srv 0 pid]
-        $master config set repl-diskless-sync yes
-        $master config set repl-diskless-sync-delay 0
-        # put enough data in the db that the rdb file will be bigger than the socket buffers
-        $master debug populate 20000 test 10000
-        $master config set rdbcompression no
-        start_server {} {
-            set replica [srv 0 client]
-            set loglines [count_log_lines 0]
-            $replica config set repl-diskless-load swapdb
-            $replica config set key-load-delay 1000000
-            $replica replicaof $master_host $master_port
-
-            # wait for the replicas to start reading the rdb
-            wait_for_log_messages 0 {"*Loading DB in memory*"} $loglines 800 10
-
-            # wait to be sure the eplica is hung and the master is blocked on write
-            after 500
-
-            # simulate the OOM killer or anyone else kills the child
-            set fork_child_pid [get_child_pid -1]
-            exec kill -9 $fork_child_pid
-
-            # wait for the parent to notice the child have exited
-            wait_for_condition 50 100 {
-                [s -1 rdb_bgsave_in_progress] == 0
-            } else {
-                fail "rdb child didn't terminate"
-            }
-        }
-    }
-}
-
-test "diskless replication read pipe cleanup" {
-    # In diskless replication, we create a read pipe for the RDB, between the child and the parent.
-    # When we close this pipe (fd), the read handler also needs to be removed from the event loop (if it still registered).
-    # Otherwise, next time we will use the same fd, the registration will be fail (panic), because
-    # we will use EPOLL_CTL_MOD (the fd still register in the event loop), on fd that already removed from epoll_ctl
-    start_server {tags {"repl"}} {
-        set master [srv 0 client]
-        set master_host [srv 0 host]
-        set master_port [srv 0 port]
-        set master_pid [srv 0 pid]
-        $master config set repl-diskless-sync yes
-        $master config set repl-diskless-sync-delay 0
-
-        # put enough data in the db, and slowdown the save, to keep the parent busy at the read process
-        $master config set rdb-key-save-delay 100000
-        $master debug populate 20000 test 10000
-        $master config set rdbcompression no
-        start_server {} {
-            set replica [srv 0 client]
-            set loglines [count_log_lines 0]
-            $replica config set repl-diskless-load swapdb
-            $replica replicaof $master_host $master_port
-
-            # wait for the replicas to start reading the rdb
-            wait_for_log_messages 0 {"*Loading DB in memory*"} $loglines 800 10
-
-            set loglines [count_log_lines 0]
-            # send FLUSHALL so the RDB child will be killed
-            $master flushall
-
-            # wait for another RDB child process to be started
-            wait_for_log_messages -1 {"*Background RDB transfer started by pid*"} $loglines 800 10
-
-            # make sure master is alive
-            $master ping
-        }
-    }
-}
-
-test {replicaof right after disconnection} {
-    # this is a rare race condition that was reproduced sporadically by the psync2 unit.
-    # see details in #7205
-    start_server {tags {"repl"}} {
-        set replica1 [srv 0 client]
-        set replica1_host [srv 0 host]
-        set replica1_port [srv 0 port]
-        set replica1_log [srv 0 stdout]
-        start_server {} {
-            set replica2 [srv 0 client]
-            set replica2_host [srv 0 host]
-            set replica2_port [srv 0 port]
-            set replica2_log [srv 0 stdout]
-            start_server {} {
-                set master [srv 0 client]
-                set master_host [srv 0 host]
-                set master_port [srv 0 port]
-                $replica1 replicaof $master_host $master_port
-                $replica2 replicaof $master_host $master_port
-
-                wait_for_condition 50 100 {
-                    [string match {*master_link_status:up*} [$replica1 info replication]] &&
-                    [string match {*master_link_status:up*} [$replica2 info replication]]
-                } else {
-                    fail "Can't turn the instance into a replica"
-                }
-
-                set rd [redis_deferring_client -1]
-                $rd debug sleep 1
-                after 100
-
-                # when replica2 will wake up from the sleep it will find both disconnection
-                # from it's master and also a replicaof command at the same event loop
-                $master client kill type replica
-                $replica2 replicaof $replica1_host $replica1_port
-                $rd read
-
-                wait_for_condition 50 100 {
-                    [string match {*master_link_status:up*} [$replica2 info replication]]
-                } else {
-                    fail "role change failed."
-                }
-
-                # make sure psync succeeded, and there were no unexpected full syncs.
-                assert_equal [status $master sync_full] 2
-                assert_equal [status $replica1 sync_full] 0
-                assert_equal [status $replica2 sync_full] 0
-            }
-        }
-    }
-}
-
-test {Kill rdb child process if its dumping RDB is not useful} {
-    start_server {tags {"repl"}} {
-        set slave1 [srv 0 client]
-        start_server {} {
-            set slave2 [srv 0 client]
-            start_server {} {
-                set master [srv 0 client]
-                set master_host [srv 0 host]
-                set master_port [srv 0 port]
-                for {set i 0} {$i < 10} {incr i} {
-                    $master set $i $i
-                }
-                # Generating RDB will cost 10s(10 * 1s)
-                $master config set rdb-key-save-delay 1000000
-                $master config set repl-diskless-sync no
-                $master config set save ""
-
-                $slave1 slaveof $master_host $master_port
-                $slave2 slaveof $master_host $master_port
-
-                # Wait for starting child
-                wait_for_condition 50 100 {
-                    ([s 0 rdb_bgsave_in_progress] == 1) &&
-                    ([string match "*wait_bgsave*" [s 0 slave0]]) &&
-                    ([string match "*wait_bgsave*" [s 0 slave1]])
-                } else {
-                    fail "rdb child didn't start"
-                }
-
-                # Slave1 disconnect with master
-                $slave1 slaveof no one
-                # Shouldn't kill child since another slave wait for rdb
-                after 100
-                assert {[s 0 rdb_bgsave_in_progress] == 1}
-
-                # Slave2 disconnect with master
-                $slave2 slaveof no one
-                # Should kill child
-                wait_for_condition 100 10 {
-                    [s 0 rdb_bgsave_in_progress] eq 0
-                } else {
-                    fail "can't kill rdb child"
-                }
-
-                # If have save parameters, won't kill child
-                $master config set save "900 1"
-                $slave1 slaveof $master_host $master_port
-                $slave2 slaveof $master_host $master_port
-                wait_for_condition 50 100 {
-                    ([s 0 rdb_bgsave_in_progress] == 1) &&
-                    ([string match "*wait_bgsave*" [s 0 slave0]]) &&
-                    ([string match "*wait_bgsave*" [s 0 slave1]])
-                } else {
-                    fail "rdb child didn't start"
-                }
-                $slave1 slaveof no one
-                $slave2 slaveof no one
-                after 200
-                assert {[s 0 rdb_bgsave_in_progress] == 1}
-                catch {$master shutdown nosave}
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/modules/Makefile b/redis-stable/tests/modules/Makefile
deleted file mode 100644
index ae611de8..00000000
--- a/redis-stable/tests/modules/Makefile
+++ /dev/null
@@ -1,60 +0,0 @@
-
-# find the OS
-uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not')
-
-ifeq ($(uname_S),Darwin)
-	SHOBJ_CFLAGS ?= -W -Wall -dynamic -fno-common -g -ggdb -std=c99 -O2
-	SHOBJ_LDFLAGS ?= -bundle -undefined dynamic_lookup
-else	# Linux, others
-	SHOBJ_CFLAGS ?= -W -Wall -fno-common -g -ggdb -std=c99 -O2
-	SHOBJ_LDFLAGS ?= -shared
-endif
-
-# Needed to satisfy __stack_chk_fail_local on Linux with -m32, due to gcc
-# -fstack-protector by default. Breaks on FreeBSD so we exclude it.
-ifneq ($(uname_S),FreeBSD)
-    LIBS = -lc
-endif
-
-TEST_MODULES = \
-    commandfilter.so \
-    basics.so \
-    testrdb.so \
-    fork.so \
-    infotest.so \
-    propagate.so \
-    misc.so \
-    hooks.so \
-    blockonkeys.so \
-    blockonbackground.so \
-    scan.so \
-    datatype.so \
-    auth.so \
-    keyspace_events.so \
-    blockedclient.so \
-    getkeys.so \
-    test_lazyfree.so \
-    timer.so \
-    defragtest.so \
-    hash.so \
-    zset.so \
-    stream.so
-
-
-.PHONY: all
-
-all: $(TEST_MODULES)
-
-32bit:
-	$(MAKE) CFLAGS="-m32" LDFLAGS="-melf_i386"
-
-%.xo: %.c ../../src/redismodule.h
-	$(CC) -I../../src $(CFLAGS) $(SHOBJ_CFLAGS) -fPIC -c $< -o $@
-
-%.so: %.xo
-	$(LD) -o $@ $< $(SHOBJ_LDFLAGS) $(LDFLAGS) $(LIBS)
-
-.PHONY: clean
-
-clean:
-	rm -f $(TEST_MODULES) $(TEST_MODULES:.so=.xo)
diff --git a/redis-stable/tests/modules/auth.c b/redis-stable/tests/modules/auth.c
deleted file mode 100644
index b13c1038..00000000
--- a/redis-stable/tests/modules/auth.c
+++ /dev/null
@@ -1,90 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-// A simple global user
-static RedisModuleUser *global = NULL;
-static long long client_change_delta = 0;
-
-void UserChangedCallback(uint64_t client_id, void *privdata) {
-    REDISMODULE_NOT_USED(privdata);
-    REDISMODULE_NOT_USED(client_id);
-    client_change_delta++;
-}
-
-int Auth_CreateModuleUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (global) {
-        RedisModule_FreeModuleUser(global);
-    }
-
-    global = RedisModule_CreateModuleUser("global");
-    RedisModule_SetModuleUserACL(global, "allcommands");
-    RedisModule_SetModuleUserACL(global, "allkeys");
-    RedisModule_SetModuleUserACL(global, "on");
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-int Auth_AuthModuleUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    uint64_t client_id;
-    RedisModule_AuthenticateClientWithUser(ctx, global, UserChangedCallback, NULL, &client_id);
-
-    return RedisModule_ReplyWithLongLong(ctx, (uint64_t) client_id);
-}
-
-int Auth_AuthRealUser(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-
-    size_t length;
-    uint64_t client_id;
-
-    RedisModuleString *user_string = argv[1];
-    const char *name = RedisModule_StringPtrLen(user_string, &length);
-
-    if (RedisModule_AuthenticateClientWithACLUser(ctx, name, length, 
-            UserChangedCallback, NULL, &client_id) == REDISMODULE_ERR) {
-        return RedisModule_ReplyWithError(ctx, "Invalid user");   
-    }
-
-    return RedisModule_ReplyWithLongLong(ctx, (uint64_t) client_id);
-}
-
-int Auth_ChangeCount(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    long long result = client_change_delta;
-    client_change_delta = 0;
-    return RedisModule_ReplyWithLongLong(ctx, result);
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"testacl",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"auth.authrealuser",
-        Auth_AuthRealUser,"no-auth",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"auth.createmoduleuser",
-        Auth_CreateModuleUser,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"auth.authmoduleuser",
-        Auth_AuthModuleUser,"no-auth",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"auth.changecount",
-        Auth_ChangeCount,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/basics.c b/redis-stable/tests/modules/basics.c
deleted file mode 100644
index 59ceb2d1..00000000
--- a/redis-stable/tests/modules/basics.c
+++ /dev/null
@@ -1,539 +0,0 @@
-/* Module designed to test the Redis modules subsystem.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2016, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-#include <string.h>
-
-/* --------------------------------- Helpers -------------------------------- */
-
-/* Return true if the reply and the C null term string matches. */
-int TestMatchReply(RedisModuleCallReply *reply, char *str) {
-    RedisModuleString *mystr;
-    mystr = RedisModule_CreateStringFromCallReply(reply);
-    if (!mystr) return 0;
-    const char *ptr = RedisModule_StringPtrLen(mystr,NULL);
-    return strcmp(ptr,str) == 0;
-}
-
-/* ------------------------------- Test units ------------------------------- */
-
-/* TEST.CALL -- Test Call() API. */
-int TestCall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_AutoMemory(ctx);
-    RedisModuleCallReply *reply;
-
-    RedisModule_Call(ctx,"DEL","c","mylist");
-    RedisModuleString *mystr = RedisModule_CreateString(ctx,"foo",3);
-    RedisModule_Call(ctx,"RPUSH","csl","mylist",mystr,(long long)1234);
-    reply = RedisModule_Call(ctx,"LRANGE","ccc","mylist","0","-1");
-    long long items = RedisModule_CallReplyLength(reply);
-    if (items != 2) goto fail;
-
-    RedisModuleCallReply *item0, *item1;
-
-    item0 = RedisModule_CallReplyArrayElement(reply,0);
-    item1 = RedisModule_CallReplyArrayElement(reply,1);
-    if (!TestMatchReply(item0,"foo")) goto fail;
-    if (!TestMatchReply(item1,"1234")) goto fail;
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-
-fail:
-    RedisModule_ReplyWithSimpleString(ctx,"ERR");
-    return REDISMODULE_OK;
-}
-
-/* TEST.STRING.APPEND -- Test appending to an existing string object. */
-int TestStringAppend(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleString *s = RedisModule_CreateString(ctx,"foo",3);
-    RedisModule_StringAppendBuffer(ctx,s,"bar",3);
-    RedisModule_ReplyWithString(ctx,s);
-    RedisModule_FreeString(ctx,s);
-    return REDISMODULE_OK;
-}
-
-/* TEST.STRING.APPEND.AM -- Test append with retain when auto memory is on. */
-int TestStringAppendAM(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_AutoMemory(ctx);
-    RedisModuleString *s = RedisModule_CreateString(ctx,"foo",3);
-    RedisModule_RetainString(ctx,s);
-    RedisModule_StringAppendBuffer(ctx,s,"bar",3);
-    RedisModule_ReplyWithString(ctx,s);
-    RedisModule_FreeString(ctx,s);
-    return REDISMODULE_OK;
-}
-
-/* TEST.STRING.PRINTF -- Test string formatting. */
-int TestStringPrintf(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx);
-    if (argc < 3) {
-        return RedisModule_WrongArity(ctx);
-    }
-    RedisModuleString *s = RedisModule_CreateStringPrintf(ctx,
-        "Got %d args. argv[1]: %s, argv[2]: %s",
-        argc,
-        RedisModule_StringPtrLen(argv[1], NULL),
-        RedisModule_StringPtrLen(argv[2], NULL)
-    );
-
-    RedisModule_ReplyWithString(ctx,s);
-
-    return REDISMODULE_OK;
-}
-
-int failTest(RedisModuleCtx *ctx, const char *msg) {
-    RedisModule_ReplyWithError(ctx, msg);
-    return REDISMODULE_ERR;
-}
-
-int TestUnlink(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx);
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleKey *k = RedisModule_OpenKey(ctx, RedisModule_CreateStringPrintf(ctx, "unlinked"), REDISMODULE_WRITE | REDISMODULE_READ);
-    if (!k) return failTest(ctx, "Could not create key");
-
-    if (REDISMODULE_ERR == RedisModule_StringSet(k, RedisModule_CreateStringPrintf(ctx, "Foobar"))) {
-        return failTest(ctx, "Could not set string value");
-    }
-
-    RedisModuleCallReply *rep = RedisModule_Call(ctx, "EXISTS", "c", "unlinked");
-    if (!rep || RedisModule_CallReplyInteger(rep) != 1) {
-        return failTest(ctx, "Key does not exist before unlink");
-    }
-
-    if (REDISMODULE_ERR == RedisModule_UnlinkKey(k)) {
-        return failTest(ctx, "Could not unlink key");
-    }
-
-    rep = RedisModule_Call(ctx, "EXISTS", "c", "unlinked");
-    if (!rep || RedisModule_CallReplyInteger(rep) != 0) {
-        return failTest(ctx, "Could not verify key to be unlinked");
-    }
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* TEST.STRING.TRUNCATE -- Test truncating an existing string object. */
-int TestStringTruncate(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx);
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_Call(ctx, "SET", "cc", "foo", "abcde");
-    RedisModuleKey *k = RedisModule_OpenKey(ctx, RedisModule_CreateStringPrintf(ctx, "foo"), REDISMODULE_READ | REDISMODULE_WRITE);
-    if (!k) return failTest(ctx, "Could not create key");
-
-    size_t len = 0;
-    char* s;
-
-    /* expand from 5 to 8 and check null pad */
-    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 8)) {
-        return failTest(ctx, "Could not truncate string value (8)");
-    }
-    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
-    if (!s) {
-        return failTest(ctx, "Failed to read truncated string (8)");
-    } else if (len != 8) {
-        return failTest(ctx, "Failed to expand string value (8)");
-    } else if (0 != strncmp(s, "abcde\0\0\0", 8)) {
-        return failTest(ctx, "Failed to null pad string value (8)");
-    }
-
-    /* shrink from 8 to 4 */
-    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 4)) {
-        return failTest(ctx, "Could not truncate string value (4)");
-    }
-    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
-    if (!s) {
-        return failTest(ctx, "Failed to read truncated string (4)");
-    } else if (len != 4) {
-        return failTest(ctx, "Failed to shrink string value (4)");
-    } else if (0 != strncmp(s, "abcd", 4)) {
-        return failTest(ctx, "Failed to truncate string value (4)");
-    }
-
-    /* shrink to 0 */
-    if (REDISMODULE_ERR == RedisModule_StringTruncate(k, 0)) {
-        return failTest(ctx, "Could not truncate string value (0)");
-    }
-    s = RedisModule_StringDMA(k, &len, REDISMODULE_READ);
-    if (!s) {
-        return failTest(ctx, "Failed to read truncated string (0)");
-    } else if (len != 0) {
-        return failTest(ctx, "Failed to shrink string value to (0)");
-    }
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-int NotifyCallback(RedisModuleCtx *ctx, int type, const char *event,
-                   RedisModuleString *key) {
-  RedisModule_AutoMemory(ctx);
-  /* Increment a counter on the notifications: for each key notified we
-   * increment a counter */
-  RedisModule_Log(ctx, "notice", "Got event type %d, event %s, key %s", type,
-                  event, RedisModule_StringPtrLen(key, NULL));
-
-  RedisModule_Call(ctx, "HINCRBY", "csc", "notifications", key, "1");
-  return REDISMODULE_OK;
-}
-
-/* TEST.NOTIFICATIONS -- Test Keyspace Notifications. */
-int TestNotifications(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx);
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-#define FAIL(msg, ...)                                                                       \
-    {                                                                                        \
-        RedisModule_Log(ctx, "warning", "Failed NOTIFY Test. Reason: " #msg, ##__VA_ARGS__); \
-        goto err;                                                                            \
-    }
-    RedisModule_Call(ctx, "FLUSHDB", "");
-
-    RedisModule_Call(ctx, "SET", "cc", "foo", "bar");
-    RedisModule_Call(ctx, "SET", "cc", "foo", "baz");
-    RedisModule_Call(ctx, "SADD", "cc", "bar", "x");
-    RedisModule_Call(ctx, "SADD", "cc", "bar", "y");
-
-    RedisModule_Call(ctx, "HSET", "ccc", "baz", "x", "y");
-    /* LPUSH should be ignored and not increment any counters */
-    RedisModule_Call(ctx, "LPUSH", "cc", "l", "y");
-    RedisModule_Call(ctx, "LPUSH", "cc", "l", "y");
-
-    /* Miss some keys intentionally so we will get a "keymiss" notification. */
-    RedisModule_Call(ctx, "GET", "c", "nosuchkey");
-    RedisModule_Call(ctx, "SMEMBERS", "c", "nosuchkey");
-
-    size_t sz;
-    const char *rep;
-    RedisModuleCallReply *r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "foo");
-    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
-        FAIL("Wrong or no reply for foo");
-    } else {
-        rep = RedisModule_CallReplyStringPtr(r, &sz);
-        if (sz != 1 || *rep != '2') {
-            FAIL("Got reply '%s'. expected '2'", RedisModule_CallReplyStringPtr(r, NULL));
-        }
-    }
-
-    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "bar");
-    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
-        FAIL("Wrong or no reply for bar");
-    } else {
-        rep = RedisModule_CallReplyStringPtr(r, &sz);
-        if (sz != 1 || *rep != '2') {
-            FAIL("Got reply '%s'. expected '2'", rep);
-        }
-    }
-
-    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "baz");
-    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
-        FAIL("Wrong or no reply for baz");
-    } else {
-        rep = RedisModule_CallReplyStringPtr(r, &sz);
-        if (sz != 1 || *rep != '1') {
-            FAIL("Got reply '%.*s'. expected '1'", (int)sz, rep);
-        }
-    }
-    /* For l we expect nothing since we didn't subscribe to list events */
-    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "l");
-    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_NULL) {
-        FAIL("Wrong reply for l");
-    }
-
-    r = RedisModule_Call(ctx, "HGET", "cc", "notifications", "nosuchkey");
-    if (r == NULL || RedisModule_CallReplyType(r) != REDISMODULE_REPLY_STRING) {
-        FAIL("Wrong or no reply for nosuchkey");
-    } else {
-        rep = RedisModule_CallReplyStringPtr(r, &sz);
-        if (sz != 1 || *rep != '2') {
-            FAIL("Got reply '%.*s'. expected '2'", (int)sz, rep);
-        }
-    }
-
-    RedisModule_Call(ctx, "FLUSHDB", "");
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-err:
-    RedisModule_Call(ctx, "FLUSHDB", "");
-
-    return RedisModule_ReplyWithSimpleString(ctx, "ERR");
-}
-
-/* TEST.CTXFLAGS -- Test GetContextFlags. */
-int TestCtxFlags(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argc);
-    REDISMODULE_NOT_USED(argv);
-
-    RedisModule_AutoMemory(ctx);
-
-    int ok = 1;
-    const char *errString = NULL;
-#undef FAIL
-#define FAIL(msg)        \
-    {                    \
-        ok = 0;          \
-        errString = msg; \
-        goto end;        \
-    }
-
-    int flags = RedisModule_GetContextFlags(ctx);
-    if (flags == 0) {
-        FAIL("Got no flags");
-    }
-
-    if (flags & REDISMODULE_CTX_FLAGS_LUA) FAIL("Lua flag was set");
-    if (flags & REDISMODULE_CTX_FLAGS_MULTI) FAIL("Multi flag was set");
-
-    if (flags & REDISMODULE_CTX_FLAGS_AOF) FAIL("AOF Flag was set")
-    /* Enable AOF to test AOF flags */
-    RedisModule_Call(ctx, "config", "ccc", "set", "appendonly", "yes");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (!(flags & REDISMODULE_CTX_FLAGS_AOF)) FAIL("AOF Flag not set after config set");
-
-    /* Disable RDB saving and test the flag. */
-    RedisModule_Call(ctx, "config", "ccc", "set", "save", "");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (flags & REDISMODULE_CTX_FLAGS_RDB) FAIL("RDB Flag was set");
-    /* Enable RDB to test RDB flags */
-    RedisModule_Call(ctx, "config", "ccc", "set", "save", "900 1");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (!(flags & REDISMODULE_CTX_FLAGS_RDB)) FAIL("RDB Flag was not set after config set");
-
-    if (!(flags & REDISMODULE_CTX_FLAGS_MASTER)) FAIL("Master flag was not set");
-    if (flags & REDISMODULE_CTX_FLAGS_SLAVE) FAIL("Slave flag was set");
-    if (flags & REDISMODULE_CTX_FLAGS_READONLY) FAIL("Read-only flag was set");
-    if (flags & REDISMODULE_CTX_FLAGS_CLUSTER) FAIL("Cluster flag was set");
-
-    /* Disable maxmemory and test the flag. (it is implicitly set in 32bit builds. */
-    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "0");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (flags & REDISMODULE_CTX_FLAGS_MAXMEMORY) FAIL("Maxmemory flag was set");
-
-    /* Enable maxmemory and test the flag. */
-    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "100000000");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (!(flags & REDISMODULE_CTX_FLAGS_MAXMEMORY))
-        FAIL("Maxmemory flag was not set after config set");
-
-    if (flags & REDISMODULE_CTX_FLAGS_EVICT) FAIL("Eviction flag was set");
-    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory-policy", "allkeys-lru");
-    flags = RedisModule_GetContextFlags(ctx);
-    if (!(flags & REDISMODULE_CTX_FLAGS_EVICT)) FAIL("Eviction flag was not set after config set");
-
-end:
-    /* Revert config changes */
-    RedisModule_Call(ctx, "config", "ccc", "set", "appendonly", "no");
-    RedisModule_Call(ctx, "config", "ccc", "set", "save", "");
-    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory", "0");
-    RedisModule_Call(ctx, "config", "ccc", "set", "maxmemory-policy", "noeviction");
-
-    if (!ok) {
-        RedisModule_Log(ctx, "warning", "Failed CTXFLAGS Test. Reason: %s", errString);
-        return RedisModule_ReplyWithSimpleString(ctx, "ERR");
-    }
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* ----------------------------- Test framework ----------------------------- */
-
-/* Return 1 if the reply matches the specified string, otherwise log errors
- * in the server log and return 0. */
-int TestAssertStringReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply, char *str, size_t len) {
-    RedisModuleString *mystr, *expected;
-
-    if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_ERROR) {
-        RedisModule_Log(ctx,"warning","Test error reply: %s",
-            RedisModule_CallReplyStringPtr(reply, NULL));
-        return 0;
-    } else if (RedisModule_CallReplyType(reply) != REDISMODULE_REPLY_STRING) {
-        RedisModule_Log(ctx,"warning","Unexpected reply type %d",
-            RedisModule_CallReplyType(reply));
-        return 0;
-    }
-    mystr = RedisModule_CreateStringFromCallReply(reply);
-    expected = RedisModule_CreateString(ctx,str,len);
-    if (RedisModule_StringCompare(mystr,expected) != 0) {
-        const char *mystr_ptr = RedisModule_StringPtrLen(mystr,NULL);
-        const char *expected_ptr = RedisModule_StringPtrLen(expected,NULL);
-        RedisModule_Log(ctx,"warning",
-            "Unexpected string reply '%s' (instead of '%s')",
-            mystr_ptr, expected_ptr);
-        return 0;
-    }
-    return 1;
-}
-
-/* Return 1 if the reply matches the specified integer, otherwise log errors
- * in the server log and return 0. */
-int TestAssertIntegerReply(RedisModuleCtx *ctx, RedisModuleCallReply *reply, long long expected) {
-    if (RedisModule_CallReplyType(reply) == REDISMODULE_REPLY_ERROR) {
-        RedisModule_Log(ctx,"warning","Test error reply: %s",
-            RedisModule_CallReplyStringPtr(reply, NULL));
-        return 0;
-    } else if (RedisModule_CallReplyType(reply) != REDISMODULE_REPLY_INTEGER) {
-        RedisModule_Log(ctx,"warning","Unexpected reply type %d",
-            RedisModule_CallReplyType(reply));
-        return 0;
-    }
-    long long val = RedisModule_CallReplyInteger(reply);
-    if (val != expected) {
-        RedisModule_Log(ctx,"warning",
-            "Unexpected integer reply '%lld' (instead of '%lld')",
-            val, expected);
-        return 0;
-    }
-    return 1;
-}
-
-#define T(name,...) \
-    do { \
-        RedisModule_Log(ctx,"warning","Testing %s", name); \
-        reply = RedisModule_Call(ctx,name,__VA_ARGS__); \
-    } while (0)
-
-/* TEST.BASICS -- Run all the tests.
- * Note: it is useful to run these tests from the module rather than TCL
- * since it's easier to check the reply types like that (make a distinction
- * between 0 and "0", etc. */
-int TestBasics(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModule_AutoMemory(ctx);
-    RedisModuleCallReply *reply;
-
-    /* Make sure the DB is empty before to proceed. */
-    T("dbsize","");
-    if (!TestAssertIntegerReply(ctx,reply,0)) goto fail;
-
-    T("ping","");
-    if (!TestAssertStringReply(ctx,reply,"PONG",4)) goto fail;
-
-    T("test.call","");
-    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
-
-    T("test.ctxflags","");
-    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
-
-    T("test.string.append","");
-    if (!TestAssertStringReply(ctx,reply,"foobar",6)) goto fail;
-
-    T("test.string.truncate","");
-    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
-
-    T("test.unlink","");
-    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
-
-    T("test.string.append.am","");
-    if (!TestAssertStringReply(ctx,reply,"foobar",6)) goto fail;
-
-    T("test.string.printf", "cc", "foo", "bar");
-    if (!TestAssertStringReply(ctx,reply,"Got 3 args. argv[1]: foo, argv[2]: bar",38)) goto fail;
-
-    T("test.notify", "");
-    if (!TestAssertStringReply(ctx,reply,"OK",2)) goto fail;
-
-    RedisModule_ReplyWithSimpleString(ctx,"ALL TESTS PASSED");
-    return REDISMODULE_OK;
-
-fail:
-    RedisModule_ReplyWithSimpleString(ctx,
-        "SOME TEST DID NOT PASS! Check server logs");
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"test",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.call",
-        TestCall,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.string.append",
-        TestStringAppend,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.string.append.am",
-        TestStringAppendAM,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.string.truncate",
-        TestStringTruncate,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.string.printf",
-        TestStringPrintf,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.ctxflags",
-        TestCtxFlags,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.unlink",
-        TestUnlink,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.basics",
-        TestBasics,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModule_SubscribeToKeyspaceEvents(ctx,
-                                            REDISMODULE_NOTIFY_HASH |
-                                            REDISMODULE_NOTIFY_SET |
-                                            REDISMODULE_NOTIFY_STRING |
-                                            REDISMODULE_NOTIFY_KEY_MISS,
-                                        NotifyCallback);
-    if (RedisModule_CreateCommand(ctx,"test.notify",
-        TestNotifications,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/blockedclient.c b/redis-stable/tests/modules/blockedclient.c
deleted file mode 100644
index c3b0d5eb..00000000
--- a/redis-stable/tests/modules/blockedclient.c
+++ /dev/null
@@ -1,209 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-#include <assert.h>
-#include <stdio.h>
-#include <pthread.h>
-
-#define UNUSED(V) ((void) V)
-
-void *sub_worker(void *arg) {
-    // Get Redis module context
-    RedisModuleCtx *ctx = (RedisModuleCtx *)arg;
-
-    // Try acquiring GIL
-    int res = RedisModule_ThreadSafeContextTryLock(ctx);
-
-    // GIL is already taken by the calling thread expecting to fail.
-    assert(res != REDISMODULE_OK);
-
-    return NULL;
-}
-
-void *worker(void *arg) {
-    // Retrieve blocked client
-    RedisModuleBlockedClient *bc = (RedisModuleBlockedClient *)arg;
-
-    // Get Redis module context
-    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bc);
-
-    // Acquire GIL
-    RedisModule_ThreadSafeContextLock(ctx);
-
-    // Create another thread which will try to acquire the GIL
-    pthread_t tid;
-    int res = pthread_create(&tid, NULL, sub_worker, ctx);
-    assert(res == 0);
-
-    // Wait for thread
-    pthread_join(tid, NULL);
-
-    // Release GIL
-    RedisModule_ThreadSafeContextUnlock(ctx);
-
-    // Reply to client
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-
-    // Unblock client
-    RedisModule_UnblockClient(bc, NULL);
-
-    // Free the Redis module context
-    RedisModule_FreeThreadSafeContext(ctx);
-
-    return NULL;
-}
-
-int acquire_gil(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    UNUSED(argv);
-    UNUSED(argc);
-
-    int flags = RedisModule_GetContextFlags(ctx);
-    int allFlags = RedisModule_GetContextFlagsAll();
-    if ((allFlags & REDISMODULE_CTX_FLAGS_MULTI) &&
-        (flags & REDISMODULE_CTX_FLAGS_MULTI)) {
-        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not supported inside multi");
-        return REDISMODULE_OK;
-    }
-
-    if ((allFlags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING) &&
-        (flags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING)) {
-        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not allowed");
-        return REDISMODULE_OK;
-    }
-
-    /* This command handler tries to acquire the GIL twice
-     * once in the worker thread using "RedisModule_ThreadSafeContextLock"
-     * second in the sub-worker thread
-     * using "RedisModule_ThreadSafeContextTryLock"
-     * as the GIL is already locked. */
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx, NULL, NULL, NULL, 0);
-
-    pthread_t tid;
-    int res = pthread_create(&tid, NULL, worker, bc);
-    assert(res == 0);
-
-    return REDISMODULE_OK;
-}
-
-typedef struct {
-    RedisModuleString **argv;
-    int argc;
-    RedisModuleBlockedClient *bc;
-} bg_call_data;
-
-void *bg_call_worker(void *arg) {
-    bg_call_data *bg = arg;
-
-    // Get Redis module context
-    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(bg->bc);
-
-    // Acquire GIL
-    RedisModule_ThreadSafeContextLock(ctx);
-
-    // Call the command
-    const char* cmd = RedisModule_StringPtrLen(bg->argv[1], NULL);
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, cmd, "v", bg->argv + 2, bg->argc - 2);
-
-    // Release GIL
-    RedisModule_ThreadSafeContextUnlock(ctx);
-
-    // Reply to client
-    if (!rep) {
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    } else {
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-
-    // Unblock client
-    RedisModule_UnblockClient(bg->bc, NULL);
-
-    /* Free the arguments */
-    for (int i=0; i<bg->argc; i++)
-        RedisModule_FreeString(ctx, bg->argv[i]);
-    RedisModule_Free(bg->argv);
-    RedisModule_Free(bg);
-
-    // Free the Redis module context
-    RedisModule_FreeThreadSafeContext(ctx);
-
-    return NULL;
-}
-
-int do_bg_rm_call(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    UNUSED(argv);
-    UNUSED(argc);
-
-    /* Make sure we're not trying to block a client when we shouldn't */
-    int flags = RedisModule_GetContextFlags(ctx);
-    int allFlags = RedisModule_GetContextFlagsAll();
-    if ((allFlags & REDISMODULE_CTX_FLAGS_MULTI) &&
-        (flags & REDISMODULE_CTX_FLAGS_MULTI)) {
-        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not supported inside multi");
-        return REDISMODULE_OK;
-    }
-    if ((allFlags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING) &&
-        (flags & REDISMODULE_CTX_FLAGS_DENY_BLOCKING)) {
-        RedisModule_ReplyWithSimpleString(ctx, "Blocked client is not allowed");
-        return REDISMODULE_OK;
-    }
-
-    /* Make a copy of the arguments and pass them to the thread. */
-    bg_call_data *bg = RedisModule_Alloc(sizeof(bg_call_data));
-    bg->argv = RedisModule_Alloc(sizeof(RedisModuleString*)*argc);
-    bg->argc = argc;
-    for (int i=0; i<argc; i++)
-        bg->argv[i] = RedisModule_HoldString(ctx, argv[i]);
-
-    /* Block the client */
-    bg->bc = RedisModule_BlockClient(ctx, NULL, NULL, NULL, 0);
-
-    /* Start a thread to handle the request */
-    pthread_t tid;
-    int res = pthread_create(&tid, NULL, bg_call_worker, bg);
-    assert(res == 0);
-
-    return REDISMODULE_OK;
-}
-
-int do_rm_call(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
-    UNUSED(argv);
-    UNUSED(argc);
-
-    if(argc < 2){
-        return RedisModule_WrongArity(ctx);
-    }
-
-    const char* cmd = RedisModule_StringPtrLen(argv[1], NULL);
-
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, cmd, "v", argv + 2, argc - 2);
-    if(!rep){
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    }else{
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-
-    return REDISMODULE_OK;
-}
-
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx, "blockedclient", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "acquire_gil", acquire_gil, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "do_rm_call", do_rm_call, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "do_bg_rm_call", do_bg_rm_call, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/blockonbackground.c b/redis-stable/tests/modules/blockonbackground.c
deleted file mode 100644
index 68875630..00000000
--- a/redis-stable/tests/modules/blockonbackground.c
+++ /dev/null
@@ -1,291 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#define _XOPEN_SOURCE 700
-#include "redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <pthread.h>
-#include <time.h>
-
-#define UNUSED(x) (void)(x)
-
-/* Reply callback for blocking command BLOCK.DEBUG */
-int HelloBlock_Reply(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    int *myint = RedisModule_GetBlockedClientPrivateData(ctx);
-    return RedisModule_ReplyWithLongLong(ctx,*myint);
-}
-
-/* Timeout callback for blocking command BLOCK.DEBUG */
-int HelloBlock_Timeout(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    RedisModuleBlockedClient *bc = RedisModule_GetBlockedClientHandle(ctx);
-    RedisModule_BlockedClientMeasureTimeEnd(bc);
-    return RedisModule_ReplyWithSimpleString(ctx,"Request timedout");
-}
-
-/* Private data freeing callback for BLOCK.DEBUG command. */
-void HelloBlock_FreeData(RedisModuleCtx *ctx, void *privdata) {
-    UNUSED(ctx);
-    RedisModule_Free(privdata);
-}
-
-/* The thread entry point that actually executes the blocking part
- * of the command BLOCK.DEBUG. */
-void *BlockDebug_ThreadMain(void *arg) {
-    void **targ = arg;
-    RedisModuleBlockedClient *bc = targ[0];
-    long long delay = (unsigned long)targ[1];
-    long long enable_time_track = (unsigned long)targ[2];
-    if (enable_time_track)
-        RedisModule_BlockedClientMeasureTimeStart(bc);
-    RedisModule_Free(targ);
-
-    struct timespec ts;
-    ts.tv_sec = delay / 1000;
-    ts.tv_nsec = (delay % 1000) * 1000000;
-    nanosleep(&ts, NULL);
-    int *r = RedisModule_Alloc(sizeof(int));
-    *r = rand();
-    if (enable_time_track)
-        RedisModule_BlockedClientMeasureTimeEnd(bc);
-    RedisModule_UnblockClient(bc,r);
-    return NULL;
-}
-
-/* The thread entry point that actually executes the blocking part
- * of the command BLOCK.DOUBLE_DEBUG. */
-void *DoubleBlock_ThreadMain(void *arg) {
-    void **targ = arg;
-    RedisModuleBlockedClient *bc = targ[0];
-    long long delay = (unsigned long)targ[1];
-    RedisModule_BlockedClientMeasureTimeStart(bc);
-    RedisModule_Free(targ);
-    struct timespec ts;
-    ts.tv_sec = delay / 1000;
-    ts.tv_nsec = (delay % 1000) * 1000000;
-    nanosleep(&ts, NULL);
-    int *r = RedisModule_Alloc(sizeof(int));
-    *r = rand();
-    RedisModule_BlockedClientMeasureTimeEnd(bc);
-    /* call again RedisModule_BlockedClientMeasureTimeStart() and
-     * RedisModule_BlockedClientMeasureTimeEnd and ensure that the
-     * total execution time is 2x the delay. */
-    RedisModule_BlockedClientMeasureTimeStart(bc);
-    nanosleep(&ts, NULL);
-    RedisModule_BlockedClientMeasureTimeEnd(bc);
-
-    RedisModule_UnblockClient(bc,r);
-    return NULL;
-}
-
-void HelloBlock_Disconnected(RedisModuleCtx *ctx, RedisModuleBlockedClient *bc) {
-    RedisModule_Log(ctx,"warning","Blocked client %p disconnected!",
-        (void*)bc);
-}
-
-/* BLOCK.DEBUG <delay_ms> <timeout_ms> -- Block for <count> milliseconds, then reply with
- * a random number. Timeout is the command timeout, so that you can test
- * what happens when the delay is greater than the timeout. */
-int HelloBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    long long delay;
-    long long timeout;
-
-    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    pthread_t tid;
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
-
-    /* Here we set a disconnection handler, however since this module will
-     * block in sleep() in a thread, there is not much we can do in the
-     * callback, so this is just to show you the API. */
-    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
-
-    /* Now that we setup a blocking client, we need to pass the control
-     * to the thread. However we need to pass arguments to the thread:
-     * the delay and a reference to the blocked client handle. */
-    void **targ = RedisModule_Alloc(sizeof(void*)*3);
-    targ[0] = bc;
-    targ[1] = (void*)(unsigned long) delay;
-    // pass 1 as flag to enable time tracking
-    targ[2] = (void*)(unsigned long) 1;
-
-    if (pthread_create(&tid,NULL,BlockDebug_ThreadMain,targ) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    }
-    return REDISMODULE_OK;
-}
-
-/* BLOCK.DEBUG_NOTRACKING <delay_ms> <timeout_ms> -- Block for <count> milliseconds, then reply with
- * a random number. Timeout is the command timeout, so that you can test
- * what happens when the delay is greater than the timeout.
- * this command does not track background time so the background time should no appear in stats*/
-int HelloBlockNoTracking_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    long long delay;
-    long long timeout;
-
-    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    pthread_t tid;
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,timeout);
-
-    /* Here we set a disconnection handler, however since this module will
-     * block in sleep() in a thread, there is not much we can do in the
-     * callback, so this is just to show you the API. */
-    RedisModule_SetDisconnectCallback(bc,HelloBlock_Disconnected);
-
-    /* Now that we setup a blocking client, we need to pass the control
-     * to the thread. However we need to pass arguments to the thread:
-     * the delay and a reference to the blocked client handle. */
-    void **targ = RedisModule_Alloc(sizeof(void*)*3);
-    targ[0] = bc;
-    targ[1] = (void*)(unsigned long) delay;
-    // pass 0 as flag to enable time tracking
-    targ[2] = (void*)(unsigned long) 0;
-
-    if (pthread_create(&tid,NULL,BlockDebug_ThreadMain,targ) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    }
-    return REDISMODULE_OK;
-}
-
-/* BLOCK.DOUBLE_DEBUG <delay_ms> -- Block for 2 x <count> milliseconds,
- * then reply with a random number.
- * This command is used to test multiple calls to RedisModule_BlockedClientMeasureTimeStart()
- * and RedisModule_BlockedClientMeasureTimeEnd() within the same execution. */
-int HelloDoubleBlock_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    long long delay;
-
-    if (RedisModule_StringToLongLong(argv[1],&delay) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid count");
-    }
-
-    pthread_t tid;
-    RedisModuleBlockedClient *bc = RedisModule_BlockClient(ctx,HelloBlock_Reply,HelloBlock_Timeout,HelloBlock_FreeData,0);
-
-    /* Now that we setup a blocking client, we need to pass the control
-     * to the thread. However we need to pass arguments to the thread:
-     * the delay and a reference to the blocked client handle. */
-    void **targ = RedisModule_Alloc(sizeof(void*)*2);
-    targ[0] = bc;
-    targ[1] = (void*)(unsigned long) delay;
-
-    if (pthread_create(&tid,NULL,DoubleBlock_ThreadMain,targ) != 0) {
-        RedisModule_AbortBlock(bc);
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    }
-    return REDISMODULE_OK;
-}
-
-RedisModuleBlockedClient *blocked_client = NULL;
-
-/* BLOCK.BLOCK [TIMEOUT] -- Blocks the current client until released
- * or TIMEOUT seconds. If TIMEOUT is zero, no timeout function is
- * registered.
- */
-int Block_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (RedisModule_IsBlockedReplyRequest(ctx)) {
-        RedisModuleString *r = RedisModule_GetBlockedClientPrivateData(ctx);
-        return RedisModule_ReplyWithString(ctx, r);
-    } else if (RedisModule_IsBlockedTimeoutRequest(ctx)) {
-        RedisModule_UnblockClient(blocked_client, NULL); /* Must be called to avoid leaks. */
-        blocked_client = NULL;
-        return RedisModule_ReplyWithSimpleString(ctx, "Timed out");
-    }
-
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    long long timeout;
-
-    if (RedisModule_StringToLongLong(argv[1], &timeout) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx, "ERR invalid timeout");
-    }
-    if (blocked_client) {
-        return RedisModule_ReplyWithError(ctx, "ERR another client already blocked");
-    }
-
-    /* Block client. We use this function as both a reply and optional timeout
-     * callback and differentiate the different code flows above.
-     */
-    blocked_client = RedisModule_BlockClient(ctx, Block_RedisCommand,
-            timeout > 0 ? Block_RedisCommand : NULL, NULL, timeout);
-    return REDISMODULE_OK;
-}
-
-/* BLOCK.IS_BLOCKED -- Returns 1 if we have a blocked client, or 0 otherwise.
- */
-int IsBlocked_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    RedisModule_ReplyWithLongLong(ctx, blocked_client ? 1 : 0);
-    return REDISMODULE_OK;
-}
-
-/* BLOCK.RELEASE [reply] -- Releases the blocked client and produce the specified reply.
- */
-int Release_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    if (!blocked_client) {
-        return RedisModule_ReplyWithError(ctx, "ERR No blocked client");
-    }
-
-    RedisModuleString *replystr = argv[1];
-    RedisModule_RetainString(ctx, replystr);
-    int err = RedisModule_UnblockClient(blocked_client, replystr);
-    blocked_client = NULL;
-
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-
-    if (RedisModule_Init(ctx,"block",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"block.debug",
-        HelloBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"block.double_debug",
-        HelloDoubleBlock_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"block.debug_no_track",
-        HelloBlockNoTracking_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "block.block",
-        Block_RedisCommand, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"block.is_blocked",
-        IsBlocked_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"block.release",
-        Release_RedisCommand,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/blockonkeys.c b/redis-stable/tests/modules/blockonkeys.c
deleted file mode 100644
index b7ab977e..00000000
--- a/redis-stable/tests/modules/blockonkeys.c
+++ /dev/null
@@ -1,505 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-#include <string.h>
-#include <strings.h>
-#include <assert.h>
-#include <unistd.h>
-
-#define LIST_SIZE 1024
-
-typedef struct {
-    long long list[LIST_SIZE];
-    long long length;
-} fsl_t; /* Fixed-size list */
-
-static RedisModuleType *fsltype = NULL;
-
-fsl_t *fsl_type_create() {
-    fsl_t *o;
-    o = RedisModule_Alloc(sizeof(*o));
-    o->length = 0;
-    return o;
-}
-
-void fsl_type_free(fsl_t *o) {
-    RedisModule_Free(o);
-}
-
-/* ========================== "fsltype" type methods ======================= */
-
-void *fsl_rdb_load(RedisModuleIO *rdb, int encver) {
-    if (encver != 0) {
-        return NULL;
-    }
-    fsl_t *fsl = fsl_type_create();
-    fsl->length = RedisModule_LoadUnsigned(rdb);
-    for (long long i = 0; i < fsl->length; i++)
-        fsl->list[i] = RedisModule_LoadSigned(rdb);
-    return fsl;
-}
-
-void fsl_rdb_save(RedisModuleIO *rdb, void *value) {
-    fsl_t *fsl = value;
-    RedisModule_SaveUnsigned(rdb,fsl->length);
-    for (long long i = 0; i < fsl->length; i++)
-        RedisModule_SaveSigned(rdb, fsl->list[i]);
-}
-
-void fsl_aofrw(RedisModuleIO *aof, RedisModuleString *key, void *value) {
-    fsl_t *fsl = value;
-    for (long long i = 0; i < fsl->length; i++)
-        RedisModule_EmitAOF(aof, "FSL.PUSH","sl", key, fsl->list[i]);
-}
-
-void fsl_free(void *value) {
-    fsl_type_free(value);
-}
-
-/* ========================== helper methods ======================= */
-
-int get_fsl(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode, int create, fsl_t **fsl, int reply_on_failure) {
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, keyname, mode);
-
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY && RedisModule_ModuleTypeGetType(key) != fsltype) {
-        RedisModule_CloseKey(key);
-        if (reply_on_failure)
-            RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
-        RedisModuleCallReply *reply = RedisModule_Call(ctx, "INCR", "c", "fsl_wrong_type");
-        RedisModule_FreeCallReply(reply);
-        return 0;
-    }
-
-    /* Create an empty value object if the key is currently empty. */
-    if (type == REDISMODULE_KEYTYPE_EMPTY) {
-        if (!create) {
-            /* Key is empty but we cannot create */
-            RedisModule_CloseKey(key);
-            *fsl = NULL;
-            return 1;
-        }
-        *fsl = fsl_type_create();
-        RedisModule_ModuleTypeSetValue(key, fsltype, *fsl);
-    } else {
-        *fsl = RedisModule_ModuleTypeGetValue(key);
-    }
-
-    RedisModule_CloseKey(key);
-    return 1;
-}
-
-/* ========================== commands ======================= */
-
-/* FSL.PUSH <key> <int> - Push an integer to the fixed-size list (to the right).
- * It must be greater than the element in the head of the list. */
-int fsl_push(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3)
-        return RedisModule_WrongArity(ctx);
-
-    long long ele;
-    if (RedisModule_StringToLongLong(argv[2],&ele) != REDISMODULE_OK)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid integer");
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, argv[1], REDISMODULE_WRITE, 1, &fsl, 1))
-        return REDISMODULE_OK;
-
-    if (fsl->length == LIST_SIZE)
-        return RedisModule_ReplyWithError(ctx,"ERR list is full");
-
-    if (fsl->length != 0 && fsl->list[fsl->length-1] >= ele)
-        return RedisModule_ReplyWithError(ctx,"ERR new element has to be greater than the head element");
-
-    fsl->list[fsl->length++] = ele;
-    RedisModule_SignalKeyAsReady(ctx, argv[1]);
-
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-int bpop_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, keyname, REDISMODULE_READ, 0, &fsl, 0) || !fsl)
-        return REDISMODULE_ERR;
-
-    RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
-    return REDISMODULE_OK;
-}
-
-int bpop_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
-}
-
-/* FSL.BPOP <key> <timeout> - Block clients until list has two or more elements.
- * When that happens, unblock client and pop the last two elements (from the right). */
-int fsl_bpop(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3)
-        return RedisModule_WrongArity(ctx);
-
-    long long timeout;
-    if (RedisModule_StringToLongLong(argv[2],&timeout) != REDISMODULE_OK || timeout < 0)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
-        return REDISMODULE_OK;
-
-    if (!fsl) {
-        RedisModule_BlockClientOnKeys(ctx, bpop_reply_callback, bpop_timeout_callback,
-                                      NULL, timeout, &argv[1], 1, NULL);
-    } else {
-        RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
-    }
-
-    return REDISMODULE_OK;
-}
-
-int bpopgt_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleString *keyname = RedisModule_GetBlockedClientReadyKey(ctx);
-    long long *pgt = RedisModule_GetBlockedClientPrivateData(ctx);
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, keyname, REDISMODULE_READ, 0, &fsl, 0) || !fsl)
-        return REDISMODULE_ERR;
-
-    if (fsl->list[fsl->length-1] <= *pgt)
-        return REDISMODULE_ERR;
-
-    RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
-    return REDISMODULE_OK;
-}
-
-int bpopgt_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
-}
-
-void bpopgt_free_privdata(RedisModuleCtx *ctx, void *privdata) {
-    REDISMODULE_NOT_USED(ctx);
-    RedisModule_Free(privdata);
-}
-
-/* FSL.BPOPGT <key> <gt> <timeout> - Block clients until list has an element greater than <gt>.
- * When that happens, unblock client and pop the last element (from the right). */
-int fsl_bpopgt(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4)
-        return RedisModule_WrongArity(ctx);
-
-    long long gt;
-    if (RedisModule_StringToLongLong(argv[2],&gt) != REDISMODULE_OK)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid integer");
-
-    long long timeout;
-    if (RedisModule_StringToLongLong(argv[3],&timeout) != REDISMODULE_OK || timeout < 0)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
-        return REDISMODULE_OK;
-
-    if (!fsl || fsl->list[fsl->length-1] <= gt) {
-        /* We use malloc so the tests in blockedonkeys.tcl can check for memory leaks */
-        long long *pgt = RedisModule_Alloc(sizeof(long long));
-        *pgt = gt;
-        RedisModule_BlockClientOnKeys(ctx, bpopgt_reply_callback, bpopgt_timeout_callback,
-                                      bpopgt_free_privdata, timeout, &argv[1], 1, pgt);
-    } else {
-        RedisModule_ReplyWithLongLong(ctx, fsl->list[--fsl->length]);
-    }
-
-    return REDISMODULE_OK;
-}
-
-int bpoppush_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleString *src_keyname = RedisModule_GetBlockedClientReadyKey(ctx);
-    RedisModuleString *dst_keyname = RedisModule_GetBlockedClientPrivateData(ctx);
-
-    fsl_t *src;
-    if (!get_fsl(ctx, src_keyname, REDISMODULE_READ, 0, &src, 0) || !src)
-        return REDISMODULE_ERR;
-
-    fsl_t *dst;
-    if (!get_fsl(ctx, dst_keyname, REDISMODULE_WRITE, 1, &dst, 0) || !dst)
-        return REDISMODULE_ERR;
-
-    long long ele = src->list[--src->length];
-    dst->list[dst->length++] = ele;
-    RedisModule_SignalKeyAsReady(ctx, dst_keyname);
-    return RedisModule_ReplyWithLongLong(ctx, ele);
-}
-
-int bpoppush_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithSimpleString(ctx, "Request timedout");
-}
-
-void bpoppush_free_privdata(RedisModuleCtx *ctx, void *privdata) {
-    RedisModule_FreeString(ctx, privdata);
-}
-
-/* FSL.BPOPPUSH <src> <dst> <timeout> - Block clients until <src> has an element.
- * When that happens, unblock client, pop the last element from <src> and push it to <dst>
- * (from the right). */
-int fsl_bpoppush(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4)
-        return RedisModule_WrongArity(ctx);
-
-    long long timeout;
-    if (RedisModule_StringToLongLong(argv[3],&timeout) != REDISMODULE_OK || timeout < 0)
-        return RedisModule_ReplyWithError(ctx,"ERR invalid timeout");
-
-    fsl_t *src;
-    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &src, 1))
-        return REDISMODULE_OK;
-
-    if (!src) {
-        /* Retain string for reply callback */
-        RedisModule_RetainString(ctx, argv[2]);
-        /* Key is empty, we must block */
-        RedisModule_BlockClientOnKeys(ctx, bpoppush_reply_callback, bpoppush_timeout_callback,
-                                      bpoppush_free_privdata, timeout, &argv[1], 1, argv[2]);
-    } else {
-        fsl_t *dst;
-        if (!get_fsl(ctx, argv[2], REDISMODULE_WRITE, 1, &dst, 1))
-            return REDISMODULE_OK;
-        long long ele = src->list[--src->length];
-        dst->list[dst->length++] = ele;
-        RedisModule_SignalKeyAsReady(ctx, argv[2]);
-        RedisModule_ReplyWithLongLong(ctx, ele);
-    }
-
-    return REDISMODULE_OK;
-}
-
-/* FSL.GETALL <key> - Reply with an array containing all elements. */
-int fsl_getall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    fsl_t *fsl;
-    if (!get_fsl(ctx, argv[1], REDISMODULE_READ, 0, &fsl, 1))
-        return REDISMODULE_OK;
-
-    if (!fsl)
-        return RedisModule_ReplyWithArray(ctx, 0);
-
-    RedisModule_ReplyWithArray(ctx, fsl->length);
-    for (int i = 0; i < fsl->length; i++)
-        RedisModule_ReplyWithLongLong(ctx, fsl->list[i]);
-    return REDISMODULE_OK;
-}
-
-/* Callback for blockonkeys_popall */
-int blockonkeys_popall_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST) {
-        RedisModuleString *elem;
-        long len = 0;
-        RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
-        while ((elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD)) != NULL) {
-            len++;
-            RedisModule_ReplyWithString(ctx, elem);
-            RedisModule_FreeString(ctx, elem);
-        }
-        RedisModule_ReplySetArrayLength(ctx, len);
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR Not a list");
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int blockonkeys_popall_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithError(ctx, "ERR Timeout");
-}
-
-/* BLOCKONKEYS.POPALL key
- *
- * Blocks on an empty key for up to 3 seconds. When unblocked by a list
- * operation like LPUSH, all the elements are popped and returned. Fails with an
- * error on timeout. */
-int blockonkeys_popall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
-    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_EMPTY) {
-        RedisModule_BlockClientOnKeys(ctx, blockonkeys_popall_reply_callback,
-                                      blockonkeys_popall_timeout_callback,
-                                      NULL, 3000, &argv[1], 1, NULL);
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR Key not empty");
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/* BLOCKONKEYS.LPUSH key val [val ..]
- * BLOCKONKEYS.LPUSH_UNBLOCK key val [val ..]
- *
- * A module equivalent of LPUSH. If the name LPUSH_UNBLOCK is used,
- * RM_SignalKeyAsReady() is also called. */
-int blockonkeys_lpush(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc < 3)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_LIST) {
-        RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
-    } else {
-        for (int i = 2; i < argc; i++) {
-            if (RedisModule_ListPush(key, REDISMODULE_LIST_HEAD,
-                                     argv[i]) != REDISMODULE_OK) {
-                RedisModule_CloseKey(key);
-                return RedisModule_ReplyWithError(ctx, "ERR Push failed");
-            }
-        }
-    }
-    RedisModule_CloseKey(key);
-
-    /* signal key as ready if the command is lpush_unblock */
-    size_t len;
-    const char *str = RedisModule_StringPtrLen(argv[0], &len);
-    if (!strncasecmp(str, "blockonkeys.lpush_unblock", len)) {
-        RedisModule_SignalKeyAsReady(ctx, argv[1]);
-    }
-    return RedisModule_ReplyWithSimpleString(ctx, "OK");
-}
-
-/* Callback for the BLOCKONKEYS.BLPOPN command */
-int blockonkeys_blpopn_reply_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argc);
-    long long n;
-    RedisModule_StringToLongLong(argv[2], &n);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    int result;
-    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST &&
-        RedisModule_ValueLength(key) >= (size_t)n) {
-        RedisModule_ReplyWithArray(ctx, n);
-        for (long i = 0; i < n; i++) {
-            RedisModuleString *elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD);
-            RedisModule_ReplyWithString(ctx, elem);
-            RedisModule_FreeString(ctx, elem);
-        }
-        result = REDISMODULE_OK;
-    } else if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_LIST ||
-               RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_EMPTY) {
-        /* continue blocking */
-        result = REDISMODULE_ERR;
-    } else {
-        result = RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-    RedisModule_CloseKey(key);
-    return result;
-}
-
-int blockonkeys_blpopn_timeout_callback(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    return RedisModule_ReplyWithError(ctx, "ERR Timeout");
-}
-
-/* BLOCKONKEYS.BLPOPN key N
- *
- * Blocks until key has N elements and then pops them or fails after 3 seconds.
- */
-int blockonkeys_blpopn(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc < 3) return RedisModule_WrongArity(ctx);
-
-    long long n;
-    if (RedisModule_StringToLongLong(argv[2], &n) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx, "ERR Invalid N");
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    int keytype = RedisModule_KeyType(key);
-    if (keytype != REDISMODULE_KEYTYPE_EMPTY &&
-        keytype != REDISMODULE_KEYTYPE_LIST) {
-        RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
-    } else if (keytype == REDISMODULE_KEYTYPE_LIST &&
-               RedisModule_ValueLength(key) >= (size_t)n) {
-        RedisModule_ReplyWithArray(ctx, n);
-        for (long i = 0; i < n; i++) {
-            RedisModuleString *elem = RedisModule_ListPop(key, REDISMODULE_LIST_HEAD);
-            RedisModule_ReplyWithString(ctx, elem);
-            RedisModule_FreeString(ctx, elem);
-        }
-    } else {
-        RedisModule_BlockClientOnKeys(ctx, blockonkeys_blpopn_reply_callback,
-                                      blockonkeys_blpopn_timeout_callback,
-                                      NULL, 3000, &argv[1], 1, NULL);
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx, "blockonkeys", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModuleTypeMethods tm = {
-        .version = REDISMODULE_TYPE_METHOD_VERSION,
-        .rdb_load = fsl_rdb_load,
-        .rdb_save = fsl_rdb_save,
-        .aof_rewrite = fsl_aofrw,
-        .mem_usage = NULL,
-        .free = fsl_free,
-        .digest = NULL
-    };
-
-    fsltype = RedisModule_CreateDataType(ctx, "fsltype_t", 0, &tm);
-    if (fsltype == NULL)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fsl.push",fsl_push,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fsl.bpop",fsl_bpop,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fsl.bpopgt",fsl_bpopgt,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fsl.bpoppush",fsl_bpoppush,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fsl.getall",fsl_getall,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "blockonkeys.popall", blockonkeys_popall,
-                                  "", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "blockonkeys.lpush", blockonkeys_lpush,
-                                  "", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "blockonkeys.lpush_unblock", blockonkeys_lpush,
-                                  "", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "blockonkeys.blpopn", blockonkeys_blpopn,
-                                  "", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/commandfilter.c b/redis-stable/tests/modules/commandfilter.c
deleted file mode 100644
index 571ed170..00000000
--- a/redis-stable/tests/modules/commandfilter.c
+++ /dev/null
@@ -1,154 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-#include <string.h>
-
-static RedisModuleString *log_key_name;
-
-static const char log_command_name[] = "commandfilter.log";
-static const char ping_command_name[] = "commandfilter.ping";
-static const char unregister_command_name[] = "commandfilter.unregister";
-static int in_log_command = 0;
-
-static RedisModuleCommandFilter *filter = NULL;
-
-int CommandFilter_UnregisterCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    (void) argc;
-    (void) argv;
-
-    RedisModule_ReplyWithLongLong(ctx,
-            RedisModule_UnregisterCommandFilter(ctx, filter));
-
-    return REDISMODULE_OK;
-}
-
-int CommandFilter_PingCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    (void) argc;
-    (void) argv;
-
-    RedisModuleCallReply *reply = RedisModule_Call(ctx, "ping", "c", "@log");
-    if (reply) {
-        RedisModule_ReplyWithCallReply(ctx, reply);
-        RedisModule_FreeCallReply(reply);
-    } else {
-        RedisModule_ReplyWithSimpleString(ctx, "Unknown command or invalid arguments");
-    }
-
-    return REDISMODULE_OK;
-}
-
-int CommandFilter_LogCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    RedisModuleString *s = RedisModule_CreateString(ctx, "", 0);
-
-    int i;
-    for (i = 1; i < argc; i++) {
-        size_t arglen;
-        const char *arg = RedisModule_StringPtrLen(argv[i], &arglen);
-
-        if (i > 1) RedisModule_StringAppendBuffer(ctx, s, " ", 1);
-        RedisModule_StringAppendBuffer(ctx, s, arg, arglen);
-    }
-
-    RedisModuleKey *log = RedisModule_OpenKey(ctx, log_key_name, REDISMODULE_WRITE|REDISMODULE_READ);
-    RedisModule_ListPush(log, REDISMODULE_LIST_HEAD, s);
-    RedisModule_CloseKey(log);
-    RedisModule_FreeString(ctx, s);
-
-    in_log_command = 1;
-
-    size_t cmdlen;
-    const char *cmdname = RedisModule_StringPtrLen(argv[1], &cmdlen);
-    RedisModuleCallReply *reply = RedisModule_Call(ctx, cmdname, "v", &argv[2], argc - 2);
-    if (reply) {
-        RedisModule_ReplyWithCallReply(ctx, reply);
-        RedisModule_FreeCallReply(reply);
-    } else {
-        RedisModule_ReplyWithSimpleString(ctx, "Unknown command or invalid arguments");
-    }
-
-    in_log_command = 0;
-
-    return REDISMODULE_OK;
-}
-
-void CommandFilter_CommandFilter(RedisModuleCommandFilterCtx *filter)
-{
-    if (in_log_command) return;  /* don't process our own RM_Call() from CommandFilter_LogCommand() */
-
-    /* Fun manipulations:
-     * - Remove @delme
-     * - Replace @replaceme
-     * - Append @insertbefore or @insertafter
-     * - Prefix with Log command if @log encounterd
-     */
-    int log = 0;
-    int pos = 0;
-    while (pos < RedisModule_CommandFilterArgsCount(filter)) {
-        const RedisModuleString *arg = RedisModule_CommandFilterArgGet(filter, pos);
-        size_t arg_len;
-        const char *arg_str = RedisModule_StringPtrLen(arg, &arg_len);
-
-        if (arg_len == 6 && !memcmp(arg_str, "@delme", 6)) {
-            RedisModule_CommandFilterArgDelete(filter, pos);
-            continue;
-        } 
-        if (arg_len == 10 && !memcmp(arg_str, "@replaceme", 10)) {
-            RedisModule_CommandFilterArgReplace(filter, pos,
-                    RedisModule_CreateString(NULL, "--replaced--", 12));
-        } else if (arg_len == 13 && !memcmp(arg_str, "@insertbefore", 13)) {
-            RedisModule_CommandFilterArgInsert(filter, pos,
-                    RedisModule_CreateString(NULL, "--inserted-before--", 19));
-            pos++;
-        } else if (arg_len == 12 && !memcmp(arg_str, "@insertafter", 12)) {
-            RedisModule_CommandFilterArgInsert(filter, pos + 1,
-                    RedisModule_CreateString(NULL, "--inserted-after--", 18));
-            pos++;
-        } else if (arg_len == 4 && !memcmp(arg_str, "@log", 4)) {
-            log = 1;
-        }
-        pos++;
-    }
-
-    if (log) RedisModule_CommandFilterArgInsert(filter, 0,
-            RedisModule_CreateString(NULL, log_command_name, sizeof(log_command_name)-1));
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (RedisModule_Init(ctx,"commandfilter",1,REDISMODULE_APIVER_1)
-            == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (argc != 2) {
-        RedisModule_Log(ctx, "warning", "Log key name not specified");
-        return REDISMODULE_ERR;
-    }
-
-    long long noself = 0;
-    log_key_name = RedisModule_CreateStringFromString(ctx, argv[0]);
-    RedisModule_StringToLongLong(argv[1], &noself);
-
-    if (RedisModule_CreateCommand(ctx,log_command_name,
-                CommandFilter_LogCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,ping_command_name,
-                CommandFilter_PingCommand,"deny-oom",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,unregister_command_name,
-                CommandFilter_UnregisterCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if ((filter = RedisModule_RegisterCommandFilter(ctx, CommandFilter_CommandFilter, 
-                    noself ? REDISMODULE_CMDFILTER_NOSELF : 0))
-            == NULL) return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnUnload(RedisModuleCtx *ctx) {
-    RedisModule_FreeString(ctx, log_key_name);
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/datatype.c b/redis-stable/tests/modules/datatype.c
deleted file mode 100644
index 0c6f9555..00000000
--- a/redis-stable/tests/modules/datatype.c
+++ /dev/null
@@ -1,217 +0,0 @@
-/* This module current tests a small subset but should be extended in the future
- * for general ModuleDataType coverage.
- */
-
-#include "redismodule.h"
-
-static RedisModuleType *datatype = NULL;
-
-typedef struct {
-    long long intval;
-    RedisModuleString *strval;
-} DataType;
-
-static void *datatype_load(RedisModuleIO *io, int encver) {
-    (void) encver;
-
-    int intval = RedisModule_LoadSigned(io);
-    if (RedisModule_IsIOError(io)) return NULL;
-
-    RedisModuleString *strval = RedisModule_LoadString(io);
-    if (RedisModule_IsIOError(io)) return NULL;
-
-    DataType *dt = (DataType *) RedisModule_Alloc(sizeof(DataType));
-    dt->intval = intval;
-    dt->strval = strval;
-    return dt;
-}
-
-static void datatype_save(RedisModuleIO *io, void *value) {
-    DataType *dt = (DataType *) value;
-    RedisModule_SaveSigned(io, dt->intval);
-    RedisModule_SaveString(io, dt->strval);
-}
-
-static void datatype_free(void *value) {
-    if (value) {
-        DataType *dt = (DataType *) value;
-
-        if (dt->strval) RedisModule_FreeString(NULL, dt->strval);
-        RedisModule_Free(dt);
-    }
-}
-
-static void *datatype_copy(RedisModuleString *fromkey, RedisModuleString *tokey, const void *value) {
-    const DataType *old = value;
-
-    /* Answers to ultimate questions cannot be copied! */
-    if (old->intval == 42)
-        return NULL;
-
-    DataType *new = (DataType *) RedisModule_Alloc(sizeof(DataType));
-
-    new->intval = old->intval;
-    new->strval = RedisModule_CreateStringFromString(NULL, old->strval);
-
-    /* Breaking the rules here! We return a copy that also includes traces
-     * of fromkey/tokey to confirm we get what we expect.
-     */
-    size_t len;
-    const char *str = RedisModule_StringPtrLen(fromkey, &len);
-    RedisModule_StringAppendBuffer(NULL, new->strval, "/", 1);
-    RedisModule_StringAppendBuffer(NULL, new->strval, str, len);
-    RedisModule_StringAppendBuffer(NULL, new->strval, "/", 1);
-    str = RedisModule_StringPtrLen(tokey, &len);
-    RedisModule_StringAppendBuffer(NULL, new->strval, str, len);
-
-    return new;
-}
-
-static int datatype_set(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    long long intval;
-
-    if (RedisModule_StringToLongLong(argv[2], &intval) != REDISMODULE_OK) {
-        RedisModule_ReplyWithError(ctx, "Invalid integr value");
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    DataType *dt = RedisModule_Calloc(sizeof(DataType), 1);
-    dt->intval = intval;
-    dt->strval = argv[3];
-    RedisModule_RetainString(ctx, dt->strval);
-
-    RedisModule_ModuleTypeSetValue(key, datatype, dt);
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-
-    return REDISMODULE_OK;
-}
-
-static int datatype_restore(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    DataType *dt = RedisModule_LoadDataTypeFromString(argv[2], datatype);
-    if (!dt) {
-        RedisModule_ReplyWithError(ctx, "Invalid data");
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    RedisModule_ModuleTypeSetValue(key, datatype, dt);
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-
-    return REDISMODULE_OK;
-}
-
-static int datatype_get(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
-    DataType *dt = RedisModule_ModuleTypeGetValue(key);
-    RedisModule_CloseKey(key);
-
-    if (!dt) {
-        RedisModule_ReplyWithNullArray(ctx);
-    } else {
-        RedisModule_ReplyWithArray(ctx, 2);
-        RedisModule_ReplyWithLongLong(ctx, dt->intval);
-        RedisModule_ReplyWithString(ctx, dt->strval);
-    }
-    return REDISMODULE_OK;
-}
-
-static int datatype_dump(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
-    DataType *dt = RedisModule_ModuleTypeGetValue(key);
-    RedisModule_CloseKey(key);
-
-    RedisModuleString *reply = RedisModule_SaveDataTypeToString(ctx, dt, datatype);
-    if (!reply) {
-        RedisModule_ReplyWithError(ctx, "Failed to save");
-        return REDISMODULE_OK;
-    }
-
-    RedisModule_ReplyWithString(ctx, reply);
-    RedisModule_FreeString(ctx, reply);
-    return REDISMODULE_OK;
-}
-
-static int datatype_swap(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *a = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    RedisModuleKey *b = RedisModule_OpenKey(ctx, argv[2], REDISMODULE_WRITE);
-    void *val = RedisModule_ModuleTypeGetValue(a);
-
-    int error = (RedisModule_ModuleTypeReplaceValue(b, datatype, val, &val) == REDISMODULE_ERR ||
-                 RedisModule_ModuleTypeReplaceValue(a, datatype, val, NULL) == REDISMODULE_ERR);
-    if (!error)
-        RedisModule_ReplyWithSimpleString(ctx, "OK");
-    else
-        RedisModule_ReplyWithError(ctx, "ERR failed");
-
-    RedisModule_CloseKey(a);
-    RedisModule_CloseKey(b);
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"datatype",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModule_SetModuleOptions(ctx, REDISMODULE_OPTIONS_HANDLE_IO_ERRORS);
-
-    RedisModuleTypeMethods datatype_methods = {
-        .version = REDISMODULE_TYPE_METHOD_VERSION,
-        .rdb_load = datatype_load,
-        .rdb_save = datatype_save,
-        .free = datatype_free,
-        .copy = datatype_copy
-    };
-
-    datatype = RedisModule_CreateDataType(ctx, "test___dt", 1, &datatype_methods);
-    if (datatype == NULL)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"datatype.set", datatype_set,"deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"datatype.get", datatype_get,"",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"datatype.restore", datatype_restore,"deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"datatype.dump", datatype_dump,"",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"datatype.swap", datatype_swap,"",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/defragtest.c b/redis-stable/tests/modules/defragtest.c
deleted file mode 100644
index b63680c6..00000000
--- a/redis-stable/tests/modules/defragtest.c
+++ /dev/null
@@ -1,234 +0,0 @@
-/* A module that implements defrag callback mechanisms.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-static RedisModuleType *FragType;
-
-struct FragObject {
-    unsigned long len;
-    void **values;
-    int maxstep;
-};
-
-/* Make sure we get the expected cursor */
-unsigned long int last_set_cursor = 0;
-
-unsigned long int datatype_attempts = 0;
-unsigned long int datatype_defragged = 0;
-unsigned long int datatype_resumes = 0;
-unsigned long int datatype_wrong_cursor = 0;
-unsigned long int global_attempts = 0;
-unsigned long int global_defragged = 0;
-
-int global_strings_len = 0;
-RedisModuleString **global_strings = NULL;
-
-static void createGlobalStrings(RedisModuleCtx *ctx, int count)
-{
-    global_strings_len = count;
-    global_strings = RedisModule_Alloc(sizeof(RedisModuleString *) * count);
-
-    for (int i = 0; i < count; i++) {
-        global_strings[i] = RedisModule_CreateStringFromLongLong(ctx, i);
-    }
-}
-
-static int defragGlobalStrings(RedisModuleDefragCtx *ctx)
-{
-    for (int i = 0; i < global_strings_len; i++) {
-        RedisModuleString *new = RedisModule_DefragRedisModuleString(ctx, global_strings[i]);
-        global_attempts++;
-        if (new != NULL) {
-            global_strings[i] = new;
-            global_defragged++;
-        }
-    }
-
-    return 0;
-}
-
-static void FragInfo(RedisModuleInfoCtx *ctx, int for_crash_report) {
-    REDISMODULE_NOT_USED(for_crash_report);
-
-    RedisModule_InfoAddSection(ctx, "stats");
-    RedisModule_InfoAddFieldLongLong(ctx, "datatype_attempts", datatype_attempts);
-    RedisModule_InfoAddFieldLongLong(ctx, "datatype_defragged", datatype_defragged);
-    RedisModule_InfoAddFieldLongLong(ctx, "datatype_resumes", datatype_resumes);
-    RedisModule_InfoAddFieldLongLong(ctx, "datatype_wrong_cursor", datatype_wrong_cursor);
-    RedisModule_InfoAddFieldLongLong(ctx, "global_attempts", global_attempts);
-    RedisModule_InfoAddFieldLongLong(ctx, "global_defragged", global_defragged);
-}
-
-struct FragObject *createFragObject(unsigned long len, unsigned long size, int maxstep) {
-    struct FragObject *o = RedisModule_Alloc(sizeof(*o));
-    o->len = len;
-    o->values = RedisModule_Alloc(sizeof(RedisModuleString*) * len);
-    o->maxstep = maxstep;
-
-    for (unsigned long i = 0; i < len; i++) {
-        o->values[i] = RedisModule_Calloc(1, size);
-    }
-
-    return o;
-}
-
-/* FRAG.RESETSTATS */
-static int fragResetStatsCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    datatype_attempts = 0;
-    datatype_defragged = 0;
-    datatype_resumes = 0;
-    datatype_wrong_cursor = 0;
-    global_attempts = 0;
-    global_defragged = 0;
-
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-    return REDISMODULE_OK;
-}
-
-/* FRAG.CREATE key len size maxstep */
-static int fragCreateCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 5)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-                                              REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY)
-    {
-        return RedisModule_ReplyWithError(ctx, "ERR key exists");
-    }
-
-    long long len;
-    if ((RedisModule_StringToLongLong(argv[2], &len) != REDISMODULE_OK)) {
-        return RedisModule_ReplyWithError(ctx, "ERR invalid len");
-    }
-
-    long long size;
-    if ((RedisModule_StringToLongLong(argv[3], &size) != REDISMODULE_OK)) {
-        return RedisModule_ReplyWithError(ctx, "ERR invalid size");
-    }
-
-    long long maxstep;
-    if ((RedisModule_StringToLongLong(argv[4], &maxstep) != REDISMODULE_OK)) {
-        return RedisModule_ReplyWithError(ctx, "ERR invalid maxstep");
-    }
-
-    struct FragObject *o = createFragObject(len, size, maxstep);
-    RedisModule_ModuleTypeSetValue(key, FragType, o);
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-    RedisModule_CloseKey(key);
-
-    return REDISMODULE_OK;
-}
-
-void FragFree(void *value) {
-    struct FragObject *o = value;
-
-    for (unsigned long i = 0; i < o->len; i++)
-        RedisModule_Free(o->values[i]);
-    RedisModule_Free(o->values);
-    RedisModule_Free(o);
-}
-
-size_t FragFreeEffort(RedisModuleString *key, const void *value) {
-    REDISMODULE_NOT_USED(key);
-
-    const struct FragObject *o = value;
-    return o->len;
-}
-
-int FragDefrag(RedisModuleDefragCtx *ctx, RedisModuleString *key, void **value) {
-    REDISMODULE_NOT_USED(key);
-    unsigned long i = 0;
-    int steps = 0;
-
-    /* Attempt to get cursor, validate it's what we're exepcting */
-    if (RedisModule_DefragCursorGet(ctx, &i) == REDISMODULE_OK) {
-        if (i > 0) datatype_resumes++;
-
-        /* Validate we're expecting this cursor */
-        if (i != last_set_cursor) datatype_wrong_cursor++;
-    } else {
-        if (last_set_cursor != 0) datatype_wrong_cursor++;
-    }
-
-    /* Attempt to defrag the object itself */
-    datatype_attempts++;
-    struct FragObject *o = RedisModule_DefragAlloc(ctx, *value);
-    if (o == NULL) {
-        /* Not defragged */
-        o = *value;
-    } else {
-        /* Defragged */
-        *value = o;
-        datatype_defragged++;
-    }
-
-    /* Deep defrag now */
-    for (; i < o->len; i++) {
-        datatype_attempts++;
-        void *new = RedisModule_DefragAlloc(ctx, o->values[i]);
-        if (new) {
-            o->values[i] = new;
-            datatype_defragged++;
-        }
-
-        if ((o->maxstep && ++steps > o->maxstep) ||
-            ((i % 64 == 0) && RedisModule_DefragShouldStop(ctx)))
-        {
-            RedisModule_DefragCursorSet(ctx, i);
-            last_set_cursor = i;
-            return 1;
-        }
-    }
-
-    last_set_cursor = 0;
-    return 0;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx, "defragtest", 1, REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_GetTypeMethodVersion() < REDISMODULE_TYPE_METHOD_VERSION) {
-        return REDISMODULE_ERR;
-    }
-
-    long long glen;
-    if (argc != 1 || RedisModule_StringToLongLong(argv[0], &glen) == REDISMODULE_ERR) {
-        return REDISMODULE_ERR;
-    }
-
-    createGlobalStrings(ctx, glen);
-
-    RedisModuleTypeMethods tm = {
-            .version = REDISMODULE_TYPE_METHOD_VERSION,
-            .free = FragFree,
-            .free_effort = FragFreeEffort,
-            .defrag = FragDefrag
-    };
-
-    FragType = RedisModule_CreateDataType(ctx, "frag_type", 0, &tm);
-    if (FragType == NULL) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "frag.create",
-                                  fragCreateCommand, "write deny-oom", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "frag.resetstats",
-                                  fragResetStatsCommand, "write deny-oom", 1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModule_RegisterInfoFunc(ctx, FragInfo);
-    RedisModule_RegisterDefragFunc(ctx, defragGlobalStrings);
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/fork.c b/redis-stable/tests/modules/fork.c
deleted file mode 100644
index 50889eef..00000000
--- a/redis-stable/tests/modules/fork.c
+++ /dev/null
@@ -1,94 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-
-/* define macros for having usleep */
-#define _BSD_SOURCE
-#define _DEFAULT_SOURCE
-
-#include "redismodule.h"
-#include <string.h>
-#include <assert.h>
-#include <unistd.h>
-
-#define UNUSED(V) ((void) V)
-
-int child_pid = -1;
-int exitted_with_code = -1;
-
-void done_handler(int exitcode, int bysignal, void *user_data) {
-    child_pid = -1;
-    exitted_with_code = exitcode;
-    assert(user_data==(void*)0xdeadbeef);
-    UNUSED(bysignal);
-}
-
-int fork_create(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    long long code_to_exit_with;
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    if(!RMAPI_FUNC_SUPPORTED(RedisModule_Fork)){
-        RedisModule_ReplyWithError(ctx, "Fork api is not supported in the current redis version");
-        return REDISMODULE_OK;
-    }
-
-    RedisModule_StringToLongLong(argv[1], &code_to_exit_with);
-    exitted_with_code = -1;
-    child_pid = RedisModule_Fork(done_handler, (void*)0xdeadbeef);
-    if (child_pid < 0) {
-        RedisModule_ReplyWithError(ctx, "Fork failed");
-        return REDISMODULE_OK;
-    } else if (child_pid > 0) {
-        /* parent */
-        RedisModule_ReplyWithLongLong(ctx, child_pid);
-        return REDISMODULE_OK;
-    }
-
-    /* child */
-    RedisModule_Log(ctx, "notice", "fork child started");
-    usleep(500000);
-    RedisModule_Log(ctx, "notice", "fork child exiting");
-    RedisModule_ExitFromChild(code_to_exit_with);
-    /* unreachable */
-    return 0;
-}
-
-int fork_exitcode(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    UNUSED(argv);
-    UNUSED(argc);
-    RedisModule_ReplyWithLongLong(ctx, exitted_with_code);
-    return REDISMODULE_OK;
-}
-
-int fork_kill(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    UNUSED(argv);
-    UNUSED(argc);
-    if (RedisModule_KillForkChild(child_pid) != REDISMODULE_OK)
-        RedisModule_ReplyWithError(ctx, "KillForkChild failed");
-    else
-        RedisModule_ReplyWithLongLong(ctx, 1);
-    child_pid = -1;
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    if (RedisModule_Init(ctx,"fork",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fork.create", fork_create,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fork.exitcode", fork_exitcode,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"fork.kill", fork_kill,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/getkeys.c b/redis-stable/tests/modules/getkeys.c
deleted file mode 100644
index 70605417..00000000
--- a/redis-stable/tests/modules/getkeys.c
+++ /dev/null
@@ -1,122 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-
-#include "redismodule.h"
-#include <strings.h>
-#include <assert.h>
-#include <unistd.h>
-#include <errno.h>
-
-#define UNUSED(V) ((void) V)
-
-/* A sample movable keys command that returns a list of all
- * arguments that follow a KEY argument, i.e.
- */
-int getkeys_command(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    int i;
-    int count = 0;
-
-    /* Handle getkeys-api introspection */
-    if (RedisModule_IsKeysPositionRequest(ctx)) {
-        for (i = 0; i < argc; i++) {
-            size_t len;
-            const char *str = RedisModule_StringPtrLen(argv[i], &len);
-
-            if (len == 3 && !strncasecmp(str, "key", 3) && i + 1 < argc)
-                RedisModule_KeyAtPos(ctx, i + 1);
-        }
-
-        return REDISMODULE_OK;
-    }
-
-    /* Handle real command invocation */
-    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
-    for (i = 0; i < argc; i++) {
-        size_t len;
-        const char *str = RedisModule_StringPtrLen(argv[i], &len);
-
-        if (len == 3 && !strncasecmp(str, "key", 3) && i + 1 < argc) {
-            RedisModule_ReplyWithString(ctx, argv[i+1]);
-            count++;
-        }
-    }
-    RedisModule_ReplySetArrayLength(ctx, count);
-
-    return REDISMODULE_OK;
-}
-
-int getkeys_fixed(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    int i;
-
-    RedisModule_ReplyWithArray(ctx, argc - 1);
-    for (i = 1; i < argc; i++) {
-        RedisModule_ReplyWithString(ctx, argv[i]);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Introspect a command using RM_GetCommandKeys() and returns the list
- * of keys. Essentially this is COMMAND GETKEYS implemented in a module.
- */
-int getkeys_introspect(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    UNUSED(argv);
-    UNUSED(argc);
-
-    if (argc < 3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    int num_keys;
-    int *keyidx = RedisModule_GetCommandKeys(ctx, &argv[1], argc - 1, &num_keys);
-
-    if (!keyidx) {
-        if (!errno)
-            RedisModule_ReplyWithEmptyArray(ctx);
-        else {
-            char err[100];
-            switch (errno) {
-                case ENOENT:
-                    RedisModule_ReplyWithError(ctx, "ERR ENOENT");
-                    break;
-                case EINVAL:
-                    RedisModule_ReplyWithError(ctx, "ERR EINVAL");
-                    break;
-                default:
-                    snprintf(err, sizeof(err) - 1, "ERR errno=%d", errno);
-                    RedisModule_ReplyWithError(ctx, err);
-                    break;
-            }
-        }
-    } else {
-        int i;
-
-        RedisModule_ReplyWithArray(ctx, num_keys);
-        for (i = 0; i < num_keys; i++)
-            RedisModule_ReplyWithString(ctx, argv[1 + keyidx[i]]);
-
-        RedisModule_Free(keyidx);
-    }
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    if (RedisModule_Init(ctx,"getkeys",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"getkeys.command", getkeys_command,"getkeys-api",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"getkeys.fixed", getkeys_fixed,"",2,4,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"getkeys.introspect", getkeys_introspect,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/hash.c b/redis-stable/tests/modules/hash.c
deleted file mode 100644
index 05ab0380..00000000
--- a/redis-stable/tests/modules/hash.c
+++ /dev/null
@@ -1,90 +0,0 @@
-#include "redismodule.h"
-#include <strings.h>
-#include <errno.h>
-#include <stdlib.h>
-
-/* If a string is ":deleted:", the special value for deleted hash fields is
- * returned; otherwise the input string is returned. */
-static RedisModuleString *value_or_delete(RedisModuleString *s) {
-    if (!strcasecmp(RedisModule_StringPtrLen(s, NULL), ":delete:"))
-        return REDISMODULE_HASH_DELETE;
-    else
-        return s;
-}
-
-/* HASH.SET key flags field1 value1 [field2 value2 ..]
- *
- * Sets 1-4 fields. Returns the same as RedisModule_HashSet().
- * Flags is a string of "nxa" where n = NX, x = XX, a = COUNT_ALL.
- * To delete a field, use the value ":delete:".
- */
-int hash_set(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc < 5 || argc % 2 == 0 || argc > 11)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModule_AutoMemory(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-
-    size_t flags_len;
-    const char *flags_str = RedisModule_StringPtrLen(argv[2], &flags_len);
-    int flags = REDISMODULE_HASH_NONE;
-    for (size_t i = 0; i < flags_len; i++) {
-        switch (flags_str[i]) {
-        case 'n': flags |= REDISMODULE_HASH_NX; break;
-        case 'x': flags |= REDISMODULE_HASH_XX; break;
-        case 'a': flags |= REDISMODULE_HASH_COUNT_ALL; break;
-        }
-    }
-
-    /* Test some varargs. (In real-world, use a loop and set one at a time.) */
-    int result;
-    errno = 0;
-    if (argc == 5) {
-        result = RedisModule_HashSet(key, flags,
-                                     argv[3], value_or_delete(argv[4]),
-                                     NULL);
-    } else if (argc == 7) {
-        result = RedisModule_HashSet(key, flags,
-                                     argv[3], value_or_delete(argv[4]),
-                                     argv[5], value_or_delete(argv[6]),
-                                     NULL);
-    } else if (argc == 9) {
-        result = RedisModule_HashSet(key, flags,
-                                     argv[3], value_or_delete(argv[4]),
-                                     argv[5], value_or_delete(argv[6]),
-                                     argv[7], value_or_delete(argv[8]),
-                                     NULL);
-    } else if (argc == 11) {
-        result = RedisModule_HashSet(key, flags,
-                                     argv[3], value_or_delete(argv[4]),
-                                     argv[5], value_or_delete(argv[6]),
-                                     argv[7], value_or_delete(argv[8]),
-                                     argv[9], value_or_delete(argv[10]),
-                                     NULL);
-    } else {
-        return RedisModule_ReplyWithError(ctx, "ERR too many fields");
-    }
-
-    /* Check errno */
-    if (result == 0) {
-        if (errno == ENOTSUP)
-            return RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE);
-        else
-            RedisModule_Assert(errno == ENOENT);
-    }
-
-    return RedisModule_ReplyWithLongLong(ctx, result);
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx, "hash", 1, REDISMODULE_APIVER_1) ==
-        REDISMODULE_OK &&
-        RedisModule_CreateCommand(ctx, "hash.set", hash_set, "",
-                                  1, 1, 1) == REDISMODULE_OK) {
-        return REDISMODULE_OK;
-    } else {
-        return REDISMODULE_ERR;
-    }
-}
diff --git a/redis-stable/tests/modules/hooks.c b/redis-stable/tests/modules/hooks.c
deleted file mode 100644
index 6fb3d232..00000000
--- a/redis-stable/tests/modules/hooks.c
+++ /dev/null
@@ -1,334 +0,0 @@
-/* This module is used to test the server events hooks API.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "redismodule.h"
-#include <stdio.h>
-#include <string.h>
-
-/* We need to store events to be able to test and see what we got, and we can't
- * store them in the key-space since that would mess up rdb loading (duplicates)
- * and be lost of flushdb. */
-RedisModuleDict *event_log = NULL;
-
-typedef struct EventElement {
-    long count;
-    RedisModuleString *last_val_string;
-    long last_val_int;
-} EventElement;
-
-void LogStringEvent(RedisModuleCtx *ctx, const char* keyname, const char* data) {
-    EventElement *event = RedisModule_DictGetC(event_log, (void*)keyname, strlen(keyname), NULL);
-    if (!event) {
-        event = RedisModule_Alloc(sizeof(EventElement));
-        memset(event, 0, sizeof(EventElement));
-        RedisModule_DictSetC(event_log, (void*)keyname, strlen(keyname), event);
-    }
-    if (event->last_val_string) RedisModule_FreeString(ctx, event->last_val_string);
-    event->last_val_string = RedisModule_CreateString(ctx, data, strlen(data));
-    event->count++;
-}
-
-void LogNumericEvent(RedisModuleCtx *ctx, const char* keyname, long data) {
-    REDISMODULE_NOT_USED(ctx);
-    EventElement *event = RedisModule_DictGetC(event_log, (void*)keyname, strlen(keyname), NULL);
-    if (!event) {
-        event = RedisModule_Alloc(sizeof(EventElement));
-        memset(event, 0, sizeof(EventElement));
-        RedisModule_DictSetC(event_log, (void*)keyname, strlen(keyname), event);
-    }
-    event->last_val_int = data;
-    event->count++;
-}
-
-void FreeEvent(RedisModuleCtx *ctx, EventElement *event) {
-    if (event->last_val_string)
-        RedisModule_FreeString(ctx, event->last_val_string);
-    RedisModule_Free(event);
-}
-
-int cmdEventCount(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    EventElement *event = RedisModule_DictGet(event_log, argv[1], NULL);
-    RedisModule_ReplyWithLongLong(ctx, event? event->count: 0);
-    return REDISMODULE_OK;
-}
-
-int cmdEventLast(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    EventElement *event = RedisModule_DictGet(event_log, argv[1], NULL);
-    if (event && event->last_val_string)
-        RedisModule_ReplyWithString(ctx, event->last_val_string);
-    else if (event)
-        RedisModule_ReplyWithLongLong(ctx, event->last_val_int);
-    else
-        RedisModule_ReplyWithNull(ctx);
-    return REDISMODULE_OK;
-}
-
-void clearEvents(RedisModuleCtx *ctx)
-{
-    RedisModuleString *key;
-    EventElement *event;
-    RedisModuleDictIter *iter = RedisModule_DictIteratorStart(event_log, "^", NULL);
-    while((key = RedisModule_DictNext(ctx, iter, (void**)&event)) != NULL) {
-        event->count = 0;
-        event->last_val_int = 0;
-        if (event->last_val_string) RedisModule_FreeString(ctx, event->last_val_string);
-        event->last_val_string = NULL;
-        RedisModule_DictDel(event_log, key, NULL);
-        RedisModule_Free(event);
-    }
-    RedisModule_DictIteratorStop(iter);
-}
-
-int cmdEventsClear(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argc);
-    REDISMODULE_NOT_USED(argv);
-    clearEvents(ctx);
-    return REDISMODULE_OK;
-}
-
-/* Client state change callback. */
-void clientChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleClientInfo *ci = data;
-    char *keyname = (sub == REDISMODULE_SUBEVENT_CLIENT_CHANGE_CONNECTED) ?
-        "client-connected" : "client-disconnected";
-    LogNumericEvent(ctx, keyname, ci->id);
-}
-
-void flushdbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleFlushInfo *fi = data;
-    char *keyname = (sub == REDISMODULE_SUBEVENT_FLUSHDB_START) ?
-        "flush-start" : "flush-end";
-    LogNumericEvent(ctx, keyname, fi->dbnum);
-}
-
-void roleChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-
-    RedisModuleReplicationInfo *ri = data;
-    char *keyname = (sub == REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER) ?
-        "role-master" : "role-replica";
-    LogStringEvent(ctx, keyname, ri->masterhost);
-}
-
-void replicationChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-
-    char *keyname = (sub == REDISMODULE_SUBEVENT_REPLICA_CHANGE_ONLINE) ?
-        "replica-online" : "replica-offline";
-    LogNumericEvent(ctx, keyname, 0);
-}
-
-void rasterLinkChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-
-    char *keyname = (sub == REDISMODULE_SUBEVENT_MASTER_LINK_UP) ?
-        "masterlink-up" : "masterlink-down";
-    LogNumericEvent(ctx, keyname, 0);
-}
-
-void persistenceCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-
-    char *keyname = NULL;
-    switch (sub) {
-        case REDISMODULE_SUBEVENT_PERSISTENCE_RDB_START: keyname = "persistence-rdb-start"; break;
-        case REDISMODULE_SUBEVENT_PERSISTENCE_AOF_START: keyname = "persistence-aof-start"; break;
-        case REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START: keyname = "persistence-syncrdb-start"; break;
-        case REDISMODULE_SUBEVENT_PERSISTENCE_ENDED: keyname = "persistence-end"; break;
-        case REDISMODULE_SUBEVENT_PERSISTENCE_FAILED: keyname = "persistence-failed"; break;
-    }
-    /* modifying the keyspace from the fork child is not an option, using log instead */
-    RedisModule_Log(ctx, "warning", "module-event-%s", keyname);
-    if (sub == REDISMODULE_SUBEVENT_PERSISTENCE_SYNC_RDB_START)
-        LogNumericEvent(ctx, keyname, 0);
-}
-
-void loadingCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-
-    char *keyname = NULL;
-    switch (sub) {
-        case REDISMODULE_SUBEVENT_LOADING_RDB_START: keyname = "loading-rdb-start"; break;
-        case REDISMODULE_SUBEVENT_LOADING_AOF_START: keyname = "loading-aof-start"; break;
-        case REDISMODULE_SUBEVENT_LOADING_REPL_START: keyname = "loading-repl-start"; break;
-        case REDISMODULE_SUBEVENT_LOADING_ENDED: keyname = "loading-end"; break;
-        case REDISMODULE_SUBEVENT_LOADING_FAILED: keyname = "loading-failed"; break;
-    }
-    LogNumericEvent(ctx, keyname, 0);
-}
-
-void loadingProgressCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleLoadingProgress *ei = data;
-    char *keyname = (sub == REDISMODULE_SUBEVENT_LOADING_PROGRESS_RDB) ?
-        "loading-progress-rdb" : "loading-progress-aof";
-    LogNumericEvent(ctx, keyname, ei->progress);
-}
-
-void shutdownCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-    REDISMODULE_NOT_USED(sub);
-
-    RedisModule_Log(ctx, "warning", "module-event-%s", "shutdown");
-}
-
-void cronLoopCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(sub);
-
-    RedisModuleCronLoop *ei = data;
-    LogNumericEvent(ctx, "cron-loop", ei->hz);
-}
-
-void moduleChangeCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-
-    RedisModuleModuleChange *ei = data;
-    char *keyname = (sub == REDISMODULE_SUBEVENT_MODULE_LOADED) ?
-        "module-loaded" : "module-unloaded";
-    LogStringEvent(ctx, keyname, ei->module_name);
-}
-
-void swapDbCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(sub);
-
-    RedisModuleSwapDbInfo *ei = data;
-    LogNumericEvent(ctx, "swapdb-first", ei->dbnum_first);
-    LogNumericEvent(ctx, "swapdb-second", ei->dbnum_second);
-}
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-#define VerifySubEventSupported(e, s) \
-    if (!RedisModule_IsSubEventSupported(e, s)) { \
-        return REDISMODULE_ERR; \
-    }
-
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"testhook",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    /* Example on how to check if a server sub event is supported */
-    if (!RedisModule_IsSubEventSupported(RedisModuleEvent_ReplicationRoleChanged, REDISMODULE_EVENT_REPLROLECHANGED_NOW_MASTER)) {
-        return REDISMODULE_ERR;
-    }
-
-    /* replication related hooks */
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ReplicationRoleChanged, roleChangeCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ReplicaChange, replicationChangeCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_MasterLinkChange, rasterLinkChangeCallback);
-
-    /* persistence related hooks */
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_Persistence, persistenceCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_Loading, loadingCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_LoadingProgress, loadingProgressCallback);
-
-    /* other hooks */
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ClientChange, clientChangeCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_FlushDB, flushdbCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_Shutdown, shutdownCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_CronLoop, cronLoopCallback);
-
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ModuleChange, moduleChangeCallback);
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_SwapDB, swapDbCallback);
-
-    event_log = RedisModule_CreateDict(ctx);
-
-    if (RedisModule_CreateCommand(ctx,"hooks.event_count", cmdEventCount,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"hooks.event_last", cmdEventLast,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"hooks.clear", cmdEventsClear,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnUnload(RedisModuleCtx *ctx) {
-    clearEvents(ctx);
-    RedisModule_FreeDict(ctx, event_log);
-    event_log = NULL;
-    return REDISMODULE_OK;
-}
-
diff --git a/redis-stable/tests/modules/infotest.c b/redis-stable/tests/modules/infotest.c
deleted file mode 100644
index 87a89dcb..00000000
--- a/redis-stable/tests/modules/infotest.c
+++ /dev/null
@@ -1,119 +0,0 @@
-#include "redismodule.h"
-
-#include <string.h>
-
-void InfoFunc(RedisModuleInfoCtx *ctx, int for_crash_report) {
-    RedisModule_InfoAddSection(ctx, "");
-    RedisModule_InfoAddFieldLongLong(ctx, "global", -2);
-    RedisModule_InfoAddFieldULongLong(ctx, "uglobal", (unsigned long long)-2);
-
-    RedisModule_InfoAddSection(ctx, "Spanish");
-    RedisModule_InfoAddFieldCString(ctx, "uno", "one");
-    RedisModule_InfoAddFieldLongLong(ctx, "dos", 2);
-
-    RedisModule_InfoAddSection(ctx, "Italian");
-    RedisModule_InfoAddFieldLongLong(ctx, "due", 2);
-    RedisModule_InfoAddFieldDouble(ctx, "tre", 3.3);
-
-    RedisModule_InfoAddSection(ctx, "keyspace");
-    RedisModule_InfoBeginDictField(ctx, "db0");
-    RedisModule_InfoAddFieldLongLong(ctx, "keys", 3);
-    RedisModule_InfoAddFieldLongLong(ctx, "expires", 1);
-    RedisModule_InfoEndDictField(ctx);
-
-    RedisModule_InfoAddSection(ctx, "unsafe");
-    RedisModule_InfoBeginDictField(ctx, "unsafe:field");
-    RedisModule_InfoAddFieldLongLong(ctx, "value", 1);
-    RedisModule_InfoEndDictField(ctx);
-
-    if (for_crash_report) {
-        RedisModule_InfoAddSection(ctx, "Klingon");
-        RedisModule_InfoAddFieldCString(ctx, "one", "wa’");
-        RedisModule_InfoAddFieldCString(ctx, "two", "cha’");
-        RedisModule_InfoAddFieldCString(ctx, "three", "wej");
-    }
-
-}
-
-int info_get(RedisModuleCtx *ctx, RedisModuleString **argv, int argc, char field_type)
-{
-    if (argc != 3 && argc != 4) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    int err = REDISMODULE_OK;
-    const char *section, *field;
-    section = RedisModule_StringPtrLen(argv[1], NULL);
-    field = RedisModule_StringPtrLen(argv[2], NULL);
-    RedisModuleServerInfoData *info = RedisModule_GetServerInfo(ctx, section);
-    if (field_type=='i') {
-        long long ll = RedisModule_ServerInfoGetFieldSigned(info, field, &err);
-        if (err==REDISMODULE_OK)
-            RedisModule_ReplyWithLongLong(ctx, ll);
-    } else if (field_type=='u') {
-        unsigned long long ll = (unsigned long long)RedisModule_ServerInfoGetFieldUnsigned(info, field, &err);
-        if (err==REDISMODULE_OK)
-            RedisModule_ReplyWithLongLong(ctx, ll);
-    } else if (field_type=='d') {
-        double d = RedisModule_ServerInfoGetFieldDouble(info, field, &err);
-        if (err==REDISMODULE_OK)
-            RedisModule_ReplyWithDouble(ctx, d);
-    } else if (field_type=='c') {
-        const char *str = RedisModule_ServerInfoGetFieldC(info, field);
-        if (str)
-            RedisModule_ReplyWithCString(ctx, str);
-    } else {
-        RedisModuleString *str = RedisModule_ServerInfoGetField(ctx, info, field);
-        if (str) {
-            RedisModule_ReplyWithString(ctx, str);
-            RedisModule_FreeString(ctx, str);
-        } else
-            err=REDISMODULE_ERR;
-    }
-    if (err!=REDISMODULE_OK)
-        RedisModule_ReplyWithError(ctx, "not found");
-    RedisModule_FreeServerInfo(ctx, info);
-    return REDISMODULE_OK;
-}
-
-int info_gets(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    return info_get(ctx, argv, argc, 's');
-}
-
-int info_getc(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    return info_get(ctx, argv, argc, 'c');
-}
-
-int info_geti(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    return info_get(ctx, argv, argc, 'i');
-}
-
-int info_getu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    return info_get(ctx, argv, argc, 'u');
-}
-
-int info_getd(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    return info_get(ctx, argv, argc, 'd');
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx,"infotest",1,REDISMODULE_APIVER_1)
-            == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_RegisterInfoFunc(ctx, InfoFunc) == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"info.gets", info_gets,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"info.getc", info_getc,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"info.geti", info_geti,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"info.getu", info_getu,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"info.getd", info_getd,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/keyspace_events.c b/redis-stable/tests/modules/keyspace_events.c
deleted file mode 100644
index 9305774c..00000000
--- a/redis-stable/tests/modules/keyspace_events.c
+++ /dev/null
@@ -1,293 +0,0 @@
-/* This module is used to test the server keyspace events API.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2020, Meir Shpilraien <meir at redislabs dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-
-#include "redismodule.h"
-#include <stdio.h>
-#include <string.h>
-
-/** strores all the keys on which we got 'loaded' keyspace notification **/
-RedisModuleDict *loaded_event_log = NULL;
-/** stores all the keys on which we got 'module' keyspace notification **/
-RedisModuleDict *module_event_log = NULL;
-
-static int KeySpace_NotificationLoaded(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key){
-    REDISMODULE_NOT_USED(ctx);
-    REDISMODULE_NOT_USED(type);
-
-    if(strcmp(event, "loaded") == 0){
-        const char* keyName = RedisModule_StringPtrLen(key, NULL);
-        int nokey;
-        RedisModule_DictGetC(loaded_event_log, (void*)keyName, strlen(keyName), &nokey);
-        if(nokey){
-            RedisModule_DictSetC(loaded_event_log, (void*)keyName, strlen(keyName), RedisModule_HoldString(ctx, key));
-        }
-    }
-
-    return REDISMODULE_OK;
-}
-
-static int KeySpace_NotificationGeneric(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
-    REDISMODULE_NOT_USED(type);
-
-    if (strcmp(event, "del") == 0) {
-        RedisModuleString *copykey = RedisModule_CreateStringPrintf(ctx, "%s_copy", RedisModule_StringPtrLen(key, NULL));
-        RedisModuleCallReply* rep = RedisModule_Call(ctx, "DEL", "s!", copykey);
-        RedisModule_FreeString(ctx, copykey);
-        RedisModule_FreeCallReply(rep);
-
-        int ctx_flags = RedisModule_GetContextFlags(ctx);
-        if (ctx_flags & REDISMODULE_CTX_FLAGS_LUA) {
-            RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "c", "lua");
-            RedisModule_FreeCallReply(rep);
-        }
-        if (ctx_flags & REDISMODULE_CTX_FLAGS_MULTI) {
-            RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "c", "multi");
-            RedisModule_FreeCallReply(rep);
-        }
-    }
-
-    return REDISMODULE_OK;
-}
-
-static int KeySpace_NotificationModule(RedisModuleCtx *ctx, int type, const char *event, RedisModuleString *key) {
-    REDISMODULE_NOT_USED(ctx);
-    REDISMODULE_NOT_USED(type);
-    REDISMODULE_NOT_USED(event);
-
-    const char* keyName = RedisModule_StringPtrLen(key, NULL);
-    int nokey;
-    RedisModule_DictGetC(module_event_log, (void*)keyName, strlen(keyName), &nokey);
-    if(nokey){
-        RedisModule_DictSetC(module_event_log, (void*)keyName, strlen(keyName), RedisModule_HoldString(ctx, key));
-    }
-    return REDISMODULE_OK;
-}
-
-static int cmdNotify(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
-    if(argc != 2){
-        return RedisModule_WrongArity(ctx);
-    }
-
-    RedisModule_NotifyKeyspaceEvent(ctx, REDISMODULE_NOTIFY_MODULE, "notify", argv[1]);
-    RedisModule_ReplyWithNull(ctx);
-    return REDISMODULE_OK;
-}
-
-static int cmdIsModuleKeyNotified(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
-    if(argc != 2){
-        return RedisModule_WrongArity(ctx);
-    }
-
-    const char* key  = RedisModule_StringPtrLen(argv[1], NULL);
-
-    int nokey;
-    RedisModuleString* keyStr = RedisModule_DictGetC(module_event_log, (void*)key, strlen(key), &nokey);
-
-    RedisModule_ReplyWithArray(ctx, 2);
-    RedisModule_ReplyWithLongLong(ctx, !nokey);
-    if(nokey){
-        RedisModule_ReplyWithNull(ctx);
-    }else{
-        RedisModule_ReplyWithString(ctx, keyStr);
-    }
-    return REDISMODULE_OK;
-}
-
-static int cmdIsKeyLoaded(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
-    if(argc != 2){
-        return RedisModule_WrongArity(ctx);
-    }
-
-    const char* key  = RedisModule_StringPtrLen(argv[1], NULL);
-
-    int nokey;
-    RedisModuleString* keyStr = RedisModule_DictGetC(loaded_event_log, (void*)key, strlen(key), &nokey);
-
-    RedisModule_ReplyWithArray(ctx, 2);
-    RedisModule_ReplyWithLongLong(ctx, !nokey);
-    if(nokey){
-        RedisModule_ReplyWithNull(ctx);
-    }else{
-        RedisModule_ReplyWithString(ctx, keyStr);
-    }
-    return REDISMODULE_OK;
-}
-
-static int cmdDelKeyCopy(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, "DEL", "s!", argv[1]);
-    if (!rep) {
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    } else {
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Call INCR and propagate using RM_Call with `!`. */
-static int cmdIncrCase1(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s!", argv[1]);
-    if (!rep) {
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    } else {
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-    return REDISMODULE_OK;
-}
-
-/* Call INCR and propagate using RM_Replicate. */
-static int cmdIncrCase2(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s", argv[1]);
-    if (!rep) {
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    } else {
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-    RedisModule_Replicate(ctx, "INCR", "s", argv[1]);
-    return REDISMODULE_OK;
-}
-
-/* Call INCR and propagate using RM_ReplicateVerbatim. */
-static int cmdIncrCase3(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 2)
-        return RedisModule_WrongArity(ctx);
-
-    RedisModuleCallReply* rep = RedisModule_Call(ctx, "INCR", "s", argv[1]);
-    if (!rep) {
-        RedisModule_ReplyWithError(ctx, "NULL reply returned");
-    } else {
-        RedisModule_ReplyWithCallReply(ctx, rep);
-        RedisModule_FreeCallReply(rep);
-    }
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-
-/* This function must be present on each Redis module. It is used in order to
- * register the commands into the Redis server. */
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"testkeyspace",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-
-    loaded_event_log = RedisModule_CreateDict(ctx);
-    module_event_log = RedisModule_CreateDict(ctx);
-
-    int keySpaceAll = RedisModule_GetKeyspaceNotificationFlagsAll();
-
-    if (!(keySpaceAll & REDISMODULE_NOTIFY_LOADED)) {
-        // REDISMODULE_NOTIFY_LOADED event are not supported we can not start
-        return REDISMODULE_ERR;
-    }
-
-    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_LOADED, KeySpace_NotificationLoaded) != REDISMODULE_OK){
-        return REDISMODULE_ERR;
-    }
-
-    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_GENERIC, KeySpace_NotificationGeneric) != REDISMODULE_OK){
-        return REDISMODULE_ERR;
-    }
-
-    if(RedisModule_SubscribeToKeyspaceEvents(ctx, REDISMODULE_NOTIFY_MODULE, KeySpace_NotificationModule) != REDISMODULE_OK){
-        return REDISMODULE_ERR;
-    }
-
-    if (RedisModule_CreateCommand(ctx,"keyspace.notify", cmdNotify,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-
-    if (RedisModule_CreateCommand(ctx,"keyspace.is_module_key_notified", cmdIsModuleKeyNotified,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-
-    if (RedisModule_CreateCommand(ctx,"keyspace.is_key_loaded", cmdIsKeyLoaded,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-
-    if (RedisModule_CreateCommand(ctx,"keyspace.del_key_copy", cmdDelKeyCopy,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-    
-    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case1", cmdIncrCase1,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-    
-    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case2", cmdIncrCase2,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-    
-    if (RedisModule_CreateCommand(ctx,"keyspace.incr_case3", cmdIncrCase3,"",0,0,0) == REDISMODULE_ERR){
-        return REDISMODULE_ERR;
-    }
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnUnload(RedisModuleCtx *ctx) {
-    RedisModuleDictIter *iter = RedisModule_DictIteratorStartC(loaded_event_log, "^", NULL, 0);
-    char* key;
-    size_t keyLen;
-    RedisModuleString* val;
-    while((key = RedisModule_DictNextC(iter, &keyLen, (void**)&val))){
-        RedisModule_FreeString(ctx, val);
-    }
-    RedisModule_FreeDict(ctx, loaded_event_log);
-    RedisModule_DictIteratorStop(iter);
-    loaded_event_log = NULL;
-
-    iter = RedisModule_DictIteratorStartC(module_event_log, "^", NULL, 0);
-    while((key = RedisModule_DictNextC(iter, &keyLen, (void**)&val))){
-        RedisModule_FreeString(ctx, val);
-    }
-    RedisModule_FreeDict(ctx, module_event_log);
-    RedisModule_DictIteratorStop(iter);
-    module_event_log = NULL;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/misc.c b/redis-stable/tests/modules/misc.c
deleted file mode 100644
index 1c7c47a9..00000000
--- a/redis-stable/tests/modules/misc.c
+++ /dev/null
@@ -1,327 +0,0 @@
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-#include <string.h>
-#include <assert.h>
-#include <unistd.h>
-#include <errno.h>
-
-#define UNUSED(x) (void)(x)
-
-int test_call_generic(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc<2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    const char* cmdname = RedisModule_StringPtrLen(argv[1], NULL);
-    RedisModuleCallReply *reply = RedisModule_Call(ctx, cmdname, "v", argv+2, argc-2);
-    if (reply) {
-        RedisModule_ReplyWithCallReply(ctx, reply);
-        RedisModule_FreeCallReply(reply);
-    } else {
-        RedisModule_ReplyWithError(ctx, strerror(errno));
-    }
-    return REDISMODULE_OK;
-}
-
-int test_call_info(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    RedisModuleCallReply *reply;
-    if (argc>1)
-        reply = RedisModule_Call(ctx, "info", "s", argv[1]);
-    else
-        reply = RedisModule_Call(ctx, "info", "");
-    if (reply) {
-        RedisModule_ReplyWithCallReply(ctx, reply);
-        RedisModule_FreeCallReply(reply);
-    } else {
-        RedisModule_ReplyWithError(ctx, strerror(errno));
-    }
-    return REDISMODULE_OK;
-}
-
-int test_ld_conv(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    UNUSED(argv);
-    UNUSED(argc);
-    long double ld = 0.00000000000000001L;
-    const char *ldstr = "0.00000000000000001";
-    RedisModuleString *s1 = RedisModule_CreateStringFromLongDouble(ctx, ld, 1);
-    RedisModuleString *s2 =
-        RedisModule_CreateString(ctx, ldstr, strlen(ldstr));
-    if (RedisModule_StringCompare(s1, s2) != 0) {
-        char err[4096];
-        snprintf(err, 4096,
-            "Failed to convert long double to string ('%s' != '%s')",
-            RedisModule_StringPtrLen(s1, NULL),
-            RedisModule_StringPtrLen(s2, NULL));
-        RedisModule_ReplyWithError(ctx, err);
-        goto final;
-    }
-    long double ld2 = 0;
-    if (RedisModule_StringToLongDouble(s2, &ld2) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithError(ctx,
-            "Failed to convert string to long double");
-        goto final;
-    }
-    if (ld2 != ld) {
-        char err[4096];
-        snprintf(err, 4096,
-            "Failed to convert string to long double (%.40Lf != %.40Lf)",
-            ld2,
-            ld);
-        RedisModule_ReplyWithError(ctx, err);
-        goto final;
-    }
-
-    /* Make sure we can't convert a string that has \0 in it */
-    char buf[4] = "123";
-    buf[1] = '\0';
-    RedisModuleString *s3 = RedisModule_CreateString(ctx, buf, 3);
-    long double ld3;
-    if (RedisModule_StringToLongDouble(s3, &ld3) == REDISMODULE_OK) {
-        RedisModule_ReplyWithError(ctx, "Invalid string successfully converted to long double");
-        RedisModule_FreeString(ctx, s3);
-        goto final;
-    }
-    RedisModule_FreeString(ctx, s3);
-
-    RedisModule_ReplyWithLongDouble(ctx, ld2);
-final:
-    RedisModule_FreeString(ctx, s1);
-    RedisModule_FreeString(ctx, s2);
-    return REDISMODULE_OK;
-}
-
-int test_flushall(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModule_ResetDataset(1, 0);
-    RedisModule_ReplyWithCString(ctx, "Ok");
-    return REDISMODULE_OK;
-}
-
-int test_dbsize(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    long long ll = RedisModule_DbSize(ctx);
-    RedisModule_ReplyWithLongLong(ctx, ll);
-    return REDISMODULE_OK;
-}
-
-int test_randomkey(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleString *str = RedisModule_RandomKey(ctx);
-    RedisModule_ReplyWithString(ctx, str);
-    RedisModule_FreeString(ctx, str);
-    return REDISMODULE_OK;
-}
-
-RedisModuleKey *open_key_or_reply(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode) {
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, keyname, mode);
-    if (!key) {
-        RedisModule_ReplyWithError(ctx, "key not found");
-        return NULL;
-    }
-    return key;
-}
-
-int test_getlru(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc<2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
-    mstime_t lru;
-    RedisModule_GetLRU(key, &lru);
-    RedisModule_ReplyWithLongLong(ctx, lru);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int test_setlru(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc<3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
-    mstime_t lru;
-    if (RedisModule_StringToLongLong(argv[2], &lru) != REDISMODULE_OK) {
-        RedisModule_ReplyWithError(ctx, "invalid idle time");
-        return REDISMODULE_OK;
-    }
-    int was_set = RedisModule_SetLRU(key, lru)==REDISMODULE_OK;
-    RedisModule_ReplyWithLongLong(ctx, was_set);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int test_getlfu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc<2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
-    mstime_t lfu;
-    RedisModule_GetLFU(key, &lfu);
-    RedisModule_ReplyWithLongLong(ctx, lfu);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int test_setlfu(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc<3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    RedisModuleKey *key = open_key_or_reply(ctx, argv[1], REDISMODULE_READ|REDISMODULE_OPEN_KEY_NOTOUCH);
-    mstime_t lfu;
-    if (RedisModule_StringToLongLong(argv[2], &lfu) != REDISMODULE_OK) {
-        RedisModule_ReplyWithError(ctx, "invalid freq");
-        return REDISMODULE_OK;
-    }
-    int was_set = RedisModule_SetLFU(key, lfu)==REDISMODULE_OK;
-    RedisModule_ReplyWithLongLong(ctx, was_set);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int test_redisversion(RedisModuleCtx *ctx, RedisModuleString **argv, int argc){
-    (void) argv;
-    (void) argc;
-
-    int version = RedisModule_GetServerVersion();
-    int patch = version & 0x000000ff;
-    int minor = (version & 0x0000ff00) >> 8;
-    int major = (version & 0x00ff0000) >> 16;
-
-    RedisModuleString* vStr = RedisModule_CreateStringPrintf(ctx, "%d.%d.%d", major, minor, patch);
-    RedisModule_ReplyWithString(ctx, vStr);
-    RedisModule_FreeString(ctx, vStr);
-  
-    return REDISMODULE_OK;
-}
-
-int test_getclientcert(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    (void) argv;
-    (void) argc;
-
-    RedisModuleString *cert = RedisModule_GetClientCertificate(ctx,
-            RedisModule_GetClientId(ctx));
-    if (!cert) {
-        RedisModule_ReplyWithNull(ctx);
-    } else {
-        RedisModule_ReplyWithString(ctx, cert);
-        RedisModule_FreeString(ctx, cert);
-    }
-
-    return REDISMODULE_OK;
-}
-
-int test_clientinfo(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    (void) argv;
-    (void) argc;
-
-    RedisModuleClientInfo ci = { .version = REDISMODULE_CLIENTINFO_VERSION };
-
-    if (RedisModule_GetClientInfoById(&ci, RedisModule_GetClientId(ctx)) == REDISMODULE_ERR) {
-            RedisModule_ReplyWithError(ctx, "failed to get client info");
-            return REDISMODULE_OK;
-    }
-
-    RedisModule_ReplyWithArray(ctx, 10);
-    char flags[512];
-    snprintf(flags, sizeof(flags) - 1, "%s:%s:%s:%s:%s:%s",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_SSL ? "ssl" : "",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_PUBSUB ? "pubsub" : "",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_BLOCKED ? "blocked" : "",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_TRACKING ? "tracking" : "",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_UNIXSOCKET ? "unixsocket" : "",
-        ci.flags & REDISMODULE_CLIENTINFO_FLAG_MULTI ? "multi" : "");
-
-    RedisModule_ReplyWithCString(ctx, "flags");
-    RedisModule_ReplyWithCString(ctx, flags);
-    RedisModule_ReplyWithCString(ctx, "id");
-    RedisModule_ReplyWithLongLong(ctx, ci.id);
-    RedisModule_ReplyWithCString(ctx, "addr");
-    RedisModule_ReplyWithCString(ctx, ci.addr);
-    RedisModule_ReplyWithCString(ctx, "port");
-    RedisModule_ReplyWithLongLong(ctx, ci.port);
-    RedisModule_ReplyWithCString(ctx, "db");
-    RedisModule_ReplyWithLongLong(ctx, ci.db);
-
-    return REDISMODULE_OK;
-}
-
-int test_log_tsctx(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    RedisModuleCtx *tsctx = RedisModule_GetDetachedThreadSafeContext(ctx);
-
-    if (argc != 3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    char level[50];
-    size_t level_len;
-    const char *level_str = RedisModule_StringPtrLen(argv[1], &level_len);
-    snprintf(level, sizeof(level) - 1, "%.*s", (int) level_len, level_str);
-
-    size_t msg_len;
-    const char *msg_str = RedisModule_StringPtrLen(argv[2], &msg_len);
-
-    RedisModule_Log(tsctx, level, "%.*s", (int) msg_len, msg_str);
-    RedisModule_FreeThreadSafeContext(tsctx);
-
-    RedisModule_ReplyWithSimpleString(ctx, "OK");
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx,"misc",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.call_generic", test_call_generic,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.call_info", test_call_info,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.ld_conversion", test_ld_conv, "",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.flushall", test_flushall,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.dbsize", test_dbsize,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.randomkey", test_randomkey,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.setlru", test_setlru,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.getlru", test_getlru,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.setlfu", test_setlfu,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.getlfu", test_getlfu,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.clientinfo", test_clientinfo,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.redisversion", test_redisversion,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.getclientcert", test_getclientcert,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.log_tsctx", test_log_tsctx,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/propagate.c b/redis-stable/tests/modules/propagate.c
deleted file mode 100644
index ac04d4f9..00000000
--- a/redis-stable/tests/modules/propagate.c
+++ /dev/null
@@ -1,256 +0,0 @@
-/* This module is used to test the propagation (replication + AOF) of
- * commands, via the RedisModule_Replicate() interface, in asynchronous
- * contexts, such as callbacks not implementing commands, and thread safe
- * contexts.
- *
- * We create a timer callback and a threads using a thread safe context.
- * Using both we try to propagate counters increments, and later we check
- * if the replica contains the changes as expected.
- *
- * -----------------------------------------------------------------------------
- *
- * Copyright (c) 2019, Salvatore Sanfilippo <antirez at gmail dot com>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- *   * Redistributions of source code must retain the above copyright notice,
- *     this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *   * Neither the name of Redis nor the names of its contributors may be used
- *     to endorse or promote products derived from this software without
- *     specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-#include <pthread.h>
-
-/* Timer callback. */
-void timerHandler(RedisModuleCtx *ctx, void *data) {
-    REDISMODULE_NOT_USED(ctx);
-    REDISMODULE_NOT_USED(data);
-
-    static int times = 0;
-
-    RedisModule_Replicate(ctx,"INCR","c","timer");
-    times++;
-
-    if (times < 3)
-        RedisModule_CreateTimer(ctx,100,timerHandler,NULL);
-    else
-        times = 0;
-}
-
-int propagateTestTimerCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleTimerID timer_id =
-        RedisModule_CreateTimer(ctx,100,timerHandler,NULL);
-    REDISMODULE_NOT_USED(timer_id);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-/* Timer callback. */
-void timerNestedHandler(RedisModuleCtx *ctx, void *data) {
-    int repl = (long long)data;
-
-    /* The goal is the trigger a module command that calls RM_Replicate
-     * in order to test MULTI/EXEC structre */
-    RedisModule_Replicate(ctx,"INCRBY","cc","timer-nested-start","1");
-    RedisModuleCallReply *reply = RedisModule_Call(ctx,"propagate-test.nested", repl? "!" : "");
-    RedisModule_FreeCallReply(reply);
-    RedisModule_Replicate(ctx,"INCRBY","cc","timer-nested-end","1");
-}
-
-int propagateTestTimerNestedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleTimerID timer_id =
-        RedisModule_CreateTimer(ctx,100,timerNestedHandler,(void*)0);
-    REDISMODULE_NOT_USED(timer_id);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-int propagateTestTimerNestedReplCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    RedisModuleTimerID timer_id =
-        RedisModule_CreateTimer(ctx,100,timerNestedHandler,(void*)1);
-    REDISMODULE_NOT_USED(timer_id);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-/* The thread entry point. */
-void *threadMain(void *arg) {
-    REDISMODULE_NOT_USED(arg);
-    RedisModuleCtx *ctx = RedisModule_GetThreadSafeContext(NULL);
-    RedisModule_SelectDb(ctx,9); /* Tests ran in database number 9. */
-    for (int i = 0; i < 3; i++) {
-        RedisModule_ThreadSafeContextLock(ctx);
-        RedisModule_Replicate(ctx,"INCR","c","a-from-thread");
-        RedisModule_Replicate(ctx,"INCR","c","b-from-thread");
-        RedisModule_ThreadSafeContextUnlock(ctx);
-    }
-    RedisModule_FreeThreadSafeContext(ctx);
-    return NULL;
-}
-
-int propagateTestThreadCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    pthread_t tid;
-    if (pthread_create(&tid,NULL,threadMain,NULL) != 0)
-        return RedisModule_ReplyWithError(ctx,"-ERR Can't start thread");
-    REDISMODULE_NOT_USED(tid);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-int propagateTestSimpleCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    /* Replicate two commands to test MULTI/EXEC wrapping. */
-    RedisModule_Replicate(ctx,"INCR","c","counter-1");
-    RedisModule_Replicate(ctx,"INCR","c","counter-2");
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-int propagateTestMixedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleCallReply *reply;
-
-    /* This test mixes multiple propagation systems. */
-    reply = RedisModule_Call(ctx, "INCR", "c!", "using-call");
-    RedisModule_FreeCallReply(reply);
-
-    RedisModule_Replicate(ctx,"INCR","c","counter-1");
-    RedisModule_Replicate(ctx,"INCR","c","counter-2");
-
-    reply = RedisModule_Call(ctx, "INCR", "c!", "after-call");
-    RedisModule_FreeCallReply(reply);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-int propagateTestNestedCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleCallReply *reply;
-
-    /* This test mixes multiple propagation systems. */
-    reply = RedisModule_Call(ctx, "INCR", "c!", "using-call");
-    RedisModule_FreeCallReply(reply);
-
-    reply = RedisModule_Call(ctx,"propagate-test.simple", "!");
-    RedisModule_FreeCallReply(reply);
-
-    RedisModule_Replicate(ctx,"INCR","c","counter-3");
-    RedisModule_Replicate(ctx,"INCR","c","counter-4");
-
-    reply = RedisModule_Call(ctx, "INCR", "c!", "after-call");
-    RedisModule_FreeCallReply(reply);
-
-    RedisModule_ReplyWithSimpleString(ctx,"OK");
-    return REDISMODULE_OK;
-}
-
-int propagateTestIncr(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argc);
-    RedisModuleCallReply *reply;
-
-    /* This test propagates the module command, not the INCR it executes. */
-    reply = RedisModule_Call(ctx, "INCR", "s", argv[1]);
-    RedisModule_ReplyWithCallReply(ctx,reply);
-    RedisModule_FreeCallReply(reply);
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"propagate-test",1,REDISMODULE_APIVER_1)
-            == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.timer",
-                propagateTestTimerCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.timer-nested",
-                propagateTestTimerNestedCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.timer-nested-repl",
-                propagateTestTimerNestedReplCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.thread",
-                propagateTestThreadCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.simple",
-                propagateTestSimpleCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.mixed",
-                propagateTestMixedCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.nested",
-                propagateTestNestedCommand,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"propagate-test.incr",
-                propagateTestIncr,
-                "",1,1,1) == REDISMODULE_ERR)
-            return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/scan.c b/redis-stable/tests/modules/scan.c
deleted file mode 100644
index 1576bae9..00000000
--- a/redis-stable/tests/modules/scan.c
+++ /dev/null
@@ -1,121 +0,0 @@
-#include "redismodule.h"
-
-#include <string.h>
-#include <assert.h>
-#include <unistd.h>
-
-typedef struct {
-    size_t nkeys;
-} scan_strings_pd;
-
-void scan_strings_callback(RedisModuleCtx *ctx, RedisModuleString* keyname, RedisModuleKey* key, void *privdata) {
-    scan_strings_pd* pd = privdata;
-    int was_opened = 0;
-    if (!key) {
-        key = RedisModule_OpenKey(ctx, keyname, REDISMODULE_READ);
-        was_opened = 1;
-    }
-
-    if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_STRING) {
-        size_t len;
-        char * data = RedisModule_StringDMA(key, &len, REDISMODULE_READ);
-        RedisModule_ReplyWithArray(ctx, 2);
-        RedisModule_ReplyWithString(ctx, keyname);
-        RedisModule_ReplyWithStringBuffer(ctx, data, len);
-        pd->nkeys++;
-    }
-    if (was_opened)
-        RedisModule_CloseKey(key);
-}
-
-int scan_strings(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    scan_strings_pd pd = {
-        .nkeys = 0,
-    };
-
-    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
-
-    RedisModuleScanCursor* cursor = RedisModule_ScanCursorCreate();
-    while(RedisModule_Scan(ctx, cursor, scan_strings_callback, &pd));
-    RedisModule_ScanCursorDestroy(cursor);
-
-    RedisModule_ReplySetArrayLength(ctx, pd.nkeys);
-    return REDISMODULE_OK;
-}
-
-typedef struct {
-    RedisModuleCtx *ctx;
-    size_t nreplies;
-} scan_key_pd;
-
-void scan_key_callback(RedisModuleKey *key, RedisModuleString* field, RedisModuleString* value, void *privdata) {
-    REDISMODULE_NOT_USED(key);
-    scan_key_pd* pd = privdata;
-    RedisModule_ReplyWithArray(pd->ctx, 2);
-    size_t fieldCStrLen;
-
-    // The implementation of RedisModuleString is robj with lots of encodings.
-    // We want to make sure the robj that passes to this callback in
-    // String encoded, this is why we use RedisModule_StringPtrLen and
-    // RedisModule_ReplyWithStringBuffer instead of directly use
-    // RedisModule_ReplyWithString.
-    const char* fieldCStr = RedisModule_StringPtrLen(field, &fieldCStrLen);
-    RedisModule_ReplyWithStringBuffer(pd->ctx, fieldCStr, fieldCStrLen);
-    if(value){
-        size_t valueCStrLen;
-        const char* valueCStr = RedisModule_StringPtrLen(value, &valueCStrLen);
-        RedisModule_ReplyWithStringBuffer(pd->ctx, valueCStr, valueCStrLen);
-    } else {
-        RedisModule_ReplyWithNull(pd->ctx);
-    }
-
-    pd->nreplies++;
-}
-
-int scan_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    scan_key_pd pd = {
-        .ctx = ctx,
-        .nreplies = 0,
-    };
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ);
-    if (!key) {
-        RedisModule_ReplyWithError(ctx, "not found");
-        return REDISMODULE_OK;
-    }
-
-    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
-
-    RedisModuleScanCursor* cursor = RedisModule_ScanCursorCreate();
-    while(RedisModule_ScanKey(key, cursor, scan_key_callback, &pd));
-    RedisModule_ScanCursorDestroy(cursor);
-
-    RedisModule_ReplySetArrayLength(ctx, pd.nreplies);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx, "scan", 1, REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "scan.scan_strings", scan_strings, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "scan.scan_key", scan_key, "", 0, 0, 0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
-
-
diff --git a/redis-stable/tests/modules/stream.c b/redis-stable/tests/modules/stream.c
deleted file mode 100644
index abfbb1fa..00000000
--- a/redis-stable/tests/modules/stream.c
+++ /dev/null
@@ -1,258 +0,0 @@
-#include "redismodule.h"
-
-#include <string.h>
-#include <strings.h>
-#include <assert.h>
-#include <unistd.h>
-#include <errno.h>
-
-/* Command which adds a stream entry with automatic ID, like XADD *.
- *
- * Syntax: STREAM.ADD key field1 value1 [ field2 value2 ... ]
- *
- * The response is the ID of the added stream entry or an error message.
- */
-int stream_add(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc < 2 || argc % 2 != 0) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    RedisModuleStreamID id;
-    if (RedisModule_StreamAdd(key, REDISMODULE_STREAM_ADD_AUTOID, &id,
-                              &argv[2], (argc-2)/2) == REDISMODULE_OK) {
-        RedisModuleString *id_str = RedisModule_CreateStringFromStreamID(ctx, &id);
-        RedisModule_ReplyWithString(ctx, id_str);
-        RedisModule_FreeString(ctx, id_str);
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR StreamAdd failed");
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/* Command which adds a stream entry N times.
- *
- * Syntax: STREAM.ADD key N field1 value1 [ field2 value2 ... ]
- *
- * Returns the number of successfully added entries.
- */
-int stream_addn(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc < 3 || argc % 2 == 0) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    long long n, i;
-    if (RedisModule_StringToLongLong(argv[2], &n) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithError(ctx, "N must be a number");
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    for (i = 0; i < n; i++) {
-        if (RedisModule_StreamAdd(key, REDISMODULE_STREAM_ADD_AUTOID, NULL,
-                                  &argv[3], (argc-3)/2) == REDISMODULE_ERR)
-            break;
-    }
-    RedisModule_ReplyWithLongLong(ctx, i);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/* STREAM.DELETE key stream-id */
-int stream_delete(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    RedisModuleStreamID id;
-    if (RedisModule_StringToStreamID(argv[2], &id) != REDISMODULE_OK) {
-        return RedisModule_ReplyWithError(ctx, "Invalid stream ID");
-    }
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    if (RedisModule_StreamDelete(key, &id) == REDISMODULE_OK) {
-        RedisModule_ReplyWithSimpleString(ctx, "OK");
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR StreamDelete failed");
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/* STREAM.RANGE key start-id end-id
- *
- * Returns an array of stream items. Each item is an array on the form
- * [stream-id, [field1, value1, field2, value2, ...]].
- *
- * A funny side-effect used for testing RM_StreamIteratorDelete() is that if any
- * entry has a field named "selfdestruct", the stream entry is deleted. It is
- * however included in the results of this command.
- */
-int stream_range(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 4) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleStreamID startid, endid;
-    if (RedisModule_StringToStreamID(argv[2], &startid) != REDISMODULE_OK ||
-        RedisModule_StringToStreamID(argv[3], &endid) != REDISMODULE_OK) {
-        RedisModule_ReplyWithError(ctx, "Invalid stream ID");
-        return REDISMODULE_OK;
-    }
-
-    /* If startid > endid, we swap and set the reverse flag. */
-    int flags = 0;
-    if (startid.ms > endid.ms ||
-        (startid.ms == endid.ms && startid.seq > endid.seq)) {
-        RedisModuleStreamID tmp = startid;
-        startid = endid;
-        endid = tmp;
-        flags |= REDISMODULE_STREAM_ITERATOR_REVERSE;
-    }
-
-    /* Open key and start iterator. */
-    int openflags = REDISMODULE_READ | REDISMODULE_WRITE;
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], openflags);
-    if (RedisModule_StreamIteratorStart(key, flags,
-                                        &startid, &endid) != REDISMODULE_OK) {
-        /* Key is not a stream, etc. */
-        RedisModule_ReplyWithError(ctx, "ERR StreamIteratorStart failed");
-        RedisModule_CloseKey(key);
-        return REDISMODULE_OK;
-    }
-
-    /* Check error handling: Delete current entry when no current entry. */
-    assert(RedisModule_StreamIteratorDelete(key) ==
-           REDISMODULE_ERR);
-    assert(errno == ENOENT);
-
-    /* Check error handling: Fetch fields when no current entry. */
-    assert(RedisModule_StreamIteratorNextField(key, NULL, NULL) ==
-           REDISMODULE_ERR);
-    assert(errno == ENOENT);
-
-    /* Return array. */
-    RedisModule_ReplyWithArray(ctx, REDISMODULE_POSTPONED_ARRAY_LEN);
-    RedisModule_AutoMemory(ctx);
-    RedisModuleStreamID id;
-    long numfields;
-    long len = 0;
-    while (RedisModule_StreamIteratorNextID(key, &id,
-                                            &numfields) == REDISMODULE_OK) {
-        RedisModule_ReplyWithArray(ctx, 2);
-        RedisModuleString *id_str = RedisModule_CreateStringFromStreamID(ctx, &id);
-        RedisModule_ReplyWithString(ctx, id_str);
-        RedisModule_ReplyWithArray(ctx, numfields * 2);
-        int delete = 0;
-        RedisModuleString *field, *value;
-        for (long i = 0; i < numfields; i++) {
-            assert(RedisModule_StreamIteratorNextField(key, &field, &value) ==
-                   REDISMODULE_OK);
-            RedisModule_ReplyWithString(ctx, field);
-            RedisModule_ReplyWithString(ctx, value);
-            /* check if this is a "selfdestruct" field */
-            size_t field_len;
-            const char *field_str = RedisModule_StringPtrLen(field, &field_len);
-            if (!strncmp(field_str, "selfdestruct", field_len)) delete = 1;
-        }
-        if (delete) {
-            assert(RedisModule_StreamIteratorDelete(key) == REDISMODULE_OK);
-        }
-        /* check error handling: no more fields to fetch */
-        assert(RedisModule_StreamIteratorNextField(key, &field, &value) ==
-               REDISMODULE_ERR);
-        assert(errno == ENOENT);
-        len++;
-    }
-    RedisModule_ReplySetArrayLength(ctx, len);
-    RedisModule_StreamIteratorStop(key);
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-/*
- * STREAM.TRIM key (MAXLEN (=|~) length | MINID (=|~) id)
- */
-int stream_trim(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 5) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    /* Parse args */
-    int trim_by_id = 0; /* 0 = maxlen, 1 = minid */
-    long long maxlen;
-    RedisModuleStreamID minid;
-    size_t arg_len;
-    const char *arg = RedisModule_StringPtrLen(argv[2], &arg_len);
-    if (!strcasecmp(arg, "minid")) {
-        trim_by_id = 1;
-        if (RedisModule_StringToStreamID(argv[4], &minid) != REDISMODULE_OK) {
-            RedisModule_ReplyWithError(ctx, "ERR Invalid stream ID");
-            return REDISMODULE_OK;
-        }
-    } else if (!strcasecmp(arg, "maxlen")) {
-        if (RedisModule_StringToLongLong(argv[4], &maxlen) == REDISMODULE_ERR) {
-            RedisModule_ReplyWithError(ctx, "ERR Maxlen must be a number");
-            return REDISMODULE_OK;
-        }
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR Invalid arguments");
-        return REDISMODULE_OK;
-    }
-
-    /* Approx or exact */
-    int flags;
-    arg = RedisModule_StringPtrLen(argv[3], &arg_len);
-    if (arg_len == 1 && arg[0] == '~') {
-        flags = REDISMODULE_STREAM_TRIM_APPROX;
-    } else if (arg_len == 1 && arg[0] == '=') {
-        flags = 0;
-    } else {
-        RedisModule_ReplyWithError(ctx, "ERR Invalid approx-or-exact mark");
-        return REDISMODULE_OK;
-    }
-
-    /* Trim */
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    long long trimmed;
-    if (trim_by_id) {
-        trimmed = RedisModule_StreamTrimByID(key, flags, &minid);
-    } else {
-        trimmed = RedisModule_StreamTrimByLength(key, flags, maxlen);
-    }
-
-    /* Return result */
-    if (trimmed < 0) {
-        RedisModule_ReplyWithError(ctx, "ERR Trimming failed");
-    } else {
-        RedisModule_ReplyWithLongLong(ctx, trimmed);
-    }
-    RedisModule_CloseKey(key);
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx, "stream", 1, REDISMODULE_APIVER_1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx, "stream.add", stream_add, "",
-                                  1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx, "stream.addn", stream_addn, "",
-                                  1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx, "stream.delete", stream_delete, "",
-                                  1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx, "stream.range", stream_range, "",
-                                  1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx, "stream.trim", stream_trim, "",
-                                  1, 1, 1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/test_lazyfree.c b/redis-stable/tests/modules/test_lazyfree.c
deleted file mode 100644
index 144dab9b..00000000
--- a/redis-stable/tests/modules/test_lazyfree.c
+++ /dev/null
@@ -1,196 +0,0 @@
-/* This module emulates a linked list for lazyfree testing of modules, which
- is a simplified version of 'hellotype.c'
- */
-#include "redismodule.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-#include <stdint.h>
-
-static RedisModuleType *LazyFreeLinkType;
-
-struct LazyFreeLinkNode {
-    int64_t value;
-    struct LazyFreeLinkNode *next;
-};
-
-struct LazyFreeLinkObject {
-    struct LazyFreeLinkNode *head;
-    size_t len; /* Number of elements added. */
-};
-
-struct LazyFreeLinkObject *createLazyFreeLinkObject(void) {
-    struct LazyFreeLinkObject *o;
-    o = RedisModule_Alloc(sizeof(*o));
-    o->head = NULL;
-    o->len = 0;
-    return o;
-}
-
-void LazyFreeLinkInsert(struct LazyFreeLinkObject *o, int64_t ele) {
-    struct LazyFreeLinkNode *next = o->head, *newnode, *prev = NULL;
-
-    while(next && next->value < ele) {
-        prev = next;
-        next = next->next;
-    }
-    newnode = RedisModule_Alloc(sizeof(*newnode));
-    newnode->value = ele;
-    newnode->next = next;
-    if (prev) {
-        prev->next = newnode;
-    } else {
-        o->head = newnode;
-    }
-    o->len++;
-}
-
-void LazyFreeLinkReleaseObject(struct LazyFreeLinkObject *o) {
-    struct LazyFreeLinkNode *cur, *next;
-    cur = o->head;
-    while(cur) {
-        next = cur->next;
-        RedisModule_Free(cur);
-        cur = next;
-    }
-    RedisModule_Free(o);
-}
-
-/* LAZYFREELINK.INSERT key value */
-int LazyFreeLinkInsert_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != LazyFreeLinkType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    long long value;
-    if ((RedisModule_StringToLongLong(argv[2],&value) != REDISMODULE_OK)) {
-        return RedisModule_ReplyWithError(ctx,"ERR invalid value: must be a signed 64 bit integer");
-    }
-
-    struct LazyFreeLinkObject *hto;
-    if (type == REDISMODULE_KEYTYPE_EMPTY) {
-        hto = createLazyFreeLinkObject();
-        RedisModule_ModuleTypeSetValue(key,LazyFreeLinkType,hto);
-    } else {
-        hto = RedisModule_ModuleTypeGetValue(key);
-    }
-
-    LazyFreeLinkInsert(hto,value);
-    RedisModule_SignalKeyAsReady(ctx,argv[1]);
-
-    RedisModule_ReplyWithLongLong(ctx,hto->len);
-    RedisModule_ReplicateVerbatim(ctx);
-    return REDISMODULE_OK;
-}
-
-/* LAZYFREELINK.LEN key */
-int LazyFreeLinkLen_RedisCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    RedisModule_AutoMemory(ctx); /* Use automatic memory management. */
-
-    if (argc != 2) return RedisModule_WrongArity(ctx);
-    RedisModuleKey *key = RedisModule_OpenKey(ctx,argv[1],
-        REDISMODULE_READ|REDISMODULE_WRITE);
-    int type = RedisModule_KeyType(key);
-    if (type != REDISMODULE_KEYTYPE_EMPTY &&
-        RedisModule_ModuleTypeGetType(key) != LazyFreeLinkType)
-    {
-        return RedisModule_ReplyWithError(ctx,REDISMODULE_ERRORMSG_WRONGTYPE);
-    }
-
-    struct LazyFreeLinkObject *hto = RedisModule_ModuleTypeGetValue(key);
-    RedisModule_ReplyWithLongLong(ctx,hto ? hto->len : 0);
-    return REDISMODULE_OK;
-}
-
-void *LazyFreeLinkRdbLoad(RedisModuleIO *rdb, int encver) {
-    if (encver != 0) {
-        return NULL;
-    }
-    uint64_t elements = RedisModule_LoadUnsigned(rdb);
-    struct LazyFreeLinkObject *hto = createLazyFreeLinkObject();
-    while(elements--) {
-        int64_t ele = RedisModule_LoadSigned(rdb);
-        LazyFreeLinkInsert(hto,ele);
-    }
-    return hto;
-}
-
-void LazyFreeLinkRdbSave(RedisModuleIO *rdb, void *value) {
-    struct LazyFreeLinkObject *hto = value;
-    struct LazyFreeLinkNode *node = hto->head;
-    RedisModule_SaveUnsigned(rdb,hto->len);
-    while(node) {
-        RedisModule_SaveSigned(rdb,node->value);
-        node = node->next;
-    }
-}
-
-void LazyFreeLinkAofRewrite(RedisModuleIO *aof, RedisModuleString *key, void *value) {
-    struct LazyFreeLinkObject *hto = value;
-    struct LazyFreeLinkNode *node = hto->head;
-    while(node) {
-        RedisModule_EmitAOF(aof,"LAZYFREELINK.INSERT","sl",key,node->value);
-        node = node->next;
-    }
-}
-
-void LazyFreeLinkFree(void *value) {
-    LazyFreeLinkReleaseObject(value);
-}
-
-size_t LazyFreeLinkFreeEffort(RedisModuleString *key, const void *value) {
-    REDISMODULE_NOT_USED(key);
-    const struct LazyFreeLinkObject *hto = value;
-    return hto->len;
-}
-
-void LazyFreeLinkUnlink(RedisModuleString *key, const void *value) {
-    REDISMODULE_NOT_USED(key);
-    REDISMODULE_NOT_USED(value);
-    /* Here you can know which key and value is about to be freed. */
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"lazyfreetest",1,REDISMODULE_APIVER_1)
-        == REDISMODULE_ERR) return REDISMODULE_ERR;
-
-    /* We only allow our module to be loaded when the redis core version is greater than the version of my module */
-    if (RedisModule_GetTypeMethodVersion() < REDISMODULE_TYPE_METHOD_VERSION) {
-        return REDISMODULE_ERR;
-    }
-
-    RedisModuleTypeMethods tm = {
-        .version = REDISMODULE_TYPE_METHOD_VERSION,
-        .rdb_load = LazyFreeLinkRdbLoad,
-        .rdb_save = LazyFreeLinkRdbSave,
-        .aof_rewrite = LazyFreeLinkAofRewrite,
-        .free = LazyFreeLinkFree,
-        .free_effort = LazyFreeLinkFreeEffort,
-        .unlink = LazyFreeLinkUnlink,
-    };
-
-    LazyFreeLinkType = RedisModule_CreateDataType(ctx,"test_lazy",0,&tm);
-    if (LazyFreeLinkType == NULL) return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"lazyfreelink.insert",
-        LazyFreeLinkInsert_RedisCommand,"write deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"lazyfreelink.len",
-        LazyFreeLinkLen_RedisCommand,"readonly",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/testrdb.c b/redis-stable/tests/modules/testrdb.c
deleted file mode 100644
index 5d9382a3..00000000
--- a/redis-stable/tests/modules/testrdb.c
+++ /dev/null
@@ -1,301 +0,0 @@
-#include "redismodule.h"
-
-#include <string.h>
-#include <assert.h>
-
-/* Module configuration, save aux or not? */
-long long conf_aux_count = 0;
-
-/* Registered type */
-RedisModuleType *testrdb_type = NULL;
-
-/* Global values to store and persist to aux */
-RedisModuleString *before_str = NULL;
-RedisModuleString *after_str = NULL;
-
-void replBackupCallback(RedisModuleCtx *ctx, RedisModuleEvent e, uint64_t sub, void *data)
-{
-    REDISMODULE_NOT_USED(e);
-    REDISMODULE_NOT_USED(data);
-    static RedisModuleString *before_str_backup = NULL;
-    static RedisModuleString *after_str_backup = NULL;
-
-    switch (sub) {
-    case REDISMODULE_SUBEVENT_REPL_BACKUP_CREATE:
-        assert(before_str_backup == NULL);
-        assert(after_str_backup == NULL);
-        before_str_backup = before_str;
-        after_str_backup = after_str;
-        before_str = NULL;
-        after_str = NULL;
-        break;
-    case REDISMODULE_SUBEVENT_REPL_BACKUP_RESTORE:
-        if (before_str)
-            RedisModule_FreeString(ctx, before_str);
-        if (after_str)
-            RedisModule_FreeString(ctx, after_str);
-        before_str = before_str_backup;
-        after_str = after_str_backup;
-        before_str_backup = NULL;
-        after_str_backup = NULL;
-        break;
-    case REDISMODULE_SUBEVENT_REPL_BACKUP_DISCARD:
-        if (before_str_backup)
-            RedisModule_FreeString(ctx, before_str_backup);
-        if (after_str_backup)
-            RedisModule_FreeString(ctx, after_str_backup);
-        before_str_backup = NULL;
-        after_str_backup = NULL;
-        break;
-    default:
-        assert(0);
-    }
-}
-
-void *testrdb_type_load(RedisModuleIO *rdb, int encver) {
-    int count = RedisModule_LoadSigned(rdb);
-    RedisModuleString *str = RedisModule_LoadString(rdb);
-    float f = RedisModule_LoadFloat(rdb);
-    long double ld = RedisModule_LoadLongDouble(rdb);
-    if (RedisModule_IsIOError(rdb)) {
-        RedisModuleCtx *ctx = RedisModule_GetContextFromIO(rdb);
-        if (str)
-            RedisModule_FreeString(ctx, str);
-        return NULL;
-    }
-    /* Using the values only after checking for io errors. */
-    assert(count==1);
-    assert(encver==1);
-    assert(f==1.5f);
-    assert(ld==0.333333333333333333L);
-    return str;
-}
-
-void testrdb_type_save(RedisModuleIO *rdb, void *value) {
-    RedisModuleString *str = (RedisModuleString*)value;
-    RedisModule_SaveSigned(rdb, 1);
-    RedisModule_SaveString(rdb, str);
-    RedisModule_SaveFloat(rdb, 1.5);
-    RedisModule_SaveLongDouble(rdb, 0.333333333333333333L);
-}
-
-void testrdb_aux_save(RedisModuleIO *rdb, int when) {
-    if (conf_aux_count==1) assert(when == REDISMODULE_AUX_AFTER_RDB);
-    if (conf_aux_count==0) assert(0);
-    if (when == REDISMODULE_AUX_BEFORE_RDB) {
-        if (before_str) {
-            RedisModule_SaveSigned(rdb, 1);
-            RedisModule_SaveString(rdb, before_str);
-        } else {
-            RedisModule_SaveSigned(rdb, 0);
-        }
-    } else {
-        if (after_str) {
-            RedisModule_SaveSigned(rdb, 1);
-            RedisModule_SaveString(rdb, after_str);
-        } else {
-            RedisModule_SaveSigned(rdb, 0);
-        }
-    }
-}
-
-int testrdb_aux_load(RedisModuleIO *rdb, int encver, int when) {
-    assert(encver == 1);
-    if (conf_aux_count==1) assert(when == REDISMODULE_AUX_AFTER_RDB);
-    if (conf_aux_count==0) assert(0);
-    RedisModuleCtx *ctx = RedisModule_GetContextFromIO(rdb);
-    if (when == REDISMODULE_AUX_BEFORE_RDB) {
-        if (before_str)
-            RedisModule_FreeString(ctx, before_str);
-        before_str = NULL;
-        int count = RedisModule_LoadSigned(rdb);
-        if (RedisModule_IsIOError(rdb))
-            return REDISMODULE_ERR;
-        if (count)
-            before_str = RedisModule_LoadString(rdb);
-    } else {
-        if (after_str)
-            RedisModule_FreeString(ctx, after_str);
-        after_str = NULL;
-        int count = RedisModule_LoadSigned(rdb);
-        if (RedisModule_IsIOError(rdb))
-            return REDISMODULE_ERR;
-        if (count)
-            after_str = RedisModule_LoadString(rdb);
-    }
-    if (RedisModule_IsIOError(rdb))
-        return REDISMODULE_ERR;
-    return REDISMODULE_OK;
-}
-
-void testrdb_type_free(void *value) {
-    if (value)
-        RedisModule_FreeString(NULL, (RedisModuleString*)value);
-}
-
-int testrdb_set_before(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    if (before_str)
-        RedisModule_FreeString(ctx, before_str);
-    before_str = argv[1];
-    RedisModule_RetainString(ctx, argv[1]);
-    RedisModule_ReplyWithLongLong(ctx, 1);
-    return REDISMODULE_OK;
-}
-
-int testrdb_get_before(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    if (argc != 1){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    if (before_str)
-        RedisModule_ReplyWithString(ctx, before_str);
-    else
-        RedisModule_ReplyWithStringBuffer(ctx, "", 0);
-    return REDISMODULE_OK;
-}
-
-int testrdb_set_after(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    if (after_str)
-        RedisModule_FreeString(ctx, after_str);
-    after_str = argv[1];
-    RedisModule_RetainString(ctx, argv[1]);
-    RedisModule_ReplyWithLongLong(ctx, 1);
-    return REDISMODULE_OK;
-}
-
-int testrdb_get_after(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    REDISMODULE_NOT_USED(argv);
-    if (argc != 1){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-    if (after_str)
-        RedisModule_ReplyWithString(ctx, after_str);
-    else
-        RedisModule_ReplyWithStringBuffer(ctx, "", 0);
-    return REDISMODULE_OK;
-}
-
-int testrdb_set_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 3){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    RedisModuleString *str = RedisModule_ModuleTypeGetValue(key);
-    if (str)
-        RedisModule_FreeString(ctx, str);
-    RedisModule_ModuleTypeSetValue(key, testrdb_type, argv[2]);
-    RedisModule_RetainString(ctx, argv[2]);
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithLongLong(ctx, 1);
-    return REDISMODULE_OK;
-}
-
-int testrdb_get_key(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2){
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_WRITE);
-    RedisModuleString *str = RedisModule_ModuleTypeGetValue(key);
-    RedisModule_CloseKey(key);
-    RedisModule_ReplyWithString(ctx, str);
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-
-    if (RedisModule_Init(ctx,"testrdb",1,REDISMODULE_APIVER_1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModule_SetModuleOptions(ctx, REDISMODULE_OPTIONS_HANDLE_IO_ERRORS);
-
-    if (argc > 0)
-        RedisModule_StringToLongLong(argv[0], &conf_aux_count);
-
-    if (conf_aux_count==0) {
-        RedisModuleTypeMethods datatype_methods = {
-            .version = 1,
-            .rdb_load = testrdb_type_load,
-            .rdb_save = testrdb_type_save,
-            .aof_rewrite = NULL,
-            .digest = NULL,
-            .free = testrdb_type_free,
-        };
-
-        testrdb_type = RedisModule_CreateDataType(ctx, "test__rdb", 1, &datatype_methods);
-        if (testrdb_type == NULL)
-            return REDISMODULE_ERR;
-    } else {
-        RedisModuleTypeMethods datatype_methods = {
-            .version = REDISMODULE_TYPE_METHOD_VERSION,
-            .rdb_load = testrdb_type_load,
-            .rdb_save = testrdb_type_save,
-            .aof_rewrite = NULL,
-            .digest = NULL,
-            .free = testrdb_type_free,
-            .aux_load = testrdb_aux_load,
-            .aux_save = testrdb_aux_save,
-            .aux_save_triggers = (conf_aux_count == 1 ?
-                                  REDISMODULE_AUX_AFTER_RDB :
-                                  REDISMODULE_AUX_BEFORE_RDB | REDISMODULE_AUX_AFTER_RDB)
-        };
-
-        testrdb_type = RedisModule_CreateDataType(ctx, "test__rdb", 1, &datatype_methods);
-        if (testrdb_type == NULL)
-            return REDISMODULE_ERR;
-    }
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.set.before", testrdb_set_before,"deny-oom",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.get.before", testrdb_get_before,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.set.after", testrdb_set_after,"deny-oom",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.get.after", testrdb_get_after,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.set.key", testrdb_set_key,"deny-oom",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"testrdb.get.key", testrdb_get_key,"",1,1,1) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    RedisModule_SubscribeToServerEvent(ctx,
-        RedisModuleEvent_ReplBackup, replBackupCallback);
-
-    return REDISMODULE_OK;
-}
-
-int RedisModule_OnUnload(RedisModuleCtx *ctx) {
-    if (before_str)
-        RedisModule_FreeString(ctx, before_str);
-    if (after_str)
-        RedisModule_FreeString(ctx, after_str);
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/timer.c b/redis-stable/tests/modules/timer.c
deleted file mode 100644
index d2a8d8e7..00000000
--- a/redis-stable/tests/modules/timer.c
+++ /dev/null
@@ -1,103 +0,0 @@
-
-#define REDISMODULE_EXPERIMENTAL_API
-#include "redismodule.h"
-
-static void timer_callback(RedisModuleCtx *ctx, void *data)
-{
-    RedisModuleString *keyname = data;
-    RedisModuleCallReply *reply;
-
-    reply = RedisModule_Call(ctx, "INCR", "s", keyname);
-    if (reply != NULL)
-        RedisModule_FreeCallReply(reply);
-    RedisModule_FreeString(ctx, keyname);
-}
-
-int test_createtimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 3) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    long long period;
-    if (RedisModule_StringToLongLong(argv[1], &period) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithError(ctx, "Invalid time specified.");
-        return REDISMODULE_OK;
-    }
-
-    RedisModuleString *keyname = argv[2];
-    RedisModule_RetainString(ctx, keyname);
-
-    RedisModuleTimerID id = RedisModule_CreateTimer(ctx, period, timer_callback, keyname);
-    RedisModule_ReplyWithLongLong(ctx, id);
-
-    return REDISMODULE_OK;
-}
-
-int test_gettimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    long long id;
-    if (RedisModule_StringToLongLong(argv[1], &id) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithError(ctx, "Invalid id specified.");
-        return REDISMODULE_OK;
-    }
-
-    uint64_t remaining;
-    RedisModuleString *keyname;
-    if (RedisModule_GetTimerInfo(ctx, id, &remaining, (void **)&keyname) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithNull(ctx);
-    } else {
-        RedisModule_ReplyWithArray(ctx, 2);
-        RedisModule_ReplyWithString(ctx, keyname);
-        RedisModule_ReplyWithLongLong(ctx, remaining);
-    }
-
-    return REDISMODULE_OK;
-}
-
-int test_stoptimer(RedisModuleCtx *ctx, RedisModuleString **argv, int argc)
-{
-    if (argc != 2) {
-        RedisModule_WrongArity(ctx);
-        return REDISMODULE_OK;
-    }
-
-    long long id;
-    if (RedisModule_StringToLongLong(argv[1], &id) == REDISMODULE_ERR) {
-        RedisModule_ReplyWithError(ctx, "Invalid id specified.");
-        return REDISMODULE_OK;
-    }
-
-    int ret = 0;
-    RedisModuleString *keyname;
-    if (RedisModule_StopTimer(ctx, id, (void **) &keyname) == REDISMODULE_OK) {
-        RedisModule_FreeString(ctx, keyname);
-        ret = 1;
-    }
-
-    RedisModule_ReplyWithLongLong(ctx, ret);
-    return REDISMODULE_OK;
-}
-
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx,"timer",1,REDISMODULE_APIVER_1)== REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    if (RedisModule_CreateCommand(ctx,"test.createtimer", test_createtimer,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.gettimer", test_gettimer,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-    if (RedisModule_CreateCommand(ctx,"test.stoptimer", test_stoptimer,"",0,0,0) == REDISMODULE_ERR)
-        return REDISMODULE_ERR;
-
-    return REDISMODULE_OK;
-}
diff --git a/redis-stable/tests/modules/zset.c b/redis-stable/tests/modules/zset.c
deleted file mode 100644
index 4806f654..00000000
--- a/redis-stable/tests/modules/zset.c
+++ /dev/null
@@ -1,30 +0,0 @@
-#include "redismodule.h"
-
-/* ZSET.REM key element
- *
- * Removes an occurrence of an element from a sorted set. Replies with the
- * number of removed elements (0 or 1).
- */
-int zset_rem(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    if (argc != 3) return RedisModule_WrongArity(ctx);
-    RedisModule_AutoMemory(ctx);
-    int keymode = REDISMODULE_READ | REDISMODULE_WRITE;
-    RedisModuleKey *key = RedisModule_OpenKey(ctx, argv[1], keymode);
-    int deleted;
-    if (RedisModule_ZsetRem(key, argv[2], &deleted) == REDISMODULE_OK)
-        return RedisModule_ReplyWithLongLong(ctx, deleted);
-    else
-        return RedisModule_ReplyWithError(ctx, "ERR ZsetRem failed");
-}
-
-int RedisModule_OnLoad(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) {
-    REDISMODULE_NOT_USED(argv);
-    REDISMODULE_NOT_USED(argc);
-    if (RedisModule_Init(ctx, "zset", 1, REDISMODULE_APIVER_1) ==
-        REDISMODULE_OK &&
-        RedisModule_CreateCommand(ctx, "zset.rem", zset_rem, "",
-                                  1, 1, 1) == REDISMODULE_OK)
-        return REDISMODULE_OK;
-    else
-        return REDISMODULE_ERR;
-}
diff --git a/redis-stable/tests/sentinel/run.tcl b/redis-stable/tests/sentinel/run.tcl
deleted file mode 100644
index 64c99c10..00000000
--- a/redis-stable/tests/sentinel/run.tcl
+++ /dev/null
@@ -1,27 +0,0 @@
-# Sentinel test suite. Copyright (C) 2014 Salvatore Sanfilippo antirez@gmail.com
-# This software is released under the BSD License. See the COPYING file for
-# more information.
-
-cd tests/sentinel
-source ../instances.tcl
-
-set ::instances_count 5 ; # How many instances we use at max.
-set ::tlsdir "../../tls"
-
-proc main {} {
-    parse_options
-    if {$::leaked_fds_file != ""} {
-        set ::env(LEAKED_FDS_FILE) $::leaked_fds_file
-    }
-    spawn_instance sentinel $::sentinel_base_port $::instances_count [list "sentinel deny-scripts-reconfig no"] "../tests/includes/sentinel.conf"
-    spawn_instance redis $::redis_base_port $::instances_count
-    run_tests
-    cleanup
-    end_tests
-}
-
-if {[catch main e]} {
-    puts $::errorInfo
-    cleanup
-    exit 1
-}
diff --git a/redis-stable/tests/sentinel/tests/00-base.tcl b/redis-stable/tests/sentinel/tests/00-base.tcl
deleted file mode 100644
index a1bbb278..00000000
--- a/redis-stable/tests/sentinel/tests/00-base.tcl
+++ /dev/null
@@ -1,126 +0,0 @@
-# Check the basic monitoring and failover capabilities.
-source "../tests/includes/start-init-tests.tcl"
-source "../tests/includes/init-tests.tcl"
-
-if {$::simulate_error} {
-    test "This test will fail" {
-        fail "Simulated error"
-    }
-}
-
-test "Basic failover works if the master is down" {
-    set old_port [RPort $master_id]
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-    kill_instance redis $master_id
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-        } else {
-            fail "At least one Sentinel did not receive failover info"
-        }
-    }
-    restart_instance redis $master_id
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
-}
-
-test "New master [join $addr {:}] role matches" {
-    assert {[RI $master_id role] eq {master}}
-}
-
-test "All the other slaves now point to the new master" {
-    foreach_redis_id id {
-        if {$id != $master_id && $id != 0} {
-            wait_for_condition 1000 50 {
-                [RI $id master_port] == [lindex $addr 1]
-            } else {
-                fail "Redis ID $id not configured to replicate with new master"
-            }
-        }
-    }
-}
-
-test "The old master eventually gets reconfigured as a slave" {
-    wait_for_condition 1000 50 {
-        [RI 0 master_port] == [lindex $addr 1]
-    } else {
-        fail "Old master not reconfigured as slave of new master"
-    }
-}
-
-test "ODOWN is not possible without N (quorum) Sentinels reports" {
-    foreach_sentinel_id id {
-        S $id SENTINEL SET mymaster quorum [expr $sentinels+1]
-    }
-    set old_port [RPort $master_id]
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-    kill_instance redis $master_id
-
-    # Make sure failover did not happened.
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-    restart_instance redis $master_id
-}
-
-test "Failover is not possible without majority agreement" {
-    foreach_sentinel_id id {
-        S $id SENTINEL SET mymaster quorum $quorum
-    }
-
-    # Crash majority of sentinels
-    for {set id 0} {$id < $quorum} {incr id} {
-        kill_instance sentinel $id
-    }
-
-    # Kill the current master
-    kill_instance redis $master_id
-
-    # Make sure failover did not happened.
-    set addr [S $quorum SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-    restart_instance redis $master_id
-
-    # Cleanup: restart Sentinels to monitor the master.
-    for {set id 0} {$id < $quorum} {incr id} {
-        restart_instance sentinel $id
-    }
-}
-
-test "Failover works if we configure for absolute agreement" {
-    foreach_sentinel_id id {
-        S $id SENTINEL SET mymaster quorum $sentinels
-    }
-
-    # Wait for Sentinels to monitor the master again
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [dict get [S $id SENTINEL MASTER mymaster] info-refresh] < 100000
-        } else {
-            fail "At least one Sentinel is not monitoring the master"
-        }
-    }
-
-    kill_instance redis $master_id
-
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-        } else {
-            fail "At least one Sentinel did not receive failover info"
-        }
-    }
-    restart_instance redis $master_id
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
-
-    # Set the min ODOWN agreement back to strict majority.
-    foreach_sentinel_id id {
-        S $id SENTINEL SET mymaster quorum $quorum
-    }
-}
-
-test "New master [join $addr {:}] role matches" {
-    assert {[RI $master_id role] eq {master}}
-}
diff --git a/redis-stable/tests/sentinel/tests/01-conf-update.tcl b/redis-stable/tests/sentinel/tests/01-conf-update.tcl
deleted file mode 100644
index 5dca5560..00000000
--- a/redis-stable/tests/sentinel/tests/01-conf-update.tcl
+++ /dev/null
@@ -1,39 +0,0 @@
-# Test Sentinel configuration consistency after partitions heal.
-
-source "../tests/includes/init-tests.tcl"
-
-test "We can failover with Sentinel 1 crashed" {
-    set old_port [RPort $master_id]
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-
-    # Crash Sentinel 1
-    kill_instance sentinel 1
-
-    kill_instance redis $master_id
-    foreach_sentinel_id id {
-        if {$id != 1} {
-            wait_for_condition 1000 50 {
-                [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-            } else {
-                fail "Sentinel $id did not receive failover info"
-            }
-        }
-    }
-    restart_instance redis $master_id
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
-}
-
-test "After Sentinel 1 is restarted, its config gets updated" {
-    restart_instance sentinel 1
-    wait_for_condition 1000 50 {
-        [lindex [S 1 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-    } else {
-        fail "Restarted Sentinel did not receive failover info"
-    }
-}
-
-test "New master [join $addr {:}] role matches" {
-    assert {[RI $master_id role] eq {master}}
-}
diff --git a/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl b/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
deleted file mode 100644
index 9edf775e..00000000
--- a/redis-stable/tests/sentinel/tests/02-slaves-reconf.tcl
+++ /dev/null
@@ -1,84 +0,0 @@
-# Check that slaves are reconfigured at a latter time if they are partitioned.
-#
-# Here we should test:
-# 1) That slaves point to the new master after failover.
-# 2) That partitioned slaves point to new master when they are partitioned
-#    away during failover and return at a latter time.
-
-source "../tests/includes/init-tests.tcl"
-
-proc 02_test_slaves_replication {} {
-    uplevel 1 {
-        test "Check that slaves replicate from current master" {
-            set master_port [RPort $master_id]
-            foreach_redis_id id {
-                if {$id == $master_id} continue
-                if {[instance_is_killed redis $id]} continue
-                wait_for_condition 1000 50 {
-                    ([RI $id master_port] == $master_port) &&
-                    ([RI $id master_link_status] eq {up})
-                } else {
-                    fail "Redis slave $id is replicating from wrong master"
-                }
-            }
-        }
-    }
-}
-
-proc 02_crash_and_failover {} {
-    uplevel 1 {
-        test "Crash the master and force a failover" {
-            set old_port [RPort $master_id]
-            set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-            assert {[lindex $addr 1] == $old_port}
-            kill_instance redis $master_id
-            foreach_sentinel_id id {
-                wait_for_condition 1000 50 {
-                    [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-                } else {
-                    fail "At least one Sentinel did not receive failover info"
-                }
-            }
-            restart_instance redis $master_id
-            set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-            set master_id [get_instance_id_by_port redis [lindex $addr 1]]
-        }
-    }
-}
-
-02_test_slaves_replication
-02_crash_and_failover
-02_test_slaves_replication
-
-test "Kill a slave instance" {
-    foreach_redis_id id {
-        if {$id == $master_id} continue
-        set killed_slave_id $id
-        kill_instance redis $id
-        break
-    }
-}
-
-02_crash_and_failover
-02_test_slaves_replication
-
-test "Wait for failover to end" {
-    set inprogress 1
-    while {$inprogress} {
-        set inprogress 0
-        foreach_sentinel_id id {
-            if {[dict exists [S $id SENTINEL MASTER mymaster] failover-state]} {
-                incr inprogress
-            }
-        }
-        if {$inprogress} {after 100}
-    }
-}
-
-test "Restart killed slave and test replication of slaves again..." {
-    restart_instance redis $killed_slave_id
-}
-
-# Now we check if the slave rejoining the partition is reconfigured even
-# if the failover finished.
-02_test_slaves_replication
diff --git a/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl b/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
deleted file mode 100644
index 426596c3..00000000
--- a/redis-stable/tests/sentinel/tests/03-runtime-reconf.tcl
+++ /dev/null
@@ -1 +0,0 @@
-# Test runtime reconfiguration command SENTINEL SET.
diff --git a/redis-stable/tests/sentinel/tests/04-slave-selection.tcl b/redis-stable/tests/sentinel/tests/04-slave-selection.tcl
deleted file mode 100644
index 3d2ca648..00000000
--- a/redis-stable/tests/sentinel/tests/04-slave-selection.tcl
+++ /dev/null
@@ -1,5 +0,0 @@
-# Test slave selection algorithm.
-#
-# This unit should test:
-# 1) That when there are no suitable slaves no failover is performed.
-# 2) That among the available slaves, the one with better offset is picked.
diff --git a/redis-stable/tests/sentinel/tests/05-manual.tcl b/redis-stable/tests/sentinel/tests/05-manual.tcl
deleted file mode 100644
index c97a0e53..00000000
--- a/redis-stable/tests/sentinel/tests/05-manual.tcl
+++ /dev/null
@@ -1,45 +0,0 @@
-# Test manual failover
-
-source "../tests/includes/init-tests.tcl"
-
-test "Manual failover works" {
-    set old_port [RPort $master_id]
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    assert {[lindex $addr 1] == $old_port}
-    catch {S 0 SENTINEL FAILOVER mymaster} reply
-    assert {$reply eq "OK"}
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 1] != $old_port
-        } else {
-            fail "At least one Sentinel did not receive failover info"
-        }
-    }
-    set addr [S 0 SENTINEL GET-MASTER-ADDR-BY-NAME mymaster]
-    set master_id [get_instance_id_by_port redis [lindex $addr 1]]
-}
-
-test "New master [join $addr {:}] role matches" {
-    assert {[RI $master_id role] eq {master}}
-}
-
-test "All the other slaves now point to the new master" {
-    foreach_redis_id id {
-        if {$id != $master_id && $id != 0} {
-            wait_for_condition 1000 50 {
-                [RI $id master_port] == [lindex $addr 1]
-            } else {
-                fail "Redis ID $id not configured to replicate with new master"
-            }
-        }
-    }
-}
-
-test "The old master eventually gets reconfigured as a slave" {
-    wait_for_condition 1000 50 {
-        [RI 0 master_port] == [lindex $addr 1]
-    } else {
-        fail "Old master not reconfigured as slave of new master"
-    }
-}
-
diff --git a/redis-stable/tests/sentinel/tests/06-ckquorum.tcl b/redis-stable/tests/sentinel/tests/06-ckquorum.tcl
deleted file mode 100644
index 4ea4e55d..00000000
--- a/redis-stable/tests/sentinel/tests/06-ckquorum.tcl
+++ /dev/null
@@ -1,35 +0,0 @@
-# Test for the SENTINEL CKQUORUM command
-
-source "../tests/includes/init-tests.tcl"
-set num_sentinels [llength $::sentinel_instances]
-
-test "CKQUORUM reports OK and the right amount of Sentinels" {
-    foreach_sentinel_id id {
-        assert_match "*OK $num_sentinels usable*" [S $id SENTINEL CKQUORUM mymaster]
-    }
-}
-
-test "CKQUORUM detects quorum cannot be reached" {
-    set orig_quorum [expr {$num_sentinels/2+1}]
-    S 0 SENTINEL SET mymaster quorum [expr {$num_sentinels+1}]
-    catch {[S 0 SENTINEL CKQUORUM mymaster]} err
-    assert_match "*NOQUORUM*" $err
-    S 0 SENTINEL SET mymaster quorum $orig_quorum
-}
-
-test "CKQUORUM detects failover authorization cannot be reached" {
-    set orig_quorum [expr {$num_sentinels/2+1}]
-    S 0 SENTINEL SET mymaster quorum 1
-    for {set i 0} {$i < $orig_quorum} {incr i} {
-        kill_instance sentinel [expr {$i + 1}]
-    }
-
-    after 5000
-    catch {[S 0 SENTINEL CKQUORUM mymaster]} err
-    assert_match "*NOQUORUM*" $err
-    S 0 SENTINEL SET mymaster quorum $orig_quorum
-    for {set i 0} {$i < $orig_quorum} {incr i} {
-        restart_instance sentinel [expr {$i + 1}]
-    }
-}
-
diff --git a/redis-stable/tests/sentinel/tests/07-down-conditions.tcl b/redis-stable/tests/sentinel/tests/07-down-conditions.tcl
deleted file mode 100644
index 0a696fa6..00000000
--- a/redis-stable/tests/sentinel/tests/07-down-conditions.tcl
+++ /dev/null
@@ -1,80 +0,0 @@
-# Test conditions where an instance is considered to be down
-
-source "../tests/includes/init-tests.tcl"
-source "../../../tests/support/cli.tcl"
-
-set ::alive_sentinel [expr {$::instances_count/2+2}]
-proc ensure_master_up {} {
-    wait_for_condition 1000 50 {
-        [dict get [S $::alive_sentinel sentinel master mymaster] flags] eq "master"
-    } else {
-        fail "Master flags are not just 'master'"
-    }
-}
-
-proc ensure_master_down {} {
-    wait_for_condition 1000 50 {
-        [string match *down* \
-            [dict get [S $::alive_sentinel sentinel master mymaster] flags]]
-    } else {
-        fail "Master is not flagged SDOWN"
-    }
-}
-
-test "Crash the majority of Sentinels to prevent failovers for this unit" {
-    for {set id 0} {$id < $quorum} {incr id} {
-        kill_instance sentinel $id
-    }
-}
-
-test "SDOWN is triggered by non-responding but not crashed instance" {
-    lassign [S $::alive_sentinel SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] host port
-    ensure_master_up
-    exec ../../../src/redis-cli -h $host -p $port {*}[rediscli_tls_config "../../../tests"] debug sleep 10 > /dev/null &
-    ensure_master_down
-    ensure_master_up
-}
-
-test "SDOWN is triggered by crashed instance" {
-    lassign [S $::alive_sentinel SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] host port
-    ensure_master_up
-    kill_instance redis 0
-    ensure_master_down
-    restart_instance redis 0
-    ensure_master_up
-}
-
-test "SDOWN is triggered by masters advertising as slaves" {
-    ensure_master_up
-    R 0 slaveof 127.0.0.1 34567
-    ensure_master_down
-    R 0 slaveof no one
-    ensure_master_up
-}
-
-test "SDOWN is triggered by misconfigured instance repling with errors" {
-    ensure_master_up
-    set orig_dir [lindex [R 0 config get dir] 1]
-    set orig_save [lindex [R 0 config get save] 1]
-    # Set dir to / and filename to "tmp" to make sure it will fail.
-    R 0 config set dir /
-    R 0 config set dbfilename tmp
-    R 0 config set save "1000000 1000000"
-    R 0 bgsave
-    ensure_master_down
-    R 0 config set save $orig_save
-    R 0 config set dir $orig_dir
-    R 0 config set dbfilename dump.rdb
-    R 0 bgsave
-    ensure_master_up
-}
-
-# We use this test setup to also test command renaming, as a side
-# effect of the master going down if we send PONG instead of PING
-test "SDOWN is triggered if we rename PING to PONG" {
-    ensure_master_up
-    S $::alive_sentinel SENTINEL SET mymaster rename-command PING PONG
-    ensure_master_down
-    S $::alive_sentinel SENTINEL SET mymaster rename-command PING PING
-    ensure_master_up
-}
diff --git a/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl b/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
deleted file mode 100644
index be6e42cb..00000000
--- a/redis-stable/tests/sentinel/tests/08-hostname-conf.tcl
+++ /dev/null
@@ -1,67 +0,0 @@
-proc set_redis_announce_ip {addr} {
-    foreach_redis_id id {
-        R $id config set replica-announce-ip $addr
-    }
-}
-
-proc set_sentinel_config {keyword value} {
-    foreach_sentinel_id id {
-        S $id sentinel config set $keyword $value
-    }
-}
-
-proc set_all_instances_hostname {hostname} {
-    foreach_sentinel_id id {
-        set_instance_attrib sentinel $id host $hostname
-    }
-    foreach_redis_id id {
-        set_instance_attrib redis $id host $hostname
-    }
-}
-
-test "(pre-init) Configure instances and sentinel for hostname use" {
-    set ::host "localhost"
-    restart_killed_instances
-    set_all_instances_hostname $::host
-    set_redis_announce_ip $::host
-    set_sentinel_config resolve-hostnames yes
-    set_sentinel_config announce-hostnames yes
-}
-
-source "../tests/includes/init-tests.tcl"
-
-proc verify_hostname_announced {hostname} {
-    foreach_sentinel_id id {
-        # Master is reported with its hostname
-        if {![string equal [lindex [S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster] 0] $hostname]} {
-            return 0
-        }
-
-        # Replicas are reported with their hostnames
-        foreach replica [S $id SENTINEL REPLICAS mymaster] {
-            if {![string equal [dict get $replica ip] $hostname]} {
-                return 0
-            }
-        }
-    }
-    return 1
-}
-
-test "Sentinel announces hostnames" {
-    # Check initial state
-    verify_hostname_announced $::host
-
-    # Disable announce-hostnames and confirm IPs are used
-    set_sentinel_config announce-hostnames no
-    assert {[verify_hostname_announced "127.0.0.1"] || [verify_hostname_announced "::1"]}
-}
-
-# We need to revert any special configuration because all tests currently
-# share the same instances.
-test "(post-cleanup) Configure instances and sentinel for IPs" {
-    set ::host "127.0.0.1"
-    set_all_instances_hostname $::host
-    set_redis_announce_ip $::host
-    set_sentinel_config resolve-hostnames no
-    set_sentinel_config announce-hostnames no
-}
\ No newline at end of file
diff --git a/redis-stable/tests/sentinel/tests/09-acl-support.tcl b/redis-stable/tests/sentinel/tests/09-acl-support.tcl
deleted file mode 100644
index 1366fc4d..00000000
--- a/redis-stable/tests/sentinel/tests/09-acl-support.tcl
+++ /dev/null
@@ -1,50 +0,0 @@
-
-source "../tests/includes/init-tests.tcl"
-
-set ::user "testuser"
-set ::password "secret"
-
-proc setup_acl {} {
-    foreach_sentinel_id id {
-        assert_equal {OK} [S $id ACL SETUSER $::user >$::password +@all on]
-        assert_equal {OK} [S $id ACL SETUSER default off]
-
-        S $id CLIENT KILL USER default SKIPME no
-        assert_equal {OK} [S $id AUTH $::user $::password]
-    }
-}
-
-proc teardown_acl {} {
-    foreach_sentinel_id id {
-        assert_equal {OK} [S $id ACL SETUSER default on]
-        assert_equal {1} [S $id ACL DELUSER $::user]
-
-        S $id SENTINEL CONFIG SET sentinel-user ""
-        S $id SENTINEL CONFIG SET sentinel-pass ""
-    }
-}
-
-test "(post-init) Set up ACL configuration" {
-    setup_acl
-    assert_equal $::user [S 1 ACL WHOAMI]
-}
-
-test "SENTINEL CONFIG SET handles on-the-fly credentials reconfiguration" {
-    # Make sure we're starting with a broken state...
-    after 5000
-    catch {S 1 SENTINEL CKQUORUM mymaster} err
-    assert_match {*NOQUORUM*} $err
-
-    foreach_sentinel_id id {
-        assert_equal {OK} [S $id SENTINEL CONFIG SET sentinel-user $::user]
-        assert_equal {OK} [S $id SENTINEL CONFIG SET sentinel-pass $::password]
-    }
-
-    after 5000
-    assert_match {*OK*} [S 1 SENTINEL CKQUORUM mymaster]
-}
-
-test "(post-cleanup) Tear down ACL configuration" {
-    teardown_acl
-}
-
diff --git a/redis-stable/tests/sentinel/tests/10-replica-priority.tcl b/redis-stable/tests/sentinel/tests/10-replica-priority.tcl
deleted file mode 100644
index 00248a73..00000000
--- a/redis-stable/tests/sentinel/tests/10-replica-priority.tcl
+++ /dev/null
@@ -1,73 +0,0 @@
-source "../tests/includes/init-tests.tcl"
-
-test "Check acceptable replica-priority values" {
-    foreach_redis_id id {
-        if {$id == $master_id} continue
-
-        # ensure replica-announced accepts yes and no
-        catch {R $id CONFIG SET replica-announced no} e
-        if {$e ne "OK"} {
-            fail "Unable to set replica-announced to no"
-        }
-        catch {R $id CONFIG SET replica-announced yes} e
-        if {$e ne "OK"} {
-            fail "Unable to set replica-announced to yes"
-        }
-
-        # ensure a random value throw error
-        catch {R $id CONFIG SET replica-announced 321} e
-        if {$e eq "OK"} {
-            fail "Able to set replica-announced with something else than yes or no (321) whereas it should not be possible"
-        }
-        catch {R $id CONFIG SET replica-announced a3b2c1} e
-        if {$e eq "OK"} {
-            fail "Able to set replica-announced with something else than yes or no (a3b2c1) whereas it should not be possible"
-        }
-
-        # test only the first redis replica, no need to double test
-        break
-    }
-}
-
-proc 10_test_number_of_replicas {n_replicas_expected} {
-    test "Check sentinel replies with $n_replicas_expected replicas" {
-        # ensure sentinels replies with the right number of replicas
-        foreach_sentinel_id id {
-            # retries 40 x 500ms = 20s as SENTINEL_INFO_PERIOD = 10s
-            set len [llength [S $id SENTINEL REPLICAS mymaster]]
-            wait_for_condition 40 500 {
-                [llength [S $id SENTINEL REPLICAS mymaster]] == $n_replicas_expected
-            } else {
-                fail "Sentinel replies with a wrong number of replicas with replica-announced=yes (expected $n_replicas_expected but got $len) on sentinel $id"
-            }
-        }
-    }
-}
-
-proc 10_set_replica_announced {master_id announced n_replicas} {
-    test "Set replica-announced=$announced on $n_replicas replicas" {
-        set i 0
-        foreach_redis_id id {
-            if {$id == $master_id} continue
-            #puts "set replica-announce=$announced on redis #$id"
-            R $id CONFIG SET replica-announced "$announced"
-            incr i
-            if { $n_replicas!="all" && $i >= $n_replicas } { break }
-        }
-    }
-}
-
-# ensure all replicas are announced
-10_set_replica_announced $master_id "yes" "all"
-# ensure all replicas are announced by sentinels
-10_test_number_of_replicas 4
-
-# ensure the first 2 replicas are not announced
-10_set_replica_announced $master_id "no" 2
-# ensure sentinels are not announcing the first 2 replicas that have been set unannounced
-10_test_number_of_replicas 2
-
-# ensure all replicas are announced
-10_set_replica_announced $master_id "yes" "all"
-# ensure all replicas are not announced by sentinels
-10_test_number_of_replicas 4
diff --git a/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl b/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
deleted file mode 100755
index 482b3e0d..00000000
--- a/redis-stable/tests/sentinel/tests/helpers/check_leaked_fds.tcl
+++ /dev/null
@@ -1,79 +0,0 @@
-#!/usr/bin/env tclsh
-#
-# This script detects file descriptors that have leaked from a parent process.
-#
-# Our goal is to detect file descriptors that were opened by the parent and
-# not cleaned up prior to exec(), but not file descriptors that were inherited
-# from the grandparent which the parent knows nothing about. To do that, we
-# look up every potential leak and try to match it against open files by the
-# grandparent process.
-
-# Get PID of parent process
-proc get_parent_pid {_pid} {
-    set fd [open "/proc/$_pid/status" "r"]
-    set content [read $fd]
-    close $fd
-
-    if {[regexp {\nPPid:\s+(\d+)} $content _ ppid]} {
-        return $ppid
-    }
-
-    error "failed to get parent pid"
-}
-
-# Read symlink to get info about the specified fd of the specified process.
-# The result can be the file name or an arbitrary string that identifies it.
-# When not able to read, an empty string is returned.
-proc get_fdlink {_pid fd} {
-    if { [catch {set fdlink [file readlink "/proc/$_pid/fd/$fd"]} err] } {
-        return ""
-    }
-    return $fdlink
-}
-
-# Linux only
-set os [exec uname]
-if {$os != "Linux"} {
-    puts "Only Linux is supported."
-    exit 0
-}
-
-if {![info exists env(LEAKED_FDS_FILE)]} {
-    puts "Missing LEAKED_FDS_FILE environment variable."
-    exit 0
-}
-
-set outfile $::env(LEAKED_FDS_FILE)
-set parent_pid [get_parent_pid [pid]]
-set grandparent_pid [get_parent_pid $parent_pid]
-set leaked_fds {}
-
-# Look for fds that were directly inherited from our parent but not from
-# our grandparent (tcl)
-foreach fd [glob -tails -directory "/proc/self/fd" *] {
-    # Ignore stdin/stdout/stderr
-    if {$fd == 0 || $fd == 1 || $fd == 2} {
-        continue
-    }
-
-    set fdlink [get_fdlink "self" $fd]
-    if {$fdlink == ""} {
-        continue
-    }
-
-    # We ignore fds that existed in the grandparent, or fds that don't exist
-    # in our parent (Sentinel process).
-    if {[get_fdlink $grandparent_pid $fd] == $fdlink ||
-	[get_fdlink $parent_pid $fd] != $fdlink} {
-        continue
-    }
-
-    lappend leaked_fds [list $fd $fdlink]
-}
-
-# Produce report only if we found leaks
-if {[llength $leaked_fds] > 0} {
-    set fd [open $outfile "w"]
-    puts $fd [join $leaked_fds "\n"]
-    close $fd
-}
diff --git a/redis-stable/tests/sentinel/tests/includes/init-tests.tcl b/redis-stable/tests/sentinel/tests/includes/init-tests.tcl
deleted file mode 100644
index b5baa256..00000000
--- a/redis-stable/tests/sentinel/tests/includes/init-tests.tcl
+++ /dev/null
@@ -1,80 +0,0 @@
-# Initialization tests -- most units will start including this.
-
-proc restart_killed_instances {} {
-    foreach type {redis sentinel} {
-        foreach_${type}_id id {
-            if {[get_instance_attrib $type $id pid] == -1} {
-                puts -nonewline "$type/$id "
-                flush stdout
-                restart_instance $type $id
-            }
-        }
-    }
-}
-
-test "(init) Restart killed instances" {
-    restart_killed_instances
-}
-
-test "(init) Remove old master entry from sentinels" {
-    foreach_sentinel_id id {
-        catch {S $id SENTINEL REMOVE mymaster}
-    }
-}
-
-set redis_slaves [expr $::instances_count - 1]
-test "(init) Create a master-slaves cluster of [expr $redis_slaves+1] instances" {
-    create_redis_master_slave_cluster [expr {$redis_slaves+1}]
-}
-set master_id 0
-
-test "(init) Sentinels can start monitoring a master" {
-    set sentinels [llength $::sentinel_instances]
-    set quorum [expr {$sentinels/2+1}]
-    foreach_sentinel_id id {
-        S $id SENTINEL MONITOR mymaster \
-              [get_instance_attrib redis $master_id host] \
-              [get_instance_attrib redis $master_id port] $quorum
-    }
-    foreach_sentinel_id id {
-        assert {[S $id sentinel master mymaster] ne {}}
-        S $id SENTINEL SET mymaster down-after-milliseconds 2000
-        S $id SENTINEL SET mymaster failover-timeout 20000
-        S $id SENTINEL SET mymaster parallel-syncs 10
-        if {$::leaked_fds_file != "" && [exec uname] == "Linux"} {
-            S $id SENTINEL SET mymaster notification-script ../../tests/helpers/check_leaked_fds.tcl
-            S $id SENTINEL SET mymaster client-reconfig-script ../../tests/helpers/check_leaked_fds.tcl
-        }
-    }
-}
-
-test "(init) Sentinels can talk with the master" {
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [catch {S $id SENTINEL GET-MASTER-ADDR-BY-NAME mymaster}] == 0
-        } else {
-            fail "Sentinel $id can't talk with the master."
-        }
-    }
-}
-
-test "(init) Sentinels are able to auto-discover other sentinels" {
-    set sentinels [llength $::sentinel_instances]
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [dict get [S $id SENTINEL MASTER mymaster] num-other-sentinels] == ($sentinels-1)
-        } else {
-            fail "At least some sentinel can't detect some other sentinel"
-        }
-    }
-}
-
-test "(init) Sentinels are able to auto-discover slaves" {
-    foreach_sentinel_id id {
-        wait_for_condition 1000 50 {
-            [dict get [S $id SENTINEL MASTER mymaster] num-slaves] == $redis_slaves
-        } else {
-            fail "At least some sentinel can't detect some slave"
-        }
-    }
-}
diff --git a/redis-stable/tests/sentinel/tests/includes/sentinel.conf b/redis-stable/tests/sentinel/tests/includes/sentinel.conf
deleted file mode 100644
index 94f2804a..00000000
--- a/redis-stable/tests/sentinel/tests/includes/sentinel.conf
+++ /dev/null
@@ -1,11 +0,0 @@
-# assume master is down after being unresponsive for 20s
-sentinel down-after-milliseconds setmaster 20000
-# reconfigure one slave at a time
-sentinel parallel-syncs setmaster 2
-# wait for 4m before assuming failover went wrong
-sentinel failover-timeout setmaster 240000
-# monitoring set
-sentinel monitor setmaster 10.0.0.1 30000 2
-
-
-
diff --git a/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl b/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
deleted file mode 100644
index b0523506..00000000
--- a/redis-stable/tests/sentinel/tests/includes/start-init-tests.tcl
+++ /dev/null
@@ -1,18 +0,0 @@
-test "(start-init) Flush config and compare rewrite config file lines" {
-    foreach_sentinel_id id {
-        assert_match "OK" [S $id SENTINEL FLUSHCONFIG]
-        set file1 ../tests/includes/sentinel.conf
-        set file2 [file join "sentinel_${id}" "sentinel.conf"] 
-        set fh1 [open $file1 r]
-        set fh2 [open $file2 r]
-        while {[gets $fh1 line1]} {
-            if {[gets $fh2 line2]} {
-                assert [string equal $line1 $line2]
-            } else {
-                fail "sentinel config file rewrite sequence changed"
-            }
-        }
-        close $fh1
-        close $fh2  
-    }
-}
\ No newline at end of file
diff --git a/redis-stable/tests/sentinel/tmp/.gitignore b/redis-stable/tests/sentinel/tmp/.gitignore
deleted file mode 100644
index f581f73e..00000000
--- a/redis-stable/tests/sentinel/tmp/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-redis_*
-sentinel_*
diff --git a/redis-stable/tests/support/benchmark.tcl b/redis-stable/tests/support/benchmark.tcl
deleted file mode 100644
index 3d08b76f..00000000
--- a/redis-stable/tests/support/benchmark.tcl
+++ /dev/null
@@ -1,19 +0,0 @@
-proc redisbenchmark_tls_config {testsdir} {
-    set tlsdir [file join $testsdir tls]
-    set cert [file join $tlsdir client.crt]
-    set key [file join $tlsdir client.key]
-    set cacert [file join $tlsdir ca.crt]
-
-    if {$::tls} {
-        return [list --tls --cert $cert --key $key --cacert $cacert]
-    } else {
-        return {}
-    }
-}
-
-proc redisbenchmark {host port {opts {}}} {
-    set cmd [list src/redis-benchmark -h $host -p $port]
-    lappend cmd {*}[redisbenchmark_tls_config "tests"]
-    lappend cmd {*}$opts
-    return $cmd
-}
diff --git a/redis-stable/tests/support/cli.tcl b/redis-stable/tests/support/cli.tcl
deleted file mode 100644
index 19e306e2..00000000
--- a/redis-stable/tests/support/cli.tcl
+++ /dev/null
@@ -1,19 +0,0 @@
-proc rediscli_tls_config {testsdir} {
-    set tlsdir [file join $testsdir tls]
-    set cert [file join $tlsdir client.crt]
-    set key [file join $tlsdir client.key]
-    set cacert [file join $tlsdir ca.crt]
-
-    if {$::tls} {
-        return [list --tls --cert $cert --key $key --cacert $cacert]
-    } else {
-        return {}
-    }
-}
-
-proc rediscli {host port {opts {}}} {
-    set cmd [list src/redis-cli -h $host -p $port]
-    lappend cmd {*}[rediscli_tls_config "tests"]
-    lappend cmd {*}$opts
-    return $cmd
-}
diff --git a/redis-stable/tests/support/cluster.tcl b/redis-stable/tests/support/cluster.tcl
deleted file mode 100644
index df4b7f3d..00000000
--- a/redis-stable/tests/support/cluster.tcl
+++ /dev/null
@@ -1,363 +0,0 @@
-# Tcl redis cluster client as a wrapper of redis.rb.
-# Copyright (C) 2014 Salvatore Sanfilippo
-# Released under the BSD license like Redis itself
-#
-# Example usage:
-#
-# set c [redis_cluster {127.0.0.1:6379 127.0.0.1:6380}]
-# $c set foo
-# $c get foo
-# $c close
-
-package require Tcl 8.5
-package provide redis_cluster 0.1
-
-namespace eval redis_cluster {}
-set ::redis_cluster::id 0
-array set ::redis_cluster::startup_nodes {}
-array set ::redis_cluster::nodes {}
-array set ::redis_cluster::slots {}
-array set ::redis_cluster::tls {}
-
-# List of "plain" commands, which are commands where the sole key is always
-# the first argument.
-set ::redis_cluster::plain_commands {
-    get set setnx setex psetex append strlen exists setbit getbit
-    setrange getrange substr incr decr rpush lpush rpushx lpushx
-    linsert rpop lpop brpop llen lindex lset lrange ltrim lrem
-    sadd srem sismember smismember scard spop srandmember smembers sscan zadd
-    zincrby zrem zremrangebyscore zremrangebyrank zremrangebylex zrange
-    zrangebyscore zrevrangebyscore zrangebylex zrevrangebylex zcount
-    zlexcount zrevrange zcard zscore zmscore zrank zrevrank zscan hset hsetnx
-    hget hmset hmget hincrby hincrbyfloat hdel hlen hkeys hvals
-    hgetall hexists hscan incrby decrby incrbyfloat getset move
-    expire expireat pexpire pexpireat type ttl pttl persist restore
-    dump bitcount bitpos pfadd pfcount
-}
-
-# Create a cluster client. The nodes are given as a list of host:port. The TLS
-# parameter (1 or 0) is optional and defaults to the global $::tls.
-proc redis_cluster {nodes {tls -1}} {
-    set id [incr ::redis_cluster::id]
-    set ::redis_cluster::startup_nodes($id) $nodes
-    set ::redis_cluster::nodes($id) {}
-    set ::redis_cluster::slots($id) {}
-    set ::redis_cluster::tls($id) [expr $tls == -1 ? $::tls : $tls]
-    set handle [interp alias {} ::redis_cluster::instance$id {} ::redis_cluster::__dispatch__ $id]
-    $handle refresh_nodes_map
-    return $handle
-}
-
-# Totally reset the slots / nodes state for the client, calls
-# CLUSTER NODES in the first startup node available, populates the
-# list of nodes ::redis_cluster::nodes($id) with an hash mapping node
-# ip:port to a representation of the node (another hash), and finally
-# maps ::redis_cluster::slots($id) with an hash mapping slot numbers
-# to node IDs.
-#
-# This function is called when a new Redis Cluster client is initialized
-# and every time we get a -MOVED redirection error.
-proc ::redis_cluster::__method__refresh_nodes_map {id} {
-    # Contact the first responding startup node.
-    set idx 0; # Index of the node that will respond.
-    set errmsg {}
-    foreach start_node $::redis_cluster::startup_nodes($id) {
-        set ip_port [lindex [split $start_node @] 0]
-        lassign [split $ip_port :] start_host start_port
-        set tls $::redis_cluster::tls($id)
-        if {[catch {
-            set r {}
-            set r [redis $start_host $start_port 0 $tls]
-            set nodes_descr [$r cluster nodes]
-            $r close
-        } e]} {
-            if {$r ne {}} {catch {$r close}}
-            incr idx
-            if {[string length $errmsg] < 200} {
-                append errmsg " $ip_port: $e"
-            }
-            continue ; # Try next.
-        } else {
-            break; # Good node found.
-        }
-    }
-
-    if {$idx == [llength $::redis_cluster::startup_nodes($id)]} {
-        error "No good startup node found. $errmsg"
-    }
-
-    # Put the node that responded as first in the list if it is not
-    # already the first.
-    if {$idx != 0} {
-        set l $::redis_cluster::startup_nodes($id)
-        set left [lrange $l 0 [expr {$idx-1}]]
-        set right [lrange $l [expr {$idx+1}] end]
-        set l [concat [lindex $l $idx] $left $right]
-        set ::redis_cluster::startup_nodes($id) $l
-    }
-
-    # Parse CLUSTER NODES output to populate the nodes description.
-    set nodes {} ; # addr -> node description hash.
-    foreach line [split $nodes_descr "\n"] {
-        set line [string trim $line]
-        if {$line eq {}} continue
-        set args [split $line " "]
-        lassign $args nodeid addr flags slaveof pingsent pongrecv configepoch linkstate
-        set slots [lrange $args 8 end]
-        set addr [lindex [split $addr @] 0]
-        if {$addr eq {:0}} {
-            set addr $start_host:$start_port
-        }
-        lassign [split $addr :] host port
-
-        # Connect to the node
-        set link {}
-        set tls $::redis_cluster::tls($id)
-        catch {set link [redis $host $port 0 $tls]}
-
-        # Build this node description as an hash.
-        set node [dict create \
-            id $nodeid \
-            addr $addr \
-            host $host \
-            port $port \
-            flags $flags \
-            slaveof $slaveof \
-            slots $slots \
-            link $link \
-        ]
-        dict set nodes $addr $node
-        lappend ::redis_cluster::startup_nodes($id) $addr
-    }
-
-    # Close all the existing links in the old nodes map, and set the new
-    # map as current.
-    foreach n $::redis_cluster::nodes($id) {
-        catch {
-            [dict get $n link] close
-        }
-    }
-    set ::redis_cluster::nodes($id) $nodes
-
-    # Populates the slots -> nodes map.
-    dict for {addr node} $nodes {
-        foreach slotrange [dict get $node slots] {
-            lassign [split $slotrange -] start end
-            if {$end == {}} {set end $start}
-            for {set j $start} {$j <= $end} {incr j} {
-                dict set ::redis_cluster::slots($id) $j $addr
-            }
-        }
-    }
-
-    # Only retain unique entries in the startup nodes list
-    set ::redis_cluster::startup_nodes($id) [lsort -unique $::redis_cluster::startup_nodes($id)]
-}
-
-# Free a redis_cluster handle.
-proc ::redis_cluster::__method__close {id} {
-    catch {
-        set nodes $::redis_cluster::nodes($id)
-        dict for {addr node} $nodes {
-            catch {
-                [dict get $node link] close
-            }
-        }
-    }
-    catch {unset ::redis_cluster::startup_nodes($id)}
-    catch {unset ::redis_cluster::nodes($id)}
-    catch {unset ::redis_cluster::slots($id)}
-    catch {unset ::redis_cluster::tls($id)}
-    catch {interp alias {} ::redis_cluster::instance$id {}}
-}
-
-proc ::redis_cluster::__method__masternode_for_slot {id slot} {
-    # Get the node mapped to this slot.
-    set node_addr [dict get $::redis_cluster::slots($id) $slot]
-    if {$node_addr eq {}} {
-        error "No mapped node for slot $slot."
-    }
-    return [dict get $::redis_cluster::nodes($id) $node_addr]
-}
-
-proc ::redis_cluster::__method__masternode_notfor_slot {id slot} {
-    # Get a node that is not mapped to this slot.
-    set node_addr [dict get $::redis_cluster::slots($id) $slot]
-    set addrs [dict keys $::redis_cluster::nodes($id)]
-    foreach addr [lshuffle $addrs] {
-        set node [dict get $::redis_cluster::nodes($id) $addr]
-        if {$node_addr ne $addr && [dict get $node slaveof] eq "-"} {
-            return $node
-        }
-    }
-    error "Slot $slot is everywhere"
-}
-
-proc ::redis_cluster::__dispatch__ {id method args} {
-    if {[info command ::redis_cluster::__method__$method] eq {}} {
-        # Get the keys from the command.
-        set keys [::redis_cluster::get_keys_from_command $method $args]
-        if {$keys eq {}} {
-            error "Redis command '$method' is not supported by redis_cluster."
-        }
-
-        # Resolve the keys in the corresponding hash slot they hash to.
-        set slot [::redis_cluster::get_slot_from_keys $keys]
-        if {$slot eq {}} {
-            error "Invalid command: multiple keys not hashing to the same slot."
-        }
-
-        # Get the node mapped to this slot.
-        set node_addr [dict get $::redis_cluster::slots($id) $slot]
-        if {$node_addr eq {}} {
-            error "No mapped node for slot $slot."
-        }
-
-        # Execute the command in the node we think is the slot owner.
-        set retry 100
-        set asking 0
-        while {[incr retry -1]} {
-            if {$retry < 5} {after 100}
-            set node [dict get $::redis_cluster::nodes($id) $node_addr]
-            set link [dict get $node link]
-            if {$asking} {
-                $link ASKING
-                set asking 0
-            }
-            if {[catch {$link $method {*}$args} e]} {
-                if {$link eq {} || \
-                    [string range $e 0 4] eq {MOVED} || \
-                    [string range $e 0 2] eq {I/O} \
-                } {
-                    # MOVED redirection.
-                    ::redis_cluster::__method__refresh_nodes_map $id
-                    set node_addr [dict get $::redis_cluster::slots($id) $slot]
-                    continue
-                } elseif {[string range $e 0 2] eq {ASK}} {
-                    # ASK redirection.
-                    set node_addr [lindex $e 2]
-                    set asking 1
-                    continue
-                } else {
-                    # Non redirecting error.
-                    error $e $::errorInfo $::errorCode
-                }
-            } else {
-                # OK query went fine
-                return $e
-            }
-        }
-        error "Too many redirections or failures contacting Redis Cluster."
-    } else {
-        uplevel 1 [list ::redis_cluster::__method__$method $id] $args
-    }
-}
-
-proc ::redis_cluster::get_keys_from_command {cmd argv} {
-    set cmd [string tolower $cmd]
-    # Most Redis commands get just one key as first argument.
-    if {[lsearch -exact $::redis_cluster::plain_commands $cmd] != -1} {
-        return [list [lindex $argv 0]]
-    }
-
-    # Special handling for other commands
-    switch -exact $cmd {
-        mget {return $argv}
-        eval {return [lrange $argv 2 1+[lindex $argv 1]]}
-        evalsha {return [lrange $argv 2 1+[lindex $argv 1]]}
-    }
-
-    # All the remaining commands are not handled.
-    return {}
-}
-
-# Returns the CRC16 of the specified string.
-# The CRC parameters are described in the Redis Cluster specification.
-set ::redis_cluster::XMODEMCRC16Lookup {
-    0x0000 0x1021 0x2042 0x3063 0x4084 0x50a5 0x60c6 0x70e7
-    0x8108 0x9129 0xa14a 0xb16b 0xc18c 0xd1ad 0xe1ce 0xf1ef
-    0x1231 0x0210 0x3273 0x2252 0x52b5 0x4294 0x72f7 0x62d6
-    0x9339 0x8318 0xb37b 0xa35a 0xd3bd 0xc39c 0xf3ff 0xe3de
-    0x2462 0x3443 0x0420 0x1401 0x64e6 0x74c7 0x44a4 0x5485
-    0xa56a 0xb54b 0x8528 0x9509 0xe5ee 0xf5cf 0xc5ac 0xd58d
-    0x3653 0x2672 0x1611 0x0630 0x76d7 0x66f6 0x5695 0x46b4
-    0xb75b 0xa77a 0x9719 0x8738 0xf7df 0xe7fe 0xd79d 0xc7bc
-    0x48c4 0x58e5 0x6886 0x78a7 0x0840 0x1861 0x2802 0x3823
-    0xc9cc 0xd9ed 0xe98e 0xf9af 0x8948 0x9969 0xa90a 0xb92b
-    0x5af5 0x4ad4 0x7ab7 0x6a96 0x1a71 0x0a50 0x3a33 0x2a12
-    0xdbfd 0xcbdc 0xfbbf 0xeb9e 0x9b79 0x8b58 0xbb3b 0xab1a
-    0x6ca6 0x7c87 0x4ce4 0x5cc5 0x2c22 0x3c03 0x0c60 0x1c41
-    0xedae 0xfd8f 0xcdec 0xddcd 0xad2a 0xbd0b 0x8d68 0x9d49
-    0x7e97 0x6eb6 0x5ed5 0x4ef4 0x3e13 0x2e32 0x1e51 0x0e70
-    0xff9f 0xefbe 0xdfdd 0xcffc 0xbf1b 0xaf3a 0x9f59 0x8f78
-    0x9188 0x81a9 0xb1ca 0xa1eb 0xd10c 0xc12d 0xf14e 0xe16f
-    0x1080 0x00a1 0x30c2 0x20e3 0x5004 0x4025 0x7046 0x6067
-    0x83b9 0x9398 0xa3fb 0xb3da 0xc33d 0xd31c 0xe37f 0xf35e
-    0x02b1 0x1290 0x22f3 0x32d2 0x4235 0x5214 0x6277 0x7256
-    0xb5ea 0xa5cb 0x95a8 0x8589 0xf56e 0xe54f 0xd52c 0xc50d
-    0x34e2 0x24c3 0x14a0 0x0481 0x7466 0x6447 0x5424 0x4405
-    0xa7db 0xb7fa 0x8799 0x97b8 0xe75f 0xf77e 0xc71d 0xd73c
-    0x26d3 0x36f2 0x0691 0x16b0 0x6657 0x7676 0x4615 0x5634
-    0xd94c 0xc96d 0xf90e 0xe92f 0x99c8 0x89e9 0xb98a 0xa9ab
-    0x5844 0x4865 0x7806 0x6827 0x18c0 0x08e1 0x3882 0x28a3
-    0xcb7d 0xdb5c 0xeb3f 0xfb1e 0x8bf9 0x9bd8 0xabbb 0xbb9a
-    0x4a75 0x5a54 0x6a37 0x7a16 0x0af1 0x1ad0 0x2ab3 0x3a92
-    0xfd2e 0xed0f 0xdd6c 0xcd4d 0xbdaa 0xad8b 0x9de8 0x8dc9
-    0x7c26 0x6c07 0x5c64 0x4c45 0x3ca2 0x2c83 0x1ce0 0x0cc1
-    0xef1f 0xff3e 0xcf5d 0xdf7c 0xaf9b 0xbfba 0x8fd9 0x9ff8
-    0x6e17 0x7e36 0x4e55 0x5e74 0x2e93 0x3eb2 0x0ed1 0x1ef0
-}
-
-proc ::redis_cluster::crc16 {s} {
-    set s [encoding convertto ascii $s]
-    set crc 0
-    foreach char [split $s {}] {
-        scan $char %c byte
-        set crc [expr {(($crc<<8)&0xffff) ^ [lindex $::redis_cluster::XMODEMCRC16Lookup [expr {(($crc>>8)^$byte) & 0xff}]]}]
-    }
-    return $crc
-}
-
-# Hash a single key returning the slot it belongs to, Implemented hash
-# tags as described in the Redis Cluster specification.
-proc ::redis_cluster::hash {key} {
-    set keylen [string length $key]
-    set s {}
-    set e {}
-    for {set s 0} {$s < $keylen} {incr s} {
-        if {[string index $key $s] eq "\{"} break
-    }
-
-    if {[expr {$s == $keylen}]} {
-        set res [expr {[crc16 $key] & 16383}]
-        return $res
-    }
-
-    for {set e [expr {$s+1}]} {$e < $keylen} {incr e} {
-        if {[string index $key $e] == "\}"} break
-    }
-
-    if {$e == $keylen || $e == [expr {$s+1}]} {
-        set res [expr {[crc16 $key] & 16383}]
-        return $res
-    }
-
-    set key_sub [string range $key [expr {$s+1}] [expr {$e-1}]]
-    return [expr {[crc16 $key_sub] & 16383}]
-}
-
-# Return the slot the specified keys hash to.
-# If the keys hash to multiple slots, an empty string is returned to
-# signal that the command can't be run in Redis Cluster.
-proc ::redis_cluster::get_slot_from_keys {keys} {
-    set slot {}
-    foreach k $keys {
-        set s [::redis_cluster::hash $k]
-        if {$slot eq {}} {
-            set slot $s
-        } elseif {$slot != $s} {
-            return {} ; # Error
-        }
-    }
-    return $slot
-}
diff --git a/redis-stable/tests/support/redis.tcl b/redis-stable/tests/support/redis.tcl
deleted file mode 100644
index 978163e9..00000000
--- a/redis-stable/tests/support/redis.tcl
+++ /dev/null
@@ -1,368 +0,0 @@
-# Tcl client library - used by the Redis test
-# Copyright (C) 2009-2014 Salvatore Sanfilippo
-# Released under the BSD license like Redis itself
-#
-# Example usage:
-#
-# set r [redis 127.0.0.1 6379]
-# $r lpush mylist foo
-# $r lpush mylist bar
-# $r lrange mylist 0 -1
-# $r close
-#
-# Non blocking usage example:
-#
-# proc handlePong {r type reply} {
-#     puts "PONG $type '$reply'"
-#     if {$reply ne "PONG"} {
-#         $r ping [list handlePong]
-#     }
-# }
-#
-# set r [redis]
-# $r blocking 0
-# $r get fo [list handlePong]
-#
-# vwait forever
-
-package require Tcl 8.5
-package provide redis 0.1
-
-namespace eval redis {}
-set ::redis::id 0
-array set ::redis::fd {}
-array set ::redis::addr {}
-array set ::redis::blocking {}
-array set ::redis::deferred {}
-array set ::redis::readraw {}
-array set ::redis::reconnect {}
-array set ::redis::tls {}
-array set ::redis::callback {}
-array set ::redis::state {} ;# State in non-blocking reply reading
-array set ::redis::statestack {} ;# Stack of states, for nested mbulks
-
-proc redis {{server 127.0.0.1} {port 6379} {defer 0} {tls 0} {tlsoptions {}} {readraw 0}} {
-    if {$tls} {
-        package require tls
-        ::tls::init \
-            -cafile "$::tlsdir/ca.crt" \
-            -certfile "$::tlsdir/client.crt" \
-            -keyfile "$::tlsdir/client.key" \
-            {*}$tlsoptions
-        set fd [::tls::socket $server $port]
-    } else {
-        set fd [socket $server $port]
-    }
-    fconfigure $fd -translation binary
-    set id [incr ::redis::id]
-    set ::redis::fd($id) $fd
-    set ::redis::addr($id) [list $server $port]
-    set ::redis::blocking($id) 1
-    set ::redis::deferred($id) $defer
-    set ::redis::readraw($id) $readraw
-    set ::redis::reconnect($id) 0
-    set ::redis::tls($id) $tls
-    ::redis::redis_reset_state $id
-    interp alias {} ::redis::redisHandle$id {} ::redis::__dispatch__ $id
-}
-
-# This is a wrapper to the actual dispatching procedure that handles
-# reconnection if needed.
-proc ::redis::__dispatch__ {id method args} {
-    set errorcode [catch {::redis::__dispatch__raw__ $id $method $args} retval]
-    if {$errorcode && $::redis::reconnect($id) && $::redis::fd($id) eq {}} {
-        # Try again if the connection was lost.
-        # FIXME: we don't re-select the previously selected DB, nor we check
-        # if we are inside a transaction that needs to be re-issued from
-        # scratch.
-        set errorcode [catch {::redis::__dispatch__raw__ $id $method $args} retval]
-    }
-    return -code $errorcode $retval
-}
-
-proc ::redis::__dispatch__raw__ {id method argv} {
-    set fd $::redis::fd($id)
-
-    # Reconnect the link if needed.
-    if {$fd eq {}} {
-        lassign $::redis::addr($id) host port
-        if {$::redis::tls($id)} {
-            set ::redis::fd($id) [::tls::socket $host $port]
-        } else {
-            set ::redis::fd($id) [socket $host $port]
-        }
-        fconfigure $::redis::fd($id) -translation binary
-        set fd $::redis::fd($id)
-    }
-
-    set blocking $::redis::blocking($id)
-    set deferred $::redis::deferred($id)
-    if {$blocking == 0} {
-        if {[llength $argv] == 0} {
-            error "Please provide a callback in non-blocking mode"
-        }
-        set callback [lindex $argv end]
-        set argv [lrange $argv 0 end-1]
-    }
-    if {[info command ::redis::__method__$method] eq {}} {
-        set cmd "*[expr {[llength $argv]+1}]\r\n"
-        append cmd "$[string length $method]\r\n$method\r\n"
-        foreach a $argv {
-            append cmd "$[string length $a]\r\n$a\r\n"
-        }
-        ::redis::redis_write $fd $cmd
-        if {[catch {flush $fd}]} {
-            catch {close $fd}
-            set ::redis::fd($id) {}
-            return -code error "I/O error reading reply"
-        }
-
-        if {!$deferred} {
-            if {$blocking} {
-                ::redis::redis_read_reply $id $fd
-            } else {
-                # Every well formed reply read will pop an element from this
-                # list and use it as a callback. So pipelining is supported
-                # in non blocking mode.
-                lappend ::redis::callback($id) $callback
-                fileevent $fd readable [list ::redis::redis_readable $fd $id]
-            }
-        }
-    } else {
-        uplevel 1 [list ::redis::__method__$method $id $fd] $argv
-    }
-}
-
-proc ::redis::__method__blocking {id fd val} {
-    set ::redis::blocking($id) $val
-    fconfigure $fd -blocking $val
-}
-
-proc ::redis::__method__reconnect {id fd val} {
-    set ::redis::reconnect($id) $val
-}
-
-proc ::redis::__method__read {id fd} {
-    ::redis::redis_read_reply $id $fd
-}
-
-proc ::redis::__method__write {id fd buf} {
-    ::redis::redis_write $fd $buf
-}
-
-proc ::redis::__method__flush {id fd} {
-    flush $fd
-}
-
-proc ::redis::__method__close {id fd} {
-    catch {close $fd}
-    catch {unset ::redis::fd($id)}
-    catch {unset ::redis::addr($id)}
-    catch {unset ::redis::blocking($id)}
-    catch {unset ::redis::deferred($id)}
-    catch {unset ::redis::readraw($id)}
-    catch {unset ::redis::reconnect($id)}
-    catch {unset ::redis::tls($id)}
-    catch {unset ::redis::state($id)}
-    catch {unset ::redis::statestack($id)}
-    catch {unset ::redis::callback($id)}
-    catch {interp alias {} ::redis::redisHandle$id {}}
-}
-
-proc ::redis::__method__channel {id fd} {
-    return $fd
-}
-
-proc ::redis::__method__deferred {id fd val} {
-    set ::redis::deferred($id) $val
-}
-
-proc ::redis::__method__readraw {id fd val} {
-    set ::redis::readraw($id) $val
-}
-
-proc ::redis::redis_write {fd buf} {
-    puts -nonewline $fd $buf
-}
-
-proc ::redis::redis_writenl {fd buf} {
-    redis_write $fd $buf
-    redis_write $fd "\r\n"
-    flush $fd
-}
-
-proc ::redis::redis_readnl {fd len} {
-    set buf [read $fd $len]
-    read $fd 2 ; # discard CR LF
-    return $buf
-}
-
-proc ::redis::redis_bulk_read {fd} {
-    set count [redis_read_line $fd]
-    if {$count == -1} return {}
-    set buf [redis_readnl $fd $count]
-    return $buf
-}
-
-proc ::redis::redis_multi_bulk_read {id fd} {
-    set count [redis_read_line $fd]
-    if {$count == -1} return {}
-    set l {}
-    set err {}
-    for {set i 0} {$i < $count} {incr i} {
-        if {[catch {
-            lappend l [redis_read_reply $id $fd]
-        } e] && $err eq {}} {
-            set err $e
-        }
-    }
-    if {$err ne {}} {return -code error $err}
-    return $l
-}
-
-proc ::redis::redis_read_map {id fd} {
-    set count [redis_read_line $fd]
-    if {$count == -1} return {}
-    set d {}
-    set err {}
-    for {set i 0} {$i < $count} {incr i} {
-        if {[catch {
-            set k [redis_read_reply $id $fd] ; # key
-            set v [redis_read_reply $id $fd] ; # value
-            dict set d $k $v
-        } e] && $err eq {}} {
-            set err $e
-        }
-    }
-    if {$err ne {}} {return -code error $err}
-    return $d
-}
-
-proc ::redis::redis_read_line fd {
-    string trim [gets $fd]
-}
-
-proc ::redis::redis_read_null fd {
-    gets $fd
-    return {}
-}
-
-proc ::redis::redis_read_bool fd {
-    set v [redis_read_line $fd]
-    if {$v == "t"} {return 1}
-    if {$v == "f"} {return 0}
-    return -code error "Bad protocol, '$v' as bool type"
-}
-
-proc ::redis::redis_read_reply {id fd} {
-    if {$::redis::readraw($id)} {
-        return [redis_read_line $fd]
-    }
-
-    while {1} {
-        set type [read $fd 1]
-        switch -exact -- $type {
-            _ {return [redis_read_null $fd]}
-            : -
-            ( -
-            + {return [redis_read_line $fd]}
-            , {return [expr {double([redis_read_line $fd])}]}
-            # {return [redis_read_bool $fd]}
-            - {return -code error [redis_read_line $fd]}
-            $ {return [redis_bulk_read $fd]}
-            > -
-            ~ -
-            * {return [redis_multi_bulk_read $id $fd]}
-            % {return [redis_read_map $id $fd]}
-            | {
-                # ignore attributes for now (nowhere to store them)
-                redis_read_map $id $fd
-                continue
-            }
-            default {
-                if {$type eq {}} {
-                    catch {close $fd}
-                    set ::redis::fd($id) {}
-                    return -code error "I/O error reading reply"
-                }
-                return -code error "Bad protocol, '$type' as reply type byte"
-            }
-        }
-    }
-}
-
-proc ::redis::redis_reset_state id {
-    set ::redis::state($id) [dict create buf {} mbulk -1 bulk -1 reply {}]
-    set ::redis::statestack($id) {}
-}
-
-proc ::redis::redis_call_callback {id type reply} {
-    set cb [lindex $::redis::callback($id) 0]
-    set ::redis::callback($id) [lrange $::redis::callback($id) 1 end]
-    uplevel #0 $cb [list ::redis::redisHandle$id $type $reply]
-    ::redis::redis_reset_state $id
-}
-
-# Read a reply in non-blocking mode.
-proc ::redis::redis_readable {fd id} {
-    if {[eof $fd]} {
-        redis_call_callback $id eof {}
-        ::redis::__method__close $id $fd
-        return
-    }
-    if {[dict get $::redis::state($id) bulk] == -1} {
-        set line [gets $fd]
-        if {$line eq {}} return ;# No complete line available, return
-        switch -exact -- [string index $line 0] {
-            : -
-            + {redis_call_callback $id reply [string range $line 1 end-1]}
-            - {redis_call_callback $id err [string range $line 1 end-1]}
-            $ {
-                dict set ::redis::state($id) bulk \
-                    [expr [string range $line 1 end-1]+2]
-                if {[dict get $::redis::state($id) bulk] == 1} {
-                    # We got a $-1, hack the state to play well with this.
-                    dict set ::redis::state($id) bulk 2
-                    dict set ::redis::state($id) buf "\r\n"
-                    ::redis::redis_readable $fd $id
-                }
-            }
-            * {
-                dict set ::redis::state($id) mbulk [string range $line 1 end-1]
-                # Handle *-1
-                if {[dict get $::redis::state($id) mbulk] == -1} {
-                    redis_call_callback $id reply {}
-                }
-            }
-            default {
-                redis_call_callback $id err \
-                    "Bad protocol, $type as reply type byte"
-            }
-        }
-    } else {
-        set totlen [dict get $::redis::state($id) bulk]
-        set buflen [string length [dict get $::redis::state($id) buf]]
-        set toread [expr {$totlen-$buflen}]
-        set data [read $fd $toread]
-        set nread [string length $data]
-        dict append ::redis::state($id) buf $data
-        # Check if we read a complete bulk reply
-        if {[string length [dict get $::redis::state($id) buf]] ==
-            [dict get $::redis::state($id) bulk]} {
-            if {[dict get $::redis::state($id) mbulk] == -1} {
-                redis_call_callback $id reply \
-                    [string range [dict get $::redis::state($id) buf] 0 end-2]
-            } else {
-                dict with ::redis::state($id) {
-                    lappend reply [string range $buf 0 end-2]
-                    incr mbulk -1
-                    set bulk -1
-                }
-                if {[dict get $::redis::state($id) mbulk] == 0} {
-                    redis_call_callback $id reply \
-                        [dict get $::redis::state($id) reply]
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/support/server.tcl b/redis-stable/tests/support/server.tcl
deleted file mode 100644
index e8fa3e6f..00000000
--- a/redis-stable/tests/support/server.tcl
+++ /dev/null
@@ -1,623 +0,0 @@
-set ::global_overrides {}
-set ::tags {}
-set ::valgrind_errors {}
-
-proc start_server_error {config_file error} {
-    set err {}
-    append err "Can't start the Redis server\n"
-    append err "CONFIGURATION:"
-    append err [exec cat $config_file]
-    append err "\nERROR:"
-    append err [string trim $error]
-    send_data_packet $::test_server_fd err $err
-}
-
-proc check_valgrind_errors stderr {
-    set res [find_valgrind_errors $stderr true]
-    if {$res != ""} {
-        send_data_packet $::test_server_fd err "Valgrind error: $res\n"
-    }
-}
-
-proc clean_persistence config {
-    # we may wanna keep the logs for later, but let's clean the persistence
-    # files right away, since they can accumulate and take up a lot of space
-    set config [dict get $config "config"]
-    set rdb [format "%s/%s" [dict get $config "dir"] "dump.rdb"]
-    set aof [format "%s/%s" [dict get $config "dir"] "appendonly.aof"]
-    catch {exec rm -rf $rdb}
-    catch {exec rm -rf $aof}
-}
-
-proc kill_server config {
-    # nothing to kill when running against external server
-    if {$::external} return
-
-    # nevermind if its already dead
-    if {![is_alive $config]} {
-        # Check valgrind errors if needed
-        if {$::valgrind} {
-            check_valgrind_errors [dict get $config stderr]
-        }
-        return
-    }
-    set pid [dict get $config pid]
-
-    # check for leaks
-    if {![dict exists $config "skipleaks"]} {
-        catch {
-            if {[string match {*Darwin*} [exec uname -a]]} {
-                tags {"leaks"} {
-                    test "Check for memory leaks (pid $pid)" {
-                        set output {0 leaks}
-                        catch {exec leaks $pid} output option
-                        # In a few tests we kill the server process, so leaks will not find it.
-                        # It'll exits with exit code >1 on error, so we ignore these.
-                        if {[dict exists $option -errorcode]} {
-                            set details [dict get $option -errorcode]
-                            if {[lindex $details 0] eq "CHILDSTATUS"} {
-                                  set status [lindex $details 2]
-                                  if {$status > 1} {
-                                      set output "0 leaks"
-                                  }
-                            }
-                        }
-                        set output
-                    } {*0 leaks*}
-                }
-            }
-        }
-    }
-
-    # kill server and wait for the process to be totally exited
-    send_data_packet $::test_server_fd server-killing $pid
-    catch {exec kill $pid}
-    # Node might have been stopped in the test
-    catch {exec kill -SIGCONT $pid}
-    if {$::valgrind} {
-        set max_wait 60000
-    } else {
-        set max_wait 10000
-    }
-    while {[is_alive $config]} {
-        incr wait 10
-
-        if {$wait >= $max_wait} {
-            puts "Forcing process $pid to exit..."
-            catch {exec kill -KILL $pid}
-        } elseif {$wait % 1000 == 0} {
-            puts "Waiting for process $pid to exit..."
-        }
-        after 10
-    }
-
-    # Check valgrind errors if needed
-    if {$::valgrind} {
-        check_valgrind_errors [dict get $config stderr]
-    }
-
-    # Remove this pid from the set of active pids in the test server.
-    send_data_packet $::test_server_fd server-killed $pid
-}
-
-proc is_alive config {
-    set pid [dict get $config pid]
-    if {[catch {exec kill -0 $pid} err]} {
-        return 0
-    } else {
-        return 1
-    }
-}
-
-proc ping_server {host port} {
-    set retval 0
-    if {[catch {
-        if {$::tls} {
-            set fd [::tls::socket $host $port] 
-        } else {
-            set fd [socket $host $port]
-        }
-        fconfigure $fd -translation binary
-        puts $fd "PING\r\n"
-        flush $fd
-        set reply [gets $fd]
-        if {[string range $reply 0 0] eq {+} ||
-            [string range $reply 0 0] eq {-}} {
-            set retval 1
-        }
-        close $fd
-    } e]} {
-        if {$::verbose} {
-            puts -nonewline "."
-        }
-    } else {
-        if {$::verbose} {
-            puts -nonewline "ok"
-        }
-    }
-    return $retval
-}
-
-# Return 1 if the server at the specified addr is reachable by PING, otherwise
-# returns 0. Performs a try every 50 milliseconds for the specified number
-# of retries.
-proc server_is_up {host port retrynum} {
-    after 10 ;# Use a small delay to make likely a first-try success.
-    set retval 0
-    while {[incr retrynum -1]} {
-        if {[catch {ping_server $host $port} ping]} {
-            set ping 0
-        }
-        if {$ping} {return 1}
-        after 50
-    }
-    return 0
-}
-
-# Check if current ::tags match requested tags. If ::allowtags are used,
-# there must be some intersection. If ::denytags are used, no intersection
-# is allowed. Returns 1 if tags are acceptable or 0 otherwise, in which
-# case err_return names a return variable for the message to be logged.
-proc tags_acceptable {err_return} {
-    upvar $err_return err
-
-    # If tags are whitelisted, make sure there's match
-    if {[llength $::allowtags] > 0} {
-        set matched 0
-        foreach tag $::allowtags {
-            if {[lsearch $::tags $tag] >= 0} {
-                incr matched
-            }
-        }
-        if {$matched < 1} {
-            set err "Tag: none of the tags allowed"
-            return 0
-        }
-    }
-
-    foreach tag $::denytags {
-        if {[lsearch $::tags $tag] >= 0} {
-            set err "Tag: $tag denied"
-            return 0
-        }
-    }
-
-    return 1
-}
-
-# doesn't really belong here, but highly coupled to code in start_server
-proc tags {tags code} {
-    # If we 'tags' contain multiple tags, quoted and seperated by spaces,
-    # we want to get rid of the quotes in order to have a proper list
-    set tags [string map { \" "" } $tags]
-    set ::tags [concat $::tags $tags]
-    if {![tags_acceptable err]} {
-        incr ::num_aborted
-        send_data_packet $::test_server_fd ignore $err
-        set ::tags [lrange $::tags 0 end-[llength $tags]]
-        return
-    }
-    uplevel 1 $code
-    set ::tags [lrange $::tags 0 end-[llength $tags]]
-}
-
-# Write the configuration in the dictionary 'config' in the specified
-# file name.
-proc create_server_config_file {filename config} {
-    set fp [open $filename w+]
-    foreach directive [dict keys $config] {
-        puts -nonewline $fp "$directive "
-        puts $fp [dict get $config $directive]
-    }
-    close $fp
-}
-
-proc spawn_server {config_file stdout stderr} {
-    if {$::valgrind} {
-        set pid [exec valgrind --track-origins=yes --trace-children=yes --suppressions=[pwd]/src/valgrind.sup --show-reachable=no --show-possibly-lost=no --leak-check=full src/redis-server $config_file >> $stdout 2>> $stderr &]
-    } elseif ($::stack_logging) {
-        set pid [exec /usr/bin/env MallocStackLogging=1 MallocLogFile=/tmp/malloc_log.txt src/redis-server $config_file >> $stdout 2>> $stderr &]
-    } else {
-        set pid [exec src/redis-server $config_file >> $stdout 2>> $stderr &]
-    }
-
-    if {$::wait_server} {
-        set msg "server started PID: $pid. press any key to continue..."
-        puts $msg
-        read stdin 1
-    }
-
-    # Tell the test server about this new instance.
-    send_data_packet $::test_server_fd server-spawned $pid
-    return $pid
-}
-
-# Wait for actual startup, return 1 if port is busy, 0 otherwise
-proc wait_server_started {config_file stdout pid} {
-    set checkperiod 100; # Milliseconds
-    set maxiter [expr {120*1000/$checkperiod}] ; # Wait up to 2 minutes.
-    set port_busy 0
-    while 1 {
-        if {[regexp -- " PID: $pid" [exec cat $stdout]]} {
-            break
-        }
-        after $checkperiod
-        incr maxiter -1
-        if {$maxiter == 0} {
-            start_server_error $config_file "No PID detected in log $stdout"
-            puts "--- LOG CONTENT ---"
-            puts [exec cat $stdout]
-            puts "-------------------"
-            break
-        }
-
-        # Check if the port is actually busy and the server failed
-        # for this reason.
-        if {[regexp {Failed listening on port} [exec cat $stdout]]} {
-            set port_busy 1
-            break
-        }
-    }
-    return $port_busy
-}
-
-proc dump_server_log {srv} {
-    set pid [dict get $srv "pid"]
-    puts "\n===== Start of server log (pid $pid) =====\n"
-    puts [exec cat [dict get $srv "stdout"]]
-    puts "===== End of server log (pid $pid) =====\n"
-}
-
-proc start_server {options {code undefined}} {
-    # setup defaults
-    set baseconfig "default.conf"
-    set overrides {}
-    set omit {}
-    set tags {}
-    set keep_persistence false
-
-    # parse options
-    foreach {option value} $options {
-        switch $option {
-            "config" {
-                set baseconfig $value
-            }
-            "overrides" {
-                set overrides $value
-            }
-            "omit" {
-                set omit $value
-            }
-            "tags" {
-                # If we 'tags' contain multiple tags, quoted and seperated by spaces,
-                # we want to get rid of the quotes in order to have a proper list
-                set tags [string map { \" "" } $value]
-                set ::tags [concat $::tags $tags]
-            }
-            "keep_persistence" {
-                set keep_persistence $value
-            }
-            default {
-                error "Unknown option $option"
-            }
-        }
-    }
-
-    # We skip unwanted tags
-    if {![tags_acceptable err]} {
-        incr ::num_aborted
-        send_data_packet $::test_server_fd ignore $err
-        set ::tags [lrange $::tags 0 end-[llength $tags]]
-        return
-    }
-
-    # If we are running against an external server, we just push the
-    # host/port pair in the stack the first time
-    if {$::external} {
-        if {[llength $::servers] == 0} {
-            set srv {}
-            dict set srv "host" $::host
-            dict set srv "port" $::port
-            set client [redis $::host $::port 0 $::tls]
-            dict set srv "client" $client
-            $client select 9
-
-            set config {}
-            dict set config "port" $::port
-            dict set srv "config" $config
-
-            # append the server to the stack
-            lappend ::servers $srv
-        }
-        r flushall
-        if {[catch {set retval [uplevel 1 $code]} error]} {
-            if {$::durable} {
-                set msg [string range $error 10 end]
-                lappend details $msg
-                lappend details $::errorInfo
-                lappend ::tests_failed $details
-
-                incr ::num_failed
-                send_data_packet $::test_server_fd err [join $details "\n"]
-            } else {
-                # Re-raise, let handler up the stack take care of this.
-                error $error $::errorInfo
-            }
-        }
-        set ::tags [lrange $::tags 0 end-[llength $tags]]
-        return
-    }
-
-    set data [split [exec cat "tests/assets/$baseconfig"] "\n"]
-    set config {}
-    if {$::tls} {
-        dict set config "tls-cert-file" [format "%s/tests/tls/server.crt" [pwd]]
-        dict set config "tls-key-file" [format "%s/tests/tls/server.key" [pwd]]
-        dict set config "tls-client-cert-file" [format "%s/tests/tls/client.crt" [pwd]]
-        dict set config "tls-client-key-file" [format "%s/tests/tls/client.key" [pwd]]
-        dict set config "tls-dh-params-file" [format "%s/tests/tls/redis.dh" [pwd]]
-        dict set config "tls-ca-cert-file" [format "%s/tests/tls/ca.crt" [pwd]]
-        dict set config "loglevel" "debug"
-    }
-    foreach line $data {
-        if {[string length $line] > 0 && [string index $line 0] ne "#"} {
-            set elements [split $line " "]
-            set directive [lrange $elements 0 0]
-            set arguments [lrange $elements 1 end]
-            dict set config $directive $arguments
-        }
-    }
-
-    # use a different directory every time a server is started
-    dict set config dir [tmpdir server]
-
-    # start every server on a different port
-    set port [find_available_port $::baseport $::portcount]
-    if {$::tls} {
-        dict set config "port" 0
-        dict set config "tls-port" $port
-        dict set config "tls-cluster" "yes"
-        dict set config "tls-replication" "yes"
-    } else {
-        dict set config port $port
-    }
-
-    set unixsocket [file normalize [format "%s/%s" [dict get $config "dir"] "socket"]]
-    dict set config "unixsocket" $unixsocket
-
-    # apply overrides from global space and arguments
-    foreach {directive arguments} [concat $::global_overrides $overrides] {
-        dict set config $directive $arguments
-    }
-
-    # remove directives that are marked to be omitted
-    foreach directive $omit {
-        dict unset config $directive
-    }
-
-    # write new configuration to temporary file
-    set config_file [tmpfile redis.conf]
-    create_server_config_file $config_file $config
-
-    set stdout [format "%s/%s" [dict get $config "dir"] "stdout"]
-    set stderr [format "%s/%s" [dict get $config "dir"] "stderr"]
-
-    # if we're inside a test, write the test name to the server log file
-    if {[info exists ::cur_test]} {
-        set fd [open $stdout "a+"]
-        puts $fd "### Starting server for test $::cur_test"
-        close $fd
-    }
-
-    # We need a loop here to retry with different ports.
-    set server_started 0
-    while {$server_started == 0} {
-        if {$::verbose} {
-            puts -nonewline "=== ($tags) Starting server ${::host}:${port} "
-        }
-
-        send_data_packet $::test_server_fd "server-spawning" "port $port"
-
-        set pid [spawn_server $config_file $stdout $stderr]
-
-        # check that the server actually started
-        set port_busy [wait_server_started $config_file $stdout $pid]
-
-        # Sometimes we have to try a different port, even if we checked
-        # for availability. Other test clients may grab the port before we
-        # are able to do it for example.
-        if {$port_busy} {
-            puts "Port $port was already busy, trying another port..."
-            set port [find_available_port $::baseport $::portcount]
-            if {$::tls} {
-                dict set config "tls-port" $port
-            } else {
-                dict set config port $port
-            }
-            create_server_config_file $config_file $config
-
-            # Truncate log so wait_server_started will not be looking at
-            # output of the failed server.
-            close [open $stdout "w"]
-
-            continue; # Try again
-        }
-
-        if {$::valgrind} {set retrynum 1000} else {set retrynum 100}
-        if {$code ne "undefined"} {
-            set serverisup [server_is_up $::host $port $retrynum]
-        } else {
-            set serverisup 1
-        }
-
-        if {$::verbose} {
-            puts ""
-        }
-
-        if {!$serverisup} {
-            set err {}
-            append err [exec cat $stdout] "\n" [exec cat $stderr]
-            start_server_error $config_file $err
-            return
-        }
-        set server_started 1
-    }
-
-    # setup properties to be able to initialize a client object
-    set port_param [expr $::tls ? {"tls-port"} : {"port"}]
-    set host $::host
-    if {[dict exists $config bind]} { set host [dict get $config bind] }
-    if {[dict exists $config $port_param]} { set port [dict get $config $port_param] }
-
-    # setup config dict
-    dict set srv "config_file" $config_file
-    dict set srv "config" $config
-    dict set srv "pid" $pid
-    dict set srv "host" $host
-    dict set srv "port" $port
-    dict set srv "stdout" $stdout
-    dict set srv "stderr" $stderr
-    dict set srv "unixsocket" $unixsocket
-
-    # if a block of code is supplied, we wait for the server to become
-    # available, create a client object and kill the server afterwards
-    if {$code ne "undefined"} {
-        set line [exec head -n1 $stdout]
-        if {[string match {*already in use*} $line]} {
-            error_and_quit $config_file $line
-        }
-
-        while 1 {
-            # check that the server actually started and is ready for connections
-            if {[count_message_lines $stdout "Ready to accept"] > 0} {
-                break
-            }
-            after 10
-        }
-
-        # append the server to the stack
-        lappend ::servers $srv
-
-        # connect client (after server dict is put on the stack)
-        reconnect
-
-        # remember previous num_failed to catch new errors
-        set prev_num_failed $::num_failed
-
-        # execute provided block
-        set num_tests $::num_tests
-        if {[catch { uplevel 1 $code } error]} {
-            set backtrace $::errorInfo
-            set assertion [string match "assertion:*" $error]
-
-            # fetch srv back from the server list, in case it was restarted by restart_server (new PID)
-            set srv [lindex $::servers end]
-
-            # pop the server object
-            set ::servers [lrange $::servers 0 end-1]
-
-            # Kill the server without checking for leaks
-            dict set srv "skipleaks" 1
-            kill_server $srv
-
-            if {$::dump_logs && $assertion} {
-                # if we caught an assertion ($::num_failed isn't incremented yet)
-                # this happens when the test spawns a server and not the other way around
-                dump_server_log $srv
-            } else {
-                # Print crash report from log
-                set crashlog [crashlog_from_file [dict get $srv "stdout"]]
-                if {[string length $crashlog] > 0} {
-                    puts [format "\nLogged crash report (pid %d):" [dict get $srv "pid"]]
-                    puts "$crashlog"
-                    puts ""
-                }
-            }
-
-            if {!$assertion && $::durable} {
-                # durable is meant to prevent the whole tcl test from exiting on
-                # an exception. an assertion will be caught by the test proc.
-                set msg [string range $error 10 end]
-                lappend details $msg
-                lappend details $backtrace
-                lappend ::tests_failed $details
-
-                incr ::num_failed
-                send_data_packet $::test_server_fd err [join $details "\n"]
-            } else {
-                # Re-raise, let handler up the stack take care of this.
-                error $error $backtrace
-            }
-        } else {
-            if {$::dump_logs && $prev_num_failed != $::num_failed} {
-                dump_server_log $srv
-            }
-        }
-
-        # fetch srv back from the server list, in case it was restarted by restart_server (new PID)
-        set srv [lindex $::servers end]
-
-        # Don't do the leak check when no tests were run
-        if {$num_tests == $::num_tests} {
-            dict set srv "skipleaks" 1
-        }
-
-        # pop the server object
-        set ::servers [lrange $::servers 0 end-1]
-
-        set ::tags [lrange $::tags 0 end-[llength $tags]]
-        kill_server $srv
-        if {!$keep_persistence} {
-            clean_persistence $srv
-        }
-        set _ ""
-    } else {
-        set ::tags [lrange $::tags 0 end-[llength $tags]]
-        set _ $srv
-    }
-}
-
-proc restart_server {level wait_ready rotate_logs} {
-    set srv [lindex $::servers end+$level]
-    kill_server $srv
-
-    set pid [dict get $srv "pid"]
-    set stdout [dict get $srv "stdout"]
-    set stderr [dict get $srv "stderr"]
-    if {$rotate_logs} {
-        set ts [clock format [clock seconds] -format %y%m%d%H%M%S]
-        file rename $stdout $stdout.$ts.$pid
-        file rename $stderr $stderr.$ts.$pid
-    }
-    set prev_ready_count [count_message_lines $stdout "Ready to accept"]
-
-    # if we're inside a test, write the test name to the server log file
-    if {[info exists ::cur_test]} {
-        set fd [open $stdout "a+"]
-        puts $fd "### Restarting server for test $::cur_test"
-        close $fd
-    }
-
-    set config_file [dict get $srv "config_file"]
-
-    set pid [spawn_server $config_file $stdout $stderr]
-
-    # check that the server actually started
-    wait_server_started $config_file $stdout $pid
-
-    # update the pid in the servers list
-    dict set srv "pid" $pid
-    # re-set $srv in the servers list
-    lset ::servers end+$level $srv
-
-    if {$wait_ready} {
-        while 1 {
-            # check that the server actually started and is ready for connections
-            if {[count_message_lines $stdout "Ready to accept"] > $prev_ready_count} {
-                break
-            }
-            after 10
-        }
-    }
-    reconnect $level
-}
diff --git a/redis-stable/tests/support/test.tcl b/redis-stable/tests/support/test.tcl
deleted file mode 100644
index 29d0cbf4..00000000
--- a/redis-stable/tests/support/test.tcl
+++ /dev/null
@@ -1,210 +0,0 @@
-set ::num_tests 0
-set ::num_passed 0
-set ::num_failed 0
-set ::num_skipped 0
-set ::num_aborted 0
-set ::tests_failed {}
-set ::cur_test ""
-
-proc fail {msg} {
-    error "assertion:$msg"
-}
-
-proc assert {condition} {
-    if {![uplevel 1 [list expr $condition]]} {
-        set context "(context: [info frame -1])"
-        error "assertion:Expected [uplevel 1 [list subst -nocommands $condition]] $context"
-    }
-}
-
-proc assert_no_match {pattern value} {
-    if {[string match $pattern $value]} {
-        set context "(context: [info frame -1])"
-        error "assertion:Expected '$value' to not match '$pattern' $context"
-    }
-}
-
-proc assert_match {pattern value} {
-    if {![string match $pattern $value]} {
-        set context "(context: [info frame -1])"
-        error "assertion:Expected '$value' to match '$pattern' $context"
-    }
-}
-
-proc assert_failed {expected_err detail} {
-     if {$detail ne ""} {
-        set detail "(detail: $detail)"
-     } else {
-        set detail "(context: [info frame -2])"
-     }
-     error "assertion:$expected_err $detail"
-}
-
-proc assert_equal {value expected {detail ""}} {
-    if {$expected ne $value} {
-        assert_failed "Expected '$value' to be equal to '$expected'" $detail
-    }
-}
-
-proc assert_lessthan {value expected {detail ""}} {
-    if {!($value < $expected)} {
-        assert_failed "Expected '$value' to be less than '$expected'" $detail
-    }
-}
-
-proc assert_lessthan_equal {value expected {detail ""}} {
-    if {!($value <= $expected)} {
-        assert_failed "Expected '$value' to be less than or equal to '$expected'" $detail
-    }
-}
-
-proc assert_morethan {value expected {detail ""}} {
-    if {!($value > $expected)} {
-        assert_failed "Expected '$value' to be more than '$expected'" $detail
-    }
-}
-
-proc assert_morethan_equal {value expected {detail ""}} {
-    if {!($value >= $expected)} {
-        assert_failed "Expected '$value' to be more than or equal to '$expected'" $detail
-    }
-}
-
-proc assert_range {value min max {detail ""}} {
-    if {!($value <= $max && $value >= $min)} {
-        assert_failed "Expected '$value' to be between to '$min' and '$max'" $detail
-    }
-}
-
-proc assert_error {pattern code} {
-    if {[catch {uplevel 1 $code} error]} {
-        assert_match $pattern $error
-    } else {
-        error "assertion:Expected an error but nothing was caught"
-    }
-}
-
-proc assert_encoding {enc key} {
-    set dbg [r debug object $key]
-    assert_match "* encoding:$enc *" $dbg
-}
-
-proc assert_type {type key} {
-    assert_equal $type [r type $key]
-}
-
-# Wait for the specified condition to be true, with the specified number of
-# max retries and delay between retries. Otherwise the 'elsescript' is
-# executed.
-proc wait_for_condition {maxtries delay e _else_ elsescript} {
-    while {[incr maxtries -1] >= 0} {
-        set errcode [catch {uplevel 1 [list expr $e]} result]
-        if {$errcode == 0} {
-            if {$result} break
-        } else {
-            return -code $errcode $result
-        }
-        after $delay
-    }
-    if {$maxtries == -1} {
-        set errcode [catch [uplevel 1 $elsescript] result]
-        return -code $errcode $result
-    }
-}
-
-proc test {name code {okpattern undefined} {options undefined}} {
-    # abort if test name in skiptests
-    if {[lsearch $::skiptests $name] >= 0} {
-        incr ::num_skipped
-        send_data_packet $::test_server_fd skip $name
-        return
-    }
-
-    # abort if only_tests was set but test name is not included
-    if {[llength $::only_tests] > 0 && [lsearch $::only_tests $name] < 0} {
-        incr ::num_skipped
-        send_data_packet $::test_server_fd skip $name
-        return
-    }
-
-    # check if tagged with at least 1 tag to allow when there *is* a list
-    # of tags to allow, because default policy is to run everything
-    if {[llength $::allowtags] > 0} {
-        set matched 0
-        foreach tag $::allowtags {
-            if {[lsearch $::tags $tag] >= 0} {
-                incr matched
-            }
-        }
-        if {$matched < 1} {
-            incr ::num_aborted
-            send_data_packet $::test_server_fd ignore $name
-            return
-        }
-    }
-
-    incr ::num_tests
-    set details {}
-    lappend details "$name in $::curfile"
-
-    # set a cur_test global to be logged into new servers that are spown
-    # and log the test name in all existing servers
-    set prev_test $::cur_test
-    set ::cur_test "$name in $::curfile"
-    if {!$::external} {
-        foreach srv $::servers {
-            set stdout [dict get $srv stdout]
-            set fd [open $stdout "a+"]
-            puts $fd "### Starting test $::cur_test"
-            close $fd
-        }
-    }
-
-    send_data_packet $::test_server_fd testing $name
-
-    if {[catch {set retval [uplevel 1 $code]} error]} {
-        set assertion [string match "assertion:*" $error]
-        if {$assertion || $::durable} {
-            # durable prevents the whole tcl test from exiting on an exception.
-            # an assertion is handled gracefully anyway.
-            set msg [string range $error 10 end]
-            lappend details $msg
-            if {!$assertion} {
-                lappend details $::errorInfo
-            }
-            lappend ::tests_failed $details
-
-            incr ::num_failed
-            send_data_packet $::test_server_fd err [join $details "\n"]
-
-            if {$::stop_on_failure} {
-                puts "Test error (last server port:[srv port], log:[srv stdout]), press enter to teardown the test."
-                flush stdout
-                gets stdin
-            }
-        } else {
-            # Re-raise, let handler up the stack take care of this.
-            error $error $::errorInfo
-        }
-    } else {
-        if {$okpattern eq "undefined" || $okpattern eq $retval || [string match $okpattern $retval]} {
-            incr ::num_passed
-            send_data_packet $::test_server_fd ok $name
-        } else {
-            set msg "Expected '$okpattern' to equal or match '$retval'"
-            lappend details $msg
-            lappend ::tests_failed $details
-
-            incr ::num_failed
-            send_data_packet $::test_server_fd err [join $details "\n"]
-        }
-    }
-
-    if {$::traceleaks} {
-        set output [exec leaks redis-server]
-        if {![string match {*0 leaks*} $output]} {
-            send_data_packet $::test_server_fd err "Detected a memory leak in test '$name': $output"
-        }
-    }
-    set ::cur_test $prev_test
-}
diff --git a/redis-stable/tests/support/tmpfile.tcl b/redis-stable/tests/support/tmpfile.tcl
deleted file mode 100644
index 809f5873..00000000
--- a/redis-stable/tests/support/tmpfile.tcl
+++ /dev/null
@@ -1,15 +0,0 @@
-set ::tmpcounter 0
-set ::tmproot "./tests/tmp"
-file mkdir $::tmproot
-
-# returns a dirname unique to this process to write to
-proc tmpdir {basename} {
-    set dir [file join $::tmproot $basename.[pid].[incr ::tmpcounter]]
-    file mkdir $dir
-    set _ $dir
-}
-
-# return a filename unique to this process to write to
-proc tmpfile {basename} {
-    file join $::tmproot $basename.[pid].[incr ::tmpcounter]
-}
diff --git a/redis-stable/tests/support/util.tcl b/redis-stable/tests/support/util.tcl
deleted file mode 100644
index 1d098b54..00000000
--- a/redis-stable/tests/support/util.tcl
+++ /dev/null
@@ -1,773 +0,0 @@
-proc randstring {min max {type binary}} {
-    set len [expr {$min+int(rand()*($max-$min+1))}]
-    set output {}
-    if {$type eq {binary}} {
-        set minval 0
-        set maxval 255
-    } elseif {$type eq {alpha}} {
-        set minval 48
-        set maxval 122
-    } elseif {$type eq {compr}} {
-        set minval 48
-        set maxval 52
-    }
-    while {$len} {
-        set rr [expr {$minval+int(rand()*($maxval-$minval+1))}]
-        if {$type eq {alpha} && $rr eq 92} {
-            set rr 90; # avoid putting '\' char in the string, it can mess up TCL processing
-        }
-        append output [format "%c" $rr]
-        incr len -1
-    }
-    return $output
-}
-
-# Useful for some test
-proc zlistAlikeSort {a b} {
-    if {[lindex $a 0] > [lindex $b 0]} {return 1}
-    if {[lindex $a 0] < [lindex $b 0]} {return -1}
-    string compare [lindex $a 1] [lindex $b 1]
-}
-
-# Return all log lines starting with the first line that contains a warning.
-# Generally, this will be an assertion error with a stack trace.
-proc crashlog_from_file {filename} {
-    set lines [split [exec cat $filename] "\n"]
-    set matched 0
-    set logall 0
-    set result {}
-    foreach line $lines {
-        if {[string match {*REDIS BUG REPORT START*} $line]} {
-            set logall 1
-        }
-        if {[regexp {^\[\d+\]\s+\d+\s+\w+\s+\d{2}:\d{2}:\d{2} \#} $line]} {
-            set matched 1
-        }
-        if {$logall || $matched} {
-            lappend result $line
-        }
-    }
-    join $result "\n"
-}
-
-proc getInfoProperty {infostr property} {
-    if {[regexp "\r\n$property:(.*?)\r\n" $infostr _ value]} {
-        set _ $value
-    }
-}
-
-# Return value for INFO property
-proc status {r property} {
-    set _ [getInfoProperty [{*}$r info] $property]
-}
-
-proc waitForBgsave r {
-    while 1 {
-        if {[status r rdb_bgsave_in_progress] eq 1} {
-            if {$::verbose} {
-                puts -nonewline "\nWaiting for background save to finish... "
-                flush stdout
-            }
-            after 1000
-        } else {
-            break
-        }
-    }
-}
-
-proc waitForBgrewriteaof r {
-    while 1 {
-        if {[status r aof_rewrite_in_progress] eq 1} {
-            if {$::verbose} {
-                puts -nonewline "\nWaiting for background AOF rewrite to finish... "
-                flush stdout
-            }
-            after 1000
-        } else {
-            break
-        }
-    }
-}
-
-proc wait_for_sync r {
-    wait_for_condition 50 100 {
-        [status $r master_link_status] eq "up"
-    } else {
-        fail "replica didn't sync in time"
-    }
-}
-
-proc wait_for_ofs_sync {r1 r2} {
-    wait_for_condition 50 100 {
-        [status $r1 master_repl_offset] eq [status $r2 master_repl_offset]
-    } else {
-        fail "replica didn't sync in time"
-    }
-}
-
-proc wait_done_loading r {
-    wait_for_condition 50 100 {
-        [catch {$r ping} e] == 0
-    } else {
-        fail "Loading DB is taking too much time."
-    }
-}
-
-# count current log lines in server's stdout
-proc count_log_lines {srv_idx} {
-    set _ [string trim [exec wc -l < [srv $srv_idx stdout]]]
-}
-
-# returns the number of times a line with that pattern appears in a file
-proc count_message_lines {file pattern} {
-    set res 0
-    # exec fails when grep exists with status other than 0 (when the patter wasn't found)
-    catch {
-        set res [string trim [exec grep $pattern $file 2> /dev/null | wc -l]]
-    }
-    return $res
-}
-
-# returns the number of times a line with that pattern appears in the log
-proc count_log_message {srv_idx pattern} {
-    set stdout [srv $srv_idx stdout]
-    return [count_message_lines $stdout $pattern]
-}
-
-# verify pattern exists in server's sdtout after a certain line number
-proc verify_log_message {srv_idx pattern from_line} {
-    incr from_line
-    set result [exec tail -n +$from_line < [srv $srv_idx stdout]]
-    if {![string match $pattern $result]} {
-        error "assertion:expected message not found in log file: $pattern"
-    }
-}
-
-# wait for pattern to be found in server's stdout after certain line number
-# return value is a list containing the line that matched the pattern and the line number
-proc wait_for_log_messages {srv_idx patterns from_line maxtries delay} {
-    set retry $maxtries
-    set next_line [expr $from_line + 1] ;# searching form the line after
-    set stdout [srv $srv_idx stdout]
-    while {$retry} {
-        # re-read the last line (unless it's before to our first), last time we read it, it might have been incomplete
-        set next_line [expr $next_line - 1 > $from_line + 1 ? $next_line - 1 : $from_line + 1]
-        set result [exec tail -n +$next_line < $stdout]
-        set result [split $result "\n"]
-        foreach line $result {
-            foreach pattern $patterns {
-                if {[string match $pattern $line]} {
-                    return [list $line $next_line]
-                }
-            }
-            incr next_line
-        }
-        incr retry -1
-        after $delay
-    }
-    if {$retry == 0} {
-        if {$::verbose} {
-            puts "content of $stdout from line: $from_line:"
-            puts [exec tail -n +$from_line < $stdout]
-        }
-        fail "log message of '$patterns' not found in $stdout after line: $from_line till line: [expr $next_line -1]"
-    }
-}
-
-# write line to server log file
-proc write_log_line {srv_idx msg} {
-    set logfile [srv $srv_idx stdout]
-    set fd [open $logfile "a+"]
-    puts $fd "### $msg"
-    close $fd
-}
-
-# Random integer between 0 and max (excluded).
-proc randomInt {max} {
-    expr {int(rand()*$max)}
-}
-
-# Random signed integer between -max and max (both extremes excluded).
-proc randomSignedInt {max} {
-    set i [randomInt $max]
-    if {rand() > 0.5} {
-        set i -$i
-    }
-    return $i
-}
-
-proc randpath args {
-    set path [expr {int(rand()*[llength $args])}]
-    uplevel 1 [lindex $args $path]
-}
-
-proc randomValue {} {
-    randpath {
-        # Small enough to likely collide
-        randomSignedInt 1000
-    } {
-        # 32 bit compressible signed/unsigned
-        randpath {randomSignedInt 2000000000} {randomSignedInt 4000000000}
-    } {
-        # 64 bit
-        randpath {randomSignedInt 1000000000000}
-    } {
-        # Random string
-        randpath {randstring 0 256 alpha} \
-                {randstring 0 256 compr} \
-                {randstring 0 256 binary}
-    }
-}
-
-proc randomKey {} {
-    randpath {
-        # Small enough to likely collide
-        randomInt 1000
-    } {
-        # 32 bit compressible signed/unsigned
-        randpath {randomInt 2000000000} {randomInt 4000000000}
-    } {
-        # 64 bit
-        randpath {randomInt 1000000000000}
-    } {
-        # Random string
-        randpath {randstring 1 256 alpha} \
-                {randstring 1 256 compr}
-    }
-}
-
-proc findKeyWithType {r type} {
-    for {set j 0} {$j < 20} {incr j} {
-        set k [{*}$r randomkey]
-        if {$k eq {}} {
-            return {}
-        }
-        if {[{*}$r type $k] eq $type} {
-            return $k
-        }
-    }
-    return {}
-}
-
-proc createComplexDataset {r ops {opt {}}} {
-    for {set j 0} {$j < $ops} {incr j} {
-        set k [randomKey]
-        set k2 [randomKey]
-        set f [randomValue]
-        set v [randomValue]
-
-        if {[lsearch -exact $opt useexpire] != -1} {
-            if {rand() < 0.1} {
-                {*}$r expire [randomKey] [randomInt 2]
-            }
-        }
-
-        randpath {
-            set d [expr {rand()}]
-        } {
-            set d [expr {rand()}]
-        } {
-            set d [expr {rand()}]
-        } {
-            set d [expr {rand()}]
-        } {
-            set d [expr {rand()}]
-        } {
-            randpath {set d +inf} {set d -inf}
-        }
-        set t [{*}$r type $k]
-
-        if {$t eq {none}} {
-            randpath {
-                {*}$r set $k $v
-            } {
-                {*}$r lpush $k $v
-            } {
-                {*}$r sadd $k $v
-            } {
-                {*}$r zadd $k $d $v
-            } {
-                {*}$r hset $k $f $v
-            } {
-                {*}$r del $k
-            }
-            set t [{*}$r type $k]
-        }
-
-        switch $t {
-            {string} {
-                # Nothing to do
-            }
-            {list} {
-                randpath {{*}$r lpush $k $v} \
-                        {{*}$r rpush $k $v} \
-                        {{*}$r lrem $k 0 $v} \
-                        {{*}$r rpop $k} \
-                        {{*}$r lpop $k}
-            }
-            {set} {
-                randpath {{*}$r sadd $k $v} \
-                        {{*}$r srem $k $v} \
-                        {
-                            set otherset [findKeyWithType {*}$r set]
-                            if {$otherset ne {}} {
-                                randpath {
-                                    {*}$r sunionstore $k2 $k $otherset
-                                } {
-                                    {*}$r sinterstore $k2 $k $otherset
-                                } {
-                                    {*}$r sdiffstore $k2 $k $otherset
-                                }
-                            }
-                        }
-            }
-            {zset} {
-                randpath {{*}$r zadd $k $d $v} \
-                        {{*}$r zrem $k $v} \
-                        {
-                            set otherzset [findKeyWithType {*}$r zset]
-                            if {$otherzset ne {}} {
-                                randpath {
-                                    {*}$r zunionstore $k2 2 $k $otherzset
-                                } {
-                                    {*}$r zinterstore $k2 2 $k $otherzset
-                                }
-                            }
-                        }
-            }
-            {hash} {
-                randpath {{*}$r hset $k $f $v} \
-                        {{*}$r hdel $k $f}
-            }
-        }
-    }
-}
-
-proc formatCommand {args} {
-    set cmd "*[llength $args]\r\n"
-    foreach a $args {
-        append cmd "$[string length $a]\r\n$a\r\n"
-    }
-    set _ $cmd
-}
-
-proc csvdump r {
-    set o {}
-    for {set db 0} {$db < 16} {incr db} {
-        {*}$r select $db
-        foreach k [lsort [{*}$r keys *]] {
-            set type [{*}$r type $k]
-            append o [csvstring $db] , [csvstring $k] , [csvstring $type] ,
-            switch $type {
-                string {
-                    append o [csvstring [{*}$r get $k]] "\n"
-                }
-                list {
-                    foreach e [{*}$r lrange $k 0 -1] {
-                        append o [csvstring $e] ,
-                    }
-                    append o "\n"
-                }
-                set {
-                    foreach e [lsort [{*}$r smembers $k]] {
-                        append o [csvstring $e] ,
-                    }
-                    append o "\n"
-                }
-                zset {
-                    foreach e [{*}$r zrange $k 0 -1 withscores] {
-                        append o [csvstring $e] ,
-                    }
-                    append o "\n"
-                }
-                hash {
-                    set fields [{*}$r hgetall $k]
-                    set newfields {}
-                    foreach {k v} $fields {
-                        lappend newfields [list $k $v]
-                    }
-                    set fields [lsort -index 0 $newfields]
-                    foreach kv $fields {
-                        append o [csvstring [lindex $kv 0]] ,
-                        append o [csvstring [lindex $kv 1]] ,
-                    }
-                    append o "\n"
-                }
-            }
-        }
-    }
-    {*}$r select 9
-    return $o
-}
-
-proc csvstring s {
-    return "\"$s\""
-}
-
-proc roundFloat f {
-    format "%.10g" $f
-}
-
-set ::last_port_attempted 0
-proc find_available_port {start count} {
-    set port [expr $::last_port_attempted + 1]
-    for {set attempts 0} {$attempts < $count} {incr attempts} {
-        if {$port < $start || $port >= $start+$count} {
-            set port $start
-        }
-        if {[catch {set fd1 [socket 127.0.0.1 $port]}] &&
-            [catch {set fd2 [socket 127.0.0.1 [expr $port+10000]]}]} {
-            set ::last_port_attempted $port
-            return $port
-        } else {
-            catch {
-                close $fd1
-                close $fd2
-            }
-        }
-        incr port
-    }
-    error "Can't find a non busy port in the $start-[expr {$start+$count-1}] range."
-}
-
-# Test if TERM looks like to support colors
-proc color_term {} {
-    expr {[info exists ::env(TERM)] && [string match *xterm* $::env(TERM)]}
-}
-
-proc colorstr {color str} {
-    if {[color_term]} {
-        set b 0
-        if {[string range $color 0 4] eq {bold-}} {
-            set b 1
-            set color [string range $color 5 end]
-        }
-        switch $color {
-            red {set colorcode {31}}
-            green {set colorcode {32}}
-            yellow {set colorcode {33}}
-            blue {set colorcode {34}}
-            magenta {set colorcode {35}}
-            cyan {set colorcode {36}}
-            white {set colorcode {37}}
-            default {set colorcode {37}}
-        }
-        if {$colorcode ne {}} {
-            return "\033\[$b;${colorcode};49m$str\033\[0m"
-        }
-    } else {
-        return $str
-    }
-}
-
-proc find_valgrind_errors {stderr on_termination} {
-    set fd [open $stderr]
-    set buf [read $fd]
-    close $fd
-
-    # Look for stack trace (" at 0x") and other errors (Invalid, Mismatched, etc).
-    # Look for "Warnings", but not the "set address range perms". These don't indicate any real concern.
-    # corrupt-dump unit, not sure why but it seems they don't indicate any real concern.
-    if {[regexp -- { at 0x} $buf] ||
-        [regexp -- {^(?=.*Warning)(?:(?!set address range perms).)*$} $buf] ||
-        [regexp -- {Invalid} $buf] ||
-        [regexp -- {Mismatched} $buf] ||
-        [regexp -- {uninitialized} $buf] ||
-        [regexp -- {has a fishy} $buf] ||
-        [regexp -- {overlap} $buf]} {
-        return $buf
-    }
-
-    # If the process didn't terminate yet, we can't look for the summary report
-    if {!$on_termination} {
-        return ""
-    }
-
-    # Look for the absense of a leak free summary (happens when redis isn't terminated properly).
-    if {(![regexp -- {definitely lost: 0 bytes} $buf] &&
-         ![regexp -- {no leaks are possible} $buf])} {
-        return $buf
-    }
-
-    return ""
-}
-
-# Execute a background process writing random data for the specified number
-# of seconds to the specified Redis instance.
-proc start_write_load {host port seconds} {
-    set tclsh [info nameofexecutable]
-    exec $tclsh tests/helpers/gen_write_load.tcl $host $port $seconds $::tls &
-}
-
-# Stop a process generating write load executed with start_write_load.
-proc stop_write_load {handle} {
-    catch {exec /bin/kill -9 $handle}
-}
-
-proc wait_load_handlers_disconnected {{level 0}} {
-    wait_for_condition 50 100 {
-        ![string match {*name=LOAD_HANDLER*} [r $level client list]]
-    } else {
-        fail "load_handler(s) still connected after too long time."
-    }
-}
-
-proc K { x y } { set x } 
-
-# Shuffle a list with Fisher-Yates algorithm.
-proc lshuffle {list} {
-    set n [llength $list]
-    while {$n>1} {
-        set j [expr {int(rand()*$n)}]
-        incr n -1
-        if {$n==$j} continue
-        set v [lindex $list $j]
-        lset list $j [lindex $list $n]
-        lset list $n $v
-    }
-    return $list
-}
-
-# Execute a background process writing complex data for the specified number
-# of ops to the specified Redis instance.
-proc start_bg_complex_data {host port db ops} {
-    set tclsh [info nameofexecutable]
-    exec $tclsh tests/helpers/bg_complex_data.tcl $host $port $db $ops $::tls &
-}
-
-# Stop a process generating write load executed with start_bg_complex_data.
-proc stop_bg_complex_data {handle} {
-    catch {exec /bin/kill -9 $handle}
-}
-
-proc populate {num prefix size} {
-    set rd [redis_deferring_client]
-    for {set j 0} {$j < $num} {incr j} {
-        $rd set $prefix$j [string repeat A $size]
-    }
-    for {set j 0} {$j < $num} {incr j} {
-        $rd read
-    }
-    $rd close
-}
-
-proc get_child_pid {idx} {
-    set pid [srv $idx pid]
-    if {[file exists "/usr/bin/pgrep"]} {
-        set fd [open "|pgrep -P $pid" "r"]
-        set child_pid [string trim [lindex [split [read $fd] \n] 0]]
-    } else {
-        set fd [open "|ps --ppid $pid -o pid" "r"]
-        set child_pid [string trim [lindex [split [read $fd] \n] 1]]
-    }
-    close $fd
-
-    return $child_pid
-}
-
-proc cmdrstat {cmd r} {
-    if {[regexp "\r\ncmdstat_$cmd:(.*?)\r\n" [$r info commandstats] _ value]} {
-        set _ $value
-    }
-}
-
-proc errorrstat {cmd r} {
-    if {[regexp "\r\nerrorstat_$cmd:(.*?)\r\n" [$r info errorstats] _ value]} {
-        set _ $value
-    }
-}
-
-proc generate_fuzzy_traffic_on_key {key duration} {
-    # Commands per type, blocking commands removed
-    # TODO: extract these from help.h or elsewhere, and improve to include other types
-    set string_commands {APPEND BITCOUNT BITFIELD BITOP BITPOS DECR DECRBY GET GETBIT GETRANGE GETSET INCR INCRBY INCRBYFLOAT MGET MSET MSETNX PSETEX SET SETBIT SETEX SETNX SETRANGE STRALGO STRLEN}
-    set hash_commands {HDEL HEXISTS HGET HGETALL HINCRBY HINCRBYFLOAT HKEYS HLEN HMGET HMSET HSCAN HSET HSETNX HSTRLEN HVALS HRANDFIELD}
-    set zset_commands {ZADD ZCARD ZCOUNT ZINCRBY ZINTERSTORE ZLEXCOUNT ZPOPMAX ZPOPMIN ZRANGE ZRANGEBYLEX ZRANGEBYSCORE ZRANK ZREM ZREMRANGEBYLEX ZREMRANGEBYRANK ZREMRANGEBYSCORE ZREVRANGE ZREVRANGEBYLEX ZREVRANGEBYSCORE ZREVRANK ZSCAN ZSCORE ZUNIONSTORE ZRANDMEMBER}
-    set list_commands {LINDEX LINSERT LLEN LPOP LPOS LPUSH LPUSHX LRANGE LREM LSET LTRIM RPOP RPOPLPUSH RPUSH RPUSHX}
-    set set_commands {SADD SCARD SDIFF SDIFFSTORE SINTER SINTERSTORE SISMEMBER SMEMBERS SMOVE SPOP SRANDMEMBER SREM SSCAN SUNION SUNIONSTORE}
-    set stream_commands {XACK XADD XCLAIM XDEL XGROUP XINFO XLEN XPENDING XRANGE XREAD XREADGROUP XREVRANGE XTRIM}
-    set commands [dict create string $string_commands hash $hash_commands zset $zset_commands list $list_commands set $set_commands stream $stream_commands]
-
-    set type [r type $key]
-    set cmds [dict get $commands $type]
-    set start_time [clock seconds]
-    set sent {}
-    set succeeded 0
-    while {([clock seconds]-$start_time) < $duration} {
-        # find a random command for our key type
-        set cmd_idx [expr {int(rand()*[llength $cmds])}]
-        set cmd [lindex $cmds $cmd_idx]
-        # get the command details from redis
-        if { [ catch {
-            set cmd_info [lindex [r command info $cmd] 0]
-        } err ] } {
-            # if we failed, it means redis crashed after the previous command
-            return $sent
-        }
-        # try to build a valid command argument
-        set arity [lindex $cmd_info 1]
-        set arity [expr $arity < 0 ? - $arity: $arity]
-        set firstkey [lindex $cmd_info 3]
-        set lastkey [lindex $cmd_info 4]
-        set i 1
-        if {$cmd == "XINFO"} {
-            lappend cmd "STREAM"
-            lappend cmd $key
-            lappend cmd "FULL"
-            incr i 3
-        }
-        if {$cmd == "XREAD"} {
-            lappend cmd "STREAMS"
-            lappend cmd $key
-            randpath {
-                lappend cmd \$
-            } {
-                lappend cmd [randomValue]
-            }
-            incr i 3
-        }
-        if {$cmd == "XADD"} {
-            lappend cmd $key
-            randpath {
-                lappend cmd "*"
-            } {
-                lappend cmd [randomValue]
-            }
-            lappend cmd [randomValue]
-            lappend cmd [randomValue]
-            incr i 4
-        }
-        for {} {$i < $arity} {incr i} {
-            if {$i == $firstkey || $i == $lastkey} {
-                lappend cmd $key
-            } else {
-                lappend cmd [randomValue]
-            }
-        }
-        # execute the command, we expect commands to fail on syntax errors
-        lappend sent $cmd
-        if { ! [ catch {
-            r {*}$cmd
-        } err ] } {
-            incr succeeded
-        }
-    }
-
-    # print stats so that we know if we managed to generate commands that actually made senes
-    #if {$::verbose} {
-    #    set count [llength $sent]
-    #    puts "Fuzzy traffic sent: $count, succeeded: $succeeded"
-    #}
-
-    # return the list of commands we sent
-    return $sent
-}
-
-# write line to server log file
-proc write_log_line {srv_idx msg} {
-    set logfile [srv $srv_idx stdout]
-    set fd [open $logfile "a+"]
-    puts $fd "### $msg"
-    close $fd
-}
-
-proc string2printable s {
-    set res {}
-    set has_special_chars false
-    foreach i [split $s {}] {
-        scan $i %c int
-        # non printable characters, including space and excluding: " \ $ { }
-        if {$int < 32 || $int > 122 || $int == 34 || $int == 36 || $int == 92} {
-            set has_special_chars true
-        }
-        # TCL8.5 has issues mixing \x notation and normal chars in the same
-        # source code string, so we'll convert the entire string.
-        append res \\x[format %02X $int]
-    }
-    if {!$has_special_chars} {
-        return $s
-    }
-    set res "\"$res\""
-    return $res
-}
-
-# Calculation value of Chi-Square Distribution. By this value
-# we can verify the random distribution sample confidence.
-# Based on the following wiki:
-# https://en.wikipedia.org/wiki/Chi-square_distribution
-#
-# param res    Random sample list
-# return       Value of Chi-Square Distribution
-#
-# x2_value: return of chi_square_value function
-# df: Degrees of freedom, Number of independent values minus 1
-#
-# By using x2_value and df to back check the cardinality table,
-# we can know the confidence of the random sample.
-proc chi_square_value {res} {
-    unset -nocomplain mydict
-    foreach key $res {
-        dict incr mydict $key 1
-    }
-
-    set x2_value 0
-    set p [expr [llength $res] / [dict size $mydict]]
-    foreach key [dict keys $mydict] {
-        set value [dict get $mydict $key]
-
-        # Aggregate the chi-square value of each element
-        set v [expr {pow($value - $p, 2) / $p}]
-        set x2_value [expr {$x2_value + $v}]
-    }
-
-    return $x2_value
-}
-
-#subscribe to Pub/Sub channels
-proc consume_subscribe_messages {client type channels} {
-    set numsub -1
-    set counts {}
-
-    for {set i [llength $channels]} {$i > 0} {incr i -1} {
-        set msg [$client read]
-        assert_equal $type [lindex $msg 0]
-
-        # when receiving subscribe messages the channels names
-        # are ordered. when receiving unsubscribe messages
-        # they are unordered
-        set idx [lsearch -exact $channels [lindex $msg 1]]
-        if {[string match "*unsubscribe" $type]} {
-            assert {$idx >= 0}
-        } else {
-            assert {$idx == 0}
-        }
-        set channels [lreplace $channels $idx $idx]
-
-        # aggregate the subscription count to return to the caller
-        lappend counts [lindex $msg 2]
-    }
-
-    # we should have received messages for channels
-    assert {[llength $channels] == 0}
-    return $counts
-}
-
-proc subscribe {client channels} {
-    $client subscribe {*}$channels
-    consume_subscribe_messages $client subscribe $channels
-}
-
-proc unsubscribe {client {channels {}}} {
-    $client unsubscribe {*}$channels
-    consume_subscribe_messages $client unsubscribe $channels
-}
-
-proc psubscribe {client channels} {
-    $client psubscribe {*}$channels
-    consume_subscribe_messages $client psubscribe $channels
-}
-
-proc punsubscribe {client {channels {}}} {
-    $client punsubscribe {*}$channels
-    consume_subscribe_messages $client punsubscribe $channels
-}
\ No newline at end of file
diff --git a/redis-stable/tests/test_helper.tcl b/redis-stable/tests/test_helper.tcl
deleted file mode 100644
index 3c7d46d5..00000000
--- a/redis-stable/tests/test_helper.tcl
+++ /dev/null
@@ -1,822 +0,0 @@
-# Redis test suite. Copyright (C) 2009 Salvatore Sanfilippo antirez@gmail.com
-# This software is released under the BSD License. See the COPYING file for
-# more information.
-
-package require Tcl 8.5
-
-set tcl_precision 17
-source tests/support/redis.tcl
-source tests/support/server.tcl
-source tests/support/tmpfile.tcl
-source tests/support/test.tcl
-source tests/support/util.tcl
-
-set ::all_tests {
-    unit/printver
-    unit/dump
-    unit/auth
-    unit/protocol
-    unit/keyspace
-    unit/scan
-    unit/info
-    unit/type/string
-    unit/type/incr
-    unit/type/list
-    unit/type/list-2
-    unit/type/list-3
-    unit/type/set
-    unit/type/zset
-    unit/type/hash
-    unit/type/stream
-    unit/type/stream-cgroups
-    unit/sort
-    unit/expire
-    unit/other
-    unit/multi
-    unit/quit
-    unit/aofrw
-    unit/acl
-    unit/latency-monitor
-    integration/block-repl
-    integration/replication
-    integration/replication-2
-    integration/replication-3
-    integration/replication-4
-    integration/replication-psync
-    integration/aof
-    integration/rdb
-    integration/corrupt-dump
-    integration/corrupt-dump-fuzzer
-    integration/convert-zipmap-hash-on-load
-    integration/logging
-    integration/psync2
-    integration/psync2-reg
-    integration/psync2-pingoff
-    integration/failover
-    integration/redis-cli
-    integration/redis-benchmark
-    unit/pubsub
-    unit/slowlog
-    unit/scripting
-    unit/maxmemory
-    unit/introspection
-    unit/introspection-2
-    unit/limits
-    unit/obuf-limits
-    unit/bitops
-    unit/bitfield
-    unit/geo
-    unit/memefficiency
-    unit/hyperloglog
-    unit/lazyfree
-    unit/wait
-    unit/pendingquerybuf
-    unit/tls
-    unit/tracking
-    unit/oom-score-adj
-    unit/shutdown
-    unit/networking
-}
-# Index to the next test to run in the ::all_tests list.
-set ::next_test 0
-
-set ::host 127.0.0.1
-set ::port 6379; # port for external server
-set ::baseport 21111; # initial port for spawned redis servers
-set ::portcount 8000; # we don't wanna use more than 10000 to avoid collision with cluster bus ports
-set ::traceleaks 0
-set ::valgrind 0
-set ::durable 0
-set ::tls 0
-set ::stack_logging 0
-set ::verbose 0
-set ::quiet 0
-set ::denytags {}
-set ::skiptests {}
-set ::skipunits {}
-set ::no_latency 0
-set ::allowtags {}
-set ::only_tests {}
-set ::single_tests {}
-set ::run_solo_tests {}
-set ::skip_till ""
-set ::external 0; # If "1" this means, we are running against external instance
-set ::file ""; # If set, runs only the tests in this comma separated list
-set ::curfile ""; # Hold the filename of the current suite
-set ::accurate 0; # If true runs fuzz tests with more iterations
-set ::force_failure 0
-set ::timeout 1200; # 20 minutes without progresses will quit the test.
-set ::last_progress [clock seconds]
-set ::active_servers {} ; # Pids of active Redis instances.
-set ::dont_clean 0
-set ::wait_server 0
-set ::stop_on_failure 0
-set ::dump_logs 0
-set ::loop 0
-set ::tlsdir "tests/tls"
-
-# Set to 1 when we are running in client mode. The Redis test uses a
-# server-client model to run tests simultaneously. The server instance
-# runs the specified number of client instances that will actually run tests.
-# The server is responsible of showing the result to the user, and exit with
-# the appropriate exit code depending on the test outcome.
-set ::client 0
-set ::numclients 16
-
-# This function is called by one of the test clients when it receives
-# a "run" command from the server, with a filename as data.
-# It will run the specified test source file and signal it to the
-# test server when finished.
-proc execute_test_file name {
-    set path "tests/$name.tcl"
-    set ::curfile $path
-    source $path
-    send_data_packet $::test_server_fd done "$name"
-}
-
-# This function is called by one of the test clients when it receives
-# a "run_code" command from the server, with a verbatim test source code
-# as argument, and an associated name.
-# It will run the specified code and signal it to the test server when
-# finished.
-proc execute_test_code {name filename code} {
-    set ::curfile $filename
-    eval $code
-    send_data_packet $::test_server_fd done "$name"
-}
-
-# Setup a list to hold a stack of server configs. When calls to start_server
-# are nested, use "srv 0 pid" to get the pid of the inner server. To access
-# outer servers, use "srv -1 pid" etcetera.
-set ::servers {}
-proc srv {args} {
-    set level 0
-    if {[string is integer [lindex $args 0]]} {
-        set level [lindex $args 0]
-        set property [lindex $args 1]
-    } else {
-        set property [lindex $args 0]
-    }
-    set srv [lindex $::servers end+$level]
-    dict get $srv $property
-}
-
-# Provide easy access to the client for the inner server. It's possible to
-# prepend the argument list with a negative level to access clients for
-# servers running in outer blocks.
-proc r {args} {
-    set level 0
-    if {[string is integer [lindex $args 0]]} {
-        set level [lindex $args 0]
-        set args [lrange $args 1 end]
-    }
-    [srv $level "client"] {*}$args
-}
-
-proc reconnect {args} {
-    set level [lindex $args 0]
-    if {[string length $level] == 0 || ![string is integer $level]} {
-        set level 0
-    }
-
-    set srv [lindex $::servers end+$level]
-    set host [dict get $srv "host"]
-    set port [dict get $srv "port"]
-    set config [dict get $srv "config"]
-    set client [redis $host $port 0 $::tls]
-    if {[dict exists $srv "client"]} {
-        set old [dict get $srv "client"]
-        $old close
-    }
-    dict set srv "client" $client
-
-    # select the right db when we don't have to authenticate
-    if {![dict exists $config "requirepass"]} {
-        $client select 9
-    }
-
-    # re-set $srv in the servers list
-    lset ::servers end+$level $srv
-}
-
-proc redis_deferring_client {args} {
-    set level 0
-    if {[llength $args] > 0 && [string is integer [lindex $args 0]]} {
-        set level [lindex $args 0]
-        set args [lrange $args 1 end]
-    }
-
-    # create client that defers reading reply
-    set client [redis [srv $level "host"] [srv $level "port"] 1 $::tls]
-
-    # select the right db and read the response (OK)
-    $client select 9
-    $client read
-    return $client
-}
-
-proc redis_client {args} {
-    set level 0
-    if {[llength $args] > 0 && [string is integer [lindex $args 0]]} {
-        set level [lindex $args 0]
-        set args [lrange $args 1 end]
-    }
-
-    # create client that defers reading reply
-    set client [redis [srv $level "host"] [srv $level "port"] 0 $::tls]
-
-    # select the right db and read the response (OK)
-    $client select 9
-    return $client
-}
-
-# Provide easy access to INFO properties. Same semantic as "proc r".
-proc s {args} {
-    set level 0
-    if {[string is integer [lindex $args 0]]} {
-        set level [lindex $args 0]
-        set args [lrange $args 1 end]
-    }
-    status [srv $level "client"] [lindex $args 0]
-}
-
-# Test wrapped into run_solo are sent back from the client to the
-# test server, so that the test server will send them again to
-# clients once the clients are idle.
-proc run_solo {name code} {
-    if {$::numclients == 1 || $::loop || $::external} {
-        # run_solo is not supported in these scenarios, just run the code.
-        eval $code
-        return
-    }
-    send_data_packet $::test_server_fd run_solo [list $name $::curfile $code]
-}
-
-proc cleanup {} {
-    if {!$::quiet} {puts -nonewline "Cleanup: may take some time... "}
-    flush stdout
-    catch {exec rm -rf {*}[glob tests/tmp/redis.conf.*]}
-    catch {exec rm -rf {*}[glob tests/tmp/server.*]}
-    if {!$::quiet} {puts "OK"}
-}
-
-proc test_server_main {} {
-    cleanup
-    set tclsh [info nameofexecutable]
-    # Open a listening socket, trying different ports in order to find a
-    # non busy one.
-    set clientport [find_available_port [expr {$::baseport - 32}] 32]
-    if {!$::quiet} {
-        puts "Starting test server at port $clientport"
-    }
-    socket -server accept_test_clients  -myaddr 127.0.0.1 $clientport
-
-    # Start the client instances
-    set ::clients_pids {}
-    if {$::external} {
-        set p [exec $tclsh [info script] {*}$::argv \
-            --client $clientport &]
-        lappend ::clients_pids $p
-    } else {
-        set start_port $::baseport
-        set port_count [expr {$::portcount / $::numclients}]
-        for {set j 0} {$j < $::numclients} {incr j} {
-            set p [exec $tclsh [info script] {*}$::argv \
-                --client $clientport --baseport $start_port --portcount $port_count &]
-            lappend ::clients_pids $p
-            incr start_port $port_count
-        }
-    }
-
-    # Setup global state for the test server
-    set ::idle_clients {}
-    set ::active_clients {}
-    array set ::active_clients_task {}
-    array set ::clients_start_time {}
-    set ::clients_time_history {}
-    set ::failed_tests {}
-
-    # Enter the event loop to handle clients I/O
-    after 100 test_server_cron
-    vwait forever
-}
-
-# This function gets called 10 times per second.
-proc test_server_cron {} {
-    set elapsed [expr {[clock seconds]-$::last_progress}]
-
-    if {$elapsed > $::timeout} {
-        set err "\[[colorstr red TIMEOUT]\]: clients state report follows."
-        puts $err
-        lappend ::failed_tests $err
-        show_clients_state
-        kill_clients
-        force_kill_all_servers
-        the_end
-    }
-
-    after 100 test_server_cron
-}
-
-proc accept_test_clients {fd addr port} {
-    fconfigure $fd -encoding binary
-    fileevent $fd readable [list read_from_test_client $fd]
-}
-
-# This is the readable handler of our test server. Clients send us messages
-# in the form of a status code such and additional data. Supported
-# status types are:
-#
-# ready: the client is ready to execute the command. Only sent at client
-#        startup. The server will queue the client FD in the list of idle
-#        clients.
-# testing: just used to signal that a given test started.
-# ok: a test was executed with success.
-# err: a test was executed with an error.
-# skip: a test was skipped by skipfile or individual test options.
-# ignore: a test was skipped by a group tag.
-# exception: there was a runtime exception while executing the test.
-# done: all the specified test file was processed, this test client is
-#       ready to accept a new task.
-proc read_from_test_client fd {
-    set bytes [gets $fd]
-    set payload [read $fd $bytes]
-    foreach {status data} $payload break
-    set ::last_progress [clock seconds]
-
-    if {$status eq {ready}} {
-        if {!$::quiet} {
-            puts "\[$status\]: $data"
-        }
-        signal_idle_client $fd
-    } elseif {$status eq {done}} {
-        set elapsed [expr {[clock seconds]-$::clients_start_time($fd)}]
-        set all_tests_count [llength $::all_tests]
-        set running_tests_count [expr {[llength $::active_clients]-1}]
-        set completed_tests_count [expr {$::next_test-$running_tests_count}]
-        puts "\[$completed_tests_count/$all_tests_count [colorstr yellow $status]\]: $data ($elapsed seconds)"
-        lappend ::clients_time_history $elapsed $data
-        signal_idle_client $fd
-        set ::active_clients_task($fd) "(DONE) $data"
-    } elseif {$status eq {ok}} {
-        if {!$::quiet} {
-            puts "\[[colorstr green $status]\]: $data"
-        }
-        set ::active_clients_task($fd) "(OK) $data"
-    } elseif {$status eq {skip}} {
-        if {!$::quiet} {
-            puts "\[[colorstr yellow $status]\]: $data"
-        }
-    } elseif {$status eq {ignore}} {
-        if {!$::quiet} {
-            puts "\[[colorstr cyan $status]\]: $data"
-        }
-    } elseif {$status eq {err}} {
-        set err "\[[colorstr red $status]\]: $data"
-        puts $err
-        lappend ::failed_tests $err
-        set ::active_clients_task($fd) "(ERR) $data"
-        if {$::stop_on_failure} {
-            puts -nonewline "(Test stopped, press enter to resume the tests)"
-            flush stdout
-            gets stdin
-        }
-    } elseif {$status eq {exception}} {
-        puts "\[[colorstr red $status]\]: $data"
-        kill_clients
-        force_kill_all_servers
-        exit 1
-    } elseif {$status eq {testing}} {
-        set ::active_clients_task($fd) "(IN PROGRESS) $data"
-    } elseif {$status eq {server-spawning}} {
-        set ::active_clients_task($fd) "(SPAWNING SERVER) $data"
-    } elseif {$status eq {server-spawned}} {
-        lappend ::active_servers $data
-        set ::active_clients_task($fd) "(SPAWNED SERVER) pid:$data"
-    } elseif {$status eq {server-killing}} {
-        set ::active_clients_task($fd) "(KILLING SERVER) pid:$data"
-    } elseif {$status eq {server-killed}} {
-        set ::active_servers [lsearch -all -inline -not -exact $::active_servers $data]
-        set ::active_clients_task($fd) "(KILLED SERVER) pid:$data"
-    } elseif {$status eq {run_solo}} {
-        lappend ::run_solo_tests $data
-    } else {
-        if {!$::quiet} {
-            puts "\[$status\]: $data"
-        }
-    }
-}
-
-proc show_clients_state {} {
-    # The following loop is only useful for debugging tests that may
-    # enter an infinite loop.
-    foreach x $::active_clients {
-        if {[info exist ::active_clients_task($x)]} {
-            puts "$x => $::active_clients_task($x)"
-        } else {
-            puts "$x => ???"
-        }
-    }
-}
-
-proc kill_clients {} {
-    foreach p $::clients_pids {
-        catch {exec kill $p}
-    }
-}
-
-proc force_kill_all_servers {} {
-    foreach p $::active_servers {
-        puts "Killing still running Redis server $p"
-        catch {exec kill -9 $p}
-    }
-}
-
-proc lpop {listVar {count 1}} {
-    upvar 1 $listVar l
-    set ele [lindex $l 0]
-    set l [lrange $l 1 end]
-    set ele
-}
-
-proc lremove {listVar value} {
-    upvar 1 $listVar var
-    set idx [lsearch -exact $var $value]
-    set var [lreplace $var $idx $idx]
-}
-
-# A new client is idle. Remove it from the list of active clients and
-# if there are still test units to run, launch them.
-proc signal_idle_client fd {
-    # Remove this fd from the list of active clients.
-    set ::active_clients \
-        [lsearch -all -inline -not -exact $::active_clients $fd]
-
-    # New unit to process?
-    if {$::next_test != [llength $::all_tests]} {
-        if {!$::quiet} {
-            puts [colorstr bold-white "Testing [lindex $::all_tests $::next_test]"]
-            set ::active_clients_task($fd) "ASSIGNED: $fd ([lindex $::all_tests $::next_test])"
-        }
-        set ::clients_start_time($fd) [clock seconds]
-        send_data_packet $fd run [lindex $::all_tests $::next_test]
-        lappend ::active_clients $fd
-        incr ::next_test
-        if {$::loop && $::next_test == [llength $::all_tests]} {
-            set ::next_test 0
-        }
-    } elseif {[llength $::run_solo_tests] != 0 && [llength $::active_clients] == 0} {
-        if {!$::quiet} {
-            puts [colorstr bold-white "Testing solo test"]
-            set ::active_clients_task($fd) "ASSIGNED: $fd solo test"
-        }
-        set ::clients_start_time($fd) [clock seconds]
-        send_data_packet $fd run_code [lpop ::run_solo_tests]
-        lappend ::active_clients $fd
-    } else {
-        lappend ::idle_clients $fd
-        set ::active_clients_task($fd) "SLEEPING, no more units to assign"
-        if {[llength $::active_clients] == 0} {
-            the_end
-        }
-    }
-}
-
-# The the_end function gets called when all the test units were already
-# executed, so the test finished.
-proc the_end {} {
-    # TODO: print the status, exit with the right exit code.
-    puts "\n                   The End\n"
-    puts "Execution time of different units:"
-    foreach {time name} $::clients_time_history {
-        puts "  $time seconds - $name"
-    }
-    if {[llength $::failed_tests]} {
-        puts "\n[colorstr bold-red {!!! WARNING}] The following tests failed:\n"
-        foreach failed $::failed_tests {
-            puts "*** $failed"
-        }
-        if {!$::dont_clean} cleanup
-        exit 1
-    } else {
-        puts "\n[colorstr bold-white {\o/}] [colorstr bold-green {All tests passed without errors!}]\n"
-        if {!$::dont_clean} cleanup
-        exit 0
-    }
-}
-
-# The client is not even driven (the test server is instead) as we just need
-# to read the command, execute, reply... all this in a loop.
-proc test_client_main server_port {
-    set ::test_server_fd [socket localhost $server_port]
-    fconfigure $::test_server_fd -encoding binary
-    send_data_packet $::test_server_fd ready [pid]
-    while 1 {
-        set bytes [gets $::test_server_fd]
-        set payload [read $::test_server_fd $bytes]
-        foreach {cmd data} $payload break
-        if {$cmd eq {run}} {
-            execute_test_file $data
-        } elseif {$cmd eq {run_code}} {
-            foreach {name filename code} $data break
-            execute_test_code $name $filename $code
-        } else {
-            error "Unknown test client command: $cmd"
-        }
-    }
-}
-
-proc send_data_packet {fd status data} {
-    set payload [list $status $data]
-    puts $fd [string length $payload]
-    puts -nonewline $fd $payload
-    flush $fd
-}
-
-proc print_help_screen {} {
-    puts [join {
-        "--valgrind         Run the test over valgrind."
-        "--durable          suppress test crashes and keep running"
-        "--stack-logging    Enable OSX leaks/malloc stack logging."
-        "--accurate         Run slow randomized tests for more iterations."
-        "--quiet            Don't show individual tests."
-        "--single <unit>    Just execute the specified unit (see next option). This option can be repeated."
-        "--verbose          Increases verbosity."
-        "--list-tests       List all the available test units."
-        "--only <test>      Just execute the specified test by test name. This option can be repeated."
-        "--skip-till <unit> Skip all units until (and including) the specified one."
-        "--skipunit <unit>  Skip one unit."
-        "--clients <num>    Number of test clients (default 16)."
-        "--timeout <sec>    Test timeout in seconds (default 10 min)."
-        "--force-failure    Force the execution of a test that always fails."
-        "--config <k> <v>   Extra config file argument."
-        "--skipfile <file>  Name of a file containing test names that should be skipped (one per line)."
-        "--skiptest <name>  Name of a file containing test names that should be skipped (one per line)."
-        "--dont-clean       Don't delete redis log files after the run."
-        "--no-latency       Skip latency measurements and validation by some tests."
-        "--stop             Blocks once the first test fails."
-        "--loop             Execute the specified set of tests forever."
-        "--wait-server      Wait after server is started (so that you can attach a debugger)."
-        "--dump-logs        Dump server log on test failure."
-        "--tls              Run tests in TLS mode."
-        "--host <addr>      Run tests against an external host."
-        "--port <port>      TCP port to use against external host."
-        "--baseport <port>  Initial port number for spawned redis servers."
-        "--portcount <num>  Port range for spawned redis servers."
-        "--help             Print this help screen."
-    } "\n"]
-}
-
-# parse arguments
-for {set j 0} {$j < [llength $argv]} {incr j} {
-    set opt [lindex $argv $j]
-    set arg [lindex $argv [expr $j+1]]
-    if {$opt eq {--tags}} {
-        foreach tag $arg {
-            if {[string index $tag 0] eq "-"} {
-                lappend ::denytags [string range $tag 1 end]
-            } else {
-                lappend ::allowtags $tag
-            }
-        }
-        incr j
-    } elseif {$opt eq {--config}} {
-        set arg2 [lindex $argv [expr $j+2]]
-        lappend ::global_overrides $arg
-        lappend ::global_overrides $arg2
-        incr j 2
-    } elseif {$opt eq {--skipfile}} {
-        incr j
-        set fp [open $arg r]
-        set file_data [read $fp]
-        close $fp
-        set ::skiptests [split $file_data "\n"]
-    } elseif {$opt eq {--skiptest}} {
-        lappend ::skiptests $arg
-        incr j
-    } elseif {$opt eq {--valgrind}} {
-        set ::valgrind 1
-    } elseif {$opt eq {--stack-logging}} {
-        if {[string match {*Darwin*} [exec uname -a]]} {
-            set ::stack_logging 1
-        }
-    } elseif {$opt eq {--quiet}} {
-        set ::quiet 1
-    } elseif {$opt eq {--tls}} {
-        package require tls 1.6
-        set ::tls 1
-        ::tls::init \
-            -cafile "$::tlsdir/ca.crt" \
-            -certfile "$::tlsdir/client.crt" \
-            -keyfile "$::tlsdir/client.key"
-    } elseif {$opt eq {--host}} {
-        set ::external 1
-        set ::host $arg
-        incr j
-    } elseif {$opt eq {--port}} {
-        set ::port $arg
-        incr j
-    } elseif {$opt eq {--baseport}} {
-        set ::baseport $arg
-        incr j
-    } elseif {$opt eq {--portcount}} {
-        set ::portcount $arg
-        incr j
-    } elseif {$opt eq {--accurate}} {
-        set ::accurate 1
-    } elseif {$opt eq {--force-failure}} {
-        set ::force_failure 1
-    } elseif {$opt eq {--single}} {
-        lappend ::single_tests $arg
-        incr j
-    } elseif {$opt eq {--only}} {
-        lappend ::only_tests $arg
-        incr j
-    } elseif {$opt eq {--skipunit}} {
-        lappend ::skipunits $arg
-        incr j
-    } elseif {$opt eq {--skip-till}} {
-        set ::skip_till $arg
-        incr j
-    } elseif {$opt eq {--list-tests}} {
-        foreach t $::all_tests {
-            puts $t
-        }
-        exit 0
-    } elseif {$opt eq {--verbose}} {
-        set ::verbose 1
-    } elseif {$opt eq {--client}} {
-        set ::client 1
-        set ::test_server_port $arg
-        incr j
-    } elseif {$opt eq {--clients}} {
-        set ::numclients $arg
-        incr j
-    } elseif {$opt eq {--durable}} {
-        set ::durable 1
-    } elseif {$opt eq {--dont-clean}} {
-        set ::dont_clean 1
-    } elseif {$opt eq {--no-latency}} {
-        set ::no_latency 1
-    } elseif {$opt eq {--wait-server}} {
-        set ::wait_server 1
-    } elseif {$opt eq {--dump-logs}} {
-        set ::dump_logs 1
-    } elseif {$opt eq {--stop}} {
-        set ::stop_on_failure 1
-    } elseif {$opt eq {--loop}} {
-        set ::loop 1
-    } elseif {$opt eq {--timeout}} {
-        set ::timeout $arg
-        incr j
-    } elseif {$opt eq {--help}} {
-        print_help_screen
-        exit 0
-    } else {
-        puts "Wrong argument: $opt"
-        exit 1
-    }
-}
-
-set filtered_tests {}
-
-# Set the filtered tests to be the short list (single_tests) if exists.
-# Otherwise, we start filtering all_tests
-if {[llength $::single_tests] > 0} {
-    set filtered_tests $::single_tests
-} else {
-    set filtered_tests $::all_tests
-}
-
-# If --skip-till option was given, we populate the list of single tests
-# to run with everything *after* the specified unit.
-if {$::skip_till != ""} {
-    set skipping 1
-    foreach t $::all_tests {
-        if {$skipping == 1} {
-            lremove filtered_tests $t
-        }
-        if {$t == $::skip_till} {
-            set skipping 0
-        }
-    }
-    if {$skipping} {
-        puts "test $::skip_till not found"
-        exit 0
-    }
-}
-
-# If --skipunits option was given, we populate the list of single tests
-# to run with everything *not* in the skipunits list.
-if {[llength $::skipunits] > 0} {
-    foreach t $::all_tests {
-        if {[lsearch $::skipunits $t] != -1} {
-            lremove filtered_tests $t
-        }
-    }
-}
-
-# Override the list of tests with the specific tests we want to run
-# in case there was some filter, that is --single, -skipunit or --skip-till options.
-if {[llength $filtered_tests] < [llength $::all_tests]} {
-    set ::all_tests $filtered_tests
-}
-
-proc attach_to_replication_stream {} {
-    r config set repl-ping-replica-period 3600
-    if {$::tls} {
-        set s [::tls::socket [srv 0 "host"] [srv 0 "port"]]
-    } else {
-        set s [socket [srv 0 "host"] [srv 0 "port"]]
-    }
-    fconfigure $s -translation binary
-    puts -nonewline $s "SYNC\r\n"
-    flush $s
-
-    # Get the count
-    while 1 {
-        set count [gets $s]
-        set prefix [string range $count 0 0]
-        if {$prefix ne {}} break; # Newlines are allowed as PINGs.
-    }
-    if {$prefix ne {$}} {
-        error "attach_to_replication_stream error. Received '$count' as count."
-    }
-    set count [string range $count 1 end]
-
-    # Consume the bulk payload
-    while {$count} {
-        set buf [read $s $count]
-        set count [expr {$count-[string length $buf]}]
-    }
-    return $s
-}
-
-proc read_from_replication_stream {s} {
-    fconfigure $s -blocking 0
-    set attempt 0
-    while {[gets $s count] == -1} {
-        if {[incr attempt] == 10} return ""
-        after 100
-    }
-    fconfigure $s -blocking 1
-    set count [string range $count 1 end]
-
-    # Return a list of arguments for the command.
-    set res {}
-    for {set j 0} {$j < $count} {incr j} {
-        read $s 1
-        set arg [::redis::redis_bulk_read $s]
-        if {$j == 0} {set arg [string tolower $arg]}
-        lappend res $arg
-    }
-    return $res
-}
-
-proc assert_replication_stream {s patterns} {
-    for {set j 0} {$j < [llength $patterns]} {incr j} {
-        assert_match [lindex $patterns $j] [read_from_replication_stream $s]
-    }
-}
-
-proc close_replication_stream {s} {
-    close $s
-    r config set repl-ping-replica-period 10
-}
-
-# With the parallel test running multiple Redis instances at the same time
-# we need a fast enough computer, otherwise a lot of tests may generate
-# false positives.
-# If the computer is too slow we revert the sequential test without any
-# parallelism, that is, clients == 1.
-proc is_a_slow_computer {} {
-    set start [clock milliseconds]
-    for {set j 0} {$j < 1000000} {incr j} {}
-    set elapsed [expr [clock milliseconds]-$start]
-    expr {$elapsed > 200}
-}
-
-if {$::client} {
-    if {[catch { test_client_main $::test_server_port } err]} {
-        set estr "Executing test client: $err.\n$::errorInfo"
-        if {[catch {send_data_packet $::test_server_fd exception $estr}]} {
-            puts $estr
-        }
-        exit 1
-    }
-} else {
-    if {[is_a_slow_computer]} {
-        puts "** SLOW COMPUTER ** Using a single client to avoid false positives."
-        set ::numclients 1
-    }
-
-    if {[catch { test_server_main } err]} {
-        if {[string length $err] > 0} {
-            # only display error when not generated by the test suite
-            if {$err ne "exception"} {
-                puts $::errorInfo
-            }
-            exit 1
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/acl.tcl b/redis-stable/tests/unit/acl.tcl
deleted file mode 100644
index 3424c044..00000000
--- a/redis-stable/tests/unit/acl.tcl
+++ /dev/null
@@ -1,631 +0,0 @@
-start_server {tags {"acl"}} {
-    test {Connections start with the default user} {
-        r ACL WHOAMI
-    } {default}
-
-    test {It is possible to create new users} {
-        r ACL setuser newuser
-    }
-
-    test {New users start disabled} {
-        r ACL setuser newuser >passwd1
-        catch {r AUTH newuser passwd1} err
-        set err
-    } {*WRONGPASS*}
-
-    test {Enabling the user allows the login} {
-        r ACL setuser newuser on +acl
-        r AUTH newuser passwd1
-        r ACL WHOAMI
-    } {newuser}
-
-    test {Only the set of correct passwords work} {
-        r ACL setuser newuser >passwd2
-        catch {r AUTH newuser passwd1} e
-        assert {$e eq "OK"}
-        catch {r AUTH newuser passwd2} e
-        assert {$e eq "OK"}
-        catch {r AUTH newuser passwd3} e
-        set e
-    } {*WRONGPASS*}
-
-    test {It is possible to remove passwords from the set of valid ones} {
-        r ACL setuser newuser <passwd1
-        catch {r AUTH newuser passwd1} e
-        set e
-    } {*WRONGPASS*}
-
-    test {Test password hashes can be added} {
-        r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6
-        catch {r AUTH newuser passwd4} e
-        assert {$e eq "OK"}
-    }
-
-    test {Test password hashes validate input} {
-        # Validate Length
-        catch {r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e} e
-        # Validate character outside set
-        catch {r ACL setuser newuser #34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4eq} e
-        set e
-    } {*Error in ACL SETUSER modifier*}
-
-    test {ACL GETUSER returns the password hash instead of the actual password} {
-        set passstr [dict get [r ACL getuser newuser] passwords]
-        assert_match {*34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6*} $passstr
-        assert_no_match {*passwd4*} $passstr
-    }
-
-    test {Test hashed passwords removal} {
-        r ACL setuser newuser !34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6
-        set passstr [dict get [r ACL getuser newuser] passwords]
-        assert_no_match {*34344e4d60c2b6d639b7bd22e18f2b0b91bc34bf0ac5f9952744435093cfb4e6*} $passstr
-    }
-
-    test {By default users are not able to access any command} {
-        catch {r SET foo bar} e
-        set e
-    } {*NOPERM*}
-
-    test {By default users are not able to access any key} {
-        r ACL setuser newuser +set
-        catch {r SET foo bar} e
-        set e
-    } {*NOPERM*key*}
-
-    test {It's possible to allow the access of a subset of keys} {
-        r ACL setuser newuser allcommands ~foo:* ~bar:*
-        r SET foo:1 a
-        r SET bar:2 b
-        catch {r SET zap:3 c} e
-        r ACL setuser newuser allkeys; # Undo keys ACL
-        set e
-    } {*NOPERM*key*}
-
-    test {By default users are able to publish to any channel} {
-        r ACL setuser psuser on >pspass +acl +client +@pubsub
-        r AUTH psuser pspass
-        r PUBLISH foo bar
-    } {0}
-
-    test {By default users are able to subscribe to any channel} {
-        set rd [redis_deferring_client]
-        $rd AUTH psuser pspass
-        $rd read
-        $rd SUBSCRIBE foo
-        assert_match {subscribe foo 1} [$rd read]
-        $rd close
-    } {0}
-
-    test {By default users are able to subscribe to any pattern} {
-        set rd [redis_deferring_client]
-        $rd AUTH psuser pspass
-        $rd read
-        $rd PSUBSCRIBE bar*
-        assert_match {psubscribe bar\* 1} [$rd read]
-        $rd close
-    } {0}
-
-    test {It's possible to allow publishing to a subset of channels} {
-        r ACL setuser psuser resetchannels &foo:1 &bar:*
-        assert_equal {0} [r PUBLISH foo:1 somemessage]
-        assert_equal {0} [r PUBLISH bar:2 anothermessage]
-        catch {r PUBLISH zap:3 nosuchmessage} e
-        set e
-    } {*NOPERM*channel*}
-
-    test {Validate subset of channels is prefixed with resetchannels flag} {
-        r ACL setuser hpuser on nopass resetchannels &foo +@all
-
-        # Verify resetchannels flag is prefixed before the channel name(s)
-        set users [r ACL LIST]
-        set curruser "hpuser"
-        foreach user [lshuffle $users] {
-            if {[string first $curruser $user] != -1} {
-                assert_equal {user hpuser on nopass resetchannels &foo +@all} $user
-            }
-        }
-
-        # authenticate as hpuser
-        r AUTH hpuser pass
-
-        assert_equal {0} [r PUBLISH foo bar]
-        catch {r PUBLISH bar game} e
-
-        # Falling back to psuser for the below tests
-        r AUTH psuser pspass
-        r ACL deluser hpuser
-        set e
-    } {*NOPERM*channel*}
-
-    test {In transaction queue publish/subscribe/psubscribe to unauthorized channel will fail} {
-        r ACL setuser psuser +multi +discard
-        r MULTI
-        catch {r PUBLISH notexits helloworld} e
-        r DISCARD
-        assert_match {*NOPERM*} $e
-        r MULTI
-        catch {r SUBSCRIBE notexits foo:1} e
-        r DISCARD
-        assert_match {*NOPERM*} $e
-        r MULTI
-        catch {r PSUBSCRIBE notexits:* bar:*} e
-        r DISCARD
-        assert_match {*NOPERM*} $e
-    }
-
-    test {It's possible to allow subscribing to a subset of channels} {
-        set rd [redis_deferring_client]
-        $rd AUTH psuser pspass
-        $rd read
-        $rd SUBSCRIBE foo:1
-        assert_match {subscribe foo:1 1} [$rd read]
-        $rd SUBSCRIBE bar:2
-        assert_match {subscribe bar:2 2} [$rd read]
-        $rd SUBSCRIBE zap:3
-        catch {$rd read} e
-        set e
-    } {*NOPERM*channel*}
-
-    test {It's possible to allow subscribing to a subset of channel patterns} {
-        set rd [redis_deferring_client]
-        $rd AUTH psuser pspass
-        $rd read
-        $rd PSUBSCRIBE foo:1
-        assert_match {psubscribe foo:1 1} [$rd read]
-        $rd PSUBSCRIBE bar:*
-        assert_match {psubscribe bar:\* 2} [$rd read]
-        $rd PSUBSCRIBE bar:baz
-        catch {$rd read} e
-        set e
-    } {*NOPERM*channel*}
-    
-    test {Subscribers are killed when revoked of channel permission} {
-        set rd [redis_deferring_client]
-        r ACL setuser psuser resetchannels &foo:1
-        $rd AUTH psuser pspass
-        $rd read
-        $rd CLIENT SETNAME deathrow
-        $rd read
-        $rd SUBSCRIBE foo:1
-        $rd read
-        r ACL setuser psuser resetchannels
-        assert_no_match {*deathrow*} [r CLIENT LIST]
-        $rd close
-    } {0}
-
-    test {Subscribers are killed when revoked of pattern permission} {
-        set rd [redis_deferring_client]
-        r ACL setuser psuser resetchannels &bar:*
-        $rd AUTH psuser pspass
-        $rd read
-        $rd CLIENT SETNAME deathrow
-        $rd read
-        $rd PSUBSCRIBE bar:*
-        $rd read
-        r ACL setuser psuser resetchannels
-        assert_no_match {*deathrow*} [r CLIENT LIST]
-        $rd close
-    } {0}
-
-    test {Subscribers are pardoned if literal permissions are retained and/or gaining allchannels} {
-        set rd [redis_deferring_client]
-        r ACL setuser psuser resetchannels &foo:1 &bar:*
-        $rd AUTH psuser pspass
-        $rd read
-        $rd CLIENT SETNAME pardoned
-        $rd read
-        $rd SUBSCRIBE foo:1
-        $rd read
-        $rd PSUBSCRIBE bar:*
-        $rd read
-        r ACL setuser psuser resetchannels &foo:1 &bar:* &baz:qaz &zoo:*
-        assert_match {*pardoned*} [r CLIENT LIST]
-        r ACL setuser psuser allchannels
-        assert_match {*pardoned*} [r CLIENT LIST]
-        $rd close
-    } {0}
-
-    test {Users can be configured to authenticate with any password} {
-        r ACL setuser newuser nopass
-        r AUTH newuser zipzapblabla
-    } {OK}
-
-    test {ACLs can exclude single commands} {
-        r ACL setuser newuser -ping
-        r INCR mycounter ; # Should not raise an error
-        catch {r PING} e
-        set e
-    } {*NOPERM*}
-
-    test {ACLs can include or exclude whole classes of commands} {
-        r ACL setuser newuser -@all +@set +acl
-        r SADD myset a b c; # Should not raise an error
-        r ACL setuser newuser +@all -@string
-        r SADD myset a b c; # Again should not raise an error
-        # String commands instead should raise an error
-        catch {r SET foo bar} e
-        r ACL setuser newuser allcommands; # Undo commands ACL
-        set e
-    } {*NOPERM*}
-
-    test {ACLs can include single subcommands} {
-        r ACL setuser newuser +@all -client
-        r ACL setuser newuser +client|id +client|setname
-        r CLIENT ID; # Should not fail
-        r CLIENT SETNAME foo ; # Should not fail
-        catch {r CLIENT KILL type master} e
-        set e
-    } {*NOPERM*}
-
-    test {ACLs set can include subcommands, if already full command exists} {
-        r ACL setuser bob +memory|doctor
-        set cmdstr [dict get [r ACL getuser bob] commands]
-        assert_equal {-@all +memory|doctor} $cmdstr
-
-        # Validate the commands have got engulfed to +memory.
-        r ACL setuser bob +memory
-        set cmdstr [dict get [r ACL getuser bob] commands]
-        assert_equal {-@all +memory} $cmdstr
-
-        # Appending to the existing access string of bob.
-        r ACL setuser bob +@all +client|id
-        # Validate the new commands has got engulfed to +@all.
-        set cmdstr [dict get [r ACL getuser bob] commands]
-        assert_equal {+@all} $cmdstr
-        r CLIENT ID; # Should not fail
-        r MEMORY DOCTOR; # Should not fail
-    }
-
-    # Note that the order of the generated ACL rules is not stable in Redis
-    # so we need to match the different parts and not as a whole string.
-    test {ACL GETUSER is able to translate back command permissions} {
-        # Subtractive
-        r ACL setuser newuser reset +@all ~* -@string +incr -debug +debug|digest
-        set cmdstr [dict get [r ACL getuser newuser] commands]
-        assert_match {*+@all*} $cmdstr
-        assert_match {*-@string*} $cmdstr
-        assert_match {*+incr*} $cmdstr
-        assert_match {*-debug +debug|digest**} $cmdstr
-
-        # Additive
-        r ACL setuser newuser reset +@string -incr +acl +debug|digest +debug|segfault
-        set cmdstr [dict get [r ACL getuser newuser] commands]
-        assert_match {*-@all*} $cmdstr
-        assert_match {*+@string*} $cmdstr
-        assert_match {*-incr*} $cmdstr
-        assert_match {*+debug|digest*} $cmdstr
-        assert_match {*+debug|segfault*} $cmdstr
-        assert_match {*+acl*} $cmdstr
-    }
-
-    # A regression test make sure that as long as there is a simple
-    # category defining the commands, that it will be used as is.
-    test {ACL GETUSER provides reasonable results} {
-        set categories [r ACL CAT]
-
-        # Test that adding each single category will
-        # result in just that category with both +@all and -@all
-        foreach category $categories {
-            # Test for future commands where allowed
-            r ACL setuser additive reset +@all "-@$category"
-            set cmdstr [dict get [r ACL getuser additive] commands]
-            assert_equal "+@all -@$category" $cmdstr
-
-            # Test for future commands where disallowed
-            r ACL setuser restrictive reset -@all "+@$category"
-            set cmdstr [dict get [r ACL getuser restrictive] commands]
-            assert_equal "-@all +@$category" $cmdstr
-        }
-    }
-
-    test {ACL #5998 regression: memory leaks adding / removing subcommands} {
-        r AUTH default ""
-        r ACL setuser newuser reset -debug +debug|a +debug|b +debug|c
-        r ACL setuser newuser -debug
-        # The test framework will detect a leak if any.
-    }
-
-    test {ACL LOG shows failed command executions at toplevel} {
-        r ACL LOG RESET
-        r ACL setuser antirez >foo on +set ~object:1234
-        r ACL setuser antirez +eval +multi +exec
-        r ACL setuser antirez resetchannels +publish
-        r AUTH antirez foo
-        catch {r GET foo}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry username] eq {antirez}}
-        assert {[dict get $entry context] eq {toplevel}}
-        assert {[dict get $entry reason] eq {command}}
-        assert {[dict get $entry object] eq {get}}
-    }
-
-    test {ACL LOG is able to test similar events} {
-        r AUTH antirez foo
-        catch {r GET foo}
-        catch {r GET foo}
-        catch {r GET foo}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry count] == 4}
-    }
-
-    test {ACL LOG is able to log keys access violations and key name} {
-        r AUTH antirez foo
-        catch {r SET somekeynotallowed 1234}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry reason] eq {key}}
-        assert {[dict get $entry object] eq {somekeynotallowed}}
-    }
-
-    test {ACL LOG is able to log channel access violations and channel name} {
-        r AUTH antirez foo
-        catch {r PUBLISH somechannelnotallowed nullmsg}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry reason] eq {channel}}
-        assert {[dict get $entry object] eq {somechannelnotallowed}}
-    }
-
-    test {ACL LOG RESET is able to flush the entries in the log} {
-        r ACL LOG RESET
-        assert {[llength [r ACL LOG]] == 0}
-    }
-
-    test {ACL LOG can distinguish the transaction context (1)} {
-        r AUTH antirez foo
-        r MULTI
-        catch {r INCR foo}
-        catch {r EXEC}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry context] eq {multi}}
-        assert {[dict get $entry object] eq {incr}}
-    }
-
-    test {ACL LOG can distinguish the transaction context (2)} {
-        set rd1 [redis_deferring_client]
-        r ACL SETUSER antirez +incr
-
-        r AUTH antirez foo
-        r MULTI
-        r INCR object:1234
-        $rd1 ACL SETUSER antirez -incr
-        $rd1 read
-        catch {r EXEC}
-        $rd1 close
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry context] eq {multi}}
-        assert {[dict get $entry object] eq {incr}}
-        r ACL SETUSER antirez -incr
-    }
-
-    test {ACL can log errors in the context of Lua scripting} {
-        r AUTH antirez foo
-        catch {r EVAL {redis.call('incr','foo')} 0}
-        r AUTH default ""
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry context] eq {lua}}
-        assert {[dict get $entry object] eq {incr}}
-    }
-
-    test {ACL LOG can accept a numerical argument to show less entries} {
-        r AUTH antirez foo
-        catch {r INCR foo}
-        catch {r INCR foo}
-        catch {r INCR foo}
-        catch {r INCR foo}
-        r AUTH default ""
-        assert {[llength [r ACL LOG]] > 1}
-        assert {[llength [r ACL LOG 2]] == 2}
-    }
-
-    test {ACL LOG can log failed auth attempts} {
-        catch {r AUTH antirez wrong-password}
-        set entry [lindex [r ACL LOG] 0]
-        assert {[dict get $entry context] eq {toplevel}}
-        assert {[dict get $entry reason] eq {auth}}
-        assert {[dict get $entry object] eq {AUTH}}
-        assert {[dict get $entry username] eq {antirez}}
-    }
-
-    test {ACL LOG entries are limited to a maximum amount} {
-        r ACL LOG RESET
-        r CONFIG SET acllog-max-len 5
-        r AUTH antirez foo
-        for {set j 0} {$j < 10} {incr j} {
-            catch {r SET obj:$j 123}
-        }
-        r AUTH default ""
-        assert {[llength [r ACL LOG]] == 5}
-    }
-
-    test {When default user is off, new connections are not authenticated} {
-        r ACL setuser default off
-        catch {set rd1 [redis_deferring_client]} e
-        r ACL setuser default on
-        set e
-    } {*NOAUTH*}
-
-    test {When default user has no command permission, hello command still works for other users} {
-        r ACL setuser secure-user >supass on +@all
-        r ACL setuser default -@all
-        r HELLO 2 AUTH secure-user supass
-        r ACL setuser default nopass +@all
-        r AUTH default ""
-    }
-
-    test {ACL HELP should not have unexpected options} {
-        catch {r ACL help xxx} e
-        assert_match "*Unknown subcommand or wrong number of arguments*" $e
-    }
-
-    test {Delete a user that the client doesn't use} {
-        r ACL setuser not_used on >passwd
-        assert {[r ACL deluser not_used] == 1}
-        # The client is not closed
-        assert {[r ping] eq {PONG}}
-    }
-
-    test {Delete a user that the client is using} {
-        r ACL setuser using on +acl >passwd
-        r AUTH using passwd
-        # The client will receive reply normally
-        assert {[r ACL deluser using] == 1}
-        # The client is closed
-        catch {[r ping]} e
-        assert_match "*I/O error*" $e
-    }
-}
-
-set server_path [tmpdir "server.acl"]
-exec cp -f tests/assets/user.acl $server_path
-start_server [list overrides [list "dir" $server_path "aclfile" "user.acl"]] {
-    # user alice on allcommands allkeys >alice
-    # user bob on -@all +@set +acl ~set* >bob
-    # user default on nopass ~* +@all
-
-    test {default: load from include file, can access any channels} {
-        r SUBSCRIBE foo
-        r PSUBSCRIBE bar*
-        r UNSUBSCRIBE
-        r PUNSUBSCRIBE
-        r PUBLISH hello world
-    }
-
-    test {default: with config acl-pubsub-default allchannels after reset, can access any channels} {
-        r ACL setuser default reset on nopass ~* +@all
-        r SUBSCRIBE foo
-        r PSUBSCRIBE bar*
-        r UNSUBSCRIBE
-        r PUNSUBSCRIBE
-        r PUBLISH hello world
-    }
-
-    test {default: with config acl-pubsub-default resetchannels after reset, can not access any channels} {
-        r CONFIG SET acl-pubsub-default resetchannels
-        r ACL setuser default reset on nopass ~* +@all
-        catch {r SUBSCRIBE foo} e
-        assert_match {*NOPERM*} $e
-        catch {r PSUBSCRIBE bar*} e
-        assert_match {*NOPERM*} $e
-        catch {r PUBLISH hello world} e
-        assert_match {*NOPERM*} $e
-        r CONFIG SET acl-pubsub-default resetchannels
-    }
-
-    test {Alice: can execute all command} {
-        r AUTH alice alice
-        assert_equal "alice" [r acl whoami]
-        r SET key value
-    }
-
-    test {Bob: just execute @set and acl command} {
-        r AUTH bob bob
-        assert_equal "bob" [r acl whoami]
-        assert_equal "3" [r sadd set 1 2 3]
-        catch {r SET key value} e
-        set e
-    } {*NOPERM*}
-
-    test {ACL load and save} {
-        r ACL setuser eve +get allkeys >eve on
-        r ACL save
-
-        # ACL load will free user and kill clients
-        r ACL load
-        catch {r ACL LIST} e
-        assert_match {*I/O error*} $e
-
-        reconnect
-        r AUTH alice alice
-        r SET key value
-        r AUTH eve eve
-        r GET key
-        catch {r SET key value} e
-        set e
-    } {*NOPERM*}
-
-    test {ACL load and save with restricted channels} {
-        r AUTH alice alice
-        r ACL setuser harry on nopass resetchannels &test +@all ~*
-        r ACL save
-
-        # ACL load will free user and kill clients
-        r ACL load
-        catch {r ACL LIST} e
-        assert_match {*I/O error*} $e
-
-        reconnect
-        r AUTH harry anything
-        r publish test bar
-        catch {r publish test1 bar} e
-        r ACL deluser harry
-        set e
-    } {*NOPERM*}
-}
-
-set server_path [tmpdir "resetchannels.acl"]
-exec cp -f tests/assets/nodefaultuser.acl $server_path
-exec cp -f tests/assets/default.conf $server_path
-start_server [list overrides [list "dir" $server_path "acl-pubsub-default" "resetchannels" "aclfile" "nodefaultuser.acl"]] {
-
-    test {Default user has access to all channels irrespective of flag} {
-        set channelinfo [dict get [r ACL getuser default] channels]
-        assert_equal "*" $channelinfo
-        set channelinfo [dict get [r ACL getuser alice] channels]
-        assert_equal "" $channelinfo
-    }
-
-    test {Update acl-pubsub-default, existing users shouldn't get affected} {
-        set channelinfo [dict get [r ACL getuser default] channels]
-        assert_equal "*" $channelinfo
-        r CONFIG set acl-pubsub-default allchannels
-        r ACL setuser mydefault
-        set channelinfo [dict get [r ACL getuser mydefault] channels]
-        assert_equal "*" $channelinfo
-        r CONFIG set acl-pubsub-default resetchannels
-        set channelinfo [dict get [r ACL getuser mydefault] channels]
-        assert_equal "*" $channelinfo
-    }
-
-    test {Single channel is valid} {
-        r ACL setuser onechannel &test
-        set channelinfo [dict get [r ACL getuser onechannel] channels]
-        assert_equal test $channelinfo
-        r ACL deluser onechannel
-    }
-
-    test {Single channel is not valid with allchannels} {
-        r CONFIG set acl-pubsub-default allchannels
-        catch {r ACL setuser onechannel &test} err
-        r CONFIG set acl-pubsub-default resetchannels
-        set err
-    } {*start with an empty list of channels*}
-}
-
-set server_path [tmpdir "resetchannels.acl"]
-exec cp -f tests/assets/nodefaultuser.acl $server_path
-exec cp -f tests/assets/default.conf $server_path
-start_server [list overrides [list "dir" $server_path "acl-pubsub-default" "resetchannels" "aclfile" "nodefaultuser.acl"]] {
-
-    test {Only default user has access to all channels irrespective of flag} {
-        set channelinfo [dict get [r ACL getuser default] channels]
-        assert_equal "*" $channelinfo
-        set channelinfo [dict get [r ACL getuser alice] channels]
-        assert_equal "" $channelinfo
-    }
-}
-
-
-start_server {overrides {user "default on nopass ~* +@all"}} {
-    test {default: load from config file, can access any channels} {
-        r SUBSCRIBE foo
-        r PSUBSCRIBE bar*
-        r UNSUBSCRIBE
-        r PUNSUBSCRIBE
-        r PUBLISH hello world
-    }
-}
diff --git a/redis-stable/tests/unit/aofrw.tcl b/redis-stable/tests/unit/aofrw.tcl
deleted file mode 100644
index 5bdf8725..00000000
--- a/redis-stable/tests/unit/aofrw.tcl
+++ /dev/null
@@ -1,206 +0,0 @@
-start_server {tags {"aofrw"}} {
-    # Enable the AOF
-    r config set appendonly yes
-    r config set auto-aof-rewrite-percentage 0 ; # Disable auto-rewrite.
-    waitForBgrewriteaof r
-
-    foreach rdbpre {yes no} {
-        r config set aof-use-rdb-preamble $rdbpre
-        test "AOF rewrite during write load: RDB preamble=$rdbpre" {
-            # Start a write load for 10 seconds
-            set master [srv 0 client]
-            set master_host [srv 0 host]
-            set master_port [srv 0 port]
-            set load_handle0 [start_write_load $master_host $master_port 10]
-            set load_handle1 [start_write_load $master_host $master_port 10]
-            set load_handle2 [start_write_load $master_host $master_port 10]
-            set load_handle3 [start_write_load $master_host $master_port 10]
-            set load_handle4 [start_write_load $master_host $master_port 10]
-
-            # Make sure the instance is really receiving data
-            wait_for_condition 50 100 {
-                [r dbsize] > 0
-            } else {
-                fail "No write load detected."
-            }
-
-            # After 3 seconds, start a rewrite, while the write load is still
-            # active.
-            after 3000
-            r bgrewriteaof
-            waitForBgrewriteaof r
-
-            # Let it run a bit more so that we'll append some data to the new
-            # AOF.
-            after 1000
-
-            # Stop the processes generating the load if they are still active
-            stop_write_load $load_handle0
-            stop_write_load $load_handle1
-            stop_write_load $load_handle2
-            stop_write_load $load_handle3
-            stop_write_load $load_handle4
-
-            # Make sure no more commands processed, before taking debug digest
-            wait_load_handlers_disconnected
-
-            # Get the data set digest
-            set d1 [r debug digest]
-
-            # Load the AOF
-            r debug loadaof
-            set d2 [r debug digest]
-
-            # Make sure they are the same
-            assert {$d1 eq $d2}
-        }
-    }
-}
-
-start_server {tags {"aofrw"} overrides {aof-use-rdb-preamble no}} {
-    test {Turning off AOF kills the background writing child if any} {
-        r config set appendonly yes
-        waitForBgrewriteaof r
-        r multi
-        r bgrewriteaof
-        r config set appendonly no
-        r exec
-        wait_for_condition 50 100 {
-            [string match {*Killing*AOF*child*} [exec tail -5 < [srv 0 stdout]]]
-        } else {
-            fail "Can't find 'Killing AOF child' into recent logs"
-        }
-    }
-
-    foreach d {string int} {
-        foreach e {quicklist} {
-            test "AOF rewrite of list with $e encoding, $d data" {
-                r flushall
-                set len 1000
-                for {set j 0} {$j < $len} {incr j} {
-                    if {$d eq {string}} {
-                        set data [randstring 0 16 alpha]
-                    } else {
-                        set data [randomInt 4000000000]
-                    }
-                    r lpush key $data
-                }
-                assert_equal [r object encoding key] $e
-                set d1 [r debug digest]
-                r bgrewriteaof
-                waitForBgrewriteaof r
-                r debug loadaof
-                set d2 [r debug digest]
-                if {$d1 ne $d2} {
-                    error "assertion:$d1 is not equal to $d2"
-                }
-            }
-        }
-    }
-
-    foreach d {string int} {
-        foreach e {intset hashtable} {
-            test "AOF rewrite of set with $e encoding, $d data" {
-                r flushall
-                if {$e eq {intset}} {set len 10} else {set len 1000}
-                for {set j 0} {$j < $len} {incr j} {
-                    if {$d eq {string}} {
-                        set data [randstring 0 16 alpha]
-                    } else {
-                        set data [randomInt 4000000000]
-                    }
-                    r sadd key $data
-                }
-                if {$d ne {string}} {
-                    assert_equal [r object encoding key] $e
-                }
-                set d1 [r debug digest]
-                r bgrewriteaof
-                waitForBgrewriteaof r
-                r debug loadaof
-                set d2 [r debug digest]
-                if {$d1 ne $d2} {
-                    error "assertion:$d1 is not equal to $d2"
-                }
-            }
-        }
-    }
-
-    foreach d {string int} {
-        foreach e {ziplist hashtable} {
-            test "AOF rewrite of hash with $e encoding, $d data" {
-                r flushall
-                if {$e eq {ziplist}} {set len 10} else {set len 1000}
-                for {set j 0} {$j < $len} {incr j} {
-                    if {$d eq {string}} {
-                        set data [randstring 0 16 alpha]
-                    } else {
-                        set data [randomInt 4000000000]
-                    }
-                    r hset key $data $data
-                }
-                assert_equal [r object encoding key] $e
-                set d1 [r debug digest]
-                r bgrewriteaof
-                waitForBgrewriteaof r
-                r debug loadaof
-                set d2 [r debug digest]
-                if {$d1 ne $d2} {
-                    error "assertion:$d1 is not equal to $d2"
-                }
-            }
-        }
-    }
-
-    foreach d {string int} {
-        foreach e {ziplist skiplist} {
-            test "AOF rewrite of zset with $e encoding, $d data" {
-                r flushall
-                if {$e eq {ziplist}} {set len 10} else {set len 1000}
-                for {set j 0} {$j < $len} {incr j} {
-                    if {$d eq {string}} {
-                        set data [randstring 0 16 alpha]
-                    } else {
-                        set data [randomInt 4000000000]
-                    }
-                    r zadd key [expr rand()] $data
-                }
-                assert_equal [r object encoding key] $e
-                set d1 [r debug digest]
-                r bgrewriteaof
-                waitForBgrewriteaof r
-                r debug loadaof
-                set d2 [r debug digest]
-                if {$d1 ne $d2} {
-                    error "assertion:$d1 is not equal to $d2"
-                }
-            }
-        }
-    }
-
-    test {BGREWRITEAOF is delayed if BGSAVE is in progress} {
-        r multi
-        r bgsave
-        r bgrewriteaof
-        r info persistence
-        set res [r exec]
-        assert_match {*scheduled*} [lindex $res 1]
-        assert_match {*aof_rewrite_scheduled:1*} [lindex $res 2]
-        while {[string match {*aof_rewrite_scheduled:1*} [r info persistence]]} {
-            after 100
-        }
-    }
-
-    test {BGREWRITEAOF is refused if already in progress} {
-        catch {
-            r multi
-            r bgrewriteaof
-            r bgrewriteaof
-            r exec
-        } e
-        assert_match {*ERR*already*} $e
-        while {[string match {*aof_rewrite_scheduled:1*} [r info persistence]]} {
-            after 100
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/auth.tcl b/redis-stable/tests/unit/auth.tcl
deleted file mode 100644
index 5997707c..00000000
--- a/redis-stable/tests/unit/auth.tcl
+++ /dev/null
@@ -1,84 +0,0 @@
-start_server {tags {"auth"}} {
-    test {AUTH fails if there is no password configured server side} {
-        catch {r auth foo} err
-        set _ $err
-    } {ERR*any password*}
-}
-
-start_server {tags {"auth"} overrides {requirepass foobar}} {
-    test {AUTH fails when a wrong password is given} {
-        catch {r auth wrong!} err
-        set _ $err
-    } {WRONGPASS*}
-
-    test {Arbitrary command gives an error when AUTH is required} {
-        catch {r set foo bar} err
-        set _ $err
-    } {NOAUTH*}
-
-    test {AUTH succeeds when the right password is given} {
-        r auth foobar
-    } {OK}
-
-    test {Once AUTH succeeded we can actually send commands to the server} {
-        r set foo 100
-        r incr foo
-    } {101}
-
-    test {For unauthenticated clients multibulk and bulk length are limited} {
-        set rr [redis [srv "host"] [srv "port"] 0 $::tls]
-        $rr write "*100\r\n"
-        $rr flush
-        catch {[$rr read]} e
-        assert_match {*unauthenticated multibulk length*} $e
-        $rr close
-
-        set rr [redis [srv "host"] [srv "port"] 0 $::tls]
-        $rr write "*1\r\n\$100000000\r\n"
-        $rr flush
-        catch {[$rr read]} e
-        assert_match {*unauthenticated bulk length*} $e
-        $rr close
-    }
-}
-
-start_server {tags {"auth_binary_password"}} {
-    test {AUTH fails when binary password is wrong} {
-        r config set requirepass "abc\x00def"
-        catch {r auth abc} err
-        set _ $err
-    } {WRONGPASS*}
-
-    test {AUTH succeeds when binary password is correct} {
-        r config set requirepass "abc\x00def"
-        r auth "abc\x00def"
-    } {OK}
-
-    start_server {tags {"masterauth"}} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        test {MASTERAUTH test with binary password} {
-            $master config set requirepass "abc\x00def"
-
-            # Configure the replica with masterauth
-            set loglines [count_log_lines 0]
-            $slave slaveof $master_host $master_port
-            $slave config set masterauth "abc"
-
-            # Verify replica is not able to sync with master
-            wait_for_log_messages 0 {"*Unable to AUTH to MASTER*"} $loglines 1000 10
-            assert_equal {down} [s 0 master_link_status]
-            
-            # Test replica with the correct masterauth
-            $slave config set masterauth "abc\x00def"
-            wait_for_condition 50 100 {
-                [s 0 master_link_status] eq {up}
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/bitfield.tcl b/redis-stable/tests/unit/bitfield.tcl
deleted file mode 100644
index 1f2f6395..00000000
--- a/redis-stable/tests/unit/bitfield.tcl
+++ /dev/null
@@ -1,232 +0,0 @@
-start_server {tags {"bitops"}} {
-    test {BITFIELD signed SET and GET basics} {
-        r del bits
-        set results {}
-        lappend results [r bitfield bits set i8 0 -100]
-        lappend results [r bitfield bits set i8 0 101]
-        lappend results [r bitfield bits get i8 0]
-        set results
-    } {0 -100 101}
-
-    test {BITFIELD unsigned SET and GET basics} {
-        r del bits
-        set results {}
-        lappend results [r bitfield bits set u8 0 255]
-        lappend results [r bitfield bits set u8 0 100]
-        lappend results [r bitfield bits get u8 0]
-        set results
-    } {0 255 100}
-
-    test {BITFIELD #<idx> form} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 65
-        r bitfield bits set u8 #1 66
-        r bitfield bits set u8 #2 67
-        r get bits
-    } {ABC}
-
-    test {BITFIELD basic INCRBY form} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 10
-        lappend results [r bitfield bits incrby u8 #0 100]
-        lappend results [r bitfield bits incrby u8 #0 100]
-        set results
-    } {110 210}
-
-    test {BITFIELD chaining of multiple commands} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 10
-        lappend results [r bitfield bits incrby u8 #0 100 incrby u8 #0 100]
-        set results
-    } {{110 210}}
-
-    test {BITFIELD unsigned overflow wrap} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 100
-        lappend results [r bitfield bits overflow wrap incrby u8 #0 257]
-        lappend results [r bitfield bits get u8 #0]
-        lappend results [r bitfield bits overflow wrap incrby u8 #0 255]
-        lappend results [r bitfield bits get u8 #0]
-    } {101 101 100 100}
-
-    test {BITFIELD unsigned overflow sat} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 100
-        lappend results [r bitfield bits overflow sat incrby u8 #0 257]
-        lappend results [r bitfield bits get u8 #0]
-        lappend results [r bitfield bits overflow sat incrby u8 #0 -255]
-        lappend results [r bitfield bits get u8 #0]
-    } {255 255 0 0}
-
-    test {BITFIELD signed overflow wrap} {
-        r del bits
-        set results {}
-        r bitfield bits set i8 #0 100
-        lappend results [r bitfield bits overflow wrap incrby i8 #0 257]
-        lappend results [r bitfield bits get i8 #0]
-        lappend results [r bitfield bits overflow wrap incrby i8 #0 255]
-        lappend results [r bitfield bits get i8 #0]
-    } {101 101 100 100}
-
-    test {BITFIELD signed overflow sat} {
-        r del bits
-        set results {}
-        r bitfield bits set u8 #0 100
-        lappend results [r bitfield bits overflow sat incrby i8 #0 257]
-        lappend results [r bitfield bits get i8 #0]
-        lappend results [r bitfield bits overflow sat incrby i8 #0 -255]
-        lappend results [r bitfield bits get i8 #0]
-    } {127 127 -128 -128}
-
-    test {BITFIELD overflow detection fuzzing} {
-        for {set j 0} {$j < 1000} {incr j} {
-            set bits [expr {[randomInt 64]+1}]
-            set sign [randomInt 2]
-            set range [expr {2**$bits}]
-            if {$bits == 64} {set sign 1} ; # u64 is not supported by BITFIELD.
-            if {$sign} {
-                set min [expr {-($range/2)}]
-                set type "i$bits"
-            } else {
-                set min 0
-                set type "u$bits"
-            }
-            set max [expr {$min+$range-1}]
-
-            # Compare Tcl vs Redis
-            set range2 [expr {$range*2}]
-            set value [expr {($min*2)+[randomInt $range2]}]
-            set increment [expr {($min*2)+[randomInt $range2]}]
-            if {$value > 9223372036854775807} {
-                set value 9223372036854775807
-            }
-            if {$value < -9223372036854775808} {
-                set value -9223372036854775808
-            }
-            if {$increment > 9223372036854775807} {
-                set increment 9223372036854775807
-            }
-            if {$increment < -9223372036854775808} {
-                set increment -9223372036854775808
-            }
-
-            set overflow 0
-            if {$value > $max || $value < $min} {set overflow 1}
-            if {($value + $increment) > $max} {set overflow 1}
-            if {($value + $increment) < $min} {set overflow 1}
-
-            r del bits
-            set res1 [r bitfield bits overflow fail set $type 0 $value]
-            set res2 [r bitfield bits overflow fail incrby $type 0 $increment]
-
-            if {$overflow && [lindex $res1 0] ne {} &&
-                             [lindex $res2 0] ne {}} {
-                fail "OW not detected where needed: $type $value+$increment"
-            }
-            if {!$overflow && ([lindex $res1 0] eq {} ||
-                               [lindex $res2 0] eq {})} {
-                fail "OW detected where NOT needed: $type $value+$increment"
-            }
-        }
-    }
-
-    test {BITFIELD overflow wrap fuzzing} {
-        for {set j 0} {$j < 1000} {incr j} {
-            set bits [expr {[randomInt 64]+1}]
-            set sign [randomInt 2]
-            set range [expr {2**$bits}]
-            if {$bits == 64} {set sign 1} ; # u64 is not supported by BITFIELD.
-            if {$sign} {
-                set min [expr {-($range/2)}]
-                set type "i$bits"
-            } else {
-                set min 0
-                set type "u$bits"
-            }
-            set max [expr {$min+$range-1}]
-
-            # Compare Tcl vs Redis
-            set range2 [expr {$range*2}]
-            set value [expr {($min*2)+[randomInt $range2]}]
-            set increment [expr {($min*2)+[randomInt $range2]}]
-            if {$value > 9223372036854775807} {
-                set value 9223372036854775807
-            }
-            if {$value < -9223372036854775808} {
-                set value -9223372036854775808
-            }
-            if {$increment > 9223372036854775807} {
-                set increment 9223372036854775807
-            }
-            if {$increment < -9223372036854775808} {
-                set increment -9223372036854775808
-            }
-
-            r del bits
-            r bitfield bits overflow wrap set $type 0 $value
-            r bitfield bits overflow wrap incrby $type 0 $increment
-            set res [lindex [r bitfield bits get $type 0] 0]
-
-            set expected 0
-            if {$sign} {incr expected [expr {$max+1}]}
-            incr expected $value
-            incr expected $increment
-            set expected [expr {$expected % $range}]
-            if {$sign} {incr expected $min}
-
-            if {$res != $expected} {
-                fail "WRAP error: $type $value+$increment = $res, should be $expected"
-            }
-        }
-    }
-
-    test {BITFIELD regression for #3221} {
-        r set bits 1
-        r bitfield bits get u1 0
-    } {0}
-
-    test {BITFIELD regression for #3564} {
-        for {set j 0} {$j < 10} {incr j} {
-            r del mystring
-            set res [r BITFIELD mystring SET i8 0 10 SET i8 64 10 INCRBY i8 10 99900]
-            assert {$res eq {0 0 60}}
-        }
-        r del mystring
-    }
-}
-
-start_server {tags {"repl"}} {
-    start_server {} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        test {BITFIELD: setup slave} {
-            $slave slaveof $master_host $master_port
-            wait_for_condition 50 100 {
-                [s 0 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-        }
-
-        test {BITFIELD: write on master, read on slave} {
-            $master del bits
-            assert_equal 0 [$master bitfield bits set u8 0 255]
-            assert_equal 255 [$master bitfield bits set u8 0 100]
-            wait_for_ofs_sync $master $slave
-            assert_equal 100 [$slave bitfield_ro bits get u8 0]
-        }
-
-        test {BITFIELD_RO fails when write option is used} {
-            catch {$slave bitfield_ro bits set u8 0 100 get u8 0} err
-            assert_match {*ERR BITFIELD_RO only supports the GET subcommand*} $err
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/bitops.tcl b/redis-stable/tests/unit/bitops.tcl
deleted file mode 100644
index 53483297..00000000
--- a/redis-stable/tests/unit/bitops.tcl
+++ /dev/null
@@ -1,379 +0,0 @@
-# Compare Redis commands against Tcl implementations of the same commands.
-proc count_bits s {
-    binary scan $s b* bits
-    string length [regsub -all {0} $bits {}]
-}
-
-proc simulate_bit_op {op args} {
-    set maxlen 0
-    set j 0
-    set count [llength $args]
-    foreach a $args {
-        binary scan $a b* bits
-        set b($j) $bits
-        if {[string length $bits] > $maxlen} {
-            set maxlen [string length $bits]
-        }
-        incr j
-    }
-    for {set j 0} {$j < $count} {incr j} {
-        if {[string length $b($j)] < $maxlen} {
-            append b($j) [string repeat 0 [expr $maxlen-[string length $b($j)]]]
-        }
-    }
-    set out {}
-    for {set x 0} {$x < $maxlen} {incr x} {
-        set bit [string range $b(0) $x $x]
-        if {$op eq {not}} {set bit [expr {!$bit}]}
-        for {set j 1} {$j < $count} {incr j} {
-            set bit2 [string range $b($j) $x $x]
-            switch $op {
-                and {set bit [expr {$bit & $bit2}]}
-                or  {set bit [expr {$bit | $bit2}]}
-                xor {set bit [expr {$bit ^ $bit2}]}
-            }
-        }
-        append out $bit
-    }
-    binary format b* $out
-}
-
-start_server {tags {"bitops"}} {
-    test {BITCOUNT returns 0 against non existing key} {
-        r bitcount no-key
-    } 0
-
-    test {BITCOUNT returns 0 with out of range indexes} {
-        r set str "xxxx"
-        r bitcount str 4 10
-    } 0
-
-    test {BITCOUNT returns 0 with negative indexes where start > end} {
-        r set str "xxxx"
-        r bitcount str -6 -7
-    } 0
-
-    catch {unset num}
-    foreach vec [list "" "\xaa" "\x00\x00\xff" "foobar" "123"] {
-        incr num
-        test "BITCOUNT against test vector #$num" {
-            r set str $vec
-            assert {[r bitcount str] == [count_bits $vec]}
-        }
-    }
-
-    test {BITCOUNT fuzzing without start/end} {
-        for {set j 0} {$j < 100} {incr j} {
-            set str [randstring 0 3000]
-            r set str $str
-            assert {[r bitcount str] == [count_bits $str]}
-        }
-    }
-
-    test {BITCOUNT fuzzing with start/end} {
-        for {set j 0} {$j < 100} {incr j} {
-            set str [randstring 0 3000]
-            r set str $str
-            set l [string length $str]
-            set start [randomInt $l]
-            set end [randomInt $l]
-            if {$start > $end} {
-                lassign [list $end $start] start end
-            }
-            assert {[r bitcount str $start $end] == [count_bits [string range $str $start $end]]}
-        }
-    }
-
-    test {BITCOUNT with start, end} {
-        r set s "foobar"
-        assert_equal [r bitcount s 0 -1] [count_bits "foobar"]
-        assert_equal [r bitcount s 1 -2] [count_bits "ooba"]
-        assert_equal [r bitcount s -2 1] [count_bits ""]
-        assert_equal [r bitcount s 0 1000] [count_bits "foobar"]
-    }
-
-    test {BITCOUNT syntax error #1} {
-        catch {r bitcount s 0} e
-        set e
-    } {ERR*syntax*}
-
-    test {BITCOUNT regression test for github issue #582} {
-        r del foo
-        r setbit foo 0 1
-        if {[catch {r bitcount foo 0 4294967296} e]} {
-            assert_match {*ERR*out of range*} $e
-            set _ 1
-        } else {
-            set e
-        }
-    } {1}
-
-    test {BITCOUNT misaligned prefix} {
-        r del str
-        r set str ab
-        r bitcount str 1 -1
-    } {3}
-
-    test {BITCOUNT misaligned prefix + full words + remainder} {
-        r del str
-        r set str __PPxxxxxxxxxxxxxxxxRR__
-        r bitcount str 2 -3
-    } {74}
-
-    test {BITOP NOT (empty string)} {
-        r set s ""
-        r bitop not dest s
-        r get dest
-    } {}
-
-    test {BITOP NOT (known string)} {
-        r set s "\xaa\x00\xff\x55"
-        r bitop not dest s
-        r get dest
-    } "\x55\xff\x00\xaa"
-
-    test {BITOP where dest and target are the same key} {
-        r set s "\xaa\x00\xff\x55"
-        r bitop not s s
-        r get s
-    } "\x55\xff\x00\xaa"
-
-    test {BITOP AND|OR|XOR don't change the string with single input key} {
-        r set a "\x01\x02\xff"
-        r bitop and res1 a
-        r bitop or  res2 a
-        r bitop xor res3 a
-        list [r get res1] [r get res2] [r get res3]
-    } [list "\x01\x02\xff" "\x01\x02\xff" "\x01\x02\xff"]
-
-    test {BITOP missing key is considered a stream of zero} {
-        r set a "\x01\x02\xff"
-        r bitop and res1 no-suck-key a
-        r bitop or  res2 no-suck-key a no-such-key
-        r bitop xor res3 no-such-key a
-        list [r get res1] [r get res2] [r get res3]
-    } [list "\x00\x00\x00" "\x01\x02\xff" "\x01\x02\xff"]
-
-    test {BITOP shorter keys are zero-padded to the key with max length} {
-        r set a "\x01\x02\xff\xff"
-        r set b "\x01\x02\xff"
-        r bitop and res1 a b
-        r bitop or  res2 a b
-        r bitop xor res3 a b
-        list [r get res1] [r get res2] [r get res3]
-    } [list "\x01\x02\xff\x00" "\x01\x02\xff\xff" "\x00\x00\x00\xff"]
-
-    foreach op {and or xor} {
-        test "BITOP $op fuzzing" {
-            for {set i 0} {$i < 10} {incr i} {
-                r flushall
-                set vec {}
-                set veckeys {}
-                set numvec [expr {[randomInt 10]+1}]
-                for {set j 0} {$j < $numvec} {incr j} {
-                    set str [randstring 0 1000]
-                    lappend vec $str
-                    lappend veckeys vector_$j
-                    r set vector_$j $str
-                }
-                r bitop $op target {*}$veckeys
-                assert_equal [r get target] [simulate_bit_op $op {*}$vec]
-            }
-        }
-    }
-
-    test {BITOP NOT fuzzing} {
-        for {set i 0} {$i < 10} {incr i} {
-            r flushall
-            set str [randstring 0 1000]
-            r set str $str
-            r bitop not target str
-            assert_equal [r get target] [simulate_bit_op not $str]
-        }
-    }
-
-    test {BITOP with integer encoded source objects} {
-        r set a 1
-        r set b 2
-        r bitop xor dest a b a
-        r get dest
-    } {2}
-
-    test {BITOP with non string source key} {
-        r del c
-        r set a 1
-        r set b 2
-        r lpush c foo
-        catch {r bitop xor dest a b c d} e
-        set e
-    } {WRONGTYPE*}
-
-    test {BITOP with empty string after non empty string (issue #529)} {
-        r flushdb
-        r set a "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
-        r bitop or x a b
-    } {32}
-
-    test {BITPOS bit=0 with empty key returns 0} {
-        r del str
-        r bitpos str 0
-    } {0}
-
-    test {BITPOS bit=1 with empty key returns -1} {
-        r del str
-        r bitpos str 1
-    } {-1}
-
-    test {BITPOS bit=0 with string less than 1 word works} {
-        r set str "\xff\xf0\x00"
-        r bitpos str 0
-    } {12}
-
-    test {BITPOS bit=1 with string less than 1 word works} {
-        r set str "\x00\x0f\x00"
-        r bitpos str 1
-    } {12}
-
-    test {BITPOS bit=0 starting at unaligned address} {
-        r set str "\xff\xf0\x00"
-        r bitpos str 0 1
-    } {12}
-
-    test {BITPOS bit=1 starting at unaligned address} {
-        r set str "\x00\x0f\xff"
-        r bitpos str 1 1
-    } {12}
-
-    test {BITPOS bit=0 unaligned+full word+reminder} {
-        r del str
-        r set str "\xff\xff\xff" ; # Prefix
-        # Followed by two (or four in 32 bit systems) full words
-        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
-        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
-        r append str "\xff\xff\xff\xff\xff\xff\xff\xff"
-        # First zero bit.
-        r append str "\x0f"
-        assert {[r bitpos str 0] == 216}
-        assert {[r bitpos str 0 1] == 216}
-        assert {[r bitpos str 0 2] == 216}
-        assert {[r bitpos str 0 3] == 216}
-        assert {[r bitpos str 0 4] == 216}
-        assert {[r bitpos str 0 5] == 216}
-        assert {[r bitpos str 0 6] == 216}
-        assert {[r bitpos str 0 7] == 216}
-        assert {[r bitpos str 0 8] == 216}
-    }
-
-    test {BITPOS bit=1 unaligned+full word+reminder} {
-        r del str
-        r set str "\x00\x00\x00" ; # Prefix
-        # Followed by two (or four in 32 bit systems) full words
-        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
-        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
-        r append str "\x00\x00\x00\x00\x00\x00\x00\x00"
-        # First zero bit.
-        r append str "\xf0"
-        assert {[r bitpos str 1] == 216}
-        assert {[r bitpos str 1 1] == 216}
-        assert {[r bitpos str 1 2] == 216}
-        assert {[r bitpos str 1 3] == 216}
-        assert {[r bitpos str 1 4] == 216}
-        assert {[r bitpos str 1 5] == 216}
-        assert {[r bitpos str 1 6] == 216}
-        assert {[r bitpos str 1 7] == 216}
-        assert {[r bitpos str 1 8] == 216}
-    }
-
-    test {BITPOS bit=1 returns -1 if string is all 0 bits} {
-        r set str ""
-        for {set j 0} {$j < 20} {incr j} {
-            assert {[r bitpos str 1] == -1}
-            r append str "\x00"
-        }
-    }
-
-    test {BITPOS bit=0 works with intervals} {
-        r set str "\x00\xff\x00"
-        assert {[r bitpos str 0 0 -1] == 0}
-        assert {[r bitpos str 0 1 -1] == 16}
-        assert {[r bitpos str 0 2 -1] == 16}
-        assert {[r bitpos str 0 2 200] == 16}
-        assert {[r bitpos str 0 1 1] == -1}
-    }
-
-    test {BITPOS bit=1 works with intervals} {
-        r set str "\x00\xff\x00"
-        assert {[r bitpos str 1 0 -1] == 8}
-        assert {[r bitpos str 1 1 -1] == 8}
-        assert {[r bitpos str 1 2 -1] == -1}
-        assert {[r bitpos str 1 2 200] == -1}
-        assert {[r bitpos str 1 1 1] == 8}
-    }
-
-    test {BITPOS bit=0 changes behavior if end is given} {
-        r set str "\xff\xff\xff"
-        assert {[r bitpos str 0] == 24}
-        assert {[r bitpos str 0 0] == 24}
-        assert {[r bitpos str 0 0 -1] == -1}
-    }
-
-    test {BITPOS bit=1 fuzzy testing using SETBIT} {
-        r del str
-        set max 524288; # 64k
-        set first_one_pos -1
-        for {set j 0} {$j < 1000} {incr j} {
-            assert {[r bitpos str 1] == $first_one_pos}
-            set pos [randomInt $max]
-            r setbit str $pos 1
-            if {$first_one_pos == -1 || $first_one_pos > $pos} {
-                # Update the position of the first 1 bit in the array
-                # if the bit we set is on the left of the previous one.
-                set first_one_pos $pos
-            }
-        }
-    }
-
-    test {BITPOS bit=0 fuzzy testing using SETBIT} {
-        set max 524288; # 64k
-        set first_zero_pos $max
-        r set str [string repeat "\xff" [expr $max/8]]
-        for {set j 0} {$j < 1000} {incr j} {
-            assert {[r bitpos str 0] == $first_zero_pos}
-            set pos [randomInt $max]
-            r setbit str $pos 0
-            if {$first_zero_pos > $pos} {
-                # Update the position of the first 0 bit in the array
-                # if the bit we clear is on the left of the previous one.
-                set first_zero_pos $pos
-            }
-        }
-    }
-}
-
-start_server {tags {"bitops large-memory"}} {
-    test "BIT pos larger than UINT_MAX" {
-        set bytes [expr (1 << 29) + 1]
-        set bitpos [expr (1 << 32)]
-        set oldval [lindex [r config get proto-max-bulk-len] 1]
-        r config set proto-max-bulk-len $bytes
-        r setbit mykey $bitpos 1
-        assert_equal $bytes [r strlen mykey]
-        assert_equal 1 [r getbit mykey $bitpos]
-        assert_equal [list 128 128 -1] [r bitfield mykey get u8 $bitpos set u8 $bitpos 255 get i8 $bitpos]
-        assert_equal $bitpos [r bitpos mykey 1]
-        assert_equal $bitpos [r bitpos mykey 1 [expr $bytes - 1]]
-        if {$::accurate} {
-            # set all bits to 1
-            set mega [expr (1 << 23)]
-            set part [string repeat "\xFF" $mega]
-            for {set i 0} {$i < 64} {incr i} {
-                r setrange mykey [expr $i * $mega] $part
-            }
-            r setrange mykey [expr $bytes - 1] "\xFF"
-            assert_equal [expr $bitpos + 8] [r bitcount mykey]
-            assert_equal -1 [r bitpos mykey 0 0 [expr $bytes - 1]]
-        }
-        r config set proto-max-bulk-len $oldval
-        r del mykey
-    } {1}
-}
diff --git a/redis-stable/tests/unit/dump.tcl b/redis-stable/tests/unit/dump.tcl
deleted file mode 100644
index d43820ae..00000000
--- a/redis-stable/tests/unit/dump.tcl
+++ /dev/null
@@ -1,379 +0,0 @@
-start_server {tags {"dump"}} {
-    test {DUMP / RESTORE are able to serialize / unserialize a simple key} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        list [r exists foo] [r restore foo 0 $encoded] [r ttl foo] [r get foo]
-    } {0 OK -1 bar}
-
-    test {RESTORE can set an arbitrary expire to the materialized key} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        r restore foo 5000 $encoded
-        set ttl [r pttl foo]
-        assert_range $ttl 3000 5000
-        r get foo
-    } {bar}
-
-    test {RESTORE can set an expire that overflows a 32 bit integer} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        r restore foo 2569591501 $encoded
-        set ttl [r pttl foo]
-        assert_range $ttl (2569591501-3000) 2569591501
-        r get foo
-    } {bar}
-    
-    test {RESTORE can set an absolute expire} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        set now [clock milliseconds]
-        r restore foo [expr $now+3000] $encoded absttl
-        set ttl [r pttl foo]
-        assert_range $ttl 2000 3100
-        r get foo
-    } {bar}
-
-    test {RESTORE with ABSTTL in the past} {
-        r set foo bar
-        set encoded [r dump foo]
-        set now [clock milliseconds]
-        r debug set-active-expire 0
-        r restore foo [expr $now-3000] $encoded absttl REPLACE
-        catch {r debug object foo} e
-        r debug set-active-expire 1
-        set e
-    } {ERR no such key}
-
-    test {RESTORE can set LRU} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        r config set maxmemory-policy allkeys-lru
-        r restore foo 0 $encoded idletime 1000
-        set idle [r object idletime foo]
-        assert {$idle >= 1000 && $idle <= 1010}
-        r get foo
-    } {bar}
-    
-    test {RESTORE can set LFU} {
-        r set foo bar
-        set encoded [r dump foo]
-        r del foo
-        r config set maxmemory-policy allkeys-lfu
-        r restore foo 0 $encoded freq 100
-        set freq [r object freq foo]
-        assert {$freq == 100}
-        r get foo
-    } {bar}
-
-    test {RESTORE returns an error of the key already exists} {
-        r set foo bar
-        set e {}
-        catch {r restore foo 0 "..."} e
-        set e
-    } {*BUSYKEY*}
-
-    test {RESTORE can overwrite an existing key with REPLACE} {
-        r set foo bar1
-        set encoded1 [r dump foo]
-        r set foo bar2
-        set encoded2 [r dump foo]
-        r del foo
-        r restore foo 0 $encoded1
-        r restore foo 0 $encoded2 replace
-        r get foo
-    } {bar2}
-
-    test {RESTORE can detect a syntax error for unrecongized options} {
-        catch {r restore foo 0 "..." invalid-option} e
-        set e
-    } {*syntax*}
-
-    test {DUMP of non existing key returns nil} {
-        r dump nonexisting_key
-    } {}
-
-    test {MIGRATE is caching connections} {
-        # Note, we run this as first test so that the connection cache
-        # is empty.
-        set first [srv 0 client]
-        r set key "Some Value"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert_match {*migrate_cached_sockets:0*} [r -1 info]
-            r -1 migrate $second_host $second_port key 9 1000
-            assert_match {*migrate_cached_sockets:1*} [r -1 info]
-        }
-    }
-
-    test {MIGRATE cached connections are released after some time} {
-        after 15000
-        assert_match {*migrate_cached_sockets:0*} [r info]
-    }
-
-    test {MIGRATE is able to migrate a key between two instances} {
-        set first [srv 0 client]
-        r set key "Some Value"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key] == 1}
-            assert {[$second exists key] == 0}
-            set ret [r -1 migrate $second_host $second_port key 9 5000]
-            assert {$ret eq {OK}}
-            assert {[$first exists key] == 0}
-            assert {[$second exists key] == 1}
-            assert {[$second get key] eq {Some Value}}
-            assert {[$second ttl key] == -1}
-        }
-    }
-
-    test {MIGRATE is able to copy a key between two instances} {
-        set first [srv 0 client]
-        r del list
-        r lpush list a b c d
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists list] == 1}
-            assert {[$second exists list] == 0}
-            set ret [r -1 migrate $second_host $second_port list 9 5000 copy]
-            assert {$ret eq {OK}}
-            assert {[$first exists list] == 1}
-            assert {[$second exists list] == 1}
-            assert {[$first lrange list 0 -1] eq [$second lrange list 0 -1]}
-        }
-    }
-
-    test {MIGRATE will not overwrite existing keys, unless REPLACE is used} {
-        set first [srv 0 client]
-        r del list
-        r lpush list a b c d
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists list] == 1}
-            assert {[$second exists list] == 0}
-            $second set list somevalue
-            catch {r -1 migrate $second_host $second_port list 9 5000 copy} e
-            assert_match {ERR*} $e
-            set ret [r -1 migrate $second_host $second_port list 9 5000 copy replace]
-            assert {$ret eq {OK}}
-            assert {[$first exists list] == 1}
-            assert {[$second exists list] == 1}
-            assert {[$first lrange list 0 -1] eq [$second lrange list 0 -1]}
-        }
-    }
-
-    test {MIGRATE propagates TTL correctly} {
-        set first [srv 0 client]
-        r set key "Some Value"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key] == 1}
-            assert {[$second exists key] == 0}
-            $first expire key 10
-            set ret [r -1 migrate $second_host $second_port key 9 5000]
-            assert {$ret eq {OK}}
-            assert {[$first exists key] == 0}
-            assert {[$second exists key] == 1}
-            assert {[$second get key] eq {Some Value}}
-            assert {[$second ttl key] >= 7 && [$second ttl key] <= 10}
-        }
-    }
-
-    test {MIGRATE can correctly transfer large values} {
-        set first [srv 0 client]
-        r del key
-        for {set j 0} {$j < 40000} {incr j} {
-            r rpush key 1 2 3 4 5 6 7 8 9 10
-            r rpush key "item 1" "item 2" "item 3" "item 4" "item 5" \
-                        "item 6" "item 7" "item 8" "item 9" "item 10"
-        }
-        assert {[string length [r dump key]] > (1024*64)}
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key] == 1}
-            assert {[$second exists key] == 0}
-            set ret [r -1 migrate $second_host $second_port key 9 10000]
-            assert {$ret eq {OK}}
-            assert {[$first exists key] == 0}
-            assert {[$second exists key] == 1}
-            assert {[$second ttl key] == -1}
-            assert {[$second llen key] == 40000*20}
-        }
-    }
-
-    test {MIGRATE can correctly transfer hashes} {
-        set first [srv 0 client]
-        r del key
-        r hmset key field1 "item 1" field2 "item 2" field3 "item 3" \
-                    field4 "item 4" field5 "item 5" field6 "item 6"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key] == 1}
-            assert {[$second exists key] == 0}
-            set ret [r -1 migrate $second_host $second_port key 9 10000]
-            assert {$ret eq {OK}}
-            assert {[$first exists key] == 0}
-            assert {[$second exists key] == 1}
-            assert {[$second ttl key] == -1}
-        }
-    }
-
-    test {MIGRATE timeout actually works} {
-        set first [srv 0 client]
-        r set key "Some Value"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key] == 1}
-            assert {[$second exists key] == 0}
-
-            set rd [redis_deferring_client]
-            $rd debug sleep 1.0 ; # Make second server unable to reply.
-            set e {}
-            catch {r -1 migrate $second_host $second_port key 9 500} e
-            assert_match {IOERR*} $e
-        }
-    }
-
-    test {MIGRATE can migrate multiple keys at once} {
-        set first [srv 0 client]
-        r set key1 "v1"
-        r set key2 "v2"
-        r set key3 "v3"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            assert {[$first exists key1] == 1}
-            assert {[$second exists key1] == 0}
-            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys key1 key2 key3]
-            assert {$ret eq {OK}}
-            assert {[$first exists key1] == 0}
-            assert {[$first exists key2] == 0}
-            assert {[$first exists key3] == 0}
-            assert {[$second get key1] eq {v1}}
-            assert {[$second get key2] eq {v2}}
-            assert {[$second get key3] eq {v3}}
-        }
-    }
-
-    test {MIGRATE with multiple keys must have empty key arg} {
-        catch {r MIGRATE 127.0.0.1 6379 NotEmpty 9 5000 keys a b c} e
-        set e
-    } {*empty string*}
-
-    test {MIGRATE with multiple keys migrate just existing ones} {
-        set first [srv 0 client]
-        r set key1 "v1"
-        r set key2 "v2"
-        r set key3 "v3"
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 nokey-2 nokey-2]
-            assert {$ret eq {NOKEY}}
-
-            assert {[$first exists key1] == 1}
-            assert {[$second exists key1] == 0}
-            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys nokey-1 key1 nokey-2 key2 nokey-3 key3]
-            assert {$ret eq {OK}}
-            assert {[$first exists key1] == 0}
-            assert {[$first exists key2] == 0}
-            assert {[$first exists key3] == 0}
-            assert {[$second get key1] eq {v1}}
-            assert {[$second get key2] eq {v2}}
-            assert {[$second get key3] eq {v3}}
-        }
-    }
-
-    test {MIGRATE with multiple keys: stress command rewriting} {
-        set first [srv 0 client]
-        r flushdb
-        r mset a 1 b 2 c 3 d 4 c 5 e 6 f 7 g 8 h 9 i 10 l 11 m 12 n 13 o 14 p 15 q 16
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            set ret [r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q]
-
-            assert {[$first dbsize] == 0}
-            assert {[$second dbsize] == 15}
-        }
-    }
-
-    test {MIGRATE with multiple keys: delete just ack keys} {
-        set first [srv 0 client]
-        r flushdb
-        r mset a 1 b 2 c 3 d 4 c 5 e 6 f 7 g 8 h 9 i 10 l 11 m 12 n 13 o 14 p 15 q 16
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-
-            $second mset c _ d _; # Two busy keys and no REPLACE used
-
-            catch {r -1 migrate $second_host $second_port "" 9 5000 keys a b c d e f g h i l m n o p q} e
-
-            assert {[$first dbsize] == 2}
-            assert {[$second dbsize] == 15}
-            assert {[$first exists c] == 1}
-            assert {[$first exists d] == 1}
-        }
-    }
-
-    test {MIGRATE AUTH: correct and wrong password cases} {
-        set first [srv 0 client]
-        r del list
-        r lpush list a b c d
-        start_server {tags {"repl"}} {
-            set second [srv 0 client]
-            set second_host [srv 0 host]
-            set second_port [srv 0 port]
-            $second config set requirepass foobar
-            $second auth foobar
-
-            assert {[$first exists list] == 1}
-            assert {[$second exists list] == 0}
-            set ret [r -1 migrate $second_host $second_port list 9 5000 AUTH foobar]
-            assert {$ret eq {OK}}
-            assert {[$second exists list] == 1}
-            assert {[$second lrange list 0 -1] eq {d c b a}}
-
-            r -1 lpush list a b c d
-            $second config set requirepass foobar2
-            catch {r -1 migrate $second_host $second_port list 9 5000 AUTH foobar} err
-            assert_match {*WRONGPASS*} $err
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/expire.tcl b/redis-stable/tests/unit/expire.tcl
deleted file mode 100644
index 459503ad..00000000
--- a/redis-stable/tests/unit/expire.tcl
+++ /dev/null
@@ -1,414 +0,0 @@
-start_server {tags {"expire"}} {
-    test {EXPIRE - set timeouts multiple times} {
-        r set x foobar
-        set v1 [r expire x 5]
-        set v2 [r ttl x]
-        set v3 [r expire x 10]
-        set v4 [r ttl x]
-        r expire x 2
-        list $v1 $v2 $v3 $v4
-    } {1 [45] 1 10}
-
-    test {EXPIRE - It should be still possible to read 'x'} {
-        r get x
-    } {foobar}
-
-    tags {"slow"} {
-        test {EXPIRE - After 2.1 seconds the key should no longer be here} {
-            after 2100
-            list [r get x] [r exists x]
-        } {{} 0}
-    }
-
-    test {EXPIRE - write on expire should work} {
-        r del x
-        r lpush x foo
-        r expire x 1000
-        r lpush x bar
-        r lrange x 0 -1
-    } {bar foo}
-
-    test {EXPIREAT - Check for EXPIRE alike behavior} {
-        r del x
-        r set x foo
-        r expireat x [expr [clock seconds]+15]
-        r ttl x
-    } {1[345]}
-
-    test {SETEX - Set + Expire combo operation. Check for TTL} {
-        r setex x 12 test
-        r ttl x
-    } {1[012]}
-
-    test {SETEX - Check value} {
-        r get x
-    } {test}
-
-    test {SETEX - Overwrite old key} {
-        r setex y 1 foo
-        r get y
-    } {foo}
-
-    tags {"slow"} {
-        test {SETEX - Wait for the key to expire} {
-            after 1100
-            r get y
-        } {}
-    }
-
-    test {SETEX - Wrong time parameter} {
-        catch {r setex z -10 foo} e
-        set _ $e
-    } {*invalid expire*}
-
-    test {PERSIST can undo an EXPIRE} {
-        r set x foo
-        r expire x 50
-        list [r ttl x] [r persist x] [r ttl x] [r get x]
-    } {50 1 -1 foo}
-
-    test {PERSIST returns 0 against non existing or non volatile keys} {
-        r set x foo
-        list [r persist foo] [r persist nokeyatall]
-    } {0 0}
-
-    test {EXPIRE precision is now the millisecond} {
-        # This test is very likely to do a false positive if the
-        # server is under pressure, so if it does not work give it a few more
-        # chances.
-        for {set j 0} {$j < 10} {incr j} {
-            r del x
-            r setex x 1 somevalue
-            after 900
-            set a [r get x]
-            after 1100
-            set b [r get x]
-            if {$a eq {somevalue} && $b eq {}} break
-        }
-        if {$::verbose} {
-            puts "millisecond expire test attempts: $j"
-        }
-        list $a $b
-    } {somevalue {}}
-
-    test {PEXPIRE/PSETEX/PEXPIREAT can set sub-second expires} {
-        # This test is very likely to do a false positive if the
-        # server is under pressure, so if it does not work give it a few more
-        # chances.
-        for {set j 0} {$j < 30} {incr j} {
-            r del x y z
-            r psetex x 100 somevalue
-            after 80
-            set a [r get x]
-            after 120
-            set b [r get x]
-
-            r set x somevalue
-            r pexpire x 100
-            after 80
-            set c [r get x]
-            after 120
-            set d [r get x]
-
-            r set x somevalue
-            set now [r time]
-            r pexpireat x [expr ([lindex $now 0]*1000)+([lindex $now 1]/1000)+200]
-            after 20
-            set e [r get x]
-            after 220
-            set f [r get x]
-
-            if {$a eq {somevalue} && $b eq {} &&
-                $c eq {somevalue} && $d eq {} &&
-                $e eq {somevalue} && $f eq {}} break
-        }
-        if {$::verbose} {
-            puts "sub-second expire test attempts: $j"
-        }
-        list $a $b $c $d $e $f
-    } {somevalue {} somevalue {} somevalue {}}
-
-    test {TTL returns time to live in seconds} {
-        r del x
-        r setex x 10 somevalue
-        set ttl [r ttl x]
-        assert {$ttl > 8 && $ttl <= 10}
-    }
-
-    test {PTTL returns time to live in milliseconds} {
-        r del x
-        r setex x 1 somevalue
-        set ttl [r pttl x]
-        assert {$ttl > 900 && $ttl <= 1000}
-    }
-
-    test {TTL / PTTL return -1 if key has no expire} {
-        r del x
-        r set x hello
-        list [r ttl x] [r pttl x]
-    } {-1 -1}
-
-    test {TTL / PTTL return -2 if key does not exit} {
-        r del x
-        list [r ttl x] [r pttl x]
-    } {-2 -2}
-
-    test {Redis should actively expire keys incrementally} {
-        r flushdb
-        r psetex key1 500 a
-        r psetex key2 500 a
-        r psetex key3 500 a
-        set size1 [r dbsize]
-        # Redis expires random keys ten times every second so we are
-        # fairly sure that all the three keys should be evicted after
-        # one second.
-        after 1000
-        set size2 [r dbsize]
-        list $size1 $size2
-    } {3 0}
-
-    test {Redis should lazy expire keys} {
-        r flushdb
-        r debug set-active-expire 0
-        r psetex key1 500 a
-        r psetex key2 500 a
-        r psetex key3 500 a
-        set size1 [r dbsize]
-        # Redis expires random keys ten times every second so we are
-        # fairly sure that all the three keys should be evicted after
-        # one second.
-        after 1000
-        set size2 [r dbsize]
-        r mget key1 key2 key3
-        set size3 [r dbsize]
-        r debug set-active-expire 1
-        list $size1 $size2 $size3
-    } {3 3 0}
-
-    test {EXPIRE should not resurrect keys (issue #1026)} {
-        r debug set-active-expire 0
-        r set foo bar
-        r pexpire foo 500
-        after 1000
-        r expire foo 10
-        r debug set-active-expire 1
-        r exists foo
-    } {0}
-
-    test {5 keys in, 5 keys out} {
-        r flushdb
-        r set a c
-        r expire a 5
-        r set t c
-        r set e c
-        r set s c
-        r set foo b
-        lsort [r keys *]
-    } {a e foo s t}
-
-    test {EXPIRE with empty string as TTL should report an error} {
-        r set foo bar
-        catch {r expire foo ""} e
-        set e
-    } {*not an integer*}
-
-    test {SET with EX with big integer should report an error} {
-        catch {r set foo bar EX 10000000000000000} e
-        set e
-    } {ERR invalid expire time in set}
-
-    test {SET with EX with smallest integer should report an error} {
-        catch {r SET foo bar EX -9999999999999999} e
-        set e
-    } {ERR invalid expire time in set}
-
-    test {GETEX with big integer should report an error} {
-        r set foo bar
-        catch {r GETEX foo EX 10000000000000000} e
-        set e
-    } {ERR invalid expire time in getex}
-
-    test {GETEX with smallest integer should report an error} {
-        r set foo bar
-        catch {r GETEX foo EX -9999999999999999} e
-        set e
-    } {ERR invalid expire time in getex}
-
-    test {EXPIRE with big integer overflows when converted to milliseconds} {
-        r set foo bar
-        catch {r EXPIRE foo 10000000000000000} e
-        set e
-    } {ERR invalid expire time in expire}
-
-    test {PEXPIRE with big integer overflow when basetime is added} {
-        r set foo bar
-        catch {r PEXPIRE foo 9223372036854770000} e
-        set e
-    } {ERR invalid expire time in pexpire}
-
-    test {EXPIRE with big negative integer} {
-        r set foo bar
-        catch {r EXPIRE foo -9999999999999999} e
-        assert_match {ERR invalid expire time in expire} $e
-        r ttl foo
-    } {-1}
-
-    test {PEXPIREAT with big integer works} {
-        r set foo bar
-        r PEXPIREAT foo 9223372036854770000
-    } {1}
-
-    test {PEXPIREAT with big negative integer works} {
-        r set foo bar
-        r PEXPIREAT foo -9223372036854770000
-        r ttl foo
-    } {-2}
-
-    test {EXPIRE and SET/GETEX EX/PX/EXAT/PXAT option, TTL should not be reset after loadaof} {
-        # This test makes sure that expire times are propagated as absolute
-        # times to the AOF file and not as relative time, so that when the AOF
-        # is reloaded the TTLs are not being shifted forward to the future.
-        # We want the time to logically pass when the server is restarted!
-
-        r config set appendonly yes
-        r set foo1 bar EX 100
-        r set foo2 bar PX 100000
-        r set foo3 bar
-        r set foo4 bar
-        r expire foo3 100
-        r pexpire foo4 100000
-        r setex foo5 100 bar
-        r psetex foo6 100000 bar
-        r set foo7 bar EXAT [expr [clock seconds] + 100]
-        r set foo8 bar PXAT [expr [clock milliseconds] + 100000]
-        r set foo9 bar
-        r getex foo9 EX 100
-        r set foo10 bar
-        r getex foo10 PX 100000
-        r set foo11 bar
-        r getex foo11 EXAT [expr [clock seconds] + 100]
-        r set foo12 bar
-        r getex foo12 PXAT [expr [clock milliseconds] + 100000]
-
-        after 2000
-        r debug loadaof
-        assert_range [r ttl foo1] 90 98
-        assert_range [r ttl foo2] 90 98
-        assert_range [r ttl foo3] 90 98
-        assert_range [r ttl foo4] 90 98
-        assert_range [r ttl foo5] 90 98
-        assert_range [r ttl foo6] 90 98
-        assert_range [r ttl foo7] 90 98
-        assert_range [r ttl foo8] 90 98
-        assert_range [r ttl foo9] 90 98
-        assert_range [r ttl foo10] 90 98
-        assert_range [r ttl foo11] 90 98
-        assert_range [r ttl foo12] 90 98
-    }
-
-    test {EXPIRE relative and absolute propagation to replicas} {
-        # Make sure that relative and absolute expire commands are propagated
-        # "as is" to replicas.
-        # We want replicas to honor the same high level contract of expires that
-        # the master has, that is, we want the time to be counted logically
-        # starting from the moment the write was received. This usually provides
-        # the most coherent behavior from the point of view of the external
-        # users, with TTLs that are similar from the POV of the external observer.
-        #
-        # This test is here to stop some innocent / eager optimization or cleanup
-        # from doing the wrong thing without proper discussion, see:
-        # https://github.com/redis/redis/pull/5171#issuecomment-409553266
-
-        set repl [attach_to_replication_stream]
-        r set foo1 bar ex 200
-        r set foo1 bar px 100000
-        r set foo1 bar exat [expr [clock seconds]+100]
-        r set foo1 bar pxat [expr [clock milliseconds]+10000]
-        r setex foo1 100 bar
-        r psetex foo1 100000 bar
-        r set foo2 bar
-        r expire foo2 100
-        r pexpire foo2 100000
-        r set foo3 bar
-        r expireat foo3 [expr [clock seconds]+100]
-        r pexpireat foo3 [expr [clock seconds]*1000+100000]
-        r expireat foo3 [expr [clock seconds]-100]
-        r set foo4 bar
-        r getex foo4 ex 200
-        r getex foo4 px 200000
-        r getex foo4 exat [expr [clock seconds]+100]
-        r getex foo4 pxat [expr [clock milliseconds]+10000]
-        assert_replication_stream $repl {
-            {select *}
-            {set foo1 bar PX 200000}
-            {set foo1 bar PX 100000}
-            {set foo1 bar PXAT *}
-            {set foo1 bar PXAT *}
-            {set foo1 bar PX 100000}
-            {set foo1 bar PX 100000}
-            {set foo2 bar}
-            {expire foo2 100}
-            {pexpire foo2 100000}
-            {set foo3 bar}
-            {expireat foo3 *}
-            {pexpireat foo3 *}
-            {del foo3}
-            {set foo4 bar}
-            {pexpire foo4 200000}
-            {pexpire foo4 200000}
-            {pexpireat foo4 *}
-            {pexpireat foo4 *}
-        }
-    }
-
-    test {SET command will remove expire} {
-        r set foo bar EX 100
-        r set foo bar
-        r ttl foo
-    } {-1}
-
-    test {SET - use KEEPTTL option, TTL should not be removed} {
-        r set foo bar EX 100
-        r set foo bar KEEPTTL
-        set ttl [r ttl foo]
-        assert {$ttl <= 100 && $ttl > 90}
-    }
-
-    test {SET - use KEEPTTL option, TTL should not be removed after loadaof} {
-        r config set appendonly yes
-        r set foo bar EX 100
-        r set foo bar2 KEEPTTL
-        after 2000
-        r debug loadaof
-        set ttl [r ttl foo]
-        assert {$ttl <= 98 && $ttl > 90}
-    }
-
-    test {GETEX use of PERSIST option should remove TTL} {
-       r set foo bar EX 100
-       r getex foo PERSIST
-       r ttl foo
-    } {-1}
-
-    test {GETEX use of PERSIST option should remove TTL after loadaof} {
-       r set foo bar EX 100
-       r getex foo PERSIST
-       after 2000
-       r debug loadaof
-       r ttl foo
-    } {-1}
-
-    test {GETEX propagate as to replica as PERSIST, DEL, or nothing} {
-       set repl [attach_to_replication_stream]
-       r set foo bar EX 100
-       r getex foo PERSIST
-       r getex foo
-       r getex foo exat [expr [clock seconds]-100]
-       assert_replication_stream $repl {
-           {select *}
-           {set foo bar PX 100000}
-           {persist foo}
-           {del foo}
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/geo.tcl b/redis-stable/tests/unit/geo.tcl
deleted file mode 100644
index 3aa8f4d5..00000000
--- a/redis-stable/tests/unit/geo.tcl
+++ /dev/null
@@ -1,693 +0,0 @@
-# Helper functions to simulate search-in-radius in the Tcl side in order to
-# verify the Redis implementation with a fuzzy test.
-proc geo_degrad deg {expr {$deg*(atan(1)*8/360)}}
-proc geo_raddeg rad {expr {$rad/(atan(1)*8/360)}}
-
-proc geo_distance {lon1d lat1d lon2d lat2d} {
-    set lon1r [geo_degrad $lon1d]
-    set lat1r [geo_degrad $lat1d]
-    set lon2r [geo_degrad $lon2d]
-    set lat2r [geo_degrad $lat2d]
-    set v [expr {sin(($lon2r - $lon1r) / 2)}]
-    set u [expr {sin(($lat2r - $lat1r) / 2)}]
-    expr {2.0 * 6372797.560856 * \
-            asin(sqrt($u * $u + cos($lat1r) * cos($lat2r) * $v * $v))}
-}
-
-proc geo_random_point {lonvar latvar} {
-    upvar 1 $lonvar lon
-    upvar 1 $latvar lat
-    # Note that the actual latitude limit should be -85 to +85, we restrict
-    # the test to -70 to +70 since in this range the algorithm is more precise
-    # while outside this range occasionally some element may be missing.
-    set lon [expr {-180 + rand()*360}]
-    set lat [expr {-70 + rand()*140}]
-}
-
-# Return elements non common to both the lists.
-# This code is from http://wiki.tcl.tk/15489
-proc compare_lists {List1 List2} {
-   set DiffList {}
-   foreach Item $List1 {
-      if {[lsearch -exact $List2 $Item] == -1} {
-         lappend DiffList $Item
-      }
-   }
-   foreach Item $List2 {
-      if {[lsearch -exact $List1 $Item] == -1} {
-         if {[lsearch -exact $DiffList $Item] == -1} {
-            lappend DiffList $Item
-         }
-      }
-   }
-   return $DiffList
-}
-
-# return true If a point in circle.
-# search_lon and search_lat define the center of the circle,
-# and lon, lat define the point being searched.
-proc pointInCircle {radius_km lon lat search_lon search_lat} {
-    set radius_m [expr {$radius_km*1000}]
-    set distance [geo_distance $lon $lat $search_lon $search_lat]
-    if {$distance < $radius_m} {
-        return true
-    }
-    return false
-}
-
-# return true If a point in rectangle.
-# search_lon and search_lat define the center of the rectangle,
-# and lon, lat define the point being searched.
-# error: can adjust the width and height of the rectangle according to the error
-proc pointInRectangle {width_km height_km lon lat search_lon search_lat error} {
-    set width_m [expr {$width_km*1000*$error/2}]
-    set height_m [expr {$height_km*1000*$error/2}]
-    set lon_distance [geo_distance $lon $lat $search_lon $lat]
-    set lat_distance [geo_distance $lon $lat $lon $search_lat]
-
-    if {$lon_distance > $width_m || $lat_distance > $height_m} {
-        return false
-    }
-    return true
-}
-
-proc verify_geo_edge_response_bylonlat {expected_response expected_store_response} {
-    catch {r georadius src{t} 1 1 1 km} response
-    assert_match $expected_response $response
-
-    catch {r georadius src{t} 1 1 1 km store dest{t}} response
-    assert_match $expected_store_response $response
-
-    catch {r geosearch src{t} fromlonlat 0 0 byradius 1 km} response
-    assert_match $expected_response $response
-
-    catch {r geosearchstore dest{t} src{t} fromlonlat 0 0 byradius 1 km} response
-    assert_match $expected_store_response $response
-}
-
-proc verify_geo_edge_response_bymember {expected_response expected_store_response} {
-    catch {r georadiusbymember src{t} member 1 km} response
-    assert_match $expected_response $response
-
-    catch {r georadiusbymember src{t} member 1 km store dest{t}} response
-    assert_match $expected_store_response $response
-
-    catch {r geosearch src{t} frommember member bybox 1 1 km} response
-    assert_match $expected_response $response
-
-    catch {r geosearchstore dest{t} src{t} frommember member bybox 1 1 m} response
-    assert_match $expected_store_response $response
-}
-
-# The following list represents sets of random seed, search position
-# and radius that caused bugs in the past. It is used by the randomized
-# test later as a starting point. When the regression vectors are scanned
-# the code reverts to using random data.
-#
-# The format is: seed km lon lat
-set regression_vectors {
-    {1482225976969 7083 81.634948934258375 30.561509253718668}
-    {1482340074151 5416 -70.863281847379767 -46.347003465679947}
-    {1499014685896 6064 -89.818768962202014 -40.463868561416803}
-    {1412 156 149.29737817929004 15.95807862745508}
-    {441574 143 59.235461856813856 66.269555127373678}
-    {160645 187 -101.88575239939883 49.061997951502917}
-    {750269 154 -90.187939661642517 66.615930412251487}
-    {342880 145 163.03472387745728 64.012747720821181}
-    {729955 143 137.86663517256579 63.986745399416776}
-    {939895 151 59.149620271823181 65.204186651485145}
-    {1412 156 149.29737817929004 15.95807862745508}
-    {564862 149 84.062063109158544 -65.685403922426232}
-    {1546032440391 16751 -1.8175081637769495 20.665668878082954}
-}
-set rv_idx 0
-
-start_server {tags {"geo"}} {
-    test {GEO with wrong type src key} {
-        r set src{t} wrong_type
-
-        verify_geo_edge_response_bylonlat "WRONGTYPE*" "WRONGTYPE*"
-        verify_geo_edge_response_bymember "WRONGTYPE*" "WRONGTYPE*"
-    }
-
-    test {GEO with non existing src key} {
-        r del src{t}
-
-        verify_geo_edge_response_bylonlat {} 0
-        verify_geo_edge_response_bymember {} 0
-    }
-
-    test {GEO BYLONLAT with empty search} {
-        r del src{t}
-        r geoadd src{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
-
-        verify_geo_edge_response_bylonlat {} 0
-    }
-
-    test {GEO BYMEMBER with non existing member} {
-        r del src{t}
-        r geoadd src{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
-
-        verify_geo_edge_response_bymember "ERR*" "ERR*"
-    }
-
-    test {GEOADD create} {
-        r geoadd nyc -73.9454966 40.747533 "lic market"
-    } {1}
-
-    test {GEOADD update} {
-        r geoadd nyc -73.9454966 40.747533 "lic market"
-    } {0}
-
-    test {GEOADD update with CH option} {
-        assert_equal 1 [r geoadd nyc CH 40.747533 -73.9454966 "lic market"]
-        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
-        assert {abs($x1) - 40.747 < 0.001}
-        assert {abs($y1) - 73.945 < 0.001}
-    } {}
-
-    test {GEOADD update with NX option} {
-        assert_equal 0 [r geoadd nyc NX -73.9454966 40.747533 "lic market"]
-        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
-        assert {abs($x1) - 40.747 < 0.001}
-        assert {abs($y1) - 73.945 < 0.001}
-    } {}
-
-    test {GEOADD update with XX option} {
-        assert_equal 0 [r geoadd nyc XX -83.9454966 40.747533 "lic market"]
-        lassign [lindex [r geopos nyc "lic market"] 0] x1 y1
-        assert {abs($x1) - 83.945 < 0.001}
-        assert {abs($y1) - 40.747 < 0.001}
-    } {}
-
-    test {GEOADD update with CH NX option} {
-        r geoadd nyc CH NX -73.9454966 40.747533 "lic market"
-    } {0}
-
-    test {GEOADD update with CH XX option} {
-        r geoadd nyc CH XX -73.9454966 40.747533 "lic market"
-    } {1}
-
-    test {GEOADD update with XX NX option will return syntax error} {
-        catch {
-            r geoadd nyc xx nx -73.9454966 40.747533 "lic market"
-        } err
-        set err
-    } {ERR*syntax*}
-
-    test {GEOADD update with invalid option} {
-        catch {
-            r geoadd nyc ch xx foo -73.9454966 40.747533 "lic market"
-        } err
-        set err
-    } {ERR*syntax*}
-
-    test {GEOADD invalid coordinates} {
-        catch {
-            r geoadd nyc -73.9454966 40.747533 "lic market" \
-                foo bar "luck market"
-        } err
-        set err
-    } {*valid*}
-
-    test {GEOADD multi add} {
-        r geoadd nyc -73.9733487 40.7648057 "central park n/q/r" -73.9903085 40.7362513 "union square" -74.0131604 40.7126674 "wtc one" -73.7858139 40.6428986 "jfk" -73.9375699 40.7498929 "q4" -73.9564142 40.7480973 4545
-    } {6}
-
-    test {Check geoset values} {
-        r zrange nyc 0 -1 withscores
-    } {{wtc one} 1791873972053020 {union square} 1791875485187452 {central park n/q/r} 1791875761332224 4545 1791875796750882 {lic market} 1791875804419201 q4 1791875830079666 jfk 1791895905559723}
-
-    test {GEORADIUS simple (sorted)} {
-        r georadius nyc -73.9798091 40.7598464 3 km asc
-    } {{central park n/q/r} 4545 {union square}}
-
-    test {GEOSEARCH simple (sorted)} {
-        r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km asc
-    } {{central park n/q/r} 4545 {union square} {lic market}}
-
-    test {GEOSEARCH FROMLONLAT and FROMMEMBER cannot exist at the same time} {
-        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 frommember xxx bybox 6 6 km asc} e
-        set e
-    } {ERR*syntax*}
-
-    test {GEOSEARCH FROMLONLAT and FROMMEMBER one must exist} {
-        catch {r geosearch nyc bybox 3 3 km asc desc withhash withdist withcoord} e
-        set e
-    } {ERR*exactly one of FROMMEMBER or FROMLONLAT*}
-
-    test {GEOSEARCH BYRADIUS and BYBOX cannot exist at the same time} {
-        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 byradius 3 km bybox 3 3 km asc} e
-        set e
-    } {ERR*syntax*}
-
-    test {GEOSEARCH BYRADIUS and BYBOX one must exist} {
-        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 asc desc withhash withdist withcoord} e
-        set e
-    } {ERR*exactly one of BYRADIUS and BYBOX*}
-
-    test {GEOSEARCH with STOREDIST option} {
-        catch {r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km asc storedist} e
-        set e
-    } {ERR*syntax*}
-
-    test {GEORADIUS withdist (sorted)} {
-        r georadius nyc -73.9798091 40.7598464 3 km withdist asc
-    } {{{central park n/q/r} 0.7750} {4545 2.3651} {{union square} 2.7697}}
-
-    test {GEOSEARCH withdist (sorted)} {
-        r geosearch nyc fromlonlat -73.9798091 40.7598464 bybox 6 6 km withdist asc
-    } {{{central park n/q/r} 0.7750} {4545 2.3651} {{union square} 2.7697} {{lic market} 3.1991}}
-
-    test {GEORADIUS with COUNT} {
-        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3
-    } {{central park n/q/r} 4545 {union square}}
-
-    test {GEORADIUS with ANY not sorted by default} {
-        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3 ANY
-    } {{wtc one} {union square} {central park n/q/r}}
-
-    test {GEORADIUS with ANY sorted by ASC} {
-        r georadius nyc -73.9798091 40.7598464 10 km COUNT 3 ANY ASC
-    } {{central park n/q/r} {union square} {wtc one}}
-
-    test {GEORADIUS with ANY but no COUNT} {
-        catch {r georadius nyc -73.9798091 40.7598464 10 km ANY ASC} e
-        set e
-    } {ERR*ANY*requires*COUNT*}
-
-    test {GEORADIUS with COUNT but missing integer argument} {
-        catch {r georadius nyc -73.9798091 40.7598464 10 km COUNT} e
-        set e
-    } {ERR*syntax*}
-
-    test {GEORADIUS with COUNT DESC} {
-        r georadius nyc -73.9798091 40.7598464 10 km COUNT 2 DESC
-    } {{wtc one} q4}
-
-    test {GEORADIUS HUGE, issue #2767} {
-        r geoadd users -47.271613776683807 -54.534504198047678 user_000000
-        llength [r GEORADIUS users 0 0 50000 km WITHCOORD]
-    } {1}
-
-    test {GEORADIUSBYMEMBER simple (sorted)} {
-        r georadiusbymember nyc "wtc one" 7 km
-    } {{wtc one} {union square} {central park n/q/r} 4545 {lic market}}
-
-    test {GEOSEARCH FROMMEMBER simple (sorted)} {
-        r geosearch nyc frommember "wtc one" bybox 14 14 km
-    } {{wtc one} {union square} {central park n/q/r} 4545 {lic market} q4}
-
-    test {GEOSEARCH vs GEORADIUS} {
-        r del Sicily
-        r geoadd Sicily 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
-        r geoadd Sicily 12.758489 38.788135 "edge1"   17.241510 38.788135 "eage2"
-        set ret1 [r georadius Sicily 15 37 200 km asc]
-        assert_equal $ret1 {Catania Palermo}
-        set ret2 [r geosearch Sicily fromlonlat 15 37 bybox 400 400 km asc]
-        assert_equal $ret2 {Catania Palermo eage2 edge1}
-    }
-
-    test {GEOSEARCH non square, long and narrow} {
-        r del Sicily
-        r geoadd Sicily 12.75 36.995 "test1"
-        r geoadd Sicily 12.75 36.50 "test2"
-        r geoadd Sicily 13.00 36.50 "test3"
-        # box height=2km width=400km
-        set ret1 [r geosearch Sicily fromlonlat 15 37 bybox 400 2 km]
-        assert_equal $ret1 {test1}
-
-        # Add a western Hemisphere point
-        r geoadd Sicily -1 37.00 "test3"
-        set ret2 [r geosearch Sicily fromlonlat 15 37 bybox 3000 2 km asc]
-        assert_equal $ret2 {test1 test3}
-    }
-
-    test {GEOSEARCH corner point test} {
-        r del Sicily
-        r geoadd Sicily 12.758489 38.788135 edge1 17.241510 38.788135 edge2 17.250000 35.202000 edge3 12.750000 35.202000 edge4 12.748489955781654 37 edge5 15 38.798135872540925 edge6 17.251510044218346 37 edge7 15 35.201864127459075 edge8 12.692799634687903 38.798135872540925 corner1 12.692799634687903 38.798135872540925 corner2 17.200560937451133 35.201864127459075 corner3 12.799439062548865 35.201864127459075 corner4
-        set ret [lsort [r geosearch Sicily fromlonlat 15 37 bybox 400 400 km asc]]
-        assert_equal $ret {edge1 edge2 edge5 edge7}
-    }
-
-    test {GEORADIUSBYMEMBER withdist (sorted)} {
-        r georadiusbymember nyc "wtc one" 7 km withdist
-    } {{{wtc one} 0.0000} {{union square} 3.2544} {{central park n/q/r} 6.7000} {4545 6.1975} {{lic market} 6.8969}}
-
-    test {GEOHASH is able to return geohash strings} {
-        # Example from Wikipedia.
-        r del points
-        r geoadd points -5.6 42.6 test
-        lindex [r geohash points test] 0
-    } {ezs42e44yx0}
-
-    test {GEOPOS simple} {
-        r del points
-        r geoadd points 10 20 a 30 40 b
-        lassign [lindex [r geopos points a b] 0] x1 y1
-        lassign [lindex [r geopos points a b] 1] x2 y2
-        assert {abs($x1 - 10) < 0.001}
-        assert {abs($y1 - 20) < 0.001}
-        assert {abs($x2 - 30) < 0.001}
-        assert {abs($y2 - 40) < 0.001}
-    }
-
-    test {GEOPOS missing element} {
-        r del points
-        r geoadd points 10 20 a 30 40 b
-        lindex [r geopos points a x b] 1
-    } {}
-
-    test {GEODIST simple & unit} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        set m [r geodist points Palermo Catania]
-        assert {$m > 166274 && $m < 166275}
-        set km [r geodist points Palermo Catania km]
-        assert {$km > 166.2 && $km < 166.3}
-    }
-
-    test {GEODIST missing elements} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        set m [r geodist points Palermo Agrigento]
-        assert {$m eq {}}
-        set m [r geodist points Ragusa Agrigento]
-        assert {$m eq {}}
-        set m [r geodist empty_key Palermo Catania]
-        assert {$m eq {}}
-    }
-
-    test {GEORADIUS STORE option: syntax error} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        catch {r georadius points 13.361389 38.115556 50 km store} e
-        set e
-    } {*ERR*syntax*}
-
-    test {GEOSEARCHSTORE STORE option: syntax error} {
-        catch {r geosearchstore abc points fromlonlat 13.361389 38.115556 byradius 50 km store abc} e
-        set e
-    } {*ERR*syntax*}
-
-    test {GEORANGE STORE option: incompatible options} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        catch {r georadius points 13.361389 38.115556 50 km store points2 withdist} e
-        assert_match {*ERR*} $e
-        catch {r georadius points 13.361389 38.115556 50 km store points2 withhash} e
-        assert_match {*ERR*} $e
-        catch {r georadius points 13.361389 38.115556 50 km store points2 withcoords} e
-        assert_match {*ERR*} $e
-    }
-
-    test {GEORANGE STORE option: plain usage} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        r georadius points 13.361389 38.115556 500 km store points2
-        assert_equal [r zrange points 0 -1] [r zrange points2 0 -1]
-    }
-
-    test {GEORADIUSBYMEMBER STORE/STOREDIST option: plain usage} {
-        r del points{t}
-        r geoadd points{t} 13.361389 38.115556 "Palermo" 15.087269 37.502669 "Catania"
-
-        r georadiusbymember points{t} Palermo 500 km store points2{t}
-        assert_equal {Palermo Catania} [r zrange points2{t} 0 -1]
-
-        r georadiusbymember points{t} Catania 500 km storedist points2{t}
-        assert_equal {Catania Palermo} [r zrange points2{t} 0 -1]
-
-        set res [r zrange points2{t} 0 -1 withscores]
-        assert {[lindex $res 1] < 1}
-        assert {[lindex $res 3] > 166}
-    }
-
-    test {GEOSEARCHSTORE STORE option: plain usage} {
-        r geosearchstore points2 points fromlonlat 13.361389 38.115556 byradius 500 km
-        assert_equal [r zrange points 0 -1] [r zrange points2 0 -1]
-    }
-
-    test {GEORANGE STOREDIST option: plain usage} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        r georadius points 13.361389 38.115556 500 km storedist points2
-        set res [r zrange points2 0 -1 withscores]
-        assert {[lindex $res 1] < 1}
-        assert {[lindex $res 3] > 166}
-        assert {[lindex $res 3] < 167}
-    }
-
-    test {GEOSEARCHSTORE STOREDIST option: plain usage} {
-        r geosearchstore points2 points fromlonlat 13.361389 38.115556 byradius 500 km storedist
-        set res [r zrange points2 0 -1 withscores]
-        assert {[lindex $res 1] < 1}
-        assert {[lindex $res 3] > 166}
-        assert {[lindex $res 3] < 167}
-    }
-
-    test {GEORANGE STOREDIST option: COUNT ASC and DESC} {
-        r del points
-        r geoadd points 13.361389 38.115556 "Palermo" \
-                        15.087269 37.502669 "Catania"
-        r georadius points 13.361389 38.115556 500 km storedist points2 asc count 1
-        assert {[r zcard points2] == 1}
-        set res [r zrange points2 0 -1 withscores]
-        assert {[lindex $res 0] eq "Palermo"}
-
-        r georadius points 13.361389 38.115556 500 km storedist points2 desc count 1
-        assert {[r zcard points2] == 1}
-        set res [r zrange points2 0 -1 withscores]
-        assert {[lindex $res 0] eq "Catania"}
-    }
-
-    test {GEOSEARCH the box spans -180° or 180°} {
-        r del points
-        r geoadd points 179.5 36 point1
-        r geoadd points -179.5 36 point2
-        assert_equal {point1 point2} [r geosearch points fromlonlat 179 37 bybox 400 400 km asc]
-        assert_equal {point2 point1} [r geosearch points fromlonlat -179 37 bybox 400 400 km asc]
-    }
-
-    foreach {type} {byradius bybox} {
-    test "GEOSEARCH fuzzy test - $type" {
-        if {$::accurate} { set attempt 300 } else { set attempt 30 }
-        while {[incr attempt -1]} {
-            set rv [lindex $regression_vectors $rv_idx]
-            incr rv_idx
-
-            set radius_km 0; set width_km 0; set height_km 0
-            unset -nocomplain debuginfo
-            set srand_seed [clock milliseconds]
-            if {$rv ne {}} {set srand_seed [lindex $rv 0]}
-            lappend debuginfo "srand_seed is $srand_seed"
-            expr {srand($srand_seed)} ; # If you need a reproducible run
-            r del mypoints
-
-            if {[randomInt 10] == 0} {
-                # From time to time use very big radiuses
-                if {$type == "byradius"} {
-                    set radius_km [expr {[randomInt 5000]+10}]
-                } elseif {$type == "bybox"} {
-                    set width_km [expr {[randomInt 5000]+10}]
-                    set height_km [expr {[randomInt 5000]+10}]
-                }
-            } else {
-                # Normally use a few - ~200km radiuses to stress
-                # test the code the most in edge cases.
-                if {$type == "byradius"} {
-                    set radius_km [expr {[randomInt 200]+10}]
-                } elseif {$type == "bybox"} {
-                    set width_km [expr {[randomInt 200]+10}]
-                    set height_km [expr {[randomInt 200]+10}]
-                }
-            }
-            if {$rv ne {}} {
-                set radius_km [lindex $rv 1]
-                set width_km [lindex $rv 1]
-                set height_km [lindex $rv 1]
-            }
-            geo_random_point search_lon search_lat
-            if {$rv ne {}} {
-                set search_lon [lindex $rv 2]
-                set search_lat [lindex $rv 3]
-            }
-            lappend debuginfo "Search area: $search_lon,$search_lat $radius_km $width_km $height_km km"
-            set tcl_result {}
-            set argv {}
-            for {set j 0} {$j < 20000} {incr j} {
-                geo_random_point lon lat
-                lappend argv $lon $lat "place:$j"
-                if {$type == "byradius"} {
-                    if {[pointInCircle $radius_km $lon $lat $search_lon $search_lat]} {
-                        lappend tcl_result "place:$j"
-                    }
-                } elseif {$type == "bybox"} {
-                    if {[pointInRectangle $width_km $height_km $lon $lat $search_lon $search_lat 1]} {
-                        lappend tcl_result "place:$j"
-                    }
-                }
-                lappend debuginfo "place:$j $lon $lat"
-            }
-            r geoadd mypoints {*}$argv
-            if {$type == "byradius"} {
-                set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat byradius $radius_km km]]
-            } elseif {$type == "bybox"} {
-                set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_km $height_km km]]
-            }
-            set res2 [lsort $tcl_result]
-            set test_result OK
-
-            if {$res != $res2} {
-                set rounding_errors 0
-                set diff [compare_lists $res $res2]
-                foreach place $diff {
-                    lassign [lindex [r geopos mypoints $place] 0] lon lat
-                    set mydist [geo_distance $lon $lat $search_lon $search_lat]
-                    set mydist [expr $mydist/1000]
-                    if {$type == "byradius"} {
-                        if {($mydist / $radius_km) > 0.999} {
-                            incr rounding_errors
-                            continue
-                        }
-                        if {$mydist < [expr {$radius_km*1000}]} {
-                            # This is a false positive for redis since given the
-                            # same points the higher precision calculation provided
-                            # by TCL shows the point within range
-                            incr rounding_errors
-                            continue
-                        }
-                    } elseif {$type == "bybox"} {
-                        # we add 0.1% error for floating point calculation error
-                        if {[pointInRectangle $width_km $height_km $lon $lat $search_lon $search_lat 1.001]} {
-                            incr rounding_errors
-                            continue
-                        }
-                    }
-                }
-
-                # Make sure this is a real error and not a rounidng issue.
-                if {[llength $diff] == $rounding_errors} {
-                    set res $res2; # Error silenced
-                }
-            }
-
-            if {$res != $res2} {
-                set diff [compare_lists $res $res2]
-                puts "*** Possible problem in GEO radius query ***"
-                puts "Redis: $res"
-                puts "Tcl  : $res2"
-                puts "Diff : $diff"
-                puts [join $debuginfo "\n"]
-                foreach place $diff {
-                    if {[lsearch -exact $res2 $place] != -1} {
-                        set where "(only in Tcl)"
-                    } else {
-                        set where "(only in Redis)"
-                    }
-                    lassign [lindex [r geopos mypoints $place] 0] lon lat
-                    set mydist [geo_distance $lon $lat $search_lon $search_lat]
-                    set mydist [expr $mydist/1000]
-                    puts "$place -> [r geopos mypoints $place] $mydist $where"
-                }
-                set test_result FAIL
-            }
-            unset -nocomplain debuginfo
-            if {$test_result ne {OK}} break
-        }
-        set test_result
-    } {OK}
-    }
-
-    test {GEOSEARCH box edges fuzzy test} {
-        if {$::accurate} { set attempt 300 } else { set attempt 30 }
-        while {[incr attempt -1]} {
-            unset -nocomplain debuginfo
-            set srand_seed [clock milliseconds]
-            lappend debuginfo "srand_seed is $srand_seed"
-            expr {srand($srand_seed)} ; # If you need a reproducible run
-            r del mypoints
-
-            geo_random_point search_lon search_lat
-            set width_m [expr {[randomInt 10000]+10}]
-            set height_m [expr {[randomInt 10000]+10}]
-            set lat_delta [geo_raddeg [expr {$height_m/2/6372797.560856}]]
-            set long_delta_top [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad [expr {$search_lat+$lat_delta}]])}]]
-            set long_delta_middle [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad $search_lat])}]]
-            set long_delta_bottom [geo_raddeg [expr {$width_m/2/6372797.560856/cos([geo_degrad [expr {$search_lat-$lat_delta}]])}]]
-
-            # Total of 8 points are generated, which are located at each vertex and the center of each side
-            set points(north) [list $search_lon [expr {$search_lat+$lat_delta}]]
-            set points(south) [list $search_lon [expr {$search_lat-$lat_delta}]]
-            set points(east) [list [expr {$search_lon+$long_delta_middle}] $search_lat]
-            set points(west) [list [expr {$search_lon-$long_delta_middle}] $search_lat]
-            set points(north_east) [list [expr {$search_lon+$long_delta_top}] [expr {$search_lat+$lat_delta}]]
-            set points(north_west) [list [expr {$search_lon-$long_delta_top}] [expr {$search_lat+$lat_delta}]]
-            set points(south_east) [list [expr {$search_lon+$long_delta_bottom}] [expr {$search_lat-$lat_delta}]]
-            set points(south_west) [list [expr {$search_lon-$long_delta_bottom}] [expr {$search_lat-$lat_delta}]]
-
-            lappend debuginfo "Search area: geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_m $height_m m"
-            set tcl_result {}
-            foreach name [array names points] {
-                set x [lindex $points($name) 0]
-                set y [lindex $points($name) 1]
-                # If longitude crosses -180° or 180°, we need to convert it.
-                # latitude doesn't have this problem, because it's scope is -70~70, see geo_random_point
-                if {$x > 180} {
-                    set x [expr {$x-360}]
-                } elseif {$x < -180} {
-                    set x [expr {$x+360}]
-                }
-                r geoadd mypoints $x $y place:$name
-                lappend tcl_result "place:$name"
-                lappend debuginfo "geoadd mypoints $x $y place:$name"
-            }
-
-            set res2 [lsort $tcl_result]
-
-            # make the box larger by two meter in each direction to put the coordinate slightly inside the box.
-            set height_new [expr {$height_m+4}]
-            set width_new [expr {$width_m+4}]
-            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
-            if {$res != $res2} {
-                set diff [compare_lists $res $res2]
-                lappend debuginfo "res: $res, res2: $res2, diff: $diff"
-                fail "place should be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
-            }
-
-            # The width decreases and the height increases. Only north and south are found
-            set width_new [expr {$width_m-4}]
-            set height_new [expr {$height_m+4}]
-            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
-            if {$res != {place:north place:south}} {
-                lappend debuginfo "res: $res"
-                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
-            }
-
-            # The width increases and the height decreases. Only ease and west are found
-            set width_new [expr {$width_m+4}]
-            set height_new [expr {$height_m-4}]
-            set res [lsort [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]]
-            if {$res != {place:east place:west}} {
-                lappend debuginfo "res: $res"
-                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
-            }
-
-            # make the box smaller by two meter in each direction to put the coordinate slightly outside the box.
-            set height_new [expr {$height_m-4}]
-            set width_new [expr {$width_m-4}]
-            set res [r geosearch mypoints fromlonlat $search_lon $search_lat bybox $width_new $height_new m]
-            if {$res != ""} {
-                lappend debuginfo "res: $res"
-                fail "place should not be found, debuginfo: $debuginfo, height_new: $height_new width_new: $width_new"
-            }
-            unset -nocomplain debuginfo
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/hyperloglog.tcl b/redis-stable/tests/unit/hyperloglog.tcl
deleted file mode 100644
index db26a2e7..00000000
--- a/redis-stable/tests/unit/hyperloglog.tcl
+++ /dev/null
@@ -1,213 +0,0 @@
-start_server {tags {"hll"}} {
-    test {HyperLogLog self test passes} {
-        catch {r pfselftest} e
-        set e
-    } {OK}
-
-    test {PFADD without arguments creates an HLL value} {
-        r pfadd hll
-        r exists hll
-    } {1}
-
-    test {Approximated cardinality after creation is zero} {
-        r pfcount hll
-    } {0}
-
-    test {PFADD returns 1 when at least 1 reg was modified} {
-        r pfadd hll a b c
-    } {1}
-
-    test {PFADD returns 0 when no reg was modified} {
-        r pfadd hll a b c
-    } {0}
-
-    test {PFADD works with empty string (regression)} {
-        r pfadd hll ""
-    }
-
-    # Note that the self test stresses much better the
-    # cardinality estimation error. We are testing just the
-    # command implementation itself here.
-    test {PFCOUNT returns approximated cardinality of set} {
-        r del hll
-        set res {}
-        r pfadd hll 1 2 3 4 5
-        lappend res [r pfcount hll]
-        # Call it again to test cached value invalidation.
-        r pfadd hll 6 7 8 8 9 10
-        lappend res [r pfcount hll]
-        set res
-    } {5 10}
-
-    test {HyperLogLogs are promote from sparse to dense} {
-        r del hll
-        r config set hll-sparse-max-bytes 3000
-        set n 0
-        while {$n < 100000} {
-            set elements {}
-            for {set j 0} {$j < 100} {incr j} {lappend elements [expr rand()]}
-            incr n 100
-            r pfadd hll {*}$elements
-            set card [r pfcount hll]
-            set err [expr {abs($card-$n)}]
-            assert {$err < (double($card)/100)*5}
-            if {$n < 1000} {
-                assert {[r pfdebug encoding hll] eq {sparse}}
-            } elseif {$n > 10000} {
-                assert {[r pfdebug encoding hll] eq {dense}}
-            }
-        }
-    }
-
-    test {HyperLogLog sparse encoding stress test} {
-        for {set x 0} {$x < 1000} {incr x} {
-            r del hll1 hll2
-            set numele [randomInt 100]
-            set elements {}
-            for {set j 0} {$j < $numele} {incr j} {
-                lappend elements [expr rand()]
-            }
-            # Force dense representation of hll2
-            r pfadd hll2
-            r pfdebug todense hll2
-            r pfadd hll1 {*}$elements
-            r pfadd hll2 {*}$elements
-            assert {[r pfdebug encoding hll1] eq {sparse}}
-            assert {[r pfdebug encoding hll2] eq {dense}}
-            # Cardinality estimated should match exactly.
-            assert {[r pfcount hll1] eq [r pfcount hll2]}
-        }
-    }
-
-    test {Corrupted sparse HyperLogLogs are detected: Additional at tail} {
-        r del hll
-        r pfadd hll a b c
-        r append hll "hello"
-        set e {}
-        catch {r pfcount hll} e
-        set e
-    } {*INVALIDOBJ*}
-
-    test {Corrupted sparse HyperLogLogs are detected: Broken magic} {
-        r del hll
-        r pfadd hll a b c
-        r setrange hll 0 "0123"
-        set e {}
-        catch {r pfcount hll} e
-        set e
-    } {*WRONGTYPE*}
-
-    test {Corrupted sparse HyperLogLogs are detected: Invalid encoding} {
-        r del hll
-        r pfadd hll a b c
-        r setrange hll 4 "x"
-        set e {}
-        catch {r pfcount hll} e
-        set e
-    } {*WRONGTYPE*}
-
-    test {Corrupted dense HyperLogLogs are detected: Wrong length} {
-        r del hll
-        r pfadd hll a b c
-        r setrange hll 4 "\x00"
-        set e {}
-        catch {r pfcount hll} e
-        set e
-    } {*WRONGTYPE*}
-
-    test {Fuzzing dense/sparse encoding: Redis should always detect errors} {
-        for {set j 0} {$j < 1000} {incr j} {
-            r del hll
-            set items {}
-            set numitems [randomInt 3000]
-            for {set i 0} {$i < $numitems} {incr i} {
-                lappend items [expr {rand()}]
-            }
-            r pfadd hll {*}$items
-
-            # Corrupt it in some random way.
-            for {set i 0} {$i < 5} {incr i} {
-                set len [r strlen hll]
-                set pos [randomInt $len]
-                set byte [randstring 1 1 binary]
-                r setrange hll $pos $byte
-                # Don't modify more bytes 50% of times
-                if {rand() < 0.5} break
-            }
-
-            # Use the hyperloglog to check if it crashes
-            # Redis in some way.
-            catch {
-                r pfcount hll
-            }
-        }
-    }
-
-    test {PFADD, PFCOUNT, PFMERGE type checking works} {
-        r set foo bar
-        catch {r pfadd foo 1} e
-        assert_match {*WRONGTYPE*} $e
-        catch {r pfcount foo} e
-        assert_match {*WRONGTYPE*} $e
-        catch {r pfmerge bar foo} e
-        assert_match {*WRONGTYPE*} $e
-        catch {r pfmerge foo bar} e
-        assert_match {*WRONGTYPE*} $e
-    }
-
-    test {PFMERGE results on the cardinality of union of sets} {
-        r del hll hll1 hll2 hll3
-        r pfadd hll1 a b c
-        r pfadd hll2 b c d
-        r pfadd hll3 c d e
-        r pfmerge hll hll1 hll2 hll3
-        r pfcount hll
-    } {5}
-
-    test {PFCOUNT multiple-keys merge returns cardinality of union #1} {
-        r del hll1 hll2 hll3
-        for {set x 1} {$x < 10000} {incr x} {
-            r pfadd hll1 "foo-$x"
-            r pfadd hll2 "bar-$x"
-            r pfadd hll3 "zap-$x"
-
-            set card [r pfcount hll1 hll2 hll3]
-            set realcard [expr {$x*3}]
-            set err [expr {abs($card-$realcard)}]
-            assert {$err < (double($card)/100)*5}
-        }
-    }
-
-    test {PFCOUNT multiple-keys merge returns cardinality of union #2} {
-        r del hll1 hll2 hll3
-        set elements {}
-        for {set x 1} {$x < 10000} {incr x} {
-            for {set j 1} {$j <= 3} {incr j} {
-                set rint [randomInt 20000]
-                r pfadd hll$j $rint
-                lappend elements $rint
-            }
-        }
-        set realcard [llength [lsort -unique $elements]]
-        set card [r pfcount hll1 hll2 hll3]
-        set err [expr {abs($card-$realcard)}]
-        assert {$err < (double($card)/100)*5}
-    }
-
-    test {PFDEBUG GETREG returns the HyperLogLog raw registers} {
-        r del hll
-        r pfadd hll 1 2 3
-        llength [r pfdebug getreg hll]
-    } {16384}
-
-    test {PFADD / PFCOUNT cache invalidation works} {
-        r del hll
-        r pfadd hll a b c
-        r pfcount hll
-        assert {[r getrange hll 15 15] eq "\x00"}
-        r pfadd hll a b c
-        assert {[r getrange hll 15 15] eq "\x00"}
-        r pfadd hll 1 2 3
-        assert {[r getrange hll 15 15] eq "\x80"}
-    }
-}
diff --git a/redis-stable/tests/unit/info.tcl b/redis-stable/tests/unit/info.tcl
deleted file mode 100644
index 61be4a0d..00000000
--- a/redis-stable/tests/unit/info.tcl
+++ /dev/null
@@ -1,175 +0,0 @@
-proc cmdstat {cmd} {
-    return [cmdrstat $cmd r]
-}
-
-proc errorstat {cmd} {
-    return [errorrstat $cmd r]
-}
-
-start_server {tags {"info"}} {
-    start_server {} {
-
-        test {errorstats: failed call authentication error} {
-            r config resetstat
-            assert_match {} [errorstat ERR]
-            assert_equal [s total_error_replies] 0
-            catch {r auth k} e
-            assert_match {ERR AUTH*} $e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat auth]
-            assert_equal [s total_error_replies] 1
-            r config resetstat
-            assert_match {} [errorstat ERR]
-        }
-
-        test {errorstats: failed call within MULTI/EXEC} {
-            r config resetstat
-            assert_match {} [errorstat ERR]
-            assert_equal [s total_error_replies] 0
-            r multi
-            r set a b
-            r auth a
-            catch {r exec} e
-            assert_match {ERR AUTH*} $e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat set]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat auth]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat exec]
-            assert_equal [s total_error_replies] 1
-
-            # MULTI/EXEC command errors should still be pinpointed to him
-            catch {r exec} e
-            assert_match {ERR EXEC without MULTI} $e
-            assert_match {*calls=2,*,rejected_calls=0,failed_calls=1} [cmdstat exec]
-            assert_match {*count=2*} [errorstat ERR]
-            assert_equal [s total_error_replies] 2
-        }
-
-        test {errorstats: failed call within LUA} {
-            r config resetstat
-            assert_match {} [errorstat ERR]
-            assert_equal [s total_error_replies] 0
-            catch {r eval {redis.pcall('XGROUP', 'CREATECONSUMER', 's1', 'mygroup', 'consumer') return } 0} e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat xgroup]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat eval]
-
-            # EVAL command errors should still be pinpointed to him
-            catch {r eval a} e
-            assert_match {ERR wrong*} $e
-            assert_match {*calls=1,*,rejected_calls=1,failed_calls=0} [cmdstat eval]
-            assert_match {*count=2*} [errorstat ERR]
-            assert_equal [s total_error_replies] 2
-        }
-
-        test {errorstats: failed call NOSCRIPT error} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat NOSCRIPT]
-            catch {r evalsha NotValidShaSUM 0} e
-            assert_match {NOSCRIPT*} $e
-            assert_match {*count=1*} [errorstat NOSCRIPT]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat evalsha]
-            assert_equal [s total_error_replies] 1
-            r config resetstat
-            assert_match {} [errorstat NOSCRIPT]
-        }
-
-        test {errorstats: failed call NOGROUP error} {
-            r config resetstat
-            assert_match {} [errorstat NOGROUP]
-            r del mystream
-            r XADD mystream * f v
-            catch {r XGROUP CREATECONSUMER mystream mygroup consumer} e
-            assert_match {NOGROUP*} $e
-            assert_match {*count=1*} [errorstat NOGROUP]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat xgroup]
-            r config resetstat
-            assert_match {} [errorstat NOGROUP]
-        }
-
-        test {errorstats: rejected call unknown command} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat ERR]
-            catch {r asdf} e
-            assert_match {ERR unknown*} $e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_equal [s total_error_replies] 1
-            r config resetstat
-            assert_match {} [errorstat ERR]
-        }
-
-        test {errorstats: rejected call within MULTI/EXEC} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat ERR]
-            r multi
-            catch {r set} e
-            assert_match {ERR wrong number of arguments*} $e
-            catch {r exec} e
-            assert_match {EXECABORT*} $e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_match {*count=1*} [errorstat EXECABORT]
-            assert_equal [s total_error_replies] 2
-            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=0} [cmdstat multi]
-            assert_match {*calls=1,*,rejected_calls=0,failed_calls=1} [cmdstat exec]
-            assert_equal [s total_error_replies] 2
-            r config resetstat
-            assert_match {} [errorstat ERR]
-        }
-
-        test {errorstats: rejected call due to wrong arity} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat ERR]
-            catch {r set k} e
-            assert_match {ERR wrong number of arguments*} $e
-            assert_match {*count=1*} [errorstat ERR]
-            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
-            # ensure that after a rejected command, valid ones are counted properly
-            r set k1 v1
-            r set k2 v2
-            assert_match {calls=2,*,rejected_calls=1,failed_calls=0} [cmdstat set]
-            assert_equal [s total_error_replies] 1
-        }
-
-        test {errorstats: rejected call by OOM error} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat OOM]
-            r config set maxmemory 1
-            catch {r set a b} e
-            assert_match {OOM*} $e
-            assert_match {*count=1*} [errorstat OOM]
-            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
-            assert_equal [s total_error_replies] 1
-            r config resetstat
-            assert_match {} [errorstat OOM]
-        }
-
-        test {errorstats: rejected call by authorization error} {
-            r config resetstat
-            assert_equal [s total_error_replies] 0
-            assert_match {} [errorstat NOPERM]
-            r ACL SETUSER alice on >p1pp0 ~cached:* +get +info +config
-            r auth alice p1pp0
-            catch {r set a b} e
-            assert_match {NOPERM*} $e
-            assert_match {*count=1*} [errorstat NOPERM]
-            assert_match {*calls=0,*,rejected_calls=1,failed_calls=0} [cmdstat set]
-            assert_equal [s total_error_replies] 1
-            r config resetstat
-            assert_match {} [errorstat NOPERM]
-        }
-    }
-
-    start_server {} {
-        test {Unsafe command names are sanitized in INFO output} {
-            catch {r host:} e
-            set info [r info commandstats]
-            assert_match {*cmdstat_host_:calls=1*} $info
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/introspection-2.tcl b/redis-stable/tests/unit/introspection-2.tcl
deleted file mode 100644
index a34a15d6..00000000
--- a/redis-stable/tests/unit/introspection-2.tcl
+++ /dev/null
@@ -1,79 +0,0 @@
-proc cmdstat {cmd} {
-    return [cmdrstat $cmd r]
-}
-
-start_server {tags {"introspection"}} {
-    test {TTL, TYPE and EXISTS do not alter the last access time of a key} {
-        r set foo bar
-        after 3000
-        r ttl foo
-        r type foo
-        r exists foo
-        assert {[r object idletime foo] >= 2}
-    }
-
-    test {TOUCH alters the last access time of a key} {
-        r set foo bar
-        after 3000
-        r touch foo
-        assert {[r object idletime foo] < 2}
-    }
-
-    test {TOUCH returns the number of existing keys specified} {
-        r flushdb
-        r set key1 1
-        r set key2 2
-        r touch key0 key1 key2 key3
-    } 2
-
-    test {command stats for GEOADD} {
-        r config resetstat
-        r GEOADD foo 0 0 bar
-        assert_match {*calls=1,*} [cmdstat geoadd]
-        assert_match {} [cmdstat zadd]
-    }
-
-    test {command stats for EXPIRE} {
-        r config resetstat
-        r SET foo bar
-        r EXPIRE foo 0
-        assert_match {*calls=1,*} [cmdstat expire]
-        assert_match {} [cmdstat del]
-    }
-
-    test {command stats for BRPOP} {
-        r config resetstat
-        r LPUSH list foo
-        r BRPOP list 0
-        assert_match {*calls=1,*} [cmdstat brpop]
-        assert_match {} [cmdstat rpop]
-    }
-
-    test {command stats for MULTI} {
-        r config resetstat
-        r MULTI
-        r set foo bar
-        r GEOADD foo2 0 0 bar
-        r EXPIRE foo2 0
-        r EXEC
-        assert_match {*calls=1,*} [cmdstat multi]
-        assert_match {*calls=1,*} [cmdstat exec]
-        assert_match {*calls=1,*} [cmdstat set]
-        assert_match {*calls=1,*} [cmdstat expire]
-        assert_match {*calls=1,*} [cmdstat geoadd]
-    }
-
-    test {command stats for scripts} {
-        r config resetstat
-        r set mykey myval
-        r eval {
-            redis.call('set', KEYS[1], 0)
-            redis.call('expire', KEYS[1], 0)
-            redis.call('geoadd', KEYS[1], 0, 0, "bar")
-        } 1 mykey
-        assert_match {*calls=1,*} [cmdstat eval]
-        assert_match {*calls=2,*} [cmdstat set]
-        assert_match {*calls=1,*} [cmdstat expire]
-        assert_match {*calls=1,*} [cmdstat geoadd]
-    }
-}
diff --git a/redis-stable/tests/unit/introspection.tcl b/redis-stable/tests/unit/introspection.tcl
deleted file mode 100644
index 0c78edf2..00000000
--- a/redis-stable/tests/unit/introspection.tcl
+++ /dev/null
@@ -1,251 +0,0 @@
-start_server {tags {"introspection"}} {
-    test {CLIENT LIST} {
-        r client list
-    } {*addr=*:* fd=* age=* idle=* flags=N db=9 sub=0 psub=0 multi=-1 qbuf=26 qbuf-free=* argv-mem=* obl=0 oll=0 omem=0 tot-mem=* events=r cmd=client*}
-
-    test {CLIENT LIST with IDs} {
-        set myid [r client id]
-        set cl [split [r client list id $myid] "\r\n"]
-        assert_match "id=$myid*" [lindex $cl 0]
-    }
-
-    test {CLIENT INFO} {
-        r client info
-    } {*addr=*:* fd=* age=* idle=* flags=N db=9 sub=0 psub=0 multi=-1 qbuf=26 qbuf-free=* argv-mem=* obl=0 oll=0 omem=0 tot-mem=* events=r cmd=client*}
-
-    test {MONITOR can log executed commands} {
-        set rd [redis_deferring_client]
-        $rd monitor
-        assert_match {*OK*} [$rd read]
-        r set foo bar
-        r get foo
-        list [$rd read] [$rd read]
-    } {*"set" "foo"*"get" "foo"*}
-
-    test {MONITOR can log commands issued by the scripting engine} {
-        set rd [redis_deferring_client]
-        $rd monitor
-        $rd read ;# Discard the OK
-        r eval {redis.call('set',KEYS[1],ARGV[1])} 1 foo bar
-        assert_match {*eval*} [$rd read]
-        assert_match {*lua*"set"*"foo"*"bar"*} [$rd read]
-    }
-
-    test {MONITOR supports redacting command arguments} {
-        set rd [redis_deferring_client]
-        $rd monitor
-        $rd read ; # Discard the OK
-
-        r migrate [srv 0 host] [srv 0 port] key 9 5000
-        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH user
-        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH2 user password
-        catch {r auth not-real} _
-        catch {r auth not-real not-a-password} _
-        catch {r hello 2 AUTH not-real not-a-password} _
-
-        assert_match {*"key"*"9"*"5000"*} [$rd read]
-        assert_match {*"key"*"9"*"5000"*"(redacted)"*} [$rd read]
-        assert_match {*"key"*"9"*"5000"*"(redacted)"*"(redacted)"*} [$rd read]
-        assert_match {*"auth"*"(redacted)"*} [$rd read]
-        assert_match {*"auth"*"(redacted)"*"(redacted)"*} [$rd read]
-        assert_match {*"hello"*"2"*"AUTH"*"(redacted)"*"(redacted)"*} [$rd read]
-        $rd close
-    }
-
-    test {MONITOR correctly handles multi-exec cases} {
-        set rd [redis_deferring_client]
-        $rd monitor
-        $rd read ; # Discard the OK
-
-        # Make sure multi-exec statements are ordered
-        # correctly
-        r multi
-        r set foo bar
-        r exec
-        assert_match {*"multi"*} [$rd read]
-        assert_match {*"set"*"foo"*"bar"*} [$rd read]
-        assert_match {*"exec"*} [$rd read]
-
-        # Make sure we close multi statements on errors
-        r multi
-        catch {r syntax error} _
-        catch {r exec} _
-
-        assert_match {*"multi"*} [$rd read]
-        assert_match {*"exec"*} [$rd read]
-
-        $rd close
-    }
-
-    test {CLIENT GETNAME should return NIL if name is not assigned} {
-        r client getname
-    } {}
-
-    test {CLIENT LIST shows empty fields for unassigned names} {
-        r client list
-    } {*name= *}
-
-    test {CLIENT SETNAME does not accept spaces} {
-        catch {r client setname "foo bar"} e
-        set e
-    } {ERR*}
-
-    test {CLIENT SETNAME can assign a name to this connection} {
-        assert_equal [r client setname myname] {OK}
-        r client list
-    } {*name=myname*}
-
-    test {CLIENT SETNAME can change the name of an existing connection} {
-        assert_equal [r client setname someothername] {OK}
-        r client list
-    } {*name=someothername*}
-
-    test {After CLIENT SETNAME, connection can still be closed} {
-        set rd [redis_deferring_client]
-        $rd client setname foobar
-        assert_equal [$rd read] "OK"
-        assert_match {*foobar*} [r client list]
-        $rd close
-        # Now the client should no longer be listed
-        wait_for_condition 50 100 {
-            [string match {*foobar*} [r client list]] == 0
-        } else {
-            fail "Client still listed in CLIENT LIST after SETNAME."
-        }
-    }
-
-    test {CONFIG save params special case handled properly} {
-        # No "save" keyword - defaults should apply
-        start_server {config "minimal.conf"} {
-            assert_match [r config get save] {save {3600 1 300 100 60 10000}}
-        }
-
-        # First "save" keyword overrides defaults
-        start_server {config "minimal.conf" overrides {save {100 100}}} {
-            # Defaults
-            assert_match [r config get save] {save {100 100}}
-        }
-    }
-
-    test {CONFIG sanity} {
-        # Do CONFIG GET, CONFIG SET and then CONFIG GET again
-        # Skip immutable configs, one with no get, and other complicated configs
-        set skip_configs {
-            rdbchecksum
-            daemonize
-            io-threads-do-reads
-            tcp-backlog
-            always-show-logo
-            syslog-enabled
-            cluster-enabled
-            aclfile
-            unixsocket
-            pidfile
-            syslog-ident
-            appendfilename
-            supervised
-            syslog-facility
-            databases
-            io-threads
-            logfile
-            unixsocketperm
-            slaveof
-            requirepass
-            server_cpulist
-            bio_cpulist
-            aof_rewrite_cpulist
-            bgsave_cpulist
-            set-proc-title
-        }
-
-        if {!$::tls} {
-            append skip_configs {
-                tls-prefer-server-ciphers
-                tls-session-cache-timeout
-                tls-session-cache-size
-                tls-session-caching
-                tls-cert-file
-                tls-key-file
-                tls-client-cert-file
-                tls-client-key-file
-                tls-dh-params-file
-                tls-ca-cert-file
-                tls-ca-cert-dir
-                tls-protocols
-                tls-ciphers
-                tls-ciphersuites
-                tls-port
-            }
-        }
-
-        set configs {}
-        foreach {k v} [r config get *] {
-            if {[lsearch $skip_configs $k] != -1} {
-                continue
-            }
-            dict set configs $k $v
-            # try to set the config to the same value it already has
-            r config set $k $v
-        }
-
-        set newconfigs {}
-        foreach {k v} [r config get *] {
-            if {[lsearch $skip_configs $k] != -1} {
-                continue
-            }
-            dict set newconfigs $k $v
-        }
-
-        dict for {k v} $configs {
-            set vv [dict get $newconfigs $k]
-            if {$v != $vv} {
-                fail "config $k mismatch, expecting $v but got $vv"
-            }
-
-        }
-    }
-
-    # Do a force-all config rewrite and make sure we're able to parse
-    # it.
-    test {CONFIG REWRITE sanity} {
-        # Capture state of config before
-        set configs {}
-        foreach {k v} [r config get *] {
-            dict set configs $k $v
-        }
-
-        # Rewrite entire configuration, restart and confirm the
-        # server is able to parse it and start.
-        assert_equal [r debug config-rewrite-force-all] "OK"
-        restart_server 0 true false
-        assert_equal [r ping] "PONG"
-
-        # Verify no changes were introduced
-        dict for {k v} $configs {
-            assert_equal $v [lindex [r config get $k] 1]
-        }
-    }
-
-    test {CONFIG REWRITE handles save properly} {
-        r config set save "3600 1 300 100 60 10000"
-        r config rewrite
-        restart_server 0 true false
-        assert_equal [r config get save] {save {3600 1 300 100 60 10000}}
-
-        r config set save ""
-        r config rewrite
-        restart_server 0 true false
-        assert_equal [r config get save] {save {}}
-
-        start_server {config "minimal.conf"} {
-            assert_equal [r config get save] {save {3600 1 300 100 60 10000}}
-            r config set save ""
-            r config rewrite
-            restart_server 0 true false
-            assert_equal [r config get save] {save {}}
-        }
-    }
-
-    # Config file at this point is at a wierd state, and includes all
-    # known keywords. Might be a good idea to avoid adding tests here.
-}
diff --git a/redis-stable/tests/unit/keyspace.tcl b/redis-stable/tests/unit/keyspace.tcl
deleted file mode 100644
index c6974181..00000000
--- a/redis-stable/tests/unit/keyspace.tcl
+++ /dev/null
@@ -1,482 +0,0 @@
-start_server {tags {"keyspace"}} {
-    test {DEL against a single item} {
-        r set x foo
-        assert {[r get x] eq "foo"}
-        r del x
-        r get x
-    } {}
-
-    test {Vararg DEL} {
-        r set foo1 a
-        r set foo2 b
-        r set foo3 c
-        list [r del foo1 foo2 foo3 foo4] [r mget foo1 foo2 foo3]
-    } {3 {{} {} {}}}
-
-    test {KEYS with pattern} {
-        foreach key {key_x key_y key_z foo_a foo_b foo_c} {
-            r set $key hello
-        }
-        lsort [r keys foo*]
-    } {foo_a foo_b foo_c}
-
-    test {KEYS to get all keys} {
-        lsort [r keys *]
-    } {foo_a foo_b foo_c key_x key_y key_z}
-
-    test {DBSIZE} {
-        r dbsize
-    } {6}
-
-    test {DEL all keys} {
-        foreach key [r keys *] {r del $key}
-        r dbsize
-    } {0}
-
-    test "DEL against expired key" {
-        r debug set-active-expire 0
-        r setex keyExpire 1 valExpire
-        after 1100
-        assert_equal 0 [r del keyExpire]
-        r debug set-active-expire 1
-    }
-
-    test {EXISTS} {
-        set res {}
-        r set newkey test
-        append res [r exists newkey]
-        r del newkey
-        append res [r exists newkey]
-    } {10}
-
-    test {Zero length value in key. SET/GET/EXISTS} {
-        r set emptykey {}
-        set res [r get emptykey]
-        append res [r exists emptykey]
-        r del emptykey
-        append res [r exists emptykey]
-    } {10}
-
-    test {Commands pipelining} {
-        set fd [r channel]
-        puts -nonewline $fd "SET k1 xyzk\r\nGET k1\r\nPING\r\n"
-        flush $fd
-        set res {}
-        append res [string match OK* [r read]]
-        append res [r read]
-        append res [string match PONG* [r read]]
-        format $res
-    } {1xyzk1}
-
-    test {Non existing command} {
-        catch {r foobaredcommand} err
-        string match ERR* $err
-    } {1}
-
-    test {RENAME basic usage} {
-        r set mykey hello
-        r rename mykey mykey1
-        r rename mykey1 mykey2
-        r get mykey2
-    } {hello}
-
-    test {RENAME source key should no longer exist} {
-        r exists mykey
-    } {0}
-
-    test {RENAME against already existing key} {
-        r set mykey a
-        r set mykey2 b
-        r rename mykey2 mykey
-        set res [r get mykey]
-        append res [r exists mykey2]
-    } {b0}
-
-    test {RENAMENX basic usage} {
-        r del mykey
-        r del mykey2
-        r set mykey foobar
-        r renamenx mykey mykey2
-        set res [r get mykey2]
-        append res [r exists mykey]
-    } {foobar0}
-
-    test {RENAMENX against already existing key} {
-        r set mykey foo
-        r set mykey2 bar
-        r renamenx mykey mykey2
-    } {0}
-
-    test {RENAMENX against already existing key (2)} {
-        set res [r get mykey]
-        append res [r get mykey2]
-    } {foobar}
-
-    test {RENAME against non existing source key} {
-        catch {r rename nokey foobar} err
-        format $err
-    } {ERR*}
-
-    test {RENAME where source and dest key are the same (existing)} {
-        r set mykey foo
-        r rename mykey mykey
-    } {OK}
-
-    test {RENAMENX where source and dest key are the same (existing)} {
-        r set mykey foo
-        r renamenx mykey mykey
-    } {0}
-
-    test {RENAME where source and dest key are the same (non existing)} {
-        r del mykey
-        catch {r rename mykey mykey} err
-        format $err
-    } {ERR*}
-
-    test {RENAME with volatile key, should move the TTL as well} {
-        r del mykey mykey2
-        r set mykey foo
-        r expire mykey 100
-        assert {[r ttl mykey] > 95 && [r ttl mykey] <= 100}
-        r rename mykey mykey2
-        assert {[r ttl mykey2] > 95 && [r ttl mykey2] <= 100}
-    }
-
-    test {RENAME with volatile key, should not inherit TTL of target key} {
-        r del mykey mykey2
-        r set mykey foo
-        r set mykey2 bar
-        r expire mykey2 100
-        assert {[r ttl mykey] == -1 && [r ttl mykey2] > 0}
-        r rename mykey mykey2
-        r ttl mykey2
-    } {-1}
-
-    test {DEL all keys again (DB 0)} {
-        foreach key [r keys *] {
-            r del $key
-        }
-        r dbsize
-    } {0}
-
-    test {DEL all keys again (DB 1)} {
-        r select 10
-        foreach key [r keys *] {
-            r del $key
-        }
-        set res [r dbsize]
-        r select 9
-        format $res
-    } {0}
-
-    test {COPY basic usage for string} {
-        r set mykey foobar
-        set res {}
-        r copy mykey mynewkey
-        lappend res [r get mynewkey]
-        lappend res [r dbsize]
-        r copy mykey mynewkey DB 10
-        r select 10
-        lappend res [r get mynewkey]
-        lappend res [r dbsize]
-        r select 9
-        format $res
-    } [list foobar 2 foobar 1]
-
-    test {COPY for string does not replace an existing key without REPLACE option} {
-        r set mykey2 hello
-        catch {r copy mykey2 mynewkey DB 10} e
-        set e
-    } {0}
-
-    test {COPY for string can replace an existing key with REPLACE option} {
-        r copy mykey2 mynewkey DB 10 REPLACE
-        r select 10
-        r get mynewkey
-    } {hello}
-
-    test {COPY for string ensures that copied data is independent of copying data} {
-        r flushdb
-        r select 9
-        r set mykey foobar
-        set res {}
-        r copy mykey mynewkey DB 10
-        r select 10
-        lappend res [r get mynewkey]
-        r set mynewkey hoge
-        lappend res [r get mynewkey]
-        r select 9
-        lappend res [r get mykey]
-        r select 10
-        r flushdb
-        r select 9
-        format $res
-    } [list foobar hoge foobar]
-
-    test {COPY for string does not copy data to no-integer DB} {
-        r set mykey foobar
-        catch {r copy mykey mynewkey DB notanumber} e
-        set e
-    } {ERR value is not an integer or out of range}
-
-    test {COPY can copy key expire metadata as well} {
-        r set mykey foobar ex 100
-        r copy mykey mynewkey REPLACE
-        assert {[r ttl mynewkey] > 0 && [r ttl mynewkey] <= 100}
-        assert {[r get mynewkey] eq "foobar"}
-    }
-
-    test {COPY does not create an expire if it does not exist} {
-        r set mykey foobar
-        assert {[r ttl mykey] == -1}
-        r copy mykey mynewkey REPLACE
-        assert {[r ttl mynewkey] == -1}
-        assert {[r get mynewkey] eq "foobar"}
-    }
-
-    test {COPY basic usage for list} {
-        r del mylist mynewlist
-        r lpush mylist a b c d
-        r copy mylist mynewlist
-        set digest [r debug digest-value mylist]
-        assert_equal $digest [r debug digest-value mynewlist]
-        assert_equal 1 [r object refcount mylist]
-        assert_equal 1 [r object refcount mynewlist]
-        r del mylist
-        assert_equal $digest [r debug digest-value mynewlist]
-    }
-
-    test {COPY basic usage for intset set} {
-        r del set1 newset1 
-        r sadd set1 1 2 3
-        assert_encoding intset set1
-        r copy set1 newset1
-        set digest [r debug digest-value set1]
-        assert_equal $digest [r debug digest-value newset1]
-        assert_equal 1 [r object refcount set1]
-        assert_equal 1 [r object refcount newset1]
-        r del set1
-        assert_equal $digest [r debug digest-value newset1]
-    }
-
-    test {COPY basic usage for hashtable set} {
-        r del set2 newset2
-        r sadd set2 1 2 3 a
-        assert_encoding hashtable set2
-        r copy set2 newset2
-        set digest [r debug digest-value set2]
-        assert_equal $digest [r debug digest-value newset2]
-        assert_equal 1 [r object refcount set2]
-        assert_equal 1 [r object refcount newset2]
-        r del set2
-        assert_equal $digest [r debug digest-value newset2]
-    }
-
-    test {COPY basic usage for ziplist sorted set} {
-        r del zset1 newzset1
-        r zadd zset1 123 foobar
-        assert_encoding ziplist zset1
-        r copy zset1 newzset1
-        set digest [r debug digest-value zset1]
-        assert_equal $digest [r debug digest-value newzset1]
-        assert_equal 1 [r object refcount zset1]
-        assert_equal 1 [r object refcount newzset1]
-        r del zset1
-        assert_equal $digest [r debug digest-value newzset1]
-    }
-
-     test {COPY basic usage for skiplist sorted set} {
-        r del zset2 newzset2
-        set original_max [lindex [r config get zset-max-ziplist-entries] 1]
-        r config set zset-max-ziplist-entries 0
-        for {set j 0} {$j < 130} {incr j} {
-            r zadd zset2 [randomInt 50] ele-[randomInt 10]
-        }
-        assert_encoding skiplist zset2
-        r copy zset2 newzset2
-        set digest [r debug digest-value zset2]
-        assert_equal $digest [r debug digest-value newzset2]
-        assert_equal 1 [r object refcount zset2]
-        assert_equal 1 [r object refcount newzset2]
-        r del zset2
-        assert_equal $digest [r debug digest-value newzset2]
-        r config set zset-max-ziplist-entries $original_max
-    }
-
-    test {COPY basic usage for ziplist hash} {
-        r del hash1 newhash1
-        r hset hash1 tmp 17179869184
-        assert_encoding ziplist hash1
-        r copy hash1 newhash1
-        set digest [r debug digest-value hash1]
-        assert_equal $digest [r debug digest-value newhash1]
-        assert_equal 1 [r object refcount hash1]
-        assert_equal 1 [r object refcount newhash1]
-        r del hash1
-        assert_equal $digest [r debug digest-value newhash1]
-    }
-
-    test {COPY basic usage for hashtable hash} {
-        r del hash2 newhash2
-        set original_max [lindex [r config get hash-max-ziplist-entries] 1]
-        r config set hash-max-ziplist-entries 0
-        for {set i 0} {$i < 64} {incr i} {
-            r hset hash2 [randomValue] [randomValue]
-        }
-        assert_encoding hashtable hash2
-        r copy hash2 newhash2
-        set digest [r debug digest-value hash2]
-        assert_equal $digest [r debug digest-value newhash2]
-        assert_equal 1 [r object refcount hash2]
-        assert_equal 1 [r object refcount newhash2]
-        r del hash2
-        assert_equal $digest [r debug digest-value newhash2]
-        r config set hash-max-ziplist-entries $original_max
-    }
-
-    test {COPY basic usage for stream} {
-        r del mystream mynewstream
-        for {set i 0} {$i < 1000} {incr i} {
-            r XADD mystream * item 2 value b
-        }
-        r copy mystream mynewstream
-        set digest [r debug digest-value mystream]
-        assert_equal $digest [r debug digest-value mynewstream]
-        assert_equal 1 [r object refcount mystream]
-        assert_equal 1 [r object refcount mynewstream]
-        r del mystream
-        assert_equal $digest [r debug digest-value mynewstream]
-    }
-
-    test {COPY basic usage for stream-cgroups} {
-        r del x
-        r XADD x 100 a 1
-        set id [r XADD x 101 b 1]
-        r XADD x 102 c 1
-        r XADD x 103 e 1
-        r XADD x 104 f 1
-        r XADD x 105 g 1
-        r XGROUP CREATE x g1 0
-        r XGROUP CREATE x g2 0
-        r XREADGROUP GROUP g1 Alice COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g1 Bob COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g1 Bob NOACK COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g2 Charlie COUNT 4 STREAMS x >
-        r XGROUP SETID x g1 $id
-        r XREADGROUP GROUP g1 Dave COUNT 3 STREAMS x >
-        r XDEL x 103
-
-        r copy x newx
-        set info [r xinfo stream x full]
-        assert_equal $info [r xinfo stream newx full]
-        assert_equal 1 [r object refcount x]
-        assert_equal 1 [r object refcount newx]
-        r del x
-        assert_equal $info [r xinfo stream newx full]
-        r flushdb
-    }
-
-    test {MOVE basic usage} {
-        r set mykey foobar
-        r move mykey 10
-        set res {}
-        lappend res [r exists mykey]
-        lappend res [r dbsize]
-        r select 10
-        lappend res [r get mykey]
-        lappend res [r dbsize]
-        r select 9
-        format $res
-    } [list 0 0 foobar 1]
-
-    test {MOVE against key existing in the target DB} {
-        r set mykey hello
-        r move mykey 10
-    } {0}
-
-    test {MOVE against non-integer DB (#1428)} {
-        r set mykey hello
-        catch {r move mykey notanumber} e
-        set e
-    } {ERR value is not an integer or out of range}
-
-    test {MOVE can move key expire metadata as well} {
-        r select 10
-        r flushdb
-        r select 9
-        r set mykey foo ex 100
-        r move mykey 10
-        assert {[r ttl mykey] == -2}
-        r select 10
-        assert {[r ttl mykey] > 0 && [r ttl mykey] <= 100}
-        assert {[r get mykey] eq "foo"}
-        r select 9
-    }
-
-    test {MOVE does not create an expire if it does not exist} {
-        r select 10
-        r flushdb
-        r select 9
-        r set mykey foo
-        r move mykey 10
-        assert {[r ttl mykey] == -2}
-        r select 10
-        assert {[r ttl mykey] == -1}
-        assert {[r get mykey] eq "foo"}
-        r select 9
-    }
-
-    test {SET/GET keys in different DBs} {
-        r set a hello
-        r set b world
-        r select 10
-        r set a foo
-        r set b bared
-        r select 9
-        set res {}
-        lappend res [r get a]
-        lappend res [r get b]
-        r select 10
-        lappend res [r get a]
-        lappend res [r get b]
-        r select 9
-        format $res
-    } {hello world foo bared}
-
-    test {RANDOMKEY} {
-        r flushdb
-        r set foo x
-        r set bar y
-        set foo_seen 0
-        set bar_seen 0
-        for {set i 0} {$i < 100} {incr i} {
-            set rkey [r randomkey]
-            if {$rkey eq {foo}} {
-                set foo_seen 1
-            }
-            if {$rkey eq {bar}} {
-                set bar_seen 1
-            }
-        }
-        list $foo_seen $bar_seen
-    } {1 1}
-
-    test {RANDOMKEY against empty DB} {
-        r flushdb
-        r randomkey
-    } {}
-
-    test {RANDOMKEY regression 1} {
-        r flushdb
-        r set x 10
-        r del x
-        r randomkey
-    } {}
-
-    test {KEYS * two times with long key, Github issue #1208} {
-        r flushdb
-        r set dlskeriewrioeuwqoirueioqwrueoqwrueqw test
-        r keys *
-        r keys *
-    } {dlskeriewrioeuwqoirueioqwrueoqwrueqw}
-}
diff --git a/redis-stable/tests/unit/latency-monitor.tcl b/redis-stable/tests/unit/latency-monitor.tcl
deleted file mode 100644
index 9ef0c615..00000000
--- a/redis-stable/tests/unit/latency-monitor.tcl
+++ /dev/null
@@ -1,79 +0,0 @@
-start_server {tags {"latency-monitor"}} {
-    # Set a threshold high enough to avoid spurious latency events.
-    r config set latency-monitor-threshold 200
-    r latency reset
-
-    test {Test latency events logging} {
-        r debug sleep 0.3
-        after 1100
-        r debug sleep 0.4
-        after 1100
-        r debug sleep 0.5
-        assert {[r latency history command] >= 3}
-    }
-
-    test {LATENCY HISTORY output is ok} {
-        set min 250
-        set max 450
-        foreach event [r latency history command] {
-            lassign $event time latency
-            if {!$::no_latency} {
-                assert {$latency >= $min && $latency <= $max}
-            }
-            incr min 100
-            incr max 100
-            set last_time $time ; # Used in the next test
-        }
-    }
-
-    test {LATENCY LATEST output is ok} {
-        foreach event [r latency latest] {
-            lassign $event eventname time latency max
-            assert {$eventname eq "command"}
-            if {!$::no_latency} {
-                assert {$max >= 450 & $max <= 650}
-                assert {$time == $last_time}
-            }
-            break
-        }
-    }
-
-    test {LATENCY HISTORY / RESET with wrong event name is fine} {
-        assert {[llength [r latency history blabla]] == 0}
-        assert {[r latency reset blabla] == 0}
-    }
-
-    test {LATENCY DOCTOR produces some output} {
-        assert {[string length [r latency doctor]] > 0}
-    }
-
-    test {LATENCY RESET is able to reset events} {
-        assert {[r latency reset] > 0}
-        assert {[r latency latest] eq {}}
-    }
-
-    test {LATENCY of expire events are correctly collected} {
-        r config set latency-monitor-threshold 20
-        r flushdb
-        if {$::valgrind} {set count 100000} else {set count 1000000}
-        r eval {
-            local i = 0
-            while (i < tonumber(ARGV[1])) do
-                redis.call('sadd',KEYS[1],i)
-                i = i+1
-             end
-        } 1 mybigkey $count
-        r pexpire mybigkey 50
-        wait_for_condition 5 100 {
-            [r dbsize] == 0
-        } else {
-            fail "key wasn't expired"
-        }
-        assert_match {*expire-cycle*} [r latency latest]
-    }
-
-    test {LATENCY HELP should not have unexpected options} {
-        catch {r LATENCY help xxx} e
-        assert_match "*Unknown subcommand or wrong number of arguments*" $e
-    }
-}
diff --git a/redis-stable/tests/unit/lazyfree.tcl b/redis-stable/tests/unit/lazyfree.tcl
deleted file mode 100644
index 4e994494..00000000
--- a/redis-stable/tests/unit/lazyfree.tcl
+++ /dev/null
@@ -1,39 +0,0 @@
-start_server {tags {"lazyfree"}} {
-    test "UNLINK can reclaim memory in background" {
-        set orig_mem [s used_memory]
-        set args {}
-        for {set i 0} {$i < 100000} {incr i} {
-            lappend args $i
-        }
-        r sadd myset {*}$args
-        assert {[r scard myset] == 100000}
-        set peak_mem [s used_memory]
-        assert {[r unlink myset] == 1}
-        assert {$peak_mem > $orig_mem+1000000}
-        wait_for_condition 50 100 {
-            [s used_memory] < $peak_mem &&
-            [s used_memory] < $orig_mem*2
-        } else {
-            fail "Memory is not reclaimed by UNLINK"
-        }
-    }
-
-    test "FLUSHDB ASYNC can reclaim memory in background" {
-        set orig_mem [s used_memory]
-        set args {}
-        for {set i 0} {$i < 100000} {incr i} {
-            lappend args $i
-        }
-        r sadd myset {*}$args
-        assert {[r scard myset] == 100000}
-        set peak_mem [s used_memory]
-        r flushdb async
-        assert {$peak_mem > $orig_mem+1000000}
-        wait_for_condition 50 100 {
-            [s used_memory] < $peak_mem &&
-            [s used_memory] < $orig_mem*2
-        } else {
-            fail "Memory is not reclaimed by FLUSHDB ASYNC"
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/limits.tcl b/redis-stable/tests/unit/limits.tcl
deleted file mode 100644
index 51122e8f..00000000
--- a/redis-stable/tests/unit/limits.tcl
+++ /dev/null
@@ -1,21 +0,0 @@
-start_server {tags {"limits network"} overrides {maxclients 10}} {
-    if {$::tls} {
-        set expected_code "*I/O error*"
-    } else {
-        set expected_code "*ERR max*reached*"
-    }
-    test {Check if maxclients works refusing connections} {
-        set c 0
-        catch {
-            while {$c < 50} {
-                incr c
-                set rd [redis_deferring_client]
-                $rd ping
-                $rd read
-                after 100
-            }
-        } e
-        assert {$c > 8 && $c <= 10}
-        set e
-    } $expected_code
-}
diff --git a/redis-stable/tests/unit/maxmemory.tcl b/redis-stable/tests/unit/maxmemory.tcl
deleted file mode 100644
index 99321acf..00000000
--- a/redis-stable/tests/unit/maxmemory.tcl
+++ /dev/null
@@ -1,326 +0,0 @@
-start_server {tags {"maxmemory"}} {
-    test "Without maxmemory small integers are shared" {
-        r config set maxmemory 0
-        r set a 1
-        assert {[r object refcount a] > 1}
-    }
-
-    test "With maxmemory and non-LRU policy integers are still shared" {
-        r config set maxmemory 1073741824
-        r config set maxmemory-policy allkeys-random
-        r set a 1
-        assert {[r object refcount a] > 1}
-    }
-
-    test "With maxmemory and LRU policy integers are not shared" {
-        r config set maxmemory 1073741824
-        r config set maxmemory-policy allkeys-lru
-        r set a 1
-        r config set maxmemory-policy volatile-lru
-        r set b 1
-        assert {[r object refcount a] == 1}
-        assert {[r object refcount b] == 1}
-        r config set maxmemory 0
-    }
-
-    foreach policy {
-        allkeys-random allkeys-lru allkeys-lfu volatile-lru volatile-lfu volatile-random volatile-ttl
-    } {
-        test "maxmemory - is the memory limit honoured? (policy $policy)" {
-            # make sure to start with a blank instance
-            r flushall
-            # Get the current memory limit and calculate a new limit.
-            # We just add 100k to the current memory size so that it is
-            # fast for us to reach that limit.
-            set used [s used_memory]
-            set limit [expr {$used+100*1024}]
-            r config set maxmemory $limit
-            r config set maxmemory-policy $policy
-            # Now add keys until the limit is almost reached.
-            set numkeys 0
-            while 1 {
-                r setex [randomKey] 10000 x
-                incr numkeys
-                if {[s used_memory]+4096 > $limit} {
-                    assert {$numkeys > 10}
-                    break
-                }
-            }
-            # If we add the same number of keys already added again, we
-            # should still be under the limit.
-            for {set j 0} {$j < $numkeys} {incr j} {
-                r setex [randomKey] 10000 x
-            }
-            assert {[s used_memory] < ($limit+4096)}
-        }
-    }
-
-    foreach policy {
-        allkeys-random allkeys-lru volatile-lru volatile-random volatile-ttl
-    } {
-        test "maxmemory - only allkeys-* should remove non-volatile keys ($policy)" {
-            # make sure to start with a blank instance
-            r flushall
-            # Get the current memory limit and calculate a new limit.
-            # We just add 100k to the current memory size so that it is
-            # fast for us to reach that limit.
-            set used [s used_memory]
-            set limit [expr {$used+100*1024}]
-            r config set maxmemory $limit
-            r config set maxmemory-policy $policy
-            # Now add keys until the limit is almost reached.
-            set numkeys 0
-            while 1 {
-                r set [randomKey] x
-                incr numkeys
-                if {[s used_memory]+4096 > $limit} {
-                    assert {$numkeys > 10}
-                    break
-                }
-            }
-            # If we add the same number of keys already added again and
-            # the policy is allkeys-* we should still be under the limit.
-            # Otherwise we should see an error reported by Redis.
-            set err 0
-            for {set j 0} {$j < $numkeys} {incr j} {
-                if {[catch {r set [randomKey] x} e]} {
-                    if {[string match {*used memory*} $e]} {
-                        set err 1
-                    }
-                }
-            }
-            if {[string match allkeys-* $policy]} {
-                assert {[s used_memory] < ($limit+4096)}
-            } else {
-                assert {$err == 1}
-            }
-        }
-    }
-
-    foreach policy {
-        volatile-lru volatile-lfu volatile-random volatile-ttl
-    } {
-        test "maxmemory - policy $policy should only remove volatile keys." {
-            # make sure to start with a blank instance
-            r flushall
-            # Get the current memory limit and calculate a new limit.
-            # We just add 100k to the current memory size so that it is
-            # fast for us to reach that limit.
-            set used [s used_memory]
-            set limit [expr {$used+100*1024}]
-            r config set maxmemory $limit
-            r config set maxmemory-policy $policy
-            # Now add keys until the limit is almost reached.
-            set numkeys 0
-            while 1 {
-                # Odd keys are volatile
-                # Even keys are non volatile
-                if {$numkeys % 2} {
-                    r setex "key:$numkeys" 10000 x
-                } else {
-                    r set "key:$numkeys" x
-                }
-                if {[s used_memory]+4096 > $limit} {
-                    assert {$numkeys > 10}
-                    break
-                }
-                incr numkeys
-            }
-            # Now we add the same number of volatile keys already added.
-            # We expect Redis to evict only volatile keys in order to make
-            # space.
-            set err 0
-            for {set j 0} {$j < $numkeys} {incr j} {
-                catch {r setex "foo:$j" 10000 x}
-            }
-            # We should still be under the limit.
-            assert {[s used_memory] < ($limit+4096)}
-            # However all our non volatile keys should be here.
-            for {set j 0} {$j < $numkeys} {incr j 2} {
-                assert {[r exists "key:$j"]}
-            }
-        }
-    }
-}
-
-proc test_slave_buffers {test_name cmd_count payload_len limit_memory pipeline} {
-    start_server {tags {"maxmemory"}} {
-        start_server {} {
-        set slave_pid [s process_id]
-        test "$test_name" {
-            set slave [srv 0 client]
-            set slave_host [srv 0 host]
-            set slave_port [srv 0 port]
-            set master [srv -1 client]
-            set master_host [srv -1 host]
-            set master_port [srv -1 port]
-
-            # add 100 keys of 100k (10MB total)
-            for {set j 0} {$j < 100} {incr j} {
-                $master setrange "key:$j" 100000 asdf
-            }
-
-            # make sure master doesn't disconnect slave because of timeout
-            $master config set repl-timeout 1200 ;# 20 minutes (for valgrind and slow machines)
-            $master config set maxmemory-policy allkeys-random
-            $master config set client-output-buffer-limit "replica 100000000 100000000 300"
-            $master config set repl-backlog-size [expr {10*1024}]
-
-            $slave slaveof $master_host $master_port
-            wait_for_condition 50 100 {
-                [s 0 master_link_status] eq {up}
-            } else {
-                fail "Replication not started."
-            }
-
-            # measure used memory after the slave connected and set maxmemory
-            set orig_used [s -1 used_memory]
-            set orig_client_buf [s -1 mem_clients_normal]
-            set orig_mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
-            set orig_used_no_repl [expr {$orig_used - $orig_mem_not_counted_for_evict}]
-            set limit [expr {$orig_used - $orig_mem_not_counted_for_evict + 32*1024}]
-
-            if {$limit_memory==1} {
-                $master config set maxmemory $limit
-            }
-
-            # put the slave to sleep
-            set rd_slave [redis_deferring_client]
-            exec kill -SIGSTOP $slave_pid
-
-            # send some 10mb worth of commands that don't increase the memory usage
-            if {$pipeline == 1} {
-                set rd_master [redis_deferring_client -1]
-                for {set k 0} {$k < $cmd_count} {incr k} {
-                    $rd_master setrange key:0 0 [string repeat A $payload_len]
-                }
-                for {set k 0} {$k < $cmd_count} {incr k} {
-                    #$rd_master read
-                }
-            } else {
-                for {set k 0} {$k < $cmd_count} {incr k} {
-                    $master setrange key:0 0 [string repeat A $payload_len]
-                }
-            }
-
-            set new_used [s -1 used_memory]
-            set slave_buf [s -1 mem_clients_slaves]
-            set client_buf [s -1 mem_clients_normal]
-            set mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
-            set used_no_repl [expr {$new_used - $mem_not_counted_for_evict}]
-            set delta [expr {($used_no_repl - $client_buf) - ($orig_used_no_repl - $orig_client_buf)}]
-
-            assert {[$master dbsize] == 100}
-            assert {$slave_buf > 2*1024*1024} ;# some of the data may have been pushed to the OS buffers
-            set delta_max [expr {$cmd_count / 2}] ;# 1 byte unaccounted for, with 1M commands will consume some 1MB
-            assert {$delta < $delta_max && $delta > -$delta_max}
-
-            $master client kill type slave
-            set killed_used [s -1 used_memory]
-            set killed_slave_buf [s -1 mem_clients_slaves]
-            set killed_mem_not_counted_for_evict [s -1 mem_not_counted_for_evict]
-            set killed_used_no_repl [expr {$killed_used - $killed_mem_not_counted_for_evict}]
-            set delta_no_repl [expr {$killed_used_no_repl - $used_no_repl}]
-            assert {$killed_slave_buf == 0}
-            assert {$delta_no_repl > -$delta_max && $delta_no_repl < $delta_max}
-
-        }
-        # unfreeze slave process (after the 'test' succeeded or failed, but before we attempt to terminate the server
-        exec kill -SIGCONT $slave_pid
-        }
-    }
-}
-
-# test that slave buffer are counted correctly
-# we wanna use many small commands, and we don't wanna wait long
-# so we need to use a pipeline (redis_deferring_client)
-# that may cause query buffer to fill and induce eviction, so we disable it
-test_slave_buffers {slave buffer are counted correctly} 1000000 10 0 1
-
-# test that slave buffer don't induce eviction
-# test again with fewer (and bigger) commands without pipeline, but with eviction
-test_slave_buffers "replica buffer don't induce eviction" 100000 100 1 0
-
-start_server {tags {"maxmemory"}} {
-    test {Don't rehash if used memory exceeds maxmemory after rehash} {
-        r config set maxmemory 0
-        r config set maxmemory-policy allkeys-random
-
-        # Next rehash size is 8192, that will eat 64k memory
-        populate 4096 "" 1
-
-        set used [s used_memory]
-        set limit [expr {$used + 10*1024}]
-        r config set maxmemory $limit
-        r set k1 v1
-        # Next writing command will trigger evicting some keys if last
-        # command trigger DB dict rehash
-        r set k2 v2
-        # There must be 4098 keys because redis doesn't evict keys.
-        r dbsize
-    } {4098}
-}
-
-start_server {tags {"maxmemory"}} {
-    test {client tracking don't cause eviction feedback loop} {
-        r config set maxmemory 0
-        r config set maxmemory-policy allkeys-lru
-        r config set maxmemory-eviction-tenacity 100
-
-        # 10 clients listening on tracking messages
-        set clients {}
-        for {set j 0} {$j < 10} {incr j} {
-            lappend clients [redis_deferring_client]
-        }
-        foreach rd $clients {
-            $rd HELLO 3
-            $rd read ; # Consume the HELLO reply
-            $rd CLIENT TRACKING on
-            $rd read ; # Consume the CLIENT reply
-        }
-
-        # populate 300 keys, with long key name and short value
-        for {set j 0} {$j < 300} {incr j} {
-            set key $j[string repeat x 1000]
-            r set $key x
-
-            # for each key, enable caching for this key
-            foreach rd $clients {
-                $rd get $key
-                $rd read
-            }
-        }
-
-        # we need to wait one second for the client querybuf excess memory to be
-        # trimmed by cron, otherwise the INFO used_memory and CONFIG maxmemory
-        # below (on slow machines) won't be "atomic" and won't trigger eviction.
-        after 1100
-
-        # set the memory limit which will cause a few keys to be evicted
-        # we need to make sure to evict keynames of a total size of more than
-        # 16kb since the (PROTO_REPLY_CHUNK_BYTES), only after that the
-        # invalidation messages have a chance to trigger further eviction.
-        set used [s used_memory]
-        set limit [expr {$used - 40000}]
-        r config set maxmemory $limit
-
-        # make sure some eviction happened
-        set evicted [s evicted_keys]
-        if {$::verbose} { puts "evicted: $evicted" }
-
-        # make sure we didn't drain the database
-        assert_range [r dbsize] 200 300
-
-        assert_range $evicted 10 50
-        foreach rd $clients {
-            $rd read ;# make sure we have some invalidation message waiting
-            $rd close
-        }
-
-        # eviction continues (known problem described in #8069)
-        # for now this test only make sures the eviction loop itself doesn't
-        # have feedback loop
-        set evicted [s evicted_keys]
-        if {$::verbose} { puts "evicted: $evicted" }
-    }
-}
diff --git a/redis-stable/tests/unit/memefficiency.tcl b/redis-stable/tests/unit/memefficiency.tcl
deleted file mode 100644
index 88fcd6f5..00000000
--- a/redis-stable/tests/unit/memefficiency.tcl
+++ /dev/null
@@ -1,496 +0,0 @@
-proc test_memory_efficiency {range} {
-    r flushall
-    set rd [redis_deferring_client]
-    set base_mem [s used_memory]
-    set written 0
-    for {set j 0} {$j < 10000} {incr j} {
-        set key key:$j
-        set val [string repeat A [expr {int(rand()*$range)}]]
-        $rd set $key $val
-        incr written [string length $key]
-        incr written [string length $val]
-        incr written 2 ;# A separator is the minimum to store key-value data.
-    }
-    for {set j 0} {$j < 10000} {incr j} {
-        $rd read ; # Discard replies
-    }
-
-    set current_mem [s used_memory]
-    set used [expr {$current_mem-$base_mem}]
-    set efficiency [expr {double($written)/$used}]
-    return $efficiency
-}
-
-start_server {tags {"memefficiency"}} {
-    foreach {size_range expected_min_efficiency} {
-        32    0.15
-        64    0.25
-        128   0.35
-        1024  0.75
-        16384 0.82
-    } {
-        test "Memory efficiency with values in range $size_range" {
-            set efficiency [test_memory_efficiency $size_range]
-            assert {$efficiency >= $expected_min_efficiency}
-        }
-    }
-}
-
-run_solo {defrag} {
-start_server {tags {"defrag"} overrides {appendonly yes auto-aof-rewrite-percentage 0 save ""}} {
-    if {[string match {*jemalloc*} [s mem_allocator]] && [r debug mallctl arenas.page] <= 8192} {
-        test "Active defrag" {
-            r config set hz 100
-            r config set activedefrag no
-            r config set active-defrag-threshold-lower 5
-            r config set active-defrag-cycle-min 65
-            r config set active-defrag-cycle-max 75
-            r config set active-defrag-ignore-bytes 2mb
-            r config set maxmemory 100mb
-            r config set maxmemory-policy allkeys-lru
-
-            populate 700000 asdf1 150
-            populate 170000 asdf2 300
-            after 120 ;# serverCron only updates the info once in 100ms
-            set frag [s allocator_frag_ratio]
-            if {$::verbose} {
-                puts "frag $frag"
-            }
-            assert {$frag >= 1.4}
-
-            r config set latency-monitor-threshold 5
-            r latency reset
-            r config set maxmemory 110mb ;# prevent further eviction (not to fail the digest test)
-            set digest [r debug digest]
-            catch {r config set activedefrag yes} e
-            if {[r config get activedefrag] eq "activedefrag yes"} {
-                # Wait for the active defrag to start working (decision once a
-                # second).
-                wait_for_condition 50 100 {
-                    [s active_defrag_running] ne 0
-                } else {
-                    fail "defrag not started."
-                }
-
-                # Wait for the active defrag to stop working.
-                wait_for_condition 150 100 {
-                    [s active_defrag_running] eq 0
-                } else {
-                    after 120 ;# serverCron only updates the info once in 100ms
-                    puts [r info memory]
-                    puts [r memory malloc-stats]
-                    fail "defrag didn't stop."
-                }
-
-                # Test the the fragmentation is lower.
-                after 120 ;# serverCron only updates the info once in 100ms
-                set frag [s allocator_frag_ratio]
-                set max_latency 0
-                foreach event [r latency latest] {
-                    lassign $event eventname time latency max
-                    if {$eventname == "active-defrag-cycle"} {
-                        set max_latency $max
-                    }
-                }
-                if {$::verbose} {
-                    puts "frag $frag"
-                    set misses [s active_defrag_misses]
-                    set hits [s active_defrag_hits]
-                    puts "hits: $hits"
-                    puts "misses: $misses"
-                    puts "max latency $max_latency"
-                    puts [r latency latest]
-                    puts [r latency history active-defrag-cycle]
-                }
-                assert {$frag < 1.1}
-                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
-                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
-                if {!$::no_latency} {
-                    assert {$max_latency <= 30}
-                }
-            }
-            # verify the data isn't corrupted or changed
-            set newdigest [r debug digest]
-            assert {$digest eq $newdigest}
-            r save ;# saving an rdb iterates over all the data / pointers
-
-            # if defrag is supported, test AOF loading too
-            if {[r config get activedefrag] eq "activedefrag yes"} {
-                # reset stats and load the AOF file
-                r config resetstat
-                r config set key-load-delay -50 ;# sleep on average 1/50 usec
-                r debug loadaof
-                r config set activedefrag no
-                # measure hits and misses right after aof loading
-                set misses [s active_defrag_misses]
-                set hits [s active_defrag_hits]
-
-                after 120 ;# serverCron only updates the info once in 100ms
-                set frag [s allocator_frag_ratio]
-                set max_latency 0
-                foreach event [r latency latest] {
-                    lassign $event eventname time latency max
-                    if {$eventname == "loading-cron"} {
-                        set max_latency $max
-                    }
-                }
-                if {$::verbose} {
-                    puts "AOF loading:"
-                    puts "frag $frag"
-                    puts "hits: $hits"
-                    puts "misses: $misses"
-                    puts "max latency $max_latency"
-                    puts [r latency latest]
-                    puts [r latency history loading-cron]
-                }
-                # make sure we had defrag hits during AOF loading
-                assert {$hits > 100000}
-                # make sure the defragger did enough work to keep the fragmentation low during loading.
-                # we cannot check that it went all the way down, since we don't wait for full defrag cycle to complete.
-                assert {$frag < 1.4}
-                # since the AOF contains simple (fast) SET commands (and the cron during loading runs every 1000 commands),
-                # it'll still not block the loading for long periods of time.
-                if {!$::no_latency} {
-                    assert {$max_latency <= 30}
-                }
-            }
-        }
-        r config set appendonly no
-        r config set key-load-delay 0
-
-        test "Active defrag big keys" {
-            r flushdb
-            r config resetstat
-            r config set hz 100
-            r config set activedefrag no
-            r config set active-defrag-max-scan-fields 1000
-            r config set active-defrag-threshold-lower 5
-            r config set active-defrag-cycle-min 65
-            r config set active-defrag-cycle-max 75
-            r config set active-defrag-ignore-bytes 2mb
-            r config set maxmemory 0
-            r config set list-max-ziplist-size 5 ;# list of 10k items will have 2000 quicklist nodes
-            r config set stream-node-max-entries 5
-            r hmset hash h1 v1 h2 v2 h3 v3
-            r lpush list a b c d
-            r zadd zset 0 a 1 b 2 c 3 d
-            r sadd set a b c d
-            r xadd stream * item 1 value a
-            r xadd stream * item 2 value b
-            r xgroup create stream mygroup 0
-            r xreadgroup GROUP mygroup Alice COUNT 1 STREAMS stream >
-
-            # create big keys with 10k items
-            set rd [redis_deferring_client]
-            for {set j 0} {$j < 10000} {incr j} {
-                $rd hset bighash $j [concat "asdfasdfasdf" $j]
-                $rd lpush biglist [concat "asdfasdfasdf" $j]
-                $rd zadd bigzset $j [concat "asdfasdfasdf" $j]
-                $rd sadd bigset [concat "asdfasdfasdf" $j]
-                $rd xadd bigstream * item 1 value a
-            }
-            for {set j 0} {$j < 50000} {incr j} {
-                $rd read ; # Discard replies
-            }
-
-            set expected_frag 1.7
-            if {$::accurate} {
-                # scale the hash to 1m fields in order to have a measurable the latency
-                for {set j 10000} {$j < 1000000} {incr j} {
-                    $rd hset bighash $j [concat "asdfasdfasdf" $j]
-                }
-                for {set j 10000} {$j < 1000000} {incr j} {
-                    $rd read ; # Discard replies
-                }
-                # creating that big hash, increased used_memory, so the relative frag goes down
-                set expected_frag 1.3
-            }
-
-            # add a mass of string keys
-            for {set j 0} {$j < 500000} {incr j} {
-                $rd setrange $j 150 a
-            }
-            for {set j 0} {$j < 500000} {incr j} {
-                $rd read ; # Discard replies
-            }
-            assert_equal [r dbsize] 500010
-
-            # create some fragmentation
-            for {set j 0} {$j < 500000} {incr j 2} {
-                $rd del $j
-            }
-            for {set j 0} {$j < 500000} {incr j 2} {
-                $rd read ; # Discard replies
-            }
-            assert_equal [r dbsize] 250010
-
-            # start defrag
-            after 120 ;# serverCron only updates the info once in 100ms
-            set frag [s allocator_frag_ratio]
-            if {$::verbose} {
-                puts "frag $frag"
-            }
-            assert {$frag >= $expected_frag}
-            r config set latency-monitor-threshold 5
-            r latency reset
-
-            set digest [r debug digest]
-            catch {r config set activedefrag yes} e
-            if {[r config get activedefrag] eq "activedefrag yes"} {
-                # wait for the active defrag to start working (decision once a second)
-                wait_for_condition 50 100 {
-                    [s active_defrag_running] ne 0
-                } else {
-                    fail "defrag not started."
-                }
-
-                # wait for the active defrag to stop working
-                wait_for_condition 500 100 {
-                    [s active_defrag_running] eq 0
-                } else {
-                    after 120 ;# serverCron only updates the info once in 100ms
-                    puts [r info memory]
-                    puts [r memory malloc-stats]
-                    fail "defrag didn't stop."
-                }
-
-                # test the the fragmentation is lower
-                after 120 ;# serverCron only updates the info once in 100ms
-                set frag [s allocator_frag_ratio]
-                set max_latency 0
-                foreach event [r latency latest] {
-                    lassign $event eventname time latency max
-                    if {$eventname == "active-defrag-cycle"} {
-                        set max_latency $max
-                    }
-                }
-                if {$::verbose} {
-                    puts "frag $frag"
-                    set misses [s active_defrag_misses]
-                    set hits [s active_defrag_hits]
-                    puts "hits: $hits"
-                    puts "misses: $misses"
-                    puts "max latency $max_latency"
-                    puts [r latency latest]
-                    puts [r latency history active-defrag-cycle]
-                }
-                assert {$frag < 1.1}
-                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
-                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
-                if {!$::no_latency} {
-                    assert {$max_latency <= 30}
-                }
-            }
-            # verify the data isn't corrupted or changed
-            set newdigest [r debug digest]
-            assert {$digest eq $newdigest}
-            r save ;# saving an rdb iterates over all the data / pointers
-        } {OK}
-
-        test "Active defrag big list" {
-            r flushdb
-            r config resetstat
-            r config set hz 100
-            r config set activedefrag no
-            r config set active-defrag-max-scan-fields 1000
-            r config set active-defrag-threshold-lower 5
-            r config set active-defrag-cycle-min 65
-            r config set active-defrag-cycle-max 75
-            r config set active-defrag-ignore-bytes 2mb
-            r config set maxmemory 0
-            r config set list-max-ziplist-size 5 ;# list of 500k items will have 100k quicklist nodes
-
-            # create big keys with 10k items
-            set rd [redis_deferring_client]
-
-            set expected_frag 1.7
-            # add a mass of list nodes to two lists (allocations are interlaced)
-            set val [string repeat A 100] ;# 5 items of 100 bytes puts us in the 640 bytes bin, which has 32 regs, so high potential for fragmentation
-            set elements 500000
-            for {set j 0} {$j < $elements} {incr j} {
-                $rd lpush biglist1 $val
-                $rd lpush biglist2 $val
-            }
-            for {set j 0} {$j < $elements} {incr j} {
-                $rd read ; # Discard replies
-                $rd read ; # Discard replies
-            }
-
-            # create some fragmentation
-            r del biglist2
-
-            # start defrag
-            after 120 ;# serverCron only updates the info once in 100ms
-            set frag [s allocator_frag_ratio]
-            if {$::verbose} {
-                puts "frag $frag"
-            }
-
-            assert {$frag >= $expected_frag}
-            r config set latency-monitor-threshold 5
-            r latency reset
-
-            set digest [r debug digest]
-            catch {r config set activedefrag yes} e
-            if {[r config get activedefrag] eq "activedefrag yes"} {
-                # wait for the active defrag to start working (decision once a second)
-                wait_for_condition 50 100 {
-                    [s active_defrag_running] ne 0
-                } else {
-                    fail "defrag not started."
-                }
-
-                # wait for the active defrag to stop working
-                wait_for_condition 500 100 {
-                    [s active_defrag_running] eq 0
-                } else {
-                    after 120 ;# serverCron only updates the info once in 100ms
-                    puts [r info memory]
-                    puts [r info stats]
-                    puts [r memory malloc-stats]
-                    fail "defrag didn't stop."
-                }
-
-                # test the the fragmentation is lower
-                after 120 ;# serverCron only updates the info once in 100ms
-                set misses [s active_defrag_misses]
-                set hits [s active_defrag_hits]
-                set frag [s allocator_frag_ratio]
-                set max_latency 0
-                foreach event [r latency latest] {
-                    lassign $event eventname time latency max
-                    if {$eventname == "active-defrag-cycle"} {
-                        set max_latency $max
-                    }
-                }
-                if {$::verbose} {
-                    puts "frag $frag"
-                    puts "misses: $misses"
-                    puts "hits: $hits"
-                    puts "max latency $max_latency"
-                    puts [r latency latest]
-                    puts [r latency history active-defrag-cycle]
-                }
-                assert {$frag < 1.1}
-                # due to high fragmentation, 100hz, and active-defrag-cycle-max set to 75,
-                # we expect max latency to be not much higher than 7.5ms but due to rare slowness threshold is set higher
-                if {!$::no_latency} {
-                    assert {$max_latency <= 30}
-                }
-
-                # in extreme cases of stagnation, we see over 20m misses before the tests aborts with "defrag didn't stop",
-                # in normal cases we only see 100k misses out of 500k elements
-                assert {$misses < $elements}
-            }
-            # verify the data isn't corrupted or changed
-            set newdigest [r debug digest]
-            assert {$digest eq $newdigest}
-            r save ;# saving an rdb iterates over all the data / pointers
-            r del biglist1 ;# coverage for quicklistBookmarksClear
-        } {1}
-
-        test "Active defrag edge case" {
-            # there was an edge case in defrag where all the slabs of a certain bin are exact the same
-            # % utilization, with the exception of the current slab from which new allocations are made
-            # if the current slab is lower in utilization the defragger would have ended up in stagnation,
-            # keept running and not move any allocation.
-            # this test is more consistent on a fresh server with no history
-            start_server {tags {"defrag"} overrides {save ""}} {
-                r flushdb
-                r config resetstat
-                r config set hz 100
-                r config set activedefrag no
-                r config set active-defrag-max-scan-fields 1000
-                r config set active-defrag-threshold-lower 5
-                r config set active-defrag-cycle-min 65
-                r config set active-defrag-cycle-max 75
-                r config set active-defrag-ignore-bytes 1mb
-                r config set maxmemory 0
-                set expected_frag 1.3
-
-                r debug mallctl-str thread.tcache.flush VOID
-                # fill the first slab containin 32 regs of 640 bytes.
-                for {set j 0} {$j < 32} {incr j} {
-                    r setrange "_$j" 600 x
-                    r debug mallctl-str thread.tcache.flush VOID
-                }
-
-                # add a mass of keys with 600 bytes values, fill the bin of 640 bytes which has 32 regs per slab.
-                set rd [redis_deferring_client]
-                set keys 640000
-                for {set j 0} {$j < $keys} {incr j} {
-                    $rd setrange $j 600 x
-                }
-                for {set j 0} {$j < $keys} {incr j} {
-                    $rd read ; # Discard replies
-                }
-
-                # create some fragmentation of 50%
-                set sent 0
-                for {set j 0} {$j < $keys} {incr j 1} {
-                    $rd del $j
-                    incr sent
-                    incr j 1
-                }
-                for {set j 0} {$j < $sent} {incr j} {
-                    $rd read ; # Discard replies
-                }
-
-                # create higher fragmentation in the first slab
-                for {set j 10} {$j < 32} {incr j} {
-                    r del "_$j"
-                }
-
-                # start defrag
-                after 120 ;# serverCron only updates the info once in 100ms
-                set frag [s allocator_frag_ratio]
-                if {$::verbose} {
-                    puts "frag $frag"
-                }
-
-                assert {$frag >= $expected_frag}
-
-                set digest [r debug digest]
-                catch {r config set activedefrag yes} e
-                if {[r config get activedefrag] eq "activedefrag yes"} {
-                    # wait for the active defrag to start working (decision once a second)
-                    wait_for_condition 50 100 {
-                        [s active_defrag_running] ne 0
-                    } else {
-                        fail "defrag not started."
-                    }
-
-                    # wait for the active defrag to stop working
-                    wait_for_condition 500 100 {
-                        [s active_defrag_running] eq 0
-                    } else {
-                        after 120 ;# serverCron only updates the info once in 100ms
-                        puts [r info memory]
-                        puts [r info stats]
-                        puts [r memory malloc-stats]
-                        fail "defrag didn't stop."
-                    }
-
-                    # test the the fragmentation is lower
-                    after 120 ;# serverCron only updates the info once in 100ms
-                    set misses [s active_defrag_misses]
-                    set hits [s active_defrag_hits]
-                    set frag [s allocator_frag_ratio]
-                    if {$::verbose} {
-                        puts "frag $frag"
-                        puts "hits: $hits"
-                        puts "misses: $misses"
-                    }
-                    assert {$frag < 1.1}
-                    assert {$misses < 10000000} ;# when defrag doesn't stop, we have some 30m misses, when it does, we have 2m misses
-                }
-
-                # verify the data isn't corrupted or changed
-                set newdigest [r debug digest]
-                assert {$digest eq $newdigest}
-                r save ;# saving an rdb iterates over all the data / pointers
-            }
-        }
-    }
-}
-} ;# run_solo
diff --git a/redis-stable/tests/unit/moduleapi/auth.tcl b/redis-stable/tests/unit/moduleapi/auth.tcl
deleted file mode 100644
index 04a90a49..00000000
--- a/redis-stable/tests/unit/moduleapi/auth.tcl
+++ /dev/null
@@ -1,71 +0,0 @@
-set testmodule [file normalize tests/modules/auth.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Modules can create a user that can be authenticated} {
-        # Make sure we start authenticated with default user
-        r auth default ""
-        assert_equal [r acl whoami] "default"
-        r auth.createmoduleuser
-
-        set id [r auth.authmoduleuser]
-        assert_equal [r client id] $id
-
-        # Verify returned id is the same as our current id and
-        # we are authenticated with the specified user
-        assert_equal [r acl whoami] "global"
-    }
-
-    test {De-authenticating clients is tracked and kills clients} {
-        assert_equal [r auth.changecount] 0
-        r auth.createmoduleuser
-
-        # Catch the I/O exception that was thrown when Redis
-        # disconnected with us. 
-        catch { [r ping] } e
-        assert_match {*I/O*} $e
-
-        # Check that a user change was registered
-        assert_equal [r auth.changecount] 1
-    }
-
-    test {Modules cant authenticate with ACLs users that dont exist} {
-        catch { [r auth.authrealuser auth-module-test-fake] } e
-        assert_match {*Invalid user*} $e
-    }
-
-    test {Modules can authenticate with ACL users} {
-        assert_equal [r acl whoami] "default"
-
-        # Create user to auth into
-        r acl setuser auth-module-test on allkeys allcommands
-
-        set id [r auth.authrealuser auth-module-test]
-
-        # Verify returned id is the same as our current id and
-        # we are authenticated with the specified user
-        assert_equal [r client id] $id
-        assert_equal [r acl whoami] "auth-module-test"
-    }
-
-    test {Client callback is called on user switch} {
-        assert_equal [r auth.changecount] 0
-
-        # Auth again and validate change count
-        r auth.authrealuser auth-module-test
-        assert_equal [r auth.changecount] 1
-
-        # Re-auth with the default user
-        r auth default ""
-        assert_equal [r auth.changecount] 1
-        assert_equal [r acl whoami] "default"
-
-        # Re-auth with the default user again, to
-        # verify the callback isn't fired again
-        r auth default ""
-        assert_equal [r auth.changecount] 0
-        assert_equal [r acl whoami] "default"
-    }
-
-}
\ No newline at end of file
diff --git a/redis-stable/tests/unit/moduleapi/basics.tcl b/redis-stable/tests/unit/moduleapi/basics.tcl
deleted file mode 100644
index 96683f4c..00000000
--- a/redis-stable/tests/unit/moduleapi/basics.tcl
+++ /dev/null
@@ -1,12 +0,0 @@
-set testmodule [file normalize tests/modules/basics.so]
-
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {test module api basics} {
-        r test.basics
-    } {ALL TESTS PASSED}
-
-    r module unload test
-}
diff --git a/redis-stable/tests/unit/moduleapi/blockedclient.tcl b/redis-stable/tests/unit/moduleapi/blockedclient.tcl
deleted file mode 100644
index 0598a84d..00000000
--- a/redis-stable/tests/unit/moduleapi/blockedclient.tcl
+++ /dev/null
@@ -1,93 +0,0 @@
-# source tests/support/util.tcl
-
-set testmodule [file normalize tests/modules/blockedclient.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Locked GIL acquisition} {
-        assert_match "OK" [r acquire_gil]
-    }
-
-    test {Locked GIL acquisition during multi} {
-    	r multi
-    	r acquire_gil
-    	assert_equal {{Blocked client is not supported inside multi}} [r exec]
-    }
-
-    test {Locked GIL acquisition from RM_Call} {
-    	assert_equal {Blocked client is not allowed} [r do_rm_call acquire_gil]
-    }
-
-    test {Blocking command are not block the client on RM_Call} {
-    	r lpush l test
-    	assert_equal [r do_rm_call blpop l 0] {l test}
-    	
-    	r lpush l test
-    	assert_equal [r do_rm_call brpop l 0] {l test}
-    	
-    	r lpush l1 test
-    	assert_equal [r do_rm_call brpoplpush l1 l2 0] {test}
-    	assert_equal [r do_rm_call brpop l2 0] {l2 test}
-
-    	r lpush l1 test
-    	assert_equal [r do_rm_call blmove l1 l2 LEFT LEFT 0] {test}
-    	assert_equal [r do_rm_call brpop l2 0] {l2 test}
-
-    	r ZADD zset1 0 a 1 b 2 c
-    	assert_equal [r do_rm_call bzpopmin zset1 0] {zset1 a 0}
-    	assert_equal [r do_rm_call bzpopmax zset1 0] {zset1 c 2}
-
-    	r xgroup create s g $ MKSTREAM
-    	r xadd s * foo bar
-    	assert {[r do_rm_call xread BLOCK 0 STREAMS s 0-0] ne {}}
-    	assert {[r do_rm_call xreadgroup group g c BLOCK 0 STREAMS s >] ne {}}
-
-    	assert {[r do_rm_call blpop empty_list 0] eq {}}
-        assert {[r do_rm_call brpop empty_list 0] eq {}}
-        assert {[r do_rm_call brpoplpush empty_list1 empty_list2 0] eq {}}
-        assert {[r do_rm_call blmove empty_list1 empty_list2 LEFT LEFT 0] eq {}}
-        
-        assert {[r do_rm_call bzpopmin empty_zset 0] eq {}}
-        assert {[r do_rm_call bzpopmax empty_zset 0] eq {}}
-       
-        r xgroup create empty_stream g $ MKSTREAM
-        assert {[r do_rm_call xread BLOCK 0 STREAMS empty_stream $] eq {}}
-        assert {[r do_rm_call xreadgroup group g c BLOCK 0 STREAMS empty_stream >] eq {}}
-
-    }
-
-    test {Monitor disallow inside RM_Call} {
-        set e {}
-        catch {
-            r do_rm_call monitor
-        } e
-        set e
-    } {*ERR*DENY BLOCKING*}
-
-    test {subscribe disallow inside RM_Call} {
-        set e {}
-        catch {
-            r do_rm_call subscribe x
-        } e
-        set e
-    } {*ERR*DENY BLOCKING*}
-
-    test {RM_Call from blocked client} {
-        r hset hash foo bar
-        r do_bg_rm_call hgetall hash
-    } {foo bar}
-
-    test {blocked client reaches client output buffer limit} {
-        r hset hash big [string repeat x 50000]
-        r hset hash bada [string repeat x 50000]
-        r hset hash boom [string repeat x 50000]
-        r config set client-output-buffer-limit {normal 100000 0 0}
-        r client setname myclient
-        catch {r do_bg_rm_call hgetall hash} e
-        assert_match "*I/O error*" $e
-        reconnect
-        set clients [r client list]
-        assert_no_match "*name=myclient*" $clients
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/blockonbackground.tcl b/redis-stable/tests/unit/moduleapi/blockonbackground.tcl
deleted file mode 100644
index 79ca5214..00000000
--- a/redis-stable/tests/unit/moduleapi/blockonbackground.tcl
+++ /dev/null
@@ -1,117 +0,0 @@
-set testmodule [file normalize tests/modules/blockonbackground.so]
-
-source tests/support/util.tcl
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test { blocked clients time tracking - check blocked command that uses RedisModule_BlockedClientMeasureTimeStart() is tracking background time} {
-        r slowlog reset
-        r config set slowlog-log-slower-than 200000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r block.debug 0 10000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r config resetstat
-        r block.debug 200 10000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 1
-        }
-
-        set cmdstatline [cmdrstat block.debug r]
-
-        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
-        assert {$usec >= 100000}
-        assert {$usec_per_call >= 100000}
-    }
-
-    test { blocked clients time tracking - check blocked command that uses RedisModule_BlockedClientMeasureTimeStart() is tracking background time even in timeout } {
-        r slowlog reset
-        r config set slowlog-log-slower-than 200000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r block.debug 0 20000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r config resetstat
-        r block.debug 20000 500
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 1
-        }
-
-        set cmdstatline [cmdrstat block.debug r]
-
-        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
-        assert {$usec >= 250000}
-        assert {$usec_per_call >= 250000}
-    }
-
-    test { blocked clients time tracking - check blocked command with multiple calls RedisModule_BlockedClientMeasureTimeStart()  is tracking the total background time } {
-        r slowlog reset
-        r config set slowlog-log-slower-than 200000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r block.double_debug 0
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r config resetstat
-        r block.double_debug 100
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 1
-        }
-        set cmdstatline [cmdrstat block.double_debug r]
-
-        regexp "calls=1,usec=(.*?),usec_per_call=(.*?),rejected_calls=0,failed_calls=0" $cmdstatline usec usec_per_call
-        assert {$usec >= 60000}
-        assert {$usec_per_call >= 60000}
-    }
-
-    test { blocked clients time tracking - check blocked command without calling RedisModule_BlockedClientMeasureTimeStart() is not reporting background time } {
-        r slowlog reset
-        r config set slowlog-log-slower-than 200000
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-        r block.debug_no_track 200 1000
-        # ensure slowlog is still empty
-        if {!$::no_latency} {
-            assert_equal [r slowlog len] 0
-        }
-    }
-
-    test "client unblock works only for modules with timeout support" {
-        set rd [redis_deferring_client]
-        $rd client id
-        set id [$rd read]
-
-        # Block with a timeout function - may unblock
-        $rd block.block 20000
-        wait_for_condition 50 100 {
-            [r block.is_blocked] == 1
-        } else {
-            fail "Module did not block"
-        }
-
-        assert_equal 1 [r client unblock $id]
-        assert_match {*Timed out*} [$rd read]
-
-        # Block without a timeout function - cannot unblock
-        $rd block.block 0
-        wait_for_condition 50 100 {
-            [r block.is_blocked] == 1
-        } else {
-            fail "Module did not block"
-        }
-
-        assert_equal 0 [r client unblock $id]
-        assert_equal "OK" [r block.release foobar]
-        assert_equal "foobar" [$rd read]
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/blockonkeys.tcl b/redis-stable/tests/unit/moduleapi/blockonkeys.tcl
deleted file mode 100644
index 75191b3c..00000000
--- a/redis-stable/tests/unit/moduleapi/blockonkeys.tcl
+++ /dev/null
@@ -1,239 +0,0 @@
-set testmodule [file normalize tests/modules/blockonkeys.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test "Module client blocked on keys: Circular BPOPPUSH" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-
-        r del src dst
-
-        $rd1 fsl.bpoppush src dst 0
-        $rd2 fsl.bpoppush dst src 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {2}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        r fsl.push src 42
-
-        assert_equal {42} [r fsl.getall src]
-        assert_equal {} [r fsl.getall dst]
-    }
-
-    test "Module client blocked on keys: Self-referential BPOPPUSH" {
-        set rd1 [redis_deferring_client]
-
-        r del src
-
-        $rd1 fsl.bpoppush src src 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r fsl.push src 42
-
-        assert_equal {42} [r fsl.getall src]
-    }
-
-    test {Module client blocked on keys (no metadata): No block} {
-        r del k
-        r fsl.push k 33
-        r fsl.push k 34
-        r fsl.bpop k 0
-    } {34}
-
-    test {Module client blocked on keys (no metadata): Timeout} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd fsl.bpop k 1
-        assert_equal {Request timedout} [$rd read]
-    }
-
-    test {Module client blocked on keys (no metadata): Blocked} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd fsl.bpop k 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r fsl.push k 34
-        assert_equal {34} [$rd read]
-    }
-
-    test {Module client blocked on keys (with metadata): No block} {
-        r del k
-        r fsl.push k 34
-        r fsl.bpopgt k 30 0
-    } {34}
-
-    test {Module client blocked on keys (with metadata): Timeout} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd client id
-        set cid [$rd read]
-        r fsl.push k 33
-        $rd fsl.bpopgt k 35 1
-        assert_equal {Request timedout} [$rd read]
-        r client kill id $cid ;# try to smoke-out client-related memory leak
-    }
-
-    test {Module client blocked on keys (with metadata): Blocked, case 1} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd client id
-        set cid [$rd read]
-        r fsl.push k 33
-        $rd fsl.bpopgt k 33 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r fsl.push k 34
-        assert_equal {34} [$rd read]
-        r client kill id $cid ;# try to smoke-out client-related memory leak
-    }
-
-    test {Module client blocked on keys (with metadata): Blocked, case 2} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd fsl.bpopgt k 35 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r fsl.push k 33
-        r fsl.push k 34
-        r fsl.push k 35
-        r fsl.push k 36
-        assert_equal {36} [$rd read]
-    }
-
-    test {Module client blocked on keys (with metadata): Blocked, CLIENT KILL} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd client id
-        set cid [$rd read]
-        $rd fsl.bpopgt k 35 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client kill id $cid ;# try to smoke-out client-related memory leak
-    }
-
-    test {Module client blocked on keys (with metadata): Blocked, CLIENT UNBLOCK TIMEOUT} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd client id
-        set cid [$rd read]
-        $rd fsl.bpopgt k 35 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client unblock $cid timeout ;# try to smoke-out client-related memory leak
-        assert_equal {Request timedout} [$rd read]
-    }
-
-    test {Module client blocked on keys (with metadata): Blocked, CLIENT UNBLOCK ERROR} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd client id
-        set cid [$rd read]
-        $rd fsl.bpopgt k 35 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client unblock $cid error ;# try to smoke-out client-related memory leak
-        assert_error "*unblocked*" {$rd read}
-    }
-
-    test {Module client re-blocked on keys after woke up on wrong type} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd fsl.bpop k 0
-        ;# wait until clients are actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r lpush k 12
-        r lpush k 13
-        r lpush k 14
-        r del k
-        r fsl.push k 34
-        assert_equal {34} [$rd read]
-        assert_equal {1} [r get fsl_wrong_type] ;# first lpush caused one wrong-type wake-up
-    }
-
-    test {Module client blocked on keys woken up by LPUSH} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd blockonkeys.popall k
-        # wait until client is actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Client is not blocked"
-        }
-        r lpush k 42 squirrel banana
-        assert_equal {banana squirrel 42} [$rd read]
-        $rd close
-    }
-
-    test {Module client unblocks BLPOP} {
-        r del k
-        set rd [redis_deferring_client]
-        $rd blpop k 3
-        # wait until client is actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Client is not blocked"
-        }
-        r blockonkeys.lpush k 42
-        assert_equal {k 42} [$rd read]
-        $rd close
-    }
-
-    test {Module unblocks module blocked on non-empty list} {
-        r del k
-        r lpush k aa
-        # Module client blocks to pop 5 elements from list
-        set rd [redis_deferring_client]
-        $rd blockonkeys.blpopn k 5
-        # Wait until client is actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Client is not blocked"
-        }
-        # Check that RM_SignalKeyAsReady() can wake up BLPOPN
-        r blockonkeys.lpush_unblock k bb cc ;# Not enough elements for BLPOPN
-        r lpush k dd ee ff                  ;# Doesn't unblock module
-        r blockonkeys.lpush_unblock k gg    ;# Unblocks module
-        assert_equal {gg ff ee dd cc} [$rd read]
-        $rd close
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/commandfilter.tcl b/redis-stable/tests/unit/moduleapi/commandfilter.tcl
deleted file mode 100644
index 6078f64f..00000000
--- a/redis-stable/tests/unit/moduleapi/commandfilter.tcl
+++ /dev/null
@@ -1,84 +0,0 @@
-set testmodule [file normalize tests/modules/commandfilter.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule log-key 0
-
-    test {Command Filter handles redirected commands} {
-        r set mykey @log
-        r lrange log-key 0 -1
-    } "{set mykey @log}"
-
-    test {Command Filter can call RedisModule_CommandFilterArgDelete} {
-        r rpush mylist elem1 @delme elem2
-        r lrange mylist 0 -1
-    } {elem1 elem2}
-
-    test {Command Filter can call RedisModule_CommandFilterArgInsert} {
-        r del mylist
-        r rpush mylist elem1 @insertbefore elem2 @insertafter elem3
-        r lrange mylist 0 -1
-    } {elem1 --inserted-before-- @insertbefore elem2 @insertafter --inserted-after-- elem3}
-
-    test {Command Filter can call RedisModule_CommandFilterArgReplace} {
-        r del mylist
-        r rpush mylist elem1 @replaceme elem2
-        r lrange mylist 0 -1
-    } {elem1 --replaced-- elem2}
-
-    test {Command Filter applies on RM_Call() commands} {
-        r del log-key
-        r commandfilter.ping
-        r lrange log-key 0 -1
-    } "{ping @log}"
-
-    test {Command Filter applies on Lua redis.call()} {
-        r del log-key
-        r eval "redis.call('ping', '@log')" 0
-        r lrange log-key 0 -1
-    } "{ping @log}"
-
-    test {Command Filter applies on Lua redis.call() that calls a module} {
-        r del log-key
-        r eval "redis.call('commandfilter.ping')" 0
-        r lrange log-key 0 -1
-    } "{ping @log}"
-
-    test {Command Filter is unregistered implicitly on module unload} {
-        r del log-key
-        r module unload commandfilter
-        r set mykey @log
-        r lrange log-key 0 -1
-    } {}
-
-    r module load $testmodule log-key 0
-
-    test {Command Filter unregister works as expected} {
-        # Validate reloading succeeded
-        r del log-key
-        r set mykey @log
-        assert_equal "{set mykey @log}" [r lrange log-key 0 -1]
-
-        # Unregister
-        r commandfilter.unregister
-        r del log-key
-
-        r set mykey @log
-        r lrange log-key 0 -1
-    } {}
-
-    r module unload commandfilter
-    r module load $testmodule log-key 1
-
-    test {Command Filter REDISMODULE_CMDFILTER_NOSELF works as expected} {
-        r set mykey @log
-        assert_equal "{set mykey @log}" [r lrange log-key 0 -1]
-
-        r del log-key
-        r commandfilter.ping
-        assert_equal {} [r lrange log-key 0 -1]
-
-        r eval "redis.call('commandfilter.ping')" 0
-        assert_equal {} [r lrange log-key 0 -1]
-    }
-
-} 
diff --git a/redis-stable/tests/unit/moduleapi/datatype.tcl b/redis-stable/tests/unit/moduleapi/datatype.tcl
deleted file mode 100644
index cd6ebb32..00000000
--- a/redis-stable/tests/unit/moduleapi/datatype.tcl
+++ /dev/null
@@ -1,58 +0,0 @@
-set testmodule [file normalize tests/modules/datatype.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {DataType: Test module is sane, GET/SET work.} {
-        r datatype.set dtkey 100 stringval
-        assert {[r datatype.get dtkey] eq {100 stringval}}
-    }
-
-    test {DataType: RM_SaveDataTypeToString(), RM_LoadDataTypeFromString() work} {
-        r datatype.set dtkey -1111 MyString
-        set encoded [r datatype.dump dtkey]
-
-        r datatype.restore dtkeycopy $encoded
-        assert {[r datatype.get dtkeycopy] eq {-1111 MyString}}
-    }
-
-    test {DataType: Handle truncated RM_LoadDataTypeFromString()} {
-        r datatype.set dtkey -1111 MyString
-        set encoded [r datatype.dump dtkey]
-        set truncated [string range $encoded 0 end-1]
-
-        catch {r datatype.restore dtkeycopy $truncated} e
-        set e
-    } {*Invalid*}
-
-    test {DataType: ModuleTypeReplaceValue() happy path works} {
-        r datatype.set key-a 1 AAA
-        r datatype.set key-b 2 BBB
-
-        assert {[r datatype.swap key-a key-b] eq {OK}}
-        assert {[r datatype.get key-a] eq {2 BBB}}
-        assert {[r datatype.get key-b] eq {1 AAA}}
-    }
-
-    test {DataType: ModuleTypeReplaceValue() fails on non-module keys} {
-        r datatype.set key-a 1 AAA
-        r set key-b RedisString
-
-        catch {r datatype.swap key-a key-b} e
-        set e
-    } {*ERR*}
-
-    test {DataType: Copy command works for modules} {
-        # Test failed copies
-        r datatype.set answer-to-universe 42 AAA
-        catch {r copy answer-to-universe answer2} e
-        assert_match {*module key failed to copy*} $e
-
-        # Our module's data type copy function copies the int value as-is
-        # but appends /<from-key>/<to-key> to the string value so we can
-        # track passed arguments.
-        r datatype.set sourcekey 1234 AAA
-        r copy sourcekey targetkey
-        r datatype.get targetkey
-    } {1234 AAA/sourcekey/targetkey}
-}
diff --git a/redis-stable/tests/unit/moduleapi/defrag.tcl b/redis-stable/tests/unit/moduleapi/defrag.tcl
deleted file mode 100644
index b2e23967..00000000
--- a/redis-stable/tests/unit/moduleapi/defrag.tcl
+++ /dev/null
@@ -1,46 +0,0 @@
-set testmodule [file normalize tests/modules/defragtest.so]
-
-start_server {tags {"modules"} overrides {{save ""}}} {
-    r module load $testmodule 10000
-    r config set hz 100
-    r config set active-defrag-ignore-bytes 1
-    r config set active-defrag-threshold-lower 0
-    r config set active-defrag-cycle-min 99
-
-    # try to enable active defrag, it will fail if redis was compiled without it
-    catch {r config set activedefrag yes} e
-    if {[r config get activedefrag] eq "activedefrag yes"} {
-
-        test {Module defrag: simple key defrag works} {
-            r frag.create key1 1 1000 0
-
-            after 2000
-            set info [r info defragtest_stats]
-            assert {[getInfoProperty $info defragtest_datatype_attempts] > 0}
-            assert_equal 0 [getInfoProperty $info defragtest_datatype_resumes]
-        }
-
-        test {Module defrag: late defrag with cursor works} {
-            r flushdb
-            r frag.resetstats
-
-            # key can only be defragged in no less than 10 iterations
-            # due to maxstep
-            r frag.create key2 10000 100 1000
-
-            after 2000
-            set info [r info defragtest_stats]
-            assert {[getInfoProperty $info defragtest_datatype_resumes] > 10}
-            assert_equal 0 [getInfoProperty $info defragtest_datatype_wrong_cursor]
-        }
-
-        test {Module defrag: global defrag works} {
-            r flushdb
-            r frag.resetstats
-
-            after 2000
-            set info [r info defragtest_stats]
-            assert {[getInfoProperty $info defragtest_global_attempts] > 0}
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/fork.tcl b/redis-stable/tests/unit/moduleapi/fork.tcl
deleted file mode 100644
index 8535a338..00000000
--- a/redis-stable/tests/unit/moduleapi/fork.tcl
+++ /dev/null
@@ -1,31 +0,0 @@
-set testmodule [file normalize tests/modules/fork.so]
-
-proc count_log_message {pattern} {
-    set result [exec grep -c $pattern < [srv 0 stdout]]
-}
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Module fork} {
-        # the argument to fork.create is the exitcode on termination
-        r fork.create 3
-        wait_for_condition 20 100 {
-            [r fork.exitcode] != -1
-        } else {
-            fail "fork didn't terminate"
-        }
-        r fork.exitcode
-    } {3}
-
-    test {Module fork kill} {
-        r fork.create 3
-        after 250
-        r fork.kill
-
-        assert {[count_log_message "fork child started"] eq "2"}
-        assert {[count_log_message "Received SIGUSR1 in child"] eq "1"}
-        assert {[count_log_message "fork child exiting"] eq "1"}
-    }
-
-}
diff --git a/redis-stable/tests/unit/moduleapi/getkeys.tcl b/redis-stable/tests/unit/moduleapi/getkeys.tcl
deleted file mode 100644
index a24a65ba..00000000
--- a/redis-stable/tests/unit/moduleapi/getkeys.tcl
+++ /dev/null
@@ -1,44 +0,0 @@
-set testmodule [file normalize tests/modules/getkeys.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {COMMAND INFO correctly reports a movable keys module command} {
-        set info [lindex [r command info getkeys.command] 0]
-
-        assert_equal {movablekeys} [lindex $info 2]
-        assert_equal {0} [lindex $info 3]
-        assert_equal {0} [lindex $info 4]
-        assert_equal {0} [lindex $info 5]
-    }
-
-    test {COMMAND GETKEYS correctly reports a movable keys module command} {
-        r command getkeys getkeys.command arg1 arg2 key key1 arg3 key key2 key key3
-    } {key1 key2 key3}
-
-    test {RM_GetCommandKeys on non-existing command} {
-        catch {r getkeys.introspect non-command key1 key2} e
-        set _ $e
-    } {*ENOENT*}
-
-    test {RM_GetCommandKeys on built-in fixed keys command} {
-        r getkeys.introspect set key1 value1
-    } {key1}
-
-    test {RM_GetCommandKeys on EVAL} {
-        r getkeys.introspect eval "" 4 key1 key2 key3 key4 arg1 arg2
-    } {key1 key2 key3 key4}
-
-    test {RM_GetCommandKeys on a movable keys module command} {
-        r getkeys.introspect getkeys.command arg1 arg2 key key1 arg3 key key2 key key3
-    } {key1 key2 key3}
-
-    test {RM_GetCommandKeys on a non-movable module command} {
-        r getkeys.introspect getkeys.fixed arg1 key1 key2 key3 arg2
-    } {key1 key2 key3}
-
-    test {RM_GetCommandKeys with bad arity} {
-        catch {r getkeys.introspect set key} e
-        set _ $e
-    } {*EINVAL*}
-}
diff --git a/redis-stable/tests/unit/moduleapi/hash.tcl b/redis-stable/tests/unit/moduleapi/hash.tcl
deleted file mode 100644
index 89bb6c63..00000000
--- a/redis-stable/tests/unit/moduleapi/hash.tcl
+++ /dev/null
@@ -1,23 +0,0 @@
-set testmodule [file normalize tests/modules/hash.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Module hash set} {
-        r set k mystring
-        assert_error "WRONGTYPE*" {r hash.set k "" hello world}
-        r del k
-        # "" = count updates and deletes of existing fields only
-        assert_equal 0 [r hash.set k "" squirrel yes]
-        # "a" = COUNT_ALL = count inserted, modified and deleted fields
-        assert_equal 2 [r hash.set k "a" banana no sushi whynot]
-        # "n" = NX = only add fields not already existing in the hash
-        # "x" = XX = only replace the value for existing fields
-        assert_equal 0 [r hash.set k "n" squirrel hoho what nothing]
-        assert_equal 1 [r hash.set k "na" squirrel hoho something nice]
-        assert_equal 0 [r hash.set k "xa" new stuff not inserted]
-        assert_equal 1 [r hash.set k "x" squirrel ofcourse]
-        assert_equal 1 [r hash.set k "" sushi :delete: none :delete:]
-        r hgetall k
-    } {squirrel ofcourse banana no what nothing something nice}
-}
diff --git a/redis-stable/tests/unit/moduleapi/hooks.tcl b/redis-stable/tests/unit/moduleapi/hooks.tcl
deleted file mode 100644
index c4af59bd..00000000
--- a/redis-stable/tests/unit/moduleapi/hooks.tcl
+++ /dev/null
@@ -1,163 +0,0 @@
-set testmodule [file normalize tests/modules/hooks.so]
-
-tags "modules" {
-    start_server [list overrides [list loadmodule "$testmodule" appendonly yes]] {
-
-        test {Test clients connection / disconnection hooks} {
-            for {set j 0} {$j < 2} {incr j} {
-                set rd1 [redis_deferring_client]
-                $rd1 close
-            }
-            assert {[r hooks.event_count client-connected] > 1}
-            assert {[r hooks.event_count client-disconnected] > 1}
-        }
-
-        test {Test module cron hook} {
-            after 100
-            assert {[r hooks.event_count cron-loop] > 0}
-            set hz [r hooks.event_last cron-loop]
-            assert_equal $hz 10
-        }
-
-        test {Test module loaded / unloaded hooks} {
-            set othermodule [file normalize tests/modules/infotest.so]
-            r module load $othermodule
-            r module unload infotest
-            assert_equal [r hooks.event_last module-loaded] "infotest"
-            assert_equal [r hooks.event_last module-unloaded] "infotest"
-        }
-
-        test {Test module aofrw hook} {
-            r debug populate 1000 foo 10000 ;# 10mb worth of data
-            r config set rdbcompression no ;# rdb progress is only checked once in 2mb
-            r BGREWRITEAOF
-            waitForBgrewriteaof r
-            assert_equal [string match {*module-event-persistence-aof-start*} [exec tail -20 < [srv 0 stdout]]] 1
-            assert_equal [string match {*module-event-persistence-end*} [exec tail -20 < [srv 0 stdout]]] 1
-        }
-
-        test {Test module aof load and rdb/aof progress hooks} {
-            # create some aof tail (progress is checked only once in 1000 commands)
-            for {set j 0} {$j < 4000} {incr j} {
-                r set "bar$j" x
-            }
-            # set some configs that will cause many loading progress events during aof loading
-            r config set key-load-delay 500
-            r config set dynamic-hz no
-            r config set hz 500
-            r DEBUG LOADAOF
-            assert_equal [r hooks.event_last loading-aof-start] 0
-            assert_equal [r hooks.event_last loading-end] 0
-            assert {[r hooks.event_count loading-rdb-start] == 0}
-            assert_lessthan 2 [r hooks.event_count loading-progress-rdb] ;# comes from the preamble section
-            assert_lessthan 2 [r hooks.event_count loading-progress-aof]
-            if {$::verbose} {
-                puts "rdb progress events [r hooks.event_count loading-progress-rdb]"
-                puts "aof progress events [r hooks.event_count loading-progress-aof]"
-            }
-        }
-        # undo configs before next test
-        r config set dynamic-hz yes
-        r config set key-load-delay 0
-
-        test {Test module rdb save hook} {
-            # debug reload does: save, flush, load:
-            assert {[r hooks.event_count persistence-syncrdb-start] == 0}
-            assert {[r hooks.event_count loading-rdb-start] == 0}
-            r debug reload
-            assert {[r hooks.event_count persistence-syncrdb-start] == 1}
-            assert {[r hooks.event_count loading-rdb-start] == 1}
-        }
-
-        test {Test flushdb hooks} {
-            r flushdb
-            assert_equal [r hooks.event_last flush-start] 9
-            assert_equal [r hooks.event_last flush-end] 9
-            r flushall
-            assert_equal [r hooks.event_last flush-start] -1
-            assert_equal [r hooks.event_last flush-end] -1
-        }
-
-        # replication related tests
-        set master [srv 0 client]
-        set master_host [srv 0 host]
-        set master_port [srv 0 port]
-        start_server {} {
-            r module load $testmodule
-            set replica [srv 0 client]
-            set replica_host [srv 0 host]
-            set replica_port [srv 0 port]
-            $replica replicaof $master_host $master_port
-
-            wait_for_condition 50 100 {
-                [string match {*master_link_status:up*} [r info replication]]
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-
-            test {Test master link up hook} {
-                assert_equal [r hooks.event_count masterlink-up] 1
-                assert_equal [r hooks.event_count masterlink-down] 0
-            }
-
-            test {Test role-replica hook} {
-                assert_equal [r hooks.event_count role-replica] 1
-                assert_equal [r hooks.event_count role-master] 0
-                assert_equal [r hooks.event_last role-replica] [s 0 master_host]
-            }
-
-            test {Test replica-online hook} {
-                assert_equal [r -1 hooks.event_count replica-online] 1
-                assert_equal [r -1 hooks.event_count replica-offline] 0
-            }
-
-            test {Test master link down hook} {
-                r client kill type master
-                assert_equal [r hooks.event_count masterlink-down] 1
-
-                wait_for_condition 50 100 {
-                    [string match {*master_link_status:up*} [r info replication]]
-                } else {
-                    fail "Replica didn't reconnect"
-                }
-
-                assert_equal [r hooks.event_count masterlink-down] 1
-                assert_equal [r hooks.event_count masterlink-up] 2
-            }
-
-            wait_for_condition 50 10 {
-                [string match {*master_link_status:up*} [r info replication]]
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-
-            $replica replicaof no one
-
-            test {Test role-master hook} {
-                assert_equal [r hooks.event_count role-replica] 1
-                assert_equal [r hooks.event_count role-master] 1
-                assert_equal [r hooks.event_last role-master] {}
-            }
-
-            test {Test replica-offline hook} {
-                assert_equal [r -1 hooks.event_count replica-online] 2
-                assert_equal [r -1 hooks.event_count replica-offline] 2
-            }
-            # get the replica stdout, to be used by the next test
-            set replica_stdout [srv 0 stdout]
-        }
-
-        test {Test swapdb hooks} {
-            r swapdb 0 10
-            assert_equal [r hooks.event_last swapdb-first] 0
-            assert_equal [r hooks.event_last swapdb-second] 10
-
-        }
-
-        # look into the log file of the server that just exited
-        test {Test shutdown hook} {
-            assert_equal [string match {*module-event-shutdown*} [exec tail -5 < $replica_stdout]] 1
-        }
-
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/infotest.tcl b/redis-stable/tests/unit/moduleapi/infotest.tcl
deleted file mode 100644
index 1ad2ee6f..00000000
--- a/redis-stable/tests/unit/moduleapi/infotest.tcl
+++ /dev/null
@@ -1,94 +0,0 @@
-set testmodule [file normalize tests/modules/infotest.so]
-
-# Return value for INFO property
-proc field {info property} {
-    if {[regexp "\r\n$property:(.*?)\r\n" $info _ value]} {
-        set _ $value
-    }
-}
-
-start_server {tags {"modules"}} {
-    r module load $testmodule log-key 0
-
-    test {module reading info} {
-        # check string, integer and float fields
-        assert_equal [r info.gets replication role] "master"
-        assert_equal [r info.getc replication role] "master"
-        assert_equal [r info.geti stats expired_keys] 0
-        assert_equal [r info.getd stats expired_stale_perc] 0
-
-        # check signed and unsigned
-        assert_equal [r info.geti infotest infotest_global] -2
-        assert_equal [r info.getu infotest infotest_uglobal] -2
-
-        # the above are always 0, try module info that is non-zero
-        assert_equal [r info.geti infotest_italian infotest_due] 2
-        set tre [r info.getd infotest_italian infotest_tre]
-        assert {$tre > 3.2 && $tre < 3.4 }
-
-        # search using the wrong section
-        catch { [r info.gets badname redis_version] } e
-        assert_match {*not found*} $e
-
-        # check that section filter works
-        assert { [string match "*usec_per_call*" [r info.gets all cmdstat_info.gets] ] }
-        catch { [r info.gets default cmdstat_info.gets] ] } e
-        assert_match {*not found*} $e
-    }
-
-    test {module info all} {
-        set info [r info all]
-        # info all does not contain modules
-        assert { ![string match "*Spanish*" $info] }
-        assert { ![string match "*infotest_*" $info] }
-        assert { [string match "*used_memory*" $info] }
-    }
-
-    test {module info everything} {
-        set info [r info everything]
-        # info everything contains all default sections, but not ones for crash report
-        assert { [string match "*infotest_global*" $info] }
-        assert { [string match "*Spanish*" $info] }
-        assert { [string match "*Italian*" $info] }
-        assert { [string match "*used_memory*" $info] }
-        assert { ![string match "*Klingon*" $info] }
-        field $info infotest_dos
-    } {2}
-
-    test {module info modules} {
-        set info [r info modules]
-        # info all does not contain modules
-        assert { [string match "*Spanish*" $info] }
-        assert { [string match "*infotest_global*" $info] }
-        assert { ![string match "*used_memory*" $info] }
-    }
-
-    test {module info one module} {
-        set info [r info INFOTEST]
-        # info all does not contain modules
-        assert { [string match "*Spanish*" $info] }
-        assert { ![string match "*used_memory*" $info] }
-        field $info infotest_global
-    } {-2}
-
-    test {module info one section} {
-        set info [r info INFOTEST_SPANISH]
-        assert { ![string match "*used_memory*" $info] }
-        assert { ![string match "*Italian*" $info] }
-        assert { ![string match "*infotest_global*" $info] }
-        field $info infotest_uno
-    } {one}
-
-    test {module info dict} {
-        set info [r info infotest_keyspace]
-        set keyspace [field $info infotest_db0]
-        set keys [scan [regexp -inline {keys\=([\d]*)} $keyspace] keys=%d]
-    } {3}
-
-    test {module info unsafe fields} {
-        set info [r info infotest_unsafe]
-        assert_match {*infotest_unsafe_field:value=1*} $info
-    }
-
-    # TODO: test crash report.
-} 
diff --git a/redis-stable/tests/unit/moduleapi/keyspace_events.tcl b/redis-stable/tests/unit/moduleapi/keyspace_events.tcl
deleted file mode 100644
index 60800bbf..00000000
--- a/redis-stable/tests/unit/moduleapi/keyspace_events.tcl
+++ /dev/null
@@ -1,86 +0,0 @@
-set testmodule [file normalize tests/modules/keyspace_events.so]
-
-tags "modules" {
-    start_server [list overrides [list loadmodule "$testmodule"]] {
-
-        test {Test loaded key space event} {
-            r set x 1
-            r hset y f v
-            r lpush z 1 2 3
-            r sadd p 1 2 3
-            r zadd t 1 f1 2 f2
-            r xadd s * f v
-            r debug reload
-            assert_equal {1 x} [r keyspace.is_key_loaded x]
-            assert_equal {1 y} [r keyspace.is_key_loaded y]
-            assert_equal {1 z} [r keyspace.is_key_loaded z]
-            assert_equal {1 p} [r keyspace.is_key_loaded p]
-            assert_equal {1 t} [r keyspace.is_key_loaded t]
-            assert_equal {1 s} [r keyspace.is_key_loaded s]
-        }
-
-        test {Nested multi due to RM_Call} {
-            r del multi
-            r del lua
-
-            r set x 1
-            r set x_copy 1
-            r keyspace.del_key_copy x
-            r keyspace.incr_case1 x
-            r keyspace.incr_case2 x
-            r keyspace.incr_case3 x
-            assert_equal {} [r get multi]
-            assert_equal {} [r get lua]
-            r get x
-        } {3}
-        
-        test {Nested multi due to RM_Call, with client MULTI} {
-            r del multi
-            r del lua
-
-            r set x 1
-            r set x_copy 1
-            r multi
-            r keyspace.del_key_copy x
-            r keyspace.incr_case1 x
-            r keyspace.incr_case2 x
-            r keyspace.incr_case3 x
-            r exec
-            assert_equal {1} [r get multi]
-            assert_equal {} [r get lua]
-            r get x
-        } {3}
-        
-        test {Nested multi due to RM_Call, with EVAL} {
-            r del multi
-            r del lua
-
-            r set x 1
-            r set x_copy 1
-            r eval {
-                redis.pcall('keyspace.del_key_copy', KEYS[1])
-                redis.pcall('keyspace.incr_case1', KEYS[1])
-                redis.pcall('keyspace.incr_case2', KEYS[1])
-                redis.pcall('keyspace.incr_case3', KEYS[1])
-            } 1 x
-            assert_equal {} [r get multi]
-            assert_equal {1} [r get lua]
-            r get x
-        } {3}
-
-        test {Test module key space event} {
-            r keyspace.notify x
-            assert_equal {1 x} [r keyspace.is_module_key_notified x]
-        }
-
-        test "Keyspace notifications: module events test" {
-            r config set notify-keyspace-events Kd
-            r del x
-            set rd1 [redis_deferring_client]
-            assert_equal {1} [psubscribe $rd1 *]
-            r keyspace.notify x
-            assert_equal {pmessage * __keyspace@9__:x notify} [$rd1 read]
-            $rd1 close
-        }
-	}
-}
diff --git a/redis-stable/tests/unit/moduleapi/misc.tcl b/redis-stable/tests/unit/moduleapi/misc.tcl
deleted file mode 100644
index a6a7a78f..00000000
--- a/redis-stable/tests/unit/moduleapi/misc.tcl
+++ /dev/null
@@ -1,118 +0,0 @@
-set testmodule [file normalize tests/modules/misc.so]
-
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {test RM_Call} {
-        set info [r test.call_info commandstats]
-        # cmdstat is not in a default section, so we also test an argument was passed
-        assert { [string match "*cmdstat_module*" $info] }
-    }
-
-    test {test RM_Call args array} {
-        set info [r test.call_generic info commandstats]
-        # cmdstat is not in a default section, so we also test an argument was passed
-        assert { [string match "*cmdstat_module*" $info] }
-    }
-
-    test {test RM_Call recursive} {
-        set info [r test.call_generic test.call_generic info commandstats]
-        assert { [string match "*cmdstat_module*" $info] }
-    }
-
-    test {test redis version} {
-        set version [s redis_version]
-        assert_equal $version [r test.redisversion]
-    }
-
-    test {test long double conversions} {
-        set ld [r test.ld_conversion]
-        assert {[string match $ld "0.00000000000000001"]}
-    }
-
-    test {test module db commands} {
-        r set x foo
-        set key [r test.randomkey]
-        assert_equal $key "x"
-        assert_equal [r test.dbsize] 1
-        r test.flushall
-        assert_equal [r test.dbsize] 0
-    }
-
-    test {test modle lru api} {
-        r config set maxmemory-policy allkeys-lru
-        r set x foo
-        set lru [r test.getlru x]
-        assert { $lru <= 1000 }
-        set was_set [r test.setlru x 100000]
-        assert { $was_set == 1 }
-        set idle [r object idletime x]
-        assert { $idle >= 100 }
-        set lru [r test.getlru x]
-        assert { $lru >= 100000 }
-        r config set maxmemory-policy allkeys-lfu
-        set lru [r test.getlru x]
-        assert { $lru == -1 }
-        set was_set [r test.setlru x 100000]
-        assert { $was_set == 0 }
-    }
-    r config set maxmemory-policy allkeys-lru
-
-    test {test modle lfu api} {
-        r config set maxmemory-policy allkeys-lfu
-        r set x foo
-        set lfu [r test.getlfu x]
-        assert { $lfu >= 1 }
-        set was_set [r test.setlfu x 100]
-        assert { $was_set == 1 }
-        set freq [r object freq x]
-        assert { $freq <= 100 }
-        set lfu [r test.getlfu x]
-        assert { $lfu <= 100 }
-        r config set maxmemory-policy allkeys-lru
-        set lfu [r test.getlfu x]
-        assert { $lfu == -1 }
-        set was_set [r test.setlfu x 100]
-        assert { $was_set == 0 }
-    }
-
-    test {test module clientinfo api} {
-        # Test basic sanity and SSL flag
-        set info [r test.clientinfo]
-        set ssl_flag [expr $::tls ? {"ssl:"} : {":"}]
-
-        assert { [dict get $info db] == 9 }
-        assert { [dict get $info flags] == "${ssl_flag}::::" }
-
-        # Test MULTI flag
-        r multi
-        r test.clientinfo
-        set info [lindex [r exec] 0]
-        assert { [dict get $info flags] == "${ssl_flag}::::multi" }
-
-        # Test TRACKING flag
-        r client tracking on
-        set info [r test.clientinfo]
-        assert { [dict get $info flags] == "${ssl_flag}::tracking::" }
-    }
-
-    test {test module getclientcert api} {
-        set cert [r test.getclientcert]
-
-        if {$::tls} {
-            assert {$cert != ""}
-        } else {
-            assert {$cert == ""}
-        }
-    }
-
-    test {test detached thread safe cnotext} {
-        r test.log_tsctx "info" "Test message"
-        verify_log_message 0 "*<misc> Test message*" 0
-    }
-
-    test {test RM_Call CLIENT INFO} {
-        assert_match "*fd=-1*" [r test.call_generic client info]
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/propagate.tcl b/redis-stable/tests/unit/moduleapi/propagate.tcl
deleted file mode 100644
index a8c71007..00000000
--- a/redis-stable/tests/unit/moduleapi/propagate.tcl
+++ /dev/null
@@ -1,268 +0,0 @@
-set testmodule [file normalize tests/modules/propagate.so]
-
-tags "modules" {
-    test {Modules can propagate in async and threaded contexts} {
-        start_server [list overrides [list loadmodule "$testmodule"]] {
-            set replica [srv 0 client]
-            set replica_host [srv 0 host]
-            set replica_port [srv 0 port]
-            start_server [list overrides [list loadmodule "$testmodule"]] {
-                set master [srv 0 client]
-                set master_host [srv 0 host]
-                set master_port [srv 0 port]
-
-                # Start the replication process...
-                $replica replicaof $master_host $master_port
-                wait_for_sync $replica
-                after 1000
-
-                test {module propagates from timer} {
-                    set repl [attach_to_replication_stream]
-
-                    $master propagate-test.timer
-
-                    wait_for_condition 5000 10 {
-                        [$replica get timer] eq "3"
-                    } else {
-                        fail "The two counters don't match the expected value."
-                    }
-
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr timer}
-                        {exec}
-                        {multi}
-                        {incr timer}
-                        {exec}
-                        {multi}
-                        {incr timer}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates nested ctx case1} {
-                    set repl [attach_to_replication_stream]
-
-                    $master del timer-nested-start
-                    $master del timer-nested-end
-                    $master propagate-test.timer-nested
-
-                    wait_for_condition 5000 10 {
-                        [$replica get timer-nested-end] eq "1"
-                    } else {
-                        fail "The two counters don't match the expected value."
-                    }
-
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incrby timer-nested-start 1}
-                        {incrby timer-nested-end 1}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates nested ctx case2} {
-                    set repl [attach_to_replication_stream]
-
-                    $master del timer-nested-start
-                    $master del timer-nested-end
-                    $master propagate-test.timer-nested-repl
-
-                    wait_for_condition 5000 10 {
-                        [$replica get timer-nested-end] eq "1"
-                    } else {
-                        fail "The two counters don't match the expected value."
-                    }
-
-                    # Note the 'after-call' and 'timer-nested-start' propagation below is out of order (known limitation)
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr using-call}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {incr after-call}
-                        {incr counter-3}
-                        {incr counter-4}
-                        {incrby timer-nested-start 1}
-                        {incrby timer-nested-end 1}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates from thread} {
-                    set repl [attach_to_replication_stream]
-
-                    $master propagate-test.thread
-
-                    wait_for_condition 5000 10 {
-                        [$replica get a-from-thread] eq "3"
-                    } else {
-                        fail "The two counters don't match the expected value."
-                    }
-
-                    assert_replication_stream $repl {
-                        {select *}
-                        {incr a-from-thread}
-                        {incr b-from-thread}
-                        {incr a-from-thread}
-                        {incr b-from-thread}
-                        {incr a-from-thread}
-                        {incr b-from-thread}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates from from command} {
-                    set repl [attach_to_replication_stream]
-
-                    $master propagate-test.simple
-                    $master propagate-test.mixed
-
-                    # Note the 'after-call' propagation below is out of order (known limitation)
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                        {multi}
-                        {incr using-call}
-                        {incr after-call}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates from from command after good EVAL} {
-                    set repl [attach_to_replication_stream]
-
-                    assert_equal [ $master eval { return "hello" } 0 ] {hello}
-                    $master propagate-test.simple
-                    $master propagate-test.mixed
-
-                    # Note the 'after-call' propagation below is out of order (known limitation)
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                        {multi}
-                        {incr using-call}
-                        {incr after-call}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates from from command after bad EVAL} {
-                    set repl [attach_to_replication_stream]
-
-                    catch { $master eval { return "hello" } -12 } e
-                    assert_equal $e {ERR Number of keys can't be negative}
-                    $master propagate-test.simple
-                    $master propagate-test.mixed
-
-                    # Note the 'after-call' propagation below is out of order (known limitation)
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                        {multi}
-                        {incr using-call}
-                        {incr after-call}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module propagates from from multi-exec} {
-                    set repl [attach_to_replication_stream]
-
-                    $master multi
-                    $master propagate-test.simple
-                    $master propagate-test.mixed
-                    $master exec
-                    wait_for_ofs_sync $master $replica
-
-                    # Note the 'after-call' propagation below is out of order (known limitation)
-                    assert_replication_stream $repl {
-                        {select *}
-                        {multi}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {incr using-call}
-                        {incr after-call}
-                        {incr counter-1}
-                        {incr counter-2}
-                        {exec}
-                    }
-                    close_replication_stream $repl
-                }
-
-                test {module RM_Call of expired key propagation} {
-                    $master debug set-active-expire 0
-
-                    $master set k1 900 px 100
-                    wait_for_ofs_sync $master $replica
-                    after 110
-
-                    set repl [attach_to_replication_stream]
-                    $master propagate-test.incr k1
-                    wait_for_ofs_sync $master $replica
-
-                    assert_replication_stream $repl {
-                        {select *}
-                        {del k1}
-                        {propagate-test.incr k1}
-                    }
-                    close_replication_stream $repl
-
-                    assert_equal [$master get k1] 1
-                    assert_equal [$master ttl k1] -1
-                    assert_equal [$replica get k1] 1
-                    assert_equal [$replica ttl k1] -1
-                }
-
-                assert_equal [s -1 unexpected_error_replies] 0
-            }
-        }
-    }
-}
-
-tags "modules aof" {
-    test {Modules RM_Replicate replicates MULTI/EXEC correctly} {
-        start_server [list overrides [list loadmodule "$testmodule"]] {
-            # Enable the AOF
-            r config set appendonly yes
-            r config set auto-aof-rewrite-percentage 0 ; # Disable auto-rewrite.
-            waitForBgrewriteaof r
-
-            r propagate-test.simple
-            r propagate-test.mixed
-            r multi
-            r propagate-test.simple
-            r propagate-test.mixed
-            r exec
-
-            # Load the AOF
-            r debug loadaof
-
-            assert_equal [s 0 unexpected_error_replies] 0
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/scan.tcl b/redis-stable/tests/unit/moduleapi/scan.tcl
deleted file mode 100644
index 43a0c4d8..00000000
--- a/redis-stable/tests/unit/moduleapi/scan.tcl
+++ /dev/null
@@ -1,52 +0,0 @@
-set testmodule [file normalize tests/modules/scan.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Module scan keyspace} {
-        # the module create a scan command with filtering which also return values
-        r set x 1
-        r set y 2
-        r set z 3
-        r hset h f v
-        lsort [r scan.scan_strings]
-    } {{x 1} {y 2} {z 3}}
-
-    test {Module scan hash ziplist} {
-        r hmset hh f1 v1 f2 v2
-        lsort [r scan.scan_key hh]
-    } {{f1 v1} {f2 v2}}
-    
-    test {Module scan hash dict with int value} {
-        r hmset hh1 f1 1 
-        lsort [r scan.scan_key hh1]
-    } {{f1 1}}
-
-    test {Module scan hash dict} {
-        r config set hash-max-ziplist-entries 2
-        r hmset hh f3 v3
-        lsort [r scan.scan_key hh]
-    } {{f1 v1} {f2 v2} {f3 v3}}
-
-    test {Module scan zset ziplist} {
-        r zadd zz 1 f1 2 f2
-        lsort [r scan.scan_key zz]
-    } {{f1 1} {f2 2}}
-
-    test {Module scan zset dict} {
-        r config set zset-max-ziplist-entries 2
-        r zadd zz 3 f3
-        lsort [r scan.scan_key zz]
-    } {{f1 1} {f2 2} {f3 3}}
-
-    test {Module scan set intset} {
-        r sadd ss 1 2
-        lsort [r scan.scan_key ss]
-    } {{1 {}} {2 {}}}
-
-    test {Module scan set dict} {
-        r config set set-max-intset-entries 2
-        r sadd ss 3
-        lsort [r scan.scan_key ss]
-    } {{1 {}} {2 {}} {3 {}}}
-}
diff --git a/redis-stable/tests/unit/moduleapi/stream.tcl b/redis-stable/tests/unit/moduleapi/stream.tcl
deleted file mode 100644
index 15e97c18..00000000
--- a/redis-stable/tests/unit/moduleapi/stream.tcl
+++ /dev/null
@@ -1,155 +0,0 @@
-set testmodule [file normalize tests/modules/stream.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Module stream add and delete} {
-        r del mystream
-        # add to empty key
-        set streamid1 [r stream.add mystream item 1 value a]
-        # add to existing stream
-        set streamid2 [r stream.add mystream item 2 value b]
-        # check result
-        assert { [string match "*-*" $streamid1] }
-        set items [r XRANGE mystream - +]
-        assert_equal $items \
-            "{$streamid1 {item 1 value a}} {$streamid2 {item 2 value b}}"
-        # delete one of them and try deleting non-existing ID
-        assert_equal OK [r stream.delete mystream $streamid1]
-        assert_error "ERR StreamDelete*" {r stream.delete mystream 123-456}
-        assert_error "Invalid stream ID*" {r stream.delete mystream foo}
-        assert_equal "{$streamid2 {item 2 value b}}" [r XRANGE mystream - +]
-        # check error condition: wrong type
-        r del mystream
-        r set mystream mystring
-        assert_error "ERR StreamAdd*" {r stream.add mystream item 1 value a}
-        assert_error "ERR StreamDelete*" {r stream.delete mystream 123-456}
-    }
-
-    test {Module stream add unblocks blocking xread} {
-        r del mystream
-
-        # Blocking XREAD on an empty key
-        set rd1 [redis_deferring_client]
-        $rd1 XREAD BLOCK 3000 STREAMS mystream $
-        # wait until client is actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Client is not blocked"
-        }
-        set id [r stream.add mystream field 1 value a]
-        assert_equal "{mystream {{$id {field 1 value a}}}}" [$rd1 read]
-
-        # Blocking XREAD on an existing stream
-        set rd2 [redis_deferring_client]
-        $rd2 XREAD BLOCK 3000 STREAMS mystream $
-        # wait until client is actually blocked
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Client is not blocked"
-        }
-        set id [r stream.add mystream field 2 value b]
-        assert_equal "{mystream {{$id {field 2 value b}}}}" [$rd2 read]
-    }
-
-    test {Module stream add benchmark (1M stream add)} {
-        set n 1000000
-        r del mystream
-        set result [r stream.addn mystream $n field value]
-        assert_equal $result $n
-    }
-
-    test {Module stream iterator} {
-        r del mystream
-        set streamid1 [r xadd mystream * item 1 value a]
-        set streamid2 [r xadd mystream * item 2 value b]
-        # range result
-        set result1 [r stream.range mystream "-" "+"]
-        set expect1 [r xrange mystream "-" "+"]
-        assert_equal $result1 $expect1
-        # reverse range
-        set result_rev [r stream.range mystream "+" "-"]
-        set expect_rev [r xrevrange mystream "+" "-"]
-        assert_equal $result_rev $expect_rev
-
-        # only one item: range with startid = endid
-        set result2 [r stream.range mystream "-" $streamid1]
-        assert_equal $result2 "{$streamid1 {item 1 value a}}"
-        assert_equal $result2 [list [list $streamid1 {item 1 value a}]]
-        # only one item: range with startid = endid
-        set result3 [r stream.range mystream $streamid2 $streamid2]
-        assert_equal $result3 "{$streamid2 {item 2 value b}}"
-        assert_equal $result3 [list [list $streamid2 {item 2 value b}]]
-    }
-
-    test {Module stream iterator delete} {
-        r del mystream
-        set id1 [r xadd mystream * normal item]
-        set id2 [r xadd mystream * selfdestruct yes]
-        set id3 [r xadd mystream * another item]
-        # stream.range deletes the "selfdestruct" item after returning it
-        assert_equal \
-            "{$id1 {normal item}} {$id2 {selfdestruct yes}} {$id3 {another item}}" \
-            [r stream.range mystream - +]
-        # now, the "selfdestruct" item is gone
-        assert_equal \
-            "{$id1 {normal item}} {$id3 {another item}}" \
-            [r stream.range mystream - +]
-    }
-
-    test {Module stream trim by length} {
-        r del mystream
-        # exact maxlen
-        r xadd mystream * item 1 value a
-        r xadd mystream * item 2 value b
-        r xadd mystream * item 3 value c
-        assert_equal 3 [r xlen mystream]
-        assert_equal 0 [r stream.trim mystream maxlen = 5]
-        assert_equal 3 [r xlen mystream]
-        assert_equal 2 [r stream.trim mystream maxlen = 1]
-        assert_equal 1 [r xlen mystream]
-        assert_equal 1 [r stream.trim mystream maxlen = 0]
-        # check that there is no limit for exact maxlen
-        r stream.addn mystream 20000 item x value y
-        assert_equal 20000 [r stream.trim mystream maxlen = 0]
-        # approx maxlen (100 items per node implies default limit 10K items)
-        r stream.addn mystream 20000 item x value y
-        assert_equal 20000 [r xlen mystream]
-        assert_equal 10000 [r stream.trim mystream maxlen ~ 2]
-        assert_equal 9900  [r stream.trim mystream maxlen ~ 2]
-        assert_equal 0     [r stream.trim mystream maxlen ~ 2]
-        assert_equal 100   [r xlen mystream]
-        assert_equal 100   [r stream.trim mystream maxlen ~ 0]
-        assert_equal 0     [r xlen mystream]
-    }
-
-    test {Module stream trim by ID} {
-        r del mystream
-        # exact minid
-        r xadd mystream * item 1 value a
-        r xadd mystream * item 2 value b
-        set minid [r xadd mystream * item 3 value c]
-        assert_equal 3 [r xlen mystream]
-        assert_equal 0 [r stream.trim mystream minid = -]
-        assert_equal 3 [r xlen mystream]
-        assert_equal 2 [r stream.trim mystream minid = $minid]
-        assert_equal 1 [r xlen mystream]
-        assert_equal 1 [r stream.trim mystream minid = +]
-        # check that there is no limit for exact minid
-        r stream.addn mystream 20000 item x value y
-        assert_equal 20000 [r stream.trim mystream minid = +]
-        # approx minid (100 items per node implies default limit 10K items)
-        r stream.addn mystream 19980 item x value y
-        set minid [r xadd mystream * item x value y]
-        r stream.addn mystream 19 item x value y
-        assert_equal 20000 [r xlen mystream]
-        assert_equal 10000 [r stream.trim mystream minid ~ $minid]
-        assert_equal 9900  [r stream.trim mystream minid ~ $minid]
-        assert_equal 0     [r stream.trim mystream minid ~ $minid]
-        assert_equal 100   [r xlen mystream]
-        assert_equal 100   [r stream.trim mystream minid ~ +]
-        assert_equal 0     [r xlen mystream]
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl b/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
deleted file mode 100644
index 9f482769..00000000
--- a/redis-stable/tests/unit/moduleapi/test_lazyfree.tcl
+++ /dev/null
@@ -1,32 +0,0 @@
-set testmodule [file normalize tests/modules/test_lazyfree.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test "modules allocated memory can be reclaimed in the background" {
-        set orig_mem [s used_memory]
-        set rd [redis_deferring_client]
-
-        # LAZYFREE_THRESHOLD is 64
-        for {set i 0} {$i < 10000} {incr i} {
-            $rd lazyfreelink.insert lazykey $i
-        }
-
-        for {set j 0} {$j < 10000} {incr j} {
-            $rd read 
-        }
-
-        assert {[r lazyfreelink.len lazykey] == 10000}
-
-        set peak_mem [s used_memory]
-        assert {[r unlink lazykey] == 1}
-        assert {$peak_mem > $orig_mem+10000}
-        wait_for_condition 50 100 {
-            [s used_memory] < $peak_mem &&
-            [s used_memory] < $orig_mem*2 &&
-            [string match {*lazyfreed_objects:1*} [r info Memory]]
-        } else {
-            fail "Module memory is not reclaimed by UNLINK"
-        }
-    }
-}
\ No newline at end of file
diff --git a/redis-stable/tests/unit/moduleapi/testrdb.tcl b/redis-stable/tests/unit/moduleapi/testrdb.tcl
deleted file mode 100644
index 5ba10228..00000000
--- a/redis-stable/tests/unit/moduleapi/testrdb.tcl
+++ /dev/null
@@ -1,132 +0,0 @@
-set testmodule [file normalize tests/modules/testrdb.so]
-
-tags "modules" {
-    test {modules are able to persist types} {
-        start_server [list overrides [list loadmodule "$testmodule"]] {
-            r testrdb.set.key key1 value1
-            assert_equal "value1" [r testrdb.get.key key1]
-            r debug reload
-            assert_equal "value1" [r testrdb.get.key key1]
-        }
-    }
-
-    test {modules global are lost without aux} {
-        set server_path [tmpdir "server.module-testrdb"]
-        start_server [list overrides [list loadmodule "$testmodule" "dir" $server_path] keep_persistence true] {
-            r testrdb.set.before global1
-            assert_equal "global1" [r testrdb.get.before]
-        }
-        start_server [list overrides [list loadmodule "$testmodule" "dir" $server_path]] {
-            assert_equal "" [r testrdb.get.before]
-        }
-    }
-
-    test {modules are able to persist globals before and after} {
-        set server_path [tmpdir "server.module-testrdb"]
-        start_server [list overrides [list loadmodule "$testmodule 2" "dir" $server_path] keep_persistence true] {
-            r testrdb.set.before global1
-            r testrdb.set.after global2
-            assert_equal "global1" [r testrdb.get.before]
-            assert_equal "global2" [r testrdb.get.after]
-        }
-        start_server [list overrides [list loadmodule "$testmodule 2" "dir" $server_path]] {
-            assert_equal "global1" [r testrdb.get.before]
-            assert_equal "global2" [r testrdb.get.after]
-        }
-
-    }
-
-    test {modules are able to persist globals just after} {
-        set server_path [tmpdir "server.module-testrdb"]
-        start_server [list overrides [list loadmodule "$testmodule 1" "dir" $server_path] keep_persistence true] {
-            r testrdb.set.after global2
-            assert_equal "global2" [r testrdb.get.after]
-        }
-        start_server [list overrides [list loadmodule "$testmodule 1" "dir" $server_path]] {
-            assert_equal "global2" [r testrdb.get.after]
-        }
-    }
-
-    tags {repl} {
-        test {diskless loading short read with module} {
-            start_server [list overrides [list loadmodule "$testmodule"]] {
-                set replica [srv 0 client]
-                set replica_host [srv 0 host]
-                set replica_port [srv 0 port]
-                start_server [list overrides [list loadmodule "$testmodule"]] {
-                    set master [srv 0 client]
-                    set master_host [srv 0 host]
-                    set master_port [srv 0 port]
-
-                    # Set master and replica to use diskless replication
-                    $master config set repl-diskless-sync yes
-                    $master config set rdbcompression no
-                    $replica config set repl-diskless-load swapdb
-                    $master config set hz 500
-                    $replica config set hz 500
-                    $master config set dynamic-hz no
-                    $replica config set dynamic-hz no
-                    set start [clock clicks -milliseconds]
-                    for {set k 0} {$k < 30} {incr k} {
-                        r testrdb.set.key key$k [string repeat A [expr {int(rand()*1000000)}]]
-                    }
-
-                    if {$::verbose} {
-                        set end [clock clicks -milliseconds]
-                        set duration [expr $end - $start]
-                        puts "filling took $duration ms (TODO: use pipeline)"
-                        set start [clock clicks -milliseconds]
-                    }
-
-                    # Start the replication process...
-                    set loglines [count_log_lines -1]
-                    $master config set repl-diskless-sync-delay 0
-                    $replica replicaof $master_host $master_port
-
-                    # kill the replication at various points
-                    set attempts 100
-                    if {$::accurate} { set attempts 500 }
-                    for {set i 0} {$i < $attempts} {incr i} {
-                        # wait for the replica to start reading the rdb
-                        # using the log file since the replica only responds to INFO once in 2mb
-                        set res [wait_for_log_messages -1 {"*Loading DB in memory*"} $loglines 2000 1]
-                        set loglines [lindex $res 1]
-
-                        # add some additional random sleep so that we kill the master on a different place each time
-                        after [expr {int(rand()*50)}]
-
-                        # kill the replica connection on the master
-                        set killed [$master client kill type replica]
-
-                        set res [wait_for_log_messages -1 {"*Internal error in RDB*" "*Finished with success*" "*Successful partial resynchronization*"} $loglines 1000 1]
-                        if {$::verbose} { puts $res }
-                        set log_text [lindex $res 0]
-                        set loglines [lindex $res 1]
-                        if {![string match "*Internal error in RDB*" $log_text]} {
-                            # force the replica to try another full sync
-                            $master multi
-                            $master client kill type replica
-                            $master set asdf asdf
-                            # the side effect of resizing the backlog is that it is flushed (16k is the min size)
-                            $master config set repl-backlog-size [expr {16384 + $i}]
-                            $master exec
-                        }
-                        # wait for loading to stop (fail)
-                        wait_for_condition 1000 1 {
-                            [s -1 loading] eq 0
-                        } else {
-                            fail "Replica didn't disconnect"
-                        }
-                    }
-                    if {$::verbose} {
-                        set end [clock clicks -milliseconds]
-                        set duration [expr $end - $start]
-                        puts "test took $duration ms"
-                    }
-                    # enable fast shutdown
-                    $master config set rdb-key-save-delay 0
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/moduleapi/timer.tcl b/redis-stable/tests/unit/moduleapi/timer.tcl
deleted file mode 100644
index 10a90227..00000000
--- a/redis-stable/tests/unit/moduleapi/timer.tcl
+++ /dev/null
@@ -1,57 +0,0 @@
-set testmodule [file normalize tests/modules/timer.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {RM_CreateTimer: a sequence of timers work} {
-        # We can't guarantee same-ms but we try using MULTI/EXEC
-        r multi
-        for {set i 0} {$i < 20} {incr i} {
-            r test.createtimer 10 timer-incr-key
-        }
-        r exec
-
-        after 500
-        assert_equal 20 [r get timer-incr-key]
-    }
-
-    test {RM_GetTimer: basic sanity} {
-        # Getting non-existing timer
-        assert_equal {} [r test.gettimer 0]
-
-        # Getting a real timer
-        set id [r test.createtimer 10000 timer-incr-key]
-        set info [r test.gettimer $id]
-
-        assert_equal "timer-incr-key" [lindex $info 0]
-        set remaining [lindex $info 1]
-        assert {$remaining < 10000 && $remaining > 1}
-    }
-
-    test {RM_StopTimer: basic sanity} {
-        r set "timer-incr-key" 0
-        set id [r test.createtimer 1000 timer-incr-key]
-
-        assert_equal 1 [r test.stoptimer $id]
-
-        # Wait to be sure timer doesn't execute
-        after 2000
-        assert_equal 0 [r get timer-incr-key]
-
-        # Stop non-existing timer
-        assert_equal 0 [r test.stoptimer $id]
-    }
-
-    test {Timer appears non-existing after it fires} {
-        r set "timer-incr-key" 0
-        set id [r test.createtimer 10 timer-incr-key]
-
-        # verify timer fired
-        after 500
-        assert_equal 1 [r get timer-incr-key]
-
-        # verify id does not exist
-        assert_equal {} [r test.gettimer $id]
-    }
-}
-
diff --git a/redis-stable/tests/unit/moduleapi/zset.tcl b/redis-stable/tests/unit/moduleapi/zset.tcl
deleted file mode 100644
index 998d2076..00000000
--- a/redis-stable/tests/unit/moduleapi/zset.tcl
+++ /dev/null
@@ -1,16 +0,0 @@
-set testmodule [file normalize tests/modules/zset.so]
-
-start_server {tags {"modules"}} {
-    r module load $testmodule
-
-    test {Module zset rem} {
-        r del k
-        r zadd k 100 hello 200 world
-        assert_equal 1 [r zset.rem k hello]
-        assert_equal 0 [r zset.rem k hello]
-        assert_equal 1 [r exists k]
-        # Check that removing the last element deletes the key
-        assert_equal 1 [r zset.rem k world]
-        assert_equal 0 [r exists k]
-    }
-}
diff --git a/redis-stable/tests/unit/multi.tcl b/redis-stable/tests/unit/multi.tcl
deleted file mode 100644
index d33f9451..00000000
--- a/redis-stable/tests/unit/multi.tcl
+++ /dev/null
@@ -1,646 +0,0 @@
-start_server {tags {"multi"}} {
-    test {MUTLI / EXEC basics} {
-        r del mylist
-        r rpush mylist a
-        r rpush mylist b
-        r rpush mylist c
-        r multi
-        set v1 [r lrange mylist 0 -1]
-        set v2 [r ping]
-        set v3 [r exec]
-        list $v1 $v2 $v3
-    } {QUEUED QUEUED {{a b c} PONG}}
-
-    test {DISCARD} {
-        r del mylist
-        r rpush mylist a
-        r rpush mylist b
-        r rpush mylist c
-        r multi
-        set v1 [r del mylist]
-        set v2 [r discard]
-        set v3 [r lrange mylist 0 -1]
-        list $v1 $v2 $v3
-    } {QUEUED OK {a b c}}
-
-    test {Nested MULTI are not allowed} {
-        set err {}
-        r multi
-        catch {[r multi]} err
-        r exec
-        set _ $err
-    } {*ERR MULTI*}
-
-    test {MULTI where commands alter argc/argv} {
-        r sadd myset a
-        r multi
-        r spop myset
-        list [r exec] [r exists myset]
-    } {a 0}
-
-    test {WATCH inside MULTI is not allowed} {
-        set err {}
-        r multi
-        catch {[r watch x]} err
-        r exec
-        set _ $err
-    } {*ERR WATCH*}
-
-    test {EXEC fails if there are errors while queueing commands #1} {
-        r del foo1 foo2
-        r multi
-        r set foo1 bar1
-        catch {r non-existing-command}
-        r set foo2 bar2
-        catch {r exec} e
-        assert_match {EXECABORT*} $e
-        list [r exists foo1] [r exists foo2]
-    } {0 0}
-
-    test {EXEC fails if there are errors while queueing commands #2} {
-        set rd [redis_deferring_client]
-        r del foo1 foo2
-        r multi
-        r set foo1 bar1
-        $rd config set maxmemory 1
-        assert  {[$rd read] eq {OK}}
-        catch {r lpush mylist myvalue}
-        $rd config set maxmemory 0
-        assert  {[$rd read] eq {OK}}
-        r set foo2 bar2
-        catch {r exec} e
-        assert_match {EXECABORT*} $e
-        $rd close
-        list [r exists foo1] [r exists foo2]
-    } {0 0}
-
-    test {If EXEC aborts, the client MULTI state is cleared} {
-        r del foo1 foo2
-        r multi
-        r set foo1 bar1
-        catch {r non-existing-command}
-        r set foo2 bar2
-        catch {r exec} e
-        assert_match {EXECABORT*} $e
-        r ping
-    } {PONG}
-
-    test {EXEC works on WATCHed key not modified} {
-        r watch x y z
-        r watch k
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {EXEC fail on WATCHed key modified (1 key of 1 watched)} {
-        r set x 30
-        r watch x
-        r set x 40
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {EXEC fail on WATCHed key modified (1 key of 5 watched)} {
-        r set x 30
-        r watch a b x k z
-        r set x 40
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {EXEC fail on WATCHed key modified by SORT with STORE even if the result is empty} {
-        r flushdb
-        r lpush foo bar
-        r watch foo
-        r sort emptylist store foo
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {EXEC fail on lazy expired WATCHed key} {
-        r flushall
-        r debug set-active-expire 0
-
-        r del key
-        r set key 1 px 2
-        r watch key
-
-        after 100
-
-        r multi
-        r incr key
-        assert_equal [r exec] {}
-        r debug set-active-expire 1
-    } {OK} {needs:debug}
-
-    test {After successful EXEC key is no longer watched} {
-        r set x 30
-        r watch x
-        r multi
-        r ping
-        r exec
-        r set x 40
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {After failed EXEC key is no longer watched} {
-        r set x 30
-        r watch x
-        r set x 40
-        r multi
-        r ping
-        r exec
-        r set x 40
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {It is possible to UNWATCH} {
-        r set x 30
-        r watch x
-        r set x 40
-        r unwatch
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {UNWATCH when there is nothing watched works as expected} {
-        r unwatch
-    } {OK}
-
-    test {FLUSHALL is able to touch the watched keys} {
-        r set x 30
-        r watch x
-        r flushall
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {FLUSHALL does not touch non affected keys} {
-        r del x
-        r watch x
-        r flushall
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {FLUSHDB is able to touch the watched keys} {
-        r set x 30
-        r watch x
-        r flushdb
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {FLUSHDB does not touch non affected keys} {
-        r del x
-        r watch x
-        r flushdb
-        r multi
-        r ping
-        r exec
-    } {PONG}
-
-    test {SWAPDB is able to touch the watched keys that exist} {
-        r flushall
-        r select 0
-        r set x 30
-        r watch x ;# make sure x (set to 30) doesn't change (SWAPDB will "delete" it)
-        r swapdb 0 1
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {SWAPDB is able to touch the watched keys that do not exist} {
-        r flushall
-        r select 1
-        r set x 30
-        r select 0
-        r watch x ;# make sure the key x (currently missing) doesn't change (SWAPDB will create it)
-        r swapdb 0 1
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {WATCH is able to remember the DB a key belongs to} {
-        r select 5
-        r set x 30
-        r watch x
-        r select 1
-        r set x 10
-        r select 5
-        r multi
-        r ping
-        set res [r exec]
-        # Restore original DB
-        r select 9
-        set res
-    } {PONG}
-
-    test {WATCH will consider touched keys target of EXPIRE} {
-        r del x
-        r set x foo
-        r watch x
-        r expire x 10
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {WATCH will consider touched expired keys} {
-        r del x
-        r set x foo
-        r expire x 1
-        r watch x
-        after 1100
-        r multi
-        r ping
-        r exec
-    } {}
-
-    test {DISCARD should clear the WATCH dirty flag on the client} {
-        r watch x
-        r set x 10
-        r multi
-        r discard
-        r multi
-        r incr x
-        r exec
-    } {11}
-
-    test {DISCARD should UNWATCH all the keys} {
-        r watch x
-        r set x 10
-        r multi
-        r discard
-        r set x 10
-        r multi
-        r incr x
-        r exec
-    } {11}
-
-    test {MULTI / EXEC is propagated correctly (single write command)} {
-        set repl [attach_to_replication_stream]
-        r multi
-        r set foo bar
-        r exec
-        assert_replication_stream $repl {
-            {select *}
-            {multi}
-            {set foo bar}
-            {exec}
-        }
-        close_replication_stream $repl
-    }
-
-    test {MULTI / EXEC is propagated correctly (empty transaction)} {
-        set repl [attach_to_replication_stream]
-        r multi
-        r exec
-        r set foo bar
-        assert_replication_stream $repl {
-            {select *}
-            {set foo bar}
-        }
-        close_replication_stream $repl
-    }
-
-    test {MULTI / EXEC is propagated correctly (read-only commands)} {
-        r set foo value1
-        set repl [attach_to_replication_stream]
-        r multi
-        r get foo
-        r exec
-        r set foo value2
-        assert_replication_stream $repl {
-            {select *}
-            {set foo value2}
-        }
-        close_replication_stream $repl
-    }
-
-    test {MULTI / EXEC is propagated correctly (write command, no effect)} {
-        r del bar foo bar
-        set repl [attach_to_replication_stream]
-        r multi
-        r del foo
-        r exec
-
-        # add another command so that when we see it we know multi-exec wasn't
-        # propagated
-        r incr foo
-
-        assert_replication_stream $repl {
-            {select *}
-            {incr foo}
-        }
-        close_replication_stream $repl
-    }
-
-    test {DISCARD should not fail during OOM} {
-        set rd [redis_deferring_client]
-        $rd config set maxmemory 1
-        assert  {[$rd read] eq {OK}}
-        r multi
-        catch {r set x 1} e
-        assert_match {OOM*} $e
-        r discard
-        $rd config set maxmemory 0
-        assert  {[$rd read] eq {OK}}
-        $rd close
-        r ping
-    } {PONG}
-
-    test {MULTI and script timeout} {
-        # check that if MULTI arrives during timeout, it is either refused, or
-        # allowed to pass, and we don't end up executing half of the transaction
-        set rd1 [redis_deferring_client]
-        set r2 [redis_client]
-        r config set lua-time-limit 10
-        r set xx 1
-        $rd1 eval {while true do end} 0
-        after 200
-        catch { $r2 multi; } e
-        catch { $r2 incr xx; } e
-        r script kill
-        after 200 ; # Give some time to Lua to call the hook again...
-        catch { $r2 incr xx; } e
-        catch { $r2 exec; } e
-        assert_match {EXECABORT*previous errors*} $e
-        set xx [r get xx]
-        # make sure that either the whole transcation passed or none of it (we actually expect none)
-        assert { $xx == 1 || $xx == 3}
-        # check that the connection is no longer in multi state
-        set pong [$r2 ping asdf]
-        assert_equal $pong "asdf"
-        $rd1 close; $r2 close
-    }
-
-    test {EXEC and script timeout} {
-        # check that if EXEC arrives during timeout, we don't end up executing
-        # half of the transaction, and also that we exit the multi state
-        set rd1 [redis_deferring_client]
-        set r2 [redis_client]
-        r config set lua-time-limit 10
-        r set xx 1
-        catch { $r2 multi; } e
-        catch { $r2 incr xx; } e
-        $rd1 eval {while true do end} 0
-        after 200
-        catch { $r2 incr xx; } e
-        catch { $r2 exec; } e
-        assert_match {EXECABORT*BUSY*} $e
-        r script kill
-        after 200 ; # Give some time to Lua to call the hook again...
-        set xx [r get xx]
-        # make sure that either the whole transcation passed or none of it (we actually expect none)
-        assert { $xx == 1 || $xx == 3}
-        # check that the connection is no longer in multi state
-        set pong [$r2 ping asdf]
-        assert_equal $pong "asdf"
-        $rd1 close; $r2 close
-    }
-
-    test {MULTI-EXEC body and script timeout} {
-        # check that we don't run an imcomplete transaction due to some commands
-        # arriving during busy script
-        set rd1 [redis_deferring_client]
-        set r2 [redis_client]
-        r config set lua-time-limit 10
-        r set xx 1
-        catch { $r2 multi; } e
-        catch { $r2 incr xx; } e
-        $rd1 eval {while true do end} 0
-        after 200
-        catch { $r2 incr xx; } e
-        r script kill
-        after 200 ; # Give some time to Lua to call the hook again...
-        catch { $r2 exec; } e
-        assert_match {EXECABORT*previous errors*} $e
-        set xx [r get xx]
-        # make sure that either the whole transcation passed or none of it (we actually expect none)
-        assert { $xx == 1 || $xx == 3}
-        # check that the connection is no longer in multi state
-        set pong [$r2 ping asdf]
-        assert_equal $pong "asdf"
-        $rd1 close; $r2 close
-    }
-
-    test {just EXEC and script timeout} {
-        # check that if EXEC arrives during timeout, we don't end up executing
-        # actual commands during busy script, and also that we exit the multi state
-        set rd1 [redis_deferring_client]
-        set r2 [redis_client]
-        r config set lua-time-limit 10
-        r set xx 1
-        catch { $r2 multi; } e
-        catch { $r2 incr xx; } e
-        $rd1 eval {while true do end} 0
-        after 200
-        catch { $r2 exec; } e
-        assert_match {EXECABORT*BUSY*} $e
-        r script kill
-        after 200 ; # Give some time to Lua to call the hook again...
-        set xx [r get xx]
-        # make we didn't execute the transaction
-        assert { $xx == 1}
-        # check that the connection is no longer in multi state
-        set pong [$r2 ping asdf]
-        assert_equal $pong "asdf"
-        $rd1 close; $r2 close
-    }
-
-    test {exec with write commands and state change} {
-        # check that exec that contains write commands fails if server state changed since they were queued
-        set r1 [redis_client]
-        r set xx 1
-        r multi
-        r incr xx
-        $r1 config set min-replicas-to-write 2
-        catch {r exec} e
-        assert_match {*EXECABORT*NOREPLICAS*} $e
-        set xx [r get xx]
-        # make sure that the INCR wasn't executed
-        assert { $xx == 1}
-        $r1 config set min-replicas-to-write 0
-        $r1 close;
-    }
-
-    test {exec with read commands and stale replica state change} {
-        # check that exec that contains read commands fails if server state changed since they were queued
-        r config set replica-serve-stale-data no
-        set r1 [redis_client]
-        r set xx 1
-
-        # check that GET is disallowed on stale replica, even if the replica becomes stale only after queuing.
-        r multi
-        r get xx
-        $r1 replicaof localhsot 0
-        catch {r exec} e
-        assert_match {*EXECABORT*MASTERDOWN*} $e
-
-        # check that PING is allowed
-        r multi
-        r ping
-        $r1 replicaof localhsot 0
-        set pong [r exec]
-        assert {$pong == "PONG"}
-
-        # check that when replica is not stale, GET is allowed
-        # while we're at it, let's check that multi is allowed on stale replica too
-        r multi
-        $r1 replicaof no one
-        r get xx
-        set xx [r exec]
-        # make sure that the INCR was executed
-        assert { $xx == 1 }
-        $r1 close;
-    }
-
-    test {EXEC with only read commands should not be rejected when OOM} {
-        set r2 [redis_client]
-
-        r set x value
-        r multi
-        r get x
-        r ping
-
-        # enforcing OOM
-        $r2 config set maxmemory 1
-
-        # finish the multi transaction with exec
-        assert { [r exec] == {value PONG} }
-
-        # releasing OOM
-        $r2 config set maxmemory 0
-        $r2 close
-    }
-
-    test {EXEC with at least one use-memory command should fail} {
-        set r2 [redis_client]
-
-        r multi
-        r set x 1
-        r get x
-
-        # enforcing OOM
-        $r2 config set maxmemory 1
-
-        # finish the multi transaction with exec
-        catch {r exec} e
-        assert_match {EXECABORT*OOM*} $e
-
-        # releasing OOM
-        $r2 config set maxmemory 0
-        $r2 close
-    }
-
-    test {Blocking commands ignores the timeout} {
-        r xgroup create s g $ MKSTREAM
-
-        set m [r multi]
-        r blpop empty_list 0
-        r brpop empty_list 0
-        r brpoplpush empty_list1 empty_list2 0
-        r blmove empty_list1 empty_list2 LEFT LEFT 0
-        r bzpopmin empty_zset 0
-        r bzpopmax empty_zset 0
-        r xread BLOCK 0 STREAMS s $
-        r xreadgroup group g c BLOCK 0 STREAMS s >
-        set res [r exec]
-
-        list $m $res
-    } {OK {{} {} {} {} {} {} {} {}}}
-
-    test {MULTI propagation of PUBLISH} {
-        set repl [attach_to_replication_stream]
-
-        # make sure that PUBLISH inside MULTI is propagated in a transaction
-        r multi
-        r publish bla bla
-        r exec
-
-        assert_replication_stream $repl {
-            {select *}
-            {multi}
-            {publish bla bla}
-            {exec}
-        }
-        close_replication_stream $repl
-    }
-
-    test {MULTI propagation of SCRIPT LOAD} {
-        set repl [attach_to_replication_stream]
-
-        # make sure that SCRIPT LOAD inside MULTI is propagated in a transaction
-        r multi
-        r script load {redis.call('set', KEYS[1], 'foo')}
-        set res [r exec]
-        set sha [lindex $res 0]
-
-        assert_replication_stream $repl {
-            {select *}
-            {multi}
-            {script load *}
-            {exec}
-        }
-        close_replication_stream $repl
-    }
-
-    test {MULTI propagation of SCRIPT LOAD} {
-        set repl [attach_to_replication_stream]
-
-        # make sure that EVAL inside MULTI is propagated in a transaction
-        r config set lua-replicate-commands no
-        r multi
-        r eval {redis.call('set', KEYS[1], 'bar')} 1 bar
-        r exec
-
-        assert_replication_stream $repl {
-            {select *}
-            {multi}
-            {eval *}
-            {exec}
-        }
-        close_replication_stream $repl
-    }
-
-    tags {"stream"} {
-        test {MULTI propagation of XREADGROUP} {
-            # stream is a special case because it calls propagate() directly for XREADGROUP
-            set repl [attach_to_replication_stream]
-
-            r XADD mystream * foo bar
-            r XGROUP CREATE mystream mygroup 0
-
-            # make sure the XCALIM (propagated by XREADGROUP) is indeed inside MULTI/EXEC
-            r multi
-            r XREADGROUP GROUP mygroup consumer1 STREAMS mystream ">"
-            r exec
-
-            assert_replication_stream $repl {
-                {select *}
-                {xadd *}
-                {xgroup CREATE *}
-                {multi}
-                {xclaim *}
-                {exec}
-            }
-            close_replication_stream $repl
-        }
-    }
-
-}
diff --git a/redis-stable/tests/unit/networking.tcl b/redis-stable/tests/unit/networking.tcl
deleted file mode 100644
index 38b49d45..00000000
--- a/redis-stable/tests/unit/networking.tcl
+++ /dev/null
@@ -1,36 +0,0 @@
-test {CONFIG SET port number} {
-    start_server {} {
-        if {$::tls} { set port_cfg tls-port} else { set port_cfg port }
-
-        # available port
-        set avail_port [find_available_port $::baseport $::portcount]
-        set rd [redis [srv 0 host] [srv 0 port] 0 $::tls]
-        $rd CONFIG SET $port_cfg $avail_port
-        $rd close
-        set rd [redis [srv 0 host] $avail_port 0 $::tls]
-        $rd PING
-
-        # already inuse port
-        catch {$rd CONFIG SET $port_cfg $::test_server_port} e
-        assert_match {*Unable to listen on this port*} $e
-        $rd close
-
-        # make sure server still listening on the previous port
-        set rd [redis [srv 0 host] $avail_port 0 $::tls]
-        $rd PING
-        $rd close
-    }
-}
-
-test {CONFIG SET bind address} {
-    start_server {} {
-        # non-valid address
-        catch {r CONFIG SET bind "999.999.999.999"} e
-        assert_match {*Failed to bind to specified addresses*} $e
-
-        # make sure server still bound to the previous address
-        set rd [redis [srv 0 host] [srv 0 port] 0 $::tls]
-        $rd PING
-        $rd close
-    }
-}
diff --git a/redis-stable/tests/unit/obuf-limits.tcl b/redis-stable/tests/unit/obuf-limits.tcl
deleted file mode 100644
index 3f26c53f..00000000
--- a/redis-stable/tests/unit/obuf-limits.tcl
+++ /dev/null
@@ -1,186 +0,0 @@
-start_server {tags {"obuf-limits"}} {
-    test {Client output buffer hard limit is enforced} {
-        r config set client-output-buffer-limit {pubsub 100000 0 0}
-        set rd1 [redis_deferring_client]
-
-        $rd1 subscribe foo
-        set reply [$rd1 read]
-        assert {$reply eq "subscribe foo 1"}
-
-        set omem 0
-        while 1 {
-            r publish foo bar
-            set clients [split [r client list] "\r\n"]
-            set c [split [lindex $clients 1] " "]
-            if {![regexp {omem=([0-9]+)} $c - omem]} break
-            if {$omem > 200000} break
-        }
-        assert {$omem >= 70000 && $omem < 200000}
-        $rd1 close
-    }
-    
-    foreach {soft_limit_time wait_for_timeout} {3 yes
-                                                4 no } {
-        if $wait_for_timeout {
-            set test_name "Client output buffer soft limit is enforced if time is overreached"
-        } else {
-            set test_name "Client output buffer soft limit is not enforced too early and is enforced when no traffic"
-        }
-
-        test $test_name {
-            r config set client-output-buffer-limit "pubsub 0 100000 $soft_limit_time"
-            set soft_limit_time [expr $soft_limit_time*1000]
-            set rd1 [redis_deferring_client]
-
-            $rd1 client setname test_client
-            set reply [$rd1 read]
-            assert {$reply eq "OK"}
-
-            $rd1 subscribe foo
-            set reply [$rd1 read]
-            assert {$reply eq "subscribe foo 1"}
-
-            set omem 0
-            set start_time 0
-            set time_elapsed 0
-            set last_under_limit_time [clock milliseconds]
-            while 1 {
-                r publish foo [string repeat "x" 1000]
-                set clients [split [r client list] "\r\n"]
-                set c [lsearch -inline $clients *name=test_client*]
-                if {$start_time != 0} {
-                    set time_elapsed [expr {[clock milliseconds]-$start_time}]
-                    # Make sure test isn't taking too long
-                    assert {$time_elapsed <= [expr $soft_limit_time+3000]}
-                }
-                if {$wait_for_timeout && $c == ""} {
-                    # Make sure we're disconnected when we reach the soft limit
-                    assert {$omem >= 100000 && $time_elapsed >= $soft_limit_time}
-                    break
-                } else {
-                    assert {[regexp {omem=([0-9]+)} $c - omem]}
-                }
-                if {$omem > 100000} {
-                    if {$start_time == 0} {set start_time $last_under_limit_time}
-                    if {!$wait_for_timeout && $time_elapsed >= [expr $soft_limit_time-1000]} break
-                    # Slow down loop when omem has reached the limit.
-                    after 10
-                } else {
-                    # if the OS socket buffers swallowed what we previously filled, reset the start timer.
-                    set start_time 0
-                    set last_under_limit_time [clock milliseconds]
-                }
-            }
-
-            if {!$wait_for_timeout} {
-                # After we completely stopped the traffic, wait for soft limit to time out
-                set timeout [expr {$soft_limit_time+1500 - ([clock milliseconds]-$start_time)}]
-                wait_for_condition [expr $timeout/10] 10 {
-                    [lsearch [split [r client list] "\r\n"] *name=test_client*] == -1
-                } else {
-                    fail "Soft limit timed out but client still connected"
-                }
-            }
-
-            $rd1 close
-        }
-    }
-
-    test {No response for single command if client output buffer hard limit is enforced} {
-        r config set client-output-buffer-limit {normal 100000 0 0}
-        # Total size of all items must be more than 100k
-        set item [string repeat "x" 1000]
-        for {set i 0} {$i < 150} {incr i} {
-            r lpush mylist $item
-        }
-        set orig_mem [s used_memory]
-        # Set client name and get all items
-        set rd [redis_deferring_client]
-        $rd client setname mybiglist
-        assert {[$rd read] eq "OK"}
-        $rd lrange mylist 0 -1
-        $rd flush
-        after 100
-
-        # Before we read reply, redis will close this client.
-        set clients [r client list]
-        assert_no_match "*name=mybiglist*" $clients
-        set cur_mem [s used_memory]
-        # 10k just is a deviation threshold
-        assert {$cur_mem < 10000 + $orig_mem}
-
-        # Read nothing
-        set fd [$rd channel]
-        assert_equal {} [read $fd]
-    }
-
-    # Note: This test assumes that what's written with one write, will be read by redis in one read.
-    # this assumption is wrong, but seem to work empirically (for now)
-    test {No response for multi commands in pipeline if client output buffer limit is enforced} {
-        r config set client-output-buffer-limit {normal 100000 0 0}
-        set value [string repeat "x" 10000]
-        r set bigkey $value
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-        $rd2 client setname multicommands
-        assert_equal "OK" [$rd2 read]
-
-        # Let redis sleep 1s firstly
-        $rd1 debug sleep 1
-        $rd1 flush
-        after 100
-
-        # Create a pipeline of commands that will be processed in one socket read.
-        # It is important to use one write, in TLS mode independant writes seem
-        # to wait for response from the server.
-        # Total size should be less than OS socket buffer, redis can
-        # execute all commands in this pipeline when it wakes up.
-        set buf ""
-        for {set i 0} {$i < 15} {incr i} {
-            append buf "set $i $i\r\n"
-            append buf "get $i\r\n"
-            append buf "del $i\r\n"
-            # One bigkey is 10k, total response size must be more than 100k
-            append buf "get bigkey\r\n"
-        }
-        $rd2 write $buf
-        $rd2 flush
-        after 100
-
-        # Reds must wake up if it can send reply
-        assert_equal "PONG" [r ping]
-        set clients [r client list]
-        assert_no_match "*name=multicommands*" $clients
-        set fd [$rd2 channel]
-        assert_equal {} [read $fd]
-    }
-
-    test {Execute transactions completely even if client output buffer limit is enforced} {
-        r config set client-output-buffer-limit {normal 100000 0 0}
-        # Total size of all items must be more than 100k
-        set item [string repeat "x" 1000]
-        for {set i 0} {$i < 150} {incr i} {
-            r lpush mylist2 $item
-        }
-
-        # Output buffer limit is enforced during executing transaction
-        r client setname transactionclient
-        r set k1 v1
-        r multi
-        r set k2 v2
-        r get k2
-        r lrange mylist2 0 -1
-        r set k3 v3
-        r del k1
-        catch {[r exec]} e
-        assert_match "*I/O error*" $e
-        reconnect
-        set clients [r client list]
-        assert_no_match "*name=transactionclient*" $clients
-
-        # Transactions should be executed completely
-        assert_equal {} [r get k1]
-        assert_equal "v2" [r get k2]
-        assert_equal "v3" [r get k3]
-    }
-}
diff --git a/redis-stable/tests/unit/oom-score-adj.tcl b/redis-stable/tests/unit/oom-score-adj.tcl
deleted file mode 100644
index 892b1a7a..00000000
--- a/redis-stable/tests/unit/oom-score-adj.tcl
+++ /dev/null
@@ -1,77 +0,0 @@
-set system_name [string tolower [exec uname -s]]
-set user_id [exec id -u]
-
-if {$system_name eq {linux}} {
-    start_server {tags {"oom-score-adj"}} {
-        proc get_oom_score_adj {{pid ""}} {
-            if {$pid == ""} {
-                set pid [srv 0 pid]
-            }
-            set fd [open "/proc/$pid/oom_score_adj" "r"]
-            set val [gets $fd]
-            close $fd
-
-            return $val
-        }
-
-        test {CONFIG SET oom-score-adj works as expected} {
-            set base [get_oom_score_adj]
-
-            # Enable oom-score-adj, check defaults
-            r config set oom-score-adj-values "10 20 30"
-            r config set oom-score-adj yes
-
-            assert {[get_oom_score_adj] == [expr $base + 10]}
-
-            # Modify current class
-            r config set oom-score-adj-values "15 20 30"
-            assert {[get_oom_score_adj] == [expr $base + 15]}
-
-            # Check replica class
-            r replicaof localhost 1
-            assert {[get_oom_score_adj] == [expr $base + 20]}
-            r replicaof no one
-            assert {[get_oom_score_adj] == [expr $base + 15]}
-
-            # Check child process
-            r set key-a value-a
-            r config set rdb-key-save-delay 1000000
-            r bgsave
-
-            set child_pid [get_child_pid 0]
-            # Wait until background child process to setOOMScoreAdj success.
-            wait_for_condition 100 10 {
-                [get_oom_score_adj $child_pid] == [expr $base + 30]
-            } else {
-                fail "Set oom-score-adj of background child process is not ok"
-            }
-        }
-
-        # Failed oom-score-adj tests can only run unprivileged
-        if {$user_id != 0} {
-            test {CONFIG SET oom-score-adj handles configuration failures} {
-                # Bad config
-                r config set oom-score-adj no
-                r config set oom-score-adj-values "-1000 -1000 -1000"
-
-                # Make sure it fails
-                catch {r config set oom-score-adj yes} e
-                assert_match {*Failed to set*} $e
-
-                # Make sure it remains off
-                assert {[r config get oom-score-adj] == "oom-score-adj no"}
-
-                # Fix config
-                r config set oom-score-adj-values "0 100 100"
-                r config set oom-score-adj yes
-
-                # Make sure it fails
-                catch {r config set oom-score-adj-values "-1000 -1000 -1000"} e
-                assert_match {*Failed*} $e
-
-                # Make sure previous values remain
-                assert {[r config get oom-score-adj-values] == {oom-score-adj-values {0 100 100}}}
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/other.tcl b/redis-stable/tests/unit/other.tcl
deleted file mode 100644
index 293ee7e9..00000000
--- a/redis-stable/tests/unit/other.tcl
+++ /dev/null
@@ -1,370 +0,0 @@
-start_server {overrides {save ""} tags {"other"}} {
-    if {$::force_failure} {
-        # This is used just for test suite development purposes.
-        test {Failing test} {
-            format err
-        } {ok}
-    }
-
-    test {SAVE - make sure there are all the types as values} {
-        # Wait for a background saving in progress to terminate
-        waitForBgsave r
-        r lpush mysavelist hello
-        r lpush mysavelist world
-        r set myemptykey {}
-        r set mynormalkey {blablablba}
-        r zadd mytestzset 10 a
-        r zadd mytestzset 20 b
-        r zadd mytestzset 30 c
-        r save
-    } {OK}
-
-    tags {slow} {
-        if {$::accurate} {set iterations 10000} else {set iterations 1000}
-        foreach fuzztype {binary alpha compr} {
-            test "FUZZ stresser with data model $fuzztype" {
-                set err 0
-                for {set i 0} {$i < $iterations} {incr i} {
-                    set fuzz [randstring 0 512 $fuzztype]
-                    r set foo $fuzz
-                    set got [r get foo]
-                    if {$got ne $fuzz} {
-                        set err [list $fuzz $got]
-                        break
-                    }
-                }
-                set _ $err
-            } {0}
-        }
-    }
-
-    test {BGSAVE} {
-        waitForBgsave r
-        r flushdb
-        r save
-        r set x 10
-        r bgsave
-        waitForBgsave r
-        r debug reload
-        r get x
-    } {10}
-
-    test {SELECT an out of range DB} {
-        catch {r select 1000000} err
-        set _ $err
-    } {*index is out of range*}
-
-    tags {consistency} {
-        if {true} {
-            if {$::accurate} {set numops 10000} else {set numops 1000}
-            test {Check consistency of different data types after a reload} {
-                r flushdb
-                createComplexDataset r $numops
-                set dump [csvdump r]
-                set sha1 [r debug digest]
-                r debug reload
-                set sha1_after [r debug digest]
-                if {$sha1 eq $sha1_after} {
-                    set _ 1
-                } else {
-                    set newdump [csvdump r]
-                    puts "Consistency test failed!"
-                    puts "You can inspect the two dumps in /tmp/repldump*.txt"
-
-                    set fd [open /tmp/repldump1.txt w]
-                    puts $fd $dump
-                    close $fd
-                    set fd [open /tmp/repldump2.txt w]
-                    puts $fd $newdump
-                    close $fd
-
-                    set _ 0
-                }
-            } {1}
-
-            test {Same dataset digest if saving/reloading as AOF?} {
-                r config set aof-use-rdb-preamble no
-                r bgrewriteaof
-                waitForBgrewriteaof r
-                r debug loadaof
-                set sha1_after [r debug digest]
-                if {$sha1 eq $sha1_after} {
-                    set _ 1
-                } else {
-                    set newdump [csvdump r]
-                    puts "Consistency test failed!"
-                    puts "You can inspect the two dumps in /tmp/aofdump*.txt"
-
-                    set fd [open /tmp/aofdump1.txt w]
-                    puts $fd $dump
-                    close $fd
-                    set fd [open /tmp/aofdump2.txt w]
-                    puts $fd $newdump
-                    close $fd
-
-                    set _ 0
-                }
-            } {1}
-        }
-    }
-
-    test {EXPIRES after a reload (snapshot + append only file rewrite)} {
-        r flushdb
-        r set x 10
-        r expire x 1000
-        r save
-        r debug reload
-        set ttl [r ttl x]
-        set e1 [expr {$ttl > 900 && $ttl <= 1000}]
-        r bgrewriteaof
-        waitForBgrewriteaof r
-        r debug loadaof
-        set ttl [r ttl x]
-        set e2 [expr {$ttl > 900 && $ttl <= 1000}]
-        list $e1 $e2
-    } {1 1}
-
-    test {EXPIRES after AOF reload (without rewrite)} {
-        r flushdb
-        r config set appendonly yes
-        r config set aof-use-rdb-preamble no
-        r set x somevalue
-        r expire x 1000
-        r setex y 2000 somevalue
-        r set z somevalue
-        r expireat z [expr {[clock seconds]+3000}]
-
-        # Milliseconds variants
-        r set px somevalue
-        r pexpire px 1000000
-        r psetex py 2000000 somevalue
-        r set pz somevalue
-        r pexpireat pz [expr {([clock seconds]+3000)*1000}]
-
-        # Reload and check
-        waitForBgrewriteaof r
-        # We need to wait two seconds to avoid false positives here, otherwise
-        # the DEBUG LOADAOF command may read a partial file.
-        # Another solution would be to set the fsync policy to no, since this
-        # prevents write() to be delayed by the completion of fsync().
-        after 2000
-        r debug loadaof
-        set ttl [r ttl x]
-        assert {$ttl > 900 && $ttl <= 1000}
-        set ttl [r ttl y]
-        assert {$ttl > 1900 && $ttl <= 2000}
-        set ttl [r ttl z]
-        assert {$ttl > 2900 && $ttl <= 3000}
-        set ttl [r ttl px]
-        assert {$ttl > 900 && $ttl <= 1000}
-        set ttl [r ttl py]
-        assert {$ttl > 1900 && $ttl <= 2000}
-        set ttl [r ttl pz]
-        assert {$ttl > 2900 && $ttl <= 3000}
-        r config set appendonly no
-    }
-
-    tags {protocol} {
-        test {PIPELINING stresser (also a regression for the old epoll bug)} {
-            if {$::tls} {
-                set fd2 [::tls::socket [srv host] [srv port]]
-            } else {
-                set fd2 [socket [srv host] [srv port]]
-            }
-            fconfigure $fd2 -encoding binary -translation binary
-            puts -nonewline $fd2 "SELECT 9\r\n"
-            flush $fd2
-            gets $fd2
-
-            for {set i 0} {$i < 100000} {incr i} {
-                set q {}
-                set val "0000${i}0000"
-                append q "SET key:$i $val\r\n"
-                puts -nonewline $fd2 $q
-                set q {}
-                append q "GET key:$i\r\n"
-                puts -nonewline $fd2 $q
-            }
-            flush $fd2
-
-            for {set i 0} {$i < 100000} {incr i} {
-                gets $fd2 line
-                gets $fd2 count
-                set count [string range $count 1 end]
-                set val [read $fd2 $count]
-                read $fd2 2
-            }
-            close $fd2
-            set _ 1
-        } {1}
-    }
-
-    test {APPEND basics} {
-        r del foo
-        list [r append foo bar] [r get foo] \
-             [r append foo 100] [r get foo]
-    } {3 bar 6 bar100}
-
-    test {APPEND basics, integer encoded values} {
-        set res {}
-        r del foo
-        r append foo 1
-        r append foo 2
-        lappend res [r get foo]
-        r set foo 1
-        r append foo 2
-        lappend res [r get foo]
-    } {12 12}
-
-    test {APPEND fuzzing} {
-        set err {}
-        foreach type {binary alpha compr} {
-            set buf {}
-            r del x
-            for {set i 0} {$i < 1000} {incr i} {
-                set bin [randstring 0 10 $type]
-                append buf $bin
-                r append x $bin
-            }
-            if {$buf != [r get x]} {
-                set err "Expected '$buf' found '[r get x]'"
-                break
-            }
-        }
-        set _ $err
-    } {}
-
-    # Leave the user with a clean DB before to exit
-    test {FLUSHDB} {
-        set aux {}
-        r select 9
-        r flushdb
-        lappend aux [r dbsize]
-        r select 10
-        r flushdb
-        lappend aux [r dbsize]
-    } {0 0}
-
-    test {Perform a final SAVE to leave a clean DB on disk} {
-        waitForBgsave r
-        r save
-    } {OK}
-
-    test {RESET clears client state} {
-        r client setname test-client
-        r client tracking on
-
-        assert_equal [r reset] "RESET"
-        set client [r client list]
-        assert_match {*name= *} $client
-        assert_match {*flags=N *} $client
-    }
-
-    test {RESET clears MONITOR state} {
-        set rd [redis_deferring_client]
-        $rd monitor
-        assert_equal [$rd read] "OK"
-
-        $rd reset
-        assert_equal [$rd read] "RESET"
-
-        assert_no_match {*flags=O*} [r client list]
-    }
-
-    test {RESET clears and discards MULTI state} {
-        r multi
-        r set key-a a
-
-        r reset
-        catch {r exec} err
-        assert_match {*EXEC without MULTI*} $err
-    }
-
-    test {RESET clears Pub/Sub state} {
-        r subscribe channel-1
-        r reset
-
-        # confirm we're not subscribed by executing another command
-        r set key val
-    }
-
-    test {RESET clears authenticated state} {
-        r acl setuser user1 on >secret +@all
-        r auth user1 secret
-        assert_equal [r acl whoami] user1
-
-        r reset
-
-        assert_equal [r acl whoami] default
-    }
-}
-
-start_server {tags {"other"}} {
-    test {Don't rehash if redis has child proecess} {
-        r config set save ""
-        r config set rdb-key-save-delay 1000000
-
-        populate 4096 "" 1
-        r bgsave
-        wait_for_condition 10 100 {
-            [s rdb_bgsave_in_progress] eq 1
-        } else {
-            fail "bgsave did not start in time"
-        }
-
-        r mset k1 v1 k2 v2
-        # Hash table should not rehash
-        assert_no_match "*table size: 8192*" [r debug HTSTATS 9]
-        exec kill -9 [get_child_pid 0]
-        after 200
-
-        # Hash table should rehash since there is no child process,
-        # size is power of two and over 4098, so it is 8192
-        r set k3 v3
-        assert_match "*table size: 8192*" [r debug HTSTATS 9]
-    }
-}
-
-proc read_proc_title {pid} {
-    set fd [open "/proc/$pid/cmdline" "r"]
-    set cmdline [read $fd 1024]
-    close $fd
-
-    return $cmdline
-}
-
-start_server {tags {"other"}} {
-    test {Process title set as expected} {
-        # Test only on Linux where it's easy to get cmdline without relying on tools.
-        # Skip valgrind as it messes up the arguments.
-        set os [exec uname]
-        if {$os == "Linux" && !$::valgrind} {
-            # Set a custom template
-            r config set "proc-title-template" "TEST {title} {listen-addr} {port} {tls-port} {unixsocket} {config-file}"
-            set cmdline [read_proc_title [srv 0 pid]]
-
-            assert_equal "TEST" [lindex $cmdline 0]
-            assert_match "*/redis-server" [lindex $cmdline 1]
-            
-            if {$::tls} {
-                set expect_port 0
-                set expect_tls_port [srv 0 port]
-            } else {
-                set expect_port [srv 0 port]
-                set expect_tls_port 0
-            }
-            set port [srv 0 port]
-
-            assert_equal "$::host:$port" [lindex $cmdline 2]
-            assert_equal $expect_port [lindex $cmdline 3]
-            assert_equal $expect_tls_port [lindex $cmdline 4]
-            assert_match "*/tests/tmp/server.*/socket" [lindex $cmdline 5]
-            assert_match "*/tests/tmp/redis.conf.*" [lindex $cmdline 6]
-
-            # Try setting a bad template
-            catch {r config set "proc-title-template" "{invalid-var}"} err
-            assert_match {*template format is invalid*} $err
-        }
-    }
-}
-
diff --git a/redis-stable/tests/unit/pause.tcl b/redis-stable/tests/unit/pause.tcl
deleted file mode 100644
index 21b9680d..00000000
--- a/redis-stable/tests/unit/pause.tcl
+++ /dev/null
@@ -1,251 +0,0 @@
-start_server {tags {"pause network"}} {
-    test "Test read commands are not blocked by client pause" {
-        r client PAUSE 100000000 WRITE
-        set rd [redis_deferring_client]
-        $rd GET FOO
-        $rd PING
-        $rd INFO
-        assert_equal [s 0 blocked_clients] 0
-        r client unpause
-        $rd close
-    }
-
-    test "Test write commands are paused by RO" {
-        r client PAUSE 100000000 WRITE
-
-        set rd [redis_deferring_client]
-        $rd SET FOO BAR
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        r client unpause
-        assert_match "OK" [$rd read]
-        $rd close
-    }
-
-    test "Test special commands are paused by RO" {
-        r PFADD pause-hll test
-        r client PAUSE 100000000 WRITE
-
-        # Test that pfcount, which can replicate, is also blocked
-        set rd [redis_deferring_client]
-        $rd PFCOUNT pause-hll
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        # Test that publish, which adds the message to the replication
-        # stream is blocked.
-        set rd2 [redis_deferring_client]
-        $rd2 publish foo bar
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {2}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        # Test that SCRIPT LOAD, which is replicated. 
-        set rd3 [redis_deferring_client]
-        $rd3 script load "return 1"
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {3}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        r client unpause 
-        assert_match "1" [$rd read]
-        assert_match "0" [$rd2 read]
-        assert_match "*" [$rd3 read]
-        $rd close
-        $rd2 close
-        $rd3 close
-    }
-
-    test "Test read/admin mutli-execs are not blocked by pause RO" {
-        r SET FOO BAR
-        r client PAUSE 100000000 WRITE
-        set rd [redis_deferring_client]
-        $rd MULTI
-        assert_equal [$rd read] "OK"
-        $rd PING
-        assert_equal [$rd read] "QUEUED"
-        $rd GET FOO
-        assert_equal [$rd read] "QUEUED"
-        $rd EXEC
-        assert_equal [s 0 blocked_clients] 0
-        r client unpause 
-        assert_match "PONG BAR" [$rd read]
-        $rd close
-    }
-
-    test "Test write mutli-execs are blocked by pause RO" {
-        set rd [redis_deferring_client]
-        $rd MULTI
-        assert_equal [$rd read] "OK"
-        $rd SET FOO BAR
-        r client PAUSE 100000000 WRITE
-        assert_equal [$rd read] "QUEUED"
-        $rd EXEC
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client unpause 
-        assert_match "OK" [$rd read]
-        $rd close
-    }
-
-    test "Test scripts are blocked by pause RO" {
-        r client PAUSE 100000000 WRITE
-        set rd [redis_deferring_client]
-        $rd EVAL "return 1" 0
-        
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client unpause 
-        assert_match "1" [$rd read]
-        $rd close
-    }
-
-    test "Test multiple clients can be queued up and unblocked" {
-        r client PAUSE 100000000 WRITE
-        set clients [list [redis_deferring_client] [redis_deferring_client] [redis_deferring_client]]
-        foreach client $clients {
-            $client SET FOO BAR
-        }
-        
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {3}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r client unpause
-        foreach client $clients {
-            assert_match "OK" [$client read]
-            $client close
-        }
-    }
-
-    test "Test clients with syntax errors will get responses immediately" {
-        r client PAUSE 100000000 WRITE
-        catch {r set FOO} err
-        assert_match "ERR wrong number of arguments for *" $err
-        r client unpause
-    }
-
-    test "Test both active and passive expiries are skipped during client pause" {
-        set expired_keys [s 0 expired_keys]
-        r multi
-        r set foo bar PX 10
-        r set bar foo PX 10
-        r client PAUSE 100000000 WRITE
-        r exec
-
-        wait_for_condition 10 100 {
-            [r get foo] == {} && [r get bar] == {}
-        } else {
-            fail "Keys were never logically expired"
-        }
-
-        # No keys should actually have been expired
-        assert_match $expired_keys [s 0 expired_keys]
-
-        r client unpause
-
-        # Force the keys to expire
-        r get foo
-        r get bar
-
-        # Now that clients have been unpaused, expires should go through
-        assert_match [expr $expired_keys + 2] [s 0 expired_keys]   
-    }
-
-    test "Test that client pause starts at the end of a transaction" {
-        r MULTI
-        r SET FOO1 BAR
-        r client PAUSE 100000000 WRITE
-        r SET FOO2 BAR
-        r exec
-
-        set rd [redis_deferring_client]
-        $rd SET FOO3 BAR
-        
-        wait_for_condition 50 100 {
-            [s 0 blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-
-        assert_match "BAR" [r GET FOO1]
-        assert_match "BAR" [r GET FOO2]
-        assert_match "" [r GET FOO3]
-
-        r client unpause 
-        assert_match "OK" [$rd read]
-        $rd close
-    }
-
-    start_server {tags {needs:repl external:skip}} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-
-        # Avoid PINGs
-        $master config set repl-ping-replica-period 3600
-        r replicaof $master_host $master_port
-
-        wait_for_condition 50 100 {
-            [s master_link_status] eq {up}
-        } else {
-            fail "Replication not started."
-        }
-
-        test "Test when replica paused, offset would not grow" {
-            $master set foo bar
-            set old_master_offset [status $master master_repl_offset]
-
-            wait_for_condition 50 100 {
-                [s slave_repl_offset] == [status $master master_repl_offset]
-            } else {
-                fail "Replication offset not matched."
-            }
-
-            r client pause 100000 write
-            $master set foo2 bar2
-
-            # Make sure replica received data from master
-            wait_for_condition 50 100 {
-                [s slave_read_repl_offset] == [status $master master_repl_offset]
-            } else {
-                fail "Replication not work."
-            }
-
-            # Replica would not apply the write command
-            assert {[s slave_repl_offset] == $old_master_offset}
-            r get foo2
-        } {}
-
-        test "Test replica offset would grow after unpause" {
-            r client unpause
-            wait_for_condition 50 100 {
-                [s slave_repl_offset] == [status $master master_repl_offset]
-            } else {
-                fail "Replication not continue."
-            }
-            r get foo2
-        } {bar2}
-    }
-
-    # Make sure we unpause at the end
-    r client unpause
-}
diff --git a/redis-stable/tests/unit/pendingquerybuf.tcl b/redis-stable/tests/unit/pendingquerybuf.tcl
deleted file mode 100644
index ebf17fdf..00000000
--- a/redis-stable/tests/unit/pendingquerybuf.tcl
+++ /dev/null
@@ -1,36 +0,0 @@
-proc info_memory {r property} {
-    if {[regexp "\r\n$property:(.*?)\r\n" [{*}$r info memory] _ value]} {
-        set _ $value
-    }
-}
-
-proc prepare_value {size} {
-    set _v "c" 
-    for {set i 1} {$i < $size} {incr i} {
-        append _v 0   
-    }
-    return $_v
-}
-
-start_server {tags {"wait"}} {
-start_server {} {
-    set slave [srv 0 client]
-    set slave_host [srv 0 host]
-    set slave_port [srv 0 port]
-    set master [srv -1 client]
-    set master_host [srv -1 host]
-    set master_port [srv -1 port]
-
-    test "pending querybuf: check size of pending_querybuf after set a big value" {
-        $slave slaveof $master_host $master_port
-        set _v [prepare_value [expr 32*1024*1024]]
-        $master set key $_v 
-        wait_for_ofs_sync $master $slave
-
-        wait_for_condition 50 100 {
-            [info_memory $slave used_memory] <= [info_memory $master used_memory] + 10*1024*1024
-        } else {
-            fail "the used_memory of replica is much larger than master."
-        }
-    }  
-}}
diff --git a/redis-stable/tests/unit/printver.tcl b/redis-stable/tests/unit/printver.tcl
deleted file mode 100644
index c80f4514..00000000
--- a/redis-stable/tests/unit/printver.tcl
+++ /dev/null
@@ -1,6 +0,0 @@
-start_server {} {
-    set i [r info]
-    regexp {redis_version:(.*?)\r\n} $i - version
-    regexp {redis_git_sha1:(.*?)\r\n} $i - sha1
-    puts "Testing Redis version $version ($sha1)"
-}
diff --git a/redis-stable/tests/unit/protocol.tcl b/redis-stable/tests/unit/protocol.tcl
deleted file mode 100644
index a3d8f7e8..00000000
--- a/redis-stable/tests/unit/protocol.tcl
+++ /dev/null
@@ -1,209 +0,0 @@
-start_server {tags {"protocol network"}} {
-    test "Handle an empty query" {
-        reconnect
-        r write "\r\n"
-        r flush
-        assert_equal "PONG" [r ping]
-    }
-
-    test "Negative multibulk length" {
-        reconnect
-        r write "*-10\r\n"
-        r flush
-        assert_equal PONG [r ping]
-    }
-
-    test "Out of range multibulk length" {
-        reconnect
-        r write "*20000000\r\n"
-        r flush
-        assert_error "*invalid multibulk length*" {r read}
-    }
-
-    test "Wrong multibulk payload header" {
-        reconnect
-        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\nfooz\r\n"
-        r flush
-        assert_error "*expected '$', got 'f'*" {r read}
-    }
-
-    test "Negative multibulk payload length" {
-        reconnect
-        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$-10\r\n"
-        r flush
-        assert_error "*invalid bulk length*" {r read}
-    }
-
-    test "Out of range multibulk payload length" {
-        reconnect
-        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$2000000000\r\n"
-        r flush
-        assert_error "*invalid bulk length*" {r read}
-    }
-
-    test "Non-number multibulk payload length" {
-        reconnect
-        r write "*3\r\n\$3\r\nSET\r\n\$1\r\nx\r\n\$blabla\r\n"
-        r flush
-        assert_error "*invalid bulk length*" {r read}
-    }
-
-    test "Multi bulk request not followed by bulk arguments" {
-        reconnect
-        r write "*1\r\nfoo\r\n"
-        r flush
-        assert_error "*expected '$', got 'f'*" {r read}
-    }
-
-    test "Generic wrong number of args" {
-        reconnect
-        assert_error "*wrong*arguments*ping*" {r ping x y z}
-    }
-
-    test "Unbalanced number of quotes" {
-        reconnect
-        r write "set \"\"\"test-key\"\"\" test-value\r\n"
-        r write "ping\r\n"
-        r flush
-        assert_error "*unbalanced*" {r read}
-    }
-
-    set c 0
-    foreach seq [list "\x00" "*\x00" "$\x00"] {
-        incr c
-        test "Protocol desync regression test #$c" {
-            if {$::tls} {
-                set s [::tls::socket [srv 0 host] [srv 0 port]]
-            } else {
-                set s [socket [srv 0 host] [srv 0 port]]
-            }
-            puts -nonewline $s $seq
-            set payload [string repeat A 1024]"\n"
-            set test_start [clock seconds]
-            set test_time_limit 30
-            while 1 {
-                if {[catch {
-                    puts -nonewline $s payload
-                    flush $s
-                    incr payload_size [string length $payload]
-                }]} {
-                    set retval [gets $s]
-                    close $s
-                    break
-                } else {
-                    set elapsed [expr {[clock seconds]-$test_start}]
-                    if {$elapsed > $test_time_limit} {
-                        close $s
-                        error "assertion:Redis did not closed connection after protocol desync"
-                    }
-                }
-            }
-            set retval
-        } {*Protocol error*}
-    }
-    unset c
-
-    # recover the broken connection
-    reconnect
-    r ping
-
-    # raw RESP response tests
-    r readraw 1
-
-    test "raw protocol response" {
-        r srandmember nonexisting_key
-    } {*-1}
-
-    r deferred 1
-
-    test "raw protocol response - deferred" {
-        r srandmember nonexisting_key
-        r read
-    } {*-1}
-
-    test "raw protocol response - multiline" {
-        r sadd ss a
-        assert_equal [r read] {:1}
-        r srandmember ss 100
-        assert_equal [r read] {*1}
-        assert_equal [r read] {$1}
-        assert_equal [r read] {a}
-    }
-
-    # restore connection settings
-    r readraw 0
-    r deferred 0
-
-    # check the connection still works
-    assert_equal [r ping] {PONG}
-
-    test {RESP3 attributes} {
-        r hello 3
-        set res [r debug protocol attrib]
-        # currently the parser in redis.tcl ignores the attributes
-
-        # restore state
-        r hello 2
-        set _ $res
-    } {Some real reply following the attribute}
-
-    test {RESP3 attributes readraw} {
-        r hello 3
-        r readraw 1
-        r deferred 1
-
-        r debug protocol attrib
-        assert_equal [r read] {|1}
-        assert_equal [r read] {$14}
-        assert_equal [r read] {key-popularity}
-        assert_equal [r read] {*2}
-        assert_equal [r read] {$7}
-        assert_equal [r read] {key:123}
-        assert_equal [r read] {:90}
-        assert_equal [r read] {$39}
-        assert_equal [r read] {Some real reply following the attribute}
-
-        # restore state
-        r readraw 0
-        r deferred 0
-        r hello 2
-        set _ {}
-    } {}
-
-    test {RESP3 attributes on RESP2} {
-        r hello 2
-        set res [r debug protocol attrib]
-        set _ $res
-    } {Some real reply following the attribute}
-
-    test "test big number parsing" {
-        r hello 3
-        r debug protocol bignum
-    } {1234567999999999999999999999999999999}
-
-    test "test bool parsing" {
-        r hello 3
-        assert_equal [r debug protocol true] 1
-        assert_equal [r debug protocol false] 0
-        r hello 2
-        assert_equal [r debug protocol true] 1
-        assert_equal [r debug protocol false] 0
-        set _ {}
-    } {}
-}
-
-start_server {tags {"regression"}} {
-    test "Regression for a crash with blocking ops and pipelining" {
-        set rd [redis_deferring_client]
-        set fd [r channel]
-        set proto "*3\r\n\$5\r\nBLPOP\r\n\$6\r\nnolist\r\n\$1\r\n0\r\n"
-        puts -nonewline $fd $proto$proto
-        flush $fd
-        set res {}
-
-        $rd rpush nolist a
-        $rd read
-        $rd rpush nolist a
-        $rd read
-    }
-}
diff --git a/redis-stable/tests/unit/pubsub.tcl b/redis-stable/tests/unit/pubsub.tcl
deleted file mode 100644
index 03c5dfcc..00000000
--- a/redis-stable/tests/unit/pubsub.tcl
+++ /dev/null
@@ -1,360 +0,0 @@
-start_server {tags {"pubsub network"}} {
-    test "Pub/Sub PING" {
-        set rd1 [redis_deferring_client]
-        subscribe $rd1 somechannel
-        # While subscribed to non-zero channels PING works in Pub/Sub mode.
-        $rd1 ping
-        $rd1 ping "foo"
-        set reply1 [$rd1 read]
-        set reply2 [$rd1 read]
-        unsubscribe $rd1 somechannel
-        # Now we are unsubscribed, PING should just return PONG.
-        $rd1 ping
-        set reply3 [$rd1 read]
-        $rd1 close
-        list $reply1 $reply2 $reply3
-    } {{pong {}} {pong foo} PONG}
-
-    test "PUBLISH/SUBSCRIBE basics" {
-        set rd1 [redis_deferring_client]
-
-        # subscribe to two channels
-        assert_equal {1 2} [subscribe $rd1 {chan1 chan2}]
-        assert_equal 1 [r publish chan1 hello]
-        assert_equal 1 [r publish chan2 world]
-        assert_equal {message chan1 hello} [$rd1 read]
-        assert_equal {message chan2 world} [$rd1 read]
-
-        # unsubscribe from one of the channels
-        unsubscribe $rd1 {chan1}
-        assert_equal 0 [r publish chan1 hello]
-        assert_equal 1 [r publish chan2 world]
-        assert_equal {message chan2 world} [$rd1 read]
-
-        # unsubscribe from the remaining channel
-        unsubscribe $rd1 {chan2}
-        assert_equal 0 [r publish chan1 hello]
-        assert_equal 0 [r publish chan2 world]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "PUBLISH/SUBSCRIBE with two clients" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-
-        assert_equal {1} [subscribe $rd1 {chan1}]
-        assert_equal {1} [subscribe $rd2 {chan1}]
-        assert_equal 2 [r publish chan1 hello]
-        assert_equal {message chan1 hello} [$rd1 read]
-        assert_equal {message chan1 hello} [$rd2 read]
-
-        # clean up clients
-        $rd1 close
-        $rd2 close
-    }
-
-    test "PUBLISH/SUBSCRIBE after UNSUBSCRIBE without arguments" {
-        set rd1 [redis_deferring_client]
-        assert_equal {1 2 3} [subscribe $rd1 {chan1 chan2 chan3}]
-        unsubscribe $rd1
-        assert_equal 0 [r publish chan1 hello]
-        assert_equal 0 [r publish chan2 hello]
-        assert_equal 0 [r publish chan3 hello]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "SUBSCRIBE to one channel more than once" {
-        set rd1 [redis_deferring_client]
-        assert_equal {1 1 1} [subscribe $rd1 {chan1 chan1 chan1}]
-        assert_equal 1 [r publish chan1 hello]
-        assert_equal {message chan1 hello} [$rd1 read]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "UNSUBSCRIBE from non-subscribed channels" {
-        set rd1 [redis_deferring_client]
-        assert_equal {0 0 0} [unsubscribe $rd1 {foo bar quux}]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "PUBLISH/PSUBSCRIBE basics" {
-        set rd1 [redis_deferring_client]
-
-        # subscribe to two patterns
-        assert_equal {1 2} [psubscribe $rd1 {foo.* bar.*}]
-        assert_equal 1 [r publish foo.1 hello]
-        assert_equal 1 [r publish bar.1 hello]
-        assert_equal 0 [r publish foo1 hello]
-        assert_equal 0 [r publish barfoo.1 hello]
-        assert_equal 0 [r publish qux.1 hello]
-        assert_equal {pmessage foo.* foo.1 hello} [$rd1 read]
-        assert_equal {pmessage bar.* bar.1 hello} [$rd1 read]
-
-        # unsubscribe from one of the patterns
-        assert_equal {1} [punsubscribe $rd1 {foo.*}]
-        assert_equal 0 [r publish foo.1 hello]
-        assert_equal 1 [r publish bar.1 hello]
-        assert_equal {pmessage bar.* bar.1 hello} [$rd1 read]
-
-        # unsubscribe from the remaining pattern
-        assert_equal {0} [punsubscribe $rd1 {bar.*}]
-        assert_equal 0 [r publish foo.1 hello]
-        assert_equal 0 [r publish bar.1 hello]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "PUBLISH/PSUBSCRIBE with two clients" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-
-        assert_equal {1} [psubscribe $rd1 {chan.*}]
-        assert_equal {1} [psubscribe $rd2 {chan.*}]
-        assert_equal 2 [r publish chan.foo hello]
-        assert_equal {pmessage chan.* chan.foo hello} [$rd1 read]
-        assert_equal {pmessage chan.* chan.foo hello} [$rd2 read]
-
-        # clean up clients
-        $rd1 close
-        $rd2 close
-    }
-
-    test "PUBLISH/PSUBSCRIBE after PUNSUBSCRIBE without arguments" {
-        set rd1 [redis_deferring_client]
-        assert_equal {1 2 3} [psubscribe $rd1 {chan1.* chan2.* chan3.*}]
-        punsubscribe $rd1
-        assert_equal 0 [r publish chan1.hi hello]
-        assert_equal 0 [r publish chan2.hi hello]
-        assert_equal 0 [r publish chan3.hi hello]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "PUNSUBSCRIBE from non-subscribed channels" {
-        set rd1 [redis_deferring_client]
-        assert_equal {0 0 0} [punsubscribe $rd1 {foo.* bar.* quux.*}]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "NUMSUB returns numbers, not strings (#1561)" {
-        r pubsub numsub abc def
-    } {abc 0 def 0}
-
-    test "NUMPATs returns the number of unique patterns" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-
-        # Three unique patterns and one that overlaps
-        psubscribe $rd1 "foo*"
-        psubscribe $rd2 "foo*"
-        psubscribe $rd1 "bar*"
-        psubscribe $rd2 "baz*"
-
-        set patterns [r pubsub numpat]
-
-        # clean up clients
-        punsubscribe $rd1
-        punsubscribe $rd2
-        assert_equal 3 $patterns
-    }
-
-    test "Mix SUBSCRIBE and PSUBSCRIBE" {
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [subscribe $rd1 {foo.bar}]
-        assert_equal {2} [psubscribe $rd1 {foo.*}]
-
-        assert_equal 2 [r publish foo.bar hello]
-        assert_equal {message foo.bar hello} [$rd1 read]
-        assert_equal {pmessage foo.* foo.bar hello} [$rd1 read]
-
-        # clean up clients
-        $rd1 close
-    }
-
-    test "PUNSUBSCRIBE and UNSUBSCRIBE should always reply" {
-        # Make sure we are not subscribed to any channel at all.
-        r punsubscribe
-        r unsubscribe
-        # Now check if the commands still reply correctly.
-        set reply1 [r punsubscribe]
-        set reply2 [r unsubscribe]
-        concat $reply1 $reply2
-    } {punsubscribe {} 0 unsubscribe {} 0}
-
-    ### Keyspace events notification tests
-
-    test "Keyspace notifications: we receive keyspace notifications" {
-        r config set notify-keyspace-events KA
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        assert_equal {pmessage * __keyspace@9__:foo set} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: we receive keyevent notifications" {
-        r config set notify-keyspace-events EA
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        assert_equal {pmessage * __keyevent@9__:set foo} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: we can receive both kind of events" {
-        r config set notify-keyspace-events KEA
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        assert_equal {pmessage * __keyspace@9__:foo set} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:set foo} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: we are able to mask events" {
-        r config set notify-keyspace-events KEl
-        r del mylist
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        r lpush mylist a
-        # No notification for set, because only list commands are enabled.
-        assert_equal {pmessage * __keyspace@9__:mylist lpush} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:lpush mylist} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: general events test" {
-        r config set notify-keyspace-events KEg
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        r expire foo 1
-        r del foo
-        assert_equal {pmessage * __keyspace@9__:foo expire} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:expire foo} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:foo del} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:del foo} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: list events test" {
-        r config set notify-keyspace-events KEl
-        r del mylist
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r lpush mylist a
-        r rpush mylist a
-        r rpop mylist
-        assert_equal {pmessage * __keyspace@9__:mylist lpush} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:lpush mylist} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:mylist rpush} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:rpush mylist} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:mylist rpop} [$rd1 read]
-        assert_equal {pmessage * __keyevent@9__:rpop mylist} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: set events test" {
-        r config set notify-keyspace-events Ks
-        r del myset
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r sadd myset a b c d
-        r srem myset x
-        r sadd myset x y z
-        r srem myset x
-        assert_equal {pmessage * __keyspace@9__:myset sadd} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:myset sadd} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:myset srem} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: zset events test" {
-        r config set notify-keyspace-events Kz
-        r del myzset
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r zadd myzset 1 a 2 b
-        r zrem myzset x
-        r zadd myzset 3 x 4 y 5 z
-        r zrem myzset x
-        assert_equal {pmessage * __keyspace@9__:myzset zadd} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:myzset zadd} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:myzset zrem} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: hash events test" {
-        r config set notify-keyspace-events Kh
-        r del myhash
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r hmset myhash yes 1 no 0
-        r hincrby myhash yes 10
-        assert_equal {pmessage * __keyspace@9__:myhash hset} [$rd1 read]
-        assert_equal {pmessage * __keyspace@9__:myhash hincrby} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: expired events (triggered expire)" {
-        r config set notify-keyspace-events Ex
-        r del foo
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r psetex foo 100 1
-        wait_for_condition 50 100 {
-            [r exists foo] == 0
-        } else {
-            fail "Key does not expire?!"
-        }
-        assert_equal {pmessage * __keyevent@9__:expired foo} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: expired events (background expire)" {
-        r config set notify-keyspace-events Ex
-        r del foo
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r psetex foo 100 1
-        assert_equal {pmessage * __keyevent@9__:expired foo} [$rd1 read]
-        $rd1 close
-    }
-
-    test "Keyspace notifications: evicted events" {
-        r config set notify-keyspace-events Ee
-        r config set maxmemory-policy allkeys-lru
-        r flushdb
-        set rd1 [redis_deferring_client]
-        assert_equal {1} [psubscribe $rd1 *]
-        r set foo bar
-        r config set maxmemory 1
-        assert_equal {pmessage * __keyevent@9__:evicted foo} [$rd1 read]
-        r config set maxmemory 0
-        $rd1 close
-    }
-
-    test "Keyspace notifications: test CONFIG GET/SET of event flags" {
-        r config set notify-keyspace-events gKE
-        assert_equal {gKE} [lindex [r config get notify-keyspace-events] 1]
-        r config set notify-keyspace-events {$lshzxeKE}
-        assert_equal {$lshzxeKE} [lindex [r config get notify-keyspace-events] 1]
-        r config set notify-keyspace-events KA
-        assert_equal {AK} [lindex [r config get notify-keyspace-events] 1]
-        r config set notify-keyspace-events EA
-        assert_equal {AE} [lindex [r config get notify-keyspace-events] 1]
-    }
-}
diff --git a/redis-stable/tests/unit/quit.tcl b/redis-stable/tests/unit/quit.tcl
deleted file mode 100644
index 4cf440ab..00000000
--- a/redis-stable/tests/unit/quit.tcl
+++ /dev/null
@@ -1,40 +0,0 @@
-start_server {tags {"quit"}} {
-    proc format_command {args} {
-        set cmd "*[llength $args]\r\n"
-        foreach a $args {
-            append cmd "$[string length $a]\r\n$a\r\n"
-        }
-        set _ $cmd
-    }
-
-    test "QUIT returns OK" {
-        reconnect
-        assert_equal OK [r quit]
-        assert_error * {r ping}
-    }
-
-    test "Pipelined commands after QUIT must not be executed" {
-        reconnect
-        r write [format_command quit]
-        r write [format_command set foo bar]
-        r flush
-        assert_equal OK [r read]
-        assert_error * {r read}
-
-        reconnect
-        assert_equal {} [r get foo]
-    }
-
-    test "Pipelined commands after QUIT that exceed read buffer size" {
-        reconnect
-        r write [format_command quit]
-        r write [format_command set foo [string repeat "x" 1024]]
-        r flush
-        assert_equal OK [r read]
-        assert_error * {r read}
-
-        reconnect
-        assert_equal {} [r get foo]
-
-    }
-}
diff --git a/redis-stable/tests/unit/scan.tcl b/redis-stable/tests/unit/scan.tcl
deleted file mode 100644
index 3981a223..00000000
--- a/redis-stable/tests/unit/scan.tcl
+++ /dev/null
@@ -1,330 +0,0 @@
-start_server {tags {"scan network"}} {
-    test "SCAN basic" {
-        r flushdb
-        r debug populate 1000
-
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        set keys [lsort -unique $keys]
-        assert_equal 1000 [llength $keys]
-    }
-
-    test "SCAN COUNT" {
-        r flushdb
-        r debug populate 1000
-
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur count 5]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        set keys [lsort -unique $keys]
-        assert_equal 1000 [llength $keys]
-    }
-
-    test "SCAN MATCH" {
-        r flushdb
-        r debug populate 1000
-
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur match "key:1??"]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        set keys [lsort -unique $keys]
-        assert_equal 100 [llength $keys]
-    }
-
-    test "SCAN TYPE" {
-        r flushdb
-        # populate only creates strings
-        r debug populate 1000
-
-        # Check non-strings are excluded
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur type "list"]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        assert_equal 0 [llength $keys]
-
-        # Check strings are included
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur type "string"]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        assert_equal 1000 [llength $keys]
-
-        # Check all three args work together
-        set cur 0
-        set keys {}
-        while 1 {
-            set res [r scan $cur type "string" match "key:*" count 10]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-        }
-
-        assert_equal 1000 [llength $keys]
-    }
-
-    foreach enc {intset hashtable} {
-        test "SSCAN with encoding $enc" {
-            # Create the Set
-            r del set
-            if {$enc eq {intset}} {
-                set prefix ""
-            } else {
-                set prefix "ele:"
-            }
-            set elements {}
-            for {set j 0} {$j < 100} {incr j} {
-                lappend elements ${prefix}${j}
-            }
-            r sadd set {*}$elements
-
-            # Verify that the encoding matches.
-            assert {[r object encoding set] eq $enc}
-
-            # Test SSCAN
-            set cur 0
-            set keys {}
-            while 1 {
-                set res [r sscan set $cur]
-                set cur [lindex $res 0]
-                set k [lindex $res 1]
-                lappend keys {*}$k
-                if {$cur == 0} break
-            }
-
-            set keys [lsort -unique $keys]
-            assert_equal 100 [llength $keys]
-        }
-    }
-
-    foreach enc {ziplist hashtable} {
-        test "HSCAN with encoding $enc" {
-            # Create the Hash
-            r del hash
-            if {$enc eq {ziplist}} {
-                set count 30
-            } else {
-                set count 1000
-            }
-            set elements {}
-            for {set j 0} {$j < $count} {incr j} {
-                lappend elements key:$j $j
-            }
-            r hmset hash {*}$elements
-
-            # Verify that the encoding matches.
-            assert {[r object encoding hash] eq $enc}
-
-            # Test HSCAN
-            set cur 0
-            set keys {}
-            while 1 {
-                set res [r hscan hash $cur]
-                set cur [lindex $res 0]
-                set k [lindex $res 1]
-                lappend keys {*}$k
-                if {$cur == 0} break
-            }
-
-            set keys2 {}
-            foreach {k v} $keys {
-                assert {$k eq "key:$v"}
-                lappend keys2 $k
-            }
-
-            set keys2 [lsort -unique $keys2]
-            assert_equal $count [llength $keys2]
-        }
-    }
-
-    foreach enc {ziplist skiplist} {
-        test "ZSCAN with encoding $enc" {
-            # Create the Sorted Set
-            r del zset
-            if {$enc eq {ziplist}} {
-                set count 30
-            } else {
-                set count 1000
-            }
-            set elements {}
-            for {set j 0} {$j < $count} {incr j} {
-                lappend elements $j key:$j
-            }
-            r zadd zset {*}$elements
-
-            # Verify that the encoding matches.
-            assert {[r object encoding zset] eq $enc}
-
-            # Test ZSCAN
-            set cur 0
-            set keys {}
-            while 1 {
-                set res [r zscan zset $cur]
-                set cur [lindex $res 0]
-                set k [lindex $res 1]
-                lappend keys {*}$k
-                if {$cur == 0} break
-            }
-
-            set keys2 {}
-            foreach {k v} $keys {
-                assert {$k eq "key:$v"}
-                lappend keys2 $k
-            }
-
-            set keys2 [lsort -unique $keys2]
-            assert_equal $count [llength $keys2]
-        }
-    }
-
-    test "SCAN guarantees check under write load" {
-        r flushdb
-        r debug populate 100
-
-        # We start scanning here, so keys from 0 to 99 should all be
-        # reported at the end of the iteration.
-        set keys {}
-        while 1 {
-            set res [r scan $cur]
-            set cur [lindex $res 0]
-            set k [lindex $res 1]
-            lappend keys {*}$k
-            if {$cur == 0} break
-            # Write 10 random keys at every SCAN iteration.
-            for {set j 0} {$j < 10} {incr j} {
-                r set addedkey:[randomInt 1000] foo
-            }
-        }
-
-        set keys2 {}
-        foreach k $keys {
-            if {[string length $k] > 6} continue
-            lappend keys2 $k
-        }
-
-        set keys2 [lsort -unique $keys2]
-        assert_equal 100 [llength $keys2]
-    }
-
-    test "SSCAN with integer encoded object (issue #1345)" {
-        set objects {1 a}
-        r del set
-        r sadd set {*}$objects
-        set res [r sscan set 0 MATCH *a* COUNT 100]
-        assert_equal [lsort -unique [lindex $res 1]] {a}
-        set res [r sscan set 0 MATCH *1* COUNT 100]
-        assert_equal [lsort -unique [lindex $res 1]] {1}
-    }
-
-    test "SSCAN with PATTERN" {
-        r del mykey
-        r sadd mykey foo fab fiz foobar 1 2 3 4
-        set res [r sscan mykey 0 MATCH foo* COUNT 10000]
-        lsort -unique [lindex $res 1]
-    } {foo foobar}
-
-    test "HSCAN with PATTERN" {
-        r del mykey
-        r hmset mykey foo 1 fab 2 fiz 3 foobar 10 1 a 2 b 3 c 4 d
-        set res [r hscan mykey 0 MATCH foo* COUNT 10000]
-        lsort -unique [lindex $res 1]
-    } {1 10 foo foobar}
-
-    test "ZSCAN with PATTERN" {
-        r del mykey
-        r zadd mykey 1 foo 2 fab 3 fiz 10 foobar
-        set res [r zscan mykey 0 MATCH foo* COUNT 10000]
-        lsort -unique [lindex $res 1]
-    }
-
-    test "ZSCAN scores: regression test for issue #2175" {
-        r del mykey
-        for {set j 0} {$j < 500} {incr j} {
-            r zadd mykey 9.8813129168249309e-323 $j
-        }
-        set res [lindex [r zscan mykey 0] 1]
-        set first_score [lindex $res 1]
-        assert {$first_score != 0}
-    }
-
-    test "SCAN regression test for issue #4906" {
-        for {set k 0} {$k < 100} {incr k} {
-            r del set
-            r sadd set x; # Make sure it's not intset encoded
-            set toremove {}
-            unset -nocomplain found
-            array set found {}
-
-            # Populate the set
-            set numele [expr {101+[randomInt 1000]}]
-            for {set j 0} {$j < $numele} {incr j} {
-                r sadd set $j
-                if {$j >= 100} {
-                    lappend toremove $j
-                }
-            }
-
-            # Start scanning
-            set cursor 0
-            set iteration 0
-            set del_iteration [randomInt 10]
-            while {!($cursor == 0 && $iteration != 0)} {
-                lassign [r sscan set $cursor] cursor items
-
-                # Mark found items. We expect to find from 0 to 99 at the end
-                # since those elements will never be removed during the scanning.
-                foreach i $items {
-                    set found($i) 1
-                }
-                incr iteration
-                # At some point remove most of the items to trigger the
-                # rehashing to a smaller hash table.
-                if {$iteration == $del_iteration} {
-                    r srem set {*}$toremove
-                }
-            }
-
-            # Verify that SSCAN reported everything from 0 to 99
-            for {set j 0} {$j < 100} {incr j} {
-                if {![info exists found($j)]} {
-                    fail "SSCAN element missing $j"
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/scripting.tcl b/redis-stable/tests/unit/scripting.tcl
deleted file mode 100644
index cd6646dc..00000000
--- a/redis-stable/tests/unit/scripting.tcl
+++ /dev/null
@@ -1,940 +0,0 @@
-start_server {tags {"scripting"}} {
-    test {EVAL - Does Lua interpreter replies to our requests?} {
-        r eval {return 'hello'} 0
-    } {hello}
-
-    test {EVAL - Lua integer -> Redis protocol type conversion} {
-        r eval {return 100.5} 0
-    } {100}
-
-    test {EVAL - Lua string -> Redis protocol type conversion} {
-        r eval {return 'hello world'} 0
-    } {hello world}
-
-    test {EVAL - Lua true boolean -> Redis protocol type conversion} {
-        r eval {return true} 0
-    } {1}
-
-    test {EVAL - Lua false boolean -> Redis protocol type conversion} {
-        r eval {return false} 0
-    } {}
-
-    test {EVAL - Lua status code reply -> Redis protocol type conversion} {
-        r eval {return {ok='fine'}} 0
-    } {fine}
-
-    test {EVAL - Lua error reply -> Redis protocol type conversion} {
-        catch {
-            r eval {return {err='this is an error'}} 0
-        } e
-        set _ $e
-    } {this is an error}
-
-    test {EVAL - Lua table -> Redis protocol type conversion} {
-        r eval {return {1,2,3,'ciao',{1,2}}} 0
-    } {1 2 3 ciao {1 2}}
-
-    test {EVAL - Are the KEYS and ARGV arrays populated correctly?} {
-        r eval {return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}} 2 a b c d
-    } {a b c d}
-
-    test {EVAL - is Lua able to call Redis API?} {
-        r set mykey myval
-        r eval {return redis.call('get',KEYS[1])} 1 mykey
-    } {myval}
-
-    test {EVALSHA - Can we call a SHA1 if already defined?} {
-        r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey
-    } {myval}
-
-    test {EVALSHA - Can we call a SHA1 in uppercase?} {
-        r evalsha FD758D1589D044DD850A6F05D52F2EEFD27F033F 1 mykey
-    } {myval}
-
-    test {EVALSHA - Do we get an error on invalid SHA1?} {
-        catch {r evalsha NotValidShaSUM 0} e
-        set _ $e
-    } {NOSCRIPT*}
-
-    test {EVALSHA - Do we get an error on non defined SHA1?} {
-        catch {r evalsha ffd632c7d33e571e9f24556ebed26c3479a87130 0} e
-        set _ $e
-    } {NOSCRIPT*}
-
-    test {EVAL - Redis integer -> Lua type conversion} {
-        r set x 0
-        r eval {
-            local foo = redis.pcall('incr',KEYS[1])
-            return {type(foo),foo}
-        } 1 x
-    } {number 1}
-
-    test {EVAL - Redis bulk -> Lua type conversion} {
-        r set mykey myval
-        r eval {
-            local foo = redis.pcall('get',KEYS[1])
-            return {type(foo),foo}
-        } 1 mykey
-    } {string myval}
-
-    test {EVAL - Redis multi bulk -> Lua type conversion} {
-        r del mylist
-        r rpush mylist a
-        r rpush mylist b
-        r rpush mylist c
-        r eval {
-            local foo = redis.pcall('lrange',KEYS[1],0,-1)
-            return {type(foo),foo[1],foo[2],foo[3],# foo}
-        } 1 mylist
-    } {table a b c 3}
-
-    test {EVAL - Redis status reply -> Lua type conversion} {
-        r eval {
-            local foo = redis.pcall('set',KEYS[1],'myval')
-            return {type(foo),foo['ok']}
-        } 1 mykey
-    } {table OK}
-
-    test {EVAL - Redis error reply -> Lua type conversion} {
-        r set mykey myval
-        r eval {
-            local foo = redis.pcall('incr',KEYS[1])
-            return {type(foo),foo['err']}
-        } 1 mykey
-    } {table {ERR value is not an integer or out of range}}
-
-    test {EVAL - Redis nil bulk reply -> Lua type conversion} {
-        r del mykey
-        r eval {
-            local foo = redis.pcall('get',KEYS[1])
-            return {type(foo),foo == false}
-        } 1 mykey
-    } {boolean 1}
-
-    test {EVAL - Is the Lua client using the currently selected DB?} {
-        r set mykey "this is DB 9"
-        r select 10
-        r set mykey "this is DB 10"
-        r eval {return redis.pcall('get',KEYS[1])} 1 mykey
-    } {this is DB 10}
-
-    test {EVAL - SELECT inside Lua should not affect the caller} {
-        # here we DB 10 is selected
-        r set mykey "original value"
-        r eval {return redis.pcall('select','9')} 0
-        set res [r get mykey]
-        r select 9
-        set res
-    } {original value}
-
-    if 0 {
-        test {EVAL - Script can't run more than configured time limit} {
-            r config set lua-time-limit 1
-            catch {
-                r eval {
-                    local i = 0
-                    while true do i=i+1 end
-                } 0
-            } e
-            set _ $e
-        } {*execution time*}
-    }
-
-    test {EVAL - Scripts can't run blpop command} {
-        set e {}
-        catch {r eval {return redis.pcall('blpop','x',0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run brpop command} {
-        set e {}
-        catch {r eval {return redis.pcall('brpop','empty_list',0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run brpoplpush command} {
-        set e {}
-        catch {r eval {return redis.pcall('brpoplpush','empty_list1', 'empty_list2',0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run blmove command} {
-        set e {}
-        catch {r eval {return redis.pcall('blmove','empty_list1', 'empty_list2', 'LEFT', 'LEFT', 0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run bzpopmin command} {
-        set e {}
-        catch {r eval {return redis.pcall('bzpopmin','empty_zset', 0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run bzpopmax command} {
-        set e {}
-        catch {r eval {return redis.pcall('bzpopmax','empty_zset', 0)} 0} e
-        set e
-    } {*not allowed*}
-
-    test {EVAL - Scripts can't run XREAD and XREADGROUP with BLOCK option} {
-        r del s
-        r xgroup create s g $ MKSTREAM
-        set res [r eval {return redis.pcall('xread','STREAMS','s','$')} 1 s]
-        assert {$res eq {}}
-        assert_error "*xread command is not allowed with BLOCK option from scripts" {r eval {return redis.pcall('xread','BLOCK',0,'STREAMS','s','$')} 1 s}
-        set res [r eval {return redis.pcall('xreadgroup','group','g','c','STREAMS','s','>')} 1 s]
-        assert {$res eq {}}
-        assert_error "*xreadgroup command is not allowed with BLOCK option from scripts" {r eval {return redis.pcall('xreadgroup','group','g','c','BLOCK',0,'STREAMS','s','>')} 1 s}
-    }
-
-    test {EVAL - Scripts can't run certain commands} {
-        set e {}
-        r debug lua-always-replicate-commands 0
-        catch {
-            r eval "redis.pcall('randomkey'); return redis.pcall('set','x','ciao')" 0
-        } e
-        r debug lua-always-replicate-commands 1
-        set e
-    } {*not allowed after*}
-
-    test {EVAL - No arguments to redis.call/pcall is considered an error} {
-        set e {}
-        catch {r eval {return redis.call()} 0} e
-        set e
-    } {*one argument*}
-
-    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
-        set e {}
-        catch {
-            r eval "redis.call('nosuchcommand')" 0
-        } e
-        set e
-    } {*Unknown Redis*}
-
-    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
-        set e {}
-        catch {
-            r eval "redis.call('get','a','b','c')" 0
-        } e
-        set e
-    } {*number of args*}
-
-    test {EVAL - redis.call variant raises a Lua error on Redis cmd error (1)} {
-        set e {}
-        r set foo bar
-        catch {
-            r eval {redis.call('lpush',KEYS[1],'val')} 1 foo
-        } e
-        set e
-    } {*against a key*}
-
-    test {EVAL - JSON numeric decoding} {
-        # We must return the table as a string because otherwise
-        # Redis converts floats to ints and we get 0 and 1023 instead
-        # of 0.0003 and 1023.2 as the parsed output.
-        r eval {return
-                 table.concat(
-                   cjson.decode(
-                    "[0.0, -5e3, -1, 0.3e-3, 1023.2, 0e10]"), " ")
-        } 0
-    } {0 -5000 -1 0.0003 1023.2 0}
-
-    test {EVAL - JSON string decoding} {
-        r eval {local decoded = cjson.decode('{"keya": "a", "keyb": "b"}')
-                return {decoded.keya, decoded.keyb}
-        } 0
-    } {a b}
-
-    test {EVAL - cmsgpack can pack double?} {
-        r eval {local encoded = cmsgpack.pack(0.1)
-                local h = ""
-                for i = 1, #encoded do
-                    h = h .. string.format("%02x",string.byte(encoded,i))
-                end
-                return h
-        } 0
-    } {cb3fb999999999999a}
-
-    test {EVAL - cmsgpack can pack negative int64?} {
-        r eval {local encoded = cmsgpack.pack(-1099511627776)
-                local h = ""
-                for i = 1, #encoded do
-                    h = h .. string.format("%02x",string.byte(encoded,i))
-                end
-                return h
-        } 0
-    } {d3ffffff0000000000}
-
-    test {EVAL - cmsgpack can pack and unpack circular references?} {
-        r eval {local a = {x=nil,y=5}
-                local b = {x=a}
-                a['x'] = b
-                local encoded = cmsgpack.pack(a)
-                local h = ""
-                -- cmsgpack encodes to a depth of 16, but can't encode
-                -- references, so the encoded object has a deep copy recusive
-                -- depth of 16.
-                for i = 1, #encoded do
-                    h = h .. string.format("%02x",string.byte(encoded,i))
-                end
-                -- when unpacked, re.x.x != re because the unpack creates
-                -- individual tables down to a depth of 16.
-                -- (that's why the encoded output is so large)
-                local re = cmsgpack.unpack(encoded)
-                assert(re)
-                assert(re.x)
-                assert(re.x.x.y == re.y)
-                assert(re.x.x.x.x.y == re.y)
-                assert(re.x.x.x.x.x.x.y == re.y)
-                assert(re.x.x.x.x.x.x.x.x.x.x.y == re.y)
-                -- maximum working depth:
-                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.y == re.y)
-                -- now the last x would be b above and has no y
-                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x)
-                -- so, the final x.x is at the depth limit and was assigned nil
-                assert(re.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x.x == nil)
-                return {h, re.x.x.x.x.x.x.x.x.y == re.y, re.y == 5}
-        } 0
-    } {82a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a17882a17905a17881a178c0 1 1}
-
-    test {EVAL - Numerical sanity check from bitop} {
-        r eval {assert(0x7fffffff == 2147483647, "broken hex literals");
-                assert(0xffffffff == -1 or 0xffffffff == 2^32-1,
-                    "broken hex literals");
-                assert(tostring(-1) == "-1", "broken tostring()");
-                assert(tostring(0xffffffff) == "-1" or
-                    tostring(0xffffffff) == "4294967295",
-                    "broken tostring()")
-        } 0
-    } {}
-
-    test {EVAL - Verify minimal bitop functionality} {
-        r eval {assert(bit.tobit(1) == 1);
-                assert(bit.band(1) == 1);
-                assert(bit.bxor(1,2) == 3);
-                assert(bit.bor(1,2,4,8,16,32,64,128) == 255)
-        } 0
-    } {}
-
-    test {EVAL - Able to parse trailing comments} {
-        r eval {return 'hello' --trailing comment} 0
-    } {hello}
-
-    test {SCRIPTING FLUSH - is able to clear the scripts cache?} {
-        r set mykey myval
-        set v [r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey]
-        assert_equal $v myval
-        set e ""
-        r script flush
-        catch {r evalsha fd758d1589d044dd850a6f05d52f2eefd27f033f 1 mykey} e
-        set e
-    } {NOSCRIPT*}
-
-    test {SCRIPTING FLUSH ASYNC} {
-        for {set j 0} {$j < 100} {incr j} {
-            r script load "return $j"
-        }
-        assert { [string match "*number_of_cached_scripts:100*" [r info Memory]] }
-        r script flush async
-        assert { [string match "*number_of_cached_scripts:0*" [r info Memory]] }
-    }
-
-    test {SCRIPT EXISTS - can detect already defined scripts?} {
-        r eval "return 1+1" 0
-        r script exists a27e7e8a43702b7046d4f6a7ccf5b60cef6b9bd9 a27e7e8a43702b7046d4f6a7ccf5b60cef6b9bda
-    } {1 0}
-
-    test {SCRIPT LOAD - is able to register scripts in the scripting cache} {
-        list \
-            [r script load "return 'loaded'"] \
-            [r evalsha b534286061d4b9e4026607613b95c06c06015ae8 0]
-    } {b534286061d4b9e4026607613b95c06c06015ae8 loaded}
-
-    test "In the context of Lua the output of random commands gets ordered" {
-        r debug lua-always-replicate-commands 0
-        r del myset
-        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
-        set res [r eval {return redis.call('smembers',KEYS[1])} 1 myset]
-        r debug lua-always-replicate-commands 1
-        set res
-    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
-
-    test "SORT is normally not alpha re-ordered for the scripting engine" {
-        r del myset
-        r sadd myset 1 2 3 4 10
-        r eval {return redis.call('sort',KEYS[1],'desc')} 1 myset
-    } {10 4 3 2 1}
-
-    test "SORT BY <constant> output gets ordered for scripting" {
-        r del myset
-        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
-        r eval {return redis.call('sort',KEYS[1],'by','_')} 1 myset
-    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
-
-    test "SORT BY <constant> with GET gets ordered for scripting" {
-        r del myset
-        r sadd myset a b c
-        r eval {return redis.call('sort',KEYS[1],'by','_','get','#','get','_:*')} 1 myset
-    } {a {} b {} c {}}
-
-    test "redis.sha1hex() implementation" {
-        list [r eval {return redis.sha1hex('')} 0] \
-             [r eval {return redis.sha1hex('Pizza & Mandolino')} 0]
-    } {da39a3ee5e6b4b0d3255bfef95601890afd80709 74822d82031af7493c20eefa13bd07ec4fada82f}
-
-    test {Globals protection reading an undeclared global variable} {
-        catch {r eval {return a} 0} e
-        set e
-    } {*ERR*attempted to access * global*}
-
-    test {Globals protection setting an undeclared global*} {
-        catch {r eval {a=10} 0} e
-        set e
-    } {*ERR*attempted to create global*}
-
-    test {Test an example script DECR_IF_GT} {
-        set decr_if_gt {
-            local current
-
-            current = redis.call('get',KEYS[1])
-            if not current then return nil end
-            if current > ARGV[1] then
-                return redis.call('decr',KEYS[1])
-            else
-                return redis.call('get',KEYS[1])
-            end
-        }
-        r set foo 5
-        set res {}
-        lappend res [r eval $decr_if_gt 1 foo 2]
-        lappend res [r eval $decr_if_gt 1 foo 2]
-        lappend res [r eval $decr_if_gt 1 foo 2]
-        lappend res [r eval $decr_if_gt 1 foo 2]
-        lappend res [r eval $decr_if_gt 1 foo 2]
-        set res
-    } {4 3 2 2 2}
-
-    test {Scripting engine resets PRNG at every script execution} {
-        set rand1 [r eval {return tostring(math.random())} 0]
-        set rand2 [r eval {return tostring(math.random())} 0]
-        assert_equal $rand1 $rand2
-    }
-
-    test {Scripting engine PRNG can be seeded correctly} {
-        set rand1 [r eval {
-            math.randomseed(ARGV[1]); return tostring(math.random())
-        } 0 10]
-        set rand2 [r eval {
-            math.randomseed(ARGV[1]); return tostring(math.random())
-        } 0 10]
-        set rand3 [r eval {
-            math.randomseed(ARGV[1]); return tostring(math.random())
-        } 0 20]
-        assert_equal $rand1 $rand2
-        assert {$rand2 ne $rand3}
-    }
-
-    test {EVAL does not leak in the Lua stack} {
-        r set x 0
-        # Use a non blocking client to speedup the loop.
-        set rd [redis_deferring_client]
-        for {set j 0} {$j < 10000} {incr j} {
-            $rd eval {return redis.call("incr",KEYS[1])} 1 x
-        }
-        for {set j 0} {$j < 10000} {incr j} {
-            $rd read
-        }
-        assert {[s used_memory_lua] < 1024*100}
-        $rd close
-        r get x
-    } {10000}
-
-    test {EVAL processes writes from AOF in read-only slaves} {
-        r flushall
-        r config set appendonly yes
-        r config set aof-use-rdb-preamble no
-        r eval {redis.call("set",KEYS[1],"100")} 1 foo
-        r eval {redis.call("incr",KEYS[1])} 1 foo
-        r eval {redis.call("incr",KEYS[1])} 1 foo
-        wait_for_condition 50 100 {
-            [s aof_rewrite_in_progress] == 0
-        } else {
-            fail "AOF rewrite can't complete after CONFIG SET appendonly yes."
-        }
-        r config set slave-read-only yes
-        r slaveof 127.0.0.1 0
-        r debug loadaof
-        set res [r get foo]
-        r slaveof no one
-        set res
-    } {102}
-    r config set aof-use-rdb-preamble yes
-
-    test {EVAL timeout from AOF} {
-        # generate a long running script that is propagated to the AOF as script
-        # make sure that the script times out during loading
-        r config set appendonly no
-        r config set aof-use-rdb-preamble no
-        r config set lua-replicate-commands no
-        r flushall
-        r config set appendonly yes
-        wait_for_condition 50 100 {
-            [s aof_rewrite_in_progress] == 0
-        } else {
-            fail "AOF rewrite can't complete after CONFIG SET appendonly yes."
-        }
-        r config set lua-time-limit 1
-        set rd [redis_deferring_client]
-        set start [clock clicks -milliseconds]
-        $rd eval {redis.call('set',KEYS[1],'y'); for i=1,1500000 do redis.call('ping') end return 'ok'} 1 x
-        $rd flush
-        after 100
-        catch {r ping} err
-        assert_match {BUSY*} $err
-        $rd read
-        set elapsed [expr [clock clicks -milliseconds]-$start]
-        if {$::verbose} { puts "script took $elapsed milliseconds" }
-        set start [clock clicks -milliseconds]
-        $rd debug loadaof
-        $rd flush
-        after 100
-        catch {r ping} err
-        assert_match {LOADING*} $err
-        $rd read
-        set elapsed [expr [clock clicks -milliseconds]-$start]
-        if {$::verbose} { puts "loading took $elapsed milliseconds" }
-        $rd close
-        r get x
-    } {y}
-
-    test {We can call scripts rewriting client->argv from Lua} {
-        r del myset
-        r sadd myset a b c
-        r mset a 1 b 2 c 3 d 4
-        assert {[r spop myset] ne {}}
-        assert {[r spop myset 1] ne {}}
-        assert {[r spop myset] ne {}}
-        assert {[r mget a b c d] eq {1 2 3 4}}
-        assert {[r spop myset] eq {}}
-    }
-
-    test {Call Redis command with many args from Lua (issue #1764)} {
-        r eval {
-            local i
-            local x={}
-            redis.call('del','mylist')
-            for i=1,100 do
-                table.insert(x,i)
-            end
-            redis.call('rpush','mylist',unpack(x))
-            return redis.call('lrange','mylist',0,-1)
-        } 0
-    } {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100}
-
-    test {Number conversion precision test (issue #1118)} {
-        r eval {
-              local value = 9007199254740991
-              redis.call("set","foo",value)
-              return redis.call("get","foo")
-        } 0
-    } {9007199254740991}
-
-    test {String containing number precision test (regression of issue #1118)} {
-        r eval {
-            redis.call("set", "key", "12039611435714932082")
-            return redis.call("get", "key")
-        } 0
-    } {12039611435714932082}
-
-    test {Verify negative arg count is error instead of crash (issue #1842)} {
-        catch { r eval { return "hello" } -12 } e
-        set e
-    } {ERR Number of keys can't be negative}
-
-    test {Correct handling of reused argv (issue #1939)} {
-        r eval {
-              for i = 0, 10 do
-                  redis.call('SET', 'a', '1')
-                  redis.call('MGET', 'a', 'b', 'c')
-                  redis.call('EXPIRE', 'a', 0)
-                  redis.call('GET', 'a')
-                  redis.call('MGET', 'a', 'b', 'c')
-              end
-        } 0
-    }
-
-    test {Functions in the Redis namespace are able to report errors} {
-        catch {
-            r eval {
-                  redis.sha1hex()
-            } 0
-        } e
-        set e
-    } {*wrong number*}
-
-    test {Script with RESP3 map} {
-        set expected_dict [dict create field value]
-        set expected_list [list field value]
-
-        # Sanity test for RESP3 without scripts
-        r HELLO 3
-        r hset hash field value
-        set res [r hgetall hash]
-        assert_equal $res $expected_dict
-
-        # Test RESP3 client with script in both RESP2 and RESP3 modes
-        set res [r eval {redis.setresp(3); return redis.call('hgetall', KEYS[1])} 1 hash]
-        assert_equal $res $expected_dict
-        set res [r eval {redis.setresp(2); return redis.call('hgetall', KEYS[1])} 1 hash]
-        assert_equal $res $expected_list
-
-        # Test RESP2 client with script in both RESP2 and RESP3 modes
-        r HELLO 2
-        set res [r eval {redis.setresp(3); return redis.call('hgetall', KEYS[1])} 1 hash]
-        assert_equal $res $expected_list
-        set res [r eval {redis.setresp(2); return redis.call('hgetall', KEYS[1])} 1 hash]
-        assert_equal $res $expected_list
-    }
-}
-
-# Start a new server since the last test in this stanza will kill the
-# instance at all.
-start_server {tags {"scripting"}} {
-    test {Timedout read-only scripts can be killed by SCRIPT KILL} {
-        set rd [redis_deferring_client]
-        r config set lua-time-limit 10
-        $rd eval {while true do end} 0
-        after 200
-        catch {r ping} e
-        assert_match {BUSY*} $e
-        r script kill
-        after 200 ; # Give some time to Lua to call the hook again...
-        assert_equal [r ping] "PONG"
-    }
-
-    test {Timedout read-only scripts can be killed by SCRIPT KILL even when use pcall} {
-        set rd [redis_deferring_client]
-        r config set lua-time-limit 10
-        $rd eval {local f = function() while 1 do redis.call('ping') end end while 1 do pcall(f) end} 0
-        
-        wait_for_condition 50 100 {
-            [catch {r ping} e] == 1
-        } else {
-            fail "Can't wait for script to start running"
-        }
-        catch {r ping} e
-        assert_match {BUSY*} $e
-
-        r script kill
-
-        wait_for_condition 50 100 {
-            [catch {r ping} e] == 0
-        } else {
-            fail "Can't wait for script to be killed"
-        }
-        assert_equal [r ping] "PONG"
-
-        catch {$rd read} res
-        $rd close
-
-        assert_match {*killed by user*} $res        
-    }
-
-    test {Timedout script does not cause a false dead client} {
-        set rd [redis_deferring_client]
-        r config set lua-time-limit 10
-
-        # senging (in a pipeline):
-        # 1. eval "while 1 do redis.call('ping') end" 0
-        # 2. ping
-        set buf "*3\r\n\$4\r\neval\r\n\$33\r\nwhile 1 do redis.call('ping') end\r\n\$1\r\n0\r\n"
-        append buf "*1\r\n\$4\r\nping\r\n"
-        $rd write $buf
-        $rd flush
-
-        wait_for_condition 50 100 {
-            [catch {r ping} e] == 1
-        } else {
-            fail "Can't wait for script to start running"
-        }
-        catch {r ping} e
-        assert_match {BUSY*} $e
-
-        r script kill
-        wait_for_condition 50 100 {
-            [catch {r ping} e] == 0
-        } else {
-            fail "Can't wait for script to be killed"
-        }
-        assert_equal [r ping] "PONG"
-
-        catch {$rd read} res
-        assert_match {*killed by user*} $res
-
-        set res [$rd read]
-        assert_match {*PONG*} $res        
-
-        $rd close
-    }
-
-    test {Timedout script link is still usable after Lua returns} {
-        r config set lua-time-limit 10
-        r eval {for i=1,100000 do redis.call('ping') end return 'ok'} 0
-        r ping
-    } {PONG}
-
-    test {Timedout scripts that modified data can't be killed by SCRIPT KILL} {
-        set rd [redis_deferring_client]
-        r config set lua-time-limit 10
-        $rd eval {redis.call('set',KEYS[1],'y'); while true do end} 1 x
-        after 200
-        catch {r ping} e
-        assert_match {BUSY*} $e
-        catch {r script kill} e
-        assert_match {UNKILLABLE*} $e
-        catch {r ping} e
-        assert_match {BUSY*} $e
-    }
-
-    # Note: keep this test at the end of this server stanza because it
-    # kills the server.
-    test {SHUTDOWN NOSAVE can kill a timedout script anyway} {
-        # The server should be still unresponding to normal commands.
-        catch {r ping} e
-        assert_match {BUSY*} $e
-        catch {r shutdown nosave}
-        # Make sure the server was killed
-        catch {set rd [redis_deferring_client]} e
-        assert_match {*connection refused*} $e
-    }
-}
-
-foreach cmdrepl {0 1} {
-    start_server {tags {"scripting repl"}} {
-        start_server {} {
-            if {$cmdrepl == 1} {
-                set rt "(commands replication)"
-            } else {
-                set rt "(scripts replication)"
-                r debug lua-always-replicate-commands 1
-            }
-
-            test "Before the replica connects we issue two EVAL commands $rt" {
-                # One with an error, but still executing a command.
-                # SHA is: 67164fc43fa971f76fd1aaeeaf60c1c178d25876
-                catch {
-                    r eval {redis.call('incr',KEYS[1]); redis.call('nonexisting')} 1 x
-                }
-                # One command is correct:
-                # SHA is: 6f5ade10a69975e903c6d07b10ea44c6382381a5
-                r eval {return redis.call('incr',KEYS[1])} 1 x
-            } {2}
-
-            test "Connect a replica to the master instance $rt" {
-                r -1 slaveof [srv 0 host] [srv 0 port]
-                wait_for_condition 50 100 {
-                    [s -1 role] eq {slave} &&
-                    [string match {*master_link_status:up*} [r -1 info replication]]
-                } else {
-                    fail "Can't turn the instance into a replica"
-                }
-            }
-
-            test "Now use EVALSHA against the master, with both SHAs $rt" {
-                # The server should replicate successful and unsuccessful
-                # commands as EVAL instead of EVALSHA.
-                catch {
-                    r evalsha 67164fc43fa971f76fd1aaeeaf60c1c178d25876 1 x
-                }
-                r evalsha 6f5ade10a69975e903c6d07b10ea44c6382381a5 1 x
-            } {4}
-
-            test "If EVALSHA was replicated as EVAL, 'x' should be '4' $rt" {
-                wait_for_condition 50 100 {
-                    [r -1 get x] eq {4}
-                } else {
-                    fail "Expected 4 in x, but value is '[r -1 get x]'"
-                }
-            }
-
-            test "Replication of script multiple pushes to list with BLPOP $rt" {
-                set rd [redis_deferring_client]
-                $rd brpop a 0
-                r eval {
-                    redis.call("lpush",KEYS[1],"1");
-                    redis.call("lpush",KEYS[1],"2");
-                } 1 a
-                set res [$rd read]
-                $rd close
-                wait_for_condition 50 100 {
-                    [r -1 lrange a 0 -1] eq [r lrange a 0 -1]
-                } else {
-                    fail "Expected list 'a' in replica and master to be the same, but they are respectively '[r -1 lrange a 0 -1]' and '[r lrange a 0 -1]'"
-                }
-                set res
-            } {a 1}
-
-            test "EVALSHA replication when first call is readonly $rt" {
-                r del x
-                r eval {if tonumber(ARGV[1]) > 0 then redis.call('incr', KEYS[1]) end} 1 x 0
-                r evalsha 6e0e2745aa546d0b50b801a20983b70710aef3ce 1 x 0
-                r evalsha 6e0e2745aa546d0b50b801a20983b70710aef3ce 1 x 1
-                wait_for_condition 50 100 {
-                    [r -1 get x] eq {1}
-                } else {
-                    fail "Expected 1 in x, but value is '[r -1 get x]'"
-                }
-            }
-
-            test "Lua scripts using SELECT are replicated correctly $rt" {
-                r eval {
-                    redis.call("set","foo1","bar1")
-                    redis.call("select","10")
-                    redis.call("incr","x")
-                    redis.call("select","11")
-                    redis.call("incr","z")
-                } 0
-                r eval {
-                    redis.call("set","foo1","bar1")
-                    redis.call("select","10")
-                    redis.call("incr","x")
-                    redis.call("select","11")
-                    redis.call("incr","z")
-                } 0
-                wait_for_condition 50 100 {
-                    [r -1 debug digest] eq [r debug digest]
-                } else {
-                    fail "Master-Replica desync after Lua script using SELECT."
-                }
-            }
-        }
-    }
-}
-
-start_server {tags {"scripting repl"}} {
-    start_server {overrides {appendonly yes aof-use-rdb-preamble no}} {
-        test "Connect a replica to the master instance" {
-            r -1 slaveof [srv 0 host] [srv 0 port]
-            wait_for_condition 50 100 {
-                [s -1 role] eq {slave} &&
-                [string match {*master_link_status:up*} [r -1 info replication]]
-            } else {
-                fail "Can't turn the instance into a replica"
-            }
-        }
-
-        test "Redis.replicate_commands() must be issued before any write" {
-            r eval {
-                redis.call('set','foo','bar');
-                return redis.replicate_commands();
-            } 0
-        } {}
-
-        test "Redis.replicate_commands() must be issued before any write (2)" {
-            r eval {
-                return redis.replicate_commands();
-            } 0
-        } {1}
-
-        test "Redis.set_repl() must be issued after replicate_commands()" {
-            r debug lua-always-replicate-commands 0
-            catch {
-                r eval {
-                    redis.set_repl(redis.REPL_ALL);
-                } 0
-            } e
-            r debug lua-always-replicate-commands 1
-            set e
-        } {*only after turning on*}
-
-        test "Redis.set_repl() don't accept invalid values" {
-            catch {
-                r eval {
-                    redis.replicate_commands();
-                    redis.set_repl(12345);
-                } 0
-            } e
-            set e
-        } {*Invalid*flags*}
-
-        test "Test selective replication of certain Redis commands from Lua" {
-            r del a b c d
-            r eval {
-                redis.replicate_commands();
-                redis.call('set','a','1');
-                redis.set_repl(redis.REPL_NONE);
-                redis.call('set','b','2');
-                redis.set_repl(redis.REPL_AOF);
-                redis.call('set','c','3');
-                redis.set_repl(redis.REPL_ALL);
-                redis.call('set','d','4');
-            } 0
-
-            wait_for_condition 50 100 {
-                [r -1 mget a b c d] eq {1 {} {} 4}
-            } else {
-                fail "Only a and c should be replicated to replica"
-            }
-
-            # Master should have everything right now
-            assert {[r mget a b c d] eq {1 2 3 4}}
-
-            # After an AOF reload only a, c and d should exist
-            r debug loadaof
-
-            assert {[r mget a b c d] eq {1 {} 3 4}}
-        }
-
-        test "PRNG is seeded randomly for command replication" {
-            set a [
-                r eval {
-                    redis.replicate_commands();
-                    return math.random()*100000;
-                } 0
-            ]
-            set b [
-                r eval {
-                    redis.replicate_commands();
-                    return math.random()*100000;
-                } 0
-            ]
-            assert {$a ne $b}
-        }
-
-        test "Using side effects is not a problem with command replication" {
-            r eval {
-                redis.replicate_commands();
-                redis.call('set','time',redis.call('time')[1])
-            } 0
-
-            assert {[r get time] ne {}}
-
-            wait_for_condition 50 100 {
-                [r get time] eq [r -1 get time]
-            } else {
-                fail "Time key does not match between master and replica"
-            }
-        }
-    }
-}
-
-start_server {tags {"scripting"}} {
-    r script debug sync
-    r eval {return 'hello'} 0
-    r eval {return 'hello'} 0
-}
-
-start_server {tags {"scripting needs:debug external:skip"}} {
-    test {Test scripting debug protocol parsing} {
-        r script debug sync
-        r eval {return 'hello'} 0
-        catch {r 'hello\0world'} e
-        assert_match {*Unknown Redis Lua debugger command*} $e
-        catch {r 'hello\0'} e
-        assert_match {*Unknown Redis Lua debugger command*} $e
-        catch {r '\0hello'} e
-        assert_match {*Unknown Redis Lua debugger command*} $e
-        catch {r '\0hello\0'} e
-        assert_match {*Unknown Redis Lua debugger command*} $e
-    }
-}
diff --git a/redis-stable/tests/unit/shutdown.tcl b/redis-stable/tests/unit/shutdown.tcl
deleted file mode 100644
index f48eadc5..00000000
--- a/redis-stable/tests/unit/shutdown.tcl
+++ /dev/null
@@ -1,57 +0,0 @@
-start_server {tags {"shutdown"}} {
-    test {Temp rdb will be deleted if we use bg_unlink when shutdown} {
-        for {set i 0} {$i < 20} {incr i} {
-            r set $i $i
-        }
-        # It will cost 2s(20 * 100ms) to dump rdb
-        r config set rdb-key-save-delay 100000
-
-        # Child is dumping rdb
-        r bgsave
-        after 100
-        set dir [lindex [r config get dir] 1]
-        set child_pid [get_child_pid 0]
-        set temp_rdb [file join [lindex [r config get dir] 1] temp-${child_pid}.rdb]
-        # Temp rdb must be existed
-        assert {[file exists $temp_rdb]}
-
-        catch {r shutdown nosave}
-        # Make sure the server was killed
-        catch {set rd [redis_deferring_client]} e
-        assert_match {*connection refused*} $e
-
-        # Temp rdb file must be deleted
-        assert {![file exists $temp_rdb]}
-    }
-}
-
-start_server {tags {"shutdown"}} {
-    test {Temp rdb will be deleted in signal handle} {
-        for {set i 0} {$i < 20} {incr i} {
-            r set $i $i
-        }
-        # It will cost 2s (20 * 100ms) to dump rdb
-        r config set rdb-key-save-delay 100000
-        
-        set pid [s process_id]
-        set temp_rdb [file join [lindex [r config get dir] 1] temp-${pid}.rdb]
-
-        # trigger a shutdown which will save an rdb
-        exec kill -SIGINT $pid
-        # Wait for creation of temp rdb
-        wait_for_condition 50 10 {
-            [file exists $temp_rdb]
-        } else {
-            fail "Can't trigger rdb save on shutdown"
-        }
-
-        # Insist on immediate shutdown, temp rdb file must be deleted
-        exec kill -SIGINT $pid
-        # wait for the rdb file to be deleted
-        wait_for_condition 50 10 {
-            ![file exists $temp_rdb]
-        } else {
-            fail "Can't trigger rdb save on shutdown"
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/slowlog.tcl b/redis-stable/tests/unit/slowlog.tcl
deleted file mode 100644
index 9f6e248e..00000000
--- a/redis-stable/tests/unit/slowlog.tcl
+++ /dev/null
@@ -1,177 +0,0 @@
-start_server {tags {"slowlog"} overrides {slowlog-log-slower-than 1000000}} {
-    test {SLOWLOG - check that it starts with an empty log} {
-        r slowlog len
-    } {0}
-
-    test {SLOWLOG - only logs commands taking more time than specified} {
-        r config set slowlog-log-slower-than 100000
-        r ping
-        assert_equal [r slowlog len] 0
-        r debug sleep 0.2
-        assert_equal [r slowlog len] 1
-    }
-
-    test {SLOWLOG - max entries is correctly handled} {
-        r config set slowlog-log-slower-than 0
-        r config set slowlog-max-len 10
-        for {set i 0} {$i < 100} {incr i} {
-            r ping
-        }
-        r slowlog len
-    } {10}
-
-    test {SLOWLOG - GET optional argument to limit output len works} {
-        llength [r slowlog get 5]
-    } {5}
-
-    test {SLOWLOG - RESET subcommand works} {
-        r config set slowlog-log-slower-than 100000
-        r slowlog reset
-        r slowlog len
-    } {0}
-
-    test {SLOWLOG - logged entry sanity check} {
-        r client setname foobar
-        r debug sleep 0.2
-        set e [lindex [r slowlog get] 0]
-        assert_equal [llength $e] 6
-        assert_equal [lindex $e 0] 105
-        assert_equal [expr {[lindex $e 2] > 100000}] 1
-        assert_equal [lindex $e 3] {debug sleep 0.2}
-        assert_equal {foobar} [lindex $e 5]
-    }
-
-    test {SLOWLOG - Certain commands are omitted that contain sensitive information} {
-        r config set slowlog-log-slower-than 0
-        r slowlog reset
-        r config set masterauth ""
-        r acl setuser slowlog-test-user +get +set
-        r config set slowlog-log-slower-than 0
-        r config set slowlog-log-slower-than 10000
-        set slowlog_resp [r slowlog get]
-
-        # Make sure normal configs work, but the two sensitive
-        # commands are omitted or redacted
-        assert_equal 4 [llength $slowlog_resp]
-        assert_equal {slowlog reset} [lindex [lindex [r slowlog get] 3] 3]
-        assert_equal {config set masterauth (redacted)} [lindex [lindex [r slowlog get] 2] 3]
-        assert_equal {acl setuser (redacted) (redacted) (redacted)} [lindex [lindex [r slowlog get] 1] 3]
-        assert_equal {config set slowlog-log-slower-than 0} [lindex [lindex [r slowlog get] 0] 3]
-    }
-
-    test {SLOWLOG - Some commands can redact sensitive fields} {
-        r config set slowlog-log-slower-than 0
-        r slowlog reset
-        r migrate [srv 0 host] [srv 0 port] key 9 5000
-        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH user
-        r migrate [srv 0 host] [srv 0 port] key 9 5000 AUTH2 user password
-
-        r config set slowlog-log-slower-than 10000
-        # Make sure all 3 commands were logged, but the sensitive fields are omitted
-        assert_equal 4 [llength [r slowlog get]]
-        assert_match {* key 9 5000} [lindex [lindex [r slowlog get] 2] 3]
-        assert_match {* key 9 5000 AUTH (redacted)} [lindex [lindex [r slowlog get] 1] 3]
-        assert_match {* key 9 5000 AUTH2 (redacted) (redacted)} [lindex [lindex [r slowlog get] 0] 3]
-    }
-
-    test {SLOWLOG - Rewritten commands are logged as their original command} {
-        r config set slowlog-log-slower-than 0
-
-        # Test rewriting client arguments
-        r sadd set a b c d e
-        r slowlog reset
-
-        # SPOP is rewritten as DEL when all keys are removed
-        r spop set 10
-        assert_equal {spop set 10} [lindex [lindex [r slowlog get] 0] 3]
-
-        # Test replacing client arguments
-        r slowlog reset
-
-        # GEOADD is replicated as ZADD
-        r geoadd cool-cities -122.33207 47.60621 Seattle
-        assert_equal {geoadd cool-cities -122.33207 47.60621 Seattle} [lindex [lindex [r slowlog get] 0] 3]
-
-        # Test replacing a single command argument
-        r set A 5
-        r slowlog reset
-        
-        # GETSET is replicated as SET
-        r getset a 5
-        assert_equal {getset a 5} [lindex [lindex [r slowlog get] 0] 3]
-
-        # INCRBYFLOAT calls rewrite multiple times, so it's a special case
-        r set A 0
-        r slowlog reset
-        
-        # INCRBYFLOAT is replicated as SET
-        r INCRBYFLOAT A 1.0
-        assert_equal {INCRBYFLOAT A 1.0} [lindex [lindex [r slowlog get] 0] 3]
-
-        # blocked BLPOP is replicated as LPOP
-        set rd [redis_deferring_client]
-        $rd blpop l 0
-        wait_for_condition 50 100 {
-            [s blocked_clients] eq {1}
-        } else {
-            fail "Clients are not blocked"
-        }
-        r multi
-        r lpush l foo
-        r slowlog reset
-        r exec
-        $rd read
-        $rd close
-        assert_equal {blpop l 0} [lindex [lindex [r slowlog get] 0] 3]
-    }
-
-    test {SLOWLOG - commands with too many arguments are trimmed} {
-        r config set slowlog-log-slower-than 0
-        r slowlog reset
-        r sadd set 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
-        set e [lindex [r slowlog get] 0]
-        lindex $e 3
-    } {sadd set 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 {... (2 more arguments)}}
-
-    test {SLOWLOG - too long arguments are trimmed} {
-        r config set slowlog-log-slower-than 0
-        r slowlog reset
-        set arg [string repeat A 129]
-        r sadd set foo $arg
-        set e [lindex [r slowlog get] 0]
-        lindex $e 3
-    } {sadd set foo {AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... (1 more bytes)}}
-
-    test {SLOWLOG - EXEC is not logged, just executed commands} {
-        r config set slowlog-log-slower-than 100000
-        r slowlog reset
-        assert_equal [r slowlog len] 0
-        r multi
-        r debug sleep 0.2
-        r exec
-        assert_equal [r slowlog len] 1
-        set e [lindex [r slowlog get] 0]
-        assert_equal [lindex $e 3] {debug sleep 0.2}
-    }
-
-    test {SLOWLOG - can clean older entries} {
-        r client setname lastentry_client
-        r config set slowlog-max-len 1
-        r debug sleep 0.2
-        assert {[llength [r slowlog get]] == 1}
-        set e [lindex [r slowlog get] 0]
-        assert_equal {lastentry_client} [lindex $e 5]
-    }
-
-    test {SLOWLOG - can be disabled} {
-        r config set slowlog-max-len 1
-        r config set slowlog-log-slower-than 1
-        r slowlog reset
-        r debug sleep 0.2
-        assert_equal [r slowlog len] 1
-        r config set slowlog-log-slower-than -1
-        r slowlog reset
-        r debug sleep 0.2
-        assert_equal [r slowlog len] 0
-    }
-}
diff --git a/redis-stable/tests/unit/sort.tcl b/redis-stable/tests/unit/sort.tcl
deleted file mode 100644
index 083c4540..00000000
--- a/redis-stable/tests/unit/sort.tcl
+++ /dev/null
@@ -1,318 +0,0 @@
-start_server {
-    tags {"sort"}
-    overrides {
-        "list-max-ziplist-size" 32
-        "set-max-intset-entries" 32
-    }
-} {
-    proc create_random_dataset {num cmd} {
-        set tosort {}
-        set result {}
-        array set seenrand {}
-        r del tosort
-        for {set i 0} {$i < $num} {incr i} {
-            # Make sure all the weights are different because
-            # Redis does not use a stable sort but Tcl does.
-            while 1 {
-                randpath {
-                    set rint [expr int(rand()*1000000)]
-                } {
-                    set rint [expr rand()]
-                }
-                if {![info exists seenrand($rint)]} break
-            }
-            set seenrand($rint) x
-            r $cmd tosort $i
-            r set weight_$i $rint
-            r hset wobj_$i weight $rint
-            lappend tosort [list $i $rint]
-        }
-        set sorted [lsort -index 1 -real $tosort]
-        for {set i 0} {$i < $num} {incr i} {
-            lappend result [lindex $sorted $i 0]
-        }
-        set _ $result
-    }
-
-    foreach {num cmd enc title} {
-        16 lpush quicklist "Old Ziplist"
-        1000 lpush quicklist "Old Linked list"
-        10000 lpush quicklist "Old Big Linked list"
-        16 sadd intset "Intset"
-        1000 sadd hashtable "Hash table"
-        10000 sadd hashtable "Big Hash table"
-    } {
-        set result [create_random_dataset $num $cmd]
-        assert_encoding $enc tosort
-
-        test "$title: SORT BY key" {
-            assert_equal $result [r sort tosort BY weight_*]
-        }
-
-        test "$title: SORT BY key with limit" {
-            assert_equal [lrange $result 5 9] [r sort tosort BY weight_* LIMIT 5 5]
-        }
-
-        test "$title: SORT BY hash field" {
-            assert_equal $result [r sort tosort BY wobj_*->weight]
-        }
-    }
-
-    set result [create_random_dataset 16 lpush]
-    test "SORT GET #" {
-        assert_equal [lsort -integer $result] [r sort tosort GET #]
-    }
-
-    test "SORT GET <const>" {
-        r del foo
-        set res [r sort tosort GET foo]
-        assert_equal 16 [llength $res]
-        foreach item $res { assert_equal {} $item }
-    }
-
-    test "SORT GET (key and hash) with sanity check" {
-        set l1 [r sort tosort GET # GET weight_*]
-        set l2 [r sort tosort GET # GET wobj_*->weight]
-        foreach {id1 w1} $l1 {id2 w2} $l2 {
-            assert_equal $id1 $id2
-            assert_equal $w1 [r get weight_$id1]
-            assert_equal $w2 [r get weight_$id1]
-        }
-    }
-
-    test "SORT BY key STORE" {
-        r sort tosort BY weight_* store sort-res
-        assert_equal $result [r lrange sort-res 0 -1]
-        assert_equal 16 [r llen sort-res]
-        assert_encoding quicklist sort-res
-    }
-
-    test "SORT BY hash field STORE" {
-        r sort tosort BY wobj_*->weight store sort-res
-        assert_equal $result [r lrange sort-res 0 -1]
-        assert_equal 16 [r llen sort-res]
-        assert_encoding quicklist sort-res
-    }
-
-    test "SORT extracts STORE correctly" {
-        r command getkeys sort abc store def
-    } {abc def}
-
-    test "SORT extracts multiple STORE correctly" {
-        r command getkeys sort abc store invalid store stillbad store def
-    } {abc def}
-
-    test "SORT DESC" {
-        assert_equal [lsort -decreasing -integer $result] [r sort tosort DESC]
-    }
-
-    test "SORT ALPHA against integer encoded strings" {
-        r del mylist
-        r lpush mylist 2
-        r lpush mylist 1
-        r lpush mylist 3
-        r lpush mylist 10
-        r sort mylist alpha
-    } {1 10 2 3}
-
-    test "SORT sorted set" {
-        r del zset
-        r zadd zset 1 a
-        r zadd zset 5 b
-        r zadd zset 2 c
-        r zadd zset 10 d
-        r zadd zset 3 e
-        r sort zset alpha desc
-    } {e d c b a}
-
-    test "SORT sorted set BY nosort should retain ordering" {
-        r del zset
-        r zadd zset 1 a
-        r zadd zset 5 b
-        r zadd zset 2 c
-        r zadd zset 10 d
-        r zadd zset 3 e
-        r multi
-        r sort zset by nosort asc
-        r sort zset by nosort desc
-        r exec
-    } {{a c e b d} {d b e c a}}
-
-    test "SORT sorted set BY nosort + LIMIT" {
-        r del zset
-        r zadd zset 1 a
-        r zadd zset 5 b
-        r zadd zset 2 c
-        r zadd zset 10 d
-        r zadd zset 3 e
-        assert_equal [r sort zset by nosort asc limit 0 1] {a}
-        assert_equal [r sort zset by nosort desc limit 0 1] {d}
-        assert_equal [r sort zset by nosort asc limit 0 2] {a c}
-        assert_equal [r sort zset by nosort desc limit 0 2] {d b}
-        assert_equal [r sort zset by nosort limit 5 10] {}
-        assert_equal [r sort zset by nosort limit -10 100] {a c e b d}
-    }
-
-    test "SORT sorted set BY nosort works as expected from scripts" {
-        r del zset
-        r zadd zset 1 a
-        r zadd zset 5 b
-        r zadd zset 2 c
-        r zadd zset 10 d
-        r zadd zset 3 e
-        r eval {
-            return {redis.call('sort',KEYS[1],'by','nosort','asc'),
-                    redis.call('sort',KEYS[1],'by','nosort','desc')}
-        } 1 zset
-    } {{a c e b d} {d b e c a}}
-
-    test "SORT sorted set: +inf and -inf handling" {
-        r del zset
-        r zadd zset -100 a
-        r zadd zset 200 b
-        r zadd zset -300 c
-        r zadd zset 1000000 d
-        r zadd zset +inf max
-        r zadd zset -inf min
-        r zrange zset 0 -1
-    } {min c a b d max}
-
-    test "SORT regression for issue #19, sorting floats" {
-        r flushdb
-        set floats {1.1 5.10 3.10 7.44 2.1 5.75 6.12 0.25 1.15}
-        foreach x $floats {
-            r lpush mylist $x
-        }
-        assert_equal [lsort -real $floats] [r sort mylist]
-    }
-
-    test "SORT with STORE returns zero if result is empty (github issue 224)" {
-        r flushdb
-        r sort foo store bar
-    } {0}
-
-    test "SORT with STORE does not create empty lists (github issue 224)" {
-        r flushdb
-        r lpush foo bar
-        r sort foo alpha limit 10 10 store zap
-        r exists zap
-    } {0}
-
-    test "SORT with STORE removes key if result is empty (github issue 227)" {
-        r flushdb
-        r lpush foo bar
-        r sort emptylist store foo
-        r exists foo
-    } {0}
-
-    test "SORT with BY <constant> and STORE should still order output" {
-        r del myset mylist
-        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
-        r sort myset alpha by _ store mylist
-        r lrange mylist 0 -1
-    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
-
-    test "SORT will complain with numerical sorting and bad doubles (1)" {
-        r del myset
-        r sadd myset 1 2 3 4 not-a-double
-        set e {}
-        catch {r sort myset} e
-        set e
-    } {*ERR*double*}
-
-    test "SORT will complain with numerical sorting and bad doubles (2)" {
-        r del myset
-        r sadd myset 1 2 3 4
-        r mset score:1 10 score:2 20 score:3 30 score:4 not-a-double
-        set e {}
-        catch {r sort myset by score:*} e
-        set e
-    } {*ERR*double*}
-
-    test "SORT BY sub-sorts lexicographically if score is the same" {
-        r del myset
-        r sadd myset a b c d e f g h i l m n o p q r s t u v z aa aaa azz
-        foreach ele {a aa aaa azz b c d e f g h i l m n o p q r s t u v z} {
-            set score:$ele 100
-        }
-        r sort myset by score:*
-    } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
-
-    test "SORT GET with pattern ending with just -> does not get hash field" {
-        r del mylist
-        r lpush mylist a
-        r set x:a-> 100
-        r sort mylist by num get x:*->
-    } {100}
-
-    test "SORT by nosort retains native order for lists" {
-        r del testa
-        r lpush testa 2 1 4 3 5
-        r sort testa by nosort
-    } {5 3 4 1 2}
-
-    test "SORT by nosort plus store retains native order for lists" {
-        r del testa
-        r lpush testa 2 1 4 3 5
-        r sort testa by nosort store testb
-        r lrange testb 0 -1
-    } {5 3 4 1 2}
-
-    test "SORT by nosort with limit returns based on original list order" {
-        r sort testa by nosort limit 0 3 store testb
-        r lrange testb 0 -1
-    } {5 3 4}
-
-    tags {"slow"} {
-        set num 100
-        set res [create_random_dataset $num lpush]
-
-        test "SORT speed, $num element list BY key, 100 times" {
-            set start [clock clicks -milliseconds]
-            for {set i 0} {$i < 100} {incr i} {
-                set sorted [r sort tosort BY weight_* LIMIT 0 10]
-            }
-            set elapsed [expr [clock clicks -milliseconds]-$start]
-            if {$::verbose} {
-                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
-                flush stdout
-            }
-        }
-
-        test "SORT speed, $num element list BY hash field, 100 times" {
-            set start [clock clicks -milliseconds]
-            for {set i 0} {$i < 100} {incr i} {
-                set sorted [r sort tosort BY wobj_*->weight LIMIT 0 10]
-            }
-            set elapsed [expr [clock clicks -milliseconds]-$start]
-            if {$::verbose} {
-                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
-                flush stdout
-            }
-        }
-
-        test "SORT speed, $num element list directly, 100 times" {
-            set start [clock clicks -milliseconds]
-            for {set i 0} {$i < 100} {incr i} {
-                set sorted [r sort tosort LIMIT 0 10]
-            }
-            set elapsed [expr [clock clicks -milliseconds]-$start]
-            if {$::verbose} {
-                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
-                flush stdout
-            }
-        }
-
-        test "SORT speed, $num element list BY <const>, 100 times" {
-            set start [clock clicks -milliseconds]
-            for {set i 0} {$i < 100} {incr i} {
-                set sorted [r sort tosort BY nokey LIMIT 0 10]
-            }
-            set elapsed [expr [clock clicks -milliseconds]-$start]
-            if {$::verbose} {
-                puts -nonewline "\n  Average time to sort: [expr double($elapsed)/100] milliseconds "
-                flush stdout
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/tls.tcl b/redis-stable/tests/unit/tls.tcl
deleted file mode 100644
index 29fe39fb..00000000
--- a/redis-stable/tests/unit/tls.tcl
+++ /dev/null
@@ -1,158 +0,0 @@
-start_server {tags {"tls"}} {
-    if {$::tls} {
-        package require tls
-
-        test {TLS: Not accepting non-TLS connections on a TLS port} {
-            set s [redis [srv 0 host] [srv 0 port]]
-            catch {$s PING} e
-            set e
-        } {*I/O error*}
-
-        test {TLS: Verify tls-auth-clients behaves as expected} {
-            set s [redis [srv 0 host] [srv 0 port]]
-            ::tls::import [$s channel]
-            catch {$s PING} e
-            assert_match {*error*} $e
-
-            r CONFIG SET tls-auth-clients no
-
-            set s [redis [srv 0 host] [srv 0 port]]
-            ::tls::import [$s channel]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            r CONFIG SET tls-auth-clients optional
-
-            set s [redis [srv 0 host] [srv 0 port]]
-            ::tls::import [$s channel]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            r CONFIG SET tls-auth-clients yes
-
-            set s [redis [srv 0 host] [srv 0 port]]
-            ::tls::import [$s channel]
-            catch {$s PING} e
-            assert_match {*error*} $e
-        }
-
-        test {TLS: Verify tls-protocols behaves as expected} {
-            r CONFIG SET tls-protocols TLSv1.2
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-tls1.2 0}]
-            catch {$s PING} e
-            assert_match {*I/O error*} $e
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-tls1.2 1}]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            r CONFIG SET tls-protocols ""
-        }
-
-        test {TLS: Verify tls-ciphers behaves as expected} {
-            r CONFIG SET tls-protocols TLSv1.2
-            r CONFIG SET tls-ciphers "DEFAULT:-AES128-SHA256"
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES128-SHA256"}]
-            catch {$s PING} e
-            assert_match {*I/O error*} $e
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES256-SHA256"}]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            r CONFIG SET tls-ciphers "DEFAULT"
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "-ALL:AES128-SHA256"}]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            r CONFIG SET tls-protocols ""
-            r CONFIG SET tls-ciphers "DEFAULT"
-        }
-
-        test {TLS: Verify tls-prefer-server-ciphers behaves as expected} {
-            r CONFIG SET tls-protocols TLSv1.2
-            r CONFIG SET tls-ciphers "AES128-SHA256:AES256-SHA256"
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "AES256-SHA256:AES128-SHA256"}]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            assert_equal "AES256-SHA256" [dict get [::tls::status [$s channel]] cipher]
-
-            r CONFIG SET tls-prefer-server-ciphers yes
-
-            set s [redis [srv 0 host] [srv 0 port] 0 1 {-cipher "AES256-SHA256:AES128-SHA256"}]
-            catch {$s PING} e
-            assert_match {PONG} $e
-
-            assert_equal "AES128-SHA256" [dict get [::tls::status [$s channel]] cipher]
-
-            r CONFIG SET tls-protocols ""
-            r CONFIG SET tls-ciphers "DEFAULT"
-        }
-
-        test {TLS: Verify tls-cert-file is also used as a client cert if none specified} {
-            set master [srv 0 client]
-            set master_host [srv 0 host]
-            set master_port [srv 0 port]
-
-            # Use a non-restricted client/server cert for the replica
-            set redis_crt [format "%s/tests/tls/redis.crt" [pwd]]
-            set redis_key [format "%s/tests/tls/redis.key" [pwd]]
-
-            start_server [list overrides [list tls-cert-file $redis_crt tls-key-file $redis_key] \
-                               omit [list tls-client-cert-file tls-client-key-file]] {
-                set replica [srv 0 client]
-                $replica replicaof $master_host $master_port
-                wait_for_condition 30 100 {
-                    [string match {*master_link_status:up*} [$replica info replication]]
-                } else {
-                    fail "Can't authenticate to master using just tls-cert-file!"
-                }
-            }
-        }
-
-        test {TLS: switch between tcp and tls ports} {
-            set srv_port [srv 0 port]
-
-            # TLS
-            set rd [redis [srv 0 host] $srv_port 0 1]
-            $rd PING
-
-            # TCP
-            $rd CONFIG SET tls-port 0
-            $rd CONFIG SET port $srv_port
-            $rd close
-
-            set rd [redis [srv 0 host] $srv_port 0 0]
-            $rd PING
-
-            # TLS
-            $rd CONFIG SET port 0
-            $rd CONFIG SET tls-port $srv_port
-            $rd close
-
-            set rd [redis [srv 0 host] $srv_port 0 1]
-            $rd PING
-            $rd close
-        }
-
-        test {TLS: Working with an encrypted keyfile} {
-            # Create an encrypted version
-            set keyfile [lindex [r config get tls-key-file] 1]
-            set keyfile_encrypted "$keyfile.encrypted"
-            exec -ignorestderr openssl rsa -in $keyfile -out $keyfile_encrypted -aes256 -passout pass:1234 2>/dev/null
-
-            # Using it without a password fails
-            catch {r config set tls-key-file $keyfile_encrypted} e
-            assert_match {*Unable to update TLS*} $e
-
-            # Now use a password
-            r config set tls-key-file-pass 1234
-            r config set tls-key-file $keyfile_encrypted
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/tracking.tcl b/redis-stable/tests/unit/tracking.tcl
deleted file mode 100644
index 217a057d..00000000
--- a/redis-stable/tests/unit/tracking.tcl
+++ /dev/null
@@ -1,591 +0,0 @@
-start_server {tags {"tracking network"}} {
-    # Create a deferred client we'll use to redirect invalidation
-    # messages to.
-    set rd_redirection [redis_deferring_client]
-    $rd_redirection client id
-    set redir_id [$rd_redirection read]
-    $rd_redirection subscribe __redis__:invalidate
-    $rd_redirection read ; # Consume the SUBSCRIBE reply.
-
-    # Create another client that's not used as a redirection client
-    # We should always keep this client's buffer clean
-    set rd [redis_deferring_client]
-
-    # Client to be used for SET and GET commands
-    # We don't read this client's buffer
-    set rd_sg [redis_client] 
-
-    proc clean_all {} {
-        uplevel {
-            # We should make r TRACKING off first. If r is in RESP3,
-            # r FLUSH ALL will send us tracking-redir-broken or other
-            # info which will not be consumed.
-            r CLIENT TRACKING off
-            $rd QUIT
-            $rd_redirection QUIT
-            set rd [redis_deferring_client]
-            set rd_redirection [redis_deferring_client]
-            $rd_redirection client id
-            set redir_id [$rd_redirection read]
-            $rd_redirection subscribe __redis__:invalidate
-            $rd_redirection read ; # Consume the SUBSCRIBE reply.
-            r FLUSHALL
-            r HELLO 2
-            r config set tracking-table-max-keys 1000000
-        }
-    }
-
-    test {Clients are able to enable tracking and redirect it} {
-        r CLIENT TRACKING on REDIRECT $redir_id
-    } {*OK}
-
-    test {The other connection is able to get invalidations} {
-        r SET a 1
-        r SET b 1
-        r GET a
-        r INCR b ; # This key should not be notified, since it wasn't fetched.
-        r INCR a
-        set keys [lindex [$rd_redirection read] 2]
-        assert {[llength $keys] == 1}
-        assert {[lindex $keys 0] eq {a}}
-    }
-
-    test {The client is now able to disable tracking} {
-        # Make sure to add a few more keys in the tracking list
-        # so that we can check for leaks, as a side effect.
-        r MGET a b c d e f g
-        r CLIENT TRACKING off
-    } {*OK}
-
-    test {Clients can enable the BCAST mode with the empty prefix} {
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id
-    } {*OK*}
-
-    test {The connection gets invalidation messages about all the keys} {
-        r MSET a 1 b 2 c 3
-        set keys [lsort [lindex [$rd_redirection read] 2]]
-        assert {$keys eq {a b c}}
-    }
-
-    test {Clients can enable the BCAST mode with prefixes} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id PREFIX a: PREFIX b:
-        r MULTI
-        r INCR a:1
-        r INCR a:2
-        r INCR b:1
-        r INCR b:2
-        # we should not get this key
-        r INCR c:1
-        r EXEC
-        # Because of the internals, we know we are going to receive
-        # two separated notifications for the two different prefixes.
-        set keys1 [lsort [lindex [$rd_redirection read] 2]]
-        set keys2 [lsort [lindex [$rd_redirection read] 2]]
-        set keys [lsort [list {*}$keys1 {*}$keys2]]
-        assert {$keys eq {a:1 a:2 b:1 b:2}}
-    }
-
-    test {Adding prefixes to BCAST mode works} {
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id PREFIX c:
-        r INCR c:1234
-        set keys [lsort [lindex [$rd_redirection read] 2]]
-        assert {$keys eq {c:1234}}
-    }
-
-    test {Tracking NOLOOP mode in standard mode works} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on REDIRECT $redir_id NOLOOP
-        r MGET otherkey1 loopkey otherkey2
-        $rd_sg SET otherkey1 1; # We should get this
-        r SET loopkey 1 ; # We should not get this
-        $rd_sg SET otherkey2 1; # We should get this
-        # Because of the internals, we know we are going to receive
-        # two separated notifications for the two different keys.
-        set keys1 [lsort [lindex [$rd_redirection read] 2]]
-        set keys2 [lsort [lindex [$rd_redirection read] 2]]
-        set keys [lsort [list {*}$keys1 {*}$keys2]]
-        assert {$keys eq {otherkey1 otherkey2}}
-    }
-
-    test {Tracking NOLOOP mode in BCAST mode works} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
-        $rd_sg SET otherkey1 1; # We should get this
-        r SET loopkey 1 ; # We should not get this
-        $rd_sg SET otherkey2 1; # We should get this
-        # Because $rd_sg send command synchronously, we know we are
-        # going to receive two separated notifications.
-        set keys1 [lsort [lindex [$rd_redirection read] 2]]
-        set keys2 [lsort [lindex [$rd_redirection read] 2]]
-        set keys [lsort [list {*}$keys1 {*}$keys2]]
-        assert {$keys eq {otherkey1 otherkey2}}
-    }
-
-    test {Tracking gets notification of expired keys} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
-        r SET mykey myval px 1
-        r SET mykeyotherkey myval ; # We should not get it
-        after 1000
-        set keys [lsort [lindex [$rd_redirection read] 2]]
-        assert {$keys eq {mykey}}
-    }
-
-    test {Tracking gets notification of lazy expired keys} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST REDIRECT $redir_id NOLOOP
-        # Use multi-exec to expose a race where the key gets an two invalidations
-        # in the same event loop, once by the client so filtered by NOLOOP, and
-        # the second one by the lazy expire
-        r MULTI
-        r SET mykey{t} myval px 1
-        r SET mykeyotherkey{t} myval ; # We should not get it
-        r DEBUG SLEEP 0.1
-        r GET mykey{t}
-        r EXEC
-        set keys [lsort [lindex [$rd_redirection read] 2]]
-        assert {$keys eq {mykey{t}}}
-    } {} {needs:debug}
-
-    test {HELLO 3 reply is correct} {
-        set reply [r HELLO 3]
-        assert_equal [dict get $reply proto] 3
-    }
-
-    test {HELLO without protover} {
-        set reply [r HELLO 3]
-        assert_equal [dict get $reply proto] 3
-
-        set reply [r HELLO]
-        assert_equal [dict get $reply proto] 3
-
-        set reply [r HELLO 2]
-        assert_equal [dict get $reply proto] 2
-
-        set reply [r HELLO]
-        assert_equal [dict get $reply proto] 2
-
-        # restore RESP3 for next test
-        r HELLO 3
-    }
-
-    test {RESP3 based basic invalidation} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg SET key1 2
-        r read
-    } {invalidate key1}
-
-    test {RESP3 tracking redirection} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg SET key1 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key1}}
-    }
-
-    test {Invalidations of previous keys can be redirected after switching to RESP3} {
-        r HELLO 2
-        $rd_sg SET key1 1
-        r GET key1
-        r HELLO 3
-        $rd_sg SET key1 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key1}}
-    }
-
-    test {Invalidations of new keys can be redirected after switching to RESP3} {
-        r HELLO 3
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg SET key1 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key1}}
-    }
-
-    test {RESP3 Client gets tracking-redir-broken push message after cached key changed when rediretion client is terminated} {
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_redirection QUIT
-        assert_equal OK [$rd_redirection read]
-        $rd_sg SET key1 2
-        set MAX_TRIES 100
-        set res -1
-        for {set i 0} {$i <= $MAX_TRIES && $res < 0} {incr i} {
-            set res [lsearch -exact [r PING] "tracking-redir-broken"]
-        }
-        assert {$res >= 0}
-        # Consume PING reply
-        assert_equal PONG [r read]
-
-        # Reinstantiating after QUIT
-        set rd_redirection [redis_deferring_client]
-        $rd_redirection CLIENT ID
-        set redir_id [$rd_redirection read]
-        $rd_redirection SUBSCRIBE __redis__:invalidate
-        $rd_redirection read ; # Consume the SUBSCRIBE reply
-    }
-
-    test {Different clients can redirect to the same connection} {
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd CLIENT TRACKING on REDIRECT $redir_id 
-        assert_equal OK [$rd read] ; # Consume the TRACKING reply
-        $rd_sg MSET key1 1 key2 1
-        r GET key1
-        $rd GET key2 
-        assert_equal 1 [$rd read] ; # Consume the GET reply
-        $rd_sg INCR key1
-        $rd_sg INCR key2
-        set res1 [lindex [$rd_redirection read] 2]
-        set res2 [lindex [$rd_redirection read] 2]
-        assert {$res1 eq {key1}}
-        assert {$res2 eq {key2}}
-    }
-
-    test {Different clients using different protocols can track the same key} {
-        $rd HELLO 3 
-        set reply [$rd read] ; # Consume the HELLO reply
-        assert_equal 3 [dict get $reply proto]
-        $rd CLIENT TRACKING on 
-        assert_equal OK [$rd read] ; # Consume the TRACKING reply
-        $rd_sg set key1 1
-        r GET key1
-        $rd GET key1 
-        assert_equal 1 [$rd read] ; # Consume the GET reply
-        $rd_sg INCR key1
-        set res1 [lindex [$rd_redirection read] 2]
-        $rd PING ; # Non redirecting client has to talk to the server in order to get invalidation message
-        set res2 [lindex [split [$rd read] " "] 1] 
-        assert_equal PONG [$rd read] ; # Consume the PING reply, which comes together with the invalidation message
-        assert {$res1 eq {key1}}
-        assert {$res2 eq {key1}}
-    }
-
-    test {No invalidation message when using OPTIN option} {
-        r CLIENT TRACKING on OPTIN REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1 ; # This key should not be notified, since OPTIN is on and CLIENT CACHING yes wasn't called
-        $rd_sg SET key1 2
-        # Preparing some message to consume on $rd_redirection so we don't get blocked
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key2 1
-        r GET key2 ; # This key should be notified
-        $rd_sg SET key2 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key2}}
-    }
-
-    test {Invalidation message sent when using OPTIN option with CLIENT CACHING yes} {
-        r CLIENT TRACKING on OPTIN REDIRECT $redir_id
-        $rd_sg SET key1 3
-        r CLIENT CACHING yes
-        r GET key1
-        $rd_sg SET key1 4
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key1}}
-    }
-
-    test {Invalidation message sent when using OPTOUT option} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on OPTOUT REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1 
-        $rd_sg SET key1 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key1}}
-    }
-
-    test {No invalidation message when using OPTOUT option with CLIENT CACHING no} {
-        $rd_sg SET key1 1
-        r CLIENT CACHING no
-        r GET key1 ; # This key should not be notified, since OPTOUT is on and CLIENT CACHING no was called
-        $rd_sg SET key1 2
-        # Preparing some message to consume on $rd_redirection so we don't get blocked
-        $rd_sg SET key2 1
-        r GET key2 ; # This key should be notified
-        $rd_sg SET key2 2
-        set res [lindex [$rd_redirection read] 2]
-        assert {$res eq {key2}}
-    }
-
-    test {Able to redirect to a RESP3 client} {
-        $rd_redirection UNSUBSCRIBE __redis__:invalidate ; # Need to unsub first before we can do HELLO 3
-        set res [$rd_redirection read] ; # Consume the UNSUBSCRIBE reply
-        assert_equal {__redis__:invalidate} [lindex $res 1]
-        $rd_redirection HELLO 3
-        set res [$rd_redirection read] ; # Consume the HELLO reply
-        assert_equal [dict get $reply proto] 3
-        $rd_redirection SUBSCRIBE __redis__:invalidate
-        set res [$rd_redirection read] ; # Consume the SUBSCRIBE reply
-        assert_equal {__redis__:invalidate} [lindex $res 1]
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg INCR key1
-        set res [lindex [$rd_redirection read] 1]
-        assert {$res eq {key1}}
-        $rd_redirection HELLO 2
-        set res [$rd_redirection read] ; # Consume the HELLO reply
-        assert_equal [dict get $res proto] 2
-    }
-
-    test {After switching from normal tracking to BCAST mode, no invalidation message is produced for pre-BCAST keys} {
-        r CLIENT TRACKING off
-        r HELLO 3
-        r CLIENT TRACKING on
-        $rd_sg SET key1 1
-        r GET key1
-        r CLIENT TRACKING off 
-        r CLIENT TRACKING on BCAST
-        $rd_sg INCR key1
-        set inv_msg [r PING]
-        set ping_reply [r read]
-        assert {$inv_msg eq {invalidate key1}}
-        assert {$ping_reply eq {PONG}}
-    }
-
-    test {BCAST with prefix collisions throw errors} {
-        set r [redis_client] 
-        catch {$r CLIENT TRACKING ON BCAST PREFIX FOOBAR PREFIX FOO} output
-        assert_match {ERR Prefix 'FOOBAR'*'FOO'*} $output
-
-        catch {$r CLIENT TRACKING ON BCAST PREFIX FOO PREFIX FOOBAR} output
-        assert_match {ERR Prefix 'FOO'*'FOOBAR'*} $output
-
-        $r CLIENT TRACKING ON BCAST PREFIX FOO PREFIX BAR
-        catch {$r CLIENT TRACKING ON BCAST PREFIX FO} output
-        assert_match {ERR Prefix 'FO'*'FOO'*} $output
-
-        catch {$r CLIENT TRACKING ON BCAST PREFIX BARB} output
-        assert_match {ERR Prefix 'BARB'*'BAR'*} $output
-
-        $r CLIENT TRACKING OFF
-    }
-
-    test {Tracking gets notification on tracking table key eviction} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on REDIRECT $redir_id NOLOOP
-        r MSET key1 1 key2 2
-        # Let the server track the two keys for us
-        r MGET key1 key2
-        # Force the eviction of all the keys but one:
-        r config set tracking-table-max-keys 1
-        # Note that we may have other keys in the table for this client,
-        # since we disabled/enabled tracking multiple time with the same
-        # ID, and tracking does not do ID cleanups for performance reasons.
-        # So we check that eventually we'll receive one or the other key,
-        # otherwise the test will die for timeout.
-        while 1 {
-            set keys [lindex [$rd_redirection read] 2]
-            if {$keys eq {key1} || $keys eq {key2}} break
-        }
-        # We should receive an expire notification for one of
-        # the two keys (only one must remain)
-        assert {$keys eq {key1} || $keys eq {key2}}
-    }
-
-    test {Invalidation message received for flushall} {
-        clean_all
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg FLUSHALL
-        set msg [$rd_redirection read]
-        assert {[lindex msg 2] eq {} }
-    }
-
-    test {Invalidation message received for flushdb} {
-        clean_all
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_sg FLUSHDB
-        set msg [$rd_redirection read]
-        assert {[lindex msg 2] eq {} }
-    }
-
-    test {Test ASYNC flushall} {
-        clean_all
-        r CLIENT TRACKING on REDIRECT $redir_id
-        r GET key1
-        r GET key2
-        assert_equal [s 0 tracking_total_keys] 2
-        $rd_sg FLUSHALL ASYNC
-        assert_equal [s 0 tracking_total_keys] 0
-        assert_equal [lindex [$rd_redirection read] 2] {}
-    }
-
-    # Keys are defined to be evicted 100 at a time by default.
-    # If after eviction the number of keys still surpasses the limit
-    # defined in tracking-table-max-keys, we increases eviction 
-    # effort to 200, and then 300, etc. 
-    # This test tests this effort incrementation. 
-    test {Server is able to evacuate enough keys when num of keys surpasses limit by more than defined initial effort} {
-        clean_all
-        set NUM_OF_KEYS_TO_TEST 250
-        set TRACKING_TABLE_MAX_KEYS 1
-        r CLIENT TRACKING on REDIRECT $redir_id
-        for {set i 0} {$i < $NUM_OF_KEYS_TO_TEST} {incr i} {
-            $rd_sg SET key$i $i
-            r GET key$i
-        }
-        r config set tracking-table-max-keys $TRACKING_TABLE_MAX_KEYS
-        # If not enough keys are evicted, we won't get enough invalidation
-        # messages, and "$rd_redirection read" will block.
-        # If too many keys are evicted, we will get too many invalidation
-        # messages, and the assert will fail.
-        for {set i 0} {$i < $NUM_OF_KEYS_TO_TEST - $TRACKING_TABLE_MAX_KEYS} {incr i} {
-            $rd_redirection read
-        }
-        $rd_redirection PING
-        assert {[$rd_redirection read] eq {pong {}}}
-    }
-
-    test {Tracking info is correct} {
-        clean_all
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        $rd_sg SET key2 2
-        r GET key1 
-        r GET key2
-        $rd CLIENT TRACKING on BCAST PREFIX prefix:
-        assert [string match *OK* [$rd read]]
-        $rd_sg SET prefix:key1 1 
-        $rd_sg SET prefix:key2 2
-        set info [r info]
-        regexp "\r\ntracking_total_items:(.*?)\r\n" $info _ total_items
-        regexp "\r\ntracking_total_keys:(.*?)\r\n" $info _ total_keys
-        regexp "\r\ntracking_total_prefixes:(.*?)\r\n" $info _ total_prefixes
-        regexp "\r\ntracking_clients:(.*?)\r\n" $info _ tracking_clients
-        assert {$total_items == 2}
-        assert {$total_keys == 2}
-        assert {$total_prefixes == 1}
-        assert {$tracking_clients == 2}
-    }
-
-    test {CLIENT GETREDIR provides correct client id} {
-        set res [r CLIENT GETREDIR]
-        assert_equal $redir_id $res
-        r CLIENT TRACKING off
-        set res [r CLIENT GETREDIR]
-        assert_equal -1 $res
-        r CLIENT TRACKING on
-        set res [r CLIENT GETREDIR]
-        assert_equal 0 $res
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking off} {
-        r CLIENT TRACKING off
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {off} $flags
-        set redirect [dict get $res redirect]
-        assert_equal {-1} $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking on} {
-        r CLIENT TRACKING on
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on} $flags
-        set redirect [dict get $res redirect]
-        assert_equal {0} $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking on with options} {
-        r CLIENT TRACKING on REDIRECT $redir_id noloop
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on noloop} $flags
-        set redirect [dict get $res redirect]
-        assert_equal $redir_id $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking optin} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on optin
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on optin} $flags
-        set redirect [dict get $res redirect]
-        assert_equal {0} $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-
-        r CLIENT CACHING yes
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on optin caching-yes} $flags
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking optout} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on optout
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on optout} $flags
-        set redirect [dict get $res redirect]
-        assert_equal {0} $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-
-        r CLIENT CACHING no
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on optout caching-no} $flags
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking bcast mode} {
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST PREFIX foo PREFIX bar
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on bcast} $flags
-        set redirect [dict get $res redirect]
-        assert_equal {0} $redirect
-        set prefixes [lsort [dict get $res prefixes]]
-        assert_equal {bar foo} $prefixes
-
-        r CLIENT TRACKING off
-        r CLIENT TRACKING on BCAST
-        set res [r client trackinginfo]
-        set prefixes [dict get $res prefixes]
-        assert_equal {{}} $prefixes
-    }
-
-    test {CLIENT TRACKINGINFO provides reasonable results when tracking redir broken} {
-        clean_all
-        r HELLO 3
-        r CLIENT TRACKING on REDIRECT $redir_id
-        $rd_sg SET key1 1
-        r GET key1
-        $rd_redirection QUIT
-        assert_equal OK [$rd_redirection read]
-        $rd_sg SET key1 2
-        set res [lsearch -exact [r read] "tracking-redir-broken"]
-        assert {$res >= 0}
-        set res [r client trackinginfo]
-        set flags [dict get $res flags]
-        assert_equal {on broken_redirect} $flags
-        set redirect [dict get $res redirect]
-        assert_equal $redir_id $redirect
-        set prefixes [dict get $res prefixes]
-        assert_equal {} $prefixes
-    }
-
-    $rd_redirection close
-    $rd close
-}
diff --git a/redis-stable/tests/unit/type/hash.tcl b/redis-stable/tests/unit/type/hash.tcl
deleted file mode 100644
index f2a50372..00000000
--- a/redis-stable/tests/unit/type/hash.tcl
+++ /dev/null
@@ -1,797 +0,0 @@
-start_server {tags {"hash"}} {
-    test {HSET/HLEN - Small hash creation} {
-        array set smallhash {}
-        for {set i 0} {$i < 8} {incr i} {
-            set key __avoid_collisions__[randstring 0 8 alpha]
-            set val __avoid_collisions__[randstring 0 8 alpha]
-            if {[info exists smallhash($key)]} {
-                incr i -1
-                continue
-            }
-            r hset smallhash $key $val
-            set smallhash($key) $val
-        }
-        list [r hlen smallhash]
-    } {8}
-
-    test {Is the small hash encoded with a ziplist?} {
-        assert_encoding ziplist smallhash
-    }
-
-    proc create_hash {key entries} {
-        r del $key
-        foreach entry $entries {
-            r hset $key [lindex $entry 0] [lindex $entry 1]
-        }
-    }
-
-    proc get_keys {l} {
-        set res {}
-        foreach entry $l {
-            set key [lindex $entry 0]
-            lappend res $key
-        }
-        return $res
-    }
-
-    foreach {type contents} "ziplist {{a 1} {b 2} {c 3}} hashtable {{a 1} {b 2} {[randstring 70 90 alpha] 3}}" {
-        set original_max_value [lindex [r config get hash-max-ziplist-value] 1]
-        r config set hash-max-ziplist-value 10
-        create_hash myhash $contents
-        assert_encoding $type myhash
-
-        test "HRANDFIELD - $type" {
-            unset -nocomplain myhash
-            array set myhash {}
-            for {set i 0} {$i < 100} {incr i} {
-                set key [r hrandfield myhash]
-                set myhash($key) 1
-            }
-            assert_equal [lsort [get_keys $contents]] [lsort [array names myhash]]
-        }
-        r config set hash-max-ziplist-value $original_max_value
-    }
-
-    test "HRANDFIELD with RESP3" {
-        r hello 3
-        set res [r hrandfield myhash 3 withvalues]
-        assert_equal [llength $res] 3
-        assert_equal [llength [lindex $res 1]] 2
-
-        set res [r hrandfield myhash 3]
-        assert_equal [llength $res] 3
-        assert_equal [llength [lindex $res 1]] 1
-    }
-    r hello 2
-
-    test "HRANDFIELD count of 0 is handled correctly" {
-        r hrandfield myhash 0
-    } {}
-
-    test "HRANDFIELD with <count> against non existing key" {
-        r hrandfield nonexisting_key 100
-    } {}
-
-    # Make sure we can distinguish between an empty array and a null response
-    r readraw 1
-
-    test "HRANDFIELD count of 0 is handled correctly - emptyarray" {
-        r hrandfield myhash 0
-    } {*0}
-
-    test "HRANDFIELD with <count> against non existing key - emptyarray" {
-        r hrandfield nonexisting_key 100
-    } {*0}
-
-    r readraw 0
-
-    foreach {type contents} "
-        hashtable {{a 1} {b 2} {c 3} {d 4} {e 5} {6 f} {7 g} {8 h} {9 i} {[randstring 70 90 alpha] 10}}
-        ziplist {{a 1} {b 2} {c 3} {d 4} {e 5} {6 f} {7 g} {8 h} {9 i} {10 j}} " {
-        test "HRANDFIELD with <count> - $type" {
-            set original_max_value [lindex [r config get hash-max-ziplist-value] 1]
-            r config set hash-max-ziplist-value 10
-            create_hash myhash $contents
-            assert_encoding $type myhash
-
-            # create a dict for easy lookup
-            unset -nocomplain mydict
-            foreach {k v} [r hgetall myhash] {
-                dict append mydict $k $v
-            }
-
-            # We'll stress different parts of the code, see the implementation
-            # of HRANDFIELD for more information, but basically there are
-            # four different code paths.
-
-            # PATH 1: Use negative count.
-
-            # 1) Check that it returns repeated elements with and without values.
-            set res [r hrandfield myhash -20]
-            assert_equal [llength $res] 20
-            set res [r hrandfield myhash -1001]
-            assert_equal [llength $res] 1001
-            # again with WITHVALUES
-            set res [r hrandfield myhash -20 withvalues]
-            assert_equal [llength $res] 40
-            set res [r hrandfield myhash -1001 withvalues]
-            assert_equal [llength $res] 2002
-
-            # Test random uniform distribution
-            # df = 9, 40 means 0.00001 probability
-            set res [r hrandfield myhash -1000]
-            assert_lessthan [chi_square_value $res] 40
-
-            # 2) Check that all the elements actually belong to the original hash.
-            foreach {key val} $res {
-                assert {[dict exists $mydict $key]}
-            }
-
-            # 3) Check that eventually all the elements are returned.
-            #    Use both WITHVALUES and without
-            unset -nocomplain auxset
-            set iterations 1000
-            while {$iterations != 0} {
-                incr iterations -1
-                if {[expr {$iterations % 2}] == 0} {
-                    set res [r hrandfield myhash -3 withvalues]
-                    foreach {key val} $res {
-                        dict append auxset $key $val
-                    }
-                } else {
-                    set res [r hrandfield myhash -3]
-                    foreach key $res {
-                        dict append auxset $key $val
-                    }
-                }
-                if {[lsort [dict keys $mydict]] eq
-                    [lsort [dict keys $auxset]]} {
-                    break;
-                }
-            }
-            assert {$iterations != 0}
-
-            # PATH 2: positive count (unique behavior) with requested size
-            # equal or greater than set size.
-            foreach size {10 20} {
-                set res [r hrandfield myhash $size]
-                assert_equal [llength $res] 10
-                assert_equal [lsort $res] [lsort [dict keys $mydict]]
-
-                # again with WITHVALUES
-                set res [r hrandfield myhash $size withvalues]
-                assert_equal [llength $res] 20
-                assert_equal [lsort $res] [lsort $mydict]
-            }
-
-            # PATH 3: Ask almost as elements as there are in the set.
-            # In this case the implementation will duplicate the original
-            # set and will remove random elements up to the requested size.
-            #
-            # PATH 4: Ask a number of elements definitely smaller than
-            # the set size.
-            #
-            # We can test both the code paths just changing the size but
-            # using the same code.
-            foreach size {8 2} {
-                set res [r hrandfield myhash $size]
-                assert_equal [llength $res] $size
-                # again with WITHVALUES
-                set res [r hrandfield myhash $size withvalues]
-                assert_equal [llength $res] [expr {$size * 2}]
-
-                # 1) Check that all the elements actually belong to the
-                # original set.
-                foreach ele [dict keys $res] {
-                    assert {[dict exists $mydict $ele]}
-                }
-
-                # 2) Check that eventually all the elements are returned.
-                #    Use both WITHVALUES and without
-                unset -nocomplain auxset
-                unset -nocomplain allkey
-                set iterations [expr {1000 / $size}]
-                set all_ele_return false
-                while {$iterations != 0} {
-                    incr iterations -1
-                    if {[expr {$iterations % 2}] == 0} {
-                        set res [r hrandfield myhash $size withvalues]
-                        foreach {key value} $res {
-                            dict append auxset $key $value
-                            lappend allkey $key
-                        }
-                    } else {
-                        set res [r hrandfield myhash $size]
-                        foreach key $res {
-                            dict append auxset $key
-                            lappend allkey $key
-                        }
-                    }
-                    if {[lsort [dict keys $mydict]] eq
-                        [lsort [dict keys $auxset]]} {
-                        set all_ele_return true
-                    }
-                }
-                assert_equal $all_ele_return true
-                # df = 9, 40 means 0.00001 probability
-                assert_lessthan [chi_square_value $allkey] 40
-            }
-        }
-        r config set hash-max-ziplist-value $original_max_value
-    }
-
-
-    test {HSET/HLEN - Big hash creation} {
-        array set bighash {}
-        for {set i 0} {$i < 1024} {incr i} {
-            set key __avoid_collisions__[randstring 0 8 alpha]
-            set val __avoid_collisions__[randstring 0 8 alpha]
-            if {[info exists bighash($key)]} {
-                incr i -1
-                continue
-            }
-            r hset bighash $key $val
-            set bighash($key) $val
-        }
-        list [r hlen bighash]
-    } {1024}
-
-    test {Is the big hash encoded with an hash table?} {
-        assert_encoding hashtable bighash
-    }
-
-    test {HGET against the small hash} {
-        set err {}
-        foreach k [array names smallhash *] {
-            if {$smallhash($k) ne [r hget smallhash $k]} {
-                set err "$smallhash($k) != [r hget smallhash $k]"
-                break
-            }
-        }
-        set _ $err
-    } {}
-
-    test {HGET against the big hash} {
-        set err {}
-        foreach k [array names bighash *] {
-            if {$bighash($k) ne [r hget bighash $k]} {
-                set err "$bighash($k) != [r hget bighash $k]"
-                break
-            }
-        }
-        set _ $err
-    } {}
-
-    test {HGET against non existing key} {
-        set rv {}
-        lappend rv [r hget smallhash __123123123__]
-        lappend rv [r hget bighash __123123123__]
-        set _ $rv
-    } {{} {}}
-
-    test {HSET in update and insert mode} {
-        set rv {}
-        set k [lindex [array names smallhash *] 0]
-        lappend rv [r hset smallhash $k newval1]
-        set smallhash($k) newval1
-        lappend rv [r hget smallhash $k]
-        lappend rv [r hset smallhash __foobar123__ newval]
-        set k [lindex [array names bighash *] 0]
-        lappend rv [r hset bighash $k newval2]
-        set bighash($k) newval2
-        lappend rv [r hget bighash $k]
-        lappend rv [r hset bighash __foobar123__ newval]
-        lappend rv [r hdel smallhash __foobar123__]
-        lappend rv [r hdel bighash __foobar123__]
-        set _ $rv
-    } {0 newval1 1 0 newval2 1 1 1}
-
-    test {HSETNX target key missing - small hash} {
-        r hsetnx smallhash __123123123__ foo
-        r hget smallhash __123123123__
-    } {foo}
-
-    test {HSETNX target key exists - small hash} {
-        r hsetnx smallhash __123123123__ bar
-        set result [r hget smallhash __123123123__]
-        r hdel smallhash __123123123__
-        set _ $result
-    } {foo}
-
-    test {HSETNX target key missing - big hash} {
-        r hsetnx bighash __123123123__ foo
-        r hget bighash __123123123__
-    } {foo}
-
-    test {HSETNX target key exists - big hash} {
-        r hsetnx bighash __123123123__ bar
-        set result [r hget bighash __123123123__]
-        r hdel bighash __123123123__
-        set _ $result
-    } {foo}
-
-    test {HMSET wrong number of args} {
-        catch {r hmset smallhash key1 val1 key2} err
-        format $err
-    } {*wrong number*}
-
-    test {HMSET - small hash} {
-        set args {}
-        foreach {k v} [array get smallhash] {
-            set newval [randstring 0 8 alpha]
-            set smallhash($k) $newval
-            lappend args $k $newval
-        }
-        r hmset smallhash {*}$args
-    } {OK}
-
-    test {HMSET - big hash} {
-        set args {}
-        foreach {k v} [array get bighash] {
-            set newval [randstring 0 8 alpha]
-            set bighash($k) $newval
-            lappend args $k $newval
-        }
-        r hmset bighash {*}$args
-    } {OK}
-
-    test {HMGET against non existing key and fields} {
-        set rv {}
-        lappend rv [r hmget doesntexist __123123123__ __456456456__]
-        lappend rv [r hmget smallhash __123123123__ __456456456__]
-        lappend rv [r hmget bighash __123123123__ __456456456__]
-        set _ $rv
-    } {{{} {}} {{} {}} {{} {}}}
-
-    test {HMGET against wrong type} {
-        r set wrongtype somevalue
-        assert_error "*wrong*" {r hmget wrongtype field1 field2}
-    }
-
-    test {HMGET - small hash} {
-        set keys {}
-        set vals {}
-        foreach {k v} [array get smallhash] {
-            lappend keys $k
-            lappend vals $v
-        }
-        set err {}
-        set result [r hmget smallhash {*}$keys]
-        if {$vals ne $result} {
-            set err "$vals != $result"
-            break
-        }
-        set _ $err
-    } {}
-
-    test {HMGET - big hash} {
-        set keys {}
-        set vals {}
-        foreach {k v} [array get bighash] {
-            lappend keys $k
-            lappend vals $v
-        }
-        set err {}
-        set result [r hmget bighash {*}$keys]
-        if {$vals ne $result} {
-            set err "$vals != $result"
-            break
-        }
-        set _ $err
-    } {}
-
-    test {HKEYS - small hash} {
-        lsort [r hkeys smallhash]
-    } [lsort [array names smallhash *]]
-
-    test {HKEYS - big hash} {
-        lsort [r hkeys bighash]
-    } [lsort [array names bighash *]]
-
-    test {HVALS - small hash} {
-        set vals {}
-        foreach {k v} [array get smallhash] {
-            lappend vals $v
-        }
-        set _ [lsort $vals]
-    } [lsort [r hvals smallhash]]
-
-    test {HVALS - big hash} {
-        set vals {}
-        foreach {k v} [array get bighash] {
-            lappend vals $v
-        }
-        set _ [lsort $vals]
-    } [lsort [r hvals bighash]]
-
-    test {HGETALL - small hash} {
-        lsort [r hgetall smallhash]
-    } [lsort [array get smallhash]]
-
-    test {HGETALL - big hash} {
-        lsort [r hgetall bighash]
-    } [lsort [array get bighash]]
-
-    test {HDEL and return value} {
-        set rv {}
-        lappend rv [r hdel smallhash nokey]
-        lappend rv [r hdel bighash nokey]
-        set k [lindex [array names smallhash *] 0]
-        lappend rv [r hdel smallhash $k]
-        lappend rv [r hdel smallhash $k]
-        lappend rv [r hget smallhash $k]
-        unset smallhash($k)
-        set k [lindex [array names bighash *] 0]
-        lappend rv [r hdel bighash $k]
-        lappend rv [r hdel bighash $k]
-        lappend rv [r hget bighash $k]
-        unset bighash($k)
-        set _ $rv
-    } {0 0 1 0 {} 1 0 {}}
-
-    test {HDEL - more than a single value} {
-        set rv {}
-        r del myhash
-        r hmset myhash a 1 b 2 c 3
-        assert_equal 0 [r hdel myhash x y]
-        assert_equal 2 [r hdel myhash a c f]
-        r hgetall myhash
-    } {b 2}
-
-    test {HDEL - hash becomes empty before deleting all specified fields} {
-        r del myhash
-        r hmset myhash a 1 b 2 c 3
-        assert_equal 3 [r hdel myhash a b c d e]
-        assert_equal 0 [r exists myhash]
-    }
-
-    test {HEXISTS} {
-        set rv {}
-        set k [lindex [array names smallhash *] 0]
-        lappend rv [r hexists smallhash $k]
-        lappend rv [r hexists smallhash nokey]
-        set k [lindex [array names bighash *] 0]
-        lappend rv [r hexists bighash $k]
-        lappend rv [r hexists bighash nokey]
-    } {1 0 1 0}
-
-    test {Is a ziplist encoded Hash promoted on big payload?} {
-        r hset smallhash foo [string repeat a 1024]
-        r debug object smallhash
-    } {*hashtable*}
-
-    test {HINCRBY against non existing database key} {
-        r del htest
-        list [r hincrby htest foo 2]
-    } {2}
-
-    test {HINCRBY against non existing hash key} {
-        set rv {}
-        r hdel smallhash tmp
-        r hdel bighash tmp
-        lappend rv [r hincrby smallhash tmp 2]
-        lappend rv [r hget smallhash tmp]
-        lappend rv [r hincrby bighash tmp 2]
-        lappend rv [r hget bighash tmp]
-    } {2 2 2 2}
-
-    test {HINCRBY against hash key created by hincrby itself} {
-        set rv {}
-        lappend rv [r hincrby smallhash tmp 3]
-        lappend rv [r hget smallhash tmp]
-        lappend rv [r hincrby bighash tmp 3]
-        lappend rv [r hget bighash tmp]
-    } {5 5 5 5}
-
-    test {HINCRBY against hash key originally set with HSET} {
-        r hset smallhash tmp 100
-        r hset bighash tmp 100
-        list [r hincrby smallhash tmp 2] [r hincrby bighash tmp 2]
-    } {102 102}
-
-    test {HINCRBY over 32bit value} {
-        r hset smallhash tmp 17179869184
-        r hset bighash tmp 17179869184
-        list [r hincrby smallhash tmp 1] [r hincrby bighash tmp 1]
-    } {17179869185 17179869185}
-
-    test {HINCRBY over 32bit value with over 32bit increment} {
-        r hset smallhash tmp 17179869184
-        r hset bighash tmp 17179869184
-        list [r hincrby smallhash tmp 17179869184] [r hincrby bighash tmp 17179869184]
-    } {34359738368 34359738368}
-
-    test {HINCRBY fails against hash value with spaces (left)} {
-        r hset smallhash str " 11"
-        r hset bighash str " 11"
-        catch {r hincrby smallhash str 1} smallerr
-        catch {r hincrby bighash str 1} bigerr
-        set rv {}
-        lappend rv [string match "ERR*not an integer*" $smallerr]
-        lappend rv [string match "ERR*not an integer*" $bigerr]
-    } {1 1}
-
-    test {HINCRBY fails against hash value with spaces (right)} {
-        r hset smallhash str "11 "
-        r hset bighash str "11 "
-        catch {r hincrby smallhash str 1} smallerr
-        catch {r hincrby bighash str 1} bigerr
-        set rv {}
-        lappend rv [string match "ERR*not an integer*" $smallerr]
-        lappend rv [string match "ERR*not an integer*" $bigerr]
-    } {1 1}
-
-    test {HINCRBY can detect overflows} {
-        set e {}
-        r hset hash n -9223372036854775484
-        assert {[r hincrby hash n -1] == -9223372036854775485}
-        catch {r hincrby hash n -10000} e
-        set e
-    } {*overflow*}
-
-    test {HINCRBYFLOAT against non existing database key} {
-        r del htest
-        list [r hincrbyfloat htest foo 2.5]
-    } {2.5}
-
-    test {HINCRBYFLOAT against non existing hash key} {
-        set rv {}
-        r hdel smallhash tmp
-        r hdel bighash tmp
-        lappend rv [roundFloat [r hincrbyfloat smallhash tmp 2.5]]
-        lappend rv [roundFloat [r hget smallhash tmp]]
-        lappend rv [roundFloat [r hincrbyfloat bighash tmp 2.5]]
-        lappend rv [roundFloat [r hget bighash tmp]]
-    } {2.5 2.5 2.5 2.5}
-
-    test {HINCRBYFLOAT against hash key created by hincrby itself} {
-        set rv {}
-        lappend rv [roundFloat [r hincrbyfloat smallhash tmp 3.5]]
-        lappend rv [roundFloat [r hget smallhash tmp]]
-        lappend rv [roundFloat [r hincrbyfloat bighash tmp 3.5]]
-        lappend rv [roundFloat [r hget bighash tmp]]
-    } {6 6 6 6}
-
-    test {HINCRBYFLOAT against hash key originally set with HSET} {
-        r hset smallhash tmp 100
-        r hset bighash tmp 100
-        list [roundFloat [r hincrbyfloat smallhash tmp 2.5]] \
-             [roundFloat [r hincrbyfloat bighash tmp 2.5]]
-    } {102.5 102.5}
-
-    test {HINCRBYFLOAT over 32bit value} {
-        r hset smallhash tmp 17179869184
-        r hset bighash tmp 17179869184
-        list [r hincrbyfloat smallhash tmp 1] \
-             [r hincrbyfloat bighash tmp 1]
-    } {17179869185 17179869185}
-
-    test {HINCRBYFLOAT over 32bit value with over 32bit increment} {
-        r hset smallhash tmp 17179869184
-        r hset bighash tmp 17179869184
-        list [r hincrbyfloat smallhash tmp 17179869184] \
-             [r hincrbyfloat bighash tmp 17179869184]
-    } {34359738368 34359738368}
-
-    test {HINCRBYFLOAT fails against hash value with spaces (left)} {
-        r hset smallhash str " 11"
-        r hset bighash str " 11"
-        catch {r hincrbyfloat smallhash str 1} smallerr
-        catch {r hincrbyfloat bighash str 1} bigerr
-        set rv {}
-        lappend rv [string match "ERR*not*float*" $smallerr]
-        lappend rv [string match "ERR*not*float*" $bigerr]
-    } {1 1}
-
-    test {HINCRBYFLOAT fails against hash value with spaces (right)} {
-        r hset smallhash str "11 "
-        r hset bighash str "11 "
-        catch {r hincrbyfloat smallhash str 1} smallerr
-        catch {r hincrbyfloat bighash str 1} bigerr
-        set rv {}
-        lappend rv [string match "ERR*not*float*" $smallerr]
-        lappend rv [string match "ERR*not*float*" $bigerr]
-    } {1 1}
-
-    test {HINCRBYFLOAT fails against hash value that contains a null-terminator in the middle} {
-        r hset h f "1\x002"
-        catch {r hincrbyfloat h f 1} err
-        set rv {}
-        lappend rv [string match "ERR*not*float*" $err]
-    } {1}
-
-    test {HSTRLEN against the small hash} {
-        set err {}
-        foreach k [array names smallhash *] {
-            if {[string length $smallhash($k)] ne [r hstrlen smallhash $k]} {
-                set err "[string length $smallhash($k)] != [r hstrlen smallhash $k]"
-                break
-            }
-        }
-        set _ $err
-    } {}
-
-    test {HSTRLEN against the big hash} {
-        set err {}
-        foreach k [array names bighash *] {
-            if {[string length $bighash($k)] ne [r hstrlen bighash $k]} {
-                set err "[string length $bighash($k)] != [r hstrlen bighash $k]"
-                puts "HSTRLEN and logical length mismatch:"
-                puts "key: $k"
-                puts "Logical content: $bighash($k)"
-                puts "Server  content: [r hget bighash $k]"
-            }
-        }
-        set _ $err
-    } {}
-
-    test {HSTRLEN against non existing field} {
-        set rv {}
-        lappend rv [r hstrlen smallhash __123123123__]
-        lappend rv [r hstrlen bighash __123123123__]
-        set _ $rv
-    } {0 0}
-
-    test {HSTRLEN corner cases} {
-        set vals {
-            -9223372036854775808 9223372036854775807 9223372036854775808
-            {} 0 -1 x
-        }
-        foreach v $vals {
-            r hmset smallhash field $v
-            r hmset bighash field $v
-            set len1 [string length $v]
-            set len2 [r hstrlen smallhash field]
-            set len3 [r hstrlen bighash field]
-            assert {$len1 == $len2}
-            assert {$len2 == $len3}
-        }
-    }
-
-    test {Hash ziplist regression test for large keys} {
-        r hset hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk a
-        r hset hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk b
-        r hget hash kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
-    } {b}
-
-    foreach size {10 512} {
-        test "Hash fuzzing #1 - $size fields" {
-            for {set times 0} {$times < 10} {incr times} {
-                catch {unset hash}
-                array set hash {}
-                r del hash
-
-                # Create
-                for {set j 0} {$j < $size} {incr j} {
-                    set field [randomValue]
-                    set value [randomValue]
-                    r hset hash $field $value
-                    set hash($field) $value
-                }
-
-                # Verify
-                foreach {k v} [array get hash] {
-                    assert_equal $v [r hget hash $k]
-                }
-                assert_equal [array size hash] [r hlen hash]
-            }
-        }
-
-        test "Hash fuzzing #2 - $size fields" {
-            for {set times 0} {$times < 10} {incr times} {
-                catch {unset hash}
-                array set hash {}
-                r del hash
-
-                # Create
-                for {set j 0} {$j < $size} {incr j} {
-                    randpath {
-                        set field [randomValue]
-                        set value [randomValue]
-                        r hset hash $field $value
-                        set hash($field) $value
-                    } {
-                        set field [randomSignedInt 512]
-                        set value [randomSignedInt 512]
-                        r hset hash $field $value
-                        set hash($field) $value
-                    } {
-                        randpath {
-                            set field [randomValue]
-                        } {
-                            set field [randomSignedInt 512]
-                        }
-                        r hdel hash $field
-                        unset -nocomplain hash($field)
-                    }
-                }
-
-                # Verify
-                foreach {k v} [array get hash] {
-                    assert_equal $v [r hget hash $k]
-                }
-                assert_equal [array size hash] [r hlen hash]
-            }
-        }
-    }
-
-    test {Stress test the hash ziplist -> hashtable encoding conversion} {
-        r config set hash-max-ziplist-entries 32
-        for {set j 0} {$j < 100} {incr j} {
-            r del myhash
-            for {set i 0} {$i < 64} {incr i} {
-                r hset myhash [randomValue] [randomValue]
-            }
-            assert {[r object encoding myhash] eq {hashtable}}
-        }
-    }
-
-    # The following test can only be executed if we don't use Valgrind, and if
-    # we are using x86_64 architecture, because:
-    #
-    # 1) Valgrind has floating point limitations, no support for 80 bits math.
-    # 2) Other archs may have the same limits.
-    #
-    # 1.23 cannot be represented correctly with 64 bit doubles, so we skip
-    # the test, since we are only testing pretty printing here and is not
-    # a bug if the program outputs things like 1.299999...
-    if {!$::valgrind && [string match *x86_64* [exec uname -a]]} {
-        test {Test HINCRBYFLOAT for correct float representation (issue #2846)} {
-            r del myhash
-            assert {[r hincrbyfloat myhash float 1.23] eq {1.23}}
-            assert {[r hincrbyfloat myhash float 0.77] eq {2}}
-            assert {[r hincrbyfloat myhash float -0.1] eq {1.9}}
-        }
-    }
-
-    test {Hash ziplist of various encodings} {
-        r del k
-        r config set hash-max-ziplist-entries 1000000000
-        r config set hash-max-ziplist-value 1000000000
-        r hset k ZIP_INT_8B 127
-        r hset k ZIP_INT_16B 32767
-        r hset k ZIP_INT_32B 2147483647
-        r hset k ZIP_INT_64B 9223372036854775808
-        r hset k ZIP_INT_IMM_MIN 0
-        r hset k ZIP_INT_IMM_MAX 12
-        r hset k ZIP_STR_06B [string repeat x 31]
-        r hset k ZIP_STR_14B [string repeat x 8191]
-        r hset k ZIP_STR_32B [string repeat x 65535]
-        set k [r hgetall k]
-        set dump [r dump k]
-
-        # will be converted to dict at RESTORE
-        r config set hash-max-ziplist-entries 2
-        r config set sanitize-dump-payload no
-        r restore kk 0 $dump
-        set kk [r hgetall kk]
-
-        # make sure the values are right
-        assert_equal [lsort $k] [lsort $kk]
-        assert_equal [dict get $k ZIP_STR_06B] [string repeat x 31]
-        set k [dict remove $k ZIP_STR_06B]
-        assert_equal [dict get $k ZIP_STR_14B] [string repeat x 8191]
-        set k [dict remove $k ZIP_STR_14B]
-        assert_equal [dict get $k ZIP_STR_32B] [string repeat x 65535]
-        set k [dict remove $k ZIP_STR_32B]
-        set _ $k
-    } {ZIP_INT_8B 127 ZIP_INT_16B 32767 ZIP_INT_32B 2147483647 ZIP_INT_64B 9223372036854775808 ZIP_INT_IMM_MIN 0 ZIP_INT_IMM_MAX 12}
-
-    test {Hash ziplist of various encodings - sanitize dump} {
-        r config set sanitize-dump-payload yes
-        r restore kk 0 $dump replace
-        set k [r hgetall k]
-        set kk [r hgetall kk]
-
-        # make sure the values are right
-        assert_equal [lsort $k] [lsort $kk]
-        assert_equal [dict get $k ZIP_STR_06B] [string repeat x 31]
-        set k [dict remove $k ZIP_STR_06B]
-        assert_equal [dict get $k ZIP_STR_14B] [string repeat x 8191]
-        set k [dict remove $k ZIP_STR_14B]
-        assert_equal [dict get $k ZIP_STR_32B] [string repeat x 65535]
-        set k [dict remove $k ZIP_STR_32B]
-        set _ $k
-    } {ZIP_INT_8B 127 ZIP_INT_16B 32767 ZIP_INT_32B 2147483647 ZIP_INT_64B 9223372036854775808 ZIP_INT_IMM_MIN 0 ZIP_INT_IMM_MAX 12}
-
-}
diff --git a/redis-stable/tests/unit/type/incr.tcl b/redis-stable/tests/unit/type/incr.tcl
deleted file mode 100644
index dbf45e45..00000000
--- a/redis-stable/tests/unit/type/incr.tcl
+++ /dev/null
@@ -1,164 +0,0 @@
-start_server {tags {"incr"}} {
-    test {INCR against non existing key} {
-        set res {}
-        append res [r incr novar]
-        append res [r get novar]
-    } {11}
-
-    test {INCR against key created by incr itself} {
-        r incr novar
-    } {2}
-
-    test {INCR against key originally set with SET} {
-        r set novar 100
-        r incr novar
-    } {101}
-
-    test {INCR over 32bit value} {
-        r set novar 17179869184
-        r incr novar
-    } {17179869185}
-
-    test {INCRBY over 32bit value with over 32bit increment} {
-        r set novar 17179869184
-        r incrby novar 17179869184
-    } {34359738368}
-
-    test {INCR fails against key with spaces (left)} {
-        r set novar "    11"
-        catch {r incr novar} err
-        format $err
-    } {ERR*}
-
-    test {INCR fails against key with spaces (right)} {
-        r set novar "11    "
-        catch {r incr novar} err
-        format $err
-    } {ERR*}
-
-    test {INCR fails against key with spaces (both)} {
-        r set novar "    11    "
-        catch {r incr novar} err
-        format $err
-    } {ERR*}
-
-    test {INCR fails against a key holding a list} {
-        r rpush mylist 1
-        catch {r incr mylist} err
-        r rpop mylist
-        format $err
-    } {WRONGTYPE*}
-
-    test {DECRBY over 32bit value with over 32bit increment, negative res} {
-        r set novar 17179869184
-        r decrby novar 17179869185
-    } {-1}
-
-    test {INCR uses shared objects in the 0-9999 range} {
-        r set foo -1
-        r incr foo
-        assert {[r object refcount foo] > 1}
-        r set foo 9998
-        r incr foo
-        assert {[r object refcount foo] > 1}
-        r incr foo
-        assert {[r object refcount foo] == 1}
-    }
-
-    test {INCR can modify objects in-place} {
-        r set foo 20000
-        r incr foo
-        assert {[r object refcount foo] == 1}
-        set old [lindex [split [r debug object foo]] 1]
-        r incr foo
-        set new [lindex [split [r debug object foo]] 1]
-        assert {[string range $old 0 2] eq "at:"}
-        assert {[string range $new 0 2] eq "at:"}
-        assert {$old eq $new}
-    }
-
-    test {INCRBYFLOAT against non existing key} {
-        r del novar
-        list    [roundFloat [r incrbyfloat novar 1]] \
-                [roundFloat [r get novar]] \
-                [roundFloat [r incrbyfloat novar 0.25]] \
-                [roundFloat [r get novar]]
-    } {1 1 1.25 1.25}
-
-    test {INCRBYFLOAT against key originally set with SET} {
-        r set novar 1.5
-        roundFloat [r incrbyfloat novar 1.5]
-    } {3}
-
-    test {INCRBYFLOAT over 32bit value} {
-        r set novar 17179869184
-        r incrbyfloat novar 1.5
-    } {17179869185.5}
-
-    test {INCRBYFLOAT over 32bit value with over 32bit increment} {
-        r set novar 17179869184
-        r incrbyfloat novar 17179869184
-    } {34359738368}
-
-    test {INCRBYFLOAT fails against key with spaces (left)} {
-        set err {}
-        r set novar "    11"
-        catch {r incrbyfloat novar 1.0} err
-        format $err
-    } {ERR*valid*}
-
-    test {INCRBYFLOAT fails against key with spaces (right)} {
-        set err {}
-        r set novar "11    "
-        catch {r incrbyfloat novar 1.0} err
-        format $err
-    } {ERR*valid*}
-
-    test {INCRBYFLOAT fails against key with spaces (both)} {
-        set err {}
-        r set novar " 11 "
-        catch {r incrbyfloat novar 1.0} err
-        format $err
-    } {ERR*valid*}
-
-    test {INCRBYFLOAT fails against a key holding a list} {
-        r del mylist
-        set err {}
-        r rpush mylist 1
-        catch {r incrbyfloat mylist 1.0} err
-        r del mylist
-        format $err
-    } {WRONGTYPE*}
-
-    # On some platforms strtold("+inf") with valgrind returns a non-inf result
-    if {!$::valgrind} {
-        test {INCRBYFLOAT does not allow NaN or Infinity} {
-            r set foo 0
-            set err {}
-            catch {r incrbyfloat foo +inf} err
-            set err
-            # p.s. no way I can force NaN to test it from the API because
-            # there is no way to increment / decrement by infinity nor to
-            # perform divisions.
-        } {ERR*would produce*}
-    }
-
-    test {INCRBYFLOAT decrement} {
-        r set foo 1
-        roundFloat [r incrbyfloat foo -1.1]
-    } {-0.1}
-
-    test {string to double with null terminator} {
-        r set foo 1
-        r setrange foo 2 2
-        catch {r incrbyfloat foo 1} err
-        format $err
-    } {ERR*valid*}
-
-    test {No negative zero} {
-        r del foo
-        r incrbyfloat foo [expr double(1)/41]
-        r incrbyfloat foo [expr double(-1)/41]
-        r get foo
-    } {0}
-}
diff --git a/redis-stable/tests/unit/type/list-2.tcl b/redis-stable/tests/unit/type/list-2.tcl
deleted file mode 100644
index 5874a902..00000000
--- a/redis-stable/tests/unit/type/list-2.tcl
+++ /dev/null
@@ -1,47 +0,0 @@
-start_server {
-    tags {"list"}
-    overrides {
-        "list-max-ziplist-size" 4
-    }
-} {
-    source "tests/unit/type/list-common.tcl"
-
-    foreach {type large} [array get largevalue] {
-        tags {"slow"} {
-            test "LTRIM stress testing - $type" {
-                set mylist {}
-                set startlen 32
-                r del mylist
-
-                # Start with the large value to ensure the
-                # right encoding is used.
-                r rpush mylist $large
-                lappend mylist $large
-
-                for {set i 0} {$i < $startlen} {incr i} {
-                    set str [randomInt 9223372036854775807]
-                    r rpush mylist $str
-                    lappend mylist $str
-                }
-
-                for {set i 0} {$i < 1000} {incr i} {
-                    set min [expr {int(rand()*$startlen)}]
-                    set max [expr {$min+int(rand()*$startlen)}]
-                    set before_len [llength $mylist]
-                    set before_len_r [r llen mylist]
-                    assert_equal $before_len $before_len_r
-                    set mylist [lrange $mylist $min $max]
-                    r ltrim mylist $min $max
-                    assert_equal $mylist [r lrange mylist 0 -1] "failed trim"
-
-                    for {set j [r llen mylist]} {$j < $startlen} {incr j} {
-                        set str [randomInt 9223372036854775807]
-                        r rpush mylist $str
-                        lappend mylist $str
-                        assert_equal $mylist [r lrange mylist 0 -1] "failed append match"
-                    }
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/type/list-3.tcl b/redis-stable/tests/unit/type/list-3.tcl
deleted file mode 100644
index b5bd48cb..00000000
--- a/redis-stable/tests/unit/type/list-3.tcl
+++ /dev/null
@@ -1,122 +0,0 @@
-start_server {
-    tags {list ziplist}
-    overrides {
-        "list-max-ziplist-size" 16
-    }
-} {
-    test {Explicit regression for a list bug} {
-        set mylist {49376042582 {BkG2o\pIC]4YYJa9cJ4GWZalG[4tin;1D2whSkCOW`mX;SFXGyS8sedcff3fQI^tgPCC@^Nu1J6o]meM@Lko]t_jRyo<xSJ1oObDYd`ppZuW6P@fS278YaOx=s6lvdFlMbP0[SbkI^Kr\HBXtuFaA^mDx:yzS4a[skiiPWhT<nNfAf=aQVfclcuwDrfe;iVuKdNvB9kbfq>tK?tH[\EvWqS]b`o2OCtjg:?nUTwdjpcUm]y:pg5q24q7LlCOwQE^}}
-        r del l
-        r rpush l [lindex $mylist 0]
-        r rpush l [lindex $mylist 1]
-        assert_equal [r lindex l 0] [lindex $mylist 0]
-        assert_equal [r lindex l 1] [lindex $mylist 1]
-    }
-
-    test {Regression for quicklist #3343 bug} {
-        r del mylist
-        r lpush mylist 401
-        r lpush mylist 392
-        r rpush mylist [string repeat x 5105]"799"
-        r lset mylist -1 [string repeat x 1014]"702"
-        r lpop mylist
-        r lset mylist -1 [string repeat x 4149]"852"
-        r linsert mylist before 401 [string repeat x 9927]"12"
-        r lrange mylist 0 -1
-        r ping ; # It's enough if the server is still alive
-    } {PONG}
-
-    test {Stress tester for #3343-alike bugs} {
-        r del key
-        for {set j 0} {$j < 10000} {incr j} {
-            set op [randomInt 6]
-            set small_signed_count [expr 5-[randomInt 10]]
-            if {[randomInt 2] == 0} {
-                set ele [randomInt 1000]
-            } else {
-                set ele [string repeat x [randomInt 10000]][randomInt 1000]
-            }
-            switch $op {
-                0 {r lpush key $ele}
-                1 {r rpush key $ele}
-                2 {r lpop key}
-                3 {r rpop key}
-                4 {
-                    catch {r lset key $small_signed_count $ele}
-                }
-                5 {
-                    set otherele [randomInt 1000]
-                    if {[randomInt 2] == 0} {
-                        set where before
-                    } else {
-                        set where after
-                    }
-                    r linsert key $where $otherele $ele
-                }
-            }
-        }
-    }
-
-    tags {slow} {
-        test {ziplist implementation: value encoding and backlink} {
-            if {$::accurate} {set iterations 100} else {set iterations 10}
-            for {set j 0} {$j < $iterations} {incr j} {
-                r del l
-                set l {}
-                for {set i 0} {$i < 200} {incr i} {
-                    randpath {
-                        set data [string repeat x [randomInt 100000]]
-                    } {
-                        set data [randomInt 65536]
-                    } {
-                        set data [randomInt 4294967296]
-                    } {
-                        set data [randomInt 18446744073709551616]
-                    } {
-                        set data -[randomInt 65536]
-                        if {$data eq {-0}} {set data 0}
-                    } {
-                        set data -[randomInt 4294967296]
-                        if {$data eq {-0}} {set data 0}
-                    } {
-                        set data -[randomInt 18446744073709551616]
-                        if {$data eq {-0}} {set data 0}
-                    }
-                    lappend l $data
-                    r rpush l $data
-                }
-                assert_equal [llength $l] [r llen l]
-                # Traverse backward
-                for {set i 199} {$i >= 0} {incr i -1} {
-                    if {[lindex $l $i] ne [r lindex l $i]} {
-                        assert_equal [lindex $l $i] [r lindex l $i]
-                    }
-                }
-            }
-        }
-
-        test {ziplist implementation: encoding stress testing} {
-            for {set j 0} {$j < 200} {incr j} {
-                r del l
-                set l {}
-                set len [randomInt 400]
-                for {set i 0} {$i < $len} {incr i} {
-                    set rv [randomValue]
-                    randpath {
-                        lappend l $rv
-                        r rpush l $rv
-                    } {
-                        set l [concat [list $rv] $l]
-                        r lpush l $rv
-                    }
-                }
-                assert_equal [llength $l] [r llen l]
-                for {set i 0} {$i < $len} {incr i} {
-                    if {[lindex $l $i] ne [r lindex l $i]} {
-                        assert_equal [lindex $l $i] [r lindex l $i]
-                    }
-                }
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/type/list-common.tcl b/redis-stable/tests/unit/type/list-common.tcl
deleted file mode 100644
index ab45f0b3..00000000
--- a/redis-stable/tests/unit/type/list-common.tcl
+++ /dev/null
@@ -1,5 +0,0 @@
-# We need a value larger than list-max-ziplist-value to make sure
-# the list has the right encoding when it is swapped in again.
-array set largevalue {}
-set largevalue(ziplist) "hello"
-set largevalue(linkedlist) [string repeat "hello" 4]
diff --git a/redis-stable/tests/unit/type/list.tcl b/redis-stable/tests/unit/type/list.tcl
deleted file mode 100644
index 9be5dd93..00000000
--- a/redis-stable/tests/unit/type/list.tcl
+++ /dev/null
@@ -1,1157 +0,0 @@
-proc wait_for_blocked_client {} {
-    wait_for_condition 50 100 {
-        [s blocked_clients] ne 0
-    } else {
-        fail "no blocked clients"
-    }
-}
-
-start_server {
-    tags {"list"}
-    overrides {
-        "list-max-ziplist-size" 5
-    }
-} {
-    source "tests/unit/type/list-common.tcl"
-
-    test {LPOS basic usage} {
-        r DEL mylist
-        r RPUSH mylist a b c 1 2 3 c c
-        assert {[r LPOS mylist a] == 0}
-        assert {[r LPOS mylist c] == 2}
-    }
-
-    test {LPOS RANK (positive and negative rank) option} {
-        assert {[r LPOS mylist c RANK 1] == 2}
-        assert {[r LPOS mylist c RANK 2] == 6}
-        assert {[r LPOS mylist c RANK 4] eq ""}
-        assert {[r LPOS mylist c RANK -1] == 7}
-        assert {[r LPOS mylist c RANK -2] == 6}
-    }
-
-    test {LPOS COUNT option} {
-        assert {[r LPOS mylist c COUNT 0] == {2 6 7}}
-        assert {[r LPOS mylist c COUNT 1] == {2}}
-        assert {[r LPOS mylist c COUNT 2] == {2 6}}
-        assert {[r LPOS mylist c COUNT 100] == {2 6 7}}
-    }
-
-    test {LPOS COUNT + RANK option} {
-        assert {[r LPOS mylist c COUNT 0 RANK 2] == {6 7}}
-        assert {[r LPOS mylist c COUNT 2 RANK -1] == {7 6}}
-    }
-
-    test {LPOS non existing key} {
-        assert {[r LPOS mylistxxx c COUNT 0 RANK 2] eq {}}
-    }
-
-    test {LPOS no match} {
-        assert {[r LPOS mylist x COUNT 2 RANK -1] eq {}}
-        assert {[r LPOS mylist x RANK -1] eq {}}
-    }
-
-    test {LPOS MAXLEN} {
-        assert {[r LPOS mylist a COUNT 0 MAXLEN 1] == {0}}
-        assert {[r LPOS mylist c COUNT 0 MAXLEN 1] == {}}
-        assert {[r LPOS mylist c COUNT 0 MAXLEN 3] == {2}}
-        assert {[r LPOS mylist c COUNT 0 MAXLEN 3 RANK -1] == {7 6}}
-        assert {[r LPOS mylist c COUNT 0 MAXLEN 7 RANK 2] == {6}}
-    }
-
-    test {LPOS when RANK is greater than matches} {
-        r DEL mylist
-        r LPUSH mylist a
-        assert {[r LPOS mylist b COUNT 10 RANK 5] eq {}}
-    }
-
-    test {LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - ziplist} {
-        # first lpush then rpush
-        assert_equal 1 [r lpush myziplist1 aa]
-        assert_equal 2 [r rpush myziplist1 bb]
-        assert_equal 3 [r rpush myziplist1 cc]
-        assert_equal 3 [r llen myziplist1]
-        assert_equal aa [r lindex myziplist1 0]
-        assert_equal bb [r lindex myziplist1 1]
-        assert_equal cc [r lindex myziplist1 2]
-        assert_equal {} [r lindex myziplist2 3]
-        assert_equal cc [r rpop myziplist1]
-        assert_equal aa [r lpop myziplist1]
-        assert_encoding quicklist myziplist1
-
-        # first rpush then lpush
-        assert_equal 1 [r rpush myziplist2 a]
-        assert_equal 2 [r lpush myziplist2 b]
-        assert_equal 3 [r lpush myziplist2 c]
-        assert_equal 3 [r llen myziplist2]
-        assert_equal c [r lindex myziplist2 0]
-        assert_equal b [r lindex myziplist2 1]
-        assert_equal a [r lindex myziplist2 2]
-        assert_equal {} [r lindex myziplist2 3]
-        assert_equal a [r rpop myziplist2]
-        assert_equal c [r lpop myziplist2]
-        assert_encoding quicklist myziplist2
-    }
-
-    test {LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - regular list} {
-        # first lpush then rpush
-        assert_equal 1 [r lpush mylist1 $largevalue(linkedlist)]
-        assert_encoding quicklist mylist1
-        assert_equal 2 [r rpush mylist1 b]
-        assert_equal 3 [r rpush mylist1 c]
-        assert_equal 3 [r llen mylist1]
-        assert_equal $largevalue(linkedlist) [r lindex mylist1 0]
-        assert_equal b [r lindex mylist1 1]
-        assert_equal c [r lindex mylist1 2]
-        assert_equal {} [r lindex mylist1 3]
-        assert_equal c [r rpop mylist1]
-        assert_equal $largevalue(linkedlist) [r lpop mylist1]
-
-        # first rpush then lpush
-        assert_equal 1 [r rpush mylist2 $largevalue(linkedlist)]
-        assert_encoding quicklist mylist2
-        assert_equal 2 [r lpush mylist2 b]
-        assert_equal 3 [r lpush mylist2 c]
-        assert_equal 3 [r llen mylist2]
-        assert_equal c [r lindex mylist2 0]
-        assert_equal b [r lindex mylist2 1]
-        assert_equal $largevalue(linkedlist) [r lindex mylist2 2]
-        assert_equal {} [r lindex mylist2 3]
-        assert_equal $largevalue(linkedlist) [r rpop mylist2]
-        assert_equal c [r lpop mylist2]
-    }
-
-    test {R/LPOP against empty list} {
-        r lpop non-existing-list
-    } {}
-    
-    test {R/LPOP with the optional count argument} {
-        assert_equal 7 [r lpush listcount aa bb cc dd ee ff gg]
-        assert_equal {} [r lpop listcount 0]
-        assert_equal {gg} [r lpop listcount 1]
-        assert_equal {ff ee} [r lpop listcount 2]
-        assert_equal {aa bb} [r rpop listcount 2]
-        assert_equal {cc} [r rpop listcount 1]
-        assert_equal {dd} [r rpop listcount 123]
-        assert_error "*ERR*range*" {r lpop forbarqaz -123}
-    }
-
-    test {Variadic RPUSH/LPUSH} {
-        r del mylist
-        assert_equal 4 [r lpush mylist a b c d]
-        assert_equal 8 [r rpush mylist 0 1 2 3]
-        assert_equal {d c b a 0 1 2 3} [r lrange mylist 0 -1]
-    }
-
-    test {DEL a list} {
-        assert_equal 1 [r del mylist2]
-        assert_equal 0 [r exists mylist2]
-        assert_equal 0 [r llen mylist2]
-    }
-
-    proc create_list {key entries} {
-        r del $key
-        foreach entry $entries { r rpush $key $entry }
-        assert_encoding quicklist $key
-    }
-
-    foreach {type large} [array get largevalue] {
-        test "BLPOP, BRPOP: single existing list - $type" {
-            set rd [redis_deferring_client]
-            create_list blist "a b $large c d"
-
-            $rd blpop blist 1
-            assert_equal {blist a} [$rd read]
-            $rd brpop blist 1
-            assert_equal {blist d} [$rd read]
-
-            $rd blpop blist 1
-            assert_equal {blist b} [$rd read]
-            $rd brpop blist 1
-            assert_equal {blist c} [$rd read]
-        }
-
-        test "BLPOP, BRPOP: multiple existing lists - $type" {
-            set rd [redis_deferring_client]
-            create_list blist1 "a $large c"
-            create_list blist2 "d $large f"
-
-            $rd blpop blist1 blist2 1
-            assert_equal {blist1 a} [$rd read]
-            $rd brpop blist1 blist2 1
-            assert_equal {blist1 c} [$rd read]
-            assert_equal 1 [r llen blist1]
-            assert_equal 3 [r llen blist2]
-
-            $rd blpop blist2 blist1 1
-            assert_equal {blist2 d} [$rd read]
-            $rd brpop blist2 blist1 1
-            assert_equal {blist2 f} [$rd read]
-            assert_equal 1 [r llen blist1]
-            assert_equal 1 [r llen blist2]
-        }
-
-        test "BLPOP, BRPOP: second list has an entry - $type" {
-            set rd [redis_deferring_client]
-            r del blist1
-            create_list blist2 "d $large f"
-
-            $rd blpop blist1 blist2 1
-            assert_equal {blist2 d} [$rd read]
-            $rd brpop blist1 blist2 1
-            assert_equal {blist2 f} [$rd read]
-            assert_equal 0 [r llen blist1]
-            assert_equal 1 [r llen blist2]
-        }
-
-        test "BRPOPLPUSH - $type" {
-            r del target
-            r rpush target bar
-
-            set rd [redis_deferring_client]
-            create_list blist "a b $large c d"
-
-            $rd brpoplpush blist target 1
-            assert_equal d [$rd read]
-
-            assert_equal d [r lpop target]
-            assert_equal "a b $large c" [r lrange blist 0 -1]
-        }
-
-        foreach wherefrom {left right} {
-            foreach whereto {left right} {
-                test "BLMOVE $wherefrom $whereto - $type" {
-                    r del target
-                    r rpush target bar
-
-                    set rd [redis_deferring_client]
-                    create_list blist "a b $large c d"
-
-                    $rd blmove blist target $wherefrom $whereto 1
-                    set poppedelement [$rd read]
-
-                    if {$wherefrom eq "right"} {
-                        assert_equal d $poppedelement
-                        assert_equal "a b $large c" [r lrange blist 0 -1]
-                    } else {
-                        assert_equal a $poppedelement
-                        assert_equal "b $large c d" [r lrange blist 0 -1]
-                    }
-
-                    if {$whereto eq "right"} {
-                        assert_equal $poppedelement [r rpop target]
-                    } else {
-                        assert_equal $poppedelement [r lpop target]
-                    }
-                }
-            }
-        }
-    }
-
-    test "BLPOP, LPUSH + DEL should not awake blocked client" {
-        set rd [redis_deferring_client]
-        r del list
-
-        $rd blpop list 0
-        r multi
-        r lpush list a
-        r del list
-        r exec
-        r del list
-        r lpush list b
-        $rd read
-    } {list b}
-
-    test "BLPOP, LPUSH + DEL + SET should not awake blocked client" {
-        set rd [redis_deferring_client]
-        r del list
-
-        $rd blpop list 0
-        after 100 ;# Make sure rd is blocked before MULTI
-
-        r multi
-        r lpush list a
-        r del list
-        r set list foo
-        r exec
-        r del list
-        r lpush list b
-        $rd read
-    } {list b}
-
-    test "BLPOP with same key multiple times should work (issue #801)" {
-        set rd [redis_deferring_client]
-        r del list1 list2
-
-        # Data arriving after the BLPOP.
-        $rd blpop list1 list2 list2 list1 0
-        r lpush list1 a
-        assert_equal [$rd read] {list1 a}
-        $rd blpop list1 list2 list2 list1 0
-        r lpush list2 b
-        assert_equal [$rd read] {list2 b}
-
-        # Data already there.
-        r lpush list1 a
-        r lpush list2 b
-        $rd blpop list1 list2 list2 list1 0
-        assert_equal [$rd read] {list1 a}
-        $rd blpop list1 list2 list2 list1 0
-        assert_equal [$rd read] {list2 b}
-    }
-
-    test "MULTI/EXEC is isolated from the point of view of BLPOP" {
-        set rd [redis_deferring_client]
-        r del list
-        $rd blpop list 0
-        r multi
-        r lpush list a
-        r lpush list b
-        r lpush list c
-        r exec
-        $rd read
-    } {list c}
-
-    test "BLPOP with variadic LPUSH" {
-        set rd [redis_deferring_client]
-        r del blist target
-        if {$::valgrind} {after 100}
-        $rd blpop blist 0
-        if {$::valgrind} {after 100}
-        assert_equal 2 [r lpush blist foo bar]
-        if {$::valgrind} {after 100}
-        assert_equal {blist bar} [$rd read]
-        assert_equal foo [lindex [r lrange blist 0 -1] 0]
-    }
-
-    test "BRPOPLPUSH with zero timeout should block indefinitely" {
-        set rd [redis_deferring_client]
-        r del blist target
-        r rpush target bar
-        $rd brpoplpush blist target 0
-        wait_for_condition 100 10 {
-            [s blocked_clients] == 1
-        } else {
-            fail "Timeout waiting for blocked clients"
-        }
-        r rpush blist foo
-        assert_equal foo [$rd read]
-        assert_equal {foo bar} [r lrange target 0 -1]
-    }
-
-    foreach wherefrom {left right} {
-        foreach whereto {left right} {
-            test "BLMOVE $wherefrom $whereto with zero timeout should block indefinitely" {
-                set rd [redis_deferring_client]
-                r del blist target
-                r rpush target bar
-                $rd blmove blist target $wherefrom $whereto 0
-                wait_for_condition 100 10 {
-                    [s blocked_clients] == 1
-                } else {
-                    fail "Timeout waiting for blocked clients"
-                }
-                r rpush blist foo
-                assert_equal foo [$rd read]
-                if {$whereto eq "right"} {
-                    assert_equal {bar foo} [r lrange target 0 -1]
-                } else {
-                    assert_equal {foo bar} [r lrange target 0 -1]
-                }
-            }
-        }
-    }
-
-    foreach wherefrom {left right} {
-        foreach whereto {left right} {
-            test "BLMOVE ($wherefrom, $whereto) with a client BLPOPing the target list" {
-                set rd [redis_deferring_client]
-                set rd2 [redis_deferring_client]
-                r del blist target
-                $rd2 blpop target 0
-                $rd blmove blist target $wherefrom $whereto 0
-                wait_for_condition 100 10 {
-                    [s blocked_clients] == 2
-                } else {
-                    fail "Timeout waiting for blocked clients"
-                }
-                r rpush blist foo
-                assert_equal foo [$rd read]
-                assert_equal {target foo} [$rd2 read]
-                assert_equal 0 [r exists target]
-            }
-        }
-    }
-
-    test "BRPOPLPUSH with wrong source type" {
-        set rd [redis_deferring_client]
-        r del blist target
-        r set blist nolist
-        $rd brpoplpush blist target 1
-        assert_error "WRONGTYPE*" {$rd read}
-    }
-
-    test "BRPOPLPUSH with wrong destination type" {
-        set rd [redis_deferring_client]
-        r del blist target
-        r set target nolist
-        r lpush blist foo
-        $rd brpoplpush blist target 1
-        assert_error "WRONGTYPE*" {$rd read}
-
-        set rd [redis_deferring_client]
-        r del blist target
-        r set target nolist
-        $rd brpoplpush blist target 0
-        wait_for_condition 100 10 {
-            [s blocked_clients] == 1
-        } else {
-            fail "Timeout waiting for blocked clients"
-        }
-        r rpush blist foo
-        assert_error "WRONGTYPE*" {$rd read}
-        assert_equal {foo} [r lrange blist 0 -1]
-    }
-
-    test "BRPOPLPUSH maintains order of elements after failure" {
-        set rd [redis_deferring_client]
-        r del blist target
-        r set target nolist
-        $rd brpoplpush blist target 0
-        r rpush blist a b c
-        assert_error "WRONGTYPE*" {$rd read}
-        r lrange blist 0 -1
-    } {a b c}
-
-    test "BRPOPLPUSH with multiple blocked clients" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-        r del blist target1 target2
-        r set target1 nolist
-        $rd1 brpoplpush blist target1 0
-        $rd2 brpoplpush blist target2 0
-        r lpush blist foo
-
-        assert_error "WRONGTYPE*" {$rd1 read}
-        assert_equal {foo} [$rd2 read]
-        assert_equal {foo} [r lrange target2 0 -1]
-    }
-
-    test "Linked LMOVEs" {
-      set rd1 [redis_deferring_client]
-      set rd2 [redis_deferring_client]
-
-      r del list1 list2 list3
-
-      $rd1 blmove list1 list2 right left 0
-      $rd2 blmove list2 list3 left right 0
-
-      r rpush list1 foo
-
-      assert_equal {} [r lrange list1 0 -1]
-      assert_equal {} [r lrange list2 0 -1]
-      assert_equal {foo} [r lrange list3 0 -1]
-    }
-
-    test "Circular BRPOPLPUSH" {
-      set rd1 [redis_deferring_client]
-      set rd2 [redis_deferring_client]
-
-      r del list1 list2
-
-      $rd1 brpoplpush list1 list2 0
-      $rd2 brpoplpush list2 list1 0
-
-      r rpush list1 foo
-
-      assert_equal {foo} [r lrange list1 0 -1]
-      assert_equal {} [r lrange list2 0 -1]
-    }
-
-    test "Self-referential BRPOPLPUSH" {
-      set rd [redis_deferring_client]
-
-      r del blist
-
-      $rd brpoplpush blist blist 0
-
-      r rpush blist foo
-
-      assert_equal {foo} [r lrange blist 0 -1]
-    }
-
-    test "BRPOPLPUSH inside a transaction" {
-        r del xlist target
-        r lpush xlist foo
-        r lpush xlist bar
-
-        r multi
-        r brpoplpush xlist target 0
-        r brpoplpush xlist target 0
-        r brpoplpush xlist target 0
-        r lrange xlist 0 -1
-        r lrange target 0 -1
-        r exec
-    } {foo bar {} {} {bar foo}}
-
-    test "PUSH resulting from BRPOPLPUSH affect WATCH" {
-        set blocked_client [redis_deferring_client]
-        set watching_client [redis_deferring_client]
-        r del srclist dstlist somekey
-        r set somekey somevalue
-        $blocked_client brpoplpush srclist dstlist 0
-        $watching_client watch dstlist
-        $watching_client read
-        $watching_client multi
-        $watching_client read
-        $watching_client get somekey
-        $watching_client read
-        r lpush srclist element
-        $watching_client exec
-        $watching_client read
-    } {}
-
-    test "BRPOPLPUSH does not affect WATCH while still blocked" {
-        set blocked_client [redis_deferring_client]
-        set watching_client [redis_deferring_client]
-        r del srclist dstlist somekey
-        r set somekey somevalue
-        $blocked_client brpoplpush srclist dstlist 0
-        $watching_client watch dstlist
-        $watching_client read
-        $watching_client multi
-        $watching_client read
-        $watching_client get somekey
-        $watching_client read
-        $watching_client exec
-        # Blocked BLPOPLPUSH may create problems, unblock it.
-        r lpush srclist element
-        $watching_client read
-    } {somevalue}
-
-    test {BRPOPLPUSH timeout} {
-      set rd [redis_deferring_client]
-
-      $rd brpoplpush foo_list bar_list 1
-      wait_for_condition 100 10 {
-          [s blocked_clients] == 1
-      } else {
-          fail "Timeout waiting for blocked client"
-      }
-      wait_for_condition 500 10 {
-          [s blocked_clients] == 0
-      } else {
-          fail "Timeout waiting for client to unblock"
-      }
-      $rd read
-    } {}
-
-    test "BLPOP when new key is moved into place" {
-        set rd [redis_deferring_client]
-
-        $rd blpop foo 5
-        r lpush bob abc def hij
-        r rename bob foo
-        $rd read
-    } {foo hij}
-
-    test "BLPOP when result key is created by SORT..STORE" {
-        set rd [redis_deferring_client]
-
-        # zero out list from previous test without explicit delete
-        r lpop foo
-        r lpop foo
-        r lpop foo
-
-        $rd blpop foo 5
-        r lpush notfoo hello hola aguacate konichiwa zanzibar
-        r sort notfoo ALPHA store foo
-        $rd read
-    } {foo aguacate}
-
-    foreach {pop} {BLPOP BRPOP} {
-        test "$pop: with single empty list argument" {
-            set rd [redis_deferring_client]
-            r del blist1
-            $rd $pop blist1 1
-            r rpush blist1 foo
-            assert_equal {blist1 foo} [$rd read]
-            assert_equal 0 [r exists blist1]
-        }
-
-        test "$pop: with negative timeout" {
-            set rd [redis_deferring_client]
-            $rd $pop blist1 -1
-            assert_error "ERR*is negative*" {$rd read}
-        }
-
-        test "$pop: with non-integer timeout" {
-            set rd [redis_deferring_client]
-            r del blist1
-            $rd $pop blist1 0.1
-            r rpush blist1 foo
-            assert_equal {blist1 foo} [$rd read]
-            assert_equal 0 [r exists blist1]
-        }
-
-        test "$pop: with zero timeout should block indefinitely" {
-            # To test this, use a timeout of 0 and wait a second.
-            # The blocking pop should still be waiting for a push.
-            set rd [redis_deferring_client]
-            $rd $pop blist1 0
-            after 1000
-            r rpush blist1 foo
-            assert_equal {blist1 foo} [$rd read]
-        }
-
-        test "$pop: second argument is not a list" {
-            set rd [redis_deferring_client]
-            r del blist1 blist2
-            r set blist2 nolist
-            $rd $pop blist1 blist2 1
-            assert_error "WRONGTYPE*" {$rd read}
-        }
-
-        test "$pop: timeout" {
-            set rd [redis_deferring_client]
-            r del blist1 blist2
-            $rd $pop blist1 blist2 1
-            assert_equal {} [$rd read]
-        }
-
-        test "$pop: arguments are empty" {
-            set rd [redis_deferring_client]
-            r del blist1 blist2
-
-            $rd $pop blist1 blist2 1
-            r rpush blist1 foo
-            assert_equal {blist1 foo} [$rd read]
-            assert_equal 0 [r exists blist1]
-            assert_equal 0 [r exists blist2]
-
-            $rd $pop blist1 blist2 1
-            r rpush blist2 foo
-            assert_equal {blist2 foo} [$rd read]
-            assert_equal 0 [r exists blist1]
-            assert_equal 0 [r exists blist2]
-        }
-    }
-
-    test {BLPOP inside a transaction} {
-        r del xlist
-        r lpush xlist foo
-        r lpush xlist bar
-        r multi
-        r blpop xlist 0
-        r blpop xlist 0
-        r blpop xlist 0
-        r exec
-    } {{xlist bar} {xlist foo} {}}
-
-    test {LPUSHX, RPUSHX - generic} {
-        r del xlist
-        assert_equal 0 [r lpushx xlist a]
-        assert_equal 0 [r llen xlist]
-        assert_equal 0 [r rpushx xlist a]
-        assert_equal 0 [r llen xlist]
-    }
-
-    foreach {type large} [array get largevalue] {
-        test "LPUSHX, RPUSHX - $type" {
-            create_list xlist "$large c"
-            assert_equal 3 [r rpushx xlist d]
-            assert_equal 4 [r lpushx xlist a]
-            assert_equal 6 [r rpushx xlist 42 x]
-            assert_equal 9 [r lpushx xlist y3 y2 y1]
-            assert_equal "y1 y2 y3 a $large c d 42 x" [r lrange xlist 0 -1]
-        }
-
-        test "LINSERT - $type" {
-            create_list xlist "a $large c d"
-            assert_equal 5 [r linsert xlist before c zz] "before c"
-            assert_equal "a $large zz c d" [r lrange xlist 0 10] "lrangeA"
-            assert_equal 6 [r linsert xlist after c yy] "after c"
-            assert_equal "a $large zz c yy d" [r lrange xlist 0 10] "lrangeB"
-            assert_equal 7 [r linsert xlist after d dd] "after d"
-            assert_equal -1 [r linsert xlist after bad ddd] "after bad"
-            assert_equal "a $large zz c yy d dd" [r lrange xlist 0 10] "lrangeC"
-            assert_equal 8 [r linsert xlist before a aa] "before a"
-            assert_equal -1 [r linsert xlist before bad aaa] "before bad"
-            assert_equal "aa a $large zz c yy d dd" [r lrange xlist 0 10] "lrangeD"
-
-            # check inserting integer encoded value
-            assert_equal 9 [r linsert xlist before aa 42] "before aa"
-            assert_equal 42 [r lrange xlist 0 0] "lrangeE"
-        }
-    }
-
-    test {LINSERT raise error on bad syntax} {
-        catch {[r linsert xlist aft3r aa 42]} e
-        set e
-    } {*ERR*syntax*error*}
-
-    foreach {type num} {quicklist 250 quicklist 500} {
-        proc check_numbered_list_consistency {key} {
-            set len [r llen $key]
-            for {set i 0} {$i < $len} {incr i} {
-                assert_equal $i [r lindex $key $i]
-                assert_equal [expr $len-1-$i] [r lindex $key [expr (-$i)-1]]
-            }
-        }
-
-        proc check_random_access_consistency {key} {
-            set len [r llen $key]
-            for {set i 0} {$i < $len} {incr i} {
-                set rint [expr int(rand()*$len)]
-                assert_equal $rint [r lindex $key $rint]
-                assert_equal [expr $len-1-$rint] [r lindex $key [expr (-$rint)-1]]
-            }
-        }
-
-        test "LINDEX consistency test - $type" {
-            r del mylist
-            for {set i 0} {$i < $num} {incr i} {
-                r rpush mylist $i
-            }
-            assert_encoding $type mylist
-            check_numbered_list_consistency mylist
-        }
-
-        test "LINDEX random access - $type" {
-            assert_encoding $type mylist
-            check_random_access_consistency mylist
-        }
-
-        test "Check if list is still ok after a DEBUG RELOAD - $type" {
-            r debug reload
-            assert_encoding $type mylist
-            check_numbered_list_consistency mylist
-            check_random_access_consistency mylist
-        }
-    }
-
-    test {LLEN against non-list value error} {
-        r del mylist
-        r set mylist foobar
-        assert_error WRONGTYPE* {r llen mylist}
-    }
-
-    test {LLEN against non existing key} {
-        assert_equal 0 [r llen not-a-key]
-    }
-
-    test {LINDEX against non-list value error} {
-        assert_error WRONGTYPE* {r lindex mylist 0}
-    }
-
-    test {LINDEX against non existing key} {
-        assert_equal "" [r lindex not-a-key 10]
-    }
-
-    test {LPUSH against non-list value error} {
-        assert_error WRONGTYPE* {r lpush mylist 0}
-    }
-
-    test {RPUSH against non-list value error} {
-        assert_error WRONGTYPE* {r rpush mylist 0}
-    }
-
-    foreach {type large} [array get largevalue] {
-        test "RPOPLPUSH base case - $type" {
-            r del mylist1 mylist2
-            create_list mylist1 "a $large c d"
-            assert_equal d [r rpoplpush mylist1 mylist2]
-            assert_equal c [r rpoplpush mylist1 mylist2]
-            assert_equal "a $large" [r lrange mylist1 0 -1]
-            assert_equal "c d" [r lrange mylist2 0 -1]
-            assert_encoding quicklist mylist2
-        }
-
-        foreach wherefrom {left right} {
-            foreach whereto {left right} {
-                test "LMOVE $wherefrom $whereto base case - $type" {
-                    r del mylist1 mylist2
-
-                    if {$wherefrom eq "right"} {
-                        create_list mylist1 "c d $large a"
-                    } else {
-                        create_list mylist1 "a $large c d"
-                    }
-                    assert_equal a [r lmove mylist1 mylist2 $wherefrom $whereto]
-                    assert_equal $large [r lmove mylist1 mylist2 $wherefrom $whereto]
-                    assert_equal "c d" [r lrange mylist1 0 -1]
-                    if {$whereto eq "right"} {
-                        assert_equal "a $large" [r lrange mylist2 0 -1]
-                    } else {
-                        assert_equal "$large a" [r lrange mylist2 0 -1]
-                    }
-                    assert_encoding quicklist mylist2
-                }
-            }
-        }
-
-        test "RPOPLPUSH with the same list as src and dst - $type" {
-            create_list mylist "a $large c"
-            assert_equal "a $large c" [r lrange mylist 0 -1]
-            assert_equal c [r rpoplpush mylist mylist]
-            assert_equal "c a $large" [r lrange mylist 0 -1]
-        }
-
-        foreach wherefrom {left right} {
-            foreach whereto {left right} {
-                test "LMOVE $wherefrom $whereto with the same list as src and dst - $type" {
-                    if {$wherefrom eq "right"} {
-                        create_list mylist "a $large c"
-                        assert_equal "a $large c" [r lrange mylist 0 -1]
-                    } else {
-                        create_list mylist "c a $large"
-                        assert_equal "c a $large" [r lrange mylist 0 -1]
-                    }
-                    assert_equal c [r lmove mylist mylist $wherefrom $whereto]
-                    if {$whereto eq "right"} {
-                        assert_equal "a $large c" [r lrange mylist 0 -1]
-                    } else {
-                        assert_equal "c a $large" [r lrange mylist 0 -1]
-                    }
-                }
-            }
-        }
-
-        foreach {othertype otherlarge} [array get largevalue] {
-            test "RPOPLPUSH with $type source and existing target $othertype" {
-                create_list srclist "a b c $large"
-                create_list dstlist "$otherlarge"
-                assert_equal $large [r rpoplpush srclist dstlist]
-                assert_equal c [r rpoplpush srclist dstlist]
-                assert_equal "a b" [r lrange srclist 0 -1]
-                assert_equal "c $large $otherlarge" [r lrange dstlist 0 -1]
-
-                # When we rpoplpush'ed a large value, dstlist should be
-                # converted to the same encoding as srclist.
-                if {$type eq "linkedlist"} {
-                    assert_encoding quicklist dstlist
-                }
-            }
-
-            foreach wherefrom {left right} {
-                foreach whereto {left right} {
-                    test "LMOVE $wherefrom $whereto with $type source and existing target $othertype" {
-                        create_list dstlist "$otherlarge"
-
-                        if {$wherefrom eq "right"} {
-                            create_list srclist "a b c $large"
-                        } else {
-                            create_list srclist "$large c a b"
-                        }
-                        assert_equal $large [r lmove srclist dstlist $wherefrom $whereto]
-                        assert_equal c [r lmove srclist dstlist $wherefrom $whereto]
-                        assert_equal "a b" [r lrange srclist 0 -1]
-
-                        if {$whereto eq "right"} {
-                            assert_equal "$otherlarge $large c" [r lrange dstlist 0 -1]
-                        } else {
-                            assert_equal "c $large $otherlarge" [r lrange dstlist 0 -1]
-                        }
-
-                        # When we lmoved a large value, dstlist should be
-                        # converted to the same encoding as srclist.
-                        if {$type eq "linkedlist"} {
-                            assert_encoding quicklist dstlist
-                        }
-                    }
-                }
-            }
-        }
-    }
-
-    test {RPOPLPUSH against non existing key} {
-        r del srclist dstlist
-        assert_equal {} [r rpoplpush srclist dstlist]
-        assert_equal 0 [r exists srclist]
-        assert_equal 0 [r exists dstlist]
-    }
-
-    test {RPOPLPUSH against non list src key} {
-        r del srclist dstlist
-        r set srclist x
-        assert_error WRONGTYPE* {r rpoplpush srclist dstlist}
-        assert_type string srclist
-        assert_equal 0 [r exists newlist]
-    }
-
-    test {RPOPLPUSH against non list dst key} {
-        create_list srclist {a b c d}
-        r set dstlist x
-        assert_error WRONGTYPE* {r rpoplpush srclist dstlist}
-        assert_type string dstlist
-        assert_equal {a b c d} [r lrange srclist 0 -1]
-    }
-
-    test {RPOPLPUSH against non existing src key} {
-        r del srclist dstlist
-        assert_equal {} [r rpoplpush srclist dstlist]
-    } {}
-
-    foreach {type large} [array get largevalue] {
-        test "Basic LPOP/RPOP - $type" {
-            create_list mylist "$large 1 2"
-            assert_equal $large [r lpop mylist]
-            assert_equal 2 [r rpop mylist]
-            assert_equal 1 [r lpop mylist]
-            assert_equal 0 [r llen mylist]
-
-            # pop on empty list
-            assert_equal {} [r lpop mylist]
-            assert_equal {} [r rpop mylist]
-        }
-    }
-
-    test {LPOP/RPOP against non list value} {
-        r set notalist foo
-        assert_error WRONGTYPE* {r lpop notalist}
-        assert_error WRONGTYPE* {r rpop notalist}
-    }
-
-    foreach {type num} {quicklist 250 quicklist 500} {
-        test "Mass RPOP/LPOP - $type" {
-            r del mylist
-            set sum1 0
-            for {set i 0} {$i < $num} {incr i} {
-                r lpush mylist $i
-                incr sum1 $i
-            }
-            assert_encoding $type mylist
-            set sum2 0
-            for {set i 0} {$i < [expr $num/2]} {incr i} {
-                incr sum2 [r lpop mylist]
-                incr sum2 [r rpop mylist]
-            }
-            assert_equal $sum1 $sum2
-        }
-    }
-
-    foreach {type large} [array get largevalue] {
-        test "LRANGE basics - $type" {
-            create_list mylist "$large 1 2 3 4 5 6 7 8 9"
-            assert_equal {1 2 3 4 5 6 7 8} [r lrange mylist 1 -2]
-            assert_equal {7 8 9} [r lrange mylist -3 -1]
-            assert_equal {4} [r lrange mylist 4 4]
-        }
-
-        test "LRANGE inverted indexes - $type" {
-            create_list mylist "$large 1 2 3 4 5 6 7 8 9"
-            assert_equal {} [r lrange mylist 6 2]
-        }
-
-        test "LRANGE out of range indexes including the full list - $type" {
-            create_list mylist "$large 1 2 3"
-            assert_equal "$large 1 2 3" [r lrange mylist -1000 1000]
-        }
-
-        test "LRANGE out of range negative end index - $type" {
-            create_list mylist "$large 1 2 3"
-            assert_equal $large [r lrange mylist 0 -4]
-            assert_equal {} [r lrange mylist 0 -5]
-        }
-    }
-
-    test {LRANGE against non existing key} {
-        assert_equal {} [r lrange nosuchkey 0 1]
-    }
-
-    test {LRANGE with start > end yields an empty array for backward compatibility} {
-        create_list mylist "1 2 3"
-        assert_equal {} [r lrange mylist 1 0]
-        assert_equal {} [r lrange mylist -1 -2]
-    }
-
-    foreach {type large} [array get largevalue] {
-        proc trim_list {type min max} {
-            upvar 1 large large
-            r del mylist
-            create_list mylist "1 2 3 4 $large"
-            r ltrim mylist $min $max
-            r lrange mylist 0 -1
-        }
-
-        test "LTRIM basics - $type" {
-            assert_equal "1" [trim_list $type 0 0]
-            assert_equal "1 2" [trim_list $type 0 1]
-            assert_equal "1 2 3" [trim_list $type 0 2]
-            assert_equal "2 3" [trim_list $type 1 2]
-            assert_equal "2 3 4 $large" [trim_list $type 1 -1]
-            assert_equal "2 3 4" [trim_list $type 1 -2]
-            assert_equal "4 $large" [trim_list $type -2 -1]
-            assert_equal "$large" [trim_list $type -1 -1]
-            assert_equal "1 2 3 4 $large" [trim_list $type -5 -1]
-            assert_equal "1 2 3 4 $large" [trim_list $type -10 10]
-            assert_equal "1 2 3 4 $large" [trim_list $type 0 5]
-            assert_equal "1 2 3 4 $large" [trim_list $type 0 10]
-        }
-
-        test "LTRIM out of range negative end index - $type" {
-            assert_equal {1} [trim_list $type 0 -5]
-            assert_equal {} [trim_list $type 0 -6]
-        }
-
-    }
-
-    foreach {type large} [array get largevalue] {
-        test "LSET - $type" {
-            create_list mylist "99 98 $large 96 95"
-            r lset mylist 1 foo
-            r lset mylist -1 bar
-            assert_equal "99 foo $large 96 bar" [r lrange mylist 0 -1]
-        }
-
-        test "LSET out of range index - $type" {
-            assert_error ERR*range* {r lset mylist 10 foo}
-        }
-    }
-
-    test {LSET against non existing key} {
-        assert_error ERR*key* {r lset nosuchkey 10 foo}
-    }
-
-    test {LSET against non list value} {
-        r set nolist foobar
-        assert_error WRONGTYPE* {r lset nolist 0 foo}
-    }
-
-    foreach {type e} [array get largevalue] {
-        test "LREM remove all the occurrences - $type" {
-            create_list mylist "$e foo bar foobar foobared zap bar test foo"
-            assert_equal 2 [r lrem mylist 0 bar]
-            assert_equal "$e foo foobar foobared zap test foo" [r lrange mylist 0 -1]
-        }
-
-        test "LREM remove the first occurrence - $type" {
-            assert_equal 1 [r lrem mylist 1 foo]
-            assert_equal "$e foobar foobared zap test foo" [r lrange mylist 0 -1]
-        }
-
-        test "LREM remove non existing element - $type" {
-            assert_equal 0 [r lrem mylist 1 nosuchelement]
-            assert_equal "$e foobar foobared zap test foo" [r lrange mylist 0 -1]
-        }
-
-        test "LREM starting from tail with negative count - $type" {
-            create_list mylist "$e foo bar foobar foobared zap bar test foo foo"
-            assert_equal 1 [r lrem mylist -1 bar]
-            assert_equal "$e foo bar foobar foobared zap test foo foo" [r lrange mylist 0 -1]
-        }
-
-        test "LREM starting from tail with negative count (2) - $type" {
-            assert_equal 2 [r lrem mylist -2 foo]
-            assert_equal "$e foo bar foobar foobared zap test" [r lrange mylist 0 -1]
-        }
-
-        test "LREM deleting objects that may be int encoded - $type" {
-            create_list myotherlist "$e 1 2 3"
-            assert_equal 1 [r lrem myotherlist 1 2]
-            assert_equal 3 [r llen myotherlist]
-        }
-    }
-
-    test "Regression for bug 593 - chaining BRPOPLPUSH with other blocking cmds" {
-        set rd1 [redis_deferring_client]
-        set rd2 [redis_deferring_client]
-
-        $rd1 brpoplpush a b 0
-        $rd1 brpoplpush a b 0
-        $rd2 brpoplpush b c 0
-        after 1000
-        r lpush a data
-        $rd1 close
-        $rd2 close
-        r ping
-    } {PONG}
-
-    test "client unblock tests" {
-        r del l
-        set rd [redis_deferring_client]
-        $rd client id
-        set id [$rd read]
-
-        # test default args
-        $rd blpop l 0
-        wait_for_blocked_client
-        r client unblock $id
-        assert_equal {} [$rd read]
-
-        # test with timeout
-        $rd blpop l 0
-        wait_for_blocked_client
-        r client unblock $id TIMEOUT
-        assert_equal {} [$rd read]
-
-        # test with error
-        $rd blpop l 0
-        wait_for_blocked_client
-        r client unblock $id ERROR
-        catch {[$rd read]} e
-        assert_equal $e "UNBLOCKED client unblocked via CLIENT UNBLOCK"
-
-        # test with invalid client id
-        catch {[r client unblock asd]} e
-        assert_equal $e "ERR value is not an integer or out of range"
-
-        # test with non blocked client
-        set myid [r client id]
-        catch {[r client unblock $myid]} e
-        assert_equal $e {invalid command name "0"}
-
-        # finally, see the this client and list are still functional
-        $rd blpop l 0
-        wait_for_blocked_client
-        r lpush l foo
-        assert_equal {l foo} [$rd read]
-    } {}
-
-    test {List ziplist of various encodings} {
-        r del k
-        r lpush k 127 ;# ZIP_INT_8B
-        r lpush k 32767 ;# ZIP_INT_16B
-        r lpush k 2147483647 ;# ZIP_INT_32B
-        r lpush k 9223372036854775808 ;# ZIP_INT_64B
-        r lpush k 0 ;# ZIP_INT_IMM_MIN
-        r lpush k 12 ;# ZIP_INT_IMM_MAX
-        r lpush k [string repeat x 31] ;# ZIP_STR_06B
-        r lpush k [string repeat x 8191] ;# ZIP_STR_14B
-        r lpush k [string repeat x 65535] ;# ZIP_STR_32B
-        set k [r lrange k 0 -1]
-        set dump [r dump k]
-
-        r config set sanitize-dump-payload no
-        r restore kk 0 $dump
-        set kk [r lrange kk 0 -1]
-
-        # try some forward and backward searches to make sure all encodings
-        # can be traversed
-        assert_equal [r lindex kk 5] {9223372036854775808}
-        assert_equal [r lindex kk -5] {0}
-        assert_equal [r lpos kk foo rank 1] {}
-        assert_equal [r lpos kk foo rank -1] {}
-
-        # make sure the values are right
-        assert_equal $k $kk
-        assert_equal [lpop k] [string repeat x 65535]
-        assert_equal [lpop k] [string repeat x 8191]
-        assert_equal [lpop k] [string repeat x 31]
-        set _ $k
-    } {12 0 9223372036854775808 2147483647 32767 127}
-
-    test {List ziplist of various encodings - sanitize dump} {
-        r config set sanitize-dump-payload yes
-        r restore kk 0 $dump replace
-        set k [r lrange k 0 -1]
-        set kk [r lrange kk 0 -1]
-
-        # make sure the values are right
-        assert_equal $k $kk
-        assert_equal [lpop k] [string repeat x 65535]
-        assert_equal [lpop k] [string repeat x 8191]
-        assert_equal [lpop k] [string repeat x 31]
-        set _ $k
-    } {12 0 9223372036854775808 2147483647 32767 127}
-
-}
diff --git a/redis-stable/tests/unit/type/set.tcl b/redis-stable/tests/unit/type/set.tcl
deleted file mode 100644
index ee7b936b..00000000
--- a/redis-stable/tests/unit/type/set.tcl
+++ /dev/null
@@ -1,886 +0,0 @@
-start_server {
-    tags {"set"}
-    overrides {
-        "set-max-intset-entries" 512
-    }
-} {
-    proc create_set {key entries} {
-        r del $key
-        foreach entry $entries { r sadd $key $entry }
-    }
-
-    test {SADD, SCARD, SISMEMBER, SMISMEMBER, SMEMBERS basics - regular set} {
-        create_set myset {foo}
-        assert_encoding hashtable myset
-        assert_equal 1 [r sadd myset bar]
-        assert_equal 0 [r sadd myset bar]
-        assert_equal 2 [r scard myset]
-        assert_equal 1 [r sismember myset foo]
-        assert_equal 1 [r sismember myset bar]
-        assert_equal 0 [r sismember myset bla]
-        assert_equal {1} [r smismember myset foo]
-        assert_equal {1 1} [r smismember myset foo bar]
-        assert_equal {1 0} [r smismember myset foo bla]
-        assert_equal {0 1} [r smismember myset bla foo]
-        assert_equal {0} [r smismember myset bla]
-        assert_equal {bar foo} [lsort [r smembers myset]]
-    }
-
-    test {SADD, SCARD, SISMEMBER, SMISMEMBER, SMEMBERS basics - intset} {
-        create_set myset {17}
-        assert_encoding intset myset
-        assert_equal 1 [r sadd myset 16]
-        assert_equal 0 [r sadd myset 16]
-        assert_equal 2 [r scard myset]
-        assert_equal 1 [r sismember myset 16]
-        assert_equal 1 [r sismember myset 17]
-        assert_equal 0 [r sismember myset 18]
-        assert_equal {1} [r smismember myset 16]
-        assert_equal {1 1} [r smismember myset 16 17]
-        assert_equal {1 0} [r smismember myset 16 18]
-        assert_equal {0 1} [r smismember myset 18 16]
-        assert_equal {0} [r smismember myset 18]
-        assert_equal {16 17} [lsort [r smembers myset]]
-    }
-
-    test {SMISMEMBER against non set} {
-        r lpush mylist foo
-        assert_error WRONGTYPE* {r smismember mylist bar}
-    }
-
-    test {SMISMEMBER non existing key} {
-        assert_equal {0} [r smismember myset1 foo]
-        assert_equal {0 0} [r smismember myset1 foo bar]
-    }
-
-    test {SMISMEMBER requires one or more members} {
-        r del zmscoretest
-        r zadd zmscoretest 10 x
-        r zadd zmscoretest 20 y
-        
-        catch {r smismember zmscoretest} e
-        assert_match {*ERR*wrong*number*arg*} $e
-    }
-
-    test {SADD against non set} {
-        r lpush mylist foo
-        assert_error WRONGTYPE* {r sadd mylist bar}
-    }
-
-    test "SADD a non-integer against an intset" {
-        create_set myset {1 2 3}
-        assert_encoding intset myset
-        assert_equal 1 [r sadd myset a]
-        assert_encoding hashtable myset
-    }
-
-    test "SADD an integer larger than 64 bits" {
-        create_set myset {213244124402402314402033402}
-        assert_encoding hashtable myset
-        assert_equal 1 [r sismember myset 213244124402402314402033402]
-        assert_equal {1} [r smismember myset 213244124402402314402033402]
-    }
-
-    test "SADD overflows the maximum allowed integers in an intset" {
-        r del myset
-        for {set i 0} {$i < 512} {incr i} { r sadd myset $i }
-        assert_encoding intset myset
-        assert_equal 1 [r sadd myset 512]
-        assert_encoding hashtable myset
-    }
-
-    test {Variadic SADD} {
-        r del myset
-        assert_equal 3 [r sadd myset a b c]
-        assert_equal 2 [r sadd myset A a b c B]
-        assert_equal [lsort {A a b c B}] [lsort [r smembers myset]]
-    }
-
-    test "Set encoding after DEBUG RELOAD" {
-        r del myintset myhashset mylargeintset
-        for {set i 0} {$i <  100} {incr i} { r sadd myintset $i }
-        for {set i 0} {$i < 1280} {incr i} { r sadd mylargeintset $i }
-        for {set i 0} {$i <  256} {incr i} { r sadd myhashset [format "i%03d" $i] }
-        assert_encoding intset myintset
-        assert_encoding hashtable mylargeintset
-        assert_encoding hashtable myhashset
-
-        r debug reload
-        assert_encoding intset myintset
-        assert_encoding hashtable mylargeintset
-        assert_encoding hashtable myhashset
-    }
-
-    test {SREM basics - regular set} {
-        create_set myset {foo bar ciao}
-        assert_encoding hashtable myset
-        assert_equal 0 [r srem myset qux]
-        assert_equal 1 [r srem myset foo]
-        assert_equal {bar ciao} [lsort [r smembers myset]]
-    }
-
-    test {SREM basics - intset} {
-        create_set myset {3 4 5}
-        assert_encoding intset myset
-        assert_equal 0 [r srem myset 6]
-        assert_equal 1 [r srem myset 4]
-        assert_equal {3 5} [lsort [r smembers myset]]
-    }
-
-    test {SREM with multiple arguments} {
-        r del myset
-        r sadd myset a b c d
-        assert_equal 0 [r srem myset k k k]
-        assert_equal 2 [r srem myset b d x y]
-        lsort [r smembers myset]
-    } {a c}
-
-    test {SREM variadic version with more args needed to destroy the key} {
-        r del myset
-        r sadd myset 1 2 3
-        r srem myset 1 2 3 4 5 6 7 8
-    } {3}
-
-    foreach {type} {hashtable intset} {
-        for {set i 1} {$i <= 5} {incr i} {
-            r del [format "set%d" $i]
-        }
-        for {set i 0} {$i < 200} {incr i} {
-            r sadd set1 $i
-            r sadd set2 [expr $i+195]
-        }
-        foreach i {199 195 1000 2000} {
-            r sadd set3 $i
-        }
-        for {set i 5} {$i < 200} {incr i} {
-            r sadd set4 $i
-        }
-        r sadd set5 0
-
-        # To make sure the sets are encoded as the type we are testing -- also
-        # when the VM is enabled and the values may be swapped in and out
-        # while the tests are running -- an extra element is added to every
-        # set that determines its encoding.
-        set large 200
-        if {$type eq "hashtable"} {
-            set large foo
-        }
-
-        for {set i 1} {$i <= 5} {incr i} {
-            r sadd [format "set%d" $i] $large
-        }
-
-        test "Generated sets must be encoded as $type" {
-            for {set i 1} {$i <= 5} {incr i} {
-                assert_encoding $type [format "set%d" $i]
-            }
-        }
-
-        test "SINTER with two sets - $type" {
-            assert_equal [list 195 196 197 198 199 $large] [lsort [r sinter set1 set2]]
-        }
-
-        test "SINTERSTORE with two sets - $type" {
-            r sinterstore setres set1 set2
-            assert_encoding $type setres
-            assert_equal [list 195 196 197 198 199 $large] [lsort [r smembers setres]]
-        }
-
-        test "SINTERSTORE with two sets, after a DEBUG RELOAD - $type" {
-            r debug reload
-            r sinterstore setres set1 set2
-            assert_encoding $type setres
-            assert_equal [list 195 196 197 198 199 $large] [lsort [r smembers setres]]
-        }
-
-        test "SUNION with two sets - $type" {
-            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
-            assert_equal $expected [lsort [r sunion set1 set2]]
-        }
-
-        test "SUNIONSTORE with two sets - $type" {
-            r sunionstore setres set1 set2
-            assert_encoding $type setres
-            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
-            assert_equal $expected [lsort [r smembers setres]]
-        }
-
-        test "SINTER against three sets - $type" {
-            assert_equal [list 195 199 $large] [lsort [r sinter set1 set2 set3]]
-        }
-
-        test "SINTERSTORE with three sets - $type" {
-            r sinterstore setres set1 set2 set3
-            assert_equal [list 195 199 $large] [lsort [r smembers setres]]
-        }
-
-        test "SUNION with non existing keys - $type" {
-            set expected [lsort -uniq "[r smembers set1] [r smembers set2]"]
-            assert_equal $expected [lsort [r sunion nokey1 set1 set2 nokey2]]
-        }
-
-        test "SDIFF with two sets - $type" {
-            assert_equal {0 1 2 3 4} [lsort [r sdiff set1 set4]]
-        }
-
-        test "SDIFF with three sets - $type" {
-            assert_equal {1 2 3 4} [lsort [r sdiff set1 set4 set5]]
-        }
-
-        test "SDIFFSTORE with three sets - $type" {
-            r sdiffstore setres set1 set4 set5
-            # When we start with intsets, we should always end with intsets.
-            if {$type eq {intset}} {
-                assert_encoding intset setres
-            }
-            assert_equal {1 2 3 4} [lsort [r smembers setres]]
-        }
-    }
-
-    test "SDIFF with first set empty" {
-        r del set1 set2 set3
-        r sadd set2 1 2 3 4
-        r sadd set3 a b c d
-        r sdiff set1 set2 set3
-    } {}
-
-    test "SDIFF with same set two times" {
-        r del set1
-        r sadd set1 a b c 1 2 3 4 5 6
-        r sdiff set1 set1
-    } {}
-
-    test "SDIFF fuzzing" {
-        for {set j 0} {$j < 100} {incr j} {
-            unset -nocomplain s
-            array set s {}
-            set args {}
-            set num_sets [expr {[randomInt 10]+1}]
-            for {set i 0} {$i < $num_sets} {incr i} {
-                set num_elements [randomInt 100]
-                r del set_$i
-                lappend args set_$i
-                while {$num_elements} {
-                    set ele [randomValue]
-                    r sadd set_$i $ele
-                    if {$i == 0} {
-                        set s($ele) x
-                    } else {
-                        unset -nocomplain s($ele)
-                    }
-                    incr num_elements -1
-                }
-            }
-            set result [lsort [r sdiff {*}$args]]
-            assert_equal $result [lsort [array names s]]
-        }
-    }
-
-    test "SDIFF against non-set should throw error" {
-        # with an empty set
-        r set key1{t} x
-        assert_error "WRONGTYPE*" {r sdiff key1{t} noset{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sdiff noset{t} key1{t}}
-
-        # with a legal set
-        r del set1{t}
-        r sadd set1{t} a b c
-        assert_error "WRONGTYPE*" {r sdiff key1{t} set1{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sdiff set1{t} key1{t}}
-    }
-
-    test "SDIFF should handle non existing key as empty" {
-        r del set1{t} set2{t} set3{t}
-
-        r sadd set1{t} a b c
-        r sadd set2{t} b c d
-        assert_equal {a} [lsort [r sdiff set1{t} set2{t} set3{t}]]
-        assert_equal {} [lsort [r sdiff set3{t} set2{t} set1{t}]]
-    }
-
-    test "SDIFFSTORE against non-set should throw error" {
-        r del set1{t} set2{t} set3{t} key1{t}
-        r set key1{t} x
-
-        # with en empty dstkey
-        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} key1{t} noset{t}}
-        assert_equal 0 [r exists set3{t}]
-        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} noset{t} key1{t}}
-        assert_equal 0 [r exists set3{t}]
-
-        # with a legal dstkey
-        r sadd set1{t} a b c
-        r sadd set2{t} b c d
-        r sadd set3{t} e
-        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} key1{t} set1{t} noset{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-
-        assert_error "WRONGTYPE*" {r SDIFFSTORE set3{t} set1{t} key1{t} set2{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-    }
-
-    test "SDIFFSTORE should handle non existing key as empty" {
-        r del set1{t} set2{t} set3{t}
-
-        r set setres{t} xxx
-        assert_equal 0 [r sdiffstore setres{t} foo111{t} bar222{t}]
-        assert_equal 0 [r exists setres{t}]
-
-        # with a legal dstkey, should delete dstkey
-        r sadd set3{t} a b c
-        assert_equal 0 [r sdiffstore set3{t} set1{t} set2{t}]
-        assert_equal 0 [r exists set3{t}]
-
-        r sadd set1{t} a b c
-        assert_equal 3 [r sdiffstore set3{t} set1{t} set2{t}]
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {a b c} [lsort [r smembers set3{t}]]
-
-        # with a legal dstkey and empty set2, should delete the dstkey
-        r sadd set3{t} a b c
-        assert_equal 0 [r sdiffstore set3{t} set2{t} set1{t}]
-        assert_equal 0 [r exists set3{t}]
-    }
-
-    test "SINTER against non-set should throw error" {
-        r set key1{t} x
-        assert_error "WRONGTYPE*" {r sinter key1{t} noset{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sinter noset{t} key1{t}}
-
-        r sadd set1{t} a b c
-        assert_error "WRONGTYPE*" {r sinter key1{t} set1{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sinter set1{t} key1{t}}
-    }
-
-    test "SINTER should handle non existing key as empty" {
-        r del set1 set2 set3
-        r sadd set1 a b c
-        r sadd set2 b c d
-        r sinter set1 set2 set3
-    } {}
-
-    test "SINTER with same integer elements but different encoding" {
-        r del set1 set2
-        r sadd set1 1 2 3
-        r sadd set2 1 2 3 a
-        r srem set2 a
-        assert_encoding intset set1
-        assert_encoding hashtable set2
-        lsort [r sinter set1 set2]
-    } {1 2 3}
-
-    test "SINTERSTORE against non-set should throw error" {
-        r del set1{t} set2{t} set3{t} key1{t}
-        r set key1{t} x
-
-        # with en empty dstkey
-        assert_error "WRONGTYPE*" {r sinterstore set3{t} key1{t} noset{t}}
-        assert_equal 0 [r exists set3{t}]
-        assert_error "WRONGTYPE*" {r sinterstore set3{t} noset{t} key1{t}}
-        assert_equal 0 [r exists set3{t}]
-
-        # with a legal dstkey
-        r sadd set1{t} a b c
-        r sadd set2{t} b c d
-        r sadd set3{t} e
-        assert_error "WRONGTYPE*" {r sinterstore set3{t} key1{t} set2{t} noset{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-
-        assert_error "WRONGTYPE*" {r sinterstore set3{t} noset{t} key1{t} set2{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-    }
-
-    test "SINTERSTORE against non existing keys should delete dstkey" {
-        r del set1{t} set2{t} set3{t}
-
-        r set setres{t} xxx
-        assert_equal 0 [r sinterstore setres{t} foo111{t} bar222{t}]
-        assert_equal 0 [r exists setres{t}]
-
-        # with a legal dstkey
-        r sadd set3{t} a b c
-        assert_equal 0 [r sinterstore set3{t} set1{t} set2{t}]
-        assert_equal 0 [r exists set3{t}]
-
-        r sadd set1{t} a b c
-        assert_equal 0 [r sinterstore set3{t} set1{t} set2{t}]
-        assert_equal 0 [r exists set3{t}]
-
-        assert_equal 0 [r sinterstore set3{t} set2{t} set1{t}]
-        assert_equal 0 [r exists set3{t}]
-    }
-
-    test "SUNION against non-set should throw error" {
-        r set key1{t} x
-        assert_error "WRONGTYPE*" {r sunion key1{t} noset{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sunion noset{t} key1{t}}
-
-        r del set1{t}
-        r sadd set1{t} a b c
-        assert_error "WRONGTYPE*" {r sunion key1{t} set1{t}}
-        # different order
-        assert_error "WRONGTYPE*" {r sunion set1{t} key1{t}}
-    }
-
-    test "SUNION should handle non existing key as empty" {
-        r del set1{t} set2{t} set3{t}
-
-        r sadd set1{t} a b c
-        r sadd set2{t} b c d
-        assert_equal {a b c d} [lsort [r sunion set1{t} set2{t} set3{t}]]
-    }
-
-    test "SUNIONSTORE against non-set should throw error" {
-        r del set1{t} set2{t} set3{t} key1{t}
-        r set key1{t} x
-
-        # with en empty dstkey
-        assert_error "WRONGTYPE*" {r sunionstore set3{t} key1{t} noset{t}}
-        assert_equal 0 [r exists set3{t}]
-        assert_error "WRONGTYPE*" {r sunionstore set3{t} noset{t} key1{t}}
-        assert_equal 0 [r exists set3{t}]
-
-        # with a legal dstkey
-        r sadd set1{t} a b c
-        r sadd set2{t} b c d
-        r sadd set3{t} e
-        assert_error "WRONGTYPE*" {r sunionstore set3{t} key1{t} key2{t} noset{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-
-        assert_error "WRONGTYPE*" {r sunionstore set3{t} noset{t} key1{t} key2{t}}
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {e} [lsort [r smembers set3{t}]]
-    }
-
-    test "SUNIONSTORE should handle non existing key as empty" {
-        r del set1{t} set2{t} set3{t}
-
-        r set setres{t} xxx
-        assert_equal 0 [r sunionstore setres{t} foo111{t} bar222{t}]
-        assert_equal 0 [r exists setres{t}]
-
-        # set1 set2 both empty, should delete the dstkey
-        r sadd set3{t} a b c
-        assert_equal 0 [r sunionstore set3{t} set1{t} set2{t}]
-        assert_equal 0 [r exists set3{t}]
-
-        r sadd set1{t} a b c
-        r sadd set3{t} e f
-        assert_equal 3 [r sunionstore set3{t} set1{t} set2{t}]
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {a b c} [lsort [r smembers set3{t}]]
-
-        r sadd set3{t} d
-        assert_equal 3 [r sunionstore set3{t} set2{t} set1{t}]
-        assert_equal 1 [r exists set3{t}]
-        assert_equal {a b c} [lsort [r smembers set3{t}]]
-    }
-
-    test "SUNIONSTORE against non existing keys should delete dstkey" {
-        r set setres xxx
-        assert_equal 0 [r sunionstore setres foo111 bar222]
-        assert_equal 0 [r exists setres]
-    }
-
-    foreach {type contents} {hashtable {a b c} intset {1 2 3}} {
-        test "SPOP basics - $type" {
-            create_set myset $contents
-            assert_encoding $type myset
-            assert_equal $contents [lsort [list [r spop myset] [r spop myset] [r spop myset]]]
-            assert_equal 0 [r scard myset]
-        }
-
-        test "SPOP with <count>=1 - $type" {
-            create_set myset $contents
-            assert_encoding $type myset
-            assert_equal $contents [lsort [list [r spop myset 1] [r spop myset 1] [r spop myset 1]]]
-            assert_equal 0 [r scard myset]
-        }
-
-        test "SRANDMEMBER - $type" {
-            create_set myset $contents
-            unset -nocomplain myset
-            array set myset {}
-            for {set i 0} {$i < 100} {incr i} {
-                set myset([r srandmember myset]) 1
-            }
-            assert_equal $contents [lsort [array names myset]]
-        }
-    }
-
-    foreach {type contents} {
-        hashtable {a b c d e f g h i j k l m n o p q r s t u v w x y z} 
-        intset {1 10 11 12 13 14 15 16 17 18 19 2 20 21 22 23 24 25 26 3 4 5 6 7 8 9}
-    } {
-        test "SPOP with <count>" {
-            create_set myset $contents
-            assert_encoding $type myset
-            assert_equal $contents [lsort [concat [r spop myset 11] [r spop myset 9] [r spop myset 0] [r spop myset 4] [r spop myset 1] [r spop myset 0] [r spop myset 1] [r spop myset 0]]]
-            assert_equal 0 [r scard myset]
-        }
-    }
-
-    # As seen in intsetRandomMembers
-    test "SPOP using integers, testing Knuth's and Floyd's algorithm" {
-        create_set myset {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
-        assert_encoding intset myset
-        assert_equal 20 [r scard myset]
-        r spop myset 1
-        assert_equal 19 [r scard myset]
-        r spop myset 2
-        assert_equal 17 [r scard myset]
-        r spop myset 3
-        assert_equal 14 [r scard myset]
-        r spop myset 10
-        assert_equal 4 [r scard myset]
-        r spop myset 10
-        assert_equal 0 [r scard myset]
-        r spop myset 1
-        assert_equal 0 [r scard myset]
-    } {}
-
-    test "SPOP using integers with Knuth's algorithm" {
-        r spop nonexisting_key 100
-    } {}
-
-    test "SPOP new implementation: code path #1" {
-        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
-        create_set myset $content
-        set res [r spop myset 30]
-        assert {[lsort $content] eq [lsort $res]}
-    }
-
-    test "SPOP new implementation: code path #2" {
-        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
-        create_set myset $content
-        set res [r spop myset 2]
-        assert {[llength $res] == 2}
-        assert {[r scard myset] == 18}
-        set union [concat [r smembers myset] $res]
-        assert {[lsort $union] eq [lsort $content]}
-    }
-
-    test "SPOP new implementation: code path #3" {
-        set content {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20}
-        create_set myset $content
-        set res [r spop myset 18]
-        assert {[llength $res] == 18}
-        assert {[r scard myset] == 2}
-        set union [concat [r smembers myset] $res]
-        assert {[lsort $union] eq [lsort $content]}
-    }
-
-    test "SRANDMEMBER count of 0 is handled correctly" {
-        r srandmember myset 0
-    } {}
-
-    test "SRANDMEMBER with <count> against non existing key" {
-        r srandmember nonexisting_key 100
-    } {}
-
-    # Make sure we can distinguish between an empty array and a null response
-    r readraw 1
-
-    test "SRANDMEMBER count of 0 is handled correctly - emptyarray" {
-        r srandmember myset 0
-    } {*0}
-
-    test "SRANDMEMBER with <count> against non existing key - emptyarray" {
-        r srandmember nonexisting_key 100
-    } {*0}
-
-    r readraw 0
-
-    foreach {type contents} {
-        hashtable {
-            1 5 10 50 125 50000 33959417 4775547 65434162
-            12098459 427716 483706 2726473884 72615637475
-            MARY PATRICIA LINDA BARBARA ELIZABETH JENNIFER MARIA
-            SUSAN MARGARET DOROTHY LISA NANCY KAREN BETTY HELEN
-            SANDRA DONNA CAROL RUTH SHARON MICHELLE LAURA SARAH
-            KIMBERLY DEBORAH JESSICA SHIRLEY CYNTHIA ANGELA MELISSA
-            BRENDA AMY ANNA REBECCA VIRGINIA KATHLEEN
-        }
-        intset {
-            0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
-            20 21 22 23 24 25 26 27 28 29
-            30 31 32 33 34 35 36 37 38 39
-            40 41 42 43 44 45 46 47 48 49
-        }
-    } {
-        test "SRANDMEMBER with <count> - $type" {
-            create_set myset $contents
-            unset -nocomplain myset
-            array set myset {}
-            foreach ele [r smembers myset] {
-                set myset($ele) 1
-            }
-            assert_equal [lsort $contents] [lsort [array names myset]]
-
-            # Make sure that a count of 0 is handled correctly.
-            assert_equal [r srandmember myset 0] {}
-
-            # We'll stress different parts of the code, see the implementation
-            # of SRANDMEMBER for more information, but basically there are
-            # four different code paths.
-            #
-            # PATH 1: Use negative count.
-            #
-            # 1) Check that it returns repeated elements.
-            set res [r srandmember myset -100]
-            assert_equal [llength $res] 100
-
-            # 2) Check that all the elements actually belong to the
-            # original set.
-            foreach ele $res {
-                assert {[info exists myset($ele)]}
-            }
-
-            # 3) Check that eventually all the elements are returned.
-            unset -nocomplain auxset
-            set iterations 1000
-            while {$iterations != 0} {
-                incr iterations -1
-                set res [r srandmember myset -10]
-                foreach ele $res {
-                    set auxset($ele) 1
-                }
-                if {[lsort [array names myset]] eq
-                    [lsort [array names auxset]]} {
-                    break;
-                }
-            }
-            assert {$iterations != 0}
-
-            # PATH 2: positive count (unique behavior) with requested size
-            # equal or greater than set size.
-            foreach size {50 100} {
-                set res [r srandmember myset $size]
-                assert_equal [llength $res] 50
-                assert_equal [lsort $res] [lsort [array names myset]]
-            }
-
-            # PATH 3: Ask almost as elements as there are in the set.
-            # In this case the implementation will duplicate the original
-            # set and will remove random elements up to the requested size.
-            #
-            # PATH 4: Ask a number of elements definitely smaller than
-            # the set size.
-            #
-            # We can test both the code paths just changing the size but
-            # using the same code.
-
-            foreach size {45 5} {
-                set res [r srandmember myset $size]
-                assert_equal [llength $res] $size
-
-                # 1) Check that all the elements actually belong to the
-                # original set.
-                foreach ele $res {
-                    assert {[info exists myset($ele)]}
-                }
-
-                # 2) Check that eventually all the elements are returned.
-                unset -nocomplain auxset
-                set iterations 1000
-                while {$iterations != 0} {
-                    incr iterations -1
-                    set res [r srandmember myset $size]
-                    foreach ele $res {
-                        set auxset($ele) 1
-                    }
-                    if {[lsort [array names myset]] eq
-                        [lsort [array names auxset]]} {
-                        break;
-                    }
-                }
-                assert {$iterations != 0}
-            }
-        }
-    }
-
-    foreach {type contents} {
-        hashtable {
-            1 5 10 50 125
-            MARY PATRICIA LINDA BARBARA ELIZABETH
-        }
-        intset {
-            0 1 2 3 4 5 6 7 8 9
-        }
-    } {
-        test "SRANDMEMBER histogram distribution - $type" {
-            create_set myset $contents
-            unset -nocomplain myset
-            array set myset {}
-            foreach ele [r smembers myset] {
-                set myset($ele) 1
-            }
-
-            # Use negative count (PATH 1).
-            # df = 9, 40 means 0.00001 probability
-            set res [r srandmember myset -1000]
-            assert_lessthan [chi_square_value $res] 40
-
-            # Use positive count (both PATH 3 and PATH 4).
-            foreach size {8 2} {
-                unset -nocomplain allkey
-                set iterations [expr {1000 / $size}]
-                while {$iterations != 0} {
-                    incr iterations -1
-                    set res [r srandmember myset $size]
-                    foreach ele $res {
-                        lappend allkey $ele
-                    }
-                }
-                # df = 9, 40 means 0.00001 probability
-                assert_lessthan [chi_square_value $allkey] 40
-            }
-        }
-    }
-
-    proc setup_move {} {
-        r del myset3 myset4
-        create_set myset1 {1 a b}
-        create_set myset2 {2 3 4}
-        assert_encoding hashtable myset1
-        assert_encoding intset myset2
-    }
-
-    test "SMOVE basics - from regular set to intset" {
-        # move a non-integer element to an intset should convert encoding
-        setup_move
-        assert_equal 1 [r smove myset1 myset2 a]
-        assert_equal {1 b} [lsort [r smembers myset1]]
-        assert_equal {2 3 4 a} [lsort [r smembers myset2]]
-        assert_encoding hashtable myset2
-
-        # move an integer element should not convert the encoding
-        setup_move
-        assert_equal 1 [r smove myset1 myset2 1]
-        assert_equal {a b} [lsort [r smembers myset1]]
-        assert_equal {1 2 3 4} [lsort [r smembers myset2]]
-        assert_encoding intset myset2
-    }
-
-    test "SMOVE basics - from intset to regular set" {
-        setup_move
-        assert_equal 1 [r smove myset2 myset1 2]
-        assert_equal {1 2 a b} [lsort [r smembers myset1]]
-        assert_equal {3 4} [lsort [r smembers myset2]]
-    }
-
-    test "SMOVE non existing key" {
-        setup_move
-        assert_equal 0 [r smove myset1 myset2 foo]
-        assert_equal 0 [r smove myset1 myset1 foo]
-        assert_equal {1 a b} [lsort [r smembers myset1]]
-        assert_equal {2 3 4} [lsort [r smembers myset2]]
-    }
-
-    test "SMOVE non existing src set" {
-        setup_move
-        assert_equal 0 [r smove noset myset2 foo]
-        assert_equal {2 3 4} [lsort [r smembers myset2]]
-    }
-
-    test "SMOVE from regular set to non existing destination set" {
-        setup_move
-        assert_equal 1 [r smove myset1 myset3 a]
-        assert_equal {1 b} [lsort [r smembers myset1]]
-        assert_equal {a} [lsort [r smembers myset3]]
-        assert_encoding hashtable myset3
-    }
-
-    test "SMOVE from intset to non existing destination set" {
-        setup_move
-        assert_equal 1 [r smove myset2 myset3 2]
-        assert_equal {3 4} [lsort [r smembers myset2]]
-        assert_equal {2} [lsort [r smembers myset3]]
-        assert_encoding intset myset3
-    }
-
-    test "SMOVE wrong src key type" {
-        r set x 10
-        assert_error "WRONGTYPE*" {r smove x myset2 foo}
-    }
-
-    test "SMOVE wrong dst key type" {
-        r set x 10
-        assert_error "WRONGTYPE*" {r smove myset2 x foo}
-    }
-
-    test "SMOVE with identical source and destination" {
-        r del set
-        r sadd set a b c
-        r smove set set b
-        lsort [r smembers set]
-    } {a b c}
-
-    test "SMOVE only notify dstset when the addition is successful" {
-        r del srcset{t}
-        r del dstset{t}
-
-        r sadd srcset{t} a b
-        r sadd dstset{t} a
-
-        r watch dstset{t}
-
-        r multi
-        r sadd dstset{t} c
-
-        set r2 [redis_client]
-        $r2 smove srcset{t} dstset{t} a
-
-        # The dstset is actually unchanged, multi should success
-        r exec
-        set res [r scard dstset{t}]
-        assert_equal $res 2
-        $r2 close
-    }
-
-    tags {slow} {
-        test {intsets implementation stress testing} {
-            for {set j 0} {$j < 20} {incr j} {
-                unset -nocomplain s
-                array set s {}
-                r del s
-                set len [randomInt 1024]
-                for {set i 0} {$i < $len} {incr i} {
-                    randpath {
-                        set data [randomInt 65536]
-                    } {
-                        set data [randomInt 4294967296]
-                    } {
-                        set data [randomInt 18446744073709551616]
-                    }
-                    set s($data) {}
-                    r sadd s $data
-                }
-                assert_equal [lsort [r smembers s]] [lsort [array names s]]
-                set len [array size s]
-                for {set i 0} {$i < $len} {incr i} {
-                    set e [r spop s]
-                    if {![info exists s($e)]} {
-                        puts "Can't find '$e' on local array"
-                        puts "Local array: [lsort [r smembers s]]"
-                        puts "Remote array: [lsort [array names s]]"
-                        error "exception"
-                    }
-                    array unset s $e
-                }
-                assert_equal [r scard s] 0
-                assert_equal [array size s] 0
-            }
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/type/stream-cgroups.tcl b/redis-stable/tests/unit/type/stream-cgroups.tcl
deleted file mode 100644
index edc5af6b..00000000
--- a/redis-stable/tests/unit/type/stream-cgroups.tcl
+++ /dev/null
@@ -1,662 +0,0 @@
-start_server {
-    tags {"stream"}
-} {
-    test {XGROUP CREATE: creation and duplicate group name detection} {
-        r DEL mystream
-        r XADD mystream * foo bar
-        r XGROUP CREATE mystream mygroup $
-        catch {r XGROUP CREATE mystream mygroup $} err
-        set err
-    } {BUSYGROUP*}
-
-    test {XGROUP CREATE: automatic stream creation fails without MKSTREAM} {
-        r DEL mystream
-        catch {r XGROUP CREATE mystream mygroup $} err
-        set err
-    } {ERR*}
-
-    test {XGROUP CREATE: automatic stream creation works with MKSTREAM} {
-        r DEL mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-    } {OK}
-
-    test {XREADGROUP will return only new elements} {
-        r XADD mystream * a 1
-        r XADD mystream * b 2
-        # XREADGROUP should return only the new elements "a 1" "b 1"
-        # and not the element "foo bar" which was pre existing in the
-        # stream (see previous test)
-        set reply [
-            r XREADGROUP GROUP mygroup consumer-1 STREAMS mystream ">"
-        ]
-        assert {[llength [lindex $reply 0 1]] == 2}
-        lindex $reply 0 1 0 1
-    } {a 1}
-
-    test {XREADGROUP can read the history of the elements we own} {
-        # Add a few more elements
-        r XADD mystream * c 3
-        r XADD mystream * d 4
-        # Read a few elements using a different consumer name
-        set reply [
-            r XREADGROUP GROUP mygroup consumer-2 STREAMS mystream ">"
-        ]
-        assert {[llength [lindex $reply 0 1]] == 2}
-        assert {[lindex $reply 0 1 0 1] eq {c 3}}
-
-        set r1 [r XREADGROUP GROUP mygroup consumer-1 COUNT 10 STREAMS mystream 0]
-        set r2 [r XREADGROUP GROUP mygroup consumer-2 COUNT 10 STREAMS mystream 0]
-        assert {[lindex $r1 0 1 0 1] eq {a 1}}
-        assert {[lindex $r2 0 1 0 1] eq {c 3}}
-    }
-
-    test {XPENDING is able to return pending items} {
-        set pending [r XPENDING mystream mygroup - + 10]
-        assert {[llength $pending] == 4}
-        for {set j 0} {$j < 4} {incr j} {
-            set item [lindex $pending $j]
-            if {$j < 2} {
-                set owner consumer-1
-            } else {
-                set owner consumer-2
-            }
-            assert {[lindex $item 1] eq $owner}
-            assert {[lindex $item 1] eq $owner}
-        }
-    }
-
-    test {XPENDING can return single consumer items} {
-        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
-        assert {[llength $pending] == 2}
-    }
-
-    test {XPENDING only group} {
-        set pending [r XPENDING mystream mygroup]
-        assert {[llength $pending] == 4}
-    }
-
-    test {XPENDING with IDLE} {
-        after 20
-        set pending [r XPENDING mystream mygroup IDLE 99999999 - + 10 consumer-1]
-        assert {[llength $pending] == 0}
-        set pending [r XPENDING mystream mygroup IDLE 1 - + 10 consumer-1]
-        assert {[llength $pending] == 2}
-        set pending [r XPENDING mystream mygroup IDLE 99999999 - + 10]
-        assert {[llength $pending] == 0}
-        set pending [r XPENDING mystream mygroup IDLE 1 - + 10]
-        assert {[llength $pending] == 4}
-    }
-
-    test {XPENDING with exclusive range intervals works as expected} {
-        set pending [r XPENDING mystream mygroup - + 10]
-        assert {[llength $pending] == 4}
-        set startid [lindex [lindex $pending 0] 0]
-        set endid [lindex [lindex $pending 3] 0]
-        set expending [r XPENDING mystream mygroup ($startid ($endid 10]
-        assert {[llength $expending] == 2}
-        for {set j 0} {$j < 2} {incr j} {
-            set itemid [lindex [lindex $expending $j] 0]
-            assert {$itemid ne $startid}
-            assert {$itemid ne $endid}
-        }
-    }
-
-    test {XACK is able to remove items from the consumer/group PEL} {
-        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
-        set id1 [lindex $pending 0 0]
-        set id2 [lindex $pending 1 0]
-        assert {[r XACK mystream mygroup $id1] eq 1}
-        set pending [r XPENDING mystream mygroup - + 10 consumer-1]
-        assert {[llength $pending] == 1}
-        set id [lindex $pending 0 0]
-        assert {$id eq $id2}
-        set global_pel [r XPENDING mystream mygroup - + 10]
-        assert {[llength $global_pel] == 3}
-    }
-
-    test {XACK can't remove the same item multiple times} {
-        assert {[r XACK mystream mygroup $id1] eq 0}
-    }
-
-    test {XACK is able to accept multiple arguments} {
-        # One of the IDs was already removed, so it should ack
-        # just ID2.
-        assert {[r XACK mystream mygroup $id1 $id2] eq 1}
-    }
-
-    test {XACK should fail if got at least one invalid ID} {
-        r del mystream
-        r xgroup create s g $ MKSTREAM
-        r xadd s * f1 v1
-        set c [llength [lindex [r xreadgroup group g c streams s >] 0 1]]
-        assert {$c == 1}
-        set pending [r xpending s g - + 10 c]
-        set id1 [lindex $pending 0 0]
-        assert_error "*Invalid stream ID specified*" {r xack s g $id1 invalid-id}
-        assert {[r xack s g $id1] eq 1}
-    }
-
-    test {PEL NACK reassignment after XGROUP SETID event} {
-        r del events
-        r xadd events * f1 v1
-        r xadd events * f1 v1
-        r xadd events * f1 v1
-        r xadd events * f1 v1
-        r xgroup create events g1 $
-        r xadd events * f1 v1
-        set c [llength [lindex [r xreadgroup group g1 c1 streams events >] 0 1]]
-        assert {$c == 1}
-        r xgroup setid events g1 -
-        set c [llength [lindex [r xreadgroup group g1 c2 streams events >] 0 1]]
-        assert {$c == 5}
-    }
-
-    test {XREADGROUP will not report data on empty history. Bug #5577} {
-        r del events
-        r xadd events * a 1
-        r xadd events * b 2
-        r xadd events * c 3
-        r xgroup create events mygroup 0
-
-        # Current local PEL should be empty
-        set res [r xpending events mygroup - + 10]
-        assert {[llength $res] == 0}
-
-        # So XREADGROUP should read an empty history as well
-        set res [r xreadgroup group mygroup myconsumer count 3 streams events 0]
-        assert {[llength [lindex $res 0 1]] == 0}
-
-        # We should fetch all the elements in the stream asking for >
-        set res [r xreadgroup group mygroup myconsumer count 3 streams events >]
-        assert {[llength [lindex $res 0 1]] == 3}
-
-        # Now the history is populated with three not acked entries
-        set res [r xreadgroup group mygroup myconsumer count 3 streams events 0]
-        assert {[llength [lindex $res 0 1]] == 3}
-    }
-
-    test {XREADGROUP history reporting of deleted entries. Bug #5570} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        r XADD mystream 1 field1 A
-        r XREADGROUP GROUP mygroup myconsumer STREAMS mystream >
-        r XADD mystream MAXLEN 1 2 field1 B
-        r XREADGROUP GROUP mygroup myconsumer STREAMS mystream >
-
-        # Now we have two pending entries, however one should be deleted
-        # and one should be ok (we should only see "B")
-        set res [r XREADGROUP GROUP mygroup myconsumer STREAMS mystream 0-1]
-        assert {[lindex $res 0 1 0] == {1-0 {}}}
-        assert {[lindex $res 0 1 1] == {2-0 {field1 B}}}
-    }
-
-    test {Blocking XREADGROUP will not reply with an empty array} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        r XADD mystream 666 f v
-        set res [r XREADGROUP GROUP mygroup Alice BLOCK 10 STREAMS mystream ">"]
-        assert {[lindex $res 0 1 0] == {666-0 {f v}}}
-        r XADD mystream 667 f2 v2
-        r XDEL mystream 667
-        set rd [redis_deferring_client]
-        $rd XREADGROUP GROUP mygroup Alice BLOCK 10 STREAMS mystream ">"
-        after 20
-        assert {[$rd read] == {}} ;# before the fix, client didn't even block, but was served synchronously with {mystream {}}
-    }
-
-    test {XGROUP DESTROY should unblock XREADGROUP with -NOGROUP} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        set rd [redis_deferring_client]
-        $rd XREADGROUP GROUP mygroup Alice BLOCK 100 STREAMS mystream ">"
-        r XGROUP DESTROY mystream mygroup
-        assert_error "*NOGROUP*" {$rd read}
-    }
-
-    test {RENAME can unblock XREADGROUP with data} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        set rd [redis_deferring_client]
-        $rd XREADGROUP GROUP mygroup Alice BLOCK 0 STREAMS mystream ">"
-        r XGROUP CREATE mystream2 mygroup $ MKSTREAM
-        r XADD mystream2 100 f1 v1
-        r RENAME mystream2 mystream
-        assert_equal "{mystream {{100-0 {f1 v1}}}}" [$rd read] ;# mystream2 had mygroup before RENAME
-    }
-
-    test {RENAME can unblock XREADGROUP with -NOGROUP} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        set rd [redis_deferring_client]
-        $rd XREADGROUP GROUP mygroup Alice BLOCK 0 STREAMS mystream ">"
-        r XADD mystream2 100 f1 v1
-        r RENAME mystream2 mystream
-        assert_error "*NOGROUP*" {$rd read} ;# mystream2 didn't have mygroup before RENAME
-    }
-
-    test {XCLAIM can claim PEL items from another consumer} {
-        # Add 3 items into the stream, and create a consumer group
-        r del mystream
-        set id1 [r XADD mystream * a 1]
-        set id2 [r XADD mystream * b 2]
-        set id3 [r XADD mystream * c 3]
-        r XGROUP CREATE mystream mygroup 0
-
-        # Consumer 1 reads item 1 from the stream without acknowledgements.
-        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
-        set reply [
-            r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >
-        ]
-        assert {[llength [lindex $reply 0 1 0 1]] == 2}
-        assert {[lindex $reply 0 1 0 1] eq {a 1}}
-
-        # make sure the entry is present in both the gorup, and the right consumer
-        assert {[llength [r XPENDING mystream mygroup - + 10]] == 1}
-        assert {[llength [r XPENDING mystream mygroup - + 10 consumer1]] == 1}
-        assert {[llength [r XPENDING mystream mygroup - + 10 consumer2]] == 0}
-
-        after 200
-        set reply [
-            r XCLAIM mystream mygroup consumer2 10 $id1
-        ]
-        assert {[llength [lindex $reply 0 1]] == 2}
-        assert {[lindex $reply 0 1] eq {a 1}}
-
-        # make sure the entry is present in both the gorup, and the right consumer
-        assert {[llength [r XPENDING mystream mygroup - + 10]] == 1}
-        assert {[llength [r XPENDING mystream mygroup - + 10 consumer1]] == 0}
-        assert {[llength [r XPENDING mystream mygroup - + 10 consumer2]] == 1}
-
-        # Consumer 1 reads another 2 items from stream
-        r XREADGROUP GROUP mygroup consumer1 count 2 STREAMS mystream >
-        after 200
-
-        # Delete item 2 from the stream. Now consumer 1 has PEL that contains
-        # only item 3. Try to use consumer 2 to claim the deleted item 2
-        # from the PEL of consumer 1, this should return nil
-        r XDEL mystream $id2
-        set reply [
-            r XCLAIM mystream mygroup consumer2 10 $id2
-        ]
-        assert {[llength $reply] == 1}
-        assert_equal "" [lindex $reply 0]
-
-        # Delete item 3 from the stream. Now consumer 1 has PEL that is empty.
-        # Try to use consumer 2 to claim the deleted item 3 from the PEL
-        # of consumer 1, this should return nil
-        after 200
-        r XDEL mystream $id3
-        set reply [
-            r XCLAIM mystream mygroup consumer2 10 $id3
-        ]
-        assert {[llength $reply] == 1}
-        assert_equal "" [lindex $reply 0]
-    }
-
-    test {XCLAIM without JUSTID increments delivery count} {
-        # Add 3 items into the stream, and create a consumer group
-        r del mystream
-        set id1 [r XADD mystream * a 1]
-        set id2 [r XADD mystream * b 2]
-        set id3 [r XADD mystream * c 3]
-        r XGROUP CREATE mystream mygroup 0
-
-        # Consumer 1 reads item 1 from the stream without acknowledgements.
-        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
-        set reply [
-            r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >
-        ]
-        assert {[llength [lindex $reply 0 1 0 1]] == 2}
-        assert {[lindex $reply 0 1 0 1] eq {a 1}}
-        after 200
-        set reply [
-            r XCLAIM mystream mygroup consumer2 10 $id1
-        ]
-        assert {[llength [lindex $reply 0 1]] == 2}
-        assert {[lindex $reply 0 1] eq {a 1}}
-
-        set reply [
-            r XPENDING mystream mygroup - + 10
-        ]
-        assert {[llength [lindex $reply 0]] == 4}
-        assert {[lindex $reply 0 3] == 2}
-
-        # Consumer 3 then claims pending item 1 from the PEL of consumer 2 using JUSTID
-        after 200
-        set reply [
-            r XCLAIM mystream mygroup consumer3 10 $id1 JUSTID
-        ]
-        assert {[llength $reply] == 1}
-        assert {[lindex $reply 0] eq $id1}
-
-        set reply [
-            r XPENDING mystream mygroup - + 10
-        ]
-        assert {[llength [lindex $reply 0]] == 4}
-        assert {[lindex $reply 0 3] == 2}
-    }
-
-    test {XCLAIM same consumer} {
-        # Add 3 items into the stream, and create a consumer group
-        r del mystream
-        set id1 [r XADD mystream * a 1]
-        set id2 [r XADD mystream * b 2]
-        set id3 [r XADD mystream * c 3]
-        r XGROUP CREATE mystream mygroup 0
-
-        set reply [r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >]
-        assert {[llength [lindex $reply 0 1 0 1]] == 2}
-        assert {[lindex $reply 0 1 0 1] eq {a 1}}
-        after 200
-        # re-claim with the same consumer that already has it
-        assert {[llength [r XCLAIM mystream mygroup consumer1 10 $id1]] == 1}
-
-        # make sure the entry is still in the PEL
-        set reply [r XPENDING mystream mygroup - + 10]
-        assert {[llength $reply] == 1}
-        assert {[lindex $reply 0 1] eq {consumer1}}
-    }
-
-    test {XAUTOCLAIM can claim PEL items from another consumer} {
-        # Add 3 items into the stream, and create a consumer group
-        r del mystream
-        set id1 [r XADD mystream * a 1]
-        set id2 [r XADD mystream * b 2]
-        set id3 [r XADD mystream * c 3]
-        r XGROUP CREATE mystream mygroup 0
-
-        # Consumer 1 reads item 1 from the stream without acknowledgements.
-        # Consumer 2 then claims pending item 1 from the PEL of consumer 1
-        set reply [r XREADGROUP GROUP mygroup consumer1 count 1 STREAMS mystream >]
-        assert_equal [llength [lindex $reply 0 1 0 1]] 2
-        assert_equal [lindex $reply 0 1 0 1] {a 1}
-        after 200
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 1]
-        assert_equal [llength $reply] 2
-        assert_equal [lindex $reply 0] "0-0"
-        assert_equal [llength [lindex $reply 1]] 1
-        assert_equal [llength [lindex $reply 1 0]] 2
-        assert_equal [llength [lindex $reply 1 0 1]] 2
-        assert_equal [lindex $reply 1 0 1] {a 1}
-
-        # Consumer 1 reads another 2 items from stream
-        r XREADGROUP GROUP mygroup consumer1 count 2 STREAMS mystream >
-
-        # For min-idle-time
-        after 200
-
-        # Delete item 2 from the stream. Now consumer 1 has PEL that contains
-        # only item 3. Try to use consumer 2 to claim the deleted item 2
-        # from the PEL of consumer 1, this should return nil
-        r XDEL mystream $id2
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 2]
-        # id1 is self-claimed here but not id2 ('count' was set to 2)
-        assert_equal [llength $reply] 2
-        assert_equal [lindex $reply 0] $id3
-        assert_equal [llength [lindex $reply 1]] 2
-        assert_equal [llength [lindex $reply 1 0]] 2
-        assert_equal [llength [lindex $reply 1 0 1]] 2
-        assert_equal [lindex $reply 1 0 1] {a 1}
-        assert_equal [lindex $reply 1 1] ""
-
-        # Delete item 3 from the stream. Now consumer 1 has PEL that is empty.
-        # Try to use consumer 2 to claim the deleted item 3 from the PEL
-        # of consumer 1, this should return nil
-        after 200
-        r XDEL mystream $id3
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - JUSTID]
-        # id1 is self-claimed here but not id2 and id3 ('count' is default 100)
-
-        # we also test the JUSTID modifier here. note that, when using JUSTID,
-        # deleted entries are returned in reply (consistent with XCLAIM).
-
-        assert_equal [llength $reply] 2
-        assert_equal [lindex $reply 0] "0-0"
-        assert_equal [llength [lindex $reply 1]] 3
-        assert_equal [lindex $reply 1 0] $id1
-        assert_equal [lindex $reply 1 1] $id2
-        assert_equal [lindex $reply 1 2] $id3
-    }
-
-    test {XAUTOCLAIM as an iterator} {
-        # Add 5 items into the stream, and create a consumer group
-        r del mystream
-        set id1 [r XADD mystream * a 1]
-        set id2 [r XADD mystream * b 2]
-        set id3 [r XADD mystream * c 3]
-        set id4 [r XADD mystream * d 4]
-        set id5 [r XADD mystream * e 5]
-        r XGROUP CREATE mystream mygroup 0
-
-        # Read 5 messages into consumer1
-        r XREADGROUP GROUP mygroup consumer1 count 90 STREAMS mystream >
-
-        # For min-idle-time
-        after 200
-
-        # Claim 2 entries
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 - COUNT 2]
-        assert_equal [llength $reply] 2
-        set cursor [lindex $reply 0]
-        assert_equal $cursor $id3
-        assert_equal [llength [lindex $reply 1]] 2
-        assert_equal [llength [lindex $reply 1 0 1]] 2
-        assert_equal [lindex $reply 1 0 1] {a 1}
-
-        # Claim 2 more entries
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 $cursor COUNT 2]
-        assert_equal [llength $reply] 2
-        set cursor [lindex $reply 0]
-        assert_equal $cursor $id5
-        assert_equal [llength [lindex $reply 1]] 2
-        assert_equal [llength [lindex $reply 1 0 1]] 2
-        assert_equal [lindex $reply 1 0 1] {c 3}
-
-        # Claim last entry
-        set reply [r XAUTOCLAIM mystream mygroup consumer2 10 $cursor COUNT 1]
-        assert_equal [llength $reply] 2
-        set cursor [lindex $reply 0]
-        assert_equal $cursor {0-0}
-        assert_equal [llength [lindex $reply 1]] 1
-        assert_equal [llength [lindex $reply 1 0 1]] 2
-        assert_equal [lindex $reply 1 0 1] {e 5}
-    }
-
-    test {XAUTOCLAIM COUNT must be > 0} {
-       assert_error "ERR COUNT must be > 0" {r XAUTOCLAIM key group consumer 1 1 COUNT 0}
-    }
-
-    test {XINFO FULL output} {
-        r del x
-        r XADD x 100 a 1
-        r XADD x 101 b 1
-        r XADD x 102 c 1
-        r XADD x 103 e 1
-        r XADD x 104 f 1
-        r XGROUP CREATE x g1 0
-        r XGROUP CREATE x g2 0
-        r XREADGROUP GROUP g1 Alice COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g1 Bob COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g1 Bob NOACK COUNT 1 STREAMS x >
-        r XREADGROUP GROUP g2 Charlie COUNT 4 STREAMS x >
-        r XDEL x 103
-
-        set reply [r XINFO STREAM x FULL]
-        assert_equal [llength $reply] 12
-        assert_equal [lindex $reply 1] 4 ;# stream length
-        assert_equal [lindex $reply 9] "{100-0 {a 1}} {101-0 {b 1}} {102-0 {c 1}} {104-0 {f 1}}" ;# entries
-        assert_equal [lindex $reply 11 0 1] "g1" ;# first group name
-        assert_equal [lindex $reply 11 0 7 0 0] "100-0" ;# first entry in group's PEL
-        assert_equal [lindex $reply 11 0 9 0 1] "Alice" ;# first consumer
-        assert_equal [lindex $reply 11 0 9 0 7 0 0] "100-0" ;# first entry in first consumer's PEL
-        assert_equal [lindex $reply 11 1 1] "g2" ;# second group name
-        assert_equal [lindex $reply 11 1 9 0 1] "Charlie" ;# first consumer
-        assert_equal [lindex $reply 11 1 9 0 7 0 0] "100-0" ;# first entry in first consumer's PEL
-        assert_equal [lindex $reply 11 1 9 0 7 1 0] "101-0" ;# second entry in first consumer's PEL
-
-        set reply [r XINFO STREAM x FULL COUNT 1]
-        assert_equal [llength $reply] 12
-        assert_equal [lindex $reply 1] 4
-        assert_equal [lindex $reply 9] "{100-0 {a 1}}"
-    }
-
-    test {XGROUP CREATECONSUMER: create consumer if does not exist} {
-        r del mystream
-        r XGROUP CREATE mystream mygroup $ MKSTREAM
-        r XADD mystream * f v
-
-        set reply [r xinfo groups mystream]
-        set group_info [lindex $reply 0]
-        set n_consumers [lindex $group_info 3]
-        assert_equal $n_consumers 0 ;# consumers number in cg
-
-        # create consumer using XREADGROUP
-        r XREADGROUP GROUP mygroup Alice COUNT 1 STREAMS mystream >
-
-        set reply [r xinfo groups mystream]
-        set group_info [lindex $reply 0]
-        set n_consumers [lindex $group_info 3]
-        assert_equal $n_consumers 1 ;# consumers number in cg
-
-        set reply [r xinfo consumers mystream mygroup]
-        set consumer_info [lindex $reply 0]
-        assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
-
-        # create group using XGROUP CREATECONSUMER when Alice already exists
-        set created [r XGROUP CREATECONSUMER mystream mygroup Alice]
-        assert_equal $created 0
-
-        # create group using XGROUP CREATECONSUMER when Bob does not exist
-        set created [r XGROUP CREATECONSUMER mystream mygroup Bob]
-        assert_equal $created 1
-
-        set reply [r xinfo groups mystream]
-        set group_info [lindex $reply 0]
-        set n_consumers [lindex $group_info 3]
-        assert_equal $n_consumers 2 ;# consumers number in cg
-
-        set reply [r xinfo consumers mystream mygroup]
-        set consumer_info [lindex $reply 0]
-        assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
-        set consumer_info [lindex $reply 1]
-        assert_equal [lindex $consumer_info 1] "Bob" ;# consumer name
-    }
-
-    test {XGROUP CREATECONSUMER: group must exist} {
-        r del mystream
-        r XADD mystream * f v
-        assert_error "*NOGROUP*" {r XGROUP CREATECONSUMER mystream mygroup consumer}
-    }
-
-    start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no appendfsync always}} {
-        test {XREADGROUP with NOACK creates consumer} {
-            r del mystream
-            r XGROUP CREATE mystream mygroup $ MKSTREAM
-            r XADD mystream * f1 v1
-            r XREADGROUP GROUP mygroup Alice NOACK STREAMS mystream ">"
-            set rd [redis_deferring_client]
-            $rd XREADGROUP GROUP mygroup Bob BLOCK 0 NOACK STREAMS mystream ">"
-            r XADD mystream * f2 v2
-            set grpinfo [r xinfo groups mystream]
-
-            r debug loadaof
-            assert {[r xinfo groups mystream] == $grpinfo}
-            set reply [r xinfo consumers mystream mygroup]
-            set consumer_info [lindex $reply 0]
-            assert_equal [lindex $consumer_info 1] "Alice" ;# consumer name
-            set consumer_info [lindex $reply 1]
-            assert_equal [lindex $consumer_info 1] "Bob" ;# consumer name
-        }
-
-        test {Consumer without PEL is present in AOF after AOFRW} {
-            r del mystream
-            r XGROUP CREATE mystream mygroup $ MKSTREAM
-            r XADD mystream * f v
-            r XREADGROUP GROUP mygroup Alice NOACK STREAMS mystream ">"
-            set rd [redis_deferring_client]
-            $rd XREADGROUP GROUP mygroup Bob BLOCK 0 NOACK STREAMS mystream ">"
-            r XGROUP CREATECONSUMER mystream mygroup Charlie
-            set grpinfo [lindex [r xinfo groups mystream] 0]
-
-            r bgrewriteaof
-            waitForBgrewriteaof r
-            r debug loadaof
-
-            set curr_grpinfo [lindex [r xinfo groups mystream] 0]
-            assert {$curr_grpinfo == $grpinfo}
-            set n_consumers [lindex $grpinfo 3]
-
-            # Bob should be created only when there will be new data for this consumer
-            assert_equal $n_consumers 2
-            set reply [r xinfo consumers mystream mygroup]
-            set consumer_info [lindex $reply 0]
-            assert_equal [lindex $consumer_info 1] "Alice"
-            set consumer_info [lindex $reply 1]
-            assert_equal [lindex $consumer_info 1] "Charlie"
-        }
-    }
-
-    start_server {} {
-        set master [srv -1 client]
-        set master_host [srv -1 host]
-        set master_port [srv -1 port]
-        set slave [srv 0 client]
-
-        foreach noack {0 1} {
-            test "Consumer group last ID propagation to slave (NOACK=$noack)" {
-                $slave slaveof $master_host $master_port
-                wait_for_condition 50 100 {
-                    [s 0 master_link_status] eq {up}
-                } else {
-                    fail "Replication not started."
-                }
-
-                $master del stream
-                $master xadd stream * a 1
-                $master xadd stream * a 2
-                $master xadd stream * a 3
-                $master xgroup create stream mygroup 0
-
-                # Consume the first two items on the master
-                for {set j 0} {$j < 2} {incr j} {
-                    if {$noack} {
-                        set item [$master xreadgroup group mygroup \
-                                  myconsumer COUNT 1 NOACK STREAMS stream >]
-                    } else {
-                        set item [$master xreadgroup group mygroup \
-                                  myconsumer COUNT 1 STREAMS stream >]
-                    }
-                    set id [lindex $item 0 1 0 0]
-                    if {$noack == 0} {
-                        assert {[$master xack stream mygroup $id] eq "1"}
-                    }
-                }
-
-                wait_for_ofs_sync $master $slave
-
-                # Turn slave into master
-                $slave slaveof no one
-
-                set item [$slave xreadgroup group mygroup myconsumer \
-                          COUNT 1 STREAMS stream >]
-
-                # The consumed enty should be the third
-                set myentry [lindex $item 0 1 0 1]
-                assert {$myentry eq {a 3}}
-            }
-        }
-    }
-
-    start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no}} {
-        test {Empty stream with no lastid can be rewrite into AOF correctly} {
-            r XGROUP CREATE mystream group-name $ MKSTREAM
-            assert {[dict get [r xinfo stream mystream] length] == 0}
-            set grpinfo [r xinfo groups mystream]
-            r bgrewriteaof
-            waitForBgrewriteaof r
-            r debug loadaof
-            assert {[dict get [r xinfo stream mystream] length] == 0}
-            assert {[r xinfo groups mystream] == $grpinfo}
-        }
-    }
-}
diff --git a/redis-stable/tests/unit/type/stream.tcl b/redis-stable/tests/unit/type/stream.tcl
deleted file mode 100644
index f1ee56a8..00000000
--- a/redis-stable/tests/unit/type/stream.tcl
+++ /dev/null
@@ -1,710 +0,0 @@
-# return value is like strcmp() and similar.
-proc streamCompareID {a b} {
-    if {$a eq $b} {return 0}
-    lassign [split $a -] a_ms a_seq
-    lassign [split $b -] b_ms b_seq
-    if {$a_ms > $b_ms} {return 1}
-    if {$a_ms < $b_ms} {return -1}
-    # Same ms case, compare seq.
-    if {$a_seq > $b_seq} {return 1}
-    if {$a_seq < $b_seq} {return -1}
-}
-
-# return the ID immediately greater than the specified one.
-# Note that this function does not care to handle 'seq' overflow
-# since it's a 64 bit value.
-proc streamNextID {id} {
-    lassign [split $id -] ms seq
-    incr seq
-    join [list $ms $seq] -
-}
-
-# Generate a random stream entry ID with the ms part between min and max
-# and a low sequence number (0 - 999 range), in order to stress test
-# XRANGE against a Tcl implementation implementing the same concept
-# with Tcl-only code in a linear array.
-proc streamRandomID {min_id max_id} {
-    lassign [split $min_id -] min_ms min_seq
-    lassign [split $max_id -] max_ms max_seq
-    set delta [expr {$max_ms-$min_ms+1}]
-    set ms [expr {$min_ms+[randomInt $delta]}]
-    set seq [randomInt 1000]
-    return $ms-$seq
-}
-
-# Tcl-side implementation of XRANGE to perform fuzz testing in the Redis
-# XRANGE implementation.
-proc streamSimulateXRANGE {items start end} {
-    set res {}
-    foreach i $items  {
-        set this_id [lindex $i 0]
-        if {[streamCompareID $this_id $start] >= 0} {
-            if {[streamCompareID $this_id $end] <= 0} {
-                lappend res $i
-            }
-        }
-    }
-    return $res
-}
-
-set content {} ;# Will be populated with Tcl side copy of the stream content.
-
-start_server {
-    tags {"stream"}
-} {
-    test {XADD can add entries into a stream that XRANGE can fetch} {
-        r XADD mystream * item 1 value a
-        r XADD mystream * item 2 value b
-        assert_equal 2 [r XLEN mystream]
-        set items [r XRANGE mystream - +]
-        assert_equal [lindex $items 0 1] {item 1 value a}
-        assert_equal [lindex $items 1 1] {item 2 value b}
-    }
-
-    test {XADD IDs are incremental} {
-        set id1 [r XADD mystream * item 1 value a]
-        set id2 [r XADD mystream * item 2 value b]
-        set id3 [r XADD mystream * item 3 value c]
-        assert {[streamCompareID $id1 $id2] == -1}
-        assert {[streamCompareID $id2 $id3] == -1}
-    }
-
-    test {XADD IDs are incremental when ms is the same as well} {
-        r multi
-        r XADD mystream * item 1 value a
-        r XADD mystream * item 2 value b
-        r XADD mystream * item 3 value c
-        lassign [r exec] id1 id2 id3
-        assert {[streamCompareID $id1 $id2] == -1}
-        assert {[streamCompareID $id2 $id3] == -1}
-    }
-
-    test {XADD IDs correctly report an error when overflowing} {
-        r DEL mystream
-        r xadd mystream 18446744073709551615-18446744073709551615 a b
-        assert_error ERR* {r xadd mystream * c d}
-    }
-
-    test {XADD with MAXLEN option} {
-        r DEL mystream
-        for {set j 0} {$j < 1000} {incr j} {
-            if {rand() < 0.9} {
-                r XADD mystream MAXLEN 5 * xitem $j
-            } else {
-                r XADD mystream MAXLEN 5 * yitem $j
-            }
-        }
-        assert {[r xlen mystream] == 5}
-        set res [r xrange mystream - +]
-        set expected 995
-        foreach r $res {
-            assert {[lindex $r 1 1] == $expected}
-            incr expected
-        }
-    }
-
-    test {XADD with MAXLEN option and the '=' argument} {
-        r DEL mystream
-        for {set j 0} {$j < 1000} {incr j} {
-            if {rand() < 0.9} {
-                r XADD mystream MAXLEN = 5 * xitem $j
-            } else {
-                r XADD mystream MAXLEN = 5 * yitem $j
-            }
-        }
-        assert {[r XLEN mystream] == 5}
-    }
-
-    test {XADD with MAXLEN option and the '~' argument} {
-        r DEL mystream
-        for {set j 0} {$j < 1000} {incr j} {
-            if {rand() < 0.9} {
-                r XADD mystream MAXLEN ~ 555 * xitem $j
-            } else {
-                r XADD mystream MAXLEN ~ 555 * yitem $j
-            }
-        }
-        assert {[r XLEN mystream] == 600}
-    }
-
-    test {XADD with NOMKSTREAM option} {
-        r DEL mystream
-        assert_equal "" [r XADD mystream NOMKSTREAM * item 1 value a]
-        assert_equal 0 [r EXISTS mystream]
-        r XADD mystream * item 1 value a
-        r XADD mystream NOMKSTREAM * item 2 value b
-        assert_equal 2 [r XLEN mystream]
-        set items [r XRANGE mystream - +]
-        assert_equal [lindex $items 0 1] {item 1 value a}
-        assert_equal [lindex $items 1 1] {item 2 value b}
-    }
-
-    test {XADD with MINID option} {
-        r DEL mystream
-        for {set j 1} {$j < 1001} {incr j} {
-            set minid 1000
-            if {$j >= 5} {
-                set minid [expr {$j-5}]
-            }
-            if {rand() < 0.9} {
-                r XADD mystream MINID $minid $j xitem $j
-            } else {
-                r XADD mystream MINID $minid $j yitem $j
-            }
-        }
-        assert {[r xlen mystream] == 6}
-        set res [r xrange mystream - +]
-        set expected 995
-        foreach r $res {
-            assert {[lindex $r 1 1] == $expected}
-            incr expected
-        }
-    }
-
-    test {XTRIM with MINID option} {
-        r DEL mystream
-        r XADD mystream 1-0 f v
-        r XADD mystream 2-0 f v
-        r XADD mystream 3-0 f v
-        r XADD mystream 4-0 f v
-        r XADD mystream 5-0 f v
-        r XTRIM mystream MINID = 3-0
-        assert_equal [r XRANGE mystream - +] {{3-0 {f v}} {4-0 {f v}} {5-0 {f v}}}
-    }
-
-    test {XADD mass insertion and XLEN} {
-        r DEL mystream
-        r multi
-        for {set j 0} {$j < 10000} {incr j} {
-            # From time to time insert a field with a different set
-            # of fields in order to stress the stream compression code.
-            if {rand() < 0.9} {
-                r XADD mystream * item $j
-            } else {
-                r XADD mystream * item $j otherfield foo
-            }
-        }
-        r exec
-
-        set items [r XRANGE mystream - +]
-        for {set j 0} {$j < 10000} {incr j} {
-            assert {[lrange [lindex $items $j 1] 0 1] eq [list item $j]}
-        }
-        assert {[r xlen mystream] == $j}
-    }
-
-    test {XADD with ID 0-0} {
-        r DEL otherstream
-        catch {r XADD otherstream 0-0 k v} err
-        assert {[r EXISTS otherstream] == 0}
-    }
-
-    test {XADD with LIMIT delete entries no more than limit} {
-        r del yourstream
-        for {set j 0} {$j < 3} {incr j} {
-            r XADD yourstream * xitem v
-        }
-        r XADD yourstream MAXLEN ~ 0 limit 1 * xitem v
-        assert {[r XLEN yourstream] == 4}
-    }
-
-    test {XRANGE COUNT works as expected} {
-        assert {[llength [r xrange mystream - + COUNT 10]] == 10}
-    }
-
-    test {XREVRANGE COUNT works as expected} {
-        assert {[llength [r xrevrange mystream + - COUNT 10]] == 10}
-    }
-
-    test {XRANGE can be used to iterate the whole stream} {
-        set last_id "-"
-        set j 0
-        while 1 {
-            set elements [r xrange mystream $last_id + COUNT 100]
-            if {[llength $elements] == 0} break
-            foreach e $elements {
-                assert {[lrange [lindex $e 1] 0 1] eq [list item $j]}
-                incr j;
-            }
-            set last_id [streamNextID [lindex $elements end 0]]
-        }
-        assert {$j == 10000}
-    }
-
-    test {XREVRANGE returns the reverse of XRANGE} {
-        assert {[r xrange mystream - +] == [lreverse [r xrevrange mystream + -]]}
-    }
-
-    test {XRANGE exclusive ranges} {
-        set ids {0-1 0-18446744073709551615 1-0 42-0 42-42
-                 18446744073709551615-18446744073709551614
-                 18446744073709551615-18446744073709551615}
-        set total [llength $ids]
-        r multi
-        r DEL vipstream
-        foreach id $ids {
-            r XADD vipstream $id foo bar
-        }
-        r exec
-        assert {[llength [r xrange vipstream - +]] == $total}
-        assert {[llength [r xrange vipstream ([lindex $ids 0] +]] == $total-1}
-        assert {[llength [r xrange vipstream - ([lindex $ids $total-1]]] == $total-1}
-        assert {[llength [r xrange vipstream (0-1 (1-0]] == 1}
-        assert {[llength [r xrange vipstream (1-0 (42-42]] == 1}
-        catch {r xrange vipstream (- +} e
-        assert_match {ERR*} $e
-        catch {r xrange vipstream - (+} e
-        assert_match {ERR*} $e
-        catch {r xrange vipstream (18446744073709551615-18446744073709551615 +} e
-        assert_match {ERR*} $e
-        catch {r xrange vipstream - (0-0} e
-        assert_match {ERR*} $e
-    }
-
-    test {XREAD with non empty stream} {
-        set res [r XREAD COUNT 1 STREAMS mystream 0-0]
-        assert {[lrange [lindex $res 0 1 0 1] 0 1] eq {item 0}}
-    }
-
-    test {Non blocking XREAD with empty streams} {
-        set res [r XREAD STREAMS s1 s2 0-0 0-0]
-        assert {$res eq {}}
-    }
-
-    test {XREAD with non empty second stream} {
-        set res [r XREAD COUNT 1 STREAMS nostream mystream 0-0 0-0]
-        assert {[lindex $res 0 0] eq {mystream}}
-        assert {[lrange [lindex $res 0 1 0 1] 0 1] eq {item 0}}
-    }
-
-    test {Blocking XREAD waiting new data} {
-        r XADD s2 * old abcd1234
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 20000 STREAMS s1 s2 s3 $ $ $
-        r XADD s2 * new abcd1234
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s2}}
-        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
-    }
-
-    test {Blocking XREAD waiting old data} {
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 20000 STREAMS s1 s2 s3 $ 0-0 $
-        r XADD s2 * foo abcd1234
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s2}}
-        assert {[lindex $res 0 1 0 1] eq {old abcd1234}}
-    }
-
-    test {Blocking XREAD will not reply with an empty array} {
-        r del s1
-        r XADD s1 666 f v
-        r XADD s1 667 f2 v2
-        r XDEL s1 667
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 10 STREAMS s1 666
-        after 20
-        assert {[$rd read] == {}} ;# before the fix, client didn't even block, but was served synchronously with {s1 {}}
-    }
-
-    test "XREAD: XADD + DEL should not awake client" {
-        set rd [redis_deferring_client]
-        r del s1
-        $rd XREAD BLOCK 20000 STREAMS s1 $
-        r multi
-        r XADD s1 * old abcd1234
-        r DEL s1
-        r exec
-        r XADD s1 * new abcd1234
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s1}}
-        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
-    }
-
-    test "XREAD: XADD + DEL + LPUSH should not awake client" {
-        set rd [redis_deferring_client]
-        r del s1
-        $rd XREAD BLOCK 20000 STREAMS s1 $
-        r multi
-        r XADD s1 * old abcd1234
-        r DEL s1
-        r LPUSH s1 foo bar
-        r exec
-        r DEL s1
-        r XADD s1 * new abcd1234
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s1}}
-        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
-    }
-
-    test {XREAD with same stream name multiple times should work} {
-        r XADD s2 * old abcd1234
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 20000 STREAMS s2 s2 s2 $ $ $
-        r XADD s2 * new abcd1234
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s2}}
-        assert {[lindex $res 0 1 0 1] eq {new abcd1234}}
-    }
-
-    test {XREAD + multiple XADD inside transaction} {
-        r XADD s2 * old abcd1234
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 20000 STREAMS s2 s2 s2 $ $ $
-        r MULTI
-        r XADD s2 * field one
-        r XADD s2 * field two
-        r XADD s2 * field three
-        r EXEC
-        set res [$rd read]
-        assert {[lindex $res 0 0] eq {s2}}
-        assert {[lindex $res 0 1 0 1] eq {field one}}
-        assert {[lindex $res 0 1 1 1] eq {field two}}
-    }
-
-    test {XDEL basic test} {
-        r del somestream
-        r xadd somestream * foo value0
-        set id [r xadd somestream * foo value1]
-        r xadd somestream * foo value2
-        r xdel somestream $id
-        assert {[r xlen somestream] == 2}
-        set result [r xrange somestream - +]
-        assert {[lindex $result 0 1 1] eq {value0}}
-        assert {[lindex $result 1 1 1] eq {value2}}
-    }
-
-    # Here the idea is to check the consistency of the stream data structure
-    # as we remove all the elements down to zero elements.
-    test {XDEL fuzz test} {
-        r del somestream
-        set ids {}
-        set x 0; # Length of the stream
-        while 1 {
-            lappend ids [r xadd somestream * item $x]
-            incr x
-            # Add enough elements to have a few radix tree nodes inside the stream.
-            if {[dict get [r xinfo stream somestream] radix-tree-keys] > 20} break
-        }
-
-        # Now remove all the elements till we reach an empty stream
-        # and after every deletion, check that the stream is sane enough
-        # to report the right number of elements with XRANGE: this will also
-        # force accessing the whole data structure to check sanity.
-        assert {[r xlen somestream] == $x}
-
-        # We want to remove elements in random order to really test the
-        # implementation in a better way.
-        set ids [lshuffle $ids]
-        foreach id $ids {
-            assert {[r xdel somestream $id] == 1}
-            incr x -1
-            assert {[r xlen somestream] == $x}
-            # The test would be too slow calling XRANGE for every iteration.
-            # Do it every 100 removal.
-            if {$x % 100 == 0} {
-                set res [r xrange somestream - +]
-                assert {[llength $res] == $x}
-            }
-        }
-    }
-
-    test {XRANGE fuzzing} {
-        set low_id [lindex $items 0 0]
-        set high_id [lindex $items end 0]
-        for {set j 0} {$j < 100} {incr j} {
-            set start [streamRandomID $low_id $high_id]
-            set end [streamRandomID $low_id $high_id]
-            set range [r xrange mystream $start $end]
-            set tcl_range [streamSimulateXRANGE $items $start $end]
-            if {$range ne $tcl_range} {
-                puts "*** WARNING *** - XRANGE fuzzing mismatch: $start - $end"
-                puts "---"
-                puts "XRANGE: '$range'"
-                puts "---"
-                puts "TCL: '$tcl_range'"
-                puts "---"
-                fail "XRANGE fuzzing failed, check logs for details"
-            }
-        }
-    }
-
-    test {XREVRANGE regression test for issue #5006} {
-        # Add non compressed entries
-        r xadd teststream 1234567891230 key1 value1
-        r xadd teststream 1234567891240 key2 value2
-        r xadd teststream 1234567891250 key3 value3
-
-        # Add SAMEFIELD compressed entries
-        r xadd teststream2 1234567891230 key1 value1
-        r xadd teststream2 1234567891240 key1 value2
-        r xadd teststream2 1234567891250 key1 value3
-
-        assert_equal [r xrevrange teststream 1234567891245 -] {{1234567891240-0 {key2 value2}} {1234567891230-0 {key1 value1}}}
-
-        assert_equal [r xrevrange teststream2 1234567891245 -] {{1234567891240-0 {key1 value2}} {1234567891230-0 {key1 value1}}}
-    }
-
-    test {XREAD streamID edge (no-blocking)} {
-        r del x
-        r XADD x 1-1 f v
-        r XADD x 1-18446744073709551615 f v
-        r XADD x 2-1 f v
-        set res [r XREAD BLOCK 0 STREAMS x 1-18446744073709551615]
-        assert {[lindex $res 0 1 0] == {2-1 {f v}}}
-    }
-
-    test {XREAD streamID edge (blocking)} {
-        r del x
-        set rd [redis_deferring_client]
-        $rd XREAD BLOCK 0 STREAMS x 1-18446744073709551615
-        r XADD x 1-1 f v
-        r XADD x 1-18446744073709551615 f v
-        r XADD x 2-1 f v
-        set res [$rd read]
-        assert {[lindex $res 0 1 0] == {2-1 {f v}}}
-    }
-
-    test {XADD streamID edge} {
-        r del x
-        r XADD x 2577343934890-18446744073709551615 f v ;# we need the timestamp to be in the future
-        r XADD x * f2 v2
-        assert_equal [r XRANGE x - +] {{2577343934890-18446744073709551615 {f v}} {2577343934891-0 {f2 v2}}}
-    }
-
-    test {XTRIM with MAXLEN option basic test} {
-        r DEL mystream
-        for {set j 0} {$j < 1000} {incr j} {
-            if {rand() < 0.9} {
-                r XADD mystream * xitem $j
-            } else {
-                r XADD mystream * yitem $j
-            }
-        }
-        r XTRIM mystream MAXLEN 666
-        assert {[r XLEN mystream] == 666}
-        r XTRIM mystream MAXLEN = 555
-        assert {[r XLEN mystream] == 555}
-        r XTRIM mystream MAXLEN ~ 444
-        assert {[r XLEN mystream] == 500}
-        r XTRIM mystream MAXLEN ~ 400
-        assert {[r XLEN mystream] == 400}
-    }
-
-    test {XADD with LIMIT consecutive calls} {
-        r del mystream
-        r config set stream-node-max-entries 10
-        for {set j 0} {$j < 100} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
-        assert {[r xlen mystream] == 71}
-        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
-        assert {[r xlen mystream] == 62}
-        r config set stream-node-max-entries 100
-    }
-
-    test {XTRIM with ~ is limited} {
-        r del mystream
-        r config set stream-node-max-entries 1
-        for {set j 0} {$j < 102} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XTRIM mystream MAXLEN ~ 1
-        assert {[r xlen mystream] == 2}
-        r config set stream-node-max-entries 100
-    }
-
-    test {XTRIM without ~ is not limited} {
-        r del mystream
-        r config set stream-node-max-entries 1
-        for {set j 0} {$j < 102} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XTRIM mystream MAXLEN 1
-        assert {[r xlen mystream] == 1}
-        r config set stream-node-max-entries 100
-    }
-
-    test {XTRIM without ~ and with LIMIT} {
-        r del mystream
-        r config set stream-node-max-entries 1
-        for {set j 0} {$j < 102} {incr j} {
-            r XADD mystream * xitem v
-        }
-        assert_error ERR* {r XTRIM mystream MAXLEN 1 LIMIT 30}
-    }
-
-    test {XTRIM with LIMIT delete entries no more than limit} {
-        r del mystream
-        r config set stream-node-max-entries 2
-        for {set j 0} {$j < 3} {incr j} {
-            r XADD mystream * xitem v
-        }
-        assert {[r XTRIM mystream MAXLEN ~ 0 LIMIT 1] == 0}
-        assert {[r XTRIM mystream MAXLEN ~ 0 LIMIT 2] == 2}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes}} {
-    test {XADD with MAXLEN > xlen can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XADD mystream MAXLEN 200 * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-        r debug loadaof
-        r XADD mystream * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes}} {
-    test {XADD with MINID > lastid can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            set id [expr {$j+1}]
-            r XADD mystream $id xitem v
-        }
-        r XADD mystream MINID 1 * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-        r debug loadaof
-        r XADD mystream * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes}} {
-    test {XADD with ~ MAXLEN can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XADD mystream MAXLEN ~ $j * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-        r config set stream-node-max-entries 1
-        r debug loadaof
-        r XADD mystream * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
-    test {XADD with ~ MAXLEN and LIMIT can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XADD mystream MAXLEN ~ 55 LIMIT 30 * xitem v
-        assert {[r xlen mystream] == 71}
-        r config set stream-node-max-entries 1
-        r debug loadaof
-        r XADD mystream * xitem v
-        assert {[r xlen mystream] == 72}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes}} {
-    test {XADD with ~ MINID can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            set id [expr {$j+1}]
-            r XADD mystream $id xitem v
-        }
-        r XADD mystream MINID ~ $j * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-        r config set stream-node-max-entries 1
-        r debug loadaof
-        r XADD mystream * xitem v
-        incr j
-        assert {[r xlen mystream] == $j}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
-    test {XADD with ~ MINID and LIMIT can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            set id [expr {$j+1}]
-            r XADD mystream $id xitem v
-        }
-        r XADD mystream MINID ~ 55 LIMIT 30 * xitem v
-        assert {[r xlen mystream] == 71}
-        r config set stream-node-max-entries 1
-        r debug loadaof
-        r XADD mystream * xitem v
-        assert {[r xlen mystream] == 72}
-    }
-}
-
-start_server {tags {"stream"} overrides {appendonly yes stream-node-max-entries 10}} {
-    test {XTRIM with ~ MAXLEN can propagate correctly} {
-        for {set j 0} {$j < 100} {incr j} {
-            r XADD mystream * xitem v
-        }
-        r XTRIM mystream MAXLEN ~ 85
-        assert {[r xlen mystream] == 90}
-        r config set stream-node-max-entries 1
-        r debug loadaof
-        r XADD mystream * xitem v
-        incr j
-        assert {[r xlen mystream] == 91}
-    }
-}
-
-start_server {tags {"stream xsetid"}} {
-    test {XADD can CREATE an empty stream} {
-        r XADD mystream MAXLEN 0 * a b
-        assert {[dict get [r xinfo stream mystream] length] == 0}
-    }
-
-    test {XSETID can set a specific ID} {
-        r XSETID mystream "200-0"
-        assert {[dict get [r xinfo stream mystream] last-generated-id] == "200-0"}
-    }
-
-    test {XSETID cannot SETID with smaller ID} {
-        r XADD mystream * a b
-        catch {r XSETID mystream "1-1"} err
-        r XADD mystream MAXLEN 0 * a b
-        set err
-    } {ERR*smaller*}
-
-    test {XSETID cannot SETID on non-existent key} {
-        catch {r XSETID stream 1-1} err
-        set _ $err
-    } {ERR no such key}
-}
-
-start_server {tags {"stream"} overrides {appendonly yes aof-use-rdb-preamble no}} {
-    test {Empty stream can be rewrite into AOF correctly} {
-        r XADD mystream MAXLEN 0 * a b
-        assert {[dict get [r xinfo stream mystream] length] == 0}
-        r bgrewriteaof
-        waitForBgrewriteaof r
-        r debug loadaof
-        assert {[dict get [r xinfo stream mystream] length] == 0}
-    }
-
-    test {Stream can be rewrite into AOF correctly after XDEL lastid} {
-        r XSETID mystream 0-0
-        r XADD mystream 1-1 a b
-        r XADD mystream 2-2 a b
-        assert {[dict get [r xinfo stream mystream] length] == 2}
-        r XDEL mystream 2-2
-        r bgrewriteaof
-        waitForBgrewriteaof r
-        r debug loadaof
-        assert {[dict get [r xinfo stream mystream] length] == 1}
-        assert {[dict get [r xinfo stream mystream] last-generated-id] == "2-2"}
-    }
-}
-
-start_server {tags {"stream"}} {
-    test {XGROUP HELP should not have unexpected options} {
-        catch {r XGROUP help xxx} e
-        assert_match "*Unknown subcommand or wrong number of arguments*" $e
-    }
-}
diff --git a/redis-stable/tests/unit/type/string.tcl b/redis-stable/tests/unit/type/string.tcl
deleted file mode 100644
index 43968b26..00000000
--- a/redis-stable/tests/unit/type/string.tcl
+++ /dev/null
@@ -1,577 +0,0 @@
-start_server {tags {"string"}} {
-    test {SET and GET an item} {
-        r set x foobar
-        r get x
-    } {foobar}
-
-    test {SET and GET an empty item} {
-        r set x {}
-        r get x
-    } {}
-
-    test {Very big payload in GET/SET} {
-        set buf [string repeat "abcd" 1000000]
-        r set foo $buf
-        r get foo
-    } [string repeat "abcd" 1000000]
-
-    tags {"slow"} {
-        test {Very big payload random access} {
-            set err {}
-            array set payload {}
-            for {set j 0} {$j < 100} {incr j} {
-                set size [expr 1+[randomInt 100000]]
-                set buf [string repeat "pl-$j" $size]
-                set payload($j) $buf
-                r set bigpayload_$j $buf
-            }
-            for {set j 0} {$j < 1000} {incr j} {
-                set index [randomInt 100]
-                set buf [r get bigpayload_$index]
-                if {$buf != $payload($index)} {
-                    set err "Values differ: I set '$payload($index)' but I read back '$buf'"
-                    break
-                }
-            }
-            unset payload
-            set _ $err
-        } {}
-
-        test {SET 10000 numeric keys and access all them in reverse order} {
-            r flushdb
-            set err {}
-            for {set x 0} {$x < 10000} {incr x} {
-                r set $x $x
-            }
-            set sum 0
-            for {set x 9999} {$x >= 0} {incr x -1} {
-                set val [r get $x]
-                if {$val ne $x} {
-                    set err "Element at position $x is $val instead of $x"
-                    break
-                }
-            }
-            set _ $err
-        } {}
-
-        test {DBSIZE should be 10000 now} {
-            r dbsize
-        } {10000}
-    }
-
-    test "SETNX target key missing" {
-        r del novar
-        assert_equal 1 [r setnx novar foobared]
-        assert_equal "foobared" [r get novar]
-    }
-
-    test "SETNX target key exists" {
-        r set novar foobared
-        assert_equal 0 [r setnx novar blabla]
-        assert_equal "foobared" [r get novar]
-    }
-
-    test "SETNX against not-expired volatile key" {
-        r set x 10
-        r expire x 10000
-        assert_equal 0 [r setnx x 20]
-        assert_equal 10 [r get x]
-    }
-
-    test "SETNX against expired volatile key" {
-        # Make it very unlikely for the key this test uses to be expired by the
-        # active expiry cycle. This is tightly coupled to the implementation of
-        # active expiry and dbAdd() but currently the only way to test that
-        # SETNX expires a key when it should have been.
-        for {set x 0} {$x < 9999} {incr x} {
-            r setex key-$x 3600 value
-        }
-
-        # This will be one of 10000 expiring keys. A cycle is executed every
-        # 100ms, sampling 10 keys for being expired or not.  This key will be
-        # expired for at most 1s when we wait 2s, resulting in a total sample
-        # of 100 keys. The probability of the success of this test being a
-        # false positive is therefore approx. 1%.
-        r set x 10
-        r expire x 1
-
-        # Wait for the key to expire
-        after 2000
-
-        assert_equal 1 [r setnx x 20]
-        assert_equal 20 [r get x]
-    }
-
-    test "GETEX EX option" {
-        r del foo
-        r set foo bar
-        r getex foo ex 10
-        assert_range [r ttl foo] 5 10
-    }
-
-    test "GETEX PX option" {
-        r del foo
-        r set foo bar
-        r getex foo px 10000
-        assert_range [r pttl foo] 5000 10000
-    }
-
-    test "GETEX EXAT option" {
-        r del foo
-        r set foo bar
-        r getex foo exat [expr [clock seconds] + 10]
-        assert_range [r ttl foo] 5 10
-    }
-
-    test "GETEX PXAT option" {
-        r del foo
-        r set foo bar
-        r getex foo pxat [expr [clock milliseconds] + 10000]
-        assert_range [r pttl foo] 5000 10000
-    }
-
-    test "GETEX PERSIST option" {
-        r del foo
-        r set foo bar ex 10
-        assert_range [r ttl foo] 5 10
-        r getex foo persist
-        assert_equal -1 [r ttl foo]
-    }
-
-    test "GETEX no option" {
-        r del foo
-        r set foo bar
-        r getex foo
-        assert_equal bar [r getex foo]
-    }
-
-    test "GETEX syntax errors" {
-        set ex {}
-        catch {r getex foo non-existent-option} ex
-        set ex
-    } {*syntax*}
-
-    test "GETEX no arguments" {
-         set ex {}
-         catch {r getex} ex
-         set ex
-     } {*wrong number of arguments*}
-
-    test "GETDEL command" {
-        r del foo
-        r set foo bar
-        assert_equal bar [r getdel foo ]
-        assert_equal {} [r getdel foo ]
-    }
-
-    test {GETDEL propagate as DEL command to replica} {
-        set repl [attach_to_replication_stream]
-        r set foo bar
-        r getdel foo
-        assert_replication_stream $repl {
-            {select *}
-            {set foo bar}
-            {del foo}
-        }
-    }
-
-    test {GETEX without argument does not propagate to replica} {
-        set repl [attach_to_replication_stream]
-        r set foo bar
-        r getex foo
-        r del foo
-        assert_replication_stream $repl {
-            {select *}
-            {set foo bar}
-            {del foo}
-        }
-    }
-
-    test {MGET} {
-        r flushdb
-        r set foo BAR
-        r set bar FOO
-        r mget foo bar
-    } {BAR FOO}
-
-    test {MGET against non existing key} {
-        r mget foo baazz bar
-    } {BAR {} FOO}
-
-    test {MGET against non-string key} {
-        r sadd myset ciao
-        r sadd myset bau
-        r mget foo baazz bar myset
-    } {BAR {} FOO {}}
-
-    test {GETSET (set new value)} {
-        r del foo
-        list [r getset foo xyz] [r get foo]
-    } {{} xyz}
-
-    test {GETSET (replace old value)} {
-        r set foo bar
-        list [r getset foo xyz] [r get foo]
-    } {bar xyz}
-
-    test {MSET base case} {
-        r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n"
-        r mget x y z
-    } [list 10 {foo bar} "x x x x x x x\n\n\r\n"]
-
-    test {MSET wrong number of args} {
-        catch {r mset x 10 y "foo bar" z} err
-        format $err
-    } {*wrong number*}
-
-    test {MSETNX with already existent key} {
-        list [r msetnx x1 xxx y2 yyy x 20] [r exists x1] [r exists y2]
-    } {0 0 0}
-
-    test {MSETNX with not existing keys} {
-        list [r msetnx x1 xxx y2 yyy] [r get x1] [r get y2]
-    } {1 xxx yyy}
-
-    test "STRLEN against non-existing key" {
-        assert_equal 0 [r strlen notakey]
-    }
-
-    test "STRLEN against integer-encoded value" {
-        r set myinteger -555
-        assert_equal 4 [r strlen myinteger]
-    }
-
-    test "STRLEN against plain string" {
-        r set mystring "foozzz0123456789 baz"
-        assert_equal 20 [r strlen mystring]
-    }
-
-    test "SETBIT against non-existing key" {
-        r del mykey
-        assert_equal 0 [r setbit mykey 1 1]
-        assert_equal [binary format B* 01000000] [r get mykey]
-    }
-
-    test "SETBIT against string-encoded key" {
-        # Ascii "@" is integer 64 = 01 00 00 00
-        r set mykey "@"
-
-        assert_equal 0 [r setbit mykey 2 1]
-        assert_equal [binary format B* 01100000] [r get mykey]
-        assert_equal 1 [r setbit mykey 1 0]
-        assert_equal [binary format B* 00100000] [r get mykey]
-    }
-
-    test "SETBIT against integer-encoded key" {
-        # Ascii "1" is integer 49 = 00 11 00 01
-        r set mykey 1
-        assert_encoding int mykey
-
-        assert_equal 0 [r setbit mykey 6 1]
-        assert_equal [binary format B* 00110011] [r get mykey]
-        assert_equal 1 [r setbit mykey 2 0]
-        assert_equal [binary format B* 00010011] [r get mykey]
-    }
-
-    test "SETBIT against key with wrong type" {
-        r del mykey
-        r lpush mykey "foo"
-        assert_error "WRONGTYPE*" {r setbit mykey 0 1}
-    }
-
-    test "SETBIT with out of range bit offset" {
-        r del mykey
-        assert_error "*out of range*" {r setbit mykey [expr 4*1024*1024*1024] 1}
-        assert_error "*out of range*" {r setbit mykey -1 1}
-    }
-
-    test "SETBIT with non-bit argument" {
-        r del mykey
-        assert_error "*out of range*" {r setbit mykey 0 -1}
-        assert_error "*out of range*" {r setbit mykey 0  2}
-        assert_error "*out of range*" {r setbit mykey 0 10}
-        assert_error "*out of range*" {r setbit mykey 0 20}
-    }
-
-    test "SETBIT fuzzing" {
-        set str ""
-        set len [expr 256*8]
-        r del mykey
-
-        for {set i 0} {$i < 2000} {incr i} {
-            set bitnum [randomInt $len]
-            set bitval [randomInt 2]
-            set fmt [format "%%-%ds%%d%%-s" $bitnum]
-            set head [string range $str 0 $bitnum-1]
-            set tail [string range $str $bitnum+1 end]
-            set str [string map {" " 0} [format $fmt $head $bitval $tail]]
-
-            r setbit mykey $bitnum $bitval
-            assert_equal [binary format B* $str] [r get mykey]
-        }
-    }
-
-    test "GETBIT against non-existing key" {
-        r del mykey
-        assert_equal 0 [r getbit mykey 0]
-    }
-
-    test "GETBIT against string-encoded key" {
-        # Single byte with 2nd and 3rd bit set
-        r set mykey "`"
-
-        # In-range
-        assert_equal 0 [r getbit mykey 0]
-        assert_equal 1 [r getbit mykey 1]
-        assert_equal 1 [r getbit mykey 2]
-        assert_equal 0 [r getbit mykey 3]
-
-        # Out-range
-        assert_equal 0 [r getbit mykey 8]
-        assert_equal 0 [r getbit mykey 100]
-        assert_equal 0 [r getbit mykey 10000]
-    }
-
-    test "GETBIT against integer-encoded key" {
-        r set mykey 1
-        assert_encoding int mykey
-
-        # Ascii "1" is integer 49 = 00 11 00 01
-        assert_equal 0 [r getbit mykey 0]
-        assert_equal 0 [r getbit mykey 1]
-        assert_equal 1 [r getbit mykey 2]
-        assert_equal 1 [r getbit mykey 3]
-
-        # Out-range
-        assert_equal 0 [r getbit mykey 8]
-        assert_equal 0 [r getbit mykey 100]
-        assert_equal 0 [r getbit mykey 10000]
-    }
-
-    test "SETRANGE against non-existing key" {
-        r del mykey
-        assert_equal 3 [r setrange mykey 0 foo]
-        assert_equal "foo" [r get mykey]
-
-        r del mykey
-        assert_equal 0 [r setrange mykey 0 ""]
-        assert_equal 0 [r exists mykey]
-
-        r del mykey
-        assert_equal 4 [r setrange mykey 1 foo]
-        assert_equal "\000foo" [r get mykey]
-    }
-
-    test "SETRANGE against string-encoded key" {
-        r set mykey "foo"
-        assert_equal 3 [r setrange mykey 0 b]
-        assert_equal "boo" [r get mykey]
-
-        r set mykey "foo"
-        assert_equal 3 [r setrange mykey 0 ""]
-        assert_equal "foo" [r get mykey]
-
-        r set mykey "foo"
-        assert_equal 3 [r setrange mykey 1 b]
-        assert_equal "fbo" [r get mykey]
-
-        r set mykey "foo"
-        assert_equal 7 [r setrange mykey 4 bar]
-        assert_equal "foo\000bar" [r get mykey]
-    }
-
-    test "SETRANGE against integer-encoded key" {
-        r set mykey 1234
-        assert_encoding int mykey
-        assert_equal 4 [r setrange mykey 0 2]
-        assert_encoding raw mykey
-        assert_equal 2234 [r get mykey]
-
-        # Shouldn't change encoding when nothing is set
-        r set mykey 1234
-        assert_encoding int mykey
-        assert_equal 4 [r setrange mykey 0 ""]
-        assert_encoding int mykey
-        assert_equal 1234 [r get mykey]
-
-        r set mykey 1234
-        assert_encoding int mykey
-        assert_equal 4 [r setrange mykey 1 3]
-        assert_encoding raw mykey
-        assert_equal 1334 [r get mykey]
-
-        r set mykey 1234
-        assert_encoding int mykey
-        assert_equal 6 [r setrange mykey 5 2]
-        assert_encoding raw mykey
-        assert_equal "1234\0002" [r get mykey]
-    }
-
-    test "SETRANGE against key with wrong type" {
-        r del mykey
-        r lpush mykey "foo"
-        assert_error "WRONGTYPE*" {r setrange mykey 0 bar}
-    }
-
-    test "SETRANGE with out of range offset" {
-        r del mykey
-        assert_error "*maximum allowed size*" {r setrange mykey [expr 512*1024*1024-4] world}
-
-        r set mykey "hello"
-        assert_error "*out of range*" {r setrange mykey -1 world}
-        assert_error "*maximum allowed size*" {r setrange mykey [expr 512*1024*1024-4] world}
-    }
-
-    test "GETRANGE against non-existing key" {
-        r del mykey
-        assert_equal "" [r getrange mykey 0 -1]
-    }
-
-    test "GETRANGE against string value" {
-        r set mykey "Hello World"
-        assert_equal "Hell" [r getrange mykey 0 3]
-        assert_equal "Hello World" [r getrange mykey 0 -1]
-        assert_equal "orld" [r getrange mykey -4 -1]
-        assert_equal "" [r getrange mykey 5 3]
-        assert_equal " World" [r getrange mykey 5 5000]
-        assert_equal "Hello World" [r getrange mykey -5000 10000]
-    }
-
-    test "GETRANGE against integer-encoded value" {
-        r set mykey 1234
-        assert_equal "123" [r getrange mykey 0 2]
-        assert_equal "1234" [r getrange mykey 0 -1]
-        assert_equal "234" [r getrange mykey -3 -1]
-        assert_equal "" [r getrange mykey 5 3]
-        assert_equal "4" [r getrange mykey 3 5000]
-        assert_equal "1234" [r getrange mykey -5000 10000]
-    }
-
-    test "GETRANGE fuzzing" {
-        for {set i 0} {$i < 1000} {incr i} {
-            r set bin [set bin [randstring 0 1024 binary]]
-            set _start [set start [randomInt 1500]]
-            set _end [set end [randomInt 1500]]
-            if {$_start < 0} {set _start "end-[abs($_start)-1]"}
-            if {$_end < 0} {set _end "end-[abs($_end)-1]"}
-            assert_equal [string range $bin $_start $_end] [r getrange bin $start $end]
-        }
-    }
-
-    test {Extended SET can detect syntax errors} {
-        set e {}
-        catch {r set foo bar non-existing-option} e
-        set e
-    } {*syntax*}
-
-    test {Extended SET NX option} {
-        r del foo
-        set v1 [r set foo 1 nx]
-        set v2 [r set foo 2 nx]
-        list $v1 $v2 [r get foo]
-    } {OK {} 1}
-
-    test {Extended SET XX option} {
-        r del foo
-        set v1 [r set foo 1 xx]
-        r set foo bar
-        set v2 [r set foo 2 xx]
-        list $v1 $v2 [r get foo]
-    } {{} OK 2}
-
-    test {Extended SET GET option} {
-        r del foo
-        r set foo bar
-        set old_value [r set foo bar2 GET]
-        set new_value [r get foo]
-        list $old_value $new_value
-    } {bar bar2}
-
-    test {Extended SET GET option with no previous value} {
-        r del foo
-        set old_value [r set foo bar GET]
-        set new_value [r get foo]
-        list $old_value $new_value
-    } {{} bar}
-
-    test {Extended SET GET with NX option should result in syntax err} {
-      catch {r set foo bar NX GET} err1
-      catch {r set foo bar NX GET} err2
-      list $err1 $err2
-    } {*syntax err* *syntax err*}
-
-    test {Extended SET GET with incorrect type should result in wrong type error} {
-      r del foo
-      r rpush foo waffle
-      catch {r set foo bar GET} err1
-      assert_equal "waffle" [r rpop foo]
-      set err1
-    } {*WRONGTYPE*}
-
-    test {Extended SET EX option} {
-        r del foo
-        r set foo bar ex 10
-        set ttl [r ttl foo]
-        assert {$ttl <= 10 && $ttl > 5}
-    }
-
-    test {Extended SET PX option} {
-        r del foo
-        r set foo bar px 10000
-        set ttl [r ttl foo]
-        assert {$ttl <= 10 && $ttl > 5}
-    }
-
-    test "Extended SET EXAT option" {
-        r del foo
-        r set foo bar exat [expr [clock seconds] + 10]
-        assert_range [r ttl foo] 5 10
-    }
-
-    test "Extended SET PXAT option" {
-        r del foo
-        r set foo bar pxat [expr [clock milliseconds] + 10000]
-        assert_range [r ttl foo] 5 10
-    }
-    test {Extended SET using multiple options at once} {
-        r set foo val
-        assert {[r set foo bar xx px 10000] eq {OK}}
-        set ttl [r ttl foo]
-        assert {$ttl <= 10 && $ttl > 5}
-    }
-
-    test {GETRANGE with huge ranges, Github issue #1844} {
-        r set foo bar
-        r getrange foo 0 4294967297
-    } {bar}
-
-    set rna1 {CACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTTCGTCCGGGTGTG}
-    set rna2 {ATTAAAGGTTTATACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTT}
-    set rnalcs {ACCTTCCCAGGTAACAAACCAACCAACTTTCGATCTCTTGTAGATCTGTTCTCTAAACGAACTTTAAAATCTGTGTGGCTGTCACTCGGCTGCATGCTTAGTGCACTCACGCAGTATAATTAATAACTAATTACTGTCGTTGACAGGACACGAGTAACTCGTCTATCTTCTGCAGGCTGCTTACGGTTTCGTCCGTGTTGCAGCCGATCATCAGCACATCTAGGTTT}
-
-    test {STRALGO LCS string output with STRINGS option} {
-        r STRALGO LCS STRINGS $rna1 $rna2
-    } $rnalcs
-
-    test {STRALGO LCS len} {
-        r STRALGO LCS LEN STRINGS $rna1 $rna2
-    } [string length $rnalcs]
-
-    test {LCS with KEYS option} {
-        r set virus1 $rna1
-        r set virus2 $rna2
-        r STRALGO LCS KEYS virus1 virus2
-    } $rnalcs
-
-    test {LCS indexes} {
-        dict get [r STRALGO LCS IDX KEYS virus1 virus2] matches
-    } {{{238 238} {239 239}} {{236 236} {238 238}} {{229 230} {236 237}} {{224 224} {235 235}} {{1 222} {13 234}}}
-
-    test {LCS indexes with match len} {
-        dict get [r STRALGO LCS IDX KEYS virus1 virus2 WITHMATCHLEN] matches
-    } {{{238 238} {239 239} 1} {{236 236} {238 238} 1} {{229 230} {236 237} 2} {{224 224} {235 235} 1} {{1 222} {13 234} 222}}
-
-    test {LCS indexes with match len and minimum match len} {
-        dict get [r STRALGO LCS IDX KEYS virus1 virus2 WITHMATCHLEN MINMATCHLEN 5] matches
-    } {{{1 222} {13 234} 222}}
-}
diff --git a/redis-stable/tests/unit/type/zset.tcl b/redis-stable/tests/unit/type/zset.tcl
deleted file mode 100644
index 94b2ab48..00000000
--- a/redis-stable/tests/unit/type/zset.tcl
+++ /dev/null
@@ -1,1870 +0,0 @@
-start_server {tags {"zset"}} {
-    proc create_zset {key items} {
-        r del $key
-        foreach {score entry} $items {
-            r zadd $key $score $entry
-        }
-    }
-
-    proc basics {encoding} {
-        set original_max_entries [lindex [r config get zset-max-ziplist-entries] 1]
-        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
-        if {$encoding == "ziplist"} {
-            r config set zset-max-ziplist-entries 128
-            r config set zset-max-ziplist-value 64
-        } elseif {$encoding == "skiplist"} {
-            r config set zset-max-ziplist-entries 0
-            r config set zset-max-ziplist-value 0
-        } else {
-            puts "Unknown sorted set encoding"
-            exit
-        }
-
-        test "Check encoding - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x
-            assert_encoding $encoding ztmp
-        }
-
-        test "ZSET basic ZADD and score update - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x
-            r zadd ztmp 20 y
-            r zadd ztmp 30 z
-            assert_equal {x y z} [r zrange ztmp 0 -1]
-
-            r zadd ztmp 1 y
-            assert_equal {y x z} [r zrange ztmp 0 -1]
-        }
-
-        test "ZSET element can't be set to NaN with ZADD - $encoding" {
-            assert_error "*not*float*" {r zadd myzset nan abc}
-        }
-
-        test "ZSET element can't be set to NaN with ZINCRBY - $encoding" {
-            assert_error "*not*float*" {r zadd myzset nan abc}
-        }
-
-        test "ZADD with options syntax error with incomplete pair - $encoding" {
-            r del ztmp
-            catch {r zadd ztmp xx 10 x 20} err
-            set err
-        } {ERR*}
-
-        test "ZADD XX option without key - $encoding" {
-            r del ztmp
-            assert {[r zadd ztmp xx 10 x] == 0}
-            assert {[r type ztmp] eq {none}}
-        }
-
-        test "ZADD XX existing key - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x
-            assert {[r zadd ztmp xx 20 y] == 0}
-            assert {[r zcard ztmp] == 1}
-        }
-
-        test "ZADD XX returns the number of elements actually added - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x
-            set retval [r zadd ztmp 10 x 20 y 30 z]
-            assert {$retval == 2}
-        }
-
-        test "ZADD XX updates existing elements score - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            r zadd ztmp xx 5 foo 11 x 21 y 40 zap
-            assert {[r zcard ztmp] == 3}
-            assert {[r zscore ztmp x] == 11}
-            assert {[r zscore ztmp y] == 21}
-        }
-
-        test "ZADD GT updates existing elements when new scores are greater - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp gt ch 5 foo 11 x 21 y 29 z] == 3}
-            assert {[r zcard ztmp] == 4}
-            assert {[r zscore ztmp x] == 11}
-            assert {[r zscore ztmp y] == 21}
-            assert {[r zscore ztmp z] == 30}
-        }
-
-        test "ZADD LT updates existing elements when new scores are lower - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp lt ch 5 foo 11 x 21 y 29 z] == 2}
-            assert {[r zcard ztmp] == 4}
-            assert {[r zscore ztmp x] == 10}
-            assert {[r zscore ztmp y] == 20}
-            assert {[r zscore ztmp z] == 29}
-        }
-
-        test "ZADD GT XX updates existing elements when new scores are greater and skips new elements - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp gt xx ch 5 foo 11 x 21 y 29 z] == 2}
-            assert {[r zcard ztmp] == 3}
-            assert {[r zscore ztmp x] == 11}
-            assert {[r zscore ztmp y] == 21}
-            assert {[r zscore ztmp z] == 30}
-        }
-
-        test "ZADD LT XX updates existing elements when new scores are lower and skips new elements - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp lt xx ch 5 foo 11 x 21 y 29 z] == 1}
-            assert {[r zcard ztmp] == 3}
-            assert {[r zscore ztmp x] == 10}
-            assert {[r zscore ztmp y] == 20}
-            assert {[r zscore ztmp z] == 29}
-        }
-
-        test "ZADD XX and NX are not compatible - $encoding" {
-            r del ztmp
-            catch {r zadd ztmp xx nx 10 x} err
-            set err
-        } {ERR*}
-
-        test "ZADD NX with non existing key - $encoding" {
-            r del ztmp
-            r zadd ztmp nx 10 x 20 y 30 z
-            assert {[r zcard ztmp] == 3}
-        }
-
-        test "ZADD NX only add new elements without updating old ones - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp nx 11 x 21 y 100 a 200 b] == 2}
-            assert {[r zscore ztmp x] == 10}
-            assert {[r zscore ztmp y] == 20}
-            assert {[r zscore ztmp a] == 100}
-            assert {[r zscore ztmp b] == 200}
-        }
-
-        test "ZADD GT and NX are not compatible - $encoding" {
-            r del ztmp
-            catch {r zadd ztmp gt nx 10 x} err
-            set err
-        } {ERR*}
-
-        test "ZADD LT and NX are not compatible - $encoding" {
-            r del ztmp
-            catch {r zadd ztmp lt nx 10 x} err
-            set err
-        } {ERR*}
-
-        test "ZADD LT and GT are not compatible - $encoding" {
-            r del ztmp
-            catch {r zadd ztmp lt gt 10 x} err
-            set err
-        } {ERR*}
-
-        test "ZADD INCR LT/GT replies with nill if score not updated - $encoding" {
-            r del ztmp
-            r zadd ztmp 28 x
-            assert {[r zadd ztmp lt incr 1 x] eq {}}
-            assert {[r zscore ztmp x] == 28}
-            assert {[r zadd ztmp gt incr -1 x] eq {}}
-            assert {[r zscore ztmp x] == 28}
-        }
-
-        test "ZADD INCR LT/GT with inf - $encoding" {
-            r del ztmp
-            r zadd ztmp +inf x -inf y
-
-            assert {[r zadd ztmp lt incr 1 x] eq {}}
-            assert {[r zscore ztmp x] == inf}
-            assert {[r zadd ztmp gt incr -1 x] eq {}}
-            assert {[r zscore ztmp x] == inf}
-            assert {[r zadd ztmp lt incr -1 x] eq {}}
-            assert {[r zscore ztmp x] == inf}
-            assert {[r zadd ztmp gt incr 1 x] eq {}}
-            assert {[r zscore ztmp x] == inf}
-
-            assert {[r zadd ztmp lt incr 1 y] eq {}}
-            assert {[r zscore ztmp y] == -inf}
-            assert {[r zadd ztmp gt incr -1 y] eq {}}
-            assert {[r zscore ztmp y] == -inf}
-            assert {[r zadd ztmp lt incr -1 y] eq {}}
-            assert {[r zscore ztmp y] == -inf}
-            assert {[r zadd ztmp gt incr 1 y] eq {}}
-            assert {[r zscore ztmp y] == -inf}
-        }
-
-        test "ZADD INCR works like ZINCRBY - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            r zadd ztmp INCR 15 x
-            assert {[r zscore ztmp x] == 25}
-        }
-
-        test "ZADD INCR works with a single score-elemenet pair - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            catch {r zadd ztmp INCR 15 x 10 y} err
-            set err
-        } {ERR*}
-
-        test "ZADD CH option changes return value to all changed elements - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x 20 y 30 z
-            assert {[r zadd ztmp 11 x 21 y 30 z] == 0}
-            assert {[r zadd ztmp ch 12 x 22 y 30 z] == 2}
-        }
-
-        test "ZINCRBY calls leading to NaN result in error - $encoding" {
-            r zincrby myzset +inf abc
-            assert_error "*NaN*" {r zincrby myzset -inf abc}
-        }
-
-        test {ZADD - Variadic version base case - $encoding} {
-            r del myzset
-            list [r zadd myzset 10 a 20 b 30 c] [r zrange myzset 0 -1 withscores]
-        } {3 {a 10 b 20 c 30}}
-
-        test {ZADD - Return value is the number of actually added items - $encoding} {
-            list [r zadd myzset 5 x 20 b 30 c] [r zrange myzset 0 -1 withscores]
-        } {1 {x 5 a 10 b 20 c 30}}
-
-        test {ZADD - Variadic version does not add nothing on single parsing err - $encoding} {
-            r del myzset
-            catch {r zadd myzset 10 a 20 b 30.badscore c} e
-            assert_match {*ERR*not*float*} $e
-            r exists myzset
-        } {0}
-
-        test {ZADD - Variadic version will raise error on missing arg - $encoding} {
-            r del myzset
-            catch {r zadd myzset 10 a 20 b 30 c 40} e
-            assert_match {*ERR*syntax*} $e
-        }
-
-        test {ZINCRBY does not work variadic even if shares ZADD implementation - $encoding} {
-            r del myzset
-            catch {r zincrby myzset 10 a 20 b 30 c} e
-            assert_match {*ERR*wrong*number*arg*} $e
-        }
-
-        test "ZCARD basics - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 a 20 b 30 c
-            assert_equal 3 [r zcard ztmp]
-            assert_equal 0 [r zcard zdoesntexist]
-        }
-
-        test "ZREM removes key after last element is removed - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 x
-            r zadd ztmp 20 y
-
-            assert_equal 1 [r exists ztmp]
-            assert_equal 0 [r zrem ztmp z]
-            assert_equal 1 [r zrem ztmp y]
-            assert_equal 1 [r zrem ztmp x]
-            assert_equal 0 [r exists ztmp]
-        }
-
-        test "ZREM variadic version - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 a 20 b 30 c
-            assert_equal 2 [r zrem ztmp x y a b k]
-            assert_equal 0 [r zrem ztmp foo bar]
-            assert_equal 1 [r zrem ztmp c]
-            r exists ztmp
-        } {0}
-
-        test "ZREM variadic version -- remove elements after key deletion - $encoding" {
-            r del ztmp
-            r zadd ztmp 10 a 20 b 30 c
-            r zrem ztmp a b c d e f g
-        } {3}
-
-        test "ZRANGE basics - $encoding" {
-            r del ztmp
-            r zadd ztmp 1 a
-            r zadd ztmp 2 b
-            r zadd ztmp 3 c
-            r zadd ztmp 4 d
-
-            assert_equal {a b c d} [r zrange ztmp 0 -1]
-            assert_equal {a b c} [r zrange ztmp 0 -2]
-            assert_equal {b c d} [r zrange ztmp 1 -1]
-            assert_equal {b c} [r zrange ztmp 1 -2]
-            assert_equal {c d} [r zrange ztmp -2 -1]
-            assert_equal {c} [r zrange ztmp -2 -2]
-
-            # out of range start index
-            assert_equal {a b c} [r zrange ztmp -5 2]
-            assert_equal {a b} [r zrange ztmp -5 1]
-            assert_equal {} [r zrange ztmp 5 -1]
-            assert_equal {} [r zrange ztmp 5 -2]
-
-            # out of range end index
-            assert_equal {a b c d} [r zrange ztmp 0 5]
-            assert_equal {b c d} [r zrange ztmp 1 5]
-            assert_equal {} [r zrange ztmp 0 -5]
-            assert_equal {} [r zrange ztmp 1 -5]
-
-            # withscores
-            assert_equal {a 1 b 2 c 3 d 4} [r zrange ztmp 0 -1 withscores]
-        }
-
-        test "ZREVRANGE basics - $encoding" {
-            r del ztmp
-            r zadd ztmp 1 a
-            r zadd ztmp 2 b
-            r zadd ztmp 3 c
-            r zadd ztmp 4 d
-
-            assert_equal {d c b a} [r zrevrange ztmp 0 -1]
-            assert_equal {d c b} [r zrevrange ztmp 0 -2]
-            assert_equal {c b a} [r zrevrange ztmp 1 -1]
-            assert_equal {c b} [r zrevrange ztmp 1 -2]
-            assert_equal {b a} [r zrevrange ztmp -2 -1]
-            assert_equal {b} [r zrevrange ztmp -2 -2]
-
-            # out of range start index
-            assert_equal {d c b} [r zrevrange ztmp -5 2]
-            assert_equal {d c} [r zrevrange ztmp -5 1]
-            assert_equal {} [r zrevrange ztmp 5 -1]
-            assert_equal {} [r zrevrange ztmp 5 -2]
-
-            # out of range end index
-            assert_equal {d c b a} [r zrevrange ztmp 0 5]
-            assert_equal {c b a} [r zrevrange ztmp 1 5]
-            assert_equal {} [r zrevrange ztmp 0 -5]
-            assert_equal {} [r zrevrange ztmp 1 -5]
-
-            # withscores
-            assert_equal {d 4 c 3 b 2 a 1} [r zrevrange ztmp 0 -1 withscores]
-        }
-
-        test "ZRANK/ZREVRANK basics - $encoding" {
-            r del zranktmp
-            r zadd zranktmp 10 x
-            r zadd zranktmp 20 y
-            r zadd zranktmp 30 z
-            assert_equal 0 [r zrank zranktmp x]
-            assert_equal 1 [r zrank zranktmp y]
-            assert_equal 2 [r zrank zranktmp z]
-            assert_equal "" [r zrank zranktmp foo]
-            assert_equal 2 [r zrevrank zranktmp x]
-            assert_equal 1 [r zrevrank zranktmp y]
-            assert_equal 0 [r zrevrank zranktmp z]
-            assert_equal "" [r zrevrank zranktmp foo]
-        }
-
-        test "ZRANK - after deletion - $encoding" {
-            r zrem zranktmp y
-            assert_equal 0 [r zrank zranktmp x]
-            assert_equal 1 [r zrank zranktmp z]
-        }
-
-        test "ZINCRBY - can create a new sorted set - $encoding" {
-            r del zset
-            r zincrby zset 1 foo
-            assert_equal {foo} [r zrange zset 0 -1]
-            assert_equal 1 [r zscore zset foo]
-        }
-
-        test "ZINCRBY - increment and decrement - $encoding" {
-            r zincrby zset 2 foo
-            r zincrby zset 1 bar
-            assert_equal {bar foo} [r zrange zset 0 -1]
-
-            r zincrby zset 10 bar
-            r zincrby zset -5 foo
-            r zincrby zset -5 bar
-            assert_equal {foo bar} [r zrange zset 0 -1]
-
-            assert_equal -2 [r zscore zset foo]
-            assert_equal  6 [r zscore zset bar]
-        }
-
-        test "ZINCRBY return value - $encoding" {
-            r del ztmp
-            set retval [r zincrby ztmp 1.0 x]
-            assert {$retval == 1.0}
-        }
-
-        proc create_default_zset {} {
-            create_zset zset {-inf a 1 b 2 c 3 d 4 e 5 f +inf g}
-        }
-
-        test "ZRANGEBYSCORE/ZREVRANGEBYSCORE/ZCOUNT basics - $encoding" {
-            create_default_zset
-
-            # inclusive range
-            assert_equal {a b c} [r zrangebyscore zset -inf 2]
-            assert_equal {b c d} [r zrangebyscore zset 0 3]
-            assert_equal {d e f} [r zrangebyscore zset 3 6]
-            assert_equal {e f g} [r zrangebyscore zset 4 +inf]
-            assert_equal {c b a} [r zrevrangebyscore zset 2 -inf]
-            assert_equal {d c b} [r zrevrangebyscore zset 3 0]
-            assert_equal {f e d} [r zrevrangebyscore zset 6 3]
-            assert_equal {g f e} [r zrevrangebyscore zset +inf 4]
-            assert_equal 3 [r zcount zset 0 3]
-
-            # exclusive range
-            assert_equal {b}   [r zrangebyscore zset (-inf (2]
-            assert_equal {b c} [r zrangebyscore zset (0 (3]
-            assert_equal {e f} [r zrangebyscore zset (3 (6]
-            assert_equal {f}   [r zrangebyscore zset (4 (+inf]
-            assert_equal {b}   [r zrevrangebyscore zset (2 (-inf]
-            assert_equal {c b} [r zrevrangebyscore zset (3 (0]
-            assert_equal {f e} [r zrevrangebyscore zset (6 (3]
-            assert_equal {f}   [r zrevrangebyscore zset (+inf (4]
-            assert_equal 2 [r zcount zset (0 (3]
-
-            # test empty ranges
-            r zrem zset a
-            r zrem zset g
-
-            # inclusive
-            assert_equal {} [r zrangebyscore zset 4 2]
-            assert_equal {} [r zrangebyscore zset 6 +inf]
-            assert_equal {} [r zrangebyscore zset -inf -6]
-            assert_equal {} [r zrevrangebyscore zset +inf 6]
-            assert_equal {} [r zrevrangebyscore zset -6 -inf]
-
-            # exclusive
-            assert_equal {} [r zrangebyscore zset (4 (2]
-            assert_equal {} [r zrangebyscore zset 2 (2]
-            assert_equal {} [r zrangebyscore zset (2 2]
-            assert_equal {} [r zrangebyscore zset (6 (+inf]
-            assert_equal {} [r zrangebyscore zset (-inf (-6]
-            assert_equal {} [r zrevrangebyscore zset (+inf (6]
-            assert_equal {} [r zrevrangebyscore zset (-6 (-inf]
-
-            # empty inner range
-            assert_equal {} [r zrangebyscore zset 2.4 2.6]
-            assert_equal {} [r zrangebyscore zset (2.4 2.6]
-            assert_equal {} [r zrangebyscore zset 2.4 (2.6]
-            assert_equal {} [r zrangebyscore zset (2.4 (2.6]
-        }
-
-        test "ZRANGEBYSCORE with WITHSCORES - $encoding" {
-            create_default_zset
-            assert_equal {b 1 c 2 d 3} [r zrangebyscore zset 0 3 withscores]
-            assert_equal {d 3 c 2 b 1} [r zrevrangebyscore zset 3 0 withscores]
-        }
-
-        test "ZRANGEBYSCORE with LIMIT - $encoding" {
-            create_default_zset
-            assert_equal {b c}   [r zrangebyscore zset 0 10 LIMIT 0 2]
-            assert_equal {d e f} [r zrangebyscore zset 0 10 LIMIT 2 3]
-            assert_equal {d e f} [r zrangebyscore zset 0 10 LIMIT 2 10]
-            assert_equal {}      [r zrangebyscore zset 0 10 LIMIT 20 10]
-            assert_equal {f e}   [r zrevrangebyscore zset 10 0 LIMIT 0 2]
-            assert_equal {d c b} [r zrevrangebyscore zset 10 0 LIMIT 2 3]
-            assert_equal {d c b} [r zrevrangebyscore zset 10 0 LIMIT 2 10]
-            assert_equal {}      [r zrevrangebyscore zset 10 0 LIMIT 20 10]
-        }
-
-        test "ZRANGEBYSCORE with LIMIT and WITHSCORES - $encoding" {
-            create_default_zset
-            assert_equal {e 4 f 5} [r zrangebyscore zset 2 5 LIMIT 2 3 WITHSCORES]
-            assert_equal {d 3 c 2} [r zrevrangebyscore zset 5 2 LIMIT 2 3 WITHSCORES]
-            assert_equal {} [r zrangebyscore zset 2 5 LIMIT 12 13 WITHSCORES]
-        }
-
-        test "ZRANGEBYSCORE with non-value min or max - $encoding" {
-            assert_error "*not*float*" {r zrangebyscore fooz str 1}
-            assert_error "*not*float*" {r zrangebyscore fooz 1 str}
-            assert_error "*not*float*" {r zrangebyscore fooz 1 NaN}
-        }
-
-        proc create_default_lex_zset {} {
-            create_zset zset {0 alpha 0 bar 0 cool 0 down
-                              0 elephant 0 foo 0 great 0 hill
-                              0 omega}
-        }
-
-        test "ZRANGEBYLEX/ZREVRANGEBYLEX/ZLEXCOUNT basics - $encoding" {
-            create_default_lex_zset
-
-            # inclusive range
-            assert_equal {alpha bar cool} [r zrangebylex zset - \[cool]
-            assert_equal {bar cool down} [r zrangebylex zset \[bar \[down]
-            assert_equal {great hill omega} [r zrangebylex zset \[g +]
-            assert_equal {cool bar alpha} [r zrevrangebylex zset \[cool -]
-            assert_equal {down cool bar} [r zrevrangebylex zset \[down \[bar]
-            assert_equal {omega hill great foo elephant down} [r zrevrangebylex zset + \[d]
-            assert_equal 3 [r zlexcount zset \[ele \[h]
-
-            # exclusive range
-            assert_equal {alpha bar} [r zrangebylex zset - (cool]
-            assert_equal {cool} [r zrangebylex zset (bar (down]
-            assert_equal {hill omega} [r zrangebylex zset (great +]
-            assert_equal {bar alpha} [r zrevrangebylex zset (cool -]
-            assert_equal {cool} [r zrevrangebylex zset (down (bar]
-            assert_equal {omega hill} [r zrevrangebylex zset + (great]
-            assert_equal 2 [r zlexcount zset (ele (great]
-
-            # inclusive and exclusive
-            assert_equal {} [r zrangebylex zset (az (b]
-            assert_equal {} [r zrangebylex zset (z +]
-            assert_equal {} [r zrangebylex zset - \[aaaa]
-            assert_equal {} [r zrevrangebylex zset \[elez \[elex]
-            assert_equal {} [r zrevrangebylex zset (hill (omega]
-        }
-        
-        test "ZLEXCOUNT advanced - $encoding" {
-            create_default_lex_zset
-    
-            assert_equal 9 [r zlexcount zset - +]
-            assert_equal 0 [r zlexcount zset + -]
-            assert_equal 0 [r zlexcount zset + \[c]
-            assert_equal 0 [r zlexcount zset \[c -]
-            assert_equal 8 [r zlexcount zset \[bar +]
-            assert_equal 5 [r zlexcount zset \[bar \[foo]
-            assert_equal 4 [r zlexcount zset \[bar (foo]
-            assert_equal 4 [r zlexcount zset (bar \[foo]
-            assert_equal 3 [r zlexcount zset (bar (foo]
-            assert_equal 5 [r zlexcount zset - (foo]
-            assert_equal 1 [r zlexcount zset (maxstring +]
-        }
-
-        test "ZRANGEBYSLEX with LIMIT - $encoding" {
-            create_default_lex_zset
-            assert_equal {alpha bar} [r zrangebylex zset - \[cool LIMIT 0 2]
-            assert_equal {bar cool} [r zrangebylex zset - \[cool LIMIT 1 2]
-            assert_equal {} [r zrangebylex zset \[bar \[down LIMIT 0 0]
-            assert_equal {} [r zrangebylex zset \[bar \[down LIMIT 2 0]
-            assert_equal {bar} [r zrangebylex zset \[bar \[down LIMIT 0 1]
-            assert_equal {cool} [r zrangebylex zset \[bar \[down LIMIT 1 1]
-            assert_equal {bar cool down} [r zrangebylex zset \[bar \[down LIMIT 0 100]
-            assert_equal {omega hill great foo elephant} [r zrevrangebylex zset + \[d LIMIT 0 5]
-            assert_equal {omega hill great foo} [r zrevrangebylex zset + \[d LIMIT 0 4]
-        }
-
-        test "ZRANGEBYLEX with invalid lex range specifiers - $encoding" {
-            assert_error "*not*string*" {r zrangebylex fooz foo bar}
-            assert_error "*not*string*" {r zrangebylex fooz \[foo bar}
-            assert_error "*not*string*" {r zrangebylex fooz foo \[bar}
-            assert_error "*not*string*" {r zrangebylex fooz +x \[bar}
-            assert_error "*not*string*" {r zrangebylex fooz -x \[bar}
-        }
-
-        test "ZREMRANGEBYSCORE basics - $encoding" {
-            proc remrangebyscore {min max} {
-                create_zset zset {1 a 2 b 3 c 4 d 5 e}
-                assert_equal 1 [r exists zset]
-                r zremrangebyscore zset $min $max
-            }
-
-            # inner range
-            assert_equal 3 [remrangebyscore 2 4]
-            assert_equal {a e} [r zrange zset 0 -1]
-
-            # start underflow
-            assert_equal 1 [remrangebyscore -10 1]
-            assert_equal {b c d e} [r zrange zset 0 -1]
-
-            # end overflow
-            assert_equal 1 [remrangebyscore 5 10]
-            assert_equal {a b c d} [r zrange zset 0 -1]
-
-            # switch min and max
-            assert_equal 0 [remrangebyscore 4 2]
-            assert_equal {a b c d e} [r zrange zset 0 -1]
-
-            # -inf to mid
-            assert_equal 3 [remrangebyscore -inf 3]
-            assert_equal {d e} [r zrange zset 0 -1]
-
-            # mid to +inf
-            assert_equal 3 [remrangebyscore 3 +inf]
-            assert_equal {a b} [r zrange zset 0 -1]
-
-            # -inf to +inf
-            assert_equal 5 [remrangebyscore -inf +inf]
-            assert_equal {} [r zrange zset 0 -1]
-
-            # exclusive min
-            assert_equal 4 [remrangebyscore (1 5]
-            assert_equal {a} [r zrange zset 0 -1]
-            assert_equal 3 [remrangebyscore (2 5]
-            assert_equal {a b} [r zrange zset 0 -1]
-
-            # exclusive max
-            assert_equal 4 [remrangebyscore 1 (5]
-            assert_equal {e} [r zrange zset 0 -1]
-            assert_equal 3 [remrangebyscore 1 (4]
-            assert_equal {d e} [r zrange zset 0 -1]
-
-            # exclusive min and max
-            assert_equal 3 [remrangebyscore (1 (5]
-            assert_equal {a e} [r zrange zset 0 -1]
-
-            # destroy when empty
-            assert_equal 5 [remrangebyscore 1 5]
-            assert_equal 0 [r exists zset]
-        }
-
-        test "ZREMRANGEBYSCORE with non-value min or max - $encoding" {
-            assert_error "*not*float*" {r zremrangebyscore fooz str 1}
-            assert_error "*not*float*" {r zremrangebyscore fooz 1 str}
-            assert_error "*not*float*" {r zremrangebyscore fooz 1 NaN}
-        }
-
-        test "ZREMRANGEBYRANK basics - $encoding" {
-            proc remrangebyrank {min max} {
-                create_zset zset {1 a 2 b 3 c 4 d 5 e}
-                assert_equal 1 [r exists zset]
-                r zremrangebyrank zset $min $max
-            }
-
-            # inner range
-            assert_equal 3 [remrangebyrank 1 3]
-            assert_equal {a e} [r zrange zset 0 -1]
-
-            # start underflow
-            assert_equal 1 [remrangebyrank -10 0]
-            assert_equal {b c d e} [r zrange zset 0 -1]
-
-            # start overflow
-            assert_equal 0 [remrangebyrank 10 -1]
-            assert_equal {a b c d e} [r zrange zset 0 -1]
-
-            # end underflow
-            assert_equal 0 [remrangebyrank 0 -10]
-            assert_equal {a b c d e} [r zrange zset 0 -1]
-
-            # end overflow
-            assert_equal 5 [remrangebyrank 0 10]
-            assert_equal {} [r zrange zset 0 -1]
-
-            # destroy when empty
-            assert_equal 5 [remrangebyrank 0 4]
-            assert_equal 0 [r exists zset]
-        }
-
-        test "ZUNIONSTORE against non-existing key doesn't set destination - $encoding" {
-            r del zseta
-            assert_equal 0 [r zunionstore dst_key 1 zseta]
-            assert_equal 0 [r exists dst_key]
-        }
-
-        test "ZUNION/ZINTER/ZDIFF against non-existing key - $encoding" {
-            r del zseta
-            assert_equal {} [r zunion 1 zseta]
-            assert_equal {} [r zinter 1 zseta]
-            assert_equal {} [r zdiff 1 zseta]
-        }
-
-        test "ZUNIONSTORE with empty set - $encoding" {
-            r del zseta zsetb
-            r zadd zseta 1 a
-            r zadd zseta 2 b
-            r zunionstore zsetc 2 zseta zsetb
-            r zrange zsetc 0 -1 withscores
-        } {a 1 b 2}
-
-        test "ZUNION/ZINTER/ZDIFF with empty set - $encoding" {
-            r del zseta zsetb
-            r zadd zseta 1 a
-            r zadd zseta 2 b
-            assert_equal {a 1 b 2} [r zunion 2 zseta zsetb withscores]
-            assert_equal {} [r zinter 2 zseta zsetb withscores]
-            assert_equal {a 1 b 2} [r zdiff 2 zseta zsetb withscores]
-        }
-
-        test "ZUNIONSTORE basics - $encoding" {
-            r del zseta zsetb zsetc
-            r zadd zseta 1 a
-            r zadd zseta 2 b
-            r zadd zseta 3 c
-            r zadd zsetb 1 b
-            r zadd zsetb 2 c
-            r zadd zsetb 3 d
-
-            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb]
-            assert_equal {a 1 b 3 d 3 c 5} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZUNION/ZINTER/ZDIFF with integer members - $encoding" {
-            r del zsetd zsetf
-            r zadd zsetd 1 1
-            r zadd zsetd 2 2
-            r zadd zsetd 3 3
-            r zadd zsetf 1 1
-            r zadd zsetf 3 3
-            r zadd zsetf 4 4
-
-            assert_equal {1 2 2 2 4 4 3 6} [r zunion 2 zsetd zsetf withscores]
-            assert_equal {1 2 3 6} [r zinter 2 zsetd zsetf withscores]
-            assert_equal {2 2} [r zdiff 2 zsetd zsetf withscores]
-        }
-
-        test "ZUNIONSTORE with weights - $encoding" {
-            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb weights 2 3]
-            assert_equal {a 2 b 7 d 9 c 12} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZUNION with weights - $encoding" {
-            assert_equal {a 2 b 7 d 9 c 12} [r zunion 2 zseta zsetb weights 2 3 withscores]
-            assert_equal {b 7 c 12} [r zinter 2 zseta zsetb weights 2 3 withscores]
-        }
-
-        test "ZUNIONSTORE with a regular set and weights - $encoding" {
-            r del seta
-            r sadd seta a
-            r sadd seta b
-            r sadd seta c
-
-            assert_equal 4 [r zunionstore zsetc 2 seta zsetb weights 2 3]
-            assert_equal {a 2 b 5 c 8 d 9} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZUNIONSTORE with AGGREGATE MIN - $encoding" {
-            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb aggregate min]
-            assert_equal {a 1 b 1 c 2 d 3} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZUNION/ZINTER with AGGREGATE MIN - $encoding" {
-            assert_equal {a 1 b 1 c 2 d 3} [r zunion 2 zseta zsetb aggregate min withscores]
-            assert_equal {b 1 c 2} [r zinter 2 zseta zsetb aggregate min withscores]
-        }
-
-        test "ZUNIONSTORE with AGGREGATE MAX - $encoding" {
-            assert_equal 4 [r zunionstore zsetc 2 zseta zsetb aggregate max]
-            assert_equal {a 1 b 2 c 3 d 3} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZUNION/ZINTER with AGGREGATE MAX - $encoding" {
-            assert_equal {a 1 b 2 c 3 d 3} [r zunion 2 zseta zsetb aggregate max withscores]
-            assert_equal {b 2 c 3} [r zinter 2 zseta zsetb aggregate max withscores]
-        }
-
-        test "ZINTERSTORE basics - $encoding" {
-            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb]
-            assert_equal {b 3 c 5} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZINTER basics - $encoding" {
-            assert_equal {b 3 c 5} [r zinter 2 zseta zsetb withscores]
-        }
-
-        test "ZINTER RESP3 - $encoding" {
-            r hello 3
-            assert_equal {{b 3.0} {c 5.0}} [r zinter 2 zseta zsetb withscores]
-        }
-        r hello 2
-
-        test "ZINTERSTORE with weights - $encoding" {
-            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb weights 2 3]
-            assert_equal {b 7 c 12} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZINTER with weights - $encoding" {
-            assert_equal {b 7 c 12} [r zinter 2 zseta zsetb weights 2 3 withscores]
-        }
-
-        test "ZINTERSTORE with a regular set and weights - $encoding" {
-            r del seta
-            r sadd seta a
-            r sadd seta b
-            r sadd seta c
-            assert_equal 2 [r zinterstore zsetc 2 seta zsetb weights 2 3]
-            assert_equal {b 5 c 8} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZINTERSTORE with AGGREGATE MIN - $encoding" {
-            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb aggregate min]
-            assert_equal {b 1 c 2} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZINTERSTORE with AGGREGATE MAX - $encoding" {
-            assert_equal 2 [r zinterstore zsetc 2 zseta zsetb aggregate max]
-            assert_equal {b 2 c 3} [r zrange zsetc 0 -1 withscores]
-        }
-
-        foreach cmd {ZUNIONSTORE ZINTERSTORE} {
-            test "$cmd with +inf/-inf scores - $encoding" {
-                r del zsetinf1 zsetinf2
-
-                r zadd zsetinf1 +inf key
-                r zadd zsetinf2 +inf key
-                r $cmd zsetinf3 2 zsetinf1 zsetinf2
-                assert_equal inf [r zscore zsetinf3 key]
-
-                r zadd zsetinf1 -inf key
-                r zadd zsetinf2 +inf key
-                r $cmd zsetinf3 2 zsetinf1 zsetinf2
-                assert_equal 0 [r zscore zsetinf3 key]
-
-                r zadd zsetinf1 +inf key
-                r zadd zsetinf2 -inf key
-                r $cmd zsetinf3 2 zsetinf1 zsetinf2
-                assert_equal 0 [r zscore zsetinf3 key]
-
-                r zadd zsetinf1 -inf key
-                r zadd zsetinf2 -inf key
-                r $cmd zsetinf3 2 zsetinf1 zsetinf2
-                assert_equal -inf [r zscore zsetinf3 key]
-            }
-
-            test "$cmd with NaN weights - $encoding" {
-                r del zsetinf1 zsetinf2
-
-                r zadd zsetinf1 1.0 key
-                r zadd zsetinf2 1.0 key
-                assert_error "*weight*not*float*" {
-                    r $cmd zsetinf3 2 zsetinf1 zsetinf2 weights nan nan
-                }
-            }
-        }
-
-        test "ZDIFFSTORE basics - $encoding" {
-            assert_equal 1 [r zdiffstore zsetc 2 zseta zsetb]
-            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZDIFF basics - $encoding" {
-            assert_equal {a 1} [r zdiff 2 zseta zsetb withscores]
-        }
-
-        test "ZDIFFSTORE with a regular set - $encoding" {
-            r del seta
-            r sadd seta a
-            r sadd seta b
-            r sadd seta c
-            assert_equal 1 [r zdiffstore zsetc 2 seta zsetb]
-            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZDIFF subtracting set from itself - $encoding" {
-            assert_equal 0 [r zdiffstore zsetc 2 zseta zseta]
-            assert_equal {} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZDIFF algorithm 1 - $encoding" {
-            r del zseta zsetb zsetc
-            r zadd zseta 1 a
-            r zadd zseta 2 b
-            r zadd zseta 3 c
-            r zadd zsetb 1 b
-            r zadd zsetb 2 c
-            r zadd zsetb 3 d
-            assert_equal 1 [r zdiffstore zsetc 2 zseta zsetb]
-            assert_equal {a 1} [r zrange zsetc 0 -1 withscores]
-        }
-
-        test "ZDIFF algorithm 2 - $encoding" {
-            r del zseta zsetb zsetc zsetd zsete
-            r zadd zseta 1 a
-            r zadd zseta 2 b
-            r zadd zseta 3 c
-            r zadd zseta 5 e
-            r zadd zsetb 1 b
-            r zadd zsetc 1 c
-            r zadd zsetd 1 d
-            assert_equal 2 [r zdiffstore zsete 4 zseta zsetb zsetc zsetd]
-            assert_equal {a 1 e 5} [r zrange zsete 0 -1 withscores]
-        }
-
-        test "ZDIFF fuzzing - $encoding" {
-            for {set j 0} {$j < 100} {incr j} {
-                unset -nocomplain s
-                array set s {}
-                set args {}
-                set num_sets [expr {[randomInt 10]+1}]
-                for {set i 0} {$i < $num_sets} {incr i} {
-                    set num_elements [randomInt 100]
-                    r del zset_$i
-                    lappend args zset_$i
-                    while {$num_elements} {
-                        set ele [randomValue]
-                        r zadd zset_$i [randomInt 100] $ele
-                        if {$i == 0} {
-                            set s($ele) x
-                        } else {
-                            unset -nocomplain s($ele)
-                        }
-                        incr num_elements -1
-                    }
-                }
-                set result [lsort [r zdiff [llength $args] {*}$args]]
-                assert_equal $result [lsort [array names s]]
-            }
-        }
-
-        test "Basic ZPOP with a single key - $encoding" {
-            r del zset
-            assert_equal {} [r zpopmin zset]
-            create_zset zset {-1 a 1 b 2 c 3 d 4 e}
-            assert_equal {a -1} [r zpopmin zset]
-            assert_equal {b 1} [r zpopmin zset]
-            assert_equal {e 4} [r zpopmax zset]
-            assert_equal {d 3} [r zpopmax zset]
-            assert_equal {c 2} [r zpopmin zset]
-            assert_equal 0 [r exists zset]
-            r set foo bar
-            assert_error "*WRONGTYPE*" {r zpopmin foo}
-        }
-
-        test "ZPOP with count - $encoding" {
-            r del z1 z2 z3 foo
-            r set foo bar
-            assert_equal {} [r zpopmin z1 2]
-            assert_error "*WRONGTYPE*" {r zpopmin foo 2}
-            create_zset z1 {0 a 1 b 2 c 3 d}
-            assert_equal {a 0 b 1} [r zpopmin z1 2]
-            assert_equal {d 3 c 2} [r zpopmax z1 2]
-        }
-
-        test "BZPOP with a single existing sorted set - $encoding" {
-            set rd [redis_deferring_client]
-            create_zset zset {0 a 1 b 2 c}
-
-            $rd bzpopmin zset 5
-            assert_equal {zset a 0} [$rd read]
-            $rd bzpopmin zset 5
-            assert_equal {zset b 1} [$rd read]
-            $rd bzpopmax zset 5
-            assert_equal {zset c 2} [$rd read]
-            assert_equal 0 [r exists zset]
-        }
-
-        test "BZPOP with multiple existing sorted sets - $encoding" {
-            set rd [redis_deferring_client]
-            create_zset z1 {0 a 1 b 2 c}
-            create_zset z2 {3 d 4 e 5 f}
-
-            $rd bzpopmin z1 z2 5
-            assert_equal {z1 a 0} [$rd read]
-            $rd bzpopmax z1 z2 5
-            assert_equal {z1 c 2} [$rd read]
-            assert_equal 1 [r zcard z1]
-            assert_equal 3 [r zcard z2]
-
-            $rd bzpopmax z2 z1 5
-            assert_equal {z2 f 5} [$rd read]
-            $rd bzpopmin z2 z1 5
-            assert_equal {z2 d 3} [$rd read]
-            assert_equal 1 [r zcard z1]
-            assert_equal 1 [r zcard z2]
-        }
-
-        test "BZPOP second sorted set has members - $encoding" {
-            set rd [redis_deferring_client]
-            r del z1
-            create_zset z2 {3 d 4 e 5 f}
-            $rd bzpopmax z1 z2 5
-            assert_equal {z2 f 5} [$rd read]
-            $rd bzpopmin z2 z1 5
-            assert_equal {z2 d 3} [$rd read]
-            assert_equal 0 [r zcard z1]
-            assert_equal 1 [r zcard z2]
-        }
-
-        test "Basic ZPOP - $encoding RESP3" {
-            r hello 3
-            r del z1
-            create_zset z1 {0 a 1 b 2 c 3 d}
-            assert_equal {a 0.0} [r zpopmin z1]
-            assert_equal {d 3.0} [r zpopmax z1]
-            r hello 2
-        }
-
-        test "ZPOP with count - $encoding RESP3" {
-            r hello 3
-            r del z1
-            create_zset z1 {0 a 1 b 2 c 3 d}
-            assert_equal {{a 0.0} {b 1.0}} [r zpopmin z1 2]
-            assert_equal {{d 3.0} {c 2.0}} [r zpopmax z1 2]
-            r hello 2
-        }
-
-        test "BZPOP - $encoding RESP3" {
-            r hello 3
-            set rd [redis_deferring_client]
-            create_zset zset {0 a 1 b 2 c}
-
-            $rd bzpopmin zset 5
-            assert_equal {zset a 0} [$rd read]
-            $rd bzpopmin zset 5
-            assert_equal {zset b 1} [$rd read]
-            $rd bzpopmax zset 5
-            assert_equal {zset c 2} [$rd read]
-            assert_equal 0 [r exists zset]
-            r hello 2
-        }
-
-        r config set zset-max-ziplist-entries $original_max_entries
-        r config set zset-max-ziplist-value $original_max_value
-    }
-
-    basics ziplist
-    basics skiplist
-
-    test {ZINTERSTORE regression with two sets, intset+hashtable} {
-        r del seta setb setc
-        r sadd set1 a
-        r sadd set2 10
-        r zinterstore set3 2 set1 set2
-    } {0}
-
-    test {ZUNIONSTORE regression, should not create NaN in scores} {
-        r zadd z -inf neginf
-        r zunionstore out 1 z weights 0
-        r zrange out 0 -1 withscores
-    } {neginf 0}
-
-    test {ZINTERSTORE #516 regression, mixed sets and ziplist zsets} {
-        r sadd one 100 101 102 103
-        r sadd two 100 200 201 202
-        r zadd three 1 500 1 501 1 502 1 503 1 100
-        r zinterstore to_here 3 one two three WEIGHTS 0 0 1
-        r zrange to_here 0 -1
-    } {100}
-
-    test {ZUNIONSTORE result is sorted} {
-        # Create two sets with common and not common elements, perform
-        # the UNION, check that elements are still sorted.
-        r del one two dest
-        set cmd1 [list r zadd one]
-        set cmd2 [list r zadd two]
-        for {set j 0} {$j < 1000} {incr j} {
-            lappend cmd1 [expr rand()] [randomInt 1000]
-            lappend cmd2 [expr rand()] [randomInt 1000]
-        }
-        {*}$cmd1
-        {*}$cmd2
-        assert {[r zcard one] > 100}
-        assert {[r zcard two] > 100}
-        r zunionstore dest 2 one two
-        set oldscore 0
-        foreach {ele score} [r zrange dest 0 -1 withscores] {
-            assert {$score >= $oldscore}
-            set oldscore $score
-        }
-    }
-
-    test "ZUNIONSTORE/ZINTERSTORE/ZDIFFSTORE error if using WITHSCORES " {
-        assert_error "*ERR*syntax*" {r zunionstore foo 2 zsetd zsetf withscores}
-        assert_error "*ERR*syntax*" {r zinterstore foo 2 zsetd zsetf withscores}
-        assert_error "*ERR*syntax*" {r zdiffstore foo 2 zsetd zsetf withscores}
-    }
-    
-    test {ZMSCORE retrieve} {
-        r del zmscoretest
-        r zadd zmscoretest 10 x
-        r zadd zmscoretest 20 y
-        
-        r zmscore zmscoretest x y
-    } {10 20}
-
-    test {ZMSCORE retrieve from empty set} {
-        r del zmscoretest
-        
-        r zmscore zmscoretest x y
-    } {{} {}}
-    
-    test {ZMSCORE retrieve with missing member} {
-        r del zmscoretest
-        r zadd zmscoretest 10 x
-        
-        r zmscore zmscoretest x y
-    } {10 {}}
-
-    test {ZMSCORE retrieve single member} {
-        r del zmscoretest
-        r zadd zmscoretest 10 x
-        r zadd zmscoretest 20 y
-        
-        r zmscore zmscoretest x
-    } {10}
-
-    test {ZMSCORE retrieve requires one or more members} {
-        r del zmscoretest
-        r zadd zmscoretest 10 x
-        r zadd zmscoretest 20 y
-        
-        catch {r zmscore zmscoretest} e
-        assert_match {*ERR*wrong*number*arg*} $e
-    }
-
-    test "ZSET commands don't accept the empty strings as valid score" {
-        assert_error "*not*float*" {r zadd myzset "" abc}
-    }
-
-    proc stressers {encoding} {
-        set original_max_entries [lindex [r config get zset-max-ziplist-entries] 1]
-        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
-        if {$encoding == "ziplist"} {
-            # Little extra to allow proper fuzzing in the sorting stresser
-            r config set zset-max-ziplist-entries 256
-            r config set zset-max-ziplist-value 64
-            set elements 128
-        } elseif {$encoding == "skiplist"} {
-            r config set zset-max-ziplist-entries 0
-            r config set zset-max-ziplist-value 0
-            if {$::accurate} {set elements 1000} else {set elements 100}
-        } else {
-            puts "Unknown sorted set encoding"
-            exit
-        }
-
-        test "ZSCORE - $encoding" {
-            r del zscoretest
-            set aux {}
-            for {set i 0} {$i < $elements} {incr i} {
-                set score [expr rand()]
-                lappend aux $score
-                r zadd zscoretest $score $i
-            }
-
-            assert_encoding $encoding zscoretest
-            for {set i 0} {$i < $elements} {incr i} {
-                assert_equal [lindex $aux $i] [r zscore zscoretest $i]
-            }
-        }
-
-        test "ZMSCORE - $encoding" {
-            r del zscoretest
-            set aux {}
-            for {set i 0} {$i < $elements} {incr i} {
-                set score [expr rand()]
-                lappend aux $score
-                r zadd zscoretest $score $i
-            }
-
-            assert_encoding $encoding zscoretest
-            for {set i 0} {$i < $elements} {incr i} {
-                assert_equal [lindex $aux $i] [r zmscore zscoretest $i]
-            }
-        }
-
-        test "ZSCORE after a DEBUG RELOAD - $encoding" {
-            r del zscoretest
-            set aux {}
-            for {set i 0} {$i < $elements} {incr i} {
-                set score [expr rand()]
-                lappend aux $score
-                r zadd zscoretest $score $i
-            }
-
-            r debug reload
-            assert_encoding $encoding zscoretest
-            for {set i 0} {$i < $elements} {incr i} {
-                assert_equal [lindex $aux $i] [r zscore zscoretest $i]
-            }
-        }
-
-        test "ZSET sorting stresser - $encoding" {
-            set delta 0
-            for {set test 0} {$test < 2} {incr test} {
-                unset -nocomplain auxarray
-                array set auxarray {}
-                set auxlist {}
-                r del myzset
-                for {set i 0} {$i < $elements} {incr i} {
-                    if {$test == 0} {
-                        set score [expr rand()]
-                    } else {
-                        set score [expr int(rand()*10)]
-                    }
-                    set auxarray($i) $score
-                    r zadd myzset $score $i
-                    # Random update
-                    if {[expr rand()] < .2} {
-                        set j [expr int(rand()*1000)]
-                        if {$test == 0} {
-                            set score [expr rand()]
-                        } else {
-                            set score [expr int(rand()*10)]
-                        }
-                        set auxarray($j) $score
-                        r zadd myzset $score $j
-                    }
-                }
-                foreach {item score} [array get auxarray] {
-                    lappend auxlist [list $score $item]
-                }
-                set sorted [lsort -command zlistAlikeSort $auxlist]
-                set auxlist {}
-                foreach x $sorted {
-                    lappend auxlist [lindex $x 1]
-                }
-
-                assert_encoding $encoding myzset
-                set fromredis [r zrange myzset 0 -1]
-                set delta 0
-                for {set i 0} {$i < [llength $fromredis]} {incr i} {
-                    if {[lindex $fromredis $i] != [lindex $auxlist $i]} {
-                        incr delta
-                    }
-                }
-            }
-            assert_equal 0 $delta
-        }
-
-        test "ZRANGEBYSCORE fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
-            set err {}
-            r del zset
-            for {set i 0} {$i < $elements} {incr i} {
-                r zadd zset [expr rand()] $i
-            }
-
-            assert_encoding $encoding zset
-            for {set i 0} {$i < 100} {incr i} {
-                set min [expr rand()]
-                set max [expr rand()]
-                if {$min > $max} {
-                    set aux $min
-                    set min $max
-                    set max $aux
-                }
-                set low [r zrangebyscore zset -inf $min]
-                set ok [r zrangebyscore zset $min $max]
-                set high [r zrangebyscore zset $max +inf]
-                set lowx [r zrangebyscore zset -inf ($min]
-                set okx [r zrangebyscore zset ($min ($max]
-                set highx [r zrangebyscore zset ($max +inf]
-
-                if {[r zcount zset -inf $min] != [llength $low]} {
-                    append err "Error, len does not match zcount\n"
-                }
-                if {[r zcount zset $min $max] != [llength $ok]} {
-                    append err "Error, len does not match zcount\n"
-                }
-                if {[r zcount zset $max +inf] != [llength $high]} {
-                    append err "Error, len does not match zcount\n"
-                }
-                if {[r zcount zset -inf ($min] != [llength $lowx]} {
-                    append err "Error, len does not match zcount\n"
-                }
-                if {[r zcount zset ($min ($max] != [llength $okx]} {
-                    append err "Error, len does not match zcount\n"
-                }
-                if {[r zcount zset ($max +inf] != [llength $highx]} {
-                    append err "Error, len does not match zcount\n"
-                }
-
-                foreach x $low {
-                    set score [r zscore zset $x]
-                    if {$score > $min} {
-                        append err "Error, score for $x is $score > $min\n"
-                    }
-                }
-                foreach x $lowx {
-                    set score [r zscore zset $x]
-                    if {$score >= $min} {
-                        append err "Error, score for $x is $score >= $min\n"
-                    }
-                }
-                foreach x $ok {
-                    set score [r zscore zset $x]
-                    if {$score < $min || $score > $max} {
-                        append err "Error, score for $x is $score outside $min-$max range\n"
-                    }
-                }
-                foreach x $okx {
-                    set score [r zscore zset $x]
-                    if {$score <= $min || $score >= $max} {
-                        append err "Error, score for $x is $score outside $min-$max open range\n"
-                    }
-                }
-                foreach x $high {
-                    set score [r zscore zset $x]
-                    if {$score < $max} {
-                        append err "Error, score for $x is $score < $max\n"
-                    }
-                }
-                foreach x $highx {
-                    set score [r zscore zset $x]
-                    if {$score <= $max} {
-                        append err "Error, score for $x is $score <= $max\n"
-                    }
-                }
-            }
-            assert_equal {} $err
-        }
-
-        test "ZRANGEBYLEX fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
-            set lexset {}
-            r del zset
-            for {set j 0} {$j < $elements} {incr j} {
-                set e [randstring 0 30 alpha]
-                lappend lexset $e
-                r zadd zset 0 $e
-            }
-            set lexset [lsort -unique $lexset]
-            for {set j 0} {$j < 100} {incr j} {
-                set min [randstring 0 30 alpha]
-                set max [randstring 0 30 alpha]
-                set mininc [randomInt 2]
-                set maxinc [randomInt 2]
-                if {$mininc} {set cmin "\[$min"} else {set cmin "($min"}
-                if {$maxinc} {set cmax "\[$max"} else {set cmax "($max"}
-                set rev [randomInt 2]
-                if {$rev} {
-                    set cmd zrevrangebylex
-                } else {
-                    set cmd zrangebylex
-                }
-
-                # Make sure data is the same in both sides
-                assert {[r zrange zset 0 -1] eq $lexset}
-
-                # Get the Redis output
-                set output [r $cmd zset $cmin $cmax]
-                if {$rev} {
-                    set outlen [r zlexcount zset $cmax $cmin]
-                } else {
-                    set outlen [r zlexcount zset $cmin $cmax]
-                }
-
-                # Compute the same output via Tcl
-                set o {}
-                set copy $lexset
-                if {(!$rev && [string compare $min $max] > 0) ||
-                    ($rev && [string compare $max $min] > 0)} {
-                    # Empty output when ranges are inverted.
-                } else {
-                    if {$rev} {
-                        # Invert the Tcl array using Redis itself.
-                        set copy [r zrevrange zset 0 -1]
-                        # Invert min / max as well
-                        lassign [list $min $max $mininc $maxinc] \
-                            max min maxinc mininc
-                    }
-                    foreach e $copy {
-                        set mincmp [string compare $e $min]
-                        set maxcmp [string compare $e $max]
-                        if {
-                             ($mininc && $mincmp >= 0 || !$mininc && $mincmp > 0)
-                             &&
-                             ($maxinc && $maxcmp <= 0 || !$maxinc && $maxcmp < 0)
-                        } {
-                            lappend o $e
-                        }
-                    }
-                }
-                assert {$o eq $output}
-                assert {$outlen eq [llength $output]}
-            }
-        }
-
-        test "ZREMRANGEBYLEX fuzzy test, 100 ranges in $elements element sorted set - $encoding" {
-            set lexset {}
-            r del zset zsetcopy
-            for {set j 0} {$j < $elements} {incr j} {
-                set e [randstring 0 30 alpha]
-                lappend lexset $e
-                r zadd zset 0 $e
-            }
-            set lexset [lsort -unique $lexset]
-            for {set j 0} {$j < 100} {incr j} {
-                # Copy...
-                r zunionstore zsetcopy 1 zset
-                set lexsetcopy $lexset
-
-                set min [randstring 0 30 alpha]
-                set max [randstring 0 30 alpha]
-                set mininc [randomInt 2]
-                set maxinc [randomInt 2]
-                if {$mininc} {set cmin "\[$min"} else {set cmin "($min"}
-                if {$maxinc} {set cmax "\[$max"} else {set cmax "($max"}
-
-                # Make sure data is the same in both sides
-                assert {[r zrange zset 0 -1] eq $lexset}
-
-                # Get the range we are going to remove
-                set torem [r zrangebylex zset $cmin $cmax]
-                set toremlen [r zlexcount zset $cmin $cmax]
-                r zremrangebylex zsetcopy $cmin $cmax
-                set output [r zrange zsetcopy 0 -1]
-
-                # Remove the range with Tcl from the original list
-                if {$toremlen} {
-                    set first [lsearch -exact $lexsetcopy [lindex $torem 0]]
-                    set last [expr {$first+$toremlen-1}]
-                    set lexsetcopy [lreplace $lexsetcopy $first $last]
-                }
-                assert {$lexsetcopy eq $output}
-            }
-        }
-
-        test "ZSETs skiplist implementation backlink consistency test - $encoding" {
-            set diff 0
-            for {set j 0} {$j < $elements} {incr j} {
-                r zadd myzset [expr rand()] "Element-$j"
-                r zrem myzset "Element-[expr int(rand()*$elements)]"
-            }
-
-            assert_encoding $encoding myzset
-            set l1 [r zrange myzset 0 -1]
-            set l2 [r zrevrange myzset 0 -1]
-            for {set j 0} {$j < [llength $l1]} {incr j} {
-                if {[lindex $l1 $j] ne [lindex $l2 end-$j]} {
-                    incr diff
-                }
-            }
-            assert_equal 0 $diff
-        }
-
-        test "ZSETs ZRANK augmented skip list stress testing - $encoding" {
-            set err {}
-            r del myzset
-            for {set k 0} {$k < 2000} {incr k} {
-                set i [expr {$k % $elements}]
-                if {[expr rand()] < .2} {
-                    r zrem myzset $i
-                } else {
-                    set score [expr rand()]
-                    r zadd myzset $score $i
-                    assert_encoding $encoding myzset
-                }
-
-                set card [r zcard myzset]
-                if {$card > 0} {
-                    set index [randomInt $card]
-                    set ele [lindex [r zrange myzset $index $index] 0]
-                    set rank [r zrank myzset $ele]
-                    if {$rank != $index} {
-                        set err "$ele RANK is wrong! ($rank != $index)"
-                        break
-                    }
-                }
-            }
-            assert_equal {} $err
-        }
-
-        test "BZPOPMIN, ZADD + DEL should not awake blocked client" {
-            set rd [redis_deferring_client]
-            r del zset
-
-            $rd bzpopmin zset 0
-            r multi
-            r zadd zset 0 foo
-            r del zset
-            r exec
-            r del zset
-            r zadd zset 1 bar
-            $rd read
-        } {zset bar 1}
-
-        test "BZPOPMIN, ZADD + DEL + SET should not awake blocked client" {
-            set rd [redis_deferring_client]
-            r del list
-
-            r del zset
-
-            $rd bzpopmin zset 0
-            r multi
-            r zadd zset 0 foo
-            r del zset
-            r set zset foo
-            r exec
-            r del zset
-            r zadd zset 1 bar
-            $rd read
-        } {zset bar 1}
-
-        test "BZPOPMIN with same key multiple times should work" {
-            set rd [redis_deferring_client]
-            r del z1 z2
-
-            # Data arriving after the BZPOPMIN.
-            $rd bzpopmin z1 z2 z2 z1 0
-            r zadd z1 0 a
-            assert_equal [$rd read] {z1 a 0}
-            $rd bzpopmin z1 z2 z2 z1 0
-            r zadd z2 1 b
-            assert_equal [$rd read] {z2 b 1}
-
-            # Data already there.
-            r zadd z1 0 a
-            r zadd z2 1 b
-            $rd bzpopmin z1 z2 z2 z1 0
-            assert_equal [$rd read] {z1 a 0}
-            $rd bzpopmin z1 z2 z2 z1 0
-            assert_equal [$rd read] {z2 b 1}
-        }
-
-        test "MULTI/EXEC is isolated from the point of view of BZPOPMIN" {
-            set rd [redis_deferring_client]
-            r del zset
-            $rd bzpopmin zset 0
-            r multi
-            r zadd zset 0 a
-            r zadd zset 1 b
-            r zadd zset 2 c
-            r exec
-            $rd read
-        } {zset a 0}
-
-        test "BZPOPMIN with variadic ZADD" {
-            set rd [redis_deferring_client]
-            r del zset
-            if {$::valgrind} {after 100}
-            $rd bzpopmin zset 0
-            if {$::valgrind} {after 100}
-            assert_equal 2 [r zadd zset -1 foo 1 bar]
-            if {$::valgrind} {after 100}
-            assert_equal {zset foo -1} [$rd read]
-            assert_equal {bar} [r zrange zset 0 -1]
-        }
-
-        test "BZPOPMIN with zero timeout should block indefinitely" {
-            set rd [redis_deferring_client]
-            r del zset
-            $rd bzpopmin zset 0
-            after 1000
-            r zadd zset 0 foo
-            assert_equal {zset foo 0} [$rd read]
-        }
-        r config set zset-max-ziplist-entries $original_max_entries
-        r config set zset-max-ziplist-value $original_max_value
-    }
-
-    tags {"slow"} {
-        stressers ziplist
-        stressers skiplist
-    }
-
-    test {ZSET skiplist order consistency when elements are moved} {
-        set original_max [lindex [r config get zset-max-ziplist-entries] 1]
-        r config set zset-max-ziplist-entries 0
-        for {set times 0} {$times < 10} {incr times} {
-            r del zset
-            for {set j 0} {$j < 1000} {incr j} {
-                r zadd zset [randomInt 50] ele-[randomInt 10]
-            }
-
-            # Make sure that element ordering is correct
-            set prev_element {}
-            set prev_score -1
-            foreach {element score} [r zrange zset 0 -1 WITHSCORES] {
-                # Assert that elements are in increasing ordering
-                assert {
-                    $prev_score < $score ||
-                    ($prev_score == $score &&
-                     [string compare $prev_element $element] == -1)
-                }
-                set prev_element $element
-                set prev_score $score
-            }
-        }
-        r config set zset-max-ziplist-entries $original_max
-    }
-
-    test {ZRANGESTORE basic} {
-        r flushall
-        r zadd z1 1 a 2 b 3 c 4 d
-        set res [r zrangestore z2 z1 0 -1]
-        assert_equal $res 4
-        r zrange z2 0 -1 withscores
-    } {a 1 b 2 c 3 d 4}
-
-    test {ZRANGESTORE RESP3} {
-        r hello 3
-        r zrange z2 0 -1 withscores
-    } {{a 1.0} {b 2.0} {c 3.0} {d 4.0}}
-    r hello 2
-
-    test {ZRANGESTORE range} {
-        set res [r zrangestore z2 z1 1 2]
-        assert_equal $res 2
-        r zrange z2 0 -1 withscores
-    } {b 2 c 3}
-
-    test {ZRANGESTORE BYLEX} {
-        set res [r zrangestore z2 z1 \[b \[c BYLEX]
-        assert_equal $res 2
-        r zrange z2 0 -1 withscores
-    } {b 2 c 3}
-
-    test {ZRANGESTORE BYSCORE} {
-        set res [r zrangestore z2 z1 1 2 BYSCORE]
-        assert_equal $res 2
-        r zrange z2 0 -1 withscores
-    } {a 1 b 2}
-
-    test {ZRANGESTORE BYSCORE LIMIT} {
-        set res [r zrangestore z2 z1 0 5 BYSCORE LIMIT 0 2]
-        assert_equal $res 2
-        r zrange z2 0 -1 withscores
-    } {a 1 b 2}
-
-    test {ZRANGESTORE BYSCORE REV LIMIT} {
-        set res [r zrangestore z2 z1 5 0 BYSCORE REV LIMIT 0 2]
-        assert_equal $res 2
-        r zrange z2 0 -1 withscores
-    } {c 3 d 4}
-
-    test {ZRANGE BYSCORE REV LIMIT} {
-        r zrange z1 5 0 BYSCORE REV LIMIT 0 2 WITHSCORES
-    } {d 4 c 3}
-
-    test {ZRANGESTORE - src key missing} {
-        set res [r zrangestore z2{t} missing{t} 0 -1]
-        assert_equal $res 0
-        r exists z2{t}
-    } {0}
-
-    test {ZRANGESTORE - src key wrong type} {
-        r zadd z2{t} 1 a
-        r set foo{t} bar
-        assert_error "*WRONGTYPE*" {r zrangestore z2{t} foo{t} 0 -1}
-        r zrange z2{t} 0 -1
-    } {a}
-
-    test {ZRANGESTORE - empty range} {
-        set res [r zrangestore z2 z1 5 6]
-        assert_equal $res 0
-        r exists z2
-    } {0}
-
-    test {ZRANGESTORE BYLEX - empty range} {
-        set res [r zrangestore z2 z1 \[f \[g BYLEX]
-        assert_equal $res 0
-        r exists z2
-    } {0}
-
-    test {ZRANGESTORE BYSCORE - empty range} {
-        set res [r zrangestore z2 z1 5 6 BYSCORE]
-        assert_equal $res 0
-        r exists z2
-    } {0}
-
-    test {ZRANGE BYLEX} {
-        r zrange z1 \[b \[c BYLEX
-    } {b c}
-
-    test {ZRANGESTORE invalid syntax} {
-        catch {r zrangestore z2 z1 0 -1 limit 1 2} err
-        assert_match "*syntax*" $err
-        catch {r zrangestore z2 z1 0 -1 WITHSCORES} err
-        assert_match "*syntax*" $err
-    }
-
-    test {ZRANGE invalid syntax} {
-        catch {r zrange z1 0 -1 limit 1 2} err
-        assert_match "*syntax*" $err
-        catch {r zrange z1 0 -1 BYLEX WITHSCORES} err
-        assert_match "*syntax*" $err
-        catch {r zrevrange z1 0 -1 BYSCORE} err
-        assert_match "*syntax*" $err
-        catch {r zrangebyscore z1 0 -1 REV} err
-        assert_match "*syntax*" $err
-    }
-
-    proc get_keys {l} {
-        set res {}
-        foreach {score key} $l {
-            lappend res $key
-        }
-        return $res
-    }
-
-    # Check whether the zset members belong to the zset
-    proc check_member {mydict res} {
-        foreach ele $res {
-            assert {[dict exists $mydict $ele]}
-        }
-    }
-
-    # Check whether the zset members and score belong to the zset
-    proc check_member_and_score {mydict res} {
-       foreach {key val} $res {
-            assert_equal $val [dict get $mydict $key]
-        }
-    }
-
-    foreach {type contents} "ziplist {1 a 2 b 3 c} skiplist {1 a 2 b 3 [randstring 70 90 alpha]}" {
-        set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
-        r config set zset-max-ziplist-value 10
-        create_zset myzset $contents
-        assert_encoding $type myzset
-
-        test "ZRANDMEMBER - $type" {
-            unset -nocomplain myzset
-            array set myzset {}
-            for {set i 0} {$i < 100} {incr i} {
-                set key [r zrandmember myzset]
-                set myzset($key) 1
-            }
-            assert_equal [lsort [get_keys $contents]] [lsort [array names myzset]]
-        }
-        r config set zset-max-ziplist-value $original_max_value
-    }
-
-    test "ZRANDMEMBER with RESP3" {
-        r hello 3
-        set res [r zrandmember myzset 3 withscores]
-        assert_equal [llength $res] 3
-        assert_equal [llength [lindex $res 1]] 2
-
-        set res [r zrandmember myzset 3]
-        assert_equal [llength $res] 3
-        assert_equal [llength [lindex $res 1]] 1
-    }
-    r hello 2
-
-    test "ZRANDMEMBER count of 0 is handled correctly" {
-        r zrandmember myzset 0
-    } {}
-
-    test "ZRANDMEMBER with <count> against non existing key" {
-        r zrandmember nonexisting_key 100
-    } {}
-
-    # Make sure we can distinguish between an empty array and a null response
-    r readraw 1
-
-    test "ZRANDMEMBER count of 0 is handled correctly - emptyarray" {
-        r zrandmember myzset 0
-    } {*0}
-
-    test "ZRANDMEMBER with <count> against non existing key - emptyarray" {
-        r zrandmember nonexisting_key 100
-    } {*0}
-
-    r readraw 0
-
-    foreach {type contents} "
-        skiplist {1 a 2 b 3 c 4 d 5 e 6 f 7 g 7 h 9 i 10 [randstring 70 90 alpha]}
-        ziplist {1 a 2 b 3 c 4 d 5 e 6 f 7 g 7 h 9 i 10 j} " {
-        test "ZRANDMEMBER with <count> - $type" {
-            set original_max_value [lindex [r config get zset-max-ziplist-value] 1]
-            r config set zset-max-ziplist-value 10
-            create_zset myzset $contents
-            assert_encoding $type myzset
-
-            # create a dict for easy lookup
-            unset -nocomplain mydict
-            foreach {k v} [r zrange myzset 0 -1 withscores] {
-                dict append mydict $k $v
-            }
-
-            # We'll stress different parts of the code, see the implementation
-            # of ZRANDMEMBER for more information, but basically there are
-            # four different code paths.
-
-            # PATH 1: Use negative count.
-
-            # 1) Check that it returns repeated elements with and without values.
-            # 2) Check that all the elements actually belong to the original zset.
-            set res [r zrandmember myzset -20]
-            assert_equal [llength $res] 20
-            check_member $mydict $res
-
-            set res [r zrandmember myzset -1001]
-            assert_equal [llength $res] 1001
-            check_member $mydict $res
-
-            # again with WITHSCORES
-            set res [r zrandmember myzset -20 withscores]
-            assert_equal [llength $res] 40
-            check_member_and_score $mydict $res
-
-            set res [r zrandmember myzset -1001 withscores]
-            assert_equal [llength $res] 2002
-            check_member_and_score $mydict $res
-
-            # Test random uniform distribution
-            # df = 9, 40 means 0.00001 probability
-            set res [r zrandmember myzset -1000]
-            assert_lessthan [chi_square_value $res] 40
-            check_member $mydict $res
-
-            # 3) Check that eventually all the elements are returned.
-            #    Use both WITHSCORES and without
-            unset -nocomplain auxset
-            set iterations 1000
-            while {$iterations != 0} {
-                incr iterations -1
-                if {[expr {$iterations % 2}] == 0} {
-                    set res [r zrandmember myzset -3 withscores]
-                    foreach {key val} $res {
-                        dict append auxset $key $val
-                    }
-                } else {
-                    set res [r zrandmember myzset -3]
-                    foreach key $res {
-                        dict append auxset $key
-                    }
-                }
-                if {[lsort [dict keys $mydict]] eq
-                    [lsort [dict keys $auxset]]} {
-                    break;
-                }
-            }
-            assert {$iterations != 0}
-
-            # PATH 2: positive count (unique behavior) with requested size
-            # equal or greater than set size.
-            foreach size {10 20} {
-                set res [r zrandmember myzset $size]
-                assert_equal [llength $res] 10
-                assert_equal [lsort $res] [lsort [dict keys $mydict]]
-                check_member $mydict $res
-
-                # again with WITHSCORES
-                set res [r zrandmember myzset $size withscores]
-                assert_equal [llength $res] 20
-                assert_equal [lsort $res] [lsort $mydict]
-                check_member_and_score $mydict $res
-            }
-
-            # PATH 3: Ask almost as elements as there are in the set.
-            # In this case the implementation will duplicate the original
-            # set and will remove random elements up to the requested size.
-            #
-            # PATH 4: Ask a number of elements definitely smaller than
-            # the set size.
-            #
-            # We can test both the code paths just changing the size but
-            # using the same code.
-            foreach size {1 2 8} {
-                # 1) Check that all the elements actually belong to the
-                # original set.
-                set res [r zrandmember myzset $size]
-                assert_equal [llength $res] $size
-                check_member $mydict $res
-
-                # again with WITHSCORES
-                set res [r zrandmember myzset $size withscores]
-                assert_equal [llength $res] [expr {$size * 2}]
-                check_member_and_score $mydict $res
-
-                # 2) Check that eventually all the elements are returned.
-                #    Use both WITHSCORES and without
-                unset -nocomplain auxset
-                unset -nocomplain allkey
-                set iterations [expr {1000 / $size}]
-                set all_ele_return false
-                while {$iterations != 0} {
-                    incr iterations -1
-                    if {[expr {$iterations % 2}] == 0} {
-                        set res [r zrandmember myzset $size withscores]
-                        foreach {key value} $res {
-                            dict append auxset $key $value
-                            lappend allkey $key
-                        }
-                    } else {
-                        set res [r zrandmember myzset $size]
-                        foreach key $res {
-                            dict append auxset $key
-                            lappend allkey $key
-                        }
-                    }
-                    if {[lsort [dict keys $mydict]] eq
-                        [lsort [dict keys $auxset]]} {
-                        set all_ele_return true
-                    }
-                }
-                assert_equal $all_ele_return true
-                # df = 9, 40 means 0.00001 probability
-                assert_lessthan [chi_square_value $allkey] 40
-            }
-        }
-        r config set zset-max-ziplist-value $original_max_value
-    }
-
-}
diff --git a/redis-stable/tests/unit/violations.tcl b/redis-stable/tests/unit/violations.tcl
deleted file mode 100644
index 1d3140c5..00000000
--- a/redis-stable/tests/unit/violations.tcl
+++ /dev/null
@@ -1,156 +0,0 @@
-# These tests consume massive amounts of memory, and are not
-# suitable to be executed as part of the normal test suite
-set ::str500 [string repeat x 500000000] ;# 500mb
-
-# Utility function to write big argument into redis client connection
-proc write_big_bulk {size} {
-    r write "\$$size\r\n"
-    while {$size >= 500000000} {
-        r write $::str500
-        incr size -500000000
-    }
-    if {$size > 0} {
-        r write [string repeat x $size]
-    }
-    r write "\r\n"
-}
-
-# One XADD with one huge 5GB field
-# Expected to fail resulting in an empty stream
-start_server [list overrides [list save ""] ] {
-    test {XADD one huge field} {
-        r config set proto-max-bulk-len 10000000000 ;#10gb
-        r config set client-query-buffer-limit 10000000000 ;#10gb
-        r write "*5\r\n\$4\r\nXADD\r\n\$2\r\nS1\r\n\$1\r\n*\r\n"
-        r write "\$1\r\nA\r\n"
-        write_big_bulk 5000000000 ;#5gb
-        r flush
-        catch {r read} err
-        assert_match {*too large*} $err
-        r xlen S1
-    } {0}
-}
-
-# One XADD with one huge (exactly nearly) 4GB field
-# This uncovers the overflow in lpEncodeGetType
-# Expected to fail resulting in an empty stream
-start_server [list overrides [list save ""] ] {
-    test {XADD one huge field - 1} {
-        r config set proto-max-bulk-len 10000000000 ;#10gb
-        r config set client-query-buffer-limit 10000000000 ;#10gb
-        r write "*5\r\n\$4\r\nXADD\r\n\$2\r\nS1\r\n\$1\r\n*\r\n"
-        r write "\$1\r\nA\r\n"
-        write_big_bulk 4294967295 ;#4gb-1
-        r flush
-        catch {r read} err
-        assert_match {*too large*} $err
-        r xlen S1
-    } {0}
-}
-
-# Gradually add big stream fields using repeated XADD calls
-start_server [list overrides [list save ""] ] {
-    test {several XADD big fields} {
-        r config set stream-node-max-bytes 0
-        for {set j 0} {$j<10} {incr j} {
-            r xadd stream * 1 $::str500 2 $::str500
-        }
-        r ping
-        r xlen stream
-    } {10}
-}
-
-# Add over 4GB to a single stream listpack (one XADD command)
-# Expected to fail resulting in an empty stream
-start_server [list overrides [list save ""] ] {
-    test {single XADD big fields} {
-        r write "*23\r\n\$4\r\nXADD\r\n\$1\r\nS\r\n\$1\r\n*\r\n"
-        for {set j 0} {$j<10} {incr j} {
-            r write "\$1\r\n$j\r\n"
-            write_big_bulk 500000000 ;#500mb
-        }
-        r flush
-        catch {r read} err
-        assert_match {*too large*} $err
-        r xlen S
-    } {0}
-}
-
-# Gradually add big hash fields using repeated HSET calls
-# This reproduces the overflow in the call to ziplistResize
-# Object will be converted to hashtable encoding
-start_server [list overrides [list save ""] ] {
-    r config set hash-max-ziplist-value 1000000000 ;#1gb
-    test {hash with many big fields} {
-        for {set j 0} {$j<10} {incr j} {
-            r hset h $j $::str500
-        }
-        r object encoding h
-    } {hashtable}
-}
-
-# Add over 4GB to a single hash field (one HSET command)
-# Object will be converted to hashtable encoding
-start_server [list overrides [list save ""] ] {
-    test {hash with one huge field} {
-        catch {r config set hash-max-ziplist-value 10000000000} ;#10gb
-        r config set proto-max-bulk-len 10000000000 ;#10gb
-        r config set client-query-buffer-limit 10000000000 ;#10gb
-        r write "*4\r\n\$4\r\nHSET\r\n\$2\r\nH1\r\n"
-        r write "\$1\r\nA\r\n"
-        write_big_bulk 5000000000 ;#5gb
-        r flush
-        r read
-        r object encoding H1
-    } {hashtable}
-}
-
-# Add over 4GB to a single list member (one LPUSH command)
-# Currently unsupported, and expected to fail rather than being truncated
-# Expected to fail resulting in a non-existing list
-start_server [list overrides [list save ""] ] {
-    test {list with one huge field} {
-        r config set proto-max-bulk-len 10000000000 ;#10gb
-        r config set client-query-buffer-limit 10000000000 ;#10gb
-        r write "*3\r\n\$5\r\nLPUSH\r\n\$2\r\nL1\r\n"
-        write_big_bulk 5000000000 ;#5gb
-        r flush
-        catch {r read} err
-        assert_match {*too large*} $err
-        r exists L1
-    } {0}
-}
-
-# SORT which attempts to store an element larger than 4GB into a list.
-# Currently unsupported and results in an assertion instead of truncation
-start_server [list overrides [list save ""] ] {
-    test {SORT adds huge field to list} {
-        r config set proto-max-bulk-len 10000000000 ;#10gb
-        r config set client-query-buffer-limit 10000000000 ;#10gb
-        r write "*3\r\n\$3\r\nSET\r\n\$2\r\nS1\r\n"
-        write_big_bulk 5000000000 ;#5gb
-        r flush
-        r read
-        assert_equal [r strlen S1] 5000000000
-        r set S2 asdf
-        r sadd myset 1 2
-        r mset D1 1 D2 2
-        catch {r sort myset by D* get S* store mylist}
-        assert_equal [count_log_message 0 "crashed by signal"] 0
-        assert_equal [count_log_message 0 "ASSERTION FAILED"] 1
-    }
-}
-
-# SORT which stores an integer encoded element into a list.
-# Just for coverage, no news here.
-start_server [list overrides [list save ""] ] {
-    test {SORT adds integer field to list} {
-        r set S1 asdf
-        r set S2 123 ;# integer encoded
-        assert_encoding "int" S2
-        r sadd myset 1 2
-        r mset D1 1 D2 2
-        r sort myset by D* get S* store mylist
-        r llen mylist
-    } {2}
-}
diff --git a/redis-stable/tests/unit/wait.tcl b/redis-stable/tests/unit/wait.tcl
deleted file mode 100644
index 78c3d820..00000000
--- a/redis-stable/tests/unit/wait.tcl
+++ /dev/null
@@ -1,58 +0,0 @@
-source tests/support/cli.tcl
-
-start_server {tags {"wait network"}} {
-start_server {} {
-    set slave [srv 0 client]
-    set slave_host [srv 0 host]
-    set slave_port [srv 0 port]
-    set slave_pid [srv 0 pid]
-    set master [srv -1 client]
-    set master_host [srv -1 host]
-    set master_port [srv -1 port]
-
-    test {Setup slave} {
-        $slave slaveof $master_host $master_port
-        wait_for_condition 50 100 {
-            [s 0 master_link_status] eq {up}
-        } else {
-            fail "Replication not started."
-        }
-    }
-
-    test {WAIT should acknowledge 1 additional copy of the data} {
-        $master set foo 0
-        $master incr foo
-        $master incr foo
-        $master incr foo
-        assert {[$master wait 1 5000] == 1}
-        assert {[$slave get foo] == 3}
-    }
-
-    test {WAIT should not acknowledge 2 additional copies of the data} {
-        $master incr foo
-        assert {[$master wait 2 1000] <= 1}
-    }
-
-    test {WAIT should not acknowledge 1 additional copy if slave is blocked} {
-        exec kill -SIGSTOP $slave_pid
-        $master set foo 0
-        $master incr foo
-        $master incr foo
-        $master incr foo
-        assert {[$master wait 1 1000] == 0}
-        exec kill -SIGCONT $slave_pid
-        assert {[$master wait 1 1000] == 1}
-    }
-
-    test {WAIT implicitly blocks on client pause since ACKs aren't sent} {
-        exec kill -SIGSTOP $slave_pid
-        $master multi
-        $master incr foo
-        $master client pause 10000 write
-        $master exec
-        assert {[$master wait 1 1000] == 0}
-        $master client unpause
-        exec kill -SIGCONT $slave_pid
-        assert {[$master wait 1 1000] == 1}
-    }
-}}
diff --git a/redis-stable/utils/build-static-symbols.tcl b/redis-stable/utils/build-static-symbols.tcl
deleted file mode 100644
index e634cbe0..00000000
--- a/redis-stable/utils/build-static-symbols.tcl
+++ /dev/null
@@ -1,22 +0,0 @@
-# Build a symbol table for static symbols of redis.c
-# Useful to get stack traces on segfault without a debugger. See redis.c
-# for more information.
-#
-# Copyright(C) 2009 Salvatore Sanfilippo, under the BSD license.
-
-set fd [open redis.c]
-set symlist {}
-while {[gets $fd line] != -1} {
-    if {[regexp {^static +[A-z0-9]+[ *]+([A-z0-9]*)\(} $line - sym]} {
-        lappend symlist $sym
-    }
-}
-set symlist [lsort -unique $symlist]
-puts "static struct redisFunctionSym symsTable\[\] = {"
-foreach sym $symlist {
-    puts "{\"$sym\",(unsigned long)$sym},"
-}
-puts "{NULL,0}"
-puts "};"
-
-close $fd
diff --git a/redis-stable/utils/cluster_fail_time.tcl b/redis-stable/utils/cluster_fail_time.tcl
deleted file mode 100644
index 87399495..00000000
--- a/redis-stable/utils/cluster_fail_time.tcl
+++ /dev/null
@@ -1,50 +0,0 @@
-# This simple script is used in order to estimate the average PFAIL->FAIL
-# state switch after a failure.
-
-set ::sleep_time 10     ; # How much to sleep to trigger PFAIL.
-set ::fail_port 30016   ; # Node to put in sleep.
-set ::other_port 30001  ; # Node to use to monitor the flag switch.
-
-proc avg vector {
-    set sum 0.0
-    foreach x $vector {
-        set sum [expr {$sum+$x}]
-    }
-    expr {$sum/[llength $vector]}
-}
-
-set samples {}
-while 1 {
-    exec redis-cli -p $::fail_port debug sleep $::sleep_time > /dev/null &
-
-    # Wait for fail? to appear.
-    while 1 {
-        set output [exec redis-cli -p $::other_port cluster nodes]
-        if {[string match {*fail\?*} $output]} break
-        after 100
-    }
-
-    puts "FAIL?"
-    set start [clock milliseconds]
-
-    # Wait for fail? to disappear.
-    while 1 {
-        set output [exec redis-cli -p $::other_port cluster nodes]
-        if {![string match {*fail\?*} $output]} break
-        after 100
-    }
-
-    puts "FAIL"
-    set now [clock milliseconds]
-    set elapsed [expr {$now-$start}]
-    puts $elapsed
-    lappend samples $elapsed
-
-    puts "AVG([llength $samples]): [avg $samples]"
-
-    # Wait for the instance to be available again.
-    exec redis-cli -p $::fail_port ping
-
-    # Wait for the fail flag to be cleared.
-    after 2000
-}
diff --git a/redis-stable/utils/corrupt_rdb.c b/redis-stable/utils/corrupt_rdb.c
deleted file mode 100644
index df9c93ed..00000000
--- a/redis-stable/utils/corrupt_rdb.c
+++ /dev/null
@@ -1,45 +0,0 @@
-/* Trivia program to corrupt an RDB file in order to check the RDB check
- * program behavior and effectiveness.
- *
- * Copyright (C) 2016 Salvatore Sanfilippo.
- * This software is released in the 3-clause BSD license. */
-
-#include <stdio.h>
-#include <fcntl.h>
-#include <sys/stat.h>
-#include <stdlib.h>
-#include <unistd.h>
-#include <time.h>
-
-int main(int argc, char **argv) {
-    struct stat stat;
-    int fd, cycles;
-
-    if (argc != 3) {
-        fprintf(stderr,"Usage: <filename> <cycles>\n");
-        exit(1);
-    }
-
-    srand(time(NULL));
-    char *filename = argv[1];
-    cycles = atoi(argv[2]);
-    fd = open(filename,O_RDWR);
-    if (fd == -1) {
-        perror("open");
-        exit(1);
-    }
-    fstat(fd,&stat);
-
-    while(cycles--) {
-        unsigned char buf[32];
-        unsigned long offset = rand()%stat.st_size;
-        int writelen = 1+rand()%31;
-        int j;
-
-        for (j = 0; j < writelen; j++) buf[j] = (char)rand();
-        lseek(fd,offset,SEEK_SET);
-        printf("Writing %d bytes at offset %lu\n", writelen, offset);
-        write(fd,buf,writelen);
-    }
-    return 0;
-}
diff --git a/redis-stable/utils/create-cluster/.gitignore b/redis-stable/utils/create-cluster/.gitignore
deleted file mode 100644
index 2988ee91..00000000
--- a/redis-stable/utils/create-cluster/.gitignore
+++ /dev/null
@@ -1,5 +0,0 @@
-config.sh
-*.rdb
-*.aof
-*.conf
-*.log
diff --git a/redis-stable/utils/create-cluster/README b/redis-stable/utils/create-cluster/README
deleted file mode 100644
index bcd74597..00000000
--- a/redis-stable/utils/create-cluster/README
+++ /dev/null
@@ -1,27 +0,0 @@
-create-cluster is a small script used to easily start a big number of Redis
-instances configured to run in cluster mode. Its main goal is to allow manual
-testing in a condition which is not easy to replicate with the Redis cluster
-unit tests, for example when a lot of instances are needed in order to trigger
-a given bug.
-
-The tool can also be used just to easily create a number of instances in a
-Redis Cluster in order to experiment a bit with the system.
-
-USAGE
----
-
-To create a cluster, follow these steps:
-
-1. Edit create-cluster and change the start / end port, depending on the
-number of instances you want to create.
-2. Use "./create-cluster start" in order to run the instances.
-3. Use "./create-cluster create" in order to execute redis-cli --cluster create, so that
-an actual Redis cluster will be created. (If you're accessing your setup via a local container, ensure that the CLUSTER_HOST value is changed to your local IP)
-4. Now you are ready to play with the cluster. AOF files and logs for each instances are created in the current directory.
-
-In order to stop a cluster:
-
-1. Use "./create-cluster stop" to stop all the instances. After you stopped the instances you can use "./create-cluster start" to restart them if you change your mind.
-2. Use "./create-cluster clean" to remove all the AOF / log files to restart with a clean environment.
-
-Use the command "./create-cluster help" to get the full list of features.
diff --git a/redis-stable/utils/create-cluster/create-cluster b/redis-stable/utils/create-cluster/create-cluster
deleted file mode 100755
index d9a3b8c3..00000000
--- a/redis-stable/utils/create-cluster/create-cluster
+++ /dev/null
@@ -1,118 +0,0 @@
-#!/bin/bash
-
-# Settings
-BIN_PATH="../../src/"
-CLUSTER_HOST=127.0.0.1
-PORT=30000
-TIMEOUT=2000
-NODES=6
-REPLICAS=1
-PROTECTED_MODE=yes
-ADDITIONAL_OPTIONS=""
-
-# You may want to put the above config parameters into config.sh in order to
-# override the defaults without modifying this script.
-
-if [ -a config.sh ]
-then
-    source "config.sh"
-fi
-
-# Computed vars
-ENDPORT=$((PORT+NODES))
-
-if [ "$1" == "start" ]
-then
-    while [ $((PORT < ENDPORT)) != "0" ]; do
-        PORT=$((PORT+1))
-        echo "Starting $PORT"
-        $BIN_PATH/redis-server --port $PORT  --protected-mode $PROTECTED_MODE --cluster-enabled yes --cluster-config-file nodes-${PORT}.conf --cluster-node-timeout $TIMEOUT --appendonly yes --appendfilename appendonly-${PORT}.aof --dbfilename dump-${PORT}.rdb --logfile ${PORT}.log --daemonize yes ${ADDITIONAL_OPTIONS}
-    done
-    exit 0
-fi
-
-if [ "$1" == "create" ]
-then
-    HOSTS=""
-    while [ $((PORT < ENDPORT)) != "0" ]; do
-        PORT=$((PORT+1))
-        HOSTS="$HOSTS $CLUSTER_HOST:$PORT"
-    done
-    OPT_ARG=""
-    if [ "$2" == "-f" ]; then
-        OPT_ARG="--cluster-yes"
-    fi
-    $BIN_PATH/redis-cli --cluster create $HOSTS --cluster-replicas $REPLICAS $OPT_ARG
-    exit 0
-fi
-
-if [ "$1" == "stop" ]
-then
-    while [ $((PORT < ENDPORT)) != "0" ]; do
-        PORT=$((PORT+1))
-        echo "Stopping $PORT"
-        $BIN_PATH/redis-cli -p $PORT shutdown nosave
-    done
-    exit 0
-fi
-
-if [ "$1" == "watch" ]
-then
-    PORT=$((PORT+1))
-    while [ 1 ]; do
-        clear
-        date
-        $BIN_PATH/redis-cli -p $PORT cluster nodes | head -30
-        sleep 1
-    done
-    exit 0
-fi
-
-if [ "$1" == "tail" ]
-then
-    INSTANCE=$2
-    PORT=$((PORT+INSTANCE))
-    tail -f ${PORT}.log
-    exit 0
-fi
-
-if [ "$1" == "tailall" ]
-then
-    tail -f *.log
-    exit 0
-fi
-
-if [ "$1" == "call" ]
-then
-    while [ $((PORT < ENDPORT)) != "0" ]; do
-        PORT=$((PORT+1))
-        $BIN_PATH/redis-cli -p $PORT $2 $3 $4 $5 $6 $7 $8 $9
-    done
-    exit 0
-fi
-
-if [ "$1" == "clean" ]
-then
-    rm -rf *.log
-    rm -rf appendonly*.aof
-    rm -rf dump*.rdb
-    rm -rf nodes*.conf
-    exit 0
-fi
-
-if [ "$1" == "clean-logs" ]
-then
-    rm -rf *.log
-    exit 0
-fi
-
-echo "Usage: $0 [start|create|stop|watch|tail|clean|call]"
-echo "start       -- Launch Redis Cluster instances."
-echo "create [-f] -- Create a cluster using redis-cli --cluster create."
-echo "stop        -- Stop Redis Cluster instances."
-echo "watch       -- Show CLUSTER NODES output (first 30 lines) of first node."
-echo "tail <id>   -- Run tail -f of instance at base port + ID."
-echo "tailall     -- Run tail -f for all the log files at once."
-echo "clean       -- Remove all instances data, logs, configs."
-echo "clean-logs  -- Remove just instances logs."
-echo "call <cmd>  -- Call a command (up to 7 arguments) on all nodes."
diff --git a/redis-stable/utils/gen-test-certs.sh b/redis-stable/utils/gen-test-certs.sh
deleted file mode 100755
index 60814483..00000000
--- a/redis-stable/utils/gen-test-certs.sh
+++ /dev/null
@@ -1,58 +0,0 @@
-#!/bin/bash
-
-# Generate some test certificates which are used by the regression test suite:
-#
-#   tests/tls/ca.{crt,key}          Self signed CA certificate.
-#   tests/tls/redis.{crt,key}       A certificate with no key usage/policy restrictions.
-#   tests/tls/client.{crt,key}      A certificate restricted for SSL client usage.
-#   tests/tls/server.{crt,key}      A certificate restricted fro SSL server usage.
-#   tests/tls/redis.dh              DH Params file.
-
-generate_cert() {
-    local name=$1
-    local cn="$2"
-    local opts="$3"
-
-    local keyfile=tests/tls/${name}.key
-    local certfile=tests/tls/${name}.crt
-
-    [ -f $keyfile ] || openssl genrsa -out $keyfile 2048
-    openssl req \
-        -new -sha256 \
-        -subj "/O=Redis Test/CN=$cn" \
-        -key $keyfile | \
-        openssl x509 \
-            -req -sha256 \
-            -CA tests/tls/ca.crt \
-            -CAkey tests/tls/ca.key \
-            -CAserial tests/tls/ca.txt \
-            -CAcreateserial \
-            -days 365 \
-            $opts \
-            -out $certfile
-}
-
-mkdir -p tests/tls
-[ -f tests/tls/ca.key ] || openssl genrsa -out tests/tls/ca.key 4096
-openssl req \
-    -x509 -new -nodes -sha256 \
-    -key tests/tls/ca.key \
-    -days 3650 \
-    -subj '/O=Redis Test/CN=Certificate Authority' \
-    -out tests/tls/ca.crt
-
-cat > tests/tls/openssl.cnf <<_END_
-[ server_cert ]
-keyUsage = digitalSignature, keyEncipherment
-nsCertType = server
-
-[ client_cert ]
-keyUsage = digitalSignature, keyEncipherment
-nsCertType = client
-_END_
-
-generate_cert server "Server-only" "-extfile tests/tls/openssl.cnf -extensions server_cert"
-generate_cert client "Client-only" "-extfile tests/tls/openssl.cnf -extensions client_cert"
-generate_cert redis "Generic-cert"
-
-[ -f tests/tls/redis.dh ] || openssl dhparam -out tests/tls/redis.dh 2048
diff --git a/redis-stable/utils/generate-command-help.rb b/redis-stable/utils/generate-command-help.rb
deleted file mode 100755
index 929761b2..00000000
--- a/redis-stable/utils/generate-command-help.rb
+++ /dev/null
@@ -1,123 +0,0 @@
-#!/usr/bin/env ruby
-
-GROUPS = [
-  "generic",
-  "string",
-  "list",
-  "set",
-  "sorted_set",
-  "hash",
-  "pubsub",
-  "transactions",
-  "connection",
-  "server",
-  "scripting",
-  "hyperloglog",
-  "cluster",
-  "geo",
-  "stream"
-].freeze
-
-GROUPS_BY_NAME = Hash[*
-  GROUPS.each_with_index.map do |n,i|
-    [n,i]
-  end.flatten
-].freeze
-
-def argument arg
-  if "block" == arg["type"]
-    name = arg["block"].map do |entry|
-      argument entry
-    end.join " "
-  else
-    name = arg["name"].is_a?(Array) ? arg["name"].join(" ") : arg["name"]
-    name = arg["enum"].join "|" if "enum" == arg["type"]
-    name = arg["command"] + (name ? " " + name : "") if arg["command"]
-  end
-  if arg["multiple"]
-    name = "#{name} [#{name} ...]"
-  end
-  if arg["optional"]
-    name = "[#{name}]"
-  end
-  name
-end
-
-def arguments command
-  return "-" unless command["arguments"]
-  command["arguments"].map do |arg|
-    argument arg
-  end.join " "
-end
-
-def commands
-  return @commands if @commands
-
-  require "rubygems"
-  require "net/http"
-  require "net/https"
-  require "json"
-  require "uri"
-
-  url = URI.parse "https://raw.githubusercontent.com/redis/redis-doc/master/commands.json"
-  client = Net::HTTP.new url.host, url.port
-  client.use_ssl = true
-  response = client.get url.path
-  if response.is_a?(Net::HTTPSuccess)
-    @commands = JSON.parse(response.body)
-  else
-    response.error!
-  end
-end
-
-def generate_groups
-  GROUPS.map do |n|
-    "\"#{n}\""
-  end.join(",\n    ");
-end
-
-def generate_commands
-  commands.to_a.sort do |x,y|
-    x[0] <=> y[0]
-  end.map do |key, command|
-    group = GROUPS_BY_NAME[command["group"]]
-    if group.nil?
-      STDERR.puts "Please update groups array in #{__FILE__}"
-      raise "Unknown group #{command["group"]}"
-    end
-
-    ret = <<-SPEC
-{ "#{key}",
-    "#{arguments(command)}",
-    "#{command["summary"]}",
-    #{group},
-    "#{command["since"]}" }
-    SPEC
-    ret.strip
-  end.join(",\n    ")
-end
-
-# Write to stdout
-puts <<-HELP_H
-/* Automatically generated by #{__FILE__}, do not edit. */
-
-#ifndef __REDIS_HELP_H
-#define __REDIS_HELP_H
-
-static char *commandGroups[] = {
-    #{generate_groups}
-};
-
-struct commandHelp {
-  char *name;
-  char *params;
-  char *summary;
-  int group;
-  char *since;
-} commandHelp[] = {
-    #{generate_commands}
-};
-
-#endif
-HELP_H
-
diff --git a/redis-stable/utils/graphs/commits-over-time/README.md b/redis-stable/utils/graphs/commits-over-time/README.md
deleted file mode 100644
index b28019ec..00000000
--- a/redis-stable/utils/graphs/commits-over-time/README.md
+++ /dev/null
@@ -1,16 +0,0 @@
-This Tcl script is what I used in order to generate the graph you
-can find at http://antirez.com/news/98. It's really quick & dirty, more
-a trow away program than anything else, but probably could be reused or
-modified in the future in order to visualize other similar data or an
-updated version of the same data.
-
-The usage is trivial:
-
-    ./genhtml.tcl > output.html
-
-The generated HTML is quite broken but good enough to grab a screenshot
-from the browser. Feel free to improve it if you got time / interest.
-
-Note that the code filtering the tags, and the hardcoded branch name, does
-not make the script, as it is, able to analyze a different repository.
-However the changes needed are trivial.
diff --git a/redis-stable/utils/graphs/commits-over-time/genhtml.tcl b/redis-stable/utils/graphs/commits-over-time/genhtml.tcl
deleted file mode 100755
index c4b4e098..00000000
--- a/redis-stable/utils/graphs/commits-over-time/genhtml.tcl
+++ /dev/null
@@ -1,96 +0,0 @@
-#!/usr/bin/env tclsh
-
-# Load commits history as "sha1 unixtime".
-set commits [exec git log unstable {--pretty="%H %at"}]
-set raw_tags [exec git tag]
-
-# Load all the tags that are about stable releases.
-foreach tag $raw_tags {
-    if {[string match v*-stable $tag]} {
-        set tag [string range $tag 1 end-7]
-        puts $tag
-    }
-    if {[regexp {^[0-9]+.[0-9]+.[0-9]+$} $tag]} {
-        lappend tags $tag
-    }
-}
-
-# For each tag, create a list of "name unixtime"
-foreach tag $tags {
-    set taginfo [exec git log $tag -n 1 "--pretty=\"$tag %at\""]
-    set taginfo [string trim $taginfo {"}]
-    lappend labels $taginfo
-}
-
-# For each commit, check the amount of code changed and create an array
-# mapping the commit to the number of lines affected.
-foreach c $commits {
-    set stat [exec git show --oneline --numstat [lindex $c 0]]
-    set linenum 0
-    set affected 0
-    foreach line [split $stat "\n"] {
-        incr linenum
-        if {$linenum == 1 || [string match *deps/* $line]} continue
-        if {[catch {llength $line} numfields]} continue
-        if {$numfields == 0} continue
-        catch {
-            incr affected [lindex $line 0]
-            incr affected [lindex $line 1]
-        }
-    }
-    set commit_to_affected([lindex $c 0]) $affected
-}
-
-set base_time [lindex [lindex $commits end] 1]
-puts [clock format $base_time]
-
-# Generate a graph made of HTML DIVs.
-puts {<html>
-<style>
-.box {
-    position:absolute;
-    width:10px;
-    height:5px;
-    border:1px black solid;
-    background-color:#44aa33;
-    opacity: 0.04;
-}
-.label {
-    position:absolute;
-    background-color:#dddddd;
-    font-family:helvetica;
-    font-size:12px;
-    padding:2px;
-    color:#666;
-    border:1px #aaa solid;
-    border-radius: 5px;
-}
-#outer {
-    position:relative;
-    width:1500;
-    height:500;
-    border:1px #aaa solid;
-}
-</style>
-<div id="outer">
-}
-foreach c $commits {
-    set sha [lindex $c 0]
-    set t [expr {([lindex $c 1]-$base_time)/(3600*24*2)}]
-    set affected [expr $commit_to_affected($sha)]
-    set left $t
-    set height [expr {log($affected)*20}]
-    puts "<div class=\"box\" style=\"left:$left; bottom:0; height:$height\"></div>"
-}
-
-set bottom -30
-foreach l $labels {
-    set name [lindex $l 0]
-    set t [expr {([lindex $l 1]-$base_time)/(3600*24*2)}]
-    set left $t
-    if {$left < 0} continue
-    incr bottom -20
-    if  {$bottom == -210} {set bottom -30}
-    puts "<div class=\"label\" style=\"left:$left; bottom:$bottom\">$name</div>"
-}
-puts {</div></html>}
diff --git a/redis-stable/utils/hashtable/README b/redis-stable/utils/hashtable/README
deleted file mode 100644
index 87ffc2f0..00000000
--- a/redis-stable/utils/hashtable/README
+++ /dev/null
@@ -1,13 +0,0 @@
-Hash table implementation related utilities.
-
-rehashing.c
----
-
-Visually show buckets in the two hash tables between rehashings. Also stress
-test getRandomKeys() implementation, that may actually disappear from
-Redis soon, However the visualization code is reusable in new bugs
-investigation.
-
-Compile with:
-
-    cc -I ../../src/ rehashing.c ../../src/zmalloc.c ../../src/dict.c -o rehashing_test
diff --git a/redis-stable/utils/hashtable/rehashing.c b/redis-stable/utils/hashtable/rehashing.c
deleted file mode 100644
index 3c0acb84..00000000
--- a/redis-stable/utils/hashtable/rehashing.c
+++ /dev/null
@@ -1,143 +0,0 @@
-#include "redis.h"
-#include "dict.h"
-
-void _redisAssert(char *x, char *y, int l) {
-    printf("ASSERT: %s %s %d\n",x,y,l);
-    exit(1);
-}
-
-unsigned int dictKeyHash(const void *keyp) {
-    unsigned long key = (unsigned long)keyp;
-    key = dictGenHashFunction(&key,sizeof(key));
-    key += ~(key << 15);
-    key ^=  (key >> 10);
-    key +=  (key << 3);
-    key ^=  (key >> 6);
-    key += ~(key << 11);
-    key ^=  (key >> 16);
-    return key;
-}
-
-int dictKeyCompare(void *privdata, const void *key1, const void *key2) {
-    unsigned long k1 = (unsigned long)key1;
-    unsigned long k2 = (unsigned long)key2;
-    return k1 == k2;
-}
-
-dictType dictTypeTest = {
-    dictKeyHash,                   /* hash function */
-    NULL,                          /* key dup */
-    NULL,                          /* val dup */
-    dictKeyCompare,                /* key compare */
-    NULL,                          /* key destructor */
-    NULL,                          /* val destructor */
-    NULL                           /* allow to expand */
-};
-
-void showBuckets(dictht ht) {
-    if (ht.table == NULL) {
-        printf("NULL\n");
-    } else {
-        int j;
-        for (j = 0; j < ht.size; j++) {
-            printf("%c", ht.table[j] ? '1' : '0');
-        }
-        printf("\n");
-    }
-}
-
-void show(dict *d) {
-    int j;
-    if (d->rehashidx != -1) {
-        printf("rhidx: ");
-        for (j = 0; j < d->rehashidx; j++)
-            printf(".");
-        printf("|\n");
-    }
-    printf("ht[0]: ");
-    showBuckets(d->ht[0]);
-    printf("ht[1]: ");
-    showBuckets(d->ht[1]);
-    printf("\n");
-}
-
-int sortPointers(const void *a, const void *b) {
-    unsigned long la, lb;
-
-    la = (long) (*((dictEntry**)a));
-    lb = (long) (*((dictEntry**)b));
-    return la-lb;
-}
-
-void stressGetKeys(dict *d, int times, int *perfect_run, int *approx_run) {
-    int j;
-
-    dictEntry **des = zmalloc(sizeof(dictEntry*)*dictSize(d));
-    for (j = 0; j < times; j++) {
-        int requested = rand() % (dictSize(d)+1);
-        int returned = dictGetSomeKeys(d, des, requested);
-        int dup = 0;
-
-        qsort(des,returned,sizeof(dictEntry*),sortPointers);
-        if (returned > 1) {
-            int i;
-            for (i = 0; i < returned-1; i++) {
-                if (des[i] == des[i+1]) dup++;
-            }
-        }
-
-        if (requested == returned && dup == 0) {
-            (*perfect_run)++;
-        } else {
-            (*approx_run)++;
-            printf("Requested, returned, duplicated: %d %d %d\n",
-                requested, returned, dup);
-        }
-    }
-    zfree(des);
-}
-
-#define MAX1 120
-#define MAX2 1000
-int main(void) {
-    dict *d = dictCreate(&dictTypeTest,NULL);
-    unsigned long i;
-    srand(time(NULL));
-
-    for (i = 0; i < MAX1; i++) {
-        dictAdd(d,(void*)i,NULL);
-        show(d);
-    }
-    printf("Size: %d\n", (int)dictSize(d));
-
-    for (i = 0; i < MAX1; i++) {
-        dictDelete(d,(void*)i);
-        dictResize(d);
-        show(d);
-    }
-    dictRelease(d);
-
-    d = dictCreate(&dictTypeTest,NULL);
-
-    printf("Stress testing dictGetSomeKeys\n");
-    int perfect_run = 0, approx_run = 0;
-
-    for (i = 0; i < MAX2; i++) {
-        dictAdd(d,(void*)i,NULL);
-        stressGetKeys(d,100,&perfect_run,&approx_run);
-    }
-
-    for (i = 0; i < MAX2; i++) {
-        dictDelete(d,(void*)i);
-        dictResize(d);
-        stressGetKeys(d,100,&perfect_run,&approx_run);
-    }
-
-    printf("dictGetSomeKey, %d perfect runs, %d approximated runs\n",
-        perfect_run, approx_run);
-
-    dictRelease(d);
-
-    printf("TEST PASSED!\n");
-    return 0;
-}
diff --git a/redis-stable/utils/hyperloglog/.gitignore b/redis-stable/utils/hyperloglog/.gitignore
deleted file mode 100644
index 2211df63..00000000
--- a/redis-stable/utils/hyperloglog/.gitignore
+++ /dev/null
@@ -1 +0,0 @@
-*.txt
diff --git a/redis-stable/utils/hyperloglog/hll-err.rb b/redis-stable/utils/hyperloglog/hll-err.rb
deleted file mode 100644
index 2c71ac5e..00000000
--- a/redis-stable/utils/hyperloglog/hll-err.rb
+++ /dev/null
@@ -1,27 +0,0 @@
-# hll-err.rb - Copyright (C) 2014 Salvatore Sanfilippo
-# BSD license, See the COPYING file for more information.
-#
-# Check error of HyperLogLog Redis implementation for different set sizes.
-
-require 'rubygems'
-require 'redis'
-require 'digest/sha1'
-
-r = Redis.new
-r.del('hll')
-i = 0
-while true do
-    100.times {
-        elements = []
-        1000.times {
-            ele = Digest::SHA1.hexdigest(i.to_s)
-            elements << ele
-            i += 1
-        }
-        r.pfadd('hll',elements)
-    }
-    approx = r.pfcount('hll')
-    abs_err = (approx-i).abs
-    rel_err = 100.to_f*abs_err/i
-    puts "#{i} vs #{approx}: #{rel_err}%"
-end
diff --git a/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb b/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
deleted file mode 100644
index 6c7596d1..00000000
--- a/redis-stable/utils/hyperloglog/hll-gnuplot-graph.rb
+++ /dev/null
@@ -1,88 +0,0 @@
-# hll-err.rb - Copyright (C) 2014 Salvatore Sanfilippo
-# BSD license, See the COPYING file for more information.
-#
-# This program is suited to output average and maximum errors of
-# the Redis HyperLogLog implementation in a format suitable to print
-# graphs using gnuplot.
-
-require 'rubygems'
-require 'redis'
-require 'digest/sha1'
-
-# Generate an array of [cardinality,relative_error] pairs
-# in the 0 - max range, with the specified step.
-#
-# 'r' is the Redis object used to perform the queries.
-# 'seed' must be different every time you want a test performed
-# with a different set. The function guarantees that if 'seed' is the
-# same, exactly the same dataset is used, and when it is different,
-# a totally unrelated different data set is used (without any common
-# element in practice).
-def run_experiment(r,seed,max,step)
-    r.del('hll')
-    i = 0
-    samples = []
-    step = 1000 if step > 1000
-    while i < max do
-        elements = []
-        step.times {
-            ele = Digest::SHA1.hexdigest(i.to_s+seed.to_s)
-            elements << ele
-            i += 1
-        }
-        r.pfadd('hll',elements)
-        approx = r.pfcount('hll')
-        err = approx-i
-        rel_err = 100.to_f*err/i
-        samples << [i,rel_err]
-    end
-    samples
-end
-
-def filter_samples(numsets,max,step,filter)
-    r = Redis.new
-    dataset = {}
-    (0...numsets).each{|i|
-        dataset[i] = run_experiment(r,i,max,step)
-        STDERR.puts "Set #{i}"
-    }
-    dataset[0].each_with_index{|ele,index|
-        if filter == :max
-            card=ele[0]
-            err=ele[1].abs
-            (1...numsets).each{|i|
-                err = dataset[i][index][1] if err < dataset[i][index][1]
-            }
-            puts "#{card} #{err}"
-        elsif filter == :avg
-            card=ele[0]
-            err = 0
-            (0...numsets).each{|i|
-                err += dataset[i][index][1]
-            }
-            err /= numsets
-            puts "#{card} #{err}"
-        elsif filter == :absavg
-            card=ele[0]
-            err = 0
-            (0...numsets).each{|i|
-                err += dataset[i][index][1].abs
-            }
-            err /= numsets
-            puts "#{card} #{err}"
-        elsif filter == :all
-            (0...numsets).each{|i|
-                card,err = dataset[i][index]
-                puts "#{card} #{err}"
-            }
-        else
-            raise "Unknown filter #{filter}"
-        end
-    }
-end
-
-if ARGV.length != 4
-    puts "Usage: hll-gnuplot-graph <samples> <max> <step> (max|avg|absavg|all)"
-    exit 1
-end
-filter_samples(ARGV[0].to_i,ARGV[1].to_i,ARGV[2].to_i,ARGV[3].to_sym)
diff --git a/redis-stable/utils/install_server.sh b/redis-stable/utils/install_server.sh
deleted file mode 100755
index efda7da1..00000000
--- a/redis-stable/utils/install_server.sh
+++ /dev/null
@@ -1,291 +0,0 @@
-#!/bin/sh
-
-# Copyright 2011 Dvir Volk <dvirsk at gmail dot com>. All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions are met:
-#
-#   1. Redistributions of source code must retain the above copyright notice,
-#   this list of conditions and the following disclaimer.
-#
-#   2. Redistributions in binary form must reproduce the above copyright
-#   notice, this list of conditions and the following disclaimer in the
-#   documentation and/or other materials provided with the distribution.
-#
-# THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
-# WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
-# EVENT SHALL Dvir Volk OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
-# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
-# OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-# LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
-# EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-#
-################################################################################
-#
-# Service installer for redis server, runs interactively by default.
-#
-# To run this script non-interactively (for automation/provisioning purposes),
-# feed the variables into the script. Any missing variables will be prompted!
-# Tip: Environment variables also support command substitution (see REDIS_EXECUTABLE)
-#
-# Example:
-#
-# sudo REDIS_PORT=1234 \
-# 		 REDIS_CONFIG_FILE=/etc/redis/1234.conf \
-# 		 REDIS_LOG_FILE=/var/log/redis_1234.log \
-# 		 REDIS_DATA_DIR=/var/lib/redis/1234 \
-# 		 REDIS_EXECUTABLE=`command -v redis-server` ./utils/install_server.sh
-#
-# This generates a redis config file and an /etc/init.d script, and installs them.
-#
-# /!\ This script should be run as root
-#
-# NOTE: This script will not work on Mac OSX.
-#       It supports Debian and Ubuntu Linux.
-#
-################################################################################
-
-die () {
-	echo "ERROR: $1. Aborting!"
-	exit 1
-}
-
-
-#Absolute path to this script
-SCRIPT=$(readlink -f $0)
-#Absolute path this script is in
-SCRIPTPATH=$(dirname $SCRIPT)
-
-#Initial defaults
-_REDIS_PORT=6379
-_MANUAL_EXECUTION=false
-
-echo "Welcome to the redis service installer"
-echo "This script will help you easily set up a running redis server"
-echo
-
-#check for root user
-if [ "$(id -u)" -ne 0 ] ; then
-	echo "You must run this script as root. Sorry!"
-	exit 1
-fi
-
-#bail if this system is managed by systemd
-_pid_1_exe="$(readlink -f /proc/1/exe)"
-if [ "${_pid_1_exe##*/}" = systemd ]
-then
-	echo "This systems seems to use systemd."
-	echo "Please take a look at the provided example service unit files in this directory, and adapt and install them. Sorry!"
-	exit 1
-fi
-unset _pid_1_exe
-
-if ! echo $REDIS_PORT | egrep -q '^[0-9]+$' ; then
-	_MANUAL_EXECUTION=true
-	#Read the redis port
-	read  -p "Please select the redis port for this instance: [$_REDIS_PORT] " REDIS_PORT
-	if ! echo $REDIS_PORT | egrep -q '^[0-9]+$' ; then
-		echo "Selecting default: $_REDIS_PORT"
-		REDIS_PORT=$_REDIS_PORT
-	fi
-fi
-
-if [ -z "$REDIS_CONFIG_FILE" ] ; then
-	_MANUAL_EXECUTION=true
-	#read the redis config file
-	_REDIS_CONFIG_FILE="/etc/redis/$REDIS_PORT.conf"
-	read -p "Please select the redis config file name [$_REDIS_CONFIG_FILE] " REDIS_CONFIG_FILE
-	if [ -z "$REDIS_CONFIG_FILE" ] ; then
-		REDIS_CONFIG_FILE=$_REDIS_CONFIG_FILE
-		echo "Selected default - $REDIS_CONFIG_FILE"
-	fi
-fi
-
-if [ -z "$REDIS_LOG_FILE" ] ; then
-	_MANUAL_EXECUTION=true
-	#read the redis log file path
-	_REDIS_LOG_FILE="/var/log/redis_$REDIS_PORT.log"
-	read -p "Please select the redis log file name [$_REDIS_LOG_FILE] " REDIS_LOG_FILE
-	if [ -z "$REDIS_LOG_FILE" ] ; then
-		REDIS_LOG_FILE=$_REDIS_LOG_FILE
-		echo "Selected default - $REDIS_LOG_FILE"
-	fi
-fi
-
-if [ -z "$REDIS_DATA_DIR" ] ; then
-	_MANUAL_EXECUTION=true
-	#get the redis data directory
-	_REDIS_DATA_DIR="/var/lib/redis/$REDIS_PORT"
-	read -p "Please select the data directory for this instance [$_REDIS_DATA_DIR] " REDIS_DATA_DIR
-	if [ -z "$REDIS_DATA_DIR" ] ; then
-		REDIS_DATA_DIR=$_REDIS_DATA_DIR
-		echo "Selected default - $REDIS_DATA_DIR"
-	fi
-fi
-
-if [ ! -x "$REDIS_EXECUTABLE" ] ; then
-	_MANUAL_EXECUTION=true
-	#get the redis executable path
-	_REDIS_EXECUTABLE=`command -v redis-server`
-	read -p "Please select the redis executable path [$_REDIS_EXECUTABLE] " REDIS_EXECUTABLE
-	if [ ! -x "$REDIS_EXECUTABLE" ] ; then
-		REDIS_EXECUTABLE=$_REDIS_EXECUTABLE
-
-		if [ ! -x "$REDIS_EXECUTABLE" ] ; then
-			echo "Mmmmm...  it seems like you don't have a redis executable. Did you run make install yet?"
-			exit 1
-		fi
-	fi
-fi
-
-#check the default for redis cli
-CLI_EXEC=`command -v redis-cli`
-if [ -z "$CLI_EXEC" ] ; then
-	CLI_EXEC=`dirname $REDIS_EXECUTABLE`"/redis-cli"
-fi
-
-echo "Selected config:"
-
-echo "Port           : $REDIS_PORT"
-echo "Config file    : $REDIS_CONFIG_FILE"
-echo "Log file       : $REDIS_LOG_FILE"
-echo "Data dir       : $REDIS_DATA_DIR"
-echo "Executable     : $REDIS_EXECUTABLE"
-echo "Cli Executable : $CLI_EXEC"
-
-if $_MANUAL_EXECUTION == true ; then
-	read -p "Is this ok? Then press ENTER to go on or Ctrl-C to abort." _UNUSED_
-fi
-
-mkdir -p `dirname "$REDIS_CONFIG_FILE"` || die "Could not create redis config directory"
-mkdir -p `dirname "$REDIS_LOG_FILE"` || die "Could not create redis log dir"
-mkdir -p "$REDIS_DATA_DIR" || die "Could not create redis data directory"
-
-#render the templates
-TMP_FILE="/tmp/${REDIS_PORT}.conf"
-DEFAULT_CONFIG="${SCRIPTPATH}/../redis.conf"
-INIT_TPL_FILE="${SCRIPTPATH}/redis_init_script.tpl"
-INIT_SCRIPT_DEST="/etc/init.d/redis_${REDIS_PORT}"
-PIDFILE="/var/run/redis_${REDIS_PORT}.pid"
-
-if [ ! -f "$DEFAULT_CONFIG" ]; then
-	echo "Mmmmm... the default config is missing. Did you switch to the utils directory?"
-	exit 1
-fi
-
-#Generate config file from the default config file as template
-#changing only the stuff we're controlling from this script
-echo "## Generated by install_server.sh ##" > $TMP_FILE
-
-read -r SED_EXPR <<-EOF
-s#^port .\+#port ${REDIS_PORT}#; \
-s#^logfile .\+#logfile ${REDIS_LOG_FILE}#; \
-s#^dir .\+#dir ${REDIS_DATA_DIR}#; \
-s#^pidfile .\+#pidfile ${PIDFILE}#; \
-s#^daemonize no#daemonize yes#;
-EOF
-sed "$SED_EXPR" $DEFAULT_CONFIG >> $TMP_FILE
-
-#cat $TPL_FILE | while read line; do eval "echo \"$line\"" >> $TMP_FILE; done
-cp $TMP_FILE $REDIS_CONFIG_FILE || die "Could not write redis config file $REDIS_CONFIG_FILE"
-
-#Generate sample script from template file
-rm -f $TMP_FILE
-
-#we hard code the configs here to avoid issues with templates containing env vars
-#kinda lame but works!
-REDIS_INIT_HEADER=\
-"#!/bin/sh\n
-#Configurations injected by install_server below....\n\n
-EXEC=$REDIS_EXECUTABLE\n
-CLIEXEC=$CLI_EXEC\n
-PIDFILE=\"$PIDFILE\"\n
-CONF=\"$REDIS_CONFIG_FILE\"\n\n
-REDISPORT=\"$REDIS_PORT\"\n\n
-###############\n\n"
-
-REDIS_CHKCONFIG_INFO=\
-"# REDHAT chkconfig header\n\n
-# chkconfig: - 58 74\n
-# description: redis_${REDIS_PORT} is the redis daemon.\n
-### BEGIN INIT INFO\n
-# Provides: redis_6379\n
-# Required-Start: \$network \$local_fs \$remote_fs\n
-# Required-Stop: \$network \$local_fs \$remote_fs\n
-# Default-Start: 2 3 4 5\n
-# Default-Stop: 0 1 6\n
-# Should-Start: \$syslog \$named\n
-# Should-Stop: \$syslog \$named\n
-# Short-Description: start and stop redis_${REDIS_PORT}\n
-# Description: Redis daemon\n
-### END INIT INFO\n\n"
-
-if command -v chkconfig >/dev/null; then
-	#if we're a box with chkconfig on it we want to include info for chkconfig
-	echo "$REDIS_INIT_HEADER" "$REDIS_CHKCONFIG_INFO" > $TMP_FILE && cat $INIT_TPL_FILE >> $TMP_FILE || die "Could not write init script to $TMP_FILE"
-else
-	#combine the header and the template (which is actually a static footer)
-	echo "$REDIS_INIT_HEADER" > $TMP_FILE && cat $INIT_TPL_FILE >> $TMP_FILE || die "Could not write init script to $TMP_FILE"
-fi
-
-###
-# Generate sample script from template file
-# - No need to check which system we are on. The init info are comments and
-#   do not interfere with update_rc.d systems. Additionally:
-#     Ubuntu/debian by default does not come with chkconfig, but does issue a
-#     warning if init info is not available.
-
-cat > ${TMP_FILE} <<EOT
-#!/bin/sh
-#Configurations injected by install_server below....
-
-EXEC=$REDIS_EXECUTABLE
-CLIEXEC=$CLI_EXEC
-PIDFILE=$PIDFILE
-CONF="$REDIS_CONFIG_FILE"
-REDISPORT="$REDIS_PORT"
-###############
-# SysV Init Information
-# chkconfig: - 58 74
-# description: redis_${REDIS_PORT} is the redis daemon.
-### BEGIN INIT INFO
-# Provides: redis_${REDIS_PORT}
-# Required-Start: \$network \$local_fs \$remote_fs
-# Required-Stop: \$network \$local_fs \$remote_fs
-# Default-Start: 2 3 4 5
-# Default-Stop: 0 1 6
-# Should-Start: \$syslog \$named
-# Should-Stop: \$syslog \$named
-# Short-Description: start and stop redis_${REDIS_PORT}
-# Description: Redis daemon
-### END INIT INFO
-
-EOT
-cat ${INIT_TPL_FILE} >> ${TMP_FILE}
-
-#copy to /etc/init.d
-cp $TMP_FILE $INIT_SCRIPT_DEST && \
-	chmod +x $INIT_SCRIPT_DEST || die "Could not copy redis init script to  $INIT_SCRIPT_DEST"
-echo "Copied $TMP_FILE => $INIT_SCRIPT_DEST"
-
-#Install the service
-echo "Installing service..."
-if command -v chkconfig >/dev/null 2>&1; then
-	# we're chkconfig, so lets add to chkconfig and put in runlevel 345
-	chkconfig --add redis_${REDIS_PORT} && echo "Successfully added to chkconfig!"
-	chkconfig --level 345 redis_${REDIS_PORT} on && echo "Successfully added to runlevels 345!"
-elif command -v update-rc.d >/dev/null 2>&1; then
-	#if we're not a chkconfig box assume we're able to use update-rc.d
-	update-rc.d redis_${REDIS_PORT} defaults && echo "Success!"
-else
-	echo "No supported init tool found."
-fi
-
-/etc/init.d/redis_$REDIS_PORT start || die "Failed starting service..."
-
-#tada
-echo "Installation successful!"
-exit 0
diff --git a/redis-stable/utils/lru/README b/redis-stable/utils/lru/README
deleted file mode 100644
index f043b297..00000000
--- a/redis-stable/utils/lru/README
+++ /dev/null
@@ -1,19 +0,0 @@
-The test-lru.rb program can be used in order to check the behavior of the
-Redis approximated LRU algorithm against the theoretical output of true
-LRU algorithm.
-
-In order to use the program you need to recompile Redis setting the define
-REDIS_LRU_CLOCK_RESOLUTION to 1, by editing the file server.h.
-This allows to execute the program in a fast way since the 1 ms resolution
-is enough for all the objects to have a different enough time stamp during
-the test.
-
-The program is executed like this:
-
-    ruby test-lru.rb /tmp/lru.html
-
-You can optionally specify a number of times to run, so that the program
-will output averages of different runs, by adding an additional argument.
-For instance in order to run the test 10 times use:
-
-    ruby test-lru.rb /tmp/lru.html 10
diff --git a/redis-stable/utils/lru/lfu-simulation.c b/redis-stable/utils/lru/lfu-simulation.c
deleted file mode 100644
index 6aa5911a..00000000
--- a/redis-stable/utils/lru/lfu-simulation.c
+++ /dev/null
@@ -1,158 +0,0 @@
-#include <stdio.h>
-#include <time.h>
-#include <stdint.h>
-#include <stdlib.h>
-
-int decr_every = 1;
-int keyspace_size = 1000000;
-time_t switch_after = 30; /* Switch access pattern after N seconds. */
-
-struct entry {
-    /* Field that the LFU Redis implementation will have (we have
-     * 24 bits of total space in the object->lru field). */
-    uint8_t counter;    /* Logarithmic counter. */
-    uint16_t decrtime;  /* (Reduced precision) time of last decrement. */
-
-    /* Fields only useful for visualization. */
-    uint64_t hits;      /* Number of real accesses. */
-    time_t ctime;       /* Key creation time. */
-};
-
-#define to_16bit_minutes(x) ((x/60) & 65535)
-#define COUNTER_INIT_VAL 5
-
-/* Compute the difference in minutes between two 16 bit minutes times
- * obtained with to_16bit_minutes(). Since they can wrap around if
- * we detect the overflow we account for it as if the counter wrapped
- * a single time. */
-uint16_t minutes_diff(uint16_t now, uint16_t prev) {
-    if (now >= prev) return now-prev;
-    return 65535-prev+now;
-}
-
-/* Increment a couter logaritmically: the greatest is its value, the
- * less likely is that the counter is really incremented.
- * The maximum value of the counter is saturated at 255. */
-uint8_t log_incr(uint8_t counter) {
-    if (counter == 255) return counter;
-    double r = (double)rand()/RAND_MAX;
-    double baseval = counter-COUNTER_INIT_VAL;
-    if (baseval < 0) baseval = 0;
-    double limit = 1.0/(baseval*10+1);
-    if (r < limit) counter++;
-    return counter;
-}
-
-/* Simulate an access to an entry. */
-void access_entry(struct entry *e) {
-    e->counter = log_incr(e->counter);
-    e->hits++;
-}
-
-/* Return the entry LFU value and as a side effect decrement the
- * entry value if the decrement time was reached. */
-uint8_t scan_entry(struct entry *e) {
-    if (minutes_diff(to_16bit_minutes(time(NULL)),e->decrtime)
-        >= decr_every)
-    {
-        if (e->counter) {
-            if (e->counter > COUNTER_INIT_VAL*2) {
-                e->counter /= 2;
-            } else {
-                e->counter--;
-            }
-        }
-        e->decrtime = to_16bit_minutes(time(NULL));
-    }
-    return e->counter;
-}
-
-/* Print the entry info. */
-void show_entry(long pos, struct entry *e) {
-    char *tag = "normal       ";
-
-    if (pos >= 10 && pos <= 14) tag = "new no access";
-    if (pos >= 15 && pos <= 19) tag = "new accessed ";
-    if (pos >= keyspace_size -5) tag= "old no access";
-
-    printf("%ld] <%s> frequency:%d decrtime:%d [%lu hits | age:%ld sec]\n",
-        pos, tag, e->counter, e->decrtime, (unsigned long)e->hits,
-            time(NULL) - e->ctime);
-}
-
-int main(void) {
-    time_t start = time(NULL);
-    time_t new_entry_time = start;
-    time_t display_time = start;
-    struct entry *entries = malloc(sizeof(*entries)*keyspace_size);
-    long j;
-
-    /* Initialize. */
-    for (j = 0; j < keyspace_size; j++) {
-        entries[j].counter = COUNTER_INIT_VAL;
-        entries[j].decrtime = to_16bit_minutes(start);
-        entries[j].hits = 0;
-        entries[j].ctime = time(NULL);
-    }
-
-    while(1) {
-        time_t now = time(NULL);
-        long idx;
-
-        /* Scan N random entries (simulates the eviction under maxmemory). */
-        for (j = 0; j < 3; j++) {
-            scan_entry(entries+(rand()%keyspace_size));
-        }
-
-        /* Access a random entry: use a power-law access pattern up to
-         * 'switch_after' seconds. Then revert to flat access pattern. */
-        if (now-start < switch_after) {
-            /* Power law. */
-            idx = 1;
-            while((rand() % 21) != 0 && idx < keyspace_size) idx *= 2;
-            if (idx > keyspace_size) idx = keyspace_size;
-            idx = rand() % idx;
-        } else {
-            /* Flat. */
-            idx = rand() % keyspace_size;
-        }
-
-        /* Never access entries between position 10 and 14, so that
-         * we simulate what happens to new entries that are never
-         * accessed VS new entries which are accessed in positions
-         * 15-19.
-         *
-         * Also never access last 5 entry, so that we have keys which
-         * are never recreated (old), and never accessed. */
-        if ((idx < 10 || idx > 14) && (idx < keyspace_size-5))
-            access_entry(entries+idx);
-
-        /* Simulate the addition of new entries at positions between
-         * 10 and 19, a random one every 10 seconds. */
-        if (new_entry_time <= now) {
-            idx = 10+(rand()%10);
-            entries[idx].counter = COUNTER_INIT_VAL;
-            entries[idx].decrtime = to_16bit_minutes(time(NULL));
-            entries[idx].hits = 0;
-            entries[idx].ctime = time(NULL);
-            new_entry_time = now+10;
-        }
-
-        /* Show the first 20 entries and the last 20 entries. */
-        if (display_time != now) {
-            printf("=============================\n");
-            printf("Current minutes time: %d\n", (int)to_16bit_minutes(now));
-            printf("Access method: %s\n",
-                (now-start < switch_after) ? "power-law" : "flat");
-
-            for (j = 0; j < 20; j++)
-                show_entry(j,entries+j);
-
-            for (j = keyspace_size-20; j < keyspace_size; j++)
-                show_entry(j,entries+j);
-            display_time = now;
-        }
-    }
-    return 0;
-}
-
diff --git a/redis-stable/utils/lru/test-lru.rb b/redis-stable/utils/lru/test-lru.rb
deleted file mode 100644
index d511e206..00000000
--- a/redis-stable/utils/lru/test-lru.rb
+++ /dev/null
@@ -1,223 +0,0 @@
-require 'rubygems'
-require 'redis'
-
-$runs = []; # Remember the error rate of each run for average purposes.
-$o = {};    # Options set parsing arguments
-
-def testit(filename)
-    r = Redis.new
-    r.config("SET","maxmemory","2000000")
-    if $o[:ttl]
-        r.config("SET","maxmemory-policy","volatile-ttl")
-    else
-        r.config("SET","maxmemory-policy","allkeys-lru")
-    end
-    r.config("SET","maxmemory-samples",5)
-    r.config("RESETSTAT")
-    r.flushall
-
-    html = ""
-    html << <<EOF
-    <html>
-    <body>
-    <style>
-    .box {
-        width:5px;
-        height:5px;
-        float:left;
-        margin: 1px;
-    }
-
-    .old {
-        border: 1px black solid;
-    }
-
-    .new {
-        border: 1px green solid;
-    }
-
-    .otherdb {
-        border: 1px red solid;
-    }
-
-    .ex {
-        background-color: #666;
-    }
-    </style>
-    <pre>
-EOF
-
-    # Fill the DB up to the first eviction.
-    oldsize = r.dbsize
-    id = 0
-    while true
-        id += 1
-        begin
-            r.set(id,"foo")
-        rescue
-            break
-        end
-        newsize = r.dbsize
-        break if newsize == oldsize # A key was evicted? Stop.
-        oldsize = newsize
-    end
-
-    inserted = r.dbsize
-    first_set_max_id = id
-    html << "#{r.dbsize} keys inserted.\n"
-
-    # Access keys sequentially, so that in theory the first part will be expired
-    # and the latter part will not, according to perfect LRU.
-
-    if $o[:ttl]
-        STDERR.puts "Set increasing expire value"
-        (1..first_set_max_id).each{|id|
-            r.expire(id,1000+id)
-            STDERR.print(".") if (id % 150) == 0
-        }
-    else
-        STDERR.puts "Access keys sequentially"
-        (1..first_set_max_id).each{|id|
-            r.get(id)
-            sleep 0.001
-            STDERR.print(".") if (id % 150) == 0
-        }
-    end
-    STDERR.puts
-
-    # Insert more 50% keys. We expect that the new keys will rarely be expired
-    # since their last access time is recent compared to the others.
-    #
-    # Note that we insert the first 100 keys of the new set into DB1 instead
-    # of DB0, so that we can try how cross-DB eviction works.
-    half = inserted/2
-    html << "Insert enough keys to evict half the keys we inserted.\n"
-    add = 0
-
-    otherdb_start_idx = id+1
-    otherdb_end_idx = id+100
-    while true
-        add += 1
-        id += 1
-        if id >= otherdb_start_idx && id <= otherdb_end_idx
-            r.select(1)
-            r.set(id,"foo")
-            r.select(0)
-        else
-            r.set(id,"foo")
-        end
-        break if r.info['evicted_keys'].to_i >= half
-    end
-
-    html << "#{add} additional keys added.\n"
-    html << "#{r.dbsize} keys in DB.\n"
-
-    # Check if evicted keys respect LRU
-    # We consider errors from 1 to N progressively more serious as they violate
-    # more the access pattern.
-
-    errors = 0
-    e = 1
-    error_per_key = 100000.0/first_set_max_id
-    half_set_size = first_set_max_id/2
-    maxerr = 0
-    (1..(first_set_max_id/2)).each{|id|
-        if id >= otherdb_start_idx && id <= otherdb_end_idx
-            r.select(1)
-            exists = r.exists(id)
-            r.select(0)
-        else
-            exists = r.exists(id)
-        end
-        if id < first_set_max_id/2
-            thiserr = error_per_key * ((half_set_size-id).to_f/half_set_size)
-            maxerr += thiserr
-            errors += thiserr if exists
-        elsif id >= first_set_max_id/2
-            thiserr = error_per_key * ((id-half_set_size).to_f/half_set_size)
-            maxerr += thiserr
-            errors += thiserr if !exists
-        end
-    }
-    errors = errors*100/maxerr
-
-    STDERR.puts "Test finished with #{errors}% error! Generating HTML on stdout."
-
-    html << "#{errors}% error!\n"
-    html << "</pre>"
-    $runs << errors
-
-    # Generate the graphical representation
-    (1..id).each{|id|
-        # Mark first set and added items in a different way.
-        c = "box"
-        if id >= otherdb_start_idx && id <= otherdb_end_idx
-            c << " otherdb"
-        elsif id <= first_set_max_id
-            c << " old"
-        else
-            c << " new"
-        end
-
-        # Add class if exists
-        if id >= otherdb_start_idx && id <= otherdb_end_idx
-            r.select(1)
-            exists = r.exists(id)
-            r.select(0)
-        else
-            exists = r.exists(id)
-        end
-
-        c << " ex" if exists
-        html << "<div title=\"#{id}\" class=\"#{c}\"></div>"
-    }
-
-    # Close HTML page
-
-    html << <<EOF
-    </body>
-    </html>
-EOF
-
-    f = File.open(filename,"w")
-    f.write(html)
-    f.close
-end
-
-def print_avg
-    avg = ($runs.reduce {|a,b| a+b}) / $runs.length
-    puts "#{$runs.length} runs, AVG is #{avg}"
-end
-
-if ARGV.length < 1
-    STDERR.puts "Usage: ruby test-lru.rb <html-output-filename> [--runs <count>] [--ttl]"
-    STDERR.puts "Options:"
-    STDERR.puts "  --runs <count>    Execute the test <count> times."
-    STDERR.puts "  --ttl             Set keys with increasing TTL values"
-    STDERR.puts "                    (starting from 1000 seconds) in order to"
-    STDERR.puts "                    test the volatile-lru policy."
-    exit 1
-end
-
-filename = ARGV[0]
-$o[:numruns] = 1
-
-# Options parsing
-i = 1
-while i < ARGV.length
-    if ARGV[i] == '--runs'
-        $o[:numruns] = ARGV[i+1].to_i
-        i+= 1
-    elsif ARGV[i] == '--ttl'
-        $o[:ttl] = true
-    else
-        STDERR.puts "Unknown option #{ARGV[i]}"
-        exit 1
-    end
-    i+= 1
-end
-
-$o[:numruns].times {
-    testit(filename)
-    print_avg if $o[:numruns] != 1
-}
diff --git a/redis-stable/utils/redis-copy.rb b/redis-stable/utils/redis-copy.rb
deleted file mode 100644
index 7c5c52dd..00000000
--- a/redis-stable/utils/redis-copy.rb
+++ /dev/null
@@ -1,35 +0,0 @@
-# redis-copy.rb - Copyright (C) 2009-2010 Salvatore Sanfilippo
-# BSD license, See the COPYING file for more information.
-#
-# Copy the whole dataset from one Redis instance to another one
-#
-# WARNING: this utility is deprecated and serves as a legacy adapter
-#          for the more-robust redis-copy gem.
-
-require 'shellwords'
-
-def redisCopy(opts={})
-  src = "#{opts[:srchost]}:#{opts[:srcport]}"
-  dst = "#{opts[:dsthost]}:#{opts[:dstport]}"
-  `redis-copy #{src.shellescape} #{dst.shellescape}`
-rescue Errno::ENOENT
-  $stderr.puts 'This utility requires the redis-copy executable',
-               'from the redis-copy gem on https://rubygems.org',
-               'To install it, run `gem install redis-copy`.'
-  exit 1
-end
-
-$stderr.puts "This utility is deprecated. Use the redis-copy gem instead."
-if ARGV.length != 4
-    puts "Usage: redis-copy.rb <srchost> <srcport> <dsthost> <dstport>"
-    exit 1
-end
-puts "WARNING: it's up to you to FLUSHDB the destination host before to continue, press any key when ready."
-STDIN.gets
-srchost = ARGV[0]
-srcport = ARGV[1]
-dsthost = ARGV[2]
-dstport = ARGV[3]
-puts "Copying #{srchost}:#{srcport} into #{dsthost}:#{dstport}"
-redisCopy(:srchost => srchost, :srcport => srcport.to_i,
-          :dsthost => dsthost, :dstport => dstport.to_i)
diff --git a/redis-stable/utils/redis-sha1.rb b/redis-stable/utils/redis-sha1.rb
deleted file mode 100644
index 24498e25..00000000
--- a/redis-stable/utils/redis-sha1.rb
+++ /dev/null
@@ -1,52 +0,0 @@
-# redis-sha1.rb - Copyright (C) 2009 Salvatore Sanfilippo
-# BSD license, See the COPYING file for more information.
-#
-# Performs the SHA1 sum of the whole datset.
-# This is useful to spot bugs in persistence related code and to make sure
-# Slaves and Masters are in SYNC.
-#
-# If you hack this code make sure to sort keys and set elements as this are
-# unsorted elements. Otherwise the sum may differ with equal dataset.
-
-require 'rubygems'
-require 'redis'
-require 'digest/sha1'
-
-def redisSha1(opts={})
-    sha1=""
-    r = Redis.new(opts)
-    r.keys('*').sort.each{|k|
-        vtype = r.type?(k)
-        if vtype == "string"
-            len = 1
-            sha1 = Digest::SHA1.hexdigest(sha1+k)
-            sha1 = Digest::SHA1.hexdigest(sha1+r.get(k))
-        elsif vtype == "list"
-            len = r.llen(k)
-            if len != 0
-                sha1 = Digest::SHA1.hexdigest(sha1+k)
-                sha1 = Digest::SHA1.hexdigest(sha1+r.list_range(k,0,-1).join("\x01"))
-            end
-        elsif vtype == "set"
-            len = r.scard(k)
-            if len != 0
-                sha1 = Digest::SHA1.hexdigest(sha1+k)
-                sha1 = Digest::SHA1.hexdigest(sha1+r.set_members(k).to_a.sort.join("\x02"))
-            end
-        elsif vtype == "zset"
-            len = r.zcard(k)
-            if len != 0
-                sha1 = Digest::SHA1.hexdigest(sha1+k)
-                sha1 = Digest::SHA1.hexdigest(sha1+r.zrange(k,0,-1).join("\x01"))
-            end
-        end
-        # puts "#{k} => #{sha1}" if len != 0
-    }
-    sha1
-end
-
-host = ARGV[0] || "127.0.0.1"
-port = ARGV[1] || "6379"
-db = ARGV[2] || "0"
-puts "Performing SHA1 of Redis server #{host} #{port} DB: #{db}"
-p "Dataset SHA1: #{redisSha1(:host => host, :port => port.to_i, :db => db)}"
diff --git a/redis-stable/utils/redis_init_script b/redis-stable/utils/redis_init_script
deleted file mode 100755
index 006db87e..00000000
--- a/redis-stable/utils/redis_init_script
+++ /dev/null
@@ -1,50 +0,0 @@
-#!/bin/sh
-#
-# Simple Redis init.d script conceived to work on Linux systems
-# as it does use of the /proc filesystem.
-
-### BEGIN INIT INFO
-# Provides:     redis_6379
-# Default-Start:        2 3 4 5
-# Default-Stop:         0 1 6
-# Short-Description:    Redis data structure server
-# Description:          Redis data structure server. See https://redis.io
-### END INIT INFO
-
-REDISPORT=6379
-EXEC=/usr/local/bin/redis-server
-CLIEXEC=/usr/local/bin/redis-cli
-
-PIDFILE=/var/run/redis_${REDISPORT}.pid
-CONF="/etc/redis/${REDISPORT}.conf"
-
-case "$1" in
-    start)
-        if [ -f $PIDFILE ]
-        then
-                echo "$PIDFILE exists, process is already running or crashed"
-        else
-                echo "Starting Redis server..."
-                $EXEC $CONF
-        fi
-        ;;
-    stop)
-        if [ ! -f $PIDFILE ]
-        then
-                echo "$PIDFILE does not exist, process is not running"
-        else
-                PID=$(cat $PIDFILE)
-                echo "Stopping ..."
-                $CLIEXEC -p $REDISPORT shutdown
-                while [ -x /proc/${PID} ]
-                do
-                    echo "Waiting for Redis to shutdown ..."
-                    sleep 1
-                done
-                echo "Redis stopped"
-        fi
-        ;;
-    *)
-        echo "Please use start or stop as first argument"
-        ;;
-esac
diff --git a/redis-stable/utils/redis_init_script.tpl b/redis-stable/utils/redis_init_script.tpl
deleted file mode 100755
index 2e5b6130..00000000
--- a/redis-stable/utils/redis_init_script.tpl
+++ /dev/null
@@ -1,44 +0,0 @@
-
-case "$1" in
-    start)
-        if [ -f $PIDFILE ]
-        then
-            echo "$PIDFILE exists, process is already running or crashed"
-        else
-            echo "Starting Redis server..."
-            $EXEC $CONF
-        fi
-        ;;
-    stop)
-        if [ ! -f $PIDFILE ]
-        then
-            echo "$PIDFILE does not exist, process is not running"
-        else
-            PID=$(cat $PIDFILE)
-            echo "Stopping ..."
-            $CLIEXEC -p $REDISPORT shutdown
-            while [ -x /proc/${PID} ]
-            do
-                echo "Waiting for Redis to shutdown ..."
-                sleep 1
-            done
-            echo "Redis stopped"
-        fi
-        ;;
-    status)
-        PID=$(cat $PIDFILE)
-        if [ ! -x /proc/${PID} ]
-        then
-            echo 'Redis is not running'
-        else
-            echo "Redis is running ($PID)"
-        fi
-        ;;
-    restart)
-        $0 stop
-        $0 start
-        ;;
-    *)
-        echo "Please use start, stop, restart or status as first argument"
-        ;;
-esac
diff --git a/redis-stable/utils/releasetools/01_create_tarball.sh b/redis-stable/utils/releasetools/01_create_tarball.sh
deleted file mode 100755
index 366a61e2..00000000
--- a/redis-stable/utils/releasetools/01_create_tarball.sh
+++ /dev/null
@@ -1,14 +0,0 @@
-#!/bin/sh
-if [ $# != "1" ]
-then
-    echo "Usage: ./utils/releasetools/01_create_tarball.sh <version_tag>"
-    exit 1
-fi
-
-TAG=$1
-TARNAME="redis-${TAG}.tar"
-echo "Generating /tmp/${TARNAME}"
-git archive $TAG --prefix redis-${TAG}/ > /tmp/$TARNAME || exit 1
-echo "Gizipping the archive"
-rm -f /tmp/$TARNAME.gz
-gzip -9 /tmp/$TARNAME
diff --git a/redis-stable/utils/releasetools/02_upload_tarball.sh b/redis-stable/utils/releasetools/02_upload_tarball.sh
deleted file mode 100755
index ef1e777c..00000000
--- a/redis-stable/utils/releasetools/02_upload_tarball.sh
+++ /dev/null
@@ -1,23 +0,0 @@
-#!/bin/bash
-if [ $# != "1" ]
-then
-    echo "Usage: ./utils/releasetools/02_upload_tarball.sh <version_tag>"
-    exit 1
-fi
-
-echo "Uploading..."
-scp /tmp/redis-${1}.tar.gz ubuntu@host.redis.io:/var/www/download/releases/
-echo "Updating web site... "
-echo "Please check the github action tests for the release."
-echo "Press any key if it is a stable release, or Ctrl+C to abort"
-read x
-ssh ubuntu@host.redis.io "cd /var/www/download;
-                          rm -rf redis-${1}.tar.gz;
-                          wget http://download.redis.io/releases/redis-${1}.tar.gz;
-                          tar xvzf redis-${1}.tar.gz;
-                          rm -rf redis-stable;
-                          mv redis-${1} redis-stable;
-                          tar cvzf redis-stable.tar.gz redis-stable;
-                          rm -rf redis-${1}.tar.gz;
-                          shasum -a 256 redis-stable.tar.gz > redis-stable.tar.gz.SHA256SUM;
-                          "
diff --git a/redis-stable/utils/releasetools/03_test_release.sh b/redis-stable/utils/releasetools/03_test_release.sh
deleted file mode 100755
index 493d0b74..00000000
--- a/redis-stable/utils/releasetools/03_test_release.sh
+++ /dev/null
@@ -1,28 +0,0 @@
-#!/bin/sh
-set -e
-if [ $# != "1" ]
-then
-    echo "Usage: ./utils/releasetools/03_test_release.sh <version_tag>"
-    exit 1
-fi
-
-TAG=$1
-TARNAME="redis-${TAG}.tar.gz"
-DOWNLOADURL="http://download.redis.io/releases/${TARNAME}"
-
-echo "Doing sanity test on the actual tarball"
-
-cd /tmp
-rm -rf test_release_tmp_dir
-mkdir test_release_tmp_dir
-cd test_release_tmp_dir
-rm -f $TARNAME
-rm -rf redis-${TAG}
-wget $DOWNLOADURL
-tar xvzf $TARNAME
-cd redis-${TAG}
-make
-./runtest
-./runtest-sentinel
-./runtest-cluster
-./runtest-moduleapi
diff --git a/redis-stable/utils/releasetools/04_release_hash.sh b/redis-stable/utils/releasetools/04_release_hash.sh
deleted file mode 100755
index d9329280..00000000
--- a/redis-stable/utils/releasetools/04_release_hash.sh
+++ /dev/null
@@ -1,13 +0,0 @@
-#!/bin/bash
-if [ $# != "1" ]
-then
-    echo "Usage: ./utils/releasetools/04_release_hash.sh <version_tag>"
-    exit 1
-fi
-
-SHA=$(curl -s http://download.redis.io/releases/redis-${1}.tar.gz | shasum -a 256 | cut -f 1 -d' ')
-ENTRY="hash redis-${1}.tar.gz sha256 $SHA http://download.redis.io/releases/redis-${1}.tar.gz"
-echo $ENTRY >> ../redis-hashes/README
-echo "Press any key to commit, Ctrl-C to abort)."
-read yes
-(cd ../redis-hashes; git commit -a -m "${1} hash."; git push)
diff --git a/redis-stable/utils/releasetools/changelog.tcl b/redis-stable/utils/releasetools/changelog.tcl
deleted file mode 100755
index 2288794b..00000000
--- a/redis-stable/utils/releasetools/changelog.tcl
+++ /dev/null
@@ -1,35 +0,0 @@
-#!/usr/bin/env tclsh
-
-if {[llength $::argv] != 2 && [llength $::argv] != 3} {
-    puts "Usage: $::argv0 <branch> <version> \[<num-commits>\]"
-    exit 1
-}
-
-set branch [lindex $::argv 0]
-set ver [lindex $::argv 1]
-if {[llength $::argv] == 3} {
-    set count [lindex ::$argv 2]
-} else {
-    set count 100
-}
-
-set template {
-================================================================================
-Redis %ver%     Released %date%
-================================================================================
-
-Upgrade urgency <URGENCY>: <DESCRIPTION>
-}
-
-set template [string trim $template]
-append template "\n\n"
-set date [clock format [clock seconds]]
-set template [string map [list %ver% $ver %date% $date] $template]
-
-append template [exec git log $branch~$count..$branch "--format=format:%an in commit %h:%n %s" --shortstat]
-
-#Older, more verbose version.
-#
-#append template [exec git log $branch~30..$branch "--format=format:+-------------------------------------------------------------------------------%n| %s%n| By %an, %ai%n+--------------------------------------------------------------------------------%nhttps://github.com/redis/redis/commit/%H%n%n%b" --stat]
-
-puts $template
diff --git a/redis-stable/utils/speed-regression.tcl b/redis-stable/utils/speed-regression.tcl
deleted file mode 100755
index 86a7d8d8..00000000
--- a/redis-stable/utils/speed-regression.tcl
+++ /dev/null
@@ -1,130 +0,0 @@
-#!/usr/bin/env tclsh8.5
-# Copyright (C) 2011 Salvatore Sanfilippo
-# Released under the BSD license like Redis itself
-
-source ../tests/support/redis.tcl
-set ::port 12123
-set ::tests {PING,SET,GET,INCR,LPUSH,LPOP,SADD,SPOP,LRANGE_100,LRANGE_600,MSET}
-set ::datasize 16
-set ::requests 100000
-
-proc run-tests branches {
-    set runs {}
-    set branch_id 0
-    foreach b $branches {
-        cd ../src
-        puts "Benchmarking $b"
-        exec -ignorestderr git checkout $b 2> /dev/null
-        exec -ignorestderr make clean 2> /dev/null
-        puts "  compiling..."
-        exec -ignorestderr make 2> /dev/null
-
-        if {$branch_id == 0} {
-            puts "  copy redis-benchmark from unstable to /tmp..."
-            exec -ignorestderr cp ./redis-benchmark /tmp
-            incr branch_id
-            continue
-        }
-
-        # Start the Redis server
-        puts "  starting the server... [exec ./redis-server -v]"
-        set pids [exec echo "port $::port\nloglevel warning\n" | ./redis-server - > /dev/null 2> /dev/null &]
-        puts "  pids: $pids"
-        after 1000
-        puts "  running the benchmark"
-
-        set r [redis 127.0.0.1 $::port]
-        set i [$r info]
-        puts "  redis INFO shows version: [lindex [split $i] 0]"
-        $r close
-
-        set output [exec /tmp/redis-benchmark -n $::requests -t $::tests -d $::datasize --csv -p $::port]
-        lappend runs $b $output
-        puts "  killing server..."
-        catch {exec kill -9 [lindex $pids 0]}
-        catch {exec kill -9 [lindex $pids 1]}
-        incr branch_id
-    }
-    return $runs
-}
-
-proc get-result-with-name {output name} {
-    foreach line [split $output "\n"] {
-        lassign [split $line ","] key value
-        set key [string tolower [string range $key 1 end-1]]
-        set value [string range $value 1 end-1]
-        if {$key eq [string tolower $name]} {
-            return $value
-        }
-    }
-    return "n/a"
-}
-
-proc get-test-names output {
-    set names {}
-    foreach line [split $output "\n"] {
-        lassign [split $line ","] key value
-        set key [string tolower [string range $key 1 end-1]]
-        lappend names $key
-    }
-    return $names
-}
-
-proc combine-results {results} {
-    set tests [get-test-names [lindex $results 1]]
-    foreach test $tests {
-        puts $test
-        foreach {branch output} $results {
-            puts [format "%-20s %s" \
-                $branch [get-result-with-name $output $test]]
-        }
-        puts {}
-    }
-}
-
-proc main {} {
-    # Note: the first branch is only used in order to get the redis-benchmark
-    # executable. Tests are performed starting from the second branch.
-    set branches {
-        slowset 2.2.0 2.4.0 unstable slowset
-    }
-    set results [run-tests $branches]
-    puts "\n"
-    puts "# Test results: datasize=$::datasize requests=$::requests"
-    puts [combine-results $results]
-}
-
-# Force the user to run the script from the 'utils' directory.
-if {![file exists speed-regression.tcl]} {
-    puts "Please make sure to run speed-regression.tcl while inside /utils."
-    puts "Example: cd utils; ./speed-regression.tcl"
-    exit 1
-}
-
-# Make sure there is not already a server runnign on port 12123
-set is_not_running [catch {set r [redis 127.0.0.1 $::port]}]
-if {!$is_not_running} {
-    puts "Sorry, you have a running server on port $::port"
-    exit 1
-}
-
-# parse arguments
-for {set j 0} {$j < [llength $argv]} {incr j} {
-    set opt [lindex $argv $j]
-    set arg [lindex $argv [expr $j+1]]
-    if {$opt eq {--tests}} {
-        set ::tests $arg
-        incr j
-    } elseif {$opt eq {--datasize}} {
-        set ::datasize $arg
-        incr j
-    } elseif {$opt eq {--requests}} {
-        set ::requests $arg
-        incr j
-    } else {
-        puts "Wrong argument: $opt"
-        exit 1
-    }
-}
-
-main
diff --git a/redis-stable/utils/srandmember/README.md b/redis-stable/utils/srandmember/README.md
deleted file mode 100644
index d3da1e82..00000000
--- a/redis-stable/utils/srandmember/README.md
+++ /dev/null
@@ -1,14 +0,0 @@
-The utilities in this directory plot the distribution of SRANDMEMBER to
-evaluate how fair it is.
-
-See http://theshfl.com/redis_sets for more information on the topic that lead
-to such investigation fix.
-
-showdist.rb -- shows the distribution of the frequency elements are returned.
-               The x axis is the number of times elements were returned, and
-               the y axis is how many elements were returned with such
-               frequency.
-
-showfreq.rb -- shows the frequency each element was returned.
-               The x axis is the element number.
-               The y axis is the times it was returned.
diff --git a/redis-stable/utils/srandmember/showdist.rb b/redis-stable/utils/srandmember/showdist.rb
deleted file mode 100644
index 24358570..00000000
--- a/redis-stable/utils/srandmember/showdist.rb
+++ /dev/null
@@ -1,33 +0,0 @@
-require 'redis'
-
-r = Redis.new
-r.select(9)
-r.del("myset");
-r.sadd("myset",(0..999).to_a)
-freq = {}
-100.times {
-    res = r.pipelined {
-        1000.times {
-            r.srandmember("myset")
-        }
-    }
-    res.each{|ele|
-        freq[ele] = 0 if freq[ele] == nil
-        freq[ele] += 1
-    }
-}
-
-# Convert into frequency distribution
-dist = {}
-freq.each{|item,count|
-    dist[count] = 0 if dist[count] == nil
-    dist[count] += 1
-}
-
-min = dist.keys.min
-max = dist.keys.max
-(min..max).each{|x|
-    count = dist[x]
-    count = 0 if count == nil
-    puts "#{x} -> #{"*"*count}"
-}
diff --git a/redis-stable/utils/srandmember/showfreq.rb b/redis-stable/utils/srandmember/showfreq.rb
deleted file mode 100644
index fd47bc0c..00000000
--- a/redis-stable/utils/srandmember/showfreq.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-require 'redis'
-
-r = Redis.new
-r.select(9)
-r.del("myset");
-r.sadd("myset",(0..999).to_a)
-freq = {}
-500.times {
-    res = r.pipelined {
-        1000.times {
-            r.srandmember("myset")
-        }
-    }
-    res.each{|ele|
-        freq[ele] = 0 if freq[ele] == nil
-        freq[ele] += 1
-    }
-}
-
-# Print the frequency each element was yeld to process it with gnuplot
-freq.each{|item,count|
-    puts "#{item} #{count}"
-}
diff --git a/redis-stable/utils/systemd-redis_multiple_servers@.service b/redis-stable/utils/systemd-redis_multiple_servers@.service
deleted file mode 100644
index 108ccfc6..00000000
--- a/redis-stable/utils/systemd-redis_multiple_servers@.service
+++ /dev/null
@@ -1,37 +0,0 @@
-# example systemd template service unit file for multiple redis-servers
-#
-# You can use this file as a blueprint for your actual template service unit
-# file, if you intend to run multiple independent redis-server instances in
-# parallel using systemd's "template unit files" feature. If you do, you will
-# want to choose a better basename for your service unit by renaming this file
-# when copying it.
-#
-# Please take a look at the provided "systemd-redis_server.service" example
-# service unit file, too, if you choose to use this approach at managing
-# multiple redis-server instances via systemd.
-
-[Unit]
-Description=Redis data structure server - instance %i
-Documentation=https://redis.io/documentation
-# This template unit assumes your redis-server configuration file(s)
-# to live at /etc/redis/redis_server_<INSTANCE_NAME>.conf
-AssertPathExists=/etc/redis/redis_server_%i.conf
-#Before=your_application.service another_example_application.service
-#AssertPathExists=/var/lib/redis
-
-[Service]
-ExecStart=/usr/local/bin/redis-server /etc/redis/redis_server_%i.conf
-LimitNOFILE=10032
-NoNewPrivileges=yes
-#OOMScoreAdjust=-900
-#PrivateTmp=yes
-Type=notify
-TimeoutStartSec=infinity
-TimeoutStopSec=infinity
-UMask=0077
-#User=redis
-#Group=redis
-#WorkingDirectory=/var/lib/redis
-
-[Install]
-WantedBy=multi-user.target
diff --git a/redis-stable/utils/systemd-redis_server.service b/redis-stable/utils/systemd-redis_server.service
deleted file mode 100644
index cf158644..00000000
--- a/redis-stable/utils/systemd-redis_server.service
+++ /dev/null
@@ -1,43 +0,0 @@
-# example systemd service unit file for redis-server
-#
-# In order to use this as a template for providing a redis service in your
-# environment, _at the very least_ make sure to adapt the redis configuration
-# file you intend to use as needed (make sure to set "supervised systemd"), and
-# to set sane TimeoutStartSec and TimeoutStopSec property values in the unit's
-# "[Service]" section to fit your needs.
-#
-# Some properties, such as User= and Group=, are highly desirable for virtually
-# all deployments of redis, but cannot be provided in a manner that fits all
-# expectable environments. Some of these properties have been commented out in
-# this example service unit file, but you are highly encouraged to set them to
-# fit your needs.
-#
-# Please refer to systemd.unit(5), systemd.service(5), and systemd.exec(5) for
-# more information.
-
-[Unit]
-Description=Redis data structure server
-Documentation=https://redis.io/documentation
-#Before=your_application.service another_example_application.service
-#AssertPathExists=/var/lib/redis
-Wants=network-online.target
-After=network-online.target
-
-[Service]
-ExecStart=/usr/local/bin/redis-server --supervised systemd --daemonize no
-## Alternatively, have redis-server load a configuration file:
-#ExecStart=/usr/local/bin/redis-server /path/to/your/redis.conf
-LimitNOFILE=10032
-NoNewPrivileges=yes
-#OOMScoreAdjust=-900
-#PrivateTmp=yes
-Type=notify
-TimeoutStartSec=infinity
-TimeoutStopSec=infinity
-UMask=0077
-#User=redis
-#Group=redis
-#WorkingDirectory=/var/lib/redis
-
-[Install]
-WantedBy=multi-user.target
diff --git a/redis-stable/utils/tracking_collisions.c b/redis-stable/utils/tracking_collisions.c
deleted file mode 100644
index cd64b36c..00000000
--- a/redis-stable/utils/tracking_collisions.c
+++ /dev/null
@@ -1,76 +0,0 @@
-/* This is a small program used in order to understand the collison rate
- * of CRC64 (ISO version) VS other stronger hashing functions in the context
- * of hashing keys for the Redis "tracking" feature (client side caching
- * assisted by the server).
- *
- * The program attempts to hash keys with common names in the form of
- *
- *  prefix:<counter>
- *
- * And counts the resulting collisons generated in the 24 bits of output
- * needed for the tracking feature invalidation table (16 millions + entries)
- *
- * Compile with:
- *
- *  cc -O2 ./tracking_collisions.c ../src/crc64.c ../src/sha1.c
- *  ./a.out
- *
- * --------------------------------------------------------------------------
- *
- * Copyright (C) 2019 Salvatore Sanfilippo
- * This code is released under the BSD 2 clause license.
- */
-
-#include <stdlib.h>
-#include <stdint.h>
-#include <string.h>
-#include <stdio.h>
-#include "../src/crc64.h"
-#include "../src/sha1.h"
-
-#define TABLE_SIZE (1<<24)
-int Table[TABLE_SIZE];
-
-uint64_t crc64Hash(char *key, size_t len) {
-    return crc64(0,(unsigned char*)key,len);
-}
-
-uint64_t sha1Hash(char *key, size_t len) {
-    SHA1_CTX ctx;
-    unsigned char hash[20];
-
-    SHA1Init(&ctx);
-    SHA1Update(&ctx,(unsigned char*)key,len);
-    SHA1Final(hash,&ctx);
-    uint64_t hash64;
-    memcpy(&hash64,hash,sizeof(hash64));
-    return hash64;
-}
-
-/* Test the hashing function provided as callback and return the
- * number of collisions found. */
-unsigned long testHashingFunction(uint64_t (*hash)(char *, size_t)) {
-    unsigned long collisions = 0;
-    memset(Table,0,sizeof(Table));
-    char *prefixes[] = {"object", "message", "user", NULL};
-    for (int i = 0; prefixes[i] != NULL; i++) {
-        for (int j = 0; j < TABLE_SIZE/2; j++) {
-            char keyname[128];
-            size_t keylen = snprintf(keyname,sizeof(keyname),"%s:%d",
-                                     prefixes[i],j);
-            uint64_t bucket = hash(keyname,keylen) % TABLE_SIZE;
-            if (Table[bucket]) {
-                collisions++;
-            } else {
-                Table[bucket] = 1;
-            }
-        }
-    }
-    return collisions;
-}
-
-int main(void) {
-    printf("SHA1 : %lu\n", testHashingFunction(sha1Hash));
-    printf("CRC64: %lu\n", testHashingFunction(crc64Hash));
-    return 0;
-}
diff --git a/redis-stable/utils/whatisdoing.sh b/redis-stable/utils/whatisdoing.sh
deleted file mode 100755
index 68d7f7cc..00000000
--- a/redis-stable/utils/whatisdoing.sh
+++ /dev/null
@@ -1,24 +0,0 @@
-# This script is from http://poormansprofiler.org/
-#
-# NOTE: Instead of using this script, you should use the Redis
-# Software Watchdog, which provides a similar functionality but in
-# a more reliable / easy to use way.
-#
-# Check https://redis.io/topics/latency for more information.
-
-#!/bin/bash
-nsamples=1
-sleeptime=0
-pid=$(ps auxww | grep '[r]edis-server' | awk '{print $2}')
-
-for x in $(seq 1 $nsamples)
-  do
-    gdb -ex "set pagination 0" -ex "thread apply all bt" -batch -p $pid
-    sleep $sleeptime
-  done | \
-awk '
-  BEGIN { s = ""; } 
-  /Thread/ { print s; s = ""; } 
-  /^\#/ { if (s != "" ) { s = s "," $4} else { s = $4 } } 
-  END { print s }' | \
-sort | uniq -c | sort -r -n -k 1,1
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 4ba24681..6bfc0ebf 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -12,9 +12,9 @@
         <div class="flex flex-row">
 
             @if($exportOption)
-            <div class="mr-2 mt-2 sm:mt-0">
-                @includeIf($theme->base. ''.$theme->name.'.export')
-            </div>
+                <div class="mr-2 mt-2 sm:mt-0">
+                    @includeIf($theme->base. ''.$theme->name.'.export')
+                </div>
             @endif
 
             @includeIf($theme->base. ''.$theme->name.'.toggle-columns')
@@ -29,6 +29,33 @@
 
 </div>
 
+@if($onQueue)
+
+    @if($exporting && !$exportFinished)
+    <div wire:poll="updateExportProgress"
+         class="w-full p-2 my-2 text-sm bg-gray-50 rounded-sm border border-gray- shadow-sm text-center">
+        {{ trans('Exporting ... please wait.') }}
+    </div>
+    @endif
+
+    @if($exportFinished)
+    <div class="w-full p-2 my-2 text-sm bg-gray-50 rounded-sm border border-gray- shadow-sm text-center">
+        {{ trans('Done. Download file') }}
+        <a class="cursor-pointer text-blue-500"
+           wire:click="downloadExport">
+            {{ trans('here') }}
+        </a>
+    </div>
+    @endif
+    {{--    --}}
+    {{--        @if($exporting && !$exportFinished)--}}
+    {{--            <div wire:poll="updateExportProgress">Exporting...please wait.</div>--}}
+    {{--        @endif--}}
+
+    {{--        @if($exportFinished)--}}
+    {{--            Done. Download file <a class="stretched-link" wire:click="downloadExport">here</a>--}}
+    {{--        @endif--}}
+@endif
 <div class="w-full pt-3 mb-3">
 
     @foreach($enabledFilters as $field => $filter)
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
new file mode 100644
index 00000000..e88147f3
--- /dev/null
+++ b/src/Jobs/ExportJob.php
@@ -0,0 +1,57 @@
+<?php
+
+namespace PowerComponents\LivewirePowerGrid\Jobs;
+
+use App\Models\Dish;
+use Illuminate\Bus\Batchable;
+use Illuminate\Bus\Queueable;
+use Illuminate\Contracts\Queue\ShouldQueue;
+use Illuminate\Foundation\Bus\Dispatchable;
+use Illuminate\Queue\InteractsWithQueue;
+use Illuminate\Queue\SerializesModels;
+use Illuminate\Support\Collection;
+use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
+
+class ExportJob implements ShouldQueue
+{
+    use Batchable;
+    use Dispatchable;
+    use InteractsWithQueue;
+    use Queueable;
+    use SerializesModels;
+
+    private string $exportFileName;
+
+    private array $columns;
+
+    private $datasource;
+
+    private string $type;
+
+    private int $take;
+
+    private int $limit;
+
+    /**
+     * @param string $exportFileName
+     * @param array $columns
+     * @param Collection $data
+     */
+    public function __construct(string $type, string $exportFileName, array $columns, $datasource, $take, $limit)
+    {
+        $this->type           = $type;
+        $this->exportFileName = $exportFileName;
+        $this->columns        = $columns;
+        $this->datasource     = $datasource;
+        $this->take           = $take;
+        $this->limit          = $limit;
+    }
+
+    public function handle()
+    {
+        return (new $this->type())
+            ->fileName($this->exportFileName . '-' . $this->take . '-' . $this->limit)
+            ->setData($this->columns, Dish::query()->take($this->take)->limit($this->limit)->get())
+            ->store();
+    }
+}
diff --git a/src/Services/Export.php b/src/Services/Export.php
index f679ae56..1d335c1b 100644
--- a/src/Services/Export.php
+++ b/src/Services/Export.php
@@ -55,7 +55,7 @@ public function prepare(Collection $data, array $columns): array
 
         return [
             'headers' => $header->toArray(),
-            'rows'    => $data->toArray()
+            'rows'    => $data->toArray(),
         ];
     }
 }
diff --git a/src/Services/Spout/ExportToCsv.php b/src/Services/Spout/ExportToCsv.php
index dedfef38..d5033b05 100644
--- a/src/Services/Spout/ExportToCsv.php
+++ b/src/Services/Spout/ExportToCsv.php
@@ -16,6 +16,11 @@ public function download()
             ->download(storage_path($this->fileName . '.csv'));
     }
 
+    public function store()
+    {
+        $this->build();
+    }
+
     public function build()
     {
         $data = $this->prepare($this->data, $this->columns);
diff --git a/src/Services/Spout/ExportToXLS.php b/src/Services/Spout/ExportToXLS.php
index 098b9104..d86164b7 100644
--- a/src/Services/Spout/ExportToXLS.php
+++ b/src/Services/Spout/ExportToXLS.php
@@ -19,6 +19,11 @@ public function download()
             ->download(storage_path($this->fileName . '.xlsx'));
     }
 
+    public function store()
+    {
+        $this->build();
+    }
+
     public function build()
     {
         $data = $this->prepare($this->data, $this->columns);
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 97bc196a..1daee47c 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -2,10 +2,19 @@
 
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
+use App\Models\Dish;
+use Illuminate\Bus\Batch;
+use Illuminate\Support\Facades\Bus;
+use Illuminate\Support\Facades\Storage;
+use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
 use Symfony\Component\HttpFoundation\BinaryFileResponse;
+use Symfony\Component\HttpFoundation\StreamedResponse;
 
+/**
+ * @property mixed exportBatch
+ */
 trait Exportable
 {
     public bool $exportOption = false;
@@ -14,15 +23,28 @@ trait Exportable
 
     public array $exportType = [];
 
+    public bool $onQueue = false;
+
+    public bool $exporting = false;
+
+    public bool $exportFinished = false;
+
+    public string $batchId = '';
+
+    public string $extension = '';
+
     /**
      * @param string $fileName
      * @param array|string[] $type
+     * @param bool $onQueue
+     * @return Exportable
      */
-    public function showExportOption(string $fileName, array $type = ['excel', 'csv'])
+    public function showExportOption(string $fileName, array $type = ['excel', 'csv'], bool $onQueue = false)
     {
         $this->exportOption   = true;
         $this->exportFileName = $fileName;
         $this->exportType     = $type;
+        $this->onQueue        = $onQueue;
 
         return $this;
     }
@@ -30,7 +52,7 @@ public function showExportOption(string $fileName, array $type = ['excel', 'csv'
     /**
      * @throws \Exception
      */
-    public function prepareToExport(bool $selected = false)
+    public function prepareToExport(bool $selected = false, $datasource)
     {
         $inClause = $this->filtered;
 
@@ -40,44 +62,102 @@ public function prepareToExport(bool $selected = false)
 
         if ($this->isCollection) {
             if ($inClause) {
-                $results = $this->resolveCollection()->whereIn($this->primaryKey, $inClause);
+                $results = $this->resolveCollection($datasource)->whereIn($this->primaryKey, $inClause);
 
                 return $this->transform($results);
             }
 
-            return $this->transform($this->resolveCollection());
+            return $this->transform($this->resolveCollection($datasource));
         }
 
         if ($inClause) {
-            $results = $this->resolveModel()->whereIn($this->primaryKey, $inClause)->get();
+            $results = $this->resolveModel($datasource)->whereIn($this->primaryKey, $inClause)->get();
 
             return $this->transform($results);
         }
 
-        $results = $this->resolveModel()->get();
+        $results = $this->resolveModel($datasource)->get();
 
         return $this->transform($results);
     }
 
     /**
      * @throws \Exception
+     * @throws \Throwable
      */
-    public function exportToXLS(bool $selected = false): BinaryFileResponse
+    public function exportToXLS(bool $selected = false)
     {
-        return (new ExportToXLS())
-            ->fileName($this->exportFileName)
-            ->setData($this->columns(), $this->prepareToExport($selected))
-            ->download();
+        $this->runOnQueue(ExportToXLS::class, $selected);
+
+        if (!$this->onQueue) {
+            return (new ExportToXLS())
+                ->fileName($this->exportFileName)
+                ->setData($this->columns(), $this->prepareToExport($selected))
+                ->download();
+        }
     }
 
     /**
-     * @throws \Exception
+     * @throws \Throwable
+     * @return BinaryFileResponse
      */
-    public function exportToCsv(bool $selected = false): BinaryFileResponse
+    public function exportToCsv(bool $selected = false)
     {
-        return (new ExportToCsv())
-            ->fileName($this->exportFileName)
-            ->setData($this->columns(), $this->prepareToExport($selected))
-            ->download();
+        $this->runOnQueue(ExportToCsv::class, $selected);
+
+        if (!$this->onQueue) {
+            return (new ExportToCsv())
+                ->fileName($this->exportFileName)
+                ->setData($this->columns(), $this->prepareToExport($selected))
+                ->download();
+        }
+    }
+
+    public function getExportBatchProperty(): ?Batch
+    {
+        if (!$this->batchId) {
+            return null;
+        }
+
+        return Bus::findBatch($this->batchId);
+    }
+
+    public function updateExportProgress()
+    {
+        if (!is_null($this->exportBatch)) {
+            $this->exportFinished = $this->exportBatch->finished();
+
+            if ($this->exportFinished) {
+                $this->exporting = false;
+            }
+        }
+    }
+
+    public function downloadExport(): BinaryFileResponse
+    {
+        return response()->download(storage_path($this->exportFileName . '.' . $this->extension));
+    }
+
+    /**
+     * @throws \Throwable
+     */
+    public function runOnQueue(string $class, bool $selected = false)
+    {
+        if ($this->onQueue) {
+            $this->exporting      = true;
+            $this->exportFinished = false;
+
+            switch ($class) {
+                case ExportToCsv::class: $this->extension = 'csv';
+                    break;
+                case ExportToXLS::class: $this->extension = 'xls';
+            }
+
+            $batch = Bus::batch([
+                new ExportJob($class, $this->exportFileName, $this->columns(), 0, 0, 200),
+            ])->dispatch();
+
+            $this->batchId = $batch->id;
+        }
     }
 }

From eca67251f562c147c2e07c97da92ec85d4e0e6c2 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 16 Oct 2021 17:59:58 -0300
Subject: [PATCH 03/34] wip

---
 resources/lang/pt_BR/datatable.php            |  6 +-
 .../frameworks/tailwind/header.blade.php      | 74 ++++++++++-------
 .../frameworks/tailwind/message.blade.php     |  8 +-
 .../frameworks/tailwind/table-base.blade.php  |  4 +-
 .../icons/chevron-double-down.blade.php       |  7 ++
 .../views/components/icons/download.blade.php |  3 +-
 src/Jobs/ExportJob.php                        | 54 +++++++++---
 src/PowerGridComponent.php                    | 20 +++--
 src/Traits/Exportable.php                     | 83 +++++++++++++------
 9 files changed, 181 insertions(+), 78 deletions(-)
 create mode 100644 resources/views/components/icons/chevron-double-down.blade.php

diff --git a/resources/lang/pt_BR/datatable.php b/resources/lang/pt_BR/datatable.php
index c82eb7e8..284421b5 100644
--- a/resources/lang/pt_BR/datatable.php
+++ b/resources/lang/pt_BR/datatable.php
@@ -41,5 +41,9 @@
         'contains_not' => 'Não contém',
         'starts_with'  => 'Começa com',
         'ends_with'    => 'Termina com',
-    ]
+    ],
+    'export' => [
+        'exporting'  => 'Please wait!',
+        'completed' => 'Export completed! Your files are ready for download',
+    ],
 ];
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 6bfc0ebf..da522c22 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -11,7 +11,7 @@
 
         <div class="flex flex-row">
 
-            @if($exportOption)
+            @if($exportOption && $queues === 0)
                 <div class="mr-2 mt-2 sm:mt-0">
                     @includeIf($theme->base. ''.$theme->name.'.export')
                 </div>
@@ -29,39 +29,54 @@
 
 </div>
 
-@if($onQueue)
+@if($queues)
 
     @if($exporting && !$exportFinished)
-    <div wire:poll="updateExportProgress"
-         class="w-full p-2 my-2 text-sm bg-gray-50 rounded-sm border border-gray- shadow-sm text-center">
-        {{ trans('Exporting ... please wait.') }}
-    </div>
+        <div wire:poll="updateExportProgress"
+             class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
+            <div class="dark:text-gray-300">{{ $progress }}%</div>
+            <div class="dark:text-gray-300">{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
+        </div>
     @endif
 
-    @if($exportFinished)
-    <div class="w-full p-2 my-2 text-sm bg-gray-50 rounded-sm border border-gray- shadow-sm text-center">
-        {{ trans('Done. Download file') }}
-        <a class="cursor-pointer text-blue-500"
-           wire:click="downloadExport">
-            {{ trans('here') }}
-        </a>
-    </div>
+    @if(count($exportedFiles) && $exportFinished)
+        <div class="w-full my-3 dark:bg-gray-800">
+            <div x-data={show:true} class="rounded-top">
+                <div class="px-4 py-3 rounded-md cursor-pointer bg-gray-200 shadow dark:bg-gray-500"
+                     @click="show=!show">
+                    <div class="flex justify-between">
+                        <button
+                            class="appearance-none text-left text-base font-medium text-gray-500 focus:outline-none dark:text-gray-300"
+                            type="button">
+                            ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
+                        </button>
+                        <x-livewire-powergrid::icons.chevron-double-down class="w-5 dark:text-gray-200"/>
+                    </div>
+                </div>
+                <div x-show="show"
+                     class="border-l border-b border-r border-gray-200 dark:border-gray-600 px-2 py-4 dark:border-0 dark:bg-gray-700">
+                    @foreach($exportedFiles as $file)
+                        <div class="flex w-full p-2">
+                            <x-livewire-powergrid::icons.download
+                                class="w-5 text-gray-700 dark:text-gray-300 mr-3"/>
+                            <a class="cursor-pointer text-gray-600 dark:text-gray-300"
+                               wire:click="downloadExport('{{ $file }}')">
+                                {{ $file }}
+                            </a>
+                        </div>
+                    @endforeach
+                </div>
+            </div>
+        </div>
     @endif
-    {{--    --}}
-    {{--        @if($exporting && !$exportFinished)--}}
-    {{--            <div wire:poll="updateExportProgress">Exporting...please wait.</div>--}}
-    {{--        @endif--}}
-
-    {{--        @if($exportFinished)--}}
-    {{--            Done. Download file <a class="stretched-link" wire:click="downloadExport">here</a>--}}
-    {{--        @endif--}}
-@endif
-<div class="w-full pt-3 mb-3">
 
-    @foreach($enabledFilters as $field => $filter)
+@endif
 
-        <span
-            class="cursor-pointer inline-flex rounded-full items-center py-0.5 pl-2.5 pr-1 text-sm font-medium bg-indigo-100 text-indigo-700">
+@if(count($enabledFilters))
+    <div class="w-full pt-3 mb-3">
+        @foreach($enabledFilters as $field => $filter)
+            <span
+                class="cursor-pointer inline-flex rounded-full items-center py-0.5 pl-2.5 pr-1 text-sm font-medium bg-indigo-100 text-indigo-700">
               {{ $filter['label'] }}
               <button type="button"
                       wire:click.prevent="clearFilter('{{ $field }}')"
@@ -73,5 +88,6 @@ class="flex-shrink-0 ml-0.5 h-4 w-4 rounded-full inline-flex items-center justif
               </button>
         </span>
 
-    @endforeach
-</div>
+        @endforeach
+    </div>
+@endif
diff --git a/resources/views/components/frameworks/tailwind/message.blade.php b/resources/views/components/frameworks/tailwind/message.blade.php
index 59101fbf..b73a7200 100644
--- a/resources/views/components/frameworks/tailwind/message.blade.php
+++ b/resources/views/components/frameworks/tailwind/message.blade.php
@@ -1,7 +1,7 @@
-<div class="pb-2 message dark:bg-gray-800">
+<div class="message">
     @if(session()->has('success') || session()->has('error'))
     <div
-        class="mb-2 border px-4 py-3 rounded relative
+        class="pb-2 dark:bg-gray-800 border px-4 py-3 rounded relative
         @if (session()->has('success'))
             bg-green-100 border-green-600 text-green-700 dark:bg-green-300 dark:text-green-900
         @elseif (session()->has('error'))
@@ -13,7 +13,7 @@ class="mb-2 border px-4 py-3 rounded relative
             @elseif (session()->has('error'))
                 {{ session('error') }}
             @endif
-        </span>    
+        </span>
         <span class="absolute top-0 bottom-0 right-0 px-4 py-3">
             <svg onclick="document.getElementsByClassName('message')[0].style.display = 'none'"
                  class="w-6 h-6 text-green-500 fill-current" role="button" xmlns="http://www.w3.org/2000/svg"
@@ -23,4 +23,4 @@ class="w-6 h-6 text-green-500 fill-current" role="button" xmlns="http://www.w3.o
         </span>
     </div>
     @endif
-</div>
\ No newline at end of file
+</div>
diff --git a/resources/views/components/frameworks/tailwind/table-base.blade.php b/resources/views/components/frameworks/tailwind/table-base.blade.php
index afcc65b5..f9375d7b 100644
--- a/resources/views/components/frameworks/tailwind/table-base.blade.php
+++ b/resources/views/components/frameworks/tailwind/table-base.blade.php
@@ -17,7 +17,9 @@
                 @endif
             @endif
 
-            @include($theme->layout->message)
+            <div class="my-3">
+                @include($theme->layout->message)
+            </div>
 
             <div class="overflow-hidden overflow-x-auto bg-white shadow overflow-y-auto relative">
                 @include($table)
diff --git a/resources/views/components/icons/chevron-double-down.blade.php b/resources/views/components/icons/chevron-double-down.blade.php
new file mode 100644
index 00000000..2d4506c2
--- /dev/null
+++ b/resources/views/components/icons/chevron-double-down.blade.php
@@ -0,0 +1,7 @@
+<svg {{ $attributes }}
+     viewBox="0 0 20 20"
+     fill="currentColor">
+    <path fill-rule="evenodd"
+          d="M15.707 4.293a1 1 0 010 1.414l-5 5a1 1 0 01-1.414 0l-5-5a1 1 0 011.414-1.414L10 8.586l4.293-4.293a1 1 0 011.414 0zm0 6a1 1 0 010 1.414l-5 5a1 1 0 01-1.414 0l-5-5a1 1 0 111.414-1.414L10 14.586l4.293-4.293a1 1 0 011.414 0z"
+          clip-rule="evenodd"/>
+</svg>
diff --git a/resources/views/components/icons/download.blade.php b/resources/views/components/icons/download.blade.php
index f8d6946c..6fb3e25b 100644
--- a/resources/views/components/icons/download.blade.php
+++ b/resources/views/components/icons/download.blade.php
@@ -1,5 +1,4 @@
-<svg xmlns="http://www.w3.org/2000/svg"
-     {{ $attributes->merge(['class' => 'h-6 w-6']) }}
+<svg {{ $attributes }}
      fill="none"
      viewBox="0 0 24 24" stroke="currentColor">
     <path stroke-linecap="round" stroke-linejoin="round" stroke-width="2"
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index e88147f3..e8aa61bf 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -2,6 +2,7 @@
 
 namespace PowerComponents\LivewirePowerGrid\Jobs;
 
+use App\Http\Livewire\DishesTable;
 use App\Models\Dish;
 use Illuminate\Bus\Batchable;
 use Illuminate\Bus\Queueable;
@@ -9,8 +10,7 @@
 use Illuminate\Foundation\Bus\Dispatchable;
 use Illuminate\Queue\InteractsWithQueue;
 use Illuminate\Queue\SerializesModels;
-use Illuminate\Support\Collection;
-use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
+use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 
 class ExportJob implements ShouldQueue
 {
@@ -22,36 +22,70 @@ class ExportJob implements ShouldQueue
 
     private string $exportFileName;
 
+    private PowerGridComponent $componentTable;
+
     private array $columns;
 
     private $datasource;
 
     private string $type;
 
-    private int $take;
+    private int $offset;
 
     private int $limit;
 
     /**
+     * @param string $componentTable
+     * @param string $type
      * @param string $exportFileName
      * @param array $columns
-     * @param Collection $data
+     * @param $datasource
+     * @param $offset
+     * @param $limit
      */
-    public function __construct(string $type, string $exportFileName, array $columns, $datasource, $take, $limit)
-    {
+    public function __construct(
+        string $componentTable,
+        string $type,
+        string $exportFileName,
+        array $columns,
+        $offset,
+        $limit
+    ) {
         $this->type           = $type;
         $this->exportFileName = $exportFileName;
         $this->columns        = $columns;
-        $this->datasource     = $datasource;
-        $this->take           = $take;
+        $this->offset         = $offset;
         $this->limit          = $limit;
+
+        $this->componentTable = new $componentTable();
     }
 
     public function handle()
     {
+        $fileName = $this->exportFileName . '-' . $this->offset . '-' . $this->limit;
+
+        $query = $this->componentTable
+            ->datasource()
+            ->offset($this->offset)
+            ->limit($this->limit)
+            ->get();
+
         return (new $this->type())
-            ->fileName($this->exportFileName . '-' . $this->take . '-' . $this->limit)
-            ->setData($this->columns, Dish::query()->take($this->take)->limit($this->limit)->get())
+            ->fileName($fileName)
+            ->setData($this->columns, $this->transform($query))
             ->store();
     }
+
+    private function transform($results)
+    {
+        return $results->transform(function ($row) {
+            $row = (object)$row;
+            $columns = $this->componentTable->addColumns()->columns;
+            foreach ($columns as $key => $column) {
+                $row->{$key} = $column($row);
+            }
+
+            return $row;
+        });
+    }
 }
diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index 4c058c70..b9abf647 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -56,7 +56,7 @@ class PowerGridComponent extends Component
         'eventToggleChanged'    => 'eventInputChanged',
         'eventMultiSelect'      => 'eventMultiSelect',
         'eventRefresh'          => '$refresh',
-        'eventToggleColumn'     => 'toggleColumn'
+        'eventToggleColumn'     => 'toggleColumn',
 
     ];
 
@@ -64,6 +64,13 @@ class PowerGridComponent extends Component
 
     public array $relationSearch = [];
 
+    public function queue()
+    {
+        return [
+            'queues' => 10,
+        ];
+    }
+
     /**
      * Apply checkbox, perPage and search view and theme
      */
@@ -82,7 +89,7 @@ public function columns(): array
         return [];
     }
 
-    protected function datasource()
+    public function datasource()
     {
         return null;
     }
@@ -195,7 +202,7 @@ private function renderView($data)
         return view($this->powerGridTheme->layout->table, [
             'data'  => $data,
             'theme' => $this->powerGridTheme,
-            'table' => 'livewire-powergrid::components.table'
+            'table' => 'livewire-powergrid::components.table',
         ]);
     }
 
@@ -205,6 +212,8 @@ private function resolveModel($datasource = null)
             return $this->datasource();
         }
 
+        $this->totalOfRecord = $datasource->count();
+
         return $datasource;
     }
 
@@ -280,7 +289,7 @@ public function updateMessages(string $status, string $field = '_default_message
             "error" => [
                 '_default_message' => __('Error updating the data.'),
                 //'custom_field' => __('Error updating custom field.'),
-            ]
+            ],
         ];
 
         return ($updateMessages[$status][$field] ?? $updateMessages[$status]['_default_message']);
@@ -343,7 +352,8 @@ public function fillData()
 
     private function instanceOfCollection($datasource): void
     {
-        $checkDatasource = (is_a($datasource, PowerGrid::class)
+        $checkDatasource = (
+            is_a($datasource, PowerGrid::class)
             || is_array($datasource)
             || is_a($datasource, BaseCollection::class)
         );
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 1daee47c..5046c166 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -2,18 +2,17 @@
 
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
+use App\Http\Livewire\DishesTable;
 use App\Models\Dish;
 use Illuminate\Bus\Batch;
 use Illuminate\Support\Facades\Bus;
-use Illuminate\Support\Facades\Storage;
 use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
 use Symfony\Component\HttpFoundation\BinaryFileResponse;
-use Symfony\Component\HttpFoundation\StreamedResponse;
 
 /**
- * @property mixed exportBatch
+ * @property Batch exportBatch
  */
 trait Exportable
 {
@@ -23,8 +22,6 @@ trait Exportable
 
     public array $exportType = [];
 
-    public bool $onQueue = false;
-
     public bool $exporting = false;
 
     public bool $exportFinished = false;
@@ -33,18 +30,24 @@ trait Exportable
 
     public string $extension = '';
 
+    public int $total = 0;
+
+    public int $queues = 0;
+
+    public int $progress = 0;
+
+    public array $exportedFiles = [];
+
     /**
      * @param string $fileName
      * @param array|string[] $type
-     * @param bool $onQueue
      * @return Exportable
      */
-    public function showExportOption(string $fileName, array $type = ['excel', 'csv'], bool $onQueue = false)
+    public function showExportOption(string $fileName, array $type = ['excel', 'csv'])
     {
         $this->exportOption   = true;
         $this->exportFileName = $fileName;
         $this->exportType     = $type;
-        $this->onQueue        = $onQueue;
 
         return $this;
     }
@@ -52,7 +55,7 @@ public function showExportOption(string $fileName, array $type = ['excel', 'csv'
     /**
      * @throws \Exception
      */
-    public function prepareToExport(bool $selected = false, $datasource)
+    public function prepareToExport(bool $selected = false)
     {
         $inClause = $this->filtered;
 
@@ -62,21 +65,21 @@ public function prepareToExport(bool $selected = false, $datasource)
 
         if ($this->isCollection) {
             if ($inClause) {
-                $results = $this->resolveCollection($datasource)->whereIn($this->primaryKey, $inClause);
+                $results = $this->resolveCollection()->whereIn($this->primaryKey, $inClause);
 
                 return $this->transform($results);
             }
 
-            return $this->transform($this->resolveCollection($datasource));
+            return $this->transform($this->resolveCollection());
         }
 
         if ($inClause) {
-            $results = $this->resolveModel($datasource)->whereIn($this->primaryKey, $inClause)->get();
+            $results = $this->resolveModel()->whereIn($this->primaryKey, $inClause)->get();
 
             return $this->transform($results);
         }
 
-        $results = $this->resolveModel($datasource)->get();
+        $results = $this->resolveModel()->get();
 
         return $this->transform($results);
     }
@@ -89,7 +92,7 @@ public function exportToXLS(bool $selected = false)
     {
         $this->runOnQueue(ExportToXLS::class, $selected);
 
-        if (!$this->onQueue) {
+        if ($this->queues === 0) {
             return (new ExportToXLS())
                 ->fileName($this->exportFileName)
                 ->setData($this->columns(), $this->prepareToExport($selected))
@@ -98,14 +101,14 @@ public function exportToXLS(bool $selected = false)
     }
 
     /**
-     * @throws \Throwable
      * @return BinaryFileResponse
+     * @throws \Throwable
      */
     public function exportToCsv(bool $selected = false)
     {
         $this->runOnQueue(ExportToCsv::class, $selected);
 
-        if (!$this->onQueue) {
+        if ($this->queues === 0) {
             return (new ExportToCsv())
                 ->fileName($this->exportFileName)
                 ->setData($this->columns(), $this->prepareToExport($selected))
@@ -126,38 +129,66 @@ public function updateExportProgress()
     {
         if (!is_null($this->exportBatch)) {
             $this->exportFinished = $this->exportBatch->finished();
-
+            $this->progress       = $this->exportBatch->progress();
             if ($this->exportFinished) {
                 $this->exporting = false;
             }
         }
     }
 
-    public function downloadExport(): BinaryFileResponse
+    public function downloadExport(string $file): BinaryFileResponse
     {
-        return response()->download(storage_path($this->exportFileName . '.' . $this->extension));
+        return response()->download(storage_path($file));
     }
 
     /**
      * @throws \Throwable
      */
-    public function runOnQueue(string $class, bool $selected = false)
+    public function runOnQueue(string $type)
     {
-        if ($this->onQueue) {
+        if ($this->queues) {
             $this->exporting      = true;
             $this->exportFinished = false;
 
-            switch ($class) {
-                case ExportToCsv::class: $this->extension = 'csv';
+            switch ($type) {
+                case ExportToCsv::class:
+                    $this->extension = 'csv';
+
                     break;
-                case ExportToXLS::class: $this->extension = 'xls';
+                case ExportToXLS::class:
+                    $this->extension = 'xlsx';
+            }
+
+            $queues  = collect();
+            $perPage = $this->totalOfRecord / $this->queues;
+            $page    = 0;
+            $limit   = $perPage;
+
+            for ($i = 1; $i < ($this->queues +1); $i++) {
+                $queues->push(new ExportJob(
+                    get_called_class(),
+                    $type,
+                    $this->exportFileName,
+                    $this->columns(),
+                    $page,
+                    $limit,
+                ));
+
+                $this->exportedFiles[] = $this->exportFileName . '-' . $page . '-' . $limit . '.' . $this->extension;
+
+                $page  = $limit + 1;
+                $limit = ($page - 1) + $perPage;
             }
 
             $batch = Bus::batch([
-                new ExportJob($class, $this->exportFileName, $this->columns(), 0, 0, 200),
-            ])->dispatch();
+                $queues->toArray(),
+            ])
+                ->name('PowerGrid Batch')
+                ->dispatch();
 
             $this->batchId = $batch->id;
+
+            return true;
         }
     }
 }

From 589a3ecfb77ff4487979aa4d11446297d5c42584 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 16 Oct 2021 18:44:04 -0300
Subject: [PATCH 04/34] wip

---
 .php-cs-fixer.php                             |  84 ++++++++++++++++++
 composer.json                                 |   8 +-
 redis-stable.tar.gz                           | Bin 2527624 -> 0 bytes
 resources/config/livewire-powergrid.php       |  14 +--
 resources/lang/ca/datatable.php               |   4 +-
 resources/lang/de/datatable.php               |   4 +-
 resources/lang/en/datatable.php               |   4 +-
 resources/lang/es/datatable.php               |   2 +-
 resources/lang/fa/datatable.php               |  12 +--
 resources/lang/it/datatable.php               |   4 +-
 resources/lang/pt_BR/datatable.php            |   2 +-
 .../frameworks/tailwind/header.blade.php      |   4 +-
 src/Column.php                                |  32 +++----
 src/Commands/CreateCommand.php                |  22 +++--
 src/Commands/DemoCommand.php                  |  12 +--
 src/Commands/PublishCommand.php               |   2 +-
 src/Helpers/Collection.php                    |  12 +--
 src/Helpers/InteractsWithVersions.php         |   4 +-
 src/Helpers/Model.php                         |  18 ++--
 src/Jobs/ExportJob.php                        |  18 ++--
 src/PowerGridComponent.php                    |   2 +-
 src/PowerGridManager.php                      |   2 +-
 src/Providers/PowerGridServiceProvider.php    |   8 +-
 src/Themes/Components/Actions.php             |   6 +-
 src/Themes/Components/Checkbox.php            |   6 +-
 src/Themes/Components/Cols.php                |   4 +-
 src/Themes/Components/FilterBoolean.php       |   2 +-
 src/Themes/Components/FilterInputText.php     |   2 +-
 src/Themes/Components/FilterMultiSelect.php   |   6 +-
 src/Themes/Components/FilterNumber.php        |   6 +-
 src/Themes/Components/FilterSelect.php        |   8 +-
 src/Themes/Components/Footer.php              |   2 +-
 src/Themes/Components/Table.php               |  14 +--
 src/Themes/Theme.php                          |  30 +++----
 src/Themes/ThemeManager.php                   |  32 ++++---
 src/Traits/Checkbox.php                       |   1 -
 src/Traits/Exportable.php                     |  73 ++++++++-------
 tests/Feature/FilterBooleanTest.php           |   2 +-
 tests/Feature/FilterInputDateTimeTest.php     |   4 +-
 tests/Feature/FilterNameOptionsTest.php       |   6 +-
 tests/Feature/FilterNumberTest.php            |   6 +-
 tests/Feature/PowerGridTest.php               |   6 +-
 tests/Models/Category.php                     |   2 +-
 tests/TestCase.php                            |  24 ++---
 44 files changed, 308 insertions(+), 208 deletions(-)
 create mode 100644 .php-cs-fixer.php
 delete mode 100644 redis-stable.tar.gz

diff --git a/.php-cs-fixer.php b/.php-cs-fixer.php
new file mode 100644
index 00000000..1bb836f7
--- /dev/null
+++ b/.php-cs-fixer.php
@@ -0,0 +1,84 @@
+<?php
+
+use PhpCsFixer\Config;
+use PhpCsFixer\Finder;
+
+$rules = [
+    '@PSR12'                  => true,
+    'align_multiline_comment' => false,
+    'array_indentation'       => true,
+    "array_syntax"            => ['syntax' => 'short'],
+    'binary_operator_spaces'  => [
+        'operators' => [
+            '='  => 'align_single_space',
+            '=>' => 'align_single_space',
+        ],
+    ],
+    'blank_line_after_namespace'   => true,
+    'blank_line_after_opening_tag' => false,
+    'blank_line_before_statement'  => ['statements' => ['break', 'continue', 'declare', 'return', 'throw', 'try']],
+    'braces'                       => [
+        'allow_single_line_closure'                   => false,
+        'position_after_anonymous_constructs'         => 'same',
+        'position_after_control_structures'           => 'same',
+        'position_after_functions_and_oop_constructs' => 'next',
+    ],
+    'cast_spaces'                          => ['space' => 'none'],
+    'class_attributes_separation'          => [
+        'elements' => ['method' => 'one', 'property' => 'one'],
+    ],
+    'class_keyword_remove'                 => false,
+    'combine_consecutive_issets'           => false,
+    'combine_consecutive_unsets'           => false,
+    'combine_nested_dirname'               => false,
+    'comment_to_phpdoc'                    => false,
+    'compact_nullable_typehint'            => false,
+    'concat_space'                         => ['spacing' => 'one'],
+    'constant_case'                        => [
+        'case' => 'lower',
+    ],
+    'date_time_immutable'                  => false,
+    'declare_equal_normalize'              => [
+        'space' => 'single',
+    ],
+    'declare_strict_types'                 => false,
+    'dir_constant'                         => false,
+    'doctrine_annotation_array_assignment' => false,
+    'doctrine_annotation_braces'           => false,
+    'doctrine_annotation_indentation'      => [
+        'ignored_tags'       => [],
+        'indent_mixed_lines' => true,
+    ],
+    'doctrine_annotation_spaces'           => [
+        'after_argument_assignments'     => false,
+        'after_array_assignments_colon'  => false,
+        'after_array_assignments_equals' => false,
+    ],
+    'elseif'                      => false,
+    'encoding'                    => true,
+    'indentation_type'            => true,
+    'no_useless_else'             => false,
+    'no_useless_return'           => true,
+    'ordered_imports'             => true,
+    'single_quote'                => false,
+    'ternary_operator_spaces'     => true,
+    'trailing_comma_in_multiline' => true,
+];
+
+$finder = Finder::create()
+    ->notPath('bootstrap')
+    ->notPath('storage')
+    ->notPath('vendor')
+    ->in(getcwd())
+    ->name('*.php')
+    ->notName('*.blade.php')
+    ->notName('index.php')
+    ->notName('server.php')
+    ->ignoreDotFiles(true)
+    ->ignoreVCS(true);
+
+return (new Config())
+    ->setFinder($finder)
+    ->setRules($rules)
+    ->setRiskyAllowed(false)
+    ->setUsingCache(true);
diff --git a/composer.json b/composer.json
index 0a2886f0..93742fc5 100644
--- a/composer.json
+++ b/composer.json
@@ -39,7 +39,10 @@
         "doctrine/dbal": "^3.1"
     },
     "scripts": {
-        "test": "./vendor/bin/pest"
+        "test": "./vendor/bin/pest",
+        "fix": [
+            "./vendor/bin/php-cs-fixer fix"
+        ]
     },
     "require-dev": {
         "phpunit/phpunit": "^9.5",
@@ -47,6 +50,7 @@
         "orchestra/testbench": "^6.17",
         "composer/composer": "^2.1",
         "pestphp/pest-plugin-faker": "^1.0",
-        "pestphp/pest-plugin-livewire": "^1.0"
+        "pestphp/pest-plugin-livewire": "^1.0",
+        "friendsofphp/php-cs-fixer": "^2.18"
     }
 }
diff --git a/redis-stable.tar.gz b/redis-stable.tar.gz
deleted file mode 100644
index 1e079faad5d1a98163a167396927a2367f5a5789..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 2527624
zcmV(pK=8jGiwFP!000001MFORciTpi&)@hIZE7|WwIn6#upBA&hLT{4ZzxhjP(D`U
z#|HvU5-|=2ha|@Fci&%CH%O48kDVx)mp4XU1fY+)tGc>TbSzyjsV1pC^ySWXf6TRu
z>*(l^?)9U?-QqpJzN;V9_nsae9_{TPe79TQ-^Flo_y^ImbY<W@7UH{Xn1yNfnQ>p}
z|BGI6QU7P%PQTYWz3#U<%}2yR3V!<Z;8Xg4dT_L=|AV9br{9U)N2KAC*MGSFJ5ef+
z#c(E^C`@B-n5AAg#)~UO8i{lwMUN~*OylTh>7>F7g&oesD2js$UK~GjX+k1Hx*N8b
zX1*_C`Aa5~RNQ*DXnN@+8&-s^ppIgD9LO*gQ7oo*>P&dhH1=-oR0<i`o{uhLnhkx=
z5kT!^N#aGJ7{^gIO)6p*Wx^iEk_n8ZFYQE9W31q3p(|r1Je6^f7}1DdPOWnRfHK73
zbYiCr#<4>&@<NxmqCscftG6(HwE0pqC+D3k2O|L@M-p9HT2WXNZvpGh1K)bi61H`)
z?;sN|G^7poHAHS-P?l>$)(m4qv@Wl@y?&$9KNc6=*P`DQ*On=I=6TB!%~t>7`c$+m
z>)NyoLy22>NdgTB>!N$zJ{R3i`>i-NY1X+C+cb((G0esgs0{%?pW@u?H(G5B7)d+L
zVrghCCN*K+%6LX3kA?KX(@^?RI8K&Lq!~qH@X#bZ9UFo#zD?3}njG)!C=J%eJg(+M
z!4A-7!A`KV@kBi_psG7GjH|ZU0E_2c(dqWZRoCi^rr9xjjkfp)`0Tg39ZQMJj-?1A
z+=o%7SR&I(vSbQ-m9D`pS_#X-NoGkZgPM3PH=(<s6vU;N*wg8ZIGad+s;mtHg8kom
zt~6|nBuGg%Wf5w?WVR$7A9ewa^(PWkK_<4JM3^sZC-rV6)EWd?=%q6Ovs6;c5*cG$
zDy-CY-it1182QoNu`w4NB$rTMq`O#htQi<zvXk25v2=Ghkdv+SShqxsC7moLWTy~;
zVQjZXiXD&^&j;D?T|Eqv+OCMH@+h)EP|e&qQB3Y+2f3g6GXo(*=3F!GpZIUhi`XCH
z+{V~1AX_jHMt8n+K`g}^djZu5WH5x&lANQ^k&IJMpV$dz%MkCkp1i}{S?+AHbR-GY
z76CzWWeRej@K`3(NO@i!o<ez_3Md=aXBb)xZp3D@fC7yEY#tY6;@Ccgq)*y-#Q^i~
zK@lwPR@TI+bnJ}73kI^Svjqqp%95!K*0gjratd#L#B-#<R!Ih>IH^DupeM0si?Bed
zOXC@_#9mDCV_8Au$hI+8DZ>QMiuzIH!+sLxm1X2%)z685$CH&iGD%>3^_n)MMB9s&
zKIzB~ZGZNwbPLw7R})th%%vJWg)DJbaYefd-eABK%9FYE8~Zi!3QGq@k>@12GkYTs
z!zoIV^T0ancpM2=s{?>DZ6#W^UI5{y#sT><+7e7dK)s(Y4@5OD5ioJqE(~%SB}9{g
z06{Z0hm4rKn!GQc4T6X-z#x>G2>~sq5#q%bn{7sGjvc;Fo|MURTPnhE<R~nN2@AxH
zoQ#%0n;cljQYc%SJx9REVF%Drpb$bifN=!ikvsG8<oXxU9mz+>Dl$D@VA&?%19$Vt
zPU?jl5T|4ff&DXv=uW|-6F7I6dhh|^fUmKvEKE1tBxkbWomg>c)yG<Bd*caW@SQz7
z7T!n+I|m3H9H1$tIC7e106Oy6qABpQ1K7ABCm0#27hrva@v@P#ZM$m0r0`C;2h2X9
zRo7w?5K2gsG<r=eHb?_ds;y#Os2qaAtzHUP>om)S!^hr~RT7OVLf*ro{8>fZ<<55p
zffx|4?LhofK%cOF?<TXFxTc5+=_m_^Il|yEoJFt2z^f$(LXv@WYsLjF5?Tle@)?g)
z6(ul-B3Ou3Os{J!P$<=gGw&(og&fgDorxRERIM|4l;s?26i0#b6P><6g-DOE=w~|U
zz_wIWAo;NSyQDIZnq<SkOLHUAmT1?+%P4-YqakHwN{n0iN=1uitze}P!27CQC1c(Z
zWri`Vi8Im&DLsv*aNl8Uhp^Kv%!9Q_EOp?xIuyZdpt{sV2SJ8>8^kGRE=*&mk792O
zv8+sUAug=Bp2E14pRO{Htl<DghWH?po!pGT4gslZAURuD0nVdPiem%-gtfm*=!S^#
zIBvj(?j#!rCmFPs`w?{ER*(SZ2??3gRS$_t6iD)e1UBcThVtKSnz$`ESWst;++E&s
zvI|{kC-W(Zh{!sS{(?HBcS+F#3>ZqH7EHp%51fKjh(1n+A=*Uxx016acG`q(Ig|*O
z9A3PL{PS07I1*;=X|GClh<4&kL}bSan<*J5WsdK)3DZanBzjpAb6+vAurc@u(zRoN
zM|`Rv0l?zS@N}v~ITUPL`LipM3C5~W;bBJ+c_D`pTCP-oL{6AaYNAhKBJENVaKMI4
z+9411?!oQP8Ck?shHI=uMGMaCILI6S?tR;1T}%7_BzFFYGoXLr{D+PUzMcR43D*Pt
zk7b0Mds3S`9*)nS|J3WdPgnJScyL(%cK-8cTszx_*cNBebQW_4x8;<@9vrZWKL-_o
zt;R3j9YW%d`O{Bh%CBf;e6e;WCSBSoZ)dUn@<t=^V}SRc#u7<n!t-itCmvRWW&7Aq
z(2``?;RsnAHV)!P%0pxMYXLC>Xi$VE01548WPD30m0)%_JDH!)@G_98lNf#2LM=lt
zv}1LWMT;NhfmjN3qDfE!B)21EzyzbBwly+FO2oScm166aoz~Yy7KH^9dkEg=&?GG7
z$C|DOr14Hj)5LjhKx<Gec~K>(ytPDEE-Ts_IkLjQgj)D1%_T5Jw0f(upo#Z*HnN7e
z_6b6Oupp6~5b!zQYpu|tY0wn?OSI^WT|-*l7Gd5_q%#Sm^vGsB+fNpPUnK6uqd3i6
zM|wPu`a>HViurL1E%$jVOW#YA#c5lF{35`Hd&o(Vn~OOTyhlxVZv+YgYzT!C4Q3;u
z_HJpftCDSx^0!fXN4hUq6D~TDB8yTP6mN1;xE5O#pK<2)+rMa8!s@>4zi#wQf#<7U
z_f_lMJQt^L(P{EwVz1S_=!=VP``qkVqR}}Q^W*z28cGcdGfV6#=xcP|3iHiX&$KMj
z?a_f^y9Iba&}(%1Ez_!qR_CmJectLcD*`b1+^yZZZ1pj$->nc{0`_pG=)M$}X7B6*
zuZ`1IyVZZoC||bv9YXgK_!{D>(d)O)uG@{CxVr9LbuETQ{GGR~vv#9(X`Ult>;SJY
zUzwf0ur3<y_6ob**B!G*3>0}KK&K{%ZJf4Eg$~@Fw|eGTpV(SFok55ovW-x4WuCR@
z!F*$aqeky-1z<Tabvu^%k86xWzc_DPHk#mZ>kHC>hR&{g<|Pr{eMxYv>r<=W>R<Ow
z(d>55S?reCd(}EKtrOAiS}eG0%d7xNzd`5;3Z#Z^JfB`$Es`G#z0)^)z3VGF_AJv8
zFeC&SH26H1WZmsB&k$C(_m<$2Fjy58@%q9<J9OUB?DcyM5{Cr=p7o0(ffe%X7nl_t
zv)OJn&CZ!gy<GzIx@DPVrM#9!V_FLN>jp4i6Z@<*I-%yrf-P5AwW9S>G|peOh<GI{
z8V{4OTH1Ut&$>Rl(9$Qj*fER^Zxp(6B${UTqG4SOE(XR1-aYKO3QZWM58;1IQWyQT
z$&2MS><~WHMmU6m>23`M&eYEm`oC<*dqkj6l+H@xgRwzhJ4VJFJ>hOy|7-TTTX9)z
zJ;C4FkOIs1-wS@Bje2=L9DdU@SH}nT{d_ofB`c$^3d3XZ{JH2{!#95WZ3)(PTrL|$
znGCGHc{R9fyb*g(#m+YVZtscb;&4w8bv2eMn%iDL#B%&HudL?r54*cR)c3`XdfPvG
zc8KS$1&GH7b!2Qbv52PK=npPo1=VMVwcW#deec=Pvxfsf#wYu`ou-0Nf3~}(2UDrT
zNM}<?CLqHsfF3BQ=Bn?&a4*2zZe^+2Y*_u}me=NLiv_E_Skv^Wp=*E=_BF$~nMNBQ
zMN>xS$YUH@r%o2EVDZ8#qM6BHhffa%DeLEC-t=ssPOncCm<#0Rr#xUi6gSG~To+b!
zvh;4>7Xb9=Q14R^3P|V#esWT5<(YgA;id4Ob$wXERo5I{BbN5pU<+xle)6DM+DZDb
z^-iv9MLx9-1VbLI2gFl8(WmBp29@rcvx?+nJQ*TgI9WL3S*you-=P2Y$`tj5b7NtG
z2e(btvA148bf!TaC*;J5v|~E<$2<99LBaR4o4t3%F^;5DAay8Gq3+#x$D}xZuG2G;
z*JT(;h4cY819~4E3wZqQ%BW$Kg>G_lps?vT0uGxSFaq6H&)e)&pJYF{=JWSxtbM;U
ze?M<q5SoRQ9)6gE0|Cp@)#D1}#<uHa+Mo246~PzgEJ=O^(1cW*o~-M-^W5C(==vyP
z_3}~VwqZ@|DS4dQa_t@`nL{62=%rde9;uI4M9FRBxkB&5n=(C%qS$4}+FJ6mZF0du
ztPbZ_dhAqnluryY9u3S4X_K+VCwi+h3b5Ap=MXDv^r%HJ4+)idiw*>pr7*S*MA56Z
ziPm+L_hIu}Uq<!`OIsr0>kz(fTF(x?0^=9i`x+k4<)^gs1?7BJH%sH^0liX;%VHaQ
z6?+{qEb!k2K}qm;fuP=g)P@Y&cDf8|F>$Vw?fcnUPI3UBW$7zne4eSV1ac{3hYmZw
z4o)#9%omt7Q@57{J0B^w!~C&)@|iUEW1icp8%4@RZcVZ2-+f;7?Rwnn!TGOhpyQBQ
zJbWA+UpW6i+TB|{|9!f5c=YZ3_s_UCp6p~vyfgH|9U0z=I2+CkgA!0D@+0~P=WZb(
zs;F1>p);0g7SqS)n7&v)*)lt?ZZ`X7?{f1U?MOE_%Qq$3EeEA{>a#6P9q{qy^Fms6
zH}R<SaPNo3sx^#!_gHN1{cuv>EVR-$&112@yJ&)uqM^QMpnAX%O?!)`nWO_pwCxu`
zWk9)quxJVFF&#Og@o>@T%xnVov<ROH8}^S>N_WF7y;~=Z1+&~+`seQc{>{dRMf1mC
z;{yhN<c{5-WFXKQhU42wBCM1?WvVaj|8=*;5@Mk!84%lwQ_URnle557Goj@g6$X9y
zjgkJg;EG<Mg5#2==VNJ+DDz@42xK~m+%2W-<qWuB57Hkk83fBjNybp@oOLfR8=Z3t
z*uaOQzV`E%ee7jMk*>|5Pq!}aL)*8h?8|oDYDi|XlE%2wSM7;RtMuuc$^#s##8V%S
z`J-;xFdFT4_qBOG=<+$4^;|JfQs_(K`3v!(L`7bnV<-HIOkaLfN-pKd^|-{hZ`Je2
z_7mh?r2xA_8CN~`!Bj<so=B%C{CG^CkFnu*F_#X_mw*u&wo^cm!_rb&1xDyFEsctA
zi65m&v0)~YB`jK2#UWE~Dt)N>0TXjIXw-MS)!~<$cbI5rX;f8>%Sf_BR%I|vXH_Mk
zFOraWLFVTg$;UmQi{?&98ZiF{#KL|wnML@!=>Djp*VK*^If%HN2We8^>I#y;g-POX
z&5iCtD%er`YxkZ`j`&&6p-`o4+K$KccB9-KK8c)c3yo-N^qQ|~$;2C_3r9c@K<CYF
ztyX_W2X&=twX|f<3IS%*u)SKXT7PFO4cHLXD)!(*DvRRstg#<KH+tgIP$0{}F(y5&
zwBkT>u5LE<2!!hAEYSxesZ?^QksNvj=Zd4<K%mTP==rn)tioJ3{6<lfPkS^n=5U`p
zSGM&4@~urlv#7ka$T^zx*kv+42l9bHIT#ijHmD?qzCUTT(Z?d0(ibLjGB4faa=gq>
zy{S*-LSz0SmaM=~leyTDi&lQgB=AeFr=c=GMGv+fs`fa>no#?H3Geyb-iudmMDtM?
z#9~_M_~OJLe-vLS*@r0COe|Q&10cC7*(WQ?B{!>^OJmr>K@;xAD$uzG^*XN!s?Z#@
z)~RGE2<*@u$a_10;wa!$7;J?mB*oxUQVF)>dvJ3Hn=U$`!-5>RdO4<PdI7f!zGPFx
zsHM>$S!wb@u5@Q6Z#Ko|Li~gfY?T1s*1$jJF)l}e#|p`GktU#p$XrlY-S~jEdBiMa
z4M2&h<Z2HrpW0bjwVxv|+yY%?J-p^61N(nOgRF8jFy`c9SOHB@!I~$GE%1XzrHj95
zMJ&7b--zFe_?wR8%WFeEg~`ib3}c#MGhKS!=yh71=CN4X70qkyu#u;-^;_HXY5(-3
zR8x7Go=ras!TOc?s{CN%!{%J~n>9-7KEg*KVcV^h)RfIlJ(Y?ZG%e~A`n-r#l?%@+
zz>8#+{#%Ku#5HqVH6KK`(*0*R9}3htu2Kuu9P^K5qP!e5;Bq}pGiO)}Yn^{^2Oo3W
z(0t?|byQQ|`c<93`mw|?R}6i3uPg$as`*!{cp!vpMO2}5AekZ2y+6*;t#c*o`c!A1
z;s!QwO<!cKcj89JxpyU|cm<QG{1$+VM!>eGdMImH_VM{JZCJRGnHlp4w3xY;PR@ht
zdq=fh{8v9d!bVu_1(+f|c^$3&h>Lys*D0ztnDn#|F({#L1D_QVO<oa%y!TR3|8~Cf
zA9g)B|49c4??P+Nqv7~${a=0epk9BvTK~uOpWn`Z{`hNs{on2nRR6d4g^E1-83h;R
z2{)qOf~bnXzhYh9V;AQAj>^18EX{kw+Pudr&U^Igyhkg~`&OU#2i50^Q-<}eKJPDC
zpO+ifSJda}g1Qn%{kS$M6^iT-B__4W3;LqyC7~T|l`D8a7Q9u?>(E|C@g1EAyAm-d
zwpENmpZbQHHf0D`cFt6qyM>IFe&V+6l)0v&`j{8n2d6<oqoXp7$HYJ^ClpN`uI}Np
zafPuh!*M!Uuvbw(`Qkr`_p2=DML{E~9CWHLM!t=G?f2pge&3-wI}65GreZ=GE?x+&
z4n)K>8c;ROF!SFJd>NJtpJQy-?a>dQ%{ZoS(v^}*1F;ivq;x6p-g`k7&}M_Tb_{!q
zVOG&sC74x$St>88VDzEM*#O>gQrNK1+q-{1p(9%;zdzyg{S_sb#V89MbyP+hBDHCx
zCBicM^kXe$CThV!S}>9^Mv(gQb6i^EZf&ejAyqu`Z@?BH6W-*if8$}k7oH=^*S}&4
zp^V{}&{yb>`3A8?-*M~U)-?Ng%GZibR?nvX6|JIuD6vDQB}V__6#3?Oi>AMML(5o`
z;M0#nX}^D0{y+BqeXoscOB99s-!D&5(b_Q*6c`Ci9NUn_Alq~>cq1Gq?fB3oserPD
zN>NG1WX1g~`&ssred9K-HA@oMS-tw4)^9Bbm1^F`9COTZAG){n(+F6vCA$BCyJ8VK
z;-?g~nNm&yVichFL`7<LDf}~mJ31-k?iAr1qw0XLQz$S+4MNArN@1AmxG#zZlH&P#
zgrAl$hryDbQ~u$MV&|6#*h|2Sj3?>|bb75>F$H%C-^Xx!>6@_~d&`u5RBbILA4$i!
zAT*`my?hCmGKVgs7N#p<_psU{1RZt)FeI?6DIT0hYLeKDoM&q*$3N8~&cHw%D!ygS
zUA-7bwg0u+G;cDk6aT&Ar~h_#bbR*gaQAs9T6Z1;4xGV+>dhxl)*D941*qOhNn7_J
zy`cqw<Xwn2uHXI_Zr`kIU(vSB?OIklw=G3kBj24OJ4n%^7r-SA{f=I7M;miHx*|3;
z*vC)p_N&v=L+WU=;rD?k^8sUJDP_xK5CQ`n25SAF)EZ`hVcCdAs1!kvbklQ`SMVT|
zpt8&TY&EJE14Q|1WI!_mGSb=ii*$B11H`}{9(1^`hrtD=I`np&qC(FG6*~r%38!^^
z;Qd0UA&$mC2cl(wlKS&wGEjdq4dK`Ee5>c`;HdA`5mEPtxuCA#WM>Mg&>5RgEBr;C
zq8Y_u573N^%SmYR7}I~5jIV}ifdS9sA<`UNn!4q9X7*);Phr2wlM4R-3|RYPqHxD!
zy2RlAiqv}U*>j5NNH<Vrjh9cuQ9$#p^w=52S<n+$2O7BQ2p_a0ygoWO1q=nA4fsd6
zaGkezqC@SyexJN(8x7B`^gaqh7YXHtVWW)}p)fd^?LZ>x5(4GJVG`*?Ft*z&ew;fT
zxT!1jmjn8h4WV;@w7Mqb%zjtY;s_Xs-c^5f2Su*N<C*aI>_8?2gN6%%<!xHF=|Pae
ze#r%QT`@C!#2N%``&s*!hP!Fh<qGs!;Iirsw?Fz7w=Dp9m1+m`tx&3<{~CCHHi+)5
zRPGPJszIKAn2vr*Z{C1Jnj*{B@5XS535^+_|1|cSQYXL6=|rMQ1g>R{5SMJ<i$6Nw
z9#I570B<-Q4BkSwm|Esti3fb_uhpL=(D=X!_o*7qme|QgsN)NM9SA2Z6y~j0Nj9$7
z9#d|mxG7T=Cb^%DCpRlA{ERZu+(1{9yQdArdr}9%^5EI8XDFP3tO=sdq(%eKP^&vx
zU-}CZE_l6751q*&mRb;-F)Zc4I@pVA+;w?q-3cK0t8qR`E-39qLHsgw8U0LThHfwG
z7_M5km6e4AZ_NAjF7j3Cvy4=#x@WszuQ%w6t|H4Cy=?cp+h^4jFy%LVvaeHXFva&1
zw~wsJI2|zYw1#Y8o5?sC7U*PR_m0_2E=Ylw+ugwG&PDIEd;Dzv)Iet7^(Y4)aS9>5
z<c&&OqfA^ZSFB;zm{2H73rY23cMiL08gx_2ZGn7zKm8PKtVMMc1kQm6*d2}1VgGnI
zxOoO6Hta4e(xvZnAhjMr-8~JFRDAlQI>)0=F!Uqy?XlOd1!}l+(J)5-RV=*nEsXcE
zx|^LF)FBI~UrYChPm%NeGqfe)^Fb`b!+9YT$I}Z7irvAj?)qsDuKx4Ad<usp_||7j
zY7P;fkT8s-PYVt|nm;vo@(&G%06C{lB`u=NbAWGphwBFg=1@YeF6|48cbVw>q{z@4
zj`Xj|gwhJ(3zT#y#cW#uyH%x}w8cm0|6@ZTLhwEzB8yRm0hVfrsq`*-#H%?^-}@M_
zj03@Ye_Ww5pjXGs1e>ll8_TE`$j|He;&Q{<A3S08_uIe*zK@<n(g41!toS!G2+CvN
zG7+)pt&eZtzgyiIO~&qJiv011Y(#*C^Vhpns$tk6#K*pIqaoT>y4(>!@1vdVXagWp
zay+RgZ`avb<YEa=jQ;w3sZsI1IG3dIzI<(0zTe^(Ci1>~J*D^I`v!miZGEXxYK<!K
zY&cC_kPxsCt}83=9PqiX0d|?AVqR*57(MY*44+cMmzdE`or2F+%p05GNqSo^Jw*cC
zlvpU#{g78i`xD?aoCzi-yUI&IarKrqNK^uaJ^=8Hn6gAX5XMm|o#6<g%rbrlD9Ymz
z!)f5z!AZ(FQc8p8Abx3+fOf`MjYMF(zu!J2Jz>Rbzx;Cl=$HG@FB{lshStw;8OrTS
z7wmoEM`Y}0YMqnh1Kb!C!H3C@;O1h<E><EPi)!)$=TG84^K(T{@X!LbGr7UuIT0DM
zz2hs40U-z|{{{*y<P#;C^6ZTSxLP}C=~wucPbja{jW}vVAG3TQdR$`K_|`<W4F;u5
zq9}#gPj!#O(Nx4%>U28l)1jV@aPt9I{CgG-_-m9%a4E8GyItnZ5XbPgpwty=e55%*
z%;RcQBlh596*yAMMex`Y&X;8?>2F)~c4TsUe~@M}l}Gw)Ij7L(A&YEn*^f~RF02hc
zp+tvg6JaL6>;_gzf_Z}EUAK*NbX&cPw*U-DDz-<a{Yvwl#hlXR1S2S-IwTrsJvb^;
zO?qF5>L>laJotsFCO&Cty6N}uZGE{c8}WTu{zYAt^(xSIkY~{SyLXuM_UE=G$=R`?
zg!(=ZKKVfSC46;!6<Ab*<mi{Lx$a-)ulvGZcf}R!tvmJCU2)T@X3lkMJvcSs+W0RA
z7hqiwUf;q6hKykEYE&ne&6?a7wGjTw4OIe%_gXuM{45U4Zuu(M@|Cpw8o-d{Ed-33
zthY9Ma5>TbzTO=uw}s1`#<JuE0VHdld%9Bpbj>*?e*sld3%doTR_%=-SP<+Bbf7U5
zFRsPl-2TPop5;!4TMzqie|xVKM>F<g<nPC;|IYhyo3rwD_T!bmAFPLFHT27a!@~p7
zMStCG`?|+y-X)dzm(=d;W*h$9wo$s<HvhSh<gY!lyQlxmhxUJV|5ha8)&!!o`+p6I
za3|r|idYR=?`btAiNoo59JC18{xQ_QrLPQl%Am>u4c%-oe0%iEyXfsN_>XKF`~|EI
z{M-H|dLoL~9r*eRzS_#zop;Ld@hw@#)w{+Pu=DOM$+%84`)8f4rbs7czbt`}ZC;Mp
z*7R5lulCkByP~bu(YE7d@z|J<7814Ndn{ewBf<KfNYpk%s*S<cjs|Q?N|bGJ=;RIW
zG3AMYf$QdHZBQy%uh;+;t5=)vV$&*?nb9=K?}UtUwCM`O!%vk!{u;A0B2C2<X<F+F
zsR0{O{r4Z~ICm$T&Y$eY?8$D-n`}Ec(G6$LHf9CkI{L@V_0^(twF#6z;d!2r&WX#d
zqf*ad_Syt|k|up~K&)v6O}WNG>>UrGN_r4-V&wcfan9I8R?<fKWVtSZ-`E87>2&Y`
zI}mvK1W*#;RFj*K)mTU;X?4+8FM0w5bO%Tx-(~NRR0?@RlIJ)mykqKEqJBaf!=&+@
z@)W;JaY6>a!VZl}RUPzNR9=F%iaL5d9AqEp84jZ?K;+)8zKDO^7&dzqOUbNRbLyw(
z$#gI=o`_^@9p+{NW82{mm7M6PpA>A!g5LXiDrG$e6RO>F6T#i1#y}Hggw+sa?&QU&
zI~Tn&>EN+~lQ>3ERRiguxu*2&;`CIgAz%_k-pfcWtK$q{JIRHwwHCovqDr2~DK{{F
zZuHK^8rqJ_@7Oy@FK(`p0X*v9(h1zqw?u4Gd<eluTYQI8s$zsci2sXr(p0aof}amU
zo!mwyIrRK7MQ7-VDEl#FyIbUg=_Exx^e5v<hHW3LvB}y@>eXVCay)bXf|)5Z2h~KO
z08$C_kP}R30B2ilF>#b4r-TNDVK!K^6W`4u$N$XC#Ph|OiGL7<z8i6NX1b7XpEiE~
z%qBQ?)gbV&J&rJn8P@Y`Tuf{$_5Zl{{f~R!|LfiRU_x(<A8$YBt6F@OuTwo1-(`p%
z{S>`Dkod~90}PVt`qaPosV<Oqoa*DnofXQ<U+A*?^Q-nRuMSSyZ+B1M#ry3;;6)D)
zj()<4$UQ8MQ8L)|<qb{^xd7$L!dFi+h%R9k11ZQ=_F5tvHf5Pb-bDPjY*3?Pu)1Y{
zg;;YuS{C(ZBBcS*yxjqEKsW4m*LU5KY_!20LUbZ)Jl*?x7M62dVYs4LEXu;oBoyM&
zlOmqh&8R-hRLn5p=|r&d5%NDpu6A1Oz3uqp;4I!^{4OTA5QoJ<^2g2jI8D#+k28Ve
zk5Rw7TigtL`}Deadq(CSX+)14+%=zmw==7qL2n*^w}Agn>M||czl)v4r=R9dRj#z@
z5X&hV*DC08L2t2E48z3XNoE(rWbl$AhSNSfg+{YhwSezsRD-G2?Do>7<^5>@<a(4^
z`o%?@L#-h^A5q8A?Cbgd@uVCFKz`(I>~i#v@B-W*mp=;zU*P@sS0RIT#C3)H+ag0y
z!Rj(ZECwkADb3oy0dKw7x!V!7VuKXpBE#Zxl|3y2I_YID?5f~LFqBKy(hR`qtP~$^
z=~lh~#l`TsGkE8&G<P9-i_=yl*1fVEA8)v~@5{Zdn1K>$m_d=PrTl-2Cfmp}OObs`
z<hg@N){a^Ts$d(p3rv`CuzW};R<aZ{;9*i|*Oj0Qb6>YSw_SZOWhkGovcxZ35cm8X
zTFGQV+E7XMjOtWe((Jvd5*IBc>pku`u8<T<f-}D!J#mGMQn<9dhOxF&%CkZ1EeAt8
z!nGsw+krVj3Xp3t-=zU3tYBGZVF_kIS{=X<D%g(cI^fH2m10FHixxY>+MFfy4lo|1
z!#aVPP`V^kSzhs;+TVVwECvPUN;Bnp#|4VPW>zZR+=(;yrW%Nrj~V_e&MM|80`$XN
z^Dkn!GwP8TIvl3g*e3@A2gk8lk?wB4U)n{j&Mw&waeZfiFwmPDz4Ma}?~NsOu3hrO
z0Yy-)GkeKqD}1yV5JbbcWDSlJ#*4&a_+T&UxhJ77j#ZjfgoO+oUiZH#R$*ZhRp%H}
z^O)&LG(HNGbdFHUPO0F8tE51@>~~)e=`Efa1zF8NFGIIn$nUs-&xv;8{`HHCaej^G
zxXus5Yc`O-O0RmOn|dAHgqIuKW<_W!y&PAy3|;&c<PJacFF6PPHFd|_jTd)REEX=x
zVtAd6hGT=e?UlwkJg{tej46wRO(1t`O0qr}bf@QUH(C;~A*2C*GQ?p4)u?^f@nCbV
zx?A?U0sX@47wz?Sifzgyjb;L))V70LXK1m@7x(H;D$EvkMdI$!-Z7@lIXgIV<g0?t
z0)hXr{g7$gV9;VRQl~d!iE*MYjku1xD(9e*$W#Bh=R>at5F9H^2bvw*6HVDr>5(ZY
zFfDAQ7;Q2#D5&#-ol$@C^BsIt5!_Y+dKI@)8mb|^Z_6rH=&RXvnMQ-=qhHcUU(wfk
zWe3(T_302P36M>Fs2cdvjvB@tbhT+Sx2aBl_9&7@7TCB2m1HM6jaE$E0O|KQRa#JW
zC5rY>N3~?dBOCB*<&C1}sEJYgza3^RtM{jbU$$y^@97lN;6Q63(J&0}P7LF&(qAi0
zjcAITUCpwoOBkR-BPoF|Uis=6W8??-%E5lH1I^iyCPE>7`rut}PH0*sA8b$UXgU~>
z)nEM(^w<&_L0r|h;)2h_#CvgO*OlG-`(pVt=ysKAjH|gBJ%*n`n?vVAz#V-TwaP44
zNpQIy<0&$BViO~W+xQYhz&Sz;oU0e8@n;S8kwkcto54#;i3At!6{d{rA;&{mOo&@U
zo<m#-hD#H5t_sQtbHj%Vb6QV;BTX=M;gHqiT7hm-->8)vn9RmPG$^(FUB(V(%3^?r
zCgDQ$UZXZ+hIr%yu^JcV9Hr7C>{zRr8V7vAVTXcxhxbPB;5E3d_Thb*4f|ZuLEv(%
zK;rwY#}2hYs183F%@jJHd12W0*{P&tp@S8#d#z{q*#+A-t@apQyPx*Pfn#fUKzym3
zJcqewkgWRj*JGQDj4{~m`te=V1`F^^>eV?MU>@J&Il8Q$%X+Elt6cro#f{5W%!z(Y
zzRPd*LsbiQRlU)0)0@zXJ6<O{Rwp~UligpePG%B8Y?w;A2C^pb7xrUO2Kj0_i2w3L
z0E@9Nn+>IjqN~Pv5A733k(=^t7Jq8HN7oIgfNzi`%a!$F_oTg#4cgD!CmqMDTED34
z>%y?om3p}Qi=X!eD@XvdYSyZS#X4g6a-+^HFT=HhBjHYF8-<?bV-{!ao;28e8r$!p
zMgKa8?J*2D@4By0%y=zr>a@7Hx&TE)tmxj{N+s*jKTY`n`i;`BW*vbh<H5N{qGqsq
z9{qBtTR%kEs++F*l(BnL+1jO!i;KIKo;{B4VO!q|$TR8qlO$s7F7cmnnycPC8Js|u
zlIq)z<|%a~dC33bn`NKoviRL%Q~tSK*oqHY?IJ3Ek8G>?a*kS2o&n9}RJH0pTIeR>
z%R{B<K1z=8ZaEm9V-mcZ*>}l2>d7$R>F5krOf_|{3(`xcV$NI|`B%_HLg70TMiH%e
zib@{Y9b6|j<mF24bt$HnK6(1<v%_O_>%kgJwq;9u5yRFb1G~b|vXdD0D*1r5Ovd8k
zqteaxQp$Zv%Yf}pdl}{m$IU(`pEA@#tL`ZCDSAyyO+2p;Rh<qSC+F-}Et#W8ZeP2b
z6>fnREo+nKyt<(}$F!Z3$-tsX33+-|k|R-QPVxyUG+iRZZSO>fstjYIepilFmS+97
zw%HknBlvDG$By#`10i5RDZO3dX8sYzp&D-orM;yZV!ZvN8cX<e!DF<`T4Qn>%SPLJ
zx4?q)hO#wqds~z0ti-d;aEG_B#;_kEp#xL>FEX`IE6a=mbjBD8VrwaJV0A%6a4Zdu
zocvX(uI%hx39e-uksYwi{G`!b%p!7o+W@Om?rImPSVI{bc|8<qd3v&Y`209pU5yTO
zQgF`0_6bhGMGl1N@`@7raW^{Qv}*Z8zqJ#st*u$gHT<TdCnsZk?{KeUXSG*oOa8WA
z_H%gEOrX?J<pxkv;Q`tnDRq+5f!Y&0yN1~V#^l<dSJWDw<wQ??o_2bn(Adu^%GHM8
zPW1L*A46OZ+eh#(NU|??PxoHHx9ABV97eakIXHcx9_qkWMuJZCgtuqM{PAb>Q~TEr
z#epR|^q=m|H?ucHRy56qlZ_T!V_B?H<JmD1L%8vKmje|TK`=tYvjnTeQMVMf0*tM^
zALHLrjg)KOlzWpy)O~Nd#BZisS8v#2y<uHVyHTZ#UnuPpPWLK@Yn4msSqi&oRV$%G
zm_&J6U=M30M@7BjW=Vh#b^`kw?1X`|U?(=Vlza04zhIvhR&pj91*njwc|lt%YF^`e
z7FNY>n2-8s8S)~h6me-XoQ@usMzztCjB7!BRiCQN2&I+FF>_ZP?L^Jc%9BNu=vtg=
zbF2a;_*aJ+FdNUVEkS8Cs9gPL=bMvVa-|u{FWGfoX@y>475ri#;u-&Ufsas^nO3=#
zlFzSDq1mlkek<k!a6r_F!hgdiIqR}lpE?c5t-8Th?m?Lk&e99`shv8-FW{;uxCR$y
z;ly;p;$uWSWf1~9Txa`e<5HlvoPe;znHLw7lnWALJrlG=vrLFJOK?D-A^RzL4aue2
zD1|s#n`!Qxz@CMFyd}EOe|{`a3!gVI8DL4DQLoj=_!5{A{U_X6ck#~Dv?>lbBhI1+
z+r^(dCHx3O)Q=R~LlzS;ONybOW407-iIS^sb}`MTSjlCaTwxAR*9e+~gy9n1c!fq)
zh1NIG<T_U@?4zh$K3sij9*uFr#gXO2T7iyktGr-~O3JMbCzzRlSu=L#R697QO0`t`
zqnnHRMm!fO29CXC;%LO{beB}4s@X_0fg@R)GhMwa`xHm0PWxm$9ZKXT00UEvkF}x5
z-4G@IHP90C`rzmk*f2CrHOU8rf9#fioCOQm2bn~kGvA5q9&oFRE(H;6Dw+`#C8j!^
z>c?c54F*ZnzZoW1R0=P@05rRz-_zdZF#COqQT<Ax)tzPovS1|<)euDw0%V&%#WxKs
zN~`1|1rW_WCyvmY$i(%}UFYYnrQ7R(JU2q+gXs!AQK<M4RjN!TID@xY{QjMd7MzJd
z%^O#}yS}!Ttv2K6Dg5z%wYe4@<r7ivQAX~M=(-7{7Vc{q1U-OI2cq?P;*dqT<qI13
z{Yo7tztU_hzkjEet+F2@Xm;bLjR*v(xAmuum3n=*v8)<2-kFHbF|CLaY$w)E5s+iT
zajL?AvZq2jM8s@ZOwZ4=9tka1DKHy12KFVtDVzqm!fr<)uc~??3sDoKA})IgUS)dF
z{xsDUqOhw$c7;_NsU+o`p=ou<F~}^IBXO<M!it9#%kZWvKB3cw>gY+-Ir#TB1!QBv
z3-$QES><+V0K*}0*MCgLH<H#|bzmtPzlCSB59UD`{)-;U4ta;^1Lf?v1|-RKMg--`
zIvJXCaj)P{SEzGef6uSK$Je{`dLaKgSwF~a2<g-NpwG6<7|Uu6Q*+EIz||Z#RM*6A
zsRQ-l11PU%1-%+%Uhu%cNp6&-6YCyH-oi1a3}@Z9aE{+qO!t(D0S#SOwNLR2;A=WK
zZxD&N&O@^;QXqSzrPsy+N{GT10~DQ;9^3#ic{o)sShAteZR_-?$^;D1(+Rr^^)MPt
z3#Lx`wRte3KY_#nR2nPIAONd&)|n2i4i~3u?8TH5gx|`svR#mC?WU9KRJ`6T0B{Zn
zm6Tm}f<rb#y}<1=E!+vky4e_G-MvU@_0gCQ=eB8sBfzBF@3z#t1i13M7KEwi9d7g^
ze|tpVsu*UU+3V1yMf$kjWD3}Xa1zh}3s~b=hMLLXzJ{3unEh4P5Zpf9r1t@<XU0H5
zCicCTnV9nr!~A+k0terenB#ni6%YHL$`>>%WpJfPS>mpV$tWm+49-f?VheLlbm)ay
zhwhw|Ys++%LU*h>=MIR!BGl@;7q(oyNXU>`EAtWLgny<yh-t3a8}S#cIG01i@)@zJ
zXo175?IoO%-o)qFlLx!*P!&IGe`U=#=C+8}vskavhX07wv-!fOy$K`&kW}#42j5tt
zKLc9*E%VcseO|xUFdJq9nmYTPv!mmKql42JneWHmO+=I~!BkNo$Drgv8=<O|e56}H
zy~-HbXzd|3PxhK`9?FQKJx#d{^)caU40^vE2D(}}c$tjY1G!}#QpXvZ8D*4sNYCZU
z=Pn|ucKfnm>e-8{(HMqTX;%ZA3jkU0CTBF|mG<6`zQH}jRi6<AyoxIe+-LW#iVJwW
zBU)Q5r<y8aXqt^=5*9P<d6&{My{DoHFxgX{f1qQQkoy63Svnw$MQ>p{Xo3;X)YALP
z^iE;)4?L6U7_ST7>|hZV_XIP5gSs#G_+_ijGGTVkZ}1K85Wk=C4);=eW7fTSm`;`o
zs@uxvq({YBC(7)|`>jYd7y1cZcwBsfs=Sb_AH3W`u*(qNy57V0A!zy#U0p51!G~Aq
zol0on$3gM{pj|c6XCI5&4s{Wb@;P?AHjtU<-b{>KY9MLlptE!wc!e$v253T;yE4y5
z(Qaq=)j}9boUspO3{{!2Ts$(Xz@Otk?`=Q^0f_mF@O)oqMJmS^_7>0bdmzYYzm?El
zW{SpT{)-t-;lE-$;8Qs304ef#VgHqJD)o5H^>k5Y!xv?u7G<DBW>Z{K*_e^}c;@&h
zsn2`=t<p|?t7u8pzPLf88rvL_W%FGYVDw@M9nbiNv#8IiORiSzVJW;xPbnmSIc6Eb
zH#5-Awr#fw9c~7NzT7I$e>s$=wPG8;0<3RUyE(5~7Izykw{C^8Y=6b1x_6pXciyBZ
zNtq4MP%nCCs|J>xw9RqqGmC--SmVdSqSGTO%S}am%GZ5KP9a{Js~n0QB#w-?Bl(KN
z%B?{)qNSE87U%mE<*}>14r6TvPX{m70-T=(TUUN@qh1uFXJL#ry#CvDYcP82(ER3&
zJTr2y(=VVMvsjLMs4Z%FyRyf+Bn?C0?lGZD-Rb2IdW2#CaB8A`dZa<l<{2l25<Pls
zztJtf(bevP>|g_v`j`Lt{5Sgm`ey|Og#wn|FUGz5MQ@yqP<~(QeXTLp;j^{1iT`bW
z|6twz@A~>iv-N$m`7h1QW^3!ggYR1#@LqFkedGIoiPpc?1ZI7vNDHIrU#49^>*<X5
z=KTKO^mAYG_Kt4G*~R4~!gNNh_4OZCTkFkM9Cebx$AqNHPBJ{t2H9woM^7-AbDaKx
z7s$m`k`1DMPD%;%ph68sM17Hx2ptJ^QNI&JHXz>JDY2c%iJ}n>P3ZY_+)L?6Hyb8n
zQutgI>;r{%4N;O}FMI>B?JXvC&Is!mk`6)VSLGy(C>`XO@`EC^RUo&RE7Qp%nO9Vr
z8ztSANul+b4gNss5~Za;^9H5$V7Q^*WiO4D;~8c59ApJ$0<s4dLD0+!M(quf>?$3v
zRZRtkw1A?fq5=y7vr)5<N!@8SqK;8r_46J%E+%T{?qlv|@;$ji+h>MqHVu6(o7oG|
z>pPMJq{Mun79D0qYlaD%r?drVNkTE0`pCzHD)Ne{!!@jP45)`6Q$!S)!xdWb7(CD%
zgdX5F`q4T3z>p~N^T{=$fQ3|acd9C$qcNpKmlC^#T}2@)pbY9S4mwfi_}S^3-II0%
zf4@38{`p|Py&paO6@F|-d&jSSJvn&(;xu}3e7N5}=|sCn`|$MW^yJ{_>(gU+P}}W5
z%Nm^+_-*&-*Qou=tCM!86CIyK2QOb89zcIEz{&2>=|Q^_V+_OLYm5$zBj_VKIzEjK
z4_+Re!fU6;F^)@xGfOR_<7d&!_Q~E0_`3V_;PBw|R~qu!!RZkW_YB6{jb81ZoF44G
zKHNQtUcEkfb=;xeaDDp+oxQ`|gO~07HJAg88?}FKADu>>7rTdt-g1xM9JNny0nS>V
zQeTG$yH5|>JRGcc|KOy(cZ$n0f9(MfVUmYHcwV*l4)BlmFKt-S?#Zt)bW61A_^8wV
z->>04_&wU+eYyJ_)>xkd9oV70*C*|lIPv3W<f8lfY3KCd^z~^wdVYMoPhjt~Pkuhw
zYj++;hsPZP-0My|hCxnuad_+npaws~-%nq64iJ6>^rO@E$;s<irw7MJ4cPNH03m?E
zF0|e!SRWtJngLkHC%<C92n^baIC}G<4bNfEk7RkLC%Xs^^tISKwcmtM0iLJUVxyz>
z^TUJZ?W4Um{(6iZy*cQ#8@zc39en422Y<5*BfrMw)26}P_)iO$W7^v2;90c0|MLM(
zo?ph^03|vHf<ExH^Lp=vK%bMhfAcpG1_o20l{Il6zpUBME|aGFWQ>IjoG0*~V&XTv
z%7KjK!>oso&GRRNX|i^?V?Riyp9WdidpJ!>&wA)7<~{-%c8O2EVJ}$Xie8Oj++IF7
z%@3yu`j(#^0OJcCo^>Xabrt@MBh>(Sc;JU;Hm6XfFKCa=rp1@^z;@~{=wSEaVvLz+
z(pjBwf{KI+)z0aU(rJ7NNb`JVd!EYVd|p2iP&a!f*cG)uLv%syO&_ilyU}6QTLr4u
z{5Q!OHt2T`hS`KdtF34IS%ECM9S@*?YY)Rer5}@lo15SbTyXnocY1L_0<)Vz1Yd_!
zsXLw~hyCthHcVgSc^OafJ9UNjJ8LqB`2~77!4*6i-?-1|P8W}62axzayt0=}V1(WW
z4z$6C1&?Eoi!&AL6xj%IF~B=W;<SR^#5*0CRJ0)#z<}^Ie=*3r$pBTpzz0mnY<$p;
zIQvh}o}RRKe|mKc#JfXIBU_s!Qol?-S?N%^<23m|HMNUU2hiy3uzhs4-+s3H`tUSr
zJ=hXMCKXpfT^)JDkXeOd`+%#tkA+>L{`6|Z9rFAT9=vSU4FJ<K6z%LX{{2{zL8*tL
z)9$Oym9pTDnK0>L#wcpJ%UR~l>+PT6@>Hzr^^bNlnCyqNPt6Vr24zAI>y5N;by1|m
z6zR6aU@i~xi-Ou73cm@QT#;O`jj13*2s;aT6Xw>Faneh<{Y%vjnA_<@7(`t_J^hsS
zrjt}`DC`#iI51jsy6atLgZ^05UMQIG+RBRn-ZkqN4)nUCw*e%1$6XD@8tNhl`HBhd
z_?=PihsUk~RLTq>drR@3guC65(-JPk(c?&Y3XD+ZB843dg|v9wAHW(ysH(bvbJQI@
zuIQqh_L3<Z8M0!{bWv|a*GWOX#+K@v0{)6|Pi6$<Gh&5-BP<nw>1dIm5!|W3gTl81
z(?gUumZ0Y)*V4_Zczolr(s+q>-h#C=y&fiUi^OA7sD)5I74X}o3|XcXhoxR6pGZTh
zXn;DVaAJvYiC=;<KW=k&34fnqIUROnfK9zlwb#WZokc=o%!?y!YIJTs<GE+jw)*ux
z$gaJffV4ij(dDMNq|sL!f;c|RsFsdND8&;E0zp#|rffKxPPF^S8<N<h<^{UzB0;=N
z3QF?C2!ylif@IH_pkuD{t`@lw*>v$Nln`Ta_2mIofE-Dv*c*Bn5K<%SS#K!eZK<E3
zwQLEl5Dw7KiABhP$Za;sj93VQJc>5gX{NL=saZjn48BccT&ACrK1hvMaM3U>#_XoW
zJyC0{)e`|*YscxqjG(Dpi##F4Z7?`ug_V|~8K-f!clt}zn|u<-Naa>ZO%b4PTk8^Y
z%f0mw<F=#Pdb72$`C#k&hd(6U9$aBH6Mm+`wy=9*MeafWqT9u1uSZzXhn~iDXT;@(
zOx9@0vB5KRimT&nV(E&0(jjT=f*7^dOa6xpiMQ{UDJ~o5{<cmXy?y`g-ukC!>y4eA
z&4v|JY#MOVD{f-7P%pDJLtfv+Dy~!wRn^q|YUhFvA755XH2_x-b16E7afs3b{Ke<;
z6rJ-DXCiV?_|ZsMV98NHCrMRhQEp)gN$oOsOz4&jKNNg@Ll0^J#uE=3vC>5t6v}hJ
zEDLLEm<$)O_%{G?_=xpl&;w0}*Ro3=Oc5@ifpy~5@qL;U8D2^^NMf}MqK>PL6=z_r
zRTsu#0H8hzu0J6WlpEVjQ|3r+t3%WO1+vvtDu-d|g6kVf6hS1Um}cw;Z{YTZm0`SK
z@ruz}_UJrKkU7=$^sp~B#s?sZ-~eL6%Yq-%F}b(xzB=H1dxn&f!jDj3h#NdmS0L#{
zyEha}Lg|osI_SuKaQ`?OfyknRn9&>l5kt+|Z{j0!+T4ClMfr*ZGnz;qf~1fwB$O+#
z9|JsK33%@8doZ|J<LG8e%Und$f?W`z^Mv#OG7pkkS!t`&Y*G>rhP3#pVF&|!TS~{{
zrRY3M2b6VQxJ~Sa>&?lP#43wfGGR~{T;_!#&C=GfZ}CN1e1XzTonC(6)fO^_S>USC
zXqptMzSXFmaWshiWFz9|l@9ai#bq?k^DDbMczHA}E~5ugszb!ZA0PW&i;jWXB-vn!
zp$p{kLJ%7zs8jjo|NfuI`X6n2)-yp6IHOpdoa-DtZO|PtwnuYV$Qe3=(pXm{e^g9f
z17^)KO0#C^6;8cg8)(q6lm$TTN#b&>=7*<?833dgym87}tZMqw{$s5i`c*Ef0^rlT
ztS^sr4OrZ)rAJGTB7Sw2awrxdm$~uBR{Q@oyS>s5Rd=v5y91*hs_tTSb{ASdRNce!
z>>eBi5%&@UAOjtJ_q96u&#%?d+3b##uBsX~f19(zqO6ihj3{eIxtDl$FGf`rnut?1
zd_?Tc7pXMW3D5@x1Dh|$b^3Ls887`dUXnBAC9+h9iRf($K&P6FR_U+Rreyq5&0!Wu
z3Yd+i_0h~&PIR&js^zV;<}Yxr()CU&#AM7SDf`Sd%Bz+;g*-veE;r6kfuIYBk|slf
z!MfuKV%ANY?R%4`4hAY;IdlMT$L<{5u2$qn-RWGAE}(~A5U6_Nhv_w4=Gdu+57ts@
z`G=bKtG&_^@U3^Tl7$)|Ufs9@BF)#G|3!-izU9Ae)wfpo-|0AA>GMQqWT-;b7C2s4
z<@2SATOnIUTrbzj#q-uePfD67euK-*K7J!F?3+9>D-Y`;2iB#<>d9y4yauoUKfbiA
zK@^JF3((H@E56@t^_{|W!h5|Mf6N*zpST%7-|*71y+~ObeaTtFDYHQ*Wf}BkGSZrI
z;5tv*omU&^@qtmdr0FHSYhm-h?7d+5L13d6Ya&sevBP>NmwAzjBq0^B)4tuAFIQl%
zwX0-QL*D{QYb~<HC?8D+ZV_@0=W$qb>Znv~8|4!5bbzi!OtiRM9}#DuNq}G&^!{!s
z`cY>8h$r7zsMA~F-YwCJoII@=hJ2H6*=1!2LZx)pET#Oh(9@QHE(KL}^cLsZQ?gZ*
zT%dMR2|z6P_NE|vd<?{OFiwy#LRs)b3ly1%;;VF*An@r(aIMDR2?XLo@bk6gBnQl;
zCn56ZQ=QMZCMvVvyDft|*TQ_83rmsNY+#+3TXCa{+N<v{D|;6v=XAU#OLv&#0=Dp5
z%#Pl{vPNVq#gyaw$FH9rw$Jun?4ER1nr^Klj-$}mJO3sLjQduy<pJ0I4)$puZ7EiT
zReRLjTs|0Q22YGWSp6UcWF~o^T2n%m$5H@DK)1ifJN-1mOdyFE@HBlV(}SkuC9-7I
zvH5&!E|7uXGlJHI-@h&2r&0@Q#a>pBU!7xrA>|APv61pDANo2g?Ib9AWa^-MBLrn+
zh#l9OBTZh6@sd4`OeP&K&Gj2fk87*)i1RI}@?1ThbGNg)kuP0c1>M>u;4@%qSoa)l
zf?`Tmj0F>KRxj#qSnHVUP%KG(%3+hVP}IU+q_`*^4j$P#Pn2uLD}duH34#`-({^iL
zi+=aQgykNbTZU@{9@+Pm5eyB*!YK{%3jwuN2@m}r85Ng3W4aT7G3a;Kq+?8?0pGA=
zM@rRBA8;RyV5yUH{6a;F>W#SegofUUzAI`mFRO7^q!-ag0bqAB!BG$q&a(^DjiOPN
z$};&nYHhlXaaE(dC^Ezfy-?Z)toLd$1#xr_;7v)|<kxI?p7W2jVF&BW(hE-h%YG4E
z6&E@MY#AO=?YrVp^j-fE0mQitp|dr%o5%FGW$li617~x3II<nmBC#LlX{Ca|?!+GG
z^9&NgB;#PnYAWj_reZI0NdubyZM<iH0&NQ*d+!Z<`(klYd}nnsPDUfjr6yJ~ZNnu>
zg3#2Y!>}yym=3Iq0hnofoMe`oU8b8G=Ww<a8Gjn=M*JD5eHVq4!9*M&#Fyd(I}M#>
z`}ocg;x8QNwp;>@FQlq}4fqab`!NX-6t3Jj{2-ay`(mL}Rs_m6H=T^8%I2lLXvjpw
ziM+;9=VkllQ}k6X@~f2VFZD6K*i|;f3ZXsb82MBY#Ycx~gliq|i9v!EIe;0_@ZIC{
z`zrf7fL9yePxbuC51Y*Cl6;EN+~6Zg$0A9NiegI1r^Hl+ose&jHWwg)4pCf$7e#he
z>=NN}HbDa<d7(X$i75vn-X(S-<2|G)`Zut>$vFF&yDX=WQ!MBqW0lp(f`K&)9EG%>
z`Y0~iOYAO*$UAmOhlZH-cs*YCELGu7`Ru63K6&#^s<Ua3F)}SI`Gi_fvJu+D)SNoF
zfT7PTvJR@xvi^C@oi3dxK)RO9K5N&$R86g*#2S<FjU&L5M5Y)CtoAxKL;+Ky5O)9=
zd#P%c;Y~;;EjRVzGL`Z(z^n@-&d%7o^9-{+z)a6B(*f`k4O<i=DCZ+35ZN@p0>Y)%
zVbrSJ9~)`D9{PQC6s$N|6)?4>(1nMp+#!Ds`V_RZ&hGO!fuW*06RL){Rkzq=-39r4
z{S_W3NQbq*iS70Ak8?RWQNxR?!BTHY`A8_m7kVGcfsQg?mQWri*6i1!-Gbx+IQW<y
zND`OpE+{w%iHi>J(f6Qz70}F1bK4);s>)Wn9W=2F>W(&jdO6RWe>ZFX<|5X7Tdcaf
zDStC$%Eyj5uOq4`uQ;sCOmm$6KFu)nE<D%6kn!HhmiLV0Mar2+`lyt4%GOi)%1ZmJ
z0odWIgA6VL*oQq(vy!wdn7s@7ohZE`nNC<6!5#n;#{uB*_3qgzCqR8vT2rv{D)pXQ
zWE@6_iMgga3F?upj_{1ZH0IOe<HPpukr{NJk;6@?VbufU3E7Gwv}t%n6~l_l>W?%=
zH^;X<o`s#`xs<#^gA8?H6?2*glB3tis+PCGiodU$JeE9!r7Kxrgi{Pwdt{&UH@+G;
zI~PZ`WT>tlr74N2f)9l!OcgD&j}IMzfJc*PJ`_${h6u~A$?2(MhRD*glhlk3^AAgo
z8HKv`Sv;xi%Iu%eWb0_%rxd6YOdZuDP06`+1S#jHb?-=B<T;#<B`K*_!qO6c!e?0h
zisyuK^H@i>s%EfDlxnLetcT8Tz)GeFlb>$HFZ1fEw>@&UpA|jK3B~Fz3X4U^ppq#)
z&n0>#urm&d&4aD6pZ_C3i@Fg&43%=Oz5qDkO}K85dKUHkLtOi9{M)b=*P^Iag09*)
z&YDrFjavDx;7;-nfx$>$l7IMT+f>nbFSe<!X87xFEYsPlGb5G)MZ+rz>^}ueuf(!E
zAE0P3{Y#)pcS<SW6NQnCf)zM8Unb33GEB|LQD`msOK7qU6>aFkPG7^-2oE^Xc0zg@
zROQ(w5A~6Jh^*=TG*M8i$jeKT5{98YQbHZ&7An=~@@HpBq(-<U6q$~w;2R@^$Ov{G
zQm?mwd_ZzRL((M?lMNkyQG1$gu!kxT1Yc%U@l!#$R#q#wk<O5*kSOL3{@G3^Dv=jE
zodGw7zxZ?(x<1qYoKAf@C*v81vqCEp*%*SW7OsEB*$ABV=6~H;ztu@)v|0G1cG8J=
zQn`bFwv%d15asiF>l2||{hD!PJnigrMz~rpIo^HEQ)K(htpuQ5O<nLao5Ii<U5@G?
zSlG$ipwjP_j9T7Z>7W|5oi`Pro$6ltuW(*Gb9<CsiLI&iIr6<Mmy;KcNv0fH@n5JG
zMML4TQGa@|qJM=tRA&i*E#G^&e|G%z-}ZL*UbN4!LPfOEs(wLo3Pf9*+TMusck?=w
zoCqlC1llFf97h5=UZ@wp=n0x4GBeO+GbH^00ZDp~mU~xy(T6BKDN1p^#z{Kp7f$pH
zRR|${UeX)q1>50`j{(Z7Sx>4ME@M$JC$pjaO#a01+nH1+S$|w^+@n#>q>k3xAgJFt
z?ZnB*ZHS3C7imn1D2AvU<y7W;U5K+EFOuw~J$>gYa6G*c8z*8Td2mFRK)DLh9%<(U
z)SZqq3Rq8!A0c(k2a2@A6&RsS;~eidxKZ)V?3Qv#RbSUsKd0I>Y}?F17#>c>32WBR
zrxRoo5FhYWnl0PYsKkKk35yBvKv<U|#XJmsDU>wrp$+aTE2f2Avc_>YA&8dCP|E7_
z;n{V<dgyJ3hSjQ|;K5Dif(CrA1Qce(z!FmZoSb8(Lkwh`OwZ3*JLYZGk2TB9g3bZD
zz#JZ)z1clEqN=*6FDlL2<x?FWpqVd=UcYJ6OM(>AY=u@QqJr0ONA0Z&gmrVO;_>&&
zxRmDOg2$^579NAsniw~Xnsc+mbnO()vL=g4VZ99BodQd{>1FE!gf(&8IN#_aY->LD
zmMQe&2~j*JKP%IjKj5mO+CKO_mRdkaO_m$W)a0?#LQx;8muk<+caWY{P__I1tgw)W
zNf18O@ecasK6)c=ZNBsBs5<Ng`t{FI&#<n#M`fCjUa@vY#f&s0DFJ2QSlv;jMvR@%
z<vo_gJq{1VlwyXJtDh=~IA#meAje-vfYw<Nk~#)DmJ0`0TvJ{OS#TN&obdJ;igFKu
zq_z(KZot`FYkq%Gi|ecjYe1JC%R`$GZ4-bkrYGb#u3mLaICi`Z%rd?w^9pc!(q5I|
zW9CTQ%E=-y_JtES3%L~j!hK8Rrjk;TP9q!&F)z$u+`H#pa&O<igNM#!1GgZ&w6m>X
zZj4A}tu6wnG(ez`q7)Ghz5RH`WVlJWCZ%}u7BK-imWh@EU0{YRI>DP!d8fkF9L-G2
zg(Z2oP*)zI+EaERtL%UwSyI7KyxtCV?i_WMQUXkaBxFJwDhE?016iR@vCvbJ!{J2g
zPQ)J-jX&s*)o`xc_mmXhBaTiceNhg)M@%Ty{c=)33&=d+yR{7#y>2w04hvK18Vukl
z<7rpBd2yXPUglqQ<#3h3d^(QKkxvpn7%8Wkp79+N_)3jizArvLwx0EzI|QClK~I;X
zMz^{#|6;EASL3{g$(^q9{uFkFxked|pY1_AVSb)v11tur#VnbOOiMrO>1RDN5O6b+
z8$(iM1YM19=_pLun6CQhjjU}zwI{UAJNCZ$w`o;{a)ZP`UYo(9boOw@9>h=M8fB-i
zf7hoP%#B*O+^;HW9<KZqlEbUQkG#nsLDDm+1*LqiMS-R*ZsApAuMD!WP8_>wbNhym
z-%8ZuV$B+bull-xvtp@f*mY-E@{PfF|NJwm;|Mr8OaUSVkE|z}+yv@3!-sj(C(){D
z(vX^r2A)*P>Z<R0HOwX`_^G`aqX&RV<wsSwRq<puHOw>R%gPkl#?F%eLTTjM>mgNE
z^ZH~@S>q;K?mAQrlD1)Whj#-0z|3~?<*IKE?5TE?)Xu!bg(-hb%BW%zBJ$X-r$2%G
ze2@T8?nTH$936M|P7Yq3&J+`{95yV{%dAs4gVK^^$c0PN>d3m?y+b#DUD6vM^#(cl
zvGWYb`^RJekbxG|e0MN-m5#6Kz4)GKW8tjT=v!)acKnl9#Q`3|scB;}ODqSW8^oqV
zi3Kubj+}+;-W@3b#V8zVzkPJj-bZHb(QI_$g5z{W$Q`4?M%go+8T;{6^72$yYnEf6
zHVJ*-r(OBx2l#n(&7bv8?O(sjtdkzyXLIN5$eY4Qap83gqs@oL&3NJEYj)z6OUJy~
zNA1I}viuRqCs}bhf6^*P=4CP*ri1dT7u&^>I`&Re$5c{D?}K_eckU)%dO=tF;`9By
z5T$qnw}eIZkmA8G-K^gSL6O|QDL;PFU!}<MVvu~qO5n&eo}-5;ewH=qx=JV`Xi`uZ
ziWl&ZnA({_&HWr=+!<jgMl=w_W>eWWCkLmFnGwkuO#S8z6V9h+92-s9=To_Zi~V$%
zrTwQj`&scpqG?<!ro~Be!r?Qj$Ag#gxAt!ml98S%@C7mn%)eG0_}hd(ImeQNm{83H
zq=_`!;}B!i8I>mk%)f*Pu*D{)D(_>Bh*n&p5MBI>J>2wstgsUbhg<WJu8doRU!_zA
zSCoY8G6!q|Fv>&h{ftoRY@GWdwR|+h^Mr~XRlHRXu>TrS4iDN#r)MvBJE!fFMwKXD
zKFZ>YInHT{a9@SE#km0Ru@NrI{e#X=XYG@d<CC+~UthI>S2!x$$^%We%S})ApH^7F
z!i(u%6xC~~WWG`ONb+-;3$)f;_4(Dr_7Dq_v)by*gU;UZ(KD5N4!a==$b@<K_*rxg
zf-(m6v3pst8xUAIkW022Cxi^0nbk1&9i_ssaF!Bip?uk9z4v($Ebxf!0o7bo9@><#
zf{L0;DgmH_9EsVFK4$1D{)vB%UAEK^T{IM=L#kM4_cp~;&pz|YrHqM)XF_1@^4iN%
z`H`0E5oV7f$5sgMwNi~@x@e;{;n~0?GH}IQO$=mZNDJ%_CkvL}SW=#n`6Z<+?QYe;
zGG&PT&h~Sh8yU4ZXYdt9N}Wg2B-ouxshsXQNC#MfVkgG*E-JzxLyZ`L_y(c!gV-x}
z#&q~H>BBbJQ5hJ^7oB_M$gK`@kO%y=a)M^I&P2z@FFCwWWs^qw@AOu_NP$25721`=
z#Y#c~vj|X;N>(Fyd!Otc?ZcQ+)rG6;OU}Cct3Zuyt%Ij9UZru}<MJ2)dkpfnvXYqS
z5|lGD$s@{`4T6l&E#bY9&B0V617fISlfEYX)JsPy7*-u$)y+8VrKXGyUdoJgRGSGm
zPNB4-j$KI)z$YVgq@>!%nH&^{S1I3|x4tf228+n>8Ri5sJI~%j%!9xJ2kA#NeR7{d
z5MVGrQ9XWodg$%wKkG93Nqcwy_~`K0Kjr&w=O=WEeq3(#XHfO07PD}FQi|{h7WMSz
ze@{~qSy^|W^hNUD9?7inJp+XXT<WtJd3TRicdl+QCbx<ap^B!uZ=@M}hp%xjU=jNV
zCujS|Z;sARj?X%$yQd|#A$VrPx3W>A0Ha8`0QdkX(w4|&pqP7BW>-rss^ScunLcW8
zxLS77$4kfO8!ZND?ppu)h2C|E6|4H{GZkvX>6JCT!E=?&n<>(_(llMW;BA-}yh_>s
zVuq;T(9`R2GNKyEiuzqs(DEp`plTzW>G|dB!_$NN?O)n^Q5V+tA=a4%GLt<ZndDa>
z|6rWG>MOCUCX~4rq@B30EVhQ|W>}DOXr=Y$6{i0<OQk;EZ3!x_v0=BWxVpk`;4D#i
zcy)68YWF#u2o@VW@{Bkwg6=B?<d-<>&;<M4)t$_)wp+PWr_wXoU#}H52-InH3ih$0
z_u|~7yjr@J@^_go2h<hV@Cn}xe{MT3`AUqFsiVkoYF@xn&$yFq;u`jL4-d~ehsSRY
zkDo_>T91IpbRI8;9)65}sxCS>ryx`diy-w9(h2oYM^0rj(U}!g`@mp;GG>zjg<V~}
zwW2?*B{?ms^%;KmC+$~<x9lIAI0|-jSAn}yw^Pn=H0*8x|DDw9z0!GjdU(9|Q+vO`
z-ZYlOo1}v0970sCSCp212KtI5@rpQ{>U#E^fI|@_&gQ|UX%i+Wc48g*%9yK_Qk3#T
zYFT(mezF3cjV~sbb&A-eoL-94hbPcxlo!zxg!<_*f$!I|y%(>KemZ;l>uI~=VbiH*
zR55WoC0%qhf4St0p$zt_7=g;>U>`4a^w{H0m1z-?NESbgI{O{9bQBQZqi{1VoQ@1M
zq!%mWyn9;F<wmc#oCb_%yDe`%_F5v4OinNVCRJ_O^hxGFY8C6ojhP+dhy9;J`{i>N
zyj+f~#rr5)&e4_!Es;Uw8e9178KRffjpuP=O<HW0oR}`>spn*(_RF1Pzx(L`2hu&q
z;lWgs&(?87l(dcXfQ0n^+x2&NeJrgmH5?<phR}>8k*e01BTuOcSj-Nw^_tUVnVJQ3
zn&{XrV(vClr(g2SpMcKaBj-}m;FzTUI@OH?6_cb!#bfAVqny)59HS}}g`}dh)C@S+
zvf$Y{J~=&mc6@TCEPU35J%_Jg$3gpjy*Hdf*KAi)Z&yIA?BwHdJi%%EX+htrgVwML
znKKyWjL_FJuF}I9f}MKi_oX6wgeB3HjhhSj0<bBoCfZakQnCkqyiew5&Lbn)HZ_~3
ze-=tE<OHn?ARwrx%-McS#u=rH)7!A9PXoI$=f+QiT%#P~$_`=VA;tJZPDz?|bUddR
ztDFGwQ`1EI(V&BHjC6E09U^r4?4C=ifN^?GwaSozviqrDr@8~02I}QNpup5OxLPjW
z!PCrc=d9+SN{*YXrT}yBf3L#}G;8t--j1NNv-Z*6F_uF;JK23x@-&$Be*5Lq&gn_R
z9|MpNDPPXIBFr>d<)=T-OD+$1#gS^rcX(^K&Q;~#=R3^hvtCgSeni>X3D&-Tf?}XE
zqrA%Rjg}+6PwejT(Z=vU=orfjo`Y@4%P-*buS#`juPJU3x;XsAEL!|iX?%sJCpw^$
zTH5*3RDKkP=g0bH#Jbq^W`=fp%C)Hd2}>6$<JFk?X}cHYu7~-r2AHCXleRd=q{4r#
z?6KxhPrH?I9OrNv+dJD%VMoy(#&xVBMVd8!I0nTE+;P(M`9r<>8e^?DoV2A$zps)2
zs&Z-!_=YOEB_1d$!5r=kM!8AdIZ9!tA|EJiDN-@)3f~@>_G|uXIy~I$^+*IuW!w!r
zd`msDau!_crRBoHcIpyNS+H(|oz<~+UG{z|`#)4<9JJ2eOke0`e9t(<s$GzBc7>H`
zH!wkds}V+94#TV}@x&2}OZ1;5J2R{tJc<>??G=YxwBpO+rQVbz1hX^WVmi1RR%Pqt
zN8gaThDA8VWvWcLV<+>5_VRipi4K+PDd8up3+csrt$lI=yddBq9p_r3^fvc9<8>Ds
z8CD$v%`*hasR~vMq?sj{X%v;%0t+_@wa~54i8;U|LEl!U`Up6bxVSgw;&*d!&~?Eb
zESw~k(ZT!OgbPPH{qexhY8v^Okv+0$Z(E6^(Q=8?zZG4p-YuQ^#-4(M3#B=5?w_wa
z2~H7X&mrWeq0)I`uNYuE!v`Zfx1EVN8qFjT^)>cvM~p=g&r|?i+}EOGZNYVVq)x;~
zhpdK5g$upLx(iAs$$HgE#<}LMFY|$RjQmDqDx(cnX=c&XC4N+;i{L~-M)~Q?xe{E(
zmZd*kv<Og%OPeFQc`DF1NZpVPTEuxK7E3v5zCUJthb8J~s8dNPbIIg#jV++0F8qB8
zyf#J&VSVv*%zjfAIIq1Nn-k@Fro$FlqIETngoqs+X7gcvOo4uWa=3~z1fOS|Z@bvB
zAoMO5BBUe=n5$6x`1hw{&W2Yi9nGX4Z>VhejjRZ{50X0FNaL6j?xGu-RjirZ%s7d%
zXw3R_du3NwFiqG{l=R853V+r0Fnwfvsym#Ig+`g-CH6*4>W*B*nF-#i1k*w6ov{}L
zR=o`vj-bO}q=2}|F)a!dO!WYRQ1td*BE>pMRWcgbVK<!rPz*9fI!bgcN<w=M|31oD
z;Yyh&C4HK5!X(o}3Eq^TeLkqawP7u5U$^|2XN6{ChURiKgOh8W;I_lXurbGYEv9X>
zGKouPtVpEDhE-?NX#i-mmrN+Pg=h-%i<qzeXf^UeBW*r(y%G5_4iw-JTN%3~-k;+U
zOfZ50hI8X-<AdM=nkpn~FxiI0LE+l<Le%x(Lw-PZUT>@^J-nZvpA)+uu(mlDY)T5%
zFXQwx<y2s?@r$V3=J5Bw=2IfiMLN;iOLgaVQxI`8D%fC%ha~izb6txLsOsWhTU2^5
z#`48QmXi5NvW&tRzRt~wUU&`?tShFpK_E$)v7XhHy7WKmj$P_c&+ya`te>-#gQ2N9
zp+HL`tWl;O><W92`7iwEU~gBx?H(Q?(@cM(!F2KU64mfbXWI(-s?QvpNr$<Fb2=a8
z=j4^3u7Cv?IJC@{WS>N>1+jwX7)A($7KU`)0XZqfZ&uh?LDX*UtjMxqLgAHWG*MCy
z5;_LJ;%A2GB(@2nt3`&n1`fXXBs#=Ug{QBdlh{Vjb|RCRU|~$<YzNfA?Ivu`MUW5v
z-^~jQ=CUwODd?YLTDM6K7;}l4E~Est*-VvQTU{%1**$jk>dhIE_r4khKdvf;-kPP^
zs57)z-rE`uwc3)`ybi5xR$PaHc)!qlMI4SVHs=~`OvyFFJ2rQzvX(4xyJCJ`=d{x$
zSB&m(yWK%6<xfK&XgjgQEeSj&zoFd6^A8QZ_bnEJB&!vF*_b<REGejqlBl!ZLb|hY
z%gI*eZKm0T_wK9ZCNfEp(%}WNj2TzJ$o}9PiluJYoxdO@l1j#Ym?!<itXo!4<rufa
z$8?Z&F(DZzXWx6K)O7F-#UI`+wNE`I5%E^3cOHKe-b(3O|E{Y5U=A`-F(1C(Jv?}N
zw)^UUa0`FVN9pja_rA!7jmVxl1_D;S&Z(6af4_HCT#SGNU%W*(3v};8dYp{2)Gya-
z)vB>J1TeiuAmrYY!Ya<}yhf_P-KQ|AqurNn(}a|3Gum`cPfBe>YhT^y<?iW=QY%zE
z%xJS;o*P|o6-{ciwbt5st1DjSjjcILz@4t@TlUrNUTt+n6WCaLBQos!o4)}8Tjv~v
zn5RhP_3x8=47yC4qChblGvGXT^G}lArI(I}My(P8+Tro;ehF+iO%T6l!1}mTYDBIr
ze@ln`>|Cq#udp_2Vx?ho7jTWv*W}_l!Wyk2e6#YMWjE2tr^AogI3Hdqr)*Q@0Y`W}
zET*FoRohT>V+QUA$~g{LO>CDZLD*unPpSIeyoUW;H4E0;1A<3s!>-avf+d&ozIHt4
zUc~%y_MBlg8pE|eoG2|5c|?gg%<q#sU)D!`(||J0lLUQWIWw};0(xlyfV-&|)~Mke
zz8^@878PHtYei%ea;~5XKxhIb2{JG@vsrqWHo5*k=ikx7l4?pG*e_w>-fpzsX|9LW
zY-K*tuOSV<M>^A+;LS@ayGPOGWHNem|2{$=9^wyhXfD#VVLG{AjC=Rts<>|&tzAy8
z2HH{YW!}f!M|}Zf(odA*v+FukyanF$-FA)rMEc!}Z6ZUz4JDzN`}-AoUHtuX=~qB2
zoF$ts&Ys8cVx#oZ)nx4qZ6;Kl5XC-)XZ1-O4dduzxe4(^Sb0v>x&vtp@L(8tF%nmo
zYf7VJwTPqNYMtL|jWty51{=Z{*U^7&!+TdrHvFx|z9#%+558887_qUf4g&-{%*7#4
zPKt8DiI#q=t*z-a^TWp4+HW;@7K5Z290Z6|;CcAzIJt(csD@{#6>Up+PZrw{gjO}g
z7XafdAex|{^ix($P?Y^LfK~ubW#YNM5cn+yJQhl~F|)D%o8<;#J6n-2%(vnt!h)e8
z5h@D{22kOPu@qt<2OH~#J41@kj-y1#xdA%`QS?k)`&SNII%5KH25&jHgJvt&sl=Kq
zrBN5AprVl2v_yi<J*Ug(dG%U_d{2zqaCSu*0a?soi`aBTG+A96O9kdOS~9u|v7k4t
z`vMh<=62wkYFf39V-(6FLib5_p3=a!(=!?1Ie(D^nW=$gymhwnart&OuIR;|q?CUU
zvq7Q#=o=2v)Y0E0qj*`gDnRxkzb2C-J5?5BkfA=vZJ2UITBG9WZt!K>&tZ}D5`GO_
zUbt~}$qzmq*-VAGx<n*Jo~Yh%^uJb<pjcRPjVc90%zR@yJ`;uajJI&l`WR#CxEv4q
zU0Rwew}#{igYdI?FWU{*V0#kvGkPZ(-)INSoa!`mUhJ|FPCRhbt*ac(;nnl$K=Myo
z7E8)`ro(u&{yJ*^yn6_Js&3#le4;7{n)k0#(%q3hswnbaMwTKkSk?ld@-W(_rR>p#
zRKHhTCQNEMecV3$gl@@p-k5S9XBg+}@GB?jMOG-Y-`J_xD|{gxAGF^W7FX}PO{ngy
z67ODdNjtkf{_eB6u7o`(yN^{lSdf2(JN{_i1V)R`;MLuxfQmOxeI@EnM<^;y2ws~z
z9iuS6#XLj_HfwBoW$yT*!ka&MXpqC>=d3`UQCwW<nD0Kq&+U_^$DQ`<G32GYk8*T;
zdayTV5Ps+GV~ApX_8?08ehYM9_qiG95Y^<J+4xZ5r#RaS%AJel`6N0)-x+D<G_B?f
zPPODsHQ#3|3?OTYi$ba7M0FcT1+2HTAX9#Q!C6+h8r^2D%CM>mE35lW?2@zT5Vc&4
zF1uFqyB#!b{G4&jys*-{kF$IHY@uN=u<`DrbPjiaUTisJXukVEVom->47GcBxG3a&
zL;B*B(Q=iVfurWF#jv#GFLjF<u~<4|GW5b?^RWGh7MjAdY{>cjMFbLFu!xpua!Zx~
z?;L7RH%Two8aBT<8YI2ccIlJs|N47@oHEIB=oaah(U?&>9s8)w!Y1y2HpIB9Gj=68
zSMG+mW+}HE4x21CWHDp)0O{R6(BG01x>ARW98{=yK@<I_Jl{af9;!U;%N42CV)kW6
zKPV91Q8@N1s_XqSQYdR!RoQHu8HgnCsp&~p)Yh&iaThf@x~HlSYq%10abllb)LP;9
zXlY4wM+^4R_4?@Ewhz%sB~Q8wHL%rF_!$KCL<Vw7w`4y<y;1LKM1P<4)ALe^<DlB;
z^BlwxoIz=r#VcK{HK)?sT6{jrC#oDYLX49Ba0ryPJM1~#Dw_;<Wrs(iCK9Uvkky#-
zR2f&vn8sLQXJ08EQlvwiqKZ@}x~uvEbpDv7*GhXt?!d;)Hu2?eA6;Pymlm$#UTJMR
zO6H<(pTEOpB!{lg&Mv9$)fkh$EQ;bhepXVIFAY0`rCXenj0kYXie8Mi-CI&>-bH$d
zN>kXl-4t$hAhX*|O^#o-R=`~X*Us8nwDf2R|C8D7tNc8oA7BR-oj8z%+s@<`y)Ous
zMM#FmUPUkT15z>r0t)`!g<h~micVD>^YFlJFr;wth6-o)E*+I$$VppKm_x6UHgKXb
zwD^t2c>Ope=24`J+z)e8Gn?m<O+=k6Bq*rRR=ss^O3K-)j5tbbstRw+R;}`6_ULQf
z&*xnB(D75c9KPOlgS6kE6`OJwDw0V#3^_9p+uubx6c{4>!nyLQ#>8}YoPgxu=()eq
z*j+aTdO5_>5Bd27V9RE8+*qcEwOD7A!!U#ag_Xk|j`RMsrwMy8?M{H51e&StgltR}
zlr=0GB^GE@>;va>RY+zes`tdEq*P-I^zNCGEVJkW7GT9N8Q8Ek-2@48jiPbN6a@X4
z2Z`9V4sE-@TF`bvF`r?pLfE2EHUTIz1v$wTH^ZLo`OgpZ7Ng|{X2qJ}Vi$j`m({?6
zhfdOY)Ge!#DqGCbC@XT&!x}wS7i@#_mxRZxw4l<G`Pawpk7PG6ak}WbpA03_1>EjT
zRk*ZDbgVKK6p|8)U#qhV5ysz)Q<X6X_s_#6$MpjSVieK|CIYdKA2F^>>ds-ZKdzbw
zfAt)<W{Zsv1R(l(9k6-H|5V8njzcMXn&QB!h=Z~y+RyyBCbl?dEMv5!L=vBU^@=NO
zz$zPmk>4P1pM--sa^cta7G#<_E{mk~MwI|6$=4(!HRUDc7(={8xK<TrV(a!I-IFK5
zN)im<pheKqG2_bX1-q-O)JF0P-liDOPvLIKxOcgxRzTUDw0YB;EvK?2zt`e28;z7?
zO*iWVvn^6~BW1ZAtMYaP5ei=-CiPIF;u<=5r6jj{9)g6Z_t_TwAKxuS37#UJOnnTJ
zN<$}W8gFkm*+`2}r8G5guNAp={ZT?_fdR_JO)<eMq28Gek2~KsqW|DIFOhqYlD4F*
zH)Q~(%3;F@bE;xK4Za+3u2LrqO`LV}y-{~p{2eA-?3^89`^|^gLnA7e;q^auhouhi
zY^iz<1LN+DVIO}dp!KLsMIfqPmrz02tv{02hk5yplB(<w$P(5x#w2yzaW|b@r*MU@
z6Y!g+rIj%Mvl*_bhNEzw=?JAm&d;nHB4SMW{yaRRMPS$?jBMP}=_hoT#$V~DC)-nU
zi>(o-hh;MW56I1`X1DUzaz4oOaecfzZLBn9Sva~{Q<K*8AJe6It7@rLQPD|iWi736
z*EX2Fw#wzVs+T{Y<+tv-{Q7it003yL3<5y-kHOLcU{LiNEVuGQ@hd-^pWy-faDpv^
z#DP?L0RrKK+y)>^L;S^#>S&}VFmcu@i-~qf>0fgD>~noyW=)JvL?ugB#SeiH=lvUD
zFimtW*V9%(rx%#aB(b6s&82`^6qPdqxQnwVXaYntA28xqJKF6hwY^4r<5Weq;uT4e
z*gXvA!<0#)L|MXVEvdv$$YYW7rb*e&8EuLwG41F~fs&VUnmHb-U*H|m)i8(bCf|d*
z2wCQ#E*PTc*m<$rv_db*izeyg^<gvMI?%SR?_B^EM<c;fG7b#F67^C8ciH%aSl&9S
z%Z8oh9c4OujI|IbS+Zt0o+k{GZc5@BJ3gtrBN94F1(rD1068L~$6O&7<WSYSMcNgk
zm`g#JX(2J+;$SOK#h0|Z)p@kkTT+Y*C2GbXP1elWna2vzy6K6*bvnYZ*fHAiXhzhg
zpW=kOYFCEIWNJ#Ji{wU=4hZsAS|SSBn<lJ7Q2so1T@gBtd^VeTYeYQ9V;8}V$Kmbf
zhWPEGKtm;#qGim-&5X5rYn_rXo=Xl!{kTbw&*ZVnHKTrBX~j6M!&d7DI>#X;<+@Cq
zl#Esnn@WK~@u1{0h%<eb0T)viuVUzlqd`jw2XXVm7YsKqv=V!Ko=$#BZ|eQjRoLM4
za5_NtLy>RxFTG?^mj|)YTh=OGRqMpJ)q3O2)&g(W;C$8MjRoGE4gR^~{5DL7{aU<f
zJIRIAWvYP;B41HehHB$8Rb$PmuY>u?Li>atRiK_65T21ryWR^Fy`kUn0vcshK2AtN
z9k9p{AgTruss%Ejurx~=Ty2(fVQO}Q<LjJ&!7xgxrwR%sWHX+BpT7w=uz_7tCw?Im
z1!&{xaQIIHvH)O|4h`f@5^f604##)c>P~b#&Mwg6s^*XWiIm0McrR+*S+4b|=s;`y
z5AVB0N+|09$Gxhi;-P4jwPGJdD|uP&PQ)pZr%U1Cq;~sN^omZYqcGxJ$8X>|IY9eB
zFZwa+MUTq*NG>3thQXpfd#6}EZ>I8Tg^v2aUs1ZjPWA_HMzjJ9(ZnvW+vyjti?sie
zN=4MIIU=v46A)U@Wf!40C$dIFYNPwZ>Tl4rMwL^2UAHPzFFu^;3=3kvqgQ&F6d!2t
z7tp?>R>JT5><N(Q+=Bz;$?2bTkc<jSL@s~5Eb5-~?HT!J%c5Q%z3#O4>&e*tK5)D^
zRW=NnEo$`pnaZ=owR0pF66xNgWKZ%byP94pTr*j1$Y~qX&q#qEN4c)%zq9T844<)Z
zX{utWAK01L%a5P~m+QtaE>QlrKz+GvTVLwJJi>HMa8OXaq9@JiEWR5I`q35q2;3e5
zp;+_E3g`qG$Y*@Wxay~siOL)-kuH8Z0G3hCU#T;Rogku+6-c!_nkCSR!(P~7^Md7n
zZROihHiP343JtL04kAfmmwdaAEPBrl7*GgNaJi;*s2qn`Uk@_r2yvcj^G%pfF3kLw
zIdv;Q+J*(t?#_$Xr&!P;Iy&y`{@ga{ir1oN#GMk0ofLM}_+_^=P4U5IVuKY1wOQCq
z)=6Q@i9Fe!(H9zP^@-{w5LU&w6>-X640jvmbP`FSV)w`CK$Quc$gD1>kx_j*Bri?|
zDlu}1#i-<q?<i$G%aq#Xh6;yh<0^|cn2?7ub*KHh#dumR5o_n3B)b9!HelT#8PQ2f
zuy%A!JE1TV*)UOrg()Q(hCb#WQk|ZGC`FNL1N}Gu_y0uJ|CSkWNPsXJ4jqyRqbSXo
zb~B*)u!{oAOgKcTCwW1PgqSys`c|eVA8#nSql-!vUcI#_vwfl`zZ5bamx#NHH17O#
zcyQE?O?H3P+V>*rEC%tlHQ#1i&I_PyFt9@O6oLH|G{dKA|B3bwQb{ojtia_Y+J72O
zcf|R}L{L*f3)ptQTQ-@-^QvrAXDnzv<|1CCrNY}6(<HQFeWfDx<#gLBBeYtINzDrj
z@ak|-jSXuBRpmB(1MtieCNs>zb1HVI-688><=*V-1a0aH%ZHSIkfNSVwGnhsPD7z2
z?p(00lsg$UjT9I#FFCFyl9NRX-XK2f@7hG<1SFY3AI}of4I?w0USX*)|FOgdpK*V>
zhM9CvUlkXJH~N4m%Ql96!4WVVjY>*rxMe3ZV{H78l*#4Q$<cFdk%>%|9+PlTbK+<v
zqSrmM5FS`SwscJVw6iCU;?pkj@g^0QOSB^+jsk`IBOT{n=nw|qQ4&kMe#8JHw~Lx6
za$Kxol6<t+$&C^k*l$4lL8*IL%LR5Rp$-}@UbbI8ZJ$uWD5_2OQ~OuH<~T_cI3ucZ
z>!waqeVJgwy3wNfdBu=wqwsPqbsR+zRq2eV^FcP0gNS<X6v)Ddf}{KuJg?IwynHd$
zwaL!So62F0^JdPRVd6oZz>UWK(6RH1_pO&mo?D=={ChC%ruBO=fXyueua$c8%NK>m
zingO!Zq-(rCArW;wklmJo@#1a^b`cMLpa;`|7U<hES?>6WCj<PqZ$RRckw-;3LMpj
zih(_p2R%XCur=~}w4;*6_oCHk!%;CfS_IS|9O<c3Q!d+y`gBrBiuKT0Um&rt&~cOU
zOU>koE2b<w`Y^>Tgdfw&p=^qgchUXUz8Fx1h}mV8jftwZsjV8<T4r^s&=}D-DKP15
zGf}^P2lXjsKJ)Ggne&UJxYTJ#?YgS~YUY%!06xOcvMN@gNz?Un@E$95PAP||(#5bK
zOUe34Onb3QZiW+UHu%iRpid4Q>Z>G-AdRm#xa+>9>o?_WY$WwOJ9Q}^s!7gfNRS#u
z@KXC_bJ1|JlM9Kgr-P4~H?E`UNHJ<40$@szv7N+}s=nC0aM3(qHb27s8YNfSume=k
zkxG1Tl+AVaMR6okjRWsjT8IUxgux(rkn5Lrsd|e%cmfapeW?-sSW?FE3oG@dWN8)J
zG*ClCj|{901JQD;D4FAcS;83zmY1@4HyZ5Et#S-ALJFc<&`Z~LvzN*#AWnXO4N%8M
z4^-W?T8kx>;agcD313JT>HGT_6(q-rXvPm383~t`Wp5z{bZDbtK2b*<1czvlq7yYg
zAhai@S)B(PVNf-ucz=^1_@H!nNyCV+7iI$ub9O(<Nh4UD0#!m~k}-e%-ab2!a7Mt7
zLxuVJ0a~mo_zrU>qUGAwHUVa=v*#T!V^MZnLlhbz&(W{EHt`73F84(`)TIklv9g<h
z$;~~^$nmgy5NR;7iB58k(=QEL4H&73=-Q)US{Ks<xT1*;iYJsnf`o|d$<(tC4t|`H
zdf%3hQHe<8qv=37EmMscWZ~!rmOv*}u#g>C-Q1COv2nVsRNZ2ml9as#;~H?yotnaj
zm5o@K1QYHPYP5Uu{Aa7tieia`!CBo{HQm?>+=R6(w(qH>HKEMo7Q<jPpLF|KY_GDc
zkV9IYM^|Wprb|M-q-7RS?3iNeqS9eaF8Z}d73QQcZ=>Et^+YwMJ?*-gSwWYh&*U2^
zUx#y$ILFD(xsFy6)zHmfRP=?>?it?4RBS`qwMvzxb$)q@5zyJ6;rtlL`TTx1JWJV1
z(kyE>R7#Cr`6oM<hQjb@C2E!4G%9^~6OP8q94LA|%zCf2_O|r)Fc|@hfDNt+d=hvO
zbxcMc2xu2YAHT!(8?8!pp+wTQ8my!RQ%bPC<JU*0adRC%)?qeMe6z$>SLBqpMl`dg
zoC*EzA?%$qEb89=y!9OTY?ZWUcEFv8?UHZ*l2gypBiUJ$5xF)+fvUuA3TFyUZo+ZG
z&k7$EUn&>1E|Wm_Dyq5O$Q@0(0YjRQjB#xP-IGehEi{%qBQ?^(H6ht!Y_n`LUTvv`
zc^WBey|2<SRjnewOev73&0k72-v_FbqbIErwJ8xgJE%BHHi3Afgg#^wq_`8(17-!0
zFxs84j?SpUgZj8|KAMs}q)nN~9c#!*O8(;ZRm#gv3Z=S7uNkHCcWov%2ZRlj^~t$Q
zr$g5S;3veFWn3kgvgI-_Z1WgDbg%K>r|DDzP@Ylh1GWvIe%Wp1*zbKpR@M;&as$oI
z3#4#nPpSHmz+WWeF4kP=0b>Ab&J}NiR|a0X@?UZtM%OY1-Z>Vl?A-vup`l4!m4GB4
zB5%N|e5%@ocNO08!`@9<FO<qjDy%-3)FWYdzIV3w>)v7e>{a{Z;CSCqem_>J&bg(=
z!B(;?y16FlsAy=9W*nPqaOy>AC6v-9!Fz?dZ}(ok)`;>qVb()qK3Jz$EX3z3x1>wG
z=$)yei|dwXsvfVbxX5N+-wurx;$bg(oSKB*?wqz?#i52SQ|-=5JuMagLvFlEkuuL2
zg!URR>ANEA3ZmVW<~fAee0qxs(jLjyhHJ6&nGgr>aPN8(L;48IA+l%HdgfjY@n!{$
zj+3B*VdNiZlb8barWtYmcA?@mkGCcmp5|6XS&~`w(r6NF>om)xCHg)2^2<qu{9+&w
zu+y-)d}h5MR9!~xU)p=ZVU9Hqhg3DegzT7jRMfbOm$tW&ORRuiy?B!7!UVabS@jP`
zsQi2zo}s#`RBisV2OlL=oBXP(ObOqyodK7cWVJbJen=IMbdocWO@{+ODh(%wbuk^M
z#>#DRD2n$eTm3wDqGU25hYl%h5-r0N1lc&W*31WBCA@!$788$Ps^cb7-4%vIB__rh
z8t)llF4PPS81$5!bxVY}mA~-BvNMQrbq|O0XZ6fa`bNZA3<T&~Rxr#N0)>(h`8JI$
z21pb50qUjDQlyvXtV(hrYP{?#-z)$^%yo6_yMpW^4wnTGw5%9p>S9BN@&&_va9wX$
z&w?z(w+kN)QtDceVIUF=+vKTSR=|2kLHSV$#)-`g#Z&-}JR}&!mbDH8dJCr;k-bI9
z4c7rFuaxTA?FX>}Ig4R_9oec>A(f21>im4bw>aB?S78`G?0&4d8*<%EC%sE9XcTaW
z^T83QgkA<EI@gsO+U>%Qb<8Zw?35d&H{yL=rd%13vp#LXh+}jC5I15_*9jZ?$s|E}
zTCAi#1UZ3a?(diKQNWDfw%a@+XI6Yr*R<bTLdhP+CMhCS6XH#(PdMAd4R5=eG6*R^
zeG9%1N}4P<FEm5N79_|{0bMI50}L5U`m3a|FoO|rOtB`rH;d?txo$gXqxP|$_nJ;5
z^W$<G{7j55?A%7#JC*jCb&@={nXjM^bHxk3cNl(xwV11Bxhn!D%yT`K@sNCYeJ;?v
z8HZ=%@?-h9mxgX%FQ?R>p{!Y^yU&h4L&=fBa;#{7Ld4AwAI_1aUgfZ*$g`jimr@rE
zsNSCPoE?o)v~??wjBKpPvm!mp$4^`Q^+A6IL%ie>fLtoq7#Wi&2D1c;b|_V!WhwX;
z$%E&FLKO)pf1)`7Ax93K!oi9EF29LnWnZb(q?rxS&SmodDwtLn5Rr~<t~W}iL%Ju}
z#*LxFTzQh{Xbuu~cc4p%>R4v7EjkX7_`315g3&J~mupcc=lk0+lSI3n-B*%a;X1jo
zdkJiELopOOh)v>o@LH3|Djv=e8WI54jaZB=!gm*YiEFI>DtOzp@OG9>{S~KdKyH%M
z^GXX0JeOjn&vPsLPqmHRO<Yik?WQ<=5ATB(vs4qZ@b<1oK1#(kOs?d{kJyE2@YlC!
z-~9VGH7>eU|Fzxuv-9iG-k(Ru4G>-_ql|K<<UDa#Xi2Af9Mdj)#2Bx0rN3CirtM!2
zI;WlJ37XV*qPOzjwY9Z(s^b$$niI^vBpKX$I@U`K;yNG@=SAZ^JAB=F5xw1|>El0o
zoM!`NtF^s|xMlP+^0Iy8LdN+ND>tdrUaYD1<kV#a(WxosBMO-qFiezklsH9Gv@k2Q
z8<AG&tBwcBA2%4*v5J4JqKnij^Y5@r=h?-SHH5%8jZ@M^!)z&@5XZwZ;OQgP({e=X
zeiTtEj>~aAgvB65)Ju1lZQ60O&cdzG5mdGQDHAQ5F4bbWL>pLBJ7mrP8R)@|>Hw2)
zn~+40tCmqU$W7N7b%{);xrrZ_&glz4ZzLax=B{^!eU5e(IY$H#FAz&56>;@R-VxoX
z>bj-6#x80l;U&;>VD1YIkjx&TId6nkRZAs=2oj&+A7>P}#`yDN)QlblRxl&l3aP3v
z^L(6{VdgySgsOiMp3BjzdE8yKdDx4ywe!8$lfWCDFPr>>L##u>6Ok2Lb#L?QD=Va(
z(p)9Q2$(EX<i-$P<T?D+PZM8VcWVUY=-o1gzPE%jwMer09wG-4N6NU{vX-I!a9Zq#
zBkz<F!zgs06;`SysuRML`1msDf%v7~#yTA2jFxDnDzoReJ2)DqDCoElH6gbl9}LSP
zXbz#T$Gc37Z-$_&>q^1(vn#zP)<XQ!)9K*D-cyb%C19B7U)j*Ri#ZiUVJ`I0&RY&$
z4cK-T2*O0NuzGZS`t)_@*XSs>Spj3UXWkZ=WhY3%n*IXr^}C(Z_R0LIygtHPaQEq9
zn>MaHEpBYZrrN$l^mJSs3t5@6s?&E!26kHFPB<82fyG!(y|<crCm)Y(4+E|4)MhBJ
zEHy>36cbxhvlgkqv@|0#^mURsieBb?q<Yqv7R5hvNf(Meg~Qt?uW>7i%?s615?KHm
z?uyHv2F=GokW`TRFC!U}DY+DCOpN@Cq<Doz<nR)LO;167EZ@o%w;{9Vs#d4)q8K5E
zIWUrFl#NnyJh_!4*-W-!n3s8mLBA_@amPTh2w1Hm#j{4eNsHjHoLTR$8a2!z-FaC2
z^n!U7S^hjj7Us5W5f<8ZkO4%s``FR_qvOT4y)=#*qciQw`2sOul6;ae?U1g&pl<8_
z(??=lL`lJ<$URSb*&v%_Y4Mk&!m(=hm~k;jFA%hdOJ7dMsa4-kRS>dcq|iMGBQzb)
z1lv_fCn|(zgPbe21BWI>b(A9>JOSbQ88FW;sbFGVy&ltOQGK~Ve=Ii|k^rD#y6s(N
zgFZ-I;jZC@V%#gu4~azKPOsOU`WZUhB9}t3M@+k-tF$N*OJ{GA2jMgvxDkhp5uW%<
zw2bwf6#(JE5lYR=gQ2jfWP7UD2Wml7lbmWmo4h0%b@7G$bbwt@t?9u~Pn*xIt*wA-
z))xHFRjjXNs#Y^r2j17b%sS2*lxDfIjrMLawm?7lm$gZgbYw0me9|3xZVJ@fH0h2k
z7a3I{TlTLpb34^fSIMUV;R~ES%nx^V*gk?KJllPJc<R4(b_wFcS&^!V2y8!P6YHq5
zE=c(azdHUIL9L)#N>Pe@O*+h{7nhR!2+gYL7zMn`DaIIHBQqeNH-i-DNQ9=*B29UV
z`W=3RzQk;%yvix~QtOeNJ=IrM<)&hQV%^`?KZ9gjquK5V4+KmYD=(##|3_&r^nn04
z<Im1)5I<0kpeFWl*zNZbolg_=CsuTT-_m31s@(u*>8l~WNa9OSh^>kguSj_8@FE14
z+2S?MA7v`-;pDXott3%E_AKLkO*-+HY#+nhita-lHM^xu#@W>sr=BA1aG$rJZ#cYf
zY-iXSPpIZ7-YtNkh2UlK31!w2=x}m0oE>JSTsQ^e(Rod>lXBA?3k;rsH%3(;zZb8^
z=CxHj9SiTbo%@Fy)KI_4iGS3qW^UTUQ%)N0p4wkEY4x^vzLw9T?*kh?uolm2P;QuB
z*Y)Gt6MTP%P$20do#&lH`9&tN79r2EBrsfGA_o9*i&Ps747tZ9bnsN@Yfp}ZIn5>v
zI^kLnt5geu21lGg{WOMK!mH@IKxPFoB*2|~C}$0r13~+2*c(jy=%H}UcbkeRp){^K
z!6-#`79;q(V6<1g5Wvt)g|g*{_mPW$xFQ(1a5w<OLvo4=&|2#`V8{8@q)t!b+VXeV
zZ<v-njxZ;215f=S8Ar^GAzkog7<|Fred`u=Z%y|CDo+YgRwlJl^D_-yB_lKt6mS=>
z?vN{3T;qAy0CD10Wv}qB^r~AfG6U}0?$){96)hYL8}<nz!3yruHz=gm)g2pipK{#k
zOM}8;;QYF#wO!iZ>tu|!dMiGTty1iNW;w$FHj+4O2e2$#0d$nv59Mdd>5HzTI$y-W
z{bS21*~B4m7nH}^J0)`GSw3v`t<S5{d8x@oKPk6Xe&5Oqlx<W_vPqrlagz2fhuQDb
zRJliG1xIU-CR5iFxxgGB6ZW>^+<c=+J}wnC6?a#$T@VQ93}%w(0>8lf$d{pub;10?
zH{@P-V-lqBX-1EaRn7v#5`#Sw`}^St!L*1fo~WtJq@s5cCpYp`mYn{Ha_IVoyhHlY
zIyuaXRj=HZyhp?mB;MTUIFca|LhhhY><O{Y33;lK!ULXtK(7<c*$@_G=tDLg=^!fM
z@8z~dol!P~qlju0^8LnMOxj6hzirr1aOX=4^f)LTM1zD5G0EYrbni`_klBB)#8u%*
zlm%`_v&^u}Ptld;-rC&Sag@yZXK*r+1Ew&^XYfXS@5RC4{@LlTui9t8XnBfOeAhqp
z_$kTN)KvqdPC)4XBMFQiPlw8+>#@6QVOhJ%P%|ps*g}2waChNCqo~O2Vn__^6`DCP
zJ469b;6f7I){#JrLnU7!mRhk<!Z;8A@w~XQ3%a4u_Hhq>T`Q6^OlIWkHTW0aFvs|0
z{i@;vx1-L%^Rt8JN2Q^77Ipafw0-h2j&Q^{@(NRw-aR-v^<MR1hPOYR3}k7A3)Uxv
zwWpev4#;{O@cI(^McJG_h<B=Tpx`6g8z%+&S|(CML4q6oj+|J>vIAE*y%CcyIUbI4
z0J$Q}Rd1q6iD&5z7m^?p1&Kw8P@fJFu~1UahZl|B$lDIQT-cwA3p(_~JzE1+<!&9?
z;6fE-MWAND(cWLw0{PS!W|m#s1Dd|?C|J!DLi=ooDFR(Zzt8F`7MTZ1V5M0J=?4Eq
z7VwngYYeCHz=U!+s-LD^-42B-U7K7SLsV)%W%i~3SmHp6(Ez0{F@^WDb4rJ-qc@nt
zRXm5u5qQmhibkMP)k}C7E=j~?PgD>gTC&DH@z5cjtUoO&v{m$8_D2fj7v5*}fiPFP
zy~DH0TOh!g7vA#2Rm|If(e%Tm=+8e(_B_Uisy5>#F&<jDqu*U!<+uG{eOW4;VrRlJ
zzg^Om;j6d<-pl@SF~KV^&G9|0QB#0YSvoz)IEl+iMb!^7Y}zBuN=`vslZEi?-ELpb
zo&u`?b3ly0UwJd*$X8;X8K+lLNsr_-Dxx}!o&cW9WOjf)j;)*pju=_9U(_O?Eh|~^
zdk5#t+A!Z!Z`hm<FnZ)Nn|`u<psV=+;=oUH6}1-IR?g~ta%DjCje&!DZdv#UbH&j0
zT-P<I{z|F^5DU?)W9`PwnG?nm6v(>@58OmgNRf{6TT(DPAykRVO9n!NmxU;RDaM|1
zw@OetiSA6HY{s0K7<T3w_SI!Qg94Xztb2#Yo%Y%8GvFi0Lj9{fUkU`ZDH@(VI==v`
zx}56RKcf{|a9eTDhg3PQYi%Adq2#u4l?xC^tBo2@rHL;_$@P#gc47VTnlG)mh$E$A
zLk)Z1s8DrJq)L~3>U7s;ocZZIpAONBez-~jxpq!?i$Q12J>xL5&LhiqQC1psQmpiX
zS-clu8%8>Yh|cNIS4h}$yY5QM?k+hrRN61TAijYUC+Cv}4~E@SE>#s%Aej+tb2ABX
zJ@lRhdU=sXAG3t4)AfeOz(}yF4M4He?#XzL=0}yUaCI|kYFaEO-#BGEaRoltxP&i0
zqu+&ayNV_p=U_sGLLQg)PnCCqM<?ku`rtTFzc<L7yV)35j?zyc3Bb>dvY3Uq29le*
z>yg&z%%iwJNp{*Y)%|YJuf=r_iSUD#dPLM1!~k?paP&O9IIh#>L0TQ&N>dnb#hY<L
zrB;yNCX#hu`{$C*n(x%Y&g;OXf~nT$bWF->Q)yJF9;p>#Dho=X_AK*b3_bfd@R}(Z
zMc=-p=Q_a8On@kNqbq_tn;3LyR=qfSVVhT|y6FNY|Ih9bb!uuTUdrM*iEE8nu?sf?
zu^bpyOnE{OviUGw?Ix6Nn8R7ITPc=`#Fvs9j#X-qoJ$6inw}YA0xf$q!|>13Nrwi<
zd<<0j4PUaY1zG<SAqouJG=vPFK8e<WF{KxFw#`kUJhh_Q6K8aPkvlbq-4j^6h3?+@
zWNkcEQYV*|Od_i;c)+kaOl|UXVAcB$E>XGt`6;z5`=XayOYvOY5hl;t-j*(1QtcCI
ztl;a;)U0AHIuNaf%Jrn&i<D)F0~tT9aWytiOJ{+DVnwOmN?rWpthC^bHP+H8NPa`n
z4y@|ex;LvcPJ+R=_b}x$BvhouhA*sZ7Jv~{*!amd;|qP+3E+#R*ZS7qHttdEJj&+#
zE!$?Fp0sy=dUbqoblTxUV6MRj_Q-0qvhq&Q`L;K#4xA3{Uu+#jy(>n~NjXH8t*izB
zSZgD$IXNd)k+E^Yz!=zsuZ6^(w^aa*OO8FNgVj}61#*>MAylM~mG`mwW2G6}&EAK#
zfVMOB4A8eJa|)M_Lw9~-2h;As!?4}#_bG-ea0!t$uecF=7Haom;BJbvZ;@1v^|eb_
zn({{l>Ab5e4yo+>V`Uk@1IT7~nT#s3vrPQwXz&V$R~Ha&=Q6s{jktd0GFA7{wlvNi
zK|knB1DskKcD<&auztIyMQ!TwqvPU2PWj}m=Oh?n0bV;xh)&k2o}t8wH^7OJ@sWHH
z^3e^c|Hx`G=3U98;1TL;(7b(>_p|dGHf*G+5rs@)#Sf{mWsYfI$l_$FVrU?(h4H*P
z_-aGlH@;?N1jMPh=^1#_$9$u_&p)J?d5@!JaV9ha`oeOYNiTK{%P!3N*gq9WIH#vX
z(<sG!!<sI#k6bS6BB8`(aJ*q0oibO=#7U6dNz)I6K{UN+`3W7O9klytFyQ*oNAGf6
zAH_?{OO3}&H%E==B4=ljNlv+zEts%AYP8ZMMdeF8M-iPP{6W|fe+2j+jKD@me~=Gp
zIyytthK2D!1b0#?LHm_$l_!gl8GcG8c~&18WfFELKdS3NzV1ZL_10!-H3~*_ULw32
zwZ2f#T=4u4u02vmeO!KyXx&(r!ITQdMSkY`>Dd#RhGzt|?_w0vyByktk&`+J1f6nn
zk5lK~OQg6wVin!`QV@*(yKu=Z{ja6qw$e7an~J{eRwQ9*SMR*DGj>;zl7gpV?J=1l
zNa|yK2A+=b#hMQhYN+;~zEteK-Kfrb)<zws!i`p<R<uf|9$i*c+$epWxh&G*;&wA{
zVCsX7;=-URLk`Q@z%yD|=R?NH`gGz8xkG$}R8t;dhTd;kJ&Q{nVQSuQS;bqu!3=3V
zphE^+OE<06;XQF_fKsa0M|>JNy_kD-JpRT8&ZD4`h$3{Y@Z9Qg`Ig}8TiKyp23_6R
zj#nus#`XP~d;w)Ry>g1oEmMCafw<xfz3EWEaeAJ8GM67Y36@w*(+b~FNmE$DQK5S@
z;x^62Dx{^}1wOSqGSUJMi<k52&fnxlHbzfw6Mj4L-wt;hMRvEr7b1%jz=J3-WABm?
z(2EI?Nb$^xYu^>$t#0(G){XQN(`sYp5w$h}^%<%^twK0ZZWFY{HPkX_Z#BD4h1z(^
zSDTDUTL&~^{Ts=S#MJ;eRZYQ0%D$blf~@f%_adc_&>C!+InOCK%d+Y=gn^u)8BP<0
ztS0<a^k?{^dR<M&WMft#DRtJ3vg^owQv5cYrldy`2fig~wd7I=jp?vFF1}7PW_^Y<
znaSukiP5(t@F1TraQJqcGesudLLLEk4&+h~q&z2lpE&DWz4ufb+PU*`dPTL*l0Lb;
z=^~+y{TVl&orDsK%I6YROCa|zv3`U1ijpO(il&2UvcxL<SXq*-Vx*&_D1=>CfK@IX
zm=wr*Q`d0SQ^PHi$w=BHuW~55_4OT1y><#xkin^PrWwbbB$c;R{fX%$M}J$iQ{9x6
z*|gvo-W;>KTip9F)t4j{Hx|xlax-ETht4`DKFUAu9=>jO&i31{PG3ZIN~d{n)H&VV
z`{{nG!DT)B-MwUD=6sU&$W62;7xfhN5C1VpKc)l6jZ{)p;#?@j7`)oBh#@stS)n|2
zf!X=x0#s?sBCb8TN<N{Eddl9r)RE%7zKxF3f*^t@_T!FD`pu=g>-wlr9ccu>Y3KCh
z;OO}yJ)UKl5>xGDJTT}knd2wp5qadGnAP9}bOS2`9m3@vHneSOnxG<j!Ah``*n7zY
z6<IZ(&19b*A0M`Nj~)d&g${Wh-8@Hgjs|-4V^l*OSuJ`L)y_fwa3Y(6!yLWF$|0dq
z)Lj5qz(p;t_wy;hSpXoFuGP462RS$ljX>t%xHilNro3onAEy|67uq}0_L62G?Vn}C
ze)@??q4p!-XV<B`MZRPr&AXf#9nmuu^Hmpbq#|*_&M!mEUY4DUw<CH#xh^b}PkWL+
zqJ*%dPmd<oxkmsg4<5_7SDb<wi~Tyu+<}l$MF4t@b6#gg2|=%$cQQp<);P(n(-ReF
zk#s1ibSFgw>QO1vt6xnjAG%H{1?Tr0Hv|5<_V2BV-&NHt$@bmQQM>Fv{~^8MY}bi+
z1ZESZDZ>?I17|WMmvI_?bQ@LZ=OyBoZ8$}V9d=6U@EAB^DF7+R97F>`1=MUSRJeD~
z`3*mHhu*EWDAdL}PeDJ8($SH2F7h@SHWGTiWbC&Jm<PN0h}RP%5M#N!%E{&_YMr(y
z;B3VE8oCJRx0o|*#!T^j&7DRHImz6l_SkcEmU%pzQcb;zX|zf`wc^@a*TdR=w`$5Q
zo^q>l%E5u&ZI`FK;7HZL362y3P9Qla4QKD~T698!C9-<tF|E%@37jrA*-2xatp8Yg
zm4(&;=HskIk88|=P&#ObGh&)m7S>s=rfmnL)iEH92kY^wP13yvEx$p_ZxAYVM??>(
z7S?&h*k@9$qYU7ZEdPG_yXUFz_}v$=K5ah=Qa|GT3pSB1KbM^UN&aP6grBz-zxtoO
zKH57yIF`HLJb&G3pX~3R?)uM9U!1ge_x-1b2hU%4P4Hs~CFe9Ese=?cOrJziWHEC3
zed33Z>QVB0kS3=?yjF%acb|1eV!e<?WVcd2=2kN;)|$3z=5AYzm_nV}?6wRLx8>v#
z#gW<V9FV!q2Z({If#E|8({CU(|Lb?7-)gm3^%0Ne?SG$3C{{3h(B~5Y_bP17D)zer
z1BBTo$9_^MY5WDO0X-s!jlQ<5`ynFNVADNm!715wGE|uq*^AEQ%0WO|T3^!U48O-Y
zl7;Ui5)w^f#ci)^^};Ka64PjoOjx0&Uy6;=0VzuO%qdkG$yYiNlSrLdenTbD;yNy#
zAV-Ph0DyfG)X12TiJZ7cykQ9f4Q<*;dXs4~@MB7RWtVB`1I^Z9*@0DsR$A8OM^W_z
z?lFO<4$mt`3^J6pg8*4fUWuykG=G5-{@DT6!9|l&u4YAUZP0XfJJe3!sUd=4THL8A
znK|x0aC*0uzD!1UYIg+u(%nD{GU1&X?vsF5(exWBCg|DCh+|lymzLNWmNY;G`(pcQ
zAdY*@l@?93HI`OpDPK~06O^JNo&MT-hfK88u#0D$^dLY2>dKo2POWjQp|eebyH05-
zl{%DOTpwN4iqjEe*=rm#g#}Eqp64tRf?p7Dj&_>EaNzM{TTih(augLykCq-qqK&RR
za(OKKQsN(${@0x5bO2_wUzyWh4&aO)R=>E1<vBf=lRTr7|C~3CbS50Xn>PnI*E5=*
z&1p`@dq(@e&D%yi<ulsHbK1*c5BA_N4<mKglF+V8gee}5(kW7^z;s+FULtrr8ZlXE
z>F}dzzlRMmX?=8&eN2Z!S!7hL*1Y5WQ#yBIBBx(hnlZ&ih)LRwtz8z7z)Pc5`b%Gt
z3L-151#ZU5i{=(nGi8?1IFHsw(QpzaYyk$9rW)UqS1r4`JShkEm6u*adz~AIZ?BrL
z!*_MGdLeBmbOSHP?mXO{R^&(B=X`k1xcC=@sK484vh<pQ;9a(QHe+$8{l3y0PMe6v
zp2$>%nYsU0F5qqZJR-x@*TDvxQUn@WsvF-8O)t&2P0b)zK&Nc+3D@x+HD{_XTu5LR
zv6)5XOy8Mz9Ex{0Zt$OIvjc1W&$`h*{gZD?<4)UB#ccm`Z_D5R(!&xMFxuXU+++P;
zv&o<Dw8@o{(HC9%wK|%10PVK!blX=6UALGMLY5xCmDtV6Qe)OG{*5es@q<Rd;Un}q
z+XL^mz8SLN7eZakihz$ld?`aFE=GxFC8^R^;d>Rul0CC5n<h@|7#A&}KpZW3B4JQ9
z=a*o1OVMaBr4Y^ZnjQWq0}S>u6;A}^GXoOwMLHqd+mI><`3fJq$X6M@q*Ti<jE1N7
zgnoyUY&1B*^Lq~yz1hr7N!5eN;z}Mn>=<1mrDpWxV=~^E=edIk?UNx(0q_$70h&cM
z_y;whH8%5+^q>Rx#7~NyJkH0cY&EGoPzguBP*foPXy@Ldq7K*_^q(mUDNWad?W-|)
za|M-XGB+JH1}{-a5r{R)g8^M0m?CTI8>u|C(ZMoH;tt~*Tv#=}mvDUwH}{lnld<ax
z;6yA!i+V<FhW=Tv5v@99t7yG0ifWm~An!>%W|%{qS-AlHOw{&l6dA%Jd^M^IaAJl~
zC?khKCs$n=*Pf8J)nKR7!nJsne)scm;-|76PQZM&Z`p?s0|_+2lJdHDPc?7ii8<2<
z>XXT3hzng~uk7}Hor?_}t4}7VCbxpIzxCkAwW1s7@mczbYEPF6%6p}?6}DRT^@V{S
z0(vNH%??*Tl28<N!pdpOg5<&win=O7piAI3g2V$4I33eM$9}3Yb;8U5ttcP!T`rPq
zo%Hb0rY(ZbXd?|*Cw1c8bG#lt$N!v1_giu3W~{0&Pg2Z|lZ<Z~<xIW!;e>4B9$M)H
zsu1cs1XeBfkZ>k4I+h4;WJ$|a@dECRzeKkXRTUvARVU?bE++x>kextZjd?1*W8Nts
zU79`v7~Yu`z;<8}Jge}iiSKd)o5=&Yt^;*q9i3wb(y83qjs$O_xO8FI62&er+L}j1
zsmUpQVK;h0v6+;<5ND2_LA8drO{I*<Au4T#l(c@1dvWGZ;8D#E8S_UJ$5;E&;?bJ!
zjBE#S75i33B7a5R1U%>4sIue(6AJhlBO|!BgS!ltJe_z%wW;4KX%qKdC02ny8yKoS
zOoIn|Ce#l&cvF+*M@!!oOEq-q_u*Z6@9J>QD!xD_QBKTTJySx-U39p!P(mDJ%gAR<
zPfup2dM<&}F(+tr&O}eK`ZHEz^iNQ5rv7aGaM{X@v`0tJaEc2Lu}#(p3$NkLSYe&`
zyU&>XT;M;M3w$?vb(Pn==v+<9**JlpVC9pFejOTE5k($GzBxQ(@N#hCTxyiP%;fJq
z5QhtRFv<p!hzgxfC}^0?p1}EBsI*uVLyvcg)Sf`YYfQlm%ISfnSdduGClM$2aJgWe
z0O@1mb53zI;}Sx9FuGG%3ArXYa4+a!g4rL*NdlLV<D6lt6s?O{X*Db8g>v>K4COs+
z1A1oRxFGaXot<V}i;S`e-%me{#;zlm?54^&(1@{1D^t%Yr<xYfN(od<|M&_0L^!V!
z{H5}>>yF&~O4H=<3@hAl_%3lC*nuL-_&3nke+7u1ab`N7r4R8d=pRXm6n~^yQkGu|
zatKC`h30^3Rdb+qSI)sb0D-&V359{}P{dEL-ui6+MdvpY7}ob0M)eaxYz|l9$z*#d
zBUp*A0;2?aSG@fQ<1U1;Z^rA5FiZG_fT;pXx$I(v1P3p|)>+yeuftG$l_4vX?bD(w
zZ&dMam@o)Wb`T4uYf)su^+@8_WsZJ+q*IRdlz_%{?_r!Z0%${xMk#Hbj$)Rb2P$vB
zBx8%wCxdYv%dw<@%;N6J3OuVnip`&Bo!%I|xM8KPo`+i9hK3O<2X7>Bm7I<3+HAo(
z+m?*@EmcE8KQALDauD%K<a(o1=?shnkSt+TQGp~_=m+bAb4-s(s;RRDaL)f|oaa~O
zbZ`LxEEBh+hFel@X*zAVQ1{~@1t>tLDk%l00$BUz|NfuI`X4#lWW7}T$KbR`OM0D;
zX~zrbAv9h$?IlyL7)^6hsG&)GX(YDwOI}t=e_yvtL!LW{9~+$bS(1#8RB^>6!n!4;
zi(#*RL==CpC4-(zCbMyoKPtUhZ=&uUk&b$U9b7Tbr~}=ee<NV5M(_&$rq>&l7K2%|
zHD*|ZyrlERWd2ldm$5^loT_V|YO3Jsh~((oR0H5<5vm%l#{M1J)1p;K!efKE;)hOM
z#@1n1gtuDwaS0*Jzz&%b@y8Nm@T-*$(UkXy+z(!qSe4BsJSbu3R%VD<hd44tL!7%n
z*bKZ79tYP>Y?R6BsHV6cn4)BUA{ynSte7(~MTp82-|UJ#h*omS>^PNgn)sT|5+7Qd
zjFVnEU!P9|e<XUjs0;m3L!`)*QAO7)tyJtId|9oJtrdZS6N2WLp{u|<#lCN)y<^v7
zqrQ{$|0P8{zD7#CfPNLraqz+D3<ouO%eHpbMW2?8*MO}aPtGtoBDtYUvBp}Ze$HVg
zf|1q0N?<8k4}&CPQUvQCBaqf9pbryl2Hu95kpl5Y{TIB8rW5L=B)F7xAJEDQW)FI)
zO9ZFQw&=jld1^JqHSKYR@D%Gue6;Stx!SZD<xUieA~IrC3M{Xjax=GPi_u`)2=|hH
zTU6EN6m-QGVR@L4R1#fC0$^7+A1*S2$M-efedx|#=;F<W<tefJGL(whmak8?qb&fv
zp2yaDXmI#}-zaTgu$Id_tW~PuF&E<_W=z{OF|hGF^vnfObgdS1xehbTe6z#iV@`)u
zbH`Q!m<)S~ojz1kSfWl+XUSwwi}ucre^Qyc%GnnsuTM6dQiemFbAUYk&)O#^x<G>D
ze;ts-%UPv#Dp;;)J;^9uGoLysz3~38AbT1$4b7uFmcDV~C(hyFWn)Tp^u9{d=>TF1
zzYQo+lc=bX@srFo%w_P_=xptHTFE;a1mp=PMWB?bt_`&AXrslrAxU^b>8<YJTH@#)
z=Co>5RWv2NDM-3+F%gWXGDR%55@I=IuFUyR?yRsil4ukMsLn7q(4nVHKHIdnh-W4%
zFw8NQ6hoMV%GX=tDW<khD)gn8iOH4%lv)MOmf<UjWzL49>BQ7fDeJkGb;@~4CnsJD
zf{tmwWd0;D*gQ?}*O`jku{uj|B4(OwoLXz*<DniB3<*l*08&n-+<b}h02PYCoYO2=
zsu~{dq?WbIzjZpPB~^+Y<ky@^F}=#iH(t|nG;rZ3L)(d(PoA`bJ6VLw%vFP-6gI72
z3t%w`3bGv50EL7FyNCJM{n=!jLKa)svClD;l}S{$zyd24W_RCaU8S9PuXN$rbw}xD
zU4IwXE-l-6>9=$+Vnvt7fB3aBG36}0`-pB0@7=eT@8Bm7f}Kmk6f92zKduGa74Pum
zxSx~hP_x0L9;bkNWXz}_aJZx4JB;piKf8lWLQ?R2hTHYtX@c)efU-SP#ITi4GT6i5
z9p&YAK4@=n(zQzN7<*YWdwYv-yqnV-zZC4p$7V(`&RDb#M>iQ3kMwL*3YkS_^tLzo
z^e#G(#C;T)#E+ETA9fqIoy<FwN@wBOVLAhBYNrC4wZymA?<l!Z8Sp4*J4GlAA}rBb
zno)C|K1<=ANAJjatBlP`PvhCUXZAuaVBVSVVk)g<M~=hDB4FFYTnwn@A>i3=Hs~2c
zX9vA!!c*+NBa3@@p|+iUR%^C*OKVKg>m(O06{)Poed%x2?(oF7`CIvZ7VmQ1UZ7QH
zcJ2}<?@+c50mw-8;g;z;s=Dw5F;D?V5%40vV%CsObDi8OO===7`ZvNokKYkxe$u<@
zYrIlDC$0)O+`-j5mT%rt1rz?9j<YM#4O?!YBr^a89a6@ranzq)jYwOH<vbTg(GG1C
zDLtr)0G!1q(7_JVAzvWzXPdmEvS)6OcpFd-Nm{p+8;g0rHKb5dWqYwXQfXN!GLNkD
z5GxK}OAZ_0(ct2#m|*DHzPd3@xYv!;t!JGm;_#uV5gfc!Sye}uZ@r=BsUo+jii(r9
zml@R}uOJ@Wn?ZQ$lHh1yNV#2{oXUYb;R}P5Zcn;%#Nb*s1`pf{F6wbb9d*sK6f^i4
zyz1%akQF=FVmPBWTtm<d=oL~{A1fMgk%jbT46XPQ82;~HGR9=a7_80=txxL|zs`<b
z&6tE}r$Vz3MU$U4^9v`_oiP~#Zg4K_UiOuzlFpb)r3qTO9K>IFGRcg|Q0>XUY(jFD
z$lugN%FdDaJx+h0rp3gUwyGp8Yr3RL1i>+sQVKrd<&0-6M~poo=xS@|7l1cBq0x*9
zvHx#*Larh;Bo1pY{kW`2#ZS<q$8-DrI`}h~u|CRR>Qge4tFxROHjY57fX5HY>L7&;
zAr%6tnx<FP%4NGFe32aA^du-7t^L~Ps?l2wnV=b`<&UF0&m<oyy#I9oeLVxvl<~C$
zX*H8(ERxTyCQ@adaqJYYImu2G&>LuT**L0&&aZrG*W^@Z>Mt3Or-eBOS06J@9c@YU
zG3`zAph~7PMYHjqF}-QGX6}_VwOn(AJ(x2pJtGNtGftgXT{+Ajacs2fCWnA2zSzq-
z{vXRr+E9+U`fi_dx?^%g);^1!M9TVd#z0~DsOAkOc+~}8*upbS4iR65>5Dx7P;v}0
zCdK7sY}*+<=YMSwEE^05HS1SDDKx-yb;o*Q#S?|oO}ib?(ZFXgRCi?b{}Zl8XIVW_
zrS_4`W$>JK3}LEnFMu-YJ4t(=QiXWSq0Lw~S9dDSn_4li91zr~oaiXS91dz$d5@OR
zcbw+1_w-{r)QPrU93TI*cl`S3R26bzE>x^r-E#Hcs{#i&gB>3vqk>8#%U>^xx@A_U
zw+J_^!=xMIe@I4iJ$>j`e*WW(V;w~mjUGi<($qE@M|CyNoozF!Pv^}}HcLbyz?TP!
zm~08>9aTNXsxmU3GlnyP-ys;K7zsTp;9b`#c%Z@&lOjiJBFQFE4v_E?zhNu=mPTE)
zU<af&KIOIO(QJ^b4|BAfq$ilfjhAjspr+s}+Hth*o?`|xrei-^y@YKaW(EG^S;k6d
zIkjbyO-ITy8nXge&k<b-%jOZAd*D|c*TPWnLfC>|al6QFE4w3|a5iPa>C=F85zSO~
zoN4D2hb^i<uc?A>moe|hQl%3s+1WNPli8gTMX?Ff?}pSGT#yybIlT{*o}2Pu!zK^P
zSzUu%zQU6JbgbN2j1id3OV)zfimGP6umoUk=@6*`Jb-KEWe#LIA7;JR&R&&T41us*
z=GchoT3ui8pTGH+yM5?%t`_74b{{T)`$aaoOp433-W@v(e2`h&+S<hbHot$cZvPiP
z8ylO=jeluwHd|W{9(>>0fcKgYHoxEamuUU#O`-ZT#eImPf0=ft!^w2UdvkvOZ~D2v
zj2P6(MlWE~t(<Cmo*ysW6?^&UhSRaudyS~I-fXSHKU>kirO9yh6|jjJkh^GidX*GK
zPJRSW-osBL`DHDUU;gz14(?zLn9rT+Za1U-WSFIc=-<|&r|EbIL>dnJlm7eezxKv!
zH>0&l9&Y`8)JX;(6Ds}NNr3L-;Cb`}v$>7aKkUJ={b??0*ohdDiVPk2K-$5SlF2m}
zr%a|3;F0P@gXvozj*WP|03qtBDPVsb<~QIUvGQyRzjSk=F!Yl6>SBe6{CsjvPBc7+
z(X>0rdQm?|x`usS=i@>DnySU0It}1&IJZE{x>FoShuRKrqHD}(JDl9C(dvH9r^>s7
zCN5Q9`>Irz=$!ZV)}vQE`aX>w?ehwWu%i<JO@}KdSQDY59YDO`a!W}>e{wmQj2_*;
zPYKXrAQUh#gK$2+xX;Vu)!j!m`u*nG`u!cA=;~Me@V??afqoWJd(UM1>)tGmA$Vo7
zirOSVyH0M3M>IxLyVt7|)Ld<?X<3Jy4S)emKeDHH7ZbN*N(qz^lfrV~C{X^Pk_N5S
zO*WxnJwdE3wfk)M;3v^%D~=vE{v#Ioq<R$})a^*N<wD%afUr+{X@8aEb`6MF-09h~
z#7;$Dj8ZIe!W|XS%jx)PI>wuzrG3LGt;J}Ze$4V|F}R6EGQ=*dSw{tcNq5yZ@^lx=
zv}}GCoo5&5=0YhmFlihX62`Xya4(W^f0ZmsGHrqVWj@kUFh=l<$qtc^(5dPVis!-J
zWJpz#ZJb<_m0~U09p1p6u{Swx9_*lmO#ty9_R*ErS^!OEV=a2gRqBKbndF$5j=|@K
zO4zO@+S9xbh}4^?(sru$ExM~rfot5_Je#onl&K5C8G{_s!8x+3fCveB=JIJJAy?e8
zB$0{s%pg=F<0)IB^i1Tvg5XoA8U_#9KTqwm)WiW2PLEY1+JQ^>b-?Iu0x_}S<{FxC
zKBBOhaLPfLaXLf;{Kr&d0i!#i43z-JC7OgPJW-j(75Z^@Q(f;CdAU9&??nr>#0wCF
zCQ?xb>*yicDC$MU1*NkCQeyOT^f+ZwEjtmKEcL4PELQOklsuF^QmYf$S+oRAfUp*v
zEr#3!hinGbarUw+bTE3C>^@k)&@{IPYszeEyC?Q};#-1lnXuJxU0hJTc-WQ6T93;g
z2?b%KT}7&FA>4!oe3`g|i*kriOG2xuTlInsJ~m*p@R6#0s4;htexwb>q6(sY`i9ER
zWW(NI3Rv(2gA>P-waXprSuyFOze(v??mt3waG&)k1tdKBhJxd8IyusmF^G-{8Tibq
z5#9TF%Cwg9O0r8Wxi^rbCelz^lRks1f7oYiclF=3M<y`8lfg9=U~>F`dnn8=?Jl8^
z)I%@6rGH<tr6kdJ^;YUj$<ivkSmo`iUUZ#Ssa}P;iC?`&#5v3+6WH?hu%9I?S{2g~
zR=1KmLIW-|o=_drwBTAt*SW3h!SmG5*mR3(GbHfSk&7AxKQ6;<s!L~Bp_6Cy>EV`$
zAsn*#H-H9L8|v53&VG5gbq1(&M*1rA_*39<1kbY#_yL~&_Ras#{UJ%ly~|LGWPC-B
zb%~?bN4tjy&yU*sXNT=G0M$2t!;sDMZ}bZ%$ESz&PjGWKqPoWHdcFRs5j}Yl)w>NC
zBBHN5J5haWGg_sGjfUys^+xOT_#q5XAH~r}ZMMGc=QrBo`lx{g|F(HH4{0(V8x22l
z<aQl4OC92B9^STB(_t&vVRP%2J(><Tf*rOn@0@}2*5=oPv)MElKIWk}S_<5^T1TM6
zXeHY8JH-WUv>LRc>>Sn<Ku)#Nho{GYh`3Tf%jLSp%;g3=0o?l=S-66)-~A)IQMb<l
zVWXS@_i^(bosft4+sqD2EnD0YuqDv#2LFh4Jj?x7bhycF0Jwn;AMlTx>$m7|OWHgP
zb@)C1_+X3n!KEg8C(e$J_jWsX-H^ae$W5a*WCqkL`->|2YvKma*~;7W*OLBtgTK7L
z4e2k86SwbgQ~G0kxz%TO#}B0AFs^+;$6Ko7#kXj&j=z_V37It(cMe{i9KSx=zuia`
zL-+IO?_b!F+aZ2Fu49_ikENK;yLX87sfZW&*o>p*#+@!)ufzWbW>^aOynBc1dWP#U
z;_esEuthN3_<A$k&@<eKZ_f+_J46_^z9tO+$|bj&Uu(%<5p7z3?MeCmYn_y@xXUd)
z!`2s{l+P+<=Q<Ebt%?z&N1gNf3ELViXTw-h{YjC~Y&b~uGyU2J6a|3?90r*{990j5
zqdeA+s5P5`6|cP9i0<)A!izY~iD;~U`hH{Ue5=3p;QMv>>%sRAC;-rXu}Lp(ZEl@^
z-`Z+!rTEuYKk#CUU+jJV!`Am(58%ZI*dXxY1`oXnFKuqMzW)LL`hKJQ;s>0gVPQWs
z{NJ1I@4#C>^xqK=CJ)Xj`8Q=)<efGGWjFrgyGWw%^sU&id*FES^9i-a_wPmDdn0yn
z4@`4<O|DXYlTY#oG0Fqj@SB*18RhkF>*_c9N{JF4<Fv8f<FHSE!Wn+(I5{{l$?Vbz
zJn)qjN2Ts_>k*H6<@oz>kr@otK6eY^e*XxT`=_^F!z7bO!Fe(mtWGY+Q)Nh{mRrG=
znkApn@<Fhr=JaQ@+zhtVa>b068^M-ZT$$0b6>O<Qq!|sH!G^%$m+Q2wKXMDNSXkDT
zo%J@FH@RzL;QFWY^U}+Krik9yoKTh8;<Y)OXc_sO{7Sm6Z<iuc$~99ScQxVqT&AyQ
z!yK1>XEOWE|B%`LA+ukN%qp4wA5U$yn%R;BZ%1`a4@OA69rZOm82R~jRM_-jB>LM?
zW7C7tG2D(Sn;x{*<95{9bbxA@|4&kBv_Q-?sYj>n&gnu%dMe!|8c|r^i`~wPGi?0L
zH!huFQ&MpTJFvC+c5Cz9+lQz$=9BYxfY}DfBkP~mQ}b`XkN<9dPk(pu->q}}_j`~F
zKF7M@IlZ>Uul4ZXA2#sc-UIx1;|Kir{2?{mbQ(TLsDJ7+q1XEK?>hbaaGkoP4%hom
z!xoMBJx%hQCf29Xf7qfXTV_5FA2<!W{E+_rp4Qu<zf&6PhfVXOckVQNNFyfH^A9w=
z9<Q33JfM|+Pro)FIt_a?$&>(cPJcfjP;AlPo7AMo9d@0D8w^k06#Dlet@ND6TBixG
zw`f*w!!3H)+B6&S1Ht+GA53%p7k{;ZLw%;3W;@mywzNSHTV~uJQWpVel<p4(XBd)<
z0A1?j0dHC2G)!oX2}6=zYqbnmS~PB#LFZx)Z+iN`;Oawa(j{zpNDZ6x{CgJxexUhp
z(1;ItlIv#EA5bSLfvf3`m@=}p)GDAkJ>d>}^rXd8{oZXzliXxb@TL=>wwhK$dXhAq
zhJ50FpnrQb?gPeKT3wG;+M?zgF0L~0`PlM^t)AKR^aq0yTR*rB>9szsf)Sn%)cLyE
zh#pOQ(?z*%->ityjCZ!#H|V|9SIA(GNN0gzo6s7YiGlM2p3jzAh<&WSH)ni<F^4)~
z9PV{ZC;fHzAk&B&JmQ8qn?F1-9X{9yoQ@tf<m1c}V+!z)2^2M1r@xbjf$d1n&DNju
zsi%J*teYdybsI7sc4^#)G`)xPq|b;)t4o^-?MvseX`jBX>1u<X_v!DZi>o}1-nluC
z>kQ`&v%d`ImWy)91GCY*>2kCgAWY}`YVuY?Cc;|}%oZ?l-m-ziRBp??0vK~FsPd-p
z-to>p)a1o#xJkYB=!MOu0mXS@pvq4+S^-M_eb1r;Ed>e~*Sbx<cMmcn*!R@u14aP)
zSEw8ljSU4f`wHMaV!~_fCZ7=@*X!yXdpj6Ic=>#T&?NhWiW{3&L+^gvG|*%GS%0Wb
zA97V@A2-}JKBQ6ju9pjlSIYMV{mYbL-JL4;#s}w|?<~GCAD9U<Q_*wp4&LtXX{sBH
zpM1@2nH}uXgnw`w_SX%5u5TKgVT9+4Z$ooI_Cao$9pp>=+#*nnS3&_?l;b`bo=nMw
zs#7QHTV^31^S~#f)iuzQtCnd_qRs^a%BBD<a}xP)zSj8(Uq(y^&fP13kBnS2^g{Co
z11P>&<%qcrn+#Q^qSkf8%mb53zI6KT6_9q#SnJk7mL?BPhaM&86PIY-NnsBEEjY|;
zcS#3dYD|!s;_*K6Ety(8WY0a1eBOnNYndY^d@N%TA1)Vj_=V<{0e-h-;VM(VmO8EW
zdF0nN&AOQDV8niCakJ|#k~5>uXvT-SWpO?!^9D>Ln}JIw?U_k3B-btWEMaEe<2q;~
znC(oM&hS1mWoR0_YPq<|%)>*A>)1%l2FXhKess5E-6Dp<2+{QTHesmpuc-^1CXMyL
zB1*hQCdEw~4P2CCcAC#4UqDR5`Eaoevaa#RhAJ)p2L{5qLGo_XK%0TK6}rk>j3Ha5
zAyakcshHmW;BE(ln#W=az?ieeXuvm%=AuhT&REK8;S;*qGZ1Dz<Ogo}`SCZ#t4=hJ
z;@g-wUW}3ivWV7I9!KpL$MqH{{kTLYVZ*}80U0$TU9*}TW2tog!OK_2C#Sndr;n&w
zoi!TgO&n`S@z&}l#x-D~D0IdilJDlS9twK?n2slsIu|{a#YEMxocD5aTNYPo$_a>F
z4D)OBh@N6avgT?_ez$!bNf(Qw)G=6AX{(fAj%umRcX9OLZFB3L2|mrtpO{+QE}ccX
zw~R9)XAx_0R#q|->;K_xhO&KD@&48(zwabj)lJkRN4tw*oB|P4A7?OKON-}eG(YMr
znd*g)mM%D2ZaBIKH(2f}y~5yh(iX?iZUtw)96fBr@c%%hoJ0lI5Jt36l@s;1VGZWl
zc<e`}5ispqSANL@%;m;aCc8<I^%xUXEJhmez-Cu}9Rg?I250nAYSCUcEeIN|IOftD
z<Q#WWi<`~Z`l;F4*nF_{{X_L%6#{qJGF>SR|CjZMaEA$gyA6Fe41oT@6MxY@JUssE
zCw_-v{<4X0hbB%r9O#h>16Luj@~ufR{zw=wvd5t*ls?lYIOSTB>cA+%h_5}0j(_@X
zSWbYi1}^zkhdX(;dvMs^4|deFJg`L-`d=N2_h0fU$A6}i-e{VfQzY%pR|x~19sk)}
zUw`1oe}2CXum4Z{=Re>B_sjNI`ylt><4?329cIJnr~6Mk`~Hvk{uc-P=?`V)Ho>5K
z7!2B4kD@;=)8TcRMWalZv{&i)D$^OhF|e+C6J21?BxVZ0#3q#P?J^l(V0>0iVU;7e
zRWV0j7xU;5FZm6Hv#S_NJ35mxsuV@u%P0!8pZBIFT<n~Rd(|aReXS#nY7H8ypC$tp
zu%mv`;hh-RG0r4diNj@tZB%bivWY}OJ5np&bc%IcaJDhWLE?W?S|3Ga0&j!en3&Qy
zDkxeLxQdj52JcgXeGYb|eEa9l967KM3)CQRDOC$Yj7Gn{l!TWZD}ePJV~~nV4vp;R
z06rS@JyinARU&^Ac4@*{9?3=`i=A{aq)JENVss4Fv*FM-tO{*5TYf4o6V8b!0Y`m_
zc}c9rjd3OzXEnhvON_grFdA>sit9gp(T+OD&raX$p0uNbPW0;J_~(QD_I^~`?Z9{7
z``#R!zBqn;8o?VUARYV~9Y2e9kA97QIyl;oqxLVaPTHLgc6EG$GQ{CQ8y+7V?H#_}
zKR9|GJ%y%6$EVTZ!OMeF==b!P#+2R;+8yW*Tfc0d?7e^|yH5`e4^DrLqh|-FN6>Th
z4Eo)TUhSTo9_+n7+&zh2y*_z$+-buk_MzvagQI6BFi`tt`{;BH2FA{gj-&R^@IC6h
z*gZU?0e4@+GEO=;%e~`Qzn&aCe{mYUI6mBO!^5X-nBVTx!#0lwtJ^!=J$OlowZHpv
z_j#Kd9z#bb^rp=5&5JfYIyizx(eB>q!SNBoXYcsv^aQ@fu-ubVXiD(GSKl0T+Htgd
za?nBGJUcml8Ak|RXmm{dK+~f(cZ864Hwa#V@7USvPTS0AzrA}1-F2|N{XS8tuSz5D
zYm4sL^P|^io#WRhdu{El?L1@7#EGCAWZheY(1{`T>}-HU`0UJXhnZ369W{!)idmw7
zTDvdb6!%BTIJxr1hQ~nBvGQf0qy2Gmkq@5@Zk(=0lS@qV?sg;(&xWH=M@Q+zpHQ%u
z@{;5iOhtK~0g!4YTBp-K>$FezUcKIZ_UzyYQ1KhAy9WZ6Q{6fJG&!5(AE>sTdHj3K
zl5mlZY*zPoBl7-^Ec#^JyByblkLkU~!PhjKEsW{!#7xUfC>0#eU^u;U#)qC&8GH2C
z;p!#JTnosa5aw6Im^y5LocGdi>r0e(Ei3xjMK-D94^|mYnZ#;SCM8|+S|<5)P^Xb;
z$mY7WB<UX~Q{9_k;yLb-64gp3GTzPzkSS990hMfo?_5Hevvn)o2S_&`3d;6MT9c&s
zK%J@D<4JEa1$usi?I~Y2;4W!^2KfcR)#SOrt8tPIR_S;&=&Yxo5)AOx*SZ?>QB+%x
zTk!^vbNpkK|5$CUKWf!X<}sJWaW+lnqP>HxpGGm@l(?PH19rk<rA6rs(`%#Y8H@#D
zJ)ghF)}gUODD`3Xf;6qO*-#x;_2(Tz=j~<hb%T0pxgI)jyxcI*CmhAIe{Y{0*Y9zk
z4cl{tA7S+k9+?tMPzD@(;NSTL9G9Uf-rktU36A0KR1im>Xn3*|F9G8<a#c^0D2byk
zoLXO_B>UKe-RiY0hcK?wBj<F4Wliva+)Jc#yrb`NGO6JQy?zoa>yMlI3ulh*Z07x5
z(_ICOx3s!sYrk6M7viOcH{V`U6|cgm<~lZ#uYf1;;}hs7n9I`;q^4eJH?-2=YV`^b
z!(m{;^dIf%QjbfImKxC`Piyx@Q=c{cqH6k;OHjQ@Y5AEA?PtNd8<cM~iFTrHV-Bte
zIwu%|-nGLHyrZN(c%<Nxs{=lV4wd@InS%f0o7RikH&%TT^r<W=l$DhI&TMP=<d;bq
z-P$;~rkd-q@-&sXxYMs<SKOuO-Vg|fz{(z;y?Jr4_aY{!(4S|g2f$~qHg7YW&D7w4
zigU3>1TLm-9uLmzjoS?1Y~+Hyt5w4wW(Ylk1(!aGkoisBA6=`#s6bhXHNxxdzgkuC
zKcBzgQ_}zak&W>7{D<X#Ykj}jY(DVwzdhJo{~!I|KjL$rwJ5Udlxml&k`VU{EOL%j
ziu=q=1JV9KwMr;MOhT^%L7`M6lAO1ja_ML;t%Zf1vmO=Q!-9<kX51>GZa%rxd4MRP
z(r}Vul4Z(>RFJ~pnoA+`4_x(6O$KW^5PNTaw$iyIn6HEtRHUE-jt$<X{3QoeR|m^3
za>Zg8d6bW$e3Xt8(eDhSG^0B9oJ*J0J-A-c5glWlJ50T}7QM)?(L@{TO2{cKT=zz~
z;xk+?*2>0#C7l{i%+w#_BuSFzNH#)}&haua>D2&Bp53s?nRCk-6<Kmcwb@{{)g3BT
z)z?$ElEM|c{P%-bhX<Y0==kUM2`Y*XcYi&8eOj$Gv6Ocg=@6hbhz7|GWe`5Mr%cFL
zhyqaS{GR+VAam*t{xwOm0sTR>Se^i$jc?3<*Vfj|vp?XK{*H8VbbQ)=L<+z2EFJV2
zzX&@K8DYaI`A$m7cVep6olmS{J=zICLG_8s3=-+tWt{A5$frZ2IPBUbR#u~gOgc+A
zXW!zKSj!F!FsU-CBrScfWTTsoRnjhj8js8?l4N3>7KjqzQL!e>ZdJ%JmE}rOsV?W2
z0(8ZMVU!S&lHuVwodOz;Q(Mi<>7)b+#|c`TDGM8wy$%6|H%iif=jZ2=j*LzhCU~M<
zQhIN~SC!ce_nwg4J*$yuxX+XFSuIZ!?eOQ*!GNI4^GycMJeylIPr@Uarr92x9qhqc
z^aeATnN)mNoM;(yvn@xh|EIaN+EVX|zJkGS@~_cLO_eIQ1VTB`0(z#iIhBevCCRc$
zdQ~8>5swOI5f5n%i02L=7wC@D5o|B^EjW~#^3N8Phz<&e)S_d_1z-naR|F&tlaj$g
z9z0mXw9|AH;CPI$^f;8*wovGT^>?tPwd1;Q7<S?jk@nH)$w9jlpdRvKo2aaVFBZLk
z6`p6GnEG7-%Z%la_^QHMG?*SSnq21*oTy$(Q-oPyQg=z|wiZ1@3})&JfV_bD3xrhO
zLp5~a93a9_IYaht@*YyHBvk|(zTkD(NztAWtD`oS%NF-0qnV93#~znD)_Yf24N%7$
zYsx}30>@OSmhV*U9U|*gH*PlJgn?e4?sEC%Xq4Ox@`T)*qE60bW8p5Eq$My=UN*#e
zO{fuKiZ1iY6lq??ZBewilfy>AjjC2AKnSi_rAXu?aJb?tB;tw>pj{~7WG!L&ycB86
zgvyx@qhi{-R2cxVKYJpm93<=^Ly-dDb;<@lojMhh$jw@ub+64ro!B&vaZq*ELTN@H
z(Rma-q;!fP$5rEH0;C5H(I#I6ag<4s(|m}UPhe=KSE)Y0lnW0}Vu=n&$BDkNhFC)F
zVbskg3bcmw$=k#a710H0;bbPT9~OPsH1knYc_7uH2}X2R@QfJY6^VrP)StB*_;)ts
zG`p~f0a|0nhM;OVac`Up99Oid77B=yd`RaX<wVHznnp-?16VIiKZ$80hX&W@?Ujuh
zeCpSENgIJvpb+MG4CfJmIHZKRFk%**rrCZ6=+L*y>ACDp$|5Ml5~>-le|pxAo(R?$
z7RBLuqUzIYBf1`fxefs^Pq?3sQglp|n;HplI#f)aTyx_a3$rws6HUn`8c|w^j)fUP
zk2_}OoDhkyP4icju$8WFd71cPsvx2&B!q}wY|PGvjTTls^nP#!Lv?cWw%Dsc=7FUk
z#`&fk3B7gJdwSAbf{=wHxX?aie0?kWuPXfsJ?7%0QoA<k;}PB+Qsst^S$b{lf~new
z@M3{XL9B3j@W8=U8FkZPKE1dUA+V2y!mrSni7QtV<?R;a`Ez}JM4vyS)u>6m;bZ!A
z`0nAOPCSHwopQdGNX?cUfT+GjP-80&eQG>L&A&}F&QlBNevRkVlzIIwADm#z9I?C1
zu(`GIP*1YC>Ce)08s--i`)O`iEOn4w$ob^SN+qOqGug3x{w(D4=R`iZjt7gbqmr)U
zQiO7t1svmjgK$+e#US#;MVKJZq5Hw?q{t(0v{vOrY(<p#)j9iCcPbw?oe@A>-4n@k
ze6}#rcqObiT8qP4fQ@k6@ZfkLXVBuCl}u3=+-c}unyMFnH^RM;1XbVkdTHvp{IF0j
z<N#cM==Y-MvN^w(7UQLyocczoFYGRKS^|ANbh_g6Z}s#EKG;*8a1y@(Wt&{5KxR>S
zNHhu|*@&{MtF(`9R?()zujs*F`x3ahmYc0LbBR&qV&N^c^%&pPJvFJ#hSv8W=wv3%
zCM6{2eD8#fF{TA?s?_^kL)?mKcS0Jez9|E&CcsPJX~0<QYi1m|44b0i-9#w0nZ7D9
z$dURKy**SMvn??3#SrTl2S?qekE*Q`;cJ^11Ui8Em^#1`L!9QDE*#1q&Lw;?Tf29h
zqT;4N8CFfL{mbslSBK=ogx)`|cMp{`7!m_3G)acy5dWZ7C{mxIL@4{EoV&en_+WKQ
zD;cTQs?pZg9@I$wlEqNj8vu3lfnvE;Zv2l~K`29vES5z>V8W%%)nc?z6un(P2gKq3
zy@PK(=UYquyB?iy@b~jA`0x4oJB>e)mof6s@}KU1|5Qztf=E8Bl)=A5Wr6o)i|gRR
zvgvu>hA@#`Md3B@Y*h(H6e_)NK*6PeO!fV2soerCpU8rQV?9_R+!`y6NXnZ?j&-d;
zQr&45?3@Y~>iJ;g9iZWP(wivG$7r6+Yp`;X%94pvQ#D(5F+5vQa!Tr@PZP?YZ)lHy
z$ys_Ng?gq#>__W-@siU-sKpUImb!^Ev)d@l{m^8dVY+xASv5kQn%V;1wF(80%&a9S
z&hoCo@=77ZN^noruoXp|aNP^iH%!O&*s-oPKxE_DhV;<O$1tT)KI|7tJEV9|?=qNk
z6Hp-zrBCB(1=L&ZSq(e71o}xjlD=Xlu;*A3t20Fga;+(H4V`-mH6dI%?TbjgHFWsV
zyU)L0lCDh2egHj;E7m*c>_ZvS>8FHB6yWAsBC@OWc(&!}3#1Jpa`vG#3a<^7joZ-!
zy%w!{bEK6A4h9h&bTo(0p3zmE43sV=q&LJacKdy<D!^(%!Be%f?5Zo8B^|%SQ>wk7
z_?<Ttv_dDGEj3flU4JPWQ2X{`K!`R(QEtQo)c(*}!Dfo+T&AC>_Pe)uR+C2uSILEv
zSA^zxT&xyYnN)}=3kjvCg``y~dJiNV>3A3Z*?bsnJ&3k?^uP0{wH`hA9{>2hMNc;0
zm1r$aBqlt{LMl4<Xc~kpD|$TDnoM|<Oi=4!i(<4iDkQ>SlUgDr!5pU`lX=2zcL>GS
zpIT)|XcvcY&;+8=RLhdj)L{d%G3FpS;By}~9K%3;YqKF+=ukoUeYdlBa9|nuh`n*}
z=r1&S`BkUZf54hmuvM=z6n>+l9B9qu6kzsb)EnwA08lC}6!mlRR@|xX>-%_im7>M^
z!YFGgXPb0^UpW}|=%8ZxJPr;(6d8XsA*}Q^M**m+ep8Atgbl{JgY={ev;t5973a_?
zo#lM2>@L^~7h7VBXH5IXfdLaLA;g+(gJ2;if3~osTICv*=0*~sOo~{}D=G7#xaM$d
zK&%)d)~aS)>B1gZt|~Jt7_~P@vMViEl&3;0t_F&l3M>`NFokBLW+9Wh(`@7@tFGKY
z6A9X2QhbHte1;TULtj&1dm(y#M`8#kJ^>3v!K@gOhPio4TY%RoGTPKf4hQinxlwYE
zhINkDMvi6?Xby9@$|qD;3BWT!FM=^uC6f!-4yLh?isUD@!uBxa4^eK6I5o7wJWNo=
zK_?uQ@$^@6@GnO&U@!zl9UMG;eTs1o62Czw27bes28q?M0yV5K3@c_M4g_t)D)6A(
z5``ZxdV_|X7r;SNgZ1qnbST=Qy^rA=q1X+x+~YS#?GujSu-5vN`tl+;_76_l7=dwc
zWd7O%Ai^XMfj+%z?;YSD?O)okqTQ2UV+qrMo;&UT{Tkkb-*xmyeGYVBhxT5dP!Ng)
zv~*rS?VKK*zCLY7&ySDy3GAKr$<GIS?at%q@VG;OdyU~B`@5&RI6U?OP=lZ0@29Uj
z2S*ZGb8vLpJ~?^)3d2Ggu;*_8LI8tZXuVIcK0cx~1F()yC_*O~q$10c(3B1UaPQQ9
z6T?d|Ud1dnI%+>ZJb2zd+B4xM7{b!v&EqJR10MX%?yoA81viZ%RGzuG9MjfD2Our)
z|9pUx=a;cJK#9(QpbtFlyxw~u(C3;>^NKMo7F`mm?L?7hh4ZZT#}&D~VAO?qi0=08
z6U9V24^6;^dB*w!_~oPfoSfKH5vrOgeDLoFug==Av8@LWw2*uskV=@_TIwiHYKoD<
z03EA`rw7l^;LQJg2tY^U)cxhs<5kWEfmHD-`BZZ3$Xy@Wz$auTRN9)F2o*IkvapTY
z)cUIYP!)A0-;$e$t<xd$Pt25K;$NHB>+wWoz{n=-k7W7;rukVr+TD$wK8^PFqW%4t
z9l7T9X|<qhKZ#1#DQ!-f{VB<~WdW7|ML@d0HW<TC_O<0hvBvj>spTr5z;I1aFXG_?
z9Qm`CyPcmfm(05J3s4yK%f@=C&HC2UsJ@OlO1B!NADf#`Q4bpaaijGV^~mKPalj^Z
z3sZ^yjMkq#*(|?7&E<_|@Qtla^F}N9M$39*BlyO{r<99`AnWL2Egh{EL1qc|WTJFs
zdv6DDxPzB36|C3KBRbbFlY%@fKn5C%nulki47^zDHR<=~;SheXwjT02Y1&sh1quN{
zXDB1KR?iH`IY6Ts@ytZi-mG58FZg=jdL0+e6kFbhcUznC=J)6L@qdCb>#OE9AW99|
zjh9JpoV#|p>^v;kttpd`(g_aHtC3xLzEK`MwPv#xQ9;#$b@;^T!!Zh5Y05zAAXe7_
z85&p=iT-=fIa-bAiTj<_@p^(M@&-sOtfyF$Q_M+xV0ja&7D=*urE<}o3F?^7p8k5;
z?$rMnsLD>NJ{Q_umK*p(qu~r>JlK@a849ZCmK9PIhK4-dJvcl&e)bF_GjL#UNPM<p
zW!k2aV}V&1bwFZth;V7V1{`Q^5e~>c%bT!CY@#5$uR;b>KDfXa6ybEVw83S-&G-ED
zg#n#f2HL%<ma*JY3n4u(Ivd*a7n8&z(u9d|PFp3^g-Ba%ygYj3{fflGYy@x6T68>2
zeeJC3g)ixE#0QL=>gawAF7-uw7bJwU&cVO8d8y@f*-J$T$TB;!M7qf<7><9#TNo)$
z=(y1Mz{Qxsz40IFu`Jve<+$Fl(xuqyM;qQ1gPorIN=xRw<(&+GV&15hYp08(oQ<ob
zhF9mRe2laYL*;bwOxe?giNMXj(aO%dX}#j$%>^4xjSXGS{FVAUHkv`l1o!M&n3uHX
z3p*+&XU2RrZECCvEk79c#-dbpObZqQ`wB?~x+9dhMdiXOXd<M_M#+>O9YoFtqG{F4
zmwSYiUR&J}2|EXiCkXo1BejJUC&*i}w>-JX*n|lg#{>hv(0ZopG1FNVFA}(PZba{g
z-$((?^H0c`m&lcSNnfNMTu5Qh4zr7qW)Rv=3}K65o#RIIcPSo(@ol_M%`Io23?;;y
z%Pg~Dl`#rXO{|k(^)|2T6`IXs=##^z_o>M7Al1e%bPa>8!##|e&!19Ki{TA9J;qWJ
z86Z7OqHzYClHTf!SS~RS24DgUIqU2`YoGqgG^h?t<i>h~GCs-3o#Z?{&3F6#y2cq)
z%wn&xs_Frpmx{@hCuk|zhF5-6-8>!S-NST<t9_($Jt5HX#TD!z+NqjVDe63wqY9xW
z1>4<la%S*SOrK`C14}L8#5FFGip)Jss@S_SQIOlQ?MNU-8`9*H%yrFnW9$l%_B<O5
z*x4*`>Nc~%3Vi{{@m*Zb)1=4-OkB`s3&RG5Gez%jB&3qj&k~+U5E>`f1I!cmM@m%^
zp0bD~4rV;Z3ZY5mk_-396}h0tS7B+Z)Kt$xKGl=SRA0DKl+Wf0sPuV;PD>KVuZ;TS
z#hXOUIBFrAq}^{8_$V5Bpgkm**dZpl;&a7notkB()w<Sn@ikP)w%}?_VRgnwZ6^`C
zi}JNv;KNbI$S9czD>kA7=;CN2#%j0^0fr0pwjR~7E0GD6EZ7kLP_ib87JGq@Q1)>$
zyhy{S#am^ti*hpBs1KAx{wjAs0scx#l|4fyj$O%=NV1IRqvW?`XCVtM!iZjKC>>4~
zX;3YOm`1kNTg5IoST(#52XKPcLfru;!9jS$Pm>V?)kfHU6)x-EhqPY-wB?bH;;&p@
zisCj%kaSG2vDgY1S*wbwAuf#!!??4n?8;9r*P4O<tVrSGZz>ot$}|Blnd_att?qc(
zvR!`8nM<8UrMLMt`C@P~&{Qi$%0G=%4iJ6kw=La<ae`KsRAN<`ho#G8X*3xxv6BO`
z)$Ejncg~V(yX1OqtNTMoeU*fF#l7wwqiVZ8;&d?FSwpJB${NgLEV%=3Hn<X+VWzBC
zJb~YCeQ(?Ojex;4imEuev*URYO9037=iS4DeN?TSdyKxXqLpAx{~|P34^s{0CVV`M
z((yQlwF`eyJvhKmXY(20JRNEUoJCs}3XBg5i}f%uva|XajM;Y7fPelOg?>W)-=BZ#
zBNloE)q54Kw>Iate)zP+eKjAKXS=gq(vjV}XF7bc?d!xA>UG;-$NJV{6S0~!H_J_0
zvzq`oOHCd)%w{Dr5EE+S>u#shJ~=hV$v;U8eE2l6^`jm@C)4G(+to9(imK|<#YIxh
zx#5#yq%97k$UN^}Bs+$>%*B4-s20F_uC7-1A5%D&!NN!Wt~<ZO33=pgvGY5e0sZ?%
z;CI+}{rhI%_bsdaLzQ0kFE|8T=*?rN)TIo+bQ2T6fjJ-H;#H!B=IeXp@|%ZnQ1wJc
zwX^Av#B_{pth=SfbQZ5S<7|?;7ZTrho~zXmuA`+j3}+i5FG=}&U<vQVX#+E{D`zbe
z(OyZNC7@4ea<n_XAlC=&X=~wN=J`KerxIAh?nq-ZNpghjSuWd#$rFxGvwzA9(cetG
zY`q=ic%re039B3q%Ylm}?oD|wEHS4+lc#V#5*5y!S(qpt3iu58h><rkv;Rg`^_)TV
zkmPu#WKY?U;9Y5_7w{}+<ZH>BZz3sZ+X1Wmqu;?d+Bh3Uv+6!i8CS68u}eo7SPft7
zr6$aXf#lMip1*zY&Pr<S+9H^+*jc0Qqn{LN#xE|NSh|Z0-QBYZ`MHSCKk`@SMhc4!
zL%WQQae#7`@nu3uXN?vV=dUr@N)L~d6pr%=RuSAd59Q<fcBJ!iqoC>hj%!}WJo>f~
z@=t-6mBoqkX_v=4FO5j57$-y7o#uh|&Od<xl;L)Euu$hcUSqjw6PwDb_aZK*=*>Mi
z%gryGC6N4z$ygI_Z8l1iQt!6Bcbi+)?{0YSKCFIqa~3?l2|@*R$5*2P>T8`Fn+_9T
zs0l9>)kd>~idCS~VAF!LofHhkXNk8oLCiplM!J72u`s%+k7DR3#&hi4Gc=SaJX4P`
z*Qb&=bfki$d6Plvj^@KVp37mfrmh3qT4dlw`tF7u222u`js~zUosY>lql^HkjTw%x
zHmBI74e{(z7&k|`E{O!WgnjA8Zb0j8gch=_h_}9SAzY#xrJ{4&!C%QZ+3;gB$P7E7
zgdQdBn#30CB|&k&4g5q~>8~9*QFlOpRP(wE35ttx$##c<PCX%F;ZA>Zj%Hn!)u0rP
zx0u(g4oP|z;aMo;ZMyy~MC8LOM_Fk8%Bz>$`l?H=dyD4kz74!J=!fRJs^M<2WR&H;
zWXTV{?viC;TuZs(MS3mXq3)PFY`x>s%3rO+4eF3L<EwPI`L1zmK$dp-HiTeyhcq*5
zms#R+<tiQ7Ss`I9->=x^b*+{T319aE8X<D(D0k?6?xQ_-qC(<?KwDV=*w{-BJV2}?
zufxw@2s{UdUui>3hxqvl#MSLEOcg|*W%g^{Sf;}nv_|v~4c+SuTDfqCtxc=Ljjzxl
zQA5??=2z%&%bwxGTXpya3X`acz*cEaD(6)>!!Q3-QyX`-Hr1IqRdw{f+Q-$hqwT@4
zn6ne=VD=<Z3T4C_)<!i+=Z2aLWG$&S9Xr^JZAk>gAH~uFZ+&(qcK5xc=q3I1^{9`A
zLtV*EsSwcUOlpKfn$;opIZKluCRw}g9VJ<qZdjV%kxDV`)T%P#q2>N<m8jdm)Z315
zq=cK5W_%BRj+NuqMyt_q-ZI`l@NUD_A1a+@v=aGlXG${qqOCDzk&swq^u4xCUWtq6
z*o9K(Rcm>?ExN_-@Lp_}_d=jTz9CQiEonqQ0=yoT-~}L5mA`xeS^1d+`f_y(f&?Y)
zfvb8Bj$yqv6M09L7;Nz1vuySZGgiQtBa9C^oOR7kSY}nUM0N&bJMBjgQX>ev9Em`3
zYL&nzP($MaOMO<Od1ehu;8V<hXgjJq2zQ8|x-*S0l+XSe2FIJ>7s(cX<vkE|L3W7^
z2YwsPLshC%o#4v$bqYEnNhrCcpJ3xQ`6!UdTR9r27<`VCA<s>f!mUnPa1}VN{7+}*
zd9>y=Og?58iL!O591NJ(@j4mz8(IrAyTiiKjPqQV;<DRfCH1Y!4CmyqWdJRHTuVn)
zf0=P+8Pyg&`wO76eg2)p0O$2~njWV^{M7Ywj5_5G2h2PF;#{P?Kj73Z#!t?hp^}Tg
zvMONXYpViUUt1N>yt69cuOxZT$>fu0|L~>Jl22~XZ<MWUl7zO<bSKsx*FpQ5%D~s7
zDEoQ*m$H%Saf4(A_^ROrhi8+g+c!G5CA_~|k)Vf3v5J+y_Na~~R<scEv{Gq5fXY9u
z>XSXT$EjLKn9|$yYN@;?q5dkz;glo+0t)(>%OY97ZJ9GAOQ#R>r_pM(YXA~_2e(@4
zDXZjg=j?o2jFO%e8%Cyt1ioA(-rJN5(0?0MIg~R;mRMkDJ-sBkW%xZ?#z77dm_zg!
z#fZh*NH)H=u5!DbNw+<!ZHpjP>^$=3qRU@(2V#zO4_yaw$tta|xTs-ND!Ge5S4-rx
z*md*#>ol62ftZu7*!CGomjqYoM|O0>5Hvf}i80C8Fg>ldIm?N4U`NkjO|ZtCiin{s
z{?Rv1FZ=E(=4G0uWqMW}qILshMsmH9CtM%dbz+waYtVITFsRqbwZ6d<)l<7iWB3N_
z=a|Sbw*7!zD6h%hpg;N&gO;-k7nV;Zg-BsWC&%6<M;rSSBT`maVUema&YgD&*1C?m
z8~*kL?(~)~TWJtRC9Thjz)-zv>GpN^@cKigA=0DpL(~h+AM4@MxdUKiM|lJl?=gRf
z=GOc%B%0G3gX20E8Kbp1e+-a^17qOR#l~=K<3UL`)N0F_nf`0}BfR5nuwSX$dZvAk
zI*tq467{fz)@8V$W1Et=E@@P$4~bdwF%_5o09jROGpW}qPZX`EkbIw6bL+8sKw70t
zYn7zCY-_XH!BDB64J7MzRlR-GV9kR(Xjt(298jG4s%J~p(cCJ7TU+7p!Ou!f1%H;+
zR1%@2Dq7ANo3zx{*rXz(v7bD7SfK&C2X8e3Q?shv(<>`YJyH0!>IX$GG(R>0hUOQ9
zjZxucvs8GCjlJc;W@~fi*jt-=?5)l6*jt-($G(Fy-MLPVa-i}^|FL3oYy#n3vDVEt
zCMnkBN+?kZ@mwYKo;vDE&z1CDXO+@fCeL?d#`$We^9ASnFi-l`=lUxiWb*$eUHvUi
zG&k|i^<B=fpavb-(IQ6{-?V<?iRgvi?x5(w;Y5rUITPNYmcbQJ??Oe^OQ$42AVv$2
zh=u36v-9vS2V27mFlMyK8OAru<Ex9~tDkJaNd5M`Qksp%YL(tRbbh5zysF1o8<x-W
zGmzdS)da>Wa&;Ig-%*OV99p54r%t4%NSQS_#L0PDvr8u^iJT(o2l+L%e$FMP1~;7M
z*hG9H?<#Xl?6_|nTf|K_kec&fKp(tf+oM*!PyBDj$)B@{Vztl5X(}GP?v(Uw3U+6f
zfu6%|NbDAiI-}`C&yXDSu=e8(JBq<@BnsC#COcDHyev&8{8TwP)sSpPbA9s_TSTH=
zfN-klpygB{Pe_pne3u_Y<vnT`0n`sCidHIGYcgFDUX_R0+@|!!{=rN|kl6gr^<c>Y
zOL1?J(HxTtc_Le_@3qv6@+wV*r{_rEDMxsXzV-pZlR=fOG20%Nbb<Z~%Dl)(M5SUd
zOX?LCNGYb0MV~{%DBuZ>L9d7U3#ljvW0q1f*tLO9L~YV6WtNcxfui}kRXDATd^#Em
z8e%y4j7V|`RWHfk4vKP3bag<^v~o4%Bfk8{fHP!ZG&*clAlJp?a5KsfA+1z`?bTA+
zj>lT_e*F6M?D*N)$?nnfHgIYYtP->L4&dq<p>Ly_$e-xu)`)f@9s)B};Q05Y9MCu&
zr%M=fZl$Wa(ax*lflq<Om;)@Zd*YzJY-;43C$y*Nf?mfYX4-{l*!Kfyb@>trp>C){
zz{c90ZM_V*g7926*J)|A66@;tBI@y_6yz_UB6p<&E-g?`I9EYG>to&q3fKuajKvaN
zz(h(7f#k_?%+-9;xrK2SwIiidsP?qYV^Jz8MKH`E@8@ZOQyixrs-^u4o%%)*4R0>)
zabVC`;8UQw-PDw3{7WY0(+$LAZ?dZ%TF#rJuh00VG;uov&0Qv6hG-*{79%{c60p>Q
zg@~AW_>{ydX)5DaYm`f;pz*k3#-a1K;3{-xbWX_5^UwT?`b%hrePTkPyX6)$4qSCC
z=IuAlS@LbRY_Sb+Xx7Z>Ss@w<k+`6g7^+ozhP7&(xg`hr73ueFX?NA0+?6WcjUvv%
zkuM>IUrYwQiMcnNp@x5(4l#p`-EG;?iPQVdjzmPTdzK}MJe(bZe3D#S#;m*Yo{F(i
z9BArD77k~N-RXV++wWnT|AuR7OV`|8UmKV>sQ(hUl;pvR1#9_{7Pk1Jeil@Vys`t;
z)J#`g&{S=POuI|_K!XIt+keOwHyhetbC2q)k=^(@O0P!1yxUpHd@+N6I!dqWxSXJQ
zmp6VpB)Y7W#Sy2ul4bBt<BZL9X6rSP^%7;Oyk(*+3%%^8xb&KYk_oyUIBC*^i~3{m
zmd09bDlc4Ek!zqHm@}d)S<i<ozwBeUg%XzJD7($BqOXm~OidA?DD~bE3!KYpHXO~X
zuu%B2$TBIfo?W6e8{+iP)4(b)T}WO$U7FO+`J!ruNUoDy75giBvZ=1^Sa~cD*y~Nl
zk&{?(;N=^&BPN?tx=(oqni4v8b#hE($DS2bppo6g?c(VVIF8=qTE)*?6mNah1XAtq
zamr;MoJvI$SAUs|MsS~V^)effqGf|7>`5SNuT$<vD&Uil8+#JTZga|{^a^VaHFQF!
z*fN@1JAk3%;_GgeTFERgL4?4N%NY*_vaa;}JneDZd5?YKQ5S##>QW)WCX3f@v2sjb
zoc5-qC{>vor9d~Gl-?jmz~n0Jf#q_mgiM7_mPX88ljpy|PKYVxeews_b?Ll3da^*u
zUWGNPd3O+P#wiummW1Mw%64ReU?pp$=O$^e9s4XU$Jy|M3(O3wPYkjy<=4aNyB9;W
zV>##|x?KK}M78q)%nP=(raIwCB}h23p*yguh{XyK*;Ph<n$UFkAxbW=83$|Gpkk~8
zX89z+jnwHzCC_KURgzRT7QhO1P_S(05Nn(l2|BZ=bx0XyH9@N@2@SXL2P?<IX`={g
zYNhji4sWg#y@RKg(2B7DCOH>rm8`_Gw9R;(Q{e}NOq^&#Ji6j2TT9m*7zhww?*7V6
zutqh#9HQspkdY8!pLe$dO=FTPH-LaF;3LaPYe`jnAc|TiGc>#6X{ssQwRB7HQ9eA>
z$7^xnhgSW8LIHGXK-S4`&OCRFvnAi5@GWc7$T~}+cyzp7q5W{ef5>9&*Wh$a5)KGc
z3CK#WiM%6#U+l_N=p#^nu-a@?rHrEjgrYoMC||D;aoRS|<ftFXM?znl4g1P0^QQne
zR`L&X#xANM#g-+ClOIm3B5tlFM%w@qE2KYUUqV_q(J*j!9OWT_)HZIS%OB$d9cJSA
z8PD;=Q_61BQZg&Ua3HWDEa(T!ks<FI&>l=U)u;k4Z0|XhaGr94(<{s=n_6hlcP<A(
z1#88UOp12qTWe=ZHpCJK&1lUGH2f`6lCAaI?dD^->P(#sti^|nhn&2U1{C3HXY<=O
zzV2PP%s*5Pp|HDVZ3aa@adlI?i02GO+qbjrxL5{qx&#_+&uk=^9mI)|j}Yn;^xBeD
z(-nD5G0x+(m=4Gq%J(NJQ8)#*&fT0x35q6xbfxHH8xsd=Hb~Xy`UnJoQc+0JLko0s
z7Nz2(s#fNFlT9^0+S}_P1J|!Zj#gFB1d0x)9S^2Q!to=RTgIq$G~sxUR}?MXwx(^*
zg|936QR5o<l_SHD^gkww5<$mBK6YlJQ&Y|+Bls~S$DP>Y$baPy)JC-qQXKjbsg9q4
zi0KLZz!TBW;bK}@@ipf59i(cIqJ2b24<7$+N?NaBS_guzh`Xjv=0+kP3cd$zzgvA<
zm`$O}N*2YO+91zIPDgy7$%STM;Q3I!QI6@FLtu_0Ktl`Wg6U=GJ61nfb1{exOw>^7
z&vOP~_JyGA)0+LlOG|mr*R8JA%9Oc@C}*QY%otRwg2!Yd_sB=30-$uVog06l>wkrY
zU!}pz(UF0SM{4W5MP@_F+*eq#gu4$4LXy^7wRga=*h25R$cB&eM{x66?6oSKNbEK6
z9KvIgOiU3L*#(w!Etz|%FfJuYQmG*lqTZ;7vh^hRcJKtVg2Pdpn421Pde-bmin+77
zN|BIRw~a5;^)BsK)u33s#$r<F#WIV6hh9k~v=Sp!m>3b<c;u&T_E}gGpe{E4YSz#@
zz_(%)F}t9s4l<r57DG@q)(cCF!g`Q*CE=*$&y_Gu!WJ$QuL;cRH!=DUt9t|aRh?&S
zH7c_jjW{YDRu3XFCEv_aYBp;W`$kwbna|`dvVIP;Y$eJAAgRG?y7aY<9x_*VY`9Y+
zqL32A;mS*l$PCWPX=oFr5O0Ot<gg?okrEB*bf$}YY*uhYGbZ9fXeCS}WfISFj966(
zwCy6o)_B%#uWozYI~VloYQXQ$s3`Z-K?)$R4X0N%h5RvR0!Q6KGO@D|6n+Vo8OmEN
z?DGhVNcmn|4@@bjOwX`j-h@PtKK0!<N@$UaZIVV^0g1vuK3iMOhm$ZQrUUBqpxlKP
z5ZcRvD|Px07hPe5dd8_qJZTOMgIV+hA^JGVR#u#>8A!pyb~e{cVxg;m-Q)d)+a?zy
zg20+;!`p>-)vEkpRk%POr=hlov9o5qXmCk19LMG2xT_tP!ssj^u<K`LFIA%%!mXS+
zJhzDN|6xwif3P5=wZ5p=B^r=$ncRLVe^31C2<0>#I&litJ4?pe85Yhhl{mDAUGqCT
zW%VT|e#9gYIVO}>8J=;5v8@Y5^ihNZ6S}yaNgM#C!y4MGCoxmkqEDCoEfF~D7zIKf
zN3m?K?Firl+Eyv!vP?=#4#p%&eiXf*UX4uj{v+5$e<5t1xDG_{lRh+7v8NQnD`Y~Y
z1@Qa2gexdf{&Jp=4XM}lTq#W@+U^rHJ0-=$?@D!oMh#BrB7y^DQr;|qlx|lAS6569
zoF{VGd-BI%MULfa(-W<$ub>6?Mi_FrR>)rw`4(@+>WEd5MxSL~<s(}j&WKvr8`h{!
zvSGn-yrd(?9Td*M62FjM_)xDY2$J?9=}FZ&WuDPhQDe3O05`6SbGsd>ns>fy23MyU
zDvJWwL}4B2vaV<60cs)3GfR%mhPRJQwMeWntmX=RhiT0sX5JR*KUXTS>~m>fh;>zr
zIo&<ud^nlmk|*s9hh2y{jsxy3{9VJJKXCLq({a>mmo_0cuSpO30I+d}Md*uZGKPy3
z@q#_1*$u((uAAQEV$U?r2r=5ehPFdAa{b8tial;To{mB^Q1}Dd!m~+!Ml##B+SJwh
zXcdrt)yu%Fn0r}8Jc^z63vi~VJj-k>TZ2?ylj$R)LZRufUwC=y1})S~XtF+Os8Yt2
zt@ic^S|BxDn~t>i^|spi)c`(Lh_BMvkx3BZD~invXce#`?6@!GCj*KBuaw-Xz|vFs
zbyA~WPz%H>d`k6{QA7-=8#S1pY)92z=dPpkB5oO~UvG{?M)l47Eg6a^#zdzrw|xne
zGa{gms3q`%v-MQADOsDbQ?1<67VTLMy3TZ5*IU}-3QHhtgpQ94iz^3gaHBG!N;a7x
zd+_VGls))K;YlNf<z*r?U{Sjs#v%Sr@(M64`g~R8e~2v&@NK1<aPXx0-OG7^nYLOR
zn-8|WfA|A&<k>KrWFUI{!TV2E10XfyAyvV8O)2pcZd<k`1U`zj1WxIOU0o<Jj<~4&
z3QuWLELfK7nkxfls8F+}sfnBt=$QLgx~ON$Hm0rqc0~z2KjlE;h#E7bhOl33FhNsA
zV4jbELYMzNST@y@X7JtF5{<#2YROKU?}VnPwkn;S0%0fhDpGr%Bo@TH+#N-XhemQ=
z#P_PoIJm_?Br<|->(OYOkH&Th4m;bX(ah25;>D_pHJ+z;NdN4P3-?4m#geBn+EJ<6
zTd)cSM;T6ixo_F6<i~c|3zQU;W!AXAWG=6$r(bB=@L2)>jSyoNju3e%w5RO;<%vPS
zCMl(I;9ZFgGsR?R0xNS&NiIg08@a_osEKy#E-Z<|X8py1g46kMd>pcJ;^bx<SIo7f
zwdIy$w`kn08_vyqqO^Jfh-|1jv2~56Kpi3UkYu1<%KkN)hFVm&Od@^^3&sqrM&#5@
zH63k7tD7j=2~3|voAwbYlX?6&Q!9n7aOw@=Sd4>_a)u)xHI{?up!NG>v`t}=<Uzo~
zpjkP-zgP#3dQ6`1ip$A`xj1g>*dAQ|4b`us(cnf!H4-O#&CHGXN)h*8wz4fswGl4U
zE|=(|Fl2#?91Eo^V~#DPnwRy)qgA!ym;tfM6IpF)P<Tw5P62D-qQ#(z$=#rD$+l;<
z+heC@THw`$1^+CIE>Oe86bGd)0?hUdjlo}Lhzri=tEd#diaO!zsS>Kx2z;R6{#H8_
zR3`9|kaKz$eZpUAGPX{O>ZRIVd}>GYt7LOZ4Y;@k*qtXyz&`c-dLq@AiBn}!%7RFM
zJkvp*BVVnQXn{wJJy2Nn<0y3dz7X&k+``CX6-L!u!l=X|sCCb)|D`kU6n4uJ-gtSW
zMlmy^K706$jWV8Yps6_?PZ)if;_a);yDyRAgA?5?6)8}k{t_wLN2&s`ehSDSZ);cU
z<J0ydPEgBU!j_}2+}bLsqL4L>`d2uOzP80-Z|#iINvIhCUDiVj_wLkFVjr@#h~0&g
zadL&_(2x_8eDHmJ-cYZ-)YnyOVLFssT;-Z%Cux{2yVP5$4`SQWrG{W-+b}1YloJMm
zz)6ZkahShhb)0xm;IJ}-Y`8ia08?yxI*Tuy1v)aa0K6y}Fq~Nhk@H-9voYREK%;s(
z22K#D2{4wbVx+2v$Y-A5O;Y0($M+9XRg$TgQep<vPQS1BM`9F6D*iNr1;J0~JdfNj
zOfaRLqlBB~&5PON2q7R2M6}J*p=4=B*eahAwM9CUvhy=Ql}j=jRvYh=8wc0ayLPsc
z8F4yv9DH5NvKUzX$GjqSpgD5_x~>vx2wF@B%=ZJz!o5jgBx{V$X0K?4q=(=%^yu2R
zTzbOeIq$fSN|BLN+F8@VJu?SR3(6P<LZhEU3nyg8R|}odyX|a#wt&@{JNMkhxwWm1
zlB`l*$d+krx8_MMG`OtC9bMWlFuZB5g)F9z!LYX?p90$(BX<OVcRk<v(V5s%_)Y%y
zSZ&&?j3Qx#rWOYKB`rgOkt@WfrAd*IkB25Ie0ziZO*zcj(+?yEN|Y)!O3^@Jh&!B9
zxc1aHBc?JtigPXbaB18<6I+OZqbIij)*#83!^DFsoF-MnxNx~f8F5>V!ej3Tz10@h
znRghNk;Y#C7v0*%8}pJ(Z@aRZ11t!i#A;dGO|0N2j&r0h#2+da=FiPrS$J+{X&zj>
zl?CCV7q;%RNqfnlHyt2HcTS#t+)cf(#m!NYkxKyFd<i=F>BKB0mlK;5thk4BHLNTR
zglq;g-8jPuE4ytGj};3AE#jA7bu&Dbz+6frQ(<e6U1byE5HR~71zmE!Ril~J1L;4X
z*zf&lo<FjloAHGuq6?^y>!54p)8|^rhDxcCmFOgZ^&&#Gt^@@#;ii=$3VoE%QEI$S
z*%>MtXB1SXv=a$jROZAvL|8NCb7i0)C6^7jMK2yrWgl!rR5>fkgLI&Beq%5tqp~4d
zasc#_^f}Y<vi!t1#~}^l&ODN(4$HPhBT3e#eytNt2sXM=M^jv1`L%ivej)0L3R&$q
z`xY?zUE`50Zb#AE)7_Kj?Nh*e_%)6?$FEQJ@D%Wwc;{(!P<W6*R$S6iJ~y#{=wzzF
zTvQb=mpU&;SBL22w+4*P?GlEgnC|%(#rFcS{RA`!t~aHUsLT9U1&~fbWI~UgwIOuA
zJ|@f)vLf2=z~2cCd)f)TFX5da-J0Ht3TRbsMWkCUvKLi5UEYimnkXJ4o;SskIzhB#
zk^n}Le>=&F#bEJZB|U|E=sd2<ZzH^yqN)we5FLr8MElwoj})5{0R)fa-U1ZiD_AF2
zRPU^+2yql0Y42yeyb`@s-cTZF%CMq5(Z^Y)L=T0j35@)2R%g6lT7&D-%nxZgqV#JF
z@e-hI;#mRi@Ga|p>h?7qK!a#yp<dj%hf&fZ?P1jpyO(ic3uO*cSG8Q5)8Pc5oJ}ZR
z5F{)GT6A?mMP#W77Ubbl>YVRVrLHVY1g%Kf`G@4DVe`zBbTEkA333oL2g{n^2w4lJ
z#Y7xX+C5@vKiM3#NM31jRlcDrv|Z}h@_$$C%h`e_hHhwQJ(3Mk8Fx+LI6A?bvYS|Z
zd-=}$1G~|;v7sVb&=jFhKUY}|ZQ-V@z~WxTrMTSK>r;>AbZYCb)DJ+P!gBnpX;I22
z6L6UbIY@9?M+)4j$mKXP2B10z_-wmrQP76wTEX!tscs*6Kfp;d)^S;#@A`o%PopBV
zGxSga3psU?j+5$%Q&<QadM7&T>rwg%xIJxNxWI}ttW@czpSUszml%nig8|GxB}V9z
zD=VQj`qEiFsob^7I-rz$R-#*-$RYojaq0#bGZvMUsR=hjGjo6~LR(7i^!VfK-MYQ2
z$}QaI)q!GAK5>=Y{19+um8WSt){PeRmzeAQeN=YRrz{$e*#3BtBRVK&<RZ4b6V<Km
zQhL<-FO5l+N-i_xVImfUAu6%1g<vbofFv!hchf<B-H5mVo7*GZjg&qz<+Pw0W9SAP
zVK*0fMMAlfE8wjiSky;_i_5<6aM2LjoYmEkFDf}W>o9izSKG(AD!D7?DSa|8jccRa
z`<+*5;&Cd>QDxjyRLXQDpsIikCzGIk5|rb+_Yu<u*k#yFKuAP6$5@F)t&?$jJ{|Zd
zB2KV<&hn@I`&F*RbIw0K!eGi78M@rfyM1s7enPn(O1o1E{5Jmv+M~*rslkrzQs}5t
z@j)n?Sa7b=a^&T0vm%@<<6btj?JG#I0UK2)TQDXH-x*cBqQX9e!dn&$P4mxHAv24@
z$0kLyHb{snQYU4bbq(MpcAIP~bxCNZvHFg&Q5gF-s-Z6~YmBtXLAEw#8b-z#CumFu
z#!4WCD4nc5cZ~7DH&hoY;Zn4W+q!J0g;y9>*I^z*d-EG*|B~(CZBoKT5dp)eNS6Y+
zW3OKk(ft^jp`)p;;1Z$DZIEd}9zr3^fo8+>z037P)MmLmZGynxaJG>eC3fPicf83Y
z=aKBbCCJ2bX{-2PIZ{YH9Xt#n;bQo)2*aWZCzrbUk&pZ%m7>!sGcmGxX!kanjY$5j
zcBlJNUEzi!uzd?ww@Y{b-B`q1p}dRsd}tW?v3x^C(oNo7saYk4*l20FD6o<(Sz$pe
zUV`gYv~WnXbFZFGZaK=X>Bd%&o3WY8U5*)6Bs-c;<O8&d1}C1+F3N{0P_d)i74{^f
zxRvZ5*fPKjT$G#fi*&wDAWs}Mz0Ci9rctSSF}GIFGOgB=3YS?dv?}u<6ic}}@n4G?
z+IHHioKbf5Js7tU(ePR#Ry5K|cS^+k9~_lia%Dlp2s*Twg}96&K@jsDQ_~U`tyVo+
z;TMd1*Ib_}8qwMf(<MA)A5ObgQ+b5gTTYmnGs%RV7!J*!R>yJtwNV_m&=^RRJSJlt
zUJR5k6x~P8QF3X@@`z64F4~U8-)nh<w1sTUu|)tPawFih8D!}YpAFqH%Mui%gw#Od
z)n>qK;i!9aLpxC>XdyL@Wv)}1^bMT>#GAGyjfkhkSa^&st=$AGJKd3ok-BI5x#g_P
z{xVlo_|{~*N_1sjK%YMbwN)9`s38@@$Dv*DI;uIv$=p%L5a-DK%eyM+jOHMeQ#}#T
z>4<ehI^&C&WHdWlm@J%`NfWUgaI~w+$B?k5fINaEHqpnnxto82J<QblERb+P4wmug
zW?d3=!wMN^8HR9^C;R}ol>pL=VjReDqjVYy%f}EyJ|zt(dP)60&43<>S~yW#L`k=X
z5<tNDK(X`=N-PBj7vVvo>>|Yak7*n$fJqx1sK_stVV;$Om?rsENsu};sKZt^AvGs`
zZfu{+z-1Y_-*m?ksAzet>U=cB<-}3?sW+Gs-=erTKNTcSm>ot#{yASe!0gLHiDriZ
zk<*DTd&rzvRn<c`BFAY-$>UVJZ>*Q^5D0_oR6|+!yUM?=zWX5zm=5-au>0CL=Q4qH
zQ^ZhiChEma?(^7v<u;zVYTEO>bMX`Q&<z4yaCrewU5mL0Sj(Tmje(@yfrA~7VyMtP
zTUM}N39<q9c6$_iPf~i=QpMPkD(I?M5-H+boyH~XnDhJ_k(>&2k+fRLh|6g6nehNG
zZZkgtV&ZmCD8Ty%`w!R`xZ>d78R`qKy2O7cJ{-3rxz?Fl{2Y7gRN`_A?{r%DfyjR~
z3h~UeG2C+7iRcQRigKl*837VZ+<O`!IY5)`ziZKc&ITsySJJOAH)cj%wm2)KHAGnw
z_KL#5F_S`^PHJIZAC%*kd^)ZcAKya^f`2Q>#~)uTf|#R9U2R(^Yk|=|)9a?x->~oN
zY~{Gvs-$9+_OkOV)u~52AF>ggZ1{Icv2C2Fd~%H$FIBd6+<>e=b-S`elB}yWl#&vi
z)J&41|2&`0RPEx7@5G&aERzY&r0r4;SdvwOm%d9@>JaVtIFm6L3}%=MWj#*^dG|0K
zvTlstoS&yy3Nw23KgzRP{@n^1yH$A*)#!IhyND%H$`y##22KGYbq+Md!nyI(CE_xE
zbai-G=9_4I!WJfK_S>l<U#e!1(5m0#h_T_LCQhL)tOGN8T>90`?K>-nu@248l;ck_
z#`tTiB7li9Uo(lL$`hg>t3DNVrA&QB%{$4iC=*mq%1wOqIKWU}X!yy8tDLtMril3J
z#-%&Tw_sjms?Ox_j8%}tH^23Wq}c_)y^k0Kaqr{IUA3Tk;6>^$ITb$8LV|8z6YZZK
z`YcDU_g?ItkZ&#}zY<@VoLyl^M7v0=nAKTb;T8m8q&_yW(Bqa73qPNOPtorYjp^Og
zY#i_fXrQkcRu28g;H{yC3gPVH$27JOGK6KY?`GlOS}QlH+|Etfv0<+7>riJZ3`zUh
zN!^Hv!GJ_!s|0r!z*>7!RY+&3`XF#y13^i{H?uqDV8GO<q=>XX)g%W$Wz6shQ7OyS
z31wnMvRqCQgdcOo;a_vOG!)CQryzxvo>U@EZ#vp**ReM{V%#=dIJzE})!Z@YIJP|_
z@&}bgmOO!%Y>96O+Uy)RA9mQOj`JbYlkMbhZ|(drA!GKLn>dAaYLzvCX#?(Ta1y2i
zMwyXo<&HiQ7?8bEg%T&}DqEsdf`Id=xZ;G$7%%K|*#lkgN<lkVsmlR*g<v}<RkBll
zB3<Cg*aayYS{ZN^bX~@+5~pOCxmy5JP}Si?12<j(Q60B6t>-MKeYM2i#aYnN7<xQ6
zzQMJ>bAdl@_}%n#RI`2?POr4?7JmC}X#Z$CVe^m1RefGIDeuMV6EvqwKN{c4%`wZh
ziOxjzkywnO<}1=+s(t7(plq<|r@u`wV@b6B>AUrZgHLhAJG}MZwfa>rDEL1ZOsihG
z?2lRG#B=coUY+$OzVltH@(m*^%<RY&Dd5!^J#r!+?9IU-{M6}MRtKXoa(`v@zuQ0`
zB5c`+I5mR%jxT+$Xm!Z!_d>s#b<X~^s=b%QfUyUFLTL6Vs#!l$YGgNuH0Mdiq{!84
zD&<PH2l{Tk_36)AJbIhG3nuc`6B^nxv2?N_L+#>PDtFCqL1K7U^DY=yU9}T!289rc
zK_x|UeH3r5$IZBy^g%3B0^leekMnW8#_#xJ*wa{BTl0Uel>gkh-MbfL>h!b>mfdc4
zmK$eiA{PAMk9Xe<2K`zr2ZzsquYU5iO>=hsbLHkcW_&t~CYiR~$KTUoA9~?_N~Ksu
z6osYV=v2pOMPg0Jbj*1PNU!uC{WKl@2g(vyM@&h{rRH8;Zq%`c`e?GV9ajPzI4M*q
zvC<9xhqwca)l?HdP=n4W>B-JU*civ;<L`At*UR2h2IyI@8*??;<zDv;#HTSw*z$&>
zG0ap&l*sP{AOw@Alm~rl@oP~X#eRLYSqfxgex3w<lvm3B$a;UvHK4s3jY>RM%$2nh
z6n%b`OnR5LOSio1$DiKX=bjtDMNTyzW=vQa#5wruO2lpQx=Y7b*)W+{1&>JYJ9ta0
zDf?+V>bn_3UO9EU-KaHPa+rLsX1lx_QDqMQ10=Fy%9Yb3?G0jR>5Znm;oLebXjUjq
zm*+8F{_7a8Wyk+mwGhwX>O7P3Q0oh^ZPm)t`%c|>+oinVd@Q&#=v+Qz4FlY@v^7Wz
zW>&Y?04(u};%cZhuMXArwm_!nR(Y4~zf^46s_iPX=VMl=$hUGGCA*l(x7#j67n#iQ
z2-iu(Wgr=ZF(-~naFaM0l_q&!o`KLb)XsjZzEB+zi?}TW7EvvDxvIQEA~w2&tAN{Y
zN87d*hA*|5jR@__g~H61p_!DteYl`Fn_jA27F~Z^+#w1LsSFI6L1bLCdGf~q>CBEm
zNl(e05Qj0^MMT|{eKaeC)3@Tpi191(J?#EFYleI7Rly|0y(0`N2mLqrtusY@7Sp@n
zBAkY(4m2qnU`hJ1{aWQpd?&yYARYM?#-yhMoOq(sV|+;2(~7n0>>3MFwoC(EX%U*M
zIt@2#Nba}%1od_8UxH_kJYbE^t3er-U?@q~MV`H=*_}#(S5;g?CzZl!u}=$5l;*{)
z#86>ph~oDomnqj_CG2n%8U%n>(AP}69WkR80Akg?%?BB#<v+4KI@x_^623pIyqh$!
ze)f?fFi?M<4^;|$KPR2Y_tumwm!s$DkewJQxjt7xDM}81QIULvY5cVMGjF<;a1}jS
z>tg^-y%Bw9uN(NVsAUuszB5`hHlAqaXY^XeTLgf#x<mG6^*7sA=<fl->#@By?1QrH
z*|$8t<so-zIuu}ovl-2r4fLdE!+(pV2mhWq8$LSBNw6UTCEMQ%EP*P#Hdew>J|bAC
zc_LhK5=ZveuBVQxFT3*bawEb@g5{@OJ&hOXV8rPRE_3V1B+6r*(ngTeBHG_!p13rA
z+D{pu=zi|Ovq6T&IqP(wC(zG$iu}VtVDt6TwtxA6-f&L@j;9uke>3=DXS7FvJY~(a
zzP$M9fZrX^%VFxpv`L7Up%R4?Qh-VS;P+yQvokaOz;EM=VvVA|fM?;VLBz0Ry$@nd
z%D9x~m`06NfpQrf{W7pO&PX*}oes0#F?b)dg-j%wO+s$DY$R%|sbDiRzDvZ0;&O{+
z7)j1U)5ZkL<ISLA#Y{4$x!(Z&Dgp$osM74lLh_ag%8$#p-3PH#umLsXfbc;!lwOfP
z?R)@$lIbH6k5Pkol~OS$CG@amxj)r>6&dS>_Q}&33T{R~`_C0~9WY{O6?MQ_0e>Tm
zP?iwf|1(4jAuj4GfCc^~)%6vp>Onp%Kd<XI8q11OmquV3Yf8x~qY$tH_gi1#ijZo8
zTJi;^iu{{Lc}_V$7^xWulrjrlchSuVK;550zdffU>`YZ2EwWtU41x1Dd$*>8$-N7P
zOE%;EQoh5~yxcrHm|;ZH!RcHkcyzDzv4v+>4x6ne!7l<E=Ci{@#k)6ZM7?4n?{#V)
zt20#E-`GY!3*6_a(j2JTS5z|DVU&n6B`B<+pItH@C&>DuJzEP;I#UbHzFaY0v^?6_
z64QD;+e`4?Ubn3Z<Syo2-1x8D)^s-#H?2FDJ@=#Rs_tV8JIj~yG$nTn@w&jV%9g;=
z$T%Id@@?5?{hA<MsfsxIP~o+pu%Xn<I{4~Sx*7>O44e-G&D|7lP0#NFDq*6oC4FnD
za{&m$<KsZHE3>*c8{=9wtw9)2ATqWdFSKJS*p;%N5R@8!@g;0-RTc>3IvrwlDSe|h
z%q^@gZAn-gxVMjvPgj}DeaY2plH8hXtSY|T)EmUgIE9*n>Wc=ze796mc&MU_uqq*N
zIH@X=l(_<wPFRjr6vXaK0IhT;u(*NO1h#)9PcVZQsN?`{e;=0K_lO*o!zF0$*td(T
z3yHR^-wd%n&85<;iUb>Clo)%Bq8k;Z{$L+py7m)cO=6WFrkixLK{gSGqh)m+p(BtW
z%I{NPZ>+#)p3WdWC$;!>!dedQo$*`s#cvi9%maO$QWkqej*nSE*&jtC(a(CAaS20r
zt`knO&wi|=&84NN4u!2!`2b+ujJ0bz#rTZt!i^?pY^Qr?oL(i_kiE&69k8z#dDEiZ
zBbzk$^C@~!@mbyHFTgI;`FVrchDLNhI@vwiciq&a>Ese_PC77lJ2fY4YOzHiVA(-b
z3Vod6pKO~x{aYk_lLhX~a*@czE)oWpPvz%bu-4Q<c|q)x{54jy=!)p>3a`lZ71P^g
zdu-9dsj+jl1<i_ggO6oEoYO(TUZ}j|Xohq_{w+I4(c`4Of6zHQZFf%L$q>W60H=zZ
z;y(FhUhbHuwWLqV)ytaotmqf`;G4feUnryZ)9&=5ejZ0_YiqEHw4wX$r>~zkl*tl)
zJ3IS%_iXp%dFSk`@fdG#k@G#e&7!~|j9IUs>~>hrQF>i(C?_8Cn39ztfZVHQxludM
z^I9Bj#7^43TlMh!bovRp*!+SnE>n=lppOT!V>P^0AI<gFX5}>8aHLs)J{V5!0BicO
zJ3W89(R!zHhRaUF(>Q|Jt=Dd|9BKsuF`P~8p%Gk_H$>~<`d>fF>epL|wZ-ljo2?%<
zf7trI^~2U*J<>2ADqr8f8gN%r49~`Yq>95|I(87@4Qn?o(w?L(Vl)@s3z9oz`X(Q_
zn~QXUkMi?=a#O!I`505wvNJ@zZn=U?KCVqZo<Zl0Wxx~sG*<W-j%d$?6eTcfS`>BS
zPVypF;nn=dRr1O5Z?K}SiJy$$#~*?UdligN-%y)38NY44d;8!WfcEcE4N(EeL=9n8
zi$422FIlY~8y$+JHj(+D;$+*Nj=ymhS<v0Q=WgCZHyQk=>@OAC`3g$A83*>8?>Jle
zvY#U;X-CNz1f8yo@)7Hr0WP-Mg>7})j28afKk(c?z}%rj_~Q#_4`chBRw?w9gYu!5
z^|%?n{KfO<kPId40r;>VN8;8-e}C8iWR_k3u4usXtpPBdxXh9#U>48wC`HT^go6LP
ziy2z01Ux%RmV|JtUQ*?a1M{j%JTNmkXv_g=0UqC^5V9l5atu$cloo>dMWY|1_2^Ng
zE2m44qTxC3QTPojg6`1}r8F(!#HB71DBJi7b_flmu0vv}{F?nbnxOf0XV8y<+%WW9
zqPWCcj%NSycD{0-orzUBJhFQnLnL@M!!D0w$BR4=fL%_mDE+igPL59=MSD6B641)+
zJN=YR>dgQ?k}VPBD7Hn_8NF0OU<a|TGC$Z6$e~S;N0xA}!yus53X6l^)#3eB{H`&I
zdnKs@e$zIl;yRo3E{*c}|Igl=@3(Oz34{Ib>M6=}TLLH$BuE{$4tgOHk}&2q1ZmkV
zYv2M<Aj<+!=qi8|-PZTpci1=FC)v32ssjf_$?j=lrY#Val}BV`WZbc(Mj>U-hRLDM
zFMCdKFn0vMZ9aU+zgp=Nse@Wh2M@l@>7ll{ncu_aqCGs!b^!8$KOIa=4<g}M*Xl<r
zkh6pdJqKimmk)2w+wuMT?-;%?lnr9Ej>@m8f?O(M!M=Ylf;jBwIv6Ssr`5pTWSuy|
zQuip%h1<84qQ-UM_($XTuynVrb?$t(x@L(ySK?tXOn}_n4c><DDyX;+mA(v@%6cZL
z&eGbDu#7HJ?17x=xgA`)-!+U)q0Y_1tUZ-@QJFgplpcji&fI%~v$wD%Id8M*TlZYM
zg}RZ+>aNl11eqU2!?2gzi{>kp$}ZQ74jrl9rWz7IwIK|YKoi?lXeI-z0<KNiOxg(M
z`1lQ-M9QK|V!K~*)mqp1=PY)Cgg}lmODFafC#YPQDMy8I5xA5$@FXTo#frK~3vHYw
z^(33mi;Vd93yTv{Iu^VRO_Q8_Ep&1gnGF|O{lwX%H*cA_0Yh9}kAq&AtO3L+cbHx2
z>KSVjlOX7AduwZcw>u@>vg?|C0<RF&g4J{@Dl-`TalweEUMticRI<6k`B7eek&rWj
zW%)T{(kE=^6rhn+h=_{Bnc8(>!kO4Bsx-Wxs4UxPQ^rL*UU|4W%ryPLTssL}G5#b9
z@#)3et#>+YEivyY-HF@@R!o`+53|_g^!p3EjE#|P23Y24n-+e_Rxf?tk><aY0*K=4
zC<muWZqF8!ttW=HONpOZ7*cO}Bxoz8OaCgRPL{y4yMcDOng)e&H5vZXr|OPs!Y(Un
zop~!q{YPgud^zUu@PW(2^DKkq177ku@R`9c$kwCC$fs|KP^OGDIDd~HcqL5uz+N9`
zLHS0u{6T8VtsHduD?W(WVRs222__s`lb0oBvjJC3{vnQ60O4FfO!}lU2i7ftIyVOY
zwHi#pH|dXWW&_r0U+&PY)oxGS(!2gZRY<+rZBHM(&$;anZnu5uZGVV9pj3XwyLqa+
z_VAYM=IlgMTsMgKCWZ6{I#dLs-i<)rPOYBrF}K{I!^W;=Qf+7M>Cq2w=mZsp2d8z8
zsng=_QwmzjWS%y;7aZ3c-tO8>Zg=f=yR-Y0g4UnA-J3VL-J7@Do!zGtwEm3kCOeo!
z8taSbv&b%=#6n&7g8dvIqr>4OS-*Kv<MxQyFIaYJtjzO;k4SdEE2dfjridWF<Xas0
ztT?bhqU#h?za*+iWdm|8Ou`GPh3IWmHkL(;8D15r8@KTzqnP}}xz=uYuA852uC>bM
zP0qD;lXK;SndF+o;@qcPtg~kQ@FuZ=W{sXln0miIh%Rp!z7KC~ru`@q%BZW^-UR8L
zCw&UtWwKj9bv0Q<(wR)+5n7VjSGUCORECfi=OE6mH>)4Yhj=bUoJ)cW?g(c=voicH
zd{^Z5Kr@+}hO2N9_CokB$-7FZi!1=<bKZ9M*<DCiQY~(MO_Z0?EJ9OMEtdt+ok~+G
zA8qj%S8m_zcWpZprc9d{6xn7B8_Yg9j^4(`NmW;dyasYyzkiRy(fbvbG|aVoEi=H?
z)rw2l=jtJr>HX2ehg**pnZ6Al@f`R{yi9~Dr1BS9pOs%eY;3^)9x||IHGBNahyI2%
z$N$w<5CLeGXgUUj+I%o0RW)|;5dQaoFogbm1pnIvAmShW{z~B_H@C{!CH_u%j|Gi%
zK@2H-B?T8S&I<m6#pVI7c2yJiR1j$8NVHCOb{eggN*jldW*r(+?cuYXoEyce<e$?p
zj)MV=^zC&JOWitiG0UJ9FI3^s#<zM3^pme~VrEZ(D_w<o59VTwxA|?km<TSr-Dl{I
zP6blXIRu^5wl^O><ZN#2BbhIpaXE+D+s%iM#Zw3bkxlDQGaYdrx~Ns|eYjWIeE6uG
zeYRP-ca?rN!^3<L@9PV^K`CV5qE;?)AYZ7XP2JIErX$@GpgsENa!nOUgO8DtDk00{
zJP7kD1I**6@}l2z`Kin+3Y`HEMI6-ZLsGlhX>2YsjbhZzLH0S=to00(;A|3^oLpfr
z3#;F5z0-&cnEcU37s-MLP3UR5&Ig5>+F9cG2m5j1x%R5&1uJVB|6mtR!4W*Rso9eg
zU$f9c%5*@7%KvduURU4VZlGgRUP4=SHp!Xuo`27~?}gf-Q{J<fIQ<nL0sI~zgaA-L
zufOj7vT^UJ^`!Rht>@M9o@}PxS%eIH(()FFJi@$2ynICf(4{sv`X~(pb~DB<^BiRZ
zm{taLo_je5E&!0_w0xM?a<iyUn@H{2r9!W~8kN^XB>`OGASL|j_V6pgn450SV0jTA
zd8)IdT7m}&Szi=TH$z=^I6)12C8C{&s5>R$3rD@MTR>9Wgl#6`Dkt`62By2wmg-jy
z3v*H`rjG>1q~)SN(;7QqZ{-`10K=4+w#WsEFXI(Zcr2ElTy9y>)Xeg3B(nF@f3nw+
z^-f4-MMTz}JMdcQXqG>5?C-w&Zp|4#3#JsBRtZs_vx^A%Ei4*_<>Id}BEr=%i?6(a
zXI+Y)pbWB2SH`EiC>Z+TJSQM@|M`Vm|B|CpnCJMj*hKsVCc=~O7oEgRcoli3&X^_#
zem__YT-f;YKnr?)xWF`M3J;f^!Y9${{UAOIhzZQaXp?S?kRM&e6F5{)ytjl~71SG6
zJQUnO7zOaX%Tx``KMoo1_svYx;<j6b#6Q#YL8fWm&JhqwccD34y71q5`&1ubCZHbh
zeeoF?wfmH_U6F`zM77A1V9>8FiT0RJmv`hc@`B-ba;17rDpcl}f0Kl&IdxjC1?yF9
z$*PJJg=rJI6T>wZ82bW*?2KhYbt0z)fssbs2W5xH-OO1bEzs7%Ve)f=<6Mlbc#B}N
z1Fy{jG-7~lmN8)G+XbMeGw%}p`L=@Px1V_5P$3d8)#oSD&duA)W?6vU-Zo1BtH=xI
z7P|@n_V^aNZk(5CQN|Ev*Cl>U$~z@^MH?l(QW1Ts7^;$uph!mv4GK9COW4-}D%~<}
zXYjKlqY^u@8V7y%rvoe{fj^Jni>tJFjfvAHa1Ub@@PwU;6kk%Tlt^^O2<Kra70<2F
z4NNE~-^^Y`8UmPfgyi?$CZ>7up1{Awg0~4$oTq$BaeItReRxhNOUy?4IX-Cxlb3)u
z`;=z81aDL*y^U8|Ez_6PayjWGh+65FN%Gg(1~wl)N(sSOT)?o$N!sw0PVYid>^TWu
z@FNK^bY|VVUabrObn<RIar9|VGkvJkcRbr7YdRyDEKIUHpkks{5mg{24$27f_?c-R
zFU-x5{-kp?6wc38xschtw6VA6-S<=)!R>9ptelDJu1t1?+*#CaViun;{^pH9;n}lm
zLm`uMBK^tcph$o6>c(b%!t~d@o>f31&qlm>hARe6MKa+$oi!dDcO?2<kzfmI_U5Of
zDL`QC2zo~<{5tTNq5uII1(%X`OHD8jHRKHC4od34`GcPL;ow?>=Jz~%i)R)ARtXeX
zP{C+?m=>9;+&mzuewU$(m`~nEpS(+-(zc$NK&^x%CNBwx;Q($iU0VjZfFRDUb=3<#
z1YN3lLiZxJKIsnF1eQ$U9?GrhoTrNVEeBF^AIo*bO>vig%R|syD`7%ulc<)(-J~E-
zClyhHc15vb>NAUeB&I@!{h5g+ray-vus`T-GQOgLXeEM=`HhhS;s#k8m!41&*u=4g
z)ak+xane%RgR&YsZ8gpIn&TCK9~SoqXz3xGp2e*0Ql-8HRL?W`Rp8b_AG6ge`dH{l
zvLt^hndw}%toCT@+Xui-)E=3}l5fu@fECWuS5evaT(5)F3rM_Xzi?f60SR~k6#RVX
z$L}?dmD0NBbBG08DbEtuzmeffk)?l*oawXKe5q#RA8dR_#@H1<>GfA!EL!|V%TG;u
zjea(6tfL$3=?1!5sjZNU@2B^(f&O|o($Pj?cHE_V+9*s<yL?w0ZnoS{>kB)3w1^>J
zoo;<p)c`L;C%6wk?onETqTwemKiFoGebninh28!bZ_liwTTc2HXISSoTok>9Kj*-1
z6iu+QCIIiT>!!z0v;WFOwig&J7lAdc=1&E72CU!V=ZgU#Qz7@S0E}$e-rr4utrvr+
zBWyAeIF7{6;l@81XbWl2+HIu*^pmdN3r@#4^I{*c+>B_J#_q;1=j$kr3TYhYOiN9F
zt(Xv-J-DW~%91nLDkMuwGgI?1pwT-ENH0O^(j^c9(~42<J_=P7Cn$D|##-89<T@iw
znbc3ofZQ{ix5}PYz<l?p=46*A;7w@;j*O<V#?`z`{yyBrWHaaYt(n+qJyRZx5B@qH
zjPA^x+>eM<_xyXXXp2j7iy&K=a7}MAjKE1fON&_2gPWq!ncPMyg{B*`Vq+D?V}BU?
zqh2-RSCCzM=dZl>j=lEmh`AnlGGZ+~VqPxCT8=;Qj4h}+)0nvj4cdSbRS%b<7QON!
z`_aX*Hvgjgp(eM?emq=aKQ<TJk52A>%=S~2X>87%h9uQo5-m2DMhmL8g!2faX+mkb
znfxz=A-%schV=d#7@`pMb79Dmh`O0Sjjb8e*!m2Jy0ti>ssLBi_zpw&CRrpUuM@L9
z!%_PdSN|%wx-2!z=Za1B^^bSH4o1DOf9G$vpMSTHq;;O4Zhbw8yX%woxu2X@yEixn
z%BznaJ-~l!j~{N>|H8N0<3}5h{#JWX+kEu!;p5FMXjgl<Rjd8Y+ql6w6n>^C1A5-y
zrk&|%GM&+G&hvlM&-yBs>D-CNS8;fDKJiN3GOBF8Tie{I0i|mBgA1SPnzsB=KOBVP
zapXPoN0TrPe#b<RXG7$BdlBWF-^RY`AevHN3A*88zVIFv7R5)$h-{NM>`Y0mfnhIF
z**b})aW|k}I^oC%u@Y+tCl!{GqnQ4UrW5RC2*O`K<mlxJ*BuYyVK_m%<v5Nm!X6bz
zhRLA;vmc=|GD?fx2#A!ax;hNdtWWduGIJvdUnbQ>qa~H*29oDX6-vJoUEm`Hw-MF!
zu5fQ2m!~8<74%~dEEQeNtYFmczz>H(TrHXk3~2#HO$C<Pn|6b|*{E5_q^>m^DYvP*
z>P1~ji0-SMTZc`Fph4^nQEL(UgTz3ec8!a5nuX}~9Rwl0NM&U)odV2?)(jIizb0I3
zHo*yVA5omBvfY3-Jq>G0j~7uA(irD3j3!j86u<+o_h51t#-t6SBvF5Ii6~$p6@IWD
zHDVSjd=TYg#HkTu7X^bVJU)5dY<aE2mnU!P#|;m@9~~e5*xYUGdM|#4hYfG%@aX5`
z=Bw8y-s{7?-Ntdts~_ybufV@IU!0yC!VfF;7QDGaCkCF?4}SI<KOG%6S}pJJ*lX?s
z#}EC%0LS%%lV+n;@tOxad#Ah2gI5&~`oNOE-d=ORc>>K&4l6h=c9wn9JACQwH;#8+
z!=LpR&AsNy&ot!A=E(sL_Y%gddq?%-ljhFpUj5iRIz2u*Y*BBxzTIYPXRqGeZ|qiK
z4lu6Q_z@%#ul2gVx0hP(;hTfTF)qMa>kH~@uUUVw*Wlq`wY$yZ#?A>Y%Y54bAi^Z~
zfbbkOcAEI5@lyj<R6qW?0^Jg=Iy`7K{`(Z#!E<l7zF&U@Yb?!y4(!m*>2YHpCw}-6
z`)QrNXq_}qPEQ)%tHZ-x0(+}*{9|*c(R%9b9kvK?r>#Z>205wY@YoAL4Iaby7pJWz
z!jFJ{aMCzFK0P{V9v+lo&))!q00wn<dzWB+ctC3gU>zR+jQt`oXe%n-o7WBa9rpY{
zmUnVoM{u+NfIBC4OBfa4d15WrJ7~PxYrbk6>@@J{A$Ihp*=m$|^O`Me)8xV5)M4aP
zTt00Y%#FWVxLl#F^_nle`tFZSoIE$i-T)<9O+g>{wRO7lTA+`|V*QR?(vzx0IAuPc
z0hKt%VxV`{SJ!UxgHwAA9E&%(8V6qes0lyZWdFD_bYrCOOr%Ystp(!bTSc*>&Tj!y
z8z4qWK<-PIK*oZAe5`<i0X!z2kCRmn4Dh>8nK(RRxV!_TT6Aq)23(|>LqgdDk$rM8
z^DqyDJ#i_DFjh@uW>Sp%pHm=wTs9fT2QFvCB??KvBmYhu_XMDJ5?}4m43Wl_Vi>_&
zjVd00u}XB1ww%8L!F4JMvSgsN&C?+nAy`g8hn#3_TPtn9dhQ**_^&pg>>*-sTa+7R
z5h$D@N9ayNMFr8G@f=6Zm@>#YJn1D3hR-2^hYM|l@5*krBfLq%(bRH7Hsx<{s2=+6
zsCU=4$CEhag^umEJ%!!?zV^`npzHu`j>AluSrm{N!jlpJ)>;1RlU(=jJd+B-_5O2D
z`xkxG@KxUNEx#X}MD<<|Ax?%@c*g?5LX+W&FPQKf(VdIH)8*+~L7t3^*dHK74;TZu
zIN^s5@F-z0AdV02bX-Y-H32Tq1Lm9PDWWL4;dhYrn2Poq@kq_@6?!B`!+-E_1|?yK
zxQ7{*gN)XK>isSD0?uKTD%;I!ZY)~Rc2K^<8=hCNMr`72vRu6|e?8Sl2ew-ky(P4&
zv)FE*nCAs2#x9(~`_0`hVZcY^q2^y@z2%lN=<}|qBSe3dUBmvYq40w^7yBJ=906DY
z?XJl9$8XZ3L_Og_(jJKy&a8ED>%M!KGw{B!XO=#E9}OkDC|Ch(qZt+56)y-(gnCq2
z68~#E(K(~T+twqaS+NF}AJ=L#59m4Fgybl<+!@97%sHhM=JzkdgoTb4@Juu~_7f&L
zIX<0cJgKSEjJNa&PA%s=D^T{r?xexR^K|6K!sp_(J`&_*ihU8*Dq6@R8N}}e#!1vl
z^Z(R_H+BN^|Ir^nb4?sygOmj*ItVU;f!Cjox+E0=8(=MYwN&QoJQffm%xHf!(EKEc
zx*>&tYKcjN5ENKwldvF_*%AOV?S;3~KKvmCcYA+!+Q5%iy%VfdrE3<@)o8x~sDOPK
z7jWPeL^dO$Ndh9#Lxfj2xo5qKLOZh^D3p@m8zCnW#rzOSWA-gS(Oi=freJ;CHo@vo
z(*c2lheug0AWn%XXu=1->kkI#zr0GUjz75cuM%OF2vTZ4WD7gONl_5428h`OWHk_+
zCJhI+gsJ1KO7M`&qK14(^6o0}t<Bz2`BzcieUrXa6mykgo{FvlixM&D>}y7KRB*dS
z6*b#5waQ5tDZoQ`33)R9`g6{vHAjSyRf<hbu*9_Nc`@Zsb1j#Pt`W8T^aYh3kJ~zo
zUtZ42%zCX`A?*&%gzCs2h27H1>FE6^x*YL|S70&8)11EHtSZW~7rqa&s8uFMenm)p
z(U$Om#wd@ldye=yO@jV(fCx>b0k2V?kAfyI=UP;XrjrD21y3n_={h*co*%gz!W0?8
zn}JD@XvA2GIaDNw=$nV(7gwHS8w`4iWC$tJv*LYE-ywXU(!dZ7zxWPGow=o|Jr69Q
zC9?}rh0jT<d^4XD+QpoE#MD)mM;!FuB0$JmB%7J8t1MVT=vDX@9*jMhHU6)}yv3}`
zX__G5)Av)P`gbK;QT)j^<y}*80P<xrQP)%jiT{R+B)upgG`T~8B|vGIF<^-+4O|r-
zQ@E>+q_*+&y3{cTIWn{|gD249w0UsS-mm{;S~+L~E%x>fVMuDS9MxrX@))1Iy9I=o
zr$O`mo+tGLfE1pElccs$GQ8!r>9IfkkeYc3ep-?k=S*2i)zc5|3_qD}4x}hEpga~A
zRmhiOpcwTMMWv{ir_d_J`_>%1)##d3h$Glwwm6&+LXYlEG8{mITF=1U|K)g^iderE
z2IkBl2hq%>pF89yqtu2%C=8CI+e?!-=#KJY6QW=cxh93!N-nTIRfrt`t?pe35?N9f
zpb`*bcJm?Bs^Q<_wJF^2iz^j#TA|M02UpaT2SAZaW!*vpMmHLhimy+qMic><MP}X@
zxn!|f0kd#93gYBE91DHd{fyC30506u(PcojebGeH3C{hCFw#sm$bdn=50?SUkN6Jx
zvW~}bG>${6&oS_!x6(L*M;*BIJK=;xk;CJ)pjTF=w%7I6>vpSwj>A7R+Ao`py<Kl@
zjra~+93NRTSDKuW_~kOIW_$XvzIWQNdt!hs(i3*}MoYf53WP11m@IKaUuRmY8*}&@
zwP7HVSwU}6DJg^WhT_k3oE{hdp31wz6QQ1%W913)hzyY=9K~GmBrsyPywVB!Xqsi@
zl|Iajt7(v<nFdfMj)P<zjo5d16v>i#1x)gWfiLo^;39UD1Vgm@b`v%tj<1wFC5dV^
z63V#icfN+V!%>jC=cU@SXK=&iH{s31CbgU<w2Tdh0=I%(C83csSZhrywe{9~_GT!n
zm#5TP?<Wesv`@0FsKd{a(Khq6Xg931TVzQ5+>r7PKZ`5y456Q`#M3*acDt4z5wB8~
z^Q`9t;M*z0FLI&Fh*zjcc7)EtP?nGGCH)nzAxC$LffMG!TIV&4{V;|*Mqo}Z%0m4M
z(hMvVijj*px$FGY5IZ@$4ycwI$pDhioyV0F^sm~o7rJ0UN=CTa36%AYiN2#^wSZ^y
zFCxoC<r%gjN%`h7%nRF!uEk<Gy44*0sI4AVOX_7%O)|lhT*YV}$)IcHZXRjRqabd7
z-t#<t4Stl0$Yq5spe)cetf4m@=jwahATpa`%p8X9oXW+bP@p?74+@y9hxQ@6aAu8`
zT6o{AHNCmnwO(V-E^c(2E|%FD+*8ZW39!#vZ9YXPpnrfmU}7YP?Y=~(Caxc?_2xYq
ziPM!RQ4%4^Bd>awWP3-x+UEZ{$hjdWhWxS#+nR$lRO5#)PjwX2c8wXkh;NITTD@(<
zTErkmdnF5rgE&Y5ssOZQY_i205@#q?K5F_&bcP?aqA(*ji--6Oxp_3v{e2c5?LUJ#
zD=1OL9F-LUAo6Bzl9y%r$d;y1ALkNIKQudCD?0hk!Cqd$fJ8$kPv2L|u4$0<xQ9Qa
zf#}RE&3M&q`;(l0>>N%xx@<Bhfu26((eL+>J@%!`43LP80Hzn-Ii?qcz?I9?r~8{t
z@NQHMBI{KI;Mk~$jl+}5F@%aWAqBV?H|#gX5s@E~_!UJNbv-MpSO@*wJ58ynu5s#h
zUskdu0iCz*ZGHkPrF+IrY2lX0+H9=4d37g@NqeHe%B4}G*ceHgqi~{r6~dZKNsF(h
zpYtxdS^YjFBaNzik#40Jyz_8vTROzsn!lMxR%EU`Gr!rEm2kO@#P*ge%~R(=#;eBK
z(U}9i&WzCuWlMou)KJt5x%n+U4{19cXFN%&q=(PjFI%rXZ;1~3pXr<yEmPw#pYu=~
zlJ?Q5Tx3Toe8c)E$KH2r?4!ng#55-TVKfECRe6yRV?f3-(>_#divu6%D65`=9FBps
z0iOhsMVNye4ZF#VQlQqc4n{r?p>WtdxG)b=J?cxnAcq;{69^}vKfo)cJB<^Bf_sx>
z6(i4c6(dC~jvZK+%d(S}{K7}Kkws^aubOdZpcOtB=_{@nI<6tz7VbY)DYcj~YSv2a
z*)aZ41E3H*xEVXf_>7nj4=HY}c~}(CMIws=Ug!tcqkv@cBZ{E31AN?=MwE-dor@sX
zc7;GU3)jC*OafBz3}cQoxnR7jkOz-HGQUTPB{5Du${UUxkYqcn-ccM)BJzenS0j@r
z@z;D~*sodN>78keDU)rBSss02{qyCyKbh%SN}r|OSKYT3^I@e=z9Z`luhfM|t98-i
zf<X|)W+aUM(D-?#)1*T4YdB73P%yXiYkFmV{QNj+)QW{@iSMK_QyWQt&A44!sA){8
zvyoFfTP(ckub13!%ct^(;7Z8Nj4e$0V7l!W^~MxPEaH(l!40G&=z8bIQ4-p=LdU66
zsYG0_$^~62$xCaNSLI?ZmEvmk*Yc_)^mV)`t)#4lbW|Lo=8(`EajRUGP0aVfm~{_?
z6`5{6y}8~kjVBzC&hpF2Kj$*IMcWEJBcVIHmE*Pp&u&8K$tV)gufe9Dgn>mTPuzyt
zC~lOoMHG*b=peXk^^ye%-c9%n7NBxiAtcB+4H|u|;~r>oR;S$oO#{@w;@|_v_0M&e
z+>4_3)A1X0Svia)_kVW~B79f7D!2=FK|w&YGO+UldK0KKy<F-7#qCtErI|6EYaFH2
ztwa???#n6nN29mN6J&5Gc6dOn6=+%L+UuZxUyoji@)*V_D?p3!EE7A#VQbyoD{hHs
z8(a^xU4&v#f-XvPiNv-SRjY)t>BFDbTS_;PgToe};Cl2{@xPWP+Tr1-kI*6+j+!Vc
zr}|>%UvTCwzOxH|<9n5iRC9SA0x>GN0(wY}TH+C#HI(6QD!Y;M5Q##DuDPc<tT@bt
zD@mr^$LICHhAp=bW*e1x3IDBF6VB1T;|s9b-R90oj_TN;+Fo?_I{2_V9ga(Td+j&%
z;{yy<UQrfjP6s$08^vl5nidrA7PWOML#9#{7kNntsg{#Lo<P$v(brxuA>XcaDVntA
z9Y2MND!Z&E>yk2hYUiA#G2Us$BCSE{PrZHeNJJrRxQ4E|fcik+*zYH(nw@n5Iq|~b
zm@&j`*9~0FCup4vNf4n-L5AP!OHKyy9vcoZ-5_4XyHi+WmmSuqZyk@IJR{Ghe(b|U
z1Cx#;6^(@boO2wrmtZOg4Hfw@io>&T<PWfbpv!<`g+D8nKp0l+44Ch3G{t~rW^-%V
zU;>zXDP@O{2Jqjfg^Kcmh&1ALWgF=t)OW=~Xf#6=nPZbwLDs(;>DEe-Td2DPrlQS8
zJf-RX-D)hQ3Aj<k!~Z$Y5iI(?mb+T5w&L+?spiE;UDlmC6!Xr6fs$N!i`-N8E0U3~
zSD9_KDKC9#Ugr)}5m#C73496wl?L!Frw!#7oM3PdoIPr}W;uMZd46Qhj&(Y#=@Lxh
zRWetYSpM3b(MR6JtJXZ*XGOsy>noB~PWSSFLq1&SCuajCt-99Ne?{+v8aP)aJ@Zan
z@DTMDK0mKdZh-9Lf0Y@EXdd4Ks0F~XsZ91GO97x56^Vj?elG%KSmX|fgD&bRsQyHP
zX@a_Rt5R^8+=k?QCb_;b(?mMEARGt0rB|o04or-!S@lUg1x&ZhuMwql0urC*f@!Z3
z1)fz(uS^N2sl%t*t>+MsgJ#@gXK%(lN;_2Xe6EZ{J(|+&c!k|#4{)CtHOpV8RKo7p
zwrNgMn~Xyv3TgZD73E0MR6pBUAGkV>cbCI65)+=08@g#F4cCN-@@&N4Tf!&xg<X}O
z<V&3HRP=!%Fz_zuz!8@Gih1O9i<hXVX`;JP9Oqb-a-5!uSLnp=JDYU>z9UuZuzHn?
zo(+>KA-!^&C4^#poW{hEuod&yUJ#6bMFwi4!pU25U*}ZT*z7`v>E-oNtDu`%!g{!Y
zSVPHQl<FvVu8145jidi4N~E9T`J@;KEI=bJR>9b2eZQg~(puP=x%#=YjZ}7ib=rP_
z{ye;{-YY;@=M9e<hlg6!1lFf3*<Abh%jy5uMr9tOpfZPx*lakfS*wLznnB&*2oeo5
zP#F5}VN<7=cPwD)i8zkoXvV8XXp-X$h}~3~p+&-yGH@ubILo}xZ!j!e-4Uq-7|(aC
zSQ8=yO7E;Hf0<k_ur5c{24b|O=cIM3LS5otti6V1++b}RYifBmg^}MX^pI*%Who6j
z8gMNxr9d1HBy)aeI(WapoVDCXuV$ugX~YUvKpGmJssTOR5Y*obn8ePDDb`Ibbt_(G
zNeq0vrE_1^;k*29YN@<qT&FeVc{u{PjBAN&AIy92gR6UVUEPCj?s18LPM~C<bE<oa
zgoJz2(cZxMN7|`ls3N=BJrxNpnYlRSBAYhc03#VqV#GL7d?XR+RKhV-muA2WtHgG@
zJ}<P$2G6WyBsKU_@v<IeeEi(~A{CAM6GGG0_j8Az<Svg!H((-pzGS~rou(WD@I0A!
zuw~EY9AUO{BC_iEB;Cx>$0ud?;<Xl8Ft|=#Vz+_U7MXx)S~!V}OXhqy=crFqPz?e0
z2te#Wwqk9&(#747>f`gKqZ4&W@)>f{@d1L<J^HZ2qZneA(&-z$J!;~OQ)ZrppweC2
zrUYoUcUhMYS25zIjf>Qq6)p|$oI5K@I;wbTh|PD(xAk8c@`xlc0dxd%(fvJ$qoVD$
zBLMXjRL}bFE&1DtA+&R4=Zp$0h<&2rg!qGfp@Vp!2~@p~4KULjGq3iqpjk5ZyFudu
z>Ds~JN%Q5;EbXn}&aGJQa%XGXq0Q4u@K7&|Cs&GJwX~VgMd8+S>1~lUdnRRqMhSxx
zJc%xsM8;I>dHc~oUi@Vg5B&+OeC0AmVr=*p=wQlPYm^)BeUsc%xKE4h4ts0c$n9ma
zT&YEUX%v-3QyFJ^MJF8G<l;%v0ROlTKbpH=ffRoIDj)m86!wMpYX$hHSi{%*@FPZB
zje!Bg-ph28zs6r}!#ZBix=g!f5}CCJ7*jIc=lXnYyt7n?WVYib05}BOJ=ml_{_s*i
zw(g}&STqSs2vZngGcN*@qC=`znA44Q<f8YEc4CPm_vy#YK5DqN`c$mJ-mh<3X2x*T
zjXPI`2hWn%Rp4<KE-+xfEIpn>m_^~2vNtbah}Qdh7EIJ`AcxDUrNdak*HFRAU7C#+
z$T`@-J~=mb1Pe0gq$#v(7U#&MoG1)qCU<!qs`g7lz~*3($)jWUxRGa>bEq5AHRBDW
zIAQeRLg6on)5fth5mO(_Xhw=!JPSD)om83#<=->GaU$=o6MdXHN=o_ZCI?j5<;LUD
zUgCxWIorU<FWpT3mS-hN3DP`RQ!QXu|M)`>%AIVdI@z{5+18!Zf3i9$yh#w&_##U+
zKze(D`s0$^#WCMTe-K@+6y6vH8uy>mB!m=zIQu-Sva(dSvsngszmgaJ$nWM5KfCK2
zC0R^p7N%OrAf$*C0MIXH5r|0jqA5l)TeRwFii|0(<L9ASyEOj4HPzAyz?LUjz0X6k
zJlgo{(5oCje??eI7QU2iRdhkLZ9b*SIk5<kFd6wOz#o~CFbPL}l^bC(BEob-RYf@P
z50I=hNBwXVPOgf{h~c2HST&HZHqo)&!_yagjrPv#`f*Fjbs`e87(D20N{Sb%<<22f
z@U_gupt85yZk-&rU!U&R56UUBB-$@3&8{^>H$jqIU6kAZXP`@rV#^RG#q3JJWE?1E
z@9XBl&hd+%U+x{&Psr78#7w715XPUNPu5IvF~tuiIfQNQad3xGu#&rhVwAf91u4>m
zu@qZ3OvpbtCLddWf?fowJJOor8In{ysXk=R3BD|moFlJ(_!8X_Fi*K=$(dNf#%Xr~
z{;th`$Nr_00?^&BIG|ipJ4CXDfY(LDg00)A2*-?U?P9NNRd@o@8n4^qpudA!<&u5^
zr$J12bc+CHp(^7gDw0nkq04C(!lJls<9$}>0jMzdU<$ljcfM%&mrkL^+W6}vQF9e~
z*w3>p=`Vy;F3m2wdy46W<)fVT0V~SaP^8Ir*Tj2hzS)<>HIv3Jl#?){CY_pW&x=9U
zQQOagTuzdj8`4fPGj}#a&y%CiaeR1>LB`1PR6wnTf{b9*Z{cUmL}777Hupcr*;j_n
zB^Ds}X4QQbn>t)*X|yt~GNJB}-3VO}{7w{4Oc*J;k7g<h97Llv%EX5V1})g$PsS5P
z^b!7O_vZv2ulHZU-IJUXJ0Ypk_zLoI`$8^Egm5Dpl(E%i;4aR~UgnNnz=hgCl|WgK
zWB&?Wyt=Bp?wTsRSgg5nD`m{zA-Cv-g@L_bu=qCpR<V<Ikj5TZwCEy}#G{n;HlKy6
ztOx!C6eU3Y#(?_G2Gnoak|L=bC59>cEk|jMA6c?e)8_SM@<J6c_q~pcH$%0oJ`PxG
z+2<YLGu{`|Ve?<k^F*_E$n8yQykU&F8gHD7S(r<xXN>TwanLw!?o?LNV`QL`{>)Rm
zqo|_OVHlX@=m8W6E%FBU!Dl1fpL`l}mXJYIdojQt{8iU8XE~`H(-{G)T*&$=N4^~j
z>dfJR7mF^sfvg0dnR{I*jBPION-XC>EK?q{Ig{VYXE3iHLbtHbYAT5CPvQa3f)TJD
z-Pgb``Gf3ToRi+vxt5Cqh(xIY=c2+cRn{HNT@b5u415skfK+NR+Z&iNlBIu_oN?cq
zRr4{Y-iH2I^PK4QV?FYb(RsQo4bgM7TpkS}S&$$CTlq%EvHBiNQl)c3|4}RBJ#&#N
zDKjvR11#F0>Sf|*)q4$0B$h`+9~i4Dg39}gDmot+SX?dXEfQ~tseF@Ql$fkgI?Ygq
zFdGOhyCYfgd*2@mXUXFg;cXr->b@aykaL~pmvNXcT4RoYJcD8brJn7>PPlI~Zy#sR
zAU7xCQgg`jfiIYa0_<Ebb4=P}dl~9z8w$PQLbaI;Ub&eE7eyzg8SBqgIxQzOMhMDt
zgC?4rz%x|HOB7JMbm*V%49?*vbfz}KmbdeW>@u_aqquiY3%{h#&X;EkOBQ#dU3b!q
z6FPJncNs&<mCKG{9ziZ&Y{{;>A7|6Bn98vqCqWB)qbFHVY`&}9<+rkBS*{CIx?XSz
zpTM8u>#rDd49WmRd8!!(6b2skNRvg=dJ|5RpRs-GI}9M5wj966B*!sQvk4><yD$%l
z1z=SIIa%kG+{8YRF32_RZQCv~HXd2G#b#E}OWua>s;+OX{c?)SvR|<Nx+WW`-X9om
zLVI<2c02q%f5tOrZNFswmDRLnW<G27s-M*C)rBFMQKC!WE=E^W_%-o5;n^9`e$j1p
z0+Rrx8x6;Z>M9$RVRq2ErK+S&rDVWF*DhFLNnPJ1E9jE#PlB_n?>#(K9wr{KYl-XV
zRbK~}65|t&`cc&>8gN`c*rklO?bhiFw5Qci8n1qC@1O2@TeP@l-;<*d!o1=uiL>_;
z4qoy-xQMP`0`Zxhx6*Z}PN;AltaXZSV{vhe2%HYdH-9=Bgu{@M*$(L@gV)(znv$l#
z{mO}bBahlq)|2z>SP51TH>G!T7Kq;t_uH-d{?T5eO=YXS+Q!C)qMq0f(E=m`WV6YU
z09ecu;S<_1bDE!JQ%D8wtq}vJqwt?bm1MlIZIPakWm(EeT<(0%9Q!V$o|xz^!w2J^
zR;=y7+fM1#ltklFxUx4WU~yIZH75rkfyFgr3;I!Wz&^b0D$M(!BTv0mKO$75?W2N3
z{(wY*gb#$na%nDUBab@=z+_=L(^Q7R9raejt34qHfA0R$M~96wICU3+PWdA)`FIeA
z!Q?!m!fwA!lgSe$#;mA>9_e$lg5lb5sYv#p%kyZ!u?7L1I>L6<3B{IkFaRFZ@B*Ph
zfpr`;KyYIndo-P3A*yf?V(wgwV^N*xpsS>s>hN63Wg`bdhF_qJk;&k13Y@8~?9{cg
zEV3axyYdz7JEExCo?7}2G^fnI37<b-;40)^S2q{Aw=%D#E-O3*3+q1UFr{*E*v~{X
zqjA>OiW2oN6c>>WiclZU@=+8Tp*~7MGb@T=_C{n_k{N*A%;~w93DJrk%!)I2PO~Sm
zxFSh?GX6RXAVH3T5kGmnBC&_Lnfp_jn(@x7Fc}Eisc<~}Py=*$paZl$@51|jUV|s;
zm_PiGE+&({*j`t8l_rvtxn<TC2@sa<*FHbFxnL}CS+HSPeJ}s!t`tAqeC_!Rs9W1=
zqG=LyAl)5fE||H=97LWag)H2WTeyKU!(ii7v)@%Uf^2jVe)2CmPJ>I~=NK6%Q#o$5
zj<!5q=8BBBBW7pm{^S;${D2g3DxMa*CG4jD+QN1)*q<>M^1b}|#Acrsybbb5x*17d
z2e|=*`R`boAG-86`ReA_K0B^d@$=^LOT063MZ)whek#4YbYk6<Tq{=O1zh_O0d7?f
zWfp+5LhE}}m>b~BXtHy1S{3OHh0jy3E}L&-$tz-k>){iXjq`}lC+QKF%+xf4f!xw;
zpo>gJSfTt+ZM0H7%o68VIGxNvSj|p0M_fyV7(fuhbk#hX14YOtU07-NT--KP2)z>d
zkoVMV<+Q_jR8sscbB=yDUF|kUeJWi!+%CrHP^f;;^{0uh3N!COBJZvG@v(xUHwcm>
z=X^Rmtb#vRj2!u}p~zrkZAMst>W}IfQiuU<?gJd}JUlxeVDN9y?}y#c4l2@;$?B}F
z+s>Tp{Ny|d*0TWYT`)n9P_{H8FF`BxyDAe*3JDkzR22>6swgILLs#u^62b_%$<Uh_
z1V^V4po|wfO}6^D47ldC(u~a~<-%Kl!MW*Nd8tHs?vhi9mGNR!=|J*mm(yP7YvK|u
z1=uk=`3{BDldfv^Nhc!-A$}eb5C^dB<+68<VB`YI7L<&TluloQ4NgZOQ@;mTy7Eyu
zgFto>wuKt~m|LlhioiiD9yjQ5S_BwAEo<S**VgQ<azU#TGhA|>9HC1(iH@q4D)|O1
z&|(vFvU_2QC}bg;Tc)FzWe`ekBKuxw6{^k`iRZ|rw&TDox%9Iz99mk$lgV=E@@z%A
zlWa;W2l(kD)eBQ3TW1_8=W-Aao}fvcbDf~}d7iSl_;$_S`fw!*6M7b8uWy|aghoUJ
zgw?CQGL&C#Ppw17tSpl$+!@??Fp8#U=cEaonk&TW&Cm~1ecYuXDMjP;MfUYo3KdN3
zOPi-KrWjn9@;JmqJEJtEljI>TTCAF42&~d(%|7)HTjKYgWJ-iCr88JWK2IyP7Qy93
z<nz3KoqHuKC!f+5+tPAYy2YK!>w31ZJWonqPA<kzI+n|&$S6Q?l~RpiC9zzmj4)2Y
z6IaIrXU0w*klFq`E#fC<XH3JEsCkK}@+|-A%}*r5r<&7-+@+}+jQU;$+CIsoG!_7!
zpc*^kWN@fr<}{;1I&4<4nN#)M>1>sYccZo}(vCnTaLr}xd7MP$h)Q)Nw<>2pEn-;l
zLrGu^51E&;>2CfFV%Rx+zcMd*n+!%snq+&#Pd6G(!ckh&?5c%mdv%nUwGD5W)U$qv
zxikOLzY-gUKcRx06b+#2vQt2{Rq4m#L~`rx-Rw<0Bi9sT;gW=Ic7HSOZ{o^k@m$%v
zTa3n9-XoUi?K3)Z+uqwZ&6C$82DIM2GdY~JadJ*d1Y>Bl0G`TA!sbT&+aWVlpuk9_
zl9^%qxwn-z$w*Z3taxH{5E;x0CeDllvhp8)n7@JiKR`@LCNVN2-Ql>D&NH)Ombg;R
zgbFx8tP=mHt$fK9kmV0SoVJ`~sJ+qs+Y@sU$bqyKBQVRNTtOqUg^}}AMX%v4iXe|e
zUp5!5cnWJ&W|*oiBM{>jI62(xY?{kjnNvYbb6j-NcIJQ0THuVECC?aLxeK^jv97n-
z$Cs;Xe7y6wKkWnH3zM~kIED2j?ye6fweP;$dc5}NLA85BV{E|Z(W3|WZ|(8J4f|jG
zy7lPc*57ImYMYN9K772n1?_4Nw>BUA&D*%4@n?Rf7`W?sf17pyU8ghJ&3XQB`dKHv
zW!>9Z8^_UE><`IzX8%MXfmhnx*m$u1-TLNtp5##~lT5ZlrK>tu-iiNy`djE7gvoh0
zoW?#0Tl@a|2(IFNf09gx@U2Rx$t0P7^k5COo6;llJ^S!A7=h4o0_+iLkH<+c?L{KO
zFn@%75D$yOD0lfH=;LiaO@M}=?~AUANW$0z6~iz`dQ4B-@ILnW=s_t7B*G|)`BCSp
zP39qZMt>8_2>)q|`znvP6OFH!4=L@GJ%mmrvs{8f8ZZ=$R38kOi@^YRc6{J&kMSS^
zDeO$S;tg~_ier#+qiNg?=$B4NHH9&5J&`>7FnJ-l*b66W>`DewjC33a@i3gAa19%L
z5%$O#Sd#JgBM_c0Lvjcj^{CViajy8@Fqk|MW};S2&5j}<Wm;Im%o|P<(s=s9Yxx~i
zv~?AvG=aqsu5M6a0h2OyMty5+TBAEL7`8j`!(kx%?RlHo*}$k4WYla_Du~ZDA;;q%
zKE0?rHJ)wo<~o*rqtahPw1<Q!vg%FHNe%3!s5Nd?+2lg`aU+y365^t%T@)wesU~r*
zq}NBC1soJOLWmGB2w<U^8AAd~ioh(;)kd@<SP3lZPcCu4)x9kWj4r$sB5uWqJR{Q;
zqEnLSxt_dkw!GHi%ab?t<Aw*{kB$$2Z0<I8y%#^j!v>X&IBvdred4`7+}mv&w>;o3
z;n#zc<K~Oglf&Z{cC%7%!OJW3tbXvb*ZAq^xY25PhsR!X|7foX{lNghn4UBnt%}z?
z*x5TpElI_LKD>j&6YPZC1fb=~VTFdyzUdvl^!6LaJFnr-`itgX^W<k5@@4bn0Ec^d
zc+BMRsD6CX+&SH=AA3iq$47^)hKK9hZMJsy>dpPeZq<WHz`$PP$Hu{l*Lsb?9`1S%
z-yAfKJ?_z7ulJ$>Q?0+)Yv6da+}-AJW9J0dWxnkI6k(Qo6|Z&F*lEHS?5Ocm16EZ(
z{<(s%fo@xk|2~Cw@Z8(2@7G_!B1>8D*s#HFV3&4Ij~n|qcYsOj^hN8Wd2)Kv@LnAr
z?h@QvjpHAiJB`*;Z||^0kUMQPDlo`Ny&|iEUI22?0-C=#Z8Zso&4ZK1@$u==N%Qca
z44eK2AOth5!`r(A?85_EGXU%G_-E*sw@$XB;=Os@fJes&UV>U3!O;Tf?VQ-nU`PPw
ziM3el=b-UwulcHRu+zW>huG1ZW~)(#-D|@9USY2|_?tS6d`fG_O@q1d*Ct`3!siO@
zuGf6&)pvhv;{2sOAVjMv_(R~^c`eXa#9U<!ArtCJ)w%_|Uw@_OGCJ6D52i1_<la3#
zarK>j?*#6vgx&No|F^df6qg+Dv>6k4_wf|(%oYqWVER+rsM6iNQTDbTe7m-`_3$y>
z+xyk@HC0VrQ69`NJ)tLfXK!w;^?>k=@br^zH2CK<)Z{DZDIzf)g+zyQZg6vbfBFi)
zg$4eXKdO4bt9%Qqgf(t3`0FFM3E+08LI#*@9bFPHgF!bEuf+4oWc*}({qpj%3Z(hG
zdLG6Rg1}#!R{d`ExAFS_8Lq*T_5G9eU^uCsPlf}0FBtma;E6}iy#L#ycav_IeIN69
zkg<tkl|ih>l&yEZ4oBU=6z<Cvi_1P=F~2`cCcQAKo^RjLZo&r#-d1f>|GB^K)gC@F
zf7an({M4>{8y{Xg+}M2d@?pLH-J?gf?;78M45FKz?n8r@^7)qe?hO=?sLFRTp<r)f
z96*BG+Cs~7V*4uZ;rox}eR*#$@Y65W^ovqcD3Ay@RYQmwvI`J+IkCS)Jfs}U@IS-J
z+k=C5PqCZfBz*q-;NX4@coM)9d8C{T49nL`m7c)&@U^Ej8PiVppp!cAtEA3I@rXGy
zW44inM(Akc9p-fkRCqYWQ{c$8r#OLU2M6@;{rg5RhnL_Ne9bF8+IsW=1fb2$t#2PZ
zdi>qi#>PVg?<)3zt=4Mqy#KNP*xrV72tw<9?6s_tg<E_taJyJGfWXcR#II`-N(jr8
z=E&VD_gS+^x+9$}gWoV*Fqs};lTC*PZWaTb12{G6+oG`ioOdkl`%a!CJ9k{coD=Vr
zg2~yy+INrOT-3fb5;<+nZ_h>V^d7y#4-U4i1%8ib?uk9LwY5)S9PhpB84J5Z+gai-
zuwV4e?47f7tKQakTMr*T{0@%b)?@t7w-0dBooXHT4YYoH2Y>zc6ptLHeFwT2_)b*}
zKrTvQ;cBnKZ9smQrN&W0dYH&lhJYL2_}lh#YrO_MAI-|&KgZW^V*Q)nKHB_l3t{m1
z@#F6v)E+;4oL>K$7tUGnH5Mx>9o43WC+*oY@6i?wwcmO{wKtx6ev(W{Ck3Ogp=-Z7
z7IIKvCVcGVG7C_mb+0*?_S=n$xA{MC!PnlcQT=($whpi6Ah1T)HZ%mJ#S>*$;}(;6
z&YK@3JffJ6`ez%px0~;t|7(LPbEpgBqoq&<N`lH%hM=`9JO`ItB4@(h^>F*^3YPdm
zTGCG+xiS@DW9cLqajk$}#ooVl^lpNy#YZECf-R9@*Z`7e@MCYd%n~(wK+#<#XKMI|
z55D~_WzpdbIe^nhkJtA1pQZxZ@bf_<@ZHn>@*ni|e(l}ez5SFTR$)6e*xx4{|FFGX
zE5jFtb_w>ZT>5Yq5v=?!&%1?53C*T<bCW6U@2|loUTa2bL^?Hk(2dlPssWD(!_^iT
z%z8V_1k!xquIP$XZ9jPb1C#lH6l3!{tfsW_;bH2d?aZnzoa5SKZu_{l`v`fJ#%}$Q
z@Hv^bThbPqJ#I7_8ykivdYYcY1D(!Zyj?#$UE=(2rO$uSvEOozy$n^-t;?k}l_=xn
zYUM>I1Jj5Df8fkTvcH<1u|+L+BKf1&ke-)n)s1zy&K?6#yZP|J;|CkxeFr}+KC|+I
zGuyn0nQbmQv(geX%ip|$scj<rwo!ekXZYaZ#@55{zI(L!7#M;F-#t<@{5tFdl~mf;
zHgvOJZyr$5ClEwNOWYGkBi}y2Ti`=&bBp+m3ZOrJeI(!U>tp$jUy)_{s4_e}e_(M}
zDLrW_3&a?%&Pl(tf&q+PG@XFlMxt&87Qc*EY|aYlvll+Y*HRJ3s>g3OHwJ^Lw^GUW
zrD+s#1K&J+{`^5%zh?&e=*;k!QSlrZ-L5f5kh{O_yK|JjmYSm}W%lvT*TJY4_CJr2
zC~N<TdecFWtl!`mNLU{~epq1tp-;yC1OIprZ*UHUpZ{?CPvQQb2ZKR0A;tTr+5u<V
z|27`g9&V=g|1k({xAwm;@j*2W88hlfO)vOB5nbNens*$Wu^A3kgy(GHCv0Hf$V5sp
z-(*#zHR;nbuyxVER{OT%wfw<_Pkucuf7A~L;dmT*&-~FOjDz1%JUK(noY%w5&Czfh
zyUDe*@d!6zYg@emTbnVo@w~ju+?KVpDT5aG=3Ud!Rxp)onAvz1H)3Vuu5QH0ChI#0
zLV9r`rZ$`vtr;e4el0e@iSbRtI?o2TjO|Tzly8D_Om9*M{nL$a%JN1h=DNnWwB-#u
zyO!}S*YZYFOBvr5wY{YcZ`jwhY;UgNjmXq>Y;P&U8}@Sz+gq;Tjex$a?JeK%Cd*sG
z_Eu<k<IP*p_BPk>hP}<Qy^(TC87+<*fHC`ryQh1NHlTFlxVcZ8+J>vnGR0J@>%;^x
z<5OUcaef+v9rw2`7W+##Lk%KXa`Y9eYHOPUm~^AE16^Dq(z8#q*qMCrR=blAsv@>s
z4clH8U{@RWwghcc;@8U%BP_m2z5>aj;*~gyXjw|qQa@(6_DhNr;%DLn+SuDWJOPLu
zSLwe}YnT=yu7YjqLHP~l&ffa5C2oGJRDg}dRdiaMxhia`W?S&QTeg!sQ~GI6Uxf*t
zYa7|z&Q$Ms;G<(Sif15_f8#wwdCu|`L{N36eQ06>sZNmwn-3q^se(rWZ>-+{k18v5
zDhu&VZ>7THSdFdD2#(ENK!9Fq6n2=W=eVmC>ZD>L3fA_pd(DH)B<$shllDM5NTEf}
zn7ltUq_=YT!-~cPa@y)oN0KK7FZ~W)Yrs=sN~DoTu`hgY${F&S6RpX$3UuJ<jTK)>
zWn`s1rU}O6ZX^M-DsXMj`f#)t`F}pPp$KnJ3qw!|b}L41TB+13c1J*VfEu@JP9h|S
zNSRD^>E8>6Wn|H=yYBc^nS~y%@bFevFm?fx=&V#W@c+trQ`7y-oMO(y!yo=!AJ^MY
z@n^RD?{^0`-~~L#|M$^W?NM6(-+a7zEB}9q4~EC@?77mvS0Cv=@LC1I0|h>kT>)H}
zU*T%hJ&&VNG)>q?XVvrV-^PBDpykl>r$E&~N@pp#`bD$`n;W(7y!z1p9R`FO2Kf0=
zw@OaFAcgsT)E=P9zj~`AxK$F|DhY0t1h-0pTP4A#C<(@sb7Y@g`F}bBV$x&ze;qJZ
zBHqphQO6%pK>_8eXz}x>SZ83B+dS3Ik!0d*PvqS;Ua4)4v22H`q>_@@;V!QpH-0?)
zq2UqQm^+!0bzMa7f&O;8m{f?f0nk(|Nef&2CFOgH?#zRLE#2F)(QaTdA3=T8+ZjZO
z)JJ47H@~}dyyKEWGs)cPbPuz7l2WGB#VdmznED(O@(iw2!sQ-xkDZBF|1rJmSTZxa
z>0FjbQn0M)Tv?3B>D^CsIkvyn=BIU4=C}w>NJnzK@-!;eD=XY=B}Wm~3MQr@fK|GO
zt?>r~rLI`|MRcTH?xl#_0X|iAvm**eG2q3L#2b+demTR^B|6;)C-x5eR|YwNr9pg>
zwo<wT*c$s>Q3xP%LGq5$Y`#YE5th`(rR`7;y^<zn`m`wpConM=bCsOB(G09fpW_)s
zGj)LKrzfvp?H#^=dpdiHK%NQDkO{R9j!Fh0CzW`=;KM|pr#cMEC;BgWs1~BApGLW|
zR4a1^>J~CFamKFcoLWS>l8aEBNTlN3Eu!R~bbu6#fckG>McVkUq-EC`uarukGtR^C
zx@fV3SM}D<2RjNa^h!9O{ZB*#k|V<3gSM&xl_j@oblljsgzCHG^;Ix=F^IbFgC1|+
z5u8%k%Uw9AmRSPR>Q6+qPGXeX2@i8Li7}~$H5Tlxb}q}+faaqQK-XXp4p-4dt{7v?
ze@WHp_|#@pvdf=_=IFv70G+`}u+SK5orrrLK9RzsN*ALxKM4<|lRq01mjuHxXAL78
zS`VggfFc-3>EkK&P9k3cHaXxBNL90U7qS|J$1_ZG3*B7i9HcoJSrX%;b;0pUUci=~
z#aPHTrAeclIOqO&3?e^Ptu>QhHQP#J$-Z(F^>EvCJqZ3~b%MXaS;T)b6LgNXx7z7K
zLwe!u#=A^on^5R>wQM`KHPYie?(THd!BK@x?{q8JpNk-zWGv_Q=Itb5GReQaN2Kgr
z^zNo!KF8IKM2s@Fe1+Me^AP_H%>Aq$hm$M89k%VVq}fKK?=7@lcAqaSz|w@>i>Q(z
z2$k$fs5rNw?8}`zjLKS0B}W^!TP^Ec*9xKFl}^|GiJ}a$d_02|v#B^o#}uU15LVFY
zN(!<`s2PTwGg9GUDJRfIkxW^~g3|;?K+OduMf+Y@gZl)ya?DnRW(QRI;`qk(ceV-b
z)*O31bFAMT{E5a`G@{}5Oe|Aup{QM1`E(QPauY+1k2A9(70{QS8s2y!shjD|mZ>T$
zqi7A^`|>j-`&VkBg%`*T&hvkx%43$Mb0&fOv#qKBexE}7{~4O8y4ASz>0`{x|5baO
z@&B*g=KuOKpRYYm4*SHLPWo%#-uc?o8;@ZCJJATP{t2fEm_*|>BnWox2VpU~$WIIE
zcw{>9oKLJ0qNHrIz>W<4_<avcV57a*pH%O_yD}_|$^x2XIaZDDU|gK~qa<lFk?l;X
zXUVivTK{GBm-WA|!<ChN^grJBzpQ%S7d-q0UtRs)d0y?FN8_&~t$6a50$`te7_)_m
zA<Ylo3bn_8b?!464}cM&;4XSH3NF>dx9{keuf3Py2QP_+fnH9<3qEv%F-AtSIiDmV
zgm@32z#7*Fl31i_2CO3E_pd(&Cg~wuVQ4xSREgJYqXGH*(mi}~&yAq|8b~x6kb&Xb
zZ~t`ld#Q}D{?(@2^y{yjmI@vx(|#Z39VV%MqA?|;9aO!>1&F5H-7365Mt1ZPfp3Fe
z*N-XIoAuJYs?!TzW&_!d()Z84`n3$*l-}0Yet&nr^!*dqoL@@6l*`|j*DKyVXOh3v
ze$A{5i$9=d<e$@s;yhWJw%*drw73{tjj@(ZfKC@^NFSZeot^0`JIVF(zyA2}hqv<U
z*Z=zP@z<4)3(c-;&53G@OP1^MG823ID^8~T)?fR*{q8=_hT!$f#-cD9`rSB^I_I%?
zIiQ#f!V)s`&?JbHZWJploH>zSR$(gjwSV{sptgM5So;p9HU~s|;pn}0dc21o8$maa
ztb>I9s8*9B<&_ZCRT5^dWl%1j*8lwBl}nffD1p6N|7G2p5d2yFW$oR4^V2Wu?*MjA
zXV&N5FSWP7Y`!b~vRTeKR^x$BL=R(z*Ls-Olup8Q6w=Wi;ZKFrL<)?X=KX*F&;M(m
z*<hq|EhzwLiIDe+<+m{QNQX@xG&Ha{1daVOlO4_;@mBzlKySZ?=S6ge^}oAcep@QP
zTm5w%1UA?zXTE<&vh?BY-+=^v@2$MWJp@>M{q?{8Ui(;H@t$}ebaS(_nhrjD<_)r%
zQ1!U_TNI9jeBzq#&|-rQZ1Q{0N3WSlMCTP_oK+pGZ#PKI>~}Gb77D~#v`s2rXF8!`
zk<e2om|S9h3g9$-xR`n#)+87~W31AdNiIDw<Dz~8u7WP6)(M~^4f=6JapGKH2!|a3
zLSlX-I4vZV!>fF3_)qdks?t@ayKmE?O7!1~ko>X|Na)vU=L!xfruupI92T3F5~$4`
z8%tna6TETwZN8G$E59VG>nbBopW9R=0S?x>%<cB6(=V;9J&sJ@gbJmV(h3H+OS)ld
z<<aGc^k2Or+f8ZApUd#cdDxd~b{*Ki_ratsn`6>Oa7(`G@Vj%{W!{3<9AuRN@56K|
zczfR$2*VeenK@zUVx0Dya?PhtqG^H?(?6#tCC{srADMx*=KN9?X2CfU-1$>=3|@tJ
zy;4do%kPiV(<nzd+6|126l6uG&T$k|QRk~+CmLW;Sm>)4OaeG8y^5*_%NL;vizm-G
zn`vW=#h?0DB@h`ZA<uURyR;5hwWb>Dm|U%Uj&0tC?}P(l+t2Xr#yk6O{HKZ(Xazc0
zsjS#kNWeiThFlf(#*P2Af=pT!ZAIhzD^Fodou-2E3w2v?0#~q&5@h+N^yzvbbzv|u
z-h&PWu6m_6igZk3RMK(1U92<)qO26y`<i}LNho@lW2Yj!)eFV}s^Wxx?JFkPE!|L+
zHQ+w2JcBzC8uXt3vhwx6a1tMXS=oNJj=ygIGSaZ2wqJk!wfC#E`ZfKKruHuaz(@5&
z@!){}`~x$?ur_l}FuO~*W=My5hxhEh{9qjoB&cw3`MLM}|9I=jf3G`q#&n|@e)-8-
zz5H^2g%=~o<R~Upqwa!yo`_w5lNMq+59C7o$nI2-H&p{LiYEbWXuF5XYru0abZ{7U
zzpa{_1KWYhXuFvOGG}YlJJ?No61Br#3BQ(ew<`zCfHq|K>CsAzw15t%_s~V*Jc`5L
zkx?6Xy%2p|<D4x~-|j2mn{D_Cw&8!?{<7}913~FuwaVs4@B6iXJ=~~#T%WylAakv|
z*l@pgQ(I}JYC%YX1QK$26SV5#flM+Cj=hIzVB55HMH;Qag<unXCQ3+KsyJ0l_AhMG
z+yC(ujRW><?Os_)k8Ah;SiAps{PCV<S&nIx#PJ{|f)U1;K#|Ax1cOwy3I!>W{b-Fu
z7ofW^Y3Cp&m)4&0qUT|zyKP$J{pIWX-fF43S~i=gX7$|ryX@p3QE%U`$@?TvFZ8mY
zfxum!GwkjmvwP2CcGJ*{r@D+HonXmb$aWL}sqd-sHm-_608#Z?Q-YrYIGIlPZB4_!
zmYWeERRtRE8|8$|wW0_zZ(bDNVHysdMsgsTcI5Apz54teShuSdz^9aMwoaud^5DNN
zFq7f&K5FBHticIziX7k3Q{kWg58d9_znK6&LF3$4&tYTk;n4OkUuS+<zvsM81Fh9;
z@<3CROUT<d8Y813;$ts&+E;)TZ1O@nh&5~VZArvj>z_EqyREzuDhhLeCBKB%s}WGm
z5`F81<d;!uw_i5*8tpbPtoOZ@^=frpbqH()kP9DC@WnJ7^vwNEeAOM6d!XlkeZ(P%
zB_$P0n;-Nd?+>ES;UDVE6>N%uwAzD`5xmT4l3T~&VMxj{+^EQ6*b<GW`qn_0J2&FV
z;f~saue}!IX`;cEyOwr#F+~Wz#2u-L{>rNNR`?MX9}92Evbq}8s`UFWogI2t`dZO-
zwRLOspv(&eVC)hP`$T|Z<Tx!?`lJRC5&+9gmH|)kUR%7g`kCqK9H16G%j|CoS2O%!
zK48-PhsF>Wu>6p5t%`P@Y64P)$YdY>F#E|09p26lv~M4!Pwe2&)_mW7@H0F9lemx1
zod0QabK}9|O#Y|Mty}xgm-wI$mELLP+`Q(5fC6ttPdO}+y$W416g^3VheG{p@@3*Y
zB|Frk+w4%cfuFa5pSOXZw}GFxfuDcH>`-&#Lvw>kGFL9SI#*xp9q#<#c<_@u>R%(4
z1p8YZUWKILTRui)mKQBn^~C>?=N*qRI|yP)`29P^Kr9miL6ETFV}m0<0)hea1!5pd
znYah^GT~DLmnK$#CDSUiOMX`>vj-o7?i3Zmco*yKX4~7UQnKdkemYh{5FjU7A}3ga
zV<i?2mC%tACKb2JKIWE4DO2m2@e;~AG8qKHxMU|6qjML}a=ORkB8{mbr#{OLmI=R@
z5qn{Y2pwL&#B~yX7L7)tXw_-&gfBTj#)r02>AJB-vFuk4T2{;kn<0n|yQGc29GNIo
zK^hzqk%2)~2997POqF7ua7^kr4y2M0G40dtIokX&x~3OZyz}TXxBwn-gsy3bbNDQp
z4$zN2nczrT5b}KQ(!Ub7dfZrlV9!W%`WX<R;T18I=E}-so+R^*{t&Ig#ORZbIZ<Vc
z*fKPTqH$`uwX!LW9iheflK5jb^XAWiWE5HV1R2SZKMCyV*IV_YT=KAMtz$0n%$yQU
zFf0_@i-fuX^NX$%E0vWO?%sbhcEI<Q<#jF5B^@0ZK=Li@@l`bSl5^U+?jZ0-(=q-O
zOGT=6CAsoephH9iymV(ER<~6G@r;uKAV*&$4xmnN`(-#7IQ=;0Vhvg=qDc<GGdkqk
z-m?kcPTMG%zt9#TRbp8XqrxsHu`aVr=;PKksOrm7%qNOIPE^Q`!W;w`qeDVR;}U=5
zh%<D55$^*gW~i1Yk8^RsApmfP)m&cX^Mq1uEfz|ZLyprw%H#_|0eDI$k>*KMIqJJi
zlyNSuZ~F2vq$?OH6iOH=?Q<$fXt7CQv2$6>mzmbhhNz_(+)9>XtK{%16}99P5x7J{
z9a3udf|BeAhTJFNs4Hm^L?dP&VOEu)I*4x<{OZercdwMxec}|1UDfxZoH;Iy{2Td-
zL`bVH=?vmo0+FPu$|0qKDGdEp$sX|5E+EhrJPx3H<>3Y}0dnYDEHmu@-3X(AtIJ~a
zvJebl$RZ642^13%$9pXhOuwnBz$fktPjok$mLM_mEq`%opSu2e%QR4225p(p!))Xs
z2Odh>6qBZ?g+76KF@_Xkn9EsKh>iP<5r*>v4DG%O;tM|y>-|IH=a$U@J`t366v?_+
zr=&|lW85@`yEvdjGK#$3bUfh1BiIpDC@k@Mm<ep{)DOy}Iqio7xR3%1Dg7R~BP4hz
zeSHA~DVto;4M*HT2fb~=3#>>+XOZp7{^*KjsbmsQ0Sb7;)y(NRkQDAMroOB&OPL6x
zxSqWiPJ&^Q7Dax5^~{t+=FrkS(L~*<S&^IvYWe+Ohohej%9*RMJB^blHV&AQFM_y?
zK`^qSvT|{=jxLFWn>M-~9kx!64i6f;ZPfq$+}>*($iP4)^AAR5vU_+&%#EI2HQ*_0
zRaTiHN(IQlW15xY<hg>_1N`P-rD7G{VhH39lbzP-XkaEbXJ*~Ft-$NdBRx}UPLOOc
z%9UtMm5sS;hY{$ET(AFH!4ectmX7mIM`-K5OM0aRV9anYN#*X$7p&X~xQ&TDQ$bNW
zVLAIwGuk6p=aRt38iewQOAl5maq29SO}rTJ0Z=a&=!*efCRF(?Rp>AGa9QvL7{HLJ
zm((G(%VmBn1gGhZ-qX3vSkNp9rqbn=RUFWZz>m;k6mVfuY6?Y}ys|VXUr&@#OdObs
zu0?qv=+5C{Hq=0gUUVXq?m_ZDAaU=Y9zv`w`c}Im+=&W;KT#d@C}9?vxH$IS=c{rp
z9Ia8IOcpKS+QNVXJuvr2j8`0}S?JNl{G;63g!w^VPrTC3rank>6Je}6fy_<Pe`qO-
zZjmpUYRVSEYS+(aVR%!eAR;+a^B0!tg5oj={>0FajPm>m{HnQ1BkL-8UU>V<fcR1X
z<h_l16|(3lmem&tT6L(|{-Eol9r!Z1HyB9XG|eg{fWRt;2=0yF?M|ssd7%2sW8jw+
zhlsN@|JnF!^Ycsc@blT}6n9iX{n1~Xm%h!_v23mmLXtl*TSrwUphqfDTzz6TjHRYT
z$rMsE$`JXRNY8PbSm8hIQ|SL!Jqst{8C;CPCyz0w{v-UA$^WobdwA>r_a#27)g-#J
zTKy2+9`XOk&ustS^C<ds_uqNv|MAv?bp7AQ4<6svfBhmK;8I(}GJ3eziCqZhOFHp>
zck9G^>%@EO#Cz++d+Wq|>%{w4bmE;`;#HJ*tn}rQ2{{E{S@p%~>$Smto<;^!X-zyJ
zuDX6gGVM5}Vec&FcbWG%$kEL6TAHJN1e3uyejLOtFDuLaCgFPUWHu4K-q+s@22*(Q
z<eMJWo;AK%Fzd8x0!{{<@b(T+68r}!$E!vgF!KP;X=AtSeeYW6jN1n07Fux}Iqb0<
zyS>=)!nN(NSHXY$UN5FEm=A@$P6?X*!8AGVb^f|L^Aab>8`F0;29-&(0Q_?AwDo%T
zMZ0wZ)Yqwq3orHo6ur)9Iz)ZyT5T~C7pb*#3{FL+)|K5Ct>!-(l(NNr%~+dZ3T&^;
zH<dL<li)0f9Rrp6=)%XmP{B*M*tK!xn;t820V_&?qdjd1+I>-WFjajtSSo5_GpusO
zCN%tHN&;o3j5i$5Stj|*$cEF$JGtE~uzL#u2G|-Jv7$S>=HyjJ*{R<u#jmXtN7?K%
z=)@fh{IrvFf%gqgA{GdVwz)nMY0B5$v97a9?&X%30{A*35#if?QAv~NRNTa^;(E!?
zZ2iw=6c2izIsW?*{wEXv{owJf{^v`4RQxyXv>pHL^@B^L2}+bpACpr%Ym4Y8P+K6b
zf0_uR3o8;$^kij|cm$n=3D>5<JUV{zUdM``Sl+h1C}98D9_Amt!mLhbNd5a$%*?}C
zZK===O;Qa=z8Tn+o;3>Iy+9a2+a-^@Yn5m1ZLs>Sp6gc6b*tyP)pOnIx&CT;t}m*>
zVyDR#qI(17Eq@q^*B!g#ClhnItMD-G1y7_1<h0*}s_T@8rW#}t3@8i*<ZTaYF{OO)
zCG%-WE|QYs97!h8F?PIEAq7*+(LA|~aQG;m_*k$Dm=V;sB~LJosz`_ZVA4G=o&`si
zGRbw=gFvV_OEeTmhsm!<`5;OTpYGx@(EOD5C5LJMWlDXfrLX*m`cz~<OJKCyAtlv3
zA<H1o(P`^-^`L$NqA8Xe*4UAF$M{GhU4i>z+<+_68w3}@z^NTU(S|B$6On8M6Zfr<
zx~2lx)qDFzcofqO3Xi0^@d%hgQtfmo7Gn$oBc<S0Qz7lZC>pH=AK)&<N8B^bEkcf9
za<1;BpQ9<dd-g-Zh%hk$ljwl!#nJTaoUx(r1LFI<E)JC8HB$*)E5KeO$`Q=#0H%I%
zL&$RH+7XdyB>5q@@>T&RDK*?7>;gO@gi#@nMq;<H;<!=Y{los@%`w~>c`o34umK2%
z5{%|(H};yXllDoyxmS@mMz>rkW{9WY6T7n?{lPR4-*f0M2l=T4I4&XoasJuhv6ego
zJ9v?&(O(A>dFQ}W0x4k>_Q$|k`Q7u13gqU%UFP3(#w`gr2M!KoHFE3KEFo?c1tFSa
zap_-GNv5K{WB^g3ff&V})p)*?TdxUlHbkC-zThBAc)WiBk_jc<1w1!n!I@1c{#kd*
ziLbe9tPSmd2#3=la)ZocYHw`J$FEj4CWqm4L>OH?VHc1!dwNg_^jAAOSp~V^%`DA0
zVaG~kB}rEF$#U`DsK~Q;KT|!vn2LJ-DY)Jd*wmsu{6D2XXJVOZ#)TR9UO>@YLS`9g
ztjZ-a$_6GrMLm$0xjShWb$;Un2Y|E$TD5^e4&lWHoBtuWvq0?7@))xK79b6;wodn}
zd%ytOEa4==+~iVi0#i3jU=BxYab+o+2BMr@!RSujd2EUVRLGC)wWx9!+cecoxbA_@
zWJtF&l}QjbuG<Zg#KjN1lv>jv+$5h3L6)id`l$%AcZ@bw#E`+jpokUVxMBaXR&#G!
z5D|2kr}gt9!F4vesE9iLi-PRtM%T@VtXnvQ(T<~&rQDxAYZFHI@kR+KkG|~bIobo^
z8S`k9uBn$y=wHgbfXKcdT>#U3kN&=AI9we@HbGS)p#44R;hu`cIcHu1`?x2)-m7}e
zKAb5E4Dv@ji0Kpg0L=gZc29t3$HB2|0%lf6#j9>>0<Ln77T)JKD<IiN>%k}Rya1)o
z!S?121wdb5sLg9}*yz+5cS)XsVTe6ccGh4x21%PrCM1)@3BGa+kT8prt1+dnMqW9c
zJLHGP&nG`0F`MpWe7{B?js2sOpUZaM``no@z&>pzbNb+!ut7CHq)ZDCvZnmtWZg=}
zTQ>A8Wvx9t-fz8v9X>pGh0}Bsu2_-!cwV38Z)bjXn5}n}yYyCWZWwz*m=-+qHp)f8
zc3%cEbMwzourg0~ZOz**3=UKT1xS_^Ii9^+NI;FovZ{O$)mjAto;rC>;mBpKladb$
zE&DPovVFgXL!OH2PG3e=2)uo7*;nptIoa8*`TIG4FK<ke*u%nyCMBGG9g=N^Wd_m&
z`qN1?1aYzJ4TE761GV!<{#h^--JPx4^V!c!G9o6EX}@1|L)D?zzuGO;#!2ndB5&`p
z+k0%Od+dL~-E*xK{U_fUH*yu+fI<jF(A_HK`cYX6$zG@xK0ujOVILOHNruphNR+ff
zsxxbBOsYPi%7W<RIZR3P$MB4V!_P*~7Zm7co|^fGrZ(fy*k{HZnHxDPiWr|nR(45L
ztk70T=Fn7r%v1)bvUo%UQZI8A)j4c=Tj6oodWV?6Kl4bY5VC!XD_l{1QIZrTeA-%`
z+_ZT)$*CBqPqXBpyueA|WV(wS2Biu0Rf03inuLiq8PVAfr|P|sj3ct3m9JLBQHPc2
z;x>~}`jiQhY}-T|Y4c#`80%)4-r0S~s}Crr8XP(04%OIseTefj4au%B@}{HU!<fyc
zAlP#~;ZpZJ!1O4qs#sm(CN^~y`Q_A!gb`{ts$RQEBWXUDr8W?gL6Y&$Kxx(QPl9;W
zfjP&55MU~tcE(0mt)bQ%?w$L(#`UNhNLom3Otf06ev%2?6hk#1m3&1#-9OzsX{tYH
zLj5Rm{_gm(`kQvXYqx0p)Yy^l`A3MBE>r{FUa72f;eXJBO)^fk#@0e#$|s|t=OhcH
zDwb*r3fpy#Buw^0u5H7BEnGQMGm1}KBhKn8Gp)rM16)?}nD6}Kuha0%Jo@z!lQrwa
zlNX|M;#Hbz&Q2|4RlE76VgF+gci_b#pb_*o4B(tzB3wptLpu3=RlcZk9F6@mLRy@{
zz(*b4x>rAZY1?PQ2^I&Y;Z1UFphdCcuBkfrk&q<zWsW9Fz9rbjM2s`~2A}xvQEn5>
zKHE3DvC<xjIY3kN64`W!^*@LCvS|P=daU*cC*uN{m@>|?R*_9mNS929wt+$QNIfKy
zm`PT2nt;goMDZ()qrFY<8BT8vn4;|r?Ybe`(e*irxipJUUocBJ&O1M!*Y=-gbCf_c
zPa;~DkC`jQIBYTO@}k}ZhIvEOGRZHoh(|=Re-1Kh2s2Y5BOzNcPr@jWDHahZ%pBol
zxN^o!786FT+=W+iB{KNk7=iEuKiGK%5ghlQyCdeTY!qDP7;sW~BOUUJ6PhCo6-z=q
zT%kRuz*3`wpJtQYY~_;KOrK+jWV)DmyZd!*gygF3J}ElTMb{5UoLrV06Vr$3<<8Cq
zl6zN`PN0~n?zxZU+u@SoI@iE$6Sq7akMZL1*_&5v>3kbu$pSyd`qw5m?<|U8hhfo8
zrB+nxi=S}<lwBeLF8nwQCRb(EHIvqp!&k5N8r7Y8t3eC3DeDO>Z3kxhS0k^VnJkV-
zyG1oe-2rR@X(UC}wt!-yo9n?VTZ=U31y&d>V)yvm<_vpv&u6X9rl3Z>QBf9V{NQ=W
zCaGmyfn!Hx<1W5br0c{_+EfkgbJM`$#KVM+S}A$^+q-hQ0ZkMhU}czy&L+2WBT92a
zEuB}bAyTj2ald`c@(7Fizhz4e9sZEVK3|(AGAY<UJZ@AQKOHrXnG_5`kO`%lg(4cw
zzIJg#`N$t&4#q1|J|s!h4T+OIIoYcKDVhWn{5e5ZaK-Lyg<XoR-n~Plf0yt#W);^?
zq?9T&h%qQ6?KQL?#X;l4IE-)DxA%rvxa+zf4HL|g3a7{K^)Nappd~I<`2vef(A#;8
z!>1^qcrKL2HBTP<Y&01g%GjBt>5Kv?dMu4ot3NnwGjiLcK$-%pL?FxOY+Cj>6@Dc*
z?dURx*FJgwXr1npTM!*A3OG-?7?Xx42*0q<NrU9bQPd<c0$L}STn50pSREl7tU5D7
zBMGGA=_GsDNNs{Ujjp64-gM?;bSh*@gFND@NFq&BD~toa^y41K2w*=vKP3!eQePA{
z@kyYnHIe2LyOOFvaK5_dRr|pI0~URZvCKDm-h0uM(h%be+qATb`~k~*nmNkL*a?eH
z>n;sx&Z;%`96j>9-nMjaF!{pM|49a$7<V9Lu=!Fn;5yRkKU$5G<?HG!!y?%j1Ss0}
zja-&~)F~*>@Q);zybR-H(j2w0EulHl8XGV5&QexcTRHw!x-;saG3p(oAQJQlLN*la
ziOrM`v%;b7euqPNlz$&_Z`9$k{t@`Gpa-P5cwT1s158eD$bMFs)Gb>R7S!{!G}vg*
zzXd$v=7NAfih~OW@YjQUiuYZ_DzrI^M;1Cr3ImNy%f8TA!XLEplew{n;ix?bK44@8
z{|kQuM@WCezZnfJTW`ql6j1^k)TAdEh2F!Ea|s}E1DEk$enOG)6oBq%WKj*vo9As*
zxlO}%6dn6OU65l~d4_?<+fSasthQGwBu*)v!AgBJ@}E51T&Y^j0Zo@I8nIio!J0Tb
zAM5B806^G{&SHOjj{4vMMSUrj#3`uAw~1FWe&h)TOXEs?3f}q$f%wJG0PHgJ89iL9
zMC~AiRlf@2*g~M5awG~q+&uSi6VgJ4$9VJ?Q;Ga_uio^mtb0^#H<3rhY6+8cGo|-t
zaYUhFX&qnvIpl4zicJ4T7mpEvif*5Uuc<{?0Q@MRD^>VnY(ehCbE@a4-WLmHT;LLU
zjd=xF=8L;P5eMX1M_=qnEixZk`f6=OM3M{ZVde9=pPYMcCswc)QC2d|k-A%kqZk7-
zwo3Fuk+^A144EsnGRBo5X*w#VsD=lVt)1g5SE?-Ov1o{-%!+SR{9tbz?Cp>jCH5MV
zxBT^q_ksfA7p2`;FK|&+_AIsZ>w4?8t;Jqig?;lk0BqB%fKBTWAQht)VR@c0RUrg4
z)rK*9GOytTL3bGg7B0Mf0OVNTBzL(ByX+N0kAE%l$;a+n^ScKrKHK}E#xi~rcO_eq
zYc@Ok^5m$#i>58|OXLV5%T|_(0~RN!aMZ_&*omj!SMEj?B2JV$0F^!B{Q$2AF=?)l
zpd{141Wk{|L!EUXxk`YgL>748kGtoTsYwwWH4wRNokda4w&F=ZH^a$EjK!`K*uly;
ziU!EWMqSMNv{I2mO{9~O)o|%>)hJMhA0~7~^{t3#ky&jV=+sW*I6|ii_VlWc@gDXr
zgN{mf=n%|NHyBS+<u#vpx>&7@$5q*NkhnD?8XN1Fsk&)W>x$}<$IKwZw*PY)D2EQ^
zsg1t&sJFYqHDZML9r1ut*>T-Unv*PjuX-)1oeQ%gGbRO<6R@!}eT%4Ac1bFgEhCEr
zmKVecBf^Qg?Kqd@Kc`{LUEr*F7=}zI=%cWsy-TXz8?J%P_^NHOa{2M(D2O@Z8F>Wg
zz-4L6D)wEWL=?ZrXxH~B$Z-o2Wu{z1+*}S+gf%@yU6fl7F7Q=gykn}b@_6=4EFhvW
z+K<D*m4b+8ZY$$R<aaT3MOx<RPmcWFU+&h#evDVd*zchg@7i~%es4kB2#+_{&z+m4
zW2~;BG962yTMn>x>y<fCy%nIk1POcsCmJJ5*=9P4bFHRFlNh*D?ThT)b%I*$9)O6>
z>tG8zpb1$1f@1Cyud&b={08ujQ(qqcRyJRgbBN)#>U1(mf<fOglu0D;_H$M0vn+eG
z5ZEoDK_Fo*;7EY4$RE1;j?M;w<(;8?C&UNXz37~I5_Gt#;*tpAScVBZ#<M17yKJgb
z>EwDmjXn4JVigYlJ~@x0%Qc@|NHkH^(`SHsYtIGO1VsorI@5j%I}9bl$@9DS9poZA
zyg9>`MP80G8|9&EHk1Pf@{2$by5p-7Jh;y-F%sKEW6v;x(>A}D_TdhpX+amcQ~Qsr
z0XQdHG365d4C#t7C@^9UL1kVX!<iZe0FZ?0QWDjJ1u8~D0aS33a0nM;VGph=<Iv&I
z!nuU(w|6$<Ovo>}vH2C6l1kxNKYsP&+i!Y^qTeK#aNGN>;w7`yOofF3nS!KC1LkBP
ztE?auMF#HEiv%t_J50P)9Z`m>^b`wnUsYBxLnJ0`9bK(O(GZac{_l%T7Fnjesb&%l
z{S_v<Sv1qlzsgkclvb1JunM#?J=uaJD>kBj;dxTfZ|*d+2`ln|y7|Q?TSdONc*dCk
zX4CS|n?43hRY|Xzo_Kzc-k(CbFfgE&nO`PkNwDAxPb_opv+)ReVqfeCu~TvtW#IJm
z3Y>bs{2Yhqip0)T={XiS_kH;}{to1l4LqqC=6fUkIpi|<kUPa(i|3y*!*etQq^Flv
z=>M5lW6+;~ERh9aR)K<roj-M6g(6Cf1Lf6!*!SND{c!N<)qm&K|J;1^;8D8%!^Xyg
z+xib*;&bO~mD@J(4qJDo=&jLic~72ue=jA7s$O#Lt#!S7^u$|Byv^<PUU0EKn!>X`
z{_ukCIRz2lE8l^>0A<I3G+uw;pCu%34Z_j%gSYNQ$%i{(KlrCt`g=)6DOdLJVfoJg
z)p~vS;=kHEFZb%NTHg21y|p*+|EM=z>yM%}DHpMJ2LFH7>%b%?z31KUzVp@&H`Tj)
zyXNHt<hG!92Oa5Wb=|vyX@uSDjRDxu!%7+O50#?pdD2~b5Jm5&<2%8q7xwSmskTmE
zzHI)~Xg%?&U9Xx%UiAa~FS>IF=J3R`s;s~x`iru3t3Rk1z5c5^n4<7+no^Ae^;a+K
zPV^sCxmW$+cL!MJ`A)S9gFm_RfBn6*vs3ognpN0jhD;g0*^q*#{iEg%?)=}Md25mP
z_y7CO9c!}Cjh9YI?leduXK^1Q9CdHE%za^}YCwT1&S0<k0!JQnr7Hr(jG+WnPdvNz
zbp~QE&lpMV!xPVGzsy+U$vNJH)~ISbXN+rh{E3%(=UM<Igqa0V!Kf#m)BZYR5jxHo
zO3?L*XScr2K!oZu29l%j#IsvpXCORAGsfXl_QbQ=E;&kf5cnfFpYhOJi~AmyW%sB+
z`{$$oh4;VNmCs!NySBNx^*B@i`{C{V|3yBk{uAyr)qQe;RF!=kpJJJY_(~G=rz<vD
zna+LhA{zJ;<O1FYS8MD6M6RZ&?VdzqG3Arx*7OT<89R7NvH@Eoo_z5-P2b+uX}Yb`
zbX%wCwocP+ou=D5P5*xN$T9O29A--swTt)r>JPzHGWNR|-m4t(b^*}UR^!BbMtN?Y
z(S5xwr@bYvjwXNteMZIDY<@KUk7!)&4ts6r@FtTsEEv#?uh|W7(dhrEmR(RE0YLF4
z(9UD;gJ7KFI_6o7Oi%e2qGP4)Q0x(r$K**AQ>wk+F14>%#wja5yB1!y;%0)T<<x|i
zivIPo;lH%!uhgDv4n;@%YOn3g-cy+u%)K-iNP@ml$LCXe5~<tCIuQpYUfnE8ERk?A
zX8_J-lg5=-dAO4DxTQB$rq0FOv<{}6WK0?P(<vSn^fmHKCY+C%-Ta~PGe?I#qYy$q
z%fK7(7oBp`+Gt<1MHKpM%3x)}sod~x*=dRIhQF$qGX`xd?3|^F5pa+e@)`kis17!$
z`TkismB~{pPE_)_DR(<9@EBY=QRnRJwx8tPmzTj76D0@1dsRdwM!6-AvLKQ-(S2wY
zTjiX9ro7z3oi6EV>O<kJY(HN?$s_Idc5L#3a>XY>DZ&Ch751nBoOx<HBf{U>LCnCM
z$cqYR!XbV@!aRwQc&ZeiBKmMa7iha^y3b`IpGw&<34|2J0_~I#jFr2*0HzdW?Fw&g
zGa`*%&-QaqP$QM-H;r023@X&&4DmoK&z`U7t6-)v2tPB@2p9XfA&uwdIB9-(>cv4$
zMFC9eO$$?YP{}nN=WdmYg3*|k{h#V(_bCZY7je@=<;!RA(p%I7%KG16VwpgNbIdo(
zehL2yn$uZkPOorIt{MA_%?1u*+SqR2pEo%#Je*uX6Wx2y22lri9iyVFD$ignh>2m?
z*a}$&;suCjG?ZT57`d7L@R*l`ubO?f|7`W>|N75t{lBs{eVPeizW)EAtN-8J*sN{b
z>i@sQN9q5`OzX*hlOezx!{xL-CiYi;#<(`I4%}+vZ?*Ba+W1>-{H-?rRvUk-ji0TJ
zSM%9#Q9^<C5yGOD{rM1n-ZXkWfNTqPvx?0T!9~zKf^Pl6K*WWc4YmDLiPKSx0WI8N
z#$g`=iqAOp6{)jrNK{JGQ4*e^3mvM5R?91|0}y7mZb;Xyph$JK1cVqO@t1_3s%}3W
zj^M6O?3l^bu$PWRdlgIszz5hGS4B{`tKPTN*7WvrYHLgXD8q27mJ!Mdz2cONc?!4G
zj3^LKl>|1iczWIGcsv9&x`*Uzvs^edNBxM#ge9xcJpRvJ>>?eiH)rCT^O|NfXfmw3
z*Sn2&bJtQW7Ix?4*1-7|rsJSm#Odva!52}N?I<f0Zp4sJr%RsTq)??qq&CMvHvrBh
z&OaVbtR$TIAZ~}fiZ_Kl`?k%AU{oXLpnI!h{|X}`x$V{_XYkGo``?QskuCF)E0q<R
zBj=9!rdNhl?lhV|!Yx6()i>4E<cW6=|G8(WO=u<s+fp$z#{khXg_X<vatw<L(YC`p
z+IDyzezj70Fsl@eC$(ritf%9xpct04W8Q<Fp>DJH5C*TBO^p7Un|Sy|H}O_ed|gek
z$p3$$vREmi#?1U!2r+{l`ZGcY)kIOqwPsnwaopq-0l9a>1TSa7J9TSgJVcLESYl3{
zUI@g5<nF4}GXqgJpu9kM`zkL6RppF2#7sa`q(mC3>hA0l0H**(pvv)LnWNNj$sn3k
zRd;$Md`#q9(X4YHLn-3SfVzkdrm7H$SoMabMSQ9*e}K6=(MWw2O}$<uDU8%9RaHr}
z_>UPxDcO_i31927)|(PCi9;)lPdQE}(ZnCH7e_Qy$&cQPa$EHQI~k6r12+MNdtWFH
z<s}BjWNeVaq_)v19Mi_*GZaNpinDF3LTpg+E>Pnjn_k!_Z<UD#D$>a!=MwJ4y}$JJ
zfKzkWbDIOmO<lNncX%V(chNjn<<C}*{s(+!>;Flt{mlOVTY3Kf4{Nvn|6k;zIifJ_
z#Xkxz6*1%-9#nymb1+I>z!j3P@obwE&eRBq?X(Mr+UgQ{CkhTQ`RABM!-GLMdQbn5
zVi<dR^uX(2ayEGH42WFCss75zr=wvoIp;(#oU{&z_`qX3Mlgz|XXjKQo_v)iCf75D
zG*PV>yjuo(Dp)29nMc5e5vF64>Wr!|Dn~tVg0>3%$^bGTLEk>QMtYq7P8C8VOLoUk
zC^y;UJnB(eQzY8QyDwC-nhMPALfz0<iZKrGMN}YtNjuA<TRY3Go#ocfa%*R~wX@vX
zSr)Lfd@&P>+uLYT5afXArM*>7Is;!h%Het8$7^DC;1N1GxlBvZJ9dU*PLZBsUDA9D
zI{wF2*$kvX;Rx=?i7Mf~HXis=>pPs>OB72)rK~tL?<fLkd%TWmzpU)&m=l(!z}-=r
zSSc6JNo|=0(u@pw24^xVJ1k7%+`0aH=B=nmDHiP-1Rpp9Im5}*U`Fk;^2Q!b9zAGJ
z*cnWGeDhkbj(`CJ3GZpPw?irvE&b)cd>;5c$AOsAKf+cYOots#_iP~E>xt+2jKNl!
zb4&ePLfvV(U?%F#h$j-IOf#Iz5~mmSORG^?B;9Cj8z=9vAx8h^6m1Y`I3k55sc-e5
zP1@^H;an<u1F)FEOc>$@z?d?j3Kix>?GJn#$H9f3q2&louiU-s;lFF!93%3~9tl74
zGVibYQ3m4|%_FvH$iOoJC~XuN<xe$<=QxSf6KhCg1jEUtCu=pOR|{e^%+9&(tSv<E
z=**TK!_@plVN~JH&EBl;G_I&KgRS6ivv;<yIy|t~Co6+rZLp^`IA}<sH_c-nAiYzW
zmm;lIFQ&08T9L3KvZK<H7rlWrMp<uBwyZYc{)bBt{qT9iosz-&T>Ry-PHVjTv@o`R
zk6H~>f59%+V0UM(=U2hRspF&f@bi~$aLS^q>uHHJ-t<;pJkKWv^iaP~oV?6rUvqhh
zY{ZZFYGav};dr9XM#Ln=gyoTDf(z*kuDGez3m4I&^GTH2^@3W=Ty?`*KfH+)C-*)r
zuzefkXa$oWaS>FoLcd*sK8r%<c(_7T)4gSY$0UPgPhf(CU(kR_U%4<&h4(+l7!2Fx
z58%YqlVeO(o|hPWzO5fdpj+g|t1J@<HI?J~SguMU-qLjR-=tpI|K^f6|4w9-P^q$f
za3m5_diNUDXBQ8%w0mNtf97pq#yZA*tg~<}Sn1~YaR@n&62&rt$xWW3-7~1}GQ_Na
zv1eWy`}*D^qC$M@6HDT_k>E&!2HCoEA}`=fKwcndtgRIlDat2@7JomZ+8Taj!G`T$
zHbya3WNkr;3XmXrnx>)Ygw}sa3VOZZ`CAHlGZgfO&i_I@g(3oYKA(6Si{N;HSk^FU
z!F-PrAhL~xOEt}s<Ty6GYx}EZ-Zuy91;;hA=AL{)&H_?NiP2G)IYLal47e*)_d~aA
z1?*it!3Qd#NB2CyB2#_%jk_6<sSs^{Xslw_tw9Kfr6L|OI9<3vphG0@ezzNu|IFaZ
zt#<SRM`qCf=^k7;Ljioq*phJ?e!&pip*0iBD#!O)M_z`hq)+-ypKJcJh(EZ-!FJra
zveh&T&I$QjS%;Zq2~(9!1TN*n#2AMDIton{rVRpA_p&b*RxHNPs;;>c#o<|qnrU@D
zQo38{dg#9o_>icCeQe6kP5dyUT<9$BUy*eDPj{_moG8O#5KSjbp6Q&!BOU#j$7ddm
z&jcB)9CMjFawX`&?2S+EQ5;^NOins=bQ&XY*g(p_M1W<SbuH+il5H2d$_Ed%ULC`b
zINVH7<flg>9iDza%i_Gqml`Ls`D<&YT%+0iiy#gYvM#7Pf82{UUAVp+#>*li<hPtH
z?5Pqwm|z_u<w;8AYKHZCar5%4%``o{UJ|NLsabc+e0`1rt|sx1LS?D$7+fH05nqwz
zE6T73UUD_+p2L1e(`0Z}Q8YUdr_)O;E_vx+C0-w0Wa_Q@5&DzEOB4Tt7vOA@oZLb(
zhh+rl2O##!Yd4Z#s92;`0MfE-jv5m9DOkDz7V}RItiHF4+Rd-xn_a+imy|ofLzSOR
z?pz{Ol#7<{YrQ8fLCrNt)iySAj(C<j;hfSuVkLX;RdR@ZMPN>Ax{o<MED~M7l+0t^
z^DQyrk2cc~!!R-6?{(4v3(Z4sHSTqob_Sy^`t@4WlYhbe-mv#|-KFms9I|rhQ)$(e
z$_n7ry$LzT@l{IhMbHiU<apooRw`<sr?PbxT#TNBRRB}VCdxM9=c%Fn-l@d2lwctR
z+7(wwo2lSt^@keH)qGf!$(cthJq!Hg>7q@s`j0kFklsFPgY0!${zZ_xX}rH;+L&$X
z=9SMk?P~>;ZJ%_A8cfE9cv|;u)JH`+BkaMzsz6y(s2Iuss2=r?$>A~sBR}frvI`XU
z@TFikA0CZiIH@1LEa7xl(uPwwPsw0~GJ7o#sCD-0J&QmVq1X;PdI}34M+)~iAscas
zm{X8>8j6|fTq#yiFV{*LDn1<g5%5Z<98pK%W;sCS2cHGhvKHlcfR-okzW$T8U{zsj
z&PgMVI%mcO?f_~dGX3m^XCPqM$jHBVtHa)33GaAT^<Gc&CosPyku1N@#;DgqF>BNf
zpwHXry-$eVqZ|L`L-$gCcl*LjOop(_23xA?)^@vRjZWj__2F(CCemsi9vCjP3N*b<
zm;ZAw&3U9+B^V0uJag4qt$-x9*_+;JXh^=*7Km1RO5sz_v-HSnN0rx~yT{&o+~c$Q
zJbj)S;RSq#6y|0~1FnZ8r1Um!0OvongfXid72SU$ag5}R$-ae|dVcvHH-BC+HJWQ~
zMY?>6;m;^ZM{~?6gPLbD`qSpuDFkAUYUL(pc^d)vXMHm9f0K3++(6AA`!h5CueMox
zxVf2%|9c4kcN_orB|hu9kzgC&t!={2+=heQhJ)RPgWZOM-G+nRhJ!5=4kjY=`3lPH
zHyyc5MQMZw#aQZ_>|SfUlj#V~`)=6pzY0b`K)RY^W=qg&x8lW7=Qj}QfnDOd87SAo
zAEW8eHK=4i{AMqikQx!+i^gS+R(t7pCu9sHaoSR^`IK^-uC>*!KU($9qe0JGAvMcN
z)qA77V#NRZ+)ublhw>j^3r28}kzWG6Q;}!btIE8>Lt(s>v6)~coU`e`kFh&S>oVcQ
zD*!8AN5aNDmMlt1FYz4J6lI@FTD{~r5IqgPUr)5kh^ND{D@YJKXu?X14Xkf((sW&A
zyVIa$KV^+kz1PdDR>WE!0;;0w&AwIq<`R>^49J-Xb(s=YMjZu{3f`<--U9BIXvB=m
z2K>cZC5EC^87S>%PBwFlOrsZT?6;&~FN!7sE6l$naGuiADqaS}#+Wz&c5Ps^1M<q+
zHf=sm7yyj*M}c4*BK>H;KCyLsR0VSN9Ca7^)$t^L>NIG;b$kWri<%4k8)kUyUzW}%
z6>BHWD>x5VgQz-!-9pnfyx0pWu&Ca2EGkj!b*u4@{y-Y1hOqFUW`1SWqJ#`A1`VL&
zt%d`U1+n)o0p8$mYPBklS~BG%O4?IaeQapMQ$Clt_4b1b4N|!)y`%uZE957s;qil(
z+Gun^K@X8S(?nCWL!D3q<hOv$O|nF66<$ThqtO*`T)>lA8HSw2uttCAe`rfH#3#NJ
zV1PD0;IY*6r+L#Iguv9}WNWX~a9(dJsiA15p~UazPXhsB&tdzyS9|tsYonZ+8U2`@
z0qs1Evlon<eJFd|b{FMbYOkmw!(6>zNguxKxLHKT&qssS=@=LR*Gmw@*x~Uk&{0Fo
z^+rNCy159D0p7w>Pfy{5$)mRl)N|FkUs%ov6GeKtNSI8~1;DDO?<oq376OBQLRe8v
z94s&oOU|?r!|DkcN##BF{5Ukm+&EZ33lHs51jWFg$35~#VYjq$I(k2fE=L3gMP^p=
zOtl+yL0N?UI2eKuSJHPX{JRvXr#BX+^hA{bM!Rq$;jJxiBa~!33ot2U!*|ao2SI>T
z5f8ildbvz{mh)hFdOdGRpNm}6t}rQmnm!q7Ihsn#zS$65oKAmfBx@%7#LRp-mO^HN
zIPo$B2AZ&Lwd|Zr6Ip3FZ~PVRZJ9i8G*6$urxw7yeAZ1=8z|MWG~12FKJ}x!tJ*f4
zc{2p${T;I=nh^U`BgKIw;o7!zXLv&M$ZUw0*(3{P!iBK~oAyFsEMEm?WzPMZ#gJJe
zWRU}#hoRxZZfK*D(3tWyQ73!9Sw?m*Y&mHjq#Qmx(>K9RCiXkpDB&k92kl1}x|Av9
z1qg_Z7j-7F0bCd|vBgMHqDuTQN;l&u2`82=tQBI7RDzB2ufhn6PN2CnDj=x~rzT!&
zx8-qa7fg48eMk;A3dCZypU(Rx0K;l~s$?q7NJGgKlc$nYJZ((sNx4=CHk4ouc@UCw
z#}TFK6vgRy97p3g#J|T8%^15vDV7pjV4m{9fWF#cAhPy@h`IqFbs|xC@{2SYy{CFj
z6bFOu3VxD^=m($zR*18=5b*<8j6|uc-5hAzxLL4$y`UeAlJEjk*EuU0MWZ_$K!AaW
z!9bL-T$T%6IlAXujMGoJf^Y1P5$A?sg72s$DLq0QQ0q}dmjE!5dUw}mimSL$d05U@
z%qoM&<SAJd;4XdyQqpQ#80GQplb|~8WliL3*1aoJGo%Ma)1K|Y!gGZNYqia-2M-@T
z{`Nc0Is?2c#u_0ocGdQ1?)3Up3Saq(uNy2(Yms8%W{Ha3zh7Y(mh*0|{1wtIyYSQt
z$RatuJ4BHTIR*_1Xrz5Z7zeWvS&+t8=)=Q)1bvXLMm<1t<w1fej}-Qz*+_mztVLsu
zg@0v_{C4yYN+(p2S>Rkz8v~Sx2nQ3Rs@IAT=$uFx9Z<#I<Eul=^b`8F$c!9o4Dz79
zdI?cppciK-M1z>46-*}?=ehHMQzC=R7EyQzFI~q<s030whi^n`QcArfQSNiSyrs^%
zXXNPNid5Ph>V&Yv!~>XJqMz)m-ahIf@VR`b?{bfda{%(wJuj)(Y{aHuskPb@3oQ)a
zryJy)jwg92P7sfVNT%?AC1)1-y}d5%3B^O9{g%=z==;;b#C<2lA|%r>R%-})vsnav
z@+fx~#u&hRF{*^b`8lCfRT4Hyuf%XqfDErRha}MZNbV)=hiEYA6e+5#Tgz3<qPR)T
zrP70t5+&g&vq25jo+EFC$<7M;%6Hrg8S8(KtUKK5iZYrdMq_L%S8;X}z!@tmVZxWD
zz8?V?csI(OX4w$6Ns~`q)mo`rsXTqOq7+9;iC5`rlou3}GwNv%!44-Vm#Ny(qrzn<
zI4Y7L7EAJ@P#vmgs6^Ha`rpVjq%QwsLe&Q2UXCVXk?VgsHAWr_0GH)UKa6=Yc#G#N
zA-=?gzq|rNk15IpTEyHH+{lH#xSW$(7Tx2zEXY9E0!rwEIv{q}&J|5RQK3NHOaEE5
zLXMbt4Ml>Z0zgf$jF+beD9Tc_1em3^i&E4IjmC>Y+ppA1iV!AnH?i*qke(80^F`4s
zG>;5j#&k#A5neg~J<=DGC6UNMHh-eXhbkUf<SY}dn$i`!XI|Kd8Hxzu6)epyMy62-
zCn}~RJt>S+si<(zV4v(j!`#oJ2hehsgr@UUr#TFiqD4T4grJBy^e#*R%N<i9tCZOa
zNumJS(xp=vF>Q``&~$14eFAqJ;69Q!`MOI4Ka9~l-K$t83tK7c4sa5o`H=-_wbPdY
zWkvV9R{B!9Z8*)CeZeL6=%h``Q%3Rl)_N(Pz$>NMN11`<A5jmuR!ghm6i4%XKEszr
zDQyhsRn%BBbpIc%W1FwT32kU*Q7nx+rfX5k<PvjNwcJ~bk{GU240j?ErRj-@(>@Od
zV>AmXHbE6gK^Gn!i;ky!cPdH8#PdMekThF%HuZruodkjLwbSe;Hx`cplY3voNPg5=
z4x&+DGm3_$DGrUzKG<0t^f?S&=wdD7hyXJeI;7KT>gP}A5F$R2@Q;>*)KP~XRFOU#
zwW17BDrc&xbEyDJJw*WH@-p*5L$BORObaWNHd;=hz}C3cFyZW>j%8nrwnTRn_wfR_
zf21U#ZNpH#z?!HdTaj!v8wSJf_^L#$D)9fQ$Jm7mqZFA{;8*eJ9k*@q`Ql|}uKHP!
zNvWKznY7a0CHOIPJq<I9@X{PnD`Oawp6$j^NF}4W1k$_9C<$K}4+|)y<uF1%D*V>c
zlx-2ZvpAz@X~f~i$#_u}98hE&fPY{Y8B)`$a|?eBqUil}4BYw~irDO~ZTC7A_^(O1
zsE!B8ZX8B~EJQ_}P^AFmmbUDXS0j^0b-kR_aGUSabiCKW4M<N4hj#<hsRSn0zTD*6
zm)y3SEq&S72%&aXb^F^pWpO1ysibHh^@8YU*YJU<D)-5OI_Oc}h)Mzc@Pq!teM}BS
z)vg*BDAgSto-|+nOb2xZw{*o`CH1wo9rhe-5Z8}h7*DRe`_Fl{+yK5(Y`jTZRpCin
zcoPT1CGn<5Ms32J3P$+HWTLe(iPFC2q0?c^`JB4W=AHYPlfC<U5J%;*!Vx<a(R@t1
z?xq{_a?ZZH1VEN;C&x>5))JdMtzjemKBKRA1k6AS^>H9u%RcYGS$XgNY`L+da8)M%
zIk6QcI}=;gRLr_uo%)OcUNsIH$IYF}3M|7JW43$(pS($=4~)RZK2tddM?ug!I=F~=
zXD9B`ZGrBn{KaU6>CwUzmpho(d{Z@N&4v1T>z!en#1T`%FEHm#FACUaDEJU26Kxo`
zSs^vqEd5rX!lP*)WCL&eHuyMW8j6{{B-01-eHEqu>jeogtQ;KyO}Xn;u|se{sGOH&
zA;eQ-9%szRQngp*&=uY(MOuo;kL+Us1>$uHuy9(kYoz7-=hPomyw?8Vj}4X<M$uX{
z&WAF;R|Myjw~0(0wp<+OzIQnn*%tJqed1kblPrBVq6zsjGi8#nj{w)qzPk#096*1S
zBDbjte+oX$AszE+lUgg!&0dUI9i~a?prM2GKWrJW_sypNw6^ROun6hD4hhUM1u6L`
zeSQ+<lp0Rx<fAE$55B!&Sp?Js$mP}aCeCKkHs8t7NhRxC{1URsHeSMNne`ECRx}Oi
zo?|qvq_RXhh=v033F}YMVS+hdRNeEMvRg^|3_j|)Sel-U{(bIxHm}bDZWghCIcEkA
zyM0xK3A@=Z!s->WaG1>U^Kx+34jAfY@n%XOD9<7nymWksV%7qL#a!sifQjad9I;g(
znC#kqCyFO-B2_~;`_UBB5gtUNH9B-CL1TamUlB-H)a3?)V1y=Fs9XEZ)_!CEMdMi6
ztl}UUM<cN)p$>`Mt)sq&Ycd|&IXgH@q{HTzQ+l!8QV>-spEXi+y)|#Md_Arl$Df4)
zzhzKhE*fM|VKzGOxzb3{_2YSxbz~o!=rbIdXx<iBjH-PZQE4PeJV_Oe2_sipM~6p*
zm(NJqx4ps@pGRW-9Z}I|?HOWxz;wFQL<%Hpi!LDJSOKYQnTmme4*FGHbSApw_y$bE
zmUx};?2HO%D=Vxr$Y4P%1dsBlgX`N5$*%<UTz90x=QOd?TCRvDU6g?<Xh4U*&#u1r
za1%VV%GzPKsg$qS;V_~CV*Q9F{B<wrhrlu+u-eG9wOc30^^?Y{pWFMVd)`BZAFy(?
zs_Y;n3-N?~eHpi0TORE|g%<WSml6ZqUIpSPNUB*tAqp0@udTCSazw6!7XhNdOJH1B
z)s{s*tPd~{75!JrG1um)c$DW}$(d*wr>`cokJ)h(Eat}7u2x%9z;QSlPbprUC|pvJ
z2nDPoi>g-A=!S`A;zvD9CC$NNCNxfSlA~~7uXJg>0ufbs=`B1$s`;+$q~(!gw<yhH
zrkFtl#{iFSMY1#cmd^<1r__ceGB2WikC%)-GYMm)D~~YbQ=DU#Qe~GklaUv#b6QJb
z<JSmvl(Ymz8;B!e21T*~sF}`XTHr*?WKq)sxU75oIn5Nr7oPDGRr^9SwDnfQt36Rr
zJaKHQF{ceS-Z^BFIU}NgLZpw$saOc3{8ZdWp<Ol!dzv0SVHesfI~UvKc{B)|_#U%?
zdLd>HVfJqVc1yB42`JNpXR)9Jp2Fx@1yssgNfulHcpJ#m>48<tUdCf_L(^2?fw^?y
z2#ByF!QkghNGJB>j^b$SpRsrnCi-GQ|0r*_v1gTHbW%`~10SaX6`=eWU_>u~W>Xyw
zm_q*imsEJ=OT;@U1#S{W+ajF94Wx)KWzeGoL<=FCRNreIH}-Y@v#P?pBX|ROKFmk1
zUZ&&^in?FW%Bo&{kYKW0NhU#F+*p$FY;vx;VoxFgBd0Id&QFwHW9(1P4Nu4y40>j3
z-4On)f7p13#Dal|l5^^D?VY7qs=aeH%`G;L17N9cjCFQ-YT_~;p>LU$uQ%->DQp$o
zVEI0i@(WoH$)zXnW;I*`pT{*OCpepiI_QI-4@aW_kU($0k0b*3&D8T?I)BN2+Q@@f
zQnVtU-VD&$kcbVj8N5Gp35;yAj7Ik=U6-ns4$fX94raHWTw?5AzaPYuIGH&e3>cM0
zsx48>%_k{Rsb^v0-%*o>mc}&eWeFoZ3nXLc_DG~mc{I3Al!?@NP-JeHqPJ<HsrPBM
zfYsXeqzaLtr&5qHTl+@#4pVl@G*GLPiDu0D+q&L$$N^~2TXv(%s{NNR4y%tkCoiUh
z_ZH8dHv)e61Q-J<`GhiKhb*4%q3C^OH_ZvBQ=wJ3!kmEb+&I|u3U*#h5eJbmVNk(8
z1N4nyAK&E`R9du;tm!7>Q%oz!1kmbAZ|n8Lm)VPF#FRSs>cNkufSX7GZQ`V11E*Nu
zY$X+wZ7gi&I;^P9DqC42#?kTNQT-L*e;elchxzNcag^SsUeE>Bw@<=HiKjF>P)@N?
zTZ<6|Silv^X%&v;@w?~b^@blg%*d%lmcO$|e08F!Ni^g%@QPI6X-QEF)f*{WlWF%{
zZq7~sn-g$#<S9#O6zvpz7_;LgMKE7dwj$MspQVad72EeJO{r9Bd5TET_o+XcSYRkQ
zj$Hf(y8klW!sP7}3j$@Gxt>s*oKCcdil6XcjC>{2mlML}x&(4(*fUAzln&nJA)Tu%
z<xr^1BdV8}T@o;A!eOlFx`j!yY-QCZRw$EpwIP9zz3d(NT+PPmo{6<?lqJ}I7B$u$
zzG<hoyfF$XqTNewgo8PX_I$r$c$Ym5cUQ5V+l{53=GXFR--0Akh0|mnesp&K1WrxT
zmy}}Y%_`1ergnp~-G%;N^l*khW7=1zR9YY`M#8i5op%2ExAb51p1r+1m-SRdOH_j5
zht5VM1Yg+zOip$^e&-O@c$sVUuLyNW%b#pw7+d0VVAQg7_i~*TD#!-c0qj4LP|De;
zuSwRt5ciB4s5f%|>5I>FuM|RR2nvPK_hevN_MDld#oxpZx|=2`9>U%EGFB+kaKa+;
zM%q`cpr4YeF14Uo|IyOd&NuHkjvCqUy|mz&6VXTNAhCu#r{d(6^)OdwT%>z2ZkMXR
zZMQo`DyZa)9CEEI<N`TC9M4s4d@iN#Cuwg-)4?E5b9+72Eh^Ie+?YSbzsg*%#gV8{
zEKh=2V=Q?&UF(WjUI5HoNY}ncvP?+IS3pqjlk~|3=GVHOW~vmoDwY<^o`AdEbvM?-
z7_CrcEaTX>IrMBc$+?5vep3qEu+JxLw)e?j!}X*UP>w_pYv3vx3Tf8LzU%vZuqpH0
zHf0{y4|c^gezO)$q!O+-z~?Y*DkWmpu*p}lHgB>bOAA;xXx}stY`0EdxT?1;?Ix_D
zaihjgyf~+$@Sn!TH62XCF(b>|yb@7h-NR?W<ddzU*v|k>JI>LXVJpogrbsS;IYbub
zLfLbN0f<*mY?+>8R+L~r#AqGN;6lh{ZopNq6jp(wRM`~FrNhb&D^Q&^+yQBGlqMz`
zl^t$WEoE(BsDf<GhI78J;~GRni)<IywZ1atm}AH+GR=ks2HBgj#PYi4T8`Ly$+7y>
zJ^H07T&QrN!@$}em8BNef|?d>_gqog4$|7J6+|4k2GIf5Hc`sPBl>770>!LR?gk9!
zkHZUuhJ?S9Hi}Zqs~p~*Km8C6LQIm5u8>+OMdglwV@#^44pC7s8eqN=F=Zf+PqEXf
zqE@OaJ0w<?MYV)nH&Vh!L>IL^wY=@I{gK2BrJBsN8!W{1{fQQVC3OWBbCxUNXTQxr
z+|BEo-5tAG&VJvpsePvUDF;Q;p>s<psJxjPs=tDI>NBAX1M2r+ZEab7iD_end16=3
zpKr`1p)X-O*?K{wioQP3#pnUmEHV`m4TY~7YcjFpl)i9ql@1_x@P4ZR?+fr(WnZ-q
zfa+i-qs5HlJQK4f-_4Q8IOLQbs4#NhxUDB$fO_{_97Hi&iDfLP*hYb5+9@!OAfd*J
zZ!W8v1wz{FtOBAbd3Pu1`qM-w#hFJs@Tyb&_`pd|T$}ogEDEHyVSNQ44_;?tvQphi
zkvdqGU=DKq;o12B6ZHlCe%N(%*_z6%&fK}}#VC-&0`_{DEir}hCcsogaRCzZ$y<m-
zIf)Cr6q&mj`ZXeVrVD_z#QK|}Q@YLdXq@iWWEaRc(kx}X&hHhCHicceG|#45s<Z2-
zImqqSig3ohW#4S{5&hEa<4SdN2z|4*IFBf9o?nH=8<q7ZtuZ$VeM|<RUJ7Q|;B*9h
z=zD;#oBpT305!7_CAWoE+-1<Cxna*4b5`z+lwxEaJVAXor3XOrayCaUFD7<b8tji0
z_kuaX)7#^y07);^(<C@^@|l+DTIr+%pOX3ejKadB>Df6+XH!E#tj-J`n8Y?NE~E~K
zE2dkK;nq%RC3pda$>p^rOd9?E^Kk7?VYxq#*>|4Jmkg<t=SwArQTZw&or*>g`zGr8
zbcGDoxVsZTe~ADETe}X1Hut1%N|jgUk`X`MliZ)27o_OYQSf#sr`8?YR4|X%%*IV;
z0x|@qMFwg9ugjZxckwuD-$+@2z!PqJBR&4h!C7-N_rlbDY3SZEVr6bp<z7baEV+qP
zdtq6p<<1XhLGHZOOEB)Vh(hM&Dt5B7S`A7@Q_GrETYLIeRHyGu_NlB2bY4KzHPm%8
z4P~>`j(@hjOd@JT(X3S^0!Hn~TP53snA0Q|a|iZSWq6!n9h;|BD>9BPZyUQF9bS_D
zE+DsNsO>Ux>PMB1|DQ<|Bc9-$-U=qki>n<UlS})9aB}5TK2K^D&-r^Zl`c^$8doXn
z(dueBsbPhZ{70MRbkTvC-8`G$jY=`>WUIGwPN}q-t=;C!mz--ehb@VNZh#7B!V1#I
zv28-KTq@ItpO^@iM5mw3Li0GdSRSC_(_I4;vw%>6pEjMJHuDSz{V=AQ&+z*94$vY1
z;}gZGq_ZSqF-Cl8GyT%0yrj2?`+p|y<ZU9i*iN^|-5-g$MemA*3!G){Li5Qaf5aka
zPMI?o#@J^%cU0780GC(!eQjVXP?qW5ZI?ic!WSm-!ryr7$p8vR)Op=q%Wr@z29XTM
zX<ri+!AX-|Mn{xxa6~DuC=*a>XG`=br2-lV-P{Pd$uwk3-v0Iu&?LXP6-aBfHaCV!
zdO-Q4T;7pPKy(nvMosFYnAKM%d@Sv*P7m&9^1$Fm!@v%N)dverg`=q@!F_b5m%14+
z5u~{s+$rnKdg*E__QmLqU}naB=UIq33vZw@>PnUl4FgF_$6Ot0d3-l3Gk$a;XR`0G
zjwvP^gwxpZxu9RSUDHnP5{ch+4w&=AHLFX*T!Ev|;w>*d&AhU(JznY@<|Vo@dy${4
zz}+$Y%ul|ND-JCep*YXp(8BO}B4I{kMoJcNPVWIQLGV@T?vnR3FjX;XM51Y|u)-gl
zMR26ghxZaJF^i>reazx4ctCd=ZFfcJsY4_yGdT!LM~q5gz8Sb;A>6lO^#@jPJe??G
z*d&_xgFIzIRpYVBGOcn+lG%5SI7RYNsZff3$_0thIurja(4Olari|0_|9RjZEfu_D
zIm|=<z<qY#lV3l|Px`c|<dV`C%Tlr!DsoJ2fGWG9mAaoD5Xjl%3Z+-&KBl^2jTA?&
zrBjWhPMCFbDAdAq%Q0XU$zMgxq7K>;_09xQWx~#EL>4g9FV)*N;$p~Gs=?<~rA#L{
zYezVTG>OvR_T^MJWpOP{E3M8%!fn$!V3lf}Fsh`mzRc<%a<~hOcHH(kQsod-k6b&N
z@Ed{bBjA0kP(5P(6DEF9{cyE7E-q{L$>E|{vl>v}cHb%1J|}NC)JdQ3!OdJmMWtQL
z(J||bzBcosSD2*loadgJOU^B*T3<tPw7zO;x&lh5I*Eyhb#Rzzllp#=xxrI&oSRv+
zDEabNxz(~%r|8kAz?peHyB_@Hq><B0WfMH*>1R@CRlL=wLbO<yS#1s_sO7py%8lua
z*<tNSRk5OEMh@+9`{6{oVUh<{HzoWW=)TU~So|<L=4U{5GcDU6JG+&guLP%2;VyGo
z0`*ZEuOOXHH2o>qCjvn3uXB5LU$daNB=9~31O=-~P0eB*Y+8Sa9wrm?S{8>H%DICi
zkhlk_v`Tm<MTRZx!CC(%qypuk9D0&-Gue+9DkWxr3UwJs28}v{;FX0*uEI3kt)*5e
zL|aSZ%5Z~4%I<3tOrH03&XpDDWb$wopOE>;UbM0$2P?)*^WVAgBKdL!vcCDuiDerm
zj;5lF={B2Zb1>qCkShYI3D^n|mF;aio3=DzrL!xrxVhZaXHGIAc_;PKT<>pQBLZe6
zt0b8t{S-+)3raC*;YaV?;*#GC(Tkq{d6HqC1DNBD?&j;u=B%D5p1h@!J}ADu(shI-
zGlnB&iwOd#hxl&4#s2^kWmzC-^9zj+`6@OmONtl()@sVMZ;#nJIXrHpQ;QZ(f-vy9
zGuhNL*~~;GX+LZ$m5aBL{+ZOfwe+tHyG^BWEKD3zsCD$Dz7R^lg{%jEY<(lY7mdHX
z-qGj>XXy?x3cQUf0QM{YU!XPoch>X`NIpQT0~;xnYDNTuwD(wDKc`xlhoytn{jvz~
z2TGx0=N-^NRwOoSVSbf_vHe{A3mG^H$K8~1Gou!%aY#8i(82oR<&hcTO(59}0tScl
z+Cj}$Con1#RS}kh?kN3?qrr^E$b;FGfs-b($ZK}gl$l1Dw?X)CV{LcN+)h7DE+hSu
zW%6F|tf=`|f;W2u7>smpSZ5aZGoJjG`oMWb&ob|o-(20I%}&{v#NkL2)KQUrib7q<
z=@PL-RD_bi#{{c7OqEhDQ>spD=Q-_C)q53kr~zfY@Ou|9gn#CS{JIcW$E29%^0kOo
z$!+-TxeEx)kyi7b;M>kgx4HnrCs+YH2aH|Dc@I;Pv2Un#+z2NHOmI3y{ugxSii+$k
z>RuMBXo5uM0T^DDrcojqIKKvhjKYrw;d`u;2R*?()=T%&Q)O{1pHNinXFO4i{uXX|
zUL#!ct`0YIpUpF5&hR&RqkN3XM~g$7wf7FI6fuz(UBFe9Hk<Dbb@+uRC(93K{s@zb
zf{iE?F;0;f0On0J9+t7cks&XV_*|)8B!h@6H(2w_N)X8ED7Wa@n#+8m!wKhH;pKFs
zszY)(Nre-HptqAm9toX}`tn1f^GMj|%<+PAc792+^p&Cyh92QOskmn*_bwu)W&PHP
zz|?29+Vi(G-BRk$LEvgWRqU+o`coip=SrpU+6?)fCTc|CIlip(9aEhILi27O{OS^*
z6oOEDizZuK(yEOBaM*+%i(_2BkMu>C8=s>$M@ZS-A$_M{B)~)}sj6MX<SZl{U2C%v
zZb<~^7Qlm)RkK$M)<S+7ScUk~EDDbP(Es28TVvfcl>!dOIT_9xE%qkG*evQSp1N;8
z0cV%c)Z=I7=_E0%$bg&fB~RziN=5990x9A5uV%bnq_!-VXO~z}UCdA-;)jidY?6kx
zX^c_KUZ|@SRw*tZ%wKChF<4Hy=N|uDGO=_KtEGv;=4_&{Sws|aV<yt)UL9-`2V^`2
zxEso#C9$%3-KpP3fcKUWI-JZr;05AB0-TrCr_D3c1!(v4pMBT;R#-AgwYcVOI8*PN
zEd*86wH;QVyZ$U!Z<<GMd<f}w66a<yIP&IEW(&U8I6WR?w#pi(KC6zXO57sZ<$xRo
z{XP}_&T;g1lq<A3DRP+Rkq_BPfb#&2Cc^1ul-Z=bW}CCeZ0;~Jw)6tKOE$l3F56y+
zxEX!*C*bULLMK0!+HxDxB@g`HuduH+erfZM?Oredkr01|1=N$PQI{+H>Ow+Kat}cM
zX9+Fv=k&O+T>6t-pNoGVD@F$RSz!vcZ-o`OZ0i8&ekH-1^VamS2$Vmk>4W~8XS(2x
zE3g{SUKSe+7D@8%nlIAH-t9>&Y|Ahh_9;`#w`UYgkT|@8=^%oC4jAE>?hF=&kUn#t
z4?t#iJY>@Ki!mh?VUtRzGmVodwzM>3KTd)c_D4_h6W#Dz6tuO2A-ma3H`mJVg3GvW
z`6q%ayq|$6HkbJ##Qyeg^`WxvYstj#41)C}?ygTK;h=hcqhoBq=h34F_;2m;!wvgi
zdbGK<^|#uC+UBE&4<B!CLA%<+joPEXc^fx6i-OM-)*gG_-=-ZPtJ4|n<~;v5{j5{b
z^_^&Z#on(aIMtgQ8{e&MZqzm_Udta`_{1Hx{81ky*6}#<p7~T2<abmPoelkP;PoPk
zP~N^nMydgO(vo95CFxPM-H#F3CUMxAav_OPkKFEn&6XmY_)90m$WD)p9a3&SidF0y
z_QKiPxEMu+q{VR%4?{}*h+ftqmCjQ&>HE=O5M73p+H1s82#c7*023C`yu8fZNYa)`
zQGtq~6h=|*T7D;@^jHdRc=30G3iswQpGeNgQQsL@0zu8J(0g^@heKdQilzcXT0l`#
zfu;7Q-5_r^Y8Eo7Yt6<=)JDul)Sa4KZSdkcYznK2hUiuu`h&zkUvtOyLiG9$f{<R+
znLA-tv}VkLr+=j_2*pc|`iSBL2D?H-0tS_7Sc8x_>cK<IDvom)Mia{W3gCg)doVex
z5GWcZqW<I(QNThfqV61t-i3EVM7bDoYQ)%;B(ef*eDb>4@>+*4Pu|qw#)j`l$A>>Q
zcN@Fji=W|P!`nGL`uVu|>h+2D`fzWzaoqCi2fOg=!O3y+#VOqLEpMgXf;U&_#K5!q
z!Ovdfr=#OWtK}UYd(Hi$y(aVr102^6PMVEY#cLky?46=JTg8JuJYXxmz2<)N1e%>3
zR&ZSGEc>Q+_|n^N9Phk_KkF}=d(D%dX~>t&lLH*?C5%`1j_SuJ&7IS|`muL(dVF-)
zqTX<QyUo_lUcI^B*sa1GU|g^9W8>h&YrU?+9qKOk@C`7zxBzFZFQ~7*X8pxpgNK9F
z?lzAbJ14j-^KA!!2$KY<uyxefY2ug0PYqa6{rKk!bW5}fc*(|ppF%r$?(Nq1>#tyq
zr8&@n9ojiPZtUa44_{(Gt<x8+ljh0kNyB?}c(_YoZ#9m8Z0<B#Prbdv76I<G)u_NA
zCv_YidjY7yWBC5!wADoT5zx`g<@ogIgltZ)58nWU00wn<dzWAhOgOF?fOUBMGxm$X
zpslEQZ(cXxci8g-S>DNU9l_B80PdXFEn!rE=ZUpg@1XH&uL+{XP6MAFVn=V9twxzQ
zui3&jO&<JB9Y#LI<<q9Y-1w`7%N5#Muldre@BY}t$#Y}u4N#)h6!d{#Tc<m(1^Rd_
z*6-Z;I_!^nLEme)j~jq9?bDOyUi-Cn2ul47&BdetSu*K`qe=CA+x!NCWl}v~kwDS_
ztr6jHI<(9PU0~}lg<zbJ-IFt8AXS7r2g41R`|L$iU~F*uobZ_gnoHI*GQ0cU`SgtP
zm7E1-qEn<aO{K@Q96CCrRPoM2%w&zBCB01(EUi|&U;nAScX;rsy?b~HnBRsI2#4X}
zYHefl0j<oQ2B{%pxu-xZB|008nNUNgn7$aH8=$eA`R=`4%=6Q(pCW?e2fF;GT6?^w
zL$;;G>(l-ELB(#-_wIWqaX1{39TwIU!!?fIsW@l)^~O)aCFARRK0f|vmfS||*i(*c
z=3j=G*9rAZ9A}GL<*km{C2Ne{cb@$~`FPO-{5Fa(G8mZYRFCQIaylt`75Z-Xr@#N+
z#_*I9$~4f%IG+rI;RNo$y!ozjpuPPBT8}&N`%-Fr#E&+`54lsr|C-127qr1XRc}Lo
zOh1?A_Jx<2`^zNKtw9jsj;Ap3t<5%inVrE6TH7d1RS@ij{W#Ij?Z>$4!9X@Qe@X^&
zlr!Fe_ht%?=G7$i?rP4<)9l->JX!eW0;A@>)|>yH9MRR@*nM~QtC_cYE=+-jxKNcB
z>`4yhy<^XhUaX`JCh4xBH}p<C3nukW5)G!4;K-kxOP|2j2gq=#69KJGfCKzTGz!#7
zp@R!=G?N!_ybhqTyo*1gNdRa+5+|ncCymw#y@Imj2_CqRi-LA50;*N2jX>wi?}F?M
z93=GeHL!7E|Bm|i&lZjTBR(1Ve-I5Wr;|t3?#+!cTmG*-ew3B}A3VI3|G&s5U;eLs
zcPskeivG8v|E=hMEBfDx{&PfsY_WEOA9d33ydrOE3PrHb(%#|T8(51J#;8iVda3@z
z5_>Nq7xxL*f?UO5Zpl0a^ok5@XY8D4Bz%kv^Shj?imM2w>QnecEGTUyKD8=!5CPK!
z;@ls-Cr9-CuzQZ)8?VFnq4&}sbTPF-U&x%Ue;5uiO@??|kKt}5;zps9_@tt%HzGLB
zfH(p|5B#%fFtmu09uwbdou8kpD2~{}x4S^(F$D9%j1My#6P=%qBpW|=Bv~||Bb9!X
z9qpkL^w8=mZycrY(b^ieq@S-?zcC}JlsLygr-kl!{n3RlMYiM)n#SH4SB<_12HI&3
zLm+y7jEO-9QA}V#dJIr|g3qr!679JH=w*N|YzzSGD(U(Ix`SX>uT+N!zD~qhBNN=#
zE(LAHG`Ag^R%vj_UqEiBf3-;!>jI$59fb*#HBqI_AV)ZqWjMwQ{&^;gT-!bm@K%Q3
zT&Fnw$_IYsgZ0W~*qfZgPdRRMqY1+T4WE~<g2_?%App6TUaWkmq&*Tu|G<uRJM>}z
zfElC5=|88zs2fx>o^{ajAesa^E&|Q0x>h$#J2;D@DWzk9qvChp%bzr@s?$@-x0sSM
zh^Fg|s$5aH1?87Y$QMgoX?(!!vvg0UYO2D4By~WOjE`6Xmpo~W253rlK}osiHlBE0
z^sZXjc)GRm^ufk(<*9PbWk|dLlJGv=ExlSZuYR}jw6@{Ci-o)ppKH1AZd$`We)`~X
zW>|W6GxyysYuv{$?&I{hZ_dL>kbV_pb00uEYq{|1e<62?n3?$fV3JL)>beM;!vOp^
zuuY>$zl6V4R({#o+Iss<;?ch_N~N3cQif*yEA(M=4+~~kaXLp$qVzmksni^&7gdD;
z9xG>x-PpfGUGMuV%rHMjb@9j|JQY+qL~&0N7gLTPKL*M`x@5!p-ZLHCGj&9&-kT6O
z&Pzsk7AGW+GG$CgB<HMPK<)3aV<S28Uq(!qg!o{0_7oXAi6TV({!@VvtmY@^p>Mn1
zhLp*ZNQ7!bWFX;Ropy@)xb67YREM~zL?Ix7P=2GpgV-tzsi}~e0Miylw)Lv$m5)!w
ziG(t%V2L*UJVR_NUKTQ|Nm#bPgW@^`)25Ne#MS~i#|F}J%}YYn%Db=f(>XMoTO#4!
zeok-0SGV|zL$9$v-X$d4>aY9wrI>b$AtR1Zv`P5R8}oipL?67FEdtLc<T+0Y9o0)8
zFw#yBS;GXXAGpRydKPP&IT>~ek_}n+3ck;~o1T7sFi|%+wWWX*l?#lRC-JBRVlQ<%
zGgO?9CSw+r^(4O=CkRiZ>~I9wVwbK?_hnGTisKWM#eVv5_v!R(9f}joUJ>M=Nf6@~
zb8;Gep!x|K;JGdGuwZR7uPvta!_Ca^2{{KwMj(RD)7-F)9bhV_165=d?tgC_B_!Zu
z9c`}QB_xh|b%J#aB=I=|00HOcN3ziUJV5mS07t51Ad=$+DUI=H;rT1^g43?!vIvLU
zV7$@uA)dCw)N`zfTy7pGOg%@@e8^=}TW{hI1{Gc1L-7sX3iq^<*GtKm70ZN0=mwtr
zbLz+0!$~Uz{6Vm+Z+hQ&xZ%9+Z`>df`vam${sa7|Ls$bs6>~wqZ|neE`}0wyua}ps
zqg#-IhJ5wA!Pr3B@BIeH7M1%9T%GD_A~oLfXS%A;MRrFOgkvT!4^B3$7&<ff*tJ@Q
zlcfdEU`7U)cx9#8;Yu1BDj<Lvg;#PRF|#m0lWjO+8BEn!M9yF^@IP3rE{P}KQr#Dn
zCzz(BFF5S1Sd_@zak~5pmJp&)A)=H-xeSkOy`WNg%Q2}KY3h#b5FQ!BGz;tThEprj
zaq<%^EC)L{)Kzu0=5&CUWuQ}4!jVdB)<#IQnVQ~neNU?G-Fzxvw<+?DzPndz5>{2?
z)V-rSV-5%_|J6WNlE2adQ~JP3v-{7@N%}VBfF4$ngkk<=YMXgV9piD_(C6`+@3J1}
z`T%ZbFI?zFSdTQv0whCsnttMrkza`5IvsE2ERpG~Q%VCrIoz7!(e64yAB#Z2?1h5r
zLTk*vcE6TA%<AAA0725n#*$Q1$Hu;1G~QZBxRGKImqxzXh*yks7Q#I=J6L<*W?#{*
zzVRNE%{wrf{b<VxIV!}Itwm7K!4eDp3u8#mHa=7`+(+%=BWk@zN|&cBH1hjf*q`Ze
zl)Ura#xRw4^7O@(5^jYvWj){&Y1_9Op1f4?9&E@pPRVwG4Zp;<$CPUWo3KiY$hcTQ
zXBUr!w-6lP3bxR1F@tDx!w~Z$barQj-&g|RRMiC%to+fHlQ+fGgK+r61<J$L&}$wh
zm8uY{yKssrxI=9&ITSkR<60LQ3V^T|4#NrGKE!p%jxzJ0b7=bsfTsh@6D235LZ9b>
zKPDT`hoC#1=&Ox$1e1m`$1hCnIL(kl>shNw>LoTuxdqf<C!b*|0NGP3r9S-vd$F;x
zVIIRDrUmUey&XFTL_bq+tH<=Vf{f-s2zN1#Q86MoZ%S6C=bGjwh<D;jfug#k?Wbj{
z<Dce8gb#VDHJYsYq*6+b7Sw5IHDZNKN&RACzE*x2?FK!`j3P3JVUpmCUIYV7B|zNM
zSnaTQ>s5al8E$;#P^rfGeO8c@B&QYM$ex{t@5A@eFp9&fm=I9~?XAq8G<&K1*f?%+
z6i{w+R66N59L19gMf)*`JHRauDXp9|l=w>Zce%1M`7l{A0H+Ww{ZwejCDsm01O5vI
zl4Sfpx)BK8l&<l{qCjT*e{61TK75q&|9G^y@!;0~<4b(*6gz<Mq1y91$*ph4t#8Mz
zZ^x}~$E|P2f0}PcPFM%5<N)>+K#~*O;XKq&@z-|q;N@X^52oRHTbp;33C!mp`MoF_
zKh-e~^31Rz)>mMjb3!3#gw{#@q|rV&JZMn<$n*m>H^8Ozqx#NH<0$uuywupuJ^@_H
z`56!f5c(tBsA|S7pspAn;Xvc%Ui}q!(QfU$ZtR}!!LE2-srKv{2n(Lb2RnlZtEVL(
z3H7D}<($IB&|*8(#Ps>*7!F7K1(1m*AfG3F)=Zz25!UPYaU7x`tn0|qUfbQB{CotH
zJKXu9apGB@T28Bzy_V;GHqADXP+eLz0NL>e1JoV9oQ}HXQg*Xf@q5|YXlY`4z(8%;
zdFkB`+5#5cqlH@DYA|4T^M0=)#lKjt-}NUxKN<STdsQ_M{w%G^j0$Jy#$kX|5KDwh
z6i-sYDa3KKxk)}8RPTBf_Dra{&fIzMvU;>22@$|Q+8h&Ndc%^fGdkmL>_7wfZgnC6
z?;>i>+C4L%-$kRtj3Em^!tdomBnc*Mf=XuB7w%nN<UNz)kQoDE^~pm>uQo=MR?ndK
z0m#Aa0Bd|M2FT7J>b}Roj!#2P6GwyTWr0&t@~P}MEd6TKZO_FzjsTgU{Z$3NP*&9i
z`=5h{H_<&RJ#KOc-Ui${Bu%q6?PH2sJ=Hg!)mZK>m#nQ$sJZ)u?hrKMPUKN?jy1@L
zq7D4BB>iI?^iB0cPvO}pvX1a7u)`P7UmJ-;db|v2Qiot>L+3=!Y-yh>GtYkSDY=V?
zM%aQB2!~Vj=Tk{9dx1Y-ab!TwV_cr6CnSUNH^EWC;!=0C!q86=kaet7P~1dnvS8Vu
zZZs5$QjHsmP1FdxII%vasTq$4ShQR`NGb0!8XZWdnLyVeslrqZB2_7yCs-=8oWnCv
zUE{cQc}@~hFN|RxgDbC#3Hn@eSSnXgE)xGIQkP<*ki;IJ0${1!86t3%9q~E=EF483
z^4LJ#nt%EJ5*;k5Zd*7^IEGfspBPw6ZkGT*Kb&aiQA#~X72h%c%2@KH*;(FjlF2z5
z7Q=*i3^b~$b%HDd>@J8cPf}~*MT4}~BfkZ@VpO&^*^vq@Q|%J*M<t2a6-y?|f_|R_
z<RG<~lx213$M4nF6f$FXyj7=AEvu59En?UwrurIE^4!hDIiv2AWPH(hE6<le?IDHl
zNiJCK%PVp68`@HP!Q4?N;EsF3sf$Z%I1*F##Gb@;Z(Wt+hv$fIu5BZQTHE$b$Cd0|
z&4!%@X%@reT;?yDMbAFpdiPb9XkHYbOLq%tQxY#wy#_rx1Y}4NkYPA?)TQ+F&Y88=
zpB@j(KcW|^3d07PFdb9gLOiqUMAg(wiNum~%(=$sKBp;SY)44p%-HNB>2tllA5sNl
zQO@Md2M!Eo=;wNOFt6al7+R?9&EH+w#GLJ2m^qER%$aHp{DK^6F=lkFNmV=^oCnr}
z<?y?VF)xJ2Q4JJ`LGo`r(YZ{u>u=C=s=!g1J1p-=K9{jS5_c$-b+wa7ZunJe0}?J=
zDU^I1M;)?55oYwEb%b^S^tM1X+W<~p5Ldg}LL(~6YPTXJqwim^Go<g0(W}Bob|mGj
zJZno81g^KWS=Oa^pVItf&W0KOhqs5NN2<4HNHSe4L1G+%;DFGnDQ%Y3{_SB#SM_5B
zZ(m|o_;A6Fj-!N5VAZR8Yc)07aKtvHBtu{6OcPmE8;80f^1fp7If~%g<5&;6xS)eZ
z{Z+krutv#cwZ0U6X99%~uYw7&T0mln5(FykwzUbwg;7n#2@;SzWx=fNm5MCa5aNnA
z@>2I%@%UX!^7|+O7=F+AL(bbhBz&@Yp58tA(QF?6;O-r4o^zYQDcFz-xU!Q<`)mQ=
z5(cEZzQ>m=Y`^=;|C+t$@;Xb1+{IfStFDlE^(&T;uJ-#3IpY}JZS4!JB6j!UOBR=h
zub@e=Dz_V_YNZs>Dp#|*wdl&j)WkFIsa7x{#D6W^>%!~^*5RB1hKwRWV1lnzyp23?
z5Y{dQ4SeIKp@FFIIe=kHRu(Kws!0mHNudPU;`tC?dBKRnbW|fzjflAkrA=5QotZ&^
znH3pmPKP8montbc9?K{iAY9NzDIa;H9@Q8bVZL$9lP)EGNxBGCc4o6<N|K_mK62F*
z(;bm6Bb2CO49IPsCP9BX;E7&EQ{|nGCZL3hCs4(b(HY4<y)bzXC_%DZf|)4Lvj^|_
zK-@{x+dXkQ$I40``kIZ=b>&?7mn?J+5F9TU8p~mUtG2rC`7mm)k7@CNXp#{*GAa%k
z(qa2_OY7LNh(u1M==H%&Iu`1jQY@zSw6$*}D_0X-DNPbC>BS05LX^DIVzu**n$05#
zb>D*tG_ae()#L!s)zew4bB9y<Bidu&_X=<M#Z^u-HdU+VWH-4#>c?T&X3w$UHoCbf
zT6fg-XShd>OP_g`12stTOf@!Jc8^u95)mVF&~uc5MO5Gwr|Vu84=3s!o>BU3b_Q#a
zPN~E>t8$*RJ|O5xJJ!3QwI#p#$zE%IU)V@lS6KZ>8lSd5<@7+Bm;m`ZVznb0UJ6+u
z<X+)DG1M@?X1ymViX1L(Mw{1uGLso`o6fqaQv(x73rGy>HT_XASxY8Y0~Ch*F?qy^
zG(~CG93gPla0k)+HVwL8PrBoSXg3)6SF_sghRNcMe+YtceGp#c9n6rb0s?IZ3BY=#
z1y|__pQoIctW<1?_0n<By;%CCqacV+qL!r1Dj*!;So7N9xUEyqt)kRx_4P7}hyLVc
zuMQ${VP83nyD~PmCs7+NGBy`jz<`b8ELzu_Ue4v#9QC7RW+?dhIv5ZR5*-^POvn5I
zU7ul3m3|^h)+3*t5u9~AjR54GAkJ=!tP=WyqjSXk6P;P};3$r|L6UwbX}`!uo##$~
zbNI8p<^K15GX9@zX}QVtUo-tbYg-SuHfyzX{;#dgty}-kFYzgG|9o_t|LfLA^wvl8
z)<^W#NA%W5biR-1`b}m4!x8t13rW2CQ8Pt<!cm`ia<&E=>+Vn&E}ZDZVR+DyTyV-E
zE7U66ZKO#alcUR^lYoS%j(r2uexc4xSpj0w`Vz4_-fyd5rY<ESCnrs^t*LpD$&wRe
z^|WI_&NQm%#c(clma$(oWW~b>Htf|Oz4u6$&<Q4&K`>I;!qiBbu&c?EvnE?Xkw#7@
zPIIYQCTrI(b)w#t<MAR7`2OsLOzWxAY$8U~Dg!AoYI6r5*pmx#f)Ey!4dFG^7|WCx
zaxRR0a@y!cmm|&*=51ns=OCF=Dz~s2RMF#wbV$yNUw>Uu>3_HeC$)+C4iIQW?69P7
zuYeLIgq+~bXYA&8dA?or=>hTGkGbD+)jOn{P5Q*%sM|!XP-T-q*?5FdQL3Y%h3kN=
zsC}AZ`$U{iQXOKRXrghP(xU)81~!x%CAgB@DvX2hMd6J)7g#wwi;orxxSOXB9Nx-!
zO(S=tC&5Q_Li*bl)tZMZ91m?5dy`aq{667RGz#oh2X+%;5%%S%;n`%`AWP5~JK|gn
zAg}|*!)ykaOem1#6x}!+Pdp>uB<p9$H*~9Uhgg%FBVG$6##1f?&W{OjVT0(*{W0!!
z+#iM!U{Ev)yUx$gdV_v<<kU}imRu$4sC&%*ik@8f>&+8w(a@3Y*<{R0m;{TOUm-ip
zWD*R~F%5mZ2npaV@`*Dq5+_gRhKxhOhjAp-oQbsD61rX|AP=exv6pc~Iw<Lb9sWjy
z;AR$dh{<bC9s6PVGhjo?i`~Lu)Y<GzKDcQ?Y#d+ZiDvzWwcCC>QDG6(MK7TXQsocB
z&-yC;q^e6?Qks?lITj&pz%)r#VlPF_tqf##>2A3M=5!K{^t8+rdLp;sW?csNIMWkS
zQBF*$?hQD<xRq{i@b0AD4}(GPX}UMb9EAOm)7J?7C6O|ZRE9U-!`HcJMHcu^Gl2@J
zHXNmpvumr}$p_K%MRB_u`^kA5=oV|}iu>FR`mulJ#6D!6s_x6m8J0W_<Xo64CkZ7{
z6l$pMaecH*o;e$(tf+}qHVI1hKY8B6Fzr#PEcR9%e$IG@R95e)yn(+t$>HFvKDDq<
znn}V`orH#xHG!yh25U(W1Mt9}*-5&nJis{A-I>1d9IFJZeqsf&^rnR5#PIlo@OQq&
zR0KVW!Q@`86WysrBgLWzCfuGHBkAf~3551Uj8-&^bMC-g5=+8_t1Qz8G*bhn`?zFa
zV76NBDe9+Q2Tm3V*;D6r`Ozk3=L87$atM0W)Coc|r{(~RCEAl=k4NGo!%Tzw#(5O!
zgp{x0dqSiVjnJvrn2&*_%S1{Wc!+CdX9`luCIxp@--g|n$9^Xqz{UkG3J})=l#T;-
z5<}Z4@!(WA1cTx)xcv_2?N9=N=rvWxIftCcWV_pWDyh|Yt++Z_*o0i1Jq%>?h!`b#
z-I?=^tT%k6E<G>P>)9ac_yfj0ZmIGm7T*~5cZ)VS6oCs~A~pf@rN1ZI-Bn3M<7iCD
z;}j<-yb8Y#=Z?rGx^u@@6=3bgW88ABo}n)BMvf<RyNh~`kh*UaMDhy^H$@+6_QMQg
zi<+_O<;u!Jta&=Q#F@t9Wo<m3^Qjvz7pa3y=CHq~>1{H1>r8-~9`k;DstwqD#mI6A
zgI>dZ;E`V4I`6O}yDe{R+nLFD5?4ivZlJy^&>6Onu?{{=*0%j2P&o7sk7FNpL+>}0
zZ=y6U1Y=Aufe<u)ObX$|SKWqN9eDEnV2DFrIq-t{n3xQXMv<rtctyW~5BM0cuOIiV
zVgt#3vww)L^zHh7`-jHQ-bT?w)OH-avH}ZJ&yO2Ndq0E3SMd1daig*8ZE<=#^v4a6
z1wc>`*NGyPavGX7#a-06JScifhyI}sO&Leg06GOqgDP?+QB{{KWf75^pvrj|0njc&
zUlfsSXCr?W-Hqh1#8?j{FTq1}L#Lwa9!6}y!)PSB-^}i^tcKJs@JGV?hJ17=@<E+`
zJfOiC_+1eF^g39Ge;r*Svn@m+X5JhV#`(PqAH=*fIp6Nd=0(AYP<r)Rnd`RkvN7N!
zZ$-Tsn2Nn@mU%e_M5x;F$&rsHflm6#kfLMEB0RWoDH&-5hl_=9(erW+JKhp;Hs!a+
zVbBeXLy__q7bjC<RcQTPNhnWxeq>pC!3U*HFf&kMbKRPgl|GNsl9@s5x^i>?71>jc
z?Gl2cGbM4v&wz_!352`n)6siAg1IPsba=SeuJ7#~?zH!t2kln#9}TaBh3HnlEzf(Q
zzSn$pfa%44528Mmgjy|^XUR23a5`x1bQKG2F;&N)pQr9mh?GwYgrHPst0PMFtXWcC
z|J!#@UGCm}YaSbI(OQH$D{S~QD?H~w4t4?Ej{qO&0<;84jDSf%7UkUL`s#}8&P}FT
zQU8%L(5*9oeF5h7#MjvG#!<q&S0WK#uw)d-E~y_T`kvpP=tC>vVj~vK;DSEaK@>XI
zDv8UOGT&Oc0Sz5F!Zu(u2Re)m9s;>wYESwojEO+H!s<2Th*U8~c8a9(h|+ykVwBSR
z>#%E2^I8}YneQinFt8_htK&^&iMo^pkm5x4B|ggN{b+h7-(Rt;of0+TfKq67ElEfv
zgyR`|=?}&2Qxg@c=6kwWMdA1^*ShL5y-z(A8G{aH+@v4HcQRuy_?euOOD#spIoo4R
z&EXDKh5ryi2%jm!!+Z&luM`{NN^$%;`kiFpg?nZ+41<W3`0_?>FGMY7^+I>t%&s_S
zHXk@BAz6fQ=j5k$wOZv@bSI37t7D)9V-WdzZQ{%lTkbvKP%>pBpqyc?U{c41d%@^z
za$a&}q;zL(a+1{uY1S7QE;0R1YJv)lFxHpieC<^p$&WluyojeG6%vFvOL&$i;<TjH
zsp_40tM>cgitzM@fCJ~Q%;ip*?DQ4C9NNNZPn3T?-uWU1DzR|6&VatcG!s+y0_J;)
z*utLXO!{!fX$$}cwgq=$3z*UWK5ev4*b&~&%MbH}l_$qs#9|ePX>&yj$@e$^Y8(4)
zRNJeJbkOc_Oy~k9^#b4=jcJpWH2DU>JC5PkGtSy9REDvBS#V#HpS|K&5e6&%04@+U
zK(GRL;DUY8G=Z0tZ16aHj)olcC_i^PGkoC(i}j!jN;u(g=J^sbUKZ}3PxCn<+|}km
z^Thj?urwv7&}jKCoY_}!T*qNW0zR_;-BACp|14_xuZ@o%3#Wk<eB1kteKZhr2AIO8
z89e0dE`{x1>|p|zU6G-%@#g%-C(Zo^nv1ddR&n!_*T;?eZo5@~*`THm=J$*a1u9UA
z-g#L3j{17Izh6JtZSSDV0lxBR#w(|LC(U+azj>nie_Srmk}!7%rxZE6kz#RR&kx~G
zILJbqvj~Rd?O$n%s1&x=(cSHMtG$l=0GA_?1XD5tyI~I)x;Hf$;ikl6sdN4#htg3y
zVgWh+fh7i90S3?^L)Uk5aq|s;VKDj%X;Ms#m7|>!-(dM>PfrZjkHiFjHgs}2G6^g2
zBXG&oxcCR&C7}#M;dRU*!fa_x?9Ps9q7PsESNk8W#z{I|ycP;b^I-RF?>4^KKCU0U
zLMQxG55H3#Z<MgT*i{#{x=}1;zB6g+e;))N%!>o{CMsP)#>;=l$TVn+wJ-k`8E4^k
zraMcOWdQD(hbZnT7}>lHsf2n<^dm0wYzcAJ?(B@Rl>pl0l^ww%DsdjC=5`WL2(*vc
zspvjj^e!%8JsCuafWoN~)k)cz$w%*ZH$Qd($^kbL_`|ul);a-dwV$aGMK3pZ6+ptC
z*3}Ax0^)$V)`G;8jn48wMg_D-(;*8&gP_lB`%9LK@NeRc1FTurx3+)=$lU|Hjzn{1
z9nhD^d5{pt&w-NEDM$fm7P2prn!p7muT!#ad($~uPb5z6pHC$K#%XfzckJTcJpG?_
zRu3>a+lE;SE32%m7$CE4EYi_l<EH|Jq16cPn&U=+;?Qaa*QvKf>wB5eJR<^;2Z&Zm
zJGxgb*@*#;<I`--LBTDOl6uuvaDpNGVj1?xROpp*ZW|RYW0%v8&$_eCk6|J%`?LC;
zFQ0a^wn<W3B%&D8URvm(O1?`9QpQNdo>Bs*Trf!z_M<rZaJ8VBJPSO}7y#sDx}c?R
zG^V5P>##THP&jib_`QJFB<_o{%<uu2)9B>zsD9jPsBC~FszsBi8x3^gmoX-m?-iaD
zYd~NUg%`pkfG9_@sgz|h#eEzQqrWg;Za$H+<rt}-DFyZ3w~USI1XUf6GB4ChCX!kP
z{_kW<x};P<%8ajExYSD`4@S0lY1L>mRRORot)jxct?)X<V-LO!F#8kMiwd=2X$B6!
zxV*GEETA@>7+ROvA5tq6C?)dR(|+PRrfLO6^k}UL@har8#?BrIc~eY>q%%+@RFRsw
zssah6L||wWv41I09Si1Fz50lZSK>!Py2tSvn}Ab1tjtS+_bJco4Bh$rR)^9$&05-i
zE(t35_>RXx6<O{x)~T#t98@ep+MMiaCLZfFVt7?b1^}`bRn#>^10|ZM&-nNZr?qWH
ztIiZl?kIJ>ea5_q^0dtCj7mJJ4body;hgy~*T^(Iy4;_MhO;dF)S6RqAk4(YB2`&{
zwrmEfuZq?IHGecQM6hXRjpw3fsk{4#1E$pRx--5sT3IDL-=-Z$$4R~-8GSnX3DP|~
zQjjG*lh$03FNU_a&OFZUrS`9U^)8ZMSDT-nWlALDp9?n{8Qvby;5fQ69xGgRsV{~g
z^doVPRFS6ID5~}P%@p$9R(B$8UR&vio*Hb?hB$Pp#7i850ntQZyVB%zD8bV6x|C+Q
zo)ZphLIElKr`zX_rv0XcH8o**@H}g^XF0{?tX5d%gOo|Np?nsj=~&O!>2TH6pc=4`
zZKp@#%B?sR<@HFwo^|r0SOLZi57IhingRT0v++zqWG%3L%4%FjYq)vI6(nW7kp0it
zFpvwzG<wobIg9w+?sUkt28GTp$|;a5L&n_Ty7=@uVJ|fa3=8cbITZK9BoKE)0jVya
zokDfnV<;M-Qd&D5HT(MHB0zyNd11hGh)SO%rI8nXc#smw>ype-*bhFAr>ZUaZRu{v
zWf!*As+QKqzxiG}p?E9INv4mks?=y#e!GlfU50q7L`|zhAR<1yTUvsv;<v4SXd<d{
zb+H{hRSpBgz)zT1AsURjbPs5%1N?K6@v+R>_Q+Xg%m~pQP5~9#lQaOid9sgBz31MM
z=o$A<Pa3SUZPxdi|7aXPRsFG}Tz)Tn;k@BwmMCpduTpOvHdyv-9bFRmE5_VW`j^%q
z2*xN=n*?*pU*j?tr>$B=Mi)=HIH}n%8Y)bk35ZwCz1hp2A*<p>A<mDn94lwTLHtue
zlX!2lH#|8d6ke4XIrPBlWR~El_+B?j9ZjT?XF`IxiXi!enswfMJLC?bWlFNbw}JrA
za7(o~iBuPq_d7w6gB(?2M;@KS5~w~}X5fD*OVNq(w$$^|ZX68k8P~Py#RjFh8bh0w
zWP3@&pP^)3;HvjJC3eMR=86fWi8-#K6pe%ucp~`|Es{sA+xWiel0CGQ#fx&Rq0Wlj
z`Fy$_;j$fJy2XjLVRA#PYBM-G*aI2ITywTnmwHd}i`iW;X@O-C@8{r)guR->W>bl5
z|B2#Esjb|8anQZ$D#Ih^xeBz<AR(`u*_0e8Bo;^Uf2%CfCgEhtljHKp+RiwN)HtR$
zN!3eG)qYRnbmYU(m+BR+Vn_P^m&Dn_D%mfLGi1`mEl8z6CAmd4v=UBn6N>{b$E5(B
zPZDzTQn;1aBunuR3`eS5#j8IKa7az+<qEgMIjAPFbzqe9sPQvRg^tWQs=J|92gg1T
zAox##Nncmr_In`^f2FASnC>lGb0F0K4JcXBpC+=}qYh*?%F^P+;nVCm_;lu2qEmWF
zZr;ZKC5M2L?$78PQ2&>fy;6P6jCgPw=Mehzyu>{{r&>eNTe;+v?qf?a$bLK2d;y9o
z9cx;u)kHbcN_u@>hJrdq#r@rv&ApSxF{XM#^-NY@GXvO9oz#O!M#ODDpC~!+CNsAQ
zj{N)GXrwY2mAO=D@FARF$^uCacg6Mrr6op3*tTR=Qp0EW3VTM6_$<by#-yk{H-|e3
zRnG5iJt)Fy=#KClt>QBgr$sL5*qCU^!e^beqa62ygJ(~>+cR&}OWI)L+$uS);Cx{<
zOyGlKP6s4HLawLq@v9$6S=ZdDpEPC}^Qq;*VY`0#a+VEWHIqJD%7jn!HQ<`&=;|7f
zyFD8oBqu8G{ywG52zqF*q2$Qq9!(5XbHoa#d%(HfqxccHk?!%@?|I^7SdxHZ$!-rV
zxWU@C1aFin^M%Q;ugbBiZ1WYxY^#cLJTG?eEhWsvVL~)wg<HTV%Y{<5f!un1c)GXS
zZZ%&W)c4Rep!u@d*d=#}5(Y|nzp!*W`LMRl6a3!$s$~7C=j+{d0DMT1`v_u6pRm(B
zNe@!?o_ICMof%UcA~RIy6cm#Vc0_RToRcSZ<Vm93Jz0FP+^03mLW#hFm_lh~4ERPs
z)6uaySc9ZQQhs8>cuIhNy!!$b35ZeXaU=QfDGw*Mh$D&<vy)bHK1FmC4Ts^tS5X^0
zcy&(nB3IX;@(X#FVxd)r-s3UypXn$WLz+Jp4h%<^X{fCLaawRV#w(7tQK?Xr@2f-~
zS}S(EfcQV+(cc_#92C}wW(U6s^k~8()t-hU#*HOxDVo*tR8E;oZAzKLM#Yw~k%Ao(
z^`c6aPU;fYlxhd}&J|f^h{EymkiH>hvu<S!d*NKKzU0Q|Vi-J3g@l3n&R(Llvg&ul
zD6T$%2>?;K+m$#Y<-EtCbMy}Iw5THFDjVFx9KH`{s+`L4E8T3OZWL!-0~~afAP8~O
z)HQ%zi9CICQNJ7u9Ze#NDEtf&#dM#;_Ho@<(X2acn$g{po=@dc#4X1pt?1vBvgL~;
zPR)Gw{f*+Q9ggzNll7r7`zo!@xh<V!b;BMyJ-OO}{%|7c?T~vN%Xi|gfOqlRbY}gr
znjH^!EL1Gmhs!2x_7BMGp<tqF@#wyCjP$TIiN;w7;1I$X(HrQ00#A+u__qLFc5|Ls
za}?rBnBTJ{S%qf7TDB3Tf_#liR?bMhYFL@M9i;dvm1pzj(f{kOz1LX0+r-2G+jeQv
zh)6sFBbf=w(Si6$I_1d3e;<rE;fUWQzi1+1%83s<3oclWgznCw7&;pAZS1p|iDgZ7
zp(^+FDT=xo)zZxYL(yV54<6;7AJSrx&=xHo4dRw@+?u*cPeb8oyo8Dg=|VZ*0t3J)
zRzdJX|AVX;a2XW}iMsj$BAf$cKzBtJ&b|hgnW}<4LF?yes(4P;1~GLvD+L&^2m%;O
z{>~+pi}Gp`B&npgzsr04Or_q{@az7^z)!7Imw|Etx#QcA93i`|b9~}IX|PIn)Nqv=
zWMC`)-%4@Hla4ybkZK26i_5B~_IH)T9Jmi1N@^01=54kb5*rrmIMqzgpHk;4Z$h{&
zdaLD;npRmyI8r8f0Xydxp{Q1gr^3ai`*_I{$!sP8Mq#_k!~ng=whNd|u?=t(IDV%^
z;ty*1RB;1%pWYNr5EyBt%1z~uU$ilN#iE{^`$~CNr1wKcOstvQ95E!u$cdc&JjC``
z;$=nt2}jyem6*eBhwyUftJ<Zp3d@jwa+!*(z>|*Vz)%j56-Wk^$c~B%U!-@*r?f=P
zzIsj`1ZB$&hKj5`r#wz;+a~DIU<*Den;&I3)AFN{h-G+>M@gkKKesMw6Hsbmk(F~y
zDuh=B_n5%{90i;XJI9bo^wFAfT@m)+NeAw-a4R`~xWvpLyii^~%Jpr2>@bt&t4oYQ
zInf2y%-Sftk%c@}7%J|bhm(MPQZ9k)6VW0SejhD(IO4=SU|J@eh2$Qou<(2ta-cSh
zfnmce@jGMD#*Tpqv769kRFODMFZkf2qlM>tTQY+5E>hS7HLi5XPRYKvnQ5(mlBOyE
z^u)3~2<i1W8@WktC&AOfNZS%5rc;M{2b^Ka08l`$zX^d4*`vz$&Y}n|#a`fBV`dOS
z`^)@F)BF`*-*E3YeVhtBRC6vB=#SY3^!eUU1^NW%=bY9~>Zm?-J?#2;7CYYeUT1Ba
zFklV85ixn<Z9KhWRM8(8=GxS&CPsa1KX+$rjiKLyfo26_n-kC5FDrg#b#V8t`D1<4
z8q_pdf9`FXo(OQVoNr94vZKLJ4emd;`dQ0=(R3}K)2+4@1j_)-4FFySpo)4akg{MY
z)-O&Di21%;FLw>$XN3Uf3jl{I1h5K?PeDe%s5`g&qMytgh)9Zum5}+>PT9L}-m##g
z7XRElbsiGPP~T+#C^thETXX1r$AP9w9yYlEZuL3#B^2?#3w&#<t<}kK;@3Y9cVMTZ
zxAdl|82Qh`H7GnAdBJczx#HNceyX|$s&uN}ukh?wzL3cKg42xA3#4ZwuVW4?>q|Oe
z%DtxSzuvD^a?1QwY1zfk3%Vh~*a^D6MQT-ySD&4D$X|7YR(PpCr6}zo+P^6cfve*F
z!7i4gGlXKVRJ@JT0QEG_ONl5{`L?{}I}{!3S|(BrQQyAy@KhJGuM>mt>oPcA83-sF
zOq}^6(~LHSo^A0ncUJ7p^L`XvN^wOAZPS{m2EJdQ_%ePgnja?B7W~JMb~PWxhot9C
zFtE2p%=+CRMW?<hK{sTV2vWv~H^<GBM%nx0506^VCKw_t=Pw0Y6<rLw*F7)UYaru}
z-TH^d&s4T%uh}|zqPxYFJ{JY-e^0~id(^ib5+0W<QuR;us1-~O*_2X(SAp1&jK|5N
z@Oc|#<@WF4n7&gXotcVo`%QE-#dL7(UNEN0F`DYZ?8HJ_xGIe3$zK(!{r<rd%C2jX
zu3y(%uk*XcEKk?#ljG6yd*zU}nf;2H?MWe4FxjW3oqDgwIM?e`=wHNn7*M)4$ObbY
zoX1~_)tRimEI`S_AJo-wl2*k?)CS07gXmI12eQ=N()^_|;Bd)g@v@e3$*EG?im=7O
zkW~as%PBny98e+5v6VYgs?(VO337_Vgf3@iad2jQdy(|r(e-|bH$JCClS##<r#<Ls
z5?Hl1cV9RpS1d7<-Gu}UP5Q}TLFS)`YDJl{wrCsl<1^~lKSP1Gb0sDB^lB1j%B6^3
z91tccr&5|*KUK9jmocx|fyEbA<S_;6&;=wQMco$-Dl4`Hpbe)yn@f&&0}NSg_K6_p
zs>UsLemPo+d_T+4f|wh|GX|!G1KI)E=z?Hgb_r?3(W4G6#V}H$ovJf<ABhSc4$0^d
zl}Yw^njrxcg4%FiO}GkJ3rOVb_x_Q35$zI-j7Mb4dhZ;F)xvXS@?=k!h|-LAHAyn>
zY&h&EZm2x7`SV_9moO+pqAbeikSHV2Sv07of?I<@5?H;vnDFtlu&roU3A=1C)oyJQ
z<tm}99VYvdvOep!luQcM2|^-4{(Xi=6OCotCL3TJD6O-t?#s4RPO7MgEU`C25B1RM
zv^yD+$t3`K6J_Ojxr&}4MBgw75Buv~LHFdXG<r{-KO8?rsvqPwxm3$k=d?^`aKsQM
zxa8xI)al{G(CXxB*og*0MtGiT4dezv-qfTqLT?h~B9D0!IN|qa5CxD}=-eNUzEr_k
z$K5hfKAOZwMw5!V+bDWJ9g6{4rKYuP>f~`jc}<+4Mw9oAF9YR2%cH2r)qJ|0<+vS3
zQx2Nq{%{F|ayG?wuW*SCSXHlNu5#qaG0EUWt|t}kqJ*{{Uha4|RYVzvL71vH_D$8!
zNcbM7DCb(M7A|VO8J#O77u7kE0Q~!9IO>&zedHH>OxB`yNvH?iBIiMQCZpu+q;wAm
z@S{H{od=8XIxM(aQju~PHgV6!)mw2w73Y#?mpMKOl)&E7yTQ?C8<6(iF%bqvZN@-g
z|GXoW7bqIlk@*qlLgiaCOQ)?P;FOY~tDJfTzu!>G{(B~VvWM}sS5!mSW2DoSv)M5k
zeapzk!qs~i4eZ71EJN<H3>!cbVHZr756I+wDXXo%#)KK0V27}=9sP;k*XZD$_+1@D
zpeH9dsMpXAM{TQdc0P)K)X4)96*nS$BhkmbsgM3#w7B)gPmLY)vV)lu<&~pse9;Ab
z)Xtim%nfD~pwb7}CF>U$GdnrPA04-*JnKal(5Ij)9HpXF#W3y#mDZN^sM!TWEaGI6
z33A0tw8#@5X%?ozi5aI9<_2o+I88y{N*5V~we7H1xyy-)>1m~AWXz-E!=w5uEXiI!
zeEEm@3q2_1B$G6thiO0uRDdwGIa;HwtQ+ba3sRTRC`X|bK;QiydHSOuV~0Jk8=Lqu
zQk`omMW9c+w(aI7+|sB=QMcsmH$-YWp&L3oF=i`5lj@lV(fgqX>u^k_9qqQjA<O1t
zDtmYD8Z|5L7OtVK*H9fzhtW7;C5B<jkUWyh@^9=-_nY@@=KIj%{(YNgWP(f?(!5n@
z4Bgz#?*QI@``f#x&YPs|;al}N$O2>F_35uvD}V|A?kd9Zqx&z>>)m0mLSHbFk-t$+
z4)v{Dk&es=A1w~mWO^g>aQ;fHcgc8XIEZl^T!hgSlaw;5gd-hFj>=;8t5YY~js`8<
zH%0p0#B=rp-cZd2boORy<+QALz|h~rvjIdW>|uxD#2M9IH0l^iceCS_U7j6b<6J8&
z)#ESZ+@~*Jyl$*K;nv+~#jDJ^0hhT**~5&;O2%!@Jj>XW%_BrJ*4n3XIokNnCg1#K
zY2|-z8cElRz<a(Iot5_X+HdN|2UtDLLGl%3REJ@Lhy(lx$KGO%AEr6qBu~5*_XXG8
zVm!FQ;`X$^CD+{2IypK#XzaGJOx@4zy~aT~-4$_{{)7@sNxU!f{My&n9;_8iXgrl!
zvy|zNvgcM;+!Z>`;TFUA(cP6Ia%g40E0cj-!mTZisqARN*z-t7<%T24l_Np+?qfJO
z%5jcPm*R@Z(amJtcY-(B#UvApvKuC2f@NINoL!Flf|K56wTl!rKQUsL$Q@NArzDrC
z;?AbtffEIgNSWGH&PBOwp+S|w`$x82&UN!tza>}*L~5+|&^(k?!bABD+8}Kp5>w$t
zt>Q9>MDxGhvaR&A$;4f$!y;s_IpSg+NM93H?<WcQpmwH%_b)j8#}uC>y=32i9~?)~
z5F_+dZXMb`r4R(+5JVbI8d6d2WSS{vZ!jNlMP>P?LZ4bLOm#r%S?ufs`o5Q{T2}g&
z4o95ZT?yC#7*yxWyMTA27|uDa7vlsIi@D&;rb<?aj#W?6zewxT5$EEiKut+|9bnAj
z9=V63bA=8816aWgc8MPQ=iylOCzlqX7RS6vEClzdIGszMglvpa!OIM`$<(#uj@0>z
zgA{uQd)OHSLt}J{uUPZm7<D5QNja?=Unr_Kju0m)o;=wl-;N2m<oTH#sFvgrYWCeN
z0jKXr%^iiz9fiOh37WzmE+d2)8!^98kM+ltDL{l71=uKhZ{Vr`%J^i=51v#dq)Ho!
zV*mSmcd!ltPd{v0&AG>kPV!ND8@^lH*6(b4HJ5Dy5Dj?;8NAwO+q|B-@LjEg(sXdD
z6b|D+0#vcINq9++mZVPzmnaMBJt0>2Om_l@kxv02ioRCtf-gFTpTMHXt}>CXNS|x|
zI9%cAXe*fu2Q$X1tfOEYvrCrel)VsLBGAWl<sX8c&i9y@#PO8Pe0>1uz780V*-A#D
ziIY>WZ4@>k=~4=pFgd5Px`-qd8$~QRRB0w~J!cYlZ1Y?c(#(26-;|PM@dNj$8=Z~N
zqd}c9-!655Afu(Ou&^R>2*S+1(3=UyXCKMpk6DFA98=1a@G6+dwS_PI82Z4psG?eK
zjyGh`MeCo+mRCt<Zf4T<NjK!pU5|@hbVeaQ^GZ!854LYLDVP<cq2VOAK8gd(L&eWZ
z45*5?Uze_5oW6Y7I4+x+SV^!^(6X~(=U>XSHP&^^x*Myo8!HmTH$n-<j$8G98xvwq
z0DIUISTsLC)%9f;QQ@f}u2xZC5TVwre&{|`O3?M$oB=-6t}(bm;3lU-N<8yfj16CZ
z?d>SS#4&|p%*zB#sN_A`z6y|p8*AwDnu($qFO3VL6wf@LOvcHR^>sQ+)i7G0MB}iV
zs4ALkaE9XOGet~@cj_n_t^FRvk;5y<%q6sx6KZt_s1DM10Tq%$n(UD2ife|}#EB_d
zM9Icf#sousmC*%hvouobIw|`~Ds-M^j@=V*GM}W)5J3f_X3HSy16@W(;thp%Z&?3a
zMB^P+lU?fhD99w?S`z1@M5+2h1~%OdY*BJA!Gim*VlEMxL#pHn+VvAtNKS1E-4PrN
zF|mp>&%7nd+QLFicq$x(9RSp#IW$C8NU;V2f_{WSx;U<!2j#t_IG)9BE85Fd%>dai
zX&QypuZC1)fp(jw-A6ScG%7w(^HvVToq$smarQhyW`xQm2RlUMz9hy4+F0sIvmjaa
zLoqO#vl4@j@us)sQ(co7Ib_Zq_aT+kLq$XA<rO9qf;qVU081W-KmPE(qF1cD$mqOP
zx0qo2ndLJqmsFNBP<pX!c?a|$B>xn&boLScmTDDR>RSN~=k&K7r9%xdSyON+4xze<
zcVFJ8KeoMZYu{~p-}66Dte%W^r|7n>sO~kNEu<#l1--SWdH?=9m<0ePZQ_F6)}h04
z5mDSQG3UM#0G-5++Ag57Xebk>rU?AAoioqKYnr2-I5GgGBI<h*CknG#Bi|Kq0+b#p
zv#U;vuTrPUsFd&lqg7cfDM?g}#y3i$HpR?UziB@bdY}8&8Z|7tyE=*92P6Cu{z`z?
zo(zIfDX9QB=u5e>;;mF_mAllVYyb&*mI_=7zNB>BJT2s)cnn9K%?7ARj6z#?I4(^p
zE94lo0@Oz{f;;=W>@Q>9BQJ@ZmoW(g9_`HgsO>sD*!y{Y7k+OTjxz7pclVnI^Iz@-
zqpP(j8fM<#Z5;f3c(}h{51iyI)5*bMYv;Imbh5xA2IQj_Q5E$}KYNGu-R8lo`Q41C
zon+d{ynl51qILRWf!zQs&4I;n{a|+yQ1Bv>i9g8VL+hlzw*WqjqP1ZJ(m@nwd-$Pw
z)ZRY?f#vXcp^l`;d45N&y~8(qhYNrd>;GlCcv){Pu&FQy%t(-f7FdJj_52Qo{?(ec
zz-PMIum5b4zs&E<W}Px!@tyXnae`OcLMxN}T}55N8h7?iTPKb5URfSo9~C)6eKrv>
zpy4H^Iu)C6;S7F5W|MzZ-0E75vo)iFl-?p{LzJYLFju)Tm~tolqDrOYBur8X&$LS1
zx)<1hp#%We+$q&)t+aDlADesl%RR$fI+;u4P3j~XVQP?U+Va_cH<oj{b@x%d7cz%)
z{?N`exx$OfS9h71%Vhs9QFS=>5ptHNPTIY`z`NgpoKqQE3yd~rteo0KG_V+Xx0be2
zo3T*AIqr1jahq{H9PI(^bke@>=nb()j;0e;IYIhPjhJ>j5<fB9i&b+Gs;P<yaF}_U
ziKokb|4R6m_OYcbnx93%PQB)oU68V$4Dw_;2JT7H=Q_1JGrm@OAvRCr-Gd`e-|nd*
z$+RAoSV@6P3&Z4AMgh&D4rJUxG0pdO6k~=AIZX?*c#{r2K{k<Hs6jMRqEMfsbCpQJ
zT!p8v=W2Goz-uWG!~d-cAF{gogaB^u6B;Ron3zi33sn)iQpo9($qxe0h%FXbAM%k2
zC*`UhOS3IBoIRF0s5A(@NK807Z?H=eO*1iFG5eA?Z9KXlQR8!wZH?yGE8)aB+fu=-
z9dDW#GdN<_37vas;wSGDYe^c^nI+*!r~>nQJyi}!1%+!Afc-C+2J{=6BaSJjF?W%a
zk&Q+@5&7JC2tUP8*(Hsd%7g1zEy-z#8`~gtm?`X}o_(3a867VyPhR09ZUyVX51Bx;
zx*n+nk$LpL!niACA5e%kqbChLULPOdcsjBR$%72r?9(X8G%f-&ftmoN>m%baF+dU4
zP!P@DUwDGLdRAXh8HbT~H0`XnrX9ktQ82K8D?DOOKZqyfZv-ce5+hA;yT?FqDd80-
z5i=Eyb5EINRvAx?b&w;zbc{e|ubJn>Ii(Mf3snp_9{3l5*jNZ)g#abI@ThA^>$j@`
z4EHW3bYO_11W0~qg<VZ_m25L}i`B)6bKk}z#uiuc#^k0|N>sttj(*W__N$m@59DGD
z(-4I8hmqX18oJJ;6x(bj1%G7@9&Hr2{M>UQ4qOpPXM-uhxTt)>iH_YnBV|EcFcsMO
zk#|^viI)z5dF3d{19g4d<*~c$SHlFfpf~N;NzARIhOoRX5@2-vP6!<CRY5;tl1u|b
zI#dN;4FsEe&)~VzZ>nlYN^eF=N4$?_Af^R!PiI5ms->qo?ExL#^<)x_$qZQ7oeG{D
zMboo$ZQ^!02QRrAP5ciI&M9Fcy)u<BB{Jz+O-`j9eyM0OqC-|(T%xlgkkOhT9Zu97
zD~bWh`v_A~;h;~IoKDoaDIK;_9p`;m^9x7(EcS;cwFL*^adk)vGa&U6AXZU7oHh~O
zN+f}l0wYPAnlf7l7LBEt%VJ8QTt1fGU9*$r>Ea?qLmm(wljEqB@R<r~>BFd!+$TX1
zBSpNaHLO+kS1-erc^M(BmEa}A36LhP!!R&N{eIZ3&|Nd*lAN3qZieVD$Q~KYYU-NV
zI2CP3arKV5thybt!QmP?<x0B49!d*tYsGLgQ%|OL9UY7&cl`$<4jem6Q|RagRX^VM
zMXE;9HLjLb!!l=)puRw~mVTatKs`Hd0UMW;GCWt<M;Be?;wgu^9ng{KEgD%oyJi|T
znPDV18dAyq#~M-)PfOx+=W5SGmozDn8AW9`*#pJcC_Iq9%Xx`(M4h4AWFp53LTB~7
zRQ?Gyr<E}-Zl!`8Yxi879CSq^b?S8Ccst&~UK)ip8OIK`*1$Q!B<uDGM(UVQ>R0Xt
zJqO8!E0|mc!AOVP=&-N~Q5VevSyFLC^1bSanQj?ctb~-3j2^32CTi_6(1v%{S&;*@
z?%5s>_uQ%(+!e~BR4^-*rBn00gfy<D2;U@Ei*!zn?zpTx4YX^7vd%b;65?op&-l!n
z-xU_;bgv%SgQ(xwU6eb-Z+R^c2<YB1!yPm4H9rn1aB{7d_f*jr(eGI&KCiXCALy$>
zPhKh8P}I%(t&DRA6*7q9%GbPRLLV_C)-P-%bd%$5@mpS_Vc3nMBtTizGP1aB$fLLD
zVI2HM{>tr{tuS##whcypVYs{^naVE=s0gJ`6CzTv`zq(YiWQ35%e?PSFGQ@Y@9Y^L
zr{=DqVdS*4YwWMkFs)O~4^+E3M-A~s5uK@1@l#0xTr!9_;m_bCqKwF`V8WBAPvCOx
z6d04UTtP@quCZwF#^FU^2XRW7F?K1U2!%4`IR@ZzXy>mMsrl8SS}FReT>tzL%K;-R
zK31hf&qPfoR=k?!wnT#N?4occ(%PDyxfX51x2BnC+Q$#dj!U$rd2)FR17qE&svW9s
zo+Du0pBcdLgul2CDO0jU)AM~>O7)7E-np971h2(eEmZx5S#81*kpx2#tOuCZJNrN-
zmd|;kAGN!k?1Ns=kNq>}k-b~bJ++x1i(H|sE8Ag_@R%*?k;IsD0I$D*S4-&wqRs;H
zZah>j`=%(LMCbOL=v+bUig~}R8A4*pG7p4!^)$|=fI$3$R5&|5X#T{61_M*V0c<MY
z8njN6za3V)Z#^Yv!<3)ZFu{IGI$~qr2a#0DP7>pWqd3N<si@XTM?u;6xef7HT}r8>
z+@6AgKgQPVG!{w~L>A;#6*^TqXP-$X7KUq}V}<e8qP@kK8l~*<hnDgmm0!sA5$+B#
z9s#xX<hD;1qvBzxRK560&YR60rbAQ>P|5+qHV2rgeKb*90Y~h@A0)b3rl~(?m7Y_z
zzXK5edb8~#7ShgMgGCRs<*H@BWiR-JyQNNdZ983=uk4~?{yn-Jf&_9S3j8#N%s>x5
z%8O+5%0QD`vt}45F&}`z*h{V|p@IkpS2`0zi8Q1kpP-qb=Lqj;qU?v|MK-PB3h;$n
zw!Y3WxdB_7*)p(!Ka5mFE#8$Tb;iu88dtL1y<bQ;Ouebl8uR7JW}YVbsI>rQ0XriM
zKJ5dif*!N7G7PAuvo--@tv70`jELFNCaw1C`oS*z**wGr93HpONawxcoYjM?is3$-
z5cv)(wRBSLio#_v=QEzG9H(4~hUh_`L_A-WW!5>8&N=ULMP<-7HW6`5B+~$PhFYXG
zz>D`VtAxx(T1yDMi}s?bY^EyN32P>iMRL6}n}-dW2uF+J%wRGSzvDQUni8&v%`xTc
z73I2$rlloSETaIxe>%SO$!to==FxJ=rZ=OOG}(y9XmBC5ok_bViLB`50jt66w8VuQ
zJF8|5ZLunln63j<DszUs4F9asx)nNOs**n{QAA#Oo#(2R#%HegW3(KSC~GJ)VmlK?
z@WRTG_Z<gZl%*6_gQ^`u{HA`g^ZJfxE+qJYoDaHw7ghdc$G1U++vKDzmRyb542^i%
zVu1|U`RNF;PhH`>rX_cQ>?$49(V%gga82&w49H>XhG1rQY*Cj4SeC=OWjeB=Q!CbY
zm3Ar1h<za`vaU8sS)zff@y|GD!Ab`D8Kg*9O@mDce(@Y~Q>LYSW`sPFj>HKw^Rsp#
zoyJti&4`P~l2Jc33pF%(^9${(%$h5g6PDT+4(^jz*B$NCPpqO;b2i#T<tHLF=7E{$
zy0%Z9)4PefM<)Lq4NC+)7=(NiNOW_+t|pE*mUge#@hVn&P@8(|YBj`pZn_WM@;B6C
zE89X8?&UlAaWcp=1MhFKZ0x;01HNh#gqhQ^M1v?A3z-{Y3GLAoZhTD3V3Bh>&$r_V
zU;qEv`}c-6t}I^w{okLW!kjh|5%|$PeP(c+Tp47C2?h?}JUWvDg;YSrl1i<Tj7i7y
zS?*`KpX~1S+-vWul7wTs(|wwmjzOy0&$ZWH&)-t;fQ8UJKKQ*RzpMM|^ziIu@8#j~
z4{}hug8_%paRRZqkm~W=D`@I|m>%E&%v_DP1l9ko)HqlneBVr<T@BL5SJTm7=h-|v
zBV=T@_sWM(lMDi<qwkW93hH&`kuQ=*e{NUbeCj@aQrj@tPo#>4{k+506n3BR{-T!L
z-l&Y)#$Vbmf2>UUr!5R_dy32aWTh7-h-u~iTYVg#`26!ws~HQiK&}r$|Fg;o1fb+Y
zvsC{Dl^)aM1c&3206Q>*#hsry(is^qZjtG&hD6DO0ii7I&!`nbqO`-JbBdZwQ4E)Z
zQF>wqF7e68S;68py8uk{)h&6{e(=~N2}D>q^@#%dBnn0NF#h(1qk8<UilOs>(*EQH
zhFB#OQv8rZ1sK%@ee(8aLtcHvuVQvK0I}oef{oPrCBNGI1?opbzA}nxHi=x;1M=Nl
z)F39~d{uYoH(g(w$<N?2{rO4QM0B8k%;m7qX|ZTUbw?SV$FqWmCCpy`+tN4rSO(QQ
zU!FZb?)7$g%cF%qL8MW-5%H8U1g*yKf+IyfG{v@^LV2Uu4dG_YuK8R#@pYVmnwCy;
zI&?RgCdxj*gNgZ%aA(CkAxoKKfOow9;F7K`M$LjGPnR&J%|{U|6a2iZT`G4t=PZWU
zcp#dpM76jXW;rUYgy;)T%!*0fI>|~yj1a{exkJFLZdSJ*)xmF8#~vb)`Wc14y|d!=
zLvP;XOPQfTMf`HRgq_yi!i%c&eTYjJydZ8=lp$>%Bc)x#0~s2?vRoT;ua4`Rj3LSj
zxfvi}q%7vseugLx@Ez4)0ya^(aiksEbu7v?ea+@IC**+;%lDP{9Gi(hP5x)0z=X>M
zY_=gcE2e-7`_(HVru?6gt$3<nh~fAdi#LpekD<dIJ2^Q$-aB})4f)Q~<Lq(=?g6SB
zW%D?i-iG9qAGWKdBUf(Vn;yNca{0<{?(XfJZU@y4!MNX9`F*I^wp~;5u(=g`+U_7X
z!{Y{Ri}$Bp6`f+-g;-#G*dT2sCPn+h>9VXxpM=UA;0k{nojIt=A|^Q7c~p9dzZ0Dq
zk133-QoPLSY+{9}s$-yNdOM)VklYDaak!o=AdD1~ThTnv-PW9QX(Su{?Bv&TM?~ja
z$w6V_Q%G(kAbIv?a889HL}=fdW=}XNR8$-Cq$eDrFTrwd_EP-_oHjQMqDv#j!RSI#
zY`%qGDcx)`U&GEq_H>kC;z~hFRoxYtEN6hHZ_<27K}aHT$S(1Fv{~2^HZf2!9yx4{
z0ZJqEcng=h;%$XMqrTNNUD)yniXw!S1HA^tBA|D8hdL{CU&~QDMQHXa<b*DzbFLSV
zOx$O)%Y>pJxbUcroL+hwRyztvAn$t`e7YMrb!n(Gi=5~_b^_uXnoFx~TVuix={url
z5jk%OKBNY;As~)+GAR0UQ}_W5eNzf1S&_nyXsAo+42ukJZEabvHfL)iAiW~M`hvqx
z<Zt8@t#sn_pOIuh^1EiWO8mM*m5TYzY&>Y;-^+=b$(gbDfh3diLlAY9s<pgiWn(<C
zL3)&gK`TEJjwvLs9`<_}-8jpxkR_4I2aGFyjdgJZpAJo+?p7LN4FOABO$Wo*`df51
z&?QDSfZ-HipR3t&f2TwZfx`Q4UEzQAr0s(nhC?+D0-?L5{&D~C;02HX)-q!q%d=RB
zei=Tdg>JdW#ZcvbZFgL2q4_`J=g>L4Lmc<rhohxIF~87+(%(4&t-gu7IIH?Cq!}lJ
z%Jw~a{2z6jHfY+j!QW}i<mA&t{&k#}9_K~WfM=OWVmKhn<MrH4^U`Uy<H7K@LM8ya
zh9`aZ@YOTWWWMempVXfAM#>ouJS1)_=q>pw+22JT^7X5i-GgLX{sdhq4v_go1UE+e
zLbO}d#J`AdA@MC2#%tO!)u9^%m%)4zh~iW=`Xh?rhBlZ7QBk5~Z+Ee}8SH($<iADZ
zj5Zx&g3lW_eG5Y}KH;XjrP<qEecSQzWWxtXmhu_>f+6XD%OOM`Ql#9!W%k#1l@y>R
z*)|x|eQ9!aimA7Sb&@8ULA?01UTF)f+C!L#1sV=&k79y=`s%q8&;~<Cxk0JIs+uKb
z({j#D1bTt#*A$A<%v?|y@>EAvnJhjp4?qGAmB_m%-6O8ZiI#Bk#j&*(>ox=S1HEkh
z!5*Jk=5iVIlX^{(A>NS01CA&4eyEg%Uxj;;{{x$xasg;u0qR~AQ|b$gYryj)|7jr^
zHeX=Ofz)fgrCi<i7F)k6qg3OG=Js<za~vaeB7r_?%r1-ALUT#<6dGrwZHVQXcF6HB
zr~qo!!7wqNie0iG0>H4LRl|J@iw+FJD=}hndp5ITYJ`qb?+w6=i}gOBWj5U7#LWf*
zc*#1Jzsjd#WE)$=3TdqIBDV09=wQD!K4s}=%jBm8<}Z8@_bH%ZIrqT@uNia;f<DmW
zO5q!hTP(UlXl5;61K!v62_i1kx}vGPfjO|sG~l#!<dkCcw}uo4K{X!415?Lm(|KmX
zYkqK@ASlENAudvi_lJs|vWEFlUEZRMzoXD}dP{;!hY;Vlff1P-LC^{33Co;YCS0a5
zj;fv5T9+e@Tj4psD(BJa5|*W>E?-GS7)LMzwr&*A!W59y8An7iemXX&hj^L}kj^~Z
z7Vr-4m8m0Yax3Aj>OKGl0tqz5<z>epT#VU#4&2Y5B%p02LrS;TrAdS9LIdsr8&W5z
z&)}F~lS)%$MFWH4P>l}5OpJ@9dJytbkZue%`6_p0%@q^y%V4_i!7+t3a?Mag3cVY5
zjBxn(#{DTr;CY7Qoe9W6kgCS&k?*I7cOpL<#4qUDwy`gIdkbE?oGsia0e$k#pfu1Q
zra3Hn^4;|<mkxu+JJ!O2{pB+7AgW-49kfydV9dl;vcF)M#Vj`rxAX1b=6dM@qst9Y
zFn55Y#ZLh`#54=0gkjQOCC{`pI@hNJum8Bz%xkk~(sHF0AihTsDWl79Rj@4dnClr1
zrUjNN!)qNrdlbwlJQS5X(F6W7$}TX7$RAD(4P(8S)~^dO^8>0TLV1S}{T>!x7}s9-
zTsvXoUX1X@h!a$M(a$`r+G82W);)G?0Wh>62=z0~JIC;fn}Tp!(ply7DwlEXU=j<&
ztzxi6S}y1owI|5UwP+>j*fj#G)|AqRHj;Y{QDdn>{Drc`3D*wMoPDT>F>tLg+$;w1
zLgA1Z3oWQ@E)`N(EWEc72+B(Ydkjs_OT1zgfnHeLJpt}s{Jus4OX3%YzF>m?0^!8<
z79U*DF)<)$rVATY`$Y9K12m7E*jqYo)L)Igp$*F`!8vYD=&}^9kBR~YG?jsic0P8u
z@(}*KS7+$KU5CXRym5EATM!@*@oPoHCMbrPYiEQ3ZS427_fDKHQhWRgD%Y{$%?mXK
zC|tSszS!>7sr8sD@O3d9{I*NZ{b}m5xa*F5Ox@GHowMWK^PR(22dDNbt2gUeoMh<N
zvYdMh7*a(8v3I6rg-3I}IBNnsE%}R2eD-$h-v96ao0$K{9iYutkWIWur<m_e8{wVh
zZc#V}6WCRyE%)kULdoDlLj$a;?yKYQ%d;CO{)_;WtesSvk{asOdEqO1al|iH8sfVg
zPCUXW6-FDF<^Vr_*&swzno^;{4yPqJ_>qLw{;Kjm!vGC1_v(hBu0RvtUOI~~;GODd
z#LqZ7cm(m3HP+>1ZI+d@wNCP<`u85wd*<i}$v&!iA=JHBeduxZp(-(68c87-5Rw#H
zBjU|6_RUIr(Pnix<3cnKAW`DBDdmi!NKdv74v((T<v3Zdo7%cBhvoW|F|(lwZ@iUS
zax1yMoTg6-N_#8QOS-qcR9ZP~m6tKnVlc4dBv30Q>GaA`@$yleqIf;Z+3f1?4}mPZ
z+r3e@Kz@u{hVyxuZdEI}<-LYumk?w~2Adc88_aVPJ2=@ui4k<7`zQd_r{`IQl3Y9T
zw}z&a$lxwgmwBAcZB+SN>r<h?gZZJT2N9)m0uo6Gk{F2Mu8rY<)Hn+Im`$P1<099E
z1{H0Xs3N`%Mdb^EEloe!bUG>lNn#Dd3r$G_%&Qh$CtnV;y%uJbV3!-@eJiN|0JT{K
zpQ6w0W>y*)lvqIkZt=-1N+Fg{KTbg5*X}0GKwx~64b>(x$tc_T!v+>=Tp<8%PXiU2
zO%p!kfkRC?T7ECbnrY`7!{PZBndYjw?}y(Y*eGSwZ$+kU)WZofdCF*ch?<P4r+9JX
z{h1j-3sUF-Jh|jd;s?m*+o6x5cYMq?{5k**BG%JF13ea#v+sPvhkSS{a1TBn4wXte
zG1Wk1NAgv?BBuV|U4AM_@$Z)G9XYnE8#Y*Rzd&tiLRyz7H?ly@WY;Q%NEE+ZhC{}H
zx-DTx{o)PbMmE%2293B4fimk)p#}@J0&=tWkH*0oEqUQ-vg4*)w?%hfZ4*mSb4Grr
zYi<H0RyYW<_`~|umjf|abReRw;Fmwd29)BJt}cJR^732o@`d}rJZ8mxC_|6A)Y{tH
zEt9p+*AgyOu(r8IwV(*DnE(T#9aCTK;{Cd-kNJtcs@*3?z>-}r*qC=4`y=BoadJ)5
z{^L_yqw-1cZJGVme(nCO+{kgpJKoHMCS28#>!BlsK1LICz}ys(OQgf^!$+HsI>|#g
zYmdMh&)5fOAf{OGFOrLn`^U`||NSz#@P5ve3v6NKJBVrrYZm?s$>=xebiK&ODU=8v
z78fO&9>8%4mfVcX+q%ooHS++$l^MTnHiMYh>M7+JwQ9CHt+hm4L>Cng_QXVul&!RL
z(XK&xYO%b1>yaYzv5vaUfaK(76!rR2ykW|rlKHs2hV`-ONfen8UCTAYC+V(>cE?xT
zPSqB(lG)|6r%8}Fw?YMWMt0-fAjcUhcYq|fIT>Q@29@ujn1ae?aRGETImJGSL4*{w
zl^jthfY0Sb{XS|90SAxv++e`|#zkGmAXcqa1zeva^DbN(r9ZYv^$vCpp{UYX@8vV6
z=S0pGs&jYE)s)xVFki2cKI~n}KF>Z87#C|`V$*k>-!B_oWP^cs{IQ)zGFgm@CijQp
zpxH~Ma><zGh~^wl`MCRCz-X2)(q3q@tG|w@P6h{NgBv})(F3$#R`43!vhcrF3!y<H
z?c)v;YEV!~Ri?petsD;X<y4!}L=tS-j0TD7LVv1A@IK)Ot;i)>U1BI+);Ym9dc{P)
zptKI&v^BML{4o>DfI2uUEHf}A-@$+zW-mZEWlfgMtAkf3z1^0tLyO97vVd)ccG*A|
zUUa2}^x@7}K=nS@bHO$GkrLi8fl>0@>Ht2p5H4^nCkqWkm4}2;0U%bab!g#bVE|mp
zh1hfuB_s|Q0_W5S!*zOLJ&I$Ya#ucewzeQDv=Nsa-P+o6y&>cuhj(B)i#%diKJcx%
z<pIz@uVp%#8{KL#uaA)%cmgLo9Www}dQq@te>`_=7V8%I3I|tcs0x9g5m}|5Yt4ob
z44g}yV%sAKth~y$8pLVY(O!KOSE$+q7xN$6bxZf%)Gb#R@R;R*`Lk`lTabM1t|nZ6
z#2<T(*;WAnld{sa8)&a~eSm7$|4^>WBCMH+ZGvD8V4R>N)sGK<s<9N+pGS+TNq|~{
z69d_j=mT&Q*f=-mfz5g|*HuRK2`aS+(0+Sv26o<2W^B6RXhuL!61h#YC>hrB+9o<?
zio-U$MhhYsjKzgklAA}Bp=6L#tvT=;7f#3VMHK*JLdqH2lDOC$!CM;WFMfvuj;ZH1
z#Rsw*9iF-%%)w|CEeN~<z}F1EgHT~<atTp%c6FSrgNuolcn01Kutk}ZZ6*5@faqa-
zs1=led2pN|s%;G9ZPYYC+r!JsC%Y2dO2i&(-R`DGu>=DwC~@0DfbRt-01e9$9*x_^
zdp2=W-guV#KFP_%7=ko80J4}0A3#pQA(*J%)-0|HgIpL&O5JOGC@&ATWw(!udwU8~
z^(m$(j<f^WU`)$tyWv_#xc7hpS!yU1fh%#RtZux>W_aibzH%A3!$N3>)32dw>)A>7
zc`s0t<vpJG84Vx=JQ0np`W$FAZhZWg7YIRet!u()0I?eVfMbjqA{!u%>yHO}$s%SI
z1}m|!H%EY(@Op&^l3OMw8=ap*l|`wDK<z}F#&8!d#e?;9B%+fjNXa3HdLqi;a(cM&
z+FBrd+m*I!`c45s={glbp8ODj=+g0pio7)KEyiSYs~p}yvZ>si=DMp&5vwO9GHv%&
zE{*8h3$I9)3*}KU$H>L%g_>&OV#9R@OQ&l^Ld3fJXT2Jdi64`$0ow*qPy)`vFre-d
z8O{f}4<6@3&+YcHQe3d&sD4bQ#hZMPmBA}(n`>~VNK2$z1L~@YEw%DXt&oR;21<Bq
zpu3=ylAPX7vNbJEiE@;qU^q~BX|JxWI}p>oI%=Zkm!@vJ)%+yX6o_e^waq`2YaQtO
zZgd68CA#BTF>RfH4x;;iPyc&-j&T*elOrI3S<x?sZRSbQJzUOns;PqXLIuD0E_Ka=
ztc76kY}zZuI}bkBQA*frP=)>)A#9QTtQ~%{mLSj<6`K^X;qE(Gw~;3}<3&+Qc0a)n
z`YHDF2o@Q3^7FOMqjvpwZY)xw9fsBL)EeyGTIcayNnuR5X#_szE|YcF&$@t5l^(`}
zJ})$YujK5Jb6w#Ls4#Imw2CcqCW`tGbj)m&bEqx%gXCaf+yX>VM~Q=ZA1MpID}{)?
zE+SZ2a=`-kfZ{@9c70y6%V1_{h@(vz8a2F}K)R#2+|b-|ba--lba>F)J?kDHcYiqB
z?;Ut#5*9@(!z#HeXpDk&0c*FC;)x4+lFhm>$$gAZXtk3TMT25oOG#0Y(vDl(H2?@+
z;}|a$RN;K8)fA+?_6IsdIJ89<tGD}nlw-qj2k`8YU8!JfPKt6iaceO+V<L(%G2;g$
z3mL*cH`*J4)CfQIZ=K;*eE!IqRcjyoalz|9B~OFy<gD+4sy59A7+A8b10Koe4Pvdd
zDbxn?Nd)q_0uKo!Jbx}BuA0yo@uIn<kN9T!Bi8Nn56S0`KM;`~xRx6U^^<UQKZ5@1
z?6__z#|Z+zFi%WA%=+}8$-nOcIbtJ|?-tGvr?<*V;dM|e2GV@mT4hq%xtOU|;^YRV
z(NyX6cZe|&@{N_xvQa7ezNTnU31d**^a=<;N`vS&Xo`>p(X@hUdLhi7&qxR-aw4{&
zD3TkK=9Kf(n_@>6O9!sZe2mv4-Xz#^9B_9vPp7F<=EwleL?%Px%g2sPlaFl%F2Z*z
zUxHK^nZR?Cjb;S{SvZkOP%!-QQRl};4?B+^cK-PAr=Q$nlSKurVpxXL>IjRdBMw%q
zyEdLIZYVHOKU((mN9y+BogRODx5xju@bO4I!55&?+XE~K0#~!6bJ;5|%B|ko<4S9@
zVnPj7v|ou-zks-8p(bmpqiVN6S3-pTL|M`&Q|nE}k|v~aUgmEd#a2Z*f&t;4Cs@6`
zuZB)^M1$={T;NdOeFo{cQ<j|Z7=g*gWP=LPi)QUbSU3FJuoe%TD99>dpxNs9!m=54
ztNcl%w;->gNj6~w<vRr&fKPvvm$1NtY=$KieT-}JhjKd(1XwO%8wCIir&45SX+w8A
z;c;`&>(*K)EKm{^fA#mF70VW^s3872MlG_Uk?(?b?=F;v?^o~)SKeiVTpGWzOr{O+
zOyAWRHZJDF*KBR*2sT$f=0Kb@*%AMJH5U9s*%`3!Mb7jUoaP@@_<H7+Xom;b@34pN
z4*v1qwBF3#D0;bclG%W>SwSDz)DlgD540OQs~UU&YwD9Nz9jsZ#sAO?Uyaycf6<4e
z^7qO1`{=6+y2YxFWorf_O{<jDmk*|CH80iQL)8MZxjU_~5f|KDLULr5Vn;hWr?ax3
zLPk1dl4BWD_dCioe+NGNZ8p7dBGwAHVt+qQEMs(glwkiuKu=kly`8Q7HoE~1;RBje
z{;rmkyBJZN7J%^-STjD2YQSrd+`Oz>Ujb>J(1feG<xbkXoDbEtA1Bt)t6??y4e`H9
zKokdypf^{6YHHl1It4cLV%jV{cawQcFo6W1c0bf@sc8Gl7`r~1Y~a{FDlq^KGJ2ze
zfL81mi`dVKPGbM^a*UAC$)I#+48L5hyd`+E!<;%@`98(4it@%;9_xd3$*eFpb3Hj-
zq$L-$0u+Zg=`ds1BHyy+qClGzWFMw)2m@8`!#FHoW=u=9ic27-w!OK`pxAy;c6=w4
z*^kLlB!8y@N&A~A!6yBz4?}wJQNUa8Ne`xVirukTNPiEaAe0N5E)Qc4NwSF1irKU1
z9%cl0bTgM3j{RKr;%j)+Csm>Ed7RAvM+R1^|DoJgcLTQlBxD#(9VCD_+3OQUC-2Y|
z!VZ4UP3Ru&eVn-4ue0IAqWSYB2>oWs%UAoSdqk>Op^|DpXXXjGOtD&<iB$|@>*TK2
zLe*PI@B7}4;sSsbf2j9obP{+ecJp$Q&idDQ2s~br*wu&@j%7?Q!Q8%gd4MQNiv%TL
zC$IAfhmu|T`yLv~QEHi{lOQMzPav)eL?mMF5d74|p_1X9Oj#G0KhU4%6Q3A@vGizP
z+semh8Ke>Z`fFl7aSK){t+dBAxd^5Ny!K#kqitd;1t8D5PPG2;nQMGDO~+;0CnUUT
zA3nIQHn5Ix!9d3lxd|7FC$6=dG~f-nArA5Z>^+8*-lBuXqa2o!UlF&$IL_`-r<RO0
z$`kXt$`ayagW0Yg+qh`j3R|ahmKdls-ex6i8L(X@^#73WXg=XQ5cZ@9hSM4$ipuV+
z(NU+Sq)sC9P9$%<2i(~Sz`a%|*(JXozI@p|*gf0nI>uPF^-=-|wN$#n56;}U&}#s7
zN`;|DR>9ywkO_(6U}9%FF`MM&j^yD44WWDEeAc>O`$FLQhE-;6a3l}lLASy2P?31^
zON9sSFD&4M^mx{Lxp#UB#rC|?LX0g8i<Hd{O0?j{4%0UbMA1Ebj_O3_?q&jj1UG<C
zhXN4s{a>HO5n___ShV|+(`)g%g(EkS!v!t-1BOH+QO-^@Dm4hPAKxwF6r_}jkhHzh
zgzQ!VkDA(P(BLFK&EF#EqU~tp^TIX^*{fF;Cc`mIT#_A{f{FWV90F&Rv;!&-hq!QK
z6ydY!C1gVK5kyx|PzPLghq@`P4oC{1Y2&hH(wL1>qClA8MaU(7grcUUCZrJ>c!#^<
z%R)#Dni;{>Cn6)qfexw-%J?}O6SD|n7&=yr19b4|D4@Jo9#xs+uGYGk;hn4<uSr(z
zl(&xn@CZuoEyT4-HAQj2xicY)%)49~RB1lQ=5$m}916CFl5E$3#TjImsXO_d=wc>u
zLb(Uh^@ZD6Fei=2*-#hg-`o#5Eh)>$OXOA!2vRqK`%k>vn!$o*2+HWH;I{d!ExA!b
zm{;83D1Qa=pT@T)v=86Yoo7n}nNm34*WDQ%m7VyMXv&5^{SYQt0iLXiZR$SdzUlVE
zR&{-=EX6Y<w{D&pVPjt0@O<PZREHWDKMR*%eX>AxhzSgNbYn*qr~{@W^l<?_VWK9C
zoC6CfA>qM%%xO0{Dqbl8xe+;CWbVe!L9#0qzH+v0Su4$Qsvcny!6ZuBlBB0)gbs##
z)mKG^gFz-RFXI!!01DEhk=sbO%EQ}$YB}=?L-Wl|5mi}lLVl?7Aj*kB_y@eN0_IMs
zbAuu)*_@188S1qZ$|*-Q((s5~FSYOXM+4|!NyRNHgpCpdU;p?f>t)5o&&kFH<gW#e
zNG#P1d3sNihn<8Z0Q{B9blP%VBq@xbO2M!wUe71o&9hta3Q5Wwjn^ocpSh2kQ(#4|
z<YI8fpa_!~uu2mc4Mm!3C?Cf2Bz8f~cHKt+7W2wcmqelSy24W4hgIm@#}(+*))<qy
zP}|GWdR1-8hLZ1RnK-BSDSEb}d!X~rmG^6Io>iM_E)lG)VD4s9gbr>a_m#Vhqz%23
zyfh3-368~=)FcVHPB`u!zxej-;PA{1)d|G>o)Z|4jt`HzFS@5a_-55cpjztQPWPmt
zCHUGeqn?(}D3H!)sTtm9)d^9z80!vLie1U7#E9CU#M5|Gx;|Fu^=W^?S*a-sZH6$P
zi;S&E1I%62D+N9+XY<QT&mIuVe>4XdROSZOk;cYuvu-ku4uhHvLyE@1xF09)t2FQA
z5{M<?3lk<^zNcd6bsD{`;8b*KG=&b(eFskoZI>t=adhrN8-uqy;V}(nb=Qs!aSRp7
z5FXaWh>HwEBV1QFDCmG`y+8lN4O5T@d?soCq;n1O>Fid5k{24fPODhW(?DJF8ga@w
zw3sam|BT-hoGdAR5>C~$l^80`qlF<h!FU6_xs@He9RHG1g6%AFf{rk9jB2(ZGck8A
zDM=*2$W8l9t-mxR$5ug{us3z&g0eLjl;nI28jV{3DguQO+_G8Cf|1>b4{qENaLS*x
zNYSR+P+SiXf&~#9?snrjxCi=r17VyuR-vJC47OAjGFyaR%znF-7l}f>sf*Ix!^2_^
zO4G>+Z4Wkyy%T?8LaYLA{%gpQ-}gj(IBP7Mes`ZCVSJMjI)&>Xd6A8?Y2N>M24IuT
zzqhMaiurVk6--ECu}%yA3Sl?_c8Xb}IY|-9r)!lH)g9&eFlJL;<dpihGB>3#rtUiN
zA4%FORoPKhT+(_s#7;D)qF<4nE<`OtByrXYrdhwZ8e`UVT5>y}28bREod7IbSgPI)
zSd>m3qSQW-2{9TifT25PRE+6NZY4XM0PZf{F@SfGT#cO}4N_JT4+R6+W!dnQgIEFB
zYgc%%F@}o@Elko9zR{3Lw@GD|sc!!*;=I9|&?cVxM_9n%|Ni+;$tLW?-evMIfUj|@
zG|JL(8HDlPP_!=K*k>Zc;&cN&GRW;hrlyob>`jK%MYv<~;>n`JdRN2g31TY0jIJ9s
zz#@zTWqr9`2m!!AGa1JO@ZMpO4ls1aK*5jF{<H|<*FpBMHk7^6y<5$*KYNkQ=+iwC
z2#~{VB>MB<LGm^FI$&N(F+&rM{SHHg=i@TJ8V9M^j;Y$#SIO?@gBwfq4+E|iuuA~Z
ztKfTdclHSu33WkC<OnYCx)gH$W^Wf~wj+PZX$z~UMN>l=P=QvtC6O`79_g;OP6dn&
z*=9DKj<K`^rbQG<@8Ga^a2mIkmykySZE<z2vCeY!c27@U9W__g(;0zUcHma-*=_x{
zInr~N=AZv`=7v>ubMh97UW$LZmUdfV0la9Zz06AEe#+}$?eDc9Yf+1vU*g6uZWq>J
zVZ$0Pf&?VtB0(2Hlr^dJ1WDCc<JvsGdd0s=459%RlgcZO7OvSJ3P7foHpiC*?qVBB
zf&@v;tKBC1If<omP2~V<GC>PmfOP^!S6>LqBt}g@cAVxcJG!$pbn8|@L~++c2^>}I
zflA-<1?zZf)xofX1rTLh-o6_0Y!>zIMTuI6->9j}&w|1RkvpvS^L4nQN}WDgHc&pK
zOZkYu@N0V_En#}6BmTS-9Rw<GOFg=&MyQGOAtNR(G+)?bsNH}22)cyQ0sWkaWR#8E
zac{W~I}auE6dsX0QupiTm$Kwf{kY<T>2=nf{XKUK$?xQ0Q?Q+SClx-wckul1?D>B8
z1--bm`J-3QPF_8GpZ4j^r5(IF*!%wM<Z$Pk-s$`F0<Y8COM5y!?(Tf!&hGnkBkwNl
z<k>z9X7_#i;8#r-PMmWb0{}0yJNS%nXAch!&Q5<g>YbhLpS(|ZCnsV$$`LVX%8)P6
z!%>z^5nLC;*iF|RY(E_grb5K}LA!Gw8nN^Ye>-9}ZNsO73pf{n5@x=|0<TtxFf4X~
zA)&%;i8DOUr`ZY0z`ZvhVb!x+U`cy1dkqxye|8=_t>>{-7JKYhrH;=|^N+w+qdtMT
zPLa7zL*_aSnCsLt*Xcs$ir<c$s*_E9umSyjU6iw@PrU$Q9)+*!9{;NP(RQ-7R(YS#
zM)0sdDEJ^!;NX#eiaw}3@i>0sarDTev*Ply%qsnz!I%79^vdJPD`f_#k7v|F_|gjK
ze#SLy&={Mgekb6!Jb><oRY6taf0L))by=e}q4eLD!-f_G3CVI&f7ywTh&f<ZJ6}>x
z;hsS<3BtV5CB&!hyq}+IE(D);AS+5Y#V^XlL;~{>1@j5uw$ut49lIzoq?|YMAu@8)
zO|W;cce>Zz-}_7NxD&C5+%N-*mEcYCRbGkT1?sITAb1Bok!uOm)kT+4O#_b56Z7L5
zP~A@-MlT;+K0p5H&p$m09^N~8^C$4^xPSkQj{r7w(95GgpYgpHym-2EgrC+tJh+I5
zM4l_R=DW`<de^q41TsZA)dY*WS8WGe5Da|AlBn!8eTmHj7paG$R6CO2uD;ZjR)}c{
zoZzKW06_t;HV6p8XgkSmHmm8vw^c{}KpiA^7+aSo6|nlae*?I$#lneSXWn<xui+c9
zb5WSd(#A*<4I6U{bTq$sa5BGu3ocu!9Tw1nb}rQUAB31JYf9uv+Y}zK*V%0e@eTdg
zBtNXwniqoO)tZm<w{D}cer5?HovqX$MSxaTj6OzdzwEn2Ur3#Fv3R6d7*%|Wp`pz(
zVO+SBaIe{4NeG#cT~<mw+4$CCtk;AYi41629^uzXQV*A1Zcv+{4I$|!xCzgBouryH
z3fG3EdZ2}%GD!V>B^H7EPFJNdo{?e37!G}<mhkF|je|}k9nUUXYhB`d+sPkF01tEH
z-a=8`w@OArcC}Oo<F)4xZ&_Ld_KnZyOC#>Zx%oWj=%GkZcg;{doO(NT8eSNEnzUN-
z@kYC!w|{*2Qy|zZH!|p!b-ds!0+3@f!@Pu~Jw}SgIM4Y7#BX0f)C{CeB#uYz@11-t
zOr&i+VBEq>dVS@jTmUaX(7z5;tNo6L(g@;C^xDsIkeWe-bK{*~L<7+dq&2^HEHn0p
zbCff=Qmj!^=?it$am!6jYIz(UQ5|%&dIL&xCx^r>xApGDBBOVmHCxnF*KK{ja=)&Z
zbPF=*CSHiF_60I<;h}@M0Vw&KmD&&h!)2(a2F7MbM*DLK{>PjF4UeNJQ4A?o0h<E&
z03;eQMcl(z-~deB3g=s)jtehNKu2;L15xnz?ocN^gJ|EHnzAN9XCtV68Vi!RPU@sb
zCmP6Lh8b@p`>(nkNtWQanA4t<R(AJ}Pk*3O1VLptVLYnl7<J#I`H)hUus0UX^Jzsk
z33X?P2Z2lR<jf6VI|z_7P`|hherJ|7h0|EjSPAr!+Cax;E&3G+n*~o9lwU$L&e*WQ
z*T66zzZOT#%kIf(?|A9>@hR#lrZIGuqJFuom6QGMx4q^@Ft%a&yt})H2m3!XH3Q=F
zCf9#l*wD`Yt3`7HIfa-O3XIEI>mEL@Z3$f0;4Ea0xO8^A&#0N80r%;u4ZQ4r|FZY;
z@Yt<SwVjvgTdq&)bopg1^}gNPId!f0m)L~`RE8dT-~)Nz(AA`Hgmz2uH~^b8aQt_c
zp^Uq%x5LAi+p=~gASi*RB*j$wPQ)8{FE{r#va^{Pl!rx~2n^A7vX9kj!S((4-~V8G
zn`R@-d7#{YK+IbBGlg&iQH1>1u#n}_k?kLLcX3o?yo5Di_cCn$14ltC@`JOz6R5Mj
z?~d6)At4rc-c_Hcv$}Lhra`bh_jXQkfTy0Lpa4FlD(c1R3*~=Uulp@SbBfi$$#W-1
z;^1DARd4f4iH(HSd!Lad#ELIzD{?gDUWrLz)v-A?wRg}9my8dN*_gWy4;L$+m9kh?
z7rJX(aBWWk3dE5=QcbArHFG;h4BxsBzTVrX>xb+|MkWK01c?2=nig|P1zPdPEi{!P
zq!ntp4eTV{SKlXU<8Ln=9_41CoItBT1_8_Gjb1v*AQ{Y2y1{U*)yKEfJxN-#V(v8D
z0W!Abqk#iN3#I(cFH|T3tT+z8uujv?hXYx(0P-A^JCe$tgZ#5F>|;FhVeTgMoP<y|
z()Rh0Fs8P)#sk-OFkjVtU2&!D_6~j^n@ixdlb^;+JX+=8?I*$84<w_@WICW?F`ytO
z5^g$4Zga_katW&ppIW)|xV;?b2hDL0Ja)j=B$<~2@xi(=#!#;7N(~q{NVEr<vD>uw
zn#vl<SM~Ka_}lGjjR;+g<o<p4U%wD7*+>}dnL8=J1|PurYqw*nSh76kDBJZht5i*d
z_It3TaVOwEsci&ur&n!+{pu^L!b_TCv9#JC%LA)VjzkK7oV_52QAsSiiO^Qf`1Uf)
zm&rri>(45#F336m%=n_tP=-Ituf|SxI@1<{U0=4IBEden7m!;#sxuz=XHOG-1yU$b
zZrwXPXy1j*@TE9}{>W>`Ro*8#$HnCtg+se>I5F+)@cHwVw<t&q5x1LLzezexM^M!f
zR(|Ey+)Y`{4Z(D{hOt}6W;IM}={6CW;*!Pb4olueJ@850?iw1J7I)e~(F>mhyi>$L
z+9I~p80J{%8lOXZ>(M?4(x*L<ejTX?<5}^w;4Zrp>#G&O4HGnFJC_VagycK&-Uc!I
zy@tRu=<UA$7)YG1y(Q~M@L9tM-m`xckYgU<R7z~Zr`I?>JtM8pnpS;@c4fmSFvu2q
zh5di-<D15^YKyhI^=~g5up5wn85;v8vh~0JeU&#wJNA6!2#a}Bo;u2!Q!3yA;${|R
zSUJ_Ei$ePjJa<ITwAxGiwaP?=9lG1tso}5Bu<xZ!iKxxvm(rK$nhs3Jpt#PFatY3j
zCEbjDMkKc+N8MK^y-EfSY3Ni?F6ZohCo7Y!2$B#ALU?j7LHQ6+Hoz7~xx|wc<+Isb
zIxRh>7{m!+MwmLW5dTB0Yoz)4Tu8F^34lsI%R1t=$9i!Cv>sf}r)X3jq_b3JV6DJv
zfafGCpJ-1mGXEq+fOH5?fYN=&nIwFOF3M36zJ4Bu;X`9m>QENMyr`qbVGawgXN$ja
z#E=YNRw9!&q$Ew#OHfQMZZ*ZE2Cl${N34CehU9=*@(r&U%!m%zdDVG8pNW>HY3rIk
zKxMP6=^Zjf1R($`?{y?I5!Zs6Aum1cW?4WRvuj>QnKSCFe$qujiIO~fSYg_DK}4Dk
z6di__*QAP<ypgaIxRt(2!ps!2M0>gr4HSZsK!zIP(JBT-uuVdn44;vrZ_(}LZE~HZ
zZ*Hv?3t%)vf!C=P!6YD*09}1472hcRS#Y$eIrH9LGID|sWs^cCo{u3cWh8H66UJ3K
zy`b{r!(qmFS7{0RS}+pwfRADsWamS5EvWf}-(Yl8HqDCxr`R#2c&vuf<IBr~rh22*
z@w>35Os}Uz4z1X&1+I9~<d0yNPl+hI;{kEPy-WOf&{7BHj$6#DY>|^qc&OIfWlui^
zGkW{&6dI~lxeFq}Fbxzd-8FVd?xyr|=7B*%AW+4`@cAW@y;X+~VMs!~UYEgJiV9L*
zQ^AZrt%<^w5nu4RWt4emX$?U)m{f~tew9NcgX5STlVOUUwJ18k_$(2!h9PRgiq5`@
zJfvK@&be>^KTKngg6mQn92>58g;EgbIJ@!A{y=Og<y~7!m>v%twt=()VG3WxF?ZWl
z|36XPo(8mqXxEU;$S@9WE+E*s(_nDh;63+DD|%()^&|v1)tOR?$m{Hu;3Mcygv6j#
z0B=v5*5LKTP1e1LhLb1y5d}1d?qdI~YuSCx?TZL#@~ZipwtoXVckkf8{^OhiRDCom
zd<df>5QogmO4>*}Toi~TKVj>gd#GKr)<8oLa=58hKBs)n<XU%Q-AWF%ARtVQaxtm8
z=fWKcI<M?brVz8GyPq9%gmvLrY<>wN(x?+~A4B@iUru_b+sQBP?s82WXAl7l%{)mi
z-1YGKN%-)|sZ$7FZYS94e2cJAwjec5BJ3~$-n{xQj4^=da>}=JTpWd92JR%*<J#>g
zzFL@Rh&+nj=ETJ@8CRVgw2Ig?tR-VLVe)r2g@^%YpqRjIk45)5s2uh}qo3rA(?&=n
zRNa92RTl6VH3~%!CuW&6x*hlv4pKYfi7;G+Y4B05-yQFr_K*(AZi>MSQtz1t!k0lg
zV<yj$wq--HBc6RYbqsO907dN{W(9-dcwrWMxJFS>ytLyl4JTE?$S3pi+IOI_!a5I(
zUISBt6xvqkRcNHT6xEbJ4^Tuiq}j9Vi|ZaUeZTV9m;H*5k^2S$Hn1;f!k<2h*K*r;
z=!ETv4K}ho<#K$&s;tu{(;2R0{RFsTA(F=7QSadFn;ux<P7h!0eEn6je|Y%Kt0Vb)
zTb&EQv}zhanz9B0;fxe$<_7m2h)@uFN<NK<33qggILan4j!LV?ZlmwmsLX=fs+!Nt
zt>`&8@tM$qaH80bo-wFi{dxj*4M$YgP%<4HC+AUwS0G$@xZgTrzSeNFn-U(Qd`Gu`
zo!67-TBn+cKo`U#cimZ^7PpNzbqml!P)w5CnsVaKbAFKz^VzM%GR&s!hHFHR#e%y7
zQ%{hmyJb50`ta5M?%B!Si-Yby;8pHD-|Owdgih#k3GsdDvt}y1f1jK7_9FWGB>@Hv
zaLKt{6^if!A{rD0Oo#XpT<UE`Q}G|rL+%*=#ocPhAZnh>ib<>TJ`Bp=li^=<YXT|y
z`_Db0gKxYEE!BcWi?n)F06}cT=Yd$-tP*8T5*Pr?hc%>9du~a(C7dQ+8MhFLtVG9*
zE5POqP-o1#u{Hu^0GMIn;gE`0D^UqAUTsaQh}is+`;+qAZPq}yy7s{6Te`FDnwUkY
z$*ZE3xnfPS2wo|W5_T{0DZ8#P1F-k<==6v1((!V>+!?Dc2sm*JRk=@_qi};EJP{uD
z9atIw?`d{})PZ1nrOHPf=nYF_lqrheB~)IbqYZsCg{-<VpBg_b$%)IwL`vA+UNm@m
zB$62S_fAe1z6B4&Qf6=QD<{49jlV2=<uBEDzV4oUz3?4)AbN+MSojwG*&sJBUOo57
z6F$2Lrn&HWLn`m8XMzCe<x~&_re#_5bC2k1#9#D=6FhyH%uE(Q*p6WH!_$H^NwPT5
zOv#cdd|Ff8xkWh)z>iqgL>MPfeXdRI<pqbAt#9y^`v?p5bdq1PX;C?}T%pFD+izj&
z)tY{HKD%{*9q)N|XcY-T0ZPvK_uGpO4@la;f_O5`Z`rd@QsVQ8TaN{A1jh$d!KHl!
zhX;0WwULF#fG*9Zx8g(aFeG+ECtw<Lf;v(YSOXD0X6i1PH=q!)5jc<sIY+SH&n9S~
zQS)NyYg{!dL!dPbGRiN2W)8<-h{W)!=2Xb7XuzQB$e_{AOygdhuI#U)U5o);;fDTf
zi9ohIfy8W#5orb&Gz67MBGF7`BT)-tV3UREuFE!eKE~inrwg{E5-3N-=9prY!jg`Q
z@g~OKU_D=`Ck%@|&HBSMA5k_P1>kyI*Y-ant-Qj;`n%Ffx4a$qKPJJLs}B|}dpmJb
zjwotwr$%mDa>~6f2{&-WxK^j9SON@|d|bd^7&TviRVLmjA6!DQL<#XS-yiKA_bOX5
zD#0mnCZU8q9Ot5a(HD41=<Md#7HCEC^wVVXQPX9n%U-jxIs<Bwo7;TK<7tJOEPwsw
z)8t|DmHdTv38@bRB^u!D@OPK~Dpz6`WOI6C;gX`q6rEYr9HzsJ`x%z?pbdiLTylDW
zKeeTKxGBjeN4?_{ce(mRv08TuH?N@Z0``r@+DTF77)%R7$`v74s)0~EDqaqXDG(@4
z2#FmRpa|BYJl4ZI0&fv!0>DTWd}$d3bO8x0mX9bCAy{q8$wK$W0vhea)Oi<XQcsoe
zsSxiM6d%WbefG4T9@_0ibR2M}Wi44WEqe6xnBY<D3lHETJ4J`rrNLxIGRor9`~jF>
zdQlcbD6;no@|Y26ah8rIe?PX@y(s@tIA6fw{;~L3@-Y}%11<eyu(E}8_fO2tes>(}
zh@4VTUdr8z>C`)qz>@WR|JBLYU4V5#n5hW?7C`g@U?cO%Q=I0OTMQo#jvNhK`R>WH
z)ZMc=1*mio4;l#{LD9?kG{ncIGcwJuuCO4l!ilf|j`1bFj0uMz$RO~zVRTUnlCFWJ
zq`n6i6q5vY5YZ68ZpTH)Ow102G6lw1bjt3gvlM)@6hNTUBexTFYRT0u09f1?L{%fE
zd>5k12H=vGi|%qbFR#19A@qw;Enq_5eb&ORzDm&gwEOI=d-B7<&bIz}K*$#-)f{%{
zn|BFDWCqxlKir5AbQYRywJVW@fi#8IqcFO~E%H_~RO{{q+CY{ktPk@33?HpzuERH#
zVWotjiB<Kcj*f~E`Gp-XA|K|Z8J}LATg@<~$Jod>^-f0}tGFKBtvI;wuS8>B)jP##
zoc;*&TDT8B8mjg;1gDJ*oTm@QGYNXjs1QMH!fQ)O?WrLPZ={q`pLiZW+>iy8dzo3H
z6vQ6|;Np^>>+aumzN^*MY<w0SGG9n!0fZlM2*M@6wtRTg0m&;QYWT!S@S3HwV%k~N
zv_Ko@Zr1t>b#aaRJKd|~;ahYk239do%2x!{ev-|;S;eym&?B9Pore-gWGxbiO}qSV
zn?j~Zrn_K-YNiHi4=88%Wfv_=C5NgS;K4K~`VI!|q;&y#)EFDr&)O!q7%_nX$r<BK
z3(VH%P-?8ha%-&jj%#jChEOAoI>wIx`x?-G+#L&WaNM&M;MQS_))NX3oD_^XeUZ-)
z-0kpqvkF#)j{PR6DvSnkCkxz~Jd(P{C?3W=han37LE|ZaHDpTHc$x56!c(%CiXlyc
zDhbqX+85He)XGxCgXA(TuMJ4jp@e6)Zl(out#&nFg`f62oJ=7K)&T4u6zn`fp_UJ(
z3d$@<Uu06QlmdJxtY*a6`gUf(kr>mD!ga($BlTe=au|rj4~yffm}IK-A`^MMmGl7l
zA6wI-e>!#Jr8+UWFOWf1ncaNm2IbRrDTY)acWuIb?%u9U*9lrV7rx!3dC{o=+0UMg
zu>STRl>zETH{u1FtHXT<ek8CEV|3{4EE8mO$x3e7Bc$FZ>ynz4+3-@oLs=Ay4c09d
zN|t`kgf@5Sd9s^#HXcF^8rf#*n%D#uBA_<x8tRf=@jYbD@q>F*%PUy+TBgmuvkkX2
z)u1NwN{_kZ0rSBP2;kk&g~m`Z(ZDFN7F~bzwD_d8D)$g?ouRzWY>oYh>EMl{T84YN
zK!3QD*Yph$?ZQ!Ii@uZ6GmazF=wqs%lwF}y3GY=h<ZCmt84Mc3=SVv-UUFJHoD`4x
zX|ndkV3cm+XPfllmuq#F@VYQ2SX^HP%i0-y7eP)`*dzy~eD>717xi)^ySePvb7q8D
zaL-`qH|*2YvtKds6zG^lIv)4k)(^C5l-o!rTwlxO#w*d13<LTQAa{I@!60)@&=u1T
z(wY_oss*a_=9f4MXo9EPJJ>md6x_4p?sr~W4le4!#VZ;okva;Hb)hqX&+(qwm~sGl
zqQQz!Vx;=$%gA-*IYq@x!7xQ`bxJSyg2NIod2m=xD9uO`kI2UjOi4EhxS;1<LCFyj
zAWg|2s^wu2G9%_I_Mn*c3KNemGG*z87r&peho~_YHYq+8FInXVohGT)U-SHhFc!Sp
zr?jkivkIOSuF}6hdYrs`76jSWL?C!Zuk4CH7XMzb7FNE4mgeIj!QliOMpWu$6~26`
za<$$Ui}<u_*tPqy+<3LYaP@qru{9cD@+GYK#-oRi|AhZpUeB<nu2rmiNed`;m4{o&
zfB8!#rZ7%?)A%RK9UR|cmPx>eYK(Sn$~<KE$-~8{iOX5Noyazm4Hgs&2*>SZ5co$5
zezBn52G#5UE=3Xz(}D3*+*R`_jNVgWsfGVMh%79cEQM~~%!FC9sm$@WvutUJk3xSw
zU4ea9$dX=*ql}}Msnx4#aRX;HZo0#(Uz^0u9evTzk!u!kEN9b7qYtai^2$~&8AxBe
zfvm*K`4FxW3~eS#tA$)?SRpq^_e}~If0gg57%a6*bc_~a2<|+YI4yI*CP>IO()%Z^
z=w@wC`;fr!AuLZ2pY@UKPDhYm0e%gNrK9Td)ME#3(`#1VW{ALK>n5xtPW8Ix!)!$t
zoKcPl?lK5zfjhQNnRefCtRG*4TShC6Ui5mj%|Mxo@e6fm)NxRaUSM}>0+WvoVEz_`
zt%aqlzdzw2T%B4wm0Rk+$DIlhe|Kt2ZyZ~I7%v=V`hl(22Ho;Wl(0fvDBo}gh|L#j
zY!Tjh1epxYoPFKv?m|l9|9Q2y^NoIzY?}{GyL<cXRZM5a#FDvIz$8Mq#kBJo`7Bwv
zV@61-3u(;OH0Bj;43?JUEM!ttou$p0>*%6j;StQ{Bg~&5wQ@^Olh}7v9G4OMjwS^v
zsxSp;%bw7!+VbG+Er<#*VtSQ&4cHEIy2KH>#g>rMP-12l)$Dq}^HNNf9G5$qZ)>l6
zb&uA3yWl{W5+W!cxn+lhBcWi*?GOU~2(*ixqDq?$C>~*#{$TM8n1%$e8X3udOys(o
zK}yHoB_7k-+z9Z~h``q1tl?pV$BIAvG)@~t7RFeJ58}9?=F042U7|b1Sc=!cseAyr
zk${&i2z-1Yy=1fkm?pZP=TiWJf1^l89X9Mq4hE+0Kx!gs7q|!W$*@xU2a=H7zG61q
zX|dxpQA&){^uH)a+&~A)ajPq|{g>|U?%DU>xBV->K27k$y#x383NIftynL|A%P&sr
zUw(1A!pr*&FYliQR4tGA@S9AFws>O$FjSCmnpgd~+xFkI?l``~SEpz0U%*_lW3NmO
zpIOkxtE1iS>C#sCsRivE93Cxc!#%NZJ>B|9I8!KK`ZL+7t1h%&_T6f(TbWWCkaTdV
z5ri-H3o>rcCxg`3Te_qIYhTv9lFqy%)EH${O2w;>#Zd~|j_yJ1z!$xsMPk!F6*Z7p
z4kaY;fTh+P%?BT40yl#TCx?>79!=ngdFfVcGUq}?1(M=?%orsYaB(Abjq1=cl67o<
z0zP6Mn#2x_3ymXVy!9!03#`43`quB8TyD%Mwv!%j5}N&jo!Uxv3y>9%k*T;{TkM2c
zN7S08aNo717pL1mLqb17H%J*sH)5l#*g7S=0w3E-q=(v{+A$?Nt|b#?bb-Rzg)fKu
z{rAn|-d}axLj}gJ4*H{wSt!J5cB_*JGA=>*^*jNj&2%vE2PV3)YujS>MXk|-6d|X8
zW(`AVptHjxMBescV(^;!X%uVedjvE-_?|Hdy~kD}CxU}sZ=Ob7HuPkpW?Lx-80n|7
zrW>{Ld8kHjg%9Rspbn!v#g8zLO$Nmr038&Vf&_XFh-w|A2kijDh_AhRQJ&kvmYbAc
z68JZSG1)s3z~khO>;P$<)m)jMN@0f7wNIchV>i(yjLTvcW3ia$m(n-$3-6NAT4+<;
z29OC*n(y4#b?(sc$u{jxiQ%xcw^}b_?K-`ynVoHBnLMQfTt(AA4GNzCP#Ivpr5J%S
z%wK1ghTG(>XXp_0n^9!~9}vK#JgYDnK{iprrbO5vhPCSW$aeHN@k0tm65Nf9xyL-v
zi4OCTjn|@nIYt}(Ih7ll)Ctdt6$M4siY+gwQD}rWE(?b8P=OUAilJFe;IjG}=N&Aq
zM~SK9UsQ4igcD&jIRg>p1K|_IWM~r@|B$fp_#V(jrX`qW<$Q=G$xw!LtSM<(Zq)|2
zA_-(c-7y`qfcYD#4Jsri>u#rMkR1|@W*T*KnGc6ieMNr*M;A`Y&d|(L0=Gweo-Lbo
z21TIAJ@?W@Z7SV+F;;zPLuU6cR{OzOt-NSd%)Nu1<KN1N{f_-(Gh=euM9N*o2pfre
zAHdO1!FLw$)QeooBg&5;SIPJTv@hiP2ZyJQTn41N;fNgbt;nnBU%Mq04wi0^v=n{|
zxnVXygR&cBhhm>tef4ZP6^v8Ews@^H4#9vEVtvuPDmioi9S)XKjw${gXlI>LqX+9g
z?*|oMj;#pmbxZD#4K-!udd8umZa9x%b`Ps1x*gf|i;-@pit9=-ek_X67HPbw9U+8~
zh`GLsC0{zti-EcjuZb+9df!U}<_d^61F3Nd`qM2339zaabA5M2Rt|CYOr9tE_i!ZL
znOT44qaT19?q=2ltbDK?b2*)&Ox7`{N1n$mHh5Qp2AW!YXu0A-US@PX_uMqkn6cTb
z*@k4Zo5)z7n4<9HxZl?Uzf(n3taV97njw=dLu%cH-A!57BcxlQbs83DzeH?#qw4ip
z^aNTFGMh0MYmq0gVt1o`k!V73ra?AXokZV<z<<#h)DUyW-`<P@zo@ytUx<S7v`B`=
zM{to~x><k&x*$3CHNl?2<68uf78-5b=A0dO4_-h*qEr{K?}+^?0Ae-YBSz~ZHTciK
zF&vnPXL7UHOt}!}Z5i5yp~fiWw2981XjCn@k=>nC%%^?w0u#i1HMA^PqsB$r?|tvX
zYknz*(Efh*7U$BsZyOp;MWj=Z!!jEa+9!_Q<AaUzlH$r`t&pJLZY@dWOEnl<$V!<8
z<pZ(uSYpI9sB<2v86zpBXK4n_oBb)|OPDabDz<DjZ+)#d9w@dofyuL2<{2km_w*P_
zDgg=DyBgZ)LC#_dk^3Kk4&;Wjk-$p0GP|#{;RK@LMdX8%%p-iBPfMprB4eUGW{^_)
zdOwZ7-6Gejz|zzmgi1X}n}tS-IkW{0VUbrWj+Tn(?ZmsN?kiZg*Dqnf>yk?=_7eQm
z_>9Pufhcs~<tZhx9J4#2b@Zudvb^PGKC}n@!YMcqj%!0ZZKk-qRAbptqWA@M_IzfR
zbCK>o%E$iqlp(y`hnf7EzLj5b`oEQu>Z4y5U{<cqc~5o@k84<OHVy01d9tFd^L4-H
zrAK}@Bu8#M0f*-bxXee4%HoLZwTf4<TIrbsb_(Ao8^2(Y?10@tk!pIZbV73u!JY2E
z_Old##NB_x=d!o-WcD_EHshz^^I8!@vkjg`*#>{vJEB+=FRj*JXml#RN`Coe$mg7>
zE{^VWLux16m7vP{AJ-Uhh32*bk$UB6oqSWB7fi_QMoEC{VUmM?=5;>7=p^?b;Kcso
z7TEpvWYyIv!_{$r-*H9CU`6Ep2E~H1(2vq_-fykF8kh446~?By%Id5I2nO*Tu9Fba
zwN7Ax7Z*y3blhr$89-okM@I7~>zJ#aBeXqW9SF@tk7FV)115_Kve$QW#i}2K?0110
zBZF9^wQ$%P@j$GnfGSplK2nG17}#gzF7f=Ma?8zbioiKmChP9plh(HGPCA7rJOiIS
zTN>QG2Ga-rR!v%k=0<6MS{OyluF28i$sQI~+B<l@cL2$$aGe?G6mDB{KqA<e-ivPa
z^>KEU*1wKgDDp8sBlsO_**WESTB7ZmP$s6xN1-9C^g(o{w?0L|VMbg|b?Sk4GBoHE
z%=l1T5v#+J)y4e@0cOVWf~N5?KNgE!RiWlL-?I@kL(NqVO+r)91ieic^dl8Adx2NU
zpujf?VwxJ7n)6pE0*$9hDWxLv455?6(y1(8yj&F_@9(%;58JB?t*VyPh^+p*-zcyS
zv$uJ_xSFPuYbfWV-0uGk(e+*xi_ZGTX6frHm(v>pT!vKeLH(LkTjMV%6+ZjH>6#LJ
zToICW16Q^8AYs;hp8jrx<lmXR>qy&*yu+%@I~1Xp3|PaXbXt0A0IoPLFTA^o@yblx
zOdA*54cm=}{K(`NWdgmNgC*VFGI~YgTbc^&iT(y`tK;<<!wa}4!zohUHi8}b`U@-T
zFpgM1p`fmdT#>Jb?<K4+ZtoveVAolp%zd|&DdUyVHvZm%`=^xLqwDRrNb)3-sW5*h
zNggl4k1oth#!Bs^E7urYT`9-uU=+%hk%H}mCe_BE7=rj-y^bg^i16v7Ycib)grXOz
zqrl+0i?iYZ*O(!=os;5b?Ap1`C+Z2M5eO*7t>_|CM<!`WRM9=@9@*#=W0OT;zCqyr
zkau>22x<A43Xpdbv5naHNd@e`*Xlg1vvO<HZ^he)IWUUDRl{NK5t@PZlC$`tq6U+;
z(v6ZNt8$P4Z^GObB!a0}wL=5u5buR5O6cvYNB%Nb`TK~0-c_`e!#BV29^!){3Nj1~
zhHY(>!S$L^Tu#lPOqx0rw#AgSU+5}+k<BD?teT%5tfw|X-SGPd+1pt~wuqX7AKDvu
z@0Z~Vafp_anrv+B1G{L#9q`F)A4YOvspJ3xA~uHOWou|wMrSn~Z+?ltKdGI=iK(~I
zf@i@=%?a@QXZu5nA9qUQD`Qxh(nHC-DC7znL!D&9Dr$A=V(LYRM-|xMG-#xgJcK8>
zgpkC!roxzKnPtsW&u;D^nnsnczz|08zEj3){c%XDAHfr6;~*<)g=^%q8fr2xgI;t{
z#Q29egAdI%ei<$j&ue(hvZD~a0^94q#LW&F#V<qV4X6ydb5~JLWybJwyP*mE&NsnX
zH#H43mG5h^n#)hPv9+fXejsmcis~oTf`kY<YsdMj4))>>E_w8x#bf7=pJ!66Jvf-e
zk62o%YD8kg!rIXlRF0Y*Ez>vI;EcB++}_389PN=EWNp7ea8!6p_@)jow4O9JSlxNM
z(w{lSj`DwJ*~|1T@$63I+iTaYFZ?W{5&5aoiu}B5S}MP&;Y;ytwtC=3%^YY2ei=H^
z&@KY>+Np$de5yrw*LV!QwqISBFyg_t^9gVN4ly^r>4({yZ205DpSIjVyGf^mC;yb3
z$JUsXpZH9{Tv_s|o~+>QDuJy+T=j(Y5e`aOcTh-9`{z0>?=M)!5~1e5|5m9mZfK!o
z7@D>|h+uf+`u~?;_%Q`T*kS)A{N*JET>U^WbR-7l2(WaxkVd_b2Vb`v+QaX#y=QS_
z*|5H;e+I6-R9>tc+m9nN@}`74UrzxdGx{B~s)0olCMvj__~=_T;v)`VMe*^4yAbm6
z??8OyRrBln3B^ZV1nBkmeIZuY<@X^z^5%i~2+XZ2HvY3PpoL<iA)|jXu`!t0?_O-Y
z^C|hQV&jL)6sgHh`8qAH-x~qUSM<Rg?~-aSKtbV;gaRf(5R_6bLbLi%plANB5|o52
zDhAMu3XavmQU`!WnCK~QKwH=&C;o@wBylJS4yzVt+qM5Do#yEv?<=GL0v}?+C$#|4
z98P-IrG`eJbWw?KQ0Qcbu#M8P#(%?jNM+LUsMgTN&hx$A{w`zDXfZno)50nR?X9Fc
zi&Hmn01t@egFK5P>rlNqaBxYUstNln$z7;fqm5}H@<f>!cdxFFESV;UzD*&p$1XT-
zh->A|kB@#5B9JIa_u=E8EO<`f?u3(YLOCvhwI7OQV;)q8o9%E*1m*FhZcD*GjHgJe
zLm1lNTE~23TBOu5Oa<1RxVY7XUH8qXftF#(D&ySk?e|W5A7GC9dfiV$x77u?$gWc-
zF)LoIz-BsW7b1-6V96L;10(0i&CUtTune_hj*zyrPl$4$ysmrocuCa4_XKa`!HH}Q
z2@0;t4dF}v`oaYYphu`|k5XqXP7)5~`}Y{iorclT>@osgAv)@FD8}NZe9|odgN*&u
zpn~3j@I~A%K(j>Ii<_Hjk?rR7Am(&Ji$XIdp2ra$(8zcWb#k)lC?DhCb{2MvKLj^h
zT1cA4ppylIJA8F;de+_F-%j?}U=m)5uK5fvcYilB(_QwXfj)xWl6yQA^(jg}t2D?6
zU3gbWS~iVpD`|BR5yy3bi?B*_f8Kh$)#fwximsD`?}I@9PH@@_C-iXHb&RGNa_>xk
zzyu_G1jxsfzQCf46zJbX9i4zOQiQN!sS01jn-W5WhRKd>J)Q$BbmK1&=F0wXtz8zy
zT9{t|Z2?59#Qy+me?ML;gU3!j0JA+dSQy)e0aqlnI*tSgsl`+%i)xIJu!mSi7g>hr
zLqbKZ++EMU$Q=Owz$38kP??OYVk&<@EDfeQsqcibYmg<{e5_O$!DDI<64)rk5<?+$
zwUZ(PXbE_Z^KrF6NPr%q6{OCy>2zG2O9@a02B8paNA_(HWr!R!&Tcd5?HzpE-REk5
z$$Sh57h{9?$l-PQrO2GHbzA)I!Qtu2tD_hpGb-immeU>muT|KTm!EZapW9cLV5?wv
zy@OM}F?l_2z@p5H1oInYWq+DqzyTVA$YN;=aOU3#<RJn-`JCf9;&-GBCBIe0XyH?X
z^>ARZhQr{hz;PhnisFZ|H0+52i3ULj$4DHstSU}G3)d_jCu9j7P!=*Y<Cqk*_<aO0
z=yqUlr?*`lZ<#svHOu>qLt~@(VOs$-Sn<119=OP6H*gY^UI;X72&>5G#g5|&MloK*
zfP0uL^!Om7t4!;LQA>h+46PCR2|}n#2F5VNeGtae2n5a|*4EaR=+$r1GYl?HC!yUP
zOCSqo?f<lDgs0@!T7|obcYS}?7no7r^(`Toc3?Wd!|hafI<Q_{56uI$#;rwYEzo6c
zH*~gF=w~^uOik->_#4}<adW&Uq8H9iV*dc~2RMaCb#bJFk)5q{(n&06mAgTPS?iG<
zdQDs*GJsC9fg|*@0ar$#>#Lfpl3DD9sKcqYBoy0_$l~6o=AXhmobCg&fG;+p7(D1e
z9+g$RaO?Lvd`uc626mj@1kr2M00fOe@EZMPOa9av9;@T4tYY0@7mwB3xuk;6lIHEk
zd`%qad*Y^!1vG3#m0f)Q{jW7Fq+;F66^hpl4DNEM575I8f*Kb%$G9$yjH1;{5P-Mt
zj`L^KM^NTKeipoaKyUNQ%S^7TQD#tZfas!Xs+4+ek!99wYRxWDWnxezFTJeOAW~M2
zl(LP67b-^zS;Oak)2O8H>YMffR;s#6W?g`?ob0AZgxEINt9K5Meh9dalM?0X0eK7^
z$yf{%gc#62NtKB*1^h@hk`wnTS7T)P!}XkC{ENv31R20dGNosAwhd6V5gsQ6K>;<b
zelfYdJMRmY$gjY!W(iKa-}KJ#adX_MXa*a++=Bg$SQzf*JHKGE->1`CU#P)uJG9Vw
zh*<}AFGQvA6vG-*4Y_m@6DIBFU|Ll2Td*D~7$jdMkCJT}LCE3iHy<`sO4aDTqxgFR
z+iz#k?$}+tE^eU0gm)ehL~J4XBe?hLIMa0@nbL`|!{2(x`Nb2cCYT*~`7_S;Gjl?y
z$cv1AwfTPhv+(5EYGCdv$;JbBm8?`Y1#eaoDG-L!2v1H^34*KfF%7TIW}?90$kVYg
z#&1QSv|8PmjR`5)lo9-B!zjsWe(pH!#EIhLlxlt&8$;5<)Z)r52@SE8y)8<c)aODd
z-A1FlubInM&RI>Fc^W`q{S&nMD6xdT)My^U^T!OORW138t@s#tbO%HJG9$idk!VvS
zbIiO<ud*h?ikBRx0PDO_W{~^#q|pZB2&FZ;U2gHdPYo_HTaxAfK6M(}V7hG2t}_C)
zaSa;H;iMP`S%z@O<Wh&-tC<O+bk)v87OdHh8d%E8s_j(lV_Quv^}gRbIdu(H(Y%eL
z#S#};XAsu{&r#zcz#yZbXos9#um~W80Gjp6x--CNtyCNtdqZ*(G*oUE376{}<M!F;
zJ3t#l`j34}bzT-(&?OWKPCQs_N2I`-vH|Srdl9Od3#G}m&V6lt?Rw(=^gYl4R<c|)
z5#CQb4=;Sb*GQ>Ff2f#AHM`1|f)Cdg8O}A~(B`uSR{(cLxjczGXO5@9Zd>!HTG|^O
z047savOU#cZI{JXqw7TF=qk17%xEf>n-{;`a&s4}#X{JD52V|Zav#J+BET-uM(}w>
z?`LsHEP*tuD$n?rHQ+Z{1MK?$pE=ky)r?MV5<tZUOSt>PT47dScH#^1sw)KqQ*t|6
zHwjP3)nc|Awxwp1L8I~sOTD<!WdUMB<4ZPY$;4_b2pgtlnVCBy7@WhTw8{*nGi|OZ
zrfO-OMBhSvuvMTaEPL3_PU|1W4^`ti!<p2!e5XXtreW4@bv$mLr(7Lyc(!)j4Kkij
z?#`?lm9Ki0>+gtmJafEdWFyL+yH80No4SM07bkX!50(^cbUm9*%Iyaarf^=i^5Vg)
znB@KP0Y9{fFWcZLyvV}S<sRJI700E(K;>iZ$U{zbs7ML{2SIxjgmP0PfBw_vMXp*U
zTsb*-!!EHd7lvAhL<HTtFSwDqfdI*PMPlwI@aI3B&61Iks_f@w_E-JlU0r)3JH3B}
zPHaev){raP*VI%%F4r!xs?$RH_F!Q<CM6q6R`@4AQox@(x}+I80=OkTnkKT9>;qoK
z_ubuH+(4*)?S?fPnaY8i$+<iB=i9#Ygo5ZXQMmnWfsd3b3$z&~h2O<f>E7-pN);M!
z;l8$q%W;vOV<uRC?bYew-Y&dWf@Z7(P8?0B90;D$4kB*Irk`(|i>8covQQ<ivwU#A
zEuQOh?t+}5;wGQ58tvzpmYiGQdX~TrUl(U5EZm@ts@wfCxh>|54%G*Lr>U2yfh>Ew
z=+d`ugCrh|h`jB8onsLQc!TEzIsz`QHIsmAb(-FyW|{xuCOe*w_&{zXkI&J(o91KI
zIB5{(z)~cn^q}uD4Mfopn=DOYWTjht8j&i$jd(svj~e=bRi&`>++~^%=hLhctIsip
z4-7U6Hdq{5!1gO-Rt&D=jVz6^1Xu;6q=Tc{c}naP!G_45KqPwSpaOnj_wc1Wf0aW?
zDo1ee(!<S%qL~MEAHnfYo$u|2aZ!9!S~k>;NK1(w9sh0a`T4WG7xEmxdrhT806W~{
z)J%$!K-Twm`ArN^kIIlxw8pF`+)LA|jKR-{Cj@#LvAxC$eMVEOyBRj}K`llNn%Tj!
z4TVgEaz#pWyzpDtbEs_No+~X>y?W~XS#dhvL-cV$o8aMs283)d(s_!;EGvmLIQlER
ztsS>V@7b0<s}*UgE#VOJ0eAqh!2vRg9H6R9b4%Rz^(C0@>cpqPEpp?-2z@0YJHQnO
z^8Q|a=o)sdu3r3m4P@o*i3Q)>DHo#>ZS}C4@TZeqDkZdZ_>MQ==pEg|6)i;qRvxtC
zACl-n<{l{60Hz^OROK9ueb`V?U#%|w!H=^s5+WFmghDWl7>|?o_$U}J^P-JLOg{v|
z+58fi(^)>)q7{9$cW~;Y!I$0dVQJ0Ryu$u_JB0@%5wFPpYR?t0(G`!CogYXvaPhez
zJ_$c|vUl~v4f^yfR+{cYkwGFZHiv7+Wceii4i`>{H2#(ca^DWt$IZ~NyA!C9wKvN~
zE$|5;gH|rvN$$)1JEl#G>KSZPFXtN<H=_1h)JR5uGpghcFk<qvvGTo@WYp_T>WG?l
z9P}TG47Uw}2m+Z0(Y&`-KdL;<qoSNm3J?{@HRO&|w>*aKoSKmALIowjW6k?H*Y2u4
zgsjwWK&UP(6@~KGT=qYcqbeI~KzVRC@`nl=$?5|Qjl$zSf+W1*E}_q=j6(RHQv8-B
zH)VtVYbCgMD}Yl{oP^PI$fYT|POQ&#HCZW?$GEuYxKRB@5iY@un}zCx;Tpi5SrigQ
ziz0TH2*ch=9|*t8%4z)`h2OB4Y!U!r-dQl_#?s0@h#nRP_;QmqLAtad`Va}&e%r`I
zSz{bvag#gdK%6!Xl463`XD5k`+z%M`p(zGvbPtKgJeo?4K+K)2fYqpiaEudy*be^V
z;Ffwn>2F2!iQj?vR}+VZFTje|v82T!Vhuq?%;0W}eW^&J_dNZQgH-f4Vw)Xdknf&E
z_bZW%+^_fL)!?3Q;GAZ4Yc~y|M_^InGXzG7JIr0tgQ3uU{V}N6n)sQBNyBC150rHt
z9=eC{&J+I3rl&==CPy*H-P6P4v)=bR`>#&+zU{frchOoS050da(dW!=$Afb*HU(It
zZghlTyi#w+y>ENRC(swM7C`GyAfRYkW|ZRCQP_RyPK(guAmpa;oo>oVY4zMC03}R|
zxsN7ch~-x$8>|FV_9DB=$7l>HE@LZ#G!1=H!}G~x)rL(ZOLzzW>mvNX7ok8DExZuf
z!XyOk-X~Im62bFXnRD_Tt%o2Qt+ZVY(FHm+h@*06iULqBC6+5#smeZ39tz&n)@PxY
zwxp?1fzv?^LkKT#0C^EBJT!(bS%_EB7CYW!Ztb9T{ltL_)vlgHGa#y;UWYi=7#0Wu
zI~VO(+!PjdXvg6+EldugEEc4XQ9c9l+{U0RY7?RnP@s4yd<J!{4xCt4zn;{zqcTVC
zBgH~Pn|_QUP|{ku9XN{np!(f6*1D%pqX4py^4g(aXoZ9b|L{r!qs^nSaZ~r%wOkq6
z(&53+g9p`5AOOYPHEsjumzVIz@|PN7Wxykws6TV{S7=JXEAP~QwhA5jf+MjM8`9c)
z8F-N}8@_XNYHYfQ4Ao@NUC}aIl?3XurB=As7p6;zggMG7G7*?UlLh!w3+Kx^CP8rK
zSvQY0HWTL<zPm`qR)#1y*PW$l*?aOVvpw_@<?<^1wWVDZuTebekT7G#Y4>!SWv8bi
zUhnO;|Aya?6wbeff;bXn!opGTru&B8OA`Dwd~bolu1b+{;c*%-nmMVvaewM~>U|u4
z8}@w%*-@kt!C>7#`r2+rui@bRYn3pg*czRYZ=W4hG#2;w%kKA^?tc|5r$zh894FXW
zvN?HD3AS*NRoL+r!n#^zarw*!+L!iN=78lkau;>cZ-FPZxNNx(CBUqX)XLmZ2op*2
zRYH4_Y@=X|_bYrzWFj9TJ{&gaHPxp{nVZkl;>LysvDgwwBUdPEFjj;Ghbrxm#qD8T
zXL=(Kv&-4y-i*j29WE{;<L-{KMxqs8z%pr0&NT~j)2u&CbGIarRZroeze8OkCH2Uf
zsD5`!Mvd8Xxw)<J@?Wh4`R~zC^?n^MzWMH8DEbA|1aq5K`Ga@;EIeq>^YMUj#t^Zb
z_LgipK+F>91P8~&*l?t90Fc69C$X&tb`|LeBd4lITH`z9j#mw8xsuXeU~BhLI1+vn
zhT5zczoH(ZOEhWN1qxcG0f)^m;4iR(n38zD;l@sUW5W+6h=9347Bc5Rr4_l+KP)S%
z<uI$-@@E*Bg_uPJ)wzTv%ro6Z5(I++Nmw}u8rmBtlPM%3_A?C4s=dX~M&MK3s2Ejh
ziUQ&{(A=!XMPTkFgUbaOZ=~~3hFW@w{zW(E`H1RU(%n+o?*K_-l%-<^yl7kop-QmD
ztz@8}fHX30)Z0I{#3_O%J+?rkv(?US!_B}8eHSMO$MkGef_naSi!5<BMDnb5q2e+I
z&%(lrGk<{?7>6T>v!VV~6*FU(g^cM%26TWzvuOy!1JDc=t307s3qKW~vTY!YW01#4
z)D52tLK@x$eHlvgROcFym0GwHjm{MURc8k^GJUHkeJE*vQCoq;Uw!bmN&V3&(Cp*o
z1goXukQW)5CBP}w`f-7*0@4fCgDfXd!qM>wEk2%)W0?ffW~0<*pP$BTf0|8D5z(Ts
zD_Lvx{%}n75&_TA!W_rR){0ORa=cu8QtuWt3S@|4O&qq&na*BZkk@b&jjt)Vg?(*_
zl!JlCAm{iIvAE;=!Ub`=b4^fVs8Hiw-;5b3(w<EtgbNSt=h%pi1BW?`6?qLYtDua0
zd7WXdYbAFOWD`g%q<~|TZvQ27tt@kef^&2vk+t1L;t~$BNa%vb;LBQ}%er<}mAX)X
zLlDp3B6Wo-(MJ%HXl+(4-06>C{nvUR|0O%!A?mr|X8fWlTK7)39{hI|F)gZbQG@s;
zf*jGnFdMUj2Y#)ySH8%Yx<L90-CXiFwQ^sZF=!)7X?6)b{WT`+wrKoq?oYch@xTo^
zhrtT^q(jqbr2=+^-f@un>C!>+V#M=*pF#Se*g-C!ug%RBtUD6&*u;j}-KlYC0bED`
zwCzP7V!q8x7Q8mZpQ)BEyjC{yW$}amKCH2?J#=W}9V}O9LYE{~CFZ*q_}B7OpS;P$
z+Tp9XQMRkOdBca@%MG_}!yVEbP54iF1uPE^Og{cK5o&Fe;}N@(7wTr8^kNC0Id&}V
zP1XaVqI;oXpw=M0SY3Sy#o)_1K}wTz$H&pSb6$RM2bJ&9N|!-j3z_QaH1}cS5UE2M
zz@4PbNBJ<t=%w!+Uw=um=F9H)`@Mr&ovsl<I82LOB`X&CJL?`D9Up!Vni~uek?bIJ
zY6htQ(*l%c2D(qj{Y*iauqM43@cI9o%P?qW6~nmUEnr%8^L?FV6K4Byg0Qgkz+a&6
zDrU81>i}$hm10>r(KyMA_i6JwEvLVGMrR|NM{bP9O8k%VWZ1N4x14IeEF{LiPkU4s
z<Gnbd#ZU|-8*(E17Y*E{p4V?a`gH8QuCEV<>8p)vkU%<dhvx0#I03VWjCJ@h5X;Ky
z&bA~%p&f-Mbd-@$&+SHr1F?t=%x3R^a=-uac#U`AK|lpmSNAr&e{q-($YGisE6X#g
zKLC@tTi(gPxJx~EQU8iN2ABh40?O*ML2CGsqk{#!2wSeOq7Mf?0yO<^|Ca2K-JCJ_
z8IXg~Mk!@c@~!|G#XamqwK9W8Qbl$I-4Zcv7;bLF*cBdch4K6eBx6EQ{vQEIh0~|0
zE{8coFz#dMR}sBnpl)G7qxFduG&Xcf01D_Yw-j;C=xjM>VNQz4d>9&Kr|Au}HY@tY
z5Lp-272}4u8^RXlT20B`*f9z+jB`1NkxIp;(APA-x)xkW_bePR1ODTrXSdjy`=WoH
zr4vkOEYMw5JNFHnf~p?_!p#wk-7=+}+1q3T?Iq=)q^ZeSt8bddR}IF)&)W*v<o-ZA
z3|Mw%Z-Y;<6RbSw{;huFu4eEJf+_(;6k$NYLjrbfPw{c@X#a=j``s63r-w&fh#~~_
zW8ZCTGD)Yf@#@<v-Cp*uso@_V{v?y_190*B|61QRe|^5bEuB(j$ZDT#R(fJF=;-Cm
z6<&5q;^A@4yW1<gyLWKfd(o?Vdt-&SyT`}fAA)xW*=0H(&X&LW>foD$!|x7)m%X7+
z7Z#LfHx#%zf{*^!I>KboXOHN!&Goin<BPkmL|fqt$TbmKoJjx3?YgJhv%PT;`W}<B
zBe3RopUsD_IadFDn>c|4@$5G?(gh%)C2yl85);g?v3}6y;!}cIFsZwPJ0uC+<R!Xe
z<_zMkoX&Dh%8)ZB*%kx51n4RDgVEE-I^hsHwm3*<sju@QIP#w3;UR5YfrWFo@=`0{
z6!#aeL0dpWYnaUar^){;W;6FJPqC{~VJ&c`8)=jGuX>jMSJPXDDjQ!07W80)uVl=0
zLN9)9VGum0TTZ!+9c?tdPBdHd-n-v+US(yuq&(dxcKM&!?<v%ze?2AU^!cOC`hQQ?
zr3?spwjVorN4}kG;%}ReI`_FvC$4P`hwY}zieLEraqz%W*1dQQR^&S$Xem%-R6XXx
z^^MM|<txOG8iy2r0-Sv_z|>v3aChVXm4F_zSta_ECN&LH$2!3k#`ZZse3wzOSg;DM
zuY5UtNTRPU6+ILXaIg-WkKT*=gS-Fpb*Ef4EmpD}o91hOnxv@3i@f~u{3z!L!T->8
z`|~PiNgn5RCQ$t2vB7eY@9%K5-sfP^)Ba9;SD_gKHLNHBb?e*Sh-MWKmwZQGfnlZf
zGr13bPQLKpCO?1vc>_AP*~n~|`90HNe*Uwcm3v~D0&&ngIqmH>6=+)`4FvtDo)dje
zT9H?g{MWTok9)^>yOAb*^SX5J79Y;lE+*0nH2$wYcdFAH3iM(rO{-l*k{Tqm>X6-=
zi;f!GzuX&R#L#ThzM|*~G5y#beTBV(Y0=3ps-S?(=nIOc!<+P$lDSFngdYeApHOWg
zvO*+ZbJ3cMEV;_YGl&U->amnWFa>0AHuuqdq?u7(x~|CJ**)3|v6%c6K%-en=p^d$
zBIo-Ht^P2;>%q=8ZfzW~3&-|smY4%lcMAQ1rE^$084V;*J%~ZUB>17^n)tz*LOent
zfW91(23D~ec)|%(lNMW0F425T!3MOk7~cmN@U*v1LCG*%(Y$;yhax5I4%FKf=!|*a
z?VD0ZJ}a}~r8m>~Xv(w<v0vrQvLisu96d=5Y0M<OVS+!YMngz<tC0$mS_7r9rKcQ}
zb_=YzCEB015oTZ`V69U$Dl%(;d8MTN#iuu)3D7OOF4kdrFm43q>zT>%%d>!tR=Kes
zn3_Au%{0Y~P60ldE@om{@)eDBx~)c`rP@{)$2)c0Ca!l@h!w*95z(cz29?AG0G53h
z7q^Dh1bn5&GFNj~EIM$VhrClhE(#tTv}(}ekytviy&Con^QlqHIjlvy1mymeb#nfs
z#@!!Ul`57UVrmOVr`|k{+@1g$AA}U+u$jr(kykyxO=GXUk?na1Reu;wp!PQjyW5K%
zL4kJR6UfcIyd18V$^>#_#?L(rkFr_Q^?dMleG@SEh?e{Qc$?xv%Gvlj=Zalu1;32<
z2BO*#W{gi{J|1Lm8R<sxQx}-B?Y^ND-=l#nmN0nJ-E>yo$@m)mY{50k3mJlby3Ud>
zpPF5$c`n>3e>J*yYe?KH613`40g7ds*!8IM+N0+_2!XG(ENs!x3GeS89=tevxmSCh
z$(T|zT>(x<ze<Sp&uP(ww&SPoZWXAnjXIfK0Me$9W($`<sbmB9>O-yvYqTcXZ0Rd_
z=o=^t$G1TOeSFBPYg<A>RIs?@CJRzH1d`L7a4_=1@aVY?FLpuREuyHc<WTIyPPW2h
z?T>me`1nLi<a<rkg*)B$e{Y6tmOPq@bP4xtxEmeA5}qvThmX;=5!sNooh16>pa1le
zm&>s5E0V)-_?Y&q<sRy=9sp-Rn7{6RZFhpxW@NhMqlcEl80&Yjizp(}@G1#qUo61G
zN1Mf8ajceDi?#3Fs}xfL1Xo<5o!Y%{p*}oL4xf&o$SfBZoF;3RquCk=+=Hy_PxA{3
z(4ef6%=@xC@GFo@4iY-2s8IZem%}uH1hK+`dV46ft)s}jj?UiDIZU#+`ZhQ#8Aq88
zp$8l+X6oR8w@8(NTB{%%0*WwUpIYRwwa?a)%`d}9_Tv}dBDL)8bWeNwV7LCkgTu4#
z;d6cJxbZ1&@q{}+9P{aKRhAn+Z*x9=l#r!<r!vSb!+;<Gs3R?h>utVqoQQ(EJ%)he
z8&tC?@M3qTS8sq>ymE^Fa~xC4GXMT)K&1)ohi;w8)__zt;omv%##fqCITd0>fE=F!
z8XJIPpTT+Rh<?nY!a4(j`XCxex5TQdpdwt&ahg)<SPC7xS<re=(H^V@f=$f|(G;!=
z2nZXS^-*X%oRHrHM@8#ycI&D)=xE6>39fVZef#rA=m`J(QF4*>Q*i4=r8;5Jf=0lo
z$3tx)J~*=!nEXb2L;Gp_xj&od!$GjGrEKg4D6dH|u06Ryzi1-nB#<BjM0S>E#eYhm
z0qoc3pZl?JTnJ9lX<=h3wdZb?NeW4zX6oJpW+(>ix^CU5ZK?{mF^M&3c<O1g-d}Gh
zx>rV3)9Om@;go6cP4k9}Lnd890=8ktK5&W$Q&t8;)C&KxV*!$^tJ&tB+x&8xU25rK
zitOs1?(I0<@Eq$*R}DYZdd=XmIS6jzFb?^<9d%t>r!F6x;$ZI0#Y^WNShO$~4ZGy-
zxTTxK;vrqM{!#k)&Kp{Dt5!xktc=z~9}k03=ohODgonW4dXNW&hM!^t4Z#0ePDEHZ
zvNx5HA={IKPBtzmwi|<u3EO-Vj6SI&L|O1R@roz9<dqS8m!a_n`0dry-KNY^iI-v`
zH4bpS)an9T5y4>_(+ruXyW;72$T8b|r0;Z;f8J!tbx_rw+rSH)Rb)tXhhc~jiq}XG
z_TmNdy!-Q~ICpWi1y9_SF~^IVhe!kXgO*<U!hQb*cJ6))eJ%PEoXa;q=0DZdK#a%_
z9*drOw}8q%t5BIj^R?YW{L8OT7l=fQh`9US&66OtsO{t5(zb|Sl@7udufQzr?k6XM
z#j-j4OyDN;ACc69PPVIlpe({BIWnP^NUy27-rPH(xj!h{i2MArkO0|<u{cxE5eZ48
z8}!~n!E1L^p|+x%2Wp<__%;kk4dPKn8h8IE65hrJg|3G$adTVpu$vh?*sW>{tOU!^
z<OaYVEwam2(sL3Q$;_4N?;f7Q7m{~OBW0{+(x2&@zT#U*UAK5FeXNpF7GfM1qcE!q
z=bxQ-lJhQOI2@mopTVMEp>aBm@HS+yTSk%CNX{?Llg&+BI+ZTbVoqKT@k->Qky}`I
zV}O|)WAJ%`lz1ua+2c-aVOl;{$D=0QnvxM`%Z#GmFbZ2UFPRKsF{FGuz`qQKo4&An
z+cr3?ZP4GEVz@A`lnrC3SS##HZz?af$~L{{ufT;Ze1<KYWP$=0Qm|mBcv3^(0;;Qo
z0p<9QZLUkr%_oy7s2A>Ah_#rcS4egp4BaN((l*rMf@DZt!9pH~?dcoMjY5|-?ZNrm
z+S-zXn)YXNrvV4^s!V^&>zxW@z9_8QYK&3rVy$ATg@Q2Lx?pt#$XgL=RPo-R#DZ-$
zTUWFeeg@Mh<RRU~X+FD^CooBLTfYP7b#z0bo-Yp_^^RX|Lt+WR;ehP0Gn|(*RPxFh
zr1X%10n<>%u7Pm^YUD5}hlRFseE9riX)EAkOfhlA>wmZ;<5_U75vK=472Ig|Hr36+
zDfLcw55GHDsjI$xTDqy<D0I9ar$cRI$L!N9DPo`KAjqWnG=S_tBMum+*7go|j-UOo
z)>$k2YaP6X9{to=d-QP4;Ag|t8^7&+R%}qL^^>b5`)_7VJUbcPI%26AT3~ipbEG!#
z-~r-`7o&^}B)Fs4md6@@XAuG5j>LuQ<Ee3E46d#1#>&EcVNzw`drQ43^%(%G8C2Za
z7D<QP+6fM3hbao)WFsdj;2ZrABeTYeLR4q1FA}4}600}XJgK-ztEmZLqf@c@X<D*c
z0jYcnp9O?T7CXY%l*VF&0+!m{NDv|b)e<nVs2u{Pv&>?}iwf&_A12$mPu3_?>Dmvr
z&b?nJ>)LABGX4|C{U%8<pC*@(ZNggtQjeVc>}}ScYbcK#8aLKAj>pkF&iJ*OLW9QX
z?w#X4ZwNwdw!|1S&E_R|V|f$-${K8UeV?qk?%<y->^}(mY#Qz6m$VlRV>ZKKvoCkZ
zDSj98@>W2i)KUZ(j`?Z>ZwO6Y+BfvOm9+L|oJe%x9=p||->FvvHcU)|;4mQ>Q<Gcm
zc$AInNQZRuON^!BQ-jB&aO(gcdJ~xsn%mjmbGO<Vk)x-#?;r*T7w{$>;}r{<>P>Rt
z?yA=v8|}c4Wp5{VkIyQ7{HmSo_6~kHd$xbL^Nq&Rx~B#glvA|%rEK`%Lcip5ND7Ys
ztRHAWKswj}4XK@&KQ_P2$7isv)~e`cXY$(8i{g!1GucTt4uH>eS4%vGWx>dzw0}1l
zO8yv-;^sewhKB6Wl;Jhea6|4RDu(@GmX7C>AZ8OxqCh07UFAb?!$?;nWueTzpVRlP
zzTqYNMe*9rLQTfSO^4HirM2sH0LSGTFMl@@%y1(`h7H~__gre7ricrUAM*Z>AiHvi
zeeqygyrDln{E4iGe)~RikFSEvQMWKm7Sv&%%98RQaCNC!J1z4*Npw`#q6~Hjm^lm&
zzW$P`$C^(*BYML`+!hkx7s;moeo<YDl{R(nGMQ=66N%Cyg^itHg+Xy*7c=>W{umOw
zlWmzzZ#f|+CF$FVnVTeLI=Qp#cn@9nwx3N<@N@c(B#}xpTu+^qc({E=DU7M^ied5a
zjKTk~baE>=)^h&|%juq+I>9Wk#*g^`o`E#!R}Ml+=W>xk4BeYlGOiP^X3rb0B%A%y
z;?9qI-QB~3{U3hizq=>ElWgf+!@g=~v2shWMpxPFz|H8{?f;o))7w_RL-g9=1Hu3H
zJ6N{hzFz{U8Bw*#`JZs@9nZUk07h@(sT#0++gJv6{}pV)8HgmuXP^q49Ur2f07_yc
zm9CYvK|u-afaV%s+Q$kVux3)*N7a_8uYvj%y;HTg1!vGd^UmH6a@fE|oF-R8cYzO8
znsdkHEM;Q~6@E7nh7%|^H=g-3r0>8H<3KDHt-v@%`qQ>N|7eS8`O(&8QIM9&Ps984
z-Q%qbC%?lXhNvssMJwORwgAlvY_HPh<E`L5G|h}LhnXP8O#7gX5qEG6$oqfXN(iJ;
z3eVXQ-mu(a-SOXM(+fAAku=~Il;jAGC36ow0CNK-OlNf6+BVtwjL+kUj1`gQVCrha
zf}hoGjY@PiUvh9s<M$kyLo5dhx-4i($mV!H4xF*J_P2ZZOl7W@yJtJy{r$6({lo9}
z4__p|nvdMkII$lb9DaA)Jqlx$a8!{f>~4@7g3zQ2AMl@H=5Ybc$b;JiB5a+gBjOD0
z*G;B&B8-~=E8fdj`=@&kdf)eUL<(d%2!x&+$P>K)V9sLXZdm{;vF)YF{ya?}oMSRm
zaMQw(;aiLu1X4g)|6%$jD+BILd#;4_az32pdzS|o-wW4^b&uqYmAZ}1za6?g&Bpv{
zcIN2#@TmL3ajDQvu)GJc{NJ@3crOrW&_2@f@3mK;*rt;pxk~tM7Yfq@5@Y2?M$sIy
z84xGUIN^)2drwYp>9#-&>7mV&35Bm>AJvC_3mO4o0gSU7bcAny32s#SXHv){^>1%6
zAm=?84LI1h5B_bi%h+>3mo%CWo&k*}8_*xT1=sJlU>C$To`ZgCnlMCU2I&@2F$+2c
z4Yff1YGCenXm2+gLI>Jnr@j-vy<*x}0_*^092>(QVq-3i0KdmK-S+Bgl7M64!$1gi
zN^!(`98F}iq`Y>_XCTT_Szwj`;a`H99F`z+WYbTlgVSj`E>n!XM-@dkVSZ80FJ6t^
ze<%j5>ogjtj*Q*??@q<TC66AZGq~a6M{%62IJ@2ueBCK+rDsQA&xR0H(ALao$sNYR
zS|}t|>|XpiIB*io_QOq&1s7;A9LX#jO^T^gqtwp!AfT5B8^H#Hva^L^@luVRXS=v2
z{i_9?(-rvGDqgdG?<2kibY($kZWV!Km9X4u=E_EZ6H=4E5(dU{7Tia|)}fh{1aJUO
zK!MWv4r~G(`?~wG3o*=e-J%l!e!*9KevsIqvT-rLx@N>|XvuN6G6&NU2&80KgP>mD
zBgs6DrZLiqOnl&Rh3y$(l-Y&_?_sWsIdlLc21RF6^p6ym3f*3!$xy4CGOz>m%N1EO
zaq6}(RE=%>p?FJeAMZX(%JhwE=E1PQ%Fzf_23PqsL#G7MqhkcFso8ZKpmRvcEi=lt
zfkZDVGB{%!`A0$*I;C^+pGdwX2FZyO;@!UZT{h!G^yndAy18xZzd=t3t#>M7)t~=_
zUn_RB#Fp|w0-qZ>$F33W$FVrsAn05WcA+e_shN;FnOtDl3}kz<hHmJ+-8J#*A~yx|
z6f`7N#<+dmLEce-cye2H>8?+JwlX_8%{CRMUPys5)da``FpQ*K_ZjRnQQu&WCjc7e
z%@=pjo>rx%z)`|kyEN@dCICC^dDSJYq$2_9m%8?05oKL+-XYDQfV`7V@-T2EV&t(#
zxT9rTQoW=+mme6fvJDv~X$NM)8!o+()Z@-D<pxIZcJR}>c8&64yEn^r^5<XU|8rAl
zfmPK!WjZG#{Gai2pF-%(^RRS|uz>LcQT_Pvrw*f1W3EYBq8re@-wEOYF0#vljYzbX
zrA)7b8wYLv$4^@_9B5D<O!-B(M+H>{VN&Mt9~85Us{qh(L;gh@>K5*z0Ge3q$`4WY
z!w%^Yj>Qb-eWb@<vMJOR5a!Rbu)zsfjNm3Cj2ov;I^uAr2u%<rJUK7vf}<U~fRF=p
zbCv=&$k!&sZAfgdJLF*a1bTqMOPI(#vaCTj7l3|9zfxGRyI`Hn2c}WHEraWlZWC}-
z9=O(=95X#}6dxIO*1FGjc6-lXe7*Ny-|W9UI6V44$0w(+zWwg|AO5lyJ(*tg9pAjV
z&VPPA9F2>~UmZ2f-`u>t{Uv_#;iJcY{L{bx`G5b%e{P<wIeBm{Q1&AoQV(`8+ZzPo
z*W@Zha~$rO$<6$ZmfD?%^49I+uv9gW?cgJ)Pil-a(kCefM2KP$V3t5U&z<kdd{!I5
z+Xv?GG^t%eFR5}|Ek+W9t@b}Pcjcjfh{^8@$0L6IRfzFRN79e~XdlPtb)gU=kQ<@!
zI=3h$uIfK4SOyhD37A3$Pt(soMRvi@Ch<VAb767lq9!$HvI)(Yw-LM0{r8J6l0UbT
zU*R#UVA$^;J%k5n!htLW)uXs-XqLLMcH~w>=PV$B%4K525|EEMEttL3uDPom43Nxm
z8H_Wm7eZWs&MX91QvLY=fz%Tvw4ySU1{1jzE9Y1V(Hp(7(37StdS;Kr<Qo(SJ@}pc
zA4E~lZh@XEv@iQP$on%7@;!jiO85wBYw@QoUIX4(_!cp~-P0M<5*J2qfjJZ(0PyVA
zAa5h7#vUQ|!5e{E#_l_JimYob(m`QF?w9aG&`O<XJvIt1e0-eU<l{k0bU)nK&i!F-
znk0q0H5`iq4TFY9D&>oVRffYl95WzhH7<RWjryYr9@Nfgw)rKc0#M|u{M~L>fZF8;
z=6_5%^tu59J8Jo10w2x7uS~3}IV%fWt%-bO2bz*0;|e3a_Z{a$c*3v{ga~b3Z~_t+
z*-7;cI&Z2*(1GI^#j)UBq^vc}$M8Ow;ZV$(PqFjN2PTP$&$XIQ=|ub+3*2lm*grh{
z=GD>JPIu?)-r33CUwX+O@2zxd_I6u_Mf&&=tOUg*?6=Q6>h~ig8_|<-3O_at?<X4(
z0UQe$7R?&&ehB2)vS!zx4dXUUyK(m5^uq!C{L_{r<<G>69>mR}X+)j^KKm4xfC<IC
zZw3oeo~IW6jhv%fq4U<9BX3mrM0^P5KdOxn`N!r;ApM;!Vohk|906zuM?*S-`gfA}
z<*FG#%>)edHO`5U?`%}X;W#+}Xop9$`K6<sFG2nw3ZmcZxE_w2->R}YgTg02cVu%y
zrQHEXUc-5EBNY=x;O=#Uaa6MC6a~VNJtx8Ox99AsGU~wE1s}dM3j8=}&Bsn9D~4|}
zci?zu_IAbatO7gQz8u@U@z_EHPeRch7}%jou|{i4KnrkQl4aLt$f8vR;@E1NKnmTh
zlhx&d^r&0NgH1utbqW*NX7m~W^#&S4SWR@BU|<piL?=EV+L{VtU?vfPkp){}JreCb
zQ(j$~#>Y`m{ZGjCSpV;b>uir#kruxF{6C%;euael)Xn@ZGV;b`a}(k-+;D!>X6`3{
z{^L*a{lLxtS;(UTGJtYrVX>Y_8!2vBs`M5fzk(HurvHl82BpG~AqVg$j%Wdr9Zs=W
z)0?m%{4*rp2u&;Gb-$S05-@^{A9^H(f3A7b_>|c3w!qE;ko;8H2s4joPB@;BxZV*J
z8Y^LYj0IDdoRa$Q`RrUj+1>f%a7u~z8uHoUI8U%iBIG^&IV;Q`IN~s`A3ZLvZAums
zh;&On=DHib5o{Q<%$r}r#4YWlg8>e%2lHyVk*x)D=Ts04po4&ywQ9P&&2@+W;t|^z
zXEziNEFHIW!aP+NBu&%|lU`dqNIx3hIApc1ixmbZq6Jb65h!N>LI5xK?%e{Uj4?`t
z3X)!#3*d?vQQfKPqYQ(;*tCOeN<!+lk|Vq~aB&^09Ap#6xFnjHEGigN6{v;XqdjOP
zc&w9ToJ8-)aar{980$=Iq99;%ha_>R%O+j4G8k(;F$H7;FJGOU0%x9&^S{p3>Wgv=
zS?W~u?ib~4iBP)FGFoca_tw@H9-0{<5s8-@iiH__&#RI%f~-NayZM(S-TWo_&&`MK
zI1cB;jAl1QvbK4)W`@1xrg2pi18Ty_87Z2!&>GcAtQr3N3z!_t?aR$Coc25@reB^D
z@BlwTZLH0vS+?07&;GKOjM7^yw3)1(LVRNAod8Ps|D;Z?nP$JNIYOXtmkXyvQ$yf9
zo)WkPEW#Y2xbV+mHls+vY&a?F!e8tH$+nRN0yeG}$w?j>zrz`p__6SHcY!;C$$vo#
zlBGu5BA+UWtM#LR1{`;X`EEfrKf!m>Cal2{u2DN9@UCRst+8k8UQ4by9a!8$pfL5Q
zP%{uff%@4xO>$i{zD{z@NQE{^&F#m0?1l>Y6>i{{o_th-1kn?u3N*T-V2Y4I#Smr~
ztq-4MYQ>O)?b8xPt~CsB;b_QDA8sZ4QvD#&N`!9Lucj%4Am%fvrblr*v?okcm}D}@
zFA;@r#?iFg5+(GBk;tzhN<ZBBBM<3lnYSZfYNVXOe&Aw2CNTENmmDXwMN1>dRfCH&
zc#B%m62=f`Db6?LTWk`fn-`73PUTSu5UzcZAiv~CMeYM1Y?+&)I2YOM2FedU#CE{M
zX!#e+9#Th&K?#K`H#TaL=8UR^VhKHNF$?t=_$0=f3K!guaRH)NE^J1RAyyg61>Zpu
zsxpmHQ}+h^Gz@Vzau=vgx51w+*_bd(=k$l8-r39E>DPz5XW#aYPxcNEI+a&t6X9aU
zl%F$qQuo~l;A?*7CRP7R3F(yfl@s?t^DAj_dB(0w|5o?#`7wRg{31qv>l*^&C(p)@
zKX{NFV#KWzG^oa2rNKdd1y!81$zA-rc>tqqbT%*3D>I6h+2|E~vS7ONx6z_@=Wmy;
zE4&r1E4{UNX<>!VvP*CThYQui&zfJHkB9mAwSVUo{@wgMO3C{4j{9qe>Aw2xAcJ%@
zv&#6lJZ~R=XU?wBBFP`VCc3D2dWhj<!h<ZApf_KY&Mn&<tmjJ2!Gj{^6g7<*3SOx_
zewLd|eH9^XktlJc#>B)463h8+@7b#t$?o2Z-pT2?PvdqwzEWG7PmvmB$WN1L@D6Ln
z;DiwTK1uso!x|>ZI@ku*gGAyiM^LFC(CXFqXU}@i5087mRY3iUzwJK9kmucJ!JzL*
zH?@PVp`#=@@g?nKaXRYZZmbAQo=>R$>)j@HtN6sOG-BL(C}Wh79Rrg_XV-z;v(B7u
zgb{3Lo-Wy$3N@P`-C&sJBLIyu5iNYXO})wwp7&w)7V<Lk@f)-TIT3)`hH;C^OjKh<
z=xvb3oKP{oRRlAXt*(mkIE8T_itm<jUsGj1YFic*{M6YxpdAoa^`Jn2wDNY`#|Cr}
ziF@5?{hTff#tQ2YqX*z`P#&RJF%1Xn8&9#UEN5uIGmbJYZYhP6_7^mOvM9znJpwp@
zv0P2Td*)t)>|i@<)<tH?4dN2`64tJn=lictzV7btKfqsHcP&sD5}Z8>P4HX0BWhD1
z^KuXdHE+a+9;ggw&z+WZ?HWY5m*O><^<X@@pupbm#Ec|e##>oJlaO0cBh`7gBBirY
z16+*}<XfnuSl^Hr8pXFd<A(RfU=7Gg`Mu5|Dk!~xqb=5}Qd=wL(>?>4XAn(BiZz^n
z&LV`!s{yy$C6m34jG(ZTF~rJDF;kw6Ke81xbWQcf!oA!Y?ESU~%}&a{aw;s48-dtK
z;L!!1Ek|%uxHx7|2%%z|63xj=+(4cXvC;`4D2T)BYph*y1QKr|bqK~Q#{g;OdNtv7
zeOGD#d;^fJ?C}Dw1#Pjqf<#fnfo5PfrlR4QVIO0L)upIO&P_Ug$>PLDtIdo_OX_KV
zc*AHzl*<c@jr@LfLjY5CKAvZCKDqcjT-~DJYR@P5%E_#lwA#wLQi`bII2uE)DK+W8
z1zNatied?xFB%xfo8h-3h#tBrrl?I}ooM3agJPVafl?o!wk^MhXF7hYJM(E-fDxK;
z9HTE@;1?WBEIT=ys+5KrBaS5PPm8iNiYO+yD2-EQCJ`-*f1?cY9P@I7cgbss2KK~E
zIW|sOa5t0Fk4E`ST&_vOV)L~iYYwYMo4E$M8F##9dM4wC<Lp9#zAwVpq?2DliF&sj
zV(e79MxPa2bI2;lG&0TnUCi3Az@I~O38r$6XPOISE>$!H`Fk7|w|>Q_RjsFBg?wE<
zVLj^*<^3kxq&7B3>D$fH4PcWrpmm_^%lyi1+%&@nWy=mvdxSfp3~rK2NyaoeN7%8A
zbM3}D+$|5EPX;E+F|i>f$nc8ECPBedH~MvHjw)l10D}c4GG-GBEXI|$PZA?F>;-L+
zHq;FR6fvxRAiE1@j8geEm|CEzYrwuA%aNHldU6uakmG1>GQvl?r$Lv~jA|ATDw)Z{
zAiE3liKfULirYb3RAuZSK4~bX2F=B|EVyAFO&Bk?>_#!eeTWcU>&IR|NqzAKE}x7q
zMb-t|*S4NfDp(xsJhRGjR*-cAnS<|veTAIS_a>d@VhBP(;c||KQHIvcC0hv^60<gr
zu6wlC;W$AJ3idWDZ|oXD{OE+8I>d+?5mQv<<T#3W1vZ|gLrBRUfGPKsJSF}mg!4Br
zCWm9t<m-?@+L3kU!2^Ucp#dQsZEbA@PsAOA5l8Tbcb!&(Ff0Hh;z3eCXAUE<s&6bs
zEs5h0JM5>43~1tc38VIEVjQtO4r%oM8;aq0*Z|hOFmOyG4k=(FXaHNlYuOIho55Nw
z_;RBiPv*ymKl$EkU#$+7!*4K1!@N=#gTt-V1>yj~Ja^|vt)_Jkfu%<u0!_2-A-0*}
zbH*xB_o!H^@L9EF)jdgOFno^e5_J!ORS6$~>&QP)iAf6I>dxQl<V90|()_HhfoR)N
zq#I!0@Hc0(X?}I(*4(5UCvP6FJTh-3(^>H)+cZA1k>S&%fHpk{<}rK><oBkBNWP&(
z$6tea{88ezHfAFTQ*BjgaHE|>6wc&YaRC3)52}xW&z(;xN6YvK67N(O@DTdTe`{>U
zZfO4R@Ci0$>Jxr1;fc^9j1N_a8AoF5ulQ6%#_){VbnyX8zwj-aknuZDxX1wDBRTnB
zK2085H!}{>+i~gH$6HkjmIv*8`N8N2n+KJ2Yu<>+`d#CA{}_)qv<1`Sf8462Yj|8O
z!182F)8eW(kA(D$t1q@*dBoB(4IV;MC$}1f+Nlpsr8gk-tUDM$9NVc=qFX^GCB>~N
zlvE{{iBn_{0Imdee2lU?=kav3gm@gdLV^dS<e|7$8il#gMmz4D4zrmU!N6OlDqA`x
zbBDp@i>!kIbbB~b%;e$GLL-uRM43D+eU1|n^jSFtVb=Bl#>N;Op6d{KLFWWx3Fm=)
z@QoY821Q^5Y(pf1AozsRwB6IVDOr@N{oU~%pilhzYl2U}Kx+#bxv|m?qL$~D6b1pU
z%El5Rw?Z<-ff+VT<SH9G3B2!S#%*9_20<0+;0J>X`WI$dbRKHzYJk%!*^u}o?d#K|
z2q-PwQK7nSS<Xiodu(JxHy9Me+PWjb+u!tlApacxnUL>Y$!uB)-6ska<%vm>28rVM
z0OI1<<mUAjp)UkK5kk|<w1EW4nJzHiA2httWOm!(L5-_WkpN(bmd&ap>Z$ETHj9N(
zAvQ}-Fh~xJb)=)r#qLA(Ti1~+F*X-fiV4@ZM*gfuQThH%D3!37H(_zDPq*d6;wI3a
zgWYyo9vU{loSYJ5Cr2P*WagVZaCX=6f%e~nV2H28q|(Tk{sC!)1ED`s4z&%Y!H@$?
z7WQ^fc<jS<DyhCZWN#MiHolc8aD<HERrnDh6{>4ej6!W6GY8W#f(c>)LNI?rU=I`m
z49z72a9|+_LOMw=@?kzhuN2zd5N=M=63KluO>;ySLI@#uS(3L5tUzz^W{qQi**Q-!
zg@y$84wH?%umqSF#0k7mQcTGB9A1ToN2hy-2PbD=cMo>mpL>T?8tEhe<#KJ&$~{dC
zkbPKC82(F05l87b@3-`^H5{!HLg>P5mDeBzg24(7Xz%cOdn@rdjBCg61-oC!X}}A;
z{)cj1yePnb@Ne@X1usFn(CPXghQs+fM`q)G(;+l3u<;ZPUW09HZ)>d+tU<V*Y&5HU
zAAa5nQ~9vG13ZgE314@;f0eYTYz6;~r*=D8L%{6zT2#`pgj{Df{H^<lb4;!?);1p$
ziFV;ZPRR>Qsz9Er5Cmohl9?Lg{~YbT##C9^Sf3#a;ZQ)du5YrBVYN{7USP!q9MG^R
zOBMcTO}oP(7=}=KCb(84owD_hmW+oL-aJrEpcb@k4LSJvto5EJv<c*Gr4+ep&gotA
z;U2}r=vGQp42%KIi+Pzi&IHKE6!46i2S$eg7uz_;0$mh$xx$2rOG>~U2oZ42BmElT
z!HEnkhVyEo<I$=ad*$BY5)LXJTw#2gB#ZF;W1pYPpa861jRgsvgEQhBKsHQ+vxd(J
zJ4dTGl0+_|x=xl854#4a{u3%q0w-^r-9U3bVK6Aa3uAu8<E_rvq>WS*D4l*g;PtW&
z#RP1sLAITHjH2h=(BT<(0I-!QbmUg$Ot*OFaJP5%YVY7QD8fi@KTS3twF#&XrmwXz
zly5>=6?!-v5r=#5fEErWj^KaqzP0W*KfbMxn=4bYM$<tv^=SOY2cn*Hv3H#>p&w{0
z1fIbqRJw391S4;zp@lSK^Y7tH@FG2pj9A(gkrZti^l7)u03Azv{5Z(T^|VDB35%c`
z`7ZPmm{h=+fO!DVZk_7w35QgU`zz2-(5(&9aKysjZ5z2gknQpa^XQ?{5QOIj{LUWl
zHj1RcVQVO?$`(!<nL;g3n2&)B|E6m<f1=OjPu>Cj2}HB|Z7Y|IA2p!_Lv_92WAk?7
z)B>toVQLY<HqGw+rZXpxS1_h{muTK<<y)1hM~W)ND`Gf?fat^*OEODebJRyZo?vi7
zZKV=u<J5!kaQp<sAdo;Vs&c&QTtT$WP&`yr6WP~gI?7GKb@8#2Ygsb_27craiX;{U
z&)H%^r2c9Mv8Lc``TloQ$v|Xxyr-zb+NZmzf+}-5uJTh~S9PpLDFaTUqe7rmr@7uF
zJ2l0g*+z{d+OX%(Frl_?=dBkQDkqxaegE_XaGc)oLhGQsB1sw|EQv2Z_^D`OPvnMD
zxvUTbM{W7fcx&6<ltygMyj6emP`Ri8HPE>D>!pmSaQi0|G?+FTMGcyINqxN_FMwZy
z=#U3GTEca+zQSJj54*c(NBiBqgJj!(aBz6g>m<BFegR4k;m|0Hl<y&jSP+!v`weYv
zHTRoJm>rI9mrC%c7sm20qkP?9$tqGOp?XpJrta3Vya`*=3yN;65Yvr~y&j_uGi4z?
zS}GjZTs-7=!-yrh(9nF%ayeugKnxACL9GQLg-5uqhaEEb^<~JBc{@tdR6G~7s%u?N
zi1ln3Who|ZcZeu4K-Gx)yIv1#Uoy!!qtcth>ubL+I?a(fT{-?aIJx+^Esz0&J4fSK
z$H{e;PRx$+Zc<^64Wt|YWrbk67-+yz>WWfZqVVE)9>vMm85oYaWM><*KBE2fJBeZ!
zBu5r89-?=RtTSs{$0{0be<dZqiA>SWF`pG9hz`TpL-Zkd;0T5nW#JB5Lg-1L>{8t?
z)IW)4Rk=(7UMs{=!>#LC^n(3<)KOmbzEZN`A}lJq12VrDR^cnHCY|v^ve#1Jk<d0B
z86*ek0Xm7s5cJGN-?(~@L25<bM&at}+N_nKcd<K15V7FHU(~E7kMPqQVs;N-J=^bn
zI{D_Aqt@vyEd=?~{;r0Z-$a9SlL<wjA<k?g-&Ys6mD?(y4}OJDT@!`;E)6YAJB{*>
zU5#c#%L0n{yV+Vk2y41@-OrYACVb|TF{bCxTMb{L&uiEc4e!%)rRPq<{e<>mB0*e*
ze?FdM_OO{HS<0Xnm?1Tg#_y6J5!E!ZBeM|8xKSM`{9`jC^g;g~g{6HruttH&d|AVt
z%$!!{Q7GeH%rAd@+5O(>(FZU17CYPdx_f-`lX8uH(>A2t`m8brX?N?*u-WE2r?t-@
zV4=hUIX8?ExPiL>LU`&GU)&#Wol*-I02K}%(=#ooI>KS7?$<Vj6?XP_!SrzUb?^Ij
zU||nLcDF$AHW`XO3S+4(e=~cjY_ffqInAQIUWwgQ#`7dvT2BFJU-xGHc;W7c=C#kt
zS*0`DpvS{Oi_LMJfIql~Q7J6dHWP9K-VjbGEf7zJ9CVyKO%c|xIgm}D0aT2fUyQTT
zM=5cQisa@R@X}v14g(iCRl6r$b+oEwcmB5JxLN`j6l8gWs42yArB`OfEFGS4wy%f6
z{zr+$_}xH|E(1pXEQrttY{6E2DE@ugrLepd(lqA=hiw~^xA8Dwz8WneQUMSEG}}ou
zY~2pdz5MhkTyTG@^m<oB=FLapS7CX+klILms>Y}&K`jeX37Y$8fsPOX%Gn(d?9#H>
zCzM}%3FsYg9)siB{x}hkfZ|Hfe;FC;<%*{<#&HFF$8#`&Pgl%G#84odOd6uFI%GcJ
z6C`vx$$ihnH9!b1;J?Xdb40jAtalAkQOjloj*3=N3GlH<0g~*=MQ_gS%|bb0z471#
zb8`FHd4l+Jb4v8aIMDhLa`YP~Ya@Ocj*~&;Ab~m^0Ng@ylChx-tDQ0T3~K{LSctUO
z5PUkmEFxqxv^W2Cp1Vub!?Y0sNa=wI4gPmZnZfj|8W;;09eQ19-f(Bn$2fL?bd#yZ
zb$n<oDZ4fG-JN8!HYIsasCJgrzRZK7CQvX0N;?Qa{LN;GI>PJG=Pmx;q=UL2vq>%g
zjbJN1%P2h1jf5~+Fx`ZvgOU`i;H@V`*cz0|1beL*tMOMY=7Vek6)V-bfMo0U1HfI#
z#EtOjx@b%qvY2k!CTR|Fy9kelDeIe@C=Q=9G~d^0dEKGFayT?TBGOH(ZV@3go?2;I
zM$R><{Z1u~aDkVuuf)$|{UH{~xpt$T1bBw3V&f7>Ss7j{?_0pEX9!d^i_t-j0-5Vr
zX_VptWrH~RnhuiNylWxnu9lprQ1FeoBs6M?P4gdwFyF~973#ca6%k@HuAwHAI6dI*
zc}J{)uQu7pz?oHbUyt&)^im7TNEaP=%u4F$45{ID@gUmgfj3?Qjn(%~`{g*y6&$TT
z6?4qATqCO@Tnz}IY6yKYx;5$+1H^UsU(-VPu?!U*SCubRyg-LxV1M{BRDp&~D$sB!
zd7;r7#@dc>?kab#UsxfN_Ib^OErrxhSf=>4n3_?&?a<gHl@R{Wyw+?~W-|DPl}Bh2
zyBV50f&d#WF{XuutNL29KANp_6*={@u9x6&vcNAD-zS5^NJ$mPBnKITlKMbia#L}Y
zGN%%j?2*D!j}+CrF3#X}1E+!^<nc%;JxGps0OX1lOihfG`()~L?rA!OKqOs}2ZL-=
z|A5x0%z5c?(F6^ic+dLotCvT#4(rEGPCGpAt@~QJaQzr=BlDG;pIyF~(<dmZcZ_3Z
zFLGGQ-OPa@m0{nZ5N|deO3`{8Go_PYd^M$%Kw~YzKJ!~ifc2%>Zwl2y-74@plVEai
zcq-65xJ-C8aPCUKm`>*ttPSW$<7bf5oFF&Gj@pJcReHI&WoQ%10OIr;CstynG-|l)
zxs+U0_c-LFZh6)#o=Aa=fYPY!PNWE-x(G1{7ou-N4NM)BPU)Sbw?0EUv^C_MPDulp
zDl)!%ZEu{<zH?U(v)=pMN(T-YW^2f~rncPEdxtw@Y5|)<fGFP{%{tluTRFw@)TMgb
zpsQ^l@)1<&=KGn_(NhJweT>jOZV|!eLAbk-<w@$mcxt=JDCtHpV7B;CHr5wgXs(s&
zrKCIBr25u<aNb)8jbclHMfiuNieRX^09#bBSstOXs=>!mwNuTRCIpX0CP(teI()iL
z_nP6AuqFZ4RW9k%E5v==h1Y?i{?EYcnu0yhZ^;Mow5W!CcnlXhIxy$od=i%(y>d`u
zR%fgI8_yoTYhWRe#$gH{jm)`4He~uXt5pEv^1+mPPWDSmKIcfX!)O1+A!!|+-j?fu
zu7NGjpQLv;B5!J2T3nhNE`w$yoNT6kmXBm+fy%O&Ol0gR;i>v?U5YKGH^O3<VTE%z
zSuhx`<t2X-DhPZc*H~z2!E;{{R@=hV4U0PB?eWGSAcY(-55yyVkvT<%3UGL(#{UfC
z$STN_bvFx-;D%t<N&gQjK@i#+C%ewPW-Zd=_;z-kduV;6<$H)-#x;h)CuB1?i6^;b
z&4!nOkPU0?)^S-daDOx)R4Du5B>+JH{?u~k51Ww@Aa#e=3L53B4iDBwrK&d~`b@9-
zU;*!-2v^dtTw&}@dWH&YI$@6GS_Bma5u>=9XSX}dGdazZr((SfeXm8}U@@h3zqo4c
z@1K3wJwAZ*7g$W!o;$i2ZX*RUvG@aGuSv*|b-j}$5Y`D@%SKqs`1QEB87l$78*5=_
zQJQNKPC%ZhNfve=jR7d5w|DSucRywx!Z<|w0ZO2gz%a~Zc<^!#WAvrXN$gQin%fPm
zRM1K%ZnM;+&AUo#Lr`R0_YugHuiQ#M$3|L0U_ev%Vb44Falbq1q^+BsjR!6L8+MM`
zuJKxYnjJ*R#GY?CO>OeHVr^w!CIyypM|_1%z6@LfA7q1{&4;fc)O2jB^#S$!#_!*U
zJO4Z2f$%V4pNJcNePg`?8^d)Xo5rTXv`~?D7S{uW#ws<c7LO>3+=lIk@~+W{7OYr+
z>LRaO>43xr_$F{_d^9(PW43Y;3G@C4muf67I>!GZo3ZQ!Cvop^x$75YFq5V0{(gcr
z{IFyjVw{esv~`NMSg7K|TOalB-kdq{5ph{Vyp5gH@6YxQ_D+3F4+u+7lV3&wNLkpP
z$e<g3m``mVL1PBNEXEgzp5roH_CktgA0=bgB!qd;Pg^k!EW!Qx6ap70x}E@?$hD7|
z{o+Fz1A%yMWGktVG_!>m+61`ac)``&2@-BsGc`X-f7pMn`fU0pb$ZJM8c7SXL=b{z
zRHm#^-zO6KCPPHVWh7+Q&5h+ZtsB8u1V}JjcN?g_w+K*%M+`lFl?XsovK=I2e7Hl(
z%)nh(S09G~JYZd#%eRBZOUOYUy4Pm61GapCjfw`LD?!!P4<xC-9a!!q2L0+dy|HU7
zkprO=iQ_QVBO_aS`7W?ykIJhb_YYs3VIWcOAhcowy_{*t2}qFG0bfiKR07U8D2c3{
zuMM(``PEvx&Fk_sagqc2l&K+91)JY?(#AzmX3_iK_Ku$&p7d5~0ZI_`;|2~6Pxp3K
zd;cayGh@^M%RZ)sn&BmA?!HXtLy`=1rRdo&Se)9TN#?U#FWcjzvgEGSay)UTZg$yn
zdqnP+0)KCJ*1q^d`DL;uNOE5#7Sm;0D)mWOzBjg^<a6yJXfxR~pCiGjaHs+xkRVQ@
z18>O5JyP&zcNDJFI?B>6)(1<cY?p#3$VtnBT-xtvlNsv1G{(&o6+JKDiR+HmFE^oQ
zgRJaN^9#{nUDL?)@j3SWBI5_$U}m1;q7v+;2S=v>FiW{8Ij$QClXB8Jw>PUhF#El4
zdrZ{lZGKh=x9Mr75q+M?wCQmoSbbWEvgvUq&+~SeisdmFVRv*D6$P6Itw`)n!5uLD
zaw3l)P+jJ4p%uh*=iQ|=Sy?~qKmgYRAoG+1HldU^!q4Lq)D))$`EjD6Ui#~I!0_QJ
z5TWfexy){`H!42iWG|b!1d@)Hz=6xyy)V8X4}~T5DC*4^&=w<fQ_)DE<vt7nEYDQ#
zKuVIu=t8OBCF)_s&^Go{+tjqE^6Qvv*~Y2>cg0ee=>?467!|CJ&wtlxnZcdoy86oE
z)6%uw(GH=HTD?**L$27t<3Y0?pr#l(iex1Nb9IazB5OwiT_D0)=TINaSnf;AA4A23
z>6N#WP@R|#s3PB#qFXh25rG;QNKKjpk3-2NvCZx@qVasHEsACDl{W`Ryon4KjAYZ9
zF1S5QBPdA`x|_TBbSrxcK3wqOw9jb|!1Ure0ehQ)gOig)OxW%#RZH;ctz9WCOXHD>
z({BIgV7j}Zb4oXoEj<9d=ZXLu=w`_U_YrGR6|YOKe-7K|h`~I@UeH;MaW6QBGHJVe
zS#>`#@fSrU$D3qV&uGN5Z1@&EiBBoqCEP!yL@-blQsK02fa5;E$BpwD5j0$07hHvb
zW6buur@e!nA8@_N2*xH=Fs?xA=IeYi$+Sj-Gz#C0=xCtA$-M9~znV|UNXt)da`&6S
z1KpV%4#LAgPeFVKhHHgu1=DdNO9_E_5F$YjTg_O;^W{?!llYS}?)Oal^%ja@+$nb?
z?SC{4<C#;U5yga*TV`-<*k^i%Ql{=Mm_w#2q5WOxTjIac!tLM!BW-h8Sz&2pvzSmt
zh7UJ6QE>pdFr~Z!aGp;!YCF9FC+sALxc~1UFa@q}w4j5i&@s<o3X#3{(mq8slIs=&
z7V%O~ClDeq&9N*I)Jdw;tROf&T=8tML+jmYdp;sXl5S93kqyBJNbVEbqQeq{QU<La
z<pBLpQ*WhI)@#2gCJ+Qg=lXIW-a$9wH{>Bi48XK}EyVol;MGZQx0Okh5C45R2>-@c
zf={GLrCQN6r3w|0*aZ!Es~`AY=VSaFu0Nc~w#Ys7Dkf1Crkn>|W+jW)c;v}QlWPRs
zC?7!F1SE-ISO#~DUK<mP=ijr5+$_eW!?MuPgUB?@((!!4S2%JieVwO}F>T<Z;Mqw8
z4bu_Ft#N68hxiIegCeF<R7ar@<lMOXgv39Z7@jNMew+<=%TE)@v-b=7XMR~XQNMl^
za!GY?-5p4m9Z))C<ZH<?s`n@ANZ7H!s)8FMFgkI^;{s#RvZ*a<HZE{sO!+b|EU{hd
zUVx;;pbX|d4^BWFO*zO63c)o+K~Lx7v1(Kt_9%x=reyqjG?B3v<#nU|S>%ss4BoWV
z;;C=+<!m*Md*cF}Tm8*1FDAugi+Voee$Hr1y-9sXLaJS3?v@&7{Xh&AsCi#eP(o2I
z`cV5o-Z`@(DAHV^dWP9Jj9c_?!4cxtY$1CVJ3ttf<Aq^yaACTugRP4}X)iYkrzT2k
zQ1VV3vpysWK^Ml%2&4JpT^YDA8s=yH3RMgALd!GSnr3geWGjTnxtE|b`7?Z24a@L|
zH7UyjYEgy<=nwxu!z5bwL2<h18*flG`r*C}au9NH%JdCL!UIfzLuP}x8_E!<y0@~g
z8J4Us%?YO4UUmw$bg+q=%54C$#p|3(R89k0p>m2fBzFU-<kTMQv5hWnVd@k-L5$c5
zXRqu5!|vcEbFWBSU@p!f#;C)f8^llA5@H3nK3Y#G-2oRcY}{T;2qdFhZkC|w97{Ly
zoUiG5lTqx!fNE;;b&>}O5xNCjc9JqYP&3!HXH9<!#nE%KM@)0fK4o>PYlnsJ{mMg0
zzNDW|`|}Z52ufWkmQ+H6u-FeI#z9T=uu5274|7a}iA!5frke6Xh%Qwb8Kz2LmO*r*
zk*zw{Q9CJm0%bM{;=5xCr`@6kh9w>gU^rar7Gw!`9lzd6_V7YLzI7|j@nC&WSjbr^
zRFb$@RK^|tQi_PCL!=Ag_XOaFH!({TWH<yVt-`&8&lKY`tR{H>e)1W7u9r?bI{iVX
zt-eGtdd8xDE0W2c1#;E`IQH$>66Vpzz$<W%=KRcbt}tZg!^816ZW`_@$^}9H7T322
z3T8POr|RQfsNm(yOG-}KLaUdkA5v_wBi<nQ+ju^rUr4j&GaJU!++%J7x4G0g)<^TP
z5NMgHg_RIT$>u`Pjg+wyZ?~Hv9dqEMY?@<8Dtj>WxT4e}rUic=PP2Z-<rmQm%4Rl{
zH*01;=8~Fq!@>5*R;b26$6IS;Uwl#|aDncZDi4kr(6ZT<vYYF&VCzO!3yqPyh<xX#
z0E*s^q-{*h8S^=p@{y4!sG38Ez`XqWBp4T_B`4SdugfgU2MSQMcFI|6RxHfLyQVB9
zJjW;-Tk@D$!m;Jb9p9K{SLqb3NV3*9MA$;@(KLg$L>B~c3~y?Z&}IBv;$LePB#mCk
zGpjYg+7Cxub`Hj+H+1bI%m>XwDF3#oV7V%QQI{JXEEL+dDJjwtB<j~VYd2_@a?19n
zKSIS-J%J))ODQrdPvy8P!#T)nY?aB!XPIJx(D$fThEKfB`VvaENG4wxkq~T*#3uYU
z4S)qmUkE`SU{T`p&%KuLU8Y(K4;CnmeJ4h#1NDdRWC`pPa+AwV%{{2X@4Mx6Ea>H{
z{nI@(qo`?wf?-i$mpZ5y94ko;iAH3!jdr~P%f(5((FM*7LBg>}!6^-Tg{pB*F6*a;
z$da#;7Cq2vf9^kSC)<)!AKaKNBAQ=+73yfa22eNJPWt|N74$1L@Zj6<JVE|<@PU6Y
zK2>Jq)raeZX};nSYlrIlK)iT1+tp`xM2l$4azR_csdcRcfBP=Y6V)$yQnGSH0?c_#
zY<K*q>m0*4e|?(l?C<psP8mtYO!NY44&rZ6f6#vu3rSB&fcVTt=mbKOM^3=k-8x)N
z3nvMm!7@)9za7l^i0A`yJS!w-!V0RS<F(Ia%*2l$e$v6<7?zA&H2n^<vaiD6Lp9|x
zHA)1jwYtHP1&8xwww7$){dK2qjLQ_|Kyl1hg5tUIQW?V(;2fV9Q<MYyooD-pJKywn
zdAB>r*@eT4tpJ5C{f|+2E1hZwBL7D1+jmWH9|!eZ^aD$!b^6-bb9{GbvBY#Rw6xTi
z;y^+R2SPQN<`)!8%2LRBz041_JlZ6)K^6}3KWldqdDN(Vh_}hOKX{87X=}?k)Rkih
zl4n@0j`OFDq$XA0wQpz)H5#om%}-9VQJRmv2@N$wDzuaV@JM=<<}8g-*n)(-<DBzZ
zuy_~XjB^*!8r~vn^zv5KwJOtiguZca9bnH=3s>E{UsZ_;Yu}tsZ%^O_A|k$)QFHMY
zybcGa+gf9Ikzq&5AU=$N?`T@gQ1ygqm$0^*oYepU9*`rr&Rth+2z>L(HOUGdPaV!V
z+B^|DVtmVnbjP&D{o#C2r<b?d(p2_#GR*rqX~As*X85;1|L_0&kBSy+7TRO>Gz5Sy
zG{1qdOz(;KF*#w!y`%jf{PVJ?xD01l3@*W7!}x)Pw!DRQyoEMA+l6`PNw7kpC_uKo
z7D~w*ZTB_A9e3zoin9*SsW$>B{XMe2^#+rmBn#m?cQ6RVZoiHVSQxXwhQ2ZkBC(Mo
z<jS0OYP~&y4r-yA?}a9|m>@}U_vr}~eq&UspvoN;xtAN8yfHM;&@JNa`ZgBF8+@j5
z%@+;1lGO^pI>H^^2Ew4XX#}a1fW4d#7tK`zEh|6d7dOjFGO|RA(7a&svfQ~^RNyC;
zFt=rVY5|ZX!{CV2U3h4iaTI(`5?k`>0FU5#^B5^utH4Xk4z&ba5KT%BhHS?e$fMgb
zY1)C%NGnQoXla2Y6|^Wdk1&EttJ(yHLm3embGMtHuDGrmEt(xa9PnX8cNZDbJKoG5
z+tjy`=V?yyC~WBT?Xi`lbb=@P=E(pG#!nNRgdTt?+o!;uA--ojw`b8hNZc8mYN7K-
zTBO(?qtpnScw;}Vc?k6DITtQLJ(5<)+r8lVk_Xpmz;F*oh%?{VaHHH{K}_S|j6qfc
z*Cg~NmDs&L(;^-sAJJodfKt}4^z7uU!g2_I1+2VQ;6QU%DPG6;{CK`<7^vXS*^?-}
ziAa}LS)Mq}d<{Y))J2*$GinsXP;DEa)8sPok&Wofme<M|Y4?Nb44CfVR-g#SU$SYz
zn6JE;FP*4CIh$U^!kKL+&opjRrwjYyuOl6}c%nAcIoQWcCXMhw&@okFM1$J`#3qt)
zAO|0KKlE{1%tN3cwO)(dMuW~y-P0!+$`%^AYaZ*3p<WW8IH0IJjX=G`L#4Aa_o`hO
zaIRFc!6T6}vcLb%?R>QW^>+L)-e_!<aRmK$tPv6Q#i*izhYbLes?X4G<RTq0`x4>d
z+i1Xry(F<4gEV6Kg}puK+$mpkAfAzQ@~CtGk_N_cX44tyMW_Uk)+0(!NA55T(!-}P
z;K*9IpD7xGILyr~Z%`$GgdvO^q(KR(%}X+@K}s=FDn?R1+dn!y0-}BP7x&A{?)Tf4
zapPQsLHHYiWzg<P_oyQR7x_v8X9C;qOJDD<m69?tnU~i=m@<K(HO1GUQb*BHybNF4
zP4ftAl+8pOynD3Q@#Cp!_N(Ad1I|EOR{#fu@l!a1mU0E~Gw)UqYpQii$Td$fsyJ1+
z%1X3|f(f)k`2bnU02z*Y+$zin#!SXYfl%C(Uj%ijOtWG3CLPbjVdJ>eRmK6KkbkFk
zUW#L3k5SkjB?AEz%$uxsQp8=;8AIlt6hH(w{4BSH3x)ehRmaE4@zJZ3ua)9pB61!8
z@6AZ4GI1j>zy<{17%-w+c#nr^fN@DGg*R?eikAX#KCaB^XUUTKAg4LO)ixL~bX}3G
zJ#r@w+JFnZFA+9k5qIRnjRnBE`PDcbev{pHONhI>^%Y3E<6H3f-e9EmIvo=TTna;L
zYD^Q%U%Z!&{iAfYp*y;zkw<KY!TqXJ<Ol&T8xITLcS_ooZ4Xz?YJGp5XY)*O$nfNV
znTG8@blf`R4ZIaO=5>a2<VJIox%Hw=e$4=82n)i78z2}7d)JdE6RxZCQs+Ug_Yj&m
z5LB!hoU_K42%MUva+Cqm=G8?p<Fc+}SeDq%hF;2gyP9yt2G-Lt7B%nb#9Pv~(>p$v
zhRCqy&1%SQ!!k>i@uo-`%8s?ZQ)S+cbA&<f$UTGod6CTmSp=yc>}Bna$jZ15&<;g4
zUTYPeIFU20PyD1>N`6l1_;pE|BJ9<zlWj+QynvO?Cy2u|%-(wbRra%SI?W44jwF|}
zeygO2VL52XMdrnKttsjK?`~7F5$4R`J^)fct-n!Z?-W89AmDpgT;=`JDv4~28&l+m
zV3YT2;MXJJLjrmv9@99EL+w^l4<hfjr>|`xB#L+C%}0<b4r3VC&^3e%azsJc@RBpi
zr!!Q*>kSg*`sX+g>_h{C7O3HHW>G^8ZJDeGG$NcZ5|{CVzNw4KAf|`0>zZ{CJRtdH
zV7b65U|>46X&4k9Z&KF!5w%6vaNX_ZxFjehwppW~QB5qbLx!$9J?I*U!NHkOBrTSb
zYWSIk&9V={@CuD?c;hGzj({5ORcqzY&Und+%NYmmaJ)@mM|lN-Xtfb&%S|jkti_wc
zG(>xGOkL9I<(%6?>_-j>n}bLMCq9Tbr0CwbL`A<ppSDpzkt8cIp~IFA3Y0*6bF(6;
zV1q>AhC$ti?PRB-n$r&%S&f2zgU3N_M6DlO{}{Ct2D0(+!?mKz(*(4%@1|<<o%}mj
zIDcbc$w$&t1CM8Y%7nG$aJr>8cTU{tar}aiFQc>xo8%z$zUa;o*=mbo>?*0REHa_g
z!2)p{DNmY#dsfa826AJ(X0-27KtFK-V71!gHOBQOnY%9`x|MT)MLdBHKwAZI8dC_u
zS|zb4zKl49AdEw=jN35rL=c70A;B3?-qgKZSDH1xy-+Z&iPmgyg?`B3+h@0wH`EwW
z1TMuU+MQ6G?%8NQ%if;BTdn&+ADW2t5}vRaST!E$_VOqY8*0I>D3GSQg8`I!I8F0m
ztG<69(GI;M>{^TCup%cZWNrQU=%>zFcdhdXYg7a!5nvat#s$j=Xw2=XRpcToXPb_$
zoRX=|%6By@MIni+tW}MCe)vsria};JiRmyZF~Ll;x}+yBlAB{3Ak2liUs34qhs`yC
z78X&ZqrJe?cFZ*&rt?_IUGJ~kNd>tzD9=<wi9KHm&If(DS6UB!`7tK0@gbF?Ak%%-
zz<FVI=M`=%BRH3|EMwpoX)2V+N=`Pa@psio)mpaH1m~*U<`WoI1z>UvyOaQ5i4&m;
zOS4M33e-qI0Okr->}Vqy&yEzYjWB?(*3;KTNz%1GNAL}}QOrEhr9_96<rSyr&7r;<
zNMDq^DU}Cc46<^pVgx;Q#0Nk?4VXa>I1XTr15vIVa_(9oz3{lbtcQPHfQATI-8o>`
z&NvYwPyrvs@$+GHG1o+(WQuZ<-i$q$;L~nfd%R7$(oNRDHS+LA#+%<O3v9hwA_a6B
z!kRs-6qd=r8(a=Rph?I4t2z{Bi<A~WW667({dJyCgJ2@J0U$>BHCH7=*OQ{wy^U;*
zg{(DA`n89K@<Ccbz`qGvU&a0egy@fu7PT+}wn{oc7X&vI9RDLykO0Kjv$l%7@ILo_
zL;6U3KcdbL4q;IZwSG3GORBL!lpa}1EP~>r?lzP-$eebO&1RY8^_S@-W51Qfbb71z
ztsQ4I;#II4>+N1oDlJq)jN+>}euGG>U6(iwe!Icpd}g1sV1P?5LL<d56%D!&5N&*_
z_WB461%c;9Lu#x;86<nyq|1CtkvP_n<EaaK#OW?1Euod#$mKAuc0mYoumCY-$1(%N
zDjVB{PoOau-(_{JeD@_;w=PBMW2u7b(tydkpDkCx1+*-A#V)ZMvCxP&0dw{cAAr1i
zk_L|M2uZvH-#D})IWK`LVUcYM&I>R&wE^oTZ1$d_D=lM{5;{?&&Jf%`_U<Tcu!cu0
z!b7S{<F<PvxlBiZbgscujERtID!jN;%4`VMAs>b6ZQ56W_sAVS-trFE8gqRpC7Mk&
z3B=r^T4A<;hoS#I<rJd^lX}(N3eB(yJ`SfaD2n$2ow7E9eldRzN|VUDXyS;ok(*DF
z5Bje&3LrgD__3$?SXE(nP9%+~TPrgE5juZhQmBe)(sJgJxDf}-xT`po1P@774@NtJ
z`q!g+rFixg&B25<4+=CuI}uA_Jnkhi=s}0`g)Ov!nu4(gmu$J%@C88v4PVCkaSf%D
z#--QR>NeWr5U>>;7n@izR_tKE&^nE7ooZIuq?cHgtAz-G?}b>xqKV7291ga9KP!ME
zxUVy+QlYXYlZ~Ws#zr8I0%M%UnqOOpp9W=ka=l4QYaVT7O;(fOSy*b&f<=!Q-jT~z
zLR*Ur1rLA1azu|XdiGH}co!CPAJN|$j1oaDNi8+`JfA{Qq53y${(gO}N!3#u^8TTV
z-E0WE++-^mj!i%BW4W->AeV2%CC6Phi2B2#m|zCIl(IsglJWY?%7C+C&Ox-L+a!e7
zD-CcYceB&Lb1JYTl$S={O*}(^ycq~L)|0Wy?P6Q9`ic4k>dg=BAcZpstf#iPFT9Yf
zU43a<L7UM?%wmc=qRt~5$k1B1o20aP>9Y?+-0f@Lc%%@(=T!kOPT6@6j0`03I|l39
z_w?*8!`Fykuu=YD_LMxi5RF3~YK-Qu>$4KoFF&IKU@=8!1+8KlK9CL5iPNAdl<>ZP
zDyrCe*9?L1Z9^B_->b6K*w@000r+`mPxGtE09<?^?ZR=p;fp(4e*={n$9V}+;z4Yq
zUI<&3+)<>l<{G@5Yhx{_6e1M|C9j@sh<A6CUtQ0*=;S59cv^-*F-8b-;zW5fveJ&}
z!D>e+J}h%wkrP;u!!h$+$kl7eCG6<-1WRn!_<4XjB49o>TC_gHr#keNeV9W{Ya!}+
z@D=>5bmrZsJBJ4cy`9tE?gu#fALc+;7EAzkeAjnBDS@@6M#4oIGg4<M&;@Ku^U-{m
zYPK}|5LiH-m6|jWMN^EuaTHZL&O`~$nn?t|!W!{#U72=Gd+roYz@CE@i#*^BwWEm^
zfTv$fQzyoWikeZB5BfSJ5}SLdP;S2sB|%Z=1gI==Uvw%d!e(WmYc(QNo{A1`P4#l#
zl4oQpFmV~yHY~7f2Kz-gNJ#e^BF209fWjdqO$N7l;uM!zpr9(|k#9)L3wq5pv;y1J
z6S7@qf03Vg=pc&78S)J0vxu5d_=`Z%0su7h(8aSLVT-d$M6?$QgD<ue3y|FeXgi3T
zVF5ICe0*FDj*ntu1qy^nwz5u03i$NbX?a9LI;If;1>V13VP&7S`jV7>UvkoqdI!6E
z2QSXPJKj6(MOEMbR%M3Or1qeJCzUshkMwJ!(D2Hi@ls+9^{f+b;JXIKgZIb!MSq<_
z+bG|xiRRIUlT%!l--&6)A!{C9I<iwTqY3fIQG^eKZ5!Yfl4CpAGSA8@m=>Fxe%e%(
z<)R;{GW)2cVkD$k0}BY+17uv)XM+CTPc?pjmoXV~b|h)sM2h)~Kw@pt9!Q}*C>E)c
zbdlwnBY3>CG<fV~in5<;t?Dktlj2q#L)#tij56qT$=Is<sG7<9+q|r9J4Jx0xCMlj
z>jIh-MH54=Yqgbhk=jGo+q`1#wei3RAI4@@Mn@5{32$l)V-8xTtPrlrCLGd<m?(Ub
zk$4MHh}a2gO<QQiW8E0NphtTRxv|3hIGIl@<Wth$7em4-eSBaqxmb$+=`z(nVxIcx
z-pk(MEAz%j$S+@6psqV^t0<WZh2Z7@B7a%lSzme>Fy9A+OD*<X!~lgl8v^F6P8+p#
z*NAf+Ary;-7K!B=HenqJA+}{cmUc8%tfQwD-K!X#j*91XQM@)D`ASBoh2>c!-v!Y&
zPEOjyL`#E1;!9Ab3S$zaOXr^Fkfx0%titQO15pERP-Z`dBJ5>twqX=GN#S!MQ7tqG
zVK~>rPc}PN#{8{OGg-bbKlF5&34{}V!J0=1qRB{33tWe`PWOUfgB1pkV~-g}JUmSs
z$t6=n6Y83v`yxCE3{1VOjhb2-qS{y(xiJ~#j?-3CVm$ANczlMRz*dlP%In@9`rL5=
z0C)(pE$RV90jNCahte`xp2b)v%pZ>Y+%@B4G%1zg2?Yb$DzPVEk%1#SpT)~t4gZc;
zxf-3i${Nc>RvR>^)P$A>C8nY#1|SShrnN=+K&%fwkSNHmlMI`D7C~BXuyZI6BA6^^
z2xh-)UjAUb!P?0}2JzuaB*0An?cW@IqRr?8Y({*Mf21PLyvM0R%1EW5v8^TqaH$dw
z=k{!rzV^|w$~nlljAu^rrcHikiD?<A_p&Pp0sCe`R7UXTq^JvmASf#26)FV~OsH18
z!p58hk)9MqaV}vLj%s}*1*O!meb060uO^{+lk8jx_Ss4fXBKg*#^7fYMh4l8%upC<
ztN0e7H~*9+B)DX0G_Zu7#`Z<UpSXw7*$3NT@owx=5Oo1@F>URmkVkSNJq|@dahEZO
z28V(cB=`ABExsbPTiUcd*Jm8j>XOt|zgMzD;Os2tBUZFYMX5-HX=y4rnOlv75kk<2
z;&{d(*Z@b`;B<ZRFG90Jj|OYz@U*whdC=>CJOr(iaZI<jZks@vc1wUtGqOggVv~b#
zB&&d&e3#p(EbF<2AVE9>$HCHkEL@fk(cUi0x${!1oAFf#M9l?_;!DMpoUL@cQfyic
zqpc#aBKxhPt-=eGle|cgb2@f^f{7oU`}lN+Tg5-xM$hr1V!bQA<RbrISaLSj_}<;q
zXBzd$)31+v-QBa3?(?2TYIulaOOJV3Bc#MEPIA*lhvA&Rd?pqs3~`k#Rw6b@s1%@A
z$LwC~T}xT3s?4iQ{yNJh2?lDHgoS`Z^<{6fA*oX!a$aBoI&jw!j)hUM-0MCnB&f^V
zggIK>ChBYV!e;h#1Z>pS*^XjHgG3;NCH3EWY|?j;*b|94OOCDv(ib%%=9p>#2``WL
zQtH)2ulW<ZURv?AMnd&P&r1o!EUz(Vwt)EH<Z4)4Ag~VO!o8u)g_M)-vgwGb6-?$+
zcUeMoK1S)4EAWCwX0%AKioY6XH)r+ifWP^zEP<O@#1{CGMYzEF$m*wDUs+1;OnLl*
zr#_1Fsdp6Gct^16+-Vc4#vpGCB2zv6&7seIALq|i@X*xBDvrejvm*t=sKBt*-SI$m
zwU;}Ki_9D`hk-~oy4Sryhn=Cz)~Q~+S+GuAAj>ZfEgUb%i@p7pkBK%YMGZaSX|LF!
zZ+vDnuBvz$%tB)rFXM7k*P4y#Bn^W{*rKREex@CTvipja6+GA|Y~MbKTs@mkokT?V
z_LLsfch`j5^Wm*kwJOs-o!;JQjfwpuDlLS;XgpT9;>77&@C+zh_M)JH0%UjTZ-qs<
z2?6h~5B;|RcXnF@5VDTwQM9C!kqs6TAxp$}Cqo{WCqv^*FbihGQJdXo?n!DSfY)tk
zhL<aBZ8p8FZP1L$jJSDJp<_;)`6%i%t#<;ZstJ?;JSb*xPcwQFr(b=zUPZS)nO|TT
z>5RlI?tE-J_nvpSs&6)_h_a)-lCl41z61-ry*ZADzU5&MDTtSV1uLnF^rF~Ovauf!
z8R-c;!K5Z=H}U{Dg)Z|Uq84%(L_Q_RtrmmFh`k?-qx?Ixmd*NYZ+b6fS^OY9`WX7e
zxkD6mM(GUm2`q946gPy$;WDOf1PbtivEtGLgK&mxR>`>6Z8|N4LV7fSNUcI8TdK#T
zW7GX6jHu%TNa%`v2s#NnV|H%3)8|&PBrk>LVW7#y{rAv~PUna<ilQRo35qAG-fspR
z4QhKo|KaRK@1S?Qx3itR;A+uYB?5)~-QIpD>3x5+ciii^*AKccd(CZ~oF4BTyx2}o
z>@GJyzQ1>Jx}EHUdvMvKCq4J%Nw)mKue&E-Zzo@;PU>Cu=wGN&!f{)rZCZxi?WFg1
zl20woFL>wMJ+K41ci!avmELfR*z3N;Ma<IC(#PqqZQ)%=<V#=rruW0ky_1t|V0D|L
zyj=c9cYl8yiUSL|wt8>Xf!o-Ad%@lxc6VV}x^!UEVQ~7A^iAsICot9FK{slRLEUZo
z$;Sg|M^qpilMR)&C2w~E+_QuVz1i0CMuF4yGX)>adC4GcFJprn`41RQZSfBrV#Zx0
z%M6&D7`b!@^#VFW5L!pStuk!{#Z?ZczEsD;fZNPL6}-r1HyMpm`So}ZGkLX~f@V44
zTx!GN$VE5f*!@(@qv>lvn@UTH$>((sN`HEmj?wXyeG>p~gTT?+FnrfuF_3}PPU=BH
za^|rs5Qy1_N_FVFyxo99B9_c^7|uBtzB9K#a*@v%U=6Pdy1H<AfteE-DN^y&R}#-h
z8NpgnTYQ;v`&?X8L1?jDuE?An*=2s39IFgDNfvsuRl%*UcP~~Dl?KHeHMQ3Lgpr8G
z2HHsxw+JizmQ(%1e0~_5xWNV&0O@l<xTAst@+KoZCKNuV44?#<@oIIFx9lAHf@?7I
z$|fjB5cBFrkd2YUgx7vPra5gv^>JW4K4dF;62d4M-WShXictEL@H?(sK`xG`FlQL{
zTi%ZQ*VAHL%uBcZPKBLzIRCVvjS-g@z5wJpz#=7A*)6M%0Dizb3dQOLV;b^UCA107
zDW?R9*_^x~>bNN`FM(4+yCaz&MBg+O1rHa7xHab0DF~X6YlDo;CP`}X$qu2QV!lwx
z%rwtRFDIV=Y&c$2V`g%niXF)Py2u8EUn60j;jw*6V>Dmls@&G6gz7`E1#dD+{=rY{
z0e7l10P)!kc7<ehaexCw=T~zS%k$YNoq)hdgWOcbLGJe*#WXE_<!(V*b$o{SKk}dP
zqHSrLeRl)FuWzGWj}%D`pXKF~k)6@VWKvEBD@s0SVSDI#WE-gOyQbqM_ejm<umpJu
z1E;`z`RlLAXU5o9iN370J=9F4MFVNk7}`7tgs+M~t-yS}3N7sBu61|axDz0-9#w7A
zub{oL)yw8hcz7jnh=@nv6vRzHp5<ny6n~QqA}uqao2_9OVMJuz4ldj*E%ig2ip~Mv
zDOd>%YNRkvx|D4EJA4N!m7jlUgAOaXr#0sjb5<Wl5sC2P9tcju+~aG7DZ%i`apv^5
z!Gg1Yf0(y@{N`~sg6yh%s&_gWraim~h#knLcoO)*{in(Qw7kgP`xc4;{F?YrPL8@e
zJ?RG{D_Sj0q&>i}K{t*d&vqrQTa#DoW^o7vM5iEFcW+uiNr@Hb+dw|**m!lU6@!#x
zn_;9TetqObhc{Unr?s?VwtgR%3Q`S1ejQmFqp9CD;Zm;|bLlL|hN@WXk27G?J2eSX
z)>pPA@)rBaf(IXfy<|!u%N8((<_n<@xT3C4s9WuZ0nzw2^^Vq_i-Z`y!2(ao72pv)
z)o%quyvEH))CMa_$}b3_HLqrhgqP`~C)F>b>zKl1nR|H7+OB!i-qH5U6_YOCDcYE>
z3i6gfzzZnVAl`#mJfC3rJBVa><wW>#`f6aWw6~koleIVmAC3#b;~$qfz{w26F*yS9
z5v*q4*9uNS20r|do6E~n)y?~GX5YZrTqZliIT~U=nt2%%M(Jb(+Rv4V%G2x$%yY}8
zTpGZ=3cn1pOF?k8%#9j*No^gINp>2ey0SQB?`6;dv*}q5whq_Zf1HJv_k0XS0r2SI
z)06ZTD4w4E<Kr_BD`4LgOT_?q4BYVr22r9)Dm8N$01r{LjixP;o<tz1AnkTI!kE9|
zWunD6y{=m@Hvq*%w;nu&Pc!4dzi63)wWS#-E+Q_gtS3{p;skICheRnX-H%w=pss3|
zLhyb4P&UTyI6D!t{%f}-izWnzanEUjrrsh-C!Fd4d!0{yJm{UC?Hz&j^K8F&z$hW`
z?4+2^%%kp7o*@nW_@{?IJyEg2afrIO%!9+--r39U$!QP0m=L0h8{lR#D5^sw;`)w&
zEAYOWPE)k2TZ$;R6UY!vF6RB$8CT01=Hu6loxy-dM%$9Tr^pw`y3hMfE8P!2D1Usl
zcX0Y2ZVuo7^dykrIhlxuMfQ{_=Fh9lZ79xM7?6Dxbz8O;9Mh2ce#6lX!VM}DhXTHp
z$wMC&F{U-O93QTQsay(Y5YY3~5A<V5XVXt0n>~!KCf8>uviR-69gwvq=4jtsDxP5T
zteu3n9)3d;rlW7K!ej9rrWMEBl+oLR+XkcJsbntvcU>yUadm{$#52Uqn-EQBina<d
zuBpJ4#Vnbin>b(!luv<%3@UR(C3Go@K~llR`A9>vkrt-ABFaqcR9c*m{XC$dR>>)c
z8W6x(Y*k?Jfuo6;)CA(2HHa9H)vxFJ^_OsXWLLjB0>g%8HRCI1WIc^D?y3yK2X45|
zd*eQ^+Cj^h(;SJVqpb5Vh-SD0d*}d=X7(n?o&T-O0`t@6<H2X>7=+4=xGnYh=?(Zh
z(c!I_|MbMwmBZ#i>{h8E0sZS%=os_Uh=ynAC5nGgl~TO2|3Z9+G2B*Rqhk>M#avL=
zin-t_s~{@@+fW4;fgkvWSV_!O><_F%?d$a$zq~;b>tn2(cPlbLrYZyeQ^OL)1mkos
z#~Cm=$8FhqiN&jop4vny(;6f6v~5Nl(rhdS22a$PsriA0R5;a@Tyz09Z-if@cZvy$
z<$8^HB6*xZXr+fEpo;>k(Ne{;bBTM8BJk6oE(_QZ@o}lOi85G4@Y~x3SrTFCN}_NO
z^wW~OUmVb;DB2P4gHzAn@t9{){3Wo2if^-0%{&gby9^{YL<rMZJq(~`?_=ez!jTIu
znnpPSm^B3F^1OToI~ew7g#;VF9v3%bU1)f?vnamL#_z!<h8IMGiia{EZAguT7|DjC
z@~U1gT;Y<bH=O_WJBMIKuuGUUO_1k&TAbp{T7H6F7{(dGjBp<AM%fAKdN05<4tQPD
z?83lvqmHoamzDOiLkdawDg8@XOF{sY%t8bMfl+T$tUpzEa!&UC(&MAk5{zQBTFv1k
zXVXzz@#@)M>l)Nk#hp+wODML)Xrt#F?qNJn=lHtTe2g*beeS8PG=Md6=VPf^&K1W{
zR+I91K5k2`9!y14T{MVhjbbKXGB9ZU-sZPe0>WNovq*mgd~ufLIA{X!&tqRG8!;i1
zXUNRO4uCc}<WF{GB!{a~OUj7Bc9^ID_;HpHaOF!J_THvY^~8o?z%_IRtY!}S$j_SW
zMdx=TA3!i}^FmMu7-Wx4_-rwdoLfJm9X0tm`GR_IzkdEX@&F%rVH@8su3Bqj^yaU1
z*3d}#hpmlrtrDrx!2UaKyg&Z@lOM&qy3DlNMRITAYY*=6)X9fgd9Ic#@+vC5FNknn
zf$@3K*6xm5%0b?row$!$VFO_9hE9#;M0QT3jTScX`J?tm!^-i?(8C_yeQx_U203@?
z7D7H<*f%`eLy>i3ka@Gt&)%HQw&Ov@Eu-ytkhj})7+`(B_-<_reaQ{y+jQs}iSmEo
z5udZ$+Sz{v#vq#J!C`lI_xRV~v#+}cyC+|Fzv;Q|A*>}I2Zm^*C9{Z&mkxe7@r2&&
z&~WhbS^la!7&a_jNy+v9Gq0qK2k8UlP+`vsVO~etA>K``%)LQUTUkgcC?+|n8K9Ca
ztUiZwD?tqM&>8K<DYw~k!Jos;BZHY#;#k6Bap;v?mn!Q~YPX^V5`S2qfQE=%$&)0n
zDYGTgAUq3668}-9Y7U}d^6eT>hESLlNZTO6(S>wrg<&>4xHUiyfYY_sIpRStZ+Y5#
zyFu{$-FQhDaG}R{bPGN?BGbwo?R8%#%mXy$RXQCYxI9H9=Ti@?-vZxad7Zv?lHs^;
zO48Il*MWrLwo+`^347nDFTjkGYBZexU5?Po-_c?)R~SHvrH*A&C^Sr*lPW8)P)&)k
zYPCWcnIKCd!I*h(a19{yz3Ub{4Ay@s4|iJ-@IC%xzbIbMC+O_56aw4UMrI(Gkx~e<
zposFZJJ#YIIw~fV&K{~)Ag(A11Jd+$`X(n7X-D1R!|VBAT@W0a^dFo3ZuJ_gxnMmw
zv_eQk{n6pKTE57!TMQFkrojZF6!EGuInO8Oo#b4-2k-}Y7S7S)caHbNxrlpoD#uba
zUNEyaG=gp-i$)dk7{vhA3~9`@0{v0bzRRSAAu{qZS_bnfMW#tPOy6W}j26^I?oiAF
z%JdjSgW#SeCU$aoum;{NRD{W&MXExHK#((x+JzJ*TBmy)LScsvW5Me}t{1}Rw~H-+
zlXTZkvk67kb9kyIC5WWCQRArj;iR|!e48(zQ(>n~PorDMKkXIel)Xd^FP`jozwOC;
z(TfOo*-snZJbK>U+t)Y0g9I>hm$~J;O!Fb{M$PNN+vHYco|8JB#i%ecmc>mS971D<
z-_io$jsnpn6pSm5CrD~R^$Hr}WM3PN7ppHzJ-DFV^KTRRO{s*!tTtfZ`Bx-`X2G{k
zmaDQh4Qvx}POkCf*I!j~`3+(owqXo%3)2I=I5BC%AsVA>H(|NX{Sx{yt%$Gd6xVYS
z7T^^`$sd<2h)$s3ap5hJ%52;d6{v8Vj+Ymn_Ksev9+n56(t`HNjw-E5cdzsDAm!RM
zC0Iq_zJg&@K!L+u2o@X<9Yj&lGf1t)WoRvCQP~qz@a)QBbH$82f@rUqY4_ohR^I8R
z0Wr6UrX6w8c*r9yhTkqE-*d?!b{u1QKQO~_6rRam34A@-xSV^i1um~4iDMUz!vZ#Q
zF`77{xNyv1b{klegTsYQP<NF&0t<G9IBr{BjS|_-BdfQFTzPSe_{hpFBIPV>5T97N
zJ!Ikw+ruYTZf|LGcWTWu_JwWw$5u{U22WOK7o+AaMMAZ$E4k9JruRh#f}d6l4;tts
z8E0<+@r&p6s&KD4Ie;`6L>XoQsV0JW0d$2RI+_5faI7fiqp;%ox<r^XN_Lv&7nq|`
z-nth@q!<u>qrgf^+re}&(}T_P7jq{lJ;(LYq!!RMvYD4(WZ!tDpYL~HxP3X3jam2*
zY|(LV=XCGzK=Maq{e1c+l~68ykEZo)bWdgDcu$d8qNp!-KH|HeEWu(?UA9{n6n)k?
z%S2G_oFoJ_8N}_8VZzpy9gdj?<Tyf6AiSapdB~|96S5j(6t<X=XVY6w0^-=v`lPE#
zI-Oy<0qPxsF(9!n==luio(``HC(mAw8uIy0hQ+M37j0>3SQ0E&F-foRGEDo^qSRce
z>W^x>7g$xECdL~Umb6we3(2Y3L60tsW{D|a`!W0+6Io1x{(6n{QTAXMob!dGe7D{W
zP5jmYn5I4&h@J#uVp$bQ^M~&wrItQNtmAQVonKwU(d*}!dcOvO`<S0uOVSGnNM|Wc
z!bqrAR$cOahQWr8_>dMs(WSnGo*X^8^9c3k@yYyB^kPo-BL)D0*hI(}kVvs>;$FZO
z6_rS`@u*%G6Za^XCqxq?-wf;36C5<%4B#uquC?|rJ9o`eS*MQ^9@9bo)}8w->rk8I
z*vKG}nqKR0EhWyRPbI6!&XML)g(pQ6tQjTs$v{)W2ehN&P#)@ZfDuCJr6jSU*A;c+
zG1Y+B%*OJarXS)cWcL{3#;-4K0Z&P#ZCorfE+2GCZ<?3XC4=;W6^Ld=ua-!Bn$5tm
zs#0YA4wZRRx{{5BRgBlKW6f+*5*U%7t^v2?hJX?J*TU`@Zzm`l{Nc_ZnxQx%a+*4J
zNT=`#@(d1M_QZqB5Yk#nRt6;|<h_{ONEwb9Ht2-n%|~bwdl{`sE6uk0ZQcxxBc`Cq
z1u@Xr>XF;ihOlP>^yTt15`|5j3^E8rpUj}LJ)e@a<TBiXFsn1J3m1-uQO$SM(BAmg
zdZ1iQab;DfsGFS+7D?=m_+qbMQG8Rp&M-;GZvZ^&m!L8XJDwwpmaMq1F`%|2a5XnY
z@lpal$L3?r59UY?CmvkokiKZ}vENl@Zeq-HUrBkYX)(f0y@OhLmZz*Ov=0Fynw)oN
zkJ*K-3U63N3Sb{V<fbI8UJ0I0ge4+y$b{oNZ83?YlpnVb6i(@I`&bLm9}F<p&<@d3
z?3!XzEO+R8EPe3DYL5}|#J}&g;?n|5{?i!;Loss(u!Q&kM{HSl+;Ic-I!-xF#eF74
z*YXZ=igpwO0@ci(I!*<x3p$jaHE`oICv@h;Aof2#3Zk-HM_Kk7`&s+HYgq8O^DuHP
ze&(K{JeMgrD=*wUOi-1Mh$aT(sW=7i`|mo_d<%qRL8Q|!Y%G}n6pRtG;(Gq)KiNlP
zE%PS%@~L@gK}a+)l8qTNOE;Km)vh~4PzUb?A=KEzCkUhFej-Fj_~CEDplW&iJ?e!q
zy-*Hji>R{G3ZkAi+Pu5;&)F~=cMRg6{E%mH7M1s_jSnT~4u%p7t#j!d4ru`{;$uVl
z1X#K5NMc>?|Iq8Z;lA{T1HhLt1r`+=&*PBvFrc(R=Fe~taZ{k0=74CRb%fWIqsPyh
zx@LWFUaWh1T@O5hU<u2IA~JzI0th*kX&{CKn*;i2l-I3j?WD9MmJJXuzMfxYZ7l`i
zTSFI+Id)(8<&J`2L)Ox2Dbs2D*Ei+m_Jc<cA3j8Z<ixEEnha47D6@Vs9+Z_3+laYH
zZW`0x$*h<l7qThAa`zZ96i;`71ugp7Fb+?(Gx!4YTf;d$@@gRT2@Xr<!O53lHmpKe
z>g#N!ib**T&*Im+VCH&xc-#wPOLqjdcAVW*#BaJ`P^v$tp3j4YW$1h<+aoH1_htHW
zLxi*p9N`=jVKwdnWl{;xq5<sfvW3V(o<Q7$wd(t9Y}p6EMR8jPCyL=Sb4C=}Vhj^T
zFj2Xv7>#gj8Br#J>QA!?!%9=bP9oimv15u$)3YMAXN!ftHYU!cvl$8?s-AHkg9<>~
zj4_g1p@<Ldg&PNj>$wpq6IjQFvvgd_29Vr@`@+e=nG~5`XO^_Jpc@D`Uf98uO;XZW
zKorSUIw=(ziE_=cx7OZe$o8DpTpGR?bO=@Pu7*y&yx=o8yTNkp82Uh7XexpV<07g9
zM}35-i@V^+Nr9m7gL)-ngxti57&NKQ;@u3ClB&)SNdR$7I^9ZqEd`f&UDSDW$5x`w
z&2<a$TPkXpTU(lCiQua`#EWEGWVjk>%ZP!W(*kWE(+!`;LLp6JAQdFOo)zPTf|lck
z&mmEo@BSpd{O=pV4pPi9QW%8CVuo2Jv0MhC@3_pIoZBEx#0`@8QYTWx_ePy8;pZjs
zX7-Aa3&q^i7_Goke65WERwW0yAHA4yfiQd-v$CdOw}6lyY1wI|j`>|9wiDkwRFe}e
zTl%WB)o6Yxi()JhK!}V8EP&?T%D0>brOeQH-@-mLZ~^MYE91nE*iz`WsU2LPa+`ey
z*IA@aRCF1=x@+|r`F5caV)c)ZB0;|xO<F8<*3w@Ez9Le2Y2IYF&&&pG+TEvRQQLe)
z79&$VE^Im&5KA9d6Nu7`5}jZP2-t<q#o4gKiyF~&z2NXJTv-*0LQ3AdR8Q@=AOhx#
z6HNp|G7Un4hA$*IV4N*oAE6ssCabGU<L!<f6xUuYp*%%GsgZ`#%rpOZL73TBm46}-
zW&+k9Xo?}hqR6r7EJ;=2*+5teB{p4TAkQkoHU`acRZtp@6ehx$|H&lGyj&8q1=}L!
zUMSuHZwE<c@Ohf>6<NzzsKMt%JPXXoeg<6EBS>#?LtJpV*4)Y7X0qZX8eI$(Htrha
zW9hV1<KvkLb(l*6K&8Ta_p{*QT@7RkTBosZ@a1c+Vl}cX)@8$C+gqoqz%KMiA6{tO
zT$mcc1iFp)00o|icq@XkJ9iu%)yl_#G-n`$gGy{dNp<BFusfkbPdQ#Kh+-5WHw+I0
zr`LG@v$yX9M0yz06M(1(5j}MW(d}831lJ7Uz7>T#`Za^xRhWGc+Ngdc0?3G}pW1jv
zf$t0B#^^vaMvOHa9hJE@ba?+1=SgQ1q#N^G-IvBz=Z3Wz+9pjS$rl6{HVQ*{{AwYR
z{b*Iw!Ml|Y{Gv1Z;aokDyS2NsZ+xwLkc7la5>?qm&msCc=MYvrQ)pnwEOj3h)BKl|
z!{GqGjmTyz`LO;e#n7qGO+(wg)InS?DJTITn<$WmPC9u=G?pNISRV9V%}c3X=k7bj
z{N^vI+7z`yMgI__ZYBZTOv&&z_@S}>F0oXqZOUE`XaN1T@nDEa$e3o=(_(%_9J2fB
z^lJf^?MOcud=qRBO8|CRFqjo`)nXtL0`z<3I^LlU8>?DFA7|bwVX}du@8DsKQH?&=
zVwh3M@xYno4M>s~S&aLc`rduiiG)IWiF8Bt`K@FRXY3RatwsWtOAv2|Tu(ZgPw06{
zitvq;lqc<LKB6lf-T`w6STO?8Ii6(zfl&8=Ehb$5q^k7(>vvkVVVVIUlL@{XY<qR*
zIMXMrRL>Z-PQ{xKLDgy`gf^LFMabsU24SjBYQ5&1QL1`>gPXEwY;8<q^7^MS>6<6D
z*gJKe3qulGSNt{5horFq<9cw&NB5+Av`wGfq>9nN4InNE0g!i0u`ldY2gmUa6i-SS
zo|1q7fX%l8tSt&h!NE%?mMC#Fo-d8O-ux0N`DwD7U8Zg`;Hf9~3?=BQ_{)fl0C-9u
zZGc0>$RK9ei)<6u7{fT@{t&=gbDihFoiaROa<)>yK@PzZ;J%iqAu2O=CWX8L24G@{
z_Id}WXFL0cC%v=oa|kEeIehuDd$8MJeZIu(F{BvizSVCViU&)x@Yta^j5!(*b;k=Z
z7KTg3@}#2o5&PzhE+%5M0vF>~ND4%2R~XmfcQr*0+|O)rS5D`5N2i!ikuyYMtPC)p
z;RO^7%;HWN2Hbc8J{WYMMtxB!+z2l)sRazI&-!HcB2T*xzXctz6+rnB0B^v`Y!;_J
z7tAl@d*R&M5n~Ly3f?r3gyv#Ml7(Ee5pIyw|57sCQCh+itL`upPlnN~MX=?1`=V0Q
zMTZEbSqevn);hK&u4D;X_6>A`K|m@N3<`2>$m<l@2yDX*&5^MPM_b7uP_9ox>1c0c
zFR%q;eSBFwc7nM;fkKru)y8m2Zb7CLQf~%jQb%E_Y0)9F76xiZc~4Q|$;0AfY~e|@
z7bJoQjM@=Up7({q2v{K6TKa1LI>TaR;K&)wF|rn(!HfprlxQslv7n%E(_n|m#1f(a
z2#$LndLSHcUtSben~Hgu)pK28e>_+eeR!x=_|p(UyCWlaMda>6^woTMdjjMF)+V7L
zyaT8Lw2Dm)Pz995OS?wfv_<848UP_W0Z=n}SaQRmn^>|E{4MT^EgY>#7It~V!Sm_B
z3_eAK&`X>q?pBl2Qnfa>w;=ka5asJKABztYt&K2DwIa|-nWUKYk!NLGb`h2dGl7Xs
zn6<0qfmU^DdKt<KvIr2ldZI^dSwwh2B?m|U)cvb5fkV;ec^9;1dTThqEE`RVX*z|<
z%I^Lm-5rLB1cx86x0+Uk#es5AqG2f<0_6kMj*h+pIORd<zG;~UO?AaN$~-<Ry;S^9
zoFOPOo=7mFR4k75!a$@A3GsoK9f~K^Y!|TuC;&6WQ<z?5Ti(zT9gE5q!YE~b-Dbe!
z$dAW^Z*qWmq`Ta&N?@cjA1uonA%DOGl0M5)B9&8S8q7hgsz^0KjEabMx68E8SgKCe
znx${W&wzX>r5o;~clzq2cZ?hnl_0VA-a}ctkJc?VrvaGsaI0TmZK7$xp`DsF7k&7+
z-X4zd%#=b6L=hXZ!L{#Nn-eqA_yV{{q52orAf%vAtTc9W&9R6R#goFZgwRVfKWMmM
zYd7EKW<nLlVN^)Ly~ua8p@I%P*a5$TR`j%--Y9EzhEiXs+<hQcM8R1^lGs{p6=QoQ
zFQi+oVygRr#*fJU!`Bp=H|)rY30J02Z5VcfEx<@W7+?y?kL6a4;vWWNqJpU$J2>{p
zoKc}F>&-Lv7OgYWQ1B=g=z+FgLyk-ysC7=$OHCzH*^gi$(9nP*=Q~N<F&Nseb_>0u
z#59HK80mvyHX>XCHw1%Bx$ZYXobQDZz!*uPx;ddCnRWOL*{n`7NlQ#PLo;+7?5i6F
zJLQd3t}9vq0QTa{SaK2xNc;sB92{C|$OqL;Q)K2yH?n2*Jkpb}9d{acGy6stP|=(^
z%awcEmBh3`7D==BOh_Eue8C+dMzYH~V<!dYqt|Vkpd{hf<+)ovuriHHP#>cgmARB1
z4w!KYw-Z(YJC-&Ei<Sl^NxJcBjjl|duuE4{w4SpI0}53^-RD5a56KqG9C2}>pcb!D
zO7oDsvq*5S&zUlOFk+8v?+D5QiK{^f%=#mgzO3DmSf(UA!M#LjNsecApY8W{YXaUD
zC5;24rJ583)mbuhA;_W-5rpYFe8UJ;J2IPDn}{tc1OAIv5EJ9`Nzo2M<7nS;n2n|*
zQ_e<=NVanp3g_OAWWS9qN{>ule63wKe!01d(&ERh#Z!J=^j>pFlga(BkPG~HA_^my
zY+?B&;#U1-OtvpMHe#w*9;KHriCyk;=WDo0ph4ezh#sq8L&94?d}=<A$hoUtTYu7Y
zDLNt%T|srxbV%|RT{6*a=7pc`9T`DIHsa*MkHZ>x`xbC3ip}$55V^~D=R5MvH%num
zkN~)t9DN@8ynoNM;RM}g@`zPph311O{0~kZbSt?{5bfHH?F9+p&u$M~_bnO&*RoK~
zE^n;PuJ1sM()g-0xEo0@;{jXn{k6^_G+jmBDs77P!1lU3EO$c30JI2kXh_O5%iJI!
zgX%CLLBWU^KNlCi?zQL|R*V53i;=fN!za6kMsS6SzD~{vXo^y~$WZ2n;o1b%ER@^^
z^{NaUACan!@C2s?TBiV!SWk5Nk4oZR@e4tKy=Z5a7Gft%<cP+QFXWS|U@bW?Ai9>c
zA1wbW6dx<}vg{;NB<Un47D3uRnfE1P+6+H3++nf?N`MK7faD|=9Mhnrs9?zvuj9z|
zRI8d&-_nj3B|U>!D622dy|0|*O8$M|hCqZOYWUgh-fqhtBb5|l$ieDi7UA$1-2{ZV
z2!*)RoyN(6FpU9v7&Sv~xnp6WX~#hNeZTeZ5C4-p+{EMn2m+#FQmhoQ)!PrsuCpcv
zc+0Rg4D&EJ$CWC9fyoi2!D>xKQIS&_mmdq}(<7iW`VWqJFO$}@w9Nker*=Yj4(i2T
z5hovNi!PO76aQ@MWYBJ_S?r{i>L?9LFj=h?m;(ZB5Sc=;IX06Wop}}0uJVKcJSC_5
zCuYs+o{OJhm_ykJw>EAhm$*;BPPklWU@n$Yl>+(&FYfp?z3Z{~0H=VW3&gmK8w^sj
zo1~kp8{<*tu3`v)?>jNteQFx}3?8m)sAj?dhC~+1!;7EY^0f}1{TElM?_j5PkZ$Jc
zc?4Q{nT?9+ZFexBJJg<`?n`Z@jACuej~+O+ONHbC9I7FHigV%z{=t@DX5#%SpxQpo
zyp7CPm_6cIVfxYov|>Jh@)z#E<N0VapJgM=|LHg$;2yaaQPiF3oMYV8eKADW)KvkS
zp%xx@OlQ|014bau4fFFSVP)Oz<GO}{iXG8N*y3<Am(P?<O@nOWWDX3d9Fuz#Dk_7U
zXDc~E>|16J5vM>Gr7(#{Ti_yeqeDI;rqrCOGf#%;m?G>k_%iiTKpJ1+Cq%wIllM^0
zr*9;R0K;U9Aoj$YI?-<i{fXs1C&~VC)7XI3$X}(0q?61m><rq&NF{ba>hQ9F2;G?a
zPEIT{Kzqer|G1?H@B+!C>W&OqdUwo?c2GmTNr~akOh*KrQ6$5h5D_u|V3?0`Yg1L5
zZNGpbZ+ql#<i;Sm4*iS@9gj-}=KS%`#jTjgiV>CaLQVnYyPX1qBh!uH_MFr@O!HB^
zBJ?7Zq)2Wu08C<+2!nG*H7d9*h?H=L@d&Dun6~8bQO@mFd<Ov6FfK#*vySfzkFP>a
zPy>US)G!UT9c+FH7#<X6o87cl=dKZR-QC+c?L_sA2LXU|YNsxwOz_dc6x&<L52o}v
z+Mh*kXSx!GK*S|gjH8`0IRxI1ZCf#E*U$+(K_z!0wCbjX@6@by5CvJkfY9U$OPIce
z2V1m3fgjK-eMTIFoz?6LbAUZ4GgNG*<R_IAK=>9Q<L0^WZb|~Nj!4r}rZE&TB;jc=
zupdoF45^qTKth|(OVLf8%%)m!44Xm+0Olegxv=`xVRbPF1UV>Qf$ZO7Q#c{6voQX?
zf^H0bY3kbsHBko94^2`3fjR>#>SVT>6&14trf9KA!~Kp{4K`TJ)SQr`mOgXKM91@V
zddn$>v;!Szh2M6s*`yBMv6j64G<noczKR!PyQzA~e*QWP%+V>ey&=HXb;C^(<CeR}
zVf9!hudFODYrJB|)Z7POwcp8-aT>BLg+_^4;kSl}YFDGaqJ7O;h$?Alasboc{1PVb
zq<FUuE&00*E7D##AKjz(pA$FnA?Kx|T6J!QYZ8$Pq*Gk5%Dui-UnmL)2aRO~M2kp7
zQRz=Zs7zueA`6Ww)>E$-(uQRWXVl+G(NV|v@Kz$H00+c<y>651DqdAK-+}ypaT^Mw
zkL*dT8Jv6Mp?So!KYtr;@Or<vJ8wf|X`Fy;Aw4_A!WfbwR5_yoh%~-TjX=yNz8a=v
z#|OFcfIH8))Z1YFTuA9J-s9xPi*zR%udYx?<S&*TUV7J)IAjCX+{$W<w6`*K1%s(%
zm5P2T*YKr!lAV4jIkq*P3X!d5gyWDhARR@hl6VjeLn8>SwKccK)(($ny%-MM!Ceo}
z0D899H_UgH<kR4sQyj;wLGgh3QPIc&XjVReQ&9C#othL*RJ@=-ey2>M%;8IM+wNNA
zSCKLSCfs03wO3q=ZG~7R6Zad2OGTKV8ma`MqyghdB{~y1N62Y+v*G()rnG`h_bKO@
zR_{}OEjWby;%~f0aVB&auOzf>^&7{%{T{bXxCr4{#PKXTi@FqXF*s59P!J~fiP8jN
zuW`jfHyS;uK@2rgteg5|GQ5?|r{m&iZM~SRoAQd3!!IS~sF~Y94;oF<X<lmV3Ecyr
z)dvI1GO9dEdGi?=t?*(*dkeoB7#gOTkIp{-zvpfVH#flxX&Y({-3`+(uBPe4jhL=P
zsteObdgizPSN!%6AgAiyzQ9=A;N>styXHB>WoP2MUmAIOzDgqy+w)hj!Yyv?i^W6Y
zC0N$T;vq>RD-P-D;?_n`yBxu-ImfQHp&&LNUBa;OSd_$VA$q-?k}b+%spzCW^&7pf
zqZEY?q+L|~@x~@|C3s-3+%Ha<eJEYBnkZw{g9IP?@}K>5Odd|8W-!mBB?jHun*hC4
zau8^+oeDF;q?a}ub6RZ!;!8}TE=ZCEOIlT+Rg1CUez{$DZA_-FlfKTR-W-H!JR)NV
zJ_+KH)bo1lNCz;<Cf;8YbMCvt`f(KtQm!VXeDh1V#sL*bZ5ND@0^d#ZPGH1Pj1>OT
zjjJN^X_Y16p*<$OVci80E(AG8<&uCKo9GU%3yQC(yD?T?=#|#F{&K0mPNHob@PgFe
zE#^`o5yI1XF^#Nhi&hD&Y#IoQ0pC!lYdnAlZVh#&VkvdKA$+sDS&2{wVE}AkH4D2d
zCh?jHUFm`d^b3(hXzj{<oDJqgf$fN_)|^PbY^I&6<mLl{tpOWL`ZD^gFcdba=@Prk
zcdnu#x*)keynxJMo~&gro~HnVVVcYgJ&TO3TISOENIGrK88@POLQApZ7I{-F*N?rn
z$_!EF>#<|lnNkt%`CS&6fvsARSfzzPY*C?MuOdUc6@yodbOa}L1ku;v6o9Nr<G2ZB
zJ6V`xY@@;gh0N~G2aU;d5vy7tw8legQYIHNrN*hQKGXN%L^9?<zA7(LgNnF<z~@+F
zj@B(cALJw)I5lxn8Y?g%)hoF~r%!B%w^TMsq(LEGmLxc<1M~P4M~q#q<gRnWt(F$<
z1bmNGIu4FjF?yO!fMUm1^+J;7kUlTYoNo}FoU_=%T()AJY2}wpeO94u6F)ge2oSg0
z=N<Cw&D8d^0A5Md(a^A^zA2%-`P+P$vuhFqZd<924+EB}_Do=RT8Q`+M*n5ia>P&@
zk}soh|IixXzSIYaP!a7)J~ANW`We@oCEHJ(NVe00J`gqyl+pVL91-Rvb5rm$aa%dN
zY^_06;^YsL{~oV(u%2jJG-2cnf-KB0zN<vXxTQ4aI9U7JNk-$p$oeTLQe`p9h>amG
zC!BsqJcJD-@VPm~<|OBs6m)Lh!J6<M3|AfqJllM3F5P_sErD|jkuHiU1@%!)DheAc
z*((iqRt6}Vn9+i{Sga6&r$1%R?8a{+f-sjMpWO<P)vdwYor@uR0p60V8=dV3kX7Lc
z0*?O{m9nvfTTP<C1Q}^aU&qsng3zF9gCn|V<djnFIkbMrc?(K|Drz6gCpC3h;W@cO
zxJfK?49^RIbcpALok(~7*$T*yZ$tQPC0H+8BptKH0@n|r?5ep>1dj#c56gJoaN$Ud
z9^w>3&XF;fyi?87M#bLvT$M@$YA@J4P_I7N=Ao|kJK4NgS|BQIlh$IE#~WoqG~ybt
zkcuQxcxdg%lA<bD(nW)tB%TU|?MM|gfG)BE!>hvP^4Lfqu5xm;w@|eQ@K1py3kXk=
z!vJYVBx6gA<l`qPq`g(gO~ax2h`>SSV-Jaj=Me0X<#@L{Sy77%TM0eY;d9b&xiA2P
zinYYbpb5m&!?a2)fG5>@(hS7TC&nkjcbsKmt`)i1q?Lef8)EfB0ne^JMjxyy$u{$k
z2IgUT!K(aY0rP<7R^lJcyN2ig)9o7Zu1~gWJ7~wv0y~)B6}nP27+9}PmK*ETG)}3%
zz#4E5gvD0MxdnD-LShBsk*W^zrR|Nw5+nk-<Mbu)i-oFg+rm4FwYuUKl5a8EydEAE
zIm2v4R8tLy_k|8`xWtsyB1D}!8|5>!Ne1-lbVet%fT(2{>JTfrV8|G6fVcB?q>3np
zkt65`11M8XF81q!^BG#Ud^2)OH)RazmOEO)ni4EUF#@})Mj9e5!ELb)%7pd-^=yXX
z?j1g_UeER5jg-1Vz9=5gDwafe=Qp~cWcF1@6ywFE)68Vu(*X>m)zzI=GP4h)=6{T3
zZnO!!->TpHxDnWZe9A}yA0dpHcMdw~jR&w(&!H>3eej(|Y*MwVR}45n4hsr^E(Jn~
zy}apQKqBC+;vf*8rGt-{DJJy8U8k4%TjKWTUy#5D&wP1y?h|+@UUJ+Y&Iei2-TX@@
z-TbBVaPvR6G!_N?Mx)8>Rs^!#F@`>ZTcJIN@aJ?8Eo?C8?z}Cf3$ao3?8k=53UIES
z7|VV(v$}kp13tAqDzK>C!Qg~mYFh424Y&@ZFgVUWJoBhCgZZRoQiubr8Vo^!C)uC?
zRk7XL0O?b!P)$XX0HcQ8%3Y3TE&a5UteyR#T<av<fus{bLO|Zn5o2#mxd3ISQ6)gw
z4e#s)3EaIn9}8|(h|CA`%ExEW<{1)_A8j4snu_laHmDF{HjqHuZF+SBBIF>XgSQN<
z!PD%o^9&KUT68@Qhi!TKaoe~Hm~xlA^2avWD_BVB*Y{POseX0FF9a~Z?kTr-V8jN%
z{rVR=eiPenv-M@9o#iiA=_rQo7l0(+&6D7J*)f@MfG=!i#5(p3KepbGE)2I;e*Sq|
zdT@MEsI;XYb=LlS`rqR<$)T$}3H0nAPS*Y{`NIjmVb?8q*-V7d|C?4|F}4x#%93Nr
zi6w$)G0KOjinLB2K*W;0gXf3IH@zQDj=DQN%9WrB*^$9r*a(vThA(-I=C{E>WT=rx
z&E$SLWpf5FOJmIDioH?s!HSvJGpMz*^uDNLU>;k-ukC91*S|+jgM@-}oQ)>#+z^|D
zKj633s8G9E`$OsY>-L)e#7S!>=_RhISEa%O+7W(UJ-VIbz8_V4QL8~i=3U|d{wnd!
zc?&fI@%xT~#~YrlIcI+1{ZU(Zq<UZojt*3oRmeCb)rgK)l6vYWw~kDf5U*S6k$3&9
zch;drbXnFB;$`t8%c%N6d-KsxPoKIMO{wcaxi{`l_w8d0xK&Sj0r#unmEkr#Twxnt
zamH@6dI)R4j41a)EQ(b<K=GkIL`YHt7upIJh=bSwZ6$ny{sI)uN)i&mcOWw2IZW^z
zo;cq=uaUp789o9_06##$zgQR(SdF@Zo&R?3*1&^epqf?q2=kJse>mx^g`d(af{$9R
zsW#4m6rm@JMhm+RU%h)T#wJ&7IHQ1>c~LYRY5gddpb1uaLA2-XCYso}6H(9~zhgQm
zSD*tL{>R+?^1XN8j_srE`ED`47-lPO`2ZhI{*HUjuHZ%6zV+yTUwxXLZyt<nK8)q}
zz5n~g_zM2FA_e$D&%fh?zxTU1_<O(ajem8=o!792e+UwI^}8T}S0A4Qj<F0aqM}Q_
zy*PGJp%(n~5RX;tbxumfr@X1viJl$~-N}-Tig&Ah?sacVWHKTVhnITtRBrBHC;*CG
zC|KLG{skb7Tr67=Fci{z<xVjK$0Zigf{#i1x0ZOd|G>!Is-5+xX?cA%%_hZkMxTlW
zMg}%8PA?9%9#E=}eA?pfHQc&C>y2mATlaKk>!2pB)*$28(PukosLW6W3K0A~-}$%c
z(6tuVX^0lE9Z<h7+903Q@Bw-g%h3OgTI(cc)nGwog*wSY_y6yFb5ZZD`_fpavestc
z4dxC=DHJp^MixUmhm@PnNDUJE&p5krB%Jx;p|U12hOGu=7T2LhN!G#JH6~7An!GIh
zx3Vtw3Hi)2l>z3&Vo;Ql&>#<wKDA5-{zX*tT8d9)f)!RZuTemS_*x}X37xeOiwNo;
zVE9`)_PEdMJbnWZA|WR1&>%ntA0)!=gX_X^7aGlcHkni8XN(6NoB2*~I<OON%B1>Y
zWikw2;o{$D>l+X9H~9eaW{k3pK8%5zJjO5pIz`DiUtIGiw*3KogYOb6=dyDUqf-||
zqKq<#P0!1bfitN@IB3he5V^@fQU25Az>1M+yvh~gE<O#A2vCrsU<jLa?OtVL9Gfw>
z$qc;Da#qaXn1V6WH?V;p(G^=dPA~&&5c3)`4WU&?3^|?TF<9-mC2rguk5>Nl;gcl)
zLcVdogBjiM)d3hs#~Bv9aS!~M{}l31`1HqzV0-$v^>z)vlzo}NSZCAz^%P&}B<tJj
zF)MaY)in{6SCp`nxacA@YWRwE%)`@eAt$rx*{tpQ*z|uzZw(N^Lkl**GP>tKe<Utp
zWS5(*MXj~fz^2n$f^*?|B+!PC!HO%vC!oH&XFtdN4ZIFW2h*%<5xGRWU5j5sH8~^P
zn()m1?x1Uy@q<OD-IVuyA2b^}#~ebP)ECqaifO~MHczakxck!b+F`UVhB-v#)J+Pr
z^j9fL$~Cxs>}Oo2UFeD<J_DMoma$eSpJ;-d-$V`gyEusE=kf=1#}WmS6uN{4Dcm|F
z!zDB*Nj8!L413I%6SU?pC6mA&#DSL_%5rRPYB5Z66<ZBgC#y9l5P9o;eGFgq=6)}7
z4vTLDN}*?GibkR25%JGtqb+U{a`aF`=E7qDnE-mC6604h(?YQi=@Ujk1g6JK6&T!m
z->i&(ScFVY<-ij!=G87aMJS8Vm+~r-TaeX1&aowdNU|^)u@iRJiXXLo1fgZW`z`b$
z>4!bPd(kn;%_$)$8LrsjMCK_59lFmzXa~<Ng&$69&LA}S(B~(q6z<+UbGnbI$1V{!
zlwMSab>(d~wflI2YyBRZ$w(+XB&}emy$y#?KFwx_@gh1N85sooHbq|W+CQ|n0?BN6
zsvi%B@saM_9}e3erO#!Jh&_tmAO62b$u(xkT9SUn&wVhWuIc!nfx72R-v6(Ybjr@H
zdI~n=OCT!0fr8nIR!g;2Z`^O9S?+3Z@lQaggDMwx^ZH%TEUxcI#-yIlpi(6QQh$t)
zXrC7D`1rt`uZvrVA0}<~<m>Ju1QKwY42sAIiV-u$%Y#Ao=E0m^q7;gJmZ!t~7tk=W
ztYTG!-yskPk|)A)s8pnc0O%1<fQG<$TNqQFU0y<_Spd|4U`e+nB(P@yb}@k*nqr7X
zz#UDisZ=_R3MK@qxI2x<IH6}Sg7{nv0E5pLI1vK83SWY!7UpV2owVbGLcv}|%Pyn#
zW0Fd+LFQYZV9rm#aMM2eh9s{`^N+8yxA;B0@#DkI|4cV8f2v=Dud}y1@L+4T+3Vx+
z0(>}vjZOw;N52I(0<6LVs4Gvuf1G1dA!n`#cwurjEglyQ4YR~?sB~^%Y?QWz1%nCP
zRy<ceJj|zd`%LiALx<^hx1&)uBZ17LlF()7_97d&*BpV7(Y;iv3NAXLE&MpYx}N!V
z*!obL$i&F9HO@G(l3^gET(OJ>0gi=nXK|93tbkf8VDJDB;VZj%+0uOm{t%xJw)gVr
z@c6WQaJr3yNGCatLvLxHs;WQ{LrnV_GGsB<%!8JO`6VXzlT!nhf0_+*h`-~C6_CeI
z)in6>Plq?@Eu`vm+8ia<5?~DA5?WVj4{5{i(NZS>&qOk{U?Xa<ptQkcql9`gRX+fH
zEO$BlF3#4vvTXD{bmhK<f4m3)Hc+r$a1r_v`*n{yVS-F^I$rD$j30oS?dZc^+hkb7
zCl)&6>nk%gxy3QaALF5Mk)g7STM(h<+M+3pz=vyV@kFE`JQtxZE~D$j6YF2+`IO6&
z!X?KpI6P4(f<}kRLp)#^5-z2RhCkrkuFcs^=6D42g$P8=r($4zOg?0a>Nf)qSPYu7
zl{_P;3%q5S-S9;`EYbnNk7$`}#`FnmXA^JhD5R3k3UTqx;hNBm2E}fW{V|Q<MW6Ti
zG*PesvunVY=p<5|hB+%>CvnLE<*?}tDqRym43{?|rYf1G?DE770mKDL$Vc&M8)#Sg
zvB#Q&8e79RfC;1KduoekB&EPi4PAKZYXC{1k~=lnDsa*PUS)K<L#=5Y5vn5;Vx7RD
z`v0@{?~QF6$HF*#{?4aB)HfEXP_m@lT03?REm1a)B~cGa#YxjVEJ%V9Vv=A9(z4R{
zeD-&4djl3AB+KnNzo%?tk-%POXJ=<-=K@D*ONNW1g%ZGJ?`LD8&<0pcZ*^)AHv6ZD
zE$ojf6QktWD<)p4)x-zu`{T#tZXu<fSZ`*xC$hR1jIy;!l9(tfD#%JxM0?A{mDiO|
zo;b~dBs)pmbD1gHiAxvpK(LdovrQ?4nDzQ|0+p=P!Bd<Wwy)0~wZ?nac)at>1g?Rj
zl#XcriL=^*Ro$xR#^Pxx<2O#@x2x&V+EBIPYdFVv)g!_-Skd+;VlYCIU!G>GnihSJ
zO1$1n4;-Ie3g4-wAfSiK(e>--wq_qal*4g6ylq$qP~CKIjtgu84xMulLi#}KHaGIL
zu&QHbM6yo9ZmsS)Zp>+z3EoVxb7Y%o^f!+DCP;@0z;~H)VDVeN{^7eEJPULhJH<_=
zlHiB!7uIve^^9aiRtjmlra(kM{I*kdUIET8072p*OOSX?1RNM9v@wK1!f(+jrIL{)
zHcx8ve<n%AdTz~>+HuYr;dHo(OI_BB&C00Bj$}*%r*X(AHohXq9%Vg~#caPN7CyS0
zA(m&CnGqm5I~G`X-X3a;xcu0&zy*u?j5)G#w2JaO+1<$M<7KmWUI67UzcdeRU&Jcr
zNz_1TEOT{g(<!MEz7xJ+L<6*1vXO1ijp@MK#7Z4+30kSy4uYUvx$#;#h^kl}+F(+d
zleyu>qLH9lu@Gg^-Dd;BB5@&)|EXM;;{zl$!Om2LBXV(Cm+D40NRnMj^k^D8SL?Ou
zoJ>_x#!`IkXuq7H(H@4<^WEpf-nukUjY`@x1R1Mo8k!@YM8M}+OvDxd6R}OV{&ap9
zMDyX2fj^PgNjxQOhD%*TAJ!CM3rA41aV9868r7do<q9$6gbV+3FhoZ7F*qXZC=VO0
zyr<0d+!bYJ`PR|~w{|Dg@wQVHh491l&FQ%qvmQ<_<Y=P;8Gj&P<@AA{L|Lo$1;wFI
zl8UUN;t3Q@JaS%B3_&vPjICg>Xf>{>WI__tTvCVPE?Z33S63pX>0D7Pc_F_)!Nh!c
zM+4hb2BTSqroCZhgcOiPY0fxy26rXGTnb0*{8o!#djaii?wq_FQ%>eGGBs7Vtmjfc
zGPGiTtNAY#5no1xG5TZnM8`>(sV&0Qbt>Hg0IXDl?fJWe)4?(wlDy6M_Rx8&viUmJ
z^heMQ8qvGM!pdKHE1#~zV0(!T?2Wi875*A6c+g;)OFPMY>81?GUzlb!csyqfY)Xen
z$91U4tTI2cG87mM00k$JFqAs&9|o;=g5`jK0$>(}1Ivd3YtrMVG;bLzn(2~GLUI<z
zN=)X+)nPzNfM_y_M==LJzGcfMio#B@$yf`>**j*7aI}&@Of(`GNK@tLP@7f7f=(T6
z0ro|jJ7s@Wqbw+#6UDcJ4fknh5zUb>;)`fC+N&$x8aVESsG@L27VfDm%hn40t%y_u
zQ2&;_I*I4FcBq&^G>RuWnW4`7tS|!q!-(8U6-sbP?X}T3VQ)(|@4mu7r4(HxRaTB>
z`DiUUMmOt0`K|`b&{|nhzqmbV2#?g@1Vh-c@}yzTYn&zUlFKD(kTRQ`C8hAz+Kv`Y
z{2MC-_j;}V-*mTv$5tNKxsW*k5OkCB{t+o$N7N1eX1Ahtx7AsO_;NR6;LH)lW3!QA
zYjRVG-fa`sGQ($q8m;AAW&Q)0bP$ob8PQ4U9<mADC{=+pq?O#X`ME<t5gQ_k$dHY^
zv+U|hBS9doqK1Y#Y4Mh+a<0&GMma-utfDy++GsQ~f-Fd+$<5pbBt<aNNhsu!DjcHx
zfD}XL2z8bd&^MY+ut4FC%mE8E{Y2j-%6llmZgu3epgqy5UeTn&8H38)hWJ5QYUZP}
z<CFGjzttU_cY3YUlfS|77hb7NiC1dKchX&*QEysfa`*Y>hB4|QA*_4eGT9;`w~Vhi
zq=`;L<AD5c7@AN(LnSD*TxL+_h^0>PET%1tDPAYZGIJ`@02=041gs!cbVBC*09Ue*
zVWR1>3PMNnBUL!1=q~mtceJ~BM{8SD>jdU$n!ur@O+dn6I88=xIfb}`XUEY>h11h5
zs^(bzu>-5VlWWmZ#E935s7WY(SHjzqwLGYe0nk}$`q_HAiWk#JixSw6#gf#Nb_jI|
zFkf@RDlalZKeFfz&92hP9Qc-zBEVpqd^N_YNIom(^(`ko=gmedU8gj=?1@LA_|U=Z
zQ_qD|k*txumJ;S&IdRahva2aoLi;s7(*tq~(7^Ee3jbPSm8}f)3Lt?aPn7BpC*CR|
zeDE`$T$?#Qc=6<Z(3Ja#byD!QrBEYu(j!dP;T*bXW4>fX4sr`fLlg#EF<UYV^trP_
z#Ssg66!(!N$sP#B$g<nPYC>hvAiPU@r$Gondvs|u-^Lr51+at)aQ5)LotfcfB-#zP
zo^)Rz6NXLTPP)dj380GYB!Xi(r6AN^NU57A?$g>f8<ZG1g+*ooSZh&ABoM7NnJ`L&
zJ>YKM;V$2Oj^7&2i;;dYV(H&@xBVE^h^rORHE@yN#tSu00BG4+uIzJIbP|1((QWM5
zF@Oz=9a_hjF6z3p)+UO+Jt`dl2F42}wp;Z8iKXq9W>4+NXx!``Cx+VA9%Ym*^hcHk
zi7gW}{Pom&HF92A*C;wGiP6AmF@=mjr+jECf_WXLEXA7&d`_x5Dj<?0dl2{NP+4cW
zo6D>82sK5uGSu9epeyia|8Ph=?dF0h*)iHh5|d%d6gb<MX5MRyB<0|~`*o3*^0P1|
z)l0H<SaMRfU6tGfo0G(3e0Sk@*U8R5lMK~Ac|P!AlnM%nitsb|KG+X_{~g~1&!1U9
zDR#)vW#0V^wSH01JJXVEe(8r85fz;dd5@q(qCuC<3rw=6KvRHiRwEA)-Hrs#U)zDc
z2)`(*x+P&~FF(vj3QSmXi&8_HP!16loJ)dz?HUg)9V5RX9yrO8JBy}ibc2FaDVB=U
zW%Y&fhVg>g>IKC3??MB7i|JcS|JiO96nVTQX9K92r;Wh;7=3wA-x2=LGd|4=0&r@0
zb7t+bAcjG~(BRANu1(4<go=N$>%i~bgI{dja0d6FFnoXNz8ayvd9%sU27G0CUBzg`
zWX%q?iS&Y)i~;hMczAD2HE5dGGu;JKb7;!)=3Ow=lSKSuQMD?q@#E(>8ZEoggvopc
z1L{x9@ZzJfK&JslU1=qXRR&qP0KNyY=Dq$;f~DHKyjP(o)B5f~&M&`g_kLNhdq=yw
zRTk%jR0?c&tGsGWs*-oHqrDz9iEPyY+ds>MrsxVut7~r&Qe4gG;tp?{Gh2s15cAD|
z(RcA(H1Ay__}8W|AC%T~5?E>NCUUdCXzheN)fRYYpN+ahD>2nInvIO3C1)X)3Op|{
zTIGgGsV^Ne=835{Am14k>cMZa)&dk=E$a>kB;x!4>(n@2VU7_B6|<&n8}}vOJ;y9p
zI;kuyKXVvlPDHzmrXgvk<Ti@w-qtL9&vmwt-c91GwNZ;;Gds}bE-Zsim5KKkx~N<V
z?*uRO_;BkUK$SjUGK|o6?@A|clU9fxa=c>leTbpv?tw`H5tyW?*w&fdw<LOyVlO2@
zF%>h*A<BM*6lT2K2(Q*;nuIGc{YH}o?xu_LugO|*k!kcU5~rZ6XmzGQ)>}c>HO|m(
z|NDr_yDAN7;uGDc_E6D=*nryb1uD9Q<-d+Th5rktf*VH@w*9T`*vAhH<mg3xvj@A$
z<G?1**1Olyt&^@C4Sgk$fa+M{x#U%6(ielCHy$$i1CzTdH`rhTg7}Ake;iY}Y(LpL
z>t&iOEyFANZA=m{kPbBItp$yXsiviYpw~)HbSJIM6&-slbpV(#v#T4P8dA@=uyL3a
zpW)Rq8UDH>E^a;>tK#+2zWn0F-+A$0$^&1L4Pb%}E6RS4Qo^q!rwGTS(&45uYyTEQ
z#QZ}A$6^Sz=P`}_(c1;*E(F0EQA*<vy1O~&Shv+YRs-M)lX=Zo(`r(qimE6InQ4+n
z(z`N`vk!7<%H%BK<d9-)K+CSI5mopmH+B<h5i{{2G{SH&0sWKPuKD~JbeSF1X<lc{
zFO;0XzW^Yr_`drb5jhv(Sz)_6tR%yS#inx!_8LHfWSRV@NT}?5hR)=qv04EjWbi8L
zUFE^^NROF^=ktK;@b)ekjFhi77*;;YGaYmS*A=hLiGjg|xJk`@Ehb0d)JRjcG1wYI
zJS?;)jLus)9%>U6J9;6t5<7<Sw!t>d49g6(D(bG(IcrOAeX7xI9?fp>H|XhaPechb
zHpYcIc#G1-0B}@bMjZN{RF?rk6Uoiom<x;PE?u!oTp0F-3S%r4Pk7@gAukroe%tUz
zT8EZ7{2B%361OEvZKM`PC*0O*BfR{_lv$IB1VZH2$!7vDWjQ@6`H4xa7%U_=-#S$_
z*?EfZL=C1~55(`pfw8fd2x>SaMVesBNnJ9}k{O>nNHyppsHqK#Sgb9oxix)TB*9S>
zu+-|xa?<eW46@fSOXX@#YDBbjh;9EeTqP&fu8pW_-(`Fa@}$vt8L%!pHwg9uXjs>A
z;!AW)iFKd)y7v%<kw$Dz{7pH|?Cjr;BO+TD&DnBSd}-ODdPPapMsLYp3z`{;U(|T5
zZ^D5UUX!ty<eU{k^^mZ#%k^n^XeNHd8}k%~r?Odm6l`6$oYFoo=hJ+z#7;a04vV)J
z_HeaCZ~EZZWLUjz&wM`IdDRP@I}gO4bIED$NJ_MGbTirK{3`p#t+Sz!=T^HjN6Y0r
zQQo1n_>(Z6TCSUZ#9I~~%3{LpJ9RzopnZkB@P{nQGSM<whU^_R&s`%rAs(bOK*{f2
z9Nj1h@M;}`n74|=ppuD2D()GxD4eIpg-{GaQR?T=r?4m3c#ji(ryRD)YLX^TB}r@x
zDI-`!?r>z`MYEu^cGw5nwDUS?`w9k}ve=yKWSpszu;jW)8{~BQttV)_fDy(3Es+Ec
zk*2eC7kdMW{ejsNSlDu_y$RVkP)}T?#3i>bEj;VC5g^?D9%*UN5uPpi2p^RB2h4&r
zXpw8`rt{d-S&ab1_C%RUh90J3IOoi>M75wiQGb-P(b6nfOhZzUXypncgcd@XzHy2`
zwxhk(9(J@G5~0A($wRwEFEb!UlgFe?zGB`&nEYL{P1qJE`mp1?$&9tyl`nwA@KKRf
z3OZ}fd1`7JvSnIi=XcE*d+i0Uk{j~HAPSE=dX$hu>@-nnLRm|oRmS11xDsKGbe(CF
zeY7Jr25W7!U6kJ1)`_48)esGxQIZJ;*sjw=nm2NNIqo+98l~kNe`g0$w3u&OP057p
zS<pJ~w9fk*Vv10H#+AwNV~M#U<^Cg}!5blYG7ml!$TTR~s-p=W)6G5%a0vgwn?|NW
z!y}Swy^a+R(Vnd8N;#g&CnJa)II}kL3Qt-A$d$F=4+#_H3K!u2GCCK-ihH>F4QXob
zp>|Q-Rad*vkS)y%{TAhmUq6B+?x`Ztjo({K!r=>9NkHj9EuRm5ud*R|LL732Se;9>
z?zGFo-m^@;_GI@t!W>bGR4c8%jad0QABf8Ns=jLWUS;F>7HfR$)(e6)2Ki`>#l8O}
zGja*Bw8JB)@z0(5-G_1l=QXBdkPuKiG%^(|^@CUIL(3qzFNmJk`cOURl7<2~nU#?&
z4o(@Be!!CY(Q&a<>L>O>@q}cukJ{P>Cz%F8kS*Ww*IP1Zd|0W!gg)pHS)MmV^g)UD
zxQTWx=^lSq6zzHcsK2b4yN8U=(>H>CR>o(HQhz0y35<p!KM+_kC=g)q#@@N7ay3J?
zcLg#5QZ<?RHFI76G@;ppCYjnw2eG%eSKlBHVll$AyNcUd=ZX~bUnP-y#BrsRE0D-v
z<6Jpc`z~;HbH%P95b@rMB$0om*#6+FdvAfiV1+kM>YuC^_z0l+RSF-8*&nTSa8wSK
zcu`I3@JUn-EJPngOQfVGY85*Gtmh>EWo1b+=qFylm4WG&UhiVu=UMdt$EC@t2ecmE
zz)bu_a1aZaABtrn$rI6LZW!Z2kjGED;_LQ8RRRgplZ;4N!*rytNQFYdb40<SJ-5cm
zXsr);_HWR>gedHy2yWzWHFi_Z5~Zm;N}*TL3VkLeh9G4O)|NK53@WYJ>IZAmB4#!O
z+GGH45lGx4*dapCteSWW`Q%gF5*t~R%_6FjEXt%*+P{+Q{P*7j!_oU9sA$o(ef~r9
zv|MzhJhMC3D~CBZ0z_7H*v#rniD*7b$ZtqWwa$+^$L;f%gI9ewSp;>RQ2xuiN(P^>
ztE?EXsjJ@W_Qh$t=j*Um`wdyNojUhiXDQwp!2Oo)lW8xo;p>&%oGX)Rl?EZZPo;sM
zVztI~sSd*un|*4G?92;P8TJVB>I?xz;G}W?umL9kCD6pa3=P`n{Vd|JVV>I)JpA@+
z46r#h&zN6<H-Ic?q0QLRfVy9PnTy^`<M&AMUgHKN@93?E|J9~i23DWRyk-lU3~^gj
zvOa}^rh%V#=@0T~u}Q~NN(GPxZrHJzsIF+C@mstg@0R&EdavMXrz^=+d6z0W;k?8Z
zeK(Ef=9QH(F~6dV?7GP)aE%v@N7xDci&;(J-)RQk?i$yyu!&ssXQwE^Hm?AYK#kPR
zI|}Ifq@dbn+<BKr9t*7GcB8O18=L6Pb5@F!|ABMPY#3276zrIa04m*BxdPeDmJhr0
zDrk2<Wr&qYvV8mL0;_0CCrjWO!A2dcYcj){Dy9<f;kRfWr1NlbjTa_~4mm$V=3mz%
zK?WH}6kC*BXZd;wCvJ5tv9F0`XJ2fJaEvw$zbV#swG1&Rh6<2Nx*XO<p(M!mH!s_#
zfw)CyY>>rQfK_@}ja)ww0YC!K69kBxq<S=Uf(TwqNwAoB)v$CpBw^X&UkeJLg7XOL
zvCzdF_##|#G!JR%Z7ebi_fXR0YbXg)(pzd$iIIf5Y>T%vb{@(WM0-!m&6IR*Es(Yn
z;qFQ9BRB0e`$kX^9Ah*lp_mPup9H%H*e1%9YrK_%@9BC(jr#h*;b8W{P^|plMZrb;
z*b=6wcjMia#XqUO@Aw8FENp25e;)%lUMXk{mHc3|!*cR0;_+a`y}(z?1*oQ;Va5P#
znmRdp)jmBQ^nbc&4cIcVUeB>txRYqqmg^w3(2G_VFp)l{^{Z{sqh0YxL^RvVE8xu-
zo&lU4%|8XcJ58=?r>BEA&F(o8=&hp=oo<Orn3zUSf-ll7%4I-tQfoxMGTMG;^cTEl
z*6?Q<teA~q4^eHPP|c*K-B5C%fe&>u7fQJ){m|;Z==55RV9O?bB!mM}0!Uz10AiR|
z4bP&wUP5p9E4{oQB#yZqU@{!Pi&GW3n6{uD;8-gFXaJ0k3Ej@4nxFU>(z{SJV~&N5
zG*0Xm0CBIDh`D6m)p?@~+C`6`NB|j+Sy8>YHk;C8b~^17^*7bv-#ih$9ix3p@Bw?1
zwyhH#*|m_2=3~OvR}p}A2nT@N<LII5q*baUC+(m(#<Cx9h`cF|F1uY2syL+{W)4xU
zxC^;utZPXjrC^-d?KpJX24EE}XB_K897<q)N1Tv>shq8OUu9`xISF(KibJz&A_QVj
zIba+mH<WHA3kc<i+<7zTwg1w}PoEeGryJFU!&Ug5d0wldBIFn)Gt+i7RwPs_5Ybd{
zuFG1vT#&NN!qw<HN|m0QV*wsPUlN#~Le$$$!9nZvYK{!K2f|jzNyNG#YF@hv9Z7(D
zPHQnv*c<E?ZECKx2C1)B*${KH4%E{Cx?sPqn=sbGID4Rx0V)m0GRZMB$HB=98k#m+
zr|_d3O_ci}0ScJw9LWa(D?_vP^r$Ehg!)l;rmfBv+_9^01w4t|SNq7`7OpTtXStq>
zA&sGe)B({yE5Evs!R&yn%T7GIYuWdWUi;-`uX{jIUx8eJ5O2d2KP;=^Qz)NrAb2Fx
z!7E#6B_mE04CsSevTl@0vZLV|{lH+cM(f#n${I#(ccpc}vbN#7DAj9+>f9CK2s`me
zALXZ(QR!7ZvvS_sN7j}+a>J5oX3pM|nzCtvm#0AneS#Z>zkCO41?&f2$>s-f=(YmZ
z;Sb$yV{H~9A~S2pG-&CGbI?5C%Gn@=ThpM!0Wm}fnYzXOcxf4tz$w~A7nh@rqau8G
zxjUL4jueR}Q-$Fz>LbFbq1M(GJMZ+{M=i5)90mj1vG|LIqWka*vr0<4_-pglYgnVw
zBQo2u1ncbGS5mB&Z@=N}zDkJgnpu3BJ@cs?<v8p6b&|YIGu9KIMncw+@7P`e4mfgJ
zZjk?MXx*A>b3^0AE-C6MoEeUeL*u0ESfk}ND}JxO26{)1(k5^rpVfH(Hy+2Fjg4=%
zls~-+TIuHV2&{Y#Lw05$Qf1=tk*$O_UBxJ9*!8Y{U1Rf7%tpmQ*@*8V!$-V}ryCgd
zzlCw%qMR@B!pKb2jF$W{mNSX*snY%?j#;htEoe`i=Qu3tNXOhG!{3l1#l^`w1@Uv3
zj+XI)?I~B+Hlv~##r0fD4bgq6J=xrnkw|4AV&Km?A*WOBDG_nqk-a5cp|zw|r~}2>
z>sl%bs7kehYm!YN;TR3Ja4poefZtiux&JQtWLpg)AY)Z4ua)W^z()8{xhBizj`<OS
zgp)oK9<z6`sBAKBMox|z0^x`wt&8)HPDe%3ofFxgqM!2)+=i)AXJ*T(NHfaEi1=uB
z!Je$Afwlt|pC1{PK`b&`R#EVH$2{Ttb9Jq{jeW8TTP?SBCCg4f*0nq^>bL<WW{i4R
z+N@mdOefZ!Af6Bxgpo{IEtQOdFOPvNjkOsygMwf@iI>J%;RN`A>6GoMwsGmUHJuT^
z{zbAtHV(-nfsObIu?pZ(HfUg^Eleml;52%Nq8>JvOEE+7t0ZPV&QNI+DFJvY>&HS2
z^@<Cjp#GV1f6pTLz=|K-O<>0mzv)<Dkt>5Bgd1F)ZTrPoKZU8FAjP~LhaFZ;upa~V
zqhut;LbU!0mz<9CS{tBi^wTM8$UY<6vube}p{f-Dq@Ey^CQV7IE!zV1a;38uTJaX0
z7|A?m<cCl*N+||4AnE>JD-vud?YPlAdzUX-KcFI@+qyXIc1~MIubSsCTgSkCy&0S}
zd;M1TZ}+K+&)P@Lzh%ZM2*^80Vv%AND%a$XXagR2s;V77)j|a1X#QqxL`}90NT??#
zvk!h^4NS_u0}YVq%#RwuBow`#tc6{buhqCDYSO6z{%LRwUy#E#ZY2vG{xP5m$=eKR
zrb?RNvCtsLoJZ&k_w3RNwaqG9Uxh=e(2IaNkHh6{NiBU|V3C7CGMRuB=kJc+6;?j9
zD|hHCyP?p4IHYyFx-F&x7Z?E<O@7GYX!FkR9=|{lRLo7AofGKmW*KurPTF~T>jFVS
za=Q0`d+MUq?X_VGogcLZFp@#9-|Y4`ZYR4IjQAe4dOw{X-Lu2i`El#`PBl)N?NhE|
zZ*&fjYyobyjIXZfj6+6@SW!(O$s$(;Igbn>lv74qWlb?Z>5G@W<_|6QpdxxJ`7_iq
zD>F9LOm5wi5ndt!<>8R;fPcpCi&=jeYr1F8$OUQ^FIY&hZpdKU$_3e2XRgE#4&DSL
zKRLbZy=tPd0vSP5@9Fh=HBN5kRx)xrgb<g-eGxx6smvhk$h*$vpwUK=Ta>t$5!#O=
ze!pgmR+M!?M_9E&q^sn&W9mDh5oy*DmxK6dov3ai{`0Z-B8wy=ZW}1joQkTp*jva=
zlCT#vak1xCWTGh0+rvPDn3~9dX}wUGf$$?%lnn}r9mMdBbD9pF9n0}>7lev%Hk@jn
z-$R8?rt9?j_(cZg&05ko=nW$|%?)-<uv$=?WXvWBdIlLSa@w%s_$i(ty`7J)m&rW-
zjcpTE3ygrAaqFSzm&~Ig8BwKygk-4!TiXlQ=^pze*V<Qt2qZk%RsH)N?_V7bP!tDX
zJtY(6z8vvXoz?;4%ON{XdxbBe_v}WpA37}gMArwjTJoTY)L~Qg_FS>{B8UK_9B~=r
z@V_<NprDy}HUn_MKBV2L@I!m4qA0RnZE8b^6b2qp>^fc4=i#7$IUdf}GX^HD5!&Xf
zJ~>=g1NG7>3OlxT{35M34z(9o);2PfJj?L1g>Uw}-{D*kEU%dqyad*G6-s`BwZ*Fo
z4rRGcl0J`L;B64@U?#q%!DMb9Qn%4+ca`iCAe94d3FSCV!ZC}Ls(~XOJ+wOIca|ac
z6SSA6*#Z?ankqgfjMO2Qt=5sqXc0=l)(pwWM4HeN2ZBnC0sBFEIYDi{iGr`?54{!-
zLugJrO)@>K&a<c*)fpt+2k_B%tWu3BQl;|@kuhb#lSaW94=P4wl^zu#PNdQtPkN24
zlPMd=1O)7DRG4r;^ijlDXx8CK%Tj`sM|9q@NS#Mb;jbh(w;a|fX97soPX{UPK<>F~
zFTHPQD|}`m?2D9_(aO|(aoZl(>Yo5Dk51e4hveG9QRn=;b=0qb32r?o;8ZPGgr2Z{
zSz@PlJMo3Yz+$OA3=XK2LYb+Rth5NvxuveCJE=)l5?WEpZKY*nkzFZxr4W?57!a`%
zbsEn#7enkWI^>x8n!kx9q5@^#G8h((KfwZvOs!U`bAH-BZ&lKF*tJehR5i2Vi<Ic7
zAk*2efl^Px<r7J|uG0Hxx~?t{nXhKmJV&-dcO9iHjo|R*SOylGsN2xcQ^G{N<meV<
z<N(f!(<E7J!VfFwHIGw^aDuhiP)&2F+ET|J{W#I8#$l4YeH%p!GBG$4y)S$7F0Hf5
zq%ViMmeUfSQaBjApuoRKV72R^)~A{^LQVDbHZykHr08H@a*HoeEF(<`9kN<oNDa%)
zH>+dm0Owt^b^V(sx~IaABDBpiJ9nX_X5Cy$dUwwG`ZwnEnhTKE-p4aUFB9=z#%-Wd
zf=p*b7f$2(TR+h;=!Bf3LSF|*==Scmh;5;j0^;%(g{TBqORXPlz1n(F=h-LgrPA+N
zngJEG>k7?a6kW9?Olnwek5q=K$QCZCg`0>q8fLf2C7IGFB4<YDb37@U0(4@O2%}^P
zC;4i6`w561Yjp=evtAD_FE&y;yZCYE&3VZYCTLjwaN)DTSoleTbTaYHCC+_lFz|2W
z+A19B^851Kl)vXL%>e1XJJlq5-Vp!}P~*(o_MB2Rsf@xFSaa~SH@!3?#}Kz9HW%`2
zvt)B2W`vuTA21(n*vEF#<e1V|5f>~<I}|@uGdeNuoiXB$LdZq8^RnCO^-vnA%=GI@
zFzk;&jyx3q1(ZD3hO!OKx1`NxGe)iZhhJ~HRECz=@D&3%%-_zD_?B?TH{l|qaVsV&
zy*JGZQugT_EHJ)E+q+NJaO|sgTB0-66F*5LiUc=K+5i*P+qSN>*zX58y=jKS2hx0z
zvSvWy|5E`rwjUf1MJGT7ifb}5JaudGLtV8*#CQRW*4pMDZBY`+zXjGV-Nn;y7k9I8
zNh<pgdd)+Z<Do{OCfybzn})6<WP&oJE<|Z%{9Lq3N`jrJ7Wj5Pp2n+N9m9m8nT<K_
z*q%u)M!>$BCPUyKX#FguJFt{PbuqhsKcK;rCL4aBsiS5yIcUBLnWDH*)ePGsjkH~j
zOy;o~6nsO;CtPwOR31$Fi3Fg*i{{bm%ZtHLx7F-dlYUecpm_aG_ilAi9By{YBw^cQ
z#;=R8O#Ev=aJz3Bcxv#ykY#|2VIk<;NS5=*<2Xtm9)KsE?&|?t9>3^x&o?W{P5I-t
z;UoHXcnM|P?V4dK?X|+vFm>peWzK>P>R3P8tc{gG%1TSZODfizb1>g56XHE}YD=`f
zQt5zgGZq#5F3Q<};#(fSm4+VO7u4wb2^#~_Qf~~7C&o==q?CKE12bt;w0w*-DtJm)
z#+V}vlL1f>^q%3wnD$)|3xNa;opn<g!RuI3%ZSV|Mv-H2Yo*CE;S9=B0AeLxlX#5T
zOa@LVLYDK^kNpj)O(@7a<^`k>AaVh=Qh8I24HjK*)9d!J9{1hS<T<`_Hds}%JS<-=
zk6ko%)79xi2w^g{;b?>P(W3xgYM{Yu_1z6wFkD9A+o$AbpkTpspWtn%p8f|7!ZVIp
zNdhP(lr+XYQ-wP)Hp*^-7bF-@lhVjKD1iAE-DnFY=Vv~^g@UfivseON%C>0N<GAOM
z?RA{<4`Vp{^N!-2FBfB_G_njKGj@-*Z<%q>Ein@}Fg;Ifpf?bB>NpI?V=Il6>VuFX
z8#zDHp362~<g=`5#0Uf_%;UnutJzGcB`c84E8_L`VRJhxeUEKP%tpP+;8JI!iI$0_
z6HxDUz!pt?*>iTjOBHk=A;%Z0odS`iaracUS`jJDT7YT;d@_zRgh@yJM*^8AP@)O#
zw>#$pv;Y&8=<$;*s_2P*@1t`$12Uj{Ps{qX>`y9p<uzW}*ppmp-@O-g8@{mzks$Bh
zgAzSA_TXGc+`S+7He+LNy;qlg)DzvkBUN*AAFc-eQ)8R00lO~{rH##N)rGBe+UZ=}
zW1Uph3NsR?$NNr(e^*6qtsJ>Oj%)SGX7nT3{~pLk^{Szsh%$HY#Fm3LlO8Q9+=KcU
zF~jsTjwa!Hx-zXXpCsqD)%?EkzjieAVxr3zCd#ZSweNv$BJBf=M(A*C;jw0!ri%`Q
zDvzSYLM(qN%mkn3Y`~;+CSov*s$eqaCjrE|8&J0EhGR2cFqZy=e5--`pqw019h)+d
z=}1^|6)t4!p7DUO*(IgyF&6D;rcd9Oav{KX0LqRYcyDdfXAIWDG)+cvE@PgY)Xufi
z4T3O|6m7=hOSy@QuNMH`ma()2Zls)XX_O7yo5MI8o?vvoMTmpYuxa+17a7;$6-yX+
z3D*FL8Cv4sj9WXX#}VxeN1;o^tBIn}uCAXLOi`C}qLu-90eJ8T6?ELv=sF4)Zji-!
zV*5;pi-^mLo222zT%9*{IQx)?(*fH%49HJZhmiS~NlaxTZMiJvh)af}^E8YSI55^2
zW7AI2-T!gWK5tv`*NA4V-tTE{+_2_WdTu=i?s@}Tk{y;{W81Y4Q#L4k<%%-JHb#kD
zr`O78371Za<=P7*_=6JdObnKJFk7!UTmg=mDFp|(gx!YziVa_D<mrP$AuV0FMuo^q
zsr5LA1P7l8CG&;yw)Zv08=b<kC<3MppS58x>nc6fALpLo3JJWPfh5Y`cItr}%R_xU
zD4z*6XGJ@a%lY>F6*+YJ!q(+RAhZeORtfsrjj$iK;_>#hp+OFQ#q}v0WIaDCQ$eMl
z|NU7Yc*nR{UWW|R#W$9G;FE+rD3^O#h<|VqpGhmvIp>tFK3+4Z9}a?1{O+KzWXAmk
ziZ9EG+qaESb~ehEMFkRvkX;4GFIXU@9KggY@X3kfS#2=cG<!jNwVk@a+rj&AIU_X=
z^H!7Nz}heR>K&7F<Qk%69hodEsM1uH)y8>_)3h;_;7jvtTWB`FUL|;j<3w(AYsXC-
z4{K)WIjVgYP%J`Q+mjWgc(6GaJv7@~Hy=j~8J8}E-7)ymQ#?!U5#mjQqFCk$#Kw;~
zDzF7$9z5I0!RJSLG_^=X;Y5p62Ak)c!F+4txC0t@pFn=&RGEOFVDWgRc|V=?S-Qi%
z+?m9MRd6(u7;~r0*E5d(QTHye7msz#`rW7Mh>5-lTeAUbS2}|k@gJH|@Xr8uR6Mu2
z7!6t=Tzg`LkYP}qQDR`09^h6%3znq>o=LmU$!4Ootmzbr!;ei^l_#-PK%EtI?}1)b
zy3sm<Pt-n3(f4WGCAKby@#U9pVS`4y&*S+3!%Fyy=oB1}@LEaJhX#v3W<d3gtz+i)
z;^FDM?&{;=kzm{I;|0d&Sw^c)P8h<*n2nnmQ;vJ0Ipv~fe$eS*=@vuzVW>NdRIUZ}
zwa}A5rLH2Lk3A^FNJzZjLoJrOQs$)z%+Q=pEqODoxm1C-d!?H>Eb+h+)*VEw>X%aP
zoYdzbFLTUla$pd4n)BKSv5+6rrNJOfCTdtFpzl1nftg9vn{|qc8i{DdDW9y80GNTg
zM%g#_l-R=aXV&XX7)4Y$Fs6xbgSHD&@f)JKzJa#bqIhma-ot~<g}Mw`8Xc^X73`hi
z?J7#$<HKqqTZfIsxYGCEAAp?lI4Ew`bYE<f1*bI~*8i}nUrtXc$52I1Oh$D5TgCEf
z!d9emzwT%AL9?kxMyh<s;_RogbzDA-@%@@&=hM>9qe*OSs>di}kK(aOwMz)CBovOf
zgIY@mMV&2y`{2vqV4pq)ldgYz>X6?zY^5Ru1JfR$vmvE+90#yfgYmG5PFctF=<#^i
zvww7;N%U2Y>J+Z_vz<T(s1ZFZMOYNtuFOHm9Z0$ghiI^%%$zXcMqW#JPDa(QquWdL
z%y?Vlh}9GmS_iMTlQ+OmH&(fXRn0}f`hfzU?abZ*yr|N`jzG?3`q<9SjPwHUxLJ4S
z&rtZLftj$`F10l!D3CQalZz-FIIHq-QKs-*R1OO4jv=aWeDQGIs9;utWehq@afV3<
z(7qkD?f|;Ipd-<4QcO$&_;n;Xwo-PdAx$?P^yE|X_jR<4b^H@cdHR{w6k`WR9F80?
z<W-nn*Vx{e^%|H$N0vi0#GFcQjwMgTjHy<0LecNkIU(O_iD~R=`ca)DjN(b)_Ii}e
z&}F<J>!2RULGH<+8r$XhWv_Ky%LFx7S17CHXtt<P3tZ`$%36=(APi;TzzQF$C(oqm
zJb)S&nZcZL#+*xt3Fjp6exM5O-0^x*tuW^CvkH6R*05V1@v}P&CE~jf%=l7yMBY07
zDp-dca5*yf0#ztb3C=UZgqf(iSjXR7#5H5?4ze;pmQ&U7n&WRwN|Hy(=2*wU)Vrq<
z2=bX`R0Fj7e;7v-bXDuNUbgAZ7S_Lp<?6v-sr~%mwrqB9EBFJqDwtb0`+&j^cFzVF
z5|3J>?fsHXP0>p^4yVdVSI0dU|KBYAR{b9V$BrY!SIF<8J`XR`;N61UXq0z_+q{*`
zkG$Zgc<sY(!wfLKXtV3=Df1Sk5;qEmIvLT~3fa2y)DjmiS%vWsHwQLE2HCm;yqCk2
zOn><9tHZCdQ*A>jA-BC-nAhwS2FnwcB`;Mjm*|R1>y@jFH&o4Pj+c(+Sn>4*^YhH@
zaz4c1_^N|cBpE9+T@cuettc;m)>8(Gd|Abqb4nX|_eh>9de;zGeI{GB7p(%h*3;Rh
z9b0BC6D~Qd0Nweql%Z}Q9$VeNmPWL7=rTXCOy84ux>Bt>Z5{Dt$qBtLZU&c$oG)cO
zC=tV!L|f7t84EM6&_xWJ%A@hN^yJWzfxe1h)xL)~sLg3b6J5lM$fZdGS=j-;s#lC4
z@9;trPM$~3!B(ItE3$krl*|hHN{M65yJ~Q6+<E+9_|n=zHX!gBX4Tf6%>iDjmpyGb
zK$qYlY<Bn)O(v8f{)Y18MR*esr!($khcM+Pl2DY|h=5w8C$S2q7NQ~CQvD`I8EDFM
zqPg~P9<9!k`3uTdNXJ$&xPRXNMW%J9S_i*a7}c5!J|$_io6L9dvMxZ<fhdH<Q`^K?
zVgtS9Vkzx+u{*{nhztx&dIx9FG-Z=iItFMosWZ!?X@aekpp!el3gw-d9T|i|r2*`!
zC5XcB13(lbB=z~tGkEv@Ji5tjS)mrLEp3`fYG-CutT!p#(4Do)BeF{w3$@`kCKRC<
zopz7~G2i7WKT+`J2#y>db<Xe9{nWOV)*TBkxUa!%4ZREqTZC#te>z(JDLIBXB3i0Y
zwunmO^cp%QES`}%FeBc`{moSP8_;aL>5AW(RvkxUa-8FAC@3@{aUfR}H4?5q6`xuw
zy^FskKCd}KkrjbN1wdv01M4hTibNghLWB&TvjfPg6#vjP3lE77r41FMHnEp*7N;sQ
zrv_}+KNps49zD@<q|g;-8Bxv{#>V#&Lrwy0u(hrtjSW3+bU~zeD%zLFvQtt?Wl|3F
zOZ<|A2Gv)V6b>_;hVLR0<!6jwFhqQBVq4jvD6`BDViKkv_&<mv4r8!EQ<_zk7NFgo
zEm0&Jy%`;iti>7NrS)P(s;O3!vb)dG+NdGi@=jep4wqN&8uqV|tM#Mk<*jblJash$
zo6k+_?6kHAuf`W}L<&L@iUK}t<!d{0$lfE^r=~eMKV-N+WFeX2nHx=kafu?G7nW2z
zHFa5mx`4F)wD3K%PGu#KgB{+M763RXZWFVNMdlqzH2mr}>qY%(X2O^ArDl&9|0~QF
z9Ts#wO<DB@vdqEANKxN#?AbzcTbZKmjALPZUq&lTM6BNEtO?Sv%1sX?1;fXYwON8%
zZ5&BUv|GloS$rBRnIIkIGV5SxG#i^y{18rSV_SPg{v$I)Eg;Wy+h&=Ia1+NdaL*Xb
zc3EcC#bqy+$$J?7Xc1%+KLjkP<^)yh{3==@r$4|!xabYbA3zbgN*yhBpVRE9R{mC%
zX0zCQiK3v*+R*HBG^9h%)qcKGvW%|=6>2IxE-u07Y)`SIQ1+fZxBb;<Wp8QJ8^;;;
z!S>xUrz@t^2|6Zu*Ae*!8n3&CaSy>W>8Q{v&mzUPc7>?1XjWts4u}*7rqY0@vC<Ax
zob!Y(4eLV2bpupOK*EpMfaqzK-K%1Jcvpk6a>E|klPI3TKSn~s2Q`MmqjV)kqV)D3
z0r^8q*q4Zd_F1xxvv)s-hW66cV1_61qoCFsw12$pb%Wsd0KdNMUdXpj|5ZJg7}a}t
z=@b}Wq>>vPc@TvA6HE}UbNNuHAh8)l-+p45V2Ss(8iD7aa+BX=(Ut!2q9L`KCW~m!
z;OX{HDcJMx^yRd3)I7BWT~)<H4DUKON{hxTg0^QUquSzWe*8RkMoGLBWE3qx&Me)7
zKGNHnjKAUN_BwOiE?d?tRUi3Tj;ACMN;}qYE6DQ(6nagg_Y@5}Kbl%S*m7&b=!eNv
z#ZaQ!5;J3~ky-vC(3z>#<ZvJx3Y#1_lpt#i0$f?v6;c}v=WcR}xB{z+&l<wi=mFu1
z#;9niT;(#YRKdrbd8>SQ;C0WaYk5a_mbB7}8r_$bm4WMjZc?RKDTI{nTqK=_nKGa4
zjT{W@5=x;k(yGe+d?8Iy?DN2v|3?93`-^m2MY0hNeJejO3mRFw1mh}@u|%kPb?z9N
zmEApWjyF_R+kvfL*KAw=WK&#yMyxVXCF_1TpJT#~4S=AtnF?kc3i*mWQ^Ee_lx~-U
zc!+b28?%JuK~JPKx>m+$G)US_4v5xy=e*T_!qL)3*J>))9M0J@1F81nviH*yJ9i}0
z&QyGkN%uruk_@f_UGrTz(@B>_VrbTo;pKavf7twkM`#hQ{v-n4oUX(5MiK^7(^$g}
zXO9n+yBL4~*pu7e-jD*8g`VXA<BEsgJ`iFL(S^v5-aal`-LpIQQ9x3>9W-Ay+vgQ~
z&?NDtm6b6h>vUE)jes|w2bLAL;&RsxpDTM%J<jtQMcjo;27&u=4|Ya5m(h@({Z2tu
zeRmwc9sc6JysN_oPM1eEK*o8E<X(-{<{hjfs*s#H3`3^TQU-&z<0h_BK~*27icF4h
z(Wk^71s(}dBiK>%{HS%>I`(qUUOZ!5voOv~y=lCK^rc?SIZ_MxqS8`^7b-2L_@B~3
za+g+fPb15|bbecO{g*n?M`rQWwTLConQIx5o?Gn{OtH}5G&er${2SlGlA@7gJY0s$
zTgOXKv1;yS^jyKQWK72s$v`55WNbwFwIb!J^wuQ@H{%Ce8~DMk7FA;lwdJiiS<*0R
zI$s#m-P{G9!w7MA^(?*99Fd9y_&<RsQc)Gl>KEZ4v4Sduy}D>{?`!@1<QFEo<W|F@
z!?YAi>h$)MvLD&^{m6aLGs;vaw@#=bA_b+@c0CJnkHq25y)@zQt7wYB{7hDCi324W
zagpPB)jB=xDAnl`%8;zB#N~z(8L13<DBowIROXT*9FNg2=k}CJ^T1Q>ZK!ob#oAY`
z{*sRT8drLz`f4th;Vp0;wNV3$_2S?35-GL79ksK<*_lzjj&5CT>_%qKr@~bOJ_{E-
z+(XaH7whR;vEG6bTR4ubqGB&7^DY#lEe^v*TROtV%?-mw@U?piObPx6MHDU@->FK<
zN`-Q;vRBbuP(VDiu<!a4xnK*k`&5O&AwPpz&^zvl-J+F5XBKSz%*An@zniazzwhns
z{j!Cai0kL;x*OqLn>@yw<QkieOe<cYsV8!SHnr}`u*+n<TC9;(f*&AQ)V6-!veEA@
zKHU~Fc`nZEj^Ko>@oyhF!Via{LOdr99c`tib@%G5puw%*x15D9D)x&iCZvd;-vJ+%
zv@nW0NERHy8!6@7!h*f3Yun)lDqJI#FPklKs6jn)3GD?sF7^g++#SQub_aRAPPbRz
zv{qZpTkOWkE?;hIP}>z?X0!Za++!Kaj)M02iADZ_4y0LH9}>C8$QRqB3gCv-^?g(4
zoI$gdh9q}N(SZoTi`DctrZ}l6_dpHG?#9tF`T7nU)4}voZBBq}-YQ;^zq=EVOu5%;
zrGu3+uoPEnYFrO`9Q|w07^h*DyP;GyDwq-1pJv*^mAiXW=3-cHG}%I%+fo}ir&c9o
zQiwm9p`X(v$tX>QA4cFl`=Zx?)9cw6aU)#B_($%%@oPp)&XdO)G<N(V1BS1EUH*0M
zx$bAq+BzrA59se5#g@-}P#;kDs7lmjd_xwm!GLclsJXDDyG7q}$%`ED>ABm~hQr(<
zBnafE+LaJ>#=<@d)lif`o}RXQefuZy^1=70h<zUX94@a?Jg2Sq%<Tu?BQT$TmN9n`
zAve!KvIqvWfp5)6Y#;LT!7t)qq6s*^p&Ro<^0-7xf0!*=`*U?5#y}dkoU_=z0mZjJ
z|3bF@TR1mBge@%7W#||-#wDA3Sk9UJ_b`y>0kJ94gnO|oGAYY2T&Y2%RK&h`MItsY
zV>s1`!?`O5j;aHZe6`mmJV#1ov=Mm@5YGwV{sNq~0D?e$zd{w#z-f^BK*;(j1h4}5
z^Jl?VHb~ixXa|=m7ybgZM!ZURH{h@?x;eKs8Zp;UC3b_ao@U>_qsRn;9AEunt6`j8
z7(9IWEu{|`m5e14U32OCE!2m*T$BPJ052u2%U<%<wwhHS%$6q+A1dW&g$Vz45-vDW
zqB(`$4=!la%Ehx~FE>qKi)}e8SGa2Hd4AoVW!BArM-<-~0No!NndQ`4m05a~u`Qu6
zlwydSt%X2ft$5y*kQ+m-%iO&*5Jn<g5e?sZnyYEWLUVhf+k}#iR{47d%JRMB_+dit
z(J+y39=39A>CYCa=o@0ODQk6yp`wcYjzh(~>f-!;>!w`aD;=pI<60})W@0T*@y&py
zg;!xbzsulBeP40(6wzPobmdB*(r|CWc*TQVD}Rdn3^*4^FF#n5FA(o)Rc`pbYVCh0
zCL1Rdj1J{_rWM*(-%$(lIP#{4<-`GxwH#?UwD(_uw#TJC`Qkn3fY0^b?R*u!7Xp~O
zwN`wJ;yiR<K9jJbAnqH63)UG-j*|7<^$)UK!W?bU(@)|W`iDORz}pAWJ9g8=J@#oF
zL(wHhd~w8qi%r5P6eEgzr`^i{vmuQ2VD<<fb!ufR^f3DuY@@aG`&k6E>lV;<8jr}M
z`1C{?+6&mf7p<J}{+_x*FSB?G=tBu2I8Q-&5PKXLYDU)-gnHb_g^@QQj_n}w(F!Ws
z!4(kB?6f?ixCVd&)8%>)kB!Jr*bYUMe{crpii5KQ`w{`ZP@kP8K%iz?!BnRW-Ie+F
z{Mml+XPn*O=(Kb6x>gUK1pAHPpkCUo3Z7jwB1Y1ek=V)mmYZPiERAnvOvV+%KWwK4
zQ}u#lYi7;M*OTrl#PghFe0#}WR#~#0?3(EZR#1q0ucPvIQD{AoSw0HRnm?Yk&N|(n
z1}CS@mjjq^rDd{57vUTLg*${SZFq?OFczlN3zya??d^RmYdS&q$!I>h-BWozogHh|
zF1uSLLxa0`ea`jEEwWbvaE;*-n4%d4GF#7CrxQ{<j(5PUq@22XtgiOhQv$orj*!Mz
zQ`(#F;mG*rn|c)*aB^Q7a8iI!CXmT=vL4_7KQR$d-7q=$BpW>o?aEu2<4iu_Hr@>N
zoh;b(gMZyVwub;Oj-%1CIUh4`amQ`?a0j?>31@LSil)<W9wlpL#Xkw3K)RZ)EIeJS
ztf$jJY%fm8$9Wc}Z$$$oZk7ZG0*%`D!h55^lo&rx&}2rkcVglu;Lq4)8a+I9?gH{2
zyOm~*E2GLOhiBB9QyBy;_AJk2wc?P)(i)HVnINS-i6(mRKDFy1(zx|pZ9baEAjb3t
zXP2k_Hes!<&7a4Q%W9CZn>|nYFeiMU)|{*lc8j06yD>L$m(v~iyTMrC!7fI2{ZNb;
z$|>8n$oOB2Ail}m6I;-J;N&MU;H-cvPWg|-lw4a?@uYnIB}gMZ7GsRHUe-c!uykDL
z{rCI(XJ@n7Vqvcwi6!6e?eBe;Ln9sK2y5<t3;%t$mzfRQqWr+!Wrt6rSAn+%=a**%
zV^*o+XzaU!YfIpOkYVPLVCH2D7X6<tT7$Dz|5fK$wNG>UDOnS?vtMkOiI$5|1;|_Z
zI9!DkJ!X{zXbL1gzMR2N7%S^!#iD1?>N*+oKDkQf^N=sb>})XHh=N&sHOFLjS%8_g
z%79ipO>+ydm}0O8gdc+lwbW$QNO=rp>r*r$%gYzp3B?$q-w3Tfy6n?UhstP8PPE!S
zn7nD_ofR&MiA*Tzts<sZsAw}bz}9sj1<9siV0f#y5rV@&w@3GA>j;2hK@qP^xYg-c
z4aLa^O=5BkSbR(Q2~)SQdsj)1ybjL=99W`_uRV;g@`&afL741IXMQ}`BV~h-goH8z
z*kC3^J#-4`<uaDguuxR+D_zhj#0J`=9fUQQ2ivpNwwhdff-o4oQ?e&!DdJ#3E_iHf
z@!_qNMa@Q8vqpk(yiR`cQJ2L~V#=upfIpDM6Ft5jog)k|?>A%TEF0i&y6t|e9{m1$
zKqWAJL3JM0Vr+E_^h;u=eeT3g+t@4>;Cb3%)$C?<bTv}jzcc;JRu$VPF-OD5FwSOG
zIZB&ll%juPOgshfD&}dN9m{N4Q48X&*D{qb`s$L4=zz2aI2WST7m)zOI*jrFTm|nz
z5L2V~5t33eEkLS6SMBD$j02LG4D_^<V6V+1^s<2s9kRAQn!q7RH;)vvpK{C}b<WP3
z=f}azR{wSDr=B*0;P6(?2`2KgP^a89NpC$*D0WT*1Ua&MlD&;H8po`nYq<~j7*K6<
zzLaQ16q9a9sF{@fET+j#>Nrr~ElJSJ4a9OQ1KO(`C)(#fG*6!d?KzujsKTfxxHYp;
z000i5#cmeH3xw84lNq@?7Aqf;q%i|SY$rn4!Ju?*fOfHyM1xdG_z7=!Mav<vYB@^`
zlX?mTfu~IL9wUUuD@iJi1O?40fy`q*8YJ)W%8;8K#YxjFkx|;1j*=}G<WjStZ!!7X
z4kpgUrOm{jGsf>lUf{BUv5h5#WU>MZk<G4&6=9n%*Z3-Ynj~-63w3c$H+B1RQ&+!-
zXNkF}HCDqf!gz{SK-jGZmz_MAS+8+51iDwimvm2rdo-IjLJe$x^O)51@ty*a^EpRX
zww?e5<f~gC!!^3h_&(S*@BKb1v;j8ve#LxsH%c)@!jk_yQv?FD;(|D5IbKM44CA5g
z8)iWC7>gK#9&t0uvPUBm2G*fBd+-DwSci@KVgo4kAfku|UNc=*0k?F<W731dpTqUU
z?)&kMN-`^uiIq_ihWx=qjC>_Q!~&x?E^ck#L;N@{Gc4Yr=lioj(n6w54JotofZ=JR
znN*Ut_enGxEpBl-4SN!ez$%x!$$CtYbgWcSl$6MthdAl4(4_-yHSkCw{zIezbECK8
zS&4dpxs4h~#W@s_;bXUvZAupy+J@6t+bt=wMr<mL!^#a~!IJ@E&DL36nbs2HALp;$
z@F11ARch;-bm$;9&50sD{>-+Z5z5NN1m(}6As>NtxH5EMf(`pQ<@XdDpv-UhI~(U%
z8;fGf6Dz2}PCZ*+g{b&MioN4#vJ9_2-NhfCePixJ!d<Z$86pJ0I=qS`{m^(#2NuT{
z6BB;T^?ycLhqx6hrP<@p@Fl$P7$ow<aOuQ=8uur+aTUoqX7s_haijUz1RQtw^$y@s
zngILy!P~`CK}8kwB|BEOFgAJG;S}DB_RwNVl9QpdX!KIVCE!LyqQGIzLY-)J6)Q<r
zXLr$Has(7L93Cacy4}b$n4-aGsLk0-0^8l^Jh8!Oh{jFB3YzFQDuA_-;IhEsv}>^M
zG4|^;dT&KrW3d+Dp&4R{er-ZbFQR3fj8(#%Cg%mJO+p}xDq$K&2(=kr-8sTp<?<k=
z{syzLLo+&sE%VDY7!!&dc0;j_#htE_g<>{o#`s`?H$}P5Py++2Be+9o1wuYEeo$*k
zqu`KgY0NVwJ`}Y#lvB&s!b{Zx63&?d@s$YG*-_C6Ktcpg77=S2O;%Qn)y%MYlIBhZ
zCHaoJ@oHFLP)QkGzFUkhR3R1njMcd2s&6hDj#Wnfk#%l-#!1njw<`>@M+X;WWa1P|
zA_Ap&l)`bxnin_?c#4?Hadi`k&MS2`3Ino7qw4{LYF;X09{`$e<JJ(eq4Q=q55EsM
zi$SffEjW6#$Rs8X;}uy|GIbG5Ls~IeQ*Os)v@7al*3HBkh{_LK_5hqnzKPU{^))h&
zMrv$Mlw;yjmD`k7Y<3I}rjyG{2tC@fWH`^*>d+uP+F^t)@E8M=cmq^m67fQNo)je}
z482FxpSy=*u$@sei*nN`ys;=hsoOD3j;M`@zhlyfbYsSuJEP!l$Y=~W&duM<j3n}%
z64Nuq7#fPuPJz=^8YBZ9tiBymFvDGbvO5dk@20RdcUeWcoe4>(gC8oW^k&2=iCk@F
zAi+e<MBLGdKLj5kp2JXbO|CRPFs+bL;;{n94P_`q?@WR|uyCZEkbIWzt|Kj@Uln6(
z3I%VGtN|`6+dS)ng(%VjR~{K-j7X>xV8G@}ltmAh-cBtn(o};F!c-B*aLk$p%$-QR
z?=GXM%1CNwK*ghzcw0bl6%A6xi{3jN_LSFK6Lb{eNqf7*tXwJdfqEL!lA;tigcEh1
znvk)|R?dkyiBa|?Q5>eExmt(I5cnR!EkF;Y)aSLq#a3nu!3>z*c)^JnQd$IT1lM&K
zSsNoyyv#XLNV^&tmWE-GWod!s<mc5CaywQP<OqaI+Q=19ya~K<vk4yoi0maJ3iTNQ
z<yfbv!p4;!i)7|IJ1qsTwFxGq!L!MWHg(J^uGQ^?9VSHG7Ro3M=b^4Jf?iZ`m`{{Z
z?KoP6F-FIo+uN2(`c5HpoL64Rod;S;wTSkbR#-|AAi_YjUc$7JfrnW_#mW+afY~<j
zcSD7<#;<@8+5jlKH6-jS?9_M36eG#1PDoP6?J1pe5M~Zoy113ts}d=8MVeajRcHis
z(}D@EQ0%txC)@Q+$ZYpK!V$n>-Cz|_HlhsOAZSZki5x#q<SGK_IGh7kH=(|K$lo~_
z?kmzrr>KkVT!yh*qmZyvq~3%$13uK*R*Aea^aX~JtFWB3qQdx+R#McQik6d|F(WBo
zP-rxz<tsx`Nrhoj9q20$cm_zur>NZ+XEjh5%moeZ5>9IA4O6Jun8~Gc7@1dx-U}n0
zP0oY0Hn@G};L2m7h+-7R_K+h@T^6}bTn90A`cOfBmS>_eqzHke>qex76fDWQn+p23
z3(-q+NQ)?(r@HnMDbZYcDw2SR4+JtCTmDsooa0gjEe>zh;bTn)jl+Y^91ZhF(Lyun
zS_6OeE@hl*;7Y1qEz1c$?Hf#TBSKXPd7Yb8P_vI#{g_amIWx&Tfj$eExo9Z@4m?UQ
zWOM3jgA}_YH=A`vZjahruXpZU8P<CmN^{vhY}Dscogw-IH-bklme;j^>;)hF+0$&|
zx%!mrQQKT53~V{p4bhoe2V9*JN+*og7(+U>MM8r4(vl&R0fIJt)TfzvETKICjntd5
z39mi92bpcACt{Rixo6<xq@Bnlb8;>m-TPN3l@q=9E~!#=P^hARpvj~jjhvMq%*96=
zPNug;WZnzT6Q#GwX#j?iiVUu7BayjOjL&DHFkSMk@>p$+aXcaHU$GK}<BcclCEHiO
zi&MHVvb3q39zK&E4|7rR#2mf=L89N(9+|0=i~^WxC#_<BK`%q_<ueObdl?m*X#brw
ze1_N9e=6`hPb`H5OY)9VnDq)iU9htE37V@_G+V4Jy6LeVU}Fb3BCNP>qIQZ`w++QE
zn3EhA>^fYaMMyjY<~s(go|0)Rnz@XwBkX{AO_lN7*?ijm)nN{p#pRAEgU2%1$Aa-n
zZ#+4O^Igd7vfGUjmyHmL_S+}hK&a?l-ddoyn~YZ=wv#_hxExQBk4wmgmpCJsl+H4r
z6KnZ8S<Jl0E_yqI1_pq}oo6d%?_90|ep{GWvw&geWi|7sxw7rR>|O4r>GOj9B#5bC
zbD5H+OUd&LrxixKokte>nRp|%eNjA7(9t}o#tK9j#0wt6X=t&9*x29KF{*MD-nvlE
zPzxar)-auz0PM9S<7aAN6|J$Eizl-kK}p&(7e4UOP4(J;X${VrKe~0~^>dYjf>(AR
zgk~1LAE4T0z-pJQ<E5q-1byKLS$S$v6(`(T#Uo%}*ne?Ou1++w*j7$8v$PFa(!4_%
z=^A9qDAf(!aMM1w$pR<tN*zzLkBuyWkK9WY%SHNLG3W0VvWWLz_Flq8vV4~A`>ivr
zb+#*e$*pl!JQz2`IIz*cs`(*v(<Ipi$T#*z`O2bYT(roj^n?>Ze%nOO!jvhfR7XYy
zT{FUzh<F-Bcr8QMOye;LoxpftD#l8=-BbjdY%)k+0xv6NVZ%yyCUx08`;K*;ba-?M
z_+GG-=X=wQ3SZ$xxbHde@#FQv+YRS)V*$ilHIj^Kz`rcxVd^W>7L3J<=@;wt)>r1u
z682(~3`V?jT1;=>04J$}Xq6UfSpoU{C3>W(X7Q!8AVokcEpfh{PB)io0c&?#UJM|q
z;;mij(8>kF-#l>YutK>XqU8|yx><#yT!bT|l@>gz&=`WPyb-`+`cYcyI9U&;UYvGN
zrnnf{y7R5f@z9UpoZ7(mt^<7a>&QF8BMc;2@D3j1ruV%fhOig|FcQ$kIxT*ecy}?c
zM?WdsJ*rGGsO(lYmx8}hIBOpl5wD`>v~Cy6WR(<Auu{y>FWd7~bmd1>U8ZOibb;cP
z&_!s^w)onsv>*fKV&xwa(OE7+)@!A6v<g>gtZdn{Ws4Wq*J}0B)kj;3I9AyU_-8dK
zLXzVC^g6)edXL=oDmf#4d=Xip>$cLDimLhwaX8Wf(!e>w3tsZb;hZRbd3@F^*_2D*
zrV54*t+w7T;$;z$EPmOI(rAUAH>rPM$HShn_j79kPm#<DCi@p?t~vJd9Qdj|A1#N4
z6?>z^KUjR(jlAnZufq9NgtiAo1y0bUwmqlzsc=z2j0RbyoHTeEy|2*Rrc(4$i~&nX
zk}ir;O=*FPW%RDJKnp#5LlozI#V}oW0lMO=mxY)N1fXE;`6ch6;`d4z>0vg*D#Z%V
zO{)|_%TJc_<xWtr-&}OlJo?Lc_M+qzvP=1g)=tp^_Ck!Yx@fMHdLaVEn!rDJ8F(}?
zC6ms!cTW2CCCEL*<lhz-wA^XE)E7lCp`-m}h+ZPTVi!p=EtZWOXFy+xyoXwODceV?
zyrj4SZY)&TR6A{V3I!M~ZFQW0gKnAlY93CZ82OMC9VOvAjPp*{7hYyE3CCscv3{?#
zcJW)PTYNn0x5bhMwO`nRd0X59_EOBeU<)N2F4R4lCZTs5Q5Mmnmsqo$ZNlms_-h=w
zpmskghk`0s&VaRM@v7N5@i$V?_Eiaz4w@;@0Y7v?%m#Z4w7o}8%Ei1&6Yng>Wx}Sp
z{q>$N`YO1%kE3L^2n#tLMX3OG?M^`%*j-5Ps+Q4?mA;~s5S!_!pEDem7igz1IM5o&
z4JDLb7sLQM$$C{%6oxNlxnJP9-wA2;5^v1kN)^2H&x(&!2msa7Srn%0CB^tDJj9DC
zwEU_nB+Zmk8uO6K>K2qc2JAwnrc!wnH!2m(6*?_|RIXrud0V;c<-BMCj^is>XWV=n
zsG}}eCOL8;fOU^;puPKuq9NR>*a(!{q5$NclK$gO<tFJTn+t3G?sScR&hY-}3QqG;
z6u&Dt7=Y@yr3*P8DuglYG1T(rQWVCyP^VF$9J4i)1>R57l11T5#C?2MGSstM8HAsa
zG?OV3=U$Rb021Ac+f`J=M{<c*(fgz8aJiWb9LFipi#h4%3K$|&<Vfyat5C96cGAFX
zlQPjlCRG^BcvQHaMemL!Fk<05=)CBiFrkI-3nVS8YSHVLCA}61X~&#crLY>jD|+P!
zXN3)H6ye-LegV!dgL;bS?Z*DNSWzjI?FySfX}R!ak*uvM7QGWDrLf%+CZ<K#X*y3;
z!L}%U-*r=Bah@tad$O!r)G5$hUZoU9v`WbWT+9}0&x`oaY{`;+ku6#*s-GlFFTT)G
zave{{uOdL<VdR$yTJK}xF{z|iFbB2?yC^K6)(B}kI=^{&K6r-*e?+&bMI~OKhX5i~
zq51+#wJ;z0hBD9>y)S0L?NTKdMs~4cp~x;(#<SSvF3Sq)5J*J_Ch3?<OPIGWqY`~k
zu9SDD=Zlrd*SWH#l6<ao>1CPdfe={=lsp$uJ5H}lxF?H+vvQsloW-Zz%Yva4yy3W&
zMRojdEZM7rH+m(C71WcZUCc68h0UOX1p*(G#pHl|*U&}dI<M43xA{dpLvIw$+3A9L
zlJYXgz_2e9zd}eCf&;KnYYK&mo)_JN(y&<YMfG68ikSk<Bd;NZ$<|iX%5fB0nI4<S
z#wTf1EHB%6A-NP?_#d4Xb>Od1R5~9zuvkA(7&y)^zQg{Z9n(``%1SAi#3L)+&qr`x
za_7a`5FNaws6;LZL6IPm4V6}Qs2QJb|C(!4$>P^Jv-aYm#`(0kjP{e-RD`*e51;+V
zzd!$qk3=0LkB`Uca`gBrO0L87dT>qYy7op7(8oT;PyF_4{Cn`-H~aQq_#A%o?ZMao
zaq#uQ;kVy>^WEWBQ10Nn{ey4*BiMg{zBhi>NXLWVKh{HFuh%8zHoX5|`gu%->_^Gs
zc1cNbYomH_xPS1~F8uR#Be;#{e~)jXdGNjZ_Mca?FrMy>lG$@_O{jDhu2um^r1Q}<
zo=k%8XYl(!ucG-?lv2GtZ^du0%WoS&FPy#$$ql#{&L{CS2J#(zAHtEcjDE9vr&gM1
zGK;Mk*K=c>515VCc560`6c=F({hF+oBX*!0#&gPelq_dygS{{?Rw28=i`TL~ZyIc=
zjwanJH0W10>&6Ad<d)AwOPfV29V9k8G%}T!F^w<)Ai3$WPZdWvA7W<Nkp>v%I3BUH
z4t&T0RHcBjyA_8;GbZSCG!0R~wO23@4545kq6Px<9IqwXW@aoh1{u-4#v;izrKNE)
zS{sKtsP`DwLlVKDZFd|_Qv-M%<I<jnn%sF5ONdAlHi$jR=81Vq(8rh{Xhuv;B+JzH
zc2{6d(5yDWuz*k-MleI?9|jH79>dTu?g8b_A~2-MWOajUZ($RBbU>HIGM2EIEA)g$
ztV&ZEKKc2*YWIR(=cNCp*=+^z{i56Xp^fo&U;G3wTftH1;-_x=<*R=1s&jhW>h=N*
z3wYEy?|0iTF8dvLu+{8A%`Ms~@UD6OQ_%YHqTA~Af=)MRpIw}`p*`rJ+dS{LTfIim
zJ_pwBm~xdv8|b+hoVL%}eJIxNG_YTCZq3yUIw!$dtBZ-3`^^{a({}$S>hh%BKgaG)
zpuc8t(d_oyN0+C~Zg6qgz3B9)HJsmZyLWWjY@fA`_h1arZ$K%TgWjv=>1k%Voj2#L
zE>6InD>n23lfN}zoVK_-nC)@9+dAsww9L0703r<X6iCfQ>!^)iT0gd6M$PU|4QQ6A
zQ|G+b`ahRY4&DdH&9ml9m}6}NbYO*!F1xKW9C+u1+)6KB^!n}oWxo}?>~xL^?7dd^
zhxSpc_cS=|^aya5y;cJ{={K=^Yz3eOui^WP%U&DdM?gOZ{;7LODL?D5=5GK(0D~q*
z^&?n!&S}m7tWNhQY!`t+OVJ44ylTO7So3q4UccK!aP$CxM}4~_^a}9oTayjWTQ5)B
zFI(qFEqvR-hTgP$tvWAWyN6}k-1(a(^n8iar$vLY@mC9%8?>}R`y^-{|Io(4Gpw*Y
zphT}N=mYh7mq)Jz`s@nD(WW>uLl_)=`6celBiy?x=(B7<jJ7!*;{N<qoU$e6CK<z{
z=!PCy>y?DA4X#(KMf&9N<15&#>meR6kJX9y7+ZQgoF>D^<F60D+5bxMNjY9=vEV`e
zA%>%G4U~LqG7Cq`B;C8-vL0rtIq$~NaD7FUoacCkUhiE$hqlMj1U-t52i>4{Hn?a9
zkAs6h?(gl_^{ejStodKCP~U#_-5(FW`fhLEe$zguH{X2w-8YAOUmbjXXkIn}vx1r`
z^H{ZG8g3mOA!^sszb{v{gT4J=7m8D@9r{zRo3clpv!J%W_YDT}q-u3oyvL7&{~Rvk
zXhIPH*6BK&1{dweFn-Q>2&cRRZX1(&B{*)q9P~SbZu1!ZPWFH^{Q8@(4*zuc&B34k
z^fi3>=DTnIbokY`f7<`<+dqE&$3K4i)b67Nt9-qk27h0ND|E{nk+XEL49D?0C6}r<
zFMGRx{MzlZ1vKgv_SnAc4cg}zff{M+GX&@1cYpeB@0)M;|M(5`<W@uC*MyCOUQST>
zaDV@+@4h?ycJHh2o)#5^E%PkcbxMAQanfL*F<LlAs>(RJ8o;P)@-qbCEcl0sMSBG>
z26T8DeDGI?ssm`ExcXyNU2iWtG!umhfI~W2Qb4CfCz;`>va4tj)P{J1E|ze#k*I2g
zEBI58M&S|zfh?mi7$z7PSHi%_Li~LlX|I!YJYW5BfYG05i?pPt9(0nvxb0Gfnw}PL
zl!F=i*a7b*52xYE4w7M)kpQ1E@566dFr{dYIEQC}WCRhnCa3E6&iXoOCGBE6u<%dy
zD{NLd9I_`6b+n6x&}Z!|e2Y=kmogQ~l*Id;;5|#2k3uM7Xh#m|LtvuDFz_11*y7r&
z1h|bc`+6@D%tW@w9?DN7h@%s90DZoJ@mTU;cT^N4B&!P`n(t$Yb}+mp-^KMxWm-T^
zD@3<s6>AGvxOg0g^HeoOyfDRA!nDa_U<-$9c|>t`u@&I7Bx2q?x!JS*6QNe{Joxro
zjI)T}zYli5{nqs(ix#`P2Fj)qP!Ut<kFeBsQ4>A(WQok+Dv=D(1U+X6v`XIx2lWhM
z=y%Tnd-O|%NP<`R)DyRIn5@|s8FqkLRA*z{2I+OUh%m2Aq|krwI(Qi+J$z1EiW*6O
z-v0#%uY5oJMaAcw#q)T!o^jl_@I8G;*F9PT3Q0kDE%gqpHohuvLza=wQ1(cth@-&%
z3v+E2nr3y4+P0;f!J}YGc9{)<!h4x!oT?bn$qfa}s8M)2im^>XPBgxXSau3Wt2M>D
z7^04nqLM-%H**mj9HAn-g2lDcar`wGv+{AEKRS%1`|;F~)`Gugiaz#y%NEMjQH|l7
z8m>@-h?d=!^*G;}T}QX&l=BYDGZyFVUrk#EG!|?gXQARWmU+vKodYHSlFWlw5ePR6
ziUh}>Ua~HD69mmAq9r>r;?Yfk$=M5D_Qea?OfQo6HMK#49YQR95bQ8=I}wxABRAB5
zIyux{!MMKI)b8{5x3JgTLW1f}nFF`XbwmiPOIXY)pt(GxKn0k%w%sLph_YP-e^zx?
zdvZ8Fv7YR4%a0H1PJcJ?7^L7&&>b~Qy-{}#7XyF*o?^NRF_5qD7cx9Q10`d28v&4W
zD}z<Cuv+4t{S7@HCBOm*N2J!{OFf=?eM3*fWVHej;UhZR&3C4P;BqKH(dm$iL2Ut~
zY^lQfYmN2h)Ldft2#N;^NSr3<={vek;!$Kp1)+FOL^**{KL!d-6MKwDo)r*8bu%#C
zU|e>Ey59$w6!HL5LGs|uvGUAY_s?c;?B)Ua#Qzo+)M@>&LhE0aw*F;F>j%HsGu$=k
z>6H4)DfMNxl*b`|w5Dhrp-LBpXLTCXMiB+)`ZD-qot1xdP6=-{O5Ra?U}npZyQM6M
z6Hz*uGz>cUE8#}z>A$CfmN<Mw8opyz5i3ulJ)S0_0#rob5oVZGgL*zqoW+Y<Y8phK
zKYpF1qKazjW^g71ewtK+AV*)Hy5*=lrX|js7bqX#7@Vi)NHB(|Z=0)c&U+juf!v{Y
zfck?eYGW}#1b@LN;Yyx_E0?oRpQ<qVxx+(_454{)JaBF4#n4r~ORV?dD)(L;1~RzZ
z`$PM^r#>c$f7oLQFqv0GNhus|mr-GCsLPb%^BQ6!>?tJyf1=0~FvZRp(g=P<B{6E&
zxf2y}1T!_G#;tk&QgS&pkfdQjQXkaR>GFRMVIS4>(e{52>l7G=8`0x*We=_7k&Q@n
zQ3bvmCCj-90%Bxf3j!KUmCr>jZs3O};5jLGd=GJYzC(P+`&7`+9q*3kbQd%s42KDo
zO3Y4c4TUXrcVp1~H3<2%+iQ=k?fyt_cNv}PY>xL81w|Vgb9ILe8f@bc)^%Ibl%Pg0
z8;>+WaLXM>)T7m*>5nTSxu~0{JVz??pVn0X_DAz%eRZv(WlZB4QYW2M;2lL@!FDt*
z_mUYUFy`p7IpGbj6yPT%&jGPT$KKE<d&uICQk;zSNGNX}MYHBHHB`*6dA1c|B!FY5
zBNYDLKx6PH!oXlDu*pl3sa8qCLy^5;jZ#bc>V%5mAC67GXLAqZXoSZ@G!Xe#m;@t$
z+r*hh)!;!jXfO>LnJhr*%9%r?Vd(#!wD^er)}P+D85z+d`g{Loct(%#&;1)gfIuTR
z>^|ZsF3i?D7TQ+xY#Z~4pt7e$ayUfXSUBIigrlBY&4Z^O)jxsL>OY?UGx|sH@9F0_
zYeU2S3Ektu+1<zUkL=zGF2>~hIk4l89=XM{I<M4LdOaKgwp!argiCS1fDl{reT->0
z`932<n^MC?uQB|4n&uR80HkNgQ~bkOK%&w%I>H(VXO@i@_VO>SZl{)^5Z1&B%M5NJ
zXZIHu%#eu>WkUto?YUwCHw`sQ3k%C+M^IcaGbi6rZG=}~P3D`%S{Yas3f^O=2CSQh
zS^-$zb*&736?_i=748`K1`q-x3dwWb5``gjgdr(GoW?Ut98!6bMB0K)CMWYr{QjFm
zlDK5EHmC8`oF7RVqO4e^K!x`&-+nz<1$3dq<J`mVB1hxX@4tT*)V?_cDVyFBX+w73
z85P&b%F&vE=P>Wr6oDVG>k92(gHgO3O>HheS<avykpf}kJp|jxNe5&58p!^Y%nzM+
zhbBOtDbGP^=?|3PU-)O;2qY*ZmBJ`xMj>>d%u1=M{SL=d*YyrF^$x9ihnaf%-I`L2
z&1*GoV3!Ags$vE0ce(^Mv&+M<OQ`Fvy?wli_1|so*r*+1dnDnkp~f1d7u11C&pYbJ
zA^muV|4G&pOFwHZPkYjyyVrK_5A;gh9yFXy<^8B?ho+kO%E({6l^um#YW?*CBSP88
zg@c7rQt!74q)2y6z2`EBtXkR8CT#)^Yhk<)vH-Aon)Y1p1Ex|~$&5-D*#%fb^{h8_
zT@i)<TBD?-BE*Iw!qXKfUmd-V)7@~&p`%f&8e-J&h7rJ2iyT9j?;=BCDk2GeuMN)}
zJptuHN>je`OqO)ZFqLS$N)Bf;Koa0_M55EDMA!JVA=j+#nDsD~4HuOi%o<XEFni*b
z!!iu9;E6p>b?ckFrxFB9DWO#z!$?mydq0w08r5CRzA?aIIX4#8gS+n0V8b@ep^_oY
zgAE%{@Q9$4x%eRUZME9?_rTh|PRGv`Kwz!;0@;42fb-a4KC{uP?@LQ;D)Fzd|IOKd
z(*q8@xp)0AeU#dNAMPK1b@*+@{u}L+{%!yL&-nZyp3E_~qMi5Ul`#o(o?7N;>23O$
z6vJqfW<6ewfehuJC1kqhNo|R7o1r64Es<CW+&F!jia?uYD=J$+PECzgPivK1g~MvI
z0O^}Y=XJ2}eSsN*4misEMLQ5JYjHbJ=!aH!a3FQWOGlAz%bmt}@}wr~A!gSQONxS`
zWNx8~lg|DcrR%X+S*ttV`Fb{l6T?pBAO(Z;c0RgZCUYP_Dsy7NTu|$c%;2le@c<^(
zYj@6ruQVtyi&iQLci2cTEo!LSY90r*gYUn$%@MQN?5V&(T})*3<OdQcG>G1>mZ9{j
zZq2qaz1g--q0Ywt6r*^RtVh?%I_b1~`S|qYQmq2!Tp)%afu=E+QxQ&Fw9W^wTR#oX
zJN*vYoYDxtt$*e%ecJBz2d{9Zeng`8{bu`APy^@0o296K=$e+Gb#~GJsi0L=1}%2a
zUqaJmg>VSLVQG<9&E6|m<kGHM{ow1;5`V!W-;@^NpTW1ACe>=51>XryET)?v)@@y!
z{xrBee|_G0a~|yap}~a&V1B4_5!m{jZUIQS1R7tzY;_A@%4N_P{-*+vatR7I{xzq2
zNz&CKF<I)_Osa6c7oA@JqI2Fl=3WM;Et)maKnglpRPnqsX#IH6?zU9%9yvqOg|^<@
zh28$8d3-$h@ki!)O7=CCJGaUml$3-2TE|lEu%z7O#c>l&>#^KdW&L(8biZGhlzZ7X
z<NKzh+^JRWTP9PeEU5r4+*2@|^OkUlew^b{KWf&w1g=!{N4IDJXsPJYNxOA=+zZN~
zOGR5h0*&bDRto^kt#&TY`vY{uP%!2kryPP-aygbJYSv{lYNnYemh^)(`g<k;v#R>k
z>a;l?V|uRAwP2DmAcVW@ciQ?~GDEk6r&MhZ&aW=n0k?iUI=$=x4^Xy#*-BmX+34vL
zFgFwoQn^!gC_vX>eis+r&W~ygq;6w}>VVv%p9C0%K&5%*G*EQAFNwNMg1aGEsYt4H
z%O|^5-?Q_4t2A4f%TBVbi}b5nq?A>sYmmi9%XqOWn#586$HB>I^JQ;vdfBwrrmz#r
z|0N0EFni}b4cSJ0V+UuKr~S4CbL=9Xi>yYTB(pG;#3376YN8Xf+FRbH(kUiy+t^a?
zv?-|bmA4^`SGG&Z;%ek4fr*f#kU@cI98^ak=7g9|>zjK--mG(e`jgtjzD~`GjySp#
zrIp>>Hf{w4m~Zk;V>YB_=Ol>cC})m0w}*v={QBDJ9>1vG78b^~zVo+r7QUCnl6WLm
zz<?jmT4(5Bg>C+k+B8j2`eN1-VcTdB@GfR7T_n?ZbjufA=w3LcP&u3hc4M!tAJ9t+
zd;C*fv(1!Fa7`Od<>efK;6&zOa{oWmBSVT(NKi~i9dz5ljl!GpRO`tOzxl%M=v^33
z$>7cDQg>Iar@@<M_Z)dM>hU1A{V^{mWfdlS1=gH#>~Ko{8_(ZX=m$Bk_K{{J4h~%a
z3O$7FHBCaAhq#TBjS=D@W=%YPQK6^PPV-pL#_VbtGa<x0p<%P*Dqf~A;c1{D2&a-0
zLq9R+AY?^RFXCLrvfH(Vd+C%1ZGiImY5TlorE^~0Bub!LQhG<&=kdF!!6qjRW%jql
zWb~wDTvdlMcG>GUPvwOBItK(I-M4}+5|Pfh@iH_>xT|4{*j699>71Xp0RIsu@{bYZ
zr~!!5N<>hP)2dE`6}t7x8SIjxAW{z6IguT5ASB!{%Xc^U^t;XT-U)~ty610wU`oh`
zt6`0Rv%RJt*E=Hw_p2$QC>Zospe)`PB=CxD@l|eKPS91M!zRG>2YB$ReJb1Tk9v-C
zWD;6GwvISC=maQ9FkZ7;QoLN<21m_aP$RJ($UD-<dW9b8j2|4gyM3n22Y)Ks=NXQ|
zn&t?DhpEX{=o67h&+yP<Ulfl;VPn|q2`#-aNYM@FFNOg$6s1wAtYKOC(g2OJI8S&Z
zn6ASH?n_$qa4xR!oHt7+%cj&}8;5(`I{#_#;<R)0T4COyXkjqyp61_>IyBh#A6?)H
z>Bg)^!Nly)Bj$<{8iL^fKL3n;29ZEXDr3ngORj@#6p#Kpc4}DK<d`$h)&S+h0jW%P
z&T0(&^E+?-$Y<o?VO=R+C}@yq#Ap$8GzVCnFeQh&78=6wPxebnlTpl*rnH<mQfOfb
z*pKG|ECzsT5?`$)*W+TnTqM|%$@L3ZkVc%wmvwSzq<uRdaf?u<ee%;_hn{j0tm|U=
zoyxv${nWc?9w}i1WhR{9=34AV&%CeHYHg_XvUT3-wvU9%4W!o9hFYR#VU9LXwf=t_
zYLTLf8B!(VLajn%R(-Yl!fFOqtwKIZYLUi^xk{_nCdmIqb@rWI>$eTHSm$yqOromw
zep4-E^Q6|FbgdHIj)FWY&xCDLwF-GzgBydhcCV+HFRnEUYV0#gTN-%+w3mG^Ua3Tc
zJZ+(Bz-)xVV_2;@@JWUnQ{xqyMj{XDZF%R~JGKG)WlZ6>K>EQV$g!zWp|^i|x1xv?
z?o4$%Zm6F9ohsRvNTl=PUrQ&;0-|jungS9{F_BX%gB>n#t%OwkUP2MP?`YrqYqbhq
z(DwDd`AcCPwGI6*Ww#X#9ygWu9se>!uBniu$=*HTl&|SYXaR8#UAcgLMBfK>!6l9g
zk+x6}B*esw6hV<QH%5RXBq(zDp}E8wLY8J``*RO*ORzt)^jxl^JZ_z~@FJ#`3;VWH
zC!@}~a0YzAHsdgr#XJ!y(9e1=2XDHa^OxjAv1Pt?bXw%_Dn#6r{d=8E$Li+h22&db
zz!y>KO1i__@}uNMr`IO#vVDHiKIi+Sz5T~-2n>7CS}&WK^1HeMDa=IG(d104cpq6f
z(eutRG;~b*_pklxT`F?+Q?GS;vPr$mMOmk`LA^^wS!tw;7N~cr=*0<MKy6a*Qc+W~
zOodKG&pTMS^Mg_K_<2rN2N7S!`fxv}GUWzN;{|}o*1>n^XoPo`0+b?3Ho#ChwIAw$
z_ngD@2S$L?<mw9Xa2mafrl`G!ABD`sY3JoBFjc3phhAL1l!z@`<wapiFFHNg6Ts>X
z;e^~!9LWr@dRrV;YeQkBL)p3smnhe4(Ue}qE9(X|T)!Wnv)}-xc6EgwMT+d;8$3qo
zfhuO@<}SMYzWj0UqIJ^gwzPV!0L8In^8^=66%@)sXCe7tVT7>=^*pH6Tv1H0YYIFs
zxv^8Dq~_CA3dIySz{;2`G2Yy0CGni-B6AH?aW81229+Gw!r<Gl(O4B*;;Zxq5YthJ
zw0b3hhOR+q!}MLcTQg$ni^NFMPKD$6eXv?akqUr<6)fZSt3)&(5#8CL;|yKK4R7TM
z)o|`o^v#HECO}CF<VM5^!Ocp4bsQZhsII`rHuHeOVy&)}Y-qd|uUOoHVaPGW>D-G&
z;IreC_9-svc}LMX>jvUD0%2+ynYeh;DjtHovO$FBO3LDpJ-BS{rjjdr-0?j)&d!hF
zXS>5^P|q3)21r4CNuyOm6al1hK&A^Z-0e7<5UN&h;2}GWM=`rb>Y#!Oj*`5zkv+q;
zEyg&J^B+e6z-Bc*{X(_IXX5rflTM9WBVgYWFcg@HB{CE%QqZ}${HEDIdbI&MNFFIv
z+flne=(S&-H&2mwX`i$e`z<$lB!i+u*qlPyO$a3r`m8lfME#gnXImSJ2UU*C0vl;y
z?J~3!s2Aknci}Qdt#TpVA!$~tba9H^4&ozV!OK>WJqB00K)V(=IWUTu|E8bIoxu6>
z3P_dzrk~3wO|Sp1pUWJbw&@QIt-y?eOZHw}_K(qw!EZ?6%vrVPH>cpD%uoP}eg0Y%
z|E_GHz^B2CIv2qo%NmuP&+YwbGjIkM-Ofu2HF!|AEWJ0)3xM`P*^-dX_eJyQ_2ory
zP_`~`AiWlq+<{q}LB1dfJ_lb1O0Xl;7l}?#)RO69ywRit=~N7)JFz7yx$!2H&R%!N
z<ENGmAwMh(*<^E|PGuMi`b#|J${BkzV<`s0#sW22VH#{>m2GP2LvCyoY%DwKqt*MT
zp2x==uo+*f8I$c*Z718R&Ms5)HXiJZR__~mI7KnY;l>DHJtRmsxR;$VXVOy9&Dez{
z+XewEM^n1y!l;|T5X3a@nPtjboxT`L=mR$UZTLIAz_m#+iCeUxCyOXmZTtkJm222B
z<qZoJtJ>(P+<lcdDm%MsqY^cpK)#`6hgeo^zjwV}jWG~ZdE1J-R&7>LrqZ}ws$3Z`
zAnTqc6!E4MD2gywZTF1sgHGf5+e(AapA(fk;{9By6Z_n_BRXCzldC1(J5@qUec)8a
zpPO*8aU=2hbQj!t0pxGJX>F||t@6fK>1{S`eSHY#T7D{$7cz9nd9tar<9s_dCbx<V
zZ)<tb*xweKCSAVBQ8twP@XEH^FJRETm71LsspMx3yp?)CogZ1<`FRCz&DJ^Ur2Pz?
zw*u-apvKpJHp5$mxQ=i9>Iq#zVRL1msS1?=rhAa9^v!@$H7Wr~6|M*%RlE{#oO43m
z;1@Ff1=XN{sd=zrcy3i1<l%-v+H@5-)(vB`OOq6^X+%<?(oo#<NnQSL7*V#;$qCik
zG_FjwvhkS;$X*F|1=8vpr3@{T7<|>F@1ijlRICC)VWg^UMO7H~$wqLgvei&ZDgEf?
zY!gQD@5^&3z7e66p1i_9vS%%6^(qo5T?ehIHVrCQsWQIHu?p-{tJ$xF?5YOz)9-YP
z)C1lsNK2aCV~c<mZw^(5X7bf0ywj)n;6<l<z7g|G@#A)dHMh!V0qd`zxM(iEzlmxp
z*0ox3X0lY-j9-vRrnbQ>nn`v0{G`K|1HIm9nPxg${NnNj45<9-!L32IG@?o?xQoeF
z!La+Ujh#fLI+y3|AA8tSzwCY{Tgw<de<MB&5o-rl7<L-fpN`%j&1q{%i(q1^kxpA_
zI@t{ACcFiX5KX5j(sVeS-bzF*kk84g3~h?=#xK(sHbuOq=nSuu<ZVj#Z?=L}Ww&w?
z;MMATmNla_{BR1xNjbK^814ky;w87uSE+kCcK~!gSx-4Cax_P%+=T2_&AO9d8Br9x
zQKTbjX$6Y~5*%{cu%kQT11vF#vjE-;+H;06#_?`s8r35;_r9@G%}?Xs5LD3wd&Kdv
z5x6}NiWsUFkcP&$BRVK0#tGB@<B<*!M$x_(OVs~cqmjYLkhvvXY=BcTq`WlE7i|g*
z9<JhHJdIbkYE=Zwwqg2&20292o|R-}9@0GvI{m#%rtc!L^o?hn-sU>F!6;>7=oX4@
ztRd~sbo_Lf3}4uwQ#f?0oFgf)5FzdY^DT}z4~$wXbL9?|S)aFIV=3RrgA&D`MXoa1
zKNYx7WU{OhFSgu6X^aNOd1W9`Laj{9Y7?`xU?*4K(nLyq9(T|_)}5iv8!9`OKY#u0
zFHfDq?TdF`qg5jO{g#T@A)Bz1gKq~Iu6DU{>-CQ==xM&}c$ghfFPc(D>p+aJKlq{i
z!@*N)-Ms5iP|v^Imh!Linp;}NY6}n4k_n&+sO~I2#S=ul$IXu69m+rY+Q=ZZrUEKs
z)Xg64%#BT<rRkam;qGobLLi$RJIh4|XUlbjs&Zx0J_)BOJy1r?Hd^g)sp}+NSzr-2
z9OIt>ul1I-`TX2yTvYQkg$0V5;Std=#|JLLo*}Wby$;&PzFLQFtzLx5uP~36zpBOz
ze0?xTCX+P6;rlw|m)@F(PR$M%Oa$QLLpBJ4)ywUk489g^p)6XLwcy`OB;-`yMx@&Q
z|NaL0>JaZZZs#L=3nA8szkae#*%JeOz)&HFVEJ>dh4FB{p1F8O0K_}l5STGMT9rw|
z?g5`Dr>A*Rs-a$l24-3Owfsx(D1Iv~zoS+D|1Jjb^%YVNW%N2g8ut|EBx&ko6k^{B
z4X)?>J%<F+fCdjz5U#9wxa@k{U@ls6XDJHn7Vt}2_N&A$$z90*BisJ^x7@ke)CqUg
zenk`zV~hp-O6fH5@IV5(LJmk>GkNP2#J0$)U8<~M=DOzJOIc+p?WPt2xu^c7)N5@$
zyibDo!T#ab<QuemP(G<0<ighTw*UhVJ;<zH5jJJ-<jPto&~1^Hr!qG{*K@=FN05mQ
z^T8xu3O|hO0L(u)9tQM~3;1g>QayER@k3MXgCDd-t8D?lpq@9LlL^q&Vnc3;>m)`k
zh2<q}Vm=ntQK#E7W;SS<&i~9XlzKE+@r~vgCQP&q*G!sKvYH#m@8U5A`NKtsrxa5E
zvA4fwzuz5Po};1gXMZ42Pq4^f@bdifXfWVs`0<&#nz~RSTyZ+tXfUYN)^o&8Opl0l
zBM^+Lwj?!R3X{+Nz<-Jde$j28_fPIOaIRa6$L|}X`Kq3s0S03YSGC0waBtF3rS3MP
zOc!^W+EM51taGlWCS8ncYJPQ$pZ&RcI+_BD0*^NjiW|;O7g`|9g(mJaMSGa;%us7G
zNBkqVe@k)64uy=Dz!pYmc8wYHl12FUH96QT<w^+`wR)d3<0>wV0jb=dWu@6KB>$wW
z4w`{+7$@JuvYPFV`>U)hhD*!-E-QZ=Uqz|sNm-p2=&c)#MLSmXq7)YFUXs^D>Br?`
z&i~$2zMV1oR?kXDX`7K}(JAw;ayx}DN-+Q+k{N(JD#cQ|BEW*jAp91;DQ#mE&X3m1
zG+Fwemcm_`NN%v3%-6h3T|nXQr{>H<9hYNgc{CfJtmmV;?YreQt(1+svlA|_-ZiKp
z_%^DS8F3!RsYGR{)`z=2c7}HAxsf}*ip9-SfZJP4%w$C6U`H%MJ@b1T-Dc;s<MfMk
z0eRG1pP0FLIUaJC(R>7WQVJbxs29GAiW}nI$*!sl64+34{l4m;_&Z)zZ5$r7T0X+c
zEp;PIPVa9iOeRH3Q3QiD{tfuGd^cy&>=K;|xgTC}e+&L$G6~O(QfU3onEn<G%HQP4
zGLqrkZ7Nu=HG%UyKO6@@cc0`X1_OEfk*(%8#Zj`jEo>CUAZpn2Zk258(u?y<5c7+r
ziDw}ZvoNay%;a!AW53ldg;0UL?WZ?3l}UkHi<Sdrj*hvgZBn$JryP--OE1D()XQ;M
zlE|i;HWs>WfuLMO`y7M!lKI((DS<Pn6}_g$*$=F=O|&mPPUg`o^3YmBi$s9l$16<r
z!h~aZ%ihUqpy;SH*f?4|d-G&Oj(J1#VdD%&%P_qjEF-+GDQ%NZ<rmctLBJo>vO4dO
z54I5tgqwF8CxabB#Z2F(Dc?@Q`+V;k!sI)3kKBQHG03`WwFrlsA>1u&Ft;l!?a2Dm
zGFKNnYH@+4CTr1bpU4=xfqYQCrPN_YrO-LmTgp1C0yvuhf#|oltbO2MJhQ<Xe|d|V
zvn3ddq~Ix~j*DOdU%Vx(qh5R578TSJR^GTKn`O?8w{SS-6rw>5BKqwuZjKhbWq_~V
zQtG4tI=Hy?!%8C(3dis@6UWoSlBa(C;LBDYqiWZ1pVl!Swc80sy=X4t+LrxnEBFI%
z>zbU^JM~BQ``{0MAfu1E@=TqC>*-2d{n1NRLij9UIPZfRIyP=c?}1dJ%@D`|X!U**
zF2|{>zpEGOk1pDNH)worGyz59NY@h@ht>yZr9@iXWxwC`_X#hGH54+K%piqwxHMwW
zoKEq?62516OT)>w{IptI-6-VNghs8Fjo@AlyUiljTW#KZct@c#*EtY~p&lUqsnRlY
z2bq?E=8xA4#o`LPQEj9-sx5oLZA_8<`?Yw4IhYjZP=Qm*ou(p}2BX<{0)I1n)oMv5
zOLEeqN}Eng{Dmf4`Ug5jQ}(-iVS#oZZ_>U=E6)SF)`C{JAa3zqU~DT{7n*&sPH){M
zV$yb>cHdxpl;#p?k8e)*Ym~HcZ{pSUDKw7%6~N2r-7(VaJ@Hl9a~%&Ka0c9HL6f|i
z^XLX+ecY2CNK%4(Fq&kX1f26dQCWo-@UWScc1IpoP#F*5`!?v4dIvus1A9ub>mP2Q
zr*XQvSf}0=wE|-qdBG3(P^D8(P2V7rMFE$u2XV*FjAGn(@KhjIKwTNV?1z)tsuAq%
z?NvIPta_dy(BMEoT_x^d%(&6I>{cI%J1Ftq|H#(umiBhf6HT>}!}|NQZ)jjaFYWm%
zy2>gU?$MEVpXr7?d+k1*R7Od9)5H`Nt!ad=pViPJ9#<mho3|meCH%6&_ORK>ikNw~
zF`O)u*#n=JcOSqpB|t0aUb3TAI`Zx}_tNfZ;wnSim?`D;8kow-G6tFB&gfZjToo|H
z(`ZHh`(DGLtQB_{5GTmksm80^ZA2GzYhPje6dxq&^8T>#)kl!~(p9?u`jnh$0)W*L
z2&dx3{T<!;NGsu|DQsc|ct^{7iW$169>%DuP9JCK)kk(nXF)0D`)KH$ucy=EZa#Kt
zW{cJB$F=T3ZfYK+PiokAMn5!+c*S3=CzDF|8pHMEuIFM&=SP+C4f=hMi9R^V*n}Y^
z-F{^AKSax6xQeTsSf66;aC3c%X+0QEvO!HznfdtG&I&{mAMQPjyut|4PYiomeq0$o
zbLYNl8P%l%YI%n`oA1ZZuUd!pa(-;Dh9fKQ^COrt&$-ZCuaYxLiSxjFj^d#IGxP-|
z-789V@2OSMMQ8@@Vf7JrXX!tss^XZELHV_P(LLMbi@k?!lc528PW8+0sw{jl^L~8R
zEa=W!^SkL=3(3TCJ<n~dTz~WErXrRpGxfYSoU?X5<kFP3*)T)lNW&jD`sOhG6cZ?K
z_Fi-F^6F`{LR-)j@fZiPj3{ixfXv$H1_<3Vt2D0-f{N6G$HN|88s3*eZYERRa6V3E
zMOPH}TZ+E`WSZk~!79iAg+O}0ft+&S3BL}W!MH<reig4{{ljR_N6Vp~gxzZ-hKqq+
zOcn1xwjNclObKZ)s`roVx*N^z*fBwYlMddOnW2u+^r*KgxEQ(rgii2ExIHJ3QXl0@
zK8xq(dnh-3@Gw$e!}rlgApdFjKWH!ln$zfg*;qX5PUG@D4?h|-|MbCZCWIP0k2w9B
z@4h0pbRWGBu|o_Y{lMFS+Pzpt?><Glt@*f%2@N7Yg}-0xm?FEFF^na=cKQ)=2lnvt
zllIV4*`+u4Q6MI6aKIp=$oYCk7NM0)or(s@5<{i!cPAOPs6QuJ_C3KvOjaI7@)ix!
z9%zUUdOEp{<6h5P>uiL(C^B{)WZ~_BoM3C!NiZ8C4;Fbf2frq3<iWk!HFta^2>LPC
z?c53GNq^zfvwM-zx{&1>57d7l9&Dx)_cboVv~L$lN?y+0=<jO~Tpsco1DbEHp#2ha
zszp)>eK!h5nCp{+arvzcABHK=y`bGZ+2q|8^w+S1qutxc&BPbuj@YJb6hA=g7Z}1W
zy%wLA>K7uI{B#~o{mhp%cJJw0*;*e^{%j)HM9tV=hLcG=s@Lvq!grA*Q?X$7!tAcr
z$5tccf$UctqJklBc(lO;Rk{0Rx=`K~JLrTl;~)2ftZ5T?H8S4Ye0=aEXBj8DkL(^-
zHylOx90JJh1IKq}CxL^l^1wE&pm_y2USKm>?HKbSq|<yc1nzrAv^#n819aMqlaIBk
zmZV%Ir$Zto?#Do6b8y|+>h``94BthUa$tGDW)bhoD5h&<tV)w`T+-7=jK5br`a2K4
zc<hC}+;iluS-fg?PQ1f@&}*zBsO2x=Rrek&yRUPK>B(cT;hS#yDa;sY{fg#$?>idP
zYRTNJi<-MQ=j5U2x&2pth(@O}l1usgYzq7Mh;g4xlW^r7_5|NlA2k=x54xy>j~H`-
zwS^kEeK}uw_;#iIBuaa{_i;;WD%_ZDDq3y_kbA3mkcZifgv>H1GEOMA1u{P2A2}+|
zI-e$0ERZNMZdKY_Xgc~;<Li3WK^5~bo{?GW_2~yUXr>@au3W#aC_jW)UAj!;`F;74
z(-4!$-8RSLUWjI%nNB$(ioO(`a_Nt`|86c8(R^HLRam}X?rpK=y{E-c^PkB6Z}Sd)
z1tP^i&G?WTI6@!e%$1^QI`nopyyIMH^u=;KP{(%XzT80(In8$mtUc;t{srA>3G2ZX
zlV|aC8gtaev@ZF@?}hdpbO85!5m%*R+srWXh#QfFu6jRu=jkDMJzebX4Kyk`-WB%N
znvZ*^(43E=g5K_k>J&MxKsN)g9#U<Jt__84Hu8h2G?fAg5?jcbl-!|NkMS9{2sFUg
zqT)Vm^C$RD23L1-w)b}{TA+VL*V(&D-K$@_@Q~B}g#CIMVC>@MJr<ZuM&`-KsJf)<
zyUqA+{rW+D98K?uRdDQsIP+0G-)DiVcbjROqCNWH?p)ax0K?|ml0`9aKH0dc4a*O@
zd!IM<7&3RoX5{1e{y3nTM^nS-Z65ZjhlgE&Dr33BP(BjqzNN=Y>oRC4J(0U3N%s9%
z0*J;mpSJ7Gyr=>}H9o<N?Nf~<XJGV6#^Ogyk#+vHd&4JieX332bEMz|ci#AT-lb3_
zgHa{H&vQEj4WMWdjqskv6}_B*d><RHhOWS2esct8-cIG=I|KP)b5|b)G-}$XK=;gL
zL&(36ABWEcvt%Ir<AM72sc4J4zN?D3yl<~WTGG1_P#<Ujmv<e3#}ei~7uA^n*B&*8
zDN#YCn+gTEzree(yOP0ERLY0ZqwAJmMxM=Ic{Db3Bm-x4EtKDRDK|3rtb4#w6dJ4L
zhTyrstvC)5%aZkKP%&!3Mia37@Vr;!pKO5Md#L=NJml_^4auV!UJujJG9E@w8r;oD
zPQ`+J)O31|UW*voG8oC1dyXwyopvubIcrUq>p?uOrXKWKnN{dx=i@rTiJTO5VwsOl
z)`Q71`uqK7QlXQbyYynUl?lb4>73s3yAB4lD>CA-A4)(+@@pL^Oz{@MRX{8^h2+qn
z=(9Qwai+_i2A0~X+p||K&2qN0Y@-aok|2`v^^AXHf*s%U!kcW5(Ec^;M&bBwrbiEE
ztLm&FjpJh+`|K`FYKz=CrC+gf{0^3uMGbY?pVB3n)(A%Q_oKTx#%tH)_5r%_Py}eF
z0uJPQ%fEgROy>7NQvaBWuCDGntk)RA{J}<+F$Hd7h>?4@gw$yfj@)!1AK7d>g>#gS
zzTSF)!R0eNhI3l#o0oJwq(}Fj3ZK}L=KCW+VvK-G+rrS&t@n#)8KdW0IOTNo95*@}
zHoEoWMXTFBYn}I-r`WMKgmku$PTcp^gPcVF<IkY`E!gFJSTM(2x}1mEe(h8mrbrYY
z>laeeexD)pAf6|ij=u{4iP+IU#0glAl-bTX3C2UZGz@|0P#5J0alh7`X3nB8T`wus
zNdAiD6L;9k#16k#cUho&=pp6C?uC;`j-7u-r^nHXoMy{Ae*ja0PufAQ@zX3$ejK9b
z+V3xKKdOr=bGV%6cGkzu!jifbJ3=f%nePKS=eSZ!HsRU5)%MiTtuvAh1G!7`wEJ=;
zo>8UuWpbQ7d#tn2MfZ0O^jZ}1h0C4NL%DgN>>}P)K3b(RAG-|~DRXIIfxcfwD^I?v
zj9u6)y~<>%y1$1b4emS{M-^4gvA%zZ7wX$A#71b`q#{F>+>X>z-5tT}@u`QHVi@;w
zzdv-#o@3FEpxF5yWpHsdM?I@O$`IB*_S&t{yMozhRT#4WiF@~?vyKHB=D4yV-e<9z
zEXu~?nUcv&^%4Ez=}+xdx_Gd=)?(exGMa_)9O&Pj$5W#3hk>2ls;sWZ)lERX@!ky<
zv#sAp*pt4bs2}5G_JSN-YZ=Ng#_Wh6Z854lc@@1sf_78210JUNUSypKN_o9Wva;SD
zJ84btM56tpk;N%?e74Z7GC|8DI|%bY7<&N8XbdGP5ZiDOv!fg%_GDcxj#-gJc8{*_
z%4|CcgY(&<<ixg1RZtsb^CJT1Wrbz9uUNl)fYIn&jQ1LY(^PYLl^!MQEH9W({#cP?
zs%lc79Yof^(?5bcg^$=g^Y)zGaH{v~<$r;HdYJL}Y<vHu1M&o5`6LU2c|)CEGKoZK
z>t)l0-k0zKb9^07$FHJrxf(|3@hF$Li)C`P1cv#(bT%gE7iwI^grvNu_iOKUJe?vK
ztoBCub+D**jQhMiVV7N|(U_wNcTuLSCTn^5i!(}dXLyU9;O>Tnl(^jQU||Z}FaKEq
zn{79n8weuTy>EX_L(QYpg2vqo{%~|p8}a6PbqzcUMNnpTh0-b<o#y6M7A?fERE_MK
zSm|MN{JzpN+uX3u8~c#+DVa<GaR0TlIF3SV9!(U&lQb&5rpPDWeXx6A?)L}|IMyE(
zDFN;gRA?vP8J`N(i~{m8?E?5VQcfG|*#Ix)?<z{=$HXxlWoYQV_khYh#Z(sLKK2_y
zoAkDK<EgV~hRx)o5oI%=-^uC6vpl|DbHz$W;A!;U-mTnr?>bqd0d3af!c8^(5gqWA
zch0dZGcngJ?PF{N>|S$DPNlt;m?o&iy!txU>ad+QJ10yVYPjQT^zXB0!Dair4|L$H
z`6K5!?qA1gfd8M5rt2~E8e=f{2>zt;I0`WMCpU}{)1l=(yd+Lnz*LNAo=&IpcvbaO
z!nzyNs17dAFMF-yr=P4tPD0LG=qg&lW8AW^nSy7MCwgb6j=1*o{x7*)){<Hmi}H#W
zB-zEx>-L(~ot~swYvwAuHShi6_mY6PxBz83E`F`@D;JmOaU$Z9AvmdkOB%{%+bu5I
zRyQIlEpBm9E7NV+EVG$wE0pDs5)}$MNwq4J=X6pP3YyGTRfcOaRc$DpNjz0$hPH2c
zh4M$$fl<ArooJ~-@l4{Rir}s^JDu92LSZonu85l(OS_qo%Ql;2Ixa4vaut{CY?V~F
zxX5eC5?oxu&iPwhN+<E%P$Vg%M7fkmn~QD)xF-$K=E6FAP&wh=@Y+hQTTb7rAY?A_
zY=xp5RyLbuwn9lKHEf0QCY{fw^T(HYr&^smG+hC)3X-qht&clby7Nq`U}!!iXgL~g
z9E4s?%&u9&^O!7H<z$m(-3n!N>Z#(gCZ|$y8IvPv(;QK%*i;4+6>TIXD#K9ei6B{U
zN?EUsWt==crA<{S=48z&fjZ~ADQQRNt0^v{^3Rl)kkl~cg*Zn`c^OQmvY~{|dQx64
zpT(rSd@j#OrRH_=jVg^-EbPmiQK1HTvsWlbp5_(GS*a<CORH29<t1Kj+Od-AVN)5o
zN7+=&jcQT7^d|l%pL^gg#n~gWYK@9hb)xTAD_lBke^~oc7L}vam(o5RUA{soCpvt2
zc{}2H$%*HQU|w9>L@3{Mc<ZR*#RbLi#SZaZrLYr_yGjKW8oOfIO%0p4)fE&DDiC!^
z(OfL)lCpOA=Mr(nj@?||TCYl58w*(himMdbD9u{|fU6YR*q#-Tx4ga0VwMh(Ti(#7
zGMTWo<&9Mn0DW;<H_SF4Yqq$83V>bKWO;{IoA-^1Sz6LeHqz)OKGum8TE;b6F+5Ao
zYZGg8Q^zV~OC>7J0VYd}y0Iv$7G*M2PF9?VkR=?mH{N4~@)cy)d}zgu2MmTWESCy5
z6wv_+Hx$8ubmc{Kbij=*RcmNNsh68aRL)cCxN{qeY$%b5+;)e;mCKg0oxTuecPYK0
zFh>C^FT>%wHn&runGHoY6BH+0RT-_zgmWrkcHA&b<pncgl*$V`VURWszz%6tt?=fH
z08gZ#YK1G%Gk+kSQlf2zso9|Hs#4GsZssn9%h0DVSj%0iRN+sH0-RKlrc`395?RJg
zQ&ln!e_)eR?jIw8ln%4JfQ0!dZ=tk6K8(gD5yT29QQEIR^g~JO*{}^&imJd2Rm!U9
z3gu-tye^-ECv3nb2CO(TK$&QncmA(HGnA`+Y0<oA{?pGYx!aeune+cF9YV2RYB|BX
zOL@Q7=pD){FVH(w5vR^do3W&n>y2NAB|azm3gt6S@zr;^?crX%mbj*u=$?$L`3Be(
zdW_$_UTc%3h{u1Y(%F!4FD<U)^N}rus@HwB;>;Zn)y*tnfx~GTz;bS&8;)n!E3;~0
z_Es#X6L%<XyD63l^2&9voV02;ztUp1(_NKmZ;(wh?s63hYL~ZC{C7OYO7uY)kFWA`
zszNcp2UQul^m{p#EV|z(sd|NSsk*@Nr+S6W(tm;LOv$!DpO+20*Y#5=TXEa>q_~{x
zQ&Nf-SwE2y9hLC|*|e)I=ZkWBQK?|g=b}XXE;G$9IR;DpEbdxwLnW`x{szX^SlyQw
z%$ve*-tCrYdl_JjG5V%bdE@a-H7s-QO+}62cD0gBFqEY<)`%xT&9#(v?M;J6kAkxI
zHS$cVqu1AZId?htZdXR-a~TrT*BaU<lSwjKBa0z2SMxO4dHwXW4}KGG*3{Pq5n6Y{
zzkg=e@BQG3J3&?O4}+*N7@V}B)d74tZJ)!JdLsg&Qah;E>sBvk0LH<|<@wQ|cX@Hq
z>GoU4HTGqoKf&kEg7eGMQ>+qA(?}VT&#%%TnNM#6Zf6`!l4Sr}L`=ui0Ie4q!8}<7
z(R-Gzf>om4eirPA6*{^Qtk5nUQ=^f=xo7_3YOqX(zkVhQ9KbMa;2m|kEvoH(`wCzE
z$G<-nKT8DtZn_GG)97)!96kPRMkm7F^~3eC51((p{TlxseD}@1{TII;9(?uPe;j;$
zaQN*v-+XuY6_h*p=9~S){|NRUZV1JnH7Z1c;6K(w;91rs<u<(kU;2UFBP$;4!mh=b
zf#D3<w;-7W^gP7<JR@cz2ycMjM1KoZbYKatTC2k@$BllJEN++a)%7Z<0aZEN-~ZF@
z;r_vXBj|<GcX&Mz!M8c=|9G)Tg6~5(WtY)!LAVO8W??)H#y~?x$?Q3{1;<iAZKXg#
zQ&h-|_oN%57f5#3r~nG!R1DTBI=2LAvR;lNdNPdXAq*La6^4?%fg?Nsx`ls1R>xLm
zWE;Rrq(*=fTSUuQyu$e|mdU#q{bp9zFgPT3lLTgZgR}|n^T<#orAo7C^+d)M<i?gF
zkYrHkO&rVs-|$2TVX)Y2I85H*D+M>8qVXtdaBBh6%PBO7?bsd9$C*(<ucK**64PGM
zP@qc-C~7D$)$tmJ=NXL}g$(LmqX~GTs;O}@T2pLFwQ`SPQ4%Py1Y82XB@U;lfj+Go
zwro#C&+j~nsUjA@qZdcTPEGT~Jf$UwS9na#xs7C*LT9(ZFhaB$Ygi`%oG9=zLPUWv
z%#s!Pl>>O7`WOcH4o^RL!H`Ik$%;0Fg;e-S7tshY3+l#*a!bUiIb&Cv$_%h@|5dve
z^g1W~H%&Ow;QK|l^F#Z%bsW6-30}5>qt3-o-S*2@{oqyS^tjdS1<mtgczWLNwqIQK
zJMdtu*@K!}v}531^Zciv_2Wgi)$0YFZqPovIBi3F&_TC(-fy>hji7xFEbwvr{ADA6
zHiGj`KR9ilwSgN5`ke;$i;d-L2Az}Otkpew1wWfF+NbUQPt@f}yMK<|oj`xh;G)^>
zw~sDQo892zvU}0#QENCqIHQkFo9(mK@g9r;`VCq?w9flM?^W~kG&9}KoAXu|C*aKW
z1+{hBZoW8ead$A=<94@o)W>O=Z$|(`RI~!&xo91=@k{H+7R;#G{iy-X60Pc-_geqw
z63W5*;JA6#d<k=`ZGaA}(9vbLg?e0o2e#9@e9`N-`<MMz@Uqi6Cb0Kf-5=UVt=`k%
zw9_NNUG`cH=%nAo?y(hs8oY+@FD`p+gdYL@ybs*w<wd{UIj_T-zX1pV44UXJN3iak
z)0_cVo$gQAE&_v=q7l4#)q>}+=I1iKez%F>=m7wa`gTd^72w&oCL5f$UY@pJw$6`Q
z__l)$y=nJabzZ!756iT<^EXZC`4Xp3iw0xkuNE#hXlaA?Nzgq0p^by*!q^(1M6WIA
z15bOGN3R6>xGf%&@_dfk^TFURXMh=<qrof9DcaAFJ>{D#<U7MTok{a38Vie>5-X`m
zJReu1Wy0AvQilT_4BkWWT3Uy1{Ka}DZ~l<d*c2OFgNYCNM?4%;T#fIv{UWGstwwx8
z?ry0r`bR2;?%=HXU!86}*xK{HY@fqRXjfb~gYU1B<O-NH)#Tpwa~e*rMf3+fKzS$I
zTJZc?@NGT#{dZ5D=fQ!Q!>i^Gt%1y=*ZxZ@IMA<zSr}mWf!d-TtVRR(iO3Frh|nY{
z*gB7HfI?dwgBm`ZJbz!q=|A2w9<R|f1K$5?m4o-!C<|UyqXfwLA_VHvA}=mqp0s~-
zmP7UZSbfn8;vWMp%ONg{zkghu174hh`p<*Ido9tgky@g4ifn$>l~VKCxKbdCUR<F3
zX@f_AV}a)GBhO(L_YV8M13MjdH83mFcsL5kT~o6a$nHf!O6muo0`U|X%K(@#IPrmZ
zfpcCMj37jUlpD|}T!cg5QCGKn>_|Nd=g2Ii5lOhycoeTd91c_HW;#{O-+4zha@oTJ
zirWHi1Yr)$7cfn8<fwziG+YT+ieWiXbpgD}Ei#jeg9zTvlbbn?H029Rs7`DTZVFE?
z(A)_6Kqgo-<<4rOV&f`Yj$tIJ?gWaeu`uaXl-Js1-i^0~K;L3&__@LY@BHhC@P8#W
zNX?)N95pYF09_E<%~MnzzUUpxbFSo215fkp?cQdjONs1zXKzBFTm9s)bueELrt-eX
zyyQ2oZ~onJIkN>-ixz6Xi3s1KITj=?mU-GS>Awte#*wIHU=aY_kq=#`$b0{n>|0!C
z#hI&Zjr=ag1;EWfY%0im>fKCir3s4M=XLlFTEvD}I-pH~Xel}^U}<+nNW>O!fQGrh
zj^`^mWsAr<VuyO6soqJq`Eu|ISfLEHJ8t0{4JvlS7ckc(98SuLY<V{-dADRY`I-*2
zp+oAp<yOnvvM%6tSugOqT1UTOka|<bwBX>4-HC}`%I~t%zEc$$q^jc|YjJfAq&s!0
zVRzSBA2nKnba7Qvn&UnEmQu6?Ck6y6?4`I_pJ+T_EeR`ZRd0$6M5{rP%m&vS6Rjoz
zuB=COnSMRrI7awgrm1Qe!&2C<WCte8K|G%%3W_^gdt>Gnj_}Mhzn2k)1EE_K8W4_B
z9s7gf)nG*?859SD>5=rV%PiK*E1<955ii)fVK9!DtJ@ldJz3EBJ!R8bxEKua!WI4<
zQ0}Z+K8;^tbp||BRR{WbPz`chOPvKaS+Q_qo(xtaw5TcBkEV>fne_=FM``wi$c|nQ
zS#^`cD|24h#pI0295(Lhl0Ad$!D;iPLBG}OJ17N<u&SB3P7=u23imV`t(SbgW%xm*
zinj!`e=Fku7kqO1|8O+j8$E0vrTYKFZ@%0A<}joG|N7g1>;L~bpT}Ok{lOpqt+M~O
z%KqOf`+uwK|E;qBx5~bX%3gFOTSWDjd)Hg`v+MBin{S<G-%m#K)s!`+>d^=jm*6AR
zf;@Z356<D`G#Q4|07DK&q~T~Dosuf-;krRcEW`J~4%&*PPmvw&lM)Ann+1|sjC0HM
z4G0(hz&i?{RO_W&M|?&PcaEb;xSmo_f~NsCBZFT?lW2)voLHY|EElA<_E=$-|FmF1
zZi9Jr6Ntq!l5wDgVVWkRI23c87}KvzfD9Kk)4c4zLMr>J1?)Z6CtVWMw2kwa{D(zt
z!0AmhkP*|A>2P9@VN9-Y%u`koEJJ;IVHH&It><Gop>RTz_zI;FQa{DhsHkUR3T~op
z;85_22**8zzEndXMKN+*nIoyFsdx@&XgH03Q*6itqxz#}*EWj6LnfS}_<UQ`5Dox1
zBv~MuX2fc2o;Vs~1uHy)=D12l&4d_%3rF1pO14NqL<2ZIk!dYcY7Bo6Zjp&vVM{Ux
zogPIuN7I2F6D(<R0<{zxD{2e*6##jdVznNbq%Lc9T5?`-czl{%J(c39(?^|T1hOUS
z7^lfq!;BiiLE6v+BbdTjy`lvz>YMeTSR03Y+Ifi_DjH7)dx&uoc9gcNyl9UDHh!aB
zE2fsrp<th5y@jp%Zba94^nMj%EBn+0x~A%0V_{0K!<5YAh7s@<u>H6?H;HrrhkFD|
zeU&V4+pB0MflRYePuZ-{NiXvBvkz36JCru!DE;{t7!kMfkFB@j>9ExZj?Rt;N6mig
zC7elv*R7v=7tN#AhlUhHtj!kcwwlMf0P;t<X5Mt+$kj#CXq7F{YxT`*vJ><bBD+Mp
zD56WY)M>kC3IJHIvjtu?d#_AqbQ7HG2@cuwm%7j}Ucn+~3%zLf&zcveD>$N-fSd6D
zT#r9pw7P(6@PA$WDoV1&UbZ^+xT0|88CR=$rVB0B!*o5&7P<fy=JJIu6pn#NWXm*<
z&)Vm@$Rx~z@uX>iF$F;&H<r`R8v`M9fbjtG#cAj0wGGNKMsivv>oi;PxOx7v)$LsN
zbWw98Wy=CLbPl{BuvNP7Y8lSc&|4Z9r}JLZEsh>Ui<NKXkGgGO*vyD==Qs90(77Y@
zHsRyx!&7^6A`wFejyrEmRngv%NF_jAVM?7WL0AbuG(y2?giHz(?MS3sejm~(jwAMs
z;^6s@Wwrzp;Ox4ClhfwQLF*h@ZnI^R$;5dNti4+Rh(8htrx0-YNF3}kFk4u$X|5c~
z80W21w=9#ReA&*~8L-Bt>^xZjIdqDhcP^SeQzCsEFLu)qkKW&+-9>ndho@7a*F10c
z+ka^dE}B1`cACe7-s`s6xOb{r4J}9=3(G-)@p|i_n(axVJZEam&aJc2zm0<0Q(aZE
ziZsV#G}6C`#-?0x+isX_pdD6Ac=rjXZVSZfThS+zQlCw|BTOf8g<6*hpYLLf9W79u
zqci|$7>Y;PH7Z?T*=_(g9b+1#y#rjmH=XYB;1r|^kQYG$U_wD^@SVd?!{xt<ra+)6
zLO<&{l&$(QVkS~C1+K-w!^;6^mCkphzX2sg&YFSAoRngo&}x3Zt4b&<0OS!!W6~!U
z7voOEDf8?wIb^ITpgXL>4KRMhS-=93`(hBn<JBr0y+tKU5+p-ZTd@s3b7Z8$87AwM
zXj@SDaMwExenmCYEP)-9EEOjey$9Az!3r}Cs!9shN<)G)jR!T2fq1F<);t8s(7Hi7
zTrcp~HwT9S-2nlkjxFIect}V(jY2$lV0O0!6H$n$8b`JZN@FvN1UN0^9*1yzjIM)O
zoGwu9&4SP}nvw{FU9dDu8B{TqVmu#57~}|Zd%#FXvxVGAh3ZyhsAA32&*6F!{tU;~
zNgJpfNK3c{FeE>2fnOT<dRX}SsX7w+TBo<VAplKT4@LSv_+AU^!I$&}I!_i6%RT@y
zIy+ds#(eP(AP8XpkWgw8zlTZI@ZMj6sxGi<Xl0-h&p^P8*|<QpL{LI=8xcHRIzgmJ
zYXEss8$p@?BHPQQ8beSMGOLAALYUS?;?yx;LCRXoF}sV<;i`xo-9#a5o(Yg@%7@x1
zGIWXzeMNrdXZRHXKrH-cYB|^%V|yj|YxW2dTT)~Kl9DwA3k5@p-jwdCxtiTT`p27?
z1W-&9i_2gMX?W{~fLJV%!5M)xI*OO0^$gmD^+;8FDZzh93nb8G)KvgN12lrmbGnjD
zCN)G$GN~D69}kVg(}7HR7R}%|qB@QJhTTG4iE1n%&2eD7QFPy?^3bU~tWp_XG_RD7
z-61dzT8xqfTE4`jaz@iAKr8^(DlypQ?h%8ASP5YjjqMSS7PmZI_}^4VF*YxT4fr3w
z(Bqr};Y~G4D6tudfR>GMtbz<i*~}x<YIqoT^d8Sv)G()dP<Uq5eq~Ye*Wi0+9pTBB
zUn;7DA41vRp9S>#=U;yb{x1`nUw@IAd{Cq2c%6KQFa%QZ_cc0uuo0W?TQx^0^nVFu
z94|I}PXcax!Y7;WSYsB64#Af(nz+FpLFI&^4BQrDKeGnF`M%Hc889@m&qK|Xsm+;6
z#-vujD6bbn&9Z4tM^kjY1u5LkKFWX-e&neCV=!91&(H*_kNnNgIkrW}G?$3p|D5A=
z>;gL@G#GpqZ0#Q$e)aV?-+uSUKZU~)@JL&NNvszgpgyVg2-A@~wI8n+V>p=TMZ=xk
zPTfq-V60RlO%~U}IVh|poFZyx@G3XG9CG0tf89AmnFS~FbFD^j`Sq7a`|nTo>(8Hm
zU6&bKrN2Bd<*nkX<Ods_U?E|7ai>D%Mh=|yr!E@NvgqTAeyB4{;ndNf^BRd@EK0O@
z;WRdUD&iAXYv9Rvgsz=@lXVlPjI{_NRHR%-qqhpR5Y4ja#f@NT{AQsR(qDOm4wd;S
zS>P2Q92pnW51PiP&Y9C@8&op)8#1ARQvyi~9W8p}C<+6>49C$Zo}qakS-UrYL5P9*
zA@*`T8<I|Mjxxhdv>b(Lq=}Phdpq2Q_Cb!nx(>D{+cte7REimuVnC(bG~uy}N(8nM
z)F70IEwn+1)ke?=_6Nt*2+k<zj*J8O`M!Dnr|r7ksvn95%^YMqQhv9eLh?9GZU7hG
zMN<+lD8SFBlPL~FTu}Fxn(Lw)Q#eG^fHZw6qWOFc=aX4hk}QC&87Jb63q{Pu1meV7
z5JMIqMMO&xpi+{SmH<ao{9!lAgl?IXLbwsQ65^a*q2f-M%S0G?kVaS2$f$XT>#LN_
zO974Xf)_=Eh%ap6Y}I;Pt#;;qM#LOM=_p)8sTP%#B%*1-z6KKmhxM-l8hg95*D>t#
z9=&pn{d@-qkyCkWZ38?lvxtxA9jDZ1Ed|6URt&$OL%_bxfaMT&-z9&<V~BcKbki(Y
zk&@XyR7c4Y;Iu$K1E!67C?t3YCrj4UOeApUqiX_(R$T#1Oo#%dl12sA3yOg1$?5qI
z?=j=mN&ouG9u5h~<9_bQL2!MJ(iYGpl(^`^qNo{h+V|3fvaU<XgedTBxbP})m@k^6
zI#1HavQcdLmM+GW;sLkT?sHw9HpOR(k*7N;BJC+0=s=#aR=ff>nlI9@aF5=+j&9}l
zL{Jt3@tolRd*f6zIibo;ro~co$|5Mk#*mW5X|$3F!R|!6N9P7A<vobonD5=x3?6IB
zfW>(iDeV%Di6SZLA>mxqU|<wviAm4$Lm00mwZ}(}V@C#Zyk7XnVSs{mz0PPj&<Su2
z$a9iZtIb&qrIq}vWEvH(6u+<5RbN!r@F`tu23K-@8;;}m!3xv2F<DewHgs-wmASpX
z8#d>=B8PI{OZt|!C4<vw(={Lxkq5bd1R(=K#P^ADD&2|{#A-y`EHrnzrYp=gi$5~F
z&N6&|63@pqnrV(vrP{g{Y<MURBJl}c;%d@I_ioICvrZFehi%snvd_-Cu0;3U=QOux
z7VqfvqKi?ccPN+Fc?Up%*-jxGO$U6zGLXA;T|H!t>mW6%S#?LKikMyfjMkq)SgTtF
z1V;<rD`mR(J#T*A<h)I4cAt$55pZi!9G>DzvP<1MuwzQ9@P67bHlFU?hUV6(GBUSD
zg@GwJ-(_IgI-3WUt>FwzbR!mGDXcQ863<J8_ONd_?p1}2)>t<vj*BC>uN93W!wStR
ziI*G-70@->?_C3@0f!P<Nx;FhrVL5&eQOfFjkaiuBH591ON==AdTN!hxP>&-7z@CW
zHqjP?z)Hr`5LwAEMV*J@-GqFhb}U&1R}pHDsasJvG9fh-bdPE&N`|elJ&m5u5+D(#
z${<m$KG+BWH4E!>4fDPAl0ca;6((;2Tgj_f<)6R(T4b0k&y!<m()ogtZPip=z25S>
z-q;!p5WM){$rt0nV5{+K-7qOUKve*Gamlr5mbIL^S*r;o)usUn^h44@JYPpvxjEUo
z!ZHR#th>=Hc^4HRod!msMTrJMW@I*k(t9Gu64FTeNA}PvB6zGOq1fdQA{WtWvjq;v
zDj_axcxw(veV*=RwX$kA5MC=BT++-<bul6>JkuRcNF$rN%**gVa*A2RL}uWS-lEq`
z|NL(i5t6sw3r2azK4)vq{k*v*9gDKK8B-9vu_gwv6Gyir@kwM)qR&{HDL443LkZp@
zAeCwquTe;DoJXmc?(DFMlw~|Nw)huqAC`q^b3VpEcpPjk&B7OffuZQ(i-8UXt_*gj
za~oba$g>C&!0Fr5#-nL0kh!^zVV<?xbS@_|n)B4~eO*V%vUMBOK(I4XrJ+MgcLNP%
z_TXsux!Qv3tl&b|4QQc8+_>1cDTBQ*y`7J)m&rU?r_)=!U2*r^jxeH#`gpSj6g14(
z+p)N}k{Ahl+4`^G;K7RtEgj<epn#4olSLf%isC(h7Y)C&4bWafAs(1jv`Qr7{+T81
zUnkS(3GmF@Pz)A1TYrWeHLzh3P#L~z!dYbP9Eo#YtXH||Q-^Z|m4j0=`}#<)m|BLw
zwzbR_aT_ARDYsrsFvuVZ`SfYb)|~_k!3zQw-G|-CZBlmZBMfMWGZ@E9Snuhr_6(<G
z&kdh232{haFoy^naEDpElG!jn{QI-u=(OEB?+=bnJH6JRdC~{=SS&K!`F#k`$;{K(
zgo46iS4|vVZB)-x^orLGSu`S7vao2h;Tkl#6;}*;y`3&c+s61cU7<;a5N<9oPFLGn
zwiZ7Spgrm?X|YU35#PJr;!e8`-{IAENH7<l2fV?MLDYu&o*b29wAAX%#9<60G2V%<
z$bb~dTiqdBI6dni7^6mvzrs{(s-;Lclqf#|q(I>rK<_iBfZM20DPT`)Fo=9_P7nFQ
zPR~wn*|M2Y$ekKh$uYrHA@|fqD`A?v)$8_fl;B5A(vRY^aIC`_+qfvr2e#~|&1@Ze
zTe<#nu3w$0SWVdb(sv(2f~xF9G(7CVkIVCZj-TAr58nOxcCG4C6qY5`Q9n<5%v>Y+
zW(Bfd8zn;bUyHfJ@*!lX3VuFppfgNUkj!Y-gS9a#rg5ZAz76LVY*U$SI$6}&i<H1B
z60g!|I`MKODae5}GA5>Gw3;b=k0n%kaSV7)L;%=mY@xPOr@uS(dLeg{yZ%zT-u7|B
z<y`5c9Nt=bq;1^MJf-a+9J#j6k#&;UJ@hly_=SmFI36#BPO?W|pl;9D&Lpp7hCZ~;
zQ=5XckCEpfRoR$SUR6i&2%DpkkbinS5j!X4r-ki6kv+fOpD*@cokvP0Fxop960r5l
z3G|vOO&gp3D#Rf2?A}G&idUl-e-Xns7%iFS11qYO=V*ebf9&9V?BCFttv>@?dj70v
z>(@P(Tht)zV5s<5(L~jH9UlEriXjA_1qZ0}`~G|C=Zm10E58%`vF<7g>{~Lr2F>3!
zDKs4NB`e~dT6$AR=_vh6bfCNvtTv#DeRFlIjNl4nwP2h?%+8KzkYw0rOiSs~!?sT%
zjDgdfY}-g-o80hy9j$))Hlt6)acM-cJQ2_xVots|Hi9(dVkLD{61F&mfq)RzU1K^m
zLhUIqXYnT*Uqyty8O%c(VX&{nzEm(wqa9-*OzNq|yfRz{6n;ci9uc|%r%4!Cw{E5^
zl<_I9gql1GsDaO|TL%&|zx+?6&k6a>=pz=ucZHOW<2R86qx^_zJ;Yc=U7RQzLE^8;
zfU3blL!?la;Dfh*hK`}jC_z68wkB&*uNyOEeHDqajvf~K=}0&4;!yec*lR-z6V6-Q
z^a(Y5l(pz}FChFY+9)6ey9fF-=!sP1-;n;Di1XeiQ-JNDwvT{6sPBCQy3Z41d`PHn
z*{1FVO}x{<&>}$u0_cdHk71=v2xzs7*<Xx}6y#PJcar7%LmS!N*(6v+nD_v?AX`PD
z7s@72*%i`i0zSNr7tSWbxvDr`gf`Bx-mAXL*Z_pa{)so7X~gM`dMw;~AnNJ<bFy5?
zmVFldx2`8enWe@zUPFFY8K+$Lrt#az57ByqXmLCTmMkRU40gM|-O`v#_zA3z;suz}
zYjZnIHZoV^2J_K`Y<WfA>kSnSi&`S$BJB*>)7)leDDWDPVcms@oX*H-CH8_I;h-}B
z6sR)FM{!<9^#t9<ksX|{nMM4|#BKFPyvN7`QVf{1trNVYrpP-|8A$0JN_DOMX<0sG
z*M{5|q)UVO_Klz#P#N}*XxBd5Y)2rE>IT6-r@B7QXKdw}1W_8rm@((%R8N&g4+U}~
z8=BhW_W)HRSIsw$q$yJKjSIAV;s!(!Q<R6`&S*9^!}uYbLR(pl-)yY+54j<6pn6OB
zPUe(XbJTvBkor7!NAr_wO(5mUWPTFXpo&0c-dSn5ttw?sEUK<m%hv0RDZwf!AM`qm
z<6@>#Y?w%`LY8Q3<gLVP5xr~4yiSM={C`ZpCzHBkRRLn#_Gen}iLyE|kycv>o+~>h
zg>_=ub~N@u=o;9F#*}Wg8fsq}Ca+<v2W2zTE>y2+{1WX1hR*>@lEs=m4s3DFu|34_
z>uRsaj<oL*vggnap2yiolgY+A8Skd9fA*<&GD{~3YSwX>My>k)f$i<xkml$w+LZOY
zo}~s5s(<;VyH6?Rm!~A`47=#ZY)<!fSR1I=_S<=Llnkp0lcililuY^8;O&t>RZBk&
z+mT#(jNc|}C`qAPna`b(=oZ4s&wkygBkr~O$cSX*e>&P_Qd-UvqQIl!s}Erem(hsr
zeKbYUl!G+_4Q07+Wia7uY|WXb#3&GNfgUrDapM{5FxvTPf>T>vyI0l<m?8TTP+Cs5
z`chg6Eh6pG7o0#NV2>oeN;BhD!zB?i6^{udPw|8;=yBE!#gOn6Y=9s%=HYS);wkh8
zy98C{H!6-2gC<0g+qS;9-B1OqyV$1Z&Qm%go1JL3Slucc7xLm6qc_C62wg<ju>f{r
zL?R#pg>M2F2ISQ>cE~Qy(Epi)$nm<(e5sq^>s<~(5d<dW1ciKpze6$}K;jL<iAQgr
zu=E*RMRVLnkuggpX*FCdjJFgbE!n)%Z8gEKVJ;=OnS@7%7>mJv8QS7Rq1qY7E6XP<
zwW1oY_?Azp>0n{WQ5f-pZqb%nJ|$vK*otOV|JeUvTUuEr1&=0c<KXfNb$rm<4SDG#
zaJr16CHm})CEBbGu8feS<24Ie3l?Tu<+yCkf3MW^@wmk;YboPYQ@PzK%m77+3YWL`
zy*{8>NH=#=zStpu9Ez~aZRwlQz2F3GF6ZoL#WTXeWhRA&%jB6gx8hQ$#)$3=BORkc
zDHt;Pg@&9+4lZ+F@EZx1YS3tkSav5=6H*Dp9FtC391}<68fhz6?R@qM8W|I!k#`w0
zPvPp%cx|~B%_t!^`}AsEi%~NpsLe`-MpZ|i2)6>D8X*RHpH5>yZ^!k!?p%#*)RZ{Z
zyoxfoSFaW=fjQTB4{q^Dwye|HiaVn4T#9WqNSi{ZWL7S=`aIaw=Wew=ce8yON3zul
z$st+b#)uC<7m_g&lV$Qg7AMz<v$%ve3c8w5C}Kt1fiHu3U!fHY5&mhCPyiED^0<sH
zTdoS?&Bsj2)X`26(<i7f2|*rahrP~ZMYj=(-8N&>#xtrtlsWlAn~bUL1KASaCHxRj
zNbAP-hFlav-4uuDA+Jf^HjjzWXdVQ<Of6Dl4z?N6V58<&?WtQ|vGQ&PxD?t>0t4Wn
zBLz3{Hi{Mj?*F%$37ZYembM7H*zzyr?dzeu*qNfdt2Mt-Sn=BF&04EijA!`Tnxn{Y
zhYgNuPfp-^Ox8NWadZ=-n4tznT)$NQS#AY<7W4JTB`<&8|3!IqiFu<Q&VEDPO~|8q
z-FTSdEwBPW*`=?~STZmS`$nTl5daPx{{q|@h}6%5U2B88^3yDyiz{&ZypKNG4M2$Z
zDcc=er0C<_9TZ_yOMzFn#wyP#<_;0LXJR&Spbg@nb3%QgB&mSkcm&Nn!e&Z6EOKTq
z&b^SLH=3ZRn;lBFK=CJm_B?Ufv>lYVIU*7<EVeQazbn<Sbq0p>4Bazr1%`hx2Ya><
z2IFhBF-%_JP_Va2bb|vostJn&%lFIU($i%scN6grWo;bt|KV~k$oJamqUw(7MEB`j
z1vPtzL=}hu=~OMCYFOqBhy=U!VfSa!Pdovva@Sf=-Yz%CVw1_!912s}=iKz8N15ru
z2Ly3^^}X6%oa}^0@=R|zs3{G}j;m*+<GcleZ0BF|<^pCPlizawz24OM{bL&!=&x+@
zHIBy^5<re@Uh|Bej>m*FrXCF8Y<O#JW)z5$h2z0s0T@`6EdVia4O@-i(As;d3Nj$c
z!oOp&+uWx0F(uFd@gvTl;`zIhaqaTBzRZrxs)a+NpZ6P`CQICgJ3yBOgMWn!)9GdN
zg>VMKss&q(1FM{}!*wca2PN#??phIN8oyx-4Ig)cW+K-rj37pq6jRm=Q)2CA%j5ok
zo!U$6N!h|+gKEpIhWJ-fO{1r$Hf$=@DNI8e%K82ktiK*F?l0b6fW-%ylg-QJ(@;Fe
zU{zFealB-*4H=`OX16I%YZkARs@t5GwzY0Jzs=nk=#>KY1F36)Yty4gF0<jc%aWn~
zVo0(J|13kap&8&Xyc|&}e80@Y_s)w~+QIKtIxqxi^BnKexd(gv=Cp;HU9HYq#xsj5
ztx<E3ietFO66k-4(fXwO{l@O0-GtoauA<TPT$Cxsf}AgLEj1AkDQ&4WX9b291Ucdo
z8*-4bRchPa@|ho6mIt;<GaM#ME!Jq&A9Np$Leyi>dz5rgZx^jrid_ti>G?8F-?C0A
z)>1R6`WE5p+EG!Ud@@_;-MPUi)%p13mBPYh;tTt}P*sak(<yM8T-8ob2XC6)bBuWH
zG{1G!ZTH(p&C{UO?RL6P$W?`pqj7>93$rSW4-DWZ!S)yF_EsZL+H&4G7a^cPZR<Qy
zOUSLo^HODSeM@USsA<;DQx8uw_5#W`3^1v*#YS+gTotqd0jjyjTmun7YyWMvzEam>
z)!WszAdJ+C#!s}J7%BD}7zZKED)R|;g0oJu5^4<){9PO>6@KY7Oyo4P&z#!~_Q?~Y
z%elSLI1q#O5y`|rPHjlg>Wk&2ZI6}$48=B9dB_DARkcXN@73z(bo!bhLI}D6ja)Gq
zo8*9)$|XO04xpivvfQy0ij6=5RWfBT0V(A=M$rVZ@Hcq9LqU%uoF?0H0lgu8U?cc%
zR((C%$sM1*vEo^p3z7-aO!my*Tv0{MykBLpzVZ6;O~@)wT}=Ag%g0TykI#tQSe;5f
zCMbJ|d5$o3Xer!Kk!=iq+|6staZb+oY<XR_9CjCtd0@AZ9<kJ0%R99{xKmqZ83HJy
zTHn-^1tkNU*H-8i=Tx%RGKYC?NFh&GfZbb-uZlF@S<s4iwSjDP=(-SIl>@kVxOo<+
z7|^SSz{vIRF|cldkdnKtfZD<vSK(3VDtN2ljm%0DIGDuO)-2q0)6VDrx^;W>&tA79
z`vA6CTFqXUUQ=r;i2N9B4oIm5>}QINF-*)$GFMhCf%ab0u3_p8W!h@!%QWPsL$Z-&
zvxH%WwTOV|(zT6_^!WrC0le_h28?)g12ufBdS&lg=}28WGamplA_qh>>0qt97~LH+
z0Y1$DMeR@Ct{2KWtSAytkzPT=l(bBCB#)YPz8D3>32p$!LZ2F>p_<7omittei@FyV
zq3Jqh?XvOf@;H6@jj5F>sktY0EQs$F5ZZDHDU{HQ#Ay`BeZFOJsSu8`sn^fTa#Am@
zXKl;hHk7s_859<BVyk?}tx`mJ#~7)}Uf9$&>@z@jvPLgV#n#cyD@Em5+R}xf1KAXb
z5dvU6Ma$E{127W^-D{K4F<AhQlRDej8XLsYb<eWQC2OlAGT7$cALAof+?U5Yup+{g
z`2}vk8J|C2DcU$n6I<<3R?7s|DGT1isMQ>!?%urDk&PwWjE@Q^t5YRUIi5RXLnIum
z_}Jj>CR+ems9J&|#SM06Ff{TY#~@R>4ywq8Na}V9?S~{qY)-34L@~?$lp^jwHtcbX
z=_Hww3vd|SuQq)|X#&``Q_nHaZ}3ROaK93*BAUZ~zlxLusj^g4P8(x?q##6L5>2)p
zGI%5~G_(-`sm=r&C_r|kO>O##7(*FvG<7e^$%x7IfHd=xtQ(cKsy4U2US=0Ua|mKy
zV2+`9j_x%^f+Fmpz;XJ5x`YH|4h&`z%g8;poFf~Ik`&HC4UiL9Bs}Ob8U+O*26gsE
zFtEe?ZS1^(d%>lTx-Bf=Gk{fyagO$N9Iq(1juFLr!zP&Avst>Jf@Qo!u>JB`a9BoT
z<RH_@#fwXAw$8S2y-xA#%E_An)h@;B6`qRIKUAuA@Joh7qMsQNDvY!pEh*!CI2w`D
zlD6IxGuEwSu_e~HDqOd?g@vMxS}1=<vUD_&NmKx7vK<;HDlsRNHJ{d;P3wdPKM|KN
z9Y8*tg)B@B!Q11gd=t~!ah&Fw+x9t-W!qKRBK1d16f|j7dP$}@ViM#85wW7>cv?fx
zBr*v_cAf_Q<@d5u&!IrG$bmG}xu&qru3hK2#P8It_T_(muS__e7j@<Hy<$%(sp$t1
z%N({5+cIMJu>YjYMUCJ;fpx-vRa&S<u(!9DYs@yMZjhrVYfNEObZ#qia*2vU+EDgb
z&ozbRIP<6@nK>F^@jt<&Cgc2I`bsW9=}y_ckVW7u3g>AKR(xF|r@}N3DKV;dC!vxv
zgez@jD(<K%X#yEg<{GozR9!s!-8x=0PK71|s`VNdd~PmWa-G<pF>fj@6y<|#VFC+2
z&q^CoVi<b6fsjhp2ZSoS$E_EaFMsc~UY;~BPx}PU(w4|bRa-E)mc3hFZV_B;_hWzs
zny=!yK=Ok<1td5#iSC1&dl*mgTFDsu=5bY)KVt-}mJb(*1P}4}N^eu3!ZfCNVuoam
ziG&#{@ZaByhKh&+F|sNQEi4%+$9Z$Z>J2d<+8p;U!*qd63g4GFA0tgU_R#+=#>fVp
zv3aKS(r2zIBKjB~Z8u%rPIWn6MN*2)Nrpq+Wqw<=bEKV7^EQ~Rr>l5j8cfv+(u{+^
zf!2TTuqPJK67||hlZwe#xJD(MRv(puSgYjj3}#d{_E6R62lt~KxK&pK@;uFuF;xZm
z1*X0|>b76B9t7|j4$j9c!XvW?zM^+okmuhkrT=qY5F#o%?N3H}bEE#dB71J)C*<=I
zVvO_P`Rtai22>Q3V2dAY***Bq0z5Y;co)(d@=s?<p>mtCAA1eYEV_JR@B2S|kKyp2
z3*2(Eq6`P#sYzCV2}kvIK1Mf@(Tf1jjm}jh{GqLIOrhi`a`k#;l4?5*ah?M@2k8b`
z-9Xymj~7!kmX6*(AY8t;SG%hsG1{Qf8dm?3Gtzu+gV$~*lfJB4Yx$WO*wPIxLf2f;
zQg5N@gYKk<`E#EZSvi`aFA!Z!uTle7G^|J|2q1Z_%OOE{s&?E|o7S8AYCAhqNMWRL
zNMn=lN$E13Pi*{VL%ibs`#L5LAJ}8nH1Xfe<PZU*3v~}|l8N6aj+SLXWfjags+1ZA
zN#Z<bytX5%+ra?kGC!N$SXia}+-5Ui`2fwPS-#w)t+zuBX0pWV59T4$5hN%vveBR;
zyrK;I1L#gfkT5>inwdIBIlxWAK+&0k_B0(;t6oey4blc@ut~|`gO@&KeMhEyy%RBo
z)f#FwDWS17VuMDKLBXVsE?o6gVVO=dK*{Pn>7o(s*`p)Z7=@42cvM3zuEdGpXfS%{
z7U`g2s|GGO=7A{8bRsFvA(}ohAZ-{{f$i#ZV`28o1S{7077}B?#M#Bg1lvNkJOUAj
zDewfkpjzqku>I|1v8@Dam98nHp4w9dr_p>{2e}ZxJc_a<XE$Mplda8e-Hwq(0ic%(
zgK1(284k5I4`G*$!&Mm6CN{%@6`$MZ?2JNPkX4qdrW4N5`gFAGCMz+c=~!`4<nWsW
zy9b&=xvss~szeg5ix2NOVwgnML~T%dVry{B4C3PX6;4zV>|vY?adt#UEHNfgx?X2p
zfQyF#&oM-knNlu7fa)q6EN4AON>8y=5mz`)>g{|Lz7L}1GSSifIVSI%AG)Cj;L$u$
z4tauw2E{q;kJ6^J+UGwsPoEf>m6V9dLV3HQzRsGrP+Hgxk281T8R{I*`Jk-nyfYMl
zRVa~3I>SrfI`6d3`%hF}OCp$b1(+BcEfYjV1(9P<Omc+w$d3d@ZoTzmy9cfR1g9_=
z!?JT_Xy>z$jkmS4MN6%9G~+REDLT{b=ELbMAuaoo&J48>w(~V9Vj0N2<963GfGi9@
z=^)NK$E_cph=3;h@>WK)THcE4PS_L8_fR7`q#A{&;pSd6kI#B9xjo`k@@<i#R}|G2
zdup<2S|<M9h%(8d5u}o0f+(7OV@3~@D~0?}R6v{WI|cWxkQ1HPPuX;O0n)l6dMGT-
zlU=<hor?}zD-8p~yvp^=^@fh5n@hL+G+)dOnxs-tI94FuZYPr}{krXybnFbUq+frc
z<q9M5=3m}8tZc2#<Eu8b@?MI@Ryv`LLsJ>F>sf0)_+-oe_s&*5YvAi2h8TIdc0YvA
zo?!4LqtpCNC5Sy#uXe`pDsXvp7q}?XtAbHx!VhnPjTvV(_&iwej=OvX7_kp~4ooE(
zMh?IErb3R9a#%Z|-tbeFTA*aMM!Q*Qvb%SlY?X8>8&>w==1Ss81?tJ^?hCh@8=!j=
zCYN;T&h@^%CX1i<DSzGeb4tx<e*a-RYi$dnIkx1QCff~Uua%_&Tkkn3UbFc}lEs$?
z4LbIB9Wy~++<LL)&L{RPZPW_HnD<a(2K<@gkvvX5-prIV#DW<c&&#5@eda8dGLjaH
zO_M9mF_M<{t!B^wh744e(XOzmT8PzLqgMN3*oS;5y6Ie7e>k(jfi%Zs99ln&r<;b7
z3u>iIiSk7&V6hiTzt14)=Q$)DN7FJS{XU1JQsMt0BsDXxfTT7qRKrne-s6s&f5X_9
zod8ups=qCz9*Cyco!hiyz3hd%1`-KRS;OR#^s+u|`|oX!AzmfpeP<{n%~l_Z>dTYO
z)LEs%{zyY`xBfJFUsb`1&A1?*2i#;uYGn)e4@t0!#!^nMR+ab*!&!R~=uu?^^7$UP
zi;5bF|Cf+RyFuIuiLwfsheM>|@jL_~xgv-cnZDdc!*Te1@C$mCZvSTvxsZdrULyCn
z{rh&^XVGb)g=_qei&R*{K@8IT-T&~(n#pDZlD3a|EN&YGp>X4|&q2R50<IhU)^~)U
zz1(6d4*E)&8P08Y0x}9nbEc3IfE9DkJPUq<)xfm0p4n)VVAg-(nqehcHMb;`q2&*@
z|GK}Odxe&g*`d1ueRP~o&aC@JvQ`<}R(BnDGDgS}fS+yjNFV4m|Ma+$EN)A&iEY2B
zSRR!=2Gz3Q=(|?9Fnd&PlK&_ON8(gNR*Pg{!G=j$prDe}R_TkU&3c*U^O4CuM8Zcl
z->k*FF9bYP_)ZY0u-iOC5Tp8x1+&+B0rO-vvgjr%WY~p8=;Dhrg03?~&?>aPM-pHx
zV+)|*g>?zvx4V(j-i>~iA@rt0_3retm{#t)rK-_M3qtN;<OpKB03r>uXL*=$6hlr%
z>a_Cb;2?NnM`BZ4OL;hZU?{#kY;cpsV$*#Azez3Qs$^0-<*9u`Vk>bPTD<GL&IM#B
zu1jj(d)C!z(1Q9zs*18_7c!{sAyhmBTVH(l3E-v4-D~Bp6z<-H3Gtb!m*W+Rh;$yY
zoPZgg0Qxz@da~B0n?W)=Nk(LAJeCL@YP5C7hF@K6^RPG#i{uh>?%xx+bR^Pj-`$y(
zSz>5mDK~AhRT|our5H|r>&+4=6UY4C;t3;W33$}ztJ`psnwN5QuC0`p*`WP2Uujft
zNz*bx-q&)^I<1SVlVI+v-c<L!?maKUaYsL^$=&)^?z9TFw&ezCJK*>XcJ=|W!IKMG
zvf)E3BwsU}b7wE;13<PlJ=kWmJsq$auaW6i)YpVMu9X~I0!)-JKN&O>EqHK<n1=5G
z6-}WEp+b5jA5`vrE$<tTzN#-C2y6W|j)ZRZm8p@6%k=HnmIa46Jd>4&cQ9makDL}A
ze8DxeGLA;%RBKw1feKOM!6>rUMk)*o`&;BO^D`b05-^|UO*Vl#$28}5MT$0!ClSXg
zwj43BeJk6qL!+$cK{mbmmW*Vp@tqKLi<(*$^TDNy%Ki6Fg+h<26iVh53dt>0!%88h
zVIA6s2L=+rG%D<hkcFKCuuF;@L@DCWqZ<{@pPu%UQ#eFLIm2+QnGv2QS4FR~3siU0
z5UTw^G@iw2!QMp}FD3N6J}gDLxHT~k$fVEC*OE2WBAM4Us#5k-+JMSREQjOR)ngE+
zM~)`VRn9x-WbTy9pXf2Ru}phSA{d-Dv9oZBqse4AO>4_!_$y}`#r_)s|JEjUDiIT#
z**I|)B~gnW`t!wV*+|DJ3Z2eFbxBH^N1t?3#31{482STic&z+`IOY^96sE~lJl`B;
zMH#tx$54TfQe$Xa2GML?t30L2yB|j+){k_OD4;ed*C2i*XT2C~p<ftzyl$QWUs1Vs
zNhXYmlh%wqF0~acQ8<896yn)4kJuTRLY6;d^d!{6icx(2N=sF6P{w)aMBIMBAWS4n
zAtfKc*eUf1ra4F93Ir=2Z$mfb3u!|#JQvIboUxWdJ+vbY<Z4@Jbc5FP;RwOSZVBj9
z-mq=tC9Jbiefbd9MOJ_IJTDcnW8fL2eyr?u!=<F>9jzLoW6`$pI9keRld*tj+hsAl
zrPP|Hju<?v+`=?rNn>Rj+sbrUiipM5mh#jgsWn-+kbtB60P%-3;KF&@iLsj2c<F%P
zboar|NRh!!WYNA~&32{hno3HPv(O6jRXbpF(nP@9wPqpiOLp<YUV-NcW<I8YUSp8X
zacxxhP&$RczFZc3;!=d*+6W`M4USvq?bh)Cy%rk#4R-|PWK?3ZBotB-kZ8F`QXNmx
z_y>e4KBQi7?as)lStMbSBE!mB*!WWJ0e@m56)IGtrc_u^?$h#KmW(ta2B3!mE5O>v
zK}`i)A~zCDHUVVhz13WO&&_*9*iYOEr+2~z+sEYf0!<)q@b@*N4Ll~-0nSXNksCVI
zk%Qnj?<QmKY$XG-97ouG+HONx=L37D+(cD$C*0xdx%iS|eU50jjQA048&?UK*Wg;&
z-)3VKyGfr0#LBw?np81;WULY@RnuiH&Os*D9vcqAdX!-tiO<}L<;6)%w*gYPku`qM
zy{T<vy0`j=#y;n6lGO<Y;?JBwMBB3iw@|<4fUh2p9j#3GzC9;BP^DqAX5Vy{js75+
z;OB5!0-s92diq(}INhbiBZy$f4R8_ut}lByKFXYq4Bi~9mq)f@7(4lvvWb=?mKQKe
z4aEl0p@$AV5>|t;Z)9$f;?&CQ-LMi!kpcF^Tq5o0I4MX}oJc!p9M9WuoblccCGn6L
zpNA^WC+o7b3#$odGZ*(eD~*$+LCc0{Hz9LOxB|*F6;B!}-fTllOZE_{1G!mN&1tsL
ziWX*tK_EFl9W9YnXh@_N@!!b0jSqEpF(nw+EKhPF5A~eSC;26ExL8G@FcO?<ONV~#
zHGgP1Y%HUXjydX0NNwSmwQ(35wd_XTY*v&c4zs`{4}~o02$pi+5jm-%Ay>BW>5!K?
zQ4GGSQIDRA;?a;B6I)D8%p@dN`qa4*FNe3}oW;Z%79XoSNyRg+5=3rE=E@!X*#LQ*
z7-z7e#w}k5CV{hCVIUM4B#}BtTc{z`fT4M+c82cB!WbCH11|1L+4)O37IrwelpN4H
z`h;*`+oSD<5{uXePgq6Datd4#oE+?SDxO}t9nv#XMsI2;8(v0u!_@LPR5yxJg9#S%
zU5XdA<vi?A<zurahO7`JZ1p8`m2MTUbaZwcFxR7=yl(wuSA8PBY)g(oqFn0ibKkl{
z)^j(ZiZwH&X#h_Yv%V>QNm^=%r!V@3dR9x)<@(xYHKRDr0i-ebqX`zFlJAAHB$w9H
z35aTICuDzKM9Z1Yjbo7=XgVIhN47Gjl#un3vrMI$rCrI$f|2u|X5@D5NNVANQVu#2
z4lX$Y4rF+`rFX^iY^*)OgseCo7vhi=GA3DORzTBeAP=ZcP@%{$IiMpp)UG2~<pw=<
zQ{;VKZ0)7vJwJLBd|p$KvU5wHcZjjinadmHhn&hP&7u_yj!*B&dWo=ZxOl8SJ2t8*
zJf(wAn0@5$^O0nHQMK=KnV(%1%f3LeCwWZ<P*_`Dje_rkLyxCHVW2w3kLooz>X*+T
zEN_xv;hZ5ZrDh1k;X!Ze%(CD45}erpD2e$+Efx&>4ue%a*%#gn_IE!Y{KCSnw{82g
zahRS2$@t;KN@RMKK?qL0wHNeO$--69*&k{=n`AkkZKE1t(D<VQ17Mbb1ZcP7yO7i>
z`e0(ksDo5ljEN_AnxP3oF-r}JtrRYrI9&1N-vBR1(Dp(T4LqyhO^#APh1XD_8>Pr&
zF8R;1;AN|ioea9I-sNe3&^~WldS4{>^Yx6*l4q)g6X0#NWfyY*f*A65)Of_r*WH%n
z;6NUTUhiSMrid>ps&wwnC6iN++Amx+sr{xfB6^lE^>vy%G(}bsE?7SyRrADYu5xks
zw{)d|-S|O4UEQT_4BAZ<nD<m}v`UprEqIDkP*_?EUKC8&<K6%4T1#`XT5MoHYT02w
zzpqLWcxu>Eu5!Jx?;!_y(BMbG_#i)M{77Q9?Bfpw^gzw^b85DT=2~ozVS&m4sCP^h
z@xH6&cZT}pX)^4~atc<Ziw_y?cDi1^i!m3lx|RrscrnevkQ;^UwU(VT=YEFO@(3K-
z-Cx;aqk`c&UPXx1N>GS`D;Sg$V1O>-`OX*Ru$TE5ShQN=_Z`g^)8rO;{q>xJpR;Wu
z=1-b(BqH{_CnLnJgp5$4!bCC6(9qQ~oa3-uu|Uk7j3AL?m@mj&>WIfpY%^|QnMZ@o
zBzHocz8z}H=oGqDxb2ZWK63WBbfJVrmjGoiiPQk@lU<_{Iod#m9A2@e)(5#>4AT!R
zhN3TOR+LN9*#x!Et!kyzNnnrQLef%{+N^+<WN3(ef#jzZ9;S-1#$)wWvR`obZHpNM
zBKJb&uplWc4c^6xR+_WAp57yJFEC<CiUFlkOU6?H3D*nQymT`otOyJ4Z(}9|GaNvg
zII5c0@J<k$dv8z9DMOeE_rQp)+V&tb6j^vMx&i+z1h4r{CovdIW6~$6B4FnU=XS!p
z%@lbGRbZK!VRRaWAL)7#Emc-(iq#@H8x%3K;N@JpmL}g2*8FoC0-&IG@92b#_u51<
z{aP_?QHZW)-XQzL+?kTc#ro4M9%E-F{IY^|59vQ15h8vgO%?=HIn6C(6&&<JQN?WK
z+Ic{hg3rF7Q(A~hu-nhj8hwHHELh{J!Li9G-M?K#wGm$lp0-=({Xzeyi`L-c@<s3R
zMWMKgysBDC-jEIwsgDH)7=T#RT5RVc&M*QV<XU9FvnWC@^})MnsI~i?u50s*#%AnF
zn3;2tE1&mwBbKSphhiWqrl16f7MA8GTOrA+fqW)%L$)20ZZ-QhS3JK?B}rL*<Hk>7
z28&K^V_z;y{M>!P_Px}={%l+`{Cx0&$(x(ft(IMHJV%1q@BUG=vUoklThzH6cgLkp
zWgp+^=6=#q6D@6Ph|$3dwBR}ogrx|-qmG*u+%_v)S=k*>G%=9R_<m_UXEiR?;5%;f
z+?cHz9fP(r{mf?B`xZ;A1IwZ1=Q5chPae^|nMKx-z0lyp{;|0T$qG#&Om%Y{lnj|>
zv5vu)6t<SEUF?9b52D8pvWk4h;R3GQr^N=~@)v@l!;y=cd!vr~f07nk1Q_Z{tyqyR
zYTMji-b*Q^eLuXpiBNk3pkw_FeEE_9?A72nQ4w-PO(_U|72Sf(jw#tGM>RfwCIBmv
z;<X5`<#$hd`3<amF&+A6%GwUmvv+Ud72haQWXp5SvnLyqZwt^?D&jHD<&o-Q17Q_G
z+e=ohp3Tn8?%C#a>b-Vy_hU>1cRB!|up628=Bgo;%uT9Q$KXm<hBJjMvlmgYlEM`>
zDS!dEvTNziG~peTO@|r>@V|X`WZJ+#+Y55ll(XPo{fItxw|akzhwAXa?a%{QM&D--
z`H@qBLh<7{{5VL%cWiVqH@P_;u0OzBN)gDqtGPK<-vO-$f@r1d4du30k~<{JnKnVk
z554?enJGNSBpEal&Uc90ib*ji&-hGP>S#AEGK5FFHWupDbsGCUDQ|6fw?I?dR53Sf
z@ql?SVihnoWQiWhIotjSEFE)D9uzVp5$W)-H1&X~6HNb5AQ@6La@Sv4b?=GciuR<o
z`wt$F4ad0O<q19$8yx#OoF^GMF3M{7+1wRs1aga?;<b`xo#z@js+)AWgOZ*byrh&Z
zAdMQ9ubxWl;iM)uxy?t>5)A__4lSh!yTeFjCXoe5&@xw<2~vI)wgfB+B#V)ANnl5~
z<eVWIF65OBCPxFlwQPZFu!ia~834&V2_0gv!3WTr!FFvAO1vp~V@y=hcWN&PjM!9D
z0m-ofre(vc<CA20%2-EA)E&B8Vv3KqOMD!tVc51q)}?S@-CGhHvHweB3o*oX)>XB*
zCEcideN*OofSzZ#Z59hj9?mA!v{-109bmqBerO^np#O^D!6;twnzE0(K^2(iR0-=H
z|E2jfp1+O8%AJOaJ1p2CGhjF&Zw^7rr$}|s5OzyhU&_yVu|u_SN&8$ocKY4*@qWVT
z%y%bMxE94MT4{ihELTS9VPX3uZxub9MwH}?Fwd->O*ic1vpSZ?jI)5*iM(*MGACyp
z4sz>&jr{y8XXS#b7!*W7TA8;&0X|0E?3vjxG?rIZ!wP3m0&b7fv11_3L<<Rwl3J7_
z4SV-wNh>S&#Hql_R*yR8qAgwD3p#UsL`wvXn4JLWz9+dd^vrSof~C%#1&Ycl`esuU
z?D0rXfuQA>8{W;q#)kI2wU|uLMpKo?xa=xroEp2uXMw5&ge;@m^aORX3hUi$9(i&^
z(>k6eSGCjA!JB6HynX(%vBix!rfckit;dya6*=Ez!YJskjsu(JjH$geG9DDR^8^W}
z>+IM|o#D!wGZPor|FvE*w~!~8g5{l=nILQ_a+7330R*`|&vk-HQuEl#uq?^Yi}mX-
zWs<WQl~p0P;6%bd&%3;+kJpdi@BZ&IJn*6p71x_wak9bo7wGW~Z#<61zR#AX$+&o9
zs{bVTBHb#pG_YY|Zv>uO@zwi=v&3HES1eY9COewV-Mh3<m^ww$tdZ{oHz5i|L(G&B
zuXNH39uIYZ`A9hOgXjw>mqX6%uCjM!ZpF?!{q|9-!EWO;30fmc+#*w}+1jlN3%9kM
z%(sza#rwyl<A7iVwt!>c3|XTp4N3-8Hh|}F^e&8<nJmN#oA&vybT=N1h{~zHbk%<R
z=9(2#5+ag5k)00=S|m9klyD|-!`Pt-C4-n0Djb&}afHKgrJb52;fM09N>wq+z`loY
z$N<B%L_>|OwDel$^vRoiCK(B{P*zGPN9~f$Wl7)cdU0(3VH@?oM%c5BmerULFz73|
z5+xD)GOVI`LpxPa(>DSwW)092Lx-E-D$!o>6UZnGMTB}P&b->#I;8vTVZ^F=3XOt>
z10yXJcIFXg0Zc$5o3B)gH_8hbkrGu%7zT?MP?Ect1D1v;zI1;P`@|4LhRftF`fIRQ
zFv$TzrQ1N#h$%xvgO*~mY2u1(94rAK1rx^J6m~I4sE1)RNkmW-!*KLzm1BppqG=Qj
zoD`HK*{adzdSyNj2+(L{I5c1aFsHg!?VnwAy8R})$J=^w?dcpU#~dbxO2*G5!L-GC
zo)W!ZMl+03q2gFjHrNP#m6p2yCI{+^ILqbAgpZ)GWI(`#;lw&JUD+%**U2>E6+x{h
z?Evx)NiF8mWP||#U?yovJz;5jNa~YGDk6{z>7z8lahk3v-P>9zY%MkxIY41!(dhC7
zEp_a}T9F(@;7{78EqJ;RF#^jB*OQ+Q_7A`Q#atkC7LiLG9OZv)vVhZnl0c!FY9Dx>
zt-3dy8IDi@O2W)2TrB_|D-w!mN7gbvae2-Fy|AD+Qq#r4BY4huJs1Qz^~s{A&C!|g
zBQT<@q<*TT8f&4+t5w#@WKNnzvt)Veh<<Q_$P{H(w)NEHDq5vA0JREG4`1tz$-+ng
zwi4BV3R$$YfrUkI907rY<`$Mux`{o>v|<iBUWgo86&o@@LK|&!d~Md02<(cgJT;Om
z{cbpG=S+;dpyw%$Kp4tYxjf?cdSmOa^R31~<B{qh<J?GvGH!}^2)a6vV)``;-;&QA
z`AF+aE8&DN6*sq$yXPVmunmMeDpGi?<3#ULg{`d60RiCJB+3#h!*NrVQ0{#I_-Q;U
zfqZLiD4t6Ka@C}B5{T2~5@_r&#K<U4BKri+K}i^B?u5ek!4A9_tR-#>jpL~`YkVo5
zg#($r6^n&SUZ%dFFaF3a&UVuHroiCP6D`%mY|$MD-y2*EVppuunm*TPoD?U{6RbX8
z&+wY@%L7Xkre=SRMXdsxc~(=88e73%SASgsw%Rs`xVzrQi(ohn=Whk$vjKsn0TrR}
zulw6|x-yUFXj<bmMH`j&r@4o>nj>APyP@>(l)JP1hK&`_zOs}`YDC;jVPHuQCFZ9E
ztnt<t>60(UPlEM)7*0cS?ECvVS&8y;G?jf+#95~%UZA1RvOw7=w;F2d$%p(>5JyG$
zBuo<9GFzUvN}bF$zpLAvC`3A7pRbWnC4&AEbtI@&&Oo@zK-r7}hA51@6=V!Y%t~go
z3ddLzx#3BOlZ;9l71m05{a~x=86Xh=8JgsjgB33j!M27*qm3(zXy9FOe|0|^Jk%<P
zZb~~h8vT^kP5GSDa*8tcXL3~D2Ob64eHLL`?JcFmBgtAP)Kfga38Hqtebxxns6P#)
z<%UDpXwi(%5iQjD<v-5jiLL1{hdT*pl8BnGO)xR)d<t8+DWWD|>=m7c;WSO0R)DI*
zKVdw@zEfI56LjMyl3-8D^AQ+_@svdzyOm7bOb1VV_aa`EA8G5%Pde*1UA*8&bp6&T
zrLJAJ%o$}@xbtnzCsXy^V-w&<oiSgOAUJ-?k-SiQm&afH6lw07`l5~$lEO@4nqlUk
z$XpyF9+EXYp!Sk^HyeML=m<FM8;KZilb{{)K!NQsVkCy*R|yH?rVR{C76TNQW6uD>
z`Rz@ZKiXuaxnEl6Pj<+0Xm~XArhCaLMYlG3Jd!;eNJ_$I2Toj6f~s-QdEV3%=#isD
z#48=B)0uD4JwXw{zSk|m=Ee+OKJXoZn?;%e0||LlSwjK5vAJo}G#1I7qe6}(Knaa6
zFnPOKuX2Tk6gSayN>PrOBgkJpcnMcA5ZtSW(pzH+m~1oorRXUzD!IYTw!ngHMgVoA
zer6@0r-9P$Qgk<zAQ6BZLWhM-f{>DQw8iC((ijOL<jcu$WSRa>Zyjw)X2)jPQsE|@
z)Z}VRqzuy0HsHt_#}oRA-c@++JyB6>Y-|8AY#HHuIv+8_l|+l4Be%pM0%rI)CG94i
z*mSEcM96N-8J4SJ7C{>&(qtZaHZIaL&xXr~T+QJY*354)Bmyu@!U#JCDwK9hX}odY
zn7B?P>*nIFSOaU=?PrDo&2%Y}Z%xbGrA_5$p~jcO1~QGf*S@4Y5uC{>w~RSJE-YNO
z`O8exO3c^Ynpc^lT^;IMa-sKxbQDrZ85mJmMBXooN-dTV*?XaKc0`%)jS(A$RFZVu
z(ReFAF;{EHcQ7xbIeHmHbm0S7YU0_ZD!ddP)k<Zj@G^fZL)NWbZDxky3n>5#v9vmp
zp;pvT`evo!9<P^*(``TQ>}jJbPoP;cUO>XKOvdYx%5e>Z7*0OE=F>`F+fbng{Axeh
zsNWSuq(@zc?MyI^#O{Gn@~vhI)q-P2f`zpqr(Ak!tqvK)Txqa7N^TKd6fkh7iatsf
zMro>Ynq}O6%1dV{#uo6bhsS>H(K2q>sERM5=q)|p`oCMWiFC3G*0_?Q>OEC;(_w0^
zVHxjXR{N(mt(ACC@tkkiEJEf|H`2v%8HcnfiwqMukHq)DMrQLKwoy9f@RMk}o(V?h
zlv5T8toO;-fY8kW6Vqe9We|&rjlEJ$4{6Ch*El7W;ddirqh%Kn{jX?$J?&d{KbWOX
z7PMTJCj)VHuxU_-EecSjMM2y`bb}49m%znmSpmIAp8Ctccqg+}&3fM0+Jj%aU&Om#
zv@LN26_xd?XtjvPwR(eo%~Fg|TeE`?)@YZ}?TFoEXYi)mIY0gB_s-y`+iLb3``>>3
zHM2mwP7oKrwM0kmKL`+78$6MKoEXB*b0JcE4RV#>sg6SRdXc>ad4o5mwl5aWimp*%
zYG^KDnUAn6S(6Ozb?3#VDZP=vbf0E6_^(`+jO$Mg>2t{#b3&0uC>O=D%nJfyNz3Uh
zts%k{7qg4SKkd}jMzh8VP$;7J7On5Rep(*r*peLZZd+ZVd?tf<q9HY*D4Ylnvkv;D
zJuVE$5YOMbV=bPA^9E7PF<f+g2V4scbi_mJm@!*S8}mdCX~k02ay_4uNx5ZE&6Wjt
z?aZbJBC=}_77|X$&Rd7B)fSS(iHIEs8igp+_J!R3tIQHC+bct`cy3v5P#i*SP@<1c
zWo+->`;({#qO_IOg6+QD2<Rs9#4IL*>|r8UukM{@(ds%Gr;fWnUg^+5++5Mgyk6v@
zGkSD1csKGn-;JOvEYA2enqRH1ZHvjgw!*u4oPDvSY&UVdU4)lWVi&+tE=4mM?JX^0
zgH*m^yDGCg7a_E1Y%nC!CX`$+vhAQP4;xOrjVKBf8a0erhRT^Ev3!_Dz^BH!ydzt9
z2c0%BPzJgh@MIJs*`p&blF^jH0@J)R?Tlj#2F^_IZL(fEh&2R;lY$e%>hIZH3Sv<0
zpza(FI+0o4Xx485US$RG6o6f+Tq4L=*1r4S3tI2#pr|ywa_lQKOvu_$c$&%RkCeb(
z!Adr#kKAew6E=oooK1NvX(K4021c0T;~>Zhdol;VB$xvcgNgtBq;6GL5AQ$q2f=-G
z#XIf1931t39P~REr>!4ar@_AW_333ZIPktXyFBf;gTvgrm)*|g1+3QKtO>2R&su}y
z)@i>Pe7g@HbC&3M$g&|>2&Aw8G1<Hs^MZu^c2~EH2+B&$z>3PQ{DxH!OmTz7532vx
zvmyHSOgIxQpTXB;ULT=SX+)B(W5vPtU?w&J2{ibK_=|Bgzg2>nb{w@FSa+PZh_!yd
zdTO=R$DF+HFjmp&Iz+NVuzcM5v32xk2gW;&VN5do73hyMsy@fW<D6ZIi4n|qh*n*7
zG4|BdC6%4!7>`G{6JHZg0Nn^P=m=c=tATq4CuPimR8xX4!kGeMuNQ1-k}$w&X`LaB
zP&l;WKTx1!9tpe%YSfAv+eF$M^A*wud-<OhIalad+C&7PD8`H44!7yF*dA_kdeL|m
z1I>r`$@=P=nF_w(k~>}PF{EaMHg76qkiysi&jZ0$qbwvPA;q?46K3R$6(6h}C$7%W
zkDt>E*hsw-HXJ1189M$~yU!U*kt7e*5ADjn|I{uiI4DKsSGKHP;c+xwh3EzWMQKTQ
zsTQrfZj}ptkBo*Yze``TMV@b>48Ac-h$<KXBYk72zA5getd90b7@F_?dh+YQgt2BO
zLD&LZOoO<JcSFUWP6)vvr>BwSFYPSa6a@r&?eg2xNY5z$LJvCsigt}W|4p9O)$p5R
zR9g|6X~eY1XhWHKv5|LzD;EhyqliXz$dK9yE%b60zK>_?8O#HjO>F_7BFz(pcK4rH
z%PBKmiehAT8t+7<5R%ySymJiWKU~iiLSxsYrcWk{<=5+?wwklgW@O4QoshpQGLouy
zfCZWSvVAbwgxU_b;qq#cq{iV=rM%D)uw>W8X*QNMbmR|}(UAMeSZpU!*W8z6939>?
zFp+w&H6rX;f6m1+8BQ^~SdZs4b&W@GY;><mkp*PvHza#a!gwl%+7_ud@(jnazwE!l
zVZ3Uco^~2~m78wj6Js}Ro9c>l84FLth(u#f$VD3^n@z=yJD|+4#TX6Nq2U}}YJ=Gd
zEsg8uY{~NnybCkFgz!))0BB=Th!-834j;)<KU4gGeqs5FiCdv6`Ya2k;Lm1Vo&-AD
zhqb$@bE31)0;L8M^-2osF}kiP+Rn2lhiNyS@RPuh6D!q-1RM~Zg%xEl+XSF*z6qR`
z3Jk)lA;CjSn-ZLVsOAua<!$Zznvr{<d`(A{FXE2ELNs%g@6UpfIathdD^NHGFa!3u
z9ys+x;F+$&0Xq<>$dHP5W80xbL~FxuHUzPaxJ`SOo@bQno0vvhZelFvlm1zrS9fl*
z{7uqysx$}%3ogcr>nKSht0onrCyotictxf~3rX3A@lmu-x7h9?jZxPi!kbZamkeu`
zKOkI2j7ClI`jZr!1ro4Ns=H$j(J+gN8BUgOEnN>CXn=-O=9TZ6NRDZg<>KlPEfp=(
zs29ZpmIu1KOX1Kedc!&`t0Q+~-nbltDm5EOI}3t)N)cCv#(s{YDR!l1or|q(`CPw(
zB~#_3y-eYPn4t=(9ETVgn$5rCWNdRHOo4;vGn7^+mBkTC4w8*T%Jw@7`+^CnzN6__
zhw90oBT62Mu`%=6v3MNR3sYP%<-zKnZun9BAdSXl3H3r4YNIJnzJ#1Q`UJ|Cz+vh9
zM>1i>Bs*-QGeDcz8SE7_blB&qIt6otgxOg!T0-ec>34;*+XKLF1E--35ZPW)VhPxw
z#bjlxRP(TS`n!Ymqg^nyHC22UYAIZ~R2{?{qv8TKZUEg3tc)~vCyETnwmSvVrkcqa
zIAsNh@~Gs6P_?@++kXE9jn*=vT!&U#r%w<b2s;A02$K5^Z8h?Yz4hEXi)N7YynAYh
z!0=wE@92Q2zT;(*e%|i&)pzv&?WrF}&3^Fn_bQ9}^Ivr3Rv*h{JwWl6*Y*OXvLFv<
z%l-_nbz3iUZJ9Ucm>m^HFa%^by}x<YX`Z#sq+a3}aZ^7Jeh<1W7~C%wcRrfxYy*lj
z*IXx=NnkKC3d?6Fr!Y*4oxuW%Hnvc;&sO(vRH;-V&z}WfWfjO4N3B{vv|AU7!1iIf
zunL4!#r(WDOhL|Ucs%Y#i|H*H=bn&lLT%(xK3^*9cge)7GJCVFG)hqO_0-AS?Tz4I
z??Pv;_MLsQ3{`$e+whyNJ;;JP<et!bOC?aSiJ-W7ks+zDFgCA54Ws1gvPkU3+Mbx~
zaNL^ly3v`TjSRVf>CPg`cP`1s$=lQzSzb|ayFI(Xw(Yj1J@H9Uo(J>9I6bK;Dj!y9
z)ngWiP;+fsGyZ38@q351pqK!4$7+tcZUpO$2b3fXpJM2zF_|*L98CBof#`~pV8apn
zmLOr7&^Sw=O`OUjT!^Wu>^-lUJdcJY650Pv84lom@T=dj*6HP|&Anu7>lsGbz>}GT
z74rB~8roOf?D!FXT8Yb|=(-NRupwYZjZGG_Gd9Ndxmvb~C4s9jo`(Cp$R58{6z4v#
z_BXp3Lu!}|Ts8)xO}&m-P72tB)c+K^EH?3`?NIsT3cifqC2ym=zt);_a?w;b#zW2W
zKPB<=8`7c`liCJL2e>z~%E_p~@K=WP-b8A-#~ffZHwUzazhA_iji&E5g#qf4#fUO&
zQAiG$odOmD?31@H-|aoU$I*22>5U|S^~jmzT6ZNw1#G~tSvEj}TKxMoaJ4nCHw?J5
z(E$(?g=Jf+Z0qQ-l3;L2rpM##iH)DiTkcZ=Kn|@uRE*iQ-}+iZ%S)v6KpZSBE6Ztj
zcj}MU^-X!(EDUYV$GBl-tJZv!O>k;cYBBt%r9DmNSNI>SuGFr8<X1ix^;rhVOL&9~
zyP7@14u8odCeH+)_A{U7z&hrlv6nE6s@_?+IK}Q8-(<+#3DHyAOIm8YSWn*`i53#J
z1<_p_@A-xcHVP-2QPqyoV**GC^_Fqgo3Cd~zKaRM{!;`c!jT3BSiXl<3Rws1MDW!s
z+wtxMv$ZoODe9x9PzC=$%2Ch&rh~!H@M@@LGK+B$rYSlGS6PsSD!b*O=*{IayyYG(
z<pgD1lUg?BdGomWbGT*mw@GW3t`a}hGp&)8{B@jSOPduM4k%u%(HjS5sOqadrheD`
z94g9CD%|U4Fe|-;4P`P@n2ig}!liKvby@Qrx7b5(oI>lWkqjEVj&y#zDnrEld|O#U
zQku@tPg^XcIj98qtsU3;Jg2Oyh>|?htkd5^XBV^!-aQo{Bh?1ocsaPF2^URQ*=ZNC
z=@-JC-vKccXIm9HG#mXt3qdr4{?G{G$t|Tm|4R_W0xJ1N<k%P-3kSEzy&@$iGR0PM
zQ~6l@&S5r-DV@~obj2#JXNB#S9!ltr68|R5s1rZR<EA9f{jN&tWud#0S<NDsCH$1Q
zEzzU_xO&nXnF_t2;&i0tJGpevE~sx;;O7AxrqqXyEUHoFI;Gd&Dk&aG{K(@*RZxeR
zU9OXLsj|mZ#kFelsIu-<Ru5ixE8nWgiA)V{*m3xA9jfSEi8OI@orJSECrmhzX6z(s
zo}1e2cny|0)+3gnVVRUvrNKGzB1d8h48Wgh_k%2uJv1o^#|1Pg4c|pu^<3s;kB}ax
zV%)96fJtCdD`NI4!F_ET^X~;eC2LY%-ALR^iR~$-{VG$Vt;y5*qd6MloUOxxFgWU*
zpR`{F-PW6KyWa|Gz;dq1?dTTzp!>&A#^~9rARN>kyS8+dXb%I~;-1QTdAHro*e3ul
z!Mz7D*54$%delrC5mK%A-OTfISX+Q-o3^9t80>?C4zchF=8USStS7WFHA(4$TO6SF
zHU#nAy5PHcHhs1nv!=-v+Z4<Y`!+OUokCl8f;Ld=a$t)xVOmj<;EVdhngbEOj`+Sc
zj<hC#?0h{@H43!>-j*`BZ%OzTb2FYceywmO_<-VSm$c&oO+YD`+=1Pq#=@_2%4||;
z#S^l|f7uaiUC!UmlN-#%!d=l_##SSHXOZs?KY68;y@DZvi#11<D(DVqP$BK4>{rY=
zJ5XYLrUjF5(&ZJ)(@AD^7;ITeZeOxE!48P_W=J3j<daL%nxG-3wzfMv9-MWKFHc+b
zf{;qNDx<q8xh%WSd<|KVDw?g0Nhk|9hU%q~26m2G9Nr@}n{puQ;A|Qj0?P47OdrUr
z;6=ON3%=g})3>@5-3wy#KWEE5{^QQ!FJ$QVDteC&%os^%zT(r@F%UxIKs2jBHU2l>
zQk56CI%bQG-~jKqnAVn=*fx4mt=UL&T+~?O5!@j&)y`5KCuY|*9$~W$H@q!=^sT6q
zQ&{yyWBDHT9fFa5JkJ5^zP1mx&55>^pNY{oIe}}htNdBBMT1dx<;i-rSg$nD8o*2~
zk~F4}Cen(h2@H{y1YeA|8o4P|)|u17B7)$`61cwns{Z(ETHr24AHvIcJrQHbfzL75
zl!GR)lwF_*$qdlx2pg@Du9Dg>P!1Z_K3BAy&AZyTS=_zCGgTJuY~E`8;*_t1%nFlJ
z339s#Op5EJviw621HJU*qJZW_$Z{h~Ofj%VZuot(E;|_<(Ie0|u%XyO0I6L}!&~y)
z4yULP3lTG>x7o(F$eL-(<VLhu?#XnWUOV=Ru_tC_(ebR_+v||M^^q`SUZoMLW_r;I
z@4n8+6<nF%Wz6<Gv>L0n$SmAzC|KIMCvuvNe+3My`gm_S4Ng|1Tb%JVPq?g)qG8Va
zJP^xoUGYOpNGMKTX$sr-y;~nI#4vocaxcnf6wV{(4aOE+<<O=kF*~@O=Rw{`)Sa6e
zSiaoT{B@pns8YR;zRby)oa0Bk{s9;0c%i5Q!Yk1b?q+w6pF7*L<}Ne8D=3h=!-4T-
z^<19YVeRjeHM=QjmmP4j4YSD+ze}?h^y0c>+=#M3@w)No#-6GBsI8}2Q+Howa^SHl
zzm0CIRn+b}cF(LWuhsxN=vcMUn8;sMJLOoV*DQH#m2GVQqUc5{uAw-k_!n`sdSAAJ
z+GDn039~LPPXcc6+15&2y*B{Uanv!jXBd#XV%5{jrl~kxha1*FmAwA~a0?Zo&pud1
zThrx*jL(*i)^40-s}TZax>CKvtcjN6hFh)E@G9CBSNLqd<7ACtn9)!dI8FXluOYSF
zHQpEX#|QiS`~I$usS5N0O;n_X?6HQboa#^@rwtnf>|0W%19DhUG~ml}tJl%=|IgmL
zx2JJs`NH$>$)~7j-b5fHSr=QrJA)-;b0SL`A;n2&a+m@NsbZ*ND6p*V<b3vbuiL)W
zE<ldmJv}EpPj@WX_siPr`dbs1F|s{2;n$x5qWN!Mt@$qWYmKkgp!_jJexQT1lOwj5
zaM)I4>M)<Ei;7A^z2DN>4fzxsWe1>92#O&jwpt6h;k)kpdT56fK^?p3L)c2$Szju>
zPK@X7I)XgL=}0QMe*C72MrTBr8<aLTRT=TQCgEudW0-TyeG`wO|Aa>V({SniIFkl@
ziJ$cfQ>+Q@DMraaS%`O#IvohB5J(^#GbZpQYmIG~!iuNOL#cS4Ac_-JE#ogy@jz&T
z)3FuEu32~}0MQw`py)~^!i@*VJe|{HATZ;3JX7uV<}=)J>koU&*)JbesRLR!*J;#1
zV(J!Xq!=$!I@A<Yex?3QB>N{}>O)D2-!SWlMnZ3b;DQV02B`@ZfekZvwk&<VQP)o0
zdANO50a#MBGw<<b>R@JR)>`WrTE$gMY&VuK=~L}6?<y6VoogOcT^{#N`a<|&xf5Ez
z&1@BAv2UQWwQq}>sM4TxX7OxZSW4D^L-?T;70x&jSqEEFXJ^t2`JF|)NDWiHuHhjd
z9{st{3W^=VudExOe~oHnm3sLi+TYs7n_ai_VA~jIIp^J0<OuT26&gYX6PIgChV5sL
zsk$gm1)H)FkPX@f)Tj(e0^e;=Ld<UR2z5zH1U9q|2JED#a{@WFH?u41JL)eIY>k{u
ziPa%va)o71M%5J5b&T>LBMh(wW^jVlx;XM;r*2>t-$;Ii1m|lgHO&(YNJRYMZ>B{z
zR(>2B@rH%Y02Wj2G7XWhnttfvDV{6Z(40}UA&28xX&rq#4?+Wt)4o=^^pflNLz<&N
zeU*M-WH_>Qi6#&RY{CQOvq3KgrIeEqM3%iY5K3U-N{3vaPEO&GU8ws67RtLXf_W&p
zLm@gxk7tQR%`#TYY~2&zR0kEz$q3D|q%j1a^H9QJIi`S5_uU<$%xoMBI^#BYJK;s?
z!g{K90AR)25pZLdvK3A3{$gLMh1X(NKRx;wDyrJFhzoj_^c(u*N`FBs?(*P>1^x+}
z07m;7SvE;BBfW0wSx({<qw9oRO1f8V<CnnO4l{<jrkoXXPbF%V0e5ubOvS^_Cy-VX
z73&1f@?Z0GnxMliyU#$H4fvZAtYOYYBnXAYk#dsIEQgW~@X;lPxm$Nj+?WBqA~K6i
z>tzLd*)Z><DMf>iN!kE==+}o2!*J&l$K6QWnqIEe8<yRG#TMO;8ypiF3pQ<`@a7XI
zBF8|Z=9OGh)hucGtSQ1C|I44B|A8N5W;cr&-0Azpw0}R#XG$*E>VL*Q06cMj{{j4W
z=h4G$`@itdz5Pdf|FZL7XLtYM!$-S&s@%@Qy@$L15^aCRF;sr$fV&w*|1$3>Zgak%
z+>+n_Nk8|IDTdg*X?k@%Q%q4k+EshfP~zz5LyYcTomdgzQK~4k5;D~*HBJ5s;JH_0
zB}GRA^ky3qLk_ujp&82BGyR~R31+*IA18qlA=WZ{Yk-g!iXrGzG<Yw~AY2i-!Upky
z`BYdIXoUh8`!OX_2L2cWG?9OwO!E)v08z#`TMi|z<BSA@bcRu!P-&dZbcXBF*bx1M
z2h|5_1X_lt35LgGxHAM#Vx9?FGPp5)h)LT(qRP1mNuy$S%z28<s2~V+6sKd1Cl3!r
zb!jb%429E1ghnHy;6Z)TXxOt)ni}MNWM5+0x%<EgBLcA!50hycj|#K;T9aT;M9=Sp
zp^MQ-6%*nniE3GHzQrv7Gdt+6u?=wC1M4hne)L-Bkij_zv#zSH#xRC-NwhpOQ1ndG
z55TpO)&_KC`EYgvN5DE%_*|0Oqp#`$pU)}At?*wBv-hUmi8`l87w?+qtw{a*?ELhH
z_F?NVdi9g~u@xPhp8a&*e*NYmdUJYw*gEe-&67j$!n`<dzq-6QRbQ+%JF4ay-Wc^;
z^W>+f_2b!jOYvc+=a3ouxUJe#9h^5$F50b5BWj;02Idf8gd^2PbaHwT9k<`MFI2IM
z(+2d*Ikml-(dkk2wsj7Ml8ff6_Hp~-C+za5eQ^Ta9jX4B(OL8SqJ40A+&quYF3-<S
zI|LY_=6BfcDCV^Nwsp9r#-RF*T0gW-E~3txrsBTb>7KqjX`RCaoVmWjwvOA)SH~^t
zPR;hPecn2_fN7b39jHZAgFIG*=d5+mhJUnvY^fPF&wpyDW|2&to^)FOeyPf--=o9k
z+vaOE$J&zBQ9E>SdER;p13x{2b~=}@Iv4GW%Zpa@`t<Y=mtDzMKeP{8ooCVUX$Kch
ziChiU$wd>ohgQ_8sh`!qUtM<EuztAcCl{^r^UJe~_UTDo?fE;kLTU|~s`eqS_2~)D
zSuNJ-`A^U;ECy~xBYO9yrM_2te!|ncIB&vobkqVKT-YU5uWCIntjR_vt=Grx*R7L-
z7W{e&4ZUl3T6NmIb_dF|sq=SD)$=7xA2&^njs9t!<pyqT)IN%uhd;Do@KhLDQ%9oH
z=HsKj?OYzb;ngR2#IOD}&HAIcqLpjx&UU?K;o4$CYQyV8Bp9HK2v`(y98A>Fw;6(n
zI`bZony)aw6uI0ZV*B-MHYuLozfbVxX?}l}PttyI-)@9mm!N;pIL4BfM!QMDA5O1|
z@D&B3dJ?t>q}IAhSQ1%QiA3~|`P9624j})O(+O?v2>gDUfzy!A@M-zxfN%IXo=iyT
zMCt8ssV5D*E9=+7<s+lXMUF9{HMR)S$Xxgv5JUKfXIfp!IyVk>#jiQ2sIR`-n1F6E
z1e;Fg#lB-00i)h}bNwl|_}dG(iS47GAZV*(&!f^;fzs+kx76vcsPX>=YQSwdd0kOq
z6sQ1pfr{cqsQp$|>FYr0H_gtQisF9_6#q+g>mLKf)kC33=3zyRBveC@wTsFc-v??y
z_~lvipjA<&6|RCWLq(NYc-LCZw-pt};Xb-=+nr8Dl|i5iIjWW_SjK#`Nk}#<5_Qf0
z^Uv67IGM-*(k3P!V@$0;#t=w#W%8VBOkrTt(68(&A!OmWU^-yvjbWaUn(%ZeeIU`0
zAT1MQVMr*7fF^v+NvEnSaPqMf9rZyu!M`BC3@|ALlN^MQK)+dL=R}!6_~lU5r9nu0
zE(8r!%pjWnK!qt#9bVKTl$i{ZCb6>9&<#|2*?$^(quXJ{iu${;)-*v}C2a?$qj7s+
zT2l`<cI8Hd1?m&!si^+{Ev*i8sG{;{dEc$7y2aAEK%*)uUoWlvm+GGXy0kLWuZsE~
zm)9q1R#87$WyciNsi;0%T3tNfgVhJt;rpth0imrGO?+>f2v<fbTT!{StTK|%ippbC
zStn7lh+Yyk&)SxZoinu~!P1Tc6WmhD9I7dx2;8J!`rf7=%(Wmp*kHqrA~1xdJ?N!~
zgo2gVvCKMka1i9{5VsUcMLM73x@wH;&>$I9xl~WGQBW=D8LOc*8_(h%yff`XaKe}-
zy240_n2OYDU2|xHFcC-r(ukH$)uNf;%l6DNX2IX;9}TXr{%IIFGA+wPhQ0LW!=HB_
z{9?>-fQ6^HNh_rlK0L6Alpu*1@&-?V(DSiyRNSgEV{ozD5@Q@bguUAdF~KOh+dQ~y
z<DncwR)a})m1a5-B<k_eDI3gGynn^KM~pwj8V;?Eg_R_bSMC_T&_+V_#cg?R#>z$m
zI0@_$?GWz`?g}41YXRLkYMfhqaV-E`=szD08*-PLo#vTi!~I$Ue`u|{@}PFPfp2kA
zbuT(X_8nMx^yHu?myNwNa&;*%moWTMw+7$Uef-<=LGNX^`}Dc`;$`$4OTLWC5|oT}
z*+@&I%@PW(5tN#Y9x$vmYZ!{+*yNUu@MyG4*Se<8Z-e3P)j#VEp#-I-C6HTv0q1N8
z@VD9Wl4>YV*Ba4YRY?rp#*%8pe()IIMZFQc1*fn6H!}rz)$LJC5a3P8wxhJTew!3U
ze3jJnm6n~gL%)*#^gJ0JfE$DqbghT7t5{j@D(@%l?&sK5esh-YDh<QiRp<(Lma+i;
z_uXXKfiJz&YN1x$<Wd3alzb+GT*>}39rU)YKTFg4v&8=MXz$Sj&;IjZe|P&&`_JFw
z6Sn_sKiS;f-r4=r2=u2B=uacipGKfRjX-}IfmSgB4Kv7b+3lVmzUscw$u;F~V<mcC
z%m!(`b^X#Z98KX1wi>-Ud>Y9QC>3T&AJ`~G0k4yI06_}SW3|=ExR|T1A%z;=UgP^q
zuKpU3Jq07tO?*qQ2GSvnIwlKHFYdor<N~ulOced=p(`ttq9{vH=)!QPXy0OoPMJJR
zU7dxFIvCLt9Ni(O43(S`tV$WoCAqx-WL*f{&fYFXz*7c0k~)j)e2Rn%7<X}(0}aP0
zM=FoZJo?Pt*nleIyny(Ks|;UIwLaXmNl!OSrw|B#OX)9BhMr6T5ufst;1J~9+}{4}
zNBl%DUW$kgez0#lukeZ8-j+(DM%kC{Xa%7gY-mRs`te88qWZdFH?Z>nYd55od(mUv
zTn0Itq`95#--x%2ex|h(1^X}1Y%>}{Y6JcS+s;&do;1Z>qe6n7MZ3YB=;!?hRSohl
zt2Mau+v%(C73rgOK*#f^^Z+5qev$##F%V6aRhyOi=|`NpJYDqR11T{vsG)*fPilR*
zAw1yJP_gA!?j*!Zz=>7#q`M)>ZROQF=Ho}`1^auHfpnHr;0GmMfd8l?3=?nAVN>@H
zjwq!}SFbm;^Z_Dgk-39u;c7zG+|tF_f7QM?R`h7w`F7_4f4$>;y|*i+KR$LV>_0HS
zxOLP#e^8Iep7Z4~7zNIwOGVW89{@4~UR$Icv1E}{E2>Q~ytKR$U=&J=_tAA+SoaBT
zh3r?6%o?mcRm^jSIW2iRt#Bqj3v?2ojE0=R?$ClHVc(Qv+~eeE^Pc)^3R|mY_Bh&>
zjaQSydlWI&wiu(r6?gWd9aC{<fAyN`!tI)xeEpW!JpRj3v=>=}<z)wItVo_VQXMrr
z7sr1Q%m3SWqR%{N2VsHWEwI1aQl<LSoKtT@o7fOY_IS407kQkFA<_=^7n7CHIp)Vh
zu|%At4O*wJ1WII>eoO|E&l_60;rjwxHI|c7I`tPnowZoC;GKN@1&l^&A$9_FTJVFF
z)>{Aa7y4<h{0mru)GrUhb-KIJLs)XG&(EmZL|i5c1TEy;Yat~(A2OUo`&GZFo*rS~
z1*wOTLQp>lYj5dWC-Jn9y+Y=F@ds`NqugMARcgPNz#kCU$L}>@ikx1wo&q<f*rh{e
zuHNCc!Z;hz<(c9GThVmTYZs&hx=`C)t1I^Q`1G9|yi@zo!FXL#UWAtiwxRo%_SxI!
z84UVKc-x@_ZU0W-V8DK<YsRNwCvZS;OHCVrgCgVL5`hDQ<M{W>_QCg9W+!lR$i{{x
z&zc9{ccPt#pKpCHz~qzy`9(7TS+lKM?X0ig)~p`YYBLB6+lFx886XTjLXb!L_KE&>
z=V850VGT@&k$6mCD~qTGuy%v{bbRQPs-6&pPxS&SG=L_Af7eUfeR_6qdZ<r*^YX`N
z_rW6~Y<%|P`NwpW0<#N7r>X|phw3`fXZOKlYT)?%GD<PhDjk<!Q?7V)-uic4@d;Nv
zx>WM9Vj|UHEni@+2xFCs54Wiztcn^h<qfQ=sD#?~Us|dpRNRR;Bn&`pK<fxvqV%sx
zbgkZisusv<jA^&uc2py~{1mi4PSPn&7YNYUO6b14Db<d=D{yZCT*qy0NlTs9u@YN(
zS`Vld^_Rh3aUW#hf+`241S-9>4|#6HxG_t{z@YNFu~iQBE^6@x%u<2POrKJ(D?V{f
zkK0aHV~h5dM(S2qawX6Qs@`$l@Fg`bvF0w-yv&Nb)IB;rZC)TVfH@)ZxO`yT3Wukc
zpmKOXdxH<wvWd~V`;aDvoQ7U?zSmn@TZ$-&U7P*?O3gwDdH3Y>1TN`z`4`36z;4%e
zo<HBNmw!GxZYrrAf8GiF+&Sz>?Oh^MWbDsLyq(OalboE8)R+l`GoRvf=M57g3Oh7R
z%@5kV)=91zQ8<Lqf~-iXmFDSD_Y5dMEICb#TY*)(uc1JZW)zVs9w`Pc9tSps8a!{Q
zcj%xAN)=v-sMH|5u$`Yy4l0IptX_`p;pG`Gm6=!*uBDX(m*i-KSCC2at|Q~mThF#1
zvC0-0g+|PLGM(Zks27Qud|)}RA$(L!)My_jfK(8}@;)jl{4L@0aem%yy*;}?1Dw8T
zl*9{~0pBTfKd7pVsvssQJmu_`HMWd|3lqfD<>u|GP18KuP+v46C-)9nqn}A}dERt!
z^AolN2u!9W#%F?9ZvLk<VV858fPipoECMo0Hb1M}TSM}_UJ+k|KsHnr^B4DBU6ET?
z?5?V(d**8HxS;5UYK2%lcYRdJSGVWMu(G%{tqnCVvN~E*v-lR%1bKqwZdZYlZUOeN
z5kTOEbOAZMRq-O#vzCM});M0p{r6W>fD~NXjCTz3&Pe^I=;ZzP$*iaVwLnV01xlmG
zjQXC^K3%9|jUdL8bO4C5*Xd}W{z-!a{e2gXWIS@aS!GlO;heckTV7VnB?l@wb$FHW
z0E9}@zg<FM{C-SV>^{k-0k5JgL{G0Yba<F&2}RCNv7zK+I)j5lHG8+AwfH`{MOd=4
zIGvWJhrQB2)f;c$5Mq1~$EUPb9aQNM$I+aB^o}!7%m#A~Z~&u?@yuTgOngcW5N4Wb
zg0_yTGm3;$)$wn!&bB|sP%*u$XfO9_oX0opu3AO$Hi|~Xb%^Q^j)y9Vcs6Oja(oSq
z1Y(*9-tbo_FcV+muMDFueXw^JdR(E-#s~jcP$lG;{5nJUvZ|W}H8x6B&eOb1MR^q#
z6N++8x)&?7;(j&go#m4`=+))R5YhSSUz2Q*4*!g3{+EFN$81!5*5KcNS>pe(v%UR5
z{oD8d*!wg7_wVwli2r@kV2k{5+$;X{>iE;E<4>=SKfOBs^y>J3(5oZpWnsPp2tNSg
z1D_1%hj;*_30*S&H64Oqh#Fe=^sIH#=^Wd>Ao(Q8iehvh;sqR+5dDk#U-$>bB!+*O
zDpD5yWs;2H2ct7-sf*CPIPP@SDY!U=e|-@9rmvg}747cmqC3lq?&_ku%Zl#lqI;y@
zyHs?rh=&?^i`2Wcu&RoxA#Ns>Eg!aynwQ5H)N;iLf2$ad8ZSiC{h_w&!gqg_d;~0f
z#dQe$BT9}37hTd6C=Okn5da1TglhGIbQM$D?aw|&1kwF0_%kAIIi<cT;9={d5CK-h
z<ZPPH@_s%l4lp*QW@EVm9I%Dsm^OS6c5Fo&u;Qf!U0;-fRcrH1$MtN?^7raAk`H<@
z8KndaHJc*DB>%hKh#)0hw9|;bb>P0SKWae@*g%}o?L5w}YRAW2b?r}(YOb{z*-Nd_
zrWw8qz(yAJa?&mxPeiWh1Wrl7lquu`hheFImH{Yj99<gf&*?8}FlrDVb^uS;jO4c$
z;VWRq63iu0YISSHcDr|Pd3VK@ckkTt9$^cI@3F0lU!nKCXM9KPdKHHPYi#W~=)uSu
zI)?;8wg8ZT!P&r<;Wj!|gj8L>Egz}Rz8ZEsHGDYyny<fn8%!^Dr&DZ@k1J3I*MMxs
z;3@*FHlB6Gey-#6*BktgE$g4V>&QOyUwiAHGEF@{>*{a>HC}clKk-pu8dKMi(Rk@}
z7ZQDG@%T(H3*yBmu%N)-$Fn$!N2>e5EdbOH3{G)@6ty9HNu~*q-b@H5I8;Wr3E9$^
zWMY>a+<q7T(p2^S2C~b15TdJ5-it@-^eFKIjFDQFh(@Y!7~VA~F;P~FM<dX2lIz(C
zF!U_Z0UBUIzMkyMNce%$$@55U)7G}}G>w>(klWHdxqSNy0Fk5Zk2|1LP@iM{TmkEG
zaQ@Sox-7@12j6$}OJuPo&hN4g698t72i@^}mV5*?9`g}hm|J0<7}O1_?~iH92Ru>K
z+m5x)7Akc?pKU)pL;g*TQ^;tk*D)-=({*%DTC<)7=m}DEnVHyx*=-eS*T#~QqjVSD
z!t=~4PJPy3+V$Zx>kpU)o?Cli;A|XBZzr=H)~BG7+?iIosuwroRh9YhM6Qxqm(NmH
zj!-R_umfzi`8dh5L|+F%hm?v+&Kyz>%dO}z&(>#vFEg9ww@NDg+J<5+qvO)>)K2iY
zviX=cLqH7N9eNS{bqw&m{Tc_jxre6?!O-+C8~fQjue=)m`|9otEN#s{8EPr51UfW$
z9&-^|%ksg+05iHIXs7q?2i`*5T1AlCFa&!`(W3xeJA}=E%P&`%Tt$&K%@kn($7&w`
zRzDj`6t7%wYN1xYFJHifyL~)N>I@XulBLP`T1pcbO3YM_I|o|Yn}U;?6pA)WU0IDH
z%Dhd7*axl<f)r?`YJk;ky?o&`Mn`aE8V7~FDOj7YSc2sZ?UWj_Cn4XpPudq`U#6V0
z&LK0b$6cEE&H15uaddkAz1OT}8NjFwrg?6&OH8Z2d(aC0jFyAoue9}aWzY;zLHv>Y
zcqFT?*%!lvpEpkqyOVr0syP`VDp(la_NUQNoQ^noL8AUU#k^}Km>{E6g%-Xpy$SAH
z4F4f8{~AH0%WXUuC2=;NI2RH|>j+Zza9Nh>BEpMX%0V>_h+&4hcs*!YY?Y2o;b4Dd
zxz1XZ1-As8{LD4M>>k7o3~I;iSD=#ft5B+|`}ftG6n{{ggd|MyGRNxRB%rl$t{Shi
zdr*mC6DrF7ss%g8zfW#4z(XS>v+HcE5qZ>^5b9ufF*G8N3c)MZyallj7z&+o)(bY6
z-GIHU!HEavvImzZpt!2huflWMoCu;Vzli26sgmImzU(TQ)RsQsySgtUN<k27Ns7f{
zE=DpIco|9BG3=z&(l{CSC$|_Hj;%Iy+a9M3>{Z<wA+J8=xQNx-D8Xw(&Ykt}!1}rp
zu;{ocx&nbdIBybgs;osSAVz$8tGHE0O<FGy@*T2etBvmEiY4dFH4x5#JTMUh`rG2)
ziIL?E*4hllbm$x(P~UV*lq|x3liC6^K6M2Z+fhr<pEL%I{$}lPKbg)jEi_`mVM>DU
zBGcODOSx^j+*9{w`Tkj{X?3_)X;~L@8<wxD+wJn{T%~a;8}0#rvrtmhbAdo95BGmD
zPX+CUtxCf3_=S)$K=D@p{;<2(9aHW?jkY00fZ3vaHbqTUZr~56XWf(2F4p|b{d>=P
zl=zp!(-Uy&?zGM?*d6TXy!jgR-JO+sT2MdqqScIe`)ydwVC4f`VU|?o*<Cv5eo7Zz
z=)_$){nPH9df)w&-gnJfRt#eAPJ`I{ltJuS8(JF0!RcGHLWy2!g;uR9-chkDgUD%W
zzD3vK6R-$%(e%_*9MF0DqV=2pwRv#RI=fK+{z0)t^ketc<<XIPexH?ESEMr?-kSE+
zdkvT*XRX%xZ`R*O&9-78k6_gBQ};j}cg;qY8kIB=_zWv{vPbO)p4h;MN|iC&1Snvr
zl^Q*|^~j+&w(eG1Q}vL}lGR)N`#MfDtU@hmT3g3F$TlYhtgy}IcC#9M1#&WeU8^^k
zu95$dl0E59CqqD(O*Pypx(iz)d>VaI!2i~)u}MExyH`1wZebV>r{+)nY?^*hjegI|
zM01u!quoAgAGa`|<gE4fAG!z=8Y>LXS_CuLyR1RYdADNgsf85Cf!_w{6!ImP2m%T_
zbU{F(kF85w)kXLh?BE}>x;nE=bkMYqT1~N+FyQ-YY>H#br?<T3cUfs?uIc0&aKu0g
zu&*<Hk3v;o>8R2w!d+-eTwShApy7qns5S~zOm3delByZfkCjuzU;p4dv5o4<QWuM6
zY(Fu~;H!2N<-}4??WxyYVbaKsT#uMGP8>Fyfw#Of=KIscj9;xVC#1<IiAhPMgmB0K
z1x!4|DT5rKL_UsT&@x3vVW0yT*$^`!ekC}~GqE$OPL^}>4p{SQOsV@r!2T&K_H~el
zUtzmXa<sTWl})5kCKc4zYpdNtr*9#dt9K31YoFM2O(4!djR48mSeH<M<``J6gX6Yh
zgfR=SVjVCH(5j(CKFDh5eLGDkVkCv6$QD(G&)1ct9WG@h>0P=MEq1JeortZ?$ldQ$
zV><NMSoJWZ1&h&qkkQ$+rXkJ13T?^?fge?ZI^5Nk+p~>_t?kwV=)$&sz%)Quadu~-
zSZ3j#Rw@Fq`aY`6MzIL&qClmaP!g$a+1Zktw{0l}DNLz%pX?S1x{r1HaUV1SAypR;
zV7pl2@yi{>Uw03h2X7#n@cakO1G{Y$1yOQr03O>i9d|oHtxBk+Sr>f#^LgO0b6enI
z6^%&QbkOaaWwn^!H6(ZHA$VA2U;2a<Iz2k7`>&%VuFz#ZZ=JMWpDMxQ;x3|2pl(1s
zb`LNluk6w}lt*@TsqLVB_C^URwCNBvr{o`S_hJn|B$`UQouogw20E74OY_n{Q71cf
z$JoAXFyKz61h&IB-OEm^UUAx02kKVG<Dx{sflZG#2G^|p8G<!uK~+W2rZ!1Ad;^u8
zM@?TuYShnlxEj;`O^6xshoYEUVrSL=XSts%+oyIG#e)xyTFE9|w8tI3p_Xej=my6I
zn*X;NANEIik#Na+Y0@iB7-l%slSaG0T1*<n*20P3ZJxI1hBRb6=?<>x2*F@|*#SPE
zMSfU)v-P}DY<Rlb=9h#CI*!Css)^lckxKOpMl0YhJBndT(s6TvHu$~5^r9c(iB3hG
z>pyQLA;8z%DxPD3iqwH~wOPkiA50(P^=sScQ^6)IH8rhjBJ#~qC?|M7IFr(UxCR7B
zr+GI41An(>>J}@Hle<x8ALS7v)O8PAuP$G|R;O8esepKJdU8U))Q00(19ErQqyPA-
zbP=!!IdVajr_ox3<-6S<n%(C4>rS`pyKGjpu3x#bH>RqA?mp28Ad-#Pm&kELx(0zr
zW4#l0@cnBFTBM||qj+Zd*uMj}CDpF$%amaH35=JfOu^tWS1``{fZPWF+3ZSPnGq5?
zXp5cs6C<`Yv~`DVy-{4eN2^*7d>#yh(qxhsDPe{2q;wm4q=Xfh!W<_Pbk?%QImi*x
z2~9!8Q$+LvG@<ti<-ol$S<!W;xH#zewCfdppXE1@cBg+G$<j$W4n+l${#?!RhN0^?
zs)2yehk*IE6)E8rVe1-jI&Tsiz8$mvP6@8cTP$vgAn#_hLJZRdD~KxxV~=sco!Kjj
zesx8m9^4AGEu+WW*aAj?$ZYsH=@lR^E(nZ;%aCOAF;k;=O=QEGhw9GmG|X41CjRR8
z=v|!6+NW?npM7N?>@J>cOpgq;yQWf9a^rT3lLFfGTXN-giys{d%94BpgF$A)N#c<N
zne_JB6enNwjZ-nFmtp!BZ4|}GvQNREU5k{0s_F#%yd3YmZl=Cc6vpe<IH*}&vzd{U
z5&UJ%*bTezM9K5u=^Y%pTOx?~wy9?)NVv^w<F{ndW;~GY%5A{E!I!G<_)@v0glT|p
z)Kj;GXbUf*Z-t22zYPa=q6GX>EioJRz^GRu-!*$Ub*zKL+#ltEtgGXEA*!svqVLp2
zNp+OW`V?CQ!K+G!7dHUHi$F^<B8MSZ9$js#_xp~!-5gULtF9>1b7(;=<1jADC@zpO
z%W})%eMmFM^`RqJkN!#zo%gl3nDnjX0QYc5@?NjP7kcd|DH5xD)_t{A-b<q4JH_`e
zE);c75#9s*WhtE+z~&_r_->vJlIiFc!S#S+qC|5OaK5qfxbXv#QgSwG80cdA{;6tV
zmX2@)O>DGQk8a{Za;<azx-|QczfT6<rfrTCIUMm|gmOy12S~OH@gAF#J3{t4nRRC9
z@`ERWl>gK&uFAk_AA6=T1H7rEtA}%vkd88Ze4D&FaEy^UG5i9%<)R`@PEW;EEuFY}
z@bquj0~d2RaKFUyg3Be4;Lb(!LM(`o@y*sU%9*hlTkj&^!8cs%f-cmNJUzF)k*eu{
z#okg@JaB|6FBNtOZY5>K<5Ne>04ijgK4o5x0TcjxN<t-kLYdM09#1i#t$F+j{epFM
zm40=CH2`e$y8j8H9^+AwE7^54+AI`*qv)FDczdVOtZW9Z7_B9lK!3x5-IqC;mV5%m
z=+<`e<d_P+cT&Z(VUucgQ!w|8;CwLm5K~5)<2;{48_9?PB?jWsMNj5oJd5d<v0~Qh
z#Hyc7bAU=_*M53=fLoX*{lo;!^6P?l{g-%2u)<ADky7y(0e>;ZK#8H0R8G;mEw8+p
z;Cf-x7sBULi#+0Q0Sp!4jwot8I+t{IS!5nL!ZuO=*oOM*B^u7BsQA|L1F1$j9yktE
zum(gyRcqAt0ca6J^hv0hI$MBi(Xe>RXag3&b(-X2B^?KP+|digtb=*NtP`Xgu&ts@
zCb+t<Il(&%4I&Y;SXuYJ!UxBzx;JH>mCEoT*nYOO6X1WB^Z`Xav5U@6orC7_ak+ya
z3xfYG_jG5Lq}-9so=|V!MSoS-ZZMzJd~IO#)Kf~z$0K*}5t3IbE3jQ(`!o(di(jaU
z?kuenFFjAnA!%k;#5-6-Qne|Z@G5vetPA1X2PQOX-Qq-XA^_Ax=^w?;miQ#oc@^!p
za6909R2)1EW`VxGjhZby+2B&7xSr%N87bPN`wn;AaB4j(HT|{KICPH1pmkz_R%u<T
zHA<T$ACI(C3oAU=RTth}6FuxZt%<I+cun-u-EB>z+Gkyp;Ju<TGz<0LndTz{4g9Xp
zK3%khC;tx|bg2dk60`<@&XEhCaX>U9fHX@#NOs1B>IlDSQnQ%0@$Z!z_f#XcrN;~$
zOx3~bq1X76uF1l!$Mfe5Vc7^i>BzgYrM2{?Yfk<rO;_K56{oAmuxtpQME1(OCXHqh
z@z?C6bs44*Kng#L9twYP^~q~KCtH827}gix3>w4|;=iC_{Kpjk{|5gb&#L;@noBl@
zgN7@iQT0anUU4j7qvB@B&n|;vu8JHEP(?ss$5fON-W%o&sPvdw0wnyibpS%@(^8+B
z{Sc8J6%51x1Z0K)tv0Rr%%ho?$57eZS5;xTAPk>i*tR~_3keWuPwSyU!)HYyEIfRj
z`a9HRx#I63E|xiY-UCOl3r!YkglwPk@faziSqrXQNPwX`iTCeY<e#d#q6v8H9o5Eq
z&%Uax1}<_)AFk6GLgZgMPi2EG6JVr3b<#Cv9IyIpfUV&M^l<h{)^QXBO_g%Kgi)Tq
z2QRxQpHCOHcYgn!sK<(}1qI8@wOJSw$?Jc94=;>P_R3v@5)8t9v>vUZySrT_96;4|
zTGAX-m{vd@bI-OnL(-PTqmdBm0Ld|z4#@_uzLktNG)B8<$(sW{A!awE)^jPQxt64K
zsl1iTZsbb0@sHoc&v%_Z=T%zi8daR>#dIZHBYfckm+ez7+Gl#N?tZ!cS+0^EzPU>7
z^wHX<1}?HnEht%n2T6e00!P`>V%CE4I&ijkkx2Y2EyEPKr?QtI+qZO}&Q$Ltm-!E>
zc9Iy~f}vcj_5!eik;K|&U(6aBq!9)Tzq;ex;KIPdK~{td21uC~$#6b`fZ-w^BVIFl
zPcVF9s2z+lpMH>`Ow{<$8Q{O>$@Df#$KzxG1~T<^JOrKZg!IQ8DeJd}wLI#v;TL+7
z-$0x!Tn`TKYM!6BTjz*2lxX`Uar25|Me)QqBd3MmoGJ#RnHS=BffE7ngygA`ilL`r
zI!&C_q~$BMG?X-UvL}$eDJtfQ9>;iz(90psRGS7g#HW@U{%#NiHkbr~9>-aqn!!g#
zh74{Zelxrdgh$dDCCNk)_iIJU8__6zpG3prHbc*1H8`|SLSv~~G`}H6G{N1)jmx#a
z*_KZ~5!;L=Xw(RD=Kb@|8}}?g_P7nWdO}C4Wf5-wMf86cUjK^ccx4Lf5UDVQ{k?Q;
zkHTlCyl^0QX<Bsmxq1}jkIvO4bgNFbjs8LCw1vqXorB&m_sFAJ86+*VKlWYH>y~Fp
zaMk|D9F;cuo1-yHkhj3&ps@sc>n2%O%Nm!+(G=1I=EVHKzy+NETX9^eK=mR1VsN<!
ziuEfshqqp!!eo5DbA*ATVRlPBM7KBbZE)klTJo^q4=gHoYH{e%%WCP^GTWCtnHGt;
zP^dW=fDhC~oQ`UC<)A{@{#5kGfGWr8xpmsBXsN6`_}w7>-Em4#;4m4%bOKWeHMB?z
z5}H}qgtbse3?kXVC#a1to6|jQJ8#ODvwgb=Cy9uL{I}K|RrsrzCUr4eQA(79ZS3A0
z;5Sf&qC3CeboUedWT2WIfe~_RfxG6~JWF0J<k41w%L&>~O~cD9sbvf5f*uy$fIo8T
zS2^iC8VxDC)z>@Jb#^f&&wALzrqM6RhIDD~5A;`p3~)5h`s}-9q>a07HvVZWJX1uz
zbr(^j)33uGP#QXiJ<OqUl@1$Rai*9kmVM47PA)8Tx|7rXkkz^vJ@SweW}))s)0Hj@
zRTDJlcgZ>?8J;GXUdMmuoIn8iGN>}Ro7SPcFLW%e!@0Wt;WH>2tQjuUGJNF>9;yWI
z%7LXKcSxR#ZK*gFPT~RpvhHuiwBM!QE3Ox}{pt5BOiaU9>g4pKb;sM(M#NLqQpb;r
zU?4&(QpX}h*2<~Xq7|UkF)LD<`imDdD1V4D7P>URs4I~=<NOiEbCufzKUlmDDG!|v
z=7#S_t65lL|BZ7hmcGB@8F>dHO7#h$=X`(<Ib)5%9|-gHsatK4(uQ%0S?K`iD_4Re
z3mgHL7~bfKvdM}jrDyYpX=BZJnyp4AeL4xPP}`OxSADVNY@xs!X7KD1Vt8ydUpLz)
zLE>oRCkII`3|mkAh2>24m)7~I8r8++`AJB}2cKHFCcB}b-JiX@7THikwE6h76SBI5
zz2H7Y`&?lu3alFT5Pn^_G%^*z>v^8UgV61yd#M96)wNXr{#>`x{PB0Yol}`7UrwBv
zOzGKwyPHXh@Woeip)w?VHUEk3X5GG={}0_wn>pe;`Z__KgmDi2QsSk^g4$)=`Tm(b
zYK^U9(UMLw!`EK;Q-3s-JRW3G=6sg%bebA2k4E5n@w~v|=E_PHPcqb(rc#{^Wt~(B
zzV2~hP49wLEVCa0%xsdoXh4HMY0cbaa$KS8Rr*6ib)fB&*(-((zhDHBu>Y8qb(bMT
zc%*U0P1IaREv=k^0-c1i@k0B4u}0*Al0f<Mr2k=+^4@Ib*^2YA2Y-@he{lTUE027;
zN=G4s{zUn!a(DjNoBqiXR!Nj%k)<c8Be?HH0##4L*;h+edbZ2tC_NBQB2t3Ymf{Bz
zG+@pr5c00J8eqgeNaGUk%xZrTt;pSDoWvOg<rripsR!s{Xawj1=F%{q_CYNV(K2Y5
z)vEaw-QxmBo35t04tf=9i=5udz#gl=i)BHY9>CzuvsskYl_C}7O7i>)k-g3O)q*I&
zUSr}Vu0|-@pYNWmx+Su~#LA9^d9;GwDzR1T&TXucNoke_7)nmlr*yS+7sCurU~8&`
zkpE^o<F2hQQTR*yd6(xn&Hhn`7gvbe&e&CGd-av0a;o~~Cbgw#;V7vQ=DS5zU?P1>
zL=k(Ux6a@88#`gJAsL&`eiIDM$8;7lW#M}T55oF?Wb1y5u&xpOw7u@RBtiIqL@8|4
zR53uR!&auM74uD?ZfH0m5d=EFcMl9x&sG~04(Q&!&@Aoc|NSfI{OQs&3cvFa#g;30
z5ha{}Xk0CqFbsly--KubRYz!FglG7@0)0kJmRj11Z7INyt>7YL)p+5WbNEN$BlNG_
zAOGz05T=~RaB+Dn#D_I0{DU2!BPviC0$8A|0l=U96VPE_)Co&gRt1mg4+<4r91|#U
zG(c_@w#7?nSy7#?Hw*oS+GX4&5Mt$*fOJshQb5wIp)p#Ad#t|t{n=LnqxvQ;&dA&c
zM%tPkq5HLCuJ`$mZRaqfi9gA%X4kHfAG{Q_a0W2o<O3J#63Vy1^JSDi(_auA%Sfll
zATUg5A{mHhL7-dHz<F|$W&_s{`t2yK+f=hQ%DAl)K;?p;9qmX3ahLJ^071yA4NFTK
zG;^1O1b?@eP|vFjTrx=j^2tIr(+Q6N2SN3q@kTS35r%+pYvkY=$-SjB%#8vVdz(oH
z@!<nVlftpzgTgv8XR7xDhz9(8S`s;8_~+(JIHj8}<-D>fS<5&=%peHQ2BUD4CfMYU
z54WFCCJrlb92U<;gD;u($pokhgqnQSK8-edDX8?+KM}+R{#$g%$+%XxTEH@7>cfEo
zcp(uU^-C8<21N+p-8o%SS?64X_R(8FeQTX5XKZwOgss;?DRiY?GCuyAS%I%9eGIe>
zi=sx~MPz*()3;nt#2nau0K1zc;|MdUs%b;k87|h42D!X9VEa%@GlbBF4{{_~&p6#r
zb;7d+sh12zIk-CxH2bbtKZL~||45fWh@znKE?n&{;4i*&jieW{i@NLVXb!8%x)Zp*
zoFqHN?@AP079})RhR6Gt|Dhi|kDCR0aNaMb{rmlCe`kNI|2g}B1YG<358%H$j~;H@
z|Al{UKYaA?Uv?hs?Cw8&_-J=emD_pn=;8jqMBATp5LKVKn)@`0{$<{qXS4Z&a!Y>y
zC;f!7yQ_B{L8$V{?KHi*o<+NAmo|6RPDQVie0r4>(c2_Tlc;ucbF(#ue{QL->wcx3
zZK$*xb>h*77}3i*v7%(7bTY}KT0Dpmg-gjq=WqzsB}A9iVs<-9DAWCD6k%Hc`$Ac3
z1t1G+%%*8?u6YIk$x5@R$mi2O<=%pvzf%P38UuPGpxNYvYNLc5Xl1N=95P$dK+N+=
zG99Ng7?xxNlMJ<qYG*XcZ&)iiNC~?VDvc8msx}x3u{62@9CCSBh{b~-?TXIC903sb
z@(=J6ubi|KA&?_P6Cezwl?7OL&Osz*WUAl(C|2SeLWxxjM|Ep0jSNRkcra(rkuNeL
z4tOw)4f6h6ot~M_7<^xCPmYj3WAzwK(|A;veZc*Lw(ZGSvph){CLb^-<8cBbgMVLU
zDQ4Q7VdTp}JWAE9vovl*uafEeWR%>hSxw!ML4Dk|bcXK<^_Ncz3AI7q7Nq%XpuR;Y
zel^fBWHhFAoE6qQ)l@X}60Tg44`(-Uboej|Gu($%GmL9GQ@ju!M+8ULh;(n-ov3qq
zbn&iv-ip+}&(2SOXdku?qgOwvA6wCR>osKeikc^fz?oj0w_jaeoSt{0|NPHpM^#u~
z$Df)fKS6V?A2G*Mbb21O-<}<}RXeKT^XAD#8(_NHCkMxuhlseWT8U0hFQVi2+xCSj
zc5&Lk{<s=Krs|r}=~48yb$;+h{n>ogK5k$9guNcMFHWGlBh_CsLe=8I<#F>oI=ehS
zJMFY0H7RK6u-!R0ZnodH4!6`8RKHQ{2Q{mx^9Fo37Ebe3OAQgk7wUwjdDuR09bCYC
z%)buQs;SW(H=@p2>!1z)X#LnyvuU3H)PMz1&30P<eyIwnAEU$O+ve+52U@EwSr)Y=
z2bbq9$g&0t(YbupxoBTpUbLdur>BRw*Z}<AK4<|n<wkUT+QAi5{8K~qbJ4`^RV!+_
zI?v$WuP!@nT)6hhMeF?h5)s_$(VNqEYF*Swo4|U(T3}-C6PPxv(&_n6&@QY8?m;7Z
z_ok)3KZixdRcpdpbkyn{T-e1_mufLD+{s2Kt=Grx*8o!w1x}%%ckNEAu6C^r81m36
z^!%==y1m4?!&a%W(LdX`dUALhxTjJ3C~6-5(1!7Id36vvZ9X)(d<SoM^*Q}Fpg^7<
z?CeK~I&4vpem|cMI0EY6pnY+nQw$e!e=zBI?>73kSP7)l<gZV4^6|Jon`8VQ5RD%}
z1^yPgiBv!F=qgt?@_O7bNhF~$L*+DRS|KmN36P-h=V`P??XNKq9s~ntAnLCDMZRBC
zU2pE}-)|nAo}a7{bn-wEz={UdAbTm&>9br-p|aTa?oL#@5SUDv@yGw8>feL^?BahO
zs{h}?C%Elqb$43>?u{Pf;Ruvw?QEh*S?_k1ScQ&aG_;#ir}G&UgQX3W`VoQPFpdtR
z=W<ipbjVGBZeeXlaf}c5A3c7u#!c<*9PH6Kar`RgN|M;w2lYBIxQgG!>^h=g-2Mn{
zHy~l`?vDD;?)HOS^`E`%{XO-c2iuPysQ*0NjvuQ3>~Ht?)qfssCyyFj`SH&7WA)XO
zo!uwuKk?3kSpBEBv)@zy>F+%5tN#pk;(_{4vZJ2Q?T^EqWGI!@44_NZF$`dD_Yrit
zyZaCZ@Nl;WT|U@-0t0xoJA4EK*d6Rk<tKZ4(B<R39T-4w?-6tv?>&S84EB1^Wq<Dp
z3}Co79Krzh28mSOeXx(SeDDCeR8z(kc(4t_*?*AWEFbit%Lfl)T!9CVA4=u;;Xcmt
z;RERM@xxtQfrr~LoaAAGvwYZxF8dE-T!Dv=2U2-&{~^wD{}BveXMYD*V1Ew=@MwR4
zv)muT03Pl?!4=r=J&?-1M-Oq9j~>AQo;=#Y6?n7<0~kIU;4B{vVE}_iPjCeu_4-oz
z!Q(#8<Z*&~`S>x;@^K7Zs%^#<c)X8i;PE!D&g0!Zsoa0k$C*4ya4(-c##ugzq07fl
z9^eW**~c^RWE)rK$!<?7Ka7VslX!r88TW9O@e>%pPW%X0AbyBvAl}2(iFbCT@}M`w
zne+y@m%Sd&viAfA@TB($SD^P0&p>YvSEsiVOXdB3jI-=N#=Yz(xB~q?3}?5$i?i%+
z;~D7h;|la2>`3Kg5aTQdk8v*t39i7P55tKEyEx0iHlBgOKCZyv!4s+cD0zajOnSJN
z$pBX%8NvYek{z67vWI6Nd59~JJldAZ!{HO0<*<i)IUL{$42Lj)-f#zJIo!iDFnowB
zFnsh_UyPl{Fqp?X@e{m@{TOd%(!;yB-N&1`JHWg6Ai<ltZ?5F_V_1gm?RW>NKz|o$
zLb8WcVEX~mgx!Zo1s?1pP1rZYV6O*VKG}Qn81Le+hc|N&<6Ybv;LY6W<6V3-#GCn0
zU&-y=9(1V)$u?4f;U3b2!7fsPy@yB>b{-%Vc=QNq!b43AdJhwv<->jt?_!KA@bK{y
zyo>ud%ZCq!co%nZ1s-mjEBPS7Sw86RAr**m1s*)!K`OA1vwZO25mJF&T!9DMh8R2=
z;4B{vW4wz`a0MRq9^+knh_ih3D8ak9gDdc8PhZL1{Q=H$f4GZO;0dn4es3G8z(btn
z{-b@Q0z0?@`+J%g44yo|nLOFYy?nBbvwX5U#JkwX6?l^18F=y-SLaD=uH@qfIFrZw
zxR;N&ah8vFA0ZX!;|e@Z@C-bDjH~lFHpHO!2xroJh<n-F!&&xr61<B;T!G#I&p@w-
ztJ8a;ujGUH5zZujh<h3D;Vk2weWU_IT!DCiXCUt3>cmepF&GYZah8K^+{?i}uE5~I
z0PkXqvm89eGcZVS1qOX{CHuQL%l<a*Wq%)6p#R_@Qh^v}*?){@pr7Ch^!tVw40mvr
z!#&)~;X_=3;iEp@#V0t+VGqy1aDXc?9O^5%pX}f)lReza<RPv=^5_9lfhRc2q=#o9
z8Q=;e!)>$!xsP|v(I!j&bIU`SjFj_iCV@+KedEOo{6me);kQyLdJe7WKkwZ$h9&q=
zBQ^D(=g%M4qyJ-AiW+?R@+E!=BU3fM1u}AU^oyfiRHZ<<_>Wfp{7XRp*Gu!Q>(ATA
zV*TItgT397{%?P0_fP%b-{a$}`fB|;sQaFv=B^P|-92a72@r>_#&J4|1`xuYk6-@N
zYVH20&Q26#qV)L#8oSS^ultPJy3ePp3v22~1<Z=L)%0(Atrx1{R?xmlL!VCxcW`?4
z(|P;#n~Uhp>G5IfJfNpqLv0*N_N<Tl<H|Uc*h@7(RT+mvQ}bJ{j5E_ceRtA2XXTl#
zlS4I^qn7(5ogC7tkXr7JIyuxsEmF(fK_`cczC<mzqE3#dw@fX!icXF;Z$-7-Qk@(s
zmX@jI{xuzDkO8UN1zY<Yok2<d)+v(EUOtNddW#16?l9xLq4D&p`1u!3WYGEuuG{L~
zHqYA7JQh*Ri7~!E`)ZyQ=~b2tTrUDP694bKSDX&fLk*3{>K~O=-o@#xGfO7r^5D$~
zA#iDaI#QHGHCiqsL;F4*jV`Xi?WvFv%1>loN1rd%1l!h2zaN3$)PmoS)tVitC4(aN
z`bGR-VuaN)c9C<X1aGvQuj2mutEu{S5dE6>qI?3cS^*0y+XS10@l#z)=m{J<I6)jj
zp3^C$mO%uC-Fj5q77&ZR<yUT=9(9j8Kb??XZ^x;uej_}qQmy0WUw-Nyowu;ZXxFKg
z_kK-)gv0dIj+W}4T)yp|o^_Zl-}@hLtp5U^68}H?>#*DZd)ohZ6}SJu<NqJ-sQ>)Q
z|Nk9675x7;nfu?yO4MzRl8-T@%8HJY>v5cA(et8zJ<g|-f8+md4U(6ijm6je{U)^c
zIhp*Ot>`ne`Jc|{QwzI+5&aLd&acETLt-e!zLZSV0hZV`G~dNUU1o{#gng2c+F^=`
zD@Jp=#~AaxN;c``%r6aXRjc$e_80lLJ6NTcu)k=7yMtAF5&Mh#c_*v%LiQKe?ap@T
zY6cjmx{6(zR3GYIWa`3vNJh5}Ns%>!)FI@Jl2U$Z$BP8B5Mo(Xc?<=S?y0|DpIk<-
zlPsCWqv&kj8!5^3Sl#bT(bL-6>$BsvdW4=W>U!=*m?iQS(??F_>jtGC<QPOm2}VzC
zxU_|kKkVu37|A6gu>zW-U`w0fAlcah6vW$nt}c9WjbKthO7M4}^Ev*g2jI*abM|JV
z+rW&?AQXjyP)OY{5*&nnh30P&;Cdt2yw&Wh&Y>cIxKh9p56B-K2R2Y5e!=Mxd$;P(
zQ8E+YMQdG%#F8ueWE2zO9UCe~l$H`o4wx!h)g?<Abiq^83pdDdhS+l=B-ih{f%((=
z=>$`M!*P-6FPJ+tWT{qQ6<D7F{fm$${(g$lJ40_j;i%tq+J9+9wVmks^QiXb`1EzX
zF0O!sJX@bdY9VfA2>|{!8$qTym{Tvw6ekc*-+wKK1^l-00gH9&%s~PH4lo~%0Jx6T
z5rSZKtsN?T8;$YVEfTf(>RpMmE44Jg!jsrbMrrZ^UU)j?v*;$DzAvI@b)2XOqethR
zi?9AQ;wi#kwMjjy)oPQUw|}X_R3F!)-=fLSJHOOTxs%q97qt%!D*3@Kwu{BmVRU({
z=v4QpiOoyB_Ti7UYpfKxt{N|2Mzy_-$I)g)3#<O23e=--)k@>CZ$>+HXj#o_7%A%c
z(;sSj<6*FA$Oay0uy!5&pGf_mn&m@PfAt1Y*kYNB4vK1&_o0{cW90mB|33iQbdiqJ
zkz%$HsdPLa%~HmF{y@9lh?1=<JO?nOjp*T{z1^MiaJ+Hwu~CE%C?95jE%Hd+KXto?
zae=2TOK#L}2WOX@;JTlWCsT-HDP&NiTOr~)XLYU?$!+c`&j;YL(^I!BDu6uUX#<Gc
zS-sZJ3pMO-(Qpl)y82}&*{^HuNVE--c&?Z>#ovvh(O*AoBG9vQ;u~sZ6tTWReI_w%
z^8!0d5DdS3mf<AR-l=VbgB(7`bd0&su2o1MgzNGib8dJc5&U`E{IRQ^LHUzNhH5%g
z?)2!$Ew{55EO*{A<*1;#ard~+9*`nf!ERSQiU-|p^zwz0_w^JgNo7s_XWF22i~4$W
zyS;g;j#}2GLaKErR&Ug(pmpohY-A0}`Or@k9I{fk)X7S1lbcd$t*P<u5Im!(waA?T
z1mkQ2R)k+=Hl0h2aFrcR*!4viFtO%Kpd`R!_(ac-@9n&VQ9e^I>I_(sMx?%av9q<c
zw-@F8Swfz!s%#FQDCdu=0Ei`1MT5EgBQD;Ea{A)I_LF_}j17wfWtg3v9jbZEpKx1`
z7dJz<O{@9T&HM^g8a&a6jmHcoi~m+<gAm*7TJY^CQ7qK|qFtg2N<Iyhg|Ag%Jfg>c
zITD!8^VeUwTir0fM%S~rC!6k;s(<x2Z0T#iDYx=7Q=47f9!DGL1WnWW?>bM;glNIH
zIhMlTWk%23X4G|2v`3Xv4c_Cm@Y+xnq0EaYha$WLZZm4fFa!w5-f$>v5rp(%%;yax
zj8C$Beub>$bv_!XpRSnYo#ZJR<JA<0$y9L|2_g`xN2YTc9Vnh8DS#^>G;`1d)Hqaq
zETTFgYGCs~Nhh-@wAGy<8%k}_V+Ec7rketp9LSm-fww0>o1-GKz6A&%_#VVXp@d`V
zHp{80EC(OVXo3%s;&7(%q}Yl&slYKJ@2hyI8OrsNtGuU}M^!c3RN_VZM`{TMJB-s2
z^1a1;0-A6ti2Y7jQ2^u229QT){{eK}pj;5@MTw~$G-#=ngh|Gv{KYf{Gg?UGl9)gZ
zqT0Lm$=)u4Z|SePZ@WM4KLGCsecZchQ&e|qJD<U}dQGFDOtI5A8Kf?w6fz=UXAHUI
zs^Fm^bC8`|b**SBoG0||NC{_#lMi5|AVe_ov8#KbU^uh(N&BMvM#=W-$8j<S=$0B>
zoCeT9I4g>U#xEd5Qphhv<Py@GI@kB^;UqytIE$w93~5V*15-ud1y*nW1OwnON*Df$
zo=1FpHltk{m&8%R{e9CpR<ilVwR+KK8uNe~gy&j~=mQX0ZWe!qvVbtBhN^BF@K{(#
z7XZTeg4<LDbT{2s?WPjuH>3eIxK00883HWqPHEZXqYedh@*JADZ}CX8q+kFW<30@s
zun*ECODKT0H`8v`LriHx=fR_Wkc0)u1P>HC1U5wV%8W#LKrfk!F_kM7P>c=)yr#tQ
zsL7F5q1!xezdrH0u0i>oUo^81e}atg0`ktJ6Z@wWr3ZbYtyVT_^PPP)Al#A{`p<OY
zPuI8<+29XqZPg>J_`e}uDMccHhTgm9!WKKXgkolQpH=-njz3ZneJXKv9eN&_Qv8pX
znkoBE|LZCL=%5M0xv^OlwT18;?12k8aB2KZD860IjbNN&IRx-fB-0Nh0pL*zWFg35
zv|q!e477^3GXWJR;njXr#}JR(6b@jhNry_9FI6u;Z{pQgNA4F4oX3Ci{Z~Kp^>?al
zzQB=TA+=vQ7E*&AVYojW_rE67oT-L<(CzHmGuNlg2O+eU71%jQ5X$?qvtO@!h0E39
zqlyFlB5=!L^t1Z=7hnL@_T#_np)}V26jlHEM*Qbw|D5d7s-^UJgS=FR8uz|t-UH~v
zb0OgT{$c0z0%G5#B@T?m83(kr3GWNgIQRp#c{kC&k`x9s(j|*2a83RTK|_1AnC5K&
z!v%r~Faa-LvH}3Bg5shITGhkyT)pKedK7Be6vw$oj~1+slteDpUbUq>q*<=$9`&T2
zwk0pCD*N(<&0V_dDR<~!9rYxz$wr}QN^fqalV_yM)ITHguBF*5m-czKGAmsEv4X9|
z65us$7}{T|m{fbc@OZ5{?k_h4qyKbIUy5u&XhXg0>>twQL;bYjnjzcY*!RcKkIl{c
zGoMqHlFmFmrWJIhV{j8@B@smd-mpO(Ow}Hd2yu-zx9E&D$g!!O;A+VY+z8Sgw-3CP
zFGPJ=UrdcYfg|K$ExP&PEwIp`ndJpu_oc(;#^4#D7IP2RwooEg2Ko(=xUZ9G;^k(b
z^(qUdu28yg9q+J)_WFIo+O4>5)=Dkx1Sq7gdRI=J*AFERUrVOC{zv=le9li9|7A4C
zoTH!718kxH*Q34d-Ln7J!`+8}`hWdBKKI#WD>|Tk_hRbBDE4Q7$e#fse+G#B86fg!
zfXJT#B7Y!2q>MFYz7xj7`4S|NI8zt=1Gy^656_F+;y&0Ai>>RI-q!@c?|vUoC-MC>
z^S>VUv)Rb~YMv>IGzhe+C|mhkaK3WCRmAQZz5!Q{W^^^mdrBIbCTv;+S~R{blF<-Y
zPC)O)jErcsqh|!3QUrlVYWSAQ#-p3~wjhgWp>w(`CXLo?^Ch*}5UV2l9@4J>|4NQ6
zF+B_F(Zy!2k)RGJYqM22+TbDTq=3$keU4?(U)3lQ8=3;T%o$rDnTkZPaD7hOTXUM@
z?4C|JgrStgC`%H;Dq8$u;HHChTU(T5#VZQ=JI*kLG5vj<X78hok@|mX-46J%svJQc
zVs{ZLN~u?P+MLg>+ryJ2Q4e8xDH>AcZE*$0pZ}UCh!t$Nc1dYnAVq=%8ez!0Y3p?|
z>x}Z*t90h|K=S~5psIvune_APB!d#gVN&#`DO#8*3MmDjR;s1m)GpehRaN&y@M`7x
z`}yRA6AI`EeO?Z4gz7AGM)3#lFpSYK)QFrf3n=HdfVK05le0=6CL=6e`76|i5=HQ6
zdL!?ww6^Z<&)(w1yb4}1I;6NNa#ox;vU0Jv>D4sWdo_+fc5$r=9&|6AjpNCMIzTX3
zZ50$4UieY6!}wSAFn^UOW>R&NB$Hazg@$8IhcR?xDz7<EAhjadJRU8YD2B@^X@Pbo
zP@t0_wso^uWpyRpuv2J|jCf#h7c_CSh}#iNyM{L<Z5SX4S&ccmLv&~69;u0aY)$h1
zb>M2gnvW+0`HLmq5qo(6X3(sdyK_`h%zTtU=BERpWBml744vBrd1#VpHyzO6a4b|+
zfA_dcluL30c?V$<-;VN_%kJ%V2}<Lc@kBd6_~F&%Q5XFJj@9eGv%UMk{}J>-iaAvb
z-|0bA+j;(ccN?`<J8xeJX4~fH{FK4T;G56az6|<Ut&IJcMg+!8!ooT{|3Kc>h4F8b
zD?9pRgM$)!AtfJCvYLvPX_J*sHGF|VV7ZPblOz+LS!n3yTK#>KM38=fJ<b(%hCBvC
zY#n`l=p~L~r&UnJ4h^7X0jz}*lq9243Nn)!TRehz)ms{4y+Ij!V4$P}Bhg%@)n^!M
zlJRb0B{Qn!F``q#Lj!PXrwv$5>l(nK(ly{$Q`S)cTrdK4V+dYq!(6RQO$s#DrfUKK
zPU+%-FN=yEeMhZ<r=`i;0`@S-HxT`5B|d_t1<Kq-Ip^GnFQV4TsgecC8K;AJokM9n
zh(|lluWHA~UBx_~fb3B+=&iwGNCbi$GR$XgpR{j^r|N%e<?4E2U_B@UCTC7`)%}q9
zqqbvx=_DisM8)ewowU?CzwT*$3cnS(vjE76DpC@UsM!rTl;n?>N0dau92=d-3fCXD
zjdnFxn^A9kTlCO7b#n)7IYn=)n03KL3wFZE_cEk7<e_aD31yp-d7Z^m4tqgfod6(_
z6=vT)I2<|##lPjS4*fWj>GcxT7kW9N?^=v0y>266{?#uggaP;f-7d1((#i#1d&~&N
z$|CUg##gvVd)Olcu3X281?T#t{h%h%-KwW^H}jJf+5U=j;JG~*AE@;d;|Avpz4VZ6
zK(J*+K-AgErL|dpm7wm$3UwKPkGPD4-W$k#hL4d<O3w{W1bF=oZ{aXN5Dy05z?*ST
z$)p`62Y10t)!EqDeaxne2`1FY5`9GY&Z_Glt|zH8u*hG>*h`HoIaxD?YBog;mqX})
zIyokdfpzyOa^6b018+WH5_~XU`TQR9t5yMeQPnSnWs6eBu=75hM7>e0xFbAp4LUh&
z#34dHkm#KrhWns0D?_I`bCoxu1e9}X>#PSMpGu$+pIf+l2un(^`FM3_xq4#;c1u0v
z@F);#I?pigL_N~6{d#4<ey_$1VFsKo32e&FSKI3dqOUrgC*H&-V3xrM4f2DB=#S|Y
z>I%v6mIo;T{!$lKo)SA0&;)=(&_;d>+hpB-7#|guUByI8!|}}I7v{kb>ul1GDA9cF
zgCY=XeEbe6&PmY|upd$A3I&%GGkfK5Dv%tVpHuDp2tK*+a+449j3U7B@|KoV(QCNp
z{qY1xua>ewW2u*Do>ci7O7^2~!1C`-(k_YqWxvARc^3T|J*QKx{&nw#su%DS3k~L1
zHJJW<I#rv5oNC3O^i}cH5q8z+MX-vlI-Ab&`Dn!b-rM=5f%!0Zw(GtTTfehaBZh7I
zLDBb58M0IN3ygWuD3<XE@>v5aGJ%Ud&j>Tvd#}{_NilkJ{hMMvz%9s!S1dHzN+$s%
zh=9a_*HJw>IQxco8R26HfoaFSh3CoD9OA%u(DVQ!+Yp270Wn(%+DwLNG8z>A#lbs(
zj<|pOq~QfGjypnvTQM3kpKB(L-WnHp&X%<xe6KxP^>tRtUk9~IS~Z~x{-N@eX<3P>
z<4LFj81aIk4-i4%tz!+?Yju>T{p%@prq1#D)Af2i#2bHx6_$T(OiEeo#>u!pxvgcJ
zFVjgw#-hds34Qp_`aPR{<%c%MEJ~AmJN_@ddBM|z*<lvg^?zIUb^;2OGXHVSa+W>#
zA)I7S4Vy<2&+@d!Dl%&;+F6tXe2@h1B421d;PA$*{Tp<ks;&W=I6gh>+p%RoJ?)H+
zB}Q}KP(s=i1E$fOmJH+hXvX1C(8~@O*|mV?Jpa%Fbm%-ykbRXWgDdeJ&54%ksh;Y+
zNSLy-)ANgN`{dx<eQGZtpn4RinC6JiA3RL`QL33$%(2S^47Q$hiySU&kF)>-GkCLG
zYqk}&XCz}HBRb&7chDu_N~i$?XEDqBIk7YL;7BN-eBajG@x;I`!in4c#cUxllclp_
zov@;@-dOjp0UR+^Cve>5*RQQttZ1x}+I=mU^`2geW>G*sqp<p4U)wTS*9!frno(A+
z<m6K4-9CZTuy23rw2qHFe=_ql`?EqGIXtWCE}HP~Rl7i~=N)_K95;Vxt=a)ZV|{nW
z4$h96?c=+2aL4w`%}a6BRu_QFAe^Isf7E>E*~)Q%NvgPx-`{mL-!xASJ8zobue_pJ
z4hg#N*vrXj^YC!xQ<3FE)-K<<8(7=ZA67qrsw-$I+|PZ84TOL~OiVGzOMZY=93oxT
zvp7rpwY5uT`Jf{pg;PqJR90B5`I{XgN`?Pyx(v|k1Wjq^5Hti}k*%nckQm2b6IU^r
z1KH*8)(eMd!<|H@l9K3y^mXqSkRFvJzP?#Xzsr48@>F|1>xx@KwL&{!+6!}8du1*Q
zJ|3sV?Jrtg$k_<<&W9LE<thiPCLIeH8@*gc&XJ+j(j(iCik|yw-POPK!v`0<n8o8s
znNx<B8z=bS7j-h>iG}>4*h+{rxOE;%9o1V`_h#4g$JjTf4OT(h7G`UW?1C>macbWd
zrkqDxPMf7(Blj`Ven5O7CJyPl{b_mlu_F)PyH^sivl%&^Hc(sQg-Ymy`|B^F_V~GU
zaCxY2z!?{Hp{Q>#`nLO)B93NIav+Yh6)|uifwvu`Q!-&!9$2=@W`TGbi)9h98SY=X
zDTm*fXpLF9U<G>vA3ahaHj0Hu@7osXxYl2;gWhWW`FdyxIAGNr#$SJN*nhoLpb3Do
z&!cTnO5wj>8gh;r!%7vvisFoXDm5<f`8}}I_g+MMflUevi)B}T$@*H77u}XhByAET
zW>~@V!^oCu0Av)_R=$9}TUD*1kA4@Adv})q4F3Rk?S9|@ub?b3ZR@MVZG(`rxb^a0
zlvEYgC~P6wzc4`^vV0a?336(8Pj=|`%@Cr2#L3dhuVxsyb-Q}FlQL64b>$x6AO1yB
zzl2AsYf%)3d;6R!fid6V7FOOscRD1l@q}nK>b~bl)}TqMXCV0OE*lp02)ZKTyb8so
z&2ANi1~Zyv=~^PH1$5Pa#Wcm1DZ@5-;TMk9@Z|KOeb8#Gofw;;SZK*Q+lboh<LH~M
z2iwJ3gC)Vum+X}zv*_gGgjrOyja{n;c@Sj@h|^@9ei}Ji-2$vGC~F(@7_o;Rql7sC
z2w`Un7Ygp~@V25i`3-hpUP^eyrL`CwamNYyG%JP*q<P5^eig%0&-M{*5&`FBuzd8@
zcfbi3j?FRPp#iDi7wN9;%e`2~9rFJOB~Yil&0o=mKP~TONe8U>enojfh(X0Jnt0V#
z<kRUK)29XmfGv>#N+*d--}RCaRa=KCsry0M3@t}WF<BU7&w26+@Xl5n#Wy|z@u|Z}
z+q5$@qSOhX8=8d+V_D>Jo2>5zpmV5#IMZlz2hrVJe+2jn?6^<i<YWn@;xzVVvR;D|
zI#9rI+K+DHTjQgEUX*ZFKBUPFf)bJfjxbB`+}x_^kJZMEA&{Y8fPs`<E5!&3TL#0@
zW;FozQm0R`rfPPB`BY5$I4tniSRairDhUm%mV-Nh-r$Ih&qkKqfE$N^$7rKE%uVsh
z5qs>IS;rrgpo{0@2JO`mdy!~^FfWe1N;lW}NQ~m_-!Yjco2c4`!Q+^2Vnlc9rB_#U
zPbUBgIiKnw;A|lCIx6vTjSxsOyM;ARuQJr!VH^RQ7zJYu+mDCpoZZCJl8Z=3O_*Io
z;M+moMfh;JkmQfWjv$2k!$_OxHBjv#LcXI89W_^amaBfqDymqDB$-6tzKH&>yk-}t
zho{|6^M_XV;Pm9E{n`-E*DM+nksBBnN(P(5d1oNHz|yhBkvS@KmJpIxz&1OC1sZTn
zQ<|jpQ=96Py*I<^8NdsBX6mbTRAZZ{(*RUJtG_xM*7_+~Al(ssGaAj^A>dd4ky-Yo
zS{YWqzK~$vv8vO(jNjUCnh6*S`f1&A^QjF9pGy7UHrXYzgYHVF-FN4wC&xeicG^8S
zZ#6F(+xrh5Sb>c%z$=9xYV%5?7J0x(I5+w}FoAGykqI)qLS}s$@`V{#J}|yhlI0Kc
z5`);gv${Qhp9z({y_)7X;KKu3YufM_D}qK+Mef;6Ho(qrRoZm=EBg`2P?5mEY@kcM
zCpfQKL07eIe{YsmTJZ1sC*D*{MWC;$y_(p%8e+Y?wKNym;0q>M)~hna_l91aX)?}*
zEF+@he`G)(2f{_ktycSvkfm4gv=?6`E>mKk;;-#v41Q2U?Uw-y>TLK6|C|84j^)My
zs!#OyV?RH`8R5gK2SGc>{J=nb>xlWK+XP=&5yhHs!KEC?fnBkM%^hSi94}r?>QASK
zX%eLO7XN0w45n0RHG)jl+EF}<M^E8}T%SdAbX;D@K*7iHoco<Qq+@Z*^lDRj;2}6$
z*6M^cI!faAh2<5>BwD@poJ1TS>OLalk+TW3EewaQ$6jCfE1@+e9}JW{@>nkLDtcdG
z*a%P5vNz(Z9V6jlizFdMZz9%lLv0q&OkrWjsT1ZRensl=r)b0@Y~&i*-r@lqbM?E%
zWF@+Xy;*0oE~7rpqGH}h4<+Aav_Y|hHz}f^GBXH4in-!MkfG3ggm9L^K6<W+YM!{F
z;I4`{ftEVpl-hq^>68kWi#E07)|)BWX%tV>LeQY&2*Zjt!M-|B8#$t2)*JLKx=u!u
z25`(biOzGZcxlCW!HUzK<9d@5FyMCM&QB9?j7XxclDfJ$p@Nw#fjf@AX4t-3w_D5^
z5$`^F<l+1oA5hq3?#|+tkxM3@C-FxU6o`$o_k+DbGXx(1tlVfCV?ZoNkaBb`{4Nc#
zx0fxOAxkFjw03CqpXJ{$Jx%M!)&V`x&uk*J+WmK)y|n|R0=N#}peJTNMF8<!-$pt)
z0ngi2ylyL<QgO(5m=sYzK0Wxp+xqc0{O`%D03~yslHZ+P9v{Af(k17N)m(|zI!biB
zZ3Kvyh<JD)zM-7x>>ZAjYAw)M?^Z36AZO0JP;%1zpV7g^5VvAJW#`*aW2PNqq=AZ=
z@4|x(wL_x+T0?J>&93|bPwn<td+5&iQi)&oN+-f7sl3Os>bSuF%VQ&C>nT1cxP9xx
z!8({e;7&q|_}tHouu3wgiAk3$NHGPuC508XKeP54#d}`(9==Tw+2H+o&xhzb9Sw9H
zBvw}}52=d@*URAGPh#9kF5HkNg)E`?^Pj`Pf5Pbg(`D7WFw!mzy{igX5;<E!kJNzF
zlWWl{c`<RZwIa$Hu6D_851I1GTEYv2o}8r9f~QV=X^ZH+YFV|o`9z>Cy=JA=8lh{%
z`EYZZAY)u7odE)7j?xcFgV(7B6RXpZ>1Q=?^;XErNsCT54IQ8F3=kUu_77GOwgTF2
zu*120kGfAyf`h`5v*HkmF?eQy9bKM4>~hVzVgwrm2NoY7?Q`R3zKDG~#E|=fGzs~X
zVp@Cf(r3AP&aK_zOW&K*dx3l-1?)Ga>=`tGT;qnW-$jqF$o~?*4cZpy<CX7|L(<>$
zGsTWkyj-(U(Uk#yXMc&sp2|1y*E6}xhwPwbW{UIIJK;?M3}?E!Ka(XR;ZbatD)+6H
z!;V}$SXOO=@^PA?SW`7@OVe$S1wuL8qa_V=Wu5G2tUUQ;wVws+E~#uP+Wy1~3V+%d
zt!^r;0j8`v--~+cFX>9EyFy9_wdd&JQe)+dVl`0|g}Y_ET(D3bBhiFC1PBcj8wQ+1
z23-`{L5(!G#NTo*4{qOkovrAXh7Li8ZWM=|U7^3Pk_ymO=|dVvB&<iB*2R{mHKy`~
z4r(LcMw*)%oESCei@4uctQ;slZw=9KLZ>OLo<ch@=F+<3`Dj4Ryl|T}`a|PaRNfNw
z{^({(FqI<Th3QR&!;!hL?woA(M$kveE&kgJYm|mlb_*%VT_$UvyI=%xl@hdU5Dd-|
zt6iQQ0+u}@*xT~7y+0<sr?n-(7ognwLSw+W%Wg#h5w5pZ7C?NH@L-j`kA!j%D&iS=
zw!@_`iYhX8Pve<aDoM)9o$#+^tyX21#38>>{BeIq-s-h)E$@%wP<;=1N*k8fMzD=;
zPl@pFy9oYcq8_T6eFcS&RoPYAm-E++=d){ZNUWHTTNcxou3C5sK~*c3O%`utUrFQo
z=62Qm3-n!)eLZNNTy*8ysT+9G3OD1$l1Ojph=i#n2<a}3o=ekjJFmMJKb^s?x;(j1
zKe^sXp#xVS)gLR4FIJQhow|Nbe=)tSSWg_goVveP9&`21pnIvDKOt76LoU?-zl?@P
z+YkRP*E1OPZ<(m8bZ#iZ2#5+wm<gsE!beKUkeVF_tSIoHw4KQB!T@jX7)n}J8dVw?
zP^L$@&e#;RQqfEf3~N&p(ha(~pwYZ+(YC^=R~dw>Gd{_E@gL0gnCSuq31k=M973zE
z+8`ejCYNA&nFnA)M<JG6lIkYUm+kJg)Ggh$YLuEqN5Oz=`fmYW^16R5O8yg7`Vd$U
z$BDu<pSTVcda$1FD3-FvVBWNy5|_xo)vHwG_Q`q2!gGwiwxqSaI5;yQ7a(NG%;?%<
z_^7H=l+OQfuw~I+=>jAy*TJRTmP-Y39t88IUB{_wDhL6TQ?wo<UzuZ=1__|~MB11a
zY@MIpvUV8`TnyzmuhXk*J$!69n~!_83GI)|W#|(PzrBoV`wt)PJ=`qGMD?Z0#b}MR
zU)C6L!Z3lYke&)ukov%l$McLK3#kRw($01RVt4S*aDD2gz&_X)hmr)Ep;UGKlUqzi
zjM#yS`F{w@00aqg{4KJF$okRYyU5|J;9}k@tzjej)||62L8@q+Zhi-Wy<Bi8t3?es
z<CH+lBj_H=8>k)YOAa<fYTzuo8cl*00|7&Iz&=Y;y*ifR5PU??y?66v^gg+TNbZR!
z$Oq|1b<z`XyAS{qOp^yn^oj?GU&`(*?_z5&R5Kq>k{fX`TJ-#44NeHZ?U1fTkFr&(
zZo7#=TmTb1*yQ^tncgRf8?ntSDugNmaecvegr!Tl_W&lT1Gd^{QOpsGAPc^2wJsvz
zQuML}RX^X_BT|P<|LOhR=fJ$MFfin7R@-8)EMpY8j7nLQ)DBeVP#GR^U_mCy6kOO)
zeS*-EaILQ6DdQjs#^_ERkx_}3(#sE?G^*-V4lt7l#Ij3;5Yn??zlr-~!=Up9RoGTU
z&@Fp)@$R8ORyczwq&6^Y5G`gDl+W=BSnEMOI)!vqLwBgmmz*#p1UNKEpgUH3SW&Iy
z(qabyz>s0N)EKt0mHj$iAn2*&d<IYBK<hn)%98-b3JYxGkvnZL{^@xe?<dSsiV>9R
z1yXHYL)$lTS#5wDio82aOGpVwN$nZTU(I)8!2U?^Z7Wl68Nf>!t--J67F~co6c?SB
z+-B-vyzPP`Lx^h#NasHERf)fVytVwGTxNv^AhQYicrv>^?A11R8m+fy7e5`oQoK<2
z=(zd1V@q`wL=14|bj}*Iv*LiMl^wVd#zm=uqhD~pq_4}2&bP)?!ESZSI;LZrVmcg;
zV-D^xxL@e-`>WOZk-AiHLAh<bZKTVmbu{!QWf>a)_2OY7yImrh*n|T;QX3>(_ayl^
zs}0hy&v*$W&2;!fJgN<}ldgR};O*oc54f;<fM*PFW?oci{+wupp3fk)mgkMWx|p=?
zDP9p2ol#M*<T=*gF*b~Ie(ei_gmzGXnhDrrYbL8HT0$i&gll{Th0r_UMWwb%jGJ9v
zC=n?n*{$`w)lsj}o96l9nirIGk;_`3N|gztWoNgXguv4iMW;|SHc@=UVQ<(?whtTZ
z9J{HWN6dq%oi4F8N1)<`ChsqB%S^JGEub`v-m&?%b=*3!=m8vyL(EDYKHUv&+!kWk
z%cuN{x?blfEWSxT9;hQxtUQdRf>WjQyLoXMn4)HZ+q+BH-WuC<4$pOwvWnb1L4-w4
zjx<P)LWJ%Qt4u4^rK{Glo!&Gz^7&BlHVJr7u7xYM0O;cv0O1oQ2LekvDggK@0NBa2
z$EgQnD=UfdYf(SJzZK~S#!b_2MK<Wohjh2_@pONl_CL_i(u@6d7r#<JdSHry7P^#(
zZ`=Nb9|ri3Guk}M9Q`%hTH#mO{Udcj!Tpa}C4%OJr%wCxz!esjGViD8`GXxI82o%%
zBwGPLeytqxJUfumNseo5#x#pgO*(-*ZVI-e-P_mUyLAG75mF4ZGYlCFHn9I@n{Agt
zvr5jBtNuow#Qxn7n2M!kohVa0`$YKB7J4TwA0@Mmb+04%PQ7Y$Kuve1HM+-?B|38O
zQPmJ#X}AP$Ty+;LA89BD+zp}$Qzej?Pft!b_b~jkb#T!-tW<&g&^mv0+Gzz`W?Cps
zle~;67QDz39xXf3@KBD`3y&3PIQHA1ch1{0I`<`pRg|f?x|GBh-ey#1<|gLI9*S`Z
znZYAgM3cB6KTXnrCh-9E1T6fMlL*QYAX-TrhG~UFd=8hfF0*7e2ARg3bM_1zpsygr
z`%63I3dkayaXXRR5+vDam~q8%ao`BFVLOme(Sc&M(%G$kzxec(sjDRiIM)LHquuZ`
zC5)UYxm?vfR11N7(}?)!%3ho&S1E2ite{>!c|WNUAE~=x#4r5=-3CFQ1=v}60GkH~
zt+R_x_Y5sHYApf!=Ck68TPDdq=@$Cn6eHh3=-Z2hL*gX^_tJhk`T3-E(QTipYjzG#
z0prcEV@)FIefe(&Hn+Z!0a}aPE{7+@6l^}9H274p^2*Y6^T{us${``nLu+5qVvna4
zva6cZ9jb4{5MsylkTVF$x7U!jiX$E^pO6tDpVsy5wWKGtmYbUn(MA(YoF%i1{)9GC
zI#J&x(`f_uPA#jpHmQHt8_~C-_K}v5=#kH86L!E;K}r$wx%}Goxhzq*)#%_-TF3;@
znUEKzVUswE%*pk!$$o_@+-VL;Dc*Nl%w%wJ+^L}&RsBPq;CAceqT9T@c+>r<)dA?I
zat%_*LM2ZsG7PmfH1@8ez&uj3lHSHctyuaX(XCRV+d>!EWsj0p@j{rO*%UKgf~)fP
zD7d#vA1=M(p~ow{yLPpcJbQ&6!(L7Jvz5Vvqb|isuB5m4HdN+&C66@0-;l_vXC;Km
zp?N-6uL|fG-Oao#5=>Cv6A0<{{ZnUgN?O{=y;y55;{-I^@i&7tzRix>md8ZxcuzM7
zeOokPCJ^M)1c;_+1(R2YLhoEyRXC0P>jZ$)K`{#Rqo{^KG6Ba%2rtf@<LoEO(ruNG
zGY`jk(@NZ1*dk&#<K2oE&aF`OPS5`cfr8K77`Do0zSMpAUF+9T%t4uDGMVNd(=kac
zWW>VMTtJ$TnF9SX#pPH&{^*ScRLb)*wckTL&u)04;s_7S_Hnrbu#z}VOJtTEB#Oqs
z2_apA9vi88dbbec3y)RSw?Zf^Ud?s416v~d;Ss1(D;ACroE)OrP3}h+84v3mp?8(M
zP6Tg&U#RPTrMS>5(1_2;^?N)Y%~Gv6hB5ByTg|eiM?4ZFKLhu5sntN4)KSlHg`#wG
zr@paUCug@Wq@?&hxs8emgrnfK=dh&D*N0>Xc*oJ%JNtW&A6VE#TWG}4f5XPd(Nzkd
z!S5493eJ1rnNLzNyWSJ}DV#XWV5g4G&I3r}VF1df{hfXJL$xEJR05@t>R*s81DFK-
z;%{49TfZw=W~MeFYoJ<JJo3TbJG)5|i~;)_o{rxsI}zAJ*b~#FRU6Jnat?>{87s{c
zxrDf%WC}e(J7}gPKT<A?Pyu*cYf7S;j|syX^mU-O<4{F%W4{6`VBNibz+kIJ->5-R
z<`<07Qr|S>C&*f1I}J9X#N-j(L_p_kkbEStcbTU+siQ%G9Gapcdd}^sf8V=TcgVT=
z;pc+jpZ>P)<}D|08ufMbT?FH_3{9|8w2+J_O^mbpKbLEUc4aDj-*CsF+lKt`ZM6My
z@95~rbPIi=o62_v$KOT`0Jw;xnB?@1t^dC68d6YSd~fGjlvp!QLNiZj=D&w${yRcC
z3DzB-s_1XOSFDFM@x)9VfMoDbHKIE$LVGCG9%-qjsJ$G69skC`dB4Lu4mS#A=PewW
zk+Ly;mK@n}IsgTMo(P>8pCIb7-BTlOB%1}qZ<*nJVI3^qsODMw%MiB%+a1m31sX;U
z<gADglnPdGNf@#wsj${yMN#yd@dbdu$8>-$L9u$XAoqcB9->_$PqVK?V}V8uP_T&6
z8`Uv_&RnyieTL~r4F=0eRMtl$Xox)>IqZoNE-2~KgwPrjxx_yjR1%{B0%U$tz?g`k
zcs|R=F@{$ISGfV645kLX_xKW^eW#pn?Jg<RT$P?<H}uupsBX0J5Oj7jV=`mlWmG~^
zSEkdjk;cgbUbgetO@$kv5@Ag{{}wXf(NE%=Z~5f2_Y3_lE~mT()|Yjs3-WSFvtjP2
zU3v8LF}YKCo#XeAV9WnOf9tno&>;O^Y$!(l#sgY(dH`)p<&QSvtMfxit?aColCHdk
zN+<3rv16UnW<T`hB=jW?Yno7m*9&A@*{R&=<U_9RT5$OJbfO4D#gE|O&?TVjWxw0z
zlw#INW?&R~o6N5BL9IO02I}5j+yb(^5G{8NA&A9|@qpxZj6+cm5jq&4XT%(Ra>ySO
zq}y21!LXy4B85>h9D;H>MW#vPsv@bf7ZKg`YdJ<KlQmMp;57;;GMbq|Afc+7%&jvp
z#JX@IBwUz>Pex3-868W*#0;CD95Cy88ZwhoDE>AB=aUmLju-rJs>TZKgceM*kJRy2
zv|~dBAVMuZP+XUYy?9YFE%(Fy8G-ePs+?nS*O<r)<tHP=AqW-5{n!`*J)+X?Nit`S
zDvvVrO`EK7&wOeQBckD`Axs_iCVZT{)p1jLDK6MreBpDP17leMirIN`qqyYSsPXMc
zkULNzt3<j{#&;O~S>X4eL(34NaYmWC*73;pO2M%AshBcfMD9YG+M6#ILRT9k68Xl@
zWOb@>2^?p7S~A1<27-pvdJFk8BjtgbuPZFX#f)7RE+8A|s4<+n6lBLZ2ck!ayOkDp
z76|(Jh~kgUpB%qSF)50RKsJMt3ZUCBY$<1(r5jE9JUihPgK`1OAB#=_6G?60Yl^rU
zMFjCJwgU?#=71n#)ih$7GieZ-AxS${8xTfrYZDg*BTgkGk#r=C$>uK*9(Kz;vgD)(
zi+`YolFcX1wGL(VEZyJoGw?YsFFv_=P`YRz;<K|*0UOq;*|BBa^A<W)|Ij>cAGR-k
z>b|`^zVJE&yI%>b`ODvM=yuawlb15-I<_k=X`{wS6n?+Ew?bY#^K#*NU56!F=hp<B
zIVaQPLz>Tv(XAy-$oqlP=dFIH{9sb^Vxxe-cL7+z=@?Ka!1W87x&pL^3Ev$p8=QVm
zClN$Q2TBkoPq#-6m@W!&>^5Yf_(+7uGfmX9uNXWvt9%Hl<<(46wnG~xBhv{YNyY`D
zp}Hn9L%&)eyTEX3C-p{jEl8UJX&|y3!PcNHRhHhqb9g@h^AX%#2y?-H=I4~cPJnEX
z7g3wNkSEyDNe11w40e?uLrLm_<3PT=hM;dR$|?ybOC7KUFFFaXD?R65h8)Nf)k)$h
zW29HT>F5_g+|EDrd1f__d1w)ndSvud+s|12v&uYV0leF8syVX_kc*|H-tu-WKfKy%
zV3hG{v688{D)B4aOGc@>E}H6?TSW?q8E1SXfGpNRG)#0mKbdDj46H{}VDYtP106m%
z<DPez-I<Y<VVS$zT^0tG_!uF&0zwe^S$HF&ZM$3EZc8OAF7UqhHr2Mo>k>Ra2Cv5w
zp8`dG{uNb`P9JvZ+OMEK4743gfu{ziC{CPageK0ye63Vjy=}kN)&K20E485{Ygim_
znD>5dcwgYas!eB_7j>)EQKoT6=o{2r5bV;}H#eV^R;fHe%$Zl79G9yABY4|>eGWFr
zi_;*pPS7vzFg;XcL_I1WxI1Tw51h994DYjU@T_zw2)o1#FxexbN>_#$R2<Tkk7ya-
z$t?}y2qu@sRHpVX=CHWn1~Bi9`bK#Z)d8!Ay7;+N5@NpbUv6>J(mnTwieydR_WOuG
z)}|sAJIS*nBB;2zK7a0PVk64m+d8-4-eiln<?D>8X)>r~*6yemQW}?u^3dh$XBzME
zMhQ8JF;nwE;%Y;iFwpQE!uK%ziCHzpf_kAC^`IXsDSU%V0KpTYk9}5gvh^^o<HB~~
z<-=p=WG)g7N^0V2kTz&VCFfief5aMRnygpeiv??MuXR}!TH*ynov*bT$c}+ApY}f=
zBGbJjW-3GERFjCOUiE;PBA9wdhI5&r($uI{2y4cOoH#Sy6DQCjTdekWGO8>Mw$Q42
zAR&kCg9`{@eI|zjor84|do2lV52t{Z6muRZ*iDYAi`|rws<>Wqua+MSughK3vJ$@l
zCCF`AZ@l}hjz~~s-BLk>Y$U#HuTz#(@jvv0&lFetOv8?;KRB97Rj*iQ=e@G_(pWM4
z-6RW1Xj7$2d&3;*HuerUk7di1lsI6N)Uz1>j-&@zMy5UuBrymz>yeQ<bC>`W>ya#!
zr6e=afJM1ny*EmvxU!;9-^SDTZrB|=P9a5ucTx$-nONc^ELCR6^?X4R4IPrEi5Op$
z^4MV+nudnd$JX$00PB$iC}2f`lP%4gAP>O`2-aI5;v9OF&bVd0?A9@ZQLIF78VH7p
z?U3D%c?hipch9R(eCNCll97L8f2CuzQY5Kda@iw}_;q&UE&-A*d%aS29pY$Y9`4;)
zwZ3JIs_HwCHRujKSJYmiUo5|<t3XUCd~KA^<|cSI;GZF+RG-hvn9`t*1*Ko9YpV*D
z2AcYJyP=LUJU4`78laO}dGFqS(>ak_ocaiJYau`?ywoL|yMX8D3|y$j;{3q^{LHTc
z=1a6*hXv1k=+f#fI0EfW_#rC1*IoWbNc_Yk3}Ozo6!Ycpuw|<RUo+rK5ylr&ZZH{S
zpNp;N9eGNK_oMbyYoFZ*O*4C_#o(<)>4mlb3F0(peZKZM!Xt(2ew&ESA6l8DfMqK{
zLg)aAz~YEmntnv}E|10b*El;pd9A+quX%!KL>gn<Qlkc9_M!hU*U*q{PHya-wwZ{E
zozE9}H&`qId)ywjUR}O!tl?P5<4p|#gHj0qz(*9a+n2%VZ8rSOLe?>=I!a5K6(|()
z2%&*gop_H$b8h12b4l9tV^1+GmjK<qtcRziH>CU>g`euuN_54G(cpAG0(}7^qp_;{
z%vnIlP8Mgkb|xf~<Ylf7$o_+_7M<<XQns_PE=Tc4+jr$C{(C$~{(Iy)0ihkK&ND3i
zywaN^jYAvHmt_5-eioH+NUtg`=N;v7VR3oGiwJVCM3le)-Njf9<(#OvKg|n`a4Pnh
zntlV%PJa-k1KDC7Y?OM#Gb#Z^wV3+XjME~neAev&=Q4Iwmy8dB=8C^-;28qskhpl7
zob89#h~Bj?-ke@u;F*TkG|7s&=Hkz+z<LiR7GAI7eMHcgXfHtgpqPF5+0&5O?-DMI
zn43fw;?2*2sS%+Vx#dPV?F8DMwY`Z_N!Y$7HSMl%>0AQaiF@cwGM)mNsN(=K%)ekz
zZCK(n+0EL>JjVz&3wh4mz5S5pqgb-2LGq@4IvKHP(VjV4890?+FR>N@S5$8h4#^ao
zXQ_H;t@EhaFWb@F1;(NX1Q;Z^LT;L#{LLWW+8d0&0Qcv@I-|&h7#JhQZ6|(3OA}j`
zIneSQzv0pI83Ct><l{t5PjL`(fU$jfKQ!R3Wevt;6_`DX4MF7AE|MNajR5;8a5qLg
zM7u0oHp%T6E;|1<j(^Rk0G=09?f`DaaZhm%i@tbJ)Lm+1l_(9zWRwpiw#7Li4IU0Z
zNuUwRhm;VmuO$Aoz~BycYj#EQI5PrxLynBl1#mMepKQ8i>e!&yEx5oobQT(O*|`|}
zF;X;|oV0Xylz4OnOLRS^`N8mKbBvotVG2h*5C#g>lR7hm84w>alUOpaG-#mX3xuOv
z13($QrG!wB6>HIS4oEDDapjwV95jVM$OVcSu+7qMznYIH2j*pZr^@B?*@0ZO%7=S#
z8cFkbg%ECDVD?r0f`-a`{X%y_0<C$R7rk<#6|ZV`l{eC206ssYw1;=%&S_!xmlJ*G
z9NZsBZRZ8H1vAtIRwI<mL+oCqv?HN(AB(+9*>ywiDr%raHH9LSk(hvIpln2RmzfO3
z!FwxiTuQi#F*O9@h1vx*?<xf8RrBEc*XO5~Cx`M}X-{~QAqAQ>*;`npCYeFdUy(X7
zoH1w3j17HNd>qp=o1So6;-Cg?q6_g?gg_f>dTV8vWtoy6S}cReW!4iS5mt0o#jloC
zj*zf}0m;Iv2pO>uv-XCrJmwK95D*95JQQPqEY?<ZSrB2fx~2@fMaVq|vwGnRmrxi3
z`}GuaHJ1-*VUnv9w?#ZqLZ<QdAw{L$660<nln&kdplhAfmApyJ#1lpo)I*Ianhj?M
z>rwE$>2;}i$tYfe**jLBavGh<G@ry*K#WtJF}9<a%A|jtQ9Ok|jg+r}$udPgRX5@S
zC0SNw3$4Qzd|#V<O{j--1TS@3h^Ll#SoP*tIxxtM{f*#g+A0aXtkT0<HSb)XLpPen
zxF|PVKsrvsZQ^X4$Cu^A3t9<z)2$b^k1sl?_Y3oAmI76DMp`?KlY`DUqjAh9Ze`7>
z8i+pR=g{7G1Dvb6V+jD6rNx-m5(oD|7{#<GfXggJ&Y)&piJ@0>ObdIlU<2_)6LBk$
z=EDJX_yRWG5mU(|N}c5Ka6YnQc+#P@?64%#n7!`Q2y}^QsTm!<CON1f&bh!a@_abE
zkrPwb^dQEgPWMg|ILz5I0L!siPU5*n);e-NVq8RvGvf4qYP>8XIa8N)xsKgs2`yxS
zk#APAZ#ax7>9E7oHOFTvVuVB(^cE53M&ImBV{!rH%ZRDu6vH~3rfPw~4vnMNZ%6A*
z^N057Isf@iziRr)v%DP}6p<(7Q7&a_3E9xdwT_<snD+ClX*{`R(ji&OQT5P11jI7P
zL8U{p46kcJQze>7g;~={t06j-9r#dh=p<A8G8jS_P!+ic*Q8?^B#_h`<eYJ?+1rVt
z4bhI1+>zYB^${?l2Anhw+cs&|nOkn?W9>{&4^5VZ^1K75jRzbOG9&Bj95#zIEukDG
zD(fm{3Gcw-k`IJ_xr$oXHxqEkrwQnQRZ%tir`l%BI%11T7@%3ahY$eD*TDm+fey-?
za)8sd`0KC9+kgR8Wstx9=KY|tTWu%<$N<GCJUW@UE8CDp!9Tdput7sRp6Jn|YSuwl
z^wqS{b8zbN2col9Cm&~U2uu=jMse#UWDYe<C%A&BYk5_TQyr2XK2>rMsM`SeeTm60
zAzQ35+yB%#66U2O3{9<#-!draYb(eF&f4p5?;t7s9ioDZ2vfU&QQHe~wSLjbi7EXj
z<U!61mY<k`jNP5TA$N9-0u9e9=)fT8Rg`$}Mq&&=GKwd_rq+lzN-2_8M-4+$DZom=
z6M`I;9N$;RO3pZLcP_dY7sqvn8m5In5eR3GPo=?It?;zK2LMbbquZz2i(adQPS0Pr
zE{w>91U?=qIyjlntYA4b+~5V#t5^`Ah)ta>d5i-IG@h0p$wCz=?;j{)B?u<&<#Ur+
zzC6o@F}yK6Y&t8gzpUGVesZ9};2K+CbUTrfB-HcGYGr(V^b{$rAw2L%t@gL|?xByF
zBD>y_>Y2}S^MH6M{)A5&Br$rn=+{c|NQx+pffCtkMl)u%8)0!xG^0oYm;;%VvxVTW
z@Q?tz6k)`3J6gf@ks@6WO4^po2;GB>jDxc&N2&nsY-T4v&iHz$1wxbx!7QivP&jwQ
zd*<(HLvjCf#Tb_eee}1!fK^NI^TNkKZD_=ggq#EN-UpgRDjboPV>bHLf%9!)#3B4!
zl-q@shMI3?@^O-Ktd3f+X)5<YUnqvRk$bLI8e&*1g}E1dk7i{)Bcz>&mAudKkM>wl
zt4!Jy4Ao7uA=;GjR#+*et<5G$dy+E*Bx9;jb;bS8AY%lHf*1%ljz2nDa;*%&gHE2K
ztmeQcVm`s+5DPDbx0YohS|d6QgTZ}VJ|z}tkpTcscmeyUp^W?e`4|I-OSbS=La8`5
zz|li~DN~`9TI^G-hN2y%17kYA<VUuh&62BR8g^;nO4`sj&r*s*b5wiFOzGAP8r=K$
z$!%?*Q_3x|Inpc7YwkT6$eofOB&T`;YGJ=Dd=aX)a;ZyXAQ1u3taMQ2(NN*gP<4iE
z2bD!Wmi8*91IjI6`yIFmsoDm?2(vZ-Q_)bDhES=P)en$f$v9~?ctbZNK9R`kl3x&H
zxPrVS2!0IjJYCWxGd^@UIbJN)e=QxjyT071$DO(5Ak?Wi#tjVD#1*<1W`kVM4s6tk
zZUUq}G&i$!VbEFRh%sH{=T{#{q+37bb7m++y9)5P-fIV9X9I1#0%EJmJ=l(Vw=;U#
zQ78tzWyv}so$*UyP)-arsyL$R;Do(TN{+uvj;rHGv+~vnfeI`?H%cC-G>$LK-D`F#
z`N)|9Hls5o>)b~-DIhGwaef(h7(X*>(tlqN27@Im7<2MCp1wDc<y&kn&?=pw>xXO<
zN%UNgodh}WG*3NHH#MJMT`!6fXR`;ff{@OER%MILuPti8Qmnv8w5^sI9Iakdmo)~?
z!H59`H#C5xf-o-NBebzO(P4y+(MDZ6D~R55T`+;5s+86WA^TM19G#4v6M~ko%_1Yv
zXi#Be<xwL8HUX0u=9xo5h#i(VWkV!$gX&?2ETaJd*>G*lAO=}1-Zx47zQG9AAZUXl
zp}nMEQCz=XQ4EM=Zb*wO#3)-r6x-l+m*gleW&=^u;xzbP7;BO04FK*^&5B}*V-i-C
zY>(?AOqMnlS?8^l;+ml-7x%B-10v&O1(_ZN%?oLuHg0IQ1fwjsd@9s&Ii1>`1E!M#
zL>cx!P_2z~1HRuwPVrim`>RQb#2uMkm7>6XPPIFQBONk-0T&gRh-SgTS?%G8dIXZe
z;-CvYwRV1FtkwOmc|M(wA&fGZ1@}Ho`yND6YAym5XcuZ!gVQ;=6&v*#V`}!}jQ1j)
zl|q0d#H&=X$wDA33;K{~*gqb;vAmz;;lNwVxfvTQKp22biJYnuwRT{JL<~kqJrY+(
zD)}lx8HQ-gFc@2g_S{`iXJRKg-a6}gApNtIon>7aCrvR5FNh}aoKs^R^BmQ9BXQZ2
zL49kjVY#VV-rN|JU`epjf)h1W8AEzzvL@T*{8+<MDGU0_L%RTBb(+V6e#~BHG9%-h
zJj;m)^zwlc(Sg*Ujg#*vQp~TIm&EC#OsK7Cc){!m^9x56-f@(Tqp^3)_nf1PUBYJi
z#5`rF7HP>IJ5d)WttQi23<nCmhI|?{7_2(Ff{>_(ATHw9$!LPUcMg3eB>CCgsLw?=
ztN3NOEj8yrSOpfid^q`Ss+>XU%Rskq)Pw-V>*_KbWaeW#Hf$f;y@iNK)Ngxcu`<T8
z!qy;RNdR^$<Jc)^9qocMPvTaD)}kWIspw+N7RPD3MCF{EX5txPbS^j;@13V-6$mM6
zGw6|)vq2}>34|^MSmMxs`%Q>|#>zt@gYQ^WL35Dq9N_3YbOb|$0A!k+FXiUZzyiS2
zmJl2K%^mx9(HfuowdiTI#(bjaYH&7o#?ysl%h03Gd+MPz6IO%)?6%Jj(2T7uO>1^2
zWumo|DP~<`E?JjTPcHfD+$#1@jNEM4M#gzQErZ(78xMC)?Pp!L)trDS6?JFe&zfPM
z2q=xT5we_KCnjNF;3!tVjI>V>$LpT4m(jNR))-s}ZpeEH>d{M6VlmdegQ|3SqITh;
z{kDa8O7*a#+#fp6<-^RhAKo9*zSEX~V<~&Wdi>hL!~fso(7I?V(|N)qM^y0)kHWT;
z=uPwFu=A$*eTx@u9MAgK%-17*)f$X+qEp1evN_qHOYZ~e?p?(97%4QF4OsDJfM>~I
z#6l1nlch6lUPsJ4U#am%T4-lyj9tx&4ai;~>8TqgZOoU}yZ&8b2Fci+>B$S%T@D?@
z(#32F?m=L;rjx1GCY{vn%WO_9VTrz=4Gxy*OA%hs5=zm+Fc68DON>^B&TI!gu43y@
z1W=CURQS%`iUQ&p<5O-ynQ!rBC`#Hnt0NE~`Xoy-S20D{%2P>}LiMaz1Qb9qOO3JH
zA+G;Wu8vWwpe0E=+qaspo9z=tIWJ@a1{uW+$(n)2Et1)z+}diN{LnmB&9u+J{DXT!
zU}Q7sFfBoJ;rf~*v(hbbPbM>$P%+D=<8D<JC9>gR8VDG1w@?QlzJhygVP~AVN$su2
zD9w^tcQVVfS`%{hwJy|QbqVjcwOY;ZL@n4x{o5k0gNU1T;k$bI8Hu-wqC1Sosd_kH
zMBKjPCLA2W{)$7`x5u!5r$OvjI4jd3d%^o%a&zAHxfMvuUAeS)N}iL?Ivtsp(LQFI
zSAX}NU;FmY^*=BmNL$XwMKUeGpO|`mP-#i9oTuQkVWlY7oQuX&#>N}l4fix!CK7ka
z^_p8qHL&B^ET8Bz=j=9`?9|q-c<ve=)uizSN9O=~mqxLFhhc=y-iia!>$KoimC8sd
zh)4ua1yZ-=r=n>a+}XQ@1Cxcu*CZ()0mjGEt2rff(K+nP(Czj5R@4He0(nik!1S!{
zv?MMo3R~19ekwj}7Dm!=xH!!?{pNfP5!qfWFFv=jdII?EpnYqoZ}^Y?PN2T~=3775
zw*qVL46M`~KF01Z1t(5Y7YmFPh>{8R3J&wz^7YL&KZhAZ5=%`_mF$;`=*=e58yyQk
zZpq+D*I?W}k?0{~o!oJEfb1BY$s;;Kh`f>=mS^}H>vpKB9NxFZRkU$EFc4+s^rR5{
zv$GG;y{JWe5ve<OUDQ-1a1~Quxq1}UBIH)2-lB~wP^*T1+Nej^1URy6fhK2*Cg(I}
zyH_G;q|QqDo&CpCJ$i$YfQ_@yqm!@?$Lyx;(^C}8ewyMHizRlBGN1djLU{&7)K5L;
zli6PNzg}LzE2HSC1l#-getqDbHEp+U)DaA#W^(y9B7a!ee;}Iw^=YT0-U8B;Vy?1(
z`(_Z%h;>D48P-f(;k_)&bFxfG;THVfuPD$@{YkLB()qzkAPBHml-n8<03P!D=vKTE
z+<Q{kc5)UO$_K_;fIyVDzgeW@mn+T5OIc^S<<FD+h<%+WCpXfeG<?i0-HBu1m(g%B
zRyma1d-;3g9vp;`1hqX$+)=G0aQ{|Tch^I$NK1==>R~Jm9$Qr#xbb(&{stdPrA|ki
zR#aREv|&IS&@h?Ff;4b60?Si2tg5g-zX!jqHceS(8K)Vag|$E4;)d~T{vnGC*^0pN
zCkGUqFTb?zHx@mB4{05>RuJF^EYo*1pCI0~Ts}JXF-Gr~NYaMJAXGIZn<APSY@0Jo
zVX8~&Tn=tS+OQ$=DAlC&1{4Gmb7mj*wAA1MZbKj_-@s@sCt)94-mZaKj62_MPk8|!
zR&ki@FE3o3rhHbhM+VSZ%g0rl7hqA?QU*`Rh@KcL=S<+>=sFuOFrPA79S`zM9sC)4
z-R6-JX+|l#02`a5cbL@ZM=?Vul()zDb)W`=j5_6Gyg@jw4uA@rPE=JR+g8|o9wn#?
zHB-ZmA8v0ugIAMLtYVz?lX~O>Z>VlU4fP=_YU#AVhlE{TzURgaPWy3B^&LDP&Z@uE
z8ZmpDN_E0CDo_;}d}=#DG?$Zuo2tjz&xobphXy&;x{Jma&yF0@TD7b~W)QqcB?0)&
zfh}tmkKW5^0^5fLVqg&m?xg_%YK(Q|H->~@G$05~Ff3-b4MM&Ld_nXXge;2V$&4L>
z5iqNY%z%p7*BQviK;7Jptb|UDAx%z&lhfwm;rWspe}I_PLV8_fYwLE%l>S)y-LGGG
zjP8O8{Zb8<{+H1{v&0qfrslWueQ=PlWL{wvO2r)gDOMIPm0no9?-%z|oV&#<j6ifY
zo_UvE|0~2nSy0+cWvLMn83=~Jf`UtD4FrC(KO2I#%~%7N{smMcsoWzBMvutrlMp(=
zSm?K6bOmJ2h7lDInSINV)3z=fjcrBXvMXA_Aa~IuPN#(=<drXhw)Eh6BJeySekK0K
zKn8)Y7+@Lwnj=)Z#$Yi1UQW%0lfq!fspWvjLW;!Xxp75)Qz-EOY5<bzOxxQK-$A34
z`2+V`shY<^8R~P8rwW&0Tb^8Y`xmGc<RfxxN!?}(?m@)>eE#_<L>RlzE@6=bM_~Zw
zL|Q)UBwUFHn^=L{XVK<M(XjWCZ!8e3alJPmuKVFNl1d70+=G2`D3^Sq>u|&8fEC<L
zC+n=0BX)yqY7J&T*zl{S6%RPW$29KSp;>BB2HqPJg)6B9d@8Jm8dZI$3YhG6aQJMl
zQsWM&^#oAT9;Eh?R9D0P{^#vq;4NGKkL`6^yyU|K?c1fRkCQ6t8NW7n0OuAO7Jo@G
z$8k(25P%7>$wizQm2-*O17CBd*5o4R$&+4?GT7r1xIH(>qU>(|rD43tuZVd(Rwo&A
z3Q;&FwY*=P&I$I3`W_AtR8g%aDj~<WiuBR;Q+lF?v}+nQvF{j2hKmXZan9MfB}X7+
zg3rvEVCC|)IzVtLI77=<4$7Q#B6d%5#2?t4rI|SLk`52aKpq6PijE)xgl;j6Zjb5Y
zKK2C96nV2TCyv>j@xiP>m5bsTS*G<QF0QMxHI_CDeg9H{11CME{opyd7`4F{nxO4(
zQajadaG~3@Q14+Y#Zk>(|B6k;a0Sa2VRa?`w*9;DPj+Y{o+XPoVu3&juSmaKL`bZd
zm);2{gb{m`rxFzuC|DGhn@M3m?nF)Ef_?hov*9?l3=)$A8KfwC)1+<8iB_PE!<9@n
zqT+TuPSl<5Q(=LBnllNOm}M~0Sdp2Q0(L`MY9dg9mA%xp*$}7%aNG=37#GmTI&{0<
zz>sNbCuMpxM1Nc`*NB;nFXDtuEw(E$&{RrpD|n#9;2T@tSMnMf0<MTDuCAsZmU%Yl
zc@p$CG2c&gao<w~#3CgUq1BD^>au^NH$ZwK?`uk=1!66>T7K?6yJ3uZ6?uCtW1hoB
zO#B}LhQ2$CPAdx=L3Fk?rV~8vf#*BdK<8MrwN#-c%c@vQVBN+8^g|FIY|s$Qr<O0J
zoh5~1s;oQ1-l7CH6;Cm>ua&pUUM}%86)S-{EP?=`6QIzMHQcM!d<TI4v<qZlK2+XM
zY$muXNhs!TJzJ;n1TlXsf|z3*FHyC?x^NuRfYOC(I81zdZz5u?paWh_&*#q4zL1n?
zIaZX6s%rYA=jTPJNDNeR7qwtkObIImOwiG7K{6OAjqTV*pKR3}NW?a0l^3FO-29>S
z%q>)EvkCv!g{l(hFq_2~m<Z;oUDB;7|6%mSN|(^3PWnEiyY^ys@q!>m55xK4@oA8E
zfT9A_6+Z@mRWH&pHHLC7F%q!@-D3RU_*X_?a6rNOqZk5?z^y-FlY$MfreUh6&q2;9
zx~EAmmFBP=!jnmEN|Ul7r%;Ey5yEfge4Rs%^+9A0%0xAvVtf&Tj+l@UcWxkhb2ddC
zmzj?Vl>jl)5O*&d=5?C^)Nod*1#SYxZ?03dd^eU--UmITOT9&4eTtm`zgQcSp>GAn
zt#z=QHM#f{%E+@GrSB8V*8-txJ?wudPe&v3kAg=%=psO7j)DM#0Dd)uDb+C8tMr8h
zMg=)2n86~E4)-^Zv&GFOF`x30rrX)T+yc&5I(Q6$M$#!n_u<hI9G=)pKqF9ddMf}7
znRL@PnUbNeA-b0yCxUEbm^Wh8-zT@ANeAAHsr{TmCnfHd+{$e<NNNlqBKao<wv#~9
zY2qFM5;Y9`Bw|ncEFz08{06Y1N}m#jfE*|~JhO<xOadNj4D~3j@#$Dcn4ID^>l^bC
zSH+GbCX@nYA^yKm2L=G!ZcLmDhqn(9{Xs{3@xs~n8kc@%mR*xo?cRcWNx5czcJl1}
zV&ny@OjkU9wjEi4Bc>_x7bt;oTmYGnCrE~<2;n&GNHg>@Lz7I3m0?0ykS775)R-1W
z<OaG1_*me-rLAi;@N>Q7V?UY9kOpZ!CzCtV<**-dtb<>qkFKg>|1R^C^ix2B&6Tl1
z<Ri->99bxTE+a<qcd4Xxr1P=`=!qPs3@8s14*Sw_24EE=1usEg7(#<MPHKP{lca;-
zqep0-QtO&K9Ek7--$^{^Q=jd#I1}-_3i*<Rnd8H>=raH-lR&vk6#q@_Y}rvuHrm_o
z;k1d%lS1{<**KnDs6~5~&T16N^J~c|!afh60Q7AJ7kry+cfB4a&0wX6r`P7WRp^+j
zQ#OgSj)_57G!k{qHL5&uOsGM$kPGqwanWFo_VwaK9Y?qLGFgCFwd7+A5Mxg%TaLiy
zQh(x3Uowa=E1@%2kywo*y|FS32qZp10LKHc!lwj1>osU0@oph?!FPe+!(<JJo#!@X
zKJ}GWy&}2SqNPXd28U^~RbF`Akr(6KPwDWfKPe7!)2m|Ao@t`tv{Vp4C;0XHO{tIg
z5V+i)Ta0iVM2BiXJI%R~x!n1zqGNHu;#pP4g-?85=3AB-LtqP7t3*qvR+^b&Ivk8`
zg>YrXcNEQy+5XBB!3LV{g@dW|epobrCX*Eo5couXug1~NIMG^FNhTdeL@SjFJ4e`$
zcIj~jmEo^pFRD^m8zWynzn48=maT_=S*kqFY<7|+9Ufr$2@a3Y|E40fU7!diWmZL)
ziC9qbvjG0fr#d3>6Y5ta4se%7GF1!r(j1m}Oco+tQI6EUN>&7nB$9<#sbpA@vO<JT
z2gS0hr)NF_DWL!+dEll1kw%bNg{NoA4!It<trPf4Ep~k~?Az1B%i~t}=(zd1dve-6
zZymPJTL%~I(-T`gWocH(1wb3>z*|cbWPrqGf{gr=N%3lD7144F<B68(aKndu2Tjyd
zskftvvX&S|$#CYzZ*P@QlL0+5G0b2T*-_1+0_4XZCGVib4cE|Wg4sj)X4e`Ti7?Qv
zrD;?{3XSz$f&z)vFsc|d<e7OV>AayZ;;J4sb@=vMLrc8qe4mE;X9UsWyWDS=nGq%G
z`OlQg|Gx;3ocdCh)@gC=z*U)$0#-nfwk!oF+&g|c*4!rI!rd&+tmk;imO~DVzEuY`
zcqKl6(vmySu4OdK3K%RsOl4d>M!_KbHb=da`64>$9SE}1a^Kr9axh90eZ_!+@lwmm
z#7dwh9mx}lC*&N6KiN(3a5M}7#JDq9K*18B1>uDh2G}rC7YuX^7Bwa^p!J>obK5AT
zRii1Pc*eG!jA*eWMWVq2Zv+GKMlH&Nshjf{>lnuZTYccLNWK_W+Bq+cI(!Dn$YO_V
z=0$PcuGKvNsc%6V>yYJGtZS5n1EaOjZ;Bly;u#wrru`4S`EZMKi_62Oz8Vri17yqG
ziL~O~`^q+4GG#@qX-X$e0nq8yH4<=0R9(zeqX^oi4Su2+q_H+gCcD*n>R30$kQbso
zU1;Ur@$Im5WHDaZN{&h$BATH(cRV0iKx6sdc3OgBU?UquCPkcS#G26v{8B&%1Ls{8
zl_S`{<v{Nm91w6|i4n{e_26Hj@`JCdK4UjiaHM7yxP4gn<E=SH?F@%eE1B875Nk1~
zyRl^(b@soYbMQ>-zV>#zaCl~;B-0+{Xj!H2>ZT-W$!52c#5I`1Hxj705CR9t8&=mU
zi?^NE-HV^jfcjpZSTVFE4qF|JqT8DnUBOJ$uFyY2i@ykO918OS%)>LYZ+u;V4}h_J
zqt3!Nqd7S#SvE=dvEf0%*CV|q!bF{MCL%jby0Bk#UfJi-&VJok{E!V5<_j?i!Na`~
zv0qh#J8F;wwH0XarL&z~7?ovEGz^8=CqR7x0ZSgEv-8u7QwVtRUYLWJ{66t=Ym7>@
zUdGFthw1u4o8F0xx#z|W9>f9J?s&c;-^wBY6t+<ol#RwRU>WdF+=~~bBZtAOzx@_f
z{(g$TI|m|E4&!vOR3Kz>NmQtF2O$w)LU?eH^AK?(**#7)YJ7I>&<v^t!X&v6m>XZ;
z<gex#a$`=IsWkv@;U0uG_-&Yo)cS@$aO*ItQ$?-R{Zn8Vo2vCAU--XOt;eU#EHJg;
z%pf4=^H1pP^3`#>^X4Bkr?Yu)lor?ZXtTtUK925{zO(2(#Trxft#NU+1^j!KjEJ_}
zttyj^u6aN{^NE3+pWWu=#TzB-{`+OCa}iL&tyaHz@ckX?zCBX>{(11if36MwOshoV
z$v@~6k_q?oZ$0Tb{sEJEi+Y#Pt=fz3m97G5Y49d|!VL&HJGlYSCK6!F3N;{pv!9RI
zNjqbGlGfCSCnKQfBsN5VW6K92k8`{k6CPQIr6ougL#i)!t|eGq%n8HL44it}O|fU?
z8)DFcm7ob+A7qRSrKm&jyu3m69A^ArhFSv6qj!41lyj1-H(G!s7%@^$5R#Z6$~kH;
z9jUgVv+PJ}>o@|P8L&psy_X3^v8#>9mI0&{3)Was>-(K~FObfvt~DOewjKGW_P%U{
z{Px?Z1mzWoeRdH7>|9L@?nd!^<N(8Ix1Cuz9AA)EgS#-_f56O+osa#QU(sRa+<L)$
ztY*GWpD!1ufp>1~qLNx8e-O-m>z+bhciWni3c4e|gc_X=Y@(TK2eqbRweV7Jy1f8F
zGi^B!m)Dr94gcJl{8hB@zgH}s?S`2Thu}nj&OuHvc;KKZVMo>Maux5y(6^;C=F|~@
zVZ1@s*o;n1^u6qJPdmsSG&<X(s|>c4N*D<appQI8^63$??*wkW5;rILWUlj8zdiEY
z{LJZaPwIHsg_KMI9KEuys#7H3w;GP{B7bU>${@DoTl@6|%ffc|ta;gK9s2bGBc-L$
zTlFH^+%fmiKhDc)hqm&rryD?)j=>f4<g$4z4B#S+n4p3iK5OSfiUa2ujxcSrr`N`s
zI*+__o}NNhx<LRWV%f@+u9^ijo29c<vJ8>lL-3m5^n%QaVTlQ(5P^Bz>Rer<sB%>f
zpD043Xk2AMVC~GArIV3IPOZpftsxj?hEK71HF8COXH>I1I4iBNuwQz~lEA?*_LYSl
zTc<0sE<vM+Tj0b=5}E|LXJKZvxzmW-vpNnsVigkU`q`i%78CGo9MUmD>luSOQxK8~
zb0^0Va2>S9fh@$_X+)iiv=94kg=pz0rX1s?Iyvxic@H$_8WlXWE?#6^N>L)f&Pj?v
z43PqYcwfv8Kou2d>L~PGKmb2Y9A>(s+}YCs<T@T$;9lVMQeg;?%v`i!R;V(hv=wk!
zNc%TJ6G<66z-|n2-TCknpdeip@lTatY0}e5x>x~&vs+S2i)R6MvqaLX#TuxiE|QRH
z3NCyh!G#OyZC9cU0Tq!wQmSZeMP!xd<%7UF>eO`9&Y#5N#10yCVpTW?)Ym}XLyjFL
ze8x;{X|yj#$Cw(8Rbp|&{&rSqqQhM1=oCl^8p8X+ftWG>LC=U4LvabnP^T6UZW8Rp
zF#3669L$O<BD(5lI6L+&A@50o`oBud?EolZ5PC{ziO7<rSJyM=`U4lxh=gb03{mW7
zgsj@^T8FoR45c2kLhgm#5KEFec!0cqIXLaK9GvFgnXiq2v+6Tr?T;NZUgDeXiqGh6
zqZ^c_<9vdlX?7hiWZaKj^olNyVRQ>Gh-M6|&4OU@Pd(l4d2X91t(eFnzw;zsXVE+}
zij0OaJ2TT_pP~Sk3>pAOK)Am^>Akjsz7U1N7SLGOc3(-lL~J96WA(|$F0^bxNJ)T^
z<S0Am&SQoUV!>?w%N~!Fq~lCtxEmpJMJeBa3BYOK20Ya!VvaJh6hEJZ<NG5<lMr|K
zO%dh|on>D**zck>0O`UE5rCPr7R14Icue~oSU-3aMn|t%8W*c{$p5bdzQjq-HTV+K
zXg_k%{y?B91&~_-c!rR}W8v!>>=C=k*!|Dlpzzl8#GjTBrR<Q;vLvKiaGdZgM0R!n
zsP_8_?L;_Go!uLSEZ57PrSJ)_2YkMS52Sn+h2n+EhhY^VYs@sU6V$~;>6E3Ci}%KH
z-?2XsnKS3`Bnm1=&vNpH@B?M5mMIzGqY}JO_QyqYb|)FSI7f)wOjyhydoYGRfYHhM
zVbEvH2o(nMqFExdLkopvC7Kvr^ewO<WT1i*=E<HTu8cR|M&xR+{kkDCr!SJ9&t4}w
zA5@`8nvN^)h+U*2j8*eEtJMDO1+j<Ux`<;G=IUaOVR-E4W}l6j2xJ8%VEAj$uy&xD
zeEE4uL5^99!e}zv(vy81Q`l-|@}1!BwGT^xS@79#aYgif#rUlm`RSu~9LE91h?$)$
znSPcGLd{iy(!nRFZh;3{hX{<*LJwQJA8kcV3`Vj}A!hH5z8NUNBZ{x`h76C+!#5%2
z6?{tj5-e3yqD3820Bt%O*~c6}0a#?e<tkLC;K5xAo#xkMQJm0t7M5h@J3!H#QmYl~
zR~PdU94cV%{>T-BPnbYg$*u?agyKiN1r}8+=OzWl|Hg$ubCg8_m}KRRj|R8u?4*53
z)8|Hwi}2`a;dN9b84PDhG2_&C(Rfb4RE$@ry|xL;&QazhCiCY&TkXgx6rNP|-n=Im
zBGM#a>^YeF2L6Z!$tcEDv}h+~+yzo|eaL5=sIQNzJ{St>?SPH4+rVXuHT)Bq6wz59
z!q?!PNM<&)3Vf<LJ_7gACJm<OWneeiKVMT$Oj#vL$ST!-dtr^BN`|b$o+9lCD@rTo
zyhwOM*}zj-RT)r2HkZ5dnnCTvm$AlG@R5}`@o0OK{KH8J3(l2-7Op9Xpx#Vf0_j57
zI%c?1VS}u!Baf}|gHJFeVAg3J4aOt5CxXU_b<D{}wbohealIRuB-5zb#yPqvC<&~_
zU`h@CagZnYDEsy8@Dh_PuD<1!^Q*zoy^&);ZIScPF;<3vEEoc&@3&#)veY@Id$-j|
zE5qTSu+lnD?-JQ{1t!u;{c3;yu0dqgykeH?oSRFgTDgjqLQUnXhz>lUyqyAuL7`4$
z|N1FE0Gls08h{Qg0+2<DfnSY^gQkj^VB&ch{Kh56myqdDak&8#BkA((y35gcF=4SJ
zzpco{K<gL;0}4t;l}P_iXXUl=`XYU=4zR59F5;O!D@&RsOrj+T1TbGRp&w8-H>L;J
z#n&ZBr;>_0Fb5W)5&tB-Sn?@9!$FB`Rh>iy5YkGW`>ZwNB2}%~GOVMjrTN@Sn7b%o
z!g`6fR%nyhZMCflPr-Lpx;PW*Cu=F@76^l07)5MIf;r90G*~`XmRG;A@Tj?2OxWK9
zhq$<&KQo!wibvz~9Ejj%hW}cHOG3GtL&~b`)8Li)ln%jLH7Ew`;lL!<AWaK$pB@Fg
z297YpaHD~XO%jpVq6<b+vd8}xTq8Lq1w;pQY#`mLaVsULB5O_-SPzXs2QdjAg9UKt
z0ArP4x!5veH-;XOYN+%!;tDl8%`@YW$&MGQ**STQ#v|~Qjk6+kTjGh8ZS8@8kgkj2
zMA-xhtz?QGTN2qj3_ZXu@(+dlnHB_ljD93*E2>qZ@hzsb_|Dmv>gU`aYUm+~z7tK&
zQ~z?gr`&YYt)?aJteBH<YB9V)wHl30om9%^C-^%`RJ)=YVW%$YH5*IDft(VSqoHx?
zg#mVRN^HRYl@25bjdX}L(r<xzCv>Q%fn&W%yw)UO)be(5AOjZ2p~0<G-&-3Hv?YeI
z&{)nagPu7H?^+r;s2#+NzGh2Fk%{t>ktrIH7J$NP8XO)jA}-eSgB2!=)*p!nCaFZn
z_xm6&*is0<MVpQV=j=v&)U6R!kzUap&5L9>A8EZ!p#km$8EpblvTRFM>(X$CriP{Z
zjww`K9QSTfb0kjafSLg2I#>&UKuE!lh>n}x(sf*1OGGp{*Rz?|#bLuGC(>t>JCvNo
zS4s^a3mzZ}47Q>c!xUAlMH4T{E8GwZC6(S9H~_S7JB{7O-j-Vt!_9bs!2WX+-!@cB
zSIG?HXfb%(sq!jZ1^R31u-*8BlBqD^SjC7h8R70#bc2z`sHkb$F4dS+J@9HFoRS;l
z?SN6h(p#?g6xb^#;1y^O)@O3cni`qWG-jZfG(w2FOIETe+C%X|(=JAcj|W;uM<bZy
zBPhN)-~-TP_rh6@k=T$s!-9K_Y7nOnlnQOc&WkEqJe|r~)P$CrK(%<oD#v6*J_+>&
z^vb470oCEJ9{+YXNHV)i7n;m@Ov(sl?pT*0hy^pz@MjsOQz!%asv~e+^It9)!$RyQ
z`Ba;x|5)ZaFkL~0q#*W<M7UJj?y)(8<>><1F>1$BLCnp4SG}MMtpD(_JY?v>)WXej
z82YMCL)roPfC5s<7*E~&6sh)PK-5C?6Na~yeTl0_vEc%u;%zF?6}i*s;Q{C!i`vTt
zcXGWDaGDB13O+sc*1ccV<6t$(sXesVBaS5M=c7?d?#t}0qQ}UNFT?bsP1uk`Pjf{-
z$JL~&q?#{*Iaae@0q)xgN_wH4K>MLv8dU02I#a8e1DH01%a@fo?wY;UfiU6`>AAdB
z=mb}EJHrm|9*^w^Q$xzzS<2%Zl4iJUwHgjXC85+75{)g`q`*bTbgbM~I42SPxO)Dz
zw?B1S$4AQ*oeq6HIlX8fRFKy-)aMHcbOAotg1(e2+CB@>UDn51>nd$rSTS!Zsec4x
zqbi#Jr_lVHOBPZsue7ym?W-(D0l?W`+*aFnb)`N2r2YMU)ms|?9Z-bx*Jy)-_#4p%
z4?loBVFmg(A}e&?6(A2$vC(7o3`lKk{2pNfo!+mC<P<IsnmK$b2fIeayjS$6X-`R=
zC9)3L<2vbI6Jf3t->-^yd4z?ZU9h6~1X4RHaiiJ*Yi8_%-Yf(`a8H=EP)phfqaj%1
z(4OezOn!=MS*yGdn8IqK9`39+AHDCww~eJk|03PqvrkiHTh&WKTgWgLZ>d;KPBB;W
zstl6;^gJ0-MqMtts7Se$mG4;)d%}lX{#qVHgZJZP65^bz49yi%T>>Y2#A01@KD+ik
z48XbI6Y(;d2j73j@lr7aztV{pJ^&&C=l(507qB$TXmK`qAU8Tl0T*TSagUULtTtiU
z-iuf_8HC+fy5zqgzEbg%#CP5xJu=>Q2#=Nw99g(Th^iEJT4E7I#+PM4#!!s<i;|!r
zVtY4M8{AD6v6hRg2JvfA`+wWxGz@Y78q+`g*F2xj#|#|^N|c!0ssK(8TwVjYx-lRT
z6o#OtFUb)rhu#K)Zdbl_g1X`&8C+N(<9N9G0CSJ(7CC+G^|3i~CUJ<b(1bif8ES>b
zx1<~^zf50ir9#kL$FhbC<)Jsi4It;pTj3C;Lk`+i&zV7$buLK1pCb(U=+*<?Dggcx
z`Vg8?a{}Rmf#k^QMfVJZ>{0ik{kC;_d9ko6sSeB7#TfN`FiIg=2{?1!tCbtxu)e}j
z^6uNq<BNLZ;JDp7x!|wfowprkE*#lcy`;Tc4IhfEnD01U5l}#cOf>u`yT_E=UdIXL
zHhKXDzd<M{YAO5ibb4#=)qgGv-u}-9gL4YDtya)-{CJ<%(m4P#i8EiNd9fT?gQn5i
zO&Zefrf(x}<RaKnKhC;HL;n*>?m$Pe8?BXVzjX^Wp-|K(?Y~zSGd7sORga$ubPBre
zt^W9xVUXO=z-Qu3#$YenG@CL*?~G8x)Tsr{;Sq7v1wn4dL8(BtiL>rNhy9`AFdeLu
zPkETNMZ_LzwnXsuMiCG`a0HptdAN63jBo^J=IKLUgci@kMm)(W(j!Z5N=9vn#?EZ~
z8qqRo??vM))Ue#@gT6|BzBfogR^hjlc?LDlHFe$1IOS}G57rV`fM@>s{QQ8$9!!fp
z7cs^s5$WTD#ua1sEZbNrAE$+O%&ZYu371?~9$2w)LZMGW4qI@+&ZhZHGQTp0dr9ao
z0(`JW6jpSDIZk;!dU5}~enKz+i5u3^utS%%ah8f!g{o?L#JKP&yz4<6GF<@gS1TK&
zakh!nzJ2Joh)RL5SX+r~2K62reAr+O_|2-}=I5Hkx1&6+9KV(?O#}4nK|C5ANIVuQ
z-lj#(e&ic^>J0>S<&GL={3Q)hnCH;IFLDe7d0Dmk6r*4w3k#Q+TR+F+vebH<H_E^f
zld4>U0u+Qp4Q;<mG_HvR{bf1g)RHwlW7Ktc+<1YagK3_TnUOkzb|hII!^M$X1!f8+
zrTi69P~9RWI^IJ1(PsOHoxB#Q?<|4bD&S2`cngvl99eV}M3U*PWbzVbVRVbZEv6~R
z2@P1vCPf^<(n8!z`?Li=Rl^}y#L3V;0FQyFZ6?x$ng(bW27{ZX9{@`Qc|pd>MotM#
z;GFomn2(9&yqTu61l+9Od3X!?WR{MJrB4ZkqL>hsP$Jj7e~lR3g%v1|2BQ(YtkW3a
zTtr7yN|W~vx+H7Ev}Wz!2K?K@gf^=KT!H%ibuv3s^HT&BKoGGypW6a_cmTo~rZm$^
zK>3sFW9K!>BTjD7MK-{M;>Dm)H>+lUDM@Ydv6Xh7V;<eb;ot51rwpbIwK((>PX;vq
zw2a+hnkUSu=sTJ1v3kV$z~J&cjn;~5h_S+*vomg$kC+!><)-Aqu@8zVcoR9ZZpc^~
zY9M9-LhD0Gh0U7@;48_@*<d?yJLhPplibt@KQwUbkUGRAw(oc;m&XQGP$E=}iZ?=E
zcMlva$pN+T`Hx)*utU`_{`P?cz*g7Ayx%9MMhn7#yX$}y&3g{u*QX~ZWG?_l=%jUU
z(K@U=g<?|2#1_&SQe?}FuGSj!8FL<zz@fzJlUJuW##p~{mGHr}&f$_kz(D3WOfr0x
zk~Rd?LIZthkiP+j-q;!W7@n(Q_I~R`@750%Qs=+VlR3iOgX0c+oUrSREFmb8o@$cU
zpUwfZipITR{6L2>JjzN?R5$+v0eTH7AVV-a^QuIZ@(zJ+>xzQc0daybMo6@`A-lwk
zFRkQ58GjDBwPuKS(--hU;xPnEXHFUDW^RH*)Iynr-vW!Dj|N>ku*nN`a&Cer1v`;9
zo;NT|<vZv61OcX=E)u2T$~eO-=N%!t4o1mmm@gWD5`if9P*Aa$7FQi$LY_GzF6FO-
za3?~dMLR!I_Z04jPR(F9LZSX9PpQ93btHDK*i{N7b0%mLa8_f-83q4f52zS5nIwh?
zK)@^?Xi8KQTh_TFXrnA4ZImQPChQgaH#~oEA*iXsI`<a%r7%{ee~jEl%mbb6Wng7O
zC3Bmwf9gn%lVo<^0W+8ZAg#6hFcPU=hCMU#&BCBBI9Yu8Loc`xPC*w85KfO;E~S)p
zlP^8iJRC7wNYTt@4bx;a5MMt=DyCm_;!w^@GMuaZvBCBeD^E2(o|J{wY(K8>IEQ|1
zmL4;WU>ZJ2C!?8tD?y9he$ztKD)D$e?OpKJLfQ|-OZ>d^i^s>oqCE3ULV^(I%R4;P
zT5tnTKxiH9#*~P{Sd9_;w5C|FzeTcFae?QP_+8FlgUHFeb*@%h+S81HNp<1ss7%S{
z(PQ5WMW90(jCp7skH?hsLu4G<EVXO=D)@E~Ivynh2rqyd<>P46UIi%-^gqC1W$5W@
z4z1OBshiajx`dZSahIia;X&y9C789zN@5b_nd5n{la!PdPL%kxVtHgVPLyJLrKIVD
zac`~hfT9DcTs6z-Xx!v6Z`&sb2w18dcA8ub;Z;6suhhoK{DnA7%}N+jya3?{`6>~=
zd-K9c?rVRRiXHaH=I!iHm2)1|k%Jmo)!@m651u5h`BLIVQKqvRw7w2Hw;>H;x&oAd
z_(+hExD8M1%;gzZGRVunsNm&AmB(u2XbcPn5*Y+Ta<$2(FJBsk4{$vqfNpJ-PWEDf
z6<S4z6ymF^MOOHj32%eQx@M7j%Igd8WlQA&_^fn_{L@oKq4Wcb7aU>^7+a6wAnlBX
zq#!9T5<Nom3^hO=C5J?XeRcGz$-8V)joPWxI=$rfLNtv#1bbjQEq96e9qc#J-|%5H
zq8D26f;;10Bf6Sm3`R7&N&Dh~i?Sy4gb)FvcnUlh7F67+suiSyfvLYR<9r^SAN=s@
z@~Hc^`D6F&ywyBDK0Q!pK^NGFcAuKR?uCk%XJq%OdiyJ)h2;I3{e2@avPx$<_%K4N
z)Aqg6GDE<HY8#i@Yp%Q_FG5>#w<pg$cjeYxKii9Z78`C4xq@Wyo#Y6MtV~NKQ<3T9
zCA{~FHaV|snXrZ;_Jdj7@S0WyNd%70OF01TllBF^ffaAwUqMaav{3P;_-AEYJ}Uay
z`h72ZiGsUcjtZ;-0kB9q@~KA9!F+$E>sHSFOA^Bw=C6e8gcznTmQx{KoNus=4F1(T
zo+?2p;lM(d%_kn81Ud@%A$V*><`dOaACm=oIC^P@gN;!NE^^P{&hmmMO5p1O@YGtn
zCuwj|hoAFoj6*%(*<qh1D%O@KKwQ>7bw1<Y@J%w~;;JD8Rs9<og}*IVWWu$e;vS@0
zK(7gAz*q5fntCeEfR4Kn?TDJm?i1LLLD7$A{$Lsrj-Ll^rR<aR3#b&(sO^|zP@kk_
zxfE5aEDWub81b{FK7?_bw1<{GBes22ME>+bNFd}*L|g%5Cp0&-L|A4XSj*3SB~Z*D
zS^n>MGc@~ER9uT!(>xvkcO!QLf7~E@2AzNF@PpHFTh)qZiqG2^q|fxXtqiO_8(LpI
zNY#meAAosP(~(-G&@tR3J}V?R*H8lvbx)FykSdnqs3|tB%9$nCl~jj6#G{&<Gl3jB
z^y-IV+{7QEDwu*oC){uf1CZ^7Fqc{nP$4rMlm{%MtX@^hSZfwft%V%>SMzi<aO6}{
z^K2pWfKYG9tKx+aBc5bE#{*eP76zIf)C-hP33SHeelwWXJQ~qJeF$E9p^}-ES#{gc
z3$)nVc}xQ6HBO#(#{g^s;6<B_5wYl|!QLCduG`Kij(Xf_iro36A>)O%Uf9^sI?k<T
zB>@X4*%`w^9OYP34#x7rb}~CTy<prrX)DES;nS<c#!j)r)-)!9<E>*wczIcF>YhTp
zoCfD9f5Qu{m|C?R7%#OgFa{fl;YM2|DOABfVU}lwz7{5ps#Q=uqYN8)zV3a!gI^!`
zU+?1AWB=<t{JLj<Eglv)3Oo5OvE_E0iOd<bsXpGRbHaoY2?FD0IziJlIVmI=*fR!=
zfE@%g!)lix$?#lIx)F9{B@i={(8SO5bSese_9KwCNKFTq5e5OC;fP3ZyG|57o?A&s
zjMtIbNrK>4`x#6hQ4Zm?Q)xIx!Pzv^ON&ib*Q-udp=*2TH#T=%d{JYoBgUt^H$Trt
z#pZ8{C)oT26ygTCUC|p2q1i>NqW!o31!~jz@k*v@Gn?|$nfjrqee1XNZK<(uz1HgH
zHdzZsPW&#ONDwLHS!n|WoM=06d}R~;oBg$)1jV@-+@M!UEDqsbbdCmn@7$$vidB{K
z3-&7t_WgpAI++T}z-`!Dni*zKFUJ|+_vW&9Sk>)>Qg{!Bp}VClemoBFXkD0f&z`8`
z`zW>LI0W2Ztx=Y9Y&m%f0*`^&cAY=WY6KWDD1C~*iJLr#o#kpgKlZCGB_FfW&RNsa
zsk!`_=;%S%x4<OILCays{klg`biTIV9H&P+VVmVWfv8G}Gay!k08Q>EQ?!wYsIe6t
z=}>g}PKdLZ@8=Uy1EROd)S23<LB^U(`s6Iu+`<Z}o<GTH{EH9J$(Z}Q_1a6vaKJ`2
zoq(P<6!yo?@*&yX8W2k_a0J{2nM13#Ol+#?uc#xje8)aXWe71Rkn1oD#i<K+%7#8;
zq%cO~{kodgI*yY;#Md!?X<Zso%}!G|dYUVMhG;MaYl6V7@l7(CfIT;#mVE(mLhu?|
zjCH$cXKrkKkblR)G(5S=X6S#Vwf7NEuwDu2#J7A=*d)L-(`<kK^%w1V-^i*^(o0D7
zWGJv;8ysiTU*QF$@o4P;(V%owUGxNnR8|3aJD0jfKY!c45<dlkW0FP;gNNs2JzEbb
zo@TW8C?bcKKCN1I_oh%g(FP5j=Fii35q(>+&gm~MmrP%i;O#7am;sRDwlfJ`$jtik
z{?7LHwqL^oJvO!MAMBdm2o+12;r}z)$S8}N-;2dcWKKRQDbn}L^aF)lRwHw{4Bc6&
zw?Io-J_8fY4oSX_l8QX5rsUBgKGb>OBsCx?5pxqDekwU!C5lhFLbqAobU%lYukS>X
z5Kwmd(z>Vo)CPv2*926i{_&z|NWc>vx$535$)NzA9`V%S*ufnq87!%7x$Ph%8oFGU
zf~btb;h8aX@CtkO`TL+kONwh!52g}<_R)&HrJrudFX}p<Bv$W~Tk)x_3$VbwqH&td
zRg*V)R8z7ca5Osl5=jK7+ZB`{OXf2gOhv^d%j0AU?q+>-mmtp(hGIio9V!ob2$&Ge
z9aWmSIbCMzT)8f3<U2LfVayhyJglg-PA^J`1D*<RbJs9iYV?rn^>*QA4hG*vJL>xD
zbWZN_%T!?XV#*aJ>Z@oEoRe;`HY+=9KS)W6cEY+7@clv$Ea;3MS&gA+1#p9wCbL(t
zD_PN1x#T0~royH$n}P8nHY0oBJGa$t*u#$>n426V`+kh+Tb*9+@3I#lj|>0{r4@0j
zgL4I~S-AtR^I}$S=t+Z15uAOsjF0`Xh)=53>Bg>hEv0}YK2+ch14S@xs)J>^fh$G%
z-9gKpU5x~go+uYzo8;q!ldtN*gQrhE8s#@S{(ZyRb$=W+9<HH`s@?$nbcZ;!`crS~
z&(2R@ssFq_?R45_-PXy)dArr=o`I&SdGLMf0uT~UFPg{vXD3+y1>!Eny>tXipt_<Y
zt-}NzUoc0jp0&ld-8Q5Z{!oakqAokpeI=B??VcW?&bXshk~~1w<IcAJ(ix!oX;*#s
z08n+Q1%kiTZMcU%E+8mFpM+mQ2h2AhsuhSWV2B$WGX8?g=u=W?gIb+$4qj6{lIj{3
z=re|qtwcG0&8KRuI724G_S-7X$J^gj-0=oS#^6ITL@;<oG-S*IeMFJG(i$52@MwCA
z&~Y*%Dn5RbGmKD_IbCpd_;}pjHp7X9ebk3Mmp#XTOMSF;;E|pQQxwRYE-y~37jwtV
zo$jT6TCQ!ZU3v*I8A*<M{)MDg?S`cU;=0eHy}D^<uk`y%i<(;n&6k!|G*cY{RdWn!
z>g1o9WDh3F+P}B))Tl8TAU-$gWYFi3fxf6Y^@VBHd447c&!mSMHV{%FZw8LEAAd~8
z>ZG$QNCv{ZFF3a1zVi+}m6hyh363%kN>Qx?J+=4GBBq7Y)7&5;km3xigEfKl&-m;(
z{;)jrKPGS+VY?QTwn>JlZ}73WXRmSHNY{koU19#IGjS(EApv4&&}0f>3{8A#%f=?S
z?fEoul_oU!=ad<%T&ccjacJ!9!qF!e4o7JavSuT%E0fmtapN`Z3~$9`Fc4axCE2RX
zE)*FdYPgDp1_6=n9KkX2u|xGnVc#4$^Jp~0)A)j~`^KJaXSJ9+LUM7~`sYF-z`|s=
zwz+AG`Ht<^SYXdFA>sGQ?LvF6HFJ`CQM0zdjH|J@Ql?Pal=76AE8A6_-QESwz)M`u
z`Wz%<H~d)ga#C>%hO*=gMdLKsC&u1u57jV5IzKeaLg6Io&}v1X%NeN+!~L{_s;Ggz
zP&P_3K#iXWMb{Q=Cck#MJt?Q1Y$$CU#fN}G+AjT|9vxb;g*+Pg_TAcf>UCa_Kq7%f
z3sMW4-d&44jnD^6lcvbYpNu4Uh4EVrXoSk8DkLIvT{bsK#!ULx8H;8lLroQ@J0rN|
z0$GlOv&%AUP{}vockh5>YasB)Mr5=SnwHMZLRBA-5bItyV9NEXlLUF#(^(Lh#8F}e
z8+F3-%u?xZtqKC!^t)^77w|mm;xr^}`<U54#cmB8qU=0i9%U-~s>m<CzY2Z-2|g?E
zS?ad}XU$<|UY32XSMg`D%a{FCDqK@4@SK;_my1+g`Rhg1iC|S#U+q*u^WLPxC#&Lg
zSqJ-_dMZE(LeSvwzKH@?(EEia1V1bkBxZgJ-3^QVEl>>u_mt9IDBd3&y(E*lWo2Y0
z(Qit1Z=LcIk+2VoJ=5QvLmYGuqGEEd&XH_z$Q!uwy9_R{4jBd1{TD{B+B$HOzlDWU
zZzAxmp11qohgr2Y*EO%sGoy~JD746o6!6N@{#Z^yawR4YVppT<YH|tm+I<93N?NDn
zwq=dnSFGX!>6df{Mw3J8J;xg{Q#(3P%!kC)fG)kzYCH@zKvo8tE5!`c(?ohD!m0xB
zt|$e-idn4Tgd{P8qh9VP_FjAi2_*u$j#9*f;Di$xZI9U|5W<KQW`(Go+{RhSCE7s1
z;1kbban6iyU|yIar-r$6BpHvSu^^`_O38qz{=7<n`>{R)r>fbyTAQmm<TuoMq{8yz
zA;p{|ogn-RHsB4CVVbEgd&wxjdCDydjeB*j$m2n?bJ1-o>c06hYAW`Qpiy*lTj2`F
zrw7er$`aO*nyjG!`?IJ&Hu*b%CnZ3Ff29#sjA47h?@pIHVgJuFwVO56qT{;#zvS_0
zIC+3LM4tpJ6)L_$Rn=*+EGe*J)kB#i;Jq0Ms-XKmM1tqe&|EMC0dqIrJ^@JZnp>hY
zvA|DuQb1>juz=PWLrd_xzc<?IWI4A6lcnCl(^V)f;XLawQK5)K^7;qoN_Ae)P0lst
zs$VqaGRe9~RODfYt!D(p8#17I0MqoRVC#mBYK*;9GOXEw%gbEvwP8*}Rk6v-{c;JY
zwLxB1NB1!4tDPD!0J4i9Y_O6`1zj9r7gL&}BlyeBmy_AlZO|>pUrM=U>X0h<?`NNt
z9SL$Hd>|lX^l^00nf1NEIxj`l);viWu6ik&wys--lU~U62w%vs0ph5N_gpl2mVGs-
zoO4294P7%ZW;N&RZ`Ad<ErmImIudl{uw8U$&?!K$%is(IoRoRur7PoHyWhXE8e9=W
z9M5GVbfyE&#|yB*LoGC{Nt#R02we=>I#EN`LzLIyVP(Ob1$Es0szN|YHHk`BLya$h
z7)J@6H~H(}$*41P&82*@@8lmS1^2Ku9WC#Oy_(J9{%lK_K&LVzmy`kLz@l$_`pM`7
zE!09PILkO|ft|4K4Ov`?9LOo;;OSR{Buy!hjUxa#t*Swn@>P(@yLhkX%1Ly@tPj55
zxe0pH;MD#D2A+R4dVMs;>0;!Jl^&qGQfOSain|iX0nyO^2s<QIom#{lD@UQa$ElRG
zspNfw%mm6s;zMYDTSv5044x@xj@mL<x}4L=ic4wue#R(VeZ}ZCtfU<TcahUN1-OtB
zKm6HtSE!8131$b*-(m0BowQ>2D}Z<#77)$?uk<B|!j@+;L+Ci})~gJN{Pl%zwtV-k
zuj=lxERo>=#an(%Bf@O``|-MO5hyem7+b<wZ8(Uhl^`Nv{<q=4tXA;K*GW7HIiY<X
zUiq$PnDKMJFoQ`u0KDZMKneu7$PlD07!n<L+a?<d5`?*p;sI!bEU&IgbXwJt0jaG*
zz195WKc3s<Gjb<x)6`kUZF0%Ga+}V<t>898$i5yj?;SZk8SLFTy;4oxvn<tOo{dY@
z!x+Das~Kx`9zKojLx?F$843%vCk?~OfRmqQ?(lV_u(^a(oYRE8@5v8qrZK7ujJ9q7
ztX@9)z#2Ys*+HiywPJ;67d6ZjBPOy6hiU2pYHDj2^&BO;>p}PQdkGmZEusR~g7s6y
zTIc7iG&K(WuFJlm$GlA!`31HJus6kwX{4;(Qu=%+LL5@DVcKwWGI(|Y{T!E<N5nwy
zvq~|ndBauL>ZuUdL96CiHp)*I59>R-ou~9nR=iNwg3&_hl`*$S58(8BIpdq3^JA%q
ztt4USRnDgk!dw8H6a<!>A(GRXx~>gU^owH^Tq#dQ26<toIfL#Y4}jRs!UnM0z;KRE
zZUoe50bdtm$Q4AnV-S`Uda!$&UFU@z>Vkp^c%zcT0QgX_fK;%vD5Z%ORA;FA`Bu{B
zYR<&rOw@R*=<EX8KVr0WH6z`Aq0@l+VwMoumr_%k;`1+AnQ9}kWWl?X@5`2($ks)2
zvyyhF=tPY&4QG+pNQZFDIRBCr<PLgoZPEdEOP$Pl=7`~(yMpfnIHob&g%!H*XT#Cs
z>*e6%Q%V3%z6H=8Si~@Al0g8V#|Ez<gSSHjBw?D*rv%_0z^lZL?bKz6rSUmrvd_ZC
zhV!>+hd%*GV3-9b$52Ciy_Ui(k511ITFry+LCzIRF+a`he?=*A#&d9$v66-qmIcm!
zb75<xA@m$7t})LL<on8}iWT!V9Dq>d;pJ_Htm63;!e<;uk&2+wRf0)nmY+igSk)*U
zRB-5mB^{ZQ=B`@3L9hcA$|8Mmzldg``V^OJb)TqhD5v}Tdu~_-wo6C>5Z*@4_4Wyy
zr)ol0s(;pflO%Wl9J}=cyg-trhN6E8jMc;B<?4aJERaq%SayFHr1*+2y?;9AWobVf
z&X)0G7i8WwY>Z>}HM_~Vys&`-7v(_mcJZ%4c!N?Cj^eG{LP_`LNhSSJoQ{)0mmM)9
zU6T<qOza^7v2-D)kX=fX?{Ak;Z;oWv@7|FZ5zy<>%hG8AyLM2Y+aNw%`?6a8QIxMp
z-C5ZF1|vOd;TH}rJdCdQ4)aE~i`a%0ky9Q8<Z7gGkjobGRH@UIG=n|fQ{!F?8Udo0
z2Fr0AVfAg6rD7I`bBiLxR4)NINGl_mi@Ic(HG)3^Pa{_KphFJ@0`_NfbfQ&_Nmf%Q
zn9*+@f%r*PJ1AkT!SdOhMXEz__^>pDTbMf2fi}5!hieF3k>{mQ6z7I4OQ+<>qiaVx
zO`y8@(IClE;yDp29&t~p)7m$q(HuaaRbTiGeNl}e?|g6Q8sd<{|J6g+e}!5rfS<r8
zoP?vTU76vU42(R0yYQW$FgOWUL(JPq-3B1UOmWJ=L7%=OtL#d75_F1SOBUxqDgE~O
z*BBoFxt`)BCwYXKz76slok9dPTKqjkZuT&GPKV!l*TvwTNp*C2t(FXGo-|RfhJYcK
z1t=1~URph*r%VjT5oVlWBpq~(`dYsW?7?rgJlu`%lC?TQ`m)18v`#-I&|Bb4xaY#!
zR12lWU4}0=;<laF(wve{9CcuazT{#TmfSa=+-b~9E)rxk!}$7{b<y>O!YCoibV&Up
zExXY%+YsMnG|>?UT$`+G&@AY}(QTZOwGq>W;z%;ZoLVdav=fi6Ak_AHj9LqDndJyP
zh$hF7a>RUBw>F90S4^VKqD_|{+<b`>!)Wl*v(|ND;5VXO|6+X}T3Svau%@WcI<0wN
znK|c<BDI5PoQ_6mkpOSKB==OA?poxw=ELE+A@cRjDkCR1waW6=>q`mu1qLL*;bLMd
z$`M=%r0DD!Zriy<6k!%x^MA<65%X05mxi7sl<V8pb@9`p&Y*CcVvccJ5-)Bi^Q`uL
z;Irmq1Bv;*b9{Qy31S41f5e5F?5h+6SW66OM868)PuTmm6c7xxe*X2B(7R#IYq`7&
z)b{*EK&YvT3R~n8dtU<cB?~>_t0OAw4RFA76#HQmf<ECS_r>9v-ZsdC2~*SdZq56G
z&u^?*XL~A$<uCj0oDXV{GfI`toJg@-iXR)I)t1B>Pkrlzt$Z<Jfa~+kfH^E?gJ1fL
z@siAQzkVX)6+9v<wiP%<%P0V+;##!UOE}?$tRr<-{Q^{kC9jx}c~Qz`tF@B0(Tej5
z9wPtHTumv6PEJiV|81XuPvNseR&BBP!o^urBYD3jo_^Yz(J)E4P3+4o`G~m7s<7c%
zoG1^Z|InfdPD2|>!G<%wtr~RzTf-=2Zbe=Kw52n3K*GYWMlYGo&_?1TOHxkP@g$xa
zry+9E0K!q@dgCO{iiQvx27pLziLjV-Gdc{XDHzK@pm1K>qN{*rb)+0Ms2;c4I9LBq
z7=4Hd_!XzWb4SZYeVsYXXc>A*KL&DjE$P`~@|Nlo9K-<4N%PSxos1G$GzjDqT@I}r
z)WV%ZmI|ln7GO9|%O8L#D0ioG{$dR8AQ{CJf(JTU1R5C`&^g;~24+`cG%4#0=KWJG
zh$JRi+&eUKT)^_4(jkKpk|B$E!uJW8ux`@K_c#z}&~r6@$7rQ*N;JN;0YFiQ)}Z-n
zeD8qz(MgZjEYyEzLEut$#}k#M7nou^iG6v9&GQUEhJaa|_*LDN!mLt0pXtSuEJ!k=
zRZvoWwnh+KQDFwX5NqQwCkFHv3IJE~wT{N|B6m<=I#5JS=v=vS-LF$BvH8-%X;tr|
z%&(5yBr&nPV(`_n#N54G*-}Dd#&yvntow&|#3n+z3Zwigy1Bk(Sr}ET?4vDe00=1@
zCt64%O*uI^&pd@Whtx}0t}*@vMvW=D;r^ie5d0yCRO>SwmA=Ioq*w?Cm(PpQt+~=p
zdWU@azJTRW)vu5}0()^f)E*76;Q7!RuuNq(ohK4HxKk(kp2P(xS9G|iGa(u#CWcTg
zp@Ng5DAD@}Hqf+DkQ2H<VZ_nN=}Al4N3K(>w&H5eP27mrC~eg+1%p3pX>DN|qY2f0
zB{zCd`XFgna$wX{JvaE7xI&!tF(iDJ<uBP|6<2}C<u`h3qKLIhdO2X<h0>89fYg&M
zqjNB(#Hn${%?R6Z&^);?CcyL7@#$*-|7xEeMl2yJ!W&NtUdz3@<RNUZ9}I6d?yj1a
zfLEAj7{@<k;2L`fLx=*9PVPnM$$!y)+d93xV0r(B!o@Kz7E{?{;s8odEse+_z;~h`
zq%m3_x;un<RrWzMhhIObatf|(2A>X>bc10D0#atlg@Ahs`Gv;lJXEo|8&w0b6Qv*^
z5RXi*%sNrPbt?x$$sDHGKZh7{vQ0H1ZRwIEJ<K(#^PTo1PBjb+v07i@X!&*0nTWF-
ze#H2CF0n}KaW8tfy}fO0AOt^yhu#1U8qUF-X3Y0O2zrh+0Skom)oR9F*_$qxvuHlD
z<@oAtIum@p!udB3lVj3ZX$UWPQqOD|1qlzS4B_GfKBKIOb?+%HxTLI7q=86=s1>eq
zf+?K&@6Rm9#!OIj3_Fa+NRwDtV`(U+_DhTHqvKnvX=^C`^chw$Td`Au&DTc=j56M-
z@{DH``&07{F>sgR%{y#fG`r2$Ed$%5&br!)H3wk_G1M&GBPRw!p&#6vZ@{<I7pT|H
zFwoW{0gl$?05BW0DFBe0!?-`or|VwieyK&uma(;Fgj)-rdBH5-HQN_TzUv;gj+;M~
zrur^Uwf>7(Xjc5SQAB2D8Z$6zmg3GsX#IHBK5reCIyVBRdez30833L^_Q6k|<PWD8
ztxn}6Vf%pdXI4ir75V*xmyvZy6$2O~!&u2RrS>l~0wv(f3?aM~Es)yEqn(E6ED+Dv
z4zvbwp7~rJrTv8AREX2*Sjl35&p?9V5T0b6stfX*jFGm3K;+qx$bat!Sx588T}|U&
zVKFl6g`&~Lb;KG)Xh&lavUWbXA^F!<XqLPUQ-JXB;p6#@Bar561}H*p|5eV1v(z+e
zD%gTpdi><%os;zUQ$C-v)yfvkEI4*Y?8--jYAGsgbF=&atlECumk@v8VnKkgk||}F
zVagJ(tWkB684RrHbtbZi7P~Gp#jA1|D{e$_ng^&{kVr^UMaKnea@Zr&>-+9XXlo5o
z0L)Ptt(T+mYsr8mnz3XArE9->;0gS5b1=Z4Y1)lnOSUJY`BUsDMfx$fjw%iVm*y`l
zm8G=6o_bAHB9-Im^e}}y<Yqk|)T1+eitWHs!H>@M5xzwVOCA<RfRN`_eKZoLy7Mql
zJCs(3y3+peftuzPSa%S6BnWF_js0QWfP~$|0WVeH6x7wef`Ae5lS<;L8NBWrrJ}c3
z)5x;RL}B9fFw)p^AjYYi^C$Kb$|eZ-vzWRe9t+--p+o2kli9GR7CT+V7d;gzGUvzJ
z8WmIB3FkDAE!SP(?$sDEnK3)fe8*DUh4J=Bl@tm6Y#0(DN%EvSaw<UsrQxGQa5Xkj
z3n>t6a;BMc7-cuUN<5w&)V^JUqOdqJpMTY?D;9@hMq5Sp)h>HXy$INjz+LJ-tjfJ;
z$JC=Urn%yPex2NiDVKWyk;Qxh71cHCA|n%;FN+`z`b!bw=`Bwx$i2_<LEa@6sat@e
zKKk}W^nV?lJYd2d8#mc7T&|v~h(I-B=|AEZM&=<%G2&V@Cl0~!ilspkjO0Bj>J1Hm
zZ+Yospb4~xt>eEyHyIl*a_07C9EhFU+EGw4)P4Nt3m&gJ@Nb(x)@&hsW4EyjX(k+d
zv37qs$I+yO+Hb7(+@2I8@?r1HV$pG9*XS*sTF)aIi`UdH%9*+kv)}4ByXc06vwt?V
z)npi{Fqf#Fj3K{}D2q4HSgm1CT~*O;%MuU(wqdsjirc2HI^lt$K<^w{sMk^5ol`>%
z-Ta7f<{FV$v_e4!x|u!fz;&_&A<`(x9Ck_@1h{4EnG%oAa6jrXq~xw*_jdCxE?|@l
zm+eWIOZ}C~vS#$PM`D}~e7^*&sE(N-NXuF%XM1y;Jh7Z%ZO92>Dh{z)(`a$@f|y(A
zJY`zdbYmeVZg9jVu#d2~qK0=ge5zScS_bUMOSKYVX$x9gW@CkvK=RI%k-TjRA<yf;
zm%8N$8D&SvSrPT|oSW`Nbly5U?shJk7icd%X&qd&4jsHw8PW?;J9KAtX=<LOACVU5
zS5Nf+BgErV|BUgzyLo8!UhHV%QVNQ`W4|~lP=t0-A76JHw|s@ixxTu_`^luOKz;<e
zjSDsspt@ODNDD;1wE8yBr9Gp?_KBlSXUHO=z7|C^X{$t$7@JYNsK9l~*-E`SFBj4J
zdU-WB7d{Tw(<`i;X3|m$jZ(}9CHyJl&JznNY8pK^)YjPW%4{&67l!IdVd}PbJ5jO}
z`<?mX^#cD}rb9A<E_ZFQKW5zwEvuRHWgjL&MaKpe|C;6lK2nMkGlzMRgBC^{E+1Y!
z=onfio<Tv+*GVtd+j-KUO^4{3xR-?^(I?a7Lz>SE^U{g-NhT_cl*K<?n_LrY-Ow3W
z6osBoSVfk5=UQ{rFMW2S>@2;A!?ro{d(NaEZf`4A8WQ!TACm#A@DzcC?`<O6K+7Q^
zH5Dep*mW+#RYXjA)z3H32AX^cW?riYXE#ZbDK;FI$?s<28{^K)<h5F{0z>+*T%PUb
zA?v$!a#+<4J_H#_SL{i^E`6|4`4ou0y0s2vfc711_Kua61tM8+Nx-)P3K|2IohXG}
zMkq^)<Z_|bF!hwgUj*GV)SEd;)UY62^9~D-2kM@Sg}K5?+Ak0<oTSf67e=)z28Wgu
zbXh1Mmax^Uf<{B`%q!lLXLp?+o~-``g_rwdc_LoW*?EPa6bvWC<Tm1}f(ykjMalKn
zvk9!#aNPg;4Pal8KLS*#Z+T97D=gclUbeebMGqd21XsFvxL583U5AJX;X6=(E^7{Y
zAX$xu!3Dv0TfC^u9kGz=92YHH%Laf8a*fpAskGzzd=9N15Rn8Oew>54qCU+5q+J@Q
zLo`OhwPZ<jK1Vcx%jm`3h`6)awH1X{?U`0cz9#X`!il;EP77<7Mj6RhmevIinsJf9
z!cyl%iGQpSBOP9~?71k^C`9W$Wlx1pC?sK#GU{fvCjezoF6=X)p)>E(CF8$^c}Kdm
zbY-w%-N`bg8g=3m+!gQgy%+W{K7kDKC_^=u`W>GW0iXk;Z(UAAin6kl$(ka7bPPk@
z#Wa|PJ*NfweJiky6}RM$K^8u;X2R)~^B)f1C`TTa*Es;0y&CuG*khLx2ya66*vW{W
zgFT5YWXOsyWI#od`qaU*C3oqto5g!$ZH19|5C0t~z#>lBb|kj*Q7mpcS=ooX^5oOg
zO$hx4BttgF^_2FH^&bgETmXYozat;LQ)+cZ2lNHX_sIB(VKoA#Bz??X>IK}|t+R$a
zyQlxwC+qjJ%<sg82u98wjv`4aFJHLkjk>GQduMqmQ2{L>4#@$|()qgzt-G*{N2SAd
zlV?w(_WD???9%d@m(q*h_VKM7yFwBToz{F9CXTX9qUChrcviV={)-uEsC*v-4Smw1
zWcN}~1`)WIoZzCE_xnoJg3KDyVc;DKUfRGkoVUqQ_(Cp{X;Mre6D}vjG%;liU*M?5
z;j`3TK_LEped8xRN$5SJlLmZYAT|=B$LZBn{OJ*x%l%d&8I*twn?wvUdR=M9MzpFp
zaTo;rC&A-=m^cS>i5gQxeGVT{2V#x7Ox7aH&mtn2Bn%15rxV5hg5HPw0FBCUM$Vv0
z#APfbX2m}*>{=K?3^ka1p2#pgNcsTLAUrrrV}k9}lXayC4V>p71$0n&5Na~Px+YB|
zoESfK>!=<~^Gq>HG8PPmAm3BV5&K=)m@l5qZB`wlM+4GjlGX^x%mLz%acPT}xC2|m
z5i7daqdFOZP|R{fj1%hvbVcu>c2h@RfP!@{BJ9YTke3okS}B3Gq*Frbql}I^=?*!8
zP@-*Z;=zRHq)`VipRzUotz3s1#_FU)N}HqF)-lbixGaO7DcRI=;5hzBD%?V!X<ny~
z7$BgHHFC6ToLk8_RMc(BQzvY8q2!taGMp+w&@!T;DqP=kSk~lYJWeyj9Mw5nWhM)K
z9n9)*PEMYc<Hgm8^7lN}icp%{DwnQ?z<@GJr}|sH>Vp)YQvvRT_Eyj01NO05GKqGc
zva2&+Okwf$gMel&4(-U_FXUOM?AOL-clv$Vu?&0N4fLurB2f-a=ugoLL*e{Xv+`Nj
zo4DDFr_(f<uFILA=M@^3BA(xHl@}b8D8&NZt`ZI8T7j2`_h5POKp33PXTchEeQrd)
zfPVB@dS0?W>B)9^Jt{U~Pcdx+MR?O81R0wH<y;H~v=>G;9_Nxdi*{iJlBUKV$t@Qy
z(T)q$DkQ*a#+nQuj4mT<W?<OJTFD=TQWz6*07NblDFM7d#v6+DJ7n%Vp0T{IgdE*H
z5>Hz-PKIs8wxin>2OLq}V_~$@sR^2qhR`Do^9$zoDCli5a4mXXTTydnMJuHyARp&6
z$P>DKFgg2~64O1z4q9|gtMY0VMuo&c()@L<b<<^?9Fj$IHqUe*p)_$FPbLYUhwFGc
zM(Y3uw$LwzZM10<Q8J-J{~a=i>Dvm<dKN_n54x^?>QOrNq${1nj)|7Uy4au<29vU3
zF>DwMC7%r)H;Si-N06ftgF`9EDCmXuGN!4cHLksFzdi>6_u`ZTw~UqNhDRvF1ztd>
zz+*k{)bZr7p-`_0Dgf_IIWclMYZ)UuGwEaG9d|`7P2$qLqGn#9X6%h2A-l{gFbfqP
zxeE|v9RuMmLEt{gvm^3ip+H<afW1VAG1F`HK%uPlYbj40tOvjGI{%yY;K8;v2LL}>
zE%P#5Ok<AoC`2)Y3>~wcdRR_mO=NJ>%qj33U7R7(z@#x&Lk7MKn!!pUB7DM?x2uF$
ztx}PfM2EatuNU%=Lh7G_bscptzTL(F)?mIf9nZ(sVG>3nvtsV#owA$bC#!VY%*lEY
z;0xvBvl`a+8#cqMBRxRgf$_x72S`D}VK5x)qnB)jvVL|JHOB3-2U2-}PCqV2C5-Y}
zslxAHh5r&QJN$oT8bOD<dGJ(wNjt~E0j!R7Y665!)2B*5<udk$!H+J*yxM`q=ANNE
zqT9*mfJ6WXN}M6YKscCVmIM>*0(AQd<4h&8(0YVXf{PV17wcrAJ}3nN5~!wTX(2oc
z=cMvo+CXnFZ%nSWcfJdWAxqX)hC<x6`C^l*lnBL3D?|g-xkTjKrzd2Ju-f|C_XA=O
zfB&tZoGpk%r``=?4qpkuYVECNhakYjlkyRA#M8scygYm{69mKWijxT8i|esGBd4u2
z5Kvl^`d5u_Qn(rfK1h5LOGZ<PN4P97_CZ|~=~$K<fxlzO*M4Dpe{0#1g51$dMD!cU
z4A-3vsC@b?n_L7QiFEpbQQ?HiU`daAIhoM7DfXQby$-4G1l+y?YFUC+EcC5BnjoY|
zf0ROyn#5`o)SKlk?gyiY%a%ToM>-;$+js{&vLP4PP0$ms0je7ex#h@k@Ww^K0^6bN
z(?tag<5}~v(>fG26s-cd*|VZU-*VhQ_`2-SV|z_n%{{<?9Knuaw*Vv`TuWR%IfzO_
zQ1b7XIh|4X)yEEpAg^p>s&`n@T!ch{LK`1lO9f}#=m3&sPNDw#xfTUu-wNGB+$G+9
z0ZV|kdzfg3K)7c)K@e*Z*T%*Y{T{RCg%0i)?$gyk9mx_AD3~JIA5x&S&QroT6_}F%
zqa~+LE#Ls$knX{8yLEEWkxb-i;qHhIP=c^Xx>_-KH^a3dI0j^3)b|udrOI$<{vlm{
z?O8iY$Ek6)EmIh~J6t+UQi6x;OwrbY{6_NOEXnB73BFZBpEB4XX^D;-{?xF2XEd@9
z*v{cB4ZGB-;Gf_EX&hh*$>PQF&ZV3Pj#r30WS^@zADIpD0?rCQ=&CUI3gYn&4WVD}
z2vV^O=9<{V#ckHVp5__2eA;kO_7(gBSyH}2<Gr}=`*Y%GIg%C;_yjf^V@7m#jLe9f
z8wkKG(U}yv*dw@|(ps?sB&ZN(+*u@n*cnQt@;p?JG$JzyQjPfp159#$3Kj+knz-9g
zK%f(9yOI|mYQhfijW`2B&cQ>?Y(Rbz?IC_W&}Ol(4Es^`8xlmLeCZS_S}~MV%S?e%
zoO|3-6bA~q_v%Hoxg*h%?O|Yzfl7cU7x2!w4e89R_1IZvl-YQpR$Ox6HY<L4t|iN*
zaL;RRs|Jm>X{lQgDr)m?RRN=##)!VWKLyEJ7c|gG(G|k-s7rPePqjHDeAdTGT$KQY
zvdLk=87{l)WPzhq1W(t3%?QK9t7GB6<q{0raNlJN<7H#$Y?><S59UyUl@oa+OFjy7
zS~77hVhWaxUysk5Kt*xy7Qi*A2faQR8*a<^PpsPFA{SNHqXVMs0&E&HR4yl5hWe8a
zglnp|M=?MHwumr~i~2w2N4Er$(s-zqoF-SGL6%F;3a%tg^_~PKP|Va(8H>do^rxQN
zv45iVxSebLN1Ui#pRzl(_O^L)**vz|{KC>7Qk-A&-WSXn2Do1zlRnyPceYs=qO@QV
zV&D=gG|t<EX(huXUZQNqUYin8C+`|E&Z19X7Udbo0051<HH^A8k4P}0wm=zb;TUSM
zowxDFkkKk=S+<)2meOwLq@oQgnyqF+`munaVmdT@oMzn#7~9Y^0eI~dpsj2?=Hgu^
znIqmq0?jIW53y%JieZ*MdX`$|L2(_w_aoVKoqPAZ$%=^VAnL{Xr34ty*zz`WO)4|+
zO%khjI)MiYxMm~83BeIkwy6p+9+A8tz-Q7|!es)nRC2_0o}o<hA&n#Q=!-h73vqs+
zSTv5ALH14>WKEy6NzUh#CT=()91MI*!6c-Iu6NSnO=t%=E$1}(&{c!Cw+MHW(&Nmh
zQ~K4@f62VnkFE(zhE+B<=$<%O85DTjyf&Sg+7{*30RPg$*X0&o+^q$xCUADMDd?>E
z#|HmW_Zo91!@q>=CftnVs+B)o<+53J?#;8HU>`h=fFfJq(9rmchZO)pK)%1Q*(bLm
zG3t=M_L=0eZ79yAtPoc+;+$VPL13Q=C@|aYMhNfCo||HM54D8CC3OaNYC69ZA>kWu
z+$H#{>QfD)VyWPx3S^MZ*qrM|^?_`hv@W{svu@|&ylZl|+aJ@+&u-bxonO>=*8gLB
z-K`Wf6?rXf>#7)ih`Jg;HXxTS-+L5WE!h)<6anqfBv0$~*d2+qkjOcaA~LqhQq(hA
zQ%!^>LYrdJUx7`^6f+x-7)c4X3&N%?`GEjcqDxX=QKYoAhN=}PWJ6tmtNonq5~u`m
zeq_gdG*!V-nirN+K|*!m>`IKF$s6v|{l(xH#v!F#@i|BLhML@Qz!tS*Fj^E)#~;Q)
zdW$8Fpnwe@W&2s9-P#Ey7mqhk0c<9U7-Pa$dR3^9{fYqMsX!vd(J;9|@?DT0f;`&5
zV6e-Yt<XRir1yHI8L}CCA`5iQ0C5n#J_YxT#xOAUmQQk#2>D?Z-3fve(&Y8~{@J}L
zY;olTo%2);waApYdz#1!GqJ;T&G@MEX6I8$0xq8o3o}>tGs}h01?~C9hoI&<5&YC?
z9UuMXe0Or%JUl$F+o>iNwC7Yk1E$_JdoEpi@Y%B0s7YCy)Y^c!(0SARzQsa6YLQ9r
z3S3$`Oo|C$i2v7IhyB`%WQG5`X=g(I4%r*IgY2z=J_a{BjY%I#+{^M+t%gIxgx{V+
z1eORS$_Om5oBul;iVsCLsGyQ^z^&}S{1WOL%AzlPW~kO|RCGl-^BrFJ18nNzxKpb~
zPpxk{IjD{OxLx?Ylg!Sh=?7H?5>VDmHx2C4tAVTpv`R<cDNd7DPo^w9nB^J~Jc>u{
z^Ug*0Rr}<y3n#SN9&arVcR`AgX<hUcRs0Kq724|PWI9!s4PPO?sf@=I;y0|k4rl5@
z*Xrn$6eH6?c4v(PycMe79`dXS2?Bh+)jLJ{BDgVtuBabx4x0njbYLkqn0cp^1VEJ~
zxga(hN6-Zx@fy9&>1Y&crI!fjMD-wW7rcQBL#@E`zBh}(F}NP&tIVM`^CFE|>D!9f
zaQHatlEc=kOUQ?Dsc|-CcOXz8crw=bZV-L>`J3XGr{4^s&6kABsn1=ou5%Xo-ehVc
zrqjB|Cc_7~Z2KYxt^j<>gaAISgNIEEaJ9>EmGJ*dJwDFR;VY+{4uBMaByop0H&RsW
zY#Z6ta=$>{h)&J~4M=n@z(3V)%2swb8pp3|MvDGMb>gV->=dLtQestzv9LNI{$wK0
zq?0xy9}PTjBNX(F;m^iH#trh^i5><Wi0tQ_@HM_qZWr<ydS`9E0A=6>d;!m!+`ai$
z!h9VTE!WwNu!Kof1z<-X$`B#wmZCa#-x2UZq;JiY`??~nl-tVc?1O%_>t+9^>RvqU
zj2W)h^1PIh+glr=<i4T@ss#itqdf|=TXiMPze<B%nAnfV)f(JF*<f*>amQQooUx9R
zepb91n6BCOcfeHAU}Rnpg-v8aqFrV#l4i!J^<)Ny<P-?k9~S~zW~r1A!#|&(vlvJQ
zZoHEXmZyafqki;UiV8^<Vv?0u`8TDhNTPqVqdUUmVg#rlG#WLfoxpQpBn-8*XSY;x
zb9A+ojWQgnzKFge*3uwqrK<VP(vX@j|9g3ZdkR*RN((@KH5dZyi$qU>ruuIDY)OJ}
zPWr0S$)}JU`;j^IT-osOH$X;(7*pGeQBu%}^Pv68n9L3IR6+tJ%a>dt7z6IYRVk?1
zv)M}n3&@6L*KtqJ=Q``J;-&4sKuyaBOJB@%$e?sO1GfS6wPNz@&xSyZi)89LoRdbz
z@$k2U3CnGvPfR{t;QAj37YM$HwzKhe*o{1dT)UbVzEiFIEcpb%#zKJ4@71Gy>3Bvv
z^h3&&U(|}@6#(kQ<4_u}OOnd{xL)UNO$Z61U($|))d_umoMbU-qee~?oqek`+OO7)
zXi?)ST(MqayC)k3m3uRbIr5}B1CQtx<B`uUX^Rf>L<|h$2>+T{dRDH4@P466_(PeW
z@C1CdBlkDhN19nZ@7&sLvY<@5hy`jE7Zi~C0810Xz_OcxUfocau2jYiB)YCGLV9)Y
zGxjl?7p<%g<lP6JfBG2k2=DLutyo*J5N=Y{^zJM759YBsWb^@T+lP2$pUxsl<Y>;O
z@o)%96)<AGL^G_-T{4WStf;`)Yd&6|WAtMce@c5JH106STczRna-}&Gm5>H)qw+N}
z11JkoY@i)XGuJ;}!&KWhN()nGrzfxRg%}Ma#fpEM%@qcBN4ph*U=-B@M)fBdCXEo!
zIhOUNG&XjEMCU=f6;R#x(ksR!3Tr(1el0xNK718?YR=VnrHxNK1wI3R2fiJvFVYw~
z#8*Fy2*_{Z>Y0wSLoXaOc6xHO%G%4Cj>XK)2)7y_U}(ilz|mfrYKJ^}oWi?^=l&nF
z;3UZio2c>eGUr<9thI8lD$c2|6AN>!mhdF`MwHm~9s*Hy1g?X0X(enK+O*qohlb0H
zu4tKmH9S6-bdXBCBc&sDNki#l{s*L=;xIsn<<qoy@9>5j#AeId#6(Ioh}{k5m`5bA
zgyk>T8hcW9TatXMpCcB*RK$*~pJO@(f>lOvP;fLEM)2@wXm-XxX1guSHO;iEH!rkW
z6Fbns2+-nFwcgO#brOFd&c<$Ml*a>l<8W3?$2i<L%yb|D5&ofOy?f8C*QXwRXFrKg
zox^&!k7+bu)>-AP^97IlCf|T$W<p?b&2+^&;`&w#;v!Y}%)ZT_$g|{TEwP8}$H&&n
z#wb@%MDtWhbb?PvTeGpTfi`2#t?W-CfItMFN-d80k;ePmi-7U0T*dSC+F7icT2UR`
z4ySRU0C&gj-pV~m=K6d%Y>2WXA?<rAGzL;^IZhY((19q&u$Kse;bROJk#@j5JaM$f
zVd+Ir)`5P%hFr<UhsWHp#aZv(#6?pLvy_U!kBqYx!^E$Zk_mvts`Mq;3$&lKtbMb}
zCx57YDcH3_-zRZ>t9BZ%TTZ)ywF@YHg09kD?DppgG7NU?IVqcdH43<|A{6a`C0@wk
z)u0=qN3@Bu9lY%71vg#2V8gs6V=L~_kxj45I?F95H=2b;0nRV#DJv+>W$GYD#})Cm
zna&gCK)OU5vzvTF6e)H?6+!$Z^&^P>Mse`+MFf(QE9Bb&*l=0?*Z=Z8ngG<R%lE;c
zs4UxM1O8*FF`QcgBX;QAZ@&c{2aqF_L+AP$I9@P18`zS(&YW21np6ek(>bE7Je1i!
zk0^l<=GfezQiY&yv9{0(e99+cKZ~4XGXr47Dc~TZOzxDU0_7iUGa9A{fHvpcVOmy=
zhfY2#242ESUm@lQj<{%Wz>k!hs3Vy{%#eDol8=*ERRb+$T)fxF7Fx?c$SEp}72>E}
z;H81RmaIeU6JLtCu-(1=%zQ*B%CLc@6iw!7qJS)THK;NoT7e5-f2NVN7>b5%jx=n8
zb4C|K;!kpE2%0r8Yuap#+0ifxl+ZycLW#;rrHnr*9ABR#E^v5vLm23ylwJeN(5~@n
zv`N-v1d72?Z0yiGN+Sa59y%P7ayYYn&s}=4?8&&pv+-q~j@6$JW`m4_?V^oYyd_2+
z7SJC)edtX{T5$mZa<TD<gY_Q{PPt|!t1X=PC!`7(IvK*3Trlt7eLukxKAFQ?1y{s|
zfn7#brMHfNsgkQz!?4Kn0;N1~q*>mz1zhX<24D;7rUmQS2()FWf!Iy{h%MPMYc>gU
zV^%cblF=-u1;6nSzgR3w2kjGzNW@o|BlZi$vH-YPPo3;_wUg_VaQaFK&5HQK*W*|*
z=^Q?{Bm8Pl%tJGbUq_SI4FGFw<IclkQdMXil8Nd#3v%eE9~-#cs#jTaC1xn;xOa;}
zkNW=pV-w^8UE-JDKB6z_y^d<s*3VGu7mx>co<CP#k?nI^_C|zLXeGuz3GK(4v&>aq
zI{I5x{6gb*#;wj0javqMpc8oBdB|Ax?=fh|uqewd<K~m1&4muGj13=ZbG*!crkPE|
zF!uXYpDb#v;B5y1>9TO*Ai<#BG3jgT1nZzNF+4~x?1^v$WGGjO&cZx}sD0ItKF!<*
z34+BNHC#5UE(+)R1WSHJ?3eE)@Z}tqgD_?xS0NtKJ%KMWxJ;|)B&-X}4TWwiYyq8r
zbW@*E>SaRcL1%q`f4no`&b+}(na^x)720~?QL7BZd9Y?<Vf*AWIS3U%21vDLFMVe0
z%(m$l{7%b9FC~e9k6uGtGE>6R$Z`=`9X0KYD%<c8)>*eukzIJEn357W><S?oY4G-b
zT-b=0fODA*v;y440(LaMGoAKDI35_km?P4wYtVq+ROxt6FeYSV0vACn!ol(gQNvWm
zu0)7q)65RR?u0-EYd!Qa!f-!O>td*(U3VAj-kL~6?E|%{BSOX8Br%hLgD->vI+?v=
z%4~{yiDXdTDl=<Y5`LH=$UuisFf+(7wX8SU1cb_}@pY0Ux}MD@#nb!uuhh8ay{&#e
zzOTlR7X1HcWiRgUZ9mvE_I*f*T()$$**14D+^vd^dc1#Dr7$%|+om&28`SM9zn`B(
zM6mjoBP05Wt|BBzN2~?h+<aCs(Q`8+J<}5Y0#bb?PtW_RaB#w}SErghhQ)KG!8HeD
zaw;eT8!GhjnLxmdQaY@3MDQ-*K-aT%c1`EhhMECA=$?LW0#L=n7=U}2@^R7t<Q>{W
zvnobFGndTr)-ot@EcBVnhia0HLjvFk9dujg=PoDWE~liuUwUjpV9~G?Kg0k3A^;22
zVJW!Tdge0w^eku*oK>7-1j{K~b*P?c$#?JW);K0lt`s8y=9w%YF7i2R&Fr1QT8M7J
zB^#E6;FYm60+^<kFR~ggF0#L<?xF{@P}X`_nw+n*&~j7VW}*J;Y^OsVc=eIQt+WRw
z!nt}IG^UWe3wb|9e@lb6sW%Dk%$7h38C~}PTN-c^i<c4)6qKu#m_?h&Ns}0SFE0GP
zU%de{JiX|YeC#m{C`fjov&OGgDk$0SUp=)G56R}PelI@^T&nyy7@hxpMgv6Cz)Ubx
zoqgES0D?vl49t}PH8Ey>#>yhe{j9kK40<&l!wxjWC@+%cXhfS}3l-yJ3?L{acL^DI
z7l+oJ<&AB_7#8VYlYF>BB}xBR(TiRZt^g0q3jKtt)xRL-hl9$Wz@tuEVW+|Pd|et4
z5I7@X9>HD4FfGX9Y~iFMvyA*9%eEDRgEIr=Aqg|E*wJ+|pQ_g}?H5~7vv07{)lmYJ
zBE-uhq%q?9e$CTN!0c|O=?pd9I=iRNxoGRcG1vz6kjPMv<12NJ=ip)jEG47a#Wd_J
znSmJ!gYdIHxdr_z&DJP&n?H8XTmSpCEx4r*x3{;;rPR-UsZybL=k1H;tK$|I*@cFj
z>tgFBee=Vw4PdXyreq{&?JraI&1WDA?VW*!#qK!G@+qWGhHt|KQCRDO&A|d_UQu}n
zx|2#>tYfpc(>7{mu7O^b78tIWwV38;JUX$AAniH*zG1SVXtCfb&(--HBr)lu@hI8M
zBSzrLp_2AAswDydKrVq^4nnJha9oiqu+xqSiIi5*4Uz(OjgOOUTScf!ImT+G`|}Y#
zgBs1-2k#{Tx{q`__i$I>mZ4!OB~~xteWKPHS}(8L%h{``uY*GlU!lK`;E20=ZvQx-
zXIJ@<xY3R!^z~}bhs9=5#|uI-CT^Dce_nCRLg_Fd9$)bu^RaWJU@K0)2WYHy_7K72
z1P2VqAu2yvMnT&p$=~E;(2J+9Yh))$2>=;*ToDS%m_%w(vUbk;(^aqasEg&}D<^R4
zZVXJg7vb@K{l$u7D_OIu>Qs3%k?WGvOxcSmw0dE$qMjmxUi#2#?2iLVN93B7)N}9V
zBr@!#MVvH5hYlan`Mtz&i^^3lCZ+v+AJ(-q-I&ZHMz{3AiW76xQd))Uu3Q*)OMdZl
z0tGh?P&pku{!h~O!skw^T=?8coeQ6Eeur`-Otp)gJ8?gVMfzCim{<18Bix9(l_uE#
zl-}&>@R{G8Ev!^I{~mCLLraRh_J~1}lERZvgUWVQ>v@1F1P&NwIks|Af}3aX4Bdw)
z#(O1Pr!u$lygJDxd{!d@0nR3zlEPc8;~b<IYM)odcH7f^e;p9FDIJ*^t>&JH)6j0P
z3*mHZ%{i-ew93Y2jZpRi?+MvO(4}J57bmL{?VqeegJ1bkg1%gFzn@HI(SOa8Y0A-`
zhRq^&$7@LU1|Gtrq9KSkQ9*nSo4=AQpI==|?gH`2wi}8yehG;P<Q`R0tU4?AvXTLJ
zFO|34Rh6Dq_w>AyiC?WJuaa+cGAG#P0zM_Qz~X*FC;quJ!m4Nj8|%`#4SWa>3~gW_
z<_s_duZ&+=03X!H;dSL!1}S@r&=ggd+gY0LqP6_}TJ$tp1M7qh@>#(!`hw9i9AACf
zMS)B()3*PL>IO2UQPK|dj3<wHLGc<uKmcLu##hq>{TNF4h3>JpGF1|lR<hwBdY^!6
zJ&L^7aUm8H3ks>6!?hu{-zc&Kb<WH6lz(W}34w(zRuVFpBDA3rgn=HY*|I;J9UZL0
z7&my;ompVUl9=@0g|MuUP-8wd8awrQh5b97U}OTeWetk>UCU3NhsR!u^kG1G48*-j
z#Qd$bh*A6P+37i?l%>sqjvVZL(~`Z%fV2jie4|q-=Q5*)1m5Yw1ob7&pv`D=Hcfj#
zho?F=39U#5ZzLteFkrj@fgt?|xY?4D)SLkf@4)w3$zdi%Dyk_CUu{!DX`{qNK@&#;
zTIHBz2Tlr_YQI1w9n5TDkbH1O<IgEFxE=7f1j0_+LjIgqK2i(Ook0<&wtCz$=wcio
zPgm`{dJAR(`cM6;4ezT}BhAs;&f1o?9sd99y?cKXN0u-=|Gs>R#`6o7O#31OCgGOH
z*aGy#*sNuT$ug{-w$!p4B(+8@**Kf*XMfMFu3at3Kr%bK=r<E&b#+}%ojP^y2RdLl
z;N3K1=-c3+eA>9X0FgMLNDt4JV_qb|Pkw&R)pxplmhAn7U1aqDG$+jCGYRvR1WKX@
zEilpBRhn{Rnz6zkEU}Odb6CBOIa~{q0<EfMGP9=w+_A}9*e6OnRZ;*Mt&jK@%V9G5
znQ}((Bw}AhBv{CJX;l-U@FbP3j#^S|u$!3Nf$Wm1vI<bvWz@x36pLGEpH5A{=E<$g
z`A!};_glx!JuDYwZZgNN;H#2!P_&A&XYR)?3&m+cIKGQZWvHcMky=!x53XUysXlH#
zDn*ZQrs_qZ9rf@uUu(umRq7+0Az%`wZ|RP;;ND=tT>#iS1BoVRctF{p4QzK!w*=vP
z1AncD%s+m~dR64wqNzk=G2Ck`iYY;C@zbTFjn`7o5>ZnUFg+z3Dc3eEe<vh@6dID)
zVPrQqw%jHu`X>NiYa|vF%biE+EGX#e`@`X0yj+rW4_QW3{gPB`RC1Lzr({ah=k>!8
zq8b-?grtD8D49R8El(vHbD3ehSR9{c3bR-kp=#@8B)g)gnOVkqfgPCiz`<ZmBT*8=
z&!LE>c8|Kz`Lq!)q{CVeTbz|45LQ2|T6m@I4lAVH1~BF_o5({)q6qENM)ZP^i|yR3
zjdK&WICRtVT-t+ei*_GrySil%j!y9KmKiZs1!LKL3aLGUEOfNevd9CDWZ95ug5SZc
z!l~i>&k9T)ff=6uO6*%6J!?PXmeVSju6N0G$mC-ko~OXQ<YGcz4y;^XvV*qNBFo5K
z!?TSBz_IKps<O!2bq{R|t`#Q4=vc4v_HMX-g|=1w>ly#n#Wfo%^$A~25f@Ts>FbT6
ztc=<h(y{lGk4&QL>*}y`Em`=ty_G!9B(h>Pu9J~DY@RkTkgoR8b(R-Li4jstx#R<W
z6e?iS_6^%Ahcdb%zN0~s4ums8CuG+}Y!|=(R^c{gp{?7I?`cL`TnaI84fRT`=pS@S
z6z7GQRw;3hDe1M%8kq|B4ix!3lydnfpB}4AqDkbv>-G?gY8^@DRVQ+_qWI4rbeaxT
zK040&j`PF`jHa%oy!a!^fw5N{3#vE|N~0}XIfFyd*y(U&h(MWK=`qq9pz#=AC!27%
z7x&K-<mBEV1?1lUGm!TzR^(T%la=4&P+P)q)0WS3xGkZvY8tID&mV3|8hO(cl}bNW
zG<8~X(~6clPa8E~(Ycf>nscf*y|ht|QRS6wRV-J`ZFTV0%I~x}WX2kG(P=?PNMTJ*
zAV}k6l5j?8_CX{%$%H`EJXmdZ6t(x;Tw#q6bG4hT5^*egg~8H2bMiO|J3j4Zv5P+@
zvIr!Q4l>Kxd1sK4k6N#QFSV{RQ=sUY#gSN<#K|UrO!ZCWfD=ML>5N2%j75eFr6hO-
zzPXY@7=OvUM9~sYL%1B>jV#-l9qOgtW7-NgcE+oOt*9Yj%yTPe!ta)(I+8q;<VD!)
zQMGvSCB=QlVOID`#P~`0)0Lz(Jn?c-fG$l#^%N`BDLiV8x|0KXH(qaW#zQ91m^O-C
zzzK!)c*1RTGesR=V(b*>$?q1I>j_2+`V>uN=+Sq&?Wjvs4n48uN9d3U<UXl{sO$<w
zw~T2fr~q^PuqQ)ZI<chZ(J{`t!iGOHgg0TmuD~JK?oP&@OUWR~uCB8p?TqP4ah-EW
zi>%>IfKyMgHSCan)7U8a&mWz?9_e&Vlc~`k&@{R^X;Wbr3SBY5>^<TJe8c*<*R^_V
zl6S;@MeoP{tNkHkPV`;z=)3Iye3wO*uAV!x(@9hAXzzJfu30r<IcnA{s|kxbJHoTr
zVVRT@A@5`9HNXZcj<K@7Qn7kk!b;rmd{6?+O8G^n;as>OQ#7X|m>$i5uiA1UCLE|a
z&bt@7L^=xq^qcQIV?`?&tWm46BXUZe>Xnpw*97T+-QJ8}{hOnob%k-pc#-Z?e4F#%
zlcY2Y;h#aG7X9zkHTl#u2uiuq=Qgslmc``-Tkl%A(ti7GZl+6OO6t*%L78zy=ddFq
zl%2bJ#X(Kv@<|4ucs(yaR?Ep$B|$XgvJAvbXPqIV4P}x+ZR`|l8Ec>NnB!HE=JJ~=
zMu{V*N{UDkIXgIj6DVi42>xpwHmkYA@S6_pY@+VH$`t_DtrR|=;cvvDm;t|z8b@d@
z@Tlf=-(~L(x+{5xTp~eD_d}JRh5OcRd<&0T?KaK>aOs0>qND{uw^c*qJMePw9Rx!l
z%f2(?58<i~-d38^maW8G^Rn!}QdwE4y0dlNUyKt8^jZ2Pgbi*>-}B=CA{|GB;giU0
z>Xl?c>&=E^IwfLdFmW{M)QGmw&TJF85ibQPZMAlX&4SoMb)g#uj?rA2@wFZ7%FgTW
zKD-a@zqMUsU}2_x-m!Pz_12%QQ(CY0EAfYLBCn+e4QBeXNWzk;up7?($xY{8F>HAD
zLET$5Z>u$uz=r07{QO!+ONgx+i)2q#qMabCd5e(C*iwkTDnUf7O02Q8LN0oujGW|>
zg(AgNt{L9Wl!%}|pJ_fzyI9v1F9xnP#(C^1u+xf5D#l4SmAb_0ZqY8Vq=&_+;zLS_
z$U3%BFT2coGo8fM)}N`_&{f!impR`=Hke|4nu^FJ6DLGLP8RL3<T{iTwQTp)KU$uY
zhumg167OkA)Hf1EdDbfja8~K!@nKe?+VzlwX>|xz_TFu&7MQs|FG|b#(!Kg=XDIw8
z?{;Ss%S(VsCj|-ONVb&(Hxf;m{j%*Vyi{VFg6?jzv=GE@*G7h9%HCI9jU$`sFx%k$
z92qGl?2@Uk%B=dT4D=}%o%7^NF3_6{VO^`)64z>(HTg3TQxVA<OZ-e7l@V1uVqzwR
zFpZv~GNS)m5$VDTU3R2%Ivq)-LOwXnm@{sTmHe}@_FiKD7j(0kq(}+tN>i}wWMigs
z+K%(Km0H-+mKhxer#V|;%wC}trk`+8c11_vQ^u4eI+uJwl-GkoO!!3|`O5$?p^%to
zawL<>w9|pL*4TofYNniOys~m?$;!xOG!6il2D=!Y9JIAshHTF&z<xHED!414j|T}R
z9se|yglVkF0GzmB|2dv6_h_C2F!lXmt80AJkvdxfu&M8?r*qXB_{v>~Kd6G($eXqG
zdyG;E*&1P|_3M^Tn`?dVW1UB0`-%;GQkQhTtR>}pI;bgfZeVlkRp^LVBjivv5W=j&
z*bB>LE6&**O3jp5Hv~n+Soy6h?`fga((iwd>MZUh?Qr6Xr6}K;qs+*O0VN*O8M7aj
z;j1JSk232q{6+<aogV|rp1+SQZIA4c_~~04Q;{w^EU!DmhXr-Ldhc<m(DYK7bn#({
zC;oc&sCBP|J?fb`r1R?yKsGPTZZK7~wG~QCU$d*@$@MsG)9pgXbqas#(+TWT_o8P1
zgibuc?COscq*jo<UU@vH^^wy$pWpg*vw31#57TryuQeKoOlxwJo;Q=z=LfC!D{C?{
zs*1a41T;Z)c27@Ub&i|=cG_%P6HI2)i}gwRkLA1A-TTRVJ?Va&_c}+8ns?Y+VlE6{
zv`==AZ7}wU$(j2O`5juXkbB~attr(L7|~t5LMH@q=$v&@N0VbrEn1U1aIG6hll<&M
zw5CtBQU2mlwR{4ghXeQ-|NjD5iKDX*SVJ_A?{Mw~Af)7BYk78&Q1c|(qO`L3{h7}d
zQd2`sl3tId*F^u@S~p&4jX3KNmH(pKdO}YB*qiNaFUwX+9S0V8gzB;wm46ThV!J;K
z_9CB%l3!AWXvkDpRcN0&oFEGS2Dzo<=b}NqB~^Ur01+EfrrD>_J+fsnrL9rWk&2n=
z^+1pW@jxgq&2ddSpj@zQq*U<PPeGuXq&>2d2^iEfwMPIxYo>D=>FK*ob|;hMng)oY
zd)~9>v%$wbAy8dY!&6$(twP)trl3QP3;!UauKGcM4BVT|;-L@lCC~@Q-O}MvtRODC
zd~Tq26n(l<a~HE7!M{LYk+Rn0XU5s1!$Uq@Fq1h@`V50u2x!k|C<_~)k?AHX+inaX
zhay{OuAA_ISbLo!Ona+M?7%SJ>TIdWDM?&FHQ|&M?B?U^%`sxA2oKe)i{)7(iNAq1
zfk@I7KXjbR7??7eBr846&nM}*@i14fD~7|WxhD1@lIcTi)jW({h_$+F3xQoErWUJ(
zgUpL@*;-NvooWGmvZf-a6~=1ysd#Ham5TCPh^kfK^6}MruL^bbKra1LF04$Oi*%}p
zn7wTt$tw}j`eQ$ZEKT(_$b%WqS0&J45*~FGdZX5jq^w66(xj~{h>l9hZhe3>r=pV!
zJiSL92<2|Q3AErYqy>UE+~yve4Wrh6;Q4(TMWxuAGmL8TdE=n1TAe76ZsE&-vZhN*
zM>4BYivmTlGkU}&8w+1&2+n0Lvu~PJvmi{~rURe<J1bY`F;sAhW1Zilq))W4$B!-l
zvsH=oI82xv<c;k~mr2qd3yp@8tj;#q;Yuz&NmMe26F#vm_LR(1<Hd~WzKWVE^Tmqr
z>PY|tluXXMI4YH+xLr&qC~<U$V|jM@u7Ov>bP}&zq=WH_Tgk+dUGb?nRIcpq?=$v1
zL2x~b-pRi}WZtjDw^s1oU2=*yv6w27lhjw(==tgEH_bOkd$05xy~{);i}3<E$kl`1
z+B-TuJXuF6?)131e%!<uOPB{;T3PRz>Pw|Y*10TD9Gx*MMLa6f9sQQ+`KRVD?babK
zPS)mi=qAWep*-A_df9ItECh|@oipcL+{lFa@&Tnp*67`fqvO5iZzsDyHSurV-y3)h
zv-qet)lET!0ziM3+NsgF&!gj)&65z^$p22>^>bU&tMFb4O3@RFeDa|M@QILnDA+#9
z8KkY{vGSKl6-^3G|0{x?2Px+r)J&H^NAI@|UmSTeu%T;mc-hOrwa`LfvZ3A9@q>&q
z*oxjm-AME#8^hWWqj0CsX2m*v*E_Q(btx53Pj3IJTCY8e*T1y(L#ReT>QNI?Dtm2$
zft(m6H$qUeruc}o)S`TTq&j#4n~u|e#FKwQN=^8eaRe6yQ!Hq4{4X6r_!m8yo<#<$
zu|qh92d%x`lV%yA_H@oEXA_e`V=2JIJ&4E6Hh}istKH-M-`YnnPTreEW01AePpy~s
z6JQD-MMd79*6DqCd!36GtP_1vb64G9l!r}M$dc_JI_Sj4@0yP0{*A*M@LQWwI{ii^
z%=8lK_AqSWmM9(#r)qkof7c=(PiFV$Ca*}fhpV@X>3c3MMDnlz{)Y(xxC8r8RUQpK
zRV-Q#lQChyM$|;J3ICX(sS1x^U*nNn_rP_;c481Mv9{i*T4h-OiD@r|vG>po57{zv
zJC{Y1S8(azt&EpX*&S@|ZARKk@=vsH!TZSYSbsmLdz__G2$zpH`I5f3St_GJBj3}g
zYk9}28#t^?Q?tGIK926NO-9se0e;Ky2Q1py`m&R~H<ZYbg;i}I3?#M)eQJ2Muhq?L
z2zDOdHYYiU$6`DPaoF<#a32BCoeP0wp)e~x4+sH3+z$dG1Plg<{uVOKcSWB?|J>Cq
zE|QZ@>u~S58nVJ$;|Y7ELOC?#wgu4%^#p>UYP-PUj>xN_**g4r_n;~T%K`{9(Uziv
z4ul^q1hNNQHSxvR7X+u8D9jE3g8Arjw>q=+=0YMt_cBunn^mr$32fGNgSAC>WQ@{8
z;$rO<YbAz9tr13;Dm_vmW_Gs%-dU;?PIXs)`vUbSem+x0iXSu-GY8{aH64TVR@kPg
zHtgqgat61}5H^lFizRY|&A0K&^pm6Mw~dX(O=<si)?0d4k@X5`@m#f-j-;HU3|n@3
zbk8n5KNcs-^{Rpju^Y~$4_#f{Y&wQX_q7Xwj1OCq@ge9HT@rowpX-8t<d0z2+ba*h
zv9j=@@*w6U-*$pE?M6<is>-ynzd29r3R`8&50ENrgXZrL^r7~roaA!un>`qT-*mS2
z+0*ErZ;rFJw<OvZlt~@chhCNnd7&im247I|NMxK-KYBHjBtkj*6-$!j-I}WmdhGNC
zi-VR+uHRzGRPJrcr?eGU4G~U50{zd}#7AYPlSz?MXdY+QF%4~UZqldPrI&$OaqGQn
zx9x3q+m_v`bl9d9Ky%;P8!Iq;c+cq`!@h{W5^3d3ls9E^)D&<F0I%le-w!KZ@l(NX
zv^f=nT|>fTnOI>23e5O3)?-n~#Vh%;72s}v)w!4U!kX&cyIdXN<})_lg+shm#!{-Z
zioGLq`ya5T-^+*MX0Z&C;v(qoOWLt1@U($=7b|ZQoi2=rMTG;_`_w@jS1Dzk>Pl4u
zzrs3x)>N88<eILO11dW-CIi%8vG!1TxR*+=>y<1S+YsEI<#U9vkteiE04H>bgX8gI
zxi-Wi`{OcMTinTV(hAHqM(%*!7-tr%d5Cnl7;VDH_s_cC=W~MTls#O$8~VP-d?{^I
zV=L0?Csr0kt^H@-&1^L`IS7|%%<8P_=SI)v_oE8Kl%Oq^#5pzZDvIHjc*8gBy@&xN
zYDy$xu@8b23SZ0-I`dd~iEdk$sFSf>^$^<Jds+%n@k}M&I;bd_cafSTFE>z*tPY9i
zAWvmQbBs3oyV*)yLA{r|bI`D=_W2;sKhDOu+cjT@QvVDtpe32RP(BvjB%xiUs^Kf?
zZ}783RGKh1k&RjN54^?+O@+T4C!XFMCxWmeL{Y5DH)Ofd(w4epzW`kd%1BtkmHR$;
zY;}P$T;PA71&I2M=j}RghhCp^Mm*2&CD)A`xcG!rubQta`mc9Y;iu&0vKTP~;o!GN
zH$c+UkqN2!Q!vwFX3a5Xj#lLcSY`6Ds_WV0;&ko~w^qup&eE(Z=?S7buxC1%o;zfT
zw_Td5k-Oadi;tA#UdB!BqZ|yvuil|bUUp?Kp(K**&VUOmL|!6euIH9ho$zmkLQ|p^
z2nU#t_yUVqRspSASj10g^YJq;SkISjIP12FRhRr3sGhdceB=ClWZ)c)0uLup*UNs$
zd6!90^80YB!SUEZObPF9$jpJCWyw-mV7f6u3(*rL8U?n_lZ12;$*MhK_&I{7-n%#q
zdmqNxlui*PFQ84}m^wGPWChqq&M{mFt?JujQ9T{yiL9y9kka5`L1Nkg%tghC)fG^z
z#4#bso6aOw{AJ6&%6ZNyZ?7=5b%FM76yeX(XgtZs$vF-a>g(*<aTW<Q3B6_NX=SpR
zlu4Xp896sUEMhRoXd;pT-O2*t_C{+ym&i$7vBv^J%%Sn063i8?WA2ksUn*mp%E})l
zei0y4ZeY$ujaRX&&NO{lGq6?zi_8bJDK88TKPQ(r_!{cTCZW7(u!km8vr0E2yYhTC
z9PgRAyyc2$@Czm^o)xva)*DpZ2Ei1u)kNH0H^=^{$_>`R;`^bRhzF9Dd>KE6A9N!1
zCSs9{fn+wdYaB4c99CfEoSsZ&Q4el|+JZ@*^njC_zCo9Fr8jwge6+j2x7$AH>;gA`
zBZIjw`<DjRR%xI6<01j*1#5itw9<YfI+<MSS6(#_-rU@PRINO+R7Ag3YL&jO^5_h3
zpH9ruwma=|=__xvu5a06<r;@MQpHQAVnr3N-2JYIz8ef?f1hAzYH34jo{kTzt<YTe
zDcM!~q;+r*daazutgdsmS|>FC_BKY>#x(C6LLJ?vmIgR_Bs!*BHgutS7{*|CTC6J*
zbGRf3K55z`KU~WhN@>@Mj!rbq-uLud{?YzxjQ!X@sJ|_%8}zqxzcU3$r6&KH8t8+?
zl-ykZUXrY;^G}DF4nOI;-N=PO$cNmHCkm$fFfb{VH*>R$oxpY2JDN@B_A{Q-QPn&7
z$9aX-^jFy%^z#U4OA-70l*hp!BCnBiD&S-V&Wc@#uP0Fm)d$-daz**N6MjGXuAtLi
z(Zt!yN8j}pw#`2-(~7oanTCtok-$#1(TYdk3F)fnG5a;0-<P<Tc4$){X-XJwJiMOU
zE{-()2$r6DAI~{8p=bHW(60o^(1Y^tzT=0NnZfHMP@2ze5hUyWYXVU(+hXPGa-MWU
zFF8W{0$3r0o+=_ErHD{ng4LhNqm{EgZiGERr}?xqEI4zdOK;0<R99A!9Q*`Ap-PeA
z6r@m!h{8`$v4Sh=oXv`kS`W?dUG`q$P{M@PS<BsUoxyOo9!U-m4=d56^>Ijt)$MoO
zGoFNA1@AC7r$W8le)+|eyb70JQ`LIB#W;|z|JkUZ&~RCF&}h3HN?6_h0cfFm|C3R}
zTGSta9)U%bpzl$xH<P?K>nisGWW&dke42wyz7cY2w45+$TH=FASzIbzFvH1M=Nq<x
z-(ap{KCc`SK1{8Vnv=wai)1Q6!K-7tz%AHGk8HR1^z>X1PU0%;Kr~DFRN+^SmAFV^
zC6DX+4FQI#){-Z{Q}opfOBPPpl2iT?xHgQtdK!5S*A^rLf$H$etE9Lf^(1^(hyh>g
zH(d%TZE-!>=tfHl2jGRTTlO|^P$L*<5VGlWB9oX!4Ha}SR}rAxist7yS>(c?v=$7M
zWmOM>y$Wi@Z@5VStvOrd`=6*Sniu;Q-l$>n3CF2){gk+JZeyiF=43T%`1_x`&r5cH
z54u-tqY<2rzaCcM0~rU~-3ZBCMHqH*0|yz@CvplMbjD>%&5)DKCL<}3O{G!MEeE<E
zP=!=F!&>KN##-YL{UIkrOuEw<P;qx|&VA+J2R`j&qmH=i1kv9GtAf}w=iR!7<WuK&
z3&G^6azR$*KmZxn>TB}0o%(_?mwkx5Da8>Zb@{D89uw)vYUC?lq(xBeVuvg+Ehh&^
zcdvVC7qGa$htR8)oA~~7)^wJRCddH=mZ$eB203J=zk!K<yKJHlo9CA`%~u30Ejl`u
z0;$?Jr+i)`;70+^VZ<JpUt4ILTBUeh0H$<<ake)Ye<_U-PI5ksaDIF4WW?3(_Kj8N
z&j(5OBNhPK<pdJ7QNTBo<1>PfmUP<;=)kPcpX1c2Du0zdSgKBf6+iv;4+GZJpoXE+
zc35qAHt`Cd;^&`ogxngRau75))maE8cv<qe?FGBM*|q5RVHfgq=4BnjvKl!+3D7D{
zPOWy|s(>JckEka%@pM&g1*yp@QeC4^>U1jy5T!P>FLI7(!4jx+^`XVR+fB#h|6wLx
z<U`xq=oF<TkQ7|KnH-L6*AWRKzhaXU7cVa=VC&W`^j#Io)eq4v2pOt{k!p)JtE{Ow
z$vIX)&0lA4a3k7~3o82vt*F&H^;B=<&umq%lr$d!3St!^{BPhHzbHr&kt7)QHb3r5
zr5^C&-sX^BD%;ooinLc_s%KF9mn6lXLCQ`7t1E<pF?QYzvrjR>ffHf9Ftl1?sQ<f!
zP={E4D@EfxzTe5@7-0S>I(tFFX`RpS!~1ZMwmnBTeWH_VTE;6Up}twzJxOrul9Fj%
zQZlWS2sne>oL+iZtvV`ah58>QS%inQ)k0PUI|eN$Cn#9t8`VF1zm(@#aEsg|V{Uqt
zd-XY+R+-nzKeK&Gc0*1L)8u1HK5VY(%u7UaFJuu3t#I2CUAyT@(AKX;_v=W_hn?<O
z%{bh-wH~j3cWCmIRBg$pGaJG+mloWn<eydPh2Ws7O2(pY>Ee1cO+KZQ&&Yh@a>x`r
zJ)Wex<o$9S+`^0HmwcvJ)B+P7mQacOKZOIhfy5jTjYCl=Wu6^FXLKejyn(ccOw}Sr
zD#J%KOm8rq+r07NyU6x(DLH`zm?iv_{6MH4p<3lqIbm?Qul34$xGcD-`ZSMtL81GV
zv5DR*Z5bW@<@E^_)w0#&k|%e+gNOnGVu3EMwYrsp=k<%uN$Yj<==8)RCF)cL0#0_#
zk?rLvGc_tlMKZbudIk8N45BU`fsLp&rShOIbk=kY#X`K5-OOF=`s37@SMreGQCGR-
zVG{Es8y1!XuqstJxc<nQa?@1K(1EVZ97+Tw=qI}ZB#G*IU5dmbsE<jH(dGFcAi7~v
zwy-z+4V(<Ex74O1W+vSfD8fXDNI7#5l}W~<6xc}RYM)U#9BkCn9?~&-LUU9ZD!Qqh
zPcrz(-r6vr4>~3D0r5G<LO&+cVBYTox^6^oQ!W#$eXyqna(-_hhAVkc*VbKrOJ2B3
ziR`TqNgXJ?za@cV1LAo{<xp)b;6}nz;Zu6ksc2bs)O-Dcl3$g`+&nwkmqlZ*^C?&l
z`_;~4L94P3T8a-_2ZACJ!GrQd4Du^RvqEHeH$Nc-I%6u}L<v)NSJQk-Arrur7Z;e9
z-YbwhQgtW|H_9ZTpt^d~iw$>T6pExH1axx2Ny^lTA_Z`&gc}^dpj%yGfSBDK20w5n
zO3Gzh3Yco`#~Ry7fdmVYf`qsVxL2pnVyzH^;u?k=V#yzXQHGkR90}f)0@Yb|Zp(<Y
zfJ*<Z)N_8kp{0>Qy@aXJ8GyHUky)>tjm^OhI~&_z&|8U9&*#}f{{^0U(X(>mkf3l+
zn2Y*535!dr5SHqz&F2jW4fI{gK?!h?TDrrP@L~eqtIOq?IyAl<GGQxO3n~t<PFi44
zx7*P0Pb1Hz8b8a0m^h&&L<VwlnU5~Bq>{*dnNxg8M4IPh320hVuH$t^vC`Oc-w(ou
zipc9rwhsbG*QS3IZdzodvu0$PjRv#s$7`f3qY^iS;T}5EGbax#vcjgQu|rvGYSIOy
z@cW}6CXM2=Q3h9+ni`e(6Yi{ZHGfsB6@Hdby5i@nCPySr`|FDQlG+!u`u>LbeM_P~
znL%CI9-Z7U)fQ#=-J}M}zhEQU=k&jLfbnrj%KRdw0FD(F+hv-csS?1M&h2+A*zZ3{
zn76DoXDN$cTxQQMh}lb~NlXGT5^>>&=~8hx6%31X3?j=Kc8tjepxHZv|1Y0b&_zBr
zDxOJk&K@%`3$7@8J@%@XbE#3^blyhHK!-bhBa6v@mfE&wXHvGVO<OGsuB;012bIv<
zKYjfsM&O<t9XE-u<P=3sRaCF|1FGs-MJJJ|#5t@>dChP!*qlyBw3@HR2teGuY$|nH
zsRAmM!%mZ7G|th^z!?%IS-vVYv2_(tanFET#wtBcyyZR!v~QB@0SMYPcr#iX^B=nO
zn)-rXm9n934#cxrAIJo6n2yuxPP(Q}R6Ctyzyto8+N;W_RPFKp^K~kR%YY!|1L_Cx
z2E?0jq?%(*!CP`9&#tHVf=D0|@?5Avdh&`@7kt!%OBGmcYAn01Pcf{zHOeT3mt;;=
zATU8gf}eKEuiB({hF-r+!pNwi-pd!aH*I5bS2e(TJISPedOy#}#H~brjQ4>3ALRMR
zB0``&QULMM?QReW{a^2@*D>!UY(yk;ihhF&5@B4>uPXlhx9EHMb?<m@=YI6tR~p?O
z15YCKPT4xnfSX1v8D!Hb5N;5yvt%S<A08)xm;JizC}QLm#wo(H&d<%`cI)Ucx)W`E
z>h~Y(1`TXbvs*lS7JXlL+6h3`pJn;R8R5nTT!v2R(r}X)zQ)_ut}@6}$)ZUYZ8($e
z&i&d}Tyu`oTD_vjGULkL&f(??1BdBwl3woI&-!O+?G6lC|I(FVC-L`nRo(PwIClMO
zld-_w4k2SbATb)ZsBE;<O4bFV0lAOUURH2fXL0z@8A^%!Mb%_68{#?0KVmUt<sgD&
zRQJwjLjtX_;A2+Eg@OuS63?zOROoh^$Hz39c}@fY`MFD4l1&)Bq_5*RLMO`(7QP;Z
ziQ*a`UPBcdJJ1|Rz@`0TnN;qoV%q8i0(|@f@;&~@2qks}N(({vhp9{md<mAadJ;9Z
zR3bQDHV@D9!xZm#vE4efGP96P4IC|A0iGQ00FTj=CwOjtlP=-pJ=Qaj=FjYt=+8zs
z7D=r5n2kGXzdN*-bSoOsO}~HiQ)$j~4%#@zg?_)_WT?WN@EjRoLU&%--EF{oi8}g`
z(d&^~1Rn;%MWE-Ha9gn%B&U<_@Zg#lO)AHY_Yh)yB*mzR4dqhod`Dhp`K;hF+n6N-
zB?rO<i)9h+7W(VY2Bdm7da7j1PEFd3MOS{0wAU2{pya-PtS&`$s4OBzCbEpr9mZ?m
zr3B+SNLRyHq5&DEe@d^9Q#d}v{>DaD3#Uv|EaKs8Fqp#;>d6rMVn{$bLTR|?u~Mdh
zcZu7%W3FIpYG$=3lVnu%Sw+rKH4HHB&vrcEz<lX$!==MEQYkc1n}{HUyUk)<)&bo?
zTz`komAiY*_j>1GNmz}ja`UW!&FLVH2K`y5KS}>Vb?)HL$*hz02C4ODcaV2KT4nH@
z4X3^2?AOS5#bhl^ls!8+D{$6Y<P*d>`(R+l!Y}fyxCxj*cFeUl?dqTCFmiu>>S&yV
z)r*P`>aKrSx8&F=;q`;<UX_Gw<z`)FYr(=^84l%6HGDp!PuwL`R<j!4TKY5SuEMx#
zHk-13>Lz8)!IH}14|f~y<2wpz0-+-6qpP2UWOKTK6ygQ+#RRIVP>|OCK@;tq5gmwF
z3*Z2TEnj-&ja-ym&PMu!<I~RG!O`ANzP%36kK7i}pf?*j7z~hc1pj4s6nExEyQ$CW
z*WFD)k}uj#g=iA|qyK&uZ9gbwI-I+|FOHl47TR07*q%Ja{yuM;Z@z<bG%?Gnr^5OZ
zb635#k`ZPc>ZpweN{63*LYbGYQ&WaOi{4gfWW(aGZYu%?=%w#mk|5>MC8_;(^<^7e
zCgy&J7u|JM+`=|XaB_0MdrH|CDGx!B+PuLHj8k}xxuz*=_Rd_)IYg@aWI?G)U4BW;
zwVJksR~+Dt5ob}EsHGH#Au5X#e(F$><ou#Sk_Qa<%Y~)r9U(}IUlSuXp+J2#$uWoT
z+y$1EA(~AJ*E}MYuZCO#peV5W2hh|~iKw?tPHM~B2YAJ^5B_V^SFA?`JY*oT*N^A_
zGY2Hk6WJ8jEG^zxDI-bjH|M#;#c|M}Q}De<1s*M(HwSssK{S-rwCbI4Nl5ERT2c=p
zEmk>YuAz?n+uf(i@#nGMj5c(aNk;S2ID_Mgj~pIE3SHpnWq#)hiNhYTkHSp;3_vH4
zZL9MSFUu_LcTv1e2Cu1fdfEdz!zWg+$ZiXS4R9WV3&#MICfdDfhes!^7r%5~HV>P}
ztv#xBvVyP1q8-nA{(utbkWHr7b^@Z`Ef`zjfq+Y4<#ZG>D=ic%aR15SK)f4}U}SwV
z^9nBX&USk}v#GI}fNYozedvbw%Z6Hvjno|QzpS}z1DQNNJ(?W6IK@@P`tH^&nPz6<
z#@5!B(l#!!LCb86$Qt3znWOag_lt!crC2Xuwphe6>2gL-mT6f?yM=xxYv^!<j%ws^
zKL(0Cy~3iP7kM##l#OXK5-OV~U6FF=DrJFsN**LwxbzmM)SNmsiL((U!-3O_2aEJa
zoWzs5;$k<HMzUvo0EWpY74AzFG-%?eFT!s<c1J<CR@Pd{^7nwq*6O;GYw9_f0EYHR
z>M`NSK$+4jcnkeaSw{bBFYRZeRDrD11`f4((%IYHd)4f;PMWXV(awEDQ<)hm1mH9e
z3uS1gIWF!BQMs{&9dYJNdaY+*K`9xb0nCj$yM-hfIz(&3tUFbCPWR}wHg5)Fx@-X{
zjPUzoOE^u6X{UFViFk?IfC@DH6`lL>Z$Oz)-;Y^nX1z=j9Nn^SIVd9YQ6@97n@kgm
z3{}VxtCW$~LKV0hfl59~6@I!l6+(q#jK&HqsD$;)QAdq_Id}&Zp56dy2kUb*h_qQR
zrJU(mae+5YYs9!qLF(%bM@5Mp9BC~k`V-B%T`X@%77$*uqw-`Wsu&I@N?!<60DDTN
zQ?zf87X!KgV%k&M`x&NoQL7d`tMt%=Yo$x|P<feRR-F|(*(=Q=*4u;_#=BIjV|PYn
zDaK4Y->n54@?*eO>;lDgor~@yp=94{;t~2u4m6@^05R6oG+w4tnS@rID8m-g7xkTM
zqOu+Zy3J?P`drMWI2KGrONw(b7Kwf_fTnBRBA`uE$*Ykjh%n%sNaIy2rH_Hr%S^1C
z8DA9lRPGN~<#3n!2W1)vzqj&eC2q`ZfirM=)<3A8yO>-6jomL&*sPzC%T~%=fl7xL
z*b$NwW5?Fr*)5!_Qw8ssMm);;GlzVb)Qz)I_K69Kd)-F}fA_{e%w1r|f^c;1Z8qL_
zLkq8j7}RR|?FI9l<T+-KzGf;ON4-ftCaVaVgyHDsLq}l6DKtmZ32-32R6q=feM~L!
zzMnre8+7Jv*dE{(?T3KfbZTn|VTuwn4>`|5*X|7a5e9euCd+_0Q5dj3hxZb^SE^f#
zU(<VQ2fqEtlcg6=4%%?<KC*sMRL8<Ac=jCGCLmT)=A3?uBj1q-b|BA6K~=G)3J#+h
zkWfqF$a?Dt1UaFZc%Hc<O;<+e?tQTm-Vt{<Do%zVyUDryyM|+PgrS-z-SJ@#dzM_Q
z9@QoQN2}*S3=gLf<l@^?^9b((qgxN89|2Nl$brNlK8=`i>R&ZaU@4-PKGuj%$bc`V
zEV0H{iwrP#`hr~F6|q*Nzz}<5I|<xp;rm0O!DrtM{{sp7?WHJsKqjjsMjjzrnh04#
zdb5BLOB+oob>W!u9u+lgpcaBdwx;OL1IKx-ml=}UPWq{OvJ_2r2)keb@l~~&CiI8E
z>%b*c532Jj5Gp|B9W6o4J6O?r`S_uOb(IuRN~JvS>Im$b`h3|HVkq428k)x`MQ`a{
z=w)?ZAjR{;aoMDgMJl9-^1HpGH@`%`MPi17Z@Z@_uYm0;imQCmL)VuzJ$ZbzP2S~n
zyi}w2!ag63lys&mRH_mx!$;DlJf)SDKVU|bfDcD+;D5Hs?+3mdmS|j+m9dg;5kigd
zHXC2Fk<hUiN{%%4jL`G4s{)8)g<6jN$mYhaUyLXzY1i^g^%`DetV|>!OlIvV)z>~c
z?E$5TJQjYlQF?_u0B%5$zkuELR1^-PO%ut5V1@+<_L~O^w1r($7)`9*AqZt9JL@pH
z?f~(dTpOby{!G1hm}M}^Ml^}SggQL>G#y#K$HY^DP{`Q=a9*_KY<)#RgT2--l=~b>
zy2e66xtJYYXFr<&Enox0JzD&(_%XxdUiwM-_)t4svGew5Hta~QvBqPX-E%l;;{Hql
z7wY20K31XWs^uqbIe9H@Pu^K<Peu(4Jj6*US8LQuuiKgY7FzWX(aV-!LI2ON`~E=|
z>e=+7+$FuHps>(t_w`(~@$<pYBySygZ~DH8t(SDCj^bKjBFxR!{N4mO+hOQv6nWxi
ze*F^wWKl;o<GXji5F!<D{^EX@g*3aI2Qxm0Enk(j&=%%2!q3WERKBuCO5Lm$8H|m3
zUzQd2q+ij7L5Xa_*El0mL5W5_&p>Tc)DL&PXbg*BswfbkOYncM-5KELM<&No=Y5h6
zl>!tI7q!l%1eJfD!MmM|GJq3Vs{#h#dB)!dX#C~d-ZcQ*mcu3bxexsyj}QuQtgs~O
zX)3Pk38A6-3rO(R)>gGU97CNQ;#z&w;jk+wDs;qK&Tu1f)XPDl=83FXuBoUemOa&d
z4zq%=nUiI6^vB^5;PeUwwUXUO^<?R4x$@x^)%2cTh>AgTLvK~MxCq5sqnnLPU!sSO
zC7><uPt%chNbk*3DPD#q)<L8*XOMTgT7v2<Me`TMFbF%GCL^u8#U{kS{fhO*QIC*c
z#%?B4bv6VQKRT^HE@+Jxf1X*KQXo}nCzz|0eHt&{<(P4Pu4AJ<*+5srVj9m|x(dDK
zp0YeEn?3oz7M;j5BW9bQJ^IOVSAJQ4tTLru25hD5#|ShTc;4E|UBWQR=w7cD(t&C1
zB<DbSI2fVCvg*UaDiud%RMyQ~o|v{bh|;>*8sd-(>HKBN%yBl7GM(&!j+N%@x;(48
znsl{~1hVx`w20QH0h0m!iYu;73e|;Na(A2{<$P)wfghuL(W7YF()!ISJfG#{{zLh&
z$Sh8CTU}d?sbhO5m+eQ=YEefkC|j<?_w9agHEOn{L|>mVhU%-jq@C%W`3F6EStanf
zlTh2^6@pPQ7qWL{EjFfrAcSf+51M-?S}v4pLZXYK{pUKnoS1xybU>C$M}XoVkytp|
z(%Vm2{FO2=XivLB-XxpKus_<E#+|s%2%m*P+h2@5JiC>6=W}|}X~U>51b_#A5;^lx
zCuPSNChlnCadLJmzkyXM_BcXo=qQp`0tGXzk13O>Jhn43Y-18}>KWvC_F$k)qDZyo
z_J>tYVa-51orz6QI-j`{lPI^j-RZjtD3-EP$22E2F-t##MCIAkl$q@=$|+rWks;Em
zls|;JszwL7S|}Dp(0ijKh%dTU9f$R*;zK;?WXie9mH!O8v|Ms3aEA)%_P5#B%%w#<
zkZQB;`dHcB1pElqCtPi&Tsxk-Xw;*!C%6-+e4J9E`cz_;YSxz5h5v(nAV)>?@{r3a
z!HkULbHe8T?9$0!GR_N5V8%)+a%;QD2dT~{qGBdJtdqbAyDQ<<SiQptMxiQPPWwuu
z75fcv944}X($*0_fQhnBC$d2K<vW|_`RFvbdl#F0ymTw?%_A1Bh*C|*luqTx=mFfU
z_v=0yxhWw!DcQ_=uFY@hdH8d2=%F0C_1*SQt;3fqal^S-O9fy)i{{E0EAhi+i7wo7
zO^&7!d5{m=7ZU%EMk7!HkgD9Go7BJjf*`j@Hzz|AZ%CqLipYruAeQRKML3k0l?nE_
z&|ya^ZrRS(IVaQz7pQ617vZ$atOP=j7P3!n0I3(Z<iKAHWmOSQHi*f9jB%i1s1Vh&
z5H5AeSX@!YMYMHBAREe*d`YQrxTjL`g_7g#=i=vzOxZdphOK*%ePYTRsse({7mMjq
zf!+A#7&*<NY@rx4==&ctOgklzvTD);4c@u`Q`EhfjXoNM4pnS27pG%f#Q<ky8i(Fq
zSzF5St8i0Dj?$bYH;bu9UaD+hzz=(T)oSt%8<Y`~V4(UsbcrUz((P$l>ldFzwVnHG
zjjiqb7*J`xKT?f-uVOPFv@N!;M_q|^5NjibUEhTX#PYr;INE5V`?`%el__$!u0{>q
z`>tFYNPBvoqb7y~Mr<~ZKR}@0eX3Vep+!@<6}H|XP~JaQ(j+T^jPHdsYgo<NEH#81
zZd(nH+0)l*sSp#@8-#~sW@Nonz#HC@V^xM}+!cKLARAd5Lo4C1>Aa7KvSm5bu%68*
z_k2*6CMB}fylIK#v~W@lds2-rnUtb!lv&lXBjQOS#G#7l9dSN&?0KeN-_qAh2c4|<
zN$1mT*+w^8hb>NmsVQgBBSU09cJ_65ApE8z)HLs3QW$`6gXnvyxFlO_6}la31!0b2
z!8kcrT`FQtlpDual)i@Blt*O7R^~`(bPlZRsIIa)piVMTGgP$mZUf|(Zi0DOi2^$T
zU1EwPb9%G_1Fop9)WD=e$)-*f4t7b&$Jh19n0LeVlWJxfnwz+h?r=W(ZQJO#T|z%!
zo8sb0&?pele~=2(KBq)hwy1*U>iTLa1Fv;>h_Y0-Bzj^V>u2t?H^~cvXAQH!uslLD
zqtGB-2+4eK>5(W@N>4_6Rys#P8Lh&z%xOdZ2GAX>p#0RQYd*aAJ?I)Alwa3Yv1&Nl
zJp`slJ=krwz07yiC_q#KeO2UTJaL`ig=~qVJat`BGg5}etF}?Ey61wXChORhca42<
zE&A|CiLQ9+ktPg~;KgF@kgOmHU`z>B@Z$$vU6zZB;b%_FOvM|^hc*$fUlrU$gL?rp
zA(*_$$FqT=t|elfJ5(CO)@-+BXWC5X-pPgH2-kkwY-Cqm3&7!bkH{E48P2&l?-B~d
z;@^Iij3ia+baE}GFVY{JQLaJpq>&H;pMvvZ$zUawhR{=nJ4Uvf0&A6p3ojM8l29w6
zWC^b02aP%LH_t;ZZB}eBBY`9xLy)JG0NS}L%0~^(v_p;IZ+RW7mT7+;E5@4{c3?Lt
zuzmmN^u#wt`aA~b?v~}kT{%lYT$rK<kGc?%5rEmU%c{y+?^-L$n?iZFbGc4MX32FE
z+!YmBRZNi)z~BUZ;Uk(&vhxg&AiAq<a%B@%6YU<q{COifNR%!}w^Uon%1G6j@nC{=
zBeOvJByk^@8P_N))lS$juZMhcg9ao!-m*l1lo&>*%;H~gLU_|Fh6-S`xqI|t!%_oN
z#%)(Efcc3KNfkS$eElTl?^UXcvQxZA7jwq~Ql6)N?MaGvVTKOdBW`oX7^WIA>hMg|
zjp7r@DXSzStEYifxr#1OzAV;Uuuv?jAL6OvdmaHGVy&Ryx|6YLnBu?lt5G^BF0wJ=
zsSH#iPC~%KA*nL)SYGxshx%@Ci&B2`9YbkXl;CacK#$T+tGuqtxsNfSG;Ovomgi+i
zW598c@&I7PvZSACH9GfH$7rrhpQQe5I<pe%n6uo{WRHyd929AvZpnj<tI-MJ9rCN0
z?f;AJE!J%cWb<s04qb~VC&(m}W~$9}x0gv28F!_OSpS%%v(!nL&2!>%IY#l^1EM7<
z;?*s9GkWVdKU?0D7B?1@$bY{zXAqAnv{|`+J31Zr)D3L0tfP=SY^=lCC}ecxXtT)2
zR%BNvd`(#gWvy%+Bu!+3{t?8!MR$*WvXh?MJ>yw?B&Z?bsZ5F}FJw%Khj9$&#=;>c
zGskei^gdv{Bs&9D&#f6x6}JEMuu8yijJ5`+D?Jpz>@0OFyZaov@#UpseS^HBwrGLp
zLK{;@Q~NZ*(?On(vB<%tN+h37UCNzW^#zqNR)-qr7>PN}rMgXM5B;;Ml%^#moD;y{
z`6>j-icZ5GxXN+SQ`Q=qJKc>Qq!3VOLS7o2Igcb}N^*}I3};Z?R_>e7DWW6CMH4GW
z^&lo`4g`i2;#~M4pL{If%PPwJuw$HRpZR2VnxpM0#|{}Bd8EkO-XKjzv$4%Hs!AoW
zmy{Bc??hS=*+}INbW_r#jSmF!1?qxSj>fVy&XPSSyd5p?=DcmRXtM1Bjx4CTm4uU!
zKwR<1a!IyUr&t&)!RS^rT$)UPA|oG6`qyxLE%$@&S-o^P1}Ly?Bei%nB}5e3h<6S`
z0}(F1EgZ)*#u|q>yVvfGxG;nGE{X^4N(#27Z9*IrKQB^i<s-SsT!kef0o_w%R9IED
z`;_;d$N;01s!?&|GcsY^ms)O39Rx+!5PxXf<i;asP;=t|eq!Q%S6nD_`i@Yr?A@hZ
zt9)Zb;E>>+_03_xoP%nKdTQ0)QLY1+o(0E=je#4S_G`wy$yEtdMmB!O5%8{>f!xX5
z4s6x>kI{+<f-BLZXa$b~Iobx(=q;CedC3pbGL?%_IZxm*9uUe=m6HiE;hX3nolPWW
zlbNJHC|fjEtzgTrF_;xpjK;FLClOkY&7?S;2E8jjZ4z-$RcTd!B6m|ET**yYD9<G|
z)-+df_TDCLMD3Js8aIcf*zm;HO=Y{_^cZX>bs{R0g5z*2f{m&z@g?`hK)nw;`3Dwp
zQ6a-BHU{QReO2cLB1UEXS$~k67twD|qrHPx^YEm@0Cdld$Ep0Tckj5lyMJ_e@Qb~F
zD*vaT4(<W`n=0*n(p%@q7_LCPrt?AI4_vib=ps@hwe7k$SSq>B(30gRVq<SnZ3wa-
zsUcLZbDV;41tFCR!ri3S#z9vLyGXAjrA&I*(ZAXjs$IFkCcZsxndI=y26cf7PYN;p
zc-w3OsWhNC@lq9}^epc@jsENA)0E^WB*jrGcq?n^OxFR>P7Vk*Mbn({HA1)-atG>6
zC)kn&0Ea#ZT_IEw3Xx{W<EXI4Mm^d^$MJKHd4!7*<q#bPi5CSYGLH`49KAVybJ~6t
z4X+272ao@$(|oq;(Q7AkQn-2)ju0^}sAOC$c4<b~oXcxaVPf>ElJH2ZHkC|z;)M<Z
z?>YQZ)Hh75rkzkl1AwuLe_Q}aDHUdCsJ3efuX1^aRpL7|#nzD~!t3ItjhOcl-4pZv
zEz*^l)|urlf&7S4oT9}rMGFerF8KIPQj){FM1@yb;zizOHC75KQMXBqi>ldj+}v*+
zBdvoQovudb_t!^1H}`ecCY3Kqty8bj9*-s+8sqTju<56o5d=ehZ9yDiIH?UBtHPui
zS2c7vjX3P>WrhMPmLgibaD}q&-1d%-+U-vJ;OIn2=&BN&BpfQdpkBla?1mX>5PNfz
z*TF^Cjo^T%hwYQy=LgN@hQs%HjLaK`55$=i^i#)y*jG6cT7AKp0_l<-B3Z?*h<wF#
zGzZsO*_=4XrwE=PcRBk<Zx3Nj&yP+I_x&XSJ;OJt6b4OD)kMQ?aHePE1B)EW=vpck
zIjNCs>UKWJ&s6-X$uM-w(oC&j_0JV6&31p1oM(J`?E-Ey*7XQZ+5N_py(niP4gS3V
zG#rpRk3xQ`0YLSVxU@m};qj3?R}SL3_#5NV)ktq66)+RFp4o;^X?KPyO2e|z1+F1W
z3HBxDn2rW>ib(^}#xKvW{|%jw?Bqz2>kH{lA=eiCKGcOl)=*%JRXB2&zpWvDGxE`&
z=G^Iv&M#$c0=>CkvdD0FoOwiXyMp@4p-RLh`ngRTzlJ$<I>W+xus7^Q!>;Khiy7I-
z=}G%*b<A)25OnNz6n<q5tRyjXr{L0Wq*TroLBSv{WY}hdRI@31Yb{b<cs?r*tHkej
zgfB1^V2}1s51O492fHtUcrq?E_f9agzQ+bh2{pSAi&Dsve2aEgSQ|#C3@nqySwcDC
ziqscs^;TN@8a)lrb2H*=S_4;NqABJ5z9%(U;CQ4%%Q&gM){Ed3qb!6PuzU%tOo9a;
zgE1O?QCY1t(5ep@ayrT2Ea9C=RTv%p!P`_FXzkjb5OFHxWL~q6bn|b`J<T}BLJw>U
zS)z1m1f6j*<*K+;Q<6=T7Es|ltv^F^CGx{~oaLl>nrOHeg(rM{dT`Q;5G6E0hdrf9
z!QaG}p67BK=(s*x&q+I1G7#Oa83xoDs$TbTNxe42qi_da8xnP_*3Y)^e(5ns%6ZNd
zPlymA07=R%tb+&4ATfIp9cfoNjRc8qctt8RasEL#z->e`-Xvhi4Mym6m0a8X=yYqP
zY2aOY<-mp)sYwcc;ExS0IKe|jUCguD$n(S)b~i-3h5z`!clr0O^E)60J8+hCKNNJz
zblwjWt>BB1a_46hW`gigh)VQLu~Njl0oRy!GpFDvxjJ#&WRyiu03hhR1S^C;U0<i*
zeKFK4AgaU{$IyiWC%~X91T$Te1v5sUDqI)k4zU0;<g(Z}3EqNt+4~J=kfDIoZ{&ek
zHYCvM(i-rba?KRSX@MClCj8IS=w<T+1ImHowE^Wit;5!d=~`yaF)R2sMky=74_6S=
z;4!cH4tHvaunGp47@3}JkZ+lpRKWc#=zV5Dj@!;xDh>Tk4e{>7d(Zs?Hv?PC<p&L4
z0V1{GuUd`E6G>kcj{FrLaS*oOb$s(_Xe@lKFaL1xEPj-3SWIL(^9VUCq;P5R5xKG*
z`Um;6Jk>QZAOvb*5||AmBJ&P-@GzJZ!~)(zCVQE#FiHi^-{F7XhkbsU?0tnX<Sy?{
zTA5fGfZ;r^D4v42+t3n46Y(m)N>#yg=8~b$YnI2(6xZ7m>m||5BGensVmd(sb5GeL
zL<~ToSs{6yOqMDGO_7Ac;MP2=5Yh7BK9INeJcPiHK5A*ohqYEdSbnD#M^lN%^Ee$_
zx(Sa`O2lV>eh==wvF~f{6j^v9o6+`&!Xwq*3Y2Lf1Z6wFsC{3^U7@708oBFG3FHJ%
zQm8BB;m~t|bj6;&!!E8xMrcXadvg5C?#tcQVI=|puAGqhf;lObZCkH*(}02T77#4B
z&Ji#X<Qs<!*o;(Qn(xvH6zl{=_DACwb2$~IIm#919RZ@~OmjZgI`+TROBj1gf=IxP
z^LN{=)SZSavlQgg;7z1r;F7cx8rb=zvaT!RZl;NqLz`o&2*I9u+$8;!bf<&s&{k?5
zhWy)YDvt<~TvhJiZNSB3V7o6B`bLR`h6hX7styPUw+%h7YAfp%I_>3kL%%KK|3W(w
zoU!`clys@dE<?TupmRu=QE*j{HJ6CtrxGR92jizuVj<F{^*^khAd`fKpeMBjms8Gb
z<9~cjK>(>~-iuJ(CD16%YFe}zwT!k5w)n@0yk&Jb7%Kpg>;@g#Yu<_f?KkfzhALQl
z$w%%e_u;d5Tkkb`>x<HPySz8HPQ%a1<-7OdXAzb<8I|eavVf9}l(hUK9^{euMU`(5
zE$ah9p!wL=lHd&}{w`QH))vqm9fidvRA@l<w0cc+d*s(9N;a6<dCq(IqxLqgoM@(~
zUBd3fIs@QHY6zgm!c_;K6&?JcLjxi0V;k5U-48H{blKfD2iDCm%sIDQeNk{cpM-5H
z)3AmE*M^@>n2|W65?NZnRdozp{8_W#$5DbvzO2T`C`ny33=$se8YJb3R$9E??~sx1
zrVA#h@eaC1(Jx(*((Eq3sM5q=Fse`T+4+T(n;4LLwr!;6><**}?mhDNiAXMcgvw?v
zgEUcAlscNsQd3R9ShLy5hFxXV&vwc&k2qL{N~J1x%v8>qP%Y|4uZ-dp30hjgs2sKj
zz_=F57fs4x<iG}gnkr>J$B?j<s_)5#<THhCZBea)@1_G;rzix)bOYd(0TBIZ2HJ~=
z!d6%<Gt9}>$YyMrnOHE~vYE@=2$7>NbhEWCRQ|GLVJ;?5f5h%luHd0y6q9p^)^Ls@
z-{ZtyiMJ5+e6sEupNK7cq+mqf%D*%_?%z;G#xlP3W~my<S-sfJC%8(~j{~VWXB)Tz
zg~iOQs2mQJH=L2eT~nCGz|mzsK<^Hhp_HAmHV)n$;_k6$A5kp{sWjR>GD>sB91+1h
z)h`0yWB)CdBcKl!&mlm}65-`XrJ7uX4Gu3h2N`aP5Xw~gx#YD%t?d)6S8Nn;eRC9Q
zprJ&3)R^y2*jMHe@37eoWg3^~mIa&fhg=EBOVKE9qkJ|Imm7;li5r^6GLsU}W15`!
z;|z#9x!EZa&AD%@Zcs1E)BET*1BMIS;hHuIpk}sH?%&SiRzfrFOJiZ<?b7_MhX~tN
z(MGt|csCv9nSVm98#I8M0OmUiXMuEZ!C=61We$6!+@JLoHp$K}rlLV~&Nf|)+UrAK
z3)Fv1N)8LN;i!^Bh2&VYv^wmvmsFBk%3h#V7SXatheoqKDkJSvsneGUikns14k*}b
zjDBS~I|HCCS`WuggUQsY^dpWRQt#cJ3|6!1PV&O?0SP&wgqC30GRazw6n#dn>Ql!j
zWp%V_RX)NAQ6doH`OPG!TpWttusmx~r$nSxDa@>`c%4tu95-FFC)^!7X4rXS&8a5P
zkV8eU+@W$9lPm35o^f!LZJl?`=xl9wZSQ5%yGvcExMYPgV16YNYDZ2nKZzz$kuh~g
z!CHN9lodCEW6@j`b@v1HESg!2ldF;gj%@-XSQtXK7W9W%VTYI%EBJ#|PU1;q-cB5c
z8R5=sCm2TvDuYem!>%)%hTUw!DP9qL#C`TZ2XIE1TCj=y7B=_gBeErY#;8i*`J#c@
zT8Wn|x~-z4i!EFipEEB}(Jw!(SNgCTtIG`sX8KgVN9Vl*gwDU1NMaHXUpP^%H&p)%
z9iaeh=w2{LGL~@|8T&RkPY&9M@-`0JCiBrcG;louMwsa;?XY|8Q>~P+OD<Jt#_7|Q
zIzN(h<z>n>VC84d!F+Uh*g5&-O|t`o+c`u>vV^DB44|J8a2fRdNAvX&eT8r3kTKd%
zoyK;V;Dzss=(}F@UGeC<o)?!ecYkrOFj@irrAP(ZZ?6MGk72&qIHm>Gt0LJL)^Czg
z)~&60ZdvtcHo`DfiFDi0$f&)Py~2c2T2K79^%JqvS%C}2Zi1>XDV@nR{!}1Gf%l2+
z!l4;rJLnhKBirj&rPD=iQo%~z=jh~%l(Wc&*#MIfNhL0nyC=F3D7yP1U0}{v3Au%L
ziz4u@h)AOik(_fWJEAby)X}}V9R-1*=bR*+2TrLTC$Vf8^fMc)D+`Njsu&h3fFr)c
zR|)$cp;aj%6(^^kh)l{H4lZJKi|^B_PhMa7H3EmAW+HR9xdg>RvhT8_Mq%I=vDan6
zb}ySnlk^Kp&`>DAuEY$m#)ef(a?5tHRgraiWALHnn+!CAs=c^e%5z=}Gb^qBAq9+v
zg96HI|MLT^Ewt~;pl4iJ`e`K3I|r@yi9=UIjsCseT->OA0;0z2lF;haVzPg>t3A0{
z?^?d|Cf#K*99!0>THB=xkqTSQ2im65<-V#EmS{nVY!86gvD~V7Ud73#oc$0L(4797
z#0{mqQ~uB@yvXhcUba>;6jxn5QH=3$JA(w|JC%i1+7>B&vD+$_kP36YoVsr-u4HzC
zYJkeLt5`LGGxoCMeaTN-v|eIZx13CnHSvlvnkrkm+!W&5I3I6V8R!*MmaOPSt03nc
zc0q9~UzMG9svUN;vyRTPX?frTKrb={3y#bCu57NA{ql^)gp}9px-0@CM<ub}EE3Rs
zHt}`Nl6iyl98CFQ!Tzl5DnhWWRwo1vYUK8af#_9=kia`(bwg0iP%_Py&2R!{Ukinw
zvib3CDmp!#Obh-9keIArvI8{uE>x1wY?Kt7^e`r}Ada;*Eh$kZ?r7WX2pMGF8sRqN
z+QL*CaKon*Dlp{a55X-X0NkGEcyR-7hb3*FdfWw0MGI(AB_ljX2C4MxxY-N{#GZUR
zcM`;(hDI;_QdvFEZ&;?WZil~HByvudzuS7KE!0E(<=f}0eaIbmopl_W#iYC0OV4KK
zq;cE0_)24J!DnaZKK|Qy_+ZQa7eDv!@7()K<9=g%=fQ)A+xMVdW2f=p{$HZ4uQdML
z51bzmHKM=F&Ss<OY)-oc&;La~S~$!Gsfi*ZB%q)%*1ak(P}E71kvJP&Vuqe`HUp9x
zS}SP3UYz?nh22xsR6f3Dez*p5!Zu(?9JQ0dWkTs`+X?W$gAAnq=n2*gnxwy?dkLU%
zHh{Z|(vm*IZjh~`Zjkk0y^WeR#hh>e2+A{ba~9-7TL9<LWs}TVHcBQG2!oMC#HnLm
z88)umBExP^2e`+iZw9Fd?@s`njyMb@#nRc?*ut7lm9!j{=2npAk0(XShoM*<5>aka
z5*w;DsO%5ZtjpnP_@O(Pf@q;1dtfCB>RG|4-9Z8(?qs8CDkv=*ps1<9QhPH=I_S+t
z%|a&iS+fx>uIj3ncPU{>qIPZ*6HTDx3g|nfT<wK{zLu}-h3NGia)dJ529VLuRXEZp
zH^0&rWK)v7xDRwal1dsgN-QX_#@PK{j>ReAb(q5tv!XG0rg+XKl<7@!xuK+<_or8g
z0v1x?N2N}HcQZseNghMk1)N&0)d?rBTJ5NP^y1|0?r}4M?{AKees1l9<ox^>c-W*2
zn#Zk|uTG*@M+f`O<94)rxQ}|bljGL&(~~3kVP&@sZ?4dZfoHpizeLTyy*X~S+tJZ+
z)O!5}Sm*r+1~}e5JZUxCanw2lc4EJE_%e>5kLd8|Bsyrl1{QfgIys7QTvBzE-i(f3
zM6a92d#~Wn-RG@?*2yn4<crqHArAKf#@mhF>>i)A_D&CWkE1uI$8V0>)ElmEzt!G5
z*u^9&8!!hLH){S2Tz%AjwR>>jEf?6V<}oh7S?hD^>!3wZwKN>8mLukHS?1dw01+m6
z0EFjFbFYP8ntyA;igu5GiJ@B}Q%8sG=D(dnJ9r-L@4nuB32Uq^fDY`?-sy4kHBS8K
z1@_ZEecnE4ot&ODqnAfV`vmrO^Z4i1UbFo;Iyh<*;7;4k7zR1n#o@6RfEql8@6S)$
zErcHd{Sdgk<I^`300?{j79a#L*oC+E3D!r4v}OR-(eW?XF9L(MB97j^YQpcZ=ZCVq
zljB_kM;idRcVf4MQ30MO)?%Z>=F5ZD%jV%;6Q3SoM{is0W}P>$)y6h09{lYtjC_jA
zr%i*o@mC9%W7^uN^&;Bc|G9;e=f>C@phUYR=mWpDPxoF4^zm41-n#YIOcdfzifJzc
z*5=u*zxL98HcF%Y+Q!C4y^2d-^7HpwOo*cY{KAgx?(p-X1!%d}AA=0oNB5)J%I0)9
z-W=rT8`DqIm3SptsXt!6yT0hV`{Q^8b=s)be)M<fC+c)?s7?pJp)!!a9RM12I^GDu
z?mC^HcRRbsFWaT&pEo<KDtEJf%H2_pEa>g?I<mX_T@^Lhs{hXtKT7<6(JQ_h<1e52
z{Qvg${Ra;{{{Q~Y{jG2O|DW+emyZ4RL3S2xZ)^eU4!7-I)Vl^I2Y3xGV~gzB*(AXn
zXhB|lYiAu8@&}*AkeB#+=;mmG4ut2Eq^be)V+Y9@@Zhac_ZwsXjj{j6*neZ}zcKdz
zD;fL#2pD-_RpA=zywY5~`dj~if4<)RTL-WmFz9G6s$rQUE+};?{RGqm-4;ifONmN<
zVEe-(j@-A!hwEY!4aEhC5Vlm2OwLQc0XK`k-NH9;mfSV4Se&evv(Uny7rn^?vX+pw
zlwB0BQg$aztbAi+fI7RLB8_9GbE0qBwY1<=q?GTINhb$3B-iMyfME`3<9>j^P?tL=
z+U48~olY{994MVmRI7D5;{+}Cz|z<CG}#a_8?kwamqZhztgQE<L2;%=V)udv(U5=Q
z5u-smItNPam7RL`{_(BfAKzdm->aDbkiYL>Ep;y4OiD`WTs@=Quw2;r6Yh?3=)Xu4
z^jaZrh8adXAk`hQ34ik@>wEwWId3Cg9$&h&#*VeN#?G9@(ZheS)!o~+R(EfE&g$sl
zzu4+_?pv$dxj$!h^zgsM>Kr0T&UX)@Xsi6|_fga+{|eZ;UH%nz`Cj=~fX@B$udmUC
z`(gR_=Wy+Ly}a5#?)<!aTsw)2x=Ja-fdA`XPk^*upj#rkNUzmvwW7YRs&)BIseYx`
zF?U)kwT%|{RS$r$bI?4j^|8Z#{n;~TQT1E5(AfpJzHBtWx1`*nIAHKSgmoHq1WaJJ
z(fi`vdPAa@3g9cd7d3iv$APSEy{3p1Gey@8Ky0l33b04Zyz6%HePtI2(C-1D>(2&u
z4MX?!#?IXL8#{|SxVJsGgL~VHI@q~Cw}YMgZU<#+bmdMammux_iF+B2U)r)=oT~QF
zd(}Q@xP?LAsp4Y&8BwojoxTssl`4b#J!dT1?yol(;KrQ62sOUmV1P$+1|u~3+`$&&
z9EF4ciWTV;$p;}@tT1tuUJcUGpGil`t}5=Rtj@00oL|@KaLxjW7`U-@G5r?RcuCQd
zC+<~IS%eHfUh%`ZRIEh4uskn~`FQz0ebQE@X`j=pPw&cv?sIzeiC~%fE$;RAYP>{|
zsDzjB<G(CYx~~d4J`LZTcVVIbUD5jP)2KANFGcDb_qha0-?+~u5PCtMDs%!baw_{;
z=Q`GWtJkBuidn0(0A0ZY(5wH$_&JtYzKEln+r@G`-P|sg<Lay~ZgR&;8Q_2NEzA0&
z3-Olj<)U#X4G&gB80GN$6ssU}VH}Q8?dK&g+s`K<%(r~~yYaL8T|i1cyWa)mWXXQ{
zhD5aK72H%P1L4+MHp-^f?U*4i2j^5?m`<*5{0_WOvvr!-z&z!EH|)p!)|-tTYW4V*
z!h0$Rq<)mv=ac*js~dS|!I=YKo^|)zbDvhe;I`(uPn{O<U$+tdVK*6HmqwL-Dn=b&
zSB+{7duhT2{g(Y9^n96g$l{fZQM-`!Su_3e@N}=!vAS8%3;LrF!Z_-tT8&HO)cEZ<
z+K!`ptj0hG@tbvzFO7Ox-(DO%)bC(xe$jqMqhdA;_1*>AXkkn-JA<YkZlJZ@-vaf*
z1f%72d+!DL6J~9_!D&hLPFqi?_=^6O0$||Bp@ZEG8+nRtSs<$Ci}8Stl5={jNx>s`
z=|wu`sCxK94=KAn<(c%(5OqCC8GYBL`NworaC5))G#}(w>7=x@X+9f|t>0x=(A0=w
zO8Ea8#VgT&E|bA5b<Pf2aYNfT4x9`PjAU|NIMBdLQI?5$ip>baWQ;9}ApXG|y#tmT
z)JR?G^&!tjHEva^C7_}1Hdkb!+}__SJ?5ClL{@JP==fQJ(Oek(*25I=;{j#IJ+Xsi
z&(o<LKx;KbTMXwDrJ|h)0DqEE1}IF}QRrM;<7CuRC0tAsG)jB5N#Gh+&#k;eYMPWK
zbIf%pt#s~Gh62xCHf5IwLV*oQt;K;nTr&kIK$l`?6BEq?%z?62AtY;S*7`bX=+3lm
z9V9bFChP!mi&)6J4)UlU<0#yF)IB37G}R;g$(`ah9pqPlp_l2vs>23w;Btr@qDPf5
zcHgv!HRpL?Y2D*IAHK+al9cp%E*)x(x|0J-UNr*i#H{O>YR_Z3!#37=H>Xka{#g5=
z+lD{g6TGG#y_uRbjO%KC(kYRJWy>eJ7#LdYWO0;EA{k0?XLvw1z;-@NxnPpr245pL
zjL}DePE5WGT&%^)L7GmbijW?-;Or;ZT7`$I0*mPIfRrpE=2MD-;XoK6%JIYK)G*C1
zF%vMg#85PO+vG4oKy-$}ObgWD9~({`DeG9{UpPpy+!R|9f1;b!$!JUWFUB_k8`o@~
zsB7RPEv7Y}mQddF_d+we-5CazTi2xg`_FdQ`s$yO{~u;zkZd#EuQbMd|G#?=wzqal
z@jnkAeDnYNGd`Q)@R}cNFS~CJcHbQAzB$-^bFlm7VE4b$!A|_yRwT~;V#WFmxrK{#
z0Eel-2dW~fVIm4uj7z8prntoF)Ii*Th9oRe0ZAC8Q%uckzbVOv5@PBk$CXvGJ}It8
zT@<${ch4v}m+B4}uPRkniTV(sKjY%>oNx#8(7{9ynPgTV16*SM-JUgm)K3$vCRIqi
zE-HYAnR)PH;|xWVc!zxBGiX-Kx))SdSBi{5!%cL%<C5^!9Aiq^Je>|GPiH#qk|bCV
zRklk@Q!XO-pTGuMZ*(=WA|^i@;{9=+Cj+WvqjJ9hU`NF`A>N*nFG#w$lf5?tI!gSN
z2(h&wZc1&$&K9bqveuOXfP+n+!n$=@rwvT&WWa|seE>9Cm6B$nKSALD?<&lgEOqNY
z!F2*-Qy{WXZCVFQmiesEiJEcpD%lO+S-QF@iPk#P1Pv*DrNrH4oHUQ_RjO!h&6U$i
zu{=(K{Y0`sooAR`VRJT8U!y^Oj@9rebIB$r#^FIHBHqiOq90J{(QUw>a=w>L6PDQ%
zzQZ;#hY4r2<9s`XT&#>5dR#piPB7<rj`FDmSyQt++HLarC=>_NOUEh0UaDE@>Ua!I
zR522kOtGFFAkbsdg&@ADUq-83br(p(o?a8Caf|j&I&Iof7H6sKYho`P4<i+FqkP50
z@L<w1!VEH7NG(oXm=tFXCoY`~t}T4=R!-=nkZ_%f6Ehs0(~LScg=%<6DPc0bk7ctt
z&o%N=>1dPRW{ANdnmz{ETA>C0L+Ci#qm}T2YjrspQn(u)?@}i<E>O&~0$RYO_ncW#
zMj>991s_SwW*;XaqdY4B7-oa{oO#KfQJy>OiZeAS^e)VX88s6z-TiEmaylt~oc1;)
zNz_ynUr|&evdl&2N7q7yP^H1z8bsaV0?WKy;R(n`sjdnOq`3Jg+8ybdQE<@|Tv&O4
zHH^);M2|Ra4DJn5HRe~@DUZ{<j(Sq@kMUiyc8UUm^lo%7U|!b&9ze{`KATWCT=MeQ
zMBhMEewtM+k{%(Qbn-p`kSVuuzMk^BfY*k0*=R;-+oC?)UlY-;5TBZifp#X{3sp|D
zP<4uJO4>r<X{c&U;@Vlf5&YOxgbvg1Wj$4*+s<Y$q#Y;B+368Hl&O!moD5trXVPXS
z=p7m*S090a=5kRWbWkcUMH*ksxU!-{FPI8lWt`4c>xYsF^o9XrOy*>r?p?zP_%;-`
zV8PV@2!S=a#(GnetoUf^3_ILKLP-fxtvWnQdp!oarP^Y&hzTL2EIU;aV-jW^u(iPH
zVN<N%D0&+G+BJGBn6zo3a%SN#>(4l)Ty)1Gjpkt=vuvYxiEVnuM=ICyo~n8|O0R@Q
ztW%HHgmj^CDPwF(G?E;|$00-zZAQY-AA}NjguB+-JOcVV%?1uhBQ%%$jf!n?X8Mo1
z`nwupozK18YI1YwI><!03YA}3?d!{QN`*ZU58xQX!OHqV3xzbA{%K@g+*2pL;xuwK
zRW6#IkAWx5P|MEA8D+tyE24&Y>o8ToZ~7HhRuFXn#GK~cd{D?07)GC6fwrI#Y83mu
zImlE-yb_x9d-hL~D36n+QhK}2?%rM#1eL>=kAv8xeHnPsJdU~x{3*HS608;->-?*p
zDP_{_&~t6_Havl{rn~@-R;{`tNT5?a5@@i#De$-_-SJ^Qq9l>efoE&>VXvmofrzVl
zQd%t<j%K0;x3a}!UwEb*CyFYNfoykl{Mc)U$=*7EN244X)4!&L0Cf-FR2KakZxnvT
zYRtG(R!jV^f{vhs1uyP1Nf}FCWP`Mce4Wamm=0n+hZwj%%1(!3xtsmV(4_TeNvith
zSL-er+Up$sq{z^*qywc2FI2eN;d?ocAM+0!;GnSVRZ_ggmRurXQo=K}OBS-OKjSq1
zs_)yX$amFLh=E>aCRh^dMiarFtLCw*s4UC?q_9i;Mt9vf&#1DXR+ZU9sod>&0MqFk
zes3RM3!Ff<WMH2*;lPp#^j3#PdrE_<NxhWPh}IPloSU}42)&&*ksxI3IjF%oTT}D~
znS>H`EmTe@x^oeJ5m`yIk(QN}9@Awo*0u7E7+m1CUZapL^?F!83M?g?ov5e|#lJCs
zue(AEAL&LNp)cYvzFTTedzdW3-!r^}$btpjFX@d{yd05Jvz<&&DcwXB2q~?tA{4iM
zDwU-BDFPyNww<Gm`6@}{_M3gsZGS#J3w)>U6FALvSoDh%)XJ4k8dbz!yi+4hB#Q1u
zDpl1}9>e4g$C7*L*oPf+4xE;mPmv@RmYk7xnR9hU`{ZOWs+S2kJJJ0nw3Le5?;RYq
zo1OOFt0oq_-}ec%v&3J?J}8u~>Ov%HRe2qnBdLv$_(#X``@`;FaDecY?uvJgU(@Z)
zm4(fpL|amx1FjuFjV9FrD8nFhIq4>_iThMu0Sitrg`VnSzIopj#TDB~)w!5;G*^Y@
z(=iN{N_AqDi$c<LtIbsMq1sMsOI>s~X?;t#U~|77xS{6X)xSFz)dYF!s{N!gh*h-p
zY}VKN2;aloI8i<DF48-yvDw4h(0D19gD_SQ)hZP54F~=>91y9cj0F{(DoZONMwKyw
zIip*l<=qZ*<n;jKxQIPOB+(7gAH|SH3+)j6Hcu1#v#;w(J0tI>ZigXY61OEvPmkk^
zMcX<@$B7lf;T7~MAW0vt7cQxT?MMrUN(qN=!|S_eOQmPYWP-XNr2Mw8l1xTDHYH;b
zRk`LUcCN%<b6-%-=Faoo<KtHI7&XVD38KvA>4=ICYYVf_<Fa=Q)euy^U#!<w+9p<f
zsXAchO}s@>eFRr0DPu{gl;>mSJc2memaC|WU#&!5_L;)Y1UfeJfe-Nr2Kel{%lBI-
z>ayccX#|6TYLvxywF7(ZfV@^iFWz|?{ny+#8TkXtxEVWD=AWD?;VAP&u24VWbjuZj
z7juWOBfCW0LUbZ1j_FfrBieF@65sf&Ls^Zf^8~B8h+2)Cw&+!jnvQ_xW9IEZPdCO6
z#cO{Nb_6lP>OB5>*dbeFYiP_?fuwf;yn|FUnlI-S(@Cn^**u5CJbU5~K|o=G#K<QM
zmjj@8(Hg2LSmUGpI!PD1PrPwPcHH7){T5H<^bqarwR9lRm%p`06H=t<?kaBRAOnKN
zbT6%Z4JQ)aaU?8NwaC@gAm9v6$l2(yBJ!!$Xfk{>M7@d+=9N;hi!#e+8b1y+U99E`
zrjuWW9nl@!awZ?7!=FQcy<SVKO#t?FN76G3@sw$%*r#2Dd@`is-dDOfvc9{?9h)5s
zsIG@`y;eMp5_`E3IxkOzm%!QyMcSVYPzh0JpIo$evX7JfI@Mq`MPRW|Co$>&n2~m5
zI81w}$3f#2F&9>Orm3khORbemt$wtsO}cCkRRfx;I(UfZF%=R`##Bqgs}c*3akN>%
zF=jGRw9ciEBwG<$1|8riHb;7J*dn@n$ht+&5@dy<R7aRlT%4a-)uZ0`po;feOj>+Z
zGdZ@4G13&#D_OlR>ttT7JxJ4WtsY(EIjov2dwujGS!Jhq%7KoZWB?S^fpB@WJE}5?
zvLQJYRCxhUT~4N&1JW<za=CaZ#vjimJkB9|?DjysfYX7#y-Wx8b!ZAdO9|T%9SJh}
z^vV0eQqbI%<zY{1v{JeGsx#|c!tR;<UCrS|7>k^0rUp_=5ABkrim|!eGdsEDJ|@Nn
z!9ChA%CE{uuBV@m-1^;r7yzpT-{(?2O*pU{T6s(Wk(4@HWU^7ixJH_PzHNre{v_$!
zB%9WJ>xfyKcj928TVH9O%@g#oJUTu3Qj3vSk=GUp43oW1Ze7ZKg8iL=z-9SH*SMB#
z7?%s8u401CdMVwARO73kbTN}Fc^KGk4AFQ-3U>6pL#H&+p9==6P#H@=fQFT7RSr9&
zpbjglV-E5u_SET=RdYHv#O$igtA=M*p&<OCi5<Ht!_S`AK{op8Ky&(CYJM(F(G@!@
z#0QQh7PGU1t-7pd8;k3m&=3Y~UH>saf9`H0Nj;lrS<>K(dV?(zb|bRJ$WwK_da8bT
zDp#kgH<oAOykI|NjiMTt*WixKzex+=wmQBRrBc;nz2k|uRWi4{aSm@Nx|6%@ZNX1k
ztIC?4(Dc2FLrn?Lr&ETbKHqk;5<nGB`;92GLZ~4kskJikqbVUGC9l&~-hiYPG{lX>
zk9dM`lKfcs!yp}XsNf=Jb5YsexM|%IDbZ&Ne$7R%%m=A`bRfu$-}z>UqdW3CeB+Mm
zatrD^!%W4x($tydXLMTBD&M5(<RouXF3n2%keLwIY}_#s$#f^XbOG=27d@xP=tpxw
zJ%Y)?%NX7)9WjIOV!v~8)Opiv9(N9RUpMQ{9B~^ClVLUe`m*^kz^mqjn-G}O3yPk9
z(c1;yq;g&Xqma^Bbf$Tym`(^6LsRs-F9XrG9>so-&RppTE@w#=o~lwggmdHWSl6ds
zbO%&i+}9gZ_c(9Z<_LLZ;v)CcL2~`|hA;IzZyNhq@kh<0-1WSP`~>ppE;`Kz5R`>X
zkTWim!Dmm$4B$>9HeI_1IUV&*m@NoQ$*>&5B5)+^m;K>}g*(u3+P(bjf$WzT4Wu0m
ztG3v2bs=`#^*#depWJN8Qq)U}?j$>tsB6<D5RsV(f~>2+LXFC0aU``zBdS%5x+PWd
z8Wu2~O?4$T^crVpnu4?(Vt<kuuJn6PpY(g9+3?v4nP;)oJBEy)Qw=b0XW1Z|UTa51
zM<tB4Xh;40CUj82rx;0o5u2PLdBgd9m#r}HRq0Hig6j>Se-^%5K!&#oxc}@Z*#Ets
za{TwCTa44R_Z5r4EU5qZ;6dYo7ytcW=ia?<@!x;OXEPA|eLs#~C(~)vM*Zp_>-VE4
zz}igz&v`mJPm7Ij#T37VgntVO{}vMdEhPMZT}Zf7a%Jy$4>qs4Z&h8fezFRo0Jj(}
znZkt_b-pQG6rr{TTu6VkbH83wzqwAh>M!*axJtVds)`|<G<LWX{B2<;q)b2FTi>~F
zy!C}2+PM$h^mLGRFo|MK<`?zhV$#zlChFby@84}d*m<vV6PfqVvh&Y>d6Zy2r5n6|
zOF!{fPz%3f^#yO(Ua~<C7ExZ=3F87I!kWL@aEr!b5dC4RQ@GLCDd9$Ar-U2ON^K8e
z<J|3S?6|mb!<S3AvFQC<`iZ}STKFBSuP?w2Z$yO~Ut_pMV_CTIN38B&H#=BK{sRtf
z@YOPZ@n^pL_we3>QvR<8Tif62fBq?-aQ?5YAF!n7_Ggv!{3aGg-^9XiV&ONj@S9lp
zzeOzcGllhsl!ePl6^8QOAUms&0qvjA%<KNvMd8l<X^;WM_asUnL>KNavk}mro;Lti
z@B|9y{@Nep$+W6|r}>Rc^zKipFKhk8LpgcUii-p|O_d_;<sd%;p6eRZq9s!*JqmO0
zqT}j@3R`D5(9eD%a(PGG_4tp2bY!?yyD|48$;s*afwF0ja&*5{{`OShzGk{ZS4I7T
z?F=WiE2QPSt@ovp6{~BjZoLHRJMubL9W>sfu?XJrz2EU8jqcukT=fWgTVHpdx+QYZ
zNNSA?V>Rlf&cq<qpc0A%b-zpo!zTz4dn9k))chN<J>SMW$s&r>o>}`PdsUwJa+5c`
zh9IfOnGZ-^9R-IO<>8S+bu?Cg^zb1(mC9)Z`+R5h>23w%_B7@RT9F0#sX(Y|WWw0K
zr;)*SLe~FSeO$sZX!r+VFa!FjUCR$YjFF8hO!TJw_rI@Nrw&iTv!~H^=;Z~oo<H;I
z8SwTZy{JTfwa`GxEh}8wTiE*`;lPiFH`QGUUD#RxjjFYpUaH`AqnW_I+zSxM^~!ZJ
zZBHgHqE_t7h>B=fEw|^i#Hu!W->Ns72Y*J@IV$F;dYn>^m{zZ{nOX|;R^5o#P|?fp
zl`|DOI%kq<bX|S}|E@2bh_vSVBvoy@R?BWhyYSo<pKuq>>>?zL)+-y4!w@1EuM(pX
zq9+9DFFBMIScxGGi{brQgkr(G7S2r#tTqFabk%K+=Be2zdS>SIWs@p{@Q-47@H#4W
zpr&_Qu15bQ{=Jetnt%0w*{$vsR>k}3QE7fl++JS+e6YrTf<?D4Ci(2#S!XZpC$qt{
zJhM5N?qT@tg&4jRv@7v@E?(chAzm*xl|KXx0vj3LK*M%d-Q&zDDZ%NF6*q$G;r|9W
z4oAx3x$9RoTYt;?YfF1GT9QUsJggD}T}(A0-vPNLhM%oJ>#_7BKl5MpSb9{Bk}qbz
z{_1yFkERn9K-rxn#RVlyMLpqJf;l_KvuTCw+v!7hohcS=;qVfkH?0d=zPqOw82SZf
zYJMRW=DIsbvHW5~{LRcGs*l*Aaj1nnVr=2}*4LdVJ)RuL2TYPt50>?v4iuP9tSen)
z^KesmU^PV#QOXkef#v}JJdsi0``x=#=l<P?_jW&x?eFKm&qK@m2$MPQyI{EcG=K}S
zbVxF3EVGLNS?y3t!6c_UD@2Xr9~0@E6xeBzjwt5@rYId^`7_k{4%1;y$>F5l(P%b2
zOH~Tpvui*Em_Y8t0OLDA)&{ke#>=ynI%jlI$7k!|y@&T3-*4Yn8IQ1^T4QVb{+j-e
z&P04P!o0#1Voi}WF&^4AjL(ovN$g*oO;<UN8s-S1Jt@MkGRmmCO8v{TtqtsvV{)c;
z5iyw@mFB{(w=i|hc{1q@Fv*fh;fry2(JFMXimk|_7P^9o&|$Isq6GjBA&{U7j9xKG
z1oh*Yb!yIL{da&9a%{NA*?@@tYy<~&h)H$El$u#+zf)n3U(;1janxRRo=poYXohC7
zrh{(icj&&ICX+533n<tg);8joX=bo|jIEbJXDGIqkkYl87K~<!WDBXEAz{r5>InX-
zTP>_N|Gu>v{q|dQ8*mZ{7}f`z#Vde8_MwNh8-~u3*u1ws2H(>3X3mS@@c=6qy*aEJ
za&4J$hn3^5Ei?Fe)!+wfOHbjvata4);fYwZ*uyD{<2F|%6DNghdy>^!kdsMFA_W@I
z!+sUW23jOxmUNoxoC}*s7x%tq-j8ZxKjM;eSX))~$Rtantqk`xnyp*dE5AO|k!COt
z2O2k6AptKPVii;LTNuaOxsYc(-TVVy0*Li0kq!|8kp9L~$tR$~mZfJn+pGZ~aA4PW
zxOLo6w4Va3sohgMg&q9WY#si*dr-#{CSxG`iNk-vDh=UWLkcC=i%^k7T^>?%gR(u3
zuBE`8x;!ZH1FUI$Hu)$S`c-0Cl_M21!V@*(k{<*o=nLs@IiLc@q^=x(%Pywrl}W|w
znEEmOWrbJJWiHRG``ldS26A@O5jPz{Q`IB<1?@|MN<pl^Q*QQd^j=2{-N7f$k&y>>
z=G)h3eCI<XFviRnNtbSMI6XO*&YPrgC(|uPgDBH02zB^vRo#zPl3cqi2ti5A?5op!
zl{2;N+OaQi_sTY?4bW9b7lMD88l+#g7a2Frkc~^34a?lt{$Ajm-evDY5(zf}goNj1
zp(LPJG}6fL<zrKLu}ltsrRWrVTfJQ66k<aBxU{CQZm>6#q?dgHLd~To(=-|kw)rX5
zoR~yID)}<vlEr8`$K66Vt9#oW#T+!YjI-XQ9ny9QkOTVS2|(tFd9+=6WS-qCKhvMn
z1D^yrP29(UCRJj-ZlY&#zr1Pk<Uw>7UwEb@lX}%YTJJpc-l3_6gy+Dj%Zrjue<*cY
z*{#}<M&K3eB?spk+t66=_+_+N+6sk~2S}K8%Q~gur&_$sRuZ#ZxR_Mv=9QS_Y!)V;
zJ}ZRp21GwNI68dUdEGjsB$8C*gxo+>sU2mKRqtzron2zKolCsYbRYHT$Dk4=iZr6v
z*Ds?-aAE4d)!Vy&tKThOedeHC;$xit-G-{D5e>7^tkBadaY%k2mwI=6nanWr!oY|X
z-XvW2<uJ{g7gXC=RUj6b&T6kR4O%ybNK$7R$XFv%un}#^Cn{Slt17lQ1tCtrxR5=k
z{3cSp$oMTKlWEpP6Elf;$(V~@4X(M;7gc~zmA<f-QBH*^RG|^XGb->ko}CS{E>LkQ
ziL7dBPz~N`+PxTM|Cpt9<u!IOosNq~o10fxR~sOvrDu8m5rd;PVYsx|R6nh!qw@@4
zgp1moUQE(--7Ye-4suno4m-Nu-E3?%9yIP;okNshLDp{5wryvnZQHhOo0Yb0+qP}n
zHY)9x-Rqz9TPsF)9QTCIxA!%(>&@<_ul;T4H4SDs?RJz@=20Tv19=t}5hIbBr|c7R
zLp*!%G4h)GjK@x42G^PjT{1dCsP*6IofRw$p_#XcE7THmF7HyQWdfOgkr5Stb4qAJ
zqrJ{+nkHk5M{NPVx$5g`FRhnWJnL&~o~?J^OK<>z!usvD)i(INH4AQQ@7-5};jV`6
z=Iyneot{=7zmNXsndial+g87}R+m}_yN{i2ua{e%wpORx{qEb__1dl7j@`CipP!wt
zj~D!{-S(fm@0S-p_qwONdjS5=z3)J9cvn1b@4GMHkK}BcwZQ9aFRm9iysN7#?yWc9
z)6h^Ycx?Dqh2*=t{=w`}czoZVIp5=t>f7IX?dNy<@v+PI>U;VTy6gAz1<%*#=<EOX
z1pxdF!1D>fSB-JK2yx`|DES;@R_ojupCm`2hn)vt8e4qCl@N`&eN}oqjk3To)MdN=
zh?Ptx8PYDfJZzh5J(CT8bwh$%@+cL8=kBa)QX?x#z2llYped)lakj&=bzsq?JI45A
zg1lf=xx&vbWnV#*f3l+3NEd!@iooK}hkd!+!0r+6%16ZJ&f85-1?9rT@cp1vwUk#*
zpPk%!b3;5=M7dS&J#dloSs22dm9IgR4KsNdO;7Pv4l~v*$ai~ZM*MW2z$=psrG?|<
z{^Xtc@h+<?CfbV2@)4s|z0NA?+aQ6PrgwcG3})O1&AgMEDSW9gX#2dg1LR#LlhOO(
zaY=tIv!uS8;)aW&g0W$ra@=QPh3bI`I^t<e$ggoqk0kCst)uV#)-a9b=EXyFKU0Bn
zvs9i-qdD?kVMHcxE}!p{Y^9q^=(NaY58?zXriegE+H6j>oO5=(0bxrg&AfXm)n?l<
zIH`3h+&+dr7>?37hgm6R7tR^nsVY-uOQ1V_2x;28#B%VjTy_=~MZ!wa>l^`k5;N8=
zo&9@J1dZQ`G;45k>K`IjQ-p(HL&ZPS77T2OuP{!K?A=(d(HI=i77>y8diCYai1EU=
zRp$WhupB(i9l)_ZvbYeoR<95(hvF@kXZ?GnAqWWuW`~56<(P#4XxxHSr-f4Q5T*)C
zLm?O!P2mnk!{eF<ji6=n&d9i+hrAQBBM`b`K$|dg20eoOC8M&xnEDE;h!;N4{)h<C
z_hy@mCfI*_?$TmeLf`Bkcg1Jll*c-aSVygs=?osM&WKn++*4l!&6|OeP!#xKW;}bI
zW2=0DTW;b@$n$m;w_8P?`Ek#Q6$B9H;<-$!iLs!!tkmCa<7VUjMNm<%KW0b0XLa;V
zKT$b>-XIk(_Z^_3#kLjT;hh96K1%&nrSco|WHlsY-i_D){&vtcR%OGU2NXpx|0HgL
zX2kJysG(MV^BkRhz1bdZ+An)?JLapB2sa5uEDQJ8&To8ho7v_;SEn;yb#EkTCX(+O
zd53Sw9wSrU3gL%@ZJm$`iS%f$ulVgt`g{un222vUpMSqtu>=JPc+pr!+942#Spy|P
z9T-zno+<)9jSiBE_am{TTy~}^IajacfBPbW$wh#8BFed6*6Joh+x^YHD^2gjU*zeI
zV&aYWVfWAlbdrG0VErT24YBCGbO~V*toz0k+G=LgpMf(+hy;qc1q5QTDE-TlYws?V
z?#rzq&b!28hf9F<m&BQDH({t<E+K!1w+H_2LPbnPme_`Q;R!$^NZ}6{(O51>3)4{l
z>WY=7eA{N(>irMfR)7bJ?U!Q=EF`%JNLVd<1=iAhFlEdYDyodzt?|$I@TQwGC5CMo
zCuIlx<2*)8X>j|~zJXvf(NwV}+jS%2O3d<Kk67WYOY-%+u=O*hLN@j<*Vw6Ri-k@5
zP}F2@l^T^P;@aXp$JIlJhzB}TohjX&T!RFSJY21c`Z{Rqv{_N_aL0aQV>`0(Gw!GL
zK#g=h2!M%W*s0sVzlfbM=1|uwim|saV5C|&Sqcd*xVdFQE;H&}zk5iFg9`L$Y)c?o
zOAP1xDf^b}842@RuBA?uAR6Z!1vneWlhVWO!BiQ>pw$&9lR}||s!)_h9sg$nm_Nz_
zNA>2Z$mw-vaX^)PyCb5J$BD%v$R6QcTmc2+35wyQ3Ho}dis7?0v?r>oV5%p)*y!Vb
z1#g#ZzzOf4xRyvjydTh503VkwtbbMD*BV9PS}NeoOej|27?VMQ%9WP6o^Me|AAYce
z2_NrvGy?xne%$ZtgN(a})kmBnS3HeI72tFL06;l|pg+V)XMe+D-D;hqHk-#{JI%}l
zg6?BHc_jAMgbDNbJ@A2E3YsyHQS&KUK;P#aq)9pmFu}kO@*DkJ?4*%hCZIMTyd-RD
zBzALxTQ<Y9VuigJmX|EnjWJ4OrP|uz+Y{t*zVR68zlw(C^GQ>&vWjm9o>%II+7%3w
z25Z|a!=xx-E%ukQL)k%B;!y+Eo6YerI~T`O{H=fKu)9ASQlYJxvcmAT;R_CRa%I8t
z-lCQ(+A9|#I&jj%=Vj%lxh}%y1vh~4xhufE9-)D90D`1JKM(cV{FazZQtu^sHi^ab
zJEjfb(5;s}RmQFoV^pJo3*9+7l|Joi=xE#h>L#&&OpT;9adoBuf>%EhVbrSu&D;Ta
z@lK^K5(Vrw_3?VT5SzupgH&@6H+1GnK<FHw*oI3Ai=8&!P<hNcyesH40db>g^IQ$G
z5B272l^7*4LbuAs#xDcC?Lbn!YGmeS5UmR92c4K4S}4+om83FUxN`qIHv(0wUBnEH
zbQ>4?=Amm%_a0lCSAeO9=BWPp0V}QB>_V@8sY=%v+J0g-FXgwKlm0Y!V#2l2Ho<RX
zNO9g6BR|c2T{X=lNrAgSIW#wcM}CoQ0E#)4lt5fwTifV5=WOM*O4i!J`axFe5o!K9
z1@9BV%W;0zqPrjQtCL9%wiFEwAb5SOyY=NKYcXgb&oE1oWw^+x$5eo0Ss`IQ*9=i#
zQhIp0Xf&<F-6@fFk2GX84uIj&{Du)}a^e&Gp!og!7@OyB^2R7D9nYUAwFJr4k;f~=
zV}S75L39nUJGuJ5BS9YWingPUvd95QaklZ+e9xVQSG-9OnS&W(0UHP0!9fzqOh8CE
z*T%)oE?YhdFcGI1<v0qb0EH(+`AN$9Rcf#f{axh-L2yaT4r1p6hxHB07}jZ^6#eb;
zq`)u1+qr)ilvOrFf==>!5wRe{BB=!^_;OzEAwm7BVtaXARoKh`sH_k8mK&be{ZL%y
zKD+IoeZcX==Ib8-9BsQGT`Asvs~s(_#}&@r6MQ;`zYG5U%NIokV(+u1=Kd#$7tI+8
zdXNfGxRQtB`7vteJhwrTwDl%%7jD?mp{LaK+tHWp;XR=jmPL}uC#=8k-1__Q3)iHq
zAGJ8HA!jT=*uv;ZJ-K@X=hQGR(&wcNVgKq{{RzC?98~iqScQwk8~$$T)F8qHnp&kz
zhF(629xeC%g@3<W`brnS!i^~(QOuxB9uGq<Q~E~+N+TIegqD%-Sk!*MhJH@|=~n<3
z$i_=Q_*b^daHOXt%9L8QXluW1Sf7H#Q80&VLY3l1apHkh%q!C|dtyq2N8MQ|wWxco
zYcZen(631-w#x$4cB(UOJpQ&yYDUt$yC<X(c1+$YS>)Q=|7FuAd`^KM=ZV3MkQB&i
zjNAIx;PW-^KV6WQ+vv>cvX#rY!Iu~2k8*SxAS2~QZZ(VlTG5%s--gK3=R;DncdJFM
z5|n@RU=iLtgfaBO4KE9_)(sj%<4Qi1GV}u6tu9;C8_Ketl>~aXvBCB!|L3~jx75dR
zYn_LO!&CW!OIj6<yW@cWmoc)p?^(uvr%gl}CVj5*U?(+wM)2lT;sgZ~!$o*@Mx$e;
zaG38H$NIwMwHc4DYV_fCz!X-B7_ZFc+_3}-9G-{(>_~JFai5QKVy-nzRs0Tx)>-K$
z-zL@P<x^gxkASMZ2O!pUsn(PTSY<>cn}9hMZ3@xL<|j<rb$MRTW@s4VvOWCuJ*Ly=
zKuh`!ML{)wF8o7}iZj<iO**w`Oj&y?y1hHZk+%8cStb};LsS!3UCZQ?YH{3mF;ekU
zk%rcRj+}wlRECYMu<o(t{)hjvGw_N38vu0(hyHdm*FhyELEub);|m~o^qzqIbV2J_
z8W`ohG1?lba(76$*4I1;2Wd&H8<8W$is#soEV#XYg^F``dpjj9DUOv>%NksKPZ+GG
zFw3w21^S6GTM>k2s{={GSZix$9vX<_Au27ONQDEO&FlR5L|QlKhiV!<kIhpE;6pg{
z49KW}W)r7khXO79#t2J4Nj5F?aE2nr6bb=gsQKcH^N?~iNs50vsL9FR7|_%lc?c5<
zxR42(a{|f(Gdm>_PXeL-SZ}JBDu4QofKLhxo0Eo-{~%4&FGim6Sr<3i@^}U{DXz#I
zqP4u?cS5M53TD}g<w4)RRBhO7jp2f4_HMTS<k0U41QyYwWzOBnfZmzoean-{H2MFO
z>(4{}su0<z(4jYriPP+vXJTsLhHd<M@FJHM<l=}*1_lp!7JZvH?_T)O&Sk+`(n(}E
z%aJn_0(Ndrk^i9jl#_Q090%1sdBlu!hF>Zt=d@FI-_ygi7v>!TfF0GiJpg7A6l;Qp
zGq?sBcP8E(d2$EOC*Fguv`Tk2O0ag9)Igm+cAMie7dG=QbouhiiZ!ERJE<KchgWy!
zAvGB3sGha%?%5j@%V@h)5#8;3@z@T1G0bl$n*MR@l!rr_;n3fO_$LP(M3w?j%dwUG
zKtipzJFy8${cP)=lq=YurEbnuvzuW-87A!mFv1i!P2Wg>byAXQG67*0HR1B?HSTgf
z^T=2dS-fSN^)z=&Gk6Ge+n1`Dhl-09!_>Kzrt7M|TJRHh%k&N0`3hf;@I0!*%rSNd
zCTlw<liAva_f(!n?(1T#+4BQtd(kbULa1$F0maR?3Gce1*S)jtB;<zk4p617DZT4(
zIP(Df2W!pt%WKhb!A0-&l`<DWfRfLQ?fjl){G4?BOG6op<elMelNfCkm*`&UAysUC
z^pW#jc-Z~i+0Lh<_3)3hF+`TWH9q)f{>^E+J(-OdmFBH@7g0647yj3%64qk&24d&m
zo(-GcihX9kk8794?H!->DlVr)lbh^MnhROJ^mcne=@|__@SG*7Skpti6pO)720EIq
z3Vx@T3608KM5MBgI6mO+I4u;n0SLtxRotC8@NGUnA-pRUI|x~131fY?t?M_T*1v=p
zsq|kb`gYMB$eh~;+C%7tNS0&qyqQE!ML6NhoeN72fXUmKm2czY&894SIF|qV9Lt2+
z_)b@MS*$3!FlR!YG-`2XMHQ_4Ksji;7FMAPd<Ig(`@>1=@u=qBF&hHMg0cszqoH8i
zIL}#C&+8?C2kailt+45KEf@*xq<db)I7y*I%1Bd<Uo)aPF_%NPj=kV^LC2LXe-@_M
zNQav(-ndtM_sy14%K{zjkr+rr-3%!$oLSMPrWi@PQMC)sZfK|CCvkfu`K~nxHwAj;
zBGO7b=BTxzuf1OIued+ILyxMUuf8J=cfSN$)(`o8Jn3VmeHSrdz}#ZrM3ee==X2fm
z_H4S{Ye|7ND4$D%(Emb5x}f1mPU;>7t|v8o>gJh4&spELx&##(qY!`=J9HnmReOj1
z5mzJ-#C~{*z%mmt5gcU~@xo|ua@s2(@l`AEqRSp|g)SVwXv7QMDTL@jR8+N8xpfvq
z8$qPH3Ns^pHuDsioZC+<`peTf^$!yhBRm@DNCZ+WIH=az+PWq$oKHp_QXgD|U#pS7
zr5|ps9ZpS@LirJDYg<R-ANH%xomlr-p6pA-3!GEfSaq}=a8n)I12Bx>#{<d_R<Rn(
zc4CczEerp&tBh~BT0yVeH}Ct0^Ke7=BoisPU5%wqAh*X9-pU+dg%8Py@^wBU5v#-x
zcZw?%lEWjR*!o@tdAujD{}MBR_*@y-&uZ(AO0BLMOjF`qyBYvpc15~Y(3}K7|0CQF
zH32iiU=7V}Al^IVQV}X9<nagB?Yw8;mlJ@vr*!FqEu%{GVe)ix2Wl8$4?$9W;BkQz
zS#OrVAysG$%_HUIdYHH%AH(GSs{tUCn@d{Cp2tC9ckn(`w+ovj7YGKNb{%~ouW#cd
z^dn7ed8-1eQG9^h7;3xui}F|$A)Q*eqL_(v2QstKKe^`!3M$!>d@xaCfSP1Q>Ge24
z>j7-5MfL1qC%tDWgAhp>tA{qc9=o_5v9C3VueNGAu%|-;qIAEfw+{4LHg3#0u^KZI
zhS{?P6x!`*@1ci(g^H}~eSj@ZEL~ainh#`cSdusxiZv3kzN`XtIt7|d0}s{i-6cEL
zYkyJ{)yj$QfZE9jI#12>2>$d;j7vtoQ?UP_r${XGsod%D<ayl;F7c~qsSYLH@R7{Z
zEm9IAbJ`G!0V|%@ir-6cNi*YrX}6&`Dr%PzjbWEtctW}Xvg+SjunRZJbzp#>dJqPp
z{(-FI{^9B>U;->K147TeT;{~}Y+fY%;d`)RNX&zDVVP`GZ<TlxRu0=*nPpx)uMHWr
zKfXPic~o;UxMT0NmG-;VPXN;wteMN{MZ31fJ#$pBB|~G*qu%Ax<yvV({3o}O7Bt51
z4CWj<QKJ4E*)s|EwPKa3+b@4AV~Ti1U>c@~WxcQN<x0o(2cC{7f99l+`%}`Y25pkU
zjB2znZ^Ak*CJm(FG%U?PpGGzg@H|gNUpPqkN38y@bH&eMNMYH$g*d0LB;-&#({y9+
z&o(y+3g}f|hX3gFmujcef_1LC3wA<*IJxr9eoEPQ7>`JAWQ;>Utx1+JPyGxXCJdrC
zY!s%4JK}UH^=VD9NtU_S?smulwmYpV1<>1sBRx<@>4+Qc<(0m12nRsVUlhl)CG;!4
z_kwS^B_CBDe&Y88Kp^`KD7eO_x68Utja~;f*w!!7HyTz!A3LAun!v_yszkV%w@~~Z
z(N(@rgrKL@bMNkom+Rj;f@f>Dz4`Xt|Mhzf=iU4CwTdxAQmJk$uT5;&09UA#dYzhQ
z;gJ@q=U~(6r)4{J+dHt}n=7P|N?4_rT=LC<a(;<W#2172WpH#BTPW&B!tf5G83a@6
z>fUXWUHPwW6LyN#`Iq32>d-O&mMxa?C@!T~gq>f0(-i@??Tu+bb<}qWt!AKpg#^h+
zo6e?xa|hlaNDa8R(7^Yj>G+6p?IXNP$5Z!(1pr4nf*bQ@!rkLyg>wx1PXpLy78^n$
zj%NX$?^A(zAJci|QAB7vv$JeL9jvj(c=W_J-D%^xpGE1OG;TYicW3SiH*N4{x5xO6
zZ)$r7VReApp9;>;Gwc|_D)#~rpZitRkU({ktN-fzRg972cBG(RBan}lBh(|n!X&X=
z^+r-}P1DrGxBbyqp%#jp8&D3bb1M9+FnN7RAy}R;#BY0G_8;Z4UkGU6(vJ!?|7`Wo
z)|zMC!(NWw&)d$I-Ba#Q(roMd?Cu4hU**pfu21F9XZ82P?-#xNZzhE=NEI&Csa=6e
zp8yzhaMvT2kIrSw=ym<Oqj8?7{Xr~lb2yEk4EzC360c4>&ATrv*J$XS$1c*5#)AMR
zG3w4rl0*hmWU>Jq&sNQ;vq`FLEJ)EZvZNRD2sJA5aUo4D_1jz>u}Wh(jpk1lGD<JY
z#?G355rV7AaLE%mx8)KWw-t&~l_(VTSPr(oC(L=~x3q$2FCt1Z89au=iNH#ZcDzzM
z{rzUhKh&CuEW?ODl>H{g1*72`2Kx)nUmBbN)M$42af~rJKf7@H4~Rr=r@OLRUVMZn
zuN)SD>}fS2G*V?M{8ygKTidl_e4_6(@1&l_U-k`~oc7b>%>5in{)xEEbX*xgPxrzV
zUVZ$_(s`%vjrB@|Fnm90Cfl(PqCoi}5G8ho3R9|fdkr>D_G7EAx}m0M^$np~$kZ-=
z)a($s*KFeymn*8WV)$Zj%VG1H{qkb5g?D1^4Wh^sqt_t1Plte><ILeYdK(97vp{Rb
zd&{i-&tWObiCrj<uJ_bZ8BtDH)DQKsNu=CO&fKqhh<7j-7sgtefRC{PVso@qg}V)F
zFQjMiwHY!qqh5WmCqj0m%Or<mq0gFMaJdrTRzUbQPOhg3$Y$%<>M!sh!CdxZD&=aR
z!~fuV0DP|iI7fe0&C_Zlz0uyqb#eL-=)|)0Cjf`{B{fmNO?rU36FAOzHiZr@uTpbu
z_L*Wc(3KgHQq>>9(mYq?Sucun+XAxu^NKev4g-D4^}d`)iiz?PgWZdGdtP`vaSfxI
zIK%#W0Bn3l)Q5YtlF?fGQXk_ojjiO4AI%L0_oj=P4i+qsWvF_}CdF#?WR7Bj17qs3
zH}zjS@k%3CNeYJ$1F+$_Ak~g3S=nR+cFj|-oJFYB=*5#keQz!qo!cBhN5$@j`Q&h|
zG(G96_qH!tyyPwN0?Ouw`WSzYoQANr^J{@k(m+^9`=wigY-G21=31_>GURKbdAuId
zvYCQ>VugbLR0e!8X44zQ89q-l;NrR@O?1sN+<8jmGc*JhgpEPT_a+!610}=M`c_?P
znwHr)NXAq0@yuk=7ayceoJN4!ekXS)n<6J{jI-6brOQ*&T2`@3-h(k)F^>0AgsnQl
z8k^x^#Xlk_#~@*9e@;(67AL?%0Komm9toHYw~HirY8A{>N%k@&c$eELtGJt(Iqn}u
zy(0`$i=%f;ikkurSiv?is+s$lZ{C@RnA>i1W50N#Q=1=njXY`b!qMMd5M3uL&xSim
zbB-haS*5N?q5$Z3Y$4<9Y;^fRF-So9W7XvjZmrdA*gHy;%dyBQAd@$EwkH-_L_bhD
zq+E<|O^`ri;FPL$@iG*i;?Lf)7gew%Fe&aVn;bRI?x=tkJUDmc7O*yxcOHkH7qa;Z
zVA@7&8}cmA6J8B-?g1_3_|;7&9kQGj#_|@!#Og#H)MDmrjN*OiL&7-1bu9flsUoYI
z3<%F%ZlrUSGzV&#mrYJAU&EWYIAlMjIylcmda}%pi_EG<PsYgSW6en!6PutERXf}=
ze$q$-+r@MIP^(&Qvs>wxSITl%#Vsd{`eshXMjp4G4{4=9Kmb!kKQo3om?Q!&KGnW1
z0e$h=(Zki1-l<MF>Qc1Q=l4(kVrSpBdAJRu|5i^(GXCsU`#!!a%clmD^hUDu2Kw9y
zf@KY49|{SuiMRv6kp;|TDhILd{B(>dzkiRE0pS1-uO+vYsE+tpOFuiF#9ta*OFBpo
z=?Fhmzl_;#2>%)Sw<W|e=elH(3<f`A&Jzfb%V^p?UNWk)Iibj3GkO4x(%s13^7}2f
z?6ukqPk8O90)LgOXCq1f9cStwfy7QZN(b3ycdQtB0v;XU_^ixp?NXCDm%t_^SpzBb
z`Zo-+2E(()#lhO#;DZLE#9mg($VB-BiKG$S_aA9nh;G|Ag;lUAvGQVxlq7RiU-t0a
zf<5_Sc2$?#NonG#?vr_S3xFRLJU!Ol9Hs#3u0{n#lcoupk!?9^)EyzZLKIp4do#h9
zW%YUy9sLX1@MbP`ET^SXB8KQiQ;!Cev*lz>$gbWW2e2d_(Yb@z`hq6ue<6WvrPpei
zqmO#;-)!H9cG!rrrcaBd%VNgn0tvwmuQ)}9HPqgs^J^MvWIC5{j9ptR9cV_AdVD?$
zYD;6n@RxCWHgJ$PHGD#1g^C?;)Hu<Z+C3k4ISLSsH>rPgdA(8}Jx9;o?YFa}|4G1_
zwk|BW7II_phnB|zbnTM1@29ve$>&W!#5Uf`oj+|tZY8nz?`YtZd$8`TMz@LP^SgT+
zz`eRw#Tss7#yxhe^??Tf7WOi0s{j&dY;2wxu2cn2GC+}jtbJ#47CZV@+dcx?mM#*@
z=4u`yPrAl%v@Uwnw!fz|h~8#jKYIdc18W5o^g!AMDaA-cvkvB|P7$TMRNtd`ts8q@
zt6(T%=Yh`IUR8ElBt&dThTKaH^+--`OaREON<LC(rq8kMi#9m5Nh-%{@^fHJfrn3F
z@hHBp&IJWTWUy;r-<=gb9iW$tG6P~KEWy)z@l@jxS0M2GZT$J;NfdS2c$WRvQD1+*
zb7#Uni$o}o0FM}{PRFsc5Qw*HJ~wU#7qL*mLb2GJN%ORLTGM<_YW0<+U{P<n6u4s0
z>ETUuxRS%B_iJ_X+w^f*;I0vq8(BBuZ7wx>wMB}i9$f|5Wxe(Q3y9-C<Tc6<F^(D)
z{g5TD6gJKfEYSLMM|Or)dFP&K7wjI)2v)Ns)jp6cGS7spIT7H|?bse5vW*4n7vAYY
zOGH?|t$ya}z>`6iyD(lv($5J(ZjZU6_srO}FQU%iIj!!$HF^7c2~HGQ$KIL%N!dIB
zzqVR{R0+gZxS-j(_-G{TK2bpA;gkmq;ps$C2&*L?K*q{4l){16U>ZK`hH^>r)o`a(
zqjYR8*cPw*-u*)QQC*7vsN1I3<Ms+-e)Yo0>{(TtZCpQLPIQ9Mom}ChcA@>A(mz{}
zX(~c7I^j*5cR;m}2({h!eP8gWfIU-uOew}<yInD*Z+=DtrL80T4+P*NeAj`_^F)r#
z*|orfd{}i!vAsJrWO<m&^FAjSjGlK3%x&7{`p4B`vYJCy<ZANjHMVhYd94&99Onzj
z=NF3_TLvuH?Vi~l^yqD`dGbhxEiRz+UVxOS3V5P1Q~H=T;IB9S`YvJl_<7O1*6C5H
z+%RI<>3bckZGok%qX}i19zDKrn7`85S)etZLlw{KCwCSM|0PFh#YwxzW+fabBx8>f
z=E=foRHX!y*VL&~<+s~JWuW#(D7bCgHpe{;cP}`iDFYEo|8-!}A!#t|<mAWkiWPa@
zl*xyNhxQ&Z#c3mVSn!jL+j)M2j~>?XMq@AzIJ<9Y&+&2{YQgB+MlI%m59}Tm*Ja79
zr!~*arL($(QEha;G3CuV<Aw4qdQx|W$9UxuzuU-D2n~=gavg+SnOX&@oXOoEHE-CP
z2CJ^pWsIPRpsQA9htJcgIqrhP?ELYU4G-ryQNrDKpvx?1he&w@=KdFMQa#v&etKor
zpClqjBe`^-UYgRtw_jFVEL%}ICaE^%Nb!hRaA)e(hCN4DY}`0O+liJ*Rn<<|F1d3Y
z#7PhJs+EzWR2-Q~Gf}cacS=B7g(2wdf$Q+^qZr+bv!`&fPh@9f)8SCsVON<Y*woe;
zEMT|%qDK?}3OAFb5Mj>2tEk<C+u5I#M)5>@94QO7w!IML!29%6$MX}$x@*PTreNiu
zlwRKAoZAKb5b;B(azx*Fvb(4IF5fDug)};!1k%EDVvlziJgI*Yf1U!<qm&f|YCZxt
zDFQ8TSsBR@I1O9G2LLR|b*LWai0v7Y`W)LSQ!<uhx=H#>7WfYl2UL)Ju+=-{fay`4
zs-F>>4ey+@$rO4w>Gu>Nvzp$5aEj>_BVWCpnm~+H=sTr7(ak*k4V|h+8g4gd9b(Cu
z{VL=c-{VtAGtbkH{^W`+Zn^5gy-tU+kf}J@;2k;}9^PA!svQnlTCQJSsw7y%-8W%l
zq^mn*+H%DP>wJL!!`pHso};;MvR~YeV_2@8Yo#-ls80<3G`CQrGQQjc;k`tfFcW!a
zkQoh2Scx90rR17n$5#rpQ1t$zZ3bj86=5`?u|~b9q0fmc6)oj64t9PLs#Dc6Gg{Cb
zLKol{Y5N`KGLJYt()(z`5=nMK`n8!w_<wSsJtePm{bECu&&Qded%-{Kb8`-FQ1{#l
z<<-+!_DDtm1xQ&m57_Cc8ak8MPymtiwR#27E8uo9JJxuEe$IgJ)a4)qFD;Htqf>So
zF9DD|AJ~ei_PF-3<~4XW!ktM7^yHf|jC<wf>~hz8RIXNS{$xB%NfTBQ7)=urX2VIg
zFadAwkY0ICb`L1dzVK3p_3WPYdwoyNwTcKH0-!beVyZP{YxR^&6)An|zG}VHs>@U8
z)I}YGJMT;q@|C`>H>`!Ms)<EOm^G3Yuq7;}W&r4qmX^g-nglrAgte8EO_Jgb#w4;G
zc%4X!M^)2oKl4$T&vKJbE%b+^q%2=aGTYv*yjKcvrB=&`BSOSrSEUca##*=-J~en0
zK$51$$CmN;Ekfr@HT@n-vf_d^Y)zSvSrf|x>~2}bX@K0R%!gw>#^p+PLP6k$vh0r2
zf6I{;uEQ$22B0Y6a6cocoFChq|J+3YW4z|%Cc}liLh53*h>yGo<FQrTaKN&gitm4x
zM?#Im%f@UMkm@P{BkYyOm{<?WP-OBe|DCt@ghSz2DpLfo&sg6g%MCIcNdJ9Z;8rZ^
z{LDBwqPFd)ad*>s!uQPe*o|m?8d@m?b2UEyq&YYHK6BOF_HP5lHeW%kq#Ty4gG&3{
zH!Xro8kqOnp1kP&gXM8+iHl<he7UzXPqtRF>aA@9M5D()a$~8XL+zF8t$J(7pV02)
zVLMNN6n3`jZCws;u^ovLmZB(kq@VDIPbiqI)(bsIN5?z8=BArGrB`iXI2qFNTJ+sV
zDro6MKnOTx-j|Aj&i|~-HLJzshL6LxTenUm4gI~*HB1G8;RWCi%lAWVn-#Rn%G>Dh
z%9f?hlOT&stDww-j8vn%R3M9G8!H_=1;;)4jJjyxK%#=|N=6v*0aVkU8#UkUingEB
zxreoEuZV<jmJ`kkf2^2&e`S7@^7DwkK573np$GyM!#=RhQ!S8BD?93va5^WUnnlfn
z@a6BwBp@k?1#0H*cFD)%BMUjSp7L$I@vT3Ov*|L;#ySjjbh@h;i8rFGdDJi%8SUnc
ze3fa{JN?mL$T>-|w}ozAVx^(v6g)M7?2t)S{=2%j->@>T{)x9V;5Vq=M!{4K;DWs8
zHU)^<c3>GShLrRSlqH|q7beuj9@ZPSQq@Azgu^!1A;y~iHGqfZJ)m(Ecz}&5VZhAG
z(W_014ho|f=G@TgG9jT7WXu51B;b%PpYE*X3EZbnl0IJnj%J~MF|5_|kq#paspN$@
zRNomb7UcKUW4KYRW<Pk<7BMmQ_OaiCjO^|4s?|Rl4%V<)jls5qlyS_`3as2kZShGM
z=g^GOuOwoDeWt6Nd2oZ_Ew|TxmvO=bL$7>u;_%a{we)NNNd$`wI50)DAWRs>1bsk?
zIO_yC2<9%_=sl3b1c?$divi=vOH*&2svv4)c?YO98q$wB4wEblkbd$@7Y610jBsEi
zG7G+Jc~HVMQWY4}7x=3qs$5vlg=x{H8PIlAl4v(H0BdU3`4!XiNRcd6oN9qm?~eUQ
zlNr@?18>~UQW>>@Rk6o{h~^y&+#cYubj<yWLK4iuK(T`AeD39-729=%`lSKuZ{|S{
z_0%F%?F=;nbaNHBhaGP=^OZ|MGc@Vp)*V#t`aTHmVrTw^b<e_{?|vkfcC5<#+#uaU
zRBlgd<qYwsy~<49R}(E^(3ZH?FaItY+ltw(lt<4VR>|lA3`F_A!K_g!0VJl$SGDdW
z_zvBUHpj+Edg+yFL$eWX$V2@1EY$`L_=PXE_{s9kDG8g>_S9kSK0CU96vaBc2B0MD
zPN*}4nLd|}n;ZjuGFv%IYWzn2r5O&z_wwi8>KO&I-CaYp!-9J~i;veBz@K5Pl`AmQ
zcBIQMg?k*}VdPhqJv0#4ds|w+iCju_sk9<Q#skuY^epk63|S4su%jOBSiT8MsLlza
z-Upx!;LGO~pb$^0z{NI+ms=X@0RbW6r^j$w{i&pz@V2k($yBJ^E%5~Gm(kYeS`AL9
z*oCGX_`+o~eK~F-*9N(TvQm|knhQsC#o@{sypiW&-ob}uljRfb?O)$hS7cKQhD{r@
zDNAXS>k{1{CidBWcx`#b;jyH+4A*|uXio29w3y|z)NaLr?%<IeXYUCbSZ6;LDPlo*
zZ2Fdmk4IO~XFzftBlU@+40SGYVHxi0<0?bj`_6&TYs{ME>}x(^p<;TXEMYp;#7xS9
zI1o!8AqJc6_-w!FtUHWC5zpZvl|<@@s80`O%qMeJE(+%}`=QV%@oUWLQ@Jdl-J#}I
zDR6efW;bHM^{9EhP&yCu&#iE)uyu{Z4Lskldb~TUH<wgw_{-=)qJ<X@=E2JfI{m8R
zlXC(NFMmN&7%qU0U4KZwYuj154$ghJP$Iprur(n~BNn?LPqPU$a$TX=VhMi*X9q56
zWjKLcf|rsT`;_plTO2)KHs+rt)Q_G&YnEVd^UZE+dCi=!HV5jFK)WD!nFV2m(i8<x
zvb5+3TJkj`(Q&wt($Y25g3Wg&*<dVwbn3?!YtWoPnjON&mo~0QP{}(GawZ}mv%HGo
zTC;N4sPpdDr|kC9HY;*3XTQI;Qoon4z9q#GapC5sP^{(jo!qkIBLdirN^8yOBN-g3
znfyUd3})ahE;%<>@?POcpK~EYp#wN6Y=jvw@f20Q%EycXJ))i$SG|CA$({Yfty5pP
z)f`p_l$9I??dL9%+)CNgdGxkIU2+6b@-qNnPtKyI9zxg7kdDGSavd=YouufjVJDfR
zuV>ckAq^h)IC&a!@UZFUOW(t<n9`V~nY(-6X0<`F4!Hxg`D21;sYXkc#?^+Rr}x!U
zRr{|!wuC~X@uW$-_yV|?`Zhc<c9g+`cOqvMZjZ?jN7qM#P&2|Cr47jEGel^J*Uf5z
zai3(3r2^TUqJLU>jtF71%1fQqdc&DR{6p&L^@+G-f5Z+Ce{-$OkMDh4(f~G&#ssN}
zK<8H~W6laP4Mo*3Q6AC3tpFlC48+C;t4zI9l3njEEOd}^*GiIW|8TlAiLQ*Wuf&^b
z>CsG-v}ycCATwyG;vkH=E=OgDUy#g8RNf_bHYgb|EW(Hv*d{UmL+??uDK)(FAV9~t
z<0l)O4J|#iA;WN9Av!MpPZG66R5Et4rT@GXKRUh3zH26cA-vcoCDK%O0%LG+V@<kN
z<^dC+Hk55bX_9F{seAM8dU~8TFgI?H@H%`Xz1=rdn<eftk<!h?-JVx~RGWqngvT2g
ze883B?$&rSwE0xwtK1bd-lv6(Dl-2a-W6=n+Ol|Np%}yePBRgrgKy(dz5Tt23UT{9
z0de)!R^7+<c{vCl_O=hz<YQs>c9>vHF!v;3_hX?ndhe9c%XI6w@Jl<y?#8*hIM~##
ziD>ys)ILSU(4XBY@$$tzAyMoFbH7Gj1D_-j<r2NvOW3P;de%RQ<dRqZG2T<1lX=M`
zaG9{)yF+>=%#qp59yCnYH6jPQ`XEO$_~v+0RS|AWwIcREtoTB5?|(TWa-J3p)1oLy
z_kSvInf0<hMUP`IZtyiJ4Q&>)U|76Kp|TlLcMNGKcm8sPC|(Sk)A8`7uflfp)OLU&
zvG*PlfFppX{Nk6BUO2TdL)CR^CRgIB<Yypa%f!(+#~r^*4HrnEAiU|nKg2EFn|0+4
zBQv-~Y35R>Zi{gNavB<|o91KNjn3s+R^(zc$xBB=cV?%7X%kIaF-(A;9_@2`?t3S?
z2``Hwt69a2a8`7NYU@y4_X#9eCjziN^`#dCL~Z_tj^;#IFS$6iMsPj^qEr~6Lphfq
z^73)W&HaFi?l;(2UP~bA6bJqVL8RD)S9YgjbKle7>jSbI2Mx>Ul}$L?t(^_E*Em+w
zcu}kQDbh(kE#0c%hfhSJqIwhcn~n-hTDW^7xb+prgPG?SWBU>qhdnI?=q8v6Jl7I<
zkn|EG?#j1(iY^1~8dTwZqoCC=pB?=GB<5GH<^;620je?zS=LaWhpnD%V{2ln86a((
zAlyCJ2gVsA$K^AD3aombQ9Ue6r5>fw!IV#yv|eK1;Ttj5_*WnyQvoGO8Hv%;pd*Hj
zrvglpzpT);TBG<35#XZWyKu&#u<4lu6OqNllff9I`!W$^Id8<vc$R=tT}Q98r>&Bg
zw#CR?>(!LRkOjS8CH-&lRGh#t4T=Z?U2zX0-Wb7$h!OCJ3DW>K#Ddmo5YIJMSN^vr
zXCEs0Y=RN17<h9~Vzjo}vZ5_Qo&i*Venz&`w2=01aB)>#Foh!pb_qBfcN2!YMFnoj
z)tPc(@{)@~Jr+$}4baKB1r&8i^jRKu7=@*OZ%JbRQ<jMILu~_y3`VeJxb6UDbjiS{
z$HWm{+hf(!zS0(_uD)Ru(F<e#sP_y^#AwL^sLHtz$Bu*VkXzWYQ$%g~XID@%Tr(k&
zuRxBa`mE#9q*!@`qjD+Le&B$JGCl)oJ&0rkE{W#|3{-T8Me*8;dQ42^UVSW7jtEA;
z5ja%;k<dVXL|Tg4scI=Eef$D56bHD>4(gMGpgT`CnPlyU+1;RqO7q_a#l4hj6avws
zzu6R`5R!eTe<#D##qV$SUb`CsYnq~T?7CO)rAX(&ZAK%^M$*>ACLJ?A>oJx`Z}MPq
zP|yr~SH`p}bEL+c^+5>@>iB-lhvC|%7$W~LB(Lqn?Bd{euluxnEnERWeoTM5Y<WBF
zg%=2OvZgbGJ;H8Gl`9x-9#rB67ufDc@b9w{ma8{ZDCD&?X6M)4?WLp$4ywRUl2VBb
zsWLrY1O3Gi<|thewh`%7>4oIWVI9F6Syny_b$%%*iMiQwh+j0<XJ!`3w^3#YDSw$#
z%kdn#>8Dte;za6<Tu>mPu*TBm^(L{<a3;o}L}Xh8FpNW41U)F?LUx+Smi3GB=0KW_
zB_#m&q{P?yGRMYea0imR?LL*HaC+(_bV<G0|6brpY8i+_!v_e_T)Sg(9!fEoRBVxv
z{;atbAcwy=cGFH^I<1!r1S!25#9vN22XP0f&n~-ELYIA#Z`U1Y5i#qL77d$!QwRfB
zjPExr#_&CvgZ%{ga)SAan~FEHU=!feYil{5a23;Ws`2#6+?1JMg~alXaWPy>$Uei8
zZv}w#Gy8Wo9nDC~t`I4d_75RaYLD+tT4YjVd|kxOVPN*O{7)0t>&I)1GkPvwi!A5$
z$<F+~uU8CSV9r_6HteVxE^a!v-IHTbK`Hmo-A>`M$C!pVPnC1@A1-Uq?wZQ3&H(|{
zR_f0w&{H@kE)+S-aV3toSW42944A*Cs5ccshMqaH3%ze|AXl?nTR{D6Ko-d@)SNF>
znf=oli#u{k`hF)TOm%z@feU<X?XVTkXY4AZLUZ6Le-I+Jn+0=n=(dVHCRVO3D^wBx
z-PTP$qjIfU^7uguzQ*Lf?S%Jw%?weT<?9DGi`1&S5^o%jd7(@XD5$3s)o4oJ9Fvq6
zh=D8!0(KT?D!|&2&PR;NX}OHrA*gQPlbnh;lW%aDv%t%7eoPPQan8cWJo{SW_P}sd
z1UF^`0Xu4LtQYpRW9h-C@tIu|K2;z^D6=U>e4;7peDGPQ`JLvJzeRcrMwHu1FIwL`
zG*e`vZAW9(Pp~!O{Z9K6MV$h!Ig3B1s<cR4xj;Wc;m5gSUb9tRCb~dD9Idhh(*v-g
z*_o~e`(<Qb0ag1>u!j!kiq3Yjti8Ub?eNCJC+nTmMVHuybp*wxxKUIaG5^SnN&+es
zktPtIJg|$q$3q62QUQ;#wP&Znj!ciM^=oCTU{sK<2x}M{6qwr!nCG$%4>7oX-Og7U
z%qsHb60&v1Ipy%`p&@cSO|)r3SAzRnsRodQ0;acCgt0w&vHdY@oW4QQf6X7JodU=Z
zf}rCV-P|$2$Er;eYvCFJWPreYYAJ6zxks~&6TxSb+Q2$2a_@ZO)~(!nUwbE?%!MD0
zn^kq&an^;DWouVZ2Ryq7D)rS;f%`jZph9y1Xkx5?zW<4Ni&IBR$jpMBn=+i+!uej?
zX?t%owCpuDI^qA=aC_I8{6y-t-rRD3{tu1!@IRo<Ug6)sFV_Anj1Y9;8C@fj{<4|V
z295hS-TOMp<d`mR51AWp+sfrU>(vD3=jq3p3*)(HXW%0;fdywc+yXTJDk9F{%`km#
z)KBbZ=e$&IcyzG$Qc2>KwWud}7n8hLe00(-(zhcRxtpU5ha>bj8*D>M#5ZO_tuz~<
z63yrv;UKRp`Ji<~j1nhh5o@hE6R9Tay5i_MP{_Hm25n(kJ)*}0F+68FMv9fm4n~X>
zQOLp(jL&5!7IzuZMZsXy+NTCiiZSBM-T+5hdVkw5Y4_BlA>XVCHw`h$x?gM>Vr45c
ze0VoADLrcHrjd-a#9&c_?l!@PP64|e(rc&&SV+H(OoNePO4S^?t{cO~-D}xW?79%0
z+|DgF6Vcnx$@|gCs<$1V=LZyzwQzeeQB7=g{^!H5)5g841M3>^X7I-^Jj2h+Y0J8m
z*nRC6fV(FBugu>z#tmLhbJ`WB8SVv6mcc?6hlh_R94=PY-?zs$oBxztjNysaPP0}-
zjILmH+GwDzTkUT1=3zzP@(3O4Mdb1bVbmKi@J7_mHC9g3s}#I*bUst5EqsGsOMS?<
zvfHh0({p<(l*Sr&plwa<!E7(E@VRn35ZFs+Hj}>e*N-D}gS^tb%V~R)y>~U;%Ht0)
z1w!lpoJl5E9qh;Qvl0Y)h4+I*jIkGE!S-{FqB$^V?)UO^Bc(29!;4YJ<p1_x0`3e#
z%I^QizdiUL{%zd<@o$Uk^PvG`KNws?Cpm3eArz|z6Ho5%&odKO<_&l}T^`Z)0GPJ_
z!@w>2W#C!@jQ^K`8xTk!tK{`j0T~;E7*qFO2Cn$WQCqW{Ve=57Tuh8y)v##jbSijt
z>hxeY87~i~hlsruUaw7arpsEHDz;X$`)g|_{WE1X9visns2<Hxlm+yBw7J`l*;(M6
z%*NnOt5yIxNME-akYDg=ConrYF_bR8_UOnWkW(6kAKBxh%DRo&nF15>f~3MV|2~ui
zXP{p%H+OWHLZ5U}W23-IG~Awdtbfjms%{U5dO7vWo_VIxl0d>hVYzS2@Nr<HisG<x
z411_hWp{){5gWMm7hWO}q|KhFLs5y4ap*#i_9+wlow@Fe27lpcL1aj%C(umA_)rv7
z^1p~_5(-UUOHQ%?p=awWypJA}t^%FB4BOn+m%pEgMTXZdeaM%^I+~ovhwY|jmd96y
z{lOAdj>qC@cW|)DMv_uDN@+e}Wd%>~BwwR{GV9g_Qc3{HFVb?J&rrd^%+AuZdpg$B
z(o}`fn?E_MMq?JDP73k}L_!?A9T$Faz*X=vAM^day=Pq=PintShKg^{Y1g$6?IJ%P
zKmN&4E2|O{Kg=SnW@{h5iqdQ!iAi0|6j9(S4UnCN-<qLPA4InX@aT)@uk$A-1YANb
zD6EE$z;{@g3w&=vB!Lg!K#_O}lS)w9-^J#Siqc3hds?IWtgqR%{{-kY{ed-C!3NN6
ze1LSH0V6h}qrn}TK1zyTB6RxG77tv2G+pUIzOJyo44|S`FUyf$22s)~tQ6+Yz16Nt
zfNP%;ECkKPHZ(hL0IIMsC@c}A9H}O@lVHt+#<$3Q@z$i_?M$YKichUM!C0@N8aAkT
zV1@@p&na@V^(ZtG4ez9q+&UY>9fQJK!cNTfFrS#RF|$82(4&{=&^DM!ZX%G3qvs5)
zfSAKRaTrXXQjrn;m*<M-Q7{3|_qjy)oi}u&$Sa*Pm}+Dayrn7c%Ei+g<OzPsIe!Ni
zODle!$^dH(1;Z5>0_(X%;1mmt(bOoYBnnHoIrKg4rA&#JiLNye$|PL%l~aZVWjpQT
zpmp4_?X|$0AxZ3Q`#=Z5_TE<6V{Z6XZiiXs&Is>aoSzlWt#f2e3xVkJ(=V2eRGFiz
zD4l@L0+c-7BqV7Q1ij{Aok;kQ0UqduU={cTum$Q7yC-TD9f5#0Xj(<%D}3Jq(w*r5
zEIR#B&N;!#4%wT8hs>r_EyyT~6mF>i)02WiwD-Qk$2TEDPRuqBBk$YvMX?kx>tHCZ
zjN{~kf$-lrcJOCiK7yhaN9iOkSq8M~(Wxy{Fn-v|y@lX(n7a7mamlJu8kr<MvN-(J
zKzj?guss8S&PVccdCmL+S-RHS<Wr#xhDFs*T0Nj$nYc=eEDFzQz)dXO%}Ww4gL<LU
z!wScIW$d?Fd*>pb&87>8o-Z9W=a7b%to4Ml+(tLhYKTD0M!V}2!8a+>v;U1PibX&W
zBJibfTStsCOQ+Nus8o@|i%Pg!zROQi%nL>W6;vYZ(M{ct7$bCa^#Ra6S29_ZA`8z+
z6;vyR2<K%KZc*7TZTaqaw*UH^0u0QH5v;(s(_L2@VEb@F&mgTqCfI#-KHoos{Hl2k
z7!>TT5vsrm{1vj+lj6|S1U$aGf)R%AR~I-xJzn~<c#Y+jo(J5ZJcQr~L}|@LMVUSm
zqs=Jh78GV4?nN<<VM%&0&iUZ4e<F<Q{VrqYhrgJ3Nx$?GT-oQxMPIC<8T5WypYHIu
zou2&Q@ouiX7k|Dm@g<E|^7y}>8bN0L5^S9nz}c|P!HSFUJ`H@lD(hhxJsI1i!=Nq6
ziQA?d?%88=^Z{l`zECOe-VktGyf_%JX4OSQxbQv%EeCR@Ez{^$aT!O)E(UAMIUY}+
zi#-Qtm$AS~|E)s})|SzJN=^uB?&gyY8YW{SzjIGa*EWG-XhmY7T@dG@v>1vEVrjhT
z#z0CsAuWWa!AA5m4O`hJ=w$dqc1`~KeuPr!6Que)i_5$Rv8u>>1U(=%LYDxQs^of!
z+4&S)89Q5^@8=DREg~UaR=a#VA4mMG6U>-H<zz_in8T(LJin=32;NbLl~j6Q&M$(X
zu@IPcjNQRwjTMQsSb5KS?<fyp&ch+qeByXlkmHE>@(%Z1QjI~H>*eROq!csp&?~}6
zU8b<xLAMesW++cRwG?Bs%fEn>iU+Fq26DVCp~pm@z1nRDLHu-u##L32Bke(z=-`^!
zP*Ogue`?viB$(wmf4M{R|G8i$w^N#+l-cqStalWDMbX>3C9Ku7-<qr#TK%;qHQLQ8
zhcq>x4fik?6~P8?#gnBo#P04xI=h4QYCV9M*7G~Ak)kE|o<?yu2kAt@(;woFQtYXj
zq_n7ZsLt`p73zhS!CbG%*T%nCl}K#ME;(mrP+K+9&OaFTKHN?p7H;5rc74N`X~Xk%
zFvdQ1t>ls(Mi~QDMAD<0xfkCM5_k8`9io_N*2}xv3a%BTj2uzF_cB$`^Gl{yCcVgl
zR7=1$Y1pa)b{)=1r|Y%}N&7-fTC&Np?`DEW%{8@uQqO!0ljt<@^cFDItA@z(K!k1U
z#%_<D{w<(GH4c@ycfdnS0&ix;*NeFk?mVOI?Tk%oqO~s*`1#xIrswIk#aZq-J`nM?
zw<!nyv$cGKi?i$9yd%}H(P!EN$Xe!TAy_)6cZd{p-+X?&g^a6-JDq50A(J1;{*F+H
z<*$jR+AwIqc@<Oplx_lLOvi!7*iSB^a`CL!*`U`6)l<@fgZ`)-&u?`yc%;<p)~b+F
zHRyCmIF5~yZ^SAZ;(qd;Z}sv)<Jjw_FG`%cb%zRIQRq^k`6RJ`zV7cvr+Ml0rM5^M
z`1T73$w_6Ism(nI11&ZNzvAHL1ep?OVZxs7S|ccJ56nx;gRiSz9$9=Mbmdp3Bi}25
z^YyZPsWT@DUREL2p}~=O+KVw3D32AbcEh6HwR>cMJq<nHoLt%C(=|m~CX?sfCgbVI
z_7UdTik(>}3<F~!k=T$(+0`<5)Oj1kDgPGXBmI)2`^c!kf1g_ZVQz7|+4bA|@Z;I?
zc$N8iF!T1m_e@4XpNAykH;@D*kNJsdVKOUGroS^XEbHonE7<}p?ZV2(zcZ!7wT^i6
zMt<0{Gt@ghM|n_w`M2LObCAbmZ+&O%tQRPdG!@1~z9X9&NqC6F2Grx5rB|=x;F+A*
z0<l>DFpD-qyR|vd!Ye^~2u8Iqj^q|^OkCl$A)EcFS+vs674|1?y-cpy8<7GVd%n;!
z+0^<p)AZ_phqc6XnyP>GW2l5%0y;K2bxeo##-yX3(h9b*S@ACad-*~c$8|#Z%O*jf
zSKi%*4tgfVYy$7hR6K@oTHc$;lG07=kh&w4tR@^iRw<~`#7&dL4oU%8g;?g};r|1b
zKx)4}w6}l7P{rgU6)`L_PRm0!XL@(D$E}$)AWs!m@EK+Vb$n7?PAB0a3p6k>`DB`K
z7B{@&iH63U35_mRyb#v&(K>rrA+_)2SUu?~q4EF`Wn9NH0YfbO!)y@wZA|hRI<laX
z%2d?{N`T4820c~75a(JXl<dl4e1t%nN);SIO5QF2n@%?wbrct*&Fx#Uijflzi7sgN
zCnPBevj!zLNbub$u~jDY^?Z_FsqEl19k?f^S7|y@j-SSH%hVB+3-D~#{fJu9XFN+-
zUpJL`cBn7X(OH@le=!(cubw+b_lo}Dg$Lw*5>+Q&!)xd=;j3(#qo%N!(;C|2A++Y$
zAr$>IhDEmehlD{j{3%+yz(^c_wp5gY-ocsyZ;%<SxerOxsb4hhe@d@gSfoSu9!IuU
z1Eo!x!Hjn9cc!$9v78<(U9h%B!F+&6rfWTWtchUtir+8>FIq!r#L_>4X+N1JZ>E#_
zLYNW~DQAxP@bqDdOZdJcTZ;X3R6m^pp!=?|gIX7w6E<n5Q<MT;NE_hGdo|U?8or<-
zxLBoC(QVBCVWn0@n>uUybnn>gWnlP#LZPBZlhZO)1u+S9RIyaK!T^aWqINbWVJCA$
zF7endGW58+*ywU~M~wvXyEwn-d1oVqIdoFc=Y>kadCjogtlw2<l%r$#7xZYlWbln_
z@YPBPjW}vmhE_SnWnmOC3IkPbnBFgYz&%(%U{HMsSwD0(>n|8x!2(+@oW$JYf+qkS
zfZfflenC8h;U+@T?vU(cFiDdhrWyp{BN@PMh?sCO?ci@U&SnUFTl10UawYlY$m#w}
zlG2e+I=qSjl#~2gOj@=sp9ly|gpSPx(>=+=b}?Ol#`CfZso}3e&bQoOTwN^wN<j}#
z#fD(&R3va$U)k%1Sup{_|BC6%qhnf8Sf*z(UFo50LtE=<4Yx%wW9rtWi}smUb8hLq
z@OchNnCBDWUWo=Tp1ZXVcY5p3E~f9cR2YBxk&f_(Ke2yUG5(`}!~VsJXAPwvPf{XM
zJ*m{C-@*h#{LE~k0An9`Y%4DivuzyJp^_+)voPT3P<*nPvq7;G<Nr%#f=LO0?%i4n
z&Qy(iWIht)y!SVspYHwCJZTH7GD;KjoqYm~gaW<*2f0Xrz5=OxEz8tw6ROXi{Pr95
z)+&xuq2jfk&Xd3((8-h3N}on*w>A*hEd!J^c)~BfI_b0yTPTciZ7PisrlU~1$NnwE
zoC+YXdQsCSeuBb%*A#;>$V%`g7L(6LM-oesK4G*@mKwB@BfCggI>wstxD;+Lxh89F
zgb}}hez?q}HkdvgOU4F48|)?J=~32FRo|OE>lI+JRq-*yjHVmT(Nb$xhpWtQ5vgBu
zSEkT_t%3G~Xw3zIF}H0p53D$E#K=L`Gd0nRp-%Pbg*hls0>d<GN?xe^xh~~Ub1S19
zA)<{{z;P2-sgb6HlA8XZlI^itN14c$&jrkKAk^GrYlV?jfY~P(Ve+Q$gE&z*6<Jj$
zPa<`a^iOM%#g-8_yH<yG>iMEY5w%fFm5>=KA<t`4TZN(#fT}<9O2z8cSqGJU5h{n<
z9gsVE8Ui6_w$=9m618y-xF=z2l;v24A8iO&)f^sMKg&(29w{muz*S@M9Brt(_*Vd8
zmv1=L!&({0R?>|U!t1{5i(SoN%{xbt^$8Ng-`#S9)<l<@rNG7T3Th`>1*;;bx>B`<
zJ+W9nqIWw5{;aCt3rb*);dFvB>Rf`XPs!4WPU-HfomF{;;h<yAr=;6W$5YCw<RFwr
zA_sm>2`y=XQ1&x7nR}GLW=g6{Y1>2!Z`%{=ljFWr5=jPTX=+-EColtgcl_L|+}lu(
zR3lI|xwfy|#WdODx;yUe#Z=qL5mh}CLE9c@HWouvGSE>Y_#8cntofZxu9u%8`w>_;
zZ!uo}l<&BQ!vU@H=tr}XM?TQsFi4B&Fe;|$n3edUJ>Jk)X~UGErWER^*ukrovVJKo
zl}-dskt%tBf?27p-Eft%Qp!3-G)oTGE5sU@O9ppV3SkoVgkx99mkaG^tWm-OIipmi
zpH?b2F~rrEn(+lkno-OZRYDkJeekjhP^=ypHA3YJbipJ_@ma)ji33iPZE}`OfZ0rq
z8O)ZZBs`6JC+%E<W1kO{7A%&jWF{I3V|u3%LE%$$xYpQ`(UsZ^O-1<>oqfy}kXdR-
z)q*%!5DNg{JgI8mmB|=>M!H6Aic-_0B~$1ql8HphsG=U%<&R0+)+YgfAKA!H6YbCf
z(EDfvlP4zPHLS!^2s+Dw&7v0^@_2g=1FZ-<)!wX)Kn}ih$K!MS^putYtOtm&HUj3P
zmzMHE3&I+j2NZnOuquLhbZllE#3`qU(Ny1(hI>=#R=v47Ij}iTrNdPKqvmP@>ozI2
zE@Xy*dzrkm+rAH7Ek11z)d*c*cQ=zDDm!2mzBXACd#NqN1ZMKshW2X;l^0o#XpahW
z6hbifK)*V%At*pd{UsVLsOO)>+mF*t*Pr1ZrQFjm<$CA($zp{Lv%%_v!Y<+&>Xfiz
z6H4#UJ*6(Yqc2y@wYfv8iD(cu6bLWgKlb;{eN4*;wGo6{U$5u@ANo5_P*JBNu*Y)|
z&0_&W7-m?NJxnO5YAA?|!_8BsO;;EBK)7@Co(S<y%;|Y&ot<snnbsedmS92JJe;E<
z@mFN&Jn&;^le^5<6z!eM(yWD;qXdnK+-jQJ8okcY`-E7y!qFpp9;4Gs!R+&NN?E`9
zz2v%fXL@O8`IC`qwVEELKE2$SUUp!FI*{nCt@_;>{{j&0ZqhGCMMEf$S9Nh0>zqxK
zm1t<qk0WY1%`Omk)dYPYFz$5{>HB+2DtdVGZ-e=OVoIt2=`a11z&dARtbN0GmI*O0
zRDk(pHX3CDG>Un(?x+}6QQs(CUJhiPi)>ifMKL`+)-#Lxsr$!l8l_u6<ym?2l*j5w
zT`Q^WmMfIYpSD|kQ{KA!G=gWYgcTZaooDlm7GxE2c03|guTC{B%?*qdTS=l$!dx4`
zSMzbak)$GqX(;9n{>4q=aCvm)Na%nfM}av=4C&m6-l76YIqYXrL%OiMV1`+*H%M87
zXV^zhqzhN_5Tkju#t&V%Y=1JR>I#LEE3YvW$<9!}$oUo~APYzqWX-si0+5Xc9Bag2
zwIE8Hif_-xJrwYbN!D5c?kX1l0j5LAgubbHHqFsJtV_b?Fgu@6og2FOUNw+vyxL}M
z8+p+Y(+Q`75(SY@PL&oO$7sWzX-#G|Vl(x0F;JiV-CobGFDAF}6p!^Zpufgmu$Zzw
zR+a&WzXFx8mF&WjQDt+vJ>mW1<O*hiZ`moki7Vt9=wao7SOI@d26**yZFM9|E*10y
zr~}~Y2EdmOF!3wyD7qXzDx(2BW%U8i74^+llI#MhFG(>>234Y23ln&$OulCmt?0&$
zh#5JE_b1<lLK^fl;g6_S@;k^<;D)&1&oyOJs>E8Vgw@L?X?F_P0s=6JGS;wUYT}eP
zjNzR0B%?!(sXBU`V1g5tpl(-dsC-?dl;i=Ljg~9r=NH;m_!<wdt-VFdCG0G>)#>eJ
zFWbZbw_s4XM{r|#SLJ?EUXHY{G=)M9-RiTTD13z^uqCaUC8{zNThS(Qy0pgmc!v3~
zdMu9#g;7mpQKV9kU#!Ap8}9I^_yEMgfi$S(eYXY_Qlw;*$-pZA6PJTxcOP4Talz>y
zw4kkD&KzA<#L_+vo<Z{~+wbh6NdbARL~SfBuggG-jExMm5R(`W+d3*ElxEE`>UbOH
zFn=}f@u}|&5l4FYh66|DJJwrOr#i6fjgqRE`PQJ`Rw;>`%ssRY1lWd}e2biyoi&h{
zK8_6zfuJ`Va;6y85TY^w&1)D!uR7xFJVNZrix_JrP(pc<OtI86Y9<k_XbxE_NpiYf
z$s@uY(Yt-jDMoK-7+y@}NP4z{A0y52Mvo$GJCwjaIm*60l<9HZYNW*&ZS#Fc8}{DV
za_wI+s>xuUvh<>~pmw93PW{tERM23B5DSsHgz%e6N3zE<jJenV|BgVgCvPpH`0i~N
zlXq@1>8V6-D2Fn6&vc%AA5krW)UcarO2C(U(S@77dl94NOey22iS)+x>2!fUN{WL%
zV>IHZC)YLk$k*!3q#5O^x`dcFp=>ZtsU*V>a|fSwTgQ<mE<i<Rp9H#U(@vlv=FaK$
z>?5&ZRTxlcO8O~XX`oP-1>c6S=x%By4X<Pr?pR(;ickoz;3|RUFbJ+t=1Or23Gv`F
zbV;2&5%2$;{3U>`H990dz?RdX5V;&v`KjYi`VP8iV^zhEdq;KL2hI@1lF;B<8?01U
z@&Y>TW%;b&3AChBsnto&=%bG;fKu`<^01$cXya5*l$lYS6t(u4f@ABkQWaAEEcFBz
zE{`bh;)R|RdJtlgGPPq0HDJ>;!UWkhjZ9`kumuL!N|QUPuTWU2Inyr`11CswG{IkL
zbrL(#vj)vNR(2^1m!t|RXL>U^kP4svlnS8InIY|NnKaNzHVO1ue8C#NL=I}1Tn0MN
zrZa@!2ht)bhN|`LDyjrSQJlpD<50rPgaD~b3e@?TbN(OS>}cBL7%m<D_fcee<K1kh
znDtGPX%0EBrlBLcJnkq|A6M<Zly|Rdnt3`Jz-g!f>H?dZko_Q)0xob>lX#c1gD=4!
zIA-I#Xv<n203|QG45xt@bYdIjba(`;Mneftdu6Wd0+rQx!e6CEk3jdQ&6<_eVMZa|
zaFk?acIPIn9o^7nB`4ps^pv7+mCbhRu}Ftcs2CP~cSCPki*}*4qtqm%A-yoFWoaWk
zgrikvIF;0ptYf(-X@{j!$<wD7tff_MJD6+}7%D2Tp}0zE60D|$KI(*54)>?k*Axg8
zsGWqv^Nh>UwPrPjoeFBI>EziabNf>Pu(_R)l<neZsaqk-vi%p8)vR3dUD=NHwZX@~
zmws{96w+?vN6`Gj(~7&jX>9SEU8F$>nYSzLQ&q|~!bijtye#{q%mjo`>Q#@p#qt)C
zdgb<nUYRrE@9~DS4cnq&uxmN%K^$(+Ax;6G@qnYUOV%#9aOoCG3Tj@DEEP<}a?C*x
zBdl`OqfCC?>5Oz=lN9MOxmm2K3pBPkElZciau>Twd%xP(q9_*ZBZ<Ia=+`I~k`Aq1
z^_ooun&lxa326}7BbKvdqf{RKKZV?<(h1S)TK)e?DC^YGpz!KYgGT~_N!n;}3z@ZX
zaY<8AspVl;CHBX=N;MZJS0<`Hr|d<pD|-XJ>OffD40(rQLxD?SsGp_%oTN(GAt&dx
zl6}{rx3ZJ2(VO_vWQuvs#r7<@tw~eM>Qk+&aaadpLpC-xSThuDZbtjLwG4tTwWr4(
zVlytpnn@IpC8Li8E501yO<CKc!-T|L5nIJ7Se6~@NzWJ3Y6(9P9DBjs!w4j=<GWAR
zdAGHIr1BGq_L<6I1(ieAtiI@|8$IwZARwsWyKJ;|wmVl2Q(7WoC~+F3gx<L&(vQW4
zfw+PWS1OZIpl5>F>P5OLxB7;z)f0xF<2S8&C|mt~Vfk9w6?Up_wW?dpy0sWa`|KJ|
zq>lo&ZSrJ$q3!`On7A{&kd4BX)esD4N%v#D#yh5&4%hD}GtxHBujCi4b50>omN7q;
zMNf>^J@AOyv;G-9b-6R24aMv5mF+V@_1t8#*c*&;C)#=N;NF9}@SEys&GIF$dp*?n
zzBPKG_jR*F<$Nhs+#JuYlDApJv@Bv)Dwq@nK%Wb_P-gU3B{TZ(&aN5HcXjEAI~oR{
zB;AYDG8xE*%2X7<WJYxNu4itDf#auO*|sSn%_0HHC_+36O7P;Ot+^D!S=ilUxyj02
z$of!96W@v6M*Uc87i}|js71qRA(nkUavsrh<yW8Lm9<!k>+>YAxGY_vo`RwR>H#SV
zAx5L>>VI=RvOhzx(r5UeCRcq`0cu%h{qwnSN60nrI6tcbn~XZ?w0rS0ay``uR91sr
zC?sJZY7~r1nrCS6qujEj?m|dDG7~}76`CE-(+SYX5nFkqo%_)luqfg*C(3_JVokK2
z)K8QZOl9uYcMU}pqtX66LxmK22*m8zEXMqPdc`P<b=}j+6b%TUDEav`KTnZ2WzG&+
zO1RA6*1`K(+2}c(K?jw^$aS8Jc9eRxR>Eu)=~xtBZ?BU$7#;TPj368{@x4lEjI5*e
zI$J$VO@a)a0uoZziKU&4oB|)!IfXfERXO}~mi2lt0n37~>WsQz)kb(~hYq!H(2WO(
z?7y0vZ+JHiGd5-x?{?nDksBiA6f9TG$We(Lcj}(^)nm6|!+11_6QS2&+i7408L0;M
zN<%fmL*2KXr$R$La2oJX>Xv#dH^-rFj`q%CHl!H$lw$2g*v-&4gd5q>UG#%eI4jQ(
z*=MZ{hYmNQ=O9y(bHyWRuHHK4dJ#|Q^_uw)bl#}nh5v5TfA7_?&ad|_aphNuQOHv)
z06AXEdf2e1F_Yy$GHBG;m{%7uj60+v1Ex72`3;AEGa2oool*un0_WYQ2K*mfSIZZY
z=Ed>B76<B+9Bzc@Z8ACs0wFX<ft(!HY}J*ZYwf@AOFg<95zwM1PonJx3oWXJ^?M{y
z;On;6sI;Sh{zIBSdlqfqub0~JLu;&ib!X`Bt&!KF?VSgU25Bra$hJGkeRq(?!i9Wa
z9;395Mm=yp;Zx1uv=m8HG3M$ApSyA!BasRiYw>53`xX9Je}-`~iVV;XhRLvgR2Fv~
zT|~dqwcxc>!m+u0`FFg;o26&6WNcEs<TeabT6Pp%w%o%Gob-D2gx#dBS%{g$*tJ?2
zrV84871SDjacc(#6<*g`+QU?mvI#^eE%<vLzou*12;2!2xSTEXykN^O<MP9*W}MU;
z^a(SJl*}xkldV)Y^DFiR|Fm>1hP!nYv({2We(5$Op6UBaNwrlV@EJulk!8VXCMNuL
zSeNadm#uK4^4>Szms<wwjjNBPX?EUO2v&7KEqU8a*_uUgbhiudWLNR%)=Pov?pEII
z0$oAzo?68|S0nU_h+WQ*6|(kcjZEdHES@NyBuYbT(o5CX%Vf!#XGnoy(JE;b7VLv!
zh9ws}q%2HcNU~Y-#D_^x`KXKRKO4?H<E67Lu_=M0U46ElTa86_TAeWw5QLJ56FMrN
z9$P`Jyo66#yUi(_bXE*`k#bsCMb65KP`C(=sVNE6<r~x1Zec|vtrKt*Z5M_+M_V2x
zG{G<F4b%jmr4p!WZ>i|=;E4(ZD2;NX7|cfOm8V>dxBMfe!xggLr}aiK&czOd0G@_-
z<n#dGRjWte2{;D%v_N>QJMHVf4lN}H42iiHS^Z-v*oC_?ZQe(Zg7mTc@gi3)99pL|
z9QxK46!wW=3El_`ckOrF36>*$E&^dv%gsiMP>1;yQaH9{CFq*#gw(N(P29yJR*x%L
zgRIdMlxqm@IVF!#r!i!|)^3hybtA9;A{nJD1d&5iLG`?pW09+ermA23I;T@MgAp2P
z+AOEbT%3F+EfZ}>6IG!olFm%rk@_(u{+1^|xGF6l8)c473wTI*aeciW8qZQ;g`z16
z@`^5eg#w*2A%&=up&&Q{J5LU2o{CI1W#*>FAfy9N?XK*II^&=OM}C!dXBCsbkrqV7
zhK71UXKxc2VN$KA2wHquyQ`ZRi$2JzQ^AO{oaA+^;b`*FipR5^>A=z=+up2Fjt|=9
z(P}R(R!OZx+MAq|KPWWAawn7IT6u9XIai&tiI^Ku4p#~_p`sAtB82q<Q!FGWpt07;
z4tl(0x@6-O8a0bT`OvHV6~h+b#{l7jp4`{oX)4rlvr9~B{II>uOpt6wMLJ7xkhuZZ
zLwRpftE#D5Mpg=FhOdEkYI0)a%rG(*)o*?F$K)y+)(R$y<dA*?IM5;=vFXANJf=AG
zauE2`w_H;Vm089UBqiXrvN9&od7k&2Y_{4bE7dk}h7c1wqDgKi0I(H4c`I5O>J&&6
z+Y%~^^dj*H%tnmPAF~k!cbHniIa%{16ELq8PG>RAx~7b&8&-`z+~~NA^$JzETZuEN
z3o>%YNIwttj5hp=hU)b;Op!J00h8xi52Mtb*J#hfmc$Qa#h_DzB_S=m$$IFb49jk4
zBJIA)@mBPH1KVxOFF%Hx3pPK+NWfw8$-N-GG)wRpF{y&ZdZHFY|A?e154k(l0X(BN
z7>e%uC--tUx(s9HQ7aB)42d*yp6awz>f`8fNhepqyE&Xd72k)S5-0BX7STTv>sH~+
zza2eNnhp!nzKYmDpP~u5$7d1A8un{X%JIuq=BYscPN1`b`kSo#(OmvSsO?Z92^SUK
zKZrnCfZtkxNW>W_wt@nWt#eOYle%|+iRmXs@ya*9pseh(f(s%RG6QDAeY8*~BT#LG
zQo&g%$`oI)(KWdENUG235Sp|w&cOC(jgu$v9nXQyz1c)DVOGGVBMVqTPHtzCl!3}%
zbFd|)(vqGzg$&O|(!BzGpqO5i6v|SzK`P*7w-I_Dw1X--BX~&;Tsa}^Yl#8XIn|4n
z*l}1<cQ%=DTnzdmVW4UPa;Xa2=g8QyoUo=`(j)*wDgk?<5;HQq2-=fiM;Ce$7Cj+Q
zDNufx4aYcT<#DtT>Zitqo|Ex71%`kwwDVm1Z=Ge7xr&0P#aXQcas~Fx$Ww9_!@9rB
zljd%q@Cz5S`Mrbz)>J+y(N4dMTY6+~TA!>H$a^_-Kz$s!J+k^$-XmVB2RiVx5hoDL
z&aGpwQ62G@b_ZZfk;DF>&|J8%R_L#oz^$$rDOIeUGU;)l=m+JU@x71A*sVxaNV`Z8
zEsB%@JRjf@GC#QYd+Ft6$Y#}S!ir2!)mWvhoZpEk(#x&|>O;FXV4>0XZxYI>(#SAt
zIzm=4^jVW#51Da;?R#{$`fds815c}Tz!d_i{ozZcQi+U(>4Z~ysy0^ToTcBF*Zf+#
zSk$s)cN@XIcXXF(3`>@!f)*ds0PkuP1#gaiR(rDhrllNx2UxB|r*R?<iz-Nvek#FR
z1Q}zeP>IjytEi8#59|=jU})*u>PDsBQP*pk=Y}_dW(---<CrbhP!xtsQ7RP*feJLR
zy{|PWC@qz`ez*rCAXvG9_>wTTU+j$E<+|)r&4wgbV<5(9Cui9pBi9Xp7I!pBk#EIl
zIdsZphYJT%60d$m!R9G$OGXk8rQ_<6qvpyW!`!GVLW^Z5h_p%;kEzLy1^s2y*_0Dx
z9qNNf#E@1|uw<_0Eo&la2QIjTxD?Fk#crY$NJs7`C?1nLGcT#EoD#^=B-uqo!ro9L
z1@9HZ9B=JJS?SeAJJWFhO?2R|y|fSOk6t!UUhKAxJBO#QJ54OC(QHSJ2LbK!izJ(r
zHO%3VDcGxbfsWsMJgb(~j4{)Qda-mA2Rbr-fJW%{JE+s<$ua*mow%G1Ir|J?7j<wZ
z$incB71$;mr1lE8UJqm^-H6(`>PmU2qp}f4j+wm_qCTC>g2crnMo>X{+}kzfL2#n2
zgGvvr;-TP3%Qa6xY%A)^7K3_VZ`ijE@sX5=EdANkQ|&eT&@l~t;dn|@gd}=e0M_kl
z<pL59id(#xPREZnH_s=@_yRQx#WcbAz1~LJn{EDAk;2gFWD{P$NV*@3jf?4U@YiGR
z^i49soB;zXRLxJ)dg)aexD4wA@b24twR_xo-a0XvS1;KO0-Z$2>xUI<XQ?TswH*}Y
zNih7ct<wWbryA92AZh|912>Xa#F1Y3kEc?6^U0H_uq5M4yvJ&n=w(sxU4|t=f1}^1
zDg5?d^kd*^yHq<u>H?5%I4*Q1sWF%>NGai4iP=aj<*iZ23Lil?n<N<3<(&XyRn!11
zQqq6JsX-l;Mtv*4Kc^4@Iif&e5_U!>RoWsdw_SG?hdNCU5>b_-#~4hxU>5~YI_XHF
zh~k)K93BIwM4KrU!Z_IZ)0E~(gWs#OOQ3T#OCJEjt=Juz?E$EMo2Egnr`9`jN^cEm
z@o@|%(n0E>2UilPI73d@u#vLX&Y27?;FZx`+kqc;dZ5A`U^p90voQvTWW!YJG|`=k
z-P9EAG5JJP+75Dw*NWrS{%94(q}!cy32|J5a*1EXSZ+=vtKU)X;C_q~cCy+_=@rTG
zs@_o(e0B6Tf>ZnU==i6$4SKUTMx}`{QNYXcX+67+-ef7>#fLc%oQqk;84d8|A#pUl
zG!dr3#EEN+r9E(ijnIxVVFx%;R};-UVdZ*kXVB5zDb0oSIl{nYI5P}deBaUpOB=TI
z69McAqh>uNe^u#RrF?-~9y?V|so1U4iwUmL3@0#_KpD<CP>ZU&I1FYvdno6E@7ZN>
z%myGDXoM2okDb7ZE?K(qf^`aYh#D=yPJ|kBt|_X2lqqi7ipC?=y?6$z+CKCrZ4YI*
z8qf450AMIi4Qpzt(}oV}HFAl@Ibd%2^#;CNyCU|0f8Yc}H2*0fPw`RPR4@_@h)yaA
zrIL?ESygaxIIR=Aqza7ALC4`$1C<Vg65%_?lM@jsra)<CtW8qsz8gESnIRw1nl1oX
zj~eh{Ly`kej@TRdJ8v;6FlU8b1LQyYm;jCN%uY9(&!zxv-c8g#0<)_VI=y|hdlJ3c
zee<Sy*v1lJSVW8~^<rr`EW*}0q?P|@k`8(E!5U3)%rtRBZQeQB&8~T`GES+h$s8MS
zh!4kfvBb|mB87|sC{S|>*t)i}Hp;EZRE@a%h#g7g1U4F5Td3L6P$saN)TrLB07tN+
zceA`GrKVHo3vg)XzGJ#eO}0)N@Jccq!%K~Z*-?D1WEQ;s@-r$oNzTY;EZT^C_T!JZ
z1f35`>M62eL}irYq-d$Cn{v$-SPM#`roE+j;R0S9>4U~OPYF^=YbhxbEp}R9^8DK9
zFKjYP=tb8^tbwa;!VwTQiYY>Vl~axpg31<^f(-F2;*FYF5+HBSIl}8KJ3mK3tu@uq
zRT@2OZp_i}5QPr<UBy+dM&hKOj)W#-zA^=3iVYrJOT|l|Nq8P@-2f4A#<If7!80D9
z=0d@#oei@=GEtU6Zym)2$e+NnF|S8a5;mqAwJWi2I|!8TN#~q|CNv-_J-xt~E}E3V
zckGo${GRRr!u~p&Q`O8Bqckv!pd`~AJInbLwVt2uCdOypV>>1B70OZ>zHTihW+nC(
zo;n0I9lx3|px6@`BXl8F7p3Z=zvfzY3O}Z4LHZKsqI|pCI>8L5zZ{(c<@&i9t)09*
zT4So!j`mNFu{`2&^VM$q6@0rbZ~c-MQZp4fi^)vIi0d0rapm@@kd*d}?0Dn}byA*}
zRuy8(^}=43x(O6-FcK3Bo1S!B^v1kf#PAi3t%mZYp=^7kr%A|f!!l)2f<WAVylYfb
znrCgRuDYl-=xfOuW=)CM5WtLCH&vN`SgS$ICb?2@eLy5YNY}->LA2gnMl>;a97{D4
z&P@~JdN@F6WZ<SV-3ZiCik4lYYM;AUfwOJ1Np=vAh1C?RgdPZrbCL8d(Z%c>Q{h~K
zB#@kQZ5b{Gi7OdV2B}PJv66{xR=92ySkh6wPc@M7HZx3UrubVtBepc=N&#1?mfzKF
zIpl0_ly|<H+6I1}{H&NMCK5hrQm{!mg{ewCYjz(QvmXtDlQK=(qMQboDtJuU|J8kL
zWFpBsKv|+PK85T8qf-?b8P{<EBEB%~*?gbUXfo0DPYN=S(w|3Hm;hkrRPI_b_lvdB
zR2mRr@#I4D)7FteX^Rw)7s-SO$qcm_sN(41ji7EX$tWNbk-R+g{%ouhSz_iN4uE&{
z4O+HWt`Su(f}SR%vYqNst8v!)qlJy16PVR2%Cb7=MN`s?!lW%fRSX!If`Gj?6^lMc
zC))Z*6`&n-r9f|s#xlODwugjZxyU-%$YiKO&c#T%Y&&OX3Ka#3oKb=X11CqH7h+&S
zGpZsvjYep?g)Z|t(~+eP8sd}bmZ=-(CiQO)k;Ey-GEKZKqYsX*_NK0PsiyWJj_zRZ
zY+bxWeUmdh<x4L$@M349KyG@K>^*2Fa>nnKV%1e}x$S{&FB-Ge%|-|els}OhDe|&}
zt%Y5Ni5WsA3`}*NZM!QAbeGX@Pow`DZn+?DY0bd2Oah#@pOQZE(pK)-HZi*atMYs+
zBcp|zs*-+hnBN=k-RZqH8Fsgni=VpR=x%DLUzy1*C;KO_2En-K8N3h<J+UX}2YA>M
zv?p%uV*s)BBYay8`wizA>ul96kf02?B((3?oEWF~lO(SC&T}wd$x9e^!LFp7q4(O+
zDUAZms0H7UU;g4<S#oC@4&a^o1ZH>qMsAzR9a^|ci+8GGx4a!wyEczjpxo2N{WK|&
z6~qzgH$2b@HEKNeel1fO`rWs_m#B?3%{?XCGT?{~S~DXtPZ<`wsVap?1~zMwzbm-o
zp48xc{|D?$-SzGd#p&pa(l=sM7lu`}td}jltSZSqHzFmfF_pBZa*{B+E{u5hVmA7S
zn2hYPDLPIDajJDykhnwo8kJ{})PlO)mi%?anfP(LGvf_M5)0NOMLQmMxGRle0%umr
z$56F!teM)hU#dujk0Y!<bG!HQ19<_X;g@PbuFflj=q75si(*Kqs9~5xto8C4dVIN^
zY<e*>UJ*}EcZROr%+I+HtFB$H<E8Aw>J*PN^(j#xJqH1-P{qdFqAk^_I&@BcJyJ>Q
zr_-xQCAVy9yd%l1MsN&QiBWYMT~n{A#}=%s>P&{DL(Im*5N$kaa3R@Pi~o~UqcUsH
z>?*&?YRyZjoe%OeoG=#+s3Y#9&jKfz<0NFTJeGk{saUJ62;7sB3^#R6u)-KES1|l<
zg_Kdy>40-|$dm|)ta64^C+0wUn^SDZ57LV6+__~iH1q4=8ccS&+4PHD(VP8z(oN;v
z4lTQGcVBU=#i`odW5GQxAH9He*sBe3<kTzyiD%4SH`lDXa11k526vAF1WE@6iwvW)
zR=A9>-WP`4)9B#n@MY)q?%y<Ws~>Qc2d8!vQ#oKAJ1F~xn$URNI9hueZ7Y!3ah!$4
zFOg}4Qot1hN(-Inf-BnL*fJ8>8QmpC1#2i)Kc?5KcIuaMru8^tBa@x(Q4zd+EE*#=
zuV9tGWJqRBG0kCJjZmRN<4`ON9uPE6x@ncZ@hFqlq)VkRZTB)^Dq@c0jNDqK#<ttq
zD7~sXE;9y`3<8-d2Nn5=Vk?go^fkW<gokQY(kpe$yc}8Nd#XAyiJx^Y2Sq8DxO7x^
z!5fFP5h|l-sYrv$KJj_Uuy8&L^I@61)5M6Nz6lXoTStt(o{EuMD2o_sXG;0=6Kho@
zJ_zqy$gR}_v--H6r4`PtUyvM^e9rAa`6k};ZYpvwC!$G-SdmpuH-B8&s!?ingM#+X
zbSVZ-D#zQU+Wgz_snmMYZ|-Ns(y#KM`jCsS8rk9(<t(%A!%}iNaZk%eJrkbFhu@S7
zIJ*`@o<vp>ogGiob%0-2h&rVTBF~ILPqNu2s0!~nFA0ky_AFJfWJB2|OerDN@{CCE
zWroCq=U^?I-Wy?kB2qwa(i!a15y=XcE_9|ZYOBO2uHjLL$f=eo?4*GJV6tT61%kr~
zdHY^+WhdlLbf5J1aoT@={boAZ9rddB2w*jyPCU{b%rqB6|7gYOht#`YGi%`=NLy+C
zM(Z_)EE0{e*Sm;TG9Wd%oReeF>C%~1*kM07m9LkBaGne=g86=WHakB@1Ygi{eH~?Z
z<-$z2X!~UMq}}<sxp#8VJd7S}-6GCf#69#220o*BHLZ0ol1a37HtTb3>JADYefBdl
z`HEswd%zGX4-;d$FAEOvB-0aR%NQn~)E_1e#0w<Nr;D0&2bXDgnor)9*Cxm#lOIH;
zz#;|Rs4TaBavv4%Frow|{Tf0*t=vI_mBXA&m_XGolWd^Nsq@*<E_zv7{C%`iO4qPQ
zK2@Bsv2f!^t-QSDRY^u(z3%M20Zmm_-}za5z0|vQ(%q`KBt81pdtYN#j{h<zgYdw9
zLGsX1+>~8PWn}m)t2iokU&04{BJGJUCK0M5fBp-38NK$Jo=a$-Fx*x*cofyjE!G=#
z2YTdzuHJZNpO3nCSkza`wqc!=yM6<Mbd=GXRd&M!a||Rs_I+`XaDZLd_<whxPQd!W
zoPm{BhMoVeCr6?7T~U7o_-<NR?lq61?*=pXp;iA|v=@O!COm^MD9{3nqT8VxfhNi2
zxzj}4{nK6@8gFcE_ZK&(6I;=K&u(jn93eCe(1cXRa-n95{`?rNkTb0jkyZd}RxAON
zT*<7S)ZvbGzG)$}4rw**YyCl<OzRe=Y)W%^qPpRqo$4)fDH8C+K7AonwkZ@R{w|RQ
zY&Sr4gP>R4&tbMCD)JUY(RamngC6cZ$k4P$-+fniz)yh4v_$Ej#~)W<E-Q~#yf@$q
zvsMED6Np(qZt7ffSUR~x?J*%eS{T(z>Z+iJr)$GYH|bIu6dg{3wdkg)t2Z_9n)Tl)
zfKam6)xU48I;v^FMA&P5qwY!?>aJgO(_8v+b(f060lkNLaXRoqM7!wRx$2RKEAmYh
zN{*hEcn<rnHG-Q0Ck_JWFwlQdzw7#!utFI_VpUr&q-2TVK_Yaug08WcJ!Vm^Az1)6
zZfN;1I$LG~qpm^o&i>in!Q~ji=OCqA43o*nB^kl253FEx+}v-qJ15Qdi6uQE#P(Eb
z{-ugTApKXaEH$IWM6_6|lO95Fucm*hGY)b*8|f|dkglgoNpNkHe%aPm8w?|C!~;=9
z(#bwNIyr4O_iKKEfdN{{OVd(YJlGCB-L_J%!TYxX;kIq>7z;APbl4q^Ydl|kHHHyc
z*fNI?m7$f(HboX?b#s@)ne@0i9(2zql4ai)lYEGA-4xqxQcaVftNNz)h=upIg=NY(
zB-1|ND%%S49)-mguY5Nc^j2c-Qck{=Vivh81z7~l__{`!d4SF!QzI|DgYRL&rIWCt
zg5RL}zWU{<tir}zCfs-!{cj$=@sIXagkHV%`(q<Mk@IusOwFTKpIhQxzXpWBdTCf-
zMvFZ9&*<+oN;*i!B!&b#;j-<IrLBM-x`0cHZaK~e1$+bUL^MQ6BW8E*SoK`Tw^jbQ
ztvZpFjm=34Jj!~JPRKr#isM-H?g_p8Ecy)yO49AlkXw9jmy9}rwlzxBJ~{8kf+B11
z$0f^x>Ln-1`G?2myX5?VW$7sz9Ww{fN|fs!@B-7ccBi!ScKHXE0wp%q7VvO>c<}D~
zjEO%(^--NX*rJcc`-k!vsMc`UruhIzyL@+#3sc06Ez7S!@__n%*rPezLJ7+(*=})$
zAr3r)6B+5Mi(FqjKomaIW6_*`u;we-JykDHl>yAT1znt8;X=n)EL&PhC!B}ZsGZ<T
z-J~zD(!VF!lvZdQMxBH^fqNah@<m#H?3^H4dx<0aA{aBuqh9f86ol$yXHwc3GqMXp
z;IvFl2n%G;?zWTR5kE}kP5a;`98i?LXi!O_(&foTv|3Rh|6jWPsJ4xPuc)c5|0%F=
zBf|e#fZ^cvKOQkciz;Q?U1DLuMeK6%2Xrdu<)FLyKX()14X(to`nT0D-P)(0x3vZ;
z=z=c<_)k6Jr5nd8y%%0>)y-mo6r{YyL(a=~!TFyk4qDZ{$uZ<`YL&ylPx#tHG2|;<
za#Y2VoSQH#q1UsnJHC8OiK{>{>c2v7S^w5w{^x##r6lFmW-;k*PO^OC;_HrqjM>i4
zef+oa@WGb-FMhp`-y8QE+dB^)Jlwtq?Hc!Y?mhTRwDonT5&q2Z%tg^(W@m7wW^>vt
zc>XW?*(ArAy?lI)nUbebty_<_x3+#*-`;9~9PB3%h@OnQBmGA*jn0QjhIye#HSnyu
zuOH&5oeVB9LMnxCqkcBX#^XGCl2C=kU&DRv4h9kRMd4s5_h?_A<J3tJB~?BttUjMj
zx?F{igTEt6tr2r9S3Xg3so2Xfhx08lT`~C!jnl~xRd+pOuhwO#Og<3gQ!^<tH9<ex
zsjh)qnj78TGO2FfOLc^p@;gb+u)=Fs!)=sLvo1%_;fJg$l<k{S-RgnGLC4GrM(qv~
zkVv`iS7<6aBA$SvrXq=OL$gt{kV$>kY^)3*M0oQqWw}Vy&TYb`aDea-3-e~lpfJ$a
z<)Z9`==B{+2sdeDv4RuKiq?$zCiJfbr(rHgn@xRS7_<10q553I8WWoJa&%pX*I^Dr
zbSY!-Ofmj&l3kiQ!xRPApI#-Db5bJ}-Q=9GyNlvKq8zJ(8M}%?RzQJ|uUhS>ee~kw
z?e1|ig70sRkA80LH}|9Gzfh)ty`wk39JgM+I*DE#9qc!c+myp$?+9~6JwH7;f*)3P
z+wkTJofvqwd-zM#{M(!3X1g679Y?L#Zw^|}9}IB3dw9}nw&SRExOZ^6-#UC5N6<%f
zcyz*HpwR5(D8_NgXRq{Tbo3&6-8{y;1t+`DTL-O^Uueh|t&>9>?gfmu8@<^*K56Zp
z9_$`RZ%&Wj9JQ%8T;G1Hy?3zNdfnXLz@!I<M^W?V=HW@yezkjW;4Sy)?P2p67vQY*
zd6Q#SDSrYD2dmw09XIz*a9QTt9sm(0c>sjxO>?h>Uz&ew!isi}e~F=6qE$zS?dHFo
zLOXaK?eD(c#cT|<1<-*V+B-dNzQ&0ky`cE?)93Az*2(EfGkSS+v`=7fH;;dA?KRtv
zql2S10q(TjjA4+IT^t^J0jR-a`2PH~-9q>g&<{_V$H%8{Fd(;%8DIcH0E1mrB@(QU
z4r$E*tfS*!uwMiQZABctebt2DVb2d`c_+ua2#z)YaPP!!38Ml$Pprj8hs~D<t(VQi
zy(T_A!j9gy+RZv|UaO65T0HpMT^RWkmrt7pbK|cTF2}UBnD1hD|K}D?o*QFtfD-MN
zpbz}oKHYmI(B~*nQhJY2>)q+F-ut+9)On?~bMCLum;#N{=t(i{A^-Bs`)M?Fep@Me
z#m2>o^#jm_QOY3*@Vg!d`+sq;`x1uR-A7kOfJ?3M<jGdO+~n;sAc)nbQNMMIE51e@
zpaH_DV`N6s{fMcJbVP@)$<WToeaX)ChgGA=RcV?J*a}=+U?M#vC@IyDM|-gHfI`ky
zb*7!83M{w6#RI1KBTg2FbtWd0d=gX13H6f-^Hx>+G^;MAq1qY_R<GI1T2tC@+Z1JK
ziq)Gm;nJ(Nbs*e9-tW`<n3UgpU1|77_`E-u6&K+Kn;c#~8}|Tyo$kkCHpCnIBJU|b
zFjb^oWe*dpF?;)Bz)L~7U=?UptTih2nLEJbOA|_fWN5ugLQOfBcsT70r+U%}n<&?h
zak93POF0<}WHP3*JwQ!Q3w}a<e;-ro73{A^R_I)3Q8^pr-H((!k)}>j`RcjqTXn}k
zNOW8d{z^MlTeCrV!#%Zk#9tL>bQ&b*MN}(N>ujynbrNx9`4TWtYtyS00C7D{%X{MD
zvp9vPATeTV)6FpXMCpG~I3J`=FR4UJk!jNH4&LfWm+)SP+L=D(*sp8O;4+yMR&sRY
zg^VyyK|1Rap9N6tQ*a`B6FBm-fZo+|7r6P;iR&W6=V+W4wu+oPc3gYfNI}uBKGhDN
z%Z~e^1y}M~e;gW^M@oC7A9zlCqt6LZJ<hFET#ve?M84cZ0!$k|rXHxFWE)*oPgZ5q
zecL;)6_@0!bWhX#C_npviHU3K{L_XLlUL*zM^j(8c5{J5Yxw<fX^h~aa6e=^@Rhjp
zS>Glp5_#agj5~~Wd%YF~UOv};Yer98RA-QZbn}?r;Vcjo>qK#})Ws$(-6YJQsm$rG
z$U8vfXis$Q5T1mAA>B=YR5fxJmYLSw-65FSyYpgS@XqWCA3v<yk&V54>A^k0i=p3p
zZ1ss)4J5Za$;Kc7R3MsjMr>%?$Ry^k-=i#lO!h{MBt(YACWaGycuR<#5sb{;j)DWG
z6Qgt1Pr9k0_|Q+94C(f`Ud6aeE6ERgnV2$aI)4$td{Y3mNrh}Aunj{unQD8qe$7O6
z5IjsU;egDive#Mu7CWsGji1aX@>X0X)|w-FekaH%`38Bh8(E!L_(q4jGtE1^yr<NA
zh~}d6NY$e!Ji{L=8$5~}A3a%wbKyna54A~5PAJa&>ZLxe7=WR+!D5vfcE3Fh0?$QK
z7m$RT`Wrj?h;IZr<aofee7ArguRpDP40G}>O;r1aT03si94=9XS;v628nHeLr3`!i
zc^F0K=1)ba39Z@11!At3M+LL!<uT!N(3z(7cqwGUrq#IQK3#xHrtv~dVzLbgbOQ8F
z5Xp0X!cv>`upW4ytRY$c0wsvb*Zcgm9xe<=w<zV#`8a~>RHxX+OI)r(lD9ZH_cc}@
zBUO<uRv!x+r0z;4|MY&BJSvC*HEoDp!aIRNZs@9^u&5@EQmeax^!6&zwg=PUcEQCi
zJYlz$V-$el06irAZtE2C+}9j4ExnjKC%Rp3Iw|KS(X(=gAbR3Jr|?J6JwJ{9s}@-C
zZ@~eLYZ!Eg8KE&(KXMqFlqr4~n)>aY6BndgB8O1~nj!mWU%3v88J8KmKo>6zX=Q#0
zWiZv~#UxF21M6k{-5DDuxQ0Qva4d(Mp7y!$ar@%f<}nJ-XM>Mat;I|q&6DFv+Rr}4
zmIDyH8+f%%_Dhf3D7(C}NEvwF*ny=7<Ha-xzp+m_8FYJ2(GU@|gry@>*%3(!k8cU)
z>eu;q1FzC6(HaODHtfl*KkJ?n<=qp0Y$^WA>{C0P?t<{s2H{7)De@N5Q5<f83A1GX
zn@&JZMPHuoSF<tAxBu-lwzlti_P+-^@Xt5<-=FXS5^i=pT95Vy8HH?M?#gb`<pO4u
zBv3WuB4MM;WRUd|Dd-ro`+YO{eKYxeGx>cp`F%6_eKYwjWAd}CbL8MohB(ok>AOd#
zkg{u5on2F1sb2O88m2@K@WzTcL{*tVL{RcucKO0<?PHl;Q8dzUtS6(VQdA6y2PTH5
z9O>zVh&f%2OzW}<l@}bus!y)NjJK%HwM=za64f9bag7MQJR*E6dvF2)&u|}q!VSnV
zKH&dn@82KVII;zCe1HAsujpvjM#2IEeq;t4=VHJPcQCLB$CLH=>eEOKv@NMMYRQ;v
zvVZ&cJnPlfLfB63-Cb+<PH=a1Jx-lEb>4^8g3f(>CsOswWoM3@LWlFI*;F-J$6`Fz
zd^dcT7w(s^b|S6^Ddm&D;yFt42fi+;+=f`aqA=m5(;f01CtoaQGGWp^PO@H>V@~an
z$2-6^T9)aBfzOWgP2Xt65UebbVbsUJW?UMS{whf(Cf=HMfNdohqQ@S80-hnSCpM^7
z3Za>?_H&YcN|sM$J5D8g0tflit7DR1{1?U~<$ZTrOw++WMS5ttT6*M|r~vL-M>*|H
zin8?7ICFov4_BAPAUqn9TO2dl+@d$wluHT&IV&Vp*_5U#=BKN8(a?BTlT7k^NSF$7
zlBf#U>Fh9wVb3g#(N%Pm4G!VPe&Q7=6dgF+!5p*4mF_q%duhulVKZk_NZZXBLZtc-
z_oUp5q`NjKEgXztZd}wxrMM6cswF#>k8m-Xft%%7T328IIP0Y)#VBh02;mQoZ>=_e
zcV}a=ONmhwYqf#AR}|x<cinU9r&32UQ#CWmys_Lx515_I7<GBtlBJQlEKOb3x?Ob^
z^}Dl<Cz2~{h|J>DrOK2O-l>_$WM!$hwCa_Om#|B;0%0k2fo-3vr2x`U29LIy<S7BW
zn^IKjU6}m;vScoxV5S1l%-U`}1<Hg^r;I+^-}O5%gi<;%S^A~e?-J22vt;<(=9!^P
z?1S{zYb+18njGN@smKmfP`V~~5TfftRQze$SdTt4>4q`fS`obhQ}`#CwMweF0ADQt
z<N0UlXf~#8lJH<kLZm0FDPu49TGsbuUy@<jI|HSINs;z(n=JsZGLtcMHZoWRlT+sa
z+HAcM7-6zf3UW=d3ph`74NVKbR-aYk@g>*QORoETXS;LirSwQY?Q2f`iIcz%o_Ekq
zzIk_&x1mE`N>?|qtCMN@pJdqw`l9h44UYG6!@W4p4w_+pKWtV>!sQ(2<+GCN27aOd
z0hjnp@>O(Q=l^uA4~zboByO`CJM{8BbpuD_1x2?6YW(yQpEYQyt1R1L#O~c*Thfm9
zTJ0bhLH7I&R~oQdW9sTh_armS%n9}h!?Kgl&V5d{1b{3Ci8)h@TQFors95wGKbhMK
z$z`MoM_HWJd@WF$yD>3P#Y*iGvK3=O2@juWii=_2oK}X1;8FFIlCD}DVK{DqsF<OG
z3!W*@;>A3*nSsE6WyPDPqX!TA`mJ(aPmcb+cSwGCC%@I)B+)Zo>FEgMp2J1EfW{z%
zRQlN2-oZjNi}rGObZ~TZY~n^-qrp^SXGkN<IOLzXWVu{7>ezCfuqg>!Y}ghXUB~#S
zo<jMkD_KXjq>tpOG);cgC!6xbi%XGUb(jMTV*8PBb!aDs8Ja&8Il}5o=b8kQ6)Xn-
zdc|OX3>xdnuz>G~wKB!T6v?78G7@{HghCW8j76&;|5Hb$q=IJG$UZV^m{ApbG9%hL
zuo<RN59I;vxkSYd9M)C5vPOjt%;l+^p(L-HlR>o2dL_Du*WARShTD_N5Bs9Zvf>L#
z6GEYaJw(n_VxpI;8cyA_c(J1sDUT*6*?4emuUrsAh|OKrbsKyD_Me|AN>Ff@ymV5w
zn0A#sEp~H9m=l$FS6l}`2@?ko(y<gb^EWLkJqj+Qqn3V!7U-JWSl-?CM%K^f-pcs9
z`DWI|RF7?y>PN|gPVa60Zsi%K@hkf!=8_1Xw_xZ>2i3XIG4GcSnr`90N7)s2dJ~JF
zzqH>clp>4e3lxN>&0cN6nWVu>PL}SJONs?$?eWD{t4ZUg-m+3;9dUyc>?Q>=vgk6-
zYNLK$A?a*YfW7#q2B0+{10WM$a8tYZo$j@$cu?riPoesI^%zw8{k`to#*S=0EwjP7
zcTQdMfFYncCWGcMP=`bWp`iGSpNWN$y}B``$@`j5-<xydeOo;uw?OW>h|O13aI4M5
z?yrN{pNZA=pDE-b{A?wGH~vCaHR2*8#e;l#+*fWYy!gLMtD2+RY0rhbG+DAE*qM8p
zjUER2ZNllXQ##saZZ(oB>ph>NNTt#$V1Zz$bB8jRv}1MJcG#(fq_R+ClK#e)_&S2I
zXr4H9S@pOg|B5d?DK>Rd?3|-gu>)0C!1uF&mB^~Oa-VZT&fHWyBG|#oS`KEYT*RwA
z%&wZjOVy0T-s3e+X+IW)Q2VTGSEBqy@;jYeOJ}!|P`STK=DB%NlEm42XJEcqHE-#2
zzKk8*dC;-zabyY1pFWZ*MO7`C$2#L7llpxnkt5*6v-5NG7tu;BrRw=ZBZzg|m2<m<
z&Kwi?wmU7BZ2fVrVM9SaPKx`OI$RZlR&B)vdP}YF?Ai>l8+-bts!x0htA1vFIzY}4
zRA&ZNlbkvaeZKJ`r)n3de=9LsD%EM~L@);%)sB^(*dUUR$jF_W?EJ=Fy_&qzYK(e9
zdX!F+C!BEc1JA9&LPo|Usl-4aBxqI5o0AdR0gUsM3mlYzxKJ-FP@3X-B7dt+($}P=
zJ;#+a_&8_~Qv>*7e_Xzg9HF?#UnAQu@VzI$M~<@so4IcX^g&fbaR;bS{HrXX0-?OG
zs|hEy3KYdc^7Sz0PIUodxIL;L*p#XndPAdAm4NxSr|SENNd?o+($v|XPMp*lT>?<q
z?QR-`&l>HGY6eWq^XqDd+gR$xvzS=b@5s{#xH%LV#~0E0&OuIY?E6uh;~^@?`FusY
z(eT8}kh5M}gsUb`&3>uF%KDXo^SQJerenHMM%p}RRpbY|CCbzpM@-QZ5^;4ZJEPi%
z$TLt#K#2ap&Clh+*=|qeu;2EW-h5tTzSDT$aJVDKbCJ&FQ`VblR0}&$Q!!+$AItt{
z07gK$zj~9ITBZ)yilUY8v&LItRY2wi+oSmANC?Hq0%Gc+n{qe7XYT#UBp~heib>x(
z8dzidB{>{TlJjheg{Rsk*pt1MXc%%EzjBKj3f<=0AD&C>=naN+7LC+9;bKzE#-$oQ
ziIqp!HL*C_`%Bk#A`S#pmn3FCIuUWiEw6(JG`f$LV}zUmF*~-2Vpca!speH$-iQA~
zY-K|#_A}{oo*<eZ^Ar8-JcU~uh%}bOc0#ti8<f&(*PE6Ijh|FL!x`W79Uyw}p*Tf$
zdD?Tom$g4Jl(5N@y?ZzL-s`4?Wnr2!C3x$<)Q}dryMR5y?Kz?H*it1M=J9gx^zVDW
zbl_(0yguMkQ#L#rXqt!&@-=3L+TkrBc6iuF#T_Mt<p1{Cce!gPjq3N(jY|_ve_6&e
zYWm;dPp9t?GMv=1N-@-al}zI%eKlpP^r<r2&Lg=KxpoD<20Cnq6;jO!v1D~rpCTaD
zWKYlguK4I(#ubT%J9VhG<j8feChD(N%%fKQxSV2EMZyXt8TDkXh2}PoID0>T5$zmH
zJw|L}p5@ZcY|B(%<Gpnu;7uC)tqO)K&+@(z4)GtJfap!2#<xbf+TY!y5k*G6d0x_~
zW#=aJ5^ek07D&`6YiX;!b;gr|D!DVOh4oj*=w}Z%12l&tc${GUQ%oeE9M8@=vorK9
zJ)V`9+E+^*Rph474w>dQwMh4QkvP0;s~s;v=6D+5^~dhB!PTc8R{Ku*?<E*@uBd1M
zLzh%qVmVW~j<72%?uI~IVjnv$W3R#LFf)7)$faS~w(J|a=9HOxi<8i1{CEj~G`C(c
zST!y|<empD(eFB0!IjtxyG@!I5)@&7CzF(nUY5P>8^<?^nM#s$JRamdE(mDv+7)1W
z)txy_DC$cuFJ}x@9MViVi+I7cib)%U-E)OvyxMVKyela(jAvx8UhGei`xWCxRRt!1
zHgX{YmLqxyPHt9ha=!{hpfyXy=Zi}oH!jnl*U-tJC_c=_>}&M=dVlw(u6&C4J-w>r
z@14i-JF;fgtHFAxAXNb_x1txY@lxVG=2JyxhGwFvk)4ezMx<+9T-FbJvSV52BZny+
z6%>1f5~U{@y71{?P-r<$o+TSG6PN1Dk%$}s#qPB?BI;soMd4QxWCntdZqEv>U<E|F
z57`JLzV$g>m=LO7%%&ILXG@Cp=idGP+n!41_GJun*F%}~2;~6UE7BvO!iPjT>k#G<
z;N$_4UQB4Pn*3B;p;)g>XnyVzSE>jAe|^lXU!a3RSDB+KDiZacBe?-c{C%YH#&-%8
zOXX}l#!Nj#MnMLjNyGrpZUYs5R~VnK{haZtknWiN6#s<k$K-asgF>H>7%t7np&HzA
zRRktSwq(Y}v8tPf9BhRvK7ReY^ZI#U$9_YS5t37OzmPl}co@fUxMyR$o<|qJlU(xF
zk=Q}Eki{~QkL=>k%GsHc(w4dsPuYt&wf=kFDU5&JYe$qSp1wEC5YDCqBrNRB=sRfR
zG}t>9k>Ej_B34{S%w>y_Y-~^?m+DpC5ORUoBzN8Qlnc!iZXfwnB87334Xc(?lpH&Z
zh(RvYZMvN}DY1f#tsyf{S_wHZ4f4!wV5Qb6x{~L3L|Fzlw=!Oc9=dv0n714F0(L>~
zKfd?sV6R_o<3Nnx>o?+eyz3hj6>%4NB0a>wSQP~^TjWZk&dV6XiEeo4ZR5I!Vq?qC
zxNKXp4`l74z>FUyUsO}oF6byMY#UXb*cx(EbC;CaDXJez8dykTMSUlFEwNfrKmafH
zDs$>C%5`Wxls!%Tyergls-d$o$7)#5<2t>>Y4KcFxhS7x0=*+XES~R*qhW2?*R?(>
z^L<lD1~P6QK#FxT@rp`LQ;cLsA}X$4;xeLZb6iKLWndMnbY8WQ=Bt>X=Se__S*mjh
zmMQpIBF!y&Iq}hwS5EK_V`)5646>JS>{ls<4yb0Upj-w{@2s%Q`^GWVBR-r#+N#m`
zPR4sRHEgpwXn8*FDpNRp1sXzjdS;cRDEnOcX3T_YXsrmYKFMhJss>Wu6=Xgw;WSgk
z!oCthf@#;On7lYR4ALGSQKBwHO)LRoP)SI{DoRCxfaqyL+mvr;nwB3D@y8b-ROA{D
zmUt}T(!KV!%tZXKTtguvY|&$_71;%`24JNqH_E1Bap8n}jwotf1`th*&j98eAfu?#
z4!bN9MaAkuMFvFeGwii_PU$v)65>rLL@eo3qH}i6N9ZZDP6_tMaPziIl&1Pi8|iq7
zj?xmPRVsb)nC(BJqD==Sz!O!yvq7fTTO8~>FsD$eLCdzf>Ss3$hJb_%(7x)h2;cDq
z)I;K4;KCz;T$joQ)2&3a)$CGE*N#Fq`-t^joKQFFQ!HO2bHxD+C1QvKd|-Gtxjp4I
zl#RwO;nX7wGs(!_%Lpv-7O?#zQZBH^bHNCC?S*_yRZZ>%Q5fSjQ45y%a64#b#v>F%
zae1M@>#Gvmif7iw?ra%GkyY=ceZv>SaXm?|qPJ00Vkb0mExI+vK~L>Vt|N4}V=^Lf
zyLT@vs*`5O*iAQQTdou*DdVm6pk5a`$C%>NTgZ*KF!b={x3AIH=T6EYsb_UJ?`uSW
zC?E5_tH0Hal>BoM#YgT2YusP<-5V-bjjN?X5=2Hi#Pfh{pT|A10)vtj@Wtn`m$nZ$
zc^~s)Ru0@FLo^iyfEba%JM}UhkI@Ko?sjG3PqDPL*v~X1(}>8f)i)`DktG(>Uza;%
z;DM|lW|U8U^R0^C%lmqFhv0)7nv22NeDc3;V4Z&d&fR3+J5C{jj~rg2E!#_b>0YLu
zkjJ+s5mcsr#(_o=r|Jl5!BxLLnaJI{5vWiJr_Wk@Ohw6kI#i^+HirXJF%dQM5nrZF
z5g&Ti&B6)NrXuxfg|!iA=>=Li0V*WO5G>VS$q%U{94FR<`4R<cUAXSbmZ7g6DWZ@c
z?}<bjElMSoPh@`Z%>)k}7HLQJ2SYEkcBopzDJEFBIbcjE^JOYeM5cpt%{r4C?x$*G
z0(5{0i3AVoFSRx|^gMo@M=cVu7m$`k>Qp|1*%W2gNIy<?0MxgmWqL<;%u$|CZHA3=
ztv|i{oKlTpgNs3NmJT*KM1*5#u@0*Q4)+U6g)Pc^@rwwVU1cyx9{0jZ<+Qhr+>u(<
zzp6QgS&E)q4P7GDI%+54TVR+emS4`{PN9yxF)2heeglY=ByoGkKdzY}F9v<iqhN|v
zDpsE0Njj}oubfOBxtMT!GHv<wE-PI$iASh>NvX=T_sO(9cX)#?+m7{w_h#x^Q6dHu
zfy{hVFONo?$&Vu1F)y&oYSnnhxvT@aHXWi0W_jQ!uJI}IE%1l`@FcrJR!KTmFW9>S
zHwZwoP&Nms(Wd^1XBi;R@_k*kb~&*61<dGY6!D;w&|1836yQ9H-fNdYui)&BW`n_7
z(IESt{<RHS?a-1?^-$M4Kn;)}Exb5*O<7<tX#?dAGT1G01X=v>X4Di_wJvp)dXetN
z>o1Cz+t@Pb%((_*WhCQgqqYn4*UdhD^HNConn|ThKod|o!1R<-S2M#ep0JW|iTDjB
zQz|vrBr_om!c{T(FetFDz!hl;ICdY8pa!IK*?~4uUp=23P&erV*|owZX?{&+Xm?Vo
z5p^f+B#mHkpVQ^@ux+a-wMjH+@Ux7i=_%cxlx7+w4;AG*h3aJ`O{aQfQL6vZd44gY
zrD@vtpm&i0D}K{%#tn1r4bu-<sfDKX?jb)Xj`h)=tn2hS<wpVHwdwd(VN+vDB3YP)
za0h^*d?7Z#sjtVZ`Fu^RUOH6Y+-iwYPOvG`Vh&;lm}T-coXQTCo2Q$^gtoE?$8bML
zelcYMW{uR`4W1$T2B}w@g%q2h-o;eA>_0@FpYjpQVhQEK#2dvjdrpdeaXXsduN_}`
z!GPR6-7=lIWTtk-_;Y4SfFw+vAS096vg4LgzOe_yvG=9Pd3I&I8R%>A$fbB%<chiG
zM0O6SV%TNofiwpPx|_gDzzb_Qw^)yhD9H(WBxxKjt-aIcyv1S-c+3o<BjT1*L}$fx
zo|PrrC^*ry(6YO>2HiCSh*9xr2LkUoT^*$=Kpqm&l>J22G<J3^HZ^k!uF}B=H(knn
zeM5|HvvNVE8Wf=Cr*7o@jghP<E6~*5z|5$b`&O`Q@92f7G0tFDKiK!R%sGuCnV74=
zu8|>bfyg%^vw>qYl+r<U@fqFjY#(nbmay;!xD!Paduuvu!#SJa8QpU!Z$c!J^dfka
z)RW_)aJn`G-Z-D~NnxBJW<$unY&YFYeXCEL%tkIU1q%+*_nvVz!~CvzVEO7%cP3`y
z)kg{CZgJyw7<*1&D1rkyYT@oIIYMz5t0%T)7DtSKzM8(dC(f=Wa)YXqjHs+u7)~=o
z+6WT})HVW)7z<400ayLOj^xJA>|9)C(El#i^<L?Po(;#->$YM3O^iM&?18i3T+w}N
zw|G9w2YsWztVY{wa;15;KI_9v^;4~0wHFJ>&|2SmY@A#qwROSQe41cLOpwRqE99dQ
zlOa{w_#PEIJO}lMv?r*FwH{HBnLC$gJR^zK%<x7|a0e_u=H=HyyF;6mgUE(_$EPlz
ziuawT%MUYF(Md5zV1g~`($8k+Zy#)kbFWQ>jIz;SgQJ|Am?l~Dx$tMJ?N<J!k~nw*
zIT)X?Px)@=`72=FPKsjqqL{E#0(Y{!{;1j(WK@oR#%7J>h7p14+Ti@GuDrIVe@_01
zu34?fP354`7aFE}WJM7C*%JH-Re(1EIGV(uc3uCy;R%V0LFpEdn%8t*)`bPTkEu23
z2_G8zCawtM{D(8w!Gg2XMooX}7hFfDS(J0UC7c2;rFh}s_nz+AI9S-EXLJ26458h3
zBnVLy_*}nFXMqss8<u@@Zhl)5fv+m@T2h|$=2$rlk@&t=dlOoiKFg=WXsK1ZDBxK&
zvzvdg>OC!@e3(ga71DN>d0-A^I4nj12N6rgNiw+mTXsCosyB74s+69FdG{^>%t_A`
zPF|eBP~LW3zAEkn!rTmE9<lBoZnWz&hB=$Laf>W68__f}hM}l>#j5GB2SjAUH68X^
zt!nEVa@|QdTut&AB_M&K#!oq$eIj<QUjdxEnQ8yB=-sfHz4n|$Yq}QdsBXSAT2!G(
zpQ-YY`=}@igE><M7j7DF_j~1OR7E#`Voc#p{u1;)j81I9bT1o`Lx4HlK*AYssuD+J
zSULer{+yKJNHpBEmEkcKYjHwBkT!$I$Y=sgR;@FNM4S!DT-L{)CsPxyY&)c}N5xf)
z2+$rdRBE`%x&(c-xhZaNi-P}8a{f%BLaecb>W~IXL~4bmJatF$Of@#+hT-@1-OFrh
zb*la~#y3@s`jzHd+ZzQ-x}Dvq+)_C~s|!U1^ZA2n9-GR*UX=Jk!}>Sm@3o~uzWx3$
z{8j3|;B7nxTwA^TYGcf=|FZVzhsV|WFON6A)qnXjex!=#9ZyzPl5OI~xO@o-eW*pp
z>Kys6CO_klqW{=M66G8;Z5oA;B<>bNJ%4ju%;*L@&(ZpB%cfjTr{i+-{{4%5dO15=
z1vdA-l!h@_SXW!-hi|oIzSWkIuD;cl`Bq!zTWy(dwPohkmN_3`ZH8|5V83&E3}Sfq
zr|<s4X^Q=awhYbFa@rr{XRDXb{Aa+C<1_R5!EqO0{QUKcZfF00?j;-RDE)1$0e!j1
z`6gZ2_>adAFl}doo-+xMq#+1M8|z$e8Cnm<5^~ZKe+v_GFfQP9BP&nQ9pxr|;SBtI
z4^Vb5S#zIlzkm%-*4;-Zdw`~}4I3a(_$ep{V-(Uvq25d3%FU<OT3~Q6CONP23B31x
z9HC|B61asAr^SnWdh-YPOjcZZUdg4MVJ!xfgC1;PI&GM0rOBB6>aRHDGI+TRLUMEl
z+vxM$|Ew9ry4$75k_Eb}J~30&F$UuU%IdusC_yF+8!|*la$F`8MrBNRjY|ATcP}s#
z+F~Ogq>HvB#oGd~iG2$K>c>UDwGe!cNhcPY9BB|E15mwCU|O?JEw1=E82>C5`2Eo|
zyMSBxI`*BWekWYT@A_F59awv-2f07$f>2x@+er+@b4!6%<iAOV;i=hIEdP0<{I~Yt
zhfw}|_~_9$`R~v8-H*ywYkyk-A#3BCko8T-`X*$36SBSuS>J@Ln}sY)drjtDE>vcM
zd|u{L#FceCoxAyDdQIl8nTEcVV$`COIh5>NtW?As1g@2FPN6rHFvnViD7MmilcS57
z*u;q}X)mQQe>*-IoPNZU>rmNQmGuf1^-O6}<&G{J&O^yG<Uj09dXFDc4O8aHh|vO2
zAS7a@C(Lry>Au`Q?P3cu{`emf=;nV32kG<|-)=--lihc}?|sajpW&Mva}07XfVLgL
zVfokd*ZT*%-TmEgh{|N$>CnQPYn3=S8LADSMysp*vt<l{;w+MK!PLHA;*na5N;(ov
z#b`3qGOv^>q8P!xP?UX6t_GLcCviVO{M=N->qN4^mY2nqW{-dq^Wuo&#%I&<O!6K`
zaQ_*Gj*G*Bvq1u4&a)izi;uXm*^*PTWY0bRdw%E@@fyL+G@71QJh2*g27^xx2jnEV
z;QzFI4DiC7b<lOsM$6j(-F~wL{y*@m%71WpzM}09e>cc~4<0-W?SBt{fac%izdzyk
zP5%2P|9zAHzR7>z<iBt7-&ZoSv2Xy$w|n%;F|!4azf(;;aUciCc0BxRQ%z6wup<wR
z<t5AdAQg}*+w1fIdwuxV?yK#8;8s9m_$#jO{`T{K75-0(kNtW2|3~ZV4>v0M{~x~b
ze}Bpk1aH~#WQ7Ch9Y<R&LDtuN3@Kfknpqk1y>X?wR*jz)^O0-c_{eX3<TpO@8z1?N
zkNn0*F2YAvH1LZ$W!Y!55m1c2|172QHKft61ZfJ%0fJyG3_&>w7`8{5f0`|?B+2=V
zEf#LJS@;%PO7uJCXhVX}xr{Ie7DjVq-ST>PRt!q)PpVl+c)c*UercMs?7W~HShyOb
zvC64kCMGX$d71W$E2XzI1>>2WYNFaJPP+d-lY76gsWh<o3ofCbPWpQLOVKT2%YQ{6
zbO{KYL=1C3X&rlt8lob`zu#n98BZ@Ue~|aE!HF7tD~eg8`w-?d%zGcx37J<w>_DmG
zr|qBjfbBmxINBjcJR>3iEqt;64|dLLuC>hb?GBvM)9&FBz3LvpNqcc{^rl(<3T-f=
z411QX=r_CFa>jMKoG0US(u+Ooc3bh`MQ3ld^Jb_yt=W->nvy)TzycCR^(Os&&+GMB
zf)7n+l!*`{^=*(SA-dW8wp3^s<|9gyAup&{5=@NhwP9j;MLL64TCy#X%7j_TIe$%#
z0Vg|Sneo}zrO7_N+CQX8H$SzKCjQT}WG(qI!M`>W2bQoLvOa#of<8H>{lok-6Fkp6
znfr7UvT2WV5z1P7f?PDRv)4e;x~Drl2fL9@QRWtW+jakK8uj=gyWE+k)u-kI%7F~;
zD9f6*uRJu(%^|~P<{yYe!TkSyZ|?lxXA93Cn%-*u(0-BmLo;Xo-W)&Cq}mic>rB;q
zY(DABI~>b?QGIF<UO$|T(W9;_6sC*TxGqn-+l7<PL}q`~n>3M0?6L&ZrkAa`ozSwJ
zK6bNsAK!@qkVNopYN}3qPHQ#_YFnnlGMW@e>=wna>9`ykf-J^DxCh}dv<)%cOpaz#
zCt3G&a;?QiMBYp8{5s>JU6=vEnjhKomHMVcozk^D1K|N(n2G$m(`_#6gkhpxszsVj
zT1wVzy>oXxPbA6RwV^jKLjfO&8y+1wPtMa^i)Ab=&q~y0EOAmvQ@EO+GSR}?*#&=X
zFSq4i0TMD5Zrt=7IprVHy+XN`3R_^At1{WrQy3CBYJJb4(=8`G&G&R*yzDG>m!58u
z16BN|+{^g39_^hOb6p=^rmPn;WIzKy=>?Wi<O>X+E;j{W%PpF*`^EfWgO%T63X=T_
z#&i34qNiOljVfLX#-n(bjsQRH);rWNI7aU7#WBRIm}oaFg7q$pT^RoUdFUQP-LJ5O
z>dfi@_@xK#)~9WemB<%gydB$?)1g#%$U+zgBIat&u1!K_=4jceLVZv!3Un|@NwFh9
zF?<#3jz%deWJ-eKj!9W;ICd<5fv!;~S}0q!n!J`Oi1>~!!0ddIUKkEvxfw$qcK2SK
zY`+X3J}SCXnraMPK8vJ%svP9DuyOwYW@>xqr#<NKaPPL;QcpK3^ew)Td}HF~Ig73c
zFI0sJR};%ZS$oOXO~K_pYJl*&%Ya7@K4B16;!N`CAA9HZ{@^=L*vIvDg|ClYdvmr!
zF28TL-xu9}4qnA>!rsEyNEL7Xi`;}?Z3%zgO?c}wxX4Pr)=h}pAu`>c$BD~;x+1gQ
zAiV0cD3qG2qZCBa<HPWB!s#q2ZNb{{gT6h9+!_P;urWQl&uO<Dcxj!+wx+YSg+$LO
zo2Qfgj0u>OfW!TbB#8gjQMT!`ILWAFANJBa%4`o|w%FqhQ+3oOF(MrfbR&N@myQdN
z>q$9-oQlW>+6Ig7+NKJ@&w<u_W<Vya2`3|S=h^%LH<4nWy^I8Vp|QOpR=g|1hp}^c
z$)|Ntme=h$7uO#Eb!UD8#T)O}$fkTvm<wEaHgj&@6Q!Gr-oFayIKfkBTEZXDN%KMU
zE=HO{TTYcDKkp_ux!p|=rRraIb=7%Rq5icl>My#M7Fk#H(*DwYI~MbnM~_-0MwZtl
zm6*^<4?ztdyvd9`{!9wVl7gRWRJD_f{9`6n{=8~`SC|aGpu!55AR1>AHRtD&+S;j4
zAvO6h44M^>RFILPHLSrwMceq*EfDusSdsI*yZr|0=<Me_3Ms%2=^;Wsm=f=7&CK-D
z3@^KtpidPWtz7H(bsN?u#?xs3u^Zk<#q%!iTT9ChFY^anU^iV2kvoiD+g?0!-pPmg
zAf?bF0)BfTTEg{7u)RYMSt(IVM;y}eUw2RK1^EZ;uI>C!-e->M`n8-+`m=GfSB!uv
z@iUWOUO+rR)_?=r%GNyzq>^+L7AVbus`Dj{?6_UF2LZ8WyGckfj2+02DdT3dp;%tX
zctmMH95d5w=#PM{jY3Spluf-$L<}}DLye9dxqEPj?7wUQ1ooUe>2xZQnxo{Xvts<D
zuF`9DiF&hra=3r^a+B`^y@zzn3z+VtEaB#oo2j2kz#AMoiOf^wEBZrFC7?{}(22|4
z*{r;#s^xm;N$sRbo=Hg+it(hIj(G>F42&ljugj}+Jf^?Vh(@*dN}c=*Q-T&V-N6mk
zzzGomCK=UR8C^7xFkDbrYNpi=jKhYmmu9qAPIL5$gU?~Xe7}}xiN|8g*fACl#FY-v
zU1bbXT3%-4u;Vyrx?t3xS8FMz!;UUZ-OlOuY0LH6xGwKcug6&#xZ1#DJX-$K^WJDW
zAitUbe|5jSB&C?v2q1tb=ek6vk7l>C(>+G_D|<GjBly@kQy4z^aP4o8-#O1P#uwfE
z-fle7=QzT7zpZ5+oFmyzmOsf!G_jQ0K^r<~H|_(k)4P9X(5GcK+U#GDz(U5k4WC3J
z+C0bD$zlvg-*j=*J=r}vJop6;3((h<^)T})rT>Nvhi@s-JuZeSuy_S#dV`|Opov>C
z!s~_wcc&RMmoOa)+oYFLkz(Tk*I>aj$V}G8Ltw(r^K3u|g4g>L7Wa%+>}NV3Bi~6~
zt*p2+95dPLT~2_MEhS5V8e-f^##)KucZZJ+!SN~H4K@B0HeSZoOaEM3(s1Ll<j<$Y
zU;y7!;_r3M{Ecsyw+PYvq_<_sT+|>u2B+Jdzhm6*qNf0GmyzB+AEv#_`&e5&@)-Z8
zn~(D8qUQwr!Nk8<s(mYYwY~FG_xK2PT1Ga8wa<FoqI;H>d9RCPHks0YxCxCqEHApa
ziY`}p!cM74SCIsl-hIB^+283R1iCv%uMbZh12l~Q1iXu9Kx%7t@nN&oHb<kK+{H&!
z(D3hjCx_k6>z$pwPN$+5lKrGkaT?TpJDfyYhNX#4TX%WNIEXX%mLGb~uU01+){lcJ
zGWQeicDIXZ&7OC5yWPNfYj=`f6r&e|YjWWFTr9xnSY2+>jh1cvK+D48nArW3&+!3Q
z<G=@4uo@n;EVUcvXKx=0^~1l{-a*ry(}ON<gnhh@k7;j^=G*5R-t+G9{;qxZ0N?2z
zJ2=5BZ$guH@({K~c1LE~mQqA(Ev_vS_|n-82$4g%4cf>LIRXnAzh#;N-kT)2y1ZoV
z$K&qD;hgU+ORRW#5W|(jY$`LoB|?1G)^B{?-ar0R_Ff-9d>5SzzIyb|<`eh~ESa~T
zbGP%RePl+b6VmsXmoV-kZpC@|1x$`??07ORi6+}!ozJu^%A9bwG4|w(`IEfB9Yg-<
zc>idJVJ2H<zKZfH|G$t)3Aq$!k9bEXvY)bFaG)0et*HgqOR21;CuKw=3tPyIHC<%a
z;Q23`i^DBBi@Yh;J{0zw*d!I?TC1z_srK-~b-v&d3|QBjRRma!VE}U|ll7!ILSv89
zxTRfCFwJaIW=^G<Kpo@?f}Zz4=(lS9J}Gse3rOR7!ndxf8B|f)w~l@_Kl24h6CbmM
zo9lI~8)$OVfJg+AjG-5*Z~ImFJu@*B`?VANo5#0?1Hg#aB>i*lafB}HU9Z#(Cui5B
zvP8OU%7OlBNf=E-&{LdE@dPyJc>_?N{(%3MzuJG4zp9|(^d#iU&T2#jRsl67b_%_q
zNhnpSf>=udMO<1LeXl1e38E<28K->3l*=p~!&*oHEzM%wN#p8E!vQt0vNHcE^H+i!
z&e1kA6UEcz&Xvknk?3lCyd^Nt)&|8YP}vHKw$1Tuf(Ho?M2~8rpak2RGilydn6lv4
z{0T=+hRmJZ(X-MZg9QhbHB3L4aww>T<{~4+2&Z^<jkXzqFtU{pk@TXR-9(U(Tb9gV
z?vfORaaHD=#TF*#ech^PP&K1~?w$b$PYz~O)tsx*I|Ok6M9^$Xzeo`FWX#3d)|ZoF
zRLsi3H6p{mW;x;+xxrICt|dfBEH847^itu%6;{c~w}0kU;`^AQ&g=W{c@EW6gW)X~
z6D$iWGj5or!ouO}cCyYs!nhK%K*E-$vm^ls?#XOK6<?Yf2HFxd6h-S%$D81EIJP;K
zOhTj)x!XB~v<<bf$5$J>VyL?`?qXHCLdqb220QAdY?6x{X4Ou(ht)g%Ra!3eARPqq
zvpXt%XaH!2@Q80rJ0Q<i7^C=h{V#hZEKcjc;G8s>jcCf#8<EgL_4n_h_ieYkeSCbd
zhq8fGjYA@VLNY<K#f6Hn4%5WpAqem#5b-V<y5N7iq>TaI0(EzX#Wd5XW38?MoQ`NR
zg%-O!$?B!48<iVkO%}E^*-a-`(DGliY?iHFa%XNuchV;|F#UP=r@ign2I>nY1t4Hc
z7m58)U{;UJy=1{-eJK@C$Czd@%PF4>R~UkUm}l$asLJ4SHdM8wTLB%lQB6tN#_p}d
z<ii=UP?WtG)`c@+1{lqb_Ys067rN%pDV+Jt?Uv1rlQbXT)Ek=(v@_<cAO;p~l4|{^
zggTRKZ%zT*G=aS&vyS%3#dSSxHr8Upcs`jotPq$Q`jVo!=?=fjOEM@+cPs0$ZdgT}
zQ46l}C~9HRxabw66WsfhqNniYjfmAaDa*}9dxa{T1+h+!2Kd$Xai<mIz+-)~LY4lO
zJlW$Qw;(zvzg=J3c<5JcW$UiZbcbS(h_`G<p+1EmzSuw5gHgtgSc4#}NFnE_kUS?@
zrxD^vqurP^v<z9LaIYtgt#ADGou$N8Ax!QG{ddb#7xP#Mg(tCjnNFP9I3XVA73C;v
zV9#L#$|k~6N5{WgZEPQL3?rF)IvMqbWB!PD2q7#oc2FnJ+NwkmOJ6O0a8<en^sx$n
z^ewAp!&ki3_f$zsUEjm07+o!3F=B}SsjW2kyK|qNiy%4n873OT%8x>6=1>{pwuMFk
z8OX^vM3i^C6sjnxAlOR5X(&;>O6f;2N*BqJ&?*Ypy#%2WdB_Qd<qnJ~%Tn@fVBvq7
zU1Z0^wh+-B6)VLU>Cx#=$H{q?!eZ#Gi(RXnjg=TkkmMNd5hNFMg1_{T*4$!*^{Tlj
zFb?qoXcH+g##%%>ID_<Opd+Ft?oEiaFj4i=$==KTqeIpzAWH~6*YFM1FW7pEW7oZ-
zo}BX_#wM{I2U;T+xxYvJhf^caY8+4Uk7!V)w5ywqO1;oPMFp!^h5zeP_uW2xgebRc
z2DgI=4T_CPbozE98D8m@LwP7!Kd9rH=N?A;*71%N{wi?^xIVLF(dDWf{@}zaVmJ#8
z+bV>Hz#(9kf0#}_U=idpk^SL}!tRmV1kA?59%Q4HqRVo2*e=X^p7WxZ5`9-fA-8MW
zI4B`upt@zqR1Au%HWpol<BuJ$udS^O%kS$B<5-ZVPdR(T>oL&n)Lz>G3d-H$X3G^J
z7m*uQF}}PmbC|U*v3aunszq5}uw$Ze`%|=he*o_70_DN8nXs8+8zezJ13n7%W+WM3
z<{4&$nG~fZL7LWp<Cf@?eli;qY1LFXSley${{2zf&ww?RL@8Y24UPtkQ{Kl6llRyD
zcE8u{b*K5bds$pD@MIYx)sq#c%euP?W%b<EaBL7RlQ(IpMtqpps4ppEY<8NRog|&w
z{6T}fmyOD7Q}VaS)O%R+9%K)$zFe*rlZ*S(vb=wGegDDg+WkH{^kk#%>kh$UgU8mC
z5kV~1*){OvAAw$;6oA>&<d9%PA3op@O_6WpBbm#Fk6yuClMW`9806>Y)c#?MGf<2W
z5ZNax+2>|O#%#zix=EkoB(b0ctkxl}19GEu^)HLrDF0M3oZ&<7k$Lb>CIi*W1})3>
zDVaCBE#FRrMvR}{P)pOnPj9-f_FnNd;EV^4kAM251Fs%G6yaEHBO5W>$WL#c_-wH4
z*0-407f)RB2q*BU^N-bJCH5m8+c!VB)2j?%UOn*!V9QfGIRa`1e>j8j0EY0YK2<Kc
zHE*We*W-sPXSp%%tMig;RSG<y#c-35<z@pF9ORsO_ZC*0ip%ucfxo~P<RJVbd!_hh
zH*^RAsIXUvk1MXPh$@T3p4d(f^3m**0U5g`cZxwe$;<d=1^RX~ch@t;naFayh4ozt
z7E*)4vg08NpX_ZP;A68cV~|d0HD;LsYVbNegfu}Kw>$+pg$k0&izn{>@pK}9op%Ci
z@!#$G2s!cSmIb(P6nwbQ-~d2B4>mpz@BbvUcReDbZC{T*j4&_#Fq>W$BzUO3tDjEO
zRR<UgcXiZpKl|N8;czO=)4k5A$!_ub5ED;v_7&EheFEHcm59JsOi9(2PA+<FEk6bS
z_{fE?uoU?Oc$iAmnn?6A0)8!<V4r*po@iJ6RAlqUD^_}ssfaag>Sl7Mk9jK+oLDQV
z`hDuB`=flC!=*@SI==ZfG4%y~9JRb@2kgc#Ho^6c2SLZ%Mw<!mL`0=gZq>aT*OWYb
z^f(yAhBy#jK!e+l6vmNh-*~e7$+&=jWs}=<7~$^!vol<N`_22+*8lFRcKOT4xFP@l
z!;SSY|Njr`KRo`H|Mk!KeRlotZ`HfMC4~K!5cXR_*l!78za@nI;|t4eo3u$~HpqHY
z_skeGIUA+>z9x)n%&~`H`pHedL>CK|mZN%LL__`^37|>7>X9#cNG>N=cmZ4&v*ZeH
zD|`TBuEGS%B1!vwF$fu_DIhh_7KR%DEgPZ2+D-u@jDgQa*A}$-$lp49$pwq|7!f>9
zju&L-Y?+uI3J^4f%sGC~7GJ2oh^APT)`PKdf6D8-Z$vCH@`?M7a%7QEQSFPAim_PO
zZ-T;q;;+L0XCL$4^lMgsxQYJ<mVcvC|6v_of8+oEgdfn>SLr7)7;&l>^tYl=P9%KI
zgOk?@;e;~Q%$to1OtqVpEhWQIP55X2=2nw<{7rcHCOmu-9=-_=--L&6!ow}9Ni>M+
zPyA8>XINjNwzhy9!aKdx!VzEjrb~9yX)114vk80de!T%iemX7C6=8z(7%ADmX6YcG
zUaRX1-tp-eUVqBP9rY^1KnYCUgBeYr*@x`9WZ5R2(nWPq6qxN6s5V93pvQt`6U1L6
zo8Z;3Cyz001Nzih2i6hiT*yc0!$dPNU5txjK;z&vL?U7zio7o(TRR!grdsm(0=+fx
ze$cljJU}>zwCt%<5cXyG7Ak&_j*^2HubHX2cH~IP&H%SLTx^(Af%4b?YnF|$5p>ow
zzPn2KHKBt5)|qQrFzhHR5(dT4QgK0pbaIhR#L=+H|Kh&FF^5??qIL1NxF_~fLw}d4
zHl9iq6Nf?D8;)VeGlBVKDyRURsG&!**O-)7D#Pvle0+3t!1W{6ABT@AukCKPv)kbo
z8;>4+CtifQoyV}7xZBqn0#>P0O`v+B)?Z4iVWEeXybu<MaIj}BW83YQxR%iOL9L&E
zhh^gZz3R5-_^|3H(0+$Q$6!&C<bwwM5cYyL&i+{*>BEe=`&@k4=%e3lF8^8>E$=yx
z;A}qmL&(m)Ul@k+ZSk;x@Ekn^j2I06hY%#k-w&xzZ&36;w9(C$l3t558azX8y%;d3
zW~%O_gcW>7=x`#-*+)x%DFzBnLpD;j4DlM#n@Yo9X3(*)k-WPr&jyp3cnAX|NGcXA
zw3L}P&~rGr$fhv+9h|5aqpB_eLyRHKnyvfLs=IS=wDb2a@KQ$yulY*8o7m^Cw*O(0
z?1eelbOBsOh=C(90S0)h60_jGw6McofSD%tHsv1dQM$tLKlo>9iny3wk#1sGNeLV&
zfQBMal!>JhFm$JuE$&0N6uZEDG{q1oG)$dHTiXeRa2%;|juRp~sRrnhM|K6)22>uT
zy(X}SG;8b5fqt6z_2T~(Gp)pT!aBd&TuSnpcG}iI>S77>J^L9OyfDuG4r17eN~$DE
zp$8iyv}WRXcMbvK;tY#5JK*X72%@;eujPv?*ryR*Qr}TjGwf_hp@v-Q270#ld)DU*
ze{fNNEO9yXL2W6r20-&U*au>KipV^H5tHSjvH|u(2M~7C93LC={@GSi(8+T*K+le8
zwPG4AM|ZDgJ1YI$BV~p?Znoo=hI0qMIitzORXHaER#&@#C%E)?!O73$?FLh>$&4jz
z$~~5jrZySXYO+UZ5$RrZqPXyCLe2nFRl!+9HiN>0l0)Vbn#d@S^K3%jm#BzE{Ft$$
zD$I?dHj_s!>}OnzX9H4KGb;vDJwwM}>T6nHN6du4i&ruNc~N6y&YxMT^A|EX4hzw;
zntL-lo@<{tzO>)B$+~oKVmD=QStJiwjELM28-xc4sFW6P0|>Pc;h@<y^?a61r%D1b
zwzu%frSiDW&^p!a^Qou?XhIl|Apnw)Fa-_*o_H&F{uCpIQ|7$bKLH{BNP*qz#ta|z
z3oef}L>`?MDyjkLLnC&1CH-uWO_}8^3)=|w5U7~ITY`awy^jhymoOr^3VWO{GWwHi
z%Tp2}u|FZYzY|Yx*mOG(&z8C)=w}vT;I>FFU;=Vo6P{jWOVAnm(a$Evb6dK)1j?08
znSG@TdBjYqdxO*55Y)Vzg7flG><fdR7L%?nivhdMA(yeLmZcpM955m$yYj^ko2k)d
z(Y8(c+920QgpbR{HpuP0c)Vq9UO@3dgodqU_k{3g$Z<B`vqR(i<f(gx;K99nF4fG&
zZ{NRLC63uksLan1I$KUwW&1`_By1r+3=qHoJaTi4^Y*RqbL4&PfPBXV+$+4!#vW^v
z6DhpR1{h>z_#9kqRbp&YP-|e=6VsSMIahK#ro%$iAUVe^73|F{)dXx6+Z~|^6B9!G
zRpi)3rn1t<S$=U*Pd2a*I%|e@NiXzo&i)}JO_3Mha78+voH>z{5fEbos6)iVLE0l)
z5{R!PPx|s75p<Cp&D3!uVW$V#xzrKyzq<ta*cF_mJ@FAJI`c`XoP%Qlep5xDcG5=z
zvMi(={?;cj9{;ocq~LjT69m3*Cm*~7e%OJu<pIjK!k-P*e9@H`@8qOub~F4G__<Co
z%y3_t&IIL)c3oFB2a)F$9>F@H)&`V{h-z6BW~J-{XO;a-mO;-cTcWJ{y%VF#2U}JM
zt84bNmh;_xBNFr(<fyK{Vzi*{I4v#QGZJ@53}>2;EIYL9e%j=Kp-c`9qG;A~xp@pO
znvGSl;Pygyg3@A~w$rUI+OQ&o`C21r6Jnr$cDPfbv-uuV<o)B--m9aNU%EdZ9c-WO
zAMABcPY=StHtNJ+0DdRv*<vW;pD*%JziF@*{s@9$3k&m~(*eU=-~H}Ee<vOEERAx`
zrG|^DmWr2QMO;o<>H?5He$PSf9PUp<2+cq_J2C?s$0=Be!RP3%obK)Ov^RD8qHaLm
z>Y)vd69OPbW=g<MS=S^SlhN}nydQU+?Rasp{jv))s%!<{RyA@);R4kLGA=&gi^_oa
zEz?6qO-ICfa|g^alPG#A44A8I^yPzPSDhyp2=lSil(M|?p{gh)SHo_U6;$rdQ9+7M
z5>8m#FqNs5+QXg%imbi?B5yCbinfpy0ku6*7WUPoQ@Dy*=0P)5xoXy1r(|p{i5n_i
z86878JEJ5C`UU(6f``*U&H?NzmYJ>Z2rl1^M~^%_bZ`k?tpL=p<mUFM&q}7-V$#;4
zqy(v}Q^J;S;Q}^n;?PKu4)7S&O&a*Eqr;aXl5$43TIv!?x%lIS9AkBZW<$d~99EVw
zY81b|Ta8-cwa>f=t%X&EAx5maMCAqIO&ich?YET8KO?pC*{t^=qjDGajgg?-PNX57
zEs_jI4%HMEM>w&Wd$3&4e(+gfN~Dl9KlmJUa`$d1^W%!%eqe67{w<C9l!k64A2iJ^
zZRa_TVoLX5duPCvb?!NmwL##$LkaDK17v2=0=|SXNsK87s`6L}LwH=ogf6Tm$barG
zlodQgkue|5;*sN3xOsqzRC)2x2M;`D+2SdTi!x_r?jb2;fmsm0H&fr7inO~^j3Rw7
zfT+s)uq)X06(9jwHH;ZZu#w>w!b=IYQI0Bnr-hkN<?v#bgPJ|A0gB8Uqid3KjGVpj
z=EP|Ks0R*E|3gw<=I2wBsVvxDmCSjTqAK_xJ_nxRi@Ep6BszGXpm{^!juo@fw*YIk
zhfBquwU@x@imh9WDU}a_xS~#jV0G`qz4bQ#5zqM`0x|W!_O7+ubO-scvfgS{2T*J@
zvy06nibDd5L$1PQx1_oqE9)_sd{|kjP6uI&dq=xucE}OJ$efBMEl%aslKqNpG|Ozj
zYh01jN-v%CJ@lmOT&ZH57}oFKn%T3@!3Tr>Ylf`(y|!>jjxV##BHQQU2jj+iJ4AyI
zpS|rhSKBE|9h1!P(bnF_fiE^+pQrdjiT&Ea-DSg#J4KO@{Px`{NyH<FrXIP4qMQyq
z>8M#12qpzOHG`y&a@p`2c=*vYEkQ&$fxSm_z^2>5c#;h%iA++A0S7c(=WLMb|M{#t
zsyihPwqK&w$KM<x{P_M^jg>bfZQhlDePZPdzt89q)Pfk^X0}lWiNoJp4>le;hD!tI
z8-9Tqj-Je!lHWc|YvQ&SuFRL+^`$7h$mZ)=0=}Mwl+Clq`!^3rzxhIJ`XJw7@!yus
zD#2xuz7yRMi3l4HC4mZAL(yMwEGnc7R&J2cagjH@eMg+b+>ryW5{uQ0dKp{)R^%+H
z0a5ZTY4+XmYyy{m=IFZ0@gQgR5++U4B}QR-Rq(f^^@Nn)`eSZKzrWJo`u<)BMDyUD
zX_6eI<lx_%FhBWQa&YvryOSipE!GRIjJ_a~%b>VO$!3%HSS7?9gsGRs+^h8y5xpUs
zC%$u~npGnRO42`*&@RQeg0qY!ZHhu$J1UN*z9*7z*tmeeril{>sr(EXOOZ>bysStw
z;OQhCeW2X4A6Pd}Q!B{jr7hgEktV5xwJ}v;$U{12>n$5y#wkiVBZ<2(n$3=|Bs3r;
z(2<=){<IRb!DYkngN9i*?O20cS*^vNi=H5CUyt%n;wz%QOFD#ronD$0gJS0y0^5rT
zh720BVWUU7Tgt(AHIaHRY#wXb{E3VT*pY62j(#<RkF4s=jR1ps6=MURu=2&-Pil<)
zP<s^5xwXk^lwGm(&XXe@19Bx;M6m4v&Up2tXE`}|Q7)JPM$E9OXqXwtAie0hHWdix
zC0>B(ReCMXN`NwED5?mtchcQI+&}I9ynV2$_B;0s01RcXM32wD9DHJMOG*YTY)IH2
z8Ie#2V){@;0hyyz+v4k3BJ;w2ngC+}1hp{C5dpNNS`@Mc(6%6+_A)kavLs>lg^f`H
zFWrmX*@WYPq*>clSu&!<$byR*gnH;fEM`ak7+UyJ2v9-sV}m}!bvn)z+#P;jL9DZD
zR3EMW(GEPi5ISM@P)P+@PPpv2sG*jeT;=)3kz>lKJlSZEx@77LHhY#+Y>H4fq70P(
z>tOd3o#osW6A>h%@3|-%@G1)~%c`>jG<um$QRlcndc{+ZI`fFW2vZy3DEA+)p$E_7
zM~@yns`KNZ`8nq3b|OA8>e+$1F3-DzhBuCu*&rPwab)sDAhbQgr9s+WV%5))YBUG^
zsfR@xjix)KBvHv8Lkpb@a&$<SZDI{|X-FSi$<iL)C<RO;4nqXs9?!QKm_qu~xVOj%
z=DZb!zgtZf8a><MPPE=_akT>f_EJvJKH$@P@K*QZz#c{Ma!?AD>d|DpGn(4cgO?s(
zI-&|pDz}A~<=~pzV_`1x1uMBqu9x;}6(p-EB`zV$_|#}GF%AA-yHi{~OmiP**3?Hb
ztTBk4V{TlY$rkB24J6=iv5yrqJS9|8kN<ALwcc;G?w@QQ?y`58(+*AGoXJ}|UcreN
z`eMPaEuUiI8~fRs*B#ol*H_o>YwKn8ojRX&fgE<x{!mN|H&11-pvQ4bhgUV4EK8p1
zHi`{P4wcUmaOPZ=-kdjb_;qz>98b|NNSfkWfz*H*O(oqt0_odlwxWP@fWH&vnxX4-
z+Otn%jE3U0c}A6Q<vqa)<;FPMsOadC4`Vt{7lasfxc7=s$PEj+LX<X$BT%Z&cm#BS
zM0(vdfvpa)R&Q3LP}g(dh0})4haPv<6D1k?QlL+zQd{zY;r@jmJ<q3`L`gDny40q|
zphU1X$CAM0?V`(GX+~E}hmEX-m?2CUZJaLowt)HGYkjmAvr|~|>{;^HCy_?xBx=LE
z_7n!>Z8q!zCzKa`s#F%+o#e-mbP}DrU(<TiE!5(4Z<A5k*}3mQj5jpp$7BuqvB%zN
zHt!6+QQlasN^D-=K6-&g=gzYU2X2)E;IK56wtYianwMwE^Y$0_QWPMEq#GgJB5mNR
zkCE)&=;XfSOusk{XLufW)k$)Qil|pKG~6|Z#dL>O*MC)8TN5u;EL-fSs+Rt@C~oZ_
z8(mB<l`r5|UWqJz;<|{!SNjO|LH@*hc!*})<-y3Y-Q(kv><UfM-U#ixgWS<{aGL1m
zU?h_|%sx$<*rbxuwKvEqQ7m<%tzq1s@p6L>LL;{V;2!z2?$Fmqw6D(zybQb7STBc{
z+6uKQw)UT_AT7?RGAq@whCS;Zy?EhH(;c(ym*OO4zlD8m-Ge^>E^w`9Jdci(&DZm?
z)!xE_q!R6l6PbB#c9ISDV-5nB5Sw8&IF|B+ih0Hq4dS%zHrc5C4k)AwGoxgud-Qj{
z5tz><>U^ZEJo&eYdq(k5d*W^e`7jr0!%$~A2o#{z-8(sP9V<;E^a<2r8hwtjgd3ca
zI)BVjlm-yOMS!v?RyE;;kq0+Nh1fuv3_}qqJUE?P%vi52ej^+*vIC+uDiq{WO()Wi
z*!g&XD~1D1*9C-8^(>M0YKhQ+6<O(!C=H5elni*LSE%=E9-Cp#3aoGmHw}-1bOGVs
zGD84Mf(#)JLif8Fz}-&dk%h+4xx4R>y1B#07ua$Zh{T9i7#*D$O6zd1nQSXVx_7c>
zL&r2utV9bi=gX!%$UbJeCzr$%u-EW}lstTd)^Hx{?0mqb3`&1}l?llFgxMZ2+*gxV
z98CKxS+741mA+_^pNkduzms4N6AIr!B4z5K5FXmX+=4##0q<x#0U-=4s1me->jb*(
zYJrC~{R<b%fAQx+`q2(dtWrHG;1XrLVyT73X5J|p3y2wFib_0~dR{oF99++<c)24}
z_g=!u5tX((+sDRa;LhHu^&M0tQ({lxY6;k&x%;(U<(teUO*owA-75>xY{n`x6KuWk
zEAF6MeCVcSih{`Zp<@STS@l-%)No^_jU$-&{oTErd@ma+Q$?(?%Q#_=Z33?3;jZC<
z0O2eNG1rdnR8OgZ!zFp}r{^Is9Sn0Amif$%mTR<qHqGD9OgG3V>f;sDH!+|FPn~_4
zpmxP0p@5@ypD^mfJr(+}vR5I~!iULs=!hDUOv5If!j@UmeSH$&a_UfchZ-EH+4=C8
za#&~d-u3`tW)?xix}gNpm&FyA|CY`j&r95M4_}z72*%KOD-o=>+rvbyWyqWJrF*oo
z)0UDvY2y(vvjCv7eztlh=nj74IUlmBKOH$N6IUN|?59KaNTecfRsw)42W7uvx++mN
zOixI@#p*;$rA9(wPIhsFBON&Dk!3D6v_|s#mv$!Ygm@nEt!(oxd1WlUupP4tv(M?&
z>c)tV1VEeXgu+L*jmtmY2L;NwLs!KUISaB*^gCuh1&d8S7XE9N_dX0P!EkOJIpa6b
zY}4|dPHirFDi!$SX%9wedDO?jvB;#KMQ~h053In60{1ahS{8GH@<0vqS%a)GXBj*^
zQ~eT<aM4EqYeuCJheJR-K!w3Ivub65O8(V^g;rATlw&cx0eu=#`Gv9gZCn;yK*or{
zy=yFt08#`{5;lK1(=i!RXkt2)xYQX>FT!R#Ez~J#&OuNbmh8VIk;geXl$kgU0K~~`
zL}odnvrelJU`<0a#g{+L_HbDTxT@t$|7?3c@NG%^%mOH;J5aQj)XwHRKjX8h86y97
zzIO{kRkI9iZ6$j@@9&&;PhKA$?jOE%(3Z~3hb$Y*(qMwlVZs`2{3VEKE6D3&22@RV
z&~}*;ua8x|#cc;Kw)YRH3&YP)Z|ni2PPx{rY|eH#2*178Jv@4Kbh4*NZSJ6ax`a`5
z=VT}mkeJ<5=3k435FIuzHOR^s?fk}TZey*If|Ii%O8FrlkLkMr#X2yd)8aVXp`e`a
z3ZBhLW-7RiP{%mQ$K<AfdM~uY8uT}?UIBtQ(aRTZcv6&--bj-lT{-ZzN{GQMC2d+C
zy9L%zA9D{C5(g7}er?k40qZq@+p*Nu=NBWooAjLO<dEAFXMK2Ck{nGo6wHT|XXR>S
zV%+YsfUkh-l!rKAmpIBUkJYWG#_HeB2Za%LoO1NIqpx)~jyDTQ8BI21N{^3zrsPc0
z9~U7c!>X9%NDaf02IQ$=lqvkB_M_n<2o;NWl2*j&)}WvV9#S2%{^=N3bIK@Tl)C%p
z^cd@3hY<0~MN%F~^<6+oP`m+1JClvl9$L(sYb)z(Yb_2)C#9?0xejvsYF?K{9$?$o
zrKuswo48$~BVpCyT)*s^(VuOZim<o+6s~KWxT}9$@FSP!Mi^1)zLb(yT}(2{F(o4Y
z>guDlwOQ$Uk_m(#t<4V5!{EjtRZn-TS<=eFS*}0212Q|XbJGcB$1;;`OMxQs3{H6m
z5#9dx28GjO_^I^0we`2ZC6V>`Cd^h7*1ft$%B-vA`s(_l_5w=<3bhVjwOZbqWq{Y}
z^Zz7CT;|T)4G49@Kg=595PMP&d76Nn<2r%>gFt-0%n&Z`peVe5PRtY%c;|H+t0AF#
zw#pIO{n@p>C5f;$!<(iLq`EKx-TU}zT)-wEd9X!{NDI;LXCr2l90vfjD67Ea%!r&-
zSZ}Jl6kbx7ShjQI2LW^X9H(wGh%z~4E&?{`G9ea-MFy($!GeJ4#DkJ*YDtn9v4$({
zBVi<#?zuR6vL*}lU~L9QK16Zc3%0?vr`QYZPd{Pv3aONFLsuLRE&>pFzX(n4p?oqM
zp|Tat@*gwtz;aj(qvO3O(g7=~1DoB{Pxqvn=zKb35Up^qA90H=4=Y?{!pI`{#Gx&z
zh)%>!vL6jG#~NiV7S<4^jMK=mGL=X72repyd6nQFnc>BWTjoniJ+xryAnbAtafwl|
zFy@&sv+SulIr3IUfepu=l>H*!7~}DkJ@)LL_GaYxJN1#uK4ra``tV^vFu2G{K2Hv}
z#~Z2I)3#~oE`upkl8dKP>IlPpn9UTpFBE3oRF%Y&Nu@Hwsq$~dk*eV#CK#SBG2G3W
zj4_AED7hU9)9iO>PN~=-@WwY}iliu9o#hVQ4hcBn48smh$jXxCm36DJGZCvR+`h|8
zk`!Ibbz1H~0jGDR<bI&^#g4(RR&}fT4s2uv9ehJQkgzUV>``_>Rpg9jhB5+S5h6Ho
zBlMs(*M>X^yX|L#X?i;gq_!1g+j927VGpYM?z`SnDG$J1yWTd3w199WdUOBA41v06
zgx%p$mp;WjJn=qh-l{Wp^<AnGB5ahtVb9O<era_iab}GqfG*))cZT4Ma&fX2v$KpF
zyg|HM9VAw-icvl-CQW%}J}WTQ>Cjg@On7_5dxJi2-t`*j=MuMO2Y<@Jfy|NEeerav
zCU)L2Fo#?#HX3E0rrrLTuUN$x5p?2+rHjCi@SXL1=Y4|fYxgW!?w|Ql?C=Es_vXm<
z`60c{Y7p^nu`u7?e)Dv}w~y>Jp9hhZa}yTe!K!3xb3bR>yn$$aP?(RSWH;%OXtaeT
za`CUAXZ*#SGKT2*jGWM51va;LS>!;ES+zwn7*bX2E)spkG0lbe{6=$YNOm7h9AL84
z#5&`A8@tb=!9$c#A?Jh&IpDQySpRG^8^RMmuY&s{j5V$AIY{ocLIm8pMXdPt!NK46
ze(AK5AEW)*(N~^P-<$NONVV}fAYwOV5AhrFQlLBoRJglRh}-?e^K5WBjkcLZo3<ko
z8Kpl5kM3;=7RB2AUU^!5LRYKputiGI52}_niJ4fbRTFafvLFNX6-Kd<JV_2?s73H%
zTD^Y4ZU}Qe(3R#yA3jManHXTxhn1B&$eM_?FmkmT{_6ge=s7V&Oap5Nxjov|qk^B4
z!eIVecPj9|hz@g6*I9TC#?(eg-fk*#D86_$aq#*ER|>}S^JGPl27lr1e;<Z~wQ6VV
z#WBvEwI6ckU!bveHeXZSYQ^;xJLEdQZDO8hlVqItKCD{bA&vovuK`15E=aE^nIV*k
zqSRlP8F2%8{^mlkpUp#7%R7V_X==Y9D)M>wh!h1EwYs{Rpi>>C@#4&5H7mG@(A7nY
zek_0j!&Sb5F4e_Qv!fx^(?@c|oq=zcXF^Cp7rnKQUWE(|{cgwAa7T5FjcSUGdM8a}
zArx;D%?gLK*Pqog#}w{9*BE7urWKBJNx00V<YPL?MQ0p#;XD6+%*&iZr+1%M6BT?G
z-++mmn)mL>Tw2K;|FcT_fX8?rX>kL8F=uDzu^5Z87jzIkmSQePVdyp-$P?ORI+pld
z{f)QyF?R092&kw<{E#np_FhOO^@-zWLnWX%s<D!gNG2ZwBiPicB!fS84u`Mtzgr1a
zfX_M<4$jGmwD-0IP3vG`<ng2!10|Yfd$fhk{#lzl)kI^1^w(>=Qo8tuQ5*-oFn{kl
zKUG`>SuQ-ghUG2qQcB2X3l0wleYro>&2rXCRRmEUcS^!DxOSC<l8pluMY@WxD{Q^H
zcYsPP^}80c7zqg=8+@pSvt3H6PQR-wn+y-B5N)y-`G=DI6?vyEQQQ*&AVP>}Jzj!g
zR;W@=T)aA`5}Q|yL(qg>b+GscISO`mFtbrQz(@shrOisz(ZSNP5#2WgdlcQ$!7Hl&
zlJ()N+%$j!?Z|ZyGcG-%1?8<J%Q){*S)rU)8GF<^(W<Tk>)Ewo9ViC8LQP4tgmlbm
z73R5#=r5-E2$fjDC$9B1j`|TQyj@<8dV<yF1O*+NqSyYXotwXuiSCX13$8()Zuk2g
zN*}j>en>~9+0YMH0HBTb4c#!%S8fe;s|EsD&d~|#Pj!HB^L9likNk<7pNN`;$ja$H
z>!5@Rtn+J3n}`@ht{%<9qtpEtzp&D7Z?~N^WVl9^=NGC+*O~F=u#o6YPO@`y5Nbw8
zw@O)DMg^lBo$VbAZQQE41eMuwsGKSgN!d|KaOqio0U|{)ySO9{XqaACx<V}p=|{@3
zq~ip}hdlB~(I=tdDd*iAI%@Y=Pq2$QQYSL487F)3FF40QPn`{OS3r|`SzW4_De!Nl
zR0QIAIJvrr?A2v)(J+<s!K}RO&_CQT532?ZV0ws|_K`B7G*V8BvE!m7ag<INy122&
zrk*C}`6tw^k0;rRNg5wscB_7}ysLOunj4uirD}i}2I+BCsOjZ|DteG*MAJb>H;0@K
z+9F(1h+QEeyyEdWz@Dy6>>&bSil)eEtT$Cu+d$riInWJVDrJU|)gxh#E|5#BkUNJ*
zA-T4S=4+r}L0T(bow1H&Kios1X{Bm&2;EG^=crz)<_4lX{{L9>!aOl^j?ft4GGn;Q
z`Mk-X$(!nN2q4x>257!lOR;NSi~;j9Es;MV^QIsKTL&?xq*}f`%LS%+m>Lfmzc)n|
zU$sjV2mT1@O*J!_LR@SNugj)yUr3(Sm_h1*e*ZqDYatU~#QuVg#Y7Z6zXkFi>D8jc
z_fe0xdD~v+BDY?zUPv=e?@a-gba@H-W^hv0=If~N7rH;TNvFgATdTN=J-w|66w`fN
z6c`Hu*g#~1RIiSql>EO}{k(bK+5d&clyseBfL!xdxCUd&O`?fLm8zL^0BpyX&W&BM
zS+j{h2Bzdq*E(pHzzM9_-<~^kEtR3ak3V}e(HUlfoSO1Ap2w@_k78lDTybYeO&%0x
zC&ZOTiJXv9=uwQyN$U1Sj=XSA(b0h}-g7wga75o1XC-UxSdP*2oKK1E^A9e`u6c3H
zY{kFBr$^_f*W;}DeE+C>u>C)O>ApDG+p7e1&Oi>$#?6}ZT;;;QoC*g<W!%ylBo_3e
z|5Vv+pFLiHyC(1GM%({R48=St^78x7uBiHd)~{0kw>QYU=(tjhRxiKO81w7@u02@a
zco5Y8eZ2nY!MFOqf5uNMhj+U>2m3omuU;J;I%UKCr%pY@%bXC0N+M2yN?{jbEC&SY
zbPhliI0tdc_;{aaNus24xKCFN5*j6dy-V1G<#HtUT=aF^rf6a=shd%K_nNPIAec_3
z=EGeI(<V&{OJfuA-@^`jw!=~)wlJH}+<yD{#B|;HkdH;qcKgC?Ql|8;7n+EE@m*}$
zr6$*QbsUQCc7p!KGmH_R^1soevu<YYdXFdhM{G|D`h0M!j!ZEE>W2csL0-tmmz1FZ
zuPyzonT|m&rG)<j66c<7C8r0SkL#-&Ew|5Q`Mj*_7xOt~<xRbF*AL=dQx8DuJxt>o
zd2cXd5r&R&DI>zsPS%@EvYlcy%7i%u08v1SAaS=W2Ou;edkq&0Rk}GBmqEC;^8tzZ
z6tM%-f}4Ge{!yzYY#3(|4AG>1;onoVt1ScD=p73FPn(N7$yO|96LS2iE<$EW)5e0x
z@cb+XX@5epXP=$w$q(PHBQnk}F0Rqq&Z%cXrU4Gg?TXzaS#2;*$z#}AURx90P$g{6
z%$Q9uae#)imIYcI(JQxCtPqpKFjA*Siu|9z<y`=aa(#aw>6OZvQ{c}4%s3F^DCd-~
zvcv*(CA)i)7KD`uDW)`{)q=!JY2heDN4zG7l2{epX(u1t#SN~d9xMSkr;0z5^h%Yl
zz~IpsY2t33iLMq|pEyor8);NYAxN2TxR)jd_n>2=gv2Yni*ZKru_KVMFiViAc%_sx
zff{q<3<f;MQXCHfX=tj5SP_(Rum{FB(dh7Zmy@AJkm(4p91szGq|XrTaf{*4-sE~b
zEm~SgA}>?jl>o>0p#kZG{(^k!IUaEDj=&H8v#+#ozgzq&{NL&Ypa2CLeYG)e;Q!Xv
z9&H5t-=oKm*1z$8f5vZl^`h5Lzr+8G3i?m+@jK@2Fh$IF1NisK<#agscC7!e{8i<@
zNv|A(=)KzeYGcel{~H@?YY!{ufBo^d^Z#f3?i1g&Q;e^rPWnzO*;reDki1HPf!gj%
zMY$t*D~=dv*P96-$>WEsz2s+Lb&#cAUwuf)xp%W3e;s_z_C}VFsIJnhbUIBs(-h>%
z{QNw5I)s1!+eJnxqk)5bCJ`<x;`RaJ+sV%3hbxqf0XhQi2{Zh1Xb(2y0()YXmpC1*
zMTV$Ng90a*0`CTM4twYF;_@8~1rNrv>3!BJg^fYFDuxo|%<PgR+owWX9}7xUXi`G@
zZBQA;kw(S&^eW|8BuN+EPnObhB`=rS#7U!8GaaGZ-x%W>DV_%%uPM0?d<wkn^qRx8
zu)xblt_L9|9FzdzgEKS{43Nc3H6jnY?59I?V}O3rNnV<ARrnzXxUs5L=ZFdBQS+(R
zMe^-PDZ?;I5~FJ@iU@zP_m{gk9Z+(=qr#n42stHE91gPyCf7(v{uA_&P#~0cNMx9b
zg9*^7=_Eg!Q6g372o<xKm7|<-MoX>pQlOB;&LsE&2mfs164p7_YeBeNStW;`bCg;F
zOPyp0cgo@VB)KkT<~=JodxJEWV!inCYEp=kP9aCdf)Aw#Y*T>`_e3G8Qd65_;(A!Z
zX^{0Vq~;QPw{nZ5U-V|SZ2Ogo7Q-Kw7shlY5|F3a*)R)=RG&>YR+DW6EM^rhW@u0r
z)Gtl^{TP;pg7^^5Feh6^bvEyd10){Ohg3p2Gt`5p3JUn<fn;<<*Mc7BfD)kV0Yjvb
zDH2{H2FY9v5=h+xkIq0}_{YDcgV}JDulBH$-sNi6pRwp?)K?92$z3)`N_v6khV}su
zzZP9CnReJZu=?5KhXat@23Z#mcN3nTj~+iv=)dg*llVS<*q!pnZ~yx4?Z%_W?@Yo`
zeG9E^)V}%?;qWD&8q6F5aKv1_*HiR)qjasAiM?i5NQ~rRcgRulG=YKOkD98KBq@G`
z#v`k+=P9nedpmkZ{%){<=2|<s`>~y9uHN6PlN_-k4?#6Gbme?T)kjJ=$Jxr+^~ztB
z{@!xFFbQbjOw7*Kbn$_#ehF5l`s)*{!Bt6h>34$vyqm0jIzNAx{6~TtM%i5h^9VQp
zV1ZFh5cT_aJ|e6?t{?*3f(|0AKc0sO^!Cp}gu1;R{ol3Mc6Y-qfBN(@x17}1NF}A1
zA7!B=Y5^?C87g#&31_S@$xkqYf<5b#?BidX=3kWk<}dlVmPc=PyDtx4?{vEu$L2hQ
z8)kF?PhC4#w~HFdX+G+nl~?Kb@xvzO!ugAFgENB+H3kvu3+^AD!o!^=f@5vX{+~dD
zd;puNf!YuzlEA;|FNE5Ycvsj7b`$Gp{c)_P^~avoj#@t0fHo<<eX#LF^h$2EXg981
zqOuEeqA4tI#T(-zDRD9*w$z^G7c1B?UaphgWe)cOVsMPILsOrudo&&2Mvt?tB+fC-
zNEH$pQVJMcl5+^-QBYgmSPkMg3{Js}?A9dK1F}|kKo&iT2?MF?9|*$R;Bh3$Z<Q+g
zKm?NL(ZfFrh(2}xuMb48UT_Lr(P%{rs}gPxF{jCRpcDulxJ||GRKO)@PC8`|(}f2e
zWh(ASuWk8Pvdp;-mg$gb6*GQE@%NOJ&%C9KQje)@lTcuZ{l~IQIz2q6PrlP)2g>$%
z2yV%u?3ITYZI54?=dZ&V##}u(>cGP+@2oASXs0byl-r9}XOHEYKp4Z?w32O@@=IKa
zOANB-e_f%A80Zf5DQS`w`6Ox^Yp3143)B!7FrH4j(-sYTH~FC&t-%2F0H8P7fADk>
z(dKh7FrZc=wAVN}k#bc`CpSae>`_w|@qG&uE3ofdbsf*P@Luqz`yX4$vfaC7THKR)
z3;H2o!-Bo^+CGk7<MTdwWIy4nXMt}X+HW=<F8Iv@`^|%m1;5#_-#lDf@SAn#n?+$D
zoGyF<N5^gk;oZG0y~YJu&;|XkA-?D-uywiwPdNVKEaPlD64UY5Rux(Pc(m5?1jwwx
zBbSf%sD9JDsi!RZ;s0xt#W`K|I}z~9e<Fb~bOkTmTa%gQNLGT2YgPzJYXRZ|U3i};
zNEYki5zXPYlxTEoIyAa96&l@|290h@fkyx3>Ce|e{(ubK#JgprU5_$uRye6}ZFRg8
zeA29!Ndm6Pp<s1n?)HR@VN1L%{3($7d<tdP;E3>#9y>d<_|AL<&c&O~JhsI)TwjQ1
zvF$e&V_5754;JHA><14QV^!=2j~3%o><5n*V^Zt~KYSU7GVhpwO$;(l#Rj{j2GaHk
zy0dRmK6Z?{!I~9tMVB10BLQR)HA8aDPUzRk*`)Z8jZ6W!fOFAv9T$^*o&}`ZuYR=Y
zwL?2tDF!3`8K+)1t@-G2vI09ak38SVC4M#T!k=T5wXhSe<qv#1aclO%CmT2N7CzCq
zk+JYe#*JKsPcUv|DSUEqBR}C0i_d2!7AF;7747OMhf{zLxdE(YG&_I0wz`U4tiNN|
zNl|C=rR^lzc6bLI#Ig@FdOc3Ds35Q#p2eGj(Am^X=@QTnluf%=MKUR7(|iQ12)n&f
zu%slZC-O!1W{OQCV{)i6jc_C*%5rEA(-$%%NtAH82Y21i@Vwk)YSy|tN`9<rnP@s~
z9-Txv?6z+3&4AO2eq1MfI)JDee*&rV&jW-Jia!$&d^Obr0y7m^Wjvy|i;H9|agb<5
zy{)I1B6lQ}`T|8f19FZoe!hLx1<icqu<Bt}4OgHM;6vE{Nkjo&nS7`N|I*1<b=x;i
z-cif@lmE~5LHhRl&-+#U|0e0Duju+mzq$T@8yk-vRQ!J*K7Q~m{_9WqA#aj?N>)~q
z?PQYn^H0eX173ro=@On{-TgN3iyx8~+1X@<ktiE$>wl9*jxS-4d<lP8!ME+ClMX(n
z7;y!Ejn4ByJ{}jz({wb=C)uya)m#kIe30}DtdTK%Mn#e_V>b3h1#d9&%1MRo`U2Tl
zm65s%;ghp`gtNnt-IBfPD9D+;>$p^obxdq?y$tkoo1#Ex-15lD%l9oanJzexY?w_=
z0n5tVsL+K>s)u!6hf-!Q70<5p3^QBx4BXf=s;$Kg$z==!ra1Yy9hfs_JF|jO$t{hm
zIY+0Gk6fVWRM@vHi_J!7A(Q&7*@z39cIA7p!H4(JXOi-B3^7ayxCqB7l6H;qU3k7<
zvcAJCm&6`fGQz}7Fe@%PFe>a*+5!w?!c?EsM={}YVP}~s0!FaLXrq3C*5!f{7!1*^
zPh9ViU7qA0)h*5U9(0h3m^SrP9ZzyZIS%z<>>@8plXw27{Z7(3dU5(@`(!VHzmHFj
ze%{~R+fAPT0x$QHoulJlPWE5^bejBhbg;X3(n+=tcj4*b>B;`{*QZDDpt0S7FR5w*
zzS}<hCE5GO@yTANlN_BS`>&1<_Mtx*;AH#obbqhYPWBIX4qor>AHHlS&_{B3bebIO
zzuG^AW~WDO9GAkeDqki?FOpY#Cp$mEKewOnAMBt0LPNgTKRv|ZUch+U$?^8d>Hf~^
zgYA>#`1Q&0QHOfN_3iF=b`G}pU+wL#!W>}SWbfy_!_%bm)AqqZu-v0JhkGZu0B^0&
zsjq|m?dJ!3JRGcccmHH>=M<M^|Jnf{!XyuX@Eq^$?BgGM|JZ{SZJ+$ohHi;g9UXS|
z{>N)*2k(>J?N{3`VU5ijpaVO!^ZI1(6;Ax<1@_Z<{k(I!fBO1#FL`-%v`b*`?4A6)
zzq8kQk{ld$2ym}Edu<rxbQ_1qUI1$F8vcI%y0ee)BcLCi?wy>xKBk1|u;*_8LI8tp
zEP+L^K02f|1F()xe!+eb7_=4b<jqfe@ErF1P?mRkvW?*A004JR-Ig#a!1L5uY;w5w
z@?ihv-r>$3zCFT@-t2ewTD*Dt9c;7DgTL8^kzeETY13eC{HKG<ZQ9yo|3$LB`}00d
zo*REhb%i>eeL)|1+IhY6lR$qpaMgTTPWyxW3<HhbXPA=Df0k0AoUmO#FZ@T@WHJgK
z0nNGeo-~jLLeEeQjy~D`NB0#V=+RD>p|xisq^qy!^DZa!!d}Fq$#x&<%{V(zMH4AG
zXzYKQQ0fA%T6DW+ziZBHM<I!n6cLHvM=a%y00wfGy7&1A?wwW6hrzX~z1qPT@tHKx
z3-=tO1RDuJ$-gJrgIN7~jY}4MO%pJlDI$c@JW4CoEdxjni|GrBLEK8HXv1;~0ks07
zuF$9}vfKs-F0S10OLnuf*~JA;>4t`gPc#b{jy~#K7FSsKyy=Ee4$F&nLes=b>>56K
zimU0HkxT->VsyVa$AZ+9u_+&z5MkWh-M#0pUv^)0UcwF2n-qy$SCoUyf1j7???*`-
zrN$UCWHw}!o%%COzd}iaWP9zTsFb&OzoXxBAM<N-@!2+33?)24-yaOt<s?41N#9Wh
zGVMeb<l;p(l4L4Q-EQoroKYQcrv?x8WoDdUnH<h33%!ey%CB3Ve(GdX+KX4^MYBbS
z0*6h{ngNhGW;D_B=IZKdt6ouZ^Y5P|9#h5{!37u}r0*~65PxvbkEZ9%#+`B#|9^k;
zpVLM=>2_aWGTtu!h0Eu^4uIHqyR9dSblC0wyxrYCdD*G?VDTBAQ-Zf95Jf<a&+5zR
z@b~Zhy+H!g#4|K%RnHke7dO?&mezJ<h^JqKZ%|xtQ^x)Ly!Kf6Ub)l6*>+K}XmUXA
z&m3@M>G%Nj+llIKhk8u<*T7X`kz6df`uv)Y63-2qUAteeCV=WDDKfdOQl)fYQCXXY
zjPttGVw#};o*#1%oE0i9J1Wp<z&ay;Mf6HFa`hw;JDp;!cs-Kk93raKrp!ltNs)+%
zi-IRWkA!-c=C<mkW1=4@`~Yd}X~;bB&PpKY^A#<q+fOj8i84S4gp<oG9kai0nq1_V
zj%_p>o@EoM!e!GpnY3%1=r(f88F@>k7fE}7_*P1_DVXn7I{2Uz%aw?ozKnEC89cCC
zhg{?ODSd?A)9J_jLVa4PtJxS!Akdv~(=E5~PjegW`!3N0--v6vK`newLH%ZTm!~EV
z+_YSI#v8n)e?uQ#0{Rovg7?4_lEFvA^piftli4}l-uXNJFGvMlV547kY}29`^0$n$
z$3UXc6$(Gc6I<A2w1vCC`lWD*l(QZhNZN3m3X=oOshjRESPnle5y$Y>tBUyXbmEqh
zau&DcEi0^I?!c)EsL(^$1*+u~sV;PJE}YS_JKFL_B#)OjWL;UAoA)nl&ASoFs7HJ=
zCjB}*dbRhe`rg*vbf5b9?O=0y<7+$hb~vYYJrG=v=~!|+-oWKic17S6*aA@?;MyT?
z31-{hd?^2+aC5g&Clor6YddrDmba1(HBEY*yftWz-syny!AaJP!C~pt<6>+MrU@67
zgXwd3a!M(+kEzvY%Tx3GFu}MarHzoLWph@Gag;Pw&gYt`?q<twm<DR4l@>8rL@c!o
zb6T({040x(eQ5%9HIq7u6tkgbhne2IzAXFj`3tOH&&s-4(F@LCXx200l8#)iq0cw0
zEuVSQWr4lToiLB`eT)#|k)%p0rd{hsUga}>q#mx*Wq;LMcSUYp2WiG>pX}+9M_-Gw
zf{Y0`LWz?k4Hb##$a|m&O_`*DG~w))h#`T0EOETD_J}%7lboMYmr2+8pzp9>h58SZ
zH(|ez!Q&{4A98?lO8NBRdGb(&Mw$c;h~-C9t>Gb4LtYQ$bBeTQ_eDUMzL;#4Z-<RN
z=2<p%@~x!l-)SpN^X}e5s>0#ECFhyogY{Oc0$o*!6q2Bm<aY-E9GA!Hju)Z<MiHH$
z(C4&XFbP)PN|tI)qVM(+E)J!b0~l)u8y!z4%@Hn7UMw%eKSV5QlCgHV1r1usJ$WeY
zcDOLF)NF(vR^+{`TD!9^ngFsE9Ox30yWPE;d@uhT%?1NZvg&~=*+dfY&+l#o+Ic<+
zp%z>33v71tf^kNa!2F*3gs{n3zhZ}Z*{V)c3l~$BF~&!swY;4cfw>3>8Xu@sHSVe;
z&Mv((NFhr?`bc?&CJS>C+s+wP)}9Ivqed%op4`J!1y^Nvo6+5E-7_GV3myYa*>b{R
zyX6*FHY<;oW4+8lq-FmgA__^Zbe78SJY`qt((IfhCJ)9oBjyf#uHqSE7{G)Co&9r4
zbB`Gc`*iLmvyAx$r*bnDUha#Nx0CkmvKaK$fRvVHAsG$`?G%HZ^0-pc>Wb%RQ2Z#6
z5`;l1O~qc?R-*#MKQh)|Xg)SsP@AL)UQRYJ)n}!Z5;?3l6KuV9aL?Iteb%~H<Aqb%
zUj5>UxptkYn9=WT`Q+h=ONx?Z0*xnt7{YD)<wnZ+R=5v*tw?3WKYfU(Rej2696T0i
z`RkI=u!Zsn0YbvuB{c}OMDt$#Ub`Hst<ua)s_wh)xmQzIpGT!Ne9>|MM(t|hh3f8S
za6U3E`sP05YsttE^cZhi9#=7Ot-a<Cr;V!OiD9;Ij#gZ#%&H<zsSjiNN#zFyzX(&7
zIna8elLDjx%2hD?ln-(=F4NIex=MAym1VKAJ=1cg?YBRhCp;Ut<9A`KrbTQO=5Y!x
zZ%R`NH)o_3EM;*_hxlG-I|bnpo43|A+(hZYY=XY0TXk1}hsdrtI%@N$_k7B$c&-XV
z0&)OTRfrgR>)zn5!tiFGjO^K6_h|`o?;$#ks)rhXDt9w<#j>;PyP+vlM076(sFe^7
z`lV<LsQ30=`d?{E3u)D0ushdvABkVq!`3%fy{y2{MW&Hu!zu^L2Z=)D^MGJ?jsGnG
zVNi_f03uW3&xCdY!_Q=s89$fxUm7hXCWnuzJ`JCgEcKQgI?HlxNnHu<wKaVy{<k8M
zpk<450FST+6-<OYMo?NNX=izPSyHs-qYq15q>M}6I=&ye3)1Jxv`}*)(hSP<{GC)L
zvunJ<%teyo`RX$7U5aA(d^R9*MN`F$5^4q=q*`BRIg~2UeI&Wa$Pvk?tJR0&$Y>+Y
z3>@9E?ZlF^q?u32{{+B1x-f#5*!H*(5DnAjB)4XwlIRwFYtYPxTc@s1Iy4zyTdOj$
z`DC?i{C1GVqS>NT3mFNi@L7fK!v2v^;1L%;q@?E<Qkh#BPbcm(XT$YSvH70Ql`sjY
z@(>@`TM^umu-Br;QnoC+TKwCU6}lHtfE*Q9lu1m*ZOmyk68U5`d6O*xq-NuOI<=P4
zB2sY2Ac%-B*{E;pBr9(d;%~;bUn-~v7z&$ha$Fc-a??3Xf;5P7B|7>myvC`-mntkw
z>Mp*Y!%<<9qd><xYBPvk{*hYEVNGambD0y~6;^zX?1Z<CWanPowk!yGo)^hq@2@|`
znzccULwQ{S2f~9co70IKYLA1aOp_DL%zDcPaLOLG)!fzA?ntCDG>#91z;p=-@{%fm
z+R1n@<EV^4K!>GjZv-G|8P_fuqm-~$Dx<RT#HfO}I|WoJB?_1IMW>LmR$R!(&|T}z
zhj3`Cs;ZHm^|MBj^)IqYS16`$>OWR67df15V0x2>0zF+Vl3=nTVxB}Tnuwq5VK_Wv
z<5`9o&wB-&)p88-KFQ+<GVCfC`0Y=-C(G~N;?&-~-3F5L?(K8>-(C9OJ^bI_wqO6_
z__yH0I5KIS<jrKAGjHjYfd>><Zm&p#O1MqBOk#+g)2z#G5;zcw4>l-$$`Et0kBDM(
zH(KY6)fckkG6_KuGd|1EtddLanRga{jNXwI@KkvQdu7DX(sJpbEZAcCK&DUjQ5xFJ
zYkwrVnJTD|OrcJ3{occS+QXJ+0oV-S-F!YsfuhM-BHOJ^APC$-W3|!x?7e-v3cq*!
zzd<Jl8Tvn+=a?^_YeQfPDZF<A!s{L@l5on|#DFyC;(qiU9l;gm8wS~@yjNUI(($Ew
z25jq2OPN!Kr*@ReXpLTjMx0GpF+VO!lOldA*>JR2SO84e19LF#(RNDwp?(6oVH!&5
zi?CBlUW9)<)q9Tq=_fG~?iNYaTX^{{d6x8AZv847t$$ctQ8hf-ymmqrdINz)(caQb
zoiQ;ssg`#o*9%K{*d3U9P#X&-)<-{DlE|h8E8oa1S)7q2-lXS;Yx4u^3q$-{1eshk
z@`wflIEbMwF(PWYUrwF7&sDcM;(~>ANx_KCrq>q=2+Zcx3PmtX{5!sX=Lu7|K~4C+
zjT4Twvzxo))E#b=m-#umGwEfAZe<v{buEY3DJid2nuF`r+C2ar(fz^L8U&&B&NMn-
zJ&oECk-uCmbEM9dE?w0y-(r_3UffE++TxSJ{b<Hipm|s6b(u8Q8(NpqJEr90V)HI~
zBO4U9wj3i(HJP>`-)KDK<i0#hOC}Ai@X|D;ErowEGnX<OI_F=rNkMf}guw~>*_Jw&
zSL{WD2jPPrJ=(<iyQkgICI*Hj-M3|}q?wMG+bPbd$cL|P)SiS<(Yw>(jEqz?EwjP-
zYM@);$!;mzzM{PUN~qOTe8mEVY2L5wq198<oe9D$Th*9==gO-KqT*(qWz#Dx<hXRk
zvei<5$w*;KKoXs5_9SY-H!kxB*Gu-vkm;(e#SlI3#0YdvM|$xP7lhEm>%oz^!;L>J
zm~~SkEUEE=J+xPeSw6qiZqQi^A+MS#`BE8QVW256q)n_C5#5CetV2|5xiUcmB93wq
z-BXdyk*i#jqgp$h*A=a~xek>K!U*@gwVJjrb#$#NA{#<aEeG*lX<2&LWJJcv?0l+t
z;DWnkI;SOHlB07f0wdHZlQMyd9ev8M%{Q8Hra;Yx7NwywhAJ0u7VcGG)htS;Q|2oe
zAMxn*L7vS=sY|-d<dySKpK{|uZ1^8$RkBZ1r_Y%X5?pj(#9BZcmu_hoo17_2hR3_B
zWHZUCY^TGQQ`En1Tq}{HKP(&<#RtO!>5ZSx#Yo1#DqhaVNGg7d_!7CpgR8jCgj&6e
z4HCw24pA+_bun#VJ+RV;IdUg)Q7Uzs>lD3Kkn0~-@Rt)o#>j-JQq7TJdNB*NrX6g1
z+_Nxc9>-d{H>>@3Z?n(Z8=qQ4kNP@6*geDE-GLk^UfHGShpqaP(qLlf7?Dy>p$7}R
z$m-e4-e;`mrmuJAO0@S?iDlXMt)v%Mi+u*>23kEbIbtW)FMtuc9*sqRZ9i|{Wfg~f
z!wMm3Y;=ce9F)gad#Ep{E8lLYitkf(FHlvtaIu=~-r*3m;(}-AEii-da>erP>C00>
z8z5b5#KV~hsk0X@aZOrPP1GnrLwi$F80t-pPRz`o&?tzNG)EL9NEtcZB-a(Lu7+O6
z(`%!%a!ljGn4Hskl%$Wt7}`_UZI6h7nnhCw-QB9?<Zwe%<9j0j4ImM@myIN&{}`1?
za>LNOP2^_LsR$Wa18DZV{*JFdTr+#*NWZWPqiiCuWlpXJZh@+LM>-&-XuZ06xpXr-
zR&>`@4K>@VL7GO{uBx%d#@23=u=<nq$<{f$Z%Q3<DMH}=Fx_1lvcbUdk(|z?N<t<Y
zx-f#tW^!kBx%}q{q!^42XyF=M;%2PomLG&+Ri`}VQVfoc_hyaq^5?0P9g~O|Ox73i
zl^FPL5~x_N5SFU6?cU7-eaDsubPT6<S{RK!mSRrTe5xN(d2&Z&*Ga}*Dt=!~GakBD
z+@u;`{yg2di;imhG$@Ps?a^VmDcWT_P~01EI@aV-n{148uY$O*TpjKANdK}&`$IB*
z0C)2M*wBF!d`NOsI{3h<aq{&<ZjkEP6t3SF*%?7@14^_63teJPW!0yD6W4jjabi*h
zs$-i&YAmDM`r_o#%t@Ozg;TfYKI9iJnEs2?A;oLL=QJVG;-X^&04bFi5_@S`^|!G2
zLU=_Bf|H;K%A~2$eqvk{D$Li1`u%FRs-NP^gy?ZWhECGSU$Zfw7>}(JtK@kl$JO9I
zY^yepK|LPiQ<9X4xQwXxma&%NO?Z`;Ssj$LY)u?YD*liqI!h-oRh(zipPBenLIuPO
zSILw*Jl!xahv^iq4Cf+bHh}fQ<X?yxi%?&Q)>_vw_8c7x9N5dIvv(;KT{3OWT%C!w
zJUg&!9EWwXMI4*qbe0rCoZ`zhBqMy-cj;6qIMZ~SYJutPQfbV(W>AFZ@>uNc=T2WQ
zxW-po#w8?UI5?;f*?gF?*>d+BkuHSmq?UPKuAtC|FbeWj6Avv0d-l!5!bnzmPlMWX
zf`{G+EV{Lh+cO?9!RiH2nph2D*f49uIYzt^&PWOjLpO-KG6gLLWKT}Ae_@_ydsLb1
zq>~Fue1U0^2ZoYRuUWsv#z((916Sj~Kr>>^C94uZdTa9f_)FnStGXzQ{`qj2^^s9z
z7Yt49Zx}q9k#SuYx7+|c<~URIB!GR2erO6_%25{r6qjcgl$WB-%sCT_Pxy3HpV=-A
z(3(aSJ<_~(6>gM?XJ7#{9`rt>pwD*l9%Ta98ufAE6T}CoY(*j?giC{45ALToKyaGs
zF1R?8sfXQnkif&qex?RuZ5x5<gk6}AF8TUphrsZX_C%(;PBWL;%-KRju|A@t^0eL|
zbNarvy+B^L`z8`aE}C=h>`!ae&EDL+6fOmL>O6Vsrn@t&FGU774mh)%iy@8nrNb!&
zkjI)=m(1wMdX>$&G|W;M*F`onS>Jn@O?7hc{N6p-p=t>b?fv81_wUe?u6&!n^DJok
z^P{}*llRzO#;SZ0je7&&?|mc*3jRlDi5Ys(g}P1d@c@Gog(}IYQzjQh(f4P(OeC(D
z3{$Esg&;{Md`wu|kA>w546v0WN|g&~uZzib*w+v_>k>H<QvZ=wPWqR$0Gxq{>AlB#
z&w)Jwd@iiFZVBtHdRS8<Rh97f9_CCrn#qQfPD?~V+>Q<v2{&QUPK>d)(tv@UxV}lg
z_Qgf*5Nqub+zIHO6V#HE#|qyCYu+T(o$#`4T+`nxKYr=j4y!5`YHJ(ViR@eZoiZLl
z=m1@FsOPrT6#WgIa_zD70<{TE);{F8T|^XAMMrco^10ElYp8w69$QA#b?%eM=av(J
zslv5j0QS3;!97Am7oIHD5+YI;3u$j9hRP!?vJJ-U0>|VYqcIJbolf+^1lr?ny}e1d
zlJ}m_l-rb?#<?MrfOQdrh)f7itzOQ^sCu@0^{7;~ll_-gb%(Xf+}a|HCxEYxqWlQt
z5nhU~9I(`cps>Itwd-djF3|24$-1yZYo50vao9$D2qs}%GB~4x=R6*Z2cTpGq4c+A
zd|6RJUZTS%hw#FjIEJ_F%z$4Z<3-_dna+NV(-=w6`AaOOm-l!#7UmGF3Q7N7F3=Z@
zGC(NEg4mN>&}QUb&K=^C^;FRIISfmS@V5*Z`^dpyCdIOqOYfIL&Wsk~2#&}?t3Xou
zRip^R(lOG>DXwz+HFFF2|BBBdaPBT66zJ6c@|VBpc|m;|D;imidS~ow*AkebqYBBH
za623z>r>i5R`1&J+IQc#N!w#}WUv!T*2vitJ||nb`rIKLt}cs#Wx)2&)xd2?=kh}0
zx#Kkf2SbwP$+5Nl$N?hd2?k?vk4nac;~KDHA!VK!j|p-Y1`~`ac{XA4`9^#ih`XLT
zp%zY@DV3J>4c?9qi5KYQ+T#rLF!B8NmO5e~#rLeDy}wMe^<f0xzQ+}<L1(QBo9SW0
zW<=kQ0tlHoQSIv7lD^tgbx@2%jwd<GAXSy)rK)6L_I%4z3<Ipqp7)Re60SdphPiZA
zb?z9KExq$y#Jr5&`M-O!yR1urFfYSFHM@bsM**~6v*R=oay1*1PD%~k&fNlHUIk>A
z5w)+rD^PWhB-7UcUq+zfkW)wB83m%QcCBWi#E{FKq%&t!@h0zs!D_@xFFd8>L+1K7
zIrDRZY?fL0$FCJ6A+uS#Dkmz<Wq3{c2X{qEAsn8_p=D;`&JDo1fFcB`>U6~PJ)au;
zb3y4k^U*A;xGQ5*F};NXKhc^rIVWEkQO%;_(>N+8`@{4CrFUP;x^%guwAB*2>h!e}
z(aesfQmDuwu#N4*!~N&m2YU?;^RSwYd|Kf>H6VRES$UQmn*Z6y|9Ou8LoW{SfA$>r
zNW<N0FHSg&WpwEwfr%How6`SSS0&{HHkNeVo{OA7(bb&@8`-~LCk^}u`MS1+yc+!;
zEk}ET2g5QOe5|^O@4K$+=#ZAu#lSl1Ty}_@o+Q+e?33z+puMEx?-u7J&RLzwUzs(y
z_FnDBntVM%zjU+|TKDniY%pv~qqB2Ff4mJHj#V{=90_{?qgMW0qKw>h!fBAA!T4|C
z3++x~5(38z$s<t{oUNwP=~Yo(Yxb#^ji=_K;%o|(8-$dN?>RXz4O;T?WMncu`6Gr~
zyxx*K)Eo*-$a=EZh=A1oetZ5KLA4&db`R+JZ!5pm^t4AkVTw6JNdU4JMM8N58$6ll
z&TUkt4%@vyf8ut;c~gdd=Fb|t*`GV{%4{F_vwaDJHxE$jLYukXR#_%-0<hV)!3*;V
zo$lQk9rD8FqCL0V{;hs_zrCEhu-}e;i|)olZ+$!a+efjTkdYhn&n7qZXZPFAd_=(k
zqZ4~nL6g|TEUGpZAR4E}O%G=PT*>9omuz5)z^~9j6e=MpyHg7LDank)eKCcp(B7?i
zzhwL1<q^owa~lO6YNi!;BAC-KdFV)WI9q<jBAsVobS{j!Mj4K(sao<tA}c~teE=B$
z-#f<#`=`f89rbBMo5RXk%IN`7j3vuZjy<@NYSoaysR@G&B3GH1UU}X;7so-|wB>9x
z>NJ@<%#!dBrF*N0hAi!y>)j=v^sQYO?D)e#c=lK3uF9FCYY-9(a)pAgvO05)9Vq$l
zhkO4xwb4zk!bt63<|v4>4s(-c&c>c4_L#hKmz5QV`HfXA72aUJk<0+<Se2@~9z&V>
z8^V7E+0+TwN)lxW!i$U!A#)a$uajnKOhzrIEA_HsKUeZ9VO^3XDLk9W5YDze&E}N*
z(<-OgIB7g?gbRO=u3}DYyZtETZo1^=#0E0ks9q;ii$bf->5IqL%Dx)ypW7Sj?Z}Y~
z?Zcm}S=kBdrW9jltn4E+m~nu&?WjrT9f8C($T6Kh_HD!JKJlsze`z37+5HD+0T8|q
zfp9v>hf#BL(*~|l9Fgk#T7DWJ+moEn<i8tzt0e${gdD$J$w6g!Ta>Wf?o0v)-3C(X
zP_#=hQ`Bp~;UF$-oz%2$KYEpulDj!buTj70_?EP4cPqSH8KFeyHa&-raAZ2jV$C)o
z=~|W5rc?6Ix8)}))YGP7qLmvMwp<^Pwg-4V-)Yj&dC?g+`e*kk`4keQ*e5Uu%*3C|
z{~*v@J+AY7-6rgH2k<85hjSE60xNJmi^A2Iy=k^6f-wPQPa<ko6XNlRXGWvHU3*7r
ze1k=tPtndd{P?kxhuD6k`5GKkDj}MAVlEOMb=~En@RBm5Eke(*_gP7F;4>JIjaxGy
z#OywDZbFS{UciaTlj@OM9u?-Qv<_DPc}#{`1ewODFtTQh;Eu%Eh$GL~0t@$(L#sHX
z2z{O?*juXo2|vQM{*?csnOJV5O>qTP4M(FLVMP8<<RC%{<EnLRAeB*tQ1Vl=YG-a5
zn~kX*Ub_doLaqGddrlWI(k4V0R>`-3N5$NaJ2B;<z4<Hd;WpCJ>BJZTP=^>^yQ|K<
z>N@C%s?LOZP}G}64ClghM%p&y!SKUsGqy{1Zok@fpK3G=YtQdjR|>$$*;~^|Z(*`q
zI9=hDIW@k@bFa<#J)zrO%_*tih7*MDSI(e}5`>F=!}_i3fHp@+Z5C3Zm?!(EKfMB}
zYfiRO*L30-OUS9^`>m+U&3UuI^5ACDu`1p01e3+Ad1u^0Lz(FSf8t=#Ru7!E7XNVd
z@H$e5i&JP+e(2ebPT(tf3y|Sn9{buVsHVxC{${dtr?*63zi*oyR5Fd$+xPDxU63L^
zX_7@jxP8Du(+_!<I6g$MCkPj$Z^XTZCMx{h!cqFt*UGCuxm%N19X9Z3+wr6p`wc#B
zMb>qQvxAkWC6l*+T2~wMDZ10ArpCe&@j;0gUbGMFL4#v;RL=<0sxt}cq4HTzC$dfA
zKqTrPWeE@7VhNX1#wmXsKNWc`N0wi!+tf<(9{$fs;*Gjy;+DENXg4proG$Hqr+4+r
z&`^J4x2udv6Su(}vfhnNy@o=uU>g<Qo~cwNQU<`1EZ=Sblhw}lv2n*HvL}KmS8SMY
z(Vh`9K}Scg;<!rF5O)<P3<T+L2#y%e3V1a1rP@F#=9U{YqPS&&8)BD2FcL0eKXRi+
zoUZE9YgQtKBSzEc{@$2tQ-2m3_1QLqb3nd921RcH2K$i<2B)jf1cTkMh1Y;~&7)U8
zCfjFNU5e8oXc~1&%MI86Xj;s;YDZw$br6toB>C+(Z$eG~2pSlxjXG@Z9C&DMmLtur
zDb<IxiN-PW3E*NH$OP(M%YZe;<V8*AX0LQM66m@1&bqk5#TJ~W_mVxn;yC&s-CS5%
zRPoZBcMIT;U6w}GAgs^;FK|-(v{@UcHw+p_3re`I4EA$DXuESam5@M)oNd->jw%q4
zEjPhc@1MjbXIc^Wqg>GYIE`?Fx85hufSdaf{%<q%HgH<=g`^u%+f0&SMlPptFGC{t
z^>$XKv%tPOJkz*_SBjrE4KW)piU`g}E*9xj<x?FjB#NF>?D&bYFV1syTVrcHJ+I)A
zmjSrO=NNi^=rIbe%(0nVk!uL4=ZyALRdFtRaD!H^LWb+_Ae>OTX?1j-?kQZMysYGk
zj=ZmCnDrXSQM2=^?MRQ2L-?PC1zL3H^(*&?-g|#<z3r^OLfCJ@&^XC=FqC-s8peG-
zUer*phd{lIR*?h}N2xe(V<?2w6*GLyd$dVtZ4uecY7<d!)W|>dy&GH{LM(R43cT#M
z?YlCRf==Na2xgC0lbwokl7r`&Bens3c44ad$KNvMcJMOzH3MsslOw_lS{huty|@aM
zRtOsA4qU>C4t-`q66nkO9h2I(JgI#_9l^#TIs*K88i0+(Gyvpy%);Y>iU5$$gS|5$
z>xxyD!4qdGka3W<o@2pqG#~+|iS9@}3>6$)#{|MUiLX{n`>Nb^GLONorrlmZvWUo1
zan{^?F=t`#-Sxb$3$)j{et|p`5fN{gwQ~(QvOtyLuVLKdRQLwA{YzY0|7$9Q>NO6v
zgnN-Y_ZIhUg$IbgtKR?fFX{Ld?QorXTU5PXZ-0R=czIVYZWsCw7L+jNNEda&LbOGN
z;i^gnRbbyNw0suRJWpn1sUn?ynlDpC<O%quRs*5>eE0gO+HZZYQv5B?KO46YOB|e8
zjB$C9kMi>JdkmZKGr<{Ks}awG9ELn`-)oGoZgyzlY!AjQz2eO6;%?{-9%EHJ7xBMm
zkshsk_!|@6LY@S+Ivd(nQ|l=+!w@HOS7cj&sU3*f^uCiNBI8wRB03F?d1EswI!S$p
zd0A@uYU_f}5yz1*V?V9BzcKr+XEl~%FC-m@c$`bNP)XS>Ntq^@w>J}2;=1--)zxwo
zKc)Hvs({6WIVcMgC%L^){2q?ALSrdcBz20>hn~__%_T2#6uneNWL`l+Qm56ozK%iH
zei#h?G-E%uv&m;x@~Yy&HhD(HVh@jY_qwmJYV7|1-17^G(9v^xtTe9?(tw4RI2kV`
z)MdN8m$yxal8P)|1=I<DxhT+awix>DE;$d+<&C<9c(4urJbl7V`~b}jIW05)8wAAa
zCW<Rsd;{$T39IUcfvIyqYzjocLf_`^G{M_lznlLeP@cE8ApYA~a$GFG^wZQ;^Fl2U
zt926`{PlZLW33qNt_%EG2x2#f0DT7&+f))y30r!s=z<H1ZA@hlcgq?lH!oZ{J6n;2
zJ;rZYuc%?srz%IQao+|*WikAa@>rq{%jQzn?)pMtHRRZIM6o?Ep`r1C_q@WmCCHZA
z(PawqFGlQoPK1&|&~q?qS2MZd{b?2`DP30slf0qFE(yMLcr}N~yNvSEJ`!kVfNWHn
zcuN#a7+l_sAo=YGK`Cn{2eRfIv`QY9UdFSSkYt4;4nRM0Q??W0tS0|XNmi1p3Br=A
zKvZI+TZzeNgMrmECrnV$FdiXj6MtdeC=G*?IP9+yfNk=wn6h4#@NNnJr7tmLd)-v_
zI>dOL3QSBCx~Qkf+t#eq8e?Qhl=q543fTe6*x4}<OT+6mCuB9ieU%eladM?pa^Bpq
z9WE44C)fX3fLt?xe1SzAOkOi)DL>f)@kDi}FUT{WN~OW+rjeEDCzw&1AIZ;*CFwYc
z@l<{N{6qulNMt;VbYHZjb){OJDJ6!JT@YB+tUi%2b<R5x%lnvUo>k+ypmiVUsgviY
zE?^xGyBJR}<&XrdD}_=wAseA=bdhE>A{5xb-b|sy;B3#63JzGguTqd(?+~tW<75t7
z5`Qfw#FW}mJfXEt9wp(T+j+^BEwhZbsjr2h><+n6e4)*jU_(kmG0NOX?o;=qak-n)
zxL%wyu1c7ShgH<om|Qx!{3(t;;=;0+?;pb%FdL3`Wkf(s=%Zn$oIQ&m<7TlvBkb>8
zW<AV^*z&WZDq0>B+zx;NunAHbmhC_ms$iz4IPo*qa1UXoNXbLYvX>`gs1mE!1~FMP
z0f&l%9^Q*Gl^|PBZ>;>z?=Cv^#?|bREc?^-2Q-0PIaxM3b^Q-*tsY|_lVICr{kG+w
zcegmPn;ouSWI|Nbvyi)XvPrt7;_{J`cuWu!o%+-A11C>WCsRh()k+rM5wSj~7cZr3
zfWv)7ifH0ZAJlW3zyD7D8@~ey+XiyvZ9fanvc^~_I1myE+6g6SUICqk+^y6gaO1S*
z)5)v{n~=5I8lylvYjWP<%;4CRcwe$$j9cb}XjysLk%!DlGDVDCMvYe!O&(TF{OfD7
z&6mWnS8eDX?C@v5sA}tidBk6eth_dNBCf)ew?ELA)^9r<k#N_YQ^?Qtcq&fVlm|{F
z3`$dGDl>XoI!X|t1po{e-Rl(-v{_Um4AxgoNeuFz&$17WYqH@YM?fZpz0#f59uS14
zZU&4_<wGQmoy~GrO*3<Ay13k9_W^nuFbA1Q3gsoRyHD=x9nP0o1r{Y)VR^{L<vXDT
zwF?atWb0AYSUUSuwLieawkcqM8rgt)lVZ1)e!F6HW@)*u^}%Yw7{?+2ZiMo;PLWYY
z4-ICs!AkY(4fmC6@k!nxCTCtrttpUIHXwS3Yb9yo|G4|qvW}$6xdq1t`$AS~Q$1~^
zb1R?|u4nD+-g?`<Q;@jjnYe(2iG`re9>VQUl;4#2k;<V2#$skdqk;-CPVEvm@4G`*
z5lHd!ce*EjzG5v+!j(?jZq-v7i6YnBYF;Ff5Z^*&S4YM-4Q{qFthO|@Np_vwP|H**
zO+*{FiW5!|Lpo$qo2Cpk1rO0Gxlkl8PkWQps$5z}Q!=?0&g2RRQC$tAX46HNdk<U5
z9slbV9u4&M^7|yeFWqocX2zrojMeMt17)-2I=oAZYnQkOmk>-H<9p-Q3L_HmVBUmR
z1p8LjTg!oAcsW`K#~!@~e%f&8DD&D>J|t2J#|IxtTzuU8>x%5o{=L|W124Kzvrc=k
zs_VL^qdN<HxT*<@xcI9~*MrrHZC<IDZmugmWm8O_3Ht@ioO1B9GQ~p@sEafRSMt-K
z3Sq@jKruW=#Z|n#okMgcTC{Fs+qNsVaVo|i+qP}nNyWBp+qP}nx_Q0Vy`9_L{k_Im
z_~w+WxI19SK0AuZ8I;@`Cr3Xl7vu1E<6g#b`K@tp_a6%QXr9g`3n(E^Gz*!eqK5;H
z4ENb+_UvAoXG&DXY*OQH>UXinH8KN%rNZXdD4JsUBCpEG>`d-LrC7U+KTd;VaCfQt
zPm^qaX4<$>Dug<M0|pf%IPZHtGgy8A6Jh`9r4+NM66fOUK}Q^KovkdRa`O3fr}vt&
zo3&%9T}!X59kXH9VT`^wt22f0q$|9vdYE)eRa+V>9=i!+ye%iRRc#X)7j);B&^2+h
zFom&~xpU9U0cf8`pby_j=J}_V0?jYe)N&KN*oT?zt<wTgbE)KsOH1tbbF;wYDQp=e
z3$Sn_)VQYJETti=`#XUxC7NZZ!OLq8201r|%2HnAYzfNO@~uk8DD(qX!rarfG9u{H
z)9<50ipA$;;n$2+jJfk*sE6Fr5#wjlMHL0s3DuET9VFR^<XT-{Cemi`tUCy3S<NQ6
z#OU)xX*RKq&Y%Vz=D^-uSak!cp@I@#aANy~SsX%(Rlk^P-OkAFys!v3+E@VFB=Byb
zA05<QMOtCBN~*hJ{{ptle6w{DKckwO?_(KJq?fU3j;;up{sZtDT}v^A+9Mnp;NdyG
z55*MdX&vj~DG!3F{0o%u=eY<C_fA>T6CU%3H_gPI6%4xY%yFRZ?zO3EDIaU|)=sKm
zf_}MVJC6C;y~4>WKNaWHsBV|PW*-iq0^dGfS2ZkHx)o18X+29~jvd+j0_}?HFeg$P
zahduWm1@Olu8#=g7U2I{I<7&)6_weU(<#T1+lw&JhwD+z7N#u)61hNeL0`|pA0hi>
zvM2$Z*(cY+wU{w$ym~PClF&MZUx~?W%9lccHzhTe&q3CIC1X`9D*y2!c`+t)gYxC)
z)2->3wpt=a`|R=BF=2sp?Img>TYi4BZFK>QYF3EFCs^Q<Ew*VFtlsf2|N8!DG(~A5
z6&&d;jj7eZJVHF=P4ExYG5S(5t&?ij-2{5(auf|3vM?B!FN>A_#J4R%o`!{61M?p!
zGYqVrc5)<JE2-o#1n!+Wxg7Pn#$%GK)}o8huW&%mkjOEb=533JUqEw)O~g+2Y}1<0
zj40%E-fXjzCm89=??#Kss~>#)NAGs{UBe58ejAHI?=bR}8``@@hOd7eK{Vxk_V12J
zplm*Q&k>v8D#F1)9K5@H1_SdAJ+$FWS)Yqf(tJ?cLbY^695TYS(XEMcXcmqm*)53C
zA8Pl#c|h*X(O?Q<jmv%+OT-*|LhE6`LKW9XwH2g*u2(jYjO&&{DWiMrpGnkw>>K!a
z`=mXEKTkGp1T74jQd(Qs#Kt1Kvuju$ncmds;v{NPJ$tg>*t42$oL*w}>N|Nmk~G)e
zDJyoGVBwAXI#Ct^y0uG|tlh?Hq|rXue;#dgm02kt{T(Q~E25DxG`OVas#Rx3Nz<g3
zeYeMdEe`bvpQQ~jmZjO2aVu(DqKub2B~CZp?41?`Q3mI!UHuSqY;$%WqJa)JDbkZ}
zg&mM7rr<eB(mvBK^eslOu=<V=rp)8^lWg`vnT35=rtBUwcI%i33F;qV!~rk)M0HYZ
zYhqWKllydo25WS_JVy*K=c<Z`?CF>Ss&^s*g@#B6T$5>K?EFoX3tNzlu3L?$#Wkna
zC{w8aMY3=!p$W5FHX<Lhs1RRqI-!i6r!AY`U%aOZ6PiuxFT^})JFNvPQs~PE6lgg7
z&A8KXbq}&0bK+$NxyuDg^Pm4q3jYX0d@)vBxMIT~oCk6p88KE-0@6;6D`m?oIM|fA
z$6)ZUPdAAn7Dn-qmdaYF^Ny`tsFn9SJtkraN+^4alpcETW<FJ%#Nf}(o78<aMPPH!
zM2{+PpJ()cwVG!Tb-~-EzAZ^N;E3F<u*We-@X)9fTmRHbQ!flEhe9jeOjCtp&z>yR
zyb1TxFvB>Z$q`F<XIhtYo+b`eg8xMft!CL<aa;#P?RJ~C<I?;09EF+Zl*`Ge2^2mE
zo)&}=Bni`=-lQQK*zDCAE8#iZoj75wN$XmiSVzD1G=QP#0W<@1N~%wwvhVDfvh}}b
zQd^awnJY6p7};kkd!y%A5Ko5A-PKH4K^*H{M>Sdo47h@@200z*Jww18tYU2F8UA|d
z`D(x&Gx7qfP)tm-)%tHS#}VnPceP4}9BbF$r4~@J%PdB>i6RZ<{J9C~JGrMPNTX*6
zjOf_b%p*e<@KzU;sZG6vKxU!|CQqUS-cPuepPl?G=!9Ibk6I8>4iqi9A8eH2nRfbk
zPpYbj1Br@<`}g0~_zHJJ13e{~!_syVyfgKM#?v^F#kD|pTJ^r{1U6|aHT^7vv(`FM
zGgR|OVnjTYX^xFlch^iYcz<2_m~*i}&a{**N{eJyQ}*Oa?f%U~4dhQDr|N4Skv!;y
zW=nahClpCZ4GokUMISB)9V08qpn2#kL;_oxbiNtxtub<WNAK|+3Q0#myr++qa4R6g
zG^PGabSza(`Q%JB1yfOWo;ZAW_zFG2xm=+@C;HEA`RVSz!ce+S!~MDIT_1qZI5FkF
zQVmUwdhC8Ji#>R219OAM?Ri)BoAPKGEqQS>VY7YJDw!(b@b*L>_H3PM#{UukeaZ1h
ztHSfJaLke#H;KHKyCes6=Ifp;sb3>e5cS2no}iI=Ep1VzEs+G7rnTwG_8?`PYA8dg
z00jpxZ0%ky$H`{9)2#7$z?Lfjo7Dk&jpTL5VaqXVT2<v3TpVJRvQH-lw?=bOo4Zs{
z5~lA%&wk4@sa9E%5hW<o+DQ;BbowH0alIOHY?L!LHNF!uJqF#~$RPh8NbDtO4v>@|
z$X;wKjQW>Z2A-=-7tw*Y9>p0su`U1$l)fRCxggYyb1}oqqwQc))6N#zE7B&67<f*m
zF7H2=Gb>6cKQP}$8$WSlYLoYAFhi-uRj_MsfGFy?MZN6uvw?%+Uw~i#5R0SI&%stI
z1*I8k3jJV2ETg>CQyR5hqz1jR8VTqV{)2Ygm2{_M=^qt7g!l&j1rI?jG=AfhO*r&-
zPKClp@(9qxOTz|dLd0KE*Qpq(&u+rO@Kf;`kH=nLd*BNc$h@BkmuZcyUw2!X1Jd&h
z<e3QdUh_wZC#Cl3IkfIA5opm-(E;rMUpPNzmra(L-DTvVoALcEaON;Qk9(Cn;+}u^
zar%Zf!sBxfUUAN5xHF(d_Qkaw(lfMKeFzhmkYwD&({$T$M+8DMUSc?Rm3{d8iBzOc
zNjs|HnfXA|kM?MRd^qD~)tOobf`X!t^Cqzb$^iD9JG3~gLkJ^?ngp~gdZxOG|Bn}Y
zUA2^@1oEh@&Fq*5xwJ&!fe{+ajtr$SItxa)Cdmz<scm+<rxycMGa|RqN>=gO4-S~1
zs=zo%gStM2%}*lorFOx+y9;^i5*%i2=N?rcTy^`k6;?R~KA6tz^tu5^)m8NyUmMF8
z79_CN%@7fzkFO2Agnd@MVnT)%gpC;Gtc%}#x!+$RN+KvcASR~vRwIp{{qRDc+;?g`
z5-#zP+nO_Fh(_Q@44w!t@I;(s*4PwJge?@jL@RLW_`JX8$iEPKM~ndkn<^Ujb}<BN
z`w*6MS*VwNY|5`=EA(O9@GLeq{@@Z?rXa7?-&_N9Q+EHBm7F7U^tJ>0JyZ+8$2fB5
zEXWmh1UR~}6#HC%Zdz5NC<jcUQj~T7(?8ss^+83<oNdfN6NPWHD-VR=O^E@Tt$IR6
zLOXJyCD=qD$4Ht~J5&Flng-9P8xQ?r3J!mM7olUeROW?b0Ex!x_sks!z2Pn)y-i(B
zd0tvUmHGioYXgY4#S8wKWt9J@D?pMoUzdR$U(zhko`f~#zB+3T+UOXnzgtk)LNY9<
zj2*giDHO?+T=Q&vnLQt=yW0<8)V`7NsI!eU5##-DjKo$@g-|eoX2lsZ2w?D@*lioC
z+JjG?8q2Lj=$2G-s0pQO(`{Lhp=x*`B+5Uz%D9h0Ec|98V2O{=y4l^9UA%1)lI~Tq
z`;cExAXPuaFq!)t9M$i{kbG-tP04j9GA{#*Qg8EBJvNg?|9UBd&BdRDav7Mcnm~~q
ze{y)wc<ggY8<CDLZ9-9xn}B65_UFs_q;X?y<KttydLw+n<<Hwr-7-4nMuaRZIs4zy
zI;L2BmEyHpRxCPpZ|a-lB?aYk?Q|o!XTSac<t_wI)+IBDl-vWT?qs!6f@7{L4f^>!
zPg$BNvvKWgW{x7tibpb}q%+XFEY)OrCjsQYTKx4odDD=2N;Wx=D&(xw#5TD`<zI_j
zNZq`WE-%k9FMx7&O)Ai;p!Ow2636=8%A^Js3~Brmk1x6k9Ffy;@ro^pHgq<$wa9@n
zI2;%7PzXcCnkV7BlLkzolfM2{X49jhfv6UAKca4xHXPfZ<H5Z&013uC)*rag6&pPB
z#0rb$(U6Y}_>LYO9!uq%Q_2{Kq3YK9C7x=)_#ClZQ**gyB<{M_n%SOMBVv)i8>*=5
zXi`2Sdf8Wrwn#;K_n3Tndee5N9PQ0wFK)BYr+@1mGdDI%uncrOiI|)-rkLrwB}cgo
zN`6|PLR+0asei~C$r3>J@MP$S4Zee!N3(1Yc0`Yz(z>0rj{Cd>CunF#X1S`}sLyJa
zx5UV?w*PX$O-@>g37q3-q%$>%f(udb3I_Go13ZnEb&%2mwGIBcX?HeYQR_^aLwXp(
zWV_!64)`g8F;P)ADOEe}NjYjFp35E2v=*B!8?6y|)DZq%n`BtiNf#2w7kIaMjQj5#
zszATFaI9>A;D&xR`e2g8tQq~*inhv}D|7S+SZeH4(zj-AW|{T1mTPV6Euivedb{S@
zS#w9{TE;PSSaaAO(^uKo@&MfG%_orFpCClt;IVs-8L%{$qCTuoIl4OiIu6Z?gcCu0
z>vqv=Z2YCYdH>usaWe({@1*^pJe$TZ?PQ0Zv!j`ax8<Xd5RQv3Ayr#PeKVt+G8s5c
z<;uE|yMFkoK?t5lsSCg0c{<_|HigL<7iZr{{`BLCiGiypA>NprQ36?fKX|VGua%6G
zdh?+iU-B%0s_F@z$-&?}tJ0BJ99b%MnC$^(EhGKy11HUH?AHi2aIwHlJN4d7>&}%G
zA%)WVH6Zr$!)rUt(rC$fUpH``AlDE<Z4vD1390?HRUiYJ;!|1HFAZV6TL2ZV9|3p3
zDT&n87xpgs#X%BFrQ?%fKW1yk^fvSQ=HYe5BkQW3F2@sBhc#&GH{*-kyBQ)@l`(_|
znE5zt*2?*)=n;9s9P$2~;<8+d{iIA1Cy=Mdc}v7@bT~ILM>S`0F{}U&T%<L+DsR$v
zvu{jU^FvuFdk%4cI667>y`fS$OR9^>G6oG##=L@`elL>dT--dpmRR1^kVLleBIk-@
ze|I2G42i+Nr}C|RO?~+!R$2DPP)3~K_3Q_!hCuH8_9}OQr8y>tWLf{s3I4@c+G!ef
zo}=QK2%FB--V%|;U1`ITA1_^yU!f{DnQPWjh?7l2d=QdM>thz&$+l+}>w^8LRXV|1
z5X@J8&49T75rH@A+I=qqxiEz;hlMF^L6^ov7q`U_u23yG*nWOP(W^Ri#SLeW9IHUd
z*1g${6mE~8dLbv-%+J@9Hu|d;N}{PlSw|-}*ib{0?7babd^?dS*Qy51$wnH*S8-?a
zOcryH*p*{T>NW&kT>=ZG<vy9U`o4cQa{^OkG8Z59?*f$7h|kbu64A*xw7dg0s&k4H
zpUFaPi<i>ql{KAkMtk}u=&`T-s7je|_^FW!xmtKBFo*a{|Nb$4`0K2%z|bN~+_0mW
zYGk>Z<4>!$cX#h=T0s6d2u0rq;}@%I9RVVOmFrffPYtmTpjdCxw;#&nQxXjw&ISjS
z-#S-HE=r~{Ra`XPXFG+q`XLSnT6yD2oVh{!kdS;;W^ym$6_CzD%g(@lW1a>-{pax#
zBK}^5#OQMS;K$jhbx}W7Sf>F2dwhzd#o~}1d6RmL!sIc)g(^B}rNI0hn(rSYu{Akm
zl>~T%H~6=??d*{0l()*1#RkR>C98>v;>eu8b{=P}7S)BayJ3`QdikIA*8S^beZWuH
z0IpNo7i`U;3v=qdFT-Jv72J_3^$$6wZqmV?m-x^0cY19UH9BN1f9WuKU?;m~wybf|
zQ2Fg5TW5>@kOd!8u%`XElT^IobydQAjJIq=_?<CYk6Iv>4xryax+$_Hp~zH<{y$W(
z74Hz3^=iirIx{K8nsL(RffAk2K!zK;iHqCe<DWe?Ri)IIA>S9%Oi_NjVN6$nP*xlR
z2@V8;W^w%D*${)QV#%^v{{%TiN7s5%q~wPFpqD_)74X=R`)37k;OSBo3ET!hS|s%M
z(OAMf%)+3vu$}lPZo&03Q6a(JOI;S}k^!?c_z^|tX=iBGSva#4(C|@Cw^FBe=PmO2
zSizZjM#!isO<7j(QSpN{mB7S<H4AJL{MM2_W*w@Oee;Q8>JO#5jNqAPJBpY^?V&bm
z-Tf0CNBx`8c$#XFMF!Z--u+KP9WmL?IgIx3^B}L1gp{!jD_es4lkWJ@I-mGbC%-f^
zGVoM`vUvih=HUeB$^-(Wki&x5q0q@N+?O%wpxT?Vi`3@;gM_f@Q}c+ISmflc$KFT^
zg+o5GgXsU((BO5^DU_Xt{sWKEYEA`*iai-EghDYMJ?$*Tlj^phdWzkWT>ueJQ<TE^
zi5Ua*d>vQDPCsvTpo2ZY@VmKvi?-2Ed7-`Q%ee<dJ#nh09iH5cXS1CObI{tCM|iQ}
zH3+VYn2rniJeE61+X!ogIw4ZU_lvj{zVHJRMA#lHsYXABT}wkpr7HAsYmn!0Em^Q{
z_qxmp!wW;23A-IbXxZnpCb?sefIsl9Wz*)pNHjn53csoF7ttn<g6jY0-9V=?+uO25
zt9c@IutIB7#K}Est5Mv`G6vehh-)zEAo$zV#fB)C#-?%J<*opnDr_0%cGs-O^SoqR
z{(PR8i@>LJ_PExl!0OFguhyLU?sV6<0V~}LsPIGcx8}9>lC)l%5ZiW~aa%;`u#qfh
zuFm3GFC<9<y~C=V+mp9>zxLq?;M+3mNP4`S6qOLJ9F`yo@%#pyJ}O$+#dMYEEF3u;
zVzda?x52RNgAD{ju9nV2G0VbZ>RVpO$U%>4B&azx%|a<DBWt?D8yQ#Fijz}04GbE~
zU%7S$$o6MTG9<d4OJZA)z9C0vl1*5jRb>16+cH$ca@4Skt3YJ1d<(+EnZ6%H6|?4y
zshyu_I`e?eSK#au9*e$J7!2_hsDb`Hf6T)Q#BaVTNbu)o=zRZo4GnE2+oW&u5S7!V
zmV8<+|2H%lF&#kD)s|s$13A|fQ!Wof0kls`*H9jNQ|e>h<kQW@@vJqJobqdM1f3)z
zFWB%}O>$Hn!W{FkoGZ@PQeSi`k^;R3s-rbY2?SqefbZ!l^|GY(dFbhq#}yR!X8NxR
zjYqTyu<!lZHq3X@xap=w5)RZoE!sLoO`F2fJ9oB#4E04`BJDk;84yRryd|ia2cgZi
zd8=`pNVNlG(>*nSk>gK<Ip>7LzEM{1qpv_d0FeM0B;L8CX_m%kSSHMzjY2$RttkxG
zN(`W|(f)I&5cV|u;xBb&Z5Hp`sAz0kmA?Y?lNQjp%*ULIc#W)<QBj+HLFNt%88y2@
zvQGGY%%eG_IqJ3Loi!5u%>7D3MdlHsnJahp@#=<5F2BhH^Mtf;oUiO9iv04JQFnEg
zzuH`i-0$V8xl;ABKialRE&`htnyGt560yS^Iz;Hy(Mr%?(BGz~W@te()D}t=3z;Fu
zd`<C=B$BXck*2{bE^1m`7ojivR?3mu7bdmVldNHsls@whVx+5I$N}D@ntN|uMWU&>
zU?q^M?bdrt5=b#`?F<$x2zGZj)GcDD(<BLb>EeaudJOmSl_D=vURIy_gDdDxrIvJ>
zL^M=x;P=BjJQY7D&1I&9v>nrp%&HcaI4ez+b5eKRqRHsCX?_v4VEnfvKK$+w#-m`9
zzDpA<cSM@oT<X*@PBlYQmQ#DdoFJvowd{J3$pV2nq|Utu*YPSlUe=+9Ntv`taEaz&
zF+f<n1226u5i*#6Y+~T$DXGh*)|*#bJ6^2t%JhPF5$>$$1Ry6{_p8$8I_yk5iCzN#
zb+L4!7y{JoH1KqsMgxZ!YB#j#npVcA?gzb0&P~*dzdvexsav_#WG~un%MI78lGb{{
zVn{3eHzFT1!`(GZ$=iy8$9;#JA5wxxka&tHxB&R2-n@KKM#O?2nk<d>EtwI#);mN5
zCa!POsVB33)%yvye_tk`mEcYdxLmD||LK+vGrUuXc3CvRCH`Ana?%*&aLy)o%Cm;y
zbNZ3pp^=1X+Eoc2dF?q=!N+CU2CH5(7-g%IUJetKF&>A3;K6iOo-1s$A{?%&G;-ri
z7j>lcPFW2|vB^hX!!XR8W7e2-dV+P~big1<%1x0=)1Z$BG-)XV19FNJBiH0;sA?pN
z3?VVpYJ?wR^?e)Wafgrd^RA_JvYd7Ll!b&A4b152=b>+T|C&|Dus(Y_W6pMBhl-VW
zDp4M`r%DhIw7j!PI<7(a8y;8iaYEZOVrCv|SrxFL-z%HX&rCQ;GYPd~y{<SVfMQb)
z>@>G{=^1~p=$QyP(YA`ZGOE;W7zN-4s(}w^W2h=IYu1gPCU=^XcUdtH@$L`SQsn?m
z3NZ;;ZrUv;Dwu&=J%|sQ2xlhDpTup@{9OQ#ogxs!?!uF0MzCI4<P2e!$3|hc_gsQ7
zZ_+4WNXH3#=6ihqq1nbcK1{F19_c4ACOP3$tM|F_l0!?RAkt(+U7-)OPVq-?lr6Lr
z-1KZ5k)bVund;<P4a&&g;q5l?M0vS~D+Nj>#1p|gx5>~|>`6napm=adG~2d}VI804
zoam4=3EBYDKlVap66>Tb1oJAi0{Rw>3_<D0-rAlQb>3^`cy+XFXm<k5vg$3-h%w<U
zOjcsgv3|!3H!)(R<S%!Lfpzh*t&dX&5V;hTIW4wxlu33r4PVVgLko+>q&XfE6ca6V
z33+hC`S>W0Xqy@F0o(o)?zi*|Z7{_u8ynmc&n>YxU|cEL%n(KT2H+9V=!C?S@-7!<
zCe2r6c9AkjV3_{L|DY6S*<DjcUdsFsmu`}X+a=sKOq9qy73*41QhE@1(2h&uT>c_o
z*)H1-NMu8Z4@{?E9DZRAIU!!K=XJGqhF9NVB&_Qw<&NPm%4&=$6iDaD_|Bk&AnGC}
zfEV5-zR#U6j{X_h;>ng306yBS7`L~@kvr>ULz87Fb~qbFDYbPs_0nwVPXp@`u%w)6
zULR9@{n_SRS3eC73%?ig<D3z&wjgM)@KRFwR9+n`x523rtbcrlbXLD#54~A9{EPK$
z#NS@}ajHHgw%u*3c->dw6!3j#jZrNB76y5o0JMa;<8onOF(RtQ_aH>xHGpw<Ri*{%
z3r0FGCVN+K^s#gUvFB<7(2pH^VcEn;!WtFNSLjM5O%s(NG1S%Py+eubaIK^WGU`=r
z*w2qnP`I-oBL-*IEl$;FJ`75x*dZutFl6v35D%Ie>Ai}fJWaS*H5{C^MFk$PqYz+p
zAq&Sg*Xc1y3}_nV%$^*fp_k{$SAZR%z?NZrVeN8)$S3l}A0yA7HOIe&Hy9Qf28yzW
z21`nF7id5Unxfzf#OC!`HP-dbRbGmkAGTIqn+~2A4-DeZLUVgT%EXW&^**=%<XWzw
zyF(!Raf?tEOB@CtvpmgAzsr*vZh)@+Q6Fm$p&o}(MGNTMT3g#`@fcGw-uefQKCR4k
zZaBpsXEeehi1>O#L@4hSoHMjNr%~WEu-zouIv{wYho>Zzf|ArkJyp5hj7>EI{gBXd
zrhbE;zF(OV;#Lu-SF~Ae-O==H?tRcVAQtQU`bYCN>bN5d%N;2O4BUmRxy}jL5W5F2
z`NEn0(dXBilKx7c#I+O?`t$g<167Z5C{IgbLIzy?G}s|$Td4W{qmrJZ0dLP>EA?o9
zp!j#;#P};R%7Tc>$UW;(6@;*)s*ni?kAQ8mph4ySdBAg{5c0>TME8e``A?3nCOvy8
zzC`sMh2Qj!#JO05SH3n7S%QqMOX2E?y1h*64Xvc<zJ+zc0X)ur8mJPwh8%T_;7#0r
za_5#Y;)GEP-I|m_vD9@+##DK<Y{|PMY91YrgY4rLI9-|w+mhhi(nB5K9Z-nV8PPm^
zjriMVY<@w_%D;r4*6XJFX8sAQ8p?$uzKxUREc*h!@P7!ee5vCB_2ftDIg;!Pgr}qY
z(jjLe+lD5rMT=nlrcyp;t=kNXRwC=adI?ULpP`$zkU)P?;R!v`YQ7x%bzBB4a2KeR
z(}>33ZbdA0-sFDPwc#OIY{{z$6g;)$T2mab&oJu0Lct-)7#Pp8jyj2O2*_-6peKOU
zMZ&u7Rkv7_<y82QYH7yVF+YCDJ_+0&Y*n!*hB%L8F{3A!>I<DGpOFrh5(wa+DLz*+
zgFI24`oKZwK5a$e-qf^R;DVP5(<D?w<%QZAwO$<F_|Jy$LRJk<A}uK!o$%`(kyWGc
zGf*I_={dbhmY9Xf@B74TtX98<Jg}|`b3Pz&AtUaX@J2Brxz~MCj>R4rG^%nX6<~qc
zGwhFCE~EO5n~cd+FVc?pcCGBb2TjhbNiJ|iq2lWsDSV1QRJolN?-cx_9JJ|#hifKW
zwv%U56Jil=8%V4pSqrBR8!-|m_TKMo2=R62q@c+|p}zN*^|Z$9o<>s~g1`p=kBw7@
zA@$aDVPc)j4Zwkrq;LPe2Hqh!es};rS06VgMC#L<G543$&e5&6!my>ZT;mFB$%MDo
zA!${aF$EpxKXhY<UqDp9cjRtO)mu~*$jFzRoU)U{7_gGGX;4Lt@*%>iPolc208d9_
z!YgLVFiKW;e3L%hJF;jQI2m0%JXuki0*h-vD-cf4JQ^j;94OL}{+({1f?#G&c%&43
z>NZGY2RQ=_0z>2eTb}j%uW3|Y@Ed?BaXk%3?(aFFGDc4^xy@L>{PDB`<~gz2@r$k=
zDW8%eISeeX!*Rtkh@DgSQ|Y&O(4U)`dC)o6@Xtg!8bI@Isu_?srhgl)v}_VP_HbGS
z3>~%irUYU4?(SkDs+3J)Yox(q(UD_pg{;J_1`|9r)Kvwny8Px>m>Wq3(c(B{;o&rG
zkSK!T<$q}(=<0ZO2IQ)j+0qezAPZ>?_5(u`1_e?)9>lLA@?){$BMKzhNpQjPLz2Wp
z)C%4~{?u<^j{>2r1F|uK%arpmFw~jTdDUHxrqG03lhh;%xC;acK@(_%luH;qWQ&4F
zv{cog^6(6M1UO>=WRCDZA<=PFcl_4wlN*?KHZA(r;`kxTIG2sK6IZmo<EIhkdC6C=
zf3cwF!R-$hl5LjPOGaYfe~r>1xbYYlD0UXINV(yrIltT|nP4hMj#TDY^gQs|RKy%&
znIGF7pZFcH80R*Se;^1yUk>vfu|bH6=T$mBO-#$XFRyohKX2X<W0yC7_HXtI2noJg
zo<c8hV+r}*fra0Gnw!5*Lz|j@k}JKNuqWT9W@CvYzBex6kZjpYw%~7m5Wl#dP!@t<
zu(S&d1jLS@^Ffk0(+USJ%TwbRbm|N6Mz%}PihPY>YMn8g!ls5}OxV;Z?-0eG-j|m>
zDyo-Ad2cLdBYtYHR=c;AmZqYMHf-(^>0Kl4*f0-;;3tOH-`8P2XMQ0^g@LiuMgA9s
z1rJ_vu_Ge)Xhv6FzoJ3;I?Mr9Lb9)b@nC_0?q>Oc2=AnS{f75U7k^3t%q!mhMs`lg
zKsp7qCW!>9>AVwSYCEwJip}aG6#m-1$p#Gcx(gKFkgrkt{36Ykywv>t*4w7b<13$7
zOY|4eenYJ3+2fmGBS{kSWS?@9qecBb@rw{OXf_1~=`Z!ocHonSaQ6vXW}E(EdHgV<
zSMc**sdc6RD;mZ^P_(RwUy*`IK|`E`_p(*c%wqMsh^+~_*6p76Bg%g<_*u{m64@Xx
z#<{lrx4f?C+B^Em3!!9kxkpeYB9@}gMedTCak5hL;|hdBg=D^4EalEi9JQj=Rfr5M
z!f2@jNKe9W1eMBQi63E-CN7P{cl%x*!Bo3M=-QQ5fGgtI7%C2-OdKYcq@qf{ps1W@
z9*L9Fp|gyu#4fOJetxcZcVAaq4)<@^&P^$om>6HKHQ%=d^ZSLlzUyrX$~FGY;F8c1
z%8wb{9D=^UVHe15G8xMM72pl>9giIHqvl!mw+)iV9U;eeKbkl^6}h*#F*>1qJ$Zik
z3jA8oH5<kJC<*1<gvGMu;o9cs+S+mVuJum9>*43(KbNy@?cVyDp6+}8uISoQP6dt1
zxcusLbxU{hS?A}3O7?s_wz~nt+^u@zdUCGq`TEq04GmnnzRtP4%G|HN)a3yZPCW!h
z%0B4I^8PfuA@r=xze?0ypQW2CFBq8K{&9o9+V!sQ__FvQudH(ib<zuU(aE{&>JKOE
z>h<BS$#Dg|$m-@?lQYD|xIkZKbtUG!xIS~sCIl8B0AD+s*1!j5+8o@j!V1Fc4D8J4
zx;`WOfISW@bR{OPjFfzch0?7)Z~zhe^|5<(N&O!Y-VAO1Q2sx_Th3AH&38gh?E9Mg
z{8jd~^KL=l!L{tp7kKtz!KANvbDd2}m4|lc0hv0KK#7!XVL;@wUd^PB$}`0k{if0v
z$(!z&K=?#c4)BX*6493txzHDiRz<T2PaeI7?BT{|XL#3{*vJOH8aK75@Jp$!j@1p}
zDX#A~<LS-p#!dc>|Hei}i_YG4R2G*4rV^D$l)Lf!Bc-b>NjA@uuga(M=TXfoswE_<
zGe#C`psI<*^<%T2EAS?#uylS8xo+sXk@<_9V?%rUcwC)#=_Sc;V$k~qGk4?d%@;hr
zu>a>FaGOZ?%Dal``0nT8;urPnp?37cLE!VNppV+|-fK_D3iPhuK^TLHK1oTq%PHYA
z<c3c>YU=SeOzvTt*hxLIoxJBTdBbh!WNe`An~Zj>A4;xBfj`+BvHH&xieSA&cEVhM
zL4_g5J$6<Bo&N&yzF}A0he;ChyI~Cq3b5lFg3S1xxc%sX$D0pSocnWe&yS-~E?dFp
za4!6_=5EUhU(7MOmre6!D#*`p7yfX{OsNySkyQW$lCi|cz0Gs!gplb1o~||C=lv?s
zBkK)Zajz>rqx}`orfll$&Fns#-&EY<)$p%Z%B3q?Aq}{CHq?IpAYrGh3r5_H-~Xn4
zYy`~)!pRUA>`pZP`|iEOm&rXjZyi7!+Q()*I<WhvGvT91@j|4)nf0e@bIL)z{V)5w
zyY2ab;ra;fobU5R+<E5*V!Sa9x_jDNta{S*6X$q8Q-H1C+cgR0@JKH|Az<a_xdl?7
zlGkT+<nLkSN~pMCx<E?;1-81z*bLnV#`OK&#e&TV8r0<Tm`y!KH`kg^Vr3|zE4Kh8
z?(yCjf!qtdUD#I7%@w{a;pI=~3c0~E%k1)#SgQ#6F~a2of=c)LmS^49`);FWr*G#9
zUoZ~{^kiVu?-gvm<2wl0%=Px(j6`5|M=b6Ge>_v-Fby$mKbnp6E<&|oPS&OH@Ls56
zy6Q;kqrp^*Zq7H_V|1*6jK6{FEc|my7vMJdVR+5U``zLL$?Q_1#nH}b9a{MCX$0~6
zz4kd$^@BmSS@x=X_l7CLgu};w!yTvvH(Gw@)9B{yxsQF5Z)+jP&rwJR(ypTU?VDI{
z>D%U|q+r_I_2aN8Y&N>Z&b3?WS&VQ&Xqy8#{)i%&z(Rp%k%X+DvlyDg+6>XWCw96_
zf@MY}@hQ4V`P26zL!eh<Ourq^u&ACHw*;$pRrWbH%a*CkgeeVzkn)j9{O75cdwt8Y
zS*{Ue?9>1~hM61JNoZ1%VYi3Gz6vGugO76EX34cV`Ugy!%fs7Evbv7EhziRuSFw3j
zy}5H|k#dZW)>M9DV|wn-t78k7MNM^eGv1X*;;egUNl1vJQFVi?qEgvsXLQE=nTuxC
zJ0EY5h--Y)XVJ&Lk!?*Hfa1*g&s&n$*%{%VnXr)Qvx8SKaX6xxyFLc()%OC_R7%nO
zQ(^Fg8mu_Tp`mS~fN*_3g>7n%8@sbMtsyuV{k6}NQv~CPvN`fP&c=IM!o(T0YYxP>
zK|llZ<@af)88=WRt69h&9!`%nzSlP(#;+myjo{Nvc{}?YHYh)vIi~Hx#JLmr0E>DN
zF|PMpcSE2*(7diCCaJd-n2;L`9W_2@m-wA}IH|ne>5B_g7Ta8_-|h@`Q!6JNzV`J!
zkkTFI-Ap}idvnj%*WuRRdOnVY?_!~$ME7<N9w5_+Yuf_inQa2)kW<qY+HWR5gxhRP
zgu=%xkkYVz<6aOiD#nc-acMKV`CvlOL&MV`xhy&UoNn*1iBb>hd{9^G&$|A0p6w@q
z`?;wc;-vNMwTI>B*W(#E5(J_90g@biyezPsFK7Q5pY@G5&lIDZ7@y~s;M&3u6GE)i
zl~7904IY6!w`$CIt8WnT0*;lry*>sAbBtb`|JWbWynZ>QoZS3Z-J3i|4Qp-4Wp!@|
z%w&<oEbPACot8+45M;lrk%Oo2?K1;6|0&;X9(SL`HOITW<}S}zxer`TlC0t6Cq<WP
z`1HSD^024OnbndDz5?q4XpI{_#FX(Nx((KKxc{AAJ2oIjNB8il6S9+7`{5?@;~*|u
zu6KgP9LTL(EjGRx-|X(5!ne4~@u-NoRM$bk&r)J>e*QljgNNB%{%n)7s>9mauLXk}
zn0r>s_Z`hm@+&^UyJ$pL!CkA2k|>t!ef2D)4x&T-rG2evQ9f}0KLHVE+B<e$)ENB%
z7|4R{Czx|(e{uq&1#^}3RbH6))X5NScTnEb+*Bv(OW!~0KO2c$RomTx6hD?#U3a^{
zpF4kFd&F*i1$uwJejn`czY((qf=m&8&1wX^pnhI}zHJM-zE#aS?pnL*5Pq~j{(KVh
zerz1<<al8c!Wr%KPo4@*Mb*w(Q#9ToW%C7?#uDuI`j90$MXdX)n@@n#g%&JN27B|@
z&1~U4zf#gjN*P?a;wh%5mI^B|JG~#tn!8i)fuUK{PTm#G<3PrT_|8<b5oO`V{0cB!
z?hyHPPsIIq&qA(}vL#wNus`B36D3<dZR4^@bP0d}bg$Ipz<S^G$Pf(3c_c#B*m;56
z>`K}aYrr}9i^BlURc08;Wqpjn-fUFJ=1w?7{`D0n;VS`UdWRmt=!B0O^Svk6q`b00
zm%g9tkOKt8g!B7uYjuQ(G8T3V(8#of1x`ZKQdShz9U-A&DkM1u*r(>C)1t-~efI0;
z2MNv_dOeFL;_+Sts9SjrpWTw45#rB79@`wxe?Lx?%k^WRPa)o$Va;nn%^kq4FY9?>
z31kBOuAiYof3{puV!FJ$X~)g^n=g8O3k09Z%oH)Y5Ys@H&jeds<6OBR=N;7%UKxBw
z2u{|plFxXF0x5H=uPS}n)8VN}x_v{kR{#i+2`K4)Zf9tIV`2wujhb&zuHidx(M<LJ
z{Wo}pZJ9D3LrICmz+qYlknmyJJLVkOSxF5IyLoY6=_PL1i=Dq$Xb%R=hAl7~*+hds
z1q@R6KbIP=t`7RD;GrA|{8>is>eI~1o=Uj?)=FbfVP4Wb|INp$LjiO0*NG)Ly2Q&+
zejzD^`Ro<waKjKBnJM5Ux!2%AT0eRF4*L^sLOjhLpjAV{e;PCnon@W`PEs11zJWvN
z^6=!qUxA|L5y^tT7I_L5f4`WqV)xmTDS=Vh!Be~SYB+gxrL(H?OJJWT8&J+LXUQ<&
z|5t%F$X+`LiTi1((rbQ-k}jZcawOs(VlV22mHhA96pi%1^QOjsv1AraPO^}p)eDPn
zvaF}3|J*g47wx*kbnm-yXT~S0AM8UFt>mFc9C*d|c4L@Uz5nSC_Z+Nb<p|3fdGyKP
zW;=ffW`?@p`tP>I7LqY)O)Rur;QD%>^pih`Lw#59oaQL!I89v0-$18a(FvFp4Q?NS
zt){C>Tr8ay1*+4?|IXdPYZy4$L7X=*+y|IRGg#NVvm&M+slh*IM}|tJ5?$_dd(VWc
zOB)>PeZA5zulanxnA=h=^ZIqCZO)!TT9-tK_JVCz-kCBo(ThCC>&-D=m$JFU?r?iV
zWzNAEF|>tes}HH{Z(bcfd-?LW_N*AE@M)OFUgME0I#G`-;&SC_p1rbx^KPIwE_YO3
zmnF^}p@06W{^57ERiJeO%MA+LkSQ5L8U+LIdh+|!$Iw~jgfk}96?l2h(jP_Fboj&+
zhS1eV`*jyO1aMqVc&)#gd-8poaO6nW1QMj3;@F3%foEz?RQvG&kNZ!qNAlvHUd8G+
zc<kjI{BE1KkZ#9-KV9QzfDUyRs&eo?5?6p;ygaO}{cdmnAnZ9jO)|hcOfC+IiMbmb
z1>47ue$)trT;0fcT*P(}?f({KBcWX*F?zf+-(8~KB#LCdVeYCq@EHMv%;AySh!9({
zyFTz_lwjPu&Kw<%8-PIbT0c<=Oj4>9`&4Mv*~rqFSZk1H)sb_|bRFG|HTfqFR1aeh
zioVFe7eU%bEw}3jbhr7IZV8i54bUSQkC@JDs#)a<XlQsmo5)xWd`<HUy*JcEpsyT8
zTyf%r5P!>O0aF*}o`Vfymy-v7Ci|OwhY;kSHbwUJr0h>-dm##tM!~Kvx5w4+mcNd-
zu+l2bTOlbjR(;rmwE*<bf+avE(=7AeCn~l9B@lfolit7S)OPU3KC#6L!WHqPgO4%I
z{IDA&VKX_$R83eGi-27XOFEFU7T0@M2+7B)#5vdz-Y>``0RmvnxR`Mz6hnhU3ui0x
z<0>+By{YKqGXah0=f9?ck9z+ydmfWa-i;Rn3*4?ZYaBg%l3CYrLHZrY5C)hf%nO9#
zuLo2*{5eT~7$?Eihb9Lsu1W2ENM+j$A~H#tV0}nB$=!pixP<PAi+Zu;+TF%?!5z<t
zb0V7P)P9Ku0{C6)3xytwb-x*!-UC-l<{5E|3advZNSEM#-?4DezhNo6=D^Vu?gE<m
zHdKFXGBzJMO%X%zN(k$bRWW+k{THM-F5<!sbHo({crzpvMT^4!!+iNrYjI@9%Duyg
zbjR!!Nn|jvr#OoWE29DODI`5uhd!e^yL4eyhT$n8a`R&w%9>r|=R^S+GX(Oh1rpgZ
zPQ@FjJhE_1uH?uB<z&d4Vy0jIr=;QlUKP7_0%1rk4$zaCkbp-y4Z|>OgG?o6wc&Pj
z5GQOxwg{y@OMdE`7g$N|*W14V7Eev9(HGn@TcE09tX3Os*Z%ic+lcxD!W2$4Rano*
zpA!_;Z<4AbpKGS5Vj`t=#N-HG_(BvZTv}!`_#)75&!xSfzgJC>r{E7tR{F=U=gdcC
z%;>xd7?3p!<%!*dnhX9Ck4MHC@3Oxyg%xu(#3HpqF)=pQC&|@C5Etl(C~F`9`ka0q
z$|HHy`APi|v?e|0+L4y>^+}Smzti&t@yO;5VJDt~M9(+r)#}uJ$cZ2qsy_81(2x0N
zY#xU~E59c<!xL>-{jJk|4FGXkeCX=7MslGA%m1JYH#^eH<x$_OZE<KXe_&?s(gF@8
znEFZ`C?tLV_Y&0)M;~RALH^`#&Uo2jrkjk%CmMLg?cyjV&=3#$VE>Cu<^;@Hg5J@X
zDDBKu8_8rNA{5kUz3rc`ZvM4UefQW3>hN1t=qyA)0T*Xj?t%f3lJ~rp&31>FBTRQe
zNFX>4%22JFi$v=YFP2iNs8>;-kPEO?6<q|>%dBZlTYUmSC0Xw%B{B5_{TH-Cc}JHE
zic1Wm-2<jDD!Yj10mB!;Q(=dgcY=%zikGx1!XP2AKZ?V%dBkiy&3~w!|CY#v+Z3k5
zOO!%AKFcq)P5zP?DRsz4vcd2?GKuj4W9*~-xV&Sr44CB1{>1%*ZeViA{FjPilkYo4
zCE*^ix2GuS{LR9p)u)HXTQ^4kz<W(WABlZ3_3=VJhaYh}1SZ@xb$GQ=;<kapCi9DB
za2-=r;?zb@<p2EG+1;_tA(@zf-~JEQ3@Fk48IW+eM_xCU>$TCk<9GbU;xoo|wY+0Z
zk+N`x724C@t}(SB->xA|e?36;27bqQ^tDE&yZ4s-f=q>naAXHWmMwSg79rxsH^#>e
zwnG}DY8KY(GvP0oG%F2hJX>9yCr5@=`5tqI*9r0;C7b}Dd>tuo3gxXHgy7pKhjPBM
zC5@xD6N&`cUQ+8V?X!GwEQa#hIR5Xke$d-vd?2Hx;i2ut=Hvqga%dQ71DExr!~i6F
zXkGSy|78B)^S@m)xDm(<_|2+89mEr18uZzYdq$+Gv7yDVtiz3<y@*Zl<Cv1B{yN*>
zz)?cYLn)MYk-<Y?!_$w_nna)ht-?>qjUzoK!^uGLt>iD5Th`e|GDlNsw_(bpR2(}>
zjgn^LT@%nx%R28Z<i6U)OyL|p2S(<o8l)@+IJ`2A2e$~wow;XL!L%SxCfxBnEs{fb
zgJuPu^bTCE#ZiG|meZV#kK>%vSc|*ay8oH!rykTvFQT&<eRxA{>pG<R6l0BEY`<`#
zoZCk7yvF}D{HGpOAD?&|+8mLoYq+7*Kv<sbXFG2m|M2oc<61fmv{U^W7weQ78!hJ-
z>TfEfT{$Ww;bo<=J*B?O=j#tUKybC;W-m!^0P0<k!PqRIT~E|^)8Ytx`((6wZ_M7G
z%pgo<!`@Z+FhK|4-eEu{lX)mTg8w4_2CJ9cDcR+z03xhxfmA3oboD)H^mKEQM223k
zq0xi5==5ZjePx(dXtAu7_iowKWAus~3ghU1hrDMPBa(F-7LLH}U9M`OdNL4cbHn|C
zR5#wLzs;htTRj0DZttoX1S!x%8<z-iHmWy4{i)kz1_eoQNdw<31|p@gA9&}P^a=l_
zN}rjxJh7+el<nyRmMq9mhoA=B)%RB$n(-dPbN1CX2cd%Nb#{(bt9|XJxtTF+QKvK#
zAYz!BHJVG~RYyO>6C|TosM<*-7RgH0U)Gc^=;}`Zzh8aknSfr9wCofWBJBs=aNUem
zq)>|0#4;(7*d^3a&TurVm!P3p;j3cBgyO)_%Jbl~QI9f-Lk|HrU1BSidYH}{223&A
zO`2Ww%RY-LI^oO?7!v@0Q28F4<+@PCJ$(8_FmU$s-Kq;X-sad|_^G0xjYh`%Zsw|+
zH<FhgpL8W63~Rn?oJ3}(Bt1Asj8%zahn>ON16U-6b9|&9fX&(P2_Snx@^5p`u(vg=
zm1vt*2t6?kri_l5CRxq<mDtU@eO&#YY48$dJh)Fa<i1~q^;O?ryCz^layX+k;co!w
z36|_d79DGZM~Z_OJ60^rsY(u8NChMur%UY&Gv%o#MiQN=Xbtv_u_=$kkNrvmOb{)o
z<seZa1~LgEk<ANxYPEwSie?jmTnjy>6nA8wAUKjidWy&TA!c+uzrOp9f~iY0Pq+u}
z{y~*HyN`fa-Y+$L#G4tFCSv7)GCsCwUqjDiP;mi5HkUvpFgBrPu^&DZGPj#V#vW)S
zB-syq!5ccO=`PP3H>4SH^!|ypXznoY!zTq}y+=WNdw2{ndDW{9nC({$5lH;EdN$vy
z|JDpEdM;j?If;B!IgA_!HA<61x=8q9B7@OPj2&ssED%2h`dK@#IRgXA21kC)z`AwC
z1YUjan49-~saSpOM2TI6xs9+Sf2C|R)<~e2o@n%=ir0pMq~&dp0hiQ?=(PcPGwxKi
zse!y4%lK3BaIVFh`OHMh?Tm%Eiti?c*qG_c=~^fic^099e^@FK82_PH&IG-iqvnjY
zOl^-z5D6jm@sADL?a<4f3TTF7>X;f_;M9kO=zC_|`(x4hd_;RCRjXzrmwVR)Iz-_G
zZzvC?AW*;-UlIl(78?=Ug}|^1hdaV0P>@4ym|@ME;TdjfC6^DKx6ubX&AGV@xyMHd
z3ZE$by8~!=rL`~H#>2fmkGA`bhY{F<?{s?qO!uIbt>Kvw4HiaI<36yuL&bJ&%-e#n
z(ruHQXmEPD4~$%}5gN8WPIM*WcKa~?SPDe)e)HOH8vSWTYn8+=-J?5Q#D_Dt=*<l_
zS|XPpJnl=GrhK^%69Qs`$bW2~RLLG|noH(_jDr211{&ZWL<3f8fEGHKsTXO}tu^Xu
zVC)I6C_=Qc7<Y$JEqQ3w?rIK1uIK`0t#yk+j4A%XE*j?0{m(H#)UM*<Afv{4VSe+%
zNfufw(8VFGZ3m3brn6hmk9rgLz-r#9!+r$~6|3}Cv=+tf^yt1v%bfxWFNcVoi03bM
z-4e1z)Zh@B8XM8OF^dE3+3=WF6P{09{e94ZV@N9ASQoXq=v(6?#L1F_&64AvEvddl
zK}w8C!Z*v0%B|e|dw&yY3QR7@OtF|9$GoPDcd?S4SppqI;_?BPinrgXS3ROVv@csg
z7M&@OEXfIcKh(eHsiV!?4HVM^H}w3nNW3+KQ=pzNMw)8TXdutDnse>;0GM*))Bm`*
zJ!4<kwkSl69R_WN+Be8R4XZuML68q%Ujy+YH;}1=MRuCe712<om%_&c#3b%#WG_r@
zS3+GS-wmxt5x<*Fa`bqd;Qh8=txk8~9Oyjrm-Jc#ArV7BE@iH;xSc!`R-ST5b1emi
zQ(^$qntGiA77AB0Da@^|7Vp#I=>|`kwXi=_8DSxLKBhVj6)-EuW=KdPmFaz<0qP<H
z>)uqFe%|&PafEz%Fsjk|!>gw<aUnJyIk&#w67G5lzMhhiUe7ZSs>8$FaO`{OkHDMd
z>=jq1WsSqxTHrC>IzMNue35`&w2b6L#%WLE#th%7``@tTF=>qi6y0NL-K<k*`GMg2
z;PW8>{!2;-W>-R<dRW#{00;dYTLnJnLmM((7n5aX4A=j==Y~gJ3rXtl64V!u())cy
zTxp@w(*Q~``~6Dl55ge2UT4~P-a@+L(jqClz7y~4_*~WD)uH#sdovac7-vsCK{<Eo
zfR94O(LgdlUBg5%;J#!o@MJmO!A*GtPSTt2puW;!&N6)6_aRELMd@~z!N}CG99TPX
zAZ48Ox=MA4FiH7BRv)*v^A#3LO~cnNI#MzaH2^!#O=KFwWL#OT{elMZ{w-f&^l0gR
zR;8F|sAi)`5NPhtK7Ywl&K*^%5nr9hPUCBd36{d(;ARjKRSc)Z__bU}r+Ms7kL8B`
zZ4TYDQH*t3kF`zBjs2YS!=Uazbs}!0bb*RM&Qugf%6p(2t<1WzMOnitXH<{<pLSlU
zfw)#s8K>m1zc||!sf+LjN)^JBjcf4~OQ(>D+}0zk5YpIKw-NOIodDh?I+3xWBS^7<
zkHN2ie`wh)Im&l19$2Apnb13N(a#0vb*>P;M*5W1e(n-w1+}p)>$ln!#{3RLvYEER
zlafA>G%|lU<sRO&M9$zJ0}CIEWqH-o+*3j<MZyF7*_o=TYu`QF_sgI9!5ht&5ky6(
zo2vLm%x|1dKY(_-MMR&{^IJiF!lE&}4CL%Pc3M_f@gCQ2y=PV2fqtS1a&K#qNKyDG
z_xqx5E@q&PNOIBO?qAfIZXXkNNO>A0yBfW0ty2E#A%J+mxlZ4+S#iRlpKykE#3W>r
zLVaX1TT6Kc{n_G!{d6+kI)#e*+u?S9G1Mzfl^kE-(WRuAo>IHD#{Y~Lm0uZV1uo;7
zkR*J$;V;><pZEPFD|Mt2ot??~fGh&2)+IcJ%d)jswdiRe>GTc2iq`A%)qFrsw;RXo
zMyEuosf?k<Lg54zqld=^o~u+N=uO3S6RYQcsb=F+hQ87@ok-njU=_mdJ${jhx67(S
z@6^5PJ>jS1<=$EObMZZ{7H@z9tw^Io#aUK5zzmLhSg1{2{dA>3_k+YPlUs&xa_)jB
zCp$kUB1+h_vhj!G)h?2a=YIf0K)k<2b4otV$$J+MqzT}vLIu%R4{mIAxZAMD-i9MM
z8gMVhxEHT25L)=(raWsC2&1bc!ddfLx|2@ku78npk3Tv4et#~jb5lni@dymw_~B0;
z^%hT`>BLb%aFEw@()z=ER}QnO`Z3%m7iBigeZ^5U!_eyy1@2?%aiBIUQ%rq6N^K;+
zOTf{?qNEa|m~MBaOwT!&ZxB^A<1TkP)PY1*l@@}zR!4O1Dfy-!-c{tubeCE?*V=^i
z{qB``j)fnk3k-bW;){X$mOs;Wo>tm<=vlOXul8?gafoT!qMhi3U4)yU1C5kbM$c|c
z8*8)%61OMb{}!GS+PyuSUN(dDE7MPH$NgLXMxR#ecNo|!t-g<4Uo}uxX2@o$qrbaA
zEm;lDxlAn}W5!RIP=gkQ&IdFP9?$dKzVTD~npPxTn7McsRCix1ZfXA<?cYD*I6>b@
z+FR(}$%((ooN{0`K$2x);SI0072l>uIZXphbGtDkMQ2M3=Sno2i6k|Z!K~xld^Na_
zW-zpeX`Q_T%suJ4wcdbl9m<Fk1bf#aQ_O94OPy&sP`C!g=33DkGVeQm6Lsti(R%WK
zIbzu52gp%{MZ1bFmDox*<lAhHo8`zh4I}oy6a^8NV8NZ^2b>87fMzwxSl*h1KDUa<
z$^%JcvzkPZ6PopKZqwqH7)l96ydv(mL&%>n)nM|V@qa(=$w~vv`&v{<yl#9dw3_Ub
z+-Qs!nghI-O{fYFWq>mg?&5s3skK~8#>PzwJ9h)<DB2W*=m5pCk09H+b=t)X#&lzU
zsm<w_a6*VxcQEo7+LSbo1U|{$h}}EGBM3bnDVDAUmlh<&pljao7vkmLHR}u|S^XrE
z{=%G&7s$Cv!!UNnClG7Vx0<yf(x8TDIH-(2%6m!D9!6g~Nju0z_bN*+3N|xM81As`
zl0S$^M_{|JCjYPi^QKqH*^ZqNqv$;ja+<{gVt89jE<D;oKdVQ5Qje$_INs;$QU0mA
zyf{!v5R`6Ko&gd%E1M3=$Rcd00L9e!9-Ica$OrUhlWfNzv-NP3?oBd2;L<6fyX!uO
z)1ZeD6F^8EcPO_PBE~2K9KibYZ~#vaI?hot+)-AE{KDT&814hRx@PVpMvE=XYoPA}
zKW3o%zUiD^b~Ic7Dh^P3mSVD<I-OR$Oq|Iqb}01sxrd|DS=@wD*=vdz(ans0g1@<k
zs_jDD-bd~)df4h9jpa2LpAUm|kvY_$5B?S)$hD|ikEVc_F0n-md3teywKDRLS%NiR
zx>WQ<ZZu)DG<%NvK=8=i#12eZWQqyZ0V>GNH?!GLQ6WxIC}-k#`Uz+U^<A7(1}V26
zn|E$o!rswA3wvVM;(Uk^+oB}wXH&UKi*u@L?)Ky)OxA~(hUxEFHr^h<lA9D&k(jMI
z?`t$kyatY|_2kP6#k02L2xVO-)&JXl4iAYFr9(;FZCqC;w3KA{kba8jZsSo~)?f7K
z@2v$l-B9ZRr?dWoE*#$a*8SKFRD^b%lJSx=sR>gA%Y+Ms^d0>I5X`d&Xo4l1_p#zs
z3>{;7HrKc!@bvPwwY&*cSbgR~_YH5+#^FU4))bQ4oxit{A)%5}%8}r_)1;rDleY=_
zs`N8r3ZG}^=p>IRPt}hdF;x+rdeXu+C24;;e@72w)&HF5KtUo*BFgXEltQ&RN6h(7
z=!HwIo$RZQm9@%R`XG*PE5Dm38S!%dB*BP=_|K7xWZV7#u_#PJh~tW~Zx2Be%bVx#
zqwAy-&YQY$6bQk+<p&q%r6d~wCX5!)tl(S_+B^r`L<E4D2x11X*#<oK6@wAa{jI3y
zzVjjHVi=B_kse5W+{n#pfOlM9Yt0#Uy=GX7K`<H(OsfKiThq`gi9_=vUj$2b$faZm
zmv4HJm8+Z*&5fMt7a51lYHOh!Fei$$$uW&IGJzBYBk>w%8J~5MXM4qj2$QdZ2L$3o
zgmxoOPk-^Z(e<fB|3_mIY^*#>?EE*0&t#->qCp%h>%<42jS9)@qe9S2daLG3&*4ej
zs-XQmd~k1VvldBT2>%8g!1&|_#ghwG&|d>D0DyxMY8Qk_4g71+9SRL=JQV%^jp!8=
zHYI6h-8+EZ_7SuyJEyvSbQ8!wMfcJ3suwn;Ibjf*lv<bpp+Xrqqkt50g0pTkIRT$h
zRlAhWF`ibs@0@O*zV5{Pr=Go@qAeQsf|xgw#Mmsb6b&Ru?hFQ0rhXCz7t9-H_vrQW
zgS`cY=@+xJL8c(P1;h}!H{&m{yo?>1v)p0*JgSdPwUF`ZmyFvc$>bDhRXXYGb7XMR
zk>&A$%5b<J0s(HPsnZ8(XT`>55_)k>X&_ZF!t}E3bTk_cutHxxT|%27W{(E^9-3T@
zSdca3k|%S|cp%ETz{cX(4hrFa{G)vnHqlXy35>BL{zZe_xao)c2XoFyqdCe4t;LSP
z^P{7AU0GC5eoPuo%-Vn*CqVI==P7_<!C~lbtU=OO+s8F;I(w%zZ;)fy4DrI{8!C=u
zb8v@4DJz0`1g_$*MCA>uY3Yp5bImxg&|8dhnU<HIF$loy7K4=8^fSgl=-*-x6xM1+
zxdqTsLvcau58h7;97~fnN1WmE{wH>W3)RwiQFi&Fga&Wd-F(eq1K<{_4e(l(_th8H
z2UUM)-AD($8CH>?&Q1Onko=HLap7X5#e;MLTp?yI?q{DW&OIJ`R93aKbMO#8z7O2B
z{|$)SRaF>+&Gl)u<3ktg0W^OXH>*728+J?}qKjq(tHSaYWGOhC4L+2@#iFPE72hK=
z@&<c3RlLcE*$~jTX?L!@lq|LNqX5~Q{nZxe#evCSqYW(*YEoKeq}sNl$O1bUo1cu$
zGJ!p#)na7*wRr9at03eW&0s0xg*On-xO{_a_}@#nr$f%?e~Eo=U$=tSCIPlR5gI{j
zpJ3|iJLR1_cV_)NJ>Yd2=56jZ1YGEnIhi9M=+8Ucm$P9y>cSY%$J|B#Sm~$sm*3xj
zTP_mrVFrUEfqVWc{eW?!$@&WA+2p!x;YX&H8=ABv0fHU{&T$P=b|R~8+dSE*L8{Jq
znH-C;=CO!-V=QhoA_{Vu39$(Bmbt$g9@N>;oLy1j&d0l+pSR7*!wr-bvOGdlu;)6C
z_4s3d?T8%XN_je|h~hlPcA?w1ICP?)_8f0ScH^#D29>XG>j}mMaUyfrm#b_rhywMd
z0~a?k<T1i3^JL#pT-I89B_wDuDDZ`uY(0zGeZB_F!x0yUyR0eVLa)Dhh7kR-I<pG1
z+|SNaz&^_zhI+2oBMK=NZ6(EUCU^QOrxJHzyN{&I6gi!$PW{dW4N==UC?==bWa#PO
zB++YPQ<b0YoxIY`k&dQrnsN{t;Qu#a8$Y3+Wuv7pRk6gS1{13vqMY~rawnbA9Dow{
z5Bg`UlWQgEcr5znp1jraOOnLJOOMamWnfx(cj=QRDGgMgP`Zh?^&z$Mq7z(zv|16>
zM!Re~S17_zywL>!9Q)9~hb|1XaS!uwLhA=V5DnhtJtxl(U_YjQW?H|?Nd`T(Y!Bij
zZZ1u~H87po$ZNkbxBWGchvLfn;KAGv&Va6X%^%KfK1?s*kfz=jkLG^SyH5QDJf7Q}
zz~{C9K{l!IRc0Wyu0440_D=o;{{O?j4I6FTtTufn2wwPf!tA;K&UCdl3{FO2oq+^*
z-O5;+xlOGxDGWVf(@NpqvG6Ck?wG7Kg5c2;Q;+Qanbx2RftMd;hTtsQji)rzX9P@b
zP6+)Z)|k|Heq%<yn$|E|zcp=iv@t2;{Kj|+qHWP>e$gq@r3j7D^~jss6yErqDBjwB
zP!@ZZJmerEE-z5NeekZ5HMqp2<QPryY{}_Q&KaHl9j?+y(OlluY*GB}2KVuorOLvv
zhv#^GB;x|sZaVOYy-N=TkK0W3=Idoo(yIkD>L!z+N&Tf7bggi-pmx^N3*E<>Fw;vU
z>#H7E<|%6C=yz{YZN=J>_S%gjSycJ^C3?=eYC;^saa^$_rF{NOss(%WMhOikDnlg@
zWfm)Q3>?IRf#fLAi!AGPyPCYo>>Z5c$x*wKIu&ko_BzbVun%<RsaE-`iW+nkPSptk
zZOAacx-Z=ior5jg3shs&m*#lHx3*M^9}7JeU{-1jR<$i|bAkOrjk=uaex1uag6xNt
z(9nsKC82oX!$^Mu^(`$c2^ev>yM3}7nZO)(Mf}w|51E4yy<u+B4&M+Few!2d`$EU=
zGgQE?0{E*MThPQ3F|gd!|Dr|~j2o#~kmi!4S`G9(jkd3yzO8zLO^lT2sj?Y@#9FX4
z8UY=-fn4csjxk~}X>ML1^iA+Iy8fF1gH;eJwQ~N?g3XPc#iA@1ndrUsKXn`bY>~Q_
zo!aUA9A~F|UB6Qo@(;6i^ZrqTcB6(13Qdj@e=ij13(etk?U{chG5*gX#EY|kUj;}v
zSXfaT@zu?%loKCsR=QZf)U3LQ@ia=GNu=uhj0Q+7i8oBgbfVi_RZ_XuLCR?yJYMUz
zSDo0$D)f%d`Bx>(CYh)+B}`;g-P(4jJDo=;{}YKM>=I?-LL(w~sdd%!5mo2Js^U&D
z^|H?YtHyng6OV8i_FQUvqjyFi!8)3cu!Y^Jm{4pT9e;Nub&4z4s&MBwb;<ruH0y>*
zUtinn$@ZJu&N0L~%zHroS?W@&1><iV9B})l!TFl2A3Wk5=8XBj>M$@-7tcgdQP4vx
z?I}7AtqL!Ki#5oox$s7Sh~r{3O-C7GAo+GOeqLpim>Yu(s=4o~6}7|CDV|g5>%*Gj
zECEgiQeOqJSp8J>WyPW9Y*Xkn=^}Hm39$`UT=izxHW}eGRn65TpRxf+vy{N!E!gn3
z<SjK`mvh{Rm3(n?-;0+-+_cYg!UsH)?j*hH3N=w6@E&xXpxK&OTFZ6$DtjY%uY2+O
zSl=QOsHm&>-LCAl8(dHgWu)M;%Nao8Y82iqUoCP*J;r%oA~PT_I4orSv65f~jfs>9
zk}g`RF*2ca`r_&Ur$J)2BI+0~SkDca>+T=9-pTqymrJ;=q2=Dr(c$6A9xwou5#2mK
z-ap=pL}bm6XPZBjy`vYm>Cmb26?0#&qdCz|5xS{KI+vpo=qjCzkc=4(uHY$0B{)~y
za!V2UJ3$8A$w699yGY0-H@4%k9!Y5BL~A&acVXm*<VK;WIGg5Z86N#>mO0#$gHU0J
z-A!={E;2MjPj^z~y*m1NZx=+($6TT{)?~Z$_XLZl3w~HU7B^xG4)Tm%cD#-7aF>H(
z>ibvoS$Fh$oFtMR^eFQanP`eK*RU=AHyx)WEiE5~6+O+L$=l95Vl%bnQn}>4J`P@w
z-PiV%m5C{CH%7mq))O;Jf))((;BSBXTe80K!|EFRzxB<>5B|FD_As_Rl=s$cA3+Z=
zq53`uuD%ZvLNbwxa?r1H0%XcOXB=@e7%>UQgDF%-EUP2R1>pr#I^)I*^5GQXjodPT
z{t9ZSrbj?D3+2i)iZqlMZw!e-z`VWFf0qo39%UZ_353E#qam5tyzS4u9nP{k|C%_~
z#LL-lt9#ZRqIiwOc-U3E2x47+4X3_n6_So!qs*pVpw>O1Ar2Y6Dd;IU|J5kiXgCx8
zz9P-W1s0X?zFV+T5k|(&%VDfszG}T~xGK}~9QN$8S$Xa=Rd(+di0AS`46BiR8a5YA
z0Nti2S=_`dorVT!#Z<4Hf*2C%YcE;!dlyCyNA`VaoB{0NKuBvvVxe%5q1!&C-=IvY
z4HJ3p=>)uzAR6n)ADHW?^7_X{P!`uqj=i$Nkhyn{vSQaDoN{izd(uEG9?oS|z7s?f
z$oO%Q(Ya!YS6YghMzq<W7+lS!enUwG&0%iw&j{*`R*d6|j7EFE{tn<fMbs+M2LES{
zxAGyozWtcPY*<XL=MCD74$4(VR%E4hsSE0++%K?BCm~v8x?A(6D|Gz!^F@a6GbYLi
zc5A4@nE_^N?pDU9iE6#Mv%Kvz0h$kLr-@$hqu$)zkB@gTNynE_WShHtpFN(z7k5DG
z_IiAB^p9VX{lgbWHewrtJt<wnjwGmo+x*kD%i5Y6^%wc{a(1=~pWaU=)BMv9kM3&%
zEc$e1jGuah^=1^HZ*IR*-N}Fz@TlT?g}6p%pz=9819>95?WFeWVKK@D=4##JCoCM@
z+(9`zD|?gtEL(s;kDbP5yfHkRoh>}v^{BVdNYu_kWRQN$oH10^e1i#(Ob%T5b_N9R
znp_^rq_cCfe|(zk?md6~vdvWiImt4zf~g2qDsK9BH`WfprX#!y$xWl0mBLNFTsgd&
z#JGX*8qcFK@sq@NOo(40SgHNSJ9MfntGt4FtH6x%+)<Ylm*uWWx3q{mi&xtLbMyA5
zyg{-BS#q%Z9AUlp^Y%dvh@<#{LlI2tXW}tO6?dBTieMAEy_{^nc@j*YgI8>h?rd~1
zz0|o1|Crd?UWgpaTB?k=Otrbx*KRPglJ4HVmr`cPgKLcji~olh@P%>>GrXLNZBSfg
zT-TD4$)LI89Md6Zz#A81BM4${T=v$tDFaDV!fn*VfwDM`Sdu}WQVMPvQY&s*U=vZ^
zCa-E?)wf~ZMs-PysguurdAX&@g+KbvIZ{j@Lf2wW51yvh65>EbT9LqLJ8EQ@YJRGK
z;6>-*q0{%CNu@#oRF=n?6YbF~2dk?I22_FMurr+uR(4Qwz&b+`*5`FZ35c=i4;Jwe
zBb%Q#MvIN|mgmUMcaAsibDD)fvpPRR3<(9n`2If40nb<1ssPG?Lh^<jB{iMYq{<0@
zpOHEz{8h`R;4gZSM*RKeg@4$z`u2ScdF@3SE>%%+ZzOe@$eFX3x)xGI%ei>zc1T0L
zg0Diiz}TH0EcaK^9aKpI{;E0?JOQL1M^dSy0<kMi$~V00sU9!!m=4B=P+ABx|JUcw
zb^f)AcMPV(PtanA!EzF##)%yzl`Z9Zo%MRK30T|UT9Sm-<+hJ<VU**FFHlb&sNh`m
zoPA%f7Smt#7{&4%hxsx|BPvW#<OnV3Z(6%-Oby11cBCM<$qW}4%_r#O1iRgE6yoOt
zc|FDk{sAyH2}ai=P!w`A$+%T?Grm6X5lgGU2&X*9ce*}pD*kSDDbz{si*#_ff3RrI
z#zjy*z8g0Y|F5wjSlTb0^do!nr($TmWBXTu+s#l4q!s){Y>i>w&I;k)_Y9tnLDQzM
zBVQ;t>th;D_k1?NoXW`(GuKN>|BLgaKkFyPl0gN*d}2ShO0;VUA=zjK0!22iJg?R3
zyK&qXFuCM>k^_T3xDLz`vCFU~b0B5aPmL<bnEEyK-yk1-2xLMr2Kasz_OlZ=t6os(
zq3vbt#R%>MxS85?fEDKqt&c6}`Z4WNiKbLjS4fJj?|YoS_K7bx#gq6c<1Fchlcwjv
z@LS+TP{*+SbHe3h|K4b6uvb}7a?wF{K25UzMV8!ybCAKpD*<3`M<)&_k<+`=|L3HE
zHUwJx4Kh<zhG5^4koQYIGwZWr^7p+3k~7mt3nXYZ$0L@c`HRyt6PQ8=Gfc+p<q@pO
z!;HUL322@qASZi$jec=y7O<D91vJxf8*@>(_8})h<wujD5?i%X*X9jf!1-;ao)<sC
z((KRo3uAT&y*jr%fmp95S#Skj&K1b#_gOXV(N{S}o}$ZoPW3zjC=NA$P_?7ir~xHH
zexCNSKcLQ$V~NFLO4$(?IA5R;ubcUhnNsq7X02CPP7W1oDPkv@{`0LZty5N2f~tx$
zf7foT2xI@fd>iqjp6kLP`xbNKpfT><^IWV$-YPbgnwiW{!P8u{uN5`}e_1D=YL&lm
zz_1Ke=w&glv+;aD*SNXd8i?h>!)SW;#Eh}v5R-+55Tz%17EO!6z%HdtS+UpG7F|+4
ze>_fan3Q-6_e%!cc@%KY?2N*8OFvu|%D>>GMhgMKXT?8fM-#y1QL%y|_=<S6)MDkR
z=wiFBdcG`*oH#~Wen5wd+P>v|ZJ!YkrH*OEKb$gB?DBSDYTn0ZL{-FYjlC;q@>*!~
zxcu0y2bj(8obCYPxL;2`<9x47(yQ7{s<p-3+%4ePZF;T-H_z{$Gk31gd8i$P8+EDC
zEhy_sul%_1#CJMBFWRlK=ht*C?*kL=!u_uF$s6K^&au(0M;I2PqS|vg1{QrX8+OO(
zAe&CH$M8`XzkD+Ht1g=4>OQ5Hw}rzcERno)ZVl&1BkAl``!SiVOtW&j5K(}}U2J^A
zY_wIGVhRTXvoF00S4d4?&z1z{{>AzfgT+_w71`c7{8M^+tS)<;Zz$d)yu5Xf;}j5g
za>G>~u)y+7oUM?TU%&(_rThb@7L-V><CI*VP3?JsvOyBSq`8{eN0z8Xex7ISx)iQ*
zwQ2>!UsR5-WU;7$V~%yDM`hkyas9GxX4vGb?m|?j+PpuTu#3#+GVm*t{@FrPy~w7}
zbpHIX!FfK&Mp)tIGkB$OKCY)W`11Bg4nA6usyz!WlSYvbJ|C!O`NfCqx}Lq2_qV!a
zv*Fw><$dkm$a}dWSVxKq6innvY9!;6;3`ZOnbL}M`4y-3nP9&xrgLE=?{5Qk>%w#c
z;)q+-t#N*U=WkA*RZl3V!547g(CrF(oUP!I`urJ~v_{z1A282)k2o*9Z1ElK-|CL5
zNx~Am{ela4_g2#hqq9Sh=<6?-&>VKp3B|d^3BqXlqO9*$-rq_Ba~#)eL5JV&9K7zF
z?wxdBZ69vG#Qz@c?qMF!ieirD!|^A>e*73ypBQk03QzyBScud|P%O3R1c)`(zu!uh
zR+d`mI9O$Q-Y3tJ9Nw+01e2L$aK($e^{aFQ^PLzy|FGYNX{=x}cpN9WhgpV_kaa;F
z?)%RI>1XIf=k&Q!j0V>$?9@{>s%C`nJo94JguBYsB!AnAsc({SgLhu-c3&K9zk~<)
zywg28Jox4FCM<HwpEl#p!S>I4b0$1zzILh$TvT<l)=obE`qk<1R<GnYklGvO!@YF#
zn&Y_GRL&>G@QY@F9el|Iro|TxKP|p=^@}SY=YgR6nc7KzDy)e8(y54I_;yoC!nxd}
zfu1{so7B^D0CAOJNzI$Dt{bMo-P9Gp#$Uxc`)2#(5OYsa<)mIZ(#q7~+>%C=aJjz*
zCHkCRrlX`7^)eKwZ~o>N9u`A9I8i7MS7H^_w6C=!hl>oKVjfYdrm<3H<8(q{)adEa
zPV#JXq1jYcJzC$oN=6%7SD&RFz#no4S6sb;?&BDHu`Hu)>CKHFRGEw`_VfzfuE;j~
zga=W}>=l)8sB_{jIT<P;BDUm{z<E&Z!&c~*6m)^1`fe9XTT3nLDpT_<ts&%jey<=p
zFEwKFC!j5K3bq85s&iQA`>p_+X7c}M@8A2|Hj+eP`23wu0dpQ(q)f?@d`Ti-a%73N
zwUH&SBqy8W`0xjjkc5~5I0PwKnfUqt`CRW8d+XL$G(b?cGnw7N?l>aQ*Xru(s_MD~
zV1N-E1K*meh7_KmC;#V>KWgFg&*w$-A(aQy=c-7wJ779a&`{&EMxz?}0<bwpBSenY
z{~6Fxt<>EQHyhA(jbdeC2DFm-{H1ra=)j8ff-*n-38OpOef@TC>$rClz8KDkKVgJu
zT)VZs@Bjz-xcVaM%Z+aP;LXA^Mg7&!7hGEudlnrWuq`VT2-OlRzxF_TuiqU1!eZsZ
zuuNh&LRZKFdOS*2@~iC68T0n5-u93EgP-?76keEPPd~1p$KlE>gYzA@mlGKIp9k(2
zyZ_bydH48L|Ly)^Z)^M2*7LodlIkCS^SAVLn4Cs$k9z%sH@*F%qrHZ+n~tgn58oEL
zAk5~N3i*bqt5D-cG8E9T$#j@D6XQ&Gy57w@y-|-h>h1=e-LNYP?Xgf#oWXhFjsTxl
z2I=^mHq2sE<61ZAG|dXKk*-$b8g%@Sj{6A3{$(;rPdzIJ*<#0gN9+Cj7@GKK_h5hV
zna|Q`a>MCU)i4bHhRL8#zmfkm8q{UjJ}hDtH6~pM*su(XNIr7Frl0tSuR2!N$tu!C
zs%)U8az!NG@K=&F8{25yuUu$gLC5zOB53FN)e5@V&RsAPWwB<}ofkePyqFc~ARYn4
zIoNBByl46PmW5z%66NNv7i)e!*n9(pii$q#Ku$93VGi~hO-8FtW(%9q(!1;TNwEYX
z^}FnSzSJSC;h8kCL<nDS=nII{xqw($$rOvbSx_|BcOhj}2R=8v6HzVWRhEe5bkni0
zXfKsjJ2$C+X|yzf{t13+l+OU+_`(GS>m!uEaOHKd7VBwnvGDQmFNj-!ljv%7mSL(E
z2@etFljtNKT25-vU4go!O+wRP*g<?`RE?EkRU7Bta<rFzNHAEq@w1E2NCe~m=Hm#%
z$p&-X1T;$)G{510zfn*uTbmpABm1`42Ci>UB<>Q?%78+1tQ3@E{$eH(QIe0?P<oko
zHbkM&(lBkhW~UgbDNy5x%?U!WQtc>pjzK|LzgszC>Wc>LUhb>@Rrl`5{pOA**Kl}6
z?9yP8I$<a!3=f6jMl_8Ae4PUW+p5dA7dKNS+v<QS`xFRt(Qf_B6*i-{1=foxR^L@V
z8FECFrImOIaeQfIwxm%$vvJL*!!2?RGHy80MSLBhI{YMwiug3)88SqI;lfip=pn^{
zBs=R~cG*_r=Rh<OO^q&*lI*e@oxq7R%&D&&PJfEu2r|&F4p&nk$Z&qJeFaVAv}OBq
z$-l{-Sx~XR^%i8L-u_QAPNF6jIDIGw5Xv)fhyOTJmTPg@Ki9;Ol}4e?p<jAO-eByC
z)|eFgVSR=Zb=_rV8VZ#S)LNgsbS#)|cx!U@0v6^7oomY3PETg1@7C8g9;o<}L!<;}
zk(+~sKC%1gy6+x^QuB~}^x|Qgtm5)EIr4P6&~_Kw_MP&i3LUr}>C-2^F0-=k9};8A
zk7&Zw5Zb|{vtc|zuVgZY5Ad3fFP{EO&sGBU!*3cm4Iq@z0Sc711)B`mz@5iZ`=^}G
zQ-9N<f8Julo00kW?%>Ta2q;JIqjzY+@eYSi|E#XAzJLFoDn-%CdGrL&2RwY9@jQ=`
z35+LFZ=<$KfMH@LcUD#Par6ZJrJflGN_Fz0GF2bl|Mq)RtB9WPf%MF)CC5}7X~87L
z+!lHmNXW^#R<{yE-$MALoi~aOPIJ1+qxd7Xe>Ue2EvPfqPT)~DbMdIib!P8YR3<X;
z683#M$up!?)eU0W4%8Qs7d>8-Qd}cVw&_GcLOZ&yZlev@ev(s$LJAx=>~brLQbyDG
z0|0D{sThVyHb@Ml=*~NOg8#}wzbz#AGJ3ObZSTRhxQ5{^;lv_Ujt0228to?uAn8hM
z+M_wx(BB%RF(pleRlze7-I&vYY;sMQt}MAyW062zx<Pe;te+S8WFYbJV3_Qa;vRDs
zP=~kl(ecjie$8_3o_dgizZrmZR3c`D7q_}eYt_x-UZtZE9+~M`1`9gWvzr0vC#khZ
z6uQ4X+|`9(eb{GDm+NtW9LsoHv5NZ<UN;rGZW=vN9(7WiA`C*CdZt%#3TLTROgZdf
z(rI;o)PRtHHqMJ86*T5iT}Q<XSSxCa2L-IehXjWNbV3g>i=GTmYyd<%Zm1w#@_wo7
zBXs%Jc_1YU*nPnBe3}pP5l47Z)jyW1Bk?B#F0=e)q*)ol0MSqo*pCU1b4UGz6`fus
z2|7Y!{u3DT$!zq2<b?=BW-=d0^u^G-Uw_Ta_S;#Y@kQDllqTDwc!H5I2pki#eVSuz
zy=Voam=in9LFFeBg&mn?(`FI?Af0A-GDdWuMr83Qw3QK(V>waQ@;DtaVg^*wwAE3o
z><$_Z$dgf8oTCi`>FQ9)X2rlVWC9h&bY3Z3l8r>vD$R!JAlA9lp$$_}6tPc`@1VNd
zThTVWfqjKB=OcWNSS^Y_Brtwu)Ehs6f1vsf0S^6~IP=GJg76+<qXW|@i%RGZmDFx6
zj1`hn{1h2wma9LpPijPwfG!bIL5J!#i)$Fq#mW^Np?YwW9GGluv=Ba0xk?b(ipS&8
zwVATgn(7v}2#54*cY)Ai1(l~`%14h=kSsdR;(03oYe0dFZIDr>4Pdz8HUD-O0`<;z
z1JRoa$K%8gY6)xVTWZ+o37W?|Lz$$IxGk6j?Ua&>!<quIm4a=U>*f0D2JM}b1i;X#
z27HRzg&}Jdq$N0snc|$MXXi;l*+ekbWr0LZ+3ElQF^6y#wSR4G{@Uu);LA}W@p*WB
z?e(G<buftR7&yS7fEvXoXqrH*&viD9KXO(MAn5EKWN%kbz3qdIRnSdg$E5{;_y4<r
zty|q0qKfR<0qIGEAR!nW;4tVN<voEM4*=(Ri*70IsXzyXq^?#cgoNBX-Z^-C3@3K=
z2vOpWqv`b8;u6^j*($_Lm~@HyGf69U34OR7nf6R`w$riI9RG&Z1Wt(~eGVhw9UX_Y
z!lD|*r8{!TM+PW^$qadL)(K&0o}XN2&yW)$+Dh@OP!47GfdY-{xTWgkB#g2_S%Xh{
z>NIWAWT4Cdvr^Ja#*C^vs4TYz3zDJJD5XvUN<A8p*B-{d7c69%WfO*cK~XzVHA1nV
zbYtQIXBz8q#vMk)m>DIC@{(q=d{$s$L3A*}o}_O5DTQW|EDXV<sWDiCI5XkBE)&D1
z!7OH34gSHpC3td!xH=xi*BrSs9+52;Pkc2xz=gX?S<vS_kx#0dWL&}RX--SnA}Nnt
zu{(B(cFOCN<u$8(eEdrnC!<`kh}sFDasRCgA04&Dh!i1IGsKkAN&(uRB~Ikx4jt?n
za<#+RAR%*3fXPS=wVu=<Z$?|DYi`iO$^#2gl;d|q%4iFL5R<2{pdT#EkTDm8+r;SC
z;L46{AX-Zu>H`*L{UL&DHQHtXq-bx8ovfrKG$!|aYV8O%Poc*lmagpl-ZiS^kI>6S
zwDIr}9SD=+M#F0`I&oHyo}l9#upvic^@Snf;sLBE1}h%ru?VSv5Z|q>Y^))k17$mz
zxh#<iR;wSYIrR;R2k}+RYZofl;*gI=#3Hsrv6>y8FrTE<I>(bZD^8IbfcUiYJQ~g}
z#$0`pT;x-w65%rzPAp=kYCwpmk#=l_Q}Nf<%CD3rh84Id9#VugOJk6ZUC}}h3AZ&T
zQ_v!vDC&l3#ySdHUE}(&Mo)mm?`En4PGAERb24T4v%mr*AU;K6i0TefnFGg*!D?%!
znB@{xEVUqxZNi|iQ<0w=;u#DTlfteN<kkpMAdo96xT>$5j22?2_hReq-f<t3`}L1^
zU-#g&sZt3dRFn&?K_wzt0$Tbs%JUD3aiABXN6D@ul{yzMV6Ykx6q_?p9;=Hqjw+zp
z1z%8LiZ4JD&IeO!RyoWPT)#xifoBWIBpmE`&0+5SP;AgMM@*x>_3)H?Y{OYYae7%Z
z3Us7W5$uuNU&J4I<SXMGHaj8P^5}GCu?Tpk*v}rtZv_0M{+U7{4LI7~+V>SXI>Z9%
z>R4v}5o@WpGzQZI_tv$LiGl?P7;0uEH*Q8vvD_)Kf$m6-NTpkt5%N_K@!DG5CBX}r
ztE%oEAMT`U1PP^RMUM>4Mr0_eV&t&v71Xxc;*UtZUeJQ*32gIc(cvsZE>EP8izF^)
zBq~U05w{y~QO7VpYKCNP;E)J$+*!vL`79%(_DBq0S2_YP2P2h46iOLm7Ibe0#|LHd
zz?^zq(K^fElyDwW3Jc3hU2%E}YKn0l8|0KDHbHi8S0lqvKnJ+0l+8iJsKNOp&oF<m
z-4w1{HP8&dX_WW4QBFp9TfiwJWR{9ci6=Gqf}#qt*vRbzmt&4mY1*e!N}KjX0Q`*Z
zQ83xT`{*6uKK)hQok|fTPOEyE=zsc_vt59E%Gw3fvvLL2&rkBg(Rum-%HZV5v!y8~
z<5cfN)Umg`R;TA$kykwn_k!5;O}FCqBjOn?8hum@sxvJT68t*qy<5Xv&tt|2zVXgz
zPpgBF66X*zPj_r9KO>XMX--x|o{S_fp`Vtpbd>t5B|gT*ri}ir?I6YzM5aj*<@hpA
zN3IUmUG_px>YG;YBcFS!?E!4kd&zWgk5*<F{b60_t$buZv1|S&HO%+3x{oU$sI09;
zBNRcQ6pi*{RVk2B)=3Ql{Zq_jyg=ylrs$u~U=o|<s;;n)BVGEnmCZ(@m0y4TxVC1z
z(td3%u|-&*4Wc<0*SwckM?fIp+*!weHX<^xSjT@h@SppE>U30^BX4PWbA99fgNMsY
z2I5iF-iL8++S@?-)#edey;MX$_I^2f_nryF*5S*a;BR1WFN%(7kuF-YT<>bY`ZHh^
zv#vEX3R+7EOl(ov?BQdKOa3dRP6RGGP>fCqTQh~5#9*3W7PUphFd+p|;qRZYnWet+
z_R?0Oj(BqMGaLuMBt@I89xjTrE(b@YE3W=2YIH0M50cX@PaS1`f<ieOe;|OYn)v=S
z9u<k$TP-VFkTC^4r)lFgY*t*E{1;?G<FsPuNp55!ai`Wo!ZEp!yL>k*nlf*_4Ro7=
z$}hoOmxuxl2FZBZ*^FA<2!N#+_CTf{ZB(HwDjL{GJdnCr?LKB$G6{cWoMH}f>nR8s
zmQ@L5+CmoVw9`?6%(p3`0>YPVIVSNnV>((gbtAcwh>Mk!_&`#O;V#ELgF?$ShVK>b
zd6h35MTbY~z-;CBWRiEult>vwu(b=_=MGsvA7|J~8VXvq`i&Jk9f!CKH123vY~e`J
zP-P3oS(Q!|Uvq1=oyGEmtaaeez9hR+d9H><2gZR7b)2xjV$)elcxBtR06w~1sRz51
zXkWvMz+b-w!+xnsA*)BRBVAef4O0ZJb@Z-=xs{ufVf0mrz-L*Ua+q<~HI<t;(-@Yl
zsQ(czZwFp+#^=~8>R{7_PlzZZfgHn!bVI&C4qbuPy1!r^nefv>|M7<jhb=Z*UhWO~
z%#p(F$m$d+{EwRN7&=@x6)-^_rP~r@etWzB;^1(*SDVL&1~W=YbG*%+QrL0dBwq$y
zH|t<li|SlJE{<3^t{3PfuohMp?TUnHDD`Ynf%X>z&EnIv2BQMe5Ka;<DlDuSU6Ya3
zBw{j_a+t-#&)N~iXE8Dol-=VD1s;=g9o{<z0+yX|$Oc|Ajn}Vgz~!Qp*h~FoS@Jpd
za#abmZ30jqwq04HmMI2TVKSlJL1>9|UXSr8otmVaz=2$*L(Ap{ItI~SJQky)og*W>
z;YkIeJu)-1j4#A9WYzHEk7QpUfdw{?Vk4j|t2aRu7$AKboYN%|aB|oTTCQavi;$UO
z)N*gdFzo_xxnq=Yk<ZKVl$xHeMz8WKx=lg07F&Tuk4ZyeiP<_yC{`tdHj3qDbFN}4
zgi=yArO}+Dwe$s`64tiV32oM=w$LmtpKw!At0UKXVy}zhE3D!LwiH`e8Yk(Q2HvWF
z$m5nmSZyJ!c#To^<Rg8VPG}XRKWr|pLOf6{Juo1_B*NAtKgP$cYgH^IHKoCdQ$(1d
zSl+O9^RoC~Y*@69lW}rjTC^yoe%$W~7r-y?*4Y^X{_lrqBif7}QoKTM34XA*v)H8T
zLs)gv#b#G*Ggm6PUM_hTOLnnz;--l+Hm;Ylm3<~aN;tSroeP)6`(Gv1;jM?3-{$_m
zSoL;QibB+7j!GXA;M~hcM6=eWGI7Vks27l1Kq@~GL*W1S-YQ9FfNPThU1T_#Lu?4e
z6(I!HZ~(TXVj#LdePcegOWY?@9HL)lh&Jlp3gzA1gnq5mR+t3ZXI)D5C`~(bLXNyR
z+*SJJdU6GmYU%1(9&TXGYrwOw)?(01Jim<0Ygutr`qbEB?hjF`1vuTZ76yf=QXLs`
znT_-ZST{K8ID_q?XkT!Miw@8A08yyDhj)R9+hwGqd#UW&K`Sh7<CSkJJ{eF=ayi(^
zr}*PdJUzEu4-U6q?C$l@fVEqCDVIu?JA!IYxk2!*<?mP}T0X_3BB%KnC;}Jmwk9oK
zh!xKO-R$YOlrgG(3PUd1D8~wsL~*o>B`cyfX%hR`Ul*3dzA1s9>6f85*x4P6-smPy
zRhD&>pvt?MwlVGCHLs>fThztGE*bP0I30}gB0*@_{En8`2%MdglK|d3mKI)a>t*%b
zEMF$-`kJ*abZ(kL#_P|5t5V$TX6ZBq8T@zVB9-E{OWrqP_1o2^@Y@HkUvKU2SiBL_
zPNl`6OmdjI2=!OMjgiVAqg+PX*$aS<oxXye6xU0yrpXy9-_(2lU}X)F4XKG6PBP2W
zB7r4*jqKSTywENj_SbE?*~Ejy%7g2_3e<ar#86i`w|@mnWBxF=#;O0NW8i*}F^{O1
z5WzW8Bty{&I=uKkT-h5rPIGAy!z))|<Y=*6<f$YbuXc})1H?nWcF6}#;ogTN83O{W
zu!7jkV{{c?<IVY5JQ<EK^DYcjeWY=SvD7d@%MAeF&>yXPfZ;stX;jb*y%evwEYefE
zUT~WR=&tMLR+WyC30qr2E$O~heq}f|l!rAdG~vuZ^`=<PCc|eD9=U<3;B1NM6W`!p
z*Gew1mbRnpw2d1cEpo}TwItU|dbw;ko|+7EA!6z<<HWovYU-2*L>`<cgAXEap2wGB
zz=C5_L_$=-@TYsIFYD}+IAFs2({#f2`k~aoG&Id1g?+J;$t26G^chZKB+Yt7cNiYs
zXx*pzR?p<wjJ<2<g%`)JCWCnz^$xf8U-nQtWM1v=<JGOsOCLR{@Ge)6xPYoK|Awat
zLz}KzwEL!;C*FU8M_Uv)J?%&1JmpRFBpClGYX$5loMzm@;(%9urH?f}Rhy&S*{2dd
z|IAmYgvsa#iZ>C15sC#Q6=-8DAju9@^AQ&I;SlenCwS*wLdd509Aw-TWH4q2=ZLOC
z9D4-SK&04)(&pWD6Q`g~V6Gq3fJ4RKsDZod*o444l&$J!Q>|Neg0gO)Y8_;`JEfy$
zYdEah0N&wMu6qQCR&h*K43sH!b+}U{|0qhK6fW%|kn|p(&?S}qG}`Im9d04mJS-0h
z#ebirQ`W?+Rq1a+)$n3dsx`%)QmC2m46uC_n_{z)_ScCOq4cOUj|Sp}{WK=O)uh+n
z{Q)S#DDe7P0kY<tvvhHFC)nIf3W374`4aqRQ5fR0&@m=5G9DA+90$w`&gV55DWUK~
zFcYI9vWO3c^T4O}1j9#dWVAe4l9rd)k}#;>T@7t+>S+#EQ)rv}`r6n>1YugMPnjmk
zO4Z|(@h%D1LzkFdrBag4jmk=MGO1hTO80K_=zz&RABGra-K~a~#<^`QcQgRll>%v5
zeO5GrQULu!h(W1(05BH?{?YDqp>8}b@U}L*Z^Kt5E9w;HJCnQSr@l1_HpdC&^V!70
zN#zm(3^VFt$tn#u2H7m0rdd1+qy946UsrCNfchVEJ1;<buy|NV&=nAQ;vuD251tF^
z(dn48w!0&p+26*qw=%p?)hH>G3@adO>$Rel6|!na-L<lWv<w}q=|cD{WW=$MX~m#e
zxFwQyq}sEm(ZjX1I_}S-?WN?F!33oZ2xa^B>c%N?Io&pAr|rm~?ybAI#a$@Wzj1#7
zqT@+Hh^+m}FUcv`$JfO)hS0E4BPexj5%KNP3Pp9#l#@MPXW&mLXZ2ZmlyN7T#c?lL
zvploZYxA>X!@xM$-I}FS#CtH2)k3y9flF9B=cuKXzNK2~1T^}=6n8F9>sxK9c2#6W
z$scXEZjBxPL}xU*&y&|(A^4b92Cs+AHJ{b3Dvb8QgZE;`<%HF7uiSJrcw+>^Ky|LX
z8EhIN8r}|8nQ>aErHyK^*{_zuy>}_jg<m&&yJE2FaTD=S?x<}oxw^^-Ut3T`Skb;%
z;Mq!aYJJ0~(SPfrJq6o6bjb<had}f1QwB>-SY?Ey2z@Dh5#zh_t`$CAh%n>nItEsv
zAQOgC)&~-!@DBiOPfP$5b6P5^I9MoqXfv}6S>QWq3}R1!rY7Yklw~+Hfi8Tu^?;dx
zWfko=;E+dqixHE_E!lfdExH|#N`2HT<{tNw{BG^BV@#uO?4(KUAHWyIaiMG`#ZJ*C
zzSd=#wYt`gnOgf>?hP5&t&eBe+Ky2tg^jbW32!YoRb*AWI~*Cuz9L0q$2;<Bf?SD0
zTiKzWk|8RE=khP@NNrt`2kljmI9dFv6e`Q@*S;vT*JAfn*|Hd%QE1e){ZkyzlnRrk
zs*OfURO0c_LKOe=l;7zDW30{(vu$B^Em*X5w0*ey<~Z8vJ%9U>ykT0K-b+evP*xJs
zu+VZSNob%4C%>Vj!mooH#aQ?vJ6^-15PgFg{~oYlp|j`i{f>KVU2fP$CG8e+@~u)4
zwkDyKGM~t*cAiD8n)EHRZQW?8sCVfu*)Q2PCa9jU_kKXrP@%DMe({8UyL*2{H&$!e
zTAo0MXpJ4*^^*s#jrV%jC_11CS+{k2*y>^n-uA#7MRZiQ@m-Ee(XDvcNlFV;HbO17
z%|1as@-o5W!`V00yoe13X6H6M;#RfM?C6(OWn^X)vn#0*q@wiV0yZdM_vo5D=P`Q{
z5$5u~Th>vF&;v-h#)*>&A5H008O2>kLsI-F$P0(sB44=Pn>}=>1K<axQ^lwfV^p5O
zfXFx<s+(a|>|C*vO(<Oj6j^_w!PBHPs7eh2g^M0vx1C$cZfj%_(`Qjjk$$I?f2iO?
zh6{oBG|rMr4AFsW2&3v@paqQvni(U3`w*QIZ+HP%DvNcV>z~0}d+umofy2JHOkSzJ
z-`m+JKLP9o1epz{=<RBmY0^7oL#!$=P|3AyIRmz^cq}WwC&7W}C9;lerffx^(lF-Q
zv|TN(+RC@lmwX$l?brNM@dy-zM&i>^9cuYg<aq-<rdgA>D+Um9=J6u^c!XJ{w$X<W
z9VVfHVG7e-cFVoZ23R5)9!U-=xkN{IAdI6F1kygT%l{DcA^w8R1eS%tFrqXDR<Naz
zbZp>(x=;Q!gP)HcfYdUWO(sCH`pGySNVHni(!duC$%Q8M)AHL%GPpFYl4sOoYZ>T8
zALc=O;{`cRiAOf<S`ZMR(U={-W%)ReEJdxDCXcNJigtH!vu6}Dh75r*nU1z#!8_7)
zGQEDRsRaS*90<BnV@=Ov9bSj-sZ2Ov1j2VPCrSqP&UfrO+B-NtvOKJ)6r5c%1re6p
zIMt{9UVt!3;lL>@9mhqA_DKK*0?Sq=o>S<qJuD<190f>Ho~IPQjgW-y<%h!(>7r-Z
zslaDn0sX{cPYwXt-7)4<G?w%NapBJxO94#eASn+6p{F4t;G<1X-nSeuD={TxfNk@F
zMzg%pu^ZIWs%%h~Pz{<FeuJl@98gE{;W2jo%vthgLI5TSP`Vf`Rjo0|D@ADDhRS{l
zY;UG57~RsMoimBHs`m{=I{f>L%wu6n${mA9B*Atr86nM@iqBjoGRukvBVG(JSi8_)
zhL^U%3sfX2fGWPpNhPQbMEXEs*TmM#0v8B+k3*Pbx*s_U=nRA1O=+b=4eaOH3b|nM
z45(xk_z5f)eOKWX@csvbK4YZGWIlusx%e@b-o?-k)qv)m;S!j~rLp-9@(_2?%bMeR
z#Tp5;aWe3#A84rcW8H&dmhuaM)Hlb6eiaXglgAdg#RAQ|!dPrDNOY?zj~_dEtkrRN
zAd=IvTWCkUek$X^a!14BRa~5R%j*jC{oL603ohV7`(;fP4A?T9jhhuF?%NcW!Tgw9
zqai2|wyxjufZs1Ll!RBr2-MQaj{e|u!t#J$hj6>HpO^w~;sx`^F%oS={JATE%k|%E
zHR>T-y&A}V1}c5o)leIhwpJ)d{hLWXs8C!#c51ghKJy?WDUiGaJMEIDs#{5yGIl<}
zSjGKx__4zj$7l0VNsECrWZer}=^kp;dzW0{>$c)iyP7|R?wYp(@19@p1Ia=OvzQ8W
zkcKVZ%+?9WbC;+Y7?xW!&565(UmwVHG9`|_9fT<+OL^=>Nhp=tEd<7uE$HRvY#P-g
zBKOe!d@2oM3+yFY*>aejtAE58*d9xGW~dj(6RT!oSP>)QG#y9?5arHQ$9Rp#_%?R{
z^H-@ys<p+|sNB}eWV)42)2-9fG)t$~M}vG48Xj|NutSK2=^9RV%q(s<%!)1Nr>7jT
zPTU{$?>>9uRpSn3!MR9(Pwdg%U|^;XWF!J`oR1G_Hcae>0)s^*999!|r+GzXKTzLp
zh4KQuKw%Nv-X@L1=WoiN<8=BWpU4>gBUianYR0gQw(*K8aAb-!sfWm3e%5Bb`Z5{O
z<&IFX<>>TcN`YVNdfY8|y4xxZ!_*sONTmU|jC{ipl$bSGiGz%Z5hBJsplMV?m!E1h
zB&nb|5fj0qS<gh;=XBkyrK9uo^vg}6T6!B#8v+##kH64xYEHcn`=GCH{mc3w6U6sX
zm2A+w>M+gy>ihrs^>>m{GEF|K2_iW+txRO##<gFhA8%Y&q|eW&FItZqw{Vn9k2wtL
z&0$X}o|{7-Soa%OCU3->R(>82KFq4C*Gu;rcTeqPT+5bzxJulJmdEg~k?-RPumHAB
z8O??4-x9{NEc}}>z-TLn7yMAXd#~lsf3yZf09rn`<B*4Lw6f8ST4?0EzKJWoj)xuP
zf!e3v`^tQ>rPQ|36PU`g)~BxO1~*z|FZdBUS(i?zP2FTgW^&y$24Sme8Hq!=VG<~H
z{nPYgRdv|l3l6JWo044jDY~z!euX$x_D$w51mP~oz5EC3koj-SRHvgc(;E!MOfHf9
zvt=z;JV@+;30bKgniQxU9P4$XCwNA!KfPK9RKY*@pI+@h>&}W~g>KLlO!QFP@fH$v
z+aLJ!96^_lhVr{Kfp|Dv!S1TYFDF(v+EC-olB+(=0{<W*_T*z)kgl6v>tBLAExIY`
z^7vQMp^xgrWK=r>bLQb7EC{kvFa@k|@DndRD|Zfjqur^Q39C6BcW6SfU0~1Re{crq
zsh}5teyDwGrU9&(is)U{yE#EDaGL%v($OfDfVuvr<I91{ZA)Lf(Om4uKP8iz`OTTo
z%x_6#)*a;I>oUTe&{0q|5<Vzsq3o$~rT$PQ9a3X+=7@@%s&?`8>PBl_(a=#nM{N~6
zc{q=1&A~&zL1-J4PYhkRbYPfPL+{<=!U-jbsI)bk<`;C>Vr)swq#*pLcE@Df1i&m?
zNlLu)Su#D`d0wa1aanCTjJ8AI6m{3&V#q0bYwb~k3qqA)qIc?}RSKLhhAYn~&^~2v
zwiW<CuosFI+(EsSWX<R~K)*Kam=P2+U>g%994C{DcBjMD<|h!{KG-`rBx{GTV$R_|
zBnean6zu>Pq$lX=Wn|q0+Cz!qNszVZL}AAe_0&}c1ne~8pByV<XW@-;RmJkHnx#@G
zGQW;lNDe^BrgCZY!~+hzbB*Sz`Lc^4?(wHp44R#$Ui%qiCR(bu$~Z1_F8MNH1yzz5
zO!V#4-pse2M)tQ($a~YR{lu#M#QV04DPDu#RHaPx?|O%a@1vh5=ojUr`Iczg2;1sp
z^y+DupzJ2(b1^%yqGeY{5}X%LQ;<t$XjpYq(zq?$!q1)ZG~Y^OBWHA_!O4KQ3)ky|
zvNT)jWnfr<<x$bB@XAmVwRGI4=m?~T#B+&$Hqk3kjgwi?SG79d*eA+>V=(}KJ85%|
zOaFVx@&y@$;$u)P6a7||wR_RkoH05BQ67Zs)?qt~1O~NvlR*jCup@o{O7Hz4+`X$~
zqOp;htlFBhhU+R?;mc%7B2ko%b!J>PRJRy0iB3o^dFU>hXO^?ld0e1@*-64#hd9__
z3XBvW10^wKLoJLsjeBP)9TPXQ)TQB(ZHbBysKa$|%c=!3)EMh<gOUJ3K)t^x2?v2c
zu`vpq2&1E!=xJDiVFsMkVXFP0);Wgsl+!8}x+XS6l_^Z4%E*f5NaB2r)*DN_7@YBS
zNv*&VRHQq1RDUm<+1cH$*<lJ1pMjf@ZSx97fEN?n7wG9zRK%ujrhlv3YW7hn-mgxu
zCvu~8k9h5&>YNjLYcqp@uBzSvP(>AZBizAzzB|k_(+=o(xLUHZq@k6%D!K5kzjwAE
z$N3&(Y?NDcrRa6zbz*j!vX%4qnX#MuRNhlI?}t|Q+a*4cEa2LfZCuB)dE7<fJ4%h|
z7;~1R%)B{Fu2Nuos44((l-e<b;1nHkphu{he4MuNdoVH(s@t&*ES#-8qW~|C2O7D@
zU<n7BJOc6#;vtm7j)kXP%`scC4Dt8MGZppdmI)>|Obc>DbP8B>l;4Y$U1+)`;D!P0
z0oiG`YhZl?c+;K<fZ#L>uK+$3kUX^mXnyj>%}e79+$!zD$=>LnJXjKIs^_8b!F($L
zUt4Te)zSs5s%oGW;q*yXcyYMf+uxyJmRvd=cS?w=zZgb2^+#x|1q18jv&mi+hg)_#
z)n$MMwm|)Rs7Q%2$+)%IVdIgNj2i<Z(`Bkhri)aJOk3{;M^;1Nyy|5f)D4%h&<wB%
zb#WxX21JwtZaZSrDw_mW&<!C5!8%`uC@fAB=97fr@U2>5kc3HuUzSbn7la>I`g{P&
z#c?&r)TZFu<;9@HgRB9QOuZIPvQVC_e@U*u%XDuX!J5vd_$=$H8hcbS(Jp!O@rf<q
za8GL+0@e{yeobtgVy^g=@NkB+lBR8U1jDFG9p#Y_{D4jg{s%r~LN7~n$UoA`-^kOT
z)L7tP_0OIFKs5EQsi$>WYr(4F&#ps)|5YwMfU#d)JGDP3+jJuu)LFO*oyKy)3ga6a
zN6R)pAa_zLJI`N8`p>!iA;yBAOy?!$F-mR|;J~C9)xMUCwnDLprImNk20A3G-<@bB
zTIcYZ_m<3Vb~^<u(iOT<>z-1oluC(i#wyFP8EIv17b~}i@bBtmc+%?X{Zua&nl09~
zHm18`sym(3hr)1PNzQAXz?6(yF^3f9xkQ^_c*ijc(3kNSOf7M6xQdBXp&m-XcpZio
zM?lgj1~5wOOF%N0=yFH$ee-ofO44v)xd(9O+X$~fu&w-52Eu-r?R2_SM6<E$XJ<^0
z;WbiyXtxv4HAq6&BI4^1Xq5mju7mX^SclqrHjK0j80|QQxQ^}EH<m`b==1ruW{~mL
z1O?i*{?wkVJfjuSIby68akZVSwa0oPEi5)yanRzk%-yMD0lUT20&X}HoJPp66E(u)
z>-I8f9igVn7vdu_zb^;8Io#bpwrAAN0u7iG-BTn4RbS-u{QB+Q@vaGWnpyr6xK-+r
z;RroZDgSUxC^wgcg#rYWu1Gj0cAJd}TQtCyCDjzO!2rV`m-O%+W^#Qt?&j4r$kQMS
zfXceSy*V)J{a0`MrXcHmOa@ILc4NCY+s++zgk<mj&5gm2bN$lLmp1$@Nrhz--*Pwc
z*5TpSFD15D55)^Sc9zqPW)f$!acFZ$gc?f^;!Bt^6qVArbVpPICIz~%>o~VTv`Wf4
z+~IM`b7=%t46;1&NeACKNkez;=*71hmsjlxAB1q`1lkDDMZfuQM6m`$i#jb29iQI=
zB8t0irBT=!kWA4}-^ki;e&&9!HGEf|^b2eC=4tbMp+Y%0Q*WB#v6vb=+?P|CbEcV;
zQ`3>N=WLIT5MJuMTp)$0=_1K;`q1%miekin32r*M+Hep7wDRuZTE}}w5fLsOjHiqa
z^}th4wPa@6u}?@FdxEP*uyj;E-q^SE*=QJ9LFtkI;$+Y9G_vnE{hGIn&D%pg<IoD1
z4}<d9Tuxv<l<FZA;vXcvP<(cVml&8k;>TX^O@C`|_orS|U<&D}PE(p$xvo_oT!gz=
zb`y+a;1t+pV!4F*hLle+v8r%p&NyA`DTU}%Z5XTREeVK$f&@kGq_oK(98U5}$(ha9
zVA2XkrBki20z-RZ$5}G{F-gW-BaGk2thop7(_uF<Ssf4x1cW}2yWZhXTlQHey92|D
zyV+2^li1sKT#Ia^p88r6t{;f5<ZjH?*4yJ(fK?`>6%E34gpB4*8>M#VvnbX)y5T{P
zpV5aKvl9wnJao;r&kOHFv@-utx^OG=$<<y1hsg!t7U_E@`2~7MwoT9u{A)ocvUvx|
zVz*;@5I4UdQ#6n=w<*P9IZX(9g^pMStNR>f9zCu&sF|r&;bP7uE&_?Yw4Jrt2x$n~
zyE`2ezHy*7m)$@Em{)s7+DY)j8eli2lWoQny3WdH6b#ptLIuodV00W#P(AwtiiZ5V
z8(A6(_%h8$`BgHJubsy?K!~vN{^r=RfYzQ6NwlF9;u)rTF;=g-0)vu4l7eK`2$cj<
z#6&t^QVJeyO^I=P81=OZMWU10G=zR)PVpOBWoT;+vX{VkOcIZQ5O{Y7gBwyX>6i~6
z%;J`Q#6xeErGK9#Q9PLBMWM7rG889Mb5pFYcGPA3{^sBK{iou$E7x%vOdr(|=JM{(
z!urqm*Oq}^Bp2ua$b13$FOW&JXuho1?k$NGFNh^}OQF)*-G6b=V!p#xtazI+mz=8;
zb6%Lp<}yE<u?lP4u|U1I?PBLPV@pYIX%7UQUFNG=2nZJI=qMsf5*jHnsol!$tBTYq
zM!oaCM)~P0KDp&)x=%;%$rY<Kmp<!;r5(YBCRw^{R2hq*^nBTU!O#K$<)y6X91Qc-
z9hGaQ^xCZJR@%g;SbEyQTY)_|OUQFSO-94Eh9F>#qI(>|b*QgZs==s}JFAYIJC8zN
zdg$W}HYL&YRSqY{B3+RV@jezMUiJ;b*`?YXvdDoLVlWZBWS|f62!qyMM`&qVL^*ZA
z2T+~9l$UFP7z1B!vE<@`=B6W_&RxP&oj2KDrQyliW-H8Pn=UL}1gS7V%$|)LOS_s?
zZAN3{bF?_Exz$8KOUZK&VR+*y64yl5*nMSy(Fp&oDtcn3-?r1@Q!-NKzBik17i#Qr
zS!ju~X}S_iY>249&=p-PAvv6wae>jxRLHIiIt24m+$Wc5K9b;nXjt#Gq(VHh5rDpA
z7{%A*yhWk>QaF9j^DDAIj)x;wn23`Y=Qc;bH;z9Ci#463z}<50dQys{r)1YVjdtHq
zc5${)#Z>D#cOdm;?4)4f=5?S*X^P)sBiafXOT;5+3FDmWp71lJdgpBK2}4ZMOb^I`
zaEN^KX^t_1icKkbwDr2z-#P-!CJcr(T!RPoH!%R310l*#Xq3BeaL{;B%OhL08#&tB
z`l%OTBW?rd@ud!ID~(VzTqajkrh+>t1Bg0&vAe&u*FV}mIP5`h-W=|_<53gM0cXz0
zZE7O00Sw9zldkef;p3Y`wqW-5_hdp@x4FVNnVg~~(y3rW9zR67rJO^Z#2CcsDh0l5
zI=M#m+*v|#_Gly|*IY$R<W)l3)#xZibBQZJsGM*D^WIY?N|1AadmFH+`e}@6Q46bz
zbJUt*Q&{Q5T|h>o!a}Yt#V3V6&oWtk)b$k-hd7tZ?VOc=dS`VtE?*@}Fe{m6qGQ^L
zK|PL+?#xDX+s>!fFi-f7KD`+8=#`m%o+UOYCGv~0-cKpKy$&Q<KD;QdM3?ONVI<!u
zMBII&7E{HJ!KSd^X+Fj9gW3&e_f16@SZi3?8bDd#69qcSFB3(mlv}}w!^^Uvfkekq
z>m;Ht`3el#HGm8mbipM(?=GMI3~(%@z&)W>5Tz&<soG}F$YmE%6Wp_`q7-&9|11aM
zQh(k0PYo+%SupVCd5VHk+KqlQ90qoXg$;k=O0dLXS4-nok7c(7vy34h8}k*I`T;Zb
zdNj*nr$6j;*=FwD?oFHCy}=9ES4?G-atLF+*<qt%7MAGbTB+tI37-aBz8yH%_?X3m
zCe1GM(Iug$sm|tWf>|^IqU0v1sdw?K7JQCZpoKF8GT!A+qdRRuA=loRg9NF`Jf+_f
z!{v_Ku!=QUQgR1<Q}hh1L;z+yj5?v505#^0c6FY~Z{9_=trlja3P=7Ix04Qgt*C1)
zPc9s?8CBuFrqHq~^R>#AZXzJVnE;YSDa1K8h7!k9eGh8P7k{uVGB<teMo(H5Lpy9s
zZ5+1%u3s-hQnsAXe|Sk>pdLzAnKIghF4wVqhbPTivEgjorX&&61`w>D;*k{d>XT)V
zRkM_xMPMh8BB6ijVu?;7h9z!4IZ^o#L$rcpjn5OJy!Nv!y#?~K*qC5L(jFh0{LxPg
zzu<d#Rt3_>bTGO){M%N^F)mu2F1H>stP&kq)ptFrI@<y^Kc+|n&N7y}b<&LOQ{saq
z0P7^ZOyPt^>k|%+a;oT_+WTjdd^WbYOw<3eO$V=-wZ{@EF#P!dBgo?s;;aFV7Zs$$
zuq~&oG7uzE@6|*+YGh-t`Jz;$Hd2$86x*)1KUV;*z~u6_7qzfc{>S7xSRM~b>VOYQ
zF+UBhHKL?0`6Sw?BTiIKWkI=E>c}B|7Y3z73)9vLh>Rf&w(6+u!jaVc-mK%co^DdS
z=rM^wHeY5jWki=tyD{kCr9QZ7bNfqE^|_BD3-~ACv!IiQf?DR-pw|OV)lq);c3rt}
z&>2SgGr0ncEAxsjw=MPtPtlTAKDfZdKxt64J*Lo3U1L9<f?qvVxf3l4bg!m&w{x@r
zvlzCO62pd%<%FS$2<`u15s$t&%2?VPb1omgRCrD0317`4C!Ujv&6YP18dTRtCb+>h
zffYE$wuj_VP}-%k?V>xjy`1!5?bfqr&!XeWHJu~5k!h8>hi%A_@vRHb(82@C5vokI
zg9W7%N?;IwlvC&-kxy0qF(7HwJ3S@8a*8cOP8)e9hoy?S025eUUFA!y2^ybJx>WX!
zb}sQ$M_&GOGA8j5-qJXleUgNIweVpxL|x3IeqmI?$1*Qn9I0-CN}q*?cl1O)r@D!s
zs|V$vGg|0->p@7aG6mg>X!`>exQZx>!Iqeu8YB-a8HE($Mt(86j*6>ztg@g01IDT$
z%&Wj0Fq)C2%3KVeWm3tgZU7HYM#+V^S%{90+vX;_q{2!lP4$(-tD!1Gtjkz2p_FTW
z1~F_7!-k_-6=HNJy6u9*67fQ}?Zl-&HF)<<HTb@E;g&_G<zs1>KH|jtItZXq2N-?8
z3SIHt1XUs(KgjFHW~XT5I$wQ<Eqrd~!rq9p`TB0F#LZw^yrk&M9da2jf!GDhyAYJ_
z-hJ<~CZAlA7X)k|$)Auuca<8LA>b3l^FYU@uEtPrh8n?r<p%*y5?4h6N1Mg-WLIwA
zl;_`81xttGHKj}UmEKuOD4)l5e;RIOd!$`mB2bym*yO7JCmk8O+s`>V)Kg+*@G%Jo
zIpI_kQ_>nB)fe#x($pivLf05wNtd`99UuZ+rG-Obfd#sx>xPtghLePBf~n~f^r$QH
z5!(b~?!_#@E2HQ%xpIhfesPlGae&7}QA%cN0RN27?2;)?87=IU^<>%r9ymx8+BI`_
zoUl17D>ifeSv+fb)p&1R6laEwQ`bgM9oE!*ALV#*T_%{+vaJgLP`Y~FJ9ydO`)RL#
z^mco@cXSkO&cn8<27cZ;+_%_e>9G^RpkV~9cLzVdkKTl?x}yAK8Y2eWYH@WE*$t2K
zOfC@()#WDJt#{bx?*7a7(GeOlSeK|3H&p3Fm=480JJ!|E?9-}7D{fZ(epI_9aiFc2
zqZ_rvi2(Y8;*J|knXh&3v12P29VY&h1a+2G;}VC<vCTEYsSGgu#SvAXYfGkL@Prha
zmOqOLqM_~DOp-my)9M;&EN&`o_3_n03W;e5>K?EVtk%VKk&I4T9XXB5Y7K$`O|E0Z
ziF~O!{86jxxRy9&PA^Qc+ed&FRxl$%QP(KLk=+Hri{l7KG@geeWNNqok`$60vV<g<
zaFJ;81dkixKrqJf2)0rmt6A>^8~jV3V5-B?4G^dHDyU6;p~1Nl{m751SjfG&G+G>5
zmA{>6I>nsQh61917+<<5pi!X&m9$*QZ4mKAwfXM$tW|aobhS}Fh^-ES31V?ZZk=Zp
zsirFc<x~#)AXb3reF#LXz^w$q%I(?vmWN0S!DGeCk{v=+pDQr#XZ4V31ffRIxH%MD
zWgnKWk9mPx8~Bv}I6Bz>T;tnWCXzmxi;)MHs|dv2e=G7VKr@`|suc&1f30QY9Jiv0
zS7E7|TfgEt+|tf`{yn3^8k8G!n#yLQQOg>*TBv%GO61d2QpZB=S#8x}o)E8XWmWN|
zIt%IblmdE=yV26hl64m9SuM9kVZPLrAf9G149xJI6$Cws{sG*J{X2?&ZK2}+*Vbml
zK<x%fAbV6_0@aOJ;`T7~Rl}Q#6rmyn2mJi*cJaQl0Ha`aN3;(0BXuJFP)noH%yP9e
z*Vz6$I|>TFaa~6Pf->)Mua-3v^NHCA{j=@vKm4a7j)M01sl01ts`ja`x~)Wy2*D(<
zQKru1u*txg&2dAtNrO$b0zvW2z)YmQ+K72{0pY5saJSi!jzYKe#D3Jr*ux9OjnFl#
z!+h9r_sSQnn2|A56wUPmCLPo=%p0rCVMk0bKVC&|!brmOt19-STn7&wyBh3~BiSoQ
zL`-pnT^?W6DeNk~!ozi{I%tO@@NrI8#-aS<_R%MluDoD|0&x<s8V5QIVOwn!#0qS)
zV`nwOwsPFWX4q!OQY>Q|g-i|<or7&yZ4S1X0F8`o-h>g`^s6dtE7!rbwyRZO8;x%v
zZ1aY@7`Exk7Pk2TDs5~F2d{LxQGH++pDa#->ie9DdS6JCJ^P&sc8l+X=fkEshXDwQ
zD_`<K3(y~v>!=vVgM>0FkLV)jOLjx4*4WhS9CeNBkM4i>fYbNV{8!0<R{tjZ{OByj
zH1KE|mKIvQM3(bxR)v@1(+CeoG<!xX==BHD30k3xm^_#a)*q=KXvQYSy07vpREMe<
zVVt-(!}hu1f2^*qeu~EN6i&db%W=rbvlN|APm<|Xl4RJ<Kgc@r6AllDj`6&X(Ht7p
zq$iX?{d6|cLCI&7RvjaS<(QU!kW8>gYzGEFnL#|GY_j}o$3-!_U{e&85gdP|WYamG
z<P;&IW1Hq`hM{bu3+s%jl#zdx5RGJWg$3acykE2;c7sTgP)_v%V^6Il7{ojqCLdXm
zrY4UotBD^+2#N}zfZQJZ4a}*tdEvvmf-Qmmv83b5P!Y25!q?Fc5ss5!adn=Lc=;H*
zVxfH!7YW6B)5>O|4A`!kifkQ11MIe|KHQ1cKHh)v;)UrJ`y>a>A0!+dT|+XmvgtJN
zTE#eLtDvP%ORJ7qD@hc0*B?iTHS;7i^Mq&qDLnH}OX$Rf*Q3~tpjz~gPZjX6CZ3py
z<5e*Igb^(Sgk735YD6iP{FEcg7tu*hvGI7tV_0(xI|AEmf*~DOX=FUlWo=ET997cc
zaFm#dFwW?K`(wKcBkm?E1!`%`@I1wssKShX%(7;$j1Km>nP4sbn0SAML|r1GRl2hZ
zjTm>JLMmGgkQRY{!;uo%9%O1vW+ZenlS3HSaQ*7^z1*!PA+X6m#*t1Zh;UCSke@X5
zL)3cRiZ-LxQAl8RP2;&szLC@HSIup#Gb`d9Xkx7+kU@?jjNmhC*})~laeOTK-_{y0
zD$=W|Eh^U6O$4T(XJU(`6%UkGBj1E-?b|c{(V3qOhE&n>3gPO`ho{1<xy^|(t1RF~
zHdjL>100b3-Y)O+_BX(vUo!%vu31E+s8?I8T7OjTwonSNhJD_Ci{5^zm|;mH?V?k+
zIKgohj(DvBXz%$7@9g;*tZx+i=1&O)!R`{_%n?!0<5&}SCgf`tc8S76UEc{C#Kbhj
z_M6wA=7Upw-A$Hni=9#)HBW69bYlJVn|~$P(|uX<^CWaXbITB&O5<^~>oV3-Yvr%Q
z6SR2>TmjI+QViwqJ*oI2xxf$!HnHQszw_izs{I{W{J0sCoVA)%+JH|Mw*jA2*?>>n
zHJseg27EHd2Ara$U}?-?gLd0ZmNrPl>J7&ogDlrl+%_aP_z~_zp@whi?Oqn$AQtP+
z^P}DW)ARKkrSNAsbUT)+7xx2$)IsCrv1_E2$`}p$%r|qv-lX7@@ZFsqP_oquLwb?%
za-5PNq`4ER3yW3m?DImB-XOA^SzbKxJOr4taLrmbXT|32A#h&B>gsAIT6q@1FQVLk
z;9tyC%AaUwvWh252#R6GifIq8bWJsfm#VNClrzTP4m8%gPo<CWJ!r|;<={h`?S0f_
zL8iN{?0tET^uDWJsc<NxJm!O~KL!dXicM<aUeu<qoeDdEZycbnZk%$pF~tKwwGhaE
zm&pVMXu8*(XfvA^Fq89$1rA=DkmECxxsz*(<&FZSir2BVvqPh)b#~qw4(mfWaiEmS
zFhz<C8BvKiisgR!gBuE34mq4A8MjWaa`XphgDHySsa)+<a3_$|lhLVB7MQf2CA^C6
zMjJ+)Tb7KhDhv_T(%#CPF;;P+9Ojwcu`fVPCDcAhJxQ>J<V(QcvOcWS2els77ifWN
zee1rX3g7X&a%2_G*NSDuBw!;fkvFta;be7}%47g1T8ffvBnM@^;*)WjsA}gu%Mhpu
z$9q2fA8>E_+OK3IqUP<@N8PyFZlE5%x9LPFf2S(sSY3tUfS3JfJ{f%98jq7~sB()#
zlU|flN;_x=(p&CO@<D|tMvp+vy-cPi2#ysQ`A%QrPU~pq2S0wsz<Ce0&5i{Dp>G9`
zy-{d(KKKHbg5|l=&Z|q$wZW)LnRnf6T(t0k6kN1jePMcmGcg>bA9H$YVoI88q|>S8
zA3~`y@(anI$!<f@Wtv>6-~>P~RZdO2fmx=T$hE3oCkKf$zHaW?q1dRIw_>?Wq}K`&
zV#PonaKaH2daK+gh31%8eR2dNj^?8}Uo0@{OOE<?aFtaBL%XSsIGqr5hgOb_Cl2;B
zLo{qc4v>CS(7B-LD~~V7kvk-HA;#JYiN*BX!uL75$k{^nevsMKu(X`cz>@3#83_s0
zFl&ZLoVn>0*Xn-2H5<1Qx=OiU<VM)khtsh_sF>z%!S$+w`s(-zHxB|KBM~%FC9T_F
z$q+7fPa9#NWb>esd0^S_z+&PHN4^V|nup)S{j!WB_3hqZ!~s!<+OzXjmYP!gq%tnD
z6+2Wt6(Jg|P$ZeRx<MICU<wt&(KKiRCK)fsJj|M)13r~*@9JaN^<8~k)cqZw8@j*~
z>_Q}V7*=LE@G-XI=wu>}>+EC+=*Xah^%%-ULq+%aC``b(uvKL$oYC?5RC-(GqOQhG
z9aiS*P^Fru=%Du0S&tbBhy>t~H=`SCV@1)z<I<S$wCa-?@ljYQJgqm0cVAI=qd{Hk
zz_db?^R(tgxNM?8TDQ)+xtBDhr*+gj#uE~y?Z)B%y@zKfGg`Q|R*DlqOF4KOM6eVT
zE5}?dNwR)AqIscngPi<=@pPrX8wAuf3NSlFP2)sjj2pp5Lc)k6D}1SpI@{3b1h?N2
zVaJ^NZ`-$GVLhszoZ<Xz)Yhh7t)t_u=X<@sM(VLj!0jZXTB>CL){q2&q>)dOzL7fm
zbF@VZ0(+;o$C|9$LjkpOtshd5+z9M<+_1}bVk{nc1Ff?i&AkFH_{qAhqB)!;(>@(i
z{ZLw^&`RkxkrQ?q$!c+pr_0EC$LZ4x$Z*SQK6K^fjaMfx_o<?KD)_>ty7sD}s)tnr
zb)|e0%um5(uAsd)yAtrTlih@IX|$n5iTmeLK&@W(H|1Y~>Q!0}Zliwq$K<-$&FW#c
zFtedy{N)JW_QBiz;~#s!9PRGQX;TKZ3VNZgjlXcl#fCS7dKjULz{OTmVm{O%{PWqx
zxQE^%Un6^{0{-*2uiy0E9BjY(YaHj2_yV&mM=H}<P#PghA5Bfd(A8*nDq)l5Ncu*n
zFpH9pgJe7<<&oaelHCkTiM8UoQe1KhU}+5Pe5t)T34jkW7#a<$H<`3cOVX{>)MZS$
zPG+MI?7qp1`gZ^AQE$fqn7mTDX8_g#T02kTv`~Y-ItMmc&+#-)M^Rg~%<<iQdrtHD
z7KeYY!^xw0YEe3wnv#_TI51s)nD>#<cG4hM;cF=kFH78I=Es+P0J6P|Letv{XN-2O
zk~JvKK|?dleKI(N7g;y!28Wqx8t?s1V6#W$8&=VxI{vH{t%+!;%n={TwX0~34XP^m
z`Z;^0^_qRr=z4-Y3)ICZ>3&Qw2%YpsU2-qewK7vZsY6k+o$NRT?6P%&^K!P)weOL4
zde7g!jCOWk_KuEMe%ji5+jFz+(A7f5M%C2PYSg<-CfDSLK=HBI`XB#s%2Bc`iD#-q
z{8M5Bo)E>62ig)3hkWls*C1H3Al2EbqDpHxOEjI=Y0foao0E||zZl1p1lfR}sL${@
z(nNiupI{43lsNja38PuMMOxrwf&?k;)GYS|U3FP*TDEk_=Du8Rfh=_r;#?n-1mGq1
zTEnMh3uyWReh|7#7afgz1J76R5|1xjk4pw_;0bZ9TlT)bW`9_^l(*5_uR<l(D=ybV
zU@Tp+*ej|6<OV9b!5~ne=GX{kS@fvoa-16Tbmw~9ZW$df?o;4U5Tb6|Y^;m)*;Ow#
zs;|ndvXeluz@7QJcViw^T$x)j0?lastMm2p#re9GMEKyx;CWV7P|-XbzC_)Uuh-9J
z<4ewFqdc398_i~;YBn3?A*_d!rz=$kG*(l<=4sa(sy!Qs(x_Qn_tlCeoVBFsjW5?X
z9D&$e<G$+_!o-9x6I>W7&Qbq%a{yLW*)YF5pFx+j%UmTr@@R`W32>`eBd;rpcxa8d
zTohfkNPZB{LG-yA=GoE|q!K*IQkT2%VzJ5H77eN!=~Jqs!-!f1HcAED>&|c(rE(7&
zbX&L9p_3N)PCVw1L6T_GnQI5|4`q~J4+wqh_9og06j0a1CF>XS!XhtW_VG1cXDKkp
zAK+A_yKoOrNKmwsz6kFqW-rKGz21F!xOLo9JYZMl*2VE-{x){_JHre(SCbqQ0Ejt^
zHegvA=F?({vgNSczz0YSD?in&AK6Zd4PZh{CEv&~ciSv^qfDB0JxpUmJX(>@CW9L#
za18T&AXuFxHw=?lAsR3GC})FsAgVt}l77QU(uT%W3u(4wT>|!=F7IdMezj~Yg~4-m
z_X9q^X#CL+(Ra~i^sQ}UW2Z+SP#}WRN6a2BAJ?5;g$af)CHokUUCv=cC#cbSL{Wzk
zjiLj3r@6$2EbW4vELFzaXdplDHXc5FZ@pI8?wv11CZ@(x3B>6&bk9R&A!DQCN~nvQ
z#+(}bw#-(`)(<k)mi;QT&8lCOy~Sm!p-alfpbOc(ZD0wRidT8Vsw^e!n)lyZ{sX!a
zy<M}4J)mN1emQ!*Zk2mT6VX8Oia)d`q6>LyKEPnd%nO@k#G)}E>#?=1K<YGaN_}g-
z@=Imy`YF66On0RX;a<S_quF|U{A$DVz6gxxp<BWoQ$^d>DCV{=FtrDM^Bxf-3-(A*
zoY!M8SX~I9^Wpj6FE~33zx+wzb%eilN|SM$T+}i#BsSMb%!+1fp_zNPHWf4CA`pi}
zg`;B-1zvXCeW(O!ZAHRqg%FrV{_a|Gb|<ipD}-@;SUZUh&_lMVhjL4+OaA7zig<u?
z9r`LAFDj&0W_&yewvI!XFWkDy1y8{B`!lxgWf`{_#<-^9dg0$U6qJ3|B`7mj8oD>&
z!krF$UL2E{D@`pj$Q&hxwBE#UGq_0oNyp@BokG*$bt~^RZ@}t)Ar99Vs@;?wC2P-g
zoQ%>;m|74EPV!>G>6Gls!?s*}n{t|dG_=+;_w0)Vv?`9J<x!Nb8DH<Px9N-B|8lxf
ztnSUbs_jmg4DM3wP}j@afT17r0-q{ZuWlXV&lT(MS_KtvVqVyK*>ms2&9!)QTu`VK
z)be=lBre6Sx)@X67qJ0!yY-#I>umw?`7C=t>U^$EpnB%(&eW1F*BRg7LzFm!Bfw`k
z@VT)kglB-@iggN})rl;cxY1T-vcRT=9PvqQFAC?|s9O!W+DFZar(bcDUjB}otL{)M
z@;NFAdc=-lt^0YJ1bT*UkQ4-+H!+3p0X!*{USOk15TTP<am`#Y{J-BA=ZAm(_UIR&
zFfDDG|G3mpmQVYDsF#$RHL!7SNl&3&i_5KIb5(eXwNWv~?RSJhC_{W%@d&6NUGltx
zOS%5=X<}=r%Z3;T8d3k`+Os$e*KsTl6)w)PJ#=8GyQ}g|sIf$J7HGZP0X`K*iRx)g
z@@~Ev<{CDtXTE`>dKPoG09-ug1X&a?F;TWZp}ehX^ZfCL1>Fh+-_;=rCBDDX_HwPR
zO3Njg*|9_j!R7Lw3783n<`)z@59HS<GFRQ;@F~Rz_&J_r?bh=0a)cNgUB&KTL8zce
zpo{oGwAg6|Nf_=O3cXMnP@&>63bLRkuYOv}ImJ5#l&Lz7s#QwHqn<JrIg6@|edwY_
z%P`hDMQx#?oxp^bmFwy``>tXTJ~IALK@rJv#J&CrwX$o>Ka#)C;*nU8kTb2mGr&*@
zWR6lnM1?=5e295AuODr&B7Fri)GSBQih`9HLW&XO{|+^#Y`ez^l|P!Blwz8XgN;RG
zo^u5#N|jI}791t^nsI6@8g2nw7WRt-+w62P%H{yG9#J4rIef6Sie5+YEW@07P80?O
z$!KLo&}~J@F9N`d{aJG$;#09Df6Z`H9y4Ac;xWRRl#`*ZZW*Df&a1743efqCJ081K
zc2@OyF+)$w!r#@^>OtdU+3tvoprm`RsZ(i<TC#6ya#AS*A>1CD5mk5Y3PaUk#-{{o
zGz29`)A)oOpiO2nyj2e;1uK<IcHS`Y32>7BQzm%!Jh8*QBs-g)OMiYW`p{D;+4)Zp
zI&)Et!1n@Uy-H-8cG1x^)8Y(?dd$b%mQB2U>pa;5s|~_Da#n&P)Bh%)eT}Ogn{g~!
z6%ihwu-WLCEv@PNDoTZk=dt?R&6rU2EO?UJV<b=IVaQe4FUd^$Fyy!F7Zo37F<ZDZ
z3_2~_4=Ik??V;zuJZ$2@Y(HXp0*wsk_%A!Pg7gEwtV9w3@xz=6RB!O=4&D%np<|kC
z7)~&EtL(JJ{b8dPoS>Z95Vs_9DDhdGE`F?FQ~4yqG}?GVJLhwgy;5$CPWAGMexrdA
z7hvLp;|Y4Bb}m5_Nij_IoP!geKlMOp+F7`T8m{Azz)tD8HN#WQIFy_Bby$vaBhbQ4
z6-u8W@5=Mp8Y%UBhLw!-2zUA=ruNwyGWAr5W|p4XT|g5Xv99ls`mDydQ$2FwU8}9G
z;|9xmzBz}6sK4vZ6kq-AO|7{aT!YqDhnH1@3+;0i{;!&NeQo_xqY0D;UqKtIa+qkn
zx4TXz<RqNUp3WDa(^HIY*e<3+V{F8YW7nHb7aqRMQ`Og?T2l&X?%i4O7EoFnWVfyb
z-1K&y5hgMZ9LG`R5fCn&xB<iU77?YOS9bv_+s6SNtf+8UE}_oBo8$gZy~F1RM?E;k
zqc;<Zjz}hzmI-BkDfW|9O>7_R?cfBUiPysF6eRJ(8i9D9WH>CI!o6=;Nl^Dp5~Y%+
zGfl#)6_wq;eY1miAK3ld@enV`t(b!}5eC>j8(5XC{pZ`=-Z4*Rhm48|B{|Oa1*{94
zaZtJTRvlpQ1uoM+?+)F)ItT6w`1Nv3PL5)YUjs3YH8h-<V`_)OEY-52AW6mt94Hp(
z0R6EU=?E8=1mut15r~=yJRuTb%wFaMXR*uy=3ks^!vWp5oYM2FmX31*TVF2u>L4!r
z(Gn|}HHM}~!#Q<vBU%-M!Den*&4mNYg!RE%4{YDaG(KXiNJ)OYgL${(^9B}FR5u@(
ziP^Nsz$8I>#n8%jHDPV~4VgY;&|<L49(?0nU1m1s`0yU7c$dkQD2Z6{&X*RseKDDl
zsS+vvGx+RzW7J_{FwR;yzS^R3)ou_^ttym!g&IPlyElj%-yn$Kq%Q2hX9d~9=Su|I
z!pFH8x={;?(gz{~+U7MCQT^r-5LKok(qiz|-|ae}h;3kIgHOrSW>NXVHMOaeCmOh^
z1+8rGsk`ef@y!c@-?j<{5+W>`j+#5l&(c9Wk^|MI4>bggSw83Z5;lSZP2<1s-Gx&)
z<`!5FFyQNMBy}7qM^mTqy1~>f$9EJ4IH3cvoD>Q_$|sbuZ#Yz}EHkCU<TT|#Gko1A
zLFH?`&uKJBf3|4^b3(7X5&W!lBQzC%o$6z=iwO*)@>(~{SIm!!SCzWRG2vb))(Rr`
z?lv<23lXnyt|K)}$D9bQ7TS95^R4uPiC(0Bb)YEq{7Hs+pDHM<N9N4cy-F)LOovX)
zj^A>|VlvYh=S7j8j1qFlbVs%<sE_Fchv?*ojUZcKVL$J#>twnb9p!jy$|fa#LsyAH
z-L0doH<$$TQf)2Xq<He8<wcit$!Z7t%?Py_!SYW^wjpJkZv(ZG2M3AF6mr7n0(Fvv
zP?Rr@mPYje#g-k!sBj#%_Ah@byNWi~c!ZS=KgY0^Ghj<b&bqrak79Xb1#nMEHnnM1
zAS)C$_#&T3VyOQBd~p&(DFzga;WFyv4bm~J1LBy)pQ_MR3DY7CPr3^3$EW;3(U1Q)
z*xm1Mzv^xO*x!1A6yt6Mk)Tk(_I+)Tox~luwz~fCR7S(MTesXP?-op;w>6B~K>>QT
zHAkq$rx+#4xV`Qn&fU8T2G8t?`y^$U4yG!uYY97FCeyt%`ygR#JPLs|kp+*ZIR;>!
zCSij=_I9S`tqeO@`3UHge5$<ku2*%2uh#I^0}ut%-qU`-D>ckF+mHipVP4t{h!+r0
zAXRh&=npq!R>%Ork^nXZ7*(NM9t-x!1Bo4x$|aN_qWqMw2FW7W)%>eb%uj;T2LeLp
z68!F{;epi2%~qLvalmk>-KWUfVLMKmcE-xGzQoI3<HS99<)L4NYqC{}#AR>uFFnAY
z;!*7Y5v#`Wq)3EnAZr7(6chcn)uchNlNnSW`*-x%RcSTwj>^Poy;;EEhi{QrC}}gn
z0gzE;bGThBf{*I)@RGD?&CC&;$C;8WmiChMpP(;dqj~RJ6ZHnZ=)CnrH99YJTT&a6
zT@|Pf%dSd@3W2i=gd?%z^BK|D@lna^`?6~r7&25EFo^YnZm#ZjO63!sQ?}u~GmSuY
zW(2s#KG)F&yg+2Q5h}DmjN;1%veo@HJ4`N;ixWyu5>FRuX;2y&W`;5rNsF|_4t3Kw
z8^#lq)$q>&Z~3Cex&SewN9m8Tfd!>)k{56S8ljMCirs)ddFYgwcNRNU!-ti{N`(b>
z_l#yHaW9XD+Ib+zAzD(gmeuwTc6vuG?V*BV@qWMoA(Fh5S~}~hl)99BjtzaYXhvFu
zp~{>S(h<Du9lto-?d|Uzu}lC}F){<pCy$m;x3Hw6i*!jy&xWGY6zK*9ltK(+MVqL!
z7E8F3(<B>mXgL;t#xoQrD8QXIceQHM6;i#3j{rgFHb~4(H#!Y*x$M698Szbd9fO{`
zq74X##9uH|)Qz)O;gHUfsal@;3loDQb`*_eRIV41o$s+5EswkW!D9X4EEpT7AgV=K
zk6YmbVR;<+sZ`}6imJMAvHvlO{pNKk)eDSB&Jy{h@^mX_OOmYn=}^7$#NaXP&^{)S
zH&y7>BpF<qSG+&_6ic(BAsFz7z7{lGj#6T*T19MW231S$!g`P$oHJy*(NeTjeb5GA
zYd|*5KO~ue+5Il?_W(^u2YYyM-bRmc??M1=`_?v9${cF@aVU=o6<ptpWQpb!+}PAv
z*5{PGzZuyJJE!!6&B$KnIi(*;X~BRwr5|lZ9&*g7@a<;gqDpo7z_Exbx9^nU1V+~(
z^~yKp8bok7e|l55**cvMHHj&#uQ8P*$y>bRsSDWg{J}W>SqL6Xj5eDfFG4^3-9lC<
z)SN$bR{t=L{81*?bhGsOm!sa^3lH#4Z`g|Wy)?qZq~N<%mbU_ohFXd;v&%uGF5;Ao
zK6Drn&uLmcve!+88vFPlJ*bf&jZ@!PwmwB~lAgj9%|KS3ViPNo47^5?CiY~QoCfKO
zdMe11Jz(8;oeWV;uY%K9S*ex%RBLsLf+5BZuGJDqrZj{Bg>{07zFVplgru||t;TQF
zK3r8D*ljD%R$8QJM-uQ_UEkO8LUX{co-s!Lx?f+0p)wfdXl&I#nZ$z+6z@w=6S#z>
z_f>dlPtI$h6KZq*h*74L6vG^5MgwZj5U}E~u<BK*3Dm>nM_Ws%jJZ$kShEf4;q?a4
zZ@S;`KFw!m{Tea|6A^7#bm|N>1LJuYZgM5UpkZ?dguwnX-K{t24i>Dsw@>1kT(@(c
z$j-TUZ&%sl{CnRlyl;xhV9|Y}&7T(BH@aSV-{?<`_l-Y@8|)k1#Jg~lUwGfl@2=6l
zfd#ACH+3f@Z6-Ma1yjv_T3V?QNbCo95jIkD++~zka580w-s*x4b|kd}rQ&IxHbHCb
zP!%V}qNc26S!*!4O)adD{%JysQin{!^KscHPpSKk-S9j5boZ`hpW#2&>WqPB)RU}P
z1G@tkGBy1Kr(DIhEEYncbekKP+byHW2-y|fYTGhFg|Qin1f42#GwREaP!qZtpuF59
z$yVe0si+H!>5wcCT0OkO-vsQwj7K1>IyxlQu7uU7wWe2LQLPMNIdORB($?jhqox1t
zpEGo>Sk^0pur8t8(q_1&e;E)}%+$(}OIzjc-GQ$-c7#e#giNmX>1vh_NV;<9Mgg}~
ztC4wvEo<q@u$B#=lzk?Qi}Sk1FW!&H?bPhrLv*}NoH5wxkORBMnI@Sy>N}b8ry2-}
z!b!mDm3D_zhHM`&H=MH>2eMt#0ldIU746vSjc`X*5T_j8P^#}lv{V{D^~I<SScem|
zAfVec)a!?2Q{MWgmdZd>HA~&ljy)X*t+7t4&synO)`Eu_E`{iK8j#m3uU{8w8V=tw
zIH~p093?6}7AIp}+?K6SP<w)3^PRbWu(h*u7&uhQoet9i4xua=Oq1c4=z3@OX!~G)
zzqftdsC$eP@g=%_v9-I`s6#S%Q$2>#n>X*1OvcMtK-xmB3vS>V>2zr<Aj1SHWFc8O
zeq-0EaaWIQ!8=f&CWnbkmr%c&1lo$}AmMYGl^<G>4d>oy<TT>hU>T*l2D{Ust#s$c
z^qWviq;RikNfh!{OZdh&D6}rV?%au#9@+6U3>yvJ#8~h!nL=Nea<hqH4rWuwdXN1P
zO$rCPIaMwr#N?CyVHtRX6fFt2MkBc@RS6wNK&Hq{x=4qK-L`9&$N9amC2b#8kyxUO
z#;Vjh&es_TU;dsXr;_QACygK0>Thk;jqQs`enE`S{F__bE}J<H32&_Jj$!$3mD|~7
z^2us>d!L67abJBO@?oOe(E!<TuSdCtBu<`pxr<%z7BU>U+P&kB*R4Q~r~CQTGWa64
zSXs_`Xr3tlTKmJzA<$?(`dXfc#156-q-1O^^=+I4*dvnV8GiZ#b1fN6l?|j=$rjpW
zf%D~SIAAs4PTRpf)-fhkR+o0%jj&a(4WRJML;P&%lnT$^T9mTDQV&s27Wpc!Y}|Ui
zKie%XgkHI5tge5u;UvkLBEI(dQ%w_!&ehX5F5M}!X>&U(->7;x9oo~}5Jjr>wzS=V
znu1cdv}^d`=#RNdNqXk+wV%}t@~Ht3hMB{;fW@b*;cB=EWIY>7Kw+E1cR(%QM{hGS
zE`-4%Z@`=fdJQx+02d=&4iDDQfXbkMH*#>lLh(`uMo&ehb#iW<&GH5+p<j(_X+XU3
z*2S{f?Th!Buhy)fyrrf56r{8c?XpVyni;cK#Y6C3M7h?L0U!r(z_C)*Z%jYU4xI(b
z<O1Hl;^|xK&sNo>xIC3KXYld)^?rPjI4uV>7OH`2iLWML)X!Uo`@8!uB}^WajMIw(
zx70~<t6dgu(d>Pe83*rZcLy3>BwlUC+bUB5AZq3<^n$0Ziv^VOwgIc}(<w17qtjVN
zDV7VJ75y@vr1`7>v4O>be4MaJD*I&yQg@GlW98-~#|h_B!K;GxZsfn(P^)BT$z4t<
ziKz3cLk&C*l-&rI-EgHe)<Hna-3Y3%*>2V70dg{houn8z)5yFzWM%>t@(oU9In0^?
zZ<eWhrK;*1_0>0AVU%jPS5YhUa@~1ZF?*RbZMb-ZX5Ig4bBAf3@W^G}8~TNvaURvA
zCC4vzP&-P`vKZQ{7FgA!>C#)3cBLidBBb&t01K6hs}PVe(dMq%;^VTE$04{Uz!$Sh
z4tep;b=}qEqkMVtRjq<O^VctABn;rO424|{{1hXdr@tqENxNHZUKmuFTJvJl(NYO(
za%8|q#R8m~g`TPkoFQaV7Jo>hNuFO2>#?-CL~i<0riPhg&rH`!wL&?WA~?Sb-N`B$
zkteD3f#q_I>?|F-LIG;IE!meGnjnNQgCM5VT5UG4)?C<1lZ+&+r41OBItH9r*8QxJ
z<8J6{1AER2bf0U#S#P&lX|Gvpr|BDB-l{ab9E403)N*UHBJs0n2Qrd|?w`q$Vjw0s
z+61FY+VPb0A(T-c*306{-;pU(0~~a{;dQGSGjHJLsPZA=9!jMFIJQ@+TsLZ4XWu-a
zVJttFviz|W6$y+IUAoG-Gi+RK+i@SDr}iLZWg`X;r(`UqVn}#3RjZwVq0dEffzczN
zfvzUB<{S@pR^WcX9`EXM-iB!xV@$gD6bY#(V0zj52BnOS>S2;eC}XwP4cyCe*gN|Q
znejAzA3$N5Z!s1hGbq)i+97l&8^>bKMXNQs5{<Ai=beQ&vVj1Iq0@rZz%;y4tUId_
zZ#$K~uKQr+9pz%PsZrWt0cozuo-^~X*+*a}6Y`I=)%PAUn6U)0!omozWe^;diH-Vz
zIf@6ZE^atKx>Tv|>BZEoShTwC(mAN4M9t3$#bGTLlb-;qH5WXLC)EQje|OMH$&PB~
zwg^#{o&q5*?5G~qHwgN$ckd=Rs)uSTdKxu|#PQ^*reDCbNuV0#mwX-<oUSC#*kKdz
z{g#R-9$m%PcK8xAUj3?L=?n-*(9k3WUcS$i)v!kmE>r$&RTbM~1+-Np2h#ZGN`u}t
z5<%zmtV-A9tea<wR?7ohFx9)n0<%L81Bzm&-&?qO(eOew(8c=xW>+>2r7wKvXJJ5a
z;D+#;ahjMt%FAATawT@txV^JDFh*%Xb}Ty?jL}le70|gMbglb(67?b;yaba_@?15<
z@^#wRm9fiire8(Qp68HT=O_CYl)vkxZEf{L#eu_c99?UQZgf0X*P625c7h(GH8skz
zH%+UoAa-V3>c@pyNGwOKl5G)<zhz$fg%5PoL5*mCI^V&xLL*>X*x@nix8qsh>DK<J
zzh`WleWoT*YRnc!a447<usDxDuzJEDi29lYon|SHx;+(utkquq4GU6C-f5N?B<w7`
z_QfWAxAKfwBhSQE7QDK=V7zVV94c$C$y%s@3oPrGU)a5EC2HEGHoh=VD#sReps!9i
z+g3ht(M(x;QQ6gKcPf<&j3kc{$ga-wf`h_Sn2iaWUD;8Ch;4~E#1qh33TzKWB!e2(
z7*W2!{1jX8N>hlKL7ZVsL25GCyluk8anb6+q1}v|HT2wzyoNvJw7XMA)*bkId_7K_
ztcw3iyrs*1G+<`}946KFH?{$SAK%G>h9B6;0*maAJEKxaCk+oDAoGGb)zF$zO+Y6n
zAX?a$+7B8hc=G}$qG+y1dP1S<&<2fyt3}dVgQ#mYfxx7Z`H2Ow8=y^ks6Z2kvvJ!W
zF~_W$YY>bNiYyn`hQyY12I{d3i3rcHNPgeEJrfaLuA14XHf+D)Q&<iO#;t|4Lc;ZX
zM@X}h6>a{m%lY@;0W@c03*J0oc}3p}<FY7H4pSs5NikND+oTw(dC5$KW3UoImNXdi
z0)8H3Y`KYx=LI0HXk1ZIpZJu@-M|KqtJ<+w!?r~dPED!1q`ZCXnb^$(Ofd$PRk(X;
zah1XWE&;pIr*bB`l!}d}f=tDeNqmj9*B{;g?m={NJ;lKIJ&J!ujl-czzRAi88pBq>
z;;ieG-pgJ;&>nZMtQzzYOzCy=X*`Ou83j~>g|Pc5R_iRANjX4;IT{FqM|XW=ea{y@
z+~iJEU1;DH^q+9*`6@YIuEx;%N0rJ;rb0^XOy-apuBf>SkYoFM6m(ftK=3a&{A(D8
zGN?+nVj{4y$wr&dU=IK(F+CkL2!Ida{*Sd!H(7PL?71-uqY~gm;=>p+4OTa3(KA>@
zTm$-1v6SwuRJK|ZNM40!EeJ{>D=z}%5z*cD9d+Mel3(eFnAAc?D<ZWLSH0Js7&A%p
z%xakUA_sy_4i`WmbTqm%BAzfLAqGH$6k9Hl=!<bONKaFt4mPb1ZH_Xz!1q5xcdzqe
zYNbD6Y~hVtD`_@;bb6yN(pot{UJWVmj9+FKl<w;3&1hShmZ|)8r6_t|-I8&>VJXVt
zj)9)9k@Zv(UM>@-bd$U$+Xrv=kALj_a<scIiAp4+l&5Q`Ola-vD7(=l6o|bd0ih%f
zfgX}GinXm48^J)xP%S4Iyf7`43AUhA<(;CdsG8Ks?$(S<+<q4Lab4mxD<q=6eb4OX
z?kLaR3QLdV(Fs#unoOevB<1`grER628YR4C2d8M@@p)Q=`5&>BB|X8pc%LEPY?DD{
zOlpxr&DSw7CkZJcE@q=?Iv(kq9fr6Ts5>f9-;_|&k8<N(x{iWTOn?mpu?hyv<4lG`
zY3oRB`5ltkJ)Fj&G~b?QqgWzdqx>qt+X`j7_m@>Yd?wwhGqkd`x0!EM47`91qfkh`
z^7i$hT59w&Q94%WW97~0+A1iVT85amFiO3q77wX;jZGB!kUe=lL?MB2`0;-d*4Thh
zT=pl94p`u_v@xYyo3FnFNW+hK2;jF)blYj*zYSFA7=ekdtoS=bVRabiQM!&Z$_ArC
zhXdy+=aZvUt+PgWk$xn0dRqkZN-;H?a&qxLW@ew8!cjmGWH3w2%j+HSx!V1&{?EI|
zuljHI4|`kNueP4=^`I0MK9VSsA!#|_j)TT6Bo^u+SFfz&-2vb*`Bt^Ef{v-%Lq{*J
zdIBmlj5BB_pB0<Tw5<$ADeE8NqL^K9QXgrP9lcd$`hX{+*1uER>WwHHx}^D_22r&+
z&9P{K<|cS{Uf>I6SZtkrvC1TH05~#;XGH?ToW?+33sy<t`3e01i*tp8xXx$MRZO~o
zXqeNvjjzaZ?^=HuPx3(mScc7EmnMBZfOrMLv|_<%MNN})6_RI56K5)m$4Ne>Q=P#@
zXa!NuZUjBrcS1@^%B<^TbfF(vzlr~F4)PKzkV|9h*|TS1RB$rG-%N?Y_ByOZdg|yU
zJenYdLa|#+^gYzEjzC_;{{d-3$rb<UM84AA=p6c@UaHYct3J4>M5U?HB3I^-sLmg;
zsOK|2H%uV002#NT{{=)kJ%V8DFnkuWFbPZRTHJftbA>&Y_h6rdBGNT6N%8GbDy}$W
z7p_zUfom8f!+)w{aN$$F?f`O_Or~`y=C%$Gw|=Prg;YyM396inx<Jal(%kHlZWJ<o
zRb5y%d8SGyY_P4K&<+GNYrF5em?^p{okm3yWT@%3vZyY|Tn;%-h>b3%nqa~wpCD;l
zUNdN~in>K}5&La6u+;E6skT{!GJB=?s~0+tyQCaO6ZDuRieWNNGRjPuv&akYXPk<2
zm|_WWLtaMXp8cG~9h9I+v%$IAQl_%2s^mr|+KS}RYEu4wCwi?!Y9{LEu}UHD)=+$*
zoR4M7uaC;|Cv|F;zW{VVi@yXjo%xBr>Q=*Qr=0TZ25G*mvvF=(FH5Z&HOsTbSq+@M
z%ot=PIZz1>%AxVHM5*6=<&4U8P@*lgCRMeD$!QELQ?5qqRaMKDAZn81s2y;XFz=Uq
z#3L?6&NZ8<gtL<i&N@Ta+`tk}80%E(Y7`W3YFcSVjN4h3Pk<vwzMM7xs;lS~u%)oz
z1dY~uYm@OfMG?nXp-?-g-Wp^{DaxI?4xo#@d^F0haI4NT=l+hj3p7tXmAtoG@nC}N
zvZc`4bmK|Z-ty46T%JzAhT5lJlA_%L9ur$H)b;3zTw>x_N$Ak}3IxCp^^V~-XiMky
z=P_xFy<dzcv$km+8-~j1$O^?9I9sZ?yLsxFc`Z4Tz_wZv8uM*YTP_#}LynNSr)7XO
zJK}^A2bd=w`7$`f)^5y@Ey`J8;`$UFr4^&OwX;Kl4PP82LzGXiF!587OJ*s3-(McU
zG6x-@JW@J~HJs$L!4w00MfqgNnM*$;$r!_p71z-B(0A{`C({v+D=u^i67z3!!}MoE
z(I4`Jz>#H1Efr#7{W)|<k-Oi};z4z{2*Hsdd?v}6lEon%Z2vrhqmI76AjzpSHJi_Q
z1{xIEg&Ql|^V-l^j9)23{8Rz$1$tVveg4-Q5tObTP8H=nt%mNuNi079iX_(Thc82G
z9a4MWV)ZT@ai)saQmHRNYTfP@p|w1Og-Pv2P8rw3{HFc1X#HYa8vFtEIbV<DirDZc
zQ`~<&YI;+)bQ(|2Fu_V#N7&F7NHk4Fw`yL9hpMOgh{j)<iY-Fj8*c;aX~A&xfv}MM
z62pT}1@-q0j|Q$z3$Xt0^FaZ#;US^vQx?iNZHQDBN;e&_`^tjJrWLu$JbINiNi`kX
zxSX*lo0D;xOra)}zJkG0l{7>>Xi2Uw@pxz8ityg0MNwvj`3#jMj_?ucJ&d<FD24Wf
zw=Hx|Z7H>W<rZq9*yl1&@EESgX_@a)GWBPKlU&l7iI&LJJ_!$MIcg`DNrpY6T8i#h
zN#_az8s`L)gFU{AuPY|D>|l6Irn-}4kfcP9@ID59QQW$!`l#W0z5DWT>$vv?R-+*W
z(@$&n^_zpk<K6w2dIi7yN~u8Gf!inyZ2eR3@cF?}Z+>{yQ047|y`Ab|dO&*(=SC2R
zIf8WU#S}jCAcN0*aD;PQg|5(`6^i8{j&L;U;?LS+foqm#OnJ%Gkrk?LK+?>P!>n{2
zb`eMUKv6cCNw>?`OtV<1&={4?7Q!xCLQ=RCT~YMX8G18PY)#m=CZ8MZL6a1bNQP3;
z<YYd0kxyJJ2yF<4{S|yMqHk)5G1tuz3AsX>MY3mv^Djv*3U0DUvLZbhCG|1wf$u*U
zC(N)ZTkHRsb~HJFL4==w+tB=#Y-r}&z38QjERI{nj9HG38Ho7_T1WE@38&rQIyrL7
z0Q12B4qNe$vkLLpmgUlt_rQz;#;)48MaDLL-L~?f)=L&FGBOm;(QsJW#`wHMC2~L_
zu6Uk~SDPNZDPquUG$dEDDN_hFVSCt3+XFa|210Y*dPrTQYN-2d+SGYI8ft=tYzaW?
z+`aB)aM}4|!)}1lvYjh4a663Nq&n?t*c=GUm=u%YG9mVw0HBPr2(<t-`N<{66V}Lt
zBrDFY+16W@nr|%=ed8#C!6?ru7y!a#oMYUWG#&|{+40c77XP1Ne=C(O->Z-Y$-YWv
zn7NiM!N~KTv&te?Oba=z5TY&QuoBRdSY9i5xH(=b;apQS2OY5}EOyYbBqX!BT7xdQ
zvlT{iA_=7BxV5mFW3Jx2$?D=$j?6l#cbZYfj5kb}RrS@tyClgGJ)~<kt?u-8t!vEE
zRi_8K_5ytdMzKZ3T2=aDo@hrR?I?m{?m^_c-fe1pM|kj)$BT2O#Ak5kxw?{ZKAw$4
z@1ln1R+`7Zo+9VU6~pxDU!C}%@ki0O&m#0SF8cP#vsUU%m-qK28{g{CR2<l^lpGx2
z-=&~QVFk5ysIjWrZo)CiwZ}!8F1IQnm(A$=kA(b8#*rJL&zc~{jf#GVTCHd^YIUnj
z`U2;$irZj+q3{i2qqm@z0S4LN77d@0>5)!HUu_KO;y{Ju8wf&$PgUYO*VXTq(+5!a
z%u0UU5RbfM+4JzoVth0nnf%+ec;r^SF&<eHY=%bxUQO`G`SMS}Ba@!J4v%cg@ul!c
z|7jdSSxs3)S(2hFqeZzhz#TIPk_a(SW@fA1m#Gbrhv3f)n~H~+nNMUQ(*m6sX-4;=
zb_?m$Sc0ZTU%XoKM)eW@mIEc+33vq1V9L%$|K{L6hl307ZG!vF*|&-v@<q1%Lfidl
z(e2)Bt1qz4zd8@9$^#rQ(zSDTvT1>?q6`c0`XaV?2H1<328b5it^e3>-hpv_^Jc$V
z&Aas<+Z;5zS0jDO9o<X8%`vyD>6rGoK1t8clEP?WoS+se2nJD_gt%BU>wDG^%VrwF
zUC(1Q9hK95t{8t@u8G6+C$g93?Z#G-jPUA)2(h$qavl9mP08`x!bgb#O|Ra=jQ4^^
zqIq~$9&O`b%vY#tLQUl`&z7bvAE`OfMK6dY@E#S&>2%dO0V<&%TmdUJ+%`4IFhn^_
zBhqRUI@sC;j3`Joj;9)o%mX&fSW|s3jAPYCwZZbXNX)f2UfsD@r>oUyW+?r(DC`hN
zID3~$r>ke%z}Sq+F{P6~J!)5Zx_Q?_YM*)`IU3NgsvaCu1*>^9W?QU>FJp4>1xyVD
z#Foy=W%g8Jh+;;eF;mW`tUMD)-#?z@V-VS=$tn<<DFtjBOo7eGXd3ot3!1V`P{$bQ
zLP0XuipHE6K^E-gB6^UFotfi}0QwF^oD`deCKMRTlUmx~9#Un8o2y#k=d+7(4;$p=
zU3^s!lZ#x`&q8I<dBfImXhMHalX-hyF2yhJIPL&xD5i8~TR9^Y`lFs(*J2Uux}VA?
zpc7!kR`#kB1ke?iTnH4Po7N-ca*5>lUZsTvB?>)PUVPO8_U$NmNT;(J?Zs0$eAyW$
z!)t_dGJd4Ad3mO_MKaVAG>K%d8Q?}Q6XolriU9`8T^QeCVsYApbk9|I7L9mzr0N{k
zTa%0+JpEHwkl$i%Fj@xX)f5dCspu><m7$uIhMG$8=H<|UWg{A;BF_R)DE5Y$6{R#+
zBTAhG##>m?TLxt;5|mC7yt_)KN?00C6249_SH9j!=^(V25ORsK38AHoQySE-l3lpQ
zOPQ2oICv4|!j?u=L}Vu!u`!`K9efwzCbR^f%qPs=!CqnFq}M7nVb`LiY{|O_T=LCp
z<{W!CALr1ce6_7g0kX*q7w%G%fY0j}AxFkZ!<qP&mvbB~LOXr&Y5_?MhSJOAc#Ws7
zMkLo;%+L*NdhxMVXbv4|4P)s*z5aaLBqJbgi*MzzLcp{LP(Rzjhb;xtOp!UgbS`nn
zD(hmDcMO18g5zS6UgDhvvZowjyV8K&QTnc<4x>`8U!SL~XZu8Rn_(I+(T-5{Aw^j<
z)lKhns=Fq>0_WFk*{gIY#9ho4-Iy6)*uEDg&U`ri!6|TIHvEqM@HlgWJ%5DJ=k1%F
zt>fN&M%y(^gRa#6*F8A9|C5W38-$KN%fbgX2V{4-Lt81JFTddHHL|uR@d+HuKuK&B
zmZ^G*3`iUSGEU>k6j>cK>`-j)vZYJh%`BDzcqMW}BW6)CKGcCtz%~0*GV=&pbm&wQ
zHP;`NJHb=z%|pcvjf!gYw<R#JnngODZ+p)7iauJ-7XjxYnrjAWaTFFI{?}qE^p^0C
z#PF7|J8g0x)~q+2#YC1_o<BN9b2p^UP4u@de`#xVm`x@7EU5KvuARh3OW=AhYt9xS
zI;0s6^3kvbzwy*ctV3FG-sX^Pk<|$7DJk3B{p!;Y*eJ>9)H%`@jo<TELEg{0!LGxA
zN`BBbw*P#C2_kLx7vW~26Eu~SGe*mr7B0wHQ?{|?rjQqM)R5OmKrQyj93VfVt~j0y
z&b8*&)e}3yD8~ET-HGDDZU@E#r5Op?IPTPAE{We#Rp`W`{3U#1Y0U<KMk_Yl+I&PQ
zWeiMDwT61tQ7%TA9vILK+>`%(9k?D88hn&zUU<{4o3Coh9e7ty4OmTC=Yoek#NnOf
zqS<$==`&jL!c^(*=O4~BY^o>UQ%w2Eb$^<RmGgQ%3;IPkST_bPUdpq>KtCOpzJ@OS
ziHU4zJ`yw?aT_RI`rpKG#GZlQJZ2vY*cAkByhC;pqT?_fg!LRHchayc>0g9_p~!k1
zWz{>N@vZGfS$RMQGs5cSuyJ~ALD;JvFg@MH7>^-N5v-S>BZ=b}ol8+aRsCCL6mo3L
zGEph^krKKpVQj1sbjvLC{jfBrg|+7V6%ik#RHRp&mWgSjrhLlPFfafg!~t2cLETzu
z5+A&Na84Z&fPBhcQiyyZ$x=NF=#{qVkYnZTyhF_&b(4LL&z~Eskv0tMm^zQk&tu&e
z0kK7GgQ-{N@49W-DQerP!@bciF{eMNu>yN0G(n9Q<~p>JqbRcy?zlpCM2jo|yUpE9
ze!}Okhot`$<YUpnM?s4<Bi2zdFLicBcf$T>&Qr}bdUuqi&Kn>4P1r*XD^}e6@kgX@
zak9{2eumW>K69e4%I(TpU_n3I1WwJgWXNZK)EE<7@`)Allvt0j4dpzmD}2h%r#Hn|
ze3Yd7z*dxsd6VVRRVB1`QRuaGANoc=E(wFAEm2<N0YMinJPTi!Vq3@jOy)SOEgd){
zv}@F}q<}q-CyuoNnk-Hxv+<ObIZSAW!%<SQ>-_qAX5OjvAb2V*5}&Dodae0pG#l@z
zcdWNuv9N`*J+u~U4y&z}KEqb^OW7_eYVLCUn-v3Io3qB2`PWfCnOt`**IQ#^roB-b
z8G>CW)2MxwPd*?@1OA`kHCShrUAwU%wn}W$lx=4Ti`(^$Bk5g}hUBuju=Mz@tHk^^
zJR8}$7XU%udfOFVEF&J5KA4SK{$>tl{-&ZLhm23vH{Ws;zp1pAj45*yM5q|U+P19F
zZtY#iBR8BwC*)o18|skzDianq)O0u@*A-aMS~M6H)+Ubw19AOLo7#PrtW7@iS;VDp
z{$mjw!}m1tal;x7E>$$O$LgDnD1L)GGCLNGb(UI}<#j=rJj=$foFEg%`j+oY+*^{=
z7oM$@LKN$bO;m&CS9GJIbOl**rTyhIG7G~nH%?%iRJnPl#wA5H=EVs2TtmLHH(>3J
z%V+xw-c*@qXob?}J*}~T^`mh&x0R}i^HXb!<YTOAt5W&+xe<AqMdDfbYPX>}YJM)d
zMkf(*T-*GL4xqo!(nPbu_9k}-UvPulBy*Jc>rs;f&f5qz6!c9pK|^HRx-w|VhTNVN
zTK*t<+L=R8v1CR1Z3F{wSa6!+ElU^oQ2{eg{7hrR{4?Xt)CHTdU@1%D?TPdJ3V~SY
zFc9`A-Lks{Tj_7>B5ixEOie%RKWF@ezkr-7u9i9#sV)XiG?A-qhmhZ@j`^wbal3gJ
zHM|ABB^^r%DGolshz@>yA8o;bp?t{Aa9FIZ=VV*1NsaNYFv-9OxvYpgast$ec2ot=
z4O7kWlL;QBi)5CTY8X}%I4|gglN~u1a$ntH-JGEnYCZCtu?AO_q|=!I&Pk%A-0{u~
z_;P$bPJ*OSaJ4?Al3idBPsKxw-_GY9Tkn3}I^5sgf5|&QZfuZG;ITKdjcNHt1r3Dj
zhW?IW>EF+$wYW2X(a?pT^InWc@gT95U1x?F7Q@-Nos}<JJDqY{?3;OdK?=2$;${5+
zpt^lTo|y2TKpk&&(FaqOHiEx{I^a)r=%H)3R{icO>6x27=aau>jGX=NEz^9<_{KB;
zge|jR+yb*@>Z27j-7;1y|0A}H@guenJ+Nhbo<YHMZuTV8Y{#ux&X=Ut)SfCcLmIc;
z(C9o`)U9JLn@$q3)E(;$axr-*Ha8zr88z<SosS#~B8EYVur~CzT#-r|)J{}dccoV=
zeW07@+>eon&pnEVX!BV9)o4v7CcD@oIPw{*c9WIEM<aQ4I7|~Gy6TdX8z~8m?&5uN
zw!$39Sw+gA`qYd^mYb(g7Er<zc7qBg02OL_kz5oBXWhf(65VjNP>Xfe*=GZ)%55tW
ze%qc7YY|k%vbKObX)LSU9@;ZchVyN1>Sk3ElpMLObgJtw&T$STTM2h;=d8zwgsj0K
zt<pi9TrXlrR5!0O9GeM_YQdOl0F}T{CRAqmp1&uD!XQOMPHyR|spPY}VW{lthva%E
zVXy04k&mNcVcvx*fh1L`gpOKOwd!&;c$^<~5LO#yQymkzL_?@4ou)cO?o7C3QlS~W
zNX4m*w+dvi+*j8TeH~f!Gve~r;*HjuY`^Ml|JXnHd7pyvs^N#n<N3}qNxC{uNbOwd
z{oExzGM3BC4lyHMj!tK&VOIM=ta{9Cd&POxNS~mGV$}QP2psAXi9^9rPkr=+4=jhZ
zV~FW}%oQthF5_1>?J_=pQl{d%Ahp5s`7e~xxXy+y6hE|SOi6qK)^O^%w=Bv!@ewFp
zXmHqslZ17LL&Vtd=37=*iqkx=4$%LZmclkfET#P-z^DpArkb7aMX#RFv7(-eJAW+@
z9Le<_O1kQnkMbZjyrDFA!0uQpf<M)|&8z2zyP`bZMmwV#O8CWC4BQ~iaWzHrgYx53
zEkCHIn!gU*&|9~#p%ibbN6l}CyR3%J3qWuaOvAs=ZyGyIo|bk0UuB|dKb4jgp{F7S
zAU?v8Rxi}b%3?dWc3`fSt?s;gYR3n|r<zUQ&jZF3vus$pB9JRCUT^!REwpLm9l7Y|
zlS4LM1HvqFaXP%21w(aStedrmbbNUdr$y37R{NWO1f)6V`p(=s;5jlCg+rQAoD<3i
z-oGd?o+Jf~A~(BnGDuHTKy_-OeH#d|gg*F?q3>iPRBz=IsuGKpKsOo_lHjULu5qn+
zR5Hx+44z-_#}`RE9m<-TSz8x<xSy$oKmL%b!X^iPjWCEi-3LxL(t{`s#NxCC-3-7#
z85c82auguud~qxuGBg9*Nrr!wQoaO-%`3P&Rf}cEC&SbWjg0A$`>-=IHM3lcT6W5&
zav-!4Xb3#zt%}v{jmmtb&#zpJXVXM>=rN{%kYsi|hN4TGB%58Z#AMx;N6YL;9O6)k
zHJ=Rnib=8)-EzB~F6#(kZStws@WapFLO0{Q31Li=DfRgK1&HqXpl$lV=v%)h`Dt4U
zDHdWeYaTu6FB=a#c=wNwnfu+RvgMerv-aI+I%rPs(z|ytOb#!sS?|B&=Qfw=8n|~A
zNJ3-k*c8*dZ-)^OAB)HV!W_u#0|ADAW1#zjpRT-A0|zx3>z?3rl*fQ&s4Z;M-yMx|
z(LD=F%Vi*WD%4cG;3$iC0!*~cJQD?>EVH9LpE#c=I!yeL6vt>CkaabO?+cH=@%(?Q
z79W2r%Z`??YE9wYZvijQTWq3T?Sih2l5oI4t7*ix2L<lS4i+%`Ho(RBL3IoXfDLm&
zR|*&QUX%TWuYCp`-@%laY}p9v6<`4TR+e|2DBw8!E>-dM`#5o%`L(Iu@1$3k-T&Ao
zgw&u-2`MyE*~lb71*iD8P4$}75~}*eC`sk=1gJ`t7-O%JDXrqi;@@G1O%5TeSJ1lN
z5HD2CDAs~l7~6SJ<`W)|+5k{)=2To-iW@A)=PijrP!Fv?dE;f?p8?Vcs=%+1HQOk;
zOh#RcFJ0yvtku<3J9!xJE<iU&If@Co>vl7BWsNrSVDI42x<fF%gfcAux_1BmJDaO1
zK#UojM{Syevj>pJ^?Thrc-i0kX|KP#|Kea%HHt536#eH1dpn)SC9}-BmQbG&Xz7>U
z-rm8_3%1oeJPb5-*jsc=M{l>cdq+oswq73gdi&+phRJCRqFJ!>quz13f=xUx<34T0
zSlmV6H${AE$78w)mBqT0wh6Q1aYq+UV3+CNJ_fk!9+d`GkKnkow<eSLdN)g_0bYi_
zMawb%r@0u2dx6fi{wT?m<VS4)Ny|B{^X~&b`E)tMWtNArtj<JfgepNJcAHKCZ11TV
zgY(T|Jvg-?&>Hl7vB#$(X-(3zG>b?4k=v6vJQ*e@UE#JcM-Y;<Zyf*H22iJ-=YZWN
z-Od=FInc0owhIKi&Wcm#v0p<iPHmw8>t@1r*xX#3`B*cW5+fU$7x1p;h_Jg1@g|a+
z@;p8D77*8`nC264`NINAO+X=!m+;T=bh6ZRsi==HwnM@qn2bs981|yER`Z!Ql{YCc
zPSKKDhtD}NlNI3_0oertHkgn*Df4-bKgY5IxghM7t_^{$p<3N@8Nygu%?}V|xx91r
zI_hk3YS&?yBR%{PvEjN+yB&of24FbsX7mqu<S(_jRnl3LWtDFPQ#b01TZ{Lgy|-Kf
z$ves2Jx02%1<4ycQ1<g_5AXbO^n6`jHLDva2bsaOm4fu*qBt{09Da>h-3Nd2d+&})
zl!1cgWTLPd^-^{5Dq5itoXf*&(gzk55lvc*ZNPZb-7RKeP%f+(BJ8Mxp2jFK#%We?
zvdU5u9C(XzkW!fFwbhobMX2-dw2T@>90)lTbaB4(j&rqk+eStF#aFLx{ZPV3ZQ~DQ
zAhM|!M;XW`6b3L>qh=+XHrDx)Fv7^VACtjsnplprut3V)Lwce3eDx>5YbfEtZ<|^7
zHxpn&mN93nEd<1qv%!2L1uXU00v^zqv&%-+E*)sOH{OmGozxvTx;A#!#erRRwEME#
zzTRUfMr}KjRcc2{Rf}{gP<OLQ-F3Y({vrrG$t|MB$B0XbGE{-OYXi_;hqN30)-7kL
zt%6%w&+6;rXvs>dIO-fj3KQFOcIl|z_$#7AF`Y~X=aV*;>_$ufd&yI+4a~Vq<(Gb4
zTe8|Ix3F1mp(3@&sfY;0bjUVZyL@Y)0wG77lR@XR!PjA}xW(QX(K<9-zPZ7iNZ6Rm
zC*nrM4`^+8_wK;zsYb2oeM-n@sg1keyYUUU{bAAVJj>9tpU&YDfJ%5vty9_NaL`oI
z*@QJ?+AWmB98u!v4pP*5tw<$(=N4R(Hq|v9rN1k~Sl>+ji_Cq2S?}fXkgSq;$ZHkz
z)&qB6<KqkUZw`0&k3rmhv-b-s2o4S_p@B~oAU^$b!LnNrzqL3jcx>7~84-MSbA?@&
z)vB@gqf1PdS%cMBgw(|+2}R#;U=XNEn!1vRU0<R3DD`>^e;)NIX<l0mtgHL9bTMvI
zPon#CFKr!Q(oHB~?PjFtvg^x^$B^Qe26#Y;k72nPig=<A*GcmCSvo-}3WX-jm2=;5
zgAccHOlf+&YguB6Zx5AJmSG4b1OKsR<XmpD5^R-_Y5khv7`D`aO_!5I&8LB#GfZ?j
zYU}acjn?fe6&HQy+L&9e!sl^uuB<hUCaCVxxrKpvWD+WNh60Q2iHXsMV9J-tP&NRj
z-yQcoO-oQ`VAZv>YO0fEb+KfZQ_v8`DIFJqnwB~a_1&EylWxh#FkD}?S8hs|y4el#
zTr1D7=&p+9&y<a_d}nF#h-%S-nl6hi0+<Jb&?@_iRHbYzodVn|4<wLSwV`VU^+nB;
z4qhCY%tCYqIF2C4Q-uq(@T|Of8r^BDMTZ%CoSG@9b&nxu#X6m}X`-~XYO12T$EoR@
zMuJBEwtQkbuz<E03VasGLSU;6id%)?E=w|JaIE>Xp>-!@G;2ZYod-F=qk6OqQDUKS
za>nAmF%4_-smb5nr|!XCDnYBb5-i0=5^VYa2U=g`j-U-fbT3kd6oHmTn4FVUqncE3
z>x0>(Acu{$)wR>GjOn)5#O_0mbUi7Dtk76SF=vsP;C64zAny8eT`5IRp?c3MK=8*O
z5m|$H{13L`?p^6U+{%hg!gQZc7<?U7mwuUY>c;Ce_5AMk@O`xMEMjk#+oK^g3jgx8
zdY9{VsU>TAJZQ(%rNS14`$l_|r_@N${={kS-EZ&9q&d)G`8vZcI7}zgYquSRQv{W}
zPTY1`)2H5|Dw;<B!HceZ%25M!PC-;=PSXoC?oUQzy7xkZx|3u&r5s@CG>u2x4~D6q
zrYrI3DZajjGN<YyARj{;aKZ!AIm?VkN(fzP5^8tZBxCJ;ct@0|Fd-`K4Eu04r02cY
zupNxOhDKq#@701^&?7w)MT_dsvROe~7I0_rC5Sg@NT9LDYwz(lQcLlnn}5cJH=~77
zSQ1j%UASE8iQ&^jS9Jb_$r5a?<&&(sFf4o*wOouajA!T=VlT4^^MJcUG#Oj*wvulq
z=EFU-L951<dAQ<RjH$_IMz>b)f@1>6BL}B8a|Ij6vth_&<@N*~*5E2nZhR_C>BG@q
z9T-2smGq$QnUR%!V1#*8OG!W7I@+YzX_~@)g`AqDA$!Jl#n8%>Pj;JHz>ao)-gV{}
zbaHl?33uRkOQ{$G`2%PYHI6W)T^I5;@wQsX&p~&#@=RKqCLQhnUiwmQz%LT%kOT^8
zE!(p|#lZPQAmLRH;G#OUf%C=_NIH&!>E);gN(jJzR;C0n8_aCBfC~`OFPnzf#yun1
z$R+uA?vx0=$8q~dgasFG<{*(yVohpGj+b;j;~gEgY|>cVXeMfCvHh-!2USy-%~eeO
z8bAF5VF|W?T5bu;prsn4+z4tFN-@buM{<?{yU~Z~lNGGxRzd2r$pwZ7{RQf@w&N_?
zrC_$mn^2}+SEcp?vW8Z34srfxrO(Q%%-E?$<=uh;&ndKd9&*mc_i_UQ5U};j0quio
z1@N73Re77k&s+T4A~t2>COYPMj)0%1zsILahi#D2eky}5<5Ls-+#F!eq(Yt7gf20f
zL_%p#xy#w!hAs)HX+u)>#?df6JxwNT&w~xBROa(jzqFDV3L=Qh9^c$npWAYX*k5v6
zI6=wjKcVfRzEp-RU)T<!rS$PYWL6kvD-1JCEwE5iHpGE`m-i%(UW2R@svQ4b6cdk<
zjE*8@<?_1MJB~mIETAOGfWPGpf@+Zmmh@7Gz?R@wTA#lpT4|oO>P8(OH6J4>ddnJ+
z5<Yz`>@^s9k-)ikyI33%X+F$J$)6!c3J>DK^=!1E<{@kNh-m8;sQAh=j+*i`I_&N2
z9@z&$ryR2mpQZ<hH1CFj((|3Ok?;v738HBfWv5Eruy1Z*ys-<|ckZTBSCnN(#IkU~
zod#v68=i0hs&Q{QdYJ;lggGjU1kiY>Lp=~tz*(T}dY2MePKIb}2mC78O<}?g)4_6d
z6{n<avTrb{5sDW9JmFAB>6U9g6L{5b$7C&*<c!yJAy`bY8M6E18_HRx#H&DPlwy=5
z<Mw(bmHHV5`y!vn?dgBOFztvS7-+mmPG=(x4Xrl$3#4A1OU-Us++39k<DbA|{tsj-
zLtE~icpwmicw=Omt8H}`_0PjSGl)*)45)l`61i<=iQ?Lvu<=X~PW8rN${gv%B)_0;
z%m_JufeV7lWuKQa+B0Re!=<ljG1|#Uf{_W49442^<a&CJgj7fkW2&fsrLy?Hjn(f`
z_))pJ{Gw_Cf77A0bbsscaO;=;i^E>8N>iZ5+PBwdp=k4bYKo!Jd{fYp5okT@#jQ+|
z(>~qRi_%*EZFCY?M9dl2y2`N84)}1EC{w*xc`-#C+rAiXP0k83$;B%NHp@ljBJ5}G
zQvM+J%P>HMU@G1N)F~QuBke<z)NZpj>*P<?VbKQGsylVI8x@{1%&cQU)nxTtxpSa~
z9I6Zt+2mtd5DOt)1ct|C2pSQh61Ehr=&T7rkfuY~Oaj%too&}pyL$IDT3L}=E26ao
z?&%5x8moXNUCauHu$?4DJ_3F$Mf<p`sK_}j+Lg&2eS&BwmvO|JA-sqm(oPU=eEPcU
zIUY{=#L#-S&+ua{hcscg0q&CWD9`Ca7j;RxX`$laa%WYZw*+v}?F85sr-`QF-+Uhi
zBt+-R2yb^s8C+NOYmr6ow3(B~bl!YXRl0{3c89{m`oZtS*~o6EoP!!4t=pbW^9!Wb
zlo+Q-Mj%oFk0(>La(kH;D}!r0Wh!!aDN+ISNayLn3YCZr1uEbXwk4-CWjIWR9!0M)
zEteiT)u(GPuN!A`8*nSQ<qdJ2Z|NAYfDf`LW%lHgb=3JxKh3mVm2!qI#Ek8_Oj{W(
zSI@rMcwIN)a^JN!%T+U)Yj&<X3z?o*n4LF}E-L1LPrb%?q4jFAGGa)+@VfYx<X>`C
z>NJA$(g8V=MN<QFwHdjV+R5vWHRU*}(#6=RzbZ&dNtx<4<m_SmbrFA{6TH?`nAIyr
zrMl{HQkqMiqYc!H)^dilh(@qh6IhRcrNo<hI5cpTVyjbuFN#A#E)!Xmc;x4GD_~g?
zTuUq28YPdV1t#A@x-)kCo2>)I$xQTF8lf7D*jC<-Ixv~K?aogbDVoH!_K(Wib8((F
z^9Fc>)NOZr>$taA@>XY*o(;hlMxHVP;hPGJeiM{Y_O;;508U|m*yvhxu#ODQrT|n9
zuS6A5sZ>$8R7Y#X>#uEm$=4Rh#AwV@Df_FqyZ_VH-tJES)xps*$lovBhSwSi(>uVk
zO_TZZ^xOTnN4*`AUoBRtBw<^ge#(2nSigIm#)9H&rPxXxkj{aG3G&8NmVY(d^)R{M
z$V@`CIWkj8sIA!n(r1ZUS4gT0F`_j}HwL3R(2&E?qfRq+>I9;>h@flfy?nV<iRCuo
zCGngcf^0ARZxl@Gge`%YwN<KQt0poP)in~8+qk<I42@8ox^}>~JOj1*?)5Qm1K?I9
z;j1Vfz`TppR(vH<E>Px=&*C&&t#om(nNpCmd2w*~l35b>s^w&60&TFK0Ry=;;dShb
zV`<&KI>tt8`5eXG%*|!Txc(P&15(DId=6CRRW){Xc+G)Up>dIjWvKpU@U)bb2CoEk
z&;$vzj;4jQQmScE@=!Pmj%%U0)w+pk^Wo1`3sh(XYOselN`M_|7}MMh^WAM~{dbep
z^*3aG?5D<#@}HBpzRqv=CNPrCe<J{u3G`>dqyaqYU|~EYUSPB@(qLIMlp?8Vu@FXH
zp+c=CmE6eD!HeTYRB}k{*w7DC?5`9377k9%GNegB?i^%3l68t&H~`gHV~{fw?m&GG
z#Qz#REv?4f+o8{AQ%!u8hMa0OPuEO2*?^m?y0a*o+RCH|ST2;;|5*!182Im%yZOq^
zxo-aFtm=#OWBr;ox?%bwa5|L|UWdV8BbOBusnOttqyINj)*)rku7U0jJ(fK|6?1{i
zu@zc7T&Ux_TAY#v5n^gSb97)X3YSh-if{3TQ#)W@l<RzE?9#@Q{A83|6zV2*qSI=)
zrg=d*GE;fN=iXpaF$?NW;D3BXbm8Wn02-mEE&r-;#r0(ebtU&IzXBdKyO!F+948!I
z#Ti{Pp|lsZNz<`T?l;5E4;49a=cU)HTNAwnPG+a?9{B+eFz5@0=OacY9=1<m?pcnl
zq*<p6Rl1Kt-tSc935n?yaojOZB(UGWVWKY^S6K0lHL)!mmMTeMN0)xhmV#zzNEgn_
z_p?gWBzt+-(m2^Ri<#IIVmN$)U%i7D&~9CR8h0#yOf7sAl2Pm|C?2>NbpXEc@Zo!#
z48c0j#n5SPA;B^s$o!0ZP|A_Kv7@q_tuXUvv|vaJF{2zLsnNde?f@3rd%6Oz8lVnL
z-j6m>i#YR<rZK{VkmbgRV*aW}5OF^RFc4}m)ua`NpFX(?WT*+9B9dQ4pCkCz%{c_<
zA_h`-Os*e8;8X(&8C>$|BtwZpG5D+y_9g2pRA`amm7h$K?Dq+At8q}yfdoB1wQ9^t
z4Fi~1cvjgamOmx?T!LClDr1dj$6VM=ak9LUv`6j}CZy1u&W3rGEJb++Z6X<`aVNvj
z$cw<x1^G%T>QpaB*2MpIdo<gGqac)5Cg22HNBI}trE2y5=aP6k2oS<2YT?SaIzd-^
z?V#q?0HkOI9nN{jG>jTl<@*q#6UAg;WjqL!E)xzKs^k|d(+(db*n!sE`ZfSMu@ICB
z)Yniloy<$(7qIEZr`oQYAXc&Pay0w!<Rf|PZPIodMFm{W^9d2LZnV^0s<z2q9?wN1
zZslJCD|oE`BhUgLVXww+I2Xqo$G&x&Buj<3y~G*o{Dttt05H;TQn*epe18qafkp{$
zfL)eEDqS{+GC>4UO*aj-@o!|nXAX_fJkOlVFbZhk!rpj6sKffP^X;GEmsIZ<(kSOK
zrAxG3gv!WPnab-H=BMX7w_v8iaLr20$tuJxFC(z#m7aPR$tA}?)JNb2w#~bprI#2n
zGan~n@<jICiSHp8!on(37@Z*|JETzfO8UP&G@PfT_?8|F^Jy`LlzP}=%fD(?KcW^P
z<bfq6<A$*9BPv3nYBzciV5L>AEhyA+8f14A^ZJtqgq;MP5O_Hd5*8rl4@Z%&2Oez8
zqX~>e2|gu_WGSztp>M%;G*mSjkK)XlL0PNpv}-5JV)LzLZUEMns?^s0(mN7suCjc#
z<EpFZa07Wq`!&FeagL!@%5s&c?r5S>`#LG^WqGHWT0v`09(Xae=14I%x?%PEVe#CE
zHKf(!v$h2z1VkX2-M2ld+Uoe!d7K$RKOd9E$X|nlH^=>-dWX*sj(VjX{ZGuTSLuRU
zkzV^X&@oB{Z)e{#EQ6I+FL+jm9t2p)d9@}RcLV>_d-uXNM89T21U@HHc|969){J%%
zJeNuEm#myi(53@kw(5V*Wzu1C62k@`G;sfGa3d2sgO;z7^z0nY-u>K9t-)$3m^k`o
z4Ws|2cRTFjsB~*x<@wpb7mOhn+7rHCYNLkw!PFaOF_E8}uchX;N@15p4mVOa^NLGP
zm%M$4^B&hZf7OWwO<cn9sgUP6fb13P{!iO??~c8}Rq@{;`^&8pknAs03_Qf9m}Ltk
zFX-Vs5l>Mx#nD=BZemo+294p6a$f>&aF__vJ&mry$05UTnor|VUzfE|otWIdwW+Od
zm~oLKP0YUxDKS9isbqzEuiqU1!dVAYr+OG+t@sx-mqaZCvy{YI5rp)`C__qX6~3}*
z<>!lpVUx^TW&zQV-;4Yk;JR#l^3bx}gF!_HyY4<U&6vV2n%VImeaTamDTOEZ&Lx#Z
z+C$))e43Gt=a0bg+Ec4o-g;UcB`t!SnvJeCa}I5#(`c0EABw1mvnn$=$4Fq^8poG3
z5~!w6b1eYonQLnc0cJn~CIZc6bA)I-8q7xVRGInW6|b;1bXw|gZL87lbct_Gv)RQ7
z3^_mL4wj{wHs~(S^Vw(!OHp7L`%}#1kxtXggfiKofjPa+lCzlJs#fffJ|~G9#n3oY
zp)hui@>M><5T-CP6%UyaUya)fe6H&>xPDee1uaZd7DY1~<Ik}9cDBd6v=q!9p^|(Y
zv&XYaao=uBi1?}q@;0UDM9Y;przwbqVermC+9PHwdMuAUs-&tgS(0C-kar4<6Oa$G
zDL@C!v{kr4sD6@6uabmZ70sZR4Foi9s#Gc2P;UC+RLL_G&oB~}Q<*3S;5LYJ99_v^
zj1Gwqom|r=pyU%*$&F$zRP5Vmw&v1*^Ql7f?Lo03p8}&ZkQ@xLjvA`d_@rpJ*Vooo
z@SoMSWd(+NZiAg*xM3C@xvghr&Ykjf!eMr)0R{JGQR#XYpSev1PBCoPt=9?e`*oX?
z(J@;pRZEk9jwhLB8ZCM%PM){slH#q=$jT6e$|3Qgy}i0|di%B+bOVRWri7`1w=-;|
z=gA;O!vNR@ly?DUh586Id(ml?D3S+`R_#nE9IF{=%09ce0ALUEgdL1fK^(2EMz7JQ
zxM1&)SeRG-^IRN7;6S@fhdNM*?8XTiD_q6b1u*DST1VJdT-(^<xZ%^ZQIAbUyd5%!
zI$O<r{aXb!L{hW?_fR`<^_Y60c-u}Beu3~c4(2mP#e?`;5%EeV?g6hs{PzNix{O%Y
z;}pBK?3|6<Wo<F6I*ESVYf$OqxkQ@17!M|ZuqKUFz2Cwy2@jfe#(mhpdD5Pxb1;@P
z4nUPofUBufDYy+bOvA%?<sJ2&rogD~(T_>tQ(EYo6c%zlFC~Lm757K?ko;Xi-@J2$
zCQv9JqzL$9smPWj8@9F4h08ljrp_MkswU8f#VURQb7u0v+gnxo8K?yklj#*IpoYmu
z#667vXpf{z=eYG28t)puQL=L*zQAheY~3o?h%^hhG|1@|0;Gm%I<mqTQ8Y+vuy_JU
zHj;Zn$ULfq$No?o09mqnF&QYUAXgw-v7M8P^n$tW&k^XWV;$|je!I7I+;ezSHQFa?
zi1QfIA;rgVky0A5lgw7$pSd-qQ}1SDc!EkL;9`at>7k6N1S?erny4xRY@aeuZ9|(+
zu+k6M`X>D48)B-m0a~oH`>;>8+FEQX5y%#x+PayOo_c6v74e7`Yh+&7v-!_ZqHlbD
zBLQbfjIJ@5&dAA)Zh^JX>G0I}u#$TuSFx57svEM%v}@T)j1k?(maQ(DUu|*=YMndf
z?$n*esN4%ltdzBZ^D44%W~meGdktNQI9VFsAAeZYfl1M$SV$$hMSioC%#&gPZ)*Q=
z?qy!2ZFyQe09(59qXy$MSDgx^yN_#Mr%xq=8X=M46ol@ftDz+4t=h(aE5$XgjHz6I
zTlt@FcYDXtA9aulReSqpN0VXusk`sApBpf(>bdznsQoN-^LZnZ0i@z)6>oCAYCn9{
z8gOsc9oW~dHK?neN~BXyov|`L;s|VhhFWKBpBl+#4P!a)BDH#+HIZa76g6dyP?Ciw
zO5kIk<)rTsvSr${PjXD0R4##oa@t`vx$qyh-dc?B{E~_fQ{vL6a%>&VnmKlRik_>l
zm8xnlCx`R#uXI;^luVD)iv)1)Cb4z?<S;sPWb$a0tC2*~vHd!vz>{cwt=`BD=1yWj
zETKlEA{<~N^gRb=Kf^WxXJG3h9RWH}5PHf<9RscpBaj5*k~Lh}DQ{jxoPYMkdj7%W
zog@noI}PQ0`CJ7D(VkNZuxZ8-qZ<Wb;d_OD$w(}9wnF9L&b9F@4)$N{zN8R&H^`fz
zL3-3XzG+pN_6h}XkcGTqTT<JPjlp1WZuaOMS~|OOT>hcVlm|j^a6~rGOln>fI@&Y&
zhw1?=v|Jd@;;{Gg;qGy-b+h^YQ|DTz4NtE0e#XQA$ZT5@ZxiV-D@lKf;Mga(xysf9
z-1NlyBpLQ`uH`!w+ItGbyb)V1Q-s)jyZU;~+(}gG9UkIzr;4WWR<NeOsSQaQfIutY
z%BFmJRN)||niwlkRfH6@QhTYGg4U|7qVD40$1eT{W;X8zLM@MV7W_qmaqM0o9B&Y1
z-)3G&1<<c$WxAxc>id>?T*#Vv|Drf^il7np;9_`sF<pcys<g!WhqVDpz0L!$cR5sM
zugqmx1E=bc1y*2C5{(XXF6LRZWTMMs8%xMKO_IOQQgj#%x}w@otC*drNVrQWE&USW
zZo`T3a^X6j1H9kiRrx;}O!QMzK3261%f-kde>7P;0n;vjiCi#6*y?KZOFq-O=XyAe
z;{sVyZYv%RCy4v)6a=yLjkQ($zxB;;*MK`-1bWpZhIb*7Mv5uuszVh!*Cd*n0-J)G
z6ScCEHJ+DX;Rf9C7fY;Q@J^p%4k54^LY#Fu;|E5!Gy&K>hw4?+$Tr8;;${ZZkCBeR
z#WCQ0*jmt#8Y|B{-?Cu%Z;!0Ew&|h=uYavL@x-Ozb&Nh6#gm5zQ9=Q;;PzPD>}ZuY
z+V`TZ+4Njzzp}v-Sqp$@*+&bF2G=U8=wrV=?W|_?v8Z)NI7)Gp3fA37_aT2`@s3F~
z2jpPxQiLG#jRL2_q)8&{0{ipO4#}oR(%RjBanQ1NhpCUgAnHe5Hass*y=efwJ52+)
zqLIB5+;5K;pRei>DDz&P5m9=PCZl27ZP}zD>?awjxrVO8ahU64qI~RyUy!>^MER2>
znjb^e5olfQz(UjX*?K)g<)pRPs_#5M+WkMhf9Z9nyVBniw>`|1eumphv;;N6j5)aA
ztoo2#%T?aa^JtC96*S&4QHGz-Qdswxt~a8UXN(OO@wn<_0$NOFR#4<!(AG}wJ1>$8
zOkS-EQ~n3BsL(Gv&9xx@1xT>(lJUX6uqSS1B#yH6+|#<i9aiyo>HA<hOTD0}XKJaQ
zP-KE{+`ojOQeuH5w{N}PeR;@XT@fAS-=V!h<=BbgAn|vee8K~z1a+&UK|F=O+x)8A
ziniV!zuI8^65zYli2gyHJ&w#2LYHLox^SB37E3T`EPTvM=CpnA<`-jl?+wk23yTGS
zd*g1AEN*T08uTnBTOE^D;w^ymXnSiPnWuD$4%UgWI7Q0TjV{tN^t(p0mE2gkE=Lox
zXChh@s~i-LCCXqnDRLybE8l<reb-W;&oe9Jf{wOS+VY)234Z+P3GFY{rOi0bIlgFn
zEp~(v#9)_fAH3Z^zJY#}huK9X|C+BK`>eB2wes2LApzy4i5(>-_ME{}QbcR^<yy&z
zET)R++0$sFNy&HX@0<1Iz{pfztEhf-e7L*+(sQa&s7BX86^*%)gf>uKpzGcJ;~s4H
zioPov5>~`jTf%Nu*C`c{Q}DL-j(4J~Hi8y}woLh<VsutFC0jyS)(?}~MR4n|hy=re
z?yzDBiDxkN^+$b<Mp+Woe@w1l#l<;U4L~DZYGagSelK-#;LOpCe^uB=zSczacA<^6
zD5My5tD<nApsfCG5Vn0jsS?`17<p1p)u?XR9L;pC8@P|bhcEn*=vAzLkl3l36C`vK
zA#mj)_=H6*iRQs-Bl4e9Ar%^0AmP&@kE>1Xyk62LHE(KCm7INne9L}7r9~p*S38%M
z;D_mh4t{h6%b=6JzJ8)0LUUx_>IHFuTo2N+M$ZhOq=4%1#=_LX`juO#B4v@!N)S6j
zJFcTcm&kADl3{@u@GatCea-Dn?ku+B(WrS~03*hJ^&Cb2bk!;XL|NqExYZpOio$Sm
z5RBMXQn{64jb$Y%Qz<1T*Ql#;0f11e?c$%UL5F_nnx#GoS4O5M>3eI}>7X`*Ebezd
z;L*RFRRb>WXA4Q}M}E{l*x&obkCz1}hnt^9jn|UbNe`ob;gASD(}Hu*eA%&*YN6p!
zpN587HC7Hk;EEfW&W=H8dCKdebGZhigVkpZ*Cn>b;{+&><R}OHY-d(h4kkzlw_>X3
zQb#C=YyjW-9%$XHP*)8vlc`uHSdF$X^K^&}weK*A_St`K;+A4E4t^xw!?u!$T<|--
zE}PK{vRl3taB%TiewQD?t68?YnkGXnbq+@93wlX2IgGDL))Rpt+zz|fv>ApSzZ<VH
zbwX8_a@`+!sCqNkS$o(??cEjpXW!gEj|U%S<Il|J=O?!RA8<x;G?0E;6tkovJ&w7F
zG*$HF2Zbci_Iz#A)DO{GwCRz#@-si$fjWQdiSG$5e}9;g<Zfp}ytf=3AM6}#!eUBv
zQLAifuC?JOV0%8f*19g-(7zRVW~o%)nR6DQKsjSoio><P!ud<sV20Ikhq&$$Ff%*U
zC*m()OuH`UUt>I45wj4#_ND1^Z6NCZadfaR2BRT7vN{h9P&eOkx+R(v`j+a{hmFIi
z)R{l!It}8=v*;)$&#l9q=WJOz*HkU9O><afvk%k;x}aG&ggCf<zh>|4kd63u98b>;
z7B}8X7KKr*yn{B7S5?0|=xNBI#_uh4oOLsus=?tK7~nlMyxLOifr~FRV;z7_#Y)M#
zsGCwZv+^|8C#;?ZxAtOpuNN(|GW#?iTl0hgUEOu=HgODdFMN$LLxKLT;`CYBKdsq9
zSGeQZw2*~2Ksg;?G?X^Ka3prMPpmCszp{oxtdvq7c=SaR`TF}f=W0|A5sZd$L7Fmh
z0H%zNDjH3<k!q$j=AbrsRepso{yBx>fq`A;vnBX_mgCYlYKp8?i)l`g1=2!JhSiYj
zBRD;sXqmZ>Xh2?rLp&Sw8rP0v(XA+#W#NI4aRGC$6xAj+(Ti@`Y4!dJ>FQo3qlK9@
z^XAg#M7Tl2g9JkdNVkBo_o^49uI5g1YIT~jD&@DwVcm{Gc4;C~y>Ghg!#EyNm|8fP
zA6mKt6)n)7S4n|THOOdr2>(2d?o<H4RWK0u7hfc-1ra?2G$3)KyEsJtrpCIW%3G(F
zKmCaH6{a2U;^8+|j{F9*<o4ljoL#vgCy;GfgGMxz$BXETPT2bI&8XG#WkdR!lj&$t
zWmBMhGs_^6iou%-6cOw~-Do+<k%(iwduc9Ik5)P8T&z=ZNC}D9IG&RvK}`V$W4QrK
zD=U#7OHq%+&7ovJ7s<t7e9cKL#$9PR&<wV~AH(TBDwZFys?qxEHp=K`%v%K~+=Nl;
z8Pgp#0^)8c2LuPbeD*Ygl?&z|DZ34iVGdNfya<2RRQ(kV8;6uy`Zaq210<QKivi-g
zDh(X2@Mwj(^CFol9~}x&9X?cBgE*7eRUEbo&5J3921(Nx=_k96uJXwT?ZK61Rc&E?
znW3D+nq11(sweaZvPo;`d`&%z${PkO06U++ORpAvw<x(Y?m2{952K2XOHcp($T)Qa
z?6ErS#egRO{8otJxVOCWMW1h?<!BF>xop7s>PPZ7u!*Q7h%PvA)tBrQ^$v=0A|<Ev
z`5L-<gHULXa#%Y0=OP7;-})KD1_rSRBP_(1XZ9x+snt!8u}gwIJ)V*M+QHl7H*b&o
zN5@<HJ6nf4p%h}!9q_ZG(Gatbe^h@$Pn#6>C~D&ikZ~@6IWIZ^rkBP`qom>aa(+m(
zvjV?W4SD<Mr_g9=bo>ttj{YJPs~JRt&JMSJuIen}e-ILlIzxp08z6j|B@u?s+28)9
zf3)@b&0eoh7JKV!sJ60wf=MamS9!I2bbN65OMj>LV(abRG1-(H0&foN<l0)ei3;>0
zrMjA3N%t>WD~(bTB}wYjRGA-!=|(C<CjVhM`nqk%KI)@M%LF74D`Ac-fd2A>|K=Xr
zSJf&P=Rt@^V>V3H=r}Uf)99kWW3X)**c~Ns#39j&F=U1E70_b_hzw$miMO(%Xa^qz
zJnUt@`(9a@#8+KB)r(6ECv|lWWSV2=;WA7(-XTbH87eNOMmcF=ssW*AMOXSxhG`DM
zR~Nn~rE#)9C)!a6id`lX&a3JpmqoT&E6sN{ohbR3PIdTO&i&;Ca4dsaeVJ>#r|yMX
zZ+7=z&hd?PnKa+=<kxKX-T@mUxC#J#oEh*u)n96L&G1)fJ{EPG<3C&SRprGM^Wsvd
zOWtn0*Lb7J5ZoaHS|j_<NZu)z2^!u~f*+aC6YQxY-37a_OFzRAb!1q<(m2+;%?1la
z?=ib%0o(&m^HU5TeNp~#{p8)+OZv~okFd-X40e>nyn#n)mXxDI`R6dwb|mdc+5Mxe
z609;}X{;|KCL}s6)SuNS_M&mnC1KC}{ryGy#fNsrT8$7AS~d>|ctu?~aQ~z*TITQy
z12N^JScTJ=#MxQGssfHvTmhucJ<o0zpX!sqE>+%=-ofVrWmb%mWZVuN{mZuT@TafM
z*#aS*PSTSZ>BW(yMc|18Z4qred<63tVPNu)0Q-xt!0!4i%?=#c0e+^6o%se&;^|~I
zm{N4uJYr?8Frv=%g#E#?^j?+uhj;YDB9f`aG6;7cHF1ZgPw`mJ$W}fr%t_y#!GJoN
zW_XM@k(YfF$V@t=(7jeGu6;d-;W3>16B)-=QRD+kVPQUD3zumzi%042v7X+i#{>~n
zu0oO1SvKHEY`|E^M0Q~2#PGq0-y{<>5#U(rD8B=6F5FfTS0pYcAi{{b5j6=m9i@Ob
z86yZ`4E~X3FsE-Y)c1099Dl%Yn3)9iqzKyv{DoRQ48(~6+0k(uou&#j$&&c&>Dd|D
zw=73XusTZ--8rrT5*Je$3~fCM`gxKt{~28*amMjAVch_0K$O4o5zqliAdKy(-p@#3
zKjF|koNFt&O!Ha6(YsOb!z<!ZA)d0+d<<j-uL~1BzZPuxC6(iw6G~*^1y6KraTw=p
z@FBsNU<Ep8U^~*n(c9N;sRcs*s)%p6gegvIEt-v$<1S8`i>k3~;eB?20Ynq%Xu#o1
zH69enR6{`xKnNAKOejQ>L2;g6?HPnQ;^DLdyJuPcuq94_fo*yCn=sA7NGb->KnD5-
z=u_NO_?JdcOA(Kf=~TO=P!=?bEC>J=09b+BV@@Y1(?Y%xPzsISb?nz;+;CTbfw<|Q
zo9VSeZL=z4Ao7KJt+s?}V3=o1v^(KAfeuELP(TgEEIE?Tq`;*GPIqt)tPOw^ue|h3
zU?-{2^UiK#kpMV-Eiq6pbfI*bYZ{?hnYH`(-`)T2@x#Y!7sALKaRim*i~?~p@unR#
ziU%Kb1Ge@?bT-xvAKj@yJ&G&qs;rZA)Yd$jLek#^NjcCz%&)Bg*Ow*iqsDDzz2j-D
zcyv!AzxX@Vy`_wH=KKKXe0z9tdw^#;>bI#z*BO$cl=juCKjKoH7pnvv<|I(DCK$nM
zQ5;L)DUEOK;@8Sc>rZ@U!3JY~GdWAL;bxgIFp=Yw0&)f;MWfj2MUH!2hg8?38%+W6
z_)Fp<9bHobKXgs5+}C^5xg-1A8&=I}p;O(=TvcC<;HZ!OX3%JLZ9Q6D-*_0U;{P5x
zr+T^idUvCHzq`7++WnrZ)9J8|SpB{5UUk*Cy3f1Y-JNbv^}fE=-B|11U+X?t>ponY
zSN%ozW%pHgxBDM@@ax^xjqWOp=s_38E{IiC{m1TJ_jPx_d(eH;{m<?X&^yfLLHE1v
z`Xd~|qqXj{M{Cv9(SQpmK1>xjpxd`MBS*Vz>0g68uC%p-n+SbXN;~kk3M*qDyFUX(
zJ_U81nm_q0h15S;>l9>S=c$-xj$lFikZd~8!Xq+~@&aeDB3cxHMh}lqTg=N4163%d
z0K8Ft7Ej=axd5OSgBT;h(up&G^B5E5pzs?{G*eobsV=Lt45$l{7%D@#V$Ya)q7>c8
z2BaU7XnkdU&DmIXOC*jtGWI`UPp);BR+m0?BWw6;NGO0kbxLkL#G)%!Q7Vb##4Eb-
zkXl{#i<V11T%(eI^GlWrA_ic|byE@wmIk>Y#WtK`8-B6-QtZA{?7m;@ffRe-6nhYu
z1QmPe6e~^PkraF66no?s`&Np5>lFLeFZP`j`_3u$onP#GDfYcn?E4USsoa(>hu~cc
z!I#QCx65sm%H3Dxw(WBFOXVJ@ayxdp2c>ckRk@yB?qR7M&4UWQPz4!Dqrg0<+)Jn2
zMiiI_m3!rsyB`JSLFIOxau1@wJgD4%IOQHjp?OfjAEh9nduSF^YR{DN=kUOkdTmPi
zBm2&j+Bc=X^T+kb6g%KzIIc%QuyL_Bx)>~fc}J*X|7lu7oepy8c2O$xgH5Ke=(AGc
zPme!G3qJeT)`HJIR|{?*VQ=!WNf-yxP;wb-9@#lVYGoP)i2!?#&LLXi{WNk*1S58M
zLWHfiSI?Z79rgr?#Y2FRAc_Ailx(25GB*R5z8XNEp;?V0Go(5Vz@#la#@)NoZJ?nY
z7JACl4vG%G=ShX$Ky(Bl6>>crq@KUFHuVU7#Ylbn6*Z)XJJ0*QgBShRTZcdPG13wo
zP~V7Hmtc<Q@dz1K%iC%hjVsqFOp5(xLt#P5v;x~9bN1ewJq$g|aa>4q&Mi@GWqeU~
z5SxTZ5(cidoAVp{MmEALsDziX*)>xi9QH6}Q$2m>Sxw6Vb|Mvo%pqd>=A^wyIF3?h
z_7vHj*#(>xrsJ`_`!mXuF^xxER8dBkz(Ui6FDUyF`X-IZhAN%9>V_&>`pLqG?RXrw
z)u<g5X${~Lh7?Zn)0S83aCmZ%jjkQ}%dI>ao~&RlRBT|qrBxb-NjwDJ{wg}To>FF`
zNj^IRiNT2`xJtp#P%#nZ<3#N7Q_1!Qa~fXbenOpxg1~92^_8e0iBS0p=fE{;JheGP
zAs)ThF#0vN-3W%-z?f_pr7RjTexu||G9((TJVRA!fsP_EATXH`b|bcS6unJ?7fMIJ
z>~GT`v7DEsRHiTb-f?_A%H!cG#^V`ACm<xjcTzwj$zVl1wIm)M9h{bor+~vrnGt}1
z1$!TWGWn2@*AmEe9F%9473o=)3~gx`26=Ry4XU631iud}uT~cwq;g?CuFOS0w!#W&
zoUICz%CjbL+4D0x)&wXz^^2a5sLvXuCnlrcEQ1XLT~X7RAJ9ttHJ;?te2|Y+TUZFj
z!&=v?n3dEQ=o&#nYl^Am2q##HPLbd-DdHI=9^|`?WT;x36%<dDEGhs@S1Z6uB%=su
zgh}12>|h_PegEivH(C}~3x!=7F1Kv~5&)2EpD{{*26>xYZ4sSXSn}5i(S=83!TYF&
zs<e7U2Ctw63DU%VzID`04~}-@|MNuF=NWd2<~d}6S;$=(ZNuO2(uA)R(6mnLn1P%F
zC@OhXf(4O$*>QvJxV!E#o?PfjAmwy;s#qKccrqJ(z-@O1%gkob2)I)6;nMUCeN-b@
zrX==Dzh+CwE{zf7Xd3J@Xj1eR7wtr2HyXB=s2)ornykI2##ff=lR_YN5XMTDc$F6^
zXsYZjr|J$4j%;u-#%}Mf1Go-eY__@&m{+4vP;ByvpC5M6gt^2m*kcrnZlMD-gu4&B
zfjYJXQcgReJV~aLX+9f`WN;MTdVQ^|;WH%9Ia{~{?L8O_Qn+`efyhOGU3LV(BvL!C
zbjm61v0=kN2B@ZN6}*p7^i#1gGA`wErpUzl+Qx(TMqQUr(lfmG>?@lTr9kB0mPn|(
z@^*$90>JQKAEO)m*JFFtFsh@TILM-PD`w_wnY#P?&PUEJDi#MZ<t?msp=$9Nhld^R
z)afM73Ot*EM^8uALFHuIDA~m<G?v?=QI+|5^?<}DQ^C~`Nkt`hxC8g7wll%1rE<jd
zz;S?2nIsDOAQz$6{FyR8$9><4ez1Q=o8C|r!rYXQ0)A+ux;Y_LEnw;-Z_YS4K{S74
zCU+CvbK%VyuM(L7@ZGw0$p-$GQ}n_j&M>LwD80b2g{z(=mI1~*8mAtib!OKfm7*qA
zO7&~^6Tze|q1%K~oRykb5ts!AhB>vYk?Fs9d|hZTU~lD5=q?l^6r)O&c328}SRD=$
z)2k4-z}zb|0p8hJ3bz@+hXA?FPfrU9vt~#gx+gKJ%^_Gr%FTL8QQ(m-&_q_Fz5MKq
zyne;ijc*E>m@pyWPF)cUNi`>iL?Ipo8x*!Jv}5Ihy)#^KXlwgNl!Vq?IyZj;^T%rm
z$C5M`9c}PNN3qz7iDT1aXa}29e6-<fT~kTRc-~^~h+9Rjkt43GS)s!Zesp6n=!U!#
z@2mM?AQ{t#%vVyg+!F&4Z7h?b&WgiSuB?E}E0#J4|3b8p98CZVE109eMpjI8L7zvb
z2@o|ZjdM6fIMX7dRD6*GZ7h-r$Soz)d=Uq$VlUXY^`}EiA!CB}TfE9L_KOZYhJ7U`
ztbhlhglgpA1WIvjVSe;9a=uv`Rr)B!e0Z5q^b45I3n}8nG4Ls>M8mIcoN*8qr0-7a
z(_fyQ1Ua>WlO%!jugf5!9hH$kyILfzU;_i`?R?G<TU)waED=>!>$ni3ST!bdAlQ94
zBN8Z<J2tL{*c$M7d7tfe07kda{}v8TRj1opQ4}9<+Oa$viCU&Xl*Q3)$q^NCA&-uC
zfFAcT^2Gi@6#%dxg`?2DM+g1w!`{~M9|!%P4>6)xH(Go2;DN_Co)QYJlspJZLMpS3
z*agB6p{C_i-DPQ20V1U9#FSE5-f6~A3Xq#|*WD;X_)XDGv6{~={!|VdwaV38Hk+>I
zcs;cckFDkj^CFCar4#j|&(_gsRq0#8k~b3z)E=R%I)bc~VJb`~f<iy|3yv=K#W|{{
zX~_SUDE=)`d{K!)br3*@&_QU#2l%Vhx4VIE`2_yXo#=Er0p2f`y{AbNV}I@L(lssJ
zp5!O0B$0j_$LjPvO|!H(SFv$bG$3Ev3F$TFotyPt*s2=CP;%^C<t3FDiTDDr6#{U+
zTSr@OFi*f~fh<mk?ro;=2Tl*@oP@;n8G>iCk>&V$q4l92PW6)1%oKy*5P`!g6~|f4
z+60ua98u}i&d+Q!;`r#Wi!N8ephQin-JbTE`br|xbL7Z4r5&)7=@>@(mG7tD?7r!}
zKG^B?DNAX8@8IAK?#ll2Uygf6QG0#kyJb|Eb{sheM^;h^8z!2g!m%eYhm4jVIgqD5
zM>J5s#<>+Ui#Y3CDQTD2fxAWwK48gJt`hBQpEyfkgH7IT?e~uHzPAtT*!zl`Zlm%A
zO2-x_C_PSQs6H4ZB&g?EF}r{rro1ia&I?tIX$B*3+<i!!;g0+wK1&DhHr9C5M;KZo
z9*GsuRYGP!XBlucx*gnXc&7<8xQ|4;PnIN4>3v(W&a)IV!Ml0$y5pt{!Tacw5wI`F
zCfIjli0}xb{XBb)-`fJPuI%8IXR<LB0Bi3=wqv~0L;VjYSR<DW5S^Xw5nqGciF7^Z
z63h&Y<MKX@{$EySJl{Lm{?SZZQ$@VH)^fbM-PLGEj2(@ZB=$(z-or-cVJy28j~U!s
zxVXM|1&Aytb#3+fz`^fqJ>Tnj{Ld}Kt3UoQSkCEDsNNq`5%(BZRQ06MIQcmSSXisl
z#V=hkgRvD~VsJ5)3wiVuAR!lkE~=(F0F;c9XaINYS%o4i5puG9hp}l^&oHmZ0&vT!
zhWP++M?R-bd`LI-%EGQH+nxP5BM3wR`t(idRX6~$JwP{HaXD6TB(aJcjj%#GQ{slR
zAiNl5QA0f?CfrOjJP#UWcwDvAB~(GTxM1Rk3P7kxF+pRR(!}ZL2pQ+m?2W@T?lr=x
z%5idn5-3#JnfpjnBNm-DN)o00AX}wG7WN1=%0==zMd9TXm8?;3`_)192$qcn!tSYO
z4{;S^G>JiyUMhQta0_)?+<z?2-^z+e2Uk~H5!Or`ALTtlZdE*EHB1}3SF6!mJ#vNy
zwzK`n&QU1=LQi>HRKJzxs&H(cy=%DfPjYgo(!K<|bwV+<gg7&nucD_%OdrmZ35LcT
z#CT1>aYUF4jI*iR^Rh(qKt4s&lmuNUS=NZH9yS>_(Rq@O2EQq?S&gG{K1KU1Kvs$A
zsk|dG16&E6m^>(I+zBZRD$XmE4g%*DnJnoeTxGYNcU-Bn)W=q(i5lhkxNqra{8KAn
z9b=7JvloNeMEv`R`6LUg%3X#d^iKcqR?_M+Gd|bqNRA?G?5^UIyQ*m)zwGXP^-uLy
zCMt?D6ppmF^>S->A1SJNwYz^@OXu;aIP@&*C$pH1LaP#VYBiMpQ+ZaZr&3vCKQ5+J
zHnjkq(TITRGOZ7-EQx~9-FYQlq@G(mfRDy2mbv+OFi6Hz_6|b@V-T;yT!-dXy?oL3
zQ?{#OK3uC~wS;fCR?Q<Uz!<?4cTd&61u~dijHlP=@UHc}Q((;I?_*`Gb;~lo^dCq4
zElTe8(ecjizFZN|-tCG?J0}%)-6rN{=A6a%*l-gW4A^0RpCu^8l0m50TE<a}%oZbx
zgAh-dTY;mdj++2ToyC(Abk0}Su!=Nai4CxUUY82YV{xv~7#KYafm0}^_~V3H9VZib
zqw`&?*0r&Hxc7pN#j`BOU=t_ToLyYq@1A4Q%Ut3o6tz4M-!cx)b9B9|EJdJO-oStV
zp9lCa&XRs@tl@vw);I1yc=+hs@4h#G5wxqRhZ9yI@UUK@h8uzv?-~A3-P{2<2nw(~
zfCMx294%P)PzO*#8)Y9%*dfO;>EG4b3x`qH5Z&f|NZ3BL#J(zYX~>`Y9?~0Y>=jf?
zyIJq@8#>aGo&@B!Xzk<aX*D24caBJKcVpe~zjJHQHpXgdFXP{xmAd1{QhK>{=2USs
zW1&a;%EN}@yCH)Rz+1+A1gjW#Bh9Tl_I>_iiCCHn)$<W^<X%H88lC^m&;HtTf9{!Y
ztxCncj8n39G0JC8_`ocmDRiX#@kfKR{#m`Ic23~qFiXxMg1d4yVB`}b@B_SK=pDT1
zDqDVZA17CjWQr(d`dF^ivmw^S(P?s}q9kDI3`RsF7DJzITP#GDn0}G<#fAix&wUl%
z_!+^`nYB@Gtaz%AXQ3vl;*$AVjQ!k97G`pLsAjfFm<VtQXA%i@>D{;nbsjahYii?j
zMHSXnMz?8Vneuo2#kvHMBt2nGtYZlGwQoFLq<~{5=^16W{(6CV?b`sd?17W69kBmd
zPPMH^-~vIzPc16)EtAZ^agIwJC#uHVz}H*H+pnVACmzB;_c}kiG~SIQcZ=6&Xt8R$
zH@&yIIL-eiK72GQ*Lg3fX>8E<tx%Tgy1w`ECKXFz6!tNIOY8)3Ot%)9x=yWq3sY;?
zb-BxVKO(6iF1F2j)eHU;HbJ@NXF!u->IKpGK|UcrD_L`~DqJin_v4zX^U{H<;fc8j
z+I_^+T;KQs(sGz|_FD<(_wEvUVlH>pp!mDU7Iu@Iz=^hVas*silfX4tfdcfXc5C<g
z&U3V1Fp==<Jo-O(2Q8+rFW>87x+7Eu3=@t5m_$7Ko9w8lZcC~3>GL*~l=HR~52_i8
zznsJ;o{J}*FvQZJikDEI7ewWagQcbAq|v8#&h{#uu#I1g8885xHzom)kUu<Aw&*ox
zulyV93@(QLt67$c6>Z>zqNs{R^>-`&Zs02gI^?0!oQH*Kun*vY@e?_~xOI<tCio}4
z>tjq#%6jvUsKtMy0X=N{z1}|lMFuV{45H!I!|Zol3;)8Bdr|{7_(iA&dl+Ch36%%J
zcDRFofDi_28L9%}|2fyezp(5p>Etv`M#E5*-*q>?OF#c-em^Ll#1|R}@HdwKFX;>D
z&?F54f#NK2HTtuq=v3<mDy@i;s<o{D>c_)jdzd0wCQ99vkN|8A<CgCOK*tysLv1iU
zh-LcMWK0%GRDD<6getb|w5G`4Y0eoXBAt`YGMK?3ZoyDxkft>Mt>X{SW?=+V4(!w!
z8R6hhj2W3;_EDnkM*PBxfl-<feB-7i&y=ogvAaAN3(*b7rp$lJMf47_zFYJCUB7mG
zCJ_wBNcq%2chn0N<qJz34U1QRr&d6kNaz+Jvi4>W(!{6|e4q*pHX6>x%?e|TG^?--
z=Evk3POvdB0bRf40l!~hC<#+O)a2w>8SCmOXeNe6>?qS0wdUo<)F@3mR^Q>Su?`~k
z6>6iBk7K0r5?I&s&w!cYY83XC>f_&C=h(-yqH7@=7o5W&XnISz#tc9624p|-PdfhP
zP0#oZnXsPi^y%8;^a*xqc)`bh#u+yr$R!7kYhjx}O`N*#Qf7uenPbv~PmqXn4?=a|
zvsI@eSG4AFHdM}BY&GD^j>PaX5e9R?*%EJDZJn{a+!5Q1TTivSQ!{gU(PGfBNR&sU
zMPtLL%}Ja)K{-AMVE5W$-X%u)rnHF|a&)|P{Pw6E1L#IJ8YP$zN-|YOySJ=~C}j<O
zZVy4#mX>0~UIJ$Tz~^|$G$NpVYFTbo>I^LaRBV7+E9kn5Yh;YDUB%?fc^3o+QjZ>-
z{MVTL2@}e}Z&YivZQ`OEv;DH<Yzcicq=(nnvtr`3c&=Jp3Sxh-Ye2?p4{d8!&7X@)
zjAj3UX<M_T)#>2A<!qP{OjmX;F3LqdoKd{!_Q`C@5nggK&rdMUF~Yv%tMz3#4j<!^
zThsp?!z6hyz-Zdiiuq8V>-<xQ=%bKVwC9ufYVCALTZB}Vn4KwJ5KxQr>r2VL%DeQ<
z=N&2}x7_qlK|9qC>6m3B(gVXFVj%f3U9u(9t0c)tvp|v)?ag+MF#|qiaJUPGQ2HB0
ziZoNRBRkNJtI2KO(kuGMACdV5NWg*+U9(C9ovLil&K}UE{gk%B!?M)j{BskZ(%C6-
zJ4(%U=AWs0r58L`3AL?!AubL*eOkIHu3#5l_g)_y{({2F+oP?QO*n@j1RiyxhhJv0
z_v<I?8TSlz+*}wW(`8f*;BLhK`Ec>*|L4I3B~c1echu@yqxcL^b)#>!de=1ASrCE`
zD<CKUqa(&@y?m!o;@F6+{dXcIJ{sZt_+VKpVThMh-n}|=K;#YSEAy+=<G%pE8qo0x
z@Q%-u99YeC0HPX;ge+iUvUSQUeu5Z+F7}tii+WbCuxE!u{D9dqOyqqUgF-LDDnu^|
zwdipq^H|ds<~;{cZ(<5fWI+ka>>P%shu1txP9?!=i!kgJ;{6bn@NzQ}auW%yX|{0w
zwhkh2m}HuwA=M_;Gbp|gXLSlp?(_5vxT~UVvq06Xj*Kl7{f<fubsoZa)E5RVp8{Qb
z3U8U)ddeDzboz8nsgyjvsmr`wfPIPq%b^WyEHzrIU473mwBBlt{;{WbVm{H~$R#7;
zc%Z^X`N{=h%eRTOZr|~BL#zz!xIL8^W}|hzV<}|k))KAj9j%O=-%nyHn7}L5<wfOs
zM{8o|*7)7-;`b(fXl1LOJN&fnjE*UT4;>d{OeHmlGjfVo>L!g*uoULj$7<jR5PMco
zq(ZcP^OLq@e~XS(n@G7hpe1!Ujt3G%fUmMqgD95`aGoWj5&XBDd*N>p(2@yu#iuQ%
zenN7H(_4+AU-Frb8?%y96mqmZ#;7(Nk~|rN+Qe4Y*Vg!$)j~m=f;eKz8rUQlDKZ&$
zR)5XhU^P?)jZU;~Fn3S)?RYfcsLpVzPx6oH1^#U%^FdW12!xj6k_JcUkAqs)nF3|E
z-!seNIyuqpO_5(D=F(=IryM#$&JFP&w|mmUy1L-MliIcxRLPJ*b1V7SJK{-2ZeNem
z0O<VXK7j+bLT<WTfXgIB&lJ(|&qGB;exGoEN^$OK=9fFmZi}Ilz-~rFQfa14X#?%~
ziY4Zzkg>W&tu<04z2IXKvqCBGVTfqN3t?J{TVb=apdpv%&m};FiF!=vJU&fsw>jo#
z=5n_9*eYS0;27<I4RKqSV3lBS!+-P%Se8TV(P3Pu*;wDe<C*FVswvB@@W@dVDVD>9
z=S{ftlH&(sM%frMAe^hA0gtGz9MN7~aU+id1%q+f`S{1GK?%y+3`|y>X!J62?n0>Z
z6E%zq?~fmm%1$To-~)xpF(jRC-Nd9aWes7K{kYSid*|c~+0p@q?w`tFvdXXk40{dp
zrnTWuvT<(*)eyw}2VofKNiDTIqNX<f0a5__0TYG_C8!_-_|zEqmtIM~p>|sDZm&ID
z-8j8{`+f9W*6;SpBUEN$hP47t>v+QaJ(<drQC78i>R738)s<!mI9-j}!3JE3fTaPv
z=HFEJ<{@{05++hWZJCW02Wv6W8D~_r|2)_l6Pz4blo9!bolP*HMVTZh#{G6Ac}FV!
z78I9aEzOatjNm8I#4E#bG7#v}e5E4aCHqIjAJOr=q~u9E9XGHvg@0hH31DIdJsFsb
z3DY|#2d^YD@JlT&Ux`mzI%QuSZ8_AI%g5g}r7*UfZ8@R&8~-po-OtI=Bw;tp5<{!a
zB#RlaiLg24x5F2z;^l=B2LZ(Z-{Qb2&T6U3nm1R`p`otCTQ9i9HYSorI*%EEJ2V2l
zjrasmf?)K6W+M5;J+)?=24p5?guP>E*jEXYfG+PH);VD=Nfu|#y|}qaQSzb1AIJnH
z1Y=uY`|Kwlr|n_daWqb)6T0e##y_S)L|4I76E#iKh?t=pj77`l&@6w8IwiV|h?ct}
zKWXXr5DuBRNHpvKC>}~#SoTkWwi<_kt8fm2sI7>UvK;GDvU8%kf~4+IVev2_uxl=;
z0a%@O6?*^RiBML5_7<oblf7@;0o}7p@g{1zl-5^wxwK5lL5gmvZDm`Nm+$CaOp?Ec
z?&v}{Z>L!HbL}w>p8rR0`xuGx-@mk31~-j&3NH?O|9KMwjYr++3)pCcu2%vYe*)(}
z!A1iwbf6PsRrZCM**Q9OTKR=^>b$2H(V{C3Un+l19s8Fu3h6bo0SS)ZnnSs#uf5#C
z*=Vi4z1=Id`^+=4VFO`76kfRbOG|^neHFZE`sA;;cNt_VR;%r;!u48v747TQ!SRp1
zUydZ%R<!=8q|bkqPf4F&We?93IY?za8{}kCymR{_vbH9~3sK=bpJIEVVyF=RRM|o0
zZ2_MPqMXNDf<Uxi>n4C3NMVgD6#0K4%`yP%-&$qEz5Q!zl^IRHoHkjZy;cL$i_cU8
zJ3N-t+h17uYqOF}6L=b5PXlXd9qrfu3R;xXfD3ftPuci<oaZBsOyrICL-{ll+3Z8~
z#6M#&1gJX8o|%*3!~0J3!3P=YO+U!Y%a$0_wI2n_RKfcStNBU*szX~HJ|EsMz`Zy%
z*Zi9JsBpe&C|&i(-E|c+K#vj{SpHDchIG`G|C$!85tJHmja(gw=#_A57)X2-rmR9u
zYh&;$KHG#PvsJX5>6|A)2p(e03CGPWx_X{rCER~oMPbwylFiychw%MVwSh{kjDV=F
zKaSETPdzdL?_9!)G{&POE6Qj?*26;WXQiF4hALc>AeD_xn~Y9VVcxAkM7miUsVbzp
zU;)Rl?rVF{AJN(M_42D6n!J$|R^~K?mEYZeaS)MfoeBLw?^Hw?$u`qMRa}eGV{Va2
zxrxW5IEA4OQ37Y<Y^35*AU{OOAWld-kt_|VmEBVbB7t2?3Q}HM@(xN1?aW|jXJOw;
zU=4O*I4`hnn_uDZx;ozqyjOU{ug2_f4F6A_UR^Ho*ea2&gV2#}*spjRb}sR8M>)P3
zo1rmXhq56tH+xqi!er~*>)?FS9(R|1oh(U@*@p9>tKL(vmJK98@b43--{CgYuy{aa
z?>`)FXStoNuZ*E{X-op$$XblM{JCSd^bTL)Sz(eZYA0)+I;UOTOFwYnzxX6a9h35E
zLl=U0Hq9?$WeW%-5qPAjg#{?3<&;&H*wxkOKwMKmR8I@a3M%Wxf#i4htJa=aURe4)
z`0s+tPabP5)|r|mL|~rUUT^kvQ$SGzl+wzFeblC6R^~<g%#@oOa6mg!P~8?-m2=l3
z`yHLnE+hu9gjyu8UAa8OSX-OlaDMIQ-Du+_I?AuT?nV!O<Y+H=>gJQ_IRTKA0@V0%
z{tBBFs1;pH6wegMM0OrpfXDzF9m>3nGRo4*lBM>vc|eTDv*H9?SFKPCa#wJCPP4XC
zekrM>i#q+`^H$g9M4VvmR*)lTyv@<Zu?xEoR4*veGP_5GZ08-TH{fD^Y<0be{!Z(A
zd&`YGS+4Ktb@QGYb>|GNve%bZucZ{B@OLR3e1%S)a3-F8M784IXGt-&;wq7v-U`(j
z2+^r?FFkr-F|mGNH4~aar98;a4udgK@XWHs(woFSR;&hnoUb*lb33CbQNRg-99R{N
zS8>xVbxc#}FZnxskaKd4(3ceeXbJ}@uz9U-TCB>T2TlP2IHiLwIKF!_G^=JkCa;9`
z+7<U*?i)3X_Ra--a7D_hFmN6$2$?>3nhS-v7^$r_Jh?sG#Cf&4zj^EMfeE{NELcuy
zZiZjAIwWf<ie4q9;(X9zDWt1)hIe~3Y;~b@=vs1ReH}*4qp*QTImyMIrUb*f3AHf$
zc%N(9YvWLO99GqUz6*|LTQFp?u?Wt<fCR%@0opSUMp4z6o(s0NpYOdnc=HAW)7)^J
zg7=>@%Bn#gs;#uxh*-O+w6Oj0B*!b(WLP(}sC^gy?a&CjhVY`;`UCuL6Z>6J@59LW
zy`F>mXc2Iz?jeOm5^gp<UB9p5!rc%<);Gdvi-d2IWQ*d%SrK0*{WR+<ZJs?WY~YVM
zEyVdLOo=n)IL$;)p4h=Zo3w?L9bE#b?uG>(5OfFUZG?$^c*ejitZn+C<>>YLX7Efq
z+WM*It8GKoH^SAo4qh~=eZRW%yA7Lo5N=}cU~6Yib?azyO;gm{c@g1j)jFTPn%GaV
zTEC9e?=W}JPgCYDbQL(WQ-(N~Kjn)RC~U(WnE>b3&f*9Hp~bY0KEx_mQTtRPT%A()
z=y+>?XX|jMLR%bhD#;4PX!Ste{U%z{Qlr6VPDA0#ZcU(>=`07AlsS-8S^iq7>h{{5
zKgk*cP4!n3l_sK#t<(J4%Co)0x6u^s=)SuCEXJrubb~Jmqfupwp_4yG?US60A~6Fm
z9CRI^C@8aIVuq_^vNDRVaHz23K$bt5;i1@#h6$SdkZ7No=sGCp$D{Fiyh-oQ$lr{W
zYxJ7(8^aF@_kNPbs9?K_CxGK4?1~#HP|=1Zf2JVfSP#(u(dq_OmECiiW4Im8dh*@c
z%EnqWnSu0wMfXJ;YiKs7I@8fbSYuIeJn(oRp$lP`e@Eq6Lowk<=GUZwuoCm)`1azf
zLloc4>kEuQZvBiwuoOiE4ct>sj7NaWf?5dqyE@!9QmM9*j5&&QC%P9M0%b7iddH}|
zfsvTIjCLD;Vz<=YT@Y4Rs00p7z3MDaqPyj{hAy<%SJ&>f^#@n+gRQTuub4@9#-q+%
zXh|uAUM3k@=AoO5@ll8`NYJKiT>#qAWY$MK7l)KS-KUCmT|qH@mk~pGC2dSIiXhl3
z$It@w2I8A&f+*FgSgyg}NTUScMP_km@(rC4C$mjd&RBOi&dRRq@TZ{>cM%IaObwJt
z3k<8j{mb@Vum7fZxO=ce7pTbK(SI)h)lv!6OH&C{+kMm9+uiR`zR76g;hJ;&$*h~6
zfCLtR>$~-h@7~+$L9$xG*!=y$^<bn!su{h7pW^NR0^>JM5e*+#DMQedF`1xFFQP^%
zsq?zTCFZ-1hp@AV)ns!A{E4c;!iu$z_d;Y4GG?<#N)e4Q;3<eZ*S*KJqJ4_4%w{Fj
zrIk6|w8uGWIfEWd`HZr}VJf{r5+!kwj;@^$&lXr<dtDR+1M56706b5pl1UJCz=;=<
zn<1p?!#=bdeo{h|fP*^cgQg0lDD}Qdq5^?}%!kGdps(*9y)U28`2L}*Q7`pvv}5p}
zC(%Q>GQ+B5CbqP-be9R&?e@~|ODpg@zzev$7>&T?G5~GO1Le#1rFJ~y-Z9!r-v$8-
zTXHWm@%eOf5QaxG*VMF}dI@vQeWf-1qQHDfz$8e1IVe_S=4%E^qx~!!?y5&5O-pB5
zmn(oowUR=0v$8xsVOF$0jT}CKfcUjT+27r(9|+T&s=Q$hyM^N?o{gsUJt3X@jDF_j
zBk=5gn&k2crBmnYxZ#X0m=q(ukd;^YFFevF6lfW5wVe$cG9#gj9$<i`#XUInqCcWn
z06C6;AGL3jaY+Z>zNVG)-j@tX2<p7Z<qutbZGyk<wXMRPWneYj8q$ic!@tY59AAsC
zE$i%JblL)MM1ffZ4x3~i#p}O@gBcUJAXluuqc8z%J)5SAo>6><^MtS7<+2tf8f>Mw
zF7QGZ7VbHm^D53uiUw(?(<=-kTAWk37ijG=9b&4Qb27(0K^Ysf(Ot|2=if+HRxv37
z*<loolK3(yR6Zga2{JfXEvASpY$*$)UHv*@+_9v2{B4HLmuN(ahN&}T6-5HW-@t)P
z(86{Jxb88`0oiOABbhE7@zi06$Tf`wm>Dvvz;z?9I+*0bt8z*|mIE=R4gnYAn*tXx
zL_n@ahqJ8k8*<x7SwRFc#H*iaE4lg^9zSr_Fd0hO(?5-isl(;!3dFq>?=~JjdQbM!
zzjdRj;bB>lBXis}ZA<NTrj#yP6-37vTM|ZSHV92WMvK5sB!+0}UMDqN-f!klQ5Rsx
zD=UsuicL7N!fzmZxi)X4&2ip{rG4@4H|Hg#6q=ehG6^)?c-O`{cd<<8&c?%s@9mu|
zk{cH<IXk7e4*@uXJ>F+1TO3XEF>!d>-d4gHD{VZ0YmoE@i07j|*;A9~+Mwx*B;6!i
zCFlqV2uYbqy14oKYV&jUZp1OOW~wB-GTKh=P}S?hc|coYSqxcu_^LOkIa3V!UELm+
zL3D{n?W5h7yZgu8N-%Y*Z-+fms~ge$WMmd+NMEg?Si0o!p0G-|ldz-|4L2yULOobl
zB>+boFY(A#6`pwJuJ&07{8>JkTHXeJ<!APq`3JYVoEi*v5yf1+w#YtPUdm}{6BJ5t
z<8&C*qAUH&<yn7LSoQ{LweKM`9*2q(vPnG<;FJ3<#L9c%k3VQVo@xB5x|{zsquJ2q
z5@U6%#H6&?3z?_387gpl^}(r2V(*bNXq3g7euc6z^w0^X1H!($GRLk=I&3f7`Z=Fq
z%B~se3G)xo(c0-p!fw*&#eC=}cMlnMxKkSu?n&n%tAsUYLHS=pVNeww7a!ilMR5f(
zf7^IIM#~q)nI<u5mSlNaB(I?`ZrWakmPl%^P%E=3M(ful+gSZ^xb{w3*wux!Vhdl5
zQF?<{a`6R#EzR1UufR@lI(cZEU6IZP$_8y2eKi#z@#ASaK~i!iu;Y{xxQQ@A`t(w%
zGLwrUnYQl;Q7(!R|J6kru8q#!Z%RIu_vblKw6TeF+*;rGc6AN@Z@pD6h(rlh!uP-Z
zzVxlY`|_z19!<W2<d($KNUL1E3o~=J%ZK4fHoGXjO*0_S{i<*1qdb_Vmr3bcaXy<4
zG0vp_;Udq{X+G&At5o_po}Co4lkhin;?;gcU21&^;47zS%TfBS6rkbSA%(7A2rm=>
zBH<R)N4$RP!)D{;9v;v}c-bASewIup!wSeC!KnBG)I0p8%t?e7gwtOI@e77?3Os>$
zmzKU$3bt^gc1k&=^Vr_o?eFwnY`xt(Ce2F!c=vVh;O((f^CUeJ*S|GyCrpFyDG?&<
z=h6ouiKRiq!i<67mdayl?oj!JcT(_ue>6NPHKaZWcUJMSxXuRUuSD4Cd!F@^&>p4?
ze1nT&UxG2LxO*QCuM;>p%V0{Tm|lDkTC6PZBe42c?A9AVr2YlSq-phTh%-1bC(49o
zwF+OV$|J#U+&B{SMH)XH#b@Q!t}0EL{RVOK3Uu|jz;LGdLW76a`&F1(TS;(yu}W2Y
zqpH$XlAfIhkEZ$>{e@N>#Pn(NF&V0}z4!L$xOdopy|usf692pV@^I@oOm?bT8>`3`
z)y*j-akJ5#Pm<z12hQ0fO7<H*>^<Mw+uGlTk-j?Y9lbi(+iBGHNj&&48^ZzVV#|1v
zoUWo$s9;Wk8J}@70Nw}jWR$=GfP9Mg3fdjz;vHZ5CZ}V#PTxxEM&|p#aZab#Z8}SG
zRC%J|M2Gyo;M7a9%XaI<){nj8<6l}GozBgR31S<XC_9tGt)CzJWyZ7Oyl*Q<@LS0&
zqoP4&xH6~Jbz3)~xSo^#5K!g9;`of}R;?V+?QkJhNeFL>cjED+NDjtiuh%AqmKa%X
zjdst<Q;(M=!g$wy%gc`~^#H`SSDSkl1|Th`r!Aed-cVeci1@{5EU!VVbAzB*%{QSn
zfxes2HG5!=*yWBgy&%rI$Y&tvMj4)d!GZrRJ;e-jZ;yKYgEzhXqoX~4F4K`a)KPkr
z3}%yL7kJ&aZs>1lLUPK0ppYm)i%y5}b^Ffr(uql&Lbd)`lHvX0qX+G_WsCq)$m;a6
zkLvej?Yw+f-ojZh=tTcFvhK2}Ju(|6utl#KY^13)*+!#wiGCgI^xEz&;})a=xljYy
z4F-ZL;)rsCQJ%}~P)S>P!(LiY$=4qQjP=9alctSYaL^0Ape${>J;8t!;Re@%BBN9c
zY1?boZCvm0uu~q{$Wr-L4#GC=m^UIVx_pUYffzpx5A6tLjH<C10pzm=fili^JdW)(
zr>4V0dI<vT;m&iuAPJ1hl6}7Xu;AU{@Z=yHUE8mrOBhkx+LLCu7|*H-fLiGJtbt-H
zVNf~wn*;refb?0t+i~XCx>kfTXAmQ_G^rX!AWh6?4a3+eg)@$LW7Dx)$|Dm=@v}#!
z0{4{n7YO5(+e-=RpVht9pi$;1t+uD)ac%_&-<9)NdEm;zIW%ykNBF$`r)-<c^wPEq
z4bezjIrCX#uno*g!`M|y5$Db}FrKjXq!YdnvQFV6x(TuMX4HXXVbR{)X`yaxhj!;I
z7fJAgTb9nivr^kV%h2HTX!j*bA9ycW>T#O$6&Kz(E3ZArNK9W2VG~_!tH1kl-*f8N
z&!-9BP^X;nS*Al#50>bj8Kw(IpYbnYGX}>Vjy=^;(R4AMvbE|7g(N~#JMmXf@K#pC
z2Z^?0tl*%4S!^6qd6f?^@7YyaBwZXSMIoaLW&rPu<Ni=qOJLxp?%F$ecFQ)_anQ`d
z6Mu0;osO>wHGJN^B#B6cEYGYZELZ#H(>MR?ultbs6W-CCjFNlBWN_~sGw_Y_Gx-12
z!I$X+sobMS5AeV1-#%Qk{|kRTT7U3x{eP`LSl@W`@Zq-`_o3YSqx;|9|6kGCm+8L#
znW4xPMgMDdGRvm3nsRf#|BF7DXV+fwXeA=|;OG^;-OJD5|B>LG#3w0cOu+~e@dP!u
zqjY+01u8=WX}mEa;}Fyrpa`deb+Og`Sw2ap=NBpk0cNKK8U$2?dsKdW$_{5cA74*M
zP1OcrWMggp0noa5bcvByfr7@ci%02roJUV$iWB!c(5dL`B2Gs@;?NS~;u!_o0GdV3
zU`&Jp4&P*`dZ2!d5P;*Fkp!yb&X_p5EarIa7e$v%iSvoFxWQI{uBNByAZBj_wCovU
z>i8+nOdl0Qi8<~7dJCjvbOItL`vqd9iv&&KXk1ZgY-G<YgCbS%1=`*K1&Sry49Ari
zXpm(&ELGCw)*`k%qV(g?j@_{=g&7s}IvB+u{!Uh_hJrDx4N%ljV5-B}APJ2|jY0->
zqtQrQ9o5t@AJBmitChP4i^8eJF>2l<jYrl&O{<12JNEo)e)~yE6|n$mz+qI3l38xv
z(h{K6HQFao8~LP&Fj(dZ8I2D$taH4HhmQ#&3XI_bk75Q7R3F0NFsYXWi?J=jETp1?
zo@2}m@EROZZh|<KF?JP&%z*aXtKFmM=-|ci&s&GR2>yO^c<|HiPH!iA{tJBUMcW5&
zemUHI`RX`Aon-IuDB9ZJfw%j|hr7?;9v{Gq*47c!Y|)N^Z(IAnM7{rdbJ#mNiVhB=
z-PdpScA-7!;BagIc(-@djdu69_ulU8?!W9t&_=X>a2)OJzTQ2CV#fzv?3YaKN;RW{
z7t!n9;r1)|x%GT^Z}<2Y>hi_z@jiC<0{YvE-fSHn?{2@{+d7Qiyght#a73-){NP~U
z-rL%J-P>7(F+jgj@2B4Wadh-*Yj4k+?!nLdy+fRUGuP+T*52;c^SvH-2eaMTJ?w2C
z<Fw3Q+W<ru<Q@>7H@)p${G<0@J($tf;V)fimdMn>{!#Bg-$FU~9_?(s-g*ghY|nuX
ztkCw`!`^Eg_`wUZiF^C}=y><|?Qt)9d2p~pU_a^|{<OQ@J9-@L9UKwh-W~zRx3hJ;
zh23K-05$jwe?NbFw2SZ~pzj|8i~aV^@$SKX2iE*&fDpi73+<=~)(87EX8;!FUxRiL
z7_=1K=;v2Gcn@p7FVj0d+(K|10RXp;?UK+d!1LIeY_#8dxwreWx4+%PuLs!B&$~yx
z4lmyB5tiBI&VSze1+}->J1!cGjsLW8xl2nM?Y@Y%c7EE$!E<3UO#q1O3i`m?qqp0y
z1p2rw?xAWB-N=AewutIaR?l13%O`aII9)w|X1xQ_agJ};$}tHXh5Arq!UJDVVvIr{
zhL47F0o{oUMbNo5JX^?+^w9$#pi?iweN6OfoEPNb8NFLa^FnbcA)11ARzTXAI+#N^
z1<FJM|3sNS{@?Grk(@SzoQW)%YOZ6}Kq9puf8qef=&Z6#tn68e8obrgV1X6;?m_fu
z1&gavoCi5(pSoxS{QrpNH5kl*3%<7es3IuEhDO-b#s?LIwcO8CLtDc1P%ICQ)w-YS
z6wC;46y)fr8A>zoT}db@Qe>8)(0*;g2B8VJ#x^5p+8Y-F;#FV|irgG5hDn*xI&f`x
zb%wxpFk#E^Gu+z7du9)~C90Q=u626Gfrw)j%MV>)mtC|uBXM&wVX2IpOAAlxV*f+{
z3~;X-|M&ieH77wj_%nKy%tn|~Z<c+)$Ow~e^eP^WHeHm?qBkVH43bSVt8}1_p<V`)
zPZAY8DJC@vEgG)h7D$oX7Dw1)G{q_Dw)BWL-bZg%qZgz2w|taLyV3ve|C_+^_F`55
z(j2TtFX0@|XZQg*ffuXMYs>}!XvyPc9(5DDRbz{x*XtrJcwh*O6*4x4wX)gN#0)C-
z2gO)7Lm#T?RZffyu!*w4^$uR|z?sw<CRvfRyfWhH$zpIqxe_V<mXyJqQr9xxSay=Q
zzY_j#P|F3~_LQ1tvu8AXlYAixtMOwoOG$2%#t|!Yb*yGBvZQnX{`%V5#^@0VJ7o>V
zqX#JARFYF*JTT5jbQNC<sIbf{IAYI}c*vCF>C>n3{&}uAECdk;(4r~%Ga{Kj2D(DQ
zR-`RNUU8#U0KdydVt3_#>R<j73;Yqi`UM8_N7RG=?caL~|1ut~M$sQlTKGmN5M8@P
z4<vRN@?ijl_zcbbm=p<^D1i!<X<^SC%CFUH;c8<bNtzGr^BjGVyXfwZNm+pcNPPfZ
zAJ_>v=JJVvvVR0@&QWib#*aPYEprlaH0eYlj;&f_ZOIf{ChVW4C(5T9ZK(JR0o<RC
za7@D#4hAG1F)^2#9Yzfq8ZKH}Ma+IhVnMy*39ccN!&6O6$qHZ7)2o<$AXpSiFhgJ_
zq5zt`IQ{|cskje7lc%#0Hgu8<Vmt??w2=@F=O8v1v6Id?8V|s1YiB3Q#|fKO7p%?F
zVi@Pr1!6V>3g8oc)IKL_Tvmwfp$&kJcKJrdAA5*Xj;XVZq&(OW4D5<;*He9-4dTH$
ziv>1-Q`&bFko_Wwv%-jm-gptH8laQ{co~&q>{3B1V)Y_U@6;9vWVC8(G1Z)QXmh$d
z(%r|$dJC5*5#ghdOF0-dyW{OzYp?l#+`A_#%6n=buZtr5j}3U%;rZh}JsTT;Jbd_o
zo@f;ws`kgtdQnq*go{_`z@~(2v}K8f1FSezK>}EoB;$2XkHMimNpLuNuIRz*qvu`G
z8>pc5S@LnJXh|W#;1&FjLL{-g0Ab3><18%tt%4(%^8s5>B#3q$v6F<4NLcbQHPNM$
zj%zE*#nZrFntQ`)P>zWZ4NU42*wCd3+WtSiLl9^F3;#nc{Is>FW=rq5ihm*kWY*R`
z(!(t~=b~Md=mT%-BK^qAx5PD<y3u$vE28zTx08g3?7K(ZH|&qSw#qsx8Q6eAL`rwO
z%#;ZLh$=ZEoXzrC5p2i_HL<29{a-b+#(5}!Mr-Rli|AS&2E_UUgaoz}0EU8u1BHm_
zM43hvifAmU9;hf<S(MAp10}XoW*p{%at({I3}K)dY%2^+z@};pTED~xF=%&6&BrM!
zk)nq-E^%iTSL8+r(F0-pkE4w+BFdJa4X&e&Rv`$_2LQ<ZEYUcZSUs9Y`H9xr@ptUl
zY~e0_kpUDD)ukeUDni*AI|dUHL>Vh!<JK*PNDBtN?{9PkG6@GB)?XfQV1w1U^hg~<
zst*GK;xA&EokU(?=)s_%XLN5wb{Wq=7%?%<vuu=pNXSVN0EfBh@V2;^4bH7a!ecki
z6dx+x*oP~#;?v48lYEJ{SQz$&xCWoy)$SyrQ*c#r1<=kpri`VXlBfZZ5}QKOa_IER
zX6C{c#XaBw031NUMPvuT32)mz((O9NGohLeesg8SYd9`2ERz}*%Kw{8n>J}Xsv&G;
z%+kk~d>BBF_wh<=<@aQgTT2RSqDCUVjq7V0{O>vsfh-Es%fv9e8<cYk{y#tl9bE|>
zPITh%`Lb!#(oKq9(mvEfSzG!3`|pV=DKgX%Qn9(wUB^?uy>2i@$}lc&NJQ<_Y*?C2
zM;%w2>)%rYrZ@P!zOuds?@PVi?`}}xjq>j2?(UbnD;RDFwvIK$hxZ?CxV>&{tl&c3
zce*9rUM80(j0e@YP8=I4e!kUlk)ic?C}%tBV{8SJ*~!=@Vuc>`D)xFt!F5I?XTrky
zd@UaqB#@vH%oSa2M^O8MFE1#AkJ@LbC7Mn^^c!k<Wc$rqc6BzgL-ii!7)==EnX>9_
zS{uqjD-Qd7j=`CfbC^Bi%R=D7iWgXEl4{s`g#)`-rQ26ZAixz-5|0@h_9cRh0N5jl
z(>y20aIEV};=qX&v3+%^5F<=^SXw&4bUz!9z9j_${Q2O!hxq4x`18@X-{GGR;Lq<K
zevf}Xgg@8U?%&71AK~8{YgGDM{QLg5^!Io8H*nkd_xJesx9j(%ANcXzcN@~vT6F)x
zcWcrY_WSMk(i`-=_MPf)ErR;rNry0ywFev0BmDSo<Gysc7JdJaq5eJfv$po#cdA$X
z`SAPo2672(myM0@zT?Ft1zG?XXX8jkQMXqWmg)b+X|3RNn8H%h&xxmDWo0Ub?qRR9
zf)C-#e00geHs#P!3`Qm9BF^BRWT}oRp>+-wM2CgjhAloo?>LZBXBSEVB(i0&1KLaa
zfbvw;9G)a8>JBCtA#H22keHzs;WCY-G{uTin)K1A&m-ugL#0+zP{2fT%!3l=!-*Y2
zo>VID9=w07O;lKoqRcpE!18?8pK9^tF&DD6CXUL)s|J9@{qpWUbU^OHeAP?T>U2f|
z^$g8QlyHpaTd5IT^LO9z5Gf%SiPjdrbX}cFsR6y^-|;YZP^1?D3W|PutgjXZrM6L+
zRBB+#MMic$Y`H6_>dX6194`dU?miq$yF2LJu)VeYs@H}^=tT7I$}^hXx9>5OYJ2_3
zlW#jtRjTOJYJ2tWNHvMZ{f$%o4M;AL%uNN`gUP&MLRVnA1(B@T%E%x2e@5*`4_2t9
zj%vq>>yP4$0D$!7e83W@PID{dR^S;XcnGCBtDI>SL?IHC5f_Tmhz@%%chT<ph^B2u
zMzH|jJVkQ^mTatJ(re;P|Mk|<k5SucZe^XCL9bq1W?*xZkLCu(Z{qpx@lo^$EA+B_
zc6QEJ8yIAQC|dOBzB7%adL9_O4;EGCg6(!-C{EE=JBJ+mO+00t&FmJXJ;{aJcGbIW
zcecx_v%BAR?tRw@G!jvaI#x}o&0m@X?|P6>?rAMbW!b~6pQDY356PYk8Cup|qQWP`
zFf83DBjE$hPYOwpVOIw*^?Uo<2Xvpg{*9YB1t>o5$39X(K;-CY)LM~Eckui_qV0S#
znT?UjMgA$L=$?dt7~i|ayZ>qR6Yb?!a-oJ&=tYeF_0<(rK$h2BPP0RE1&^Oil06Jb
z$98*D){YtF7ztaFnGbf$cl1@$dKD}0LU(=<e}J7n69G&K?P-Q?SV|=fQUc$r4JIk2
zJRyx0SvpXN9Gf8(?PaaHR<14p+S><j_m4#Yw2}x4L}CfT=SVa;jEJW4LhL*WwEh6%
zRp6}-nk)e?aTRk~#F)a0XloU;FG=O39k6@K^jyKWiGs4J?sI|mzKPiGb2D<Rg1j@n
zQm5U91E?dsE8k|3Hk+<DSeKuiPFHc=Icf+i5Q#MF%txXdMZG97TUH_!a^N8%oV$ur
z1+^ZFG-Udzp)LrW>&#~?iK6{<)NZZQ)3S_%K)8n!ej=BBIRB0<ZZox25mxEuhbDQl
zrZh+-2hS#~jZd{`fhC^84q2w&@4;?>Gf;iA7KneFg^i*oE71Y8N8P~SPu2oe)bO;7
z?T!!^hvsjqq6yYyTP~}OJrD?r=q$ycNhjBO^rt7*=x@X5SDr<W<l`Y(j1}kUDUJ@i
zUOGKlqJ>>;Iz#lPN|{?>&6=9#A6yDBo62pGf_-B32xTAPs8%b$vIj_~2Dh$xf$vse
zM)Vhm-}v87^+@&Jsu=0IE{CPmjCiCY(>oO1&_D@|^x%-=e4>h%RH}&mrzrqPK)1gg
zI%IW2Vj!a|a69*L-G)H;F3=E}g_8lC<-C}91BP4*5ks2j6{})Vf}q1JDW-I;ZC20R
zg*~jT1$bq!=1m)5Z078hu^NK8YPdy_{jsgSc4*Fz?ssWBF~3>?xu02IiC5>M)KgXy
zQ>ExY&ig|mTYqhp)gVZFW0tq4`Vv7A3Kak7B9OCc;ofFREylCxY?L^}=j-q9@*cE$
zILdK-y?wDJ7@p<w4hBCKQ;m+&?%OEpkX3zV113@oHO{Wf=Ko~pI%WG%OhP6qO=cYu
zfc=1tGXWnbigBjFuyifa?x;F>1t3<Q;QiStCyq21X$OZ2#4BIwk@k)xb-jJAE1`eN
zfxS6n@<%|PWV(bGa>eXIZb_E_BbS6+8eP0~^w2GBJi>6l*NVjQ0!`xVEGh9)u<c<4
z<ATk$GKUKxIBFm=WsoN6qLCzbQydDR6U2&86v`H8QR6+DjNUCvfKN+!Ad>Ebaw?mH
z4QC3(943i@8L4{f^n{ES9vKD(Hc?|z-|R4hIg=EKEF{o@l?xGfTu4Z`LmGrS`{?{f
z9SLh#h+3mcjQAF8MVl}1k|Bk$_CQLA+d3^;3~R-PC_<e2`Sofhj<nNIwifo@V&;eV
z$4B>r0FrWX-~efjWLT?pJ#bAPXcfuCw9RY{ps@wXt>Oc4cr93F4J&N9D+cWfxd^~h
zF4F>FwrI2~Li(NY%7zG{<30&3h?1xIV5Yf6Lx@h+YtE>Kr*jCyPG*>~3;V*UGj1s6
zG(N*iHa&efZAI^D(O8-P$+cl8)Yc>%Nf*Zrl%}T9#+^qi>$)7546LxBD8k>!K%NSt
zp|OkcE6{?hC6eC;h(Zuj3x0BU-QABE+rogr#gZx%ff2VR6)2)ld=^qgFrhQZ5>v%K
zh>mRL{Qv*#{p)rcN0KfK&u?8t2|X483ZzKt;BM;RMUkL{F-39+(rRzFHdYZRP_RH0
z1_g+s$KKcSUdwl7U&bjjGAj!JWp~fa-i_5QOF&f~BO~MZ1eQbq%}YH6gB9^sTq?jg
zSWHG8wTTxQfT~g47ASo;>21LwXJa&o4tqnW7db+`6YN4_FXr&AFXk5E72riHJ`E>g
z{<YDwbx91!NJP@*-f5(C|72gN%h7FPQx>9w`753q+PlHDt8LAEJDy*!QAx|s<}OA*
z!x~}9lS_GRg6v(Z>K1U+nI6lwn>Vd<Yo@7FgUv~kI&5Hln&fYuadW*3sAzTm=XxWV
zJeMatfK#*wCs1<`nz9C<M}Mw(94S6{_`$c84};uf^cVPR{27$wx|5%993Lv4*;day
z+_q0KNIz7-FwMMr1-$@na^1Y};stgO_$MX98oV!+Tfj8>2*s1T?y}iq6ia^BzIOD!
z%7!8${r}`m?S3W{3;EUVZ}Q+}@_*_jLnm!kqx|@<FQF~^IsDZSLPc{#34boN2X9b|
z{6vHhqUO1%17}n00Blq<&!pEGi?xQA*rM#0$k1dDCpjvF6-Lu8`j}w@lC3XK(Aa8Y
zkK!-<uy@3d|C#ECaG*`a<LyotdZ<s(XRvPm3nygjOV8Hrgf6!hc4^x9>!L<t(`i&R
zWQI@8NGs*3MPJ2sk6Op2F+3hXQRwQWb?*dk0h#?7*~falj+LbwRV~55%>OT1(h@af
zsA`9r+pZi0yc!+$q8Gr*jr}E$cNRTk8cv>6u9iIUEc(b_y=Tx_Qq`4VT83Ad^WDVC
zIf_xie2^bQDQNImym+zmYrPJSnSV5XEpKjc1gpkQT~>8R?JsZYuM64&*wXIEZ%y~n
z9ld&m<PoE8_b^coz3^b`%V5x0Fs!|!)3<xw_VHn|wfXJN_TwktKHb>@JMy2mzukKL
zj1IK*WP^8fYxC)&(YS8Nj0Kcxe}hgNaj7!P9TcE4meO6`&8OG%>09&lPE%sojo2-T
zjS$r5g+RktIr>;R2?Rc0neVx1I<x`ae~{(;NceQx`&cA({?|C0&!&d72p8V$*|R5x
zr@GNSd$N}>!Y{f2)**ulLAevG<mA=mD~v#BE2rZ-wnYSK{nC4uK1sj*%j2h){q5{8
ze|h>`JqitgOX<nC&+Q$JuL7bMw4D5JBqfL!Xgm-4z{?zs)-Pqa_UncjarAjYy2Q60
zV$&P&$AfPzJQdLxK5!rLyftKk9UlPH{|T@aUjKOB>Ykh(w9c?NaQpoHsMT#9AGG(5
zsf>-n>)JbNzd3Flboci6F>R4Q*V%P%a$A4!sR_MG85!wHuzLRlU<~#h0M9q)L>^ji
zz^nF2MD{Ab;M&9m_-RW4-hV<TdGLU_>Vcmxd1?or+J3g=vB&t>&XXmNJ;BEw?<{%j
zDL(dOYsq8J=&@x}_!b{~YNnuJ(dhB@m&vt${eQnSf0$cp`n>X?kNA-OxBokl-%D9p
zMg!q;Iza9Zl5g#q0*JV8cd1P`Zhv;b;s!<^+n9Zv&Lu<x-+UH-(=K22n@{6!+Wo11
z^GW<oO90hxK90X>DXjX<o%owV!PPHr$6wqEDs}M|M%(#~SqHZBQPGCp_tKAyrt;C2
z@<R_+DmhqOV-tnwz74Kb_feBuV5@@7hG4x*z>*=#Yjaz^l~&<y+D!H^&JHdUHh_a(
zhDsPTq~g?7I5Kz>(R!(y!XPWWPJp9-9F0!X*-<vG`!z(?Gw^C~$w2dWD(i>J&N_5#
zE05S)z%<>2YqCil3m_rePZXda#)tT^E)*ORB(%Vl>qTqOCa*)178zN%@}}g1U|MQ1
z$*JBZFNbqdYWIRPg?XuFw2e*HY`$QyJ7<<Xd$Mu*5Onc>2MZ4w74bcJ-QgHfS73dq
zZPyYm`APAZSSK@6)3kx|)CebdTbnzs7g~PE9)+>ywXH4FuKgKi|F}tB7HY)>GKt9w
zRQO^D78wlflinfAcQk5J@NJsl#O!j+)S5Yyw_9&&7~*rorNHoh0GueyBYpCR8L>}7
z*UA26U0y@KDgyb*>_isi+2ynxFm5t3rpX|?Nrp4YxwBDkDAK+3MWs4WwNUfcm$cve
z^W)3yzi0qWI5RKl<p(NEisSb5(eitG^@{YsQ-1Oqf*a8CC?Ru(HQ1DIFQUq}0k@sw
zZ5#{r?~Ugak)`8Tu&M?{jzN~>!Vok20a=qaP_VLIAZgn{z$sC%|6DBSIU$^hs{`k<
z%@H#<LXR-08oC)a4GXIYOS4Urs8;87H64let#MjSL%RA34Clp*02ddz4+uzRnHrka
zFpp+#^IL_o5X~|Sqfuk;v9jP|psco_EXx$uq@&Z(#f76>V~&LEn!r<RW+dmXa#pT<
zS*XZF!;sc+YHMQkU$fCdYoP%KZOYT!@X!IrrMhrI%%q|;6%Dw6E?MP9<a`~d@;jtd
z9)vH*&<~)@*x1f|mO}zN)e*B1^0#=1#jb6B0n4@{TAO!>aq$*tf~?}jyw}Sh?%gKi
z3@Fl^6)3(UZK|y}*()Qlp!C=k2GUc)1C=`7beL}F?e>3jS0oZmC!5u+ZekaoFGbwq
zri;~ut<rZSe3_5>`Yx<6cFR*u*9Bcs8YB*m+$-ClK1CI#)}XN_y{8fH@bt)0tALXe
z+-p8wwY`47=E*8Uot~tyyMpv#RH66eG8pGr!U=Dfejhf8oc?qlZ&~q3VkacZe10kU
zj%oy#8SDq%6sU~5L^QK<e!{C)DlScKrjRs+db{58MpM8o<Vpu7#&{Eap4IeK#)>&1
zhIW&gjqCyj47czG$`~-45|Nn|jS|^%>C7t~rud>ql5n+IiBDgK4>XOLt-XMRfh-Ux
z2fj4PpjvPnbGaj!mz8rY?-%J=Eov1x5?$@9*h<?w)?dMTKf^^ia8d?adNX(STX-|N
zs^%-q_QbYzJ)fVQyh>Ibt_O<o7&!*01mV?^y`81Kk0eZD;N?v|{Zxo(L-=gKaU|#Q
z@|K|igto|7R?rau?hO$W?DxTUY+F#X`4gntLFF^kB7}HS5A*Rf$Mk2A5(*C(*}n_S
zwMMge@W6$0n=hY*b`)AS@|n<d9p~^pAycSEw{8BvWBzX>)aeuR|EK2v&&>b7HUIy!
z`Tt+arLUOHY~$<j{x&qQ4J|+{`*i!Mg3%2s>uzs>q8cfq3mF>b%#C2P)J{z>xsz{>
zQnBGFIOwKEsWfuRv&X(>IR#~)jz1dZ@LBS!d63jrw1bx(-=W91@$o14IO)evqK`kO
z$9Fzh%X;aNCpfsr(ZM~X*B`6FJy|fgXY}|JHMpk>2KOyJ{&d0M{)~fr79HGQ==Eo6
zaNjN%-1Zhd|E(I`pBId7n|J2V3x>D7gX8;4d}n#_|Dv~cYtaaw@aAr*A#QIk8Y6Ge
z_O?Gr|0(81KTWqjgtdj;Z`%ug+gb42;|0GxS@7G_1;0I8@Y}Zwe*5!+-~O^_?h6-Y
z(aLNuTAJ-eYqPy*akgo7{9nOlxUDRszr_VB!^<=)^Z0X=rv>abyYfd>Ayk^@lsx%!
zqiQPIl{ZgSTrjRpMKME`t5c#)?dLAu%_hyq(-SFZ9PKq&f@6$umnZ{(1Qv<`2>BGi
zWuZP2<a&1wI-<%nC1{ldHt40CA~~35gzw-P<D#mJnEdv;C*O;P7oQt=k}z`z;{kK4
zlI#N(xz<UfnaKM+N$$}iC2h}nj*?J)nqU5$tXnw;wKy8j%Ou};HJMGDw4g))ezN4c
z`J-vx9`)g0hL3qauQ#YAXZ0KQ!Hz<;Y0(p9XbU1FJehRe5AUEhn&SDHJTyZz@7C#i
z1&7{_E(7Qf91-h+*C5uF1<<|D-l;RVL}!tB(->fK;>IfrTEo76JYWrJ7WP+}H#x9W
zY{L>-Ly>e4DmoaVaE7#wKn9Yv1fS5R7|FyODr~fn5S<Z?EOwZsJG$kjyv$;a!eCd0
zWNIlR1ZxkKESi2!9dnP06;u?oPLD9rJg3abVL|360N`aM58%wuI8~ag-Y&flZX4Xn
zLo6Ze{(^%hxnyMw32OoEnS%s<j9lLn;N?1v@VPQ+O$^r#JdYx1mm*L?UQS0Nd07$X
z;WKGCP-YzTj{nod<Jok@ln3$GJB;G5Uo{N)VW%{b<-NHWk<z_H)hH@LQG$_~8P~b_
zhcM1Y^2)zZ8_A_1kWWa6C+6ZAjPje3{7>6T?f50j<x^o|K@wGpZU0M?CJ>C1S22_)
zep|4md<_TeZ`ox6IwF|`t=-)8E0nH)|Lg*Jx+3iK{g>eiy5%rD0&c@P9{92;2`{g(
zgu)>JeMvlT#o?3?T|^Dy@kn2EO>t-R4+s%(EXU)?zpY@h<wg9**la;Q;Jn+ld`*%&
zI($>m4^YNWtO3ZH1EB&9vSfEP|FY<<<n7`%v>ghf@xTd$$lp|a2j@+l4hPVZZx=fm
zll`?QC_la=(QMnv$1JQ6wS%_QAgFYJVadvVBrqiiPQie=CtT>mkYCju&solmWW%@R
z^5{#BQf~_2p%T<{kvfAe!1+iUj+9~64e4t)@sO1e%0huZ$;R-K^XW>(XtN#xWU=x8
z(SwW&X<=Q+?#)171j3TfAtv4d8X&<f!oVmAhG>Z+p>PE=c3B?ug*j`uPS&*`Xa1bP
z|EJk!^B>5&c<$_!=xJ=i0*uwS!=j6~Gs=(VA78wGasAq+yGpi7lA(2y3a$<9N&tv+
zTfO?0OJbmhC4!i_QTU};<*Q;D8_88pF=0S`Zpet*WdT~!Dr$gIGl=a1Y#qp$^RZ;4
z`fy*)AwdyO904&rwjfLR`wf<?$C!#bVFDJDk#hrMJU@QFVMe}ze`{>|E=Yo~$q4p=
z@ROvt!;M|M+zGNA23%OfWq)pS_o!x$&MfBR>I|pkuf&6I)8%0`><-w=z+4qD(6c<h
zJ~YZTD>je4VoKQrVo6j^8)rw5PpQYXh~!5BZ_N#l%X**eDh(`*9C0u&sgqf%y}(4#
zLXF3%Jba-Ufu$^9vKC~1V?9V7-UuGXr^#t=Ym>rxlY*^Sd@dhyg(CQ62(W-WQ{Eux
zjh7$n#&+bGDHUzV=25NI5FBzhzDnsCIY2%^>C%4584K8i^lYO?oMpF{8|Ej_MHX&w
z(@9qA>aW)SgGvZs4zQmmg$q?6AjsA30UPNyLVnQ6r#9`=gJZCX@z|4y6|Nydz8p+3
zT*NNvaE!3n8+3Y|tb*ev!@noM;<`B>zObg1v=QE)Wx7bEenFA#%Ug{}`=TnqMkBi^
ziRI;Xs&y1ug_8M=N$E9c0oI)*n3O;}esl(?*DMHn<3Z^dJ$f&=Fz!Pb9$@E?f?=QJ
zQ#euIfRe=IE#J}6efUz{gTL8pg(eQg+kXAky#0y;U0KlGknjv*jRd1j*<8>7AKr>w
zhVP7;v6JkYKewI517DF|^x=0V4p7sr;LFR01rRI}i9;O5WD!nyRN+eW1zb>guYIJ)
z)0s=yCVA4DMX(eC8VG2M=Hm??bd1k>=<Qla_D;}H2WBO${7zc75@D9~Q>N*X5^W`*
zB~69L>^J}Z+u3Ch3E|VbywbAZYe<!AgxGHReFUP!o)+f5(tyZUKA|*$^Bai@bE=18
zhFzPig#l%2KznOR+BZL%Q^W)Du{`Y!1iE8zuQlyB43Pl=i$daVD^6l7HHm4TIcKVu
z#svp*O<Cbqx{T~HxKZi5Nrll#^qT{j06ERiE0{a)ydPNMB)DWU0-21fHZeXXUQI)W
zKQ4Oai{8g@-}f3IL=QROPhlL3ZPiz8fK`Bxnl)WJJt(N9<RTJ>&<bpH#u3E9F%dxz
z>NI2NfKAnm#?nYm4*_9c^w2F1HiD8Q$Sn$~a7MLA!o_`EH8s@4_~uON9wIZM&YB6T
z5y=)eY)vq${EsNW&uRV^FTk$FOtmDjQY43@iP6bF53xK*;d3%N^qQxLwzZ0N40*O$
zy}i;cW?M14$jY7z^(npoy7ay<o|jOA#J~8XIaH(|ZU^@@>P2h?sJ43TH<G<EMNh~&
zVXPZE_>nqr4K>6$<F&vLb<C<jy8O(=;qatL>Uo(kEJ6%r>quk4{vd;Y@F1yJk`<Su
zycBK$4jRcDhPh=-jF5G3a0xLCtlOt>Ms{%`RR#<0)85ZiO_qz#xpE<a`z(HnUM1U>
z`{F~TJ&~t?%fb_551Kxl8M1)9$arGN#HH#Hw<^e)sK=55dkqGY$;k3V#&0Hrn$mzN
zjajL|wtmL252R&HFW9WKM$d2H{5R-dO&@=Ts<UwPH$<{AhZ|aF!&Be&qo|Wv7%Lqx
zCMdAysyN)ZmT|7|t+_C7)>!p-iZej4kSm7)_F)X0SZID4X$*0g2_szY5W9W@Yq`zG
z<{szpa)@9;eC`{8KG0}16rPRKRC;r)Uk)L&5a*^JxKWi6SPV_(t)HHL0Amtnp8bb&
zI^xCci{vOCAEgmF#oB*(5bi)z@*FcjeY}kXF0x!uI+^2)aIa?U_d^PK6wzm#{&1fM
z8!}J2i}0BZe4y;=pd(a~^IGM$DCLEYF)y_2pcn_f9OOhXe@@Wy@`kJZ9`0`uW;u>9
zORp_&QGpQRYYM+?sPM@D7nZctO9jC~c@&RMLHL|cm-yiRII@m!I}RW+^>NunR^7<o
zm3DsjxC7nn@h%28&xSLJg7uiC^&2oNuFgujaZ<Y=!1UQz%Us%p^2^&0#gA8)Z%1u7
z%Ai!@|DZJ)Z&(hDKbSG`E{oFpT>>_SZS_n)8_iOBirU$rw}h5pJM1&Bux!0sLEjeo
zP(8Q6_YvCO%iS2s4K&FHr1(Pa4%$I%>rMDqGaL6e@F8x%45dBpO^@twn)19n!TG|I
zrkQ7x<|;pdne^dHyB22dEQ0NNwD4p%d6$7*Kkff)_RW<`F{76Rub3nl@d|VME~&zo
zRpJg1^fVBD9v3g%bwhE&UqNt0)<<y(HKWb2`<~Eb!437b4i<5=lYK}3*-gS&qQbOI
z<nk1+^A7Yyj*X}0ztq2<JP0lM$w!G8n_;WDMc==_ddNf==>Q+Bw=<q+>TFlph^kr*
z`FNyB&B8UfUvx`AFr40E-9)n$O)jM3y5Ouq048AkF)A}OLZ_qQAA=#+M^{olOR^<_
zX7X^`t#8CK4EQ3!gkf(#Z?7ER0Z;E#KK(G%Dq&F2`b+ax?DA$YugYrnF!pV!6X^&V
zdQoa=f#?9Am`?a`yZL#$;-ZI-u%}5A9tDmRu9JMq+-V~=diX#y8}XkEo$Ya=B~lS0
zfo2pw@61a!&jt?Q+GH)-6xpS$5erBY)U-^zmZ*+1*I>X)tXLawO6*TLMS^nHTHrO1
zPx&Ot#}B)S38VH{ssJ1^w~GyKaon1XuB28fD<OCREatkr$G6okdfg;uVFgEYDeyDL
zWJ?Ul2^|L>CVa)HW!4Iq9fSlgXQ_dnMWwac)I0|#XeA7c`b8*}<ZbCHvZ_2FhN69p
z(x3x(H`lUaQ>GuPu^=wP#hPF<Ws!-DafbiFBB^q7WO+pIL<l8+eXSfDL#mXWUZtFj
zS&Y)p8G!cgog7M5_so@m;h}H5l33<&jhbYcA_urDvkdMO_JeZ|Dfre$BTtRRHoIoa
zNru-cSYfzYDJ_u1sXeI7JgfT+fo;npSN-$zW!Zr|<^K`sff^IY`u1I}AULqRaGC~g
z7aEOuuL>Cgqz&rCK@A(B%I^88f`ux+R}SETlV<~X{_jW;bW554j@-aFfSpbbq<+fT
zffBleawq;Bqu1e|QeR_1-r#Cc?-bZUtv^(qU^u)8zfN-fZxLf`b40d2{5KCnUS*{J
z#gWP@44ztCajoyUKdT~lK`OVAlS0YlMXt*3i2<t-dQ0WA_|du5bVE)p#Ha&ibJZ~Y
zq<x9p)8(Q47}&Wu0jSU(#rBr+eaSmlKIvFQMB2hz^J6xeVCaXd>f#uRa_NfZJpl-3
zm;9~jhb!l{&w4gEdbrnQWz>~?DP*?S%%Na2+LA$4R53auf%WDij#z~_KV~j?lR_{C
zA|uOa@<^#6m^xOxF`6{AaC*p9YQVfC&J%!>D?G+|mfqYwr`o~<t=|~=U*nstH^QW1
z+bCLYoE1QFvcvRWkIVt`HOQKS6T#gEh$9hh@#iH>fda8SOj>BV;t=E0rseA7L3(0)
z=@UCkpLo3Vi6={+c)Ik7XG@>>_Cq9v5I(R@PL(32^A?YuJK9EqxlVyFDG$ESNQt%M
z?8XZ=H>U>p1tEqoM=1#HL@}%4Q-)OqYZzHRyEbA`YdRY>lXUvm;pg4$Z?|?fx3+iw
z`~>K`pU)vE7#Ic&qR#*RVy|~YMqg0$-Ly(n`}nYZ+&=%2CdF_3aylJeXWm!0E?h?*
zGT(fWZxoGv0T?o6UZ%#(!@sESfKbhY$*ueD7QVZckRcKq_+4`o{NhXNzdWy4{#iQz
zuU`D~bY8vmTbtm53wL2_bEWm)+$!zBcCt~i3q}t652N;cX)NA~TiC9x&8K>EHeLcO
zSsmMMCOeJwmAAzxiH~J#&gi@H{pe@$kpt7{H7PK6HtHMs-&`ic9;`g5upz#8!8h4v
zvSzfvH44PCAzoCXfM4kxbiDLhaX~N4SqbHCR;U)HEpdOUG94ErWs#dyBU?3H$BwZu
zqhqop!LO;ZX({dpOI{ceBcFrKMuuhx4<#ETH5Bv7B*z*W30Hozcjg9Oqc#iC44EtX
z5kwjR2sIO5vnJgg$BSW84jJ1br~85$>rR_mj51gEU_SE9XL5DhYa7xCz%B#Y7DQKq
zG0lcRATBIb>k%6cK$FmA|4f&aFYE*Z&{?}ivBY4lAIY)hgLa(+qNsNaTiyi^e|@CQ
zF><+3&Pz{nUeHvC=x7gjno`-Azt~n07HlQJ8nql--LvPWX3@&5YfbcYt@m5!1!qyw
zX?3P6qARHSY*Pd%ur(dKLu$=KkXODd#je4wh0_BoJyHXp^O-jX8BTaN$vI7t$Vghj
z=|e;a$N#}@PK|y|rV+$J#I#@Q^lMTmN8uTV?8W`;$p^DX|GD*>MrkBLI3js!OXGs<
zXva-UqIqC?vcjV9Nvk<V+b8uZ=pYdCgC62GWcaW*v2Om`z=E<mv!W>q{~bqYI6^Qy
zEi|t*d-pb(;Z6-P_3E{Y@uzWqGxjc8+xu{=_*ktJ_S>Rs+t1oVdu@4>H<M15No43B
zAOTQ2%cOwdcD^RY3=%>8dc#sHpYjilM=U5b1aI1E2KWeQ2d@ynaAV_Vy&ot)+2(%!
zpf7KIos;N_PxDYnGE^!<X$UO{6Btba19MdOAkWvY*RLP_BJmP@<tuRGmbGw|ZR^^~
zNZ;5zb&ED@E>5rLEE@{H(nMJ1@qrtI5s*Fl_i&IcE7(l}05BL*a0ry0QLw|M4La_+
z5w{L`<V8m6vM&S~5*2<EQAo(wetFAUJuL9My}vrVvY&<@nq~;*KMh)TMel3ohc#P}
z$SaM)H@<(-D?}<K&6w-T%NI6{ibN!y5sB##Clpme9~P$h6MXVydX`N_w`A+c0k0HY
z^Bf*}limg*nV!Ya<{5De=l}s-$$eripy*5r5EHeq<t5$vppIT5Dz3M)BbdoI6Czjh
z<3eII|5D_L##a@wx7y7l{i2E1ev52mNCt*s8I)&O2IZ+h-GTU@(9IHaQX3KT6^JQF
zRrFu3Cli|Z!pp$}QjryL04gqZP<~V06M#@)r?$UVfL`F3T^1jFDs9v<zm@FN$Q18l
ztEQ1um`8C2rLefWnxw17RBe`CKB&6{0p7&|jnCi73XNm+F*CjnF#|r!Q8T1F9%O{z
zwXdY~X1JNSa4YP2#1Mrh@(8p=47h@pwS*~AZT$9lDf@;OR7rPGShgUgQ-QIZH8W2x
zSSeRMCD;`~v3aX9iobY1G16Q=vzYX;*a5KksBC58zSNz)Q0id)m0e|V;&}yc=I<e}
zFfiy&9Iv)suf*pv$;0UO*XurX<->aEIC88Fl-)_<K_HdYe;VsM4L7uO{>AA*r}+e|
z?AZd#1>N=qChB@=4B%W4(U%sO)JJ~1T=w0bEHi|-(p;3Wne0mP6aq-CXl6N`R?~}T
zCpSZqG{vfwdhQ(}diqs@4auvxe3dIsc`p<}?;Z=eBFul|B{iu}q8E}-pKPdkVu*`g
z3#-YxgF_B{d$<HSzzmwmooW5#^}lsH=V$HXH_gJsy3+D5M|R@%jtExG+S?zGj%v*(
z?v)Z^6)lBl^vkW-kA?%uQM4woR7`E0oJ3M=+{h+ILx(uWPPi$=_Br7UQl4&wCG<u^
zOiOfPD*>>8^rtzZmD(b5CbeO>h6rzYwdm${=KJi{*0dzE2__M1NDcV*+<aN@HS?z1
zmqx>qipR83&85-XWW}*chlV!qoAc9xZOQt)-+6<>gIT(LZl9&dXnG9e=o&`K;i5k<
zm*|V};Hh_ra#nm43l>q!X33g@v;@v5b3d)UT?2c!`hJ_f{}H}-_67I*4*h-<zV}$Z
z4+mT!Fq0SnhrV^Ze{ujz9(xgz(qcCXg9~xO6HodYvP}h%t~~Lmu&yJ&Bb#wwJxb7Y
z6{Flk<atAB$s{%0qaOyIFoqw$M~08I-$&|3f-(eH+jxI=a{T7}$I}*)F59Q&NY=tT
zr{>v0Xho>(Y|Xd(v%o=Yfa1(P8}&RJW%mD@o16IGm#>oDEzsz8x2;chGB6|ECrQJd
z#Ne_9vqYYMnorEg--F?>-rIQ9zigU6)9KY`Ls*T)_c@$=4xXb3m!B2!<gjUQ8wFWW
ziuZoXZiR*EwXm^JKo&wU66FV<b#yLZ>LM_`AW%$Qh7GcSQ>M4<vu?+Hc{NX`snN9M
zCdTC#WE`)+1>8J7vWC4SoKU20u>K|3Bf>Rp>PwDS&$>WMiT#*pR_3iuB6J{8kx`#}
z!|GpNjEj%yG^3m12UyqYq5Nh=8x^fNvKVPVeJ*wrRADf3-&(JPtckU??T{Cqdg_(E
z?`UXt@rPu#N&Ip{>kS#`&mTyIt+v=QGa$7#c&(w9n+;Udw^wI`N=bP=1bZW&0L=s6
z+z4I`*#z^DE~KHDo3s=t<nNyj-6;zhKoUGO4|&h5TsnHkwFk|KHr-YnXZRQ{H5}ZU
z$1wA!_1SD={rKd(efXn@IW^=VHBBzq-o`5<^{XYN1e^YFIzxYRDP?;}Z1Zm(Up0fa
z9Ob(N3An%61H9H<`!ALgg*B3=3z*}^tA%dSBAab028lsM%UI-M{%74_(38eOp}J(~
zY1;rM2Y$9@%uPEVlb8k{m+K2W%L}%_ylo3M*tD~@(We}v<oUQF-BDaU|KpfIgKV=t
za2Xxl1R=@Gwk6QdwF>dj(@P)^H&PWq2kgjFu}g_nT)Yh4k>(F3R`_f8=Z430jgW12
zvJO_kEh)BW{-KX~1q!Ws%6q0Hil6Phr(B|iK3;D$&R+WxLyu#c6?`mf++NHYWnG-;
zix8M*n&qMd<y-vB$hQHP|M^42x~T4En+1U)QBlmVGlv0;!yX%+k0Lo;(9_Le9Cx~-
z!ikb?owFCsZEUFk@k7AwjbB|N#0ZXnOhf)%fc5NwVCYA&#+R0iGa<;p><qA8E=1W%
zbvJHKRN-@U_-LzB><C1TtHuoQ^H^j^NBQ^){%=NQ-F)DC$Gt7#uZG^geXhJ1iyxt!
zJV*cuxD)sv=7#Gl@Kc+@XL!|S(jt6_sS8%&To|ubNj|lKmB8MC$`yhQzTs)(t4XSh
z1kd9f#`m3>wTGLHCJKugqj5+%v%u=eT5!A(uuZJ1m7*w{BKd-_L_%Q!VE`pq_}Dg@
z?F()<+^GKoY0#rgZGDJ?j^jb_rc@SKWaPjYQ4CNrK!o-E8v(FHiKld+VK_Q+w1I3L
zzAaS%#YcaQKU*r4yX=K>&D>>gl*{KXd!t-Qci9`|qPol8DA(6r_J%99D^EvV6=)Q)
z0p-DnFqBPB|8N#P{7ZJ+<8}`u$f$hN1>r~f^GCCF_-OJ2<q!r7mF)+E=M~Rw!*g|f
z@YSp2&y6LI?|6@IKU?<vWAFK$C(E9H;ywR(XW8>lz2~27Eqnf%|NPSVe(OE|v|_%G
zTvQyw1m<JlxKq5Ez~)B+9D80sc^xxb3&jZElpyU%MfavFWEi>ATq}?t56SLQ2p&46
zS|t|x_AOZ?QZ6N?;TBvw3UAit4^roZgIL1DyqgY)uPF5`9-<u)HDEie`X+kVyVlv8
zR?>&ug<{&<hCg=TkH=`JGJiP+OV!EuN(Do8q*4V7bq%LpEVoMitPE5|)|C<#R4@CY
zsCIf$S+(!1b$E3h#cFREqY~;kLkq|RI)V)WQBI!s+1hAC;d|21&>{)iT5r=K1{{L(
z$zi-MQHWO6JXX*;zCz>p{n|zeB<aqo20?(QGse>eantbneDs+zoRcBf3~FKxzbcog
zmi{cEVEq`3yah23U@izQ0STP(emQ5?P(?ObQB+zKsiNt5+n?p{SEg1`q&y`GsBVG!
z^v4*&>`5fk@gs;?18J7`3TTB6u#v*o3RjCEz}vp7+54YXZ1^m(V#jc#%xU{%{dfpC
zH09*@;cU%<d=eNOaGOWKY4n6#A!*=9P#6hKVus>uO-ze~3Pvo<p}+B(ptA1dLd4Mb
z(wy&VB6s(JD^RA1kNvY1XbcDq&n(F5z++1#7z19Q+KF#_#yEH6A3P|R@Txd|s~^3%
zaR84-V1@uXwNWE(=5JM@ltLpq52KhEzF@yFbuXH@2fXR$51hGIM)8QV)kU$X@CoBn
z7r-L?+@ujSo=2SlIzTl@Uax+$(&i6a!F3E+taPM5&TpC}1B0QclH!6N1VZ$I2{1Rr
z?!*F1JqcW^i<g89!T`fyA0ZbeNZvC}EG2mnlOi%B01~i%A*I1@g@hRH18o7265)Vx
zuMHpEFjNjlh|M-GTILV&Z^VS-vdJd@)L0<|>^vip=23ExUCytNk*yE{c6!)p9UY#x
zI_EZyOVk*_l7Q{cMuQFTW$TnFcOw1Tix?Hs@e$Tp(J{=4VnDKjQB>e!WBi2NFsLD;
zssD-60g+^2aNYeM_m5hgWP59COQd@k6f{&V;ETHtCH5x7>f);R3n-h+&>fNJrog>l
zr47Vf0IJ<4KE&1)CmIl}Jr0lc54c6;rII2d)DGJVKA#k8Bq_;Wn@wjnvD?t}@H2<t
z!IxGqR0!WPf3u|^BY=Eh4~5lG;bx^i0rZW*r_-4g@JyRSS6P}0U?QT<(4x6<IzFTa
zvE(9!aR7gW)mMyaApR17&Mjo*iZ)^jM<;XIu$?ao&^l0F$mH@iE4<VxUJSr0!&ERy
zR>UtdJPbxC>Kif+hH8g<r-*KkUa|5ukTqB&^t%ut6Zkni3Zk%9U+`5Fy{LLzQ{UPi
z>>F!tg6}xZbY_|>IqzWI{?N7Xqs09QeQof&QRjkXTWZ5Q#6lN_F-Pye8qnh5Ui+wZ
zkeo?!(>Hw;er5gvsdDCkeq-*1Xd}ZWm=tG?aBT8*ys{t0AN7prH=a-YUrVU0K112r
zRUU1Sv@i^>%u~!V6yQt#kGVw<qI1-9bb-1Er+Wpy7%Y;C5yeI*De^H@!h#f!7!GyV
zCdSr<MeYdWnQ$L1d@~gubb#W;%#0CCd)P)3k>3DEYiLLc;!Eb^(eM)#V4yN_JXxq)
zm<~sh;c10wD7{p>O#3y6k&k(;g#9|eEL7W&D>6pdxbGFz;VHtgvD^}Md?-9(hG;|#
zdxbLY7vhtIZW3uEwAln_VJo=Wyu?E(a9FLaahlxJP{4Fb+3imrVamE6)NXBK6uSW1
zNvX&dkiZ5u6j|o`SD5AfTK-D;D(vfKBvB*OOB58~Q@Rx}qRl+>zp-y6)mJBqg>gd<
zAOVaGVdk%1WPk)4t?-U#SyAwADM_$M?rNilRD}&pNad1H(bxfCbw7g|qqe{(cyM<v
zfUSL00<HuxCZh337x1&PCf%>fn3YecIC`8j$S$B-jYZb4eKp&wxW-BcvQ)VHYMN!M
ztY_IV4r^e)WgJZMnBR3daFmaDg#BTGgIawpVzVa}zhqt!)Kolh>19D@UoF7~-c97j
zD=mdTQhRU>wQ)Pya8xIbvi@vc4WJy#vDe2Gbg^>Nz2M5t!kN)*aeK>OBvJLKC>n5C
z5a-~(oJ<cJU!a<3ZUnv<%p+IXENtj{-usw*99}^f0u7^2Qf)6EjfMoE=vQ!n`^qr&
zk|$@97egol6pbXoJ=xxBxYgPYRt28oEqMXP3cEcU^tbY1<tJXbJ)_3|K;h?{%U?2~
z!Jh1XGaAi#boloQ@yBsZOcaDa8j95J@Dla)l}rOZion-l7pkqs9jaS<-zL(;HTZkn
z>8>cDSX@{sjM^#;CCz)&vuwaTM8zW>v|eAlNnRB5OIFlhB`-c@x3AC*mQJq<_zS4u
z2UgYVTZ@1>X(*oAXj{YQF7vta8TzWca;9M;mAW=1clWO0Hg^^eox5G(P4faFbp+p1
zJNnL2J9;Ua{`{i~b3_|*KhM}S0mkH7rPWgUxl?$|idNtqX9bSuamc0{UB^gSyxq!v
zd*3WBm<D^-le*c0X3g*{Bfiucp=DE|F3o5kbJ{{`R`wQIh4<u&C>Zwf6^+JKJM%}x
zMg-P0Ed8BN4aXPXHX6~#PPT}6xz&XkH}lHC_rQ7p86mx9O!$S*-3-t0iKm9cXLWt|
z=V0w3?sZ>@)RtjIYX`0UlY^E|Yc`d+L~w>%<^Aky3C_zX&x3sOhko$|WpVF=F9VaR
z$cBfG-g;Oa#HZwi(y6O1kF8d$q~#_W{z5FAB&vlHTG{bv|GFUOeQ}aI*odkU>1FPJ
zzbyDt(ldO#-RPyWiQ#y&fh=dU_RH=!{iN2U&Vok&L5cFQT=-Rn{=b$FeYN5JvAOhL
zwGE%mT$(f;?66{15lf)gvboQ$U89Mnc{wVt=c7;iudzCqIWY1pA80vc{*jIxz!Gng
z{J>SYlN?f?KQSH+|7PBy;J5#*q0&`r*7z*{=EqK~#?oX3I!2J17iRLhACDz{sG8;Z
z38f>hILTQ~<Mw$l8v4hd{TRvr>qP;c^0xoXA0r@y;|3=sbhjj(2wx5vMO?$Oh+9Gl
zPS#J>zA4sf&BW}uM>aMlN%k<3PFmLBYVQHSO%;+g6fq~`u2@8&Kh=M&Nj;kj>|g%x
z{7fNUa-*1mjrvhB?LC6T^<j_Hq23?U2N))wJ$nNG-TwCJmj3V7)|02t9`8K)m+dFp
zJI|gz{dVWEd2ajJ<EP*LOS1LHbiepB2Q1Dc`Iq^n(LCo1o?G(!|IiP{4c?A>AI;H#
z!p>^@BYtksv-k7KEyWtujXJ!uwe^>covrPiX3|MVpHmFg?4;wta5S7u^5g}CB22Si
z!1jN24St3`MigJa!U7bd5ydTGg=pYc7A_P6dCi@BIj2}sh-oh}g4vn_7lUsuhvRfg
z2zy17WAmm`F$bYpF}kA1$l+YM_<A@4qkv(9pNEJTBL0R!J{sjW$O`juf5-*{sPUT3
zc6nS$X>903<w3bZspRe@OpMF?GyEj$2Ei0PD4xBJYzad!Mnj4=&>eH-V>c?(Yj2be
zue0f9)lf{AYEfh;Tq7bj8W{x->Z?Y>@g&kzKkv=2T@>)R|Hy0#;i7@JY&uLwg<E}F
zYEMtZ&hMDZ<H7@DaJQOKQH=LEci-X`K#3v<U&1!>X(0hVa}4j}wa!7g$icj9UgzpR
zTtZ_8`qdQU2*_v(D^cWw*$t3@A}YLG8EoFXI|P!O0!@vHx{5*_m-DynPSQC!Jb%A;
z)=JFZPtQ(%Xdko=lGi_)A6v=($?1=0?Kf}FleZ^F2LM{PcYI*JJw88czrHv>F<;d7
zI_6D8d4}Kij(<#Ae?2{Gbvnt(S<-%Ydek=UnGVkOj?dezPBUpA?;l-&%-Bp!8_Ds>
zd2-Z#*FFb(<w+CzMQFOxo5{&x@~(BZ|JM9-?{)jAef}eMdDuQbhVBkce|w1$hR)mj
z7e{+%$?3(}=}8A$gZUk_JNrj_?RTw%O*015Z_@gqb$p(5-tHOg(Vy<g`{ULbOu(D#
zYi#SNz4!X4MctX%9<<L|`{yt%_qTnsh-Q#ShVh)X_S^86)?Zs@Mtf&JHchk0t4@qW
z`R^CzIrDpRu=j57jhSP8$?BLL+P^q!y@P?D9AbFS#p}*_`~2d(mApAQIlyJ_w9bBL
z??WKQ(Mbmv?xNFbnoiF5pnGV=teW}R{QdPsrw!|ei++4=M8k{I^Y+Pc!|eHcvqEMK
z_RQM{xYj4fIA^n1CucuGyRaCz70u-R+m`v>?D;WI@BC~JmIH#Y_RsZ`rdP9`=W4Ra
zaqG=d`;E~iTJY-$H1xi0q*~g%b_bqmQ|IsZOwSiEecUuNHu|fg<tA=z(mqV~4t{9E
z;OSv#&5%T=&E#Xg?Og1?<<*B{@#x;Ydw&{^d!xBwmNoIs)zo+9KVaVRzq}mg@P+&4
zMR8j^0++_-$5-mx`PeX$zW?2zH=d3Bui)h(?|sT<k?#%ff^W$ftnS1E!}HQ<e;*?+
z-=#1}!tHuqdh{$S<`@O!J!}}%I3vi$b@+Sa#g5@nd%aIyyOa5>10|?V#-rglv-W5#
zOJ$xxy(b;_veB7q2g=VHsr*w`Cx8g<8Vp7hPdEcFY?@q+@=K$J4@T(~MYvpNC?H#O
zqcH>)^j!QQ#uJ?#yoQ|?Txd+cuw8SRZVI1)N|L70oP%b}i^%}$a}38A;3>76Y&R6q
zH5gvarxenKIiX{$eO7?kPYOxHv`lMnWLU3n)$B<Hgqdzsf0B#YkT7~}v62N(Z%7oO
z0*)tGQA7*3@#-Zccig6AIN2TH@Xgm<z&}Tj^>jGhOy1?ijH-tK1UV=pqZ~aLO&7a;
zlM=c))bdKXNrI>|7auZ~Q&51W5HE+YqBFY3vA+cRbG1sSX8kBjr&jZU9ONea3!2Kl
zq#*n4Cbj)hUa&wUbc+`@Z+5c1wYj~yv-x=U+2cQN5!MnJ8Wc6W$%uH5%}rf)rJy6S
zN9Kvk`QWGH)_M2sN$0$KYS<S<mxBF>bCmF*;RK&)pQ<0pH!z_z!L`3_t<m$)Uhowg
z191JiuwEMG31)ekWz+MV+!yd9eAgUKB${D3X*jR<#x|j3g;o}97d=C&pYMWy@0tOZ
zj1=^{PbUpetxw0<jC9*Q(@Nb;QHEyz+Gs-4&8mi6cUkD2Eyip&3mdF`Q|ua^iYodB
z@9GA$_Ns=RRf1|)HpnDk*xH{W&e6D2RD}_Hh>@m6>nj|Azzso8<4+iiZGIi)j1>PL
za|pjjgkExjE0}**bZ#;k-3mWK9@WoA8I|qG?U&|)m}S?S96bzCE5zLj_Zn0VMDCdO
zK3z=--1j47P6{eL!A?rQ=;-f*pEfTtGj!G)=oQoxE^qm)V;7JCLvhBs&f%CuY|BRl
zdH|$m992Ha#!Wjt!vc6{cF7RZ5_3BhzaA7QVpHK-S`Qir7I`x5t`(S}mtJLD_u4h{
z5lZ-hk%@H=jG3Qi=%*!4Z)QBR%>44I%VU9*(-|Ko=mSQei@*)QC=2tc%dgFo?%Bb~
z@zIaJo^+2-j$a?0?0>HurUNWZWX@}lca%a}3p8Xm@4Ms>_7t`bcAW;q*zXjKfq$9e
zE_%=<NRT`MJLu}Po^wx|vYViZ2{j%Fq6EJ!j1<hpVZbi#Ehs){$&w2>1+4~yr;8cv
z$Hx@$6JV;P0`wL<Dn58wLsy#8Uq_x#8*7MOL1eQmgG3_Ua5)KHqv5QHv~CGWf7Y=Q
zyCV{)-+<YG?gW;@N2n?~7*NOHg~tE-)=)ZI1H(jIeltN%K>Y_Q^Z;?;`08fTfdnW_
zLxh{O)S+}_JB>NO02e)CNi}jTrMto1n*CdTiK7bXh;nN=*rJ4?zDP=8S>@dx_)M2R
zi82k!m=p%7M5x#12pDO@1E%%hL0NQ%OQCy758Jo|FXh93BKhSSt7gRB?<$!2*w0WE
zfSgQQ)emurNUy9eC9n~^$oQ7h1BaN`j@y2TUK=Xz@p(99#!Lh^btz^LGH5B1BT=DT
zJ^eruFXI9`X_-YVX+xXXjKr8hDG1))*ktm-031;C%Qb2dU3|d&P-L@*wz^=cm?~GQ
z!DK%X@g$30ir%@QaDVqOa_pB340hA`7}cw!jUi)H4&H;Ehtvj$_jPa+_<qH{k`W11
z49YL~nDM$(V4@-X3GgV^9qv)mHgGm5wc{=`+`E*%fFkrmFkFHcqCUwnapN`_0po+`
za7X3NyUvjZVYUSZe>M}AepS0>Bq$yutECH#H5Hj2j~QyPjz^HU+;6zZA(~s{6j^Bo
z_?xZ+0j!n3N?w3Yf7pK0J!_pFbzkr8e}8oHru(jaOfk!rNyzgr7e4Q<zsemk$JGwU
z%k-{(Lta?eI!MQnJm2?{QX!&GABzM-47ySI$qoovyoxN$0Rd)VE;Q4xzV|56-RwKk
zCmuU<Yrua{LxEd_PdQg0h7LD%3+H$QAVi<eaymo1C|pYvaDO$tN-66XQvx8E42l~G
z>V<CWhKz~>umUQe2_Ac&%&3r(hZJ?04TQ!@m*Bcu0q^4Z1)ar_#V+FqejUSIndvTN
zylTsjEqio)6Jqx)>vSL>>R`d%dXxW3)@UzHJe;tAce&s|eLBKab6Gkn1m2)*S!#aS
zw#2uD661(-8%53*nW|vR4tHLa{D4a5Lfpg-*_NXlptT?njebIGwQ|W^p)adfjB{ds
zR7_SGA_f`R)p6%|UTh_I!xEi^ns;mxUar`QWE}&dxM&VUYJ>@nq!&Q+l#3gzoDxL9
zV4VmN2F`8DYi~G(0<Z4&hqQN;1OaOvqMmVA*oI}e1LCyGJ#L<xS{H{|awEo*i=<|b
zL5+)y4^b#KOr}T7Z8W@A;v|JUsVU-2XyRadqeEB8iZ`kbp)a>fORs1#UBh1a3`Sdz
zwD_>1m*%9&Z7ty+T#T6?_6JwVMyluS+e233LonZs$OtCUaV_G3;q$*Ox&`f9uU44M
zV$NIj{&OK~N&aN2XYC)Q*MR+w^^yHOvS+eU3Rdwy3m4MW#eP2pI|11uD;PtAy|n2k
za~W%pC&r0D3n-|#0Q|6w&Ac~UigUdJEPdoGqY*?c9i1G%K?@^DQfz-@_QZVMGAIqx
z?Z*xQp1y={b=$}1`keC_9PQ9V>e#JV%J3hJCQ6NsQY`2MUo0e2w`5&llBtL!bz!HP
zgew+)(xmhK+dc6z9J&YLKN9c8c3r-DWTF6HkD3=WFZUA5T4*Ao+l2fA9!iIp8ef59
zqDUSj`$z58@i|Gl=3%h)xcamTEx)QeL`^|k$W1!LiwWrM^_$M#4=uzTf}*VPA;4e2
zPL1+%=g7QZC<8zp-tV=~yVL}Hb9P=D5&zTD`l&@8qnpOouYnPua6y)~iLQ!Lp{J#g
zA_s^QCDo7WkP8-ybF3iDgE_^!oLeXNw;cs&N9Y2-yhXj3wzcr=rK(Pj8rVHbq(^nO
z&9yh9BOuoWR*r}A=<~}Bnzy-NXXq+J8ztxdsSbed(2r0YPV;N>r**JH!yTOZ6?q=z
zIQEuN`SheeG;7tDS{mz+m_R>3l%NnVymkx`9qS|J_V7&`{5_+gO5td_n{)vK5dv+O
z7ln!(%<>5%#M34<g?IoJ3w8`J&CrepIm}iLLH!li0hqo>EWD8v$^bh_ZHfW9sdrRb
za;SLg!+u5>B5`{~drZE;o0K6$Xj2V$khao3p!!IiI@GUqL+u06;CWniMkbk2Bw?W~
zCj5wg-<EV`GP0eBBnm&!EmbtUL+#yWAHgDERaH*`wmU_z5WrOQ`PA~U^vU`Q;0yBU
zZORm^AJlGWY)~;v8suDRJwz)Yr4hf!Zp6?PoGV72sJQuA<+)#vbY@m)3&yd?;HT;V
zfd@P3w2oT)=N4WCB5yDYot>d2I5D*h)NMBEUqa7xRQ1hChZd?3^=7^6zMors2&HLI
zdp~$xSfOV!%{FX0xj(d0awv5Og-vnN{LdE<(Q$s#?Y!MPYaMi{jqd)tgH9>0LIwtR
zFong^S3glx3Q4yT?3JGEI^jY-?uVtq120?{73>CARg$SB)p>#SF7>4RU~PTpZ_~ex
z|MeOCNlS$P{-zKA`KEwBBgv3%QcYr>I!fNp>IGdH4tqde77;Qe?trvB{d~E2Xjdyp
zU`GlkL`fo6uRl0JXQ&VI32HtVX<!ag`|2ayLbzkHFS9y4Qp)=90zKgA@y08}nuuh-
z+^>|)C`=><?gbwk*^Q4i^^_x9pbp3jb3T6kHF3wK@__ghtW!P1-gFT%%?E@HC{||y
z)f9`V5S9=vZhX6p<(ASV()kzv8h`ls!}BOPVtom70gOIz=`TVk^x?@(YZQ&JzUHf@
z`XrmD9&XD?hO%!P+f5Woo_h_M*B)+DXv1`^{L>EoG*&-V2>9j=5b+;A)+8P#^HmmC
zK!dhn$E<M#^`jhsY3M9`?@Xj9sw?xK4G3ifKtyD7D_imw8rcbjB7AOwK>#!kwC5;c
z^<OtP_s@<FlSz6z%8hh7(iU8548f9kO9zlzpWqvT_s?zQzpnXbX_d{S)e5uis<(8>
zwywCf%O6*4FJ9`Rx|fGI^yZGoGU(5R$5lxL_M|Lgo~tp=RhZ^o8Kx&;0Ku|sWi?B!
zQ<8X(Fri83$K!p&Y>+h-PSMilet7*q=Gh$KpAyD~Gm?rN2=Ky<%8i0JGs<R0K5OdM
zK>V4y0@iREZpS@$sz~s41^akX5k?kcVPQTn-5JcEyhVc312Hw@TkZaklpFSyrkqAf
z#%cD)hJa)gASTWM<m5>m^_rj2#R8oGQb4W0m+`lv+$(zVLE4_1h$8&ov}YA{R|hTN
zT%a(Kt8C``TW=tCXa?-75NJTuYB2-J?uEXpjPf<hd--UW4EZ?}%t5QbB+EWo`Q~2W
zK-TI`@iD()(U*7^xvm5T3c(;*-&;?v=HMc|fx&+oqON3C_=+5^1mNYYXwdKxRN$D!
zJSI!@mq1BzZqWW5#sf!rN9rFeGo!wcm)u6WRu;UdR65ja2g<e2uKOHYa$Lv`6K%=d
zU8S}9;Q|-yh8=Vx`9{WFZO*kyRF7f40xyLCuK;bWam#D8)lQ>>TygVLkSOk0sEkP4
z4DF1qgTOm2^+hu@YtT@;lYHmDy6nwec~kKaH-1Cv5K@bSZpQo*;EO1GB7`zxc7M-7
z;4Ud)T0p)9_<wL&cN0NL{XCqRW968@a6HJB{bWAwXH!IBqk~1^Z%W6d!5^6ebad2x
zzjt<w$f<O+oUCd(<h)0if_M=nSD3!42>BqppR(1VrHDpTZ4|mkK;`g-Gsh7ysSS(o
z0kSm2#8;cyN@h9V>_%QYhz1qYx%s;y!X?%=Yu}aCciZyOtT=)f6<MauVORnh=PL80
zeNtN6!LWeTM@~Z;4(eOJwP;Hp5mta}-~2M)tu=Y{&;4tMr>1TndM+wG+Xj1Pvxf!#
z6M|&n3QE39=x^q9tZlAEp(^Elqg4C2+IQ4=F-F&$&wo!TOx}~5`xNd>zPd|OaBlyA
zTHobHjLN5luBl9<dd<Jw!A6Wzhy)5qQw=a7-RCbs?Es)`A2(-JGqYs`kPi(U(PH`5
zYY%O~TdFO8-8cW`7YK?7BDo-ZbM~1x;0iEpuZ?2TPjBlFW}h{Jnb(0c{qWb#+Bc*A
z<~Li<Mu4h7KC0R0&DrN}k@dWP8-65;D+jm--khV0J&$OX^!w8{Ms1s?A56ENbxXl%
zl>4|iZvVC0Iobcdb$-{r=Hua)-ERulpWHw217#0YMfk4Lyw|eXk9{Oa$UtcK>%E45
zrdQI*5%f&TwXW)kTw%CL?QgK@f2$crMH}oDg<WFN3>(MmT$-*EWaMhKY1yY)Rgv~L
zZy|mL^D!)w<Y`om2kYF*#+V)1_N-A0pC*gujypGS{;Ex@{GKRFip^Ty^R<kY8}M1J
zJY<c0{8W=h>dn(L%-P>b(l`_&4YBjJ-dbFX5g`Vhsi-GWDlNr@S}d|Pa?Px%n9_`t
zkkE$f#8R0;<oeQ#+&)iTSn0xk|Fe-lJ`E>L<+=CdG6bP81pm`1sM#M9?$1oqDCw9N
z4ejnG-;73ma~imt=L;`h7s!Eb8x`!csAry@b#_4mTw<{d-4;l*D>V$licG{maw~;q
zSG0a;)vDFoHmkTw({J5Mtll=S{VMJ6L&_%B+UsXuR__6n7*(*CD_mi={WY8>)UHt(
zSD~SO$|ZHmfgwtW%;3<Ps%2VX79G>l1SMpqQD|BX@Dy<#f0mP%kFd-b46vC<{Q?`I
zYqSE9o2x>E;7vP?pRrItm7Z+ZvQj79ShR&ogI*F5wQzyj7@KD{Wl$p3<Y%=|obDU!
zq=ae~V3-k*{1R*P7v$&UA?-r)%?i4|voI2ug&sGPj(Esp!HX(S#%`D4TQkd{(G)nl
zF)E?q%moJ~f~BxG&5L3K@yXMv^N}nyssM?8k`%_J92E33P@c)CXjj{v%V;d*?=njK
z3?_*?nj?M&V}x&rSU5F%uQtM&l?@UWB&!byS*{94%y{+?t|@6kwNYiz_*t7X;7`63
zR@uMb!lY(qL1aDvln(H%OnDRWiBqvaUsLQW1r1?FAm8_5)u$MHXj)+MfqXIai^`b}
zudlQI&<IOlEFOq8!o0<iSuTyu&@BfsaQJ-oCF{*m$^ervr9bkR>`*v>DUc<MtbGb*
z@irOMPjJGXRnuR;a_pll8+wA%<k09&XDwV6ci0?X=ur$cg6a?En5iJBJHuZnWu61N
z{Nh8D6XWEr0R=Ze3ux6hy|@x5P;x+EYPK6@Ln)EJ>73&nr9;w^t$NZdNpUnq#yWvK
zICvfcUR+{725{Vn8w9g2u#O@}o9N;p+>T0y1q^^9{fvp}yuJ0y+oV6|A@F&Zk&-(^
znn8BgXi7-U70102whoi70&qbxgm-ruHb&MDX#)SCB+HIC)ldiawT=&TP7*H(kR#NJ
znO{Ss4*}u~IBBs^13-iT9KhoS1F)5cfaWU9jM~Vqp@gr*H{j^dVN&GWIVDcqNFa^N
zZt(_yJ3@mbAG^xh1@gw#f_vo>2$L|;1heKC(#t9TP1_e;X%F^vl#VV?FJ&wm5`~ud
z3<KHf34`B<&oicANs8K(nS*v;-J`&?D+D&MC0Qh-32m0VX*Q2ob=83bgyu=J^oQo$
zoZ-Rq5j3i`28&9tz4PY}&J@EYJ(jeg38RTZyIuCsNr1G7bI<jYDw?!1nAFgmjqH9;
z_w-ecTbMhd%h)OCD1adR1kY|*SW$ptE+t+R&VdT9Fl}yZduHPS(Wxa!X(vLL%;;iK
zf_`MV7tOJ;t)wiB*ex=QsvD}C#`Cd4;TGESd4W=qwdQipn7)!c8}9u&FMMDZIz4N3
z@gnooY1&&5eJTMA9x87CO@SAFMPQTrsEc^mZ(5~Men!hxJ{}YDH;)&gCzM?itN3^}
zbNPU4fQ(0o=2jPA82t?2XoyT%_S1V$oO~bmFo2<b#JQus2w<;$!jL!Y^z+d0D7f(M
z=?G2`6ezz=)M+495J`t=<W>}pbTSskq6gWeJO2ivOmSMtuyDc#x?wW9U`RHx7K?c?
z2gDn95nI+l13jPKp3;!c!V#4LOdRhZ79g2a^e;a$cwGq+!%Fb@Rk#kQaablJes`O*
z{)wWvl`Qrq$FnWcgB&1mK2sSI$ku1K3N!mLglGtk10+YA6`f6Q36=+lK^hq%CrH8m
z48b@M7z_alDP#DgmpR&lyn|`3Zo%mW-%*G&uK?p8cuOnzD?-EsMUSAapj>xhhF#iN
z<@qhAJhu<%-Umb+B2XJfY{QrB8s4PiaeA5g9QE@srGxODgmnk)6GQHMoj|;@tv%<&
zw@7$%In)>fu5;@W3F|T)=aPnQ1D8qX%K;r?h?hEv-TpWWiaKZ?Y+Fvx$!zU|9TMWr
zUy_gc4bp=z!IKRyb+WEX_LHqv@V(v<X!?v1yd}y+u-Z#Tuu~X5-YIm6R|Vi-^|=B5
zwGpECpc;fHv-Vxh`cp4&y_?A9KjIykme`19>E5s*X3TK#weQwqK*C?MLh@O8p?ov=
zf0i54x-Jy>+;25&r&ZjU@)itRo)|%HH>pLhzuK99BCdzUbviQ|LR}22#H!#P0JnED
zxxTGxDj-@UZ-nd>tl&n)9lU5&N{i%Qo0V|qf1kC&OEK$PMFtDH0_noqf!qwz2H{k+
zIi&!krHc0GXtG7Zzn&JIi(my7J9nb%aOe(&-1Kykcngi(6xk}ZzdmSK+{aVF@#!HY
zJqrR3BO0Oo&M6LHO)EZe?A~{Np^=DXMzI=?)4ZrOk5;|$DsG8_R~{}jWQS}kwgcYU
z)-J|Uz|t4Bd@#3fNO2ee^buIBdB*mjipXZjkjz|-&02H8ruifnNV{=1T{g6ovnwJo
zG$l%^y-%lOG=ZzhLFrDEMo4z0D)Uxi63h1$y6(8}qRLPz3t5Y2|Meu>c1hzRI#5BV
zuo@|sUWB-3Z(Dce7T+eDhqd^m6zV2rAyaD}p~uZl+8$$z7<fi+v7JRk4qCQ{fIZqi
zzG%s-j~iqP(`W#A(CSt-aArmJ_cao2m$H|q_2B>dQdBimlb_44RSNXU@lpHOf2?bU
z(nZ8KYs&`LJ$&OoH<{16IihQt|G-<$pbD<ny?!4;G|toE$j?%0N_>OPzG46cjhaYi
ztHPmO+~Q86fZ^%%vY=q%v1ys<jHU8f3JCqL=e95{S5X9PJBUUgHQEAcNMnSRf<`RJ
z+QV3Ev=EVej|D)*<KxL~7D=#|PEw;f({k_co$it9ymMF8S?DH_WS~I2sfebyOVik{
z=h^nP>)xuGb*NSM%1&3(m0eF(=`%xJ<gji=IO9S#zCg0Dnlv1=Zwf1AY~qQ8iw$@+
zJ0KNb_kHwyI^ogH;A&pL;l1bV<fDxLkycM`1d&U;p#_^}$yjN=J9wR7;qAb7WUW4E
zvvQ^?$EP8$0BopascI^G8McCvX;B)Y>`|_Wm?=YsAWMbNr?DXVX=Z4p`1mHzITn(F
zD3mMla5(jJb=C|4k82Jl6~Gg6DieJR?{shhTJUTAtaZ@tygNC#IBInfR~wVz+xvT6
z0PKF#T4aCH?{+R;$6jatxu_Km5i41X1kbQXHH%%UYZH`Kr6K98&wJrLxT_c`(uJp7
zku02F3uY652zdmByjQl>8WHKP7v%jLOdz0U@dr?=c}VBtDU~)5JzpYV6@`h3g(#Ma
zYkpM7#%Lo+$Hl;foPt~-fN+E}qXGf4QF^QVv@>?GT<6!CCVcxHd!NV)QDtX`ECMKu
zz_`Cn-xUB62u9FDha2A>Gk`OL3W^iv9Qjx-G6ZCnLJ9zqmZHpTtN4oBuINpN699_n
zeMH$BfxR;8v$H@8f{zc&YStL87n>Zy$a<H<8QS&$6+OMi7@*O}on*+kn536Osum25
zX)jI@q~w@3X_avKr-IR3XvbL4T+mxFp8)RdCZL9b7i30C4cLIxwFt&eaH-1#JI<X~
zu)&f<OUr&``;_nQE!x&}=fg4iq!49-cvTbhDKiZt`|*xmD+eJvddN*U&>mIvzF0Sn
zAvo=dDR|?twUkSwb6bc2JIyh+gu4@NDHS6)u9|0Jq=Q3?>vl9xnK+PcJTfVbPlOSf
z1&z=Z2Z5tdAnySZ72B{GKiPq;UDz6Sv4z)H1$lzhm5k`<Oo19=me5X}^_5OYmrsZv
z836|gAP2j++7BKibs=d_Vrrcns_<$rz}Jrft`rAq9U&TZ;+-->gWL6$Yk%P1Su0Ax
zzZA7(H>trCYL>P4FFR(TKo>}+#ju&In?J32n*MH<z&v)!KnL=8{ek(_UHB(s!uaC`
z*U8hz4KVNp+$k0(!5Q=={KcF>D5-&bZG${Z8~sZkrv=*!!(hF6Hv)l%0dIL+=Q-Wl
z9a<1+&`EnGxa_cn*Veghb^88g*Mbv!4VIy@qiG>=p1$ib_#tX*%E0v5Nb;Z^Hdzyq
zOUJ*U>}_Z+J&2|QeRnemDWvHsZ&9e9;-Sm>EWY^{5k)P*^+L-Jfj+Y}*hGp+aK1aZ
zA<SVfRSckD0>qnU9BKsCcCZm}^}A-YNGYPER5aKY{xUF%{hUncea`z(E+pm2xKX~3
zOGe5EtDPGMkuD9d&j37Nn;#CeTM`jhGqk-R`Z7%l7l&{=jgWe7wfezuocVNZ0hf`{
zVIqNdm=z?4p*AxbWI#xEg`@aIH4>B?mUb0XLE2KeEfp4c<YJY}Mx?G#IjOiInoPQM
zjc9kS+&NsS*-NA%*yxgOU4m253m4SkyUSVQ#n1;s=f!wtfPVzSLpgq6DH>J8Y+VjQ
zKu9fW;`roPm1GUxVgLEd<o}e-GWr8EKFCIJp9QNl3iICK<CjFFh>W;7Teb<e#k0LJ
zyAvZ-Sdq3g31?c`KRW5Ox_gJ`tuxezeylWphq}L(5Ip9HS^=HVq1>{~s=KCPV_h)V
zOS2C?ZYt<Y+)O9-nuH$}qeVbnV(p$G+q(;OfaU*qdZrCo8t}7#tmG393T#w+LxP=m
zqOKNhRS6eT_<*6&>gaeaa{*WmXl;Rg3#bY<o*|0);)(<-F1XPUrHw4b)NQfg4rzEx
zg^y!-A{@G;2nXcNnkERDpaA%BA3=>kmojeFai5+kM@*RJhF4>(6o@MLz#RcxmmDj~
zNj}Rpip8EuG6>{Bnkj=}?SIUApIjLuh^++90eJt`W`>SyG09l-j)N=1FcR6A%d7|H
zhty)JLEXR5T#998UnP&}x>i+dIhtXMQ=DpOBCBD3pe3o;3y<Xm8GLQA14u5lq;?q2
z)}s5_iw<(oLUUg|0NQN?K`MbG=f3B<0YtU%n1(fPlNu4x;a>ab1gf7A^S<OjQ`{4_
zu-&1wc&SXVKkBA$XAZ}x&c(&poO`a<6{2VLZBXh<GipxQ1I3361}Si?Uij`ZFCBbp
zT(;pIRHG-!v7gjSWQ$T2JG^N;<$+?lc<INe3wP-TF|D9MjM&aKyK?(gTcp3LWSJED
zXN2g)DW%pe32}ZO$)2`0CCL;`Qm_zZASYR)E?p%6>UYwW3FzG}6}I0vKA}}VY9D{k
zC1FUX#@=<m<+Q8t`ajDC;Qir9aNI4OY$5QM;J+uSc>IYAm#TDp_^gYPk$(b9=RyR-
z0GiLPfD-JCzH!{zKW`oUo~0OL?N*e#C1u{w0S#pN($K{rN8RZ3b6uT+CV=L6F+RFP
z8-xqeq7ffL(h+R1Ff}P&vrTPB2J^gc-DM})G`oT#SyN{eb(ivGHoM7qd@OrPTvU%T
z#iTJ9Duq?}YAn<fKx_rH`-v?t3VujadYcxfG<{UmvI0EGi?%Gdn1RT+rZ{bowd7(D
z{gPdZ+MLAw{|yF8kUScwdFlpP=nxlD0INgjwANaqcWHYPhxJvrq2enZ&Vq6QJpXhl
z!c(VONF19q#WaXW5};@nD};eILO&ADn@@%K-{m(QF#Lkp=Bwldxe;Ck&vtaG22@>>
zDl<1qBGJBdTuNFav@clpF$neKz<uS_-x4ZZMPvyrZ7T%LHk<?+3+LDbmPN)3CW>zU
z>EXlp#e$B+h*L@Ma{UVS(R}pPVsX89K(&)dd$hmPL123cu75#sSr{5gtMA|M>#~E)
z*=yg`nu)j{BhiL_jA6MgoI6DC&Zm={N;HgJXaU*-N0&P4r;MH#iCgq{H4?j6xn<dO
zs`u=-xV4jXWLLt{%oG;Sn!);6iubJz&l!bk#yvHGyc~8bNLopKH2efVL5X|AU6T!h
zwrOk{RV}?z_lRy#F>o>`W?v?diiOD#1fK)fD%kImz5VYIQ3X8eJ_KkahQ+2Eg!kfM
zluMP;C+u<qF~B<8do@TBODTnBA<8+p-E_J0zSTY_>Fgt?53!4y5OqMLAUWn^;GA+X
z%qn<fL6}ZSt$!YhHsVwP@wYqcO}gV8outmD30#e_d(L~4<NN@AmdK6<^9XbOPKStM
z4UNlf5e~6`iPZ$9Sli<0qvf$cR{M;iq-#Xdhzzi>;LP?i2<EWX65-G(1Wb7W)rX=t
z1xcRH-3XEg6Dk}S)L9B5+Tr%0(y<&Kt|BaKm^#WIx{(P~e&ncj|DYg^DWi0|uaz$B
z$@_K3`?;!SU8y2TT&D51gc|E(05V*+@t9iqEDuIrm=6?Y1jU1p9h2DK>$H;XT{+2E
zm)YjUHA@bcn8MIAGJL-aI9_-ezil5KbkBc0Z9z2!9aXMe3jQnRxvqNcpxyaC5<!3R
z3GiB7vS-0Twraea$q~APdSaoGr1q;k_s9nLSYVWICd18aGg|tT69FlX(<fmk<7@d|
zg$9xKVfy;S4lNy#NR+4yo4!N92XB&ZedIFv_763-MvScbXJ?J(!2`!3G+k7E%-t!v
zlBCm8@M0(>_$D&4N2>EvE>&hJ?+zATNVARPHdLnX`Gr7q28eyNY%26#3eq9qb7^?M
zr&!=FC@r~7Znl}lv~EboM0Ybv?*XF*usjYS(Zr~uOoF^)Ox&3cudcFb=Bb%{>`VD2
zhDIRTpcJObE9Sn#3#9yQq>SrnHicM~ral&M##qO$I!ahMJfIqVEH_>9H9DU;f(36A
z)R8|50Q6?qj;-E_4>}xJsZByZLRwCg2JbH=18kT~c_*kPOHG?*JdbjDc5!n-Qt%39
z!P<KzyD>0Q5b#l3X44}r$z1DA9cu<cp~Wc1@_TZjgylfo`pcH<{VuI^bQ)wpvWLb6
zKXTl6NZoqcdT`N6`&Z-6;;Ye%Z*%2z9c<hk??`Xf%dbjCpDSOM=k5-}@C<Clf+B!6
zNmnC;Y}1i5O2`a@1U;StubHKkke*EquwJ$2x&fX1?GzFJ28?g9w}n*F$6xDJHr3n8
z$GdJ>#<|*7CqDT57sUN649r>(&<^2Q;T~5u)(sSr(&0Pcr@gDvZ84x*ki5yT*HKde
zy|zC^gOl|mN(LeYjt*yqgx`d102DMOcoiNYV1Zj_Wk{#f;pcKy?dX1^qE*^QS(=qu
zQ&5pvaUpkbDP)MIhGkx5NyBOK05$;1qEG%p2=U1b&$=Fty}YwE3L5PVgYu$6JogO&
z@AYP8Ird?jPU#@lOBW@sPi07<M`XVzpD?OG)Q<D$dI7hPJNNY)DD}?uDGAOCx40rt
zup<5i3Cs_G!6}3$9{f|x$qXkXHj)?l1loF)yg&){Rr!m}O;_F2`jwqE%n6@f5i*WQ
zj@BWw{F7piZKN%Pc8Lu%Fe;b($NH*n5Vn4n8^cu@PKKh89R`gZyo9bYzl6$nnM4#r
zBY+Ns>tZ2%Hc<G_Ad77SpLzj*zM`LolZ~|BM@*C#!wG)*p7Ylv*b3h?4{|xVsjUg=
z()s#$S5h6arpCBYMq(^|+Ur5=H{iTL%a*4V;tm;3RhQ6L!MGsMSo`?!gxwFDc5cXi
zUu5~<SCo-<N>eC{$!f5;VdmvsS;8VQ+<T*#-Hs^CQR44??xZ#fTcEC0BV<PZyn~D3
z;Jgc$@0Pp}OT1C~U%B}}#+b9{uiHhYFgLH%*~~+e)8|cqfJl>2lnlWgc``_+u0un7
zrce0$#Tf0JENss&olX}TmR*L-*O2Z8gfMM@b(<hLxO!tja8BcNQhdy3%QQp_$P5R#
zGD3v$j;#g523C9nG36nMCWyKSV1#%hoJ3HNxBAj7Ouz4nAV|7`uI0<O$b>OY5M3`f
z$F!K_<U2z~6)l8;Za9W{HBvuU`??*^(l6O`y3{4g_X`(7p%H8lO4=kHI-S~L|85iZ
zFE0nc|GwM_-7zs2jsWY{e4bJ(U2FtoVt$ImYYAY-BCw91A8vn$Ut15LRg2w0&Y-da
z9tL>8$6lv)@Ll9*FL|K$Hge+p!ZmQrvpj!@@PHqcKM1Cz&{_0~2pq9_0l)^2Tj$-k
zC!KSw7j@J+j!6w(Rwcb?gEhRb%Mpy;?*vEOpHJ$Mrz?dFk8Te!b{w3@_O@2{3S<8v
z<5-Nx;MKC6<v9}3Zt~49oOB3Do@${YGmGtd33g!VzQUDJ-chiEQM8$NrGR^kIeeZo
z%8SKliOYtuzJ)fLHFF)+A_VO#9KXH{G!B2xi|6V3qKoUU-BHHw-Or1;XQIpM`N2Z}
zC9qr<<6XY{N<#ditFU|zCT%hqmr8h<t0S92^&51<+G11C&KPm+tlh|iIGPt_1t>&?
zixu6g3`cB4iCVK!pOt#s+)N$_`oY~;CDx!8Oa+|-4*<(CV$lx-aCNb#7NycF%4oB^
zhN)ap`OC9PnXQIAGz59{cheb1DLLQ83lVfLQ=ScMtYfZY*a|8OAca}P4{nXnOH-;I
z0x}V5#t_WYprnqHO%q(E90J4jl%Nfq-TvtXQlC-hO(*7Ta|tNVV@=KAEQrKGzL3P6
zqGbC-L&zFRBp*|8R=}jMax?+Vt&(FaPDzY$B>dp=N}Mr$@T}Cu|B*_{CoBvA0-Gfs
z_C6I2%9Wgt%ch0@n41UK@=aS&=hDJ(lEZ3fXfH6sjynlfGQ9;J<%NEP2&Kb7_t{Ez
zU?v|%cJj4cfd#RodrF)x_i7qK>+lISRu3aWIU}AC*MwE|bH1G@8#o=`V)?N9;nI~t
zVOQklq&O^Q=x<u*nx|`}S3*#YS_qFo?oH{?#!x*XJ06W-q%ZwIbwinZy-(qmeeD8>
z7E@XRy#j{lHo!Yz*8r|FT|7*%X{{RMjcxr-N|AmO?;9{EW6KtVL@%G&!87ohf4wZe
z)!c4AkWK=beC2z_4e}-AEJp$-w3{U&==35fMe$dbM=d*9_F`;qgZv82*L}C2q+9LA
zai_QhNkAz}L(kox76#nvfcdA2DqV&r6uwOhv2o}=QeLqV+Ab71#jJEj+MQZ64&QxV
zif34dvJ?Z!AlWYW5U*f+85RQOqv2&;nRy#y%eH~`jQAFnA4G<QhAbeAeVenVjIb^$
zF_jecA+=#qK?2)Ek~lmZb^_9PBme~fjihS95SvMTutR}?KIPzRK~PSJf79x3`XGvK
z<F3<NvI*KP;Zae3mNkjllAx*tr|y6ZwI2!oTJlr{mN|a?*ig^8xh!scK(m~*FNP{W
zXdiBj;<TnjV(APa$TtIO#5k`RSVnp<WVExT7Owi8GMP}@h&+W@B_wujaOa3>fx7@p
zBQpbi!{0hdyoGewQn0iFHufu^GW!%T0FG!LS}ZBOzfT&;#iXCwVzX>!t3haq-K3hc
zMTK{?4)c)vVF_@v#+_1+F2a=3k1dd^$wox$JxGBCV#%)g%t6nnFpGr&5*67(QMkDM
zSe9)F6_*yirIkb&EJ?c}eh?RUb1ZckjInP-li9-<JJ}4uod`H%>LDm2!617+&#Cps
z9a4iGbe{Et2M0lUO{j3LED7B<$fYn^-~2hw<MUl%s?``n@az9=5JOdjTI&R<0wGyi
zSb`OD5-b7IMg5+*SK`CoPqOJS??V(RVe@c4JUi_1vXx@SSXft5?IB$-om15ZKYnct
zFI$_L;0`Jvf^{n}LSYLtfC3Gly=>DtPSFW0jTH6;^)Q$9MDA`iOmj0qR37^VJ`ZzX
zx8~$#(-~AwpX6qoL&BTk@6gpU{ya2mer-!>uo)j#!Zdwh1myD^c81*^g;z_%#i2zJ
z7&zY)Gzs!y!X;}%OlcF>7oZp*&I61WDj5u^sx;ycyDVuPjlXV30S|JH9bL*;##shd
zh1Q@Of}TMxFe`y|=jom{>Lp@Dj7jgc08wi8fU8eEOIrXV<hrrteDIGUfm*-;#=zkm
z_Y;P1sZE-R6CDbPUVOHPZ(0VAP;7A#e8g52!?JytQ*-J_Qp&B?G3~Xo<;psuUl(_Y
z#XPgo6e|yG`%nKP<1xP~=RFqLc-OGXuV|uU-s`@;IQo7WWVBt_Kv9JcMN@Jpni%^e
zT2efgB9oOg;TZG+EFtw+T6-#U3X@5S%kskGG^5}=4~k3FemAyb{+boZ-wtEtD2_AW
zo+2sRt3+%K1Em2KRsI)5+*cfb1MQG<Da1f9F0Z<CkVrqpR$^(GhZNKWf$Fu9bQsH`
zuB60uOu&%xDFGM+{AMoT)9LWDS<ZuWmewg>gPxYM2d8Hz=O^9v$?J<l@S<@Egn~;e
zk3syJ0mx)n5aBh4dpHO)yRJ<xV?;Xb1k^?l;L^eck_ghjaMB>9sE2`PE_}ml$8dB|
z&pC?Kh=8JZNMjB;h^^P)7peX03o07+3L#7Vn0<FXr58<|vIxAW3~UP0Zsf%#d*5Ph
z2Fd)c-Pn2Xi2H}u+3S-|EQcLO!zezo8L$y{xloG2)vYkdFrgf!#f%eOflLDWTp&He
zCvLBSPddx5hds#VvwR<ttHzm8*HG{5qT8}*S6OG1^ouD-)v?8FTGHIu4%T(S4wS+f
zxEpi{$6g5Hhs#eSln+!gHV;U+H3Hz(N4qgpTX0#%WR>wNknijW(DB3e4^fAvXe5v`
z2n2yg#T&o~iYn?^Lv~iv`*%JVG&`-<_vVT^=e4ltz|djoZNT{rSc<Ai&F{WgRG8H&
zgJ<C1@Ch4K;6>yt9nda+m((U8ETSCPIynUFy+24lMAu?9Ur=brjq>RhJsQ*_5C`bM
zp-uSY_;?Y9K=oq9*ub*Yg3s?g{2@@2UZjwcl7}ztDW~VYmN^7Wn_72C7xW#L(Dj7d
zyvRa=)!fGaMWrdqLM<|UC{-Fhfu&0?+i$iAB<i-9K8m|1HpCK)o4fKI9^4FVqhcKa
zy|F*XL=g}WC&P(@#Z@|F|MJxQqUW%0nx=vD>nzn(2^grwz!z`R!dnI+nJ6K|R*mdL
zYQ63zxoB(N$dIkgh^9q!RzD|m!E$uR^J{3O=yG`f#)dWK*!(t1<tE28Hb>rPfHJng
zwlw^F%A3Y@oXQ!1l^vJvAXMEl%3(b;atm39xS4F!EKLPCZ!_6zb<bLR2YauNT20wn
z;F-M6>}fKcnFj;wn_HjLbUf_U*^guXO{O+vBN#G|C|Hs1Nx&j2SFOYkgv9r`cH!8C
zC2(vC6RS07N~vE<`$EP|^xsRItTp{1I#l7TgXvW|951BwW#mn>+$+p~XQe#^+qmK8
zueQF5WI-qP8Q+roqqOAEKNKnn@8$)zz1SJxX+SmFpe1`xVT()es+SdaRZNb769$NC
zMoDMHsn*_`z4mcsy36mn)RtaotKRb^;Mk?N8GL?^xEsCIUQ}&j)E=^kFD{HDQhQ~?
zaxjerUf%R&R&6I=e53FgSi%gNswU}LVY?<aBm4j(RshvjuD9T*E6yh;Jta<hl;@LV
zJ(Is;iQdGBstLZnPDdGzEd64}^hwtC;`pM|I;i7U&-FL%CI5Tdi#qv3cjWKK_OcP2
zg5cD@On!j^v3ai^m#Y`@t?=%7`EpA#zzAikzFii?%lv|c{Xsv@nVLy_XqKoentf5$
z#o%!i&4I-*pZN9H#C`St<l^Yy_0h@xiop|c&f*frpd>3_LQNvM1^lL1>Sclt29OV5
zZaq(ik>e{{Vt#%2FlGb`FDQk7E^S}~KMg;WZBAB5E3Xc>jlfNjc;`FaXx?-en+Dt_
zl*b=co`3WH^=UX78TA#z$(9Bs-CK$5Vm1K7pCE{EL!>&WX9@-@&>8yWxGIDtG9$Z~
zlr58Kc7RaTUnk1_4q94bJpQktD_*7$U+TB7KcpB=3F~Id>5!cGjk4iV(8heSiH8+O
z5Q_)AaiJ&nRdfOkhT|bt(%^oew2F&H!=zG<mWHg!bbw~I?8|VrnfNQf&@d{$p94n=
z)fA+`z{_B>8O|^~<2s#w@+96=;%J)=CDnDp#m8-sYY7R5Dq@ugnRVhYvl<426cNpz
zk3AS@%kWurI_3QAjfS5y{|J2*#s6pNc$P&oobT73fd%yMXg^rmuVJWPqZq`$tuQ|6
zj=tUqC7(MT+?%hoQR&TFYO9jZ3b&G*z=}6hdB?+Fek*-r_{^R~*@sX=<V?e{!uI4y
zwPCSTO|qjd*}lR{s4^+Z#zCXZ4c_Z`#=x3wd`+@MDPN(yBA8FI<`Lf-p$kvbnJvNN
zT7btPxOa+%=@L(>m|*-s!{_(tT;)x()fsNUA~d%VNkqL8`zJ~Y+(kYtUePQuXT*&2
zZG3eVpGW!(%AWjlGr7!0`As7h&uy8*{W9;WPz{3>{R;IETUer7gjYO#s_lOf&2izj
zxa-1)J@h3$b*ID}J$K<&ut@gy#Y#+YJ%c#P$rhjJ_AX&ES4pfMzL8je(UB8wKcch?
zs!`cKY-4T$fTE>_N25qBS)o5vc8%gY{T2<>2D>Vm2Ur|qARfxq^#RU69J@zI6gELA
z#Qm^#MI#a!=6VG|$`FM&8~|)A2#shlM+~=IKvX!2n<6Ekzzl_N>FQ}v<jp3?>(QH5
z7^*Q^x5bqJgO*D3@sd8I(Cj!LZ(JI^pGv<~gp|YRp&r3}#At#RtwP(h1%3phr4b<r
z(V)QqkU}e}7+4AAf`hye;S@3BVnA_*E#>#5q?DAC!qQ?KWgI|QHT0s|QgoCuW$sE?
zQ7ps5xVq&9vyq3kSByQQievy^lNKD@q2tOorOP!)eOfCO!NY_oX6H)ECu|dn{8~4{
z>42ce`kZcurQ9?QPs16a=NKMMF{BL6LntO#3e8TKOi$3goXB#_RXN^jg_x?<;;B|C
zB=Qvya}{Ajh=qZ`>7bWH5<MLq+>Zkp!)Il)L&)zDc7mXUH-++Pvq@tCCd3k3EUG6i
z{QY(>B1E{fOyWv8nLZKkuxX<X;mA*+uwW*+AfW(ZgKI$96{h8qDv0(<A(+&6*p>te
z@Q^lMB}AN-g6#z;*=Ph1f?<wfV{y?D(DiTNejH*M@Xtod5XeJ{+*u*_G@8n`81U<N
z!TfYkb%rD+eS1{KJ4?m8h7Y;rgB2t2tE6XB1gcZf7w9=Fhwv+EW0^j4xKpV=nrpL7
z>6NOv>yo0P61_`7lyqTWdYn2{FQvhVa1v`vGEXocUDew`8M?>yJzd<2S<|-~Gv03u
zAs{VOvY*8c90?+uB|QcR5f?4i5D;h9`#9!cbDkL#bBa72YXHIHA@_=i9dTh`p1Ui)
zzl{Or7@{*xi!n^T6rl)#%6z<IP3*Wry111E?h_|KN!g2~`(r)~l5P`>qP;!#dt+dK
zBNJqWkcl!;B@<kmc~Q|N-03(!k4#mrTluXgn`pDUaVd0_bjW#qC1z^7cNmz3N0bD4
zP)>GQX-lzI{Ks3uGe=_hE_uyC;;K1zc-;s)h&3f-U_l6BsgO%@i8DmpA!DLE9BT)x
z+I5zufutHun*?D<Ym)V_D1=!oU{+XHCyC{=Q)AqYjIEBT`HFKE4#^#=DNqm#MqNfv
z;5bS9pCNkI9QgxE-zU-TBW*Aao(Bc;`#eM&pmvsk15gmZ^J)T|Y!+f-P)n5V=?`EN
z4*HFk2?F>902|~Kl|?%Ur`uj8vyYje><!9s*=6_wYN`}BD4#nd%T>G<O`O|a{K}Ff
zx^qgK3kn14#wx8-X#Ok*V&xNv=Zu7tpLEX-7*`f8ol$7wBw>+rKw;@Y$l?RT1{N4f
z;d3Wr;zD_oP+DO=k5B+M^g%?&WvN&3FUsdGX2|6h!_rd_KW82@tFu|my6~@sFU082
zCN?a5Q-#tN{lc7ri8=AJfv)dW``2$qqdrD%$K@thN6iAsG$P@EfwIA?c$dIF`K*!*
z8HDb~Ga>b7MLJt`<D*FhSgg+qP=X3<Gvu^H)jr_DAYfQ%$}Iu#pccasbDAfdHS4S#
zT%$!5b+T|zR8j|612n=4E6IqN&0H=e<P(TXex0GnWorishGIIJ!9}iTgyj!}%W}ym
zr<cb{A?P$Zf_*U4eVctT%QY=D)a|g}r0lWo*~M|UebDW+|5wWk$Kc0)DnACEg|)wJ
zt=Xs;%)P5~87Xsw8tg0tB-wO&8*B*Yl=J+X1O;v`<}WGSflUioP*sh|2_95K+Lk(U
zx&OLy1g%x1E`(mI>+Bkeclt#YnrmBYO*nJ;!2hKYTd19dE2SQ%b>Tue4D!vsM_SK|
z!YAy2o*#)10&S>~HAaAi0|rYkpA)csdHBt09cAI{;c!%px-_o6&PIht%mG7doUbiP
zaXP0wv0oUMfuS>P$vd_fnpWn8s1UA&kbrF2(2v8xtoj6)UF}V7!(H`H!J_@89ABvq
zPHRnL@hWOLxHA6oVY1Eo8*wjf8$fQ87N0EQ2B9H=dq=7PfEsg~x$>L9TBIR`f|d5k
zj>$uyzIO=&p3ait@K`V^RmBHX;aEg!uqK?3T*s72fC^37nL(>hw-WY3(Gk6IC1}C$
zLv|-~?YVlK)@EYVlWa1xg~tRGh$<N>pWJ%#bi1kRY~Y%i<syz*l!pnWjA#L#Zn>)9
zFituE!$Mwn;8Hg<4+r#{&SdMJZkGxv#gD58KZL*XZx5v~P<5r63Lz_-ajbHjZ^Ask
zF^f+aB{Xl@bPz3!X6bW6c*jhi#4-O2ESg;Kunm6PSpFf&Y3Y*)MuF)AKr}_NEk^RI
zA*3vqEh4Dtfm&RAM2HdeHUneW3M6!l$^e>a7wz#|d4Zw>G-u!(@^Tf-S6&s&v(|pA
zZA8ISvq4ntI{<tyH}E3f0Fb@Z3#aAWLk^~~4s)#wTj)8XlW;voc6W^ORPq(?F>sWm
z3Ra-^Y!VwAgS8*H>j)148jB!_GVL*&6|I^m%+^Ii7fO*_&CR1mB_-~Y4N>cpBD~}b
z2lENGWLTI!#>CygGt(b_9u`9*DQoXZ#D@k(+Z%-Ko@HNV#jY*wnhb2&Y+F;4v`gY9
zC~hBI8i5;+zkLl>%^rVz+yWt`gbS&b(pnf5yr)GXRw!e~w2J3Bm;coy2IMg8VKzTx
zq0*CGSS%Mz3qRH^oR)sZOWsu98_wfia>6s<zL<>#vOuHMkmXe~h$~$AOT%tAvVq}&
z)lOF+VliTNi-ro^i9gXyYM{&{lDw!>CU6u2@M-r%O60;8BHslUB^2zFSOnN5NtBR{
zD%4fTIk$`UrA3{|AnFt%ZS=9vh|}nYMcc1cQda3mzx0mu`Ptra=dg9AvxOECg=L^8
zT#tck7`R%#iU~-)*s#JWqlH*8sTufhuK|3*9DO6rc=tBD#ZX+%r^qlM;ay)|O?MAk
zx<{)TIhtX^`We-V&*Mu@c|SB=*8RdLHS!MjFV*?bV}LL*Y(%}T_Qa1`W1ZCtm)DI6
zjt_W={(YWJZvpgfUn*O(WVe3r|M&kT_&*~oUjr~Sn8n86gHXQ!cVc*?gVynnU5wf`
zmjQ!_6vXJ1x`+S1B%u*}*PE)bL&!)HNHVmwzdkxWImLiUKpV&MCFYP9DAS?eT+6|(
zA-A~PH(2|upFN$;;J}Gqn_s4vfNYBv+`d^7Y!`g*u0afQ2)z+_YnZN}+6Y?|Q*sxO
zOnEuK68I2q3ZYYZe&!LJoe!HU*F|2Ad4S`fS8Fes<ON<8z(+RFeFq|(ooB28ykwwS
zD8Usm(xPh=Ynv8yLb5MeZ;o%G#Ht+hvyT|c0!up|(>{>I3s<gd%r(FWsjS(uC*HJC
zz{w?JIwHYV4nDfMo93U7%4emFn@BadpWll;o6Z4Q2C7<uYrxt?gQs99WK#3xTE7%k
z#j7a^kdgOo!_ha*woWBTF_Cy0W>}y!^m7WHL7H<wRGw0&`%z^Py<)V^+~zBL-a|^~
zYYzf_4$bYT>uqc|Jwp)SFpc`6Xqdw<3J4dW1_bdD)ylZZm}vm)V9#jZAc*+@J5`(F
zvf5T4hM;aNBA^(yD~KgUHZs&@E@S@=K+YUTpd`${DT7%t4iOUY-pL`|5AJlBsq?_Z
z#}?dVySlb2zj!?#&4!?_GV3bBTuDO>pcG#^euQ!Dqah_un$^#~V4)E%0*v+~us-YS
z3U4_x<UQyU7N{;)ku|(x1j}>?D(-dqrHg-sGsAXfjO&&!x1Q6Z$qV=F^W@<}{7aY{
zOMQdEs}F@R>Z-nV5Mmb94Ly@+?T~6n<3<QCfvvEvAF*IEkp??(KY)j+olkEW9}!bf
z(Ks{~dxsYrSd6l4Qg`y6m1Aj5Ub>Z7ij5FVY43dRh=GlrSD$T6Hj^PL7{QJQ6M_;~
zBHM@y85W2NR$f|L1>AA1FBJO#UUNNFNDHWYk}V7LKqH28Nyz1qkytGuJ;DocGB-lw
zWuA{RU}8p)D)^G|LX}Y=k;9J~6v2qS^pr|lL<}DnNfb({9<@51?$OEKLAUdM@6>26
zzTYTb*K9#6@87nLy9ckkt#_yApynE3?L42QBZB+;KD%Z7K+3=4+3q7a6S%JhHIPFH
zT^gD>OD?z#lTF|#OTtNMNj!!qYhp%opE}qZjUev;!e|N-{xFU{D7m!)#dSUnCld<k
zquw`gZ7!Xwn*$GJVg!56MaaTA`lMrba!Vf+wmI;x!fW4VqY2p8gxgY7V%i6EJaD|6
zrne&^F{w!dg35eiYk>w@FcdX&m8{UwzM(7zs8yNMT~Hu|v<0Aaml-li^B$^TM$_sm
z8b70-UgHZ8E(ngEe)yC*6}@!Y=cf=64>z=b$zQGOrvWdPzK<DaXl$T1-g&J!HGnzE
z2HY5Sn0leCErn6Lo5>j#xgu#i<sryQ;~gUyIJnNZPPEjqHCFnR1i%pb@j!iP-@HLZ
z&9Jtsrmot@dqOr|FvZiB-J{wSxtEtE<8s$t<rdc6mR!!^zi##MsRRDG&cA*Yz4nP5
zFp4P{yN!F6>D$1x_~1RtDh-}9qKzmd)8MXyX*BVf<^p?xo#>w2H2J(>q-z{63U(8k
zCF~QMCZq@!-??TAf9hugFtH)8eYf}5?)$U$`MF`TuUm&FMo2rvmg?JEJ5Sc}k3Tnn
zrT#g2_gYCU<&~{OPg@ZWjbh&6&k>-a1*i^myM;GK`NpHi%jX(j=<>nQ8Ay1?!CH4A
z`T>Pj|ElAfP3bSUU9$0gm*8Dw?xa0jsz_AYiXUm`_@sMywD+b%BQmme7g7`kGlvP+
zp-cXAI(0byAM+7yJ;d@rR%6qeX)wcroC#v05)HteeVpU2rFf{THtT(C67f(VyUG{9
zAa0F&gPTXg!Ywu$3=AUXZhT&P7zT*rTlzTfJZ5d;&85_#!0?Ar6&R~h0vET(1hKkw
z;M96(RmE1L3Q$#dF$5|?kxlzYh{i3*RdAk~9&wq+hIyCau+4ef+NubcSuQ)kr`CRS
z!YOf*$E$$+aHgb{S0n^34v)FY!NLx|SLO-9LEriSQ&`(r`^q`c2$S?OpU!*$eNm(Y
z8z?#lGlYlRtBl+g+EAnZ+g54Vz;$QZaE+nXsdZLBkZM83C-BI4UTlCZ_D8tR;TV=%
zj<BRDg~Bm9Hr`Blh_Mb-8m+zqL}SKtJ*g;p8_+8>H_TT=D_O8eMqyw3*VVSR_BvJm
z8by80l8c$dZ_{v6cb8W`S^K6~1DA;rG;Z^`1M$adE4Csi{EYS3zpEjf=H1BF)~`l)
z@lEawd{pyN9JF|l_=ep~PR1Eq)LdWdhEvVcQSz@Z@VvdER|Z(qg9KZONt9wNUR6)o
zs6w}A#SsB_lBzlw1WGdAM{Ar1j>N2*0KL8H+Kzj-S;PUm#uPIUctdiq2C`H7nw)Mh
zP<6wt>lXjj+&sH4p0NKNFm#94L(}A|is$!c;f=z$<6tZ?0*%qC`>qvAaxi1Q20@^Y
z3#eQ39>mx*tb;|NRM{BeA#HR#8JwYN9!4&ux*<cHBT|N~+k+}_(D2aN$F@JCj0~{~
zU%%|GnoY-0s0Z0kvj$63Yd#@dOe_pEn*w$w{QR^54&6wgQ*fx<y%&Uyvayk`+$OeJ
z9XO@lf@mUp_cphdzXP&IMgZ=S>kll{C=h1Arby2~Ah$kL{tRQ2*ChoJ@x;NSx*F%=
zaLFL5a-|Fuxl3Mbyh<3uA5As8%wkZ&*9j`fr1-EQHGpsxy=F?{=yypC?f6qOvf6Hq
z^o&nS%ZPiz&8ll*#yrbMOlu&_8qp$(DDelZ4+L@W3D>I=FF~YZM61UC$E>CDb4DTC
z@0S`4itV0>Oz6YoNfrR9w^W@aWqUFvKBQ9}EWd8=2aISBm;!HZc(7T^fsG{7zkg{(
z=>!ylKsE8HVk7<=^cCLm(t8~neE}u(z|h=KqXCdt{B<|>YxE*T6^@ZLU~!$?%RPoD
z&G>u>Su4NZ0UIw4#;_{n!{Vx~@QDjIPSl=}r5b`3p$HW6jfG-1Pn`w*??SQLta(if
zh(_26^Cf#=f*z?bE*n);4`tu4LXaMgHM#?gR!4Y0V(^`m&~&VsO4)}vW(e44TBH+C
zD8@U(6LUC?UTd??j09(I(?`lftvw%fMNxH{p^#6-$%8mnS64~t$?0^O-b!#PSdYmc
zggP;lZl4DUUP}ImW>nG+uXN4Bhi`OuHv?<OHa5x)R3<nsz0RxCLolHCI*E;UV_fDT
zJZ3;zP=mIAqoJE~e;o<559j*OJcevS=*$~&X=UMcBWJl@MGT6qG(s_yM&Ogqc9mKX
zQVN`S%+3*(uT@i<+FIxIUQOVZ^d*#z6#l|O3%iCSLJV{6Zm6!9ZVF1K2A7qDn)c_{
z6S}E5AKIhLuha@d+@zc8&?`nMr){LzG5qV-nE^CLDP+Ta1XYihWon_CVcw9;XQy5+
zGEo~-W-;tqg}mc=f-6{dP*WhvwbdX)jvd!R7j6!+kcYgAKKmsw5l5O<3A3a@!IuMV
z&RZa%fQF(@MeITz%%(;|OBZZ@*_>24tBojM3_=Rvvn2Jrl6-LETYNp^xJxO(*2)lC
z04wU00R4c)cjZ*F*p~a-?(-Wk8j>_Bcm^~wth|)tf3?>#4b|zGwh#LcZnT1G5T?oH
z@CvT3)P>S#*ATI8Q+A=md_Eaw-VJRpW7dpI+@;b^%J<-E2CD7=t2ZGC@L~@|6+#_Z
z&#@KJm8yxb>K<Kvn1QGTJ_P)Ut84tOgW~tpbd##U4qUjJFWu`^*WJFzJ=)e!rnwti
z6fxZM`xS!LVtRPFK#}?C>$+VYIpnK=xlBeM)@$!$_Oi=lfzNuPOS$1)EXWUNdStAq
znJS^GK+?Un@i=NkPo+#Ae1a?|lN@o4#~S_2S>?b|SFkaT4QmK?aPA`&P^wZKL4;%J
zF}M@vPoU7!R+6}^_zD?=J<-TBnzmjacBxuP6Ns3~r;sjU`K=X7+NzW*YzW%ZFKqy*
zYlcD@Y_MI#aqTU|&Sr8lwTXDZ$jXSOkr~<IN+Ppi-xygcBSfu+Y9lFUlFo6U6$!F*
zeCx{sYs;a8o=enu&4mO5i3rISvwVWaIEWjXW+Dd>$PT;w!Am)0YbaPy)Xwmr^(AtX
zt&K(;<!rXiaQ@qke7r$&7QpBgTEkJNIyJOSf#^ogGsEeg93D1sfI6T|%>uT?5+y8M
z5aj?t8y4x0bgx^Et>e;GG7T?HP_o1%kI*y>AzH9Ucz~vKb|8%G#%OrbMo_d@!Wo7$
zTZ0i`9Vn!&<o9I3DR4)t9GtI<l?qD)08f^UaWNm<cK`CH4;0}^!LV$PMPIgOCLf{|
zA%*Zak3&_s#w#LWyx=-rWi*#O3NGyER<ClNvIq6|=y!?tNY*DiS?Z->BcWWDpI96y
z?%4rJrt>eu(GWP$D8Cx^5cG~mS_jmhkt2q|&_+~I<&DAuL`ss##&**W6KF0B){td-
zT@J%R0)?n4lDpJ})OSKX@E9sTLnE}{D>`V6VqmYbnOsALb<d{&&0+Yrm*{B(6OIVP
zS9-EWlwCdo9DfAM!uoK$1fK9|If$sgW57O^uyLNAC9g;-M5#8-9XaF?uOO}-ubrq^
zW_BG&t{V>wb1sGn;aDM7TKo9$#Qf1de_nlXwdgW6%CKqfx&ESU4%mBh(Lw!%`UCT8
zlQ9UY1Q=gcvvu0())}gGy9P%IFfqVc0T67Bk+rE$@q1*`ic49~AiOekaUR|ghjG4!
z&O$(BGST)vGoVNSfs8ZKAqgtf79xguFRJ4rnlLI1X_3mw=k1f@Mqr|2qC6Ysw5qXp
znh(r|HmcC-9<6&9i9msbP9<|E$&eR%NvdrThjI~!q1Wc^F~NrMzh+bsLj<LwBOUx6
zgYGat1UL&zj&iI@YvYhmKc=Gr23!g{nDA*qEPyQfVZ>uMCJt!vn!?5XJ^WD<!&lyz
zant{q3QmL$GfYhO;}FBw7K9{5F3OUXGF*FrjkE4&tiCeNop{e-|2j<G5Dn<H;RXOr
z&p|~Q&VU1OG%RlzLU(}CfTI+P#5YWajbUYI!{x8@S>&87fRzspnnUYT1}3G!EVK-K
z{qFj9FP2zbbTNo>C@xu1*e$Z;aQf>ZQLzY?eax_0Qk0rc3wm=ndqKcdjFevT1~35D
z95PvoGKnn+8jX-wGl)ryJKW5A{E$thcmmjg#2wSir=Z5I>W@Ta)vy)x+968;J8sNE
z7eRqydpx|c$P$0QWQmWM_7-qz{5|T3Q%sYc`PPX<R)EWC{wW(rAxBr|y6~ywyrl;h
z`V`d`>KShbf&&29jOP;yYf&7{S6}n#@Cp&tNEw^u7Q{%)4>q!843Rw}KcP|)$<i5u
zq;Q<yL8_2_EV%$=K%2jwpfJoBBf5ML;tZpl5X{SLHYuXO<mBdxvlgnFAvmTA!}P4o
zM^+1sICB=2^b(95`r2P$M2_71LDtWdp(7@$sxaf^&c|aEq$7=d&j9HnrGLX2ep9Ky
z4f#c2c9GyOj?IZQh2cDDFRO~+u)!O&s*_>pm8(W#*W3FJQ86TD4;U?ute%dF+(p2t
z%HNFyGyDL5l6G8^aGeZ!pEE9Uou$*!5aZWIBZLVLtgnp{_ro8njIzHk?zSW#;<b$C
zNZ1i7#(^e%bNfej<g5Ksi@gxPD@?$<{Sg%qf&4K=d<y?2&n1^{fT%hzH=*RPH@9XN
z_h=>H!Cz0z(LAPlWWF~N`>rsq&#otE%Zs%92X8Qq!rNk0>%S@f@GXw4(jT|)u%c>b
zI3JhF7rF0Ojw!)=D=#Q12*_m-QAE4G9OnBBx?tM*xBSu{Mofi_5)x>RQJu0<o&0+#
zgAroTnB%`g6%2|~^fO8+z(pv)r)zlQspGE)R2HT0rzJ+G&(~t@Ol}wN*2^zv>2NH!
zUff?=nzKeoIoBz*fS{#rfmPe%A}{@zV0U@dodfjhrx<B0t5Wkdx*PI)QP#rYtgO4q
zihQMx#uDSA`XygaB7aBn_#;W9k}Osw3ALoZKsM>Zi$+VoUd6Xix=<#x_!B{$w?&<L
z32e@lct~mh)<lvlTvrMUfxBL8NQ?u*k}#Pp#>}ZeSu%SfXhfiL8CA6mKPgB>8mP#I
zZI++z=Qran!E<@3UWY>#A@$fL0h%ghTNn=f7G9tPaVoWQ);ef+-kls=9JRWw9~?GG
z_o#jReRu!u-tn92pgQx>?{_X<mz%gaUG%y(&p|TLLL^ZzV+5$?f|{qCqpseUe{?jy
zsRzmlQ5}Fb3Z$St1MDbun1deRW*pr_Fe;;1Co3S6meC29Ahg7AQq_VUWstwmKFo04
zK)D>{R|r<liM(8wgWWE&5)P~0nwQ|cX?B%P`{=Y3hkQz4c(;^ZSj;as2yEAG&XfR`
zw4d@a!-v^00|5I2Y6DhZ*u5GJtwZ5pXU)|Dx=&?dqKx+?F^2}Phg!AQ^h6ZyaRnE(
zz+GsAm~~UD(G+vTus;utde=q&22`@SIBlK%(C)Mjx}6_Q`|rG%ZG;ft&#$lNW5fgM
z+?uIh_v<xa7#E$FcN@|s2KFN?48wc6Q0jv2@3hbUZ5ZF?->hZGvC>Y)IaLB(2o)5D
z*VksGW`HAXeKMbg$RJYd0@+^ZEhfWTfXcSl`=lxPjN}6=SQy$Wa5a*#lvKTmAdk?c
zX^%7^;|#B^5V=jo3S@#l2(EZ6e+G{-((Z)K5z-9Xmqcx^iUDBYh(;XBh8=V)wcMk;
zO*+%drCfQ<><eZMud}hG<1`AhU=y>i+4A)Bou|(@vsmYTV6tzR6zxs5I-6JJL#&$A
zi>+$PC%n%pZ1#;a9lAm+;ZAmd-%5Avijlu=WM=<4<%0kSIt17`nPwZ5B?x>Ap^`Q@
z)tG?BXStR@#LfuYv5ugh`}EvddJ{qAGyNvLYwMZS`=DyJnkSm(Nl2@Mhrc4Tdg%td
zcag>mmw#aeRS#%|BsYen%&#Y)E2psqlrk%vgA^<#fK^;D5&%B6cX9p}-?3F+Ea;t&
z23_)v5I&Z+2nz@*<BdRhGr0U{^Q5#}(NyKzz#y06-0bffN>%1GWoX?L*IX))n63@;
z05~`cL06dduu-k+U@e-mvHC=6zLryn)1<ahgKi%&zfg1*A+pWQO`(O)X%{D%PWWyl
z`lGrDOby;IW|BqhR|2zuUn#?ibNXmF=4;35_no++jtp+4w_i;W2=SUsF3oyRZ-qzO
z<Z40TL2D}u8E&UY#6vmR15uM^h6?=%D_nuLiXHg{Qp_?T+0@fXQ`!Eh6rOjmOxI@i
z=6UlMc$#P@Fy!GwBCZ60W8NCO!^vMm*@|E0P_^Qlf@)WAdae1f(S$#q>!HAANO4oX
z<n8WyZ8vM{+-|MO?{Q1|dGjYe%!6^1f$F0BR@Thysab=DBL#$kL)Kg3gH7anr4}vf
zDDd}2$iK{Y&;JfQCizD&8M9WOyCWz$0jPx&j8z+PIR(sY<;-ab6a4SRR`$&3D^O+4
z#ClCW`Ec|<H-$Z{+c{g**-Cz+I0q5{*r4vtL|kN+BICjJOlW>+NxsMZs$%gk;A<)i
zuaQn5a7-7CrXvqi^J=^kA9TC?o%=gf1K&;5$@PwZd7S?$<MeY$^|LGsz)V(nsz%N2
zc=z=0JfO*)Pv|+6HAuK>bj%<SfH70d1+aAMmz-uygPRV>Ys#=1M$*Q}d4XNTQlS`9
zVk;ptjOMT?=3KY7Mo6LG8F{H@Ny`H^5&c4&F;ta|QwnBTkG@Ry!4Pz3*tY;i`de2$
z<Z6^(VwGSp88|)=6b$ZX44dgi=u_ww$d6_<1p-^D<J`kEZV9tb%`#k1NMA&#y|kb0
za&P96d!IS5UfVAeli>QF%H~Fn`r4q6>?7G}1f#WZ9%wssX<H81nqHQ&jS{tWk3!TT
z7}&vTRuWLtA1dm6(`;^=SsV1%AQ>p^n#~<PA~plzS}Ljn%rDH&%>*z1V><er6^OBF
zae1+D^p-!idz=f*VBw5b%LK&W%#xpv*B5E0(k+Iy4iU$VOg&AhGiv)}z}#)$I5YLt
zL3crL-wr|9tQxGf7lA&XAPS8a5o>Rjf|5(tt@6%#IP(FUSLGsco9xw3`!>jv!D&zy
z<Mn<|NP^yC`ui-GA{BXn9I6)8aAxj+i;bv7H!jn%3C1ga14<54bqNeny#nj9L@TFb
zg0g`nzbEk}k#%;Yi_zgX<x$I%0<NpD<8Nh^N&_N9ST`(MqZ^*pa17aQ!yZzqVEEG>
z=Pr>6!X*H@iONtA95@0AbJ>Z=*0^jS(>p_t!+DGz0$zXN95e?bGo81OFIu~jt>n|V
z3#`MQC^tdkc{W`$hvxb?Yf&<yX^0wu#Uxq;eQZ7pc=NCj11O*S;M3;f3>X#~XU)uj
z1GZfLD1hqpGj~V>KR!9{b}mj&PtML;2X+wzC{ozrd~D7Z!0h&UYEWGr3KUUk_UH#?
zAmH^=*~|f|F;MZrY$P<J#$k`c$=NQ$KXEx}k^(g%L158vpqVAQ+{GdjLY+R-tvDa9
zne($ByGMHn8u8A;cym?@7G#C2DzM%lS<^7V)IZeH^l?6;YRG^snhgf#A}Z9~wTD%g
z+;7&T?Xl2+jX)5w#g6B!1l$BV7?Kc2zCLqZHO>AJq!qq`Cm3s<!-T>mlZ$Z?z`J4-
z*d#!Gaf=qSoQLFVAq?f`>gh?rFfiZd6KCvS^SWQ-#_T2MITW1u@#vmK(=1U{vK9X3
zxYu^@lQ4y3C-}h~^W<^xlXsAkC&90lmXfEg_>hq^Pf12N3q^zq6~+;)XHH$8P?Qxi
z2BoG<B;C}k&rgqcJ~)dBwxM#t_;f*3y0*36FL%gqw22`2<ix22f$+%^GX11;!ko2k
zJ;Kyn**ai7SY&83IZCah&8~Zbm(LB8(#@p_>`{gIYdHrsA{E=D!=M=Ox+d(Vs_l&x
zipbV#<+n?88chtRA-7T3R4AsEm0?jP#;7nV>W_g&#21`A*0D$fQaQTxS{O*6smIx$
zy;sDW7$j?q*;1nkP0aB6yGFAHs8z1OSfp|DWC<oR8sfk>^oumKx>Sz)rr7<aXl$B}
z^(33#$yf&T6dlBAW#2%w7O}7%s(Xzv3L;qi+IKboclPvpD_k>5VDoWhm}eW+#uC*x
zNzx>_*&+~g*;8?61~@5(rmv=ab&T1LfgV?WS}dAD6>*g7FfDNC9d^_J&2Tag0Xagi
z(t#_jbhy_(I{Be>)@>hmPtQ)?7&hD~!+60}?pX=QL_peet?3bgzogQBEi8i@rHS9s
zQ`meEK!*+A7bENn@o=?^v9LniAKLT4KSC@#I9zNjiT$=p!k}9VtrNH#Hx`Xpp+AJ~
zUU9SO`$(32iO*4&=pt7XUtcc+Tr+|h6*5Ff4p=_Qu3{)zarX~xX|X~KDUPV&LSgeN
zsx_v!rp-<Nlx35^jB6xkM3~iFy<#g?S*~SU<t}qU#H1nC9y)2J*4*Cq;>*On%Up@<
zzU%gyA#0glO1yQcu_oaJD*at+=h>Ipl;bt{(ht`%3>abg&dZ9hchziasDNj*maLT`
zlQG&Qa(IV*@juAN1-`g8&Dr%Em4^A|;Fok$zj*_=&m;Zy*W^BTVE)RlQ|+5RctG#3
zf=jk4T(gp>Bo+hf1te<6!Spsuzifurk(BirqV6>xXI~~{JF}WilObnDl;xz_^oO#}
zn}409T)tY1Ijk7-adP!n@SU(BM!zkx?7E<-7##vD65o=K%qZrUqjc=mL5mD#*!TT%
zh<nQQyHSdRYo`?A=@)(WOGd>ITRkZzdV9obQ(4hO{u|OrOfvG{U0PW>{&Go(Brwxa
zU0qnK!I{<$m3bowk=P{xupB3`uoBlQBaVWQ5+VW^>8^5)7f`mBrY$)^R*I-SzRYom
zA#t|gKECCOH`<}D!pq&E@pyTZO^Y^KYyPDXTwuNwN){80u?ixUmnK-%IxE<%iIuQY
zVk6CXC<Im{0ZL(@WZ!f@8y4ltob5p%B2qo%z6T5>iW;;GtwGN0@R~v@xwIj~UQTs8
zUf3lgYe5PG@3Q&Qm4vn>&!w=jkJAmT3jp9<V4>CdMDik`3)g3EV+3_0KyQBJjr_(g
zOpN(@N&N5Owt^m}-$68yU;pBMBu~HjQIO#OHeEyLIQ7lA^bJ7jn}6$Ti^?eVH+USY
zTt_%Cvn3I>^Kkpa^BBi7PdBlL<v`c*h8;gEUCD55n^S{bEYM)1nHHEECv?FS7)?r#
zOW^v(bwtnYP(AKi(+n)kv*)fmVuvu~NyG}&);`#2R?_Ih?db3pR<e&SM?6eA7BjpP
zL)4QH)2}Fg9$N_o@aZ#U3bv*KK{sP{{7a@5`K(KMrIi<|iKMe2TDrP{_|h(FFE;xF
z%Ofmij$=8y6rC(A@e(qJXIOi;3O#|_qTuR!Fo#OWL(EnPMR1kGyrSM>-!;nF9HXDS
z`;s*^&uSsY3907?x0%b&VgHNu3|?omlwC=h&k`fH@uNCbg)qf{gks_7J#bOzmM*1c
z4H$GBrjuE24)Pc-hE=$8{5LI}5)$O%54GcV6yqV$bvn50x^<t_U6FNFx#AvAHR|Gl
z8oHSnai}Ug_$r{{vrTSCbY?8NDNW%D@FJrLu7Ms*UzZ4id|4LYCZwe^y%fH6J?Cj5
z#01sabHi7VOwyFMs?HQoaT}MJQIimrMJ!{1QwMjsQasx@KB0Jc$U8B5^kWZ`q4YGM
zX_z~s*8FoL3_e~iq{ZA&^RX|31T`)}uVVMxWtLbk7|6E_n;M?omE>2uh$ZngoN(*x
z49aeV?t_7=@hC*v1Y9s2pCT1Mo2ax*@uH0vA*tEbDaCDj(=RD&D{qPQluGb{JwwAt
z`f-g8C7mH!DHu&79L~L}{a8&KnO2@4uY#}j7Y?T&*$R%87d|2P5^5NiT*_uW0q%S`
z8W!kxcLuH?K+09>3*vni<_K_Z9p(u%jQ~8gMWBh+Ae4Z!^so%C6x@C4eitJwL>YR8
z%J8g{w-jdGca@0~tTxSsUn${)uOoEKq@Hzw!z?;Sdp`ic$?-{Ya@<0IU$Fk62~a_o
zR%QxW8@I~JJ2owO2061ln13B&e8f>qNgIQhL1vUg9jvo!vzTI=44`zDb%I@VFhr|d
z>cggCn~IQ2Ng6@1i2KWnMZ~4+mhV}|<X#$s4**?~ffnWfz$e6m4)Tq-d>9BnR=ITr
zy@l-(hY{dauJd}At>&dLT~)4y*jJ8YXHr&yN!dooc(y$sstKYgaQt)zoNLpC6!1^e
z>^e0^Knq6G><UDxsUH;MVe+1ym~~@ke*k|MHC6k3AwaM(Z(xqeLPx}sB-gXneyjaM
zs|y>dZRmQtao|94EK>BsGekizXqosZD5spyQnD9N&KFo3dnz#0upMtfN<ppSL_!fE
zn4*NT64_#mST_JOk28ZaE<I{@#zxWIflA9OsHv4EvfMQj+UF=CFdxGmeUr1z8f*8V
z-@gf7-n=m9-VFbtqbj}Jbpb4P`&D~bYp~Rr&cSmz6KS6WI{muC7BK3!IoY2<V}M9g
z08GUU56_TZvw?((m3pb63FO{D@>Naa-7@qq1_xwQ8zt1IfPx#qDk;2XE{*hB(ksks
zV!U~{rg3eN^jYFE51}{;IRUliw}kMu?BUba*}D}VhFC>!_G-$_oj-?&Vyn0=TU;4a
zWHey6o`?qZ25U{A`nd11{L6yMlFQxtr7I+Krtl!W%D{e1;O1t$Dpq{Np;Y4rR>{gb
zt>c64+r8t1&fC53ecf=CbL_t!h~=105(#eyU2YgHvZpOPaMq$mLP(b=etHbXyZ@{a
zd7@JR{`f7}Sjx!2Yy^7YNpq{Y6+9*B9OX)Ur9pu_7c=?ckf4nZp`i-iC>wlmMD}?~
zktlameh*#=U5!4#N%crzLH#%VQILPTya&(2_DdruT|72#rpb9SnAL^-MckiDuA!1i
zi3CSPya4UU1yj-SGKwJJ0^9H`I8d1W7X(pJ3nMh>Ao3b$S~i2<BhLRU(F;6WNh?%T
zT8dtF;n{N81MJRjQRJ0ijipd4zc3pWUClP22BrIDl`iGEaz9I6EWZRnfarjoO^K3#
z?E=&s{J)NaSwb-^sz~BlME-_P&F<C)G+JwNr_o3f;gS5zA4_<{$?qe(_Gyy#`xp%6
z)18J`$6t&Ha+6{ZEC?aTd*`0O(fKr-xOBbYWJ6jV`dLEQ>xR(RhIxsS@scnYqMD3{
zlaTX$?Jl}u)|yp)MYr_Mo7Tq2N`3#BWd(a;9Xo88rJhjXSisL$3#-={ioLoJ1M{zq
zVs<;qJUDN^+OMAo=~_bL$<A&NuaJD+L1J=N$0D(Q+T?|JK$G^ttEwTY*dx>xsEn;Q
zJFvS(Lhx78AQo(B4f?1xYgs-pfAT-jRI+myo#U>m7u@@y>QzxHbX8r%H3`i0e)%H2
zvwC=PW<#t(?FnTgU#I=Lv3`x-6zs<xOS-ENL7av8uP%rAyT$82UdWAY$O58K+hjSb
zfARc|opWROJv#@ijgB}PXi)Jnqe#cMO|pWs$B%SQtA#S((VU}VhE+=A3Ungor8?M`
zdXNjyOGk|)v~4RF(F(9{6~kn+yH6p@C}>4$X`lYV3`QE%?4^9i-gTJ!d#8I<TqY(M
zd_C#P`2R_`UqiTV3;v!&tEpiD*(w@=H+~0ExDNlDkp+k%|ILU&lLHLzs|ew1jXbBN
z_`oV~0vn>Y$-x0+!A2`}>W9+Y<5gdpfySkYLQDdP2T&pK>r@2|0n4fY6jf=jtIUf6
z)&bxy_}haOXcD+VdD2pD6M}f91q-`?VfHh?fu7yzjJS38pfv`peJsn^YZ9haDHWnZ
z4I?lwudr^x5cH+&ol>NBdTGwlA?L~XjX<!gWayZ!xhhw;S)`4vNTOCe!pW}0z}kaE
z%0{}l74)ZgAqrKUEZNEX%Z9hy)fnPY?6Qyk+6)?!IXO;Y3E!yEOKwiySTNMxO#Yi#
zG_?0AO>w#FQhU6C!d4<$i7kg^^&5CuN<Fb<Gc7N|+-gYNopMch*=-jQ41=FrxX#JQ
z2v2|jVi7doo0Y|YjUe#J)`RovGyu{89+9l~5dbP76M^y@B$rJ^q2GKQ_C8887~^HQ
zA|NZG_qu<TQ4!A=Y27^st$G2iZQ$2mllT)ZBD`cm2e4H+=;TpfmS7O@hC`njn6>$t
zqGNC<5~&sPh&ZPFZ+;ww_J|J=b|r|O(#M;x5bydR9GKoTo%KEv8KGt6Dwn`lVri2U
z++rNB0{cgiD)tg`pasLitL_Ief)pJtsA>)m2I*xuvvF`d6$~iP!9Jv1an*ZkW1$+}
zsgz{`2O}b_(CN2w2uFsvqt&z(1fAbFAIR9|V~j+hk|W}%_jCOta5aAH+G5&V7JaY)
zi<V_9$vuF`3BIdKEXTXYeh*45k?2<<)m9Eq<xhMyY^^&i;W2WDhr`jRa)F~wix;wM
ztK4Gd0c9Ovv<a~_$~3T&6GTEnXaa>alH51GRpG;%VX~t&gF?Q7JxAawp8}q4e+bpb
zEnW-e$5XHeHa<4eLrNG`<K8rb6kz1TgUnThRRfpss?<qikpN}PBh070Y~h?`vbH6V
zxT8_E81#aIa0*aT*lO=10pYvWooFF@a~R^3XsqfJ2`*jA$3w9;mg$5)#`Cb!sSUys
zBrAc)=&!()ym-H*fkkH-SI?k;Hdv9((n*aVzSiJT0&RQt6>zVm@mNW${pch_e({Z#
zCDCbd0hVgJr8<*l<QS}D&JD*$x$;fmEkLM7dvG*PhS7=+R6#kvSOX>LNQmObMrj2E
zMnQ_@>^yxIG26pfHooa^elzMrsf1dyZeD5xXu(aa7X=Q_hPmk{Ll}y`5`9<hNBTSI
z?w_^x&VM~IIt!QjY5jHosJZp*$&-jbr>|<m_#mM;n^Bfcyuv7cN-XxjIw71)$k&U(
zR(3b&G~%YLTE^#V>B9}JviQR<rtSWGQZLt_sIDzxmZ2PUD7hD2SSD0qz=}33KO+^E
z5Wp*A>wtB@seNr;J56t~z^*rSNcI9XHH=5c&<$t<z)pU`*iEe7d(=Aq5YBL6IQD*u
z;dGQW5yThj5YD8IG0;9y_`BAWpiXcT3j8Avu_<Xw@<n5XSkEO&?)ll?apzFN+~buu
zpwPFg6%u_0Wi<;vTnYcp)zZubu)@R3u)=+G_u$-8ZIr&PgAxrdj!)N*!VWZXP2=|+
z!a8=bLOGVo=Hz7A)>f_rv*hTysZ<};*w$7TQVI4z8CiDWkkjGxJhqK6YB<gbJ8T+K
z@Mjh?$csn&D8T(CYh~F!sgH#@5)dfEVwtjoK<vIn#;qcXiYS-wh_>+XpC5J1WOvm!
z9Sr2ItL?|%I1oMFSJRiIKIX+N_zGi;N*CyH>%4o|KI@!!U$>7Bx_bu)XQjwv#|)R+
zikweX0<o7#D5ZGx`1~~2a_6$**(Fy^Q8GNU+KH32obYQo&1xsYEZ6fgU5n^haeqq{
zY+F-a#(na=m%XBp^2Q2Y7SmYb`3($+YE!5PTT($CVO&QJ`F)7shiI9M!{>p;4k`Yp
zi8k>C<ue)*5KI_#m<a<t>@PfMD{lRgZKsvm1A7n(4_N&#E>ei41jSXnlsBwKU{mz|
zUhAP)1`ZY^mUEs?g#YXn=D)M0=6t!nd9C7$zU=N9^zXm)rPWm{i<K*!Ex4%ebgSLz
zW?Suc`z?B^(2`h$CrLAScC&clYxy_}PE`|tABZMInl~+Ol#*GbwR|f0vr_TLQ@#XV
z(;{mVaBlP#^bYrSf)V|k;Klf*VY)LX=9TU5f_hozaWWuh9{44j=3!@GH*q2KLoB5S
z;coCNS}9Njz)QIL_z(~zFPN^#vhr#03a%_TcdI+IJ=y2CQt0anxlfTw=4hj77i~9p
zwtk12%EEK~m81X9@W$LKMUmWhyAVFS?d-p7^qyuLHi?pR#UN!0iwWgkO8WkkAi^mf
znKWH%E$0NQnhjhOTX*r1qMXux4RcE3!lbkJ$YrQ4D+tpg$&g$-Q^_%_h+RsbDDB2Q
ze}SZY(JX`-Kw}x?nFG3kHOg}^44fhxH4<JOrZGt^#k>OuN|o4eds4=j#>!v~VaPp9
zOH%fE#3D48p7U>D{eE0SDx+^gyM9&2Yn=i2TVN^O8;!8ed)B9y#AwR@BL18qw7=A<
zfih)yjywyeSts0iHD=7ga%r%1zvpU%RHhJo6j<O}D01qvs1etyJkWSI<b^{C&6O!|
z2SS<>0fM|4a7r+1HKiT{g7(*&UFpL~Y)?2Ao`T?I2^eZ5&#${?q|>aM_J4Lg%uY_;
zb>Qp0{?By;-?GNxI~b_X0kH#&?H>)(r!wk{86;B%++%V@jBbNw2osI7D-rACR)OX*
zy38VTIvvF7dqfbu%%olud|}`4jcJZ{V3?o<#7Y4mpY1n6I0+@VX_G(Vv!v7XIx{~P
z7`}mSJ&lnhU`_$REu0m1G%K#DCGcCCk-{VN#08A<-EEPL2K9!=$aOi>X>KGZTG-!N
z&Qw*m?w*~Puc@Z#!Ky_~T`TZ5zihbodujO&<xTHUt@RF9cI&`hdVilHui=_R3%wqk
zygy#nh+dDoNCMHDbHDQ5`~z=Ft`vo5S5q`JGqZ@%7MdVcc)r6K5P9@=ycieue$*;e
z>59^qpcn9QETI<wyY2hT{z+usp@YibQ+>Z;39Dw}aCp?s`g<-^QJ6dt)7_PSwCu7(
zVp)w(uXZWDCld~5ZxsT{;o)#JJ!~{BN45`SLF*KJn1a{dC}+c&R3B303h1IiAOKjo
z8i}joiggOo!Uq<t#t?MnaMY-zE%WA33MBV6x|W16g&2xb|Ct+*b_`Q$?FMF;cNd*=
zWe6jY?k3~PF!WyKE-C`W`YlH6CM08DL$>!l1N~2j*Vn?823YkRvZRYmBWPyH8#AT(
zB^R^$)3=Xzwj6nW91doR4%+>?+kZvzkU}qrXe4!^VogcOyBaEzfccZ4{_~)u;#+(^
zpztg@5L~f_Etq3PHaCb61+rR{D{>p$bLrgr5EgBu-Ly~&y@rRZ66%&*Vt^f^YCE{a
zamcs60H(_hmu(?XO<sn~<k@K%q2!z-!)sT@637t5<G!nstua?G=QFPzPNk#J@MNdy
zr9a}BLEY8Sd>*i-jn^tnYrT)5en5Majry0mF2e7S{7(>+E<--VVQa{mtRDtL-OPqT
zJ(sBjK61H5!%Rf)m(ep35qsidio^@%<MKWToE)|UGW8IWAyZ4^wksT&QTueL3fg$N
z0U=u80sU}AT^WFZjIW>Ts5xD9J6v(3$8p}J7rVqsDm(|WsAm~45U@wn%<!Oag%1jP
z0UAJSzAQan0K7C5ei|JJv}wn%6%mL3CrJAwh1@~duP#_FS;`oW2_eY5?EU$aAWAr1
z)&*7GPz5iBK}?k$0e+8{9amZH@U4~Y%vic7hliC_$z!%>tbOIYIWCpk7Uzp#j@@&7
zfg}YFdGIE^jf%#Vl9neZ|5MJ5DpS^y7I&tvre;MBZIp4)jWz;NHQaq?vk(X;cYz8w
zyUk`zcYWMmX61rH%1)uIAQa(l`i7@nyAi1XEort=(MP@_`gs_c?swp6Q|Bd{v0}T)
zG(~Vvb8jfvt-ye6&oJAVw^?qbDt^P_lf4fvGxF&4ZhNCFiV3B(hUIaD)pq4DvS)Q2
z89q@x8Gb;&l|Ik;z^1~JdbQqD2Ux)RIN%l|L&;>?8_g*?7Q&BH4-x?J-sZC$Dn4Pt
zfh?~X)nIrv2P`yKYf4lBF<Iwcp!^tug(IuX-3uf2ig)+>Ae-JYiXCP5n+wNGW5FD}
z_|3(MutBN=l%F~2O18sSjD%ds&??#zp^GJh;c6@bFAMbWh+#Iaq4GKILhbmZmeh=N
zTT7^vrnZ8}mU#MMC<G~)*TQZT9-@X|yuw`x*jK%cS6D)M`@_bo$!yxJjq_SV17*b?
z-jRp%aaL=TQppw_D_WnZ&8D2BFJ;AEnu~Hq3LON-b+F!c-IcCx_QH1;L}Hj5qLs*X
zUPnAkDW`?9C17%eVS0E%vHuDrfzpp0d>cC3FnU#4>SfK$$__^9RgpYM_K(_dap6I(
zf*YgslvLISjxWbhTPHE$X%l*JGM!7YO|F&Y&u-m=LLPt4p?q#KFo*4<=%(DNk>}0r
zHJWq&$*>3;;)Mt?yTgN()b^!Lv#Ntff{>b&bX&>}EGO@H%UQq5W=CeJ56y<2TtYU`
z$rSsCt{oLOlLv&?M3z8+@a&#^-)Ka;vR~TVFI5;@R)03*{J#n}-y(c5v`=9szB_T{
zTO>HJ{#c!Ks$D}bJqMwD;uoCdcQ;(17Q^nTYF}VMS|Qgw#99lM%cUx<*w$uptRoC;
zctJUPl<BS0FU*!pChEhJ?~}b!-!L`1Pb=h1*Jv`B77)f+$CJw7LpK12a*Xq2GR-~@
z^Lb%mfD}Hj8&0Y+RSdIL=XSkRuD7C|i*gzVygmtJkgw&qODKuF?sw$4E5$&Td2*B=
z(<TT>06lz60qrmUWHmETOoch_LO9K5C|aw_U<$-3E7mOZxZ8O>sk@zIEGIOQ_6gTF
z9eK@7vym7_J;UQVrx|8xfikig3KXv48c|BQGlQs<1DAL_)O9p0W^K~*o_k*&gOIpB
zQk0Cnu3ulG`9>wqjIHkB%n*9H_ombI_9z>hW!EJg<!1=n-+w&^8V7lchFfbsi#!Sp
z9sUm+Sjsgj7fa%ynqf%;2bt-`Y&?#p;ZOK1yBV6L^o(oG2cw~SjPhLSqp@ic*C_ik
ztHUFunk%v)q|TeC#~ZJ(%&N~UFo<I~`3WL-+owi%Jj3LJCcg+0oFqAKykcAy^IfDk
z%zgVp3=2}?j!&~}dT!4$HH$e0!-*8~7)~05k;OSIQEn(4=XvQ@J?`Pe|NXbpsCfvm
zeO53>v4_>@lVhW{w;C1wEg>-d2of33+YpaktLmpUt?Bi*&@SBwhT!4`kV=hG3X~d3
zkw|XwGJA%og>KbMnYgKKiIpu$n_PPdpJ6LSP}(rEh)<WFQf#qS{iIv!3cs9wqv}`(
z3v3A{8Zj5jHhRi68!D-4&&Dxx(b66Zj10~<7#ahQ#BR{(7<8lOu?({CZMGJL4X}W6
zr#9NhZz`HG`>|R}5=9xd1Jd7}#?m^d7)sWUx6{uCsS!5Ax8~zd<NRhEf9JQziCJ*!
zLzszWG?;wnOC7e9bF!P*nuWjFP(SpET0ot>{qJ=$ixPvKBhTntPOz}$!`J27&-%7J
zXxl0qktF}XU(B6;1osJ)zezH4a(lC)BB*fO-|KzygY!kA2;&D;z13c<jIY&We|;&6
zEL&g?PtNvRA&$yjgao^j4*YTXqh=4Po>F_>v-_$oa#kgOnf#w6a}g5Qh<?OOxWBjm
z7D9o|>uiOMKacN#xfJn2U2WOn^<;$pNDCEIs$iJu3R*US2XxYV9KUug*s!IN?c&sQ
z2p4`;KMY8pk=p{5TwTlED-ni*FPaZPg@H_ZXFVL`U_`^9x^?RdA<A6jBDuWPUj2qw
za~Jzo=j&dqAiV;uS8;$)<jQLo-G`*bK{HU;#D<OPk<laM`p(eLozf4Sx(h}+JZa`6
zn{BwplgMY4$0m+Z!_~m2UMuEC?;H04VgF-V@E-QfH9|!tRqqmw4<<#d2IUq~m1pRi
zc3nK8AJ%C2$SyasET%=Zs2uEh@@dE+3pAa3gwp`F`T{DTn^_e^k>smDum=X%LMxLh
z)wEe2O1!RGBk{b+La~Lb?#bXQ>wbQOB^AJDnhifktMJ9sbySpPS<#AR>+lLQb5tf7
z|A>e-wkQ@4VVM}`#U4dn$`$I;*h;0~`^R(~wJR<Xh~Z=GfpF=Vl*7X(pyxYVeLOQc
zR0MdoR<H}(VTgeJnQxzB*ZOEOyZN>(E#-i_Tkb#RaD*;V!YnwIMEx#J(Pdab)VmlV
zCxR#jT#L@2`Mm@w0f6sw;GKo_kI9?n`kl;Yg?~ru5Hmz5st1Aqj@S&?rJhC~<4(Ha
z<DpcMQh7<rjgHG4E@-W6Eq-@#blz^r`kuSBu!=5dE-f_P@NFl>w#+{ZNEFP*E-PCe
z>0aK>M6>7b%^W7V`f3V95+R<Bl#r42?0CmR!ZbMJXbhf1ile@?-lvru*o`ncA~<GI
z`2{alG&u_=0Nog)rr>QKc>p#soBDOut)0pK=m`$=o#!(Ct)gQ{5l)WN>nz?il!6+k
z*I7m9_Ghnq`8F7Uj6m}hUM2yZQnw_gQ(`G}|AvGM*`A>y_b-KbJe^d~@-KHF0cj^4
z6;ub=XQHM>n1EfB)hJ@6a0?evjG>nxyR&NzHHD_WHc+6T`~VNnD@+!U^d)42xL!?l
zd!qO79%V%Y$pRc{C4roV?_K9JipLDydJ@p&f|=y@G}qAlTKqD8ol!A1k92iv_XzK{
z>!vAbgJBRI^ZDV-_a950>WLZk7-Ix!M>$}{4<1Fhp`3u1U~m}hz+pNl6IkH94weuC
ziNQ#&x}hM{5o_mi+v>76(y?g|0W5-@iYh`C`4r{s+=`+)HBK`D!Ei_*HMw(PHCYC}
zzQq(0UR0M!qC5|^g=61M+8E`a1bn9kaD=UHE8Io%GoDcgIBK&_wJ3pyN4T`a?#Xq^
zk+9jQUvXE-xxT#hBRAj-(Gm+kk(d)={vvR2?65Q=#9u_2JQu#OEQf{-WMc$Fi;l<y
z0%z2R+w_ge0Zi3`D$mb7*S;?z-N+OqZ=dfuKrK6X4abE&t}?pnh}H0{QN$`ESz(}R
zj6Ft{8fy}HA)gm?vXCInF?wW;4H6*eRe{!947JOYnGFBAs1!73LZ(IJ9K!FO3>u5P
zU+r=)ZD#-!aA+>F@H{ocD7>kdS<qWA34>Cf5mg*ic0#~j)Cz+z=a9$5G^~nTmAJa#
zyQ8CO1NVW#vE%#xP32UFs>Q9ee$XrB5PR?K#k;1r<Q!sN%L*zoPaSO}o24uXJ{BaJ
z&C-I?7)0EcD^!)#46^gAF1<ila0;eb$pUe#N+8wF40DeJBZ`p5!wN<REapu((Q9a9
zAhdIJ(kU-An`RtYVfo%D8^jZWtE-R4>duBIBepv$>|3cR@*;uH*!;((eVGG)Iz?Uk
zz|1}5B3v1>`ly%5u+DV2e{|Amb@vXz6o*E*U;Q6Cd#CZHRJFvc?~1DhPa!7E*!-0(
zI=>4X28t1fPcIGKULJh=_lcri8bNz;dZ$=zs4pODHCCQ7=YTFqXMI@0_bag9qQnGR
z^uL3i4PigjW@9<fkrZj<lVqbD{X1fKZM5EE$O0G6OIMR+pjt+xs>b4TY;zBoMmS|k
zt%LAyucES3-QH&?`=M~{a)J;z7Y9Uutpc0Nnc5n=Bs6{?TVi7zz05`!UlGM2zfFr%
zdJR*FvLYCM7zh}vZd<_x#$=a2&m-IR_t`pIBY4%V`}*ypEu=pe`3cZf&_3QkA9!cu
z{A2?$_LBu}f{nP{9G%0gJI=2!smhqm>Y4!(^;PoXWn$Dt2GHHOPQPrJZ#Nz6j1**p
zKs+#-W=(BK#Cr?m3lw)@i&cp?c2i*u^>IGG`luXMdKi9;91N<S!*y2_4SnC4WiLLy
z$@4ztiS5JeJh7=1$5M`Afk2fj(}ZHV6gi<7vsn(w?wRFXIt~iArRrI;bX_y{KsH+;
zs${i@k`<y!;8udNqGkb0w^g!{gb@gIiIrXJIu_$)EEXfIpvz>mY+Yd8CA#6a(sc;G
z$}1AG1K&Mgd{`2dmXvh%&)TQw=wWLuI4<HexyrEshs4D8DFHW6K4sYi)ZyMIJTNF(
zy4czxBP%xgd+t$qye4YTW~B9Vk=U}N^~2s#=j|SF<{|nqY|`91so_QqCchNC2T!wi
z33rlS5pE`u>w7YhfLb$|n6dP7Be=2{D;`7gprzngGN%s5g~^AIn>ot!PxHw=N+gvz
zb8umSKJ7xr-ApDUKmfs88%`{hlT<DlR*sC?K_g((5)_{{kD8H~x!80kLm-MjnbUU7
znXkye)%>_(xhgfDexj@{7amDoK&)quE9QQ|%|W4@l7Dkh9Y*e|;35wai3~6I@&cjW
zW-(&HD80hD_-t|c0&K3A!z*4zd<Zs`sz{sB!f$TEu%{^IPtfv#`71Xld|oA&=2p5H
z_Q78`?u#QN$I#HMPuM9$4Vaf8UPc_*K)Zpb+2wpV>Z{3m7EE#van2<IEc5Ek(d)7<
zGeK^zT+9BnKqVVxwjHy7h7i-K$Q5MR)_N9{ImmBl%_x2ECZB#P#3i}iNLr5SDP5en
zAD_4ab5YU5Oqcmbh{@!!+U}B_1`rP>ECqyY-e6m+9BQ2{ujpN!PvEnJB2F3YW`r|3
zqNuD&%Y2_v;f{d>gBCcT$KJ$l+&aP{(&)K!8$nKY2F8AX(8uBnj|YpiLIEq3<xKC}
za^Qpltr|^)UPurL8tg42OE_dIfl!-5g`{vZ<?LH{>q#Ry84K$@Ji6$-wfP0mjpKSc
zC<RW9m+Q{`W2~$?Mz}(5hf90=v_S|8s9OLVqX{@asaZ7lx_j>#(gX>8GWMgBy#p&O
z3qk-oIDty-H89N(j*JcliWHh^!0U}Cn*7KVyn(hvFw2H>XcAcpiUBY2d=d}Q!52}-
zhbAilYpDZlUvQfNnLYxwte@-~Rt<>V=09XLtUrKfRHp~#r}NuM)+~9f%dHKDgPg?~
zZq52*(EV86&7@;13Gs4d-Wl<YaX`4_oiK|=50**SQW$R?+{<&cE;kd&w+?(05UCCk
zYBM8))i_C?yG(DWR*7nI69RLtvT-(r7z?^wXchs@EoW)gX2>4sp-l-u&QB>01-X1c
z1p!YfdXMU*iYo{hVe@tx!UJ{3W1Q$TBjHv<G{zYe5`8vssD4uN0vDOQK6{jJm=6X{
z0uqJ^w?S`|4zDRt1vAy=V-yvxvuncqSWNMUFddKNfl|qpy@;eWv63tfh2FBtcYtue
zp0@Y;eGJ=20mpJ(|HRYHjM7aY`oL>Y5t(U{r6m-FuJg|t&;|Nl#v{yFAXURqWNL9;
z2~~4u^adNRV5Hq!!j=PYe|*>(Z(1P0@jyIN01V(L8(+;nE?!AcAQtha5ad#8Y`n&R
zB)!UZ$$WU(UfQ;P04>R=R}H1?&>}FuJ1{gct0oB~BWksj?!rMo(%j4BpuK+%*<*fQ
zf$0H8vTz#BkwDTrLl4jsvnJ)<QA5W~UNmmAyWtTq@4#T*8f|9rfXutzQCKip&Yz)h
zI0U^VWY|HV+|$X(zL;U4a~kq%ESGGG647J{Hh{xH!QXLV$Z4gM1tO0Hm5rZ<7Is-W
z5De4_OLeGp^!QrRi}!ucMU`F(T>0(U$??fW$J0?4tEE&(R6Gfg7^a<mh6IOK76iPQ
z8(C^<4iP3rW0^rKJ8y7HbcYmDB$JCy>NW++37N6c4#_J@ZM+jN3|BuQC5~L8>UP%g
zUL;nsG_7P_vmmsI6VhvpZY^W8HXv@<#e+e8vef!!I(g;77<sth>l8|jSus=M3(eIg
zE0fR@FAUoi2>;?$^5WX4Hbc_B3MuIG$|@_VR5A;#X*MAiDc6l0o}y?r!WzN&Hw29`
z;vQ{=lpNIq@#K<(hXD!-#YK7w@wpPGL77rY{*d#0Z_-;w5T4+{)+8A)ES@j4n``-!
zot{BvS|a;IK`5@4XF3Z5-M#%sIUU#Dy46UbDLyHbQPR+$LK#SMBPd>ol!vBN>i*ot
zH4YsdY)NZC$SeMJv)ABJ2)>ax-q<j?xBopwt(r4pzLsMV+YTCpGf<Fuz$d%HNH=z1
z<Gx+STdinPLo^eoEudzMp&7Ww2{^uVaoNkMQ9gPphHls-gEy^nm1n@wMIo3N&EgWn
zQ#x3`sNrIXv4Wr2Fo<-RYHL^1d_Jk!=Gb*3aY{5Di_lSVLM5e<SC{O?qdcF0y=Tg>
zk64nB(kIxK!1H2%?X?9DFMB{Sk#w*337kHRBNow*uCf`LK0%P`+Jwbz|Ne>_%yGIl
z!`o43-@oC40A?La5nN7azcwQ-Uf-VJLsZlX|KK#nyV<qHYP$6gG(9i29<Q9q7rZSA
za>=Wgb}4XnzWJChZ_Y)fEyQyO^m43tbFMcG_lp@H2L29ED}>0S0uMJSMRJzwXp&&s
zx9Qq)-6;nJ9D&MQ-0Omk^UOqeA7QTzr8)L*#wq_$k0_b||N6$O8w>;vV@2Xv8znRo
zVpRkQAyHj;2TS0TL<AO_$th|}>}j+df{Y_1VLaK~LQ&1VU1-1<G89@jTb(dH*<y(y
z?Ue7;5bu#Ql#?uhtkAGhBevj9aO#uUz)5<AWdfIjuIxz|$RwS@o_ngy0+0xoD&Ksd
zx5)>Jh<45`pVM|PYJA5u&Q#I7IBuVJ-?fj9+MSkR><1m!xb)_`mndF<3zv&>ZtG2`
zatlZaj<^gNEo4PZW6J%mUpB{5EeDkQt&Bx4)1k_^Qf)5XLkDq#)6>}vXdz)!IOyDX
zoc%xpad_)$1R#StghS`*hVb@DKG_uU>!p8a<!6p@q%$e8fcgQwMBaieRK<9}T^=d0
z!ouP#;M66|zWMs-WdHlt0T!-SO8YwnfGJXu^45xk1sAITFhtC;v|c1F@RqRA8=i6(
zcr5HNdL8=#*<MZ;3rjY*9AZq#AVngJ(6bR2X15cvv$1_03rCN^V)~wW1sO{;eRyUQ
zk0{n-<tczL3^k|{K!74>>;B+3!H7w`!Jv6}A$ZTcr+&_u1j;u=#PZR}(rNGG_u1`A
zwBhOKrj7evYEi@r5p4~P5RA+%@HWnyFS4Ji!GO03*DpY|)JeX0O|TTn@^;@BxP#Lt
zsd8{NbGe6b-8_H4y&JKvpgoLRPA0-1{DY{)qXkk`g$Na0w67JYdKJPHTHdt%)o70W
za>`&~4qJg{6{Wd2&%6zG#zd-;%IYh6!<hstj?Iv5HlJ&YgU#LU%5Br*a@`B>lZI|;
zC`iS~C2V$c^2pu%82@N~2cIj2f_QN>Xo6IG{@{T}0<T`ixO5P;5PV9Mq8d?OS7CAa
z3?W1!i`;!-e;PF`hDrd`>=W{`3p|*ABZ3&R!h9o0BK~PB_w+pe#*+JR_0_Cc(fDHG
zf>s1zDSc18Frntgx~EE|u~tgSj!_SibbI5lt$d3RdvwZi{7Br6ov8=jWCV-N+Ztzo
zn)6jF1+h&1g@t?I6HkB$vJn;0R)wxFYd45GFE_9BzDJg`F;m*u*3l%m#?~Lk#pV%X
zfxT59L#*>4=9|o{5;=h+l3IGOS6%jHLX{LhI;`_+RKX?A+im`(&bY!vm7B~q4WT?k
zh^&)lAnf=m^DD-1?=O<AMiO3h+>ji;CBcP3%+&sw`D4-3Hn{Lik!^2k{*X1Zxf9!T
zVYxt-c!t$9KpX~Rfsy2*^xuV^x*%xkyW2`97RnpiFnT!`pg==n76iedZ(Y_HUH|1=
zGf6~2^z=jix`S=km56;@QE`(Mh3^*P%j%2hYiq|Xz`)VhTpb34DL;)3-BVEcw2{2>
zYbVk)Lg!pO{FYVRq~~Gc!m?7#_~xdkp)V+lv0d_iz4mI+w;!FXyuz`-{Ais(Z#Vvd
z%S8e)Izyx`Dapfj)g%Cyqq^W&73eqPVtbM$w+4gQ;6bdpWJ0Q#+#eR3V2?o^&s@Y)
zh-E;5^Xs<-=Fo?Xd7G%l(Dmq{8%K~GkzRlQrrC6gCA(IU#PPc}j^SJQon4!}I)+q2
zIG>{81O&gd{GHFyh-Yyai7L9B3VzJpf!CJ;TCY^@$-VtYz*)<r5iSW#5w6g8DH>4<
z!YCgF0*cW6o>6?vFz=f?1k^Ft6kF{vZdBS3d4R%ZKs720eSX@*B1+{UYoz2bxgoHN
zou0M2*mpx44of&p>arosCw3Y#vaAFIBH^KHq<Yml;)q4D#lZ)W3}ZSTTC=oTI&#P8
z?0gl<+&BCM>ey0pk_QlkrXf-B&i7B%^=OT77)A;as|YMGx=pTfEYqOUftGqa3{(6$
zS)ZT|PBz-WBuWV-v_fgGms2hzn3muj0`eoe@pijjA$)w}agI_O80oU5385S!!!Ugz
zyLnV1YzTA4!6POGOn}!@>@UD)Cn;L)DP>-(*C|`(_XQ?B9V2`LOEbH!)tijE!40vI
zSzcSCS=kFLrvwCD6{N<|??N^%bj~*;K)^AoO=C!m%%=h&wRSyV@t<|eH35v!ia+Ln
z!hE_G&V4xU+RDc-J$6;EfSoU!0{rJTUR^`253{L3y<UFIc5R;NQVFe~#UAi-;`*ns
zPkig|L533u>+J!4-LE$SAKLu|vkP@7NBmnKK$9XoTlm&jf7R9<8d;d_vA$2RTu`W-
z<7fM8Cfkj&YUWrvi2hA+<&Lu(!zHq~N7|@R8>PHiq7<|FS1KgPW(+BVt<v`(7@Jb<
z;mfmw*O(X_mJ-_|fDt}f(XsVDro*vHP$JGNVS9j5A&n`Xhs;-3=CD~LDtZYcm&7DL
zwCbk=Aju*9J#%HI7(|S`ZN>a@L)YGr00u)GUxp4N!O4-ce6lez%y{HDI$8K^^(o8!
zVPgraLc%twF`L_fY(TW7=zWP}mcj;blNjD`iLnUO6m(G}bzbnI;SdoB9woaarh(U-
z#VVAb1@@u`yLnD2+_-~+QDGE!WGSq1lUWCA%o3y<CXs2K9izr|qA#51spPa#dI{f-
z8175?A6#RIdehBK2#pG^1QsrAkD6d|*ix17L3`ZGrZYo*cKNAWiK!w3MlyhyVG2}A
z>e-hR?(<z1XDAJz$Qs^F`i~0&z>u8ogrN`uX1px93_J<l*Ka!f&DnX#eecvl>-eC=
z=H&+OUv_(D(uQ~6PB2Qr@Qd#L+xF2x_x#6G(;E2I&Kn_bc2g@s!J3`L1XmAGIjQ|^
zTwBa59cB^kcHhNTFA295S>kRm-rm>$D6s32)p@ln!zv7Ge!EhvjvD!^!KzW_TP<0#
zN_~tB6h2WkGO76$AMLJ-^RZ4AVXSr!ltvlJ(GKVnF%|=m7_C#7x-1{9l;U&o$Eugj
z$MN?6MH%Y0MquBYFkW8ft54w6aSk6TJp#XMT&5t|>M#(HhzD}Z$!A@-ypaVyC3vE-
zwB7(S0>gIDV>X+EiakT~FtjPD%YG|iH*}w7(`&5JqvA*8vkFz0nNtNndRfJf79R*C
zNp!R@BnhW3-w*T>{aHfz<<=HjQ1s^yJrbDh@;~u3gzUb}aqB}>%Ub-Xfo?Bxqa>}R
zdSX@~=i+9Pm+wQIQoaqP*GM8SOcXsK1IbmBw(2fst3l?2Fe21Nj3FAW%W2#VVn%F^
zkds*5+{muQ#TI+L`86SlF#v@G#(MJ$CkA1(7CaAvtcMnK;1)$CRYTbqvI|$THMICI
zyk$kV_eh^dhex108bbP}I%Sb3OJ*al9!Fpl;Bdhq<R?ax`BnQtHPTROfhJxp8G6WD
zq%!pll~AQH9N7-^Z{DQ01!tTa89d~eT1Q}LJ_JU^hS~=^p^{T#?0g+4G%nIv>>!-(
zr_tELb~w<G{5hO44M?<#3a1&!+^D^k&X{Wmz}n0N`pUgwF|5TxzZ<+1wy}*tN@ybw
z!525fXUz(o%%`p{xCMi>7CNJi5cuw7v@z^&>?m8EYsP#oGZz?dE>oGOd8gFrV;Eo)
z%16SJqRWb=iGa?ul7&XJM2L@4w|>${d8bO9KiN!<5dDw+2!17WHZCcHIK`@zD9?Pv
zB;YVN39k~SE_xEhy<Oh2DivwPCt)HTqD0X(nQ5V*V|pC-ZllZ3l&oT)DActiMNpYu
z<%4mR!tEn)h`c9u!bjk|swZC4fhpD1TZCaLpPF|03K!EQmA~m*RkU0(t7apFtQ$x~
zy3NQPULQimxFu|=T9YzYD`%h@(T}WrXo=KW!*Lrr-HmcnAiD!f(Q~InGK9>{7)#Et
z;Y~G~C?Z)}vM3*Z6z)nlO?Z#Q$_y_yHdo|hf;1T3HSvr&%DD9%Hu_2MrZW)Kp^==m
z$KuR|V2UNq;(~bR%B%(1s+mtu=i{-pW(!jO_*Pt>8E{G$Zwj55_AgA!=XuA7hc-&k
z8;di*+!Y1Mbrr=PYCI1YML7%}K739%&&&oT$bNvl$MA||J9+!Ru#2FyYjkyk3eEVt
zVT+_s5TsFLam8<B4X&~PM?kp0vSnKf+1djOTbs*iLqtoUvQgm2P39v%V;)eD5JOF=
zwHM=+=amupGbKl@WIRz}17E=WD4^ov?n<XqxS%*#`G!l<Csvd8>z;m0i#?Q>_d(}6
zr63)@dXSR7nvkU3WjSn1rL5SJXA%oq{@wK5ODAapMYO6+GWuI<z4<S()9A<Us?Z`0
zMHSRa0hU@1JoIt<42!U`5e>a1@SpNq{?6!{TJmvwQ@4M`VrNk8M;H6TpLR>{FZ$RP
zAC#L~5Sr+T?E!5C3cQb4CTFvYX4k-K>K5yjpNsFk)$M1a^tQ2})GV<aICiw>o0N!2
zkzY1^4kGgC^rfLN#Jmc*AOo?^ARGm=EMYM6&wgf$GK`%*=o<1^g>yZEiaJRzha<CM
z5$Os?_4=wXPa2M@Zg<(Oh;YGp!9y1%0JnMjbocbcuuL=y$@iFBV7laBHaTYyxy^mm
zsSq25O#pk)^;lQ%cuSMq;~$;nCliVCgz6%N{MvBhB9bf06e9DrkB7`6TAt80NcQyM
z!~#r1iNa)Ijl#IKMh{olCJavBeN}yzHcSmXVoa+`jon}gf=Yq0n!<_QPc;ty$pQ_4
zjxpm(e&&ei$i$4-%0^Rq<?H;S=bl3cE_PJ`eOEfIjq?q8P1VZ7=jGvU`?!00cJk(|
z)#<nw<*f}PN{Q3DvIV?84o}Xyppm&YnBi@ht9*m1&Dr;DX*hY-7KQVUD;BJgvgzhX
zjaBf2&pVoA*#Zf^;G}5>KNOmZl59w_2%tb`05mei-wLjIgxP0MkA@Ij<hahq7^vYQ
zVNr$iHqdQdMR<XeEaZuN+RJQ=fcyCutO&vn5jPcVfvzgNSp7f@-Z^-TC_NmIM`qB9
zBP@E5*MZY|6lBgNv<LCk<EtDU`!XwY4#Ci9Hi&-EVCpHnC5u?srz4x%SaTJ;6^_pv
zV31R(UW+Z^vS2!C6{v}d9^+uMe#CZN-A%K4@tZKk=Sf0DALfcI9TVtN_A=8W^O{}0
zfH77OxliDnU5pD`e%h<X96Jj_7;voYxPLl7NnX4?>72hxUclY^D)|Y^?|t}?{IvJl
zd}023-hS6Qxj0W=2z<u}Xu_fmN<ueUZ+bau9xxSk!Y{MgP3GqjU{R5A#<-ZO3PVBi
z50uO?`e`~ta9gk>7J+flG&4b57C`?xcP-;MsLsSpLvoO{2rNVt$3Dv^A(FyunhplT
zo*;XLjY>2mhSv2YsucD;n1a-Xg!41M<|Gw}dYFcVdl0{V_Hl~2dz2r^Kw$`|p=s(P
zmUl4Ef!S5tX?eyosHXyEu^f>|_%(qN4Clf@L}a$J<e>6aQ4b`!k(+8#8jfHHq3th|
zeaF>RQ7pvsaV%_5^g`NL&4!C;Q>e*~0tpY{JwGzOBosM>BSt(;-#Uz~lG?@32lpft
z@-nkFE4GVsUJC~RaqypGi~uhpp_p>d(uUZ2fD^7ZZVR4yN2q=J>H}3Gl5CfhLtSiM
zEf3ROi_kqpeSbzjj9U#jhJ;dLWKcwU<gi;E2<q>Un0p+V=t@S2W)4@vtyxZ45XkJk
z)JRfXMNtA*5gUNJfyQ8>_+|Ul4z<J})QAD%5pz%2Lq&o2!|N2BX98|Q1wRz!puRPq
zh~)wI9qkS60R<<^aGTx^+MQ2lv+R0;jbpYk3|OX0fq;gnm`N*$JZWc@((gg&<3eNz
zOW7El3*<pLzCDQ~HTuYA#L_FD8kCaRKf1v9aod;!W1<A<YP<&cQ!HEr6>mezP<F&L
zS3FxfV3&XtdT=N0fN-8@;oU(vY`mJxrp+3@Un`;1uO=t>DoeP2N$ogSr*!PjW~~uw
zA#U0<b+;*=WK)yBmB=Ah&=v|8QxItWX)&Mzk~$v)2r<1@wfsOeWdW0*#QA%C$Cv(`
zM(Y<9H~V**P75FNmEnPA=@&-wV9sPUb$9^00Ljk?%47cXBH_(7|9JQ?+_Ts||1A5=
zldB;`)PGJMCflyLk`5Ovg*B4Hr>v*002zWEeyEOAc;NLIAc~aeLpt_{`2vO+vAI>B
zYvGo{W3Dh{7F}iIWGkf7kapzbM?3uNRjhYepo@1WR~xglU}Nr+%>DZ}17KEAdaeL(
zSu|lLaDQ)cCjN8g2g8Hzz8ZMiXhH6~lNWBScP6(>y)58Ov@VW2&?!WDe+gTnKbI&2
z_ba(%H6==lSQVFy@T|Kd9ogOl)E!E0axEu9MA4x&tMtFvaktuF7@@a_`bEn_NWw8F
zI)D>&-)9QH{>o=&wZV{23R;vxA9i?`xhG-y*M1GdlSr!5vQ}&Y@X?bXZ><xgz)lFB
zB`$jTdDsVmN!3S91?JwanCH<6=^!wan$x1Kuw>5TOf~O5vCo(D<QFeuxDKbR7XZyw
zOG~tjQR)jRP%R!WpiLHZC>lz*rc8nmF~iy>olB<zq3w<n55#)TW4ObF78;~}F{~4?
ziIoAX`W==};6LG`RW=c~f^4xF85y;SWTNsJ?`UZ88dd7CT@{|a1%?|N1>`0FQ;Z~~
zE5B@fiW&={t%tr$QxdVOEQyZ0EH?1P?YPh7fJ^e3ZJDZZk`a*Lqez@(8ug5WM@J{e
zZ@TaH{@Rr2?!AjntBZAzcxfs`UUt}6y*q#@fJ0L#<4@lQ5Xex8#@a`cB}oPlfWF%$
ze-{JA5B&$g*5bLwJI>(6Ds*A}XSPo!5;jAF;e=wW#$dM|Q|?bc<6Ibtar9JWiDQPs
z8Odn)$s(TGR6$$3)dM8879a{5TW1@D;;(EoV@Q6u8?F&*crc%W8C+?jQLu!Ha+YPu
zAx=lW2pk*|5dsQT!AP@2yE^%Vu|;uhXEtlSoZMSJMJ`yg{M!pWVpS@nccK=SFsqEa
zD%+5;Ul@D#rH59bCQcLW;?Qd(plX3}c>(i`#)&OB{>u96zscdwEIq&mWM3x3DMbPG
zJiDvD#!7zM=%HFLw-whRGS|`t6%(w1z2NvkT9JYaIC9FblT@)_7J*vN!bmb^kU6%4
zi6O}<uXm8o?Fn$;C)&>GnPmxCTbN`zX67USh$Z>S`Gi(?j>M&}MMSxRYh=-d{CCKI
z66e3RZ=*Q+5#wWL7)K}(wE~Hyc7FA^oQ2+ZS$I!?vmm)I7gVQ?nFp5o@<AS7>dn{V
zy02cW%7$9OzdxKbm3M!kbKlOTG9^PTD$hr|`{nanc|w%EL^!iI9+S0|S*($KjFk20
z4y;$nvwG1Y5loB3+l5gE<+d)3uKlSx?no^JPJZn(m|Ev(QTM2Rs9A`*MCBn+N56tb
z7fH3N-8U=Vs@B0kY75=0TyNnYa-%}VC%apGg-tokd^d=9k^HW!a5+OY((}Lk^Rw~?
zv6VIo1h#%uOnZ;gtebs?1>NlZQGGz&u4m7lz<;;DeY&OpYd$+qpKR~^%eMLB+0&=r
z?mRZnZ9m)E+4`4c>yH}1qR$+ph9voy`Q_Yba|@nZ^85eLk2%a~w%Ow<+~~b9%GCTi
z=Q7=Bgeat3$9_J!oetrU*L#g*XKQ<>nfzORi|_~Sac?u(gIpwd0Q5*athUq##>kr+
z^Kxz@9zly98oA8~ALxHKTAI;lr&w$7x}b`MSiQnkE;QrBiiBKjVTu3*T)k1uZVocq
z1u#Ig_7GkoAcE^`=4z>gV?#_B9u!toy(UOzOtC`DjmsPhILcxe33}Menp`N1u2&1w
ztU6}M4mT>$Rw2WYRMF^AOqXg=WGH5;{dq5ojYdYngZiq`Fl2=^)z5o#XC^Q&J~Ep^
zLG9PzdKso8XY_QXaP&m%{Ej&S4FeS*ohz60iE-|}EhNeVWFu@NpW285Dd>r7ohL@4
z&B0BVPbI-Dq2-xDT)=dwijKiGnGa?NV&a#>bmGutIs}rN0!@vHx{88lfDZV#?M~7;
zIXr*Ach*YG-_1?_L;Ik0ki7oU{MbtNPfmY4YrlDWp1eIdI%u7BlD*>t^X>8ZS^M?H
z`HA_Ww%0Ll)}T4~ZSVNUr1jTR5C@Wzv!wm*^r&sxGaa1m9iO*b9do*l_m3_PFw@wy
zkr?qHIcmRa1B%@FNfY`-i%;pz<m51U*E-vOYyP?Sx_#6>{}H=9Y@Z)PcZa6Gz2tQ7
z%!nHoM|)?<>BZUUNe5el`5m-7`$v22cddg>GX~Rd()yuwd=AyBj*f!qp1eOc+P-Pf
zo9k<A>!`i=`lv<Snb{t+&szKEFfI4DeY1#WkVnm=bK2T(!(Uo|ZJ8PEo&DG}%_0Lj
zIqtOn{lYwFeoqee-tE0HbF42}9kWCG7iX<^Fz}N@EW>p1x^vz>zc_CtZ%$4QaM?Sp
zvmcDi)p?#Aopf;FE;_BI>EwJ5x`$TGs+ph7-(O#J+OU4O=*Q=+v$Km+Kq76JJ%8T<
zqsKm2`wnoePmXcUX0cAreuQ>mF>ouI$@{l0^S#;gW1imm*&Zy1QE1xx=lV(0>p7U@
z-DH#F)|;dDo7VAu3w}L;hTgY3tp;sgy93X(sq^=HrsoToK5m*B8~s($auc^UX&)wg
z2S2o7@boaWW=NvbX7VxLb}shc^6GQZpL>7exY6WAis<c|A782OumrvT70MXFH=_}J
zqrNI`i${PbQ20;c*O1>GJU#0Vu@?zo2R}SXGu?i6Ip;WldyicCUQFw<c2J6fO0#6|
zv~Ac7Fhz9>HUVh?Yac;2T|P>uMsz}W1_blR>c0h};PB7M_SR;SToeL3<XWS!-a!g1
z8Vg7jc@Kl=U_{VfKcmFATvr#vMN5(v)LoQUkS7Bsloz>+g`WlqtZ97*DFXX0+~vpt
zbLc<B!H}unu>N|sd9`Vd&B@V`As=!E9UU3+X{fqg(`>E4*jB@zd!KHT$uOge)C3OT
znU;4gxF$zE^H@F)F*YmB_9nyA9AJ%UV7e4A?vP##j&w6u1}~YbDG81761miD$c%#f
zQ<7L=Nn`+26ZCU7+Ay=Yx-yd@3z)J}_f1cIFi)5JZGuOS(y)iu*X9y4UqYqiAtH#<
z1xY(@s|djSj8d9SN4FGL30wX#Mf*3U&h{a7*-YTQl{+>Zao~krA`r^!#o#>(_`abU
zvYdT3rwS05J6brrLhxPF$_=q}7rF+R_AT=C4C)Ba!R(nr<p{}TN9)mKl8p<Sj^58*
zpBT2t5gPQIpqx<YHra1gK?4hyn`vXhcs`m7jy1p^tOwQXXHqD6&@Y&xxGKDDnEV6&
z%3WhwfO`x|<&R=G{+xeOb?I_fnXqX~(UFkcOt9?fpzobP^K+|>th}B!P(njiLA(LC
z#t=Kl^KX30%!o(c`-XwnFTEFGLYza?g^6-eH2LZ}Eg*sw-x@NW+H5+{EU27aA$#oP
zq`32jrw^lpM^M3JHiQzu5IqZVd~PwZsC*qV(GeRS%QRB62!1GMB|5VP-4K83X9IBO
zzT5k27e$Ef>%H^+x1Il$Jl)>8cMq7nc><zz=K#tHePb-OD*6f^INgK(^U$c_eIBiA
zJ}YS0riHF)W6bNfs0q`+pOATS1{W-%Sc+sEZexBbP3gmPX=a5Ma33q$@LO0*@L9~Z
zRV(z|yYBFNF6o<QEm(&mC{eeb$zOFHT{beS<z5$K)i2i&JlU(WHPb!PP>$XEoRPz9
z9Wq48;R;`GyrSJ=S9Z5&3k}Qb!DE!V=<H~m34&dO5g9fcl}vx>IGgQ{^6X32^IL8B
zBa-b`IP4U$hhHSa<VBf6&DVb1o^+sSVE7?OkPV)pUB;*OTHWK5<Cf<^x0|!^DxC}w
zli?*bL67mAx6nBp?)F&*dsMO8l%)sBL{O=iC&8Xg`_Oa!EkA3$;K$}7<NW3+_LRWo
zuS@xshDPZvFt$V3!NqhKBfj!_@MiT!d6AWNxJ)dOWiriunol?%y<X~-7HVJ}zRWO&
z6;u+?Q;9}2c?Wdz5_*aF#7z4kQUQIvu`N*n7!{t40Cdr2tAdFYZ!bD!N|NM@fXY=4
z$Y~CQNE|s_pFMfeOGUbY&337tgTAa&lW}Z|Pnw~yT;;{#PCuI~b2?R-N$^(k08YYL
zYwrLwL$@B>!mlq`{(K&J3xX&Xy=6pI)tlA;+#3U<=#OUuvq?r8Ga^*&n_@Ru!TL95
zmRn!G`O+{GszFKyt_94U`V;0d{VY7ry(_B)aa7&T$;H`zt9y8$-*%>LJbB4_qYgwj
znN7R11}-ek-3$+o1gKD7F{^%3|E6dlh$CzS3>DxxzJnA=Xf&VJl3mP>!N@2GsBEZi
z=y{(nudsBGjfH*knnl~UQ-KM-Oj>(y_S(n($tZQ@lj^R%=?T9|Vhh3`B}r8M9AyrB
z{XX)jg<Ld7^s90&ISc>;2k#qY(#SD)-cE0@yKtz#p)-wiiYpGIWa?oSPR*?+9aK&I
zjWSAHjmWWPquJ3%V>HtOea2Ym+^WKeH6sn$j21@D5Ka8X=l~cLpwui|cGjtFR92dr
zx}lua@Dw#zG2q8I#-7&@V$I+`zv>mIE`J*IKY*K#J%$sMLL%1yvwkNhz+S-9_d}wW
zWu)Pf@t}_Z6aa}do}oq+m9mYH-kwQL4y;x>$P$5dqvp(n=hs<8H~&cCq_+MN6zI14
ztJS^CZr$qUpb%OL)kXjt3RLl13UDG^Unh}lQX%R=Um~n@BU*g|UB{?_0KtwLV6_IP
zTJQrm;{?76k*9r&dT)hcL-tJUjU_Ud*~|}cF9^|;1j()Fof}+<{+Mb_U&5tBCp|P8
zaargf8~u;qF@2-Jt-@ITfJ1dh!Z0Jt94n$@RzVXhoLjE68P|-_3Iy16nBzwQlcU?<
z%vwek*yq3vriwQ8b4+){5JTO9Ce$RI0QlCFY)J8AR88LxUMByCh<lL$s$O_$^$>r_
zBO)t3?{qtNO1y*Pt{G-2z!_xS7A@8hM10yW&0)tpIcW^NTZGX>MU?YTiFo$_Q5Dxt
zB;CMP$dPE$lx2Zb2Hlw`$l69FD+peVz^EV-HXoo_3tqcn?kw%8%S}+?V0Z*VuWQWW
zL8pT&C0MD;DVPf#7AnQn_GWRr9p9e}11UMlp9Egs_T=u$@UmQXOJZV%ecVw<<t_L=
zTf;2t>l}+ft((!VTQR{LATqbY;T}3eT%Ne<wz2bsp~yMdkMSfV7zqsm2I1A&Y}eG>
zepi3oeIwj?Hyp9i0vZv%f;=sFGPo4VqCaETg*7lpG+r`}Fpv_XG3yOPXtUL5`1(?7
z!J$zuiz|AwNw3kH&0Q68!<DAt(?#p}<X!6>B_>Vs8D!(5$r)>qVO*wlL|aVCgiVJx
zuFw%Rc9o5@DO;>@azg+l8By6ntjLfe5#l44P`sEm2}disxf=`(n`VTc2*F|O>PPjV
zsY+lfh;71$%f>}0xS1hMZy_jf4mQ&bLsxSwgE+cv@IAn80NCNej);jj0dP7aW9t^l
zzFlO<1q<?sTmnu2!ynUSA_@9&`d@)Gev4^AaPw74Cv2Jp+xcfB2d>XP-`Ru%&#Gp?
z=PqHwP19h(hA1|@kO(vMz8e#FVW}Pt2!7FJ%R|hL8eUIWii&7JuKvF8a=I|wbyIdB
z$VDZsq2_5Wh^B-+ODSO-+!d4!Hrw10_+c#j4#~t=yov}Pz%c+xff}4yw<KnYQ+=y+
zETu{eZQcgj&>v};3gc8CIgtrdJ5YnX1bh*c#Ui2ZE}GTrG0Js--bx&2nLIN5(5$kq
z#@Q>D^T~V}oR9gfDun{GG*mi@hrMg;S)KH?nwht9D#~j7+cHBnW>S5g#7f{w#QyAa
zx5%I(w|Q>k75(dZ?5VN;*c|@3o@{SzDfCBk9?c_?<XsW4P7k@*`jRv#=U|N7i<uCf
zBD83s;Rir1K=Psz+<YoAjfl@>{eDB2f+JK=2!F*_3H}!I2F4<N%<|knCSz-w+;-BA
z9b9;IvwmG-C(Y!6bfK4kW4tkVn5K1KruFNuu4^F9lKSJXf_dD1(>^{wi&~1eJOwA&
z16Uk)&y<8DP0^mP0S9o`ZjlGapozYcG%Y)haw7RP<UsIYk#x(KX-IGbMn3$o3B$@h
zcX{z1usygOM^84Om)e|s$5tV<VNtVUZw^ui)D;Il|2{O2I&s)pj=Ag4m%glwT9J}7
z)e<c(epITZ4UTB@rT5{3@YV6b`>MZus(9Ke3sB8El^Hy2$S|sD%wA&&(MdJrzra<%
z>KQtlPr&zRNo&vlpN$$X#eWmF;2#(K{Vz-6zaKx|dh+yf5dZ!3@z&FS#()1KK9F$d
zA<?4bIZ3A&vIY*r{gdOv_M7BQ>-<rtbuK_SVT4yzg!tB9HYiNIla4;87%b9BO@E`|
zWRfQ@Qp9Qd1tj6CYoq2H?FMwi>sJ`U_|IVSe+HBPGno9J!Q}r8CjWmcnA}Em*Erwr
zV@-X>Kz{J0iv1q+#<Nj5N*rWCj0k_UzVSzX=&pl{lWt7lGaH!kY#7S~6Q=&i?qF4d
z5J?i$TI2aO%d|Rb2Zr-peG3*oGdd&Zs`s8FB)2qjoqnM@Yu!mc8uo6xnfdl75XY(c
z|Ezt^M}}#SvW?MnUPImZUF)5p!tM_zM|<b(qgMCm?Bcg(>FGh$(}$6#r{+e;uWQZ7
z^M(r@oV+W)GMkN}&!3+k*@x57=u>uE(9qqphVOje`my5;+&(&pKYCbxv^;2eIvDdf
z&pr<^Y)e0Ue9~<hZUJXro&<wRGuis>-f#Xc8JdP_LW8siB?2Ow1PYQ_Zu2=hdDAsV
z^UQWW%6sW(3x0&3j!yRXj<)<Cx4j>?{U3L{A9ws8AA3JO_J4fh{rJTH@u~OYQ~$?j
z-jC1xAHVf}{C3&WnRUZZ|MHrlMr|59I_e&@USGU%B$iDt^CF|43?qJRE;F^4AQRDV
zl&)=mGBN>VveR!|BGMaPWMk(>I`}*^(nuE&N+TOPL3|6-X6ND*ZWqH;yBDWew8VBy
zNhp2)q0Wz;^VYiqN3})(@}Jl<x9dUc+}xdNcK#z^%Urg?P~d5Rg*Zy1hiIVNBI}t(
zq4Luq;NyU0?d-=+YhRrwsL1C%vv*`}n~py$_v`V=vN8EpLPmMokL*7K7n`QfTBn8x
z+MVx@%!O<SYwrO51>%NVzkIv_fVa0B{mb|p<{m!o9=z@vdE@*?w>LNGr0R{%`@PeH
z*URQI8x>u%c^|usi&UNoF3<T<r^}dAW@F!~MXKFqMdX1WTW)~`bUE_a2}&h<N6Utp
z=hxk$XH>mz+W)y?j3+1Wx}E)#vsQQS;NQw4bU&Z9fSdo|&ek*ow*NU>{8W00NhDdR
ztG(BqlOrRlEv4n&s5_Zo7W2z4mux7{#IS$J*%@ae7&GwN?%~ni8({t*BOkYpI%?QO
zHd9Y;E#>qnz^ea}b^G({Nq3Uo#%Y(%>E3bsy#2pg-GhsFr{&f3f7ZLrgj9Nlw!IS_
z<D>QDWImhBXUXM!FhHo9YtXJRafOj^somH3`w{-k!czH%16tkUCnhy47JTyh;;_4a
za&dgF=DKBufC~pEZ=>K{gBOwv+yA+}wew^h|JZr@teLofK6}zkp7A?WFRJ{?;~o9R
zpYa7szCZ%NgbSYd$-ATjq%CzkFdJhy7IDn{jz919fBpf4K{Y!xqjZ57-MnBvJ6q<D
zKW}X%+{GJkcZ2zo7Hl{kOj8p1AO^xlePa$zHZ3Uc220i>*kpGwuA9GL#C1dT(K9l4
zZd33ccyEpJijOx@b>E^NhGYD0Q(ik^UNE}FbV3Nzr8<^mU?pEefhaheG7bt)v7><6
z)c#n=ohZ|A;e(ih1Rex7I4NUOQb#OrS!B;fW!r7fbS&av#%2LZceATmK%CVGz|2c)
zgV4@U7o{j<RR&xh#jN~SFABahmS!Zn6VC$X`&n>1L{GOE>Gw*OIn*vVf0OY|p>(5w
zi+=>HagLKT18ahNteF7QNOA;gpJrH)0ncZkOI+sph&nrf)DsuZzfMDaPJZA_s7`7Y
zFaRyj2TdZR17Vr+d`ju0g2-hx5n-r=5G8H%x7-4!`Ek<-=}M)*RT@=&T~U3b&Pq<x
z(}dQkA_$yaDJP&aC&+7vZ5VMHdWGr<G=%yUAH{y&Bg0t3@7>b6>KhX!km&C)3ZThb
z)pLqfBr!{|Vi3Otd-lAf9})?cc9qAY_Vx5D_H@(VRBE)mtp_V@>E?nxg_hU<%XU@w
zj(`0J?5qsLbOQXKi=t+CmUqYV(Fi+wZFW9O$KvJ1c*8-0&+)Do9Bm$T^7$W#N2gtd
z7(;aA(@?3ZXNim=gw`)gR8~N~<Np*IgTek+QJC!;{_@|Rx;h7)zXOG7`YDqaNWA}u
zyGi8kb?7j-npDPqhKiUOA~lJrnl@>>_~%{sce(3)8c;NXyD^4LnPKl7HigLJ_~Kpb
zti4aVMEm%>S^oAS{xyI$$DXeE9x<L5y;JpL2UM-t06LYwoE#oTzlX3P_~AFb5an~k
zKbDTtd<+|-Vv^u!De%$x7_k1Rh<&m?*RZ5eOJ#i&d6a&ckAi3Ug~~VNHT3}G8+W19
zuSP<*U+Qo3!2rI?)mIF-ygswRYl~S1FVTuTgS9R)nsc3O3A;l45c@U+z8NkEvbb<T
zdW(OT2sK5={P!+w;&Te|B4Sr;8DmG`;oR$uTXQQ4C6K1wO8~>PGso`|{La2E)30b|
zKADu7!S7aSh8Tov?C-=DT?hYF%rO{&`{zG|QI-z5;sbQh;a}?X2b$k)RzQ+5p0ZGX
zpf8?_e5Zfub3k@*SHnO1&oynUANd<_Ny(VXObh<m7N8_oIeuSE26D@zX}n1(s8YP0
ze!&0&pRRc8Ffq^2k9na{x61+-dgJ-xj^+~`8PjQ<H#wlJNVf4=u_A22ztAE;Jc+<o
z5UV<a+Is9?KqCSzZ<7ru7~>CUE@+sM0@V<Bpv)s44FU+QKMfKpan4O;n~4!&dA=^}
zrzzG3Dg)6+_<1n@G1nBNZEsbtU^KR*TQga@zTDqg3kxLpeag94+<>wS{66`y(kg_G
zQJc!ZFA!1c^o52{rKP=?er@(Lo%Y$VS>c1VjMC6g@_AScFGns^g<{X?{fMq(cu`si
z^T&UX@dxM!0lzqWh11_E+VbviD2YK$9>U+;n>J#_Z^A!+7P8Dvt7ML(5i-_~y`b!i
zx?Q_Nwl#d#js!*P?8_vFDdIdCL&|IIw_qd8Mp>w#lY{mlhKh8Vy0&aS0~fr6AT}t(
zC=3EqE^LcFn0x6XMckW`F9anXF_LmqBObNiy}LNqqo{8i73jr_tp=TdvA(>~3VKQK
zZRt$d&3C%JPV2bS24_dm-Zr*(kfV*z$sSbD6_b}RGYKrpU^~Zc14Cm#$TX+orw`Bn
zE<qFQTmk-Qsi*imL`$G0owP?@3FMw|^sut!jIs$KQj9?GA@rvE4zk7^rr4%$-G{N8
zM$xig*D51~#<@c;LB<4}--C#GIPj6QjZ#rHezu9tSXd?a8lyMly<R5u>L|O9pW_)w
z1sOYk>>j7jdN)?~<Y|L79_2Sw%)`lRe&j6zhE#`Zz?$LR7Jz352@m+LnzRdJSukr`
zUmkGZrzuLLaE{Bvm9{~6wsqH~q$e<BT7m%s_4)L%d^t|07u4pmbqQ|?D9cw~+pGz%
zc=%8F@OSi|U0ph!W`7}<LHqddg!3jTzd0B>2BDl{n2#-E5DAZ8FvDoHP}9QW`#%bL
z(I0unOA%P?5BfW>64*TyjA!|<P77#@ScNCJXrj;6on1~giq=px507*8?3Q{~p`4ku
zBM=DyQtWqdjXUY*>@=OG*F~MRT+?Je?iWOC<XW<$l=2|vr3t<S_->dn3jlB7k5a%w
z1ReRIv0i?5l#L&53nE<U*Pmj~f7s-qVihF(+udI0$-$|izg4^rV|(b958czH)zf6p
z5Mp6FRkQQ*-eSE|ev|b7AM<RU9p!2N9l}VW=@)9QlbF5^)ii1IsD`LBbPm15SpuPi
zcK#h2Y>goSc^zyE=9lME85jRmM)6zFhHN6gOXWSwEll&vpVu4fIL6=wEFk|9W@D7r
zI{YirBxD_8F<ks5%ow9Gxk0*^HzLXqA}GPL^oE!h*9PU^n`Q)N_2r+9hQ2f)czv(m
zhjKdS>2M^w&3%|v>Eb>$`3qZ)jY<K7<UO4dEJWzh$8BWmxT^dJ8s8+J%tr|Ru`Yy?
zdqFbn+cgZrdf*><>Di>ZmBI_^LOMlRt7BpUD?)^t_)0QultU9L()q&YN*l$Oi&s+C
zvxgw4;dF*s=4Q;8%KHGGhxm&STmc&bp<(TBTWgRP2@SkRHg>kQw&b6$Abg^f@XKkH
zjbxpm(`s!BY=Fq54P5jMv*;AAYZfjO@MnRuy3A%bkm5{T!3M%#Hfw(V8guCVZtLtU
znj6f^iv(-MH&>(Phip0=+`9Y{rU3^vAad$0LzCnHZ<Zz;TnM-cVpSk`T&o>(#DM4}
zkm*p&ILd$)Vu1M#!_Vg8yrN_mM3^c9>=0PUGLb<1T6=%*gV~JokMH)NaQX+cLE$>6
zhhD$gf7?Dfh_@ikFQ__q@<yU6<9UoV&?aM>?Jp3n41|_o<w01JaX#LNt;_w25~#J)
zQ3ko=h}Siuee@DsLKHg4MaL{CAwJFo0_)%~pIa3k1~WD1<Pso{p?W>^azkYoJzr)%
z>UXQp@mC#V)g;pH0*+-KP<Hu+&(R^!@2EnaAi9I0OA^nNr3ZvNOz^%*$1`UaMMasg
z$OwhZoRQ3{sC%DSpB<h(uP5KTdW#oiZS#sL&J>#k>`l;2@Ra+2C&?M$pWz0n^y<}C
zJ3`nC*3H|HGIpZhn(#b8&0&)rE!fiIz_mri)H%wp3gCI=1+)y$&%vdY6>$gbswAKD
zRVAy3D-;+VSedelQ1P7q;;WAGZE)@Ilh!V@34Pb)Yh`i#&5jPPcajBZ1W<XM6(OzN
z#WXfrUsX+T4A7Hf)U;nhMBgl*!M}^9zH2e|FduZ)lh%}O#5Z_eJ&Xm>$X(>{AMha(
zu!_lOI0G4nEl}oGb^mHKYmni+-FzS;X;j?k@_QNKSR_(+x<xYe3J}U%h7T3=F*eDp
zqYnbnbzQz{){?)?{x&tk^C8-j&Zpr-a8W3o@N$%nKk=LcXeVjyr!B-RS^E=;2jRCy
zYG}mJNT4@ZJ_6|y%uBBm7JX%*K~`~7c%Woo84<k@FS*U<@nU?Lnkn@%&;)XH5{`rG
z2)YP_j4PvblH+hXjS3mEcAS|xRy8x>Mxu08ilY2%WaJ#nJzzA)X1J^*oksvv%sPN(
zgll1%#o0E4Rp3(+6f*oxQ<RbW!0SkI`PPSk0-)+;>KXajm<;)q)*`Eij3|j<!t!7w
z{&4mp%j2o;Jcp)krlEx%`B*kY2K)yPl10tnLk;us+WF5?t9HB0$aku$RWjk-OhNiK
z=kyY)2@f2_2c#ySILVcFRFCC;nFpJD)MLR-JXJq!f50g22Z#e)G4N$0D19Yluw8z7
zN!dv60AMqJB=KwdZhgsm^O+TE2ncZaxy;>S^ijJUj{CI+kPmMAtH`#)dHA^r4!SAI
ztgL8zxQ)_>d+3!&D6iYc2YUwxXHc>{wlPdi=Q-Fz$G4D3-dCNm+a~MRo-f!xpL)Oz
zWtJA?o3Ob6f(Z}x&vbG93>a4=GQmsmP8adl%unT$3m?y}Bk%n5^M}Tw!G&Ggu~9dr
zPRh-zGO4(aKR?_KyNu2QHqLhDs3~qkv=lNQ55E*p9DN39=89HcMreg0hC=uq9**A>
z0J308+N?p!d)*#n$_x2(Fe!&>WNzhnldqDkZ@>L^0hx)$PVcaV*QU=GD-zkVH3K=T
zR$@a`JePECG#a8jmax%}Vcwu;^w&#SA-Z;N*Dxx722aoY$qBR{O=k8{<&ZdRXz+7x
z2Jby8t?qp#AjTHammecsF>VVjorf~tV1jxa>y-*kh-o(kYdKR&q%^RyQhN{YL?1@I
zj9Pw?Yy(}%yD!S(ihM#+vYVKJr+Og?(e%S_Dh%*qc^9L5u!;(KQ;uU)3@`_(RwhRH
zthif|9-~xmuAU|A0o`&R&2x4G%S8a><CQHIt4wV_rHWRj4NyVXzA4tABtQl3lw~No
zOu#sAL`Wg~VpO~Bub#V6YT@`Tng3z?s0B9ltHC6=JiV)g8;kRF{xQ4+N{2xeqvuyZ
zfw?aVOnJc}gaPnC2?P(J^&zOlta3id#+JiuVn~IJf+7&m^6IYx*O3Mg^o?+_ZDhz~
znwwv*6R=-TH#bY@i15LcGBX{(2!h!(YiWpFE7RuJ;%bw8=oA|%te4IN;;dhw22*du
z$q7D8fp$quU$`tpg)0ymeD2C122`E~=k?Vj%J>yaNHjEH)U|Yt>lqatD(*otPSm0r
z41A(*artd{&l_v$awywA_;10%AxT^4hl;F24e-c`iE+;ay{S>&x&y!F<H%)?9fuuy
z_8t8x3;F)uR<*`Hu{Z}Hvy$gEDYb(zv*JB*b9&%>C*cZ}UpH5!lE~B#uaaj^pFVyH
zKdvjE%L?KdHIfjB-pX=6j{sBi1uhtq;ydSi=NQ&>+}b~1UGxQ?-o|zMW#gCO1pl4^
z&J(!d{UcNo^A1{j2MMLMdyv_8?GLS~OAhSUcQ?%tU53p#wIydwLL2+TVxJ8^>%D7`
z14me-fxoP}jj;O54Bb`bLucAqKorMNG|}kcVs9Ek#I`r|@_|}JGU4)(H!J~jTsE`4
zpaF-&`E(8(T#j&)g+e%k&ktv|YN&0>#qQ}>XgSOT`@`Ps08x+Sa0wWmwQWR2fjumU
zTbFiTCI{{P^X|#_A($ovf<xHR&5(ROXsYjfBg90cBsD{U1bPUrrGU1Gj-Z|3I~B;t
zIL3Z~cyGj|temp*Ask+5E%y5T@<KpU=FjVX#huSB+;^)`aqr7*01Z}L&tj5@5QJ1q
zz~V)BmGxJ@s~L-GgAH9Ph?brJ$**_m^=etN{M<sZa`~tsE_;K*xHkyJVFOVdaPYCU
zmiat&hL5uKsW(as(B`h779(^4sVuK=F`O-aKqC1+<}$<@yn|VpGr_lA8#7c^S*U+R
zVg?ma{;82A$UnV+i(QPTrh}{T@E0>Ij$o(CV%Xj;mGFgdZfo+2IEQPgg;Rhc$xQ$h
zT%+4^jotEqr#{Yo5REX#06weUs<3bX9-LiEfCb73fh-6gSjO<l$CXcZV><nls2Zc6
zu29V7uE?$s#YNer<wXSX9LS<mZC+T%-?23I7{P9KbF<`KTJN85Pd{wJ+R<0t%i9^6
zB;c!x!&ub{&fjmPOviU=MFq-vly7Ib<e<lVzCM52P9BzA)G=#7Rs7KdD||n|kfSZ_
zEw6B1Eg3Z6Y7K5T09b93_OcDGPPfEjA;}G9t>jGv`Y*_<d!A#$gJMIaDe~)8c8);u
zr3zHUVnBdTd!Qae2yU`=^{=Di<1b&by|v$So|#Z+Il3~bu7$CuT#nW4!vGAo+=Bo=
zc1t6JR`>Rg_Rs)k<~Tjfr$=M~bq*2ojCL{dDi$&!AJlgY-Twq|J0Hpm6gb<j3vk?-
z-aFY0x~2_nq4pjT42m&Z2}}<X$!h-EXx3VcjZfUWpP9{L$LlKQDVf`cCXFd(n?e#X
zoqgS=FSlJujN+1g3?ohDj6RS%0sTTdcaRt$x!tJjqo}dm@e;$V5r&3xb*|Il7z#KR
zx)vJM7N-O~YBLnj!Pk)Nb@oo9Vy$>Rqi2-H&yl#?Ji_TMF%iqN&MQZ`3uwuw<Qe)M
z+WLdsrnpHRZdloH9&Xe2Y&Y3R(v--9WfrAq*um?xuV#f{#Fg&g%4h@m+cICM3UUMV
zvReu$DmMN2Do>;}3L-%70X>)PJ~{~4+KvKik{jpH8J2V<Ze9p$ty0T@uu_0nO^Mw+
zrf`?btK#N)4it^$PazQO21GEZU1r$IB?5H*|JnQV@5YTJ-vhlr`>)_=j=QVeQgs4M
z0F>SK94*wo@6yaX9dMCEi6Ui@s*-fa?{9y|_ykCRo2aVt^nG`3oo>4<0g24W$jFFq
zY!b>M;e{~N&8s^ku2ozzkw>ZjG=et54VTHYz4)>1^_|PLi;sn&Cw|R8@yqzJdY)d_
z)Z~q^<cYL%`oN|W+ms0{au1~q0e?_B{VYEn>Phh*t)G7Ssj#wew6K+Cd<xc{+!VV9
zg%8y3{;~71kUW;_QgKjTUO#jtI1gQ6<X=XQeo&8V`RKuHRr^_&P$v;G+9y(ZW!z}L
z{q~z&483PFXK+LZWO=NgOxyEQ5I*jt@o-s^-t<x=qHj{T8H;WILt!A*5-(II?UvZk
z)bad?neYM%7f_!~UivFF9y@<ck&-l#H<L}1_j0D?$`{++o8HWXwRNbp!~qWBMhhS)
zCT!KYDBPXiNNB}GH2z33F<q0zK`=WVPO?6e+1=9mF?RjhWO`II%l=p^uDR1RGQdy6
z`qIg3zMk^FqyJ^HmyK4M$EWM+CD7D*k+}kssQZDf?&&j`)3dd{Q~sN$$_?(Mo-ZlO
z4ze1DDrZutMH$t34kpWe$oN@$Yngd;_wpD&%1Hm*$Qx{C#kId8UwzhXLFzxrGR7OK
zQlGw)JuE|Ry#6Ia*5K83z1tBTZiuS0R}UY1$%J_%J+npCIE_D=b?RULOX{TQd1(Gf
zHwEpsw;OUOg(<QdGsH2uu*s3W&{Qm?WbBQb^^3{A%1?j!Z=pp03e#l|h?DeSXO=#2
zCMJAl=09?48}n2;UUnNM#pM#*`b+jw>i_UhN-*pfTgdl2`4iF%)BJAbuui>u>8f*F
zCf7l;_Tf@a)#c|nF|Pgtf{oVMtC}a}|L5Fq&O3Cexy1ilUz6Q*8I3MIt(Vr=mWMz7
zl6@!{*gb?nEJ{!%u3g=Cvk$omxp7**j9h>g`G|*CF?*i~+xz(Wd#vWl6-4Q7C3>y<
zzhfCq2y4&&rP&-pB!*WZ!GFm)Pma=-RBdv3;E6`sbO}fI?u<`*F@DaxxNxQ~{#KCH
zO{SYGbu@}@nm+p{Y<;ttLH^kF*}qVTCciAFHoK_mCP?1btwW2GW*73cYj}J7OIPdV
zQbK6?l*ilt*L>1*zVOUK_0OB{`D5oQ-)0J$gupKk>)q5R*DILPOT=zhZWCqX7nO~@
zicXqL=FV}?C>elFl8KH;P{kK@nh<Keb=Ce*o$W8erA?Mwu18T#k5B)1`3&E&gA^wW
zQtS=l0uTE??JGs^iU9xaVcx<Oy@+MNz`qO??-1Z6#}pG;X<~Tz<k0YOLk)+BkBHqG
zSjAw;kkLVAwYaK&8|B9Zg$9xxE>4V<oi+qq<&7s2Ct2&rXpF3+nefd-S2;*b`j=#K
zorLG>wNLH4fk|e&)b|JYqo3R8JQR-eD1qZ@t#mTn=T2=R#H)|(j-1-L<dx)jX=TzL
z(xLU2MFjOL^!!yaNmDdTs!(YoYaKFM-gLCMOoP5NJnE8m69v1!BuUiC=BhZKuaa3k
zz<RaM&J-jk$h|+9YU_TM23E@7r-}+scK|51Iy*&h_@}{8ut9L)^K3yUIC&#;(<kt9
zG5O{~^2y#9V?pTQiT9J`Waiy=#uD!><GW3My7&K>z!?NCkKl~i!tM8D4wv|z9A?)n
zu9HFZQg|SlS+5eID^$mXf9@~;r@~ypxnc5nV<-Q>p?bM~`?cWB_5yp8|1yKA5yG2)
z8ODBx2{~dPM#`1`W(>yr%Q+jBQ7|gY-Tg_E+y`7s`Ly@X|9(4=^PYWH^seMrnF!F4
zIYr4lg$gcN%iSAf#(Sd^kTMT@{fEuyNVsVTIhL4tg8q@^qLoI!WPYAovU~hyp!1kb
zD*SDP7bIU7WjL6iS3G0@F6p^kvs)&>*3f?S1K2YU|IHis_#5%#h2a45NwQ)}Q9-nK
zUe6)6oATx#RRoOoeC9;uiqs8D1m?_=n<;G`A0?~sWvaN^F&FZL*-s2r`R@>ar|P<j
z3->Oa@}Vh}`|Qt!e~9n*x57VMpg{63=b_hsrH=aFM#`@r3-)`;uk2*AUKa_eNVce1
z@4I+hTn!q^mwG{aXFk@iT>6T1=uH3oRQPh!ZVrOziWa*PdDUtnrd$kNa;RyR?$#IU
z2eSjE4as}IOk-+roj0^^Oso58D2sj?VLV3Y3RHRvsYhkBraUt#V(Ig6hFCiEw*?wa
zz2g&izRv-<{~F~Abbq*pQo}#JhI;Ob!4<0YpWYS!-K+SPOJu?wF?8^HJdmH!_X|sV
zCxZ>daAj_j$st_s!SS(Pmm@E=zZJ9h)W9Y9e`&nbw_m62_Q;T`Nj93W2ql5Z#+&Mf
zDhymv1$Rd|1^F)nXRLRz{L8PyHK~#_JT7$WGXkI^nrOyY%2U5LZ<C+*8-@=U8!zWa
z91;VQs693oEKl!gBEM3EJ8wGXg1$ydsCR^6B_e7k1-umxNDC@W0>uU1%|YTS&HkA5
zmQHZyi%VLswXf$Ml3%xLGqcH!Y-XhtXx?O(jH_mTGl;%8)gj!kGjS6RsLVdBZ4!G=
z_sck!U3bUsjr7M5gw>Vs;Oft0jQuf$hV~~nM$bHMb)Ftvc1gWgZo8MkIl>F68tnjd
zmRVC)0quLhc6%ke)1-m4q)l8%E3NNtQXIJ1l&eR5SG~1OK%;u05pdSe(qtu;8eGXL
zp;FGzrr6lq)JbCzQ~geyvx7a<<Y#lEJ+?UuVC=64k;tLvbi(Ozo^ETWp8WTkceV!5
zpXVxE{U^8zubto&VK>5KRBQMAKN1!s&q<{VSE4aFM=cx|v)+KGDBZWkr{>*K>Vs8(
z%r9?0=Nv=-hJWbi!puzW75RL<^S8hK((}yx#}9v~zuSBqxxg{L(0}goq}Z!lpUXV_
z))kI-mVU!Bn@yjGhvH#n;3-x*B}F8(;5`(`xWHE5c7bJlM!tsC$N)dNxV{&Pt)>%O
zu3sf0sb1T1C9$$WIzK6`Tun8R2?GH<o?rUUzGqEWkSWzQ+WXZWc6tf&kzOzVe81Kx
zcFB$a*Ng;y@|&FVXANLsL++nz=l<!vk}1PB%pxN+^sFDN=OCN35P9g`E5V)i=Pe~$
z_fg;zt-P0a{tQX*UZH}trgp#9z_6-0cE~}AGOR4>=;_Zd`FZ9m8P)DfT^(C^wQy>w
zf9$I5!e~2v&)7J&6FhQYmj)98ay*c%qxz*bD82gOZn<r6gShf<0-a|D8qEV>qrXfe
z*hYx8ANrd-cCq588Cb0|`jRn61QN<nu8LD;=3^=!<?2k2M8<lb=+{kfG@SYIwpRGD
zHYR+}^>#}v5LfDFs2KNcuW<M1cSpW4x+aRF*R2y<qgInxVngF+7vqd#S&74JM`Gn;
zb{nVJ`?focGy4`Mn1Eq_SJoKaK>K~n(JB1cY(Ay`7{?|#G)u6o+cBj$#-lg4!zj{M
z3^52HjbUpC;eDKXBxUn)Ogoy+e;V6Pa)JE!GxI>1v2l{T=w}N9k4?$?vDu!P{g8uO
zd)t)%(wj>iDuDK<%5^Q6GMo3gj(oOXCdCm;o*f{Vi#FFjAa8!{-$pXH`_p^O*(3dr
z{xZBdeh~iWo0p@`X#mq3&e6%uXTnZ*M&CL^1I`W?D47IG4cz#D-j<JnB1cH@(P*Tg
zkiBjz6H&#FZ)+~&fYH$uIIMM&mt<aFy?zNs8nN2==@}V!+itW5i!9C#{5J&-oeZ2}
zjf6kFwWrDVM~JxmPlr}Id8zI82#kN$e9x<Ts4Dn-F6r7#?~t@d6%8M9EA_9gf$x6(
zrS;b4jilk9b6=@#-c8N^?f5|~|Jf88nAKPQ>@)#wUijaK|B)4^o2p;GJX~MhSvWdA
zC>Lh_wXjMPC=zn>)10AWmSkCxizGH2Q5}+M7C*jdtLrvdWUk=8t2dVq3~&?x50@5r
zE~T|i!$F|(W^EvlfNZ=@yU^(V)%AWWG#hvI!c4Di)J$RSH)+)3Vi+W2kMOaM%ZqyK
zXck}ct=IZv`=i*LPs#BJ?PXV{o`}1pxKm$?J2xMQiUul5q-DYa(v_R1HtR3$!6lcm
z`B?wJQ?CC*wsB<dU2o_oE`?hDL&saLQ+}!aI5ZajO-HZZD_hALr+mllRhliFI=$&%
zDIMB7eWnx2yJWjw+VZDrvim<s?W1hNOZ_d)XFq)G=gv)fY>L*IKe(ky7h|~MsJ)d8
zu$=zzR~2&uJ2jh?LCIoolAraH9u?alzi{-Qzq>vtFNNCE!<0|E;D*f8BY9#rH+GdD
z4!qId!P(sSGMnD-vM=TLeRgP4LoZ2Vy74QK9A?R`e}0gHUw{AMkKuhdOhn}W+k~kn
z^_@0Bdz<EtY@PnKa^l7xsQwP6`KXuOwxqphnnq_uWj0Tf#tHXvj<N;qk=u2cQ9AGC
zzOZ-Uxmq|YZGBT4$^>jlFL~`7ky-yvFT|H`yM+3uM=4U457NnWyvS2<NgwC^xRYzQ
zmFcdPol3%?m)*G0%uVIUbxzj$sJfm+->BEJY0(-6_gEiNfO3DNmNOA*y$kKJaoy;r
zTx+$}%$yQ!FVW=_e&|gqKPTyA<2=a;bAD+*x~u_d<}2?_o{sL`r<7J{C!BsC;Dl|{
zL}+EdOoFG2n3BsgP5I7kP(RQwWzOO2fWe$VfAcD!v7P%|FOAy$c<#5fkx9P=Vdm$_
zTiA^_ag$ps{dLN9nTCUz_x^qGslWZF)`RG^aMLbq83+DYMI$*l;|Nfb)x+&a?J2KC
zXu(Hkvn^v%(#R}+N=xgl)Dwl3KC`;4ya3SL+0=-V(2h|F;7uVxr@JKm^0F36uYljk
z;k6Q=eq}Zd3mM%)uQ@B4%TFJH+4^M_Ap3&WFzjbkDD9O8T{K@p{vm;*l@DmvobdP6
zQ`5-=*u5nT4<n6wnTp4*mz!%NlPiCaIkmG|l_PzLz9~p(9kNh!4V9e~klKslnM0Lw
z<!zE5cH2*hZBZM;E!*+q-9l$Co!%6Dl1<}N`e%v|BtPkwlO1M)fnDuMd&e(C2j(g-
zrUq8>+unA$Z1tYru9`aSa<pR(L{I*bb~Q}wfn+wxuF#cH$TRA?o0W<Y8d=lm_m6iy
z;2+Zx6YEz6t@?KV(C*MLU0T2o&1$G$vA&*ts=s?u2+~ymk%(m%ousuw-2w)?9#7b%
z+|L}XcAK>oX>*)9n0p;W(y|Y|f(_E`bEfBVlK8V;{cGpmq-#R5L*<>_vMa=vYjKQs
z@2z4J`F2!kA)L4Pt}xW-Q`Pyrq|J*76;>)-{xVA2&xWK9GUdqEGfL`+cT?e>@yX|}
zluW)Wzex3ip*MP$bpJQ`4e3!|Ug&#7hYkogM`B-#=<FX05pKP!RBrEg6?7N~a_o0a
zO@+ZghpzOtE%f_tsh|LYb$z$~qnn4`lv7-kMzXYv#GWox62)6Wot>)UI;pu+Gw1a@
zyGn*NoWQxBU7RV|i=pmP?x({IyK>FC24b^G)6VZ=nk0MwAOp@$MnFD}Xwx#p76a`u
z#%nuHgo!pY6fH2Z@z0JcGL_P)Crop_$8y9P*L>{VjmJ>^VpS8R2)^PbPc7GIQL6qs
zow3utclTc0ak|NstF4p$^OJN)cb&_eWOgkxZ(Jvhr@?+^pQvi%_$A?n!7+6GLp9xU
z5VGUdnSU+(+rRx=VKCRS_e?eJCjWE*@2Jg4Z?qA=n!K@j!1&F59o5cE(}n0v=~R6A
zeO3E|=9@l!8az%riS3x2w_)Mol5G+jAz!CS3e-qD8SVO(=^2w#_+`hlEr^Gd-w{gh
zbQDt(XBTnw7`Hm|l~kj8>b3K9hK~BEX8J2h%#Y4PyCutW?xyTAQYY2`Wk8z0%xs!(
z>gv-Z4@z;Vyb`Gd7B8AEE0<-OEbSpRi+UT(jg8kW`QJc4gqeY(_AnxAE72ypV_X2j
zwCQgZN>BcKHvP!MT)z+ATkrHK5l!**!{36mA!PE`!5qAvhh+5E`Kb%0YmQ8lP3y3u
zmUr@qr1WWZaB}bG{nCp6;E~^EM2Tnfa-VhrQ55L=L{)a%{Pdvq!S7G?M9vJ|D5DBJ
z_UmGj?E21XmI5;50M7}#JL<t?8?NrVAM(GNo%!*w@Z;f3Z|_GJ!=B2_bSH0M^n4w=
z!F|p@ob}<1N)?-W4(U>cKmML_k?x;^^|<m{S89}CN966uJZhmlB~fW9)-fY3HL(mF
zj?=z&sr-om1~TdNEyzq`F2#j<&`}>-abFi9_0#BYXFMJWXLjT_{h?>+J%B(=YZ1C?
zU~WA3kVET|=Tq4^Af7W8QWrPOW4#BJb=uX2xOrsxapAi0xjxulR41th?2IVDGwu|-
zuGh|$GMiHp$X2E*!sv>MLf7NYlO*M3#_Kw$i{8w=uTt&YS&^Nz?-_B6>IiZ}rTy3Y
z7DAd?nnmH#R@u#$lp<0dQ5-`q=Q~;b&=OF$Mi+%lRTF^-ItmmzkJpWZbKOQsWe~S*
zTBkAj(L>v*<bzccza)#iPCagJydkGsI%ODBda;s*`y@(t!es8m)HG2yHIDmcY+6Rw
zJ*8B0xwS2)alDMdAoTD|iP;U~4}BbOwhwRSK#38Mg!|olF|AaacmqLk(;S9A{srSe
zCa01=Z|4nk?^dZT$WBLky{BviPNBWE-0x)wA-gpC%PX;CG|nEhGCBK5ETep#+fLUZ
zYYE+23f`?a*8Y%9&C1*O8r{}x&HW}PYCtFJ$%;<bVPZXSe!Op1BYl(kK6P>$S+6M=
z<o{G~F8sJ!@5_yx^v!l;PuI3wZ@T4uXwEhV^99|nx9Y9y?#+j0nzo(oxiXe%hOWFU
zEUa|OUbZ8D-vf(B-i>`2J???%Lkh{DwK}L>OxCA|O;wK6TPE(nwLi(e{UgJQQ(C!y
zq^G>c&D_YRz5BSIBmGwi!Tc+7U97;gW`N}XyGpMjJYCYi+Mft8@m5RABB@6F$=z{1
z^iS?-_o3Cr*}``6|II~rDq}b>*#deNW!6KI*|x+IC@$yF7I7?GCMU<$iRjN-CY^4T
z8|%8_sAhcoQ|}*rXzf1t%l^;r(w}EU5=qU8EYiRIm<&B!k08}|vY~TsiZeepo3-o8
z%&ffp_vF<aZ;t-J{d+%f-}}J*R3Er|?+5OBAGjO%z?1{%>-qG(o<``(O1Q{}!VH38
zPE5dm$SaAhF-ij(b4@O~SEhF7jJhWKJf)gV{|AZ6BR@;Y)`M|Fo55|lynfXK^e?~m
zUi+nY*CL~augM(G4@O_|>GV=g5yFuT6(vx!Gou%5CLn8qO3}ZNMRLrdAPnm6v8y)v
z_f~uIE}YjpJJUPWM(u(m;6r~2^%<c2JLo(;nR=Yeh=YlNBlhd-D43RDnM6T?>As1C
z{Ff3j`@ke(dLx;%pZJuTHB!B!jn5-hXDjubijSK{l@w?@XmMey$(z{$<7?-Yi_`ib
z&u;0JcDt{#Nwoyoq!Fm;dlb*S?8+&15~`IFCYhPDt+YS1GDxFGhKxOwn`268&3beA
z1^dz80>p4i{<J<rpK(X%;~AcI@DMsZg(XHk^H_g))Q3`A4P1#Cd`HGUTt1wRxoh7h
zq8)eU_}cy8tGK#nhKm8M`<iU3U|=*47ZBKOx?3GHNSPVV9SAJRb2x|KyD@IzpTfBb
z8}&H1@K0u4>Z!bob$byTj5LmWdwG`FVqE#s-Q(kAcJAeH{&(pe-|_Yn)l8?5Dj45M
z93+}rwc9H~KZbU@?vd%~_D|9g+J7F6>cVz;&2~LGn(-acb5DxQsT--+twX#dv(EC;
zF0E<Ve|o59MkV+zR$o#Mwo3uge(?90Z7L_@eJ_2k+8eR(Q#H4DSvab1#%G7q1griK
ztM#r+UEF;<Zr!!oUs@lk^_-$SfeD7>)igR{CY$P;cONABbN!9WGI?U!u<Z=z-;TZV
zTKy1oaklhsx>S#Q9GqXTT2HRR&08(Hrnt_AvUx|}W+}l2CL>5|F9_(b^4po2zxHAy
zaYSX5Pv!j%5OAd~{;7@x9mxazwf)PeoaV8M8{T})8Be|8GPVDh`Hz{IkG%|>A^Z8O
zlf>WRVEOuw%`q9{`Lx>6sp9WR3!jcMax8{3X#0Ea7^c9(P7L;A16@RN+^LTwPnu5B
zQ)S-6gTseYS`1D+oUWDOI}hi8)*15^;@l)5sMf1rb?;~(Q0+jfj<R#F1zMIs{qmq`
znJd6z7jTf6Rm$^^opclh?gqUeF1*PV3#-PDH4Ug6IQVhZRivO(P^Q-Ldqn^(E#DFW
z{hrz#2Wqn{LVjg68kNZ2)m^y@MR#}FUEG2F^};{BA<~_Y^Md!Resz^lmhjVC^=Bml
zrRQT}q?Eo)puZcVDca}B_?cod$$5Wl{F46c(D|o6{N=GR>zJz7k}df~y?!S@pZWjH
zQ0p-*NlYYK^2knNBfCd(u5jV2pPmxQ@Ywj|a*@UbnTd#!r?dNzlPWG)M~>{%P}!K#
zO8sE2Ar@Mv>e^W>ENv~jzcwm$x6}_$Z+=zY9N{Av{P|n5M|dqSd;aLtzx^OI{AEA}
z$xEYUP~U}{7?0`c6?S-+1WJ#<umnn&s%O2#%`fpw8jKTHI_>6@i*Sy+H=R!-h0}85
zy|RgRYF}!(8ZMdoEy@2=NHY2B=yqk(EO?+~iynDL@>XB{Xs5*od!+}52|56i^#-4H
zGu6n`5lR<1_HXE2JoHtz$*>}u6a9qU#08S$XLH#k+4-sTP|PhO!1{3xZCvg5?axj~
z_k<nhe)^rXC1x4|n2wakIO5)SheTP{tMhgj(Es|c;er5v4p28FF~;fdqWYvKsV_#R
zFI(^qW#1dgbE9+p-vAcmo%9vn_zF`XwSOiTLH(Cr1a+2^lh?+TDaacbvuO=g`RVtl
zo{-<%?+PZ#^m<?tB^5sQ)+1L-w$8$LvGm4QfSJq$)ac<g-jbKT-Xt8{-U+2?(%t;J
z8bw*&>&uF1Y6vCFIAo{D)aC6(nc|kby{snPs8L3C(r|w!PiCl~^;b=1aFlPKOj;NF
zTc<Nz7%7jp^mxS4)44XOn2wWkwD8XPEv3l1Y6<S|BZ^ABiy6l0ce#(c8Kxg~e}C^s
zhqf!TR1S=*p`h^7sLEOSD3~<8A$_SAjr_5Y8K)N!JVyT=f1B~Yk)^#-b+Py9Ox63h
ztpBels`VAJ(Y-bp0U&Wq?cr)8Z=lD6_0YfJc1+WU#tX_(^BcGYzmE^(-Gyc{%2<1J
zEg5&cS4Yz<BPQ~hHW}~PME=wjysx5-RI~Y;H>#dZeiqXZY=mX-wb!(?4x1cel05MZ
zeC7@6O}*A+qq$BBC}j$UwyEQp!D-1yN0XPVo_yoBQ7U`Bl+%b<pzq~E?|C{p%<3QR
ztKM(?+yAZLD$C2?cY1wx`W@%Kt|HZUIDn&3i2lq5bj9q?zl{@Dorj{^PA(W1PCV>R
z&c%I>%=^z&h)MHe37gi&J^1G(2B0C?H2s!HgNc8RMRO~W3eS?ZL`Ubi`*tkyK=XCU
zc^b~f5UD%sLa#5GMc<!11dHdBNQY!$TJE-I^(F>wW@QrEE=j@zgy}ysoTGxBkc&7?
zgxScZMDF?CGCq#TKXZSw>&!-Wj!Nbjph@r9zIu|Ss`9J;Y<6(Uzl?p$Eiiq{b^aa%
z$O!J!CsKA@aRKbZTsmAIWmG(SvmSTq?`EQ0E=sQC!~kRH^j+++ert5_@%ZO@84UW!
zYd<czUl*aP{?=NWBr;ffpq~S%2z*+h;2t#o2NK%~m3sF}z1~VgAjQ8sQ~32avJCpc
z-XrRkkQ=ilk4YGO<z?hlBq2t@qV$=xF3?bAsjS%gINR@;A(BZmRvul%=HtUnoE)c_
zG$*BV(|&5!z@;RxT)veRF1?J8<Sh2;5=nN1fb9;rnk_U0BNwbQ*RDed(@8%jl_9bZ
zF*Bm%`x!N3nb6T<S647K8#-R;LHIw_8k!rCh{yD&Z?ams)lEdyPqkEI1j_$VOVjZM
z(XTl`e?%gAJ|!dhY@)~|uMSvrJrzP9+N{6uP*zkfi`F1iOgFXCe(Lt({6?@*UpoDy
zN=Lt_#*pZgoRQ>~9$CynkkT=E&)o1^?duO)TbIk_#pBi48JC3JPb*>oZCN;^j-)bf
zZ1OJ@&!sC2J65Mi<B*k3o63<9Vs9om$g^XT9L8lcPDsx9BO}c-!mh`$wMI{<<qxKw
z;?BfelWfL_UJ|{urb06QeWU7{3b*<-LXI-RN3WMo!8p`k+xW~PYsBd{=Vi-#P^Q3@
z+0b+^7tGenux`GLPAJ$-_(}dVQ|W`HXn~ZzhLY3UYncih4BDj+U;0BCs(b%%=|*#7
z{rld+(V8m=@t?yHEbh6^Q}US0grE6zCVx^ZlGKLw)s<UNzt)BRTp7RDW-Zl_B#A8<
z*13W%X`;~!!p}~tSClFHL)Vk+$Bvw#EHV1i%+xu_edHgmZS8;kSD|0{Ir-qn+#|pJ
zI`WIT3ar^<e!6h5v%a&M%xEd&iN1PDM7bMNRJV3pV&byyBMPp#dMgXt<)hu*t=*l~
zLAykEt!JM6YvZa`zbag=?i^np?j9d3l~FdOao=4#Q5+q5lOx{l<<iz}`K-K@eEMH|
zC5+SLtiL)(OTw>-&D)hALKhv87<}R(bOm?n@tvHIm1VkY-nVN{lBp_HaS|=}&NX?j
zKi8|D)4Tq@QFGNf(xxKJZFp)jpH{7L)%VxAX9qjMjwQ9btzF<Ym4DpU=OO_<{Mh+8
zu_^3m3io7e;e#^tKT^OwJ!Lt0JILK~RFj3w_Egos>B*QK9H%g+zsX8NQN(j&{$o@R
zQSH^`7%1VO^_`=GjM6UsDwiGKRhsSUofu9o_d$EECRezW-^h3W>I?7D1lKm@@s%@9
z+zg%i^5MtV+DEdOBvp6x9`x2fu|Y2_@Tv*NwVoa_zsj`dWT3zOnj=td>x7FsFRf~_
z1(^ygZ!(d4WoY`zbZU*x-DFnk<ttrPZ<50yTW>;ZlT-2kO{>Y@$DO;h$?-cF+l@Cp
zPxmJBC;;k!80bsM_fLcY-*>`>v#hv%GPd9dU8yj0&{LEKKb2mvPO!e@<bKcO`$4&f
zF7TS$U&~wtOygss`XyS)-Jm!cAr(eA#D>*~xLcTUl71#z25i)Gn$$1#z&heUcj|QP
z0(ClFurX(9^$HuMak7cF|L80QH2tT?da8{q<vx-Lc<l9fA|0jiIGFgJP{7$%Iwdz&
z{n?@V4Og$H(W*9|YHycOPLq^-+U=*Fiqxxc<vfzIfX7Bnv@s`^>NoM{hJ-=Zc(g<G
zQx7DpNN{gDYOfSub#mp&!o$<!L%Y+r)pj))W2`1NLJi9*aAvelmMOTFNlVWrdcS3p
z_0iNs_3XhD!lpf4Et|zue<*lA7jl*8^n3^$)P8y#0bitC{~;~2Hef~e3&=_7xQ|2C
z$9nps6L0+`j;Lbh4NTVmc_6G!;i}ZlgLa;_^p+f8$<^&@>;^*Or<@_zUs(F7^?z!2
zv-HV+t1g{suXk9lly`5$*+L4$WG=1oIDP-o3F!v}V-5618QI7rE&8@xURgNaI=VdG
zSwBnk$feEl(dAzGV0+ZJM#U<PX%IFz{MPQOt3x<))NFY8m{sPYRL4A%4Hg^o$Y4a2
ztf1ecWZE?=E<2~YnOlDvN|Z5021v2Ab?jQQr>XSg$TBf>X3YBDinJKVLt~wgyfEkr
z87u&w$b`l~O#UdB%|M)ep3H;g-Sb}-K~nr#p}#(!rnuK|H3_u=N%No07UKFTQ(7m5
z8q<<2nc6gIOr$f_dUa8xL4bx%rlYm5`u+!v_D-RvM9S2jgt@wzda@(qDu-~q5$m@<
z_o}*R`G*mTh1Q0tyIr6>k&KnjR!WNCbJOa7IY>4a=G(uH2Jef}Zj>x{sfsrNzDUnY
z|D5!{m##bonsUDxLAx9fpPR;z0{1<8V9fRPF1>87Tr5<po+9b@@vYNHULNXcc=zv5
z4fsksjMKyr5dC}3EZM@eJIB`U!m<l-I$Xaf7yKan!I7v@1<h%;<C@F=&pzaWWYU-G
z_mz6hHAQW=Qhi7MMVHsK$s;{4)BhsyOxvw~(nyi)dmm@hU(!*t|6AH%_I{lP;eE)B
zJUcW!_sjM4>iyt~g<iQN+q(Sgntv(FT(v$HKJ~6?*MK1XnA8~kwV<!}CjpZ6K}PHU
z^qQYu=YN{&C%-!TqW8W3_~DOPs+9<j(4$hYpqqNHv$skhn5D0|q<zN|#kcL;x19V;
zZDRp0`#k4jy4?`s>&=um9?*8WV)nat)2d&Boj5Tftu#eNs>jtE87<YJ%jpmDo}gaG
zmY>~2KNS`-J`uN1PMy1<DS_iR6n`0pD({cor-x5(zWVe~L&3|u-0#u-_WOyzNe*1&
z^&5uh=amf)kg2RCgKP^K2S-Q|s&oMN_}_&$7TfJ+PnbyYXE~+f@^MY4Q!a0GB_?Y*
z(I*Si0an$}pWJ_ZdZ~9>?N2>bHuEzz`YsjFPlTa<!C4vo4;<D9#?K|IyJy*le3Il(
zi3OE~oL?M-E8p$58y|A%jEO$remjWmxe*+m-0Q=hR$=?=i>u|6aN}QF?Z0N?%v89W
ztdCdxHT@+wI+xPi{qm|MrMO1_Dw)o#vj8&~QGV=(R(ngP_tS?VD(kvN{l?Lt)nB$U
za59t3qx^8h412$j`MK}wEVD!#{ZaSuWJ2lByeuCKaN4TtHJo<ACKzvs=SFwW8pVo3
zrAWqpSCz~`CaezR(9XVTSNA%1XCKJdbrC+6(MC~ncI@$C{=MGma;6u1EBL_t^itGF
z?ev0ku|FvQlbk1I!&yC5{if-|7w_<>AM?-VZ^69Gn9U#Y+5AS&4%5GPfA?vSxh&;3
zJt^~-51G~VE<@hVlFeO<`h)ya*@NnCVExbhL;aKTYkHP?4@gsYnp07|V~ijrc4#_L
z%Cr4dei-;^qP=#BYjNK3mh<uSj<7zJXPV>?NO72-3$MxVU1N*!&khRc?8Lu=h`!3N
zW~87T{#{x?W0J5`I84RmFd={Wb_&ZZT+QHNf)3s^10q+49wBoFfAe9)497`fqH0FG
zknw7aUhvz3nz7w;d7EZfa%VZ@n`L)?qW?DXr->*ZA;`1S_;W@12xKNF%kx_?TX^HJ
zIoYv%I971fI#WuGT4#u%`O!pqkvuX|Sp1wufR1@=NKT~l{GLK0`RZs1k^jXs;=#=!
zFC2RG`sEv_m<Bjz>-uEGLx(;>Z%K#b3!_9s_QxLv=QmC$q|n9S^TRSByVSP@LOSkL
zA|YjlY2<+;$k1dn3mR_Zo04_tt#S1s#)zDm6nOn(>;nE|NmA>K5F@E}omtpyVe~Of
zIBoJVO?a@M%iB{N7q+%`PcO^cdq?M&herqNJF5lL`(^gWm+Oa@!ph#D)_Ir_w<Gn=
z+)?=_sG)-z*X*DwGdp;5&5pW5^6IFTX!}1`A5G^oLRuvc=YBA#!w&54^5Or<o148A
zXLFa&Y)<;j4jtuz4Xt(l@7zrn%kN?;tE1Hl7Y#X`Ug4gs4FEg*Y$CAJ|G@VFcHDSC
z`%FbESW!<sGb#7aOC5Xg+U<?;Yhiuo=yH2~XRxC=#lIdi#XW{#p$y92haYq0Kl&3a
z{Nx6dIM^KJ`jhOxMNn<}eBSpv7<!ePre+}M&t?nxA%^o72mfeE%lvDDfl(8`I3xe_
zN4(+&OdFL8b7rY61p<4cnAy1^J%n&c6|TfF<i^f73rgnOsy@7YP!Gavp*N4LFCkkP
zWrVAtFjw$gG_WhXlL<0Tl^h*1t242B9cxN7klh}s!Vdi^<<9p)g4y$#hXixKNnX$o
zj8#K<euN@A@QeOTCxU~6pZ^AMurEx$!NAPPjeO<1(eh(h{(T%aJNr}nb5+G$8Nnfw
zGdIcE(V}K{tn40zDwcce8m#~%zy2rO`}u2YHh;^^=J{lHcyID|zfj`;^xMC`e{$u!
zRzt%#{i>@t78m}SD}?%2@%(n&ud*)pr<MdiX)Ppmx+TB6u6J?n-9Jd&sp}+z$L*$G
zy%Q0fa>!x%D6tB*%LnUAQpw_j#54X!UiN8C*!16*GL{5)^<TVPcTGOC^#3XUGF$Me
z@e%)M_oG|bFTM5m!cC|D;_;N9eBztA2>oyVxC^hJ=Htze{al!DUhuRZeQM@c{Cz&}
zzCQiB`wRb0pFe)r_n(?0Xz-n8;<S#-saUVml}V7g@*O_>jxVR5{$AhSU0Ip#%WXc~
zzPkDzpFLXNo^r)qzU!pj;D@J`ti1#-tqYvSLFEN4xvG6xJC&ea{qqDZw$wOr`<+GX
zq>nv)<JX4I_N1>hzj0~r``Xhter}BLnz+F4vBGzL^XXeZI!Z!K`d}iazQ0JE_`z@e
z;s`-F>3i*O{M;x3IO%)c%=bj@X<`0x@R7d$7J@XSDCWMMw?PK*BYkMG{p6y@UY49}
z95k)^LRmq`$?l|g@_)AK*!zUv*S*=}$=<sXoW=UN93(idr<@S6mr0!)R$B@{h0W$K
z6CZkbs6Sp-+^15UDxGoWR}+VjR?nk{$o#55guoBU+<wb_{J;K7Cj5`=a6{ScX?|`G
z|H<My!*JIyf|r(y__5i1lAB!qBKbzHHR_1MV43L*|1z_H0R(IuX5{|l@edB3{BuO-
zy%9_>js>KTpd;(JU6jW2j>O~k=uf40Ev0vDBE84W?TshD^G=M#q%!j9dqLcJQKkr=
z`DL^KYjiH}rFP$7$;jlV$(R}B(;fcghuwCwnL5e;!b1b~#Q0&4Ifjyb$3{uU1*XDc
zXTFlj)53p=s_gftn)9vC{-rrwW@2bsRhKX-bvdNnL8n)%$TcVK)~{VX>S?#XNBn;o
zc^T;)Gy$+3yL-cM@Q7c2cys6>^FVy_qi^1Xc>Vbd0Kfh7GX(t({pv$=Ebcq>&Hi+T
z3H=7*n>$|9fWEzkf}UT}+7Sb7fih(uM%h(P1>v=(4<~-;HO)->2<ALWV_;@F22NVe
zcL$2Ua-q}7m3(4gu191hWFd<%kJj(Tgl6PZ&xYDTea$DbV0NO7l~;Q?Z<#2E?eg~S
z!Fl>~Z)D<0Z#olzaJijkQ3A#R;t=&u1;&RI^4XyqYIf*Q&5q>DJV>rj48r7jeeZ+(
z=OD73RVqKofBy4e^d4)w2b9TY2Ynt1Isdes9@^(WpSd#2&l?^?(9mGKfq+0mK9EV_
zBFFzTX?Hw^cu()6-d1~JDAoV1)N@w$DC#xe$9n%msdqe%d{6JApCjM@P!jgAo{?Pm
z6>RuFl#a&}3HkI+N**Q}_tF1ADgpqGqM&O6^Bw~JkEP%Q626m$M~(acktD=(Fp7fR
z_YrXS>gs<Y{lw8TihS+2$d>^Z8=VvP@dfE5wOqe?jITdv8`#kh;=eYoTCOPL+QLcM
z)q6QuSnZkkpZncm-JcXPV{o_fWORp}k%V83TdtZ`#T90jo>V_OANR~4@H(RvC7g5o
zz_qy2N@}TFyM|jl?pFiZsNcuUX1h9KEU9iH<v<ed>D)Au4U+08X}PeThh4waescW)
zhQ~>M*?nwOp4>tvBy9I9P#*6bAC{MeLce5x06wafAu~e^p}@LP%Zq6@N3F^=cB9fw
z`4?C1YQ3`<cj$uRrZ8%kYL#?kw=;iL$d#gBQt>%1qz}B2qW;Db7Is(utTj+t>rYw7
z-+wB|>>Va1g-x{ZjAUs@12;LvQh#}_+vqmybFKzxQ!uo@k068V)o|pVJJQFdCdOx-
z$M6W_=+c|Xm9*n=^KG=4Z~L)d=;DbW)np})4R<0tU%Al;vdIhV<<O2_?6@<N$qS>(
zVR9M|>)qb>J`l+M>#v2S%ksg&D1uy3-cw3ubo*7{-P_-^=Cz9tIfyjtIi6~<nYHC4
zg!@6lf@`mC?~;qd@$`+<;_C$gb=+OkX}da$akW~1(Bg-kf|LrsDo7AKYx}8?h_2*#
zJh(USDf<z3+9HPatzL<wToI$oo7aN$=<bt$==Z%=INR$xmunXvM~#qsV!~Lz^`2Zf
zduuFt;+O24<=2C6j87=cux|UY`?VV>_1ayXNGa}^tjZO)al7`^q8D>5TQ^LTL}c6Z
z1w?gva9;0uhS*B3pL$DXDRcXaF0%39>anu>N7aWlS9q!ZIQb|Xv+J&Kjf`55?)1rg
z-Ml{)!~>OHxy|-<=hK7(G6iYV%X#toNQx@=wT(34;G51!a-1)3^%Iws>q{y(XJp9a
z**Q1MVqCpT7V0dUZ{UGMVMzu!pzxkk6LeUD`E<WrUB1f-zqoYI&uR^=X2YG^UK44$
zpr`xPttV#gmzz4J;M{8k?eZ<>KlyUk2?%lRR_a&o?}@tFq~c`nT#q2#=sD#QD#k5q
zY6@@1&uG4XqM#h1i)wXtsfPD!;Z+&L{imY!A3n~xd>lH}xwMUTcggiDs@Jr6-GCc=
zROGHZ%>R&YOl*{p79F0^zx>=Q%732{N8M}ga{AneGX<OqA6y8@M=9j$79kCY;(V(i
z9pb4IU%OhuuTLMfq^z{cPIk~~x{a3W`&p=eZdB8HfPZh(&8U$`ghsQ`eR0gDSBaY)
zg`r%v-nb>5qSHF2ZLNf!&VKHpov_Etr+%xk-mhjM&!{}D#8z_ZNm*yq`S5Z2dv~?n
zu1V#~&Ns5vBxPfW&mI$trrx>fe_S}`!&K*BK~z;&*Z12bVCE7r&Y7O}eQ#e~QU~{6
zek~*#x3d;==b_tvU<$i#3VEMtI_9Y1ejPcST;8tAS$52k*UspxM<|uBQ8M%!SI+RY
z)8~<CIOVW$eZ#d_#_IeE^7lDl?0#hHjd!0OlCQSnrryUr&hA-<Oxxumj(+e>kxI<M
zS2MrskMJnRow%<CS*N>)QiVExkZnp-NG;Xp&U|vwBx2yDu(F)*UFZ1bw;_Edt~t|d
zH{lIe7_%d-PX{GxUsUL79P18<aagxs+ws10oe9I}J)v=A$!}*1Ge^>uDD6|!d2ziN
z+`1h2kn$fa!F}2@?pjax6<U+&gl46HxnKm@K8pPrkB$XPrjh^o=+zEWt<OS(&kp7|
zPD|(hDe1G_=(Cj0b09A%t|xb6Vr+?ar1PpLTl9|+*IjnPe@oT$m1P&av%a%*&_5#o
zdx$!5qGGr!d+1AJJI228Es<Mg5k|QYhKZdDC&xBYk~ld)?T5m`-g>W=F5u8tvCz!$
zo(=Cneix>fZJ8p+Uw^5L)1YA5ZuT3lyy06iekEsVrz%Q2+j{hyB>pg2e#olx0v+zf
zoz4dhlbr3<=lND!{7CCCrvT+c@|BrFE%_UGCvDOatGnaCkB*X{D}``{LIO*5I$zq4
zwX}q3ibFbM{u5ttmH)9NrGIGe-CC{T)TBfQe4*!#yFu#0ZgeuQC)aWPx!eCn1H&#I
z!Bu#kl@MR2?SFB#;~k`$@RVwQBIw}tfBaeqdSZTIY3o?Xt4(QL<?=oK$T&MdTlpkZ
zyxiR@?;IX(4YTi2v$J${{U@MAx!p^*Z~dxpv?Uju!p}%|cLxeo@RXQMPLL*39cV9r
z!09$Smtxxg*MAi<KYHw&MgzamvgvvGlc-q9@0QXpe)voFh3>P~SfAE{*Jw+(u5=MG
zO>*C5#t-h^n4NOvAiqM+Oxh{^YK|Wqnm1eEpKReM*~i1{t*^#y{@mGZ9sZw*DgC|Q
zRRz9rs$a8{ITqQGi56E&<NrLqof0KW=9q!WwhsRffXQ$G$#!H!q!c3=sA{cgQvdEs
ziu9O63M*$4sN9c-O192C)+(ajcb@KNQkGrc-abBBSllXWd}>drO&-2XpPnsv>GJ}u
z&yM*(ElzBhR-&)HJ$&!c*@BsB>_&SIEUz<HYtPAF-u_CXtpH%>vev$ozqs#ZKSvpu
zxRz**62+ea>hkcvjVEUFDV|GZeSIzkMS4@(-d$c_Ssyj0<i*Rl`6Yho-xc-C^!;fm
z%>Z+qoA#HvgxlJ0lR`h~-nevcOiTBN$96YSXzH~&*V1B&_4Qtm9vIUu$nj>Pe7FwX
z&ZYYHXM{idZ@l9>bG3SN&UHYOt|rrLnfq4q(xrRpQeK*tda<a2kM*0l<3#rq-x_#h
z+I2ZRXHEdR&Rn}SSGjg=I_9Js)D$0eZ(s8EWxI9B+m}-5Xv)vmyK{Zd=iA)qV0!ob
zr940M73l{;hvMW(_n<uIT)EB$n{X^^FRl2#QJuSaonqPg@a4_x$Qdlu;)ibG=G6)P
zf6dr%pT-M?`1Qr1$aC&5b1AkujZn}RFWp}*(-)`ZvVqS&KO{ED`#&nLecdM+&>gII
zf0iG*<Mnl)c9zmteb~L|K3n*P?_MP;{ms{XSzev`+wP{AOAIlmgUofS4|A<Vwl?FJ
zX@r;a=jf}K$*Y(8>U%$Z=Q`+#+<eDJ<t34u(|+!{{cw{|R+Y~wKE(@{JtJ;P!Q8%@
z(}bY8Myu*f=T<jv&RtEpKnIBH`<I#bFRxhZbW*d`p3{gGxsDRKtwT;ZfmWOEIhn0*
zPP_iJzn5YcbFR%~qQ$t*i`Ub9KJ5Xf?_aw2FVpwma~aD$^))--E@io<zMA}w2V9=+
zT=y}tqmo}v!)}i5?xoA#OYiwya`flisuQ&(zOOW=-RR`COSj(iwP`=u-(^uW6R9!h
zB46A#xoU^$uRG3pHSo)~w_e^79@MvncuzX>>Mt`<cAqAgC^}IQv8i;OVSc%vy&-y-
zn@C%E<2}O8eP70!OH8js+`8nn{wzlP=B>H7zhBB5m*ihgc{+41&Jvk(FkpWY*&j_s
ziO2SPzuLHNwG+9}bKLenKH@i1&4KqWGp^w2W|W3=BucHCfK!~B;TVw2=SD}OyrIMs
zzB;uAf64Q?duc?l?OS^FOD8ebhHk_0dbK?N-peqR15<w{6#?(PbbCJUDdpbq_=C>#
zH`nC0_zQT!oQs*6tF^yOqmidel=p!SF5UZ=?)|9=`<Pg9bE9@}!iU{ExlJ74+aVA3
z8=p^3n*cfQm_z!?h&fDLue;vr&yB8AWgg;IW14&1-EHn2r^LuR(-OC*4&OXXW9y|F
z@Xf<}Z_kv45RCVYYrx5`U?LgevNyteWwHyHPn3?SwlMuz@15a~rRd>sKcW6Ka>e%(
zN!X+l>{tOYT<<?47n_%9<hARFFm~zrZ}xloPWbGoP6B-n>y428<eMLUXw=?V?8L9?
z>+kyH;6~3i9{Trg{)Z!We&TevgVQlC8xQZA*nRBy*cq<lS+DS4g~RgB;rh|~$&_>I
zkNU33^v-3DAY%{2#3}Sn=vNX(FX%=su|K}<Sm>24Bg{Hyaw4gwJsbU;jY$NU@Ns8U
zWX@#m>Hfj}Y-V;i-{j57<dZMHQbr_~er7&>g~9!%KdVd%$=f>wz*K#Ba*ms?J<a)1
z-o+x7M*Ca8o*Cj@pU$Eb-#CR4L%oj*V9MW0h}<aent+-uU*bpCtaKvmKY>Bjh)G9z
z$2~S8G3YDj&<D;h(~)M=kf*c*``*Fs(&f?mQ8MCDGRW4#QF(T3=F#l9jGe5KkZ&B8
zS!J(%i{29PQ+EO;`n9)&8}+UI?$0C}lJgy>k{LEXm!WW@4CSOf$4Js;D&Nm^o*t5K
zG&+;buiiuAT)U(;ek!8!znm=`9`BV8PSy|0%a=R5JLR!-%T0s(>?*EG4A7*xaBrng
z4$LM0OIOLyW$iC5Y>n6Lv(w0f&JJ&zbXM|cv!HXi*$n@Fws271+qzs{Kiu3ZA0A%1
zLWAzV+_1}2%`jPBv;KLq-ywY_Kbz$Lm39ZJY$ZE$w7xXm-VDaqPx^H4*-M_yPhs%4
z$q)-?TBmAf_p*GlzI3#{yEE0SG6?ph3CYbaV0CULy&um?SozA~`OZ@E{qn*2VR>n)
z@3-6ca}r887uRkl%^(+Zn4d-NSF?rP-R;Z6rQL(_<-+ntLXi9^&qP3uCrY(B_wZEd
zJUMT(fSwa+lUPPPeVJCO$`fhm_p>fc<lu5;Yhm>=xha;`7It>ZTZhvf@x;jPHeTy<
zPTNb&^q04eSNg)Gd*M=F7&z~v9!Vt7!cHPxFUpt8$J=`uLJk<9>(ome9l_Es_cY_s
z(@NZ_Pm26Vj9lrsv~bop{VOt6FPt4H(l(Y{nQyxAo=L<><XIR5#h`yXCod#FD@OC<
zKG)AN1R_6L+S4eaaSQJUzf4}a=a)vszO*!iXVU8Bj!)DT31N1x<rCw_%`CZ=+jCiG
zT5<<foiApx7s(9oQdYrqgCsLH=4*Cr(CHz0&WX5nms+<y!tpWuz;rXtJ3`V?E*Zs5
ze+r7bSDmnyVuJ;ju*K`+dBG{Z4t$?`Z9K@|JK2D%5i{2YWW)1!Z#y{tQb*DZ#5w<K
zsP3H7clAUyYD%HqcWr(0ZtvCELh;+Sy@#&NRpQ6T#w5gI;;#0_xzusqJVIkmh@ky*
zxC7>@FV(~VxNl5E50mfA&yVpZ$N<UYT2q~9jnMwN;Qd%w+B+^J?-f48T?&-QLGRqO
zo3)SQ&-bX=$Ist5`}ldb;0N!Rz8~oPlau1+FO^l^KmXnfb3%YOI3tliX3RQz16^vV
zmuU`rZ#A{Ht4qO9B=Y7fqcl2&N<A4k8TH3^uS`huJyxdGYu=Q?xuqo=)VNRV9bMd2
z+tp7=HY^$C$AMLj6>wKib83ThCr7W1IK9csmuh)TC4|RMp;oWPFLSPE%2!N5UcPiM
zf2Gt&FRzEkM*9&%Okv>6Po|p>*Hil1S6{2caX@o#h9HfY&2VJUrG_KDArD5+s&5l@
z;`@g;!Z}CihJ8y&-~Z-$q``Z0-FhoAf4grH$jcnX{%q1wF4IxImX#e3wx8ZoVMmaq
zQES#=;OWo5Mo1R)qdylK$s}40O5jZ7^B$J3`u3pDLw`Jt0zTmBKp+1)+9f)TRzjGd
zcaK(R(h>>@KY3GJ)XoOb!~%VByaqVr|EN55=H6|m40%41QKlnSPT(JR>V?0#`@|I5
zS67|-1S@7}-rqjwspspanK96&pJTWAJ!qRIi@kTQy(F_q=Vxw;Gd@D}i6qunlLdVJ
zrSOoLjXi5C(HR<T2Pb5Hrx#cHn|Dmly{`5ZuYdK8?kuG=Um&@-9wuSbqpx*mA*CZ+
z$_QU6R$Kt!UHyg7$2afLvF4le-6g{i1lbSiegAyiTqF+i>*wO;A*j%|%tJL=0@3H{
zS66QwI}c{atFgR&$=g%eNGmSk$8$mco*6H^CMOh(vLn-iQ$xO)wTsEf(AvdVEu+y&
z4_arg+n!5<h2<A=OmaVdhennRz&Y!<Ht+pV;z{%D*FBkPz7Df!N(5bYy8WMi-E19x
z(R6Wi<K@DL*`~<jai+MzX!!9sujHj^{FB-8c!WOHt05tm<>a~cD|(EYt1JCHX0n;8
z&;tgdqjRSkx8|-I_2%S6HP5+gc2@J~T+T>zM0bN-GFWO*POUT~;-W)(xs<Y#3Px^-
z0^?Dr$o18sFrO>5SbvBglNB~!Cak!V*v!sy6rQS2gjmdoHR|iIRK2Be>XdS9fb`98
zm<MmaXBsJs2xp9EkAb@3lEdf}fVrlt6Y}0^x<p3lW-4zddhVM%kj(Ht+1W;?o=mUy
z#^h2>%%!VLqv5zI4$U!D#M~f#UB`QSsuL!ba+&*oN8q11$H0^3Hs_6+T*_}!XpJ@}
zZlE_L#GCVTj{8>iWzOZ-cH57AXz1P4(~&N9q&_zEo(q0(dM-b-Ek~pB)VzD^e0avU
zKe>O5U_cp3j)@zIvl4iIv-wlztz7q=VUgroDixetzuxHzx+oRzCNgHH>#{K5OSg<f
zOg}az0}msq%Q&#6TZE4DK7eL$a-wvr1^K3DU?f+Ls7d%1IY-t`90Z{6E0WGW@-lnl
zM$0ZRn|3gX-p9i$%VZvyi7V;VD9pycP(X0xB(p{EXKp0sI^&<2l0OD#>&D4>XL|gR
z@c7jHk(-*!(seUSlpXiiubi06-F5R~l<zRD*K}UrNU_&+W<wNv&qbb_T3(0J5VDGE
zP4@0{mDiv&j!cG<6aSBY_~V%JEe}HDN|5z}OS8Ihr3^Cu1H-YKmRD)5_^q6({nNt9
z;&&{U4#?Lx$vu)u2ZXB<+M4<Bt0pzXqhCd-ArAdEO5HS@a~-K#@%4mC#<*mRES-v?
zfPBT2x{t{X;4q)A<Yu^OIc5L7vr31#lwo9MZWvXK-eqfe=$!2qR!1__rwJzlvuiHV
z2OeJ%1?B20(eB>VjwdN83@9s*L6b36t508=PEqNvXLV5&6&bC-6hCFJ*4^&SxLBHO
ztC75_(Cto)WE-_dIYl9B2!!URx6s6a9lB{hJ?3Yc>FF^XV<Pau8@kO%l`9)#A{c_G
zH{rDVFtUu<XwSjdpvF^x#JOrx(?$=u$#f`_GFOeOH}z?VH{{aD6?Xch<6X*lN=M%)
z2`A1yt<yEu=`u9iuXABdoN&(+oDgg>X};O)EH`1bGpESQ%2a|IN^9(wRh#&+Oo_QE
zKbU!A+K*-<2Hi(p{Po-v=$HGPd-hVF&BqB2{&v>Y{JLD)S}!NNw{U#4c6nYNAH_IG
zh=<3zlh2GjS8cdL5YyE28DI^DNh^`)FkiblS=ODd;?D#|%@+WgIFEd?f$(Jgu{)Q`
zV0&+J)WFQ#fS1ELZP{tPF(v0|_?|OzZinwOp}EPK0$(?)%W-)EQ%y}Zk?+5YC?wy$
znL5Gmy{9_AZ{FI0>3!E79+=~|ZFKEs&SBg4o$pG<+RY`Sej^p*KY;_|@4<aKv07u|
zt@}0eN{0OEX$dA-Z8yIgtMvx_dP=>0FTRUP>HYX^(|KyVVXS_|oMg<26Vpa(sj1|i
zDIC=w6I&qewtFVX|8_tB<A*<fac#fmzUQAG3O}XIJhbFv!GTmSi3Z<jb(7zI&yP8q
z@N>ISQ(JI}4}Q=Xt)Hry>awn3LqVz(q|;k19~HjbBqy}s{QAir=87Pv4g!89jUu{_
zuAp@F{^3J)?zi~y`t!eg|2g;DL-%oZ=DOaU`Iv79P;+SUOWD;Y{7{{pk?&`|>>8@M
z+0<)=+LKf#&`-^L94xCkT>Mo&Uv<@7eK)gznKZSVdh;Paw`!&auluc5TAgvz`o}}u
zO%(UmZ!@z$%(#aSDB>!Twx0aP;R{{S+oTBhb+cWWlb(aUH>JT(^1H@k+Gxv-<vP3k
zqgOiox57W<cfHRX*1Ht-mW|ZnxVaa)?erZP@1UHFczCpM)Ssv;zb<u&JKaXL<8tN_
zqmd*JH}v|>%5KV&I>hP0`cb(*0PSCfr{To7d&3=?9u@!4LfhHhUQ4K%Y<9s>b-3Zk
z#BJ(04sx5B*<3rYYsr)nI`z2xonN>f@rB~>7goRi3y*FK+zt$V$Iq8(?zj#M?tC34
z4|hJ~IKI>S{*gn*Mn56PYV_~Zy-4<<ldyQb_NjgM?sX7fGI13{-P|0PxTnOZ8|W1<
zBo18Rd){`E;PI)|lKS_J?v3kZ7wcXK=gkasx5x?w1VeU8I(NN~h9;O8eNqM5H8z;0
zfs;xsJt_sd3jSR9(Oql~ftK|o|7^8C4oow*<Q3`4=oZc?YxKNfvcxwB)Sdf^8P}id
z)u(RSL$&i%b>SAD25CBhY5F7{nne26;ZsHB%Hd0^8$atVj}_#9{P4g2Z~P;LJzU|q
z<XHZ_^H}|RrP2OW{l4FD(0CYH_irx>O!nW&A3rjY_rE;r`C$-5eldB@v!Q4HSHXPW
zX^j5!<Qha33jgb=^3>`+O?d8&-~a#V9~W#8SMRPL+fRuGu>SX5IiZcJG-ajD#-~I9
zbQ+>GYZHOla5)M0($z*=7$w??i<j!UZXm5XomI4R8Vx?`5<t#pK8e0b&lPDSQh%&F
zi7HJ+;zEaf&)&$hj4a)3`-2p!&332$!T;z6)AmWOpP)9Cb8T>vc_cH5JN>SNX-iet
znI!qoW}N6$?Jq5Q;lyqv0p04Ys?^k{C$D^oHid=zdMq7jn~l~TKblQdr$VjnQWFx@
zqb+@^+-Oj%Q*d!KvxQ2tE$$<_@gU`uw(HFA>Z$8G9(<|)wb?Ax8>!1A5xq|ts=Fav
z=R4`U(CLx9{pd#G-A*Dot2guosMM1qU06%h*3Wcdacx?q6JxuQ9QzkqJtS)2y(?qg
zk&UM#i!LCRZ`{W(g)gy7qe!+kx$k5gZAeXLp=x$}x^d^OQ~2NpYqVUqfT~cW(M>xP
zCCh1dIt^)G0Oz=g%Sz(pfmWYfD_h5hYs-s&mwzufb?&D=F@!}vrgU5`AFi+NxWDx*
z8(7zEkBjY)t$%EMZn)M9$*OK#rfckOv8SrgKG8s(wgQ#o!fm^f;bk|L+wQoK*lWTl
zUCm3DAG?Qtf2u!mcpSN37~tihE=*sRAL$!k;zk#0yUk3VbM21{?q@OvjFob1Z!lqZ
z7a5ey&~@2KSH9uihw};@*JfIpv%7u1eoE|sR##7DE`G7srngy7jspB&<y0n{Ru@fN
zdjQ?Hle04X+Yjw#E#WGeeQ#Vi=dsi6?aPSM-fAZlcu{VvW0<!e(<La~li4P`Lf5Le
zlBij3FqD1A0GZ>KmltVUNf9Zo)ppH^0w)Llo+w;MhIDS<)3{BS+kSX?Y+T=T6T9zY
z!8c}p&NnU)<uGo3j-?OkVVr1E&Bnt+Vj?BGlh{nJE+g^!KGD_+wYH1tx&O_LwcxsA
zy0JQ<Mki9EH*-0Cy^im~FHcTaZlx{a-A^iwR{SV*zVFPUQ6*$nt<{Y}hx*hHBa*>k
z4_&vt$(DX@IMT@x6%o~T7O?7qG<)jEONpiVv(Bq9G&f;Qom915OP+obc5)rQW!PkM
zKf7P0baT62t<N%AfgN?R2~zMr^I?^}{aGbntv2JvJ+gJ=RFY3-h>}hvS!(U6S|2r=
zbQU_PubPcsgXvJUcJ-;BbgFGm+amB2rMv!^ob67Z`m$?s$7B}LTi=e}6w<HN9sOih
z2<BG1|5MolCtciyB4e}#7<fth7xZY|F1Ye$uIothdNPOmc2|T(LY}T`u=?og&Ze@%
ziU0Oh_lskJ3{#1&pI!@+<tdF?T_%}umw1zUn#J1sVc~Fh<tQ--%7x_bdk4EG>&xZk
z!s2=I%W`39ckldQeRb`qu(rFkTs}A~EbJ^hWaj8#eew8cH~GQL!eR2}jGUO{cMCh`
zh4R_nLHY2ouzOHg-`?9=PsU3=aImm*wC>z_>pM$Z$IDW}DjB1&vwKw7THj9WkLAMA
z?yUQ++{{C77Is$(+vNjS-Q;LtaeZt3=v+RzvVOGVKDUy5Z=tZaaB#G~biB22P}n;@
z*xNmn(cJo$*AJJr7S^}R%b$`tB;PHRPs%$-1-aV>mb-hpQ$BDD$gOoz#@Z5OlFucp
zU0y#ZFCDpM_5Ze%5HXqLRw8)z%1i6+FXb~SymfFsn+&VK-(h+GIC(DlePMZFdto(M
z<A*n><0^R_AC$M<#CKQRIETlJhezv2$BF&6y1Tn9WIuG3o|ejozZAB14~1~YhvnJi
zBS#DF^KO)cYRRvYzb_sit~>e((RYr@2M5P{uH4VZWY14s?VZBXf@^&xwBFs3H7CT{
zJvevcI%3FH%oa}9%E`}@J>Svg9UUw<ayZa-=_vbT^3{Z%N14SIcFL<;>#OCRrLz0&
zt{dod{jmIz&09Zo&#d$D(}m>A$8PzuY02F9YlfF+WorxTD}{w+DS4$2yU`MsI9ylu
zNq%~GytJm&cgN!IKe(`tR<-$*2+Nr?DrzS4GiRtJKS;ZJJ)l)wb_<n$jg^02T;ILi
zIo`h9-8=lxUj`q&Pi*XGeL?;{`Ee)c^yx%lNiJyl$<*&88v4V8H$<HN<Q{ao#K1G!
z*RU^F<HyHX8VpMFOV{Vp^*j_&*XwPW_JJ1Nq^FQM((mq}l3^+cr0Yf!$@eUYjbgAg
z+ItM)bgSK~qvVwjAEo7{8YFJ4WCB-Dna1b$+-R!dITI;k3U%7|8AXL*oCI#PKDV2n
z<#K3OZtG6W0%`Ome^#}Y(P_k(`<&Bwq`#w6Ezy*?wN>L!R4%9Mr}~;GPEH?onj*?p
z4|&lJ?K*Mk4*8SXEiIJx-ZGSoQYuEs*=eU#aa0G=O`&?-?cp}%!Xvt61G~@myNhO6
zOCK-_lbuS0YPV-i3VS4Wg!H2nO*U`WxD~k#t+ne|C2s#ab!|BApmBE(Cqxv>Qs(cb
zP*6TqTuH*r$S?mzf}fJVxR<`%G^#f}b@og0J={;Vp4Z~<qPX{O%J}hG)Pi0&AD01k
zRg+OyYC=z$x~n%;%Pw3tRNtY&fNSh>)hhg?e_@EHR<+N0!Y}UEscnq1(VIg$o_K2*
zC;46H-~Us_+EV?e|F~Kgai`Na8)W#a^s~u;4uWSucfPO~`Ur$OX&?A?GVVwAemlNP
z_zuGugRS0bKV9EA$3gWjd%luglCSnH<61kTcx4WY?7+X)>Q{|cV#St|JNfcx?V!A{
ze0g}Zu(Wx3xPDPCeCS6*+K)1obyrX<Zn|uYfkO!dF`H~<{H2u|`I&FYqLL-M5oCoa
zmYa&oxZ8b9n8^L>m)tK>6O*5Ii1?SKyTAX^W0TuV7twT@acUvaCjE2#h?bg48Qo#W
zS08Q*zZT3dh1<eE3Yqhl{NQhY%i_-Y+r!mS`0$th4RZUR(#I|Xqvo!H{^QvzWa^jt
zcgXN7y{qHaxyIaevLuJ?!@x7CjFHFk%@18dh5EE$ElImcj%}voSfiWj%pKRL0b?sU
z?g~LEL35kR{M}za{xbaAYjMA@nLIW7m);LD?c4vQ|HJ<7Crj{tN!$K@X+Jh4%-*%V
zahrbFZpM$vf3Gy2>%G0kefpt4#6QOIfA%{+{aWxxOujQb`9gN`DOnGaH$(u-@hG^!
zT2)a#6;8$cfa*YhsYuD3A-3?Rz9^wjrWkYWM+ZSTF_4I!p156K&b(geHyBRtjfZx6
zhh2U8nj_E?P|4$RmVf&AA$OyFbcZp0T3VE*{0vL}MVo&>v2lWM)`>vZZr)7i_gP79
z;O5VTrPyU*H2RWiF?T->J5pSqgAd-2>m)resV*r8CM$}ZQ=})?4xcLbjczi&^xkzU
z#cW~VvivFeN4k>auXDe-3)796{Od#JH0LFZLjkiA#tr?S`lLJM3$@x#yH-Dn8_f?r
z86XeMy6^E|_TbC!{`R;0w?xpm9gLg9@+tet{N$cm<EED(4RUBJxs_Lv+t86HcSGyH
z=~bL;dGgICS9JZ;r%x%hKF61$AG>OPoo=t!_kwE_<K#MdVLdF(5xcJ|31I0!B<cY7
zj?&OQKVrL*-Fc-S%?Ed)+gBgh#J?5vKRF5?li@z}rk*+hWslQU{+g~+g+j6<=XsGP
zxKcE`|N1Ze1L;W8;7~S_L)m*K`Oo~3?0-vCl!oKg<P*t%^gf_d&9;+Ho=BKNpXjqn
zpO>8!*jl(azg#&eC)OMcHMF%$&J~fe{#Ea0pPrsMg4G<YYD%V|*(@cNbop{+eQW%5
zR$Tq6|EB5m%Hs~sW*YTw{KS|*-bxTNB@ws-k~SGA)r_uPB2!oY(!YG@g4{zeWt;|?
z{)#?=If}xc@Io%8NS^-f*X(_e<-3uRI450aPN~ZNvs++#9SQ5F=G~Xa-tvBIJ^-vh
zQ@_p3y1xzip(R8ir>&@uM`oB#$%RK0@@(>RW}sT5b15`Z&C*p>*H!?Ig)av~7b?kP
zcfaIE?(O(=1NTZPzcp^}m`yisPlS#cx7W`)8NvnNJUlI2N!72HG{7R$z97|9?h{Lc
zwp*KtZRC97AJSh<e<?Yas{4K6aD8=Q>tH+451l3A3~(`Ggb~F$9l{HekM`A+YQ6Cp
zwdjkB-m0~)3tUh={!IR}e*e&YNhtK;FL3?G-dTuiwam|F)7fM+%5+J|6ZdiF?nCm#
z<>J=v(xz)lu5Zb;{PC;Uy()T$8@WdbLEhV+s=DB@AtZf8^+PV^#qE{5><d3NTbWQU
z)qk7q_CtY=(j2f(A3l){aUfBTcqtX!m|OMMb@ygKeUO-&A=N9VFgToLjJhy8hC9+f
zsatoH)|IShFIh@@mG``K;up*<pxIJeXT`bO1{csD8(H6M&HX0fc)w&nwXQDNFNMBC
zwp~E88ExgNNBGXY<LvSN!hRB8DjG+-HK>U=6`d>LQ)Ug*YE(J$s9Q88QDO}wR)Dh}
z#L94P4iLV9&E^jIbwET8?lGYSdi@PYGz|{alZb=kq_AZzH5p}K32w|Ddq=Lvx<FM<
z>4{t72g;4)oW9yC>Y?FOYXySDdJ@Qw)NMzQWQKB(k`GqnWYocd5{X<8iCm~97qJ7q
zl36%>%ms?&D3($UIV|t=s6s$m;V*y551;(u<B8c)UR+pSap8FVpRDhkENp$uz4E_@
z25@SN3(ar}V)v=@%g_UHw|(EJt|rnglR@bihEo2#Hk%pZ<G3*n-xy=*vV3sx{<mep
zvxu|dmqqIIC+8@+bh*1Z$UW(ww`Fej&x~tr>dpXLECA>3N+x1&as;6J^GEI{Bg6RK
zL&0Qa`EUI3)`9A&0)r&US`;7hD*tqWhkLG---nq~(YVsk484{{YpWk~=5l}PukOnq
z(0Q|xY0F8?_}U$B#n2z?jjllD3JSVwYSyiJ1TdeKqyp*oMWzPGNK}k|Ao<_$b@VZJ
zgr`?q+#h$7EZ3XviXF72o2@Z8n*4fhE>DHyRz<H5!48<Ui%}9vpC<D>?A9N8K9z(R
zaqDH|#ARWX$97yxG{qqpFuMSOBLr&_eR+a2C=HVVb$4KOdRL70OANb#Qj8;I&=Kz?
z7wvoDjO3N%mL4MR`+x`cteOlm1&FeqWw#;E*f2F_H6BgTHrc;U8vaD&QqQ1j)t|dP
z4@WNu=o2abUmA+-rDM54dhQnGX1M^}lskom!-c(m#9?L%=>z$Fl_hk#&XbWjD*XsN
zEuxg}aW0fG9T_)b&x<GOmR`bzv`g=odN24bb*{xZUDo}k)~0gYm-geGJDhPphAmM_
zaqEueuz?ftPhc-6gWUszaN`(#ci;$4(sn0)_K)wt+nWt_`=lZHeM4LD;kcC$u-dFA
z|90Cju=|~x_EXb2Jk^_9!!{FEXmtPTe0Gg)qZ$i?b-JpTr^CC`Blv&vpB;_K=?A+J
zg(KW9o>mz-`KGkM%?C%iA17wgVR`lBV-M68r)$Q&m8fX0AQ)($^uq0>A7t6JlRVPt
zq{#{Te9jByNQR-?$vLAO<0X2*Y|okW9$4J5&>&#^Yj1Bm_2$)wj~_=EJ|o^sl*S(8
zIqEbA9vE$#xq+NoQ|N#7w%uqAyo=*#G_daeOs{XvEcOu{N2s1c@vlGDocW80a~4XY
zm1ba!Rorg#hVY<bHdYP$PSfpbzM<>%b~|2S>)o{f?7;Q^_vgF(8Or~tK32WZ6@Ki>
z&pzFJ`!^=$e-x8HUO15d5t(A}|MEZnJO2D@<ErIq2VE{5EG7F+4}rDI%U*26&@bGL
zyHF73=qb`SE@?BlnR)<H+<dr+6D_U&*r+<OhV4TZ$Gz*#Cm@J0-(L&Da(dMzW<cS(
z@wwjOmjx|K<1#3^p9=1wR58>Luw?emxh?2w@{Fp6omq#v$`=_emiT`cQRSY}5MG^F
z^0$7Byw1ZR!2?rBY{IU~6-euHYJ`gm)T#-z$RbJi=oSd#%jWI&j}`^Q(i~nB9=h_=
z`wjQcU@LI{vg=Rsuj_O9S7_Y7yz@x@wRPhDW%gI4puId8?cT|Qw=#%bF1vq)fh)x`
z<8Q3Ff326?KUe16KM&93rPhi(y}6wH>xUUzzmd20Hs!55sp0MINNsF$_*ov^l7G&7
z@~;~i#jZ$ej9|&iYirUK#>^kczkGSpRC)4D1_|$v<zGwkr1g1nTSk!?{V-FN2faO+
zLU1P&3U}6J(mID@nY(GpoVPFJ+eaJnvlt>=2z^58{)Y=f1Z%4D$gU8m`NjP+mgmf(
z5He`I%HvzlGLhgwNN!K%Nz;_=fYw2)D8IUM81_u*Tt<w9TK=Z2$!qP&&pe?_Xk~@r
z{Ia~Z)|L??S=644;ot1YYul{wYDwN+T9BE<pXC|bSd{k;nlcCB1b>}Hm004c?0Oi=
zgyLiQPQ?l-P2iR_b0A}suH>I5%%>(j=z`dn|9X`c@8Pa+W<|bL3<8;mp<A7ID^EsD
zq0*Ai*mHR_Z0@>$Eyy6I!i=|I#+Pk*Vo|1Si%j`>L4LShkw<))5mYnxLWP~*<$<aY
z$e!HGOe#{}cqU$!j|!cVw}cf+tFo#0_p&G}Om975xS-hOOj*uUkuwDshNtdd`@FUV
zo3H=QnPQH?EoVyh$ZPLFlYN<GC?AM+p~bC?V(XA(Pe?NV%%Nh#tn7ea7Lr6Qp;P5|
z_Ic%jQza+A7Q*fGoczN_SV;akF9M@-(1uMKeB9^BZ5f4;jW17n5u)Wx1_|%?IaLgH
z%#$s4d{gLKWxw}gnb4iABivyd7hqL`kk}OxNtux!lG7-gWn##1Ary+su-O4;=Tz3}
zm1IXCTP)9+MIm}+NhT6s!8@BL9IGQ4<Cv3bAykWlddETClY<&nnaRxt=ZZC6Ar}rs
zE=2bTi#0jZCX!|Cec@QKsuF8lz2#WR8lx>vO@n<oxM5YodcwrsF4C>`nPU~oOrkb|
za6_2X{4VQ0V2rjrspBrdu}3`qisaZ8=B&uK%z_N@D$g-$xOmN(V!r1{^QH*T1sTCq
z5U=K5NU-z7q1xb3L5OFrj%`@;vyjX)oGIBF2o^kWPdy<uH-)e5j@&UzGKBY_*Axt+
z*A&P8HkNtVWw<Dij}<S3!`9_v=8;QLeiW7vG7<OHwXm!W<zux&VH>|B^YJ4&)fOtw
zL&X~r!<7>I9tjoAO_39IAv0N#qkf3IZXsnhg^qzI5<1+I#m@^Jy&b;kU2`%J7k9{j
z9T-HXa4ch;$;Y<!PLx@hDzmC^_+{XPB2^BCj}%)L9%VkU(6O{Bg516cd2ACQ40Xez
z(7-f>K9G7*o;yXVU$7NzIaCp}wFb`Lm3jEDEty9+4->6%1R`0Jzk=+$k!`pOIZa&7
zhr(^qj&Oar$rAVEqK_cfrYy;8!O~^f1-lpW#1Y2=jtS&MA8g1>N-d5PLaWA^-{*L5
zaiAN*z%>y7zw3=Ci}ITA^s4Yz7;bYgPzajB4hzp53>o58=*MKjMKr1}Yi!J`JQ&x7
z8!9q{Szx|xnUqdufpc+$jN0U`*%7W>l6O4|8|(-L?on|pSB=M2^9;*vLvCNT;>pf%
zbcNnZ=PC!{1fE#twSZf6Ll|(KTXdgYlHsFW<iss+UCSofN7T25Y>&5vfO_OQWR6>$
zru7#HvLXZtmP#BaRMUIJ@1aoSK`0V!3zh5*dt8V5dqVyB2ac1FdPOLAD33)ggwiHM
zJm~EtKRlC9$*75@C|~mS5K4C(@f{IBw#t?8S+7EwFXNieoRlhaI)kh3g{#7fkRVuv
z1Wh3iB#VWLW)ac;0t+`0?co9k-k{g*u5+AZ3m4_dQx41pThYGZEXjp?$N9YCd>*1P
z%(Lh<bcIOP<gdtas0Femr6PB08DX&J%S>V;Tv6E<zA<}T@IvC!Er&_?ATTnmn~GdK
zQCsAZ-GDm-uBIJM6Kg85!qp0=33Yr6LD7&WYa+b@Wa_K%G{c6As3k=iB3MV4YKp}4
zPh}ORB14p}<gn_n3!IB18Kk<0zE_uXY>trN3woS{2KOi_mP6=0$wY!pVKciUH_MW|
z?OC|uUP$hrLGtP%=LyO9%<Z&|^5Jt8!tPcSmqSR<f)O@3NOg|pp0LmSJq-R?CQ_F(
z_JCB}-sD)w7<NTAG>jnl8h89Wx=<*y+86!}OEO`*F2~4T%cQ~s*<HUOJaP+f@1H<p
zAxK-MZEvw^>@s}6&z-p;d|&e6RkfkG&@VW<yK<6(05&y`u(%A;l<kV;xh@CpMTQ8s
z8XPAM<LMR0NhZAeD)aD9<ddcf4bJ3{h4;cE;gZn6`p{ro=mVvzdhKF&-U*?@9ZXt?
zYmd3)Te25WI@&^QXb7YDAxm17iI@gTM@cAA!9)u~L{Xb-V?zkPDkM0NF-l)JO+sQ@
zlXDs^2=ByQj^v%36|*PY9LYiRH)Ta@T=Zqx@KDS%ckRmbE7)!(k~Qtg7&R<De_pR$
z;d<L)lxNQFy$7etAf*i`e$V-MmM0_T5c)Douqo^rV!SQMASWIa*^!AA@0dArupWEz
zidMEOeCZp#423@DLP$s*VxQR~Az%gLErM#0$y6X@S$0$jU6CPd@mwYnc(M!et4w6R
z!FhrMtqgUj<`Wd(WS3W%Vzj||YI2_BdZ;r#D#SL&>4r~VZ*iQ^SQ;XwZj~UIVE!s3
zD+x~p=kkbMhW`6P{~Bgp$(PleeW8CSl#4yt*b2sA5U`i#Gv`SLX$qwmK>`A}`GU>f
zEy5%fK6(moHD%8JIo6Xr*@Y`!;H@oYj45S((2i}P4>a>nm}wOvoWaPDI)YC2n2oxY
zV<<#R?p}G&+Y{+p!4!;ZSbYtw>n3OPlrtKlUvIIh250mDt6UC6343rCHme~I_T@B2
zZG^;z5PnrCcW^56@Hb^mYe=6m(#OgIqaEbr9cN(=bpnI-Ok|?B%>u8GbR8KaoQI3n
zL@_WOVZl8;Px2t+28YPi6P2sa$klt~sxO0>B?j4%dEGyAo~}4gNasx?WlN;^l8kX8
zL!1j0p;s8+a+;vSD;LHtcRirn!Y1@+ViodW1&inlL_g<tYRZNz018#u2n;E!x6=~m
z0#;jrg|NShXA7Jrw4n#CLit&IBnzsDLFW)fV4FSR%6W8_Q`xN2nT!=e#x_UtRyZj#
z>_LEdeHDr8wS@sqC{)}Bp2DKD>rk->6%T|f{RY?k7Od(QVSBxx7C9Km2rMvrilI@G
zQFetz7C}Q|`C1i=E-nk1g5UKnl+7)z$nToqCGtSgB4Y12{yTdzj|lQsFu_bq=mV|&
z6V7uLlAp;a;XU#f@>(B~Z_9T0&j{2u7wiTr3}jLMGJ@~+iUY+dsNHd()TAlN5`q`_
z^8ia;B$H{N=9D-FtFjZpB3I@%Qfm#V70H?2L$N&L)NjLUSHfgA;^x`mP~UOo?+L*=
z=tcgftjlY`v1M4pVpe1DhElbBW=U?u6U@sUdG5Z;iQ;rT@s($+%zJszTag)?C1!jt
z(_%WoA*bU+&F^yz>870V1umPA%VtZ6pv10l?u*dp70%lgnpb29vmo1XF3)XYSi~Iq
zBZgSvrHD&(jZ1VMcC9l!n)^0fe#2{ZX1FIaoR`h^cG$rOu0wF&BM7mHbX$fV`_SVx
z<VbPu_k|vh(4!4KZj~O_XhH|T+6~#CTc{rj_w55sl@J%}U``eG@szD@${4#s{1~H3
z?<e+o3-j`K*s80Sp-i}WE7Mp6A&W7lFStzFfUOWIC_{plPzQ=t!2tHKQ}0lRcQEdk
zI1oPEzTMzFab`}C^Hu15#+kY2%=ou*NJ}S>wZ<XE(u&#~(hW3LOf-KP!wB=ulsFly
z9S#(9D9Oqzn0@8|<BSt=hT~_OMfzVjP?5|f*hU1c!JiSAlp>|O94JIv8F^>9(RWY;
z?&QhRIeN3+QS#tDVwj<<hlt)pShkR^$7)2OK6~>rF$N9}5#}eT1sHzuHHOfNOxY~y
zkrFaMw)lo=74@Ft=4guaT;Syp)@Y-hU7)MQXr@PaN$e{()vi#zB7>L(m9OXQ>nr=p
zRlP0uY!ESLACCoyMN1YAL;zk8+;L{XD<TVljybv@3)^S{Km-QBz+NE2+VJ}VlFG=k
zU*x<2GQ?cRpau2?y{Lo*yvVscl?T0&kOhpvfa-woM2uwD(Tsv3x6grWvH=Y8w&WaL
z3)g}0L=0tbneQ@+SAb@@foun`FhDT?JP{<an+Uc#nip7%4;FI+uNq(-C>8<5*c*0Y
z1<mUa1nHTZ2V}^;qWQMvpeR6~q7q<XOSV4(t_TfOI!Ezs3NL^U9HBcKa0UN`gS*Iy
zEwUreRajMC@O{JpaDf3>0AvWOu<D5%vPz8N%Ryg4C$_S}(kgwBcR5d77EgyVlW0dR
zMER)?Vxdw3ILK?sDXGHmA%I0V53Sc^T4iBd2KG5X9&m-d;=CTpiH;ys@Pg(BtP>#P
zeZZIv_-vI^6@qth%qvz^3xqcy4`5IUVQFg^K*2nxiEZ$4Iw<T723|u)@<8G38Sial
zV?|arA}BLWaPJ~GJa9SKd2q)m2Zj$9Sg{e}y$DHwz<tzF19WcjFNAGCo<)xQ={_e)
zs4F1&4>K{wDcE^s32NbB2#WGxjP7M{R(M;;4Pbb6c$8rBb+&oA%8^>*NI?X&z-!rU
z{2dW6yuC#auyr^Y4}<tBX4G+kHtM5|#z$)WA`DkJHHT0<RMmprz{dfhW3=MR0Xz=y
zy#-hvbHg2h)Yw-JX<H5{Xt`1B9N-%eJY3|~EV3o%NCaSb(DI{*^CTw&3_Pr&tDGQx
zo{>J=EYL?Q7VO-?5+W4=!6W<&_DMzwa4>{87?!|@9#}NK3a>>FLm3+g96n+W_D;s~
z0piu)adX3oLOfg{#SihJh4avQO(bVoIG*|V>q3JKFvwL9x)7rp;@SpVA})>@+#UWc
zC>&ORtsyUehv|0F2R9%%K8}N$%)<v#@b!X%#qlpk01@_BjSb;@Ji^`;7csuwN=3LR
z!o3_se9f1y74a|Q5yqEW#C2|8&{RtEGLZ=1dF383LA<~-c!Y808eF^fg2UT}wHH{g
z;V#1m>;v`~{P3Y(QON3B23h9l2QbM7TA3K!4yut2R-Zi1<w~T0DVkS>qXBeOIu;U^
zF2J{iXu&<o)r}A+g1jNFbMG0n5NE!@b&gLyf=+f5H=3=ZdEq;Uyxxwwq0k1TgUJlu
zT%*2SoWMAQ!$q#<B6NC%$?+~%(2Lc%ix+qc5xS2yeT0D(;5iTRoG+mm<2W~Xf$<1O
z_|2_{IC)0*#c%E_o`rYU;0E^3IN?>OdxHOEp3}c3PnLz7_CWLen;J(7&b&gOI+Q`;
zu3CubX*l6=$ou%0y%rin85;-(bFd3HZa@W`@Hpi0+<W-VZ4DbJ(7Ogg*#;!X36DeG
zUl)>Z;O|;hFqk7^*@k1@B7lm}C1RWicnS!f3JIPHI?V91-iNY<61bG8&R5u`L_FCu
z=D5wL7deQh5QJzYB9{np@(!TK3-ll^EL?!LMkx0pLlCz_gp(oO$zDMFHf~nC%wGSl
z7ZkVwu~TMWw@E0#1ne!NTmubMkm|&kd0QL|LemIS3rmD)oU6_U8%Mu$p3qArF3jnQ
z5CN6t9!9=_K6MTafnmg$dBlYo;=+hii&|>^${v@>G9YnF;UdSc2$jw`piNMdQ|v(r
zc=}<cbR}C);8L)UKsZ7v1JRG`L|1_mX}lA$O2jS2w`xS`6@@xZT-cJl>k$@a2vzdW
zz;p-;vnNYz&NI@Ez%U<2jUnKvNbHnH?3BGiWF8`1=i%`+^eGKaTai&}0XSR{-KdPc
zMf6k*q+i+R#1owsaRU=%<`Eed7~JxKUQ?)48_<EsFm+q3qhb(q7MyZTh1gLL*f!Mu
z6=D*ow#YF9HLw>b`E6_)8*@mE5YvD!fHeRV7+?eY0w}SC-?f7C`&1shkRiYt{1aK(
zF=y_KFqnIkp(VW0K6)YWLJQ|2Fo6di6WpQnwPcWB4;A28h*Y{3jsR;gz!rx@67B#?
zZgQ49qPwi{+dPImu!RBJc~HqnaKp_V<XF-07U;c(iUvR=mmM%qSi)tzuAwvpH67rs
zZlE*)$QXroU`S|WZ`p}uqM8<vT>wH}TLS~0IcH!NKA1%@QngQ51DGKKv8Xf^=R<7<
zvH&3PKr9TvLJ`Cwz9m4;V^3Z=XVT_!#>e$t#3gS)7C;$7%rtw%iN%DAz+(Ui3~)ga
zI0maLcm$&Pg4)o;NNUJ~^O(KhJl+d&ga8(i%phTKuHT5k>;{f*upMw7Cg6cr*cyKE
zeT-VjRN0qr8{imd=7Yv~pfR?L_uA_1D-^GU8oEP(#AjjyYM6edBewqvp<I=78)H>j
z1Fr#rdmF-ri`bSx^7aDw9Y{W`$RvVQ4hQy~e=geya&ExU?F-XXNIt}_vOe4f2o50b
zpP>JNq+9$A;XN0^9(!;M`L1Qn0OBC$9^QruR$*KNl=8Sg0Oj#qc#6pzFnQb`!44a~
zsZp5dkP*QeYZ!evG7OkJ?vIEW*c)biO$aV_mEQmpz}+C{z+Y7xkt4jm$jMnIIC4Qq
zUc<sG`Kk*;b2KFa&nlRO1_T^5JggF&a>7A<Mu!BDH;S7Bq8ku!(C`R6-g?Bd1_1IQ
zfIPUl2Oe)gz(K>qm>88KVx?YTK)emUkzFrhXaIq?k#~>CyD!MQbu7oGh)!U0Q$e_T
zFMvYe@pcvM^Z@DFM7lQ6$roi5ydStN@L|{*l6+qdYs3uf27(1|2c8cfM}vo>!Irr-
zEH`ijb?u#y>1rOD$!j-4@FK1TdxgWZO33#-T(kzk#oI9hrTwCUeSizNn!_#F4Rg$%
z%FbU1zwauq;@UO%d8^neF#*Ij=42T8T4_aohj$pyZi#@_;0|o9C8s{Zi5_|gXgtDr
zhl@DTkGa*)h=#e>0Kp~Bv=1S1qx;WX;h0rcuPK6QZV*)~Fh16pzb1oh!XkK@4*}r_
z9<E^D**f;f16Lx7%PAofK2CJJ^U<!N8;}QMEX0d$#F3v|QzAH)xf9XHN<_k~Bap6%
zZ#n=2AfDRW(n|^sZwXJ~*!3*Itj|I~yu%TWX6r$uXLxg-b>iAJ_<0QuVVuKuiGy(h
zyPspXY{>!_aQ&&L7ng9G{R|OVMdGgQD`yucI=<a6T-11k{R=Mr7}_3Pb1-204b2k}
zM#MGm-^zn{^lgnG!+p$5Jk7SjtPap}iO%=e;d*@fb``AVKt_omlU;)bIOL(3!Hw^2
zbJbkoy{XDsj+9Jy^5m7!v7;9v1`#fFTPDcR>P=JOr>FATg}g@a5>ZZum?!(fTU%H*
zG2*4Gx1nqy(MyY1MZ`SW3j#ySLYH6<f*eB-;+3}HRHB?b0>gqkoLMad#S-GhN5m4a
zMDUVNe#SA>KZE-B==Ce?bVqL|8Do>JCN$0J<ph7<T*DxB`09bXP<GlQe990$bqGr^
zf$)wcEhDA_f*J@i^V*n{8k>e%2Wjms<he$JJ^-a^06j=(*bg(yveg=>Rzgm!%U%$z
zMCek4tz|t~UqJX&*y4B|s}Y6lCVYy}CA-A2I6)o2><b8=GAHCEEvZx`Ua5^DLu8mO
z!hq+9o-H}M#5j2bh8g0O{0kJbfV=z%Iroa3BQ}gEr!O)DA!fvz*%~r+ADJ340lR@F
zg@NXi-BOD*8G%`?;!8L{aU)@-g3)IPPGdTTFf(r({gueDm>ir4^4c{FC?dmz*3Ki3
z%Z<pe;F#;l0=p`G2@SgfFePTT#q92cf>)RzWzN{0&}<EEsB@9;As4rS9&TjDW#NWB
zbsMe8fxCnCRzMyi%*7Hm@jBOO2u!>R7SIrO*Z^I=1`9YKVrv&O=vF4Y3Q=oZ5F5hp
z4N&MBxWn&iY`${-+NkTxGDuOVa*o7&<xnl)wOf`m6TWaxw`5ieGQ^RL@QQpm=UWxf
zqEj@uGvv=bQs#u*l?S$ETS%~jXj%eV_F>yi)SVs3{Ul^Okujd-xzYjp^8+UPlZ-*8
zRS~(pMfCYP5LS^DhuG5VIK@iXc-I8=;*4nnIc%^WH94Na0+7QkE}UI}i#^nXx}1&p
zNWK%^fxwj6RVxdem$lpolh-*7E1bi5nSES=P3;Qj=un<4#j>57Kn=b;c?`U926(g0
z(TMQjlz>mSL37V!jH*2N8K{eqY>Q~UJtpdbknP~YxdSRP1~y!P2(Mt(yI?XgV9b%w
z=|u?HM2$P;=;4fsWZ#1ljI_w%Je3D8u-Yv2yOX!pFcLkibW3_b(Bihelh>|zZ3|9X
zV-x0audFb|h<kjSdEdws%kt?xrq~ejZ(!<OgKi%{)DrN`IoMf<zjPHBT4_mmy1|n*
z$p1SIwYp5?=3IouD&g%lp*};IS9z{_$D|Aw$tzpk239b_zC~`8CUiOHV->)qQ;e$c
z1;*Nvy<Ct%ju>NGNU(#}yoBS^hdO6)@jT+>glJ5m^z#;n3ESUdZFzDM;(gqu1{=mh
zNbGUP1V!c_ViK>*qHbkpmQj4Jk%n8G&viTwHH5)FTX-wNU|o**wFuNlkheAn?FN#x
zjM%Z9!A)7x4dChuf~Sr!+yUFZL;G0a#2+H#o@M%*LV-FmZUxqy$M5s3&R%rr6BLMT
z@=eZ=sJ=XTjFdY=qHb$w!XDDjgDZCkGPo02U6m(4<M&|(w#6VZ{)Qu2?~4$ziRIE2
zDxPvxymD3S0`e}xL8tQI1=rFGfg0wNyBvf4oO`LM_Yywa8~FPWZ1@T!<V=2e2h_EK
zoQULWm1Q|ZaV*?>1vFfiT`yIH-fIBL#~g~iN9eIDbPO)!*sY@07=-VJkg);M)q<Y`
z_M!y8u7l}<6s@xF4V-mbI4+8i@jw$*kxW}WSp*nfM5w;vtvkojR#6`uIcOGO_!waL
zNWRC&=ki=B;tVdpBFkJQo3Q>4tnYC(fm60{zi%R#ExhlMX&jz0*gePlWD&lU_qGx8
z&yezvBkv3QUy}{Vr`ueu8<4366YT>l-wFq=3ylF;uE908IMwSoHiIvmi$}c)<y_p#
z5Ou7M6ZqwxoUdnY=N0bbL!37^BJ4JWEmu&Q>&W{ZZt*)9y9~!#S>C+R?FQGGImY9r
zR}&20VvIdrev+Zih?~7bWPIit#BO~i`j~NT75wFj^RrFh%^CAO<v61<G&s3U&`i6C
z3RRRnzTgslfjCC!cna$D3d`*xjbhIGk!;8d{>}?FVoi?49dE7hR>Y^b*|-~dtIS(h
zxX#R-%yEqy?3g+3;s4n||Jsy|ykd%FJxoH71_W6KuMc3qT|oQ`A;>Cuku~ViXmFSi
zu-CXd4+wv=B?QH~kiSL>+^THQD_ebz6t5tqPuZ;(wt7n*ToCFX$;Zy&s#{!T3&iCv
z!&R?vRhwBI0j_i9KBLTSqRd&8IZsa@EW85=JP|b~n2p;)ZwO|WxDb49-ZPHNJ-c)w
zWPC#3sBtv+Ihwa}G}l#04Yc}%e7Vih+(1b!GW}4<KEEfMdn;q;9Y{RFm8OD=Oo@B~
z3mOQW8xcC2BDv~_IG@$cqkBK&;0?>jI4kR$mq&^%d0_<!SLc%7;pV>siQ7Y2^Mnv*
z)OHB5d5>|?>9vIZ)Iv&Dv9GQ~co*m8k<xw{KJ{f@$B6F(tVQM%L8P!KdwjuN@gib!
zeuq03J)^;0(Zn?rqlq4IF}1mvF4zjgHOR&E%Eh#ceHk=ijTbp8HN1$c9Q1~4>jr1^
z8u@nsQn3rla4U3NB?hwwHZ99-AP$xR83M@I!qD3U=d&OK_#n)k@W&dsV;!Vy4`g_o
z>-$Fdql_MP#Ti-?mcQe<&)Dc4B-jmS;~pe<1y~N^Y;(OoW0)>+zn_$3A`yex9ZY3U
z=y)Q7Jj;Xk0L`e~;W10P04Qr?bIY+Qib8(Q;d(`xS^z&b@W(mFYYSq35h5N@cIB1R
zbq-)(0YAPL_E<sJ@L1&zNmX|ut75D!YgykW&YB%zlREe83gF{BsMZ>Q#1-do2}S!x
zn6bEx5rfWljf3n84r%~~u43|s@Z`EI>Q+wCH7dli9DoW|+|7#&6=31neOxtF+0Jz!
zE+bEz0xxWU)a(La1_8brBW(JDZ|;I4dn#Y+;?X+?7ixl*FQVBLk!o9DAuoK*hYgpY
z!81tHHuR~Y`kesg+~ccR1JgCf#Ae}j3GljL#|3-b8D$~)8Nt*cYD7cc+JNbccsVhx
zYzbB21s4zGFA6i4<e$Yh(^+PY0nr)3E;GNCNv^Wl2DZHulB_`zOe?zwU0bqwag1-&
z0+9<<OAB%av9N;A(7(eTV&uh(GLbUmzxsU!`~idY8C;RELLaT^hTXo$Ig0A-5d_~N
z5N8wFU^yDc7_iL2?yysy2%8fb;~YMIWuF!}g@!vfypWBm9Ha6cK}jL?t2|i3zOWTs
zoYx>_hukR8+7yu#j|kT~XVkL9O<B~9obnZpXdQXDLps(Sc1(DMJUCqDM2S@0lyhE3
zAgq8}-UHpPAx&3-oI}pxx*UyL;$`F?NFFTru)!s8gqYh$%)QFw*FjRR3CdbVQnb-(
zZW$!t(lD~h7i8)MGS$e(PLZh_$kbg#<su4F5jA~FjV4&`RKC_lfS)74n;M2t#kp{T
ztKlAi?F{047CIhtUp#YPY(t$ruBNhZ)R`KC*s8|_Wf6w}Wo=8ZCeHjVSnxh+>NU(5
z??Qgsz&yn$vjI#|A{nJBr>dsVq3ruSn)e3sZk2;^fN8d^Wp{*-WuRam`MV~ByhFJ9
z5Hk8Q10=(V-V{n+iPY%e3A&SS6?cda_W+Rhh}~o?y90xGvKz%cdEr?;c5gULum~1e
z9Fku@&#X@5V;(Hx%_C+4&f5|Q@`)zHa(1`i{UY}h!fXp1=o}h^AjtEmco&S-mM1GR
zMv-8eU5@iBCw?FN*pQ!C2clfz2+VV?*WkA+uH-}1!5d-xO<Bzf_DmfeeMc_ncmZRf
z&dGSt%TP|njSO*()8z<$Y2$RcRj}-c6Tc6i-3kk?3tKMBGWX>c4z`e24LExh77AJ5
zx*X?QMmPm7(%T95S`+cG$g%$-LtV(1b~Q?+%T<V>^NR7>W@a%)ewUjN58#EK3hZF+
zm`%;DpiB;SSLn$OpCO0uIPks@`xuYQGYq$_5r9?nn-eg#d(59RHey4F-{8Gv-U|rS
z+GXQz<+WAvh-$pmkU4I!&#Rn@1F)D9>czTjV@;vMBM7o41i8bx>2m}l6zpwOgEb*Y
z8G>9vkh^sb6NIiqeJqTi#nx>K^{<4e9U0<TK6TGNKj^(g(pkg=tm@&Oh?*1mmN$=A
z<p!N?3D@Qcquj7{_sr@<KIRFtyu!ifP@sZm^BRlj91h-sgNs6)BXZ8pIWDh|ae?!0
zPzWwKE^VQAMaK9-h8rf7J>(GIh>Y7LVj)sA4;eSls@G6d>j(l%48fvo%nbt7JRk|`
zIMlEJ;{|+4hRYz}V!ai?vo5mhn%Dyj`Jheg!L8veakYnBE9(Rilw^g%82iY$Ekr~^
zgQ^!<dr_XdkWcL*P)|XH2t45PwuvB(@gH=#1*xTU2qBDo>y*F)?7s^3Uj+jy^kj$6
zsO)v8x{xOv<fBzVTH6A(uc9@da4+3+FP*U!K9?ZZ(lgi6He&LYBhm&z01PO~v;Ytc
za6+(;m1MBD!xwH~un8k*zzoQM-{jr~QLq(`>M1OA#sz#2IszI1GT^gW21LOwae90T
zTY<XR9k3YSfD>{ep1HR{U4jR$^g4OaEwm=ki7ON;#d83D0D)|o<FkiD5pW{BkwdKj
zj>0+MKFlUu;jBjL7AmoA>%zVuI00TBa33(B@R}oaK=Ghmw5AO?kia(vFvq(Pf`b7C
zU5@JSDp6%YKm)-Vr)L`u2_mi=;0gbp%N0z)00#gKM4KE|(22?`veBdb6YzuwJYm2C
zd`?~XiW2;U(<kPb90_xSBA5%jAO=7Ha3Dqi1SQbcMKt79ArL4+$;#KbIshkvE$p3h
zIY2QyZ9}T)2=X%n3Iv4X0Zs&f6X6CBRaoOp?t^rI{1kTy8RX;{Fr8or+hqY-l(B0p
zd<pgf5Cn*0fOIU#OI!gKKH=^-1jUJEOE;;L2)b>+x}$(74B+<Qme<<y+WfYh7KO;0
z%n`8LR;bVk-X6X%NAPw7Dh@*K<4N%FB-kYsLLYc2#Fb$0p$WJ+7&+*6=>Vnffeom$
z0Vul_qqmdrE(p27E8(@M4aZQGTQvy*5y0E=WfT=|H~1xd)$LZ0n~|_g0Nx(n$adn*
zFzVaDFM*FDyyj9lP-~atyG}(iRZfN0r6oCt_$UIyp%3sbSL&b$=OQxHn}Kh`RzYxl
z!;#{;1o1XN<G|#>8mDv{=G{Z&c``5%x8mI(<DlfxCf8{TjoHRrjYlGV6yXN%UX%#~
zl83JdpIrplB22U@%T$0{;cjqoFmn6CnwyNV3gi}&D~V6y7O9GPf>$HhLa3f&dDjr(
z`$$B568I<ZWSC`0-bN|fU^~j(7Z%Seo&@|8K8^%~UnAH-BfKNiEI8qMI)vKdmY9KJ
zxH1fm4LgsscnxO*4rIH<*VJPRxPYIxjrm<cQk;T509I6vxifLt7BMk#^Oho5Y=L|I
z2xiAMZg(If9$UP(&s^S{IHs(S@#YGb!x=-}<L1RPj`!BbF>dhs+9mFFpHzqd2Xc6W
zC<j|GINc5IdFB(YAT1-5ie)sX7-dEM>^R*^6(KpUdRyi?5f5^5KcPBp2<xwsfG@uB
z<mlp`htvVSaT~B3C64nth2tnB0PEwNFX9;wuhGR0FgWqq;=hgXAlnw##vZ4_lLg}F
z-Nv9YxNMJkZVd+ChO?_E$)EKuq|D%&o(s8Nap2k)X5Yl5Swu@-l^I{4K;!mZl;?2Y
zhOZplU9D^qbKH-FEnm=|@%!RrH@Mt`HVV-OB&wk$?Q;h3&Eu!X^MJ=aETOwLkVMxU
zibuT&<y*H{R5;lUF8AOb)8&Sfd&O~Hf&k*2pMlIc*$>g0aEphy#ltcZ#=?_0#)~+{
z2|sG%1gmh|Pw|t5FTA$J<w?|%zbGRUfMf_qvJ04-M@;bo$+Sz*IB`ow`Sdf2!6vfR
za@>z8s70KY-GLqww={DCJ$wSa4Dm>I3F+d)erFK>9^w<YL=cl9XpDiw6?VF#*AhE-
zBm1b4W*T=!&=>(^whUA4VPOU>(1Tbgcm-DxcxDJ1BY-S09KZmfv5PvlAuLR!nP-qR
z1dS0u7G8r893Y%a2#Ix}H<4z)EB-({ROre2h(FR`B*K<_y_L9$TL{uBz>O~_qDVYc
zX`j6%Zt0j3bO)d^MI`C78co!E(fA_?Msn4Wh}wWpURZP!sS|K#93kWIIvC=S7Ue-=
zn8H^?9FbmO4T-vsL?s+bL&!kU&9Xcgv_bGTw0y@ks#i$y#69X6${={FH1Mn>^Nqpt
zBghm+#8neD2F-{xEA6tI_uzLoToq8sT6mIBuVRacVS>#LsgFdYS9nM4(=$ix9y%%>
zfHDb;V89fDLtsvynrEOB7Ib1s#sC`dTWT~>e+R`oJjOQ^Uf||$1CR(HFatOMim-+B
zS-_)g@U^}mnYIvh-~mT6!mFBtSUMGeh%Yim(B!&k2o)8;Sta}50Q>*~1*aeu2T0~!
zeA>4{MnQ094%i5AA26VB84q|sHcksS^QN$-;x~%sfVuzyg>^y)_R{+np?M|}sjU7{
z0G2bMwo>^De{ctf7H|O2fV}|k+~pn&WWG1ovh){jJ^+Q7b4cN)b3$&K7%_GcG8ZWq
z1UO-U6bx{HkLNmk#^<}L@fMto6LQ?|<xsQ;L<SB38i?_qSB^C75X<IR9t1-ug&-jy
zI3DOku!DxYDMu&(ov;=?5O@L<2>b>x$Ij#NU1PpiIJFN^IR*EbDFRNQ^a17sTfmMl
zc*(+5jz)+U2<`#|bdA=xEaa|W#ofH%VOU1*+m{DRRoPA;AOp5-0J<wL8k)z=^2}@Z
z@|q9U?%@>jf!aNw_Q1*pMP>4?0NX8K`;rU-J`S=C%xxDqf0$JvE(F_#9suHi;{e+w
z><U`}_W44QnV3+qiVubWB7VdexFd=H?Ga;zA$wH<S!qy3lAT5cH~1rp0PW#2SY3d~
z0BR30@bF?BXw6ET2skG~tSXBSAvPKzL-{eQcOdd|LC&BO><Z?MI0`rsVhI(SfwBgl
zhK<p4YBKN(r}F|QnE?|AAGa4A&s{XaMMzzg6)Lz5)E&!nz~kXLqM*qTRf48YsC#=a
zgl-{rfW(2v!)L_KwpuWI$hc#95@@>=a<hPmgO3Myh`1Ia&V%DD5DHj3o{1GTmw0Xm
zzTS*DONj16HV|*bCh`;?#sji@o?wnO<mf8F>LE7@&IlY6z()8pf-R11gByDp{@LeF
z!Wn^M;#x0TBt)AlY2$1LfE(`K;aj+Bi@1()@RkmM&M?M8jIo$N-(Vief~yv{Z4K+L
z6u>!4VD>8rq;;sc1r>4C9wEo@@EZKRK?oV~iia1Bg<IUiEso#T$0=^`_u2*MXcWvt
zM&DAdjKExjzun-N$4MVzjM)GVu_f|?s-!<G0xRQipGWWBfJII@76;53zj$yaN4Lz&
zxWx^gd1xIIsca+m1GjjHTl|U$hcXF=2Df+-w|H15mT8YsFyA=U=R}b;;kHG%s3<E`
zC$GAEao6IywHGk>E}BA&B43kZfsfbQ(5oMBEuP!pj+5I0;@HD#IF<vCi`Tn@2l3Y8
zxecEQBin|xtK9u30BU%}TQUUxb*mQ>f_O~}BVTdu4>_#3<#EyDUN<<~BSs2w9S2Vw
zj0e30MZV&pzeep_hQZr76<=Yw8pnA7{Ryx9IycO+UV}o#0Izu1Kp3rZ7ld%-I?<XX
z*$KjrJffijqM^cLiqR4cWp^}a90n&G$`F8Lh(@wYc=uPxjS0_~<~#?AxFuqk2thIg
zB-x6RRgWPg*@7fQE*)VDVv7=wWEVK|2L8K%{B6iDkxMgQ2nRI;jS)Z=F0<Fa>(zv8
zzm>fv((C|plAy5-9y^7t4w!EV45uLv5@=>L?2MQ(rPvib98vTqAkr&16DBUh#6Gkk
z&WixDu+D+Owg_76-KOlMMw$_KW*1pH_LIgRX*3dXOGa-d&Sq0hm>6TRCZd4&qtc-s
zL2f|~F~(m7<1ezX9-&@7p<W)LUh^34#4rVS$ek8)C*r)HAm;87b7x3ZL)a1_Od<B4
z-Nxj+LaH7jRSAe9hRi1o#p>k*hpz!FJ?TYA&D%xU8bZj3H8Vt>Rj~fz1)%l_I#up8
zR#fOi2pO?vMIya|HX#PD!l)5svLR*xVPifiJIi_($`b*hUSUIP1`rtwKpX-P+cQEj
zEC_M9Bqyh(m9RNDXmW%^hs0zD#AI6_;)uwQB8aDH;j;uH)`)0=%`FhIC3rd{M4<@-
z?_$>(Kw=Gv)^Kw`Vhczd90*NzwS=l19SvItBer0~!Iq|JVYGu1d!WP~D6z(^0}@+6
z;%FBqcc{@I;KUN}KH~!u6S%HX?101(Bnv@_twz72qWZ*}LnH%6Y{7^v@#evj2F7#B
zK#Bb|@-RZuA1n@;B2EHw4>U;ucTA<F*_Pz?;g7NSV+{Tnau56$4PRk_xMRXa_5^=S
zfImjuABiP_J4TZf?zIyH$Av(lm>{AGnH?Vf7!Q98ISM5W4#6E0Scr!|CQyHjP^(0A
zh=)7I#~l-r{t&4@#^R3&@yF~T%5cYcxMO_WF(K&>7JrPz9}__~=w$H682mB*x_0nD
zdnDJSf(Z~4NOYhzY;nkxhzTLrB#617)ggobGbT8@rOg`932}cK+@B%tPmBB0;{J>X
z&MxBrH26PD1ceY%9pe5B?kG%Q@qdQ+KM98}tq@g<`_sp44v9Or#8g|{pTU7_0scl0
z_ou=ANl0}})I<gI-D(Is4p0vVsCP~jvqrw-0JS(kgDs>^KtLTXP!AWVzX8q(Mu`K|
z;sA}9P>2K6;sEt<fD+U0V>uiApBDdT)IwDZmN@$w)s73a7HVyD`57M23bE&w*mLp@
z48aDLU;|4ULb$6bcPyN61Ckd=JkTrzLJh)2s=bE<8(4x348aCuFKFHYp$3*vgRlxp
zO{{^{>;+khPpE<B9S~_?i8KfvG?RhkGeQkKLJgJ>t{$NVKA{GoCPENvV2L#dS|S-E
z?aqPFB-X&c(S}yYa)J#k!3N>H%!?co6R{`68u-K-gpc6Os~QbSxIqN1$ucp78+e2p
zkUA2?T(^W91cVzz(E5OD>UX`SU~;sExW<i13ate+j!2;;)%8q6?g5Prpm79fT&dt?
z0yMT{zLM)&BACB~!b<+C1v9oJu!coVV31we)m9X8#7S8te>K!F^^5fQLPxTLeK2FA
zn6X|{gu(zBM+_W-8Cx)8@{|1yt_2Wd17ci>wAdVu3=)(rps^2VTszb#A{>!`#um`n
zl6M@EA6!A%@PLgCurZm&nsy9m96_^?{9sGIvIlAmrNbs%q^aV#XBLpHWRz=qIlh??
z-%LoVy4759oHL|~lThyCnz6WM?1G*Qgci;j59bV-;+j#8YsTW539ON6g!pDGzL_Vz
z5@mgwQI2QE;+Y8v=C_*9KQ9mNX}1h=_9IRc8*+$u=Su5$z~2lUX^}ZxGajy)8U}>j
z<6PjIvG`^pNJc)t!8haKo6(v8`{2a*W^6;-{|L=~SLrD4;+pYs&4dK++f}WSfd@1q
ziB^(UXUJgnaDe(aKtpn91I?ku18T`&ZE3p(HV_Y}`K;F=b6iuUkBF{{ES}JL)6{TC
zT%aVrT9REYE>Np!s|53twQ6=r0FviOd=1GCws=6p0Cy5DP|}Qj^?;)L-~hEaK%-rx
zyCu`u;so_^g8Dc?H9PrH??RNHEuznt;8C2Q9!^k$6BN>V_&_Z_&<IM08of{Av4<OU
zp0FzNlQmfxCujtv$qm;;aj>Y6NQ1D+;nW0kVhwy^4e)=LG>)H8152WKOg=>wP|Of(
zPyzKW;@daG8dzct0;`8m)9zqSq7BF}_s_Iw7jlkZgRqJljA#Q(v;j%wz62Z0kkIcF
zY7i1?V6RlF5^E5Wt?m<SU?NS?qI^hzc22N?CD@>{uTU_Tls4wr<2;eDEJER?!nLG{
z_{17S5Svl}Mq&*TUM1MTC)gki^)iIv2selzH>Cim3t&Kw36ZwD@CGr`7T`DtWZuM5
z8-QbiqKS|W3DLGM1ejY5rY7CmKUX6PT?pvdKheGpU<pJ?Td?DBNzMz=)Q0#k59nB9
zq=`PSX!JSIaYXd_Hjr=&vqt0CfsQTEam2u}rpE#vdw|CT!!wcwwSyc-j2mixwFbk_
zYx5A9uZFRQ+KL0{r38zF2f*jR$F~GwfF5fgJK(VeJPtJeoB((WeCz=q`y03^@X=U&
zG$j(OeS9>Uw1A5y#6=TnIz)&87vQ5I{a{JMd$1kx&{)zTBGMs3GCcw^Jq%tNA1@8Q
z6wP43M-yVAMdW!@Fy9Pb8lzqsd?_VOxGrkVSuOBL;UPvQXT%Tn&d_{GikFZMQNcvB
zcxfU=CTWBW5)U5@(+SCju#$I@Fe^@)2%<#*j5uk?H1RjJeFsMvA58`0EhN)pPkTfP
zTl)BDY8rz_u8CDA4bISjIBi0s%`OO<hc}eyYD+}5#T#k~j*bY__VI@r@rTY3QB8Pt
zh%?mU47E5zL#!!6qf2C58+@TYzR(a~s6A7P;0=ukLdX4By4GVT5|#Msm=N>|#$ZgW
zc7Qk3!y8I)y9UAI3$^${BjyuERKg%s+u#oM*C=7e1T-WbZ)n7HLN%rEhZ4<R#DVOu
zs%5AK7><Y%cPatx7Jq1oH0v5xod&_<4y|Ad#vUe(<{%JsU<o=14mHt$GfLEfN7R8&
z)Pd$85OiQkLWoF-2njm~2s<EkfjkCM5Hufwh=VZ3oC(SGu$ss~)B$-6WFQz~4lFST
zmV|_eTo0>x3`8A}#^4cjU<f)0$+Na3kywHbBIZM~i8(;5dPE&)63ITNk1P^P*g?dE
z$TlJMgrpIlpo5TP4@=a6CF&r8&g7byJtBMvI`9ZOu%wOHEBu-PVF%&7kQ>Sx4Ljg#
zpvN)Uv=;c-0w0IiU%Py*2?K&2lgk>DO<ToOv7pDn?_7m4L}>-kst8=GsjQ&K0qAiB
z3oIg0n4DJwdhCH7`=G}m=&>c0)dC)eBntbW#|HFRbB+Oz1Hj{GTg&Yzd`#-H0YCP^
zkG&@?^a!4SQ5Ta=8<I|IL6A$7!qU`bY*8(X1$-Q|k-wx0M-bZsK=xh{@T46Z0Ave*
z9AeXj)WWhL$Q}r?4}u($x*lNrN~-t_dE?}l8$2}@PfdiU#^R~5cxnuu8c#hn<d=Im
zYAlYL;1HH4CEsf9IIbE}$4M|ZIBG188cV);NJ_rd)Nx!jWR8<zuIc9ZX~I}78XPqd
z1C!iuu(LcIH9n4-a39U2rWNwh&q?+Vw8k9s#Z_Z))dY*2jaALj;-=Xa&QyPv`f5CU
zH6Fei8xd!Pv&Q1Ai6B}>uS1G#<E-&<)`X<xTlLnE#2QxQ5pq}!PEitH{h~Jg;}(6<
z(j9n3gWtIinI&FPgI84ZU`eSBHV{oXMI%y$$zU}&MLnFNngvU$aDY?P;uH<3j70{k
z+16Snctw4@q9I;UOCD?(AvH7$8ONx<20kS-(9C7LqS3b2$mgT@MT_`Fef*-DtNft%
zp|DIO6G|vT>aoQ$>fssn)HBL4#xZJfj0SBOnSxjr&nTJ4K8{iHl?{GTi(fRvFG{Ys
zAp*e?fe`KCHVVmJuaLd&5rg0pgMe4uBLu+`f)E^vNQg;auVD8XVh}uH5IkZK3^53n
z7=)P2{IH1tA_&1F2w{Q32tGjwh9HE1AcQbh&6IT!g<yz6AnDvA2!WLU5M#>{gJ6k4
zh)G}fm(_~mUL^*hh5;84gJ4%F6ID^uj|}zzV}l?Bk01n(AOuTte&FkA)ci@IgPOBM
zA$UX~_(UOuR_{f&geZgvdUy0*#L=l?(qIObIO&L}?eIWjqsgzQqL~3|03^_;Y3i9p
zKo+5fjVu#g3~1p~(#)r%nE^7en_8e$g989$Eb-Q03%=qptQ5!~prl!(5$S|jTjH$^
zMa?{lnt2p8^C@a(DQaekb+-h?2a%AurPa&P2f%g!dO|>pfY@zIP<+IM6cJK<2xteG
zCnO}@66$V=i4PZq2oRU}cmuRUpnCusW3{H4J=NHGc@p9p&>;(G5dm7jVLq6JN9jNV
z(h!1KRAG5bLPALGKp+B=6FeXbUk}kCW|}5QSP~K<azDsNFdznGF%-dLLPClxNevZ_
zddyMRd<5`<67mt0!IH*c$!V~fMnX<W3GrAVoL6&CKrBMiBcec|S#A-MO2{Gs=J6>U
zXuvCMk!y+Rgk*l$XKhZ!38Ho&r1j>tg9oRoia`-`&?}^VcvKH0sRTTzq(LN}R%I7T
z$7o*xvD+SHIt?&5aJd0Iw}e=SCF0Nt-L}hQzMu#C8!BDN5&{k)!a7nM9v6cpb{f>%
z$HU;GkQ!A;iLs6}E}dv;OX#!#_^zS5X^b`4d4;(2xJY)BC3-smh-WN=^TGp%uW5mo
zZLLGjb`!oGF?3ODezr7&SXh_c28RzcdYcgUkTRXPD_%5K5-*3Z>L_vP0Zs->jJqY^
z9Wr_N7z}<6gVQ6x$50_K-J=|?0SXU+;w@PUmUM;)FdoR<>=AS2fyMh2#0?1^v7{+j
z5*osJp}m0SGbA^Vmf%wlH>4h}B}*J#1yEZ}*CuF?0Kpv++}-8H2_D?tg1bYDJH@pW
zcPsAD;7;*UpcI!Dr$tKT=lf^Q%$@tpxjSdi?C$K`BhPT=0wEZNYU_dgC|!iduy-Gb
z{?4BLf8CIYMbXaiFi|XgRb}_lX7=Lvmvyt?Q!sv#vGJolJ%Udt<7Szv^82t67N5)%
z5?wf1dVQgK)bmI&Vv;>U0X2b{aeVjWx-Oxijwy(etCtB(f_o#N4@0?OOKf;z3&VS8
zX08%`RW6_dv+uH)h)hZTT+>ld-Le0*Nik_?c#HH6W<e`+;zdavK+XC&PiUbedwrJ<
zobpd<<h92&dZ_6aytL-w53V;QDvuxSZsXl8I74RxuW?*i1g0+_bjLXCUH8TpiUovp
zVHJPF%x~z{=Am)*`m1TmIKG6~S$xsuhGwI$-&o18L7Jx3o74ZJk#kSGb;Nu<G)$gm
zB{LT4!TaO)w{X}1aYEYCtz&>DgrAbChUfDkos44%N7No<omllW7w;Cx+y2Y%=9<h~
z;90Cdp=hqF(L~nmqM7SPc1x9JAwp}a-V1L_Rz19eC_{lRqv1XKVNlSt<O4gDB5u3C
zvMgTH*s1|#H}Qd;v34Bwn$N5rBPRK9IQB6gjRTu1?B?;P(-?)vQN1(5nqDsUpA_=-
z<=%fam=WtZ$akLXWQ1~Ogb%&p>&N=FWHQ~UWVpyOPwfsp?0zsqNUmx$BxdGQ$h#@S
z{o?bcm-{JqGlRpF?@wTv06L$u#CgR|;^qVJM2BMUzS6!%B`m*&SyG1>7}jP#hWW6l
zi1tU-?`Hx5W0dNO4R%<YV!V=KyopZ+BPPq@T!)a6+(s0lGo7$rR-qQAj4!dBKvK*U
zGecN%tkbrVIpQ|$)Md|Trkhokxzr-KzasRmV3&{cX>Nh}W0UsWf02%rEYu?_Km%M=
zNEee(C_4NJ9UglqX}mm*cKdlWn1|oxfC>}}o%uk<hFK#D_2=TK?3gV5m0_7^{8}*{
zJY<iJkDEfLsJW2UZ*ov1^er)hxn#cw68Seb%t!q=STV>L<(Y;Mu25M3iI~ZJqR+e`
zJR|7{LjkzRjC)hoS9<@m|BLku6}0o=tw;Wf0}7X~30;)52&%We3VU0KWC)Ile-RyN
z<bNv~l!wrQe>Mi4dO;bt0J<fcml1>`sJ4+ra<u1&X2MMdn+>{+ajCzIsil}=EirHv
zbieq*gu(J9A~6WN@3G!-%6Cr-J3(NbBvLe}2?SwVR4EgD(G>;O`jTO@-HmFrpnNAz
zxB$#jTw|uGIZ>ez_}E}abt}%A$)Avt>t+LEusT?`mkk+;tjdoRGTS0!d1`4@7yGpf
z+S3J`aw&q;Tf%x2$qCX0WGM;Ym@Si0)98Uz%J1cVj%=r|qY#<sl18!EWXsn-Y065Y
z_3i4w`Ov!(rrxzwawu+iMWAC&A<;TfoPiImA7TFwMhIA=V~!!wGVA^{?<M7LIJmu4
zt8HZ%;jrhRV2CD4+z{6IP>LffH=+P^v6&WQk1~BMB`YjIRns5VP0rT=x_~20gG$NN
zYn_$gxM(jbnu#wci=C=?q?Qc67rcz9;B#(L6eQOay^O;kRghE{^{4DMG$@5xkU5Cy
zd<JzEOVK}c_f~d4-bK}>jyQxCJ|u{q+fAhh0$#pnpJQT-oH4U~&zO291CJ%*SCr`b
zimW=;LuUC7HK%%G4_WQ566;w&4{PFLYg#{{oROZ7<Sz=U!vj++supm~Dd|cF;yy-C
zZ{apusp|(CmqCG~QXtG?o%dL702WW|(r)w*@f!v~yeYo~yh0vVukh-=Qto=Sj16Ih
z`gk$uol*6#jPC8~d=O-@AB?g&jhqQ3ndz+L+Az@kcu*vARD@bWjr6nj;=4&taZ~>r
z#k>T8zLp=pLs|N^=Xrf28p9O7(N_GD-0Ce343SaTj8>^KFH!52BgKeA$80FT7o$Ng
zfM9)&1-sM0+H7h=Vf0WlVlHs<qZA%~I<$5GkkegRpomBN;wI!RU5gYQ;k>}`fpuEP
z6^Q_GUNo~&>|r(zVaLn&Gc6>uAUbxnMMYzmW*nI`4A5XEeVvI?z3Xob)mU-I={#n+
z^_ty+>c0K6ChM=`DoABRUwhSjZXFSIV#nAwuS)q?!2C?4@jXio`SNraAMto>i~0*6
z)tX&lz3mB=wxLafsMvR_Nlut01KQ*5Ug}%yx0s3Z5azUeRMiE{5-GGvMM5Lts13w^
zo>T(;2Srd5QDo!e3HRA_WUdshD#sfJf3Qm5aE8{awlsR_)mwNar<oP6q6-jyH@6Gx
zX39~q@5$2h@Veh8xo791xIA!baE>Kdo{46WbF{t^3k6x)l(6}z3-mDye#tbV+k;IG
zyLvr@Y!%v~yICI1Wxe&7=1lXdJoq|T9v2-?|79|bE_29pT9ZK4m*83~G^ps09T$5+
zBpGq(E7`Fy)FfO?5^^E2BM@B(i}m$)GaR6C9ZPz;qALJSf!xiVRC<4ec3o-q4GSHT
z2P*bccR*1C?3R7H1w1Zs|3s5_LBxU^Reo_kHUBLPS#8;SIX5e(mB-*F^Fhpi))*6#
z2wCPc!xz63=A`}D;$y&xCn~06mI6UE3R%<-vzWC-HZcZq*xx#+M*d77ykp;2ZON*h
z&t#`|cH|eIu~8~!TuupdPza-Hb%9{_<O(^dziDH(DToZiF7xRr4^wY1!Y*qgufH80
z3mq9-oFb$#gepZF3#&W&%7V1j-}t})+z9&we8%^mS<M(LqiUoN#t2&!f9NJuIZX2t
zO!=fu`MlgoV@48K?Cav590?Y;VFK^1@5d{9u|kNWUU|Cqit`xhdZU&^7&bhe-nGrT
z5P=^K!8FIjG-R1bPgTM0n0O^qZlnD8ZNL4w4jz;oAI5nfD;C*eAV(UI;~z!cj4T~k
zKi3o`cLW6h(I-ujQ3xx97;7d22&o;XcL{`|t&)Lo9VDZehTR%lj%xy_T^|i-XYLHy
zv&k(-wd%oLdb>GyX%KLaD{=#7y)zIyq9IrmfFn_@PskXSlf94`c&!mzr{=I<Gt&}l
zT_lCiVFYQ#kY-sF?U=JbB&Zv(5!Q0V%<YW&x0@aH4n6%5`;W6;&!2*m;+9SNmdz`|
zcJ3GtlZhT^h%d<P319jv(Wy?nx96fs_mSV_G=)R@d~laTYMPSlET={gZPq}{!XU?3
z9X42$Fc);V0$98iKKeTH@)ua*lcMHS4+mBmpkn~g`Fe7>5&I*}LHdo!u}FUqCJvk^
z1PgpRM)~PPguEub9_L@j^`x8byugnh@_VH3+4A|-ZeYc1D}SRGdD<K|9}>JF%N4dm
zGVy9yGFl+8ejJIUfii8fPa?pgRMM|`7vl%YrKW4vJB2uVloI4kNLc#U%8ySiNAf?>
zJb{Y%-C4Rm3c2Rn_5-8LQvONQ#Nkiwy$krZNMa_z81DcX2Ko0#HX6#}5tIdD(AXCb
ziXDzM0|!MD|EBZ?S_U_PE<N~`okcyi2JY4TU9B}ok31I&m}%!m^&BZjqRdLQcm<{z
zDedJZHo!CU)H276CVBbaq?yDOECCe7*7fvLtwG1)1cQ_1y+(*ox~o}MZH9kY>90W=
zclf`|%uDdxuG0Ov&n^3gtje4h6!L_J$N(+^UO{Mc-Q0(tv-oFFzEV#Ol1B)drpA9F
zbb3dh+wmPprx%hf>J`r84Mc06Doj5)E&}fKk$DjcG`sj)kPL7vU#FCIxcjiCiI>W3
z_s#>PS7==K6(1set`z@?XUWOT`Wkd(leJ>MO;~2+J2f7&(L?`;8|4&9O1a+M;4qN5
z)lsvJn_Tor4)!Hy^WMg)vA$rY=|0Jqf}}g@Y#fng^u2*`&qRm0(kAv{gkCWYx{ly{
zM=9)vt*QiHQ$_a48Oy)LkZu_ei2S>lK6GErgKoT6-=pAnfzToLs3Ntg(QH~<kZA;h
zzHh62+*Z58xqih`b%$}C|E95e>eE8(k(KwaBGdqV;8EG6t47+V@|{RNccw;Pd=;Jp
zXA|p{K!*Kl!W;CeiP5rCcO23ZNCg%pxBWo8#Ybcg!vVI-u^=?iY!(b)<t>xqH*A^b
z_KQuahJ2^>x}~zJNOSFpa!a!lS0XJOC~TX1Qj_V%e4`h+ABvow+`uF++O}Z8W1I{&
zP<BB{a+8flS<)i^<n?aF96EHYujQNCQoc|207IJ&Ln#Ua`J{MB#o3seUQvP1ThFD#
zrUTm)oP6xlmgxWcE?p~4zew6FMry$GPZ0X8+rUcM`khbDTQM7|qHU<x0-)#~Iy*!-
zA%)S-*XWgJj5Lz&o64a$JwQD%G2^VB9!BB$jKp3sbVtxr^s*2%GbVXb9+(bIbgyTO
znbo4EZAV-6U?o0FeTs%K)m9*-MtvVPK=Cxsq`jl1jlE0XsQk+gaJ2Fz-M6Mdb~a-#
z8GorM{MzEJzQJcXd0L&*T+iL(6N6LgD!0q1fhP?b*G1So#MmvRTIC{wVL7bHrrD&Q
zwyLi;1l_)sks3=!!R_>Fy`$1riHpAsf9{>ff7<R)Pw^($`xtYr9fD<RzSBDIDn+q(
zZf=uKt+*hvf0*PhlP$Nt7<jo`Cmr;SqIh!*)3sIA;c1(+GjVShBqk;+&zsdrX<qu_
z61w3kUu=*8q~5pyO@*VF`=xqWIvuEOddJA3WXel5)=H;jN{R<NF;Je?PSVVifw4cJ
z`C}Q?x*Ck_4W$?t<%zxlW5}4~-aYOU5Mn6F<H~bwk%J}4Vd6F^Pqg@&#H}mHyALVA
z<W6Q{`DRc`a8kD5i_bp}*j}77>bXMkKk;*U0Lu8eQ1gAFBVq&q*pQKOHmN{Pg}JNN
z{!h33Px=F6%-*p&M$UxBC`$vOsJI^XW97U;wZ3LjzGid2UQIjEBf8_cQmE4!7N<QU
z^M3KTb}DPaExXhv<HTgw*bLRdfANxi$Fz}Ixne4k$l<^dK2`>*V)%(=ap=URIEy6~
z^L7{icitFuCEL1Mf*%~eL*8J`BKnz{Yz8q_N@lZEtcR`mx<198Sh45(gR~6yriONV
z5F;TChlexlo3iL4K^|cACo1MWGKL`XqXrgwGv<qijofba7FU!Xy?DjFs=*6na_>f5
zjC>N-dl)WJeC{LCzHbuA_Ao|S9;+dYb4M`^=BX+#txI2HGD#ZvV*ha<XL5^HrCg_B
zu;a1+U?rvyWMMcADGZ8R7`8~>bxPjsC)f_a<qlDGmy<1bhYwMAK52_l8~i{D>SkOG
zTQ3r(-Sk^ei~~ODQG%=qG$gWBi}pIN?dv#Q1R}%Etp|+<gefdVgIq<x5J#nBgUO3F
z%n0$1*#vUF@9ho8-Lq?7>e{&Nk&zq7?`;^7@?HK030}B=2l2ymy-#?7<1aMA^*J{I
zTj9+QjN<v<gIw!@drnMyB919(d4lpfA5J={gXhsIRX`6SpX15Q{O7p1CA*>}!JJny
zCLtsoBJbrhePL1F4&*;b<TG($sA8cp^>Io!As>TLIU1%YbQ0~?6rPU3KmI}G-Oy|{
zt>3pcl|u;~uSXn39e9(KC@YocD@DF4X5mEeQHl*<cx=T!yWEZ%JZ(^YQjD!=#bUHG
zi+#Hq<N|<1oS6;=91Sm{p74!KK2f@PW+bs22Oq1Q8Y`pQ>}?u{4$gqX!M4Tq^XR^p
zK8m8(*Cb_kQ0jls%v;ogO(nV_fi#xeU7BDoRDIL6E~P`r*8@{CU01^UZ5I4J%J8ze
zx~~UAJ;ZVW%BMK6F@7CAiijl^8{j&THk`aQB-;3kVq=K>A!$dxB&Fzv+%64t<h{M=
zTd@s~{F|h?`Zsu1XpcosBWaIhhR(v{?yYageXYjm=_WC|F#-m@oVZA2HaNd)ILm!!
zOeSEdFm4t_xCzy=)2KbgzuZw+y0hoJj4dm9B4aVJ#zqnxgLxs&5+MZ8GSn#evCS&6
z);JOM2MqAXqY4!leCVr>N}6Hgfx>C@%rOb>k3Uf-B`Ii?xaK%d!pR>u5R**MSW3<f
zCBn7Z&9<~9bdD}SFWMto7FRQrP+h~-z|lNQunj{0Rt2{kYj?8Y+mqG7p~r#QZLEyL
zoE!!RL=OGx`T8$Q8(L`7sOHq?uX}u7Z(5}ZU)qMCH~z^+TO8Bz)v~oVw%1ISPqNti
ziEA^hCsfzG6SIBro(<Om-F5EbHN<H@7DiXO#{V~&3_njZ0)ybcdAe7Hl6xNn%k|&r
zWQD)E7a<KOw)sx{*n;ydH16(@4$unKUia>8gv6gv9;Vy9W+o6o^Btw|f7-<1cz7q`
zUU^&>E=$`m+uE~d7kElID<ADT6_h+%1=8(G%kW~V38z(=Z-P5n6`QTQruS)^ne#!+
zdpOShl1m)l;T~J=gd8{7?X;bfBnA4hZuyRw(Mdh0Pzj{<`9zI$jbZKxj#5XV$r5XA
zeDH-#a;mKhhafNnCp_fdyu5;C1Hqbq4G^#KFF-ZcfX~Zu_vG@=yp_mVAm~0gdJ<Lt
zx5NEYuEIdF`Fpuv;WLZwrPo5%4QRg$8;TPBc^Zh?O>^F_vB4V|m`M`g$6>YYamHVd
zH!QLJXDFhLLjunQF_nxz9keA1Y-e(xO;H%F!r9xZl^|oyH1oI-;K6LM0!^)B@myUa
zPg%viGPjH56t5%_zA;+s-{YaX=VkGhF+UH#Ouq}kL?~}Z)(|p#W4(oDmy=S|;zanw
zMf8&c0#hRHZ06iMuAJ~@6vpZ{v<2}TJn98&<EB=Cu^y?e;l(;!ZRI>8&vArNO41Rx
z;>X0iQyd%=uWe+}0g9ZL`>4IKGWnOE2yb(zqPr$Qu_0JQ@^D=Z{fX^7*4F%%zfs(N
z)}@K1O6gavZc<1TU=%>RC6ud5<7drVkTF&%n5$GHoR|<Dt=O88ts51$iP%I({;52!
zTLTAW7=?8Mjm!tc);@gEkGlXQLE%DqWi3m5ezkpU@f*KuzR8<&jLXH}$683X#J6cj
z?V=q6^Rv87NJa%#h#ko+;3oipqiypOhj{2jLW<FbURh$eN2pXrhMN4<F^n7ApTnZl
zJJz1nIJH!qE`L_g=lz0exGVrIUp7np1pmuOJXw-{g3YN}(+mADMFciH(kq%4!Ps`+
z+J|IL+9kpi8je7JwB~{2tG6h0Qq305v`y|}RVl&nUJNBP@~Xl;%siii=$<N8F0zF9
za#7>FvO{4x7g3(2Vn9bK5&{C)&waJsVa+H=8eBdwzt^eUu=KJ|BuiK%%d7kw@jy(e
z$xB<R0ci1?QcXNclvkEQO&Wi(3yHJsMQs;ew<O(mu@U4phT#(e-L@k9j6AT_^;@LT
z-3Uy5){{#waMCL_C`&!4y_*{OCaH0lBD<*hysy2H?kkINO6KjK-1a5<jZhOA=%9){
z(e8P<*54y=S4xp3jNac{R6v}<m{KFG-pxnj4#`mEF86?EL%OjH{tu~cBdmL(1!UI!
zO>m~+sIGY45%V5_6bTV8rpK*KXPhGhHtLtrS@_mL^LV?CM0!?2Jhax=i%a+hPw6+@
ze=TS4><|5Zg$1cCTVIp0XssB_ow$=9?#>q#=&B11`#Cw%qn+yxg@HhH1EVFt)kN1M
z;0g1lz3!)1<ap$i!ZvUizbG`JQ4(y@UH9|DPX?UOsPuSOHiA1CF1=;bEdviWeGjcl
z+;EdkcSfTtY<)30DpUZ&TXk-?1esyu<+_n;8Vy@zB%@G3l_Cma^|IsI$J`qK6^b!s
z5*tefP6YK9@#r_(;_R)qXnNF;556OmtU>wntr^1zIqkaM;Z1L4mf@ae=dtH72fX>T
zV2-V~f52@}dQZn<LK!{d;e~sZNt0?v^VJ>vp=bES6>SOuoHdQNQm+k@S2FKb8ra9o
z^K5x3@n`uQhKo5IevZbK52cB6rTZ^DC<z;$A;&Qp^9yLmueXYGbla)R<TtGDnFgOA
z%fH6&BNiGR_mCPaK1BY9OX=BsO=g^P^-y#oNcpJhsX%kta~%GAzwCWpnTV|17m)ED
zrl0eu`g6X5unqh6fbzSc9=G9TY7)HdWdTqc+w><NE{{%_hzmN8*>?ARTtz4WFRkr~
z1-5!!3Hkf0GO73nkui3<^U@PzLw&M1UC}ER9S5-u&}G2ZNPx}uqC&v=wDEpk$*}6{
z6u?gtPkHnkDyPGCN87!`3GS<}6#<ZYLmkILV;<h3Eo;(#M=;KA;RizKzKzvbN#`u-
zUHwTeC;=k!Dmd&1Iz6R)h8z0Z=Iiy;0a8Ldhh~IkvJ~^LDOR$XOa5^Irzq>%(pW{P
z%bD7c#*YjL*)%2s6La1gZQh!^Kx2^zpz;4BoC7$12}fA;ym4G4+5E?2NBChi*PX?W
zOG+v0J>MAF);)Bqk>8QZTX}$@)$Sg6U>AATwO5P#xg2`^3mo}sry3aRB(*bn{eJBL
z%Maxpwtyg&kMcmic8bxd9X?kp@k3FLpg5;?2pY%k_;lm+G}Hamwr>3rm#<LdVg)YA
zpvbRLM&x|w_MRgB{8ekWA~!a>UCZwl#m+3)y%2Q9Rd0(K;v3+=nqbu?I#m=b-H|Jt
zL(V`pk`HH+&rPtxNxZ>HxWSQLwXrP&k~0R(eUeNxwGnQSbhHZ(YMH6L_okXZSP&j7
zpp07JP$DYDUoC??n+7}jpr^?3N6m#r4Y*~!-5>YLW^kN~CO22_p#}<?#gru8;#dhg
zbVt$;u;bonImpPOSp#2+FX(o0rK)}}aYMNJM=-Di(0fo&q5xVg0K;8@U&Ab5E^e;>
zS|T|2Yh(%Wf}*~Rk{X`?-|c<<s*Dc6%yvkY`yYA{A#W~M6pBCDPD2{&Niqlc$uBEg
zMnIZ3^}AaVot9tdah}L7LgOVLcv37`XW0EMT0rC-c@a97lez~MN-1IV9FJE_Vfw9-
z))6@1nS2``a}f(=>J^~3iSRYL5P-*86kFl*u$5~s`!I_~M{gt7m0U3zDezMS?Qx>C
z^w<{^0Uh)LKGA$WOg5B%LD8@*Zv9wzJD+`gB!Ltkc{>-)Ywnue<JfEdMzQ|1a}%;l
zEGaev2VU(p<6n4LQS+ARF0Xx4J&3(n*}kEnqrW1qa1%+K6f+{1Y^B1Q!&#lg%D>KA
zC5yq_8e5aLvne9P)5&4)ej&n2vjpbgA+#_Uc_soq(h>(YDqfkg`J$kqu8Tx$+pujB
z1KPJRYucE$E#wa{sd!P_so@^fy9>ta9G>|>0NLkAJX9h4M)%7OD=^7$BaUcdnwuPW
z(W|7E$LnGlm6Z?mw!gfT*xMFDhmJ<)A+Z`H_{fO2kVsfGcw4>`-1S_rslA$pig-ZT
z3<sr1#C3Dw5v<bjGY?Rx3ykHq@E0c%Hq7uK>fzKfaqHhkkrg^4xkzD~4=CD(8}f7g
z`C_e%7wIW|o~=mf5eD%R9N*~p=+rGuRGk1Id0YHc6sJ7^)(<#&mCg#79DON=9-w12
z_B0TowBBNy1JUuYO1UuvbXjkO+i$n=txE88nW5JM2tO!SY#>#l_sCb_KWr-@3kl@-
z5LD9FabJ{5Eg4vo(>*g(_fnAjkywoD>e!#dn}2d>CoDD0y!7=c+>V~`(%b#mvT?pA
z_-mIxZ<#KS2tQ_(7vj0M(8A4AB{`T4w5+q6KdAcofPFXG?<&&aNpCeumfSEkN)(!0
zLRNBt$<JH+^*$m<8Slex%E23j?NNwjZpMJSHE!6TNR*Ujrk{e;K7h_Ux`M369UR{?
z{MoD*L!-e?<I>vyGOIHAU}M+y!HedgjDUXvHKo<s@|cwP`1>%F6+Jo^RoqG#S|3fi
zFiw=U6ZP~d_9<<ZFh*AF$a~RDYF{p4V}hB^atdkngHCZ{H~YamF<#kIe)$hK^Bd^J
z=wxqk{8#)$rU9a^kq@q`Tgm^+YEJknwjoCzw968<&$5cy&PF&3-E7vewk&u>T{?G(
z_Ifp@Y5gXvwx8VTqRldvrji?7cB;@Ywr+K_;jd-AN*PcDyH!F(hNSE(^y6Ok2U+p4
zeviHoQfLw{vd-05hd+zx{ck+Fkg)HTl&BpE_<aX(x(fLVY2V_*v4hgdZjbAZE%(cO
zr!f0H>^wPxVmB~f5HGddbq0iF8q>UFR?%-Ks<||le#$I{*PSr+X#|fTe~(?zjUh`7
zg^j39NDobTKreyFM-hQ(lzxCGCzp^1ajfGyWO$q+OtR-^9g*nxs>qLs>>z4a{GF-7
zM3P~*$G_#4qaFwxaFAg=Z;vYi^Ef8N;uyj=a`SJbHT;!-GGvFOiZNQJ?DCr_=HdQC
z85#aQGOXg|m9hUWE`tBH5hDU@g_|OuZ4?CA`l0k*E|v1c&vN=~`_PXl(SG`g6~GK7
znpqhALI8_mZI-jOB>POMFh#Vd&Y#FfI`;twQ(v(tZ-Ne-sLwQ)d|I`eW6<3SP{@4&
zt#rjm>ePzJzXhT}x~ncF&RP2telyvpT=NfkCP?6_T|bET0FMh(bvE!FZer4cKQIns
zOEy^l9WTUDNH;>Cmnt7v0J1YKxY0@OboKCFE~aR~r|MsV)Dyo$KjV(frM$PGdcr%l
zN=#D7z&tHG-T^Nw@_4~`TC{muSbLGv>u`g&wqGFZE4g%|F9J#YBxBGiof!!-=u|Cz
z1M|ffnlGr|EMu|MGuVO~Y@v%ybP|cjHgXs??5rd8VE!zh`xG&ty4A^rW14G?>3H7~
z#PwnOB23<bkQs;I?C)LK@&u}7_`->A7Z#PXdaSI8OI%Jj^GqZa^oY1t-CXO-sO!u0
zkVQq#+IK7LRit{axfXx?VC4{nb9}R;Ep2puM+~#L2+xM5E$<YsukpCFG%fNhyIJ=I
zQ{%Y)H^U&~-zhzhRb3JYJN8#BZ)aZmoPOGvGga4kp<}YOyePREx09>y)KIq&uV^}o
zBZ}@Y=ekU$g+f)cC5XD!iPfLRY`7NHcU!3iYwxLxqe~yB%~Z5d+P@rT)_-{6q^VTh
zUUhEIcEp`7v&?RY!9R_2InCxHnC|H6u<qWBdiTRGvw9x7XH!|Da4OrrqV3JQ)uvqQ
z`+13HWF^H~4PS|>YBIDCtTA1d&g4=O2kzh#`H@^2tORTBtg?uyTJwV8cWQqCR{Vh?
z_BD?ED|;6<-Fo7LHJaPCKO{i^K<BRH!-(E9&ihweD8hC+n3K2C$LEoirf)Gc`FC&C
zvwEiAcCDrgytw-sm5wPS%s3=0=Fl>}P&B;ULO)hYXye-Xri}ZYGXZU82rVMy7jb;t
zj~}7<py_qGr!&CQ8Kn0U-8)t(cQQHo7G{XpV$808vm{ZJ>d?J2*`BjJANQa_TP@>@
zgR8pBti~Ak`s_7B{gPW&b8v*W3JUdd-JB{uFZ@WZUE&=<blu^+QEz+K<S6NS)2NUs
znr_476IwX+WzmJJa4K9`<M*I)9*Vv*7Op^Vvb~Q=3R(Iz?TchaSmek_x!cH<q_L1=
z)ve@4S?3D<gs-eR|FE&OjhDV%Ei)^1{#Ik^h)Y1RHf_s;R1%4q*~~u2XK!@xY!Ly)
zD|~Z!%3iPj(^{6GSJ@hpkT2<9n>+lwZvRlvbZf=*Yj#cfwL#@koyZ1(ySPR$2Zw#|
z3&ehR6~YX)uWfLzBc;~mnXPH*Vvk%z+}X~QnH4I=uf7DU(jC|nv>ZGg72a{Smx`Zw
z_1-6}_nE0gpsjwfm00b)Wn(9U>&{&gdeS2_`3XYw^io_*WR4a)mG0U_&=gsmBf0AT
zP;s*>3;%%OiY<M9*+7!3oN9)ZsT1s-)Gl^ca85Cu+l`nuwr`eeY;_l|*fp+x!zw(A
zO<MkpA-UTAFI%91+Pvk?e4e=}MJ^ItuV+%PrxW&@a4q51xOly~{CyzIy*^^b4C3%U
zY^E$Ud#Aisv^}xonhYb8Q>Z<ugZ|lR5QJS<p4+vc{N3Y;3g-#+hlT<FH}f2}M)%rS
z{3^x-Y8Op@wX*o^LDOsqBG!YA{a6nuZN5n16_omF6k_l`sUxLlrPM+~`Oz;0$e!lV
z8KGAou8XWwo=hO}w*z4mvE`ELZFHA^L1WkQR|qc6>=KK>VAoP=YJ?^0xt|X=nieIs
z8OhKx;?Xj?;Pg+qn!Z(gR)U|-ET2UmkEeWheT%qghn1YBo0=HTdeF9NlRSLczpWC>
zHA$aucKOUb!;iI@_jyH9ZAxLDvq{|TXOetVMY(Y$={Vwt4dTb%%IRp$QhZlH^|BvZ
zRU1)G&KvNiK+*cn-c^VagyoFF=9B_VbfNKpt^Hlp0xj414@<orhUtg14BQNUk45!5
zO@~gAoPd;s4v{s`{z-Zzw+(;2d9Z0g(&Y{$rw+=YXTqVUD*C2CVHfL(ELz#rC;8Pm
zfVo?q!@;0;|6vgoPpR8azp3|ULBTucLfY%EPEWaY0v0oga;>rriSNn@2EDA{ni{iU
zS6BSPF!(jcDwPo?#mD6|=}O)8@)S8@f2+`SmvLOLRLp5x(>^s$8a>}n6~~wLG%aXu
z^xVDbqo!tPmSscy7^%`tJ+7y^mHtWWtTc8AlW&@_t8Z`5jQiupQjF=3VidSp8!s}O
zg}93I!RK-%J|i+saq9XhZ6Axigwg=OS-?(Xf%&+CrA(<Hc@2`BOogUwjXj?4Ws$n<
zy+QGIBc~2PQp=;$v20Y_)={pexGKo?92qlVt%e&1oTi^A%EfS2RxhhjF_jHLtK;)Y
z*XI-5Cr@BpU+|u-mm2OPT6ySE$sBlQY?g<1kCJ=3(z3qTvaY+yS=r}Z8=J`f!{O9e
zJ<Y1*RcChyF={+~TdX{{WzBTtd8|2WTTaqiI~kkTHQTtdv7QohBrjR^H-9vowP1fD
za$QvfQNoMzl+FIeA%W*C-;dH!1Tvn&UG@2#5-DMj6uyb~mP42jPq-A~*MrV?@_jHl
zQ9ftC-m-s}Dmx->F~cxI#<ATn@?TxI>r3f3$@WjS9(Csf81AJApR-%4iEdSoqCIK&
zj!|qd0UXk?%QL^>P8kAM-Ke2`ra~{Hmh?|$<iIv-VhY2!sAD=`N&QmtDYTn$_3KK9
zGt)SgeHB-06|AicCcqdf6eFtcH7XdYnQ;h9W(w`WV#^HUwd0!hWgUa+Fp9f57tqcS
zZ86@0Vp8C9q9I`Umu6A<GZTj2|9ibR2LDHysWZKyU)xxARKo72p=q0D+aF1`6@Ijy
z%GTw|-sQ^HrJl%HqIIsk^}8uOP%CyHmVB|C^v>~mRrua{?A5H&OVlwfmDGjOrap|)
zP4G3TS#{i=VfjK{RZPyB{780pJz}jfyscI2`zlO?94L{*WX7EtR#p%Iji_@ua?Utp
z*}p7G)X5ezUQ?6Qzr<m8r#Wzq{aS|tnwQt$QfKCCz$mSAJ1;>=UXE^66c#~{IsZAa
zi#dvlYlYVmz8;}FVmFLEJLMpDjwdl)-=r$#_<{%vSr6Hidq5#Eo3&)HIyH7R5`JBf
zB{yrTXZzjxZ(B`Ob?HGNnf&6n7NOTS9S}ZgSCF);WC%6XrsG+ik^tq4RaoJAGdASx
z)%T?h7TJIJXD`EBQB#3l<m<ud&(qhgxf@mzTQNU!usho4vB?1M;tB{-?KPCLMwZSy
zoe4k)H!yUu1Iu*f-`b+%#*j}~VCRGsH-d}#RcgRR*_v0SyY8u}YllDB>1}bR@>b<y
zyU3VCa^0ZWQUJ_PwX7Wvgiu>`=<*NC4y_+@#mYB}`pG__p<|m?jHIKrhDsn~HUY~0
z(~Irvi|qj=gkh#H6GlCzB7ksPqlUcLm3wn0;#MnTe=4Fu@P+VsZrQD;e%^gXA4`*Z
zSHM9Hp?4y-cqxKuA2B2inRj4QFt7AXEAu3%d{gRC)pTPZM2+vvqgVO4rR;Od(t`BM
zYo3r>%AZmij|6cgNlNXv19mY_vo3ObuvHoMhDVyyEZxx-L1uj--%>4$U|s4e1c6)#
z(l`Ve<b<f+3Zd$)?l>ih4*~(S2=deE_++H5r9zMteXS~pBcaIFz<lA1fS$5U@5H_#
zzu<?owIt|rB)%xb!Ws3#%QtFRE}mNX9s%^swYMbY8p&6i<2NXD*YV_l=up=b=Tfg<
zN}sd{x;sOeSHW+qzJ&4sgD0{rB2M2I(QYn3`q_*6*>`gmt-Y}{@RE@JoO*As;#pOa
zQZujn4TxD-rMStZ<Vw536<aMt7ye!P7t;6wO(D8K_8GYijXj;#GNUTVJukkG?495d
zXDAR`wG{Gm5cPBT>XcqBrTYFMy;$I$1oAZEUBeH0hrm0=r1e1X5+mZ@Hd`jce5tk<
z<0r;|#tL_IFf!*Wx+E8@AD7r?>I#fho&*+&>(X$p%8Hb#>MrSn>T>SX*HK;#P;2bh
zwpZtzdH!#&+ks=y%E>B#Dc>%hEV|0B1j!0Mdo?YOOAPwkmq%Uog`VbC1cmWpzL%L9
z5ZRQyA|i_`NwKF-`_K{2`X|#i2W@j`g)!aDAVAI=lL0qI4&Bz~Ow%;BLBX9ZBtE@*
zK-9mNQlt{I&tk>8fitS9LzMkwwql?g@Hx`)#>w$z?ZRrUe^lPqMGXPWF<TUj7AYv<
zOFTxxKX^BrQ89D0I+Rxn;##7^^a{2jC@GK_?ksA_>gvg}5w@F<bPS3}R7_c1BwmI{
zk5n8d4;)lmb)l!eH72&qrjI{IxGb|uB_!S#i0OBgqLT{1!&{8HCt5pxS7W`knd|os
zYuFzdgojA430Hl;B*sB<mE_lA7W~6>fr=tc8^e!aY=p-SZAnuo3KpPu70Q8%OB%jN
zQ3^4e1eO;dO1X{dB0P}(ji^TYvZ9+l{z?tJD5;3(S;if-r|N&`h~A~Yx$jLqP#kP@
zMwxa6(mml`ySI$hK?@{rsUi#=dOH&NP`*a&%2+`0PJ6@S7&;OYIs#9KwfAjNFlvHp
zRsMT}@=reDHKdf&86k{LytKWX?pZ`5CIzjw?&LiqEmHC&C^@F1gN2!hNcsmcG&^6|
zIA4I5iC1fSCo#=alF<THDnUk7o$>9jKC@CaFJr8(#5IVCBbcb<%=*i04b~N(6J>RR
zF5H5vgUv^Fg|k_;w+vCj$Rqa{-Q9yV)MFxezz~>Jkod0npb!!{ih&Q|hMr^a!70PY
zrPmOm|4HF(;_LSZ6ce4OMk7%O(83kw%i~sdo3Br0zzA(!gBir7&8I|l)P%`{y_K!e
zmA@&Qnc2s584G)c#RDv|R<M-!sFSfxcOds}D!J_-fTr?RQ+f5eya7k)BhEwCy_wQo
z)8f`BO&hhmvs9nT?z@xikD5X5I(D-^12WS(_w;G{Fdv%3kK!gi(46~*(t|(5&{LFL
z6Ls^gO-5@f)$m<=uBAjJJx1POKW}XOPxUx%XC0-3!#2@pGtOr-C>G=qRDycCCneQZ
zO~|tR4(C*cbWytLGL@08CTz@@)ZNoS`6OhqpAgnmb<+{FPat#!`1>_NUU>T)@Ib8P
z@GX~`=0@y@@zkDr6GOGtngms?G&JaAv}A{+`J7BbG(n+JU+y0yCk;S<!){Kv5TX>6
zFRkWFJ<zWtHTM`3{l+qm?*Z48_wp`(UpeR_$iv!v1iWxJBTclUt1USe-h659f4Prw
zUsp}LC*2)Kq>AV08SG<q@ZqT9F;DvUY_7m*SwQ{Bpm`#Rz>y3(V_hUT=gsFouGwF4
z{+5TH=TJut@Sxlbv(*}TT%V|jeN-qq0mrn7eFQD|Zr`d|n4d&qjb7?BLn<|6sx)ID
z=822UB|PA`^qPq4x)xQYO_?ky+e{+?Rogr%Qv-^ZI4|;#x5cn;XZf!1NX}*1G|_s~
zni<Ykjttm_^w%=m2;uv~6}FLwpIY`=2okVMMFQu2(qB56KhkO{Av8K?r&r*G(KA;n
zF_XAqU|IbhB|B*u7T86xVVvPFsp)^1ad_C}qiUPN*kF0De9VT6k$LJ`ss_Z8V*FFb
zBOmjsQrb0N`5KhXjd~k`&IKMIkv>%#_hyaaV2Vm&V+936Efeuc<gn_lO+1zS01`?;
zMhqARYZyQiXc&8?j$%uF4VYcg%NWm8aWM;GKV74z*n|8m+OmxykhaT*`VP-VTjr7~
z?UDVZ2Og#(yW-sN^1(qNp3@B7;_he#ZtNgtb3<t|Sl;36+9pAp(Qv+^B2ER7Z?ShT
zc6i@&a^JIe&mf}-dzb%Vq<pOCvxLza-A^FoebsP0L?i_!OutbMbh9Y|FdsXRf?Jf7
z%%~%Ig8Wu6n6D$aQLU3(V%>=&&5Q{QNP@~>dCc^zff)`1`;9wmTBwCD#W_hn5fN0f
z*m(JJ7<WA7!R~}@yHGiEYXNujlsm*hsk9t1VLv2VagG7K>)Mj9T`m!?1;bc7CfrFB
zhV>pYRX`|sEz6CUfG3pPAH)B}xfQ(-KR(}1COxGlHEKAp)C36CTPhwkszo(`1cTaJ
z{3`jw^H-5%$u4S<lqftXLNP+`JL48X>d%{m8&J$l_$o>epcc}|7p*t;hw>!lzEkGH
z6;vAuutaeIo>{t{SyFHBp<rbISg!AZ0|L9aTc&@}JiqW;Kj6>xs3u7DV895{)3ID^
zz85+wF0(0^NZ?Z=X(Q-L;zr+6XmU~=p$<^wZWxE)<5HvCJqpp>%i5g_>qujTU{thh
z%X_BN!vCkLbWPEp^3fOY%4$EJmFhds`wKV?vWB@Ipx*s)SE2M4Ts!dd5Vs=`3ydZ4
zfILLwdrHqew`r_fSVSYCQKUH?n96y=5f5l}k5WPW!)T2d1<2BzZlhFg`650jS&p$&
z(?UrRSC^5~)aG;mnkD-RYCPTOrh9KPTAxDXA&7@yn;tCKLha^FNjLFz_rUYIBU$<{
z<_ma<8H)AP+%wa_=Gem{<!+ZYi6#+$mrY~3!qH>BySv9vmM84Bi_!Yg`ZhU2Y?G0W
zbD@Sk)EGi`s=s9k!ABkf7Np&Y2r%*K=xlvWtVWR^31uFs!#3NfBYrG*o-cIe{*_&&
zW#r}mw_g}Wvb$ZuDajbja2ttL3S^=`x3+N~$+f<XpE7t2N{nY6MV*cZx4LT#?;sdh
zTo!Rzajrpu(St0;I2D{+5a5Ci@8OLBL>na7tXTWb;yBI}37{diHvGK8rq`vQCAnik
z;OQIDE$$Y%yXVpM!Y7jI>rF_#-S4RCTe8H7Fn7%pqhc-m&BgTrt$TmxC*t1qV<bx#
zgFO(EO!#sXb4Ph!y;|x|A5A8guJmk@j;iy<agDZ?x|NxaV^nUVcCJQoq7R*``NHQB
z9<41ysHT)cI>6v=D6Bv`u3&buzb-0vv?fQ8b53>GyT3~BqQtNDN5p%#<6-<i`aR|D
zz)jr5N0vU&bI`K%g~;zH4%x4!A8L(DTBx;bq{eKN{&<a$7|dnl^X(~xN%7NlE+_qN
zu3IY?qrhxA!>4Uz{?s55C>%#q!-u~Q{4eCR^`Bo8=*;x{O6NTVHCjoF_R3~Lb>}*k
zN;1XVvgZckgUuM%&avi3ipMA<z*Hl}OUcY+&)v~l>ZwW(--Z^xS>7wh9IBp(@%yxF
zoqeR>Y6;SlR6w>5BY3$jpNVj}MTG9Kx@@i(jw%KHlnot{Gm~gj_k1Z$%lmEDSq4V}
zOL5FxR=B)*w5IwXF-h0V3Z+?)Z*@_s6m#FbZOM~hCfFv0Wy#VuT6C>8_cT#%0NSOr
zFLZKY(A?j+=U%Aqk`P!w><9u|EnUxrkF#H^YyWpo#W=^B#%zlj5G`$q(f*&TXR;7?
zBqebv86k<HjOI}~$yUT^%OgfsGF(vmd4rgytL7M@_JwN8{CLs0X*){c%{AXeAn$KF
zISX~KjaVA^NS^#=>y{pz@p%Nh3et}$;k-dCr>@yVHtxQ&HcRL&3tWTpq1kB1r8AG@
zLFGrI+UVp{26Ly1IT#k`_6FnfnM+=sL;h?ueZ=sMtE`~!*A`jjHwkjR-DUCd$FNL|
zQ3mU^h`M3#InTxO38tZNn5o44XDkv&$kCsO&Jy=6ogXN4cWUFA*UL}#gF-&vEJ5~v
z>D8~$T3(LvP)&;8fM0NI9@9M5yx6Y~OND4{N!%vmOm@z?H+@Bn0xztwN!+UAku0QH
z$>H2mcT?CEa{)TONvfZ_o>R)6mRAdJg{}IU9k^lnLjWrl=dDaWcVU~t8N)-%x1=_|
zhzydZzIGMzgio13D7Q25JYblt;4Or}V}TR}LLdm+ne5D(DcZ<^u!Mr&XIR>2*seYz
zmdPvr&~nlNMW(*uSzqNfSV9D>l}&@I`t=RF3K^pCncY$&#gnK@z3^lR*r!n}nfNKL
zV?Uz9R^8NF*0hzmX(QcG<37M7w|CO6&_IJK05;TB#g|{Ua8Jv?8T=_uV5<xLQSk*H
z>5@jKDO6p6OmKofRmaI`_W8;7b*%ZFeLa#(^K;JZo(JdRQ_%(Q8r~t%=FwQg-^RG#
zaoBN9MXPL!GFh5wqSd@IgWY#&yZb5pzkJJ#x3@G?t9X(4O3&wP<*$J6!rJo6%Pouo
z+uW3w0Lsf;yay*F|Gbw~UbhhFZKJKap|`AID|16W6SIU0g@nptI<(R|=8I8-ns3td
z*P&eZSBfi47QZlk(u3Tax{~a^PUYS^)7o@o(Kj)|M!O2R!xP9v(=KFxi9BsODmCo8
zRp1og*po7+Yj~-%^sH%kSt&zan-RaCMkf#=E|NNj)yT308N@wuF)mV+O}o<`=t}A4
zl^?ri?RuQvdvoYBecwdHJwv~-P+mql_J~3r>L#jYxu)3gr`bg8NyyKr<=O%gQ}!cL
zY(rJd<zf4ssVEZ&n!OdVaxTxS$VgXZ{^_l~PQ!LtsU<O6w5hZqaNH2su)Ruk=fzf9
zLMvI}7R=jhKX<*+HRZh~YM-r!!^rqUo2(#r%O|Sf-NJrNx}G(uYn=Lq<H(h((Z#Fi
z1yYqMkLAv$<47}ZurgJbc7Gb}B~D>DTb1zWJ4^ci_i3PJe|6#8n;4Mlmp65uhGjsb
zQsI)?O#f8mVx}0$rsatl$x7QZg_P-!L;;h0B#Eei{^#`(Q`6hC4C-`KLqKQax6P)A
z_E(Jh)oq5bj0;(H6O8OO9Cn9JR3<KmE+;l?%gU($7(cf<cSAxemqB0s;qc6>cNxL5
zFC?+9emW+zx)rl7sm&j^Uz1>8v!`4-=QMMO-R98YXmPJi;;l{AW-4)WD?G8Of3a#<
zo9y5rdqH!Sv>kv+&T{tZYhSN{2g@~cU1f6trOYKB9nqvT+65L01@85)p7lSAbSTzy
z`R3_%i<TZ{tz~LwyH@v+`L{~VycpSz(@|ug0kUa0Y7~k2Q`>ByU{*cVRrO-*yT<e=
zQ^Q#k9jAVnIOod(E!jK;+nF@2Duo}Wqnf>cJX^RSDqwt~i*2*T;W6r%Uqc;^%Klbf
zZkQOd6-Q*BJ&nUA=g2Nc29KK4jY<hIrDL9ws?P}B=5sP-P^)0dL#DC6KXL^N%v6MS
zq#B=GHagSt4{6TVq!(%rb)}|jf7H8EZLoKK0eaZg=qIy(VBif^Grj2rhrn4lmrV`z
zx$$cqNa3?dA*M<$COYH|F!qK7UBh*k3bFe)x`v#DCDmZ3Lt1zZ=c0rKou(4h(Yg~(
zJ}8r~m7zt?tcJ41v7SKot(?fWGPVzKKNS`x5uQ)}dxDU?Qp2!Rc&hMGv`)_PI{(Qu
zCdHCIk_=J-H>@S?td(;_+<U7{HLXv4J6&U9jgBL65HAlEi|IHgUh71ikujN(p`4Lv
zDl5~~ntkbYyc*sXSbqo!LpAJyxR%4ojyj~inP9BG_`R64s+G&(Ehv?-Hp^giwaPt)
z8^YG%8PmidSeN}X2`=q~ClUUboM6G>V#2-FiBiSB=Kls*^C?~&RcY9;rra<VXBxmf
z#l<{Tn|kD4FQC{?@XZxtm7!e{rjFwlzdCc<iB35$gEucz{Dbb$qx_SKtlUm|)PO$s
zeFqv3MsVjXKW2d@?(K4&NM#cLc()Yyl)7M5IoV;=W~+2%J+L#5(FH_Y(7>I7&~G?;
zU+eG2Zf!7Z*k9JirIb8>dnJ%Y<dDP`MuVucnQ_3#*Up8`#6f4W`Ht_7qfTne+&bgh
z47sbjTgtjy0J!VWnGUipQ^j5wXKH%iIBC;srBIua`w^LoSkOf*ch01I68)q;a|5EY
z$!?@9_9I(>dHJHgZ0sq@U0V5gT;TvfI2f&I+O?DA3PATZ&P}2!%}CttM?I*6jaMmU
z)B%n;6P**|mn~C`@K)RtR0GAEx){6C>bYzzHUxmUa_YyGXT|i~Hgw&@7Hvmq^>LFx
zdcQUn&5hM5^b|hpDu^#q&1B2mpK-et@9Br&mh1-Eu=Pjp(;+Aw>gk`kg$oxypYbU9
zetogsa8_Z(O04o1|3&&d=j~~7dIrY?BsTeij6wrLM=AK!s1uWvvYd<8Aw|LTz1hqy
zX7&+?eYU^ckoZ~UyMH}JJPA*iK6l#>OM<#r=1xf+mZBY&AI67O_iU+&nu!p@HZ%0Z
z=dVFO&jy;6QaX38WmZ3hjOzb4#F80qlAyh3>l=wrcwkqN;v-Ax(BP1r8g`!jTabhN
z3OY{i?GK+6TaB93*Ac0?ZRN3C3Z45a2!xLh2bZU&?pkvbUf_DyzS8)zzh7-=wAYg@
z&I7LOG-dde|68HFp_Ao(z>X`!(dntya6>uS5qDX%tIm!?ON;E3*3mvxIM|3?Tj~2x
z+2q?D7irEW3yooRg{z;!U`v^IpI&BCR$v7i-jl_}R~gY}{uXKTO6PLJd{1W-C8aKx
zlwTjlY^UAd^B<$$Nvn6~@77%1Ar(ViRdHKHiP{WZPIfA5SdcsrRj(ymw@V)zm%n_W
ztfH%-W*(Z2&mQEqMHL0#!>Lj3Smh~ZcTPPmhZo&W@(V9OVeThS6oZc67>0!!goPTa
z{?iPqN~9QZC*|r&A7cNJ%kTg5c||N1Q#f~m{Y3!WHeB2`r#yDKavdJAA5XQ3m$O((
znKeqeZ4e^uT=B2zf2JCC$~3tsge-5Q8!x5b3v^9GN{9Id9eEDT`fGKQxn9Ns40<%)
z_nrBGW`KT`Hyxie@xr(UJu>wGcp3!s3Irt|#qc|sL7HKxg^%c)WAVoVhHoDitsjji
zuFrVgPI=wx{!uTNPSof%m6_<2YU*_ua8Kk_?Rcn?tsu1>@mp?<yx9?-NH`u%FA9Ak
zRwxAX$b|Ko?@ximi{Oc6FiR<8%Gw(~S7-|Y?yH1PElSa4-cxr&@uRX;D287shW)bk
zGn1Qf<!8+?;{X*iTWDhIVDXXNruYN;ckDD=gFLiN+%0A#k?EHpp;>N>pk7dTSjR`a
z)G)5pFjV(L1ptC-Ip4QTOR1RCXME9Q!iBm7<1zhSXsGLE3DcxQqikLyA=rUH^;_p1
zpBT5^Zx~qG4>xIg*=b@~aNOl13ErS_{qw?N`owBt!w1r&MJJYWS`C<FenbFYZUCQ9
zCA)jpnmuCZawSZ9`4wN8NQwg7`WrW{$%8`*?$bICX6CwF^}Gh`KdLSJ2JKdpUM%(_
zd1h<sgPAND(ZrjyDx)&0wlg2FfHLmaYLT1aKAbZFVmWhl0{Rj<84}+6D{%oQ8p?}3
zg|`LiuY?RkA0OMuCyNTa3W$G6vSuHD2Z@*YRq*>+5_GuY%sV#*Xo}0yEDFbp2ns6^
z*enp0;R|VEcTj7@U=Fdk_SxChs+})^SW2l=EDj9I+f&B#MTM+t=I3&zYVj=%3WsBa
zqOm*XK_aW|Vc+O7zF`xSJpiN2XH&l{?M5?OJ8W(TZBG87G<jjj1Te)02u0ra)|KKf
zImImq#5pQgvoS612>D&NZVtywY(c^uJO2B_Dc=btc(vr3{x%U)1|ZFS(Pc^|z>a|x
z!HQQaFRQ1HD+AVX-RfFxA%vpfKkgFKJt~%3a7(*g5+07bjB0&ze=dUkA4y*x4fXf`
zKZ`LKX2w3*cOqku?2KKJEuw6L7Fh>j>@#B-S`dm#WvhrRmF$_ZSKgwCvNV?L%UELU
zKi|*qoX2_n@w~5d@9W(2dfnGO&--{j9(Wd8;fO8~@h^eh`RiEW2oM_pPL#^|;58=|
z*?4x@I$h#2*IUa5XO`!9`P>ZqL*1j}nw=f4K#}uJTCqp^M|`|1=Ru|;(yBsUJ~6q1
zUP@g=?vapp+Km?9*}CSHg+3ECcjLBSmsc)6e=f-WYkhTMC+yLGauWZxZaYUh4}W!X
z8d(+dd+@VF;B;1r=af4%D~PZEVwu^UtU`@Jsg(k14r0m5=}X0h_0uR%9LL53nel9$
z^5=tBR`4$z4tZ}pTOod<@F5?nl`Es7>_&LDNkSa1(GDY_f(~jNu6HDjdO0xcR6Y8i
z^J&P`UJvL^9t~43OO!N|O91EsJ$OMSXNHW9cB>kFS$UK5nS6zoYzFvA(y>;VP(7!k
z81d7thWAF&TmPh|h0NEmr#4(emT_g~cVrgC-aKf;98r-hO6e!zi+3JKnKfn<6?%w%
z43RnCjepbgz#~yPSa_`F^ykhJ-}zH#l&X)YJS^(zuwt8wUn+`Fz9-is*68*<u$3ME
zxky3tHK7Zx(F%cAOm11(UT|&Gi3f_l=O~VWnD0E{t25Q^*HN@2V49i~B!RBly<_Nm
z6CM(sAz1D~u74!~@)gt7ImHLBVa0WI(B$m95m`xW8whNCUbmNG<m6*wZd-PAiGlT?
zg2h!6ZHGaw@X0a!<P+l4Hj6{sHLgc?Umg@KQkd#++?U&vw!{~076S;x!^{4q9~Rq-
z0TgqXy=Lh<$y)5oK0g?AR<-id;FV<E_T;eQ^zV-h?yWl9o6436G)*=g`RuO{xNv{c
zW(nJ4YSgdjXIWoOXu{lYw_YtyN`gLZqVVv1;$ulRq_sS}AYJ`jl8qzT#NWZVh?Qc@
zbzRqMdcvT6s!hwos5Tu?gopkEFF9m6a>%!711%tWLax;f!**GNl!5Wwtdj7&hRLU;
z@93}59@S2$aes$wzHrmHGGMga9{Lhn`kgmD1=U(X(~6K9e}}+-nwX9_4-qXz`T&0N
z&wRo1^iWLw=n_LJM!F}3@w+V%=B#q?NrRagS2DK!AavB?OQ4{~DD0X!wkuFD-LvX$
z%%L=EEakl}bv<SDXL8oAIy$&MzC|B@N4cN-be(?5*u=B}y)C)wq?T$JhM)M>X~rgZ
z|IEVFO~Xtzt}*2E=vJuFGS}+yZ|-wFF%y&3Z`&7E+w>96Es<$Hs-5~;Nn^J=p@Ko%
zcV-kQF=D2bEuA63w5WK_t8JQnLE8?nE~H>(2w^d9#&Sn*{hZg=b|PJR{9|O&v!Aph
zqqab;=x%Bm_4?g26Tn{7GuVJK{?)ez$+70qaNkC>+eiGLpOeBnbm6KfJ$m^k#yQJx
zStB9_uFT-LYoptlflWW#qAVI$6!WLi2cMiq5N`G3{tStIXU3yliWbu{+k?b=N_x@6
zh&0@i=<RF-IH^^nOyvj%Mdr=XoDqgGkWcHs*;n(#L%ONjt3xw>-XJr~DDB(P)3HQ+
zw4_C}=-|IT`b~>RTguz%xd1FksEk!FCu5I0oLbn-{Tvj;j(Vj`E&TY0o)l4tkFVI!
zBCF4|jqs=o2am#5XKwa`eM|b@&R@hRjgiE_67PxscsP0WU}(Cf2jCVTL?)ImlL6TN
zJ#8={sn`Jt;6$p4hZ{C)y3ka`%*Qhn&n%-C<Mj;8-e@#0^Ei_;xZeL)%z^um>uLwM
zWDT;bfJ^O$Q^T9PGyhf+gefCk@;E<0bRcm4Z}B2!j<g9{{0m-$R9t~^+=T8d>KZ%;
zNZjYPWF6zdSR1^tAXrEhuaf)b#&`fFcXD0=@V8)Ui_mJastXCat9z|73<h*t3<T7%
za9$F{sH~yfLdBi67A+h}TcI!GlVJ4kZb3#E?ZFHNqQ>5SqaEVQsSmz23yQo97W-n+
ziKrr(gm470Vfm2P;ut~nJ{^Vad3CW1s*ZxXm8^Y$K@{>D@ks;V`H)S4#vz+3h~KbT
z{fva2k1I7A=)e8cjfCSVWlkR6^N9la>nsD;a6enxcgg1qFHfI$JGt_e|Ff$QxE|~!
zRN8iS@`Bk*eS(Mmo1c{NPLr~$&b`3>BIHIj&VkX0H)%}{R3N@?2FLx^LcB=QJavz4
z)F5`^HN((DqVSh$$4lo}2OO=;lFQ9S{v+;LDNScGsy@rkd&DBmD-W;di$I?-bgi~w
zmSWsS=gvd=3t|URDco>YQNc&zE~EoNtom*$>4Z{~{Jkm{`5D*uYjs1XjcrDh9@}EX
zO62%5(WXNm_uf))T3Ye(7cuTd>VocZ?2jQ|k@jkHDzmaA^SJ$n+EVNud}+Wysb}fM
z4sSId1;{nIT+WqelWybwvw`jf&ZV*iv^j;cIA4XzucrvdlU1Ptkda_FmoPtY{dKAO
zBYU?I-S%6Fzve9Hhd8QsqE^~eo53B}z5;rAs9N4@o5Wta_?e##bdNq7om^`X;)RG1
z6pRoYAqr`^SI-W5v@-}0&Bw#tz`HfwxE<iLH3lkRyjF-aqqKGP@ZM`12H(9YOr~>&
zsTX-P2C+@x!|m7;$Atl~6Sp;q7nkjcaV)bxl4FjQ*~oiKVjp0F|AxJ!j?eQMv4y>s
zID+ihQv_+kB&Ih%^rBZFC9>!;?c6`2O_`_(IJ#3wIi7Rfk19=yKQxGNf<2@DUTvL8
zzGi5Ci+mA6Vaew`f&l{JEH^A%>Qi&M&6})B)+-9k^_zJofbg%vX?-M7I<NR6tA>Cm
zQJqN8f8Zs7(Q};RPI<q*#CC#IZw`7?MQL#>eDX-HX_4yMjtgSnCy2g^K%C&^a9pVk
zCQzJK08P}oH*K(32`wD^NWbW+7wz(~u8`VPo!W%SfMT=4-`Eu|et(?t^szqAOYz;a
z)VnoY`op6sPO`t->_K&9URG`5H4s<bW)%L`Anw*q;m&S<z8(|l#zcBZkz9tdbu%rT
zg=vxkSnt*8t9NLy$f#S`cdS9OS{kuh+#tZ`gB=tTAeR%#^Yp@TO2%+<_wXn<yZ%8^
zlEUTD2fr;D!)=i<&>v8}Pac3)dqn=M&|Cz|CAP6z{CHcpE6KKbm0dtgN84{Gy3}c@
z&GqYZSDiY#CSy0+y;|n<<$aVc%fIAFoJBW!Yy&^=e=kKXv0FREoPDi^Iovr4|D)=*
zRjX~&$ue+MtIBd<YwfBvqU10k7$3!)Zviv@Y2r><jO;0>#7byNTn7DL^iU9>wmWrg
zian4P?nYS}(M<teO8oiPWT`PZ(7|u6?Fy_r5FmnIQAIQ2Msg4jE+N1CiQv*jPFy7f
z`CrU0mUcOc!z(d6%M~s!z3a{;Qkr!q8~@o?{7m#|-ex5#2}WoUy4>qy%Zc<xe8aGf
z1m{WZjmgr6op(LxSXJa7{#_HkA!al+WX-s>qNV+_*7T!{!pWnaV1Efd_UG%r{h9Ld
zAQ(XASNYeW4n9!L<h962!77@{YP*UDG^*ti%7l*kqtk^27=;2YH|%1@DSl2+sV~Cx
zhDea*6c~cL0TWgr`hTLR8h>7LWO>~eBd8!p%}~Tf59tG@6p2fNl}4G|Y@saIPGhZ0
zTUJ5oGvP1Y6nhY|-@re=LQZ}Ra)R}$xSj(8fu>{wF`w*KQ~0;WR6)JW6@7zLYUYrl
zmav!$ET<Wus^SDFayxy%Mn_p*hCb98CJQFV?xjVl_1|y>#57RvJJp34djR~Gq#Inh
z@G6E=ok<pK^!L9_SLF>#h!ReKwBK_;aHk_w;)`zA!M2y9LC0r+)ElYm<0LoGozG33
zC6s=jX86dU0KyY#NwxstPs*>a@-EM@bw>(b3XLM)!zzjzJ%I!*n6Db+8&%I3_ZKt^
z<$*Ci+#`wwH_*hJ8uN8WP?y{Z66J-L9rpfVPsJ%qb;0@*t3MuB-n}KsjzXQ=aw+#8
zVry7eVSsObCvy}}Zd{?%KP%{JqDBX*{w!yyehizx!eyx<Zds-5f`;%bC#L}Ku3|rx
zg7e~Jq6{Susg|5}9}vPdJ7V&~i4W@G*CP0{(qT%f_ue_7(&A8Q`u{^*0Uz;2rQV}6
zSM|IKiojGc9cq3If7<cnC7mRbmE;rKTV4{*1SeHlNUTBNB1EUlsFrTY4^WKoI&`=p
z?mj?^Y7ss!6wtvxl3HHP4T}|(^G3)`?QysH{NET<y1PqS9ZpsNpnI=Flua2(L}-*v
zbE>bOlaM5nbIB7t$pFed80DTLAH}dMn>^vp9F5bu=7;Zbl=vpe1{~nvX~aw3GWUX5
z;3?1q&LTLHEb)K?-$lT8F%{-l&W`}cRMBIqz{}>w{PcV4^m}E6L5<L0Yp#cFe=Pf)
zlK9(&FOf96HVeOcUf718?rPVUw(CgNeFciN=3hmLn~mtNcM}-hgGTQaMbywDYW!?(
zoV2dRCJ_h@DWd38Yc(U9Ox5~pZvTUyLhh<4$JD7CxA}w(viOGTZ@DoIAoj{bDU<tK
zEO0KOC4Zmo4jV`z_662)zf^M>=&(ZDT__&I^!KClUr_CwPwqQGP_i68{-@oGD1}-D
z!YL(uJV%jG{bnP*kL0yOKd7MYUP<1(gkNLCMKj`l+8vDuy0A6Bn12(UeAhg44Idwk
zkKZdruC(tj0Kc!c9bPd@^Og7mVMYA8DOyr_-suLxP>B%_8bDJcnFjhygG3nNNOl#V
z1x9Ek0_Z4Dzi2Bah{%d2vby5qn*c%tfY2Z}`y}|59r$|zs03Ifh>WB^w``Ge;d@z8
zmx0W9l4A$$FW_kBKT&_6bL!DK{S=bL07-)+<zC45f(>IHeULq*gha7ReUjr7d?8<^
z&NL@&3B2!o%4)(Q;9`<7fhu%@L5M#<Q>=h>6r18$^|GI@5{~84OFIi}DX;cuQ0Q3&
z`SmAWFHZr@Pe_hEex}a-0{_SO+pW(RlYbzJYck%ni;-RQ^X|tviq85D^B8-&qwdS5
zIFWt5&Tiw*ZX@?Nz@=Z!eav`W?sK;<iYDe%$*@{Vk@5CMn#n^1bgmQ|dvOf~bs2Ha
zM;v$Lb2@=`)2;2^l7lh#=uAxjZ%*1aPQ#oK%5Uz&em3R5k!-aA=`^>l1>z9l>H7X6
z%VzZX0@Z*nv4E~{y9znTGcS!ws$VnL4@If_vdgG*(>j*3;Fh)X^&21g;yO;{`u-Do
zw}-`78RIRi8(8w%H7{9IM2q%4wy|(nz{c{-aq4l6lK)bIyOu5#AcC$CZhn-kWaSwE
zh{)!v8|15pvrO&t>;Ts|i`uyrJ(7dFP7wC@a*p*WMjuNU^X1>7DT7RC!CtYW2a9b=
z*ekFT)#AgRaM^d@Q$W7D{(!`*P$jZ5P5%;fK<|A1>4Cuv*=sx?ZmD%$BvYSxbFn~(
zyvIH1Ns2W84vKAaEs@i8^b(J^Gp&@mH<T>+Vb3PC#f#EP+3!n~9yF0q$`2bQZZ_eQ
zB1#6izqjY#8KdZOoG6r?wgjpI<Ly{lqw$G9>8$@wU>{z;mp#*F(w5%fmgc}b*|dre
zQp5)n#rgQ}m6!6nCkqaq^v|kNs?u4+jbElA8o7`O2%!ek)9qZpNmAnVsoX7#SZT8S
z2av5oshrmrjfPhRHRPWLZ_HwN;yG=7`JdY*own*#J17Xx6yl!ZLBlJI+!bT@Q?FD>
z-e>_e1KWDJB|RX&so>vK6KXx8o&>EY!TyJiRB#|27-*-PZHdQ-Q@PxzTp*Wz8A}mg
zFv5Py0B~qPUe^b}k*?|3FqVJLq;m}W>~ZiI6+BjuJ}Dtc+-K!c?PujL;L_{(7n92~
zD!U7?dvthz#-mdTh^K?_^x`uyT&ZA0YT}-MNFm-t0<MS^vCJ_<9*DIa=u5yCB{aSR
zML@kD?kg-QR&<N~4+a(8;egtVmsBwXit1ZX5;q@F>x>x#*t$b)VqlN#obkUgV$SXj
zFt3>1r2HYV<!*x<ReBk)GQ!J%)w&VR5^aH;cje*f;PRRtHy_lfUUu?CbNUt&KkgH6
zMHZwrREsrnd-now2wu~@*ByR)xs`Msgk9n2?M9{JetGF_<Mb*My$!Z7h%O&2UEE|6
zc}CZ|ThueF_cJSyV<PciJ;zdrt)p?85i$D}NS+JCBNG5b3n9=?u5v}VGkx`#zDP2W
zz{2i|vK(OdO%}Ce7`UAk1M!SiIudYjDH04nK)??$_o+X2Wd5l20rJnLT4dHk>V5U<
zeHT-=81&+@;^{}ec8mc>dhr7)uc;}4F+gy3$fCrUJEuyNQOzzT-|e!<sipMr+7_9A
ztU2wO8lQ?hFT+XB?lMe#>^gQ<qyE-n!4s8Jvn*Yl_aQ+-h)FrIgOjN7AzJf+9j@Nk
zz1~;}pB(-FK{Ou*4o;A>`}9*TgH1K)Lk0!EHMC6hwM-6)a|qwF`0r@9LQo|uXdK-5
zJ5gm2Y!iLvjii=b>`73JxVI)N+9vi<vAK|+VB$_Nfq)P<OQAP?Mcdb9`-SM+9Akyl
zk6@4rfxt9gLZ$z&QK5Qy$l1GulmquHg?jpmCT#<5?$Ej3QiZR!7*o%tbH)~m#TM2M
zH}mn306ipVkI`GX^@w^PNxKvfR!yl8b;7~jaB#g238pA2oTS4b>d^a>d8SbGsYp+&
z8mSS1!W+9pkwN6*Bq+@8M5uxteH6&v$U0T9Drt6|=#l}?{L4>-yAk1v08xol8LXu#
zR{<DNkf>um$TQAf$Af{Mj1Ze-N=TJj2k4agn5Ld%r#W(;bGTpfg>S}+2-hRR4+3Xe
zqa~k6W{pVpH$q$fGohzKM~t9*9(E4`v<^muD_8@%okr5*I)420ph4Fp8MW!es~s(k
z81W{IxHHaR+smMm7Q5W?knPIE&+6nxlb)7pF)NG`C|TbnL!UineA+#^)Om-kPf2jr
z$MpRk8{f9U=Y`IaOhK4e6?(ZlRqGMM$0cKFemEiVK4LQjGCTbyFQYJ#8of-5UJjJL
zWgdvQX#&di!dA8s&)9cYi^o)p4|`Z02*3endiY&3l>&^=ouQ&r#P)bM=zp>2lObR=
z^273~j+V5Za9iW<kow8e2Y@i<Ej{L~*wULo<Kd?M^KJw`q*gj$Gw}R9h~Y)9Hw77a
z2SR!pu8hIk513UTi~BH(i_qU!#=*nn*IkLPyH+kpVr3NSA9h^J^L9d;eqLiU+cN(E
z4PrC<nq2;B&%sZHEGyo||A(|8AQ2(TeT0tH7`055y#k`YSvOAmL2mWq%+Lx>4!qX=
zhU#>QRNiHQiy!B|dpcdiQ8S6zH1($JBz)2n92A59NnqUnS!gGDZ%E&KN{?V(&bY^#
zTK={r%XAlY{jNnC<|l_+G1{$|zup|o@-t$)+TcX673iJPUBDh&%+EBJ6%eSjN6@Op
z^orw&wPgRnWd9GKVFhomID)x8!8}gE@uY>HU|#p&^4n+$9X_=ks`}M#qF;=bI8Qp~
zA79(sx()m_t)|jBJy%V+hGqOvp9VN$i+O6@a-VXvjr*U!l3ePAm>A$_E_PZ^H~y3u
zHkcUp0Ul~KsD)<}!?VRhV|i7VpLaZO-|MD`8cmO8$-oqneg`v@qj>`15@eVJ$oQMA
zuLy<(fl1OKZ^p6A4FgO^Kpubxb3E#B6d8&lXUJSJz_E$p*w8q(p*o(2Y$C?|S}d*U
zhj;1|5SB@M{y?dXX{?kZ(KNF<A*m(?D@DLc4XPHM5Xd`qfT?ysB&~|(9Sz^@*_W6+
zq*9DBKzxOvGFQZnLT0))h-M6;S!v>LOKv*oF7c$It+Nem*9gx}Mr4~gZ)<EkX~-Jp
zlmn42w&vs%B6on}+km=C>NWdLAaBXpWr*1KCquvsJEWToVjU~B@y>@E<eZd-0x%ls
zW;y=`TS2OuV8ydsP6@0K?A4oa34H)I2G5*qv9+^u-i|>SE7j{vvIIdzNNRga45jh?
zWVD~X$=6?>^kaZs&~Wk515C%6tLI?d1b-HCoIDI>lLZG71-=BMJfUTzyMF{E*vUML
z)mNyN^gUvrW2Rw$a#`U|nxyfyL`rp%&OHGPkA!I<DBJ9xMVTInTLgCz`N+;<85+QX
zKEqml#?kBE`U#AyqYxqN8a3U-Y3en4+ebSyR->w9CGd&gjnsL)q=)sG6~{~?yCU0;
z8ze^dRZ&gedjc9s=c(_0K+fS|<}g8X*qU)@$JDIF0YyGUwnvIh7m=z|qtGKUzXsy^
zbpPT>5VImt!IBg1C9;8xpIS*%7fB%?<`+0NZZ~3*U_C<HVF-mKoipp702Y83l~g`Y
zvsX4Qy^zpDhs86KdKU}*K>A$uw`<uix?z7}Uc_Lp3<IUsSuk8%w;?vHBQ(f0uB9lh
zD4iw1s~AAT@B~9q^!$a8+a$ebcme_26~meRdQ{LKfMjnB^-6<c#NY_=C>?$3j6QDc
z5UqHThL@;>F}2?G{8#|zt^(!PfKwjOPWoGX2JNzv<sf^0EWpKV<zcl`KgSIQ!28O@
zA{pd=c9avP<WRw`O%9nBMV_fW4H+SmoFs~GN@GdKbq-H*dD}9Va6JN%NI^kti%ubr
z?UM@@@0@J1BN1(n<wMxn9OfmCq>0N*>^hm+&yuoIPl<W)Xo$*@P<#mBY5tMP7$mt4
zM~U>J?4V^5wNcPB>l(PIk^k(;-@v9>^*l*g%%)HlBY`vvQg(4Pe2g{Kk#v`4V(f-^
zAgjSd>97GpCTFpFcRJp;wJ){sg`p;XwxNw310XiDidj$3W0mxpCu&PRu=f9=WdAa8
z3xIgs5Ulh{^G&`xY+~uZVoFYwab%mgsMSA-dX##ZNzhOF@N?2&hqSUIgBIwczbVl)
zL8%>V907KK<ScztmHn7lPGs})9YgU-Lj7O;B*~Z;GL@&ihlOvLqNwNaNBlCH*?HFp
z-~6-2dQF(2q90PgfA}K}+}54u$Bz6@PoxfEnePy#h9b;L8BLQjF`_m%I?|gMYnSQX
zm2I8N(&yTAiO4@?cXzp}&&crHo}`bnHn&25n7mDVPeR>BOitHIp80?jC2m(y6FrRN
zjKsyZqMh^_kTH`+f|N>msz0HBQeb-$yMrW)N#wW4O)lelFxn@|G=#hsm_1L(LQ%Pm
zMULsbnx$+iFd!}A)Mt>NYOjoe$h=r6Ab>`Ke`_w`AX>C0S{~|@uC&LkN<y)a)iABu
z^6I5}#`BoU!Me6+K){M*Pc4YW=^sbs2gQwuMu0(-%1aLJZEcLBSdm*DX=9Bxfu5`e
z7=$Bl3fE_CbJAY1Nmb^jX5<_x)2gZZQK>0!pRrwxZQz+)2HYsS)BCLT^TSkGtX_aS
zIh8we862!^rw)7$EWB(sVUs}o$C~uT1RJ`-RmI=<dlj6%3Myu8z6xk2I9ng3O2Ub<
zRT5#Zm3q_x9Wte-nAJiIFAWy%efNCclGWQl{V<Y!IY?p_EHOKNCmDo!qu8t&&-DaV
z^hH1E#W1M^G{Igt?@G0IdLUi*lUAEv8fx42tu88^sM`QAbOIpDC9Enb*w8h*g6veo
zDz3s7&`L*Cs1;Tj*fs+eo0Y5>GdYM7UEd>zgEr0^9|Mav&{WTXw+N&YmxLl<@D0By
z%4)`tcvH;y*k6?oUGn*@<i$!@(pAW<P}wc<5%slaIrU_(V@t9kO$6v*as)^_fMR=1
z=384~wLhSyz1f_go*X517Q$GDteh}lQAq9CF2;2bxDfGRv4ZS)vzn*A`V;|RH(WSz
z5+@M7oN;v{Dd6*f!Kvv_kEZGwr%i-60qqm!5)u68P8r#?U+Z6oz(9FUf}sHX$S7Oq
zs*&;-`B#x*W{`~Trp&J^P@yZLCT%D;mo!C;EA{tuyPtjHP#gGFQ#yAbEnu=OK(aq_
zMrYG2yA1et6{xmmBAV#b^YGeDG^ZZFjBa_m+z(R998k@3GisRp$<;gCsK<CEZ;nlu
z1S>a!q`*dm^lVpU6fD`Ul(vTgbxEV-GZ|WxMXNF+5>R59=Fee}c#BmXxR%JVtm-tw
zxAl#lVBVidNlnH|F=-Y!wNi<49RC%Fe^cH7%`HNyn#6M(v<dgNkvR)tl|s~<K0>!~
z;A$B%vn)SFU83KtnLTW)Mn0XAK09jRZG<qANB8Ou)zv4;YMGr;OSM_wF%r+awphi|
z4hBP4artU4*YsxiE1pSx8MLsI#SZc3{Z)#rt~ByZRvtIm?)#1X9%E^G4mZR<^4E(`
zkfCvJVIsr9mtBVPmF90bBvqgU1n_KW1T2Wrhr<aXe(sFHPq-hG{xR&tx6~>x>nh3Q
z*T*PhWdE920b{C#s8UQ8dG0jB*z(HV0Tk>I<Ex5q5>$vuRn#*GXez=b@?!6X7<Db4
z=yz$PhoKF?AdV@Bj6^828On$W{K5i#;I@8^`WLuEfp#=QnX!<|QK$}m)L(xdgGtHW
z!ie72M%HuQmK3h$JJt>HqV-o%Cu^4WV5b6tqdnb&)anI0VimuTOPPltyx>RY3jDLq
z<U-$Z5!?~cZh?Z7BLKTr!7&7zw@YlKWujH(7}p4FFW3q~cdI|gq&k*S<ub4j6+{0v
z_D?lOI$%&;LgMG5)@-PGnb!5ZO!P-Ybtm`rDU*eb2a3Zc6?g7BHaL}hfjs;uYb<Op
zS9|H&MI&EJ=$<F!C<TowXK6Z;i{$%wh&oG1jLXQpLP##}A;{4x8QamR5pS)QmC4ui
zO?w;hFz3t-YqI;~>ObVlRdM6ibyt9k)Z7(__BS_X+T`TJerK)kOR0+6vcUr0H<TD9
z&Xeb>sMDN+EgAEpLPf#)9U8-`63mTY+0W4Y4Yb~t#*E%3vTC`7e+!<$Azdml_ZU{E
z=e8v#m7|}e6ywTs&^appA$;<@1yN0J%iv&sLOw2{hV8^>>r?FKs1(#rqgMXk_^I&}
z?3Uu#e+GOSh>!(Q-w={%y>x8>?B?3JtQ$15<tVKY$<V2&RK=?HT=-5<t=wg6b``P$
zi*vMdK_8pa&I4EEsypTkbD*63%m5t0Pg*b%7l59J5ogFl%FF~+z<D|17};R!13+Q2
zvLI>lp~Y1IVWUnqSzrT7ASH#-DoJDHQR@A66O~_Jy7>-wljjco@Sp52q3<B7tf!eD
zP0<0?IAu|F;i1wQR!2p|dKDW15?>ZAae=Qi1M`axGBN8Yr!bra^Im$0)~xf$!^SQ_
zFL)8Fp8&WuH454lEvFYi?J}fySc9mZsRhH7So-Jd3jYFVI3fZ(a-MvH1TPl{pPQ7l
zX-Iz#JZsV$3PHVDOrE#HzcjYkM7~;<ym1Qqp5r^A5m4HIEgvElp5#ZikgjgoBi=?&
zL?zeGLjbDOA-xXG7`BK?$;J^xwPVlB0!Si-d81$`mfEgosw-XHeCPJbYb@r~@i->c
zvI=&GLnesk`$75fdt%WB(rs1p`<RJk^h#a^Sn9hw?uDXd-V&(OakSIOw95@)v=A=Q
zL5z4K;S&S_)F`UW?)BvVb-%F6oAh$u@(HY-*LZLsdxjOO187Y|BbQds+W;j7-&j6|
zousId4=MK=#InFlp5^rX1~kSmrbqVl0sw&A%tRExi=w2{B2rK+NhpS2797CDAa((<
zG6Nf=lV(T26_z(_85<tcmygnhkBxcaq#VB;vRf=@oar6SoL$5%OXuD3q&0M8FNBKo
zJEpxAYwx&BBJJ`$qVOs-yeQZ%)+%4xuw-qnTPryK!X%R&@9Q^Otv6U$W2F<!9I`vw
zxtSL=asHK4{-akVDM<z&AkF-TOJKqc-v441zPs9$BqTj1^n&w35xJ?Ee{_JFOk!lq
z1I~9CcQ<L=4r;@e%}Q1Ay@zD@53$u)+wULS{RT;$)2iDWl2v9sG0>!OIPR$*>6dt$
z+XqPDtcZTP<Y9ap)7{$7Ig7ke@@F$eXD*^CQ#-w+m&N=T{wOtlM*Oex7W*d&mlqQk
z%Ak4b2_S+0j@hQE1}f{S%PCb+@xdWNv(@L)nfRYoA@EtP8r~6ikM*AoW-IM51FpE{
zWg)*_wurlzM#9kb<+)h{{2m`J1&vUfDsk0u_X~$=*bz~7gw}nY*Bg*a1<)H49bO|T
z?CYHI`Bskqh_#xaz-a3ZLCp7qdzrPoH9UtY;87pAz<Ce1igsK2P*q6uel<G0CcbKY
z#P(n$S*E$`dCM&KL6YiafTwQf)%$dnxX$;?9{1ZM8x%%+6`LNWRSL@7VtMt!);c{>
zf&z<)PRh^p-GN_zuP^csXeoZ4NBC$*_r?wJ>fVbVHobm~waNW^;xZ?_ykfP=awDC$
zf(mV3zAtl*^6$_>%c@&%^>k#&=e0%<yZz6JO<YA_&jQ$ACq?a)+Aa8`5tuZl)Zdu=
zJ~Z|H29I-}PwEYdb%&k9k}<HAm9p0X-PAvOnt*g0gZPN_+E#b9f^(NF9Rlzq;DOoP
zSg4@!7w+X-kt5HYdT+fDWTMWs4);&s-V<Pt)LFhpu@BvVZ_m=6;=8P3zPdL<63PLO
z=%7ao)@qhNU@AbrHOG3I{!(FQqWf#*OFQW5Gaa@#wyr~z=DJn<=xNOWVu+`t<58`M
zjLQp^$A}{~f)R^C^FBzElA-)7=ZTZnM-AWG`k(Bi=&<d-fGL~3`wN7BV%S||z-^Xd
zhEfHxwGtNdMdRDDe8(GS07;7<L-lW7mJf;|Da}fsTd~d5p=bf(^6#Kg-vM%W*?wA&
zBze+5{80@|=rW3<w11+sM1XYSjccV*$?gCR)-eWr;(eIq1=0+WrS+6guy^7h;q;Rc
z32{cHCQ*D_W(S(|TAFh)%d;zK5AgIdugR0Cqb5>9ZNyz4-K3z%o(}fiv*gNE{@FiS
z7o_@6RZTuI==uzQeCK4om4bFq`xEV-f~m9``77A!!xM9WHPG^p$dMFLLeLXyx-H|>
zq~(kDW3tXy(%=;XVt)(lEB0AkU(D*1vLl6qFr-QtQsOKpYsZAjuJ<*VIev3PWAm3K
zs}l{qJe~g@wZBY&=?(agsO_B)%zdLeMGC{%GsW&m?Ni1!go2*t&X>@tmfCx`8K)OT
z0J00u+5*F9ucu_k&WUP4+&$U_Gu`96KI@ZY>=KugvU(o!5(48{zQ)jG)@XNrc1Zs2
z@)%7liTGS`ZHX-w(`KnSe6V0ks08VDpGF$b>5=x7FdSpg1Tpo^B<&T|jbB@m<>3w4
zdp`BRZ<sHr;)*XJQ|N>gn|Bb(YlO)wO~6GdnLl2Q1_rFJnWvO6T^#xCAY`ftN7sIu
zGhOsD^>52)M|1+VNz-LbEXkd-@LbBIz=jQ1*D7L+v3~mF24B+>D|yp^_$;oUk@cr*
z4fJ44Dd1Ypsj9>qwXOj(-93ly*Ef>J1_Zu5O7wmXHL8?+Ju8IC^dU|v^#;O8%vj3O
zN9oQaW@@~*-*Xf823mvxIVl=y_Yb(*;Ew6A?S)T-3A&EV&*7jxWqZUPk1DBL-kCgS
zz1OZ23c<8k#gS*-ID;y@q;p8%^0Zhh<oUeDH#}NX5;cyzw<@oo8@@bb5=7v7wa0VR
zd+Ej-F3gY;*2U9m7J*^FZqQYL==q-0Gr9lPPy8&Rq%Dye^H%zwl%>W549Qyhax@ql
z#?T~MpWCwSRLN7TSqDRqE7D8W0{|s9m9dB4lGqUH^)lSBkCOk*GgI(la$hX*9=f7O
z1Et7{k!*&>B<n9fBT!ax4m#w|w_ulN)Ghg{LOOy9GuQ5_v7K6zPYud=X~41!bMN?U
z;tKP_vr)xjftMb9^I@`|Z0ln$_`iPr&e<zKE9KPtHWsa<FG<%4kfqm9bu~w|V_8mt
z4Alw~vCtls(P%D#1jwen)gs2bgF7ol+~{oMH4a)D6Bx6l?@OOfkE3lhG$!tF{(cfe
z{Th;XS5WUQY~`5iUe6rc-oyNpq+<%B+0AIB%KO5;R!E)tGJak)xaPiM9$nQ<Ww=_+
zjegd6^lkH$_IRkgYxQxyRT)&PI6lSfcFJar5<fV~uyw8_E?qhToV$FE{A7*DtaK;W
z-p0>NY)<a7y#A(JlEN~=fHwsJAhVoP9WVp5VVgT|;a#!T6^Mw6cnO-V>vFrf9`2pR
z7$jqs#ACmZVQ_%1!nb7L^7SD0#*SM=ryZg1=U=3aP~SD5$Q8wKb*iUmEK9$z?jMRv
zOJ+WP(b#?o9pFWpd7wx0G2HN3W8{5}*-mOYJ|#UyRt`YKabntb^x96DGvU$)><_w3
z&J4JoKGEce;fh*&R2Bkk_2u_{_(g-qguKO-dBj&DPE+3#4%n-{>WNvXs_v_zqV!a)
zO$wX4E{1WY@Pvv}hPBR*s5+yZU{Bv5T;Ck?DD9vu7BVR!8>0p|sHPFv)6e!ZFh@c(
zf7FU)k8vI(d_bJuVD0`Z(*4(hU}ogILtG%7HhSu`Jg&pSa3$D^wd3K!`h)JlsqIma
zANwal1eC)Aj)+a}Ejddw{@yhdJg$^z@IfJ1@XRdl`)50ruWKOoyCMNMIX`YnUrV-P
z%M-<$%&)$v&j@4GEBE4s3*RWGa`YE1&ZG1jxCvtdn#-iZ39r{dUthX{Um^-#r%Ot<
zZI4dZwE$Qq!DlAqac5uWN!%{Yt^UtLJp+8JT<qLmB?+WCJv&@M(CL+??}wJV4@36p
zrSA2E+xYWX_AS<t?X?<}^^cLUtTxO*!}j*~kj-_mM^h{+`wu*~;a}#gSB(t#BYib_
ziExKXf^;6qQ}t9i2CRu={WKf6&AWXK95BVF%g`t#-1W0y^LXq1E5TT5L=wK^ipprp
zob~ih)HDBTGD2Fii%<paaO~GW_Cv&5+}e?`oaTHR`|#aNH>1bVkW~%Ru2z!XHt<o2
zDsu_=V=n9SNYd6mFn^LuZ&5$5^nh(_I#u&ncy*e%zyuaW@ZR1E8Tv#|{-cvz;7nu5
zn7kbYz6@F^XI=5{d3q?Yqiyrgb!<H&BzYhCrMXUvf4}<PPh{76UgToKd=k#Z0>9GS
zZ4=GeU6S!I;akx+`3VJ0w%nv%y_EK)o7(lEP_k=WTa+P5YI-}9ZGr1aJn<WZ<B@aw
z$D1qVd^DwQ;r=*U@DdF%+<E$U7x9}+IGbmw;l@`nlZCgAk6F3SCa~MjYfw!*L{AR>
z0ma?krKY{G;64KpbQQ7!bRA7Bnxi29OP8#2-yF56KYp=3D3Jd&W~|`j{li1C1B*&I
z6y>99bJQxvT+rYlz(&0^3OJ~zNmTj#@J9#qNIrFvzsI`&Z8Nu9QB~eGr+QN*+%H2C
z(*${}-2BvCL2bgn2U2H!2rFSL-}q?eyvonCgWcu&`zBqIkP#9m>Rq#>SEf|2xr1kw
zA90a9_Y?iD3;SP~N&Ki}<+xl@1ESy>*U?40|Mme@^Qc}?zfRfStE1khAhL1wnx5EC
zDMik@Q?;?}aoDIv>cSSG9KL&d!q`0S?zDF9Q}&TW|C3cm^6kpB;~41j4$8och?pP?
za?)V&WVJ1LY&S)JMSt^|t=?i7<C${m8w<Mb8bo`>+q^07k9>6l@AE%gYBs4}eAcTs
zRp-5Cp<`%}?IE}OR{bO_?|}h5>4jylP=JO?-n=2m1Wzdq-hs4MKw0A{&l>M@4;N}U
zJ!Tp9e!~*JXH919Ve+UA`scfquEzI_9?0gr@}DhLty`M*j)vU7#kY>}TMJ3gKn8P6
zvt+QdvIx$ye4BgB@@^=h;}G^WDTWH=zClt($+_k6Hfu__BFKCd=vtqV058tc=WS-J
z!sPu67ff(yu9D9SSPW^rGg+hH-8bE1e)K9p^9n2}2KKerKlP$YgQT@qCF(YAw+tSV
zipwt@3cgSuF4<h*pNCiE8nN(tR@$aB*{)-++v$`5YGA)zK4sciJztM$rov}l_&`~4
z$)naAfSV$6B0Hk>iyynI5=Be5L6Lo8%evKUTVCeGsG@VA={<=rkYG}7mKdKo#DxVX
z%Bb@2-p3NFd~7KFByp?j9KU1_{PLg&a;W}uBh#m}+GT@-YNS)0fd8YSBapn^BlE3B
zme1GidDTz&jn$L&)$;@&Hzjf6@Ot0+7P=QveMp6~NT<WH(<50p#wOWX+gAoAQ&50j
zEM~Gk_~lt><<}P-=J)T{BRo&kY=?&JByjB^UIXjtg-y+*Uost!^Cbqi_}9cnNVus8
zFUEH4*!z=Js=51;1;OvGCVEXPuYMfiAjNL743wEZW;46ZnL7&1;JzH1SMQE$Zei~k
z0BF-Ml!|VueasWVWVM18yw<j_N*uZ}IV-Wd-FOleBi43zu}#T7nKoYT{WN0WtN)oT
zE01~DX9u_k_^z%VUp&P5%jrjcEI)v(GL@Vm0o2n#XmSGF09C-uj|6F~@qT2WE0!4n
z^?0iT&e<K1W}jF<<S0hvQ*OnjgJ8lr9dW!;`z%@@Xr!qQ7fN|JM(J!h2U6=S2iLJa
zjp28A0ZXid{m|;2Ims_S84i6UQR}f$MoDf8g$5!rq2jzrDzwoq+FMEK)qB6(Sjzi8
zo#8q&U7h9G0*ztw(n;xTNq_FHCHDr?(EehbsUhIQ`DzdN?zb)jFFpr)p0-G|;7mw?
zt))QkHYLcP;wT@vvo8VKm%E^E*-}smJ5JH;c({HE+RZ+kO~HLue{OidcXE=jW8Q5h
zVE7<0p+i}(>yb9r-C#Zs|F02$5FIRWVVfS7fY4ZETZVYJ#tVwHJlq-iacOKZH&hLO
zn}Vxe{-8`F!ECEwtyRNh4yHi0m-q=aPxVJlXB;&FW>IzW0YJQsx$1W;GN1OVx-Fwc
zR`I><R%_1HH*IKVJxu%>|AO%(|5<51Yr*Hc%37H%8CnAFoCM-#Z1?`y!?7jg^5oOw
zQ}Juc%ZKVnXl2MTueiI`ubqCd+le7m*I}5YB@k(Xj{WGAhghu31Gx2gh&CN%o(I}i
zDaCtg1@2p-P*^qtWI14Un^hd96<w#>yQ#>y-=45^$aad!@(NkSngUrP$n3U8r7%X?
z;+8ZevjTjaUl@IAm{D$k{Hcf41@r#|3wrF(?KmIy>@wl5pW2nXn}-Z(ADd-|CB8#E
zuyC?yyDlZV?(Rs1PBv#{bp5aKJ8stfZrGY~gJ#HcH|yr90`;+FbpGlDGWx5n9p+GR
zd(vQ@YbTa}B7~aZMtsn$NvMR1ZA+gWxHHniKrJs3#q|v!3$ZA7l?M$VxtIiD>$DIn
z*;ENvYE%P2dN<tTMKr&*cqR5hH=Remxf|&98`S$1BJ_E4Mvi3{xb+4&KQv`P#DQ>}
z^Qx^N?n6EWwqTY`T5vz~ZxESsd=c@QJ#kM#Q1THTwk~+nIt^Cl0x<{ojC^zWeP{S}
z*xieIRJl(l)*;3{0taJg2_Gi{|01-W7xchPvNvuj9Mm6x_?WEoD!wPFKIMu<za>%G
z$yKYsITq_rG>LkRW95=-0%TUw?A-ymdvsQ!$&fjnRU?&-UX^2r(WHU(EXeE~X&DA@
zz?ga}F4tNOC;?3060QTMd=74_Z{q6CJcch<wsUp&+MlrMdwa*TjPKhiuTt&5dErMp
z^8ly7u>r6NMPgsGYW)s0)n5|LfgtxPd91l&F~GB7K;6xBFDm%iq2jqogPu4g2r5c;
zHWWH_RcPw!9{b2^XFNr`9m~1Iat4f%tj8!2#B2x<1;t}oiPQ|*Sppry89+Nb*;YWW
z#r>NHw;+M8p-H3sU4TbxI4u6DgAizyD#(Z!2X=zO|I;U$AF*N-U63D}sEN&_opk_o
zn}uHdVz;E3_da`((iy|ZgOBA_n7=~jCIP5>JGhGGfsQBOCR_d#_5_$gkN$c0T_L)3
ze?_Cpp2Ve_ET&)V6r-tWqkn(hE_e&kz=h&+N!m9@=eVgHGwxKcSVbz!Cj~DdhE#z%
zEB58jZHWz!jq}{nAZw1BW5`E9aX&Y%SL{_O+M<~8I$S>9%K`5NC*Gna$eM{)x7tp+
zBX&zuxh93K-h(A#!ITvabN)Q{W>nLsZ{1wxEP`?n7rfg@ShFOjdR-<7PU8FB9o5u1
zien{1Zi>HNLG`!#(_bIL=qd%vmvJwM{A>auJ8phqRGUL}z6*lFA-U)A9q&*9*f}i^
z%q+ozXrNKpI)=TmB+*y#8Me-jQ5^Z`?$W4_sJ_Rsy`aQw%ZT#7tk~@DB|!-sZOPI(
zkMa_ij!k<Q(`#|7&7G<P|M3xKQl|+SS%BoA3_%*{1<GwQee&Y30tHio*0>ZB0ACV7
zo<h@d6te@KDft8LNSD81V;_NgS~SJuUZpLYL0OrN+mo5Zu(m&-oLdO67|yn3P9LIT
zPIbRWR5<0m7wo0IL_TXLci<``G%9!ziRL08=}#GGyo*hU%YhFz*y!fEH}&=8zU3Oo
zYCi*$ard$C7v+1?9!c5S#7tL{4;$JJf7%9D+xp|WxV%Jm3ipO=&PK3XL%;BHj*f~3
z+;-_Gf9^(PJiSkZR!oa6t0$1J$HWN2z;_AYDVEG@25xKyXI7r+(hP|&;56IG&eFE;
zt6VhO;0N-npx)8MMv!X^|HlZX>UPZwuUl0<dIq=UgL7};J2(NA>~=qsE!u^rpEFMl
zzpYDdp8(Pd>)W+~-y46w1k#-G*HqRkyGQH}(9FO|diY72{VMj<wxnot+o}O;!(^F$
z&fqU%%QERV?-(&mn@_9O$L%e&nFl}G*1FU-y3|4%T?U+nN&{TdsaJnFyORG1z&+|t
zKLn{33fkeCf#(im@Z1%7%-@p_DU^vnAhbW?Sw3Bn+0o=Wwloz$aXx}SxrI2l004{8
zf<m~80q2fR{O0(X9g{^nN_OM6A!C!gJHflx+M8DIREgT`E+Xakm6tc%^Wc+j-hMK=
zV5F7qFHirZu^d(EhG#S`ugZco-`g<*6VXWz0`bG@)UOlkWlZiKb>BvQtxjR=<WW-g
zzR<=+(TbGGo|pcrcE$>1Tah4FarF9cwnxx4zPjiWF5K&S7-dbs?Sv-3^6XSW!u)T_
zcc;YfPNYqj{H;)^aeZ8`G@J;oG@@;8H%vy{Py0Da_S|)IG-`N^?>rkKGbvED>k=E$
zn~U|=8gZ{5)z|7geDQbQTX@CzYNF>SjykPs3v{NX2Q1?s#N?3YD-@FheJx79MAZL1
z(XPFPk1@UvL#}=&-I)WuXE|`V&dCL_D}nQs>tuS=+Gcu^wtj=YFY%mKdo$|I*SXF3
ztC*z7=LIBgg_5q4!`NIDBzj_fFHeXyqHybg6rR#k#G9ka&m|Z>wPJ&XfXCxHb{im;
z=H~VZ5TgQ=BS`l#z<Pvd_6mE6drD(6zqR?y3!;%eLy|UJr8D6*C}PxZ|2k1UtQ<63
z>9q>AW;YUN7ho@VxhO319YJg`{`Ieq$}^#A#pHHSq*|iwtn^hyK`iyk@*F~|l2z~M
z86Hww1CXFH;L#>8`tR^agWdRH<}EpZ3`rVzQdN|V$Z-y2$?k`s$|+o6JwApH;K_=K
zsV*z)(bbJIQS$eFEkW!(ClUqJ*9%$f6(-;PQ<SSL(hj!-^q}ZI)W;3jXHgdQs!udT
z<d+NGg9sfbsX4}wa05rknXdZh@kcc?2Q`~?T4HNbvBzKngPw3WH>aNP%1h;r=Jb{R
zQ%M<9w{`{?(L(Sx33yfX56b$`Fo9AYzxYq+u+E{XVLM^r^}AZ9V^97nhkyRH(cxeB
zJ%c)ToWi;fg;ZMCZdT43gy$b?to2&F-_45Hi9I&lnp63sw`f{yu|AY2_}^y4(%+!J
zzY^ZMo2$!z68aNh)BfpwLli%&{+=z;Q-3t#&9`S3EsW{nfmjSa{&<|d$=S!^(RcUA
z_{jcP$6b}xje@9%qoZF5_PL9x4w1#{Hwe0;Gp*mBX=}RQ3}bjAw$V>4pewVq_s35%
z$X=y7`&Hj>EVM?`&fJb?o;#|7+W*-#i(AY&vR#^)3TPcL7|{>@ApBZ>U&X4gO1E!W
zQA8gv^5fg_mFb(BbA30yoj!a!e|o4&=%U|^*~hom?>^Ei`gAp+KSQjyjW8RqEvkJ9
zQB^t+ptt5BE3WUd#H!wu9Hz}B4}Y6{ba*`9c_s4Ge&6msSw3&D%!0`qFW2k@qw6Gu
zL_jaq8btQRzS9;C{!S2Qa6CHt4%;74xZNiN{qM4CYyWP{=jMa8msy)*LOVrs7<g3X
zF<pKw#<5C3zbxUKe%>p0=Zo`ry_J;3>{WtR8f&4tP3idIw`BYu+w|i|=pE^l9~95z
z&1niMaV-YMJidG}?&;)l?bX^n@uTA^=C0MCc-f`-52O1Qf^RpwuI&E>$DLXECZ_j$
z<lu=RBA@F-W$d}MaJtJ)ddK^PX5FW@?e)tzzQtTdgxd4Iw&(9-e#e%I9Xy#HA#725
zoxgnyza2Ues(AGCWA6Uy%)_ao*|~v~A54_Z+70J{`R}Lhbr095e~NH?{c8>$`P9Ou
zGkWzv@$98F*5b9Beg6@zGUwM<m%8kyN7mh<&VJ%hTzu3L&N?|C8sW6nyYTr}R8v%Q
z!mQ)`y@5;n8)`)_H+vTpSU<NO(Pi$Z38{TNB4AK|`afI~&BqDp(C`)M!1a+UXF0#x
z=!vClxmw>XxvYG-oUh|Uefus>;3DgT#<H#-c`xi*(z{wR#YMl}?CZv15YK9b!>{Pd
zP|G97P5lh2RMPu~#nDCH`xP{Bd{fMzp6~P4;7ehzFI>{&EFyUy=_wCI4c@&Gd3V1-
z%RuYa3r$bW3Nf^KOU;khK{=_aoOw9Ej0p1TKSj|MF%bpwB@1OUl>B@dx9PM!hOVu$
zJUR1r?{7iKhy97N_4Y+I;eRJ{R)yHTC@(l?b5USB{4C0}Mo&#x*N>GXwC`K#VRh+L
zx#(4<-_Y>Fs@d1)$Ntt)JiXJHQK-r-FN?Ru<8^OxXYalr-<<ti^Zd@eH3<=xNI%1i
z&j`p^$8q!AAH<#wyERR3mPOF(Z~1tgmxpRx{DP>m@xg{Lbo;NG-<mOz!Ly4MZ~23{
zvLpwuXln;ugDdD?knc@vFN@Y)X}iT7bz{F_wfD<V_f~BlH@*K&{JCBAqxqvbm2}s+
zrWgw@GbjD@|2E(6G^s>9?d}_Vf)0OqG_SnsSNHGBuTY0eze~Q|iN2y%H0+lxs^#%U
zIClH7sAzt(ZczEJXPSdIhDwZJdvBKA;9a7%frBkNN)sEG4F$Vn<QJJ*@kWN5_7<v7
zpa0gFzFsmL-)D2p@?WeWP*sgmGJ(>C=iZzB^uaKKAp8YtF))91y*LPyHV4*#c8>Ch
z8FI8gzp5PGdxJ(7I#9HGhUiwuYsPmj2l0G=`y`$>@*o3h`oYVZv+(VwqT^L9n`lzQ
zb!V=}g2_+ps<vM0{FS~^&b1dOe@Ktts1+*GICB_VK`_-@44*yRviiGwsdL`=<-zHQ
z<<fI;;fw$7R^{Y<P+f^XLpU2{w^EF6tFko|wRqwCk<k2h_3g94AA+}o?SvmqG}y0a
ze|R)5y7bw7Pa;n_Ua#(FAM1cmw>SKPJ6+7zzKX9-9Qlv`7-1fH-J<60^xb0V#Wh5X
zWX<)hmtSO75oD|Ii;Ca55?61F2nPM0&IWfXMlM7?fX=l2MGuaG<JQhZ=QX_Tboq`*
z>_$g#=ln%})3efimG$vxQG{|kEV9aC`l-=KliL_LvU-K@QwuL#D*SR@mT03P>)~!{
zq_pU><PO3gKM_&IsIOb4jo;njYg71sPv-L1@oDhOC!hSZTw@bjV9%7EwCZ?VkaTWm
z3m)ncbtkXw6qh-4%YS7Ji!EAZsB0kqgq5^U<dvuwaYh!Q!+CB?49q`3=ergc24yaO
ze0BLQ{4$-<eZlVzSm+nwVLCH3@WVITe82zx9{^N9tG~CdYDMzPNGWf8!7AB@B(BUA
zyI`VP@^ESurd^A7&J7W6G@d!L=^YJisRV(Z)bU^;)hYd5UHSi=|6fXkeWG?V1`*dr
z>&}|`*XDB^;qQu0>w4x<Cf7Yr@=?t^IC`l#gc9Me?|azn?Q{n(gLqeML4Np~C68k#
zucse=r|v5ydYcaJeLVH_xw?pYC-d1ok1~@<KS_Kh?A`NR{;~aFG&__Hc<*@ieqI-u
zGKj~c*txm7GhC4m*~}qZ$Guy7fA{!25zZl3-qYw{_k6d#`=a4g?rHdLw|U+?ej##l
z^`6#^pH7=f)N!^}?Dg%*d86gzRo8Uuv&PZMi}q>bta)<atoiOnZJl*X=n+OVmm9A|
z!knU6Z`|&LiqnMcco2pYTzQ4`J3moM5pCh4hIy&8R(bl=T`z8Xamuz;h;h`gvY=s$
zl#Tt9<HP0)ZdYB<?y&X#c;9ZgwV<Jl^7ZcV#qLpRtRD8#Yt5;ZSQnE8f)w0i60K%e
z!HjQ(Q$_i*(xi`HumE5)c+s4@Go?%o?znYKR_*XseMUW9N9qZ6olIDUdWc@sUWKYM
z889EFTdV9uBmR^hC5}H-uMg<j=l4@*H&<i?<@ZA#n1tO(iR07&!|jv7RQKKuBU0_u
z3)H=av8gL6oKjcZG2cpSN*ao0=KP2WSq7t&&sm{P_PX_=eg6JbF$8*dS}Qv(zJ!xU
zhz6DPBV+Z*njr}Fu)eGdra?8;#p_VXsHH(T`#yF)jH6M>T*6EGVTore-A^#R24!w<
zZ;4LCO75G{#oke~_0p(dG^2UvQET3z|0*J0Ig{yl5?n&)zh^*vhIcQ{U#f%r=AzL$
zhvne4(zKg~vHf-RUUv6iIldm(d$PLSjpvZ1hIh_K+UraD!r4{ImnE31opPlmV^ZN_
z(p~z|<$QYY1YaL2E^u~ki<zfvk?1P<a-@19Sto0qSk~Xk!G+SrAKNQ9?#%~@1#b7W
zskg$?oxHEK)pIiOSOV}^X@bsZKJ2J|)F~dOn1$w}hkR%8`BUPVyqt{^Gdf4(X%DAx
zGF1ZfNGUAgbQY*DU?UYZgAQe1DTQPo6&X7m(QT&mb)`b}=L3h0Y0+>p2#2a0+L8hL
z-NGsLs`{Euqt0AuJJeTvr+OVatSnAw?5VeznRMoAJIrJ13?nb*_@Hw8@M!nNqWd!4
zBz-Rwu=`AN*7qCxWMa~c|AE#QjNzC#rXml`HUtq^RHtpIBnP!w+At8tOBD5Ekyy@P
zO8m!tnq;C#QhTBkYa7t5XxqaK_)sgQM*A;R{z=Nx_R@ipPqjs}KOGMfP2pimBTbK3
z>86V(w!i|R=P>Sk2<ZXa_+SRkMgVfj{*p0H|C)3_UzgcDO?!<lEwWc{vU)DvL~3zZ
za@aAGPRVi)ADTDLRa@VqVKVb*Ovc?Se%BFE#`;hVoDF<EW)3NZiu)PG(Iwdvc?!&r
z%pBO>|7aU?0IO0uV{ZWKW3DSUp-`)KH0qCcpgPe*^k=gD@HA-f(4M(s75un1K^V?)
z|Eta8iZ91IxyOlHQ*(7(BhgMX28Bf%c|&)pdYq_>QGLN2#_Ds~<J@fAw;zXE8|rss
z%O)~YG<)Ez@H15Rnc{M6fg#3-dFAXKEA^!wz0uk{Uu>D-F&~~!SL%!XrE&g1la$t`
z)lYWz#VERk3Gar5tC_<_#l#Mg?m!7SZ4t|QJNXXuS3G!Xoa=%7Xe;#)jPBrc%l5!r
z(qc{N9_WH$k%&&PbEAYGy2G-4ki^ilI?*RqkAlDFqpFoNZBI#WR?{KLeeH3-uU@9R
zT{tr|D`o_y!|`;Yj#_q*O3@JxE?ihQ)8jJSTz5Dav+Ga&%Nk-rIi58ck4F4`;n>pr
zHJbc#+&FJHPn9lo)&_G$PrPl=SMzkCA&U3<XvU7dypcEGl@_Y_l36=HYLU%zGEmaT
zdWvsN7Ie6<Kk8x@-eM#Vos*Fg+?5p9TjhkwIUkY?lp0_J=}!$aHMs7|gR{J#Hsz8v
zu#EK^WC~83s?YaNA1UIqjhL<fIogvx<ZRfY#!hND^tDJN>g=dnDHuRxAbyroCH~0x
zD2gw2=;r^h2M?|c+v!fmsG7T2=TnjmakCnFviBxMPwSFCc~wsNFUyW~WAoGMvd_si
z>ZW4(IN`Xl_)io|4C$DRM^F`XSG`Ehl7*}|y$CM@r7bZJW=b+f?0IVP36P+mvvy~o
zRP8n`l#yHF<Z_sXo1_ebIrYPvlu;y4W!PGY@3T-a8>a<}Uw87)C;=UUqC7*Q-ThA$
zNG;OLEGD|U4)5Z2mpt`_t*61QbfyN&jq!QT^WTrcK@a8&I=Aq8UE|^e)8=hL3WSoi
z+0b8bCu$9?9n5D}Z6j@JF_$!+XgrUJ>x_t7=&n*bD%}asZ711RA_38*5+~O{OeVhR
zl5UcVn#MDohaw|r14j^F%O%A<FX?F-Xg*;S5~dG*&K<}pbEtL7f1Fyrbf=*ac16Mk
zPt;u%(n;x*v$pAG%0^HTG~cByq0)`w$(BuY71o@XO<N)MLfW#pVY|PCB(F2dI`$3m
z_VI97q!|tS?Qqn~GN5cXd`S<YVWcjuVXTDw=$1ZOf4Is#ntYjj3a4YaZKh%&c3vOS
z&?eLIC0(%h&%<!F1stN^W~wJb0bDJUa7rdTtuGcqHtu^Z_xms}il|p&L`EJ-JVqjc
zB!`%M+K~21_))W8g?egFZ&rwKaJA7M(g!cKA=OCKo@{g18E18qF2T_zuK@1B#GaZV
z#wsIXa|+Ku&KDajc+N2&V4I@L8J*I-^n;q`E#Y+L_>#8%R=r5HRC!hE@UlYB<}`I{
zkdl}pR?fh_Bm87^si8fQkzw|@U5lEnt*3U2wmVy*eh;b#DV0iyDA+MHKXozA<F+<i
zGkg4{&;lkG$<n9w%Rj4!35!k1jh|xg5E&E!;KimV=5cu?eNFv@w~B5IGD}1cLZOKm
zowld2OtoXcNeN2P*z^hI4mE`uHAhM(VDtV>%3-YZNvA~eNvZ5~)XQ$d@6}=HlfgeC
zd8f;Yi-0=FBqv%kJk>N%ZF!?lFT+_p?p{-WYwM2otv{sAJd&=-N=lL>+wVm|U_pl5
z;iNdz4XY<nWCHt#W$00_FE;j=ZNF7bDZQD`Q@ZT^3XY}I42-U*$OIiT9NFis;<pPm
z9MugW8zJAX)=PovkT||Rrz6{>m2@PQN4EcV$CJDKEDGOmw5Lt_x(vNLnVQ;?q^V{5
zQf!zQSY;>K%CF<g1EuA^7{_rm$tw}7t#`IJvNbO1%d9^kFGk^j;XdhaWCL2?q|9@j
z`QW-uriov~D7UQ`7m0Qs)EG!dQpD+oSK~oXuF351#G$fmgoQ@Meg4}CZH~<jG<89!
z6FX8YM;+OWIdmb_n0p0@F&FkdrG;9T`^t7nm>4_JY#2-m=X^2gfoCnBGA#J*sAuk{
z=7AX?yZ)p}>U!f<OT)HSeRP}b+-gXfN6*zqFloEQ^s2Sm0-7Y7VGESl`i#v0H;*EU
z5)H?r48?>r<XvL#EjtY9s$}P5+T8h%2iDkkr_<n$W`10F$O@EC-YrE<FZn;eRD`Gg
z!OT>RSKh=I-J+4?kE9ag)s?2Z>f?~=Ig0;rwcfN#au{Elk(om!J&M<FwGOd8`LuNV
zrq8+Fw9=(`>hAAS{CC#yhO*QY5SoL-pPihawBIu1&O+@ed4;6>*|<9%I7-Tl4Jdgr
zlT=&t7w=aag4iO_m0eGzv;ASG<g6`pqpjx;)oeV|=gK$}1=nvZqKS_>#q8CHcamY8
zW+qa$G(48~$4=$pvMUtEE$fbfPc#3Fb(%Bai2U7Z6m@E9EPz0R6GUEPA5tQT?jmoW
zGO{~ZbkOaNrzFz>5}+B87V_@#A|-JcHrr>Y!}p2Xgdw0>biYs7lwtMM8q6ZmB%+xy
zY8x0ua9>Ah#m<c1vMwhIouK~MC@soe)X(Ed$4j*+bq>0S-?*>4^w4l9nES7A1LBrg
z?3f$gEw}=$cfr@RKq!@73PntVz*IwMo|ZAI8H>iGgIc<nT<nmge%Y#ufVx$ctA{*%
z#@E=N^WmQx@Id;2rB9f=o(@{tKF-6rSH9~m?5%6_H0oiQbecSB0hfy<64-$)rU^w@
zoYA4WE8k{Tw|HUs9r_B_JcB=cVxug`*Z+%Kss5UB0vBE0Bod?r(>&v+9$z<)X#+TG
zWRxEF*OK<@oAOan|LbY!7f93zXG{VX2?6B-Xp30Lj1+8AwGwkFX<_PMeT>K=P3(?b
z#01)+_wikwcrzEqOK7sVh}Jm}6kRr4r&olES>E5_$=QB`kUzj*P>(N^uIA83ik+t5
zMdE#3RomvDB!Fr@F-Vx=I6Ow+m_R>8n3!m$gHgMMPf?F4Lt7?L2!11Hqg&SZI7hqg
zkB38&@;17|UfG$BJ0F~ljbM8DvCK9Y^;;LeZBWEJ@gw;&h_Bao9<Y@aZ`E;2djqAF
zhrNA%U$cMAF(S$9)k7c0Q7`)xn%kpHV@vSX^cXlgs@+u$RHx>Iu>nO*UXExI1fu4u
z?%y?f`}&SflR?XDg?17Z|J_lj|M~fM{p8}m2cP=w-ox(Ke8=+m?~3Qu-E91KMg8YL
z@!$V~pGS;k-XBlyrqSiq%vtNMJ5{wRn^m{s63(^j><+@)fN%Dr@Jeyck@Ga}UJb|7
z$=~F^4}0NrK}ECb1B@Zxaf;89NirI#`)^K(8t9WwGzz915;}~_@Byo<OB-aBA{X_Q
z0Ln4qGuCA2N}Yt$VKk%LL2lGu;w?xl`39Z=YyL2tJ&}<)r2b^a$KVMW7%^36IA^>a
zLoYelr=xCBHrs(bN+yiDVHy3=j|7atrEkA{)XR)ay|=3*zM;C#%!sN5BT{d+=%YuZ
z=G>ci!=gbYgOSmF(Vzs)opjb4cjpA34D>=iQfmZEuM%LwX%r0NWGMs+5jyr{^hD2J
zHd{{X<na96?pec8zbk$GZSz2hGJEgUmkpLQPR^YF`mf!V`uh9to!#RD_5b%y<EPWJ
zMyuthFPpDVkD84G>Q8lZwtIZuY_!Tw^H|+v2W-FDyEu1_PtKjA=IiFU>iqnq%)QH#
z)??1eq4T<N#yf2PrTT1luX)rwf6wndY@Q#}JC$_g>^i5rXXnlRi=*8$=k((2^rWRm
zt0r;KZ0#TIHeWXm)Dkw2)qAP0#@oj6Ic07+I<n`r*HB~PaA59J%?m(Q8h!HHzM_a4
z$x+#9oi;GECjHg;si7vYd-lFeWY|ABZjnf)=COO^9PGZ{eWB*Fwww&qnWFjr#aZJu
zjZjU$b+OkvZ=PSAH=GwICkIU8R^#k#bHCBragI(}Oe7_5mK};~;diSp6meQR)E!Oh
zqSa(dHIJ1fadvS^$lP`3<;lASnOgQCtrAI3j(OIKBqwL@sb3-oQ=EtP?qx%Lbw+el
z(>p)gC4wl$t+{`0wWL>`pPZdrlXZ?8FOHfo8prz$`u61fCDW~O_O97#tgD4;wy0GT
zuYb3z-hIKdr^QjD!>`unEb|gN%|mDR;H~O|x0|$AYu{?hK4AjxzZClGeZD(T=VGJ|
z%*SwWSBA45dO?EH>Qi`zz#3U<pEGNvw(8*_HDtc0{(f<M;k*b(;grHR$oSTEj@0=c
zDSo<EdU1MGTGzH7r^<@Q=#H_4Q)2?6p47R%xr(}1PB)0bKlsqbn*H&cPLB|zGGW!9
zumEK2rbJH3aG32pB(E)n2HcQ!kitedx|+TxK0oF!%>Yufrhdk30m{ud8HD0c9DJxd
zW`@JQPwM`T@tGTi-CN!6wGI^fV@i?O+#_oS9(H<4bE8M8m(HE~a}XN9wnZ1PSQ-sk
zLjo|~VZ!CWY1zp}_ABO!*5f9szjLRjW(e0C^9=dTp=P<+SC=`cyc<neH=ymJr@v(G
z)KM7mSTq&HbVcufzzW!3q7k`4L#Lz!z0-$R6cMRZg59?#&4ac&#EOsoMKXRUc5sf5
z)<)|}cNoN>`c6OpRH-7P@x!a<#qAyb+Ii;SS)}KqH&MQcv&JdqBWUe0;Ce^~m>UA$
zs%wT+vQ9)kVL~>JNa+a&ti-Bk*V^r9Yul$BTJ5%K>U*5qs@+y6Wxw5ao<E}?IXxVb
zWQXIAac8X;EA>eUw`H=du4lE>zmrZI#6xwcC~+1)Qd+Lq{@tj-Pn^=TgOWq9STC#J
zTk3c9CjPyvem5_)A8|^qdBiDI%p*>zDvu~_O^9aG4ioFG=?Uj%Uw`nI$uzhe2F{E9
zeRUNFm!om4cB(U($5)HKQ#$0B_G)SK9R-d=-DtMiS8Fo6nvUm}YKO=WjJm1T<N>P*
zoO6r)wQGvcF|Z-(abAL$qFUH%Q?@KYq`|6>)dcfidw$gZ*-)~e^pNU+J|+@9Afx<z
z+ris5q6uv_{GmSGSeN(jpq1{ETk-e0`<+xbX6zKGt=g(?e~>Y!dqP9%gjzmx#?(;8
z#{LWh;;pF;o=Sh~JZbICNKL9cn+|s53;JDksAlxT58@eNJnR~O@zhzXI8UECwRN`F
z45As|57YU`_BH*(qAxvW^`v{_0dtqn^)%K~tMZS`8kytmtTn28%@^xCnFh$&;<)M0
z|G?hef7#f7)ovc2UYutJ5?KSW3AM^Nn#XT<k5(Rtb(YAvV;F?h%zQ=!QkRGNKMjq~
zBQe0FWvng(b*u8KEFUmmyj#^LwEceg!7QzOURm(DTl{(TarX0~w^g?nJY8S#xxe7^
z+DdQp7CgPR;PVBvsOD%<__hU<spKdlpD&<AB}a>*w^bHUrjnzKe7=Adl^iV!-?o4<
zl?A(`vVa!OO1s2aKpAJjE^!vn!dYpTI14D_EZ8N^0$MoBcZoUX$p`o^onPRCy4Q+D
za7bh~T*Ng~>{;=2^)m3N=T0rfOX)J9JgIyIY&vUT)89GnZKc0XoO*j*eO%dDfeoq~
z{9nQV(=X=9DcNE9OR3clhTw~*a{qLSdS7i?i>J0=dVKrX&-R_o?9HkN%=aPBQfX8F
z^eZv_ZW`Frj9l{1+5<~(KP+<9ekOAxs-Z%RUVJ06bhd2p>h-~VK$f}8PxAiUSF%KE
zPZ6<rrSjXVcw@1@vlqo52rx-{Zji#|*gwN?*qz+vW?Iyg_RBNJAlTABf8;*P(CXgt
zlJ{<)^l^@$W!1VnQ~IJ(DDexK|EvJQ>`!kIl;3bpHN8Be#*c`uo12Sf|3`j(I*P2<
zxpiZPZQn(BD@~A8j7_Cu%=1&=r?$W7srnZ^<$uvrwJ&<g`=Y0|zUZmy7d=(^qNm)#
zr)D=}+OQ#EV3d}*XuIb2<<d7UxZ-(N3fse7oKf`tSWSzrE!3jN6aD6Yx8LS#{p9?A
zm*dG5dECF^JMQuSx%Emd>;K!Ty8rS2{VRTo{eP9mWv3MkK2q-9Q2jRQM}ufG89Psd
z(JY#VpD1Qi9gt|CE*b*A44=dPJ#e_21R<qO<A2^S$Vr98HTX5Xg4wbCS)bsSdISrH
z^2N@;ujmT=N{&FD-?3$%9tkiIXxY&?`IMI+LdGEUK`DVPr-`BUm=Z^;FGG%5pN=`-
zDafN9@2SBtO3!3YiO2of4Q&ByQ_+ur{1uCzMzrOow5LYcU2*(5uFU<D)Awi17cbA9
zmnTODjk6Xzz}T(T+`BkGQ6H4p%UR+Rv(V4^nNCjXY@wg?vt67#w2YUNot!xjXENQB
zcgKx0@lYmn-Q&JK*ZW!E_+&QqCBDy$<CFUNGrmvT@ySI06TVN&@hQ{$Q@&4edt&ka
zwC7VAv+H=N=QHJ1Vy-`BzY>K$Qe<v0QfE0F5?6V_!i59;+gNcm;!GTX$*4$T%Fa^)
zl0Sdi3*+we`BSxRpFfQ`=5nn6yi(E_u?hK;FoS&kG)cBoPZ2NBk1)Td^fBy?1p_aw
z(Ff}#NzTLg#8~2c!T=~>c1Hxg-WjEv!?2rb5-GGEdjOCZnZ}&{gh#SCIMHsZ$C~ay
z&$4WidBEj?1Vl{HXY{MO4g15{n))pqPG)y&>*dn7@wf5cXXgLW-=}{cm6ilbV)XZn
zI3ej@lV6`0VlH`5&qO_FeqHH7o;37Ny%Zefu+}Zp{L5<2N<&?v-`Ay``lvq*LwrUO
zzsV3rL7YmVfKyh`?#<C;KHK9=)oberv7_BO8j$}`qKN511CHkmi*&=uP9BngAUW8|
z=2F#9UMc-O9I^MB6Ap2tv!WVDE{#X<A5Sm&c2x{k$wG7Or@!H7Pw8zCepGUoa~<9p
zm-L+#7K*Wm8<}H3k}WJFN0T#*%R;7#{Q)3Y)jzMzGpD=xoM5nI7If9BaWb&5#i!+j
z^MkFG9+k?Kb+wFW`tcW6Czs%^$n#6(Fy@n2;oX@!RBNhTuTz#+tS1pa&2;EJQ$V#U
zYeh~ntP8yv|C)qMlTC;Q$@!sv|J@mHKIbr$Z=N|Pdp{EPUopXTJAjCfmg+?v{lu`5
z>L+bgLQ^%HQiERogvO|`-Xdlu0fK7WrKH!K#V6Mnju9S2{0!~W5tpuTO2y}*L?~~e
zh7w@Z{<U6N#IVYxs8q(Q%ghM*U+($}Pn95=$=kr%O9h?$0o(dNay_bk#=4DJ@%=#<
zjOG(c%pZ@HR7b(}6hJ}39Nia)f2M2zrHA`xM~5X!wqqv`!)rD)zD6g!=gid|0*#NE
zn-7O-^lIO#vl8?<BiR+_DDMVy0m9%M=<f9M1ogkvlI*^csE*Iu`${Niw093tcHs2r
zJ*Q$t_))-7+#>es&V**E1F5%~eY(~Ok)jS}A4u)|`LI%^@$E&oCM6P6((9nd02)Oq
z07>*qHT$74>G6~vKHWci{`BbZc}Wcbe2`L8F{cy7=In5PUD5g)?-T3nhVCKDflCi@
zt!(L?WLmx)-%!N_p?Y{5s3B@zrIVNFoK6EuhTRS5{^6)AMX-+Irgyrp%P~L6sSntI
zqz*92@`_Dgj>i&6MsFh@I8r`m2VQyT?91DPYJ|UGhD?YlCEw3w{aDsluQRmbd`voS
ziZunTC}<Uw0{KV6rqvK`#?t|P(xY_xI)^6?PHgpJ5_AU8#zssponwcqFKBoat?qdG
zFf*s>Ls6T0;}A)CIo*JcU86T5_b0~}F+_;78EIuweelE@kLF~={W;8CFV9Vq+haJE
zlzH}6LO4`%B-PJsL^om&w`p&DGa8J89tLB*JqaKJb*PjO*UK4Q+I`XM^foP7^e|vy
znzq?n!j~h&23!5~s06@tJdd+<+~VX3j#5$w(d^EF@vF*4v4_(R&fQIDVt8n`G2OB9
zYWr9(fl3@l!)Opt`or;n@m?Cd6&OZJ$$iEwc}fD-^cIsBP&yNYI7?z?ix5m(lp@hH
zdZc8XFR=gQ?0=N3^XtO@@3a5;l^p)x^XrxW*#G_&KO`RWQB*?5<&=VPDOp~ugSDPz
zejIF%{O79uqm2ixm%Ee{Xyoia*t>IDGsV`_c2>g7)0lq$Ti6@kgq??MFRZxkw;I-Z
zFs4L*4<4M;we^-&i`ZG?aUC{KTNJzQRJPsC%KC#+(CLzBwEOt+<E_S)?|60B->&$(
z&fe};qgtz1ocean-LLxl&g1<9_h9?+0YB7J|Aguva(-T_f3DO&k^1L@`sZ5xGf@8w
z)juQk&shC4QUCl#Z`$@AZ*Mg`&#CNh?HyG8hI-R(!`t1hIERmGmFnY0&1uxsmURy+
z4|dfhG8mwg(j=Tk#-dmXsIM*c*yH-vzH{L1dk4F_o^$9|8jZc`o^!Cbdr+-!RUE&z
z<*8F~_(0Y`hwmx%`~0ZUZX6#pcaI&NW(+r)5?iF%_dT7y3`t<8a|9Jy9Z@Y$E-rC$
zcnITfq?kCT0!8j2j>b0S*din<dr<VarTVKS?nMBES|4%t+stQ*$<I=smEy5tnNi%2
zZo`;t2i7;V-%_6-SR2Sy8PRk+SmR=HgdLs5R3`#|GyY<YKcmXD=F{iTowcnhd5G|x
z1bcP{*RIk7*%UpvR=-JxE@r<GQv6VmqH3UN+EjN2E>Cqo1hmljo-L~LslJ+~T**pj
z?7@j^wT{BzPGej5-k&$xCuawZGm;BaYi;Jq<BQbvIuvlY`F!w8^ef>RY5vwn<*K*-
zoqKzD=(_a(b-|wgo@=*F&CuxZaGf!}xsmKOUo0Ai)s=<^vwo)Z8$|%h{SwE5b!Ly-
zHwH>-^^}><ca<7VDK*ly=!eSII(_qh?a#LPBbi+4n`)*p_o~!Ytn%8K`@>mfz3iM-
z)&IBD|2?)6!Dy{hrH|Fxi*zQ&AynkG;%U#^wU6bS@@@I9{Hd&_@#%+WYil>(t=<0L
zyY+ST{~v@<Ke)HG-R){!ajYMBtCnl)J2%hh*PHSdDN&}!%KbflUWe6uhd2NCHr18i
zIC$LH+pXN!)mFjS)^2{kUH|TG{dYCW+jXnc?Ze96-u}V<eVuyuk8gk1ukKe4`~_X{
znsP$Wz#*okWJ|@AH`T$$27PGEKadfpCL4je@st=gyBdPOvAu-W_<S0SVmkM0CQAng
zXaAx$k(lVRDQalf{Nj7RY7?D#Fi<Q>JydpjWhaE9q;rcP>O4`J(|vZSyF^D%lJNXe
z@lCRr{g=CEzISwT{G#ITXkbr@KT|uq6=*{FW>~vq!IZPvP{hS#5~??I*$<t?TjynD
zTnvt6S>{`Id@qFp%B9u23VJ$Z9vY60dC^LEL<uX^FR`sU%d4q8HHa;x<WTUS8!$eb
zhHIx9r$mC>TFb-Et}({N^8qUb+N&eLb_(30-@_Z#Rf!)ish-Qu)p%m5A#62ZJqTkC
zEJQ#ed}ryr0YWF3^wgK@n9`1oV|WBNEVP*0+2(WXxnF5^R2r5D`Z1Uq=u$xDUv8pJ
zZyocAPAAkgpH$_Op7~@;J_*eydcUcWc(}1xa;dsDGYo^SqTJDVJW(4~9m9c@HbXJQ
zpxh~U%e}I?iq+wyPr|bP%&FiL`WBx#ReXXc=rc!~6V#`=Cv}EAw6l7z<$CvXz1Nez
ztT$|<oz?r}Z10ua*ejK!ujCDt-1yZ+mFc~b8+)au`>NP);PF@N-s||p>U|rZSiL{i
zeO0YDRC)YWtM_UJpCr9ktN0}8y}Fh3mAs+qp`F!xE!VrB>%E@zWxZh=?X2D(XM5ku
zjeV<<^p(6}D>weFt!(dGxv_86lD@1r<i@{M&-I=g`<9{omh}dY$G>Iu?p5$f(z{p1
zCrR(#R?=7U2G2t~tM^*2cR$yAJ?YDO!#3Jky+6+OUdxTWR!RCw-cZYpzqXa_y_Oq$
zt(Np<y&*ULT0Pf$ZtOKfd(V1<&*S&3-u((bNqYCI_$2Aw-%9#Q-r##^XZ2po_3r0-
zuP1$3Z`ejVtM|v*-s`!s*DFb1$s6jq@z=Mqz1MSNuh){ktT*JwU$5tS&yBsVX-}!}
z#5k3@p%`J$ceGq)5A|JU61(BvA_Q%)V|`TNk2>~8RsN`Jf3(FP_3V#4{wOr#dKXPX
z8cf86I_x`>Zb`Zq=_aJR&s{7yDXAw8XIkp{{_pPhWk*s5@n=?;-XD-dsSC;lt5i!#
z2}@;fMoPpGN~9%CYO_YawD-?{+R$yZ5Gnm>%`^H01P;p+!Dwb?m5~@+QlOMrU-xR&
zEw{2$)TV+qjl=ze-M#I{g>9;6^LTr2_hA39QP^e+Z7S|owdU3R!Zse->~9@Z8<j&h
z(*|kkdCZy5FvcBC+OzpcLU_qgAu=3GXBqJwnFjM@EtK6i90@VBl3eD5_^9lB5Rc4<
z{5ZAvMXsH-{Ja1XCqu;6y7ScekoXsK^VN9lJRwvk1gn4kysFP04P@;DSu#|&-#Px4
zHHZ&_k9VG{&u#aoi1FW<7l`KaK`Az%!&;>J^}Wpx+M!NAX{9K=yk#fTne`l*%h#M8
zCsO0_x76f0(_uujq0rql_I>$FzT*s_(XUqT3C8{dHcIj#yCb9I(`ED4Ju}u{o!e;L
zY&l|X6F4Qr@y;%3&QC6R!Fti9&g7r$z(ew0uBG)kH2kINsuwLh@k!9pPWo@|f}Nt+
z5;`MZMrV{DBlmxkYBwTFF2(gmL-Jp+zll6H&cVwwD_i*fctqI>Gn<a}K_@0pBDpt}
z8o;g|trSHgYcxucYH@`OU2zTRt2yJfexMUwZiZ|Xl3I6UT8u{e38S^`aguCKbdJn?
zbeG%&(_Wm`wbB#c=yxfw_qz;*9+*vty`Z+lQ>Uu_^TQA36k7VXNy(W%<B_F`6CCG*
z73sh)z!p?H@u}nOs2-j_f97l}wn1<D-^nK5*xbZW)4OBc(Mek^bvirnZ4BHRu{B*7
z0@I!5xRL5j4a;->>bTAmrH%cX96+*&u5E3q7T+m`vaVKQd)*<%QYEPkdF-)#<lLN4
zroWNNF_^;R)7|P;T{(FcLpE&qyDqDO{Jn&l6!6XOoSLhc#5ZcdN_17T{@>iQ>$+*i
zw5<0(7LFky9TY;oY+*~+YJQp_t?S9=_LG}i7dh)iYm!iWEyLq}i4=GL^`3>WX0=er
z5vj#YH6^!fXpXbKV>kZJrbp_5<coD?j73hN5IJ0z_=dEIMI{_t?ej+K+?W9OE)HAG
zpBs+nKK2un{>3o?DA#V+9b~Ulzj5Y0dIx!l){<0x-~e_8ziyX`jE0)4YIf^%XSYRc
zlTz$~F{^9g7a5Pf)XASLhh4@*Zx!k#pM1=GqKA+$p|$9lyAwT??sse+#P8+ZqF-f%
z!|&9XrR$`R3LSz}2i6v+CwL}hP1^P3DB@<K3DZI0uKBykR86$MR-!h~O1T$SGq2Ol
zzjdp(r7{R;?q>bv-$%NmBoy(F|9^|0`JeuikN*kBw4Cj$a4;bt?^k%oa{s^UyHzja
z|F651|K$Jsm;5Y<|JkDae_q+Si$=diH>AGk-~Ps7KM!@tPwq+e(Cc6}qe6<K?jY*-
zou@<f_unqV5vBL0=N=Y5Si2|W$a?X^|Ea-7Updz3%R`O6UZm023pDy_aYkP|%;;-H
z8T}{7=${j0L>+xWipBo~8U42iGQx(xFTEmEh!N=!FB&H=cUv#pFB?avl)(D*v~ARe
zqVFv1kO(&^@X(8&8)qkL@wyW~Brp(pLm$Soa3ZE*-KyEr?bg1LmfwBne1o>@c008-
zOjBw3`|pl!XiAHinhr0*F~JuOquW|_Pqp4z*yL?6MT6q{B+`nSut>gRf4Vyj1I~Ss
z`cyH>%c~Bty^;Qna_Y;sXF)HT)9XkJvU=Yi4=2HtZfbFE+i%_ow4pWiX@?S)OF1A}
zh6WXT<iL_}67SvNZEL;pobpdj39{Q(muEOt*Ry;$2xgLjUAovKFSWW<_Qtns>UFKF
zfQpdBR}3hZhc-Iw%2p4irlq^sSL*GY(q<Bc)G)Y@cQ0DoUbe@i2eVeXlih*RC-G4M
zNvMT-SjHodya;Cp5eiD_IS<C8O3$9G`YUB4P5&fMRZ~w@dubwBZ)*0NqcojwE9TL=
z$_mBw^kdcJvE<h&cfEQq8$B7<3IoQH6pq>&)cvov-~S~;|AO&{UG@9rz^wC4)SF$k
zhvwZ^boOS}2cNqr&OPg5kJG9GP{1w!Qw`w%t)D#pUrFHVA{%_g7=WevzhCicl}a}M
zhwuLf|Nk%fF$GRrvhJDKB+*E61p*$EfuQ=IEFu5N67rucA^%a}|C1%;|6v9GPh|;7
zKD&w#cF7;Ivyf87pPV+1TdgCj-I!7;#Dhob|Aig2^%oLqV!jXJyHQs%-s@nbE>}ZO
z#U};RN$^PBgtJW8(p~(Bif<QveiKBQPy5}`Y(O792ydw-gmzMfqmR*aJlc6sG)HNw
zer0dv2BtF`#BFw5F8P|Hb<xV?xYiLC>~U?;X*g~iwNGh#RQ;{`<HGnp<Fhs5z~x}v
z2?kR2Z&7pY<ppMjGs2HKPej=SHFI{6s1tI6jmZ-(Q8)>rX;BSwErU{DcI{P@6D6r7
zOtBw2r-<6$Qa`**K@3S=2D_@`Ml{Kk3}+bQ;3l|>x#&VX9?)%|E0OECeaXQ>))9Mn
zs1d)L&<poeQ%Xe(87TT-I37ha4*N|N<!hZa+pl-26q_T3{Ze1Gj&|QR97ihjrN5Fj
z<?pJQ@7f27)ABc4>zHC|&O_naBpjFRtc}LbZ}ahVK3vZY=_KjElMYUD&vPi=bcmEH
zsML|~36o2@t8w0Xi((=RP$`Q+aEV&ASJCJ?wvs(8|FJ8q#yqy%D5#L~iQ>8K<}p<R
ze!=%B4aeu<97?@JB;X*~;F4Frzr1K__6Oy9c_g_JsJFg8IhXQ{^;8uKF7HkG2uwnd
zz7bS(Nn*PzbsL@>AMys^-nQ3GH?&<8^L;uBZ!nJMyj>S{(L5$%a3_z~QzKEl@=9?k
z4LY@mvZ$|vlj8>Vsk@$;mg!83euRi!KqoFrY1RuJR@PAsdracCu5Bqf8?f$DU@~<E
z_RpH9=j~U`qoagWl`5|{zH{h19WKjsqLL$<>f(N{*%_tZc)~dmpcE)NaDZ>jfVT`S
zG?Q%}AD*;N8)wav1Bb90ZoUas9Jia~TkN)8EpH$Ny>+8%VWWe_;qJxJIUhgdFLAbt
zNA$9Bbac`tA&_`VsomCWuHAle6)O3^lz-;Dsk&BD$cq=M-{Jvq6B*)K(eyXAY?hZD
zH*aWlcA6(=Bv(|5UV%2U3(u7tN<z#6y6b+GG^>PDdieeEe#@!kTXNml=J6|Ze5?de
zvmCXhT^m-ThqC6o8(SMRpn{3M-u+4SdrY!gd;jG1Yr>xwPqT5P#-QZK`=&@e9yDlP
z3pS3~6OH5da!Oi4zUGS}Qs@U1(>ys+q<(qQI;XPBEoVvZY9F0kD6uou`hm@Bhe7v>
z9!-L7S;|;&s0>+K=ey^P_AzlAS5o98JYgZ9TF}kA-R3#{s-&U{Fm+0nLs@6(vP}k}
zS({kE3jMWsmE_v4qR=w&bd;?oK}hSLD|L2!&=!`iCQLKlO1SFgb6x*;)p_CyQd`LJ
z%v8;|lyo$@<XHNZ#-{He8ePk&*_V&GdsgY^;`D(2Bb(3Xs>YC%G^Ki0#qpxu&f*21
zRO<1frMfKImjw-3CaLhI<T`6gvqzn0HV#n&79Ft4S52}{bs&GtCX4f{5Gh_Lp9Dp@
zk~~8AX;l3ktLvg?vMI1RMdty~1_kPc-(0+Bk59N@bK!AQs$JuZC<vXK?>N7J&m1*&
z5A=0fFZljsk91qzVjH3IEhVx~W=?n;c43hNdB`j@h=yvK#p9Km7e{pA*Jl^U$E1B0
zFdS(?oJ=Y57wRO{{H3i-U-vd6=IQvvIccl;t|K?O;zqYTQNHY#&Wn3$oS)Hkw0L&Z
zKrzE3rBrX}*KH-Q>x8qLFr+jgvuPwek4dhj`d0Jx#gSUrO*$|aXAQESa^31B8$~@M
ztrrtNX|jJt&L1Q-)0az52f63Dgr$gv@<5`%2TFq1K?IN^SToX!(L?7Q<uJMlk%-G=
zpCajh+&9WW412EDoT$9{orrv7`<17YgBeNpG21^wy!ukxDftbi>oTQaB;%cQh@4J0
zAtzSiJX}{gErggBtZZ{UuwXbw=fj8238_Cf5m~GIiXED_z?7WKKwZgt0`xAVR;139
zP(ca(knqfUkyVM&sc8daYb=&ZR+uS!o|!MSSY6$Qk=s-voR)(uwsytE*$r2yFPI(Q
zfU@Cm-cRS9M@ofEl3XgydeDm{3l$Wl4ZbvKG`(<!o(M-i5+gK4)jygr$tcGd5r&eM
z4aVJIK=hu;wt2#J<~PjWq?838RnO$4DoZjJ(XZ{VB-4Y^<PkzL`hF&fz&5Z?Y76P=
zy1bh>BO#|>tMO>FjWqd>SUsf)@E+-*t|igTtoswKnGn5j$tIhVM#CEj^W%#_tr;S3
zo;elDjYtNGBIAheg~lMp5i(Bb$9Ga{<?(#jp+u4W;#24-RatGshqjf2Ec~ES*xN}u
z8jm(PeW}{r))AS8($?vA*|^?K^+j<aii~Z&lXfzLGCPcQFEXP^GGN}rlfj+ojd$oS
zDU$m-kh0t5DiJS}-HT***3Mn__+;_pYOgzw$Y5fg9}-k0Y|}K`G-DPA`FS;OD+i^y
zJ5mo#vJXvGduX6`P&*)-OEkOV2Pp*{PR|V;`EJOb3ucN4NXz$wPUwsz?@zi(9VQ}q
zgoT}Gf#rVlhb$FyGj*;aitgeRrung`xwNTg83|H`FfW)%ky<|UG&<Qj7zkOah;iIM
zn1m*rd@`D?t8EpF4dfj4QbS777~kI)TcXBF$v|RY9sw~N{SNR#Y86~k`m%dF6dtE@
zVDbV)V8xu6iaK|ZS&)S2`#YRS`f6k1Nl}|u-X?dB+LTC?M`EbX=1EDIbN~BM&Q~nF
z5O-r)x7m1%+nV|43Wy*i%aRM^q0{UQBo`$g&f#QE*BB=~UV+f$^0fCFR(%nP#wil5
zb~si*<=iMOg45n04Go`>ASUt#l%!MBt$P)AukY_oHj2IwBccy&754Ua!h{uvi{^<I
z*_oQ>*l#<VQ5JEX_$)*k&s9vIW^8oaj0yIS)OD2yE*9TP$*sn+ZgLB?LYVd*K71%i
z#gZU+Htr|R0n#IJ0kdzwq#Na&L3H<gjKUjJMA@KT(%ntxqX?Iv1fVw$%p-bYWxDrN
zyWiCLRbNvIRuaLqAn;HJtZFPL^4GP)$+&y9qa$$DCv#-jarg@}j+858gPamO*3`%!
zVqLhFV6Z`J0bVbHxV@Rn+D$IvOG<KCbV}wOn{B6VB4#3NBvfP#w5+(GBW{=6MJI-b
zDAJ|;8oVxQe&$sx969?|lo2I<eLcnd`?-G>knY;F)7yNulNm9ORoi5M<3;Cwwx}H2
zf**?pn|RYEyIe%D$&V?<NLbiTMw0jWh%{a(af}Q5$hm!%b-^9*)!SAqBpUa2WP?L2
zh|t31;|`e9sAl<|qEUaW2-{am&DDad%d9ln+a(z~Ry#^gMK4lpW<%Y#iVO5?LDZ46
zClaW%0IJ10-uWVhMaz}=vIYZ3rxy<f<gg8hc19vyrMDp^Vk4abBVlZwl^2@z5=zs(
z(#T+wD?4mpBk%(etLzX5C5wZQ;cP6o2{gN@b+*SHV6=#+I!a$>)KfF<&j&;^1og9@
zcc54c?fRh0GNi^?*%#?}Iy0#R0N|QW9qez56+U#{C7K2lBGwU{c&zhO>o@DpRKrUm
zcfjV%ZfMj>rNd!-csoEuNXugJUZg)YBjY>-v0BnQA$v->Axmi+-G!2i#_ZnIcQ{L#
z^GX^aX$Ac@46jAPIn+k2N74;|w!PHa$z7mriJ6_RFOXPYV<$*cZR``4ZNgY#EZ3aX
z6OBe+#>NZ{Q-S69Gz)DWPnFVz!+EDrHx<LHS@O%Ny6?&AsD(mXwG5_|#eUExr7ngl
zH@<<$iIE!ployy;he>drx#uY(cY6}VhDfLC_Zzjds1G{MG{@bG^OunH)%wU>zk^uV
z4T?Hc4^DN57csGdq4czW6tB?T1DnqI^)-7*t|Gee!NC*$&reF9yu(>UV;-C$1Bcf0
zmSkv~RyXmy{z&Q_NJ4%xa$AfyeKhdKb}$-^=V~k98aTtJj(o~lRaWUSb7-)p?4Hcr
zxjDTCZW!^0KTonxEs;GpKuuf9N{mf9y}t2BBrA@w$x@J9rdQq))d-cMnF2v3c(S<_
zkUkh~V$PcM!o2Hqdf`n$Znb%APl>kyK3>+HIk^K;efeK{4JL#3xZhXu*@BIRFAb4w
zzh8=O;LH|RX=?eJr05JwDVwiYr6TEEy=d7zNbSt+%-lsXX4|QqwX08Qo%eL6$ECY0
z9#HD7%RA)D(S~1tWRI6x6A&h0qFR5z=URWDye#yae(U%6`umK+Yo0b<%>~bkZ9?66
z?Dizxz!1mUW43d2CcGwG?Bv_f+FJfhr+Z3WhKn0cXE{~Gc!0GE%gq*usirUbTX7rv
zoZX7<PnQQvpGns|#3jA4?9(2MseH_i09GIX6%1ZXJ~u0garA?JQyUi2*2C2pn|7zR
z`3Up)PE#J%{LO7#fU)=haWNBYysxf<-jL<5)GaHOL!Q8BrUq+DWU#p$CN-|tMAe?)
zUyPFOGhCJ5BrK(k);reM0({i(PqpAGX-bKJl{V;JWfTRrP85;~n7-Fsy2Y$`hPExn
zLt5Cx;a$}G1zv1&Gq#%tZOXm!17%u%q?7gQL*6{dpG-M<#xUTRJ-ILT!n9=oLYcUd
zk_~(iu_cFs0o0Ke{#iIpol&d!=T&&8*_yfkP>#-+DoxJj;-BJen0Txtdvl7f%%Xwq
z!C<7|l+_Tm7z8EaifeyO$r|$!RTq-AHxisBUCIuoY-7fet%EXd^2eFRkYO^?C%Y`q
zo99QGITl#$r{TwFJdab4<_#v(08t|Rw_<s{fkg-o#MqEww||?5^DqTjRh_+|4{35F
zW11OKpaafPRvZ;Mtj*w8x@1qGPoS_=>|BoHIGW&ek24BFwDeA-{Qh*DQ_E=HCqfLd
z8faaA{&gcRqnB4MAe}@*Q5M=_IuyY}eG=2R6zQuWm3p+jaCE1)kKrXdfCUefPLa6e
z8|SPzCukWwwE_p91hXqDltkN=7X7ao=}}|tK3@|_({EX~pP`SWJI%=UjF4_?EOtsG
zoKILnrGcu=X_^ooJDv|o&ObPAaW3|d5~}N4qgT9pvag^Ok?)eeZ5M6xG{(JS;R=Qi
z)2v=2w&N_e<-@qM42+J8@W*jyfqB|GodTOt9iqjP96DqpP0`u(u02v(ajKVug8_c3
z=0s4Do^{M^Lzk5XEz2!-rN$(42rB*tO`k_upk<|5Ul9z*_FN@*xNzcoJtJcSm2kzK
zOrk+RXH9#R6+!O1Ug#$oQ7~gKD8#*Hc4Uf4-Pe^29u?h4$s@+*QdK%<7zQJ?hP^Q=
zq0R60he#EjbaBX(Bsz(DbXi2bg_|dt+C)65f8@8~&axm5gX;*whh4?)g9(F9mc(#8
zdq$uHfjqNblZpl9J3qJ%rGAZc|48@zNWJHZswZ&uzXvd&@hK$h9)dC{<sKC|upJI5
z^C5E%)tq)imjX)}CNb)n8mj#{7{_cn9ylxms~5uDig9o%YQa-wjxtaHVdEp8g?}sr
z7T^~tJd5UB@L*%0{+;9n?Dux8Gt5Qq${ZA^exW##)a%qzkuVu`9d?t-cT^gczh6te
zhZIY^p^WBAc#l3JLoa=<#JX#paB>X^62rmzj{d#hOMd63lI1Tw|BaAq2ic!(tn2se
zWQg;UWfZRD8d8!@B$4DyxdqdDr-%^#51JQ`ca@3lQV~o=gY@9nQ+w$%#*y1xl#_h(
zxwXyu&e}KX6WLyNlF{T-LJV2eT*H0FlpRI`Spw>=tePvT?-Fo#_kiLo%h@eh4o!a1
z;>jP7EdMW_{0eh-?YXNlhWF3?o{6ee#*X+`FS9U@%v9ym&s*kqXU%hanUf>A$~yn+
zr@zANKVzZw?C+VWlp_9G6V03x(_i*mP&f1SC$3u_rdSVd7VOE{Ea+aX<!D(hy1{~O
zY7WWGMoF^Qg05n8=|Pz}rV0;Vag9<_VKCq!2quJ`aA-jyhQv^rCR)5zD@(5nKR)EN
z{oiD3Y)fj`{dVK*EO|G!Hed5fA5nKYKz*16XJUVJ<AgG1ys2n)J`GunSkt+WL!I?F
z;q>aMpld#q&6(^>-cTrru5bGk@5$~@<4+AQBeuMlNC9@>l4SiTo~f6RjvtOR+A%#9
zAy|OBhN|JEE}tE{Q4f19X(XF(C({#exl~vDNw%*{Grd<+&AK==Nh>);>Aq;Sxgf`b
z)H0vE;{ClO^cb=$SD7a9?H+;EgdS_~8H<#Jd1-J`n<!ShabIl%$|EnSxr#(S$RF^C
zs7;dU?Z6;n|71sJ04%&DSjubQHRHA7PQZ~EJdzcaRIdvxy!zu8;S7GBy}M(jBCjRb
zDD`aGGN76!Adw^X9jq;Nj1~28@|hhFh3>*wX;b4!24`qxqnP#$Fs(s#C6`d0M#W#I
z$Cetvx!O&w*}~CHqwI3+cE;10_FAp}815sQ<3OG3flg3Po4LHmHb0GY(mbhWFq|<)
z<Nmcqcp3ZO?xlNbm@VSd^Fat@vZ2*YSr4*T=@FzKBOZ1iQHtM4=O~z>io7{VU$XuA
zgqit|dOZ7+{^BLl#Lc7Wa@+Z>(tcOj#^uCvKMj9_)m|?(eZamztI>w-x64xIa4?Ur
z00V?}llh*b)6|V9HH9QV4%eK1AWM`}b-66vwDtoWS<QS2S>)B<;2`&|@Ph9z6<;a(
zX77$@zdP!k%}33HH8?R$U_{yEXegVE3uPONncI!gP^`QA(;&Xmv{-t-*e;TlZWz8_
z%tF$TTfLZ)I|@U>{=5$FB*mrOY(I#@1x*ob!L43}cgU%kmAUoCHP2OYpH%Z*sdxUV
z?nFdZJ2nmrS8?gS!s9d?<7s*u3=TpVVW@gWc2M|x-1(rTR;i+p6QGxjh@RG>g&7cA
zxYy!dyiU=w#*ejN_~MXSmmnVw24Y~U649O%bMDROiQ}SYZ7cF~41)<riCL}<$$O$i
zLB@v06ac7kYyvkG(5fBIK^@cOl>`tS=ue&r!K_VLcG5qOHaP!i5_Bq3CduL1w#g%E
zCpbMN<gL{BV=%BA=QedY+jAG6f5uRf-DAC^cz>1kh;q-c+j-%8*Z>XVI#uvylj}};
zKLOxjHWXnsVrPv#PgIu{)@$0$8+sGvkdnZ0E|Q$qlV!53qSTR8Wuj0Kek<q38>#PU
zXrz*jwY$~=j+mW;&**OZ&)!*SME``nBLHI)^EN}wqP<MgMuU<UEtS4h%IQJ;`<5!X
zaLP-TN*=II>itW#{F$%2RLewwX1WIBXKSRgq-#K|Kx0WYXpZ{hdmFXF*}ZMlJwjUV
zz3m9{eQzVkq%T%@Em|%Z-~-zMBMr=x-C-~O<yW)E|52jws#2N$Eltana;Z-j=HHS~
zrBc}~^LBOh|Nbb;^Sa|wIYa&OX0=>m)Y7u2=N)7!Q;+Lk?dK=+&ZhceNe}ap)ra+m
z>7}wtFB7Yi$rp}fk{Zh7%g2H}l@K(&$;w-%6NlDmNl%2xO1iN&J&$Cnei;v)zx4=Q
zF&)q2B|Q<uKIzHY&1ScdnQoIq6j$mH8@5!&e{);L(SuuU4_?h@1hZBnl;7-m-nRz{
zu2Cw}zwKd+#+&q!^BG40iJQv&AA0~_&{fb?2TJ{Gg|lQ66|EIj@ryMGr&L5yr=T;<
zpxGxKOsBz}h*XGNGuRj4NyvPAJy#keu;4nHphKDRl@!EjVZ}qA$}EAL4AO^*XVt|H
zyY$X@j(|hkR5O`|qL1(QFUi~nUgj_XN*c?u8BI#%%txdP=nn~lv?&;*O^rd)U+M{N
z5`ri9A)$rzhXNwpWGjRIkf4eBcR}xL8u(0ZRLM7*><F9Ias}Ca$mUHlsM8N`C@1eQ
z(1{O)e7&$A%m*_B_asQ@jU<Jxw1A^tEPs))8Q8WExfdj7C@WCUiqcx{q?%2~GmeFA
z6JQY48X2T4TSZ6BDj{GT3;yU2xwFX;qZ=NnEyG~D#%MOZ6U|jkekfLkQwv6(bWX2K
zS8XnyW@>_|FqsdwFJVZ@o9FS|qO!=4CahH_hnbli86(bpK`=i!TaZt~VA-;fgd}J+
zhLhRdnov-`gO8(V;JHTX>?GM8?3TOxN8}cm%6V@dtR+PSQ`J(%H)9I}>yHXP{Kfrs
zeTVC*TJAwXPbo1laSaxU8XEv#K%l>>2P*7h_4mVv<Pr7v=JSYJs9`6<jv6$71H(B3
zsbX3pCS>y<VL<9BLr40-kf_GEqStP(mm?{GlSko=)qR-;VHG#V6Y728bhf7Zd*&Q8
z_s`oWudIfP-j!aNukb?Ck~jjDMWvc4sl7*;yvd=(Iiis7bt0-PvC|QS<f}cLpr<x;
zx}PMaky+Wkvo;w|xG;+>$2o27(_k8hht!<rQs()@{P;Qzm;H!VkySIX(_j>J*Gd;k
z0-8vyi=9tNSE~HOoI0y~J5^X!q5}$#8~k!IUIUX%LAVo#wfSD(F<2}(IoH0+S#|7l
zWS%8dazU3FuyR3*6e3xD51ijxw*L%_x}c*JAep?RQLN{X?aaa(JMj1}Y9Q=9_pS_%
zS2bCb<SO%IA(+>Gd};Q>>@dPCEVp<%d7N!=yBv15XkfW4i;HNtw3mGP#Z<xHWKSyL
zKnYnHj>{jfucxk5Gf6{J%<zu_At90sQk2>PQNUpurYwE*srvI(K<Us3QV`C{#`2nb
zR-*}7_^^`hTOx$f_vl&35QGp(U9-el3_qq8JcefiOt3B&G&&kzt{ok<-|e1Jg1I!d
zwPbF55;Eh|q!ba<1;m*bVh-O#BuV3z(E<-2J}g<xH&malnWEKFzMi2IiY>(X;g;VK
zPo_a{R=#w|_F%t_1trVGB|iH^eU=(+xqzwKBT{@ZWGAiq_h`JnaB_v)<uar)4iwMZ
zGjT)m4#~)zlC8=*{(^T4q<XoDtY~he=iz)k1Wlp+D5C0k5~4}L)@jCP;DqT-lNQNz
zjG`G8ZQ;9+0!m0Qpj%DKfTZKgnNlX?Yr~mD-D}F91U-n-(b16A=wb>1NuJlc>7jE-
z0v}~flk5PxCr&)j2{Xe|V+p#`am<xgh-As7m6gNtp-YgqQa5snJ^b?FSHknS>rO{e
z_*$q#%|7r|oa@lusU$kn<Y|P3Q%*?(YJZ$Djb4Vg`%3GIGyJRIUAAPCce3WLdv#_I
ze|$hEb{Je!4!h3$@{%|Z)fs{A7c(MyYF+&W2d-q(UoFSCO38B4oHf}>?-WA|M(h*1
z6fdvZ5kH7#3S^MR2u<&-kO|RP^#%w8xG#yY?TIh-9<Q&2$4O*ocAc+a{Y+3?LHb$A
zh|ef4pn@V!yB*J&**&BqeKK;GnZT6GN0?f2s<WQM97eLkD7ro2@+^(x6LkeXarOgB
z`zIGIk~hjV`4H`z$8UF!o+$Z_bCe;Xdc>g?54lW58Y6)Gj4kW4wR9<h#8JI&hXY2F
zUyd8+?dEB_b$-@9Y8?NXzQxgd99XA@NAlEhsahoe{@n3vwXIqT56M%1CbLLs0Yu3}
z<oLsM8;sQ90Xf##vSLOaP4u-NP1cK}HkL>(e|2_ghMZ^g34T|zJvlyl&leMaK*D&@
z=y|Q~9eqp)vMh!#4vbh5Y(Ce+A>|Glj{d}I#6qZit!A2hA;Kr>I#>gtWx=61!v_KR
zJvg*I)Pd5vAQj3)Jk0ML^+amhWLAFKO$-}_TjGmmuewb>UO)nFQ$z>;VhJ%0DIG@=
z`<~1lXO0B+<UY+f>x)QWfVOI241Treq=#pHWybtTK3dN#)5uCvIlCF_0ZQur@HeG=
z@&Ik*3yq~2H|V>}_=0j~X*vn07P~@I?wQk(U%4dgY}!>b?+zzxJm_*qhQ4sDf#Fe9
zD@zH!F>A}#*2<2U#~bU)C;5S=dDOj}$-0ar&rT5oW#+4WdeKbh*2z{%DdIVf#V#jh
z=U>2fvdqOzZR-3YIeLj~+pbo%()_;&N|xCg%apahI`+|h;_&;k3}>VxpeQ(BsTOQV
z)ek)qk~5m*q0>D5=(F0C+U}icK-G#wGUm)Tlo^+n=8(kT8Bb>2>5VxOocI@~`pwUH
zchsZk-Q^Qck&R`9!oJotn1{tlwFp=0BlUUN`ToiG>kIMWYG{fUlc_ofeS%+vY=m4d
zJEdQ~jemXeZBI#9=td5u26`(^YW2Rpjf;D_S3q(EKX0ciSkhh#NCeZPrG}74sG#v>
z*_q5ck7CNS%yxuSmlCom*plxVU;4eleJBx@KVfl^vPEz*PtLEGNT(WW&I-e98eLu@
zR*!l}Vh-h!yLSYHpECmx%#s77YXYAN$WtJ*;=pOvm_;JvZl=-qWs^jOE!+mHrDWPm
z7ztUm0jY>*PWVD*Yd7>f>PhF+9Cu71Mnbac`4mjW4w^TZ9U8?@b-)3kCU}-BN%FSY
z3@HB^3zQOT+UFx>!ab)D#^WUCKix-kI)W~n088KgtpqFmG?KCFNctqjwkBvql@r5$
zbgL^7Pz^1Ul&D9?i{F`4WK0S+Vqm6_<<o?)YL%W_f761{-xKvO+V{`(BQnF(gW6o6
zv9Pl%Nob&s4%d$4l3`Oshj1_I3(2a^B;xR1hm6z_WymuQI5W_{IZua4{?6y-FCO18
z$%bTxxjVYkVe4iQkY|u-%`_a7hJiFkSV+?O!a*PW?`xpAi>|XmV7IW%k3pN$Jp>ag
zugNgJ{N?E61s57fREMe3oRmU>^HU~>_8pl%lG_`xjLx@zv#(<H!e889>1zD`+wVy}
zp${tf;BVijjYmt6z8qZ>Z9a!J_B*Sx*Sho9!aKb1hxNH94)r8?wi3SrjaFdA)~I-7
zBjMJHFh+P#zk_Ex@=s6g8U1T1zYt4f0;W-cBtoNv%u;xh(bo(iFFX2I+!*<uB!%a)
z-gFb`(f%`aqtTC82)~F(|5nP_b1=WD4e9*w%&DfVpUK?lFwh2ezW=-Xeb#Jqp_+b-
z<t+EdI@NMK(;Oe{j~NVI8lxmxl65$~LFe|iQ|FR7_*$SuL)FY0`A3`5KPWCY2uDI_
zi|U)HFZkF86T6q7t#1D{^I6&ymE!*W%=OL)wpb)^hBaJX+9@>D#L)2hGi|6<|L=_B
zXm+=59d~WI0)xXQDV3SS(Wn!~B50q~sH_aRCNCb{2!U-k8-)d<Qq(>oKgHg~3!CCv
zFnA_4F<N|m03f@@gA$6;@3wte_+asabQr9aupgUulsqC+lW43p&0VEWt9dW%PS3*r
zKEZHxvqfL0pH5bGU#H$El0#B5O##`SJ+q}a#mJT5@J*4|;-AmO)tl2iTz`?Ua2lZD
zdif+?IS#J@jthd4mUNZpPI?F1epD<3{=L9qCH@Bnj3w4o?L^R$Wn!cysbh6J?L!tT
zSq&2j97#`NMtAF8d%D(uP?2oW@&<xFu?&?Y5#mEA5}yHfygoT@o}Zkh03M$iOk|;r
zn=@)l*xFuXVL%8BqdwB%oxMnW+Al)$gk_?K+gn!R=88OWYYfVvM~=hW*;+4JU;m8V
zJhk5UHW;YR3he!m;B33RUaeADNoq<elw`DgE7EqBVyLzal3sEKQ<j-nFIvfHp3g9}
ziqTwNMppAAi%^m@jf+DF7YX8c+>LnG5Humb($ben7qgZeGo8z5BmR)`aam!^Sg81e
zy1=KGAAkAq>w031Gavr&!>?(hoP3k{5CmIRP;2+>MT^RJeNl|!GGUrCBK@-Hm6V^)
z%wDzZCRr8=i6yj2i3c=})aK@Xo-UlGy}@~K)Se_9)vNlI`lOL>tfv|4H%VLLax3gc
z?7UWU$-+K?)&<2Z<zS;`Km1^C{H%P!y}4HRGHa0PLy@iegRxbA&{xj098oL?#|Mh6
zmsD65CPa2r{tY0~29x`Tiv6-eK#cl)!XPi#AR)SwJF{cU{I7*w^CPsol!SXc?uF+;
zlo*WD*qAc!cYWy#e2>-L0R<~?4m+K0D!Kf*{1jZ(SCN!tp&EN>Q9upgC>&kRt`@v|
z-Fd#ajGn#ms3)3-voRR$q&{sTL9nHn(WhtOO*HB)n(=po$l9%Z3Y@jI!AM|2%;Tv|
zA(J;dXfWD*&e<icck7uad+57Gl?2y0MMN~3hdZgqAHk%9wDu#$X2$k<1e{w<U9Rj@
z*Io>}2b#k{I3Rj0qQGFZo__0MCj24OGIN#_%_xP*TVd&+J}Z>r7Vn2NCgX^4)5*;v
z1~iQb1MZ7Nj!7i7k6=+1^J65`C23?W9wP{nib9cvGl-)Bl?C9l5X}<cDtc8bj6!m#
zAD(PZD^?B^Jd&^W?oOlLn#rT4_fvjb=eP9dZ0FD1%7u5vf}KsfdbMq>WNE{_p7Cr`
z>nwI{J>frWM}!U0q5?L$td>cNYVz-~@@CSwa5>D8$v`OViV@s+vOwCHk519M<P1&;
zllLqPePA*W628R-Dr#1GsFsZ6A*mCfM{TF>Q@?Z4$8xg6DBTKNRiN4ipK)y<z=At!
zzus_sCo_d9-ohLsm6r80x6MLyWwCIetC)WGoxQ$G_Z~O=to^5(CMgJ0(B9T{G+|v-
zwt|d22hROWeq8hlwiyJ-_E>g0^BJ#ZI2z9{uXJYI*a-*0B(}^O_5iGVUe1X1$#dFA
zg=0v@{(D{^k-_hzTBihxG=f$)F`|o>qlC!n0i_mRn|-XuFQ+*T;1dd+2AuGDjUEIN
zW<8UvnSHfV%Oq*V$@~eT9t@nvkIU)IiX*YQXFEbKra&=l=+|`A)Dc0qxeIZzjwL}X
zoBUu2u{=vG3nf@?+3jYu3isDC58usRsmY#u=KO#6E}VWOCH2vdg|L)Wa0?b;U!CDz
zcH*-^tdoXi21jb%M@uzQlQ5!XIQke($5{yhKtf@^is&Kx0vY!-?lP9Vmm_?e(Uet4
z^ao>Lok$rsT4w5zVoUJ?u4HfAH0_v66m?<NpUrtn!<N<W676L5OW)G393{U#iFykS
zGF-l8PBkEP6``C@(ugKnwn*xb5)IhhgM^`=<6p%&^o}a|%(;vb+lQ$!UXfUA`tvF8
ze0<Bbe;!huU236yU(}b{HFj-h14FZmI~xaH`VvK{XL_XK@>NP)g`ITzu0jW<hJlso
z*Ggzhzw+qWhQ#nUyt^#*tjkW-8AhYB<KaKs_)o>hf4AgYU%swXxdCsSBnxorCOIRb
z9MC)0QW=Z&u}KPmF;xq=YC<yGyg(`2q^r$M#jzDLL=PLrAs~Vbf2<`L#&;w3Pp3ZT
zN*aU-ACW;si>F%k8Wsqgx+t^|)jX?_h?Hsej*|)N4Aa&cP?baLk<J~;`GWVBQ4~QS
zi*#buEu=)BQl-QRg=x=-Wdplci5;AI+bVoqymfl&INE}meK}^ru?LhF>f8*mNG8*n
z%9KtGT4!YfE&YNEQ0*=C+Zx4gekaeBop;A4FL%{tPnu_njZ*J4_bvkP-Zg$|o>MuH
zi`JSvY#TUK<IbI2T`6W=tf($C&TxN<x4&y1wwf=FcaIte=8fz2Ti%^F&R(k~1>;%7
z;5HX9IDLtwxTN8EWkZOvdA}_Wu!MKNs*^DY(Nhbw=|WhtUcYq<PRkO?nwr46sA>e{
zqr0C(hk0_o5;n}|=Nq+=i#R&{<dtwsqg|v7J=(}*?am!AbGnklMT|Ci^@erQ)R9q#
z%~?Yt9^~(yz_7{;XT6L9g8CS$Q)zc3F1Lm3+dhKo-_%J?K3y{#?f2iUbMTCKTw1`-
zSiZi=b5B+dh=V4IU)Fr`btEJGMWMXw{IEojbFydBx-wGpyU&mPNJ`Xkg7`s5Izqz7
zWp_YZ7>J|PV1f#S+hpHr)@f}jF>rJ&f3c~$Zg)e=S-6_t6iALXCH}N{Og{@nWId#W
zyJSw{AF03oc}A>1a%?jzT5fKpO--)|eP$JAkvdEqxP13LLRq@F!f^QYWqsfEmLyQh
z--+~6suQO~!P!5>MDgFqu(X1Dp5;PoG^fqX@n2+5R(+f|UpE%=qk9j4thl*C)gB)d
zf>Z1rk1IzwS7xhTtJPhTugdCDf7M*#{B7#O265szJ#8Exs3C4jOz2_<YTC+`&v)|~
zrby25I~m;VQc{bfaJ1Gf-*4w#-}!H_+stOmcn$4Yy$&XrQ*FKA+r9bVdLLj7)ucp=
zY{x`u6PoRR{9vo71+=r7(uefTR@7bbNV3k&`v%U(%pQ4hyYyLG$$a)#rzCu|<UDao
zMrSCkFe-Hl7LDmh9U}U_%yp8)qw#{SYTQeo_yxmI<L9GZ%AD2(<1wN}jt|`<HRKe~
zj1=?Ntif<oziM5PHX{KM3DD0|y5Dt|?&2wAX3S5lIAv~|VpR7nEsIi{N|ai0fwQ7l
zF#?9*FL7B=a%Dtff~6(p{ZfD>4Q)>2jj1m0FeJQ(hVlwpcT;e@l($L!hvT8ue@QRj
zWKb{v#*kj;>1>S8)PHS|Z*yh=bzrvP)eVx0h=lV+P8KDT>k-Jy=vh<WQUYB{`pFW*
zxn+2SG>_OER6^>+5@{VJsfCTUJa0ATM@oa|YMX%cD5YXz3Z@H;XY;u;NtaqoVm11x
zaZ}>0Sz^0INnJ3d0-avXd!Lu&j8_EQ`Mxy8x>U7BFf%Q(p-nW8>}RuaDsG6H&|3Vm
zRaH0fY^;B`A{aGFtGFy<qO3xDlUr<11s-8dzd-xo_227d-WfK4G<gW)(2wA+^|IPF
zcJo!yWyRx8ICl!hYd&2g>eA#4r#x!x9x$XX**#CJ&67MTYf%WIrAe=s4cU{23R|ni
z(u-1d1oyT|T<^0~!u5NS@@M0ENu8pocgf#HMfj)_MEFYFn$@`k(>AToGUh0|F?W?m
zmC(l)9%FP({H>4ds0O-&&wD0sf7r`@Cw@?qAtzz)_`cgsW$=)PiazXiDIvxvgEr9*
zEdGu%0As5ye3qL8#7n69w)q}`dTezj6j*oGrd)|_UADHQ<oFUR#oD{eX?GMi>ao9o
zlW3@A!-gWOWs-j_iB}o1v1&A)nqt~yD;ixs)Q@E{+p^Jq#*y7xn<K@Jg6vceq|(uD
zp(-M5h9B#f>h4l6=5lU>f#rH7ilk?n^}|_IwHxJW9(+_B|NcJ4i(aJN?W(OlV@ZVw
zish8DYZg_LWDuO;o;(>=1P}FO=LfS2APmNoSylJ5mOmkd<zI{nLQJ`v=ey>+WUoJS
zx@mM!!68`X^!$<Od!qX;JV9M`NKq&xd#Z}hZZcPjMPBO~CU+1j-ZBg&L$YBA>@u==
zQW<V%r#Br>xFQQh;Fiq+!Hpg=K*h>Wfbyn^Q3}VXM=7oDPyxqk%pqq;B+jOM#K;Ou
z)M88uba6SRE=Y)=R|86;M$COi+S-V~Ft%BCq67m<y=h3tG*nt&410=MzqNwhh+;Ze
zxpmHT$O)#UB7^wW$Uwsh<f6-w6f+z?EI9PYk|?270ukXl@DOcM8=ZR|jk#2-l8VAx
zrHIA__k_fbr!I=3t-lZ*y#C-Ha`C4CRH@72xp6P2ztE<tWDlE1vgST&qLzrU_=;@^
z%?n(~Ae$cGP-zp)g!Rg4(#M)nn97Z`)w3o|;UZ<~gEwF7e6KU*f1e4}6E`VsHNDNU
z-O;Xl=p2cm70H#DS?T>i=7O@*Q$y;K+#KFc24hYOl<i56nm0e0N;3)5(s%^k#_XCS
z)}QSwDB6$7R^%;qm%S$R4|4zM=Qp~YoyA`tak1rO1)e$I>4l_~=Z&0!BX&C!Yoedn
ze12u>E$JV?fV-U{+c5KF$`>F@M*LCj*n*aLm(s*-?@&<@m7Rr;CNBYpmBL;O0p`^N
z>Mln?`uQXG2_~+(9hvf&`Nqj__C;yT`VPx82rW)5?V|K9yZiXan=`iaIqfI9J>cjp
zLZ<HW#fi*#-&yYX_$rVcn7Y1G=v{TRp%YJ&(0h|Kqd*i;XRF^28S$f)He0tgFOq{y
zY3StK>)7NZa+yjiEA}#+4`$J1V7(VNkT}W}M+>L8L&nJ%Cs%iI)D1XKt2JJEduKi?
z7<_i<5?DTuL+ubBT@FI)_9>%5%%Si4>r*mEPdGmu;~$80lK+pofndpHeksi)V=`t}
zdeUb}Z80R%;2au6Au|bbCiWEz?-h}s-;kLGUZmEVVNro?Q?LX9&Nj(Qlw>H%rRzAK
z-X*)Tg)W!WPjL!vu58GbRy3`wtgFT8;KEXTjq6xs<U%RJ2NuD*NNo;@F28d!K=kCo
zvo6$1L07wSD)``lIx@U}ZOD)bfJ=uBmFXL`T@r4V&dG)IZj_VMIZ5^xpQlj0r<X9r
z4ZiJ|<;iRqWf~LskqaVASXjnwtjGDx3a~2zw)3dfbXF|1q)iu^I`O?#x)=ROc5btc
zGN1$*mtGe$aM@P;b-|?NAvyr5M_Q;pISRSbb1+dN6LF%44<D+v=nMTaYiBYd^op24
z*|{V$#5W@Hu+UBGLA%*rJua{kOW?-H<bBHZm&yE_mt6Hx$%Z59&q=|gPVrY}g|ny3
zc7QC5O-n{&Rb8YH?ultjJ;Mb#MY~e!65kdH8)xlloXY8`Zu2uM9v}fuSWhvpRlQ9V
zE6DIkdP%}4zaSEkH`8dQ`?q{jpUrEWRhdnCV6h%qW^{2cg+Bh0n8v~>&<--xFNnX1
z)02o7&0@)@;>@Vx9LRt}(_(WS*ou3h_`5`8)4fn2z3y+)UC)cRpW8{ds1w;IS=4Kh
zBwKW1Vsm8fIaT(tl6UHZ^^Ssl32Le>XXZwst4G~BiYw~$T5AbT+m;xcr;q4kHUtC_
z=YV->R}hQU6$cc}oGbg8=+PV_)7s~QM8~Alo4UdfD@7vlh)TQ}tCzM~;ErP%lif3&
zagVJkIz1`I(94K!X?7uPa(U*$d@3{)E3^&as$FxmI~bsPVf=3pw6H&Iui2mDMgJ<f
z=f9&sVNiin$vA{jmXQlerbY?O*hY3u0G6ObmggijF8yp+mp_BMjjfsYxRs@X7jKCa
zlM*!!())irfd7MostgY-?mA&i`IKkaK#Lii)j>JaS&=N3Fw(F1D(1>7ig0o)jee}p
zHv{WuIROr5I+a;)k?2Lhu<m$r$A+z>y}j`AXhsdzS}>Pm?xo&^(G>}GnRGo&4Jje3
zTUwveiOXaFHED5d2`ym~>G<oVLK<se)}!k=E?|IH$0z5_{RTy5$TyoZ(@o5@L^*nj
z&n{(1__k-K^fD`8Y8KGr_CQiXr2WmpJn?qg??UGZ?!B;QqB<T*NC&6cW-X1=O3{@x
z45rtX2|adFegu6rMKgUN!CIZPU=+T-osP$|@ChP87#6L~^VS$qkUlmaaksrON4To(
zJ&&~^h%LFcB)q`kvwFqrWlmG^t0b2ZlHFKVfN$6cmi7pt5#@+U`)-mwhZf0hD|G6l
zaxO0MrsiEd5(kvu0%20i-FcK=Q)7pHNLvE&Kv&_A=+5p7@-#}pdadQ@T>M#l#h<Ji
zZ`T*#Pl(^{bE5vGOAII0SE@LlE}(15(B~L^@gSDM1r|sctHTA-nH|fLpUWgF1cXKx
zX41u9Z1gX)ifIxo&Y@2%Gd$5jSj-8?RH-G-q@OX3wt0MbqBg>8GM~X}hb!PA46Xff
zTPfO#J6=7p0=ryJ!xM6bLmhVZkt4<A{@_l@EE!BK7hjTGN%zHdaHKAjl*vh1l1+*q
zlzh!fg;Ft8-Vospt)tzy4FV_G@~Rm;G1c$!`1gji+MlSy)KW%fGX@^4k@5(%6w_;R
za$kB>*<_K_oj{(fN^Mws&VOt0VqEBf9Xy=nUCgS0jHplMv$48;$m~XbpV;KWMGjmm
zbEmmm$bihUn8~$^@Rm-fvm5tlOdLY1-b7*}MR`!AK-@4WM4`Td-6>un8-392j;G|)
z8{C<g^9`pUiM)kVFB&_!2swc&O(N@yhWv{6$`)<xU9{dy^q5H=m9|<+zCKxu^mif>
zaNJswuK$4z%iwlYtwBegCC=MLHQ>|JPM7Nj7A;Aj&!-`qx7scOPro5Q(?Y**I(g(m
z%`c4!lQhQa--$NoZ1A2=*YHuii89})Vd<ndw&tj{#<k?s|89=w?<rl<fYPkT*NQT-
z{r<aNNiDc1sSpqWsfAW9Wf0Ah<c1=F7Hm92TMHk@DZ5eEA?*>s^z}Or=>&rjkYO~M
zJfhA}(p;TL&gh%Uu4rr0L<dVu1tk|GiPj0HEnzt&R3uMJE+R=7uLt^?%6G(banyyZ
zn+uM@<niwbm;ugswks!<XH<6&M1kNJu>_|VLnnhXJ~jde@x2!HbU`#5E;}|gIsnI_
z(abnGeYT4NPKg7^hfmQPmL7CQU1XgIS*q)uq_=bSMoDP9V8P6j>5E|5b9$TSAJsQT
zvgzosQBsdJlr5BXUAN5|Maox3i85Kq<niPiQ*eUVW6mya*PAfs3c^b24zuu#{B%?R
zOH^9#x<TiW;vgwX#Mox^CHCM-^&;(zOzS8N2{nss!rKPp@kEk#)9&t4KbCDB8t~8>
zWRh}=|GQ&8wvG-nGyS<Z1ue4Brvin|l(f^TEFECOIxUAr0n&5bYQzA$d1nE>PPgEy
zwfD5a=4w-c-8N%F7PpVlDvl@}e;OS~Uyql6&0lhYf%YVvM&q8@+0I|h7SA_&veYV;
zFG_dv?zp{ss19xNW|<;U7DLPruDCp%`6gG8j>$nMxjj*%oB~~%8w|66_UT#k<g9uA
z-r6W3^U$_t-8MkabPV0UO^3c<z-S{gqg!Ob@T5h$N?`75CXMJ^);z%d+DFafS8W8I
zGkx<ToebLJexF3C^gE1*`xylrlRT2@Dg2UrLBg(5VFqo|;0nw3o$j9P9vxA%&HLm1
zR(2DZJ(rooXOGZUb<&fbhQt+mHnh|3S-zH_w_N{5RM6oViK=amEhFM{>y3|#_>2zF
zSo$5m$0jJ1h&*|#mY-JMt`wPntWD{BFN+Sn-7c3<Fx5aqo(q=LjD!LvPcF_2p5_>!
zHu5;9U!cQA+K>#gR4d4bo9EyQqA@bfXiJz6^*T~nb$jtB)S+z*a?h-5W`XEy?YY#m
zOV~6YN@gDEb;;)gQ^Ek$R7M0wmsc}UM(v`;R1;UKA}49frx|xQX$60z@~_TPkWHO-
zl}g0n#3fpY`ZaI0L>;rVvC}vzQaAW~MC?nOu+1Ayz7ncKL4Bo+0L~hK%&cB(y=ROd
z9Ui3c3p2(?!YBA?F(2sXb3*6BDo$w~?q1)Toz6BzJo{yFHZi+p`7ZQu=f3AIt!<I<
z%V?4&Txc0cV;b3PjKLw276=u;tg^o%cIsWF^*ZZg+n<$cUXT$x->UfF7BtM=rUh-l
zUkko4vcsb9NO~yvj`)Q+M0puK<Lt;TTK1Z;Ra>eXj*BBX-CFnRXA!HMY9r^jh4S*<
zclmVZr)MXxPtF?$>l(H#rzcSk%x4R^FSq?9lrWalBz-0~j;u7^XBo?9N9m);ERG6J
zR`Iwj{-Wq(ys1U6S<A_n3s0p90OZ|*8b_vfp$5#W3;#O2OPfftL!##w8&UGcjRhI!
zQ)S0=BCjjdFcBj1D8*+JtAWnweXs!9WgY29Opj;@{Ccb?-3v9yo<dwxdbv`?CB{?C
zfksWArNCd!Q?au+f=bnIywB8P6FOsU`G${1UJ+HaU)?6ML^Z}D$fjj2JDhc|-csnk
z#WTz5b(xc$e4?vmVYO4$$&B$<ysKOhXq>V9a@8j*)wEp&r*LQKiX-=4D;j@VWa*Gm
zmvHb(8AHVaKA|7tx!(JXF>sj2WWe^5`n&mvPzj?_vHR0XY|}~^eAo&lWsG`ccGcnl
z`vuGwV*W{N?<Kx*xY`k0if6V_Stm`}ZS9_>5aYHxRw8>kVK<-yFdkX>AZ>00GKs^H
z1SbnWDo=*IYy^dX*^LFK9sw~&;SJ*`Q?Ph7GdODuAmhfWWLIb!*R!Z3S(=LA-WW}<
zjO&}=+SHRP4-uv}U_eQh?h(}hHb5iv@><@Y+for`0F3SnzQ%Tk81N-nMwx|$AL1=p
z2;VM37`1|a0w2g3;=Urxs1Utq9!lfRDOKxiN~IUgXJsK#Q7TUA^+2&YrGDl?M;YPE
zT;iacjqTG3U^3FkLIkXIp$~3L2_@Zh<+ZeL1oN=(bx1D(zm4z{Q-;Eg`-wGBBWA_3
z)MxF00~M@&YeyE^i6|w?P#+S|mJHQ&AyLxpPAH*^O|Gtd#X(hasl}L%oh^YYpHNS5
zxN?P39v6FNmkB8=LdM`)F_SM_)go<A&!0In3kGPGEalNj2`|&AEjPI(<E6wH{`&Xd
z9TDmsU4Uu|$10oO0xB05#0)CaG-eNHN?zrj3eFbau&BEVqTGZjDTHoRk`Q!kw^cV*
zJ0)z`l9^F~Y?6~ojASB@6$mGP<k*WjJZ4e<wJb%mlW!7bs~}VYDuT^3X&G}Y$Vu^_
zY;r8yKSqzQS<j=u85NNg;&H)W?kL+&_9tB*jnli+nyfEMtYz(F?a9<Xg=GX*1(V5M
zDX70%q}sJ@F;iD@myv0Pi3^ha7Niv^p2GX|eoaTMHXhx(JEq#kiKlo~&u-$WE%p$a
zjb#bNS<hHG?My0mG3AU$WROaWZi4a{7kGknc?HupxhL}2B-QgFb#*=_lj})8HTO8r
zT8&TrD;0D4mmP5XV3-{3mIrI4vP@RZl`mQfgaj^L4JD5Jzq%TfU-a{rLnkYNRfmIK
zr52abVi?R-S=Vbviv%r|EveP?7bfJ0lV6+fhGVPpBM(=p5#(dnIkt7-wDBZ_6#zYW
z>w1jp%V{joooMRx!hWEhcR1<YLq<S^w*e&&l-ja{Y7-o)1u0cOlW`nJlIp}Hr$Ulv
zBQlD0i1aap{E`QOvh<2ISh_NgYbOJ{3wYqQbrSA4=L9k^a7->D{YjNkk|gYBNq#I6
zKdJSl*03CZJ!>+x<GhTNE2CZGc^c4c8kx0@O1k+<UuTULS8X@ybIVz)Jbmh}XDgP)
zn*A@f0~DO6)$C1~t(vwT>uvt|4mB2=5)j1VDX(Wk$CjD7&3L}V3n^(>mO%S0gLf`|
z;4_~yAzCRekx<?iGmIhHW=M<7)Vj|Cm*F4D3;#VXK(Skro|QS?Y+kXQW=ni{t2hf5
zS@#!XHtzSXuaZzHX}2h;Ql`a{#7fz|7AIF)-BFnJMHX$i+@XBYIBuNLZfLw!A1#TS
zNQy=>gWnW`qEwD7nY(S@zK?A7wNAD(<S4Z9m;vNqW3<Z29TUnnF&*V%-K@Ujy}MJi
zN-81JUtcO{;LOkDD*N}vs;y>3vQ+{5JJ_0;uxpwi#^dX*7X_mht(#h4P;e*Loau94
zyy)jxm{fNKGE&C8D-gh<EmjuCbUb#zz;yM9Xd<vo4eTW=E4!VuwtJ&c&PT&>kKdcJ
z4O^ve#WzDw{QwiNoC-kHmRf5$o?KgOwH-N+$L5kA<Dtam1Tm%Yw)1UJiVr*2#*#y_
zJL>H-O(gzoHB)UKdYsidVJ;dEdN84EDD5(Vz@-~)7+E6WzSQk#J~ZFBW#_}r>PMA7
zlUIHoz}GxfnDxW>;?CJPF6Kk7h3t}1u_E3i_OMY|F0s~Am&OA}o3T0Lhq;>Kz--})
z63q$tNPRqXbbGaJn~aeh6CyX}xwfKDmYo;Ene&6{!2D?UyQW|UifJzamGE5Fsm5&T
z$)liBH0loKy(II4<k_-!uB76@DL`H=3%^jnH8U^&dOXv1@-1YWHcgsw<F`3Q^3#Jb
zK9yx5*Nd!Y81XM=&;IbkuLZG<R&SpX6`!hrWfL<M;%=B&YGDSwbiC(=cpQ;l7h&p2
zG&)jHTInYhNfbwUWXCA#esuQ*;OcLRC@It{>opcq{^K)An0j2(P?HJQ17{^lr3FaP
zC<XU}u(o9y3Em^z%mQmCEY1EzHAt~L{oNAmtl9X*P4xW8awaF5!rjcY=t5XSDtG6D
z^E6?dJCqE5)$?Iz-;ndNEI5TD(v5$(EX()d*UjgKxfU9At%h)A=*jEA6~UTV+D(CZ
z)%23F%=72#%OZT)eU0I2AvHOPQi?kZmP+t$sWU~M3<OW~q&6lW(V!n1?}P1I)<@?u
zoW+*0ATf<gbguoOjvLWQ%;GFSD@7IAqU-5<_HZzdulD%>XVSAG=}ii@Kn^WR_?h<s
z6D*i+xfA{cCHSoB>TC{*;&hxG%q|pKsPwDvhw=B$Fd7UZDFIg?zFRx&czmD^!{K<T
zk;A049~x;s`Dl#f!Rl#QO6wEBW#&#?S`W{k+2?jAiE5PZIrnIa@~QUZ0wHgSmDt~Y
z3B5BeK$l3Gc9V@w-v9#eDKnPPqz9O$qyJ6Re<tU;Rn^qk|AIlvu?e}&az*T8AR<z(
zB1u}{$K-A!69I#e*o<e+N7+;g6u6tolAsUNB4fr`WB=s%5DcnC6yT&*obO!<Ug>+!
z+>TayLM^>z5K#bF%g)Y>(8z4KU%Lcr8HBw{NuQ9Z5WsiTL&eqAd}mQ?UT6lBxxLs$
zr`dyTyED^n9usu$g}TC8Dd*e*s9r&fjG^fHVoOnqxY-iBdY2cz*S<J&bt*DXS}hB~
zL9yng`KS{1$ipa2%Vi>b;oQ(lpxmb{G-#Ad;`2yCj)cA0@=m(m&2&5oE)~s)Y3<TD
zPI(xsorBM^Kv=4f`r;Q7lm3wwos&z|!e7&c{f96@TVm*`TQnyq6w2ql^nLqTlDT~$
zeU4Lw_r%iBqJr<T4qi>Jg~o>B&85|PJ0ovQm%WMmP#>gWtMQX0JCw9RYWN;}D+WnL
zA(gDuGsL&d3Fe2xu_S}HAnPW;n2uZX1@BZobSH<&JER+!210c)P_$B)g88SEMWczR
ze5429T=Pnk54+bA6Ocn1YyA9ps%4mhSoJcG%<d_b0g$(MSwxzN@IUEYG6clPTS(Ng
z(twi;&y@r*B|XQ7RQr}pg=IY^-5ms!nW3eOi!)njh@rGC(VZ9$`T$#|V3vA6z78h3
zTGhQMVd>RaKgg-xP5kNl>$FUvPd;z^<O4JkTu(Ur$i+7cP^no^xKiJ`8H2d_z}V2Z
zyT9sRo@mmoQvSk$<OstSUC%3(zjzUj)EOg5FL@B!M6#8Tr-sl$mRY)-O4z_zcI})E
ztiEzB5%D%I0L^mf_kJqCl9PDEYr52nSv0<e*EkB+)N-Li!tt<4Xric;Yxc9IZ8H9J
zETi6j2Rfo!3u_F@F74!d;hEppi9s|O6kVU|ee(Ck-3kHk>lwb1z8&Xcbtj(QCmF78
zxfQe3$P4i{nJ+-?;}bQ+q-Q;}{Q%{=f%r0e#{k<)b|1~-x4TFAKAIzr{RgFxLr*`K
zn~{Fz0+?incMYlm&~8fQb<&;a+k>)}SgAFbh(w!*nwD)yfL2x`PID4{GHRSw(^4+m
z-1B*R9_Np@DnC-QbP|PZCyMU?T+r_JsYl9SFK*L&o|{a=_7^`(dd+<g(<iNPMuA1I
z!`T%JQTI-vOsr3n@n{_M-cWfz7N0)5+sq8VYS$S8Ebklps;9K)>G<xmwwB#(W>Y=d
z(8dG0M)}_q!X+JWRm9j~y_Lc1k(8z3bQWY@yJIu8sX7xI5B-Ydv}ktUlVA2!md5g^
z7<URETDonGZz6?qmhXTpCA3JW;X0|W0;;@N)_jEl`2a5)sJ+26TlNro!|619jSlzw
zmw@?MH=XU_V{v{yqDr?&O5{Y4?IY)@BP?Q)?QQ+hqHlh2m6-2DX^jAu-Px2lEnzzI
zPes3$B{PMdYzl^80QjIHXNnv0VM*OL=`(<QBi4514N$nt(+_fLWM?Cqg+s$k(@Zk+
zq7B4iJag!glspxy%W<Y|pfzrRx|ikT_pJ0K-zbqMOl`a{b*76o4I%^`K)Pm(I+`*Y
zlvDApllfF_c9FU>9dfZLD#|zsrm^v&r#p4V6IdoUQc4c$)v!p<A0a@DY)w%d&#kyy
z^pa@9%set|hos^SrWx-{q8NT73XM2bk!r!@GU@u%i*{CCv&2rD+^0_V2<wQNel(>c
zM1Ta#tg`6bYdv=HMJ+Gan`imGoZ;^}ZBMeT@;%UD-&o(U_L;TwC=5>hC-u2dl`mHQ
zE%z-Hl-_)@X6;dCAr{x*ezQEl8mT(%Nk8&I%9O5_Lvc#N_0P=RLhlo>T%KK)v+R=-
zoYBt)BL!!<_V$+5n_QmNJGL8z#`UGXo1#8X#$A;#HC;rxB(Ex^TvWt*c6&XlS9~5s
zgO#L`(2^4VNCM^-ad;WP7rizswd7y@1$}14l~kwq^0I;2@C#UvHiHr`VOEwIy<<y>
z&~q}PW9lZLH>J-e1)%X^OJ&KouTZ7)rC<lSO6K|M)E3`L+;^IP<uXG=>AcKY_QJH}
z02V?6=n#RS((cKnGPwI34wXt$s$Q)r&#byYHepUJ+|Y1*b87Cu=;O4MCuOu(+kKh3
z+J$AcQ?AL?Zs&sP+E_;Y;7bPJ?Av?no{L+PSoM>&SSCxI=B_)rR_P|`?=Q!*F)xUE
zLsl35qj<#%S8Mgf_|HOot%YD0S^o0*>=nr|(*G>WXD$mX3|aoi>VcLnWZmd8QUV(%
zLe>b00&Unfkt)6^?}sI*Kba~{Px2dmR(48%A8l-GIETCEyGPm(f7m=~IE}NjlQU-x
zPJnOYbw@S(`^c(ZeAYN<w%TtSXRYSRv6i*6y`P22HJP~`Bg)AW;L>rv?NQ&F>Wg}N
z{`|S~{kQS=rtPAJ-^Sd8)>VYW+i12{fsRsSRV~^(Xps@{X`hHfy)X=IMFEUL7a{9D
zqezZq|EVpZ&*W1nn@(0i^&hE^4nWECRBZv1AeBVt**L-ry<f9nFlqFZ!yL6u@C`oH
zDS|7OOWC%Pa`D0?$QgcR<=3)h^yZJMzph>$A{qPEuj^%j&Oj1)mJLr#A6cEU;$A~}
zE-J)2l!+i)xOn7{+hm8_rj7SVFXmQeF&8{!7T5kTwW#b!Sri#5#LfrsCd+y}M&x%2
zNo?@NSxfyQXJoP>)$H4fAK|@KXpSF+mjTy*RQrpuIE*|oNuce~-0OZeNxbe`Gwu1`
zlmM#bi<NEt-*J@+^3L6}NVzBe^cvkqb)D>Rlan1Tr+K>Ve@BYvQa2XR`#y@;X}>m+
z&1*SX3LY@DnFO<|e<Mvek3pA04mA<VKXI)CHI2<m@y0r~rsK$T;xHVN2021TaRy0E
z<?paNM?SyIS`=qJ6wmbMEeUe0ZE6(oN~==*%>U$t+2<KqSm+g&s8n>JmzFQw!c>%B
zw04x8Zj;h(EMG3u%vzy1z8Oz@|7MnAXYKuR0#JIs6$rpNfHeW=5B&P?Cx9d;{<6~x
zbmk@l7t=(jW)H31)OpJPNloAQn5a5E{w2?t#ItG$v+;Z|Fk&tP#Vc-xD(T0bCvbz*
z7wMB&+=g)K_TQ^fWq23$mJmZ?<p$x%tSVQkVb!mFc5&Qp9<*D{pBu%z;&m{Pd_e~A
z#qNHGUMo%)d!dKnusgZ4!Uk2dvL;}`OIKWZu-<}&&v9$3r8xlk<^R|3{!C`|^yaD-
zZLUWWTxV+LNJ&S^1E1P9kw%Siu0%=c7NiQJQLQ{1X>A@<B7Cg4Jm-V5w02R~JM)>{
z%S}l6jy_7dT)^enDh$w0Z$9cNwJUK-Xwv28|0hpLw!hUj5#q{M*+h2B|5lqQlQ#RF
zO=J<Im?8`e+C(4;6(Gso@k^c(j28KoEJ}J={Pc=(I*RD2ZVlC=i7|uxTV<@ZFNh>s
zY70r*J*-6XoUZ!o8b9pZ+`KVXIxn(2<PD`<k}QYvWa)LMu#d#JwMwK`lrdD<rZEnu
z;ObB&Qi*OMlQo6GeJM7R+C;`dSFnqI;b(u%KKq$F>MQK3WM@V9Y%8(sm2LRr{f4&B
z-eCDn_W2tvT|qa!-^_-vGFjMipqC}Ee&_l0E=ft!x(X=pUs3I|H#7jpn;Jo#VO;4e
zAl=q%B>7wYCg|l&^U1%BJ(1H^osjM@OVE^Mh+3&{@~yVAL(ysU3o+VwQ5ik4Bze%>
zKWB|Iy>~Q-2oGdeR=$*Oc8XYAsl`RyWC1jYK2t-9Nt0eHn>4HK3!Q*@Gny>dDy)XY
zQ*>?B=UI6tBX2K|YIJXH)mwT=Dl4mmdO*b6RvbHHhx1ozepph5CE+70533iB?!-<K
z8^g)+;T1mOJiQC!-$&ydffN0Lo)g1DY%C3G)apSc6I&zK7Lnq6v~&tw9!}XEJr2W^
zfm;<DK#GSAwJ84lov5c(pyp=@mTC$ee>11#uf7?LJ93ehzVhOmf#q#A3+DiPO`)OY
zOQ%p^X<2y+0@B~q*!+8@k!!xfzLjU%$us|iJ)0j`USa=C7P%rx^6gikiQzo|RH76N
z?H;NmFG^x6=&WCkqEDd}ZJ9BrQrsy;x+lRERu?u5yGa=aIVN6v<j)%K&YI^99&?g#
zUXL@Et%tOKUH*6)-b|xeQDwr*h(h@#-7}qV>SxVvXOa-b>zqP}Qw`bJL^XJm(ok|c
za$u9DK+v6zV@|_J>C@sT+L{1`b==q8m+g3aM0!4uj57JyRfOKfyn?eUyIKv;6i$3S
zgcBx_hO4HV@Q62f;ETdl%k;16j`^;UNjNR|xCEVMhN}eH-{zstCQsic2-R*d(};y$
z91bV5J4)tc78bU&Z>hR^%5G+W9o8hy@W+vAw1(n=>26A8dTqI~UNFSM%jye;TYTx!
z`18_4@%{W)r=$*M$$3I9gwp5Evsk>q#8(}`HwC4;4jRYr+pYbx=IMD$qQaXmiU^tG
zt0pHBii`@ZLK4{YoG_RU?sTL*S=MMbOFbru(^p@H{k~FhbWaj4kico^xpXa()mJQk
z5u{ct`?KVh`g1FnzgRP?_PN6;TE??R>*VNdqy6%vb$-12y3s0H!u&1p1qY$vDp`%L
z1vlNFBW%I_{8^MO7*G*ucaM)xE{^w$Y0K$y?F@+FkfN+?J||Epb1e{eU7krRVTfNn
z|DaBJv0<lH*KLs+M3QP+rH-=uNCUSlp~e(%T$BmG>NRaAC`><+%OZ5o{>+hE?MePe
zT`|4P=G1uyq*{1EA)+;Fu<K=e=#urQus;}@Qkjody~AXSB-fZl^;9pfgX#5de2PTK
z6f71?%EF!`Yvvd$s-sJh+(m1*2&a`1P#2ebExbfbP1hob>5_HJoz&931Ep0RWY;vm
zu50ApTwk1IB4>YD^&VaTj?1szpI$%R$sfflnFDbxSi&4Es%QnX6+FM*I_8G?Web>{
z#h0#M4k-6eSh)LEE&~Nyux=SRR?(`ZOX+^SHOmZ;8R@+XRy^)6U8fAR?q7erihyYg
zR;sAh<yTvaqH%n?K;|l5kj14qKYLY*;C=u4rCESZTd+C{YK(rh1zIqg&s(FVg-}0x
znHE6){`D)B0Mov+Fj@;1Dk;<Y)z&6?|K}}7wqopOuRsFa`_~XXM@KGc`*rEaYxf0o
zw5scV86DX%@NZx<Hmu5O{yAhU75Bz6&|tn)Gg-^S^%8N&Mgo0_%8>$>eQmv?keVrc
z(VwPfs<%H)O&enLCDcrzto{{RoCRXCY1xaat0v~Ap9Kbm>iszYC5fo1{%aWum~i*y
z1hh&YKQjg5GMym1sBJe`8+XVQA5!6BJIBT%D?-|5hHUJVI~2+L>}2PK*;LnQVM5A(
zoutRj^heFUkCWuBfmMYlwyO{&Sx|Y+Zh~B2+9(>&8QI>S6RuGY=%LdZJCc$<HRed_
z&1ZYF$|_np>h+`KW>7E7fr*wTQg2%sz+oC$&)ov4b<Jl1)jwZ;5v2ih->#~g6k2(b
z!LFCBk;BIGr59EjDELpkwDfPqxiPEj3#@k;xY+9KL!S6^9OPcskS?TaG9+|!S^K}n
zMlydU=ED1ho5IbcnV6u?EMs9(#puuNDdQ6T@3^Tl(6N;_RTgXY=WZu}!lW#wyz*6e
zS8)FT7?y5XxE;TIhh<3e?W#J6%%H3X_@%ohgZ%q9?;5nzZj(d~O~tHmdfLmuxTCII
z_}Y>BkstxOq^0;oR`pz&p_LZA6Ov=Ge7FFx|CxTObO_H9U$q6bOXWB!LeHgB3~3S&
z?5Ds%7EPRzweTsDsjF(rsievUo-r!;tC|rIsc;ZqA}rg;!}O*sfSxSgnoIj#yx~%i
zz<a1{*G5`ls}&4|;e>_qiT$(S&3}frjE(%KP#37nh4f89^or@5huwV!k*#x_Mgyjy
zBn9vI0&=FIiC>eP8PMbX<Rn|tD&)-C&%S`1VlP`v&WvH~^T}CY82d`(1pabI>RtVz
zi~QYFq3QVKyzvAYprmBfdA}k_>E4@%Cc`;jOejWIw!_CX3Jp`}jYEW}SvBR*Q0a+R
zIvM(88h(t%^LTJ)_e43-x#Vs^c-n(|siQNqcW62@Oht`-s9JFf*jQK6%_PT{aVtX2
z63sD%THqF@g3V{FkI4s9aCP4I?80;;U(i=RO~w~=lFj<?1zi-TN%(?(7RB~|L049&
z`IkOz^RmyIMk>_x3pz-LIetM0nfSgh?!hQ&U(!W3R;M`ItfF$9XFFsMLmsPebV)ov
zm0lA8ucm5>E>TW@Xf4(-8;O?9XR^}OFZaSe1*rklYmj<+c$Az~jh4>F+B)h5$0)RQ
z$yEhrr~#Yr9z5z=4R1cx{59s%LPU^gCUsoY6tDG2PEeV6E+KPf41@6{X%aU9#wSs}
zAdmVkU;o7}vSsI+<YKcFJhUm<kU76|@KI^3SDzTi#QEZ`J|*AEigO8`dAy?&X-PZB
zM4@XR{>z_JJ4K!&v#7mwbY?n`4L5-fd9^#&W3v);Wjh9toU^vwn3Qb{O6Qr5CoJq|
z-*(bIJ2*K$dY?ei3wpq+_j}9QbgA05Zqqn9%r!DO-EK@mHw@=!e3>d+EWbQSwy>@x
zVk#gmE(E3ip`G;2H{U!FSx0F?6x1iRB-X82G3be=W5&L`^oDa4O?j_%O$6V)1vqr+
zjaDdz;@yk$mr0QnU7<c#IakMza4PaJ?4h=;b3C3&B~#AMjWS6r;OO=wU+C}v=}VyX
z`gAo#_F*e?D`8T<&DHeie3`yXEy|BkfWRSX#rH}6xc4H;<QshqIen^XGarUlNf~Xq
zrlP3>YlfWZI!SY_t{fT^SH94h1ex55%7$QLO5tioAM2qqky>M?6U0%MQwV7LLeez8
z3WTx5!O)@{Er_JkpN$#9Z;wRHEF$@eI@OeXM-{H95(d%-1Y8les1Q!d_&=KlqZo|O
zDzIaUXsG6@2dY`2SfI5)obtb?WVr4u{QwD4D6hjUqFCtVAl6X-g*5G>>je=Anq|^P
z-BlBB_K$hnEvvV~r(u_vgW_hh@OI{GbWKWM&Om5~FC{5`t?wi{%gWGe(tcUB)Fk7b
zrAF8tr!vy)q?<_pshlmjz^Ux(5M#dNZ8<!_;<x5p=J&r{2Og)xkeYobt*-G))Dh-L
zeef0D0knsuf{KL3BtNNw+*WW|_S|KI)>czWv!q(`*iQZ-9jLch*SBJtvTCIeX@5MN
zC|=Zw22^W{XPam{O3}9Xmu8Du7aK9pj$$tq@-Q9})1d>Sl#0tS|B;Z1;+L|nw)FJ*
zwzb~5c-G0`;OW_FE+-T)-G29-{aoH)4$&YvmnfRmO_crv#UO%d?@Y<Wcl(N8QPEm*
zW^n4!ydhgZR#1scJyW7>SIXGSt-V2&syLvUGkz%Uv-zBoSt~*s*MP1{Z=HzZ+2+p!
zT{0Bb#f2dQ7NMuGvFod5cmHTJp4|=7_ii#;sp2-f87IYD%cdV>IG6h&p9$vAQ2FZ-
zng(0`QksjrL)E_akD7|{IIRW;Ll8$`5{O2k<(<fuxve{k?jK{VdCD2g+uLno^l^LK
zZ?m85`R3E4r}pe_5<W-xU+N9?Ii1Z?ci1a&y0*!@6VE#(x)~EWsdMLiPffqqmodVX
zl%f&S<vAJ0aU|j*r=-_%K%D4Bxq6av9S1T!oL{N)2kIO(Tjym;FFToVGHP;Q=s|Ts
zFiP$b%!)478Isj;=7i6@RdoPaK&HQKJDPFohNV~j;(Nbpg=8eQKt2Xit%AKxRxtCo
z54Yn@+JA=Ca%L;;I}wk+Y<nku8MVjtUMdWyTd>bTXnUulrjFj#{IO+DTy2k&lB5=h
zYnaG;kJMAgp;A&Pa`XJCwN^xT{6ZA}OVl5!Th+N}HQFbqjpJ79h`SfPQd;gj_zQ6{
zL&R^m)Ano-x4W}jlNDpX-8ehL@Kis}MjTUJLG^2!JU!MkfRCz2xlUlg$4{K}8<O?=
zMs=EfVR~_!Tt8(Ns`svaCllCwPOD5$DuN?Twt6z#&tHhveM_xN6|F`}6@XfZoYv`%
zjc#Ii2g{@)Gt=)}_9nLESc1tUdJh)c{+7$?Oy@~?Zwen~l_IHpNerHzj2&J75zrmQ
zS{^Ch!jPb06chX?e{#>X3~jR5EIhr&z#wv6!DydZ*{gR_jjiJ1sYaY;R(~obk|U{}
zmn%nX?QUm-Y5U9^61>io;-*Au&m3Lf+S(oT#in(%20<(s<`L>`KTTp5PL-<OK5d*e
zPY%+vTJrcadUax^-`6XW?30vB1if^-MdD8KU7BxFKYP)rXAw4<lrs>H<HmXWuzA)x
zZ|^ma58As22X<EN)T@;s@{Rsu^EoHo4@Sh%$CNX4E%~bZu;0scVjf%syKAV8J0ly&
zL1XXYMY*)8uD(rv$f$3MCZ#g*$8Z1U{N+$-hOnAZaC%4GZ&w!WY?rW|3n4Xpnvlq+
z#5%-6$`^1xHI}oskZC4UV+KvU;_J`SsvxD_Y0oda<@d>wlO$N;;g!u83+a+s)vq)5
zLOe+7P4O%Xp8gZ_$l<{Y?!%-qPIf$P`(!5Upm^xLU>2Z^)pfcFj$gPtn+4q~ZD|Y#
zMWard(`hBa2s71^gjthf|GHijB2+^kfUu{ZUiP8`!-+rhUHJzWB>2kNPt=xJK!Re)
z&}v_18F)Pppk-@f;1KV1c3ZorI>J7&l;sptdwi#qbZlCXbWC&P(|N~v<h0bk?JD=S
zp~5Oe@Oxr1;XEp`{g$xn$v>A}Pi%HQS<J2{OWE~gb#@H}<)6i|C;tqNJ^3Pz{W%j|
z%(QdNck-Fc_x@ol;lGnV$$uyJ@?W@%sHk@l6P>KiZzo^QZzo^CZzumketX}$z5>6^
zk>DPFtA?aa4S6)>u@Z^NlcB!vPNR-NjU;Y`(#vo#7?;??Njh~dE2l0WpI59Glf+U%
z!suhjuXwHG{os;v2`x0**^e&Jvs)K?lpbcUku@sOkCE<QHja)?+WRkekMo%@p-1wh
zzR@P9f8@F{mbxz23^xP>#712-kLa4QElg~d9jHm>Hwe-yNol?~8cqgxw!<TW&x6t&
zv4c9d20ZL9IOf(G8vRE9Bq-U;CAvQd1L(Rb{ZIV0;}NCNVal-il1<KOW1Fdwxu$ex
z<itw+N+~a7Brzilw9Q$#){C_%b)PKsJx~f<Lx&_Dq)44jiU%)nfj-Mv3uA|DXJkHG
z{DgQ-&tP0&?LN{$LxfXSihL<nH+rcIt3VV#A&tMX?lh5#s5_g({b!t@OJES}HLUWp
z>RMHz2AL4m9_*9JQTM=&w)6|g9o?e*7-XS5p<noWZ=IZiCZ35jU#EF|ctT0rhDZUd
zb}m^Xkn@v<#NSI64!#tE%du5-8jFbts3V$rD;O=bKuCfWIfvM;X7x<Yg`8*2mLLp-
ze>@1=AP1}##m(2Uy&`!o=MG`X@PvN_zQ9dCDOaDfX<izQ`eXId{xpoQ)@?Hb5lPGp
z8&$pG1agy5aXg<9G!DfYEkJq3oWtE~qBYekmziU`R>?IQo+(^S*;NSZ7$+c+(R|3C
zl${S2azqgl$3%06uDY=a)-o8RhdrJqW-&RjI=d_#RDOG6T%kV`c({D2Uy;tX-;csU
zFG=R5rXQlfs3g+k+JxqaNKx-Q&3?#TZpxt>FZU=*cEe>7w`ZFeMw^qgh`3`>L9ZS|
zSvz<9-xT~`a$a(!Z-T1R6w8u7lc!rQ{e4Qs@~Y+UH06apTsZjyzt8!g_L2Tt{gp1B
zykOxar@LuIx$+=|h4C*ReoaTqOy{F^)O+&ObDgX3mbXg$JnKOP+J3O^Jb&hRbyiTQ
zzQk~{HYk^*hf=wolf@UrP314zX)YBtzwn28*>f{jS)tTwMmn30XjrDdvh+c>yj%2U
zn~p|SKR!8c?l;P%AEsevJf3OMJS$pR6gK<3D5&ZSX2~;McvagANG{@!gr!qQ{RvPt
z?h{J1UPf-=@>7P^J-7Xa1U<?<6HT5~s`ZDi`d_6?k3M^>e##FY=A4HMAr2W`F12s!
z*>9~agvtly8mr(@+>0)w+1lWjnw?@cy>!CTCS_*>0c{&fl+M^1WJ9Qb=pAZ$rS)Zd
zP|@;4^4kZqV(DvwS`XbT>hb$0->>gL*QL;x;$T2L_QMZ5S`JrzOvVwV7$qziW#=R_
zzxp(547YzI1GKza&HDSYc{c(=7QcN%9{&FC?)N;3(R|=2_BLcb69%!8GZ^5r@Xglf
zxvzrp^XH0Bb*%Ub`-e<EX8gQh)(q5_ODBMbKY#oSIR#Bdoq!cq+TJ@WuC?>SGiU2-
zEw{X%Ph)A-73as*C~ALt+30aiZI<!nE?#Blq?SCjWqG~rRsF2(vi#{ka^^-ZlpxBA
zj%U9zwQ~^qt_U+$f`C$Z2&I`(DK~)EyNP0sb63*!(irvBWlS>feA1$qkm9Pyz**dR
z1(!0TFD-SV-cWe;=%3{E1(hhiDXK(4Kc9PT3P0!nEWJ1jpw3@>5$2?}IHIsM3C(!&
zw5XtEPP*BuF1e<bzoAs#au?oL%fw2q9yAyzL13$5DhF*;T-S1Wq^C+!`ID#g@8z?p
zRI;)fJ&19X%9V;*a}n^9TReHEF?6Q;bc_0w6;}gKb;+ADQ(p#OKPv_+rq_~^pgxfr
z%tc2oHLhxATy`I7WYwH>Y6cWZ9+I~8h(4S})tKnVO3ps`p;9duc2bayV!=_eB*=U(
zi>1keVQZa=Ms@F#WJzcvtYNuLmwvLxaKWMxcX^VpYe7FNFB<o;c+tqVV9(sHkRkJ4
zZKe4^#rAR^E>abWdnoAO-$8liEHKeMd5Zt8umq2bm%#2!t;FNPmB^99ddhiLNP@NW
z$$4BZ%_k7dm45cu!bglD1stk<)I5IGZk_L*U$oj6r_Phleu#`Z_sI>I)?^xur_t<A
zZD{#z1&Y=(6wP#{s97uE3<)iDOKVHl3LL3uOun@CxZjUMb?Wfn6^6K7I7GWIHOlR!
zqqG{^CGgZ>x2^hj*+GlzudQRZdrzL~UkSka1w+sGxMb+L#ukmY7x<L5y-M5maz|CT
zH`{ttgEg4ZEUS*T8f`B5adr_Uaup2vOB-%#(^hND5Lfk34DdW6dnXeh$qYbp77b<^
zXU3%@otU1aM|4+eI_mjOm_*?|G<m+*l&#3!Avh_y>bar`UE*M0y_AKXzxW2Qt&|nk
zW*@mP7qh@zQ*uJ7zte8-0-547S*@Do(HLQa1jU;HIr{^3yoqNu&X0^I{5}q*qDW@d
zdTd212rhdw|19FS148R5&9i%zgaoBc`zZw@CuYBGob8>o8fig)HH5=65HHJUOZGfD
z^}Rj#jDHS}yT5@BdQmh%a^5_9WyApgS4Zv`ev?$a)Oc6D<&G@?WMT^@K|2B#lMK5_
z%s6jMGV9V_AC7yJIb^JNx4=AuI9QOwgq}(OfO-fo5hO1@n9b*+Eb@$EwQ}97RBubH
zV$M>TmuJi8m}5!DIHTeMaJqva8p?N_P>0Q_+1neA?EFzLoC3X|n$1T_XH?5aDDuvo
z@$?c^u)o>EWOreuiMtVIFq=k~m(;15=O0<(fFz1GLZy|7BUH%HCLb#W7i{7nOsB)s
z?o>Ht2qK1e+n$@585#@~Wo&!>!a<&%oxDCdZye+-n`?G-l>LOsS>8ORr(c{kTCIDY
z)=9)Mwr6>%$w)G$a}r}3?RUG)a~Wdu<anX#DK;Q>HIfZvD$&fT%zsW&gg)%qp2Msy
zgq<%*cxF0=64{FcU4TE-8*dQnob4$b=%5J>2Isn>yv~{;4-po@yHS1H4U^!>Y+nhI
zL3JkOnN_<;571fTfKCYv2OCzmWwx7un3|du@g8j}3O=gg&^cPqqav(jw3DA^qUX#C
zTQ!o4y2$Q?g$s|8I5<MBRr^~>*;v6Kle>;g?DG%$Y)U2L1zwYMOkOmUX!*7rqs805
z)qG8axHxOH_s@1)FHzmWIsv&y4QM7B9^x(g(;&Y3j47Gq985z=YJvF`;Z_pz7tLJ1
zhfqNP@i02S-{K4z7FQ^nIUhB44;p7hDc#71TPmlbG$|LR$@#ZnVd)$(66b<XiTWGf
zdF$=>LBte8*%i(~7ba(HVSlV(4G2YW6O7nNi*rk+)sK;q7gF(S^s`|z9uAVCepMGi
zBw{L11t!m%aQY7Cd&u^MC`a|pO)%}1Q7DbEM^>;sM<@rQyWD9up#?YU-TIg$p#m3s
zM@_Zo#EtJ2_?o_1{r*U;NfsVqt;EvjQikB;@xl0Jq?VKH%w`6~9az|f1(Nvlgb4T5
zB~Ac?R{Sdg+t})T(x>rccWHr%!vbWbqNNs1K5ukZ%c~CRY;!hV&VTZlry`jqb__@r
zvRB~rqJAIJemZsSih@p}(qx6f6tHBWjVen-iMFxrliz6SQ2I|!lN-O3I#O#nPEl+?
zTwl*dsTH1!!h1#%7^MLQuTA=tbXEsKK*=$-cmQr_3vgwNal&SVMJx#O{*2S~XAV;4
z3@y+!3(wIa!0i{GpH<Gz;&aoFZgF5XyHda}e{QlT<p8N1L?f2F09ZB+t`Xggbhu7P
z%W6xQS~C+10_5^9Q5cHPPf88e(vsrjzgvGdk4ZkyZ+D7NNIymDP42<_l?SVb-0ms1
z-7nal_Z(&|b+xgGINbMJYWc9=J1!l%ci#&oLG^+?Zjt7h^Z#XtlNVso^!I0Zs^25G
zr5%u3T8l=M@w|9jFIaZGEwk_kC&!IdS6z13z4T4l%b(q2>Hci;77=X`foXPMMBd(b
zRCw2Fo}q}Gf-n+hF%^4V7`$9|_@NEDh41tqlWFvkVhRk5aS`%Su~OYuV;KuVOC>@<
zP>IwBk4tr6#gl%+BOpvMhqR>QM2n-<HaDe92F$Cc?cn9j=bR+KL@1v%PLJNJH9k`c
zN3y`n@Sb!bsBOeCAi$FTNZ808!rG<aw0bKG;&YuWi7jNJ|C6Cu(jV$vX&P?3A$ZDh
zIuQ_Aq@r0YwNYcqmNdA_BUFo`>%V-3?_alz<BL|~V2yiOPkm(ivdE7mT)b@A%}UW`
z|Jkg$%}NZ(mOK|UY@D5)WUYA@#yaDak{le`$Wj8t$V3<z!(V~~Cp%5I8%`Ljqj!3~
zP(5&<d``-x)05*DrLreD?u<)6+xX~Y_n=Ab>#MZ~uO^=&10dkaT)?WWpmLt`Dv?w{
zch;t;g9L`mRbCYjhoD8d!C}E8RX3gMWsw3eL6|7A?7V6o9hsvpLS3>plSvp%V;GjR
z8aLrs)W_X`_>AHif#MYLor9d8#W<-9_4Y1W?~|n|iU!O{f&k?gwau&Gm|>e{2vO`_
zeYP-tNRkj>QLrujte#;c`$LgXG{zN*7B7m4;)#~l*B9#miy;lmvyj+7f8;*N2^3k9
zuM%=(oeSE}`D0;a9VNdTCA;mJJMB`8(%^nUhe~>Kgcgi8Njf`Dp<`#R6MdBQ${tw{
zB7I#N3uW$tJDqb3;s2Yr0)eE7HH(dXGVfri1YfBmmnL(Gvt-lX5J7(rof8eD)cW5|
z`2B#=H=3w7(jF_W>)2V9)Ba_-X}&4CX_EUW(wj*SFu#{{2uI*tkv&w8((qAE9I0dc
z)Uaf$=+u>FJ<7-c$t!8(B3+#+324)4DA)SIb-13}nu>R7Cx*#&*|)bS=VwY%NQsuM
z2Q5)uobb1t`G)!u;ZSae^nL~%?C{Jr!0VYVWwuc8ukArN()$*5#)nY()g&lGInQES
zP5n9?#ZUAayU(IYx$=x*ywzuj%Gi3As$Nm{o{2uhsh{+dHT|jTz<*|Gq~*H)%XYh1
zd1M&XjB%75sdy6($7)r}HcSnBe6HI2UVG-G$K({e0uO*X8{B^;%tuIO$W?Yq<x<(H
zl%4O)h)jyy;^>{ItV7}KtTy^#;_llSk?Mp)_S8n6hHRkhhFSJTJ2Ab>Nv7&#Dl|*$
zR4H_r)AsH-+?a>(i}!0b>43Jcan{`KAPh$H2@5F~Bi@nHbJ>Znqlvvc6O@VGQ<QwI
z%u%oeR1Xbj$s@OI2CaLrfq)on#U5+{ToA2%yH!lQS6wNEfa|?GGRN$WdS~-d^I&b^
zZJn!7RmPj#Upcl${;JyVO>I9LQiZl#zgn=W%#1SL$IO%UUyA@)$g>p{pl=o9QOrai
znOyd{7^c1}oyeFo(ek;@N{3o7gwK`S%)!VMeACqmi2D()-gKqup6$(mWyqPMd!gI6
zAY7f#I^SLN+iL>bsOwGld^jBs#qA|KvtT(ijij?8_~Q}_iOyFi<J<%$q9nEIilsb4
z)u{8KL_w+1!hsf?3Hsj6LqE#`UQ8H70z(?5^AKAJojHA^5IA3B5UW9pKz{Nl78DRC
zZh0ptgWlL^Z$PB6*v3bi4GBd(@}yN0mpyk>`6w8qstZOYbr_j8NOBM{B$^fVHwf6(
z(AN^8+IyT5AjNzZEop`;gH*+c*00YhGRw_D8O1I$9@po`HJa@y^yF<?Dsykk0yelo
zI@z13qs<wTyFFQ$-EGn6U=Yw0lscKs(e6N8Ik8Og^I_4u!c}Oi7G4)TjOd;S8-3Wy
zc8-DNQ8wx2)9Wj-Hpa=GSB-PbSby`4VM6z>X{j79j8>K4Y6PK5`ekvhGxjCX`k5kx
z&dIs#=?9sH6V%O(P9~0QwsQ1{!$TJ76NV?66;O=}p!T>1s*)6nk7O=vc5MLz<km8%
z^XXlZ9HXTqHp&|nM+;rg8T#J8D+~Kt0YI}Ten|{tNHCw41=I+QR+9N9ri89U?S~l?
zSi0TwMRnsAq%C@w6-H8je@)PkT25Vs&LC&<g_G&$^UL8aB(lk?(I2OYn}V}NG4Nn{
z^I}AP$U^AX(;|^9OXUTiv4skU{q77Z;2uPP{44_oq(K2VS*gft`dKXdpzQK^&?_ps
ze9ziTjUC+Lo0R!t8S`4w5u~e49obgMoXze^%Bn6dgO@6QS=gem;%drCUoKdj;=VM|
zQ_5*k5R)b|6$qVA7QcEi@y;lHhLofp_4Zi?*R`p&mbPd(i~3xEXIm!f8b{~JUaN8T
zwsBV0h_+(6L*`w+XO>e`R7(*?Kl^!XcwtSV0%owzR}|Zup!gRW_0?-cHI@Q0nWzz_
zdfB!Ts3&ZrCz;Yr&M7fGnv}$BzDe?THD}**Dysf`V5%;O*^@IM5f~aWZKBl$oQ*By
zEGb3}(3rl0yu!JpUjGU!XvW4#ABnrKyIySaq{POl+`f5}rnTmr^(df1Fcg5Lu`HZf
zEun6b(U~KFmH4AgRvK?;nLSN?7pOy=J82dSCk$Ngu!j~!q!?49JF=2W)7np_<4({?
zWeihK>7>zwl?=mSoJ6Xp^4XZ&eegT!$>q`~lV2zp(O0MmBeMr7m53MKPSkrjhJYsz
z2XW67^`R&YllO~e7w~G6O^ExWy{cwOrD0aF>F%DL?Y_@=8P)mbItSEttN1%5cNg~u
zANzubDqr$Yb>)XB=n+mYdz9<|lWkJcIcl<DDDM)VeWVVRVihyke}`en;6%08;&4Ea
zMLV_y$s;m@r5C0W=Ua8FQ}11794_cHOB6B`YdgER8g+_6ZGg0`>$-}iv2K4qjlM_b
zHO{E68G>Cut}`76y>6fr%N19M8&Ac4v0+S*oMbQU?xCF>sc-2O<9?>Ll+6t3v?L`P
z5*zzf5N86FkXz)5wAIukL$>*y#R2md?BZz)bTVw%#S?3|Z3{25gv)!8f-Yuvpynvr
z@j%wN-{#?*rQRvL7UhJ2(Bqt76$Tyvy>pq}Xl;32@6RgFM)PR$3njvBp3)I%A2p7D
zwJhqB;BKJSG}GdTid*%5)h@7fa#E?qloWqXnx)DXFEzLutM|eHuD>cSO2rBc1}@zn
zBw$$vk<Kg&`aafFWUiE`W#3rE8TSi|AV|@Z^pVjMPON49<XdZD#kQ{5G}8U?eMN@)
z=4m0S+3<`7)xNEd?J7vQmC0Esxnj;JoE`Sg$F12Ext$YNJ8~RTRud@)qFxJI_TfSM
z{G{DF*?-lhG99|QU&aiaEm)Bss~OpnxgsGz>d(SiCR;5@ov|qCv7HWiQU9q1R>uok
zqE*H_#|6`L{l1sB3&<?6sk<TvP}5rewCmM>8<)TBmFeF~MK71w@JBkdcDXO|%kYDE
z7Nzae4{Gjh37ZA0RZdUbDh16YV9X<*VJAo)LUeZC8zw5?5^WF4McMiztLhaFsK^Fj
z3bZcFwp)xtSq4p5T)62TK#5!wc8cBN)VgK8QFan$mPxIfKZ*CFP6~>%u=47p9sA_?
z6bDt3q*Wx>gga8XZFTU1=^X@$M2<)z3wz-}iSCL!GL8vnMH~#2r@o*<YbKcLK)vLo
zpSoV+HF`58-;}>K*QAei;csW77wwo&8&uX>eH8BKO5vpKt1r}D(hB-Xx$vY<JbZH%
z4Z^jxUMTI4l>$aJ#Vr}{AGyUZ(zxVhZ-asAEaU6VBP*V(n{z>!)DM-687cqt=F+Ea
z-n_74dQm}QUe&l@S+ioO;?SWjq9qc|y4oER#%B;~B2ltGpR&qKW<z4G>P71;OUnK;
z0xL0HBS0p*avG9dyjLLZf*F`{U`W%e)WNHfR01XGAEi`{$_chkmE%Nv<;d>oofSGG
zKGQ&F=p~RzF|AX88&eA&0IT4E6=AF1b~z1tTx&IBEk*KT=W?vx6!pRYN-YyV8K#B3
z%9cSjhs>5R7Y8gZ73b_)M&IPp{93|Y5pPP&tY5m<i=SR)uYVSA$$1X{R3{wvw!V=0
zwye4xxgGrfWAEMH+BlMh;qz<!S4`M<Z3zShoaCJ23wbcc4sS5{0N&iz4`+}@Ft*TW
zHIgyj`1{+xx^;JTPtQogb~f2JdUj(p>gh{$b#>j#d5corR?d?`wp;DIdW#hsj4AK4
zagnqnYN#W2TC0gq*{{{8w?^aaZC*?{{dQZ`+NS!*+?NtmIx5%torz74zyc61z!p<n
zHbRg|AnccM3WXi2J~C6*@nX6bzQjY9b9;j?aCf8sa=UsVKdR=spU?d>D2S!qk)yd(
zF!I1D)kx)((cW=9uSy_qcij3i_x)rlmF?HUj07}jQi&0FI1tmxFcSp&7s*5r^LlWd
zBW*Q$yR^ok+^s+G#`b)@eMp6V+jTHhQ07y&Q6ntL&+Fz^ROgZjeBLGO?oeiHJ_APF
zmlNx$iKSGuf0FCm9OKoNU&y$o4BG6oQCq>y`;qc3@uE7kUGk->2Qc!Eq}!*8LaH=@
zP2<4l9+pK}zs+O8`HoHCvm9m;SK24`u^f#Hm<u49D)Fb4nT>M1C!fhS@s`<*LbNmr
zzwS84YP|zjIDuSfh_;#esw%R{AivBf-ZlSx`$xE94ltnMbm#E-^X-Et$7{Cux9P)#
z>!Y(4^iohCm)T_j?8IwMyw09nsntm1^sb8W8-Ska#X_bvv<mWcczu;#>*Pm352wQ(
z4hZchk^{sEkk<Rt-V9a`Zt~K2I&iO0ct+t1DT!FNAC5|Pxr3-eBPrW!x2{ruY|FX+
zG=dgQ0Jayn2fH9OMp6rTDQ)<i5qE0s(g{}{P?NsOByVrYbF=6wMH-m*V-BuENDByV
zj91fg3P=<yNMQGlj@KGU<s!zD?d!^Aa_C~Y5!hRa8#7VzFx6<zeVrM?q%u0Yt~j0H
z!Ncc7gRaZ8cbQ{F3+l&ocMM29NXKl0FvEvs6R1E%(Vt{PKPp*jVpwD-DhNac7o4-K
zGjB+4Avs#a(wJ^s2b91D={rX@FPaOW70o2na<wOZt<5Ub_6+^1pD@ELnH4H=&Wge&
znAO!}o2{zoyoNCxvi42E?jPi;cajeyC(Xth+3dwnmp<Az2h5_GSg&QnkeReZcW_Os
z<gT=;<&`_sGpEhc$H3wv(;(QA`W~Dk4VO9DkUs2&s!K@ja)L1R<zG&)^Sbd?O}$aS
z!&n<-mP3+H=&p_vsrKj;c8D5VDPRT?%1Du-Ce=)bLHL`huIg7i+0tlI!L@~XVf@s_
z3&;3j|Ai<|jNr38u_gHdUp!AqW^YrBIAnAHlZ$bdC2%YDDD{Co0{)&vi`3e{Cj_U)
zj%uJ=O$T|rgS(qC&5splY%xW*G{cN|F$3jCty4?FZSPQcf^gkTStp~W+FZ8jkqV}_
zF*Xg2UD+o47DmPIJ;OTS$-`oVgnp~S0<*Up6{V9h<KzaDEZh2v<KpafvRrVeRysa^
z`^!BsX7Mk4F3fMn&}H?+7{_AGUC8$KfXAX5e5EQ#!>;@;uWkY8i&ohsIGn}cZMJ$L
z&R*q`m&TX(h(>_kuCo%zNRhYTD|OH|RuvBHI7@r|OO@Ezs?=qaQ#%S4NmldLWg%m;
zG|KhQJWXpo_~?1&qv{0XCNh)QJNj$W9NCb@-mZ3`3r-U`pXx-<v&lYS7XBaOAP&!7
z0~>>5aEucC;i_wfzJ#&~59wAg-?ox(zW(~&*S;7$=T?XXYmr^BzUv^5jQ!<Rpl!|T
z>2z{&iZ8@~UTwv&$AB&id%g?(ys6|qeIJ|lrlWA1@Z+7<jRn^?O3QMg_2CP%*N3fs
zgY_xnaE~LQcTrWxX316;7P@Bw1;*!7(y`z9E3$G$j088tMdL>T7TZY?&QN=Peeiu-
zBL2!|syM$Ax&#5Sc%$5-p1^vYDqK}NbVXw)tVFV99s8oU_bx^Uw`$4{9K(68m)1MW
z%8-1j?t2rigDofXXaFqz)&N}#S+o0{2(UjyZ_a14Z_Z~ox;b@KyHPp;W*EaTc{bca
zxf~8CM$^FQ2}Vf5w(bM!n<AMxS)M1|i!8iTOY%sd-&!(ICvvBDHoQ}6#(F#*yx9?_
zhHmUVg{JX$8gAHclO?zaDTDH`&^^gY0(P}-HPOqrlgzcC*tI?PiXxZsr(Y7>(~GVJ
zulB_k0k`$H@k<;Q^GTLMclmsasc-=C^%y3AXkFar<>vGDFX?&b9bE0R_M!0x|F-eh
zkK7jjj$U|qe6!zld31r-E{}elYk6fhG2{?LWul0k#L&!+d5OupCb{<hl)R6}s49e6
zx5!wAU#wd<g=Mt7XQVBx%WQmbc(8ll*g1d-46~&Nv)`gb*zo7kiF=pwE^<i096cQG
z?(goLuzt?<QBsO(PIEV3F9%P!kHe?16mKo4wdJ0Q{^_t-WMwwNaj-hh!-u8g=jh4H
z8SOga9B!wQ(0Go1UcPvO|L_&>`e9?AIH5{Ey{w;32NTtZvjHsmBD`N<8QBzmg4The
zTVQ&S5f*(NPEu=@rTg8Snt0fz<tN-ZYW7WCW+fSM#@Xd)a&4GGW+pDrloT#?@Eo@Q
zzcz3g9;+7IJb3pl1?;Ea1l1?l%9MwtvGFW7b?ff2c!Q`zn@t|Q&`|o4skvZG$C4&;
zk>1HMdNzPKK=fNxV^z_>`9`AsH?J6bP%QD3LX<A>+w`@wRFcZQ)6~IXV+Y0T4va@~
zyaN;A*0cn+K-8>&>-9CgZgs~sJs7i2*h$PH8t+24nFAJ$5EXmKOt41nEB5w`_ieKt
z=R>5#=jb!tIEYII9`DekRc-9VODY@h$B=Z`ig~&+nMxZw;}oj%bcbm~XLN=MLz}nb
z@Mve(Zc1Hm<l=W~wxJnq!z6HZ=u3f%r*HDXz`@V4f~+y2wkB8yo{cetQhHeLtZud+
zaGfj4okEtbrOuKO{^O*FyA<Co(edbK^U*IlV`8>gHD-%B2y@)tvG~x&+&%Y@);=B`
zYVLzNTe|bBILzj}NyD++u4Qy-T3&SxZC7&ZU^b@_aDX4HXsTJo!Dc|tDYa^RjJ{1;
zL0<Amt2W$>>x=C!PO^Bz^CSUb#zdo&2$EhdK7&s%yfd-QjdJGFpNVAUDjAot_c=sv
zGsjg*39ZY?s_E5YQxkJBbE3t~Ct55z(V8jLnBnK392KK`d?%^!fHRXHv$IOz>ocob
z+Du5I&3jdB;B$b|Q?gcU?bXBUo7ml{jjXp}l2pmfl=qlJ>(Gjn+<O$n!?^-(wTj~f
zK7I|jk67KJI9*!+WfoeSG?>N}qXx0!CCzG9BFQi~7s~84;5d=kp~av#oL-t@Mzcr6
z0F2}Oy{b}N#;?73M&(RW)@5bk;jPE}jb^~9nC65sH@?w0mhliL#5qR{E2`XR>`^+#
zEV+YKbhnuYz&Nsb>6Bh-9@k*|u$bh1iEKP&7CKCLQ-=uZ%~gIgO#ITI5{V4!zv~}e
z{Cud+p7lhhraH-D3*eVm&C3g~p=R*e%TS9kw5V*n<D!)(YgQ%hh{QK7!Yb6dAl?Xn
z^(?qT#_Y?>gIl$f(qh#%!Xl}~8?sGh<MGX|Dp?R3ycS$Zyj;w;HP2y=-+t5#=d>C{
zi^be%T&^c#%3d!tw0Y?x#zm20l?z!fG&H^^1+Z_%x^O`Fs;xym=jigDt6@Dax8hR$
zG!Y4_;+sh)NGc;2!Bv~YWKrHL$eMH`K)$7-lY=bn&0{sBQK_w*Ao+6hW247kh=1c(
z8u&N0i7{*4<=LRajja>LA-lt;=u(9hyR~m7I!<7=2aeavdl?nAGl9`bT5`@1ZG5R(
zTcR<9%GmNT@y_^&ydLE)dt_pr=Jw~1UR@CLZyzmfU%I<2Nil6|j_J_VotINw#v;us
zmo}BWkDq<o)O<M2su)*e80(C6=1K;&LpHN5(NOCE5x2+V^txg=wt=LKkywgv%2~hB
ziq&&LE*#4wDI8dmTB|0$msq1dthXn*s3e$8u#RJ#O(-bG15w@^><f32kho?GRiYN1
z>ilr*+^Q6I*GjwWtVCA2TVngJLmA`FWpL+dHtAmc4gIuQAv8MJq4sFw)Mj~%Hp^5y
zO9ueeY4^f_PqI3vlSEq@X$EYTMF{E5m&Z6!*ucN^vOY{n#eE$A&k?2*TCe%(;P8K5
z9v;1Xp0qX|K3s3tw%UGq@*TC=XnRq%d*%O-yme&imp2D`b9sX0X^BnAk8weIgRk@3
z<ibehvMuS9A8d>|#z*B84z)osQK-F6F0adM(D$kjjI(k&n0Vnb3^q3=UK-<4aDe36
zYBcu>&*yu}q3;6aSM-qe6t6Bi{PR=3sDka-#WRVjGDf=?;&YNCdnRO`9wz96()JTB
zx6N++8g7R{)d$sncz5n@u52{DjyN2?OgQN95x~TMKkyD0by+PpR_hE&8GXqOvWt?-
zCS3^1d)T;0Vj4Si(p&<TDsWQQE<E__FRx&3|Gc%d^SvC{hXOaG6I)B2TTA$s&Kqy@
z^k@%QKVL3^kLoU`T}}WXsut-^a#&#A7143HsK->Y6kVpTiKSPK(X$Djy{GUo)0eFi
zj}LUT1}ZTww~~kC{AyQnj49xg^FeWjp^)(v(3{!B@AH}K)AR*czfe!m#VQM#tJ_bW
z9IZb7X%(|p#X&BS%oKY(BB+p;ykqFp<>*s)8q3(o;+;QFhg_nk3jZOda>NcXS~e};
zNFKW+Js)QoCqcnbNz&Xopc(}pj=cZ!_&Wxg`JFOQI2aLTT*2mMR87za8T=1u%p0WW
z-NCeHDiaFQg(FJMSbU6;U8_6WJKr?}lx(qGPI0P3M`=|$s4k^s<+cKJ$%7o59YorN
zJBT}(Jj_RcX}Ce~k4%+i0QgRhDDk5tFn4kHXV<XX_i3jwJ{c)KO)NZfcS_UWsK9#!
z@BvG!(;Rt%aUdLD6jv&%EmeBM3|xXwVFCcv-?7&PMu3+bAI_n;_Lb6{;C!q$=lS8m
z-pL_Mie}@(i)n+KBE>hW!jzno-bZykRZ7j3U}i9a8xGH1^2k5!J&ByDy(eKxUzg(m
zn@dRdDmx7v>mx5Vaw%_D>O?^F>e23VIC*tQNDcwA7}{F5r8cY?VJls|*x%dPK5p1d
zw-Z*DFbOXMlIm^9(XJ3la%NTY!`xbCC$S@ebJwdtbt$D(co^w~`Zbs1d{d63N1A8y
zG<Ds*i!g|g`v^(4tLtWC%6w=959)pI`OE$7ligLMp)Zeilh)4B_VIVC+fVV_laJ`$
z;lZ!^p>@vu^}F5u7i~LwemNa*EQq@x#%Xzh;~<aabh%Zz?K`-gQKZ6Kx;f^na_!4%
z{F`6LX2_8arB1_J00+1!addFsz@rkRs_G2mN`Ou%zuai@v*vCniCV!dSu3*2dkw3U
zu<80jSiW@FF$>uYv*tevbL)n1oGGEt3p!)OizNSVe9ushrDz>=1Nb;G`kn58g}Sdo
zui1ebOjah&1vkQ3H0#i~hEV?7gEJ6A=cWqR=>LlXj~0MxX#`yQUj9(6vVA=5_p`A_
zs4#OVv#h5_FAq-lo}3=<{k*&26!TI_Pq4Y{?3(K-)ndTSc}cek%j(Z$TS6$y`!x-;
zAVKL_0^uT%DqPx^GcSD><#A_b)sQZo4PRFbr(`{p!-&}4vuoWCu@acBgOdwg+uSRh
zd<oMI_3}OyGn^>J$7O2s&*<J<Q^UUarOZe)ssW4#X0G@`LZ?m<Ivv6vh|E1xjc`m=
z@rtXgr~87Ys5fAt$q86uUno$*nye+eC>cAZARY2c2npR8)>b2@z7f1@vU*3CV5>PT
zEib7Fa!QcQiE%PHlkUb$!9x?ZY6^bgwC4UwR2^4I<%gUj>tw6*vbc2N%Yif*P6lX_
zu$iP>WKYqnor^G<CN6ivIQvIfMaS0q)TS3_XTT3@NMzF<DfOuB+@)j24+>#<NdlXT
z2caK)0{zVl0xfa*E+$`yvZBZLUUhD}if|^qZg}TM1N^I<eFdFa2z9C?e(}$jvBJ~g
zO)*}ex@JWm?)B_$DJH|ZR-PuidlSy@Uw)hHm99py(R<L-a!OFj-(rd@+{<sdgbMzt
zF_DPfeRax^VC4gpT6>(0aB!7gm!@V0lA)#brAj(MTaRgtUWU7EOeLijsdXOv)Onxz
zTVk<w!w1yg4DnJ|K@0QVqJ_fG!-z+;ZFCucMbpfuUaZ2QEU{eKKqsK*TB1E?+o_VN
zNCHNNQfzsYPQ7|Pe{HVkW&b9|k3HUIBXI5e^bnH;wG5qTyA!g|;Rxrj(95@L?81Jb
zq9cc5DW~IEwbfBT_?+acXTb9?CTg~TbxR~tcLWX{rpA61W&9ZKNg4X?MNHc$tO`<n
zYw{*^@dCSVzhQ>f*}kXNF7Ise%Q0KJj$LlKr0O+rL;T^NTtXK4z8If}VThA@wl2`D
zG|1RZ%z9*v?$)!#yUNGcFL<0*NC&Nz;@R%O?h!_7?*0vfUKU&|&}hTeQs^FVwQNDG
zTmD>1?$0RYGzmB%kOJ($SF5%!y&DJ9!GKPIO&g(L>Azy8z;!|9EC@2r^{rKN_BQ8o
zER2SB>afn(>k8W{fts|^g>c7kjP=M8w^IC}W#F3xEa`1H?vW0Sb3QGta$sKa)Y@r;
zI|h!!#2fy7{P*EfxU1o`K6n#!In|K8r??2jy;<lV%<bUt+2P?6c1<CFgM31kKT#(k
ze=p&T3r>+snd}$mUVX>icUgBzNu4QqgYX+5rCBTj`8ATrCWxHYSVgu51KXD85##po
z*GG|f#OU>>lLgU=<~%4STu&?t_2(t9N?6N(<P<b1aBY%t9+xXMme%aNsA`5~@dl0U
zY~#;Oq&umk90+2y6{bF;MD{fZQ8F8wbIAl3c&HeZLRomAuZ-wthhZ<>=0UtscwWgv
z3S5mJb3^=+C3eCAMv{_0CmX1~FqMWw|Mu!}_QWr=PX(!uknzX5haC~ek|zhp+-gdu
z8dUU5(l;P*4AQQryHUCa(j5^j$j~BXtD<THQ)cRjC(@!4QckL7boQ%E)pG2ONtw10
z`7nzKu&&#Jh=&LJKM{eY2fIf{v!QSH*p=f#_?v;81$42Ucwu}JN)laZh_&Q|>VZiK
zbkFflXMVRM%qo{&;YO{PRt0Ie1BBpmoPwhF^Koegg4Uk~b&oqVTQfmwQns{kJSRVQ
zv-;MCMs~(j*jT6oRUVE87wP3hE*9QZHP_j^7*1Ofvs98nE_iL!fMCXay&QaVi&|(d
zZ<4jx)c$*B8@)ZPwFTDW&T4==`n01@+!Ns8CK0dEdRgb@`#A5ub>EoluWsj@zu6*t
zXZORpYyMvM)ARqV_iBYLz0C^=shqr9bslYI&Lx*c|8mlD8H}nlcWLGD`{b{A#I;qf
zd^B@7=P+@+V-Jd@YHw1+nEd^+9&!5}S=LOt+AEXH=HQq)?^Wwr9G$%#)+eP3qPJ_@
zKdWkQH>*~L4%L$+1CjdtBBAsJ{>YxUV--OD8kFyn+yjBrOL(C-P9NP*L!6j*&A}Q0
ze!<8UI3%AC5C945<w+iQ*1yx)&B6(N@V@!eXDKs&iSp^lZhU`MRDPP;JZvO3PS~E@
zRK%KfaW_w(uKP`Iae-|;$mHy2Y>h01wxek=n@Xiv8SSg4(Vo?hHiLtvfVaksw0Hf~
z?&3a1oN+lFaWVia>dfs4fEgjk$F#xvuiRBDSD?SQO*~m`AtgO1^S&4zllDOT>gsqe
zs$3ovJITqv-ZSHRF=E}~a#Uc!`l8SBmy#FG$HjD1O1+uPv(Q_OjVDWBzb80}ZZWz(
zeUoJ)GRatvz$fy%67gNbHQ28w(C2vCMaRj|P|IOx!V#SgiZ11j4_T!LQMhmU?j;25
zpd;*_VcWW`Ce=wo`y+mk##3@kWIHw=z&{Vo34kvvD=`{A2P<SgbLqYF3NNTvPBBF`
z7y}U}KOYw4L@-<><0&fNSjbfysDZuR>$N;6b*%ag|EeYCF{75Po^C$N@c)gqw)RBz
zf82y0u>rX>D~E2sRU$22D^XZho2{*_`48{GdtAGyb`t(OjaIZE=tn@-hHf@B_IOcD
zE{w_i6ofMI<Jw3dGl*+UkwD43p+NXqBpgV;7k9(52m;3#Q>$5hZOz*;04h(tWF^_)
z>}x9<?7^H3`XRn9U{<M1-GiT4`kuPtIDY0H{1{UKwyUzA^}xdR9mzvy-w*n(T#mX+
zG-J6yS%)+_Sgz~^L`I=nsc{WIWfb8m?vv(YFs}4bu57|N8m1<CGeo?yf_ZxN4STMe
zHSIfo>i52!XY=txrkHvR(6b3V7eh2C>+k?SQC!fSTYS(zeyHqz7=2gv@(Mp)*Vb#A
z+tRw`F8#84E4Ot&QQ|c>?=Eimt0+`V#|=zb#r6Lont-;<KS0{epPE^NJN>mfOD-jM
zekmiKnoN^c4ug?o3{n(3*btlWnpuR`nnieBWfAID{@Th77;GRZ*2vU{d7>+BFwK+x
z^-&aeVk@DLh*JuQI5lw+RdkG7_nz{giEI{3^gfHk)?F|zO)im(DJ?Xig(hbiMdwVr
zz&w`yDSCO)+ObSz>698Z-BlAv%z<iAfV<4xzYWA~5Xx^4a#^ax>XioE$`Bk^Y|IPR
zY8<QiEJ)PD%uUhraiiDOZb#QxKXn_k|B^GKC;iI4)Z2RS6Y3sm)CgUkt=Ro%rS0+b
zOnkYIuZNTLolMrec1w?c%L%AWb!nD<7)wnviDWgUe>f!TjyV`fb4?nlO0(P!=zZJE
zSU}fs$vb<B%>F4=A8eUN#AqhHBKc?XcN&Tc^JM+fl=S)aS9J2$Up1!6^N!bD+jfQ@
zRB+Om(&mBsjeRk=Yb5U^l30}%UGPS$rQXuLksIw$7@~e5xam#D8&D5`j026KJG6|Y
zde-*(FwS#c3)A2O{QE(Y3#_;Oia-=@`-{Bss!|LH=Ra5Idmx#6SSE$cEQXhawSbXz
zmMBRdfJODxu0KlFJKnxq=WtW~!a(1P$Nx47kP#R^r;$**?akjCCWc*0(8M$Qcr%T@
zA!Qeq>dv>{#YP1f)rBJ-JM^)&5pEf@ik-40zIbd_?z(2Y-R10dqv^~x=+jzyDZ3Xx
z&NhI{zjWg1M9eP{IXt(~D5rTZ5*RS&*^eLJ5gheNpIdrVa_KMj2B!}EA8nx+VX5!`
zbuevehQ8_d|JrM6GM)~Hm{?l;mu9q<R;T}%X4C8xXwCWL0w&S?j<E2j9;ald?yui!
z1u7y%yi_c?-`D&UEX{9)Va)q9e^rc6udZ&ukmd8WJrPm5CZ-lY3ng;VvshGnBa}}P
zCsHQFK!ebfkXpUhbLC&m$FhNSp%3o$GV=O-=Ymj*0r=P6eY_hV{k80H&-j-(*}$KG
z!JUYila(2d0PC!834M#;Ab#x0Us=&=P#&<_ytx<)_u#y8tMA8@VY6DPBtwgf@{#P`
zVuU75gh~CicR4Z<30AOxOQED}9~?V!bhy83Vg}ce6L=z7IdV$h<;by34`VV2NaUU?
zN$*mNk)nF7!e$&5gRGX#m@8qFx9W)C5!czcMRfivXc*IIR!)3lUb`Cl@cENGHDu;>
zF1IrhI0c0xRdxq9jQvtE&#kSkRr$xJ0?acEDWt;bAcY&A>x_f={4DJOM@P?4SM)el
zwMs`tnG+v~f(vJ!;|$^e25aPEy2(pWT**iKpHzHL=oj?x8y8)27NjAQRjL0uO7pR+
z%x(2d_nP%g#KOR_LctDN8zvkJEw7^5%e0fhT%Ar4-dzh9k~tXoEK)J(o#Iqp6NF!u
zobCyQVZh*&qDlwFIcje(!5?}^tyNr~H5<osX(%v&)@Qq@t*R&NU5<|m-|Yd%_)zz>
z71|Z5<w{ppUcaiU{p01Ai_YzVUw0Wm6?N6ck44Pa4=TS!3opB)Xr~*ir2swZ4Z@Fg
z7#|m-^c?uGC-BlXzVm`!X;n;na+JJ$)iouLWwWYT(&yNv@TGsh?FqBMM|Nj%Sch5R
z=YX{T%D*3+{haro1j^CG_H%$b@*c$#UR2=BR|}JOAJzfwH2}AKLN6O$TS?4ho^MjH
znyV<Pk6Sv*f-G)*n;r`%PRY!&A$q*wy;GxB2Ix)684RFPf>gXF$<mPD!}*%{7@KLo
zt|Nagy?o3;-54}=T};O{+4^FtRYIT=z2(Ot0##wl=4;vw+UArj5d5I?Be`w@PUFpa
zQ!pPW%n$%$*z_d^P!AL9qCrU}@H+-fp?}_jOVi)1wr{Rt3pK5f(ea@3Z6Z-*^8J3`
zxPza?4_sX#hB?k${MA2?-Jiz}7PiCU#5jO<;{mLJ(PufAa}^M&Z}=OXPIT{;qStdA
zNZT6EU|C)j<KD-eLk%!nBRc{kS3mnV1PhlspBF3?|N0RBTk#zIc(7o%bzq@^e;crv
z0FpUiVnP}z5%<3XFDeWA6g=oSqwMjbTdRPxLKLZJseUDS2-3L(?!qQV5e`j5(rPY*
zOQfTC<I2vMnyWGd?Z!GLIkeSSr9b(lac9CezD-`QZUD|Mwqqg8B(G~ayhcD!bUJiz
zve}SRg;j3`z*8|?T-$-_BiIV89kc2Ol|iLK!UPtUaq4Hh@NL4gRQ`smx6A3z@cTG$
z1zYCyJCyN^l5F>Sq-7y>=Vdw?kyl57sgQMkd%ZtjlG3tQexF_M0Q&6|mmo|@c&*I7
zW8fXz8;3fuIlbwq<(3>ab%-NPO~2Kq#vQo{sGa!hALcxC{!(hZ9gJ6pD9DgEukn1C
z6)uCHB~MMt*$$-ZU=dM1!uPY@FW6znsnpDmsFf3M4y0zQq@i2ca2=Ib`J{W%k~Ut3
zc|d_=(=Q3x5E+ZHCnhTPuO<9%sT25h(AYQ0pyYpIy{>FT9pcY`KE8S2ujt;*SM(Vd
zHDg_$qw8usDSiTwiTl9~Vb%n#=5f86c;qv}hqv7n^xEJTWmW5Z4cs>t0FF&ymA?&!
zs38C*jNe)f@YK?QkDO(@k^lmHf61=e^UlZn{z9uYOEQ(B#z`M@EWCL6cz^HsJ9ACl
zm!yt1Q68{<{plbnhFp0EM2HM!J1W|hNZ~Is*4fmO94BGDxokjBhZBxY&jxvUA-79P
zR2G}@TNC((omrp9?{@e14^MZ#+de>e<wP*g@*c>iSS$#eKF+!+OcG<5F4DJN&TUy+
zM^cmas5k{Cp9`k1uTNSEW}*Xjk8WAat(LsWhdr;F)_oHcWGWtYT!FQ!?ePUKy3xxC
znYf4-a~u-U`oux}8@=GxNNGz!L>^826s~SfYt{Nd+K#7;0VrsHhah~;y;p+$gxd;Z
z(Sw7hT<tfkJ@8TN<Bp8Pp5_D8Tu^q|GX4s@gtj8&mrCZu%tBRt1yoOXl@z|M>>VjZ
zj#Y+8w1L!>C34l7Y=B-iNJnVda$Z2j-yv3>-NN6!HoK@hL)G)8;8rj<kobq>l{<IW
zL8*3UU$iAGT=q-i9yxI%DHn#~9|zFH41jFr=Yf|K>>kd^nLDu9OAlySm$WAXtPy}f
zhOL!Ys%7&o2rPav8j(`4PtnBKm3ES=RDGo+lLJ6h(-(Y@&Zr8Ydk0+p^JsVH5RTW*
z$?1#TqrJl?9ZFLSKmuZ5>5J;dl!O==jvqxV?))Mh2%FCK8&@I9+o5h(XZH+ifSWd_
zxEMx|#ASh=J%8PI4ep>vz&c8Yu)!xNCJ^=aR)*mZibv#z{@O|5I7qK4sn3w|{+hhL
za$~sLd)Zmcfew}^uUr8w@y3V)!aph?#<rq{%)6WI*+3;M9~JX-7AD6xbYveo+8Gom
z`545vJKNFQ=ljjv#V|h~o8eL{r)U2HWF8i(A9MC34|f8$)?FZc_KNlpT)k(9miyKq
z-*R%#9OD@3kLE!AQ4Q)Zi2JpjGp&<#6B5)cX8GR7qQR(&1}{fFlXdAB-Q5!OfLlv`
z$bd$|(ReGF+Rg2P5gODi@87SI$GwS3s7py-@!XnU0o_!e!r-~A>l1NaDLLgk{6s7b
zJGXGg2ZWx+IOLr&j{mNlm`*YR?o+>s?NL=Rxhm+pMqY9b=kXm2SxG*Hm}9Q3ts3_Q
zl?b~g6S9{`ne+q2fGYV?xIZObQ8hPR(*S$Cx0r}3%&eg!D=rlWtk_@`5SK{ljaW+R
zFik+M$K<1kj<QJtBe%*(jv)i1k}G+aIqU~7R;L>XTYIS!c}f*2EmWdJRy-Zetc)tl
zop+(DGZ!koKT7_;uwo&nT|E7M4?4tctY#B2E{{=86S(eT+!Kk1nHM%E*+ekkiY()b
zDID@a$8&lGlCDj92#1wKvCAwSmfTbhnoY%Wi&8EKP6H`VlXC#-kWb<m1w~h{!A=w}
z8KxbQqKIm-epg&&7&B*u2ub)OcRlBiK%Rk14xoVm{k+bnDU378@Nz!`-iMZ^YCTa+
zIV$lracWDN9yPaQMM^)#S@OgAIC7?P3l|2R4$J(UYb8$-tCwHzBt?+x-^H}f!cWEz
zmOUJ0wNm4^8sqJVTmw{>U$i#mfG69ba->FV^@Z><$h@&Yy-@soR#)?iS~*U;1)K~R
zPbaI^HAnohKz8d<5*7+ATwZ+c*Id)ba?|0Y++lW=hyi6m9PuwJ>MTs#6GfE6o6&9d
zrtiolj{38|*yMtDF~49%1!zb}ux_6a`ZE+dei+bk-LRPJdZ?lNb%*D0QQ}^KMo8d;
zQGm$D7Uom)Bhhsce`fR#@oGQJbD<6>V~Ka!B?2$su!rw460?(nQkYs|4NOIUI_z3!
zV&boLWx=W+JI`vb09-($zvNz#_OTX|;-I$CjSU#l2^>+X$gYZ~n=hkr{uUU|bf%Lu
zY^7<-Fw!h<vP|L%neto<ngr)@Ssp7A`6buHz_=@X%}<;s3^EIp)>yN;DqX@D^tRJP
z>~Ve?yqm5?nuPyNhuOQ4i$JzI1a++j+5;&S?&^n=Dr0C|V&Lk%GZ>g&P;b};>M}O*
z&H-^^`apI+aoL2PuF`8?@?YJe%u8_Ek9MEz9iL)#wVzJ6kB+u~q8b;gTegk^w7KU=
z@b<S~)?dZ@**iGdedaT|>aC5Mw~kMa;271swAnmV$i9-mgHn}5!4P$z?Wm^?0vNqG
zxOTI1bUJucwN+R6OtlF!Y;``LSO2azHPOrlfGlf@i#P+Vlx7-AnH0o-k<hSKlUEYS
zsM~#_y(~JCo+<QEDUL$NS9x-Hg)Q_NRGkdhP6{BwB_8azK);%rB$`m5(h5IIf8{zc
ztR6&T*kCYSQt?pHw<0i(wrg4b%&n_#5mip#)qi0Jmg=arFWH(=@xf{Z15%oTY%qM|
zC0S;Eu!BFARR6YQBB*U3bp_)jtr|(~0lRlAsOEJp9E?%95iO(|X0dYJ__nLQeVLB^
zIS)lRaixSO<NW+Q(`C;HNlh%im3+64zvp!NPm<Qg!-wl_|7M$UQ#LaA9b(iusB+<$
zu7w!l&lX!{-icTaLiJTWeO1<L^aevI@Rxg=%I%30)K1=}gP=~9UzwWr)>Zsg<~+o=
z0)00KYw1D+skBnE$!Tl6?H9er*Yz~LkuVcXXVE+Fi2FWiz8?gc$<mV4u>OgRoGGVu
z!;e>kZzG~#<8#gBw2V^S=AcnkJiJ76n{8#5Q(9lI(LEY1P_K(L-!JH@$cHhg0~%Gf
zsZn-ik;G;OtmtDRMy8t9U$$)jRbo&na5g`>Cl6x__3te=Bfa-PY&0wegUyno7%9kB
zN&!$AoQ?rev@{N%C1Oz>`^{!vZ32j2W3zaAye{jn*BVhod{5xIC6|iEfelG|o{rqC
zJJ#7~siqP_G-O$Wsm<j%ng?GKl}1yEHHV)j9*RkmA}hAa&hZJByTY_u?d03$k+Je?
zrM?(vPUh{jwKSamJ`hig4q~n#*BT48wN%?uHZvMJqxKG^VKTPVqVE;QN#5qE;~&C2
zXr4==A4;2FN^&UbzJ)(JDY1$5Te5VEQd8-P)y~7fK6{r>TL1mu7Fb>-LVNKL3w#GF
z@)2KsCm|Ce%5SWM8T4#bQ7M*$e2im3sWY2^`;IN`M;)QD+7vhuT`XLPQZ!YVc9-?q
zh>hgwsA?Ok=@@X_vZYYD+U|%8!&4}`W+-jVTK+2W@s{5=*=M*@RjzObQ)DZix=M!P
zCT;<#8ZCPz^ptOkeH+eQ{Pf0{9=`>V$Vy4p88rzS6kx!(bKPF0_8}3&JNZ#Tp=Jr5
z-cPHhyq$XJmO-T_<BNT$RvU`QhJo?B*BqetgOXFsp4GOsppH-LQ@|Z@aup8Ls$|S_
z&^Iz(RPknNO-45)wg@#FD?k~h$DQh8Ixe$;_+NPmsV%cbf|X{Vj7f4>Ty;D#2|Dbe
z`IF2WK*IW{WRl$2ES`C}g6#;Fyr3O}hp#YN%11u{iFYXlbtYoB-*^&gQdY)zaku~K
zjN;oro<7+<{^?-H!|CM!Nn&8v&VnH#+K7(;b8YAcjKev(Ednu_666=kgBToGSqK+!
zS4-&R0o?-MWdqCz?rBF=)`We*r+nBQlNc_Fz3Gq=KcngdbLhRzjF#TfewqMnP(BQ2
zx(D60IDNSERd)2ewQwn7q>29ODC?1-sBkMeNz00iz%Cu7S1mgL)8X5uBa`V0r6}`A
zkq_?E36L)Zh<mJpKzTCg$xQgTv2lkx_A<f<9++Pq#MSuB8f=&F?*s*7BM8qkdN1ol
z2DCO9$q|Al(3rMd&53j}p~54)#kPzF6|_?BHDl7plLRJ+T;&H$jdi;EPs9yEwKhgn
zxkFK3b5Trz=O8y4COcBnqUd8E{!F1grL}00Ikn87C$g9@BLK4w>d3Z9MdMj=ErGE%
z+qA5#2Y+{ke0{FL9-6tC2JdF~4~0{vEN)K4b3T?_d;Iq)E1n)GDsg#@Kj|k|IS84)
zNFOce9{hBfzB?t#qKvj4!iExX%UOngt*zoIC~LqG6b0bvAe&~(7<jeGEd+v0@P1|{
zGW~AH4Z6fmUS?}19f~yohwXUjavA-;6kS%0z(_2;no8gPT~)`?#OsGBTJDH!s4kiz
zxLL3gCBb|&ci2mu@o+79Du+(+a)PRtA$e$^^0XvxCrpz;nSx5=v4zT_?K7%%sA$Gn
zHn~EgAc)cWdi}4I&tAK5ZDXk%vM8b71kQL8*m8NZ*BW=*z~d&HY|oTAPxUvDZ`#M5
z=6AN-d8}61a0gXb0sXT*{xazI*|m>O9~RnGIxK$HV;t0O6I~tpSD*L1&L*8C%jvMa
z)$;0PQBF)BC}$T#dBfl)DFv}LN7ms$!$L~1<4ug$8s2rD*^n3Ske#Wc;`5bAC}f;(
zDt@sOD=P1$ho8Gck6W$u>qIB+56*IUjw|9~1*@7)G57n~a7*7h8mAQ1KDE9%{Qd5x
z;fvfx;ksLH%!k3Nzy6x&9|MOBx68qecguSwe^{PeP{a$vwvwiST5vW(Y9QPfcV!c_
zq2ZgHA`hQdnQ6m~VA@<DO&Fkqb|sE6Ns)t*@=Hg%KOF6y*mQrM;8jl8tvJI#&m_og
zfhi@*H`vqF1(3*5QI<JsVOng_2mV~F`gHer?y{&HA6gGN9EfW>-J-)uIW5N76;NPe
z-)UBT(K;c6KwfbqaXAyLKe;|o&$iMSeFvu>2d0aRe1?qpf`+{^Su$`uI7|)?c9$&2
z8F5NL1*DmedCj!JiP>NtAST#H3pGoC03f~Q<QU-;QxwC#7K|d^_hYW5i#?zwKZQN1
z3P*?oR4)9mUmyC?LEx0`CDaNh%cKt00wB2>PsYwH#cwf_hgEKkuSsC2VlBXhhVWI!
z;aomcrKT17xm$gl!HQc#-G>x>7Rc&ksnGMq4-NPzSvojW$wx1<%kJp9B}?fn;a+yW
zs!O^oT|~9!G@R?$w?kmx$`pZy=}yH8;T+ZW^pVnVAurG}?W3RPb;p7&O(x@XSf-4j
zAZ?@D5m}!ZN`%04oXO=SE#G)-jLSk3II341ULCnWP~0VFZ%n*(S!xF7h>l|BxyZ5;
zlxcLYojkGDCK3oGgLKk5o62>Ls$8+6YhRzXB{-(Dg#6fz?HZfH0*ytb7_NE&O`~x!
zDY^v*L0EH_>PjXO#w|J5BUE1%!#fiZO|?0mPdt-M8>%h>;+6HgCxkA}h%^zb;d*41
zala3<DUGMe5M95>t)7#qTJ&DnRAmnG6Q&DflG*{NpQYV5WST-V)Kay5jaBLS%l(tR
zrM6OUXlo0V#+D1noO_yeqXp(OF3d!5&$~Q1Y}#gq*xoS&?+>$XxvA%0Ip6S~V`q_5
z-{0FkI7!g?J~{d6#cuKtz0tN3I_iUKSFVw7YKp`|zXj$7HrM`ZZDX@z&d`N8v>O7E
zQ<70EeQ0PGviQ>>kO}-QM8swB5L=Mx4qq(GX=cq`GFfQ#HXY|Fuv+HL4m!*8oai8{
zUXak74}r{6p&B66RJ(vZ5<52Yu_o1~2U0;3?K6FGoHiC=96G>Qt^r@eSK59$SiEZ4
z#SfF+(q9j;4iWz4XNA3ywR=9Sa~oW-TF*j10(xkxHa?5%z#=aV(Vup(geG5(wQI8b
z*5T`HoW&L&KIhq-|4i=wxV!V2Xf3{l%&8L)Ceu;Xdx-dYGMe~qVZOx~TRfGY=ZoQJ
zRNgtyAtNK!I1oIlbs+d*d+!AQJUV&ccc5KPV@kmX@$rncWo4zwDECp8&c&^q4Z}^w
z*Q>S+bHt_o6WOHV`*O;uEULc3jA|!Hi>*v0;r~X<PqK_KkD_&RNJzY_4Ao%;JxP!E
zMFInUmYr{sORQ{rmN`d9+a1M30i$|Qs2b_)YY@0}5vv+&mQE&ELWNw^Q8pznb(+8r
znZ)KYmq_LUinYIk@w&p>nPOFVnXsRk6^Dh%q|k%PiW6p!sl^?+JJ7^IFBa&2Y^HI<
z=Nn7EzR$)5xl_1qlt5gS5%p2t>mQH@>3m1}E-k;C;=-Mioad1!P8hf;r_TM<7u}j-
zNi4lvcdW(JhE4od_Z;gtY8HqLvX6RNhX=g>R;z%%l!JUS8JGaL^THq5xxzJ_yN6CP
z4O>Yt!t!P%ez_m<t|HU->7W3asD~=xhCxFen|Q5u2SpddLZY5qX1*)lo8hNn4awbP
zV|{(ySKpE9po@*pru|<wzj+lzmC;Y9<JN7OTgS8vQ<vKgzIp}ozw`I?I}cQjH=x3B
zHCEm4n?cwJ!N9L|F5mhk)X+P8qQUMbdyXXx?_A@@5cLI&fWpN-I9%rE-o@cx+;W^f
zE#ijb4+bQz1FN1>`csK72g1YE^D<FQNrYoMI7h3<#U*pIz*m>ID%uEAA7C0JO~DUb
z(h=2E8DSE3ZS4pV=_F6~jwNlt?h`}a>BO>=$c34!3B<rTQ#I^D<@)%VquM!X0!Gqs
z$hWx%ylSzyMVu;-UcIMYl~8zYr@HvcILMqLZ^kaLG(9~DgaYlF6r;6Py)Zrx3nkmL
zS&gCxIIfdM6Z?9cmU)-bKsjr5;3#d==)5@mTgL|&ioLh2q6Nc-m8Y-|!HsnV2NfQz
zsxc^lz=s$Cy#4^$Cf9Ih1B-Pw09G01cMek5nS>GNy(}div6{NXI!jN^t*<Q9{4dD^
zC;@_hPRe2IkoJzKc+v&tGtD`u+RSO2jdOg%axqNm@C-dNxmQm!CS@`uVNSoy=n_u8
zZYQK_#n?Nx4)Vnav%wo#I~=;{;&xc=tsIE$OJoL(+XSbnf^|*07e+Uho*`vZ?9x@H
zCr+=B;vG(-a+Sh#(_HK%d6Qk6^S6o#e31Lcw@%IE*Z8M1*0PN_ca*CU8ZI6>$=>B4
z50BH)g~7c`%+Nm;za5kI%c3USV-jiQvUq7sB(}#5Oh{+M8ZU8~!)#N@RIBGL*J<?g
zl(+?RN3p_nqAQ@%$ZDr30v<KiZ0!pOAtGeIm=0;YyPo%xa(ZGiN~qCluh|nYEm?8+
z58RSgTiaEL7ermFKVHfD;H5J-Iygo?E+<R;QioQ8dEtnJ;xEdd1&c3Pwy(?SK50JX
z(_;L>6hdvWKA&SvQ)3k1uV*u2PM6CRS%<n`+i6o~LwNhF@$ED1PEw}E{}o<46{j@I
zceUX6wv^MdxQq-D{BTzJp&j0t@z+=5Z+rF)+t|bA@KCZfN<5bJS+aT{I#Nk1z<UhT
z4H3TWG11=4vEx(eYRjLz`YBKl;rdtEc_mFACTFI1m9e;XkcW#5V#e4~V`xxX6}v}f
zyj;0)xDv&<NNt)L_SSADOTMNbouA+&!PV9qNFb=`Ov*P&nqHAw(R-bhgHj<)V)R%R
zl$?n+pwx7Q48vNo&HY&#i02KiJ-j~8jBNwm=Z0btRQ`{266G8uj||o-2TgM_5{vli
zM{;YmZ#(ZD_mW?!%5ahv4Z@e(YG*53>)xvCK8AGildkn?&%No0wF@;=BSwAaR8z&N
zkkvH1YTxe>lZtLjOns)sFYB+`%T*6CuJ9M=aVoQxi%5IRA=P$CSZuMgxt;iIU?Ms%
z=y)tq*36j_MTx4BZdSZ#$67Ad=#Xl9Xk>5aiuz<Ie>zV%CNFbDeUh|5nPcG=&>0x*
zk;9$>cSV(~$m%=dk$Cd<{GoelH@tU)G?6+Y3uPb`>Df4u;ED`G4(%(I5LI&Zkc4Qg
z(gnJUfzBjG5#z+n4rhtrl2u+H<)P)H<;{HJ;&7(rG#!W(hLXWm=2E41$!&)HE?jph
z2n*wLBa>GG0OmOnd`iRp*ScyCv<{%2FW2l|bPBS2v$oq4U$-JX&)DI(?79^_ywR=<
zIkdEEWd#*9)cstpoMu9{1AShZZ?<ksE?u!u<LG%_4vbB;%&-?zV`;LY@OlC7$yv+%
z=xbBV+eWFf8ho5GlMlmXieetzn5GIV^FZNi_-1I6F+Kf|<`Yu$%+7YpEH%6OsmrD`
zPpmOFNFnRu;H(3s)mu3~c6`~zLRH+^(KhCl%+rPrGY71y!G9o!;@E*`5Dt+c--XV)
z4l4$8@6ILZ1l%gbiOi;AOgW~g=T`MLw+Upe%fC@2lhis)_C(+}N5K&#&yHrW`b)b+
zSlO4A^jQ>RZMD^2x)R(YV^L6b1}&M`-QV3g**iQqJ=uG{d-(FiC&wq+9%0@V=KA^G
zf%R#w?am{fV&zu49}BWDgRWV4W$Ihe%85RCjjT8Jk{5ioeO83_lsvZk39%Y*TSz*)
z>K)(*w#PK%Ta_6ukOs?^#Y}O=t1!D&Ascmx53R2rzF^h4URlpjA*?A@gBei<wqb()
z_+E9iuq?Vx6L7ru9C7#M(e5cl7N2fE#k3Fxm)f_&m4q?OhK%M5n1GL|d(H$}_j;|R
zat2)N9#Jo=OxIWGGSff;Djy}vbI2i%EYILYW3tUyd&&P`eAYyeow$6~>}{5pCJjvK
zySowsdIGdPIzZ>oDc15T9rrw^wW>)^W?Ii>&vOV?&x@j0h47q5AQJ6XpG?&ty$r@`
zz;Haxzl%G;i=)HmhbOyFd`A<pj`U9LhB=n!1~`52<WzjrP7e+b4|bb6YQ*j+6b=qg
z_I7q-2tE{e6n)r?Vwi>AJ*+ELQ2Nk-{niippg0`PaRg#+#MahKUa&eLoak{4;Ei&<
zZ?E(#gVI`bT0^Tj$QbE4ngp;P{!8v{dq_ZN$Orlmna;>nokAIf1xPD5P9=Z5j~sD{
z?w|ACKEa09T%<R?h<J*o!1JfSip<6yN1Va+)*5ec*;da9-0Z~<nJa!W&dzfZHdBxf
zhad}fldiaARSJA@9($&jrZ3o3?50b#H*9KKPEJTzXxL$tJd5!gil^WLn(!L?`YL~H
zWIEVJC}|4;3;X?yjHZ~B+6bA}I~WZ$xYTyl2RP>0Uq!2qisMyIWMA6!C~6z(C_+*p
z30ELktd5L`q{u;J0t!(UB6sA)#bg!OgoQ707P2%h;G}8O?Zow7(N3a4jLtmm5=E;_
zBpE1MqG;Euu?Mx%m$RwNq;oLa|BH@G)th=PIi{jr${*j|wn%#T6|0~=yY{bg5Nu0h
zFr<YUgcn1*Pb}AJyjMP&;(S7CGwa5$y?&lht&-j0oNi52O|5WsS4pg)uxBTH+*k=4
z%?>x)sV;I08iRpKXps-|5(De=*cJoM7+mpFhR0l{LLNrU1S(m7yk$HinXStuYdF!2
zCG>Kc4^s@PD<}*_EZ=s5Mk9#i7)BdqW0P@nSqYxa@w30Vf_SFx*YJ*{{iP}xPXSs7
zyR%flG5A(r2=RB$v{z<>o>EGcjH!ha0fy1CI4);kod=kPW9($PdAk#~(ZIAu#4==8
zF};nYA5{-nl_ID*i6D*loI}>-u3p%C`Q?iz_z#C<%<89+%l{Cnx|E{B)DS_*ihXQM
z$XUwnE?K{i9IWtS?vPntEO1L<*H=ks=%A^*WLOQRB}$AHjYRN8P$f=XBNSFWpZDx9
zeEx4h1N5uW1fDmc5BfV*wTK=6pyOt<k@r?3r^&os9pw*VBF!Aa+<ZPrqle83rQ9>)
z7K)^k)w4SJ+;$d`(-pY<7o21=XFY-smFVgOWR`~xr?E;NIwEiB(=yI3L9j$_OwNr-
z6Qf<n)6oc%vXcM7+ekQNGNrmhk^Fy#&*8{U#Nq`E-gC1sY==HIp4Q58{0F&l6&C12
zw0D4h;O)?yXBWE2)ww7nG(25K0d$fb46?x~h98xFn$;%QQL~RWY1gG1K7NyrB5Wnw
zPK+zQx&(N+)r@L4<%RTI(574z>_1Akpy5IAvM~a?c!U;jrOY2GE+>VyU-(j0$MMv8
zaHC<(Wvx(}cqVC;F^bMJ$s1}8X_;IS@ipBc$oly^OeUiH@y|OY2B@a~jqri`Ita7!
zMoh!TOACiPMJ%ZnYD-kDHX?Io3^4+^(=tQ3WJvjHm6Tgnt(KnqOO*`MwZy!E@;~wP
zrhYo<gJNQY>|VhsUaYqbXIvi#KG4P3<tlZXmk$#)wLmN0g#9z<(#Lp&c;{DZ+0>1-
z<xTR_-T$-i{)MjUM%=9}Zngkx(SV1M+ko-N{ddlURFvk{W1$hdJW_+S!Ki}*X{%nb
zVIw(W0e7hF#0#Zom0QmJJogJXH;E+%rT07&l6csVvoW&$6m^qND*oB*$xL@euNPHM
zu=cZ_y<vUWN%2D7`*^Ruan@I%K7r07o{QT1)Vyh`Oxv_|^_C}El4P&&bF#w!di-Cd
zX*B~<DUP}Fc~`TbyWXPj15E78_HUcHB!Fg_O*s5=d)V6{p>&(sUz2@G^?+FwXx`Oc
zYwbpeVb9qmW*)PtiZG6sBh$IAB0d+<l!3nXig&D4)r)H4hF&Uj1S;Q;lB%j7k7rE5
z&ly}kZywAyoHmL#4_L7$-+ai>W;tu%z&!X-qx&X=*)Vq6`i~mcTwJ*9<K|IAIjw12
zBXF`aOS~AxeH-uMg;}RVj>J354EdLs!U*wAyBN6)ZO(<1+dE>_sPzQ(*OUXM=OAFi
zok*R}7uhY70Edg!0J}>{#g>FWUz62B6hBqM?<@L0?)*p3_Jf-De68KXdCgUZx<ty7
z#)khj;^%b(li7jgZ5Q+hh?}Inh>eKB+Gob+^nh^Q>>p;7R&efhIMuOmLgR)C3l{Um
ziERmWElU*KXf8IaUQgN=`A&|X17My21BY-_&M?4O>Nml;>SdUgVa<;pb4*m=nOt@1
zy!pq(k-gxgUP+101ydXp%^oR7`&H8*`ziFQ2kAQkqIYoSGEJ&&d471XcXCJt=f2zC
zf9marVNc<WU4jk3k}L-{Xd>WWk4%m(I~z*^wb=23+_-a-fu;1loC3Vr-Z_a*PS4Id
zMp1l~$qq;%m0gO9yhu5<r}()7E}ZP`pCp$>FSDKo^yC7ybr^Yx4D}Vp+zor=LCCUX
z(NldRB6pHO{w7PT6KOf^^|E2Y$J2OIQJlN)NM(HOCi!4e=NPi;wes={IHG~GHg$G9
z`@aS{b>JIh8tk{&c!^vMI!k|{HxW)$7bNQiMwhu!gT$ocX;3BD+j!<UIhV2sQGt_<
zCtfq>_p7ZD?)lOx`M<=xA5P!mCQkLHE@jY~kray=(ZEG3ACJQtx6K(jpm{uN@{Iax
z<Gd3q-c;S;DAVmt@&+Rw9G*Vi-+p!+sLyB8HzOoFRg9bwl(V5#I_3~%pd{0A$<@cZ
z<|XIOi2hvV#Jz-R`;2!@Sw|-^_xEAnql={!7pR0H%&k4IQ^pccbvh|dEkowzjb&rG
zgd3*GaC&*hk=%r{rH*frM38pTd`$(Gwy1*It?JWh>6?p2H(gAXb20mzRlAJtA$C+T
z0xt5dLGhTCE5fqPY3_}h#A0|c&i!#i>(vK$Z&Y5ddR)&?t5kb%xZO}Pt1i`(Lez|7
z@8O`H?49hJ%hg8g+Zz{IE^5mjE$F3Z6zl24#wlRF_I&uZ=nC~<_oiD?Fb3r$=wUn^
zO*(jfvU9F3l3sG!{l47J$WnO*g^RRIMk$716P@wGgt=ZZf2H_rczb{*9L&gziEffh
zka=?E5XB~decfVbKsuOw=OC;oJI!~J;m~BE$n<2*sULG@X5&2w$4o~G`&a$R(cUvG
zDeTPz26w4eD2YNO+lufuDnHAKDvDuJGH|G#37No!5EG5Au=q=+FMBG80Y|I2lnTxF
z*(sq&Df0PZdM=qCkS(8@Tp#^$@je^+;|PPkclVH$@W4}bj5tfP;!IZsEPyjvC&<aC
zgEi(p2<RqX46drY2I_bz$&V;I^MLUUUjyD6WLlN$>m??bOwJ199_(e{F#D!<7rpCY
z(!GSMN^@+Ch#AIEMXneOl@e8}>;Z~MrcQ}D5S&9gpYYa=qud>xFtUajao;A`<dk82
zL6|i?nNneF8iRK7$|N-F0&XChtFq>lgP4%KS8$+IcT&AYiQ72=esIUY$E!$ZUEwg}
zO(>JvAA8wgf=MMfEskYSN8{{mUQA2v6o&+ln?Fp}F-tpt*@~ZtXvs6-dm}za6`p!7
zuX>f1uZBrxy5_iKZ%l8Mp@XXj>l37LLBYS;T?j<1hTG1?)iK)}hOJMBFF4cWad(`L
zCS}<54&%;=aqa8XwEG?q4VTb^qoA57c};9t01R^1C2@&(JgS*E>|PsxR+fR60;0cU
z1TLMo9_0J$VfSKOVD?raRhGVy-6C_D*qz*WL6+a)D&9i4uDk?h3qdb-LT3dwY2wm}
z%UQwXi@VC+rR;ueLIpYB;dP?sg`Vke<kX&JQjLN;v_homw-Un88fWEnK!-lZtbk`l
z@0uh~^oY)fLvakY^D*&&s{Ug+8su=xj<Gu!9LrKEI}~cn)-K)yZZZ#Z`egU%_DeWr
z-~F7dB%DMt`D^t@#Nhw<V}2+jEV{y<4YIrCxO<l$5R0>#7X7vE$B(fNpKreT3jf{s
z&#%|@zxd}j8yoljW8<rh&2PT``ad`CLA#A_{`2c^{v%oc_@QTirij)_@*mSPV4bE7
z?PmP`2mRco`*NokU61qgi%HVzwv)~E_5WVoT;JI2BrkF#3&1D>nYow(sdzZ*4(%5>
zxaXIc^|@D24yLWfzK+wu+mwoH9H+xR@C>6-kvs%mBp+w*<9%VlDe4PjlIVQeG+0C#
zC*%BV%0e+v2|VLDrX!tF>BJ%CoI#lyxr)oO!@4VAFoa9NUf|jyhKTt9^2J6fI6<-m
z+}GQj3eR5%$%`_U_|j!IF`Q*mnHvk|JgF{Tla$nToN>-JmHEuT4S0~en{`YQJ>tqR
z-4*tu2bOp-H!F0Q7^HYttkq2ghEzZ?Q-P)Srjk=Hn2ni*OzK9n5jBVDs#kQUE(-v>
zco&OjQaYeZ^bX3?LFu4xHI8~Ac6|p@_lSI+@aBM7@ufK|+*8^DwA0|-M12(F(xlbH
zq-7S?D9H8TM-qQTNK6<!@H$+zAiDI78vwcs6#dB+qJTmwx=dJ&-Q^rw2^N!>WJAWT
zvXm8&aQNNcadLe4^aQx8-30!Aadh~%y(ha*lE**6kGpW&y!Z*2yzfqu?+*8$>>eE_
z+XqkZ4g%Ki@ynA#c(Am63~w&ciGkm?4}MB^e|&+~nB?#%*?azCe-HYD0gkqTcicVh
zBzp%t`!Am$GnYUg$-&`CvcLCy?*y8i9CmPADk4*P6a7M;?;h=Z2Vb`z@9poM{6s@O
z-8(tJ;hw^H+sTXVqm#Xzm;2jC$%~gqFAk5XH(Vd4xZK~~d%pVw#DW71i`)Gh`V}32
zw~ZOsz2zSMZ~&qnbm*=1G4-{-xBYm3mxqJZKG{3k-8sQ!xxaP*h%m{0AUrR2clPj)
z-5+;hMcYR|b)Z`*2XwsqKQED^-ri51Y(L+A25W51fDY`?&da0S=QwfnCtpsEUp_tt
zvH#`CZu0E#@Ckwac=zaUdpo<w50d@EV*=dE<J}Gna<YxXV=n+T_!<6w{PK7Y;YUC}
zIN3cqdijEEZ?NY->|!nMoo#sg3BmgCfYuDaIz0Lb`$b^TR&<gdzT1W8u;&M|ypyAC
z1jjJ|aOXs~gi!&WCu*_D!S1vDy=S`zJG=PnA$Ih`-tlgmH*fD4+wAe+KWxLuFLC*_
zX)rhbQ{i%lwl>*&nruJ$+a6Ay8)I*P632UjKJfJT<<55keaSlbmwebAOo3J|8Ln)}
zJ$ncO?p@SItzB$E(_V(!h6I3ic+^^3TLYOP`8#oRlnLbY6!YkAtZ#nx>VZ5jhj1!~
zlYWbS!|EoKU4_22JMhNewokW@o*kc_wkxklB?NhezQHR?>+k-$@y%fH?mp$VO<FGZ
zc{VD_4$p#mqq?*}`no(l>H((r6->|kQ1ts;@v^j!Y<~$R{$;67QXdXWpr!|$5xB+4
zPjD<%G8^dT5c7-RVwe6t{`+vLvq@@CFFJ$)xU@@pARuyohn9bbTk*V@z^c|a-{Jq4
zItb16SM<-ut7^5>buIhRTvx0J>Luf4kKDAk4~uF&-GkG-+#gAOTM!ld`MVA;czJ@U
zjI5!E8qnyQ|MjYqEN7#Mq<KMr0c84<46dM7f21tJedwU1^~=W5PD7JeJb!E@*a@#3
z;l}f80v@+W?)<fTM<9rQE_GyO+|>-|$->cXaWbA11DwFhM&~xJxU;eD=i~|S0Nb=Z
zI6uCgfD9Y}T80ov53=F;#MZ;3M;JBS2wiM|k8y~W^tRFAo;uzhP|GhL1*61(M=p11
zFZt^L^<5Jzs0|==Uzbe(*yRi$Mse<#%Ub!sSYA$iOfxWf5bTD^Vuv1A7Kx#wJOAen
z)*&3WoAAjf0<fAOYMcck99vNqW-AjssV?Qv5D(I3I2Stb%Wadj4~Gt>#`_L)GkZO2
zdiL!ArR4n;cz<<sW)G%$`xk0&vzXU!%J%rYtF|O|_HCIE1@YxO9ce_pG3^x1sqN0&
zQfS@fc}U|zWgw)0kPa}$gGuh5N}AS*@qT1u(ne^!{*qp6C-I}=Z40dy*LfSK1K<?*
zDBF^&;cyw8JbB2oPIA8nj@PANHFSC#OFXqhPcPFruLK6_Uv+v)pfkx5t!b%U`;vK)
z+Eu5gKXTAt4l{Gqr4Cm$;>mm>YcQV=m8UALYh@YPyR19MDpprz4;NVl7r6OUi>NV&
z;fJ%bxdL9?LL2^%C&kEwN)HP7+tiBXIO@=K-(Xe@sc@L+h><0E#YySL#ak8+-tF6R
zm^jxNPy^wbDqA6NJ>u*m33~L4vLCS<MM{J-9Sjd`l!egif6MP)7`UasmdF4x<K^`r
z)P>kCOP4^DJSA<|X<GD8(F==8R3XgF9l8u(-ul_+uofo@o{pv<H{how#V)Y6Rcwwg
z%k(@$UNZS*broKHl{~~Q*I*7?G<zJ<=OEBSrDe+3tAjwp0I0oj%>1wtB=)rNs`kBm
zA(6wA1*b~h>nza(m#X}vUeDf;vNYmgB>Lmh+&Vlyva%MpL9v;e!kzrvJ7@2x<VvcW
z3r?gKj=Wvw8bP97i~z&TEILc$6`e*5n^YM}Gx84lrccl-gsZh$D46bMOamZ4?HZ&+
z!5}HmG=GJU`}myaM^_Kr1!r{BRyP`^M4jDaN_>MNQ;lru*;+X{#V>AF{L`cOQQW;8
zO|EY=t})7Q1ChX2NSQ++rs*&_dh!?<@br=rLF`D4%iL99QuTFR{s{53#9N~yl}m(;
zFd0XvUwH0&v*7}_9wq;Ua%ZBPTTJaHTOfU06qnY|5&OEJ0Cq1@iO5Hppa1f;!fT`-
z7ioEF)@1o@XlPS|=I3o-yhWth2m|KA4;GEZs}VX_I@*1*cf6!K(n%-rGtRE^VXw-`
z=t<QbeY8m9E^#EVs)EHujDy_*9Ei<(X~*QWvHM_PVfwr8A7lSiFa;m?&X|G|^+xhx
z;3Z|~s&~Fwg*Rl;cX%hsHOq8}u`6d>iejxgmkJ`APlZl34h_Q{e%~>!o;Jx3PG^$l
zgSEBD&{dC`3iE6DWxK=tBRXZ^xdzNwrE5{oi#Bzb4zAy4z5CSW(O(CHUMDHuoK8ol
zlOp(vS$9nn?3n)iyH2^((iP*NKTnU6kRAp5@E>DWiUQM=gPWfyvoEjX$7&Mv9imrA
z6owpK$_seJg>q@<QU8n6H{vO6f_?y4>AvD3)s$&z>N`$Ze}{#(;}hBu)9Sa$FV}Yu
zUfoY(7$4VlloP;~b}Z+O`H+@KSZ2}`T`zSu;@5gOuWf_(G4wN^IQCbk50~5!b8P5K
z3^zY=i-q$*?=RLLm`-rJKILINo_6t|^rx7H%M8+skD|_9tXqAKgo+SjvX;b2;7f^3
zA$|*(2+nm|P<;n@!X;!Q@ULN}YWX9X56#8(CPbs(9Ta8e=md4X-u?qy!2jR=RP6un
z^AVNSx%hNrG~55z|MQ#8&A|Tu_19l*{%QaJEk1wR|NpfA|7rjK)BgXb{r^w<|L@BF
z-yim}escQr9-!dy$?132&aWQXXZF$V_LF42^7v$XZ$H_fNRC~M*v=@5NvN+dJQSC~
zv?N7QhyotRsGmT$+jCLVOs+>6&Pz0L|1`R&A24E4-jX_q9a9v$LdeA2*DBExXSF}J
zY`WN*-WtQJ{ecQxTYID#Ri@{Ly@Rjb!SCdtO_X_n32QEjL63D@@NMeS_$c238uWvK
z2}OH7xOFR-n*4f@U9pe$gPI1<v+;S>3VvIrLXMqqxyu~QQQOyxX?YQL^?p$4rtDO~
z)uF$xP$yU0{T^W3yIB969}a%3eU;+KX3uO?zqE1ocF_)STJrj{tTOy40$$kJ05;1E
z9Jl++xcv<vqErHNOmwbYsU7D@hB54OjMD&8?&Apk>KivTnAdQ6S=;4NHX5YedFHkF
z`qggkaPg+uJGu}|pQ85mCNqCawo`AQw}dtR*l+SW?A*_W)q$Zcs-{kDtH*=ltga<R
zhPX`_M;jTsj3c+qs{e)>3}7gUjO{#b`)@8Muw3kX8R_O2tC2!SYU<|oJtVML5H1Em
zSqEz?@#S8YjhYI>!Y4jGzLie9XC0|e+dVr~6Z618VP`MWJOT{0HFT&a#Uve^Qjxfh
zN7s|(H`#UghzUS^tg>-1_C<@2QbvX;YY;|__i~v3W7>S;ZZfJG>^SXbC&hNJ7ovvR
z+O&ta5^^MnU}P&fJ=r}z(fyoc<)mU3CiCPg#)`Dt#RQ0W0sRGIjQY3aU%bX0M}s%=
zZ!7;-^gmdE?o$MPs86&0=j*T5|MNdX{m(l5^QZpjH~65(2#Nu=a0uq<lX~A0?_3&D
z^-s;tpPHRNH9LQ5cK+1t{HfWwv1X?^v}0*RC2-*xGDa^j#6KNySzOKy01I289mCFC
zL<mrqi?xd_d?_!7>9EzN!QP`}LP9!FXW;5etkk;8HE17S1FQL_Wt#wJSys5`F*HH$
zkJzMRn8l&V=mY%uI0KsIJtQ6wWsy!YF3w(qM3n+@7!RHQa<!YXNFIe%*WsZps$Q&a
zVUN%V|8WncYjob=zdYCKvM{+zjxt+njMP3!T9!pOPsPz5p98Zj-Z(;O&+rDz@ZOcg
z4nF-KPX}2Uq|zX@PEsJB%UL{tF5g+cgBQddnIP$;%IR4-$tTl^xd86alRJiLZniNG
zx_bq7wtJCD61>%|CDF2VbV`b1D0;R2L=tn*<%;=*#>EvmcF|t-Ole4SpQPwkbpdnF
z&?&`Sbm-zGeM(={v%HJIqWAH}kpc+Z59iinAWQtd&1NSZ(MVik4|l~eJ@<lTXaAVu
zUAgp^rH-Hdsl+16*S74MKo76LY=F#&UA=HN9(RY?Gv!{S!1??9GcM`b?n&|&j=TT>
z18@}>kF&|$eLNx=A04<ZrPi2EabuPQ=z}@I*l{KuT&33~d*<cD?De@|c`m^Zl+k2^
zl82BsQ&Q0nS5bLMDoQ>{gQ9pd9etl&KfZp!Kw{UfCuhlW?<_cP<|_e5^nY+qXP9uw
zchntqlI1@9UtF2X9$+YR0@5G6D<_J&0vN%+*c!JGA3YNN>T=<{d^x;_G$imo{W~hk
ziFrovk_OkPaHWpCIm|h2xjDpyLFT;R<_lzHvrYB~<G=`;XDe*;d7<51TU+DZT}t|J
z3Z`SH`NgF=0s=I}gi?`XBRs}<r$>*HJAb)D?%ViegP;6;{f=M0xjR0}`a8I{Et+#R
zE{7ghy*T4*6c&yS5Y@Z`q5?#`w}v1Cnt25WkPfw3eF{7rwJ<#hRp?`VLzmt4Jexe>
zc83a0G5w4614YcVFvM)yqG6CsNq49if@$N|GoY0KM8i=$kRWQIR~<eQm@9O+GNsTc
z`=XFgjU!j)sIezkN-mYS!8Q*gpc{YzPj#=z*t6&|eUo8=lG1Jdhy%;I7h~FLjHJ=A
zLnFPtxZYXYtJ9&H^*p6qNm!v57j_404rJ-Tx-AO*1su*K`IF~b+v@Wa;eV~s%0`DS
z0GF^0QF6J}U*TBB5F^c5!!CNL9i>&aS6ls6{$ulj-<Hp`-0F16$lk#S9n+idUmqQ<
z66a;|0^%m(erj}gyJ08?o=2MD1A|fiBH)2c!cmsW8f|YY8@OUKxo_<}S2mOTi3uTO
z+7@3t(Ky!~PiMsqZMuNBxf?}A(8+jo-Fnj@{IZ?2{a;rc(Zt1dc!=6YGKCHzL}eN=
zJhh>AcwYIwVM-w@WL8o3YM-tdk4wRGq)Xhpo5b!uvT*i-IzrEExRMwg#!n8=CEol8
z?5@%tM=D$_!Fe&k+*I(p3Lr698@jq0ju8&U;p6{%`rY>Ncaa`s!AEl43*SQWFC9u#
zdXqR7WO&wMx4hGIFLM<(EWu$J0660I!Z*cqa<>(p=Q{!g2R?zRb9%+8*`cCiPbgtm
z-64!D9>t@BXZ6eH{H-!!VVZQVKf`BXn!nPPvC^E32LZ#>tR*P2NQz&+E#Ps9><uR>
z^Ww1d-C1}cNgh5|5X2#X*UmonBm&@4ZV>?P&)YK|t9g26!q3u%ESqdtZDW&0Tw)oH
zlz0{}tu}Bb`CF>q0g$IAr(>zD$3jQiV>MKY$p*)Og%dV)OVG-&hvkpXFcV$!`1r}H
zRnA;xQgDnIV$4%W1LMtO`ze#Rc}k<44~jDw;SNircf`C8oDyymS-8})Ff4W=HkxvS
z%PZOMHp+^hI)RTd3<SFkB-Zd6{JDvLZaVI<dpXjj97H}QsHB6@MH=S#onBHIXj#}=
z@*Req<dZun@8oY$a^^bFBP_*2NeFvM*)7H{x3C!trnR~?U85h9E$DI6eyw=TUyl5w
zaysZzck^(LZdR-P_{}g=F@dgh1>`707<JmAtv8jfldDviwk~Z|UKT^&61OaQ$EHK}
z5CNf2SV`VnAp|7|eDCsZaXwB*7dd9&y<Q7D;@E)nT9`ykOol=qaol;CxO8fhyz8BI
zw|E&;U$-TL5G4%)o;z!fCRE^rg%l7yhCV)2_E@3Q*>#|q&<($oZG>4OTkz|z$(OQ|
z{3Paqk8?0_PMD3;2dHsI3E^O;<_!q9o<CmHoXRj%K}zNmVx#NT)su^Nrm<1?*6>R3
zMs556=lvrTmQ<S-**X?j@bI#ND;7p-`^rh=MEMh|M=k@Ajt}JO(rXtZ3nFsE;tE-4
zP?#tNgI3$B2Za9M+REuTlM0cs&$5OH7bg>G&iG>SPf_r=Rhubz3niYxU#(^%yd~d?
zf2*TSawkL-BjG&f-ohKwhT2)`J_mz<y`Q7ckotI9Mzx?`R(3(aSjDmK^HpY&CkI+6
z3ADTf=3Q!5ymP+|*~qh&{E&`Ow|3uTrR{N^+>#<+E-9BJWzijFQeG@g&hiPTEXE&@
z+f2{$K|Z;5$y^oh(H-O{zc1U+cUA(sl<g7kJCJ1I7WKqD_W6LNQ!RD6rrnQ{u;((D
zWUJhWA23&pM5kkdQnO*tb^5x4x7vi*CVK5H>{l_i{(so!Ji};zN)Z8oMje2iJ}WJN
zSu&yv>D+MGA#54isZJ>Z-d{<1J)ETP!e2z01~VZqGWrWxI;#L9Tt+cT=SHcpK0N;i
zEOeMep8Sx4IB}s$65AnJ6n52^Bvmqfl^EXTWiGiuj~qpt;q=hGChAXwlR!oF`G^MM
zQB6iy@)5}<PsdsIJeyn;y_S2SLzxkzAqvl%v^0*(l5D976<VYyb-lF8iNL(vnC$w0
z_E#zWv+P3$dDW5%&&hl_@5pQ5t-7mQVcrJZK-5&jb6k$JSbeRpHNM|nZVYbp_LtYM
zm`X0CWp}9^(j|l7QKql4JAAXYzc>@wJUu*M)eg<MyFrh18kZ<fg$3SLkS@VMt_24U
z6VE&aDVfpwaEy+D*Ddt=F+Hzryy_&k)v@o?aUNfq5|WW{%sI!}bYqE{a>iKxPu06Z
zlK@>8(tIMhO#EB(^~$5o#kYZINOc=3;hu`tXn;Qmrm(X349>3S8Qze-`oW!6|M5>&
zX=@d+Vl_fVU?<7fvNbVzkh}=;OW-@W?4%o0X@CgjkclR1k!Y~1j9g66@h#4Lu&P(j
zn-`9H-&ocP^HI0Z0^BZu0G5viKU>gARKAo4jN#I8+U~U5%|;RCaGBr(*V$l7_1dVg
z!VDf++MZ@ZbZhI?G0JJLM+a&bQ5{az5=>aaYK<h<%Z54K{mG6Vzb?di*4e>NO)j9O
ztUotGXCNPQ;PYZot3Zrdj+=t)qe%_k&)dBoTK7-Ve4uaVn03A~08aSy@Wm-CqoWT-
zJD4o-S>X(0yAs?=8eF2w>~_ivVC;Kqym(l9Shl4BDAA-#-dvp3ffM0Ncbx4A4r2z~
zDi=pEj0&<Cq&?C(P1GDT9<UEKl}S;su9$+tsq8x{g_K)p*jlnTu}M<IUe0cEsKE7#
zQhjNtzAE^_+-ODd4%^r}vzuu%3wdIE<XzUn*SyTi1bzq2p!{c`Xoiyz&$$w9j{d%j
zwEr3U=fy9u8;$sPH3sGahwxD_zJmwFl~<K%Tu{v#0~D*%=OhHBv6zbGvOh&#s$s~9
zO4xKg1`Sim<$}d~$ii~BM?oBPp&6Vd?H_BmOmD_%L%4s$FENkf5SSzpn9a$!xP~7!
zhV#rFKKTZ0`Lz*un8N(eH1EE_oiNs<2e(|M2Z{<4ZCpx+kM6*sT;ld>q<fH#0zD^H
z2#K0zm1UvzjKVI!pc(m=j|)_9Q>6(SX^6#FMg#GFHIk6&3#AYC$>ej^!r6BW087la
zDAi4kA8S5NhFrAA^Eb#)a}U5Y%i&TK<lOR)DF9v6tIz@Zt6<`tq?Cf$G-bQE+L`Me
zvuubuHU3d~6g`P8%Q61?D{^h7=+@5u-tNK4>Hf>@c6hMRa9yBN@Am$S@3v$5R4tjS
z^H!BYJW)A3RZlWDG)Sd4lFTQ@(LrrUX?@?;A~@`?-VqA?yoa}UxL?z}L(O&%b`H@s
z@bvh54n9x?N&u6s2eZT~3VAkmGDE<P*8`W2_U2>lAei9PP`vw2i6QbfTKo2C40q`C
zHD_OkW%+L-VDRnZ{Czg#-JdHjW4$kWvDHElEw}C5Q7;I$0Q~NE*30@SoISsr^#`H?
zdyx+FZfogr+GFyD5LjZ<^EPRop6%=;SFF*h)?zdc0_@nxA|tDZO6YfT%@xP=C2h1x
zEv;O7h>3c>P1ck9TIVD*Y}j+nxo>H1*R#3-FVZV3s+mz9un2*}02^uF@#+rAoK%PI
z9Ps$=r%i3;#J;hC-*foN#siPAQe`nIxttLJrP5ng6PpjkyOAj=`U0jD^qW$7Gedk>
zVT+cWHCu4k^a>NZ9}rLRcJvPdTfW_SrNCj<TeYZY&yYNrxIx=$rnp?!*yIqqkh(b3
zV_G^IL;j1?ENOv!^3ceMq8Hz4hva>4DE{m0IVJh*xYQgc$P+v>8HCXEnsz5snj>%q
z({5%-GdWAz@{AU?Fw1@hN1nh=Ig5=_7Js5zTC^Fe8qb)D9N7}ISSSi_h{RO*LHE~G
zE=r>m#F=3Yw)`BBp_raun9gjmV5;#0y>RbLtb7-uS|W+pLG(wWhWZAH-8^y@FgX@>
zgt+>phpd%LMbiyvzRD+Uqsl9%J<aDBV6gBkwLp!XM5#^P5LI{LKo#3wcBjm#FLi3t
zTDTzlYrqj$qmKpOsJ1muyl+ndq2C?z-W`L`%BCvzRP<6S*;M4b+|-HYD~a^MASvW<
ztaKN|e~@o*+U>#@_;Wzg#*^LSo#bw^4gVE(QxC1Xa1{}AIYxAe7%b<y-Ew~T=psE~
z8lw9Fa?;^*037JVu&&4#<zs`corJZ%a&&x-Cm@T2ETKeh?oU^$br96jG%Yv)GUIT5
zzk#}k_u#Iv)h`XV5Y=Ibt%q{fwOcj!I99l$L$ZogQ?8cA{#*`+`-x55&{hsR_;D(5
zccM_sA(NnR{6XHiO{=Xait)qm{qp+N8hgE&S22=aUaRUN+)Kv4A!>Zq&5Yq$@qYUA
zI+X6Kx(%FFSeA5<2eTtL%XbXkyMQnE&5hTUa-&q!kV2Wb#BN!Sa`-`%TNRWGR1?OA
zRpXM-NIF72LWsGu5OKYuQ6lUqis6hZb7IEASTP4i%!v)YCaJQvS`3&4b`%A?!jJ*b
zO9Z-k8iBbk28oXGJ-ly2@V5A|>j~j(yq;^yE63o?;<UWzT=zQM{cjC>SxX4|a$eB?
z%u?urm!)GNKkb$2v8MmN7pEuoVmucjr4sBOs0KRf3pu88bqoHAv_R!D(5GSZS)gR`
zI5}qUl&xNGJEx+~`>uNJs360<_1No}l=r<Nr@SoZt%J6xDJ#qYUYixB09_7n{fh{?
z{tY`A5<n26(|q6`7bOOQ_*l8q%&U<wyFo{0#hkBpYm4d5-6S|m_UhIEB)-8f>#x=T
zK5(1$KHbEG6_3|cU@B+!c6GH{q8$|g+a+el`2m>py<xvVEvsBxFt8zj!DVX5=3uzG
z<>3;3;?&Xe%;yd|#_^xY<ZnYKEkuQJ!zG-h-8Z-`sC^hV?bZi<B0d@C66ab1j%6OI
z?S;MM<g?3_cIpq%1MdZQzxHzf7s*2c-FW*QqbI#w4lf|AyL~c!Y|Qmby-920ae586
zuEjdj`S;nibWw{szef!G-~l$grhCCPt$84&u6sFrGc2x#Mq8&eQZo)Ud6Q}(+DPwc
zCt(L{EMQCqdJ*T@vL)Wv>RMJJzBYKp_y(#7#G-oQ$v+PeHsMaQ)7IIw%_C<%2K&#h
zYaDsSsel7QjEdpxI%agI?zJ7wMQ5@tjR)#@$kZ_!`7a+u=%NJy_1(7Rq~~`%pjyvf
zq~v^y@Fp3GW)%=tJo01kjiPoXIFMI5=K`twUb#E0_E75)Orfrsi!=;Bu|rBV=X%^T
zyA<5c;!d+>R`|0N$irYf(u<A9LkeTsJ=#8awj1+vvOQ4Teq|=@xWjgQq0~>@$uZ*E
zji1IEQnGe3$ly7ZTf*8-_6|<!K#tZO&ufR>nY9%q?-QwrFJ#%|bzC*(pccJ4G?B14
zpK>}Hu}+x+zvKP%)A1VBoCl7X80#+j=sTCf@DsxYR`fVjh`6sb`HIh=rW=ScVJ3d+
zwCN1qm56Z#(W|ty;p>vTAVQfc9#&plx()O?%WT|MFYZuPOGCYwsp#R3F`5-;YG$t<
zL>m}WBmEn1Vq-i+3IgKyZGtwQ^>}-t%5?C>URr7GR*j<Vyee?>;nW^-!aKHIr$$NL
zQ88D>Lpq}jp{B!1XvWP4s1z4E#^o6IT;WQ6d(zpo-$xHNaYVN62`=LUW7o6Yle<rL
z_wVi<>>R-#J4f2-7$BMsU9f=mFK6HGZ~5QlmNFTjGPPnspki(j(x>sW;=Xk_q-;oN
z4>PO@d*hvD#vIL_??Ar_47**5s6VVjW|iYaK%N{P?HXGXMeRAKhtdSu8%9X{8(=u&
zoqxA7`E9i0VY0|>$AU{Cg=Lah5<o_Y>@86qDK6ieUyz+lP^Dfu`d`wfwC$W8PX}*c
zJ{|+nu6B6DWt5bc+U<%qSGf9tF_05SkIkaDdpx1cNTf>Q;HqSmIm4NZ+sNjai7V}A
z@N_kN(a1?$%KNUVBIB3D2G(ErW)lvkgF&lX!=E(XPr4Vgl@*$;KOTXvZ(7S-)bb45
zoGzuG=7X~Cf}U}k)`EEU{p$Z!nX3r{QQ~0C`$;XwJN(|kkDhx}>m`(EMlN&(f#398
zSNF&0;wcX`f&h9zg})#WX=1jCC=hjr^UwqQEJhP(t8PLU=*3S%8}PFzeK4D_D2*`h
zF`dx9d7iRjX{obbH!OZo@Ku}49{ZI3-JNw4E?iy|(*dycm{g^kj^hEM^jW6gjsKL&
zec(9GZfauWIpbkdXVopi`@3$nbrb|Y5rhWfQHRF*GcWO*MRDgOclh~qB#&mcAR)vL
zrIxVlMnwfoYP4=gj)$Onr>wF8m~69u4Xw*j+Rb*~0xq-;4o~);{zOL7&JwPPV_{rB
z^%x-^8h3Ro?**d?d*92)lWQy=ZdXuIzLPoOOmeUL%cu|;42Vnz&ndxb){Cut{zX6A
zJ=i_k+rdDwfm-oA3#w5EdKqB+4KQ~+hE-Ah@G1-GB!HbkmJX*QgO)RtZ}IU%hVWKo
zhT78F=+QmD`p>GTP)w_;pnS2cX2L;SI0KlAL35)&Yrg$Ed@A|BC#PuU_@o)Y8}omE
zwfW80-+UeB|GxLlpY`8<lh2I$Z#T&7{V8k7{h1{^`7=xSpIO5H%o6@*mhk_#vV`AV
zUj39G+9T%!xBX%do_xvyc+Ls>kMNB^E_Eh)i!D);t0KW-J}$c)Clo9OJ(t$Zc<xcI
z8_DmBtuT=Bu*L3RZP*3Ct`nlUfQN^F+x2V;sIE7@gxHTis7~2z{RDB!ARV!(QnIpg
zsNQ8d8sY4jsOrE2vKJ5`-k!Jxu;W8R-{@Dz7l`Sad%DHh+5B-@7+Ru|LWv{e*|q0M
zfmxH^=GoO!+bqtxBU1iqIFXV@3h%nClt@)IO_P*})_|8};c^fvXduL`>!9AB5+iFa
zv&&+9y_WpIiGtyxQ#qPxb(iTdJ(nzY6o#wkMrIh0{qn&zO{Yju+zM8J9g!6ndVXIH
zFf|QoIx&^v30;zuw-PUSOe!-hY+lcd*p!QcaB_`Lgwkb6qV6#)0b_)$52?B9bk|Z-
z5btXG*#OEw#-SMAkQQ7fH#Oh;$ny;-2UMEuB$IJEEC;E{BtUjH>#4d7EzjZW<l>S{
zqHu#V68w-426=j!yqKO}AV8Lm5xG!<T;9ifXk4683Mfp%$NVG(V^Jt8fcJ4aNQYhM
z>I9%uE_H+*<fx>{1%eELa-U|<W<(2CfpIohCgIeGlgz7=an=s<5gM;Hvc$s*&~VlQ
z-Y~gCZ{2BAMnlAJ=n57GXpF~~I_pwr950q8=x@jFqiBVMb3%ScDI4mp;e-v}P?q;{
z;#eqrhw@?aYbCHhoIf8^wM~*Ga@tEamLwET7DqMaQ?x2(HUI~EVa!0D9m!ah_BzN*
z^``>@$InN*e<P=lHL2*?Q1-#pZ}>cfzXkyX&0vWMulw^{3sfeo9PDTBD5dSQN%lM^
zXE{EZo#g!>dq?i2$TKF(_+L|{%)Pb`uchy1zjjM!&ay{uh+>Du0+*4+h4v8y7-vs>
zig^bJ!5xn3mK@zZlN*@2P5Tq!zcEoJZFb;04a?vu5uxHNRWMpdY|18;C$0@02t|<<
zb}~#JS-n+QF5~^My+VC1%M+>3YWvv7AB}6``{C-A^>V_0-DCERw4RvaPXB&ra@kqX
zVwz)1?z}at^>TSsSr6rOd*CmP+KO6G{LsUdm2TST49%Eo-I?SW#b{f<O64`pPR|PZ
zKbv^()92ei?gNLm-&yY{FT7C6SZ!a?Hb$JZUt71|iYI5hbva7C)ajL$*1K5uXMNOz
z#B;o92wC2>r{)@UnC~48liAwhcZ^{mqCvNBKV%&6az*Z@!16JafDn6SY|1(53Q$N&
zfGXbocvNg@6_sy#&88~UcYAOYuyeBkaA-&;YX>yQVxP7>D5S|1Fr1l>yL!N&AWqF`
zq?13xKfeRbvUd}M-hJ-ez9182+ooO;X&c~0=$}_r?@F$LBx|)j@C<ndp#~cl=GVu;
zn{!O1C*?9QA;$Wk3mxSc=JP`0wb}Y+NvEKnDg&eQiDNi(Ho3~OVX{G7RP}&iM=eSc
zOV?uw%u2gsl4p&It86?-uOv^PrvsxB$H_&0e!=`E({!3FAtk=SaXn`)kNcWQaSbrx
z+M7fxE2JwRJhW{|tHm&DwQsM#dkUX6kPJm*UcfBm2WNEPo>pvE0<ac6e^`YFCMn=|
z?#IZHY$KN^7RpTfWSp!mrf-+!^ioO*nbT|YvPpV+gj@EGBKI+4QDHAOX7jUQpAv(h
zXdxW8MUDwYVii|IV3aQMks=kCe%z-jbg9<dl~QOqEKIe?WjP&TVcB1*(0T=j@*RWS
zOKggDu42s}*!|Btya{rgwMDk|CHwA*zb?P?&L<D*cFD~z)ZgmHgCxfgXSi^3Ke`6f
z$&>CGXJ@kkQ0f>KCSk|A7h+ha-5(WY&dv_bmP|{_U%{X`nul9@Xp=63+jyD$1i{}K
z@{_wOEt0k=*3K{)4|&h(e4m?MeIyJ@O{OTs0?hpu?Exb*2tzQ>hdO>ilz>17j-&1c
z?_=Nciu)NECuV{b>?4@J)5P~KWiw3a7>0MKI)k{Ic@L31$3kKhLx@~@Z_1g0oNpyd
zS{*<HMgZ%CsZ=ROz~zJ?7wKq(Ntvi;m7YS5I2>4a0^8QlBP%C{oG4{L9x?)^Gk+bZ
zNru%~Cr?931A?n^jd6=DbxJB>ApRl3BlIvae@0?K>=_6`Z}e7GPHUx6fFN!P$bZH#
z!DCs4e7F|xD%>f{1x(@`FJl+H-n7oxNqrQZdj)kH8ZioMlEjS@0zenDm9aeJAeol1
zGSn0h7G*t-cU2TAJZLr3q@Pxk7H!`8EBI5kvE4j#=`!+OvXWHtjks!8^d7=`I-C^K
z?geTOn1j$R5V_q++6xZ{{SB#`Tac>ooyXj_<Sni{rrAXx)x<&HPizx+V%}A`#C8?l
z>xw+8F@;8X?&Mmucvq3N%o2okdFPlAPWI#YJ>%L1FSBz^$NhPP();7<W1{dt36Nt5
zf5aG7k4NWUeX&3|gn$WnS9v0QfoALS_z`Q^Rs?tBfdPPp^rse0Bi9b53z<!S)bVV*
zlwwY3^@q(*AgxGM9gfB5PaT%IZ=MhRKjS!8X|1FsMOL>!jJSO}CWvW1$J-r0KeTGL
zTETOC#F))!r}e@lkWh6_tHZxr(HU!vFqa7p3oC7yYm{ZH6m_XnDMZd0AVH8UO!+?S
zW<6Fv6N_hJ4|i;-5mH%m2O<v`L7k7I)0_wW=awJg<}K97lD-y%d(x`5X?Dw|SCQ}S
zB8*b@mPy>0PNY+tSj<S5PO=zhQ&F!{A1zjm3PXcE#nlt(#OWH^T9y-6zPY4`DxuKw
z_zh$Wp)8+D5cosz;-7#S|3p0Y51C7^dWm%wMgwJzb828!M(Ii{Rv7(exL7ek<>J`k
zoqJouMuj!gp<rX3<#oLkg&G_ps+3UI0Qj8&Ha@iAw7`QF>w)IcyAA=r;nI^!&JSDr
zk}%qXwx$8^n!?JAw(Fg1BNzXMhP*uES{y_^h>!s!n1sG$#*sizi^KxNj-HCJ5TtAI
z2&iw>G%u1559=&&2k0x&Wn)uXv$i-(eXZJK8cwPz=CCX#R7eO`=m5|DH8Ja}9u+;-
zFGp-XW`gQQM;KGWV9FaqMg?nDq=|9cj=C#o3TFU_cPSSeQf6qQ381yR>aY4vLIk%4
zzq4yLeYz~Pt5|xD(h&}`D^d$Fyz#K)09<+-Rk=kO6hf}taX2bZzvrY<Pp2qXMvX>@
zF^BlXI)dJvjzgL*zrgIh0&E{i&Y8a0S_E14hV){l>TqHAwBSe`so%qu0MRy>4zDrE
zkD)SLPgiR7nU~3$N`~m%rzO9mi^M?uhIfg5{r7vFnEn30(@Ro?qM2GY`aTkm_!+lK
zRz8kqpS|mY%0GFmBNMQ4zKg?CKGF?hp*iOzQYpaA<j2`EeVSuQO*z5L*g|lux+g++
zOl6A-o#T$Jx1jXk(y#h7$X9E*t0K^B>x8GCJS~NifBjVp6b^?SZP2MrBXAFTstP)$
za-{7sOn>^$*<4MV%5_@7yn}*EENb=`-KB81?(2l~)@`L{RKY^F8NOJN5VPDSK<$Z(
zo+P6|s;W)T!AXP`u<Xhi!K})D&@qeaywm15rkb>fp0|pGn<<vQ<Gg;T!LYE)V6CMc
zPb^P8Q+0Rf*7MGovOQyIh20Uj%UVd*6Y)X&D#%4*{0>5=1KDI#5)K}%Ze8ZX>>XwZ
zWi!~8dyK*B=IJB#xH7nSJltgP^qn63p?j<bfA~l}4sC%fk{VB&5vDm1Qx0X8Bjp~a
zd($G<Ub#0UwM|tsqoz%N)?CK#99=p=oin)=(W^{PDKEcxY9ZqT%+$4a`l&Gi6ku+?
zr0>EzO1FcPtr}up2lr!!Z>pcOclx%m46lDZyQFc<;49McWq?_RD0CPoGrMk11y?_u
z;L@DKIp$sr=SBqT=VQaLS!)!Rb22Vt+QoqJgJTsKt!Q49v}9Ol+ef7nhgwx;@F`B>
z6CfHv%xCQ2E~HX=oQfRXFsFq0l6BD}mrTb4AM3shkbhtR>{p2XR9qaEIxG@%GcixM
zeE9NY+0NC=*D^oT7eUV&4z7Yh_L^(rx!lEOGR;$b@h}@35KEm8a(^H^0~P|sG&t-C
z!yB<jF8!bx-KC*qKHw2BWA7?E+H`XKja7%{UFFaW(trJ#*-!sGGSwrqcd-0X$EAuR
z|BBO+myIW7(Zc}XgNrYI7;0{<*@wYs&n11ouZ!bxjaSg66hy$wIIc#2jJh}7Ov;*C
zZy^+)vv=l83uN@fyVAwf<X!7)T&&3Tk$UiOS~?~cT;iOR>lMwEmIm1;W}?08jH+B|
zn9z4$7%bMAt1QUM$6lCx4}um%s=G;1(EeEu7s-hmF}uyC1|3NPN{Mnmfwv9Kg;&x`
zyxP0}5{3B!S6*_XQ%s9*(k|>w$0U#$Yl^)y)ZuuDDE-hsnYCA-=~xaO_FD=>Jg!{>
zN^EG+E6=RkQ#=Q<AbBg+UdTc$0}1n8r=qDwBoo68{^`q*(u)@2Y!&vr6z{)x*6UR1
z6b98Kc7lOAhr+vvyQB~@X-(v;`Bd#^@2Y3Y_f-EE9IJoLxe8qVYc+ZQ{^u%)VtD7R
z`_FSV7n?v%kcLZ;>f*ovV4lJ_pK$E8;j&9|yRWGW+waOK)PSGZSUtn#&Av$`kGg;8
zJ@-<ng6%zn(LM_iFri9B20H)Rt2Sx5*{oDNT~K`=E$pLS`rK}rx4iKT+BS-p`fR(I
zayGW#<6&+(o0XL>c3`cLONWzccsPUZ*)^NVopJn4cJ0Zw>n?+>dC5sJWIgV1&(=RB
zVg{xLK$pyM?M*F<O-@bh(rN>O_$LbABW;!p9A}uHWs~UPUc?tYepBP5|MlGO4P8ZU
z>LxOuN$(Na^dcU-pM)A{mB2f=_|bg>RmuN=OAV1j!JY+d@_p{3V+XrM4OdAe6O<y6
z`*A+M4Sk?sU2&H?r;~MOtqjf=Wo{-9$rE!D((ySZ7x5A~%h{-Ehn8z<g4En)7IzoH
zb?-v@9o|8Ycty6i-{LMplu>Yb<N-B6k#~*w!AciKkr%~iIxvP-Cvn)KMmB@9WE4<J
z6he&>gZ#RQm~&pFFge!GaaK%d-jM{E@J78cN~hb$@7g5x$g@$os*5=L)C5>V(^XQk
zpiju#bg+hMMzmpy5sEBWT&Z-N_49YmXG;Qems(3S3*c4p7*k|8RgC7O6idY@8!oM3
zkz+KMPA~}G^zbvqY(M_#cn4FrlDVt3vG#S++Jyg*{fT{x5Oxn?%O4{28eYbC?W;H#
zV7cz%5%$44C8csh2+W;#-@?~ss;Ad2{40*OWG8PSfR=63wz!<%Y2B&hJ5>EkRfOQ>
zm5pd|gqorV5-nv-pH_jmbGmzU^dLSqVT<-oj(IlEp6Tb9XXq#md%5uDrSIJ4;p=m5
zo;01kdDMRZ5_$O}HZOfQ&*sTdpL6pXX8JkiX*N&O)Sc7A?+s0@OKp&VOrLj)^Km-5
z0GcUQ>ZW7}lGsP+9Ig{n&m##oS2mD0LqYa;f5cLA%So$W6v<_l4$(2ZNH8tt&=STr
zHTflI(j62f3z@3Xs<aULYW$~-M>e%t(QVRqu{P9Be1_!boKiC6EC?+3kY5sazQ8$r
ztWw+D;_AxArY~v8oL{(27{a+$0D(+9>2MvPw?W;E=?;=A^5RXOPqIrK-q`_&)?4`>
zx7c(komhwZx>Zt$o~)G%E)y<kcl?gc14nlh^#i-gP$8%JjBE!W+Q7vXgdY=P09w(V
zy9W!9dl%QjQU>+Yp$i&1^6y)$mw_#XcJR&1h3UI+HoSWDcUJD)_XtY&mkoP*>Q2gX
zc#3&dk0g`N8ej~=s^Ztg=gEz}`Z-3&yLGP7TWa+BUVG&*yTY<wU7(Lr;j7zT-DuD3
z|CdVt>z}B9z?pP9nB1?nu%P<jCp#Fx_>8JH|5b-Qq|YSyq9@sJ$n)=g<|ARN&DnC8
zt?Zfez#WMqb=vJ>aD9tTlsO0ON?rxqWh`%t3CP0i=k^N!vbwigsEjr=DA=}%A+(28
zFh=@r&N2LkwPPqpDvuMln=n5&Zj*dk3`nqo0K<AMIUFWj*Qr8)NI^oTOn5~-54O&r
z07v-HMuz*;ruZGJc|rFB(fATAg!dY#SDnOAzxQ{SjSPF9xgsn~Y+3xaNzkM+R3eq3
z)(rQ(i;f6P`DuNu*`>v`ko^C$wh)W0H6L@ZbpBcN1s^T;cut8pktpRS$lbOb=)aNh
z!wh)q)g0sfAlPr)!S&y|pCGElLj=jJ)If78g)&0IWvG&IWFV*DG`SjMG&<*xW35Ts
zI?0G78*xyI=T;6XC8G-tB}N~UKJg#Z9FT{(D(qx6ANJ{u75oGF41S?BD9kee1f?WX
zDPOo}nlz;duCun%%y_?4<_BEpnf}2M4(VZaqoxbHny?Ggx9!5uAtF#rJ7=Ch>0-IJ
z8vI%94!0b%xF_Y`iuGrc`|~wrU-ars=S%n1;QTsscyxw+INwaEsh#PfZnEAD5W35{
zTX7DX@n><GMV<TQh&d8jymOZ6I3F2xePa79E_z0Pqk8i<aGb50lVir?Pv<$?Xtb>v
z?-RMsI(+$D?z5i=@eB%mLXSW-vp=#Q?Pqm<_+vTJHhVw(5j|=DJUyS!rM8MKzx~1a
zZG37QFSMEG;#1~nr981eGj^_Gm>jyFe(rqXVnl!cesIj%UTZdFh1OeObpxN7x2pIQ
zH9DL2f7#glFO>-gn_#>Z=MRP76^gv&%A)Ewe(y57?2fMSL5Bu?>*^ul0QeQ1Mo>NF
zv)fW48s0N0L_g?tJ<BHSWgD!lL@l-~BeLkgh-wzjkIAG;|9Ol56~&P9M~Ee;!vPhV
zR(^laTMzT4rk&dahTAwQ{uiwh2D=Hy<;1J2Y62VGR)%1#)}fbI)FONxysSkt+`wbY
zL@oJF=>WUnK{jK8)ZkVm1>rvD7X0P_cjBHX5yen46YTCq^qIqP@c%6y(U;YwGO!N1
zRV0D5D(CszZ0LE=kZALMAn%G-K^X!c%{846?A_{d@2cbeNzRGi$y+?!_cm3MN1)QU
z11J&2c2(_KR=;a{)9Q)>Q(DJphFwZVZRd`e_@{mEG8G~=7;N(UcJGl432DQ>+a0~D
z^d?P+mhGK5UNzbusqcpZ_iuTq`}9>5+$1R?xx5_l8K+(24gv|0onA~fSS*O``jMvu
zX6;ff=(A7BmqM(0KL`Z=_a?XXum!)}-89tVdBMpPi1`J$j;|AT4J(G8`v9OW9#c{y
z!5?cJSwdwN$i_szW|nERlKxQltn}RP2UM4|GV2Pa$ML_3B%Sgb%crGts?dl@JsNt0
zqWE$^fan$K1<ACqp*UNZ9uMp`?^JiD5tl}<zJD4RWxbi5Mkry0DsiNH0Mu|)#|R19
zF3WOGou|pNv=un{=s=lh$JyJwn3gv}3yRHAxvb|!ix)8H?-?!pZKc^FT4VuQlyzv4
zMc+Ryo6sVg8!h}T^HC%FNYuDVy!$by{voTGs-Bfg>O*{bjk~VnlnI%Tu(>!)eO<ah
z$Ox9y#%Bg?N42crA1#`m9*rDE?G1YvRWs<Ibre^FVB{5g(;d0n*2_h;iwo1tixJ}-
z+iE%Wk;3>eHf&bxeC@nt+Jq6oyuDK~3R%W^Cur2=^Gq<RqBIU0LMA=e=+CZY36b7E
zJ0Ei<e9C0^W4+yBdeC%aZmx;Z2l{=J7Dn_Ub@y%jx^22`W8}RKkpl88mdILs51h4T
zD*s~rHlk^Ou8wjCKltS|e1~qI^HXw(X%pvw6exTlR6Ezk&IxHG|8>VihxLE@Q?k1G
z=P_wKCNXrLc}xOb;JnB0vm6u0TDgz{$-iYHXiTEUu<4o`Q~XUxYdTiwO)0?M42vt_
zt<nJ&=_(b%dr*jTp;;CD-tKuz_cpl|XG>{6+rdSPpGw-xI_5H@4OVFNw7DU7)@Z@D
zc5XLcr@68>KGvxK-tAGur0?w2hIJ6vB>KV6b_IRJ<}KL#8_ioryUDzNUwpeYxWou>
zgEgqiy?+F+{;xIS*YoR}ieC@Ud>zN`-4Fqqk8Z+!uWRl*oJAx59nM0KcIGTTDU1Ed
zd;x0N>`#QkvzhHr#WN^h(wnmlbmLYqj5I2rg5|AXjqdrkWqO+!Bx?$_d3jkpr9z^4
z(9aAD2Y#9uY*OgNCi!`o?$3B|0xy8ia&9#H{d+z*5%m5jCb;oP{>cVgK>gm>;Mnyt
ztQht2Y=jxQm%aSlH@j7SGZ~R^l)DitCnKo8(B(ERP{KMe20V5so|_ENHnaL@3S1tZ
zX<td`Z9Ac&UE=Z_GHdNQ`Si+@7-G1@E-kZA+3-=Ca{+DB=UVcz#EQh-bN~c-bd5)j
zMm@{ADJDR^A|p(%!0>>ploPH~4ttLK#Ta2WN~2?dgw@s1a7m#t+b)yU8(@&#%sdKx
za`@!%K9+k|Ip7NGwy^zT55IEexa1&6<5u+hSeo4CWF9zRn`$P5&TS)B&G^~aNC!2C
zlT#>f&ttD-D^qxCn+~m08qs%Z8o25hR>Rta(R6(}5g-`ryR?9n_KdmPbY^Vb=6hSP
z%CYW@uT^58A@^chULf3N9N*5*l78o8drwo#dAf2Fmes^Miy6PZ&$5xg14D0Y*>>C_
z!0&wG(pO-)2CSQmQCi-amDd?fSKklfQ#bj$nIz7nWmR@>u;T5TEI`t9O9B|1TRwX2
zd3RO=xsKgg@uifprBpT}M!MeH%E_{VDB;S7j%=OO)By0SBXU`kYuFF*_^|N-CX0RD
zIi2Sk{kU5cUosv2Mt7=h6TiNEZU=q(^a2%{d6K<O?>2xdfN(Aqe=<_5s9GIoKC46O
zATC-cTgvg!SD9Dv1+%V{qr%%gau@Ntx&(0oMG8*fX`It^8^&8ji_HO~1E;8&`J9cj
zRHut!qQUSniFYCZ+8vftDuS#c*5QUV^U_c$>zMM;rE4xi!LdO8d~USx$l?hApOKX@
zH#(AaauLD8bm*LgyG;UQKB0PT=1e=(QIeN;2L%MnUq8tT;reIY;*pH5^B97{ls?On
z%eH}fG?;?CH>khi^it(^K{%L7bdGT~Ph2~*DS`dh%BpoYy8@Egv>!}fF|%u=6Lxiv
zY-K&_iIl6PWv~JtAWS~Y2E1dKS7sv0V23gMn&NiD?2q$ZV{t#)PiKD;-rH6zv#zre
zRS_38YPict{*C!t0#@iWbI~Lq?DK<2l#Q!tHO(iagZjwM!Zw)24bB$kb)8eq^Rb8P
zvmB+W=I7u3G~Gl`_2*%k>#+PGa<#?}@)0JuYm#{z^R>=-vavlM+!nmH%1KUFRJ6B!
zF$U`@lGvlWx!j`8RyW%4H@p$$6Fx(55U_uj#qje71%)X%vxzu^WBRs<<dS#~|E<8B
zo#v^rN;HTx09rRBZxCTz69e0e^F`-Q6o2Sg?-~7@%)QY8TCy%&=yKZ)vbv?J5Z7o3
zShRYP4)bnn>E#er%-#l>87;*`T+=gPi)3lZCOgIOEsALl$Q{9a?#Kl)W)$xz*czm{
zr9yJcE`O|uskJ^taS*yOdBPvFot4v$J8MAwpsrcvUXHYJQ7Dz;?;=rX!=oWXW=VE2
zU)JG{N6@1iKS5d7-*hK#kc53n8lsk{&0znuBIkX%x<$#TA5nhc9jdI>x{X`?1iqhK
zkFrjvbtwr;*{?%h(4*Gs9OBx6AK>EH8}^G92||Q@5hrnaYf;5Rr0Y8M{tTT5^*o=(
zeZ~alk0sKW;>8qIB;<@r-Zcexxt4*I$9ug#sLW?ks`dW}BUpm%_(`clkWlXG?Ov~C
zFpp&4+g!|B6dAD4Cwn_5r-$E%Y?Q>>7~ZLKJJ<lF4tP)gL?QjAU(7RFMEKlMnE09e
z6!$=sG8weKYK2O$S~~IbCm|ES)oqVP<09=|BxQb?57Mz@M8<qTSSOwfFkWTW_F_vl
z+Bo=h;wG`|>Vi&k_)l7L$wpJp)2dGu$I7&-N}Ul!jyV66MH#i178m8_Y|i(g@WOwg
zUGsZ{MCcOn_MJMtj;&GO(Fh)J{G1@38`RI6f#fp0(>xx;4yL<<2~#UaqO3a$gL%)w
z&yl0>F${`{JS9FP2}*%;3NXA}3l#~RW8rO^opAu@)w^~-BkM{<QKic5^zsZuCA2CU
zdBsR}m+8Cw5?FTY2Lsn6|5!}YfoqS?saHvWCpzHl9j2f(uHL0ie`gu1lR`r5_xcBv
zKF#B_#QueTb_22!nI|v-exh?x&C3O8?#b|NWDinD%ykMsd7LLz38h_J!{1I}a;E~>
zQw+z-vr=bpuyb#EkNri}Tk^wk+Rsi3yb;)I!Yw;2rK@>Wf?ag!K2Avld5h|tOC_$h
z@7v*f4_#&kReUt0Aizn%IY9**mqjfg8AA;U*&_2?oW7E)&(E(%N&a-kK1vrVMd{H$
zX*|xT%)3p;NRl&*c?W@T2Q%E=;aT6o7Z{4w1c5FCm0?~yEbNuC^cwdJb|=C&FijFS
zjV8al8Luu%8*&}7DB7`8a*Tnetg0rXyWxdwj!69-v`c}b%S2%DJI~bcFf!3VVcW}^
zW{e-}#<45~f0x_XA8?0%O9w4W;6JSlsM8$7xsx)=273XWDrLKiJ{2H9bXI;VsCr6e
zREd#AU$k?$wg#9QwCIz`%*@3kw>-JvKx_E9KS<9@WP;G=TJry1BL1Ic7wOx)7_TMj
zrF=M=PUIaV!{km|fN*mKz2BFHKW{&Ia=Lf0b96u18v@tCCO_<2>Oy%AkLdDshyJ=_
zleELU2msJ2cBnqJ-OL~X9r0gLA2t;y>&P2f=Q8fguHxXw`_S@5HU?gRb!WvW8%wr;
zq04z3AJp~p<AVK|+cfCr*-2A373?Uzz7fMLO$%UgPBNs}Yc-4mc<g_!2@tl{k8V?|
zTHK;k&LwKT{jLiikeCJ=Gd`eZ06V#}Y^tQ+!D-!5-+1Fl|E)0I-U;&{{lWIZeOeB`
zSxyH84ZCPgW6i9P11kJ~_sM;E%i7Y>jj9Kn3bMP-YvC;G7cvFRA>4MoynOLw`vm*Z
zz3|A`7Za48LhZvBJlBIlZ6Y=u@%Cmt>-z;jJ@^sH(vLp|`EiM*xUb-4Ju!?U=7vh2
z%Q?D%^00$OiXzWwoFk<p@M0$f4IE1rL@7!^R0B@%3Kh{8n79--q&FQKX~xYTfyEkY
z_W2khK|}WeNnZ|oe#JgJ1Y1?pWm=lvNNSQjo7iX-m<ABUti##NWd};k^!z>>7pOEJ
zTa?3h+G|ZvS*PQIiG(`_+u@+lX|aWwY?qV?dR+9T07DoLunc{sdpY(<^RcfOLdu*T
zvLeuyMMo*UL^^CeHAC+a-x4g-k!1Zoa{GAW^yvEbZ>P)j8ix<$1e2k`1ohZE$MZ5|
zD3%vgEp<iPA@Kd@*<}GYJWMA&&rDkWJ238@D27>LORgbs{bu9xA|DwNKrgBUMV;hq
zieBp@V4W%ah_IoOO*tdgh-S>9C8t<Fn-5P3aV0T)F`bz2hJ!N%MkiawgHw!f4JC82
zAo7nW=Pq2t=&k)W9XoFj9;b`qVatq{+%}Yuh#?u_RDqx2yPC!aKZZ@;)iwRG()4^%
z)AZR%*mO|Wbl+?007iBLGI(ZpoH4SPj;X`|07@u?g^Iuz&Q1^&dypQGiym<*oMny^
zcKd9Rv7V6>fbnZ^=mB#}&xJ%PS<wDzUe%j7E$#5-2~vN@R{B9z&Zp(2V(c8V=w&AN
zI5s_<kJi5{hgs8SOWUhG&YzTm2EK7SuL1dw-^zW^Vd5EOW8(fz!*?++B?aJLHG~ge
zRGpLjbj;@S;Z``y7vpSXu5ag(<`LR}AcS+pcCp!VZ!3=!Hik`_uxXx!Yt)J?e!cqZ
zhZ*2_c5-+B<lE#BuN;v!Y>)^X8{r7=I>t<{sVHPxaNup7?kxw1HU&AJPrM@D3a5U9
zohKx-MA*{f<dJ6zQ-C?*THkml0-wOHWqiZ(i!3X}F~o)lH~>Uk@U+6udc&)OSG8zF
zUNee+@4VJI@YO(7SgbnFzBr7PnE&Ow%IO6Fc1^@lz=%(Zg8f1hId`lk^yY~yXF(3U
zMIn}cW_g!^h-BR<@zZwo^<hkb<#=TSomgk6(<0>-l}BYm2h43nUjMS9U{i_}FGR(A
zHG(pYdN-?12{tn3xI(>s1SZWqPT>nRs7Gx6{71TRP4m)>2rdV=vtQpdJwrlpHYfm{
zsS*MqpK!8QBvznEkYqVA5mr<z#yr5X;gd5~bic{2Nt$^R7+*e%#w<*rjFyQSeVU?y
zHOe*LpeTy9KQu#N2y~<3?@tz@9)N$c5Fg7z#PNSV7Q#6Iut34)1mgu@UTvi09=W^9
z;MDg>nl@$2Nje(m=lReX;YgUTVi8-LQLs-)vUiD9txm<tI+W)dhQmTMv7SQBcLhlJ
z@ee8h;`V!G-F=`0Ee7WZlSxMU`R({3>*3Lxj#^d!jQ5|zqvQR2E*<mV&<kDuwGjHm
zm-i<%%&beQgtv5`r@+cG9oL?>esmeDnVfHJFi>VRYjPW}(DvN2We@RyY=q1*U5{di
zM2)QV@?KX~%a&;Lw8ogUVHoS)UQ70rIRXwN8r5+Oay8?KK<ZXbsOqU&kT{z#MSBXX
zJeGyD4Es^3!XEGz^r-55XgQ6SL*T34#CVN*J_9eGY@+UA6YHg7d@JtG37T$wI<No>
z;2f`Q$BN+LPEq$!FKdhI0fWg?##~94Bfy(<IJxgOrP7h^C+$wAlsQQX!!b@eWoMNF
zn>b3{%hg5Ry&xM26}hs0<Gx#wxM{f6A_@1p$*e<oE$pQ@Sf6eaK<<&Z55#efvy5>e
z>k;}mlxW<E3Oh}xLz%B8Aek{yH9~esR71~7kE(J9dT5^r`RN$e1ONQFh(xD>4A7CB
zmlD*H0j1c6iB&uf)VclFs2FJjYPE|u(3Q-%C_am@Wn6foWU`ZRM5ezoeC1+--bm#U
zQD^5{*A|yM|LMQ*IxNtDcj1`8Vmj2<;xo?s5b+o@<}O6gbqN%q2o<r>NHY|emy=a{
z0OWDinvTt$a(=cqNOmwtnBEu_Wo~l#dupelK5*S)Fv!Swbc?G4yU^R?SZ**Nc|6p5
zN200F?#7Qc#F$CB>Ol;gTmb8eB#`~LU@^9HnK=3jjghk`+1%VuVW&DK<Ix+>0|{dj
za)}X!NqEz`CHyuTH!0?abZNy^=29FVTH25YgAR+~DjF<JCuU?U`#hagNA_a785Z8)
zrk{)a{37#mEZZ;=iu;MsosLjxnp{m#iFM`opW{S?$_zM3g^E|97?qE5h57_x3%1dM
zzWA+A<#}J5Mu#@htGrBZwT+JVH%`4%k+>qE<TxQ6aEG5o+{|qtWy9nRmenZ$5Q|nB
ztMso?XMK|t6I!p%l5T=>qdarf`tz#(s5F}M&8}7d*~e8jogRO@QgA*eI}0^NQJC^G
zAs<bWFs50kI37vDPSVe&)L}&d;PZMo<d<A(R5$uPBhSZN@_tp|G`YwISP$4bR~W_S
z&f$xnjE@L84?URzYGJmU*oEJ57t;AOg+)#>CGI!{IW^`2!=>}Nu}452TI~~DHoi}m
z@vIU?!EQF*p#3heClgaHWCM3yE+1rprz5$F3R}{~-b@UeFvbqQ4YRA$_a-@uhd0IQ
z*5rDWnN$1o@$O06IU{gvmN?K<*`o<NG`-E{fdRd8$GHY*>p}7H_gfJV5pjVp-@9Aq
z@t`=9l0UVVAVF%NgWle&#!~K$8+9n1lJ`4#H$UP~l}wTu8?bf~eytKZu}Fx-EMP^6
zt)A4+rOmSJ1>{8_$Vk)R&-`u#hl+t=C0+Q>u`diPLe~SM&p^dNdcmOhu?&{aJr#kd
z{X@q2;5=#Gl36R#va-K4i3hZLphQf-pIV6TfWeb-{x(N7fN@MyWSi17vXO|iBjUN~
zdeif0-%lv%V}3argWOdLC!F@sU5*_N-53<)gFm9Pn(NOoxL%rP8ipo5CXKbY!kM%R
z5tWSYAiuoKdg#|UxJLieQ6dx&L!COwW%|ZwW!N@A0*UMCu(i?FzR-uQL2=$XXt%v9
zY``1mRd2?R1WD1Qv>I1K4~7&G6)2PeK@b;bX{sZ3MNe^U@ENac9Eh)N={e}k=&ijo
zAWZ}Pwf`b59(%`<nSPYk=a7T>cHlb`{cdqoz9Nmwo(ifXxfRnS5@qk%`*NJ&LV9JO
zUOmObC*euJ4drOI*n^Ane4J0NBT3;YwrP0^>w%W3%?CdjPvJ)Sr+>WZD)gyNvfR(J
zL9aAqaT$97V44oy<+Y1aJx#jD2a{e*hHy=xCvT4xexyzw_AD6agtMbFEL~qxtrqsb
zx<!*}C%2Q0wv?)?y_xERyvy1kZ*>$nV#bC00`zWEt;5?Tg?ZhE)`5&twT9xk;FUi@
zD1WQMbg3`w3J6g(_7`rdfISv$XE5+Kbhz)1aLr#jBTXblia{ltZ`e9FhODjR@~6Jz
znxpl~iQ$d+Hpz%(VOn*Ar$WO7S&j0AFp3d!D$xUE{QTcumW}=w`OWnX`#MKo=Xg+T
z_Ev`J#roKw^uA>mU|>_Bh$jy!C(f>kZPfbDc@G(}CBpu|Kdh&~alJ?^dJt-c-`5Rc
z`t0D^IY2C^TueD9Cu5{60tj{9NU=moCKW+}^_4c8{!P!n9RGj9v~>Cb)b`u-13c9a
zMyJBMb;lPrtrm8vk-)(rBr@jUaEadBlr`@v6Zvh3xwnTZhE%AM=Rt$rtTFG8q($$H
zO3$Q&nduFNMp*A+Vldt3;CrR9uUN*%*2T3o@~8+dhWPbL)C9}Q#iXIWB+FLoWpV_=
zWrrpUO=IL)hkm3`)GDpPsAaZPn2^g61`?nsb~YWnnPbj2V3uC3OuIYCkw;qYc9NPE
zkP?Qc>Oc>71oihACb9E)+V5xMR=1N>mc+pK<YoQpKCBV{FYmggs_;^fHG74NA*Q9K
zsO{u}9ke#0B6r?o*LUc~x&!^(VYcne6dp}3ia}4aq-#d#yyW1797quK@V_RUhm#;7
zu|>Zx&WMabtY_CYNJnCQOl$@cEGcV_y|E3BLP>ISbpodfbigDuw0nbR@rc&B%adz4
z!Il)O)f7H_2>m^S={H1}N@pLTkTM<24B&(-`DvPuc}d@A*D+fM9XZz?TY2gtSd1K+
zM@c2)Y}ibSkh6la43t+43Gb?0EH-pL=tabFZ+l=V55iv<LN5STEe+j{+G5(&+k7&r
ztBPnuq3If()|dyCO0;6iic9kj{oxL+`P4d_+P(yYZR}v+t&-lq5&!<aLAmuQ^J7sW
zu45-Gh(fIV3~9KGR_;6-W@8W$OnerF2(ge%Ir7j`hRE2@7y<P7Cq*iNc0S{`clc#Z
zzw!1acN-@;kSHSRn-tzdL&MUH@WrHckRG&`9w-$Wy0<<`x~p61`26iJ8?W?lPQ6x}
zlnO8Dj-U&kcvtoSr~JBOl>{A_YvP3)(K~tXoqKv$V#Q3DCWTay5QDLKp1TOMTvtX(
zY2)F<!-5fTncU-4$f0<nV*noXF{TSwlmh~6&R~Jcj&n|hoSCiwj&MnIZP9T6Tsca+
z#xKx|{Ngx8ijGQTVF#8CQek-#E$Y21F`xEr?_ED_plRy6++io8NwM9;JF%@g6dyRw
zFa<M5MzWQ#{$nEH208G3KmJIAn>~C1yOx<2YsvOR*!-T{rm*K^)s)MdoVKO*fHesl
zsGEEeI!w6l>cXxX)&Vn&yCPK%vo;yC*jQ$tKNN)TYC6hi38t;igL&gs#C70HV9<~Q
zz}oKcR%dDWZmHc)e6KhP-*fLdXT$L2ck!2hoa^Q81-?uNY~w-V_$$n*=p}C<ytJ7L
zd~fIa?$Q4_Iy)p{^UUvj5`F#I$viI);xF%qF9$|Svvo!qcJTrq5z0A#9Ot}2obyI-
z&Ktg2AG>LmzikT(2n<Lh=Y%{aU^*hb!Fe#6S#vnuYw7S>HLV^^2ThBM=8$z)%}zaV
zGKp#Q*JP9OrkDr%yc%I+7j-G3-S2kTDQ>O29!}DCa4RZ~N9XqW;7{f*QVRB(xnk`!
ziWIDxp1m#uS+3gDr&x1z&49ZCFG@=ZmE1d|V&A^Uv9};tibsE!e*BRxCk*Kq)RntW
z<qHEEiPyawd#Q2xPRYlf`WVH5e)|LO8~-+#wCA7evy)D;e?q=CcL5roa?YLuJitV}
zU<A~3ElOn1vlFCr`zLmXOehB~$L{<VDm3R^7v-?vr6lEagzldlfDa<Q3McVUq<%SO
zJ)F#U1T=?Ch@uu_ma3!uG_%W`j~Zh)YZ1+1lq3@_;0}!+40L1vP!5b@s5E>NmuoOx
z2>`h(jNM0{Re&Yz6V+cz(Re%XuiHq<Oc5QH?cwEx<N0X4X2#?-T*c;R__neV<~BOd
zCQqmv)Nb%0KOEBz!RCaw^vdhy%~ze<JfB})zv@)eJ_0G+AwBJRfz*DGrNikc+>rgE
zc!O?X68%Mra@HsX&f+k`z}?LjBVzO8fO-P?_lI#l$yzYs-dP9w)P+TnXrPh+7G$FY
z$s!$_q;Wlo)#<_CkfP9A#N3`vic@B6jY}Y|X9dp<WAS~vr)U)@d~aM7L}x@_QWex7
zhO#-}@}ZIBE1S2$OqNpZ`*P_V7Tu^kTX|2EWRcgM;^Pce{&u@M;+>|@WNs`LX~~3L
z1PqFa!a#IY>?JE}U6KXmnMQ`bD)0#RLoU_#r{*LX;?2i-G034$l3(05Bf_6HUc_g4
zO=pj)WlBQA$ueo6Z>Zw44|W;D<6&%6OPkqO?Q~YxUP6J|hR+S(`7-*}!Ql%yb5<zQ
zFPXjacabM9_}<IMlWPnHZ1FT@Xw;DhXYsyw8v!8kY>Gkv$*j6%DhJZet{sIw(@JE6
zg59gQHJLXKfVj81zD|rM1Yq%oH*YA#E=U~TCf;(B`~2M<7TIoIG-uLej8`;}<q}{v
z4A8U+iP8u?7Zok45{dA8bQC`%pI?73QaPGIC#{3Slf9=uu_KDFOG7r`+hplIi8e6l
zCDgwxiAIjPU){=kS~q32G!^xX&GQ{m;dCtje|WIlR{6tm;Ir$S^+i&L>I=Az+Kv{{
z^039s*2W-cn7~5%{#rTcwxU;@yPOe{!i;xOrO>u%2=#^0bo&`@$)~rQOm9Vah%yZ(
zY=Sy8i+*jc7qi5WD1^?)Q8L#%lW2w*3gX8DSrDN*XJrXJ<}9pU!p&bIV24<1dUZ4M
zX+}fW&vp-XkM?#tOE9DQ&gVUuA%T=-Y8o1$Ee05b=jg51%lb)%8V!cd&qvz_&vs9@
zU!EKia_Wch-|xK#$2*5dyWW%i-5)!*K1ivjQ|$i%SFm#$+n<kipHt(<KT(JJ0e7gM
zK!;Yttkk*ydK#i$x2vYW*>Lf%n;u{P#PW0Bz~mLbAyVTC^3Y%M)T`8EzVL6<kJS92
zG9S+4Ulh`WTD&Bq6L!*0HcB?`i<VHL8MOWs?{otOJcDXat0%*Zv19>#c8zYjOa2)^
zIRf#jNs1uRffi-GI#^T)_}h8<x(9tBWc;3DPAe5-RBY{pZSyUj?$)J{vJD8@Toy&G
zS5H?;ZrfEivv*6Eq>aZE#?Hvl9~9|iDIkb?neM>PSTG!>`IZZaS+iJM!Kr4w2BmMb
zWLz)#x!A}}O2rBn;N?Q=ud$R(#Zu-#^H*d}fM1-n9f_#w5#VHP-Z$dwZJAUFeFEX7
zo3@N(y7+A_bD#BJ=%nM)a19s?ont6Ykc6Q&m`I}qmqL1oH#-0Mh~8VFFMd<BR8T|w
zLz=;#Gy7ZjeQ@`NZ_{y3;lbQui+HHAU<D)j-5NiJ$rwaqa+Q+7z4+r3LnQI2v1bJ5
zrQmMq9Y9Pw3J0@Qg?ZH+cx~5Q<w_5c-)U5N-xrtXa5OuJgXro;6n*dA_Y&3esyVtE
z&2A=T=tpMQE3fiN_o7v~Z3&6dsY5Xr_oKfcj^6iR5e<6PMYLS}D?xr`qXW=@|K4_-
zj_xmD7WLqC9n3$vq#3cpGpWD9xImTX9~CPAsxb|@opV?phho{mJ}rCx`Qy7j2hKTO
z&PL077-s_KJ$$Q)O<oM&>PPmI+6b;KK4t~i>PI9@Gvir2n{P-T&u$pnZQO+Y7?971
zpfzm6Tn_Rcx&7)sT2riFLn+yhfbjcXnpMH{Q>kSXYxmnrv2g{SC!aP-roM8kk(ree
zG?puM{HL$TQ8G-ua;Q$I>}U=u+AoO*H}9AQk!a7bo}2fJAo2u#&oi0@-EvC8mXmc!
zXeU(W1XUL4mEqptKffiq_^T{GznBQOHXR~o;d7g4+L<7$QH*_7lN+Dnk2sKjwkzJ;
z7Jr8mnpR#ui2au2x&Qn_61J@Enw`V(ztyhs>7FbD+r(Q$B8qtq7rGb{!qsPQm1EsZ
zSiN5WSQWSa>a^#nJjk;S->x0ik014asnlx>N72E2AE+xM)#KtH+~Q}&s2q16u>bSR
z5_38sy<sZ^YB#9_FyIxNwpFoKA~Ns|WID-=fl+as4c*ppcq={~JQBKVlGxw|vBAMA
z>_!sKQyO@z<dY6e>|M~PgrkGOQ8X(ddTSuzP_$bIv$A7SkJ9Gwzj6VABotC+I#|_G
zHW)04Z$;_`p?vsgQKTiCJoV|2vgL5vElG^TtCgBo!6esA;boALFrkjrFX&GPl)CHi
z#oxB~PvQT2PfpQ`n;p=g-Bl*W?7slz$%mP=e6n|R^3y41XWEGV0)1=-KiJN{qFp}5
zA{GMWafa)|Yu!5Zn`1*`M+u*G`wSF$g!iXs)BZ2_HeWs9B$xSHG*F+BzrHigYroC#
z*p!tD+Bp|!87eg&{U<Z=S$?j84-VTNIMN-^Ncs0c?DzMk0iPMUQ>OVINc)Czwd~nJ
z=REE7UW`_^<Wi{Cc=U`1rnL_GMzw^t8_0B*a}?!oV{3f0W)HLOr&cW3J2(mY<-Vb_
zaxJHLV>jtQK+r97r=Dd(;^Ls2hW{=)^u=UNN|nwYoZ33ieY*+an_<EQdDR37P#O^1
z-z*D#oQaKauhc^*sf8Q+bFc&6T_wd}#wjI-AfIAM6ybb}(e!$W%BH^YuEEc;ANm{Q
zEGoIE6Z-a=%xQiE^v_TBo<6<%Ga$(B(cPb49_$?+c={Q08bbVgzZe2WlpSV&-VfF|
zXTVG(fR?cYIJT3{>SiS2hJLdqp@<qFk{ZYLueyrlK=o2N=<ccscpSn+kY*v_-b}rO
z3C?$pp{0ab+xMhcpdb3Zz>%nz>)b+TiHPF2hF2{d8ZZ39kl!7+;K%<)^!Me#%j4ZA
zfGTaeE0LkoXYc0JRmCM*aQ#lG-e)E#p9rLNCvCp&e+Ne<2;Q6KMo;+>hsGKb<~cSu
zI}tJv3#OPIrs017xZ{y5U(Dt_WI9%db}{)EAD$bY3KLIm)zzN>taV33X`AN)uDyNO
zI`n(If2<3=WRx@&1#Mw8GPzRG$g=2gjX*9c%jqOjig>a)3`{X&O6x8@(3DTcrc8#8
ztR=U@f+NeZCWu|KN!wh@!=8;uGNZ72Fy=EjE2Ovyr7oD}oC{AAf{qiIl4TXfc@x3_
zudi+yAI3mpbuXHn64aVgxzKNy*(J;bA9vO};;(Jz)^7hk?rnhMH(#AjSp2N;n_n{Z
z!W1D^!0K25s&hN5qzUmMsh<jXkUh=@gUD~j0d!++J(vn0?Q=meAGyLZ0cK{}@9ZN4
zJK?xR>IxBNuH~wbZdBmg?%JOX0KZom@iTKv?0auidK_bh@xWZ&@GP5PMAjKaQw{QN
z9<R0GNoLmh!k4EOLjzBcQW<yDNS)h^E2aArlkk{72kj<YfqU?oDVnXO8L80{L!hK}
zULcH3vM7u`%d${C)ULn^MtuP?y%HyHdkgYs5+L2pWkcB^EA`#@M5<mQ3BNo5drfP~
zn#9lMe6Woj;fh$xqeoJD{XX~#1#`}XB)79M=%E|m-;lv*)!)ru*59_22i;9dwfpr^
z&@jlbZnwN411@`)Z4L&uwaL_LFLZqtE65g`j!{xaao?Wy`DWGPoE?rvL`lTQO{+pm
zPdp<A)m#=^1BJGcu_Lw2Vt~SP4qZi_2nM+K0Iev2&@`9)L9;N*o%eVg*UWuT1jD5r
zs^5-T*Q?*1pA*gOV+fu)a9TDras<sd4}x5_y&UZpHVIGwNHI#8#PqCZb#*gt>8co<
z&)uc*!EeX{yDU%0nO`lkPjy_juVntgB)&44FozjunZQYZ=@l?xs|>)}fg=LY+mDj}
zFAC9M!(7e{1!&u8<!}!?*CS~znIn~$5Pi3tjN>oQi+~m6b6qqc-3LXuIVIKnhpbeL
zQS_A6lVCf0mw+gMkl&Jqs$?{(ZgS%hq$HVxO-5}GqG<6m!kT^1?nDk~I3?S<k;K_d
zftWH}q;9rKvniVL9J%TY({b1QK9=8$kr-jA+Jvf@lx%R}1rgaxR{>~(#YKT5k(3px
zM2eQBC5d^1EZvYD>-V8^Bd@|3-$7V=`*!7)Wcij>9%^{pp3f>my6g#V;jcB7^y<<=
z#d+7o4J;p_Dh#h!KY5mcv(0;dG3hv}*I<?USAgla6ma8U`)I*doO2s-)D$yp0zcYl
zO~NY0%ppmU?xU3e|3&Eg(JI*nzblHysHxpxF?l{zp08}f=Y!+FTJm!&gOopce7yq_
zDkkQ~bf;J|XCjH2%Z*Orecz0iw&B!MkCdUuT}sRCazn=UUy=euwQm_?I&M7=uqE%b
zgPn0L9)>MUJcU=+OxFWcP&mroE)ED|MyP=%zKD&NX(lkX@r*j!eX@6ay8Z0g(dqHa
z=gOB#{qTJ6K>1SXAGUu??%5ySlj{&>p&etETc%{EKv`M}!A~<6oAfP`^W=W~BtXM9
zV#oly7D$N&+zzvSem>65F}JQ^E|^`h%my(Yl=98A)QpFHh%@p5p---Kibq!dTJbYV
z-qj^EC>fI^w!bQ5A|yl|qz4=rgrWxpAHgr~5H4ezm3-K@)d7js!l$e7)Vj}QrAc}u
zsr@lJ-!DO!C73F1k_s<K9(zOW79&$V%W#_OYwML@Brb|9>ji@5V6bj(U`3AW011c_
z2PATZ5AFAF>HB^2eg5vZf2{9*Yp(7+5wT4B+2k6e*NG<%#wa7Z2;C)rA%|R53MYsw
znXf7Gol*RG`c4wg3e6E$VVfm;c~VSL9s3pc7mnOj(!pi=4lW}WSX`#&i1S#_uo|3(
zujQKndU^alb5e3$8d=gsxx!VjBX&w{Z+5DY|F#8zcU83%XjUR`f2d@oc1z98T7_QP
zX=sAXWCnE}+k^9BoKG$;H?(vE|LK^!V**F9BdkTQoV@310A)a$zs$0Qws&t=4G0*P
zn1g=r>C?mxm2604&9eN1s*90|y2FVf>m}~RDk+uqcJos)W~M?Z8(b+%ypX8e=6ICD
zB6*W^y+1#PlIe+^d}Uy!ROrCB7R>#G-F>f-D49j1gq+F2@^cq5h^e%&x@K~K1dk+G
z^zkeDrXznnw2<dv0=Ve-nc-Wp;z)AX`hFQJe|(P_8H;j4e%FRxdv%ZuFzp0FIGGuL
zZ)PloSb5$-<H)?EJ?2Ln0BB9JewwSn1^9B<LO`t~cHUm<Lsejjh3)tDYKm1A5ek91
z^Daj&>i-8!%;rYjAhUgGOke19$=;V#uW>>t%Yc2RgxY37fRMcmvp7+jG)|yQ!L(cn
z9dD{jWPC9tDd%;C<=dQQHUWRnA@TO{_6xh#e;_Z~f|Iwh(cx3Ky5U>K;kS0Do{tJl
z>$l$%Z?MiM6FU*hIzcY*alQ?G|FZr{ewAV{#)UwB?A+!a6p3_9$W)0DxhX~+=8m#C
zR5mz=3NN#gLPfT0Z(<_*@!CRorsPj=!wdxKzId?gs0MA1F=-AY5`ZR={bOp2W37en
z(}Cu;IaOqVEyo0O9JY@6?`WG@CF}wX!fxDXsj9v})MsdyuyauqW%fi9;;<i6T#aqD
zSJ@pzu`GQn#0>}NPtg%%bu=ytK)Lg%^%nQ=^{X|dhT>hdPl7BHf+ZvX-sYDX0m!g2
zt(K<6kKOe^lEY7=hNDj3?Olssa!271aH3g?3H9fUnSr9FQe#MNFAmgvPbtYM3mJ4<
zQ(?%yLE<m8Yb-CM*a7Sk88pQYEJqlE>c}m9f3DOt)T+~pyR19PSnHtv!r%N2FZ|8$
z!Uy2azSC`T=IOh9kf-Boea+zgg1+<QTovoeJR`d^(R8xx<nE&KZg9GX_Td(49jt!e
zmeN^r|LxlwoAVi0hRZ2i?bxRMCXj{qeC&e%KGsHLm&l#!GLPCIp4R^A0mlc!3+WiB
z4lo+D2F#9NKo~DGZMv0e5(S=JUioYuLzs)yCD$fO1mwan8UthvbOB<44PBf_%ZL*&
zWv@7kIq$c{8^t*=x&0n)jeP>0>F%(#30!-w3PPr|lTjuD|LnROQ{^D~2<{@x#8`8y
z8TC60LqbwbkTwXgaAQri`@}rgxDbHqRsQ;wY7x86U&pR<GtJl0&~f}MM1g5`A3=rj
zb2CbeAGOb6o#0x<qFvrxYcomPBK6xX-NaSJ02$11b+y|42Y=2L$C}-DIY}~(T)6Zs
z=#wzKwkdc4uZdEogQ~VRNb3)zjjYH+V4eDX<d0(9gm;JtS8DSb#4jj9&|7nN>Cy%q
zWj!R7MDT1bp(Lf8;<QF2KbI)sU`BPjFqKTePqN@4mY-?C|H;V`FH0tIT8^PS$=#GF
zSvu%W2PRuD%7I4Cq*zZN%T`!5ZoWXJnQO&&#>Mpfg6<eQdyyq<hp1npCELyMxQj+D
zjCYU{cX?M7wsH2fiEFT`N2a(2UdPZs>=qTvAjZHEcv#r9%))DKTgzz?`LITi*3~l9
zJ<CEgX;cDHy8aF}-PB*jin*DOcL*mCO5eGwNXK)#DgQ8g?o^%ia)i0HX;Y++GrX<O
zP_8oNn2iH`K7_^zuE!#rbAZC#JOzwAy(-3U+?5(Mm|PXA!6FwYih_M2XI2SAgpOo5
z;cpaJCWcp0nWfJ>Ep!hi+i~*S6{a57oTMvPF}%J?uPdtK*TC7YV-oj3f)bg^Nm(`F
z8D0@Z`=<}a6>Y8YrE}ZZg0$M$-v5qp>O+M!uSNAi#+DSbS>#wT5Rpo>SilRSwCxmF
z7E}8IWK?-*9vIV4Vs5Nw`CE#MC<|oAdT*ioRApH7S9;eLNfGe0{NEow@>knNt4eYo
zUy3O-Kc`fK*E=)%j9H>aw55vqn3zl0&k<JHOhh7&KSV_&EZ`JZD?~g-e`!%dZ+&I5
zdi#-IRRBMsx>xnnNi0MZB=pr_@zvQZywNtBN89{_qkS1+O`{eJd&@*Dx)eHR!aFGJ
zt5<%PmKUBak`oE>zEF$rvun}4wYbG-oWI3-kiN|l-rJ}=K_ly}p47%fNNjhz(@W$N
zim@q~3A^qrAu^**;(q`QvC5`Z3mGKi>Y&jNyn+c_Rbk!c#wZ4<#+Ai)!k)YQe1WNC
z9KPgg(9SWV=sWRO@Et4#aYa=tsA4+4^x=W{d<Lf6em}?y)OO%ST_7HBzx<c2t7amz
zT+J|(gZI9e&^ieR-FG+yzax*2PdI@u{bs&k1Ns|lKT`QeI4@Y}ivr;9V2uutaFJ}A
zI#p5$O!$g5x>Ln;XJY+{<&s&EM;vjkHl__w)xAW6-&K>k>*i$p2s+rblPyMflH=Wz
z)5901vSj(j=>}jF`Hp?!TP8_y<7TK-#hi!<$OolKr(#D6KKw+5yCUb(F|xn92b?lM
z8D0bXxYi4p%cNdcU^N2tC1Rdb1kSNYb~!eMvUfktQbXiJX4P!{6IEnM>LT%a<zhlW
zNlKsd9E&UI1gs57g>B+z4eVD~4_oMYU6$cW48Ba~VMEQEr@(onlS<_q;8M}hIYEiQ
zEQXjomj4ig|5`55RJ)hG)h(=lJhSi(r9d^dKmr(a<v4VL7juW0-l&iCM1f2evz4?=
zA*q%I(8@-;zGBhh<)X}-(bk}Mk}4B&$tMJh$-4s>3oJy}tB2#PNUWlC90YOVx#ZZ#
zG85i99wfQq&hwR(PROD&B6A8~KAp+8-u^}F(74R_?c{#E`4OzP+S+G(aM*@m5z2%~
zu8Chd*F@yrD?dbhX6XQO&4_U~q5^8%)T=QZC>)?#h$P%!^9i&($SUSaz(_2i2wF&H
zYP+OpBj-<;c*#X84A(!KC*k}1t0|-6KkKI`b)p=_Y3>M7H#{LqdgR}=&#Oc8k*eVc
zl$L56+bWHoI_Gt~nj+VpK`$X*u{23mt!4s0q8hagqX;xY1W`9v%vahCwe`r7h83i9
zk;b~jU{D^Svm{Vkn(0{$XYhd=H>N>!$2xw5JNorHEoDA$6)aRKdpp~S_Gdn_P{&7j
zIo$1S673^CQ~Wd?R`ZD+JoEWbc^ar;wTtc?cwvWB=&{+*un{#ZxAG~FgY2wLqm|Rk
zrCQzfEXJt@W{m@0=EH>te7<+^5d)_079Vi?$Jzno9nC_?g&70=sl(+e9yeozu7{v;
zb)yMa<*L6SHaph!Q=qfQ2+!+Ce&egXX<Op=y8o9dx>F$|f$kICf|UK*Q#irRDppnz
z%E*2L!s!@wnZ?wlk6U)?kUOQ(@TI5$Rrj)WK@ta~8SY2E?~z&-OEe9&@<hO4ZqZLw
zKFjQ>;r8f}CvJvG_im=GGyTuj*vU9A#^ec~b3H@M`$^6DN*k_<K~AhUG$^|@lQJRe
z`S?R_W^5uy7K-ju9QTzJDmDF0ilUl$pwX$zeCBrUG9R6DvtxX{Dy?iaLDq@O<-VLa
z3vc`iVn1v);<jB)_s9qfc#o;wxtSN4+m1!O$zowbX05Y)u<Dk9A7+ytDR?eRcP5*3
z-J8*H0xnY8p<X*KcA$nSQe_DibqVw5zidq;zuBzorxfu>v+qVO)XF2ku0!-RHqILy
z`yh#etxpgi`6ymkUkl%S8h#dby1>s2$BQPP3;f*N?}BD*bzOBXY#|tYzqw{N`gl*F
zyMzafdM7#m1)sfl_X{a7J<nGPW=Ne5U%~`-=*DZ^jw|>(L3+^o4C!9fLnm1#he%IW
z_fsKzS63XJ5M8HZNq?MEDQs4$!Iec^gel5w9Jie1*nH6af-KGKrB51i^vgp>W+JVm
z&YhMSSq{e;S}I}=skAy$%eNE=JHeG}yr5sTy?yfTcq!(_U`J0|H!1DcvbyE?`5qU1
zFK?-3dBFzgU7-R4Q&+DZ&7R(38YJwx@N2ceyvhGd@V0uR=kwg?dDD$f#i4*-0oLuk
z$qybOPx?yFKg*R)&LQZuD9PdT()!AXle9$-+!(jHQF3a-dVp{prB@+pMM!7owmDZ3
zg2H|Wz#VYvd2-arCtgAHu0cD@2ZA-J;}df(%@Gxo`P_)glS34+%x9U)txrdnE5aLK
zqNZ<(SE(0Ar#}?^F&zR&irxS{oN_)vNuel9s%)?F;=`ZswF7CjFXt6n%MUGhM|`47
zLSXii%KUmUK;-k1lOF?}4945q>61~EL&7wgB}lBBZ`EU?OXFzhN~L7;X=GpgHSiI$
zUOW6%9EK1xb8_+M*7CT1Dsj%8VGf{i0dfR!t)`p0-oHavk*mz`-Mt*-C1jw@9m3Zf
zUuSiFh>~zv<~?3A-(r~MocQ}RIm^$nhD6qzj_NuQGj)%>&WxL~)otD_&0op(i@n;N
zk29v`bgyo`UF!*V)x@AK&aLFHns33)`|g1Hw=)H@sqihglX{KO$Vr9U+Fz5i4GoJc
zj?cYH$I3x13=wkyXKrLKns<;Pr5Q&#3nXn+oLlX^x|?}ny0bA|QY=Ahi+#!IRD~lU
zZ>M1SmL>6dUYitH!=fG95atak#n0@(QfejlrnJ#CW3fmVM#gH&pg4<<`7-KQ{0|<q
zqM@ge1_2ULM>TAAsQzM)uDI{eZRI?4JM<o!uTB}ewiV-`I2rjHk!mya-`8+8iHu`O
zICl6To)kYz{eu1h*{NHs?waZN#5107RWmLJ-${(y1NRZMj+6=01xe+d;H8C1*2g|k
zAqmUc6OE)~OG|-icfPJT>>PXInncnQd`FDnukG3MGa!o<bz>O2%4?Cdxc`iT7(v@m
zla%npud*lei1OmGI(Gh!M{bWfiq0imb#5jIn!rGyh)c+BA%3nAJ`=3itsE8Cvvq30
zbTxyZd8C=~ePJrMx^<DIK-aO~x7h$SXdplM**{6f;fjuM5B;!r@*UNVJ4TylIl_D>
z#4n|WRZhp_6tBtz+Pv6QAx8LF1~#h1JBM18rrEtUa-}A(e-L`1v&(cO{g<38LEMak
zOG;dt2Km_-FF6z^$V`r8iF5Xq<i0~fC*EKc?X)s?+`f&Qi?6UJW)x|+apIV0A3b7e
zGnRD?72MM~->Y1GAbAd(95CWj-9n$y$S7fD7t`eNbns?}Q}1DQ=b@L3RKAAv%^%$j
z$9Ji86XU-b(S}X<rDHHLEc__z@1Ts;^2oC`Fu4LJmN?cIENu3Ob1qpMuR6)5?`Nln
za@6xv55*Q2HIyaHpL!%>3PSMRd=U0D-IxKhPuG7GP@k@Q2OU%2EJN25?oFy&KG{3k
z-8q3}QgL5$^NRoc^zi71?V~3(zaH)WZTIMS7t5|uG0jsJ<zT)KnnvF_JUD*&eD~<|
z<fj+#ZGUg~;G{AKzY)RgV0+&Uh2GTD%WQng-c4b-I%&nC#_0vX3Nx=ppQ@K>KU&M&
z?1)-D&d&4UQ*r)nx8nUS<8f~2<SAK2-)F8L-rJhaY|w%HLb{sf5q2;0iBQA22hk4c
zBReMXpjwwadtjSEa^8_$D9~U~8O#)Nt(Ip^>cB65NaCyUdH0kmO!If5L5-}T^h(#W
zt(V)WAa!E@YO~)soytBiTn6jNZ<_G;F8{-R(&xMi=OoT0<8SFeYSc0NzuVj>xgCZg
zy~}J!#VV2E;L^yXizC8Ou9+Gmk^cDY30=Idmc2xUNd-$XfGW#n<8k_@-e&JWRzU20
z5QV}uewMirzd*jEGd|)1zSs-acajip)(gPTjWM)?U&&`J0Y8q_Sm34d0v(J`GdNeL
z#9f|hUb&Vu=`POj2YWork_dA6c1V-#+kN?ARtFK1!yVw%WsGrgDNW+<hm<4ozG?En
zL~HO*i9y24Y;sZbxMHnv@<x-#XHcIGMrjox7J_q!8qT0I=5Cg+t6K&);1;tiWd@4|
zkr0_!+m5Hvt_G^b!Fp26H65mHnwqmc+)#A-CRlWu4^PjoCzun$BfGc$X*C^owsn{o
zb7Hp)d$3mE+k9P0jD4@XBlC|=T)X_(7d2B~ot&`um0>ie|6$gi7(85PQ-XrPzXzaO
zg-{&o{|fLLQnUbIV+@jj^OFhspH9gC7y-X#BT#e>L9T^<KP$e25_;ThddPuR4k1?c
z2vs3<osc>GFpD@N=iyUk=8i1iF`GJ5{pwl7`Bp%jBhH7Sg>^oN^U>p{#dw|>d_sCG
z&xYBRGOu$a!-Q)x*w`^=L~zv)X3$a98Ah*hh%s6K0@!touODhylApJqJOP31^x*Jd
zx0Bp9Gl4(NG~0GYr0sB)2Cu#ok2)LpmPc3w`g0N9n?g4%3^C3A5WqBKb}lG3QCM~g
zSI<4W3Rx-Y35X$8sL$4*A*FNxE1lpVv}aUC2<VY{ah6RZSz<`A4WVgHZsvj7Jf<$M
zsKu?dpn6ZnZ3mv+U>@*Q%n4Of!i~0Nej`z6Yq$X{>)^>3miw=#Vy&Xh2NBS%Q<G$c
zCJ|Lj)OcH4M~QLvk11dI_`LBx`i_Uh5$3xNjABm!AC;Q%Kjx5$-@84J&hy>gbcR<8
zpo&+W$j?kDV13<-q(!|8iV%C$ppSDlI@@_fszfRmm!KY0-;c|cK^HzN80jS{Tn3#)
zM5viP8M+ebD&+iKU*a%41ENNGd2^T&#r{~3)^)NVM9nq)DIi+y%S-XqaF@yPqZ%D%
z-Md3fFTbel9*Yy2DUD%Kr8x7wMY7lInLo+UJ%|)@KuV9Z$xP*@(`|{iE5_+!_>~E{
z_DY&bt_G(QECpGC2RYjP8~wRv6EKLz@@JaS*){z0#+V%DpXGbvb~w!ft7GZ!3^PXf
zsR}y6IlaZwy|_a@$%GXJz<!{ZJW6G5ztZgNqkxHV@kuHfS&Em$dvqr2W$&`mCA4z6
z(@YI@$C7Z>L0DAs5Z!h8&qwsm3Vm_SFcl^>%BbcBHGw}H`&kbudxTIJ1XPLW_J&ks
zVK})jJ#A40KP9EcoL=Y&N)cgaaMz4YfPzd=CsGyNuuUIG?W9XCIz4tH@R9HYR^9a1
zUsY3;KWPq1rf$F5JO~=hb_54%TZTmN0#7ddx=K@Ouh=3bA%Z|Vhe~#k_g<X*JVlAT
z(ra)gNHXvv+#=1WFl@41Hnn+MMt{VU^wu5#cT7kY8WeRA1E$V}$9|d<>2YUV@7H+z
zQc8%{`$1=QbG5a(%wTPDB&d1aysBoP1sqJ*zBlX_Xro86LcJIt1I3AZopZhO0X2?z
zDVY7OhPux?GUa@W&tz6Ns=Be1HRg)OT&WcI$@3{RJEAplcbCNz{fzVAQEDT~P_Mjx
zjo<cpF&w6N?g2{*6gQe2{B@n=Sb=0JRajHT(0pca1@36mVts9)`P8~RH#0A)Zv-kG
zhnfMZ>x$w$eoPr>tl!LA7F2A;PX*oOO@oT@H)R?+tge~R#0q|?VqXygQ*p4uB3@0t
zRfD1L-@C&J@cT^6aZ*%ik#a?j^S3!h=bmMKM4%p(a^|#`lDehhucR(}4XT0l=$fQ?
zQ1@P6EbG<%F|PvVN`}+N*GIs(w9x03t^z}0EZAe{HCVu>>|<v|@2zZ9F#$j9Mtn0O
zH5k^BB&)|73?s$7=RH@XyHaInI@De4gwgtCvy*SBnW@a3+^4TIU8?4C-EAn`_95V<
zX7L(TX22>GwBGt5aM@eQ!*bk(|6b-p{BQbhEBWQ|Ph@aNeoY?#w7>h~tK=78u;IV^
zd(ZbylA_<oNs^lCmCJbMbWqmWq2ddqnSYzX2EC)SaW&-3t(S{yQq^GGwu|p}nuXYQ
zZATS}M)m3`l47nMs_iCuGsz^-KdBRUTM9NMc?cuSxf9MPG}pG&J7;}Ph_fPQKA3Hg
zerO?>iOd%Rn+A`AME3TN2n_h|_Yq)->sot08Cmd1iOTY%R$?YnxQNIs1YnePlV$p|
zQ<b6_M~(Ybeu=?{%I>hB^z8d-EBWY#!sk=UIrkQe+}oK-24556<;jS0;v{vl`3B+{
zF~6bM{fVW<e=~_rGirN%gA2V52D3>BH*kIw7L*S~xW~jK9xFF5k7gve_k;ZuCAcH(
z4w+l(cNTx;-hPTXx|?42mh}v)ijjO`DtvQ@u*vl;!HShdknrd8KywL+3`v_jJRMr3
zem%uZJL8mj8owZ$Dx5I6D5fePRti8F3pg+3EbFGzQXKoJ_{lIcftFOK2DoRRcNW=|
zplFXxl{swKKK#rj%hYE{nkCQh?nU-7m_5<3>f{5x#4KqPbD5uEQlu*>7b=L3Szb5*
zdTg;iTD+nGP!y>RtU5(rKbvIFa|vV@Y^~I}Xat<s+dlM`zMG@B%4&be#BW5!=yHK9
z()Bsjf;bZ<>EJ58F8%2&C*`!;#klnVBA-}mVJ?<1j_BW2hXDKYyx<ZZbb<*N7el(=
z_;jk?exIs`&wisBA>F&r$~iAI^Rj=P#oqp-TrRMpn_n#i4lU--iMIB=W_3%`wZikR
zxm14ZTf!<tKG{t%Uyt)q-+76jXo;+{N4^INpHEEye?uIK_V?K}OtLG13d5)?W{Bi-
zXe<H&^baDdTOm6hg;rHwd>Vj>V&mTnW}bqB7fK7ST^?&2;+jRLiO>@yWd;2eQz)>v
zu~&oOMQZLexvyjCyMgFYJHAKFOg3NHw9@xpb#5~Ov^k;cvg!ldib;ggT8&lG!kp5L
z$^n?~KAA4U6eGGw!h7~C_R`a<Itk?S=DGK^4ZEw$>(bqg>EI|y1L=EAUV3<;QZ(UT
zs<NobGDlVLvZ^@lF=qrw-+H9(g?h!nZNo|F;SP#qiH2ITV?`wYI_YB0+znysUY~_~
z>aVnPi`BX9o3stKQN5^Zn>2}KF_BWB7V0#ltRNP!@M?8cCaz@lis|XMlFZ}6vRPS#
z16YK|A_^5UM)>*TOHl8JkyCB-yl)-^Sd6uL<A+vl$@@AnCy5?Uqy{(^$}L{!9RyK2
zyv9T~Ne^om0fo*mODZz%l;cSPRf6=(wK*kd7-M9$w$;Sua^OF!`HsvD)lwNrl2!5x
zc?17$R8$!TSR{Hj!Aip`lqn<NihxWHQ3El~hB(1g!xezd2HM8}&H-<=0zK?=zLWCN
z>~<{0k%~rQre~17`-FTC^!6LDKKt3b&%pg4>%-QWazcSv;^Q~TF8?5`5Vg`YbMSPW
zIcV8~)v%O*8UOTIIVB5%&%-Ru1hhuI-wQ|8#4f!bz*;n4!MFV9W0*bxBh)<SKUtxF
z9V_Hc-=EyjeB971h()0GCqp!wA!?-4Gq|NWd|>u>fAl<H;CrqA3ouFxdB1p!Rm=e<
z3>c|%h~Zma`NK$%%x~)s^DkG^{CjwoXujrV&LxdK{OMovr+<kH@z+cHeS}$jev_qR
zD#dC^;J&%RGR~y_3!PgkVENO#<xlUH|EIlMJl^{z4ld0d{828rKYd(o=;IPx7{)>5
zW1L)qJ7b<M|MYVC1ADoE;23k+n8&R}$(4T)2Mv*$=XYtj5p=8%%fAbNf&iUmPL>Ol
ztZ!0<a&JaGK}l~_cpl~P1KzOYN;kc1G={5Ug5^~K+7t&yjemLk(~HC7UnM?Fv>%j4
zSJLw)C8<JchQU05$s~P~C7epzP*+OlgKcfj;12f35`@vQjMB2S6+}5vnI70BGUoff
zl<GEEe+}&^)`&!malaT0iYuzBL$!#J>JRca*?sJ8fhfgUj#IaSGZ}31XUWjKc!K76
zwLUTHpPSx7?oYlB%Y1oY6;c5Fy!Q@M#JYW5F&Ss5LHaJzVAB~94@bB**3n@;=YmQC
zn{*|l5F1TSRSpsFIp@S!cjMthFZ)gShU|Ow2Vy_qIVRUIlQWeUsmd~9X%**SU1h?E
zkBpzID_+pT(t$IJTJD4kD#C1EKk~qGk8A$&o^>llfANh$)}PRjW^22vuUAzia483m
zY$UK$^Oq(MuH*_B)e!R*o+p4VwTZPev);lqo)NyZ1?W%7lYo=q43^5wYI|P6nhCev
zE_Or=wMJuQbTywjd)_oXO9-Oh@vO@2&DGHH^BM~PZbpIVjyec#@nQz?;`5Erhuc$E
zoDY;mZphkODmqtp54gGBbcS@V*UwQ6rEb;VU{-|l3(bqJmKg%4=fxmNTDu)FD)a4@
zjYFBgYFOs~8v2CBq+Zrf;aVyY66g+rHr;XF16k?pIzoHq!#KD2MpO}w?}6>PZYNxS
z5%6I+v!l5?w&ZxX81@HPB@d`+d?Ai*e~E+}Nlk19I6$LEiEtMge(xmAAW;2+!F5tj
zM<bRWfDeLO>P+$haE8S!C+^2E9>thBk9y}5J#|0xact($)dCZDY!26gZ=CszdCrL}
zLM-%2Yqj*Tz_;wmkU}Rdw>JOBiZcx6US@xuGC9xRW>gFF7r1siZ~?#aG(~VVa&1{=
zINYi%1H!C|`oXX+@LuQ{WNJ+Y9!?hbO!i5&FyYNq!bHUT`<17Ni}&>k72n?RxN!G8
z)QQb?r}6sCwZ@!j^L062w**hqE#|$eyD9^+86{=-sY^IX=u-zOmAxPaF>@Y64}+*5
zzJ*kEjrCq>vE!J`=a_#paKLe?2ZoY2tDwMxRs)ENS6%}w4EKLCaLnncHy3R9VI3)@
z+<d6r((3N23Lutd(^<UL5QZMyyRSV4Nmd>9ta95Y5aKu(X0iO%PRP0x{xHsM2}LT#
zdB55Q-40a~cir+ZRcj3AZwg?5pE>RQ(N`8pOfhe5Ny@}XNl4qV{XQ?K&PkRIr=!ZY
zYqv@=b*cCg|3z;bze2KJmXbZPkR-|^=&z!boA>jsS@fqT_zg)&Eg;!B#8GV{>H6A)
z8m#Xmb6wa9+;h_3rerX7>bJ$q#VtW3waU~*&iYi7^{8XL-;SH8p=NrnF>qEUZbZ+I
zUxdPE%5z#y;GCnqhzTGPNi;NdlB?{_V89lpemWSePA<m9^qkXs6Oyk=GP+xW^7q{-
znS-mWxL8?AZ|3O2?b31YqrJ}U+-CS!qkHvY-qj%)@WRX@&SI5>Jj%(wIdF0j5Bo@X
z*<!07P6vZuq^9VrkAwo>{>DRtnmUhsmVs}xaR`UmIo&-vib)^`Fr`-4AV^(Z09%8!
zQZ|QSeEGS6OlTbeZ}b*j7=u(LS5d+xtF}CmQ|=|G@oCiPp@Sk8aKU;zc%7o6Tlk4G
zz08uU^cqE;bSNo{ReXZoOT_{p)vDRs*K_P`?fyphc;-IyUI#ml7hYKJ(`<VsWA=PF
zz^NY{636i)^p5`5oxmDz9jWxYiw4T9CmJGE@7MbA8ZTZ-+&jp4Uk%heRm>a8l^r|2
ziUulQ-r95QpLTyY8!dB{y=FGibwD=0h5Oj>33XauDVNcp;F$*zP1A8%j1@YN2LBj)
zqhA~%sF0=G{FXjIT3jKlD(X>675~*7FfL&>RuwUnB8-C9D?lnbGSykG&`51eHP82>
zVg#HGMu(tz4{L$-lCx{FxBdL$@Wu1JgAV_(4Fcz5c|?NHV|lz5m^9H%1}&D@6?T)u
zCiJr8Y*2LH;LUD4Tc$&LlyheNb1HNeA3)5Bd;R1N`ar-jy~7!Mr<pU3BE=XY4W)eV
z`DB8gNHB-~bYPue&4Ae3S$2`W&5N-e_7@oUR~YV9M=GCPQGqmmiA#%Kf*h2i9Tf)i
z&8yeLF7Rl>Vp=A6E(s38-}Q=&H3L{LjT|pge<@S$Bxh4Jnq6a0Q_(%$AtU7-s{`fQ
zYLtY~&H&|TQURxL(|mx!Y}Jh&_BKLu`Gg>aeai$G{t{Ar#q1~kDS$T3X+|&~bId4d
zveB+-l8yKr5@heOB=4=e#J$)<WtoG`PvyA<3*3}wea4MuV;sPh3TP6j@DfGEgr`6b
z*I}MFXu`}ZKnn1$K>gLI$gm?O4+FZaiLEmWM5W_c$Dv(-b?DY!Px3}m47KMsYmCWu
zf0ZMwdH}+_e~mca%X{g>DKl72D)v%w*}`WJ303qmc+U})et`xnE3e!X!>cybdjuv-
zV#m<}Fv*A0ECAsgH?3(O6}1iuw@M-gNcKiK`lAZ65ac~fkr`F*#u?ic(W-O(JZd<|
zhNtXVAFHuyZd~SFbiqR}4)=%5qakdz2x(j*RW!Us$*FF8#Wb1oQAtpbq9rC<{Xsfu
z2bCuAyg|q2jEEAHfw7#7#>HE}vmSbo841_+Cr*;>HLP?=H7Psn@~1irJ0gniRkU17
z?D~dO%JP(d<w`fqCz_fzXmqiie`$!4TlFRR!a0|13%Xtrkc-8`V(>F(XiTJOG(0BK
z&JU6C8dSq%ET%<6WdthEL_A?C0=peX%K6dM6^G24N*Q$1kcI+|@hRN8$+yYsW^&(C
zD&pq`^)qI@HlK&Q?yceo@BK>4jF(lU&iuZj#T6<wFL6e1+3m1yN9fY5h6c<NS3C<s
zP31slCwcieM|J!(JF9bxSq|%7D~Y1@yw(G7-W0*#lP7B{hS0VIgwpZP_%zmRh#<oW
z4SR{2!n2H6p1CL9ctmPzFIY_NO-F!P(MVE@Bi8YFhFW1!Ctm7kz8X94sWR}uO3(Ue
zhb0<467OHX%)TMSpGX}l@6u)D$tNO5RbVYt9Lr3WAXNfv{<(xa$YnlU>hNFbyQL34
z7-tpzl<o-gUXk*mTUU#+QbV)biE&~dd=P}UX&nQr)MJ|!U65|5>!n)-h$+9J-khms
zsuq&P&&rD4G(SK^-R>mTV5}QlMu1=_mIX0ZMrW#3#RdmF2-wo5F=)=%LsMsz%ZxT{
zUl2QBJmI;v%Ic~KfOf2F)5g`-(I&V?%4l~xnse=V@2^;v63NAS+qr^^9FM>J@{k&D
zDOYbs{aPgsG5w-w-AeA&dc@4*R#o-JiHXM`+&N9nMu&;`-a%*G*@Mi401xf~ad$c*
z;97)G%G!bY!}6Qfp4R)f|4!Dv{o{?+ZWTCpt@_5KGq4&cM<NLzMqqi?sI{=_iKwFQ
zvYh0XSR@huDW;}yAu8q7xd0*mgny69`LZbEW(&Z$E!}lq9_*c*9`EiP9y~dA%%63O
z@YKCz4|q-53vCNn-KbatiaPn&De(g_c`ogsX<XE0i3rGB(dNS&@pC2F*%%|<lNppQ
zKXJ<kVQyHAFJW^%1zI#-xEb?aBj&OCX`>TiJ7hArS2;#NpsI%rCEmzZ=~hwdMdvim
zt`O>65m#pQH$V#VX4#B8^T!xHIf8Pu;Y{cU`7qv5bd%l8njDNn_0L`(m6b3gdmv#9
z1*;lacgbdBI!dS=!mq?(+sc^ug!mcQT-1)@XW8gKLHH$QYnGB@rU2fYG`IlJPmill
z%cJ$SuX9`7;zIPd6OOMreX@J-)9K^=!=3Lz3aGO-(goz1q~ck<I6jk9vN%_S0EJrP
z{FyN(AjpL1%hO_vS2AoeO=9;6GgPu87|@{Yd>umt5HH<-gy!9KG>-^A{%37%?UjLs
z5V=`bUK16x*HJJe;NHw38*Z98hTQ(KU9AJ0j)%R=3}ansuaM*ZnZ+zkusy{CYfg<+
zx;vbVuSsEChR@!ngVM~82&r$v$w?6g|2*U_;m;ss0ws0mgH%1Ln(-ohEB1kN`z3$1
zRzhd-mwjF~(J!cPEW(?2E3&`tOy{&Q?+<YJ2bI;u2s%EuGmen*3Qvt9{PAQwDSF<!
z9s3369*t<9qi@qmumEKqhLihUag_kNT@&7x$yt7mvAvQJ;Vg56s#{!+kf0j(Emz_m
zYa^rS1aW0b?p=8PjUi=e%v`^T$6i8TM7TZ9ufI*uP6x97grkX}HQA~>9))_nq|6u~
zQ4&r2OE2qVnkICtdGdVs`QzQA)8m(qPmfQIwoi7S{dD^L<$iLHRtI!Rjsua;Yl`_U
zfOxXAdy0mlYnZ|KT!)U2;rJDocE%KN2aBEJ+m|UO(i)c2OA_^`Lvlw#P3R?Y<M2A1
z%VK;@v2<7HPQb<^YKJ}fVd^|qnT#+Y2y8*^3h~dw=cmWp&tL5Cp0d0A#`^lYG7Aeu
zKw_{HO;u?U9EDks46a79Pj+Z~9WOT>=KpY^Nn&3D{0N<l_)$Y1N5$_(924DnS8f)5
zPDdUgn&BGX!)Yge)op&mNolP?#a3^VmwBLQCxaSey=lLyv|a+D^~fd3%>ftDwW`C)
z54_E{kGEeCV$xocM<ga6OG`MCbUvyEw2CZzbK3|SueOhOG3f4u95b=|E8sAO**P4-
zx0zJ_&P=`<JeQZ*<f7=|TF^)CzF}CF#F%pso}wl6u7PVtvMyX*6lior#S)!C!hO>T
zTg}na&=rLxwux-P8N;n-GCL&c^j$v4F~wakousA{ATv{tdd66Z-S5zFTE$TEJ&*w#
zbr7X8^Ab7Yu7YfhxU6E_3wGs8+IK`#vppN(t?0*|n7i@Oqd6`|?sa){o|~-lT5x^I
zLHJ0eu<4|t7Zz(Jja*GFfuCO9HOxj24=H|smQ9|f`S^&yi|R4dCgTqg&K&L6Z1$8l
zv3)O=Os^j56^^6<ikp$1>v<5H{Q*@`Gw0Mi33r<>x7bj>+?F-}Egj&R>oe9U6Tr+3
zud$ZJm__0bJ$C~0@vjf@)1_0N8Fip;Zi0XLyll<9?Y^Da;(ihthJ+Hp*GrVix-GmH
zihfJ4ti4QAi5Q%kwn@OSaKHL^#14lBn1T*N>s$FZx>Eeu?2+|wR~yTx?FF2>vZW8S
zzirG5Gea4{=SE><?w<V6-S?zg#>PQ2{vmkZy&JjRXk8;rbpZc=pdLXd$$R*Z@C)Pa
zS~(?sl%sC$CyAc4K*I0tS9h+G%2|^kr#a@o;3UAsxOE#|lNA8yN-T2xp2U`Q=C}}*
zkZ)Hm0r-B7dY3Um*|2A1wMUIIx(jf&BhNVB5hnrq0o@1i+OrpzcsW3Sr@}CauMG1~
z-^$nfnhTusB8%NdZX|n?dAC^eI|>%WuWT~c!R}v*rM8lZySK~a9F-@?WM8C1p9hyt
z)Fn^Oaz^sG&xt#(6<;9S%X@9obBr1Alr&p)w&lzN5|A|*H@}nI<_(U>kqg{dbKF+?
zraJDG#606fuHXwQVJT%&>$X9+`pMLft^``>Wi9TJTys9nZr-yzq`#eY`(lFq^v0SV
z8bw2vbSE=##xkROL)Nzv`-u8D8V_VgyoVF?HAu=X9O~|cIO_}s+JU8{1TvN>ot|;V
z$ACL#zBBD!1hRD%3}#*)uWS;QnJi{`f9CoO=WhB*LH5T~7Zjxx9ubcNCYv^^p`l3%
z8;acdXf!Th{-!%}VkL)7+T5>jxQqP!Vt{^2S-+om^K2M7J<E+-w^cb=v<b^SVFh<+
zZ{U3OO2$igc0ws$0(~}dpzlT~9ru{vsvj}?S+7^wNL~&;nSf+fj7i|gNg9GbW4Ynx
zIq!~_tv!_fnT#>dFx{i{3YS9s=L~0@Dyux}oZ}eB*@TZdGoCY#x<4Xz08noA$cU?{
zxj<Zu!_DUc5J(i6F>uqBwUtCUD-UV`K$QsM#E;Mbj1686L4JJ$VD`n15Y%EAZ)}7=
zVgML-ne}LH*mK2^0~WQq8ubqlW6U+vohy)J@7M!M=K@9MF@O>&7i*<7)Ub)+M*u2$
za5}2M>g5hlmXXnLl6`1dh!Xbq@^-t)4EEV?yT*-J{ECzA^kHbXqZ@=Rj~M<AUU@)<
zq=5xwa4mjyAAL<P(zh9r=<`|H*!mlzdXoW}7v2UVs>7p4SDU?UDGOT9USt(Y$Txyj
zv65rV6i6udoee2?5>+HqM^RO0?vP77F#1z^2R+cdeUw}az|EyBh`oz=79+esdNAuz
z-hD$FA|EUamDER*Wg}0miPD#q-_$?ZLhn~R))o@1=MiB;MbA9AJ&y<*>(?XgRZ;RK
z?Q$ScR^>n3tXS_e<jGlr<YJ;Dews_ke3zCN6AbRKE^z3@z@a<7t)i`W*;j_Z$;njK
zH2lOlmkStePOioCIl_;SUmojW{2ufW4}cWhN|jg;`yOm2&WX2qmsj1gN_a#a;Bbih
zQ1txUgkvAAhe~(~Pf+z+Ab40U%ksAn7tLJl^~vfz05J8gC6Bk)*>Zy0o1n@`1y~G$
zTj%f{kDcXlN<6AaS%Z$`3S}>=Iu;K<$h(!oykQ6^vu-~t5Vvku{n0qV4>4`9jrhKc
zXL+)>a}vq&A%hVDm(?EeQw`g|kFQlB%<#M{&3r!X9Zd0(*ro!GE+ffD-@#S3)8~qs
zc%JHo>$1v<<l*^^d8sV@OtM0zYR&ts2zA!8Se8U*LlaGrKA{w)<s>BIllI7WN}Clu
zr9vqOVLqa0yp;8Q`-+lBDc7^F5I-Wh-0np)95!aFxp6`^r`XmL^U<a*kz%8rw1cKm
zg^07PW}MZ=MEO{Il))PlB)6v7bjbpH2JETH%HvhP<3yQrhq4Ai(z9ZukxNqs(|<NC
zu%6_1LbGZcjy1XxtNW^n2Ha+!;Saa|<M;CcVCLm&NjLpnkk{{y{(;`_Yu!&c#yWhy
z`Q|J9cjG_5Uf2KPpPS#@TmO%Zui)RWzy8n7d(dv<>wDj9{ztO@3FlDznPTFbB>9i&
z86fYpq1}w%|DYcZ<WSj<#Zr8bO&%XVNe1~@HzAA&9aJvGr9Yv(TRkf5a*I@blnD^S
zVkc<7#&;=4ZJ+a2mE?kQglK2Nn0JcNHR(87JMCn1ef_^zHvub><8<&grS!7L>9C&<
za_D$1*&Ym7AyOizLKbly4qd=+m^=y?1L>3;;k#yuoYWC7zAyd{ukn5&7~grDY^-hk
zH_hPg`o`UR>&fQ5`}h9q{#RcmgXx>>G65zu`9ELa`*)XDy_o||ZYLZ6{ok7%{O>*Z
z?F*dEQFcx;Wx<L`kPs+Ddvc9WcG5u(uo&j)TGF&Ef)$X=vnc@{B~ns$Vw}o!+?BXn
zE_Mg~U6xGDF`&p6fmoLP>PoOZI&6-x?i&WHyI@Ij3z&HL01Q?yr@YD73%+-mO(;lz
zV=b5(tyAWNnI+f<5=d++tYvzJx-Ppj*h!Me{)l@o1y&V(HLP_Ub#sD2yMr{p%*F_#
zWV1RE7*IjPOa#{1n|8C$G#BN}g)CRmox0Nk@7=|Kf6Cx_iHiFig-{E4c48&w-z|d{
zcW({OB4_?&#q(trL8oEiex_~6CnfR5)K@VsWmf3Nb(XQ38r2nW#bNY1ybV*iEGAew
z5n%*x!;#L>-9+>u0FSchPp$w1q%U*t+e~JoF(x%Yzvf9cWb~rEZT5VAw|ATzA3i<#
zVf$z|fxllI9sX_a$?lWn@lWvMZgRByZ1>>gI01$<**QEoIof;t^5pR7IQifI-9CmF
z?%ctju&eEZpOW1lUjS=*oE#n{d(U6&??FG%F>tddd%MS-Wba^S|0QZeItlcW92}l-
zwpD0$a@fJ~D6>Q5&E)WD@_hGb=R5ei{djMG@8l<%(9^w>103!tjJKV<*giVh+j+Ua
zeU!X-dGzA&n0mu?J=r_n+27uKzWW4@_1*ytob3J$mX#cTw+$?cUMKYAE%Wg%OmX}1
zKJ`W8z%n_z7p}+swF6Lt+3k0d;}^R-d-%uhkGrsx?W3PM((Uo?|Gb1o@FVv2Wc&H{
zGgw?}23TNAc3vLsKF0|IAdX)?K0etyd3my%JUcvma*SO;_s6?Of7{#HJ${hvA089L
zULNmuV33n-8XkH9aKX>;_v4qxdjz<>gOlB(qn9r*Q&}53`tI-t%vYA|Y{T162*`&A
zv}OR(;n7dnFT#WNpp*RY-7Y*oLYNZNwh<P`0KJ_P>`k?VQ30MOYO%?|?z8<pfcnlZ
z{(6WV{jhhu+lDRMJH`fkJn|3QKhYXr((-Y$U~c@ULf#H-X|ne;*?#i3J)FEW21GdC
z6QntOiai~_-1$zRzec(LZ~X<t^TD)-8Q!nUyJ%4_*Dkj7a}WlG1wK<vCq1}}shxO4
z=cq!@D8BED<;$#h4`Vbi)~}NU|5`b$wcKu@7w1Is0(27n4Yj#`-}wBCq`XQ;m|~^c
zKdL`Yxd;I&IgJ12Wj<`Bo#d?jMJsJ550lneJNY(All#dT-kb=P{~?xQ4CDh}AQJN!
zh~)s}&)doK?%rTrT;C~^rQIRi=2<r8@cm<a>8WIUSz>USL2;IN>9nw#24&^A%=w?!
zon(j+lwW-D_gi1^l*yaB1yApa*Fi$BwI6UJ{5x45Q6v7l-4YnJsN<mF>$--oO+yUh
zhrjRx-{`$BP~d?<9>_EJb7h4dy?*e8efFB3P2`D_1x4w#x|)Nyy55%GKe$ae{$cyY
z-of4p?gYBJB7DS~qa_>JPO(6({Jq{z{%Tw>*!dGgV3-43C&BY?6O5Ke3G<Qn!?(#g
zJjcW-RV=z?kVuA04HBIhEJ}t_%tGdgB`9uvLD@yk%pam}Awb1$HP>}RRKqQXxuR2r
z`W=T*zboiq6TwllDc(@xWokE!G#a#FG^pO^v~71V@>}$kGk7Kb!dctwHvG;K{}&Ez
zED(7~SjW|Y%dYKh*0swc)F%lW{zXKwr?~}_>)_Gsum$mS(uOu(hgCuY_c&6T$R_e1
zT}^Acm!o#lNN;G1#lHl#DzqU$FxHcAZ+#)C-ohVn0Qn&~10-unYx}SZ57VR_>d@}1
zx3}uwM$*(x+LeHlTc<1y%l4!iSLLs)TxiK1`C}jnLHXO5Q(yu(zF;_xV5sHM8U6=-
zAV)p?&j9~(iT@csu!IbL8N)Yyaykf0sUQP~5i7Xe{~{m<4;bHv0D%8QeaIJIP{_;Z
z63K&51OUqlw0)4k(}(`kAvzB6FDs9*Kj=Vuz>El^OZaI35LYjueigtDk5>tCM+4fD
z2lyuK75-xTB2;hTlH~=Q@fSv0^Tmf-UsR_GtGSCMKWJ)ZeOqRIG%?p6yBiH7U0|th
z(}nHht99<=iyqw@FwTFuM%*=>3z_f=ZVUap39WjxA#HAYX`5ccP}uCULtylq4Q(@=
zk@P};)4#6ihg)8!1L@GUfCh#dj4tuPD8(H*i)=I;#t~Nf8TDqsg?9SE1BQv*M9?G9
zXLuhry5$fMUF&e$0hiNu+a{y>f?=!MxnE@SamHs151ce18h!gfAUbnTKFmFhE>B}?
zfoZ@iqn?>Yk8xB@qwAi05R8F2Y{3)=ktKlMbOvA;b*VEwf7Qtc+=L2V4h`hTTwMTw
zqpt3RAO#ObDR!;sKRv}#a&7glCHJ@*oQ_}?edUv8x}f<ERUdSfj2VGwJXmQ~2@1mx
zQ?^q)8c57e$HaJeNrQj^X|IfRNg?y0z=BqbsU#2|=mx7+xUbRrJ9J&hJ6p-=SiOT^
zvFHQS8bj7$Vq-YVNRIITfCin!Q08&9G^bj<KyK#hY2|pZzCce_a)v<Dx`^}XFd1i<
zI+5ximgwvNw@>#?LMa=NyZzz|I<2$?h$)B}JmtWeMav>!SE2d4f<2{6$2*CT{qFJ?
zU+`X7H1jv4{Q#gK`8RKU`rBCEGn+17-F@t1%di6jAeO{{DXU)wgs82>7JaY9!>w$z
z@!i#p-_%4<(f?ziyzIBs|9`dl^;iE{(f@z_r~dyp`P^Nu>anc~zLUJjGjuXOD2j3K
zVw#u9!%=r=zoe7o{1TH)^$POM+G^}8rq53vro%}-&fdrS`U7aiwMv{7qv6~ZRf`)X
zw5VBct{0C@<)(`9PpBFHWU6soUraYnYo4tV*UE4U>znGtHB#Z{(<#Mw4qyCqwD;`0
zljOU@{U^Ie5%u^IX~&mXG5+L_q8yLw#@%uce>m7Zis;CVvUh*?qjcm%tF)T@hB|Uq
z^7?A>o9f63=vqyFa~-)X&r_4%P)E+27plo`sw2nVd^LHqj(pO~YjxrJ8S03=XG_A$
zTr8<);`Hf1gd?A)L!b?B{pZ9SrR494Kis06M3c;32&Hq5<a>Y&;g~D7Ebhx*Vloo|
z=_&lV@eT0L{-b-Fl}F!v<t0O?bYc8eVRakdfEd@VX$oDdruQ}*ntt<@Zu-qv)btj4
zl-bxXbhXaW_1e0Fnhb=NQga1noV@7JrqJ7e0Y81pJ3+x6yYjjjDS4~YkG*AZz-%$A
z&9A>EZ$W&J2irfY(vCc_a2YPPPWJ|2@_WMvGkd$Y8Hv=3w%qu}<RDY<B48j_Gb(`f
zkdlH!3q1`c0|^1svuq-j8Cv`xS<XvVj#FO-s?e3niO#SzAdnqT-kMbiwj^(HvKHLX
z1!_D(FlveRGP~@Ku3NXEYY=;6pyf6Q4O@7bqI*Mo1?MFQ1nqQK0K7iV;91^3%czrz
zcbS{C@^Fhz?A~T{V)r(AVz}U@iNWiYiQU_jiQU_bOw0hUlK;Yvz3~l?jj(MRd*hqx
z*c;!-*zjX@Y}_XrdlqU<OOspzi<su;Q+-IA(JY2vHpv~27s1K0gX6+;2R~f68Pa89
zJeK^nH=HjC=`#Lte6k&f`8bA6=wi@c1t{0g*FO(7prYwe)E$IhU{07~m1a|O2$~L2
zJ9ZFiX5^oSx)abiBY{TK>1o%TfI6&i98WO5>BI!i$vYBtY7zm;m5x|q(SiOw$gW5)
zq$r{wOEuDie=`SC<3flhA)QyR49E>s`7`r*$xC+^P+%S+x|xhVifZoM(!+0y!I%k4
zVKw2pgsivBgEll;Zo+STo7or+7JT?9Io|tumr@9>CN)q&xB>JDaJi*q(rQJ;j#gHF
zoTcOLh2sy3l4L}b!IlUwmeve8+u*$Wj!IzuoqjRJsH-7KWiVQqEI}VjCO$&<r(Vo4
zgP;Pp9b=uwFgd8WwFFU*P^;ilR?7~cC|f@)cEp(&Wici_Pd-ElOFrL#12R+$0TU83
zN59m*FDp`v#16}wKEf;snB_4-%@`fqs~gZFNBfOY?V16))3H1?Zrmpp8n}QVCM3dT
zF!b%Vc-b12%XZxiDhZm%B7%#-CHb*Hf;sCoG{&pYO&115@Dc2<vIKK=OFSR$CGfR9
zx5G*WyG(^{dIi70`;0qfceIj#nW3`f-IQeqARkRzpchvMm6&V4hJ>Q{Jov+4@b#HP
zug@Gqd%1H4XGEqgvI=>e6(Nw)Ril3oBH&6AJOhX%TU$ENfYB@foR?Nw0~lI|%VI=_
zS5`I}!4rEm<>K4D)#|H$%XnIA#|Q8r7^vru62ctDs$la*4K`Qb9oC)%A*3%y=i{^|
zSsR3EVAvR^?i)MyhRSRaQcI035;x$D>|D}yMK2!de|y-&psZT5q%WZVVp2l<c_UAy
zUl?Xr{6bU^<S|^dkiA)(4->I~7`Zy^8Gb|DIX1AEhof^(DMLOk4d&s)Y|MAGA!`ks
z053sbj{e;pVTfh6D;p|-i$FX%OS^AYC&g-iT%hL$MbGw%;hjlR02!v#z`P_E#_VYx
z;A-NfFL4+ShA+abj9>3%`UWWXl<6b~Q40rUdSeSCbf)yDRH&IM<p{k+(8?vN7%xXY
zc!jI0PLkH_dfDOMS7fT4s4T&4I*d~~?@vW~sGFjfO+&`2o6&klW1A=1`wi=M(|h0J
z1N}FekU<@IVVbnW!_#;UcyN;DgE&`+`e*fZQkWykhE2-5vD_;s?if<Lv+GILbW0&R
zUIy=cE)fbdQ$0%Jve1f~2Yz57^-U**Ysl+cev|~ttQ$*JZjx2;sCJT(rZXl<%DI|r
z!%d+oG1X2X(safYNR?=AAN(&!Y?zs(1)X*fpXePc+V3$3mD)=tV4*AWS>pxcbXv>h
zwA;<fGQ4u2*_=0sMO?ULA6Trk-I@Usuf(4r%N8%-oneOUOceH2W{W6JxpBwxph%Pr
zT_vLslPs4_SZHiILehja$)J03#v~h4rk=tDX1oWMU0Nf!6LYj-O(!-L6uVYnx(kd6
z=b~$LU1(w`P}^!axnYUm3#y@cm0p(#K`QH&9q)cJPym9BF~$N;kA(nXK%T!gv@OPC
zlpX<%vHaU-6m8b`r8N@*A4qI?CuvS!GM)|wAP>TSM#X4~iDX5Rv!+D0vsytCmc!hW
z?n;T4C=0<Rh@fF)q>9+!3wg5A&TVA+V$6FCC*w?fUPeQ{7iUBC@W_Qeti1}_m3xTQ
ze(-<WlT5|GII+=Zxg)Uv5>>phB!{f9bp(eKD>cy^WFUV_db9rER(LWWHeIUdLNzB!
zX?0N}<E#(b51t5}^cc7SPB#%w>F3brSml(VD+f7cjHvXbpg_<&;~?^ps~dGFx3bZ3
zdcj(>=Pq=kI<(U*Kh)vb1nu-gI{HkyWo>5}dhD016GHPpqn@wkd72Lwkf!EGHDen1
zDBSUC=7@$&a{X|A069uDVSzIJtX5Rfv(G|1Y%B^$DocQ9!%4q;`P-ao7N1>Hc5o~m
z+bzc9>Bx+pjMD2tkvei)u}t9Na0#vUU%BW3FYZ}PfMChkX?}iSJr``Hy$x~-mc+<L
z6SK^YEvCvek6)rPj&Fvcw8|&;w~e(bT7(7{O*tHnEPF^Y521EsU|IAQ0c`x^6R0UP
zNY?|rklDJkYp2Y=P#P3+sI20KV*+Y$A~w?5pg3doHu@<c$H~eI3EHAYkD(0?Tsvf-
zsW$G;bu($yobx2%NOA#R;c&C_vBYqbUs5_rUE1|E(GL%k|LtYj=zo!10j5Zeo5<^2
zaxr1Hk%sBT`q&_T(+TzyQiF2gouoH4#fi|9iZPdi^2ZsRre0|*CW)mnG}4}#jBI02
z({*G$VmZ+fc7PL#8d>ayv_}sNU)|;6(5SSKTZSugQCiuwr`GTBt!$()8;LtyvDKT)
z^hR>3aq}hEoccL_=apa8%SpB6jU~>eZUb|4bGIAcwCC&98k$31Jk&`>HkDX#?DP^7
z!J>@PLf%`Dj<8duuRWu5@vcIX-8+-?dxpZVZ@pCL(62~w0KK>`CCO$Tx<sb$QtDPK
zank^g9<A5*N6zweBqH=RKB9MO8_%m8F}fB&?s;1w?51Kdmn*Wg`O(IMB!5^_rN}b}
z`Q7D#gn(@@m<EQ96`R+>icAmQ@UX?f0%I@pelP1MN4rn<j!#c^k59r#Xsm_dIdz#Q
z_-e8q(UKiyqjBUS2;h;}%1yNh7J_LshNk`2(q9LI-rt8y9c63{Vdk-t<~?|)5>1$7
znEpwEb}-+QjAzFxX(X2k3Pk%!i^Bo_f-Y)(zq{g%XYn@O9DW}T?ka6h%dG3Y#Mc((
zhQ_?`leawbc{ZVfUj1Hr-MT$_t1}$Qp0-*o+i!dFc5U+Z6gqD&Z?IQ?dxf9jh<Yw&
zvpAi!xOHF-W^wA!iH@zo`w}Y`!40$V@FBKr8~cuJpu7#dJ1Mum0fzJwYS2aKu!1gt
zSUE2o3@c%7hT^;7vs%n{F7rRYb<<R57@y3`{8IIun4qI|Cwent0*uBHB0W2Bx98;q
z?uzS04oj_oj^a}Yt{dIM2F{JQSg1J>N4DjB<C|J-r>{j3$pc>aC4Yrf0RLFo(8UjL
za8t`<*jk_8+pN|8#wT-cQznCdL?=@jisgg+o3CoM;qjrq`AUYuKZ2nIi&SX*%LDW@
zZoO+KOex?m#W|k*|LnbKV;Wb|D15(;e?^ChEsz0A@{&Z3oCizDW+DlVkm6)KzT6fx
zQpZ4(?nX-{xxf9b?QFduP&|3&KChXH1>I+@Q>RW<omzr~w=4#rQ*Phu7@dvxuRnk@
z0Csj($`$Q_xw;Fp+m(MOv@4MKR0+)$s>rCYR~f!}a+P_ah9FfHVI;xY80>C)Kqc)&
zQVgv^DZKG?>#G-E*9!6T<x(v?#umQ%BQ4MvzA0$IF<rcK3`Mh8x`oEp=CiM!ef{*s
zvp>|#W8F*<MD8(~BCt57rpt|{Xi`fz)A(j<>*>?4wl<!=`1<*?ufBTz^~Trp@fe$Q
zcBT5<ceMF#zPe{Oz(BZ~T(whP`w1K%{t!FNZj=1ETJT1WtLODcN`LrL8=$EN3+lbN
zXT4{iu-+H>iUwZz;ke3SQVha_;^c||(;VTklqzh&;amfh!<$(db6#(5Y(2}J%f%BG
zZP~`n*Bcww+}&EX_E(06L3Gvo-?Qji#xCHVlKNH`dCug%pjMZ6>N)`U0=m!vp#Bl$
zeY%y+23<B!qjg<O-3t)?`SYjGKS4J|B-7SK<7{eo6`{e@mR=%jQT}7$+xU+HaAQRX
zf09k`;@N-tCU~~>&9iS_e6{t>r&y?>b9Ci}G9&sQwjKWSK;5_xtpCWy0730jY>a;k
zVfk<08#w~?AG1CFBzXVXJ7hV4|Jyf759X945`I0$ppu>sSXsRKC*@vUxuDQb3!W&~
z*GZcPFSo2WMg@uCHqy)z7-b+S0yBBZil?bxQ-jb5={6Uz$1nlmj>F8wxG3TtdR0rq
zSj(=zQ3($fpz0p}P$_Z}j1Z3sV;l*pa<lRnjDY4==b<)e<g2a`NDz<NR3k^e82VS6
z@ZZ*b1c;5B5qt_oh^tMbuzbh`Gtxp{SGk#mAbtw*`)adR%fvIf+FHItW$FVB<qlD+
z&o45aZn^2J)VDvrtL)o!QQZG`hj}Ue<l_JQ8qOyEta<qf`&b<RXXE+Si+ue5XB(g6
z|NI#rG_>b*9F14%+o3<p7&Um&EDa|>x`sqFkcg@HCA}c<1ZM{HauU(4?<i6w8lUWw
z%@^QA7~1$8Vd!&&q0bS9K1Ue(9AW5lgrQ|342`B}j)J)|4_n9mxB3FqJb93@hvRcj
zhZ=ZU{2t|)><jePavxF7K--(v`#27!xnfuTI8*G3is83)wyiE3$6hf01LL3$SkNe)
z=}B;n%yh1kvhtJ{_wFGTjA^|PIP1!L$SHcoM!@);yM6O17i7sk+mx#D-rd>|G>xL!
zYZ0);o{<YF``Ds_oWW1lZWd?D%$zCYjYJD(Q*0mlvdG%Yv|MOJKpEaXWUL5YYRjkp
zbV2I>(N9kP8%N{o`JbBq?FIbE$$wvcmjC{gPjUR$&96TTQ=f&Y&%)GaVd}Fm^;wv@
zLzw!sIzFxCBUkPbCiT#nM>)97LHFPt%w@poi<=b3N`5Gx`(Xq-9jN>z5H@UUG@nY0
z9H3VL`ODWmtNb~}H=T|B0T7GxThFIRF`0y?J`sz+A6(K~%Dl)y$aFGOJ8*4<&cE0V
zC@ajB{p?$yp_k<3K+HLpc%DzK{nCE_qUiktiRlGww~whzQZzwJNhd2H!>9(4`08N9
z0GWc0xz^NhhyP#WF$x?%v4*N_VhA=l*uxh98#~Qd<2#dTr5VC8g?x-*4>0)S4*mp~
zRx8{xf(`Gs<TAxB1xJ5XJ*l&70o$#Id#|K82vep8`eoFW^RLRv{X-C+!xB%bgSsvV
zb?u6^dL_L{)sR$5di_@U2@06s%aFWp1!}K8c<-CdrUtk^ZB(l4#Dmu#GC(W^o@fSO
ziVg%`nwQv78oz(>>_bT!b@UJZq9C97rpjk7L#;UerF4M{Z>-D3<x{Xjy}OdICsVoX
z<nin1sq_oh;NiTv(cGxi-6&-6+PacMuy6&}OT9Jx8JQ;>&JzLy@D4y-Qej3aYRzCF
zDs<fuQCg8Hvsvaoaowz*EVo)!mtG_iFN0j{fk~UEz|q*vAo&Sype<rn!`L8$6Ien(
zh{=MiOI@{=4gJ)LURJ$&zwrUB5!Rls;X>oG($A*+-1>lPu=dTGlgh<ZdsbR)hpW{r
zlyK>ltc3QaFpa)gWh|KimCvJOKrf00lqr)VQZ+kf*bT+#A`Qh8S^!{*DgGc3K!qzN
z)4d&Z1;->PYwaDij*Y@~d~B^F(~_OikHWiMe|m)jDlbVNr0IwL^frU8Lcqu2$6$QR
zMh0|d;!!%A<F-Jv3W<H041nHEo#Vm8V?>5u+I~)0Ek9mR;23gvWVc5Q<KkTeQ{c)6
z*wla~kUeKfe3Ouxae&-@)AKmzHVT;0fCIt~)ipaG*3y>vRLd3x0zp@mSbcoW@bcE-
z8`+!iZ_-0uhr{%eRZp-LL5$+>=NE%$9O-2=O-OIK$g=W685Z!b#w%(bO4DEW6?X^k
z_>22;7Ty5fTHPpLc4}yyt4LpyV3GuB)va2W8Ppe4RQVUFqB_a;VZCLEX{KzUL(EYI
zd^PLrzs73vJPRxZL^hdlhbbemU)Ag&(!NLKG&bthrO7qDUHn6i_9zB!)+I(L#gmu>
z{uHH4L^#w{5Z0duigUqW{fJDPQn0W{lXWCfJOo)BLudKq#7j{hhKS^Zv*TctHqvN@
z@hhh6(Z5mOXnH?IbHZnekz$3G(9YBHT|lkUYJ=RV;yDR)_hSG07y*$3E~D!W|GDKq
z4(cLdx}orhzy0P>%ug3LEz*0dirw191ZA8f+g-%>H;-@EomMdpG>xJ(JbrGw@;XOT
z3m`gl!T9=3kS;U-f77Hhk)H3Iy^baW%Z4#Kb*AH+&HC*oBJ<5w{dUU=i2j;_TV47S
z&mUhzfG(Gl?D`)-D`nH)l=;hFXq|s=6(Izw>M>lZf1Xrtwi-8zE2bB>^5S-@acjRw
zutxP}6QFgoRg+MgR-|Ds!J5@uEO1*`Ac)cLe0b9s0-6R}FYRcwn+~sOp}WkI;8y2p
zxGX4)2+qZuEo2LB={xqGiSintNg4FNzU5Yi=dU~%PuAuQhYF|l@Yb~^gTCOjPHu{9
z$E3M$VS+`iJ;s^4t=)2Kx7pTycabOgWsWpw5Rd>nRMBkA#<{8A!UAgwRX2J#T?R={
z9BDP)#h8y#J|R0(2|xg7$-$g_E{p_@I;Z#}sIwK-U>b*4p+ELUK5?)zqM0B2Ab7(G
z?*&i|`_igbL>|EP>PJ#hc(+6z68=d!>I2|2!gHjr-XM$z<A8)$4s7RLM3i&{H_!%-
za%=s#)AV`~@M%dnpqL^d#pxrnN^B2?^z1o^!xwO@By}Dm5M^{FKkhtvX2EDgA!29H
zLt0m=(J8itL8VpX@JKY5cr;Q`RL{b}h^z|^?Rz{Oq2VpB`pt&wwuWF^gY$%<unOp;
zwxWInUUvx?^ww*FK1nca?}|gmrqpD-$9ir1w6;8tYYsL6qKG!w>Y^T)b50T+p2BJ8
z>%~e$q0G{~EQmD@70<&b296hr+}noXoPyLOXk2e5GDQ59aK+q0;sAus<;i@UhBFC}
z6P=@`oep;ko%N!maOx&w0S=JIx6w64E=Tn)wgn43nGY@j(U7f_ESs9eRFoEo8#FXP
zq6iY+jLze&JukWRXMygEmMVx*^RDVC7(Y?NAdVHkV=1|p01((pmvoH=2CQ!s4KWC0
z9QlLGEMe~vaPB<WN8`v>*RA|rR=beG&u-p7`%w30x9_zkz=*=6qz@8G>O*{pKNt|i
zFBGHYZf%1AgcL)jSnJqPWOl5D46wwBa5+PIA%UcNe?K{`Zq=GBOI-UVC^3%WJOBxV
zXaFyv!VbCip+TXFp5qD4l>`DPt(vhAhl3$sOvBNw;EPCV)YX$6Z?pMq^V!zs)8{X?
zp1w41c3`FFAQOryx`Ny;%SLi@GLK~^>sEP1a8DlgWmnSjaLYRO#LsMV{WBaC&)`oc
z^vKQopFdawKzgZQ^VqwwEz)o8l1xfX$y=-BM?7R`NUpX(9WXW-Qd21(Z03w6mPD|X
z24AOv;rHs#k2h-%pV1TjT^-<mUXs(#pVCk6{-2ZG{+agQPhUKLmcRdh{`vm@&-lol
zfw=}2)y`3nzV7XT&~iTT2qUs;8or7r6|6q(DPPNcHpAk;2&Tv$VqJ>YF0m97qAdE#
z<a5SY@3RTQXA=bPvkAgy6NJwu2!F%`p(h$^VPFPqJD^fWML?Q>ij8wbv*}uc_mBVH
zgGt)v;N}s@YY(`CDyQ1;wF&H0e*<|{OJLRY!DLqRB)%%wseAUXnyxpd15*EF{W96o
z{`+iSbNrtld{Wy_{4D1GK>m96Rfhk2_H65`&-~w?@j-Qf610OWIAR;am_ua8(M9Y}
zNb><)U`&ZHy0VMLw_XQMD9%WP85e*_Av+t{ZGQ_VYl*Zsj-r`Yg(rOfcRCoe8O|)m
zDC;#!&W8G&*r;~sa1ANR1MwVi6#Hrr)JNbaw|qHR%0s^R>=XEzhy2V#e&!)R^N^o;
z$fbP(m7ykZL5|_3KMlxi(+*jk4#UWeS6v*%nx5Xyg2a71p8{nWW{RdmIOg1EGazl*
zQs|~%94gy93F3GfN%U+r4Y4C}=f-KcX?B#^iyw2gJs`NEeh+Sl6Yy{GB8PQ6Y!AW&
z={8A&i5Ljk<k%S4l9Gt4$fb%u9pKdt-ZCMBE7`xraqMmDhjzdH!!clsvo8JMYDWA$
zOhFrUIdzV^2M6-hu10W#TJ**-2eWH`5Bu`0ZN0LZ`1s2_m<OtjqIRspNiYrusau%1
zc<Zb3ZF}GcZRC{>kX2gu12(YHk4O!l1gRYx+o=(#ujZaTluL_A1V?Bz4F{cRm{w~q
zMe9!&K+2+xZ7s%Q%8EIg!I3va%f%3Cz@aD!GL3bi?ybQ7Nx!SrC>|0Ud|pI&!o^}Y
zs>?K9(bobyDnHl<;f-ckTURsB)gFax=vz=3UKG}*3;KNjJW#a%$TxrIB%}wt+~#k&
z61X{OIBzlO1vgk;2)$%GLlXtm?kXjy=U+_xn~|OM*?M&zz+MZIaS+VPy7ouF|12yq
z8v7SkU{VC5AGBs6W2yluEqY@!3oXF7HiMe@DvsyA<F(rTqwY~#@*xn8(~bT(NY@e@
z|Fi|}x_1@u^&hqqrkU$1E2g_F1qCxQCLr0Re;<BmN_2S{jAP?tZL9|{ne99d**AA=
zzn1GG7cVG_W90>OTp?>rygoUDD$K_xQK*d3Bl*$>Zzwri4>M&IlZ{LQojh)<{!WAO
znC}OsfTRHbAm;0EZOlM*k#)tmv2vA+L!xv7Z1=WduD*Q?`n3n#@jD-=Q}N*VYI_=C
z5!<p$o)oPuW9x6UrhCAR^xw5Qrv-Mvxhju#y#MRgQE*NK4Kc}dIGIm0oZX3|uuG?4
zho8m)oEZrj(WvrxS|Y(xwh2XxS4XK>>`r1Q|Dn%nEw;><;Z6vrVwJ<zEw6Umj_FQD
z^$pVe9F}Sd9l$h!;lmod>S$CX!c;VqWtGGzmK_9}9>M6fH3^RJI)nj0gWd1%ZcjoA
zkLF_wLm9q{kyP?SxW}M<)KS1<MT>U|uvi=N(NGHy1g4{}cD#Zr0Im%6lk{_Dh`N?g
z!A#}y;|~^>j<DRz`u$GCg7)ZLeTg%2@zJK}`Jt7G%1_1gN|_0xMRqcdQnI=VZY2?r
zBIiS~USfjoPxU!~lsHe(v&-{%^HY*|!G+%+D2l{MCJpnom}C+j>=zO3#iv2(Nuc1X
zEwGVtdV(pa0nq^RgHy#ac<V@y`zh?}^)zr{<}e>Gjk%>)HCY<)BP~GXG-$lSU)f_R
zwWBgpNvUI>Qu!0ifVP+33C}#U!^wk~PB6QncfvwSF&gq;TzeCWk@wLtoKN05o>Fzu
z!n2dro}c=)2j+}nT2Mqu4BSZ0f^oJ_T1Ri%20#Ub<M#(<2(oS?1mmMT(vF6<>lR^I
zYsmZ6qBk^2oS>pOi+UdgxPf3Jz`<xz&S3NO^br<5X}9)J$5Erw@kqgHhmQ238t+az
zr>4erVGVp^0E}jz`o~KL*15f2xUUtnI~p#tlUK)<<uJgugkOG1b-QXY3>$2kR5ajS
z;9dJu^1_jv%rS+!#2T+#Cnufu2{wkuJ7o*BmO~rosX9Z)NvUZ46mFQtWh8`s0L*gi
z%OKc}`TEGK{$HzzfOIEM)zNgj5GZD+QKD|0hY@PQ0Gy1nXsu>>{m}{XbHND$Qj+&G
zt}EKLH5zVmvqBN^{m*iUd|{0&YhRwn(4Q@zF3pQ;R7vi@NSoWe3lEiKwjyzn$_ntb
zdrYieMR4^wQ#xQ%XA+L#lnPKspV(v<+gL<)?XuLzK3+7z3}db}vVW=_YPt=FC8r)s
z(<*U=b7rQBouRWVtIB}W&O+KWFq(h@+KNXe4Ivzw2ec=5Fqzt+(!!i2RZLuH0|_?i
zrjDYF)lvm1n}p&E2L!mu?BAx?LQ0DTBw3#k^woiXC*yzx<6xxnHE!7O;U>&pQcrY$
z>D`JERYWB;8(L>SQ}b0&F&rv9$t?SF3{r+aQnL(+e3=w__IwEiP=IV7v`^c6eY$4o
zclKPLkGvGZM8dR`W5OH_fFK^y!=tVUo_Ti<ud~Nq{YWBNjC~tj1KFJ30{#u+NZ}u>
zWjMCnAX2(K6U8mErItWzl2=kG;O`row#=u*!Xv&K_EC@1tsd2sC$+`PVmtF`LV9HC
z;W$c?5MvEUuvzg(sG??Q8U#bu9rHCCn%Mg>iOJ1ovxe889>`lAN;6~0<H|U(uD$eF
zd4YZiBra=9cuYep_j}$UIuM)(DPBtB^>mV=Hw5Rfp_mUbXG@p(4-5)y4W~+tY}LH8
z1bt|dk7&A{&>1c+AW+Uo#6DJnk#lqk)d4*nM;FjsjqfH*`b5eCH&4!R)!Kdx`#VVy
zyW=}0mDTn@3Ds+CYOcU)FOY#aWTjBdpp2=y_;0@%O8Kp)9`ghDShjjlRHAgR7|l20
z8#>_Usjx$6s#pfkS9bv3cix7#oq6gtutlXAI%Z9mgW1k<DP5QbR@tfV_-$~Vz|sQe
zPA>QS1CFCJw2!mJi%Z29o|sCLyc8IV=%r1E-B1i1uU$ba8C(X#`B*|rt9|9fKyXQK
z0e#KV;+$w)DAmevI%r)2ry3A9q)`DyZWL3NFcES{gUv+rUzZRMDDjdmTKUF{IuAY4
zl!KUZmoas*gE)YqNqEJSk<WF!iAn6)+YnHPZ+60Z+4D2R4;mnZ(|O>&`Mt1<e7aw5
zoZo0hp%|QwdR0GMbl?}YQp`};L&-1}{I$3dmvJnFTc(gL;<yY|Ef3m7+oBlI1<Dj2
zM&a`1m+p6GGZ{VHbs+dSE1*f11Hb(^oSM$o8Q-;1ziCc!vGSrk)((Ep@tQM9w#m_u
zL{z&yf5@spIUvQY8&BH0cPV~*qBy)nTSt2B`We{G4bgaMT(<{fjA=&mvFBg-;grVm
z5%03Xl%r4JP8-cJj=kI3D1ZaEjL^Jd8ky(vO0jm~N~xClq}xHXDM%)Z=h2lv&g8-f
z)lN~ug&B;Y2zF{d{BTQBQHc~bW{1N&u-k6E(Qx1C11j6?GTQ-RA;VMR^kMg;UA8wx
zjKY>5t7+LXlZJLt+FaGha-8|^5Axsc;>I;7vMd3jH`+Q(*`-qNx;i_uy07V0hh8K5
zSfx!T$Q=h4n2IFM?p``6Fi4GXv3elPg1(bD5+o3ypElia5t~1s4v5X9D_<o5Q1BOb
z7|8qsi;vf><a(>_{j4!W7^xSSbXZdmENY7XhclJ?qaYY=ufr&yYbA<7W&*j8I}qXq
zS47`YSg+Q>0k2h$^XtHrskM(GR0Q7J5+?Ng3me++9JHO5%v6`De%d*7t7k=-#nttV
zB438u;E>sStzPR`mI5ZJoX({O5v68IL;`6-QF#?F1ReMNFkNCWy9m_Q{%QN9-#cix
zk7Yt=g=q`{6mk*0$Lq=kZM|;q!~V@SW*Z(9x2Da7valdb)45Xx24+&`;!yV5GU_xO
zwbtxrdF(oN$Nd=f>yh9ny0J&!Y3Uo+$x@|$QI)&n44Tv^#+v=oLcyA?x3l__<M!Gp
zei2$88xvJ)1Pbic7R8mS*G6ayKm0_Ld5PVu%_FD=<i^qQ-{<8sDuV3(C)wX0Y8P&b
zs%E(n7v8Uafp-;7=&_|?s5es0iA*P|U-gp{*U&iev`DY;UhHc2(k^ey(Ih{M`HXX9
z7Y}REsGRd8(|n=SZeNu-eLIy=S)JoWuA1ppKM4k=X)gRk^0Z|RNG?AwsPM3?0$#v9
zN-fU1@Q`I83b0FJItX({mimm3s6{~?4#l=0#LtRDw5`sAfj{RMYYx%84s>lrKgFOV
z+YFSTuulc@Q{j3Qu?rSh9guD0x&HzPl|o4%Wh^Engu(eZ0$^nZY#Jwh3RWcQjwBV?
z=1g&$adD8yzF}Ts{>#q22s27Mwhw|Y#MBONd(3!pr$|QkQ`lDV&cP@Rib-%xS6j!O
zI)^n8${S5VfI*o=nI<utW6KD{6EUG9UdRy^^ofDNlJJV`I2w-~+3_knvKF4No_i$b
z1Q2Vs)_J@DaMn>?3OCbIG1&B7nS^>U$6+=;1%8&gWy%^i;2oO21Jx6jJ6Bg1rOTUp
zYP-T{SW<j6EGR5CF&nHf&vF&~8mF&}utv;aWGUPcS}ddI(>3adf`N(yg2x|)$klj~
zm>@#rf`M<dbczd;-;>cBDKR$T=*8iLg5@YVpr{!li1C#g3C7SNXQ^N2C|rb-NiYnd
z4|q%n;27pz=31j#&CJtmp|?hGx38fSqRir3L^c-~k_GLFb>x;X$+iW>a47SHc`TU)
zMyL$7f#PE~xIPXfm3WeAX`~{#s`a3NN(pN6eKK>V2uk7fN?j0;o-I4s>{1{>s1tUC
z7%g-<;ARvTMMH)e<R&I?U~1K)ZCCRyqX?ja5jVY2ayuQ6{KIS;wiViTD$))&z$+`P
zs4sVV&D<GB_Z>7p=K?-=pRYcK<qW)vRYCqxBwTbI+eQpT1e_`}#OyE)FU@!@CI?tU
zWk)5xmN%OOrlMPwoJN&x&vk=zaYG6s(mmO>mWXn6F>{59YVJbYeT7Gv{ThxmHUI|0
z4nQ5SvU|)fDgxKCq|lH@F+f0Xn=xomI+itguE4Riu}+ZDu<n}9)GbpArvZd(Ru#i7
zms<d^Dt-jV+NB-bHV(A;u-(${Io#PV-kF8aDFlfzJ;{TFK+5Ry+iw}uqAzw_h!xdW
zV7>k$U|k5>-|qmA%MoV?Pu<Y93_eby>vGzrA&v3eir~!M6yw;Z!UWY<@uC_$fApvj
zpvy07UiDwT&VOk8P$TzR=R!TGir|R<B0EZ?D|11pfLJ2;KFD=|5xnwOi8)>_r<BAI
z#Kuj)XjM$h2)ZYk@v$oNoroN+!HUraT#&1H)*@XZxS@7OA?y={<xheejJJpEfL7v=
z@qf-_v&5!IXAoc!AHBMO9h@o7Pn77wQf|~;jk*L$el)|LB#n7As=`lY>jPh#j&Wg`
zeIynXaQ(L9q0d?8Xt8}{zDD=#)H3p{YLz`sN(Q-EcV}PQ+3_~B_vzSjEKNU>vD7pe
z*rZR5{N)`rVNBVoY6^E%ZJ(Unx9Z!o<GZU08cQ)z#b+gLQ;3$GccQTgJ@mur$|lGg
zjy=N{nF97|WHpkOH0UU^e=DRxnNN{myi!G5Ftk7+`S#Ej5v0~5e-dy$OV<mCL|S_3
z+HeQyYs1wN#Vu32`a!0ow{D5=1>kmF)vRBc0gxDdul|h~T+qGa24{Z!kB(HBi~oZ6
z$w<&YVIPa*zdU^kKXdW_wl+V<fB7>$e-(o|wd@c6YKKzU<#2o}2T}Q}oxKTf2*!br
zoW^`Q6i$|d3l8uG9*$vgb-^eM=<d%0p;iJtGD=JlC4t;wQZT3e&Qa^2zq^0XdebAZ
zk{=xG@e_)y4$WMPZ=6^W>Hvh^Y&@3;wIJIM{dnkEZK+mfKHsGMRjWSeHuQWRj)y8P
z@G!uOT#y|@7+>{o0oxMSy@R=5_uhuI%jzgm*AT$@KIGDF=3kJNhQ!~sTV)Hzh(-f#
zFyBZjOn4~qM0j8br;wbvpJ32=(y;J!!!!xTDkm$C0-C~c@FROP)E+85&`_tEX0v_(
z1GzRq)02xqbhTD%(sJ$DP{2kK#F?SehNzWn!n|mWo8Bp22M{FLszXrlZ+M@L7XjP{
zlwTuTPfv}5CT@&Ehp;STG^$LR4;~1%^)H99x4q+iSxqhj6z(s*#=u)^KAC)!5>TL-
zT&~p~%rRO^zgJM2-gu3~+j{i`I(agk!#i{nA6!PLBG8o&%PUV7RPG)F*WdX^3&U=F
zx6|luJ=kj>w~zMPN4r1uPg^H%+NZspOU56{ATW*a=3qScJs5o-ppjCTrUyq|sMy=y
z8Nke@6tsrEJ)l+Ld|<%&rlhOto$l>4X2B5m@4##9@#6PRVHCSNYin2sjaM7*rcq<C
zx!DMAQrM>)QwY#&>|^#ciGahIHi8?}@`Yj%G(=T;G=*knV?U)ZNb0Twkas=_C?+-_
zE$jYpZ-t|2@QYWie_6$d>m1-hdit`uyIUh!5XSv@r(jeM$m*=H3G|`^QUecVjqhrS
z0y6Nw?^-8EPzV)6jdu(UilQ^UXpF*OJZu<`#yG*1-1)L<uV;;cpJIk5rDdY6X(DJO
z-tOk6*KeiKBpf_|@BP+k_pq~DfJ}rmm47<1LVT*%ynI#hUIA5$nuC|#KOg*sAO=XA
z4tHRBSexE?jflQPP}tz()~iRGR11dq-fN7c$cL9=r9$1_21(_m7f<-*OW3CR*8s3M
z93kYPTRnkV9jeqG{DlE6BjI(jpMCR<!1}@QNqfKZ<99nx=1Kenll+VybdCTek^Su)
z0c5#A?a6sKRd04kCp#WLIR5@kf46(I-+A-h&g|nwgCm;QxbJh~ATlteC!}#!bQ+h3
zP!dhe(I55X@WCN;(B0j^0JsXZ6cQcQ>V7=AdNHn*y!mQuV50D@eh^OQHvkf8_-E<c
zK{=J{8tEeD?t_8g(S+)Q*axu!2g;;;5c_~0iM|>2wVlr{oel1mqBLi|9}g~HJo9jb
zbu(g1&B8|lEY4^?#mw#vVhb1TuY0uRPV_ZQ?ivo>g!YD?hUai}r5xprtsdA)$gH4-
z>{+kfKiy?;Dtr^*rUM7Kg;n~8oudwXEved{!1ji(MNRyzUD#`8NlU6sBU6L0OT(fI
zyhV(m@`o9Ujmxe~e;zax1!&^g*w9q{fz1rThJkHX10sS{4F3XU!asZM*Jp3=3zx%h
zHak#z;BZjTjC?Z%tq0tgs?vGg+i8p^59sMm<HBoPTnx`~VubpL%ulxnTNAG_X4-|k
zqvBD>6lFy$GhG9wNt;>l>mAsePrER~zx>ssZ%FdEgw<7J@^lNjvSC@P)uGZ~G(t~a
zJbUmL?&HoD6tK7n`ITuy!ArjN8S?lWj#Uh$E&QV5&Zv}Um3{CRMGyxwuQ7ur?cqP(
zfg`@(Z~u7OKEkYZy?!4b{CNE4g(}GKgGCv_Q8%6@_-_&oJ^}@5j6npC##iuVhN(}0
z8H7ivA_*A?@A)z8bpkPeE$9JXzKtfqc^q7$cM!0Qz21Rbxezii18hzLy7i*at56kb
zJMbDRlngQN6nqNWItZarYK#vCzIMcnBq>&<u!Ce!DYpJYn{gS=Y59m5ZDyv%bp6G%
znmu@r9w7shcu%5P`s7l-NW8b*!}jZw_PaixTMz!y1-1@`*4GD}U4woA|2j>Qv7C}t
zKQ~{$cru#}q$dNGrMl6@-9DHK7cOE8j#<6I{_4Tc>~`DJi1lt<Z=3@Ved{LA-IIt?
z26G1S?F^CXJQ<esj`#o^8$nvW=a5L+Gusa-?CaL<_ZWAst*EjYi?tD)l3t@@!AIz-
zUD2B9fmIU7wo^)t3(W$;>4+`zWP6uPljG~tEcxrdeUiW!Ej2|fx5@;I=O>IeO;Em<
z&CqVQgsjB=MKs+X-!f%UzwY1Q3P^T$V@ogP-A%pq!;f<&GWe~4kVEtRUia)|x2=0I
z3y9ka33!lRNAbr}j8X)qC1z3_1hv}>*x3^Jv|CSctGPbn;Vq07PT9XK+UIye<oMd<
z|9!v_`CMXVh@0>@jSjLkc9ELFaP>lQGL3_LVM23+0~`@@*1ARb?7-lxi8r629%G0G
z^U3_Yp_CbkKBhCH)oh)Ls0iHcB^$a}YLW-p749^fPq33GO6oUHjQnpsoBOD?wd*;0
z0TDqlgOxfchdM`x1i@wf%gngIRfPdn7ANyGY79w`h4Zxb;PqMOV6XqKbNaU5`>A)@
zKHS@xMh_4X_?Kb@r8|Pb$Xi3IBqi3AN+_6Kg>f{Uh&{(tv<j7JRH0D1Bze|B`av}p
z>Z;68Fd($_fR^!;I#B{JBNJh=S&eU-MozN^A*{GHZjd8cjI`x%5Iwbc2~u@K`~ywz
zX!1c~@|RzJSL3-_F9-e<`5H_oO2bBz7Ud~qbco7`U#$#T9Hr10(1tNtaZ8MBwu4D2
z4jYE@QpTi4;4GR?t-b*>Em*f(#NX`7mCYPyWlgP?mF4n_%tm3UXb?!FXXJB~YWyod
z9J573?2S;>LS6#2)=CP}h}3i>D!qz)5SC0XBMan9sroiGbAX6nYXy{;!iAc0*`AcR
zr{u|^CTwvuN3F|b*lfc}P`!5tWs<JyNQt#I6i~9tNoYxny~X`2$=4!Ls)nJ~W@xze
za^(Q&@IUpt>3dqhqSYx}<<o<nySQ3{qj3qj_RO)MMBwb9XG$n>j`s}G`V}b#h*l1@
zus5yU9B){8y4<Er00a1Bx2wVC(d<6H*gg5___Vv~xQT6#N{60pRF7U>EHwe{!<vI#
zStN%@&BVf&#|B^I$V60;uYH(3VT%Qmnr9C>gFuu8<Okw!CI81^>-%<J1Z*wi{1+um
z2YQD;9-hPh|2bWwc8|W_?H+VbYEt9NDr^{j0<T|pj`;hR)y<myYV*~jEz|gyRjG}2
zHu0Y=mdKE85RUt<5#H4XPgrz6yRbTcKkKwl;cJc6#~B^S1Eu`YC2^{mvU+=PVWpK&
zHPnF2&>lS4-6aU@RQ|c~^y&Mj&nA@z8ixAe%T0LPJ8_FXg=Y$$>e*LR65-)I-lE3}
z+VXS*9+?GKv-fsN*H(sF+ud~+RSm56<$q<D^yLEss|76^tif+(C{x<HKy#@M?m)|e
zJ{(NJ@bc}G{!#0&y(6XrXnr1}e!lyr-#gn!##$FXI_(^_58UF&`UK;W3e<Y{_1|{<
zA;mh3ykF+w;G=x^1N;X=v7@>40RM3J_+^;Dzbe3a<c)tF_0``Y{FSsoP$Zm9{2A7`
z^f&ppG%weJ@J%Er3`rh&^E4d8p9qd0>T-BaWwl*9{-S4TUm~;PS7{TT1^o9{_2tq}
zF5!!WU55!pBOKrS9K;IvLQX5#O>jQP*D`F(GfEAR<v3o^z|o0r!T2p6Y`$nx5{b~C
zLc>>BZX8{YBWi&R^LSwAR5j**fmg;3gGn0DV4<C476e27`r;XtPor5vfaZm3($!@+
zx}|3+S`nsUI!36GBNNrWyqyIxbk6-F=Q<rwg_$3JL@|aSi1<MKY$Fz!nkNjDiy)%<
zzuscZ1RQIGp+az~SG@ipd!f4_6&1kBw?3RUGX~EkaoMAYpgM|u0!lcO^09xT7BBE8
z*dHw23_Ww;E9!eFwmyCzU(Zwh<+=Wbp!Wv|nTu$4NnPS~ji3)K$CM=}d_GPX^R}L2
zEpa_!P!48ue>B2N#ao)G_|N0_bn}~Uo_^K96;UMnpkr^V!8k13QCN(&6K@*5t7P}+
z%Ffm?`+zoF0ah5`Db%xv3+?p>(PTn1E*Sf3U?ATfwobmcXK)TEaybF?D4d6>LbI{x
zK&E!VB#S2Y$>+5Dw!Qm(|77pAvnmR?i`Ry#w7UEGDuDf&Di2@|+xia1BEvQ7p+#=3
ziygrf^TdU}RnnP5_PH7;aCZO2x55?u?JZEJZLfn@sFLP790oo)d(Nj~#DO$s&3jp^
zSoI&+CL!Ao{?gE0;sy5Mp|{=~c&}W;kuCf78skUB^FXow8+8~oQ0`&kId?KB%m7bt
zxc8>pLa6{Au)#zPFO&3*n%$2&_nOCVyGK85lTZEwv@ikO(wA=AmZimCXi{ifA$M=D
zUS+T7xCq%5sEfI>LfV|5yolT(YC)~EpcaRAY|*H+xFuZgxT1Dx6@BTbZWYT47ThbA
z6}7J=cQUt>cT_UHWUegBsvV!Sf9PlKPaXDmnVP0omm4ms+o%qPN^C)~iV>9WRI?&B
zV5r8zECQn1<v0#7+IyIUl<?e-FM{*|cQ~_O!T$QMG(v~CFaHbc?UJbwg&`p)wz_KF
z+&fb?Gtv$^25ubegM%Y*<es6?u;G@Qd1SER!n8*FPQ7;D)CvcjpRSS9N;@-GuDRay
zs};NZt7r4N4~nR8jyA(NRYOx8g@H9RzxndNyf6Rv0&x{Y)r?{nU&7a%#={yD^JNc;
zkAdPd!wk$45|=(&Oy~N5dr)$Qe46evjb{6Y)AB*dS@kLVHwU2Ue;hu@owM7{(ffz-
zKq>vrH{d`@kU_IS4@%DZ?E)s?kB-o}aBzR+M+)T4+bP&9+Yg)3&co)gmIYq^g)?&f
z+MMD<LkTFaC7cA_G-%!7B?TZu2j&Dsg((I*L;ES@Trg+3%IBfVGySVWYg$<!rYbrr
z+ALvITIHv!i(rsdzE%^l5kr%bDJ|gYUxk`dTJ$NJZs9EjhI0YA${(b4p}D9Icjzwp
zmNy^3l()Tyz!?<~F|&}uLhZ?FHU{38-#&Oiyb7EI@x*JyqyG$s61cnw{<|0qefl%y
zU(pp~brVH5Zw$X1m+55ea%nV?kzR9kPKxoX=FZfU(t}r*tVtP`G@UZeduRhW+T_W?
zf;>82r*&(5mVqv|atCLhh1b$60Vh6>^`+N*0<1XpRpTxjGVU@8nXf1{{8^})P-oBf
z(kN5du4<-+u1P@9w@Frb@Bo*58xfkJiWq_Q@k*%?y!5i|c#Q_TdM4f`b_AQ7FsBjO
zc+})Kgh`FYIDqd%EMoA>6gKOHZy!7$@>)bfWp2$UWv?DQ-8v7`?E=vW#emMyn{Bp1
z^+tY(H+$qK!De%}(Hva^&goiSMZpmRC(@h0Xn;7>2%moa!WOMG*o2|2pj}!;GvNI5
z!GjAI#tze6X^fy_+-eOU<YmBQS}v#oMDrr>8hg84z?jyXcK@{9JFR56?>nkP=hG;f
zrB?5@^)yuPZa|qUe|!Nl+;CwrB@0y$9#H8rSh<pc(_UYUnEOApPWt=ZlU<a6j&}Qp
zt=*GuuaX5)feld}6dCg&7$Y)wsG@3KB3b}BK|N#gL>);D)HVSB-Jmk@If%hr8snkU
z;<HTpm;ai49EP#im>HEnnoQG?PEif)>w$XFX0N*y@2HtU?bRx4LXfZaU*oCQNJ@_+
zyY!Qi1Llu3Vyidq(MXm<o=?>(nIp=n_^*<cC<AgHeuW^Ym&~eOJkbBao{gVB%Y1VF
zpR5kO{FHqx_W#`2c>3%`#{cu#S1&&MfBq?-zse2h?#b?pXZ^Pi{wjCM>USpL@ie83
z!sLogn9|4l3U(iV`CzWXD$=W}{gaHI(5Y{lgcq0`ke$$zx~EHxF@}ZY;$>QeTm{95
zp!QCId!R58etd!Lu@`%MarOQKhmG(t7OhW#wN++a`TO4u<^SAIZvUJ6)=x$Q7VrP9
zt*1|)X7>M!4S4-||NjY}C+pS?`=!_LTC5Za2i`E6qsSp18M;(1Ks$x;wVcKW=rq3h
ztPX;DntDBqnl=tcBk$V@{6^X9B1oF#CXQi0F&-n<LoadCuj<Ia<mi^h;rX0%qJW%+
z%A62AI_9yMdY*?<KPGpvNm6H*5XlZ4aRyZoTEmgt)YsY18m(bdRQiB;auuQrvCa%*
z5|?ARm5?*gV5LcrZp*m5+}J4ltqckSrm?3<jN$6p%+)`~gck!1BfLQ$1a(O_!(Pn>
zz|ff8yF?N+LxZjdV;=*zHp|8X{aTPw<AM1O=YybVNNOlDvilE7EPGXZ!)P$qxS|Y>
zSu-|4gVxX=CuSYAOOHJpJ;@`n4yHIp=vo~qZ^&t6p3-83nDQW+avM>cScw9L8tP;)
z0WZn;6vi;YV0a88s16c%h%xL&@IsQ@N2Bx_k-<VQ{7A~B0n`l<`C`PbDdSm^$P6gf
z_1jL*>vi`}LFjLL@csCt`$K21z309D30}4-0K!S<&D&G&ZTDcWebVz<M|<$}==7xX
z`s}m|4=Sx5)U43nfp@K=pS<>u$0zMx&+DFeox|gU4zvdyoV0+^Z};k6=V<rfY_D_l
zrtU!--ck3|I{;Dm6pEd8>)0<vY|qv7y8GT?`(*bm{A|7M9CS{9qAvG4r$^WwNX9@d
zj$0?Eo!zs8)`@p~c5>Y9QENCqIKg)hTAjo8UK7TEsj4XUjn{jN#!BvVyYG(LCpZCT
zuCJ-BgARrP;_hI!d!3W^?kP^oeA@*e!XOXoUhlZQ+rcmGAKNga*2zzGXqG5c_o&zY
z`x%Nqtpjhbb=Z0XbFAJ09ay2=vy=8A4!paM?exxG_f9*fXQyrNO}D#8U`H9Qv)k^y
z^bWc`0^C`zU58FiTi89e0#Jk3@cs2!uY>R-pdX#KPfpH`$z2@Q{2f3DV9<ivdj#w5
z5zQHZ)jjzM+eKi|Qq;Y7Z`<%3*8E7OhweTAjvfGT_tY*4y#hQ>t;u>v?KcOVHy~xU
z@og6yde`ZJ<VuUz>0y};cmA#gJ)hz9Y0+S8{MEwcIxVf&+4ov|KXh>LT$s{&0Yo~2
zKJc`6w)<9~&zY@?I85)!6EcB60{|VLp7ak}KN4$5tZKji_p{FK_XnNcY5#4%uUXdY
z^9K~)atOps(=m?A+Mx_5(7Z1p_$Zph5EJHcRIxc6MI6XLXFB1Ku=Z(*O;cuW@9CCz
zewzj=BpF9SJLl-0VqHeF@vWnlGBgl9LK7>G0tzIYwggAy_5z2K^ub9IC?&_XxA_9=
zCUr`M3Cz>e7Z`Z##`|^5WpQ*bo`0msA^4or_W3YBievjNH2RTqMFdkgwqU^9-j+0Z
z(t5YES@#b9vA?q=eNOQ>3u03SvtVMOe{_x!=u$Ao=x^wbk-!MCWZgTDB23#7&jZwQ
zP6cpjFquU$o>4<xMWVCJ6aRwK&H>8+#o(~+7q%MsaH!8!wJRXmBZ`wM&YY-lL@O+s
z<4qd-P<cZ}Pg$ExY8Y(gr8o0o6)2kmMP{79jE5X9?<vn3(ICB@1&D~U-tJmC(dpb*
z>n2H2@q3eDBqJvMI?g<%ROr9H^z08Hr@}T)G(QzIkZ^-eWyS@>p_i&MKcd4km=Fu0
znk#BRp$xRK^^zMvoY~pL!xYhGXRD-R!6T_iNelsxxS~R(lFA0RaOe^hJ>k=t&<Y_O
zMstoPzzFqSVM}?u(k)U$10TcCs&_AeS%|y@Zv=~hfw+YYaFFQ<-35jmWCE}K#xA0v
z@*HC<y6gYar7r+OCNIw(A35~pGU7YNwdB_|VZk^G&YGF@8lgOufHtW17#MHljz>;8
zraWBQehjs607Mj-D~nQ?M%9$5sTQ#p%K6wmZEpiyti3EHC{nMA1mw)Q@hbV1X(0w1
z$-DwO7TPOWr=_9ivnZ4_7rqOz1=|x}|EqW#0o?Jevu$LZX#<)uy#MghUN@-4%l0~o
zKH|l@B!lsXnw^aUzDE`bBjCI>a?5NuY#wb>Qli|d8)iD1RCp($aqu9#AS=~`1Iqxy
z`{<$=F>%GHAbheh-J?VwlK`;tR*;We?JmaQ1xA$6!OG)+?DufM=Awzt%0O~=O&)M;
zYxGe=Nx&=}`nb($jZz#vCnCfAUzBc?`^JkOPX2|VoG4ZmO-s5*QIhljaoA^M@TG>3
z;>4?}Pyi?`MpF#PT~jc#Vw;}p)u0XpmgkrkY)1ZQ<nlD1NLo_Nnu9)|FkXsUs=JM*
zObv9l&uS826cx(YL?^oH2^*bLa_U-h5fUmq5lqY;07M2f+O4BJ<KUaB&YCitKf=t2
z8#g2QAWA;nY9MO?gZZoR75V!CrlG+*h|`|8`7HBlw|jV8^6K>=zkuh#cv08(5MDgH
za|kcWhmd`xhd^|n14_{`6cEJ~w1RWnCoypxf|yUc43HpR6gN|n(<0)s!3c<MC^sW|
zLH`%AKlF7{%D<BP4UQ~`W8_t)AE(hZ$hI*ijb*_T4pOaxv}w8!^bLoeR{^gCQ0(ZK
z)Lb6Y<r>$h`85@d%^*Ef=m3RY;S<+@{uUH8!y#(n5`Qee?QI}oQI9BTSD2uR5H_ZE
zIpvT^rfDS(TOYf#Bce>OO@L{;3fyzT7awc8JP&IWj>mcmxQ-39bpf^xYE?}*ry53%
zgHslm+laLyYrHc*#!Qg`RU!&IjAwD+(?Og{SU{o?aDFOE&B8t{j#kmw`GXaCLya~@
zGZXT5ZPUSpM4)){U+V0vnHQM#FvI^*SY$#3%>zDJ7YxvR9C9my4oI}|r*L$6o{)nr
z2UClsL{=z|GrWu{f;A<)fOfZ?UG4Iv*pRh4l1*V4UWLOso-}rY8CFqqW;S7<<9Y~$
zoR}FrPq_&MJ?0)#Jln=jG#V8)tcZ4B1SvyXGVs^bS|2Ex^B?GN*&?HqDGSY4A7=U2
zt@;J)Ekb9pBoJDee_?(}kP<xjD@AXYG$tA59p^m^WA;RG=70lTFpu^Wz3=Ze5p$fC
z%p&vn${){jnT_!u9m+Y&x#_71DC~LB!116|Cy3Dwv|D@LM!}2IR_DNLY-Wfyu>eZm
zAym!RM0bLI`)Id|+Lb;?Lf+<`rI6*^%Jfx0bIUr!4MBRpja(Z_#G*qiT{L7=8?`z|
zXn+7xSoxq$IT6ut<f^Q*?44v+6ZR^CuD0Ohbw2;3)vR)*#w#sh0(-Flgf*3P6R01c
zFio}yLw6|yuDYr$DsdECR~1F8I}`{i5YwrP_JUN+at|p{wWvLAgD6!|1N+d;f_gZL
zqH0|_#*#Z~F6#S)-Jl9vfWlZ&|3024mzb-$q&sSu_pQ3&MIow>o3p5?Q#i`**OWU2
zZ0jEF)Qh-493+J?&Gpinq4DiMn2?rqm($dgAQ!jw0}d<MkE6-LR+kC#u0P9;fH#2M
zcQLXr+j~*JF8n%EVAwcXdkOS1rwpAKi~3&)Nw|BC0so2mUu^(;!I;`LofA{AjzV?5
zZ)DYOvzz85n2r5G(1OVfgPW3B&^d{k${U6LsJB_Xj(mV-yMqy*pg&JZM?7Kb4zJC#
zPbdvZX0H0@n;=z+_i8yGQFj@Y<=O-23~v@Sy8M1}dUvMBKpx&?L3R|}q{}TZoogk;
zSc9gZrIP);H=o(d6vg31c5I9^i=dsGAYoAvyvoouI~@%6de?5_xsAh;>I+VZC7J*s
zC|&Y!i)OoXK-<ZJ!<0^j9GPFd!5l7i9gZCf!0QPRkJ6gFd#mdSh{$oRn(37~&GNvt
zf?0jC`7E9Z{z0=ZM~F1%4GLEU$T!Xo7&$4B(X+FiZRUnK+u}*gw)!BeLOVixZK81S
z>nPi)kwz4Kr1{oZb!(J`l94DU{t4@7O#)`okAsogKSo<uFX}ZrVb$&)DLb9T8t0p|
zw?DU;YiK{a=Zc$gH;PtSqa&z$Krb-G)5Y#%jt9`*Q^YlqAZJYX92uo`fYInra)O$E
zPIB6&GVeqAH*@)mt^IeKR{cNm$=Uyzpa*}F{olsZ=g+hGUtVlHd-2)+@6Y%cql&}s
zQTMca)Y-MHfZeB0_?ksyh&Q0j)u_`(?c%k6i+aWZ5X*$qH{e?~i)(sbhjp#fI2cQg
z6V$DeDH>TMaE82S<PH5>x)Lh80iy=OD@p;53K?kol&`vqMuzt~s2RMN`>{Vw<yz|;
zGm6Ggd>mbb12TsI*=G=<4FKJQQFClFmW;_}FZmc;KS?gbQOYJ^zN*2UDI2dn+qIMR
z`E)f9V(`a#Or~`<3~AO@hF=~X8&aU^7ERD5=(Iob6HWt(z($L=3F>++7^4cCGTz{F
zp!W&t@z_F>b;790WqZWk<1>I-cZ#8<ozW#;m9n<q_-N!=<H4Tno%VM50Ifh$zvfRj
z$~PHw8HodP2QngaJj|~%k1=IW*3hRin)rh_N}89ILi=*_Y(9mPW=J;Ym_A$2Bb<7Z
z5SnO6UOdJDZ;jvz5MA?77leb<wuN+g>c=6cA%NMadvrgu8q`*paISFlxgu*sC^-+4
zOYf03Y1H=t*qCaW;F2WKAS5K$28~(Nv=CgvgJL`=WuC}(tZeK^IxW23!J%1~3fgX7
z&6&BG6Tup@<RceU*8YiT<HqM<N@h58sZREr3<c;6Q=`OF-Gx_OzX;MpHJ7ubru1pl
zHzi(=C<<%J0^)qe-ij(wN)apw-qHNxl5qz2JHmhy1;}27hB2)S<zEg{wO{11KV-vH
zp&^NmrWyiYDR=58l+=!#yfH)?EtLd^!Mg~w50+F;gg9vL$|OV&osA@_r(_s}jp4<z
zw1C$|J|@$_WgSLAg4aV+Lu=61XxOX~NNv8%fTDwL6bg>}^Qo{%cvTJL6mP3w)n-Tn
zWpUcPMYq)jm0qIBE#?P}U#b^UuZPP~eI##d`n4oAlv0ODRh96*^)@$Z-oJiFW4v(`
z&6r`^+?XV^on^-16yp*wTkUkE2eeL@(8up8>7Mn-+wokKl5~S^^BUQu3n-@B&o?g_
z472Te4Xf-Dog6OHi5ZYx<O#rOV}ttm&vrq{@qZK)ZtzL_xP$-u>e=Q-&j0KAXa4U`
z`QX(_63mAj4G`EGx$+e^WIX9dni^$H;sbApm7aZFC9`2w&Wq0J`bo;oZWDiEdq-$%
zcuM%D8@H0qc~MMx0y)g0FCGgj9`wXdFPl7C?)YHtXPi>_07Vlb4pMaKU*R8MYX+F=
zgOY}z1HpNKZz3{XAdUp)7>+0mx;Dn}s+3@k`^K&)4F~#+uO$RDAS}v~fRe@|=LS-8
zECy6+U@AouItm=09KF#XmUD*&q%zQpomGA?Anhic_Rgd~!HPh-f(xM92Ds?e5MEH4
zL^6@_XEPA<)ro2{G0x`aWAgSv3oAO~I^r~gYk@YGljuqfa*7sFl10(1+>~RL2rIPt
z&5I47D7SE|?0RyAm!$L2sM%DbYka~_nFG>B1OC~nubjK`vs04gltlWV{}_Ly6-V>g
z73s4p(q~ts&#p*+$Q8+0xg7lkEmC#N_1^b?sa7|=Z@=}bM<7{j)@t5kFY^HZ)m09<
z@2WR7sH846YVgy0L`|7eZvhFh7?#HOuU>ga=I!CxLG`BY-PXNdYk&C{p88L>&~+Z9
zs4CsYV3l?C{kBG#J^xbuwf27F1C+r=$M6szY~lmz4WImOJpW<W{Y0JMSfvMQ_pxag
zgR(lqZtd*>Mw_u!e}&d{Q&6K;_ikhaH`vlGMqyO7f86-X#?8~G8*TGs6P~nQ@9vo=
zTkvEP<O9<u)@r|aVal|y)?T~4Yo1`O=Vo&7>$U#XYo9*F;oWS&f1B{%7Ebv_fK|QO
zfI;KWP5!wlKezbjmNfxriDpLApVoBCw2HU2_tOtG^P@VgJ>JYd*!ti!*WRmIqw=Z+
zL#=Z!ejNY-|G~o+J{%z6O;bRQPpen8zo6`14dLC!OD{y<FZlELF$lBXO)@_Z--kG<
z8~F2*{)HdtAVa@@CnOSi7utGhAuC!<{-wHkKxn^(CnKZ2maXRsM{nLg#a90Xi(QB1
zh5xp^-+}p2kIf|TG0ozoYJ{{4=pCiiO{!IrUk{WRBBD8!ti80w^r}JS8(hH5w!OhM
zhOM?)W9@^u7(m-SX<K!O-1n6~R$b9b;f!!C)w??HEA`V+Xk@0MJW^EiGZ<Xm`-T3E
z>ED4L$G02ucN3<L<&h5ffTn;5^zTe&E8B2J4+pAp_T^@-St(&Ri-mqEs`(2yZnw<!
zHuZ2~d49ut1!2SG0oL3hd|~RqZN^Xy7vdLOhsW>}|2WstI4nRfYVom$ozbsN{<X!w
zpb^#ars{a6nzUYSn3weQ|G#07a{3=mJMc*rKnwLhTU*b*%H97x-+cNx{?DKCc~U4m
zZ+rv7^VY__gy(Eq*bIwC2mU#T!=35ivyA;&#{Mj0f0nU7%h>;ama!|6yU8{Js8CX-
z%Zf){V}LrF+CdKm7)gB&GwGd@!I-WmVGHf1Fx3$}u!MR)p7~Eg%p2nv8K5-okKJd(
z@n|r0AHjokTxy;m)^d~;Qs-W_imJ@N+<-E=k>tY|#l$p<lnev}DoM_!`pRG4pcoQf
z=pWj?&X~iw!w|TSxX<06-n{D^QI|Z7UaQ~5(4@QH8v#^5@-}WZzUGTMw;T3A=JLa8
zzu!7OK4|y*H4KDpo>Go<cxugW;twvL;6FS;Z5jAx9G&CwVBamL9&n?5IK`qE6EtCb
zc9LMx6iLE~Kmm^nsKD+R62c#2CgNLf99>+9H>NZyNs9ZEIY6(U?|@%GH^--MPui`$
z{vquBAN!r74pNfNKiVg3Xt5u~a5`XS3^)q;s*J`?0v<GaLT&P0xJa$^itG<|V?Vj%
z63$CquRR@-aplKwJpLi{dxWBFSDBEVHx-B3K?j46r?Ed^*Cua02xnYwJ{t#D!C0(Z
zckcRld&v1;u*22Df)WV_&2|A)d<O;FmUtmHhybQ)Em`C9ot=<55(%o0w7b6A-RS!7
z-B5T4{{p@InIn^?$S8&VbBEzYAb!C;^4PwKVu=s|YeqIL!o)-~b$O|%hjpol^(+2x
zSdj)@i<tS8$^~f6K=*cuI?j8MRH*v(^ZK9;!aJD=od@O`4$arN%z54CG72SNuzUO}
zYt>Cpm1XiQjqA##1Z|v^o&kW>-#z`&8>BZyzLS``>irhV-s=hAF0^8NBYzg90k%PQ
zCXb*Ik%jTu8O1H2r}d=HhSlobK3*VJvGuytqF1C%`kD9Q&)&Dd=EL8|k84_F=SjW)
z`GfbrcX)6=e=wRAfJKj%w@cX(7Q-cu&VTmSBL#_wEk^bNWVnaiKs8dLy#}(>jvB8J
zqRB9Uc~$vWO$x)#jZcCR+o?yarFoLMmnNGx&fDPqJQoMexxTa|97g^aI_A_6bd@Y<
ztY$z)h!Rsk_+5N~ZC3be1zFf&jCpm2e1mN6y`%BaBZniyFHeJOFPa7xW)go+m%Y-q
zpr(>t<mnELSb#(Ohkv6re68qSUT+}E6U5ev*YJOTO3v0Zk==Npw80Xw>-5vo?P9LA
z$(m8`7${Wt)i7FOxha17lki5$RYp-%sX38vte5A0T&b}Q9mdDUrK2b@rcastfV~dr
zH8feNdzA<)Gn+za3eA4fEh{l^)&4BT*z69xYsX5pt&QBSl{ZpX?LC;(zi00mXnm@^
z$9pYEGJD3)#A>sG3yCPoNmsnJXss!B$JoLE^%xR($KfO;)c!Vya7g`+vc0X1L)~6q
zM&p1wPXYiA?1Pjt+c~4dUmt^8Ej82D#g=A%7}piC5QB*bv(rQX(n}WXDUOoH`P6|1
z+7*(qDDF8vBgHz=TjTE6pbrj|#B_+ZfKE0K>%;TH1CjwGqb5U8$>&8KTO1UP9DAIm
zP5Uf!u!ppWd*^^R=L%;41n@WK!Bc`*TL10Ok@dPvqv;qi207m{^m+tk>$vTrQ5C)_
z%rXv2oEy{_8Mf(n6~@Set6979d_H==x%Kr2*_9}K_(ImyVp?XsOpaA#g^{O*imvM2
z*MIAyOm_4}O-@E%u<O)Dk&*oFA-iAHAo{h~&5;8Ryw{-&*T;CbqaOoaXph3EzERiF
z4WuW#4ff{?I9h^wNoJu{RfK#T$6@^uJN?-s!4EGc@JsmDjN(lIgiE;z+T|AlgPY0J
zaL7fj#P7K|WxXoNPjE4adu<28u*F;eCkSBm)Pb)x5}<YXAM~CDWtAVBHV~#lL6Z<b
z`o)fSbcU(OT-fH%2Wm%ARsL1WfD4|Y$+3D{1SuIs7EsCEfci%UQtl3i_JsEXZd7&?
zexxBgr~@{pBRNP|iR|=qPUZkWK1p6KDi_e1yq?@u?kXuQfSmIcM#OPm8|rd39%pbA
z<7LBPgvX3Eas1$LVBivxg}rir9oILq%SH;3R)TKpRjQ+qB2&(3jy5N>h7}eyn79o(
z1(g-JT_m#-x%Q-c+~oxBM+i*#7hs0}j<ZNf4bT}3L;rOQ^?LY=#+4lpekQ>r323(q
z=5H7#$NnH@Vb_ZWPVMOf#574mzA_A#{gE9|+}L=$#R6&-P7ZYn!Pi>-io$j*I{>Pk
z#<-QScF{2MkV&ST=RMbV<zaL4tBXpVz+BMQ{YH=@L8fxyg23V`oP5NXk>pX+P$HMo
zloE*E_r(+f^Qr@3NJ<C;CV@6Ye27FGAKB3eeoY#$@LBfEfk)!&KFn@tq3Odwnxpv+
z7m#sUHhnmlL3|(FR)<APCDdeH?HDQl1M>Aj(RR5LDb`D|V#$qGggwigMrCzBE$026
zTfFSqHVo~PuxNKPeLME2;h<VMlfZsS6eG`vXr_>}k~>n%kIT2M-dh_RP#NNK7MF;W
z`f(X+AtYLrBaFKY3E_78?UR$mCuinZb|!7{EH0b21YT%-R^!^`@MFx`90k|CVFJUf
zD@gReZ~v6%2JeMdrA*Gf#`Qz%;H>>;jBHt){ym2=S$w`+f~h?{X}1m?zBUE1ZlaMd
z3161H5{I!QRB}9$HU7sQrc~PV!l8Mn9I2-B2}d@!FpEj2+ZR&fJ?iUGIIKU?)pC*s
z;wpxx1{rh*e+>L|G)W22lUaIOMQV4}e0Wx=hr{M1!GDwBm(pbwxO0nYP5D>Zn#$Y4
z^FWWg(I}$-8QznM)}5$#_D8{xieb2mI*XnC98a2GyEhnJ45~3mxuZuMw5X6XDfv7y
zeLvEDFC^{)Q0`IJUZx6<uB?~e3${fTU85OJ_s%VG*xfrjXxr;UMg@nI+?2=UO%T2Q
z^{<WJ>+s+2W+<Ei^#_*zCsze52baLz3I$N#I=SNRvqg~3b8owRk5`=xtx4m+Cn@qJ
zSR{*0=1uj{WLU>O2y%Ckn#r)KRVMhoR(6ira&W<sDC#4empTf6S9+6<QGs3h6dHi_
zFm(zC9g?<*ynw?STZ3XLYv4p{Y}WFluYB<Zm-^z1N_}%fD-G?7C{fO-yCS(Lg25zp
zJi!xvt5YYk8kh&9xQ_$Uu*nq=srb<J$oGKP$HcU(1@|v5;@|?qVv7Pz6pT0QNhV4_
zb-Tnr!`NIXiGR6&YpKmiSBHHAahP5NDmFqKB=a%MV?T=7G)LV>=#h<rV0i8iKB5LE
zh}FeJG*1C0G6tF&8VKPd+r2KBCOQzVts+-fVALaxjK=|$sjZwg-KYjdXS>JiP^?|1
ziwdp!bKYf{lmhl0k0A5X;?N0|_`Zu8wseX@u7#ta{)L+%RUcg})9s4S$(z-D@v0Lm
zX79VibYXZ7B%g1-tSw_{LrL8uMIZm1QHS90d$1X+!*dZpD3W$ft8C5YwB?qbKeBk*
zb1l2*!Z0JmZPs(YhJ(4z(TnAdQf-k*bj3<@YdH=1SjVb&-J!_-#gDDHwRLlb&@<Ev
zw6^xZI}&f6wA46)IHb!q-gp5ow&`_cIV_<pE4MD4bT!uNQ86FvFu|U>tbkgLD|78;
zjSW9Y1sBVD+$$6sP>?BGFIt6niYbAwwJg(-J45d%9~Fp^_WP_>Un|Ph9aEHT@d+id
z!8q)+xZ_*8+7R+@gC#Avq0E5Fkb6dyGC9vt1v`p-{QPchnFSKy@8p@!7BOeNcK>f}
zP6jPkWH6OMI_`%Uzl>6fd+P&rXF)NpB*ImEF;ED`=}9CGGQcG<GzDjV9$wI-DaAyU
zc)J>322lnFUowAVmYiEoG=f*DP&o0}^?>u;)U0sM#2w=0FwhL*4PWZR6bI&^H-mj;
zU?M7yT|VO?NDtsS{)f>)83(#ChMv5w4$yY?;)<;FA7Q9a-c=-ZcE7K=`-prkOyh_E
zJGwhw8XYYYNh6a1n1d{f$hh$G71F_fIm4_%^E*EWeOa9<4Qt~A3n$*A2$|_e7@|(i
z{yPu3)@>TG^)&f)8ye4v7T5*!fF!tm+&(!(JEkHyTDVV3N9HE#svOA`=ab@<B$EL}
z!zi6bGmH1C?=Ke5k0${OjdQ9~+`lqKC-7N%?UGBp<8DSDOLUUiB~u?)oAP@Rq;_`N
zog)yNOMpX|J|U~;^8jD~*u^mMHGW6apa>eU{7-hgt(RnA_WGyOcE5YF*FM3OdEI%_
zZy)V-T1UBBh-}|}yW@Smj&Z@ot}I(9f3oJMr@+_7^bY$JK^q`hd6-n{By-?noPSnA
z%z{$0(o0VRH}k7kJKl?DUZZ>-YJ6(X;xd~pR5}`K4=y!BSzOz4K**vfzE`4*F<qEz
z0?B+JjQZu>L;=$Wpr(R)O(_0P5@0NZ>p;iY8HF)yv<tZw*A_ECG%5NoWps(dA)Dwl
zZMmZwFH2Tr2fF+2$+`{%BiTU4n6aRgEI8X=wtXqp$?mM>FmoByw2&bj6&@ElB0nsN
z8~_<nS0aaAp`pMCN<Gp?kcRCSFsi|1Rz;Fk`Jvm{tDx7XJu+RJp-ULBVJSTcHs0M-
zk=v<rNMn0)0AYfNVN?Z(ujk{ByFEc=dk1O7!F6H1g}}eIfKR5o+1go}{JXY*r7cF@
zSG#PEVm6rGNie8E;}tCzAj}pb3xODT90W7J(@RyaVDz$zgGP4rDSZ2$oG%|#THXD|
z{=r%AZKHS4ZXbK!Qp_-D_En|+0L`(z9?3B*5&(-C%+%f*jpxawk~^UtvB9+MwpAWJ
zY^&AlwNFk}t7Hg^CR{#UDpI@|V1xiXSOT39-n1Jh?c;+6Adgfb0a>Ku*;rhByw08y
zwMj<C+&xXz%O2K<qj|Dz<$|KoQFK9Th`DBy`8mg4;Q@7z_B(H2K<`dEr|rgm_hh%-
z0M1c$bP#?FJTBx(A<jyK1Rx=!AB^)BUd+Wlm1zW0H8PLJy9H?qSlerm!`b8q1#xA?
zs)M@N?TnCdGWl?r{3Sf*lNKy%>u3*#z1u~P16bTKw8-(`^a8&{Yvuv12lAyL0TT=B
zWB7JBwB1UW63f4(_SuL^wbEt9gYR7iHy&BmlZh5OB9Rf1g0V_d0x}*MvQJa1u?A`5
zy>9^que|sCr`c?NxT6zUexAF^fJ1UGyX*i2Q4>TRwNFmEC+O#o1VF=p!^A<u>}WK@
ztP+E0EX19-c~u29Difgfn5oh`OM=myv;6U{O;n5XDXP3k5roMA!^s@OUrPJbERW})
z`vySF?djpXqjN()R$>&Z6wvycs=ht#owiPU-nYZ^aG0G6YXT(R9pDOJ`9N<J0~a0-
zss_%1nApuWzHk4;E8!ry>J+hiBtoCl7aMe^Ty-tsRgtN-_JB^P=Jt_(DB^*JSfe1u
zFo5V4_EAuA9Qi|C1cN_P$|Y{?tOYypUF)YF(TUD(3pVC%_wW!f9$>QZ+onar(v(>M
zgybeLG#>#^Fs75e<7Ep8$FARC6eIX&9H`dBYEZlnRnkz*+cis7#3|CT5kLZ%)_`oy
zbx%0_A{n%Te|Jw0H2wqVUTNG1=^ZyZYH)mF$uMITU>QX+q##fP7HOl=J3U#s9ma4P
z9v@DX?(4s`cTZh3=v_wFfP?TKx*2%r+=3p40Ehnr#r{vB%^VG_+dXv2zlGDXK_rSP
zG}eel4N0&?yM<afZXI=YmukbCq2`(^b&t;u06DyGDKsVm1ZdJIym|Ejz9QRcfWr~L
zbxH9>K;l78heSuVzn#t}ubQavRt-@kNWG`fu|YK$rj{#$wkXFzuR&959yh=wkW5pL
zPr9ew-7X*jYT2z_4NQbmRU%mtTg2Rk##&9OOd6W=U|Z%<*Mnkwsf)2e9kmoNr@A+t
zqonW0v42Zyb4)Qjt7FpCI6SX=GuW_o4E}l!P@d@KFu`vfj_<J$kdrp<bnm_J!8QTc
z#+4^P{|mM{fQxk66#tU8y7z-W1_tR{ZtRs1`EAwUI{GfYX>Zf92pcTb>!pm&v0dfg
z3B5K=&7&@HKHD^);D&>}YFcPC^XCBvLqnT$W__?tN;{|;^Gf=cSZ@JehYW(5_H0H6
z9}9V#6*H<{>xcHXzSS^e$xMctltCjnkrmLhlQ5w+pcub+akeFAvT=l#J%nLwB^vPz
z$T6i4AV$wxB{OMzjLqVn^n7gB2E_ze^AmlU@C1B{PfbtdGcD{+t*yciyn@O%@3d<A
zBA!Z)TxWI|Q>A5i*f;2Xg~z|JOt8=Vt3Vhu*j#86&2Ol7Zx2}PqlL5-ikRrMqsZl+
z40Samwby>L-#R-uEv1PZ5HY++f{QDuaoT9@o_2m{H`+fQcTU=ij>-*{i!9;GJdNDw
za}N9T0(ff}51Y?pf<(DUQ?2=f0VjH_n(UFZ`-$sNQ5b8@+zA~Ae0(NC4lecSE2p%c
z3z~;DcHg#lzwezLBLCRgYoVX5JFT{~hMcmR(cm%|d`#vO`9j=`!Y+1x$Mx=>w1J74
z`L~Gq+$#%8SvDFkqHV}ybGlH|+XDhUK{rRA-B-9NvKK#Wo$kJEoLbEE$sBpn(frq6
ziPj?@p7W3cIdpJ|D*u{x6;N%S?Vk2J|7d48LaK_&IdWE0H#)o&WNfx;Tq~G2RVm+=
zJpQo*m3>f~^Fe1+9UDZc-RL4-=7i+8Aef?{i~?%@K7XOa3;0cV;Yz*h)hdd->ovSr
z-tpFM)>dnkm<YE?=U!ZnY~)IGQ0mk>n}#>+G4*gf25QOSvq%SD!^c%prLQ<ap(K@>
z_uFq-_2$BgB-u3pog0`%9mZY}RZP(p0ZDhRD#lhmyxQ@e7U|FLx=B!j!nj6{s1LbM
z$SG>o{X(IFnl4Xigx}&dLBU{+MwfD&jr|L>4_y+l-#MLCh1&Pg>%V={e}f*?`!MLA
ze#^XJxxX)Rf6d!=XO$_9`4-K9rFT}cRB6C<npZ8qJxBwEx+m6@u$02Wy2VI%yGYI~
zSrPW~inta<6Bp^VzZ;rxv&>LEJLn$0!8Fivm(KbXAWat+NUw;Ary%sg$65N%U&*4%
zwGFluW!bxnWrxkGq@wN0mh11}EbIWef-Y3ujSuxrQmL)j6@axu9`BY~?rFZ?gXp4q
zaL|9(Iys`y6GAXR=HK>6fhgq3><@O9`=nqQ2mZ%920KiKb5rx*G74cGoyFljip=GX
zw^?WI3BJ87+{AD+?;o_@^kf6sn)qWs7RJI#2_PCa@gl{bKx}rye4=gep!g66M>%dD
zT9tTsCq>pD0>7N$2Y%#cV}@#LHTj>js&krC22xO^ULiKMQh2k+^Z(5P0BQ@~_4m$>
zGq+jAD?#lGJ6zTSFTutt?ID+4+?*_9aclYFIqK%H^Q5Ou<}-|qz{XaU!uw47!_cg2
z830*15eoz<nw5fU(V`Q_wm-Bn?$nA)uF!|9!6Kf%5^+hCu!Kh7h-}OgaW{84gl*)U
z?S|(lJ$FbhNW!|e4*%w`i=P4bq4;q$Bc-FNR(%vFVJ(l1(sES}5ct{0aZ_3|ZqMBN
z-?e~Z!J_Fz5N91gJ|U=CD$hxjsM<ma*@m>JlH8?mmI>HS;LAy7LUD$02>P)bAvKP2
z+hx&8aEvSlDc`&Z&yyg=yNc^bjVQ@2GHtt>M+VG$=hen$y?uCm`qSQPpm2TK>GiD3
z7V4z|yt|}ot`2H0rQ|y^SiS?8Ug2uewHXl<tLl8Zpjk1FC|Um8-lZ>i+b>E`t-nPm
z59gCvcH<S_P~xZX1g$_be3Ebg0Gn1+KJl>$o%qoxb7JA<WWd5Z3>=e^-D<15-|z14
z*O-=a&fhMOu6;C9+q4F@#A>gy*f_{cZ`SbCy8jy%`|f>y*UC1BVVvITus+8z>^+zl
zD*B%|dU<Qx6ypQ~z(WXl2m&vQAL`=a(;^5PLoep63M^F#He@&9+?z{`h!m*UAY(6T
z%p57-BlM-LKkHeRjVwuv>>n2{-ZTOUeU%kt^MEp&LY@Sgbfj@x^Z;lIV4VDHn#OKQ
zH)-s@-+cNtT}yBL?jogAH|HRz6F?TTWK(Jznx(&)(~mY1CcvPEl?@7&%mBkllL<v>
zOu6G1la&pJDwzsMKc*Tc1WmGLPZX~SPn8|x$HxP%n}LDc;Qcc0Qv=%%$8(Syeu2*O
z-V!p^$2-(!b}`j78%3{W;Fx~ahl9%u8}o#FBY!}4*zVxPRnfmf&{g?Y4M#?|Cr@OI
zZa>RT78<1qZ$E5qjbOs?`;$*LGfCEGJ@F>~jaFlkzAQ8CWv3u*^r5}&heKI3?CFzF
zBusWChkG#mt_Z~j`ZWxkSBM`Vt>3uc3Yj)}cINjdpI;iKKyc<$YZ`?M<K!dGniS!O
zgt~%6y#f`CBlnUvD*p?Q@lWFwPN7iL`4y+dWzcHRe)s#mplVODkCT)QukD-uAXF{h
zS{(^JU}ENpwrp}*s<6+KpKd>#L9-*;*|6RjDXgN1^Y+684{6Dq2fP0wz1)8I>pWY2
z9M7>8_|q2^c|U~WFxl}O6(g=D4%JWVHL`ytva1H-7UN^5t^_3sQ*;na$qdcXLDt-Q
z)Fh0g?x86VhO6b89T*U%#KY>fCz#i*?%5~9(yD2)%>Pt;f_7y1f0{)o_K(OP`sBd(
zg&kbS`|UUH3jhK!7CIIch1<VNI5~<^)Jq}+1Fo$t9`14wUuLi1rvek}LkH-}h{!yw
zd+LdQ<%eVIndnisJ${r|YgAxTnYPpuyDfa?v{lIu%esK@EJu+$3sOJJ75xVff&7}5
zsxan_$w;~6NR})Q0=n%_(;FsdnAVY009DD%pqG24y)0+?;>|2EuCiMc-EdfD5JS&{
zDEc^`nQId3mL$9D@)sp~6RR!gbY=(C_+q(;JH^|@z0gC$Nt(gkJ4Wh3ld%c`_j19O
z!VdqTm@XaQjSfq))`W+^V5SQLFf6{x6J;1JT^5@5{g%D5-|l$NbG|g}RQhw4N~052
zkxZ9~Fs4=raP&AzLJU8;+_f2ZyMz~xd#K#Z{LF!X4cXzqD5#M?CXOn1^JgRZa|F#Q
z<9_ym-Bz&a%+S4>w|MYb&r2M2q2hf({1cIu^0dO;x!)1lu6Wzo>zJp?+&mkWjE}DZ
z&%MQ=O%R}C+VpVbk&P!W3@*vS2r^mUw*r;wG9E7FpdyPBhE{g2au#Fpot=$5A>xC6
zWmuHl25{)-5maLRfvTOKaB07!<dhK?N4*)$ZuL=uW?ZAX+5q3~aOdBt2ir25#X)Dz
zK}s=8iJfPoNKhQ-LrJfR3=ffeS$enZg2gu7eggfKM4-(cWm_3H7bjw7l|tDnyH_#=
z(x!(sTOM2N-Ay0?HcX;<NDL2KDOBW5E-?{ax-^1vmz(@n7?GF~T$xBAg7nB_J>1y3
zsfdf|`|yL+R_-{m#aI;tWOy$SH)wacfPS?Y&|(OWbVmKxY&P+)bB&+|-9n2^lynpm
zF=%WR!D-36%)1v4KV|OGcYD=alYSR?!w9pcV^9N48@=;j;B%M*@{Cb7*W$(D?&)>!
zI*LCck1&od!U4G>bG!&P`_HMZie)YQ2<L|CtR*C>pYsycck~xdl12X3#Guu3Zr4l?
zOyi~A*F`(We*Y=A#hqJ22IOoH{H(~GiNnQW##(O@Z6y7k1-ReDqWL#gLjK0~%)g;I
z^KWF${2O5EZxerJnNF>H*$<mJ|Ato1zbPZ<-_W@EH?nR1U?Y;~mVJsbn-Q^H4$7W4
zUBXp(%=ydnVh^>-+W-VB?_CswXqV@@i@Okbl=opdkz#Je=gT(C04{HLkKRM8Pn(<1
zHlKg9_2T){=ie;bI<MOT$b=V1^9cfl2L0lzZx((k^`~Dg+cn}!dB;ca*10QN*cPE&
zd1Dr}ep<G5Ezb9;(CC7t`+3<B0s5DZrx&Du?r2~mmXGGppRGQcJR^C>_;Q#PMPn3Q
zenz6RS<3A#UUs4%`I(6YB^-jYLJLZJ9Icd-Sp^J(>`0s;yJP|*Z?KRHg2io-flC4Y
zZLQS)Htf1Z4O_7OW^tHCRP3vnCOZ5Q@bY86`VA6_UE_P#!I<3Z(Dx=LADChmfKn}7
zqUnu~X~HJb&@K7Hh%X}<h^bz4@fb>`-HRrH8Q86r49#h7Y08YJOF8l%!`tGODH$H$
zh&Kkad1H>gg4yLMSej?qrt$V2Ex-iwdO4EY>EJSsrqMicR^>YIf=QS%%>C?2IMCNY
zr*QM0kD~#F*cVqxj*@{n<@{Kg<78W#sexf&4d`u<&WXW8f9Cnbcms2&b|nOVn#DDJ
zFTJ|REi5>`n8<7{+ZwSQcQ&`NY;%gIDR1!yDS@y#6=!Z=JAD0fDx6Dw>p4vICS6)>
zu62s<FdT?+ucgh2gKK)n6tRcI01OWzer<X|ln>kToZcPW-2F9)<OF}mbq?Q*4<!cy
zw3bH0tbJ|P-p5$s&!ryKU*F^`T#kLk9Ha2TOBBAn^vV(t(yL~Ag_mkjpWAuj<yzoE
zQ!Z8IVh>d@OeDVP6rcLjh-O`VlwQ@dk;y-SDgxH50b4t~3K}fAE!5HywCSaRxUzbp
zM*7@HpM8i>;_=fc{P)^7;}nvQ;jE$Dicsnghh)NZ-`QY$ebrvywD+e>$d5)1vSw=-
zgul;<pdA`E)92t3f5y<qbHCw_ul?Jkp$y4_hH~4!??j-{J~!IejrLWef6BDT5Bg3^
zesq^k$OIUEOoMCGpjH|cI(2k8y9`VO{;l$(+;#EG!a6`;Q3BSrD*v4RGp^Jto>xK6
z1zCz|gz2ir;WQw3K?!+aAIzCS;6QbA@js^(hX>Na$`CaWTyE7ZN^}#ox{H;b6d0RA
zuodfAtanC@LJv`bO%t+@s8>b7&c+Ma$=9{-UOd}=y0v6esEm@P;Bifw!>6?+TR<fg
zg-*;jqm^LGwgt~Fhw<}#OL7{?`_-EJ`i|zlUah&!7k9L``C_#OpKjgJAS~ue4Z`{_
zZt%skS^?4{+scSft*wanmnqsQCyOZuyZ@cr(Y$FNV9k<!pszQdZG7{h;C^#ScffND
zRO;Sq=7V=~Ty-4G(iSM>EqIQx1H28i8lms6cAOZltMrs(X1na*7E@Rv<tTo)fxE@W
zY1mrmf)DGJ_j@6^^kQ1?x2GR~8d~kDfUsCJcbBK9_Z}zwp_$2W;dUzB@eSK@1LJI3
z$sZgQb7;wm11peIxSR^hPs^5*O^Q}^#m&>e8{*}xK5Te+>zAnxUF=}ypJon%8FnQ;
zo)xDj4#@v|5U9lGfefaOqnkxZ5<)TOxK6Iaba3g|mN*f{P<$)Q+~WGf=5=3pWOBg|
zK~d#vS)^Dx2WkG}%LRjan;8zZT-0r*rQhA<yG)ldqhmo@LQ`46k#fPQypRKaE%t7!
z=ztJVYo1879J8!<3glUmZNFQ%e=oCHatgL$=E6U(B3NnTaXfTl;2Yua4vwwRFN6Zd
zA&j!&;#eIR2ZJD_Xia>nl<m+t=-|zXX{9rC&cSiu$IjcWYQZ7?M}$ig@u86xU)pDd
z7AHnTA45s>v1ZZ0j0IL}hN)4f>G)O!27@D$g41IVfo%>v#JMI{^(p75C;(jwiPsoK
z@gM*pEq~*en+m%nQMFxaM7cO|lkB^<NgQ@#v$k+AdZmH<B>JGe>P{TT%tAV`9E)Ok
zIiOh#8HsS2vk!1i7bi5e=Aa&Lsju#Zzs+>4Hi`z6S#BgM8tl@8u|nGBXp=_8`MHSH
zz1wN(-^jw1O-&L(EJ|9=5piGx568IGm&tKX(GL1f&O1ANW`Gi^6Ht>;5U-|C+*QEJ
z<bszu6q73Knge8F=$idj=b*iZL#^CV>y`JA#Lcyb$(lMsNC#b~G2w9PL1OakS^kT(
zrN_~Q(vsCUVliU!+tv^5{_EE6_oo>1!V(eetn(a#6}1YPSjD+S_li<Tiq$8!-!2<Q
z@%m5_X|&_;&#4+EoJP+aNoqlUzO<Y%HQao_2!W0DsGYamOrpBfOVFMUs~Z@^*F-gT
z7WkOPOxF?|A%a&o7l_qlnV^-2Vp9x&^B%~`QNMGv-|Zi?kCZ6%hY?`+pwm7&#kiuU
z?H^C?#s?m6<CO}TfZh}sWWsffVH@dz6kDo6oF}%Ike|<Vig}v|O#G^@0Z~^jbm~E^
zwp0g9{5^Ig;-6BF?Lc=n7F#W4ENz{~7@j)AeA^a0`TV^|{c;`#rb_<yBqj$qwjC`G
z{!pBGuGA#6YjW*udk@h&MfupkuL7gi?40V(6U*~5KXmA@NPxa`$*$f%9HPVKKPwND
ze^&6676&0%$XaHIKT{-rcTlQ)%_8TtH+9cqAcZzy*1pUnkuDym3qM3GH?Q=<S{AIO
zW(I%@Yuj+(+SW`lD*V||ueIOqQ-t3BN&C2aa>}$(l8YeXF*(0h@ydoxky79QzNIk6
z(>NH1I#?fKQ4<xdNi-3*Wu3&I#4_R^P>deFCg(KY&{8n<P&y`mX}k*^M+1s&NQcR7
zkgCS!lzg7T4)I8+I|}S39T9=1*t?PH@&H=L0ZYJk)mA9!UXa*J97Ig8mPjslPC!(}
zD_s#qZ&ie1jDuEds&+6v5>8kK5T*(`5yg<?IxxV1EAqUcgCr1GkeQ(#)s*g7RImt+
zUWdskK<woRj67Q?bph}ma;Q_h1vjI#+l%2n2-ngao&+d?z_?(56qW}VPCQdM)F2$M
z6xi_2{Njc5DJlqiRED1ZwTd!`u0`I%U&+IeRVd=CVbKZV8Jw3uh*5ql%CUn2s#fCQ
z4?9PnBor*|X_b*nBu9y(gguoQC1zgTm9{hM8dE%;1H?~pZ{$r*8eN@-{D5BJqU5Bc
zyV8#rb=M2n71`-aGI^87)e;?L^N|+!^cFWvt}B&^a`|axlZBVe%cNM%^@&=cY=73a
zxI16)5@^-?D1?!Gzn$)@a@OE5)@y>RjaR=W<kb$P?_Sw_4$k61P(H(g^`+-IkSlh(
zoR3u;OVL^Rhj~(o2)&3W%^uoO8P{zBvbpTGlCEUzuCTSN_(gnP?G83yhAtM_rJz*#
zcwM28Mxy1c{3JO@Wcf(lSxge(j+)J;8vm8wC)D(3FV$~~^;h+0btqf2#E{V>g(vT~
zo-38!m1ZmXmEtV<R}JgeeHCI88U~E2((jdVq_N^>u>kYM7hib2Xp~-~3EI9Nj^{C&
z22rGfaWKL-ZfGC`hj_{dsWSLl-0YiqJogTRVVIJB4$lnluOv8woXh~Sm+`Zt>`KZR
ze86W4NoVOLvXTACJPmI8Xx~?T1jYN@Eh8+yw02syfMh=`ppz&5wY8AH!Pk@4J0n-1
z)xi|0)Jc1<)AKkK6f)BuMcmx>b^#WTP+^${oR|#{47%_jo)D_KS6KOxsc3}17fg3P
zy<@^A*IWiqC?mr_!fIXw>EVEL!M4L$buQogKndpq!8MG42FN+A_WP~l<AZj;Pdd6U
z)Z@d}Zok{>|JeVbebNJJ-QV2kzo;phqTBlsShmfL<_pDJx=r4E{i6Tk8MG;ALg9jy
z;ldmww)vnxkzqAn_4`TE?DykP2-9Cd46$1apF(r1wG~)x3H!Wc%_NRDR8`tr+0oeG
zS{_=jcFMuU0haqe!YohU!V$mM$BY>57th=!xfdY*%|MmewN4ISJX3SawC2Z?zF;{;
zHv_x?1ntiT)xv&i3xN*=b$+9U4V@q0?_wO33F1XP`d+EWKPuFu8~i-RI_ui+cMgu9
zZsFr40M*1~zRCN|XCGdgu|3_=!^_O&u92+J;|se-vl6*A_qjh^w9_hGwro$ypkIbc
zxWaa;fDKDFiZy40l2-kAaG4ozt3}V2Y~8e6h)eq*%)RdIS=b~`7UI(~9Zv?%Ub#1E
z#D=U5TsVvFESS2pkSF(=Me;{Rp4>g!qad{gdv5^u`;7SgllGf_yL0^E6TsSO^TcYi
za3XuLe-Tah$G0o4WbQm-OOA{Prr5n*)=5<PTwhOS_Ps%9>9f%>bMrZRX1-z%%|^rK
ze_VaNKODwnrfok3@o@Gyd|6V3edF^r-iKK;EfEa30B};zmJpl0O7-E!*W;U-*Lda8
zw+bbBkI9XG(G6;ObDJ-8d-%1WL3P;&wJDM)nqJM~2vu|uUglq5s<b%K3CUqmPSnE!
zrmAc>ipfOgl0_EaDc^K@r@$(B{D67J2XdG~f8`9?og9Zckq`H*bKnni8-;MDH!v$U
zF{zxie%xkYdnd2e*MCk=cFp5G^H^2d>*%+=j;Zwe*gQVYRr=b~Z@=+OrOgffcylvX
zX>-fGeQH&DW*$G!RqE(*wD%A6+ufcXz<y7C^WLbh)=for%arnI{>?oqo!_U@;69ax
z_o@`$qf&C8O6Rlt^mLy}U*Dt7H}|NsxpALLoA;@-b)QO4?^Eg7eJVY_N2TySOUubJ
zR<1X=N1f3<>RfQ>a5=rQECMqg>$L^gUb|Zol+yzkCv|o#L;2f8`M*XY`C5P5)!+8y
zn<-C3pWgNKH=_9b>^M`t*OOO5gsD_Vm1kmXm)|qx^|yUh3dpp4y9b#L?n9=7`;h72
zK4dz$519_`L#BiKkm=w)WIDJHnNIGpzk+-2|KL8v<~~GYc%Q-jKS7)Vn>Z~{EiFTg
zZZs2kv#Gyn*6-$Nmc_f#{NK%U{q2SR_EoO@*ZSQzrYEb@9OrpsIL{l+dBRuIah~zK
z*)&7g{K|Yaoo{}VtFvWBv1QHO^uCp!{gxTUmYM&S>3u5?fh|3X(M)|C$Jt_uem5Ja
zZ-ZG9Yht}Rmfc`}rF+!cyjQKQd)0b+uUgOURqOe^YQ4But*`D?>+5^f`sRMCd{5-K
zA9ifs4?Q;Thaa2wLy*n;VaVqFP-OFdII?*^B-y+lmTcV*OSbMwL+*zqTld3~t@~lg
z*8Q+#>wZ|Wbw4cGT7)GfmrSEs$tBauEsf(()l%}w##DNRb`N$G&gEqoxRod6Ugz02
zcFSGuS(50#|9bB~L)KMtYO$=F6LocQ{mmA2SCw?tjp7Q_PO7Xx#8oFNP-3aF0?C&e
zD^NtKu>vua8Y|F2sj&hHRKU6ieDBfA>fl<1#gHm19Bxu$g;P`wYvmdnAMPQ->h&y9
zt}S)RZ|=A4Tbs{!E}1)*H@*GUZ&(yMtd4W{pn><<KC7el>Xcx0vUv~Md=El!k52vs
z(y=<K{Es<gR`29Khs@W1fYJh%m5|yc42FtH>R)*9L{-)IAC0E%M@!T8qfxQ_xMh<&
zUC(ISezdf0KN>aLk6X_R>%A}qzOw3>VQhU<RPX6V!BeAf(@MC1PG`ihYt0?zzwM(<
zM35w=2@Q?AmeMdKD^>Vr#R?>?uT)`k)e2jyR(QH<g=ec)c)n_d7pqqIYSjv>uJqQb
zEB$nZm7WcjE{eBD%eG1zWa;A04tnqxsRhJIzAa1FN-t&?*i|l1$ZQ79=G!cG?klf=
zgq*xE1)f{=o|(r_3+ru}0-IL74gI*iTU2i}+ZIzTFPtq)(&ReflMpn7Hd$S)QvRFO
zihsRY@vl}Z{$jP_&sQt{Y_;M~S1Z1?;ySHXeEC(SsFHp3gI%eI(ehLVi-)TfUxD0V
z@fAoO7ROEWrxQIM=VD|3jDhwd7n9Gj@+Xm%(Mov*3l}QCf^iF#U%{@0%CBJ3!sVAY
zOri2C7_#tum$&xd_E#*wyn!JVU*5KmimzZ+$mN%}DCF|X8xwN*<?RT${PHG*Tz+}$
zL9x+at^8^>Ls(^SA4?g*q$Mo)KHp)m|ILbIY!w^5dzD|2jICmnN99)}W2>0rar>*4
zU%>#6nqPe%tzve^`)<VvuT*>mn>j3gFLOCrhs8`&#vkl6)AVm)nvx|LrDO@_C|QCb
zN|s=Pk|h|QWC>;`S%SeymSAd<yBV3}ZssLff?-LPU{aDL7?WfPW+YjH0ZEo%I+7(A
zjbu6IB3Xr@NIo+WcS7?{#vxha@L#sf65IMtMj%<@@K2UF@RKDD`Q+|{Jz4HBPnI~q
zle-V?<nDtyx%+TVRymN9B@W?5ZqA?2VDHl_E?npB){iUPNxD^E-@oea{j2W%fvTN*
zSMA-u>g(hC_j>=Ts~A4GHCHi!aBHq)2$89}im^hb>MB+XnX0RpFJ!8&V#koFx{5(V
zF4V$(tL`7P-t_KUd$)HlGlU#Af99uFhkg70B)WZn65YN(oo(Nr&bIGQXWRFuv+euS
z+1|akRQnHY$oBmy!S4M#y?4$1d)Iv9Ql4c)%zWk*KVNcvzU2CR$@M?~lFN93m(x5V
z4W73*pUf}_C+5x5A)6@K_<T0wXwVoTE5#`I-QE+l5v|nhfLr_xt*qRbnv}T(o}O@=
zF5kn5u0WoX0l+WCCL@n>2zkRW4hERwNaC(@rX!fNcO9meoP>Ox%T~8)UUHjYO#3>#
z@KbN#Pbv6*0s{@F9yFeY@ERsg>G~3txEf7Ts2K`0%2~=2N*Bo8K|5<Hwv@*61ZQ2v
zX$Lp{WQN0@$0`Xq2am_5F!@r=gHq7u6!U(yjyoJ~KMsDGQ%*jgBBYOoO(>65cE=IM
zrcQZg1N^l|vxgPh$9zXYQms+Id5lmN&4Ov}wH@u10vAUY{WR()=`fmOd{mVkmxI^8
z-}r!0#Mb_~vG!6|8DR!yx88ReCwixQ-LupFe&?Wl)b&hmHXKaVZM^PvF}POyXz#af
zfA^%_I)%UQPP#`2Kh?dB7tfvv{z|B}(eR~&3_HWs!f3$+j%!-SVpvFB&QnWa#EJ{@
zwEhTOFkhBar^a1Xq1gqIV<iF_=UPZ`mjVX)gFv#u;nQ<?NY7w8h#pPODKVN)2}Lol
z1WbV_0-+V9Bfx^V_b@gtzB7@A6EE>c!T1(&%EMfCK{&%y9`gwX>xRan86~P5dsW;V
zssAzHym-38d`1D&txB+kF@194T}Id5#Gl^kZ3Dxg7`-ys1c!%du(7cxZnQlPuFSFa
zP&rA<Absf|+Vqy7@qTk-<AXs;de+DAcd%F+bw<*{9biY=#wgwVQ#yM5m_m8t5SeIc
zFe5!uD~*j)b~2T|3hQ)67`B-S0aBloNCh+j@PMXpH6w2rHFZl?CP#baM`4_#Uno;k
zXI=&s=-)c#byoqdVJ1+*M7iso0+M-5OLd$(gRD#sM?;DoE?NFCmbl8h=KTwX*CKdd
z`|%Wpj|2bRilz-~WCuBf;_rwagB;<R6c|Let*nzWOcZ_fc>eI1R3jQb{p5CX9*vX!
zXjpwj$h3(lk%`BxMl6MK)M~^E{2HpSRnyy_28^Y{r3a4%9qZQmH}o@_h?>IgIPj<Q
znHq30ebYqfj?)%{F<y+Lb2<T$;CYzz$=Ry(n4<05M+xQ%!J?eaqb{-klS~x%;`rYd
z(qhUj56+L{vr{KHBkyw6Jgmq?Fr|YR2h!urbrs4!xLl8>ttBg%AxaW2Oi58TQkgsr
zGi{B>oT0!TYh!cCex)f@T5_P|hc7QoaT8o~5)J3$fS0G~^`c3@)CgnD`_ripG|3zL
z38w78{IT$O6aZ<I+&dI@zG-8?A-9)Dfu%us*xfrjX!jPbwu?{zN}0xP1P9xI(>++J
zXgmqZ&ynu$hXO^wHDJWY@r09(`sa~E<*y9pF=p7T$Vv%Y876f;|2PGPJi`N2%8xOt
z5l)PTNx7N`pPSwxCp^OWAcbM}Qc?k8VM-E9Epgj%cyWojovxil+U0H-^IWFSN`%0L
z`qENy&S9O!V_>)-x1w1v`?uuQTXlDxot#jPJl<u5A;sGZMgu&DN&X=_%fgAlAd3nG
zePgP#X+>?c!tLZ_uJb6sFXgTqlq9d?G$+G=(m7f2dF2U{g}uPZMmI3&=*)4paNH_i
z+cqVOq&fU-L^J$I20Q7NGv2(kM-!g}qg_m6R+TdPd{k%4WdLkR$h;i!C7S801BW^X
zihBz}%E#cgjwm{Uwor^p!ePL27k+@73UJH9%=cc`DaRJHm`IK@K48p-@{=SQgp`<!
z6IeU>vlPs|SC}C-3-T);4##yEjWx?~khZ63e2WWWtp%oNUbGII9~@9YS!`(^I9)0;
zJm=Kab!;dLSxQtNWV2~;3};Eo{DVKnBFm)8!jV!sPz7CpBIQZ(!>JMxMnDv!Ym&oh
z9^067h*!U0d`@54<UVf1=iiIb1sb)ZINLYu#8(`jba(rQt>az|Uh*67uzh&i?w!Kp
zA5jb2=^pjG&8@GAzP5mVO;L&g=^41~D<vj#g5uyN7|anNM2t>?3-W`|f-V%sf|L+h
z0-5;G;4NmC=}-KbEA^si>aCAvmKcDEVnCkQdiKG77+p{XO7j@Guzt#!NBSJk8u%&s
zhA#_>T>*687tB4=B>uUhD9#jhEGR{hh@+^hmdO{1J0zf@h%3_chEyKSpyG(6^U4#9
zzx@Pu>*xtWtx~VV6{q^lu8xndFQJ#}2=-A@r4&di{y1jdsbl#s@>$hc@*?oSb_EE+
zzc>o4WNlHEv1Mk^5ldmx<IA`@tFJZIGMnxT=nr=WW)L!O)@P3&d$z2OALw;a)7~Fw
znhw|$XeG8(A<3?S@h9B<rwd#SlW5_4QCL-KMI%sox~1^O#`ea>QYGVSx0nm|z67a<
z!f7-gS9!6B$J%^RbHJD_itCv#C<3f1-!Q%8x~6R)i2i{ZHbw2`@&)w{q#`P17Vl$?
zne?mXo|KjK^>s{3HS=SU(~0m15#lbqhvOTs`fxl4UJc&XoCu2Qlhw@@%xH;9xyfaa
zQ45`FYAkok)QsqfNBB{c(LGo+U7COV*b$47oRA+Lk(pxNM{4F+A7^xxW~IKl{Ai@l
z$2*#y&*DHhUe0wd*&QsP{`{eCpanlR%OIs%|IVwlE8ezO=`KCC-}AygUid9jUGY&z
z-P88A*CF*99J{w(I6>vOkD`H6V={~7>bRpR@K?avD@N)(pnRlM1N#b5<qT^Rkf;XG
zf>V(bkj|$-!Ifs7GO8-YGq)r-O@awXe3+jNK`i<SUUSi3&NSOys##!UqJx3qjDk}}
z*PwX<(lyu_vp$C7@gZ<Crxe&Mr=f-x%^9RJcHtparPD=3k_j}RLZd;Oj~?mdUIQP*
z+Htk8TrHQY3_Gbpmv}lzv7e)GT3nq7U5$pZk>&SFa${fv9ydUj4=C1wxQBfNL&<)M
znIaL4I1W2iW^u;pyZcFlcoI&Lr>^99JC%mx`%v=s#`CH0l~_0Ns+=PiFlDNQ*BWx6
z@N+&Lpz_JP_HQ#vX_QZsOUlTrZdVAG>8c}4*AjEnf(qd@no-}X&yh+43_p`-N}A_g
zEjY7CJd7wqF)FOF<!CAy^626PWRMh>9Uu2PZ+h)FKhU6~co@W@C7%T`O7wWO<Qrl?
zAdv^}S5P8RbLU}Af`qmm-M(;nBXlDcGX}ftW(K=ee!ejJ-l`x^v23SnJyaQKhS5HZ
z@sPSaMN+7GSj2iObXKSvOlWd;+Czm4n5f!1@hpAq@}m2Gt9OcAe)r@j4_Vlp+^%Mr
znY0?_-CTSwQ~R=s1=WWVQpyn9Cnwz#Z?ApY-aT#aeIc^$Z8VP+6k5I3u?IEW87$s}
z%MN7ULOJ3!jxjUqUL9{x0@S<O13@|gv>6jt2i|!ceGH~e?-;gTLfaKE*lvk754M4K
zKF~^n(3OPNK{GQMp#h6%HPeS441#Z|svx4zCx|~79g<R;>s*X*ny@s4gMeZAH+cU1
zAK*^@5AHhRoPfRscn?hXLQt&zHQqFh$G_A-fWhVxRuT;5YMJgwSU-+!;47V&JQ|HK
z*)VG;Zap~iP<6>yV3hmY>`!d&$FE=PLbXJ0nT+7pr|i#KlgUqhmYX5Pow3}4f`Va2
z_r`rvVBkM5)p1Wrms6F>{Tvph5sYA}037O=7*jnpf1>864(ACR<00M~ry-CWeIPq*
zqIa26f>;>Mzc%b^8JGt!XwLwMKzF~577t%!`8O!kcvi^0&47)f^X#VmwIv@2hl5lf
z)@!$Qa3G7-w26f~LO==-4D*Sr5PFY)e*D~^p_ByHZ@r3lu}`=9>3Xd?gHoH>T+zcZ
z)>phB*Q|SwZ~^!r#<QPv-NSL%Po@ao0wGj22Vmqj9&Ox=Ml^N)oh^(Xktizr>QWH!
zed7iN12~3QkthRl2ar*|;3wO!>eem!yYuU3gwQiuiymK42AJUR9N55c0y`4bX3lz8
zN4(wxyRc}j7<EbQ&at^}RnyHQv;}m!NwYwGS2FBE`e#mzy|cq(DCO;T_u5|Tq<eO>
zN4JOi;Bf2pXp>O3-|9KgKKM4P<x27Ogeg^6=u7YBX6Q9yuQBtUq?6ebgiP}?xUqhn
zhtq<3(fQAmt*p`Thd<9@XJ1YHormyy&ug5+QcQiI!;OiD_Q%^mAR8~9-O;9=tqUd>
zgX-3ACR_UVDD!@Vvo323>t@7qrhT|gX?LPIKtsN}^<I|j^W;|)zHbvC7Ncsvx7$B%
zy=nJ4|7d4+E>ot>Z@=AqDl!vD9>WOl%P;+_z%mku@C5w&qgRE$;V8tj#=>g+V7kaq
zP67#sqHGSP!A<JT{0o4|^<_A?B%1~}Oe<*jklwn`2WmSGCumWFoT(f+$jrho)Ec8S
zhs%vijp|B1!aO)_gKRs*AtU<oX~cK`aTHDJXyijYZW2XP;KZ_%;Y~=$y5q@~EQNg@
z{xo5zm?5*ckdI+;YThI7|5lS<8=JL7t*}O{unm~^%N*gv@~^1xn$*SbZaKy)eA~#j
zjI%9KNxuzl(5%drXH<$ng(L;a7s7iw$K8gVlfS4?mQ2Dpli=b?a%z)t5IjOo;R06$
zlMdqFx-4803}SO$oE@D3BUhD&FYRYUI9E@~uE$wn$>(9hq7GjhvULy8yCDvcVkhAb
z5F;szw#rag=PBS28n2|BrQ3y<C<=?Lgwb-%lh<dxy9m8C#@1jUVv-651{4_YBly79
z1F$HO(Xcqf^S;II`vAHVb*9t1836qY(Y!1kl~+L_i{W(K*@Kac0ZM1|4Iw0XGVPWv
z5Y0o&V5B@jyqk-X_K<$EUh^0cxE+1k^4-&+l;bqv)@oph0-og#$nOeL7zsWgL747T
zh*^=Pz~kOg`MD-o`H^w9dsWm<!)a_e=`ArxG!8~?#Onp1%g$BLCC{kvnC-rt6!)8i
z-<HIj8;LEG%auOeE~7kQ+jIzRc1>L@dz%9`?NYiBeLt?NxmWL*nxD!TL;A99F|3|W
zKq$0DLbPo4MaRfml4~D?xj4MIfOCqrhY~fTIG&RMpzbE8d$6GFtO3$Vl<$8C{T>k|
zHsQl{QGylWB0lj2B?swpCISzDYuo{HL^RENef9>v9d}Poz4p-_+Dv=|8EPJryaj+8
z&w+Z7?PKq>1%==#m4g=kNeoy;@JtEOGzSYj01&(qBPxa#mdTt{Nf%*yIX~Za+rZCd
zn$EVLJmL4vK{R<1BdL~useYns_2$Ve05F`i4q09L9a^+{RJI{zSB(ZPTth8l<Pj%y
z3y9F<cC6JVQw7vb0nd}vUV3}PQjvU2uWGEY5*2`6V_0`fhouh!Ru&C?cs0dK8=$=M
zESb+x8;{Do9g(x-4bV+gUDtr67>Co3)y!i{I{m^ykgV`2_2x;?4{pM=A5Hr+e;N+l
zB*yrvYBMwbd1Q`Iqjfh}0ow>GX@hVvni0cTpI0783+_nI)*mW~oK3*7CDFnlfeOfw
zL9}Tah|nk*prBr&`UnubnfU#QpL~?@$rCc_hhw1E>K}plvkzz7Z}_8o#D<&n<D}hd
zpT2D!?KxG&kk_Nbxxcr6psteDuBy^ekA1UUl%-un;ttDFt<^QT1W4@^e2`pSxVF0p
znIT#V(DR~7JEYuaCMwI$kySMtFtR3vE;<wwb>)xeL6I_s%Hl=*i{~Hez$F(dWv&1i
z)Pi+?kN?0Tyhqu(vaz}K^x5+lUw!?Je?EZIsFEc+RUTRe#YT_=6}$QHS9RZqHWe~r
z!#$p(QSN+XUxr&lrxIi;t_M?HzpA}@r3?zVz-G1pssx-8TOV?_%;%^J*fPISqth@y
zuhgZU+FIug7$@#qkVk>LBhGx$tp$={0*Ru)c(v&A)z0L3>zRMc8>+AhvK;diD)pjK
zdW|<z@BDOdIgCnB&ceLED%$@oh@($Xd)B;sCHQzPjWFd|owxtP450C<VP3>MC!Pjh
zxN?H^gg2`T*nK$P)HG~^AyTh+?^>t3Z}+-yywlDh(3bX(#~nC3QME$;H>HzVjukBM
z5Gor^4^ErgZEqSWmmne|mQzF1atK<g#YV%vSy1X};Cz7<@_ZzUt%H+8*sSA_E?fOk
zN|!ir7{Iwp`UJfE2_v$mngCUVGYw`rOz5JiGlE7CcVaT$ALC^Oh*{FXu%7V?pc5eu
z8ma*DYHa>amteX_!bWUdb)CQwYBQ3$OJD=ck>cX6^uahx$jhx|7_5-mLW{F7HGIN5
z9I3f$<L;dC7)~H<!tqNKwV7V^0X%pgN(G;6ZfuBEK&I53i&eSYLo8QYH>F_&%$fM}
zG(tn#0hte?9~DTznXX}KGy&7Q)2ID<?z{&Y%CoO_2=n0#Z5^P}(wv2iG3_ZU=n*Xx
zp;2%)jKZB5qt}S}07a?_)`l$ALf~lVsl^is*P}X@0y*-$fO%F6tcMTWJ-lW6OodK$
zw7CRMh;(gu>l&nUMg``B3~gUmzCw<s%3^Ga_!|7=c^lY_C}rh}m|5%;Q)XL7DMhQY
zvkO=oZL!)>?t0TvcrlNybxXWtf=*F#m7QLPgTUGdT&#|}H%v6!7e#oDEi|hbRnQMH
zia!D#k3)bnaMSzY4K`!hZNMr|gJ5WJi3SmH$KWP;B4}{=Yi)hYGI-!Z-&!?lo~~)*
z6V@mp6jG0F4qBwP&Ql)4z?Pt+r#j;Ov&U#v3>E9zjf?4h;dl%bV)Rnm!t%Rn359mZ
z<^o`BFdTY{5aywvkg2D<vm6IHTybQ)J8zEUETAL6AH(*FL282CHN(?vdZCt|>nALc
zVuQcTgLzOSF)Sf4Y%GukU`QERV8Na#UFQw8#K%z*k~MBPoz2O3DH#XBj3C8?a1ckD
z5FP~=zFT?}^C0Nn7MN+fJnXb4fS|Ft0a7SlEyEu0rv5a_5mu5o_JXm0OGFjPy`{(L
zk)8zj%PB7v?p9QJ@JQJtDj@|3voT%*w0&?%Y9C+{(_li9a^05nuKimwiW*$vbeI58
zd*q0LI#;w_O4JEPuTUZy^DRUgOdXM$4ybPtYt;!EL+>D#KlB<r8xp6#^ES8jDJRvi
z3bxKaa9#da@kf*gbm{ygi3d-nL5gGvZ!-oZbyocVk=l6i;u-$k{Ob9J{dZ&I+0(6!
z7hnCa&1aiiFP=aD3Z$+7wXykP>*>?~<!yYT{uh4c$VGVG|C*oAr|En_xjWwfKl*vX
z{^8N=mQ@>7K%K3Pjc*!TAo<q4o<F|wQ&eE|d^j1$A#mc}xBfH@<KS0RfLu)caO@4E
z6!yvF6}Htvwieq;JT}7&v>Q5IL!@zdK4+>8TM4ZaVUs1%JcjLvPvj~TO{`$E6GMf*
z?rd0vtxO`|_|b0|+NhHS;tcK7QdCUM;^-<wUl}q`bX^>fJcO)}z)F)K-Ij5Axv?c|
z{z!wOD}@Q3eQ<cNbzFd|qbq!+;5Ln5SL5yJI?)3n@4)Plr@!5?Ts@jmL9c_cPe(}E
zP@qc-C~7D$)!|%Nk<4h+C}dFg8jZ&jRZR_}0lDw^YUQ4wnJHPh0ZR@i0G?AC`kD>4
zC!*(f6og_P7kFf5p`#&8BlDD&AOtKz0!(e79qxp^+|V*m!#YA09J~w=QD6*{C=EOY
zPl`V7ad@R%+6fYd>o7<~2OIP31H1!3l#3Ckri@)lA~PUo_P3p$*X!<|f@s<H;QR4O
z_lM3Nh{>;if|qS?w|o54N$1VmQ}1o}V6T1B^IAuH@bu{Pr1Sdhv<nX^tsc~@(2jw3
zt)rh%);?+XdS3U$>l_{*bf7)x;G}hQ+G+RdUgv1{;B1esr=ShA4fYN?hn-U>cG|6D
zza)j`YI@y$4+NUsxA3#|x^vJu{fWBV@0=cCcl*#^%R6qJoOX844q7MP@!837w@0nv
z{PsG%-Gdg$M0+5H9znle`v<)B=)Fa29(TIkcSr3LoPaae*VNWQr}g@v&E3Il_c|x-
z-BX;F`L+u{gh7Jb)jMwQcJNF4$2QEUb@Edknk8D*J?gdpeg@^>y|>poM56((dIxmS
zGVSc7eTW0^?qfT>v)8@T&gt1{+k4aP?h)8~?UNrmyY1df@1WZwz@7Elb?D@@h23K-
z05y0G-(R2gItV`k`q63o<mBx5w9`GR!J5AV2muUQsDmL`caLb!04y{igmw`av=nvk
z-P<-ihc!Qv>7h~uz|jK$?w;Buq1RKqyD*dWj@oYyI&a!XyKQ{i#fIK>dhHr7UZ;m;
zI^6lY)=%g(i@oEb!Pxk#h0AqXTCcP3wf27K;NZD1wgxEC>j?V5)85(cTY)~uWH3s!
zijqhw)-yOofQ`HIGmqg9UI{u6NeP!kgO5RqYB=}#JdE6jKz=UWCxi5M#tJ;!S{%6K
z<2XvAK{RfYku=a1popvo4r26gsT-$N;F(AgkCJp2O#{A^J3&L-Y!PTwF0R{G=tKPu
zwYjgyIDBS`St1~cgaz}ZB=m|EwT6X<Ur8P%n@J-A0OuGD@JOy3*;4BodVt2_Nsmj$
z5Fvwq)O(;T0<86grsD+>K~z8+GI%B@gJ=R=Ih_NRV=_=p<kipTqY)Itq0$tTSK2W7
z$Akvjg9qqZ>m_a^j^q+ee}+j53mvC%Re7q5H^8r4o#Gc%lS{39vEbuR(4~;X1HSB{
zp#zgmAi*x#1047Oc5WnhMw|!Rn96JAEJ~0N6iQ0rW#)Jhr0hA&j*z`!g3)F8wzJA^
zrIG95-b&za`VP(<x^^XBr>Gt^ULm?7E8l(nw?1zAqc=*@B9WsCMS>}CA?R7IE;sP@
z5zE8Q?;;^U4f(c$UIzY=?Z}z0***k9c(Ppx`l!|r|0kT1G%*awjdI)g^dXA>ZB7@)
zX>b7;p~g$FRzBveaLFy?IGA1_lQ+sO3I~o+Hv34@?^qx*n1ZFBPYD^4nLh{?EZRXZ
z{SR0wbirC}iHa(HibY{6*96`Yq*LM-hw~Y6iFhB39P?#lOW5o1T2V%*@&hV##SBdY
zbYR{Sxr0|@@;QB3@|v!j6c$zm`?AGq-eV8iL35j5l{pgnDa>xG=-B2(d?UDIO#vC*
zNhu2jobg?A`<1TABc@JtO$jhNM7;>(m$nyIw?gNtrgD1vW$uq{j7+M2{ajN!mpbDO
zdE!Ke;9xltcLiUgk(^@lIid&cA--K#h9$}a2H0hg=8`Z42?2;HZaZPiVK~+*TXoIZ
zC-cDGTEpQHh)Aa(2<iY4+<9HuCb1ECpxwse02b?9L;!o>Q<Sw#tTgEld3F>+hnBVl
z)o0|pHi@p3(UK}Y&CZw<ZRjy25z<sMKKTv<1CR`SkR?IJV1rGc4qo=NL!DIwGJx+G
zw+tGuxVJuzyHDfZp*bA*Nt%I!Kw%Cj^5Pkgp%6E~Wg1QAFP>GQC2cPj`!}5_lAcTh
z{ct)AZt7L%_IkbcC>$#HRA{0;s5=)GohgWU{+QSZ28=%kC{0t5ok<%NF!N?JN?f>y
zAr6S7w4hdg<&Dl<C=Z^$G2@m6=}ey--GoXSZMhD_XO*?ou^4SIAyuUe2o73N^JCNn
zyAJBeq<G^MD?T3~qkGcF2)F&CE_%z<yho3m`)KR)#iHsU2%!YCXZAaGe!>$S7J|qL
zgdx+;PLp;yyN@BFe+*|c2`cC(jv<KyXrv4<!V4(sCthV5&HN;(aFh(X!~vn#XcJ|u
zeOVO()E89?o{PYhaWQv4cQvAcwg~Lr7ul6`2(vSE0=|ZI96)JBoucV9kf3Y$-93Wf
zS=qT#vy7q;j7U!?j*d^-hbdp~XkRE|i>YHE6c~U)Iu6v{X{uFYrjoeo(R?hndA>MI
z0%tve<x1#^ClTi(6|+L$08Q1s6e*#JNs>;ycW7*`TS0|}j(C9_JQ8!&jMPsuUXH$Z
zFbAfK+=gpNm~kj&lXBvzSl}fP!|$VLN+&G8eCfR7OViWA>?mT5e5Q<bZ<7vYAA?}#
z<0ZUnzlC+ahgU6pMJ?2e>bN}v9Ye8A*#l55bPpZ=eICTOXezL42kWt_9mnAntnr?o
z`ciG6Zw-Z4#PBqG=hZ=dBTM4ta0msFS^9kwq@C#?Rx?Gr_r5Mz_pGnVN{tQ&wDNJA
zgU4}@pf&K8en5!2Lxb1PNV~>1vicctIe^IKLI@uHa^BB9Lg+9nW+Ef$w{lO_UtCJP
z?au=LqtiO<W#*)<XB3_%^WZ8wczo6e-nS1@u~RsT(GJHS_jAqIZ*uJoCIsEaE3}>E
zAI^L7s5_sJKe9){h6P3Stg)#dCg^9JDVVu_!#;_n(7lo*qwlnpCF3-_!D2R(oIR0i
z7C2{PI?O#ZbUi)*(WG_S2Ks%}cFOcYX75MH8U<(~iJ>FiRhf;W(J1rGANGr1Kzq<a
zzx0JnGxG+g+@GP_CoBmE;<d{pWB)23o{Fq!`(*f&FCei)oVDUN1Ape@t>yumDDAe6
zTX`_t3a7S9G`#A<@wU&NIt~gU5~J3*Pd+~Y4<E0FGc&{{VT~~T@gYe{Rn=s@NSLTO
zwf5$-Y^4I>$_({f_Rs5s?(X;PJ$I7lvuM`D!Ep%M4fn;z;5LznQUZZTEN_1w+`bL`
z*>OZDNgeJ%p;PFoZr%Ut4wRdwOJ4BR4WZ3N9L;A7-ivZ8w~*N;fV<A3DixW|CkQEE
z7?S);!Pz8mA#j~VSGvZAwG^ln;>B!!p3Kktz;wfrI4%X=5`dGIW`2t5i}DVGAP#fH
z2vwp*6um$Yao*1`_Q$aNz0^muI=uJo<DGCED2lXET5c8xqwt3IN>O`*7-$S_cUI8#
z=V)kN)MBorAUC^L^iO{}Mq+ky*s=}+WC`&a{hU$5JtgdyFwF332#0uKDfX*yUKQ@+
z%)-^}ux39*T7Z+fqys3goK+K89z4ug*&?@k3DO)tI>a-nhvZ(r6h3)StT+IwpJe1?
zZA@aR3RpUq=o>_tMd=&HuD&->ng`L*Te3Yc%31<kzYWrL<~7G-r9WnhFV-h@4&s5~
zy3`oxI(JTE^h-vFJgS7^pw^UqnsU30xR?aEVbHJ+oXz!7|L%>WXof6jpe{LiND^@s
zHGjv<<4~kuj0mp4SyRTI=wpMI-*St}ew*mv=@GV>;h_rMk2&=CwYryP*imo;0V+mo
zxQxbRC<;u(b+ASTqGT!}P^6l+jh!X1cen_RS97}sBB{1`bu~%6Fr*b)u+|haMaw25
zT4!bHI*g`tgU=TebQ+_z4$HpulcuQc3xUK0z^|*;XaEU2Rgl65h=n6_kZi65Od$;z
z1RfQn?@l_WZAZdX=cw>SImXD5YIB8|ec;mFqk|5VfAol?)M7rWR%21cNJJRUfp7wr
z1!L*pWj3#n(pF`*0-zJ=o^XaH2qwcu>2CnjXmd!gCO@m~W6UQ*%|y9~+3lEhb~o^;
zQm5%n(+Kb=Q$wXaV>g7`r!Ha3^~O_b9H$EzI`@=tAdAeXeA}Q3#9Bgp3eHo2{SMST
zG5uC3L^UNck_w|?5c?W-7x`?VstHkf;6^>r==Ix9A$}PN(NcT9#XG@_woZvhy#I~V
zSVWvD2L$<=24r+jJf%d|x`<R%x!9j3=xsg?u8Fz`{WAb2*K?RQtUcN;go$g|p)6gL
znX4=c(|Xy6x^b^M#fZgYja8^Vt#N}^oF++;;O+Li-*e=ZiR(^Rx@c4Ks~4nVWI`Iw
z+TlxOk;eoF5ff_DYU%-E+(>1g(Ofh&)<n9~tLt!Rtk%IeP9If8Y^gezJQ3pvHg2oC
zPd1ChnbhhOod&P0@vccVMB^p1Xo)4Dk54scJSo@*zyQ&LVEg1m8<*H6I6NC2?g(Zb
zUrH0vBASA&@F{0OJYx&xCqbf+Vzb8i9GofwKt<fo1JxDYtC1cncUFiUjjAHCW)nk-
z=;Yku-i&JBm%{<I@3>yKe9T}}P&wJJCEy+F<_Cj0h~<8&Y?I{RkU7egv}#NPD&ake
zWhU5#2KVhu%rOb6@_W%2ih&lK^KhKj6_ErP6dUA_4(s~RH%ORdj?$*W(P9LE@#=O=
z3^WW)G#xTN=1*rG%63LUD20DHjfe{<Q`%D;HEau&e^Lf1&KORBM4?+`f|*%3=1=wM
zuMtHd12aJAufsbRV>%%{x7CK`0Iv##JveLqCSN(cd#z?;yiv@;z@^;oLATfLQ<N<_
zERkElSUyUBiR;c3M`h3`8$_-_t8Z8lD_H_NdLs{k)-U_s6R-Du=a_+j^i|@KAeIrn
zgjW2el9^LueQ4}A=K;1`D;vk5&zX|AH$~Z`!#ZAjp((L~XRCLLYWVKSZkrn?cxm>H
zz~+py05;r+!&((FV)?#`=Rk~{Xe%=XC^n0s#Kc7+@kJ`E*6@=su?kKa5NQFm6E7E%
zCx8l7LnMvHtxJx0+O0LE?^g{PR8{=LNxQXY;prMNhUg;R=}MG9HY}%MsAdq4)hX(`
zXDE;o<}2%*)k&O-kpn-^?9jYOgZl8~3~xDfL_Kdl)8t6a#^Ssg!f*XVw?GJo#=^)J
zFJR1Z;<bz#zg%3g?qN{J8O3;cse-n#Jrc`=LhM~LBszP;Bzs@sP!nds8lUn*wvEv>
z`zX5^i{OZGCBh8##;TugAj*iW1#Hn|mg*6Z<2s#TY8&uvuYgTmF$v>DzBNrY*S1e5
z5#&@QWMMHIn%JOOHY1XAf^GxE3{3(m=~xn6nhcrG=^!=dn`ua&ZK&-f9q4KFntC?}
zTivs*_>u)d`TQ&3z=(_7(WW7E8B%NLOA(7kl^zoNr{o)m1g`X);=@pp3c8p>6K2Dt
zm`N%j3LvJoEiRc({Y2PPv}_LDCc6VNqtfc*n)k~1JLQfux^31r^0KB#--2m0zqn+}
zDGO#g7atpFxt#;U{>qds>{D!W7}Ae5!0Sof_{8g{k9XkV%d))-a#xZ^X$4VjN<tWn
zim7dm2pbH;RL%ig{33>duU=!knB-qAK{#_gXtXUF8_AmVG&+FJRzk=X(M!e8fo@RV
z^w!5y+tNg@cbPp^iaIK&F#S%q!NyGEX>D87o(eCFB5w_=ttoSRx(p{@sc@uSL4lxQ
z)2LB4A{B~n79!I?_5#4JI2fY2T}>I8(!rIGN&tgmOm5ls2Y^qVA*-+28ATZ28hw&I
zWcyK9qJ=~}AR<MX#vhe2p~c(i1BDoA!T=n$SQ=7GI>@Pw)>tYN>K5H(s4Kj`QreG^
z(#DWaC{$uucpQ+s?4=}pB%4!PSAo(f&DimjHKd9HJBDMnQ}Y_~10nY^TOR#BFt{jH
zd$ofw_zwTs=0~Qy>_Tn|uWcV&%>t^{sVVCw+`Pr85%|*TJpTwOLBoFdyG<mrz|<BL
z0*Sh%KM={BZJl{f`mO>hz+gwmC*9Mo@Xfn#&yK$Dzy9g8-7A2p<PqRdf+f|yD|@l+
zX@aDnk})O0fO#eMh88$s)|3{J!W3G@+(3xdN=;g=xmXCHyT@A<KwUQ1Wt?r4j-_yA
zcih=!k%aKVjeD21`qNjI)U0hu;ohk}wsG2WL8l1uOlP~(F0n{_&>!G+>j~esRtLr`
z;`e_SANMxAKoiIUR*v~j;^QKRVRBeHo$J!5T1+dxSTzEdE}B|xyc1%&SH0%q8BFTX
ze-n!+Y$4xWdTa1^O_4-&EejHjf36<aovl6;6{)umLb0qq|JgqHiuDu}6&4Tq%%MkS
zLBpgywR0_Di`f8B1uSA6%8`L|U71VE@0#h&kxPmX_65xdE^=IN90k47R@P!Bu8p`m
zN2eJQxKFlNmT@-f)@TtDeH{So1W*fG=g%c<V#qmPQKyPISSPT#h8peoH1g9FHjz4x
z@B$IzujU#m(lNOzaurnR>DGtbImD(f<M9?ZT(z>NQ0f$pnyBIT^3D~+2I$~eWxZ4-
zXLStNSyg|G(ZQ;fcX7nt2G+8nT&}RWR>=??wQtbTW-ZZMX2Bk*qY)u28m2Z2;K3kO
zSE0sPhkf1yJ93K}LJy>KYfm|@G)wI#2jNbQC>`8jEV)E`%P<d&qgWd{ORjR-CDwx3
zA;QfWU$lgY+BQkiwkugeyApR|55l@d8Rx`q(GjDJfLE;)5`QLcUl<#oHFQp>9RaUe
zt~9>YA=Wc;GTBq(F~^?ErWo%didDcAHBpzNnzdB76vWs7B7_6(RrqFoYpx7Sr-UCu
zpV2QCp0JZFKYL&<U{#2aQ$x_{{Gcl|%;`)`l5dpcRmRGNu&)V&PZ!(hSbLKO;v^j0
zgb4?q$9L8s#EVC6B4z%0Or~yD7L=AgFBT(VF%>CAKc*ilhi4AQ<dQ&q%~T`gRoHAc
zEn5Kz428;&Q1+TeM)pGEC8cPNb#qM<Pt@H^gVIe<pmS>9JLGtc-|n8g`u1S|m3#R`
z?XbhT6@m&)n%O4UU@KCux~W6^0IO*iZY`#f9r1OjZn?O21;^!8v<u=zFb(2xKsQhB
z7@U|*r0LO;xk#EoMoANd{#}S{<UIb*_@C1}4iN~HqGJV2GR_LhDNse{LgSN!yR0-|
z@hWV5;R4grm}~gR;xjdEdR+~rYclj_2vuAI20S1!LNbQ-17yTRblL4u7s%G1t0*p+
z_qN6)R~MmHsc&iA-HTZH;VTZ5BAWS<ZAp|S81xC*J+DgXYE{Ugx;LK<DLFfmK>%xz
z4w^NyB-j+KM~?AZYB{EZm>6E$g-Jntj*?I&tPl>OpGK)a?o+Y8TzaT@g}FAlF&ew2
zm%kSdu%X+XSm0H0@i{C!-w0#65+tKfw>VB?Z8=175X541)%*zToKdramFwQqGImE+
z0o8dR0eX}p4RaO3x~zF?brFbRe55h(w&82mEMMwoBR=vf%i;o@+SB1N8If1{SxwhO
zfix2WvS=#F<ITEh$cZ{%m^+8Ai^KpB1NE|wnzb@?Ifg1%(ZSg3n2n;p1XvB9W1_@T
z3}(!;g51PFUDt}`1W`71u`QTNN(^N@fY_$>WNJUMC7G?BwC<#vUQ69&n;EfV8*(|S
zF}k|47z;%s*5O$4FYrD-Rbx=M)TsBJM#7x}{;Q@iyDA%A1UEhksDS$0nX4}Nw0~$F
zcxx0$sEI?ZRuH0<`uFXhdXx{>v)@fY`V~&1Qd{#jy_-yn@3i-y43iEA*l{x$eyZ}_
z#Y|zQ7lGDG@|MH!CaNidj*63_pxpG{N~$DQGKp^vnR|dtG>08amJkWwY^%0X$`gdP
zQTPvAyWD!0<XNTj9+K4}yVH1dyr0iWppX>ZmN(WwOk81sg|~s<RXdjZK=~TmR<L}{
ziib$yYcgA-x9m5f-*)!;t?qt4nQ9u<y>*N&U}<ASKYd4i`~b{$yb8Q%$Q^BiQL5r@
zc8XoFqryT|a@+cj*%tT8$WhXhn1$!NDrzZT*lsG<&+jgz`1a%3#y2l&A^_v}ml-$@
zCPT5@wtP*#vwn!L&bC+ic0T<$jjpG!tUik~JR`JDI;Wjo*njYyB%+52>%RGRT2q!x
z@{;VQg7#V|*2b*h&2?bOm{pkR;1;&a+MUf|-f1A82t%~-tz&|Qv<Bc|B{KsfbIvTn
zcM~z3%rBAT<7Uk`6c!Ze158q0q7B3MyI7E1M%M?(=%lZ?QZ+~Qt=5STnNL}K4u-|d
zh%xmGyfrAXrsOi@^`)k<eJ0MsV)PNhE+dQ_^VxJ9e#}T4y&(s2A|4$Xek{Rvt#QD~
z4GUQ3624lcGS6!8Fqx!)%&7V3q*iQbmKCIztTa=x3e<yIV~fKmb}puLwHbpniRgv%
zw6ewpLD9%b-e3TVqEyF4;oyPR^<;j6Wjt!Z1RX)64h2-MTr0C?e%kqRpKLa$d&=mM
zmRBMvT*+#ZmYcX<z&j?ME2oq;j4Ag81xmv{1$Ps07!|wwf(V~KV)tCOJp`<x{qaw<
zwYjCZ0wvJdr^d=KWHd?Z9&koFh>cI)G@dVsz~MJ-<*GlcLs>I_FJafnfuCMU5;)^1
ziAC$aN~r>Ez^1S2-$*{<aDoHJD>Af)OstdxUX`v9l<5!KP@LZu0aqu%lEDD9CMW=~
zxM;ewvSF|RLyY{a>0A^DlW;g3>swa|H)PZVT1=W!B1NO{K-$M)`kI*mP5c>&M`lp)
z7mks-=WS&~T^B#|io!f@-l<G<^{s$^^W+{XhMX+^xT3R4-(Q9=7+dM6=xug5?tJQ8
zND(QiQrgvj-liy<))ES1Bd>{dJ<yK<AHxItDw>rdd?AgrLkpC?G9XY2d=MwE!f1|(
zgad7pK>in4GO3&7JmMjN8;@$*@rfumsoB=Dttgj|8Hyb0*dSScl4OS|Zf$~w%@cIa
zsCm4a?O_kaVO#zu8Iw3#HogRR?h!G@dBFPc>{76$6K32C#uSElj8fgjrB`LsD~$Q=
zdz(+5$;#;Q=&So$Mn@V4Yj{#qBPgN{0`_Bx228Dwy2nPu9w!lb!Eu7uF}l>EiiV;=
z^O_4b;WZMOoxm`pIYKa+)G#t)s;|=8GGwTZ3S!>$vKB4{_9eh8TW_9t&ul*1DpqPo
zk#&U<Vi}ExeX(7ztpMzn(X2rxS7lQg+XCg^W@1tGQ!ywRMX`M!sw2yx<Erv|t^J!!
zGI9>+S?dYcAV`7JHOp{zq(C}%g_)3Gi1b#;B{}0uamFDt1mUIV?8mEPva}+{9iqQh
zx=g%{BH>k0!$MCdD}Y$ht}gOgaH2=$J&VM31(_CG8)Sqo%e<16zI@$@nzFh{nTDr=
z@IOTkr0U9$+p+ve6N=106KGvr#2C*!VEUxkGi%~%_bqv|WjQ97(|61JxX><#ozMx8
zNPH!+>1+&@(c{#*<d;s1P6VCh(#$re`sY<;DqhMm5ldQl5LMOh^%}NOb_!wOl)AT$
z=dWcjj>)_j?`QxxOPuYtu@=nxhWUd*FcWVPeNAv3*s!+^0^GyLT1<AUSD6>>J4rjB
zVD*dK7OmOmC900c6hfZt9clZpZ6pmuc#<rq?+i*uNF(I|b2KVSCs}qQddrShS{==y
z^TiJ-CMcxntvOZfFpWf3<JiA7R!&B#nrJqQg@_4-$42woD4H1Az+s@CP$pV}Av=7b
zU8QoImDC6X3>yqa&6~jd!kZ_e-ABwOGcD<aaY3cI9xET$C#>MY^e!sgsh%y&pLr6(
zi|SU5vJ@l9A^X#&w`*c(8<-7IhnCfkH%L^)iFyhtr_r>*(WQXhL*2WuAQWaQirtz9
zGFHvHDbq=9vu%X2u{&4RlcscQ%4m=INtoBD7BC(TW{;<hS2TRdwTZg8Dm~cA9XMRl
zjr4_2^qIv!gvr<_;S(^tPa5^bs<ouPt2?x-yiz2_QS!Nsa*3SHBR9{6v8F3!0IBL*
zN47Pe$2)cz$0ioHO{3(sj2?>=rBy=+?*(H7vSnpC&SomM2@ZZNt!3fBet+PsFCm$|
zzLFU_zrK{V*;!wFqSuFi@cJq!=L;|99syCGWidk#v&!{(ffVzhpVh7AYq_<xit%zH
zio7fu+2cHZ6fVQK)W)pHy4kU!yCdkS0B%`^_w<k06hqGo`B${uTZ(<9hKxaR(f*<$
zrAtu6zB*|F^VY<A@Snn%_&A!8Td{N6F$YN(vmgjujOV0i)C@Cil)>eE`q418W!zv1
zn?y;}6*3dI#0ObXL}G;*uaH#yN3%Z6x#4VJ$iR8L-`x6IEJh8Phv$91GfPAd#1HFU
z<>BDrcqpnshDQct@?2<LI0My&>7bZ-Z6OP@+`^c(C|TM%RgqO(TVE^g@z9^G)}MHG
zBU`g$g8uDzXs!Xhcz9d4W?dOuC29(V*L9G<<wh^qS2%%Qkbd$B{NJ@tHM&;Hc|w-l
zZG{_5jS+U((>$gvTJ+ya7X5ghT>iHV=+#=y@|i<7t7wkK9AuA7&QdJyXYWJysF*!o
zsW`L^GeeM?N7Z31V_|#{o)3tj9;!51iC29adc6o(%rN;vL}I?X!EEMeRm;xMw&G<N
zBE_b_1pY0BfjAG+ls$mit(gttNs)1b_xB+cbu5?jTf$|o)P!FHEOt2xH&PMeO#weE
zFuDrf$T#rIUDilhJ-%tC4%La0VO#Zv`c-$T=Rd0c3#j&0-VUkI&})dM`G>6^`v={l
zH~qct+3SNg@K&vp-s7hqG94xh%G$>LxP^y&b?^8I-38sDQ1+>i_MzntFeHC~%ERX7
zR~MD~FvHCznVN}JGvS(FKBU9pVZxxK@eT8thI1D$)RODWRJfW;48BgIm;UeQm#Pml
z{Tk-O*?zCXi=+9Z_|j$Fo6aW-d`b%!!$EUx6U{9xaFobhOjXT=R?&NG&z+%VEs$Jd
z0JP>H9*;6y7n3HUg2nWS!?FWoNlNwk#GjH1Pq`)I6|k|sM^;Cgu>x-ag@}v|ON>ck
zbfhGB%@q>MC18j#;W5m1{<ionj^F@>n<ta@B!<hZjCe@l(MaNgoe2P4kF9Qog|NpZ
zMHeOOl^vL{8kH@s_Twoe0GZt{em%o7zn)?JU=Ool^xvKxwvHB{NTt3Qg<RL2!WPW!
zXbBS0KYpV9s`!k<SWV&{>^-rx*lcV}CIzqkM6A?P6SaG21#S42d5>4$>V95*iwONH
zk0iKo_#Xw`pjtUR;eW=3EWchI!!*k}7@q%>vNU*P@$=<VvYvrSu5Zyd3OOJt@hFlJ
zC6`pz%1Ym-^=FZF4L1ULm3OOlWdRV(*-Vd3Qy8%7PD!;wBVm)uNyNS&<PnX!z^vk%
z_`x0G03SU9D0ts;MioH5_Fn(>*}?a3_fGl;?IU^pDx(_7Q<e#?=H)PcKOTQ5b5t_c
zhSm_i{A5E|Vg$T;xUw4`Shoek5Z!&=dG7J1z0De%^|A7;#TKB#<4tU3?Vs_Q`*@2V
zPuGe~3}l-<ep+zxuQ0a^Uv07mP$8YwB7*;G5Gx|2q0jX;7uJiWfmJP6vS@<=c<O80
zYXy@k6T=<R+lVSlNZxmkr9@oOLn;tH3q*n9859ees%&1${I^S%i-%bXguFQU$3)0`
z4x>zNyoYFZ$9nx%v|a@Q;-~NVRZ-7J^YJ);-MS1fsn6pt8=HJ2KVO=U>~n>u_8IPS
zz)>`|p@A51zRKv3y*&r?u!squNdZZ^bFkD*<*%uh-~KAX+p{bO0{k?F>7r{f3TimO
z_@XnpNS{WursQ`UCY)IMq}@AysxQtc;1WF9f`fQS*HUmSw~jjv<tudQt6MP2J8fOi
z2g>1S5XG^0WpY#Mq_2CIay^H3mejFz-!Ey%Df-{JxSb0lj2PmPVYVz=p4Y)5M9uyn
zCar%OOftH6OO30p21gmmLi}2`y)U=6o<7S>4cY6=&ddchaD3mBOmaESnYYwwQ3p;W
zqpxA#(5|SU@6g(?D6n9lxk=ScMn7xg6h3stH+zh`>UP;r?i!tzJ+qQ6tHWlCtSaw-
zS`l{43XCilOhtU)dH7YdAxgaHdK$#ZWk_LN6S1{NvqJRwsufPM*k6B{*=P&Kf;myE
z^<=r(z^STc<73V!QWUC*QE2Yl$t1w*47L$)M~^JLKL*;v^OW!awW8aNvPs+OO($Rh
z{@`&a`_H`jr<c|3cslD@&45Td6qa8D$QGA6Y{Zf=4z+C^^9G{|!HKY^K|Ilpqj#ga
z(k7Oe>e>V{F_$NKQpYFsT?En9>=^UjTK162i^+G=lw}11EwjFORw%L-$T#&D&x}Y@
zJQt%8P-#Q?z#`igIM2@g6zw?ifI@wa3do=n;!^wqCv`V@<lLldDnxcg7pW+bbrg=#
zz(jdlN=85o)5-B7V5aaAmC@KQox{Tbz5dPv6?U7n+tQpKrscn|Z)f4Eq&I2Bn*{ze
zv0{;)v#1@z*_CpVHy8uu0HYB6>oiOy(n};*yg8c;y$Y6|`0>XfP%yS)#tj|C==;;1
zvIi+!F=Jj&?M=zkO4PtLWJsUDrVx~0ZlvmKKWOBzP$6&$eb7C$&$iHY8Qnz8jnE!2
zq~Hnc0K3k{F9qQueh{cFWrUyc=ebGmuNO@g1&>)6{sx(hjM_M>DXZ)}{B@3G?dIlY
zyFx;^VkC9*>odOhek|=Zo|ytjz0sA<3n`5X{Q1^<3V$9y&T8Lr;_GC^ftrAgwd{NR
z%-)BjDDc)??RB9>+^T@>Do;0E=Ry8kk={WjwLry}`~el<R2XnT;9VU_$>#_L^F%vh
z3;nnZIIyrzGi;lxraCToIK7HKvdJAeCF!7DoG)cQ!yHwF%JXv*&<nNH$qcYkhwogw
z492rHs}x6U!KXaz2OL}gkD73*BDT;yJld&-(_mbnj)vN0TVx%Zw$ENpa0cI|!F9FD
zIYd=fwf7qz?66FduNIa9(Xr4>w`R!v`B-H=Q+=fozy&wdWSHe;9M=+aDOGuxc;6b}
zyz<_E3*&-6S7;CN!FwOg(hulw@}cSVEJy=wf~{owQ3p9cp-0!4Y~8COINsw>Kh!d#
zfpO@Uj~{=?^6a`$<!$@mxKcPFe2Y(yapxy2s9~GUifWC3^mxbHe91-|1JXU~5Gsg`
zmLaYxy;WR#6h*03y3nklPRmFCW|*2}esK{b=<Q%f0{JsGf{(d**+krwB47FVVotF;
z#7RFF2uqjl-A+^gCgah0Pc&bMsg7fyg{WtR6S$^WV$(V0HAYEOCX~>cp+_|AcVM~!
z%@K>5)&;PPQ4MjEhggc!vXbnMw3ft!wZh0_2?vZ@gDI92C|K~pIPl{n9|ew>0`5z#
zOiRFIg5>Ju7-C>!^#dvu#NmnN@j#m;=~NNEC#eAq(hTS9(P>XW-8qQtNg-E~x)UVA
z*EU*1jK3QD>7`;!$Ou&Tq}t*wfPO+8T%SF+;<-d@4wH|RXb0*dBa<6uCSNbfSr~dJ
z4*Vo?qLuS#bqIeImoGv8{~<80#Bo(8{_VLNe1gMW3?1VufbGI;2IdT>jlnS7fssno
z2~2M<vWg{x!SY!Lut{FnN^Ylvs{6J$Gy#`KTu&rYzlyR<=6QfTl)VA(U!gYaA_`zQ
z$^>+0NWo5#k=xy>9g%%eaNmM~Vu;1{C3>G5*R2|agc~}DulriZNkaQX4Sbg?L42pB
zVB^MEhqA6Y4rnUaG$(r|E~Ll{gyXb$Rf*PQ_f*q&cAQGse#ZexD9sjQib=eJjujt+
zA_Te1Aq5vZA2==VT!$GA&Tm!n<f6c8Dw&G{f?5pd_6a~r?`Z-~!shVKy&()`<*3;d
zw0VkF@KdD{w0xZOiW7+_j;BtGDcS=)e|-P9D4g<`Skqt?Wb8BVjKQiY#LtAhXP%lI
zi54nZ{FRR2UbJ0w+VrLDV2M(1>O+MhTz`Ti#maHRs<Z)$kg&mV(<(7N0x36t$Y>J`
zj1lC^q2z{OM<OgUv*vZ@>4U3w5}>1BU@e@zTDb(irkI$+@6Bh`+)9giGZiM0Pmuzb
z66gl?f?DrOaHa@llq!VmbklgQujY;3LuQYzAu3Y|&%#QGqSCY}cV?9gPO>hP=KRRA
zTq^mbp4V@`c|{2c%>5HL(INw6J2CfN$=mVyn|xyKnw__Si%5D*Y6q!T_vlEn`Qg|0
z?rD3^IUI`)v7Go@;RuXuI8BN`i+_>9Z^M~aVA?0cLYF#WTyba%4%xw-N19@!Xz1j?
zJfEsOmw4~PL1rdson2)bN4cYGCSRqZxSX{KY4>#$4>?B-MI2QKHDFEDNIa#_K@u5~
z^D*-<3=qRd{W1^mii>0f%p{LKk`$#)x02}mHCEzIwBr;%Q`HulU`fhMPV9-90B*?2
zWTeBM+UyX==+V>f)ATI|6e(~XPKR**#C;a3(2Bt>C26+LptL!0&U%>N=%Dqcf7Cs0
z^?G+@L^?a_{MhedcIMMua!8WT2jT4fQTw#tIVR(&gZ2^IbNmYi^Sh-K0!%p$g7{Q1
zYLbgSlnWE|$_Qs@9^y%^VO^C#lE#C{42#q&n_FKsH{gGp70TOVzuMl0hq(}cDm;$2
zliv)Dz4lS3y(hO+3-M3+^P9){08*8SI4;0ReNL(J04H&skWq*+s};qmR1}V07qo&&
zeNkD$9xw)}$-$oxQ&=#LeTR6+vO0BN(4g7c9KfCY?HS`S%C?G9lgII9QERYiF$l3r
zXeW(xGpKGQUmeUBJ5Pm5GkCF55zKsa1C21++*C(oF`?&^XgsHpZx>bGta*P!)i$(G
z#*~>wvl8Yli2GGp1A@BWdE@okr>2DlwJ?p=76GWJwewp|OWEO?r>|QfA?Y$o(hTh@
zXiCu0Tzwz5zHfWIvy-+#S&Gm+KOct!SyT?zT+|#5f!(PBB0sn!lpCz+0io~&3@2?$
z73vW?{!uRMi_nT=7tVqh087kGL7}ah*BTR2NMH)=6MbWUw%1LW^w}Hkwx~HwfumNG
zK>)BGg%|UfH;deROz8;FCGXy}7<8T!1+2l6*VO?-iXRLBqpxL{_!hPEwC2gypc=u@
zUSEKabrVAxFk%ib>Z*sLCPN9VMyl6FqX0K~+=b(LR>N!5`3&#JY#PLIxJ!skVM|Bd
z)AqLa6U>Y#hmw8(bF3}vpNoq#>Z_GIGR?H0MGG=Igq-0?Y<i`)4RF~QIIKykb60V%
zm?nuoz?u1Sk<9RjY-|=?B5-hqOWCf&sLn)1hcuxe4L$`>Xf_@94E+4={IWyr#lg>f
zgyVR!w+)N9CHxfo!wT<Y_cEPNEP$zQI4S&o7zaHn+s052)syyKr^h)e`|TfC`eY&W
zZR_YwdyzkfUA1@ix}dh<OBb~>U?%#nz{`bzJ!rh$+TCp*pZ5C4z@6;24i3D{jg5^5
zqQYPeD&fX1knm_)#%;5a6>%_Pk-Q$xax6GQhnbfMsp}|u58cUC*x3=VNPE?Awh}+i
z;|G4blpp`0eexQld>1a2mO6rSEI4i;6Z|<qj-1DV-)b4=yqGaBEQ7i-#eB)^4F@I<
zYBo=g4|h=tS5it5dK!lQKnIRCN@ROCBd3f<ib^1lM<H5QXR}YXhLbQMB_gU-<7mtV
zUK~eAC$F^<@T&X(NVl;=25nXAnmBlg6_&|Tk<w15m@7<(C{s1w12i~h{xrCV($MFe
z(cD~!0gQNamnE@t^J&+-#~dejj-gn04M^C@!Kh_k?WoN?@o!Y+BGwyuTC*IM<S^hq
z`oe^|F$9PameBXmfxS!;N%^rS4HQO5b$H2`6)+i!>=-*Q*QeW%u1qcheoCRJ&QZM;
zjL-l;cE*IW2-IaEMIp(tbSRW@(~QE7zJo{7=|RuNOX9@QCoj1~>_je|@{nR0=OjWF
zE1QKr)VaGAt6=Y5LRMyQ;%Jt4=rd>4@(0!Z52@n#uce36id$YR6|LFR9u#_O=jGKt
zLh7c4^an+zLwD;kM2`^%7a`&*C8-)pJR^0#h+zwO9RE4=lVem;3^|=+oNg29j4vUF
zl$BWA)*_bBTVG;`59osFV-U>v1k@T-CDZ@5!!N8PpOgy*RrN$Gvn1GT7@MA|2(3z)
zaUCg^54ABWa*Vgx^mZ}UOp%tXW=FDlscLLBO+sYf8_hY$4~58zikry}__dIB;zxbX
zN=k9phk6IIQ3%~hz*ZS53SsBCHglC_&UZ~HOPN7)!N?0(3cKYD7qR1T5fnVxrPj;o
z^sN1Gr(Umo7u>NM?!5yHpQ}KS(|wlG7;RNg(>fi@)Z+UA@v{dQxokZc3+p#jcAGQk
z0plm}^NF8)v^_Bfc(%jvu{@qfJB3WB%_!!yTrRs9C<8$GO&vN<)PNjo4k&liXgD}D
z!drh3rg5%<hC;L98J-g~$*kV2?meP8)iM}2qVV@E9C`*>RS{?sPCnpf+wZz(2Yas%
zy1SVSWh<g#%LsABYGu!v&(bk~5GFuJgPUN0^D4W%ReZK#tsf@a4~G?jSr$rVVg;XR
zs*N69Dp0rejrt%|fn0O=dC>cepP%vbPsdNdyDA}z3_TqueN^xCmH4m_YtN?P&8I=z
zW$^XihmkmsGL-y`czMLL7<S;W>=DcXl6;Z+he&1q4oPBoX3)?u2;Dfm2&ewI6<=Hx
zhEPSrrf|qMM{@N`&SW`Z;|t(>BWbOV25A|a3T=e^GaDiQ?0xHHstn-i<Hu&rouCBS
z=HLIU{H1?olb&q%FBLcLJoa|1(5Tt|`34`LWGliftzjXMXihK99NqaXF)epCQpXq*
zpmLQ=6P<BmB@9y4Pv#RnY?KXAwDDA&TgoJr*m8H1E%!_YBeX!f^uwt*`-pZLZ}%w*
z7=`viZ7Hk8DO>FIR3%xWNav!?p}^?WGZvDb*-pT2VNRyi*TL8_OCE-a46#Sms`%8l
zzv!f7sPa-jP|;t_lat^&oDLNs;_mB@#-V_fiCI+#E<Xxx(ki}ot}iXlSr&S|h5-!8
zm^kY%NZJp!p@=za;q;bcdP@ecYoBjUhV#h`|DNo<_Aqi$a!EcWn6|<rMO=aXtjRC+
z^L%&#a@jnlz(#gkc&BqN0lN|Ppu(68X#v=maWoBo<(me01=5%{(STu6Iyr*%I~e21
z@LZ#HaD!x}KM9ru|6=%it1f`Hzaao($an#MM(;+i;jGZZ&1Ln$5^O_4`dmDHD9@FM
ze(zeH)Bfu>J$%wW+AGWQBUUP#`AY%o?S?U~k)X2$Mm2P+A{h(E<ji}mQ<mxTX+9o4
z;B0JhK#{Bld}obDXM^!v->e?b&!6<>=cI?2f`n~wNChAvYio_nY`$Ub?_JdX9nvNS
zv0iV)`E(pkKW5Bw3*-O4bS+A_XLKH7rz3@~(#Cw6;Pq!(WOgA%`^wC8$Ab<_-eqzH
z>;^H#7>{N_ED2yp{cs+zGLi1i#LCICZNj^_0hzHI!l+~Gcbwv=msDCK22Ma`+t6sp
zTGGl0^_P;t%(g<ow(WeX2m#p6I0FX^a(R}Ch$g6HF2W^It{S*9M92p&<5!eaqmMp~
zSzc=nG~mUvJ}d_wDwk<Aoxga-soSzFkblF&$Y|F4u+f8?y7sW-AXBwR;ZV6PK~py8
zp+0s%RJX}`(ZJox1tpwAk+-D{LyJN)e)?()Xwr;i6HcFxW4xxd_J>!Ehv(iboCUU4
zl0r~(*m|_uMvEf6nN75ja^O#mc?YHk2#tlPwL}@4AI`s*Az*{$iC0-hv*CFkXF%%a
zq>RFmUs&dzlvuSL@f6FpCYPT{p#zzkWZ@9V4~(L5WD(xMy5adTR3UA>u)TPB!<abK
z+vR0p<??<rm|}m<VS|3mzjAMxi(J(#Rda4s^2F)bXpzgdw=%or_^KuLYIzJg1}p$U
zs83cTHemH}+oP<q-v_tZy(~TUsmJ;tC(WopHd7Vq*(y=KpEJ#lGmw$t?|A>WXacJO
z3+e0XusUhC_U;EN?C;Y<idtP7P&oQ5oZcbBZXH~7y)mDjW5{J>35>Sh_vj(HPpGp~
zhliKY`C*!exM?hV02Raf?1;qp_L6|s&G+@O@JFGXZ}LtM>p|!4-O$U4!;?u;7jY52
z0}7`nt=;d*RzZxfPNjNvV3{}DTKlCrFZ)7X+bY%R7S(c^pz9-8&zQ0*Orz^Mo0(zO
z61D1htEuwYP@X6yMPRBbvA@4-XPtCUb4Jpun<(!`v0}^&qSfVQ3Qdx=w1@{aUqAwG
zviVKoT}IIWNkF#0$J~l!51dbKtAn2<>~)~PQYJfuo3$)tj-oUi-OAu4P_8(wSxOmH
zL@M89@#)dv;HumX8Y=Jdds>w&LvK+M<Bo;A0ilNW$*}NDQx1hxnt=Q=59UGBO~_*z
zwTa(rY-RDHoEfSeyjS#Z83oFu7-JRS1T7c#TeU=@6>$=I>ZWWXWXIfr?Zpmrcb_7d
zQUQ5}Pj`ao7ENvedoek>A}VD>Ym>5t$2l#Z*-ZhN)eG2)=)(ZPt$p3tLp{EAy)QGW
z2hMyVZK$RU7KmBVFk-<rOn9X~+6k4cB^BG-P#Xo2ucS$<%j2q}@JqHS9Cbh8YxpAB
zQvmYlk(XcJd>ZKzr$yTc1$Lga2@8@o?fB26B(?FVYLU(EZufw%qkog9>fp?q*V{){
zHHVD9mHN14_1lHpXeFCSG>3>TJQRyFRGA>bS{e)L*|g<_iO5%nxDx6fCIa<(*-X(I
z00(vCPq6>oZrLY03#M1Ga(mL=^2&L%@rquXz|qzl#m!|(Saot*jJ-hR+%d_POc+^W
zUoa)J#j)MRaA>AWxF5w<C~vZGpgr2q|7sS^njeE(+wJu1=w0h{_pMeW<7?IDe0uGt
zgUi-<4Ad=g(ui5DQW;>ovJFp@`8h|uVFIjrn89O9qoq3I$5t)qc2~+&2Xz%yv#8iH
zrumJhcCpONxmI8GSv(ObG?Uh>xe&Hc(kQcTdSx=L*p7eM8-?6s_g2P%9_=+l61RnF
zQpP<}{TrXWx=Df+c%3I*MKn1Qew@@rDM)3szEQ{VvGtZZu)b=8lE5hyrmK@u2|JAj
zvuQBLRxeufV&e0J2?nWA<}+^>RV<s@!09@m-JLi5qo^!Y^^R?kBQM$?E|x@DE2;47
zM%%|D)Jo6Ga7-DD(KCeE96Ywrt~Q)<Tmozl8>_R+1I+CsE@7x_!nna+lxfSPaiuh)
zoM=)foTUJ4cqssf>PJo@<P6Vg%1`{69tkSDkh7!2G<c0rbcb+$f%(mx0luE6x?|T(
z9aaF{@RVbgw}y4sc*^jOpQ6E--JF$YM$mE?Vra_ot$3~zL%<=ga3xTyH^B>hUu+Pm
zOS?s7p~t%v(|il85J`u@*uT}@EWuC>Qr)Ex5OOM3b;AKgf$#AroOdAO3n(=I4{Gpe
z#rhO43{T3por66-C~@-TN<X(6l<iwpK?3<cTetW|sFsP-?6M(<uh8@^_EoKA83bz+
zmcpP16Q_{bMb-dPad<u&A~TG}xdWwXQ!g^CidAg}JpTj`tY#n0&WoY}v$ht~$rccg
z!|qY%v<v*;ciLJUc1Mafqubibmu|f*o;@!NjQ;@JKX!E&ZgdFPFaa5PtMKXi{#N@&
zMI7e=BiY(}1P(T`1^3jY9o~6R5D8+hxvgLg^RFoO$hj#tEup90IJ(GfnWgwXikO}=
z=I1eGQPD<t7)pN{^|@f5>BNq0Sb-C;bq+9#<nm1v4f(QJ+yNZ8qGG_FsL0V;$3RMl
z;;b<x$lg6V=p41(87!-WK=!?}+gef!fuBN6gxgHNyT6Y^TBbS2h~(}wduypPn-T+4
z8+RPrN)WS<j_(C{1bepNQ5B}by^JM~7L3(RrZ-uA$pwW-#)J)8-vCI2`)Qhz1EF}<
z4xPl#RuC;?;jblf!1F$resAur25_GCF-5z)qGBJshH;Z#P?kD<Y3am?wG?J$csunc
z5^qZ<@YISBoxyb!2IFC(6}=Rf7Wqu56-#@z0!7yY89Eq`vdaWr0)fq1v(VFwVUBB$
zlQ&(#7l!*i#5@~fv|S`%1#y^*aMgH)Jg?Qa{RS}<W6Q+uxODgu%L-nmZs|;YjN(b0
z0}(<=56g?b8zaVPyN!jG9Eut%dadL2nO@I@n?i__1rCJ+r|6x`XyXFYt)+dluN;yi
z_ChuqG_#Zs3~vRD`ISEohuURBxKiQr#20)VU90cFFJ1tbV{8O+3f*F>F*Q%gyM=Mh
zg*|4EX%%OyM3+TJfkITi$7jfAyEouhDY@xlp8Qv_nu#a_`(8Cj9`G^@r2yn`f9&B*
zd4oV?qEM&)5Tv@6h^f5axUNZn$V;Z-N%2-kLgDCnOhGHC2h)l)j<q%60az`qcf^n>
z`S%BBEjO36?U0gd<7HMQ7Djy;7vA)8$_-a!ni^jJoF_u`T&X9NMbw&HK%pUq0HB(I
zNX<S$vuVheQJcCK2(<6na&N{R^d~^KZ~7^#tow*NeNsj93!py7r*H8pt$%oS+WxWM
z0Uoc@I_UhPeIj}VryZPP^-*zKmhxbgS-2g5fV{X1CRkccWkhaecw<(!uFR7%zM))&
zLIFcFLv0pjHdfM^(%!;u{*K){_IRr7(9rJt*@)#}k}($Z3a!O7k6d6iHYmtGoQ-U<
z@Y+g==yqb*f*Zo@_HoZIM~AwS+FrFYRL+5pnHjyw#Bnlb$F0}dtD~6CDOepHPG`@k
z&V}fvlKM=!^VwIrMn7*GH=((*^7*9=-`GTi+sAt>rhqKB=i37WQ!6x%qL1?#!|C;H
zXRm5mBWVP)?UM9SZ?AFe-|QD4(lTaA(wcx2JtV0)nDRcxCqnU#0J!Z96sS46o=Og%
z2|cD=<(g_qFy@^Le~HkWq^RQI)0gEdDne;F$hVEH%ILz4H<)!}kD?g1BXLeqZzX!X
zK1Bql=-Ai^>it4V@qsGK$&6#hsJm;j>}8i-5@K|O^9<X<?%NzGoQ?y|s3!?O2mx{f
zAU=c5+%}r1y&|TkY@Ae#&vezVSnsJI<8Wjk=cP#$jr%mp-jcI(M6Mf)A32*1`N9g`
zShP^AY@lO_jG@9brV(({9S{PlHg`|e*`g)siyjTtfSZcOBofnmsvMPpLe{ZY>$k9{
zTrfKSS!c)O>2PduPVXH#ju@qp)tnn5A#oB@?NvTEyfwCb01vMDc%Wn2)pc79^RPhg
zqFeoz5}p-URGI1+(NL9l%UF<d$~c8g5Hq=+p$lqgx=u(XGY8y4J%@x#V!bN|kGDVT
zo(VKRWSr2!9&=Gg$fX)Et!7Py&DkVYUx7heCJtl4>s;_a^|1`jiXy8=`LhmwQN&Vn
z-;h};MmMM!anAJ&WO0J3$W9(}WWaWu!3H(OsnoMY?UPSctKU6F>O~*JE<lz?WE>XW
zwLP{#TvzjNc>h_rd>xRw`IfMl<pa*%1B40VdwUm=lQ|wa>H^$!(URx--?)YgP}@wM
z?_QXBP`R#D0!iUj#uNqiIuMVEyt-;#<gPi}0ZGJ4nj72Y1~)$4As|7>?P>+RqS%uK
zT1WNCCswnfZ<=g>>QiJr`efa;hmoKX5yepB3mytQjXrbe-bc2P?A=ESJxBA39oH$f
zHA=x3V<mH;T36zovAz056u|*J41DehUfJ!iJg3A8anz}EsFrZV*;8)4u^(RqDl#6b
z#{!NT<=o}WXBdnM&B^4>(ofkOo)`#@K^BRV8*^7xiuw*G^mP=YBZSr1Aej1b$dL~|
zV&E%aMb^G=|J3u=*EsO8Xc_YX<7)PemEEYMP{VnN)+M?UrflNhh^~*K<KlY>6G77e
zPQz}9!;S=FOr=6OROW+Ao{^u3^^MZb(2X0HEF0D#bQ4ih7Im{m_@LVLt;Sp~KXh)s
z<Vuuck9l%c0puOm7jwhaiMWIpmyKjb!hGzHM&TfLr)eo&pSW>@iNm~zqiYY(PR_`V
zdnTh4x9H%jQdG`fNE!PawGMQ__S<jnUi@`J%FaHXWuhmo){M!zu3gKvUle(hZ-*Uv
z|NA0ta2lk2hDcv_pP6dSs8!4{l?^eI4^g4)6qkrSi=VsWUExRKRNycql8uSbQmGdN
zpO8^xDA;nr(^!znn+p|U!$wB2M24R_KG7@=IDyH9ToWWFgcK8d6>Ac=nuGe};zI<$
zcQk{vp@{s@mck1W48Z8McE8tYDeQ*$s({SV^i3Ff<Y7R;Q2AJrv4txaI+x_{BspS?
zu^3_35oLJd%_xS8q+k+#EOdaBZ5X8Dm6Y90MTjf+Bb2NHZw#!7mtBOJ1^Hq*v7+oW
zch4|KJgZq!B%Mq8K!Oz@VbWQ%A@CV6?R^k+_#RAawk=6;TZiS$^kp|?4jJjaSXeb8
zs2GBhl<S;2kvbSKZeDIJ3ItBvIK3dXeOC-invJuoy>;zCPNWw=w2xKHdGuI24=_|(
z$(`ff!R`O`iFa~rG###zgpIKUFij4ZMO%$<UU*ogFEP0RryTa*NcMjysyCL*XbS2k
zR(+YG<7ZYqkUeTJl>k>bT%Hs16?MguUPd$4qXZ_ds&bAGbiOEOx?cA1OfPY#`%}u_
zr1a@zc#nqNWa+F!dcqq)GLAV0T@nA}fSc5C7vyHCWAC{++(e7Q<wey?$s~E_(-N-i
zd(DZKMHeD6X<<A**CnWSr&`$cAiA$3afwRUqHD|eBB_xs@9bpn@^U{7KFx+?cShl|
z>bc_wud32Gytq(APh#;=C^pu|nhkd+aagSDMq^YC(I`RwjY&MQy|6VdB4Hv-QWh9H
zP}}7x6Isj`_kPMT-MM>9#cJP5n|uRyZ`lpMVTTMW?hKbjt6^<#7f}mxcwI7};YgTQ
zfuduM$iy4l8D-tR=`Gy4rAxNdajZ6;AN0@tI1Yn2FJuctMfz2o-HsfJvj`aaTN)vU
zZlI<0E<%*?_W7oOQ%l>Qb!H@(Pl-7N9^29hU#V^uFutfEnLvzO_cE)!NMu5;I0=V%
zPfP+lvP6pflG(J1FCAa8Nq<g@mjymrD-jK4iryOs!3;PGll_{UPJ(PZoV}Cbg+pm|
z_eo+4laEcket?+*^I)2gtu{7Ws4f&b;YXvswhDqa``x3gM1miyG><?^@ArN>+U>Uv
z-nD+}x!Q=la>v1l%`zo~8eajwf(OEDZo#lFxg)x6byOUjPkrv<HnN%#hr`eZi#okg
zCJ<XPl?2Hq4zO0rzEx|>R1|u}ZdgqeWhH^N-sKv{&=N*q3a&W*iUeZ$PQEl=VOQR^
zZOva|*-iSPU)Uhi3hOdKLl;b>>#)_NGFHzTn@%byeT(C@dgxI|o-ImEV<|HDst<#A
z!_GcDJ2>ssjnaZ*>0XP{iFg+bWkd!}n&Z|TDCiZK02Rt2*cYXVP;diT)=$tdK%i<6
zxajQVUY$7)BSTn}(aLUX_pLoT9Z{wuX{dcTItHn>&&VMIwu3Q;MNCov5Dgm8Nmg_v
z;UpaU+AIvviwAf=I54&?1qbCa+LxKyhF{vOP0A9J--mG>GdiH2ZhEWftG>{%W|4yj
z(ZusW?osffkEA2A1@bSnqKQkZh7|f3_7AUODm*Nbu7C1ySQQPfqN$qU8>LAepr%y+
zsQu$<MmEjbw`AMAyKib$3CAUp0=eWUJ1!OWC=MDVE@Wf{f?>+}a@JMWXi5i|b!w9>
zI}CiX?IK}SEeBr%15T>zUt+XqU>um6(?sf=(BX7j?sI{YYrj6j%n}FP)*c_9jLc1b
zP0r%JcQ6NeV-SZkVojl^#_O}*PwYsi?uL7jdrM2B6E4=C$@#7F<kK-~)o?azxHZ|R
zU$R|?N`O%@sc_eYY1W=iX<V@t&lBbsFOb8FsXwM9(vHuIohnQuO{}_A(~4E>WJ2l1
zjFVwjlWHLE8|N3m|6w5GnEB~t-5M_Ht&JJwkoOQ7powh`t`m7fsxn3Z7EqR*Nd@?=
z*?4EmWSyMlbUy)ZEvt;kSeY-<TVx~1shvSsFrN+`?p&sVSV9qa043bn)vQ=Ucg%YQ
zC-Xuv&V|teINbp&<aYm#T&PJ|TI6}KfN|${9hL)JAm<zr6pRlr^`cPLL&Yda%DNh(
zmpTnYbgSZ&E72et6FESQ88EOX?cQ;n%_*FGtr2jp6WNIZc*o_D0*aGxnUEDKpAzCp
zy{_-o6x+b8Mv?8XGK)!EyBKwltaFMbjF05DNv2HNDn`3#u_&fzO7zzsN|-s4(0t~F
z05%f}xoG9g*3%~zA=cx<PKd0lZrJu#_d+yho5(QTz;N)NVoPbVY?;q^WOV4R8*_Ii
zUL34l`RZ9AsFZ?6R=q>Zn#odVr~+jqm<HEa$f#m4c3|E6xsI1^!6?AE7nhitR|^A}
z(RCe7uz@3--#FGNgaPBgiZH=`D}-pM#RG&QOq0`GI!7gQ3dLgEGZt+~emU<06|b-T
zbGl~v`Z*!>jUvp$R0K9#rCZP2`;llhM8_+~8MmSP^j>-7Ro(B9+XdY@^*aA(XLr4m
zvl(-7A7|D)jWC_qh1z0r<ypz>{{;1rT#;L<l+>%|_d9;_8du|H!IXkfg&;IgM@JS;
zU+j2=@JA+eU6sNcC;;f%KjSsSfU0+mEY_eIqDBQEXQ_}IOOeT_u16>1QkVp&p&Bnn
z4gm*XqRzdYSyc;>RI92Ihx3G5362eZCRJ#t{s{L##ti_TTX%9?GmlqyqQiW8?vIhv
z8p0GKiqJGILW(>>6xLjX9gA?{NS2%~E>w(9D;OjZA98czJ8`^($2%@N?@Klg=!jD{
zj>Q><yj|%coo#W)k*ItStyL534V$r8H*3#6k=}A%|Mpo<K3&jvpKja=?ywXf4&`D{
zIgZlR5M4OTliab0P?=9f$D^j8uKk)i?1?bein+rS$iT%(K5>}-oOE66Cva^i#JooB
zXv$ZG!(1c`QFE!$)S0N>_><XKw{RYq08PiJ^nnJEiSmcp5E{yMf%YR^cXA|5ifyc}
zOHp;KfI)(quXdv)3X*$l#y^W4x{Fu!3t82r0%q{;qwNXUNc*mC?M~h*MIj#K%QnDS
zDFd_1NyyJrt*f9La1I6j1f~+la{|V9bj7CR0V$P9oPv=n{MckIWM@cmO<TOH8UFyj
zs&ZzKO>d77;k)Jc_9065iufUg1<Dtyn9*8pXJ$=sO75I3AzLW_;~h<jAG?&@KH@21
z9a2O;j(xhJ&apKXBGB^X4Nf`YbCJiF3`wZ9m~2$VB0G-Ge_pSxXK<p_Ni3HGhxB#Y
zVvJ}Q+C9e?^GRTbC!>&t0~1=gZik^ZF`8YGf&w#3r4KrlPM12Xc3=MuL;oYTx&fR`
z<$;sqCo`wVbaLTg=T>K~fB|VivEa(}Z7?PiE9HHLdj*r0I(#eI68PbmjvFxq8%Gyx
zvOgVaEsqKvm6YBhd%~|52CX4DtNe1zdF`DY9%EhvZ*%KwC!Th07ojkcnhaZjbtVtD
zBMizh0RNrip14H=O=I~|><v{&lvMMuq`sU@m}EsV<w60pn!g1xYmm9g>k+wT5^tX?
ze0hRKCums5=4q^9MGG*Jj-2}enk;PF_gl|jWRlh_=4-#rKsRR+1VS~40i!DA5$8RI
zP1GxYx5c~RoUXUC63*JgWDQM%7I12WqDA(|f3)Z3da~wKF^?8mK0f?)E;gL-s3z}W
zZ0_`*Y?X|*?k$94!)@lSW{cX&)^Hem8)rmeiz%%MLUjE{L^zKU>odSfXx_9Xo>1`O
z3uN0j){259d=VzpG!(1VxRJHynk%EsY+~e&5Mwy03ra-@rbAnwFmml?LsD{HaIU`M
zXbH0IzVpnf?rrBThnD%69bUvVs9|JsmAQ<&SACe&m|-xsZ%wv;b14ogRz~)buiS`j
zwa@Q4wOqA~YW`M8F10brv2|JH=wC+K6wX^4tkrdD-TBN}B{}DiE?>c+6iG!<*RU={
zjs{l=!x!Hw_qMIweW2{AxeJPyO)8a!s8noijnVu|pLI`Ln9^ZUqQFsl8`|nJWhA5O
z&H;n3DAf&nC#|5pS){soK#3`r*4~t=ZZwqa0OAWBsQ?ICuLJV4(&UM)Ut+EWkiUCi
zBok4~qau%#T9{@n5rsS&;S-fK&d0jW2;JF?u5N98t?6~u+Q_W|@v2G!DpWgJMtoWI
zR8}duSVQH+LB>`hv9U#?fB9!@XMoLKkM88mMNf0F9!UX6wsLgIYm+S7ULUWxIjI^c
zx9gfOWV?O451OQhgYd>=)P!<2>ia3cl|L-eU*TtI?O42)i4wR#^QDS>673g$meznx
z2nb?$ON>%h3&vnB(}We&ub0~b;HS(E(Ow_MJrnCQVRtWdF?UzPf@_&73cyws55C%B
z05`U3wFN`92ly`VK2D=++Hi8+q^Z>PWrUg)TxzyYwp4k9n5GXhm$`^MpZtL&aK{jB
zk65tHqG@vl+*cEPujfZ$+JRzN%M*QMM22<S8jl?aZd%w}2x6;1t^Q~{&Y=4j&^GYy
zK=NOCn;Tot*72W}HMQZCJ!>`95J=putJO6PhUQVT1R0qVCjTKGKB`7A0Pjig%RG!J
zvhH0|$#N^GX0&p}2lts1x8P36Th`FmmRW_O?3mqSZ;8iS8Si?40(;Fl@~Yin#^^;8
zec3Oos3TOTe^~vH8P*D#h&#5HGuc<#D@+`EGreXLfWSt#4<3xDH$_^KqieRsP*EP^
z`<+Cp^*c@@RqT_UNchQaky62-^tf8;wBi*kJF%8Hu+*n`C#lcxxhDlar5W$mRn9j2
z{Cm$gYs|S`OHL3JSHH|jtN3vicb{0=vL((fua5K#ZP!WNzV>jiR+d+{aAZqyExMmC
z>84%j^-W6SVq7T4gUs?SI8OCQA8!^Pr&fXNajMqD9I4+HxXr<5ks}cW;=|KS^lc<e
z^(X#KA9n<j!rYOTTh>J<^n!z|crl79t_uF_LH*+C*Uy$XtBWRf_j$eY4CT0XCYU>}
z@0g*BVD`~naB}0pZ5LO7*%3N@h;cdluRCx0t&=xJK+&G-j#B`MM85b3ixWGkU8X^L
z9mOB>+jN~m$U{|%`W~k0zKyN2#8{gmSYjkLYX(J4ouka_$Hw+i9CV^t8cu-lsUeXf
z--%sm+8{4%zUky?45HaBUdf^9f3u)QQ6sOF@t0Ceu;ajWz#=NyxA}3x7Pn*80QrT(
z!Artl&?X%~G#)?RYO3HD)SzMw67PcUCgRd|ux=e4NhTAVoDN1F>Z`$Pyvw2p7~#Z3
zkt+m|#7|^@$V+owrOqcdi6a1D+5trCQos8<^xeRC%8`XLDB~BPkr)GX+RfArXVcg$
zIk)XyQV^p6KX}m+N>~QGIv9uNF`^hN`SGbgQK1JU=)fiExk%4#`((R7)O$u?RtO+9
zMiV+7hHwZw<s^zG`;o)R)e%6A0&o`0y)3nr^yjkYrdTn5s<e=~K*@L9WT=I;_*Yor
z>=LuZkQYp&`Gt7ZS08U7H=4$NNG7wWd8uW=mtnCA?<}D0E|UhIZ_Yy}u#Cp$zn%3?
zH6}wt0V`eI1+}d1n7$AV0otpm&iO5RGtO?|#kxkP>zoe?XKhj{N{N|>MH!_E{Y)%8
zE(k=OS=C}9U+9pMUqS4kWZ|6Z`F)zXP<{M((Uq#*WgdMC?o!QA3eMYMg5LWF?o{f)
z<-YWu=zLeZCkOjQdk{*1d^evMOJQ^g^RHoXN50X)i_=jOV2E)JqY+ID$tRz1c+*wT
zTW+_DMO1IE*FWlFe8Rc|^}^Ybn@B;P3iT=63}tInOq6Kd_`+0HuUM!wgZ<;{=omKG
zP*|iz9Aw>TGB0frywS*8<I*2e<gLY$R+J8PyDINGH)>~r_ByW<L4^lhh=>U}U#!?J
zOqTZ&R&e=0xkL(LychsdgSGH%O8w-cis5anckwP-nb&H&{HCo&CtF-poX@Ail&I)D
zFt!BKtD*@Mr)-Yc6OWDSfh&;<2%qhjl%>sBl6Psp=z$6}JEDxRi8rUvY<$i0w23!j
zGyeijJM_JT*i{i9X=gEtREr6W=2`^{np%eS1LMd=w^W6(YC9uq`jRZJYSQh_kP8~t
z>MDi<hg~$DWKL#XZCxjS5WehD%Vi61olrHLNvl^c_ufIQ^~Ym2&12?RoJH)AI*DW2
z&FVDtlfr8bjso4Z8njSAd7kii!)YdkOifqYQZwTPELvTd*DSxB*1FZLG3W>#nnU(y
zXhA=;x52V`Z=B5Yj>Dh!JJ;7v=%Ce?5$`DLL-@VO8;K=llpo8TzcTtf6@m~MMwwU<
z$VL{5yY>NkU}}{9u&<sp3Xkf?hGJ&Tr#e}G7hi2F%W+xap0l_iPA~(@STVg0M7mKk
zl37R?1;RKYLPF8hT{H7ndi62z0fyg0C#E4r_~1xKRxrN*kG+3yOykHB#^L!ppQ59E
zV}p!jNlr4emgW4ggl#smq!m&;8LuC<fkx^WXhMT!d6MU|zvo()?rK1eGdr_Sn2815
zb+1#W&i&{riG3esWhOIDdoB#LWUi?n`7ue79AKk>L!XN?G3EtBJHaHMX5_G;4Pi2~
z>b@K1gc#7)KDB{-(c3bZiIUP~rN)Yx5|&54w}529R_E)2EWm*S&AygJ$`{FNXHd^!
z+c_lyI=ZlFV}~YP$m(9jrWA8uHFS_gb%n#NmFh?ppJ(%3V|*1mVnd_67UxR!kRhSz
zl<!A`@gY#-m}QDCND6_hQP9PISi>BMQFJQl0wk!nb8EKALo)Y>bnArdG<m;&U++jB
zY3Wj`7rbH!yg5F=z*-eJ1`xjOLpmv0G}s8TWW7PoISF~hO4Q%Nc`O@mh@nU>eU-KU
zvd~TR3t!?-jWq^<sf@v$Iyp<hY&5XR-GfQr_Z>Y;IUjuAV(9_|h@Cl1!*_`*QUsn&
zk7H$6PD{_)4{tU?PChjEJuJpN6Q6XLo3Sd=4CI`l*aY^yVJA#>z%=MEMbE5k!BHeQ
z%o^Rrb4iqmZiq|{$($)*QvMpXO3#>(FxT{J%2v+#!8j{GW{f_AGbI5NlcO{h*V~tx
z5fW%uQf9Dq$V}3rQ;8uQyM!Y44~QsoKvNroSqxN@EmTZ4HE|_qZit}0Xj*>0jS?tW
zP|{7&lizxu(!pVi_~B@gYi>e6n6vnyLLnU{tO1bm5>^pwG$Ip}r6-rUoBXW7);3z*
z23TiQOAF@!(06i#A6vWLGJd1w5xSimyE#^<$Pcacjs!z1T5!3xU)C7Q%c!Y=H{H<G
zVmpS{;--%yaLWigsI|4kj07B%7qNu+Ldu!US7M8$3A+zZU%hIctoHl#i~G0Wa_m(d
z$>Nh@VpW-fB@|nL#jI+$Rb&dt>d*B@BvU!hM$mGKHs{Ap;uzMEu*_t+We4dmSf;Gy
zWB1BXCIoj_U6l#EV{*u3tFsw}TBS@P*p`BwJF<o*-SwmR#hzVX!x_Kl3SBgj3-N5<
zqtl9WiJ8nAV#H@ub+Wvk%bFZVql7mC$&l={kS%aLP6la=fi6)1JPSCEm%`bY!K@J>
z$uKZQWvhwIq_P3Wax!-<Tg8x&U14PxWREOBZ+hIA;+Axx0-1FJNfi&}$`SJ(7;sc}
z!{0gdugY(|3sDCQb6`$M{QWuM<7<h;K-@Vqzl-r=6uYt5%8AN^kEl5^TVk>iWH<l<
z3h6lBB-?;`fpP1_2(WruL`;}CuvwKqaI}cYy={PMgr)veft9Uv(jenhl^hu_r;Kwa
zYD7UlP^`w|EJWvfWwS76L=TJ-M;gI_U+JoF+hQ+sj2PlXEu6zTZ^Kp%$^fijSQ(@D
zLL<L0TaY`3(YYIi!)8;$@M6p0ccrPe6QwK+)d_cI10YjiA0p+%K&KqGvu`2*RU|uH
zVuV)}!dn9hu`vI<^`9(wK%xHn;@(g*Y@|~qRQ>gf;?kNn%8i6(8+32yptnS=2aIE^
z#NtIZ#e+CT5?E4sqHvI6{bwX{Hxl`V!dg+o!cfe62T0Fp5-30;;Ka*w7Wd(f7GF;U
z-(pkwVv6}kwGETmG@@A5oZd<G;<&|Wk_Qzyf)uW(nJ%|6Ao)@`Ez=<Da>D_QP0c#F
z0e6B8z!OS?qGoY#cHRQlJ)hO<@Qpz1A%IxGM8tTpvGjVCdPmlp7vh{(w-oFPKSgm|
zpx26YRraiwYXvQ;%r|TOQ3bB%=q!QQlEr&9(1u;4Xe-a+N!qV%T#7B9i$pd&k%x<P
zOxG^e!*m#FoXF}jWczFFBm2Rm4pqBRr7yKcALV>!@x;lQ))3>1`x+akcyyHPa3vo|
z25_!5vD|>`H>DFqmr9Y3w2j5N<QW6n2YKwgLXT3VJ*}W_Ff~{O{w;;%sbV|yvzE=@
zYZGr+!U>5=D6m+;seCGbV|RBcbJ(zX3X%^JPy9M$<FLs=ut@r;HYaYRD5k`TY~n;g
zi7-&1rYP5)5yiRjFWirt3(hXE|IG@(FJM#zBUxUM!K$^S=P|mrbxFXYgv6GjFe*h7
z`V6s-k>8&1k;8wD>Qtk;^t_NRhnk+-i(wWIEM+b|GfhimjqbJ0@xYg;4R^L}!bun{
zAaO<#@f*=Xs=2^@Ee<Tzd<timmjkUz$PCZZ;8bUD;*0QZ37q&A4dri=<uk-k`}Eo6
zb9C=C5+w~1!5S0mbs<>XredGDJOHsZRLTv*CkZjw%8cz>8rB-_16!;KGtrBC=?Gn(
zjZ%;R(dc3d1}mEJ1PgYKI%<vNvEwA7B-K6V_b`eSA@ea-9j!1LM^Y62j1|Fy+FqSy
z*-qd#--VD{a<9#2PV_3m?6GKQ$sWc_r^cTBjzWd$FE%qM&q2w(qAq3mH7_ier={md
z`iruTn{(~ItFV)#(hlB`6Uh0caJ*HvGa<7rpX;zu_HoYlO_TQlG0##WIYlT*q_Bhx
zjFQ0>A4kuZ$O%2dydj}qVqW8dDq6&W64UXldD&@|=nFf)ryLu^K6s*Ms_q;v^V-u&
z5}t|<LQ)t{6{}CXQ@Br|1FBb#N^cGn^C?<h%ZSd5m+KK;6%5R{Nkihg<}TDxu_{^Q
zbM@7kKM3(3te5tqc+oAPH4C{xqK$J`!tUk)`MhaBN+MEAfSV=pNYRSnN~B*2G;Xg-
zmr!0dA}>Fz#{{g@w4&J;1_BzCowG$!qN2~5W2{h@GVW<JnSfcR|C;Q?*uXE%JyOVv
z_|GCdUk1jO$Rz$^jILVX9%EpN^yIsLCxfCHK~d$(2cjR(<=B-}vH{jG{3)La+HF5|
ze1$chTe81)B9rC2Su~TtL~QtAe;JX0d3{J$scC)OkyY5WT4xD9Q{*jS&{4s;ivp0O
z>jWQZh($4NkUVy-1?MF+g%@LuhwQHFw_mRewxl7FTqQV4{y7ZN2Os#E$3&zN)qW-m
z@(B=!K$KC}_`Ht33#p7f6iXouJS-Mo`&3(sUS-Hu_u(s7TqQumW`#sWnj2Mq(`wX#
z7*T53kx;u@42L(f$1J48;E)eQ^O$&Oa0z|j_qk14OU50W#B}8*!4&1dTXGBwwR@N@
zA~#@6U6l9=UcYiek5bMLzwuEv;s8p$w8uP-sTIuQ@f)%_uaV6;n6>XI4zeyI4VCb9
zg5mQF)2quID=8Ab+(Mg$9cN-YAKVU%^OE*dQ`i(5ccVEN%ur;(*kFSJuAhyF!vRPo
zbE9<nn1qhgIOS;0nCGE=_Wo<m@h4DEHlZK3Z?`{gzoYUErTHF58@qdd-rj-#?LOY!
zd-U~&+se1-@HC_J_DC1vMfK(_P}%5PLk+jj$VRHcIuht@<IUs8yKf6ET>_pKoug?7
zgC;-TaVkEXkEahQhS%er4YhS?P9lF9G@a8hooh5D;;3jH;XcHya?PWob2J{OkW-8W
zDY~q&<D}3UcydvCuU(x^qG6nl#4q3KY9-8UHYH6`9^J<!xo@L^Y<vgfH9j7UF0j4Z
zY~e7~Bfy;;H-yj#Y3FCgx(+5i9btq%qpajaDkuz2I6hZ0e?GX7n;}YZ>yXi53o@kP
z3DaS8p1RebUL_O3n=oX#RLq$dBL$Akfpc1dRD^lKQe7f%De?ON)0V@;yRI(7#y>7y
z#g`}TzjiyQ)x0PgL|OoGQ$m^UHJ%g=(~M%{D+HB>Lkw^eb&tsNI=VPK3w40hBzvDe
zAK+S<84!K%_ga{?BiAXZ`PDefxp<}tl6Dvq{MK;|!B8@A$LiHXSs8Q)SR*CpF!CgK
z?6SD|Laf5~h#gI!oHOjMeI(H^VXqN8Y2Yn3k{%{XM=D5YUbR%Sm7@nN95s#xDwd#}
z%AJ76Tw>T;J78H&#dscXiU;(qALvD98*nfW0&|1QYmhPiRc|~$>H<T4)@q%1Pnxe<
zzD!QL5RVG2<f3sg;4p>5RvdxtC9gw;<Vj4<bK#AqrJcJQjkU1KCvJ6zJ3YY`{xRF#
zkpWk1xXx$QmYaF6z3Ey*w_Shh#v_giY`pDAx876?Z@#|P?LW*WXv0Rj<+xIi#@T%`
zH_;c`j9o9roVfs52oln02q&@TOB~Ox=ze~mmYf)bFmDj$PHaSuN#-s;A>TK<-@a`~
zYK1qC-g1ghyd~a{bfJCn{FHX25p7OoS1@86)!ko(&pB9cQI-)d`|9+heQ|p3YYsQ3
z4<2BAx>F}U9pda@q0arHb!Jsp!trUvSNB)W<m~cU=kl4Ya<;mPWOdORA6C~e20dD*
zx4MqzezBG2>sRVNJ3sxtb<#a=9kreHIKN8^hp?Eo>a*2Vp{t7@yHL&68mz7rNK~n{
z`>ShTo|M*hv38%7f=;V7*XhimVzl1n>UyX@JUww|HghUX5&KaM`~F1U>+k>Cx$m4&
zKGfxIiy19c!1yxGy^I!a@$#4oHT^^t;i@;@0p-Y(cF2T2tq%z+ZzQ3!q@WPdRhkz`
zG$B7TAoHOHv}>-QQ)082aehUOUFPvsAx5KAXN?axAWiXm`{IF#3e?3)rWqVPvkysb
z?rRiy$N;?-05$)O8|m0KO8lav<V!HqHWcUstxtY-7#e{Banp4&L)R|3ugP;ul2}tj
z@<Ep5s8g4bQ6Y-?&V`H!0}ZYg6M93}#x(A;!3+u2CYa=I7GD{5LfqRN$)eg4a2_L8
zd5IIY=0DtoW;3$rf}3qj5q^c~-wrO4u8QmPS%zhb-DKc#)jpY6Pwq9&0<qzEUUQsP
zHqybtSC_=k9DIdpH~9kp$NL_?0u&v5)do_1M1SdM;`2f8;HwlJNAS;7{*vklzn~Nh
zTgJazD7T_+U{qT$Z2S((Lw`p6N1npWv;ZG#?5RH<;2+pG8XL04@TKhpxTzJzF_Wvh
zSy`Zp9Wp9Jq1OWi3N)QlM6?1N)yid$3{BC9gdWoeb+@`yAp-2XNGy@ur(}v0J&rcq
z8QO`}3PRs#%e2|Y-}SrJDu|Vx`n1{Qp$~fgs@75@xdv%}?j7{$q6c7svDGINpl0gD
z3a%8&uQHA2cp$wh%gK-L%;3hHri)`#J&v|^SAdBMvWnPgb+!0?oR02XF?8V9tOBj0
zZN>7!fmLMz-->#26EqMZYwC#1;#3#e8@E&y>!7*S4u^A`2T@*SuLhOb(ec4ALmh&t
z<eK!K$XS8|gIv=_xh7%`ryBmWb!z!yn#}N7ePcDaSvvGP_jK74$f^#yuTWn^$VyCE
z5ExnHjkgbAn&xOELT`tmp|~oJ9BB<<w9owPt41lxs-h+A?d)t;=A>5briq!5)os6@
zTb!+qN=wpF<2^`53uJr{NS-1rAH3#uvzd*xiL64glr=p1NQ+v{U)I?8ugOMZH^dib
z6)r6*lGL;TQKxl*Jb1$qyc)xL^^)DB>y3q}n7D*9`iXo3<Dzq5fSVbDT+OxnQWvJ2
zS!(u7tecQXR(!kY_Y?NCEBZ02^Y49(Jn)5+I+(rK=zyc!vYN^d#bwXrLX<$<IB-<R
z8AU8p5oGsHrcvZ>iDVq00;waj7tgiPE!oCnt;e48COg@oi3HTe*Nzux!J&x!TQ%j6
z*$ry#W$XC(RQH1-U^yAaxGR_oN{&uv6yD5AbQ%%H#f&ydO5!+jdiELS_Ew#(iC=Ht
zcu7W#s6@J<)k24j;zEjFw<e2JQqy&`#k!ukPbfmPNSb&OgQO3$93J9LX`Xt5A`ueV
zAk_}|vr`wJ3Z0UTrS0knT>#GBk$Z}f_lx(Y6Cj;uCP(ME-MJ9)kocIR!RU7MW45p{
zAW08mV?9_p9FubaC&hHW6H47CuavM4UPct$RVNV&n#&aPpb(?_=BKyt`u>;qF{&W_
zdK%sTzv!Akb`qV#cALPF;^dSqQ&)!bR6`Hkgj_>xYp_e2Q{IR+%GD&YU5<K{e46x8
z4~;tjK!pCB#o&9Zz4+Dz8VfKiE94{M6nDx7JOj_m(LmU`k?gU@xVfCG=~j(ij6oLS
z0xy%b`a2ipvHoSMU@I~?<3odniiAZZO(|hzSJvmIvR7~$q)0_yEz<nj3j;B~$$Vek
z3iAw+3%YR)^bX~WgWo5&dhd?2NjlGFd83>(io@>W{j1llErD$vB_mvbQcJ!X+4CW-
z`9u80lX`k6pu(+)O8(+WCC#tXqs!x#=TcaTnMu(KCxrdzazJ!2QXsMRPq_=(0dt7(
zx?6${HV`q$g^+H>x*|_T(7{m;hO%QJ9b;s`_GqkUb9o#k!x)(0<^t(&DL&2yi&1it
z&C}uSB`o|Q=_9P4y(HVZu*tV=Ocv&dE+_C0Iso<(BpQXIaz+#?b|zeu6f2))yXK#8
z75wU4WVk@-dvpNhWbAx$d8HX^0j!}DZ4ZNrh4Nl2sBkLrUkakaUp(=&@0R0btv-GJ
z{1@+mO^z)KpwNXjh6`Mpjq?@|1RIVm3h(8bI7FWqg4|tZ^)T6Euci463AX-tYW$9N
z+3%>aah;5&8{RQ+GeF_nHy9f3?_X?an)lj|t<Ener^vKyVEGo=kv|kDj+6sYq1n6S
zmK_DX6z6c0oSt2@PaeX*r<WJx?*&%`H2I=+LE>_4o*m|0^xQsDqi)0GFhR@lJ+*(w
z#9i7&;w#WBL71xKG<t|lC4x2DM}c}Ujuo{|o}U)#p-={i3QC<~f>st{mK2)#zI}Wg
zJrO&Tr`q866h*@ND~w}}Lt%<KwVC968a*ME<<sa*`N{V7_S?4=tplZUI_0Phu<nnw
z6i^#SN9R$^^!UpYYXtE0@s5F!a)ZuzNzRG%!Vrxo#oonsar_(mKrX_xKFWZ%DEEP>
zFVS=q5&SP~8~TfQEC0e6Zdo@dGzSK7+qQSvX`M$;kh4PIdb*@;Ay)CNQ_E=&u?a8^
z#iJKRop<RpdIyb?$zTZ#quPM4g~!otlGmw4B5mJfvYoi=D`B*J<r#Q*TwKJH)ALu&
z<6q>qMP%4MZ2ltpJv(seODP|8%{QB57W49iY}~b02g8yC&I?6_Yp~J02<=g*Pfbt*
z(G!$B!b||nU!S)xTE8@pkIl3@i=0f0fzhEv*Cc#LN9?3w#)k+D8=*GFxZZ$IGfY*A
zt+2ay?eydqya#Zz%uEk~Zk}Z$>;I0K?h_|4Q5bb7tN6r&AE2?)D+g)u+Z9cTZZ3Ml
zb4drV2p8>FEkL`!Py#Ho5SJWXu5ciI7X)fjX&0SxJ$gepyLEU0*k|zcZS;opmhkuN
zy!E{O*XYS~mJHJmMKnX7H*^!crN1z!x5cFsZzAAl;JUNE5M+5KwjAE5e6&l(dFE2c
z>Grjerh-d`w1#C!_DcjJ=6b}?<9IvzrcUHuzU;b92OD*9Uom%d!4yk4P`F(j#!b6E
z&L&s*A9UYGS@>PMhoimr0ALwC8!!><tuU1KBBd`CYPs|JA({06<BVZmSwn;xS-r6_
z|KO)`76aw%j`K!BX`>iF#AWph`SipK-;GeJ)AwZ(1$yi2Dtc>AN5Y=PMK2QR&yz1c
zyFDQ_khJjVtt;Sh`&Y-Ra;_0~h5ZB%#^YJd%&`s5I9X}|KcX#)mX8KMD?C3vzYkir
zr_rO8tA@v><O`1C62G6UV4Uy1BM}RVS01r=MY=DESoC9q`}Na7d73x_*e*Sf=tIgr
zaYlgGFpKrm+eUP+?<%fBpN+O;Rxo64dCvMNo`d2iv<dhrCqJ<we6o_x-YupKg3oT-
zN40)h3>T<#?~kg+RxR^}&ML-R#1j!AiYOE*zA9RJ0J6R;;5Pht$3cT7H*$b(;1lxO
z$vpm$%!+Vb_M`F;z?WIQ1cp^w7RO}O9nSBJ|44pbLi~@y2$887hnOh^P+4|V(I2e1
z=s}L#^2xsxS?R*^>mu2W%HEZuBdi|TaJXb>Hh6#;#@)NffgBHDs$n?Ai=A&d!B6G5
zj9{TOy59xR?*e7Whg99NJ`-y@Efi3$^bK*PZ;?GIKP)BcMSiYyHS?=c@Ez&AHtFBe
zjUK-K7x4Vsue<Yz43~HO^0@6JrP}qM<AP9B*qsKuO?FY~V521N6dY)(&ZaEoDFzss
z-(t>d+P}yC+Tl!}2BiHn4omAos=w=I_&a20^;#V(FlHvQf(>$|KxrsW2!G7-WHj_N
z3*n1BbZ4g|y(Bkk3RN;?{n=!Ye4rMKvp&HvvEHmH+M-k}NATfLa;d%IgGth0An33G
z?{l*}IOO!fZXvCfZcYgF(;{83ZB|{5ma3SKr-6>NvlXO;>Hop*+r~X;ijv%wv50<5
zWSlC(fciy9rC}A{tUv&%Pu#Av4r>s+IJYVyQ<rHu>8qd5LjvokND8kSCw`VKdzmI%
zce(LwueaO<EMSKG>03Qozw^=O?;SDsdYuc7Zyp}MNam;mse-cg9jozUy$}m9umo6n
zDAkD@^-}?^CmE;Bre^-7;FRx|_4cc>F|$t_w@F^j8Q~{%9p7c#wyR0DW=|FQsw#v1
z>F1NEH23pKJ64G#K7B0fbDSv}4_9W1`8{b_mn=oK8D+u{0k6u?F@`b+h?uiGV926y
z9fLId+|eivKfX!basxG5P0S{M_!Z6;!ZN^dm8~%rqkeZnrfS;QsH(M+Ve)9b27jXo
zoi+p1$(Ni?%Q3LVN9kZ$HNuuo9r_Km$nJ7UJtD$o6L2x;pt}`{WGZQP(s?+hooy@_
zz%IZV6i`>?!L^|oe3uJT(fh>=$%6+~r-DuyhV9K}15v616Yvo8rm;?FSvbQowGZ!=
z1wtTME}L}kIG#$;VyNVq=C-k1I1t7sjx?ReSsC(CLygJ)kYOPPmzQWb4GxKz&e8O+
z<VxjoyJSzoVVrI#lFdSr>ad9;S`N<hQYif5q89<CeuqGv>vHpwYlyFHZ=b^fO4t3k
z;_`YiN|zNF7_}8CtVDnJ3)!c75&+9lxnf%6?_>g9wrO3;ZI?3KSFO$?!|L#W!sJ1q
zXZQ7r9WZ@R_4RsK7hSBC%X_1+1)Oh8?H&Q>MSY0MQqmxX^6IV=0a90bO>TD&c-?dm
zV0A0mTMprGF4Z|k_nU_V-JYDAZY?efpwHi`oJpCcMKdc&_Q8$5if=C%LZqdjP|(}O
zRp^o1so1eC<AJG@mA27KJ&g;8YAwV{2<am8riF7FoZ3nG&G^~Lf<?;M8gA5NU3~4-
z!oYgvoJ4D)wmg|5C9|$TT$S-9EF7}icA(WJy;(6Eb7QSLfvbuMRH$-aR7^nZ?SiAj
z7?C`if=yltShU8;0+XlTaVCoiS#PX66R`+!XCf_#s-+fCuKb3Db_Vy^uD~@fK%S_g
zTE}k1o%}e*i>Qk!c?-9nNZ8bX5gY3^m#MDrd<Bw;O!#^Vbxsrbw2Lq<>J^st<4w}(
z<u_i2yd4zkevAe}a1GLo@DhYB0i{M!)g>suD(}MLWhht2s=E;O+#mDhN&BMvs(pOi
z?z9e1PmVhE>Z{Q^Gzq1E39BZ5!|7488~=1atwglet|*)Qk`0He?TUu!ET6x13GB*`
zR$;@fw<WWqsE`EM5|(6U>XUIs9i(=2-dpzA*<_oil7>mV;U|l+DX`<mmpvl|2dQ8J
zN)FFiWDRSEg04dkJ<80t(1K#EQ~#4yC9}=#YH{9AE}!YP&+GYRAOOC8N{nIC*dSV)
zd>#k6Eum-V)hG#grG!2kZvL1M?TVj|q-f_Iy0gqHIPEp5+@IiN)8v@Yg>?#cUZyMX
z6JE~WG?(HN4va63aTt!;&vvNFLu)|TKH|WPX+AG^y&28Yt7~+wxZyB4xKt^*Y)!K~
zPsya5f^*MNc9fIPf_mYEn$s}$6f`cDG-`P~!Fb)|92SgMPm-@9Q$V{=UnR0H!Rm!)
zs&1mtxd6K+oML<l@?)UI`&}T_`?Vac8x+ukHx-<(qC+c%@FUsW>HaqzVygkOk`)~i
ze*feSE1CP{J;F`$X<be-4Bda{E>BL6PfyQ2txE=(PekPA?)pd>MY6s?poRp)J8-kU
zSu@w%gWZsFjNiSnr7+9AV>!1bDYxPbe6ng|l@!ChwH*(MD0}x<lMlgdZG2;{9sd}%
zK`zJI!OtgIS-}vVajs|T*@UlwFO6tyGKgi)Ffq1VJVzw!&wMkA$4L2L++oSK#>qhi
zxvSl@iL~Y>D+>s~zpQDml@YE01`QCbv}3I#)`i9sqY}BF@`(Ci;+@5|;u#b|sVhJ!
z3=yRnFLU@SPYy}6Y&0Om3gG``$XcwhU;)w!eRh)@r;$~Q9wyJsK!8Hi_SU`p!n^V#
zn-ARwfB_H!kaG4Tn>@s5;F6`BPYQx=_=?=9IzAjq0DWm-hqlZCNQEM)Xf1YJvMJ@*
z?|;XZL1o1*g))oTDz)IP_e=O@TA4R&wQo2zPirlndx%EZ)lyLjuQ-kU_d8$Ji^d}a
zbh5MvuEuX(3<s`>+P#f>fGpXw(PqVSTpWMD^;l;?mf#dwk&swxdCNGnl})!#J_F>H
zkVwgabR8t}`4Gr@$m92hcDX$RR|;Oc#PFO^=Z6_Otzj#c<rIp|-n&(3{`W$Ed<|RA
z_Xab*GTrj{N_v7%Gy1ObxOW=%D=eA+XSB0k($i-U#)+%ka#>uJsk$Lvmikj5_bZ}2
z^%h5YO)t@8+a$SRH|^_H(wYt7p(Ty89$Px-bR-$C!6{zRj*B5G=)NVkLTpA35V_2X
zy14jIyuwaxIc+G&a=j#nrjo4nCrZ7GJN9F%LjiMet5|wc<yUXK_^Z+1+TLKL)eD*4
ztzJC3#QrB&@8tAui>HwJ>8rQoJboTiISfca%oG}^;H^nhx=AFm*Psw%=<}#I=_0s;
zev|YBt23onF=1i<+9g5tKEcGuOHFw<g|&`gwg0a6`zoGNQm4kFy02S!P74y)FI4y*
znh5V3v~Vs^Qizhxcs7e~F?uA13Oz8Dj}jn+V0oxd*OX#HiVofdPe&5&wtB~+?;@0X
zVB|!)(``%IzAL3#fhmGiQ^i7vw9`K^p+0|IxA!2DujpMwpR0RcqhG;M%cLuX-i2n^
zqN}WopPX^%qe@BH`fC%w;nj;nV%q=V)xoRkAF?<s>|JwlRG|DB0oM;_zuxJYW$yr6
zSgqk*hLclRD?%)tWX|}^ML-R$UchnZs%lw{=0XGer@uPfxiWW`tb@|0QZz8v;&8QS
z)nuEv3%nt-_yb2@UeZdD-iSZ2{XGy9v$XWCGmmHU+PzsCT1eAoxmuFEqgosPXM=R7
zCP<ln*fkJ}vK{^`4Klpm>S@Zj#w^`_m)y#quFWiJccnCoY)XBsx!ul^?o<&9<$J!f
z=t)ei4iR@kmzwZ+9O97UkG^>_on`Z^pN+QOC$pS=YMYlAFFEMY)9A@G&hwjWMwS+S
z2%5LiTNCQ=IvI_!>M&)-ZsL97SWU2W`op{nWD6Ute&N8MGNXG%W^~;c3)=L92N-Mt
zdiEtq8)q`}NM_FY)aMxS6hn|>Qgr}E40eQRmN87;hGRVA@7RiP066U@(H=(U#IFH2
z*b)=5b#h86j4?j#Vu~)(z#vQuLtf3aI)m|yM09bM+ls8R6VY;RfH<Eo{%I|~7$MGA
zI+k{xr#FcE;w&P-)|BkhxbZ(dC`N}^Sz#~WJJUQoZaN{j&;UO`z`sM#3*CVZw$3kO
z)Y&>O-GJepeSLm<^5U%70j65wduV{KEj?|NI}pK-oKw<V<x_)CU<&c`Q^CV(8JjJq
ze7O>MiM6Y@QtsM>hUqDiSF^9y_mOd%MyH+#J`*h;`$EExyPOY<lq<P3rWr!M4XjEb
zeZ8=3l!c2Of4oS?U*hE5l1syh!XYPQ%Y#=VLXnJF)hgrDc!XK1ZkNcmHoTtQTxB-m
zbP2gXUDlwir-<w{lC|57H^RwaSz{c%lq#IJI%g$prm5|73O${UlNC`^VZ)9Sj1(@?
zf6drs%#5fP5~a9X^q$<jOxRTT$*q?7<Zq(~(U+Qf80R}lMqO;K7{IeYRB;s@{1PgY
z$gX9D3TQrD3Tf{SCgtw5Pfu1fNK0O9&L>lGSyr@?4wg4Tt`o}|a1~#;CBa3mUS2Mx
z4H!&j94{9bt+6XowaRv+oYzcMmvaE^7$}&;>=>iY;JC{NzPR_<$b;>0F%64Mu_v!H
zzzyF;8xn$&gdY56qwXDw>J?v%ES+!nEgmF;SNu}5AZs20#6vwyc7$orIlXKaot<_r
z_@KXpAwAwO@mnc2_%_tc@<dg@l3H&>ak8mc-k^*{_@1x{#t%>Wiy7MD#q&AzmU~&&
z=ke$rMYi6Q6ujvKH=_^S4LY&Bytp`PNUDNpp7gIL>CX#;K{xudEYB^T!EnSVJh|Gy
z_JH&Uq>+4>jxuzxqYMRcU-E0?;-}aP<-+Bz$-q$pB<t0U4dEbw0)~~G<zf_r*=ae;
zG;{;a4KtvRZ*r4D7t;pgup}mDd==xo`10XpXt<qXPTX{2u&oJA$kRwLl_Bj5YCdFJ
zcs#gud4kzt&A3Jx$N8t+CKPU!(k!GL?w|hF5XW=;VUr~@Iy&v3D`QMSHAh4g&ohim
zKDos<b0^2G?&#~7@?%!=1(Kmf{1u>)t7Oo%$>ZhuB)h>VB=DmqLB!1g9F5{$UV{Q#
zPG!sv{jFz598Rl#rpBb5*5T!O`{Ku_d2s;@eKbhsWJ|gowddp)CQyKxfO{F-z_h3n
za);Grr&TvVjw?yqx6LOh<rd%=3>KPIfwvjWsOEDFPbbc`n1}h0z}E059R*v>{Rw-9
zmpVq>DV&OJ43VjkUgI8d4IatptP^qp*^MF({5O=;o$<l<Niy{_pJlW3D#biydj4Y}
ztYK|3K0`MN5e`?$gdFQRXEM4HFUZe6hZBLo2z6%a0L$Rb4WdVF4@1{W0(aIa2+T-;
zeM~@bDkBjv`vGR3&C0;WM#@S=&5|2DexmN@nhhNJAVYfse4WB;bl=6ZSqPY~lkZY;
zGmkbYyzSdiLc#a%Ba=3*Rxp#)SVgjXp@a}sd|R;-%m@)Sq4bg>*a8J%!8!3!aQ3fK
zw8z%1MtGdg7?GrmOJK(+sOoigGvNf^Oq20m>v3?x3FBFU{o<=YGO+jyMB+V*T$b{5
zHbn}qlpE@4DXhqJi=pRfF|ZL`kJ7r*ON>;=YAqgHGO&3h7>r!7eouWCEhL)~WCH!_
zGm>avPMl#xxx*v}Fzyv4kinyHA<?)B&0+!?IK=~FyF!JeMZS)uQQ|5Sr$xKKG-z*y
zi-*dtZv&lVbdlf3T?|eU#ZxQc5ix-{z~HJ;q^}E^tbrw&fQI{8dNycd_qEHMgoE+4
z;XF36J>{eXj|q<{b|l3yG6XU1Ew&eNcMhRu&Qe@)gyOo3P?1`T`{AW*$nwRUA5rE4
z*9!Dpx7m#`Y0x|&?-pvy<+loZZx}|nAl|0~GOkG6eXSl$XkVQjbF&QTey(wzocjbC
zF^}1xrEgM0%E^))CkSz#_4!%fE2r7&tT3^-;T~!%%C;5DdAw?|=?4^yj7ew~G9Eke
zoqlp~0;Ym99^||dr!!p|Q)9=AwdAHq!SH&V!;yv5(xlCr;$suz+XO$xieY_NFd4}4
zhykJMAA1Lp_;|v_2STd03ywFLF>H*TivW{q_-5d6UIoX|z3-p$$2@A{F+@5+SRQLA
z_9NFGaU_VzvuBfYwF^{GhMr6!^L&uR>p+KT;&jR&R!Scxv)bK`UK#Uul#(dR5^Y>(
z$R|-(8u`bPHdqKcrsdr;iOmcxR77SsK*FHhn-(YLje;`?l+hRLm#A3_6EUT4R1Tcx
zt8<6JNdtJ4_~OX4C*rGg6|;%L^>PGXb%mxT*;sM|OKfgadIlf^&(_BW6to8=yMZu_
z76BOV5qVT}A4z?;5sM`#P-CIJH|g6#su=v22kr)-duvC?FY6_Iuoc7yQrcG6g<21t
zNNEqb@tFCI-lJ~nDz}O|V2^w;<5J>R<JF|Ohc75=fOQ1{KtmrM#z3CfEG=bl`$Wul
zXY9xO7D{l)gf~xUvKaRgqN{qh^CV{$M7X1zvl<EuMf9c<VJ9cYKvex8Z@>w!4P_<>
z;{=$6$Gm`Uf<KtVZ8SvB2w)w2!^Svg-k4aem`30n=$kaZW^oCwKBf}H9NCO9-9BtG
zLY_o|q;tQJt50GBaY|_5G{>n#C-c*su9>0R;h73)Qh~JV;+;bYo{{S1gQ@Yz>d^y}
zZJ1hOK@<i6sT(9gDLy0*Y?pWHK~(dbb`yeX*}Ay~UzpTvaZYJMVq>qZA|)d};^j(Y
zO(@Nu8fa6hM{FXYMl`6KN#*F|s}#>xPPI8P-c2mjfxUSAg$Y{R#gr#q&Ug}SJq5UN
zGK3Y2Q8Ka!i*-iv`=t1qGo;{aNxx?@YOy44(R<ig^de1aT&&LdR<OF`ehO=esmmrL
zPC)sA2oxn@5DFAIgB>FOP-Hd-Ix4cqQMbwz2S&877^(H1tbQqHc_{Clq`ZrB9c131
zn-f2qa&@90>%%l-B4SKwKHU}1JrougEoY9SYy(R&;aNg4Fe_?ef60nSrkhY*e&rpG
zG8_@$m-a)WmXgxdO9fg`>ft-I{lR5H1KK71VD+G4klV-+N-LUhR$)mCD!%?LZE*Ib
ziYD9zUDAe%&R2pdwIO9N_&4kXuei4tv=f}T6%dLMZ<1Q7<~`#yxuvCltbOP{?T1U#
z3OzQkB0Ex1nAgHKEelssnrCfG%Mz(%L~=%jKT^jfv-G-l&?vc{<hUbq7a_&)eBj5o
zgWGgCN3kj_HBq{RzZ*i7V@}=aK&9dAaLQSLNkB^JUg-@sLN(?7jX6UQ=l)epFKMTU
ze|QYoW3q*Tq$);fnw4xpI6m%T`-@Vf5u1XRTeMk@ZK7WsZ23|?rt2zzaq$ws?kRpe
zbuN+Q0mSwLS2kXVn9|%0tX+Bg*G&RRyjTy4=)Z0d_j8&3bTK2;i(H$xeY7ItWQ<V6
z_#E!3!AL_iY_d#!3AUDD90Z`WZpIkGVnwy0*o$FS`7RRzZ>aj)ZCpWqB&3MrSZS6H
z_?0_1WG@Waq}`ITv$`?d;m<OvVncRR0z|u(J#aE1dkK@BLqq_~=Rj;9vPCWq0L16>
zzB-Bf#w2mTOm31I&D~#YIgk*V=HZN7x)hZ~AVSQ_I=WDpB+zP?3QNI>4xVH1AST(-
zn?ZPMXAN`#%6Sg_L1_%GQ9R8l-$P*x(blSQ2cqz3YfsAYU+w}6vKb*`C2uhtvXNP&
zK{`-2$zVg2y%^T3)LvnX)UQdk<}9m3PR%BWpl6{lF78MAFU1uo+E15uW;Lkn_~Ki-
z8fcuq{6a@rnGjNtUC*)!9{~!#Y8VmREcXU0pP$U?I{bSNxF2Q;g-=AD(obNnL3J<#
zxdxjhUIt5%Ly=d|kNnzco=IHVT;*7nyLIfHcs{Oak3ZjD(#K$7C5D&=!u&63gAh+7
zALgh9PyDDr?6=!XSX~k2@h}<PHllPJ=C3(G>E_RF@Ip!6CnM8Q4mVFup}2txh*9~8
z*Ls;D)?m5V&TCYY|2IwJzh(9~(H+X4U7Bt>9w&n|p3|5_Y{D{xWVjfy&fS|Qtc*`k
z<k2qfgl-owCN*66D>O*qO|wJ*{*=3UQX&J+8DvT_dYp+z@}t}&n@kKz%ZHfdw?GxZ
z0+VzH1%^YE_Z073FKKsyMSl`?+JD2__pe*E-JQL!H^2S5UiWw&w=`mDJTPTe$bz9W
zOxw(IYREIq#^ie@H1>)Fgod)wj=aUwPe}XiqpyG!K?S1P5RUyT05sga#mLwZ^5#c;
z6j2cfjrOy#<VOzBQIt?L+)XLIcknK91A>2^ImsM8|M1=IWi3&$h(L`JR34(<QS6NA
zIH7-om`E<vyN%!>YMxu~Q^q5;x+g6fjsUGh#8c%Z+?<nu9?ikIH_8N{sa!M1qy~L#
zME}C#R^nI$TfiVXFE1~SPG6tU^2GoW`Fsml5==@erXVctXBj__hMLDXW}1gKx8i&n
zH3^V%_tfMyeCuWkH+jMJflVE59{D*8xN|3k0lQ0tvKM%QVL???eR;xyl&=D~hWknS
zKI!u0@JItHdl~1i@%Kw&9A-6YPqExO;a0UqQ6SSgIYQ?piq=_h6aqS!O+ZvNgB!uz
zj+p$=og+Ig@(hHcI2tB5c1WAVVdsyXC+^GLZQ`QPq)3Blvl<GW5R#PQD`5w$@ng<u
z#%4aFkxL&D(>c-PwZ=bQ?wW|B(qH2~==gbw9~1at|An^9Xi_7010wI12)|yU_onO@
zErv02DzrpdlMS(lR}Nr^K{8C>zJ5<y>Z@5iM%1xgu}XVP3js`bv&kr(B=Dz;Mo3D-
z%x9?dyT~HU+XT>gi?_MmzruiYH!F6~C?p%vbd;cc<O<&U?2T!QMqmPl;IFDlJlc*<
zd+$>woRq7glOYZ#rzgklla^cE_gNMo#*wnH1MXK61a&(X&5Kr->lcFp1x{6=#FtLP
z-SQe2+auV5BYDPfbk3=(d3271)W3VE=Zj3PA1WL2WfHu7Mnt8`fUOqPvXq8@s=<bh
zfrnuv%63T<`xm*8O=F2?EG|{clCb2fq-aU$prGRMh63TH6y?>*#wCL|p=7adgA*U8
zBT{|q)j*InLhC)ulYy3Q+mt~Ah1X28tJi>Yh)6ZW&C@Lu_tQ}t&kNLbJWA)cbg!7Z
z#T`6dGU&H7n~=S&UU{qmJ7imDa~ff77V!uhGE*RX)dA`NQ?xl@D*$Za@c5Dx3D2AD
z<I^8n=Rp-oJi3W*bM^nXaXSrCQ^UKM!wlnjBLtA-OrN(WoaZB!6NsZ6prN1|iFxY&
zbi5doG!X3@2tkvUjWIQ?CxSwu8fyKZKOhfb%y9e!TzEkCKJ~&NyV0~8{Hja!I5~|a
zzv<!A0v~S6m(5YjWg<>_<C$|4+Yi$Uw+wH@<aK%LS`K<JQNe$8ML!JpeA!qdRyN|C
zX;Kmu@W8p0uu3G4Wy8%(%`~@Fl%&OR`N?vWz?m_aV<O7fIwrP5t1xg(<0~jztNT(T
zo?bfXVt=b94#l8vV15`%4=mZp2<MU`#ap!#Oo%4S>Lffas4*i;ZoH=qkQ7497fCHk
zS?Lpx_%gg4|NNqA_@Q9tCJXI~joz`cy-Uu*K=v%2-J#g(CbuM?H8XWYD`lFHIvPlp
znG$Wderl`!a>CHh98vUMRURAff6HdGn3)GiTRDu88!~QCIIHLjws6y}qbq0NZJ>&M
zsy5`y(2j_`p0DB%V<_2f1~oKmRzV()ap8j?*?LmEV<?Drp?PM_90IeQ$bIF_n3xxL
z)<tCl&01p0HzxyL&h{{{7$jOKEmv71>ag)k0rQEjD`Qp{BEo4KJPxlsko}-xh<LBK
zSD?%2sc#0+?98_1VOIzSYR#JhtC%s(j&vK{wzI{QLmXz)gl{X$`w>>n`KFgtPP%o*
zR&(q4w291!crtQ-qbweXjR!VHR0ZB-F~wJ%%>e@=*+ZBY=CC011eMUGA7imvkS<sU
zqxN$EPsnRtI|hEZRC$4eUAbP{QHQCrKG7RDLdNhc)pE{h?`vAnJQ9;Q{CkraJ_7Cs
zfMnRPD-Q0>bk<l~K>3+LP7QBtS2Uj+6tkKc$3TTl=MA#wX^@i)-fWU_8CDWd{G{(H
z4GAWV{5DA8xVA>~4A?No;z%IKN1seg@S_$Lc#WGY*>n6uMh5f(Kgj)lO|rX==pW1&
z=Gk-$ujfR9>KX*k>QJ=j=!<9`ffuf<ej=gM)pwITdidscl&GUPcP?KXiF8P30GHLh
zAxZ8-EGm$S084C%0RU@-iQM)f4F>T{ZO1W16LGV|j3S(Eu2@}5|KQbz*~~b(AYBM0
zb-cYrej6PxVsY=v>kZc3kiWtx>%mSDd&VMQA~GEjxNB0vK2OAKtA!O=giYbdIW|IS
zNp_7dF`E6u(`{`6x9oa8pXQGrKD>f;TlBVJ!yb~ir~I4d`69_5e*5o#`3tQi(WU4T
zVHWSqtVS7bEDa;~t%aMdEf<^GpbLaD*xpfaFRyXez-yP<>dI>G2ik}Mh4aQ7!1ps3
zsukZSBVW$fY;~Wvk6Yc=4{%j>eu1Ayr*LP!ZniIeDHc3z9v^p~wVt1zqm4tWb@q!s
z<Yaa9%%Khhh^(*P%1JTzMO@NV;t2-C8d|s=b$WC!kOC$XX^fwOW4%E<IIt@jT4uAx
z>ovD!_STW8;f2lh>QN6s^qoiV-#D;z2)9K|&*ciBGqTl#&-P&yYY!3r{(P+ye*CvV
zGE65))IRNAygY9;k2<Ks=$>4@igx$@5_)}l*2OQ;PQ^>k@U#2H7gIj}z#67mm%rz4
z%Kg0EHzmiw9ewc1^P_MrLKe+=HctBmqYkIO$n?T3(5+(2X48FhctUdmR8(FEzGfa;
zVK&_s=;PzyLy8H{-S9Ev>r|q8+6}f!v;lF6`82+nxI=^+b!%6u<PEvM(Be`$CK(RD
zCOUbZC!-+^k%qMCG=&es%c3rXDM`Dcl8tQpR3uz%NKLC4Hi%`13ZpcRX|rA=WYOF~
z6;fcQQVbq~^$I4j_=t{}KRWTJ4GyXi8jg;X2h&-9Fwix}^J|~-p?n34UE@dNTT82m
zVL<yxH$^sHsG%C^Lw5{O1+04JZEu~;xKvuaX(UxnTTq#V$K!aCP8Xxtb$ZDcy)EM`
zQq*Be)=!L8<E>2{XCS;cn(xi82WSZRX7}5-g8uT!6o`uXuqLk>YRW9XVb~kAf`jf?
zqrpZaGWj9tpmt%8x{49f`6w~<oI<c0htoxK2xujp-`c1L_@~>4i2}?@d9=vqZNMzT
z7|6gNYSzK*7UEvMj#C!4(~VG>97?>Sc6aC#P7cK}mWmKJ(7evho#NapGK?1_So4o6
z($&{QxUup5lqEs@vXtZ^+;zzC$H%L9Q`PR3aBDhvThMv>)fSVrE0$A3J9GE6=S!Ba
zkk*SYU9>w?YNoh&git5s)HKhKctt9I<Yi9URCyeV(`K~3R^7u$3QZkK3Clg1ls@!D
zSNc?BKt%)#ixf(5zEVR-%c(-J^-`L9HyOf1;0_C!H2E5ceklT+6AEcX7x*RA1J?M@
zMKZg^aAew#s40Ve1?;W}dd>jd^=ljcFvu{KZ8(rcF2(!`1&zezY?1LpV8c8&oHCp?
zqMd@Utqs^JjYsJ7K~i~=Mo=2v1!htaE}B&f4ohTsV8nJx=e18g#@AdCW|T3@=G6x6
zbs`8&czY_uVcMvm#|9r|oOl7L3Ua;S6C~0&3Z=y{h)`Ij_X!tzthdokav#ncllVll
zaF9kca}=v2_jCqD(;hv8V6<yP1gt3hG(f4Yj%4v1c4YL}hU36t>rw#}4%4dzdZ(|-
zF}88xC|Be<2e|ucunpH;U|bfCk`L*;wrjvf_oE{_!64v(kTXEDg65h^dGk{%D)bi#
zUip_6Q>T-woYe`e5)=WHE(1`KqlL=Uf;&hXQ#>ti1ved%)Wpps>$=35i-CtiK(`a1
zSuL=JhD{N|RY4aI1}SU(N(+S_%Y4k;9OwSkhKnA$*xoiA$GQqMV6i~C-Kq-{FpIMQ
zYN3c1{xm7y^V%j0q-yu(lE=H@(w_~&7Mt}N5piifm?CoNp*SQvLkIra3VNkbdL9%r
zB$ok$VZyBXuZC`Z2lLgT=OyW0GMhEjb-w7TUIFFBSd88UMNtS2%*G%eRIAqmBucs3
zy?drwAE~mD|2|A>k^2-(BC>t{lmUO>Rb{veZ&Kw(1#!}b*`*pR_2aKbi#nOYiV+HS
zoeUmFU*(myWl@m>@JEUl7)ji5QpI4jE3WBJoq&nr1nk4I!L7L9Ey&T$xb$WfdbIkQ
zJuv6oV-t2)LS_YSs3fP&w3b}?yZg@6vT4Q4m?}V%Br<Da({xX-qNFdQei1`B>LDZP
zRw3VGz3@rvE5tM*F1;~|NSMouE(%#}V-*9XE|IiQOc03ouyj9mKkI({hTYf+tJXX(
zE)zEa4J62s)36<~A;QY1!&}l1#qV@QT_T11l&BE#oK1AR0yA@wK+k00V;rNE5PY2&
zJA<OJ8wV~MCo!ix9J<O@$Ld{x0Id(=83M+r5nW3_34h3vxI?3|VmqvAkSkn9jaNGW
zC#=;?!qAE|+9;jRM@ey|mMWcgl!*0*kY8tu(ZGb}v{w1BF&uUy(S4C^HL^7u8+6z8
zOf%s?oYiN0D(Offf!vzysKLmLaSwG;=jC>N?NkNrAM5t;gm{P2ZK+Gc#Fu!2dunAP
z!(!VuN4X^ad}Ln@Lu>m$q&o%#xJ&-S1B%^vM|$3iS*?S9Qc-hruU@>*t4?3Ni2uq4
z&}zt1ysCV4{IBXdT!pX5zSc)rrOi;~!=1LntctBoRDtK5P}nOk5Q{6?)4gpEOIX2d
zC@Rn8kfD;=!9O(81{)eVLPxhLj!KDe-^*rnvaGucz<wcuY&Bq@*Fy!2dz&w-uzXi)
zWrm7aVZ+l5h4=O&5HABNpI&fI%~6VWaj*!k8w?_53PpJ0<h4T($UXa@C3fZd#5W-d
z!i*zF5_R~vn+~jW{cfh`D}+kcGvy%qzagveV)lq}_TH|Fkp!qBq;T7i-oh2n8566k
zOk$AujvyuGXu0Q%PnhB$j*=11bol~DCAr#Ci6-s>0L)b~=Y7x}`Kp2p@uW}9!2kzz
z5vQY)49Yb6w&5iP;`TKlxP^KnQ)WpJIuWK~4#76^aXPmOc|6Ov$kNV@1r2XPu{LW+
zqWAI4o*!QT7!oml5^+`tsjqq?2b&hx=%?jkx}SU{k`uw4yyNq-4BoTi$wz5F3F=R(
zMZG(3KiLmt#bK<H(Ee(M6qaS~ymb(m(SNAqClenE#+4Fd3!bHLPh_)qX37C|imz6)
z#E6rt>Qkw6{Ahz55vsVe1sRj+y{LP!dw#x{1l6(}xpbbX+epBn<c29lJ|Kn5<nDO;
zvp|K5ciWW%_o#&e`o);i1-};G>a~n+D|{RJ^-!v16zrp7)pbo0d4Gc(OepS=0yN1}
znk`C!V4CtV_%hGKUxP<sO<Gv&!YmEOm?u-?R^Rn=8&%I;0AF55YjuK<YJN!TLcutX
zUCUf{e!WSI7nS9&osb#>a%r1|?WwHEfp3U|g^=Pipdfo&aK396SP(iG&=B|JGPJ(q
z6gvFbNVKjb!8d`k{#9sEW*8h`kLJ^CBHM}5fN<QTO1|5Hw{n?5)@5|&l=^b1;f`C-
zr7CJ(w5DI&Xh^>l=pnrS^x3oH)5GsuM|hyW@ZmU+Pt$E6NFBVy<*5K=oTo<~+@0@v
zC|=(M6BITA)0~?sa95W40rLI?j|e;s1%wjRk$9Vo6cA$kFeYp#9E&G`gONFqz23t$
z#LEa+6d+^vUg(u^<oVjyw~ImV;Cj+%a@>QSp8`vRaH@S#yRO+RhT$HQX@$0>iV|jn
z*oV{!xr56h=BN}T!^Hi54>TSw4KLFK+D|!4cIurit1&c(Wql!9$s)b-`~U+Mc&P`c
z<aK^${uY~AhrRvh;H>Br{UaHxKbVGq(ZC-(!)J%H)ixJ@a1Wn}dvLB0a<|l|D*h6z
zi8(zBb%g|qy0iwuy#stK6Y!Mjkrm<-!lFKN;;C~&p(72YRM-$+OtWe1YDq3wxrSRq
zwxcSeoCflBNmd*BnNre_`vbW$_?*k8>t*4zKs5Mv)XA_OQ8ZUsv8EtR%o<pVy0lb?
zBwe;ACN4#-UoS;mFv>hjZxaKCOBO3O3LW`6b}(4<{fG!!8_5%mS*1L1Two+?sl+0x
zS3BT`_ScUgLHV~UnaDz%d5Kg*<MElu5^DZL29EK^o%y#v{qgzV@gZyDEr13f%OB>m
z{=-2soW)n${m<A3+7EyG?brBs_s`$#xPRf>qn*9IZ~nCV_3qxc-+c4uy+=@P_nW<M
zAN?uX`HW+z{49`ei=sa*dT?A8OUkWy|1bJ^$U!2S%o2?$$Y;bbfWCvV<_^1Hcg-Qt
zZqd8sHhL)5rjm4loDoSO@8rRpC0iyZgXJi{;7bAk50G&L*966(h`b&-4jb9JQKLw4
z1L~dVeFP)Or<meIeGJL3gmQ5vM!DC}v{LM9N?Pumb^bD}jHH9(?7gs|#EMg@nZaO2
z8QG9^zfML|9d2oq6iPdr-p<mi>v@Ft@!rnfj;3Tgj(fl_v?mk{1QYjAG1Q?G8aAmj
zs5J9_#5znU(JPB57c-e>FP+3QG8!1?lF2SJ@kFqdaW)_)TWq5t;?CJPol8DoPV{0d
z$4yLf%d<!@?PUH~#ub&uMiJ0uP^j(XRHU5JftR*N`Y*F2aH9e@(9oE-Bv3O1q|>n&
z6WCE<`n*w`jycSDa468FvnV<gx#vTp(NV~tK4~<L%nv_<tiLc2ffXMbm)9|pOKCjH
z?dlu9V|OBEekV>iC(5<}qhdhPuuYUY5g%iWdWtEAZDg~Y2qUrXFl$Y`NQT0gjH0%T
zGo}z=dFGhXX$EJ0pgKx)a?OVG8w3FdsEB3|_id<~BFN1UrX~zsdG4Hqi<j+A)H!{A
z@w$25is1X%`RNbsqt;RM>_>RniVjcDemrl#czF@MJUu>Yop++<$q_s~xj1h>ySzAs
z2OG@})TF$N_^x^KW7PWV*?FteiB8X>_Nz0Xs*WP);JkTq(Qb9%e4QK~Um}Ush@g$=
z<n$ssZodLz>nOT7ZD7CTy<Vyroj#9VwayP;!q4Wj_Aw>)gD#)9FHW$#=g?m>I%}R^
zv=1+jo9EHl<@woZhg!q=9kn}$$IbSu*3mYM0s4)|fi>#9Y#tvMrhEGOq;-xH@aFoA
z+B$AGpB=ZjJDBZJ`@D5{fzz_z4q*{tkjIUvbJjX+<CoT7TQH;M`Hu}~meA1YNvHLn
zmrxGgM@P+9%@;7o+KSbI9Xh-`Z@t2SpFYQSI+xEn7wwD7i&pgF^z?|9z0*4Xp?%ou
z>_^9^9a^}{POAZ(Tr{zJYz0;gUc>iimz_4QA1(UH1+XTUXBU`o7WVu#tPrdL2E#a_
zwLU$eIm2R|p8tsL;$qNNG@{opTkstA{6waAao)t`=)eLVUbrQpS6I&rXR^^r>&0>V
zMeF3Sg>O%>q1WwBtInI(?qHcVcmBEwJzwJVY13eA{MCWw25oKBejYWCerV(1xiGc{
zAkk?H_`uW7<>5<Nea?^Y#lNvhc@jy!-|g!S`|Jri&Tn5ob)Im98~<58AHc1Q&*0$@
zzD6%Gtk+TN`FZmN39#t|1Ma@g1{4GV?l8WIe@ZwrnkUqyOKpL!BAAPGPB}j@%PC2n
z`5xul;07Z=umibVl%_1cN0Vuh(f*WlQSQdXL-!gUu}OBs30-iE8h&Ar05TO{boKq<
zdPiv=xWE28;BdvgS{w@j^}I)ak_Mp8{=7w*AU8LARCJaMp#$@LQxlkVFf8i`*d}cC
z`{ed)K5JsynIqE`m9JsVXcMzK4sy)+1LOsN2U>u>FJLm?e%+-=E7uJc*KG2DF-$8@
zj$5UbmH1hd&l1q4LnJAtRC7JFgT{@q*{w`j+(leoG$<iTf$dY%xv3me5c&xQ^&o1D
zV_{)>E<*~%xs%9}Le-h{SYi^02%*P;FuZ^in_{EK(`r(lCD{ttPqiIRKVrx${KE_>
zmw<JHLMr>NeHj1^Y$OnqiTG0PSc~HwljLsp_dpT>;eyHdX08!cG$5NH>&!C~g~8@C
zLe_t7rJEv3pdcCB<tS7zov5cKq?m?W8#IUKCeaut6i8RuZ_bA!$qFflP0c1e;&pT0
zPqOZuhCpcz)#Ec6_ouftF5HOdALlhC&2wtn=4IV<cS!M7hFS#toFe1q{}RBO8?#`Z
zOJ|VRXbywifmDNvFl53YCwK;YP?J*oP9d`k<pW@gN&+vZ2j@Iw!y!f$Igl|#TM=bn
z*{qvWL52C{fxeV}A4v5QymNUM;=P0LYXugf3~WM}^1eD*KL7c*S5j}f8!Va8IL{kQ
zri_uj<a0CH3X3f$6Iu_WSq@1^_T|BDDM%HUR<t4qncL@9YvhE5hLz}HIEh-XfNDDD
zNP#uUUjcIg_Q5w5#*VSjmj|cM{-cYe3=kr}{1V~wWCAP|OpV_G?Q%+jLvFfg5nSVG
zm0>jNl|5*)9u%FqFomC*vtllORZEia^gS2~O$|lTc5?o>YwkP`{CS=?UzZ%V_!7oH
z2c<)fXSa^+`5EJ!)0u~J7f2mWod;$1OC_pS#;y*1vkt*ard8fPSyr^)$C<%xm5h4{
z(QCp*%i`Jt*g%t%J_k7PLd@c4QxQ%fR+FAQX|!+!7NzrahO!~9G-{k+fx2^DUc_L|
zv+`o!2^#SO<#iL(bI<mGjUgJ$>z{dR3MUKLldy}R_*Y-DBejCOwz5%SbtSli&RG>U
zRw@;>4lE`khYSu>MQ?3<FSr=kpowL0B;?BH$+W(0!WzaDCKDwB*VzsG^g0yCED?-N
zflo5&0Br?$V3z!CQ=gbs8GH94cof6Os#i)6u>T;P&2Me=uyI03@{E*2qs*EJ9%6w-
z(<E<S%wd{J-;QZL5Y9u6Mn+^8f29<PaBbXbYfP@O<;g7hd6BX|083vmki=DD%v7*T
zKlq0MBdc-6Lf3%Pt_4wIfOu<;hB__DL0@wN)@GALLX}jWJsq*ed8AhSq?u57>nV0Y
zo8p3{!|=cn9wfnYR;=$U6RBPi)Xf4Ek5Qp5#*>32REQ?RWy{6fvjI!#TK1X9%4#IU
z>nfXtY*xg)o%N%`4(@TUgRQ66^EdpRR2NQC*6X=EllLibxF5&`)*109E^o5#(mKV%
zt5-G3P}$%<1@Mk3w;cPh;f5=?X9k$ft{9MM1897CeVb`SioS@)Um;sGy;zrtIE)6J
z_EYq<<AZ=lTb(MoAO&lrek3FlQH6q|ehW_Hsb0{CYdj=F1-b$QSYDde{!%>P11kfl
zT@r;zZ7T>c45B-4x2cHFH1MM@0{h#D{CW%!&WQbyah{~W(6A$JX;(+!K<F9+-}MJx
zJ@|?V>{d-+ImEUnstzh9<oKA61e{f11W#D$O$Hes^LOc#V|&4iMr3}oAsjFwlMJmi
z3(sM2!RMO{!Cu%+*Eq{Yo`BxAo>JDKQn(3RF>dEg`c?|Tw`~=J0Zx)}`Rlo~P9#Hi
zm(#N`p#fc^9qa7N18v`fKYXH1@0g~`(imy5vc}d^6oKHkgF;6FWvi-{W>d7)El+G7
zr=w7B=4E+>s*qux%}_O_S=uk{<xL!(;GBl?J#^p{$OMTo<w3Bl6n5UvW@6z=)|!2G
zIM&1%%-iC=CnHNG)W|RTy<kdxO6jMOCs4y%?H<VuMy?J|P3f_=qm$$YTNZr~GUOBm
zmnF7z?{WZM;$Kx;8<-+fV>m8{s&UrE=E|Bmc`@0_XtG7|IU*(D5?&R%Buv(k!VW25
z>VO0F*}DSooNUH;evmB)yBRD{I`2|~`Z0oBSO_D?O)L&9oOL;Ff9rhTK09uA(A52}
z$E_b)$8Q_a=7$C$i4XflJb=w6is0bOck=hKbZn&uq%`-S2ceS}V<ujH4%5eiM!gmr
zN;<N6^~hd@MRmKZBD+&yXrhEDQWe{m24E<w4=8Z7NTYz}EPmVCMU3~9F`pkoRwB%P
z2q3J2TTGw`5K1G8l`e<k-aQiK7A3QCa!TCqx*yEw_mic|DRTNap7*bl{L>ng;TG8F
z&?0O-W%z$0=OB=gXjwJ5C-_Ui#R$L<lNDDjYlFc4NwiZh*p}g@2P#>FYAzuxShO}<
zgmI;tU=Lx9b?eSKF7>=q=-ET~9}pDG5`56*fQKJwa&!+QMd~VX$rCPU4r!H0&pRAE
zUL{a1vG*ZJFMaTP|KJ{rB8dWc3h)V*YRD3n-B#}5YnkeuWxa(fO$wL@W`tImD?uY3
zj$Vm~1v;B0`7~pj%Hl1jgtj~Rzd;`?KKO`|CqTlUX3nxiR)i-!HX&+~vO9CEqQpgz
z&wGgNzerG%SMx}kTBV4PtGcl7)2cw7;6nI<Kphz)KXcz~J*5rYtjP@OGMpdc5e}yz
z<7`M<K3GtLMXs~Mm9c63iQ{RQ-W|v&F@Q^mXpKe8n&EEesM9@aA6|4%PP;!ekDXw}
z#RBlQ+wS1+Xm@3yi}TZG(caQxKb*FYx@Q;X(IXdDV}?PJ5aE{L>LUPVQ;A{5R76cI
zVOY0?m$~RMSQ1wcf+TD>>U5R;<LsBvo|jg~7j_L&EBG;xyBs11sf9#ssHS%3;<+$T
zXeG~uK}BAZC9vHnNv7`#=L|PKcsIhL1lS!14e|yQ?3#5I5f4`bPC$C^O-@cqKze+~
ziRt9tZ*#EvrPFgn!Rt%|LAy8+)+6y10vKTZNhKvF+bFN7se4wIy?TntDEXvW=}9ck
z%GK33NUgu-td?m<S5Jd_TO!lqDthi798}1xJ?9-Pa?UzMdnQv~?Oi1vi*0a@Ft*_%
zkq2?kF;uNF8!`$boGLuxI_WWwq0V|ldb7(5)8zXRyb>pv2@6|G+CZuw+?CO!tbvhR
z30s@alK163b6&dAT{qY-eh>yrb!F7y8cxqNkE)*WCHH@~o~;O=Sc8@)@O%X*{wDNi
zFq1)rI5&c)&w~X`bN^FVaK(In8v-oM?jM2xS4`-RxUVpSRk&|0dA>zh2rYt~NIc*W
zS8A7}R8|;$0dOG(Yfc74IT=J|EaDKO;g9aRXsrzNtI*xr6q#KC<ArE+h|Ws5QG)-#
zqW>gVbQ%6z6Ze%3C`kG!9kXSsg@cA0uF(-!5M(1!ToBuMCZ3iKdI`U3g91-y=Ikhz
z2FWZLO1<alWI)f)li@S5I@N}hNyKgf<P|kj-p(4gUk|aXc4vxL!5!3yfdfV>C1<Ke
z7=)B>DsC1Vr@AiW=i`fL9bBCA8Lr)b77k?XdHqwfA)jfU|1UEpOE3D%d5Srl-N-}n
zT&>#it|!AvL<I#CFYFHGD1efP3W&d;Xk9l(X%jU~xcJd+!!c4G_y@mb%`sx807#&C
zO2+ZgI3eW{&>MI|=@=YCPKmy)hMZ9iIzp4_n4{VxTgIAAwAX}Z>ZHA*4y^V{<Jr2i
zWouOSd2>t$tO|-PxV@<ifg)I7YG$Ad*wU44H|Z%&?&S2M^_Z>4)!JxrHM%7~H`a!w
z^JtVHxv|J41t1x-WMiBCo0EzUD0*W|UW*a=g|ShRu|oQvb5;l#MXY;wX>ZQmW$&!8
zMGawm?qEOkzS`nu5U@Q6*)W;*!^ShqZCstUVP;FDXYi#YsUIwr&zETJ|6HW~cgI2o
z*M7!dOmF`T1h@Gq<_D;t>pII?cyG)Ws30zZR#+~)G!aKAw-q+?apcR<rM>cgkiNYX
zm)I!z%LK6Z$|ZlTZXQ1+67*+}^7RXQU6v_d@0CmUuF+-4b^t$SW$`61PN__VfL_=1
z<EU~)x1N3+RjMbn0C%Z76}&W-LtE~HTNP08>~#H?Ly~BG2`b#9@7|9~pdUc~UeR7e
z7T0XxN?pgpO>14osQ;RB2G7Yw7H(a1%*`8t=z^&PGod?+%rYoYnx=0x;f<X86jAxM
zxg8{xk)Qfl0t-UJlRgEp&!_3TMDhxlWU(WRPetLV^2m37JH{c^C?vyC53pL#Q>nf4
zb!v>7;M-s^tvT8QELOKXw;L&I(A#<{PE|Df1~y{yVtWzfCmCm(#Slg`S+!Q~CCGDS
z6Hy#e^hV14i+QJ}^vqT?3uTS<a2aWyBspb@7CkupSV)`w#VkjQU?<_}WPts+kIJ{2
z2j;LmV!pm#1?~=vds&s8pl`h_dpC|}@47=+LiYrCE)QR_%LAH^6umk0ov}Lq&&&4V
z_gFHN8r?K4OHj(O@{qE=%S%|`9Zq6Q(Z`U|v)1DdhZ{WFC2K1!rR(%erj9fL9oda;
z^Jt@REq_@=0d|laC7s(KixyPY&nYc8+KR^$N$f3&s4+C>WKi-;Fbm<v#qt+TpZvNS
znb03yTtg95U^AC^xI03tc4?$w7CwuCOZnh|1B6d8?=0Fnd|80NkQ55@W{i_s9csxr
z3He;mc9nKlGFII)8_X9^&}#!f<pZ(1Un*Fc7zaPr|K{frMfW#ALMfgQc1@foFNg>S
zvNT8hVX$>S{HHglFRFiqj=x`O>HSn%)guD+(y1u{vy8T|sNY4qk0q@Nq89)gwZ-5S
zRhx^@9SyZCmPIp-qj(<gYqlKsMWu^%AC_V6-aXwx5?~x?J!+Pfsdp8lmimXn_%BA6
z;!Z@$3*Yok3J?v}$b<`$k%=C$wT_pPM&5u{T{~|4&?1KaTc@=e!>c7>2*JDChs%fG
zH|yR-B`hA<pRj32)vC&({v8))=hq^Lk&Ow|LEg>Ws6hx&xkuUk9)&~DNkNqgPquwp
z%!jVd?+ILmyT1ffYui=aRq*HYl2ztIp9Ytm^}(`=BoBe>I?(#E5>723dhod}gmu;h
zFte&lI2<3qP$cpHE`%+UYJZL{eW~_u0c#Q+{SI*bve|k0KL^+@^!;|ocIN$`N=B^1
z1?sZ;fbh;hLe+X!FiEVH{dweWw;19UJ-dm`0n*f4{ewz2#|O-x!_ttStK}dry~t4c
zvm>?one5XiK>7-Z7Q%<b9|%Ib!!#KU@?savbK@f0h4bV?>q#_n9RGTIjQ4IwENp+z
zZC*iS@N1MS<@&&QRM69rdsI-eYUq%FZeFO<vUip1Q?L}Kh_G4(Q--keLF!`>)iFqY
z%+~-Zs_QI+Z8Hp~VhCK>vb@(u3*uE?j%5w28^)>*v>bQjF0<<2Iv89=DaiU~J|6{f
zziYq|&;y%MSjOs3D&eIE(KSVP_yhd>>J75eLNMf_?D)jGUX?XD36)z&(_FT9QrkOG
zz6masVDDR_T`%e#xm$5~EiCUU48)i6YRprGSyo{rqoN|TvBue_+kDm8f2pUwbZvV8
zKlt2`zWOFGhUblCW(xav1hOE6X}FWsc+D>TZv-ws!pbVxB0lDy2(;F@RsJO*iyb=t
zH$#;*N9qej&GD?_LHZ$@V^B34IYa`bm{`E19sPpSclv4?XV6$E_oDM@EJH4I9)BR=
z?u`G6TGr9ZnitCyr>2qxDJkyWa9S#)UMwUua#w8UAEv#bq`Zc+hvkpQNc>J=Tk_AY
z$3ZSL?HAP5qd1?x!3b;Fu$I#R+DCPX`~f>*NRXMP!Kqa1gajoQ=dI?e)sj6b=51U^
zJyFatr8F{(IoiyNSOx}9`C4oDW@!Via`^24%V$*t`G9?oJ7ZGPA)6jzsBBz%j^d*W
zOCWB}q9i}(I1~wRyBZ|X^Uy_??sT5UBROqUf?`vfoCB1W-3Hn~%_x=VXMkzpy)*n-
zx=rf%K3x#*T%5Is)r9fTVs8AOjRv`*n@o{K;<dPn=)C?hnPt3~(2ja%3rOBaD7;_F
z``~r@bfZDQ%3&D+TJcBOg0)()h47F~v9W@o+cK5cTALOR=MrH0Gwj(UyU`f1pRiXe
zba9AVDeuoL^;XUp2a4>wjBuf2M`W#ABsJ=#m1a?TO@`Zur22tYXjIw|eFg>Jrz`V3
zst3mWF1hWFlF7k=2Xkd5m_!dH_~dF0TRTv`8W`zqP}z1D)!MHX1$w<yY0AuvXIw@N
zaC0OzzTb%ofL7HEghOm_JY@}sps$P(C3$?4MYC$%7}^jR8N!~6MP|L`-Z-0Z>Z76*
zIvgcfhUXG7Iwp*|PZ{H3)J(nMgFSvgClP-?;@|AWO=rM_q7>kxhZxSC!?r`$SnumP
zEmRcS^+K<4Sp!YqH-aP00lK6NrD~vsk6lAjlMPYV&;(<WgAUWXfZ5?P0o?@u0&OGi
zBzBaIsI;(T){HFz-q1C*PpH;P9wI;sz_U&K$C1Y1$b$4554MsRmiJKCw8u@!i@=?3
zFZ5MNv2Z^ZFXyFq+Z_?74T!2sV%NE3Rws3A2^vCF*qMODTibSF6O9^z==dLs)hmql
z%9tp~oCMYKOyM2A0OWPG?>+(Cx4_&Hn|;*IOWG&mis99qYzZXjws6s2HMjiT@s5n`
z@&tqK*NXcS7z>PY{-Lb%q9L6$55ET>Ld*d0pKd+nK8XQ>hg=lDQHDL9^g#se!S8)1
zatO8HM3OUwZMY5TBw#lQFAB^QKJke<>BqEtHOqj(Da5X$E*z3Ymoj<pk(2ESU9voj
zD<IsHQG+H=*3j|=ug`{#8x8^)#1?4<xvufu!GSXm88lo`$zvO29BzggW7qp;+wK!J
zc0VUBPBR@7_iNV9V-U^8{JIRnJ{hV?@a=%be(6k<fXd*cesHJz{x<gud;EEp3qO5k
zyZbI8SQ>k{zx5QOrxb#GxT2q;UR7!ow5pU-oFK}bTj)?ikuIOhzxS`8xnC{hIGXAQ
z2c;YMUSA+~r?C>dAl!04o@Cs@5+7neVmPo*WZj1ZmK_PK?oyC@fd}%p!kt2u4|0O)
zv=L{M@boH5aQ14|0=l&-*Ae#Qs?Zf~>s>n0ZQ|%@qy+J<Am6#b9mMY`b6qZ9Wx2^p
z#U0B{T$JDmLih^FZG0w2oJp40VR2?y@3)THPqcoyV{wZ&KgxMU0<*5L*G(;s#4fa2
zMOu2Y9S3pXLyv;-2F<m2yoThor9#r>Uzf<2OOVIyH=^AF;F*QV@!G@VT9RxpX;NxX
zvz6yR1msmh;20B}Ek@)CCYjDLaykbJBJ`e)$8ZYJkLnh^ymB-vh6)r|5cw6!U#f9t
z=V+EcS&Vy7AESS0U_CPc&fnu4n^!b|yD05{TJuo-<e#cnr$?8^ttAS6vo~MzqVO7V
zdfS3C07CswzK`b$2wJ)uM#PSGNhl*j7dLS~G(HoOTFv+`QX;*0K2OHexfQ}w_6L#u
zy^m*Uw#e-+q~yT1epFz`8_?f0T!*S1E4ftgZ669WW}I(P%Dt&E@T(oFRtHG1$nK)#
zgQ?-!wjF{vOo{NImk=TzE(sfy`D!l2;~%E!EXjS5C8emxc<<;C`Pji%n^BuH;{sI2
zGXM>Q0^5qn3S#!VX9;8)NCo1w=S5HlK*&Y|j(19g9(tByuuohv70%8$li_%Za!QA?
zTk6-}vw_!WS-fa`ck{}$(`^VGsU=`T95G9*@vjy8uL)bChmlR$LjFw#8j6>7$@-59
z1RcH+d_8|}&wI<W{c{sNP=n61Uo8q+o%e%M$9rJ|5JW=5GcznCa41@z75xy`v_xBG
zQo=v11s<Ua&zK~fQ=-(}-^4~KAlhBx4H(eD22Zf3i&bRf4A1X0n9hQXyp|-hs9yR`
z>uxLma-AhdlYviO?Dok;VNf)%$z09bQaFH{X-Vf++?6y;N~ZbUHYCkIWkYbRpR^x;
zyX%Jh&%)-);TikB)llP^QC5M^I%{u2rheKMpzYHCrY%_O$jbHk$%{^x@uy*+k^(-2
zQJ5$82Dqe6p|+Q|DYSp6O<ONGS&i!rJ#K`=Dpd>*QP!U6i>0x9j%%_>*{HLJdh7c}
zERhdb`dJC+&AM&L^_*D4DeD?j7Ms<i*)rHWBI&|9hMGZ1D>kJ<dymguUd>M=xvoFM
zvi%@F$jQFJDQi~R9of|{+8%w5OsKxR-wMHy3Ufl7csZR$d1f+g^fC+_;~=2J+y01C
zkb4dgjVPJ-w?+1fX*0DeCE?h@w>&aBV8sw2rj(fW1>%EM2MQ^hR+#3ZimXKVaSPpZ
z2kQHGR>kDWD5MP;uFRaY@DVAyIjy$l-lh05ZOVqwpQZB@pvZ79oZp^V7fP&$+T80T
zp2AU|itz;|5~M@{*p4>JI$Mgfo=p-CdSjCPzDp9Q9HSN(IHK*SLpi!`5=n5Hk}f$k
zZXag*7|tCwAXfN|dGZqH2RN~L{4Svc6=Z9IisWb*BUT(F^MniYxzWt3+z@ulo!rFv
z9AgQMGUDzJ&n_vyB&Q%3PB72Y9xp$XfK{J!xHse;^TlY+hi5p-V#>_g<WrT+p1bp_
zNpj9jXtqlSy>~lLjQmdCLW3}6Qiv0zHS~-s!qU{Nn9w%Xj=Je&nAPr?qQGKl^?TZ)
zU`QS%^*<#;@LG)?)wu#NeWsQA=I+i;v=za>`|cR+;LU-6QiXAHKeIe9bfd#rrz5Pb
z{g`^Co-nJUzob^??Z1F#><<?WA7@v!<Kym8>)GXthN-<_Iy(63<3e|Yzw2=L7q)uv
z)%MQttFNM({Dr~S8%}>%5?;bT_-4a)<LsJlnuP-0sD>`3+hoJ8kT1j3T6%+M0vJEt
z3de-H8f85=FbzD!Q9dRc4V!os&kl+|@K`PED>Q9bObD$2>W)WvSgx+Qy5?QU$w(_5
zPl3Xf@F(^X%9Dba>=Xy{g2z%@rZP~W1?Rs*aSI9K$ZpgoCoz51lI^SQs6R>(cH-I9
zdzk2AK3xz1!fEa;hC@=T;BCTtvPr?V09VC1ii)A>T*I>D+#{f$*&O&-Opt;FL&<EM
zyH%T&FlwSuAbUQ%#$%o*8N!B)mqQlWLOzTZG0+RMbc%6imd5hiU)io3iB+0MDU`HN
z$(*~xbeJ`ws<$l6T52io4ZxKho2_3ijJI~i)=(Hh8<tU19Q6_nj|0<4j76mwS=Jkx
z^!KjT$BwYNJx|6pkA_&^^4Rt6_ieDlim*~3vQ_dZXZieSHz<13VHq>%d&^1YYLUni
zxr{}u%P4Wr_uP(cy&j8_hdXvjVHob(XOY#uW1qyd-nGv%zZu%zqCNcYx6@@_)fo?;
zXB-iq>6)*|Xhff9Tm@R&G1SC+!C`l87#GgQI*?Scq&8yZ9Ntw%H|GlOJxPG=v7$HA
z5qmgroFSuQ2pPs0J5sp_PyxmME4Un~x%Xs$lc|^~0qMD5t=EKOJfc#Ah<yr=OD6c)
zbc%Qg2wTE$oTi?;K_!kXE={>BDPg;;m0=Bk(fz@>hHWil9QzM*|0pbouT`tWvt|~Q
zJS|`g>`#;aK?A9-OLr^>(dF$3KfkmUDdVW_=pPgtI9DLwpjpX%;3l~*dCCMpoamnf
z8WgY`!GTP05!|zE+7M?AHmpVJujo|}*z)4Zx6alQGZ7y=M@NcMxHr}8I%9v8y+`5+
z!Gq#61_EO{#+xO8U1^tI4e1BS;tnKYb-=J3r*V{w$PBg|x31u?qMynmvZ`R|1iFQP
zEiD_KaNc(>dKv97>|-f}**aTOT=Oq!j-`<oBE@-wvcMGB$0bvCc4B{Nozi+bOY=|?
zloLL=!BB4OY2ujy*pTc)Aos70s@ohA@*|9|kU+;A+v!}mnB)VjU0!!5RTLp<^jc4?
zTLHIr2Hpu@6VXubSy6ru*zM;<Ixhp9JwXobYNKv@%WJOXfSg}i-=%xcqHSV;2I&CB
zaKm(x=GVrkg77#jSrJrDDPQ{}+Wl6{Hw;#8MBnW08Pz)gw`HOza`LxdM{M@wk8YE8
z>n7nl*rc6PaHc`KwPV}1Z5wZ_nb@{%+qUgwCbpA_ZQHhYzOVk1zxLs->gS;Q<mrR%
z>aM=my4F9(YUYvPo2;beEX^$P7cf*$_Q=b=g0mjjZ05{oD*UqhIqD*PqE<l9$1m5W
zSB_-o+0SYsvX)4<x!;-<3bx9OCG_91o-nj{(VfTgw)~L9wJP_(ALA-Wx)2?UPSj%u
zQF;2Q5s#UVCQn1t?FC=v)HI#(5BE}J5)}cw^EijV-!y^uGl$nKg*`TA*Ueca_?_dm
zr@^l0x}p6)2i*C`#Y3ydY^9I67@_NKPZz)$*3a(wOo_g7^J=LGQmN*tpj+j=9(Dv|
zMizd{W;e_80ZH%jw4>ePrS<baVj>%{eP@vGd}>PND#41r>o>QT2WEbE%>lP<188^q
zs7jTmnO_AhP>FEFbn?H_=Lx>J`8uK#cagxAoY1m*6lOfo6Dnp8@)iA<-4>}-8&wkz
zRl~!o4p*P?BF?*|57!vjEv>6D2CHvgl+x@;k?+i;V*7_6w(2knP+pN6eNsZbecUFa
zpQKg{mmcOra(6X>(T@HF)6xJ_BUVc)<wp|=Jc{F1icV4q{f>gXO+MJO=gPmw>z1dw
zewvvTPJiuR+{|Mz?$c>yo7+aZVaz$mv840Y(=G!L3YSOece!d9*;-TnI~Mi*p6UY7
zeVC4jIL?GSx%ALkPwF!_Sfd_m5p5PaNAg|i2RM)811)ytxd78lw4*mxcq<j@&AtV2
zwChnZzD56dW~SwN>HRi2{xLGK->!jU@sk6T>}Gpo5xQ}_9~VQn(^V8&HKDOnm^t)?
zM>JSKt=XG>S#JL+4gYBmpaO`-+#4g9VO!z+JHnAc5)RV{89AjIcE)ST&c`jAC!v)T
zafNS!ol26L;@*~O3Pa%CqAFi*6&weGix+iG-X#}jv*?3$AUOeo^$--gy-bY<6Bd?E
zNJtQgWg9R8J#0dUK`L4_p-Q<{EG7zi!9;VN(Z&%oKn<{QM`qxnsBEwT*|^5tuvpDS
zFJsBb54KTcOVfO=MD`9mGk-p?H@{^oYu@!Fv=-JuuSKFmM4tT{Jn(N{wUEW@pXi5n
zoh%ip*EWvAaZA<8JFgVsQlbS|z_tf=wX(kx0R4^Lesr%hK+kH91|LL<lWX4{i9Jjs
z#giiq%fu9yav#nKB_WK38sWM~{2OVS{}tk+QK+hz4rg%xC6ZH;(bZ5Dc$MrEZvGi-
zxZc`5AO^@S^L}Z4JQ%WNl&8{-T0F!+xU4G>PPVt%ZT2M}R?RUJ-m-(2S9c|aNbXqE
zrKU7jI;#5jC7Bd<RH8ec55YvASfuhr`D8uz+D|t9KhnP{2#RfSd6OohUQ~>Af&y&K
zKwO0DQ>c+5`%Sc=>d~}Fw=;?aD<XmBST-}4&oo)ZSOE&Ti{H0}i}h^ipITzUENwA>
zQTtd2ImavLTiVz1-oAt#&i!aM@H6>nsM47XS16aOO<JiLC3{;i0bqi!d2xZER8Jv~
zu6@%J49tSe6~+pGgjY~?2X`|z{MEs!nDP$8bCX+hrOIf4K^GTh&45lw86MYApS{B5
zCdY{!#{NwEst~TVQQxX6Qsf32<IIw15^mFq*gu*=BIlvFE&*m7`P+}SJebhw&ku^D
z>2oV`^vb-LQn!@9gqvh<mP~;2)WJW!*mNa|oc)u_{sQI8maQB=z%pe&N%JP+Yqha0
zx(pRNFpI63rIo80D5ef-#`!s`-!RJONMp-oJs;yI5snIdR^p@hQiLP@nzXU{WRPL*
zsk%C#&7vZFKx0+rbjkRaM4l{xLzED-;BG1jq8>-lrZi+)FU*lP9Z!&uyy#}Fq>>vW
zPk0ov3DVGdGZ3v>JqMCF_3cHSb^iBIXjj<955rTJmzKXKEUJo?dpD@O=dnT>gokM)
zBye#hUbbZFu*!BXO)w|5b+zFgSm_l?ny>vH$<f2_ZIc0&;ncYEjIfUgaKako&r+VL
zHnR;o6mPW7ZuC(~f4wVXOVkfnLEukn_pp)jxB*%e=XPl;fek|1ewnc3rPTAD(Ca`+
zpyq#cM1h4KabstYTLW<a2|v^oF+0L`4Q{BuP_|woR6O^n(jH9M`3%K#H}tgt)5Yd}
zgG-}p&_)Y|$moB#ztjjgy{0S~D;}w4KTr1MqsEmL74!2IShY3xk*@D0*dXiMvRRuf
z1kA8QVeOgRhpDE)b3`2Lh#rO5;$e*;ypz$s2|H)i%PP+oTc>uB4Z0Z%(7uJC8Qo-J
zky^uJKM*(X>ZU<vjd{+wir-WirhSJNn1||poW@NHo{5S~*JN*`5&S3_MW3=ayT77+
z@)vg3?RtiLI{dy&M?RzS>UumH-^(`Z+@8BXkFo@>`2!t0w)x)P)&<3R^Bmw(^1!!r
zlpe~&?U*wdQ<JrBzw{pN?NP~pGCLnqHNrJ}2re%#KHitMrml2Jd1O$F73BX~bF}LA
zl7AVm<)ssz*su;awt=EdN9QrvRH4RgkrHP0wv002m&{vW@J9p$W|0#P*Z`jyE>TFt
z!3}<*C4uYZknVs8oYBL{g%5(`Jefsl<b5uBQkU3@*Fer8q$A_U_q1X-^dj|gCboC<
z5!)tV&+vyUmo;4Y@DL?ZVZgA7vSUDIrrYB@X5$kjz8YbxDdXT$<C`dAaR*gk3i<po
zm)Ij1lX)}U^k0>E$Lqoql$9>I0NHir!$t#ucRfikZ@e{JRu%}QO%<Lf>Q@$P!bSrm
zh=bmWXTxzMvv7<*L(tbmhQjKpCw5{JP9+288h(;5hD!}x|06_1`3@_31zv?ID&!vU
zzx=%hQoI~*kk7$Fltw=KL2?Ww+_;2|B7egoEEK>T-M}5fA9|Qkw0i}oBcEI)LYQUE
z)gz2#?++u0;?)!<p8(~^8e9P_s+KzrCt3FNcQb;gY?@J*b6N}8TkwY~U*NOA6Pf!7
z#i%vAd%7BTe2K}(SeRBeB2jZMzre>GSVoC?d})@3S$3mev>K3!>uk8AbAK>W{<z$5
zuUdwhlPhtlW;SADj>yAhm#f{Vl>=B1;O6TVbGrtB+2m_cS%nm=3|WA_lZOrcnml>%
zc&K#oeL?Z%$ZLvQ#}xdPHocBXxw7eWQiq+xKFzommNqhZe{ym6anUGRv-=UdmNT$#
z`mS<rjynwW3HZ?=P+}?_o7}&&GHuQ;Q`R_T`*SXvEi5^7yk4{pZT4BmtsU14z-Fg@
zx<W-k1@S=){x2<}{o?;oi^xS3fHN~Hj@mJzs=v6y?(OHgYO((|TUhkk_j<T0{{B#m
z;Pr*03bm9U0ftudcnUp<jdA|)Az_V)8Pr^e+~vC(cwB!>$<h^dPr(2gYRuhfFC$V{
zpNlzVT$HpFwf_{gG-?35oogssx1OV#!&$f4$6|B!;ezVfJ$O1_+PCsj1v(DDwpRYh
zXG!omGu-E7U=1%+IFE4?P?j@3koNZt&+$CUPbLhN2&1TW@cE>hZHfPi6d@;DOyTYo
z2rBLJysV_R8U<QRc6N8UsH-;Sq5fKsfIO+{wMohPt7Kdga)RXRh#p{jxa2Q914R1q
z{DX8u@#(n%Ne{~ONc{a_1OpIjZiYX@;$5A<^ieKOIm@HOnzPhEE%$S&w2IOWnlPZH
zb+UWV@&wh+j>&;3fzTs!s^f2PoS(4p`JKgC*EZ$AQsM9cTnCFBecxc#duqg82Sz=A
z+J|^cHPl;cvywt9RM|48PmF*WE0;MWh~v(aLE;428v^9G1!BF>W$wa|{lu7<Z5o~%
z`T0W(){U~;awK&iRF}j8Vk6s#{D>hCa5lL2%dFSB|6TZPb{jS={qb#q{@K&=e7VI5
z{`P(TBeE9${uUKL3=oSJ6w}hOx9MO$RcS?<#@8&7T)Y0lmU{2`5MKNK|685HS{~>3
znd0LIt?cYRKDaxaEwnftHbk*QZ57w^;BKW~U{?5y=7cdHkx8Vd5oqYq>@d?f2hKwo
z<}?S?@-AYp3a<R$;$#*e$>nltQr;zNj+IzlBQ%3a3JIt*h|DN6rUfxO5ITKG*-9lb
zJoCwDxyQs;__rgH6seOtib+)H{Q@Y!_`(@PU$|+^{;~YrELAgTe#&39wEGJ9^Vwm*
zsRP=l+KvW&Q2&79sl7){LP(XeiYIHBpQoLNU?4d`s?|KeMy#oL3V+09>z^VhA}Hui
zOeln@3-4P78%mm%$I0iMD_m=*$GO634KVF$NZP909l@rW2Km{n`V*xHLULieqET?`
zDIb0r;gG<)rU*XlcvvZKcJVonFJr00jae|kGc_P4;N1$;M#eO`#R}9TeZrrXV^AvY
z25Jb$3Zu?X-+S*X8?-@@hCGD!3XJ_yi!^;QoR>wIp9%%m!f8HYH0OvAzR6I(ivKbk
z)<K&_l(@BQ1oYyvJc*kv<~wm}(2!$yoX`x953*4T%-(L`I6$Dso5NkjeiKNa*uTnV
z@TCUDRL9>52L?o&ypg%yLx?SQTdK7l1a4SJIMRf!e}d{&Xko=kHU?7LRrUx@w9gvX
zIIKbVb{_&%yu(xi&luB)6t}VG)j9dsLoGa3;t{1YeI}Iv7>6ir)Y~?3qo^1m^^g5u
zKM9a#(AjR?iuN(f)NAO_U%k$-Mpj;Od&f_b%pid-Gg>~4-)I2~I^8qk4_Ll+&Xjcw
zsDr_(6l-l9DL8Ios~qk?B*lE~rLZQV+SOf1)7Jx)(Oql<6|XYjfhpWo2)HPRX)S8n
z?HKssV8Bz$3k!y?k|K#~p$RdZ8iPk8MfTQvLuYaW*rky~AH#zRXTmvLwD(HI*wn+U
zUAXFza|!>*|1sw*3{MF5lsjID)jmM%xjD&CnlDm)M)y8#{9cN*Y}%w$c>3z<Zqi~L
z<6!@^7H-WrV#*%rc<&s`npFaTma?)*CZp~B{>ags;A*0bnw6|H+PUJJext5|k9f5I
zLv<}9XXA&YQ+)sCnoq3>VjDGq0X4u2`@1%1uYJVp+ZMvl@Q!uHc9LlnC7;yH=5P*&
z9CaQ?9tTt@c26ssIQ<uqn5mu<v~~}*-;BX8TY^6<obXizi#~YspOW5HNG0hjc{~(0
z6C0-1XLRf?c?*hFecR#W>@`$E_M(*kvUROk1e_$sh%6@I`xk}d$FuMDH)L5_r5Dz)
z_k}=Ql(N5ZqrZgY<`)oMx4I*|d|u3~c=Eb@=Jy4C-hPup_10}K!cG>uV&{-oOI117
z^;T`Rmq6AUD7a4UOirw$7OWUWV4gDcOo=~fFZYeUBTqLGORb%ydyz^W;3fUt#nbhE
zxhLt1f*j%wt)B~h86@RT0<%ko=mXU%)wq+GSTzvs1h!CsO8R^yA&9ZPRAe$no-@e)
zi$EMM97<yPV7nPQIJlr=jp<+M>h^q@h1f#4-Tm5XDVS$~re5ZNC%fx?)1I$W)RF41
z+z6j|J&56FZ#X6ufGzU+<2oW@m$Kj)#WjxwNs;2aYc9~u*7rIQMT;IjMLtc&*&P4{
z;?EAsCK}XV6N^#W0$wZnEsxdFGn6#0S3Mra{~VcB{|ziNwU?kTn=}eyqSq<UjzzOW
zq1na9e0j3>azOX{haWX?u?!Km%QQ}`zAzuS<JhofSxQX-$|=d5!VMCw5|toe_7`hl
zQ`1+Hm*mn3t8xmDkw?IMVZbmoy|-WSjH|-~KW=OB%r<>BRO*nY-`Ud`6%d?(3}88%
zt4f3Rliv$n$le+S?JghUat)$IeiXJ6FJsFaCaVe|<r1aUZrzZR)h=&(iI4q-R&d0Y
zfIEg{9HigY;(T1_@xuS*H7jt@%&1w%Gh5Wv`*xRjL(+h}MZqp_I%Nih%|`yja{0Fi
zX1F-p9!`JXAGmshuDj_=w~%e%4(-6d`|@3lqJ;vp8*k4el%S;%;mXHD>UL7!&{X$^
zQ6WmJ&pw;Ym(0*u(b6r3R0T=Zfqz_a)h#ttmq}&n7|7fdtdr%6q!XI)PV3w?(`4Ug
zD)%o@vvGUAI?LFe<1<zTuly`CTFdvt1A1W=AMSXCaf4KY0^Cs9?nM8Jf9c{Bc`^v}
zH1h}pL&zw%>`Ru1!X)PeQRL0(ZJ#8UEiDS`rUe@(P@x#P>QPDP9IN?sewxUUof8P|
z*a}ksO&x3}A@=(GYC&>O@+ZaJ-3=OY3)AvXj^M)zMRO$Hr;}grLM|{itF=3yNu0BF
zI2i$%W|#|SH8I6(0En~9-kOy5>{bn5tp6uYi6z%{<dE$3NmTqjJk6$q9#*`6T{hOR
zUshRY>y6n-b>VGae#}w%g2<>uQ!ZFlt_ikLB@c2XLhis42yDVVhz5NO{MUI$%hHj+
z{@56j8914QKkIv9x#B+v+4#_8>F#uS?r(AFCcC}WUiPyk<9=OvYd)`Ja%@JpNB{ib
z74IPHy=tatp1e{gi5hcZR5hTs6Dh&mBeWKy9X#!C2<lzkUa;dx^jIy*bjhxdFF^)g
z%uV^KN1t;l5dzCH`CBDts1r7MX9(?{Yos2hLS~(U5{Qo}iF-XOPY73e7MXBLyUo(K
zBC=Ef;8w+bu4ew2En~BN=W@xIC|#EaO(Hgu-Acet>9dPR?RrqOgC3s0`|0D4!3Pd&
zJg}_(#tA72ayd2HSTii&lOY@Lty|En!`2>{Pz9RV{imUzfY7ErmwDMe5qTrD`I3Dy
zCc@){x7aR5p;+ONd_<lzl}w1TG~i@=G!f2yyT+FapG0^}6;PmQALG@e+eab^A9pfh
zhR3-+2w9iT-AvO$GyN#H^U=BaEG5L(^R8t6GH57P7S4mTQ@{u-NS2~P=~?0xyx@?z
zcYGwGvlJYqM<SIa&)MCUuaQqI-W*_++CgH5$XR@M310^^VqRfki+dh2Bw~bvxy3PH
z&5X_TDp~_X5<D)SA3V(I7c1V{w*)C%GTFd^ZiWN^JJSr~hAwFmDuSwA@{CB7)~a8)
z&Z^&UZi`yIG_zH@n7UfZW-~|)tDau65~(tvmnEuff|=F>6}9+Vu##FKY2yS%-hOmc
zM7~|kOCQf!k>`LFlnqt-C+WI3M3G_G)s)ZG*@{+{Qdp&klh^{jZraf5>2j6ML+>*c
z{x00;#}hxfel*I~!j8ZVYWRoCgi==kc+BL=h{^8quf-$Rt}09?n@e2-uA2lrYz4I2
zrkk!hZt$h`Y)^Az2xqCWZ}J0%THPHj%j!7As$xWJ^Gu01mY#+a(j@Se0RrQxl<Xa$
z=*Y3`QDR5QuV~I&`aiKHVmuLh{#e+hv;T&f6L0$?oGA7Q#Qw^DguM%<TzoTafEVsg
zn}fFYf18=P9V^X#A7^dWeb;}#OL)VDNDkKvHcs(g&L^4guU~du+HrP6bzlCMIU%r9
zdUbK>{a$By`ZhxOK%L{4Xl%$)boq6BX7u{H{b~AR1H_p6Zn=4hyZ?@R3I6<c?fD!i
zeMZdM614XGu0Q>M9T#iQAudzVeMnob(#|O8{6OJ<+}GFO!0AU|2arDStL#%qIWfqS
zo6eZ?0do9Y|1hWm!cY|)@W|(w6Pav?3>cWek>^+%n2GBcT&HPBy@Mo&yN#KV7fY;T
zbx=Sf1)x&;KWt^36Usv}fN0gn?jr+H>vVc&s&VqYZca2Fm@NBgj;y2E4v{iB6j5=5
z!V`b<RKerJ@~J=#?OQV=cM6DmbgQGuRLkM1Z`S8w%kC;JAJXN#5sNcLPoNQwJ#kn0
z$DOCwnpm}5L7MU9h>co@y7hrj_$DQ^vF~WhONL>sQ$Qb*5s;*;uep#QXK4GO-BIRl
z7{WDtQH`VewYo6FUyPVLJ9nkOz7mSCvo%LSb7LqZzDjX;aE!fOTT<a#2Oqzi9^2p>
z6|yU6Vs6e~cb()_y-|zDx~}C;a3M~_5~jT(tsh*5K1sd_%w{!q+PTpFhJq_?tx7>1
ze6_i3Pl%+6y!wd@(6>J8Z1<sDTboPlupK>{ecOGl3~R5{9>Q=&fs>6GQ<&o`sEwD;
z)j7wLPA~BV#$}UvZ(=DWM%y2or2?de6)#jdM;1@vc!f0V?H`9kp)Yzuai)rB;YMW9
zFI*b^nlu!S^2lKd0nh#?<Bas_bF9{1lDv*gA7gjCoNU}n(^X~;Gce4;-I#}HH%oG4
znc8p3i|jiZ5_rK4QRqEf3{!d08;fgumjC)lmo<&Ntnd0baN#oen}k-73o!fz<wEN3
zExDQHEySw>^WbHG!uY#kpKNMYc1TQMz}?B3coI8zwt{5Xqm=@I!Y?O+molUtLknDn
zMHXf|4Bn2Q+nSKj<tKf3z%M82%Bl4{p?()o#(XqUpAa`W?5M4T^^ev&QEu+5<j3iu
zZ`6x0P3<--;NiR0^>SOi2tIa<2Sw<)NASd`WABjblrR5$IFB-84R9rqNW&C#MfCe&
zC8ykg!mm%JM!)v`Nf74A+FojQ)j`_@wsWub<qpwnIl_>5Wh<ecFm^?i$ByVz%4y<N
z?{<AW>G&7=D~4bnk%%q85N?D&rZA@NZUosB*Y^?b+Wc7c$a#Byy~g^lxSFf@#R3%x
z+HC&Mu3vO@d+H7y8WD8i{3)KWP=xPT+hR%)s8g`c`e;QLiV<)*WAY#Rur{U%I5n5a
zh8SRr+bQ-Y8bxb?Rc++s-22<ha#UALXmLiW7UDn}w$uGmGoW?my~m6r;~s?qm$H16
zg-Q-ZmHS)fF<L_*BvMrhYK3Ux*ga22+W+1d{3Ngg&crFQLu2ojzpK9lKr&<OVcoDQ
z?Chu#Y7t9P{NRKC6&W;hvEjohZL6|N9<QhZU#A*vpXU~`RdR-L=WGiRo_=t%ws%mv
zNt8WXsv%;RLk@zI&4h)ssz$Gr4L>mMG}7&VrnkCmJ@ZcI;}E!#vN>uQ>V<YAD4|(l
z=by*ui>rizKmqMKSKtmi8RAWXGtQOyr$B_Xzt9>uTMN{cs-Xh>MpI?HMaOcrRfHoM
zH?yc;SE~T3g(PJjV7r$LcfLR{qCM&R&P!22-Ce~qoRxCyJ}>w$t01ZKl;Ci3P9t@K
z%a|yN^vL;4IwHaYaspuq!^GdPm~yU(W-K)vaRQErdhWIW+KxdE^OXC_(hs`!2*o9<
zd?#GahMDV&D!2XAokq%5d_~5>(FnSD`bL30Y1aQe$Ncn-U!x9E<??<gpkQ#|8b2`d
z-52K)Y)al@1rfo$ddOM1ZpdRW8}1ly)1>VJO1c+ne4v3r=LMs}_RfXjknf@Ubl*{{
zIC_pVL^+;CU~9{n=`Y$1GOO>0tPi>Fsww;9t%9JGc;+4vp(dR~!&J!ywr(CI!kvm0
zY@W1Zl|lkwm6ZKAIB0AvJDIF6S9}udcAzz^BZaknxG93si2`bweo(eW$q{Lbmx;4$
z+|3F<qR*yLr^_@E9VSeavqGDc<*ZfwI_u=B+*jU`@8>P`h+jV>vx(i8HU|;yeoyLS
zkKT8|_veT=l}l&CJ{I(uc__3d#Tgh8Gjt=+E}{P6s9lK8#mulD#&gW@%sbRCBl>Ns
zj=RYRDO2mi!9rH7az7}?DcrTk&`?mUk}eIt0WpPsc`Yk<oSc%1RvKQEgN$_=%#jR*
zGAY@uU`g!+&+^a0*Ncab!rj7EU>bjkHsgBc->#%+y$9w3Jbg9OFRvtc0anNBf`R8>
z1vTHITHj&KUx+rJglliSkjo|=Q>Kuq_l56&*IfcHQgykdeYs8s9$->FN<s7*n{0o@
zSr$F$u(a3g#=W^s#9WHS6=|kn|DnMAY_Xj?as4kQiou&Zl>f~29KI0H9tGXTOst|g
z(7CZT$(CFEx%Twr%AdG2bs|+k{BkGSu+HZ<TVbxuV)9~y^4nJ^q_TJ)$&e}mOZeN;
z`|9y>ZSj4`C+pq8cQM@l<eM~f3q23z(=Ww1UGU^y!>=~_`|V_UJNcrg=gajN@$H-N
zwxa&qJJ|SeIp%~T=OcTock@lG=hIJ2(pJsHt5>>i?-g&e6G*3cz~BMwB=+^&Ek(9A
zG5gF0lGeAODRi@9{{5+k2L3%mYDJ+;Uyu;^{q<yd8qn=)d-mvrT<14a+k<!+3D0l!
zDctd8HCGFFQ<KtIRU(`sFHG{VO99Cj&HV*wnkL5f5E~Rvv=<XQ_e@h7uuQ7N?@Moi
za(_w16YDh^PRgqoU4}<0tn>TuFIiab7YPc(kBMzQXPAM1^ROrH&nCWwo0&xiVvXJb
zmGC6m>yeQ@gGc}&lvI_Lkzw9%vRsWqM?N^O@B&7>33+ko+fB;~Yk!_ZIhz!_MCZi9
zH&?N8^m&QBA?}DL4o<>LarXQ#0w1ko_oSJneX91{>9W`TFvL33+XtS@<MLL3&44~H
zHXXs&HeWz<(yHjm7tdACcuU>!{%p@Gw1Ah3$UH`k8IN${MrMCW=}wE@vg}J6V$sB?
zr33Gn@^eA^?<tOg7(TE2RJvUO@82)^4i=5~yGpx3akSPx+0#>DImch$#ceq`$J3kN
zOSZO<GDi4cu#di*h_W&{b_oHeHw&(~v$~`pl~+G0AJ6N0;(8_+JD|w{?6iZS?IC3?
zFUbT(8EcS0N-xKwsOB%{Esvhgh#1#a5q$oKRxRp#9Ev0x|48ZY$}5rU#99;h>Hn%N
zhO7OI)ncsHSPs%6+ZszmT`05frR0+ovVZEsTspc+p_~<wGLrJao?6<-mtrvt1xmon
z<3KknRs3l9{FR>u@-Tbh_oe(^9(%4o-nUxfQt>N<fAJ`X6mh(4duHR@sS|GACSUgM
zYWmD%yTIXb9osxSP*<+W#6!fX32C<d%%g-!kKyOnr>C@OP@I3!5R+wsaWx_n#>o3)
zyo<!UEB-Sxf&RFs7r3Nssqk#f(GR2~hFqhay0s`WQRy&Wu`Ddg0^Wh^nDQHln6aBG
zBYS6uoC9kovHEZdNKdzxDIP|G@As*xo@;?fg1b5izpru5o6pAkLYKFf^Ua(b9ZLNT
ztH&XKVU%?mJ|-r$`}45g=_zKhrGJ@ZD+#vz_#>^JGuF>94+r279h;14Qk1$GPZ6UX
zxaOrEyN!Fv^)dR;*84w|y%MYSep&qpsN2dkju+hyXkz$3;C&o(uOI^+XQ)EpA40#a
z44~o^QRmiK$?7;9s;2-1zs|07vwu5xRe{r5++#`7;l@G5=uu(6^Z|!md>&$+(Rsq?
zoBH;S<1d5ZakXRCG`Jqy)!ff#f{H0_`I)4a>AJzWI|rl4)2cEON0xBqZASXo!Zfaj
zLFEtrMB>r05R8_>7H%a^WcKrEBlRP%xhe3?I8c`J<}YG9mp6BN>;=kNxVDyRDMVbb
zBcOdmV<s;xGTXRj()*XLAJ3B*cZj-{s_>C+Rp(*EY4}8>q*yfu`<M+7x0~aq!?+%3
zg(NJ`5_K_c{lcE6i5x~h>4WpB;$poj@@F3_q5B8i3v?+WU^?(1N;2zon{4k5;863&
z7a6AyO1&851lGCU;|Au7K0HJCrKvj@1QiGMcan1>^aE_A!=O4C!>Fl)B+;^Q*Psqt
zyF$|A<L7Qj{3|eRvI{#yqn~iUoZRT?woI#b7hx$jQ9=R~M&bD}YD%xW``)_>s(H)=
zDke|$t+q%&y0SJFopWR^YM@SNU}S2do5M^hni@K3rOCm2^`aB4bHWL{T8N6Uo;Q_!
zg*SNFXMs@Un${lbss1s!4hN@(T)`#pV2Gm#;3G3gD{y_JT-+<H2+ybDa>tg0umz;+
z`wqeUuC-5psQ;&vFz!d+ChO4QpWO^>m8_IhVS3c1Gsvku3zuuOA=;23i$GcM=SsiT
zoQF-sh&n>}O5V0NiCTOjY-(dE-rBoSB5AsAo>)t}N)IRG-`sE$_fW_WH|Eh+sXH*r
z7Ni;!o@+P$kXNe%$i{wYwi8dtC0dHH6swm{ypO963dVjf0NRim@aca0k4c?A-mD0G
ztupgyB4x6-fYLIHishN1*$S6G+_Ez_Yxe31;gydbKpJFqezS3L<6G}Q233WdwnV6p
z_txQB@UMUi7?H;vqBTq=lXFIOwp%dl*ZW*wr4&~eU6&<R6f#IB>(Q%@Et+tZcJwtW
z0mLI7fq)*q8-ZWBk!C~+zM&T8Dl^@k1K%@m^JaRL)%`$CRCUi_o&d?G{kZN_6H+5T
zR3FqY39luK0Nfksy>^S{35!)8fdahBqHN60RTs!pf>X$VB6WhjE3Lef+AIzk+3Xr6
zqG1_!XLnj6Z8t0G@-)tgO_g>jex$U^!Sly)8m4v$d*!-T5mBZS(PjQna;&+?40=KE
z!wT@eZ7qu03jQdpadbIn<_+;@(Hb!ucD8`#<4ECHdfuTDsL^)3$T!`_dtwG}|3>KW
zUYHb+UxS8fgn}fnm^2Y;c9-jQ0YLWZ9h2tMj~etI&<R|432cq;L~AuL@O?wR0b9?o
z)6J18Dof6Yu{!qHG$YuCa+11DmYjCqi*EM}RgHRG8O1~DT^ZUF+p@l@Te7|*ULKg~
zT1{zJ6uD%li!O{=hrqJ+r#j)K#*N&wb?rb$eM|FX6bkQhGAq1{c8TPSQW)y5sV2cP
z+pcL(lj5pz`X02}gLXsYdT2wNv~*Gf7goCu$*@-oYMc?E=3-h_jicnt7D*W4QMKm3
zrGGtFX_kO%RjE+7xfX3cV)oJZ_`X|RYyElAr0w#(x4msz+6a8}9RE$Dw`;BT_j|%q
zko@!YnC)BJ_PgzUvc=0w{JYMM;PUFz;QKZ1g->~;;`iFK$S<rWaoRTg&v!yw3BOkS
z&t2Dtu+yWT&Uamwt#2t&fj@aIvsk&$+=x908vDcc9Pv9X{@2T%%lqK%Z;%V-X+V(X
z#>rw4&MBSPlv0^mkS2XCrzQU#v0)x=V=NDpPobzRa5d&MTkc^ZY>reRpL&!jM-a*^
zg&ES3SMr^bJr~&24O7l^^g@WV83&i9Tw%4f>DaM}mI8TiSj-XdG|Ga?ZazZcyxI3`
zhz|dd+|>`BA&X@O834$fo=DPQx%gc?18RgShK%_7#VgRmhK)|Xvt{0VViZ16&LK|;
z8x0SJ$sYM^U_(`rVTrPbOum{9`juQ=HZsjfdM5i<fZC3pS0Gl<9<T9=4Y$N+C%8y$
zvZvd!3#9y7K+v}PL<E!p7GWT4mZ$-iQJ3r<w$*bjNsX^s^K&$*XCVMO)NS+WKM8H3
z_pO0aobY|#9bqG7VcW}mrP^W!tKHC0QXU56qVXCc>~<!G&_!Lt*HrpD0AF~{Vf~<s
z5a3|5<I$V=N+KqBl=pnqV@YEtV=lS=W<v!%$#h|w$O6}+bjYDo?Ym2ZM&+rdkX5_v
z2Xa0Fm_o9hsH2G=zlWlP^cn5MpyV?FUbKNomSE3Oys+c5ftV^urGB5_$>)-op)DMw
z3C{F!b)4Z&nr@R!NgmeTNXuVq$VN+VMIPmXqa6H)gn`N3g_U1z>Z0-qe<+<dU-<F`
znLg6}FmAy5&|S88&T?CF33GLGwJ#urcjL=2tmX_dz-O6`#4x6ff~aLDrZMFL3=4xx
zLm;SjlJHh5q`+`UEm(%aor5+e6^=+U?q5np?Tm-CIR~hD7<nSXy*27uW*WilqjpN5
zy5vycxRnPW>J2~VG4mf`uBMzCAmApxI!7@ECT3*9;KVUeOZO7!Q%DxVr9x>SnI-P(
z{kqaSlUDN9ppimH&DAwqms-={{6V_z&s27;y_Nik1j#DdWzRjC-eo?4*=~daru{H&
z5-GGCl^6d)0wDC2dNy-XFoEjab`k#75niZjgM6cyXQW-?NGnpYOq81u%o3mx{(2H}
zU*SHpr|Rrk$(T#LsY?2dmz<)RB<aHJ4Qf-MdHUsdxpC}Cagpofu@AXaDcDsb)fJkX
z_PI!(dW0x<IJ&{sG;c3V;mu0V8v_UVq*y8{H^^0LJ$hgt07(tRk49fF!{#smv9-TK
zKe;TQ<(!?+_cuTrZ;cpS9yg-2uBX(wXjvmyR(6HPm9DM5ziJv+fWs+irL*5Y-Gspz
z*zx7YfTu+Xyyr8MrJuA)AmYzJ9*RJQ?%w#}eXy|S%5JTCfc5(fH-|f3PONl$5BbVJ
zNXp<e`@=na{c~vWpmOA;TPEdpVvF?({=cY!ZLJYz)JrkKx%aC!^%*W0Qt^Bw#lRn3
z^cyU(IP4=vN6{93T~Ss7w3BU}Ie9$0e#r6V8~G&4%KC^TAV$qpg??1C9~=@#91*eX
z?xwPXa7msb64Ii{cU;5h!ZEPbt=$w4!m8;Me80T@b?pQuS(}Lz4011&NmWX4k2sxX
zitun3*EDX0drAo|kzGjxAIz#y3=e0%BMJqzKLq{ik_jI?T)5G#1ZUO^P3%?5LtTs#
zYb#E!wR(HW!eS!aa7En37)ULT+Zc<gmvW?AF#e+=35mZg`HAptP%AU#l(`J^-j7V-
zd<(-CS(MA5drkiPnsK=dNM1fg6JRhLwd7Hz8~yTW{~I-9ouGs}wf6{K{(%WOn4$Mv
z^q1{gPzssdzyc(iY~<CUFB2mojA=wGMCZ1G!`}1N=#`*DgkMgqha5frOQn8VQPr(`
zi%X|nd1}@$5$PGNa(N)!4TPoa(xv<357=czb4`WZQjG5yE^15-HNnQjKl`t&6itS-
zy?PmQ+wDkHg9bZ8D<smkzR?TeG#}azFV{Zw!-Ido--eav_c>uc&yJ^liqcvXrTPl=
zc+0TBaU^b`y4@wH7GH_*lvPgO9rkv`_Yw7eGrCf#Nk2v8U#><fm`>&a5Qq!3?iz#J
zJn>2z&A5c7$9ihh5(=`hf>i9bQnGx)Qne^-GdszxG9RlXg+M)m;WgM#zN}CGPv0Z(
z?XGe1QITOAG52Lypo(2OISNpH-B*hB{;X)*a&9y^N0i+i@DON2N+GJE>M+o<zo{mv
zvB(X;=z;i#HnL`YXsm3qkwxbh6vX#>Xde@a-prXvcV=Mmk!Uy05YO<Z#D%{_dql(5
z5;{BzS4T1KPXkXLy+xSu!+<!c5!1Ns^Co((<(_<#<=F3Qq)uWu4;u*c2=h1?%d^s^
zf|{CN!c&)04%=IDIe|7ENJiuLLEuI?q9n@FrkP-Pc3xujbt1<Gs}J<!+%Q13IIW}4
zJ%f1f-d-4Z1VknleLP+(J?_-~*cln+&w*hUi@NJQ(%yJ9Wq-(zKw9usC>@%Etof9R
z>1A|DQnI!gC0598@j!$6&M5&CbF`5#7m8Y#x|MtGV98OZQvId~#?FB(+RO#>PVm&7
z{iFG3<zZ33$q=R9(+>dnP&+E-aSw=tYtXu;_D6i<qAw1Y>@hd&$Z$IM;$95Sj-*qq
z#SYqZzhx2?FL~;rP!VTd!J&)L7O7^zJ&FMPEz8+3&W<aqUoMkv?(hpB2z1a0gmojA
zx0}&w)GWV0Wa?%dJ0^UT+3=0Iua*Sj5t?uN@Ff%bG7tU<Ng)%A`Z`c#hLd3r0|C3z
z*=9G#EVGJHuWdhtvc?ibKj+NF_PpWb{MXrEj-Phgx;x~z<TiT*1u*lygD?C`N6SxF
zGw#sgG>fGH?6PS2acuH_<3)!TuhbFrsl`)+Wl6mGE`fI~!Qhj)QO&y$XBGWuciF%W
zSd$Vd!Xt91k01)(Hpag0%is^pGf&*GCo&(^=dFnv)_+vgtHm+#VwnyCl{*!0%!nKz
z{7|>Ub}+W+_B03jR&*Y^nTfoAUa@kfv=Ym+Yxu^{9gJ%XCcO7&crem^4x>JKFzS9x
z_8$z3k3%O491=WY`}RJ_8`~ND4qd-@h`BuV?s*#Y8(|$C`1Ce&MDQC92snBmS(_Mb
z!|thrzWA?0c9`c}id-%F8lAi*;fXs4{@4P0T4nai0Yp1E9h~Z30LXOz8Rq8$+_U7a
zOHAzIF+sO$lZ<A#;mi~_jRI<_-Tq*d!yJ5csZduvb<vUi<Drbu{Wle3;>p{b?>f>w
zfxrJ`UfXyN7UDTnJ0Qh)*x!}inWY~o&`u=R()tg#uV9_FpnQ`Y=Vy0@d!Ejb_@g-Q
zuz&o~i0gz#WB4Yr05zLve)-e+6~d8<O59En{<@@&0_lLUB<67ZwW%iQkj7fYC#2OD
zRc5}N!9uif+=>xsxXCH%+kJ)eUBi|=-SiJlp<nC#hK2X}L=f@h({@~>yI**RmhG4^
zG0X>cTzR;WfsNXB(^Hz2$z6rf!b5X7>xqNr!EAf|ai%@Do+BC*p7USf&hh2_l(?ET
zOboZA@P3U80iQa_5Pf<sShQ>;%7)=u{|L>tQc@A0^vFKA#)+4q9VMf7`Et~e_<Q|d
zHADvAiJxN5+(nh~p!FsD7yuKCd?F-W54LwNgSTb{$Z&5HcCdaNib?m(gr8_aMu1_v
zM#E=2M7Itlr+5#%ts2Dev%jXX`ej?z1JZ=C%Af3MpX5$MHDEMq<glpK8AD8!pCPYI
zh+Le&pt#@;YZzmwy$2&f89hLe$G_O(*3-F<GO|vwlr63khT#Ss_v7#00=G$XGv33K
zqOsBSz6Op0nPQMxty@ZdHoDV}WIp*EDM)@pc2-E<z>s9|o^d#*{LwOY4%V2~@RDFu
zM&ue3E;B*RNq3*?=0xIV*5muiigW5DYoQc-R>6F;oc|HRGo-tsk@N~4w;fN03(1uc
z9Q9KuK?zsQq_1d%2S#(d#0~M<=bxi&u{W$1=tBpr9Sgpk?ZlUD=GO^Dzmmj1jEIGM
z4zZ9y_r^T!HU`dA=$-6hHm*U1IMoRg8(FpS;!`EVZWE1jovi<+W57^mOj$X3aQ*_!
zxgxJ7XQ65f1JC?Rvb>6v=+%(bb?qcauL}pRPM>FuUgmiO-P#YOlpn1znk((pio@5S
zrRxA1XAOXq;8|{<6l0(DkuT$d-cQHx@*UD4-4uKHGA)P9lEFE0OeK=%Q$jxF-e_hF
z)PC3Fa-(Wsn_ne?`PkQ#`ckIpV3Cgg4gC=@z*v`)quogU&ax3L%!3zKQ)=$Drw{d+
z+m)&}A<lL-Y(wp-_wL8ToxKRiQ_M>txB6ljMlHclS?+I=o%qL2-HQ$8vcnz8+TMHV
zIS1AHMY?QmtvQYSyX6FqcI`hDWj2?*Ub+4X=eE%opX}J=;K*D+cklD=mAulZ-6X8T
z$m~5*hCc#>r9Z9s0Z)esCLRKc`ii1@tTl%|uAwXn-TFSx-c7O=OW9s>&6@%iG2agO
z-F)V$`unq*c`LogwuYR>uhDoKlfcwV_Xk_CX_98nELnJNY4q84rPJ&bAHxTdW~5R3
z^e5z5OW5vAuwLuFwsEeYDk(*JQ_41%DJRF--%Fm($xKqZg1|8+g`M&<iBK!04uu$}
z_0FK<v@?!7Cdm;>ZAV)3yF|f#R?A4p=wq#uja;1d>mC&x>p@(wR;r<Dz_ImB2)UDc
zKX=%ms(wVc7jkQXk$W60nzAd&B<IY_S07b}qgy5i{|5ao-50q~+OENqIgk4Cgf5dL
zQ{p&Iutw-a&gy%dIhd2&P<PPCU$$M@H3d17ohIVm9BNc6N6LSb=P|e9JP;QWsoj#V
z7Ya;}BZFt>%{d#f@T5>+qAX%HJRM|rScTVod8`WiSa*x%XR_pz66bX93L=l6#A5s%
zQO@Vh?ZVvT7bXrH{9*LYu4W0iKMG1HwS0f|P}mYuQZ22oZiN{7wn#t-dL|8sBTVBy
z4=xS1Xp(5#(c?kkTrk-$tw#>usAEQpH`5!bXv0sTDfo(klTrdcmgL7yj%<E=o+1UG
z-pq)Q9@9-<qu!xQZto8Tnd1G2NdZ?O*=*k2<nEj@34|a0hXwF23^*1*AQ}<XvStb=
z*fVQ8@k1iqUo{8c0=sOg1}>RiO)b}XKHR)${TVF}nQXg3WeaRCvR4xnCa!yLi$YFI
zeuit?cxPc+p77fr$EKkipb})uE8*RH=qO!OnEi?#R!<bi(iU_cm1GZ58;-d|it+Jc
zF~?Ho+aGT+|K;bD143Q4P|`LB&tt8i?7N>K#Koa(>9s%85zY~lK2*fWhl$xLeW3WZ
zfYQ7Y_l}l|c=ajLxY1Odpp%&kRc*YH#4CcUX?8!31a^rvq&PFzyIZe4;7^mDKw$3v
zC7<QL;F!hR?YQ2~-`*@CYZf;njqRF=?P1iCO>ZKjJ!Zv!HE1R`@#PB=R+uepz{B(y
z(5j9FW0M-az?xL6H_#fNfaJWDHI($##EMfH$%d(;yg_L_feuio$}OZ_Q*@!)rAQ4*
z2Og6)rKn0Plz3l~-Fu<BM57ngiyuECGRVZ8CoI359n8$T2P{U5qi^0M9RRlMzmWT|
zQ%S-lPS8AXC-<`GZO$m=EkNS=O%0(h<3cY!&sH#W$ej?XOUW!&s;N#pT-S+NmUee2
z$EN{DkrD?7siVHg)77*bOcbthvQ)kw(STa&&7v-dC=_WmOxc<IfW!#AMt>+E`kS$a
zf|7#Q>JqE!r3&JjteCQJt7Fa#Kj(l<`3TL+xUwc5N2V8k+?bsaBBd+5PqCSiX#c@q
zo*1gKAJ7G;XzI<kn)=^b05Hx7E+uYQ^=1FcP-})CdEiYHc>b)0EvV+mr<>*c>N0fZ
zKqlyuuxl6@l4!53blCH5f1kWGkfrR|no;yfEQ?b9eA0;QUq{`Ufq6AEp%|CECWXvn
zL7ew#b&v#WWTT-VDW~SU6qa>7SfP)Gz?wzZJigTmwPfxeJZ>pUhf9LtU9wL8Si-eW
zEH8N(y=t3j++k*8RMnxa18FS}cNaMbH$Tm7)@D~vr_IiCuJ>j%b<2q<BjY~`!vpz3
zf=^y~O4T3IJLj;i=TLlsuq?7yI*I8>RV&eQ6#o|WRMq0^uQ}esKSs<^edy}0SeOc(
z4>2K;FXe1!xtwRY3v|)#$1&|K#tU7&<z7?eUZx9Oi42R;?P_@J9cf#zy+%X=&4q|-
z*Cs~fNCXP_$z$sZ2C5ORMW^{I8NLFgd9kHt(GCr><mgOkr!{>sXbWV@sSorl($)^+
zb_y1^w+j+Exv2efq-vP4YKABpbV3q6Xa7>=EoU?REb<(RmZ5eN>k)@E2SzUUiPT+J
zUJjn|IRcUp+8^&p2+$d676Yh4LftaDS<4AMAfU~~IN>Qp{9zA#A{(b>wwPVLwClEW
zs1|dPOtLy+J5Bjy96xGXVEidhlk0V~Pc-$P@G8akLN$pccqn&Kt&xZ7NubG;Mnt0C
zc@uW}t6LC*1=EtaYi9~t0!i);078^c`jd1f{H&aQ2MG~ADSvLevM0Tz5XTp*g?lJd
zW{YU}I^!^_&{+CVO;xwJR~<hO<ok?zYh?<pHdNS~0@GEzPfzhv6&MJCM46`D+$@0&
z@6~WgJf?EVsKgXM3$0e{NJ*v>1T%46D)ycBwEHtmXB{N!mI8RuNxv3Cw481mSJFt1
z@XG(z)aS-Xg6FCH#hf)cn`bu>xcqAnQ5)XzQz<ewn5PFQh&Rx08NSzD=*$QuJ*F=1
z*z=HrJ1f3l1_7uOys%WAc}4QmGWdl|xDaZ}lS52zRged7_D{#GJ|V~}x2yMsRI6?N
z9EG}H{P_yPdztytPae9zLkZj6zk;>vYR?A0ecatGQojR!$K;JG5=1!A*)?1(fD@8F
z9EJ0by^=>4`|9x(lN!@?5n9zJx98IV|L7UqZ5-worsP~ie#@TgIdd39J}dp?a98(W
z(t*<OrHkUgohqQ~-4Q%aXf%+UK?(dUqZXgO_7b?R$8_5YJ$%=H10_&$D@IoGGSwPu
zXjG!l6_Y0bs60a$X?`GDp9-3SQoqjPyE$abKWKdzOy;;e)mwfyhPXT_l)aE8Dkr_|
zSSU*}yvD7z9ixrqJAUJUXrqC4q)pf*8l(8I<HXzJec7_PD>+=at)528@sHo3xmf4D
zI*<K=SUEuV7hCU`XQCY6K0nlcq~z3TLj4PgB^iQYLE2l;LV5qV1V3IEvH<d8eb~5@
z3D_Xhv$qvSQv)VHF9IQ8-q;vUPYBikZy~w$S7+4pfBM55WykSE3sdOTO%0`^is5~l
zEJ{htGF(Y#^8s!{zE7{NA(fLUi+<~-!{P2&V?Ufnxi}PKmsJtpqcs~OCc%WB$Q(IS
z<%N_6GcVAlBI&R%T40AMTW9k!_n;4C8A0_aP1jFxuMrAJCo`>Kh&^N59~3eTopoU$
z(P$Ynx3NxuTRa({8a+Nu2lY{GWjITy&YL|87#wJDkM|8fVvP|kq!DQ3+YLs%K-mx&
zQ_*u5(G*cOWMBeemSQd8pNn0`2#E(ldGf)DBa6m4Wh$H3cmf_7CNXee?G3o{l>sKC
zo`Zi?&fk4>K|z#tXSW8*L9#@vzbxNU{GA28Ma-k2nrBGM-`t2t=0Tbni@`0GLk&o5
z=2IuL43^PJjC|z5monW2yHv2)ye~$?B`^TWwICVZR$3BOplQ};cXW^*@u%2V+ls6=
z&5rEnbR-uh<=20MXyZgornKS>hBS)6jb4#Z8K9{&gMOpK+4b!$lm@f75T=j7;Eo;y
zb5$kP@+&ZpF-I~tspPT6WnDA>XK|}epCcb1BYFagB@e+8BF^wiHK)YWLoXT%I2;=;
ze;tlShBkFHjiR8fg6QQP;lVtC5x;L8v{*2`4KsH#Jw>Sj_IsKH?VVLLKBt~w6c!dS
zE_xQ}0OFLNg>0r{45WsSQ`m_>101IVpY?EGH$n;-&J!{UFd;#ouwf;dmfvn}H6N{y
zcaYaQ+$ZGm#vhNQA8H%2WzL7K3ZHBcHTEXQXmDQ~`cM+=dEBe?*7jkIrOV`^;oJ^#
zS0<a0BYQc(1(>h|A>D~NJG!vT)I#-IK(C1Dg6J15&H@OEY`icfI)TApRu}9yPBi+%
zB=jYx5W-N5*oJxPJUApwu-OzNfuhEm#-lKBN%5O<-FPQ|JWe(85Ae1d$VC_7VftD~
zI|iFLnz3|8QjobCec^#=_#L<pXr{Bheq^AfVjO=2*MPv%c_9f(K^*Z&arBxg%>7%r
z?RPM0z`%Un$_?IwB#2f|YLF<XSZ^htI;0t$fjEqWg(w`=vef2Jh`w>d%<@ezJSKt^
zu4%0k&zz6LeF!e-&rceljQKJWI#`F&Ve`<+fd%Ec3iBj@<9zGj3hT^KZ(#upI5zy^
z(M>&uKWC*ZEx720Fa{Hls=AN9<{iY(YcJbQ!_UIGB#pH=KOIpju+j7kb$;w?UUvrl
z#};A9o`J~8EF~~;egHuPc@W{IE}9g=EDiJ44)<Q5yfw&vXHCA83<5LS@kWQfTwpBT
zBEaTJ%y|V8C1kY?j;5Dd%3ki@AxuN;rAr3!xCqh54+V?|p68zLpcR?!*w7uZ&0A!h
zD_Rty3e9234gyE#3Zf4TzjRJhT@I1J#I~N{owu<BAugHt3p|}MwvB+Fs*tbT88V%b
zt`3^hK#h~WT`>P8ORK6b)J;<fZ;2?_LruCHHeT$rL%2ai=vUXbqC|5KZ(Uj2r6;Oi
zea0PS!KIKjQb+sZ@qwKiAJsW&fF>5~h7V#gIzrBjCj9=0b>$@(q}%QDUJ=XGkBJzq
z5;Tss@@Df+DV{lbf1NyISG7w4VCTAJ3%c%#I=$5GP;Yk}=B(U{Ske%b=aK+uZ5E3r
zaaMFPMHyt~+gBK*fzW%A+$G&MG1#al$h<vf8V$s%0-2n_IRV@$rrPb+^`MSv95bnn
zy#M)mg`USs+|T=v{dU+^-EQ$}UO~Jye{9n3_6p*>+bYBF@Qd;CjuAZ+k7`GymJ0mE
z*cyilsE2BhsrBWIPtUkSVMam%WBqlLu8C%R3gP28YKJkv2Dbu>sBp-3)k7+k>mGc{
zI%fgLJaSBywGy&M_PRioL755Ek1E#6GHt*U^dxW1NH*@2HCK&JgNk;#T-g4nW|Mpp
ze)c!a=YWYP*_jh=0W=BDbBydhBH)L*^SpVS<H7d>#-E%E)lhx5N$f02!~Hf3+Oy?w
z%?817H_#-moN<h13d90d0v}sL3K0?{kBSw6nnczdn4YsiV|_IPKmf<HW(tS~sN1m7
z<5l$nH~kL)n?Pj0hm+16t$-07J~@cYDGXf!)Rz@LQhQZ?!loe^=R?!>ek7ht3KIe<
z-UbFb#aP|`fKB3X{m`)>pK^jbwNlPuQ_)?iFX;d%^u=5w&$Hhk$?bd;w<#9RGmZlg
zN5kaC$nw;k)yjHH<M+Vn{}%u!DP&-wf`8Zj6)*@ZdJ(X*sWju_i9;5X&Z4VXwwUG|
zDqXzoF-MIkEmVGPM7=t9_cT%->3DLhve%hLfq+Ncd?NxpazAIcLF<7^@>AQ6=|m2(
zI;16-`PjyQ&=Hd(m~`kibJjY}OCJ9KB7Lq{1mfc1*J7m&S&jto!v}oXImQp8^urg?
zX8)?{7<)Ud7exOmaNVwRQ}nOk7D_^breYrw^|pEVeH}Fnbf4PVrRo4k&o%3h?geK!
z%k6<vB;A9~`Xm`Ib0C{;>@am5hmG|0H^rkQ8)I;K-$m-~&hh@j>jqB7KuyR=U-!Ac
zY@_j0*zA7AZsSLGTo-85EEW2SR&9T1drZy1c>MA#_0{5l8sl+@Q1mM;fgsaR7>@9R
zN`?$Q)A^Jm5ak@$u3<yINPrO4)dm|P(!)hh2noT>|24eZi1GR*%=v5i*c;U7m#HT9
zI69%1CUI#<P+LMHIHMbz#0lN^Fw}Uy^%S7JOQ2q9UnC@kSGW{u)R{xL`cB1+9U69Z
zaKtZcb@kryRdht&ixyjz#I*5O$((`fR51P#l&RHiB(R|YKd*#vA2SRz1h4fSEbFz2
z7tBFcueY8KdVbv1>$<Nzj5J<hxxHaJ8tGUI7a)gV<5V-K_B9D%5MgmdnCSF}*7?g;
z^N0{x`{enl#<tp){2i=p{KCb0sxO5Dk}XC9)I8&`2gZT9Vo7+>Di<ca(uD~B(NCWG
z4dIH_j0RBbo6<8Cy3j%#ct5+mb{ar^$?jprej#M}bzN^9+)Wx#*9K|zd)hbUazyou
zsaH~>_@t8*6B5a&_~_V*(<FWuss#<syY!Ol?H7hL1R^y$Fz2R57VLGY+@EEWu1ck#
zp?rHf%P?_ucb4bT!>F=YcyhMKE-Ska3g>l2hg)~;P}U=x-F2F_V%$foxMg#7%Ifl0
zjbQz0mj<w8?rRPJSMXC-07#m2fCeP%tpN?UqW@2szv+Ix6)1F%odSI`i$6b%mxmbW
z_Ok<es8{aRpuGnxP=*$_xX?*MIZLLaZZGb?8)aA4mJ&-pIPfLZp$g6lIFH%&eZM?R
zdP<KC^Xyx@@%^L`7Rll?k8bpaIjx=4aqNR^V&e6vwF=zU6q64nH`!vQari`PGq5pX
zND$Mz)%w!OAuRmG42FNmzX9PhC0RFw9L`cock>ajo_PW5>Pw_IWDDLL9=BU37o7OI
zbKLx)^>)A1*aUCq(H$Fm)$Clf&fkW$BQE5v)!NzRv(DwS&(+$=>G`YX@!Jppl-6)X
zAzqsmFdSz?IxR$oHcy{-PoF<8qy`U&mYvEN<7U5D9A2C!H?wq}JX@em9aZwkNWynq
zeMsC<8R{P#SeWPGOShv%+|7aLpTZ>FYS^<84VTN-t<jmQOEP1(^8fYfZq}FfOsATw
zQz)}8DIo4ThP7MK(NKi6G)JfRtNC?hGsAS4VR+n~z-F&qebZ<njpa+^pMwJ2Xferl
z3BR7B2zYrn^?C_%aA&AQz7ldMYy)S~jebH&EO#~NO%`K#^5B8*lmG<lQ7_sY^engy
zdJlfG5N;if&~#Kn{@cwT^h#+(a7Rqpg9BJ`Oe~mAj8(tRifKNwNQGT6Rrb9?G_sE<
z1xFH^pJ*f){`F?(ZGDrz!xX!NUjAU$)n`c|=lxrlVv2O|Pws%|#Fgi@0)UHPysX}4
zMa7E#&`NQ|Jd}0oUeAFPNGC3IR6<C_Y?BYube62d8led<sk(WG8AvnhPr})9P3d9T
zD$}wue5M_Hts(=TlhcRC>urU~5~DOtW*7!d$V9i&=I+kU!!oz!#H&u`v$XG!8S#*q
z;zbW=!M-7Ggv(PR2V=k}{b7w{`K4!a+{Mtca}lu|XoP({i{8|phFM8V&bf^g7bR4)
zw3vl8a^BDqnf7f(qJyy-;)3X)h#S6(YIaZ$3vcVuV`DNaqMGrwN<&_X8wH@m4G~}%
z8hMLo=8cBQD<6|Q0?AS%^!O>^1z>Ro6qj_nR+^Je;OAjH?+kKD+Q2DHeHSN;9wk`!
z;ik!ynmZw}$@e+h<b?FIWUG%lgmlg%tL`$EpiIvPTAZ8WmDE@81}0depN%Nj#5%^o
zL_?70D$_YSJ-j$Q-;SCS&drM|M~R+1iAT3N=}>7sC=52aB`|Qp90#e1>w`lwLYbqi
z4~u-BU;w(3P=?b@&=qAq7>$RVA^K#b&P6a&?P#3kQpJWvg+_Ym6$vlgcIcRK+IoDG
zO4K|zdNpk~jNfbPI=#9UIe=*l;RhZ^_;{=#{K~cXgqXTo%fQ*H`pDZc|4lt>ePQ_`
ze507Gs&i9YD_2&+H6vOY=}_Ba2OmXDno10+EW^U3%1mq9+Q^%+v)`)Ps4`RPQdb$f
zrY92omU1FvvISJHNm;KE#P&0SDM$ajT=-TYkaeu=Lo&E0QEhi;@9Rza=NnJ^p}@Oq
zZzyM2mAR#0u4e+1Pov#$I9hCfF(dyQ1xgs^ccp;d4k9f`@?2zSQ8~81{Y_E4?i?3q
z<Q1cLu2LEMa~Fzn5(s~Krgpc#CV}wo&Z}q9cZKm6<cUwI^u2pwsUN)EdGcg$r#O1|
zfPTvGTOZ)A#SpZ^<@4Az^C;~@Kxp`sYRFuI;=HBv@leO7%&KXS44(KUlZjT$2CG+0
z#){_Fm<wZ~PnpU|Hre`()3NeAZz@H3+tO(`*!WXsArc`8Kxl(Q@9pfoV^y-4es~ig
z?h4vBlA<z0%C8(+TI;CbD^y9|)wfLB`=v!I2$mkYZ9Www2%|6Qe@mCarz}^8CtO^u
z-JJ;b7?-QG&vuobQm%oJr0rqkmU8g;Zg?8*h4?A6xG3CM?D2*d+MqQ4rQ#Zd%$*Wk
z7B0?pN9c@`GU`}<z`H~be2GZT1mq;SshMXRFVm<Kj~h{2!m|%kbmM~wo75LMdm!GT
zG&L0}ZadnrO;A-ye9~tj0utFb6!5$c*Puj0M(ZSC6}JCtVzjVUVJ$arG2h^_A#-Y=
z5M7xn+);84iT2JDYPcgG%lz_akj#@l*<#Qt^b)?d*>opQEH#{aQ$HhJF`5Y>k%hCS
zWx_!J6cc(9wSc9%Cgg_NStR>OJxd`pk#+K#Lp3XgJBR795*7+Wr5+lg0PBMJte|zk
zV^_0yJeJHad6uCH8wxuu!8WEj04Y#Ty(~ipw7l%WW!?~I;02+m(P$_p%cNPAIA@Mo
zdxaHXKhWX%@qbNhX9}50qm*)8TDB%{Y(zpyaf^>RVM7v4+3d>glgTQJSCHy*6bR}T
zFI3p*mLY;w*_MDOUw6cgP=KNbA!|gL0@w;bT4Q!TCeDM{IM`-_dPx<Ce)ma25w@=i
zWXKHvG@|S522;h@d{)XH0uwnV4{%9(LFdTvOdeaFM=}~Z{F+^kb5)mh68I0zC2HrL
zPTgMu7@gsjc;sk6==7rCrhK!)7EYJoH_$Vi8{kGTJWG6jXWZ;>kMja_5aY>+ImZV!
zdxIg&aju*=W0v$saXL1qb;|po2|t9bJ-a-A(NgmSH#Dxv3dRYoFg`7lg1AH1i}?WU
zL9lD!u2I^d-tdgoig4@Oml`^?8ic1a;ADmZ$i%L(Ob52&v9Rd6Y}X`~Fp?k_WN>^?
z!x|R4`5cJEt`QiGlX#L_Z}2h*xU9Y5Izx;z38xlgV}_hvrG4BZCl{VH!Xbcx6Oq^o
z&?+36F{50DXawFQ<!oyirf8xB7gKwzqnaCXm(u~pUV(%htm7W6fH6&_TaBXsV~7J0
zv``r3*hFLC#h{?Y63f7xbQp@RvN_c-(YXOwXC{F$H#o$D8Sf-xoG5wa5cn`~k*2Lf
z$VO6uuOV#yKSbW-3<>v{B5hy<3-NOwrM-T{CATGJ2VyK2jp5OB5!ioie3k##1_N&+
z`rE7K@$u<l_qhFRIV4*S<u34CA^QkI_rxikgqgGgWbgj(fvO+nhL}^waIYXB+-Exl
z*lehDAE}BVTo{a{*1<l86Z^C+bCF8Lj$x6K@pN9=r#oUG4_+&=&yBX@91(L(W}`vA
z0_l8yxM-M*e%S@&-dpK>oqbeR^e)?|_<PkRPJr9?xBT<(=Xy5^_U&(Ha2GXV4e#Lb
zA~wtx)Zkp&`HDsLSiO}L=ChQtw~XM9Q_<#QF>&OFtO+n;Po;XzG9za9R}cjk8tKS1
zQ^UKQWdb_qQTh&ZKKbj+Fi9+dRyAEI9gBj{tE&+wp6Ms)d;Eq3S3|L)6RbaFQENWR
zZg36t4F(HJ=7`lePZW~$+ffsbgK9Q722P5OJ`yTu%=rWSCE1S79J&myLWGiZc*{rF
zOo9VR`QwE{16NreuQEJ3H`lioSE{=e8J|jzZVp;L$aA|>$heK-TWfpI<|h$4e!8dA
zRxE5ShTC$sYz;88f|0f0tnW$C<uVr;%$>n(Z)fLwB*C=R0Du*5F&hVp@2>`dV05<V
zJ?t!cW+?fhhlj4GzDDt60z4unPzY@y=9B=enJuoai5nsyErU*hQSheQK)^J;i^q(~
zrAs^oV{+P=gm3|K^PDa%`FW8{`W$e~rr>pw@=eoe!q#8{stQ~o5OIMloxDen!7KF`
z6bZ<XvtSSnAebvJ$wg>Zn22-&jo~A-SDWMh0h~wuWQOMCX4;lOWX3TblkmhO5?ld|
zuJC9jEWUDtSOkUW)Q}{UaI~j>P$btf*tZ0aHCK$cv*UssiYNrjxRSD~WP&~}5*_Nl
zTR$|9|C=)o15#m+sa}E$FpX!hX|PZ!W;CwR{(s;4u|xHm=P!PMtN6b=hv)4x*tyf@
z(SN&5c3w9B8xx^iPKc4#a?g)1J1_s6IN+EJ<Kg6_*#J445!3TJ*87nd;AjTm#Z+85
zSa_M!rm$#d)z0`U-@ZR)JufWtyCj(sJ%RbR8Ytx1MhTDbzZez}-@0-d`nSS@o*V=4
zy@nZ6O)%coPJ+DS^UH_F&oBK%X%z`#Da05#+71`M86-c$CSDn#1j<C-<7ff+B%v(4
zDrA&}u52r_MK>LcI0YvD=mQ<_4%=ktsAyI4krf+0=Z0H++u^mAncRnlh<LKoV7MiM
z9eFZ9U)P#kG?|+uHM}~oR?zP03`Q-1!`@@WLu(hM3*kMJX*CLVGv?zLrAc#)RQx#x
z)QsT<5@R;tSTL^6*b5^q20<{J^|T=HC2(}Yw%d}Jf%%(n3XVoF^{uBcL^MHwZeAqw
zi*%f{C$G}U0zEeCPoDgx9{pn0#ILQHkCr$k8F(lT6!oXG?0t$Uc`#Qp6`Dim5uqOp
z;Ftk^-;O$Pc6}etK9Ca}J(9&`Se?NPZozD{ko>MHvvliP30BOOJE`%WsTrXlBD!dt
z%Qffq-Aj<ZB7;-n|44Y2e3%N&p|eHHn4O3CkLL?!7URH{^x@+n%%yt>y!`jw^H%5d
z`0}ECdQvprgBo!!mqvKvTc$zM;WvA<4hgOmMgB|+IgD%`UYn<yF0diYFGsUTTqN2T
zwrq)RFkhERbI+?meb*VS_TU25jOBw&#BWpHVZ)*^{ZPz=t@Q47JQ{A@#2T+K>Zh~*
zXaO~y9loJU{V{JZl=a(59HVaoPi*~T6N=NG!4}?<ijZFayh!KXJ`-VHS~Ue|T>U4M
zFU$GZZK;`kc~G<a35WXOUcDZD6?xC><~nCl+OqHbljeD{?d&fPVM}QF^x1#34lf8P
z3pZ;BsHzaQZUoy>09&=Fl6H;L*z3gj(vGt19o(sC)J4Hl;f!H8YSJ^ojXX^ICW$6)
zF9z->EN{qy+)3JMVm@Lw$JBB;Dm8RfNcP5K_&&Kkhbz=(dFzwWDHLxUpPqhydDcBS
zy*Rx*eEEy{2@l%OC0SkN2r9#4W6SatNm)B8ZV4SPL-WBAIabhLW_7sOCv)oLbON(@
z1#~G!$mT{pQotnL<#5`D%0)i>CTAKqXT8NW=R`xvT+X3|nP}&lbm5Z!!(-juC$nTo
zI=){t=*Ta4y6|}Xf|tV6=n0JcsWGDSCTCZtunLaF4(tb@hd!zT_fQFp*?RCM#|(=6
z?){tHx11Yf13_`aQ~bK7dHD9tTUg=0f3cx4dU$vnjW0H^w3EpAUCOzfbvcUpT~!}w
z_yi8Lj8)0UM4OEBJnN@K^U_rkbC28j{`q<9KPv|y=ouFgSsTQBgXDusT(}X>5!2+k
zNONrta4gELSi>SW;wZa{XD|{Y-A85)!x<F&lh@D@4YqxB+`4GLYE=%{VpVsH4THjI
zQZ{7tz{V`r#^hcH3L&22^72h%0-@-Im3iYjZ#_Rey#x-fYFsunGQcYGzQQJ&tt#yi
zu>u$&7cRenwrI8u9hxmsWAU)2K0r%UJc$TyWySVV_|?O-L2)o0(0^1U@@f^B!p6$i
z#`oSf*js&jvKWot^wB3PpS}$wvocwL7^2EE(_ACadWOyLVDC6b8=UB$a*odyqj!g#
ziV-?+!~Z*xzUp_Jv!cX*vN``2PQzU@lcuFPiIBH6jX8W_4tyQ!mo1*)u<|j6i#B4J
ziHT@U8LT<K0%fR`1R>NUN`O$Z2;heeA(4PL8ZovgcOp7&PU<(M);NX-2E^XpsE2r!
z5ceK{d<`GPS7I9`gKSYPs}oIsN5DXA`%efIU)~KYehXY63|QDGT|)o-AOdt1w0V^D
zXU)k#t{ofwfJIF{n`t7g%QYry8Z<M)tO2wH5{@Bewhjl^a2rwK8nQgofr=&_j;;{#
zX_J>qJEVNUC~upQ76`o==gGw5X9AF4oF=AhtFR!_+MPvDsLjqTP);8NBHZLM4_P>5
z+zgmDW#;)k5GJh8>mj44k=&Rl8^(QQ;1b7C!B54}kEfi!AmvM+$XU&xAf&8tJ?wPi
zldIfjCAqrtd^15>INy8g5UA{_Q6OjZ^r*a9O#6rqVm<#>=c0Mh+3;!^5*B3>DWI>u
z)--9Sjj~!*bJQehHFXG00Fm*OWRuecGVFtNHixmmqUE#=r1F$_BI2s;H^)P36vk$Q
zki<P?0zI#9+z~k_f|0QPWvBT<=+NkmrU!UJ#K_aP;UzPP71WcQYm=~lE{PSkqZ2^x
znm&PKl7=#+=x!tkhWSfZbkOpsX41%fQ~#amLs}3Yo}L!&i$FdC{8$;Jjp?^6+k&l0
zPNo!I1*$w^M^ov%<YT(*O#GyikO9y%O4rg)4|Z+){;l=*QsFgH;F;bZ?7nT>lddTm
zR{2V#&%ptwiYi}>Zm%}_VM)ST+-^d7n$lWt=bW%%GOLP!Rn>PnQj|Lyw(zwZe60Du
z$_>HBku(rPGpkt~EYt!em!%k0!5~b(X^x@!{TjGjiTW|2X`iQvgi%1l4zv#0BO!W2
znM~b*o&Z&3uAi#GILaG#wp1U<a&{3vf^9?NLfW>tYB|b)A0anbq3D>qlpmvNcf=;_
z6}j|w`Yrxe?nqz7Q;ekCZ|r^Zz;Wdb74;dg4K&QrXeYpoFJFbS-_#mCkV)p9x+r>K
zt?olyY46la*>QJuKVr8)_G1!tWsRN+v0GMkBKm4^R9T~a-)Z9xJ+Rv44n1&%HF}7%
z;Wk?ytkJp+=CMZ0qeZ;U>f<$9w!t3Umg&kB+~b6Ia1KuJ<|QI>(8CysZyxQv^^sgY
z5fd^lpkWpGSG}<@=xu-Xaj?-4$Nir;a6&O^YjDcaM!2Xw`Nhba73*i5SxrvEZ47r%
zWXLKOl!so7mGJ3ZOPqpF?p?zr1RaW24TJE^8c^hiKUf1sQSq`ZlEyW$9Xa5y*)mbu
zThnB=1wYs5!3zqoMkf+ufcsgaeJOv3mNBjYiu(N|!&-@x(ff^4D1>$IvpY0zLQ$-P
z)C{||?mcstU~+dGK;O+G`x|<vcJ9=*21NVqooh>X>3++P0YL6PD>vEqC;koHt$QLu
z4$ODzc9!RNo*NoC-?fjsPslhiuR|{7`If=9>rKbF7~i$|b!SrWVP2yf4+NkG<m=S0
z%*K&%?Znais6Sc^I3la-fDw=YdegUF{M-+lfV@kl62AmV7o;RH(+peDK)aGa6fFnt
zGL^NLtQcCrqor1u%dN{SF^bq)!ZZCFh9IOomV?@5r`7$B7K`MppdlxlRE^w1?x{6r
zc0VN^BI**sR&&D6G@^SP>4jL_^0NGp%zChLV^|g{C*ia4J5YG@4<1T{mlRQ$-tK?#
zZ@3Jrwx>gZaY$spm`*u=kD7aEd<%0DH>lOgARXRmp$8OAW(8Y1FcQpzia0dOmxn9s
z0;zXL)e_13y8#RdNtaIp+t9c}T`FIzvk)gpY@*OmWGmS_XPDm3xfN9Z5^c~olG~Ee
zww2sg`T(yl!T-}ApMTJY#4w1003SchXZ?r3wDmu8A3N~*_S>)V@9v+!*>V5w?CkCC
zJ=*#6pLW0A-TU^NZ~naZ2+Hk#{q^47pQ4@5JdWUJfijUO`qQEZtjl6axfSpKML!Qo
zYjv1SZ)fS%^*n-Oh&~|yzO}cryN4F!qxUhVdygkWxN`wTM^EC(95~RAs0+OUUU(D@
zGBN>sN;$+wqlnr<d`cAYK$T;pDFe*kTNo!~awo#XZHrl-t+;#XBu0PbY=$<mWIThR
z9@w6blbTy|z6M!&11~d1b>l!SKnK>rY?z@*8oPdIfCbLWlFT2=xT4b7NU<k_>SOM^
zF=oA<CFEQ|YAAB$>zj3h3oPxULUof+-JCtK*s9;{Se%ILsGwJJ>jS=_YAC2^vWuca
zfvFA_V#`z*jgCSF^+}^~vUuYMuF!?&KK{^HP@?6+EJf=+v--y5$(@Lq--$Zeq9s+#
z#$9X^ILYi&+5%LhVfasKBbymd5LCIDwa(C?0$x(8dl<tQmHE6pb9CRDp+BtZCCLqL
zIKM#<aDa;LX134jL){cXj#bzUT@-CY;rQZZyAyRzpI^Lgp0^_Ses+HPL;I+86g~S9
zUbdpc)3YDX+b>>TL@!T|k6P!QsCjY(Pfsq++s`g9PT|2uvja6Z=)}Og=E;vy>#t|$
zEg-2+&!hIMv*R|j2OXR@PcGW6P9tic93Eeyfng(pHlmYL^e}qWzJOvErw!~E8!Ok0
zPM=4wTIYu^;b-$%`?!7aBX#+_eQ|=_J%|39(OL8SqJ4OI+&o9m)3ehKwTAOMYIhEg
zo9$Pvqiq-i^c%H)K=-E3OQ1yy(>;BC(mKZpcyoP5Z5_9p&yHK%9nAKqecn2}z-ifU
zhp>n+$YVe}XRX6Ferf%+1v6@%|JZ<L30Iw-bXxy;3FY8@bkuy+d;xQ;tymq{p~K7b
z)+-$N>2qwSbNQ@u(Z0C6XhknhPmgHXJFW8{+J~*qesp}=p@jpgy8)eCG_iYZ1y&7S
z!}n*Goi?r?E&9nt>-_xk49(~3u;;H~g<uVuQ2U71`t*e642wl+FrL$5&{i~}*DqV}
z9QOP~rgw4P#O1(z?S~g`N$3^U^TL^Ibkcfp+<wtIIc(wEQ*7vUyVI)k=CwOmrp=wd
zZbHwOIDOhQ7#n|eV7WnC8?~QD&7&XMICw6MtpP}M+5$fCv~zj*QdS?21@K}2#tdK*
zZHOG?dc%1Jf6&X*e+XC0IPJfW3y(*DQ6~Lcd}yCO!8~vAX#4u9^Q@17!SNB=d>|Kw
z;eUu*Tuj~kAA{aAdS>jkP2l2qHj5>7#Vr01ZRQx3wmZ*AI?2x$z%zaOb$1@|JABb4
zN#`5b1&oc}?Hr$8bl&cN@#{VgWb1Q&2qv~D<7#yDENY&$;mPOh0Jjcx@i47+-XhuZ
zpyn))Ywk|di!Rwb2+f|z1SmH7Zz$>v+ZqwJr*PHi2{%Y2Ccb!0EGVOk#F=qkibKvU
zAwNNN^O{%-V|J~xG4|c|ICxFic*(|G<@cUDmNHN#mmpa+=qL|L##puYv8H<R3LR%x
zZ5UWh9!imQot~tYTGk(DHxX|;npcT?18jeTqX=o#0&zS9{);`H>6%k-3-WW*h^-Q3
zg(xGjCQ~QL8G4Lo1qX&&oyZyU>@^0c2X2yF?ZTc8b;pOo6sZ6v_E#HXJzam#(8N{H
z8|^&QW3{~XTNrprW6hoha>1HH7KV!^ZYp^IK9-zjM^_nv-L_?hHJ2B99g$0+CKZjN
zJSGR`{&hM+!^2$MhR7;#MuCysW?~}PaM>yJKae(q2@Is<0`%o|oHt2keTWU8aY%$3
zi2=T>(E>*IBHy*7UN2kF{1&rZIvwWVSn$_Rr8$QK{KgNdR;(N_lMp|X_ZmXG)PWR0
zv6XN6$9Al+x_E5Zhz!jVr^$>D069=QwG|7A5hEV1A)G|XXXP920|r(akYXC3EI&$y
zL&SYZTF0D`ind*ymypSbcDI4V!XB;?AW2z+HxQ3+L3Z%<ejZ(1923^tV@C`+`mUpb
zAV}T|Mv#xV=+!9e#e^&{^5r~#h(v3WOXO*C1m{YT2%p&51Op+|shzJWP7&6hq8TJI
z56Wh7eTp$dCbbbN<*@w?uNaPOh%+;UGA;z*EX6l$k;(>hbalYlVc@qO7!nDM^P-Ul
z;HK+r3=8~@J-(!TBLdcd9ewR?Q+zJ7<vJWfQWSdNDiJS2IJrpclR;pbE8;Yaq4m&e
zMKvh*F_~rc#~7N4U;={;QJcht#^&BDoW{qPN9I1tG3Ubel=jr|jFG-MGLr{NoIR3Z
zHxB`?MAd@H3y5JuxIFosJx9@0b8^)%7Q-f1TttQx4dWjp`({1c+4y%ebfUJS)_d4X
zXDHM=jfi7=Yz>eHn>55@^9#yjs4+T3>Kf}L^mL#TIfvm)oaQB12u?P>x)S)HD&%;+
zm{BwD(>OY69oww4)`*25D0ENxSJ~Q^mbq~p4>O)Zdw4<#bZhMWS1-k$WVhHG4#S~d
zsKD(eALi^S$CGVDh4$(O26o*GrD%^m$%v3iC`C~^&}7wpiqUTIU$fIZD`$n(%K`^*
zjo}H@49-K{R~bbeAY9;IurDPVVY+mJ0(GVN;hpJDjU$8*WJ^34u40iuI#*|ZUKz&<
z*t>L%LGXqgmJPy?i`+Sak1Y_3Uq2h^7QC|+6djK}Aq3C@8;%;%r|;9`hT?5dVZiX@
zDS!q6PE&5HvTzLrcr{<Ab2!s0${q!#dNH)tfaN-|w{jQ>Vou?JFlt=GYcid@&k&iW
z9G@p1Y|#>$poe-|{npGPGx(s6j>ll#uPKU$vj~c3-KH=Ij7BLTL`VsZ<?M^ObUN_{
zHjMLY68a$x>p?#GSjV^a4xu1b2H{n$HQ-pd(ry*^zsDFkFIpG5c!4nX;TS4>=j0e2
zfJPKZq%7KhR$56EpQ1r>xX_mek$2$Ms<rjBKOU@Ka_gy*iifX`y63It(do(YkM=nK
zeaXSrry3U+|79B6Qu*TI%(&5#=TxkSI?AoPNxzf?=^`1UVToOW@C&K>*z^*hgT<%X
z#kWMO+<q_3<E1sPak1|AtslFu+MQ0rk~R%SEXaEptF>RN2g~GEVYp153So*-k*XLc
zreX$J!p9rM;^?}Lvua>M<^Hv(-udnvk2Ai(t1hxC4t_0%^`f`>NvpnJMO`!b=91Tn
zj$G=Pu-Qb?$%_G-5_WW3v8WfQ-vay3Y6C{;L^v_|$4<5?b#Ms}IPet7sX!fJJ7#sM
zRFJq2tR}I&pFkIcX@LFU@)r+}2?J1IzVEiFg^^<&8ftN0Nh}g_{VxU@;6MO>cg}!B
zeaQzo`LrejvDoL5GFwrtV@7v;>?DCEv}qLP6v7<2TKN8E=Pja*`&;)NPB!ct;Ke7X
zR64VU-j;)T2ae5eh_T=wKaTkj{pJu0Au#wHgJgL6T%*JoFp|q2PoXepc%ItG)EeqZ
zi5Q9x;Y#p~8$F{pmZ^CT^#*@f-ZIfR<wU^rgr&8}ARggGtw_O200%u7Y~?{NNd<GV
zI-1_HiOpa!trewE6H*OYp%XT5L{?O{5xuuowC>Tt<JksMwTAeLaDcXS5FND-FS@7S
z>nS4fH|$0;M+m#M=b2<IC<u2p(d2L-se4yg_d1ENFEVTe#^}uB*FppqWp9xrlCUYf
zY;_ZSfoLM4%Whai8xMpXBN>G813W)^hLOFAnKir#Gs_W2gzX%4&@F^TC)7B$!rE4w
zq}6c2HH~V_dB8P?D}h#B!Q&N>pqUAWZt4=H$YI!#>GauW1(@C<$LMVtwsVCkl9isF
z&$5vZ$_>(4GW|&#<dUG&8fE_?u9^+o<a!@2Mkf57utY9on*ke6&mHRxllxW<G7!~A
z1Kp2h7qXiPY~D3GV{uKp%x*mM9lmin;73Da#5)YnrgLg>#S3kjcxMD3u-V61k^I0D
z6h2!kj*f!21K3jfOM5(=$V7LAejk_ZnxHn~z>GAQ;URe8Io=9pP!Rvlw&F33!d*sX
zy8fn?x4^Qx+eThyw%*VyWbwdIu57O(Gja#GK61Pf2XTdYiA3XKNwW;=<H|cp@Yg_w
z14^{(*e2Qz;>8D!s(fJGQstr>4Fb~t0&Lt_4DLv>p#%Er@&uGm3C#(vu8ZPi5nK!s
zbTl7W#Apxg4T8;8JR3yRR%YQ3sNNe41e8okK(WB|)9)U@*;i=}OZGGh7Qzy>%>}tR
zlbBEdW=sK(ZMJFpd7`}0CDp{!(SUh6%ifX2G^cZrc-NY<xTE;vEuxApe(CbVF3jIu
zPkawFTr<C&^b5UJ_IOV>-LqE}_ZNaSXtbh=x#TF+HEY%|kfmW=whPA(<z!Bl78{i*
zA&Zfiu@i<PW<l4S&XhTga4o>*H#lTC9{tP&ydsT2T_P<FeI(&?Ho2vfM6|qDH)505
z&5OgAWN$56s{sZQnXr@-;g4nWswUtL0|>-~Z@^rpHRs7V9*}XBh;iy_-n8H-sP{44
z=zKo9Pps(-u%YTk1PF1~L<<P3r2y{+v!LL^0}|LuC|HTZU}Ag<nR~x~-?$U284wN_
z*4O3r%yvd@E(uZQ#76pf!y!|hTnqhC5}UBcQc-cb10#waDei3A@36zIONy_;mCP&3
z+VKx29o!HQ1w!4CAQyd+nJg0q(%zLNM##nI<<fE+_kpz-9wI!}{A>41886<pW57>r
zDByFogaBkF{Pz`^>LmkOqJ}BV=kU-<F$jYF6|LJXQn3KzQYH%RM&x(j0bRbr9yaW<
zG<F)hW}p)GA&zE190BeYexI%JoQQVzfJ?N?84JEAB<so>0;iVR3KD#n;Uni1A9Gdq
z@F{YyYY~(>0*gWKoQ7A>xCd`$%eTNa2vi)o_V4cO*ynI%yw64e^CP{+3wfpwD)K+e
zWpHy1HEX*?3wxM{Me$~9;IE@RFoXl#-p}K7W~Wt=EgUQOp@&57W=g%I#K69T{J#4Z
zM{*#@h<y`8ynuTx5(<RfV$UvlBP&2K9*SV$F6q5{QCY(R54X1Lh6F<G3ZWsfRDrKz
zmE|-utXRexTp?5^itgc%1Y!x3uT7s&@pU|%CKA<HX$Wcv0a$^~s24*`8Kt&})kL3|
z`Meuks^sf2&!!r2sJbynA%qumJmP4}Gmeu!S=owgxCJ1qIHRLjvuBj%YR+4IJJj3-
zMwq1lLL8iMf+^7EB-5QDDK^L??i21G3v@LjNT|73u$yC$OYxZ|e#;FvX3<TsrI{iq
zy7bYamiAFD$q>pYwqel>okjQ6uO&bZN;Waud<b08xXaurQf|Lg3a{mKvfyySIb6j3
zYgr7oF-F#g$+N0iEHNT+XQfsmM?{P(5l2LqO0G@dM(T=b3Fb6l^6><U8wwsypkaPH
zK*w^cE5x+gI~f>h)22zyVvn$Er4@$nMkJcC_mdT$Hwu|K*rUf<VWYn~HHg|lC-J+N
zQqo1@m>#oEHDpEw{N_r(LM)%~5TD0vOUs~qDjAJ(hljCd{_iB_8O1we<|o8zd0<n`
z`1l4+%2-@Vvou>fId70_NgrTQi!ww9Tz4x7IA6^1Ye{5BA+sqDM3y_IEgY4<kTC=K
zG6E_VQecj#g;Kb@<+)i_WYDf>*(6)!BhIPrJ#pkeYk|Ke6IjkEM&BV}o7*#`6!7CR
z0$ld-&SilBJ)0#{MZzL}6uyfB?+(zv1$dm>`<lT*s9EB((5yHG9+KpHD9=_iOB?E%
z(x7x&7th)kxNOa{v)0Lx;gMXUSxqs;h`P|5a9i2LFl;Ciu(!q+dY1qP_SokxrHA|3
zeFrVnG|DQfTj~wIxzIdG^F+j?vJ+m9@h{+(S+4x2)3Qb{Rq}k}y!m=Vrzm8KohI4U
z5if1$qOL3E4y;Mug}MlK$>>PP2Sm|mrOOj}h+S?atauV*%3)wPDYsE3)=*|oOX|P-
zgWi27*Pc6eTEKapjD}V=?NRU)KJKwY&igBG(vFEFRj*_=a$^}ba(p=G#gqpqEGv$R
ztu{D}(=^6pFRbMg5JSFM`wl31ERVLy;jb}M(Z%f){jakIMr=b*gOe9^Cq5ZBH0WLO
zS~E%f1KyI#J7&}%L9*mcoo4C8o27(=B!G5An7lL%PG<Fi!dqc8lBQ;&sZHu4%*rAn
zO$RoiEm?5FMa)?@5KFQLg7QIuK`&<sGo$Kpm6{nVRge&O7RlaVPP}3iQtn2-{1Q0<
zeeoIA)3D%OI2z?E56B~eUh+9UN?aXk=3EV#;ZDxu8;?Pe2G~P55>~~1=<+NcF(!rF
z*JTkw<_QRjO22cG1rWpF>wNUStpP2;xDxnTwo?_C3nR<<f-I?S)i!i);xaPXa`X&P
zLSMy2vG{h>UDkQfn=HmEuG=C-iLx+Q+X|b|Jw8Pxhsev!*~gZUo1$>&Y_X=uP%=JK
z>S@&DT#X!RqEcH!(k~MvoYscrCIOnHmb2Nsji*R`9`!o9a4z`L;<40-=FMN}O0LWn
zgCCTY)Kn5&ui?+ldi@KAN87cI@*r}A0Teb2PYxWzLC+EQ^2);j+44DkE^iyb57mu~
zp%Yczs-ksl3tElJd-7f{ilkJas8&*`6wpfN_P`Te(1KEMs<LE(mbJ*$$nLP<`krmT
z4agKShbKar0yGplZJ2G@UtK||@IW0efbcWn2+Y|;4X(;xkzA0~Xo%cblDtLp`N$)Z
zov!2eS6z7RZ)<sIUChUx&1^B*FF_vC?@|<^$5#g|mVivV3IGX(VU!z~auSV<eR+d5
zVCHitA(`bb>t;o5i@~3>**i%HMA|cS$M_UPGX&EAdI_Qt)Zk+ps#L%<JY%zOT+cUW
z$GwCuTd&S8emr{CJvk-qRfh~FLT2ig;6Z!LO;fSi`SIk?8`8B+bxss1tJ`TOY|g*=
zHQw<=S*bU%uDumsl8Ld5`V?;Xg;>6SBI+b#E*E=Rq78S&3Rnw7USEyglfphwqC`sP
zfUW^72uNl#%D}8jhF1IJhvsn@Q`ZXUm{z+{fpZ<zH{lob3sdVwZ!_d*6AW;Y(&q>w
zs3HAfHyWlG)%m=2)b6}GJ-R$@btxMi`g3%DXq|W3rzeds`Cg!rN!Z{DR9`^pPjDfD
zp5b3leXQ*wL|&x>S)CFuYY_YwD*AY?R@(&bfZCZ0XCwc4K`DuaJJd59Yr3-~CuE-U
z(X(Y&pIfPO`OK>aR9*A@Vp;8b!&GJ34>8A~rr*XXkOB@?&<aY4bFwxm)XS#f2)9*k
zb7I5ICuQBOHC90(x-W_)b+04-nOTtrBeLg=dH^N`9{CQlQ=l7#btH~L&eCYonuU%M
zHDX|)5xIRdBIiyr+f7J~9A`N};Vr5arwD2+7l}knqSoeu1``S~p%X3FH)>agP?LWa
zv8MzQA};gjnYKY$F{vvAuEZ09t(4f%G-}>bmgpZEcn8JaP$5TK23C?Cr}@0*EJ+ic
zc!qimkh2lcw@^X+6ib>(1W2Xh5vGYW(;1Ip3t<sP>M_NPFOWe}Qxu}So+u%5#5Vu%
zbJjXJTJw~J$%GCCAyM*Q`FsPvNDGcAi|ry;Zv@KzW$5>W`Dv3BG-X_49K$!cWjHs8
zrj6FD@EVT8M-Hx3Gto}DMBUk8siXXhS!`|tZ7!JwDm5l_etpwJxBEW1n;z`!N9hx{
z2>kX*-9k@q(zh<<4L>cWcApYCDk9iJVmFb%J%V2-FK85Egn2bpZe6U*XCM!?@oRCx
z^n9*?F4j7}<@NBq`|XlQ&BA*-Qy_!-)7zTg$~zMWpi$9|Q^JFN+3i)8>gBZ#4-_q{
z;}0jvjq6zpV+P7)Whaej=Qj;bHgR1%a^5;S?mlZCet&s(XI$dc?H-=Dnis8QO$ea5
zIED95QOZ%8_tE4kCaqq|;%&7@;i3{cM<{+ub`D2%oMMtl08c`0O>%4jv@Y@txu<O@
zl6g%yo{ik42r!mpXL8Z8yyJl#31+D|NNB;M`m8jj9>Vj4bKw}Vi=aGn)JlW^5657c
z23&(7S^(?b340+1k<k?UP$X4Q&nzkJhfDsoG~F_?k$Ha_&Os)rgH00MkiUwjW>DUl
zEfZ!sATDk?`$+Ku3lo#sxbL*3fAmSj@IcM;rMJ5rMP>MHTEohNhk8jm1Sm))>A85c
zk&*-*i*k{V6B*E}2h3-S8Iv3`NdrrgH5eY*0zH9^kue_&4AtychifF$aw4MIG|Tf8
zJqcNgO^OXVcSvg1?a`j`<SUQ1qa)UJDp3)4I!c~I+ep1icfQ1kEZ#Ru>ltNnp{jcx
z%N?yzt{mXpeGRCre9Fs*n-}jhAMT2EU3xiFfc<2Y6qgBZY*Z>QuY3mzAc$p3B+P1Z
zz;CCDgrO0A5~c93i|Ni=or}}+b%>5%IiwONp#zq}F;1j|J8(@s0WCa<c2L>^--@D^
zqCkZb3GtGU^A>FUJ?C@`-g+JlhuzcfX*5>qGw5AlXk%V6xS?1Vq~o#WIKs212KdRj
z%AFh%KK?1l+_@Q7;%-Ol%iKK;6IGKN<8ubPqHtO-Np*_TAoB)_cEUkHjI<X(3B{f$
zC6>4p1q)`hj#dS|E3>f@W!Lt#ZspLy9@vskq{hAs$dT#*AQc+=oGT+qxLqMc5;VFl
z#vQ?n(yRr`QQ1D;i}b)pz%kn`8wjtm;8nPqXN&&z>v)bn!rvR`Spg%;><D*odqP1k
zfTm#EUSs&-^loKkEWb?$jyBDup^FMIJ-S%sAEo|E2ft1GMXS~vjqJkZ?Fmf%o_ioe
zeigwL%}*!3OzihLswgsu;;Tu9DF&@&jo9O(iHD7NLI?TxITTLnXVeA&Kr=H1gvBDa
zQNvUlAf^lWSXo3>kcd3Y6$ukMz*T%K7$7g88j7&T)MPxFi0Ug|StBl1nPifd?Qt}~
zjQ8Vol5o3f)P<2aGA6o(aTRxzVWfsyTli%Q?SZza?|@ndZyiqyV>Cln3B?9hFwjlm
zV~s;1Hb%ExxCw(7$*2tld=!UVed#Qg!LxCd%n3>*+a~+L7cS#X&ubse!s3})|4b#%
zIqSywr$;E>DV02~u%Akv`$qLiL3`)ng*$f?uhA1tX<0YB!RkS?J%olX%bC9`=o23=
zpPKFA&UydJ1ktZS(npmLa!78jvyrhdF|l~ewM4T3EQzs1Dc&QzJwJL@D}{GZtVwb2
z9~do3ZEKgKIJkmNm!-fEeqFUII(*qaKI&flc-HDdC-vxEIvT+jit|@1SI*=2Xt5ZN
z(a48wbnODt-HoZrkVPK!I#5;uDT#)khRSB?1(QEyn|&*F#4nDIuwpT5kleE|wUPnZ
z<fFVDR*BDH^YpnN9|tc{7}2213wGeGpR=hva8z+dvpj7?oA9p*7eOWHH%dGQy|Zk(
zK&ii0sojIO^-^oPeDJf2j_8!EjN1wDm^wZ?+9Lb%n!`pjl|*?}cx@j%Xs|0h+}Pxy
zt%mmq8V!FDRgH7UwR8uGp=OpR2!XL`E{NzGawo<;p9%NHX?DqWLV7ywm>6QS<UV=D
z!Q_U+v~M(*tZ1QJy=t4$Fsj@hbR?8D@euLk_6Eg*Il4gh(mDIl-yq~^dvLzTg51$g
zQbIT}E@3SW_C;XVON=RU;%Kn^@IStA)3Q&+oERpLh+qi0mfujlx5mK2;teZ*>a>nq
zhZnF@Y@8ucV=VR<^s19PD;9Bdh~Yb`aZj*KIC*Rp_K{4cK**MmkP`^S&G_*L1bs#b
z!qZ(1LhD>T(8W5?^P7OD>W*_mcU3@(<8xqw$f@Cbju97W$&Z_V`w_l78jWQ1f_*JZ
zlVc(b$q09vz#O3y0B}%^NPPp1++lZl#^{23634i)DWhEzKjiwvD<AEq(J7+ncTlRn
z(gVSBIat;^dBITcMH9o2_w16E@UtYg*^Aam>%4tfmRoH=_Zv==4TC-kjTf&SuVdOO
z_o*8tE|6Y}D>%$J{Hlcc0OT~PX;8mib_2Ro)7I&?_1AXiqJxa(F8;F@ZEtVmm+lGi
zQs*Wd9f$J>Sgo1hgXS1;Afn0vS>YQSl^2C?cRB^06S*JWtq4htV(e({U$?Y!BU!rZ
z2vtbjxfFe&5W_`Y?a4fpVm-1f4JIfXh*$zm>XEK5N=3^7C<>B$<d|T9Ulv?yi%G3E
z_-a>Y7DV?q%%!@PLmMR~#9b#IgvxyzDC)IXcuCjR{M<K2T$xR)fT4LLx+Uzf{tm^w
z6}w`jYtACp#9!L+C?}W+Cqu7Hgzhhn2Su0!&IslBF#2wy4p`w~sy@VNf8L&>GziYc
z<{;fSPYcfO=s2mqGY3(DWwys`ik#Jf`cX)QdIMp>>QnqY0dVX^1tZ6mM$Hk}xHXgZ
z5JLmOPEqz^)nW`%>+{%&hl$R{%}TGAG7kck`7$yMlec*vL7WGVtUH%yCw!ai{sfqn
z+90jhO;DY(d;StX`3ir1@olG({ql?WUX4-8=qzCa$JQu#(>HcXF2kSZi?74@@|~N+
zg7MrE-{dkhhP{(zhl@9#?-{+^(b>Hd9mS{F?1A#FIl2Kcm^4xU#hI=Zm>M#a0x9O$
zz*D%I-YrI|o%q+A7sRHYjYj0aC$yXE)TY*})?+wI^@tHy8dEYUN0twL9m*JL4E@tt
z`ksBYFbweAKasi@Ty%4aR;FyZvRRL`rkE>Zq|Qx&`so1RecwS_89&_h9+G31_!2vD
zAjoAaguf8*;lGtJBEmq)HI3&L|E&8+TfD_QZ?e`!;PBy}PZ$H&bj}8RTRnuA&Cbg^
zuY(j??y0?Mv4U$w071=$D`Hd@TM<39SI+QnfmQy^JALQDBY}eylO(;}tPSYPX5C-D
z#!l5u&os?hJW2bt4bq4pb#e_ydc@R8=dgKVkifQ~7``wks5uy%0OfKKr{s8^7ejth
zOq_5*c7+#Y!>%Ax5|GEzEj#;Ik7?`q`dB<pMSOzA06}Rida}<*QQ2niQw;uel?ayE
zlsYlz;!yt(BmiBH4_6LM+$U-Vii!bpbN6)vG>Z;mF6yQ-sA|?I-1jmr1*|?0U(sel
zRD{Y*F4?4ho-IbTx-m{yTYnharZ%}rZK8lf<rzQ~D~)YQV`#-h1MEv!OBE>S4j|uW
zZS}-2Lr9WM<CCSs%EV*zUP6C%cN}m?b84(stKsA}>s+=D$hVF+Jk~(M1Bi(G|Fv_U
z9&vXEQR}>U@}k8AdNs8hZKSMBl);xt>b2zhRdNUf%trK*;1geU7*ZXT8+wlUF4`QB
zlsv5`2$qy(kvvXc#`$%FL&eRazmfh=JeWP56)c=IMGA6`?7~AM;S=jD6V+Hcm#Y(U
z1P#r;kiZ^lq~>~?;=9*4Lg@<O!E|TSgyi{Roa9!GKg2v-R*|1hOdkyGv9Vo!pY-Q^
zPTB4urz}VLyL6i4mtHdDV=MYsF~T!s1)~O5lo{P-TM|E@$dGISa7A_bgFayB|1Sei
zMy&iJPMaLlhv?q`%O<3YE+{tYlO)w5r;3y9A8g`R8*2695hD0QOx)}CHDb<abCO|P
z#LWrN+W2+fvi8c=@9uaki6K+;8D3!&#m9ZYC~M9P#ZCk1ysqVEb}Zi$ZC=kUCSvqq
zpjpBmWwL|fSVZYI>&9D=uF%X4-k`Win}NdsCxT;&(s!t7*56)P>PW9tmw3n*=%Bz;
zBu(IPi4YIn?{=<uL{pVSGsrU}8u;Fpz^G!zi4H<(?%YpSB#acPLoI$6?M08HM--l@
z1BbyF9oREv;!~TX^yIdZOrzb$qEps$p}nwwS1q+-9G6=8$?&QDXe&y6!C^@Mn~MH7
z+8{{dMBzW7N!ebJ`w{Vrf5`;oFX;o4z=&yJIsXfON<tYQ_v?ppK46f=37X)$Z+`uv
zG&VjePkbe`e(tO)zWWeRr?Tg8Z_5+3+l42#ciF=8d3TrB5kNSFieiZRzCXf;6604e
zKs>sM$-otDdvZxEM$xij%CWSuxzP|@jsZ;E&t{bTyhs7PChUehNb|TyY0T2Or^CgM
zk9EGpkrhM`GISO~e4a(cBhPDUF-heD<DtXbo}!20eKb$|3-ZJutVZ6|)9DB!>}l-m
zp5RS?sty)jv0Z6!UjDE?31-9as-grB$Lu|h+Je%V@*wt}a~9JsD+;&veQ7Z~k4DlF
zYxj@o6mK<B(By*TF((O8J=z@Rp{Bsm94Ad<!;|<F19HJNjuP00CV>*)SuDlrLPwVJ
zwUG=dH597b9GSXGDz@R`p{Ou)&vUqQO5v24=y;paPm-=1DMq3eI95zLp`0Y{v?tct
z9yuuV%$aK}Z!<6^o}p9B|3)!@ZLD|XHsrDtvPf)%bbnqFqgEh+?9!MscI{IFmGX*f
z!5}IeTtn1AXU7Rmb5ICP^YWt9LFNGZav8#JY#cv~?l<umk%5Kb>hOwvC|VY_vP+ph
zGOM<n`(HJ-&iC!J<95dz;YTF#H$Ucqanj&F=I*-x*5O;>)b-p8H|~ki-t0LZo7@G3
zC7|GbADmNSK#<WJs^ZhJ=%1Y^6#Bt@)0Za~d^a!<Tga417>GsZz-e;uPdREeJXCHw
zIg$Q=U8iD{GpN&<=Tn-oW*@#}Kt%Sh#qe3v_vT(UFI0Wd`r(eD(c&y3f`6FYI9R|z
z*F;^zIyjR*;7!@w-EnRqUO43RD1;gXtiqIEP9T1ipm3rJBKYBrBww1Ba?$}xrwG?N
zq=qq46x@RL&z!@u$njBBR6m6oqeJl{q8KH^1TJ$ncpzf|+6n}oEe`2N-r@1Bw-N?k
z@KTO^4-oTi7vE*}#ULwORz_GrM*F}?0c<wpX~UEDGELYpZF@0rguIp33W>@hf5W!6
z$^~!-j+4pN{F-D@b)W}p9>Z2w4J7xsrmU4Xsm#&W$U{o;JsLUi!uk`w{$3<=m6<^0
z2M-$eMx(k<^9BWI)$%~nqK-zc2(c77XF1|6GfqW`r&%tRQjz~UU+ZmDHtLLAzobHy
z_qmGzT}fT^9w@zi{}9qY?*ofCEz)T+3|!V};~w?`|DuKi{w-z~4lZnoy02j)R<re8
zNQNr{E$R+?TPvRAiY<Ka?;(Dibtavg0!}bkQ^lrN$bU~9(XWlZ$THxf=vRruM~|cD
zDdnCmp-&W1h(LpqwbvZ4GdaIlq#U^J9job7?!jU9sHmNz%0RRn{KT@wVr19E<Fm17
zWc>cPg|V@TQIOwZPf}(|N=X?Vh9$%UmlBt~tI`!Jn^MqiHiYA8L|D_0!e^e;8_`a^
z%sAu6%zL-MkX9wsrc>El4Bs4|BK>l4-tDyi)_S{N9x$3!C6fXZh96Hj!-K3OklH5~
z0Y;j+)6r;;7o-N`X^1x<e62TXgq`jD1EX8DoY-VU-%v?hxlGP^3V;o20X)b_$$rrY
zxg^w8Ipw<aS7bSrCoE(DI6%k0SH}~vNiQk3W-%FD(ej2srBTe-?oW*H6c3U@Lo#@x
z^5+ElubI9AN^pml7IbIE-Jow3>ls|Z;_}&;@&gXaz2?dVjq)NnZSH8?F-UAU;<98M
zB<aT(3sz=c%nw%_61QGF)4saCtoKKRb(D+<U$G{vfVKYr?EPzd8`qI84Ck|dMUV1K
z1k&J9vXYp#a)Bf$VVfiv0JN-l{NiZ>O|mTjjX?tvso49szjasDI`sjh6nkd&b8TLU
zMRu=Mz0RwScZI{%(FEeGIA<1`^$)q|NLhUTkeKwq*Tf$Se`%n+@xyu3wxl<Xr!<T?
z<Z~SZ_?Anj1isG<l21wz&0!aUx-vC0Xwp8J`d_12tQC>76kRQiV1^m26tAjPx1|GA
zFM&`eZhnH}NCp`r8uJ4v6(BiLe{Sfo7)K3}D9$gAH;NjYM_xDU*9CqabGJQq9X)C-
z$$BdPRyl5k%l-M+5o?wzLZDF0D4slLl4!r+<O}~7->*;1AO~O65-4)!A;Zw9W-2PZ
zjvmiU6r6RU!dS1HhqdER!>KAZVFgjRpD^J2SweE}SgQE+zt60PEJ_;?gMwpD68UCF
z)^5Ssmk}&j|A;8Il9{UDRa58pR%N(ydZRkqcGL5#{FAYE)kGLn7|=MJz%38!zk7wd
zzqY9ro})Gx-1l+wC{E&hi2$5Wp=rH>rK(VqYqWfS7I2^4ZTo=kO)umpvuu_;sbkka
zq;!&+<I=Cq>OY4i{k0`0jL?&V=!!&*cL(JP&{4VKSafR&)4}YKPSzFuM^N_T`ocKc
zU13~u>l!iWwOeOF7n69prh*_Zd|fz>1>=DaglKd6zCtJGP0RGXjQQ3}FgxB=UHa-c
zxsF$prEA`5_HLGan3db-JMI~90$wL(t>Ui-ylYk0Qpyrs=aRiwa>)+Q>;5uct~eua
zd1Yt*KFV)b%Q1E9;gFI73aGI=z6=d4pBbcCQfBzktVO5wwUMo}414=YiNTOQ{PJzo
ze|<SP?!Gyvk?Xg<Z$H}F<bre`Nxzc%Z(#HBN36L1_-L1;6(`xEuan#GgME+>HMvWd
zjoreUv5w~a3-a~dYnZp`(sp#j(#s^f$yt+Noyb{sSRcSMyQ^IC9#Sp~0M3^oCz9f7
zx9cqU?AnrNtHmf`P9KRjOfo{&V6zOvaqLxD{!}MqozC9bjPT9qHv7PMp*CfvNt$FF
z#WG};2y&?gh(P1KYPp!d_vLTJLh?Gd=eyOHlQUG_%(_Bm8IiyOabEYOedXFGU#!}!
z2)Vh7{-)_awnuEk`Z_8G4V1R468Ccgnrr}?Rg5K5%>-CH!8~`e%B16N<SO|>)N^af
z`~*y1R@gb^fC%pDqxP4sKb!vGYmEyNb^e59UE}=3>OiB^=fs|~K=iU{moO*nTT=j3
zuM7>_|H<;BQVLlei$!cY2A75lg9rGL+|5L@R85MSP>bpY*eQEB`0Nvk+HO4}KJAGd
zG(*6AKXLk9Z)X(a(>{UdGOHlDUnW@<>Q=Xt;6D^@r0~eBXA3G%R93@>6lQmyN@LHX
z0mZ=MSQ87llP~B%-yG*l@1$Og;IQiuXv&AWJBA(vPAlC<XWj4HpB-^!E{-lI(($j3
zB|?msKvuG5KI5CV7#Rclfq4KJpU5tSPm598hliAa2R%MY%?5~};%^ipRvsSS?)kFN
zUH5VBxu{zXy(n%SM#*kxhFG&XA<k0JuikUEBFWm5oAEa1p1FyMMw}Ojs;QF}U<}Aa
za|4I>?Si>OYW(B*Px`D_Uf1xTwmZV>D5GFBYr-t>`ax%6m(1O?ts=kDnw#(6vYHFI
z=7K8E-s5gs(<zNg<s07Pfm{Yi?w(?qxgFw-dog!ZzVyFTbyI&%uQX?IK>U$+TcJ{L
zvz2%idpvyiZ#)p1@x*3R)U=MX@~W3s>P3k|@lki*qYD<s_0hLkz{=p~3A&^=rq4ny
zMxS;~))2<6>5-*oE7`}~mEJY!T}sH)_Fr--nW8^88D0e_f9yG}oLwMzJnH_iXPPJv
zyds`>Qa<iXHHRw&P|4O&+j=M4&r#_D$W-aFDj(<N+e;R2)l(Zi{_KJ1ahO`hl9Ert
znye%8&-8!KYE&ms|7-+m9s9CO?Iy)HLai6mf3{Ac<129q^;-Gz+p@p#Bk%B^#m{-|
zE$-Uw-RAyxyo)uezt+vqXI<~bHu%p9;i$!RVtzjH`uD5SBH_YE*$e?D{@Bwf22#%N
zuMlx!bxq8_V3@&jC0hj1|B}<jKmn}fwvOnWQVog8LhPe|{!8qt&r8XCxbuTKCUa(l
z(}9CR7%mb!`C|9Z9s1j<KOSJPY@BQm34h?dQ~KX}Os>0}9d9P1E2@!qn$WhXjq?>E
z|A+8!g{a8ik$aO5{cCL7w!K+sITfxHPFpqMTtxQ5(>awST6*1VKfwD*omvfz9^qv*
zjoz^3gT4Ad_#BmuTL#A~1y3`MmjQ~UJbPO3yS2;QW(NNRvyD`Pf8=T&xR+7OA28wA
zs<7ceX-|z`Ta67gwia>1kE!&Juomn(4^<K4j;#Xg&ZC;AW**l<w(~qxO^rRlG+Pp4
z^U<$+mo>-P%ZhA9#YMs!R!D4AUXL{vp!y4n<5blyq|qZh%f<V+N@;4Lor1I$MxO9?
zR#44}McPa4&tv2w9LH{StXNc(fQb7BOmmPjtX?$vB<&p-`#@mW|Ca>@L{B6WBsI4o
zqTpc1SN#w1{Mf+9H8#Fxb9L_gwhaaoN1DLvh9gIjb$THl)$EQACs&q01aa>0$J5?V
z7u^dKk_(?pr5w5`vBL(&*Ngw)@5Cn6u^iv`9P6S{A&d0pcB!XNKQZw+Q<MAl1EBK4
zFjxcQacx?g&aSi2F~D^GBwN6ec#kAwxt}N22goTv;S@1*YVc<uH<$tNlM#Fps*KNS
ztjCoR$0zS*HYtc}{p1w6U`3lu=7TD=avqL`-sVklgwiuTP(jpzuxP$9T3{R`;8Kv%
zN?NRD9JrwV`<(sLtRN2Zp2i#`fh2TEVuGw;Be1L^a<fU|P+2gv*k^oCZx^7~g)U=5
zn}j<G`Og9=M=ivf^7QzS9mTw4f`B@l#tU(RWc-AjdjzhNgp9?6d0WdGjon9lEM|6)
z<SZ(ntC{Yv(>t5?)Do~k6b2O2ODU*f;5`fAz~Ii;7*LG=(oY8uA!sZZ(P2u?0zPzz
zFl|8{iYJ3$j_sMW3)a{yc^CFv;)T6p<^@0em@2xG`{i_)Wyk_UpSWNCY5-m!mxk=r
zcy$*Anc2pc5qEo;=!97wAgt2!{o-?Q>E^`e73_j}^6fC|q~QPZq6jv*wW0Fzl;k3e
zVIZ*an!AXEkdbwtwOe4Bxyqcj#%R`5uHlpMgP*gK`X=5#3^%s#2UhVbFRL8h>YrW#
zmy?(a=$~Z@E-A53XlNX#wEVtp49&~7-<Ey9EqGaI%D&$eyf3t*^v#e=*bs(t{@`zC
z@%Xm`ZEi2RD{$TAU*iITn8*1?%_Pv~!TipRtrExC@gd@r4DN$0h8VD^DVsDIcr|rd
zCV!BqBX`P3ruGlSVlP*G&RyX^G3}vc{{yvkK2K&&gv~^NF^d7GAuZS(7oFYoO+SYv
zwYeCz`dY2`GlOt#yjI7V_{NIkHJYCQZI*gBf}dTSXRambOgXF#0jU)jE6%7P$)`B9
zl&@oN=xKK7zV!ui!(r6ThR-4B17#0vORTeUp`V-^)C>Y0^_s(KinOy!ItlYwxu7_m
zD6g?d#4Xzr*SX~ltF8>r_EpO|&}Py5u`W>rm4IH$IFGI)wf`WgeULI=tblguziD02
ziGi~Z=bUAIcvv2Qn8a~E-uL%Xt*Yj0>y^zB!}P^n8PiWp2USLrl=lCtilSF)Qq!#~
z3c@6WE`B_W=AKjYTL2!x$uPRdCy%jSKGr5mlTh)&JRz26{P-{GRR;J~uhXTAo;t@j
z?eAkrEh;a(oZQ@wD@Lr(ODVZ!83Z}GwWYthFFiJol@M$0Hvbf$+}DBgJ_Hc@JEUvT
zWUo={qVqc>V!`f~Xa|*g*QW_Ws$~<b!uJ+m7!0;AsjY+alNj*@HGNKN6Njd688ing
zvov4|JovGu)z(RB1iq!{8!$1tP!vDJ0ZyNstbm=VA)|og39ZM5afNO=^{El5f`bxe
zj4I*EG8SGf+62d)qk(^(CQBE(V-@`-AY9ztR4c7zScPbBZO!GR08B)Qb=MGe*#2+5
z+>tQKK<e=6>`N2+lE|tkfvyQA&r{sUPb1E5f!s8PNPLxNlhqPT28kUkd{K+0G}fsc
zBqEYC^B|Gh;e2Fl6O=gt5@k9@)Qf=7c@ni#q&$>_s_9u8(dG&{`yB&7jT2wNyHe91
z@SQ{hdz-igWky+t-iIT3XXWggC35hH6$T>VO0ramAL=eFX|t3(QJw0V_zrg4PnLa-
zJm?5kpP&~uc__>s0q$dwve+@qkr3U9IMW!n-)$zg1CyA8jwvZPT(H~yu9KohC|96{
z{5Mdf8_52n(+<wZvsQo5?rr$@$TR^kf=SBma<aReVZRm=Jee(mrKbF8uunLsYHN>q
zxJ*kk3|d|Uaud!JYq61T6GvfICNl-I=zTVcm+2(oI3~BKoT*^_@m5gmIA%xN^fz-_
zwEC@!;OaEN7v6-6oyL=S8|7tJI%YgHX#LdIo@>a!`d4tgTDB4d+QKr|49n95>N_CK
z3B&8d!dx+8S1!PHg?-b=<LhL3FYN!u?|I(7s$BPW0UbMcQMX#WKuJkOvB>7}4Gb0X
zCP<J#)fKoHYOLA#!W6Dq2dwCpr7+F0T8B#|I|Td&$v^5CA%FCdBJM1krBHN*<vjgz
zCA7XOlRZ7QpCG|OEDITMN?y@^eM$X%dp2I%F8zxRs(y?RDjP)lM2c^57K6&FYt+{5
zA1*q?Vl|b>_=&cy8G3`36y$<;q3T7~7dy4V`2u?DhSWd1w*jo8FUIc_Zdw-CMPc3K
z0+7mwVQx`JTHO<bb+W!qJn3WgfH!q?^WX%A5&-EsoFl!(r_m!SSM4LzjH>Oc`JhXt
zYqMJp{9G)y5lnZ4LxHZ}k0K92_s2%Wri#r_ECK(KbE?x9%-5vdNH2>k0GS=4n-#GO
zv>g+#8w^F60#eoCKCzlz6TmPNkT2O%tg2YR)IdPvYsRBRJ-wlmCf9wXglvQ?Z`|U%
z*D(#nBq#F9n%2b<g1;EJMKh5o+b(%5oTo9Z_XAg9Pmx|KT;P;om3Lg(cTl-M8D@Ce
zr(;oo=xHsBiN=aSAl*@xE=5biHdxO1GiAI5PTRe0)Bdz|utnG*qRD85i!%05QYEcc
zoWC=wDD#yd?H=G;7Rmde$(cnjhep8u)@LaSFN4iiU3sstnQgLKo1sLHhbG3ax!=6#
zbuU`4T7&kGmg+C=FPP&u9`V7tju?$(QahXFS3H|?U<8g4x}WuAv8wWSK2-jCR>R&e
ztTyw#8G_WSw%9ED;He9^(l-c;(d%^gAYfF&lgINoK4ulQS$;FcaFZb8NfwVew@PPe
zxAquk2`+%jWZqiCYlXk`6`n4Xb_A;JbQMSWXpzn(hM%TvnedqeLk$ZgR>NpCfeafZ
zX|TNNlBN|?V2?-HR3j^yS=B8>RR?1#pAq~8&atT(F`-*B$9g)3hFCaOLq@+Vn~jzi
z^tZgZyp0vPn`DO%Tz5j+%?q<-n&+z|`s3bL`(HuR`HFVy>MAr*E~bU8>W%&?9&+B|
zAmARFWS3Ktitqx;XYri)Km%-7J4>$1?hx_1Y9qZQ$swm|H68N3f_QLwHXXz^XM_G)
zK146rZ{dR~300J{>ehI~Nt;uK*HG)qYK}a)CSoX|B9ao;tS|b#v0)9qcAV|HaL8%=
zd6V}x2Xq=8vb~G$#p%Um|1|?Vq$Cc<i>3!Dw#oVqVvXo7^Gq=80==3n)A>ZYoi};y
zr8cuK=Z&2Nx@sojqa^~3K(P|_gt1R#E9PqCcFc#1%#+>gR`xjMRqSxfjrXT6itF?)
z8OyTJgP@T1GFU=#0u|QHiNYF-Nq-~>=Zxt}Gx+jyf>25<TCV7Hsu>QOR{XGhv0?RU
zzVzeu--E$tOz+0~bO8ej=8r~uvSCh==!Q)Z7GIO*v{o$jV-)pJL!(~u*%M%-`<?}o
zJzUNw-A^}}`budeWt3-Aj}KCiZ({~xeg;`Yc{TEylEmP~q^(GS6W4p?w7wAEMA?<0
zSDOVn=aFLpPuR!G)~mezK8>Bbz$P|SOk3fe^D}Fm+;ODXjx?cZwlD)|2@9ZJZlJ`y
z3z;rM?^MM&&>=npw`x%Rg&#G~b6BKsgy?*Uxl|0Famoxej!a^`13eJ)TzFv*-_gDD
zQN(N->lcQRP5E+M^JZI0P6kDm8D&st&Mfw+4?XGn+hii@!+<$+CyeFGjOmtp$Ed01
znvDgY@Cz2rZ-p6umsE2bmdBPkH*$Q#44#gv4!|uPZTAUpO2=Qafv|nL;i1V(aW<>P
z(l#-C^2Dd2z*Tltz#DCQn!IS0jki5Y-ly=ua1-KIqZ;I(qQG)oq&GKWrUVWD7Uf%r
z+PQOie%d+z&ZQ-o@uj*GEGlu5^Ot5YU&ZA~U*9c^uZ*YU(qN^mRk8*(4WRzs1I%Cn
zo@qThSkAPhY~Xs{YO$Kl6s)eqWAQR;@-D)1G_XjUGBw74?dwxYbH!)6r}FyRH`&TE
zwg<8e9Y-S;86Sw6^hlSYT;yJ&Ud}4A%8@{nisdZ61_HGBka<nai^ko)a3hJ?vkRwm
z6dy5<hw?E=Nm}==18{*&Sq~s}3(?TbtZL7$l3;!C?Ar^tSjXF}vF3utB~!)3dCJ>=
zD`@`qf*CiKaZLLh8-2{P^Dar|!8M4vgOP!AMA3C@`-$tt437_M#6l%VT>(Ppy@l_W
z@ndLOx<T&ea{pLz>Qd!FHP1~(mJf0+VH)j)Wyhx5Gery~KJQ?ChrR#3cvo4shWR3$
z0^U`*AXzYO;f9&xA)*~|r!LTz0gX9HznqU1{q9`z<8fo7YK%Q~qY6zT6Ry!B2BMmy
zC|tsCX{uvOVC$lTnS-bLJ1<RwUV6Se<!|_5$d0ToV~7kMof|e{<h>+E#FqG^@qLM)
zeody<jFME`J?}NV!k+KR7U%qBl|G7It**hcUEN3eT&@~Sehhpp!$I68?8D-8VfI8e
zDKwM~^L*e&R$gE^(XeC+r)-=F7u*w3mVtM7q^Q^I#UfB($xM<gyE@WBv`WtWO&uE@
zE*YXmIAELRbDETw-9Vjv^;LWDUHff+*lYJMPY1)!d1pW+(`Cx~y<B~8GXoNwv46(W
zZ0T@#sner(ZvWGTzKBYm82={i*?Q?W1U~_YoGs<D<(YDRePZAJKk1uAF22VHy}0W@
z?8fHyT4ORlzO-~uyc{Iqee&N*->gVr@Fsb>kR)FkUd<<4I?`cjiX2LWHzYH6Axx{#
z$Bz&&s94aDrcGN(SDPSr(&YF!wv_=Jf}oAfRnsy!fiplOU+>uP4>V4aYBwHgO>r>I
z%mxMUGfk$W`F)|Ug&}tj9vp<y!r=w+tr@*w!RVptf6PaNWB1>YhL3r2CpTc8<*DXw
zQZdW2Ny106{S${kg9T@?M92CIUCZ+g%gpH(zQhcv+H!!}4L$ytyE924H%HTPQ&>D!
zN6S`6tY<T-JPUkZtDl>kDQ8!j(v<v2GA5Vjm;LrJYbG~5WgvZR>!s;|qUHRvG{~it
zs^0MK24jxzB1{crbvT?gi(j(lQH!BlU*dPqQf;y_HKh1f6f|+;OXH-b4XQje%_(W{
z$hm@zwG9Yz-0ipAApH8Jz6NznV&UxI94E!ZK)Mmd{m3RjQ~Y`GQR8^wiFBIILr_2O
zlCfqB2zQRSb=X_FF-suVK&D)z%X{aSv0>y}W`t-R&EeWtq$TM7T$A~nyy%{OTgZvw
zf*{~mQY0t2*&?T@@)91nHp^wf$;Mbwkh_E+j+E7tMAoyJm@^ZAS;{46d2yQVY_Tj-
zgSL!&2{jzYuNERL{kfE7U|bf?jx`7hUgi8sD18&|h)3;=>K$T!YN4b9TygQ+zgngA
z6}TztNQ{%wBsKz#J*7PKZ6ljW>ler+v`~!kVxUwN!YRo9n11;sj95SWio0@$(|~nN
z3$7c+M(NgrL};iErg)s{l7a?_<Jx!FnC465rlb*}nPaj2$I6@703h$HUWys!x16pe
zQK#up))&BFVizOF3MngjZSrB}tQ7;H34^X0Ax6r1aS&ikonl+EXzBo(u05r-_SABr
z!jc&gtI`8bU;38@^P-a0CkVCl2bfbQr88sHtY(H+xuzxwZaIz(F^{&?onl0T6hwll
z4iF1bSKZk6HA_V!9gugltmeINXTqt~co)~+meFTjm-Q#WP}%74Cge3D*3wtWQX2sJ
z-={H2S0E-<NdCBfEO1w4hPm#e92w8=sM%N`LlS~V6-_9WdBm4XL~2=*b+mMYpBS_j
z6=P`emuJga<n6m;tw`g~ixQ>*d5BlH{rU)Bj)2RojaXz8`f@>=Urr*HfUh$cdi~Hs
z&X#-BJv(ciA4fj|`H)Kg6n#VccMJ7iM&HmsFQXr~x3_-^eur!HH=0}UrS7xjhUxv|
z^1RbMFB6gfaz**utFD#$gKn=KeWML|`Drxxq~R35H1gf+{OQ+`5)#L2D6qum%RCmH
zIZOiVzw(rxv29x_n{P{PDZw0-C2x63uLS)Gi0r45(1%f6kfa&O#9}dBAdjZRu`ttM
zkK{cjV9y4|SQCFpi7E5CCMST`+@>b9u&uKt(3mpP4sVmsWWZCF<1FJXPEV^TSlwlo
zieG@&w4Z#JQFsN@-EVlbZMC;sT+Dk>4_=3yQEsh8MpozC^ulF^JWzwUtaLVC$-3Xz
zE{M)Z?+E4xzrKtb3NPc0+s2NL*}o<tc&ZDIPq#A{{f)o<B{hRr*yH*9P_IyKl9dk4
zK)1$Y<`*!cj)~wLg_t6*)3l#vKjF+^&gdsIW-LswtaT6}UnrUzr2y>_4hsB}N9D^#
zx@iW_$DMPX*NQ~vr*KpPF00TrKH@N*A6GN#0bC&$$LaNTAJxtN_-*e^l_RNssJbj{
z%DrZ^-;AC$Bl<<?3vGL&R5$#;wavTS+WiOHoY1lK-`&s$2lufT9}bg#w>K~+ieU`-
z**D0Sv1RWSy@Ggg+NU0iUPx<A=Q>m2w33_;HI_5pVE@K8bWg7;F~_p+A5tj&{d6m4
zTV}qzM`Fg;8VV>`ty$?NekZeZN(YCR_?q*}gMH>~t0{7`rPud?<ne@i^TY@E;+uqe
z{QFF<$zSbX5lwN#9`ca7volx+-X*g8_#<&&aHLwSklYuS&fHp_KV+Dx5t~#^V1ph%
zBKz%eZEybFB&yLk%&VNl3%bEUUKWWN)x&#(?170h5g%s0IlnD#xxk!bg*TIJ<wL?|
zWDavt{13&|VW|d=MWZ+f4T1-Zv(rmd5y!CWclmbQgPLH!@Hv;Wlz8j+5FK@uN@S9k
zTRk^<r^VP6s6bpqpspczVM-de5D=di9+5LlJATJUf5cR{s{ed4NvG-Z3C-@WP46i!
z1bVg?JiEFtJ`$z>?ys1ywpiXu>BoNcb!E8T_T_pLP`We(rLzh(x&v*CfBtEkCq)gC
zB_um@_4#OWL4M&PrRwZoP}KP)-RSv01&kRP+)6;Zpb1ZSI|`m%`sJSXzp5P)%_?E5
z62T9zUID&(LM!5lEE~x;LTAuyC8E<L%jRXqbJHM2tRyB3(p{2^$h-*+<!0g3Vh3Jz
zAgdym%@Q^G%33zAj&NAOBv}WXIOn6fq$iVU_D`t2@+kX^3k{c^9PW~+pjkCB1#MKF
z+DTYMuThU;kf!Mkk}?0TCp#bOd<Rx(-o3*d=W@=7ee4H!MN_civw3PKK(12YLVCx)
zXK+4TExj0fv1!8%mc!l?hj|V?MiIjjYhSZTyeREwZ2A{#HoYNGzj@Ge-aBOlr{v+|
z;?Dwv{-9`io0-wT>MFfd`HC95#pND%43t*erwAL$ojqCz_|oc1D^_!`e);czU2pNK
z-R-rGJC}WyaPFe}Xc3Q7T4cm-FQXsdbOx`FJN>~=@++{$^w*<qw|7jxxB5rF9Jl*N
zKY`l1pC374u~=HDp4|SdDUsjt8U8zH*5TW;_Ss>(C+><I6d1G++@`s!HPT!p|4d5#
z{`>f$4SW=AKH-T*E<zCplQ>2d6y09bgcKUG;f+J}f;IKknoTG?1ig}lZ#SP?<DQ?b
zG3aQFunC9DIjSepyN<6Y`F)IRMrQPzj;q4YrhyAUqg`N~U=qRqW?_`=vSr`FC6=!o
zd)07U!92*dY#pLw=FaUbn;D&Q-mh)1N|+C?co;P!dxQV-OH}icySX8NqzyV)Hq13&
zJne#MDxE;7AL8%dTzX{FUDfa@V5XzLMZ3}0(Vn-QzN@f_jNtVvLK?DTGY4<I=z>_I
zX7KbY(OG;Otio%<w}0V};N#D`^_r8CeuV$p{mC&5>2*UCOCcmMm)moV#UQOWJFPh}
zPmlV1TKvej9<-o)q88nM`ICQ)Oh&)w0din}-F&2=R)5O8aVFZig{w9PV^&ZFda_Bt
z8koiL1jF*g$>-|bq{1+uG`+XmB~91fzjPom6Goqda0Kf<-`BJjwlHA9Zm!y|2=>d%
zkk!T9V70tG5wUEEYsSk$x~p*EmbSWEtLc~f;j8j8EfuI{Pi@oJuKC>udECeH3v}0J
zi+f+$6VXlF?Y)gI`>j`PH67?ak;4B4sxE%Ac9$5h568O_Z_L00MLyJK4qN5%O#$ZI
zw-3oAd(%`N_C5b){ro*{)^^Q2{m^T-j-wwBPrFCoMc??)8FWf1JM|6oQ~3K;uX}kB
zeRH$OR&$8Mbf7Jllb0S}CXlbp=?(Yzzx#aH;kWasb4(BEKk|%zIXAO=he(6pn~@T4
zq=%TP&pqbyBzfn!4SUY%h&+kp;BZj~7A4KmcM`E6fSEXwGO>|GLV%3UKE|;N{uv1d
z`y%3*5=WNzNvM?aic7>nnAVJ0LOjlgbhB3Rg#Y3ZTzM{XjAZ#}O%+?d4=tBTj8MEA
zc=fM4ba@&7Uc`B%D~LlkwEr8>pJj2?$cWD8R(&kS+2aZ7?3PJ})1HP`NA)FFbrEux
z>)f7-i3|O2Dt@t(r0H7r-*5S<hsrM$DGHyf)<nfJ;otu~+840@&$S`qzaX?@Ci#sb
z#@)sf8&i`j6u+u{ojXvlyZs-pu)+N690Pk5cnGwu%})JS)CArDed%rGt)kvw%PY7g
z4992a5BiggU5TiPaQ}A)9b*|^-77TgkpkfP=V~VDS5kKBiKA;cV!H5XcI3KBfR3Z6
zw@wmdfYW?}2vYBJ*Q?1FHrRBLppfxXGx&SvXqTW+_&lkmUgIM5egGK;%w@kyH4fZr
zFp*kt)nV6bip7<pzXll%$R)=E(=W)DAVw)ov0~OG{ECOnIZZgmUUgURY{-Vq_>7A9
z7Kn>D_L}~}=%aK~C=@I4X??Z2{_(~0pQ>JM3bG(D3D^%_+7#d(0(v7`=8OP4<b(D{
z(~O^R1X5>6(1b00YtJ!H(wr~%q5ONk5xLJ8&u>$}qEv7J;g%Y<pD$lVe<5Z%+P%BJ
z4h!;nwdMR0>I$v}zua$@hKISkae(Bwi0?Wxjv}b;{W22>T&3DH&6nKR9(GXK6)L{#
zG4kB!P!6!G8C_Th^51yEHq;?WpL*$*>=Fd<sV+Xd=E}<xL$p^_{WzICvih!vs>S%)
zVzi3K0C0mZ*HkfS!}Eam6Jrr%Fc5XFqo*-ohMuaUA2Ez3#!slGfC`}kw~K6+t@6pe
z+jkfXY>1qjm!HM+28}*(jT*_q^?VPo-~peZB?^pr)L7Jey2W=V>=Rb>Uu#e2%X^JN
zB!c3{L}LKfOo!l9hJemUn_N_aiW07iJ3-wp(Jph8A%uxuRU9`bG^V$WQcrmdQ0v>8
zt*uLN?e^C)2%d@W&XW%&_MLWHp49CccV;wq0}m(-yLhOUiOHy#Sn5wxyJ_)~G-gT$
z-QE?}tya(s)GF)S=v`Sp$1&jNNbsuVIf~V|+KN-S1~iLpJw=)kV#b5mO}#{b*CKX0
zab+}4x)OfC#N1}#Hi3N?OKEWQD-+O}@rhq~D_9{)niZ6h;dBeaCIU$57pF@4*)c`o
zMPZIzi(2#>9@x|zhAC_O35{v4U4I*{3JGOe<H^f!pV;%$+$fT-fcw3*#ZI1Bw|DxL
zfH&rY75Fjq1$2lGSFd}3e>X4pf|p2*SYVr(v-(+_8w6fD$Q0ASU~X<0dUVR0Ux#$)
zZ|w)?J&#K^*9Hgt*U#>(#ns|FrB|$K$D$Y)8s|k|QBjw)kxStE!5SJTlZTez|94iH
zET6}-LIq~xq1CCyyanm0Cxb*?pS_6iV{^}V`2u!-@*;w{kdG-9zWUji9Ui$N%V*A`
zSB#K({D9+ofB3&YpZCKGIFkS1jK7mFMmsl2wtf5Ceq)z@Uc7jYfA{|U)vo_9|Ge1$
z>JNL*_x4|W_0^yEpHaEJ=P&m5{}Ao|w#}&iSs~auivF;=qD8e@Q|^KH|A+qkF}<b(
z={gz?U$wi#*Tdl#f22QCVmRHCFaDU$XdjM~=!x#i+b1IN+ng~X<7?~_me44W?;WG0
zxoaRx8+ME%?d7pX&nI+3-}1GCv^{8^s*8#81xGB&Q8CU|SBwQWyGfTTo8CyD5+7Z9
z2qSFpARk$e9+88^Ie^X-`!PC?%gtzU<5dnSG;Wi7cHoQkSF6#xWSIxgFl73jmQ?uS
zkI8JDUjJ8~W~KeF5O&+6-|ic0_y6AR?z8><!v6p2`Ln(MyZ`?yes(Nq;Wm`8>i8Yy
zt2yFbS-)kIpm|U?>?M78iezbjir%z31LKyBtf}Ik+90uWe|Pt<Tl>3v`^~5yPu|Du
z)7Ot@*Xbms4@BR@vt_zSJ^}{gW{R99<BZ|%I1Z^rye!iKFUlv6^%iHjnOLE#mCc}x
zaQZNX^Hn+nU<3TzfcOSskGi8UqYOL6xW0nP)D*wPWHC*bh`}@-jFC;q<-0yvbs;KE
z6QmK`6bo6gZER1{Mvbzu!lx3G6DxNfUx9BQ*>MAA@hE8;dmG0k*^D#ZhZT3mwTiwv
zn#Adp&gZ(O&?mh?F-@Vaj#s0ksx_t++NjTJjm@GUq{i83<wC2e;*L$XHwE%t8c%XJ
z`qr_~?}+W+xdONN#xYT;%rf_sr@&xRFpX@H8_+tO!gj0yn=;N|5ESs)DKcis@GKFk
zwn*PQm@qiCX4lIPSOVUn;uGG)na&q*K?1JuGMUNh%5&`ji(s!i{ixqP8N6xr+7bPJ
z(d&NSIc^_Ehi~a+J38uKyzO;fy&gobyQjzPUOz&3;8FK{(CZvt4!ZQ<NvlsapYV>M
zcdhfcQTvCBUc281eo^P_;<Q8b=mWjh`JmJ8H>1w^(dp%J=loSOA{x<ocMzR+&N>4s
zHt06-T?Se!)r`6)(OJ89^qT%`9d=GTgSY(2lg{8ApF5%NwW5nwZ_qiqJZ<%&i_6|c
zx6jnjzvE8-=(N>2Yaee@8|b?cCpL-tuUn_5h3<CWoVR=EK+xAirghqB9iF!3bJW}8
zPOp75K)2j)M>L4k$WuCaF4{*O{L=oRO+9M$-ZqJ>1Y4f>+kd~La`ZkrZk@GWQ6C!*
zj1JAv(PgiFhK6@fICSOmus`SwE(h)CRkwT0!`^TAzV95h`v=i!x6cE2*>5-LBZC$`
z4=OZj^qPJ@yzF-{emv;sgLbcXc`@j8&o^k!-_Qur7_?x-=CSUcbDwFj;6y=mF&I1*
z&FIbRHa({~KiBRJdMykGoNbN<eo6Z30HHFjv(b6`)oJHd`~0Ylw_Ol=)9JT2Wb!(F
zl<COF-?Zq<m*_rE8nsP+_11Eer#9-GM6KiRJ7~NV1~pm|{f;gldfLA{daa{xw#9FV
z38fTU7aem(^L-}BTMf>k$_It!kYFzfYAph$t$&;*GGTZPDb7LtR;|JmB}MGhEBy16
zanV^vsJRW5?hsgqqeW)J@iljvZI1r!XHcON(`bC{@ybrOdmBJMc2Vy9>2i!a`)5s(
zc($6WD*#Z^KwzH<RDBXiSTpLYh2E<e9wzaONz7NvpgN-lxM(YZ&7Bo<t{Q*_JvBA@
zfC_NN3LSiL8tYGzWKP2a7l$QBGjPAJ;?cXNL9$dbepVmGG5ya~LKmJQO1UV9ro>Rt
z#o$bbl6GQK)DVIxU~xVJgvEvCfRCQSsRhjQQ*GO|01<pJy)vMv4716uyNTc{82{;Q
zMpS|gxUdv2&vmqw5-&*>rqqGiA8@Pev%@?z!;D!l%T4=!X$r}@%V}gCGOUMS5e~kO
zyikZ13C5W3$MSRwm<DSpUCSi|&jbb*n@(g`Hh(C`84t2UzvV#98+TXBpaY8JNZV}Y
zHUaFqVqG>%T${H*EV#l@xGlXDIKHT%@z3V(Abrtp6HCB*WtT9cmGb7&@N(V)uqlg;
z3)q0MMotF+ho-Zfzrn)LID?Snp}wwQ$|Vz3h+M<Rl%@~_uX|rQZ)8%|53CCE+G!8E
zr*Pne@VYSBeaJ!}UXx^?+<HdG6?^(9Suk^K41xm2Eyq^V9KNa-1ha>r%b@KR#?&oY
zKd%gPeQdED3m9Ide#3i4NA4uM2_I^nk?`R(BR)Bsr6X35uzwZkNvpJp-5HW3+B{R#
z_=K3sMUX5)ejO{gR|Oa=;}nP~laZ6KfxJJLNRF<yB7E&a{iZ8Y_Ic^9OhyVJv}v5J
zp^r8=(k>IR)#&8@#?=4>55-jBI@#Hp4Y~f6>g5QI+KiDNZq00_hBW{K$1?3Gu=Vn4
zp3S#;fw&B}+Xi&oy70MoET^$#04iLDRZc(=Ug8v|&Oh~XAPX%E2eAw~Z;dBzIM6_>
z_M41Wn1WGAmQsmh;}|^LhO=yJb3999w9f*C!;2FI9Rjn>9Q~v!XSvCn!0bON8l)`*
zsB$g@v*kgr+aR97=Gl-IA(WMS)MuyA$$hX1?M}s3mpfBpX2&A>#gj;qllN43{qThb
zSa1phT%7D96Bf5*QgyiT0b{kBUvNC3@nM3A*VZatf}LYH1DN5tRyVPN((dXVe_2#^
z==nLOViUh%QVv*fgHykqCP_74NP-SHji2OB^+Il`iPQ-BWtfgFvA(!nqJiu=WE17i
z7&?(rph4zWZJz8kJ}TTzWrBX}LF-OU$tvHSsq`LlX?(RZA1kT+lw5FED}s_H$+P#D
z0KCT|64lv~E+EsArA08a9k*sPT{vFEUjEKE!M}FAQwK*4Un3r>=$Sw;n=|586Oe0W
zMKgq}*#z8&0Qqtj3QjCjkpZkxpDeB_YLI@oMKJIhwq2px9$ESV;@XBW<k@fk@@-*)
z4$OO@@U2if@SQIT9FeiYRlglx-48+GN2c?WDNLJBFZE1Oh826s^McYA6#L-WGO^@a
z<1u#4AWkR7A}a9CrUlJt<QWaAXZjkIhrFr2WkRPk#nlwN>bw*d@8pa#8LKk`QLh@E
zAj+*~xG&o05OIf!t`xfG)FnueoRW4E;)K6WXK8-RNsG!HjNWe6=AkJ-n0d^Wbnsb7
zy_I3uh^r{Lnv1UpV`Ko70tIZYXc0h79pN1fEfqdoUTM4Uq#1o;p7QQY`F?)`a?U}s
zj#jxoVCwYehRi?XbJJn2`F*%Q!_jm+wBP?0<8J@@(xXU!7;1LCBetAz#il8QVTne7
z4`G?I^8-Gu7_FM2a!0f9ZWpWk_DC?tZSLr%*N|q#haF1N>6#(8U#ibiXTaz5P^3lk
zq-jQEXK#1c`ODQU#Y$1wmQ!ZOiN?j1=nHB_`V?Fyy#%~m=E|@Mv*u(tvl+_EK1hXD
zDO=*@M)}^=)XH`#>O_mrZi5dA20JvzL`kp>Ja;BDJy}k`dezr)r%P}{Q1vkLBR35s
zXIn3s4Lk@A!sBFuZq$CKIhlp$px!>;M*q7g-FxmHlIoA=iufC1zgUq@{GV9?{;W04
z4d||3cR8`gq@6ruvD=PXCKyF0ssmz&OpBJ2;Ivw6hfm7g>tGcORTIsp>&x&A9H=1L
zbrsy$bJ0<gEj&&%{lX}jYqL0wl!EBUng1ca-!8`9R^8<~l2wrt9p|tei#ov~<2JpU
z1dMAXXseFZg=`x=JaR_qCzi_aGu3Iw?er@WM;K=DYq6;V@KI*3nlXprg6|$49kUkL
z(NLB_HPr0ZOXl(bSC2Hi;!Ey5-6*C}GCvh-!@tqPhX1<eB9$BnNR73c_zEB9X4&S1
z@33M6q6qT1O5O<{DAaoM3zKOtV`P-|*nQFS5i_0BhZ_~D5mtxuT8Wsi;T*n5B>|>#
z!{zcxm%MNj%|<A6JuX;yXI3JsIuYB&s&xXkSaXnYXZE&DLQc1rwEa!yV~iG2wJQsk
z;w2sdhFR3L4q+(uQI6B42wNoW=VpoM)#&s3W`7#Zq`cEz&0%okh%=aI2B1u(3ej~Y
zvut&9>uq-u$dr)Lars$&${j^GpcPG@F74(sdQefBJ=2k@ktdo~dJQr|HU07o4xmjl
z;-X~s^wh!jel)^WX$Ghk@q6f)(&7YXI=_Dh5!oNeJB8a?d@7$)`)%rHca>{i8<orF
zt7WJyH)m7irJeD0;+SGI6m18Rf~b^b#kowHrG2CqGn1C1>Li2W$L>AH2zuhzz_kpU
z!6>k=61S`zW56l|t0D((FH%|pU*-!v@2fPG0$qfF5oqu^v!Nl)1j8hCVFrkb^WWa3
z!3|I$2zZySDODrZlyCG=!L48U9Ji;jK8(3UO!<ZUVmt`4v}r&@!Ex;i^W|-$iBLUu
zepV?+2Pnf<o^;aODNs>dcJHXF%s=|=2g^ussz1s>gWkj`bk)an2H9)Fi%_hh2<MT9
z==C(Y>|<#fgyYb$TNDJUBF?Qkmcx;O!tr2FO3i~lRZ#dJ+p<cjy1+~pB<czw`auz!
zk<hBcR07cVOGUSncBZqUdB8%r2PsjKW$`{2+k~8~oWZ#ndJegKKXN9B<qh`^8{ndJ
zI!(qY-LQ0vh^XNUdIo{LVKhyKjJDv$aitr9;A8V(Y05fHo+^$m8lq`vy(g|SQ`?oQ
zl8l8>OjlKcbePe}%y&r>RER5*(e2V1f%~PkxOpEeu|>dH7RUc+lEj+L4~Ls51<Dsn
z#VKvgq-GADy8Ddh&t{BZ4l@rGg<xm4L+x5o{j|09DCLwHr=LvuD)FdJLuLl{ynEg@
zZs#y5x(!*W;#zkF)`;KCP5H?(W6N?HT@-9&5u5%(Bv3Z*Av{f02J8Vgl~bSOFkRr4
zvVOD5DZu6~*VY)HD8?|-#=t`2N1XF*vDUKpKj88p4uI`Y=c~ztePBQL)-Z%lv)K*)
z-xxK$e2W~=(4viec;CIgMwHq}O-Lw|@uQ8;y;|h3s2SqAV8QjL@Op!+cPPucJ&W_)
zXqT)a$EGLEfM&&qFpJ}3r%RBGrNVPg<9A8^h0m_dGGi40Pr1$TUdbKnw%kXYIYWFs
ztcR%TpyHYPj-X=5Q7*@<rdrHQ4plJv_?WtMcpF4xK*Q~5>N7=kIbljZMsS`?;bc0>
zHS3a?-e=L4<pl*<AT+}_*?%#c%@WQ&$)8`EG=jYCY>q_UXs&c?G70AGA^jJgAVP|M
zQB4q@^pX!LQc##67-0qeG)aS?q=wacN%#=G4mn`6!%Zpr^7l|?HCR0ra7Xo8m9kRh
zLfp}Oqa9~3hb~7_Z|g;U|5OexPksw@OL~o)oGeZ!Ald^&YROW`M++pIX<A29Q^)0I
zbo3w;iC?IbWubF`;TyW)#%jj?%Y3d?7*&h(bm4|5_(m*BS!Z*zU?~l&vZ%CLcd`n5
zuts4NyfTMe8|#%$xKh0*-lC>{jO@V6AXZ6YPs&8>hGmZndu%jxyKTLU^l1ItMlr)r
zK{_eCtq{nLPP_f~uyrzM_lCXp#pzpDBUCOG!KT1oilnaFEac}mw(FGXf(s$b6TaKx
z1zbGP;F&B(8oOZVs&nOuUE-i#C|jT?NN90J4Gp}M;7M8>8(wI(a|Cfsg{c`)^Wu7u
zHKi6Cpf?v2Pb7bn2m#wp6WPf=&%${i#k8jrGi;u55NJ9tD}hQhWsTe&dlv0+I$E|l
z|Ia4N6ZrcC2hw7)^|E9VZ{n#77sO&8Cq*HLP9bf(kb9LZ=_qOh!i;8Wa0NXpfK%Yx
z;&KSO3R_#nv&tQ}QpB@Bik+Zr7T|?iaL$2s%htE{fYJ^(#Vh0h95pp~&KE0tu`J_s
zV%-_dLqLo3+AW)&4HM5fkXAFf194A@!oLCsneUbi`}#F4wL!)zkLp3-fvC}32Y>qB
zN}N*DjsiHWC9;qfFmeOGrE(QCa-QYewn$BF>g@Wu%j}?{rQ+2it6)I$bdk*)S<^LW
zqhe~gPTd49vSq?pW)&T8I+Y%s8&y*XiO~8i@?;m-|Efw@50w+ln@=(qGBmgi=hcUW
zzTt<x*3zlkH^FBv$}1t6#Pd8EYw)xyS+Qtr!ssf$H|y_K?iD6T4w9z2zR79R6mPf6
z3ZD0y@qBZpm{N`M^x?-^i8QS<+V0STM5QcvK$X?SE0P@xSF^DkrihCQEu>Wy?E(Z?
zN2cBMmtnEOucarI)_vzwxZ5-ncbPZ5Nvoh8E;>V^YQ6YNEQlDlORQKUC?#8|aH7<u
zD11DUHs|})0o5xb+bAU%wPEnOw8EPUKiCV`_h2IC@hEA-sNOj54mu}qhp*b_?Ox}o
z`DC0-o|vjlb0wx@E0*EEa%+pCn=J<jd5<S&9CF6lx#4}wntfQa3_EF<6#OWo0@hl5
zdb#9$#V#nSFSd?o|9xx{a&{yV8S#5EOMU)KKl#5L(<gIGZjUSO0{i%U93f5Yx6wzM
zIlE)lvRAMrbFKfed=}JD|6k>^EZ+kZ6gLLy!c^m%C_kmrTQ4DO<9NLKNX*JKovCX>
z1-D^-{uW_$hi9Gh=xhD8^+VX=2U&?nvJo1F{10lH@z=7K+Mmq9yC-)g{af(c!Ow4V
zG1gv+ej(lw&}A3ZBx<%&CqM&%TuO*;{O;c~;*I~R4kVWrfG&h@-JJZbe&)g-RVsz^
z9)0~e)#E#@9=2O^zE*?Q@ajWYZj-vlZYkzLar7PJyiR#h4)C~&@<omxTI6%uq)W*&
z>UM$L*VQbge7CvZyy$f=TCZAz_OR7G`NjPOJw@R=0fVExf3V1&U*x}E+u;y`f4?i7
zKk@MW{V!dn+K)}#hM6J~dt8CVeb#JSa`b<YuEh(9@K)wZNLjuhv*=pI2u6-xQd>Rv
zH8Ckf`IHgh9AgoykzZU<iQ=5$wgNNa=P?3h#j<&7mCOD^)h~yN<-*PXkaihA6*qW=
zqB+>L>o0I)BdWd;HHKr8{x!=2D^WgGkiRRIhWW7p8=E&kQ2i5;+j{AOH%bS2rx?2-
z=lN_2mLZd5)q=)dR2?&9bkoC=g>^TZXb7Z(?sm@NMGCmE5kFGtQ-$^RwJ@v}P`s=S
zS3{7BwTgIK!4|LWgs3p$i80PU(S|)K0+QDZ0VfzKn~mJinbBC3hCuTG`VN2Gf|pO|
z`(OKmOM)3zK#>4@$6=FClN=!Zia+E#)Pw?miGYdyE#2O-YK~sfQsU<Oz8B`Fu;j5g
z84G{NRjSxkLrbWiX4$*d{ODC9ue-6LqVmb3@2C9re|Bs%rp|9Ho`9U`tZD6JY#gg%
ziEX}jnZ8<W)W6mC5<j6$W4(3=KTo#KyON^7|G0L+4-_dIHY^F>dlWext)Wx$PZy0E
z=I2q&p!umjzwlG5>%fm3NIGxWVSFByNURkTEHXOrX21#W95?=yTWZbdW?Ad~>qWA`
z^!6><Q~tb`BKC_(qiB_$h$APka>J=I+gHy8YHmC$Tg=>dj!eZ(OQLF%an~UY14Lh-
zB`cTX+SSNlh0L;!Lr{4C$2FsNi3R&si_4emS9ax3<+e5rkh~+GMzDW+#J)41SnW?b
zDmAO!40`=3G~^=Hwb?qVqyDEq39-5v!jFvZh2ibZ03R`QayE0Ph>;XOt*_oseSbcm
zrkg#Md8&t`tm*yr_gCCAR&}Z>k`I~9)*9ujt1Ut6<Al07v$_E8EB;7yM@8NdW4325
z`$MH2L~{ojd?mngyjjHaxs8^kk4};;@XJ-zxqVIXKC~epjJf~>7C-Na{}W!##GB0_
zQ<su7nICgov9Ho;;w`nknu)Bhv0qVR?cHEVoyGG9KV4owruN}#@~*T)s*Z2B%R1n>
z=V_1{*#B9(&FZ&MxzTl34L2Na^*y*ExYm>4!ncoL?>}xw)|{w7CVw1(-KM#^%ua5~
zk=2a;G*2t$;`3EeRXY^ve^u^eKf({r$-{SFdU~^bTDeV-h?ymTa3E-;SJ&4p%UXV@
zs{Z?U0v<vFIT$}qO<pALf_rE9I0+4_J|0vxQMnr*#bMQjAN{5}lX7l5iQh-`Mrc>C
z;c)lr35bv-bs6iO4G&$1%!iv^#5|(i@_8n)0Z^rYHx)|}N7#sdgwdX|)q>$AA`_8=
zrWu6<LtC7cJrU(<KzN_}GFuPTM1hh#1rB0(jHk48(qB=UFol;M!j61TRX(lPs(z^J
zhxh6$|FF)-X>7W4y5Z7~e6fEGfn}BjerKs*AQb#FZGK8KWs*7_*o7Hw`XHX<0dM7y
z@J}1+jUMQf{%b8w|KrR{1-;S#42PW0xA?5J_Iz!p*{Vl5D7K`u@I$l&yHvj~PLUGd
zYt{<-UnIbeyAuBN1`0;_cq@95-K1F7MO|c(jvupYWG{uY;GF}9+ew)_dccD9DLOsl
zGhO4>7+h*ZY7^VS26xc*l>ydK6i*r5H^siDxQ-IhV@#7+Ppf$5>%8<kxlF%_J1eQ(
zutQ4UW(=Ci<ZIc{svCDVK#|Bez2-C@OM5l2>%M!uT%<QQib2GzHBJji#OPhAb0+SO
zCUIsHUZI=0A62OgJY(b`;Ir(wvZ<fr$?)QB<m`bL3?niX7Q}C5+v7u5#$&L!?^ieq
zv4OzhV(D2{rxX5-*ehw#<wG3Ex{zl@s&RoDHs={)cJJ9`+zK)_3SB_y&Mr>}ot^d%
z?IT%F9HAUXr>hvg&*>bFWI&Idv6PJH9Pw>t3|-71`|fjUAop<-nz#)lI^l(Ks|PMC
zV-18<-t<tHfO%;hJm|suH1=^IEQ+DQ+4S>|@M@>chQu}^hv^oy_ZzmNj`G-+6yzr{
z%NWlWe3oNqB$C$!O|tX37oqKAsOZ(syGD{0iMvciq&g0I8-D5>%Qp*mJAH|+bW9+f
znC{f#-4oDDIq69vmxf8+q<`cb7{qx@5gDZOad>*x{l0BD78YMI0B)qE35voe&GG_o
z+3oDI|2ksuMn)V3y&#<4=XGbmXamRhgf{%*Nz)vQP4-A)_j?{a|GO)R*N;v*CtZv7
z=YrBDVuPs7*cm>jNz2Tn7(g+QNyaylB|i7QYVz)J$BS#T7<gf#OMKrW<xgWpL9?J)
zr~@9i5l6fWvoY44WYc7ureP>~<eHpBCK>-5$p?ozy3;hDBKpAJH4bHf`8jN1?^wqL
zI1=rvW#Wv{k24xF;1y$sOU@mOkS#ZrnL}BTGZVt+hC0s0hextbGEJ6*bM2G@TZ`pG
zA~f~b!Ka&o-~K*bDD*}=GbdF%w^37e3yia70AWC$zqrD^@CQt{WBu32TYeOb@QG!J
z7q?M2N;x})Wt|kzQZfs&7;JM61-hm^cI!5D9vgv1CxVU`cLUJLm*L>N*VBQsPx8HL
zP6p&nV`3i!O%Q&&Mh5fgi1dbpdwCBnBH>FTtnS%&&p*~!SSU5$r^efYhqe05rUvLn
z_wVb8%kbvNx=XA)V8Vj41~qAvS$c1(CgrIy(_`$<0Yg72T>pXa7Xs`Qxk4tu_Elk+
z1vyq&KarRq`FOnuB3!*OR3VTVUEdiqm?S=&^QHYli2;I;6nKyN->%c7L8pr3prSqy
z^~%yf?4l{q2f&lX<%Z)1j+6QFw!{H?S_uT~Mfqx>HxTz9<deHO!xo$F&^}1-${e6e
zK!@{G?s>G#jRItj$z&v&B@T8QFk)q4Y~y>2HYvs)xIeI`PXWatYUm9I4!y*XQXe)v
zY!4tP<nIKxU)dV*lQ+UOLxz=@c5VU2lhstQMXwgl7P%6ORr<7vZ<ot?{`Jnz4Sjxf
zwM_^24!d0Gf9I>oWaq_KUp+4ye`O!>01p`(O-A1U@0lNAQICK#JO=mK*sWM5{Ytfx
z!HcL^kLp8%J;eQ{)%*s`QQ5b-#D8ZN?W#hh%LTSxnpm~&;s28Gl}h#K+PJ2S+EAeo
zwE?z;udwsx<G&I(1b^bE)Xn4*K4x8)YQ7|zAQsatdsZ=-3M~*G^X3QJ@+Mx48P-d$
zf89%H{MUk;05J~%!wg_lmR*IAeuwj>-fQY`Ft1a(-sui9sYc46SG6M$Xz+?7@av=Y
zMU|7}316e^!Qy*DnV-OIuG*VNGT)Y(<RfcLLOeFtTJeSA#GAOO{Pf<&F-!uRXVH8T
zBd?5J5R4vdTN}uO^uJr09iP>(%p!|dJDxzbqmowiAzQp-M<LD@zNyJ|;@resTl6La
znkKl!%HUqx94Z=z4H=HVA~KA^um3=+{+Mx!wv6)!eQu#S1oV??s>3BK4iVzJL&7(%
z24H;v{E!pVir#87;&kS-i0cPH@<2V>j{2F>W*}OL$7a6Mwx9Zm0zxbG;LR1D%AoPP
zwi`&L!@@`X=38Bm_CrMi9->sytE3~I50L_UbiBKkL<BK-c<}WcCt^5dl>s8>NywgF
zv2zwv2?Kj+88wU|(kU9{z)&|!$v%*v$!P&FU0;}S5xo@2Dy@mMFhl~;@tm=A!n`|j
z|1?Sp;|-gW*|E<y%a4=)q5zc0a!R?Il~`m@PdvA52wOLx5GY1m8{bJYBUBdv;*v#y
z8fFk+L4elD6K1-e2+QJu#pqV^)hbc7TE!?-(%c4!^QUAEiaws&JfUa1twN?z+e2L;
zY3hxp6&y#?SKv2&<$-P*dFyhpTCu?5W6SapS<57H*pcLWka<1C7dtgmgI&$L%VsoS
z8CaT)hz}kJK6^HJtQ@FFF$aQRp+A+pCI({!gXaggHs#Fnz(9z8=+s$_f)zqw36IR}
z2|a3Mn+m+V+nDhOaKUc2wtet2=O)QO*r20R`;<l;>-MR#&DLh~RGvB@l{c!D&?tJ@
z=FU@E0MS`3Z~TelnaeZn1A{BDyt5w|>Dq@!5P6+tK1stX8nhW4KyO$$TQEf5f0Ed4
zR*#)8qc#&Mo<`c~9z3LR2gZGpEd=|@phS3R+=UF%Y6p@(rWOWR)`ux;0$w$0VIqkK
z1Yv!iS*0S}ZqspIWA`(cGK>0Aq^W`(lD34_YQ~LkO%o2n*W3`i)!1We1=FTD?spW1
z4a4J2fAwl9JzFUVJdl@$$;K*cNM_^c=ja<VXa~rj>+{+>tSQYnI0S}Wb!@il1aS9s
zS){Bz1LifdBe3SE!bf$p;1L`!QK8H9N9g>rQA5+N<EbBYQHcaz#Vdy%(?pnN^v9on
z3bivGXJ9t!BE5)BY6EvCkvtB7({vd$o-LPDs5Ks2$R1vVl3n|!CfbjQIqn<{hTZRq
z;*79{C{(Z~mMjU5B@AX)zq1i`tTnS2yD(i(AkIH&id;UIQ)TO=-RfSCLhJ3Q%6RL(
z84Lr@NtMi&vYCHLB5wtEjnjhFo_zhn5c)1DU+#f{kR<M+EwH2?^54q0wOcw<wY_Q<
z+4P#>_KWyP&F}((KT>04DVp!QRp3o)l|$8Jjm0|@4SZn8Nz=zO;SFGNNBE%jrhh^x
zfJ13YqJx7v07)<qPd$EU7F7XmNBN4*f>_ygX1(5Kt1wN1`i1x^f60?GxfeO2h%jbZ
z^-7${01UB+8dh<D<B`q!zBx_{$NCp*CY3$8P`^(nRIuk&?`Xc@=Fog8EPY`7Gdzv}
zDp-szFLSG%l3R_#_l+|P7qI)r9!VM(WA`w}#f<3$tx~7>x!bj+P#*-VtsKwduSx&N
z>3Ql;?TuwVi<{YJohr4NW&?P^Gj)5m1~5I`hRsO@dU_~-2m2+=@zA-BJgKZKkg3p>
zvSLMoHa^7SgF2;GSa{)$5o)U$0-#Qj`#`sUwaZzR1a_^BZNQXbGMemqM$)sXf&2h*
zbS=Edyg@S{QI3TPkPCc8NTHY;&JqjcA%T`YQWJzy`6a*X!DEUV=g5l2d9+Hd{MAGX
z9ij6R*i`8#(j-@^qyqNC;XVG_NYxByI+hbB%^{24GyWa`w2g}MYjy4lB%6bBS;#k~
zvUpfgR-9i-rR8x&dEvH7<>j$I^4BpPV5M>n7t`pZbbEz@AQ0t?cfWsZ@MdJBiCmKY
zvIrGexQ(U(<eW9Z;yBmX-a*IN%?tJ$NG^WTF7e($%1by^y6sP&HX?ao;<d(h{mt{P
zViR;MrgD4oO9w$_8q=Z99uuM*fRt5^^K;q+A7N08f(p^8kl`K<{MG$hH&o{~Su{yi
z<b7jb!Q#>mENbph`ui%SyG*fjoy((<@DOHHwQ-b1F=s_d8o&Z8NHQ1%F?o}us(G3M
zbX;krxJ`yf(L>&s0u<|G8+@|AX3*60EL`@YiGU`R6KP>(ejVwcSf{Pn&v%yu$t-Ac
z3!bN(hsCJvkYR3SOy+>02lq{<-qpSOU-+~*!<w(6X<7x1svpgbC?3hi^JHP{ib2B)
zeb8(j0=x{gdAB&&lX1;leNi)ZMHb_4C}El?aQ2=!XGA%cd#dkTC*Tx)Y`;^_Xd^}%
z59!KJ7GOC_ANGv4{MCP}`)c=H5V>m*`c)OlCtc~3v!7+-c2V43OpLUxrVJ`$aSg<5
z2iEM$s6Il`Xv6W*6^QkLEqWvHPi6&GJa&q4BY%g-uP=_<oS(Wj&C!cQevnN{)?Gj4
zuV}4kmKZD+Ne2xbUb)_3RN28GGmjA}%QGjuQz-Y*YW>6i{rQ9+zGSv?zHfK(#c0Q5
zK>ZEBu}eQMUOdOYdw>3F*Z+5S_t~HSy#MECf7pAzxBud+ul~IMjLPkO_3XuqKSaB~
zVH;|HR`8pOqCc#zXc4Z~lzZU)|DiuS%*GsL^LsG~BbU+s?(Sc=_ILO8n^8ZWypK79
zX+NG_r;~I(&!TT&z*{6AVGO;Q(h)>=3L9Qt8V^vWl{1n(>{EtYVi&XJBE3?-RRAC4
zY~;wZ72s;|<SOM82qvIh(!Fr99&ru%LQLD%^48?5Zw}AcB~+!Vg&%uvnI>gA7&%Eo
zDmVHxS(@}bQK@aYV77CkI9U~kI?)9Y>(MEJP9r;RFb9qjwK_%4M#OTt_hGe8x>f->
zdJ@AWdAqJDFz&cPF-@Vaj#rxZv(OsT3T@P9wZ`*FWO*YSt!!FpRNS!^=PAq*Dcvz{
z^sO<;?}+W+xuP@sv7+LAILqAAT)clcNtn>c7P;}chjXJH>kJ8-=q0BCr8Z0<U&!zv
zAyOikE~+l!tnk;%4~*L478Tz+Cco-@fh^YWG+rVl7gkrEYY&*~f8FUv{qD)&O{>?A
z==Y0W_xsLq`#3s$OE25eQTO6)uk-5lAbQ<BJ#P2<QS1Deo}LeSox{sPmmWN6^{FPO
z?Zvy+`P-=d!$q&%??>HU)H%C2?GQcsK(BQ^=(PLIsB?aFdWk%i&4_43=iNbc+BxeC
zsMw&}#CJigTr=vPL}%^Z(QEp%b=W!W4Bql5PdbBheC~w4*NQG$y+P;b^0d{9E-rf)
z-9A%8|BgHTqtjOBtbM#qZJ_T)?eCFEtN*%ndRpji_sw~`hYkdNJ!D#^oz~%LTRum<
zJ?`|{M+0=r{dPoyNR2$DgXf}s)WI(#ZBdU}y|+yw%V$;hyx;!&C6%N1(Q)gn^@{q~
zcwlsBhK??K?K3pId&23CFAw{J&fs#;j$U=U$2{!)cJKSnQM-Q-op$>?aGWgcxHV|u
z^PobbMz87j!^?gL<Hv)3K4|xPmluOh_k4rq{0)r|je)?VW30R9+-DlBZtpGVVla3r
zn$errZF){~ey-gc^ja7W68VX*@k`QIX*>sBXQT7>tJBV__W4m8Z@VD$ro))xn7mFO
zWjgZlH!b?|CA!a(Ms1T{y|vursf{`(QS12o4jM0oL5-F~zoW~Cp7t+~UhC-FEb7-Y
z<XavNdu>`X!`EN@k^W3)iTA`ymVP~rk^3{upiX=JIxVDH&$CIqNOO1-6-v`K4Ij`|
zHBCqFW6t32o_~`s$0+(Td^Aa~iqC*k7CvLw$Kc5%rOPG{pRHze(2c`q$zm}pe3Y1E
zmh!@<^W`l#+d^CJb51(%Kbs{>8qVboNjJr^JK|bWXz4006lA#x&oEn<tk<pY+r!h&
zVgGG^&^|j3i7u1rcqbokjpJmR$v0uZzy8AJ)@CPk{*SQ=vk%oYozQi|KAIBsBI31|
zl-pHYg%xc+*g{2rmT5wsSdpF~TB9)zd4=MSr&IB@x?04d9rhN}I5(B4?(sd{G<4u|
z)-;*@JS-3KLn|Q0*y^SV#o{q*w@{E%h+CKaLOB%(QE+Ed^8%|9dj(`7cr?((L>zdo
zsa>VQ4ttx2pPVIL%g&P}Jjjg0YZB-8?3){YJ)N6oLTilx1vS)*(^8<ccGYOr=85f`
zsRrE!X9r1^brrQ6`n~V9Q@roPg2W$8Twl(J39-sXn*lOK&Dp*9;T48elke(>PUSB|
ztfjC(wJth^MKF&S?<TaBv_h+Y)agXDaOSspxisra!s*R5`j|eGjU_H{;?H>%Hir8-
z-?Dx_*AoufTmauH_~;_O^VVrE9;bKFva|+Fh7vo*NA>~nggFCh;CJ3XdKmLjEXu0k
zQJ3!bJ^!;{!$fD~=0kWhqe;T}2q{r^e8FaB!$2yfT-3JF6259~DkU6NJ@uF&Q`*E<
ziz+l&tkZa2xC(CLz3>UnqnKu4_P%hDEJiP$^DTfQf)l)8s$`UPB#wsN@2ci!*DFES
zdPRw?J#oPjBZLW*;=9XahxWhIJwNHZ8XmV#T9>DT;p=}GGJCrLRj5*N=3!?o7OS}g
zC)3fMjJ7N2opsJVT1>B0r1e9g$XC0rcX%s#IQqkjb`Qxoj=mcb7x*1Sz@S}31j_kw
zJcpEZ73an^JziEejVPZIcO;$Mf9~G*y63~=L;W83$GsQ!<+(u04&U^MZIdFxX*NJ(
z^TqQGTa*~FL3c<TXb-lL_9^j?!=p1|;`Utk*qS0Gz@NPW8;*3_l_d@@PrrM8+#8+}
z`}1tymN@NdXXvr^h3^fqzR<e8OQ)-8G+}Ea%Zz+&TcEjZZ){rK6XJuob3^+7nGV9)
zarEMOp-}61c-%QT;db}FZ=DVg-wwd!@;L16ZWPD6bvbx_(dzeYTff@dFP7<Do)0@T
zSe<{gqvvi6ddG*uHhuK0)%&jW(o}6<P!n25-|=wJvg2~vnim_vO4)nyu3|wPzUqU~
z=(PvEx3m#Xi52~dm6I{2NxM!yAf&^psnuuQDROJJ(gk(sq(ef*lO1CEb{4Cd#B6NO
z)A5tKO2j(%k#9yHOMRH7^KES5+IpAgogapMDEkMPxwEJ=PNpOclTdvUtnJs`{s4wN
zo}vA(UI;?k>;`8f2dqT5S-xb6*y}QCb}nqa=Uk2U*5Jjkb$r~T=XgxJ^Z5($?eKk>
zHAJXD4)rX-M)-j*pY3n(CA{Lqt|sp<I|j|ao@a|?ks5dFg5;8rq~F^$L`|1Vq|M49
z`H<U7OWQvzyhD(LX4)mRiBISNcvf2YcCnBMNT=I??!5ualqC5*`R6iSPLf}vf8yd!
zW?S)iyr942NZ*1h?XOSV-AQs;hn6u3>LjubkKP^;t^R5Ejkgr4ik!6igGjE7quX>c
zUU-SV*>K2F`yXuHU>LVoxhS4sWMHn{s<a@Cnc7}VxCx#zn2in>)G<)jarT`$pCVzf
zM1!MUQG-qcC{gGXf-C8Umu^{*3e+zNEGB|mXSP8SmOYnLD5+izL7XvcD{^bVg3QIa
zo#H)ysX3%aW_&EPZlQ}&zw_#{-`lGiICjp35{E_$gBKhfyhdo(zwVsEib)rH7dfW}
zbiCr|+W+b+o*>v>MO!$(-^ylN(o%NQVbzg>av;twndRwwQCdPRm4o3KBat6>!keZf
zH<9kV$kU~9K+IM-B2M2x8yRabAM|*lsmrdQZWMFN7mD3<i!f9M@_{9W%{3FY0Hc_9
zFLNX|GMa|RCwKm+`(}82Ie06p)8`-PZe*7M&HzULOQ?ZRlrE4z58NaKjBr#3E#e-|
z+R#-D`z_j5bWiQQFt@?Eb#2c%iY13OO)1vXIqIIBL2I%bmFd_drN(u?o(vys=NFf>
z_ms@x{Zg}MV-w6oW{S4g5$IkHKw;k}U^Ih{#=5>-5(o2)#}%1^vQakSne6OzsU;F0
zul%%6L^zyI_we$>a3B2R-MU2al>p^4F-_D8TVt6JCs(7ze|i3$WhP#1g4Tw)wP~Bf
zr$fn<n{p10jyVjz{v*eh@zEaN$)};Uok6(bajxjo8F(!^*NJWEz4H1*cZA1xoxkGC
zLqCNLx)<;nG7|!MEG{chCTzWgEE;_oJ^hc}r~ao!0Y!XLxBvG1sK8Ij$3gWPa&Ue>
z8>#o-v;DKfKzd@GB3=LI(7p}-e%bE5r5TDEO2!W8^XZiljyQ(E2nR+$SD69M0!u)(
zXaEW@)KZ(OmrIJ0Kw?BRW%zYENodW8s|vK@7Bm8WCVXnD8IKrLW3&G<3hv1-<@g8Z
zHD#6y-sd>QIN4{PVHAT3>T$$E+_QZNd>D_TzrHBqrMbxD?3#m=GW3*f1CakEL`CA3
zXVKpNUue+tDkhIU${YBo7d2{b`!E0cVuQ!H+dYf=BT#LP0s6=xDx*n^v$u*im8X>q
zHn7aa;T^V1=crYdsPOXe6`!L~iPOMKyWf*Ly18ZoDa(^jZ@G!oLiV}LRf@=eELMjf
zeV}c^WlKEL5>P>2XI{7ZuLn@7^S}_xd0Lb#S(`FTr+|%f)UI)L?(P124K2tJT@pb~
zh?nX1qP^`Gdw)?{D(`r-CK(;3-c|F3sE9bH1ZR8PjxN}B(t549G@3#|8sLR?OU_eX
z<tB267Yr_8VkT6(VFJYgfFyXNx@Ym#aL&(;MW&<;e|dWP%{RNA$in@4!ngbru3D@K
zX{>vG`qot5+X!mnklRAoPIc|$_W4^ZPOZEj3QJFjHQN&XUv+f_>eAZJHo|6`aVB0w
zB1$a?VX6PEW8?@?I?qe}kH^GgRX5?{^00q-XsUiyXu^~E>S`-rT~*gT@Ai*+or{5~
z{URK@S+*r-Sk1^258#IG&&4k<sO#CZx@sTd$O$oc;rIU{x8{>2eV9h9x-Ql}%qCjr
zuZ1bg-fdyc(~_(C^q}QtY;U*NYN}4>?4)L~^}i!Y?5um<!NxN*WX0)#sZw)IbqFLR
zf!gZ(eswUZldPucEvoN2zW1!q^U-9546s{q{;sz7Eb15n<#l!)=QX2#-eoO@t@~AJ
zsl==0ZOtxey)`Gc+vK8{KwV<aw@fy0Z`?~Kl|bfbCPodQ7b{3<JE{KkReSJV`)%KT
z^3SrqF7w2rk;Bna{9B>eqqDNSJ(V5}f@&u$$-iuf!fAF7#$ME=M=}xB=dF6yGIwwV
zdGr*q(aYo}TcpLykiLu|d)4i|9ik%_ts^&nf8D4qhy&4{XS+3pg7bENucj2@L`|9f
zx-ztt+sA&%XEh}`pR+0SyrvNDIa}zfx^EKe?l!{yi<)AGoxxe_!WR2;-6!8(w0pE8
zy-m6QmzuJ#+Fe_wZUQu%)?5m8QxG29&+6tNxEY?+&4RzLpVdtOt3phnx(Q%^S#NZo
z)lI^2>-<%_*S)mc>sj4A5dU=EK7#Sx7Ok6$0bMHnR#>)fF68d;oBCJbHlZHj<k$f>
z2Gwo%<RmI7^-(;9QRuo<{5;x=>Wa^brQftj^iT~l3#6trJoh2iimpO9`NdMBfWaG?
zb3y}$_?Ym|0ZGQ)KW%-FJ*y0o!LxAT)UnC@T~S%NY1H1^sIIID#4GCB3y(RZs=E0E
z;qZF-H5tFy)T*EdKYgb5thyr{S|_E9dw-dV$)pZC&o>I8Wa-0kdS!~oogTC<tv=KI
zYC|;OOTYq2%;;3JgKkF*S->hT;BjtO5G$olXQD4QBp@lv4YDT|1sayH)1IJrR?%~*
z<3Z=orD=fwwF^{dv^{7lvxQ<uKKP@Iy`?eq!ea|<IlXLgEB@kIks9O?wRu_q343b;
zE3-_>@-&u{a~mPe^Hm})a9YerCbh%e=kuN!J3G#PP#zbk8eD5Tkm`FIUOQZu0CRac
zOYb7$Y-9F|WWbQRrNpa*>Fvv&3zv<AF|v|XVi(1ST~CC{4GgCFsO>E%<^nmK1m5qw
z|C8JXIk4@vW>*U(oKH;Wxo*Xi3{I7JY_jvIr-McCn2xK~r)!wd`)b1@XV|;Pk-F%$
zhZoQT2_?fQirRBzFqT%cG0EFYEC()JMadHmmHpH8#SB__;#f&h?vBcanJZfuztVCA
znTyrcPJea9FdsFY`<@p*-55w(DAfKcqjk(ZvuP1=S5UciWZ3p+>Fn>;(%}<2Uq?!)
z)HL&#y6<k3$f@$pu$atWdc%a+Hq~Wvga&+yVHXjj!y^tV`4MH>0;7JPEDdbml6@Dd
zmjX1bU;wyD`?{!Pq_`Dk^DHw9S5ilY1-bL~4{}=U>mCH;OQ{%da)C0RRvlbkNv8FD
zqu4IalEQ~r?d3oR^6<EQcqs?zzV5x=Y8JI&KcQtgPOerrwTsf$AKGoVuPSUNz_o91
zFd2gr_3E9vgcO+tRf#aiErCgEZUqJnu2PDa<<=b#>!`Qh{$KosWJ2l%0$lJ1d9W2W
zt!7=Se8dcVfos6hG(4GT#~EsvvwANdyE6T#MnCFXbig3{SW57~S=SR|hha`?cSFv|
zF^kc;AMAX~kjB@m$>jdg+iMd#P0W$GaurV&H<m%Ru4)^cV*~La*!#&0Dn;d{jKRv+
zPCur73P9z<0@Khk{_naL4G(+W@7m|=>uTk9wJQuH9^1bU*y6vQ-ccxYF(I!{^1g1%
zSu$P7FrHWz73pO2<yJa-6e0KzJGrfj5cckal#W_Qul+exu2rAjC;84S<85&Rug*`+
zwH4q@QJd1)4*mC04Lk3icDq)he<tUPcT_rLQ8+THlh3C$Pc+wj7v&D?j8(Vyc`~`)
zE;p}pJ{)w1tey9S)@r$iO-723#QOERQ?Gl}Jsq+Y+!Jpj-%6Q?+uUu;(bi&SPb)7i
zUlwtPhUl7iOA?9hZx22G6DL@0;g6MUpo1@|9iHz6=b5v&jj9fR6<M}FrJ>4%0&>Oq
zJ}B}p%brb$EKOtyIwG#(lU6yp4;I>>u~gpr!`|_sZ@GA0BU>Axo`*mX$YMtPd-M<7
zM$E<Sv*Kb)c6v$={a+%+HNKo=-ie^Z7tk{}j)CNif=JFPTn3X2m!lt~E_xVd4=gMn
zGIdqbsw2cIMe9AlP?LY6Ra;pW>KUt+;XiPh!I*rz$Y$`Q@P?+6g0eQx<ZCXmRLoX3
zHkMUzG6j^q=UiKmKC6l`INw*MOaDNZfFwAnEPR0wmgq%PY>|v%B(JL`;PNc`b7UsK
zI&T>5fhf<4>%w4LN+5iN3&Y>l3BfbVx>vlV;93yv`$W|U%yXfuO9D8WZi9wc`36>E
z8sBY6jV%!;w$wF(>qi{iY(wHIZ<V(fQ0e#1h{4^Jl?Y!b^pouo_m+42(kQd4lp#z;
zbaQ(m2GmMgTvUa~ea9AY21l_6u;UAfkdPqhWGAM1Qcp>Bde6l4YfTPSMaAqbYj5Cr
zEI1BTrnQy;JG!Xxyx{R;5*%f0=*(H#lo@%{5v8*hxMy!i|7)cv=Zw_(C_)I+NxoK(
zwx$TYP2$|IXmssb=E(^TL6!C|bFp#TaQ*pY$gkv>;5k*eqr~`n2*NW1&_cosB4`pC
zU<J3}!yaBoZ8`bAMb;bdhnHT2Sb##)Hg}5kRh1r8x1O6SWQmi9(fU*q;6OZ|fQd{H
zDC)2}z24f|ie7^ixMlAVJ|CJA>UyPV)M)rns{F}b`=||{%L|ddNZf5k*0~siix<Kk
zRMhU1urqv3983Ro>$`T-Hn<Od@76U5pqq@Bzozr1C9q^xwuDWbbuF>|fbqJjHlD#(
z<UtCZ3tRs)DIB#fTA$Yj9#2-7g$sbkQ?zbty3XEN`rTj(xnl55T{UgNki9J|o|?77
z_Mek>uj#d{#|enAGPf7wD~U^aXnnVjn~uPdRXzlZ<JZV-@&m;O*XD6n3kE3Sh&8zK
zjxq)ZW`95^Z`o_AdcU7{hbOJhX%|7J{$7`TZY%rLwIimQ*pk>mf+tFc+CsXBxM~?g
zWH|wR)@oiNM6wCp!LK-Q*)6tuLh%UT<?GMeO`UGrN#zW-WmHWE{gLgPQPqRgg5zCu
zzc*0&Q@z5>NvxOqOSDc7X^!QcMZAQWl>ndJ6`n)pjXjj~i08CbIb(iHhKF2T;b4tZ
z4J0ev8BH8DdDJBq!YosRW9~TxrUB@*HRsusg>e4`dYUA)DJVEZPSy5AoVhS`P6Z>O
zYuRfKp7aJ02N%3?0R#qQAm(0z&4*XkqX^O%5)0_92UA-zth0}J2E42^zpW+cX5ugA
z3<*dXy>l%AoxH#DKDV_N@hlg_h$fF0XtEYm$E|RikK%cJl}@M|1qMdG#Al_5993`H
zY601`)&bi2to-6BMXTCuPzKhMZk%acHET?cx5mCPw4#lxIo!YUNZ-s=es`S+M3C45
zdq-QklvyM#J4wo^M>IR#;h=NYhVn<8<QZ+uI4?`)V6Qrarr~R7L3hJv1KQ6X?+!@>
zo{L^Fd4xz0X*t~Gtwl9pj@iSjdjS`mNW9ihvzus=yeEb>Xw0c9u6O-Mbf_G5`@SGS
z56`=U&QaTQ>!fFITD@~{56}FEz1ACJ1Z3VwthT)S5d39hCJ-pFjHh!u5vw_py-8^A
zyxgVB3*Zm*tpHo~1}@CUZRo7M#(VEIklX8p_ww>Wwz;^Yw`R+9>qEQ{ms~{UZf^&x
z?(!S}2957GqK4-0`hMdJZ?3-UT=2Zogq^m(Z=XibSm@~6JcwSL&;I}K#dC*m?|sCP
zxrlbR_rG!s!#fFAjxOku+uM0=MzO_i4I-`yjglM239}LBT|X|zK5m`9X}#@xqvu`$
zw&88ReWW5}&tsLxY5tD$varKz#dmqP9C!NPozhh(4z%<abawtes3`U3bsI5}!}i(5
z;H}rJilY5DtqVFXq;-SSz7cX;E9Bo;dThNRLWPFL5)P&`7?a}5w{3q|if_9NZ$YxG
ze7+yg=s^6KMB^2$@OgaC1LH5}7KyZ-f3%0kmuDB@hr?IlXTx_IpK88|L?+&OPzveA
z@j-{e<vIL&c8iY@Q|W(6o^p_-ejv-HTREJxx8m{7RkI8q?LNY$hpprP6?V$K>a|Z>
zhywGz71nDV_PeJ*9x>}of}rmd3IKuI%jAY{n~w4a#KTDXMZTwO#;_nXz@qVK!%aRJ
z_|GJ4EE3lr8(xs)mQ(ZcGs3J(f5B7<1+84v4m2~PJ%M)|VpLKJ&{=TSK4X`$)7Gou
zY41`mzuFQfmwK7im1v!ws+T3)gX&71cT3T}|G{i#quiul%5CrtHuv)TE++D{E!}AB
z!Xu?rw|809CRY{x6K9sn&#tLD7@S6pebii6%D72Ct0}0%r+s){(}&_Ct+kdQ_w1{h
zo_z*E)04)FDw=Bu(A>Ab@2FSbpLrYvVLc7+8afvS#8VP~bKLiKE<Zl&oYF0%@09&`
zeK|PpzBw;@%$YazWwfpDhpJ^J?xCuDU)6X{ViN}zeoi~he$sf@%reeg`6#<3a#9H}
zg;91D!{c1D`Gfne8DiurHlyTX%*gWGKXJm76ow8Oxa3{Td{w~A*yqksJvblSd&JQd
z&j$Mzz9Fqw;PH)%QOS2TC}ll|O5Uq}v8Yk~fnRDUR?s@RJU#Wum|p%;?AR|ApRXWy
z-hI<kr?bFy<HI7J+tf4ah9jA0Bn9%rKMv0L>&PUYgu@`*$261-!eem>_-<R?O0cb{
zSq^U83hN=9$i0f^JavIqf6j?{S)<&HCQvdg)NCM0b=e#UKp)n5@}=f#NaR^QmF{{k
z>h!C|Y6@!yd-$-@1*TH2JIh>Ds;WnV8tkallx-$8#8G!`rIrcivX!v&{3^dn(;4<y
zlpqi#Rm&^!+>-OwKqy(pl9)}21Xc@0Fdc=rU_kZ2(l4Yz04(_8b=1}Aalfv<N}z&X
zWtJMCvFAv)2NT7OByn@u)@)o~o8!IsPqt*blsSSx`voJ;#z4WLiDoV*z-XDT7O*FT
zM>V9tlOP<z6Wzb7E@@y&OmrCBnkq`ZYM-}zog?GttR-(MO4<Mf7xYCX|DTGI8uZ`?
zby3Ml6;1U$4I^vvijo>5;m2!H$=iyO|1d=V?3eslQBnXAj*VNdmb|MfiJM$YI+xv~
zdXyv(!UbAU$z}B%(FNb{TjyIYIgJ{E_{}D9&7GCpF@%uf6KQ?yMz>%#s^)>@Gi~&q
zn_G<{Vp)}wbn~kAS2HIZ7Z(J{kq0r#d>!iO@~1oxI1{5qpBgv4<f0WHsvv}3H41C<
zm%<YKC0J;`_>1Y6V7>ejtchQW^ZrY5dVeX*;xA$MShLa!g0)^Hp2ZH3s0>HV8PNa*
z9dwXHyOU0@KVbY220V!jP&O)}-f#rm>F94!;rWldKSf^)B)D*qxlJQ%VXg$j>^@tG
z&)sS!U>)k+Aq0;W89=QJ7ODlO;3NzrV5J$fkM;>XupDfjpklyYK!?|gjmCL45!_ty
zZ{i3MgVy{pIKrqsLwt59Uug`d`EY}Q(D~Qsn{OEi$znZ!+=zbpCHglrK-9GvV$$<}
zm+~7sjY4tyk<fPWIh-$2&0U=@<Iy|#-6f1!kJM%{<9J6_Djkc6`XRpm+HZ4ZcA4R*
zIn0{F1PUnn@83iVwM)~}7_O=C$6?YOGO*8ZNWU;{!EmF=&_Ki0Y=LZQ@TO>>A5{%#
zJp9SVzwnWZc$SVD+uPe4(a?WVB1gY`-vUfRzlJnsVe7a2!Kypv1g2n!=&#?BxKZFm
z+!IZ0+_X?J^3h0Ae`Er65-TiYv?C6$JFLl2Lf-Ze6-rl<CHwjsNvVR9%=iQKg`j+W
zyI9zH{8+5Nx}tsMYYg3_wj>{k&s<5H|F^CJpQz7m1x5n!iki+pkrV%kpCwx3r4$Co
zCMFdSq1^eoNtG`odmxIL3}Jv-jBkwRkq`c-b}UY|tJaJ6Kr&FtQ>|68mS&Ixb>(Uz
z{$zCPvIu*rt%XEG3UFH_KdOiz#eiIr=#$CyhQ+St_DNc5<S#MVCxsfLF$Sq?xTSzm
z2u)_duTDSGp*2ptKS&<gGEsH$Owx!-x@yz-ZAFCc$iZ*yIj}O>>)6R99$chL4Wze<
z;92vKzj#iU+tRNdb&kylim&xoT*S=FmPM}SS%%|W5tM@lY0f5Gb{&`ab(0-b5X^;C
zGn!9U_`=>Ue*tv3*(h)DJd3MUJ7S#5&Xnn?*)?+Azi_(|$y5uAyM4#lmH0F)qC2i*
z!WhMc(Fr9G58;w!koNfzOx1^-K>!d~SMIDuA`h$V)=}En^0X2)1skxL(0`&ot^L><
zI{nV8bD<(+{&%CXq80q&`Ea?hmgGkC^5xp*^Ee--CLB~yHq16^t?v3Hmz~hIsT<kW
z<qyNd_6h5|j}MDVoMK6hQ`CYqa$o31_4e;U#j{Sg>gjO`(7dWQN6S0=m~R=m5-N!#
z*NgauEAWy-idBDAg${nkAy}|BoJM_`EN`>1J5P+s-kc(QP<f|{cWSD)wmUFv1n(^y
zr9f(u-898uo+zL`!v$ito`_xZxbv#rA80;odpyY(IFm4o6?)E(IqlszP;_u!m(9ke
zoBdNdA29VBjj9QWHq%V9P|5DxI0#Akl*}SpM@hcV4faTZzE6o(<U`F`AW@cUm;8<)
zSl2>tr9VjbAzD3|zlS<pUY?rSt9m3#pOMvH_Z4}Iw43<1jwqnIhT#aGCDTj9GYDa%
z-djGlMJKfEq}rpuhAQoATE}5W%7gMr4Y>sJ*t-WPuAvod17t<1Cxv^6$yL2vW)HT#
zxWMH&s-0DHSVfzo<=um8$bRh$>+l~>CX5?sctk~Ewva*R&=uTY(m{2^O1Ck|t^%k8
zKL$YyThZGncE)CnSoYX6phH)w;^^SI<{W{{aWWk`!fs&CMa~i9K({T8h5L~~ix!_>
z<i~^erHb57fsLFm6~nB++@Yc_#EtSv*Vy!i)$1;gd}MD|^$r`RV>6~C<-P|z97feJ
z;NE><7&H!})O3g})pPD{IgjD>CoxT0MGdvq<y<cl9OYQZxna@tJ97CLbwmkNzr1Xi
zB^D*N?N~ZysQuT(_0d=vP7*$H!b?S8g82hWy0EW&7SN{eDt|80^(=Y3$`=Y0T0?N3
z#R8VuKmlm2iv_%+HHx$Ap<b26V*VKhVErMZ>K9A7161$RVgYlW@qJqL(w$sfWSH>Z
z#ggtcidOt<v4A;Y7;UuFN_!w+nb5Dr0^XHKoAR!5V0}goW!%`}{4r043h$cBE9lHQ
z2hWdtyFc+_`750hjJF7I;xD7w3i+jz#dJHO-LoK8=<BGp^^Yjt`WWqQ{WThHiGjkk
z<3NE$Rh|@fKaZXwujNx0@8i~?lPj7<K~tD43I8!0#Hr>it)|_FX2ZDVxKc$yi4j3<
z{v!UWuvRKIbFxuRO(EHi7^gZ~#2?tm<PIRecCH*;QI@sV9Cc~YAUk^+xWmQBnf**7
zWEo90XgITek{jH7IAyg89iMrsIu$y24Rt>;);O`Lu%IQxq-?!3nLpi3a57EFl@!SM
zn^UA3mRj@W;=mPJ3Yo2!Xk7z;nv2O4`KWI;Xr1l&uBQvhxU49~vn^`#)-)Z%Dyaug
zjG*Vqgf*qeDOx@W{YL(?uruhA=5>ju-VJ?Vm+klRr@cX0uL7&<T#ZQ>#ixrjd#b*h
z3LvIRU^>aRk)T*seA77HnBnIuaGZ&4i=_JZJU>e~ushUG(NL@VvN4+JPRxv`F@kDA
zqDnPl(`NX3;C3K}RI?)sf5wy#oJPxo%iXb`&*5S2E&=L4amZ<As%h0;n(3(6lBJ;!
zv<1A{#+liw*2yc#T+97C2tG7eK$5yHcAZ8PZh|W6nEG^k`R(*RZ{#zP^;FUEb+i{X
zvdMU3O>E|7v>!DL-iXQDB3bL^;+_`IXoi{Y#+s|suy%ahcIS%htms5yVeg#{UnR>U
zd2~YTXQ$iP2niPX!2|83C1~=k!A9hA6!T$Skh;I%pf8v?;6x5zKO@gZv~ILv+g>tf
z-VQVZPfa){j-L67orL9-_4Y+P8gaOTRYG|wZ`^Uu4z+RU!y?P5Lk;S5bu1cb_C8)T
zr_58)TBI`w2}0?g4TMhpQysy$)HW9Ew~>@O2;OK~<f$x9|BY<9Z=>Dtv8=h$<M&C$
zL!0ci^jVs8li!@4|0+m5joppH$>VbD@F}CwaEoQ+s{sO6b(G;r)vSrYB4n^}g!jtH
zF=v8TnO=7$&WbZL&dgudYZqy4z;K7jg6z@8Ts{k*FbZ8I_SR#BEMz0%QZ(_RXa+I5
zq9@D=*h!}*_Em`y_DtPR3ThdH4$In88yNAx!KX5^GR89~7lA|pwkP{>A3Tq4o5Bd#
z{TtS~^XvSOm1_K2rMtrHauA|KcUUn=1~8k7)B}luc&(2K?L%ILHG4s*n*A^x)4~eY
zKJmiDEy;`Rthw9Nl*IaAW8<Kz;9arcofIrA(ynrIMoOR=1nSDWR6?^1vo}fUa_eiB
zElefM8gMe@)gng(Fq1hEfR}KaO{2#Bl$KGx&9c{1^Eq?i=+O}vHk3t#eS=@aX%&TY
z=PX;Jr*5Agbp_9*^+w(MaIeK5T+>Q+^`KtoeBc~s+D`Rv5@*%bdu^>sVLcCYxvuIz
zIu`(>d{(R~xs+<Fop#Q@Yag@a>$$ox0!^LTh@<A~2!=SezPSlr(*maRRk;OBVa;H{
zM)sm&u=1q7nu#4iuz6T9fA_!_+h>RUK`;7?RGeNVW7N#Yxv@A}nYWI@-!D5y-|^S~
zTKKq^3=GRoJD=BgLu?{@y9GKBENtd4A_OXPI^>v=i%98RifzM7w1j7p&k4~qY|Jpl
zV7QQo?mMTJVBUSQSOuXomPW75{_1eAg(m<TMthghh=CkD&jf7Lux(z7rC$3);=4QN
z662#w{M978f~8WpmKk(TP?#?l*?qx%Rm?}NLFdR3YbZ7Cl=42DG|${U)-j<(Ok6}X
z*Qlde@txvj;xk%>YXl{~etr->G>fV9g2w!7GcyNfU|GIwaDY`Rg29ap5|tkEsBc8s
zVy%xS5jwe)o4Nr(N-V(a4Mdm!UqrKW&4HD((R$b>L0g$-1sZ!Vga{%!k&1@eyb*BQ
zbhonr<I7kq9{$R*q6>+&Mt<f_aWK=3AnW02u1*1xz!=*CxsGwVpX=aQ^C|<(qXg1M
zX>`A{|2M69Uw+%PQ4%J%iYJNWDv{kL>4N%kgHPjH=LRkk!E@oxG6S%AlPqO1K)gAp
zLM%gXZuo4pVcUFOI#7prt2XmjEqB&qvpH4-6zLZTj5FFa@j@#YCXqXrnlMY7lYvnM
zlBdK{NT?%p1Z*V=YePRQYSAW}^m+2GRyT5qGq1I}iT?PPuQ1UPBMQ@4%>D!E%)0ml
zI}YuUlzGAg$cQzD;N6EsW_`%Kx~`z;+p0Zz;1^Zq-OYFK)}H0xmhSeT9JPXq43$Us
z*&N;X$@`Rb%@<iVX;atldCwlJXA`u&D6l<pUK)&&>W!=F2%O@^vJ=9+1X);EVJw>H
zrT{{yido!VCX5XeUN(%eqRbW+jP<YiItX~auVRs<0K(qx8SEug59I6=f%bc9LTc!b
zKVeH3>mGQaO*n>-oT$J$F(0>(ge8{2GiB-SAH&Q5=QwqZP|iuCyLY1oTSPS%pQ*Qj
zD0QPYrz_5dLV$`XB`l<Emx7g~B8NOp$4?z5QLr<rMvd=+<0~C3WQ>LNZL~Zn9;5~h
z@SSmQwmj(Zp*c9EI*E4a!s%kX>KeK$B7APd1{2Y%ypkhiaEXT~ec%!L&epa7f?nLd
z+#3vdv=Pu_l)jKy6o3N>@}6Y7;sAO0a9v#XUx)4bAh5>;N^mJ`4US&7kA)7J;-VBH
zASZkG3k(@mKRe>W#uM8)HZ@$v;rRW{aJig>dZZSy9Z0}C7@RgG#*SfGXrbmMp^vHP
z6b(nKMGmDDf)n^xBZsIbzLbkb_ahCQ=f*H+Dr)^9G$e~)5KeV3Lur63hei2#xlE>W
z!Gqz7EY(~gF92=J8{!oCMA$aa6TB#87ak|02{xHs?~s(SP55NcoT&?&ij|h52x$2v
z6W|>|r;g`*7ahB+MKI@}(b-mK(5K7D9QVtJcefbsKA1!=k;%W<KkW|ss(#nh65F>`
z`)ho4D9ts$9QdIi-ue)Th6*(>&X%L;Sa&F{=4f*>UfjI*Od*S#(LqU-W@278N7FHD
zhLzI67nR=-6bjWen~!c9HUEKKYaFIS^J^f;!#EI083e|uy!{K%N^1yA$3yn)DX2?%
zVUAW)(aTw_iZ}svdt1z-5IaLtxBXBMQ9py`m6nh&n6afMPHJN41mz}Yuv`DbVMkY-
z1j}*|d<Jh9yOqw~2VLV}<SFxrw%1Mc#VC{iw+7@HJ=MdFDVR;(&9V>NRhYeQJ;M!i
ziSa|!G`7}dCi>M|E(cY70(@WPE~)^Qcc@W@H?Yp)s@q^5L)^rp%mJNT)me<qNBs4>
z<Fd;MRj0_;jP2&u@ht}B)@q^csB?`#%O5N_x40Fo`(X{vO9y9Z_|%a2IAZc(xJ)ZN
z^uA^Ye23Lp0L%;SrQ*#N+}WJ-Y?0WT5?qGKPU+<Uc&Jm}OtQHyS7bq&P=)R5N<@P*
zvhax|U^<0+SKFpezT%^%H!qKsDk2|1mz3D?!_%|w_wAyQ0(aF#mg};>kNQFpcTRkm
z+k|iUxCd%XHWwC62?ceQna_r}IxA?mGE?PO(RE~1ED(~9X1Q3nEQ7Wf?TquK@%UZe
zS8fL;(<s8J!8_alBu|wAd)#=@w9x|VVfJKY*#QjJVqvK%KYa&gYUrKxJBr&Fi5fy6
zLJEsODnZLVcO%cWUiG?{7ZJZ<rlGPTJd##ZVK>5x=1o`^)8>70ILl&Y?fu>v>`Si-
z-B6186fm6*)X%&vZYc&yJNj<B%(bCLc72`84%i9NIpl>%Q}O7w@-$E{WhE@?2vML9
zO-2fFIX{Su;366UWo?fN*rX3$kNo4@+UN0qt`ciF7QqNm6HWDaf5eY*i5IkHc;t`t
zJ_$~6r&+0Ri*PcSWYid2M^uYUXjpvSO)7Wlj&Zz$y$l`4e;bdjG-04VRX}lPW99kx
z<7w|F-b+_2PjCR{6iXu7K$ELQ7;JWr1>a#Z!J2E?I7_q`ZI};1gDCE@1R7QaOg`tJ
zW3UWFaxv$@3_46?&?zYhtte!Z9MUGTb;@DOqbAL?!2Y=doYizE%8E=2%AE3$GaF=G
z0>&#%TLzap5C9V|8i;to1~iTUS6@Dl3~M41!4fIXySS``l6g4GE`_HDNXbK>OdW0<
z;B&_lfo+djc`nn$fo_#csaklZA}sGHbFRYl=J@KsJH24bW~oL?S8`3k%9j4Y&0^bH
zQ8g2`95SbQ(=?ZzF+#UR)gY*6BBz|R%gK9)O1?iN&u`~ir;77m`&99vW|77!S2%s6
z%8*9;xD|Z|tj(HYMM_1wSv}<jg;cR#u4E15c>IrUHy#yF^MOzBhGPu$Pa$X;LejXV
zDX?6=eCCr{m)DKQ)?Rtk7&@eVE;vjsmK#4hYIgEjUaz5Gp`2WhcbNh$I8HxMLnFko
zscHpA2FwR9w;6{F*VEGe_q{0bA}t(eK5Re@vGeXlOW+$LFO=LT20H<?9azqDTF)P{
z#TagJkI(l&KjJWl;8&#}hn?ilK9PIzQ|S5Ir76cYpN7Z?o2#?c<A11UjLw>xtkUB4
z$EWD0t#$u!NT(#AVDEoIY7F`b&y@Nl@Va$=-ahSnasBI-lco;(q}~WdbWIa1R@X)A
zEdt;}(13~s1P_NKnIp6GpxbMIN=xKt(;|)Kf<IP9->z?-%YyUgjj(y<E`OKKKXnzF
zc5%P_M&Shh*ZV1~Y~j*WwftBday|LmbZDmf5Ly6zIw8co=Db&oE4XS=IC#|`xJ{pb
z22I2xrhJwlQgLYYAL?O|s%r(0<*jfk8dhkaXf_R-rU9hNs=+1L*QPM5y1FutnwB)T
zAUCw=qfOBV7%tSS!~zAM1o8Vgop2Hit!V1Y4b4PFk0NZ1^)bo;M!;P&ai*SX%QnJq
zr?4A*pb1OH*{;oi`K>EuquKORjiuMY=hTzRu(;(ZEKbRfHFx9Ai|0Qbcyo%wlGTtB
zyW14M;+SJ}?Pc9yU#)ze&3soqEnpgtLDcKK*q9Bm9?tYrv?1JT1ovf>Cvc25<YEDH
zP*>`v3J`9V-Et9cvT%R|z+WhZ3+)Y73(&N@shGkF!2r6VGixfogt{-n4B)Le^o84I
zEuw0$1%)~m%>*1ftqSzCn-vS=z_SdP8&WoB%NqAEe9V2>JJfSzvTUPIX9<rg2;l)8
z{k*t=YME`>6-MpKn}B*-dv-0oYX$;KfpHP9KkXdkAfRWiCB|4EhDkCfi{lXsT{GDW
z>bhp~<Y~EbH*4DxbboC(4Q+I_mfZh)ad~*!>A(JeA#474@zal&=l#n=B$qvG|5O|x
zI}o+x{A<5vkbdP~MMMHLhBdC<afpHQv1fO4lE$}e-W7v_Z4yV|C>0+Ao=(r!ydC)Y
zm`p{-g2r~)IUmsRbk_P|LzF2j5b~K~6d*2r4bRAZwtD0($&EJ<UxqBN{>XiHYwxl7
zbhh@J5pZwW-o@b+%iGFJSI4L#n#%ieb}1jCb2Uq$`_VXcl=Ha6P5kZ*Q8;glc1;Xn
zyMJM!on0jUksN>fSX<AW#?KR?3v@1Ah>FX9(r=%(j|Mc5$A<;2q0e7f8ZB9NE)Pt<
zJveWjwSzN`I=r~QT3r|I#NybXz@!2QZ!}6e!l-GGwwao!OaJp~80v!yx?s?}6=e39
zbrGfoL9;Y9*wAm@&Za&3TwWw>!W(hJ6X19iF~l?Dp~dB?BCyy^2FZAi6p(a!BaF{_
zyFY@MmraE668P>@-RZ*SFM!hhA!17p3BNGFIwZq+62G%b))B@706^0`QeW$h2qn;X
zQ-w(cN@KRC7CtQ+U_PW5H!I^)?y|L-t2$VLVy7*TX+5SsnvoF~N-V}?=(VS&8K$V?
z0{sFX5*}%df+@Dq|IGV?iZ*^0ah(^?98QuMF$+`UW!{$#(9@gcZSH$n<D8}n?u=$i
zH8$;Lv<Zz4tlQ#v5a)IrE0|7PgPVM}6zBDlBZCW3zsi7_lTL5m2ba51rvxlls4@fB
zH+~T0lCJ0_vv-YnOpIpHJMlkF6q4VOo+hEPM=iT^dU>WceIk6ZUacnYXd*l@%-K1(
zK!g(BbWf6NW2<n3%SMg@DJ6Hxv&_z2J|XKDFOU5s8BCDbB=+?xcGCElNIn&_a!m3F
z!{)mjwLB|<_lq^j+z&NsOuQ2`IxSp}@|kc!s!JK}AHToYH&YY!CbW!>IoB?8+hof>
zv;d43-NJZSUUBm4-0zp#vPby0FzzOWn9Wy_dX_OBfw4kKhPTpDcp%wQntFsoR+2bh
zvCk`RzS-#By6(}lomn>9vStI?oOz+K*t2|%$0PZ=dWIR-Bi7P-1;lGlST8lEhXgYm
z`+0V~9CC8AAzRT%JmEp9)EShAiC=teIKfTvQO(0k!B=Z}r!ni>oFA&M*mJ5!R4(jb
z&D#==ey^B&%jys$j>_f>@#zfbtK~35kaj}<3}NJCwm>pID@v)LvzWxt2tHyYLf>9#
z=#8(g$A#78x65QA87E?V%G_m~U0)9k4f_4y0SaRItgMYacCfy7aBYJ<Ld`iijH}6-
zx~4>>nKm8|)mE#9)OcLT&wlOejCfKC3`xoA>()w3IjDb$BIbAK8t5niAVa7%*R7fg
zYP?e_sNwmi(8AUo&f^7K#D{`$U>IHA)f^h&thLb?YKTZH=nA#Tj{q$sNWk-SE&;|S
z%{S69m76d}y2_z?s1J>~oxTrHYZ5_R5-uI{42CXEy7X8rC%_KG9*RqzcUIu_{8&1w
zv|Z(HFxe%UyEp#PWU;wChgjP0{G<Klo}d{>F2i66LD@x<B&#N56u5;$jy^!9lp%Qc
z0~Ldub1`!~U%T{Zw)_?cY5MKk6pFwa^|qJ^(WL-bK&QX46=fueSC(2j-$HROlb355
zLOz4@xSX`;Yd?VyYwSLxBz<*z&Zo<{FHZe46{A(*U};)#Rbrt;EQ2$?ccDeuyqv|=
zemnF&yP9Wn>keZH1YdUR^@D#xS_W2jfriYK4~hbZRCYx+?$O2<x!w&~oW>*t<S^7o
znZK-)o;b@QjwIK>q=wZ4Z4}gYLNL_cnZG`bpvb%=P>)MI`w`#q{MJ`Za0na?dr|av
zH9SUK6TIo-3`X`Gt|glaqk{)SIGga!;a(co6PuMaUzV#g#QC_kIyRlMgo5MlQ>n-K
zVP0ZrAdwC{8~_KClo|QwQ;j#9j*$tWl0MbYEyNT8-43ldE(IMJ8fYT!$p!s^%_1%-
zimeKDvCm?m{$tu=zCU&&!x-5{GVEHfrpHkeGs#i5NUA!d=s{9=Cxlqy<kTM&I@C1A
z16{&8dB|x`fG}+uQ!C^ctBb)Heb9q&H8U{XoK`rAXREnC7=AxJQ(9TegvCotI-haK
zPOtVRUkOjb0LOnfjVYos2|a&Rf+i9^&jf46ea!h+vxw)6B#8$?t!2H_pooWMT04X;
zVIil0I_kuCcDvhB#3^2<cZsoMINv2)59Xy&WT~Y0$UPF~G^T+(q=R|Dqu8{rNRRsQ
z{K||X97q+Tn2kerC|Dja9$rBA9-x=1DL2SdK>SW*PGw0+N+-slVgLmhcCoa{$6^68
zN5F)N-npu$jJvri<BRZNhS+WPfum+W_~<$6w8bfeKd4C-f!ydUjhb_Zqm~##8fnHY
zq7hWgUgV<6miPXCA%e|95Zg3+pIFa&y1A2UsOYI*Y+p0!D?docaqaQ~_PFrCGH^bC
z7Z?tiubQ$B&_`?z^K6D#7f}NET+8Yjnq<e3A&AXrcrH%g4v$`6o_{wyd^>3Oz1X$`
z8wCi=EMmE1lORN;XoYTft<|%eNVvLk#sIkM@5l|xL4=+`pKkfvs;HD8XvHHZ4t>d_
zl3*dQ1$u-q>IL%dY&CW7@t~6a5p%jqSGkl$LMJxK3fW>fy1w!4mo<-R)R$ou|4TFz
z$yl)@`o5!s^nJ9LTsNc5j1K+HWU;`1r}O1KbYJxQh>u7%rqK4MFU@Y~9}csVeL`<0
z(1dJqN>*q-fnxUK^PluLHc`u;Om`a3y}yWU#9u;*pKy74{ef2D4OX7CX$Is+`ITg;
zWqhZ<6Eh_`DEuvCNa)F~7g!;tswe~GF9m7V>XYn)|MKbvOVE)Lxn)fEqr6{aEF0)B
z(QO@H0drhG!)%HEZXB^4t*cdjZ~KsCQ~3q3(DaX9H#+F^@K1Xp^WQ>kH4C3orP70P
znQ<~{qAu)>N@ziH0fxo=v&wIq^3?o3!4ZVPF~5AIm(z4+ev9w?`O8N!-mu`Kg9IAM
z^%7*^yF&lovL;|Nr{j(Oxnm!A{4$!vDLsjVo^c>%Wh+EN(0h*@@tboP>T;&Rl;#o+
z7<<1rm5OKzHs^Qp@{Z}zUgiJ+`r{gj!suUkB><IDYOyL1t9hQvicjRvcS$l|E+@K>
zurU~n$9VbcND%MNT-2uG#SeKMrNJX4KA+?~DXf+o8V4h8;26nu#!4<v0Oq4dslq;p
zZE<*XcHB4n$Heje=%GWHq<yB$6f5C&yzt8)5%BBd-te@2{uAe4db0TqUnejBWAPue
zC+3LXe4wg`Q&0Y%s=7D>r$7%_@Nm+akzeJcqH2gD%1u&58KLwea8Mn7l}TKhSGYTW
zG`J)z-ne5wF`${_Y=xjRPC^;PBZf6M!To-S7vt(Or^tirMeJ15pcUmv@NFFE`04Oe
z*6vqHtSf=u0g-Ybq<w9ASNZ8%V)S5A-CV}$qzH+@;yv3uyqgLQ2tHr+>10`s!sfqS
zt2RI8N++oxAve7ksZXH_&x4Dv!U#gQ)>yUXVhO1$=&9Gef`)Z)FD)1GYi(<&-Ndib
zF05~F`Ngqp-~2~a!!ROz_we#WJe7WOQ6mCwGB2V@B+jkAYeG1@>>V@CWga8g*8qhX
z1Bm!=&79@xJslGnP5;=%X*Yw!a-vrNm4?d$x49v#sUfSrRVLo!$oeyIz9oaV0T$G%
z)?BVU_8@V-WEmV%c0BDZ_rSXR`)yMrODXK64jO<)@`1o(8i*^L+8W`v)?|BNg1ftO
z6WpzH<GI->tccB&YmgRXo&eG;17lRe9JAq2DrOuA7w7kk;i1E;ALZa>K#ny8#nXQ*
zshKNY05ew}*A0=xM0+tHG-{jK++(JRPvyUV4XRWIg0PNTKw1psDvj$IO9@>%sd4%M
zBEU~oD7kMvfd=)B_?BrUDka(3jnlE;38HU^hrk)|mKa)amjnM5hiufmV_>+|yyh)i
z3vdfevYX(AN{d5L%2&Rcp%0Vb6+o3mQVJeVR`C#WaDk8+k0G}|c!e#U+ePg6k`=7}
zV?G9vq-x0FJ$Q3X+=``vS0n#94`lJ75O)B{dGJw2Sn$qUsiQ+mQb@U8_-<X@MV{AH
zrB~&ec$grwNjQ<_sb4|g(V8EQukzqT@NRV-aXLE=iVy7!-IBx=r?a&M4BUub_8fcl
zYvs;TciYSvD^#-xtjXg;mW+4UKi_PuytuP0fTMRZ+tRTZESlK1ISnMossRmMq#;JK
zB%alT+ZiJljG5(YfK?uP6)?6792_Q$v;-?AfD6!4VZ1dqOd9JO4SY3+7Z}IR$G0)#
z{>WB~8u~9C!1CLM#KKLiwo#xj`QuRfEL^rLplHoa5;b=5qHD$YbeTA{Wj5bpM#wjB
z7SGf16%fCX4$VdKv)@53?)Bbqmd)Vu?IHUO;%+(g1}(Mu=H%<Xhe+@t9`o8yq~l>q
zrxVBV?l=HnedqL^zNN<6^@jC^J#9fRu<F&BSzRP?;iodN*kG!-p*?V}uSj@`yvZcO
zoOJ0wok8@^t-a=M^U3Zbf1WhA_I`B=B0fci0zDJlBOmpZgJ3cjj3D`X2U77os=h<K
z_Z<9I^OBAR#$u8~p|IX0b?eDE_jFFzc9M{O5!n~vllzmW7!zE$UtR5k-zAmZ;Itnp
zC~9=%=YIViGTT-0HS~S`d>}@M85po2L!4ZtWyk?JY~E)@G{-5s6F1ONBex>Ea&X8`
zU}mOEwVJ$dC4#3u3R&nq+p20}L!9?Te=-X%Z6o{C8c{*WC~wQ1hk=ovO2$$HS1(c5
zs(_V*=rcL3>sqQGsObILZWo%hmZmodwY@J?3F(b*hpa!&rHTHRVsB_Fo{!Uo|Jb-G
z=0VwXej6rpFppNL<uI@f=bRxyb5IV0YV2P?XA1RfsD_a07s-(QjB4H)h#14Q7dOQ3
zv+Wg9R9$4)ci?x}@K$BO*i|0#LaXzGm6&foVj&NQw;vf`V9dGOS0=B4ULk64v1|s%
zuzX?7rB^Gs@X&1p!k&=_VPn^vqaERo={5cuQkgIQC~s~*e(^`RyI*^88nt=9y*J>f
z_NrbWW@EqV#VOTzR`o(bH=euWk@KpvQxfh`FF}pe;!BjP9$of&98*G1nw2G}Im4sw
z8)gBjOK>vswIwu1ohbyRi{Cb9p5W!Hr*epp6i>|No)d4g#DA+9i!*>g>0OOdmN}U(
zZ`p5d$?$7K{mUm~YRjuA9T(0g-b}^A9!v3x!Fdz)RFbO#Hm0VZHrWvprAB;JPso*U
z#6mu8lc@}ge)~H}>uBq;kGiOV5N0^P51p>Y_jEF+Bic4)w-q+3VPgq;vEW>>m(eWx
zqch@$uBX!f5<Mp9oVZ^9!`LU!;(G`>Hf<Fc{@EAN!#@iBhorPmZ$BCwNzM3oZ929^
zd-D;*;A=5+m;!hN`!+3<74hKjDgrDx0vPWcwzKN5c-4tdEYu4A;FLzi(F<}}!|lRD
z4aS*8H^%a#Pm9(sU4QR}yp6)kS2LZne$PVLvP&dtsHb8@2$QGL4YBlsNfZ^C1xR;w
z5PLB!RV>v}i?vZMF2Ec30!*B=-_t@k%`zIhWa2qJa2|*vQk5)teiJr|d)8W#bT@Kp
zVpeg}Im5`Q;#3X%RWK3&gf_6V&SwVD(Col_GmM!Q6h^nJC2WAhIFIKN*8Tc&aNK=!
zu8;;%tKYf^9I~11UnIbm#|`f_z2n8NNdYGS>T)O%8Y-gYVl|ryIh-7VgDJ0E;sz}f
zH3aL<1o6Nu7sWR>a3_PO1O2lRo-TB7R&cf8?GRmPj-)UaX>>aT2uiumGme~l@jN_5
zH0J@t#h{lqGkTej3;6)cqh3l2_=p<?BfvNUadtIZBg|q3j)@UKz60+RikFJ(gCjO{
zQ&mGfoTv&+uMx2|m69sydE@o9RxvQcxBv%U7#zRHF&V5|7wx!(vo5FWk=76M+w8+|
zlHFL~H!MtghUBIhx+7UU5cH7K`dvXSb8}PF9niS~n`+fAYYA$RCYWh|-#YzUu_ley
zBWnK8J_>4DYrzn=@*<w)Cg4IYWTOnSjGZ$t%)}|va~lm7G3|OfY=$4=1vY_)WGR=?
z*O7S>0Q=E}Bozywm?CPh2V|+GhynIwDD{)H#*48;q43hc^=$iZeIoPlG!_4qc%Bx8
zz&59&VSC7e6G7&_yO+x^?CxbDD1ILm1Wy5BZ9m7*V46SN0DJOB9t-rMUl%_UF-fr(
z7Q3()e1f68QfxSO7qPOQiJUUTG(!>grQWN-%oOnD;D!I=zBr*@z$4$<s6Lp)U)T=V
z0OB$IAham2D4AG;xQ4)kLWVg>sQD=Fg>!D&%utR)WzLpw=wXq+)uY#s#Po0S)I1oL
zoy9$0@yfc|HG|V<)BvXLlM@=YC#KX=fY4NEV!i1!T)`Y`v;^Rg=Jhb`6QBO_588Kh
z;hgy+-<cm3my>*0Re48rPircU=GJ;s`$f8AwM=+=ToES)m+NXR8y{@qkS)HI=JZG<
zxX<^5Q$oW6-f(cC#g>-S0NWP)6t;}+v^&x16<B|Uew8=D{cPA-TW_8$JWSD`8sI`$
zxnM6Vt9wl6*JTHH45ZdAL|f%$3N(|~rFD%te1HPqy;<?=t^?Gu8WQC;j7nsf6J-4Y
zoqxHvo|I&8YN^~)CSgu3g(Nrrq*axN%M2Mta(CnzC<sP3%vd9LKO5Z=Z<DR^$$d2y
z6J{SoFfEJ~Mglalg)k$uWi_U*2=P%M2GRGx4><(XkYU?cF4j>ILuOteCpMX;^-jzW
z3d5u38_osNJ?{*<y}Wo3=_wVQM1I7l6jQuOy`@TV?aom;Hwv<$%G@wNxRgJ*G|jPY
zCQU2kp=ASp)Do_##ys1!&UN%M+HD#fdUg>v8B&ZnCl4Z9gZ9xrPwv9_+;9<jcl?#r
zO?!qH;Yv6?N5H3emx0Hk8mgSn#TxP?3ZxJtBatD6HSf))Fgk^`Zn3L_w$Kt9+W21+
zOUtnmz^RyxEw1M<Y>6bwP2gDhW9z&<7`A)X#mtI-#sOLK+9aAB1l5(HN^cfmF-H<|
zD@!;>Ea6$_Rj)N@NAgA&x9v(GM;bTkS#oC<=TH+ppTqc}^Wp)Kc=BDqvOuHExws30
z1gwF~<Eo`n9FQbOrA7mV8kd_4>g1v7F9Je{gTRD)af}?EAfbgwcf@rc!?0MekT)Pe
zvpZ3}FC(Vxm%v0=Ajnk3mJesEY0a(I>8i3VS4%`4iE+jUlRZs1;FaBzkQrI{5J&89
zHB{69=Y}ZvTi~{Wl>1w-`6VC4ds(1{bsKW-8pC?>O3-(##>n5`wL%+<EN@sOsDF1D
zpGR%DzSqlo4TM$@sY8M~3=KBf^I*`jeaGS`mOv1<tYyWk#CL}XUn5C4Z+?<atKLg&
zPKB49DZs3{7u+6JH`Y`gQT8!=AGQY(v4}J@=w6&-@EYlHiF3zky_#Fz+uZV1{#;`?
z)++#%xFWkh*{#|9S-Tb3A=*`11b?Xm^ut8dKibuV$Futj_u0cl<c4vz=EVo%HvKRm
z@v{y)6^w@Zdh4HVO1$g`?1NBB;bOck>6t8o0_uZjc;&2|9Bp0NYFwR8j#6R|cY3(o
zy2a!iRb=b|dQc$ay>hVF)r4fQ$3YaUBcyNT`Zw2)x*B`6F(@!^!o`Z^I{F1y#EnTB
zoTFz~bfVu|l53kIEXgRITSy6&G;lk{3ri*%-A_hnOE%B9*HIjDA{`;ieh|WbF@hA>
z5;}(#nYz&ON~rJv5pqze){mFGl`c1EYltFjqlTEt=rp`lEn`3|UvY{&xEJAgSj}@g
znh%hJyraQ$j@)&ePS~^fF{DDp?5$IR5=n;?ZGa51&akuUW;LW{TDOiG^ttSYxe^4d
z$5V&pT-zH^cX_XbmjAWK($$ui>6+%U(&Uqxt2Gabg8?QFF<D5+Y^aC2Rwl--jk3sm
zEj*HR@_D9?sB{Rx!JxW9Y<KZbG{efO_8*xpk_E1EMxBuySMQu6-#-wT)}jQiasorm
zf<aYg(W}Fq+|xoATBH7#RKabqL73M5nxUVot1ptDg$-qRyeJSw&AaF-88Md+ja+<J
zlxstR3~fPsaN>=Qx2aalf1;4CE|CW7n#a@(PDl2xutkMO1`4G@W-v6<<A{+kaS#w&
z%^oDD@@@8^s7`X%+G+RAY4??d$y{?S2^nJCmy3IAg!V`nO&u4g%&=xi;Q#oY!~mF2
z4}2<owQ|Hm)Bwkyh}u6H+vQk@Mp2qH&qE6t<<Uc~Key}BWiri`V1WY*{OdS|)PKTl
z%wzbdj*AAb5MNP6ui|~4kl-}~nvlcA5}OGtD3}4Bi4O9y<OCe0L{HJ;u&av%{e#77
zEV2)VgxDG8h?7uNj38~X#Gne;5D*_krx_iHn6wgENhRt-$Z2xXrD9T5H)LIF;YZBZ
zpc7~g)Pc(|R&o!lZSs1`;=5ir2b3znpqVK1fgTs(lY|`N538=os-aagi@Herwk@9^
zobW%5Afz+_4y^9AQJnik*Hcu>L2xwt7lTryX<-|!5>)sM3~ppzm4m!xB8=wiexB%!
z7lb5fG!lp=Qw^L)5C=3!)yL;*M!cb17Ho=V{He6WH@RX_gGPEw<-MlGLt+PSf%;6A
zqwS4|sYOa{?KM~aZZTCKaU3fo$qh(0td#hryVS&;Agbdv$E)dlsOa!RA8<bCFT>HJ
zr~#7K#Pc-a_mRVosJ)U>)oS?rFBnZe&O}7^q#c^5PB+@|ot5eaj=sRlul^IVIzQ<f
zYmQQxsH#pCr>eSZkNrYrr;4Ab>6)`sh1r|vcxPpbu@?%ygqZT_e@V8=5f`yYM|o3I
zG~>tTLtQW!m_WrUXqu}76tAyS$IO+2O<Z3YazU<0<u;Yiq}I@S11u@$8|M;{%?ZDr
zkcfqRG_3^Z(I-+_UEbwCA}w@(c-9{DI!D8P>+Ir`VH->ZNfmo%f?F_XLm8{Erip^I
zhpy)??knwx9k>GI@O?F-b(-Bshz0{+(puSu>seqFj_=a(Bq;(;+S6XGnF`d%Jcx+1
zq4^LI-n5V3mx!<uV;S|k!|&Sdi`Hr9`?fkxZviABbkPtQMrG?zSBthtxQ|I}BM6d7
z&Zdp|YB48CJ6}id`r5ONLVN)Gvllfqlzangd2hFAbLDdRDuOCxnFcz`o1A}1a4Nd?
zx4C>?k(>iP`KTem91(+bgR-gkmc}#9-VwUlyi4apPVSJerbBm->OFWYBb7&{h&gK$
z^U(tFAkT;S$j^zgq*phpAP$t&(kokvZNyNSF?0|gULhwCj-k4qICgTH&eAEhG`7I2
zp{Ldd+=(0q#5%Fq_vfmgDzqerZ`Y6ofZ$8>K&=#h?eo90n$OL5Xoo%Y9l+u+zKueW
zn>w-v>%S-ZC+dl}thrxwzH431pe@a&)pT@m={Mvd!ttF?7>)Wg!lBeuP}q>{1Rcas
zGP(w1<!%a1A`8AfS?<8|ZwJBhJ0>Td@g-$h#zSD^)X{9yVkf?E4XRBFEwDJ_EXJ|L
zZmNk`JOucAV>c5d0Ds)ZSAp54c=#3XS`VZViLL$3yrS`YpXN!0^_~dr;n;L#n$fN}
z3jsWFyP8hX`%X{eB<f#Yw0qxo`t9QoL3$h~Fh_r^h|=-xqQ+a2J-MV#==`^2hJ)_o
zWzjX#x2}roG)hKXvfx>1DGZTnd=kJws^F#d%=<_TL!p_x7LH)ZIKwRTuYn=Z4??t2
z_>=_xivGqSIjLk<blv6D5_Q)%>K0Lh!@9#p_xzXc$;mIsYC7z--}E|z_C}G$HIz2h
zG`@qQ4K@;rG&Z7nM&iYNIMz%;1CUDdbsjq`XLQC7ATr;dWzqz|6{`ejG_hi*<+qZw
zQQs@z9OSd@A~`Lhs{f!hJ*|zF5V?Oxj@b{(TS?A*hRY23GXg`NPmvDCp@Smc*$jIH
zq1_}9KNm@K4J}|rIAS{0_#48k>NJgiJBwMNWb6o9Z9uT|%-S)&$UZu<tE<Cah#=Lv
zii>Mu2`zd#)e+tu=FigbUr$!~?J%DZpHe(M&e)>C_aa^!KXtCL9W_=e5~1&TX_cCR
z%VB$21-zY^)(o5L@D)N>T}Gy&ZZVhy+QV#CHp2gF#+4JSGowZT%tV!L0_nK~YTzIk
zH#zK^R;#7GOkiF$jx?TcWO4Y$K9gB+vvSUblY5P2hAVu{zA^<k271R2C%09JgG;4*
zp;^&QB!JH5*-Q*-3Kz_-Y(^ty3rIUqse%{_Nacg3NQ@;VbJ&!rn0ezzD67-PrUA2j
zn1(lFxN(XY`6Xi7Io|`yC*f?UrS*=_UESE#N$2s(>ZXR>@347~;7wD*)ewboGKueL
zfX(piAO#;kk|EXMV7W4c|MR=yW$95$L`P3f_lhQ86pb-!2T+yPWZ=pHT_CF#%M_(s
z^+c(vDh2;mHB7_e7_Awmih9XnG4nm|zvuK}xE72WVn>=LAHbPaMG(rSC9Me`y5GNT
zV7bL1>?zqW4ejnpY3|{1h2g5enZL{h&%wOnphvf&@=BGtp?j5@E76P<crWP{_0_Hl
zY+foG{hVDrlAakuap{_650W$NOFB2f67ZhPrqk6-f}5|B<%fihxp}-W5TK%O*5k8y
zZkjfMqE0LvYS>$o1Fg!XIEIi5fl(jImnzB$HO8>d>Ps;-6k=j^-wbH2ZI~rh^+hbE
zVXj`E2!8Rs8QE=!mz$RGQb>(CROYcr^qk+D(eZ`1E!|S$w(c6>t$Iu^Ubv4#d=ZmD
zI!^qRzze#}$T~&VI9*g|lXgs~Bj5c1IWe&Qsu_D<M`|dS=TJ~056sR|U|7JaBvO!b
zSco@)G613W&*7YI+F#8v-Dg!lCy!LzDWl!+<q}(~kkuwCx=08%iP8%=WgHa`a>@n-
zrg$XNo|`WuBE58l=IoklUaR7#bf_CePKB1uoK~htsV-eeYIdfkg-KI-0+?&sUG!RF
zJ8ydZ$c4<S!UlGYGfvbjVdmb#D_-YVM!G=CU4z?tz+ZSyEdJ8-XvuP;Tf$$<m9&6l
zKV^fq)F}|NcWJ<}L^Vu{fgP&iSVBsMU5NsY#n!K3S3pC%R^+1D7%LlxO@_qP<teT$
z^=>TDc|;rxH|6Ty`s$-bK*t;EfG05Bs^bgzP*vju$&5+@-UhyNFDwqi7UZlki19Q$
z9872IVP4+YeB}87P8^bUtzdd!c-S4(Q|qt$+1WH$PkLP%4HWB}@^_p#6DGBq@lNj2
zCAZf1thqFD({192nCqBFK~8g2cJb|A+Qv;g26$@SppHD3J&^)KUv_-2Y9Q4SurQmN
zUxEFIOh;+-T)cFt%K@>WvZ_TZH)wDHadj~<6a^;Boxe;JB3khf?G$D}<GX`giIGJ3
z`ZFFh7NyEb&z1(b-1$vl=*;>-%~Idt+QqAyC4rDj#S=D0`3{1H4RgK(k2`TUBOO?S
zKt_VNXB){kwxd~c!ybu`B`D$glDqy|^L8=c>KdF!4JfYPCyV$d3GoupbLP<tJ^!70
zZ=AYgPHl*>|L+`t9gU{sTx(cm7OzgyBFIMGdTF*d+}Sw{v>0P7#|2)yP)%<XgOE)T
zaXG%n)xy{7D9(yU<&MomX_Mwz?#?ZGK1RKchCrl#R&lVTI{|c^FWeZ2O=Kq@+Bjva
zM{`ho#v?&A{Zg!i;-+61YPMznVAYsvlZTmkPN|Ui!NsQ%;~kzgldJ?{;thW+Ne~eZ
zS>*Nd`&@k1DwM)I98Do544lT_!tZKzK{+c{?n_O6S@F&5c!V@dr6h}5&Abj)#Ujpc
zYufAVd(e2qHa1RHvR2%F?50x7t;<s)(b=$;hKAc|GG#V)eUsD+Rg&8y4=36a(BW_@
z+_$ti<}pdT1zwP2&jB8b>Rdpe5c3>JW{a5fi9Hr;h4aM&*&e=m3gC#IejiV6XmgJP
zDa_j!4bAfvEQ0lE!&no0Z&kyKYLr2b(EgePWKx30i#nTf)_M+B=0=r7I(a-Sz!ugw
zM>Wu8ryD-?#YbuE=XPsJK$kqp5xQa$#a(B%H|3OQc`_-amo}5kE`VN6=}2>c+7?Q-
zx5AM!oO5Un=QJa!CC!}YsU~cjD<DFmS>pr=<Gkn}p=^tfk6Ub^zZgt}H9BkZ=!qL}
zX$XCqff?dZX^hgvXf=s#%paR3){~)eUK&HFA*1*~e3ymh&l)1|Z;2jgi&-n0-|+FG
zrQmx@{+2sI?d5R2rxTNKaG8~3HiGtLo(jhw`zMMdDs6fq*5^h3C_D%Ja9h;;yr`H{
z>AGp05eog5iHHe{q|2fTo*1q-CLY+LfNQ14w(cfjUv(I_JP%U86|+oXnrStWgl?A8
z8_i@s%S;>iwW20LKz(czx=<**H!5F^_f?v-vM{l`Wr$Wb*-5*WnTg?6W7N#EtSceI
z4Xq`_e%tYl=^_Ff=uc4jhIRBWAEtJbWn)9m11ty?NkW9h8qojd+ep7$re`FVVQ67-
z2M*`T>M01WPJ{;GO7g48{TiyCE0R!^#EcRa3aW;NlWv6iqi^>-NjOL3@VL|e?zG+S
z4^O)-I2bU<-rDXuLBWa#&hsXe=~Vo$y-ayz3Ls6gugj^zg+sg?y!JALbDCc;0a6Ls
zX*9k^X2Da+x)PNaPl2$-<E)_OH}f{js{lM+)8m=y7sJZp#fK-=z#(8(;jdF!k>|qT
zVwNio)bCGD9e24oT5ui=9WG2qoNh~f2=(mNiY%bHq^kuI8h>sm?bvjWT3euD7Ku$I
z&A})Y5Yn`|5ZG*b==F)?F&%hB)Y<7Ord)~0!+D)oxk=j>LRtl#bNP^mMg^r8H})et
z4qTfZ?qn|QvD#wL;_Y<=MX=lPQ<sC}XVY_LUz?=3YupM1lYn1t!5nIG0#~Z23jKC5
zGdx5j5bHU|+Gf9EakUx}YG<z_0j+Kw%8AF7S#rziT*N&?kmyY->G|l!{skJ0S(+V`
z^vxnsvttP6qgj;%-K{#@j~WAO^J#KGaKsOVBjZUxW-6>V;O+gbOo+MIMHa4L8M9PX
zTF~{^)l?r%8+U3(-I~ATG8$*B=jUM6O8$b;0F|`}M#g$SazFg@@dFM6)T_EbAOsEp
zU4-nb-u<Cc=HTdJc-}p3pSIrW`Gsi=I;s3UvG<FT3$<)=0TClU10bz@FBo-y39Qc3
zMhxQ_9Vzg!3CCPV%msOH3KT8s6D>E=6bk{Kh~_IO=EdVtPDY%mA=Fbrhgu+*&L1R~
z&Pz#kcdDWS)LAp-pe50~h=EUuUD%x6>3B!jY~e08)%yS+mO{=uOg`I^bOhjmJ|tlF
z0n^Hl%tvR1Jfh5AZoLfB12|<|I3}K0`+(FPbOfM@6)`JHt(dtySPB85LMrIO{+q-f
z@5PlTTurC+JUThO?7wcEo*Ew|qYU+ohsEoP&qBd*DWKoUNBO-VW^>Le|Im2d+T%>1
zMjAoVh!6O0c3p7ND$%-5uQQ+431q7X8Sz-kf*>Bii@Jy{AD6U5)?T1zLCj?$X+44k
z+xKpJPe7{ydioHvQXS3#p|#Wm{%QfNQ#faqpp_VRCRsY~0!@NbIAzQ+`a#p-+C1y8
z+Jn~7cYX)Ni?woGT*Pt7WiJ?)JO#3cM(Gq{lq>Rt1&4l#m}=leW2_MQ0avP(hvIZv
z*a8>giK^)QC0N;zg2vZ`JK%yumegdrqsw<p><t$zAnG|X<|9Ko9^(-XeQ-(v!mCAG
z09`fi73fW_S3}jd((zWhH%?D3p%;$nQn`f>k8%5w;@d?^<75=y2chx-B~zP=6=}Gc
zV(@(yY>{!$L?w%oo>BQDJU1E~<7gjvm7+lz)+yAo!+88NySN5x{}B1nf-+(%X~G#i
zyW&H4Tm$SJlICi;IcvM!Gvjh?milaUSNKw`8+A~u#uvZ1-<k#DESbz=FGQO?;tiW|
zJ6}sTq-+%3gVz_FI|%tbClhZY9~N-bs&=%&>GZZW)$}pNJ!rRBisRSObiDltdc!Np
zQT*fKY4_;6_VMui^6V!+KkjN)YQfH?3)y!-d|J@lK&+SZ{bJ315RdPN4&lU1vykJr
z{71oDc6fTxy@>uqbMFn`(VE2AL7#2vZ#Rg=F%${iq&+tP=SIxe>|KTo1LN@~la7>5
zM7Cb~dDOW^a0x*cXE&sT!J4+B|IF#paM9Sn8f2%N_<fvCcm*MM0u4g{ILb4+Aq<1V
z3OOjo1*w&@V!@N|hI37X*|4E_&~)DT&`~yp<uOFe<`zIqItU-dllg62cy@I^hs(@j
zR(Q^wo(-7zN9w0+l%3mT9g!D@C^)>F<j-MxMd8>Z<cCLG1LPPAA}ypQD;46?B}`zK
zNWc$#x{_)tA5EEcpDGn9f9iHZEDCGZ<UB5AQq#m%kXwo+{3zbAP|z5&b-ab--zsRA
z-^MU23O_R5W;E?{liL)Y4iLzgv#Rn&RdEggsW#Zw$#Dj$LQEkHIL>ioMQITKe9UI0
z&?HsynAgPgbK)&_jKQ!s3TYYQ`w3Dbhj4YiJJp2U3`{xW*B59gEC!?eQf$&w)77Wq
zurQ&q6CId4a14djqbN9+hayITIl+e+iL~OnpqPmg<0_H7u+W>MK69B*SI(s}ac4a%
zZ!i%R3`42Rf%wpjHRBOvz&zAksCtJX#?!IP@XvJXi()CRXqfLTu)4}uSE0Z$=VwEN
zYmn5N8yRaJnJ0{CZ4gmSUhdMp84%OcNr|=OC88X{*ZxWZmdN$JL%Nbsc)<mGZ>~89
zr~W>T(VLzA>S|kZ60#is7)AM=gn*oP2c46*Lxd__PvV<EN-+?-zKLEQl|!OCxp`Oe
zCGfySr7|BRz9Q6o2rrBls-P+`b^VksUd?#5%(iYg?TlcpyR<IQkrm_j{p3WJwoH>e
z(}gyw9|6H91p|K-FX%X21nn{T<0D%v(qh|H#MmojXmmEVj%ZJ*Yq*d`R##)+3&7%n
zZpN8aNDELeZv#%~ZXZ{CR-}5igOLDYg$S#Y19%YY_7F&mD-vGO$dFmt3E(dwyd9WP
zG*9A=bP%wkuy6b0$_ll|`}0QZ(z^)5<6=Zt@aH(?WVYO{?J0r-wFd`AY~$c5QI7MV
zvA7_NtSS50=BeJ@*dv(z0uAsT%oWwF=}-ZN@wzZtE=IxE*X&v1P_L^OQdv1i^f;F^
zL#=-<IS1&zBk<q<5;ZE|r~$zHbEqle4xd`?9O{c(C_fcLkKo=L$a|Aq^pSJQX+D<$
z7n`r<%&u^vy*PcOM-ClB?6@qgF~`Jp60?A@9UZan5GOQ!)K9N{-07PvU8k4*LAy6R
zIc>cfZmvCGfbs%GJ*&VEj9;2y#TeH#R^)rT^wGPsO79<@+ma>_ceC0|r~zi4&6z!J
z3hMC{f;l10c@hh2+dLHr@-XWmPQMyJ_2_gJ<KxMKCW`aHz7a5kpI5lQXL6Q74ldl@
z#^%TAoh_8P5`A(F5l0?B!9tL5d@rp6K3heJz9dFSrKB%S@H#THL<{B%XW56!3}l;<
zaeB2-h2w!$f$BwNRH>HRRN^IS!k~bfR0$P|Eg!d>Nb@JQUUJX0{2CRVN0l*%eO6kZ
zKQ)@VFQe?X#2|ox?|I_p+{b<Kd0$Jyps-mIUJxd~%w{Sz@FpH7OU^z_e~-7=sYO0h
z+oF6H&-2?%M_&J6&7*LpylIq(2*GTx@kJpbr6Fn>*tFvy2x4^^GG3<e@aA>nrJ{M@
zXiyc5s33X!+T2lS)poHhqNOyA3EH9x%>T;97++W~BbnEv4+5G!&e%{)|8YrNDncAU
zkWr(D$rNGJ<AVYz4L-Mgv?e5~Y*py0A`|TURLM;vE`d-dKq$xif{17q(%8B;gl$qB
zU~%Sm7?A85z#o0&c$Yr<E}evZ_zs7wcV<)t<)EUbsj8WoV}U9Ph5|~w5}7RXW5i&y
z@1E)QGk1+Pg!fF~3k|c<H8MW<H0dFpi80Ek#}De>OV)>)x0>N~Y|_@1OTY=|!S`Yj
zbFE%-7C=p>Q5JV6QedbB98`~=(a#i80niX{9i0{&I^)r#G7eA*!?T!pe@+B1_W(m)
zEj{#?vc6IwawY+;s3;g&Rj-<RgTz5!F%YUjsHn;VrOe1C&@W+Cr7#)^j?25H^G#y6
zj&ynZIOc;>+E2#O6YrZ()R7Ea7j2`*5rQk@hj_vG<RqV`SK_43s#&?|zxg)$ssP0`
z8LC9D_+5@0HM<03L}hlMcCZQsoE+Y2Z;7w>pNQdQH_>ddEEsz}#LLm`m?p*g0kanO
zddYTA^EQ&Vd{Yu*xf^{8t8QR?Bz|ie(drp<MUMLj6+k%`F=_79rFX|*2<a6L2sR<b
z;YjMCaCIMb`@U^na*bD;OCVMl={tDn9V_7rIJsFJy3-1lGKw?h<(=}KcK?j#s|bjG
zGcWW&eGxR<^L&Mcd{8PpvGxJ10!_~WY^R+xQ+%<4c!xmw2gzO4)%M{S9;D&`7?M)d
zwl+rM8Xs=YjR7ki6`U-rM~E`&p+?2zS=8a*w0ReG0ze@zP$*}K3pJwP9y2-&7<$D@
z<H35hjGB4tC9UE87mp|DEL2`pn#ZXC38qdvuoI+XnYqeVHp!5AfE&M-8v_1@G@|KX
zvb@gZ5~`6D=U+k`txiasG2yIWYHAE5UTmYSGeC74n3)GpyG_>w?q58+xB8`#z#9f>
z0(k$0O|lYvu}Q_GZgy_eebKKX)*>qW>w!zheb)M6_+9&Le|UI#a?<Wa`(M3~4B}8K
z<2-ft9C6-EqW3W!daE364s7|d`9;~0k_JeO4Y^F#rY3xXiiYl6@fpyB!0%Il!Xpv$
z_7`ZF$<Q4@e`;`Hezm&(vCvu@94GpvEd}Cduzvybff50m>^6z#RXF`1z8Tmj%RgY`
zl6%{Hh8k!ZpaA-SHV)z+f5z7_ucm8>?-YQa?MFzMUM)g^wQ7VmpH$0Q5Csmw#D4sW
zsiH3AJ)Y77JNd8L10Ky@yH8B{uyfuSME{Kbx%+FA8JH%rb`=-MuP%}L`z##?>12S=
z*0A2Z8wa+eIPp-ySJDtJSecJzG#xjiMRxUbw7H3e(UgmSaWiU$y?}8U|I$~g2>sLB
z-^{PM3(RY*AkKNvAM6t7UsYD;g`LFmM+}iuAyS~7GI)+nR(EhUz}sH?4*wQ^TFI$)
zLZfW>AyvPEjw|s(ji1WrHHEi-SR;xpb~{hSY(Qt31Z#_%75hSgcZjWgiNkT*7?dxK
zA9biH!ytj13!!PenTs}c>kr-NQJdaC1t>WzY_eEMgoHMD5TOEYPP@_Oebwd#>MV8;
zBXV}M#AD2Kj5Ur=;ckt6(*W-^lf4)ixnaLzB8G~<KU5O&s)5cjnY(KE%Z4j!OJ?f*
z?A7(0s63-zQ;x=F<Wfq=-vWIif4NoYWjrv;84-Tg=wv-4!EbktogSSR&Tef!TGY)|
z@Q7I{hTFTz9Z41c!&kp@kYyDih(_CVMR*R|e7R28KS4A5Qaf+pU1ir^webP#T;ebC
zJR7Badg~40kw>0If2CAWx=NQugUq2)>2ey+O*WVhULvGza|!wfhh)n8XJHm4$fs2J
zL^odlep++Vgc6=+=@LSPTW-h{;UUt!!s<|hat6|W3_T2k1H(3e_#^9o;VO-$b6fA%
zXhmO*3g1}U3Twu7_b=mxc+IlTAU<VN?|>PIzU3QeHX(8g-<vKC_4q1ZYLNYQ?d30@
zBUw&b9gHjwIZ5srCw!}Tr$VVQa@#N4=VsTEAUk@8=5^QtnaWggg8_;nHM2#rW0Fr%
zvyg}{vvv>GaIjpl6V)rbSNuY>IY|$~CbgM5e?x53{5P#}TSBgQLyF(mO#yF@e|ZM5
zBEoU!Q!C~6iK~r%#pz_AYH__Brx;%<w{Cb%qv7XM*Xr|ZsX>XZfY=c?xgMtsexFU?
zw|qr1fpHwic_hw=+tHz>@JU&nY!P(i6y0PM4p)uYe8Wl);!(uM-KO8uL&tU-7B=ul
zps>O*M#nWY{VLEqR#fCAZq<%y(Pz&^#U|Lio-c_J-h5C0Xo2!vn5VM1HpdC32jf?m
zpFgIv(PTAFq9@|0w0-+TE&2FM4A`6|gBW34BBBhV?pT(yd-%VGuUq}s;3=cM^5gGY
zr<d($A4_5DxBS68v^ilYd}=4LTJ`DiZ}}DURML_L*%nPkKmO;SP(rfL%ekEQ{b#l$
zrbf`2xD@eW7qafY$AUT5w`+>OCb{HsRcKGvzx=rNt!kIfvvHC?uGHa#m_oR;)fXRM
zt!e9RELH*;ymCRgBYVStB#W#`|6XKyXLgO>&XXJSTRbaM#?r6<E~Ik#Fk9T#HNMSC
z@ioJt#_~0t9Onq+xOXLfkF8-Cnp|AUv4?+;y|H8R^soTV@}mquXO=GYjp$4pcuBI|
zx-vj{Fy+|epI@Gm$k6~)&(eU3$IIKM2&+YzGW-B)B0t36SIH_V6DA2r*>MO$-=}fw
zqVwAcvGNU`@=f>qDW_PJULW3fjvH2zERGIJ1B;MLIc~J+WKSu__59&+)#WoF(g<3!
z48L@;ND|cmo9?p!Db<gb$lblXGj-HaT)ek2x>77q6L`d5GuDi{%4^U~#aajoAh>tj
zT`lWq2898kgapZuRvK}_u70QNxSmX8p5PWCt7X1O-{Veent1DX&^CzPUPyDUn2Pqb
zM$9L?>YSF>(O_|3e(lxm30_0>%X9Wx{7#(~x%Cahp*JIcUfG;wmLZ9#(uwg^k>U~Y
zBD!)<(g~QE@;J(zA@$;MHq$v;@OJ^FL)=Fq)UWOZGD!P7Fks%U{t@7)8V;Cho{pPp
zaY<R1qr<xxUjg4!_j_w~*I1+(L&0hB+hi7uYHKn%rm5nSOB%=$UEToEvGqzi$|k_j
zro%sL<QzeGorU9;i)_#|y6PcA3=PHVB2TqQUf35jqjJ;BwAhW8m_8EcmfFRIg=Gk+
z4dBckL&VKpsF3gGIL(ott+<x>ld`sTp?7DrKHMaFYand!rN1?UNp~Lz_Rd*+uYvS6
zrKMOW_Zw2NocyH>tEr&Oj@K6?QkOFX3pczaEx*3!6(_&Dlk0dj?=JZ6ERO{=B_4rg
z7E)U!LAQ=Mc?ok)<&V>Unj+<IN|F;~kPI#)+5keKvgL5r47CNDqtznM7EMnNk<7-T
zt8tHluZhaZYwRly3b98gZr;mfDmVv@hIp@=LZ0#}c+OKn_g0U6RbD4|G+#I+<aTWu
zOXh@kWLTIJMK%f&NwJFED5J&b#q);$r`ehX3b}W!P0UAe6ybt#N6aGOvnl8r-_#e`
zd}L2<Cg-$0I(N#rFQM=pAmfPkm$Q#(8IxJbmKkVLl7Rm(nM!=ZM-GWwc$tu8$;U%=
zPoL&DrhleINAp!nZHYl8H8|>QYg#o#NsXedt?1nT&BCunQ!Nq!t@d)W(E_pCg`~P=
zV$KH-odLg_W{oCUo($CArs~Fq3rEEnQ+U^6xcpK94sCe2c6X89&`mRG5w}$?hY(vn
z2nN{$o!N}XQj&I2vY-(^O=eZ}mgYS}8U}^T`99-YQ5GJ1aa7bki|3zRmsY}O*KIAA
zi}Y%>Og@{!#VWu3w90zNb&#4?^7E7jR?ED~=C=tQ-JE2&TuPD=8!qH?csP&DU^M@&
zD4q6yBT9&_`j<(;(c$m#o8>cc{jxW!{(Lo=RE)Rxme+fIk;5#T_-lfh!eXKClf@Ms
zHdDV~aQgZ8LxHKiTNbHtsPm&pnVK!F=?{!oU4P9N<=(9(@5;Oc{imwnQJ<}ZwJocx
zQ`{J)j!t$}Z~XeFwC(VJpMd8LH!0S6RA>6*+%E^Nxw7%=%6TV8U3vfbsQd==^P=i0
zx0^^;mak}3UD3LkswgixJ!+?x-xli}vo^}Fqxz|FX)x29^Ht66;DoB{mci>4Npe^N
z<?l&;hMJFl>e8vY_$p3)Q@niBttni-+SU}VyUW&8skpq>lzyE|=5<rOc}p)#&0k%q
zsj+`QTgG>V)m0vO*vM7VEf)jkjWRimT3R?F#`&^%W*N`IasCg<&k2~ZhS^j4mRNK-
zpkznUK7l*H8Jj0mPRYuAmYm-#2+4l6Wj4pF`9o!H3@ewP#dp#VPdE^%2LGj7-{hPJ
zN4pLwv{3shz2VyFj1$)LC!p`*$+DlnNRmaz6F2$aa<M)Mv8)X%6~tH)@2=wR>^jr4
zp2yftM^K)~wk8wpzgNd-Z`{4j&V^D?6*J!_2p23~tfEld-rinUwWY2O#mcEUIcLcS
zk)M?W$tt7Af8En^dU8rUT0W`~s)G$D(T=~r-eqB4A{To}_u!T%jVsF$P*Ik&xGbnB
z<(W^L5q5eK6;Ns+$SDEaFlZM_tq9&8-pj(Vdf4*nG74K!hE3w!-WcrU&S9as-^@^|
zB3V$mIVtJ)RFJ?186Y5;yr`}O+w%mWJlA9UwK<HRMsBlCp5v7XGUxY<8WJqi)hwv!
zeLY^7rxz$O4(0$ZCAtamQq@T<$Y=0)>s*I*e5pX9vfseYuKJ~*l!9O#EwWkg{DW74
zUz!&taNRmC^x;R7*S~Mi#{3o?5lnRL=bLnSdm$Mt-f#j7zsu`OULwS1ASvV@Qwyr=
z+Db^UB9D`Cr`x$cPm*zA{F&hEIJe~H^rYg}S+T0EMm5N%jFY9q9iwRRL&n5JB$J(>
zYJz5p5vEf2nikvo0?>xIo|_)q&_K4LsE)L3Md3xeTHf~5xF3-J;*aSy4DrL^tMkjF
z;jn^nJYg7<Iu_x2x|BnjZ?WMpHvGzP*k}j>N`s`h+48y>?Kh)m8ynT!=I`*8KPHnr
z`TP$3E6v2mX$4-hu1b|rKD1BNuxL6+XuM(Vg#vjn(3k#q?4%k8#^Eyao@R5_Z`mtr
zzDTaqJIhKFTP;t#1Gf50rhsXniLa^Fb(>P1nb8*3Dd#=WtFltwot@xjX!!S%<<Cqz
zdvprk4d_8*5#L3di{;uvqID~jG+*a?5nN$^lDQ+^4yY;iDp_){N@tl&A1=kC^iZJ-
zo{1#9@l2t^1)cPxIA7Y)p?N)nf6YyJ^73UPq+s@8(73$TB(QEld|{w>oQI29kH+t6
zu(&_UX77>gjP97gQ>SQH2<kx=SyS9vyB4S^FKpFpUaaXCE`$whrBjx1RB;^ChMK&>
zA5EXo0c)NXKg#se**Ljt)_LF+d#yH3OR?(19y7zd670=Y<(i@I8wu?Ar!-o$wi-1B
zgQj(62o9?(x@KnlmbU+M6;IX@$ci65rtw%N72ShFS#1Xc60-W1RVyOlqaqxR<JG(<
z<^`tuHv)7Cn`*^%oy}hX0VW+OgI{C<%&^!NwiTLFvJQ?b4?wS~9jJn3hCN6SK)lob
zp?$RTrZqTvt+~Io3mltAf>!lu3_d~ncZR5C1~gb_S6El-KOtanfzlw@BP&~tZr`9q
z37ke6Y{EIdB4PO|w91Nk*Oe5%p*o7xJy(=up5rS=8AvoK92D&n73s!9gjV|EL%bLd
zfL<-mloi7;iEq{xfTy>S@Hh!hS<{v+DhitvQZjmtqF+K)$u>PJ6%_En0yWE)0RB0w
zuM0@R9mF{<N&#QS`H+oAu#8VKqKo2M{5uN!#DDiaJt(R<kYc%_uG**LcZsT8*vYR{
zfGu9d>W($Q+VmASRk|8nRrPQC$(on{$k)9k!Qr;_R-Mk-R;VwXM~W)0my1HdpbLSw
z7Q9sh^`>8~7k~K7nr&jy#v~nla&<atk3Rd`w(=*}9IxgTb=;`SiP2~8K#f8oZnc$L
zJ+A7aJcohF<h^yxNpqoFS35j@O?~>u_qCwj36-{bAeUCf4fOu7!H-MJ#=#=mPC_SJ
zy{`PBfZ4{j(>2d<SC6SiLW(FTKfSuD)qP#M#}3>=`+mKkQ*b=FFHrltaoE?PP)^k^
z@(+P-tS{j9ZpF(EyWZEo_jYg9x7XIi+lO1nZs7IrMaQl0Ll;AHQuxj{w0L;3Xym0%
zE$?pDsfO}~GN-suD8Y*?Pk~eLn-lKAh3ONiP632&Ah#d)C6;MI{i8?K(<OTY_=&B0
zWQS!VJdUnzlusub9(zSX>$+Kaf>l*3eKM@L?u(x?1Qo>Aj6+9!WgjNX0nGK}j6rf?
zPiQ}2#H=Yn2lh|9Tt^``pSrSTCzHa-SX(xM9Q0tx3Un)ApH3||(HT!zPh4b3i15^>
zZuOn6oCz<XyO0OKUPDv@JV~U#Y`ru?5`FtE2cxvlkGjX5^H;-O>rM2_FVTbL+GmIT
zL2pB1m<kz&1a8`;e90~L$85xE;D&MP@Oc7Li2m^xvC`Q%2*^M${M%4Dr2+dqO2S(Q
z$zQEaNuQl0&?d3HLPFOhJ%ais17N7mbKcB)B{B9Zj|FEGS5Set;&QC6EvH4ld$#ie
z%`-s@3hetrP;rDlrM;^;)OXTMm8lOI_=Cq-FhEF73eN6gqe?an?;RU0RGSY6>$-B{
zPb7nMY;8wrJz<V*k@A&pc{GsTWNXexkD;0+A5f;M$;r~t<%vn>(tB8`DvDpua$6y6
z>ow4vUS*lCg0eHd|4|pP16|f5iixuI;c~6<SeWhGcyGh_cvcl`-vJiGFYBAPjIBr3
zhz@P20j*Nd*n&kPjX#wbnAYfBet0iwyu4|WG&Gg7G#j5MAAlGz$im?db8Kq)SBY36
z^$W%XW0P(biiL*tfGF5BoJJkVr4te?4sWs~K?wwD@t>?FlU@=ylJXJYA6H?2N9=j-
zt>aE;RAjiU;Prm^{x+Le?1G246r1qQ?(<}F9XiV<;vrQ*uu4|s=lN~+;gmCsRepbb
zWnx~8PoYNbgsz3=*P@4^jO1~(kD<`!J4}fm(ZOPrd<Fu#)^nH!*TB<=k}X*6d~*8l
zSK)SGG#~T6QFht#pU|2LzNF3<dTXgN6Tlrg+s;Rc1=nz)YK*g>(HSQx34te_)AnX`
zJ#VUOmH~&8fug}-_zpWwUiC(BnO2pagi#<3Nz*saJaXCGP?O-25ss1IYkda4Z&bG?
zn|rTaZN9)JlM6Q#nq1B949iv_>F2QB>vem>!P|@W5c%Kt)G-H;P}%J1Qe9fbW}JV`
zIpSF_C~?kpq>#RF{{d1c^9WMs-Sc*|Ye}6msyp>(O4s;@gdvy$!c5GXxm6LFA1AXk
z86V!$V7wEDE;Ab7dZ;D-+Cgh<s5FiI_U#iHbwET?VF^+2PPD6=p;+95Wo*`yeg#8U
z_=@Uj>7r`Q=X78r+b%Cn4PF{0{=rfxQy;tdXznJ?u4S_$@_~uY)A3M)yXM}3&0`sU
z|Ii}B1imY@qzmmV4TfF7u3+c}K})~<N>s-7qdjTUqXXJpf4QFc<n$8nYAT>Q7K*YH
zo|ZJcG?$6T$LaMoSlEjgz^y@hv0z*PQ$Vc0SAun87%}c`_oM}VH!{naLyZet2sbXB
z5g~pI|1+H2h06{OQnjxUMPc9SiP;#L2dv1!$A+T#)gA&!$BOL+x5mm9!F(F>N7)As
z&#NW9uJZbtL8B_j0B0_J@5aF2<6y2MxO*zXzm4T#uDhUlxsCG{<6$zX3*qn@-lQc<
zej~S@)ybZ%00=d?Z{HzI-c)CGkM{wzCLT>BuBWvEsNB-XTqdB$g>mz7rcvc==x3Z#
z8)(khJDZB0iC5aj*3qfYC$nhBm}CM{!LSunhQZWZd|gZxhu56L^mf?&F4_$q9JkLq
z?c?Fm*|CTI;JpAW#D3Ka&aC{5QEibe$>snyn5c<l$|<$LeDHPa{Jeb{Jug$RXrTt>
zSSQ!?jw2LlrZLJ0sgnZ{<0f~#fy5CwRh>(!?9EI98fE>>8XDnQLeyOJIpVwhu&?RZ
zU&3fL_$pV}oK8H^LJ7?=E{Yy0X^ZiHpg$%y$hJ7u1$*yiI=&Mlj~4FBM;h|gRj8W+
zlWC5?Y%U*xR7CZ>g~+)gFLX#sE+fH^9MKTpWQ%(swAJ*>n-@M#`3u>?@?)6yVyr&*
z48IP`45jO%u#y2!pkD&<Ba8ma`_A3~rn{2e#vdzhCP9F!wU&K>?F<=U^}Gs4A@JvG
zMs>Hmza+#)CE>Nw(1zCvc+=upYc>X=wQ>0@G?yB~ExutVh2jFC59B7OnvP%MW5q;l
zwt)A!OXmB%g<#hJDtLS33(c&SaC}J~I_G@Bd5w?-#U<M@=fXc)$H&9YxpIc3$DQ+|
zUewt8=9}FO<rzD((IQd6I0fB`;NQqul&|r1Nea5G{>%?dZEvH%&ay4vCM{*4A%mBm
zKviHe+!g8lAoTVfJwDJ1<Q_%p)qqJoE07Y=%T^V{zFG1?x-O|bZqu7vO;1y#dMZ?(
ze+E?`wFyy7ptwKR&0zO(KvQ_(O%;F2;+J7S=?{260uoeVo{$DGn~hV>y)enQE2*~5
z{VDtG5e6;#w|(p;Oz{Mj2m}6O2n_gt3>$Sdq05Wo)<8+ogcS${jbVT)UZpbTV>_Y>
zFl4Z`NcLel1-!;iVz>@uCAgt=K2JuR%91IGl_1U6frTlb$9Ao0eCHsl08Dwu&yqWa
z3Bz1Z8ElYKAK6d;P0-9fatqLagU@dEgoa{73}-yQ<$SCUH=l7LOxw-OpT+k;vIM9Z
z&}7+ZW4kfM_Q$#Z3ze1M0^G?@?l861@AJp}omg9=&5!v+&gbClr>8iV8(~3uYaak&
zi65#*TUfFgKnSY8&Lr>~l#A};M?;|aVq$BB#PkBBkEmPQqrTjX3N7bYz{(CWXV96k
z$+bk>EuCnSf2|~O8h;uEZ88l86qsmuaX50}e`In#PS{<sV#ErMHWOCr6`vM}A$iun
zOsqVw!8lfsuNsIl6@Mr{l?ZdUfEBB7Oa171J)ubG;E1=@yU|!Pi)9Cy`YaS|gHqWb
z`OqGnBphmNQom+Pd16<xne(7JP7C(@c6MpA{)-*Ns-Y2j_lT{Kc^`#o!T)5<#$n-c
zHdGv8=32AW()?}O27`<?&kj4csn{t?6DivkdEzyQHgr|-4dds*WdhGqQ&T76d-Z4U
z%!pS7+H&QoQdEwPlf*_@-iYSmAM<Qp;e4vvDq=C;TV`_<IF|B~nWjq*g@wIKiO*NQ
zTob6ivi>mDJ6+E>b|iYWOwQ6-BXkJzS3dq*sB=nn;=70I_{aTea;ImOe_s^IUmy*w
zEvkNpxYvveBHc{Y1ZvL+ORZ{$hol}lDL#W#?G@n0qj-itmQbNhkEFu`O&v<^{OK>_
z+^m@<S6dgtC)Li2-^Ri<Yv?i6^rH_}V@)FXzrY@%ZYo4U08K@YrTcbsi5L#MjW;LR
zO*--)EHgNhHj#8L#(U(r-LM{kcqieWv;)txC0j3TXtMSMh8+8KR(-Y*>1>*S1k?0R
z3mXe-g`2kbT8-#N;m<LNYrto6wmh<SSoOzwK{E@zcy$5xq!E`nj>&8Vh$dc~W)3@C
zoInjO$m?RM7;2E6A;nhAQ??7#$9#SYt;2LSrpsrcdJ+1K1F=OnqJIrlaZ{yV(1<%7
za1c=;|KZYy_ZB&$0GIJ_-R{Bw0r}q)<#s$NA(I3KF`J_7A-l*`tyQFgDoL2x#cxH~
z`k?6oBP!iF12M3w)_*{kZ(LQ7Wrn(fY%nT#-Up8VmBYrC<8`&Fi?+Ha4;AqY;T8LD
zl6|0)1@Tjw`MZK0s2}iEG1A!{1__+uPO?S+cC|#3&4%CS%4kr{Zg!f9EtSu+-!?q+
z6TV<0EA^DpdcF8VT~!Zb%oc|^$~TLxueRd2{Ic;LptU`A6}rf1CIc(o?Gh|`F0UJs
ziVgp@OCg)DV9U^H8!%vJ!SrPn!2A}MQ1J|=BCMIMDG-m5sI)szW;hmej(7|Tq(<|{
zRK&w581@x1jxH*+=FX%h2Q!^$a@glQpknSFB2oNM4(V{{B$+4sJ#uk=I5cVPhcIdd
zy%glhiXO5VN<aaR?niD6ExTbHT6>pA@Gh!+PcMf@r`@CPtY1%nG)mJZ6Fe}e7DmnO
z?LWG}yVOKLgR?(|T<GQz2bu+*FqRDniquk^+Sn!m8Gz-CP6gO^1LH7p_1!a;=33*Q
z8{Yjt3_utpRfhpa{iJ~CO@GXVEwTPPR#NiI7%x_4)i<N;stQojDg=A&{-D(x4Eycg
z_w8O$iCuX6s@FPdpIn}vzAdOpk0rT1V9E8I3$%^}GDqF>lg_JQul=Ui8MKXV6s#e?
zh|CL#$TC*xZEGeKZxmjl?l^6_oMPi-65kt@eo~0D)rdyP7NDvy%eT5|#akyZ+W^R#
zlH#`T$if{gH4^mK6)$8nunn${ob@=#s+ia^!8B|YtC%WENxL@bKSq*gi`nL6BBDAw
zAUYB%<UaU0LG;u>&W4>7s|Tq6V5kkLB9}XQMKn|v&J9}>ujsVoqq34F`&d+mHv1#}
z$WU1=9qKc%LJ>$4E>W{>IEO*MJs1vJ-?fJ)o%ZRm?z@^IlJ7wFQ@O}d_u?(>ZE3v8
z#}KwY^V=PidqhOK$7S*kHMATGiI7syRr^Iuw+mb~rBvHnQ7W7)Q@%pyhY>F3orpH=
zlLxnwDOuc06*SXA>v=cTlncjSxJ__Ks?@5iW|U6xTKuX4ij`_?-_tGk3AI?`_Z}L|
z2kUsjFz*@E4U<&SGc0joxz_isW^nXOd0<?s`(4$qN3~l%dY*g$=--3Qmi1%TB8!pi
z$l6`#9a9yfUaI&iS+YK*7(9gbaaxzcGNaqAqL6o$gfdq6v9f9vZ+;8aDvq^_)m5|;
z_36KQZ%eM-%NhMg+!O#{ra5(sLZRRl8zHKq;)UdldQ3%X2zBUIF+H@$n#|WKG38~^
z72<*kn3|;-ED~W6<_pR2$cXxpWPz4e6$4pj>%sRQhTT_%w5y&A>o>?ax1f4DG9Q}c
zy2!)wT+VXY{z?%=T_O9gbtM+wOWqe8Dz)X3DRu~C^kKdnLtSjVbpo*anB8Yo+=$;N
z7x5yV<_%@!Y{omMOY&H1C#SfIMM*)uZqb;&OJbTWI9IfnyGK&ZaRSuVMaMxv1QgT*
zlVh4{zaWU6Nzq41;Lk7xl2W$hQX5b@ix=-&xqA9J-}g`Y+D70l8%&lYF|kb;#txB_
zF)g?(A4IwF{~TY5hoD{BF}rwUw4DDUm|y{$s0XLuuZ;O}S6m7r+48^{YN~qnySc+*
zSo5u>rfmFp@AgV3H&_^J!80WLyfgFFl?|dy9@X*Omh(@On)W;LUV@5|IL@(uhUrYH
zprW(zHB=83Qgu1lIvfL7+nGXPi9393X^^fBL-j0a2zIIa*uPL8p9ct@oRXh0G~9sC
zp^#m9Y5-vp*7F4w6+WfoyyTGoo2zgFjk7e*%XLi!HiihE2<vdVi_?=!y)xg!=;DF+
zUa#nQPyRD_wpb0*F-dK8oMTvY1PzgHQ~GlX#1$Y2La$+@m(y<dyUUBBUcx>dbT5xy
z7lk5Mr#tAJyfp%moIF=7)z?g!?Wv9hm+l=OavG?hl3u1^75xI#NFUbhh>A*ThwgJe
zr^lQP-kiwUmduw+{UeMr$UmK?U4P>%5v&Vmh#eioCL2L*-GMs3dZ?879<h11Hhf%@
zq^xaj=4-RsXBUIF$A>ia!;{n2t9}@%Q}+Bb<y#1K2)#6WU=Gr$$+3vU$1~0YA1xUg
zayv|Z0;Ht-<10lKVpwfYHHC?2z-WYskqzcjHaCI`MC;pxm42@^NqB)YgZ9;v_JVmN
znUOI;(sB-1J=ccu731XzQ$<rQ3Ti4czCw7-Y94J~@xRp1V%SKwNRG8s!z;eRzjkK`
zOjK>TM-AB*szpNLC2B_zh}Z>~@FqCR#>9CGUe<#<Agsy}yUEzjsmZ%!z!HlpZ$Zxj
zx?v-D1)(aZr@lK$UXV)-B3b$2LsW~Eh_iY`75qtaO!9~3=@ym`cUnnxPIES^$7i$B
zXF<=#Nr#La1`m=xkvZb0>kud^a~F9=y5%4PyQo3Z{+yY2a4HHlN_2?lk2t58jBZ0k
zvJ6hV@H1ubOcP2=3@5A&B+9D~fC%$pKzX?^Y^md_qSk&vFST8zGq8Z@1%yp*WquaV
zD^WSi#Y~BCkxQr`@%SVk(HiIM<SrXLrwA`bx@_K<<nC<yl-z`k%1nhSv#+L{Y2D(L
zpdhEyFc$ycDlMX3wfcc%ZQHatA30Yxv>*!v)@kDU`X+s1iz+_R$65M&d?%rs{Xx2)
zI;4CUli2*b5T2$tB%VJ!7@tG?Cdn4@I9=tx3-vp&2*1ym7-y#6p7dn&+Yg2yGV>i{
zl`5LG*N+Ia=YD<*9n5Gk+Itb0#u;x#d<SO5JC9BeXqfrNlhRiHqF(|7x?FZe1QdO4
zRS>E&e3Y(G*XWU-xXhU5E532aHqHKo`1KG<o!<f`LvYPh={U#+?4}dufK!B~LNeAN
zI21hl%g|^Mi(Y{7J=Awn>e;>peh@?HY)LHf#Lf~lLFS=qk3wGt_qrI_%MURaiz*Ah
zDIgvpftFFHuO>d6F;WXnstvV+noY9XsLst$5e24Cq?D#N=tn2-t!6XN4Iy~Tag0hP
zb^Z_-QQkaTtgqQxjIW|UAwoL{_8s!eA-&X&16RQ+QUM5ojO$jB7t|O|<5awfq|d>~
zt*J_FSX0$32F95|Se1pVFi&{bsv&n}J}@Cck+pvkQ!Ziqb1$93_zJ;(2yRBMxtzhX
zgFyZ9mGPKVR|`M3ak7fViefTL2VhF8c&NHi`qhGgWn;_KF^cI*(|hN_4~dHq>PpXy
z(pz&oXl?@s*P(75n&q@Qn{Z_UR1N(Pvt87sN_ERzUebU8Q<Fbk2^+tVM1&7#Fjm$|
zQ)D~_4o+>m)~jMuvALu}#IsnA%4H8BQFBeU<sc13nAJ7dS}cBn&Cj8#Td%$J$CXEw
zhAc#D_9mbpf_coR*H7C`DQgZ}y%Av>yU22ZzLvmK1_|pNBW&4PClsg)4piNlE}Bw?
zC|yd!l|feJ*&MFSTGW<^;=Q;q4FVi)W`~JmpF0yqJT~hh)7ckOY{gpQ9V`ov7RdV2
zw-vdyO+Me?V&gZsa^<`)<^1)AewKY0PEGGc2``=Jswo35>GLt0vRo(G0ZR1Y;+R%k
z98!(Jok}Zip-C6aTgbtWQs=wmI-u#Q!AY+m>fI<*RX{!v^tjXTev>{=jYGN&waK-5
z+PjoesRkcP@ASz<mQ9?Kn6F1Yxg2)RI|KNLL|+wrDCp%YIU72&vvjudlFk@@f{L7G
zHwayBm`BD}sYL5I87*uQo(cfP_V=BmL5Suck9wEq=biIc9+-nXKWTMNqkYjONC<9Q
z`|ENN8@ns3IWSl|UX-R6Zvc>nu?#XwMvPS~T0zTC;eCIcgQ;xzDHA=Nf|Ot-8RK0V
zr#zcMvruoZ^km;1pG@mGkt0R}|9x8Ww<u;AVJcll{nxEMPOqz&XtYe}F`gFD(&Wu?
zx>(-(vud-O<cBLDl#DCt>6_3EQ*6U3^gCz}w-;B-+gcF&xeJP@fPf#}X0<O>&rti`
z`R`V~o87H@o7BIZuYY~B=Cd~s)f|Hbt$DrfohDSO9Y^-CTG!vJbZx8Gy{32UW%6Kw
zMg3e-3phAvT^rUHfGhQyp<DA3HLvd1)?M>jYICg7n%+&E)vn_8hj>1|s(rm+i_5#D
zz74qf>ZwD|THCoR+(xypCowG>x})leuX`!*qibHPD*{O%^&e38;o1VsqSPM|^ZHR+
zuvqoL>oupuWRBpF+UjfHa@~5;i}kN*uOnoB4fTrXRY!Zx%L&Pv>pnYPb9_zKZ_o)4
zmFshvu<L1E)wM@C_}SW*#L3maT)TGiG#4gtP5p<9z`j-gcHLCu*!K^SPiM;qU$ZT)
zz6>jyA9(!$iE(<pW(VW#0|eHdQ4r5-UoykJ=J4eA@udFdgsytcl3ufXXqVNWy4Ypw
z4~WUy)rSb2`ZI4GkD(~iYj^<>G}gXebD7N_ATWQB0=0hKhF&h~XNxg%>OZ}%s$yHN
zIqx|faLrw`$R_pO9w%3;dPa7-uEW#y+~~)32i(U8xR;OX4`q3Mb<fZZYf2^WA6ZaJ
zP1al!9<jB>*xFtHn(97K!hC1VC)OR#AJ^^uj}MH)^uYn0K6d1%j~OgFZKi4c5z6o5
z`ubN75x9DY!pBG4R@1fF%)Go@6}u~4f0JIVWqGdF@;p}$pVe3E4{LE+uD@cIi*;-j
zhOS<8(`8&=;C9{7a=ZR$xm|aW+^#*eZr5Hyx9fz}+jXOH``~EV9kG7g9>KVLd<1{=
z@nQDm<9ZhA<9a4dF<BmN#Ja<14f}MvRyw?WA5Yf2r8!>5Jl#H^Sh!u^GMpLfRR<C_
zP*353+wb;K(zyvEsV%XZJzQq~h$4@oBc|qc?}<q5YfezPrX%a$8+&*?kF<WB8ryg6
zL7Bf>r|yG~L^hkO6WQajkDFd`QLLu*Cw<^OUD0~huCEy!JXo_ACX;%W9lkbeU-oa~
zHBuyJ`KV=z(=}?0D-s6Q+<kx}U&lpJfwf`|G0oVcYu4jh#bU<rYU|W~^!A|=;<j^j
z{{Z_@D!E1<Y0ExbVm+00ygR*y#bMq1bz_gQStroY`#gykYqq;Bv3^(2uaQUu89>$)
zS=Z6|_4-9Nzn&(GHH`ZFdcAZ7AdlIoe&>oiO#SvsMk_=#zKIvJb;r})x<1~mmo@Gl
zlt%8>aXsulR{s_`2kJNZ9r1DLn%eQGo{hSj2e?%g1=uTo4e`}7d!Wc#UB}%zPV#Q8
zPH~b=KCJ3jT|8Q&6<RLh$xVH$d~}%d+iT4QQ&j*MKam(S#|;DYqp>KPaBp`oV~S1S
z1=VhZ;672KF-C?}V8D-^k3T?|gdS(1dqkDZY4G7ke`=GKWr#rXNzGL#A=nR(vB7U(
zrp=eD>uYN}RA{1B4uv=D<dT9xyvNM28dIwE8V~SeIO@BY_{8~ynZ5*HYJ4Jvb-+y*
z@eHXfYO9xUkLs|TA_L|WSv03-&FFazn$u@~wg%uyoP&6lycuw&d?}sY<jKu@AK8f>
zVM*Lbnv7@@{~G%>ox2N0+bE<`>c`g!K2inL=4Ys~j%v#({LbJQc9YCF|8`w<af)$;
z#kbNgju$@sQ8I%+04GErD?ZjdS)`fu6&XwZB3l9v18$ri_JOuU9}>L23L<u#Unh6R
z#KH!sSlsk6u>6BOwuNL}>I;l(ddOLq7f8P}#NUlV6vfnKD!gBs{D^ZC7OtH9-En#o
z)YW$IQ!n*)RnD-xZ1H)uxgizMT#Pv?(UsMn$Yz-6Z2%z0jKeYTe+1|%cc7<8e$(j=
zICv{`|G}H8=g6)u&*8l2Lx$l9yUY_RF<NBoQo_!aDMwP>$V?(+BDVbgDrR>|7dw&8
zqESpUfC^tkn{a$yO#mz((Ew&}a2l@?(3oT&gkTW4<{;d3*<dqA<1G5;f7swlx_KH6
zdB5?e-Mj1Sjp!S#xK01RLiXbOjp&Mc`0l_}8<uDfhu^n`t=_9XU0qu6*XYA7{9Sh?
zN$KFUUpUE^lf0A~k)9!)$ZQq(KI5s$Ya#wtM2(&-lRFJXrwL!)4MjPy;f4E&a~7t&
zVPUf(X`h^!jVH(L!^>CEzvo~7`#5?TJ&CAX^yEKgPtYlN$qtA3?X+{QzqyW9d<9|o
zjp7%!wxY9E?>qg*)>aMi4GCOJThlQ8p*es5@PB{)^&fG$&e^AHCtr+q=y=~A{kGrO
zrJolsp5x!WKYz9B|4Y9;d$#}L&wto^zPJD4tFQjN|BTA*J%91+t3O1$zil(Be^x+V
zilRTPu85ahttt1w`~O3K;JSX?KTWTq{q0>&XcZkr<NH}WO-GR=RzNVo)goTp)1ixV
z_b8j+FMxs=HAWlJKF#gc{_fsa&8Qzw-UI6=q2K7>nWXc17JU=Xmgyq-7!g-?GbO&C
zj$F=p{j!P{$aF~zj9NE~xUK**FwtpzMHh2tHbSx1WD;?)Jd&F|8E<QIxwNo|fGxpo
zh&&{8o8;MQ0bGt5v^X>BAnqkjONfNgbVcFcY_$ZHDTl=hAWf6ANf3WBO_!SN>wP+=
zUzWGAq^P;hi0S{3GJKlmI+6S;(`5Ozwks;NE$3u5(kQ5OqUj1OWU`E@u^<~?k<i3G
zJ2E5y#2EoQV3V(*<!zcvrer_KO3ob&TLo(oL{7Ta>Y75I^ajN=g}ORkQS&NVV_Kn&
z`mEMO(osWdoQ?SIkIl^O(4<I6Ir5V)kPpm_zNGmk%6>;||IU+CW6={v2}P@9ArbFj
zpYjx>w2G*~LL*z`^fAssf|O-;tTW)W(aQu2h1xL9mYiXah6lNjsB!O+;0*DeJQ8_!
zz5IYB;4Lcr0OuPk3%4Vd+yZNACaa61KFm5Eyzca)e)nYXrqydl^!r7x`+Wz=Z4Tek
z%XS2`x?bni>p}FodwSgN^`qALF%TjLz0Tp~pi2*)wE9%@3GWzs*E)Y2wSTziwfp_3
z+lxA97pEPfM<3|5&Ig@#pZ3@J(di{JtT!W~5uJAj(P`(bgG4xkZWG@Hv2x9*dlH?s
zd&v7XXdQM=JA=3U$&=3D9G^R(@3o?fR&UTbx;$<5qKnJkMYqq?(7)qO|LC;UIcpzp
zQyb{JQTzM$`2bG5r>BMPcHf-0d+0#W*F&at+G!o0w&iow+v85JeKbI~+;2xTh}6ha
zI>0X4M;-jq{-I4hYW3dIY1HFmsC(XT|NWB6(fjDQb=G=CeQZ21Iy6H^m%a8G8s0qt
zo&M!vf6y6R4%*SHZugjn9T=aTqjvuwI_>s(;4b^^CVgbk!skJSMvY$6?}wND4#tlM
z{d~~w^)4?4o$mPt&G{P|AsT}g)jsC2?w)g>X|TGzx1fu`;HhXvZ(g_QInDXGc5l#Y
zVL19UfJXzrBz={}bKrG0I&Z%^?YwHAAGPte3qo%?{q}}TUZ;;T9r^g17Jc~=-RDW8
zw#l#FT5j^xMxB$Wb^Lt?jhDipMoXgK(d9!=`@k-d(Z{yf`NHLS{RW^}+4k+r@DW{I
z#b>zF!e=8m*M*N_)^dc;CV(f-gJ(~`F5Nx}AF##;PXoD~uG!&v7ZC-~x6u>#*AwDs
z0ZBziKnf@2L=Z{F`RlPHE#>MQm|^lH(GfDbZQ#+LK!?-pp0)blnF9EMs1(_^Uws__
z%q%3ABqYo1+6avF$=mVbtBr#i8h?2-jla~=*n9D4B6}}tsXW_%G?i!jwNzd_e>9aB
z&y~urUw9>V55D-dICnf*IdHZAlk<ieWgoA)q3HZ%k|1k(k4ezn`{tXkHohn{$4%iu
zeYL;TSNqGFYBa>P_4Zz{(k^P8cF$kY>iQx2_S@*x{IO9-bTawo8yfRkvd{JpzNmWs
z;<-`L)zwm|uQcLjgvU7s{4Bn!-ZW?{!^KiJ+?bXc+TcluwxYd*`fBCjZtx^LP_1IP
z8!`)0@iD_)B3d!n4KoW$RtC;1u(ijie$1E9|C0Y)rSIbjRK>*BfE7ZDG;eCa;&>nA
zlxY&w!ZD^%ENKLRYs{;`v0`AOKv%gO<N>_r7f%rl{WO|q?E8VE9(*A`rG`9Zwykp=
zonO*zpXM%Gtk&Z^kn%0`fu0dBNb{~-;KyW<iR#V}@=jkR*JL7BoE#d@CdoAiX*ya5
zhVu$O7EeCJ_rx`>CX=ltxHKs58g%AMqwF9s!{5~68^r&C6yPZ_kN4S1Gms#eUSZ^n
zgfP9=hu@+E4Ka;O<4JrqdeVHhVH)=ql!yi^SNw6|fl!spMil3GhrF3Nr|+A>mor^P
z|FIj1%)+gkaXw8)WIKADeLxnf!how}kjK{|KA{1aY7$gHhlpbT#UnTmDNi3w(=mX~
zv?Wky-cSR<882CRr^OgpHi^fYh7x}cUGM#fFwB(Ij_ShE5ZA@M*lWz@S9SXBfz30R
z%dhsBkTEu=wo=nWpB8!>C^!DZ(h}lS(K?IV{A@ACNM-8ow#^DpCjJ-MqML9yAL+BN
zqEwQO-elQWCLxumy87cP`qQ6GPw`@R!?eA0+|ww~y~X8xUP9wLQKX=FzMk`$z`9|x
zEp2ObkXNk8Cw>LbghMhz6@6*G_hqyfy^QP#GD<zP{DuhZe%DaZ8rrwiL_1@Dvxiwe
zv=4{!;f8$SOQrqgUNicWyxEAp_Ub*hl6N!SVmNWwY?w0=f4Bmu{q48z5OHTN-bCMe
z#c_#ooqxkCS8$rZU64N2jCPw*u~piboJjHAwYibsekq0I&Gj6wLUREX+St+?NBTr%
z<d-d}yXD<STH<B#s^m4{+Gz<@6+0+0pzByp?-j3p?gB5^Un0A1zWK&gIV3U1W7qH_
zs&@P6*IM4R@G-o3ecT&<-|98~(##7~^V_YLvNyCD<=4E1>~J2`^yIS|OHA;Z*6zLd
zAJ$yrw%0WG+5Z2q<`P@KrnxVk|F<^x*Wg6KSM@{>&WX|dzQIPvblHr;yD0xr|Ne<S
z`t(0`p9bu7E)oguw?|)@W(O+?@3IZPPp8&~Pn{0u-}(c4@&S*poC&;K)L@2AScVOc
zUD}S?%uvmQm*s`vI2Gn9g<HFgL$(LpTLkXSG8xF8fp3YGDQvRGeLZRJmReclemR!|
zeqrrj>^??Z6Ig{K+j{qHA`uwkc}*C3KNwD219It@8|!b;ZuGS}(etZ~gX-277nF44
zcqM7R3aqH#x-npPxpn-Yc6cPKJpZ;~=>s>eNcudBGMgxzX3pgar@iqse~M@5oWpCN
z+U&OzG=T5!;?=DiWyr<NWxC}tLHUncdq27MA>mEPx*O(Hr6K)`mQZ#D7S~7_I^r8m
zW$rOTDKx(@Tjy5x$t3x@p>~bbnQl!uPT4AYv6Kz`f=VmbtBK@mFElj8(q@#CX*?5#
zlnonG=I1{E1a*?WOAK@EbneMrOnV_QqDF3IjK-7eEW3&qPgugB^Jd>WX*N+vkXmGt
z`I)in{`;6Mx&8`p0#qis<Ugd;@2ezwvQH(i=mAaP2hMKJY1Dzw!g3?aQ(5>q)-NtA
zXuWu1qzWVZ(4SKUGUc!EG)f*!olekNB*1mbqZcYG`isr$rN82IFS1*gFxRpO%%wtw
ziObWypr!0eV{Fy?g2b23w&oMy!&7(RKM|$Ns#A{zStE@ZX_KQ1K*Wi$kSH`5Nc)b|
z>2c0pZxJKW^E_r^t(qlwOO;pLj?86fL23cz0Es(%1L{k=mO*H?f~PRVMjk^>A(&>X
zoK|A|K2F&QBpBGyB#9S=LG=f1*WPryZsp1NwPzDx3&~Qp-BAHHkY2sRICEw>tSV79
zK<r#C5_uIPe<{C2g=Mh)AlYUHomzVyLy%=bSGp|qi%sCqH>3GvMd!vW;hd;kf%O=)
z|K<MCEpnbMldt95<1CSBl>7}$ZBtgk|DU}-e@x@b5(d!u_2sXqFrOokLDphBi5<B=
zEFqhTENO%kC!ORmB`Bn_fubqU;>7Q7e`mc*Er1-SduG1S9Sf@NdhWgFp8c#BOfXCZ
z@3C^~;!Y1>jSm>19|JMjC=56_cvs<d<YM|aumew%WOR_o8kyUiXPxD!>zvqHIcq73
z3(pvZzS`5_n5OZSfrsQDhUPNtcs)pledWs$T?bzUo~S#^=6daWd@4nzrhBT{X`Udy
zF@lh2oXjt;1Q;m)@z`&k#fx1tb4z4V8N*zA=l{y#;M_|`=3}nre{gk%0@gt`P<ndq
zGT2h$1sj0zgcdT?ICiPTyw#iLkKL2gR`c-ic+b+AQe=HM*tU#o_U*&nTnjS$ywHTJ
z)GXNdlkpl^l!?IO8Er%OO^Aw-4xPBf#oeSIRso61P4GAnTMA`0_LN{rT0Ojiv)i}E
zO6v<b_kC?E#K5l6^v)T9!F)^PFNN|JD!)Y7B5P?xBnn=VmGEZ3wOwUtWh3qGX4!8#
zhd6?+7#*tw1W&2R8@S)R5X9Lx3uPg+#qAEK;+~k|Bg;SRsF1*7p%*MM3-)Msnw<s_
z0h&%E6sW}A2m?+!<D^DdS7D=UE19Q4#|J{86zFrzUl_Ck5Y!P}y5by%5KXUYD}s<O
zKg4-iw$i&NEu#4N&ldpEK*S`z9(bViSW!a0LOVodS945}*5Qm7U+No3KMH*<<hL}S
z^c!J^AzY^@)yF%Js2V7ay^fj5u*3~f#z@~7+D120ICJbRn&wtV^ugK!G6C*q2=H-2
zR>M&E8dHGL9u)$OiA=a~BRB!6!AI!iIE!cVnQOIzOr*$N&4sSo5*&ehOLOQ@WUM*}
zET5VxzM4P%YNZNA_|3o4?A=~)D=wo8yj#<BxBLbN*e|@jSxBC_xDm^u@iC>M3vSek
zn3WXccr+g&KonW=7EJ@pRLrt^Asc3i-YA23CPqG%bH+FMJJKH71s8@6vdy#}wGs<|
zLve0_ehd-PA&e*tm?qXiNnzMu!=a8(HaZ**p!nXgB^Mvw8sd@JjOkuO<tL=Y=qIAW
zo7`zbL`wp6srnsZ?g-B3F|Nl=%yMt4!;~v>r}N8*x>f$vj>$(0e4L=$xyW$PqZ<#-
z%q#>NX_VfC!SBEG<X^aY+C|qR-HT?gJ<Q_mPreSF?Mv7>dn0DAsOldaz<<;GD04^H
z*ZB*Ae$!URY${A12%}^1vSEFUD%ql8GJ#|h9QcJojbN+BdRwDT)a1y7$3?$|1-EOC
zf|s7`@DrC`a#&1QmT-JW1s`+40;wVyCt1q`3NXsDrvhPuN|)7i$e=|lU-Ly*52@J0
ztpW(@4Wi)d&EV7#I&&ad9ix{No?v_-T1}FcQu1iIugvX3@=Twv6}Z$aXTPq~Jeg&<
zd$mfyV(Yb_x=0q+)_m`VR#4&Fm;()Rx?&N_4Q6?Yp-_*Fx%ZN(G8=0c^k8ixXbzES
z5b2*;JKjp>O3v%V7l`S6HSi$5b;qDHQMv*fA!Z0~_Z;&Ln3-e_DM|BY6reRLXi#}r
zj}x#OnF9iA5RVOxPDzxe6OC?UD8B3=rdw{3q-iXS7Gh!)ZeNBNDwqN}^4d6)Bnk)3
ze;ep&S^%bV49cGsH=d_N|MgQ`??aST(3o=!Tz*U=boo^1S#f6Cy8>FUjwN7^i(ICc
zjEoc>2lhUij@iq|k=2A_5o@}36DWqndynOFDDpui1MZHfALEt9+h3;x7(Y+;7@?{s
zQb9w}gM-#-x6}T6i;IoXUkZxipXvZ}(LUq`3(9V6Y_Q`L3z4YicR=G1_&C5c0u74E
ztQ5e=XJKh-#tP%iYZ3JrRYPy8$Je(LVEX`}9J7R<ryZt}tJ^1LbapxGgvHwL;%a7H
zY(L$@)=^a*;M|(Rp;vM0KtpVzVvg%Sq(|QcXi)V#X|Cy~Qv!uVUgoG;wLu`PWjf(`
zIQAUST-E8NwoDz)({XD2GqmMCXm)w#MlIS<{ppKc**94rIR#dNk_g1K+CypgpQCI4
zpFG)nYwA~@tUs6kepA1<*8e_Jm)PH{Ok0coDO2u8gK$2aJ(FfO$++r2ke@T2vvB84
z;vtiHHyp0R8kGrQ{<CL3z=YSUX>wy|E@%z)0vU2!h=$-LU9Q9y-yj=~(w7NSh(<v-
zMTd5yYjd?0s<b0=Bq2*pB^BZ<fj_i1f+JGhV6S73<l!Q96a*Lvk0^MIPT7^5T*5rD
z&x~@z(QIgJiMi#^^-edOC&|`#rHm_IpazPreH6t>aVwC^sjh{yQvm=r!FsB&kJ`Lx
zbcySV3L+GNiaad145t@JWXUS4q1i+3ufAEY+TMW`WShLu5WmwfCdJn;o2;HvyS!rN
zF3Y_&S$F6!9NULB$UaoaDrQWGr&yb<;f`2?M%RQ?v-(7r-Y($u&^X|Kf`ksJ(4nQP
zToakur);{iJ+;DSk}W|tMY<(|nY*OkO3OBJ-u`SKEigJN+X`jIFGlP0KXGaOb(I`r
zd8-)R1O#s}6qs3Nw-8>~G9D1+QdGlF&ldy8SUmi901^D_Ly0byWiaAx@4!fNd;kLq
z%<PB_DDwM;t}Gyn3-J)KLJLumTr>_w@@6x+%bjIe^P;m%htZ01fJ|^+F1#Q-%NhAB
zJK7(;1D-wEKj#kZifH{1t%mH}Yot~|Xz3maGae8H<`zR^XyXfG;xa?34A56SWwJaa
zr|fk!1WJJTW!Y|U81TO;M*lF9Zx)n^HA~}#V?qesUt?%&)DGiTBM8tQBC^Z#x0u3u
zQdcUUC#O%KL=O);XUxc3zZ5l%GD0Mtljk2HkaJ*7Sk#UVeX^s}I7y2$1$2+d!i|5D
z8O8S27vg6)9BxB%RTDqRrnlyNMFMb1h*%H8`R#LGGT_wkMFN(Tp?t_0VZT3g@fb&0
zSJD?x>c|)XppFh#!OYzdwbw{c(@2pZM{CFi|9Zyb=Mf>_E%X_Nd@;vsee&=jo{!D7
zht=x`Tbs_wyAB@h23wmd#pmcP*UpXWbgIoX)*KxZkm7(sT?r<TaT(K7VhW(<q#>hQ
zpP1unm0vV-&o4)+P8toa#-mGNG!qxqz*<3b>#3d9I%1#oiSqzEG;2z$_wb?pVS4af
zABRR@+lTcdvpTzz#PA4@LBSR=Y8=^q^X&dB+E(S8@SnNWKIbO-e`=TP6}h^Jb#w;Z
zYy@o*`i|zkt6)HZe~9Zdma2rq#pKi&ZP)6R2g4!TpK6vh=Q6>r4BB6W-!A5ZpM6C6
zt5t_v(wuiJX4uuvGIx^LLt}}dV*qMyRWk#=STW%PjHXNBGGe&xP_Bz6l~GK?oW@~4
z?qw*fYYT+zElIJRw7t-*wLXCx(=iHQcUqkJ*5>x(U+a`Qm@Hf6IXszphYg+$UE^2i
zuC~5y0R`{*joqDZBlPhiJp^f!=A;1#r4v=N(Iq{JD0mAW#`b{a3#tORiTHHV-Fp><
z6GyM*DTif@FRVYe%%<k<e3_|gV!2X=`l2%B^jB8BYk`yPSWk$;gw$oe5h4OWRgQoO
z&^wa|{ekf4S(^h(Q~6>MHS>fa7^v{!-*Tr98v@lFRoD>qaN^9{tRT$eIvvYSqrJfM
zs|U2lprVWH!fu4oJiUhkLTQd}OJ7i@F#ginay3;`Te#_`PzV0e>#izp_chaR4W)Ck
zx__*Dv%E!}JPfvSr5En6)%KWvP~a1f=TXtT9igG!VF#iFWK$>>&0Y95RKjOkMKEnV
z8A5DrYG#c3EW4(gLFWG4J$cK3Db3HaoN$pyz*5*|=!`sgQ#L|!aNxL~bU_IBH~nwS
zD$B@P<xUu#`3MH|EKoNL1ARsMaN+eIK0v+UgMOtR)-USe!;6}>d_2G)Lg;0#)|KjQ
z?%lp=Z%XE-X5=nRS;LB8-3Z>Y?+M2X;3=Xx5!n)<n%G{%>WRTwfTg$03=1#tpn}Rx
z81htlMJ;9pV{Ngn&b#}TTzwSQ(7*G-iF4)YeFiV-I;w^fLTIu*?Or!`Y#rM*C{hre
z`JLU*Iop6V9>v3ODlRQ%0!%2oqz*t25IahEzYw$MDGEN2vojRKAcV&5oD8jKfI^yi
zyUm92MUOafHS0)dN08lfI!tahf;Ye@qJ44DkEc;@HgvM)<~$5&EU>9DxhhV_npWEI
zXDRG05xIwG?+b&17c?y0l{T1w3m!5mW8F17>5Wl|0muXIdpute8J`qyO?%u^-DD5a
zpb_i^9m66&=)ePu;OJ2dkF17@9<|}o)5jRl-+2=uGO#2g#TOt24^^2%6<5<m56^8o
z?mKQN&)fjR<F)w!s{as8F8~0epz@&NJBYc50Jfw#0l2IA801bs&V4Xroavn&cn$UW
z1r0HNo;yZ*yPR326WvS6JoPMTNx(E)ONHbkBoiuW!g~`x>*QoZ(mP|-IJ-$GYXjpF
zU24J8GmN&6e8L)={t|ZPmM)?c?FHvkl$!R${V5ueg5f5azDGJ~g3ye6mM|)|)9`59
zS{`3mbfG{KupFWBadvmIY6V6ix#=yf>i8XF?GubK>zKQdDYI5)FC?_h#CgI9GsNBc
zz%#MHCB^!63j6D@ZiZ*pCzdA~&qwxg0V_VI0;Ytgr7~u@;&p3jTC=cQG%7P}r5PNH
z;N9IEg;=;iu1(`dJ0P(>$v^^i#cL1N{D4mcT3~al1J6K`megf#oo2C0c68i$nrWP$
zb}~<?so4~%>aYtp8*U`FWqF<}hYWv}$GD5_qi9RL4KZx}Gjot<Sq*XlSWyg}9r;4|
z4h!1+n0sP0OK}~8z!z15meDkmsK%oAF{;6b`R5rmIDQzYaUrPN1)ydVT7h7^Rx6x6
zY-n#i&|)D!8qYgwQFU`v3K}T}|6<8Q_A|`MAYcRqed+vH+ynSoc^}{>zZdZ1><1El
zlvG}}Cur~``y$_Q=}ws!?v(RoJ7r$7Q|8&V_N-j)v1iH~`X}w4xwC!df9;?A{xPOD
zs6k@8N}$Y;AG{>-GIG@qzMGHVkCU763-3NNWBfUO`0!Wq@w}ZaMvK|&r({t6$TJ0W
z#QwFVV^|+#?z08Gm)akhTk&I#3o<e-kzJFr$`DvT$BQio*q=$X{5e~5VpYl7n+%)r
z7so$FJ|RIlJ@KJzenhnBCDEcz46;EoACqzRS`XNXwYu@@@uG8h!8!gXOAne&p#R~Y
za3h5OzsAICZ<8qy*!X$&?3piBK+A0uC^W;3Kwp`d4k^cUFtHqt{n!fx`HJnK;xQ@Q
za-K=YMetQRL{<Zx3L6Tk)d_x`_!=G~PEIE*ou1CDJ|@CvC_{oL4-JE(=E0)(n4r-X
z7DB7N*|c{xt>Q?i!&(j6)&0%oq0JZAS*~=1r6Z&BP@_I94zDC0OBL!jpj|^-vL+uT
zV^9Y09Bz4HG$!{@*_UhV_t>A7wn;q3HL?;u($`y7+BMPR0EsgjbzmAHrJf72pyBz%
z#UMq^w?yd>wM@n-QKM#)Ul>WTy)Y28^|LVsWEbRZDsX;7*zOb{1ZFU0|1z4UAEU0&
z7GI%Hd*+22P}j^RQhQ2Ml2r#>tU;w}p6xY1b1d}~eUXI3QA1ES?qWZbIToz=X4!I!
zP)U7!jL4tO55zRG3T#&Nk9jz(X#uehB+;n^fuN-#$dj=~E-EJtZjEDc!a-SsPWsWU
zHCJGO;p<4kK3+t|L!^!&YJdT3Y{85}wPOh7)DtF_-N#MwPHJp3-jBwZ{TSoA+v4oX
zl2XDL>#ssSSBM?~&2sopOv_0FNHvszH%xmEDB8kX#xYEpMk#hqv73A!AJ=HbpnVP5
zVjO6W&sxudeBh7^bSQ;g81_}JPLd8Zt(^l=0MI9iT?9|!WInAs;_Dt!7!>jcrMNfY
z*tMy#!hswAly7pFnDE-fq1xR=5Qx7s&Js_uZ?uw(BVWiAOc(`dKqC>jn^UVQ$`x)R
zx)}n#8syUHr*wLe@TfNcIR?8gf{Ihjb5N0@zI%$I3Hb>V%*eVlwn!-^7@7c@Zp<i)
zBT!9cMG6j<co@jZ*YXHmuQXpmTo%4_NgL)va1ak#ZVLD=Nao>|#Q}mK>pEQ%U&H83
z@JuJe<R(I2Da=Sf;@#|F%bHla;MMABfm>n*c=h0&;5!uPRNt`y`a3pngD(#s0^<4k
z9eIgrtMD^7-uYzmN5;$5Klga0Rd>8-n1O<G6h+z*!QU-LO51#RkYO23sz&o7zL;be
zU{iersKJiejc$NV0AaDcq3^7V9liU`eYYtOrB57DbQ_YqULC?sI9?BTq4zirU59;D
zSakwaX?&}Zf{fcO*1Tf5f7s{D9e`^sB4s*Qs9lR86=AT-3GmS+X`R@DL!ATk!h-Hx
zJ0OIj6Ju`6wHr;hvuh2nhud}Z*B`3i8MXtBXmp+}XEP`XHr#d|s!*5Ppb$I=`{6d8
zOZfT>zKVo=gw&<1G>k0Wu5%>^qfi+)+Q4w@#c=y?!PYZu_dERBfbW|=^+w~BFm#h)
zOjdhh6B)toBUgOnTHqHttODkqPQyF7x!heD+bB=~R7#BLx>|g}k)aF=qN-LKy=#`d
zkH$_TO74%9<l^Md^}q>AX6|t38KHO`d))-^&bEs_r_6-W+=vwu7tfRcVXi2;duSs9
z+XR<%!{Q6m&qi>7)DK@na>-CL6wR*N=wd*-dIi3~C8U=jtL$z#F85Fzi?Mu#4qFB5
zc+S3J1*&Jn)$h3u4;P%=MS?C^4`xkdw_!(DGl3<PD8e&o8dfVh1aIE@GqtSNy0$np
z@i=WdNG~6xm+NuD;j-b&P(x?))-k5c@Wg;-7vmPE!-T#*aa2TlKW-ArmFp{5=N;vE
z&2T@MB>;V>j5SE!^+oogV>qF<H2t);PD5}`o|Z0mrSWfkE5DL+VkmFtVCvxU(Z|AD
zgq&(*P7U&^p)19<4rh9lSB)48VWZp;0Ncb!<T-`NIIAQf*nekM<l%NsQG##>I>7_I
zc}dl6yf6Kj@?LNZepD|5ygM$Z0bPU31WgV&bD>|sbma_F-+gpp$BDQ3#xS@r0}<U)
z(C-$q>Fd?>;kz3Cgcm<={>sjJint%XtK**MIyK%6SqSowepV3wYDihSGK6`1C)8RV
z6#44QA!3#@t8$WK_3j~$*nj)Zc_aB8()aPC9A0h!ViDBY-6mt$Ks!C86AJchtRXsR
z{pcRD#zCt<&9c(jv%4C+vT!n|S6}$H7<vSx4VH`A#irDf7Nm5#V?N!nbH?Bo5sDIh
zR>m9unh&VLubk%#u#4-y;RMOGtf(jWbCG+EqW|<06xC2n2#lA@U6%*VrP|PN)xpb*
z?tN^JLF;829$&=bFe=+<IDC;06nd|K$pU4GomVBTP_*Z?7f#&xUY>6QNf(F`knpGD
z1Q>A?R1)dnu=!O?>Z>x<m@Q|jaMp>QXSkyDgl>N7(qyTiWOtQc#=lH|2{+IH3Bg_Y
z<@UR)=(fSs(hEZs{5O;h`xYVyz#{qUq|gU3W8qi%rBX4v0p0?5gd3hKlW5x~d2RbI
zzc^|(epJaQ-ioZ+e);7=uTo#1EY?X#7vr^O1;a*(H4yhDb*9C2ri<##itEf4)d`F1
zgp2B26xX>ZtW&7)q0sWO;Q@$wJ!YXLVG+a&m6ydUcKcv+`?gZ|!*kS@t)ac`C%#^(
zz&X(DMc=1O31xBaB0Puof+$`<-a;L!08ucHg4nXRCJy4EoJBa=K|j6}V^_Ku(k?vg
z(nEGkF{xxUno$qs$ZMNxNOts4udw#*8j~CRCUo8m=#2{tDb#cd9jx7ZdhD4t!<m>l
zXuKMlqgb7h%4`$S?$#5XqM2WJmUMBq_|uewZGQ6x-Gu#Vlb_k=TlV>u`+VCz-*%tx
z*ylU$^T+o2WB2(J`}~Rf{HcBZ)P4T7eg3uk{2TlH8~6FQ_W8H&b3DWRt?A6roBD+*
z^3o~dL7``g>^Vg|fb>m~eW!>Ao5&PtIYm4$4NQ>(r-(qzXtezW{OE}v!ay?+CYE7U
zxxPfrmB%XKwkca}IHt)oxtxY048PPEhU3dQh9@{}og6yW+A16ahC2XOJE$PJh@CV2
zIhiC=xcUH>GdKRr?O^cB?dB$>f2G9f6-P*K<rq%Bcqg?KOlKY5^jM(~=H(~_B8sys
zjTo+}<_A8JMnZjTCo7D>>sq7`9{E+vOFx`@y5<T&<Y)tAdhe|)M2VI#_{Ti4k^rNe
zBk6%y9{TvgX&QKgG;$|d=zprw8T(4{qY3i7hqjA#PGhF|2pH2i3P+5rjYi!>s<HrR
z;HV`<EtLlI@kKa9TVV=ZPBTieN^eL?eR;sUipiWY*+HXn(Gq(E52W9ovG4}>64Gq&
zeJw8_A#k{)5N<gUec%Q$_|B!4P@WIP<fyR*TO4iN%uoDg{W|I)>$U4jAgFE23KY2F
zDF1c=5P6@vjGLHtk{&uvY5H`v+iMd)c=7vWn6!#k_#rQ1)=Gu0y751DH=hf~O<q-7
zl9K_?A#AJ)uS2D{a!R#JE3cvO4z?Y)u~yVZKN&~RhA*oiiK>EFSwahQ>o(w17!0Z}
zvB@GkCC<C^k1`V`1|eC10rAT6gvrA#k`%1n;)B9!r5}%qz^1lg(f)8FJGBC;4nO5~
zS$<SBG$zh~+x?KO@orGf5ePDa^{uD1hfC*BSbHZM4$1v^t1E<`JgZA=(ywrAg~n3)
znV`+rPKm*pP0d!c%8Lx!m^NAfv`JQY<9-U6q+AztZzDs~Bjb<pT8`i^t}-=MrmI$&
znJTkYt6Z2W7pqnYO_gwY6+@l$*ztH-`C{uq>U_aI`l?sDd-A)ZvbJcw0OjF5h4&pH
zH^aBP_f;sjRWdC<FzZH?6H+MHLR&)p(C`>3!N&d4TnD^^MQRpJrwag$=yq!<48B~v
zTVeL|v7?cYyL!RM7mqCGMVtLBTGdJUqUN4DQ^d>bldgha))wxJg}7kRJSuCIdu-1o
zqxfro{!iYY#T_lZNEq=31@`UsEeg#Ry`C<9JzM;Gv*a~?7A-A)7NGoM`JwwkI`)sW
z4aaFw<LRfiUMQvWy8on|v!vI8ja5hu<5tSyE5GO?G6Au=AC=w<o0B<GhWW9YM1EAS
zR++&9M6fPeMW*U9GvwkwQ(;sj2`v0V+E!-dMO+!psOVH-LNVlH6U{Q|F|jIyG{Lvg
zHr8lYvT)RCE34vw!Pj7O5cJ}Z23#pCApQ8o7l4+YIeeo`zDO100nb;(@GIA1g@I+2
zTl(O65zFdnuDo=1j!CM~S<rPMTAHNC4Wn{HExaOQu5Xn#)*4mB8EYuFT+0M1=q1or
zI!QQjld1lNjoQ98OV&g`DMF5egiRJv)<9l!qi}*X)2gOeuLqT@qyqnLZo$9X<cUjW
zA|?)MG#CH?X##T!tLo0Xa)tJb6&5sAHsQxsWvPV4Q4onr$8k$w2TB#{h>XL^P*exR
z`NYSV6pOMZpr%QZa#%%>nQf7~Jb*Y8VJ)%d*pZvRRUW>p2XWnap}9dSb9Qz)lZdRA
zl{*j}>u<SJ#pZdtB)>+TYr(B&EcoDk9u+S1p>Y-BS!4SDNYF}lY{h$fM!3heu$iEZ
zM&VwixT>Kk&v_e9on;pVFDIn6d%#_=chI}U!@^T|&GIRhUmDvTCwXFk6$->6SgXtk
z5?jlyk8KBoT;eZ^zi`cVk?zvGLq`T|qXDE|K{Xs;fldeCWrHDcH)!jG-%=0kPJW6k
zfKmxCnTJr;#>wpFiMyNsEU@9YJ`Hksm=t(wrLqKuZ>N~VZmI!vZ2})jM{z+ZJ~kYI
zGeVRw8%I1Gk`UaiokNgdL7PR(wr$(CZQHhOv&(juZQHhO+v@sj784V*n$1K!EZ#aJ
zUgmf1xkL8^ux@KvWR`t~z@i?xQaqEf)bxX(oj*x3?{d@Jj3q-UL$yv-`{BYG{i|hS
zZIOR%Y2bW!&Tz&g4gbhAlg<<UWijis`IVXH9?iQVQtU?R`UIhM8BvRvBC^NrlOzV^
zF^Ncf%2^sJLt}cpN6KtTW4ptB1wONB4EXAL!&MqnV-<$y%9ts4emBHgDAF9YhQQwE
zR972_dWQAZk<k4>j&4E}Zc1{fZ4NP{_q*X05{vQ`%7XzXD8A>csYG<)d$GHxv563l
z(NPGDE{XcYz%UBj;Sy+1iNstKS^&?j+iRT?7xa-88x%z=LsbAts$iPrazzecj(R|t
zu`_yWXxKAh#*+80hP$?kpub{Q$T5^Wh@!U|>JHEk%5(TM)6<{{U{CWPjZpzKS@uJV
zM4FP`;5e4gn)z~lbD1I;9%Cve_GOF+*Vi~%NW$CeI=isCZ~?=#yliTLMf+svp^ts+
zr#Ds}GT*q6+2PByo*5-lzSCrwKxzU*3>_%TOt;Ad+rK+v+(qY0d^_yHkmFE;$go{S
zpDFPqr!%RP(PCjANaEqqe7Mftg`I~42~?9+s6Yf~gpDQ($vPFwFof>G#BNjEyd|>{
z!;PNvb<bRA_UMS8RSp42xNYu7?&bqO$D9+<-qTgv;92~Piv#JI?F-bzuf7Wyzc*KY
zsf}0ZDZbTh?W7pig47(Ww|{aty*NU(K5dL{iN*OScoB0!E-v9inZNB1%3@~(2W6}!
z0DqzxpNM8W6`+s1oG>~>0OSK(Z7^$fiP4gSL3X%-O%*d<T-F?<R4mni2WfUK#0<BK
zxE&z*HrU)4QIBpbZfK8e7$e({27CDdr*ovY@4wBCJFl!O;ddLP&Mi3~2q5nZHe-71
ze==dL-0dC$>fH5PTK8_B=QeYh--S3eiuSvoSK*UmtJ7zT4|<@?D&1;=UcUyEX4>ee
z_AnsE%*M}fSASpF#yUqX?`@*%O8`i=6V2r3>S=j5AXdy^UD5_Xla9)1HA|Dzc5Jpm
zFVE-wE%bJ*Y^b|x(RS-RNH6e@3^!z{?+nYVS;s*-U>A>WDkfix;*GAbPgB`_sW4ZU
z+_FP3TBh;dUsxLJ24;EOyO6wm8FxL2R7-jPIms!~9+gITerfh{IL!vw0@Mw#?$uhK
z45@LB>voN-TH@6q?>eWIymD8-pjF#zb-lVyo0j^nPY>YEx!CD(jT@~FN4F?@wmtn0
z3Tz;jC(9Wx474)`k2>5MkAGajbEOE2qZ$UjfSA1~9?)e8_|4b|Y;uH^9vi1`8IISP
zfG8EBg``<L2EI+U<pTe5-hXJZ)>8TF5Wt(eZ4_GF@$IHhXMA?DW=mnYx`h`1s)}_t
zCM~~iQqth!RQvWH(69X^O-T4m`B-_8d)LXa7{Z~26)xs<6GcCQf%(}w{396t%5O4!
z2#^0nNA)}{kHL@Ir|-8ea<0Ecek;}^cFTykWt9@0*#4DjOUBOpg`hO7Q#PJ%L{qDr
zZ`un3iN&IlM@(p3&!}F5Dm8IO9P6Bp8jD?kub<oNQE5{%Xx9IkfAV@2=zotype@cH
zRLxG$954g8c{}`@+Nt~`okCh0ua4-hOc5(mYCC3#JFwL)OgDIwh)a3M*Y%$Z<9Z|e
zhx88z4-dclqQ??{`B?jLRMZ<O>zf$-;@ph$!Ggu3j)4Kw_Hgt1Iwz;LmEAqp@A2q<
zRiFRe>@mxW6x`=S<-xRfB$97?Dp38f@9T@;8}<6aUcHwt4fw0S>)&2BfzJ*fm$1h`
zt9%$OuAA}25L&_cK=3~k!~lGI|IfG0QvKi8-=62`!%_KOzb}u+%bZ&FUf&0k%kvdv
zoR^uT&qRb}s4s`WM5#YGXH0Fhy>VqSu_c)e`=nOt5*7F{3?a9Lo_;m=+twa|8vhV)
zgj*05?iQf`y_`<#4{zM?8TWKw4;uodnU9az-=@OlEJ<Bq!NYH@DMo{Ruk}(npm->v
z*hF*V+4=L`n<ZF<M0b9qmR>%CkDIcwv6ZRZN8C8MEa-M4rOin~DYE~X|AcL-*hWSU
z1aC~hFzJd$Z`r3tUaSs}oT9-xuHji|ibnZuvp1=$-(C_?cb`Thh_^m`pnIA%<=j0x
zktV*O({MWUUCWdn^g$O!`=n{{NmD=6V;#(k5pQTP4Z#peUj;-a=XfQdotP8VqcIdQ
zpq8qI3$#L?Kx0}B`{@6@l`-kO>AqKfmE{ZI{+o=ua0a0M`WpPWiI0l{q3jLmjqzU>
z(VS{h`r+ai8TD0NPulEg_eDnxSAl(@7%>{;ILolTz`=eR{Q?aOj1%QZ)Gs+Q*KqLv
zq)EemMI|2C*MZjPd5$UdANgI7#fa4u0sAW@v06<K$)*OgbpOoMK=%frCYQ!4&k@BG
z_r|U)hmQ<hC>m9Y`q2I)zx5O3I!7V|e3UR?h_E9KY%gQzOKxNe@*FeV@`VeHKQPq7
zqxNQrSk7!wSqnEbYfhl1g@8;6Ed*v_cc8g#(o9(OxnMflC>+0>j;z%BC4K_Y1L9xU
z;iITBKs!XrY0NQ-$@Inbx+IOIVFuG(psr?jvQ~Z=u~THw`<Wy$CpXDCDkl7siVYI-
zR2JF#Y=!sSd4JHvhQTqL0UNZAiw#=Iw1(fUUf`7}=e?1IcLa?>`#ua}J{m-2WuE7t
z)*Fa7$eA#EJl^rU+*`hU@&EGN4Uh*XGN&G$rpNx*C%K_pKj!9+j;#$yZ<<`2oc32i
zoMLp^;)!}yyK}_A;L_Nk+t%OC|0qZ6@8&*$^6^woi$3(o85$=H*x*r#fve66e%QbU
zI!-8s(uMZ!Nx(T!Urq~SCP83`qIe?IwI0LT`gg37FFErB(3fVP0t1=F%Zf$~T_%+F
zxSp{Rq)HlH)`U5B&F<~QV2<pmaf^kf=NL-vNn<QGe?ZEpo<W!b$KGx>>?7mbbu0hj
zQ5&$9pNrpNBXIEhS#I9-DD*7+KQkKXK>#SajF}~rQLZZguY=tpM}9n?dwYLhzFBju
z=R=f1rhYfiWI6A6hRIowmr=3X#^-v-yi$4m!`<rIJev;x{mqkA?fBMzu>UswK90s$
zH@Ow;F2@%~<$q|`zHEp!?lKND;Dh|L^ruD}--Dc_cYff%|KQTqddyjXOarXuT|LR}
z%|ZMbXZVL;MS(QaXkJJJH-|7|LLjX>X(0zJ3K*kE$s+Js=wMb@s5fnv^t4_io)%zm
zf{xv7@<f3%dtmw0e<eiOktTD)al|i1vL1G=4A1pzU!r9veq#$097>Wz@*#)KuiZF?
zC|k<UQ^*ZK7oD~N?sSa;C*XjgU+@ADA;_RAoX0^U-t4pRvNaY`umqSI&Nd56g|JY<
zDk>WD*)ZPZf*g&?A6UagG4ho1M}~tPXDswejK-j)B0sBOb8aYq22K*&4qFzu!f~Ep
zuVRU!p>Z}oWIYmmPV9O60i;rGjJyLfPJM-u2$+iSR@6P5QTm+-zk^=4;aVpPF;ks2
zv%>@~X4xgff_AtB6bdH{O^OyVCOCR3<gs9pGeP=&NX7#Nhjci_8z@p_LRcwSB$c9l
zkR7CQBQp0EQItfXBtk<%W1!mqbu`LbKpJ9Z>fK{QQd(8e@L`!{tCO3{rR%?%R=^!$
z5OTH!n}wmRFJ-(EggX@eBazg91=bqSSbipz;v8<pz2&65rEI*TYe~hNpY++W4aqeM
zZf>7dS`E;XmyP!`w_|?|PVXO-R&8+mc2v6fQn_m0e|b3gy<$mjfp<N)Sk$=qGWpnO
z?4e-kmTwj+2h(MZ_l?rz_gk{z%GG~wIp^o>v=;V~AG~-nui3dA_~_c??$NW$=cNjt
z4-1ophtsm#G@HM+?uh$Y+&A2w*?%v1SK`|7isi?q-vYmB&aapTe%(lXbp!BW4Msk_
z*!Z&ZZurQ;!O73dd81&>(fjRYep|Qhx45wzz$nlwcp1L(yP5Lb=HZ!=d40Q9yhI`2
zn|>y3c3rdU;jwXaXW0CHv9!L0DK+iA21GFY6CRK!r{!(?weV37%50VUPbJ(85*8QV
zRqMwS?s(6)Zr5kg2h_QWE)cG2Zs*<d5*F_34Pf&;yZ0))d3I)2tH1K_&=<(N)b&Hy
zyLQ<V4+qa3!l5r_wIHdH%q_keU}=xl$KP|ulK2baOx(PBaq%&!@#S6-cIAs!0K#BS
zL@n3A*GI$|%m6p<U&u8Pg9YV9|K=*K2b{GZ$s#wmEfEJ7Kwmd=E6Eeo9gi~^Hcqo1
zZi{|%+>6%R3kJ5==1r4Tm&Y|+s-^R(eb(F~r(7Ny?8u0IPPa~JG3*Aopz}{S8(c25
zv2`6Om+d;=U6XUqt5*K3*$F1|@V!lW&Vl>6?nlJ1%D+QRe++$-yo4<I794G1u9EmL
zfX)gO9@JIfA5ug|Ln!s-Dduz@p7WlaQx}DP<w>h68)c^nO(tVAd|Cdy1!8P5$wU3b
zH`>LW`S+|9!%A<zr*Fh;w1sVZUeVZYZ3I6z#d3IP@0iOi-VoDwHthpb=UZ=&eqo<P
zUuf;`CvsZkE1n(ChwD}D-7B7NEDrS6s&im27&hqLJ++Y7rf1Rp&077I*^blW=4tQ5
zJJ77wU6eFycbj=CFzRwcCaaGJRZs8c?d^fI=7WB|;a7&d2SW=;+-tpai{_)key?iN
zk&0WXu#V>7TgV#IU<Of_y6T1g%))4~%hoi^8c$8O9b4$lM8|X@uAShAd%Icy-QMmi
zkJhxl*YeQY{*?nFvo7%BL*EW4pFFyt+r{C#ZNIA+cW=jp<3m<a^w?E<dS<=H29qxC
z%^44OG;~cqJ!O}9kM9?zLst4pg<$C2(dcLz{M$v<y-ycJpS&6neLj2AQwwtUozy<}
zanDUnmmN2$8EggUrF$bA=rk4AplvxTi_s_4rFG6S+J2&vMD6Q*G@n=9J6YN{-o8@p
zUbNN*<vA#_q@DGf87rOp&Re$n6n&^?l6U!%e{4%XC-6(VfgjrPKLWt<1%cP2tmd3y
zN$T@gFp_C$buE-L8`an9yI;YNyC1*zzoN%o%G{rMpCu%qX<z}jfAK$iUwLz1)^ew~
z_;1gbSYX6IvRr>?yRcPit@Ukp;J{{c(6yg{cDg+7W&d5b_(CI0cJI{J0^*%Ki$g}%
zp9_{H1uFDY;HSktNbXZ?`vnC313Ux^XP#&Yr<CCcgcO62JTbA5^P`j+tCSh{5azCr
z44xZu%CGAt!w%tUEpv$TZHXK)|FKAfGc1#>{^P`9EER-?eXE614?ljN5u(vgoz$Ze
zo@AsmOAUZcN+%vU;m`nIT}UpSIU}wpxD}Z`Xa`rSxYm2<CpoWp9Du@DVrH&xoCO={
zlQc@>INxK9=Rbc1@G12wdbv#LV7a^x;;XRzI}aqN5ea2QDdTl%&#vtm5dC|Fb4M0U
zeMd-k!ElLr7UUMtiXEnWC>Fm!5hv+zO~cy3Tj(+0hm&5quF3!_iUEQkF7Fj38iasg
zL7PonV3$dL3expzg6|a9|0%2awQ|5Hx<#7Tw*Oahdw$0*)_jqhKljy(!DV1X{?1JH
zGGi_g<smD{-0@9|-ia0yRC&KNK5{$xZ3(;BP^pE*scPIJ!q9`$U%#Rrav(n{5`f{R
zFCa94gnP_Y6`oCVCmfTKy=;(mBi-7rgk&3N0T?ykf&uB8jb9=%Dl7i_k{skpoR~wq
zJmu1A3g=BYY?N#hFpn082__dg(l7!Ys#pxr=^ci%z?rTP5Ncpw)j|o$;W1lB0Bfa>
zbl{{2fH9<Ae(z{S(kYU0VSZE}JOWa}0CaE8>91Mqaejm5IJ>OkO1m%U*kl=c;UArl
z0-jyQVZ=B{Tg4R;0B-Pn2g9(L9(6>6-t-{Qa-stDhEAD>tBy-ziA+0uA|grFKM0Ie
zTxG)FOD4e-Q^NIvivwm@d5=XEa408J3pQNi*fA?}@Q&qIXPQS>5Wi!G*nTsrM@=3X
zcCVBU+hFrXUK}GdL=Xg18|27NE2NmXza8S4snuQ%NaAhfafv1yy_w7x^b~4;|4>E+
ziWIa^_M70(iR-sqPR{t%EuO(zR>B<WvB;5r0B36V=g0-~OK*5kHE`B^J)M`EHF|wu
zC@gopX*QNCuvG<<#NK14zr7obGG`Uc^5j^5uEx37k`WIeuI=fl`OC&rta&X(GZx?h
z>}RYE%*PEwP#}%)!?ML*W1IUsA>qm{DH<(8;|mmwoz;9R5hqkv_ImL_$KKw`9<G{U
z>ov|?<<tRVu*V66?j!0bhmm=$8*8v;%2`wr$FMg9B19RU3{GQ`4O0quFs73*aqrz!
zkF>f*@AAS-n(jyf$lzD8m`)AXHJbrcuH(>vFvI}%Sb5C2;(=JitSE145;o*5Ek8cQ
z)9Pp0>~#pGj}6nUFPBm0M9C^CGBIy3^+)GNA&IZe*=O>D#Rt(&#enAXrAo7!hn~j=
z3pVvgw<DslZ5xac;8^F)4GX(tqE!X2QzynH(K9+_5)F{H_3u%Opm=BX3)MZnIgK#y
z%!dY4QCXF#Vyk9&enK4PDJ7qO%6iU6+Uca(AmK&<ex6=EZ#1vecd90qRDgeRbd*Q$
zr;dW-X3+qV<s}$8X5+xzNQ#w2*qkzPVlk{p2@j$XP6xS9(7e^^K~xVncK#$5x3p7J
z?g9%G7zX3sW1FTfR8o$nceFwOgTBG}@Jz)SYWyk019ZR)LT@j@e%@Tpb=5waFd_<!
z{9Vcmbqa8*KMvGyS(X$YC%s6)6cgqgl;a)|pbb7;3OAzHM;xXUt(H6AS1N)f>7a(W
zk}Gp2^sMib*$&_xH)KsK4ne~eoOKjk0Bk0RY$9wz3yE_`4mwPFRQXR}i529dc^uGc
zJJHDT(JP0lU@CBb%BS4jraRsOG%9$c!i2Eqr7?>)j7a#h&lC^Zd!iUsGKhgSg6XYI
zMgtEu2K`qr`Xn3-4ka>(X=k$5iryl{CnQM%Vnwa$XFZuCz$>{02O|0=E0!6c9UBmF
zvW&~G<i#dO%G9!o0c_SXjzBX29C7twWIqzvW(ig^q9J)oqM14@NMvU0NRsYPrp53g
z;qhbPqfke?S?}HJN_f-uoA^bhOd1BHgIIF}an($=f+r1QPnj~{g^@d^%vP4)T-CBB
zA}A)`6;+h%;mpbs3safKq%4#Vg&YyvFFOq-kI-0yHs9?MxlIwph?Mv7Y|C&SXB^74
z7u<5pFHM3~qgIUw^XS|m9-pyX$9a8Sb*bB^hvToY#uKZrYoUP*UDqPhos?|Y@?#P(
zQT`$Y&Nn>WZ?t-(S-ve*3RlcaV8#C)6j+G?^E>&WGGtfd%G)VoK&B^c=p~^jLIzgf
z_H1sH^G?M~;yOKJ9mn?mCU~H&6Ih-zL6b=vxAhn{bFORi{ESPYd!zd3%>eUQc1xj8
zwaZw$c14bPA>$CeObymF0mAIvdfrdYOF%(>=zxY_4&}jqA1Q){D2aJ+P&<;xp>800
z+VYbCFCKt>Ev<O|-)~ttrSY^=Q$<8|k=5g+0k-DergfOzXL&F!7tKXE6jaX|0iEA%
zFm3WqebfC{=LgkhbB|wK@s|?>PcH8xne?FZKBO4a>Oe@S%oW*%M)ER@YmmpoxtT`s
z?C2<;8)(`rq4pR^^m;s$ym-4E|KvVoB|2aT8w2=}7aq<JGrjqFhelg`vGtOq4{?uE
zcj>5ZubRVC(VwBwVA5#+`b0GeA9Nu^0k0;D!ICP=NQjNw!aw~(plHr!N!ORo<b^xO
z)*T(+vZ{u0<kqRoLRs8LNlIn(M62rGZFWKxL@W?3h#xOYrO7+g%rPlh8$sjq7YZaQ
zH=NG6QqH&?QtPM!w~0Kg@=nfp8b$Q;x;1?HZL@f=ELhZYiloT_3wENYE6B?7)DR%w
zcP>*Bwzx0Hr%ND}ly+#n^=VXIOOF3zGf1!J^Ud=b)!Z>y>!8zXZ|mQ<=U{^#XYBpB
zS=*Xxv+Ycx9X}bSH0-znHBvO(qK<zrcOQ}G_vmpten>8V!+CODEo!{u)#WoMecICa
zv4ux3AU8>-G}o9j_OfDytjV*VvrP8o@eIj-@3`rg%v(hVjgucC*rq(#2bXlj>ok?k
z*2X1t6rrUr0xl2o8bYLA<)}c7=*<N~JL)9*!v^aF7vVA#F@W<48D9e;j-eQ)DiksZ
zv@GI<3ZD(~RHoU|pi*|vy%Qm(!D)C&EX1(uJDTE~u$R^{#ojk-S}5pj5AO~PE-ixv
z+Y3qeL=*t#qDzzRB5vg+BfkOytX7~fd7x=n{LEz-%k6k%T~5qpn7iGr=P>;gCb`P?
zH92gBN&#5a7JL`#h^pu8hCDHc7@PD?O72}Oqg6)C`Z)~e5bRsL_md6+86FNhI^&ve
z!+l;OnpbJcqnb}GcUUnMgsxBWuW<<xuq}p{h%M2FnA7Mrg7@+6;Z>-Jy|d#Cl&f8M
z>E59-cO~Zt6z=7(TzVAcS=dgmM}L@o=!w&8x0E&)TT_NJB$qkOrl>LHS?64h-SADe
z_OMKT*;Jf1*!4gZ6t5d}!RA%aIPX0<`RL(N*oS(M>={eJKow5i-kMDE+Q9b&9$0xi
z7$tNm8>Jh;MMN>J(G{x7tN37l81dQSYK_dDS>~N4CU_PnrvFGLP!c1l??VBUW;DXf
zIy#NYG+f=E>;-7D&SqI)W3ptpa~myUU`o#YzXdLFoNxzZP&@HS*bNs%&E7K;=Rr(l
zFy!9Z43YANy};=w$2ms~bWD$s6-58KlDc?p*hg0ICTWT>AlzW?We81c;P_TRi@5NM
zB1O+>gUB0~q5&CuV(Gh|yQ;$ONybz>+WJ&lni#FmZ(Cb*^$sl^V{;a;R=l=q@7tQf
zns;BUc__i9B=L7sXN@~C;x^&YGvMhloqF2I;nCL-H&0Zer#tel*c@;lafb#^72b&R
zXg`WPA~2YvW9UYMVo<(mt~d5Yn-{HIqN^`Mbp!gX@}l}vb7fXIzop?$y5V<&ut>ve
zyTsP_scRM8-q2*ec6^iZdOq`N<#~mY>p~v3B&h}=Xc>#s>vyB=61WM836I4{=)rW8
zOb*PZs=@rcS9CD&i>!nBpq?$Bk0a)2$<3SabV%7Lz$&8KBkl9hw9BI-K?%r)m$h<e
zjeuj!gxxUW1~#zNI)nu~%{WMt2UTYk)$*eAsZL{fGN1tyOpTy##6^8do(8wGo4~?#
zR)Lgq6XPzK?KNY)aE4_a){*_BnNxQ#O*Gs!fWh*tfa@ibuqUx%FXQSUViz1@@A+4Z
z3v=-P@Cu|N3>jm^Soc+XsB2*t;);&nMXd&bWqNBF;L%JHr%odS3x=@Jo<X(7Tc7@E
z)Ev<ZM=qLd<&5E5Ow5)kx=cwWA-|ZSn`FS+vQ}M_xzn2z3jTgFEnu~%D~>dVQK~~2
zJ5B0gi`wB1R_%v6w|5<yIbrI6C2kNXI~RO5B`~X%h-?_7yq%u0y0S_cQQODJsb6Ou
z>^2d56>nL$49pr`SblO71w#Z^CnQqb73OXoF(KBp15Vlo0J+^O=$x1Ze&ss&6XQ8K
z&VT8W8fc4X^>L`c4RZ_IlsyWX?9QI)T#0#x`H9b!2Y?&^q~>9r5S0PGlGd4-uG(6S
z)0y|WOV9L!XqepIIfyCtY19gA92U>xcq_$A5W*bC=&LOt7{Ck7YXL2mTL`FhMIp`>
zWF{qt@5}CQSD;dP!wk~3P4O$TKj5%{!vfKb5DrvglOQ9Ap?J*E7^8qYCZvwi0|rQt
zO%cH$?M|5yzee;Nu+YGtZb11WWJH8+i9kD!Tk4r=t#_`gMEP9UQ|E69;#AR@!TOU&
zD#;*ZA3A*b#a5UikbZX%(GX=S*|bq+NnB1L8jLUti%z@ff-#~tpyPssah!f$kFY8Y
zDN)@v{?tZ<2=4<W5?8!vW3HC|aPP6H;21zt)|d30z$N{35owNhbAZ-M9qg50_}c<p
zkIL(n%O6I4*UaflCV*5DT*E_Q04A~$&+vo29vM4KOeqS5J-sS{Fim+&fe;h6i3N8{
z!Cpa0ydmp)Gj><!Xr)w4WL7U0*rYl{S2uPVN#Y!l|L0bXn`4(MUOvGb6WqE*j6mD@
z8e+YfoSDX*hU{AXh3?O(s@IgAfCpF;r?vW&OqacC1aaE@m?pb=40RDg0b$e~Ees<$
zidh@0fm?)xD%F^k?iM5+E}X32Eh0A&LV2m$WF2ClvahFKUyU!3>azho7PvaCEk~;g
zM-?`@foh&LO&A_2aI9HH!>Ahy&Hhs&k(sF#Mt`mD#)jBkX8T}_EEO!ZZc{T145;0N
zM2D9v)5nr2?aR1R9EwU_g-_bo%*YX@I6FnO3L{vCdzal3lQJE5Tev3dpfRR_p8+4Y
zatG$YJjKPRg&Uvzp!CYeTBIa($7)$Iw>_;TaSW#;(?p%?gX;K=#E$K~jLxcqI-^ky
zBo8IT2F_t<|65qxV*!ps8ZG*Ki=-)7>`Tt#Kf>HSLBfJItg@(SN<<kN-GH3YqG7)I
z+(HQIzDV!dR;CfMqGhv7)!m7dCQF#V)z>+r^0|KB)2&$#fJ9H7?;cQpe~vLU9{F%X
z(UAb{hAd0y$0+xxPO2sOOwMCO0~i8X1Ze}QGl7H1A-xtEx{YuN1VPCMnxul-`$tXE
zY%HML)oe;E7)OpL)po*=19Ct(|H_PYiBqa<htfs1p%I(0eVWr?@>eURqXOY=97GHc
za*x(zeb=Xq)Zgr|++r6e4*)pB0{hU_2AxP^w@7g{g0rw(rn1tQsY?eBm7WFsNm(Kq
zkOFu%G;wDNN)7NNIoJmaOLCJU@o!d>F$ES(PTJ)7=M~}`6_fOvxfQ?7nfILCSH#tw
z8S_r*i5<``$fog+UIP6|EK6NOk-=nBOli!-&$(LFNi@tLSV`pE;6z}Lv%~iO(t`b5
zlM`V0AdxhFB730u_SovNU&~(pLWV_tcqS+{)Ft|A4%Sgmv@7=;F`dObv5icXjQ5{}
z>y@(a+34EFS|aHhIXa~!$IS)ix6Tb98{V9K+<P~>+&ng(m?(WTX8PV!2-@Z4Mt*C%
zrKFgED)Log(88v+T~BvLdf?|f85ZSGn|$!Jy-l8i#sE!EV;rK((~?X6na$WZV8XF9
zdw+6oL6h@85ByrCxukN|*8vmmzp|mHdqkPw+0oHCv8HJ>nc5Y|Ag8t&E;ZGjXD6o;
zh1NWtM!M3davhErjQ2zyHH9i7^+l^R>*mYz@I84^jvEl_xhB*l3PqS1m<6_*LI0#(
zXg9o-Dx*?qkrO(~RZwFc^Wyl`+QXVovWh`0pr16bpU*@totjJZA$x|t8?Dr#FEdyw
zFTOK8ym@DS{wBBS(P!dC%6U44@<e4`6QHJZxLWjOKnQFj4YfbQ=;g0Rbk(Dom_J6K
zaT{&tI+smlF>+(u3H9#=Yol^m_vDMFh<UVWPd{}gSSTG!rAcHG$9f|y)d0M=kdlmk
zQ+2XN0A-LWO|3wD-6z+#E;O2=l~?2=qL+NoI<-6)aE$2HkQa)<fyb}>>U4pz=L^7A
zathU9%GZoYA!mk?^YIaUc`$=|D~+tDd6YDaS(stWgB6)rG6#THD`eJ4NH{6-Favcm
z1|mQTaYltYNm1)o6yoHLtiH&+mCN$|Yl;!5-QYx9`?0*^@N%hcY*^SUoGvok8O`*@
z2$-o3jT|4@Ay(I5m^joN2%g~_>VqFWHn=#(F?w$sJRH`FEGB30ez`4ja9Q58;qj(>
zTJtcJ?hQVt6zz0)B{2z_IH@Znz!}W(Yj63vP_Gl*m~z8DX1*hoPMua|(@Yt2?QIuR
z?xL;T5e31dh}wnpcd+$t_z`(q|9)<4*jpMHsT2;fmmSykUi(#<uC$wfVmkxE+^Z^{
zp_5r{BflauWaS!X4qOrwWHFaVzB7RxEOx<|j2%A701G~D;7^2G*fg|HrQ`s9Sr`QW
zty_6qe=S^Y%=^C1F+;t>3`=3(kl`e>;L_1U&%Z#al!tVju!V%DWu{%PuDb9N5m4kA
z3fm%7C4wpLsg2cEGh4WV1XRo8ff=K^uTSS<LIQ0;bd+4&3x6m2pPGr`h1(+(P51d|
zOcF8CtMj{b`|H!%F9YPvZ%C^R>Z7E63Z)7;f3*HWBgEFOI39BUP|36zF0ad<bLx+2
zZq~(!vj9rcx14Z9Q*1AXBw@!XH$Iuv0)ap!kQ>Liv5J>R5#mCun#T58xQC)lR}daD
z0iTnQ(32QW$o{>~#}l2wsj4*?=s3f3uz*W+zLi`+vLpbn7)HrY_Px0fva8|>XUssp
zp*G%C9vyI*+nE+eUZ3Y$scM$sXtZK$9tw;dAH9J3hgl)^hs1azX1K&B6v2WAWLgl~
z8^%!sQ6LjUlkITv$p3Q5;bUqCVaXA)4@9i<1j*4d21pp`i^Jg<?y52|Jy=sKigzDk
z91g6l3^QBowIg9j)a6w2tKK8^f(Mnb0WTUIUe=!!FH)M;j7Ukamg3#gU<v|vQSbME
zu7oxNUXqfcY>MLsGNEz;7B5vUXgG?*Hf_y|Of3jYb=2vZ0yolwtLc%M>CRjRd+|C?
zjP&6kruFYWjLxwFUr$KoaC_v6K{%i(UO8ZPOM+uuSptTxI}zDP1W%uZ1eift#GY{I
ziVFB&+n!}(`BnioE|8ci8i5cqWX53as0)kM#th06bdQ?@X!pU%PXqQ==sUgq&49GJ
ze<>i&6oe_Z!m#24hB}hb82rPc`wY|Xd^;hFe!$D1HCYyk^RVY7=S3vAmN9Ev-FMPL
zdx)5#9nI@3B<w1AXvVX0c2bt8MRh<cwMQc3qRS}^3=v^Jsmv6KLawpF_cW(Qpd{+6
zM`i|>hoFq6Q>?ToY)hbLTm>ggZ?boJ__ibE?TMVmHEJ2h$=YRVafI6u#h|KuW_F$g
z^bZJB0Gq<wHt^le;}elke6aQyagL%rr|5BIbjI~Zc2`FuHg>_;#PaG)P`ly>4=FOF
zcFEoYv|_DrloBX0t5v>{x(3F*H%V_J0fr(M#^RGu>@xav*!QTwZlLLe#l|vKB(^~#
z+_H%Ykq76lq*lUGKj$zxH}+1c$X%f|&Qrt>5Jseesm=M$buKz#FxREbtU`m6ab*MS
ziNE1BI{Gc;o0g^nI4?o~PqQ*or^TUiZxfOI6N<G|ecxk=ey9qXIM`5LRo0s{WIU=}
zmFgCPTy(z%fC(fD1@i;r5z8Tm2g}VR8+|Vi=rkfh@zpg#CS~ELJu^kMVhBY>)#I7$
zS7Vh>L;j=S?>XKTR}a0};LbqhNgYLw-$XqEKMi(a@*fF2RcNjX)`u}dZobwbVN1Ha
zGbU{&{X!GISSOlu8|{tlS)DuO0n-7-Nw*t!P~D&CmV$Mr9>{8#EoN}y8Dy+rGTTp*
zFlIQP)JWk>?Y1YF=xayjdh$F~Gcsw-^N5}y>z~S62M|nSHQX#}k|ixnq!>KP=cX)D
zt46=4gYL*peF)}wI%oDCb$a1hBj4h?E|94kt^{o%`p)ZSZ&JIi#Rs0vfKRs0wbPLF
zXq#Y6cAs-3#$P=HI9}tW1r<)^c#WWPv<>-msuOjxw&F+r66;jXE>R<YD>yQTB7d9Q
zt6gz@iZ;W)Rst*Ien8*2@d2>@61stmT91945F3sl&HjKdFsTnQ6Pu$z<V93~G?UpB
z)&uh#N<6NYOPid!nSP$w{80LRNfuFRs;HW*7$W+jVqw>}m3720_88{W7rJVM3jS`_
zw7k-J1G{vtSqhs(gP3$_s1?~qbKHcNG(KTW2mXCVD)~5030Z64Q8xH}Ko_V$GSn;$
z_nodH=GV&f-V88h!`#b>&G=A{ab`l9XM+iEu}LeY+fWEv9lukILAV06sMknN63nhk
zW+9^4fXyV*Kv=8!8-?MJkcalVXoN@^VJ(lE2Sk<Jby3lKTCH5rwEZWduBJZ$lmg1C
zct2Xs)jn`oXvt9n%;SKvw@!f)SyPfb@`i^{?aXn&BeQa@aW+{IgdCD}wj|B02|p%@
zdUdgwu;9p{18A+RQKY>*!Sab;CkH`W!K~9wIWT06<#gU98Db;e^HUIDmP5bIa@$tE
zB)e@|(!|fr0?vnEB&cPDGLyXf*w85GoC5;0j;bcWH3&b@3l3PEJ-@Nj_4dp^44Cyj
z6Hk_h5gNUA$;3Tyl^*k)`x8_>TG60ypwvPD>s87S2JO+8D#d+H+s{A_z-b*TOH~2#
z3JW<f4RA=IaMOcdcTjEx9DNn;YX6=(_C2FuG7CzGMT;QjjWof@Tky9BWZD$jMo9Pn
zfff@wfaI@5P1gndjYXbEWx&Kn4-2ivk_rKlZ&Q^O)_D}OwZ_&iEM|xzAa1p{c|0m)
zw0lJyZV|(_?Wi|bH-lC>wSu3bl6EvPJm9zt`xW7d9y|2=6-ftTxyR7f+oPN-!l)i@
z{)NBKjRhl&Sv4NpErfMIt2ld>Pyx&1U!}v2jTxlmx<3oeTx7`7rGVhUb`yEN5=+iz
zl%8DyPXurr5j9!95|NFW&-D;fs~L$s8o{thog%wsdu;Ct@G%QU3lBDXP>(?m21DAK
z5%zlPs*0LiW^4_uUBHC0$`81bb{9WhBeS~>-L>sGHZFxV&rtliV$E2mk|;ss!Dd$J
zfsOH)AlQtkGH1j>&#5=Lc<`a{fG3q2Qsuxw@tQ!J8p)a}x~5q)fbT1r1ttJ0?uIcg
zoj(8>v5P3v7J#?7&l1GJ{uLuRBU}P}mebI%SY8lx>mod3M6<fZ2B-JDY0w<E^8I2?
z0ZlJ!ds|$Qkj@b|WKM+D)Fq`vtq!F5CAR6orAfQOdi(oox<R2-PV|d!Tx4+J^X^P+
zsQ~dYr~#94Qs$u|bp^#y*=u*i>#QzW3S$>B5CHreL0*l938(MFPQZo7LQ5H>Q`nEF
z@M$yw6XKt^dMwf5m2_pKgRb4rXfW#Z_QD5FacDC6CG9CBE{L8?#Wv={A7W1R`<DVH
z>w}SGYutqr=%TA>sc*M?XW6cLEA_{|lyjJ=M48+LZ;U<QcCKU*IUaCEMIs}J*?zMg
zCe^a(H88(%_FO`Mj=3?yfuQe81gLq<NIPS)_@#%)g{nyQaWcQOd?Gm;Pj^AJe5F<L
zb{)qyqD+w6x34O1pE+JzylyMS9VK!>($m{XIwYz1FDCjB)(ni?ziKT93|QXlew>=g
z8Rw+80&sL;XJ99cOkcF7&%fPtWXy}2>0D;M2X>_57+m+mv2xGVG(jrjxYkw-q+H9(
z=0#e}(s2M4tv&{t3`A)R?@HD*K<i`1Ke0?%FU>l16mD3x^SNC@3j=Lb;=Y#y)^Q?~
zCXVf{0?}fB`KEU;?g-BIw$8eCa^FKN7}q;g<en-7BTHD31x8>w4%rppOtaTdfh#fR
z20~|uDDXm?vLb^TJ>1VSHO41Nvin<B1i%w|IwI(dJ6>;5ss8SpO)vrqH$*=c<JzA$
zy=%zv@W7wm?~XHU4H|oH;m<&=QccmMK36|JXZq{K$?<PUgS8t&>no<iaav5;vnECu
zv^BY~<-7uj`Pe6HU->^5Sv=?`&(zH50fsIQ`|BsI75222#nLud6H6rp>oR&6!*q-}
zs;Ww#>ucLy*Ph)tApzAFkhrOT%DUg_!EIu369v1aSP>}es1a~xd~$endS~%2ZC1Sf
z<<vd-)A5D_(KnXn6Jj1tYbR?&O=CS1Gv!c@@W+T>nUDjUL_vpPj2Tr|0R-34%G?nA
zn0!Fz&kieR_E(H8TZ<p68aiO}S<P1>THzko5}`@U5o;Z&uLkBeavs_!kua{3Af%b$
z!<nz9OXy>)rcY)=S}MP>?*Zu8n??&R3C;+IvqQjEmQh3szc@soa;qo@hS>T>yXOAC
z>)KiWQ+Ts1S!_y7CqAjtZgEQ{m{Lcsh``<5whtQL{KfUf()jz^l~sAR?cO)fuI|QX
z`(FsGC6CYZ;rRtFc{9j9>j%xoFLfu)=Y*mX_P_YAzPMa^iq@m=pE>x3o~{Ebhg;CD
zmvx^$!RGJ`KlWZ*8+$uj^wLk*9%xFz4{(xQI&niDkPh(rn={as<)J&ZHMEJ6z?ZfY
z>0C|4weWx@`V$&L4CgC20jI>B^bkRZa+&dJhvX=9Rii|9W9k~L4mqI#NIg;JE(BJk
zz~Q1`ld<;!#l1<zzw7k=C>btef_654pPilP9;d-6=uu*1#t&_cOjV?YyUS*(K?8@v
zB{<Pi7waP$uFLXQcNk*C6A8O5DAIQ}fJDQAl&@!pt!bIDa6@4(lEjGB<Jp$wy-1QF
zT#xZGP>##G(?|B_Mj{zX<^unl&l)nyXMhwN)~p$g^v$%Qb5x;I#vV@&3NGUq@58!I
z{Dj<q5q8BGgcyuu_AommVv4OLPEyEnvV=EdZv)Mi6$MGojU7iZW-j=CgMm=q(6zh(
z%lF*A0m(TGZfu=iR0G(Rmy7qexNUt2PUG*NRI79Md04dkT)u4Fd%oZIyKF*ciGSHY
zpI^89Jbqti<SAp}R%jF=2iswd_k+^n&&_V(%GrBkvFPRGv=R261H8jEzg8>7Yl?q?
zo1H%>!xO;npTF01So2%t3pO$zb-hYcDgOV3v(POfRw(8AvM!~qF6*{^Jl76x3|c;~
z7gu&L<tF_$fe8i(-~sQmn_f2Fil2?4&6aq+%i*SxYPk3=n*KfFO!R*m^uCw8L!D^o
z0^w>DbU!YxVB@^q1BTjg`mb|Z=jG%z2dR&aeuBKnT|R}s=v6-QaPZt9?EO;jTrN&4
zLpSxP0a#sOxAe2zwjua{-)B{>US57qD|~zv{h7U>5P&e53f_7D7o5eQzPOX2jpPOD
zk;|C`8>dwZw^^$t?oI3C9Ru5K>#oJB*X0I2+0_2nI-U0?ZFt9V-oWN-d41AVYa`zm
zf#ucT;&88>p<EM?=zrj>_|XGIY??@7*XB*x(>{Ci+-@$e-Agy?yJTTs@Lj;0wv9Hg
zf-1M{xWRfvf`!@(TUpbfZ90Taj6rft_s-?rJ@(8)z|=mb?HgNm5z=+r>-K5~#`yW{
z{K<<9Ds-TQ)SjhaS&C1@@bYcp-g_D+u|D_-FhrDCqdFTD{fD78o8Zf(i#{4NFywgf
z8Hv5s?l8n%V+==F${+e^m-h@{e9Yml=xk;t+<(MIg30KJi?~OYF5{m59Px(kdyW3A
zhEG3Z<l;X?g9~l$t@EEgzBDC2d3>N=Ou|3>o?p+0y=OoEBco%E7R!MFVZw3!S22sK
zC?)rIbP{wCdgj8|M1JcZv6qr0^$Hfv=~LuhWLDryoHn`rvQNkjK*R)y>_NWBn$woT
z+GIr8;Xxf1QPkkDz3?0HdjoNHMLRmc8WO>jmQ~}XeBILK^AS^Amp$h(a~83)Z<PCq
zEqFh}1mFMrsvaPK+*Bs4;@@toa7dg;=Q%<2Pw+?7GCkLgy+J`5%S~2ONX`lFiNASC
zoClG!Olb<cbRer$<X1PJ6k8#!>5ac>agvYO-h4--6Hu-E2&@HUd=^WhYVJ#Mb0-at
zRh-?p?}A&bv?|Gq5oAE~LyfIJ3KW6tTe)0AwsNTlqb4c`rTHh!5f?sq2fz#5uz0kK
zLw^BH6N7gT)y6C^p9AqM{P|&~E_N8-enVybhqHYEqJb<b@Jw@Ur|S*a)!<0bpHH)%
z1?<sD3ccEL+rD#Dej5wU<Rat6k_EBS(vZ4ZEfOrHQbcX!n3)hN@g{8(awjFdW{>mw
zTuF<HBM&fzrIVRJF71yMm9{``+a~VF;k#|?WduS1k`GJ9i<xjTG0(&rcaH3!V^n@{
z<D-`!CMY@Kh`#(O^2D^1V&%BE6szrR(K!d!f~*a&iVAWAEn3nN=Q2aRi#6zZ-(6X5
zH=kuGtzFJbO)eN*L2x-4dn>+mS9UO)!M|rfDsu2~5IEsuM7fyoM++7&mPY1ty?z-o
zh6Hh@H>qx>>NYgqU`g5{4-#NW7vF*8#G}px7z$tq+)1>yOIWW#lGuviAd8TZ)W)*x
z<njTzpdV%Xl)QD1r&TFfQ~IsNU4y{f^<)hktPHi*`o{aebkGIV$DTF?(;@Xf<p9~s
z;5A4vVT8lxYCrB-VL;7q*be-z+|`YAOXmaCva7Tu)+u-Xb>J2t9eLTsTc>zkp)unC
z@T}9ZYM*D}Ck2(uXeji=moqgFTsM?ln&&Gs@iP69C6pYwRy`89wxn$DKf`>=OQYhC
zVKd>9(l~Jv<1l}0;*uD1;rZ~!>|=zWD2BOg591Az2s3a}8>#tGIGdIPYNI>a0LYU2
zndL~~@W@YMS$fH8a;qG5r!f+cag->WqTY!N;W!{ZiJh5&hB@PvUfa5(%yxL@;wH5j
z0>{DckHZ~Z9Dj{}AU|%D#UjlI%@0*d<kCg)(f3$J6~dTUBZqnuDoA?5wXZPhaY!5n
zXb12{Bu{EWJmrHP@NNwl!cVaK0*o(UICb2`*6<t_QEQfYf8GI9$$;nmScp8hcT!Q{
zl7JQ@Ka3ZUUNV>q1ArLc-#OPKJ@4#2u58~{f!lC^D3?u*z;gNx_q<t>FVu_CTW+OS
zuFSu`7ZAFiV~qcJ-pI8J>8jZzO7f>|>j>2<-+f(jEWHbu<63p|aukxVpS^|SG`1at
z07UJm7&-sxR$jX;y#R<PQc_20)TC76zIVZ);|Ipl{H7zSKsf|FF|ZjSQAu5k&`;u@
zrx@0BkIf#Y0oXqEETqt2zjQ#D_EP8Hv#dd*Q_uMa;g+Vy;5I?`T{b~P$tS|iGdeVW
zqiRnK*Ci4-Z=3z$DC+3&P8}IW6W&UtjxkkqvZc`2bWe0+PE>I?sFUt`FEi}kWn$^8
zd@Fidu*o3=tyTacgAcGGu&j!y^PIue;@6ZGbQ6Zo^*585&GURX=rOy@)x21$@=vWL
zRzX(~&B+>c29NX{f7;~Z*)Tj-LgjV>J&G^6F!sh>&X^<1DZ|PLVLqE+!KVVL?{*{H
zF^^d1)t=zVxwAPZERX+4i{EzsHh?q?Hl?-BG4Ob8N#|x`9Tn{f&~mR=cZ%cXB#di7
zJFT8ZOFp+U22@#jno!WosU4UGtN&%iELkFtiAy<1>><NAdERlGjo{c>it~n%jq2Ag
zvNBGsI>elAuMK41{}W$1$K8INgiE%3F_U<c?B$MQC%Xf~^2&-gOY$u}?(8MS{w6#0
z>Nd6?a0J&cdt*ZPxULn5J^i~utblW4HZJFc(aACjAu3vk&&w*MZBe}uM<Z06PA;H2
z2Dt}ppMwNXXi@R0>gG{j_9Jl}zpBMw#R*!uF*3huq29aB_mTxG_#_0j5%f9(58QHx
z2=^wzD9#N9W%?zR@vo$_W1<sO_K2Ll$q+<5$@AmEYDy8w7#i|}GQ5}gTI*uOnEuWr
zODIg}Ey@4cu1Z-_#46{63wOsSIt>cte&dP>ABt2o%H3n?S=qkyO5uK)XftNj!Iw6$
zJxNmp!SR51-U40{a;fuO+zR(*#VfKNv(+0Vc*(4g>@*@HQi~1szjq5TmbA=9DW$@L
zM|!rV=U7^22^)ACquI(2W`VYWfV3kUSC-}ofng2&5M-Lht@hgISPehV6XoBF^ht}X
zNt+ROq6!ND0yK7soXDSI>-0GPnchkyW5G}9>S<Ev;tLp_;Blb$^_zReKQnv4lQW2l
zRQ~hEDFAx%Fo&J_y~{vgvrPx-^=m`2B6^A$Y!0qAsct$Y-ekIoxZwW4?GnCp`~ia9
z;q^)H#@og|%juQ?M74l1^^VEG>?qB$({z96^zbz&Ld5jY5-{tS*{%*HjBR4Jxe}E`
z1{L&@d7b2X{(zXre$ex+Vq<)SRlha#1XYG(tyxq+q6PFsEqLV5v7ISrabwe(30&C@
zu50kXMydXAm&0z}I>?aKQD8-%g}%eu1L08^+bTN*F2GH9ICx+h(ozx=xak99pvkUC
z%UuBZd)U=>X41cghV7DNScry;&-zWwFX^ie94_PTmNN{?@g{ylc^4lBno#f%kl1Yh
zKt7_GlDR7~<6AqZY;Y9tu=#$)Oaz45D?X^1PDptZOi;$B^pa^WYPhQ5MOH^$BbU3g
zp(GrZ%*imb7(aYzKJVOL!Kh2PWrCqIEq(we`O2S!99JBqG$6w=nEFDCwsv1pyYNSt
zl&>CD-)COF`Cj)c5YpwgVn!A1rS_2JLQjM_Kc-`~D<2KC>+fm5E6*@;C=+lS8csZF
zX{1Z~7EID)O;k}ip+ykrSYVf)iZdJetS25IBYfRX@Eek37;42R3c7(Am)XM!T*f$P
z^SoYB^e5C_Y;ybxUs2m%z!S0b2E}k%6%ME=As%tKfp7zC*3Cnf8%&`}3xvKq7s?Ih
zVkH)YzSGVVPsM4+h2#98;3vB+XDhO^;ZgWc=kW?5T2wl`4r5qIw3)jE8&W11WR0n{
zrecrt#U5^J<xies7l@o0zq!1QjKk~>mJ&L$%S$3f%U^M2yL!Zo$Rap_aONoZRJNjm
zO_jpZ)^hllgbM{xuh;jh5JbL8YnDz|5dp>mSOuG`RT$uC3hZAQMPlN<6akh7g+<Gd
z{s?>EN3;!Z{B2Y==Gd@(+cdOVZpko4#}gPd_j=NN&`j<=Hrn+qs?JseLc1Z<)Yrhx
zi|Ilh9`A%nw+#fDX}L!dYW$dyG@E0~f%kd_A2C1$mh%$G`RIhQ5tIk9dr>L%Hh11c
zJw(yH;TYOQG`XWqQzXeA(XzJgNS&uOXmizny0uNKVhkncPc?W~gQWWK8)qu*Y>N>i
z*qZIFBHs*)t2nuuOW(>&<k;xR!e2`3+<aUXy--}$%%G;i8`f)%{_IiVgBlbO=-9m~
zJO%8+f1JdfUqZ2uAXd$6F2iObk$|*pbb?;60=)e^G3yn4!bD^xE<;}Q)En1Hd|%EG
z*LCcM#)~wW07o7a%{;JsW2il+v4rWxrG7CRO+tC8Y%EdLTjd)qv{&YR(Rr+MYhZX_
z(x?5{;4l|N&R#PkI?gWQ)ULFMP%kWM&c|J$F{76!r+=swfUg~8SkA+PEaDcLgs!<w
zO8F+3^w3p6HI-K^=ZHk@nHrW@!vHq&eQ@Uk$b;w`5X^Zq1B9X~2i|~-Ujqpt-nld9
zyMCCT*ozH(qzfRa#6GMty7Ovgc!`iQW{1;l4*&?K!B3iZ1nhYgOyKZg&P^^u>8f>(
zwZ?4qNu@%8{A+7uWCdU_;zCoPxoH}+fN48rZ#kD*5gJqeoHFbxjC;JbUiAcj9JT?X
zJS{QvZJA9!#=n4sU;3nThl*4?RjvbP9R?D+W*ZXqPlh5;oARrd8o1-*k$W!x0b4A4
zsP!35u8S@$7AGo`jP^peI5|mtwb}N|l>vaI8;z7sJnGB?F?m(Csm!LC?2SqeYOwWP
zlUKqxB$6!p_wTi^sRQkrCO%Pz#?seDTTX@vtAv<gX@vNo;b?uSc=XPb0Bp~_dp|!Q
z+BD~X5LEXoLPMEn+mGW`hkI^K`z9j1_I+s8gUyP6%-p(BX6@eHBtk%k{1gv0xKKKO
zx_bh0`$=)O@Hf#$jow*6Hx~DfHB;xAl4Q}NX>p+r3hfw^>6<{KJ|t&=Nw<XsDM^U%
zZ^5=qz6=w{n8P00*8#maPn@!g0<vrIkm+k4z)4_MzZ4y+jv$i-gWa3J5{_XF<s`#R
z8?#0iWS)*kPcrUmE{LTT)9Gi9hW^pu+O7*11jpvhf1f}n8qM?nut1m9Fl%^>WDb<(
z{1AqIp~vC_Z0`4QIDdm~KljFs3MCHcEKq{>du0|yPtN`Q><p9m)WaApmNWvO5xT%w
z>jjirJuP(9XrM(zZI$np!2TZqVL+b0$x3tNs_5ELI<vgI=g-+vs{^O__@m_Vb`npc
zpm*0B=7Y-?%s!&>4Juzce-cprX_rY$rAw<1T56!!yBr0qG_w1h9@Ft+cx6Ru_v$)B
z5Tc2`GNiyH*0+p-6aHIjCZJLbG~gR2s-fqYuF}6Jwkk8^#9)vfJys~Cb0(OXoMVUO
z^57Kd)rjjdHWiEcam=~vvaBSQGu*kzjXC(+AR=Bg85FVTb+WKgqpl%3sG)4>f<#im
z72GcAjMQ<MehfKv%$~tvl*x?l22<$_N5i|i3Zr1ZpwaClR_{ozOIm3dBGQbO&3A}V
z1DF?|2A5yPZz(eEjPhtu{AOPx161K9I(wpc5GSpc^eRsa$9L$AdWS|s8^H-}Cld7`
zXc%fpyaAm$BLxE`9Ybl?RYb|^$iI%k9vj^aK$i3vSO%W`V-7v#=l`3F32?Kj#7)M=
z4uQSid?fiE9g(YBRg^wIyz%fyImFs(Ej5U448T#K2V;Jg702KrWf{^{g-8vQZ{qeL
zCx(;_d^5VKy2%|K%qN%AkW*foRJlk!qXF00HgI(}f&Ct*G3naEnff@wTH_Yf^_SCt
zydIonw77*+|6@dUxbMffh1J{}*>Ei<8E9CJ)uPNYV=+2|%l+0QXeCR?AKqx+Q<z3H
zC0Eq<F))gf6`T%RO2PfuyO>Oe-s`N0=Od5JbR#PSa~HUSJ}<65EVD2f#&F5<_-r;T
z(pm28u%$b%!NlQ%u_MC_`zyPl8aR<|Bamp^hsmX!qd^psIgxeWmZpL=N2)H9Y2bg%
zmo^Aa4~E0}nsEzIka!Y&L2{{g(6Nv|ZtLhRn;wB*&&a%3@U@KHT}N)Yc-;!thq>MR
zF3(ShNi_Vj0ja85Su{x&;m}2@Xpas?D2iC!YJ`)Fj@F7l)e*ok1$PkP>WlMF0;4eb
zt79QYvuxl8I|HMhO!18NIgwQ;(PVQQd^+bC@tpCSiX{neD)L05lWkzeVU%-P8Ey5E
zOv5+M1C&FW>P2XvTs55qlu8p;2N6bVkO&8&pLC{X?m@{0#s^GNFi|2b8yg{&BwOn0
zVDphkA!CFus8br>J2_|RIi|gs^U>rS)g-A-S*rlM1rv(T2-Uz{Rq>`*2~fdtC>!4N
zNV?~OvfDM*c&o9@G<bw4o$S%EdqF3I+&++m6Y8_>8OKwXMZN9RWFJa{atHrX87DE2
zAL9t9unX9tzf=%1fV>J@d91AvZeHU!E4^VHG#asPkA|LWI8|$sqb=3=xc&|@luG%y
zpE%<d|0*0@5St`x$yAkooYe@y8IuznLy(60rg?aHytg}yFM4$srhFOvN5oDRHWe+A
zQ>b<o@1wyqytL5{WDtw5O%#kh3igqoTykJ6=Xnp(X2yxxrm#uL9S2(?qccRB)FNA8
z&|aEghV&E%0TfR}=C^b_a*%*QZ%`U5HQ=xz900fzm<S?^Mwm9j2BK9U-V71KQ8Wy3
zbHUiZ97Zn6NSBcf&eX|3gvN&b=|u~B5rbc_;7kB6ya1(tqSHMl=OzM4Iu0jro@Zp1
zjm2=i5HYeagN(Ipb}sf1q?CG|dmdRy%L`5ujLnEV1f5<7_+mIuuc8!Hb+{LSj+;g!
z^!Ou_Uu&V_%nWI^3p}8x1__c0+Y#yR<c%%ZNN7eh4@(oIe(re7Q{&VuFD)lfRI{9O
z;xRaf0xn{RPF@uF7$yyXUTN8Usmtms_y*lDaZCV;okx!Y6mBsJkmKrGG7&TsUxzM{
z99$$xI#YLX+Wu6Pj2)2gy7JC5-XK64CzEJu4zfeLU(Um62z0hud?KTT+a^Vh0LO4e
z!daniI2R&3oAv=qpc6gfCtQA<4(Es#EQ=X?8X7%BsZJ+MJkbDH9+|b6E_hsh09Y8~
zv?PNFFFULcCgNIveB2fCC4=|4kzIo}3EbivwP`X-xQB37A!R(lSmks*QE|!zn_{jV
zaf<~|>MiD8TjmC=vX{HP<$S>b9HCVv?Mu;DpK}xVj**w(jFPe8mbs2GSM)#v!iR%s
zc4z#Fu46W+k-ID!1CN=EIqw-_*PcT(xctf5IB7WJY$Rh9q^`+{m*k6~n&#0Sk<?yt
z3NW^gBZ44bP0}$qc+A_E91#a_CF8x|bpIv4sA92E!pW#KFDN%js3fxiR$Gb!Y5G@R
zsTwa#23=8f?BW2s2c4ge_PWi(x6PkAt1laIDBO;8VRI9%v9y0p6JDaP0v}lsrVxI0
zFp40cbdIDpwlbd(!7xeEG^Ul~b)<>0ZMWMqc8T(<sJFHfd@}Ow)hB)E%NcZufgBnE
zeZ^9B2hk-{c6MW9^fBE71I@96%rRY2eRVE2yCs)JRPVOBiyc$v_%nq4i>*%Y-Eqpz
zD2qUKNNP+Rb{5ttc25}E@J8so-9xl7j0N!$BDqPX@5x0FiJ-$dEMRXMPdJ*w<usX3
zf)QTm=vHcAgXjgD(<DZ%ADV}q*G*z4R$9ZW56+&3AB83k3n)3qHqST=Fy2Fp&w%s<
zl(a`e3kcWNo07LwIILSZ@oKGIeOSwI=x{v(d?c?V3{PkRm$`<KBgMYblsyUm>QiOw
z*zslEP6`eANL-Kfmik-5RvU%4LTK^Hs`=)$jOZ?a&L!I}vzQwy^P`*B?kiKzNGAB&
zl9Z=1ApD{O!tVlCCH|puk~%}cZDaP6Qh{pky9yXRZN)tZ;Ca7~SMC)$i==vH*9^$k
za3>H%(Z%0c<27}k)jY;oD`l!c{-a1CLw6|ljd-p=;71(51|v}&pSI+Z!bUpBr)PC#
zr2&=TM&pKQ3y<PUJ!{p|7FU*|T&ufmR?0Kel}DjIitI3}w_*=IXG9_4>f;*GtAv+L
ztfW_@jZCPL)laLjf5y~@FnjVuw1GuJcy>2J_jL?f6HLftT5%)M2Xc&sfZ~bE#f0Gk
zuxdt$5RV<lO&hJx<Kzgt8wsTFdt&d3H#c;bsHoBnLSmE+Mi?6Pt`ae}ei7UwD9@Uk
zQ;ZTQ0`Y>zy77#U%A;u3do=BBFmtMujoUZTH$dBn;0Hi_i85^^wWkq~`?C#l=jO_q
zeBDYkhUg_@lf>gxnF`}vpz4_=M6`oz6}!rnG>y%T=PaZ)FJVP;huqn084Kq{p2Frb
zS2&oo+<ZzGc?!!`+2fkk8YzAFd}ut#ka%Cz*oNeaJiKEMVpaFB1*Swhm7|w;zjxwU
z<U(~w@2A){vbY?#Bdzv^F>cxQUe@o{H%!*k#{tf0gq#8kb`Q0=kLdsbJ0C{lYR_>;
za=cmV=w?eV?(bR_#D1`ccSW%sJPhJGi^WTP&U6yZ=`_5f8PvCH`PYZZ_!9qv*9EQL
ztAcufI`-YZQ!H;(K<o-wXKV`ox_YYV-d$m*F@2~TOe5rW&HyJ|$lk7N8hWEEMwx?A
zD|5&XGVdphD2|mF&TblAq6lm1Ya$nILp)X~$5(Ln;=Q6Od{MH3OMFdg+L*Pu{~zWN
zz)>pF*{6g-S+w;Z7wqJh^WpnFjtB@PvJo4W>~|dGea{Hj$sd!FYHWIL4^FA+$447E
zUSaa;w0ZKnyLWup3BK7RCrp2{zKX^jxKQ6mm=AAJsDfgY>BJY1;wkF;k*iyWZ?JlN
zRZ$<<MMqw%S0|1Lh_lI6fybvwwk3fEC^CfO^ztWRTDLshSrZ_hp8J~~g9$!0p#(n#
zDWi`cM-RfeQKH)LHYcA42sU0wR>z|7BMg_kPknr!U;)Jyf%c+!Nvk!!q^<98q_rR)
zV4!fI9*|N_eH>myOfA@uHsW6vJi>P8NW(q~u7JSBzy0towS!v+Ixex!Tp~t|eEVft
z>8y8p!J_)sAzJUd;OVAs{+*6RnVpRQS$WV;D|M;p9Di#TWZK+$x_OUQN2b+BPdAr0
zyuST-^|r5U+cYS@^_83H+h(dd2KTne;t3mt4Gu#Ip;5=iJ)<)Rqga~)dT8AtDi1Kf
zF-eLZ4Cev*Hlf~^zXOw|{!C7Z8mag*zDrqWA&Op;dx&vu%H4{voic1@F*sv1)3HBE
zv=-zURvOk;u(XV8P-qG%@J}PO4UnP;_xxDukL#V2=IQr`?W0!rplt$n4W>~6vWGVO
z07lfbQg)d%1{wClBu&#|uiMDM|MX1TBJRSc;L@`AT^nvgOdQ&F#6Q@f2VFiznBm?K
zGrXo=L;J^jFd}Uz%|}ciU%oW<45N%z)@_LZ{LCtw(0h5W-IgUvd?)6lFq)Cq-f64T
zq8XaNW}GiQ69CDXrbaWvcu4e46|fvsyMW%!leUW}2QOx;HM8wCUWC)j>z}uNZM>Mw
zruE7d5Zk~BRwz>rza=^SPR+L*%<PKbI~w&17qzb*I!Q;d&7;T|0v1O}#7_aC=^6AC
z-M!0rR~ylg5u4M{QsB{cSs8S+>52enh%-Bm0+(d`IE14^6&XI_ARd>6aa;`Yeq=#@
znE<OdPH=+))A&5UyhVJ((x`BX{1%bLjPbqo&=vn7nqB~!8o_!Ay6mS0&BBd0yPdfr
z8hDEsQeNlmffp_+<EGrIZkMd8u)fZ6uEeI^b5I;lZskESrp)d!Bkn8;5K}8)=p3kv
zXjH(?zslh*@9#H9!k+#VUzAUgP;QozF9VG`DTnLJ$7iG?uneUTH&)MwVAPKxF}9h+
zkWppm3jIhk56#(d!$k^=-sMhh$&9$MPey1c>sh?X+#tPJ`sZH*Oh8cK9apJ;QNdED
z8l*6DLF<)jE^6K==)hj_&||hCy`Z%LMkh*rC{87!ff~zPQ<>%#k}~<m_=soQ$dfT{
zOL)&qG*GO_yY**ndt+ncSKA&E4aT5chzGPqSJO>zL=iWLH37vA!ufEfga`I%qN<t!
zXtf$t!|iRiMjp++h82ZfL^8iJHv%o&F~Yvi9ng@st?4wGTEym%p>RCRee&!JImd_|
z(QO86S*7(nMHPVBvxVwbqp?@5YYGo%-8F0F&<}>&)N#_d4yX`J&GIEjNlDC2?sDxx
zx`u|vxYgHdLH_;(qWWK*0PX+rPd@)QlRlp@{omsJe_wBJ?L2v$&HuOaWc#oDfB%fn
zqXkL6pZ=A@?ynqnf90_ID~H`*Iqd$*VfSe{?CdijRFhdUj(h&&9-Bb<4>hW&_wXW4
z{0An!y8Do=I<LcQ@3XCMzuoz|@$@le*0U+XC=fAb8MjHp;!EJHGSBYPM>k<S^Pd9U
zJx=^b$R$iO#d@fd&$Kt|10|fPI-P`%;&C*~ca5Pi{HKH7cvdjRg4w`RbW^~aEdOR6
zCj}43{<C2Wmus5of0$&4Wb(DI+V?C)G@t1U4W0@Lr%CU95oFxvmt}%OK8sqg39pXP
zq3VkKAt)SFGOif=KHSo(D5fIE{G#JN<BWE%hRH=Z3}DweR+A=HHkq`ADYN|{<+eEU
zFI|fEW-@1`;$$S=H~cohKoV$Hp3+?_DWKT-f?eArH5A{AFor2Qj<A~^C2vAeH-*e*
zuP@Y0PN0Ca#Fk25NN1<rzf+p7)9y)<w#Nhfb`)Lew{T4J-d*+)z@RL8SxK?cav_P4
zm>Jf@q;%Mtk#Wm&j-yRaF1Ze;ev@{N$$yr0G{oEJ)!kxS84?R~#DGbHkk)KvW>F~L
zSE>{u?$l?>_BIie9QYUQE~Bxr(9tewV@p*{D@D~$5;6}}L)1Md>6B`cGHq!yAy6ZC
zI)o#mS_U*ibQzG!@r?67s6{yYw>6H)-WkZI7rVicG?rpAyi{5fAuA=wOL3#}>^1<t
z5ztzwY2-8-1W4?ZN}BmOO$7(q#zj0Eg=kB;#||rG)X7AiHE&<zajY@0wL#3ihNh`q
zv@?7bG{<5+3u|nkC8md%&eA}DDZJ1HTvkqK9C5~aF0HA*S$TAJj%5AmY{A7<&{j0Y
zSQ`Xfq8snjH(7^6E`DfYtAN7D_BgX{Jnl!g&m>2LR$$CQ#@bLu>Y(|JTjelZRs##e
zjXI$f>A)9-m1@n%%$PvMq4v>r$!#?cw*yK&C#pbT3*Mj{juVeS^XRd9lSr0EGy7a4
z0*yMLxVrw`*ihKOojpy&OyXJa#`#4jliU(*GyuYDCW3qBppb8~?#DB#X)Q76rHQqY
zsTud5+41VBxWHr8$8!lgf}&3Z&Amgi`eyd$G64){I0M{CxTovhln708-_E}3<&Flq
z(vhzs9eEBzjozW`qJsw1+EeD#PSF&YtiU7nV&u@oX@m|9WSvgOI<4C)iqn#^IV-t|
zP`nRr@#0S0x;S@<bazIXE^Fo>+IjQABFCsGWan!^se~V-967oul;4uqi{i{GvUbGV
z-|0T(Db%zR6oEJJ=svUSlWJBnjz>cKns&JGc5M1@aVq&_<+r%CleT^{_=|(%V(Zq^
z4V!1slIK%?tDga{1mt_`P`H`{;6K9t2(D<nf-$z8>4h(F7}l5_26AoTCPz#1knx_n
zZ<|q8$*ZDHhoesHdpPaaQ8->JJc8&FhbwZ)G>HMJGa^38FjK&-g8>F<bmRc$BhCey
zOx4VQ0%+60z|E^m2e`Ju_R_F+Z^Aov%E2HEo{w;XJ#)^*jbNW(&v}I7LEtdz7CHl|
zZ*EBhv+l2EA<XL>F}>6Lp@pOGygonM2ewsPn9MI4>HLD*IGJBO>dY^)VArzaq`_WO
z&W7ZWCOBx0R4#5+W)DM=WF#Xzr5~nM(}V;@LHCI%Pa*Er72DU14_6Kx);VD2czQV`
zg8#ytFmf!(wMN<k>rKHP-asdM*Fopx_=NWGDX_W6Z@zE+gxf6F7Tyq3Z?*;^GXP>T
zoiRu{s9e=)z={KYg!ZN(`QJ-2PCAGT*1GE(k>4F$KTdr}ZUk@n(kExW@RIX=Lc>*F
zx*M{{%e19r6(#!=lA*#gs+d-=KKsq<<dXLd^y&lr1M_QgN^IAQgZxpYgt2MC0BBAF
z0O=v)%(4c;ARXdjT@mpHrCEh_G1nY@c~l@9lw9H9ATu<u7W#~!_dB43aboS9D85xR
znOU)$`Dk!)BUq%42`y9PD(AFFJQ<kGe!>T34*WVC&mMIM1m7gQ3}?QZ4K(=X_^5q$
zeCnP%77^U9CCvvb;sqrbSOn1ka+TKUM4|+QOq9nxpa7bk?@^MHr8#8(Ejo$prlY_^
zU`c=MV=u8fU`Vu9BQ)g5gBaFz4aUNm@zxAM31pk0SPsI}oSbLDadoSP*zLFq6RjTA
zY8D1~S|lC<xh~~8WA7J~yjqG24O=nBOPI<P$QigzFkBe=WsHe|bFIx&N%mBB#p1OO
zlnLBO$Yboc4mrRAMjFdC7V&*lWenartJyovnLb;*5m_1DHPFifwFPj56u)AZDn8fO
zL|0DX!b4Px8(3fji&sGW>-nL`L_sf}_U0oEBE}x!H!g9*1R8o;alMVAHe0u%N>!=F
z$@$B}cIS0n!Wo%~q<Bfe9R+t^iq~dZ$4M2n_ybB%xi-#OqXhY5t2^P6Odqhd3mQai
zI<!M)TN@+d$j04nnw^GWAjAWow{=mA7eFfn6%K?-_ejNCvx-Ys8xAe(GomrXDtW0I
zp3Y6-ffs-djtO0BQ`kdFKEQ4+k%X`$B?qv;{Nn1e>J*G4b9Mb+B?arj|3xssAMyD9
zzd*6$zvLIn-%<Ype*i~c;Ts~x;R`X!6H*-gUkaE92NwR%MWS#7Ux=uIzqrToIY0sa
z@E*Vx#I+Z`_EEqyP39@LXQ?uH=a7-u2;HAt>oPK2g*l{3umc)7yNVn-k?%UhixJ}j
znz;{2thmh;d8_3s@$+1*9j-;EIbVq$=juG>Is~PHO8gwRmIY6~ktf`UP=5u@$dSuc
ze99Gv7<>gqBgG@9I9<8AUvpjbjZH2%lXFG4RK*lke2{uE&*UsIQHU}nSX!p<JoZP^
zwT~t5B!+!SOm5J?QF?K_4oxMBd;qgI&k!fqgVWYg6WN+K$3Ix+M%p<0=>$~=Kc2Kt
zTkG}U#C$tDgPJGwFZ23Vrb;qBMab?CVll-e3LF2e0v9D*GL<_2m16bAwiu#Rc!doy
zu9-YGDNB5P)Bf*c{R?UGGJ<08k2Yr7ayB}yq@2@ClUww^e3Q{FH5%RK$0+CE{%vCP
z;5z@!4fazSedHW+v<c$WOSEIj{wWO@%`g`j^Zh(AB$2ThQpyM~Y%<g~PVB~d=(h?Q
zBi2(3=Ejacbjudr2P)9u_?Fro8%UQod|#NSypE~6j*mabuqV>;<nuSpv2iMO{`)7u
zWHuc}V*m>M{fvi(cDJ*&vj@i9u(`$>1+8%u_)4AsE<S|!YB;)u%Nre`=x@H^ECBA+
zIBW+X0%*s<-xc-+lME~34{G|-YkH?_*sC`TB}tH3sq42gXn)$kwbkx4v0Y4)<&a;!
z3jjCi!wB&7?Xw=qOVj*iS@U-6_c@9{hs>s*yHym&RqFU}$tCj#kViklw(;N3-}Z<u
z@{x0smv4=dR*R10bTUt`Ds}p^!rjH~BZ0rln1|f>@K0%+hI}hSzx{K@ek+6j6Pl05
zXg>k%^B3*lN%@If9WcoR!IDfC-wUfl0^1vYw)QS~fEV5fGjKH|E;nmgzx<}&F6luw
zpZ&fZ>8;*tQK!REat%n3|7vGX|E$g!hQmJ%hC?EQhN}=k_t^7&Bn$cPf;)Qk7K!X0
zI&}Af8*SxA<u)5Gy>(V@5%BQ{8pJ;(1HI2_OzAYH`E~!4p-m$k8T|W42j-l)+>u+r
z3>7wCv>*9&d57!1$g-f>G(_)r{C8y(PkU|!@`WIqI*`q_e81*+{;50v$E&tiH1Rlv
zSzSaxu$Zq)$>x>E>NGyewqCSf@7FwPexYUjvz$X)u}#9K>4Hm6lzR8v15n98!v0u9
z!bv|XcR?aCTtxi4s9{k*7Pnl;u5o}rbc)dS>BmYkj#c}ZkK+XSZTkCphfhuF@a>P!
zI(*a`L+kkG^9~+c)UliIpLOWG71Qk2x$o$Unueo^Yl?pso%(xj^$&!rKe)KM{JNKO
zs%nXq+DESN;tsmtFUx6)Pw9lNg%8WGh5I&2)XK$O+M_*_eNuM2e`+`I=e^epKKR_7
z43S#&e}A4XT+HyH05dF-i{v}v7TS1-_Ti*<uqh5}kd|&Vi&#GtAl5&-e+RjI$Rn3O
zyLUnPAAFQwM8z)ePJ7z4|I5NzLHwuo#P`4l?;iLw`VrpbgU6dR3Pob~J9HE_Shj@y
zVR~3VYL|CZKz4q}qNxHL^*N>!UFY!O^`F(3hpcj#>a)&9G2-=~(oYWq7DM~=cLC%3
zDK`|1RGZhYpScHxiUXj}2^-=$KCH%b+^c2Xq29hM=aKH!_DCBa`MdrzHLp~FbN7F)
zmT3jwo3;Gh?K6e?VPy*SUX246If}7){<1_ze($EkTWLC6rhdOq(-&sg7uj)_3Klcn
z+*eF%W^<99&Y#rd2bUlJa8G{xKES-9a#yZFz%niZ&81dt8jS+3Jgb1u);g(~t{gQ}
z>496h$<dz(3|5O>d3v!wK4N7AukObP-m`sjEj69cug~5SnH^lYb_a#r=F07nR^VzC
zt-$L0Sxhdje4C3uzKUp@0L|i`RfHQWw|gB9v0eQ0S=)s@91e$k`rylgwiPF>+_ai?
zT={k#e;md*60wi4-&aAWt8WjwsjpVOsaI`RkGOxrKc68HS^;4D{P**>@1c+a4D$JU
zg58*k5n)<zE&OrI25Nou$BgG1$ZZxhj5p=TyD2|Y<GkMhw^Zupt9G$fzCBCqr3#t-
zG#W-dGMB=?Idot>ZW!e1Ky%MdZo*0b0y?3;C9CV(dO7CBtMtH%D_3u|u=Q28495Sd
z)bZa{R<*R{9EFGxBhldky<a-5v${1KMZ12@phjLBt{X-mIjXq%^#G<ib@S}a&|s8(
zxJQ(31^vs&K;Ln^A;anY)}dom%KgCxqrWB4yT|mjMLZPx?bFtzplME)g_eW(_p>cE
zH-|`0zkRl*CpzTGXCCv!4tnz0N6l2tszl8vo>@`gxOeV?yZk=*rhkFK=iy$YzY8$t
zLdX<09nNQP_2a+!L1S7?c;Rr84*E2hll!#JB+GjRjPW)S=V^A}Jwf+5$-t-`h>5u-
z<Dw$!iy5YhHU?ol#5`G?Ow0y7vCXh2GJ7DR+nA)cy)c-E`~x*UrGrT(bgkjP1~gmF
zJ@TouhvV71O5kY1zq#G`Db1xJ899X4`JM3zz7H3d+#dhU&-{~`lw6l#GQfuIug@{y
z^lCoqCpUQX<lE9g7wzL!y23~p3?2QJKZ}mVL(ypwhok#p77P(pspG#(Imr89Me<(*
zDg*!ICXx{!70$(R8e3`K-$p&WlA_*%-mLfTXX#U79sur)J=>Q*bDo&T7Iq{2`#JXa
zB;TAR+&-Z_^q$0=rj@#W`_s+~CBsERS-#{u%8+CCJQvg~vH$w*bN7G*0l+?)7FduM
z8_<zuh9_+;=n&s7)c0c0Wn@tYN#Wg-+oDQU+>^;5e|zLJ=*zO*`l;JsHiH#{f0iMy
zC8SXypk~Ru2LufLS#IQiFVC9^jeGJZ4O}vdBDG6ja(#R%txLfk5;@*+&$(sGu*SU>
z)3o}hb&y~={5Q8Bi*|li&2g_2(2p+Wmnd(7Kl$DBnYKSCkVe)U|CV*LaBeH1s`&*L
zz97Rr`I_%cU6}vytmb2<L+3{xUwyVNCr*!(f5sdq-Xtggq*=}{Fc&-aM_+P>OM5D1
z#{3uwt91ztQjhSr9H8Yl&nms#gfm3d^rw*7`~!4Yna8K}DPR5>#Gk}(f#c3!7M%C{
z0&uFvM$>3z<Fn;-PvIpZJxJ7>(jN02`r&dG^}moap*-g(0p%~I-;8Te_Tnv^rL>{+
z)(-qH?;<Vp<iELna(}rBQV2*OAn5qpXKIv#q14US&(LgtKAONK2>-62KD!So!ohMY
zb^iMYq+;7e!c*RHut(@`LF?S6>BQL)RAZshAg6-EQ;dI?(+1L6AqKghIOi%F4inTm
z!k_##lb6YrW3GG3<S-r(1-Eg+EMnLX3Q%*E+)yU_Sc8VSaRNgQ<idTd8wo#4@NQ7l
z$H7UiqTYK6N;aL3$DDS7%1X@9!+E%&t>|AG7B+`pI<K2SIK;Hon15dQ77T(pz$_GQ
z1QZE+Nl}RUb!`j=n@l*SFNU-n%qXz}zf`$jbR7cSkN@WRZBI@i-TU{g6FkR49UEJ?
z-LL>Ku-t9uD*Wg5EW#Eb8u?4vRxjV+tI5WhjOD+JZvW*|TEJ+=sQJNv?<<#ENsI{~
zpHRF3$KmO|ff%+62^A<RhMxLu5wg5rqy+MP<i888tXFRoW8EViR}eG8@t?iV4J3ya
zc_jLBKcUC{@atuikWUQ%UBy@%N-hTrh9_?wpEmc~=N$>Ph$xAJQ#--zsCh@r0F6&!
zUP!Q*uVv&;>7Y!_g+e7$isELNUrykRrv>|BrP(`;U)-s&VD8bqfql<;X+Qq_^r<t?
zCx2+3Y%U{T79P~q+oV&<e?L=;eUdK8mxV^%tGAg(;k3td=dY&SuNSwwTEoKL_`gjT
z->kH07V6t4gESfrDEnyLelL-Gx&imHtrxS=141nHX9aPwSdHa7S%_rLqTbb5;+UqB
zC?q!P<Y4dk{OF7j4286gY>;e?)Wy$J4oHe0j5&`%5-;v%6jqX|yvE@iCYSJko4|nL
zUv31il?K$1uAw#GK%);#4P{en`L#LQI0iJuV5b}{w@!g$#~h#zMq-Gx!61yMb(4Tf
z=}An^6pb*w7*C%<3*uIDm9_)9Naf3-!;~R47Og~~e0VU5rsz5$Usll&+^-K<?(;E4
zGt~vwnEs9~o9ORcq;Aanjxqi&uN11z76>tJeXS0y?zdi^zshc#h!VKb?x6$-&>1ZI
zjN-S-#-Sj~lMu6NVa&j2oMso?T@n$q%9k=N)_tH=$PnJr@w;8^R`&$=987Z+BzP<C
zGPf)E%G{$-<A!s)nj6mQO_Q1M?TT^PRv&NJr?G|wZpFEA7C9VH-Gz(^mAITH^GUX+
zul+^+W4&k(^mmmbTnMJ({Ro_MjBujA_b>uobs56md))86_hszJr*3kL6G(v6Z>v}l
z-=lrHDxh`xyF|Emf2ho7iFRPVf9_6LL3`_IXcsxctiEZ;``~t|_rX2J%8_(#-AFpw
zjdK4r1VWX}Y<qJ|J@hu5j>`<C@_bufBDX*s2K_wyXLKY9<0^GOyZq<Z2M&|r%^X88
z(ck<`e7wAp5nm6s4E*z_4H>g!3@;N3@rhp+vM5=D@L?}qh=MsQJttOQprJ9VnziA+
zC;yKYgJ^7Asq43u>|d6_>Why{vz`U#vv>%5*yP7qocc_&mA$1)0*JQBG`>bkmD1o*
zmLroEj7ctz)E-l6Zy0enh&Y)X&`*~Vec$BBGFeq6XR4b%BasBGxTu`^jZ(yo6TD#4
zuIaxj(VAzYV0|{4)G3yK7k=AsAL>Zn2mN$b<7{|`$xSc>USO!Bf+2D)GT!pZG@vAG
z7xATyV9z7EiBk&t&nBI~p;T*>RVV?-M1yE*M`}u(hBsC0pL(owl077Kr@{Ity{t(P
zX?~35(z_Ifb%>?kgcFW49ULCN>Jp(`r>~r{2frO1pSAZ|{QYh7^axE<CFi@_Qx96H
zY&6#Yy~6Jf+J~)ReK3)dSmt6r`1$GMU-=0RWE$R328i9D%Fy~MI6Um0Hs98485n7I
zmUPouA7gp%%B(lw@gN>XKX1b5cZ0QGHrJl>-j{}UgU#E)fO6#ZhQMb_lzgGrfkTrX
zztaZczl$V=ja#$n=CSBt0-gGU_*)=fp2122?NIf{RIh{;odERn<zSL&5}(S{b#b^S
zKq<39bug({9;E1<aw*Mx45A_I9a|Iulfd-M1Kp#rA+Lekon1fo%A%o37uUc(p2U6F
zy6`Vd?=qUfmugMMhaY%^jU|JAcvt;uc1^gTmhTXF;gNlsKRjQ}M)leC#_YNams?!`
zg>OD2<4Au)A45#q+(ixab>wsdlf*TjO$XE(?4UYYhbII4S_3%sg9jJEgP(#2ub(}5
z^Xx%qqf&=1-GPn;tWe=0H0RcD;P1+V%^jd$@dVX)q;O7qkG3{9H=Sm1&1AHk?Jyd4
zvkQnH18Erc+K+3Jq>(Ea4&GT)Y!?^dOS7}#*TP2kxY5)7m%*c;d3+G4LrL!{9`=j+
zC~r)sGzw9ljZ_G1?zPU^v$Z#CH6A-<)d76<hKl&j7jNDEvj@H4K^oA%znJSvJ_Kjo
zaCI{nOgJ*A_kN~R`K!D4`4p1vBeY+0&d`_Mv8)Ay-Y`icE|gs}LV4Y2jOOnEU;bUq
zU_$9UpyL<t7(OyWNBM+@aBGwyg|ZFs<QpLgG1B=2lhkZ@`QU8Q#;cGr5g8kQOpvEp
z4f=AE0dBzSA*EDeX-QTO)MQicD5!wQT2nnio!&G|uk1b1wO2{WEio9)IA5A<mFuue
zR-U1Yy#X9Q;~ns(`D6F6b@Zz&1e67;VLGdZa5X|h0{d%o?w}rq(x*d*Af-}uXj@B$
zuq^#*XqMIkGmq9=isTZ#tm0eLjq=@TQayMp(F-Tx1=1ohUapk&<OUP%uyl#;SRft{
zmPi(8>P*gk99#jdG~|TzSn{o(%$7xi<}T+tPU2fm$AftnP0G9prah%}R)gR=j&2NX
zvJrH$)h`ptQ}I5QjFsZx5svS03NSXxB*<BIB1*XB&wUVul){3Vqso+G(IF}d=!gRt
z>ua9(3iJe)81z5sqBeWVPz2_@@`8Vbmv^n;at?m~J*fIUef3pfu8|0J#vh_u&7d5;
zcnOL03$F6c+5YkQSr^HbqvPP2hpW6#(M=y5cbg|Ct)u<lkGp%Pt>zj0eS3O*bof&}
z*nIl<v4e=P^WC7aRr7{49Bwlwk-ORyMLJCo7Yhy5sVw=#Q`wrfe3`(WiKf$nDwSuv
zNgJ}UgKDL|^>s<j@=?((Or*f)8doi-)VEhDiFiaB$6dHm<9PdQ6_kX3o|RrBa*Om0
z#yO=0qjPwE)c%okuL3^t(wo9*qV!<&&pahS;qlVrQbM75b>tl6Xs^H_zA*39E}j#u
zSTp2RZ5@dg_}G#UcLPh)@MGS7+}*PI4dEKF^BbkY@Qm`)v#sKr8j(-heiJQFPzQoE
z3*K8uPax$YK2nInqT6`J$dbsIX*8A;u3dbCJP;ruQiTi<_3^{H`q$FfhvAHJ%28@f
zHye=2_K0WJBsZrU_2N$N&`C%s9x>rETq=$pXn@0`RIyR&WTu99c=L=YQ(&NjOeNE&
ze^)0Lvrtq|Q>1fkbrh{lN1}RCgp7?LF5W{(5GDrb_Jr7!4DWl#KeSGpuUg%+R_BaX
zfQFz2pMUZ1Ncz!>Zte{wfB#s{$p^22fRJ3*=#Z6V!3#Nh<>Zy_3DH2nYlZGN01neT
zo&8SGzZ-{eiZm~8FpMvzA@IeVQI@heg_;}5EL@mslK84VqHJZ!uuqL@l3z+5jX^Ey
znARud8;>E}k9)Hp!ZGac@L(G8P7c;l^nkWt^?-jvFSRdtd+)dR&X5y6@3i)-T24;n
zhXFMKg=xc^4i2I3{fN(fGW}zH;5<&FA*PFkqYppUYo<dIJwSh*e)>Iy8o;fb>yB@6
zehPryvQ&BI&9;t*F7>VYaQpef;qmyk@W$__h@GqOw}xHl*thfVww>z(>H_yO+}4{h
z*z^$9C>r%flPZlFx5RcGdLx`}5e#W*5k*8}pb{|Ct<ukQ76&FpFRKlQN%DR^k*$dj
zNb*9dZ-=4HUzlqYvy@%LW7wf2ccSdo;WSQ}PM5T&xXUt20_}XhWm&im0yEfjICvj!
z4$RCRJ*ETnId-X8PQ2ZqBf7Gb)}i<b;Rm3W;iw=ErKF(fI7TNKaU_;E+$F|FIgJK;
zsN60%Spe40He}e4{`u9l1JHcd<HXOWfU<)11dj`^%zCoT-?zP8pFhy1?_{g-Vltc7
zlWqFTqn^XCpFZxIp(6&bW`^QR0%auJd9LqQ(HNUJ5XQBdaG%~e=4Z8n0l>%?4PZe(
z)%h3+RZKJu48l6%3frl9RMICNwAK67(x2A1Zj;uy_qlh9vq!4<eZA)G73bNuWxwF8
zJBJYWNHm5E9}gRx#^aa&(QO^=9q+e~P_}ypT$7ctZ7(isnJEW`vI()g?8E2AoMWF)
zG`7<@Yo4|Dx~DBR?Vz|RA<Y<hZtM_<-TeqDlRo1jprVAE=Wf@5Y)_B`2m#Hemf{0)
z@rJU~Vu&MyD{6%2nJkc`uG$PzC1W_{F`(#9Lbg0)stqF@g(SG4{ItE<K|Jo`D3a-W
zP9lj3rDt(Z8*=E7n`mgIdJ6Yx#8x?Ys};bY7SPJ(=ACRgcOt@cc{|&M?daVKI|AO{
z3z6Jw8Xl6q|LFbdI%wHmw41XhoR8YV18#7db4Z+H0f)IY_JCD$Wv!o#|FE(n&`p*c
zD5py!2HDyE)tA{rH;z0WexdNfW6XE9>%<1?K%TEMkt~wKhOqTARRc>rPJmeMRV(M?
z_v7SdEF^ZIlT>xbN1vhGqKx(PDKb{WJ39Il2nC0Q$1b{^0P(dE?Bj1_+we7+sa?%4
zNeL!4BPgOv#>7JrPjNBty$6b(4Y#N@ZYr%?6XYQ>i^Mo!L(|AGebcoRe*Oda2lx$y
zVRRkin=~1bHCU>#ozS*<k{K(Jh|}acPAT;=ObTX5B&Lj1lbs`f2gA6P$K-?Ij})6i
z2{N>OIS;2HaIDP6N}^Frq>VB{ngWdpxKC)j2!te29`Hld8V7?ADI<8>1DZ4qUN<|h
z&zdg}TP(aiZtiyvntPZ{-X&IB)K-(zb5~L7gRFisjow6~deBeiNG;=JPmv2WVnEpM
z=3(&NZh2<~C+$mw(;Ed7$qBIkURAm++mup$%inge)uSnJlUcr#sd?rm;R|bo836!f
ze;{5GLD-*<Mt3Zz1@3`hgK#;+HW=vx7CqtDRBK<~YNB2rOV!<b6UIm5GO7T%HAu%E
z6n-8N3k<`WtX3E)Z>Mk(byD|QX8t8|D`Xi0ze3+UzsHCQ>l9bPI=sQn-o{EFpIar&
z!i6A_(0r!y0X)SQ5sx6b!-VcJNsmxG&jVK~gn9T{$(p~8!pUFj?yX@)f>JLS(Pvxt
zPQ(ZbaW38l0QrsJdp*vs$VV4mbufsS{51uhvvBo<W61*fU$c51y;je*T(Ei`L!7H{
z-<8O(o-PE%dm(8WgQW^Uj-H{`?0q~Tm7yv&QQg+>$E@^Z&q#}wYu=K4_}{lCi(5Y;
zpxJ#Jq(F%Q%)TP=2rKFop8o<gyMNJmfite#D-)<)?~J(@sjx%-G3#I4XGK3{N$<C&
z_gmEapR~n@vIM!7FI|otTXpSJKRFM(Y}J?I<_fCls%O@)7BpT2`Wjy$uT+D(5E$YN
zw!8{ER8D44vZg9Y`J)%#=Uh`Ob6tA({d3lI!Es!E9ywTOnmJ=Fe)_-gsI4-Z`_Q6)
z!ch~0TE5XXoa2S3%R~oYt*`JD{^61`XITHQll2Fd@RLs#t2q(u4$DY14a*VI5gG>J
zJE19!_ZMsvk_>*}YdZBQ8m#fZ@KAm-u3S**bK^>qixAT<CSiW#_Gas+r_p41_rGwN
z{&~3bla~o*L)2|nQiCA{=HrM(w0X6^8Uz^4zO@C|2->r?)T(>cO%BbrrXl+wR9_yR
z9G}$K<u)PtVmJvfzWoGhQR5gdg_=gu8;8Y70}KK|ju@myj#E?gA|i2HmdAY0vn$+M
zMIr(L*S}<I6-f!4wpW)FEXDx7Ekr#xsL!{x_Bb{du>a7gv%%`P*cj(p-T-$Bs2q(^
zwl=mmb~YYAd%E-Wx3VuJz}FEvC-BJ7m@;#H+cN(fDX{+m*S9V;hHz6^!^JS{y~ooh
z2H3FZDXn<W-cMB$fi`Mih(CWgmim0O$Hof#GJ(;u=M8Ht(NTz0I_QaxSu6T1OYC!6
z2vQ(m%jMhTB@XVe3^n{k?)}O8<xSF`58=S4cd#O(1tP@}6$~&B2I*-WsiIKw*glCr
zxJ^M4{>pPJrMTg*wf<Arn&Tm|P(##Zw8-8HN#I2+^A`&LS1i-1L?%HP(o*$BFvUxz
z_VyUSL<Cw?s*7)H8+bOqcV(2F*Uc>}sN^7g1uB6cq?{ZY4n|beq($`%UH#pHgJ5ac
z!VUA+x&G5O3~H*cW=E*gK8;X8U8P;JPP;)?!5Y+KfjX_Xn)<;5wTKxevy^HZv-+s7
z@3djxB!x8M!3(w~e0|n!AGOcg&BJb|{r8q@PK6)Rh@&<BBdYYBs}ye^p|i<h&A1n|
z2dek);l{fpwLgs~#Zj7|MQ2EX^iUL$Z%wF~DM2NpZ9zC<8V|KmSQj(%+4PQ~h`W`f
zP$?Ok_b;qjKWg`Vh^w#7#m`vo*9`)cH4(#~i%LFUu~`v#uGX>^R)`+Yr|$eS*6U(m
zfmR?`2q`+WA>$Hg(?NJcAW9Ajk0=O}apkg2Zv-7O%7_Q9mlj%@^^xPy!sKH>Lm~SR
za#*-Y_!0TBQz{>HEg<rdt<z>~_=1JETvrV7A=^7SXGaadWf3`(lNVbuU^>=%940zp
zrclkKH^jB=%=J&?y`Hk^j$a<w;8dGJRl4z34>rZ4kt;hU&>mP%siE8sdn72_p~lv&
zJsm!6r>8oGlHKQ6hVU-I;%^-9mBM=Ut-Qt5)^kQbxZvV+nZRapz;C4h!z7t(Y#8&u
zk2;-}mDR604YS+tKNG3?r%cA$<A1cS9cHgka5Rdikf5zn7+e5%gAs<teRZS3?Z}2z
zG0I$`=_nop!Nt~3WIqYJYCLm!EI8omWMj{nn0n2~kcWIr$V<pL+0X$?(0c!lY%*Cm
zi)jEG$+*EzMpe6Esj*P8<rT_*#s~s52pc$dXOr+!C<kaNj`}r+Gt3<{W)<g?emG+c
z%+9CeV1!`C_1x%TnL;d`V$3+03{0NVw6WhX`7mLzYjji~sF9021-}p=NR(mgKg46$
zH~8`-0UGPhbJrrjH|V@ct&yYA2`^bSgK}HsGA)Q#_Ly-k(n9-j>X(B3;<}B(^-q0}
zjSgY}q{WSA94uDvs_H(%4|!kgy>1`wch7!0X?0KcUp~_vS%Dvw=cPrP#|O43{8&)*
z&~5c_VXJSB_s<Vowlx2CD)gg4I3Lbz2{D(f6k10DMHI=!F=YocSz6-&Cx-~OMxPvl
z(R~gsa`;N;$9mA=lR!lf7&6bCzjPAbjM=0h6j`P4r3Oit>;m6pUa$@gtt;^g8e7&Y
zgX7xZ+Ya2ak*V(0n=!TQfb{72sP#NwkfTyGw!BwpgxwWVz1vG}x*XDRSKWomit%aa
zFD{7mQ5VI!T?Kkc1qL3Lx<v8es;$lvbOtwtOHQa7ZleP#0kb_GBq#C296av*01$qM
zx@%oSH`UYDe!IiFvD^Bgb#&G}I6nQpOK|psFZds~Ug!K}wrY33-C9^*yi&bgjTXOz
zmDq1E4MuZxn@3aB;XK9dO{kfJ?^q;;+g*u<^v#?-?OR%>9Cyg}<ejyfK^N#OUhoFb
zP4OFsMb<6WoKx~3fCa|e?uv;aOllP2Z{(zg(JVsTO+*leE_p^qzA#rhy2!|2-y!)K
z5W=*i63q9+HYfPBU*uw|8x8gr@NVHKCDU-&T8<}tm<%u~!;B^feRhuz4s=>&ftdED
z$@rPx=uA-p0~3tO<2T{h$^EX6xhT^RA)q&xqjrIBfsh;FbP6{#5(QM)3A;3#0`br$
z=)(V_WS+i>fRFFdijU}P-Qn%@gdu4|7A;xk5AZG=H*r)}M?~`$U8u1{Lji{C+U0J3
z=0Cq~VEV%@544NTWE)8)c>FUX2^xh5X2ovEW1^s+E_rX$bNK~5&wv@-4E_d$%_Jqy
z??=D{KSLDr#gZ-s`adry68CR^4R+03%ovum4AmY!T%}a-U^hUQkWTka>+H0>*X=al
zoE)|~OY3G=g;(-k)z~j3w{!*W@S`ZCAY!40;c&LCU7*Wows_~dAv4}(mp7e{_+p^v
zNGVp|(SzV!@Le&Cf_D!eS}F}2c(}XDdcXVClW1VYM<uJE1b-x2(BL0)3RpHD44A`3
z2Z?^Vp}yN}FoD{XXe_o7NN~)Aphm;SfV0=A5U!q~pQjPUuuP>GU|eyiE#gzd;Z1m#
z8g_LPnTdD?HIV<dd<Kj6XaWY)idGlV9bdlxi8Fgi6RXN(*UgfN8wAZBCf^kq5=@;O
z6-ZXpYrN3+f@vg90!jg7kIL%I$MG#aX#`LUH>HLufLU1&x-&x)qMQIxXDku+J?_C>
z6Ny~19&FWu|IDn_i{NGZRkwNiN>two1)jsLhG8IqO2-h}8`{A3vIYc5BIfY?-+VZ|
z2u@Cq&yKrqUY;L*-_<5uSy|Pu@yLZ`7f1DQ3z*^;!8Y934q`Qcg*U>lSjGVbKopj=
z7*IG)PVizP`rObuT-pxSQL2L8_A?AM6x{^xiP-d_Ux_~%B~|ve01RqtbNli7<7^l&
zrx0(UQ&J<M{d@=ae8EP-&qrUpaEhe1NDRaGL3l}_B`}E51hv%mjWDtElmkuBi*a;o
z{3?5QJ!kc@fOl{bsan|-!Wcl|k>{vkDd(!;=#3Q#rRzbwB4Mw%TM3DE7tJ^+^<)BV
z_c8v)jG1cEreUmOiMt`_c_Zk|dsot=Hbz~K$;rux4p>fyy8~$v`0L85*b^({@QcH6
zdTD~YQwlWPAJvfj&%`yIgmZXY-n3txHqTm?vZ;{|Dhl-8N701Cm6&k}?vq9E&Imx7
zgAsle>>aj|=6=)coV7gvsMT>m5x}3hI~nl7iImA7>%;b&_E{Gr7@=?Cf1bBae|mX-
zu;JDRba0OB5RjRdGYY&(W^oidGaPIGUH=?!yC+3(Xkp0$T$(NCMd7O!w^BBfj9^~8
zH;X!fySBLPN864>BzK^*RZ0)`f?2r-e5uGS7hHxYXJf0xL340pz@EKC+#ZgQ+!3j<
z-~_=2g8dP}iFi@0CT>WMM%OvHJE9p39zG{r4at1Rx$tvU9Z1T-YHM|4iFZY!3yNKr
zAo*}yJ*ovM_5qEOXiKOpX~JIo98l&82zK)Np1y~1zBN)Y%T@4k>cB2&eh(DQo9=lB
zL*#T0kIy=+O!2~|5#;K0529kF?tx7%Ihht^W*Fl)K0PS9<Op&%3<b0ng$_1?7GW0r
z4rdnV%XE^^of{<MNb#G%U0`14^c5P2h-X8*W<R=R*$vBoFgVj$`%No&uyCddx3?(e
zbR?`Oi-O6+NKujx<QBW-7Ty=+aQY4-NZ|s}OmY2br;wbKbC+1FxCp&n;}KAlgf<D`
z{d+$e#4ziH%ks?^f*$0GIf0?PiAHS%_RouIQrOzfkI#$iAJe+6)<BjlJi~oKHsK_E
z;1`xO<Y2!<;sGO*Ar#|rmoHqx1AiZdg;Zkj5OD|GKG$8qM_r=ezxe+I-lr-hfW!O1
z%@8`$$HeLh5|O@PubR$*C*grJAeg*;Lo0laMXJ4;Lv9iZad*Ec&65j>9f-;3LYowY
zx4LtunQ6Z$Tt@}gueHUmVc^=56HUNOE8Dm%a%t<?_t3m)%nz8e`8>!W+hxpzXm4jk
z4xm|>kG>FCunG+GV`%CM=$QR*7HUA}1i^Tt_N)k690>=tpokO(x2iXR)=?FqD)w+q
zzTljMFkjYk`YKJTZB`jg+(ncnEGv1<ilkJODXh>$3{?wQd}$B_BPIXJfnVc@&ksdw
zBZN-w<L*%CW~ufgrCJgr&${|hD`L@TYs#tuC}r=KaA`0=D`Qnrp?erehS*bKYD9eV
zN+-oBzu;JV<@`hIzsnr{=Pqr?hr6&5dHGz=?GYMD5JH#BkYyI$D%l-b7qdl{&kg%Z
zt1_KywA&a)4TCUTLMxn}2#q7*;zjkIIrN^mo0o^=`(5t-XBaC#?)G36yCi<$S5)lR
zpkake3(7jEU|EmcEWiwY8wdd*MrqOH-ivT9X#ayU3M2#SOidG5NPciTvo@Toj4g2b
zTQX-9*}<RZg>;@PbP8`((4-WW$I3aD>2##MFop(uExpg22(WMjvaeC|pfMoU6(`sA
zpsgD;n!Wz;`~kmZk0A-PNbqHaT8nOF7H+w*&f!=TT^jFxh5I0`QJ2N<pD$=bt_Er(
zsnLK-3OskH^L6KXkNL&Ad+R34H034+ui#0^_?08-1+x>?ZYAk<S#7M~c!c4mg~Zbf
zfpo7Sl6M=yK{7RJ3o&Xj5sd8!-N@2$D#<2HZ^|`OSkn0nDWKkP-j{R>T8exwcp{{U
zG(H%5e~DOdoQxYEqG_Vd6-xN<29&5Q(EujJ^AojZ_Nrxd1>aVjgiS)CND8+xUU(NI
zScrQ_^qP<>eWAYnW%1KR;IQdB8;i&Y#hHNg$Gy7%T?T~{HWwKJfRx8@QYFs{jcJAf
zE-}&+RQkfE5H^fXo1{`S6}zg&LPH^AQ^wg08<_SC#+ugID}`*9BT2UOjDU!sPQ_yz
zbyqXAc!2R;&By&Iicb)$@Tx~D;Y&?d6di@N+s-uk;(!LX;K&1oX#4R3Q#<R1j9`jW
z7IswE&#H*(L<KPq>u*qU%}JB_wC4gAVVCDL_D+wF$TqHh);evTwU3WF!4t-H4qo)M
zYeWX$d7Df{faCc{YCW=(x1-m46eoeJfC0V7Jq-;Do2}|;`Nu4M^*2UMXgF@E0CCuk
z8Nx2a<dO&_rYvo}8za{$J2No`XyPU;DL-~+ivg$NbaqIBA2mFZcTR?mcxDjPZXv9M
z^wH?SS=F3^|0D}{7QGrTEVAYmnE-V_ioYO+aG%+9i?Y>>D9<k9khdKi&qaF!W57kx
zjLf4j(i95hwJ}&|X^cW%g}?@@Yyel;E`-kzS)hEksB0@)^1xViR$+1d;BUnmdZ&SB
ziy8p<o0UX`7zuxoY~f3-OOlMd{$jBR!q8t$*3&Sy7x}XgH-s{ndKEzh8v-%!5zfr^
zzKPa`CT%7s9E&bv^88UU$wtnfM&V4ecbYbg2ud?bI+9wl!iq5oD=Vf^%t7p}6wq=U
zv;#K?$z|w@c!#m95igBR60`}1si&hm@UIk3C~su%l88u+b~wDD4OcB;rOiFVQYvG8
zAVCndHMaXfX41(bDqYMtdFlvIcZ~XZjpt3q)s#4XBWP=43LPBYT`*G?Md3_QsV5=W
zur&-HXcI9_05s!SOt=oX2P>WT&Rwxkjz{whg?r3yi?EMW19<Q*hSA8(lklouE+p3?
z8I_TO0?;ce*s2K5y}^IzHjI?UH4~KsVtAjE;~yL;DIEY0H{w1<<ux48va|AVtG3eN
zC?Z*<`Cl#dTu77p#rXIVcC418YcvkA7^cziEbWw?wgfXaMBb0<D7A3n5F)FR%+$mY
zi`8+9MXn=7fOYC7l)9@-Fw$kQn3k?bxQZ8%`qkM5;g~|`*=sWT$`u(;;Z4ML-OSHL
zK|dL<k<~GsQVc<gB4$S_;wkVbrZ&yxER2U|$!i#O@hyiRoReIL2iSLc$(|HL_))m9
zD%N!hh+=(^pqB%QPz@p1NAep55I8IBA?`_>QlkDH36u|2viO@Ny@XvBB|Y(-vYCeB
z_Q8G=rfxGv)YZ=^IvuKsGlZNm>0a&C;X1F?2sy;#dGx%jT7j;8m1-rj*m~(*wQ{35
zq0)kyXphG-qOmI_I*dp0?3A1``Z%V|ToWG)`9aRXkp^qlVtUQx^Niy2AM<$16m&mf
zA)zbOgG-JHdPK(;fV5GSfcICJsx2wH?2v^xnTV>2w9X+h)e*qR0ZcnZ)G?d2v+w(b
zx$o!(rbgg`v?HdA4O2%Mnl?;DUo5e|@5ZnZNq4v3I%Fq^dFqi+YRg75>9U=>&EVt<
z2;%056I4}eS*<(Q=h5$>%DdX!J8S>Y>b8D7X`i;bdq3?R5@vqus^p3?XYmjyBNn<W
zR0~vi3atHT0JJy*>v9_Q$<Dycj)%l$ct|c8EIhnx8t!<is96jLIwW!^!(JFtiEJ#b
z5pgQ|H#q<MFA<x-)_K1X92?!Z(+ezd*mstW){Fx$8`ZXNUT?2WvYPi+veeSt*LX_~
z$jf1J0kjWUX`!YqO@zd!fUFY7-^jU<@Cz<uV)-p9g9#GZh?k1-fx<LZ_G*EXLPY&_
zfpG*kf>JzkjIcMShZs35bYKGNa;6TFg!M1%9bR4(!JRA04l*g=wrQ7KdUgXM+xK50
zIdR(EYaSl@rQiAY^FG~zq+ulS`~FMefJ921L+)O0FHAP23t%B?*`c^EGh_juW~c3}
zEt}g^PRxg&B9Al+&<Fm=o_keIF*QGQ&Z8M19jUAdkBeo@3CND@-c!-FL2Y%nkGkL8
zLU$;$2{QB1;hFkH9mvGQfzVtpeN5_wECE)o^RZ!JH=l`qQp_^0^L}C4fmt<k1iVe-
zelCD@d7mG9Ap*^g8LzGj94>BHk`*yHbfDw{r$Yf4ln%l`(Ovz*0%&*Y@8R6YzbO8t
zDE_17t0l5GRJUcZ7UHEqHrb?6!UuxW*d|*;*sEOeI-ZhLQG-RJ%H>i}HTyde_DZHc
zm96cY06Apj!J<%phAu^b;zWzngNkAAPPr>hS8|p}F~p-h%xhHjre7F4rU75vghVuA
zuFVAI*=d+fm|l@0^FmU2J7N1RZ)#l^g>7Yy)LNHdIgIIxSHO%}O~BZK&-+mi4O8&;
z^Zc$fo2XoP+|(dJOD?uO)mw0lD|Jo!Q7pCwx9H`3L`vQxmEfVwoXQ$Y2ySsq-lCBM
z6%Ph<*LYF@yt8o-Sm_Iq1JH%5$**X_SywLdH}50KO`4RVVP_m}I1d-#oVjNKujxM1
zj8!WCeiUq(<Y6MKGxDC@OkKBZI7>!xuM-)bNNd$ieb?9^L4A{JN(47FMe6d`O-%P3
zDKY{_X%drRwmW5;REqOJ8MdNyKAhPEUJ7EjhS)I}IRMb?h+@#P0rUE>oZ&{?b=eL8
zeN`|k1W6$oo2qgyjK@~uf!2y%LTbAmgowf*?oyDu(_BSpDxH}fvvMe~A149j*7XRh
zMLU7kyD&?yu5E!_&yfIFa8<vW&$3x{3lsOEhI6zr8+GHfpUxZ(h$ZjH#_ox?4-hGS
z0y#=d4d@a2we*llQtW1kWbZHx%7qCM8(a0@E2&ry-X0ylZXUe?%JNHS#N!giGfI)x
z<Al?1+Xt;5+h?u)s?@Coe+%B?BeaJ<@7TxBj3b&hb8#n0Lam9c4i1{_v|k-H51oc<
zZiTmJt<yJ9#Ju&1C@A+m>=J^Kq~b(nJbC>S(aP=cjvo$Fn+Ok+(RvaRlBw9tCWv+5
z458&|fST!xOY%;`Va(x%h-N*cPtalw6=a@x;Vn|!h|K#jzqOJAzL3b_OC|2taTve^
z&pW4EZX?zT5N0JPFGGsi<=G87t<xWn*d^zzqvO`;>G5gzv~~7F^Ds*ZInb4U{Y%|h
z^{qnMP;)R#nn=HOn=<wAQ1hSHE4uqM!xh;SU~b7|`Yd<=hqRKTD=O9r5{uLW*Vpku
zzmoT~Lo;Y>u?qi=lUiW`>l&AHwJfMW$(M7!mU+I{fk>`!20jiA?Rt4;eesIOS1bMK
zz*a<zpxI}2$?9ftGvu)|&Sjl9j}I1ie#%)W|E&Jmsjz4W96Ra&E|yQ}JKtVmsusr^
z^8w3c<ha7};;zfP=++l)5d9F|*~*SAw==#phx4ni0{47x*2n@?MFM1Ql4t3BpW-Fr
z8P4U}zhL8QPM(Q_F9LnxsV?S<=u>$cl2*D7ROd`|<OD|2*v!Wx!qEg(INZac(`-MS
zv?s^|_G1xt!drnP7pP@YySV`+r;10Ts2_*ub?UK3QyW#OgH^@;|A0ssUog2RiYT8_
z4LD08`CZU&OJNJUBfJWGm^pr&$S|H$Nj9OwrL*4T#D!y&17qmqTB|YH<pfeeJ7t=C
z<SSRzDh_Ljg;lj?B^P8OrlMhZ=eWuh7YMAOo!6w=h|b4dTxaC?<D_2&$~Pmq>WJ?v
z4E?mzu_+}LKCH9S`DuRCX*3LxY#QE)@(zs$G8Zr1;;C)k9j9{Yl-ri5#hb_~W2VUX
z8OIk-&X2+Z6i<>&3%l*j(Hud|UXlU8nBO5kdy^PFYdCY%6J&@`^8{joH_-Y`4Ht3!
zH-t9mPRV0l=KyQ~KB?yE%6tpnyi1oWyCll#Nn$Bdp$-zw3zKq?sU)XMLEzYUK@5p_
zh7yUCoDh7KCksu8yPkP)j%V!lj^RdmJK*Nvpduotf2O$~IP)!Ksy{q$Iy;C|H#}Rn
zZJAL_Iq`_SH&aBsNk-e;lX1+18BgX@gkKeT5Yn)!Ia7G)Eu_0breWePs$Z2Zku9is
zy!wl<p!uxSBJmfWtvQqy_F)12Eu&^znH`g&bc)?zWIv@5u_^%hft<FH8Z)?S<ZmO|
zd7Q%wcahk(0Y#=;N0CJ>OBa86pBZH?JD3*kC-wW`xrnQsdx)5W5Fv}>il<aP?A#3W
z(d+;b4q>Q%)JH}W>pPZ&j_}<g8R0Rqja4kfJ-Aim{ADD6VsDCxE({LGAD2BP$lzBU
zrrv$E$EhbbF+KYBV^?@i4XqAa%Pud*a1CczSryTJ)|5AW?Y_e`y!bt)_Wb^X(=&em
z@oCLPLv;6MfhrZ_g3qUP1x-2I`*c2;)t6h#QOwBKB33n?VCayB7E@>`&VijU8#!T4
z6+T^%c>!$b^lsd{g7GHvl=$Rz&%*YZ2tykIE4)N$DB;C>2@H>gK~?cVMh8|CRgKan
z0ek-8j*KK&4jM?lYL0i=2s+7Nc7v+E8zegW$)!AJvP+DC@bCb#>B+mc<APz;d~(K7
zLF8x~rOMe9eSyfg|K+Pr^M_XO$O$<V@vURHd2Gs<515!P(v*4+i@h%vwqyi`2Gc&>
zaG=vj>`_te#;@NX35?h6#)b-=$=#0D%StC?6Y%0nLdNB0lwUAL^IR)oooBOQWaZM%
z?r=QoVEd4rp_psI7{vP}?4ivC+jl?9(UDFdHbDBn1sfQE?IRhqk{gU8ITk@)7*WKZ
zL)1yGNBY$bj1u=X0XEw^pu<r?_=)o)N``HksCkbKV<NwurmP${w+)}cEijDPh$})-
zO!M&cjac~MDp2%FM~bDw&MT2~v67c<c*JgnmXP!Z5uCTnt0MaV?Ovc-GvnzXqXG<e
zhk7e3ZYOkZRR}~(+k8k^ASa36s`-IdU{6_mmW&7SWmipKDMn5>nK`_TwVxJOD~o-&
z@_cITus2X$CfZwt+6d2rvD0=oBMF#2r30JY12p4Hin^pmg+<Wp-;Kjj+=HRJlmtt?
z7nzqma_03SOQvBWP-_u)3g3_SzVDv3_r5RlthSA<?*`lcjqQvUI}7%Xj}F?eDBI}k
zzn3%nyg**zyjY_^o0-=DuEG>L@m-MF97iaepUh_*wXANRvV$={wjHxd<&{;bENR7g
zT3e+Rx7U)vxRUA8=uBSln7!jSZ<<H@b+5DeNZlNqfvwiwQ46E&o}8Z*Nj?`&eD(H^
z&(9WjkO7Ia16T`8es^SrdU$%?ec3+i1Q)TmG>8@!g>LZDRe70UE9}Tgb~Qi~5I&Ze
zBvVdTQKPCo)cq8hBr|?hJ9svZA-frBAZ6Q0Hl{_d12L$rYZH;ZKG`gb_!G1nAbx;o
z37G}G$55H!G`NF4E*(2x35IW#ZpLc`UU7U)wbIe%L_f^RwF?`CBbk$YiGt#a#{ywv
zR#z*w)JeimoM+t_BWpW2WpuVNs*D1t!7PX|?!gUoX_SY_a4sQ+W|2fTGNZ#KX5@9+
z>Kq@QqXm7yz9;sgaBX~saBbt#u@fp(-@{)js>mr$wRl~>=pif-t37vjqR3M*78_i?
zsAqzceKntvb8;VL!E8=2reJLYyfM(hGi9#N1zhr8A`TEeL;)oo<&)gkMYjibhdp(}
zG@N8@^d?gbScmfNjufkQUZ0=sAHO~79vvSXHeYpWBs=dOe_vw(^JY#olvTvYOzq@x
z+mhA<y(8}=-~^6~L11s-Ix8gE%s9DZ6GZV>Hs`dGmrZ$dw5m#r6gns)qLV``KP$IU
zj1!F}vpZ{KSpYxy?*bhN?l6%yO!J4<>C5Aer##5sJ5M(Kiw8ehYbDR%rOaBXC~!K^
zlE}9>H-Q00HkP`LOZ?6Y_3eJLLDpBPLjx$SWFvoP>uFwc4E0EDlo?QY`$_;_uk61J
z9*`)1D6CtRzFsFNvc(LxaE#~)hr@V%wo$3Ss}szqw>ko-U|7qni@Z&gw~@%X=y_(A
zx<e^GQ#8b2rO|!&jt7qY*30t(y-4N3aBc=*hg8MKqI*bd_29vWdB8zh0ayT<0;Nbf
zMcK%|VuRuWwdOsF77C6R81lZg<|ia1K##OykKBx4z&MaQ{)P^|W^JDvGTU!8W7ut)
z^G&o}c8qmIK`LBN-(}W~D=bHT0rEec+3)}Wi>U^^#}Bfu!t!JJn1TRNxZ9Pidfk{y
zPCQZ>O4kf98@EjgG?7~9V+6MY7|}}uplXi#+9Ui8L-9h7i}etoKo0<R5=DLvl#rlg
zI)Ffi{R`2dsr^bd7j~|IAy}g1%p1h$6tn70W8}$lE1~DIbAD7b*`5H&6-=9O5u6yp
z)Ei@Hkp%|4MWJU4?-LPMn1aE2I<efbt^e>{=4v6u&2=QQ0M2*8%0ea{IhYl3$waiJ
zIiYk>Srcf9T;seLOl$_@d%|!-Vjn)34{<NWgSzY1t;Qa8<E@&lE{rChBeYyO{Rz<N
zVe=>Bfv17_qahIL8J`>7lX}_3Q=kc600bwE7c%o~&JpLhsWn$a$x0X>P4fjcpaUpq
zAZx+rwjdTmXq21d@Ph^O^&&U=1I-yC8T!wcDlbvsA03~y_u$fg(ARB2*K^-SHS5p;
z+1S`9QOrAVt+SPk1E_*)eA>UjeTpYKn5J<(SciWnvuQy|dJdZ(s+=Sf(t&8z>R0f#
zymbfn3B2G%cK}$CGLv!31=W`bF<h)7LSEd@nd?H$gG<cia{;E0vfF8u>%p$1cST?-
zoCU>9cy*5aSI_{UcY0eUUb3_<-lY~ZxozMZ?jrADy|DPRAY*{$L<*iJH?u2rA1#><
z<qX26YC!`nZ1a*YY2roUm=SPG&0X}g5XC@&tLDIml7EUxCxAE(H$=iz?t=$1^h%xo
z7H!(qu5bP1NniXIw&Z`HEJcILrKn#;bwM<U$ODisws15eV;qw=1j++{&D@?6F+G+a
zxCYr|tBpH5Bi1d7#Baz9gu^6BXOjfE`oVCXUOl5&5!QSiO=KvXs>uX|rUe6}2+e3D
zKzzT@$F1-<xhqWFcFi!lWENw$H@)^jPt3DB2R_=&8$UCl+$36r1XI-DpkyfuO>&Z!
z;gF-0$xMbQ0>W8htJI!*HOjq7F%{Gn1>LcrcTxsZz*-}KGJf9)d3(5lT#(XXvA^5=
z+SP|OGStQ(xMr=xa^ZF{UH04RSj}Aqis>YDtaD+tPEY*{t86`ZryBy+KynfiuWEv4
z(jf9!m?=gobb>X+3%7|zjHoba59o2<WemI&d$>`}X=pT<Bc~8p8uEvh4c$G=60yab
zjgLDB;~}QQt&3fnLx*CT11(3HnkjH#GM!y*1lpYb1%j5DoY<ArVB?ACkjA)nB9_a}
zfjv@EvjGgfD_+tlq)M-F|7m(367BqB9{1i43pF3wv+RH`cY~wj?m@GCc>IGOo3~K%
z?~G76Gg|8`C11uR6xX(kD1cyyY2sT1#iD&)vdtwWt@Wjq2aCJzh*Uw9?gMpG#&A#i
zZba#G3j~9{NJ4+&{++s;6;H%?J~3Kz4Z5tkAu+(zEM56*Yl2U7;KsiCa9BFrMt-6l
zbuVo{Iu`$o)Kf|liWH2bhL|WSw?Xlsg)^!c_1nko!4aKa|1fgkX4Fq$b<QNtS?cU*
zR}%*^4q&STxoVu-#CMod4*;VEyb!y8l5`uM2Ls!3Rc%RvfLO{I3$kVsE%}+O4?3;0
zx@Vb*$^a9jj9Z$yX+Mlg!byyhixw}NL!r?%+C+Uq4)z#*nq`a&#T_ECFj^3ey-Vh@
z==H#thJmgQ8&Dwfcp8KTcQnkZCxNTv!nG0+b!20TSsO8gvo9`@*IJ5W$ndp`cF-F3
zg2St25S=J**<a`a0~A_pXWcqz*wY9Tg(Xw#fflpX6$K`zCuGxLcNR}tn==lHcKcj1
ztrbI~Gm463lTWdv+!^VoN`;V{QSQ$yqf=~EW^_f~b48xh!PQHdy!$YB2%LK{c4k~f
zd{80m3X~C;D~b<<ab}mi)Es%tteun18h0KVh5WD;L>OK1H#bof`Jx{lAD^JCywg5D
zQg!duhmYL(s!6I$ON-1pHy6G9DvC2k7&uFuWU7w9nhFuq<2V7y06=W7t}zOa6>$+_
zu@>v`z=+kgXg8U3#}Q?Wc=)hpw@c1KB(J^NkPwMXN79mH94oU<bGh-gFbSkPx@x0Q
zKERqYz6C?rbh^z&D;dN#Rq`|$GLdgx1^V-;CZ`jbt2hqSHMB8bV_ZyQL~=4`w)<)W
zBA?ArJC=%^9Tn((xYyX^9I!mx14AH{$xJqsNX*tu#w;x7l^m<zY#NyTfIiJJ-Lo2X
zOxomRi*`PBjdz%#E!2d1uA(|x9+H~B<T(k#Hl7Zz#kdfy>TfauI!Qf9z<-xqq!^G{
zJdNqL&seD$8rK-Bv4^m^3$0&)jR8O*mWdn=g%eK7HhVpQ3wkZhUoJ6+itoFw_dK>{
z3V)5-I=7{qi@H5FEGC;<YFsjmWt||rf#id`W=gKV;Z1nw<RCy`AP9751T1@75<0tx
zkk@7kjZ`%u(j6OqOsESsrq?JS+MWhs93|tJY`qJTdOG7xpyzQB1(QEhFEZ!aB5}q@
z0w5C<QAWb&P=3(ryy2l$<(Usz-bSQMzKIH=mXgf}na2V}m)6x{8_HRwmL&v%>SEIm
zTqjE_D0RTbAbzZgl&OD%45rc0(5S+RQ4Uk4LfN|97`tkcIm|Iff$;obwRNMlSkFhy
zk)$u^mo$rqNK<b=c@Xp_^Sa5(VqR=K8R^`$J=diiE12+jbl}VqlhE$!Ll=|a<?awH
zAck?J+u*y*E&%M{ieDFp3Bpf#sGx-?{oyVT+xIRuR=@@?8f=)wc9LbI*ty5MVJ)pe
zk%Szq28dh(O}G}+Y~xHZMUE1?5-8fx<td$)@yyrU9}!`2G!{{BsF?&S(NT$6r+5jF
zb-7+fa#5k@v4k_u-cPlH!!EUION?^lz`}i<Kf=!YX1~wgV}@O<(57n0NE+BnrEcp2
zyy2)uQ;LbJK~rHoL}sOLoeSxC!DW6K%?wK8^GDWIMiLW^U8|>c3U0u7R!%-qjX{4(
zDmM07x~t3ihEsMC4Jb|tCMp2tLz5q~ri<8;e#Ed%rY7()^F_Is*;SE@5ASLwU?xRx
zx=Aboq8yuBfbOF=IMfC?aM7rRRmH($ne7dAX30Yes%i9D6~S4u=8@7g8m4)m7o$6<
z^0v(-ghYU5suntcm^;CwRYZQ#tprE)YH_qq6p3JcvSu+1f8U-VkGha%-Qe1z1fwaM
z(9$tktlNn1O_Wz-(xU&IN5K9|`$)ZMs1msY=$yl?+nC1bd%F~tEaF|z!5y&JbY01%
z0(*3(HrUN)b??8dd+6u$3bhw6X(%L)M>@YiNi-ae>lmFYyo*r@9}ec%(6i+VO!zp_
z0b9I{Fe;2SUCahBk&c+(r%<SJT&-ETL?D;p*pS91{g4ou<pZFtsKJOPL9^35$;O_e
z8`BzwN}pr|I?hUe7NIUzh&Km3_w;dhW<uFHj4pocW4!gKAKB7x;X)I;jZ>87onvP#
zp!2*=y%uJ}R7NIMIcLi~`+JMxpz=-@oVx;dSO%j_P2Hs%qN{fmv}ay9vI(Ix{X1Ih
zjwaKnhavyOBZtDjYjeiwK-P+<s7wyO)bO9a1*+KeUP&J!B4t6U;#Jx;Ov2l}pXqDG
z<;%?J?670{L^G+4psE5kqC4bjDp1XsTfTJd4b45kGGZppIiR`2`IzGQP+(-n+jRdC
z`-&mqHS%NBiDvuBc=k4o4f_-g>)7h+(C^h1i>oQLFaMVraZieQTr}Y^GnT)*b4{LE
z-H{A3ZC42$CGS-!gA_VNqlFQtVa;fVC^Xj^1rJMrZjAd;=n~dCM3|{MW6#H#o#t|5
zHpi5mPo4xT(_p-G?j2X^K1Y(1{fIb<DJyHMBu9`-+>6r0herpdm`>UdO|Kh9t+sOH
zQb(c4dbTUPly`SIn|g-sUlz6WpxHTdJ(w7>xlsQKZ;HxltrT4uu1*!8|F+pa^QKd3
zq}jzVI4E#}3nz6<b_5&gG3G*|hxAUavEZ|Jh{-BtcFDz^5n1xxhXfLGF-Cly$ur`c
zDRSLCv<1V6qx|!A0ZwxVmPrMnr(8SWI4W)`7K$=XZXjmhOJHcq8MQ|afahAIV1%8B
zo&Lq#0L@)VC$aav8hFx<)m#dQ043_Pw5iY&LYJMrqw5$qhC`J&p-(MdVX~8sDWUQV
z@sJ;PU81<!bv7LLB%VZ=JFHI|&&CUuBqu&hsSGnQ`h@KXGFm$H3xREC8dGM#wbVeH
z>NFa2IuWL6oq6+}y8&>Hf`5PdbbH6R?C9UOkx|egx{qYQumYN_!k7k6Rl~2@W+-8c
zbLf;W&nml7w?0fRNho<I@oZCycy5GX6E_op)ynb}#bH(u%@iRh3h&T+-$hj4l|2OL
z>C4s43_QJfa`7%$#|&jZ@BHcr9_Yy?Myuyo7aKT1l-@q~i)=YXU}P|`Oo45uKso^e
zCLDHYZZQ<)d}y3n+zH`W92MsvLX{%U*Ebk9p^x}yH0)p0sqcEQlPAlHz*nGxdCL+v
z+LuUnMd+rY0&0%>sQZL${9(=FsfqHL3<jjNJUTvWnH=Am)@aRAH!NJ04TzVM>56xp
zF|45b&B^g(#C7v&j`ZVE9!S*=smpRm2>Xo3*Wobk^QIjE3gFNqiOukXwr0I}5{i+Q
z>s2LqiTsRE(T^o;ID0q*Q((S(oTEFazTCr0&$l#Ceep{z*>=YBMuy`NtE8<}8zwP&
zl91S|*=Mb8dnM#4DTq@R%bN6uoLyFO$}XjXnW-ovgUQOlzm*)(8wIiNdtM6K-4bS`
z<W9^GaT<7*u-ljs;6~75amKTtDHpHhSTTCx>6<QlXMZ2vHPcfT65)wJD3P3yjZLsL
zqQaoc{*r`pwW;ekjSX|S$2T;lRwK&0Rt!|R`H#mM$XzGN6r>{2%S0W>kfbC%3CkG8
zIz$5Ja@5&bh?0N{BmbU8c=hVt`l@}nAtW|Qrz8L<M;N8pj1&=QEZ&$xyqg2><|Hho
zYEG%g2)c5ow4WgIpe&B2c~+WaYXx6^`K8TlT9(7ki8|(7L(bKySNp9*-))|>O_)TR
zy^QiKalQ%*=7e+zoC;B#N|F8p^pd=n)(F@pdW1+Abb~lDC>q*l5J8ndkWDfeg3TVK
zJ#ZkXHJkK;uVJBKv6M>P8P)4<y5Yd>-bV0kD^?Yml<p8a(rh5O-SSVsdVE-g7(-sg
z9~jM-7RUKZFgVP{)S(;un4?tZV!pm}ZW9iLrM69MzvDPc%GKYS4l&I-H_pvgk6->r
zw{v!iE}>~Z9Y;6S$}iJj#uat#lB&u36)HYF{=TR#d2e3KhpRO4e>Sm&qE>p8hGlsR
z&o&Edb0GPpmA6VKz$u-UH?dyW{{;16D?sq%_~=zp{eR${(qE;8|2%J<xAse?L22Vx
zn8h}>@P7y#G@;^YrIWC?3S5KydJL0Q#_=o%$RXMtEeAuzl>%kX2U}j3ost{4<1aCs
zClp)WlffL7#@ka^Jd9i#7&8Ipu_z-SCX~5Kh8hVipl&FJ56QsMZm@9CRvAR4(K<aX
zsy$Ai+xyM~+CqUe1=@q^h3kGdo`tuc(lFQLB`9n;1dfT?`lQx5%Ox&ypX_*e6-=Oi
zxlyo_LM%6*C4(sn_&%j`PH!h+ny8iHC1EYzeS0`M?(ChmPtH*FOF>g9%m6jD5u6Yq
zLeVf<KQs?FiaHkU>wWt@JZ|p88>{G4-LFf##bZ$u7cMDKOrJLAm*<_IY{wV#^bXbS
zlt?c$bN@+#QBY0+lAa2nzHc8MqVQE?B>*XcW{!oxVOAfb6Wn)<Z-A+4ol^UU@%TNn
zDf|!zO|cXBQYI#vP0kv?6AhyV3B8R=MzA(c)(S_*_KNo&S-XSwofd$O;g>kDvT^D-
zoTOI?nlsr@hDL+TKC=>xaDoB%Nhl^ckoHurM^qVd>p(8WgFCZ3Xl{7!pgf6j>&7gG
z<GE^P#@zS-V3@pELQ;sZO?W{d)7+60e~Wy23XJD0nQ&&M6mu*w=o*ajlL?}OnmI2v
zjs?TWM6>8eGiuGq6{tIEq;P?z2}v>TyF#a}=Kk@~;ZM4UQE5&5wY@fo*OA<vw1Eoy
zA1C1)<#6{!Db4e<*Fh7jj%PM}9H$~H>?lb__wD8Q_>H-FX)j^&zNpUz*d%lkt?`Rs
zZ4}<}kK%KHCik!;)BE2IKeqOoFON^pfEN$PX{hObfEt=&a2(x|l(JSuxwP?0z^%a=
z?ho?Q*2!Ueuh}7)oA^YK0!W+W&^)jUictX|!B4o;5tDx3`YAXI(cO=T5ww`LuGF`1
ztewdk(FNX?Og*8R#kG!{xw#XsITOc5hL#%7heMWNV(sU-S6k(;NM^Z|U1$^%?9{-{
zDh+h~89Vif-d`|weqTNTe!tQz*2`zXt^9$h5YayhCnYm6uZt&QUavNfLLR}ivC=Fa
zY?e<0u98L5z}E|=fv^AQG_Z}8rt$yFOd}f*;^g%B?6})`-8^mWcRQ`a*4|ln@6CQE
z7Zjogy;BIE7+qJVKR<o^tK%7g24(yX14>xUfqjV4eTUmn6RyarZHJ=lBm?J3t^Upx
z)C=hrVbs;1-z}Q5sYCVpfKq1@=xsKr!ViL4wIG~~a+pu?Uj_jEe$dB14^jeOzM7p_
z-GPcO)klw{W9hXgc<2xuWDb@8^ELJ&<+#JGoeaCVLMz{3)rsHC;|vKrzd&;JVqrVq
zVqH^G8hYY4G#{_j)D|I>d9Jl@GP7H)G1|+MY+GMv+FEsJwC<Dq*uE`i*zu~$vg!S3
zSklFQ>#$Pa$--@j#CdUr^P|J|(f5`5(+p8JNhT#VPEU?cD)r1F56jCR7MDjq@v;i%
zo!6E6ll+Jl)xu#(&2KY(VP=oAzTO=F(8~37v8c*Rsgr@&2N>Td9+y=5JB;p4`>0a?
zx}a8gyQo(4$6PIvm6z0cbAEW%&dms^$C3(2ALiEQ3R#!p@~=Csvt0Rf8jVWIcTQVx
za^-K)ldWvW{P^nh`1~XX;oIIYjLUlYaqqC%ev_-ijB?q?h*!?<ebF?RZ8RWak+-bW
zvlxYKcEYmmPS^^kd6wIuQgd;=+%8atw5--?r`<Wr)hb_DTGtHjh_1sjRD;46Ue^-L
zrTX*?@)|~ivJv2`+*V;9pW+JiF1Ohyx8-Z_BZ5D8oUKq=yi(ux%SvLyqS9yWH?92e
zquKP1B9E5tr?b<aDBA#B1e<<k@+mH<cW`{Vmq%S_`4aa_s{F@!=d8V-+wkZqQCjD)
zSy-nZ4MM;|XyiO4ZmPJp6wB}3*wG32Rq$0FzeMFDgnf$x%m4zdnrE}J&HH_;b#iug
zm>U-g_{sor+}zKNiwgp_Nav_>F0Q$UhrR_kqjUbIb(*J;*lwky@~hTab1#2EXH8j3
zYOh0Y#TBD}%)?<?Qf)U^4gL#zoPGga{kR|>_-auLRjp8?U0uct5G~D|K>O&d^$L(y
zjt!6zphwyzpgf|;J>s}zKzVYV^oZ*<PNntEjo_H?qwyjd_mV#EQ*5Jkw0DfsU>vAR
zaxa+D%k#tUU+<rG4_ilNvl=12c-5bN20o**&J0AQUNp7O*w6pT^<&~NQ6i)SrCcN?
z$1G5MDTo@P9*j`9NAgU(BY^hdUl?bP6Hf9N)+No*P||!!Y^QiCVJ1*o8=?WR>}QP-
zJ&MAy<1K-TuBa#ZvPhvGkK@sNWOD*LgOT)N-g|9GilK)Pf5Q+J;WSRsYeNH1{r$9g
z^s4ppr^D8ddJATyLU#JQfileIS;aqd1~_h6eO6(wE>fAJj-A!*dn86K)t49MBfuAc
zf=*$y$>?=-y9d1+6SwJn9QW%IE8+C~sM`jfz5Vx=j?^jjbG{VrwY6V1*SIj-k2|4-
z+9tpkg@^LqY-iFByMg%kTL(=bb1@h{dnk&D0hvgm-F4kW5{X$d5A)0M)5RYKQD5xJ
z*;K_<`>>#XW5w3U9ENwSINH)~R);qe8)e1jNNJ#x?PuJpi8T4Z%6^zHuJ7MDKBx~Q
z4&nL%uGDHR+XT;!T<$zslK31@*cVcW6ub?my{j&TvByw#EMwuMg}b}KH<&8->Eqy8
zu(R#ex`@a9u-~6{l}6h1USk*!4&Vdi?kK+n&X3wZc00#=-?z>%OT-(may%KJy1l5~
z*)T1AmnH+e=QM-wLc@HM9#-qVk0)KytpG*Pb?h5+otSv0MX=Nzm#rnwyBNts9oY&B
z=?Z=TT+yFTsu`di9=|$hA7;+5W3I^7iU$X|_xZSm*}e;d_7;}n;B@SUQuLnucPSbk
zytawsxm+#?KGwL16Rw~MiYX9E>F~&jo}wG&*E(B_gO(MR<Ipf>&JrDlg0SSu_M>5V
z2dk#jDu7DS&cl@<X(UwbUvL3D({D`B1@f7Xr|C>mI;w#nY0EQbyfiXkZa|Z`Uxo_g
zH1x^GysMh&Yy&WacyQN6-&3@f>5Ac9wphle!M=yxokqEc5$Z^CamT4={ctaWc^22H
z`P-r-Jb%V<$U}}LM{Do!9M#`ld7M9H+8CSGbuq{kZ5OF0!EP|ILHFqRsO8m_$Yfm(
zY}S>)W&y{!-y@o?`jv(+!!j7667xLQoui{m6Wz`PD&3gz7~2DrS#^8gMCv2c+O1&2
z-$aUtG=-gb8*11HPJMzG0jAHR9D3{9$^?AwWEWVF^8PXngu#+d2(uc4R*L4=&%J)S
zx&Cw$IUP=zOVI)7!ruz6(6Swg!Yy@sQ)j&5rgk==q0P;FQ%{iOoX;YTYzRe6%(TS~
zKBe}k#q8L)L2b`(Q3-KBDcX=o8h-`Z>;rY@Md#afGb?*bHVV7J)19xsEqGg0Pd09O
z0e;gJBB#rK40()*B06(fp+K&SIeJ?86GH_xxMX)Wnv~%)zhDs-_DdAr+B_^k?Qjuk
z+B!qA@GyTm+G`(oQBrh#ewMFHNQiweh@nLP6bf}}5+>A1S#Hd0xNPf()@hcM6HrpK
z29BG>AwJ2`g0lS4#Uu_ynFgsPeN{GldEW)Pcg8BX&GJHV|8{W!Oe$PhV4R5Wi~*KQ
zA?Os<2c_f$nBbjo{<<R9^ZO$CTi1BO<cLVJDCmmyLbvR+WQxhL$@Jt067}MUy51Uu
zojnhbV2JS!tzSk)9Kk8nIIH~e%kzUSi5giPVPyoahh{f{hP&LVhzscXOX`lIE2jG_
z*TeUAbccYKZUeM=>GY7j;rp_5V0<i~_@W^t=p}`%b;JI<E^$&iC~6(5Q)kWoyC3Lf
z;mG!rIWjFMr<+kYf{azVhO_JboeixwH)M5AyC+H7CSAbR#^xg~ps$XiOMcZTct@tj
z{LH*E%P10ZW~CYp^c;yjCYC)O(|m4Sl}AW%V>cFZJWoCizV1*XJkcf5#{ivHI)eGP
zNY^npJ||O(C)m(7I6)@RdU;k+%-?+SLmr>u)E1B*$uz#~eqs|737WX)l*>p9fY4ST
z?@A_A`Tg>4k0q5ToE}#EYNS|OUXhArs*-MUc~vTwtC~z!shLbN6{jmzoaQTvvT}J{
zDOglJyj`(+c$=w?%EIM!u~eoa${&_j#8SD6<PyI^RV<gOJXy8&q_8@xEtl8ka@oqH
zCtaa3l`GgDD{f0uG`lrX5x&CS#9|fK`6;@XUtS_g@sUO*k*ZITyu1rUUu1&HN<=Nq
z3qHIF?`#ADmSjb6EA?zVh$<qoVPw7TO{`)`T*OV**ryD6<cmA<!;bx|eWE#*)PY27
za4usT<Bme*L^l+4Fx9*W$S!FcY+3unW;hgduCiyc^o8eSc#MIQEke#>TTBkl)9;$;
zyZCb}M<kH9bqVDo7d?4_6F*EGC=m)L&GSwxC;ag$c;ph4`9kE(@r=dKd=Xb`ZrCxh
z<yv2l#@F#Q8FP@a(}+1tH@%+3rk1-1ofQH{>c}xTu@WWtL089hC-fiLpPPEBe`e0h
zyC^BBm>cBE^;qmj!k%KJLpMD%jpQ1x8rKyMcfc1W`kb}t)`%dX1VKG%?`wD^V`hsX
zGMzyT$-I0(fv3~DH7kdme-Y1aF!avxDUA!r$t#2wrJK~KYZuW~2<>Vza_fev>BUc5
zz$KlYbvvz7pel)33cSxz!hLTPlzw&E+-n`cCH#|?-pABt!2eT(Q4yf1WP2LvfhcOr
za71rU+h;U}QwfD_CF~sct*|+4@px==M!4(OPa+Pn!VaOX#l4AN72q4B0cQ!P+_s*f
zQep$!XS;dI)4;Cr?2Jk$6D1ciDCXQT{f{o3iO)&mz7oGh6UF2vGLeCh$EP{58$5Z)
zF5LWrs{F0zd4F<yRp$cb*6Ke}!pvPHUOlxW70f2g+zUCsHuWyS$Q76v&}f_lmBlKI
z3X1RJG^HqK6qt^%a_}In)PvmU9QCC*_R=z_veDAfv{Ot18gJ$-S^H|q-pdCVccgsI
zOOfx2el1tD9&9QwsmeV8>LVwO3$GAf23q7Dqkd&Ypq*$G!R*;x1$qt^aDcN?lGZQX
zz~uLY4<AMDhA!E}4tv#kbEE@A<JpLk&czYk_M!><%?;qJ^)W~c`~ij=|4v~XdgwTJ
zFzT!&7l3A;OC`wwU;c77HPbMmrhXV<>|j@eXPDz1W{x?Vm<n=kRWSZAKuK!OmH-v+
z7`ulYkIcLR(mr7%e!-#`&4HBIFc}J6gI9{(Tk8Q_+?UgslIWy!lvo03GbO=3rK|+_
zIT}N=Q+ngsu==ik(0$c9JJ_d%Mx4Us)v(&GLrYG+ml#68k6d9qCbpJI&Y_zm8G93y
zIw!pm|5~R69^B0b3`^l+yRHP1$ukmN8)8Of`DJ)W?)^Lx%{EsT`o^Jz+cxiCko3s4
ztWWHHJ#bSqayIRVy!rYGd!u21S~K}B<u=~Zmc5;B#e|ala6<wzpfD-!1!N?E&MuC$
z#MlV@dprQDJ9v#*5Kc~y_edhs**iXMb({PDL7frtb}=7V3w*lmkbDOWGOku0A*y<m
zM#I4)PhbPM{kVHdeqK6o+A@9E;*`P0MjNC|2QWl<iL)QnRgnYVYqj77lwT|xlB8_m
zEQzU(8W!L#9Q5Jmzax=9D2!7<#F}xzV=6>K=?D^D18U9f4ln9t+Sl+B3Fkv4W0XN0
zWynp-GFaC_6OaszW5z5y`+@>sQ}%Hpa+=zE7kI-|4G91<HMXcehPr3@8Qp2(c?lcM
zc_=<t6y%;gnDji$1Ti{4cF06c8qM5I5?cuH7)&r~C(w-#7`O$!9RxQ(&2Cp!igIpm
zcXH0{$#;tP(sbr1CjREi5M`dhGxs4w#Q4)t3lfFiZ~q0bG8o0mf0`FkVpA&|7(O2M
zsKCNKFE~l`h%Iavi95YP{rdbK;6H60HZcI81uORUu%tUYLAG@)`6A%tNIXXT?!W&I
zmdq*8;1Ue%u~?2}&obsHtOu0`eY7CMipDl@MSOy>1_+<{=mb;l65ZrrklAzy%`pZc
zj8jN=9KSMzM^HH*tHUo7VP5~wgkB{|AemO--*Ms^+sSaeE0B=SQVJzg);lo&j`_g!
zLOCC&^9kw@ELZP0x(v_FI3&|FjD;;i2Lv1P7gvBtq}1X#%6Fl0bR1V@zorQUhPgQ~
z$Q>$Wrxat*DK(&!(d#Y&7N{2eP5TJ;EYX_#-GhCg8V3~K8j}pTsjdfKaApg%e~*au
zAJR993&2|OI(jtgJlvdeen4(DlmH&v70aX&vx&4I88~EszyZ$-;86EDQx2h)h>RWf
z9%e^~$bZ|)4_snTdSaxn5fqU=FqV-{d}NMZ)JOC0V^~0pCzg_`#<K;S!hE_YRJdip
z?B=_DSh5sCKXFi`DZ_>Sb?)`cXvS}<r-$t~?K33)+lQ_CSM+dYZqpvY<if~L^t$3E
zWnrohFs3<R#W|+-B;uGCo8fA9x080>;j^4&&8GM*KjHax+NFLQ3*nYe>BlRP4EsEj
zU7pbfJ%_paIT$*!9sPaAYpA))1U}rHa2o7m?UML-p3t;`GGXLsc{7~v%pS>RhLwR|
z0KXy2@4gihf_Fiesa`ANb!H@S;q;slOU7N#B*q7M#M2PgkfbR~nJuS8GI{c0u?TX=
z0wOpx+E^}QwwVc;wsRqWQWTc1YRkPa%T|;&R{+$HdZ^4L<F>7*835qNUvDT?0@6%b
z_7+=EmMMe92T|^)f}GFz$uA(Cf`U14ph}iM=yLi?xn@SXwn2+dyk3}>XaEMpxcREj
zCioG3Op)jAFpP3^6CCVQE*Lk!Y-TwX1a`T;vuja0Wm~$jYm58kKIS%Y6A_Pznys@2
zEPY9FVMs%Zq`t=fCWhQ3sIfE014)L6cr{~=2(n(rP!ZGI{IYYiThZOf`ZTj<*~(>y
z96z3w7PQy(P+krV7Hy+ErZk-|Mwb~lJ5693LLFF|ka!%;CI$d3N>5BF3yXG_W{W`>
z`0b688>AKD9xax|7+Xcnz~as*O!C;M22gQh=C#UxG$uiLawoqG7LwU(@+S(uDrkRg
zF57p!wm@E3fm`Fja5(qx2b(yX#W9-jYGYAL5=Mri5aX9S9F3tJEdnsXq!+Y>L&C71
zEW|Bveb-Obti4H(UNd|Bp4H6W&u=;W7;#JX#mAD3Ua&kGRGTSf-Ez1F{St6gI0B6X
z^JKu$f+5<^Wx^?elz&)@%iI?v#dBochlKAz<ge~C4iix_QP>(ZF(>@Yafjt($Yqty
zZQ-~b&Mb3>)mEO;o*bxxnZTjpomw&_XN^%QauHFM)&5-4!am@XRmli5OQVq&9=npJ
zFwp8;5K2iAU|`_PakO5ceq6k!=h8t8_kyXxSM@w1&j2$=+!jLk==iL?*Q!_AGP1q_
zaUt)yWZP6Fo03Y5hj)QQ62sTEPuo7LS24G4mPGKsX`IwO3ATj_Jh2JvO^hw2B#AU^
zT{M<l!m-E&bHYZ;7Xr{kSaO#>8b`B7D5`jrCb(G1cw9%)8HM-~&Py&R4z!AcI_phd
z@-RBgGo|H%;m+}!=8tf79nsu~4O<@|eLL`^HiZMJ)GJff)EFTc@=cCB>&w9;FB2YM
z+<p=wIWnX=mi$uEU$`M`k^Rsv^TJ?l(-wKbVn6%fyMhJEUdzRZL%uvCRsPxDiLs(p
zW|Z+hEVjrS%rYwqTm(NSR30a>yfNGkwYy=}sLsgic4iI;bZ_Fn1CcvTJOMfH4}8Ok
z&ksqu5}{il{XXcY!FoC<^fAoZc|x(q3v#r|>8)rj@b#ciHk~3hOOWWFM{YKNXg|Vy
z;3(GM%)qL78P)^aLOp1r%(J=Qd}-V+Xv5JQZ8={jWe3QtsvKD|MkL)01*v9P%ao>v
zO7#h?DVqO?X}0F?!lj2Ym{_Qva85Z%K+kp_n57i+B#LhXop@@LGNob3V9-xh9xuMt
z^t?&ka%A{vW+mzXBZLkHdk)rlfL$5$XIP~$VtCwV0qTK23^w7UVE8SRRA!GAS_CB$
zvOPmYo6){Q&!=}Ju7|&kM(vMo4gBO~ve{GONn?3`I8LV==ureRo?H`7D+?x#9hp%O
zt)YZsjqG+}V|<3u!l!KiVM~et%+n|P>ZObg5z9eyg9$0YM>4fdio1Kj@txOT+pTFX
zWcIa|n^|xV)LL7oJ+kI@X~&FKdND=*i1OpV93~gxFzfcoeV6y@6=omN4N9nG*%c2K
zlyndf2*!}4NWMIbUVfBy-$=@pjq9qQIU!~2)4D8=#=O8ZfcD8X%Nya#Qxgy{U1p=i
zyD6pZ<dkJ$OG!!Cnw;p?d(UQ(JZq|6_mlS|E}$Hk8(07dMJ9A3SNP4)fxgDNp0<2c
zw6xs5fZh?XUPu5@*SgLPsVXoYc;dZvcjN?Nc%1>TVn^QXXUPeiCDv8KmwK@9k}?#?
z`nmzgZWcsVb(ix`F5HuDvl<#jOK{}9-!K+OP-#4SwqE(@xTsKs7exUu>&*@NA7b4M
z_~}3>=nE4{XNJ1#YrJwZ*?yjThnD!6;d^&w_S(omp(ujidLRuOc)ZJm@#E06q(NNg
zvb(`rW6h`8v`~$j(>%fk0<&rFYFfot^|fbfwSv3lWvmBP;F%NE=xt%|LR`2Ih%um&
zpNgHIai7FMtaaLN)N29R=-eem9FjAp$DcN)KQyF5D$MH!F6yJ!S<zLEs|MY5NiJ;V
z!`{G)h~ylDRe8$>M$dvh$^wblfk__4?nq8$m3zU1^x1<xD`Rs_($p0ZxRA-*`Z#T8
z4!Z#m2m7bMr8a+PwhxgjFk3Fyhb2)Lw|I0+!7h(a&ZxlezX$$%dV6%-IX^kU0KLEe
zp6kgkkAV)(-16D>4(`!d(-vMd!%`Ye?l!c2;{{69&@5s}UUn}RGZdbB96yW5F<M}l
z#!)h+3?}69S1;JTPMcVMZ<wHwR?$9pb$jNi%~S4;$dZ4j=x>~wT$m=IALfcgJ3|x-
zw~r2v@$%v{aTuA#7IV@%lj|~7V6iaTT(-{8p>-o?n@(zV3L&DhZXs73_c7=#MU7fC
z>=Q#`qr-55BRN<k;+;>dJiv9KrljO$QDoGO2U8ydt>$<kWI|k+0+vB4EW>^?eadLR
zs6dxO$D{8^K6rvxj_j{{;iN0}a3#S-oH|{~@5dGAUbbMb>~)Mjxa9*ikq*$-Ia*fe
zDlQ0yKt=rU3age|)Tv(*hOlz0Sa$W6G0Dof41Rze-WPk?+SgO|e=T@DOJMn_P{~N9
z(K`;3A>yBcA`~73P}Xq4Yw?EeQsSRwg*X~{L8&<DQidj*f!UVJg*9;Im#Ku7<%NxN
zod5f_o~>n@&yseCfI8hbt+Uhip6j8TGvC-i$Aj)DnoZ*#&~_W1S9f_aitmzArZ?RZ
z>^M=7%X&f8%*n=&A2lRXm#d|jpdp#4A;oq4XlKPx#w#`+Pv$d@fMLN~UYxzTv*q1V
z^D!VP-r2<Eu?tw)dE|v&p<sVLn!rB3!&n{wPP{=rgvDsOBzO(qg%pOyX1EL911C)^
z9%j=U-;ry6-S|ws=M<xyy-e>m;zCglj-oMiT8p89J2dxZf509(wm_rt5bfE?V-0S@
zle5<-(&_FskM>%J7=r~!hSq+KByC5OW0|(~guCl<D-wc>y#XmVvm{|4#jg9ZHx1J(
zNycICNenm0nH0a5iF!Asb_QFJ`y-G3YG$mhBNmalZq3<>IL&OmCPt8WeF{Y5dB@bw
z$AK%qyD4*GwbOp}`uwCGz~65B)sgNw^YWy9(#pLBDrmx)7exkXQq>oL#I^U<O?Q`K
zPzRHL+aeOwAHb_j!MGodfrv-@O!S`noxUCIw+@>>>5pSf?VCBtUK@k3M|&pchS2sS
z0B~#-71hhOlT53QQyR27i$+=JOgD6v^GIWa{Y|oe2G0ruYf)r7&!eb&^}#DKp#VLX
z(G0$19NptF-<rLvc!-7eUbheTIod-$d{79bWs^~hcE=3|nRdmlKq3ScMYWLRG`qnx
zygiC;GW7@Xt<qs8xN$bBk{X2|_aMIi*;q-jL>0p9QYAfUp;^);24hi!Cf{yp33SYv
z@w}D}ON{CHPQ6bB!jdbLml!f#4Y^l1e<wq6SM$r{qSBen#DNJO#*!y=#Uo1%6F`g;
z66E7oa!a`c<csD(`Bl0?Eiav|n-_jj`Gpyjy*7OZ=S*xfN=CiPEF`p*A(^^l57^aI
zwz;d7P(+vS6b+L10d3ooUKhviyvg*Wpe6c-vW^!<N<$ze6QCV9xv{mcL|m&lbT&*m
z(#-F_2hJlmPq_a^0+Z!M0bhL;!23Nlc&>isR+`;PSTs`X>}7>Tg;JoPa$qb5t<%lf
zVP``W<t7)^2&D<}c#v$kUVffwj+)O;^I1cc@+z{5R#h}cgb}%IZ}`4DN)eub1d<sb
zf*xKH{u=ql3_-;d4JaC!I0#5nnSF#jhbq!cQd#TQlC{7-*zdH?y6vOAQ^(iAX)CY(
zUM_P}$P>6!>14C;ZUik-LP$c7XTjQobZuqR=*+q}QzyJ5XFx-PQmljhi`u#=GoFte
z$2nXu8eX9UP)*jz?MfvOMM7~p17EUxj~S__H*gBpb#G(j&`;UXcAOYh3%h<W52`Q&
zG*idyU2NbMIDIY#pfeM5qF0%X7Op#|^|Matuv0uG?Rd#~br;z7a6XQ2eXV)XlG>QC
zMK&Ou?j&E91L;u`a9}48uV|PAN_XeTDix7)7+4e^;<yTh?YUkGX;D9jZIPiy)<DG_
zLAe;dWZ@972AbUOGtbe!P#&H$cw8uPwF4}ZwB}0Km2cv<5yypTB!RyGQ$Vc0^DaD+
zjlF0KxRHIub<f@B#jgmQ<!)du2=@{<9V2QbM2`>r><xSGMry9Qe5Z>oiPhp`c1ZNL
zOF0USBfMo<F@@1YjTmtic`tD_+Hf#unQ*3mff5W1ua$|i)xRi;t(B|E)O$8WSO22L
z&+pR)`Z=VDBQDDoG~|uYjBc0k2-jex4n4xtZG@x5e;?hQBm`p$RkKo)6uAg!vp+a8
z;=A6JybP}|yPUJ43_v1e<>2H+G%J4aX(yT;Orz*cG`mXr)zUUNB|=bLuSsr%TG~(1
zhu*t{NbC(1<4KYXn{<a~V~W$>K0G}S2s{%gmt`C#^NVzT(Zwiq<7jvf5c>5e;S7()
z{p%w+jU-N<R{*A1(%j^qbK0Z~=P*qs;U&gjLU!88skx8|SymSL_bxN~nZTp`N~1I_
z;O{XgxL5de|7CYsg-JY#NM2qX(Ns%_8Yd6ET#2p(V<|6*aVr;gh6M_Phe82PYP%q|
zI70xL25O8WJQRY|mf2cdW-JW5%GZ;D#4F;En4}BLuyPcSe2&w!nKQfs$m3B|UoUhi
z-HtQW&5^?=a42z~qdWze_ZRBqxN?p`PJlrRCW*_HZ){9KB4*Q=@3oh&C@FL{&MQEf
zn<@{G?w2Wvj^2-_vpWm6oPJRNf}<qoE>@(%FqufB0C1`weU?#MiclGE&q)-%M-gsz
z9;~au;-X&229bBmVI#ts7YoacKrFd2!L64R(^L`*3lbC&YZhs87FQrae~BgxQNiMo
z;tpL>L}HY$RtkoHNoGo>5Roe+e6}Qu8;*8C*jJvhiopPz$=Yz}*UW(j%-$9G3T>ec
zm9`Wra`VMCzQQyu5G3VF)Aw+eOuO=Jr9PZmq%OTz6#y&A!gH0JbH6z807;Zq$xz@F
zRO6n4@XMIASpzUT3b+D#7th?3qURx}BQ}@tfAki^xQUopUBX<AP*;SdFqY-G&s$>M
z_4_BM7W4^4qiOW{e;*mwZjqJN4Y7j8bn~&qQ!}lJg#gnjUR(e#YMMxCFo#OcsCY~H
zsJ$tM+$DY}SYX@Cg-^n9+^b4pD=~4hf)|EUdJkse(+tyb#>f^bI5HOME)2>o&s`yj
z8hM}fCa=}nTqAvz!QdS3(;j+ll34ry&)&QDwQ(%@!@s}%D#kjW7>S6hZ;5T3#UN}p
z7+3_!$>w;qgEYXzl14`(fyr_9wLkT(s_yBYizIBH?C!JHIWf{qU#qLDtLrLeuT~(1
zQR?MhS~e53u=(Q-L*(0_9pgd!3ytxhz3>>_yQg}a%rd5TiZ@+b`s|L)9bygNRGHN;
zJ`s0tY%k6z#j|kY#9zi7u0P}uQql}#o{_<Ug%Z6f{5@}sHaNp>gKeDlJ`9ZHTy;w^
zp2;C1VF?28_(RXTd%h2XQQz=cWCZET0QznT7L-!>m6VmJsmD~|L}xkAU%>^l_X3}q
z2vWxiyeznODFk))MW45t534jl=3vo5)(Vutu9TYLaS~3^YjTzyMbb2=4-+QOFvn(q
ziyb+!T{ir!HevD*Ik8qW#<&ETFxqmZ;k+#A&(M!3SnUdi5nV}NajR{N297Gu0-k4Y
zjMyF(wlVy&@}YfECNkbW+7o<+6*b!dlnId>wXLQ+IxG>O*sMJ4<mNu44iGB6+V5CD
zCS=jaqt5p6aqDoGzHm;+=K7OIkIF@Vrq_JLlx$!{nH3)`iGhLS6<I+%F@{BjxoovK
zAD;@LV1{!KHxZlG#vT<f6LyUha`5Q&D;&hegq`i)*cQY}|FSryLxcr|dMdVIOoo||
zpHS>N?&U+ParjiwVX0x73MawCfV!5j_Ji<)vi2N(VriHdCSfTUCDh^Vl7?stAqBAm
znj-5GjhgL1qSQDghz!q0`jwC>>;NRal;T>J9Bm6g%cPRo;PM9hrR$toOy@u!^r8vd
z2(jA*!BSflNTv{_tBa?AChJ$jR#bon@ew?}q&V*2;ri3fgM;NP*^k_0xu2q7-PY`A
z4_m?8?Z3Wly*)blrE_@HY5lanbGm<Y=+QR^mL`RgH6+mouC~t6bGF$7it{0P`aFJ2
z;NXWg-Dy9$=_i+NK?ur*-P^Zf8Q{J#o4}ESZSNe|Am*bmO>dHMPxBDcUP`k(9aQj)
z?}wVO;w;5kA{A`%MGgiKp`C^?wrVE>m>fqV=IQiOoJ(iHKH(Wnm)Ih8ISS;cVSB4k
z2|R(2EvDM)D<#~uFbTp(8*{DRlr08`6A0n8GUbGr{T?w8O?=}hr{WgI5|abEzx0DP
zK`p$D@`LOq{XXsIR1mM%XTpWPS0x-45v;4pWRyNzTTAJ-(2Z_rysOFha*g`^9cD&r
z=@o9K)63QFW&A_j+uHd4;pX?&PHW#<Lmklk>t<)2$BDa!7?lh+>g^w8LYhhEw@9yJ
z=a*_VW7ehkCU2A@>5CN0r_iN3MgS&pAHA#Fbv+Kp8jeju?`q~x<G=@qEzvW6xnzP|
zq5MF73&s6P!lo{Dm#mkZG>5egZ3r5$zHUrwFCOf2G3IqpztuoZU?wj)cCFK}ItPlK
z6px@`U9`%Qb?{vGP`z#fih-n>JOj(!rmE!4gk4LvaD3TSXv4t^VOO0L<h1KeES@1d
zI3`XUc(w%;PQ{HDjV44;m!dlT<Z($f?+575QNT-KqjvOt6)L43Jmxazs9+hrK+A|=
zw4P%W9OB{D6sA#kFyesB%^Kg#YX$eF?#fG9jgNG#dAr-;*w!EMZD;$m^%``QA35i^
zcqEng0*q$HVSZ2Gs+qU(I>XZi`=ZUTB70$eXS=P#UyhF6F4%I|<IE-V8r|M~yMO2p
zzvR&_GW(t!owXP2d^9~@Azpoc_s3_i+Gnr)&g9vGJq?o;ArbTYIy`Fcoa`T;E{X=6
z5qJR{*go7{cvU7e++@7KVB1G0r=7i{lg^#SoV;JrJInkYkkOr3s>NGo_mc%ie!6|I
z=vJfEQ<K95+Wm3=xbybtaR2n^<POLo9L<8ww-1hfJ~&zwCdzoNgz5W*Aihm~EDUg%
zX3uYOZ@YaOd<?w(gJ+8a2q_R3**l%>v(q;VHaiG!S8Se^`HjEb{>20^E+Nu>UCS$g
z)kO1`$rvX7a+%7`e9rzQ>JsI#{-xkuI;C^!$)gSoVkW5LU;a!U09K)G1xx?3<XRn>
zPhIQMAx0y59ZmEY-;tr+;+%hVdq{)f#=hNXu=H)+H#Gc5p<Ne7rNgTZJ0vP>KFsOX
z$wzk6ImX>jxw9cRU%2xs^f_|ul6bQJ3;Pccr}Qt_X2Jx~uk&~q;<lNL`@ZDie%(&%
zK@n#OGI`9f@3AqB4gZ|^mAES&D;JhJ7g)n?F-ztrFp`j(;TV_gp4x!jljwJxrG!Hd
zj5tSvUdbe*j^({eQ?!-%B$%(h8=-3<=(f;UGj2LXuCY-O*u-hMXd+X}e8SK=-}ASQ
z$%f>9nGh$v(bO-Sez?|CDEj-M&1WMmD@QNO>+<!&rJA_D84@lBCawr4<;e$Yox@po
zn}kcLvd`A+uTp|pbK^>zA)~fU>!q8LO%%MHzP}5s2DwoMb_z!liQlj*B0{VR)$!(_
zFjPy9?Vi0}ne}P{(}&TGZJn+K&K7pinxWV0#TrMTClU;7LGibR%Mo3Mr^Aqwg&B2_
z0QvkjpYxD~f&-1CR+f}28~$c-_+DzmIdhOI8j{`uWGmR+-#Nt{?ZJbrAN$k_evRJ`
zYsg(RDEjY~qq;PN@wbLB99Zr}*`s}qv6>*FMXV^$i*>rR`0el_GDY$$rz4cWx%FP8
zwGN{XlX@?1l*aDDzAL{DHcXd4g?(zw4eYe?au9dN2_3zO=Ygy*Ax<bh&D=ywUrRXK
z{L4QqTuvemeQD=T6C&_<Yr(?*ij^3LA7GjFGo8pgsus0!ZFZ??N*0rx@p#eOMkxDM
z<wwc<(Q&ZN@qM<B_h*!*@<<=8bD)YxBd*4>68Ax{oP=gBNx1S-OsX<t9y}wWYb~v4
zm_jkLCbn5LU1+sgfu)09lZkHcJnmHr+sDcIZ^1H)1DaM&Am1eaZsVT9UwWkuM~c<i
zEPkh(FWa~2qo#Wj9gP~x^=x)vWOT-efu}XT%?g;8goXpqO!_x_gt=f>(4Xv~3L-?L
z;XLfh!*2FarUaW7{*s5h316U`fIFr?O4b<oSh>csiL)m1@%EgPu?Sj!SSu@8*_lAY
zCx4I|SmX>wcvnW<@kw;C151Ru0b~~E4IfDiWZrpNT74x$X*@4Q>{)xwFjA?e$7JE0
z<}rk&U*%pa#da^nW*s6fJ~j;TkOc)9+KVRLE4E)Po||$OO9r5MePn4oU1ykd_Q7FL
z*^E!bXE^6l!!8KYFE~<di&w&Vq|@c@WC;!g#4cZzOAsKLnIwJ^G^|r-K@m1X!#@vA
z9t)dnO5E!-YM9Z~7E)13GUbegAim+ApF_Edi^zhdiS3I~np)@QEQ6hB?o?nITvJEL
zbT&n%u~d4KG<2*D*5&w#OVt~0ND$^6MQ1GJXC(H{A|xJb<Z2ExZt@4{s1a0ECL%YN
z`3Q70K2lf}(6tJA7DtTi=0w#RGm*;YyJlk1u`%Jz1?4k9s9R|^0qw)Y#!<5cjRAi^
z=emY*fzBCq+iVtP*4&Z44}%W~9v4k+qKI>H2Hyt9Cr8KIuj!5_**NP%HizP|sp`cH
zNqiw1`D*C3ZY`4KDv{TK6UrG?S-v`i4yE;7KSB7@G+Z1`uWYcU^T>pwfr(m{b=Ri1
zk|wOpfJwN*x5;rh(#}$3)F$-L>JNjrX9uVIYpuVwc2<Kk4mF-mpjE<VwhLHqaAqr{
zRLyq8aRx$qA8?q}vR7u2OnP1%IoYP<tAkOc)zNDs$RMQ}-yD{Nt`^3g0ZmO~!(k-E
z3I;gKQNDB5Fiiw?X5gsxD+0rgve`<eF1cgdrwg!675q`2o3dF<4YwrXt<3Z<=V{z<
z&VGs8YosLE77Jx1O)&Hz;q<tOf6JzWYT7K$$Ce6-CJ~=yj(eopn2cAlc_ragiD9{k
zmXKa2>c`jGprFqxeHe!X&O}Dh)>YDH^BB{Njp%4LaoH9S+-3QP%`wc@*=!ecYub{{
zieMiIRdG2D$F!1BRO*~)Tny-%XMkMgU64WA$%1Zy{1*GCj+J)IVNUY~KGPw`LlSup
z??}!VNwf^dh3@Keti=b=xGBpk%)HcEi@g~feIZvjX^Q&^+b?U)kX`FwdzLfJ*8A@L
zI?+Wr%2Li&-J?Uy0mTgeiAG6yiOihm{+0=}faZ+2%_Eu_I4=l5av?by_HSWaR>#)i
zU6YrrxtURYBI<4gi#B`Iv>XT443K{n8<%70tc;T4Fjr>>lf>9P9~`lVslvMb3$w8d
zUu4;(G@~3nb8xNEWzi1Xki{i}!%{GqrcCBT!$X)@wsO5R&9b4s3cQ<4b2LRd=lU|o
z<^HZO60<1h3<+lt+W>4^#cksAD3in?#5h}FAwe~<xrZ9fHn|Xb$N@#gA>2%W+k=0}
z5}?1-R4XC$fG5{W%6OF~2)7BQC$MvbO(ds|mQV`3J~9@sB|f8I^dv@eBb!A`GTt!k
zB%g-U0^bJf=Nz?N*hUTy&rMAbfX~{WH&z3Gkl~aF5K@0i{uyI74bBc61q`+|hnjSy
z0MZ~mc3gI@dI~z3#=JB5%bh>w49Z>Ev%1}6beoBde=AY})&AK)@|+vh=c<%EX-S?G
zw_@5a@l~e*EH{=NN|3*umTLG-gW|PNRPhg;YpZ`{HE{<EG81Fij0Nb}P0;ix7P@4@
z(o`_onAMC&Zm3^QYwv~Vtz?!AVPY1?-}^ac&%K9C5^1rNbTKNM0L=xiNtn?hb+SlU
zHB>#RmR0=YS&(=KP?zsUnL?&+Z6{Qt=;`Ge^A7=EeIu?edq*cb@_JTv97)x+>8)AA
zZJxSKIi-2jdllr}cu+fhlCk{4T^q}T;1~`$y>S9mI)pLDbTfHA-ggu}l?=FD4YLF#
zvpha&{Um>nj_pKg;Vp7p!~R&XW(KQYH5_W{PQw86;10#XzArT-r^!1F4S3{@?I4i_
zVjDkuSv1_5MGt$iQ*(f9T>9X6nqFz{8zX#j_E9y3pK{DTB)n6LTr&w{t7sV+@Q5m8
zp>0USg#DnHeU!{7-mNmcCf<=bRTE^~8MxU;-tNuYFjU`7_MK~WPSzsg4_r2gsc-V_
z%asOMCf~3ob~w%%1zGRPOH+jtg9kqpA3ejPOxA18#D!{iZEa%<m#reJa`rDI{$0JB
z@tIA#L^jC<5eHEARN1RB2VNKAp3z~DYUk#a@k9wOftgNI^VkSa!2%A^U~{~j!<JbM
zI*mo4>6Oq$;}Q}D$TEo|a37ovKDl(UL4I2cf4@0Iuhb5$me7^V<+}GJDnTH}t;=!Z
zxft>elAcI`oZAx`tNajN87Z4=sZ1(_GmIT9GNMs6FqYK>?cA_50M>u!$N;W>9EyFV
z2gr~9=>7V8X9ovn99ezEgO9v`S$!Apq7QTl^q7hBh_2-^)s_tBDH|x{CRH$Tex^-s
zSW{UK2KfURuqqts#{5-*%oN3Bqtz`nj?z&g;r+|8ZH*g}92?q>5kG=E6Ejr&_AG33
z2fZW8)i%tv9u$p}E@X0Rw;cw{=1dS2&K?I8`6JT+Lcr22uzi-NOU5qt$`D7<m{4G#
z(=o8{?|x+{Zjj?p+?qlhRF~nn$Icr`abm0;C|?Y|E{-d=pM<KJ*tx+v02~31GP-HW
z#F(v>iMdl3(I*QUlP=xL&8T<sJI_v0S1QL|GdaGDvET}nd+e)Xa4sXu#Gx4^zZ0+g
ze6~n6<5x-w`n*<2fpX60xs21KCd0Wji;cIb*a8kRAZH-QVuPzcs&ixlCy$2;laL!x
zAiZVTtmoCb3h0A7s=npRf+>s3wKED#5f0NP8;IpJJf8<Tv+0&UcFgh_S&f7RyVc*E
zoZ3Y=j$VWZg?K@tFM_~>{eO$XAdh|<W+gL1+Y0`xo~Lvl3uNwN37>A2D~{Tj!Qfv_
zgDfPf_q<q}Ee*==w~kPA$J|)+0V++j2{-tJbmA{gR-`Iga@Lu6=ny`2)s>yyTwv;H
zP2q-;-&3qb%)JRQ`DNK821LMKczP(Qq?;-f1;T}}so#EEa0`<r*`KKg2le{86&moL
zs2`4q0c*pcul^w03nt{DUV7mOQ8(fYQT@t>GM;r?rlqsAUe=0J(0qMfxe_bRdSJd%
zhJ$fAVM20n*Tm9hGYE|1i$MLNGBv=@bpHWig`Z7mcIS0Cj`;#n_Yt5W@;2N<Ont#8
zQAUKYCrZt_TDgdH&Ide`DB?XYIU!@#0&4^`i_=Zqjl8Q$Ni23hME6RNALdJc-3=}B
zEtIlM6$W_hGi%uQOsCdl?8F%)VRD^AQG~@t1r68hv2_H-@NSj8)I4BIN)2`nj@m>p
z_D)+Tot>k%Z?_M3mzb{kcQogQR$0$81apZ~b(QDE3fXnpEe`_rOCCr+<Lqwzw9Skc
zi#vPP+1V(9{75vGph{^2A2ydgn1(>A%cOA6RzAnrY6@=BmAPB04>BWo@E|CH?ci+N
z(ONj<JAZ}xn7alwyqm8h-=(S3$eRw?a)fmZoJ>G%X|ad#Y{Qyo(byUsVFohB#=B84
zk1CCn9Zuy)L$i0BX8Y5yBV)^FDlFE_j<GW9SEs4@vb%Ymc#5Sv^}!N8A4S2<K2yN<
zB4Q9YDR8Pb+@J>8J&=WVVQS?)R%s{JA51-0UP4BMpQ^1RE|YZ^lk8L@-jemEE37h2
z#u*h@QJF}#57aCrX#Mqg|D@FnUbl|6cXyjXH0fqCb(WqXd94bmSXC-U@|pdPq)67|
zkpq&5SEZ%z(;>6+umAv)=3HU~KUp7>1S}q^U$N(VDth+J-Oq|{+!^xjHG=ISc74Oc
zL*G<C+havPKAl=e0y}I4b%$I#jj)-2@I#s2!~L-Hi?JlC1<!(-`JN%7_PE{awb`)1
zihR7GSfS6_#`=1WQ*gwG*<vXDYL^LE1cLrm5$+CZ!e9;<2{d6zATNaKuuS-H|7@%V
zGt|K)+wIlC(aw*p-G&o5s#=WMv`1$%a718MN*Srb-;t_hX|w}%xWcWBt!W6maDO4j
z!UAL)o`yu#(e$+=@dVK`@!ME|me7rLco~h8sZq(pg?U(X5h<!AT<5Qk)^D-lxfXr4
z43fw2S#n4ohOYrv$9Z@p*eEUX1Re^#bGQ@~H0@5jBYS1CCV43Q&%?&W@D1t{xw#wb
zw{02~Gt_3}_Rwb`2+@95{wPd9VDf<h4}fi)Gt3|miz#Q5BR=0tnMBVp{@Xl{?w76L
zBz-fv0*NrjG6h4KStHJ*hK?^;3B<jtCWmV(dCm>^=E#}-jJf9fHg>+Jj!2qw{EI{!
z!^PtYyEQf9I963~APvH~G|6bVIO<$*yq^pdYYd<=4#xn8Z$6E}kcl^_&l00H{5j+#
zcal?F)TZumd>e|UNE@>mWHN~o*_lzzvIx;iS2K9z<~5TCE1RxAzr}g2*=;dT<wDBX
z`Kdsv1W2B!(wn>stDHbiuMab{fZ&GHco6r)ano%`#P9Z=VQtI0qL)z_5uF+d;oAaW
zE=p>1Ss?Gv*pRY3#rzL>7~|4$w*|`!iSINjtn*z5RakkJ8aZZ^B9Ospo=cZpKnZub
zJnTqqWT{N-tie?>4nWVIiuMrsY?#G7x(RRD0>=hwwFXrZ=fkt=DY^sZAaXxX`7AG0
zU`pQ}?VcU9a!}5oB~_fmT6qTj+im8$E(uJ=dB^1t@B0Ua3gpEcQSn|CiTTUSI6?q%
zmbCvfB$=MWab8;NoK>IPi2;WM?kh8^U>_~o?}|2=4WQib<ceOni4S1>3CrR%8ijgt
z*^C$&a_0MreZ7!rjc!&Y!!OEpN(Hs6i~9(TJtv{ryh2(2VV-pd$&0)Qtj?zY+1Qu6
zR^_F`77=>R8f}>aX{iJVO~n(X))GvIgUnk)bz=oyXvAEtF%T6hI+pFZ()r5U!=5>Z
zM9Ob-+p9#`InalRvD3@9qN8s*M!&cb_dR8z*en-91k79N;AOB;78YP8rKzltJ2)6n
z6{QQ<a(MLf$@Xz$UR;4{^Jz=qO5z0Mv27zCEWrC&k*J{*fCZ~T^BJ>?T)9GIl`49+
zgm$^C@g#gjGgrZ4Nfv@qQ^sE2n%>9h72yL*1+S8!MyPZ-k^+u!$9!|*_YbO0aWk@#
z!}^ZR39C}xp3jlE4H~P`{5yQI<8G`jo6WIt)Rb?0<e6`dZRHF+K&Kw&l&y0aLbi}X
zr3xSOkty&gxN}x2(z1Hxq;RWDi|6Ry95(>Afll>Wpjw15aMK)I!KwqYkt;AtnL~mV
zA}8WDAYrtn1z_au<O-5v&&I*Oq!&FX7VsJ<M)zDON5dZl`MCfAv*SS0REzVL7(Xi}
z09r__`NJ+I)U-!7jK@=?J!4(eAR3(OHsto`q`8PV-w5Xgcg3Z7F?oT+nuuJUh|;Li
zMO?adHv#)>X=R}TL_)b6fhYR5J)WLy?;svfp1$9oSE2K2hohy~TK=Xot8t=m{gFVb
zO;$xRtx~@lk7ZYR=R_1SB9l+oFspFf<S;-uP2B~AF`1R(uxBFjveB;zaW1wl)1lo@
zPN5-O(h6A|<KJPcnG29#5tz^{pI7>2RoaB|82)}<1-B*7=|v+$d-@EHKL{2}oac-+
zqU+FPA~`fQG9|1{p!Q8bH=>oS68rwr!4*%`7*v!f;Rxhq9CI*sQQRiZ24~x-eGOE*
zl;&s~Qim~qQlmr&SeT>s8NS#ghK{7Q!%iS5i|kj@zth~RF<^QYEV0gYiTyS;?=$D=
z<imM#75r`dx1lwa5fGG^?20g$n=+&T!#&Nqth;VaLP{FeJirf<VGunlsX9t)N&qtj
z=OlBfkMo!_e~Cn%#zi$JW=j^LIjtF+rm)90L$@4MgKmK#mIEj<w6AP(Y2F<Y<6Q2L
zP}4g{2R>eVk}J}Vs3f$C1Kz!4O!sdW$ga!$#eg{M)zwuS;%H&0R;|l**g@naLR0&j
z!!*^yQImSh{N{sH9PsHFy(V-XPA=+M+8GpWhNG-a_>tJ(CV#gaMs7Z~VRVBanpXTN
z@rzv7zj!F&L}~peNjI_9(Lh|~l<TMB(9Y*qlm(YUNN2X7yY=kCkpcqHBtQ_c&d63T
z9fTviNbAIz*02L=^fw6T-(a(V#-E9tsdG%2s08T@Jk1$HBQ{sClrB|cUAvdM{rqA5
z41_do2>;;S{sASH4-$i*u?S>c;&En;-sCGQirtfV+Mt4n3q2mhL&<sp_aC+qOVz!f
zZDrU(ZqR!Zrf-vLurPdPR$2Y$qEUz$J~6{Kjg5+$s^m<0`CmoB&g<6ckF8(Y)_ut&
zY&14Gmq-$*($|~pO3tx|)yvoM$8I{2U^)MzXCn;mevLI+7je|@iMg<9j}3Kg7?G5(
zE?|N3D3tvp!HdVnojjx!>A#mDWy!?t>7oZrJ|1sQqm@pe#|q)w%;$^jIyL;1jDb#;
z6k~>OjcGky`D$=9aYFsV5VjEQ*XbQb1-*z6A-TnFj#r~qWl;X@Z2!~=^Xo&Z;L_sq
z>|hnaWA&2hq~Y(RS8&8;%{=C5O;F7Blg?O)Tp@mn<0$hWb>*sr`0#ZycLPY-HOHF-
z04`78MiAIob(=X=E<~*l++k<ou0^<`^Tj45cFfZZxjrx+Meu#0=ed7BpIuMqx=1mC
zgD;^KsWn98=A4WBaFg|vnV@l4a+j+SF=fxn9U+%J#2J}crT{Ne*29{^;Sx(XPNtVv
z!j&<}%&E>$lRFc8HMwh2o%6mGdNRkDiCp2Kw|{i##Jb={Zj67iRoSpFlxYO+yO+~`
zIQGVyyJ%*yJyq`g>-sz9T$;7NPvcyOQbXpU?B-<DtI2ymVA+DEY7TvMf>XNIK{qDe
zkV}l%(ub9r+wJXR@S1cW(7{dD$iCr>;Elkf!hpe8^4yGJ080Eb7}@hMv%KUGKVez6
zq^^x_m6;c91%42t9N3)G`o7_h{^6dt!Y>pv=W#7i#9WZ5cx&T%5C<=eB?4b#ducx!
z!mBoI(3_3T@2E&VZdBF};hpkLct)JXe}1#Noc?DM`~}rrK|t?@+h&taJzC%8hM8RK
zO-@#?gmrAzro;Ec<i^@j1^@XC`eDYN$8#QC#zPK6gl8pLJ8~TxWaQc<j7#pZ7aWvP
zDvM)l<q3=eCS8&L@cxzobKw{dM3K)+@FH08>iKpm<&Y8dqw6(fA@FkW0=FX-xdB=Z
zBBm!N=1=)l)mxlT)eg>N6E8?bA~S?3#kuC^UBztzhIl`aWWH3aQ`&`1NWi0$9Bgxj
z$G*z{#IZ^H{=j<C@HR;X^M<Ce+UE`KvxaB-C=QS#bvr{W*G6!l?)f9U^BCz~)G78;
z9HpB3&K;))Dqm!zpFLL7mp@u!Y&upOJ!|RbxzH~(g-=F`dA++)V-WWHL>&o;)5$TS
zi1p1U-ka9J!4ZEWt`c>8^FCq4#rw|V`-aJoBa6eDUZmT8E^jl8@)g%;<AuQCIcbmK
zF@_0uRmkaHpn&+~Q#g4xP@HNBHwa>5eKXy#3rQv0Z>x+<%q$HPvAuKP7^~q%)n%zC
z-8Y|m&m^F&1QF)GxBLBLx}nl^9%Oaglp9&4`&=uRxQ}=)dU%jrvgb2Ao^6F@)?gtm
zHyy9U_BgG367x_Ztb@kvw{|<UD9@@_!k%FT+^(%09v!z%-U=)kx>xLwiTl|gPE!dr
zmN2|a^1pFV8t3HW%Z%iKvu9z|`G?OropSG=S5Awr*Z<sUN&d~UnW@2z)p<-!1Rrzi
z*X}lzoj2QuhpmJE0n@QL&hI)UO&qnz6oQ&JxH%2Gdcty^NTVW1J_q*}rD6n?3CL>*
zgvOC-_~;gHZE=l(owaClYrD1Li)W_JMuYE`X*BE!+vht6NUGRDh>mSPn^MOV(zSwg
zs~DJ}I&qk*cPh0$*lyFMtTC^cD9#-4S2}&nZux#u0B5d84j0begP1AY0{woyGxNSL
z@hmfyC9qwk{lu{iz*A9F!R5r+YXZ1Kn7}VXF?tzI@Z;6(zfB`1xtWcaXBoE0S<jyb
zW-!eM*#L5>5r-!45-}0M5Hs}Gl~{t?H0oaztc5OS@)Kn``Cd#{!f~%mC~rQM=_jhB
z`L?2ecagE5=;jdhIstUpv=Au;2-lsdRWP50m;lEnElcdD`}NvxaI^n1qcYy<Y)6)*
zYwz~Mcwn@dnZ*>#>!6hzN<viAm}oR@CS+@)#JM3^fSTU2hn;$x(MieIW5{nM>9c9c
zN;aBIt670Fh(8#gzFhbzX-;#al>4Ni*lz2<CcZO@*D~Ugfz1hFSS9MjMx#fa<RVj!
z)|FVcw3D>Xc^fzzVrOrA-(_ClU63oy!p953rYi|Pfc8hz34sq@Ua4ANu!NGst-8!A
zr{LvU%}m>Ht|p3-uiS(u6~!wg3%vp_Yqq0is#l@ttYm2h7J|WWM(8BN4qYz^9>u$+
zH-A2^jD*|^7i&%Ng1=9rsU!ep6;nE8F%|^6lA+XvK{(L3c#65k6xZN&ii{@!jwd75
z6R(*W?PmJ`QwnzX+dJDQyG<}|d`;jH){RG-w+z;}kLK-!BTn<u=8{`Dc8aJ!JmK>~
z#`$8um@~qdahS|2s>E}_(r)sK^6QR|78@=R^JeC6C{CS`t3K~K6&RUqGFbRB<>F*p
z_nk8g*=(>gSMtRgTu+P26jFq?M@Mhn^&^Cg`x-Dn0^ovJ!HSjJY8oPIB8vB?p@|LY
zdn{z4v_X7%g=~#PgW>#Hh93SwNf#rtl635ry>4HH73=3vL0LQxHr1!mTh}}a!hg;^
zo+iw<6?SUg+R7dWVsu5NCLw%P%BZ%n6;fiAHmvo~0Z0UlQ`&R}r*%gavdgTkW`6hL
z5~o>OV-8C?PH4P?)TGbGU=V*YPT!j`T5}Nz4Ie6}YqR=#H)?Ep6%0;pM=;fsXz<$k
zE>n$Hx4YCntC?LRo_yW=NGH?&5w!T|q;vYqv2_x-ms>p<(N&UKQtr8K6=ankKjx8S
zL=&%ML`%lDRUF&N?yJT^Tlf4jrA_GXUNCB(b}f8M)cfdgFK9{n6&t1B53)WlwYC$W
z7&;Q2Y9ZnFjJw&wC<jg~8nSlnGD&(S4pErJx)uqK=FnDU?;swoNXeB+vLfv#qiRlP
z7D70|!aLM%N80U75}Eb_MTwK@AZCD5vVde2tzgck8L`ECF>gS5gseiWVWI-i)JLw*
zSv9li**t(P`gw4x!K;j^om<_xAJ1N_%(|0d!CiI6$tPTc^UJX)495v~x-b9{k(<LD
z-+(`zo@+id*Pla_pEdyh@$`JHJw3Of&;*85U>I2~Kh-*EwU0O1rF%6%CMJIH(6@hL
z9?_R0l=-%Cu2#LFBN!O=#HI(WJjdgZ!&${JUpnT`qXo)Nhj%GGx>Mo1wOz%|EkJT>
zJ0bRqv9W>J^O@|5`f-DRj6|@nTESXQ{8pp4XNT_lV;B{$i3PzLmbP_j5?~`~flbq>
zc=LJML?2BpYVxg;L!Z>B1FK?(e|IxzA8h~BQtxTHWzdDyV5%gCz$RJYy(&3pSJ>5-
z9k#@*L4A<)rYFkd;C!6CkF0HjrYxX0pF|u?AboZvg`0V+Lnq;3Yv;7JTSa~Odq;F{
zJmS2Js!Th#DD9B3_L7_7!sO#X!|Ck4`ax~$*x!<^AaXXkR~jYJAsUW0tkV0<3D{Gv
z)2rM9&djvR;?v4xAqXjfzy?3~q*AZ9jxOC=AeD-6OqLU=pR-I(oqK3@Yf*mLGzamm
z<a}^Vsu=x7@hIxY)}jFhDQbwK=08nq+~|sg<W@TBPjNtAL^metUAD!>(FHC(PHfC7
zc@U^l(nsb6o899)nM{(w%2n9EFmii$<S;EX%@{va_{>MaYnlTcFvlmsU!JaSZkA$&
zBlVdrqJ`S7^q!nAcoosoEL0LZ5$xSUh1of2p^~#M_4%?l;iS9Rw5G$w%ep5^foJjV
z8|l?_0zy&Mtb{kAW7>Z+NpL)j>-C(4&4!xx{JQ>*C2~u{rJ_>69{}&pe^&SJmkPJ2
zD$)YlAcI+$x*Th8gwR;ziQTH%;J#I|>cfl@ZxnVjWzeY!<|NrAAVf4mUG`$uZqBC?
zcgoE#Bc#DJ#Qlr-%dp^l{L#J~j3)CKG(Kxtg;K9HWcc{8c*Brqu946JHcUZH!<#~f
zzNB&%ShHIxvxQS_vE@*YGc_rOLtH3CPx2W#rn)RFaw({Q5+@sUYrRzy$6lZ((n@J<
zZv2}Jh}p$I)2cZxbmsnUxZ~|J7&k)t>ll74UQ=v2<a8}vx<+9u(BRKU$!Jy20^c*7
zfo63q8r4Vos#p$vlv@?}XL|g@%-D4W0qbnx>K$nB9D2SmWuD2!=Ku_$x_C@mdgH*Z
zXaLLQjSp)<YbK$7n_g6K-(dD8xwyz&>VyqsMCj0q)OBqJ^x-gb5DhOUS9QyphP~Sk
zwq4FQT+Ej>0o5ys1a&lI#j9^1U6N3}A{8jhiSC*Ql=W0LNe?$6Ibl5SqA4`V<EC-p
z!|kLWS(jGVRYL}`EKC+>4Bm@}y<C#vI$i7H%b`R$qSMB-Z`#cyhuV&$9!@5E$f)Ug
z&}cuooH^3JE8pS=glOs`>1<1Cd4I@;>USEXXhvPb9uXwF9YGt)OExR@u`Whi`G%Qk
zlFh2IFEj$F_BjC@&c+ld1d+iu@{K~vG!zOw9mXGmUc#rL6e7splfZ^lri1q#^CD&2
zvEQSylW&PbwjP*{+R_h<l1o~!E*DOMq>6w9@#vzrDj};S3IX?1ci&$0vaCcEtxWpq
ztY+l3+m6F3r^!VR1ZQO<R|_wS#d8)MPB^ymp><~stXndyk_E|b#(3((n71CkJV-9<
z9E9R@f2Y+XHeirk8^tp(zqST>@v3|FOON$p7o56E%xJpouVmbx!nmKB1LqHuUt3*}
zh!ZhbTrWgTH*s&<Z_ZA4kA6OMV&8I>=NzYDF1Ml0C6IYesOH7FJ7zBJ5K>Gg;LVs{
zv3^KUqUJ7nreP%3F`KXMsK(&I3=a+@5flliV|hsTdMh>ocZIv$3X4+FY$I>9z?)K{
z{|yoJaS{)szJztm!m_uC&(VmrL(MQ193J86tm{AViUw`9-45E#hwI(SV%+?fS%XfS
zIjfI$Q99Dy^UPKqK%=^*s#h~JtsEv*<-7(xZ2fur<Z%D+b+dMsvRM}==!B`NuEpxA
zMOAmtPDjXI%Fg0|9w_J8aqHx#{WdXE?O)obt+%^w_8oN}B-{q;*1n}a2EBT%eR^~Z
zQQg+Y-`If7;OLLy?IvN~A?)Zy=hMqe@u+*x{zhVvXP2bkJ4dBGe%;o$^?Z{OqnmeS
zm(abJX->q>B<#Mw9CN;CEfsS>xJzP&Qmgd;IkN~50~6xzBgdyka=jY$9Si5ZK8cGp
zP5DTj-VVE0<79}~pjx9BvsTwEWT{CT8qIj;H~R;>nZm4!NZDmS&1Ns7(~iSousZIY
zuQJ>i5|jHb&3aFdse>KVsrzOrR<6WG3vNNeP`HNmZ~01+K^sc*-DDVv3DP)Y(LnvA
z^QDxx=x{m`4_7O|mB30Y%I!rqxv+!=-~jnvxIGhFO=uB27Sb%4R7a;ouaNvxFPcuE
z^ow5IWVCY|o7fYc^DNUHkC>BN&cf|rk{8HWD&k%Y>WIFj?uCS8zF}H_9!b9%6k)8%
zm|*n#_i5aH-@o<d1aKU+{lM-xBzj)_V`;!s_7`UEqtpmV8;kLRc_WF#V96$;RlF0D
zns88ez*FrTlt2bhiKM6O^^E9FTm{5I5VkPS+%)Ipl+AexSkl4?>)fp#ruMnxoy<<$
zHeW8pzWL>}W<VU1bBesidQ67H+ncZ$`fnbXIaH=^nIVz|lf(i;G)A$;gIvO%Nz89E
zja#I>VV1;e3|q^b-Y|3Or+#K(Movi&?As$%LVHV~{qy!df?2AYQ_<A26kCGY&#I<3
z5@TwrsR9}7gVnsXG;fE3uci6;_L`+#7FsJ(R!J)7q!*~fTYNw_v!uiYI{Sx<fSRg|
z6=h<LAXb2C_$Q1EPM3Nk3)?G@D7qu(*jP9PvxBbIPcmF6FtXfhE|c;`&V-k#Sw~uP
z7M)mqEIBR#Wd=lfa<E4nFefWOI|WOO)e=*T!pGWX6s#}`?lH7&Ig9x)x(Vnk6Oyfg
zb^t_^L)OgEvPraw;1@lB*Qjx(yf188gIPxYGUp=E4(&DKf`eaU2<b2!rB{5=dBdpX
z!2M|q8$L6bw(Zli_SVc{{mt`7fL)xv5Lg|nQ$QHBe>vO{mRn>cK1R|B1>RtPc##C-
zG;RjV^zUdgcH{>98#0dGxykZps?;CQ+dTS7i&iq!JMUmMAx>yYTM}wI=U}9>I7*UH
zy1J?Y4<YsU`8YpEUV9kvg-8&s5^j+3csPynq*6mQ01}xJ&Yq$-VL30V2YFd|$t>E_
zn1c;V{zgM|krPW3rfGnjtnmUBSN0EqP#|Mw2^mW^kT;K3Ih_zu3HmXvdYa)(^#T{k
zxX_w%w3_{jE)#j$U%tIXel;22s;O0K!Xod!nn}h#591fX`b9_fw}L}X`SFscHG8oJ
z@3P0Ki73p<5(__hiqdVKZwqhhC#~K6wuVlT$gSq)&|Eh{GSic=exfEoDrL|#f}hO|
z%?^(m-?+%o^}+}-{C|&}n=dtkR_-PlF@4XFh?sWsoaig;x#$An2=u^%O@E2yd(%dT
z;)s@`2rSjDkqV@m{b67+nXhCSugq<?8QG7x-B;4Ad%fJT8I{U}fg=cJh6r22tT`*$
zA;wW(DmDnt`YRXpnS-=^$9$tH6mK+Q8eA1VAmHoyZG``Dk8kFd#TQisKLj-+6XAR#
zOhnA86b0Z5NK=hj>Y~zAWDADUCN<f`!y(5fF13F<k2ESs#%HOKZA8~@h*pJ4TeTa`
zC;Dv|1u+DWj>Hnk*h9M6%VG0>&)VQ+$iabxVbPPulc~n`KlMTrnJ9C#X~gvBo@bAM
z0kcXpGe}^*-3Hv(f+j}Lp5HFqj;B#-k~@|e@;<}5N#c99L2jD!$%UsxIm%Zj7;)_q
z`^EH`+!a_nUs{>qJfkvJA*(E*gXY*UL&)Mr5wg(*laXj_QyBM)*)MErON^7sII(;g
z80KmtxPnYmzC&SVMO`~DLCM5D71teZk-4Idjc|S_1^<Q8p?DE>{ksCtpSfmU1^*@q
zZ9H{<9w)+~YwwP3k3&SijwbGC^TnHG4|9B2S&_;~&gqpI_+~lygt;$0i5GyGul+0A
zWJVhZ9*~U=ZM@BW!s}%GJ{8w0n`ukpQspz&#GLDvN*e1`F-*0Y<1>5FVqh)p-A2yj
zh`dl9f!e_-x!fbxn4!Fct!f5uFG}4%J2Fc_=(4zVZE?hzzIlL%YgfJTubc0jE={>t
z^m0dzaLjB(6RR~J<?z!n(%Hy`3@UG?W@SkD6#Na`TH-9LmOWKk@x=y_%^B19tO3}7
zmr?gBsYJF}&6oyogjY78YHE~0IETq~#zS336E@kn=!LhM142X^xa<==9!#!{oW6&F
zKq@a1UBk+$u8bY2IA*LIGzRUx4yZL(Z)_&U@v{%2Ax&;G_X=}9ATZ-UdOf*bom_WP
z8**)Cv8j|3V(}*GkD$viN4h5N<=R=KLE=7?jm=`NGllj`?$Jv(AZb;|M$MtzRBHk+
zEG#3N8-e7aY=gC#O6Mb`X1m!q=KbLk&2=+rVVyM&zzF6gUOH>#_zd+tOS7<rn(osJ
zWz2|{huH#9@S+js0*{&I4yQ0knGx;tXEna=;kNM1i;>1bxFnNo(_}Vb@4aS#Q>ht<
z#R~3<ljt%TBkyZTj8F#)gQrzAtj*zAQKXE*nxYOW22M1tock??T4I*LU|z;c@J(B`
z(cOs19s!q!=t%%gGv98NBWe?<XoK`LgBqXHwNGoqM9!jSaP0xL_{5epkQ6nfezl+2
z4(H^fRzf5M{KPio$fHI^)AMwC{)w#|9>E*p_>=>Mhz01ULYX!ngJw+cJ{dCYqZ7`M
z)6rqoQo6Tyi1c+nYjA3xPoq;+{HG2N5xS@q_DuNHHk=HNXzG1D>S(6J&uLLpVVV{-
zjp3&vX!}P2SD3#4bZ8-oX;X5PelmJ;d@IJz4vgSGu^lhI7q#Zuh~}l?CGk}Ty+Vks
z;(1paNEMh6=H+_cSUuNt^Nr}ep_lDwqEuaJYBQ_vlH^L_ZGyinLg;beELap1n?$3s
zAt=~)?0F@?&jqeFXY`9KEY-{41tL$r%uLv{r7G627k4N76NtuPyx7wqpLoh)z35T&
z+`B5cX7oW>nAQywruB+AE<a4GYgvi6zrLg6?H~7Q^<m<K)@smgriS9`Jk&$dcw~X+
zsH!j@@c0(iJk@rN&JIs=6<NN6G!P{oIo6m#+R}?G8qo09!3zj1P4du}B~5euEVhyl
zMPKZ*Q>ejtMSp#vk5<4fyhO12cQdDGGm91H3FbM&_9Bvj%LRe~x;`^ixZ9L4VJ-&*
z6lll4XZ8s?3Rh{@i-RpL_&TykR4AVn7i+hA9hw2Ib{Kt_)O&G*)jtxgq?{@^E*9F|
zPhp?hDQXZ6_MSvYFc{fU_2MEpW?^qoi-#A9kG{DmxMfgN2(N6qgq5S^(v&y7c)1c8
zcd-fYAuY{MkUr+YYr4!r;TDyui_VxSV$H<8vKze&Q(R&;4^tNGzowz={Q<n(3LbjO
zjfy))W%%RGLWE%I2glHfgb2|{AzOj&dpg+KX9uU9ec~vddrSXYE^%J|D&xXOgs9zS
zZC{f$nEMK=^q?3lS5-M{=WN?Tp#LlYfPX@<>*w4t%?sjohoRL=0vDG>Ev5}o5rec|
zcZwi>u@k)5mR}IaWuh_*a5uZd+!^LpT2W??h`q(HEbiL3n@u~1<^w^fN(QGe=sOIx
zH27Hw8ImC&(;fR?<ano?&9+}yEw(E}PFfZPfBo&<x1Ol)kNgHhLNwWAbpw=&>%C?E
zEDzAW9Ztdz3adQZlMIQ>z%0v&NppTH3L+SY23OMoVyV*Ylq1(j3KgTXhY<v4aJUFI
z*4OFEw@I8ieWT0PqaT~ac<anYar39i8#G)O28Kwl^^<@_nfzm2LwX!HKj=B!(-0xi
z*Eb*KvoG+_U7H}2Or}};rr)2wsx^m2Qi{gvXl<FBblc<*!P0+YxW<Lt2&_))tD6@;
z)|$N;tsfjLFWkxU?4I5(-qS+ec|)u0_4OTly>r)d`ak`Y{y%LHb4GGp7>S352N4W@
zp{dWJs)^Aq*yP2~)9g@_ODIKCX$XVB-y@i@F+;2pR`y<qB?FPoxOKtW4>w5;?>5?L
z;RUjDTqGS%NW@o%+FzdiZTPow?fLAo9YoTYXq66qYR_fLZ>K3+{-#K@&}a8G4jg+9
zBMsG$o9sZLokuUYhR$2V8H$aAH69%%+JAul4e8-wn7n3Lk!}Vj$Tlxv90XUh0g`JO
zU3R+4d9-ykQq8x9P=LW?FakEk)_rM+YlziXi?Y|fbP;84Q^zpWGJ;I!ZED@z_>wFS
zm#Gtji1;1|>+#%DwLvr(osZumLljplfWN7(X@wV!6-UF8k5{M)P#FY_0Jlu{#^Vjr
z(QgA|qCvyxj&AEzl4ij}(HHdOSNes;U;5knl4n{$m28G9u30gIN}Q^+d7L$8Bb`?p
z$1KZNmJ3Lw@Vs5D2>w(<5A`DA)aic6iHJ%{B2;zMzu?>=nc@978o_8s+%X1%pV(`h
z9eo*Cquxc`WIUd77%FSVAp4P!?=l+lrL+ozA}`}-%J*#A2F0u*ob7QEpr1jM`I*8I
z3r|+uY=&&AgQtpgS!!!m&Gh@)EnI!pn~3M^KX6i;@^53^Wu@-y?&DN>?pma4R#JnW
z_5q~U95}kBswi(9&P7L`HfvO(#um5Qtv}GR8m0%gmN%QSN?8G~UN-BpO8VBT!EUIw
zu|{r&8<`SO%;8)`w_Eh%M{lO|^M2U~WX1g(x0@%8n(RzDC5|WZ(;|8=oK8|Mf`76y
zf}8_CxUwLuwOGtu?kYSV#c_?+USHIF?XPDl<N2i7iso^?rhPx59UKxb8P&>%lnuEo
z;_^b4m}kfB)9sT}LS|bGT~9~6)0~l&&TAnf&s@`~m~@skog0JX>2V5{UV8jW!^AD0
zhnnCWZZ#P#>V}g#el;bjVIv3X4B1KylFt~!G~Zjwp?^#$*qiV+%_yw!IXJ$%SMaJV
z7~*md^#>&h1UzhCFP)sdd|-F<3H#wn??|We_B*CX(|mE|^e$j71_~Q*M76)@HfMnO
zuf)GVxuR#^q?JW3W1{9);l{i&oYnQ&H*sa5^C_He;@+%=fSu*<la!tZ{Qr`-;kbL%
zIj1wUd;mr|ivZW1a1@t!A>h9b$JIqHyWI?C@hbnnq?nqZ^JMpDywA2o1yH8LN`Ote
zqYk)(@)-*PNrGnBRFscHj&dZ>qaw+$m(DBJqs>xY=IZzIfn@fgovI>)+#Sa5XWvXq
zUQ1vI(DHIXNDu6uP+lNTI^tZIcEps_48z|oY!u%4sdducKRWbZF>=0+C+#=e8})|&
zj!v;j(yyB$yVwR)2AoH8W4!?pTS;TDuo?Dy%8%um#4hlkfU2w#K^D^q{xue9x&9h(
z1m9dOW9nx%hyON=h|+A2;zJO$Mj0%&PmkX2?{v10_nY_r5?>HU5Og}P56^Zw9j~-`
z*wim?_YaRwvY*G>r#o*BT0gZ8=-Iu$6ilwxoA@8S81@kB!TG>3|H-4yqyhQVDDD+t
zZ}(5>#A*A)<!_j+{=xh8%n8!K8>?A96vOqV*b^0HWW!XvtjpWA`okyd>&uWCln(Lg
z_tM9T?fJL%q$sPC?VxPV&a-Dhtu~`C_IUWA<XL6C!iFojBxop^&tyL}vR;n=l<V*y
zBw~+vc^~LV_Y?`O52KLI;cFAmMqHqz`~xXpa1L9HAF*}ZGAel~J)Ly~<wR|$nJT2r
zvv2xk#L+OjS=`pDk~A~hRC!ArVrm?9@duHG;~}v^9q|o$_Ra5$RT2hjcCB-XAe2q5
zS9ZST;*FP=(wCeAR>D|y^r+}76mt8d5cJ4|GhZpb634CF_9P725uop6FqbGq<r_Hz
ze2&Vy7+P902dC09c`)UOPEp+5Knx*I_opEA;MXW@*|#ET_`Dq};)<Mw0d93y^yb$m
zkKW}jd!s0P->G=VW&$0#rBs!f@|A}>?I70V0>w1h$s$F^X=O2+<D{g3QYe*)b*6G7
za(`+Et|PNn@+M8CGBHf{jAuc`ogq2$9?r}{2V6hyB9{vPJmz1gMm*$nn`uchC}w@)
z#}7e0!!5x0(mE{DujawocIWjDn|d_Y8!YaogTuKVx!PgEu_LN@g~&9^gDXj&B#398
z?}n4G?%w?nh>@_wX3<H5>8QtP1SN|&WL1blkH6=)I`SRy|4fryUJ(he3eW7!2~;AK
z(ElR@9ASSVPBq>~eu(~Ua2|8S6)NwgHDsqf42)|yNo8<?!XXRc<x`V8MaFC^xed`)
zyAc1@fyk86lNa5`=C%kgi)ku6G<#{W1wuOBT~fJGMqBcQa#-ptf~RW(#y8!94nBDW
z?e1<?jjEzzVe2>Z`=Y9589``fzZa?I5{TyDYUQP*FY8`K=_1t)(J*s{D{@DHh54te
z=5|OWs~YslOEWuZEZqJa21fQ~*_APyaRn3L!i1FoW<Z(0zvY*=9OxEki~+n@gFv+f
zS`<88yh-|JOgHY;&5LionNvJbvbMk|SkN~eEl^UUi7Z}n&VU&?VUpF+Z&B5FosxRf
zo>OcbArH;4YOMKf&FECh-j<YHbjfJ{f?X_QFAL;iu@;p?EYhl_Ce<yAi43v<F_q~#
z%~vq`7E-0%JH(^9)2xuN3Kb$VyO0;-@Unww4GH7X{IX2X=HmzG;9{+!sA;rp+IVla
z+w3;IlCzp52=QbF#z$v%yT#)38XqPT$<9Kn4i^CC)+&I8^2VZ@+op>_Ke?Py+Hn4I
z&sm_L#3h?ikR48EUH!O_S+WY8V#?8>>ja~e<S;D1{q@7&Z=qH1XhedJ1kkRUiYeYJ
zl=BZZmv`~s@M&8rDw%bP`!!0LfkoIazfi_J`L{}9NbDI@d}Yy^>1FY~9x@rBFBZ`=
zqw+;b&y_$bIa%&rQ^Et>wVFA3W?h&Y`BTL&Tx3IinAmfp8UZX1>W{*?t@|8ibxR&w
z>XphH`=T{1T`93B!?+yN>AiDrl|{_(N&md}LKSC~D(tDk>#8>JD*7-PhcjMP)s^Mu
z8R%1XDHj8e%yHqQ-44t)gEMKjKkeBhuJb<L@gN}_5!&N7SUo`-DX}x+sNY+xy}AjS
z!C{Y*Vbox|qYzPMIXDqtbJ6^Q<4eXI73n4%vw`%826`U%<H>D7Q|g1P45*;Ra)Wq{
zEXk7{IqBZ2@S|jj5X)T8wc=a<IIDgyr&tLB*~80!_wR4F4-SrYItTl&%JnN{2Ubq(
zs3#B2^H`3mBRPRe1&2;)807Z+vbLz}uV5kR$w>xR1u@=n7W?HhWqD2%nViqXC)_yI
z^cKM?`TX!z=w37vIuyn7rDH<Q<`w>KD>JGgrTV(7s4v=0pq5F}%Mnl5o}aOLR;P7i
z_Bp#9Wf5pAt_2JAm>;lnVgIK_B)Pj_z(KPzMoe5#D@6JxDROedV$3SlL#|jSyo{=p
zBwExiQ5AzeV~OUBBDYi(r4dH2dle2ZBcf8s-Yp?mP`T=|hAJ9uCmveVEr%S++6Gyk
z|LmLJW)}3~_*B>+<jS%s09zDPHf?~icn$7g&VmCs)uyX_`Y0g5Ll=ORTR6q7dOEXR
z9-t{dXF@1%KyZgD3S>K|8EaA+`)E$lInY(w$XjGC@Z7@XjTd#_h8F7HufFlP8@q&Q
zs48lt{y*e-c%tgzh<5PXw3MtnbsI#7iNLNyLD4KH?(@e|LObqKspMW}LJ7jMr2LvQ
zBeZ#OA)uwrR)ba#o#%?p4)ukYpFae(<UPl~i^k)U<@S2P7SBil2l%L{kmX9s=5)Up
zuKkAsx4N=HV?pzEw)tHt?U`@4<#!%l4klhR(XK2&+1=IzA(pFJE)b+SaCPf^0nl>v
z>xDsE=)4TN`Dkr<`nDiK&5!wZ^rN36PCnJ))8=*Qq6HK5nP@R5ZhLjpN=a?&Ma_+!
zxV2}_Sr9M8lHubWOhT<oc@A6loLK&a3L5d7u5Ia|k+sTKtd98Zl%GbntU;DsoiZ-3
zFc`b;nJq|pg&rLcw-B&u;j$A9A6F{ltcwfLg)7;K84#BwMPHaMaOoaGHhRqc^rBHL
zM{iD~HHpc_f}xUf1U<c}{%dlc9$lOgZr5M!AAv}8_7IM`q>|IS2UO4Hv<$zMDahlt
z-U^EsLVVO6C7OgybHw`vl8cKD3=80~#t6Yqo0%6x^*H1d)*V?AO~2xrXKLebq?&{5
zYFFBJ?nY-m#X(m$60GE3y8ZiY+beE<!Z`ViH1Uhi*l+w(r|h<JmpS9Jw#>3ph-4-E
z22ubA_4AO(X#`778)1#(u9<WryfHO<%_V18fnX2g|0XZ(GKj>0dKrBG{p$DMHw@VL
zS8-Gl=ii_93xxS7#aVA1eGFFgr*g$(+5m`8=T7F5<qpEuF9}7!?IS}qje!HB1{cU*
zwGoKPcp%o@Xyzu;z=BzV;)+i+Os1Dta&+b3Sn4{Gjlm3cIR~P~S{|cag!p!&F%y1w
zI75rzEWgrug`M3x>o6+A^hL_MQ@um^8IlmMI6*%1574=m9CVh^%x}#MR3){_3>2$r
z-KRC+!t>Kwa3Nf5p?ER$0YU)u-p<IOfmm9fYZlF#E?*>@nej2#DG(J4?d+E7zSDTo
z_GOtxAQvA-6JsdMz{#E(OJJWO7vzu&4k-7ou~>`wY0RAC+%~J{>O5Vj6&E%YAp6s7
zxESRsEovOYayIjhuOTKYmsOe?5=+RHotBsPEGs+7C<RFpDcP(JasZ!S*ahoiW0B_H
zpO4ZiQE_hU(!;C@k_H>r+@7g^>0tP_iuhzR3yg@Y#x%v`{X)g)j$2hO`Y?*&p#=%l
zyfPg4ai$dAlw=0I8;&}fVNNVrX1Cwz-ga>x9!)y~Bz>~yPDLfCo#zbPq!I62#nmQR
zw$LCZjIAstkw#gDKO{bdip?lBLT=A-r9%c%@T97gn9fCd6ssK8Aif-Ps&BOqlT;WL
zqhs}GN5GwS*nhx6uw3x&={ILV(Jwh0lzv(2{thjp^z7EHTZBMw7JlT4(wQ(=wCrdc
zUBn-%M=>3mASoRVu`Tvl^GMc0MSIi1h%oFHoJmK+oP;xpO6fT|yKw%5tR$Ys;fp4^
zU<YoM>Taq9XT#~hA*6H4Y1}=p&}B5)cWL<BXflqwb>uH<ciy&6Pxf~@8m+V7@mazP
zl$Y?%d0(V?K`S?DEHaA27DC${pPe?=;6CwL?Hrw*Ry5?v!QHc}x|ltt<`l^ess#%o
zb9rS+JzlV-=N58Kt7W>i&o5toX3eXor<U=y?yW(KG^3K7TC->19a{?&6M8t?@+)_I
zH5Mvuj<Fef6F$R=7rY`r&ZpSyUdzw2q7xn`n))%i{W+dowRja~IpK*Mzi^N(TDA<h
z)uqj0c9-&HJ(S)|%@IV`ic`Rp!!zf#E{jy$$3gc=HIMb!n+5Btqi-IDELgbu_$#5r
z<+sbKa)mo%<sj$`o872iw&K2-UH(rp>+R1J0XTNxpKqJB@J-Sgf7t~n$pSP~n4Q9_
z_9{syHdyKpa75ssJ<!rI=US1uGpn2zU^)T|=6u<RP|`~j1*^rva2CkdC<su!L6qj-
zE$P~;B*u;Ot|%t197&-8Em3HtXxXOJ^^*qd)%}cd7uu;D{wGUorR@&TqSQRbEhNEI
zszkY32>BLg+1q$!p{b^QuXor^c$v&?pV^>!_BULi9J;eKwS^^}QMg&yR+ZX5DN>A>
zfsf4}i%xCAYUCk6B8k%$aoC54t)0`>Zkgc$k9s=dy^kE9B~oW^3?)s}+4RT^BOj{H
zpdMC=%0-Cmh*)?H>TzYGvbW0FoStkSw)a{mB{fS|tGb*mk{29Tk)F9@D%<2U^{Zta
z5GOE9p^1lPtgJ<RDs+W@0{}&)DJ*NeLQnWdagYns1AM%lmQ&1BY=%O$vEvxFc&&bP
zF<S^(T5FD$rr1k0)hP!^iG@OOIX<x}05!jAHHu|=-eS8Y_6PWsD`U9JS){;kp9w-z
zOnW>>jaa%J?^hAL;_mr0Oy)BQ^ige!=j-b5aR-`JuAst>71=EKW$g$BEr9FOCaWhG
zl}Qj}exWlFD*oz%${%--ICo0J?Nx6P!^C?-m~%A9FiK|Pl=8Z-Fpyb{@y=oe8Ar|q
zL*Hn8n_M)F{fl4_4_D;n$|PBlgu+fDUU|S?MK*fB6wf+bHqj~i9Pt9acE}mLbeSZ*
zr9zMj7kUGPqvO_yJj<miZ`xN;92nXU3syvT;TN;UFi;E7Imp2SaVm67qN1`zrRi2L
zMPcX@fo$9>9?)pz5aB$R`@`ZJq*0+SIgSBuPNJK5*z<dCKIq4}-O8z7>h(V2=5kla
z{DNYIQQ~8=6iHt3Eju{LfYKi}iYK{-a}}P&iBMfA6OVpn8R#+5(38$V>+oGuJBkrp
zn!l~QlwF5>mnD1*4GkP>@r@iq;iVHp*sI7HP^7CWeutxv(jGjHqOpykql01rYCJOW
zw5gHi0}O;?_O5IcPZ&G#1Tkl)QE|lhWRs6ai?B%PO+4vdnLz<v8SJGC8PZL$eX#vg
zOHZtyxA#vwuU@zH$;s)nyVYqO?iOqCpmgPHH(_j?MQY{qJtvy}z63k+{kEyI&a1P7
zALsOlT=pGgzx~Yqjt&p@4_k9OqoXJu-f?CnTrS9@;qN7`bv2G~;oM?#)ZfC`%P~+k
zL}p9|J}hgl6L#OLCE4e)Fx=`ly=U=g>zlNRow4;zugT-Zg9?6Eu0~tnqMJ0-t#3-z
zMdqUfw5gk>>CuZmd#ORC$2VB+c}6o10B8_MR(e@N*|f)RzpdhbT+h9Q&Uj_@km466
zh{9S{Meg9D%wtr<j`fOc&Mh-rTu>8!bCHs+|E`S?Gq>Oj3v|CAr&Qt_)?LPNMHtYJ
zhE+<(%V@HvP=}>VR35U`W$Y?~kqWS9NIt721LmmC03G*c6?Erk^0dt@SaQ!RD+RQl
zTS#GAjQe?f_PH@XN7GN2XxmCA=p2Vk3y^uCGoCgBy4g>?SfNs&esb2{evQ-RV6PcG
z(Bh35CD{Yyq;*K8yMEF6`yFvXkI#Ipm5@QOib>g!p||?Y`jb3rXN3@2Zhk3hs>6;e
zW5)gk+N>&`4W6&{4TaF^m^#5Zp$Wj7GhV|2W=1p9+09I6HPf9jl)}4N4U`R{@J=(B
zYrJH|htoGm!CZlUgV|UobqSLOcg3XQa>Hg??JlZTykym@Yvq)O43WVMa2MYB;4U^&
z2J*r?19A=^Et)hJbcW(Mu}n3u#%BgIHTgIGX$m$(*pp5ws$51xE#PE#!Mh^mHOUMS
zT7<ygoi+P%%ByBHMeE`(I%lSTPFIz*+fOIygp%+R;ku8DS##x0mJ*dyEiIT9^)6Xa
z<*qv!jF4L>mp1~k^3q8)a+y<$jvM#8bj8Htab{oo0R|CU*L{{*^WbTb;V-{N+(By6
z9q>|hzDb{P7s8lhS7zVXv=?u;Aj>Wh$u<39N=<h<TNMl%J|#)AR$fZ5e1a?-<Melf
z=%}tjgY&R*)BJ4^cgKm!PD?ad7SiG*^FshP@w%E{<*Kil!X+~5!h&$;?nF!0S%;iq
z*YAk<Vjh1&MqNV|I9=mnL}3w<$krSG3<{CahL-IjUtt`6up4|Fd(Yc&L8(6&$40Ly
z1NAGnqv$=Csr^Sy@;9uz0hpZ~Do|UF@&thz5h>X?E(pnHP=F{;0kr)FO=A^N)joM=
z+V$vsv${;X6Jp6(`-oK})F~{IIImi9V`(Z)9vc;F25xa@Z?W*pmx6u<HuD-LBZh3@
zXp?a4pPfuVvP1m|<}w`lpL@$O+qu+LMY*#%k#Z@n@(}qkx((PW@H1gzj0^wC$Ni7m
zO}<h-?X3xfaXy?5H0f=XsSn#$2G^V(*B4T83iz#p*<tVe*Wcc);%N?HuV+?JGx`!F
z=V}C4uKxv;eZBK<de6|7oQ&GB{0OfvJCjL&*3QP~x26l1X5h_4+o)98<vrDiEs-g3
zn04iaSEV=yEyvX%2-EkP8`;fq7vQ&HpPTp<noP=FldaFRgaCC*DM!JRFzB~YmX*s-
zcL#8rlzC3(>iT^b^}!UmxKF>$_pPn<T=IBcA#HLe>G!E1rwgfGC;wAEwjY@6Jv03-
z($IPnFb5FApgRuJE0Y_t#0|OlF%$Gof6b?fsc?2n_HxEAn=V^bI$Z-3FJWY`<z<|w
zN#(M`v(=7Gw`iBkW{EG)QqM=91iY(vn<@1e^;T0(Elr1+dtf{Hzhy#B>dKOwmnP4p
z)G*!s6phb`_Zd)MyrvpPfv-@_+T_E;&?9=mhm>Bf47>)(FeZMZ5@b5#i+*@Xs21!T
z?6(e2JG-sJUplW2j&^?BKYZ<{mR`=56Ta5kAV+CL-uJQw0<<0^UiJYozC{XL$mMQf
z6=742YP#%h2w!c<0~7^sj}G@wk4`+zY(D>aP}5RDoT4rwZr<qj#)twtA{lnAa=8o<
zi7$uA*me$Rg?)$_ZbgI+$`B6?kR{)uv-699W&K9Ob|zSBN_`|Q%Psd&e`xPISSSRx
zdp+nbPl+kFrkyf|wAsyJP==++dz&V9YyKyA8^*)?b4zkgV@{@d6?Nb5GrWEd$HROY
z*Bg0e@eTn2X`3}o+Er|hWo%D5a?(*hCZ71x#>A49=x8%^I6Odgoh!2sTvs`^+_GBL
zY5v4U8-<fv27DnpCZ-s_IoVM}<C-xeDAx?k^!(eaqdfb=-K9J`Ivsh?O=luHTst%@
zm(6U}r%UjMPKTk*-w{g_n<myAB%;g4zBkj^+dpX0RG^5xNJd0BYHKj>UQ2J&wd=uJ
zVjIvXy|rd-Y<2~M;e2`_$zd#<?_Z2;Lgkf>4E`6yil=od-+c0@i85P7NyA0APgl@7
zz0Get+myh`E$9M<?oKiKa3~x@Lgue{mwF%&dxlDAH3~r`1mO;n%lg4V=jZK{Ln0W>
zntlliAmdys5vLwszaP8`yYDZ@k`4s~0tr=ccMj+Y>>ZMuEG6==7lY!j2B*ZN#2+Ln
zdYq=y2%9%px*n_+d)o>&meAK)G~s3JPWqhlEYLu@NYs6v&^e4t=2Y{rC}CZa@<Ca{
zThuIe2M+@IXb?mry0{=Jy;}3mWdQW_&GCNP67HTrNIVKX*^N^?s5cge=4~?NXdJ;Q
zEZasQr;B+ry^Mn6@RB$Ybi{dInU~P(1V}Db922uR9!7l)I(!rN`^0*1`fIqZ4!gGu
z6F2#cKo?~vR{<ZuWxy|hE$Ut&uY3=g{D?2$-6MUk4F+qIZ0MaU8v2MjTGOE}Az}8I
zmZQmI!Lr7TDm;E(!*O>NaiRN|RWb&WaAIvvVb5t_qsavPS$KgvWT?x#D#H&3nr@zm
z2}B4494SX|<FwwgBt2Y+xZfq6#uD&jX$byrso^ZJOK-yQ;K?JRH}{mAW`jo>)%&=g
zNZc2VN7Lr>rNgNugAp&BzJa_5gIAvt#jps;!F62*;fS+?6HQDwoD(A-(hQB0>$n#&
z&|qoKZ1~Csl8Up`K=OxY$(&PaDTRcT2P0`NeP<yw<eonSWW>MjP{ol=<b6#mv1O@|
z-vDkBO&VVreRQa;Ico|;H|k%k@i6I5k<nQpsvb?{=Pa@b>Kpm1?fs0>nw0PyN-MZ1
zKYd(Ei^G+!bHfX%Ui+s1VTJyq@jQ^pJ(wg7|E%L$#6bIPdtl=m){89$FlYh)eZhe8
znsO@PmO~hT15`%h;?Of1&&I=ogvuZJavFTo!@z09a+g9e5~MAeqAQSJ!k(K*!xqWz
z=XJ(H=Wi%EgBR~wX^tiTw5FyEUv<>S2Ih?u9N^GV8kGu_3khE?g<0+<(>|dUtjr1F
zAw=VCfZUtll$V3v6xRX{X6_y+H2!WhX6lf3iOP)QBsF2zr$f2<Fe{b<<hs{n5NsmJ
z6rGqsJU*puh5_A#h}r%@D65<b!NtYK(~ZrG?;k&mHlJRspRYgN`0nYG&8WNaw6`Ai
z&Nm)+zrX0MpQD{gJb^R_X^v^)&w|mV<Twmk!xXWXI5KE(POZ`iMzoo6CeX%)K$;#*
zh^-sb4w>Li)u^Gx6SEhv-7{Cc01*jzL8)275uKu$Um8UNKD>w^nu#{i9BA))kWkU_
z4G}*k9hQrFOB4}d%=eP<`&ZM;9RSbgAPlV-#iQt=_v_|6!ufx|0Rsd4LvUdf_c{~&
z>kx<Kk=hM5gXO<Jw`~!~J0dEuCX-BFKsm*#oOUUl)O4!XJ8k5recfvB|9h+9l%;)S
ziaw+X+N#epsiPc)p-X60R)Ld-jvshNvvOse^n*I??#VEcIArIy3|E`7pkeP_m=Ya}
zqq@w?jH4MGpB$ZbL=*gW`?#}xcy##7+oQ8~@R5HXpX~p%ecEa=*w!7=H^MeViM?$i
zpSyE;hoH8{x(KW@52W!d_y!b}cyc}%>h$k0Y0P3V`On{JCZpinGT61jpECp;;1Sdw
z>gmRL`s7%qLh(3I?8WAzy>xQ)@#N=^Cr20}q5Cy)21Z&WL_tJS(fCqYz&W1v!{jOK
z{T3o;Y4FqA?bHHaDEPqamA^N$!8;2;5a;hdpX{Hu97v<~iv@UH55jg|&V{mz)+>(N
z;$=eZL?7Zw{&M}Zm}%>A5B4m9g+F=)^BH5;Ne&b<|7F^j#M|Lq#0Fb#{M|8&MY4;C
zFxnvqnj;ZZN4P&uM4%L69CiC)JRn+#=85YWg6(;`z57#V@1)hb_ZRvZ(}u85g74fM
z(7G1FPUV)uR+$ZbX!>pAvB(g^Yl1zeJx07gK2FRL!n2`Ml1b=vK!t8ykqXx~<UMb|
z&Z~u;*4jV(X`3!(&Z^u28+5jR3Ni>IdmhD1?#4z=ixotCZo{$5?I4u_;?`oeT5>at
z#_3f&5@wWOC(T~c*}1wXMp-Hf+Hcs`fX$4QPX}d@G@KVnHh$a&a@!Uy)a3~I%uT7c
z9JKZ27XrtiVZgz&XOy39{1G9c?vihMde`xzjW0Iv%yszwDDLI9*A5oynJ`3#SumtP
zaVkuOKXEoNUvkb@eMzSzRwYzgCt^)EK9|lojFmY$Y53kIROY+nl9CSx|MwgNexIu5
z7<&ga4rDAKlx1I`tAklo3w!o!%(J{XP<!38gNx$ruN&`(;kLz{`-eUuo*l^Gv+eWH
z;l^xz**0@A1B+ibEJPt5C&wuWC8-eTWPhTGcFn#mSr!1rOmThg6pQzx7sarob7##9
z!6WMmlFpg+tUckl@5uB=4w<4|;Y}Id4D<{;x2fEz1?Ihb0PZtO{pfx&oQ_<XwuKV3
z<G?Vv64}QdX;7RgExO?q&2;U9=@4AqDB~@2GC&IiT)Nbzj>c-`6?~dIk5z2Sf@+o+
z3i&*adwZ~na5;UwIL1AWt~-wYKBfBxqB2UJEBi(`1A0!(vN>*4m1N6|LSo|_z}+`d
zYvjFkNHyiRg5PQJd(%;U=jd>6|8-}#wYPnCaN0TE-|axM&~W%1VimKE1DY21BqA_T
zF1lpWs8^zk3&_lF!YuPuK^p82p;^0eWfB*jL(zq5fG<YP+BZF@aM>2)GGbhE5j8L5
z{lkiCdtn4M#qUw!dUerrB+PQe03&Eunaz%At9%fTtRWEb;VA~d1-j<69!59xCQUU`
ziGf=S>drudUeQ4k@nvzX7hSIn=`OU2#TT&}L}zBOJ*>W2WdM7rpIic7OOEJwDV_AF
z-K8Klvcn+<9+qG!C~aCGww6VeVAo*&9<rXw(-_w;u)$SyWJX8C;iz-6`|}C5Yr|}*
zY=H=KHmPDWXrJ!xA2P-q9=RE;ocBj(r?U&RPELvicx{lQ+b^Ko`l44@?`tGkN`~HQ
zD;m`V&Vqo!_0~7^{VJqC&%Wsek`WQl&S|B$zQGC*C4>3E2hVumq_w->?)=m`Y40B$
zW{=rM>2*A5zuDe!9U)kIU|!1MOOSl&CQ~WRrKU%K9M5#HJ_>#a9&QHDf+tRlveL*z
z+}SG(em~nJ_WUw%5_4)7N@lkaRw33{?F=QJ1*>b^p!zfizpjDEtW6Sm%zA)#!LJF+
zkW%`#@-8!2$v3IP&NaD$11;<+{>u48HR568&MjTDz;;EE;Lg>rr219VAKkg`3gkp9
zdZ&Idh%Q5xSHJw*jA67sgo9B(N}t`ex4O|6=x@Hio6`Vryff%TFMua&PaZz~p4av6
zFkqF*Q~G>HRr;>J;KcZDY(8CGr~hpP-_hrjCN;RtFqPUS`qz)HiGij9=R`z;m48O7
zvsS$w!M2#nLU(`Xr57cfHetFqzq7`8!*4hno*UUtyK%fdp4g557s<sL1+@^bXd21t
zRm~A6o=>4u(Coi;gh*W8c;aenmoW?HB&{&V6GMe9YtN^ypM~s#IuRs+iLy%Ov0KZ&
zn}ow&NVG4iInuPN<c2rMc6(=kABSE--8|#dPnec8kmEDhKHN25ai_AU?&MZp-KMBS
z|FPuEQE;sW+x;}5GlaU*4!BDgd6`y-ujodgwk&Z^U}JI}he3ur*&z&l5;fJ~rVuK|
zaBngK1Ie<KKJu~g*_l%SyG-ZC(%;sXs;kgUXr6VHA0~By0({vWOR=&p!alKhX~zz?
z;p*zMr&ag!!=uyvom>K-+KJ={<z<DNYoLy=t2x6xytih0Of-J*emyh4CjFHCS8eU8
z+gm!+jR!4{VtA9c15d;6zT)`Dr-}vOJ|^Qy($6yjVo|-Zo?{5`splDh?>INplSdr+
z>EY(*LZ!^XC@`FL9%SAMo`g5qB7UTAC)+<a#Xf?;%m0e?vbCBJV;v-Ud=(FS+r8en
zF2*<X4aP-HG0xFnu$y){^*GaG=<QmvRT*O@(R+-e>&`i~j#hrv`^>BT!`<!O-ILDS
z?Z3XuTJg$CU<yb42G$Z{(BO3EnAJF^2W_3cy#g@*+2%N$2kb3P@9GbX-O$J~rZdaY
zT5v(r^N&$9;<3faG&RzG+hxh1v$%2j$uLetgYM|I?$vAND_CJe?s>x**G@9J)$5Hv
zB<dl}BKc=cuFq-}71<^#7MrLThDXlI(-Yq|D%ZxZ@jK_@YHHF`4*^Tz5^VWB*%<;W
zjUW{hb<IfmcI56QToR#77B~6R<d`111=t-nLj+DJ$GO#9``g@hoY|<|vw@E}w&goX
zLIILyFd5&f;RDP#U~mYGx1Rrj#+Y68+{{?ela)qG##AEn9K7@TX7r-C(xr|Mir59T
z%VYXX6r6=5)%3waVMVsHM<W~nI0&$6S}jlB{COx<CICDRhjF*=iT&oSa0cW23>eeq
zOySEQ@jr1c&Z*HlIjI)nLM4Ak%q~NfY6SNWsS@=5Bd-N=@r$*(0Ue{gzH=0@)h`#8
zb7s5SjYg9<Qp!7%nnB3#PP-$0T?%~<@@K<w)P?09>jzm*EFv#}9fK3lYs+SECFXnc
zhsgL~$9T~GLSw|?J!g#h%L^T99Fn-hRwgP^X-AV|dUlFO5&_1S5et&#*d3t~ybnyg
zrKS#N4-AmZID%9djT1-2W9(d+xyzKZ8gx2!QkK>I;~(pP{E;1D{|c)-W;a~H08NT_
zrZviQ#p-yGw?r*vSkenO8r!D;D%*(+E8*UJgr9c?dqhPki9(|kMQm5umd|glPufu0
zr$N+gsY=FB&i<KEmw=^gtd<{Lga`FGO3S(RqO?1XN3hnnQtXSKx+4-Y>5x{7>?0S$
zbWM?qOhJ`BYBY)>fKS>*f*CY>HM3;dMH*kWuci}(QZ&oJ*X7vS_Nyo&z0}quxEF3w
zSrHCYwf}nm(23SXH6TMc(JW5-KG3A1e6(oCtE;O{xGKkD&$N5mI(a*@VHCJi%PP>T
zZq&2@NDRY%b9U<vvCwHE?c)Wwm|oPU1`&)9(utkPxc}`A>viA@r7?i7BctB19&P&<
zV&cfd5wgPrQ3}Ml5IF?`ig80Ds4m%xB22BMMP(*XPxkw_!A&@vC~x}rX*>zG+uO%1
z;e?0=nnZm$f|NJ4YLa9KD)-*gY8XsZSaiZP9I<y>e957|7!0M{^WHca7+muh>0gp5
zO$8kjWLeCH;S7@-kNFt)&QGENok^$BV8l8<bGL2=ZU|5#rejUf2iDWT5=-rk1BpM%
z@Pfgl`no|wnys%5<xvo(m1K~eKffyEGRC1MSAFHweO39rdkb|-m~EWO%9f064vZv|
z=*o1|=0RywzW0TCjnlA0HIM5$*ZZI0ufP`M+Z|s2y(4iJQ^gvLT*HodN3m}M{mPo6
zLNHdeJK)IJcQ#Q@j{;lDlG^x^&|q?l%kl$iX_d+j!t}jyo02Eer)9GBscCbogbF@4
zt;^`@N@U=u)SZZ;y-`wza6VV$6GlnkJ3QKL?X^yVkN9!YYPU|`Kw|pQ0j*ax10zo+
zjV`afiDW5w*`3o7dU`1APNm&?{Zq+w3*}y&wHGP2cidW}*ggyx<`>(3b&?0P><Ok2
z>W`Pn=Rq#+jMiUp;VRIs4ZDE7gAzQd0R94iUjXO}0DK;>#XkO2ZT6hw$xIHHITOAs
zvpw5qML-s+m$vf7v=5tZ*IkAazz8APe|^?I*=UNv-wjSa;bcR#hViOJ<3T(m-twO4
z<=J>bDEdu!+qCCgX3|H8Gu!#Xo5Y+8616B9v7tG$p?EFHRD$!U8%|TU8w=H5L+?bH
z`&Z`2Vi>F+<9?q_*D5%yv%|A?YnK_SOpq!%FDr$Nhm!V4rcDPd$9(IY{&L*vygk}I
zJ81n75Y_*wb@J+{-Fg;eC&2USV}ko=`m7Y-&5i@;sQf6xGc?0<s<&Gw)T_jxBlIUW
z`{;x){}gtqxs!z}{NFrY@;Fek%>>g6ThXCr$cN2lv_OTXYZRsqS!{|D4{2s<@J=`9
zWIFC5RQ9s*;!@n#I<&;Am#e`=udY{l80GfqYa@szU3M%<uh_dKy8+u)nQd}i47}ms
zIxagm^Ig%-)xj;rKJC)pgWzTjz2Z7GGImhfT0*SxIZ=yrg6WM#o5f2c24EN$!}e^5
zv7G4W7*u;=ee{p)T6bVXTXMfk>#qAkxr$YyHh6EuqM`%!UI*juT=dk4$G@TGTP&$Z
zEGp1jl9_iy$!^Y!Df>FP7EiF?8|O^TGSg{yan%g%<|?MUnl2zMmcjmWSZGdhr3vb^
z;B-kLN=W<ATgEz^^T0W;Nf3yJ*%h8h*;v4NJZ5GFCxNyFc}LSRY`gh#G-N93P_bZg
zI}(AQXrt)H!HdVj9jWL#0mtdv>12vqP3r@IOZ1Cz;Pe)D*;+pDY<Cr=+kD^RqQ`=!
z^_-(!-g6HhSZ{G1gm^fH>32@T#bPOXZ(WAG#MO`n(LUh_#}2mDO%-d2UG!fzX3u3J
zaQ{p&P;!OvlcS@z?QSxTwtK%BOGJ9qdG(qh?+NTH2((jXft^+@0X`PYEKVbzu+NQS
z>=v<U{~TDZFmPv-A4^nhlN`pFTi68c$@sRe$zSlva>V4iTnp4f!~7!`%h#_s)`eWi
zJ-b|WTHfyU+H8rme{mQ^y{K2Oq0w5iv>VRkn3D%)IFh#!yyI5LRxgjlC75p>`L@WX
zhBkCCAh1gE3tN|cS&#>VdA|XVh{%Ty$TEYT9X|W;8UG93{z|Ik>@>{SI5Lh|aZeoH
z2#`qq2B}IojzOeTw_&%B)1=4TpZLGsq%O@l*nP#Ck12#Ppq*5NxGt6yfDX#|F4%_x
z!+Yj7yuwT-hbG}85YwiUuQ!!2J2?DY>rnQBa^%NEg8MkLql=5U8(XI`)3$B07oAVp
zKt`O-X&!P?K$gQwM?N-VwTsu&QQeJs{BFCfWqF_STA8BteoP}fAyA<G?W4Vhi^rct
zYn`o_q03f|LY5X}Oe!H|`OU3&2s%%1B*{@RVMSH(>8Qt;vrq+i>2lW7ERo{uiV}6n
zW>mXtFH8p!|LdG{U$(jMkI}7W8!g?KGNE0LzzFg2ang^ww{Bq>)LuM}q`?-X^K~}3
zk;_A;^%G*#>>Zu_D4hJfC{b?R_Svg^_0FrKlf!v!R9xI0G|6rc!yaSYPIAK$vATwg
z0R`Dvi!rBZELJ%9rnyy^$|(ODvi!JPcdD$57pv4M>2r360C;Djk<LD$cd1x506Lvu
z_*&N<tlg_v^o&C2Pa$AhGY;0Nb)g<JkChoO2H_wP?^Xn&nGWc2%F&K4_?nBLIP34&
zc{q%znVK<+RMSA~Va=XbbkG|+%eP4{s%OD}WcnQU$2Btg%~fDb#`OQXcG=AL<V3Vp
zWY}=bT7F|`WiHf@N2xfJ&tO#7I6uwWiqm$!%`BRbu%~<0;~vLA54QZwUQ9=zvyjd*
zm86jnk+cpP!bD`(5tQ2vCn0XgyK(9}pD)4{8cV?BBFnHx9d?cm^Xx3T+8z;W+B>3i
zmu2BjWi~xzOx#lSSqUBT?FMT!Jv17rFH^{k>!}_i2EaF~4=<G6No!4wM_c#VvBsKm
zQ&rsHxOd(riiaH$j8mxm39cPZ--25`{j-1SNWI0`6=nfoBgF$7A^ebRTOIjiwCuEp
zBTa=ez*hXs9cR@20Zr1Tf$E)GST!Hec$zety@T!7Z34?-D+AvwpRfu5LT!=<T7fFg
zhoV=-F%^=_c$UU@f0r0lO?+zI<bbo7pU0jWSQHc5mRYD)--`=HheQ(gQ%;witF`iS
zaEqWRu!1eANPw5D4sov&ryWdTRw<n&-?_^Q5|j=TmLt$M7SHP#d^l*Iq;BSDPN@X)
z&;)wpC>(Tp=f!i2g(oW;te)yc9#}=rcr(VPW;tUT!Gd}mm9+xGKOV?pQ9T>ugK+RT
z8BK9%Fgv5LT;BBUSo2Z`eEw0W=i7B@-Vg`kP2ZwR3grD2@$t|lmuNS)HpR+oMz0C>
zGnAlv&CJb9GV}(TT~+ZnPUpa}=?Q_E#|I}riHVOQ4(xW=y&A*wOBTJXF=qFr*R&k!
z*%sTu7~gW)GsL5L%P5_{NC~76zjODzGzW6CxRALfoKUEl_EAV7t$6G3sO76yv&G3r
z=h_RwQVK~_6(b|??kjkyuCj6z0yVmm&U9C`eh>Z-|M2}Fj;52N3kk_)#LUXTX!sEV
zqL<ILe9+WPaC8w!L$)f7{F~pW0kc8(9ZH&S+LcAAC6jolh3Cnbn*l#@baoohLH@S&
z_UPmnxE$QI6JZ;6=mp~XaGPn5mY3)ZFgg*<#|j&1teD5EK|6{ZHw9E<DXWA<%Ux+R
zZ33*ixt2BZ;86WiRD(034AquU^t>iu#v1oBv6*3zY^fTL&JVe)j1jdqjBdb7`3HG<
zJ7Pq%0`t4F0M403=EskDi}_Odn-{5=ey|)KO8y$$3a1r8hl|@GZ-e?n{yA9RXF+Xw
z@fH{H0&vy#{WQAU43X|s#PQF>k6hZ$9xt*WQfUSL3zZ8}@Fnt>zV@pYcvs8KXNG4{
zz6tZX*hW@Tr@p|fM1a16lXn)<n)z{QKBnz@InQX>S89v&iWRNut_n-1HP3Bik!}ci
zRz9<<9RAJhF2kn<Kv{u&`ARJB$8VyHXT$eHn7J5&7NB2{G$EX=4<ik8X~J<wy)udk
zy`bo5dp2??Y~~O!XW5WtnAP+otRRN4nxmW%_hm`vsW$BewKe@U1MjJr*y&-#L^zeG
zwx)bNt5`{(n?YUZaYN#(IrqK$i0EDl#(Vx^5EKUWF$4g$pvK1!0r97hIJHm}W*HdW
zAvv;vYm^3z%HpS8Yg3Cs$-Utx@3Yt?8HlQ2o{g<mn+Jz==UyzqvQbL4B;4(~?UuDt
zS$KSHA$e~Nhl^&Cxh2+MnP+WeUpqZMIodhhKRsw=L)4P|CsWQNs&z+28W|8W1I-z*
zFa*Mu?PSm?Ac}AD>DaZJ>rMbsZXdyKitRxnWLCImm5RitqbwJ#*Z8n;dhtQ)z4(jW
z{A#|Cz2Kl)?h;tb(~M1|RoEF#w=XW@VN6uaMX)a2gNT<XuE);t+4kNZgaf~ru~XU5
zwxRV(#^%1_(Fp-+L%0z_Iv-!$(j6(~sIqj6NN=&Zd#hHkmi9VY%E&0;A}iX}n3d}x
z^wcria+);Nv}vbZ8+6GcAfmSuF$K+POF!Q9ZC4#w?qxuD1M$eg{;T#c?bFuVUAy-*
z6p^V_hliNggd=^^P(n^fp9-HQ1pt^*DiCwz4Za#Y3n1y(`=!%9+WE0{nk7oOZ>>Yz
zxJ55MuP-~1XA&KBY!4sn889hX?)?0Hdg7tL_5}Nb6)CvHPDk{A5zRTnS@i|1x~dn`
zem-igpte?wdS}v<CjoSqTD$7}mYj1I0pg#p>$S6E&U@VX*P~Z8ck%8!#pk-E6<FC?
z$-MG0ah#q@7Pd&0^CqZ{AdHsPf&o?q+Iv&<VKA^_kc-h6VpI@^m}Xu^;}C)AU<h}5
zbga*&!?YYi&cHUFSFURbntkfJnr)l8`b)IIvMoA)bxJpYT^UYSGMywVVykAB$_BRS
zCW8@sa2fNqethmU2v+cZtz-|FEh9U%oGjIly7{cVWjj;x!RqQN!XY3?@OssWJ<~0{
z*7lIYlG|fWASS9(jx~#j;#j|MM28QtzBtEN;w!<YPvb#EbLM<o?Wim6T;^Fa!Xp!1
z9OH?*5n)lBg+R}+CL;=Vz4x6JXC;SRZ~l>^yz9;umB0yGLHq2ub@J0b(W1`w+3C@4
z>$J6Vn!kdT?)RA@9kuSG&2?6?nGJ$?Cgb>MI0t7?+NC4P$;h@DmPh9o9$32sm+vqz
z-8n@Wli-xPp12EvkNAlcrspS0H?iSLDRgdNxv0_k_H~pCv~PCO?Dh-ZD7i9!cqe%N
zKwZr!ZAT&M1P*ZzO2zJYdms`_?_kn`S#XSMBREG{VADe6v<5RQ=|n@IBdAmnxXCgk
zGQ?@CeR>Z{Q#`V}^pvP1*y?gMq((pJb`iS^+^L)Q4pluTCtObrVQ`v81caoUndVCN
zL>gdLEd7<ENOO^Y)P9dgU^j_j(Qhd7M^oSaeHwS)>wEj%D?yzQ(W~*`>5KP{S{#HU
zX_~%x@6xMq11e)k1L&*wZaRq(bPRvI=b(Gxkhqd-dYk?5%5=xwCy#27)YD&oG-6JL
z;izHN#2ZkLrB}VwtAyNU^ca8m`Mp1$-^&5~Qf7@GuWk=%Sv(fm)vsegh~Y-Jd@UC}
zMz%1GHKW?dt-Kd60b1%TkBn)rkV__?Er#VN4ifzKZk5NDCzf^-x+OEDl0BaN>&XEA
zus13`gTi<?TjQ?tgennH@h8_A;%agpu4D{R$H}0>A;I)0D{eV6amk~F2;~U(??6G*
za6x_r<jW;B%eJ3y3u86<4`(FrDFeFE?FY4$71MO_e8R`+c*7^aZlbx$)#Z*h(Gj6`
zv4_vayaFKRVPA$#E*c3nf{kMly?D)<l9tHOK#9bd2Z#5QHOws5mdUA;e_nlTNnwYE
zTr_mL^Smr8nwwi$S?<7g?wX9c9}}MNS1I}~V3NNQe3K&ZU{JDii|rJw7fL%w-hW!-
zvzEa${*7cxNSkyC7Q3Gwf0apbX9l*VDh%^-B?DN~0bbs|K&g+rv<N;SDTrOu&@#Z3
z9Gr5s&5?86TRD(eDVLi+1?b3`BC@26IZV{DRTy7tG?%~0x?(Fho4`|E;$lF$6o-98
zlEy`X?pNb*977CirPpH7=|u@OVdz0jA+quWik*|z@xk^^>uu{$=xaKfbkL6spDnU7
zVHFpMCY)C&svqohc8(4XkbS|5Pba^_K}AfGjU7Q6Ea43JJsCzz!DT-=53{hO=CFnz
zc|r$(x~kMGG`L0%I7ZSzwozf8?>}<kV)=bCm{H;qQI6<(cF_xO>klT^O~(Wf)9+kH
zLp1W_QN3Pw0&h;PS0~pr+OA`%{jEMly6;BtA3?4w=2Zlyj@N#h&1R->;gNgfYVb;Z
zy7*yzvmw?_$;AcY0fYej3XN!mnh&;*_hG$&<S&9p%NjQY-bWMFPl#m>{e(_<6^PVJ
z#6=?t$9<0U8?qb}62l2}V`1O4HbxR%>q}<rkRcvP-8?hrQ5J*)dMvi(>&0WbWhKB&
z<K!fZEfX_Z9G?1?K3sqL^r?+6FePg9U567tUZsTlzivEvXP51Sm-ZEO;&oHN7>$_U
z2K1b}Hk!Pl$Ht_tO|P?Zu7tqX9<q^eiH)J%)ef?VDeDezI&;C=-Z|KpB{$~k^n@;>
zDiW~?wz56l6DN4%*~e~5h0l4I#$6%^lbdAB7G*5{W&3x@m?_J_cU@S_!M}x2!0tD(
zzs1PjN>Wz27n)H|`ssctqJp?c%1l<DaS&?GJZ6nJ+4zXlTaWrc9%BpR;3v}Optgqi
zf!M$yS|AnU%-=0jXlS2IytmKOq(7ZR$20(AyXmi@Re?AmEfqZ^6T>pE;kO%&ih94|
z^*ie@gd#K2I~HpH=0z@(Ck{As<UFv3vE%si3Mb1AG6$F(Q*%N-53}lwvn<l&j8ME@
zY=sDWv5`<>)1s+l+Tkow!W&M<CXJmMKjDtdfh{!=XldvLU+wPl+}IrQ(%&BWw>d8+
z_BGPn3O5<V1ZQHszpU^ET^aYz*APY)oimmD4O>g|yISm%#1og}aKJa0)!<EXgDiF4
z8&2plo*4f`kv3*1Xc{xlgf|hp3`VpkiJY2@vh)NNd6FA~R?JvBNltnnex)|Zc3O@R
zvcoM<kq#H>z+RNEVHvC89AlYr#Ef1DaPxYB1+U+Ws|zr9F)yjHnn%NuIi|h?i5#t|
z7*a7*#Ax1mPFNsT5@K4k+SU}q7NG`(5fJ?{T`Ell3Fyou$%cl`Tid!8*?dV{xvq%<
zH!m|PmNaeFjK)`gd-z=12M=uFey(f>61;nU^G-<WTG46GTPAw>u<QzB?E5*6x#5SK
zkMnmkMk+V(hxt@qO!Co=RjMw=0h$VIz_w7>zhYs>{`2WX4BFMvU^R<*Jga#PwOxp3
z?#JzZwEq1QH*|AhdK>xa-79_*H^MYa=GjL|C&k9BHd~2zqh5p%FXH39$DXn*=zvo@
z>^b9!gU56ZrV|q<U43ccqskO#5Kh=O)ak+POm>?&lTB?Cb3InOmml&QL(xf-Z!E1W
z<&i|L;e4#;8{{)6ckuH0fm{lqp4QAS6bxF6R!|j3{6_wE=DGc5M{l8ANeSn0F7%(P
z4Jx)tRBSD1zmG>6(P#{hwrFTi==_prD8i0!b;B-{fV35hQ=gE?u`Ik@ycNW^29M3r
zm&!ut|4?Q|uN;So485|%i8J-#h8r%LIU1tVFoWc880N}Gsr;%;Mpr4w(&=q$&NOjd
zGziXl#;|kLYZIy2M&i<^P9Bko5a*9#xr7l~MOG=8!cRhMFby#O<l%Sg!U|o&%Sla=
z@~x>USIt%-il9uY86QVDU?SCJA5sVJ^R0=0C;$@=kp#q<W?ej?z#zc#qp%I^Ilaiz
z75An>`$&#hW7n21;g~JyO3*rcr)@W!m{-kOId!ZouY>${^DdRdbj(Acs&gcppWPlM
zbIkWNjz;7B5MfykAQ;B{GY9O`3s?B(2zbB%dRN2(;b|5(SksIn&jFOO+|q^1Xv692
z-=@*jV<C+Fl;3m~zq7n?^OHGpZ5^a7cYDqh>02dg>v9dD6K2LqNNdg6Y_1#;^yiz%
z4AQd74JR9rVI3>XeUhW~Bl}-w$H12iChhL~nm5}jD+)F4SLTpI+-s_trY6AUXEb#-
zj^yW~SpM?0MYC<!77j>X9z*`gqu^QaaPyxTyFQnt$-fZbTv;Gs_0QoLj^EFa1IuM9
zto0}|VVPU2oBAZaTn+XeXB)#&hF&ueqkNMFCE09hP2+1?<r!Ep;vMe{5(m3nj9DDk
zZm^4jpvZNxbg(}2MzE>8{ET8n&&)f8X7!VU7~v%L^l5kWipJ4TF54RXz3#5){dw1X
z3BZMz@eqs;Il6>!Nyf9E&P6XHigyT>``rkvT=|%RvrQzg8Q3yH%W0RH%U8^@K|`pH
z$*vaEZAv%CWml|dd|E43iZik~H;Ssb%(gM-3RgW-{Sy2Fp}uB*yb9BWvwByg^j-~W
zB?82fkGYmjN0;NUXOpF}=$<JOq;E2=g5gZTqoi`0Zg_fb*vWGV`P!c~TaNBIR!gr;
zjBWFJ2P1*TSoMx9FNf%+Fn8V?yn*&FhqT!h=jyfXlebSEt?V5Ayz=Vob-6;g924a9
z&_EqG67nd^^_+*q;tQPlpK7jj31lS}#?#S=<3nf!Ql3LD6E!UmyctE_3<CHph<VB@
zT0RYObN<Aubw%36{3|E*qN!gY*gl{;RWbeqoUTh5r0typygQ@iNw>wCk1mQ%fqhHG
z^DP&=?aLXrf}c~7eo!$w%XXxo95_GIRS}KX)d#$Fa<VX1mEs78xb21r-@@`@1b+|_
z{_d-Q;CvBrj3mODA)c%YIi~{UC|A?bDsi`toS!3Nae(HeSa``&w6e?vFJ~r*HE!|9
z;VP;x2^3HGJd_OUX|00QPB=N?B8{IqLD^H@!sF`h5Y=I(PhEZ-dE>e=d&P2-mAtWB
zr7g!y)7#3K6mN@_H@VN~MdbcrZ-v#OD(%-u(KtZfZW9Dff)^_<11PokceVrgT$c>4
z$Q7532r2J>+1l{y|545@eg@qzT-AQ6*|91J$0sfS7hTj(f>fsX(v!tT0uRq&B%V&w
zQQYNZNQ3Z$ifHxdDbqD&g<eV?lEU*BK^7Wq9z$<<uV-Ms9H+I=8H~jBkkd1jNLfr4
zH{QMq>KZpm3(@;;`hE4-Zmb5|#&CQ(j%;wm8?=O{PAK#rGBRL0&fhAEzDkxa$DdB-
zS|ro;BJQnh7>+)S-a?sUM5BEzA4a<zdXWP%9VE%9P$D0s2E?u<CNTf+>!<Kh4Fq$~
zYw5VV#&#g9-7nb(%uk*?d4#_kPam(lfARI<)2C1W-^Qbj%_ol^Kizyt<u)EYeY*bt
zg7q&sh^o&NvWy`3f75e1ou@O(&3XU7^rM+MM6F-%HiAupelvI*P9{Mc^6EZuS-}fv
zbpGWs8eT?_OblMagD+oibG;dC55nK+^7C_a9<;@Qgq{5$Wapx68;Ko@z{1OT#g~c6
zI6j|><aF3$fd~{f94nKboX5j(%z+XIsRX8mCPF=U(29tvx*Fhw#oCB&J(-Ay^mWYg
zdXTijJwa@TMC3n+;8eil3JPOGh6*z%wr64E7@{|!X1%7P0)ZPXSm0CFjhfP0Ae0rf
z5AC=et5sY!D(bb{590yRwW^`SLl-D!C=yOFDjSU%g%0YIMx*JyO;f$3JGJ3~P;reG
zMf4~GSjog;Kh2<TgG9O$vGY5OM9su0cc2|eOfqu1z}cs~1W?%_^cuH;EHa2obk4_h
z&%!!^ZGHmPr$m_?;BKkWCexrtgS$2{rx+5%K2L6d0uEB~0VRiR7sjPPxiN5RDA;8(
zkTAZSzS(aF?W4U@I;&d&eLp@q`e}c+wHv(pg<iIToulJlPWE5FISt+%9qhJF+MLsM
z=jibCWdGIK=@C7sZMUgrjdu*a+dljyX#Ms0q}6T*M<>DlTVfZfJ?h|O`|xzX)oup+
zhdT#nyDYe%HsEU-9PGc{Kc!-)M@{sL#)>s1j?2l;8~VBZYX4yW^cU`OZ~ycV-R)6-
z+rjbn3EddZ4z^E%<Fk|Fqc*pO`R(qvcMi7q-?nyFX$;hFz!43D_M7d4gWPnFem*3I
zmm2iu`ik2+*x!D2(30+Gw!8Z$t({X$EBm%XK%_w)G=uhWYiA!{T7PZPjJ8jHX;QOH
zijEH3t$#bCa`Zmf-G00Mn&w!a109%`o}I8!DZvBnw9j6(PxnvHPFun2qoZ90JL0v|
zwW<9)I5=uE;LhN=wYz<~jqcG3L5*J1_g81_eZY@_en@=&$=UJgJ_6CbIr^C(L@?Nf
z$1TJ9=#b}3z&bkl1?>VDycEsg=Qk~SPHTRs(>p!c1~}RTz@1aKB=t)0Jar};9JXE`
z?7wau?zHgs2o3#A>~}*JZ@-N)`_lQ(+rOBwK3Fswn|yU}xyef#?C%BJyUfLFVYEgl
z(cV||p{MP$oi_@7W{RDh&caq))%-`ayXYjKr|LTjlgcNLIuo@<Wv=Ac@812o`S{5@
zC(qblL`F*8AN&%W5umB;PJR7D*!%urZ}Z{f?;mx)fA~23zCjFN$%k<7HO-$O)H>M)
zG93T1bFvfcogMCAvD!gdr8TsLIloqIEyDZ-?ddSsjk>|+MzHbd8U26#shprFd43y=
zZfPdL_4?{}tDDW>YBCw6&(_v%Zf;g5liQ8eVKiCeB5O)T=ssMXW0NL<l7-ut#<Xou
z+vc=w+qP}nHm7adeA~7;ZR_2+u^ap0Mr1_&f~v~Qljk{W+`}a8Lz`S1w)+}IQ!2~h
z>1lt88>qGPeHWIljdMC_=}Vei*OaNFAAkO7ATE{_3KznJB9cksa$o|qOY>;+WNSd2
zIWUq8@}GFa(27wKZ=N`{vc?cK2wfpK+DcW=z!_I!%SEoltv|+Vw>J2{br+%@uW-pG
z@AI`JOpS&R*8)P}?TNJv<XM0+zdmOj;{oJfHjwfJ=MRS=^nB|NBu<tceH4dZh1%C7
zFY`{6^N<JGlIt~lF1)dg7)U)d)`om9ciIV!dT^UxQz3|DRe{Y81oCPCd-dB>5)n1(
zuzu}uQK@AsLE^~e%EkAfDQhYNHL&dp7b%qDfs;>{M1uK4^j4CC2c6&NQe+GV=<oAC
zi~_m;W{nbs$d2A1yHa2W^b~_>=43l;^+fGI{uq)|CchF|jrf*b5`f5|z(5E)VSIw$
z-@@_5Y7oH-{~+71SnQ8rc+>1Mf9|CRH9D&wRYA%Aq(jT(kgX4=e8<H$JC3vU2<f|n
zD5-xlC^u~xX*8zYhDp9!IiQfO!5!VI76>q+MNW^DXAxqf_b6CM*oobqJx^W4=Xf|S
zGzSM~+zA+U4@eK2b8iNA0-=l>_Jd}QVk?FjsDChq4S-(}CPxM!6t#qE#PB6jEwieP
z$4%08`<!DVNN%F!96~OQ5C(THD(ijjbN!@QfiNe<b&QAyPaC}b{&#lp!^ONtagshB
zd1tNCvl=Eu&ryv>^4Xa`)S?>&6OPI?gBWfMY85V4h}N<eEu2vhm1qlh4|9}w3fm=v
ztpc-t9HKC(Lh-Ji^p*6dtu1tDBZtF*#z~|dq?V$ZE4N60Y{h8^aoNlfNxJPC)RT_C
zU2h)@*4R;cyhYh+ZPDL4r88Z?=Azs^kEp?@?fY}UEcWOLCKoQ0k41t5eBrU+z>U+G
zq#|F0lVfJHE>7ocvRnQs-pw59&yqD(Rl1g?VjN(@2)s^9)N!8nyU_ajg)M)|q?xYX
zk_f3&1>zwfS==F#nxMxF7gIneTI02=F#$>9T3Z>k!F$`|p45nl@&=h*dr-sdj~8<}
zEdxcI6F{B-L0Ci~38j%Gi~eS-o{1xQ00yJ>liuM)xi$BmXTqp&RMU!klL`}pSfHSj
zC9JI3a;QU*$CroR4K#GU_wehqU1@V_5KbeTyh@#c<wV~Y)7L^`5#gPJX*G7yci^vf
z%$qYY;%APL4fqG|%Mtg>@JsR|{^{*7cLxf?QttDR`)ttJ$93|~3vPU8JfQE=cNd`$
z^UcinP%^eQ{)5m$(qQWBT<~uaYsx_lNASkz$&h$_KJVA{hZf6gZ{p4M1gT!g>=ocy
z?FGr8Lve>ExRubEH+%!s@i~}?pj4S#CyC!V6vFyo9pX>FDbgU4HD>%l^VB!R7nWzm
zpY$R?>xy&`RbE-J2-sr-x-G}`2%m)#au@WSWpO|R-AkARXZlcmHTi~ve|}iiz&cq(
zSiAOPkWdW6>LUxDg9+@G^`8DxaPo9JZk0h*NsDD4A!29bW4xCmjxq0+G;h(n5L)9e
z-34irlcf(6wlz@()1jf0m@$QZm@SQHiK{Jinb@(U+#Bw5d2zh`ZyW`<{>xOhl~U^z
zO%O0Z3f9>aXUGE|0<H|}S4LbRFpQlpi}{BCm-Vl6x1oxEqVzdT;O$(5$a!h@F4ARK
zsNi##r9T>280YnYolYkdUxZ&d9#+M!IZ!@G02y))B<#q=00ko5rto^Pd{@A$^V|3F
z=!0^XkJtazQoDk1GiCm(oyi!^SI#|EyQ14&-qiH75^lKu!Oa_3&s`RZ)JCGKrgiov
zX}*p2B(TqzRjuc%h(BcWHT#}CLn$Bio=>U&B;Y@4jvxoxe4zXK*lpCdy_kC_=!{#2
zdhiLmyVpH6O>~(m^bnRVR-d#8RwJOfuCu#l1NFDwAHPxEjt5U~_{)P;DhM+HIktG$
zP}ND&V~dg+QZdOQrMEINsLrbB{|iWCRpebsnG{g48D6sp!1W$k%)e&4W!FW;{)gB&
zauOGSy8K2BvaWAb^jP64aJ1w1BjKv%L}#M>X)?JOJ1SEVJFQ87sD~=ylyYMQY<G6?
zxRqAe^|&+Y89-$Y`+SlMZ#RMXocfn-1#C%Vt6$~f+#n7qVK5K>@SkZ4pz^(8P=-?A
z4eAD@^+UL69{ndrvAGkDge3PO&?Ze|aeK$^^s&Nu%PQ9ev2C}LC6NQh;Fmo+SqRQ+
z@Z$9uBX;lai(!1G-bIDITZ?C-M<cQ<N7<r_bk@5l&V?1oT#01$yL$I>s4sV?X*Y%8
zb688YkJZFgBL7guKW_x_fO1T=-swINt@B7!l@DX}a;$P$bBWKnqcICD@diJqbB_C?
z2W>9gQNpMi3z8lOrx82tjDJ{MY~gh?<;hQp;Vi^0eJDz33G9$G=c;JK8S8~#c8tXO
zSnIjAg>U3;@37rvm!X(+t=i@(o3Zcvf2Y;l4j&Oqks)-APcWv~@D=Zfo*WvzeP6V^
zdlpM(v^(vj0Q%^QR^~}W+9;>8E*qarQDU24YrBMHu88hG_y%3q+{Xqcid$jnS{6nO
zjGzT~O(E9jq+0t}8&(g+J}267=Xb;2xYn#MS7$Nb(XN4CCH^d5jVJ+JFTk<Ocn;@(
zkDvLx-(El<3%_+~`fKcsLnQF~lKj8Q@0(oj^Ky|^B;TT5NivTQe<<;Ry9Dm(n$yI{
z_-4)Ml|u*v4&u!O>M;+(7`_Fg*I2lbg^@&*AcW#77DF(Gr!^NRN|8i8?W4XVI);*>
znl$KC@Q{=}2hX~mC$8UB3J=;NF7T`mXK`OlwZAM(H~V@Cu#~9}Gc=`rV1&FOeYG2r
za5lFUQpK0mJ-(bta4ny<Ac$fnZuk;)d%b6_McUKz&`f#gkl`d&iOaWSSBj46Z?TT3
zUu5Z|l2Ay&b0V>Hz?}|{qyw~CM(uFnUMMAXb0k>*1jR}2@^2zlMqxwEaA6mo0xQuG
z<qX8zzP+dVMtV{X0dlmE!+Ikl*bEx78y-#%Ovbr+&b7XnzK;q~9=UJF6`#ilG4!SD
zo(Y}b6RnThBM}Hynf{&lZ5qnhY8=z0Ag1+2<ZpKze-66)!BJN{L8AHvK!mwfMQ3jg
z`~Ir`)5r0(^Uo3CpTF?N?tYaco^7x9uP?%t>szmLuLTPD|9I&W`mJO98{&5A4Fqrp
z-1ND(;ByChH-4X00eAE7C$^XxL*08=4Ln322@l+EGzIt>cu~P?u8@DHN9X8;tcG{h
zsGHa2g2BuP<T)T8R%WkzRq@fl6L%p&96YndB^Dc}3cEgd{0T3JyP~w8Ih$Pw+nCIp
z8z247kSFDtLR2bp4-t5M+CS+!We#J(9fw7ZE@ExjULATdblBJ#n1A2zqC_y`d>jo<
zj_%zD!-?fue6Poi>>A|E)N{&Xip>IphC!WMMHK6b5JhdEHf!ksE#PuczdKH->l>2H
zrw>8-&fx1Y^o$>1aJ&PQdXzIjx*lvj12+oP{Kcxp5BFoAhvf*bxA9Q2&7k&~8p|6O
zeXQ!@hF;7nf4Ly|_``qLX?X(9$9wPF7pk;j2VjZ3NAno|^{y!6_+xD@ll7NVC-0+&
zEl)SAVs}SDVu`h6m^3Orp}~_`U1}&6Id{B*S%EvGu%<}^f?$E;7Nh`cZ~oX1C(Kmb
z9l*}O^X0Rettlofvm+_d^VeBPle0tfgE1WoEp0Cv)av3zN{Utgyujl7+z}66?}UG~
zq9G1|A4@!a9@_s#;TUUmhxi6@!~huyb;0Fq_2ZEfr!ThakSx}reAS0lYv~%%-`+ss
zDJM~(oaI_}fu2vV$|lD)tl9E}h4x}F2fgOL`J&g6?LmL|d~nzYj+!H!uH>}uqRV|0
zKB@o&b!q<bY59iowR9tIv3W`$pU1YU+k;Av2qw@9XP;6b;5J>qbhs-<`1rlqw_=$V
z7EXNS!VGlIecy~ZB0R`5lLZn6WJr8)4j!ZkJrLPmds_<>j{Em!`o`yjf{l-}*F4-<
zPk=07I;}y%E(rxf+)aJM-ON~O#t|aAp7j#mF#{}uoxV<n)Xqntj7{k&i^UnDXVXwZ
z*-#23Xi6O!!c?P06M3yYs~}oi<SVdEtOeNr`cB*Owz<1tpI<`{lvV(``W}BQyYI5=
z^}Y41z{_dX@znI?wVuJRu{GdjyswVw!b0Z`_;uw|;ACt?-A!+Chy1C|I|Na5`X~}w
zd4VOZWtB?Hd~jK7LoP-_TMcQHs8|BrX&!IsqzqkY;8vhMKslv*{{2hX%&E>`LE-A2
zIHy{pr#+Nadv0u1$L^-gn|(lW-(f5{>*yW)4*B<{8GwVfEjuG<%{Ez?ndaFfy1gak
z#M5Y))#;xVv80Pphf8Q<v~7laqc#>Sm(q`jRp=c}oa!}!_Hr{-wfjecQ<DDT=Z~jF
zGD1A;d~7m#5~-E>iW2T$fAXdXBIGs6${C;(3H`5sDChIqZh3NN!ok`;vNCfXi7J*h
zIEARXKh-c*dLGLa@00(n){5PVaSEKp$9TYYhVn6CwamupkeNl%J$~g>&OD74g;wLo
zyYhuL%Afm6>MBkTY3+wrjg)o;ep2FFF_gxXwmj4MX2aQOeN;I}5A;FoB83{k)X5@y
zRsA^7Od~ptNWVSmVA++8b{A)-2yre8DeMNv9c)+=R%94AvU)ElSRz)?>EhnrKkDT9
z)1~M4dBRO_cy<v`jP2e|p2>~CfbYW17+X$}nB>bS7i_;`Ipw6BThXTnmj~HW<5;7&
zAO(QvYR(t<T)!fU+5C|X^UV48w%%Kttu8#<zyd~K)c;23OOKCf!^vOYL(ihxMo*Kp
z!*Y2>0f+pn5RW;Gym)WF%%dfYwhMh5|Kw>*r&TGjWL#?l{mW#BdG~Q^s2}nLCm$C2
z<mQ1vdf3GxUv99M6Ly{76ZZ-)@4MOgedJGs+)6Q-bG=bYiK81O5t*}HS#X3N3|!Ux
zbVT7v_Ql1hr^4>*_eXepBgve40)?z2?yB`4!&|QqTB7BwHf>J6ja)|oESbpQWgS`2
z<QBkY@jt^w@z57OfD_rZE^P2FYlUo!lWANb`uA)^*(~WIcdSFGa^zT!9?y>vxUU>#
z6Jb5VXS%6gf5Q$rb054`RY<5pfawS|{t!Qc8`Tb<@kFa#lZ@#vDMj9l5--&I{>*Gs
z77s>AXBQ%8#mtf{;#y>nUk9&Dcr7kd)9X2*=ynKfQFwQM$qm{P7}Lq8n$7F3yx_UO
zARKutgT7p?`3mDVRDAWXr3Y<=ja&$xl5ypRGPF21v)AUNBl89}D)Crh_jwbh_>ld|
zq6d3Fxo^oi_-=6g|KS2T*y;%D?s~jy4NLo`-2(fnL5AlJK8X<Gb;*tAG}h(7Cgo2o
zuGt~H(a^=~JxDuEKV1$>FJoNa%%}XLzx5SQzjl!wUgeX40($-_FF>!x-rhIWZ=ktP
zgb8qbN_W?$I>$MpAR$eUQ~}es+ih*^@?%eyGj6eJkIn>8T(KH`?$CW;UIqSfrN71v
z4+`Fg6XweX|6zsoyv%r2Ww-_u8mgxT(gB$$<Ei*trH*pQm9T8%57@<p$88dKfM35C
z=`8=eBqbST0!uQZ0uRN5ElO@Q_k~>kDxt0gK1Y^j#*FI_%OxUaz*dQELG|(C#~d|x
zB=Yi83+|KEQ%vG>H@IiP>4>)Pm&wj`4k)G%!vN~S?&C{5(vnoS*<bgysULaUU&6r=
zDfvn4$NqU%*mY$sqzV4IY<vKBD$Dyg&Zx)zdqpc}TJ{u+s{!*ndR?wseP@N7-(O)+
zO?WnG7!)!*8@9{)%Yli`Kkp&uJu1>M874RFwx%X#>Jx^g9#9PZTwjcmWH&ocUP;Qm
z)DBjocQ%UM2d2`|@u$YOaBJfP7h+$$07%r_>3z)d*kXkr@!C!OD$6{SlKH#-rgcAC
zgMidG7}5JLmD!TC7Z-*YI=bG&>Whg@f76t|mB;mS(eIe;woeZbn&fD3&59QmQ`4CP
zjf{8r?Mx0eJtc32u*J3AcCDw-4=gDFk{B&x16V9c0$X<hNpluQ)JMn7PP_Js$5DP)
zjCuZ(R63{Z<zr&7(>qc@Uf^v}eEMLVwlNjhe19-E$Yd<l6ca91aySY@VubQ|3#9=z
ztI|xjWWSZsu`Ie_OS`boH1L8FJB}1%p9UmX^Se@ejud9c+7`&EY~>9!MWY1#>6~O!
zKsC;=1tAYt<=6I8iO|uFk%g-`eoth#{f3FwE`bnjO{Ja{Nn-BoK5LGe9{Lzp^)vcI
z2(ej%xDXj&@A~3@S&oR94t-;&usM|U?=O(!r1*Jeb8~&Kv;fRaaWAtypA9u**(+l&
z@lcyp$Wz+b|M_s5{Iv)f9$8c)V4u^(<jQdYWY9a?UJ-(;rw!ddxcwNMdJh#>ZRCqj
z_Um&R!OMJiUHh3vx#~{A4G$w3Bq7Ucm|;5c*4gB><dRt<CRE8lu#S!N7<eI8p=f1s
zT>42($MzU4d*`glMp@PlkFg~J8$oB`9IkK|K_{OWHVclgpqe)4{|>_2TpwMq-TR1M
zsnNTeXKqIAg3A+v{EHGh3dyUEXW5{`hcLP4*ZG(#J$X{=0Xahc@t(Qz9xq<Jv7}QP
z3D|z@PJ`Di(T_EFj@a(X>lcm*1SwWFlTL@AnFSsroGlGHwUD{a<Z;^x!N(KoYdy<(
z(41VP75hCiE|W;LBG`#_W2z1Z?cb-CD?Hn<o3Lf6+c+I{<UQ*<BGRjh4w*1}uW^^H
zqhb+AO}dZMyeh^QCbUO_&3%#v+9r|dqP}sg3!ayypShb3eo*DTUo&l5C_mzId+(DD
zVKMZ7hBOuRenm71GE}-E3nzvvj}rGIC{Gn``%ST@dupP}&~LND|9RTHtqmuK&vqVS
zQT@J6_$JfJj1gAEbLM=ILWU?rq_m4yaoA?L<dNJu)@cKS)RmE7F7zua{9Wx2i~JP3
zjtAjU0*~*c_B-+*9&BghwBiy-m2yi4QF?37%Wx1gMdg8&h|E*Os(7Q$^W<K|OF*iw
z)tnTE;va?Xoc>Wce_FMEvJHRzdQ^kW_dU7d^hS$N6RiA_Kox+gt8uv;a<KdjPj|FB
z>%UrF0F*ud^!mxQlwSt?H~yaw1%1El57oWz3LFYUCpI0xfOT%~tndEZI5DI?H#ksP
z%6(K{supuB%i~MGJF@aZRK3X(gVu!WFy!wX)Z@&GFakV<s!1*G*j5#@t7M%+h#NQ|
zBMI|lNjaSou&ssmp~`ieX7@sQO2%B+9#8q+YuPJ$+1n6NOct*bD>BEvtZGo{tL`+Z
z?&zbB{%;-c3&tupn!WT?c1W3Qn5b8yusd=ZO_YF^VWgAAoxo~eapFG>X-{CYBZ{kA
zCL?%2FMgAWWyCo;kv`69#1gfR*TY3ClLkm6_u6QT_2y@q|CPBXa8dhCemzQB#pfn^
z*P?inRtx(=YKia=uUrr!WGA9_oqQg8sMy60Ih^uX3;e_H4Fw9Kf4ik^Xo3+RCINyP
zH@07c2SQA1s$6__vZ$?VLMDk+lsIQeZ_bOhmlmw?q-Ocyv1<$_!_JW*l1+WWxNvD)
zY5XJY9QV{Cuxz1`%51#4%=s1j!KZ80`r+(S<)5^~=`{UT%5kIePTc77DEwM}udLag
zrFLC9xn$5ID@}=4Una*;JYeCZZBK*?#rA~H_5^ce{c$t~Ui34!$Cu>?m1I;?xz_!A
z^nNg`8)=rI7EwtRb95mONt>Xm^r0RjjT&3|+lX@UQc)cZgJr&sTrIOAgaE6BWzJVF
z9BmH=fTvl??6HwHrm#=|bA@kOYcI)=BUYXCV<96Tt^3TZ^)onE`6xODZ9m{`pziYK
z7M?yib`RR~h4wX<`%+e1X>6IlD`4ES@|NcyGEnD}?Nd-6zq}|&2a7Js_@8N_YrpkS
z#Vjy9F<Y`Uy)|D<HQp31^^auksjU7vwLI?Bbx7a#?VJ$J_eF|F8#VaDsDkcVH9U}x
zC=0pKptrN&9%EM%g0vkn)#?|u>eT`YtraJQOkc<O2p(}Z3v*)g@yw4c%kQ$}hn7mY
z$WOTJg!Ab6ICL(#BlcfH9h~&bp}Fq@p(?O!qDk42Wag|rrYCC58FE(g2yr>Yz}vt5
z!$bohncn3*E26`BloqS;r{oawwTQ}ALa^OC^I)CPF$_n)4ee@2qer$3kS#5_=Ohj}
zNu9)pBssfdF4p(wX~_$UU?9awcgc!#d}c>lo*QKCSY?L)<?OW9Z_m)A;h1!Cn1GJ(
zyS=8HK3-a!CS}LSz)2nrA|{HH^j7~CV4{unOo|C{4?0T~ZWb8N4e^`zbJEnh-#c?H
z?`cBV@7bQ#>fQe}?sD+hO)t>9ecNJLG?!$=HE3<E{lpG5^uPDoWvbab6fC=lSX@2}
zCSKC{k(PyRGYJDqiC&G-atYc7Zy<0RIoK9T8~nWy9mlBa`Adbh@A-L20gno~PJ8a(
zQBJ|*5Ev`21B3*Thc@Zl@2MD_ST@k}hktnMQ^@|h7U@Rp`|Nb>pz>BCpw>DSHf#M8
z<V_Cq49I+nv4_<<E)+BvnI6f-1l<rZh}&VO6dI;Y1>p<-nS<KJ8INwEzZyHv6u^%f
z`TIkgOaOY3QPvwDAb0Wt=boM>`;(CVw>cD>ecSfWZv?STZ%p2*B~bNdX>~H?4o;V@
zwu@F{^IL|tYtHx5cydF^@7p{y52A-cSN^?Z{HpQH^U0ODMgyf3sOXVH@1y8J@*1n*
zW$8$HNssUYR+nLHvmXq?hp59kHF!O7JytgBrpk4t$xOZzm8tPuRU=D&(eeT49r|@>
zdr6zY*SC$e`rHU=2pIY6{ljBING!4XO|8=PDETDq&K@pxud$Q~XsfyX39D<StNnT#
z2$UcV1lLaRXqJMm2y!BA`{$WW{-HyMV!q%)e{3Ec4iraeC%$0PuEP8mt9t*z{oYa_
zHPMdU?mwllts6l|@qD^WwWe`1OE^~phOWttj@zIjik66|)BRtjyPXrzF5hvdBhS`4
zhL}}!pF;DS0>E@2;QQEIr)9GP$h5}~8hw$!<mZ9TN$>~PuAJXazd%mj{Q13Jn=63c
zkE*~IbDtQPC$NV2Y8D?H7#s*I{3I)bqkq_nx%Cru*<q^0-_1fixsPsZrm-p!{U~cJ
z`>t3o<lu}n;&w*d9<c}*V5B?s4AUO)sTk8rNPf{_hOVTH=I;fCn4DNgqHCrIWIrhW
zL}rG4v^`o4hcVZF8M^CGirC$g;mp|{D3&CG6>s4+Mb#BY)?`0=Pb0X0hE>2=#~g&>
zY{mW{9ViYJ8+`IQKf)O!Qr(J1x~bKW6d}-DZdFV5U<9pfEpFVoNB=XMe}2DF_B72=
zZz4@QF_NKf3Mq~B3}ygQbHVt{2M1#r##}z~Ttv5H%%C_t8-lbU@^}9-s?!li$3jcB
z5tgvyFCG0Q8;rDl@~;OOlBhfn4j0QceRC1uUYJ3BgiqrQsjBtI#?TqKepj_tYA^-1
zjS-VA;wDrZeeZ;1W6Y%{54H%Z2m%DsWf@4{_h8gb(8*>AxaTJu>bUyf7xnO)I>cT5
zr<Z@_KDXP4H6eN3;ks&pt3RAxxx}GK^?%rZzYYF7W<`&9F6)r)eedX;Gaq4<Jg7UH
z0Vgj_p4>*Kb=e?TCxEqxok9hNBG3sB6}dWmK)%o~pG>lEK<pha{ljP@9md{b3Fd(%
zXu?Lk%oHhZt$t{9d=Go@zARBvEy%)Amo0{;&sA&y+2;^W@;Pu4Z-Tv(C<|=}cixRf
zCMX&Sg)Rg=3(3>iEJQikB8LuactcC!hvG&6PmSD1`cUq_@gO((-(GfzUyc3?Z)@q6
zeHGIAg+q}XX<z8iJ3bF-*6o6b&M(eurVIVh)kIFgfK)<Ug!#E)p<cXjaFCQIMk6-^
zJItXyDQ&$Tqp9EsF>9WOjBy$WYuqxLQ{;WvpH_HJZ?{r)2gr6<zF-$3q=exL+m31|
z{*z&QH^dqs?F9s!AaSfK=FW+%QF(!eN66J&#l;gvBv)jM=GN9692`|;YgWv?I>isH
zx};R{L*E<A$5B4oJz4PY{u6!+lc+^=f@&~7*1xENVJK%4l^}%L7xu(jhV3ZK7^M%y
zLE_T6pr8LBpQNsYfLJi;YvK-OBApv2sIw;M^5BQB;Ef)Y=f)~wGf@R1CPI!I=bChi
z)V9fM{|f*g8><;|J5`O=vRSS}mKU^vsl{C`ZF`A$FREAPmM+KLnk@>L!EvEC(D-mk
z|FN(yE22A;`4t<=9O|B+Ii%uZ{16bmJ<I0gQS#M_>>KldATp4o_a{B*W&SUMEyVWQ
z$!}ivhC5d51{3AmaV^+CESRp3jW?nli&NdbV@5YNHq|Fo?%e0Fvd5weCsPb7_s!0M
z*}t6b+@|v?1qA<eqFGC=#UR>0B0lehSFDb+@!ec(O9%N=U2U(TD7+^_-{oX|3O~7C
zz7ZcY+~|p)KYl)#UFzQCu1^%(=zWn*%b#B>PfS2GTe=ZUwa~fGL7wjEUibCuES%ls
z+Hq&{q%#)=J$kfdW`5iJq@+7=K?n@!(W>ccXb5saN%nxLCBN8BO#9b-SI!+<dB7Uo
z-xaSe+}#OD6S{M|xI7gjo;I9Ws3^>3?9HEyzP}%q%PodB<TN9;0yj2h6q$V`ZJf=^
zeK#t~5X4$3$D&cfGgbOk_GiYrhW>4U5`7zL?7dsF{pDueH*Q*8ub$+ySGQsfKlW;v
zQV_4%ueNpoVl&<bXCy!{QaumpS%Qv%Ci&e7xS63M=O?H%wIAMVS1}x$0xiv-)w28b
zkI}ZUDtib*G3v1QJ`;TXy61=mfcvh!T8Y^i&|^%3H?Vf4<+Jx(hs}Qk{;k!t+4I2_
z(8YfVz}F-_u;Nh0GEYA0j6aWuseBvI)X@s1Rk%aZn=@Q3rx^~F<kHzp<9f1BuD+Zx
z16XHxXu#q<_A2xTo{J7B|FS~oseZP#eoZJaWXmmUL}z2ReAYzM1Y5*enUgoH#u{0n
zO}LUDcWu)pCB&UwL+@M8P_U;6FqYqrAZV-s?Vh#-zLe*HaYH}x8|FWZe(Z6*?Gn}q
zOrHAtH{QKYsDIt$-vv(4Uh%32{WZXQKKMBR@xG*^@kre>w^-*@_+J&uJZvA_)bEL0
zq9}0T)jOAopL8Vj^hH~1z&_?p2(4zZ2}>y^H|f}s5%x&~Q_z^qbwBcxJeL;{1ZK!S
zfyHsqQ%s%wjYu~yCTI*sBpGg>uxW{S9jSWVRzbWQ|I1FSF0OPGegtOu<Ia=Ax_IB*
zRABwvTHJ`&Y?ARNQ?=~NE~AAu&~kJT+a2yEwNqbHfcA!bT6DzX(R$|w2$xR+oc+o9
zaWdKN{!L!gKYaou<R9$90|Fn<S6><YC(Ube8vO558-SB*{-#%b%+LDRA9XQbx?rvF
z6ysa3F2@t3Clb<N9VWB=dasGP1}==f)pB4-e7T5`-Swc6oSW8Lku)2dJ;e{ZXJ&~}
zkmJst^1k?FhBsJhqKaA9NT=QeZo8|NUC>j;Gb{}I<>_3;O(*G?;<Rq67r8e9G+xmx
zLPZEw$;n}|M`;HlJ=IAMyFthQ-sgvc$KVPaD^s~pgB>zSbzv+*&6^$#J@<r<lIlVo
z8mh3VabJ<`)>xTvOCK&W=5dNM6?)%1`=hy&wlV8u^BqUh$IS@-m<U*h>|d<|ry!p^
z?KYyqhJ-A=e<ccc9vZ`%W7wA-3>KvmDC$rKZ;28u7Lqo#2WZmAx7GEOt7Xqh=1WSr
zSlRNJEkw@)wjL%dqAWW21Q_7@fUd^A5A$88FW(>w7Wd%2pH3EP+|z}$BZ6xjp3J?e
z4&1>Jlz<nd*NJ}k__&u}`f}cxwuKu*17S#hH%XQ*Fi=8q7VKY*wQPPV>hijxjAvKf
zmVZCj*7-=R<}LFVB$2Asd&OC|0p|>3H3r6R*xZ1Kdg$yX>94hSau3d~@%bwM(ucx_
z#peM{8V?mswcfVb9jJKoHg`d?>xnCpO>=*QJOKUuv&G9*!3cR@m%BU|-kg;C>&lX0
z$r4%|-n-<PFal<*q->DIYCsgtTHOx#fa4AFU(g%(!C~9b7ORuct(ArIej3S=sSkWP
z0gpcN5ki69moaB|0xb1&h}+?2&@!h|!k@e1d=C+Bvy-YBdUv)9yr1~;bsW?3-F4K>
zmVOs=-I6O=Y<01_hx0^up2daYua}77t?XZSofE0du^qGD{IOj(J!KRSje-4<>`os)
z0M-MLU_a)cp^7(dn#k)s0Q8x@eI~^NbEr#Ru@>s}Xzdc+84_6tt<N;<|GqQX-zpV^
zYCqyi(~_zW8oa{NRFoF3)aS#OTbx)|>T*dJ*j3;G3Ru^O4U!>iB~=3rIuJ_6MAlRp
z2|C_42?}UZ6B+;F9hWYUvC39>y_Q2s2nXp>?ofnv;VEVeTwRwzQt}ZOq=lpJuDGvm
zRjF9%&mIHZP5JQHz^#OcU2;uNWpj19&rO4+=VzRk>gg6BO8|X*dn9BCC(_--Oy*rR
z$|T0a%Jarxc7DVVSj{M3ziOZv@}5X)KPV~8Ie%WbIrh7L?s;eP)T!xh6n6*X8C%}c
zYLrVFP<Jqe@O9vXeF@$knDaAdX7Ek@tPEOPuYEh`p|nel?$JCdx&X*OmO!aDJ<4_-
zJpl{`-sw5E+$<ZD9YynH7D5<0rC)R|v-K2!6t-w#3Kjw!zq_1b4<z(n_aV`SoSNGj
zP9Pw4>{y-PY%vB)S3>i4=A%~2hF*q_Mh|phe>G-nkw|fFLHr&3wRsGl?Ky)Gd|@kL
zckF-b_j$8n47SWNZ&ot?3HYrl-vUYj_(2pBSGfwdN534y4OV5)F7D<`R3aNaH6KUu
zAbGSske^Fs(S5#G^Wbq(<T2O8+Xiuqr1AG;F7`oNB>6l7Tm&V>BHgIvY!*G2f-ycF
zKF+4V6`%5AYv6lKA{*)F0Y8b8*1q~l$)V%C50%iVP*3)&;SZ-LbhGSFraL%;N^fO$
zZf-)#n|1eG3}en;wZpgshlp0oT-2h|SUwY;y_5sY-|SBZnS;N4jM7f8keEZbQ&ro~
z!Iy6HE%=g^ws=UbZF@a0+h?Fw97JQBL$W~FS?ymCA|v>Rli$Pk><JpmirIq&=nyWj
z^uu(K(cCC0ZnXYkRp^k9FF^V9WQXFCafI_FZfk1_dbYX#8#$6RD6sia_ww^4uDepR
zT-(&a-%gA;^kPY*>*>AREMUNcE4G`t4zTeMb%oz{g1#>9mb)(6s-K&4GD#Ia@~Ypf
zQsp8c`Ar*~`5Pzc#WEpGnBxqr-d#9nP(e84-iM2QW2O2nfsWvuN!mP8DlnC;FMV!#
zVZ`E>LEv8zC+NZk+J5k<lGI$8h!9D_GL*x7W|yR~KbYl{QVQa(-q1|C?7=->!5H)O
zxT@w-PkFpWHH$p)-kNBf`~eN`Ay;yH9S`TB-Uk}*wbk?x(z01U4wey=KAAfR*k0)^
z1lZnlis{G;+WD~j^`4WR=ZJ;8sL3E=Lk-PDa&Y6#`_Pvd#3=5|hYC%88kWuqM5ZCn
zUC={V9cmRDT4xtP<7z4m-5m+ah45)8>BV5dV}rmlJR`R1w^?fAx5C55C4U)CuN3H<
zgDzX>p~0}4^`Y;T`ZjRmKb@(Tf8<?fH||bCSR>+MP#Tn%z(uU|+FL;MOhMd#90kRJ
z{)!uU&ja`Tvi1FC9Vp@L&RAJ&7aJ>VJu`+7J9a3t|1hyLYh2Athz3yyql8iB4NI60
z>W17529iwd^*Ww09q`TA1O;gdOvM^{eQuaFJNOH?VMHj9)ySafP+(`sBGxfvm*^BX
zv0~OsqhS8?fX`ai(rFYc)d<%IvDK!Cuc78iDMf3*ghfMaB~M3=1Ps9~2~%L&{PNG6
zREGk)m|z*8x>ht%`F%uVuHF-r58eTqWN9<+C5d?hAC=Pc@Whl;d`!ZjDyV$%tF7iY
zQf(*&@zdA1wgjeawlBq*F=Vy~<6_7tr=zO=zo`q(#MjMtooLs}A;V!<Q0wd#j93F+
zJe|!OHM4^3O|0F&tkI^WHsogxqDR8NWal3PyS!VBRiIj9Rd?N$SNCf4iMgV0oSyiy
z0klD*ofV;9HvDD=vvhGxAxX%ORXY~B2H7m?Z4a%v`UduyXJ1VLulxu0q>O$EmZ;Qs
zc}g(OD1t~<ie=CD4kydQY2AM9IC#T1q~)H7qyjP}@Lk}WCvg2hmth+1*0%MWs~=g$
zb$0^hrO$F&K($6ek55|8H6CFHlQ?*H?Ep-`%gvd`m~N%Z?{&+25YsH&)YFOdyyfp}
zp}^XH%?N_UYB@kqyLt88ebYiRn6!uBDbLT{G6_*k=$fIGiHZD%$hhap)_*cgQvusi
zf)*!gwh!c-htyrd5G@8pDx4};*RI=TL5p+eM`elg!-eLYS#dw!RP-a*si79cg^_kN
zk@j#gcl(%)_M3H*eoD|<sZ%1aqlBzka3M1G`mX7|aE&IlUB3g)14d4vmdqjt?zM~m
z2Jl7g*Vasx`2a3p&x*XIeKq@%A-Zt+Q54+x363%w%lSeJQlq+z@?fw22jli0C&nSn
zZ+G>1OMXP>-Tjnev4WYtANAic%cuVYDlmu3>x@1hOnn%J*4b~ZAe6_)%#x#msdyN4
z^`oDOp%uHN^j9(q{vkbi)avKZQxZNY2{z>}r$erL6nHOdGU@-A!FeO@^(MiD;?1e{
z(k_So`J?k0;4P&$hsa@-#z~C7dWL^8HD+0p@18v~S{EUy-cm6An#gNF!udq6DvlC~
zz`k&J7xJ)rAGB#vHzAfO9Z1<rV$CsB%oZo7Kt$xAGoP?&PAT-2Qf9Hh6KrqW<tDm-
zI!6e3;^N}sryfk3s4wU}=Pg$381#NP7u~*-bZG$JZW%O`gS9%#7ZzcOwO`I#&-07;
zV4{7>fM}FRYRRx<OH2lHtecpui^Ds<KU7Ad!Zn#V$nM1`6?b-+z`n(_xm(P-$HY@2
zgyHww)|ee}!$8`@iOMOjvwLyBq$Or5u$<<ef^7fIl*Ghp<dRhE#XnO$7fhBN)qqpP
z?*|5%=xMnuWh2Lrng~=3xb?ko6G;6FaCc;#ql&J{MOC``X{nEV5^)at@)1Lh`q@H8
z*3M8+4^AU)S%tcJaI(d?0yz&swVw-#D$wdTF+t9sT+k_eT5{2LeACU_WA+0@`4N!p
zfMDp<bZ5~C2o42{F;Cku!?he;s-EL&oz^b}O~VdwmNkW>G06lpVItMBPp<NtYwZnI
zRUeBDlnm4)YNyc>qVezS-2X(mN%ap(AwG{nwdz$lqwtVR_>9b`h}M?HLyqic#o!+s
ze~I|((Sgp}8fKBnn@EUCw(PKAwe<(teQKjAWS6mvHs&>r3g_;hknfy0qowplv#;M(
zT6bf%(*-?mfTt_qiKd@}I+E=8VOt5oMLD{x$eprk!MjFAhENw<GBenWSzb?m!51tc
z<`PzH0WV2ySVgnt3h?+NsbLDD#s*ayh&2qDh^sKS=E_npaW55F%U_AZ{+^HD!O|_H
zk6)@l#u<S0uhZu8<(3qqey__Of2bq~@T{brU@16ou|OuBq<<3>NaT9~LwJWSp4kiH
z%;<#y@fn`}V_OBe$rW2~7sIRI#K=Ddwa&fKw321^g^=>y9<I5K&VR}8Q{Bn6$RZ55
zi&+#LFa^2B=zQrk$|m#s!C3x@<XT?auO9Tn%THN^?U2!SkbANrpV3K=Eo~C)Z9PYM
zK$h8$;l;KyXe*@coCTFuNu0u(wfCxaUSPGlUYOM981`d=apBJL=&3<JzI9xIRjxXz
zn4%121qT^l)3kOeFPKGXEECbbC|i1w%SvZt+HOiV+mx467QYz+B*s9@9RT~fh809$
zzo?|oX}IfuqHqhy(4-s9606HL7<cS9<zs82RA7HfgVf+$-dZ+n%Z~A`gp?}R#j=HP
zg{Q&DwFKWod0=_Su!<=k*WETKJx^SAM(L*pfrHH9P{22;U*vjE^fFKeA~rO*+{Y~K
z2nOqA3C)Ah54H=a4xOXOT0*Z)LO}{bCVMzwQz@!sR%W4`qGg0mv?L?IEek<&IIeMO
zNttKsRXmAv7gn+9ZdsXIdca~ZBIwO2sMUMX?3wE~?h}pPUcPsQdCOF?1qyG_7sHMw
z>pTu_z6VdVloP~<-<3FHBaDSC$`dSKx{lGCJN0mPP+TmAs%h)M1lvFT+Sh4A{)EOM
z9O>~Ix;;T!=<FR%x}a<Pn5R{}IMeMOmb+3Xdf0y~n<uAT8ksG?)*<JJiN<?gnk6>x
zPJ`FPrUYMv-|t<w$*`9}J9MXd4V@+;qb#qv#PPcdLs&yDlMrveP%_6psEngqZcc(%
z?m{$`Lt!r^N#=%>5SPv3ju7UN<gu|7sVIh$llvi8E9xCS3iMt&mxV3{P<5N)qswsp
zBlEuidzRPvy#H}1N|#%;OjeVPhWsyb;^?2!;V=(ZM!UlFM_8mB7bfRNl}|X$%?f5r
zaO@|pDN1P`Cz)&ezUVZaY3btpx(W9bXUuV=r!O0ubXkFFi8n7F!3vS)zlrgT@qUez
z5$i7ioA!X&&&k<-PH)GJebe#42aiKT0PyARaHj6g|2sv#19<cPLX&-oo2{Q4(8mqx
z?+W&P0r9yE`&xy1OCr}#kuLnPcV=#~<GXmy`3G;S{JFtX;?n6}`jqbXR!;X0EP)+>
z3bcQ&nVr3F(FbyE(Pt#n$-po27F@fM*oWq+a>9o<k*oFD%t#_QOy;LC`^wbdXLEaA
zeE<pIG+K33<KSPgHdU<ms52TAaOm}BaU8xt+~07Lu@%o-t)?9LNwfB6GC@Ki@wC3j
z@Y3XKn(KKmmZAAb)<kPCjf%LP+lswvC$RsgqewK#3j3%LE9qc80<pU>rpc=N#r8Sr
zHpHTF-5C{0<%YMO8f%td2<Q{zl~BhDA%Ve2Xss!87x7>@Q`V{xqwG_6+tb?}YtI42
zGXo;ms8SD2F1>s9^>4P|D<ho{7g7!oBONGWnPI2mwZv0R!iqB}I9H^1f7|LgFyJom
z>)=(I83?qu`yLDbnSXTnZ-f8-dZ+#koPAZf1zrvV>jV&X!Vc+~9_Pc6)X)cnTts<{
zu(~C>)PqfU-!Z?sHlp?Xm@szlUudo#9w9S7W0&{fn%?pOXVP%l<fQK=cEITS5B-=!
z{RsUXejZ=pt116)N|q66X%-D54CLKNnp(3+?4j#vOw0_U{iu1hJf;=T9;@xlx70#(
zu045U|4jb}&b?V9e@&D;$Nv10?|UyT#Mh>E{jlu&e*GZOlRr{#>+tmv{ABE8+Z>6w
zDoU^Q`Ucc1DHQ#s&e7<>Z1mA*$5a+ReENiWkhG%k9|L!f-SQlZ;2XQbMdeQ$mxsYx
zLl=o0LV}5Z;D{whPnf_t2&kdg5SIC(Ic%-Q313`%`j1fF#3Jr1gTk81&4vsch1CTo
zGQCjCb3EaQ$?RYG&blL$EJu$4Szp5mS(TiJHb^3cdm3iAW<kkWubCFOGbwC0tRIy<
z(ns;ckZSeNhKVX+jrrwqYMc@N0$Eu8643O&jhJvqdcG83Zu;+T4Wz7fWJ0OAm)F%C
zX={zR+2Gps23d~sNQIpqbQcpb`-=^Rt10J3Wc)|B<`YP@K+#n4g1*0`HwOA{@ZD>#
z$ff<w(rcABS~sD^!)pw{r)%??f*~k_2pAuMM?HkCtW|C|4D3!;u^Li{pCz8{A;%U~
zkqrotLC+Vs1JRfRxJH$@bK4E>js<doKBc9{(oo}~_SKXYu9}fhjK2s9M+CD(;Glf}
z+(cVUPn^x3$DxQ085}Y(?2eK)4+nZG4NHq6tliwj?{(+9>@LnVCM~KoiiWr-$OlCy
zuup0%1&<?QF4!KLiEbsX9+l?v)J#}MO8!3SySwf9;~D4U1^6r>LP*-N<%PY-@`@vf
zuP0{bz-_F6dbdd0tCb$dx8a=#=DUg;&=qCg<#$y18vmO@A4$wN(vn%`h7e;+K|&+=
zqI~&VYOeh#Ccw}?p~Q+8F)>e@Sf;1H&FE-cGj(0E3qXoZxj0qzZ5w>@5j&`YKI2%~
z#S+8?Zd)lta_3>|1x*O=^8C55zG;_lR$m{F)LsEb@N2*I_1=es^@2Opz}WNw_v}u&
z?^l6JK7DDT(61Tz*RRRZcMj}9w!)gCFFd1SQ}W<+297^ih4e^K-ll3ynJ}jEp8i*h
z0kvmZA2Lh#cM2|{Tbz}w!4iw6jOQQ=uywG-s{Hg~u(8iMW`$~OniH^FvI+p`mvvD5
zH7*bHStQv>@YnS@=90$9_dD`2t~2sPPIUJ`i5S#i%a^F!r%1C=n_@=%GG)1g_LDih
zTi9IN18_tkSNfojC)$10&)Y7_92sdsVpDz2Gd|A{cy<cgv{fhtvIKb2<D1pHoe4Z6
zvuC(_YLwDzJ@Uwm@x_I@k}Tz|La8UvUGfM}g?kWIk}Kt7s0Jh<ch*!@%#c5QK5s|!
zA7MqoHhD;am5IAdt_?B~B}YQUa=c=KyNYO1V=F2{#o}=ft#)izdw90%0$T!qyNUU^
zv`s!L>PI(e#b6gz($j1S-jK=>cx7zTRtO=O8t#zZt0@aH%ZxMj;VjR_hR(zH_yWl;
zoDF5GcE$k(h7huB`?u8XJ1Z=n1GSQWO22k=p{`{(lhjNLtP+F|i`ar-Gwo^zVD=$-
zsce8Q&3$kqv<)8^h=3t5GQZxaBVGy<B9B{xvue>2HluC?ytN2%I>$8=@u8r_Aej*B
zB-6~0`rdVx6r)f=BznEELz9Tf5FGXk&uNfdg9R0kn0<GO$YFR^q&qWf=pUIj?D{u%
z)!0MAAr_;YD$0C%{T`e}Jp8z5G`gjEJnJ2H9@NWmZO=dbi@f8qilt0pM@On$2^_Bw
zTILhMhwd}aQ$51#V_E5kL{#V>53*a__#yTCeVqW>BtmAWuEa5WESfxXwToAe%9rqk
zI>MaxO@UBN;oZ%Qpox64Ix;`4D8;TYad+!;8q&AmagDmkR02hpJfh(B4e-TmdWV^>
zm|8q8>k`+juL%kAxsFynH8^i`p7v9$L~hqRgJa{!B;+olrdc{$aPXKsJ?|sl^8Vw+
z10^LHmk74b+LvkGQ?PTWT)+v8TFm>QY6m7brIHzx8?8c6{#DBi6V$Qqk~B^-9<!Q;
zZ`LB5-j@8o$9x-ZQC3-j3~xfS8gn#=YaXdGAAIa*`#un_QIN_M8vj7(ivC##0^zWJ
z^XTqH={rq+yb+Y=Q{GAXaV>cPs5LS-9g@!Iob!tFU}Hiv1X8F;lB*{jEt~26CIw{X
z#e7iyI|4rK=Xrr02bv4xZMl65j^}t$4IC4DruBDUFY+Ahh_`@j#>5p^C~NCZ=K<-=
zXf9cra3z6F0bV|SzQE`3PHmt=VSba?J}o;A{-yCmTll&AEIFtHGL>Au{RXsnd9M1$
z=2EGcT$Z0WN4&=x=q|W$<?n|%*0s*{qSUs|>*j=(8`T$cLw!?~7xiA!<+r3qIdj)t
z<DiwJcV>KM`_KY<8&xdR6<gwK)V1M^wAhz^7^f9KXQ#=4vZ;yWv3Np$3{hpjooO?u
z#aPN&Y!-!N49mbMkc=7%3nn__qe@Q}`yM9Wc*xun2GFvC@2{J*cHr#0%7(vhVE4}x
z7IEOiqhjXQYH{6rzQ7^)jko3<?J4eW!O}Jt7VL;H@-PJ{_<q|2qt-lf#8e5aY&yXf
zyx=kORGFmi^eWabJScm<Z8m*yk*_P9{wdP>)9SX9-a-0ktXabfZ%^#??nkxQpCf%D
z$f>Ak4C!dW>bLpz7&KU;NjqL=Mm%Ba-)uBeE?&ct5y<{)s9|_pdz@+3$}7)+`Td>m
z%K*8!mem^NVlKDx0b!Q@IpQ#i9x9LFESXZX6Ou4_Doc}+J;)A>2sc{wTZh*?&~The
zH^58pJ*2?P<inRQ8{DTA#_KZeZI$MpdQ*R$Ss+|CBtR0(=nKIL<z6Yr?ssST7M3tA
zQ?WMso16PIZxmPJm``$6)bm*TQ-yIH%1K1AcRfJlC@{_&ao3x-s?XH;YXp4XJm1XJ
z%%|>ibpN(U^6dhLFP(rLuRL`(OC`Lgv2_W+_;8na%0N?1fvY)k4>oFPeq4%?e7|#e
zc>uz6dOX^Qwvu=dqzR1W3k=!~!YnJ@YqRfj%{8|W{TZ=~oX-<c72c+{FtM;X2L-tR
z(#wGq*)&J!=ubI8<y>gWX7V;I5@e=C`#j{5)WI%?LcZT-ryQ|2J4Eb5LbiYA?Ph>_
z7d9f`RZnRga)t1bb~))iKy!98RWy)!&7l)=d^ah!)3YY{vAT<NqlDMA<PJPr?yHQn
zW{Q*Akd7Q;`u6BaIlNfGo!Pj!uu=e)QR=kiN)(f!!NrS*J^d9cKEv0Av3KH*gYNc<
z*~LMJ4(iFS*cI<1F9f()(J;u;rrIb$WHnm0gc(%Ge1g^NR#0ulhiPKM;3;=fmIw$u
z3No!hPHXNji1|mJ9BJFBwPi<t4A@HY08lbh&*e=m*8*#8G;i;~gVBY5s{;H?SE%6V
zXhXa#Ys(IK>^~?DXqs1PZ*jS4-FPT#dUA`Kh87#=Nc>LUYnscAbcZ2hyVo*AY}XA&
z+AXCDsD;1D3zGBDL=EW8$quq6n_jhBjJro7%S5&nEPkMQ?J?zMOpcuFX)@Sl44$8a
z4IQ}2A_bihRSjg{b|PI#Wi6P=s2bOUc$xlAX0hICp5`X=ETz*NdaWw4Zz62yR6k>I
z9CjJQ<Ar-h1cbP6+5w%~l~*u`7%8l5;UisAc6iBA{&0<q8Ma|DRYgEI$LL{UG<{Wp
zjb{+SmXXKy58P#MQ*Ay@=8SDcXKiez;~`FPHcSd_8=4iPZW@qLQJ!3<Nh~oGM`m;p
zE=GS5Y{%sitj7@WSRa%7e+(=wKzEwwLt=kD|3)oIjQr<ZHt9B`xJKfSIEK$W^rId)
zl$G$-Zzvc0Z8M+bNhaT^o>&2bOfT5r2P^5H?f~qO;`}YLHni=~a(Qar>iDC8##mP#
z)14x16~+vUe%eVt2&>BT!)sdZl?L@IZ(nJG{mwgFUg=$XPb8%WS#P)~2J?7ifIpP4
zoVRs$#_Cz=Lqnn9NOU#w$V96FdF!RdxQ()1YX)>tktQ<V14jQ|8iB$~o|AAu8TOSA
zAH6@5OBM^s%R?4q(CLSE_QN}%*zaU7min(nP^s5cgyKsT>w|SBIZ9@k`s64s2VSba
zCXosex(!Z{3$+BB;mJ_y+d38Emv(AIA-?fE$V0&`_`<WUT<s6W_uq(QKMc%1d|(a)
z61m(o9^b(Dw;Su$2gb&=WXEw<gLjoG(;>4`tl5XGs%PEm+$E|PafeSQYUF-F@7plk
zBrP6gK9u~G$p!gAIh?OAJ}31M^t;#cAx|5H!Sne7YXy`+$WFvy$;r9+_=0Gvh@*VF
zBA)B`bm%XNbH4quQ7+;_0uhS>`u!S689;2>a9lEk7X6xC%S7r@-|VrRd|{hb$;_%e
zRc^LsF^M8OpNt}^+YTl%M-|X?wsl10x~hZ3Mmz4yy>Dn7M)j#%nu9w@_|JL$U2zhc
z=<E#Gt2s%i5;FO|gge2~?<K`(4;#!H38ME3?4_>FA~tkoBlf|tspe1%PD_L1G9_qZ
zhgoO6&3ubpi^4neMnM$2XS<PJb-DK4_rTj>2Zx;eW@2G+K()?->dF+xBfxJ)d_W!e
zO1>M$s}>s!49b}%t1^rk${{h(XXd9g4j9zCA;WpH-$fF%tb+onCR9HM&_Hwj4*;1!
zX21NzUpj9WG>W}b&l+eXdH<QcBR!$lx9Q`6Xf6JuzN$A}v2(xoj~@f)_rtP_<jm1s
zGGw?)HbOoH^u|Ld*d$WMU!4&781X)b^pCTL!ru@}rkL#)2dM~_`%cKuJoDq+G;?5n
zn4cGo8?f7>ts}hj(bz1Und9cW<^!ID1|Yw`#W6>6A^POZy627bB)W-*g+t~+KXx!B
zn<egdx}>{mx{IiuU8k_*r{KY?tZ)vL{!kf}!|21Lj;0F{DqZH!LJSOIf4K6JO%45P
zgBip&HaCx;`J_=^#6dl|9xPT4WM#3Ejt}abAsRL|S8_paH{bB9Y5#rJXvy8mEx7ZF
zP2#k?FuqNdJ2<TH!Ywd|>^2}QbFM!2k{ix3yX_GzG6>`VC_}U+s#e9AGs9}zGqZg=
zoP-}VJ(`Wo^JT;8{IB^G>_2D&UD8dwx0+5zU#O2c@qgBzY^>+(Kb~xEu79=v_%lAd
zQC`3VcRF;Ukab}8*<q}Bi4t$40b9C0+ewBT2aT?5&rr*n?Gguj*S0ts@}n=>+IO>C
z8%CGxohJzn)XF-Ehd9Y2iR&ixc}-1zR}j(6?`JPguWq?BJa#lC4b!(gGrxYPLtLJ8
zrhMruzW8q>K85{%9uq5`eo6DM+53Nkc0BF*oc-6shflxm|3BkHx6W7bBy***K}o;b
z{(QCl`D**~)%NGB?ax=+pU(&hRy6&Apz}-Gs&d2!NX6iM#4eK%c}CY!U)-}zXy4T@
zYb2|lMgc37g5i{{qKQ16gFZp7r>BCFX_hRilN5&qSW1_4w9o)A2TLpkSrP*Q(ecGz
zj-<@t-)Ku>C(wY{HgV)FiAO!moaI2pRU|2%<BvBsgSW2&^(VJV3|1SmJpP>S@GO+a
zEHecNGmFQ_`ogIaL~GY{#9~HNlT~4GSP7Z$l(US$-YN`39)pLQNQgapWP-PI0$z2K
z@hYOxcnC=Sy7~ACOPAN18}z?T{%^DS(Ei1L51Wq)zs+C#_o(@J?)&_2^B4a;Za(?!
z`t#oBf1AJf?@9CNe|!I*TYujB{BQFY|2=Jf_eZ9uk`1XhM%hkmcyFAc2>%~$0)>2~
zRXt~XGYTHCbk#>}d>Ey_-Ey&TdGzhKjundvG`)D|c4S<A^E(|GQoxE@LI*Q?gmlqn
zJ1jRw&z&)ff@Ev+yL<`|-a6s*!$uSTZt}km`QJzU?_>V=3IF@lk)5In^+%h|6}_Q}
z(x(qgpFS#m`ndGzlhUV8i%&(&zOqH2Dvp=`tVl|;jo{_WV533Hwf^C;ej3m7HKZiU
zJk(Dk_||D)v*Eui0E7Q%mz#6D+|({N%e&m1+vP*)@}cSS;oL4CYL^eoyL>pe%SY1X
zBh%%hxm`ZeE+3V5`DkvJkEP4Urpw23yL_x&J}&R_@!T$-NS9Acmrv$)`9!;XQr_j0
zxm`Y$E}xn%pU&;_sdo9ayvwJvyEFu<URV77Hn4d9s3FzX_vC-nW~q^YqUpDRMb|sk
ze5f@a-nr%@t@-HAH6Lru$9JyzL~A~|bIqq(^J!_##xj0w$p0F=Xph`X0QO7}b17qo
ztSq285coWB`5!tI9u-c7m6gVvlS$3X@G>)(usUm4N@i?k6kNpPln*OrX6ev`saQR}
z2$tyC5_r#zh9)!lJsKzetMx|4{!RwrNQ{=)#(Ls$zB#t{UP(e6gczEJ<B%9<IlXlr
zp{7!MN!(@Nb*_0hVvbxkOk{kR2?w&7!m=}-*sLr(faUKHu4Fne_L0gpQw3D!xHw@C
zVhjz%!7`QA;Eg8!@W2vCPZ~%kvT`RFlczGINoL>$=<?WHc&#Fkj|e6pfPmRKEbCS_
zgy+Y=)#xV2oWF`E)NjU``<aGC>&psM>c{X9ewpQdDXZRnUQ!lmSZNWOxOcG881fxO
z`M}6DAkkOCD$Kz$8bZ@qPqhwX1Gp?uvftrvnfV_tWXAO!OTrS`5eWj_(0EcoVHWLk
zCK0Gk1*>_u#`lxsec-dq_B9D&M@tA6UV9c<j>KWKf2(;|ASpru5YsFdG_61iHk3P@
zM5y5a7#iw_FJ}_e$5_%|u@$f+c)Xk@Q`?XRe<DzApwV^N-<(BPu6zuz>u?zN`x1+c
z?!fX_pn+%++L&qcFqtSu%1n4;iXaU6Xe4N}3md~Xn+D)bA#Nc)zl_FkSDV7ZMzXi#
zn#+F)>*Bs_iwx9USHj2X8n%(u*D~&yYmRR(@7V1s3sNnp889&nejwmI3(j`lY;z0=
z!J=*nVKvuL#;)w%T6#n160x^FJpBfIJj$*Mu-I5;#}FM;-k!nq<>VE_C!btB<BSVz
zvbk#Tagp#5@Lm4$!N5JY>9H=Rgx|am2raYB?tKp?m?pubo8`#4&x7?WhROhaaCG=O
z1GI%;AV(D&I9j+B%sT+Dz6Y-yD0rYQ5G){YU&vba3n*Z+*UR7Kp_@SqS>yDE#&)YU
zfU0KW@R(yl4@n@P2D#&SK^*rA`iP+=Ep^%+=V2Om*%92dgFOL98Wk(ERR59#T!hd`
z@-e3SD%RkZra?WSLUz`VCRX&sTe%-y@R`lWR5O#kXNNlNZ*$_C7D2?S$;HG;mlZ>V
zp4x56QYU1J$^wiD=r9Zm0Nof&I+e!Y5Vwf98vGpLlm$$9z<g}`=dEIC+0N}(_@!mo
zkoQev?0@mX?iGW4g&k}Qf84SMp+&n=Jaji?9<|!eiT=z$XJ1#(1US&e9Y^*Yl8^+&
zqlb=~rfEe_QeqRBSRx;m&wco;M{UDKA>d=vM=d?S2#J>_n(R;3w`35t^_n<@2^VEs
zvX~<pF=G(vF;~i2dCAOxp@@wMf-1blR%S@eiB|1K4b6EDWTQR9$rAYh5*g2_MSF?h
zWSoaM$dnnUBs+BB;z)4wTRLNvW2n7M8y?kUWR`^V?}r*6H`R!zvXj6*v5zCvouLIi
z%Y0$=-hFQ&0?vEOA*!5nyx-46%^c^=Dg5#!P7}qyvcl{wiE+Gbzshy<U*O;>Ypxe+
zI_G1842u52SI5IZ7LhFt*Ewk{bDz4J1WoVsayL{qncODYH|g-YSFG7(emj=Xw2JD)
z5lt`68ixJLgoy0bK&fhmppmfFv@XL$Tw~m<s6t*{9{fBagm?H17M&jx57w>MT9R7T
z<-{9ikTwymP0)&Y{3{f<2zJIC`%O5;1yGY_Sd;Kf7fY+Kx=bx!Ag~=%giG&9mdDWQ
z4p3(ji;h7n$VF^Si!g?2g7LC0ngNOJmNo*#W!A?#k()TTp!%a^Etn0Vhh=DPG0t@k
z%IPSzx(suorS2s$w7jrBG-{P~i2`GyITkh~iu%{q+lhvlr9DRLHIXo)P5?=?l^Re4
zj|Iu|Gex&@$=rO18B2J);Hf`Nz8#LE>zG(~L>-Jw_-ZC^5nC+K4_7&#t*8$dV}0<g
z(K2OU@c5$|%x!#J-`L>XmmjN3Yp}ne4eG}ccXeV|^Hk3ldydPYeGU#UWV=cmV^g*M
z9N8C97ab<W<i6yiA;nFHTV&L;Azh;nF>Ydf!VO?g&z#Y+z=;-y!&h?#TlUM=<+pJN
zLuIkXk>v2q%tu`QM8ee47FO_Pu}pz(NMxzOh}*5xSNo?LWfDP*dg4JO9u=y(6laNO
za;7+8_E<fy!)j(ZxCPSA15CpC$+%>%-L?=TE8m9kl`quvi~m+Rxv>x@&(KIE@J52P
zbUmq?UK$%OUf@_wS2k9DgH82)&upFHyJZmk<;&oqCr+eSEWOnC5OO_j__d|y(XaUa
zuK4N!oh%aF8??Xp{^OPzz7%ne1Zff%4AT}z0CY|X9+f#aV9IM(ul>1eH+$)(h?XEG
z=Pb-4W`ubR>~};zMMyj<h@g1iLNIg@TuaDWF++4tks_XrnmQyN$n;vgglyNBUjQ}l
zhKfz4g^W0Nz{-CbYFTtQg{X1nEFQRbX)|cq6fa)THT|R3twtf|pjM9pg1rO!&%`V1
zY~^B?k+6YE{UbxM=eAV*{12vNuC9~lng~|;-e<?5{J(}i8Jeh{_I@Tn0ev={5Xkfe
z7Tyqa4S}H?J<^dciSSAJ3S%i|BV$|}n^-i5BxA|BIso(7bUZ6B9nm5WUqan8GrUCm
zhDO?RFS@0tJ+tQ*CH-^9c7IjhX7jUwm<|clCyCh9flug8R&L@RuFkik3{YMcaSjUi
z{r8%EeVpB5Ftybwp<UTN^|rPmyFpW~7(aJ8U33EfxI7RbY;J<D7=@P-EZQ(04*0I<
z<|R@=jpCl4d5$xKk)tQ@GhAQ(f|k;TCw37|J7vcW2Pu^UhmM;@ZaaS5atlLr_Cm==
z`PM6N!ZZzs+tuK|Ccra$uWL`Sjd+gu^&A`ef<rOz6_mv<bYrwAiP+jc4`_uaY6~db
zf^YD%>ZvSJiOSE;@!4kMnC+QXAU2VVB(4!(KkWFs><+G%ZnM$2nQv`9>{d5WvjhTe
zDw8~vyS1Y(Xu5IUhxXQE`fLWCa)H|^t-!pR)X3>0T&8oF3|I0aAR=!UXq>gvXtE<Q
z(I5DuHG^fIiRwy}o6f+<Ti#eJ8^?J<U<8h4@<yv^yAcQqP$W+X2dWtQ>zS2LqX7(=
zyQyKs5o`U`-qBC3lf8qZpF8dCQ;gMzlpXLy<59u`JswO4cElm$9g@F5Iw4`V880Da
z7c^Uy!LL*_ojQPEgXegd>p?8OG%@{!JmQ-jy0m+IwR~PbpKKrJ`Z~XbHUSK^xsYX0
zr?E31u2yHYn{ha*5qr*p>`6k`*q+LEBo1-z{>UNjO)+z!<4tAUGjw+uHAJRLOR}j*
z?f}1K%|@e<gYy$yFMER}-6(spx4nN5Y;rcuG|S{e7l*z5*1@j1F64~#WB|}lv9m~?
z@*gRp)%`0$#%5x7m+_!Ma)U$2c_ph=;NTGaU`y#U;xIo#N_mG3eFm9~dnw=}hzRg=
zk0AjD(@>}>`nKY*C$<1o)m*^5wP%B>WqBwcKL&L!_mVF0bX4efZN8Bg7kP7XU&!<^
zquipF#TdFwtT%iIsObx69hc$KRtX`>8r9vw0Le92qNC9R%*d^>E*StX9ALaKp#0wm
zi}i&ev9eLZTH_w!j7_BBzG0hUWBNXr%`tf8$LxHZotKUQ8D8NoiYBv~c0yz0ob8Qs
z!?6FdtJ~#!`ct=b`Hr5sp>zAWc*k#)Z0Q)T)%6u>u;EJ3Gp5*Vddbir`&&4Xj7fm_
zSB2L0OwKgl$hr|;aK<YD3Ma=B7g-9%NS7dNzA6#e&u8NDJ()P3kL`@(ygOB*Z*vI~
z!}R`^a<Mtm#3dXHldME3A<Loe|CSB>dBjY>!xXFvpbmM<0P54fGFte*kr>k0|0Hsl
zo*NtC;$5qR9EOG%()OjVLXaFiCPy0m_FN2fgy)0wDmL=cEa!v77+XqBa*#{|gim%`
zMR{{YW$8zDNzHDk=4#5UWCplpC6QFH8;->H%kYIf3(lk%V-($f6w*}qcreO5X(F>|
zyN)bd%nMZr+-a|}`Nh5K@naf<T?j2v8Lo73@%4`$#)7JdhuxC1%Ezbdo5jO!<q1X$
zv>TmIB_3-Q0+*FgDFpAH4%%Lij7=Jy6xPcQ=KxEHz=h-PW;8e8&|%NOw4F(P&vqH7
zZoDX#(Q=$jI!e<r8CubJt=wkqH#$T`Vp$=W<hoUo$&nX<lB>q3`r$jO9fRQG&)Qb7
z>Bra55TCVgy0xarAZg)a9M4M|OLQ<VtuHyd(UksJYq;xU9{+7vvtgjVoRiXuct-)g
zM%7`o??&D6EO^c8kfy3dnz-U{_)h+Ibo|foo3hs}bkKn}T;Sf$`03FJ;Iol?`d5Cu
znR^P?z94w$HO$vEdWWb}>t!!!zJBxO#s1;W$*W(e6A?Q>9n9`!nN8|cZ-fH6V9ltM
zM&US(tWML&yiI&5zPN|X6>)ewx|m0ZLgL9t;tLfdSfZDV^`T*t(k#B0dUDCuzff0M
zU12$E7jW`2LIEY-ONg+r<VBdAjHjwkT@n(JTI$*qX_FH-l^xMo0|M0^gT#SG%85MV
z4+6m2UutaYDvHA_MX{7cOKd;cpTwhntd4US!BS>jNo#R2?c2%cFX&8az;0hgpfg9@
zFv25k>->r#02B9`ZRGc80)VmRvsQ?oS-SS6u$mV#8KVUzT2gbc!C2uq;u`w@lr`AQ
zB-h;fu>MXsCY3yeNQZ_sqIHvSq=>0A%2<7XgHyI;S{j7SmC$g1c_CwX$%;}>pga0?
z{T=w7rN1nJ9pfhGFRwP@+d1uSxDm-2)i(S6`siCN(ZtwR%#Q~OlZKk`WYpIL=Fvbr
zO@fp|F7@2nL0-kY@yB-Wx2fiuRhU||U^JL9O&wOlELE_)rKh-Q{D8NTzJ(g4YTE>L
z+I+P4V6-QS^IMbRw&8YJH(hZoNHD>DM;F#`qCJ*u%^VB(i7-<nMu;pILv8t^A2T6)
z3AF=E?Y2@9$Hot0bYe0{iebZefL;3n$MZ`TF1-X7Fjk(BT3?zj0ppkAC0{zo)*Ae^
zX)@zxb^xiB=iA)PT;a*1%m`m?S1RmP#%zO<j3;W<V`#65@r*DC8XS_TX=r0U2&Lu4
z=_Y+OTTs{)EJifd=_Lo&9E*{oy{#KUdt^H2rSix>YYCilA=L=>OkbH$<p>(D!6_}l
zT$+YD%NVYHb!k{RvGGXQ{*aS)`s=<5;V5Tt73;cw{GM=O<4G|6Zq<=2OrJb5bT6Hb
zbQL(y5x-ci<$VVFeP>sC^eJ9)i3rapvz>OXaJIs<w8FYq;j?!bZ*-R!ZZzo^)8=nC
z8bk$oJ`JIQL<DS$@`7l?hWoUx!&DPUE%cHvDW%2M{bCOb0*SlNi=icAC%YW8s7B12
zs*HBnSf#$KT-^*zD0jXz+|%nHUlaYn;-X_SVt0u!&Yl{u8MX$)%6&;qRv<ZXv6qOp
zvYQT$V>T3xjLU;0k2R@7*i$Ix1l9MfT`h_nWg0PImflCV99SI$>SheoWpW5jR(@ZL
z1>W4PE&CPLwI(R~UNWYQUWnM*^rZfdLyz(ZdcBc%j^Tw81U?PW$&b<P&wxGRO7_m1
zStv}yRp3qwaUQ4)p-$4w(gZZD87F4!?AHWXDe)yUBur-I8?fmYL<@+~`}rw)=i9wr
zVUW$FD)JwC>z$tsIbf+klEZdYH^H@-{t0h&IZkeXRCRgS)G?LZualfdU1;**ng#Y_
z<g+#!)~bByK_8g1ahybHV77M{EYYte!Ad%y#<_40l25u0f(xTV&IE1JM)w+;)tCcI
z(B_?9EU`|U&b9~!(`-sifbX>T|Gj1W4co$lYd&P*tZm9YaOUPn&i05o^&&~$;VK4A
z<RA5IbZrdeg1~WhG`HSW1oKZBy&F`=^#e5idLr8KfNL@jaEuM8<e49{ohl`8P0wWs
zkQTaWWZxV_$XhoHxv`^p<+m_5(N6uTtp?j{F^q{v1V<{s%P0heL%U<<W;j`(V7>qe
z=yTUG4LOwoooUNt5f@2`B`kKo;QwSOFym%Qlasg*KOx)lBno>+!~U)8nYv{l)ITsH
z2105ueEe|p+eAvo6Kt4b=9h-Ca4G}=afk;zBs41W(rBrC8|j)U1?S5^nBM|Mmmo+%
zB#FRimLE1kIn?!T2?<V9ngYK=1)WCgaOVgib~^iha+5L_-GG7PdzMH<6}h_g`<pVF
zIu~quTe4Ya4>KV<#Zbq|+|FGtuB>;xIF@zrkIG8xC4_He2%kzoa2}dV8Qa)Rqb&4z
zG&wIh$IN6D&nj-ui(Z>uMVousNu5)%nOT_fW!^V+ba>HZ=p1R)0t7F#vhBCI-drz<
zuIxot)^_KGY<@`XCPQZ0<}|pb(mw1BR>z%-i!s<RNXrS+SAAR`1`mS&+PLe@yvY4#
z3`Hr|(zI|9E?9Vj{McX9P|Y<=uTnZz<z{Rv4nvdKh>D2*JH$;<)OL+V9c$C98Q0*{
zT9js%#;(n>8RXfh7f!^-O&Cukxj^HYp_gF`eA`54DpfYojy-f;)@J>KRW@jus##_O
zH?kslfW76|h*6K&Ji(|k9uHvwFK(#_=bvxESiXLEbh^Lyi{Z~|vU_VT-^7hMVX{?@
z(Tm5ETVqS>M2<J`{Xr84t#;wx^UVGNt7V1YuM70Vkde!~k`X4bzdqc2H-|!$5(x9u
zpvL;2KoRO5bI!+cfg}+4J-FFT<z5iyvhCXGtj#rV)36vYpT8|BXmGiU7rBGSSEytL
z-Bk$g??<LUWrvpbRhPAE<d0hQ2^H?eKWZxmBp6gVhI^ld>8!#Cl2L~PUrrDkVA28J
zr{gaEZkR8d=F7tXL|lIy+Kqwr8CC8JIZ=~QmYvGYc;H<Po58XS1Ea`_+709>-;xpg
z1`MYIBsFu}S=RJrjys{@&^@L$Ek=8g!7kGjpO@7$p%aulENQ^uRp|n3_!qA&hxs0N
zO_S9rb8;Uxl95b96}=DQq3u_u|Ca7YcoYs2wW*XCeUc5X90p>`#0;`z;en-VY!fkh
z0Thl|*W%l1V!6Eozb+_X#AD$SWYYe#?WIOOeTNii)@a%_XO|@4KCKo{7GK%ad`C%1
zM@Q8iCF6>Ij!tHF^P!}hzgBnip|YR9&gp1a($QgcM|8qgbVTQ@(@_N*rgYV&Ur9NM
z!CcM^jCnYWC%1AGJmVm!$Sgl19#PD-jMp>vy3zUh9O8%#VXUGRK`t}{2_0pRW^s-+
zp>3$eA&RpEXA-2+2EmbSO+&D5vegqh;DeDjjUzy@w4hYtVmwoaav!wwQ>tZ&T$j!{
zJ@`Nr3aN1O_pD{pf{t1?e6Es&DajW#1FJ~4TPUBmX)pvgZ`DxX9dh!n-@bk5CjZE^
zgD}}=M@@i@p+eVWPEcrwW5IT&RLbW}PO>}7?cRM&u&sJU5R_Lr+fs*`de1p*&d|;I
z@`pP&BagFk*9$l2A<r@ki;z)Ncak%hsGPx&NB(1foS9t-tVv!3ztJCm;XJ@9{Ni`z
zSzx_vhECxsGa-C5IpH{;QbwNRqF?r08_&IScc$NyxAK?B+~V_vSsjZ6S(TjB!s3GA
z8vTM!TPmtR>6d!oH?o6Y-uR_|GpZQV%L_%ZMuuu`JvWT!fDY{_v+^)!E&H)p87t5%
zi*&(W(AY~JX*DCwkU)<6Vpt+yI<EB`TR)F!NTw4Sp|OZ6lriY(?vp(Xc@$2ro?+Kt
zP$Lr0gCk=gTP!26vD_23MeM>*EW?dumOQZQQ^+x|xKWYUsXvJZ#5#{ARzo_u@|rLq
zt!&hWRj5q2Pu_CGDg-iO@uzKF<GoGT?8I$I{ep<?dcCv5PH%DFxU+B!e-S^cfl0I?
zal;ViW{nROx2-Hig8JKxqntvML*T?R(3e}m^%IYj{N~fHzr+`C%S6oW&i29n>%-P=
zXM1OdqlY_as<@a%O!8w;EwiPqImKRV1shLhQ>Eqp=+})Wxs1#CB6%d#I8baH?^RUu
zaZY7xMYT`__HRO*A6aaH?=(!81Q)pVAcM~!8gxgu_5P?yWT9C$*X72te<0?nj*$q8
zNXq)Vrf%foV0U8(*l{m9ABRKEf(vbB&pvh*nca&<5UAJFWIVoYlqNcNnIqzW%jmfT
zN13~jWmWO92gimS9QNF=I6lk=s|ddI0nxD$oelK;`Ru|QPT`Gtg*TnToAU}kbP7M5
zRTw3{-Fj4B;*Zj&=%BL7Z%)XsJiyCq=sK<3p_)G~S5EIB$I;3EK-~Cv7u@)G7u@)G
z7u@*xe;had`acpm{^Ksl@gH|Vj{mp|a{R~tapa)O^FIMO%pz|E|D|8cXJyvcl&e}^
zv$UpM)ykSxHRY-n^?%&rlw5WG0)O%gkB$D#chwGt(FZle5sL_pQLC=RCT0|F>m!f3
z;GHYCeBty9mwbGL%Lk)|dkU>3v46icGz6z`Lf)+hpHk$q4gHsVtGKu>NJgMhWgfk7
zRmVp)4LszyIOMoEWPH+_c+$P1k(WBvz-ZiZV9!d|U#IwBD|aXII*~!w4LD%0Twbyy
z9%*hMM<+AK@$ru1_;7LY$wQ&T<(cXCKeXSfYJc1-E+^DGG@>d(QrS}VFYJ4{_~+2g
zgv!Lfi;BBkX~}OnX-TP+#HPNLe)3Y0yfh>)1u;^9HVYlq?E&(Do((vndtX#2ELWX*
z<)390N1$>gCeg&z;#wVzXTY|YD!1m;&Z}{Yp!3F1)bTneSMPi`>POa?(01Zy8Lw1K
zXXO`~(CgM=>tuhYS?fjpc{3^<IR9IctJw%x91$X`Rb(6aIhBk9fD^URxKQ!p|0*%I
z>9Ba`s_NJ$Z80sjL<>bLO*GRC#I`u6jZ<?fdFm*>J<FnZ&vSD0rf3Gle}?_h9s7lK
zb?+Mno?tkqPx|we)hIR+xnilQTGD(VplOP7_jyh=#xPuqFhQ6MvAk~Ri{zZ->W}ht
zX2Im@vQi5qSHEN1umZyJ-=XC!Mp))g77u&Ths?0X3_!3{-LU~8{VLC2;!*w#a5UaI
z&GxJ@{ZZa+Lwnj%?EaR2`asfQHF$isV1z^fbJ|>=*-**bm!^5Yvz4N!frBxdE`&5@
zm1HC+(Jhn=ZAMRCyOP3OR2p8JUr1+oJdSKm&}V^y!$Az)WMW(&i6YTf5Pu)(L6d{1
zrDo>jm_Bpy%G-by_%<8Y3P6(Nb8H8^g{D@x*>5)-nP3Uo_Y>TW1O?gbJ8f95!IJpn
zqc#(GC;^nn{|YMak@-=Q-hs$-=*2Ha=^3O$K6*Nr@wHK(`83g}F|5Dm#EZvz16g-5
z<Tui4*x2sIxKLxEIg7a<#l*BLsG5tQCN%hcMMnKT(|9qco#rQKRMC=EV*!oxe&*|u
z4{6Jx4Pjc$(r@S$ujA-OU3l48^#U0!>~^p=>gx(DZQEG*yHV98o-vKp0@t3)Hst%<
z>IjFd*0{|q`ox?QyyyzjDAV+o>>$kov9duIy7fxHnx6mX9r;iQI=>%(0t@i)Q(1tj
ze(%utqxmdCS?~C`M8XN5S{j?8?3~J0R^fkV#^e7F9Kgf>pKt&O5Gb}Eylv9lxqK64
zw8Xg6W~B>(W!2dx2#M?=p?4T;+~v%7>5C0<bB80}E8*m%as%~yhkesA_*Q`ImnMG7
zj=iRh)5)|ri=G0|AeL;lftD3YYy-u;uJBoZ6KS>$H{Xk&IzuXksoR*7L?ft+*1o4v
zwuTAyJ?h8Zn3(`}6v7s7tU3+2ZM74uM?Qf;=6IDQkfE!v4LvHcz1(&@{O~e+abTZ8
z6tWj`F3^n3Zj!N&(pVvH$$HJp-|B2yrC`b%7{^#%Z3rFB`Zsu$U%Yr&b)#`G&Wov(
z-!QUi+(Do(qPvI?q#1{tZh5h(+viRg19Mah=Bk0i$ni+37#Fo(WJ$$GpN)s7=kS#U
z<B2Ugz7(5bd5VXdWe*SWK>g3!*03QfU<0Efs>%z<3tk2$+5*=pJ`P^6T<oPJMd!#W
zg%UQXEtfJ8w}M|0$m?T!`}8A%alX5kj~&Ca?d%<FzwR6!{eSGedw&{Nl0Urv#;>BI
zePV-*WJ#9gTkQE@3E6DWWd(}k@no3>8mVIh3=Ni*arU)8^{qPBz5tSyWM+TnlUUGw
zu663vsj5?#!<v998|y_%oYbm&M~97fK~UQK{`-ycojXKjXWglBXg?aKgJ~-707U_`
zv%PwpiB1>qZ0npWOfXEK-tdBRQ<Y@)$ePG-@_a&=c^tzg#k7G&j%>`;-nv(oBb51N
zbrf6nyaN}XL|z>U&mIKcAjOx;IQ4fVLs)Nm?p1~0k*eC7%=q-vF&k{KU>i(Xt~HRH
z*?5U-7jPXUIWMNFrle*8Pma9cG9YdJL3oxpw=MaL{Y;1q=P^o@psE}>fx#BB#cGA1
zXQtv}y~MMb__l=Wu9(NrdmRm<N!)c^v^iBFhMFt$6}h6Ime|yf#+*EnJudkiHrzrM
zdsn5fu@yI#?sz`MQ4n=uxE4-*q1&KSkcp!AJcC$XwF&X!3{%50ni+9$w`AI8xBj*X
zK$1xvu%#k&2@91~?{hB~^v*HTUHgStBT>!joT*$u){QO7loOdpL`7`IvR?EYw+3x?
z$ULj^J=0j>S<k2UsZ-wC+vAm2!!jKRb|KyXVBlnn7($Tg#RRHwO1tq=uo!<yS5omB
zq>>?662(3qTKU{NvRrd@flg(GWQ`TJW!J!enTdZUU=TBQC)k$5%WD2OuY)9~gNKVd
zXfE9W&Xms8P5KZzy<|5!C|9PV%`|VJ9B_E2rJQhnxxbmVeZ}XObaJ`$AZ%k53Bp~@
z%6f%c+n4C_=IAz`gwthPrvv+%jrYTNux#sK1#+6t-cDwm5p)C_!(VXYhW%X0xnfnf
zf8(^xAwGFRw13f=W1F5g*lUYy^G25CPF*SHwQ{ZJnTNw(Iz%0bF(7@Tp&O@@I?3?b
zbAu06T)eK_<(NZvCESo!Nu)q<gV`+UfceXP-vx8C;t%9j#-XUlw`p3Ko~CnNZe(|M
z?veSu<CS?|==&PcmJBu)oVR(E{hl8fwjB6?^GHP*q2F?#X1sz@OQ404d5S4`omB49
z37Aq%Ww-6kx15ja$D{FV5Gp(U(6U0tz*o}ED5D&2Zo)_XN~^_wIrLLoB!k5&ua<-{
z^TX57gZJ|M=k+Z3^UDcG0Kp-@8GSe@jw8R2rjbe{$StJ!0zY7_TR?Fe%;%c|YMS>Q
zO$eJ_J>-N<YH%5x_f$zh5smdJ)tK_*0w;(P;J`;8P(kb2p$dsUaWbmeRCsPr@e!*q
zz=hsBOX#(IwciMM$@kK5a$DB#XL+K*|K@oti!^h$K#Ezm!|dIMD?u^gQQiuo&GAK`
z^!YdcBvGr^xzZs`CnF@F8f$G&pH45OD$;2>J6G=Nu~cTZW9EQa7*E0*YaaE>zq7c(
zg8A;<ELAn4Aq_$HhjZmn?M`Q$;8~mcdA_)o$mAF|Q9~KwCr88s)Yx|v8}k=mMOjnw
zo!4mwu+qZX%iR47^6!{r;4`<pQfZh9KAa^i44*4f@EOwLN{Dk2|7~(5Nz>Si*rUfM
z{HrR}%Y|q%uh!KmWphNS9F^9jQl2KGbVEA(Z$Cn!*SpGfl$EA~fiD@U3A|M`kZ{WS
ziGUyx<B#O27x5sR*r6v*UYd08UN%*W7CO^6!$DGc+f-7to#=>tU~XG&YvPC{Aue6z
zGYrutao8Ck79KK}vDVs*J@*vXi;S@q7<Gz9Y|!IKIm76Z|3c^(LuEp%;U&~_Dw?>(
z&$HHr(w<!JrE==2m}>_8gni4jpg+1?C$?sKMYEiT$^~YQGGXjH8S#D7p?7+FbJJ>*
z7jx5wD3BIT%$*$gCwHP2I+9D|u3C=*V^KchRKI0AB~>ZEjw~#dlH%Dyg~97Ru-z84
z6ynW=*2bR(BU#HF7-jMC0f&KgGuBBQ-6U9ngu7Bv>BA+KzO~8A4q#P9gmY59N7foA
zv)%P1zqQ%eh}rRhl*)X80cE%z{mC_>0Xzx-oXyI5&7JOlyrq`q%ISD6lIj^8&IW^0
z+B=$S`vON%TeClcN@kKt{-2|hg-O%CQp)SW>)(}Drl0)3Oe(*0yQe>Y0=e{6qH>Mp
zDz<YwlL&C>1@SE)Ve<Gi<t?O4<tMqZLQ)2l65%Bqf@G2Hy#9C^gRDkQn!l#qnlpcx
z-~a|HRazKOMTGF_M12S?a+{Y)&Y6}Hx}))x63d?|8v~B5jWDSL6>+v=qGXE+N)Uxf
zJh)0XrSA`=H3_$$8x{e7SQ0jIxc!DyEL#-}AdZsE&bx>%2(3$q*0xc3n!+)hmZ|6}
zUIufAh~{P;$0r?*<>}mTEWDJ)V}VL?H!s~JT-sEuz#j_86muvOc)8tAr839ow+sRt
zg4i*5Bb~FBR+H19NQ~yo^O&SqFZyprNF2e^6(&M!Vj}cK;$M-hhIR5mzQ#fLR-crY
zCr$XIxRdnj90HmpV2k;)VrJ@JYa;oIC^4L6GP;~oRj#`8b|QXq$Bttaw8Ls_S`CbU
zU4<LX!ZVsEw2seMRaA0pesUU|jBehf(YT`7|M-94!=`?)l<W+m2Sl455FLxci}mwc
z>|=vIJ3HI>yZQLhhWi&^A8qeE`j5@+&8?kBj~;J5q;i{&9&SJUk6_~#$58m0!6q*V
z{$tje4X3j?<rcjEH~r`^M6~B?)r0mMV?1Xb-1*OV*d5GB4qTappVrS;oCkwAnG*T<
zfTtV;oRKFWHvA%}?>&Q^@75D$6I4cT_{xr;qC_@=;36JS3+!q{+(Ud3nKT(hRQ@rG
zpcG|S9OOr@@6kDjeal(wwCyO=#!fTDkWB(MG#-bNQ`~*2a&~ly_xTX~GP@Y#D5c>e
z6M0!|ymVq)w;D!<rj!jXE)|ohGnV?EPTOPb7-2N2X21t7Bn5z3Y4l~2QN5JG;YH$F
z5S|X>PXZR2kqavuD^ypc&Ys(fO$|JOx)|Y^PKndZ9ga3o3qJ*`^p9)qr`m0?t#1#b
zB6`kwPc;9j$VO&h;v?(M>QFF&fEj5^z<8)kiDAy?H)J3+p!ICWJ!h7Gh266(=|n8E
zuOdz-4D_=w;`wyXCZpLnZT+}QT<h$D1|x5SUd&4OaB}sGEx&@bmudjJuU#05J>%O*
zr9tJDp8^>qQ-pliFp=RfQqq4NdPux+a2Z}zbP|j^95szyio*^<+E0Br-w*UY%Ve8q
zMcwmZ+~qr`WE}BLoK7xbh7_w%pDLdR!&=71Jjh!b#R-n=Qkew-N%;)hWX{GDS({B;
z-Az9s*Rx|xON~TUMBT|$kM<>p4#acGJlRuep*TSxZdVc)Y!;o^Xc6hy@aU)N-X23r
z*<{YyS9;?AbWn)IJz2XnLaW!xxL*e0UL+d~ydVsWCI$y#H?gN_g1id|Mw2TJ0jL-3
zoTR?&u24-eFOsxXc2YB{1KSwMM!|pbg%B4l3KHzMCvG!2Es2{2f)H!Ey;OT_9O;fs
z<^NKPgBT~CRVYKD%~#rKBBH0b&-dM+0Sqw(d^G35UaUVqW?FH~kIjOyg99`>Jjv1o
zIpLD1oI@*70Fkp1q(;SZKot&vo0t=;6LXVsILtNyPXp6{+`UrgiyI(XWRP<bd#HFq
zWJ>SYqGcJ3Z7A(sldNw3QVzy#qO;F)>%dAjnb)0OM5nGSnAj_*h<~O&Y))A+Rk?$Z
zZF@B6dEt2b!C?HFMEkOsapRRb2Z&&ZOtG3y&Qfu+cnM`0j&zGYNmLtBH)NW&WXnvR
zB(rGHFPJ=|c$-x~P<gjro$k9{wSHl~ZO$+JTZ$&h(cvFF#gvSWoqsMm1{(;2*^34-
z;X6El*czt$VK}-RM7=ZQf}(2TWD+~(Gx;Ai9z8y#(_zj?((EJ>DdNHlj+y_th>|3P
z$vRhODN)6J1}pbcNB)dcNA)-w<ggyc*h##}g_L0xZ4TJbJuWfiMPoZhXk)&>SEF<w
zh{WS&{v~rp&;J0k4v(t4KLn#O@UW~PNBsy_;xEdg=E6jqkm$s8k_aQs8ps*Ds5LOC
z0FqMKS;C|k#EL`{Tc)WnNk-i`bi&;vVtYmCd5Gx?{>~=Ry2pQMfO<5q>Q2Q?*QNFH
zY7shD%#JM_o7h0a6L*v;^5Equo&Op2^)A%A)yysNSnA!^va74wmbh!iF0x2BwcU&N
zyDliZ{vrYQ&+L6PY~#BJKHm8(ABcyGt_-9DGxpIs6(Bw<K$v$PyYxu>9rU(BN_clA
zmeGLmW(U*Q!&0(apH3m?L1CG;bk0>GNbugFRg|353kgPgT4r6wIb`G+44s!54qF(h
z1`KiY=*BW679Rr&&;`&3mo}^iKXCB%#S|7FXESS3M&woRXq7{0$+nC{owuK9C$Rxh
zcQN(CM=kmat<H)jTs{Wark84uPiqr$#1J24ChzS>)s5^*eR7oY=y2HpEq9|9?Nf$K
zYL6;JxN`Psc8}`butg2#Wcf?emK6;=$r%kM^IG&|7qblv8CL9k%UzS=)(Eq&vEl=V
zAGz|@1yFnL>WOH7kHa%fm_d`ZK^&4>%9gU0aH-^yT$A-OKkYWE^#hw`mfn-lDXAd_
z;m2r>sCZ26)Tw9BIggH7rj^bk#s_)$TdJzUGLR~<wu4mjNqNpzkL%LA>Qyw-QblAS
zwie_D#iG_O)&r}HYwYGaxXSb0lUlVEXt!1lb3GETdk!k+?>v^6T<hv&n(gVNwtrG<
zzTp-(-4<t(`AoNVFX5AEjqw|{lfI~Z7+sd2nJ+&V1wAeSWaUeyAieXWk1JTP+Ngw%
zrfLb28Q&UG1(lL3SB2rYUYb5CmVI7Tv32YNiLxUt@@}hWsk364a9RIK;eK-bJS%C;
zT202WhJY^%u-I8j=`2>0_*z3(gQXtWY0zto<gEJMoDR@PENw8^L4b9U`SS-%?d|h5
zSzeRr+)dmNOcgS3n0E6U(=iw3kW%Immy$S)IYT*#E=C`t8idgW6I7m{MN2Rm=hO$1
znYH(J=j)QYHoYV;l)=_9=#jUtOSa+eS;a7B9tLrGcG<nXoT2RU8-FMQT4_mPGk!>v
zE@!b#b9{t(4dO|u2*Z8wNm38OEq=C&Thnwe78{W-gU)D+iBu$X%Xj?7_lZn6W08Rl
zLm$J3-HF#=s!tkV&U>emV|{?=sWJ@coN+0LISwl6V?Y*814k{tqEj+}*;pse^#=AM
zJP@hdhSEZ?1O6nQUX?P+7qgJ~BS_JUqOsQ;$2g*ix`c9+SqpjY#u$aGR#O!!hGKOL
zc9%BBg^Ow`xf`y8?RGVk!|j|64%%_geKt#?c4n~<F*Myxc2r7xhsUi+eDUf^of1wZ
z>ufC%JOymwnD~WH1&tU0_`P1lLq!^G^*bu!^PhcbcZ;9Q{jbOpgijyWySLQG{QKXH
z#}Bu6Qun_*n>#yS?|=V@5Ak*^AIX9TYirPCLzwJx^sa<C@7XjSkl;;>v`Ng4eCCET
z=TtaQr|Il&y?8=IW^g4}Ln<4L<l2$jlI~=bpdn#9dlEF+LA~>e$Rkvd;~5Ee${IU*
zE-95l&RFIczOCvD-f$vjQQ-iNg;ylyPp2ddD`mWz!wE1y5H$dI&i7JI7h&R83`#ti
zpdUdi!ucmz$2VlND{X3}@00nen+8Vvis3_I;$R>#7_`7%rt;koH_jKMWNI|mtB`Jb
zGfC|p4L`<{(NOM5Ir@}4BndjD(=@@TkDGDUPEyvZQI7{<mu9Pb{WTs#{~-)V65$Iy
zLQ1EK@_FJJNmpybXf~aM12m`;9bFI;Ho0=#m#$>0(Ilp0?pIv%4}+7vS3y69Gm^#%
zKlvX=bb;k=X{)SnL{%gYIzQMjmkkM{u|dDJTl}adcSqwZiL_PfmV>R0&CNCXXR8u4
z!@<Xpy~LW~kmeDO$D`o;a5$yO{EDl-vx_hukVM5nLpXj>6|rK_R)SFHtoQbij&P1J
z39HKvVF@cAR0>2q>BP8#W*ucBm&6GC;anD9u#s0+B^?9EX%pb?j37?9^D#y!FnwP_
z?I5m=+`KAFXF;WlXsW|G1(~rWPP$dz85}ip5^)?i-eetOz}dW1;0A-TE~0>~DqT`6
z>NSOsreo!(W=BQ6b_XGekdyVIq42gbK+!{yZ4%{;Mvp=b>PDkc3Ju*<Z`5Tk_)xFh
z10<klJiQ>k3Mijg=o`mIcOqtfhf%CT)kI=wK%)|RG#uHdyab%geKeFdMw5g(<D~Am
zU^B30+BrhFOR7#|xEM_%O+}!{nZ&qz;aH_&WHIVbFM$FMQn9|s=t(CrP;LU88VYtL
ziJAc)0B`Eepn0_4dRslI1@!&+<mkuxUTrUU^^RWFg59IzcPI7NZ(6~dqsCtCq#0BX
z_vq<i>!kkbv~@%eR;o>^xxzb!-c=9Z1+|}!PioC(aC8#X4~`pkYL7ZNsUEiKwPpoQ
zq>a-(*d_+l2B#Hm)DP+{D%LuxpkEF$mZ=#W?FR?7lifG;v-+yusJGs6m;3eBA-dbA
z{;I)o^`uqbJ#AD^g5%SZ<D(|GhWYK)o2+80?XA-osNbOWW9_gNG~ZMkjns6H-X7LY
zFad9_uehy7z51$AlkRA?d-aprZVS`0-*yRzG{^=Kp5xkX9balc)o4c5lXn$rmTA?|
zVYBw%r&NyK2Yc0n>T8-~X#sR-g?3L*Y6lp&m}E3hUo~6x)@iF2ygoYGW3V@CCqLGA
zYt83D<EY7iJ8jk~)Jdy~?$HWCjb79DSEtSTAt$Uu2#Hqh<mB|YRX;i`)0)2}2oVgb
zRC|wMeRRlkCSV<%yhFPH1}{Y=c>AVC&uPsM)%02?Re%GAsJkt<B=t)0Y&nw+4r{L)
z_1Cq--5TB=p`o|+X00rXS8t+BT{?eTrJheQeO@#gn|yU}xxz~u)c1qx-j8(*UJ9c%
zLWyQwp$|Q6p6<R;&|jC(bk;KN`(#Q?)pY&*rG!2kot?@3TClmpcW_49(^uVcmkuZS
zV0A28)#pB-gk5#j{W|&>ox+po<K~VM#!aS<ltB3@coC3HIaQ7Zh)(gzr2Y9Mxqv>I
z{63!~>CaRrDR*Y@aO?M(!NaXvnZZNz;Gvp<Eu5O&CzGb=ljJVSo36Svz4httY~RXs
zADah{7f*M`JlM$;PJ!an`$y)%qfFrxkUzcOHV?KfAaS3uxr5M%bbc|4nkOIiqz(4o
z{itlpwPU|&;^CHQf^ft<Ni{*QikpxCjobvm-8usJP0*|SCjK+-<Lcm~MkhhLRcp3V
zJAK3(T`SQ~4?*=xpUQ!#zv<f@6^32OH?1g{mRPkgIqPcW9oyLdtW*x&?hM9odVI#;
z>EV|4LQ=h;1vO;*<YVfIZcSB9=y)Ga`|Rzo(v8CrA#bR|f0zXkuOvKD#aF&d{x)2J
zOxM3gOSCSx)DkVvGA-#C=~%h{dkULd{>;<=+?Ef(0{zdUosGvC{m<jgulk=q;=|VB
zk*j*?(!n+6%T(4mXlpO`g7&Kz{#6YBDu#a*!@r8*U&Zi$K`~tWw6)tcTGHwv&E!YN
zvn}=5ac83q-jB~b7dKas&zH8J7s#;B3xvJr^Tnd)^F^NL^TiplEaLcIIJ}kJoxZ6d
z;;FA-lz+axDG(PSb%7$86anmW+)NOu^2ONygb(tocdc6c=!B>WeB)_3T8)|lZP@@@
zgDdWLq7q5EB_$GVl+$G%ZY?gevpuhj1}B&K2<a>RPW6%dPPMJy!H2wX76u8%#j`L7
zktt(mVUS~7JPU&)b7o^OWzMV&y725IbFs1kv^RO@)6sB7Wy*Xc52vGZ`PEgqeEfVJ
zVuUGrj$t&t98Eq*00y?x<2$sWcvup_c5l9d<SJpWICEz-9Ifdv!#T+Hs{T5IS$e3c
z#nfZYT}P*m2aasrJZNRL05_HDpW8P7WC1lJ|8)m(TS7qpLHGZg+mCiOGxFb~ulN6d
z$Ol&PjXFtND&fIEk&bB654%xWM*}Ar<$ToR+vGekZEK^V80SXVNxlkSUxlx)!q->f
z>#Okf|D^C`q$$fucoJ1KnGE^D#6CKYnGf+FCcQ*#sOT|=!=SCL3f@!Zw|L7g_LBAo
zj`ib2-i3ofqGFN96ROv?QW5i*PA{r`976m{h=l6O`W~}@G#Z*1&FIE*&f4!yc^hhP
z7)7#$tp)c;0B;{1*AAP_hBJ!MI2tC&-~s*b13|wapyh(Bt!pTLk^@t4{6*w#K!7#L
z=GTmf^@OqWFcMJ^LEu;<bs8cn34`Bg*o9FXH5W+w#?CC3NFPkmTaBg;BQI+X)|M7K
z-9?GprQg%&lh{+EP_rRYb|8N$ftW5U*8t=>3I3S}D<;i2c)9`oZ11*y3RY>z?e6rG
z3F0R)131r&yz$~=nZl}mdl+4o==;a5hix(XZVQ`Ja??5#HHQy|OYN=fhw(r;4vWi;
z>S4u?=XEy1A%)od=@9ey=ur`NwZ(@xDXD%d{PO6yeR$O70SBK`PaZlWb{it0E$(00
zc9ez#DF)kJ66jQc;4fT@$Q9y$v8&ND_sMasc2bcrhfbVA4n!smc0;tr$#dNYy?BzB
z$o5-3#K9=+sUfrxkT5lCudPb9>AX;NdQEh)pWSM(OT~p(jDmeysRw&(h&Y;Dr531Y
zk^F_qjW6d-3y>%L4QB%l;5LVb*E5?taEnYJNU9l3gPXY7i1XJBD|Yv8V1^CT{H}#n
zoAzWpY{PalyChUBGmA9nl_!PM<Wd_VZ>;csPY?B&I67+chv+JQjO@383j6g&t@ZA>
zMreGnaL{9E75?_u+P*Ge<MBD%*4+UECFFS<EO-{6Qm1fuoYF%%^-7f)D_B&$rG~1g
zD$(!F_Csv#CNU~=CNPT;Ei``?^0H_e{Bo(eP>T{2=xQuE7g2M$*~p3K;0%qD&jdx{
zLEiO-d+r?#?!e~Ja22T38IH0o5ET$Hd(Yke9SA1F*Z>Ydn-azNG;Kqh+J;zzfmv!i
zjLQp#q*k0pby#2VNj-;F#H5xSrFzMSbA3oMAWfFqK`caR<qm`TnFc8@yzaySX8Q2W
z?^yJ2cqa;5HI?VyBkvdWp3~UT4@PJ9TOO06xEPhTY;;M_JMnY^-U~heBIUA~xv?UD
zOUzn)c6J5*WWoVfM`Q4HZd2X!I3k&v8X6{WVk2_qus<y58~p_bGMmC1OvlxQkO_C&
zF8fogiMK8DP})~nto<cv$>8b%LdzjuS27dZdF8sR7%DyRx>nCXG2b1Gl1QZA(d_IT
z-!S1)`GFYKmxX_2cZKAfLwmv70MUI{1J>9&lN($qE}j9*(X@j}c&X#fPR}RYM;N%Q
z-MY?=t-LMR7a<vemr~KlG%qZzlm=0Mih$aQ$7nl|gv$V$W~h|_&Y)I#T6m0!cG?}p
zJXA2AIV`8cU5cBc)S~ZgIG5g$ZO6`a;O%XOQUvs1|F@tQPDA#ENJZUUoh6*@2a%D-
zv_#fp0;$ktH?Fb=45#FV!*!UzVUXpCibYA4jaxbGch_Eys4K(@CJ88<4v=d|p0S-%
z#SGq3HObh`<6~f8H{ZpCI0us1k6va~4s1>h>)caP>Q&=t_lHy}MwZxUJhkfUYW>hp
zI&`G6;d1(NH9h2wV{risrt~MuQDrj1sv`W77i?zLpxB5v(r6N&#p3r78u&Oc(i0#E
zIp8S=FYUs*6QE)faSzvU+^7U=B~{kX<7Nn!Q<>Aen_e6Mm?Y;OiPh=i?@f5!qYAse
zBW|{JFIorvfgX#ui-r<g+8{8J#U37FP@>st!~j?!mc>lH5pa(YuI!^4x2q#JtOirr
zI1UT}KS2>kNXpJNHB~jB^n8U{U}VXxi?~Jo*+7rS5QM<)eAz_EcFr_Ok8;9p-C9eh
zNroP`F10t}n(R@<jmr+z0hc65n5gdvpGGq_o%{>dBpFp~SCah6MZ9}y%v0F}K<p86
zj93cki@MS6@D3hkL0gQPKD?JkOl#NZgT6Wyg(e#$E38Xqe5a;>z(a=em%z_>*B{K1
za|ghBF3xNb`{!cDYjn>ds6S0bOVO-QD|f<*OUOqkADMzRZsU3W(SAfk7|d8{5O=`c
z$u&i%JGmN9M`gVW;zXOKr4$n2aY~@`1xf`Xiz0_ggKY^bmz2~<!2$7WrgFJ&;|}<Y
zcFY|;cNx<R3-d1*R62A27be{}9*oXLw-*9>k^SfPR>uE#WAoA1`@cWp^B~vka^vY&
zv&*kHe_wC@zTW(Oz4`lk^S9*9pDSuJ7tsbA5xlsw5~M!u^>+Hv;?LiPD_%?O^|inM
zz1<G(-CMh6b52X#2)_J%o&ImrKk4R#FnyN<rSFml-}TD)+KH#C4X%!Vxc=Y&{<pt9
zkY+2aokMUYfue;c6Hjd0cJjxzZQHhO+qUgwV%xSov0v`H+qZmGz3EL?^`g7FPM`05
zl5kQQlzSK4?h5j@Wn1_!*dN)xsm9EWdvOE0&<wB~kVNHQuQ!WmpS>|0SFB$(-#9Zo
zJMWyN?l(-Tyrk1#>bKgm%KPCH_}{dG-g)``g7V36V|$(c6-88Ky$?6Qn*86|7ULe1
zB`mEdoX5r*^E4k@{%tlxGD18jKcj)}PrLq`fDxiv5?dD!sc)Ia%#Hc0DcafU!zr6^
z6$P61YVF44tdx1f4i(A8<$GTif-Bb#qr={NGy0yTOJ1nM-l?gn&<*qN-m8(=*4}Yn
z-$C#<qW!A96|#0tD~-%)<+`t5`MC+;Z+jUXt!jqU=}vL(iOTUo!U@3r_C4^`Bbgcp
ztByUlxI6NsIQ=YT%es!NDbKe=Xwqxr>4z5@2uE8H<oXYE5Uj`2M!gOo%PseZTvF4I
z&v#XclN@hoy8b~1V}-eEo@g5Y#O!q4Epe_Kjsrk1p}4;q?%PZgLmGj8$d@~6bQXos
z-q3jVPR<TPy}t32EkqNSE!O;9`zs49*`Bb0FBww>Q+q!!c{hM3{~pyo9ln0qd>!b5
zR~%x^8a{J<zR)99@~v?$=wRooDwj|tzsMnfz5)a~D5=h5|GI)0DxcP|7}Kp{eNBBw
zZAT5#r?Rd4W(jjJJm<7WtnR=rqR;a_It_yf8S*{dL6DD$+!|Da?d#nNo@4?#DDCvX
zqS2hsf6}{TXT<^-zg`J(N^HHTMl454ZD@2af=(34uo<XSovGr8!}f^3&!sluw?5;h
zhgq@m)*R!f-o}~8%0nutQ}^oJ?ArZQy0qY8<U97GC+4in996fJY_vyX^4XYP!k_VR
z!&Gqu(TP)%VSV~jh`}AV^68ig&-7^-!c%LOpK(QnzReP-^Ss(44tMKkNJ3CU;JCj!
zmam+`N8o~S%qqOl?1rTg?X2e$dS)Hi(bnlPnM-(<Yr;@VJfomTXi|;ou|GG;T=O-Q
z!kl=Vl&JbE1j+6#k^#lg43#Jj0~K)$2Fx8v$K#~e+fj+T>|_^?>PDL;`Ff3n-oVfz
zg}~7Y+11-ii<8+53X1HhbRKT;$kD8;>Xa%f;qbA9vN_rOvFUL*uRLUaCPW~8*_8Qo
zPbq4D5xMLBDx9({{d#xlB5{2q(W6p@dwu3_RfZN!=SkvR+!cn>JY8|&;cHd>Pu5I(
z{BW@U`F?zzxxQ^)_~gj18omwJb{P;%D;=S>0SDDt-s%!71E+b-(Upp=z^t{fL2K*Q
zw1FT9H|Ajw>)VOXnGOr+D_a5j$Km*7C(iipc-wQv8?Rh?@;I=SsCv_-N;-kxy&OIg
z*h;o^@UuK~!NeGssgEa$w2Yx?iJtv?X^_DI5fB?<AtP>~0JqZ0n8?8h9&YX*rp-9?
z@q_Y>aCbhcnSrF*BevtX7MvL)qdew-&mR<)K*<T2B`6c6wOzE}E#RJyBnF|$NVSH`
z?MXOX6Y{A0UOuh@01cyMv|#ibZsbh1i%*)l!r<p#!g^jD;xHg0hQvUN;^i-Vf7BUt
zA&1-IqcN-p^2wLg4Q&_J7B)`My+RjM5jlo|Sw%(j7Gm|e{2)p_))|?}x^1EjJ8iZp
zi$^K|G)}%HZE!$^(&fg(KHdDrV#}3@bm+*XnJ?MHivS+$p7h33-=}{z#wpLW%;$mU
zvMZp+gSgIU2xJ%xY=D!yHTKo?qDW1?93+wA!v3%%6tRcZBaz<fH{T?G_Sl~ycVr=6
z6zz9j-wo?|o91fubx%1SrpTRk_3P`c*mnh7a+#^D=9GnO|26n@EE&5$4?b|*{z05>
z{P9byy3ye#nThX7Y(Pxvz&U@4`J#hRiaI2={XsZ?ZT4g7Yqek)@0hL5Ob}93rR91M
z3>aAjl`)#mPGGhapi9F+;gJg!kBZJ+#JbX(CJnXTNEVga;M4BAtd5QhHi3vNy(ej^
zlVyE!(uS&a2JbvNMBioqjtPBl_hm;>x@L&`4U)-aGeIXPa3-PXo~g9$mHG{u5~zp0
z&THrWe0y75Z^N?4ht0PP4{tG`lH8phJ6-WUbhTj-lOJH%7)26Dw$ZNWApEy0Ubf)Q
z4}LIaE8FUJ+vjl*CVJqQhZE+`XlxJXz+>9XFQ^0LCcXJn%UTWh54(U9D^ER<+#75O
z*?jl-0WcO@QxZns!lS6WAfOzFZTrk829_7^>c)3CVv-0w^(1~XXJFPf%Br&vpCs+V
zhsi4QyyYwr9IAsw^=!5a#lU}J5)V6qyb*ev3AFsGh3kQbr~GQgH$d2l_bcgZObx!v
zw^`G=<?kzQ>v`zE=Tl@j*jP+a(Gin13&A*RcqK&Om&%g1rXOU#rypBI!&(14`a#fO
zt(#bUJ~2~}-r;nJ@jxvj1Z6I9L9pepIYX?mR^u@clmF83C$Kpk^t*5(FU{RPa6p%M
z>XGvSjMk=ORpNHA#&dH&u;u}?wh*|mX007^;80|`3S`e~LPsr_L_!eCcbgoP85@Ow
z#Q)p5@2v?_kcRh9p5n@<hLyvQ&t8t+k9DYeWIngGN%u}kFK~K4f7oqv@oIV}Wty<K
zF)Rx>2A7bma@L)5TjbX5fI`(-!GFlkSzHdw!_HncH>hhmcE^NCl&q13jwyNu-oKcP
zmvDAOC0hJ$KAr@A%YUj-=LH$n4x7ON|M&*OJuqbHGGR!;9nz_;p9}~bW~ag-9sG1&
zJ!i(<cABe4g`b$3YxQ+%(0t#l_>vniq{@gP9UX=TJI6lka?#L%GfO4lLs9`pU06q#
zh?#!;dHMS8xW&<vlbgE&qDANej_!}-{QC&hCtRJJ1ibVK_8}Xmwbg~GedeAVRxgG=
z<;Y$~N!B(L$W7uT(v!A+n;gx*8P<Ct%~CMZr4V&mINndL{S4^j(94=8sJx!sb(?@`
z@SBsJltH1nxX3kDq9OGf!twJfb-QJ#5wx<Y#oXTt79o0&w?AoQ9_?xqXxhpV(}y*+
zbq^GFYoIRmF<rkYso>SEVA8xabKK#9noX~pcV~jOGg%U10a`bHxWkJUWvWe`Wqvst
z#Z$zT3uuGs%}i9m?cVa7OYe}iG)ETjBaO7cCrMYJ;G65YJ)ci!6Ht_TW^(@15lr3a
znEh%Xl%l0q+ByB|W>TCQ_mL()$0_b`8qO*{8f+Xi1YAh1fyWX}OXD!L&tKqx`lMXA
z^IF-8kLtC6y+hMHms=g0ZlL$dG&)FXl-<bRjz<pNKrCiJK4gbE3+CH<K{!}4qy%K#
zE2BjxBj|PrF(Wk%ZEb~xfr01xDdTS15X%<VE#QJT{BQptH1?)K*`>j^VFGGlF{ICa
zHE6}G%>2VCQ>0rEzCwDSk<cZc)IfhQCGPgbq1lS{Y%|w{YyZ6WX{SyC7YTG_3nqIq
z*ri9bx`k(FMb`L8)nt&DaN}gu9(YRWgSw77!?doye1jA=geE&rAm=Vr8wU7kYyw>%
zJ7lz`8h#<aJZ+rPOBc}eD#6m<d)OZTo$ocXVqByBRnUWlyy<W;mHt#eXMRXNwR6+$
z;9L8c_u2=kx>e1-Vtqh$)8i=EJu2qrS)1|Ldkn-TI(QodwePcLjP@LyO|R~T*RJa6
z{Kf(Bc+_p);!1&bTZ`mqY-FmRk%s!bHbQ-vtLoma&0%eTaQ~$<ArI<Iwp?H?li5ke
zejps8)LsgYojAc~s(ROq3C=Z-?4ko#yUp$mkFRvFay3<uQMJBbgJsj3&M8WCV8lSN
zq0-$hsU@u<6Ol-Z_|`Z1cby|V)@OADmpyN2{s}lXvSn!dtj~U$gIow^tIC~}*mj4&
z`LcQ)s^1A-#ln)CrFk;g-1<41;DU0flbyfg<Qn$5Mi9#Smj$m1%;pd*?8VT=L~j!$
znQ5Qr#{sRxmEvOdT?MlVvu$~;9Hs<)_vz3={&l8pg$c;X-Z9?Bw`}uPR-sz62MzO@
z)I#IB?4wC#`>*m+JMn(d<ZTXY4MO#xy`Oyjf{dm03M3(LPjFG5kM5eJY6R>Nj}Hq3
zjl1?VfTtpd8#JSU=)oZCxVTXEKrPq3%2vP}Ra*w`g4g)m8X1VD(7_x>{LsS17!?%S
zX=F)tQ0v=DDX&kM3w_YSAf^Xz7!QCTnusey0f;qciE2@T7iBCS#d$i^kXK@k5S4kT
zX#(RrlNV%DbguEPm~sv6%)OIc-$f7`I;HVY{SkOpGb<*m!(SWUEH!i5H_uGu#MfGi
zE^+V7AKjMD@O}#6?|9!ck(tDlLg=#P37^oN_dj{xQOWXdT)3mPna+{(Cny`#8^(}T
z!@54d)}eVDxQfS2pgk(#uFtlAE@6G;pOZS;3f!+d(l*jFU~HAVb)t0jzI^QMJNmx8
z61wbKEHU2(8AaFj<xRv_WQ`)E;XW`HdMGx7{c%xZPNTkj&^vw#p9-~qvfG`LM4<An
z%yK^vPd}n&!0x=gT&YFN6?q=|%U*uHB-?#=sJBLZIm8qYq29gwx#4j!bv-xtV`uq?
zBU#(?dz;T>)U&{jxWM5h#$3|z`Cg~GJyLRMc}^TgQ`}b+>O&LmxYu;<aD0G2vLGNk
zJ()mZGqz;Q5g5&Y?x;qr@{F!u_HO91zaXQdXzwrl1n}ijXW)8Y<+}K^z!&c?>he11
zri|wEv6|NR?VH><?5V$sS0B_fm_H?73o7tWyWCfqzd4|^y<W}_NZ|q837|7XPt4ET
zoOYAI_XR`k(h!yx-vnJ3f@{s$bESSWk2YLqumz9IYG-1Tpp*yxxLH(Ol<xm_U}s@1
zzUTN-0g8whAvBGJAV4Jf4N5<tVF0;KI$=6napaf=`3XH_wW{+CHA?4lmm(5t<~+ym
zTZ?<u;>5jQVdi_}GeR7Vu9`iY0AC(|vpTi7!3`@ojOiGUvR4te=3Hjr&({~S*qaZn
z_wx0ID%$Rvx2Us>dsqf69OMipJxGEHT5V`%11Xx;?!gz?iqKkbdHxL{&j{YO;Iib|
zb-h<(RpK2hZ_Wk7g@O927|O=eZLeqq5(enN9Mw*Eq@AKga0B#Dov*_(1g+&nb|Ttx
zj6zWpn=>1W=n#b7omeuW7=PiWgP#v~4n{L5?|RTs@0bP;JwaNgB(|?&tP6F;eUD*{
zBWabg!+11^Bo~VwEp;ybT&|bsliji_z4R0uNQ!3F=7Ugb;6kA1g3Egx-`;)L!5*GS
z(BV;?-U>LhvO4TK6w3xw7^7Z$rKx_0IkUGwd4RSF^<J=}xXnnyylt2L4d(HHmpdPu
zMJT9r$)$YF#w|bY)6tay91_xsqnMv#HjVe}<b{&TZudKpwY39(s4W++8wkirhdXVd
zCg4}WjHh}p;!v{R%}f0{pqj<IQ(XG5lkRw=e6)c5Uv|D3Y<Sy@PURVyPR>ktJftq(
zvKE&ed?l9O`EQf+GZ>pk3*jKHPgPEP{@IspYAAk(;vQ0LS_vP4N0>r?9^Og=Y8G&g
zp5*QtYQ?X%$rI>fr2^4n^PTr^>bxkq!a_{L%9eC9NKJ+C^p*+F?X(%8_fr=R1u{B6
zNQ6_Sb#wboX(_lII`S@{jeBXOb!(oX8C+|fcE}70&JaLvY9fR|-((0?+3YVjxOe^v
zeCB%EkYncgHV~!E(PP?gP7l-Rmg(9kg(r?VhAsV|(IY_jlbB0uvZLYBlwSc8uMi1h
z>YSV2XqPxw3CO8uYg&6*Gqn8#p}HoXhJfF2oqDnZeaeVr<AaRVXwy1@7hgKLO0m%a
z{-5DY+UGpeq<b%$=q&bYNAK-8wYQcJs-esuHrta?lZ_>&X|r%wie7>2`?fKn9geb9
zA1(K9z}peL&;M}Vo)ok=<$Sq(!Ri@jyB*3@oX*BEC0(_7H}8*RR8=WKI97OJoP;+u
ztnIC36SrU<2TZO8iHvJ4-bKlpXO_ItAEFLoi4GD>%{2p@kYt{-%VOJsI=nbbnh`K`
zdluao_q_~xOwDDxHjf(?I>Sp#X}^bP{mSQz(QAk053b6EsgeizchEKcS!9L-ZzZ@C
z;>gU0@pGi4!=M>v<sTK&k{N_1-J;*1w+MCTitHE~XJxnW&BS`he4fE?EAgNe#R&&6
zbBW~tF`>`oLcrCn^PXH<%jfPX@Z)irm=y-(^G9sog}R*Uwxrdc(dD$>2RTw0tJy5j
zZJg17Bc4B(TDo55<)4k8Fk!rNLH4@EqLc+DoS9w5r}_=31J9cjOq2e|LK4^g$&~8=
ziG(D7Hf$DsB!u9b#F}%D7DLqwoVX*_ILh%R!F4PVu?(sP7|@a6Le2_gU@gGIXw?4}
zVo#L_0V7(Av*tvF3AWEti(7o#qBVVX3dK^KU*@fwVPDnsG16H+k7g6jiK5MgTW`a#
zE^0Oe{`?AFQD<$)@QSlTDY19?#t_m+q&THn`^t*1R8H%IFZ~N>C|g=ES=tG^$y^FN
z5UEZ_Y_N1P&^|Sz*72p__O=hD=$06UHIC;2&H5r-6RXOa3aXj|Q~v5|NN7NYj>;sB
zg2w6OFP3t4DtqZpuG9{W+ux#7DJ_IT`HTYgC&2Lw(~M{uRmXr^lFoPZLvq$N^K!Ne
zY9n#{O$cOxR){M)$v;{!N`B=~TyrT<4x5E9Hi|MFBFoB*U_cODkxQb<#qG4=<Si&0
z8hFv{sy0(7k><n9Ox@z(Ae(fej0wA+DBQVeUr&>?rbQbgjVN8$3T!WIFhJayK!KDh
z@XA#EqWDJg-YmB_5@4HOGP6aHc?Ro!HIL?MzUG(TpsDbz5ngIViJM?JdaO|@!((Q7
zHl{Qhg`_6yC8oS5aL=~Wvz&t&HOa(&n_ZhjEX)Wte~W$vBNH@;xh2V1+XRHAh9euM
z;A+K=7>wjK&7y^b8P7sLMK3?1{?7TFGo#%{NYs_}FWBh>FoR6@ZNM<~Ms1mTa!bB~
zv*|M~XGJTkdG(lpEPMEG?kkfmY+w~Vd(QV*V*}>$ei2WU^-b|D%kePGPAY4Gj7QBA
zs45_yk~BvrePYH;Lt;G0BH@K^fzDLyJSIbehN&$uW1#T#RDv++pWKzI>tFD>py^k^
z&`$@jzv|<wqG5x1{D-*ujw1VRx4o*UgDU&85nV^W!*JLZS`TRVCl@jTVF6|70_}vr
zLDbg-5AWCFpUM7J^W0!Jk7#Ha(*(sPIdRlG`93qsE<N{lfGDv0rVJ0>%QOaKzkk=W
ztH@MP3Q~;M#Z^S-8B0q+2sXD|fKrv1lF^&$r3};WU3nbIUp1XWvbqQ}hTi8O68z&|
zAL!V+Ww{Y$6%n*S7&Hgv3|2p;*eu&%vfzK%NuQov7hGo399Bzq!V^C67=oAyrJ)#B
z9=VY+K3wrYM9DD^dUqB{QnqmAU++yh#_X;n`gv%Z#&an{#s_mi4Abe$QG^=WB$zeo
zj>v{shYfM11%ehgr*-kx+6HdKRSIxnY=?D?0dd;A$<6j4&fLf>1msRILL;x!>Yj*9
zhtHSmFn#^F=X1p)R&|>VNhc9aM@->E)vprxZq<ywS*}}vQqd=|76kn0U6XeH9o4aW
zk!7h?)N)Fj;}mprL`8qtKP-tkDcmEDwmO?hN}M%Q1W@1${s&2oC2cmM`(8`LjN|%|
zm@IC{W>9o3!d0Ja310~N(48vto5{b*1!RU`aRQm$9kuZAomA};0)H-eDLCwh^Cbjj
zJd;>BthLiNW~OJB8*gj<p{8;&d+{ndQ35w+c@eP%@3SI@LWht~7wSkCfd){qSg@o#
zW%@li*4#8mIeL*w6)sy-O1#`>Y^x}`DP{lQ81=p2gT0=m{Gu>$$wi%E?IU!k84iAd
z*+Ol&SYXgVz;p2%7>&sABs&~qxc^=_%aY#M+CLQpmw{@e+Rt0sxiU;~)Q6u{E#IVj
ztvp$A>h=yTJX2Hlbt+v`{D3C49!>u9l{M_L@j2()8Nu+G>)Z$4E0Ql_SAq5uy;0YG
zMKG(1e8Dy3tGs6oe7w%|o;%NqEQV+?+QV7!4TG8`|IsON-+)E$NyG0#2u5o)v@$Od
zHF~umFjsSI)!x+z;}(o*qw?maGn0#m8tIvu01}!(&}}Lh5bgq1{Z%_BUsKPyK_nWn
zxzVk}m7y^pFW~Na+IiyDn|#6F<2Boog?pbA(Q3&2C0Ol39To93<arfTm20V<{gV!b
zWLu8sBJ3j}Ij^lh?i2|7iWJ&;8w=$B!{<E0wzl#?>yZ8yqd9Cj@n?7Z&Hz6pGH4<x
z8C*5fLy-fGDacUn^<LjK$A|#>JZ@@seOS(lyMc?fL-ifzMJ-O@2x}(krx%+x9qsX9
zcRCCX9$_xs%#;jQQ~Vv+YMDT2^Xk!5mRGq!Ao6Gu&zpmw;{EPTrUD*Hznqn}JAerN
zyZ_hcSAljNxNRwIr2>qOMrp|IoQIu+&{9~&Cb9T|c{;u6hp26~5srHVK_w+jXq8(%
zDZ`kalR1b_=EO;PBZ-&4D9sFE;;Ln%IrtD1?@HnF*(Dclr^_N~QIuX-b6y-XPCA2e
zRcr>7RiRgt5}LI|8R=U~0ni_L)PTKFHWttC^X!3e#|T+zC>Ft(!#^URCtq?1MmV}X
z76&iVOMrY1#ri?$)HyG*1Oz!Mj%>c+#4b78c`Xfq%5PKup&k)Z=hr4^4*t;8q0+@)
z#{kI9BFUW$Q`+l)gZD=LmJhD)GLV3o$Ntie83`*VF*Y5n*Yf&}qHbSSjRl7KW$bFF
zFGo1SMgrB+gO3kFNC_30ypRcgH`D-ZRHMmJH$USp;Q4){99=(yJ_T@P2HUvhK+EWF
z&(9-`R>~9^bLF-Qjk0T-9NgvDe~sX65uq3Mz?;X9ZT?bZtpng))wmn<xYS8j5wB}0
z`O2w#fW5zn4oN6O5M!&RZK<-BE}~lBB@|2+r@~A$oPWe<C@EA3M;eHT0$XBa6m6c<
zLD8j%NX+Uw=!`0T+n49L*lG2EpGTYipd63Yb4h3xsvR~pphUpVQ16qbT13J^lczdh
zHe=(lMIZ9H|5ns*EDeo*+k<oTKMk2CB<(*q!#TM-W494o4kY^6@8TIeM7aJ8pne>@
zyjsFc&J%?GlFRgiH(JP>#5dZm)}Uo?KdxSX3?Dz+)6Bxfz~07_&g)g_+X@@$G*Udw
zv3xW!^e+}W+Nem*fV^=U%yWuKY$fPZphC$)v17}#bRlcVh2%*lM{$)%=T#NdkM|_v
zK3opaen$Nzmi}E|XKJ@p*7`ud8g~lRZ+@f!ZoK=X=)5ARG3^?jgeQixr_L9Y2p8v-
zcLc_9dT|8LKtU!Z#Mm}Za9pTE6882Pc97#Z&$urP2-{ht{N*eN!i)f|^aKg2`Sak7
z+A%BFbNr$pVrG^>!U`-}W(yyNcj5i9VFs4DhRoS7z5~kbmfmy_wL}m>crRs4Cu{3^
z5wI#q3;RSJgB`VgqI(_v<BVKJg3K6LAN-Jf6>fT$$Dg1n^w)jl%=bH!?du`7&QruU
zs?7O`-Xl{(E%kv5#WS25!6xtTGF6FJI(K=r*w-fKrj4>UlcfMy6LyG`<^64ZjfHK!
zL~{*SILafC1(YjXdrkbAE#FCl3^NS>xn%028noPvuX$BJU5N?9@jHP>!nn_H5&@OF
zg3M8BC6TwcGY=$}mf%f!FtqRpZ;_p4lYti`G$W?<<uOh?MsE<U9)zGOh7kvR!twM?
z2tM^Hu_4D%0%$@rqo}dPnwB>okpV(5euL=rDYAP02cB+-+JG3#H=BX2Ot898{dnq4
zXS9w38|J=8+TMBb<i1d9hKm(4(Nd8LuU@D`Uf42X_>;)*x9yYf*r$f=WkkaOzC;?~
zS}|6eZ0zoPT>-286xVPZ9`3U2qVscQ1!HrP6biH12)bb^YJXV~Rm8^Q0B0r&5Q&su
zVJH78LgywYL-&@M^GknWJOanS2J<u|ki^dlzPv5oqQ=td!cV}cRo*F>Qffso6IPZP
z)|j3RdJ2PTQQkF1Ula&po<V+Q%~Km=2X|{1j-&>NUiX!|NC50diAPuhhKSXM!j>YY
zG1>+T(7>z4&|b7BijzhXfUhISr|PJ<1*s)DZzHOs&yq9^l2|--Q#m35y0Lf(jPO-f
zB?TGB^DH^he6-<OSGbc;QOuNK7nA2vuDEKGa&@-MQB9h0EPBDNAWm*=zhFC0LU^u2
zBFc45{LRjB%lGlln5-c4-~$D`cBTCs)%_Ydh>hN=_622(MjVR-f})JAycg20OePsj
zmstoN48bA`_32`rU%Bhs2xCxhVS+hoL~qF%x}a;K0uBY}1J0Az`k0kWTU+5yCRwf!
zTe)(}E&GgV?PV+<bR3|Yj)t$czqf%GXiBXyEURGGiN9Dh0F%9_!A#y;Z<}W2btPGa
z&!)*n3RLXfx)U2c=+cZtJ64-euj|C})g#_Lf*5?qGQyurj-zVCpN}Ca#OB3MS+Mh@
z4`>YFYRsjac+_i>@K`S~bBU#Cx2`xNOWQ`prRfNZ-{%>mhoXT$Q_)jfg^3!DIT-#^
ze=^RQ2I9Y+Yt{s=@l(!Q)%4ByO&nrYNoa6SvQEj$C9!xR!u7HZ&M~BGBC)o)t>+pR
zcLjHd<stpi>}l@b9>uR%R@Dr)_>g#z+(&hLyDC>Ksdqmnw&}2L90Wi5o2Rb>MXpMZ
z*be)rZ1+(v3a$B+N;&u4i0m>RvJ$WI6uyXjxp$2<|FMcGlJ@oNLror?D!a@%CJ@tg
zgf3_woe1kN2VJ%&B%Zyj3)&@O>H31)Ujuh%w@e=Ctz&#+M#k^CA=m7eq>A3YE^!K&
zFDrbgIUQvRqBmsCNyoC`62K9<rm+KeJfTzSHQBZ_E}k~LOUBOlPtm}p)YAfYL_dnI
z^}QaVpmUyW>m}nz^PaFzKquPI6lTPbJTsOO8~lLhN?+NL;p7d6V`;?;tsa~{Fjh4<
zlftLWKmm?#0fl`Ehgb!57z!Ss4gQQN=qe%phs_!RflUYG>(aW6fASY3t7KImn)F^6
z6-GEy^X2c<Y*7CZCNH6pVd*Nx(5B*Ap{AQz0-N+QIae8l(*C2E9u9AbQPcem>`SfX
z&YiduAG2-7!q{qPf!ZqCZv&`$XzB27#7^~QtrDd)GrM+~K)?EE_M_{@pz^R@?r&6k
z#VI1%K|aECnDc5(-H4Bj0CSZ@ocqt8_4fN*x%tPNkC7GGFVo+G`OQI&^t|{zm;C6>
zg?DE3YB$>&cvuf>Yiq+hQzNmgo4qd`?Vo1vysWKktuDCS9$k-d<JLUuYhDj{eZ$q!
zdef#MjV%A6{0JJDG8Jw5-hCHl0+;d-;7oIW>paY>u>19)Bg~t1R|dRqLaLng{-VGj
z%R(<)qyg8&!jfHSVP$Ql<Y&V6f_86Z9nj~+9Xz-rf8oKFIS_xKx{RNu?RSHJ00=)1
zNj519*Won<XM#Z{*VlCDPq1*ba56d0FiR2xrLSTgh=)SV9sa>|bxh?4|ML}NqSz!r
z6lzYQSouenIokeKnx7}Cl}1;<zyHDfyiigOeUpB$EU9dx{EUgE2A_!)7LX6NbQIOZ
zG#xjwZVZb$4-~t~Vn-xSd@X`vP6Gi5PHQ2u=Tt$!yecbOxyFyO&y{0FKA#7Q!2KiL
z%yuE-UN~1M7uYdpmXscDQ^9uLfK%B{;N=G>q4ws-gIhTs6xhMeyB3=KfGt!@PZiGU
z*b2GBh`C%4I?)PrM`~r**W&d8hI14KzCfT=5OK)Y-$Vf6QdGl}0&FIARD`1aE#vJ5
z`2!FOjup4#%o*fshqSXGUri>q03+Y@P_zXTi~DTxP=GppzZ;v2ee7P>xjo0}t^y6y
zBh?q$!De}~<E2Rtg3}~>R4sM-$9fiIr7(rE&G1m;@j_en=_GaH$pqlwuQ(OSUN3|V
zyRclcoRW~^-L%fye`-aP!|L0Ur_z&2j%bddJVlE(wgeM>@8iERdWQL|`tfp{SG#T=
z`E)ynT|brgTG(lEn=iS_Vl5$o%y9BpI9R6PIhghXid$M`4D);f*JD`>jsd;e79FCt
zaF%3gerzkMn<|AdN-Og?Q!ceW3LDn?8c!RvK=EK}`2CJr8`TGrSEZO!Wgh=(1g03P
z3Ac;?&my`w*x=vTr#aXt_@5p+1p|F;Y|In-<<$CE?BkZkz56V{f^k<Sv-ywnd_{q0
zlYm^|%ERZ9c_Zu#!)(4e4?DLFf}wH=i?1X+A-Yoe6Yjv<Y21m_Ux6%M3$(wx#bqG2
zJBz36)vx&(Iu}KM?3f|_{y#hDh`w~QBQ0)rp)d76KrBAP!t<E&KR!V8eX8sA-=Jo+
zM}qpfn4*JHj+jjB^rPI#rJ*ojj_c=~dphNa%2tw+e-$9&K0YUGrHl-I*i&5-kFV`&
z8A<(RA^)Ng!WR`#bSEm<O5c^k;qD1v9s>jgQtWI2=c!il4(T0x3{Qdcty*1G&MlUi
z9)BO4u8N}=Hq=~rj5*7iQ}rUs^<Ld8u(tAWS$TS&$mEq0<hj^n6$f6Yu#o+eLx{6o
zLAf%qG&hb;fb79vOs?F;udy@|7vYFog@LK7a8p+fq0Vdd%uEhvY#DFu(4}3$iP91~
zxGOARcl+%pftqzkwT`+i90KJ?B5}zO@U{JLQD{q54Pk4HLi6N^1Hr>gN5gh|%0L`%
z`$a>##=NkHxG|P__&mIo=&*gz>H{74bh;Y8Dvp0;1@Yl-YsEc#{(B~r;?Z*51$`hC
zc=fgU7#7229OVfKY=oRgp6#0vIs8*!&ZljBd|F>$(Bs>S4r5r~anp#l8vJKT$KU^&
z{x=p5Hue=HV=Y*rJ@NE#O>-9oJF!Q{Ny^+t1ehfL9Vr>U&(6(f7i^qfrLyJKK;eMK
zEn1`VZ8;7e3+C09N@4VHE_<)JmW6zw+1Bns$lpk;Pp(=?u*|{qK>rYnzxg1WgWAwg
zF1&!H2^rZ%R=8rH7p_t;0Y;RiyoIxNTvk-K?C?|`^w}6fqXqxSG86%lw`UuncNK&Z
zWb^di#HWJ3e`f2EV7{;==iH2Vn%7{(-%Enj!~VRk2<_RnFdCgBVqb3_Y1OG3IGFs*
zVuYoj0S9{!$0fX@Ku_Mk$O=obeNn-t<Y?+sBul;HkSoMwZsom}FG)3>pB8nh^;@nO
ziGppTc;~tPxI_1KL0lpC{7p)XBUH=w>0&ir2@}Nfi|!2}9%OIJV*}4v(dsuwm+fYM
z9Z^kjE_YK32gCRvA)m`_PF;w-B0jINv9YoOdA?#o-0paIKU*k00(Vm--51VWCJe)z
zo6s8=f|)!(V=?jCY!`!>(C{-!_1O~#>xG9+Yk0W-@@`#PTwZs(?jAE1VVTI+ci6#6
z&Q}USYO8crSew-`UEtQ$N_0t5RleyVsYp;t(0sgq6uCWqc*&Ron9Y}3uXuh>%m_e~
zSqr0}s>)gRn<h|vWDZbMcG#${tQl_I+aXr{6Jdv@D?kjZ)Nxa`4PJ2uZT_;--nzLP
zJM~p3@Qobb`Bp3X_I@!t*gI(Ya=pJ>R{gxeyK}!)ZhimXg9`jrb?f@ShqQC2NOLD)
zANCK*e!WQ`e=!sgdjZ;$N8FK*>dH>n60wN`7oI_2Rx_o#%PhvCW*|aQ?(z#Pbf_TV
za0OPSGvnl<rn_rbWhENvGjjK~Y0fRj9fnGs=nsI7*5m36pGz`AXLumi#(&36fQ+&?
z&gC!^i)}iG*wB7oO1h+$41#-OAF|`0yvCRK6fF^GzKxapkB7vS&ZF;KI2Cg&U>eE2
ztx=65vb+(B5>IBj;~~=HuI)o-F*{4hyG5R^+yQTAgxAz*=q(!|=c@A3Y#ejBjssx<
z;UKZrP@mDx`Xk79vLGFl{@Y;nTEd^&Njr{f=5J;*EW~(RUF8=^LEhP<)Hu<)bSk1I
zHxbSay_fn*gb>frDK7_TywgM*e5G|?&f}t10ax9~9RPDs5OOGFG;qLEaZ5>5_zqn>
z&k@H46CFT`N`Oe3kM>*^vrje{53cB(oZrFEt)hx1R!Kna%eGoPa8|cOny}-s0*1NK
zjOH(CnQ`w@FqdMw^Y#a<m}lieUWcYQ?)}R|U0)jEUx{lVW!F;zYyDy#-4lhKIxdq+
z=M1mOjVEd0G+pJ9va&`jamQ&)Ewqa2!;ZVN!&BX5h3=*{sBZ3M%$x8{8MD<j8dCF&
z$FYU*i6VgVv$uS|3EZ8{e-4_gJ4N{A(q){?Tmw8wa`q|;xql8q;?IejtM3!MUF-Ts
z){vOFA?slnE%EdRyf(>Z6MUSv1$(0=!r5>WA9e`@{>K3#g6}&qDFg5(ag5_EFx&)B
za}|f^EmRDwQ;ZtI>dOFrhScA{oRL5=vDha$;}5M?r=N;1TEr_>oWDN9AaWkb#IM1c
z^&zc)Y_()3*pQyxiDq1F75X8?Hpas7+P}dW-kF^Tc}{mVK;%7D7*qXen`bcCT1(2p
zt|L6er}y$Zc;4iu@%J_%y)^;F?T)_}w7Az62t%-G?oSe0NtA*?@8gs@MiS=$T!q$u
zu?mVpMbRsFeg%W9MgX7+RixuGTOX<oHikQJ*2k>DN0!u3lL$4M%teRGy{G<KwAIm|
zryege4rr|6Ik!E`LXRvR-adbY&(OAUa6IFGl)>@_;a)AUYQYh6u!9E{rIR=HmBhqT
zu1Ab`Uls2ON!4*KmuG4)_Hdr7p%{I2jB8C1v;1)Q>iks6oqtqcq>UGN34tM)MwHP{
zTFgUoujoLuoa3l$+q&Y;=1fEm7azcb&{lBaZUV8L7`<@NV+Uv0OCLn@QLcikD$0<g
z;xyg8R*c<}%~V9z)qn$3booE#7qfwhAg1_=A`W32O-QM29w?5>3_~>ci4+3z>*qrb
zM*MChkf+I&r$PF1(5r>=ejCKNRkbyHpl%+BZyIVtkP7+&v?k?X9&HnQ5jsfZ4-<>M
zMTWGvj8@g(R3Q=fTiejO+dv1$bUF%d-=lNuac-)&s3fhYBo3nj#nkKee=V7-yN28%
z$+HDT*e&{^dZkt=E#^^+PQ9m@gFBGkfh7D|QLLKUH#(nvF9S)s=+itc@|YyLxUvPP
z>Kjqfj!+$ikRAi)4ssI_DnZ<)_8B|HmVsf7=5^V~I{rq4i~Y$>yTtW3A>M@(dC599
ze2^bu2gmV&?o>6kxq%{AFRHqWs*jkWw>~~K$>AJo2X(<JD+|TFmPHg*{N`diwozDi
zu**V#%S`|Vi-c==H1Rq1XeD6Nz3h1pP&8`3XX2G^RmCyt(JUn~LVhE-t#j{nxXdi{
zm#OkI2!{KI)k%aQb)=7GNNs_RYw-#h3)H2e1S62mRn~lVUrtV4`r#2|FW*uJize)5
z{gXk3cjbEm5ScM1=xOort>bx?Na58e8uhfPm5ZxZ7OLsm(Tl?hKW6vS>40M);h{e$
z`WKU6cmeucaulr2OvUDl+;|m}9Su-?rO=L00%c-MbA2*SxbygAM-fr7tp$m|b`NMu
zEzE)$;Ycib2IWkRsC_5c;){wd)QFmjD+9P1xD4ogds)D;GKph@{L@kT0UHU5I3W;w
zMu<Ayr3CzpuFeF#>Le4`unl^2lV+vYR;{J<`wSN4HSx>LC5QnPX-28}<0wH}`upx0
z+2UMM`#C(fiw1{~Xw3tz)-hL#yk6Gtec?80b;#9A)y7ARi(JX2{LSjzDV~tV+Rm|p
zjsi;!o?e(vwH;#TVBCa>j0BQ{qz1u3&PQk=e=yT^<^%<y7W#Wg{V2Blbfzd%Y7yoF
zloa+|>WO((u};pg6~>`9BRAsL=J8IFzfO}`nZ_t46PbehJg!)?G!ff%puiy$&=G?Z
z^O{IOXu(&P?D>+<$8CNc=hYCK8KfG*P!jY<7nBE3{t0kHWwT;lz-cnijTRldpL8@F
z5fC)_Cu!y+MO13sZh67(3Fh>-{Do%43hy&+``bVqze{VJD`*-+K&muZN_$p`S+cW0
zXT$Oa_mW%kZrI-hNf(4_ARgGN=QANmN+(Nxl_;YNoN9(?%DJo?Zsr8`AauRc5+-ma
zPf3jeHpH`V+g{sQ%~Hz}gi<9nabewP?r?R9Dt&m;6!fG>hN^or%u}A1n6dQ%BGvM-
z^+BJH-aKmB0wP{Q&7!`{;I8?%OvMM6HdE-)bd;X))$M7Ui^H$k1@>|F)5jjit#>*R
zQc^k82&x|`8MbIEXCaYaEzJW7(>>xY=<>aW8GrE=$QVw4bD9VPBr=`}NKw}K)0YNc
ztr6&J{b|=w9JOV1)05dL9nh7)J~Ac@L#4Ng?~SSd6$Q1!3mDItg{PHAN4&2~Al~94
z45D@z`Z3?wHL%HLe!Qt5v~Zkug{s%@BH8lxVx~}S`?E{_(zSJPle{{pr)hV{!=u~x
zl(V+X3G^gK<fPftX??;={!~PxOZRj{(@Fi4NcwvaoirXIa2ZBL+VOymKc4D48{t(v
zAU0=C26KuTEo2TI!-p+xBSW+b<HdBRDM%e&gW5MkiD${E%S+G~-cyrD!sjZkava9w
zqzRKA-DZF`2RKLekEX|9OpJbTfo{|!t3OJ~j$**|S_lV78wnl9%9xxFCx2Hqcia8v
zIQ5?g^qfqPX>Bb3%G(6FX{h`$d%ftdxqz^Ox;8Fn6_u9zS&DK|!du=gjt#nvg5%LO
zP(>89y6|wl>2P5Dd|Rg0;|cX|)R}cQc1DWG`L@OSE)e{X&Svn=SPBOnqdIFY!Yq#?
z=EYA@`lR*@68D`@ZD;4?84$$6vHZf}iL4=xSB}Re`GPODxtwrcYTAMcP<g3X#?Y1D
zPtxA-M9B(;qyYvO?1dOHOdRlEpe4U2n?uNF#|_8FS1>3v8X|utt_n2bmAhLBY(z-K
z)pw0V`Ds*Yi+I`EBgpWepAEIQtyoY5wGWFdm<TD?jXHc5A~VrD3+SLF>p>hi6MqW9
zUE`KAiy1(^#gv!~u*CZ!-s)*R{nNtPs<;B|L9v*?yk?JE{T-+1iO^ViLUC^0UzaS#
zGIwm`q7~H#y4oz3k0d{WzrqW#8y&Vp6i6CJWWbO)_)4B4qchR%VAm3%8fl=ahgO^f
zUN1N*-Yfn9$<FycGpjG_aXHU>dgkb}s0E(k)BIqURZ>7rgNCBruvje83PmTcIJ6Lx
z7WK$w)KhuX=nO)&Jy)D2wZg;huds8@3j#I8txUzsIjIN}sz?~vR}i&Nt{(}<ZLs+w
zCiE!-R~gjq9^c}xa-q9WlPCsyQNopdFxTj}l!bA4<?k)o`wBbAv?v-ZoPe7Z*tgPm
zCN5KZh*bxeIo#sR1rw8;_XH&PrP<!(FCwPV9^XjEFAGSYv%w^!<W#GW6^}Regl%7S
zYrtV5JpHNfm*X|J4pPt8+04Esx@?k?qEO^^({EZn+0|5DNgR-N{FV5R))_xYrlMO%
z{sLvIh^msK_0i>5Z+dg_aUFIwJuZ2a6s5*YA+*+Nn1Zp3s%Rl8xd1kD9iWTJvJ|u)
zRH*BmA`w(T(wnc$xQNjt*Bl!jc~)X~)7{7<?)Uf+xMOi)GDk+qG{&39EM|R-w;2W_
zX$wBiF7}#^NtHjrUDcJgm_~Whaw6SoKbYWcTVHw8{Jla~Z)s5HQ1rPxUZiBZlklFn
zA@kd>uq@G>C(o<mK6A47_OV>r8!g<?L$){uF0~9d<ZGe65@aFf_2h-k$}nx)aNtU~
zcOt|iKKI9-fMHS+977?`xnF^d8{jh;@_@4(O~zR1BPC$>`Swf_eR1+|-&Gf=Qnj?Q
zU+009iy`BJaMBX!G+sl$`2`#3XkZ{)2$U?5$+kT*j>K_J(vSY_CY;Y}vd!?(aiZ4$
zJ+P*Bl4Na+*dlS&rd?+D3ht1>gEx@?Jm$CO?U5^@*NCyRvoWk}Ho9*dbZn?)y3zK=
z2WqlAlplE%kkJAR>ieOmUnZ$kM(=EkAJxqHbz2LVkS%*u4I4T1IlTmn(&Yv#2Objx
zn)fF|#Hf=Qof(son*&^$C16Ec!ooEoJQ*!Rv=@SId^~y&<+laq6Su5{sr^iAMlpdx
z-&@({NY{G;C=kLYjguakz72e2<!df*@l5Uy4|G&u5?hc8&0jWf(wUf$l)+drIR>NQ
zRcHDkKBIB&$jc-Nv+v=<3no#D=I%-EoQ8kv{l?4D>$P9^YJ9FB)UAL4z}s~Qk(l!z
z!*(_m#VzDAz#nxNEh4g$Go-lR-4cbDaLdy?G^>M~8t#U@qsRW!N8r8>Mu#EBGr+W&
zF?x?#YZg-9l+boLCSV|I<`288^CT{Zd**N{6hb>Nk9rU|4rj}@jN{zpph_@*7IxPZ
zb!PGXPAfT=nuAQK>{h!fTA6FYcp~~N$>WD(@{F&TNLwQsWHxOH%nMOijp38_kU!UR
zC81Z2xm~3@xiK8wyt6}ny+Xb&J$hb5d>^N&Kr_Jm#BAGxT*zxqJvbv?_;T=6@J;&C
z+$_aG4j47*c-r24`laxvWCxm-0uCY&(7no_uYag+G+<EoN=jNLfkgNwBhP?&mr#p$
zoN1FWu`%UtvYJE6uX(A)bO|bwBOycqA{f)%&<b$X1u6cfsS~HTe4BBR{d{}P=EeBF
z;eWY6L4V<;{yJG6ewtPx{W>YEz2p6klg(Mk@m>xW{Q@qSLbHE1OrsR_wKML+^`&h3
zO{9_>*~ls5iD|ZI5t*L$&regU=S0;G=lB7tGEmO>cXnzUEDZjJiH89dr<j8Wi8n9_
zt@q%}8S5HZL}&eEh7GQNb5b%IuP%u~PS<z)rFp(6^LBz44Y-!xf$30KyC8-+;bh`Y
zp=vR65oM+h2FMVtao#|%!dDO}=nFQ)p30F<t>X+xdpvgYWXJjX;GNUV5{)idI^wf6
zbfLaJ7RiZ~bN<T%)Lnw;y%%?ZEuod;;;f!ii4?H%*Q6KuO*u!q9oPwcRgNqhkojwT
zNE2m!GDZDsW6T)oYKfr+)XwN7J&Tr4j*0xATpODDn2JPWl?Bwtl_XnAu~|JE)g6a1
z?(rHcLC2G1Xc5AyvZG0AZ`{9`Wlr!h_XwOHLi^xcy4>U!Fj)RXIZ`V+gzMvcBO6e>
z_ShX`PLRLkktTkLMi>JPyj_cvi-dcXy(SLwX`FjQ)!JI8c$Xd})}i@YeA+lZnJlCQ
zPhAt^$|kaN8qq^-geOVJ{!w8)$ID6O_bHWu?J(Wheycb>6jU~!i0{-S(RB)AaimeZ
zTD;>Y+^tViag`Tv*;3=J5COa&#w1XhlnNMs%tmUNPp3^m<ZE+=t_gyRD0AHh>=|f#
z>e8=nJBwoJoDSSLFu(pyt#?Q?sj*473KC?&Ish=)D`sPbhj*J|qoF}T_b4C^MUzU*
z8{i-79w1ykh<rvc!m6_9pEG3SVK#?E9+vkA?%<_U;}sBQz$6QnL<wY8*mj`wH#UkB
zrx1BK!^@ILK(q=?n8QHEJqv(x=({3*2W(vYLqj1VB{OUiSLj0nac5dSP@K5#`J+d|
z6vnk1?jR>Ee`HZCh(h{sizF;rftsK!xyfPA*qhM7;oi&<(*5P60M=9>dfjjPSAyR5
z8mgokJ<xY@{~CNzMS>lu{rK;#!E{X7<NK`wV+MXTPl>NqsPtR=6Qap)IZd4Iw_2CN
zZL9YFUJRkSH@LLlj=^_M38=S$zR=4$h~f$XJxkd}9%joLa{0ISW~(?1#tJtUp`D^(
zi*r5)Faq}^_iwH*asT%DKb*_unSTHyCcaBKA7P&8CEY}K!B-Y_&sR&rTR>(G9qv@7
z#r;$+9MTy4<x{>Km4Vhj!`E`^hDsj%O)6H_H>hwQvJy~Y;dZ@&I)uh<Z2UiKzNL0a
zY4FO?bf-!c^~p2BtJzVTl?w!mjTW}d#qVmDsaHDBL=qCU&$=K@_=6?%Z~-cazD4u8
zlqju$l#LW&Q*Hx~JX;p!mOFG*1(&Q52&>nW0a^x-X7}b75c>;aV|j{Me64l!vRjgE
zz1^0fCgw4Xk?QVC2{7k880l!$HJ&Lm-10DaKH01`ViyWmUGU1S#*;G*Y2pRSt?WUR
z(nqUu^0&XiDqp6;Hc4y>!K<jCJ`mV(l}PH2{M31VTo}c4w1)}&Vy(5}+D8K`z|b>8
z%`_$c;SKJHsfq(<IsR19E7o!|)boda&dp8ky1dsp2=k(WP7~0Lb7`E-wmy=!(q|@j
zC0u}YPHQ&=ZIT&?i=n`!$k_IG-SMW`>2pw*>mgC|<&_Ivc+KgLjEtXMx8J}^M8IZK
zwIjz8r~d4jm;IG)vy5e)2I{4qi=ulXpemwXBoW?7q^bkguSU#4c(~*5m9@Y7oNAhM
z`7z<R$nTS-Zc}%g?1hXT^4=70Cj)yM!M-OgjhVV*()&yD2*?zB{F0o5gAGEc)LUCL
z`t>6a0(<mL<W%O(J6?QrN8{C$XDLGjDQ%EZJ!=m|>T355{j`KZh8i7nvz4SMD<F6)
zUZ_zRZMYJn;;d3fyMmMOMys(QrwN#N9S&$p5~hE&AVP}!sz#3?4bM43h#a+K@~$5C
zy?Fc@ka@xv9gNSu^N2){nuTvGuJ2^c8l8{FMax2EZF;8fF)vH1bFB@((|t{AfTp5y
zLkj$JR%MAD+WyJ)6=I3?&3P`SDzmL*p&Yo<=wv#O=|yL$_XdLX#mUxic{<-<>NxA9
z(09jZN8UFWT&G-WcdYA(RN193(4UH?UXQCz&NFSg`-gR$vjeHJG*a=bXJOfSdvlw`
z1gydTj+y$y8%Af)VtZ8J^0RuA<@twZ@v?hEnM6Dn7X0oOST>bzKC2zmPk7B!=1yL6
zN4Epqi%OsgSu(K7lwAp*xF;-${ou>`L9jCLej3C4zz*bK6R&`Z#X|4*=2BJ;%9hjE
zR^)FU?$Va3Dsp9(1>4~KvoJOCG`a)ys=s^8ITptdPyYaQO|IS4kO&iXE0WDcQ#jq;
z9oH&?$e<&uLpXtY9>Pw&UD*r}fLE+<<5m*u;BH!#a-<5bSrMq9)RQ1HdY6DH=odb9
z`kjC+!|1m@KvtMOh(v@+EE8Nn*iTz*vbloVFpn5pHhQJmLM;4y-N%F6*%PPvbNs^K
zV5($iSh^*5e=*DeGT9jFZ(XIJhl_i<EQ&?AsYbeI8H5^&u+xTsk#m2DSXZdKWBzYZ
z^V^4i7{jwe&8hChiL1gE7%_9+C@F9V`tv$V>fMSW?KQkYwL>wj`A$~fEayoL8Q<fi
zx#s2LQs0XuOPxJv#oP}MkFBI`6gbD25PyGUF4zsx`Ngd*t6(IQG$hFj59N5Gz%8Sq
zsyWxgHo@oukBg8j@g#h&6Bkk>#$x$3(Tgy0oR|XU^Hh!3?JR@_0_3U^@!VbttQMe`
zBO$g*O*iKGlxv@!Je&)Y{6kV0BfrI1WkAX7QmBb@8y%DXtQ5JInU}vau1-wa5IoUF
zwoe#V<LHB3ehnqjl<w+wqRZ}e69k#xB#$ialY3eA(^?L}SLI#;O&Z}!B_3iZ_@fiq
zpaP_WW|X_@{r+_3ul<#K1-h&}#WB@aYaW#b&01wOv#%{gU1^Z*(a2g)=p+i<K3_}m
zC{aT${!$5E9IKN0yg`&N)`geal)he^PC^@)BCcKU8e+{#hSrochg#9z$y08jR8ah~
zI?~CLvU5g|s&`Cj*OaL3?QDM`3>W`ZlenlbIu#)<&tTf|6kxm-ex6AsVBh2V>TM=+
zoG_A}-t#jJ>C<u9&^W23J;yBVyKS_!f!k-nVmiEiF|(?}Fs8)hDpB*s^87`f`amOj
z=%A?;a{Ibs2vT!dteo;|y8Gbm>N`tZY4{7A3flb<^<6FQ+x6nkg!KDn;A*P&iT4NF
zPg#%Ap~P_J723ZKj0@%e?2DHcH~9@K7@bW#ZefCWR+;}njfkb&DCRXqc*hbsxI&Hi
z-xK?LYDCL3*;@(l+(bdDy#Wa`u>S#ZK#sqW9@>#fwh~uVQ4WMy(7xnDf(`_sY@i%y
ziIvI2(a^-WBfhv|X;Sp58;wPQx2mf(-yJ$(VED3Ps$&U@AguW8z;9H!J#w6t`s<S_
zA(IJ7j1x#-Fq&Gfc84z>*=$zpc<-=gG8TiLk1+|@YJAhnkqOz71SMQkUc_e;YXi#;
zYC{&Vq5q6xSd%#ZPi3X(gp29<m5Kr3k$y8ofKV#|jPXcSxyP9oB<Oz-AgMLO)Gp!y
z9Wxy7QSOP&g$V#$KWev$z#TPCu}^}{4bh(^qk#!2=Qf~M`z_JoC>7>m99|*b6QFpn
z-@CUC?KJ4M2FK<3h<G4f%4jv=(lr#iPo3RUBfsZ&%QB|soDi0yOTd!D@*Xrw_f(8u
z8@kfwg!SvfpOSc(wM{qDrMgFhhTqJG*FBtYn4C+VZdZG>DJ+MP&=~@ZD6R%9UM~_E
zXCzv|M5((V2QbV^I<u(+pczjmmB182YDdR}P=Uf|&a`Q*It1au2K5OZr>zgchV!*9
zOb1K^1^a#y;ns<bNOU*qW<k8MJe`@XhETw4hHa|9%)z2^Ds8U+v2~y2)P0`QYcvSQ
z#9R1RA4fzkhy|D`t7lvkAq@yGltlWLc!|8h`*{oGD%9O;EwmxFuGJ}SPb5Oi8Ns?%
zeO;{|dOCHz7z7pWyF_b?MRk%&YgyhFO{enKC8Eh>IKm~nbd*V|n=51ELp{PELHCd{
z-++n9THf2=yzy~4&mWuq_&|Rf#@<bO7~u)#?4+oy085;?tL1aBF<27>_2Hw-y?l|z
zeA5!chrrVU=VQ{|TFlBq%Ta-6FrJ2CP)iDH4PMww(Kc(+*|~z(Js%E+%4t7kc?T}m
z80%l3s`*6CQZzPa{8FN3C!!q^ELG!_HRfh>5j6vlZiASiSKJUzxqD+mb{nKDAE{Lb
z|K4<tf%Ro%4oxgi=G5xo&pZ+*#awW&iOoxLF2+1zFLNbnD*aAG5zQA+#Oy1Lh}nvZ
zh^4A|4T7oj`2OD@m<X~47C00sLV`IGyRAa9fkGIA8I>Ab(t1!SheEP8$s>{@O`MET
zx1yCv+CW<9FR!0R2W<rFwaxXM7R2P;$yL!EO^9KKXM~AWX#BG_xSL#h*dPGh7EN^0
zh2!zsnoG8L>$w3Z&{x+%Jw{PYrI8dJ8A42VYOm!iKYM(0)``Cj@1?N`lL_!@<KFYk
zHkCo&y&J5Ss2G~(RwmSneUejGCzMWYw!96E{_o#MSghyEjf)#~194jHc46vgww8h1
z>}DdX|34469_{?0`v0xXO#bJM?T26W|9`~i!Rl>%?yLs;w9BDzeFjujI7E-DvnidU
z&lrPWO=!REj)o-flsfocZ3XxX)hve>F5hu35uVYHJ)=l|7N`i(JvIom&N>L(9VaU$
z0|=6}oXx^XNN=NL9gRTWK1g^Bbw7Hj*4w<PuF-(m^nk4>2WKOaJkBrHz0Dbzg0UB5
z9G0Dttz^7isPtB<0j(TX_OdW26?^y!xBc+RHnYI^{s{TE!I^tDXZ#tlWvLBy=v$Pf
z2VK<z^Lyuzr5)&QX4E5;RhdZUtHJqnI)3)xL6<1Q`Ve+>XQPh~#<Px&D4RU!$7A_t
z^U22Ami>nHkU-*cf3QC8^;7M)vSXKct^<<#2DqW_#TX+UUZU=z)x3=lD};(a!5iXo
zYA3;dy-{lhbK5b>%I}kDZxDCZ&tH1aa7cU4R@BxIrRLmEa8TVnIhs2F8H3V|ogB3q
zwf$BptaQpjsZ<Kf!S~<OMk|+t&jJ5@`7$Uy+*-q<a@noNT6ec1N;(zMj;&~F?!GB~
zs$5lm<yxQ0$g_gzWB(JB{#X6{)$Qn@`d>xmZE^l}m91Pm-aw&}8SSUa779DRHy@@R
zY;AcBY^EF7NjI>WZs3vAK(qcjGla+K7M_^t5C|XowKM&1W~x7Rt8Z=q*mJQY__2Dz
z_aO_=<bjT|z@ACL+oO}c;KTc!?VpJW`RAQ)Ha=}{Jqfq^PoGpaK0V%i_;`E!=_Y;c
zJnC-rJKa8gjh=QM^*Z4r`ugzcqn+;7qYiz2^t8XZx!FhAr&|yEPqxBs`WkjNyN{yY
zqY7H?J=u61hTQVz){}>iIvXgxwf%7O$)iq$HXdzsANRTs(e+j*denQ2HlA$sqRwU?
z1)g?#-Hn~_F@5cBKJD~3sQ_Azwx4!(o_5h()bB*wkDu(&*Nr|E>UDRxlZ|e;+3n(M
zFM7Jw-N8(@!^hiCw!;uzcRL#)6-L)PH2WvLkXwHG<YDw^^U)UO^5o%WcW0*uXl!ge
z+<M%_OgjBXPapTYJfxjyW24i@@OzKK$4@u6@pNOS8}2-Ogt2XIZ#~_5y7QP@-g?}5
zyb(SD7`LL$&erBbG`HQOvGw{G$D@Z2Y3iG3Zs*ZP`1s+YZ64iDxDj>$@+X_!t?tt;
z2F%vut*!18fpfUk=|@k(O&;@RNc<K`cel1XPpC_LeZ13sv>Eb1H>rUqn@{m|=jqdp
zoh@|I-`<EGKH{-$61>9=s)m*~pN8Ar%}qdbGkQp^Y+%e=1jWaXw=w32+ntS0w<EZ*
z+1==N(8+exdlH7*4Cl_%Za3Tp^mm?YMLT^07h0w!2xlV9<?)m7(au9&peNhiCy$?O
zG8S~Zk2kiszo#3WsNe6Sxp4at!8gME=-JcoVP6*F@#f<v{jEE{Juluh!T#ytF5esM
z)%NR$b$l({JIVw~NVWvshZ4PnbDbXSwtfm$yVFk<wX0seYt>jm_5SDb9okjA%fd>~
zp#qhF<SUY-`jz0U5}a3pxDxzQ38tI$KOOTI*o!pmZ)}=udT+C3Z|*z~?%zipi22*)
zJKubB@jm{UV_KlYUw#IS-r8o0El+~`!6rZ5-0`1o@zW>%!-oh$CA|mI<<2&D>2$>;
zjJ}ghz4ddMD#`c9Khswxj`Dl+k@IqMho==n1e$(Yd&!w3IQGCd9se1^aeUMDpKak;
z&wut1&m#XBVE0YmfA$E^&irQ>%s1!$v&Sj8`?Cji{Dw_L&uLCLLn2I$PQIwpubkog
z2SA7Ci`Ktk+fkfWAztFlqjQzRGk?QfpWzF})yEeMI>Hxr7@-Q&P5kPK$oLHdq=PSj
zR){YEB@Kv5Zqd)*XzU(ffgdR6K^6}?{=+SP*!3Si<cB@~;Wj^v{D+VDVc&na!w=8=
zhmZN;xeZ*QwiEI>q<0c;8?Fn)lz0>yy17m~O+7Jlre~jsKt7Fjb{=Quj+dRz&f_q8
z@+boXynIL`y#Mg=Rt6S$89v(X_a8kBGcdu+N1GebqpipN3~cc7X=mfn&XXtI42<w{
zv;X8_?`hb{z>1sgL>pbA(HWR=yrO6c`crXYl~`I7=V3Y=+%2jb;J<g50mI^lg5vHg
z=qkSXhLtehy1k$+Bu##kp`S8lU7UA@x5R`mB>dRNJ~9x_fAd=!GMsiJ3m66oq&k-*
zGZ<n`1ytjB_TWKqjC<a50`f;4?*TSXQQtZu%^-WN-^ot-`{2<|8i?`z`?91@c;qSq
za4coL`Prfy8@#W-QR<}Sn%mi)+uTxXa1mW3(bP_=f<uVLsmKgLrwYHOp7yXBJHA)b
z5dlG`)x8IhAxwbSoK2O9nC^T1PI|RHIIadyo;y_F{SNO$r-uJ_EA<wfbE<*OoFa6h
zdSy0p%4}_WWgb1vDf4j4FY_d)%=U&~=5bybf6R||a>_iym=~`kFI6)hcB4G)z<dc?
zd`MXVAq6|}nJQJ`b|=^wNtC)k<Op9d9Mt$AX>gdTX>=LQrf|W<Zd}ijA@{uH4NHeA
ze_p6<W{5px)2(gdEn=Wb8KNSv9G^a)sZyOzNTSlI>YLZ8{v=a<>pImp88hAL53f~y
zCtZE}I@Px}($ybbtNM1j`p&hgKS@`Aytw-RJ>&X+gHKNU&uKL5Uag<sULW)I{~M1V
zZSSP@|HN5+)&Ktyp9iafS@B?PP5%f~it(U&To2Bp5VnT>SRz6-;bNrfbUDHcUy8=V
zK4+P9ESz)AFK_rM@G;oj{_0-v)xF@Wd%;)tg0JocU)>9qaWCi(kw38AZd6+|qIc~#
z=8ndF=EUfcN3CYNLA`G7u)X=47&&gQw494WP^^a3xrx9=A2}_VaW+s_*5=|lG-quR
zLPC2chCTQmD@z+g`&3B@mnp|puA#ijil~Y=xm}wj;o(+$%I&g!+grFKATJ3{H#}`~
zXbzeR(d%s`*v%l%%hcGP!I;9$bbG2VZnB{!ls7cd%Bv7cQjDiavx&u<pCBShH!bA+
z`Lw8fQ;M581##~a_g$xD{iJW?IU|vPm3`H*BH5u|gi`e&{A9*tz-toi*wHZg&4aM?
zl)U$G<!1vEI@8VtVO&sXXz|q?%q0^WTr_VrshFO)nF5L7ZC<-`I#Rj6YKJ``VAl4@
z&L&}Xz(B?VM4V>95q>;-?%d9!En0W1zm2@Br<w!Ic$lhv5D%BDiDmF>hM$(K*-O_%
z0>Ds%pcj3N{m5jds%rDOt$JvT@`j_~+ON@Ml<8RQ5;|++k=wIZTU!AN$R$D|;}GxW
z;po!ffQsYHt9u}HqYkY&2m5{Qy{`6pf@>ww^{QmRXtttkF6~~Vy4V@5H^=p)Ch=Hw
zo9g*qoS5L(Wgi<A0Rsu*aFvN6VH`KneIJ^w`c}ou(qU=z%1Q7`$4J5A@?@%}T>2PJ
z%5EqbRi>?aYQwxHIUfxW06F*@F9cO_?W^gjHox-<Z15Y2TtcwV8G407i_Mg0kPg|_
zjVyEMPK7<8Mq<94ikr-|OqrVI&6xVXwfP2XcwpzI6Mia!r?XG7mzpxT<>3)AgW;{p
zfH@*j>1;M(F+_EkH*kY__5LA;g)Rx;cou)NR_hDq0z1pU8T%iB!Ap~(d=3cy<`@lS
zHiL|%T;cZ0IyHpkLBx!iokonAWa^#BsX0oOLoQWAA!)ZwtyZLN+nKI;$0pb2HTC|V
z(3JK;4jfhj{r%Zee(@)3{~1k5D(Oz4b-pDl&;|CNj~_kWOzD4i9#QeH`kz1GQ<SFt
zMjwtk?%@xSszyAVeR{ALPA;KBao^sqiYTQW+GXv~Mi9IOCmLP^RpMWVxrH7ExhkZ>
zvQuj9O{B!^V<UKTWF0y_I#<CNo1gYna2>ERbY7oD99Iwqs>DGgkODeW<*>j3+o2i}
z4%U_bQ}I%L9S3xBNl;Qckd>yYv{L4-dQmtq#;7TM0=U5GL}GYW0<lk2&c3<?$HJ6;
zI5d>#%OvM}g-2TvJs18)JU=!KP0m@xWYjA3JYkd3XqZR<Sm<Sv2$>*9<2W+$4)qvS
z+`^I4nXz9hLyUXBJXa21W=cqHKbs7xW64S1Bi3!iojMUA(Mq14P3zZMg$gqzhKaMd
zUTpO$IS(cJtFrK9g-<+`G?!{}6G@r_g(SlINg{*Hq^;hjman!^${3Qx>#aACk(Ks@
zC0)qQKhzKRDq2CqP9sJ~<0xiwG!NXTr;9=DlscxeP#42Wgu|o5`r-Zwb;Np%b)_-L
zQOHzJX&NU@QN*NGQLk!gRSc_l7_qcEMe7ps^%PVosEVx@!N+PWSUDkD8l#D*7&XNH
z$<aYYYaoue9jba*lZF6!e}SOw5Y+>#D)fl<YSjic*F=4{Jkz{eCAbf)O5^q6X}fuJ
zda_%yDh>A;b0>Fvqh%_$e*W?sNH7Q+smw;wrp-jWRH=_)n{~AGSKJ)w3v2@NjiFIP
zrICMF2Jw%EAMp)|+9&F}dnDlZ8UH?mb`?L<4I?9&j3gP3iI<=Dxe@2P7e&GvVWSTH
z7(_#^Fr9SIC+b^oHpVw)03qMH<Ew0A?473C5>GV@brN2*<KagYkGRd+;+*H~P$+Me
zCMx(=mZ?{IQ~j}qG!oDNw(6}$t<3LB>OJw3htc#^bFbYFK7S7EQ-nCnd3-dEhB=S-
zNSYrF_Xk()wzW*obRBFGs*o@>r^JRvCXG`vn@qv<BnIFG{4rIJj~g|N2W3Sw_qtJk
zwcBp{{qHtvw0{nNG+joYrgWeyNqCizDV~gA#-l8qmGb1Dcd%9@^qsLqf<%-i@PFgV
z(S+U`Y&SvT9ndgH#v#c5$1om%F_sEklmjV}<UNGj<TqgTb=EXGWlT52*?^l4yLh8q
zsyXwSZHdaDiT10}Xdo(?=Xbt=d>$bw>2s23o5!u^cdW{iezp&Yni`XG`CWpEsj>KH
zyZyfe`2LK)8+a+W#6xy^)c$?rY5O7`mUK=bV>rf<GQUwCW?oMi8MczDDO-dDFP$6)
zw=*+2BNgL-6EEx#Q#HNPhaSmGG2)F~M8s<J66!YM16ui;aDth2Fi)MNw?3MjJs8J0
zducr$sHa+H+1l86vi4uIVf0{Q`{Cxpo%QqS#o&%k6pv9FVxyBNDMa(pO3&4lriscn
z_@)5UzR@=I@_c$RX2UWh7cS8c2<$@o08*MaO2DPz8{HLC5Y(X;uxtq=R{`u>r4N{T
zN~_irTrH<r13O+>2(!#;^2E#FEhE<OV^@25l59;sB~Mu41nmQ6P0jF>_URuAVdIL%
z*>6-g65vCCq381Li$FScAfR_0*z7<TM3DYK_o+R`F-!J%B>}#9&PjQNUyc*nhN~ta
zK;kT*XhQh6c+Kh_!pS7OT1UMH3~O<X=Am|BdQ*lR!;4musg`9;6cp65s)~5Wi>?Yd
z)2kgG9n=o!y*f`+iHZV5C9q8}7;Ip2@$uydxqXljXHtlqFcYR1!RwihO1dnL;?2-t
zWgH0&GrmKR)uFu>4mko5XJ3R(<7_A%T0IR5%%dcwU!<_BEVfw|Gi45J#EeXLdiKvf
z{AQ&1O=gFT@VYuHW;8_6vuh8gp2ONSi0|K*j%8m(|G>cH?6$=!!MzvvWNUq6(|Oac
zRW2`XwlsD%vC;;RQE?+~D^!|Rzd{H=Bvj7#XJT`z8hUY$n|;9k*xVe)sUOWIk`##J
z9Pn*}T0Knd8x<2^G$|%N+@`saQ7fmCFNFQbWH?apt01w=WrTXLH3)GL6@K8&QT28J
zXY5qlWyUf0)qGV|j!~sLS(j%Rv9rvoydj1;%Wa;ZO8GhK!<){iD+trTnePNIv3u_I
z0*N#5O&(4uBKJ)OmBje>PG$_2o>;=DC|@yML>@#YjL6kpvAlpLi}HXeu+TZretJ_3
z7f}}+4Ly7LLVn%78*nS}&*d}%>*pCvb&n0jk?OL7*Xc9k8}(YB5e$|BFz`gnT91!A
z1`<R;^B~xcN8=gvpg84OKf%Znl0=P*D4#v&8(W0+Faf=iQ~_`~D)7gU173kG`WQ_l
z%n^@y<7Xhmy@{yPCt@=SWraj8h}ZyIC7}%l(3^l!1F+6!;2Ai?7^|8ffUx#ts#^x8
z!LJo}n&t*?JeweUh%@G?WNRSOClMa(2$8BGkfc?bS3%PZDTSxfHK!b`AkRw_jUClZ
zlt`R4K4Uminu)z7SI}a%PAkJ65XI=HmEQIc9?N$04rj}cR+y!%cnDk3L<(EQawp7*
zzR)mpSQ2#(y^T~18@>gJ7)j!x2DO}|l8Z$_9s3wO?~C9r+J3L(EPOAszs?XIEhupx
z5&yZ9>U4@I?Q9uC{0GCAa~Sq%Ui3#+vLf*#+#nr%!kJT2R<RRJFOlzrXBMiq*h`xb
zQRRwZ-4IvCusO3rI8<4UBpb*DEfTbBgDa&eN@Vd%xVxWS5Wjh)n2nF)vOY7@mdrOI
z2&kaHeviTDQwYrJ<qK1i+QpOa?UVaj#5Kf22y8EyQ$`j=AJg@r<OER+(^xQ>PZG}V
zIka$+g=1D9gac4z_$1hZMBbxM<3Zdd!f=%bEHs`y<JHq8prA`yDCj3<hU$R}g~Boh
z3e4$I$=K`$qE*4!$j~Xh-(|0=RHd5!fSe>#{3{_C70T(<1uD%~U)hi;(uBR_B_mg2
zC=Pk1qteDG_<+v2EnlL=*(?Sc4k!0*iAef7gxl1ivY`%@vk{CVu82lF7YSZT=p=jR
z9Y_Vbj-0l>DN>6Vfo8ept;%G{P8=PJ>WbJFo|w`z<o4{UoXUAUB~AfIafU;=qp$zz
z$h?s3ko_4l?W7I`O}8(!9f06Y0n@EG7m?SP*w`^CPN<+7pY(E`pohGAzzI-dA;{0=
zfjSZJM?JxA;qB71^5^qA43TGd3@feJ5&rp1RkW`}jiDG3KJFAV=BYHQKPg?2tJhEu
zgRMu846NnkblDA8iPOKBR)Y2Qb<4VSX8reGV{nOOBN?y<;>iVFJ(D}VfpK6H{~fVP
z^Bb-149Cwsy$v6)14Oj+*5g|ZOaDmaL@*aqA#z%CS_;RN08hczihG+?Y0}^-N(2q~
zJI^j0b74`rmgJX-JER*aZe!)UWCccxLKC!K7Y4`vYX}WSt^70a7dLRwC-}{sC@ZaG
zQc88Ir_Ziq8jIEf0~L(k)MOson?PPGu7*laB&TIP8wCSZiC1XJ7T~R1wz9e%1XqyM
z<eJIRFW<vCQm-)HeIKapC16?An~h}0^?P=*y7-G1x;##?yYv?>O5f|@Wg7`tkX^lh
zU;P%z_BUsTF5HSfyDr<&v0E@IT0=5f1#e1ZmAqP;%^TWz-fq>J*nIUvR>dJU+dOH@
z&<KZo36*DTUeS2_EO`Ij_~+o>cgelK4IO;;G25+$mCCCn%j+ViTZ?9_DwV$L=|GvR
zjN#I@8Roq)vvN=>z)VLj)70$GzW7(4jQz)?*SXc;U;nYd{^Q}JjmH`PpY5H^ov-#E
zf5hj(oXj0tUtMdyy4HMkt@-L&^VPNHt82~8GI!W#gJ1jfK#9wZzwWc)H60MFJsQNF
z3Fw<^?6LA|JiZ9Wek&4+fGEO8|9OH)#upq`&su8`VLJCC^7XsJ=^z!P?<#qKH1bK#
zV_2_ep3<24T*$sbP-OpUI2nfzNT!`;3*$Z_`*a*mFpZbWS0+xx2%mFchl4@XlTZts
zMi^EH&;Xt6y|RuYk}Z2OnT@Bep)+xHClT)9cjX<`DY2|<Ueq8Xlr}3cT_(J4w=3=T
zkJWbd<aHC)8FPn&5lAd{Vg~48N##XGs!$t7yPP{9#QT-L^TxALG@d(<A68Kufk$5<
z`)6Ym_BaML-%=|vUmSU;m<>8U8p>crI-)VD>u<;=RB#vN4(QBR9vJ$O3@BIQkSf`X
zrgIBBmM({<Fm%zi-I-%FY9XQ6QhIz=I}rSavkNUk(OeQRLJYokJDe(`OA_2lC2`4y
z0vm!&C3si~w##L!zq-Ai|EU}mtiHrtUR)$+?>9HL5T#3dZAru(w(0kk7F4#PuHNZu
zxnizCR_YqxW!++ncD$(lK2!?d4F<D{O+Fj)imrE`kp#E)GFY+Am1e^vK7$F832t51
z&IluJvOQpYYO~~5(Q{Wp&s`;sfI+`-XL29<2WK{G_^qJE+8foB(dHO;if{d~xc5Pl
zM4d0tv~4d3(ET(OuR>xW=#VfOger3BO6<@$JPVbh3xm)LYmYbpBTg(tC)cYZoO+V>
zn+4aB+)GEF;;EmYTZY*fos}Amwy7zKCd@dU@7c?`iHW)!u6ULSag}o0qc?Iiflg+M
zTZVHQ=%8p`{_f?0*>U;fND-2v(WoWCMF>X2xeJ&tCkFOIC78^Hc9cPh@1g*<La5QX
zd&q1{9@HEy35S#U=gLYYJJjD?Fw-#F+<BV{wpr`4RpGlCC(p1m^Ym6v&wI!d8zAz$
zntH`3O<A0f!v=7uFb?S{7bA*0<@I1+8MJ7?GE|vvdEm$dSYKjr?(q|p`1(o@*iABl
zv6t=Op&vt9ljX2}*~y3iBDu;cV&b8s(qSajN>N(AYh;?Hv!$%h-%WSsjH#uv0r2H1
z7g0(qgS(o7D!Zcf71a%<UD}k)!rG=%83$5bP7QSuUY1ByqLZN4sRVqMtd70db53Gl
zba?k}K;<Q^6zYsCT!^z$q~>OV{HvdQV$e|3DcuY|Mo6CR^lvCSZyNA)x_g}*$Q?G-
zxQjBCO_Mwsn~4x)1&>$s0V9i7Q8&aSGjrr`j+kXS1S@u?1bF6>%mEb3r72%SGdDuQ
zDkl?D>8F|VR5yr&WF#VJIACWEez!sg&j)=O+gls;*Lcx*<ouL`MiQUY1J0MuKHS9l
zY8yzJDrV+EOG73LGn=}e%5pLW7gU){DK31a`frwZ)fe#o%m+P=tOw<2BCgqv!hk^D
zK04k#+N-r?X2=7=e(z)GVb+7g=rTYEGOeT$#evvdiG@>PGwp+>+mbfn$|NB=A6;_%
zzo|r=SILG#T(!pHN(uWb&lwa<rrz@0sLGBDCV2uPghucS`2RX`xZbktM{QUm6L3(7
zmr?om>Xn2SXnG}$e?KD9<uBpGt;+WN6)Z_dWp2dZYzNk%-|OGY4&n@EXB&gr*@nHH
z`dJQCI+%;-ViJAa*^c|2sC1X!m6=^{P9=_zADzxn-ojnHvt4;o_7KnPKdcG%tn~&}
z*uk`KJ*ZFNZy<}Muu9$7vc8hab)s&_{!TN*H=53dY#&n5hN*&nkAf1)>K2}sD_)vI
zc0Cf&2pB`sYea_<hnJj=9`LZdDYJQ>9%Le$<3n_nz=%%yXhomKF&z{NJwanS?2LrX
zWQ<`<>^>$8e#}3THmA`Arywk;IjX#tXjlNIG9F5FN6s?`Hd)dZ^y5#~!ixR_m#Mb|
z@Z4MDvfWfM_$aO|Xs&Fn^s?x!U6HJlO3;*%5E?0+C(KKRP$1B;qzuc^kTYR5J!p8<
zfj1kUO=N@85M|l)dObq-S321b<1(&!pjVXu5|SnIJc@arjxL8x#mow=2d@+a8Fz48
zTr%4_WuchoYOz6RBE~z6E;X8&dCO8MLP?`=Un;XGO-_3wEdY$eWXcc=O&-n+DExWk
zOv2_WLheo>jo!Fr113SEadh|^x9Z-iYDD03jQtsfUMdRDb}E$|stB-UiK0tc8Q+Dd
zDr@LMLg^$~6IxkJwiIon(dSUDA`;4^#wVc$8qZx;2S9oGf+zt9+pY;1FddCqFpE^w
zfXoCm6I4JVcNOi3z1^*x{bixC2Cr&qs#&sPE>BO0B?x=M7UDyki9Hq1M(=Qhu7E8g
z$8c4sCQq6F2`2^@*>?lzB#a6*#_K~2!8*r_(`WLkc>bvShrHNvyuqX^W`F=D-Jr|T
zVCao#=<<Jh{T#;A=Wk#TvZb^Tsnn#7>@C53OPk++zf(>LL+F%FlN~^WH5bl`p>YYi
zNiXhheA?eHf5xfM-g$-F@Iy4`r>#n#WH2<?oR{m$N!_`bk>l*JH@6GMy}3Pq;ArFJ
z%O_=b^qbpx!$%zstE=a_cxGEm&TK1xW-o%%`eBP$9NKC5vwOHTcXpV}!!4Q27p{X1
zeiRKKBHsJ?lxTWMY((a@e3vUIE^LWKzQ0{8`)XXAzov|U+qW`n(bQq8vz_fFC#$IC
zGE;q$m)gwi&fo4hB3hPS)rA6z%FaZePB?=%5te~|6l#e>`?<TML~(7bEU-;*Oq)?~
zZ<QX6rxVGas?T=CDEj?MCd&>es}|@Sng}^kSr>DELu#5%D47r^6SSRfnk!mUUnvt}
zBRbI!J2rKOyCk=ExSJxoF*DKY=ehJ3#MhBRb-#u^XytJPBtcpI#YQkP$qLg#D1rIa
z)k)M(ox>IY4jEUIT1?8>%$8+OL&HsbWvA`H<Z4YH>=yU4q7hmKag;4Z#BO(^{PN|F
zZAc2d(7^t&+DOqSm26T@jnv_o$}CzmZfDadu)tbVkLclkhGx2hQU}nyQBj-TSgzlR
zJ}2^fu_sSv%Bgj@zgf5v{=iBlXK3Z`zkgExET>Xtn3@>+XF&cy?IGd~)TQ{(3y04X
zuSmr9M?aj7&fOEEaJV~j;kuI#SC<u9Fx)gdTRdE!>SvCmyemd0c2f|noDM$>A$BM-
zX?DVQJw=ifg(#I*Dy+Us>pOL7-b0o-h)$D;V6*djC&xxw5yfh>G!-hd=B*d2)Tx@B
ziH9=m>UCCZPjw)d&Cqk64a0#BC&uzpM>m3}SUy_0+6mh&lq4Wrth9*J(MX(|Ai}es
z01KRBcucU^i6A1wD<!EySD^fk<epa)(q^3<;1y9;Lq|Q_aAg*sKvN5rD&N(5TIVFU
z)5}%Va?mx@7I>~OKv!VbITI`RMC(oE5;?{lf|WCp*%-(~)Q>%U5((cjF(<#=+3SPf
zoJi{2ff4?dDw~+=@-y5TsUv&h2jsNpsh8-(_3o#&U7;3N%$Y1sV0``?Zowo!cQT)E
z_%G~<DDbJv$gG5>Wo7@wTcy5TeYzkh$(U>4`5%{|T$g9WE6XE4JvG%=e7-%Yz}0`&
zTmtdePo8_lnZ@TuQ%t^E>nyMCk81N#c3AZ6`s3Q%S#n@_DTx>Ot&wIjLw`7L=#I2Z
zBYwD<nnmXI^(UmYw6`!Jlz8Zt*xbo0vh5bx+AaXgqay0=rK11MxiLvZ8^<`jrgx{h
z-Y{x?Wm<<Id@ldP8;Y-6)-`Xb_lW|xIH)5De0Ma_+B@FygYeA8jiAl+IvPfkxQih*
zd1D^&7~nDQvbpQV2Xj@CJhlH+ai4su;mHr(rHYZ`v!^I99>6^Gg%k|#3WYqX?zN8_
z)%u}jRuckRPO0Wz)0PoP<`p9hdY;1(%NolYkCZq>UQNg0R(aFA$eU&os7i(*lQ0mv
z26X|<a>i1Y9gx{!`Q2~sxc%dJ+T0=dek^8OFs7~fV`A4O4B~T1wig)0%$QYQ<&R4a
z_2E`}sLT{D7;2g$TxO{9eT%*mc;v@J`a%0PZxR?qY7+AqGsBC4pV7y#zcs(>tyB~g
zvW%E9v6{z<0T!|)K7R(zXS|xh>9Y2;**a-A>wm5NTnSdk4lu=12x_LmmYlZi)uc>n
z=xez`KuGB!^uDy*tH%Yy?@vbcm*7_w%7eL^XBgu!x`b0GZN>KC5fVgJd_{-y4jQw_
z=)Y2+8Ry|r%DP3znjyGNBbQq36Q9`_!LDO?wm+Ku2pU+jQ!FCO(vYHHN3Z@10LA@3
zO$eMTC;|TGmdZW}m);e@wpv~ow5)7Be7d<3tgLNrZ1@SbReYqOy0~T5R2;EKeIeY5
zC_3N>+>fWi%mz;?!R8K(w3U>lNQR>HoQ~S)9HO4XA@b!#0)?0KY+0z*<Vw-+n!;Wc
zvL$it5a#hxDYi?Xqf7M&f!G7={X=LQ_?=Pc$FNVomjue%F%nC3CflsomwAP(g_7{l
zYJ12Fc0Zkt27?lf^{(z~bE9lk3-S=m#JA$?RZbnm{=Rs)RpF+~cBG0wR{g81N8AyH
zm;fT}go=;VwhD2Nm|}!*5F}d_9TiU$uX87>d105SS99gyz$zR7?N>|$Tbd{Ww$jB|
zHZ*S~cXF;ok>QkuKgJr0b&54hVO8F*{a1rgCu5l+Iqg(gZGGGZc6ef{^HF8BuXVfl
zV&Q745J!)NP|neAZrBCc!>zCGJ?ecMG$MeOkvoQ^2wOC1=<z*EF(cXd>%K*n5_-xg
zVbKB|;6`|3Z%&SN!M@F?YzB&W#tyfj8#Grf)Se5sTWiz<@Ru~|O`X^Ki^iMLLf_GK
zp1JR#GRZ|lj}I*}RPrg6#xEC5nSc@LHOH9XGd;0r^%k7-KW4bP57AJVK+8OvD91(D
z*xuaQi^|~=#zHC>k8^}V(AiFt8ySS0sB6w8X$c3z3v--GvHJ?^*z7RXke(Ns`nBKI
z!viJMv(-~}$f2#p?36tQf8}^UR6ctg8;Ql+opx)ci3S#kd$*vsgGl$2cTM5kQn+po
zNW!4#tZP`do+I?IEl{4^bB|?#d+Qu$&qy>j9{plT$h~UzgrH(<{X-=mS2<NdAgf`X
zsI%HNvFPk!E!?m?wTRgr=v6lQF`5*kWLY!!qQuH!&$)#!ZUBS*bvn6Ho1<$ek!%c$
z#nyz=xBmW1U`;xo1)iaG{_1ICBNh0Db*zKIOlZMMCD-`9>oc?3>0j?2O=qeqmJY`}
zn?ip%&C2Gpp^No|H0v&LVO(+NEi31MXpWXy$`Tq;>3O`ml|a4))BCRi<t2bTM}*Of
z&`@SPE^$feGugM+ECa|p)`r*1TMSoL?N++h95*#M9u-mQUSw#s6bHvCR=mR5l^02#
z^`Y1W<r2r0Inc2Lxa+z~6iJwBGqM6C7nK&sPL9-d$DH`Ke;=DuCy}koLGujiK^*g5
zdlbXk<XEO$Dbk3q=2#Q&!PNY$xkRJ>R;Bo2!D^)^*_=~GQ>SE*%LozJjC7?WHFImt
zVjwaR`K%3bSh5kW$<!#lmZ9nknPrmhvf7C(pR(zxU$Ym*kAC(w1SJ`Sko6o1l10eX
zGD{^8^od-*^cfDbeR7N_r15!n56;TF;IL@^n+Jikx8xcJ{+t9`8;ZMQ;cPb4){17=
zBU6c%;=;@aMyAP!c%0(>6jg-th}-GiyDYc8q+VS>_$-vqLJ&NXl#YZ0pUi=bynpE^
z%N*G7wWr?HGuAb1sHmoFOWO_MuF-MHVny&;N8h>(udIqngILUtY0e$mCl@X#@?;fH
zj!4ZQB}2Gan!=wv+({}6(8g`vAWgBojHM+h6$hw^a=~{@X*9u^7#gykv-P!ds+ttA
zi>bbftv4PTOS~c~;FAnliabRCcBrc}>E-~uz<Au*uLY-sxyBURp@~C*@G)bvnixer
zQVJPeLAF<wkaIHCWBopOxRu%@d8nrbx-5ze^II&M|23PPi+2rm+3p_}WwEsn)t$CJ
zw8WGu57`P(Y(h0j{O$ar7noDkL7L(4d`2fF9VjC!rK=)Z7oO3HT~S7}nmjru=m3}g
zsdLBCZ3C86dhMk-kO*$z8)}EUNAStVML|C5&D%gUF}_wTbKBtl3J}soptrP(>m&k}
zz(7=}CN#c+u07Q-z?7AWvj;iUFsf%X0>;{mB&9M|eo{V%BB{29#-7}l3RvRP;Z}^;
zcX)JIgIk`wE<Y3dbk&Gnz1dK&fLE8G{Y<kzMttUri#Uy96~*J|I3M<7k-}qpa7>7D
zgoSL0*_czi-;cYoB)}7|d{}eSRGc7kX*Ur6W1S7oW+CSc(u#8pd!EfOAQ?v!We*B0
zUO&^vVyNVBt&BBsPgzT^wKL`HI09qPC@#eA{uB-WkVW?xieP^PG&0-2JJ8}Lb3F|>
z{fKKPamUk96zMdssi#=tR`s?oa*Yv9N|Rv^%0bE*KBa58YfX53o?@Q%!4%Bc|1b@q
zMeUxKQsNqW&ARu(&kA2{?i9a!xMkn@Bq!&#T{x<WESy@e=lM+&8$7S!JodAo*<RES
zXM<^~wMEyY3awMOq$KgLq?lZ1Z2ncR$K218T?OswaCYx1ef@}BS1!<k=zhNCs~2B<
zxtSiMU>`2hg<K0jdejRpa`iS4r((~R*HL3+Www;Wu0JBVTV7IsJPF<aPf7CG;tS@b
zUQ@jyt%NW)ViW*c^%tC8yP2Ef^nwS^GJ|wJrU`T6=eLqVo6)}|(xfqBBwS4)QV`2H
zIf?qau){2kZnT~wheMJTR8%SVu*&+S7angke2-nyK^)TkD5mc=yCa(G^k${W-e?9z
z0}D3m!5;sTkb01{dsa?DK)9$Mf5LV16_^8k_Tlh<!WICU$rk&tEA76m>?uc@y>s<g
z*2~^+;vD@d22PnEAOZEHC)S&)2S47OWL<PK0R~%-9zK&m=jzg29&SGi?&G#aem!~?
ztf^m~Lz)0XtTrrXVgXhx4R3Be$qkPqNBA%titUDjxyHqZMr<*2P~aW*ZJe+JNR(;E
ztKl__q9mKre)$XLOeYS(Aw{-0!PnlaM*E<8*lO?9U&Da%(H0v_mW*p8Z@W*A`~HVe
z%N4VYQH7ZIjl|1E7;|J35d#z9%ZV|VO5g?dHPxS0%T;kwYR;djBW*BWZMiOLTUpOb
z+;pdr>Odl|XRA*+VG5oT>mDNqu?dQZEkG26Lt;%Lw>h=`Ku|*DZp`|$?+Hri-R;<|
zbjm6|7AbfLW9b75Tjaxt`*tTXlsH6=((g__YU>SYi$}yTQ{tEh1<w6~YsjGvpl~_T
zh0&qg62~}45(bIxNRxqc)fl-Vs3jy#XPvZobc^BrbRv4@S>m;%w=G9YV#g+J!mT51
zT+F)XbVSfX`yqYQtS^{DU)z4P@$k{pr#oAZA3omLe)@>5(n?$ZLpZp$nO80RMAcHY
zcDUA>R7*RkU>CgP?!*X~mJW@mA1`1JENz!v!(iTKK9`ZFBD%lnTC=TfR#HvaZ7C`F
zBy5-4stGtXr_q(~);AxYt)z_Q%tlxCIc@{xG)a-d_cdin9Vi*4lAPUgZtQcoF6&_y
zc3>``)+6EAq4BTsO0KeVsA)OnNH&+!t~#XFdW${U`8n@0IpqeC_KzuYM#_p%EUfU^
zpzfki+K16ueb|4VHhz$T+fKpbQBqv+q1$3OOqa??GkM-^4)c?v-vfMby<|d)yG<oX
z=b^&MuY5NkG~%P|+ZXw|!hB0{<!P>02sS8?sh&XJe8!yVq@w6lz4rLgwu*R56xupG
zN?I(@1HDzrq<n&;i3+RnE|Gu7I(4KXY>c#f#vPTNLsa7&@nsA{b#o!Wnk|*L0}4i5
zyqSQ;YWj}*BU{5Exsu{uG=dvL$9(Td0O%FZd08gH4-t^LQ_NU`;i6WN1!V{78S$H?
z!F1DWBVPQ4!z}AC4UU<8VR)U9b&N^7hb{pCcW<W=-I?L4usOLH?*T3Yw~ag{cHWfX
zI)?Ld5ZPlre?|Af%%tZd98P9EA8vi|dODtNHyO9BH)q_pwhU^%#mmq%7kD;g7WS6<
zxiVTw16_ofRCF*UR~!2}Cf`AcWJ5Pn7*kwp1n?|P)h2G_F(oXu-W}Ie`SNqWl}5eU
z^6Bzu&b`5ZpVoJOKoy^DSkyIYICWDTgU2ec%zhjW<E~Y0alB4Frj_&znzd_8pnlk*
z^4A+ZRnYbPkuU7+&Gmb_HgJ+?4s8B<E#UmMetiA4MHi;#HR03z;l@2~T^~^5t2q~5
zZ>r5Vzcakh#ZBRLU3@}c*M<`bf#-8}TkE7&J-8Otq4G=tj;p&rG}G-J9POPpYRk7L
z<<0VEILq8AIdoZ1$P*8g({{*8?aNSnqlsb*c|T3eVa4Mqn>bZrfH9@xFyi!b!cN2{
zSew54gYHI0^5>{!I&hy-I<|D&1?RZSIWgQ@BR?*p3VYzkRip|<7wD{hp#t^9>4p!T
zr2{FRM}sl3wbsj7^OOk(G#!F32Cp`nje}!wxCG%EvL;Z02Iza~xYpo%Kh~J|G4No3
zd~X<bKP308clI<I3=-e98Y%}UM#hLnrh>hld$B_jCEBsa2~=oZV8|fqokhremn7j?
z#CaF7YF<Ok%cEL-FL`EE2eTyV&jvaKpGlf`HW+nC97@l-*5IHn9><O1hqN<P=(NE=
zWlDy!Ll-kj$5Gd5l|$aw8mw`Vw6(pS8legXs-xo}ApGDX3mGO(u^J*ZpzfW=@SLKe
zeUfkx20*Psg7g>0slUJmA__04A(xj4KLxAfXdsuKymW@IS!7aoD4swZRZ9>=xqML<
z>x+z^sN*KJU!uOt%UVI{j+u{xpCEU9WdoFjpXyTtx<#D!__==8<nY>eCvgRx*~d}z
zfuFAY&kAd&E81U*^MsbD$YJz}E2e{BaaL2vCxl}ha3Z`E14lxQ&8;UKP|XRdCfZ+)
z{QbexTyd<xFcp_N>><h@QZ#>vt}-!Ba&2!W@j8{&oU#O!sP8#&^=~N{CZjRWEcc4S
z6~gTWMc!)YVR@KiXgm)Dn<iLA0gOCehk>2nYZ^x~k@jecsK55I7Y$-MHm=$TDp@qW
z`BN;Ira#r3>CPLlM(WfcIUL8IH%d1TxUpR{qz;L3o=Kv2`*y4-KH;@L92GGGd(O0A
zL&nQ*+V(osJCiZ*ZMr#DpsOI7NRHv+xxU=a2T_rMq9)Z|w~30~&6t>`^X>_@9=zd`
zk%NQib4ni*s=9<(#gXl)8ey{oA`V!aH0X*}%emyk=^~nj;z0;tvBfQeE(2j9;yE;Y
zSI^F&<TA$H*THJ{>;@#<0xTZtaK$dLmL}-kv$dC|u`eL)9uO2J%%|>t&tFXE6A#n`
zR{hPPV&0{byR!=EcGgx-5pVh9I~V@0WE=V&`1U0T@SE9#%g|&Ek+qj-V=hg;{ju+Q
zWJkM{W1}&XR-z#V1I&*T;UFWtR-;-YI{jJIHg;^GW=+D&l{B4F1amMNeVC0E6X&**
zrinsm93D<Q-I3Ed#m4C*X|^rXh_I6`SCzLy4twXV4Y<3F-*;W?%jL<nSOBDr`IH_!
z6$fx=$dq^~=-yNM?-ajVWbLcJ(00oZN|47~VyQ%a9m&Hg_VOc$Dhn?`rTL5I+f0nE
zZ9VO&B;4__<|21=tf<Q!+j2_96cYVo7I!~zo2&o8-I7?zJkKw42uq~Zq1aCTW3cw}
zJPLcx*3N^HK4VaPk%4&*n7nsF^oOZ18g9?tQ0vLAaRHH9dDZZ-p#ie296mYW0ssNs
z+3RT9__fbnRD!!`CWj@=1&-ryoN-jIpgp3`zb=GX0qoMRGgfBvhUOo1GL&Bjw?C%L
z6NO&V(U4B}A{IJ#I?F4!ZDYmT5X$0w8WG)K6TZppzFyp=jVD>K^L8HI8^&q17gI4j
zB7D<NOGv(*tpv5t71fBA+?}YyEFhYjC-$J=NrcD(kr_howj`jO&0b<;K(EZ`^}y$S
zn{}GjADCj(=q#Lmh_0xKobk=a_mXEFuv(@zwLb)XO`CM+k3cQ+Du2T*4aqss#3yG5
z6>quUGMF-V2)`|-Ggmh^>8+?dKMBSptr22@)B)j2@^iI3(k?D@aWv(gqRcq2dyu52
zv;@`2yT!0DEG8O%Ev6dwdgR)~LtkeU1Nql@3_@q1oI>G05!g%LQKcsLD<HM{Yf?ZR
ze}&(w@Gie541t8ssARAt&7+dclAKM?zlbYQN=2=QF@uW4EHJTQW5tXjnHs$>Ecv5k
z>hIvypajkGJs8c!A7RKUF=IIZxNeh;5|xh{Teq5+rRm1>c*<I%et`tdDjq6dv2dod
zggs_-KR9<)Jo9vWY6v0;Df^mE<jiNniEF~18w)}YBHftVNPKZY5(OvLfr@q<sNCIP
zGAl6g(JK0Q2(LF!3Y6B4O0<HG!_iS`Fghz8mi@eK9_k27`|FUghwxz<#sh!p`5X#L
zRAkP%Gk+W9lJxZc{B=k>#2z#1r#+09JXUV&q{y39j$sb=5sftIjwVs@P!|kr!7yZX
zs27AQy9_72FXss7TvXd8i%C3R`sR{&zS;f1P28_b-SgSr1#Ioe^?r5h-I%j2;hTZf
zzd4WFkE20v2`(39b(}#}mNu@G{X&+Qhfo+aFHmHROI@3Y{VBZh^+6zk2Nr=qeE<I~
zKyWkhU<rDgYw%)woFjp=ZA+Tg@&)es=#sdC;T4PbV_ah59_O4R*yP>G`pH}6T4*(o
zx8#fU33~_-LrGukt3@{`^tbrlBnSB3tjsN#PK9SDmVe0{CgvL2!NOHBY|yH29GVrS
z`_}3GBz+g(z_SeiE^TyYZbQ?NVz%HMZ-a%-fotAPk9uxzdjKW>RpC7kK8gb?y6nLx
z6?bSbF1oMQN9tHIdc&J^{0iSngK=te-O|;Mnf)JjrR@)NFs|s?{y9VZ%|`;$M}~WH
zLev5&wW#CZzU*3d>gt9=&Z*lWj@`QsVj+iUR!m~VKs*XWu0gE2i?BNxv2HQZnFrxV
z#<|3MV!m!$vSW!ki==W0WGOD#Jw6Q{s6fP1+6>XC-=BNOqe(@wl+alKOBYmpLneE;
zzPEJORH+^J)-RHqbiYKyN%W7K62MmG_ASv_HsVRp9mGcRWmhxpS;08rVF1VKM_emI
zQ4yc~D(_l+0TRk6{F6gnH_a~ET{TEPC-jfM1o|+r58<c3u^5a_n>T_XTk|+=q_(+t
z#`yLizMX)#Up3KoX7fB#YA*f8Xa0S?fvsZ*k$YF4w_0*fo4L6!0`?b>aRZY=I>{xz
zfEml1DBtv_c6ia`G$z5GB5$kz8FRYHm^~`;ud)yp<BUzfQj3zh-9M9i{mp;j33?`2
ze4yqNh~n8gW==fke;pL`3+MN{NGcHv`Fst~#i%zML~GjkTt`T7AjgIi2VAUv6vQLj
zuhjif)JGQ|b7T`K0poEhfNR5xk1{m>C}k5<$+#soR#ZfPlE)`OsADqlDJf>mEFY+3
z*C`R8tL2eNe0DxnLkM~^Hj_|dhR=Tt**agmRa3kCV!HM+?v?$+P!}#d@ubiCFrL<r
z2(_j-MB))ORzaJv25}l3tqX5YYcCCF*o>isedkG~*DDn-^?p!0+9$qo@*(Abj)_p`
zZ7BXrcQF`RiFBO5A}GMuLb+KS9q%6P)!Nj{JfQdt|7cyDD!qse8P}7!fZ&i4qxJ6e
zQ+i7ZK=w(pvykR;soNJ0eUo{W35sF{`xh7nJ%cAPb5LbHyyxy_vqQO&mr2@GNx9}a
z(L@{{LcV-peSyxmKtPe`B`_w_t_{9Pk{dpKcQ%<2qL82=kqwa0ZxSO4`v^e}P4arx
zwOFWu5mjEuI=s6QsS&$nJ*cbPD>L{4C|`yyODf7+k+XG3L<HKtgP95C?we34cNWID
zg~n4R<d`#4i6-c5t~oIW;aLuy<(du|pw?rMu^OZ1)<h#Y4&#Yf{{_*fF>)5bO0S~W
zcW`BjcB&|Gd49zDoiZiUaYLwbaEX*F-RX?Ie`HlRi&F4mY(GR-On8rJSQ*1J9*um3
zU#k;3Lx#@wla8+t`WsAUkPIY3(na`5oX6Ya(ID<#1$Tpk>Q4u?gQJso?fpjeb-QtL
z`rNPIzh3?Q)08bPUl>}*x>mq;)N0kTQE4;2VVY3=bX-5Fwdx18_Ca%=l;X6LXMySh
zF29lAveO|T+5By~69w#aQZCLQ5cdW$%@;wG&=(WryG}27EUDB{y8Hv8ts5H~?6h{u
z0a0Z9?2;4>N3*kYWiZeAHn7Q)MDzjc>D;!(z^w0qjaUkX`smOjybjd%i=fueK<x<u
z&CQ^Tj|mY%4edqUNp;v0!kPk}+=O>cIAL|+Og}$`oLUtzWtiqa6FNMWkh((-_xZ$S
zI}nkFeK4&4hN&XJO^si1GS|^rNaX(ff=+FTPZ?~iAw&_!2=Ze29FF+3H>UpV9>`i`
zzF`grAB~l;_A?_g3qAm<Pq(E|d(DeUv8!qAjUsV84EudPrMv+nkWDu2aWQJ_pVa<)
z3Dj6VdwUu&Qe@W42at847mxmV-i<|Ov3%Sttmaezg)OM0XRsFy!YjjJ^z|<61ts?T
zh&XIf*+X|5&>WIJu)p0yE0(qDMV;9hw>+n`pA=}*Ki!5w_4FsXoXfLnuFgK~<6R~x
z6|aISOW!%|iM-*{M!oq6>xyCe=%$fW)cNh?H3#=-PxL(eqLCIVnFb;`(bJ+9eJu*c
zFXO(oCNXg};boi5@*Hm`;h0@!aT}3ZgEBa_p6p;6`vdUWicym!bV|1@f$EsPs0c~r
zd235kp#Pi|mKzCPVUwaJ8;j3J4+T=yANGQT(~#d@oDX-3PI-<~Ct+|{a4o^*!43Jv
zG;+~Q>ceUNOuYE+nIKDkHb=|Vd`t&PFHYll4alI8k8Y$X#cB4VOYOUEw`C$LnGHmx
zy`j$#6cOQ))BGX0T|JH@6>*rpsG!46VS1m$E>k#x+~4jXy)|b_m7p!O%~u)2pCH2C
z&NhiiIxR3Ng`<9Z42?>M&00&kD~U7=&ac_79__b}aZmaR+{Cw@0B1m$znfUK*Hf@i
z^S9GYrbyv)DM71c_F$SN6^b9~ya35*{wqAIHKLX)m6O_Dy@{Zo&HB;d5;Q-JX|_24
zX{BNTcEiTHIHXr9__t(}HC?|QP>MC;zgH?Me0Cd8+QN~Sa$D8#e?#2OfXxFrOu7o-
z$E=7(wIG~*Qmf+w-J;J@fEy3iM1j86>k#mgc<m(~w&h{F*YULoOL3j~D^5Mdy_JeS
zCFytE`?ALUX^i@P;=D`;7cA_yc{1{9na+M&W@Tx6t?BKxQgJt15vq76f7(r-Swm6n
zQEw?Kft^-KY4Dun1qJ#;AcwC*%-0|0Dc#JuA2<iU(mUb&caVRc25!FgO+|<0mWnh^
zx1^H1zB+O#HRM77%$t|hB;LaU-*d*#j0CK0<DO3IX~q{aT|TWJwv-s8XNZGb8#+qL
zMmnZC@gSbkxy$#MBvm1<e}5W@i}OJ%7)DV~r*hQcc6EaibyqrB2$!s45<~nFIL+$~
z0K1JfxCNCi5Q4UvRp&ZmyNMRJSc99@-g=tb!g=OvY?sj1=4fhvb6e!m*zx7lJFBe~
zChK@Y9d{*~<LqLrZ{u-a+d<$VFJMoQsNe*#wSAYx5$;-CNs$HuD$!vySa+3ryX~VN
zih>93wreLR9MZ<VXN7`mB0vn!m{W;PjA@mAWb;j5#0jf;wERzXO<sybhkAUgnI#iv
zKu00sfk;$<esGU#-P3`HSVyWO6q%5>BYfka*iLaM92A6%FEhOzj#T&=v*~GUoFyAI
z)2!-AJW3rstI8X9Ic7D-KG#M*PZ{Cj5i|Z5;aS{$zqz5qt7;8g_d_zfPzq!@ES0}O
z)bkTO{i38gNEHyeS^Z;+IMIq}yzSYz2QIa(lzSV_NLI%%23U?+{!6ez4`>ycdaMxh
z9js8%6=%=6snB33MALCLORux`QpVEeS8TR0QlZsP`NgiPrGTI#^)kS;_`^TSl@(^8
zzuVX*?h4dJ^U@xd>ZyFBm8Yqs#$Lw8d;tc=4;mAA?H4v6EJwnO4f7NjtK}xzuWI{8
zC$%<>JFhWr4ToFl7hbR6m*9J?-R^aU1fJlR`}h5nNkkR)I)rB(s|fFP?*C#*n>bLi
zB{Z!Ae)){1vHtGq@RQvU0!`}-@6v`fj&6p1$JVu6bg9~`HEO%90QreTg}J<1PpamF
zD5nX1)cjHi(#+saY7o2a;5?<H*_ODuB*0YE4MD=c9H7W+1sMUMg0LIy&Z(O&s@|n9
zHH#r5<Gwaz)JU&c%N_Y5&<a8*Z8n5t0yXD=;k!Jsz;i%+ZKHk|=@Y?AIJwC@i+;X<
zV*LxJ21y(AyG7F%RB3Ms;^muQhq|7+R_XDQjOT^AMtXs3%^H6%A^5C+@ty*;f1##|
zS4Il-bAhgL+T_y$D}i)c!gO$U34Opr>1ruB<g1SvAGomFon6cZoCT{F_xs|KM=fxW
zJLJxekr$HfjHMw-U6pRf<dHa64xQrgM#B3L3BxdejE#(f$lP-%xO>;{Do`hjIVzR8
z@=JSo-bVvef3Lk)-`|H1Ztdj9YNP$?U8~mg<>Rc$je7*=b(FQSA<-D2efJ1@`vkmW
zhFvMO`oCqCP)<MvV9rx6yJk~erv;^OOnraio4LVNc|8qsH+zQ!kA(b(<+(^$uT$n=
zBd}(Sd7lzf26K15-A^}Wa-<6usG)3ZZS(%iTe*_qMDE|G)uXZx^V7%RV>jJ!bP3xW
zHNt!wIFwn-VP;;+&0~?J6j<q9fRnG^ci+?-d$jobM-sbp_w?kXcG%)470X6d0_KT|
z!cycgR5ZFphE|T_op&J5^%=3;B<nmz&aE7RolT^!$<Syb$(Vg*ud(WVot^_%dD=Ua
zwNYJ>^jtNsvhk?cfRlm~ER1v~@t9au!lFpWh<xURs6qV6<L0}=UB!SS_)h}MSjIF6
z-;RDlX)HLlrR=HzUMe-(oXs~?&y~X&Dn$Ol=*)WXBFzTdc(9oYRy~+y^n=Jh;lyr`
zWK6TLEfY#SBin-T5t%x6t*(8NiG@UG)Vo@6JmqNRL?1^3S*bj%pb0MvrFl^7N0oE%
z{|R_`4Su=0Pb7OTyNtB6bhi0S<|6xyqy2g9?VjxJYzJD9StsVkgfK<o7PPKkvhr!B
zlqPig()Iyj_bM)u>dS8)A-t-^v0NyviAP7EGk`K;63!h*F!D1Qh@9ofAn}M<T;U}6
zZRLrVrQR;RQdvN6Koh?-dE43Yg_RvjAcj>4glpRk;lzAgF>RB$??vaO|3pM5K0vPI
zU_oF7^0HtQ{Ne#n2}<1KoC~6{gE-Ho5JYwQeK=Q%9>Cm4F&6}7i$v>{TGX%3sQUlW
z(m(rtTjv9x4bNtXw#!+EqE9NW)yuz4{x&q)3@|)Q0Hw!R7SA+ct1+b=4(TlEnn(j`
z1U3~HGNx)q0_vD<6o1rYc^qDGuz@aT0HXt)=;u&fzsB%m=_UG}Rr12Hj&o=l<lB?J
zwoaaMzSWG@16FASgoAMMp+Esrr1D_J0SV&J3clxDlf+#eR8M};cbFo(gXTB+DyL)^
zxs%#)qrO{hSvj4U<P)0Q=;BTEX_p#KN~+~brez1i)0nwYfcz`G&MTEi1=yddP~7>F
z4XglXRw`Tb$~&4Tbji>*AmW^LTFJm$=k`a9kP&KWHq(36(g7<f`_!9#W2QzEHyYCJ
zq#?02j|#H^)m-Pw-_qbky)#)Bk4|O1j6BplYU7M|V-9UGMqH5Rg@swyX04)gw6XSB
zQCgf>rX<=i#QO#_xL`9(FUBb8WK816-OJwlgX&Mm)z+Iv?eJ$lEtMT?a5<WAkd9tF
zq5VERm$0Zjbrtv9GBEpf5_?wrV^6n;JxhbKIzeYI_{uXix(bc1vNDY>#%tg8prTu;
z1PCw0Nyf)<ucWh9b4UHrm{<v2b>(u!*?r&k$6gj(1{F<qEJ81RE7AWIJ9US5u=y};
z{!8C2d}UvfTw(y4BAOi8-z6BcYK3?x!Z|?jyQCbf_^q&!2jk2$dcETJVb;}q%2W7@
z{CO6v%*2p7RTVeHfOLuRGbdBHLP<PPd=4!YE(Aew_rWFJ#h&eJAKF|(2`W&|SFEyu
zRXprYB$M8t-A}HDT}RCtk7#>VXVX!Wo=az9ZBRXJ9f31fa_{pD7lw_><?k**lq>>>
z(*1>CpoK?@=vZOoz@(t!P{YhqfqKx46uXEuKWg4f)ZGItW%_Wjai~YXKbR%wB?4nE
zePp1Nc%4UFD8E#9FiIk6<e!1vVNO}a7^ilho(hsNkPultsDTCXb8Bgw1yje?>%^~2
zM;9u|0?4Lj43#OiF>-Kfjz0Ku45O{tml}_AJce$2SJs3!jf6`fDiSz*QZ1S2c2XO$
z#}<ad85eKgoK31H`TOtO*>DgKKWM1BaLFD#yv2%kx(CO@qgH*lR#`zNY__RaXObqR
zT1y{KrdO7S(NZP}v>YevMPN;GG9@}^ObuY2G=rs-9N(#t&pG0=gVu|`;+*{2BF7%9
zvRVZY<&8xrgxy@~nkx^=%N*@)dN30G&p2!7(kC<>ZMa&48i>9+MDILIs@-Y)F=7?b
zvGC3%n`1-`AhTBOPDF=G)E3}7*DZKiv_w#R`%7uYQPN|Bpoe>$ec}z2wu%*15PP$l
zG;73?iWtrMLpRO@+N2`^Gi=3EI)Ier7^F%W-in9ZQhawjtM)ksuCeh|bLoy}93{=$
z5Z<kS$t(*NB6Yi9Zu)_V*?iebWw$%J%+=a~$K5@8%j|7ME+BJVs-jQv6xvsAtd!~X
zFTn;;3cWQl9#y!t7nOJFy2`Fqo{Q$(t!apbUpl?<c0-fNAQoMhApA41h#zw3q->)i
z+Lql>Sy<(gExXn9{%1}_uHgZJ?*_dU$-Y`P+beUXSe6C2-{vNAXj-ZQH`i8agLuX5
zZXizPha6I@3Eyvb(vPv2v*84K@2F?<D0zMk7bK2%O%h(4!H3SO_zZ{Ix!5M&qo2+5
z*|bN;i<m1;?o}X+Oa5c1H-ocTI0;GYmf$qHtwfBR5W|m?BolkGCT*{AK4COc?+2!o
zKM=lz@rELbdset{`OaBe2rSP@nR&2Gmgx#G;OhYb^+|+Fpcb9y%$oYdQuG1nyDjyX
zk$R}!`-fXUTQ%Bi&DJp2Kz$0^z=j8sKRL7`l+4uzXqNe*fnacHvuGZrG7JFzRnn+P
z<+|f5!!ZRS0j=1#L+ADVN0oqER9)q^asSbM^_p5^LCU4(InYvYuq#xwGLmb_)dad)
zRj`eATdxYT;YJR}tngo0vFSaXWr@{tJ!`eBRqR9>iMhzQA@^|rd17C1MCA79u<`Em
z5k!DjjicQkoDF+=c-pM(mHNF!tW<`)8c?JQx>`cJ3lm0hp*#~e0a>YRXUAGq@u4D$
zvBp|e$*`*YrY@O5?HRjKYc<4#W=n{Ha%dQb6P+o6WDxD&${<&&HF20!ZHb!EWW-gq
zjZB|Zgg3?lu8JAh#g&}2+QZg0%97+>BWUk9-;&a9R*&nvXmWL+0KpbB2i6%r<Afjs
z6e&Sgz!)}&vRpu~E-;k-+$3w$MgYnr{97T%Sxdf@@wILyuXq!NoS#2?C)B+1Y*lGW
z`v<O>3VX7+Z<JW8=J4w3B<h=qaH8sY0iHk?$D_$~cQl#I##0(oDN_g^B^5#GCAZ*W
zuO<nQ1<AfsQ3Y4DIdjhCVkRu-LJ($hGVrj)cUcxsnN?x_88<UD*f^^0iCmvLhRqV9
z>!QGlH-(VWkl!3Y`1GRggqCv`x3#5FK@9FW(A%fEX98`S?81d;luhxgk_!J0m?We5
z-SKGe==7BzoP*(OGG{M<MLN9g?*t4t&-Trrk>w1<bI02m%GQ33iSwFje)CD$P5Yh7
z<zfPBX$xIBN=y`M`<ydJrabUNI!`WfwFNgBzO~Ap1+D=vHskty(^?d{Rm)nPJX#b1
zd_s=8T_~}8nWIR-QHkr~H0xyU64NdBj>-7;8NwxlTt#qa*vxjH`v;bx@+OEO8jBrg
zej2%UWRoG&*!eO|KnwoJT;i%}Zlv!4G_I#_nGD$^F{*vkdQ;Qd0SuxSMdLPubwUzz
zn=`12(#t3al8}UH*!ALKvaN6VXuCA4hxHc8v+cdpgX8wQTGJ|0u2*%pQLi1gn(1ge
zAL4PKT96@mzSyOZIi@ljeV;{BHs}gr8`(NKso`e(f-uVEJQ=^E7>FrO1Y&&wn{gF;
zPBZqypt{?D_vl2N33Y(;H9es<Jr@{#Wmr-aweZsePVo*JMqRmDX{!<3y<6~R?WHy_
z6L7T;s?ApIq@2=Ie9N6vD}~J$w2s;OCKqZN-+o&(AXKr#BCh&G0#%sRJ+8iE%tQEp
z*Ain6(((8`?WCgLIyzH26}yi#uwa{?-)UsI#2Uvi$S@kBwGtje(Os)T#|KSJCs$IV
zrefZjBi%W~@`jz0_=yKyoc5_?Vz=b5wyNny?U1iGa>t8CxD9)&O48)?is+i7gu|@l
zeEDyk_DG8>wkeYliAdIwxH_sx-W7xI^tOEwerl_T=3<4Mdtw?)b84CdNxf)1Jx>{E
z^I;}NeJV(UPFA3fG)WebHr1ucudSueb_T7al35-fvg|=2Tc<y{OTvhfW)J1cV=v-S
zsQ#ltnnCaa`Y7Wms+<>2-K^H}EIDt5@xZK=uE2o>(m~kW8PSh<ul?a=qN?TY+f4El
z#{Xtf&Xhk0{nfP?4FAq%0}?@T&T27zB36jg(MSSPtDMStVMBrWI_0uGLnGM|k{3t6
z_lM|KgoWt$-#?_``pxmf?95)e#nMP>_ciuxW=E^J*O87y#he0wK8;miR`I~lF`?NZ
zlbr#=Bpe&tT_5RJttsy$LSS%}3EnMZhrU<eZMEOPpp_1dYJ*ke+Ul`2xvKF<G~%)Z
zOyWFO%Ie|q$>Y~oj*bp6Sg+0CyTM=va{|Mb8S~z9c2{Ij|Au=#H>A2<qdH?qcA0*=
z9v$SoIu_#Wl@p6sP8@vC9BB~y&N%p3`{uzQBS?W2rvIs@yvz*p<{DCbbFb;_;@^Y3
zW|afiPI0B+y&oYin-)KWObI(FU@wfD87IwNa$>wwNg%8y4T3NJS0Jn0WmuPs?w0gN
z$8J(Qe-;w>$TkUdLau7h?i_SdxvOdy*@-g;sfrYggMps6$M$Ao>@3)K5piC1TEHnS
zebiei=n|iWi>yBcF?Mwo$jvEOh!y&ijVL-dc_PgSrntMKA#FMuV<nvcr5K(!rDJ9)
zzaKp_vs)IdOE1(-;6HEoYVEp8CzY@fzEZCnT{@rGp|aBL%2H+1TXA$neaLg#3f`A0
zq8X<Q%60L%UIrXp3oC?O=q0DAsGToFZ!sF&;&xkV1((8yxl5c{%%ZI|x1)?EY(8I!
ztbFY)60?J%w?$&t1Cy^W-;)wq>O4)oW%X#(Dl%7v5Nm3G+QK@=T`DwdNwxaLtgUHh
zN$Kvdx%`EfgD<!JWjQtE=);qWsyGk9Z-ut$e&&cNX++Nj=5<*tlVNN<D{-nZWu;D+
ziSmXk+G0+#=D*2gvK!^6#`<?)z>4>65&fL6xtFYT^8=6nYf(IBPX9);$sERe%7g=g
zF^3ydyz!bjMH%gq+>=x(E!5~ldKJo9_GqeK&L5;Dw)e9I{r#izP5+t<>YVDRq_T)s
z7~YlK=G~*)5H!uN|Eh9i%W~a78ns6^9}X&R+q|QD;j+`33`fSe0;?a~lkwiGn5zS0
zT+z7#I1p2YN}oln5@${Kz0tiqQDzyr);H%9?kiYjcS_?#rX#&t+9~N?OtjXX&UKmz
zqzXtiIC>+^Klt9LR({pG6|HX6+LDyVwMDEsbw#pE)l@GLIifWJLZ~|_je+H&Yko9e
zATj8Ckk{0mrPEU88xklRONU?42?bRoSVt8v;WcLCW)x1k=X?06EyhiuTrMR@UBEk9
zwp&+7zacK&vMes1wNe_nzbGZ1!`F+>%3f~5mM?={!r&;hK;=A?@~=lw%9jZ<GJ&13
zS=GY3kDOdSb!AcoTOi|y%%SIvtsY-(itNM2>B_WjLSswIJ)A1b3QKBkY^J0|C6SGQ
z6B#f4U0w*dE)v0F(kKLjhz_GvQf9itmuZAfR1El(X+}kl?!^hBF|o5P@k1j7=@e5#
zMK|0L@}L0i%wdwoTMSDETDpr0c--O(-4wDCu`1y8B=06TPGuIQ)8XmSq*=YC^1gyg
z78J{P{WF)CQOEL#CgG(%M{^?==p3PcFvG`a>_Xmis7<}P@qGx-P-iy1-5F~3NK%*H
z;IRGuAdqE3{BCk5BS_oEwqst1z7)>QWo*2*E4CH2U2dwF0JRq4fD!2|e}xK(YXFYR
zUxxuUQ(C6nf->pMFCHAegqPO55=Wge#}+LV-?L25CsA@fLU0w>z;@{fh<bClYMIKM
z!%X&6${ImU)Mm52Ndw<zI3;s6?2hezDs8UUP8QFub<R2qqRxY?^37v~3bqK>SLmPe
z8}z!F&)xHKF2UXFUcZ2*s0CbzsmoyeQd{gAD34Evj^z(?shtXCjifQy3OVO3KIVc$
zy~oYAL9=UQu=X&r5~y>!-Ky5pR;AbKaZbW$59>2Mrj<m6i&V78zxi6bx#xzY@fb?9
zcw!2LuOwEpB78Ce7b)jRElshc-|H2q)0rPkMs8q`1Yvk!2M%+$3+#w^I=ITRa7*HN
zzKBvV`T44P%Z%kIH1o_v{;ys|XPIDeW@cMn6--`p!ii;tom1+1-0+(lGQugP(!UZj
z{C|L(U6vh95$Jp@Pz~Pb@LlrYy`@8U(P{a6!ZioNfbL+x&~-Cc!<roGI*?@7*vQG$
zW>qQAm(d~dsq^2b_1z!RrifpS4ez9>S^gc4T>mMm)Xq5Zq;l2&ItX6mA@Nc);J8t(
zA6D)<edTPLUk85_4V$CB(xz_HaO&B6w_O|V<o^Ba@U`6VqqGJaC~2Q2R&l{xDK;Ih
zC?kA@sY_CgziK6zZc%YBeGcZbej`o11Y`eo@MV;?30HJvRAVb_-a(oHB`z)QtK<nB
zG;pkPEOH^UX;cYJMRb3;cQL9>Z1i6T#epy9Oe!01nP*gV0cOTm9gk`BY6Z-`&UBGW
zEHQG^kXi~cfX$u3+%-#)D8Jt&^zqQ~9aN8l9ErG){A#t}a#e6aD&}dyvc2%7>h*fj
zbKz5gD_9`Tqj)K5r+GD><lPFnWA7H-e6EFl&iSHx0Us(J0~OUonO*GZweo&KMh!Y~
z2ct{gDDJ_$k63*+t*qv6E6g1`;d4fw{#x~8;jk)^gSb1xOmi*;dDKT3<Ix07BbA~O
zr^M;PZ3Pat@!3p5;pUnrE1jDT<EMd!?%jsa?YbXQfa9XsD7q?N8s>>RIyz}}<8C|3
zAXsICgwPNil@94h=!V1fp!Si9OO{qAy9wV(at>W@Vsa7T8&-2xT)qF&dz<~u^ETwO
z4C!IAit9(?p8kQ36Oh%5aLh4WFK{8Oa{?PzBhEN@9;K2mt1;7bk4kj>QSHm{s=`@<
z|Bhqo?}0s?3hhI`mCmy#pIWli@wb_KwBb{9yj`%B_R^;tK0@owF3Bxplp@6ze!qtn
z$=8-@6_G}7xg%mb!3&rG68qeP=`DLH=B=Hd+>>|~lN${zx42Aht#1QO6Q`-%)y!X(
z99B>d`!Kr93mlzSE0$WcmM76=Y*Y}-)$S)aS64qKZkGAn@*GY<Qd4Gl+T6lK4l?F$
z?kE3tdEqTxZd-~WFFC;AXvM$AmEf+-@vaR1?nn9cQBq45L^5_i909{PQfNCAnOeUP
z6uRcef|>%v!m5PJa!JbcrDx<<Lb4GOL*?L@{+K%-x$l`yuHcdjbtcceKi}F{f+2GC
z&!2;NmqFQ!pggs|`^jDbfQ2uqgzyaG`+-`R;`P9%_-aWOKYPQ(o}iuhOdndM?`Gwd
zh0ws~x{7vZ9TqCn^=BEXsy|CmS2OfwEwb@hXqAo6Z^bC<k}p<+V{t9c%~hi>Y)5wO
z$7S0o80K}CQkG>dJ+&7AgTewT=o7e1upouytZFpZPN0BXsJL%@4Q6ei7TT-K+pLO8
zEx6^&#$d;%c;nvat`46??g04YTp{_)pDS8rxxe2<eW4pJR$=5bayQpw;FC)m8(@Wg
zy}m*NpMN2iFBiOymO>A*P*w3q&!<3tFlR<Sy^wvMQ)VHpNY?>~=6EStoo}}4!o6j6
z5P$T}5>K`--dNY$OyY+5Z@i6ix^-}lmhoCBCo7-7K(apAnpy?-a=zPh{-JUM54(j(
z>uSON@B@J+^w(QD6s{@t19SiV4}zR-9Sr{Kby2vGYG#eg|9wxE>|9<hvXjr>jdM)b
z5zOVLr--X#{-ZY}c+)>;Lu#q@|MZ5;7kh5HA+yrXzxSrRf%KNYF>fSc<?KrpZY)<x
zJ{?V2Td%?o=b3omlZ)%862zW!Uzn9=H2JQ#Qqem6g+p8}l1vNP6`6rPuI~Qe1rT$h
zo=oY_Mb^3?;pf4s>-ehQS-%=uka5`kkQCTNr0gDSY2Q-9M_U6pcp!7oz|xA0(&=yD
zsHO{O#22}^s>n#XzpRx5$3ULCk<#jWayK#>M(T1ImmMJo$kSf26B_ZSfF_ek(Fv!y
zXP!-=lPFJ*BZ!Gp9Q64*s}~KX;acVvO<J2ogAh^h^+g%7i|=I=^H7wcUkvaDc2`+b
z1=H9PK}NHyYv7n#*=Ga_K3wdU8BJ_*@|)QqT*InEnWn1AvA$OYr<P4p-&@|KLQR#O
zE&(aYo~xocVyRbh=~~`rh3^%S0akC;`rbTCE<OI+1y*`futlPavstWD5xT~yl*{;}
zE@uYgFSiX+{p4UPTE7vZI%H@*3HtrPpPtk2V}T_2rTM~!n!e=^2jhxf&+D><^LB|P
zd&_f$w*YS8mj-!WG0Sd*^d)0FNpQC}81Lg-wr##*lS0K9$)QjuF~RfKsOKP|GKU<(
zd;qt)%zkNK;?XcmP*!nxL=rSK($y!NG$3_KF^!T;MtRLlqJ+34Yyi7diS(a)3!J;y
zH8#w0)|!t!LAih36=nz2L>sd(n1(6fWi84~b{8DC;iuN*O8ML;YcJ_{)-p5gK%wSb
zNuNIz+JQM|@_bP7)|T-sy)*URr+KWg!-F!eL-qmS0rm0)W`WmTk?c2f0)a^nhBJiy
z!5JA(qYICv643dUG;1%_-DnXvo9zY%UC2fjILA{w78<0N?YOsov6w}6N+;1j7LP$?
zj3h49o=_5xb7_8BS!`WI(~xbieou~Cj8l@?1uY0t(2VWrnHN>4D`g~o_fq0Ts>TgP
z3~42hMt%o)=x-umcw?R`WOO~)Num|lodM;P+xQgrIwI9&3HEBbg=({U%q@&Z;~6Yq
zAzWZv%(~MVXR}E+aH;I=VFt#=a#_|+(IbLl8)><`cO-0d&v@LoB5UZjuEoLSGS{id
z^hMBS->+ujv2<%pG{bHgf?*5KqZetoEkiO2pqJVs89{9>LniC>djd|dZ})Yuss{K%
zKjJ;H`?{1=WE489x*AjEE`u=_$)us{CC#wzHoaU-%FXsw__;aY7J`0B!6MU6q0o0W
z7<K5}J+3vBS*XO%a3D|#&PSKbsj`kFs|J|{S48p*Q9`SS)!iQ~WlC(+d6iW+-N@*Y
zNQ-8Gb@z!Kkt~IZ;2YcIyli!wZcKX_g_7Ih6GHJs<Mp5^@jT#pG>BA^;tQ4XG#L#(
zW|cDNP{NEjBsW7t%?UV;1}sr6y|ZnFd1oK5d-2}J(s3h8Z0*|;T;(j(!_OXr3>HtK
znuM2e?|qsJ{yAS;P81LGWYBR%%|7#woGgsj0M&9da4BHT1y~kn_{hw8d#nz@mHQMA
zFVYG5^asV)UXmOb!|0q7`B_9epnVW05pA7b3rYR-nfznzq-oQ<&uMNst}V4lOC3u~
ztO>*8HdjSpig;iQQOxyr)=wlbR}ho~XYD0zhCE!Ypl|JOc#S(Y=Rk5uv<NNBYaH=e
z(STJtN1wX?>w!5dwjUD3*8Uur45F&dCJtP@U{V8hv=wpFiF1x1;}5rx4eV#-8eOkV
z!s*haJyq)q=(`;^TKdC@yf=}2O3#AA?Z^oRe2YYd0-zP{jCmqMT3C>s@h6-MM%-RC
zW6NsOZSlrv^kFvEl@ukaFz71H#%^I=Ic`C7hy{$M9>ChmB#MS#eA?XNfsvfkW8v^j
zKD!7(;AkYj>zd`McMTs6>MW5%^=%+{TK2nP4p!wL>*gtCHLP<ru-9TLHK><oEDL~L
zypK{;i6_1!VZ!J4*gVT{qxjsABgN;7xl*3iHQ<cT9E@kCUyZpC*7*FM5$^HHVQ7gx
z+J{ru0?w#lEPN}?4RK3{qv<}fUtc?;fT5+rGeOMja~kb<cufWhpB0fnEz9vo!94e|
zO0j1oZM_*QicJb(Zqa9-LQX{pzrg%Km`JuMWdLW=9ZGIK=-zQcCbVnv{0^lZU*wmZ
z2Jz54XxB6mlpYEk!bC8!2cW55j4vsU+#Fpu=gIL|T2XXU&K#c=vjAa+LBA=Q-cD+g
zrFnaNeuw-RKN1t!zY>gw*_MFW`d*(Qcee#rm?+{-NS~vmxmK)No>BOzK1IfKaE)=h
zd)6jw%HgHMPfbMNE!{PRDh}bx<G!gz6n$_jto+Z4WJKP`DKDoRNFm%qZLLDw%_GUW
z(mHMd=4>Q?^Ud8InD}Vy4rmT~%&{5ReeG-@mFe3o>z{SBWuGjZ?={nVNDAPh^d2ff
zu$M-_NTiY>H|{NU$#&xlN6U1mY`<|P?9_rAGpPsb&S3Qd$|d_iL>Ebz{_3i}SJHFJ
z+?Vz`I=4CknJ*12e3;FHeDi*DBgNO*ksQ){9s!F@&M<N&Iw?x_PM}Z8QK{fA7ln2r
zw>ZeWO-9E!+pZ$>F^9GZ<6)v#l&_HMxQe_dSEtVqMDZe=b~&VlD#h@=_g!*tr4r;w
ziwlr|qYenL>PJC5vSm2m@Q3J%{x~Q*jHg6Ur*YTQ9Z0c?ZxSKnt5c2o5wUwy(8qXG
zxtLZs{e;wUx5H@tBXbmUHe@;YORyO{3$|=E+=J7Jqr+&lS;2G>5uxg7D^Ufh@nrNd
zHr&+aM$n19cp%0al7^AMm`5>4gV808OUfsyHd7V~oP}^zEWa<NYcKVHN_R1Hg&21?
zH?|(8=m1T=JN=Z#KB<9I-U5)z`D-l39+_9Zv4AXc@No-<Yi#r+0bR~Rj-XOI+9%YS
zd<a4vP9~caL9ft@AhVeb^&>uRX)PR=T_ggtz&tHH?5yRrOi*DYVHvwvW9IxC>&ltB
zbP`F<I~gW1@hZKD4&~8R5zD*qB+EIDmbWkj5WdaJJ5MXJ^abf+I-;V==w~1p!n|o)
z*=TYR4|On-<#^i_G)TK@Owd&AO3+D-OvE8n96Bj01Zqj^lP6*RUtR0eal`Z>|Gc@K
z)iq~A#ineSM9G-gwixaei<fsra}|Oe?3AIj_v^u~7>$nfs>AZ=4EnW?k>q6P^<vN#
z5>~s2<+{Ga_56}pvfwydfFUmDXW^d5UtQO+Br`4<6K`;|SPoYCuZ>=#YS4*$NBj3Y
zE39J_^F$=uwS(i<yY>&YcV0u%HDMZPJqWqJlYw)CmSWY3rZfpKT^6gSgxVPMD+y(K
z2c`oO`<+%@4o=$&>dBQ1pLd+&q#^HA?3F-Fm)StG*WsM)8q;01ECE;T!&LVA7s2N9
zoab%sN~^o^$GwhCm6f}wcIRr!$&5F03$b0JDPs-jQ^jzO&k}0wBD%0`bq1sE2XH~-
zNTQ>$teKdsF&xWnqFheY%=C`onTWt_&RKvfnRWQ#bAt;SfWcj$0aD&K+ts7}_A%U%
zUJ*}ZkWkkJ!qoQaO?93$PhZu3tR1!(gW$D=+Raw=M0vw0K`6JQliG2kzFTeK-r(B(
zpmMsS>o-EE@3f&<A_8lZmx#l?mE0D*>J{CM=0X0z4T3WFK(oP?-vcQfjTKo$lfWk?
zmjw4UvBM{JOm=+U*4l@nVZTmN>1uym5d-ExH=n=PMB&H736hRQsXm^RxbCRbAD1h^
z-K3*a!Pyn+tg8^W4%O;)FpgJIjI6?Z+55r_LTw$79GEsLc653b=%7Wm32%Q8D9;ch
zm*&$S891o7$LeKi)bGQhXJltOckfd{J9*b{V;qGau%}0ptKj?K*9#IPMqRVh>1oMH
z7*SO5MSev+%Z9#sA>k=GmuwnpaYthfC)xU5CgcoBETTHKVK33HhPmtGM5~-fk`Ue1
zCrH=bY;#U|HMzgcWd!CDg4*F;Z7=IVx^(^hD(#)Ud1JIB!fw81_))J<&PirqIflrX
zOe0vx6~puQCh*6&;cd2Rhr6``A|I5_qUkv9mCE0~PzXl9Zq`GJGGB|jyX`dJ9q!(g
z%scJmk$SVwoMlXHv+J+oO~&@S><kx(H{Bg>8`s$($c8t8`Z|YjTcL|ljD&!gAapNL
zY4O0l!HbsuqAQ$*gqZ3y?S_M{*m5E!Dj$o<>>@BkQ)w3TNdVPPhlT+~YOp$~uxfg$
z^e~-Szhc}YBXf`790K6$bRTvTuu_(-WKPF$(A!ldO4L5LX=D63ZRxXz0D<*vGtwk{
zqcQntm`o?zV+nU)QrMhT_qpu{*J|=*kZtH%Eu`ZwJChP0;`0%~^zL1KBu%36pe?)+
z)HjODYt`DVlj>n}zjopW6F_lX%7H<q-E<gT4&q_d8Xa)ku9JNFn9t73DXiY`?n~a{
z8s-&F#;8}y77}T&;Wsb)*5om8j%z5yjKFPjIReGhCEz_moO|oR(NOQ+U>D&kiNzCX
zEJ7Zj)nJ5Z$(J!v-d#v;?t4c2d&KPxN6Z@HF4u|2%)~|=IvCMOJW?o*WSH)0#C#Qz
zx2Vnx6A>_t=SC;j>uBc@RGf0~Q>ye)U)oNf1m5cetF+@xw$fhbzG6672TpkZesg1M
z`)At_v#Rpb<c|?&#Wo4ENgJ``$IO6iRD$T!m<VPs=M6s@XkKMQF)Cn+U(R^@wS@${
zDBAnaZ3P6jP)iQ1@1D<wAMBKt+6>OQ>{ygw+dtJdBodTk)F%KamW+V&^k?em-rqLv
z*#?Lc>|TsZsJp_%cct=(-Q7Jq6d7D&bXICK+Hb2Thv1}E-cA5bT$+Y_V?Ui-u?j+2
zPy#uDm%vc>-iHy222!gZ{#bQXBuYuZXy_^^1P!P{I32|p>HSA#k2AsB?}JTs6NX<e
z1J{^r;Y4=%`r@3>eW0{hqsaxyBU;I>^eOc7hSSie_z%&QHDL&+(@ET!(Rx;RYjv(j
z_(EuhB<Mu_kvi|;W-3w1)zNP8crcl@;~r-?U)v;#-=DQfSow$gDcG#^5O@H$g%`m^
z!a9j^dQ+gWE{GGAX`Gz4cN<5$KNvNETp@coxM8#D1$^P#m{mej-)R!~>CZqfT}cJY
zQF{i8HFdeD5`KF~?6&zvmWn}1qAJ=+GR?d9Gg@E$({cTz)~X+5l3G!t_T@7{V4|=B
zM3@GQsHds+eZ|7CUkCxfXGK=63erZA=akRZOv5y5ZI088XcJ_jw=h;v1QGODCzr_B
zCwS|vL8@#kQyNOA=<17Lb7LbFt-AQuH$ztR$K<>)OV02Sg!abj+-lEVq4q&@?jq6q
zXTgQFBTWKCBaeB*D)?fCoTY0*XKOd>ox^L1{r>UcdeDeJL{9TWFsHc7<TC93XqsON
z^m!Jp85;5@1AG6Z_TM=$#^Yx}WB(Lc)BiCeQ6uZxkAwS38$@dw<<7?(OLtMEvRQaA
z>5oIcvW?!>jO%-iyseMN&p`G9rl)KOTxib!k4xf!vU4u+^JOzd6@$SN^_-4wZJT8;
z?y$Lz_MZi{Azw=4)W#ta>wrfwqA!ic8Mvh5RL$+TS!>jGTYIl^I@hnB1<hyx7j-rp
zl*3YG>Of|YT)V6i*vBshJzIF8p_eag6o#_lHHRdB<@qk;u@t%T>B@e!Rc$;A_V_vs
zd^_wcb$$gVG@;6|kbnENqH>z+bSI+OReZ~Za10^Xm7@9@h;&%iXl3a%`rB}&5_nV0
z-X{VH=<J_&OPu1$EjO<}w}rSTHKe4>MIim^S?~s|zu3|<5~-j`ik&h^U{oTRLFNcg
z7y%X1aXy-gr!ojxcAueG0&xi;=m?g@B!fhF(J#wMk>rFyQfNHSQa_E!nT48**(JB{
zTkio;=2bRO2s!v!QL{-$Q1DBtQB~a0r5)aH33sZeKjokeJ$)9Oi7rLu(_E83>K<i1
zI89g^6!v=Rx`lpFyBT)kJno)DP=>^J8BV~gU5vvi?z7i}`o&n%GDy%RAS751#TBO8
z!i5hG-&k#OPI^W|)p;BVf3H-^p4pJllEyXct*2T^H(DLqCIWWTz8H^i#e>apInvog
zpRv$k@|<SSS{VIs_6cEW_zN@r8HAG(7S+<eTy7T6`KT*h+@PgwQzeP2BV&{B%<ngT
zM)iB&-75&eR8_WH3igUpv(pz8@RGcVo>2?Da8U5Yv?%#Gc5rJ1@e+)xlT%i%_|DFt
zcbSS}U+1wyl$Nu+rUuc+Xn@r_JZjZ<Yq=Kj-uWcuNYp3HgYm_);=lx1KrJdqOO%&2
z!r7FFDu(#CP&v2_uR#B{CW@=IUS}oOGMO1msE+8LwU<i4hZ=1@eONni3!{LM>YVOb
z$0(sB+|GbNyGMun_1Eo_(?jAjb5kel540}htCF2a+^aaPRkAJJPoKZ~<F?U`iGFgb
z+08{(K}&;U)bCT1ORtC&7pL^;XfSYrBo^wMX%qEjhBBCi`9p9`HInWm9#5J2;<%Pe
z&cZ}v)TFq~@6U!^Y(}=zsAxUhEL1BpH`Oq&K#o0B;r)ctHL-l(n1y=GtSHm!+;8U?
zKdrnv+IuIvcJa<*=-y!2i345x2-Eq6{H~@a`T`kK7%OQT3N52STTErXVBdBju;q^y
zZ-@a4&wOi~H9^lMuoEA2juyU$04q)9<o7Bhw5ajj00tVYrznDim+74QxdA9}y}w47
zpAQYI?n5~-6k2|x&Yh$(G?*c(ilmX#g3Wj9Tm9gmQ#9?~Xh!@|*^KBxP=XSF760TJ
zV9qytQmtGcaN(%GHpXev85E$B1s?JHy6Ck5sA6C1`sHGXDy!$}(S9%u<3ZYWV)?BM
zoA5&F`Cn{=dNw5KF`LG(FlQ}Qd>g51hAoOR3~2=+bchTXt}~B`0ee3QyIGGbyV?pm
zd$m`muPZC3Lu7<I8*)rcK*}`#OnDhB$<Sm(T3=9c?QEsiykKzZv{)p%uv`+Jh4Jtj
zl8d?#&lh0${BtdBU7Kl+3N0c8j!4lifGbbNVK+((3_){75)3zj=yIJX7>}kTvc&8!
z*8#f=JPA4@;!4#e1@o?~;LZt|fz^S?y~dIRt`NJq**~xEnS>9-e2|*9h=SLu^M%3F
z=E^JXm~!prPwR)Ry#1JG=G&pwbsEg`XDb|xfB4_fo62qC%Y2P8fciG=oK@`QgbyLR
zHhPv;7n2Ng$Cq!Q4$5&YSEgbwCVcWWWe%avneUuzoLmJyIz(Ie`niY&wZ1dGQIuc;
z$!rWf!UPNbq^|=gHGRMffU5BINZMJ$bRN-J45ft{L_A$DhFKxp7<O6r^<sB0{h9C8
zRTT6>yLN45-`$q~mj2v|AD0<8I|o`E$@+0sn11lBzH48_xl1u`WyxP4s$S29P=CGv
zx323ca?5TY^YFBg(BhLH>nq=D&WG+o?>YS`@S-ao!L@zf^suk%@`cYWuK5Druce&2
zZf_k87q>KXj0uaq{6$(vtv^PKYS(2Mw_yEA^Pc$;n3mL=`_uj{Yrg@GF>SqZ!xSP`
zpW=0&yCk}MSzXtO)zt>8?$|~GeL^jLSBRQ#HX_s@Ha9^*IDmWlmA3p+snYvOAq3oG
z4+u9ax*hat)&!4ErVo`MieXddXmL3YGdH4YT)L5#5mUb##UJ5nq3!s@rg1%}t79RY
zg2C?cO_Y;=CQdbDi6ZtBCmX@cuBf3t<g-f-`>(7c_$rJBDowf#CBtx>oMYF8A862O
z!>K+mLWzaLK~nqbqHHANOa|dcSEwL?BEE<R;bfpw3h?yfMD1WDLnEPy2)c6XjFE;g
z101<ciA|0=hI#Ozx(5j{2MPTuhv*ra9BJo+L_)B7E0-WR1kQ=e(S)^yY?VV&D7OsR
zNUnM^Rz-|?`79eQv3U?Qe#RTVoTZbdGdmMv)@Aq)SPoP<v$(&s*i>ppQShHnwjVt#
zGc;%(z$gwu6vhL=B~zUfFbp~VX7<iuRZUJKDsD1q9U)Xi9Q>95H{e@PU~d<<R`C=<
zUAh@fP4q^{y@*%NfJNSb`AlvpYmj;WJ}mk+iV|byoHN0SM-BMGY#eKAPk>2jP4n|d
z=xBD?w}oWBxC%Z?$YhRS5LYj>sj+K*jnB8n`QmQA>qWYPV~zAJ?C2n8IM2R^A)p1U
zKd<6BdFM@5(UE66>*kfog<@{}27H!@;gH^X)m~58<z4C|2a2i2^*oWXoTP1RC(skC
z-d=}VAP578O6nBJ&eO33&P|)ctrgyt<ayCF8b@#2d#A^9WIH*PsHQrR`m+HOc-Dsz
zPmhgej3L2rB<s0N(Jp=q$`QlS0oOF}EF6%`!9Zh@N=S=)oKTTcWg=138dotEksRX-
z>`I};+3Pf~hTT16qKQhm5jOnN%d7}Kg?kjA<qdT3F{;;|jnf4h%N!{o6upHxFvbG&
zg#`l8aX5^-Ud%7FWx~j5qMWDHSrpw$$8U3N9UUK)JldS13;CBju+5-iav5fqsA6l+
z*P5!4$vuF3)m;L{MjvBlt;!h`ku6JA8z-knlg9ojh)hKr1y;0KT*cTaS75iALkGHG
z5sZctXC|zzWeoHm-Y83cS1cS22bq8i^6n4~T>YT90&&QIntuNsA8@t3iUdfG2rB{&
ztssLNzhyGXXf1&@$`T8%gtp`0%Gv0y;n6foyl^nxXaaF6h<axcbB9?gXmwpe<6^Sa
z?nQ&}%0E|o5iuxxcwSICZP0Ck`iU`&64O3d<96jcLJxJ=dx&lB$n!1TiHjQ<pJ#DD
zXO=kWPN0X&(VM5N+%3F4Yk23eYcns8Wuv+A;v(zR6^oUQQPU(a4t!*sC9MMj9_Pl|
z;&#~bOIYO>;s(Nxv#EWo*{sxiGS_alz)cJ%{<qo{n9gGJVot=mi|Aq!ecaiO`<<vH
zo#zFm7B`oIFs1nl03#y7+A#?~YFkG$TH-r#IE%tnq-J8>K{;~5z&cEm)FxV{VY~d8
z#C63;>1anc@+>HQHyC^>vxc+4juMdrrPO**?TjWI&V|^jc~M0C`(3%@)qP&CR^H;^
zlN*=?bKE`I6;G(Vb0+JrVnBVz|E5S7pCuWNeW90)*YwIBQl<{9)qwa|DauTo`e4vg
zj}&LApIM<PP(90=JkUGLTE2HzCC3-6C<M#zH>n#9z3dV%vxY}MSSR|^p`kgEwdn>4
z6N}*<3;%pxV!SzbPi5t-yDAZ=Sy}{7jlQ&!1K6*w6=8D&FHAm&SmzP<Q^6~2dr?Yt
z5)$d}exQS;H=9V5ix}6A0X(mR5)>=S*p@jd=5osw-JIm!o$&C5DPlQPU3y}MoE*lU
zEx6qzpegepA*(Xk`OEAEHKY!Xjt<Ov@4Z?N<Yt=cv#`N~s0fG*fv`akasv981%o0}
zM`}(piT;LF9-(kvar`iadO>}I6gE2eg%SNZgRJ!x<ygIN2DJqd2!tesz7z4DFM3@M
zQzd0-I}gpM+z}_J-pF-eGD?F3I_?1>epzc(LH$YIxRM6&uzt9I#Ga|M>3GJRg~A2C
z@5d<m@lbvtehG@!`@z*{7L3D$O(yQqVSUdDC9Lb~lZPGot3N`gji@p0`eD7LlwdZT
zG2h-Y%J<_~lukL8n`+Faue4KaNoNDqF;LQ;u=!C@bPN@>;skRlAwO(J$>)|Hm-<M3
z)yJBZOkXQ(!DW<HSwf!)-GZPkrn(agMGXR1YHtaET=p)wl>XQvrKghx65drlPvQd%
zLqRFqC;mM_XF4d76J$i%dGP|I%*S^<XF>QXoB1J3E+XG><ODj(<3TSdy?TwcExT6+
zxJ-khZ(Vy1f}U~k8(-nedpA);BN4@<;IA|)>~+GL331@Jqrj@-0FWLgdqlA~mILlK
zflIQ`oh$a2HQ6^=X`mm9rbdcqn5;ZIA^-S!m4S!@0!Do03GT81+G!)6Os^at4*t33
z{cH=b-tL@%iOaNrM3#7w6ZI-pN*ZAA{24;u$g$-dy2U_Q$}u?)5*hYq?s%;0Zkh`a
z_gMsM2oZzh%HiObU=Zf6Q0FR8Glqh}Vu~ZYNS_?S>tIBikxmWu%#HJgqXmh5Tg2S(
zR#kK5{m~xB#8GTyTdfUy#cir5)gGZa{21!}L)J5tpmklF4T*#Jur{Us*7&5VWLtn<
zp#J)_d9n$Let8~GBjo=Ddqd~)Wh9#Nkc0%zU;hDwH&k0%#dLP%$LS<KJBudTpO%k%
zSXagw^CBRV!6m{UH40w@UJ@JrXySvTf9++^#I;JI8KmhX94390-44y9nIi*&r3h7%
zTmAD$73Qd?w1{B+4)nov?NNxEaQ}IYF1@{NEJjbB$A-n^XxEOTZ(q2f&*Ts-F0C34
zBT=`45Qy?hRfz`1@ej38r43fE5>(-4SKX`PazPr&^kqu>aSd~Z;V4@2>N~H+xFKDL
zHuW&c_F~_e;9+?shO-M@Xk&hf_T_{fB5le1@pNYWe!+0?YVK%IV8Et_8=8+{eSGNB
z6YK|}DG#z}L}FFfSR%z|=Q?V|#D=;o+~~_}aTR;TG6Hr*@mx)dwr2M{i+UVyRJFtu
z41D(Pn|fnU;$!dCn?Km_PxCn^GtQi2(D69V>!x|M`$Mg@L`RD9E!kBs>W8zz^jV4|
zC=I_Gj8%>T4tcSX-<Hy(<U&w|QgtSTEL<6c;zNpg5l%+#J2&JNV`hI&Goo&_+mVp-
zc$C1JfK{Rsk>e9NiY`OhENnxim}5^<4O?OK($gY(NgU`V30p;+@$ts8eGCb;GaG!c
zRFhuyW*1`&u&j@AiL)ao;alnb6`$0lxrfqUB<j&KImRo2iis<m?}u1zCA;U;;>{47
z$1p4<tvO(;g%CGlA{k=M?<jSKRP50X#5FxT&NFm|S`Pq;yc2c9SrTarhp1PUs2)n+
znV7}~Q8+~IVCJ&y<_23tgWW}6B|Opl4KH%|Jk9KwC4FTFfaSzcWv;x!SXQbRlm^fz
zXr_$T70p-2BwhB7hJ!2aUN0<$-_rC+jF<L_+u<^podU6*kz<uXE8m00Oy3NwiZYgK
z5{$7^mC2u^&{e`X=U&u{Az_kue3ABlRg6_U><(tVC^1T`HCV_*Q*Ix(%aQXU%`*ey
zf+Wpxcxfys)YfJ#5}g-OV$etFnuJF)rkk=|WK|IeX5x6A1Fp>m)DRMx>}|E)YRguV
zFoTW-iqa8)fVD=l350qjrJ~SU;I0p`5mpDo=jKVBBhke2fR-8;6qwW44ZnrMs^3fA
zZ~e^r3OT%ZzQi(weIghmd%!zdi1RS15-<BPVh|t8+LX#^)q}=Gup`<mXgrBN#-kbY
zv>z0h(FNoK@hTDe6w3WRVa;qfg(Zwx#NH%~IeQOUi=A*oDW=NdDhkH+O5I6uw&xEO
zrQo8jnV-?uUE0FO9@1hR97x1FZM(GU5RHmbJ;J~|f?2d65fP0^)CETPNTh9=2v2a%
z>GlY<T8$=}x`6M_AoA#viUtvCdmX?O#pSM!4Tp@i*Q&;6!(Iq6l9oh!2%*FSC4f*;
z7-Awd<>;33nLUkK8$YvEB0q(8T6N%Kn^S&M%FAP?LO6^F%ZD6RPwuR9dv?NI>(v}`
z<hz_T)%K+d3M0+7Yi+Vi{G{TP^~pfj#gMWhg)r6rj2(7iA<xb5Du|hu*`<p?KbM7{
zw+tGvyQ6`L+k*Wiu0DnoD&aJ7tozK~NnZ<0M->%K0TeS1=8?ucWYavq3VK{p$=mFx
zg4OaW$YCQIo=puaE7ZDNz}|m}EP=jGqDv$-^!lpY9cZnngjg#LARaL7=44&;y6htj
z;*<ufTpcBcYcJV4HgzeC*W!|Gf?&=)YtmPzxe$F{G~xUA5m``miYNX>q8D9rIveu=
zMohx~jJTO7xf*t5z?HLTdW@fSQP>}`GkMAN0`+bpfpoH)Ed!=F0&gRh^brUBG_I<^
zpp+aAn{X~C`zBiqqfJ+vWVG)U@TeDV{5!3scb^!QdC#cB{q62-Wf~ZP2ghbBo)Ru7
z_f2TnrlU1Mm=$mHOO4&}tlCHD?x`{0P)e-scm`DRyRnLT@C_&N2;-|A?IYm443g=n
z)z@n<>Z+o#<y>0vXn!zE&bgWbU~1)6Z|)JB-(D62hdl=W?&uQCjao0<4w*%3?;gG7
z@CX&Q+gkAu#a#w?Sg0lNb&{8K$OS5FJ}4rmz>ILuiF?9(6ZUEK4ce|tw=;SfK7~-q
zp`)q0$zC)yq?Ai418X^yyx~w|=Oe`}DW=FhzGyBu*Obj49SiGfULvL7zA<Ih&L)5y
z{_tuF*SCr!syU0?t5wZN$oYv_G8m@sLCpJuw_HeMFMT3a^r2D-T+grnpS?ftYa_|h
zK;ik@pCZjn83_vvc&REc^u-|Cn#SM@xT|YC9!(-8kY!1!QA);im;1B7XN@f*CE;@Q
za$oD$T^7pB$XHICIO}uX9=<(k?>FdK7i|+Bdod}7toc+(=MTvy=y+Ro);rW?07yW$
zzj;0?>saYmK=hV%#A4>=;fa=_J6Zd~V-hH9Fjvs2N`7Dh7Hvi%+un}Er^+n72cq6Z
zM!s8dakGXbx}?>(g37IHMkf<x9{N~4TUlR4v4*1e+3Hlmsa%4yHxoe<&M_bth)dqp
zKHLuj?v^+u^|Rb*X_tE8sp+oyO-@f3Mr}S+rJ4C>@ZuOye@t`PkiBJr2#KG?rdKnj
zg(ld#JFDW;qC2Z%6wN{`);9{GQ0HVIO_BwD+}Pg@`jPF}U=$AB{`J#PwV=h^pTR@(
z%zbRXjICt2*x^9}8(G-C9w(xj)Ey_(jc6iAnh7}07r70{Z14syVRVaFTRHm+w-Ve~
zQ%El`saAq%Z0)qDdP&hlTnM2OHh8Q0O_Zk!i~oZ_p+9y#)3=-_=x6506D%w&=bkC%
z02HxT42KADr<|u3LH2iv01h%=9Cc<V?e~v?hg@@*P_GrZku#IVhU+iD<0};<(Hn<j
zGolz2G#rhminUJPSwwsz@w<9Eh)_l@l;~Hy<nj(1Ktk;_V*;KI2}Z+3!8eKzb%(b%
ze8~hcj{#W(;P_&Ues{9>s*Q=O@2zL#V*bkDzQM(u4KfGio$@cTM4OWWNpkwK{qHQh
zOh4uY8Ls8^n(ensfn2mbRmtT@IbA5s@iReLyi%T1+gR5x(5$Ha>wEf5Z+$17T=bHi
z#1l~5OIQ$-!-6eT3}5>QO1;3vXzNw57-wF#7O>*E%LNj_H2q{3Ek>f2Oh4cHO4Ry~
z*m;hxy4Ei0ua!>n99>+46O;_9P;c7h6N+D`_L-QcKJF<@3l|d_^DeIJiVe-vyvd<M
zqfHt>{eNga7L%vYF}p1>7BYygUO|{mxykG{uTqN=Ve0O(>|>?S{mPgfSHAx(R#Y1a
z#m>){a<RE{&B8`)V8IQ!n^L%1o6W|s(T-}EmP$dc@eMiGtpI{DC#*^@B6lO%GfoOG
zx)BvdXeTGk+%=ocPYR+3scSKGwG4!lLd@}_Ezn!9aP_E1=kAEsKx;Tphgb|%!(&R#
zl7`hsNdou1)3J0=7V11Zwu4PN`}YKrP=Ev|0fCh!6L~{PDro(tz)|C^p(iFo!ajm!
z?0r}#YoZ3bx}n9)za*_$Q(my4aY3a!bbJ_qo1#shz`YVm$Iw~f1F7XyWWjOX;uFKv
zY#|GM;IkyP4+p194ywDm<cb0nEIpkezWXS`LhJlX0axy#{YivbQfbIggORmN!1yRK
zX}QxLuAN|J$REs8qW%&yr6DcTX!KmA6fQb<35gQbZp;Lib;r5f(3gcbkipBG&(mZG
znsaHrj85N>kx@dmKfxdkz)g~`uUYwPz_Eabpj|N5Z*e$a<W|c%hB+RDR7Y(^%+{2g
zIV%|efVY4<3?c#vi^G_2(7;VMKo7s16eFpp-O>Wul(0#;Q<@8oU0@d*^_Ih}(U4$F
z^!)p_Cx2+JQGF#Q>11GCwG}dG*q+Xx4f<y|Ls+>aToL%0U*(#u`gtE0CmjPbrS)N*
zsK?@7DHvruG2x8(kOhU39lF*6oY}Js>j6<0D03Ex6;6H8D4k{Fw#b%7zy*^SQ)*eW
zoS^_yTf`9>l@4eq?DiwXYIaL9az2}FhM{>d4whS;YSMkgj#jx^aX3M%UL;H1K4yc9
z);UR)l(W9KfNS0{f1Y8gU+rlU^XqbBE_KZvHs8L!!%3P;4$g+C_DJPZwk@=ROPBlQ
zyj`y4Z66^6_lRVMP(6wtTSFbb#?BXL!b39fnq#%=0`L+uWK0r-*GVUnoQ?`TinSqS
zv}NHW>mU$>Stxvg9-(^ZIpcS<8amBl%fk<JZ@5a{Q_C!t^Q%^x{<qo>`&LSV1-MsE
zdiTzUX>U@L8<+LZ-1M^vpGS`#;J;hnKiqWx#m|HL_aFS*)`P9>M-Lx<zYX6vw;n$D
z{{Fuun_sUB^`99stt9!k+1YF~oz1y#!S#R9&pk>U+AGG_tdKN%&18FX^T+k=&8_WL
za*_@{rU-Tk-$t+z^YOSyo~EN|KFR)q=jX)`fmr$lg1QWMuq{N1r?yIpGs56E%}=8I
zIIi}E8(&H*<9;fO*`&uHnrAu43fEM73=Vk;e?~`(#=fs%&YMYPZ_!2_W8lUVcd3+j
zc0!}h3p}4VlS$&@OL}OSVGtwrE2;F2-1X8a3ZtXL26j~{o1d}MdS>1*zrL5XxV3~&
zMl{G{JMN1`YPG#WCNoGu_?T?ebp@R#c2cw}f-fEGjrKx1^+mlAE~icPi{8vsZNLZb
zp`C}+-XTV%<)C@k**91i?m*1=4kc-lj(C*4FvOoyCr5?-m6iaL1_&4z+bAX_!7iP#
za%bkcK-VE$%#cu^4?~ovczWP*IE7qLDJ<YvoKLTi1RSEmk10tvo}d*A1&=AnV?<qL
zDI=hSg;$-E<mBkZ=})`I?F7ERIX?PRXTQClJpUOkwv)Z1H$NYDUcNd_UL76mw~tSf
z-NStZ#y>soJb!z71V60op1_kUv}54f?%~f^b?dl&a*`Y!C!N=C4m!{tyx@5E@U+uD
zX(gS*y@R(@yg7k3u+~9x(0ScCh1*V#TKHbd0jxZk9KA?hw~zN;!JoU&I|rT9pXrq^
zI;V&Dx)<=i-Q>;g@o8u8?ZNJG^5*UFo1+tI4ac|NIoUhd?YwU9gJ6FM?@g#4ZF2Hz
z7ldzrxJN%7wvTZD-dLYgTL&GqiSz4VwELZ75Z7>6_S+szB6RWq7|)ybUI)Ll|J;TV
z?H>Q!f@X<V9UY#u|KGQ8A6!rNcVF+mgfTW2%nq#3-rM8$YwY;Z3vB1)?emk<&gt9J
zcJlJ*XrHG2q<#FS&R+ZENpf&>LKFA)q}_s-obKZ5u@#s#xD4N)zdh;T{L!Qzp0<yV
z-%=W76W07Em?4;hUG(A7Tpu0Mm|?Pxj(^5>aWZHrTFFnZ+VDH9`JoK&^mrGi;{+yf
z@6^2$-U{=1>I^nHY`;9{yu_Noc=ZSy`l)k*g{X1yIwyEfhhP5FF1-0I4xbhc`o>=!
zT5i$OCY=|_?*5-T*m=GgTLY3f=?MA2uP1N!Udim^wzzle*1zZHqkeXtbO~Lv`{MQP
z-tkfQ)vbSrAM;UG`Q2W4ezM;^IeL4%*QQny{=MJmb_e-r_Nm)#+IwFfzSVopZ~N^R
zyKfIp&F{bt^7Ejn-Oit#R)BKn-fdot*r4{;qj5IE&bl4?^U<63p){6!zqxsfkJKZO
zzOpIY+zM_%Sa5u@OuC2dQ#*798$+ARtV}NRK6#|GX%~*)Q3ARE&+@-#1L)^%+a-QU
zZI5b(SI$Px1F*E6KX>=EBU?ZI_;B;lfqhi(gKhY-jXAlM6`&uFUc5MIpLU<a4oMz8
zpjQ$-=wzbd?mVL+sUTk>4`)k}&Ig}jREv75H(I7FcWqFC>3^4~=H#huaL0C-|NTeH
zR{sj0iu{in&t*116WZ6(0T#&rkM4gT%Kwk<Kl=Wg{Qvj(+=?pzTR*l$Bs)mY%5P%*
zH?jVkSpQ9||0dS||Fc*x@;i*=@KyWZ4UoSp+()lkIc>!z9c)~#kPr9tGAr58%JPQe
z<Fr{~#c+s0S_QD2^Ye^?x@=42$P4O8HXLiYB%xvAkbQfPQ}qr`h!qaXjb2k3fOYqZ
z1Y}!h19OJqE_pem{499>WAQ<bAg4!?iY$D1lJ<go5HA`>(!(@ntfxuPqvZSmp`Tp2
z(h{?ElR-kP4w)Nz-b}_buM!&P#TcGV<1aHPL2O=6-MgeQ@-$w|(g`MI60kJ^{cVw5
zoIJtl;3~Z)fq*&;-N#n;C@!yQ-ymlQL13X*i>thI2AgKRjG?zAyAKeGQd~Z^Pju)?
z;NAsh(q6*}2VJ4mnZe+Rn?XojBU`^@Qc^p+y<Rq+a<>c$M2;XG8G}LKO*m`EFitNk
z2EUsWZupMY`STKyZaMs5KU2TM+?lqHJvyMo1&f~WQD1@+_-G|ZT?$9xkot&Ws0iPk
z_ij^s0Z@o0uQw$ht%tjVQi{^4sTv@=<s2Py>>-DCdG=ExD2-e2N8Z$&ua@J?Cp2xv
z;ldmx%n*>bYG{DaUd_zzXG_oQ`Z~?5-%u{o`zkHxHY2_c+nTP@D`6{)iK5Sj3<F6R
zqq=q5qV$+-ZJ6ye<!!)=HLYfLk^Hlbm87%YOnmdwR?+~a8<bh1z~ughLpRi>lk$w}
zZ8pK8QWTlmLcbB-^X%DXjC^Ts9I^=KrUeqc{(?1I(D94~9<^ug5_mhniD@*qUOF#P
zB#dx<o#%KV6yX^Ugf3z{clY4%ZFe=KX+I46x*e`{v+3{_=N-<PZ$^AxTeSRa0wAYl
z^k~8<{YUFw{|ujs{y!BT<VNqSy<@Ka|KR@phnt(B|L@VmZ~ni(%cn;D|Nfin@0*R_
zn~mU`jo_P&;G2zL85@DB`4Y4QD!%;<MX_`Qd-<dPy9gR$4rs%3*NUl|PqU#L2ZkJM
z3^Hs>B8FMIB=Fe~iG<FHbn=0-bb)_dqsrJP^tV32F<%Piq=tTSGh9U}S>Zq{+MV*W
zLHVCd6~#gOvqR1(v4Oy<wRc~4f$(0l#EXbk$!6kyDBRN&DWPF(%xz=8eb7cqZfre$
zy4ln=+SIe$jB6t~`H+tjLEfls>}2<K`$eaH03?s?Z8aH?(o6!?l9GTv8vKSD7hV(^
zuWmz0Y2qi@|IM)Q#&9;6=3}bQNag{P89kZ}&lt=Ku3(o5qY<7RC9B-Q&OW7rcJ{h|
z0%mY@+&yR?uF`p$k}}EY6^TThBQvgyG1f%#1NHoM`Uy=9>-KTd2z3Re*qMSbp*@CP
znx4%B`4$O_g7ZO><D@$d(i?$r&>g0qx{7pzMw!`#jySdw2c47CH@ka(?7rUpGgdC5
zvNwCXz=s}e{`iPZ3x(q1Xb;QeVp3c|`vu4X7cI){(?ELc8lIBp`Gp4J=A@RxXsD}&
zMDTK{E%=I=glHg08nC>y4GJ!2%yl<tUG8t6<=6)V1>s<M0e#UfC6|N|(4_6e(7+UJ
zj0MHA2}gAjX3t>U8R0KP5jlaAo4~|{6NHEcM5p&Ro0?NdQ%{8=UpDxUy_cZ!UVv^G
z+;9lZ$SwFaSsSHr6GEVLr*a!*oFMGOF($E5UOmW0AnZ)uv=3}%TuUi`t<<lbefR?z
zg8M^;mA>T#REA71YOAE1(>Le|<=N5YHz^1(SmCKR?d%^-BqPwiol7JZ?yC^g%odAA
z5oL7IEwlftw)+)YM6z7}Iv)}SfcOSL!~>mHtpfWPgUHi<{wbNF0Sxw@*#bn;U#Snu
z()JY33gi5xD-<Q{qnMkuXHv?pJis|~wF<MdW+8OecP1$nxJ*A`1NLX$V-A!K`~>W`
zoA)<{W%TEgYPs0odzfc6Ho4~(42G%^_A?5V$32dr)58olxnzeh=ADy5DO=N+&u|kZ
zsmW5}V_OeS%bcVZx^r0DHMEF*Xwp2PmKtWti~%qGgzv(QsJ5yGPg#rRy0O-zf7hDL
z!5Hs!j7@e1EaFN{dvaf;O_!%MJ<L;ska)~fLj&g(qk}=q2EZWw`XqcoP?d1cPi4!M
zGfHiXQIA}r9MmV?f+(42Z?Le`YTjQJfJs!81R&TR(w%+UGM#h2Q%X(3X_W(!CYl(S
z;I3!u`PC%FdK#b~Gjwl}Y_4yz4Vh$9N(FZ^unZobu#i!2(%Emg{KQQthNnD)b1L@N
zU*92WewJV%cwjuh^h2v4-h?}$?jDhcPDG$0AXK(^yW=KoP%~)l<i<ud=U-lzn9hYL
z4LTC9OiVOsl-sJ5$BQ-W<zzY&!1rnso|zN=nL`gC@bt5#C?X$4DFS^nn9^v7z)-*~
zO5cbQ0a}E=oCr4S*S=C_Y4MUX#_AWYxuvz=w)p7Rh%bKZ4fCl$+p432mzoJ>GN)W!
z3RdGH|EOR^iZV%<PLi=?Y8-<41d>`_W@s)dleZ&e<~dhGxuBzE!eV0BlprK=_7)Qg
zDpmOCm_REr9hkHz1~muG0o`SM5g6)UvPrR#9GSdNt{<zWDDx(2uz`(n(la^-fyG~?
z6QDM#x8`L9>1*s+q$l~OsYk4G!n#5cNCsU?!&W>(YT*(H4d*O^pLY^z1y|oCT5d@Q
zZCF03T<~~8g$AT2aEEr&w%{>f>9L<Jtr|`mdfJWW5Y0HM*b$pBr5Z7@&aHFPvKBt;
zD0T|c3(67S%<k~gs@f{*skU8A@(ZkDLzJi{HfpCteG+bz>N@Oqrp6}OIZ4+PCJHQX
zi}H8*cx5&;8#hG4H6jLIrV6Wk@{*lmm(-O;vA&}q2uIKVv&*`O;w3Q5cY-%*?>!_!
zWIy;+`*80F?K1NCV{hZ*n_=-7bd%>(lH3CX2nQV-KNYlX+joJ7;Sz4zvkKr#1Z`Vo
zjwjxqNI3cv^t5o~5W0jC3JgMiR=EvvbkRwWOeFox>=C$#g}UBtzki}PQ^AhLok`vj
ziMVMmW!VS5vhqJGElxx>)j33^8jMBL#%;o*L)tE;Kt6my4D?pDSI}$~&bSKEVC+iE
zMyHh=b@LSQ)F~ylieo<s)!>m^L7uR<k_O56pJ<#Ov<1C&l5e1j@x=Mn3~Dfbj^7%C
zv9pFj*KsMRA=NeXdFK%j@_Xa!2H)CB`2Tfx$uhODXIy!bl^6Nl#hk?DCS{(Q76IL<
z%*Q=!-Z4!EO~tDFX(t_+sLz(>9R0`<g5Ar^3+1}Y7>V49F|C3NeBvlfK|v^oIS`7g
zsO&HKZq<=IlJ81eRSMTDEk{MGQoFq?LiJU0(%U_<a*ZHFV0u?TX!bswJGxhXBA&GO
zl2^5rNU5%-(-N*`Wbx`g{*zr;w^nkecVSkjS*aEzd{}yR`<c>%xvjDy$(#0pm){*O
zOn00OJlb{F1~0a-NARyt;m*>~O}H?$E^etHM&0vQ2Jdb*1H>B7`UL#qneAJ!JeAvF
zD&!G&naHRW!Bo@R*LV8aAV*7jSBk+#eqHz|AFq{X>E}Qo_IQHKXv-O;%Lr7iYPQTv
zy`7Jr&;F9}4%X?76GS<W4)mTnQqb$I1Uqm3tRo70dt}EN(g=2~X|#f9RAU_!I??B9
zNyR=%voC*Dm)B`Gv{AX2n-QYYYwJ7Yt_5oBmwk}0{NLw32rE}Hebv*Co#M*LQteMY
zSAuQ=-)U4I5#rMyD+E~Wf0<<?-A$2Ss{o~DSppuV19s`t<5Eg)mON=Uc~e=PKueu;
zcMW0UCq|sawqh8Bab|?JH3TMgx4Se$dp+FhA$}`09rAo?`!>@^F@1pssMvFsQ#k}(
zPx(6C4t=>3Ik(#_!=NJM@wvKS%BTDVs$pgUlldG9EZsn0aOD$Up(A}e726$0Iu6EM
zpadgD3tLiw5p5nlNX{64HoFkODYq0V25ew)QrDiTA~Uzz;U~kbi6Wc|{sbs%;tTQe
z+3ft?!4Ydl<kS(BfDA`m2x>6c=9f3%W?c>V+H7%i-b|Pw!fXAWtTpLzXtTN0RH0)e
z?PXs+SBz{!jkrb>P~QcD#sk<Acq|T|&B*UyREbngt2}`czB?!jDfv@+?Zdw%SG_yC
z<{Pjxt83$;T#c`v40X-|20vk2f8SM=or-;lEi1L!O1NJKZ@S0rHwU|W?G_sOD$DJx
zv}@}aj9(&>zPH?n=$(#qp?Rb@vj(ostWksP92keh9#eMolG9uXqDk!fV>V$p@ihgG
zqgu}ATF6Mv9IJ#Cvy!Bf3ktEKo{t1u6Rjd#`*)m9;N+SzoQ~;k-$k-hK(Agg=~IPy
zYPqFucxcx)qDWtCC)Mde_bd$?qx#6k<N9+qqA|!s8Z@UuSDo`e;d?{!g6+VS*4C(7
zj!~G2>q$&aCxmKRFMRyYN0${-@pY@h`F3M|hsUJ(y*^B&Za0?;3(Bb*IoL-7C7LTQ
zi`hVJjuMAPG<8{AIqonlap}|x&#v`Bv0$BH$lf5cZg(a<yUEasVVDj#L)IOB+i)X!
z#c+WPGvx)d6KN_Qx(FWRkK+Ff>;`2+Hq+(yV9;prHp^NcTXzNnXOe@tH1kM?XZ!^X
zm2qtj-$8{a`NogL5WFq_kwdj51i+;uT=Hg=vWS#u)y3+~=<NLqYvX4I&E{@n3qsOf
z6@(~p6VS|?{navvk!LfmZUy@j+ojvxov2O^>Rub}IFT3E9E<FWaP7*bA71zXzpHtR
zs2L|8Ej>cwI>k2d{Z@6y48~oU9=?P{6$NjMGU~Gri4%Lt-VrhWl6Q<_o%$IbtXc_S
zO#!l*S0aT;{8K)a@?}bA*j;MW*^IJ04&tQ*8IdCC`eC@^wBKJ~BV+?hY%?h0k{?5!
zjXz34t(d!zex8^|B}!`Ui|d~THZMJQA2rSZUQ52gsLmcSYl}B}D=!f>yJ6}JB@PT5
z)db>oz{6!ED4h(v284wHVU@YJJK2zhr3WeUZ6m+rUgUBO9dFL|*F1R|8#-LLd)MQ=
z^9CCq)I}jR715>R48(YVsDrESSO(*Do_UVtYfyHcsUPgj0zJwnAG({|>BuIs%*`bU
z#83ilRlYCSuKt!ys-B(t)tn%cFP*(7?loOAcl6}mcEc0xjt*?%BE#g2pXs#WZp~)R
z7CA^|YtCCY^~JTge2O0eC~|R`Sa{GRF_D&7KcyIsv4RTR%p&kFv*FmZnH-Y$uT<J~
zTA(NhRGedb6vnXB#*~$md&%$2d{pr5E0h#ElYRD#AJMtB)%Eqd&G7~nyh2{=vssE?
zz!9QUXfq?pr$N)TO0lM^O~XqZ?%dgbEKwjTX<)>xB;588lXH5NiSO8fJ6yweaw0)4
zn-Zf8WJ=7z#%@b<<k7e|zUl6q<yf@wBou016MCYOYoC7cQp6~a^K5o;LEJ{gV3;a|
zk!8_%FrX9!l*~z{u%4y2Wd@f?UIt#%$8fe{Od>o^NMG9xoz4fv#euZ3#|>9y2IFq_
zFN}lZ(K-nlV^;$9A0sX8O}BG+`uyz+S50%b$H!WKlP&>D;bWA+QG0Wo3embh>&d(C
z`tOs~?>5%T)s+?<9nFvSUvJALV{eVe#wfxow8zR6t5KY!k?CX_l4AvIYx@V%*w1qG
zhhoUNFdl^U)Ra}B_maY5u{v)-h_!?4Q{F2sKxMqlF|YDET(~xE3=r|?w>8#BBXKUq
z|Ct%jXZCIr%fekwi_z@S1Bq&B>b0%#8pmAXMRC#LyE4_Dvt~urWyOyV3rt<|``dgh
z7)!jdp|=!=i$kZtJvMBxw2OkS#S$N*@<-)ij02SI8Cbs?7~m@WyUHm^#Aa@>OyMoW
zx-5k96=4s~#O`NbJh3uAS<A65WNO4V!4{)wafx$_%ivt&cnf=R>%E!SJvf8#Jeyt>
zHh2nTKZycd-@<bu1^MT!m2C2NI4j@}xv-O*1%Xl0q8DzGy5l@^>!PI8b7+NwNG#JL
zic#2pzUyglms7SHmugtDT#(xsjE!Uu%L{w4F?5qT%iLGsG*M5GEa!9u?|T~F=X8d$
zJE)GD+n2|*6>+YiBk3RvMdkAF4zY;7W#*A0vZET7uS`Wl73M@FP>J~AczSIW;ZV6*
z7_~q%glzzs-FAZlYC?Sc_WomGdn7M7?O7)`-4$SrOAHU5(|EPTDKexsGyfbES6Ml|
zcbQ*YW=`OoC*a7W%En@y;SWwITk_ZqYBYEAR$Fwt@3A+(dPRF;=b|51q4ajFvZqLE
zFi2z1b7IUtWLAVT#N&%9A)nGfi96=DrXMyy3{<Dq+F>fj0+eWkZtpk-0i|3UWaCT=
zGpOA@X6lgrSQ4eQVluDtYPsqqIhk|Q2;#R?;$LT*(>Tr9j%n|OLtz!}XT4xmg7+lU
z8|6u?nX|gVxxKdP1NO-r%Yyu^{a8)=a0Ya}Q^r7soF}WZGE>uxmMUn;d9A-8M#j2g
zzMC4wD!ft75Z3EcOFe0ge2j4$YT|*O_}w)%3#7*M8s4HE=K-N{jf|t-G;vM#Tpuom
zWcPPM*+T0-R}IaL9c4)7TAG@c!3hy#A<R<dn0N8;hI?zr@7o5=i?QSUawn1-ao4e^
z7zfZ=)QfX8i|LEVg!VB{&DuygM4lQr;&DDu9;0L*n=`C#3LspWcnur{{wu7W>N{Ft
zgk$;I`$w-8P@_X`7C6?$;R3J3x@LmMBett@HdLk8=$3fEaI%!71H#A1JK<)j>&Wr$
z;mdY#jEfHp*33PBIJR&N_k;D9n4RMuN=pCkZ#=Qct(AuafxK50&B|4+>;WYWS>c}4
zF8(!Us&#{4@7VCE)*YXriL4-!Gj_*cP!kF4*c>|hYPrVamd|pn<h7CPD$Wfhjagzw
zQDDe9?DDWlRYT^3{+xBrPH3`Q!^HU-MknHo4$_lqDEups#_r&F?bw^i(;(KIY2z8u
zWyN#gl^fRy+a+<ube;V#Cesf24$g#vN_lL%q3Weh0O}}&YDBd}usm<!<>tYIWWg^T
zZ(#~IVML@c_}~t58eE+sm7j5aluEXrB{7b<gtnls?9G$2y3QDAD1L35jeu^D8k|?G
zN>Zh@{Jj%hiXZ!$yU#Rq!)l42&HCB<c4{*QqsvFTdC3K=9u3jpzlac78`X;9oQWcH
z=Qk45S{Kzi#iQp2p{?AG`;ZsmYPn4`#FgHL;jPtIQq8ch7UWuqesGx2Pf}~dIj}+W
zvK-tI<nocP!;2MM2_OBv1!luu5p)x#s!jArW$!JYE~>hUprkkuxv4l}jSDSPU6jO3
z+@ZJ>giiunn+Hs4r1iHDezC4xBvM+&{m0DMZJi-XnXxbfZ=+s(Rcd0FSZKS9hD#g1
z?<PmuAO+wuPLGH_tXDfIWTaCTw1H9*CnyryoT(0zOIk>(DfryW6;9CB#%v@9m3KK;
zyS0J<AWYeagDDh^%_~NO_GK(jXb8iyUwmDjNmEzZD#!y!brBQ-sgty(jkx1RYp+dQ
zQO61%{4(p>;X<at?Mc;1QGFi0_eZCM0+W^SldZz$SE7+dphvw+sX{d6Qv&ncIjv$N
zc|H?lnAxPv+*i`$+7<~%I&}oUXX-Rj<t7rV-ANB;=(Iw6j;Vi;f5>zU*7KfyO3}If
zIB4mvWbxiL`Mh`C<X-RRd-2=uuHV(xeieV>uf|3AEAIVuS)^ZiwYpp8+ctc|95Vg;
zF!^=!*WaaY=FFxJvQ?S8_=}<d(fVVq43)3{m`R;N762Sw&k{sV+o3|xi2>Y{uo0@S
zl}<j0D}Z0D4K=hQ=u*&y6XGUZ4uZVH0%DQgup8I#2E`7Db*gbz06)-|QNmX-Z8GV=
zoZMCHiwLd3&Kj5jt7xxANDXcQwy11FD>rHzP6ixnzG^6QydpgoBl~(};?X2JMmlwO
zb;vPm7&*=BG&Q+A%@&sg5XN^do0AArRUQT?kwb<utkSZ|=v5PO2Iwvq%@1p|*Q|k_
zr@g6xi1OGLtpcs3k<twh)_E=jk*iT6jHT6&1y76mjxQ1Yv>98#mCY3&ekH@izOpjT
zRrUO?dWV`eHOVgEbeV)Ko_cnc0jFtNT9>@hln@^ItrK!=YGWWu5=Mr!BEeO_?8~0$
zK=K;0G%+|Bx|6c=sdu)%U}4}K5j$ESxS@u{RmZTMl$1;*D%GT^Di@PaF>z?(%8Bvd
zL^XMkGC(Q66Q*c2RBx$nVt(#YslJI1^^&|_p3Dcb-R)|?l?bu{7>X^e7sE<%JW$YX
z_$Y|NSal=#d5*wuTEkDJBXy7YoiHNmT}K(&c@{Jm21;9T+x+Yl)~%TWA)m0VXe>|6
z=cgYsH{#hqY!Y)c41K$&g(q~HA&cxe&npg75&W!9I=La}4`Y8~dpotuUo&<Y&dDWc
zvmfB(pH5O2vj?l}F>*yP46_D<F+Y1+yvQR{rQH+F1nC&=soa7e8!;{!Zes7{e<+y=
zW*`z3UPBK=6Sw?tYO6=b1##eKaqOrk?%s<8I~qyfdbsHmxBxXF?~X|fmiZPT-#dgH
zyRmnMh^t@XpzQG0k~hvmflf5cME4=?NHQ)qXhjW0Si&<Jah-~h+ge62V1M4--v<eT
zF@#j=?s3T&&S2>x<DtT#z}N^N2~C>QY+Sb7=E!nHkV^J-?mOIjf4X!61|{SJU-!uk
zU@^R(6oir~)(xe>ms+SPEaaK<35JyCZA4+6W9?a-SGh1zKF^xRVu4?7I@M?6_dGT4
z4mYIJr{x&ACGmke^sgGG^(Wy~KbrtH)D}mw9F5o}&YB1+DiT}7CTDN@>YCc*rv58~
z15=qGsOsnGWU0rE9n0zULYr5`;zjG*SBN^bd#!DUmaj@rVo43uNK5Qu9HJJ@GFdPq
zuigEO(Qg#<mXFY&<rm8hd0^Nflj9qv_*Pk?MpRp+5|=cm<{8beIHRaOEwb)_(Xo{4
z?yTC_E9RrWMi{BZysL4%`a#Qv%_GCDPlgWCr{$2S-tW%C7x*Npe}Vr|xw-3q)O(i_
zBHTW`rQ{Mv$u!ZHM#-y0zAhy_RJMGOfC7|qhi`4MHn-(HQVITY<K0RprZ?Eri=XpO
zwIH<DI~-Lmw>pr=i&|ov^l8>R2CAx9bQ-@Pf_UCYec@U;6q0k~MIp~JOwMOf%m9~&
z{EcN2F3ASn*Jro`tCw#O+ZKPsNh%TIyF;%E;@TWCK(n+^!9=Qg5A$-Ef~r-Ks&&#m
zPL0B5gOB<qy$h6^sN{((WjJnREoS$0Z<8}9LRb*}EJFqO@iP|hF;cf`^p5r5Hk#Z~
z2{pDpV{>3&X1@m(64MyaIc1I?GvKD-{N%O7xI7!T!?LcMH%_H-E65qV8posalVhP(
zi=#D-2pnP5@_4suvs(}Ces|aJMSjyS#`Z{q{gryOp7(#XcE?{iG-K;m3eJFkH#Rop
zw?p~u@K-f_{Q5ifPn*?{0^x*a9mM)a*1nc03(tl$TlC$vFbEUX<)DF-EvYSY2It$5
z;t-aZ^w<dMXV#s@n@-={H@OxoeVc3-<P>V$q(H(9bBFAK%3+y~C6uj<^9+pMK@#af
zkOV=zN;DTTXkq%E<dIs1#ySUc1dOxml}^<{Zx_${yvXct(ABVmlN2F6&8@~pWiuJb
z3G-O(T%626a9~CXLc>>pu*_)$6*3Bv1H!}rx^acbU`1h~i%LssuERKQ|9GyGq^U(=
zu66ftZ2P*^&NqfjJc4WQK4ZgxsW?hQ>#59Pj7@9NSXQ~Yxnfg)nztl>(f)pSD?I1F
zWGt2O++0Ok_&DcW%j2A!?D?l9Dj4hgm_RrtQ*X~%ducWC#7?P@f?T=#EV=*04LrCH
zZGAF)LXO0{z$(^}H^4Up1H`YMb#}>F^`k;NP86C%*y+iiF%BfflqiIos%6tli5+pJ
zU6-YE=_wMFC6k#Cw?U@V6N>F-F3dFD-EtS8j-d5XCu)FIS7r+)R6v6Sj3bz{>U~Ke
zL;#y(GW=R9vca`dkWUZQ%8l>R;IXESBXjOB5iJO=2@(<F*<sZ_iAMdaP7WHqB)`0j
zg_Ds^2;*8e1wA_ZEn*Y=<Y;j15;;85r6@sq@TasCznZPqM<GTlYb!Qn@(**G8x`H*
z2ksBG$n~=r<*#2bfwIxk0d00%E7a=U<j<$ao!43pEf_7nW;)4-Smy{Dy11qn;RA?d
zuzT8m`Ez%z_U10|HkkQOPngpB*(W`)n1X@CUhn?-pnZ7nb>~p0ZjxajiEF>YcGEG;
z@uw~}|3o(9mK3og)i$}hECv<tVaeGn(a)NYdOq|J1t@TKJRV@UDxAb;DIArt{P293
zPsLF5DIbDnoDOMB*6hg#Jw6Sc-E5&pjGhu4f|^cA60vO!n;4?nfXVWlb_UbbbCmhY
zitwa{YiT<_Og{~T3U|*bE>YgmLh$>K=B(FRd=fx6=Y_a@wL1l2b9u9z;%uLheY|m4
zgpNiMcHz>~WR)ISRTO+g*QGqu&l+3W?_*QDlM6T?OisMtC$1+^b5Uk!tL`$5XPYyJ
zu+Krfc-lkg2n|z&UaaqUgwITUVt}wQt~Qd_2_q|<k~=oa_LKs^iR4#hTB*q0s2HuI
zEs|oll}D5|u*%R1B^sS&S}>2pUQ*db`H)2GtMr;;wbm@3C&+6IB9`Y;D$vNuQ^PDB
zIj@r0AP@z1(Q6S9XDQKY&N#z1znJG1laARxY?EBE$OV(;sw7&OXK1;^{cN6~`ijT`
zbRMl=n17+j^kj`#!<zVm&jSl0Pqx=)Wmzss6kgMZH3GF5;I!$Zrl6-6$8N*P*@&E<
zYcZ{@CI|WmrnGS!`7fdHb`-_0bt)S)fz2lgL)vU}Gu7M6OU%}@LF6WW)<ol@vqrXd
zLuOc8z2A({AjK3+W|@h0z=`2`?dKG5!g_5sDrOg#W@aR+oB_9O916_>Zyw@{9_~6Y
z)QTU80u$+RUbOLSLK+u^uq)~@AEQphge+tFLAEP$Km+bgFQz1lO?>x=3$M~hxKF<R
zr)FO15H<69*1P1Wtf@0&v|XL%%OMvEH4)&I(V3)6fj~Kv?JSi>)t-ikB|Y-=a3sn!
zr*fQ*KO6TRjn8gB+-(v5v-3=jg2-OmxFzBIB$_jMAuDu)`76vg!N7jwuojn{yyBUx
zwH!YF5wS+{*&Vrq&WqsaH_yA0fUiE#f<1Fd>PcKKF*o_5jZF#*?tT_IS{&)tPh<ZL
zfzSUF20rW1l<rJi`2zUdCB`5pAbLFwa_m#32Vb8QduqMk#D+1qYErM=!6=;uR{PM|
zvgd^QWS@EzH5-UVBoR@NGHw{yx30ec0|AI4V2CCN@2<YRiRj~adHzs?e%PahdcrcN
zhik0##&?kiI1Dv#qmE$`{<`^@WFssZ#b;wMilr7Z^d&g&cL9Nubu;~D^H;)g{Fc7l
z7iWjOL_T2nI?9l7(s(L!Sb=uOPdssO(@z?_6M@#1SN~L5<BV!}N}yMtkTaxf%3MRx
zN`L0VBpL&pPZ>0RT?=p7op!2`R9Jwe8o2}P;FzAO566kb;&?1*=h;g2so(*Jnw}{+
z`FEJ@R&yOC#(Xr(qJuXuDX<cF5X)kuvfbqL61xeX4I-C#!7L^EqVU|@2sacz)QoNR
zL(D?5i4>$A>V|PE%2SwN#5*Yi@8Z3TJ?@~J1n3RPSO7`TiR?L$y&lhb2<=40xyE06
zf$eTZI%j<J7#8q$?wsSZUc%Yx(qILh!o1Rk%2x;InN@#bv+6H(Zqr`^z@$0v#9`JC
zaeiM(R`;CWLG*_^sjFj2!@Xjom<XCddcd6A2qsu3foC!sX+ZC}ljDGaw-oKKk&8jJ
zIk&^UCysPhWdQe4ECxX2h;hham=%7=vN4LB#rPVJ+i}w11PK}?MQf226*C8$uDvjH
ze2V!HEu=IYN>R+un-n9UejlIbR>K!Vgcs`7vt%4FaW_t|mQWY$s~Tr4jk$|4ACY$s
z%PvQxfB9=sFrXEMRwC~%v;X@VuOPpfz9W9LVs!Ij*@XJFgnUBkY9!Qw-@>KaT=x%|
z?|GzEC%!zyC<&eeh;99`=RQ|g3lE2CK<*bwT0C>b*b}p!R)s6-Nld`P56!VA^Pu8J
z${pFJ@+qdOfHtT}#F|XR($}Y|C2>s*_@w~$km-^4EZ4Qhvo{P742KfREj;low(L|2
zeSNOXCAL!y8V-+Ky?YsVOk~<*J0{Tpi6y7rwh?YB&G@vj2GJR-KS>rmsBd0-mTdDj
zvuPvj9I8APkTN4$NjvN7%>}2L2v9LBwuNUm`lTZNyYSR_T~|yv8rw3*4=1I3qj2j$
z$>ZsS#VuloW6)~`<0`kPkC2h(YogL)0eHzBI&xZx>(+KZf$SI7vcr#I5Miw|y8^(*
zqAaZX%@MMLS4U-9T@(-;?s*WOSTvz38ATNM`q;#AOIltJda{&oSTFlpITW+&y4DO*
zd;ZPqqu<KiFX`&dCGJ;fxx=(4w(5ytJ-J9HXXyo+E(QZZi&Yz(dR+u3Oh0Qj$BGa;
zhUw_qNP;>uF&WbXC6fEsBQ&G;1d|;jFS9-fpd?M+4IkV|wkWE;^0QLmc0}qtJ=#Bd
zY-TBq%#$}BUu}FFaZ`H%ZK2N^KR3!@F;DS9=0keo@~EvA5n;p(ZmiZOu}_N!Rz9fg
zQ`it3*qW(!QFvKup0(+74EBhAVVk7PxdFig`KC0bSkV!uKo%Y<QN`R%S*Qx{64-;E
zUrXgy$1WUt8e5JX*RSU4+K$mAi!!H~myOV98xzN@&cESUhS9=He>s<peVA<qe*p5_
zq^Qh!$yW%w<+NdJ+5CkU!JBf|Qr=>VcC&u|$@?>-dZWK-4SbL{-}CxA%|3bT|Gtxt
zqrthye{VSTRNkA-$Kvd#j0p^ZxJLmH>X16gvdHY5tGlwFA=n2@*I6-}2JKyf;5M+X
zty9knHE~vVT$H&B5RU0$8iLT6z=D57Pz-Wy!q&$=k~=0j5?CNYRkYQGrRFS_*0|;v
zQ^D;vB?!DC=P<6LiH<B%@4UvV!({X+?HiOy3hID?qyuyr+j$^{N2M4|EWi+mH=8!N
zolR5Zirqy{I1(?D1QPhMGl@#cE|jMrKIr6`iRBWv>Kce}S`cXawt7TM5waYEGlAA4
z)pE>Efa$}Lf4%h`cz3T7_eTZ+AQ#zG4Y_Z9s|kW?PNO(9JKPEUGIQviP;Bsko<dXH
zQUnzUk78ULJaOSxf>C{ztgfx<4_o}he{ZhFj$Oa-%Q<6Y!^x>NPbEA^orDA}r^r?M
zS(60D;Ecvk5R&iY{oV$0!&WhxAG+CEVa~eJB+)_Uu#$LzR@|xw597`vp1Ozz0TV@Z
z-^T6K=(SeL>(Mm*#M`SSK2X|MerSsZKVS|ERk=#ZH^7mAF!ZxQ78VtC7}WY!om5YK
z3f-GYMa|Z_mY+OQs78*;s<P`!myjeX8QI^GrzHFDMAb4wx}fN9<2v9Qm7@N(YJRCF
zsk-rORp%xT6(xr_=62-SvK^_up)%r&Y<d9l3jY5E2)SHt*6_xbJJl`qQnP4NL9nOK
zZ7$vIfxFgFu!s~-t983+5<^18zy~EyWqTU!gLaupQCs{hMSqoPitVtt5Vr6+jReFX
z%q7_X9`fI~!0*HbXgI(G^8U`RPeH%>|5rW`F<Tlr=>+=Pn|AgWumKXWH=Ab5FT3nt
zVejE8{tjD@q@MX(@1Edzu^4>NdEGgEjG8dwlBFC(Yht1WceTd>P*()25(*AEhb?bz
zuFcm7S`vDeVnz*SPML_WENs%mLi+Jv901nRINR*gI2*A{V|-+ei>=aVG(c-3ybWez
zR^nh&f*i{}5l)VFsF81g3J)qi?4c%u(qPV57;qLgs<FT}{w%g<zu+XJ7xO{36cyJn
zVebD;&M~5!uYHX9GJ9~Vx6hnCpptWCFN_Kev0tf}qIuX(6u$qyp!vua@=ZsAJLeoh
zsFkFQG8PMkS)N~+rT#KjrO(#QYFxSxCd(xNrb_5xd5JlD8$4(ja~PUZ?T-%%6A&M)
zV3ct#5(pLu0!*h8j-u7<(6ETiPq4r^vDfTzeYZ=-!DyT@+*bPgJ$ldi9lE)Q4J)kM
zm-e?ucn{2}#rpm0uPBP3eFli@pwm7)?RNINyGJjoSyZS?A{*~1`j<2T)J}iGL%1)f
z$2jAX@PIZqO6qWJ;*C>|7zPpg9@~cuJGml^#dU=xrSSF-2!hSoXp?Le4=T5@d_-`k
z(3w&1+N<m2#VH$stU~Dbf;w_ju|?xk4YKEO9N`6wikN>aV3BuOOxV3$5v6Ldp_pKC
z0?a9_<odUmC-S$@zlkYN2hcc+$X~>~>!J@a!wTce5tm4Y!#!#lD#4k~r&Wif<qwPJ
ztmEXnsaV0HgYFT=#U<Yh#(Y!sDbw++%qmS%sWGA?n4bIt24-i@86QNk!mk*3=*O^{
z<?)Db8Oy1cnS>8a5SR%!Pt~P7Cnn*rkhMqcA&_Dg_Omubz+>S;7P%T~9gCuy1|bpE
zHm6#magm)lrQp=uT1tJLi)?CLCt^Y;Th}D}zga%XD5AcYAS!4<r5x3EF7G3^N|O>5
z46>r6=KzVUI(1?(tYT6O*eq$v&~30#44j4`gg6z*6oe$`K%4x7>D}V%$!wwv2FLXV
zvl6&Mv&H$OS9z(W4xk$xd?uMenxkr8AQ|PxE`22B2h616O}UwNMjGa8nI<;mrKYU}
z6O;_EwV5Z8%M$f&Z)$C9Y&7}K3i?0)%rOmqGwAHy_nNuW*>Byk3EH%$*O<Jx0doz*
zBJ4%{1d(JEki13#7f-zVB!5A@fE<${SS#*rVOJ@P!|yF&5OLo09c}N9X^$qvYZFm(
zffrmMrC%2_QY84yM&MKvAcFUq=RVW7&(T#t=b-IR^GQ%w%3rQvh1belodUjhX^kk>
zD<m`$Zxhg5+)Lom9qDqDbW{!u)`F#6YWyCC5#17YYHL=EoYGkrZs{!6oPsh26rO1L
zTLAc1=Ic9j4<{hg-8IL%cPkevbC{feb<4TxmKz%N7xV@0pq}8JbNV5-aW8C{peNCr
zwqiF~D3}ukfgo1cQ&`gwRNck)myL}t2~%1~QgH~tTL{X=pl?(d38Y5(10ftLNemj9
zF0Wa6`fR0=JMOPv^%$0oT%7wW9RuWq_qC5+=<A?6l@7QWI{IYv0A23M`0@&!&{V;{
zI#KlXH%*h0)}l$0`@U?7{^N_MDEj0r`(Iu^QM4ta0Dp7pI52=7>(Zmb!1P+2O2Qc)
z6<1E}4s1Y>p-dxt;e*gp=>Y#xmou!=4gY;Yn`qybo^>*H&FS0XgI>^zZShr>dZb$3
zRsfix{U^)`^b$`comL^X&~`v6fVW)!C`k%FKb>Hub4PwKd24>;_8JvtNC&~w8vZVU
zeAcDxAJO$k2PgU2nm=py@D{q@b9)Q^Bt43=8;dbRqpB>lL%$()QerDZ;6zvyek^83
zg$@{rNx_|MDJd(5RpAuvWQZx<lvuXGMkyopW5@<7dn`n`_QAE}<(zmP-DOJEOp(MT
z9Wt$A+v;<-l`hegWs(E!UUiErn~#NH_8;b&c?%x)@F4l#2qvVGK*&+<Rf?Y1W_+0x
zGW(JibuNbN7;n3-pnBpl5^3Kr%2MGJ8X(C(+WPCsq7v+}rf8Y?x0b!MOiA`HYAs%(
z-88jC(vREhZ|X{2PEforyfdFUZ>cQ#PwI@T%f(?hrbvaCiV@$l<Un7uT%deRg&O|D
zspZwr5OK%A<Jq>v+hFuU?SSDa@$hKbk#!b}uTa_E>ErSx?#+inVN7iv2NJ7>j;aOk
zZ%R2!n=XE9p?GIvetX4ur?J}7@pUsnb>x-J%r~7mOnk1l!J841@m<h4^|A4ZI4Ua6
zx-hXVlM)u}V$Mqkj!rQZBo8fYNuPAjXa})Q)8Q@(2B?yatmkfZlV#OyG^#IXUrSdk
zi8xj0!!@C!aS?SYk26^lm_mo=YkWW5^c8;SGiGQpQhNY_)H0?Vqu?1^msuxQKH+no
ze4s|2yySZJoKq;$CCQW3WI__)zMPX?6lBILCRgdC?{F_8YdLs{{^|#SjtF_-pjw37
zzGc!pqpT35-9!*+7w^!ec$LmXOpuEJ)-K1|c(!nF@N`WyQ9lCqF*Sw3{IOO`Ocmz=
zU?eskf=0%g!sK|X*;Gbfh51`<JL=Tg2f6U1ocCONpkF=EW1X<em&A%s__w%PVf3~d
zq~Xt%U%n1U`CLi2QVEw6o#rwYO^U4(o@x_kznZWovVGkcI{S|kMgh{=Q<yzw5nj)-
z=~b3htGDTAP0Mc38KihhmFZxp8BcQvCW0+4cfay9RNg^3tH0+<ssP}jIu<~H2i8b<
zq7_BSIE~>K;lhzk0<nfDltyG>5q`tPsz<#3!er1j2fn>l09}sBdQC0Qq`pXotyiaQ
zFLs`7MwS6x=^`{?5g|6l`-R8^(9l$;3l~8Y%N9vu>Ou|IW8UFS(Rqx;j^q*;(?ji_
zLVJ=sccRR6nPkw)gVi3@^h#}?kv_p;5^V)P#_HiHmkO#-a5>1TAmo1d-LMvh0n@+n
z^JH1-ukCJ??8nndbUV;0#d{%R-l8%8iK36l0IB&V(XoDBZfD(SWuE@SsAV1vKmA58
z(J}ufdWkVNi^YfBspSIm^z*WZLTT=c!j&^d^$0kVjBUeLB^EWI^6$+#qlmlHqN}}q
zw&dCNhuZb>Kh81r*!g2^ySh$w*yXl&e=pmNb^@27%PPgQ<N?tR6-l^@Fk6HIk~7Hv
zT`Fxw*>@qd%=}M{*+ABPg#?0?n=}}=Q{u<E8l-N61VQ77F5u*~g&@cnQWi#4i|J8T
zw$fsxr8R=+WYiW^Sr**fE<g;bfHf9-&zI{g_M2<4XtV1ks33>IHIr-O9l1yLlE9+j
zWIwa>%qT&m_}k!!!gu}<PYNwy5)Q;6-RS+YA(9koou}l<Vcepa$4fwIDL@KFz@4Cg
zAr~Xq*U4qin*7bP>v+=}6*yU~6jDY9Ea~l~5duAP4>rd6-X*@#l%H-TenDf<8>acd
z3!7qZUXMz!re!%BN^_%v$Z=ZCsQRB1u!U&BL_!-ip(Z9yCgw5>B6QYhpj0&>yg~z~
zE5@-%H*3~8|3r5UY*3{dV%&pvX??@=Ms<Tm^b~EGe&A&;fbADfsylqE9JX>-U1UhS
zZ&JN!sSYj6=Xqb7`H#I%XPqAAU?=;&W#6U#aRUzK*@;8w?8g)oX!kJhTM4_9U6t&<
z=}=@nT|*QNLyJwJ@k=S=;}i@QD=I@u^F9$)PY`PO9G3!hlD;>R*TATYkLop&pKp<s
zRpJlrnbFx-?j%Dr9%Mph=cq>t>CL1D;4NdWWhUaV4ZK7dI=r`OsL?*Qc$4Ebvh8_u
zF<PApPc%T{k3;S9$|C%9MnI-wfizs>N}>}mWq64B=z{jP&H|a^3U{mKn0z5gwo$}L
zY>DFFbgVV(g$bsOEiMR3kjd5^9s{>!f|Tec;VJ3tlTBOy$w;bH#M2Zduv5iAlsZ8e
zx14g+Z)&OtxrO2{$T_1Rmnbjfquzupxms}6_!OqLf_H#VUGYvKUUxPTPp2t|^pnOs
z=$jwAIq>srf-V%&l2}Xi06lJ-rgo6d@ZKeAO*9(XeD}hknu-#&X5bJ&Fa~o3t6Gao
zOu^)M{aLbAO=@r>NZ3Cp5i7wOwCZq#T^~#(C?tmX>Y%-vz$iwraY7{gkPH|8HI}^4
z;l7@s(}X-HB&`YyHE2;tbkRkKm5hxdF~KyhyCp2+fJ<)VLsj&yS*j&pPZc!Xp??u}
zkQ1vDsgms=3oX4se!&|XqUm(6YI&7~@uJi8brx?-n>tq3>vCx-z5I#W2bMmhqDIMV
z%yrOg%gQ#z+L(=;qB{{~I1;;KO)GcYU|alPIM*}7k?VqAB?!d7t>$HFTe{;!)4Bt3
z1Efm@Pm0Dw=Pf&{(sOFHrK7eJycoku^8K_H1^p!MjgXa#bPosIMFC4q!bF<%fU44b
z#Q7vn93d6pjO0yl&H`m1^#&lC!@{a;L)8;Nj>;TF$u;vJLbYhVK+q<-`?A3~#nR2j
z>^kHc4=_8u54UV>Z!rNy1I}^cE9bM4kO8)mC^QuZ_wDg&%UNiUWFQi@9FO*v&N<#o
zqJ#w~Og5d^$VN`N%zd14GC+L-p3n?JAGsIM??_Pu4tF&A#wdc}9}K(9>#6S!l3y$D
zw<v$}iN6(x*G{#BN=Ak5%~(DKw2D~){YoZ<x1nMpm3h?Jy>@_G3wGL_az0L(D)e-Y
zGVwPspcVwkvvLX=XVZ=z*x+ip8qyaA%>Y$Es=tsWvIZDy4U3HQo45Y@Wh+5Jqx2s=
z#pX=??Yg<AKDcx5Rb#Mc2|I<}q@%poSlI)Wem0&O;ugSJ*o5B=2D4UjHp7@ws_l~Z
zS6YdU12?E_P5X}cK+O{Ia<tJmWbmZ~!;bNyirI7wF9fyj9Fb|S30@-AGPexEpCC@q
znm!1;Vbn)s=+j}jv;MTq{%=Pf0_DC`;kL{%h!#7Bzl<lvv;giYHF%EOZw~B&Ywn^!
z{I5V+`FpV>%L_cfe&Buy4C;J1#X7{<a6G+kG+Qg*y<PwA?MjP1!7Xvts)#7>dp;X{
zIO&&-UQ1fz`C=l>ru%4KnPl~SqZ`-yli#P8VGnF?6MUuDWjr_F92uk&RmajZ6iuy)
zh(twUa$HZ23fC2s!;Oo^_}#NIJD<@KaTT}m08~9TT5+8oI%lLHoey+1fwo{y=n|)f
zBXoh8wAlOz<8Ys896kR}Op@*#zHH5(v09sNFqLL{c1xoFayB513r3%P!tuer`19Vu
zZs#@H6aEZp&;HBfqqlD~!?|UuC`)}GQtqkCeccc0BuAk$sQpB_rNyX(nL>zGiAR;p
zM%WYM^nztV4BjFA$Y^{dc_6+W_fGm#hHUbUHp2J0<jHG7xp9I8{W4j*m=v?IUZX#-
z(6#=6;r)E?;qKlaleG~@0ZtZ}6Hj}QjW{L^W>UJy<_!$`=X_W!SC;o-<%%g~;-=*#
z&{A0OSRQ@~{oF~OQjc~J+KMM_2hMbaxJgbsuiL<IpmjLh;cCBJpN;ZQ>uA~D(YEAs
z+&(@2dGF}$;i+O|B`=PS_u9#SzCAewB0Siof3V$9k+udGxfd3Ow}n?tGo=-v`=tMj
z_FZT@@XP?~iR(-dO$?|oUyc!dZ~}{6`8=EUE(77rmMi3CAqa@A2NLT+e^JtyU@v^?
z4N@(o#JA!_m{8}ZZT!isw{zh>USNtoAzm$85tn{_N7rF}hsZ=K#>TE`VgNPz!0BDi
zidzX?cJ6qHcc|1uzdUlD!BurGeIM^5vKU25kv@SKl4A@dc|6=6{ou3?oM&?F1e4GW
zKi>QuT8Y)pySplcc;H^#axNk(_C~+8?Oa8v$-nBXQiQ$Up@lV-RGXez3xVc=)m#vl
zXfz%0d5Re9XABdlg);|N>2;~bR}{pRq^E)*NCo^pWxW}l3~1E@rQfrY<^q1tP=o_x
zzvXt6Y?vBZJ7p^wd5aMvfSAndw+E-4d+k5B_mZngIv!J;Waeb*E1WVXilM%XDjKy1
zQ&p7Zy8Z?-(GXevwHj@$9l|i-hNR>3X4(_>--G2oBhVFGht}4E)|=y_H@h!)Puqx$
z@vHp{MH-=ne%1p~`+N_{qamBD_R{zDmwv3jv_&oQ(Pp?ZO}vC_Q@XJnGKHQpYz9Fp
z!NTo$3<j%VD%f!v6kQ^_v~w~Vlgi-{o)HWe@tBz$7Eu?YlQBKJ$6RJAFA;56X;HYS
zaAt+{EDI_f2EwamSO1y&aMC6Q?wlFOf_8|d->N$yU*dhf1b2fY(uggVBR{NV$n;dm
zkQFH>^Y`|4m091fW7ZG8v4OuA8=!90uz`nP#swbSV9)Z7Q8ZSm`oR-sHz>=Y<lkAm
zMK{<sEL)VL=gFLeRb-7^f6FYfyiHIuL>s_aKD(BUE1Pi-UVPf#J32gh`?`IczzpJI
zl(Q`P_wTnJV5F6|cZ1s_n^@mXf7Wj2J-KU7=BQ?0S0vrCZ&=&pt8Q$bKyCVK?QmBo
zg0A;x<A&G!Z@c`TcbA`J62;+&_C~?8X3q&b#tPRgv)Wr_i!WU?yOJ+TQSDv^awzRc
ziK}PBI;|O&=TgiWu4GHnDwa9pun(?gOofFwFpG*e%S~P}Wdb92DkHB#<E!dSQExqE
zIU_(<mI{|qhNiXZOq)z+Yso5gcQv8<w^KpP@$_fH-eH&?2FQ^<yWJBJqd)7hMy}cV
zqO4U@_G2}kU1;~Jb4GI9^hxLwQ?skx8vt3&Mt4Jg*pE=UIN_)mKBgklFvzLYS95%i
zqGV(U8>ke+Z`G72jx-SLm{M#ISa?dSOqoK(CU;&6a#GRh4Gnk0U6PekdQ<5|yQZbs
z9dYi8VaC>VGvt;=Wx&Ubl}MA_=!^<A^$D9^et#p`)$({TBMLQgW(_UpCN)lzbY*h%
z?S-4vOL)HY(%f=-ciGRf%k*Q8$VVxa<r)@!-iTuyF?7N}KadYwag)R=e*DvMm(JD4
z$v#I6h(+v8`#?!XVm%~@R4R9^++Sg{oQD%+KEjhtn8rr%&g0#m+J|rsv`@^7Ddaz$
zOmG;mar-I1+t~UvcmaQnzmz_HrTh8~fZ04^E8LjVoFdUP#+)P`S_)B&db+Gel{wA9
zO42wnonOP^CQ=&>7Wy*3K%yJ~eGHO8agq1D9iF?O{J?U?`Kr27%yGb_d(I2xX-&cL
zoK9vvm=#*D^W1_i;=O3@#^**-)wl@soa*5Tx4<bvHbg`SL1PeAWROr9EE^OamlP|M
zq96CM8_1-#w_DbHrshG%KwH^Wgt-J=xX17IG&YB~@f`W^8dQGHnXM}>Sw0>kt_K2&
zic`*X8`~lfM5aa?4pk!VUYeXk7iV&uQ=Ar2gW?RMoI(){*guXJg7=BEf)gU0#EG=i
zPNbG9m(-c7hEn;p<q2L5v0>;e9T~qY&I+1ru~CA5V=2i*FQs%I(d0x=1Ex64-6b}I
zPZKl?kscZJe}ZO?@pMNePNi93A`Pz+CjsDj1#E@uns@0U>rJ@W8_6pPfYS;07&Iky
z&+Agq2ikzh8V9yWed8Qiju0@mgZ%FdgW#G0%lGPi%rr1XnRb-L-IDaO4HEzVoysU?
z6%L#<ww^xSY#LU9er1m(2T@ee!;PBu?5nBKt)|}|O@KPFsO!XbYuyl$kISJ$?p)Wa
zSDlm7qvM~cOWQimdk6rCTM1=YO9tqtADAHu@?CUoEAF+WK;fiCk`N6<T*Pi7KWMks
zthiue(OQl!*Fna+2HRQnF!rj^^bWF-1k~CDUg?HjU+9dlaqF7FIi7dROS)o0v906f
zQGp>vlFnnJjSV?kO-w<Hc%tz%DL+V7yq;PJ5p~^SFm+tVT+Lyri64=~*{S2kbFeez
z#5O?UWiiMG*K5op@~H_*EUrdO6{nn3i|Dx}N4gu@arrCqv4ZK#)xEUKC>MyTRXS2C
z#n;laxLvL@B$N@zV?(WMye5?-`F;=IkNGEJrA1~|wtyGa;8ly7&r5r)k`VzBjjzST
zdy`$OADt>ctSg$V;j<Gbhb^FKbwjI{_aGZJdUFDpIB>xZhC`O{?m2*)80AqP9^!|k
z@j58!BLo@=H<frfvtGK@O^I22Q(%Oo<jf$6$iKyL1UdbBX*xqCj}2hI*`q?G&>=nx
zuBy4QM#XkP(~OFh_l=@Ks&YT;hYhH5;)p)hCCkB6(X2A!6wN3<@qp0Xg^(DH=~dzC
zw<z12%oKJFo*GRj_kgrH1D`bx_K_0j8A&UewX!amCTSj24OM#F#oLJ(TiZ@>P&G;e
zDa(z)j5Oe6v<1<cZG};u->Enhtn--*1?w)0oC8rTSm#rR1&bSLF$S#jaidK3o>O=Y
zOb9k1k1lmTzb*C-pL#myRnfQQDh(R8;p^Ql{h<8ThzXNTw#wwCykHI3{8~l5HVwIL
zTB(~|LIOWd2=2B3-#NijW7N0U@Iut0HJgEZC7BZGD6~enRkhRpFelkQJ@ezTaVBga
zdZ2GrEicAH<+kBDp+xiANKOh#M5V%XqG@PRh!8vpQ&1?xLZx8IoNyKlmayny@|t5q
z8D&>)8)o)vIrMGeMDzB{m%&QhiQ`I4$d`b%5K?kB;vmspY(rz%JY(#}ioqVTUdNC`
zR$S1er;`+<+~UJ*OtCbpaDzrX1E+<B9ui)A1yp3wvOrfQ6-nW*YB3CLSWIFntkcHA
z3ynZXFe?Hg9IZ$<r(kl7u&l@+lk^izo<y6=0XfbFEzW1B)xp%O7QWjJFn3>~?_c^o
zHiTo*tHOnrlGFs?PSvUMFnLxd_iR=&7+CahRgW>;OV&oG5li!SlZS1<g0bn8aA(f_
zO|594SmY~3EBSdW>DKHQXV#v@OW^Q=V;%=BH$_KP^KOMYV4`0D$<0~I82*Th9zqS>
zrj~$@zCiskR+Ygdk%VD6u{DiQj;yF72wF1+Y#Ac?VKz<C02fVJ_TP*CE6)d3z154-
z!E&%AereRqWf*Z2FFuAbeti!(WmF-bKu3<u<c;@*`@DnUS0$(|WXF*WT1RSb#4s(v
zWjZ)t7mGNYHY^a!c{(m&^8f>^)Lg2fG8q3UZV8rT<7J7gM()j##0jR8i@Bi)6);yC
zR6Jy{1@Btl0jY=_v}{J8pRCuGUf8PHaGnp2?p!8=U9~Ycb)G8Y5RK7d2~wHf>A}1?
z8X)u)@2^PvPW*RGB+BBEE9;#bgU>}$ta90OgNGey+`Y&A;m7goucqL&nC?={co~e*
zqo$TbGG@eWhgWJ}6q7lbgX^uN;<FIDs<=bhfx=1d6A6|ya@3k5rl~bT0vu2(75^BS
z*~oNfEEXnF-f2oWg=64wnP7`UG&NEQon&faAx^TuzHAau2>2uwcc$@3sL)C#W|Dc=
z%x-p)mR;aeF%$8GZY0msQZjPA7t_E>Nf?q;YCi^=;;t$Y&+*#V@SVKGTx<_b<+kG_
zv6ANjxY{@qQ69Ak@zzjZC}E9U5S*iA03j6GQCFy9cV_Pq2zzpigipH$W;J&6-!f{#
zqX;7(JRnT6GP{fGkbsIW7%ZAY<Ce}^sFe07h+>k8KrzSMTCqrd1?y{_jn&DzGKSEJ
z7(#uapWcFnC2Ayp|8D5QoO{C(7}B&?iNjRR2yW(<rBudz18>wYJkN+`i(E|dmUpB(
zH&FcotX;74Y^7zpt|R5Yo1US~z_L$rO89Bq=A+`*Uv00S3O;aHLPM%T2w0V5kdige
zWRQx<EI_6-^ne8I+RK8RNd;Et+nWB_7Iz1<O1<6uyVcrsQlu6eOrxexDM(2oj%nhr
zp+Mr92+&m~jFJMBdLKr`74WW$tnZ6;u#-Yvfb9vXF(OEf(Gk}Rg>6D=pYkoPEr)V*
zMKKXKB-Q_f?`&tlz?RaFp(Eoxms-gAoS8=8r})sI18&M5N^%;y8fR7q=Dxrr=icI)
z<tl6M-gpSCl-e`<1V2%*r-;rQ#nr!wR3DS*y^@}_0@`Q0sZsiwm}K9tCF`tzoe#xr
zFlRSzc}j-E13%TX`76DQ;8?L<U{QQ<L(Q<x2=IZ`Ft{UDDoql>s#rxPSBz>_!8|kK
zIGLl+kcdfHCbrFU7qFVZmrk$8*#Vhtewu(dbHovwSxvkqJKDPZYCkr!Ks*3y=#SYo
zwbh`IJv68~#|+sc@TEWnMN7gbfjij>7}lGJ_ZP8x9Bjo8x)Iw--Y#;8%ZD7cR9(1f
zCNMh^<>_YOo`E83N7gF5w0CK~P@<*6u^g?!nVN0_8BhTid_B81vJtG^an{dmj1n%p
zP33H<hz{Em3w2GkR+j@DAaOAmLZ*?4Hky%>rt%SI{qA+!$Hy$k3(5`Qp^T(FE?pQG
zlc~vyvtpg=w83JxZY%5s!PIFE;X-5YNb9yp2IEi*158r`x#A{}u_e;23SgoRM;bPP
zY+i>r%sD!Yo{;#M3PhN}EnAh_yD+Ivl|eT+2~~-e^%a_tmAflihZaS26r*9`2G{cD
z5tV_&8;4R75*{|$8WMvEGYOAoBS!MUNFJ&u><05}wY)cq|BD)uSi6*TJzYMI7Sza~
zUKkfd;iHmOTvDKDD4Bcd_AfDTDen=<I#rG>A3z~(s=Ga`J7lU<I5W%qg2$=5)EKq5
zwtsl<<j-^NS^)weYREf@W71jQYGOs#LdVTdp^!GdCTll8)$-f02qYp~K_^Ha#FtBH
z`}I{63!NYCu9D11{j;_1&F1%eK|jMLe+3IRVB1`UU_kniSS81$?)RYjK9|!mShiOP
zPr<FdABFSaRuqP0?OomgmwaEW<ehzS>}s_KW`>vz1{vvQO4v8pFQ#m@?_Ex4Rbg(N
za|13n^(O3epa_}ddk}0|2y6MoTl&$(Hl7CL8X1-%^+t$F-X!jGeGGoNyVbgbDa&)8
zyiJ|t8FIFP+@Lc%EbR|`ueryY!due*V|#WstCfU1!VByPW0`$g>d$jwI9D_rQtciq
z&7eDQN|@XjOaMSbld&(w`9{+O4GxR`47SJan@+%R<cY={z7nLP&wC+rJa`_t(I)(_
zdGjuljmt1*V+LZLihLH@We64<KD$mE{w|xXdcABsMXx5F0P*2Q80!sK>J26Y<tu2$
z<;TCvoNQI+#7UP@Y2L^b=T;&C=7^{4U33(!YyQ4g)Q-*G3H9P1JBM3l4qu7M6?zX6
zgxLM;K2#g2+D!j%mXU@Gat3T!30{@x%<L0|xY+51=a`_Qv_mn_YB!WD7HwEei;l$5
z8x#b&W2zi)Bu6T{aX?D!^;GlwJW=^dn<uj+Miw{dylbo=UgCNFsVSuuYuBnN!mOgd
z2Jy|+ogy#1$!cR0YciPmYi}{?SX}VJ7um2S;)H^p<%BiI%+{Q|)_Nv0cw3bf?FNEU
zV|zR7V;bv0+;9)K;Ay;3pZ6l`Xw=g<B)}MsD0q>F`)2#wn74~s(}2k7m?O6D;SV{E
zoS=s9f;Z0FP?dM#gh(^Zs&GL^QRS>Oz%XJ$yF&eQmuk|V$Z<Gv>4z4x|H*O!dSH)k
zkc6{c*$dERxU;4C!OXY1+5gSbLFs0U+E90piVoU`_g;4nfiC}MP%dC6dRLw$PubiL
z6S0mfSDdeN|91$8$Hv5IN%-8gm-REQ8Jd^Vyq8d#6eWR{$vw;?2%$)1PEMgMJF=*;
z8|MaJ*@fR=I2YH|>C$9OyI|e}xT2@Wo!6+^@1C|_{@mq(yR_`OC~F}dLLj9GSe<Nt
z3c2f6Ew3-LX}f<xhVK@hRCn}7H+F7;w={S}#M&ij#`-$LL_|Y4f8O2SC;QF22G3FQ
z?r*<7dvA#5*Mx~he$D$k&E(xd=XK{ac`8w0JMZ5o?+%Y%|B($Ta2F=&19#g=-Z6qT
zslD%mzpw<llE^0zD`g0lC>&@Rmfty3*{U);!@K>y5LHRXVAk)#0858y_QyqO0&=J+
zc;;xLPg&NG+;JL!<#HJUHR6?qU<N=?mJ6D8+(ocO-1ufKXV&E|(p&CsX`N%SmPqI|
zB5^yO!E-Gl?AE>1@=JuMih(yN(8#r?{Gsg#n(2YyXkLv)FSbz?HCNZ2Yu_c?%?c`N
zMG?4~p!Q?a!;Jfu1Qet*H~c^*FVNGZO!Dr@?i=hYSvE*WOB$Q&p!T3yo=sK^{=i5(
z;t{=;gm^WwuSt-ZgSJG@10fqsPwFGMUvi%20|Z)2KavQgrc2xvZXDzqC7EI7kvE?X
z$!z5PE_cr<YT{qtKoyM3o`hFO7c<_FIWsMk;UFW9cpneZpmmn{Ii4_aizl8fuz`sf
zCLn+sDqNQyFl)O%&`z2xu;{j!wlFWg<&J$+bcY}K*=Ez4Tiu?Pj-XUSEKc7q$$Mj~
z#&Lm9^_!!xW|yxtk>;{A*0i8-eR5gW$6lYi9Zvo3WS=h6SvjrgP-~8YyfPc5;_k=5
zNpiGPs`%nnWg2&YR0hSB<U$%Ne&7LcVjHVTFvdq{HxC?ZvZ{9t$7n^E$h~drC&Wa6
zB)V<>;BjF1J$alMHzCVt!R8?8but-|nZCV$^xB8$U4HLi_6y2XR7z&Z*yOZ-=2s9|
zp`cahZKldYf)K5^K<@gW*f76iZ8xcYT7Z~^jT*pJSoMDWg1aroBk<W1`C4+B|Cn9#
zcI=-yn^Kw|71R9u8g41aX)kMkM0w)y=(O|VXK|IZR`9%DaksMpM=)MDLQv@Elj${j
z=#(PyV2tFBgnZPO=5B}5+~Lt-J9Nhg?|}zV(sIeD89Hc|86fsx?g;I~#|Ds+=-<Uw
zVwHNeZs}}dg=;+92<{h%vT=5uu#i=dllgB=a(@E@@re=31FVx6D9QS;xl<9Jt*n5+
z3+V@mtLN}$W7_vy8xamY$XFoMXQQ4ZM}jmDoFnC0e-m3%n8f``S?vzG)w5ACySU_d
z`izR&pcDi%0~1P9<HqAFa7Wk@LeKCl<a+F*F-Y?Q{$`+SqQTg8N?5Cw(C{Z<^geWX
zr9oeVX_fWuEq+slmYfqg!+8`TU&92<k{S#j5(=q|H%zdmeiJ5w3N4t^?V)wrbfw^Q
zzd_vQLgfRG0XNt(8ilE2bt|!R#00XvLD9pahQ>4L1?Qt+M>+omNA>Aw)k$ZN(y=+%
z>bvDJO5ox+O`MILI6h#b6&>#$zHHz7^Ktu6^i3<J`;L0!5?8DeJWCn>M8Ptc0#Nln
zF9vY>5?loIt7F`e=3$f)sK72FZXhJLc+xgoPP_28l|KY#!SVU5D8fo+WM|_QWI39Y
zud?NN5v83|&z{C1Ed&Hh);2N+k@b$viIi>1^P~q~V{3ggX>6}=a(l#MhA9GArladA
zh0#%L<ktEYb!%(gAB!r3)V|n5D_WsRE)Kl^QOVTtO2ZtZ*ntU5BF<QsjRuadOXRr5
zC%`kjBd|)<9}Lmle-C1b{;~bueI^_AV^3_mPuy3xBiS3_9T^rn*rdMkSI4$zlwTjc
zN3HvM_RP0iwsa^0Y>%N_^5zz3Rkxp!6|17zI<0drO;RV2?}YM4xi#CwJc&3ro+2Cx
z+Ds(8Nlm-+<(nmj$+J(e{WwIL&z38%FB~Z^ff?t1#^a<0Z#GI^r5lXVUv7McL2CJs
z!`{Iz@)lhc`JLo}+a)apnEb+p_kO`}L%tRMxO=x!za3$iEcVbdy?OnY^&pc%mH=fJ
zj89a8{^dRUzgMWkD@~)|I<4*m<^#7$ke$`yhQ|#bJa$#hYwiNKzQZxDq!dI2bF)V7
z?1pdT4Ug6wv-dZvcfwqeB}O7?-QhroDq=@%MMRHA#9H1n2Hk5oO+JAN6HDHS48hG-
z;Qt2tupe*Zp@(72qHhcGf~N3<tWG;jx^$JyA`}*9)%4`oUv2jm##X5^5^D2yO~Q<q
z`nbf(bbF0p%tmBs>qA@(V`S#RWQG_PHqdp`FWusb3LFAQj14#bJHeM8?Ys|;wOT7@
z{M2(irdAlicV#1Gr15uUAHV2z*11TwVAI|p8`U=D9l$rIsvcr#S%NZ4_3N+8(34$M
zIIsh6n$nIj=fgrf27NQFyZgzz=Lbi7fAk^5VLsn^IN|Rlkoknt#JA|b+hoVaZ-*A8
zs<RJQ;Xiy4z8pr=Cb;gGij<{IxmXWS=1oSyApan@5Ul5HDjt8e@4Vv&IjIm6giM|a
z{q^2uVWK>lZdojI69i3_?|6dPkBqg=Ot1z90=mWc$Z0e(*j4UGIAhzxv7yUdn)dd7
zcfb8&_wB)Hm*;zHb92)Wa$4^huo4^w>!DsqG8{5P5HU%Br5H3`T%$aZDrxv&RSev8
z<ufF$vODJz%X<+Zn9V1aYm@0?mRURsIn`0=H_SR(g=w1iKvOK=G3fy<ot*BTcJ{h|
zYVVyM9d}`udU+P?iDq|)KI>jbC?3Y*DLvpE>^My}Ct?}zv+mc;_YxV0egLk1&4l3<
zM)-rTP?|h7?^RL_!htC@mwg$?FCu}LjA)ZnnkQ8_Hlj`Li#B*08cR|8c7&ST6>8WE
zUzp1u-{tQe2BHk@wj=Zutra4t6$;eT7gS^_7S9y>W$&QVK0NInyxon-K=;-vKcU_}
zKvTyBtNGHve*5re-ZP!Umt0O+uul+u3X`iy!6Mb!)Dfgz6MF;D-@z=s$LOlZue*B)
z#;Kt*8X!Y)9JFn4^5K3ICO%}@m@8)&6XFPCptZAnfWD^Kn@$~c)-oHFB#|JC;hm|Q
zAx9+<-w{o~^~9(b6u*o<yOr-s!;=hhEvVXx$LGC*rl;&p^6|99;yFwJ&5+7(DvHsP
zhgFtEv^{0kG*7b4L9P`JR?Vh)d)PVczU~|xbWRW#8Ee(n%D7I<Wk9nkn$M%zngJ{$
zo9Dh{URAW_&EsN;ynbAABF`V0&#Lpgfm#zXdE>rto(u65P|We4BQNRgnuP6&n)r5f
zmJZSp!qPGy)%q~f=;H-`2mGuU=pT`QP%wlOnceTJ|FLQuf=jezPoXeN96yW6-=B<o
z&ywvYV%j68D*_k!9$}~BmF*s6x79B{ojU&FqpG<b<Hxt{`L@&&p*@Vn7gfO}b(E^%
zQGWi}^)gdy&&Q4A=VGQ2Xd+l~$=ENPb@zlddlB?x|C!*dwKr}DH|EJ*T(~7Bo}`$S
zifiRd=h+jA{t4$<WxB1(-1r0hB2~Y_#RJ7&wGKNyc-Ue3?sdcnC~U4qk6yZCapROg
z7gF-0H8MDP;!{RMWzK^N4mY@_VYT$QyQ{nrI1(uAXot9~DOeRUdMyb!-j+T0#M7G?
z-^hYbzVWgcd~_l3ut(8(XV$lq)Qjr&JY*UDFGH%J*$7jo*Ssd3FeInoh!NtWjqJT#
ztF}^=p<R->>+|sW(lwGLCnVvVul&af`Z%a|4CdsHu!0Ob5Y%mB(CJf2GduH8v&dmA
z5}Uz4^>G;(hH^4tC|)sXahJW8$dIGH2I!2Be?<Xd=zBv+AX)cjU_F=tODvj!=yK0>
z@8<X6-4!E9B^^;0b&i>X@;s!XYiPwXsH(pDWOr)n07W}shZNP|K#83h&oHl)JDDs|
z^c9{%9gS2jHI6Ih7R_)k7Ez0#d>TgUq>*v-(B4Z)rD~amSvt2dLS91)jv7Z}SU)^s
zE^%0JDjyDW^}BKv<tBqaviQW2&kFaR8o+RppwtR~UA{GDU301!x*yVD)|xN?o+|k}
zn6c`S7bh(IL<EfT9d8*^mc%`)JQ6@5!SM{_>KXWtm1gBg(r3OvT=)-(j6@bgxYMOU
zah571C`#W*WO$rhgUDdBM$&$W`LRTE9_k@VEv4m=DS6)EXAJi$mLabd#Vg#QbPfjl
zM#s0sv@w%$MOJ_%+9c-cB*jpuqrkqD*)%F2ElVu4&+DPlsuo)B;l4{|HtsHXVV#r3
zd3+;GSd86MNnorF2T3U(xlo~wJX}ZVJ98-gOC)1jd$F@xiHl1!DUK2y!8ajxCnS*n
z*3z0wwBl6X6bbIPkc=%%WKVsQ!|VoxDAH5{GfZ139bI3A80%V^sE=Cbs6Ws_8iSYy
zlSqkzk8FrC*mhxS&;`Pb^k9cLq=8<9SfSKx1SvFv5?P_qSQ=}1V|~Iaej+p)GUWQS
z8^?MBZ@kNIj79{+m-Mp}*GGtq3|8()d!SkLE+@sPn3aQTCo1PAAU@V|?1`?METD!m
zt1qU`7sYh^jtqD=e;-I^4gf@Tvga{2YmmQ~QfxoWFxf;pHIdp#;}v0*rnKwLV~~w)
zZql=g=0-gZz6Qh+33LEf7&g*|Nf?lI+;h-6CmF}0@}bIpqcXP2p7b4EaGgt*CSnnh
zRd7y?|0+z`4g$cHWC(@D4|l9TQB=u`QAtXHca%wLYRI@73>-Fwf-~Ba-GotQKXIJU
zDP>sS_F~8*(k|YIyV|>Pkt`dhg9y}RNDEuh15`ub*%=yjN+4q<7o`eCJm*dw8Y<!(
z)(8zh;hJcLDyvXyz_f$fhxwlzgdJ;;H5gSaohbW!gawqN-UG86@pu6(XpNZkv*eCS
zxbJHu4*T!{T>cXV_i#4X9cn3Z_F2B`fZxk&@fA_j`x~z_O$Bil8cOvB|Dbi^MwXxe
zSp64{E>xPpTX!omJp`+JF2KLxUNX9)8iG>HbHz2l5LQ}#tzT1T750}fX2V}*h32i!
zMg7_=wJuR8QF>wZ=?ZL61aVX!w<jfqQQZLL&RNiC>`RjcB`Geav8WhoTskEJD_mB}
z<=G`0q0WV383>lW%y<z=PBms62K)4zs??<8I()Tj&+mPPq#vUIFETNLOl=Aac$E~&
z+1WbRL6G2g3U%iL0=4L{(;gy_$$+PL<SW4<?@gs>CeU{Dv;g4)gK%+4x0^S?a>Eh;
zj__71ywHnAQ&T6eqV4D|2yr4knal069^cN5p20?bZWxyOMa5L;<GL(Zv-;wuP7d}c
zW8}+QxFb^-O$#t(iV*1cS@KuwU2#_Cy|rO|jyOMMh3?#8M?=+ZYF|}T-4=m?Hxw%P
z#skHNEu8X=AGhe40!r)+Q0qEX3D7Bq!gu`oEK)Wpe8LlO;!jFhpxAQN#{O}PA3L!(
zmzV>wzyHCQ$lgn`+7iz?=)qj^>J9>G*KfEmol5WVJVhe1Nsh69F5ga0GU0n5Y%#0D
z^Tf^mE7)P?M~GT<>mbn5<zD_Y-xzQaKa~VIr<vF3c)3RAX{gUpov2AY)9A6=95?ED
zIXdT3OVx`k(fkw-kdE_l7;4!?`drgm2>rq!qX<+YfiCOo8=0m!nV&YB6&<P?R^&wm
z%|j!s0(-`1&5{;=XrLesV!|An&oyRGa^=(^;<CGzua?*B2n~4=q#6D%sL4+McmYO*
z#KN0AFsTtuU28Gc9%jF#0*gnw0|$~kcGtnxJwTRFs2^GtOt~zsT3mXX7Mt~+OA&M@
z1UF>c;`L{%mDP#S{>!G1G`XBz7#YE-i{`B;Oy1eJ7;lhe&_tl{zkiT_AI}SxtayE_
zrOZ+L?~0wzar;a__Mu#Tv=C5)sXMv|9y@trWiO~fjk18)L`K#~l;v4CavOtlsWcU-
zDS;V9rIslXf{Rrnol4PNw>3&W%r7pdkpMy6B=xSSk&}n!;^^1j<keFTjBnoJsShhC
z++MfRm3kP99^tAH8i_#vE{H~m_pd73)po58rgR>oJuJMCI}E_ZQXvKkRu-K$%tj*k
z7^T4b-_kV}{>N2h9d=#M&Nxwn>~o3jouG`|l0P5QZF0#)%Q(Hv+$ch)j$A_=OLj9M
zcwm!RH<}xg?EF0IO||Pl{%VuQvqFmx@4o4jR0gV~6By<LBfqf}eKaF;jClSgwepR<
z!;F_vNyyw}Lw%dcU(P34*05ZZ{}w^wcfc|}FpvU%awN@zXBsMh2Vi4{me6upjGC=T
z#H5l5lC*GA#5lF;nq0dj^k%?Gr64-~#vV3m+%JcDX7V#73-^{=QILp3!_7rm)Ubc9
z2ta#*v9m=Do0vjTb$XfdGWTHt-VS0w=x2qcUj~1BekGj+C45AH91%le0>dgu-l~Lf
zP^L_hKNuY%Q!V@*H0aeHGBwcpta_IUJq#PIrr?Gt7tOW9oT^e<+Rhj&oYp1V+VSn)
zqGWlY1(>#s{YMoW7M+h$RU)XEVUs3+h@^?s(G0X&s;QBFby*CIJdtC$RQO(8b4Z6I
zVNk~;Bpjp|swPV{)SU8G!73Q7JtVu*X85F^@Xkirllln4=NZlzmx|tw0pX7of8W#y
zL~()R%<A=`vut{mWyXPTmze#5xq>8m#hJ=}d9J;34(GqfkA`#%kMN2;Nj1bu(12st
zSuIyv=p-~n{@fi-(hzo$?8qV^qGNypZ^BaTnyydP#@M1{s}@o;4Kzv7F%FD%SeH}^
z&>KGG(4wjBXd$o-m%%t8m&feA)DriIw#E_gr1z^|4*#Gcm~Kjm(t?<cdm4VGzA^VV
zs!5hzHJp=5>z&!#S`Dv?$Xb*7An$I5mCdY2&jnC-*ddOxcM)NQy$fZ8y$d4WO8@Y8
zYw3<%wFO$&)bMP}fh{?tR`0^iACz(QF6ua(mB3LvMh8~F@1mReWy770U<0FIy(b&B
zA+ynHU=xkCCjGnCZ2J7!)<TIkV5V(OGs;oC{n@h+bPo1Ze0SPS=NMdh{z|T8y{3D^
z-7?0DDS0Ot=q1jJaHmCgi-|&Wb_?*Fq@r8YZHWrje?X~A?1|-!a+0fMJLc0^qet<;
z?sfv*lIGyCLx8b$u#C%Re6lhU_}05veJs;`%PBl+t6LF=qiO-AF-Olv6t>0I**%c1
zPdTB<Pl+RN`Dv+K7S9NjUocsbqBeqdj@vJe+b6GLEjdeUkGPoi+Fd1HapsOrfqKGu
zRim&&1?H!<iqYL#;^8-^D!3iKgY!DcV3U-WkvnC8O^={r7JMbHV3)=i)FOMOke5qY
zoU)@Y3uw!?6yDY<8PU=gPLC^$Tlq$_dOM%^oTk{HjT?b-?v-<@aCD!2FEK&x1jJ^`
z2yH>xN81gg-1^Elb)+NWx8txC!f4*;6?)Vdp`G{pz7bpPDtNeP5sr*oeM6LGD}9){
zOra1>(jXO6(`rgqKn78+Wn?^tjl9L`b43(i85HGorNXcczOsUK3>NHRUxA8k8#Av_
z&d|G{!@T8e+F!kG=@LM=MZ7a%Q)Cx21o-`9Dx`V>8^A9z>R=^xq~sq81>ORMv({pz
zg35J^3hWg3QEP=1n$ktN7!+sF4Xd*0UJ2{P-K=`r|EvgtLT#lqmup1y+e%?6Th~_Q
z7%6RLE2V|IF;G06a-p%>Q99rI8F8hs_^mrRPDgISNSy9Pw6UOCw9pNc$?sss+4J_f
z$*BE3Y&KFLowiRqc?zqwBk`v=FFOb_jPcR`v6H+rn8LTh!s>G#bMD=5!}CW!SMPT2
z;ePBL9iF^>-9C;rYyw`rmJgPBg#R=!8gxr7oPirm=m?D@a#qvm17Xr$kfiqU)Jay^
zlC*Zp+nJrIrPEJk!i0IjVYPCLLH965R$jMDE(N43qzPAysXyV$V2&;g+%PvLQeQ5N
zVj2O%d_*Pc-L%8;w6(&oU#XN%jNlSI)R=7TWHn#WfM%LGIiXxQ3Bg_}Q4c@Pyg4C3
zcG)cUmlGsvZRTxc(2S5Kl>n2KSM7s0D>|)G=3a}f*_510GMWK}dgh}-)s{!I7-eDL
zYZTOAIY<`6b0cxFpKm@t9F~fXDlM}Gvv5yJ+|~@9sK?+6`%c|mF$<E`NHa<SxkQeX
zoM9A4ts7GDFqN^SM3<yAioYT+QdqyRk<#u(v&6Xi*d?rR%lo4mmA_)`n>Z`7CozKs
zWibud)cg^%Nh1yEzAaQc2}}2-vuQCz{{lwuRbu_CTf&{^JrJ<TdS`}N>Nvgl&zgiX
zQe4BFu(Bm&<A6{(aNGE4RJaBm8Y|68G;R%hQP#f96V6Eh{H3mx>C&lap}>tvWlQCb
z5gGu}4Q(lWZn+dPlQG722L0Qzg;)yNqLk(Ryd0Y}iGF^5o{>w%p@TZEza8cJ#0)*|
z%|)B|ti#&l?=WlVueVm_i50)1Ou+>I9wui6+nHk>-bjwP;s7czkM)5yvz_!8(+CbW
zEPI(x!{ZJgyMfR#zoQis8TT9?T2e$YFJLh?XwJyH++vM5wKAs#+o3s<8?20WLj#r6
z4afVSvyV-90AWrbo$fBIh=kh;3Breot3VjIvILdob7=4(fsZ+oNJKqxaM6{DZwEPH
z51j1B*jZXhgrE!kFUx+Llk~PI*UisrTbwTR;5{OXyLm!EkLDi=PPxKRdK?v3PQthx
zj2JCo%g$i2hUE`q_RH*+Wa%-&fIkt7Yp&wQt-ES@qba{?URaaixEO!klfRr93*`LJ
zlcT3$%NT+AaBSVl!}{LVAD|!IHx>$__z(`LCiD<L%K)h}79G#;5(knqwNb?Ng`gXl
zH@W`&?a9xg-6^AdX~bpU@8*?J_`Hy1s2~9x!(|v>pFh;Gf%s<qO54<|g6H#cU%!B2
z>ZoOTN-48x?$j2D(80XrkrS%2Ko2VMtChWA4LNiDG4ah7n3^mZh*Pc?0!UTo5l-4L
zzU=GlJ&6<e?VArj9Aj)0j1fmcVmOl%ZRn>BB`V`qlRDz)>`pg4Y<7KYE)#Gjlz>HV
zvbih5|D0W3n^{q3ISzNdZ#a&m7<gWR*s=C?n6fU`S76Q+F5w`r`s16whYyxpf*K!&
z>m9bfg_vW(4p>TMU!m52jnTwG@Q)V!4z0iVu>hjl{<DZjqDleHDpz&pOWOLXytSVV
zmR#+{?Dwyg&d;}@8N6iC0(gc<_}>w9T$TLElaERNE0RdRLiNPlv_Lke(pj+xm$+j0
zng>QaDnL82Kv*Gg&GHD>HF@C`*<fj*d%Jp?dvCN!)J{HZCC9Smmd54MEJof&P%pL6
za{bjQ<Ce%OBwA3`)JY1m*PYPGVr*KXxB7uh=d)2irASe#Nii&dgo_cz!eS^e(5C@9
z`<NFPUGArAn5@+>SF<ibG?pA{azjHavY!}=h~RuDgHtY$JWpfgrI_MvO0%7>MYW|C
z)|DbUud&6@$YXNc92qXgW0v7Bfz%e%OVU!4h_LNw|GfG6KNzR&u!7wl!iWvB{sme*
zgkNJ+?RZl3;4h?z4%V_sdt{kRuoh{F#7zkqO4$^S!kjcS0f~gP*?7|iWl`e&Bq|6G
z4jap9f*7xpGaz5`k!mqw8=K{wJdJ7)DS5uh`qg7<pti;Xn8~uaA)^)Keh#NB&OPln
z4-YZZHk?T~73Z_TfMS?aJ7<jYg`2fy!0d426Q+YEVrx}7MYt1F5{6hh#aN)#1rDn!
z4p|NNJ+2~en4)79hr@Et1`6GW8zM&f`H*69^QM=@fVR{^Oo4yEfMW8`U>UyN2ag|l
zCxpDV9<Z=pK#fBZlAGNW_?FeAxMC4mU?B^*!>NNPu8V|m9hDQ)6mfj+q(X3c>DpV+
zSb3H?MbkNNN?URPUK}FyD3D{1Z7>2t-A^?%`OGwxead>XDQ}H5S;43Vc;AR8dnGwf
z%S$&c!c7DJYRKq<322h91pW8ErA%}6tAIOdYqIoSy_Wm)>$NN`F8o5`Liz5O_51HV
zp`kW)hswaX3uv^On{?3Amy@&E`MYrV@56JsJwm`HIBel=+v%pC*yaQ$;#um39|FUA
zjI?Djol?tlC0N>(^eM2!<O(DfTe9X^CnjGuo!gou#93x)OyEvv4KaP_r=O@6i*u2v
zJ(kxgt_5dB<`BL%0|k+uyImWAM{LCyHtJiA88GZ~e*VYO4b%tR=*OkEP>)@d^GwfI
z^(MDTc$?;ZIa_&d%9MyIZ`z0Z2(j;rEAQTQ_7B=9rwp>4_o%}FYu>?si}8*rnf=bX
zR^Gpt6TWlq6!78<Fd&*@m`|rBe?!<W2{6TMI-X4tg5#Wgg;Xx&41QG!Bpnhzibcz5
z$tmL^hr=TW;++;COkPS*ueL*F;$}lzCXRvEBJFO>9g0n*Wt`<!O;XJyGckOeivt^@
zGDuICD6U4h^{fCSSxS^!BKa5Clu7lX7)a_|fpamvbTmfkP_0BmTyBQ=ALq6z1X&*L
zGn~0of09cpdCSEG7zYatDf}uk>e3muo8c0Jo!#>4&BgG){fczaIvaL(E?paMGrWM5
zgMOT#C`!DZoiEHN<+LgybW5QQWov9CyMwY2whvox$PScA)O!ru`o8DNdzw6QJ$XCH
zkIk4w_8T#=o%($DV957)#w^&q3T6yE(DJYZCmAA~t1!gxWSOhf67OhRCG|Owaf5i5
zN1<_2mi1E-(k@M;i~AN@;eueCR<eSR#C@0x>O&;f=7n%fOfs!#O=tI0TP4CQ><=}V
zWx$<id{?Y1GEb7)xpKg(O=Q*9>!KxFU08JF>(y?P-kxOXq<2Xi8?-QD=az2LbF{6j
zI!8{Whh~if*nUrR^69afD!*KX4}I0$?V!|0d=<mt*Vp)PyXqIYtWWQEJztSJkYS(S
zFIo4puH#=+|FS|oH?Dyh>rO4Y=Q8s^1r(Prj#)PyH!hMncPf@Blo_9h>Js4)?_1?0
z0&2Ia2hFO_A%cBXQ!vB6<b72h)#Jd?R5Vo6>M9IS7z4Sxp}iz9y|{H0my6J>#bp0Y
zSnM^2>(|F#cQDr%JFadDk{&<jYm|bI=_F4_eiXBckTGe)0Y!S?Bi)=9Xb_KB`W(xg
zOQ{j<N3%z)rq}e}@gkp;Q=7N!))CguN7{%YTDwpj=;kr<UB%BEyR$v&&%MupdoW^0
zUO5M%Uf|j;#Bx}iYc`j~8Flrp+JqM8CX><<Q-*<8vaLh1Rm=$zj}ABy868&ExicJb
zY%0Cp{>RtqEwlK=eU050Nw0Cnu;+&iRFu!y_`)?aVFzEba#85%Wso&%!L0Q&KiSEj
z@pvj{nEa$4cenaESh8WOfYsru&B2>=Z$r$<z2`HG<3%nLrdlm{GQyzz?#7<4fkO?d
zj(ri>9DaOq^jlZff`lnXo|am9kaeo1N5zMhDX2ic6+^x1acZDFoeTwhC{%2KOJH!i
z>4Y(0tEDhGZwBr78!<TRvm|fSj2IR}hT+3(Fg96=6+uR5QNfyFvuQQ>x>bWt9Ic8$
zloQ8pt>kr9H*{o&g**p8i)wsZp(Op3tZ_QCdHo-POy|dmJ-%#{zD=I!8TRcw!@U0l
zQ1gQO>rPkBLq<rE;>t@)4(Q*w0JL+lgE6?3dsRJaypzE{#=V1J=h;fjyv~e`|8^PD
z7aa`IL&03-6M=PLP@~+VfhrkhLo~w(mz8lk%r<!%k;djF%~t4F3^6gXHA{v*!LC^N
zaQW6_KvMBD$v*ltF|UfBMW6l7)p32AtM&D`<Pk{JRq+V@FcHlDXrQjWP?3I?5`Cf)
z+Mdg&YQ<jvkPV$K%R%#+4CCs<%}B>yJN3@t&`ZZ9dTt5AoAd)+>`I>vndn1H6A4)m
z<RP*J*%mhA)9Z*2a&KfLhY|lk?Myo@#*ojVF^zG7;pPH}3544_*zLRy17d7(ou{yK
z)^Y2s;~c`@o&EJK{%3o~)|yYmClyw%KkdB6Uul`}@8kCA@y~uad$*AnN5^|@xa~jR
zo}6~})ot}Mo0jZ=DKGOePA&m_PLknlFwMt<tg54m=+hR_=OAbA3<dBpcB_Ol1-Vw%
zyEL_x|IjehNQZ?4KDhOdva%@w{Om<QfFztPgXX8fX;^BO0@kKQIH%;K8hJ0o<SH64
zwsQv4In+F6^KQFF8>YMBMI)X^Z+B{nP&6HedbE5$SZ|QRofxZnkxu#qV#BdN`NTG)
z^Rg>&4}M8R8>(@Ro?q9z6w06jSqOYHobAN~#a5D$986rI0;kUCOaratZ6(GK5yX#8
zc%vhyG0Dc0tVH39LI$x{6i4d@6iDBj;u+6J>Vyn(9wh?l78MS615=!|avSYix*(ik
z#vSzG7DbsLp=>0tVb}#h`8p0)?6(A-n&m5eG6d2=Nbt3U5Srl~XV*>%E!u!UX0+va
z@+9tx>ZB6HEgXK6VxS>uNM)5J#@N9^6Aq^mLeN)-7%qk9I+D_IjHjDUVU=Muvr+&B
zaY(Wy&C(cL&WLOFv2<c<BN2X5?mRXO;-oS`4LTkei)l)dw<+Gz3}$b`G^5TLDbw!M
zq@=3VIE&}WCdDpc6sQ}<X4=4p>9s6A5he@{7WQhY`Odm*msG#!igPAS3$(oxpg;-d
zl8{2I(;$<uy^$#UT%V2dPs}asbesyrvO)BN_fYqFKam5RIi6xtTYtT2#AVnmij6{M
z>(4R<o9Q(566^~7ZrVU>TDP6%hUpv3#rbRyI2*4p{+Zsfd-TGzat_j{xUOmY%E@Fh
zb!ArWZzR=2q)H>8&?w%j#VWMilVZ*`bYt^Pd1+cf=w$+tg<CVnop07OcPK4MFVcL3
zV4o9=wYoN~$OsG@NCzCIY~R^p$ZKqlbU&#-OR-U8Ycy>c{7qy3bwV>4#PcyXeTDTy
zq`(}(y=POx1(t@=Q31WoF&J);e+XGQA<W~5ZHO!RL@107kxCi7lv^UtV49re7uC3k
zYh(tfz?y}7u)&PouGOByNdrb;n6r(66`t4QWPa0#T~n%+Y!LD}xz1^TQC4|&Q=1KL
z8sa(INM03JnKEbXjTTB11i6vpI&q@PJ??<LDG)S%#7|WMP~`a2>3O)3u+(GcM*?z*
zGGHOOUP5uMO-Dm;^*pz%N^2&uim#`I*oYkFhz~s4NDg*SC^I7OJG<(wsZCf@WH1KN
zhboOh<KrooU>bcW7L0D3VIW*>RCwJ?36knd^!O~fhkV3|Ma8Xhm2ve{3Vcg#54_&<
z@hIDrp1nZs=fG}bxl?4EM*6gC97g5gd4W+Pl_Sy?c9c1jX|M;<zI*sufq;{T+?Dq?
zt4)_!i_?IalBq%FrEW@;AjoPks42XRf}rq5D@afIe7qvb>=IJ|paV_}6TRc_5tChs
z^?AZ7V<_uZLJRDJbQq|!e|_soLb}@emJ|nf&J&XXK4mq*G-fnS<!^#<N3FSy;R$@t
zmBAv75r$(i=>=g+<ge>HR+@kMaP$)jkkI&SR;&!c39(POI1qP%v=Ag2G}2xFhWK^g
zp*!E7yU2~Z5<xpzsX&kjc-11~$3ozeh+Fpt0Wg?OtpQA?$(4>oF?fol#eS#io5bZ-
zY+OYpflGU$A$4RH@#5>04*rFb0aU$p^8mh98UXFtY8d11oe}Wx@0k&R!S)Y-Q#Jq>
zw5lWoJoFO+&fxhEx+!$<k~D_3e4rb@Ag@I(gc#{W;8&DRIMLHp@{1V0Ln33n@)}%4
z2|Z|Ibj^saMx=qyS}H@*#`ANWO)k?hNvPLKBvg%dlIB!fLwJ1km<U}B-g?_)xW8_;
zHb2|dHj+oz-r}Y|ELaGH&I6eeF5)_CoFW#JS_eY)?UTSrsg^DXf$<2p7=Yg|?*mYg
zXzDbH`PD#8J@Fi9x_JrMEDcwiF{k8`?Qqm6c{F5hDlNu}T`tLwk)U0XAOf_e%$ZFK
zEMUxM&H9;>E~B479AWFX`{QzxgaXSy#UweB)7P1#d84+1-|stiD}T-zc~uJi-N(<m
z-WQC0>EthAV+(S>oPN#;*R;~!+tDQJ6&E8o!1}7b$(*t527d%jvU%m@94V}ld94Gu
zBQ9<EyHcRnzl^#~2$>V(?Fy}JJK*i-no59akYz$Kq-jYfR+gLO8qXr!B9pm()=XKJ
zG96*QJEtn6xqZrx3^hi3{h4A#x+}MthOu9z*c8ZMmqp$~wUn}ZO?`6~>#&}BaWO-a
zkZt0$fRh??@{MR`%Ozk+99+?pTFqKRDv>)JgRJJZ<XbKK1s>2W_oWD)L9TrGNnxh*
zi4<cGSkjtA%d*9RtVuvVMIXe&9@%yag8xzpv_;z!?XBsk=eHyFeeCDNR183anXw_A
z&nWwkx>U?2$(y4;RU#q1B><ru^&{`M9bA=W<R}p83U`(%XBg_L9wixwhReVU>y1#z
z;*7*D-{4T|$B@!hZae6h@&;Zz7z^%LxP~l}^I>&^9Nh&WO@36x;-HG!C_67XmF4AU
zuJ~G!)f}%sVIr_dTo?QDMH#F&%3b{`DWL&{u^%tDBsIvUtEKQ7plp)^WAap8l3;I{
zcJxHz)H@>qD5afum91ih&541e^co0F$h6B!yt{X4Nmcy}XlEOgesN84cv)Cl^<%oR
z&~Mqtfh0iw44;p<hRSL&y2@r}AsI_B)4b13sTEStkf-5wE?;ADBzl`fCE1%>V*DYH
z5jv`a^ImELjAq00JR7KT>RcALZ%t)yB(`Zbte{BR<5s)&GMnO&>vZjoJlVQq-VXYJ
zzHV#&I5A4XwiOHBgT@`mWm>^m>4FfmTbcNKynOoYb6yx5RusO(0cFL;Dy_)=asd@7
zPdT0nE!9Hiq)=mfVH$LhrLsh}HUq3_kyf)~<532PrJP~yFkd!ZL;tjIc`jiel;j+s
zONin_H6DTo!*<*<dKu4HPfRxk{R|o;e$(Q;nU`TB8eTAAfoX&;*KFPRW|&)00<xIA
z*gRAjQ#EkGh9v|g3SoQzhCq40xDrvy32sFR{GTWsE_}EWYFc^4a*@AbQYS~`9=2nN
z`;l3?ZKF<WGB1y#$OrgmF>r8%t43Ux%Hqq29lEjv=ixaxtsuup&#)6Jwu<=UhP6~k
zB0k{iG~?$tLn3^xaG+{s&bSRhX89!04ve$cI@8bD9pJe~{h2~YcjIW+0$ObKQF*j3
zGmeW88K=%pBoZ|;GBu>yCxdBmRAsg@E!*h)^nfoS<lTPXp<<CYJkV`cUP9STKTc_>
zx#ST$FZ`i8JKGj-svj+phol=$sID?6RT^d=Tg>|Du8nT>dQgW*EdqPSdHjYq1qHr)
zp$xRu+FUL@fQ;MpAGW`DkAFJu9`F9tK0H0{v`^|LmPkxG)vP3@&6!*`GC7=eEzhh4
z;4h8++nW(K-RQk6{rV_`KC5Q%MYZTe;8Ws8YtHrO8pV!79gb-cxbtb54bH3mTLN$e
zr?2wXs&-`tNvO+2I&((30OL}S?B)jAM&fMeSJ3`KT$tUrr$;x9+ZB|UcYg5gKR(p<
z1xCiEy-N#p*W&QW(vdKiiK3M-&YD2l#Zk0w+;4p#?ffWOY-6cF+JB;m(tp9&6O<hO
zY2!~w0dd12{eTox)O?e9<ZFRDQp*CFsbOeQusO^{vfe@ggqRaRVsK%woA>@9;4ohh
z*RWJLgW-WI5zL4ihBVv&#Ny$yC>~)Kz6ibJw;^}LB2C0Z`G{ywBa{U2gec<UyGQSJ
z{WwGHmpGQiKa00{3ICnYAqjg6{dEXWveh~`I(&(MB#JV_uQ7q3JIQ8@?qV~qAJ38Y
zl^x%6yk^Uy1=T~m{9;8QL(MmcN{hYaTZCE-;>gl?B3}}m_9dZdU&+y84^d+&c*aNJ
z+Lm(RNFrsTXaMY}p(NYIUYeVDb?AYcr6w<#EWEH@Z3W}w#)-kT?x?w8NW|5XhAzbV
zI#oA_r2#Kn4%g!ZHD=7;V#2I5U&f4(fjP5M!YD|zjVIYAf%|N+3H0llKW}C+`ckv!
zZ#Q{<vAJ^@Q|Ej$=fXnEKKxuPgMqSVjArI`F>VqyPH1VfV~m&cZJ|q>HeJi(JQJ<4
zIet08{1)?KooTVUBz4BcB@B!H@-1&sthXjEv?NA_snCL0H8C!2QMAUwrEH7I(k4aE
zoLFl?t(X^`N;wh00|R#8uESy*BWu@rzocWAIS0$2D0Q2;zY_t~xS3IsUJ=?O`&kbp
z`tv>PdxP#+Xx39P$MJVcEIMzAPgC^`V(d<DHYtJlRPCb6jy(<y9ZpSl2iMBi<sFb)
zflq25y{MeIbQhOY<gZ={#R|FBon<aINo|q&8(TJ=2f}Toa+-xjS;7`7w$1(afmk))
zJ?-o>)WEh>=IHDn?x>}bkA~2mr&bhm{3*WSaitWK7%4HrptR*ExblXk{9>TlnOi#6
zwClBj!Q&j`V)ED}O_473i=fOnTe13BmuY_0Ajdw@xLFAyuIgZL5e<zjS3Ss5lV3b2
zvRAwSLXE<g$-v8ugV&bqO_&E&vp8`yFUwihGA6$%n|hN<`AxW5j9`7nC}MM#EjMFw
zHdOq82Px=}t7?Plmz(%&jzyZ3P9>keXX3`T-SB_EQV!c+y_CcDlBFC_$}m-4#&~Qy
z3+g4&$fm0ar&}-refX|Z?+kvx;2tcnq<yZK3f!YCOE@Rpm_R+fU*6zpLkkP3Zn+Mn
zWr`QUTWU)e#ZE9Bu=LDj?GbPp?f;khn_e=WJg&;{aq?#nL)7u~4%xC=5#hTsXLJIQ
z^N24gti$OfAL1gxq+bA+)}LSR{u!t}dH1(ppS?GzcK89+lpk?i3Br~nh7_1B<?^I9
zo3`fTpA%fUi(>bZzo{A9O;xV>2;75X9`9$wpP(C);!{3kJqbFEHj+iHH7EoB&%68k
zItM&qRFWxq-8lpnBeR0lsr0jGT9A#RCXDBg9Egj0BJtuuKK5$fU;SsABbpFrityPZ
z@;d~CcF=j<IZd9*;O)%O)S>@NoGuo&z;VA|&o&lyYg5vFLAT36@J5dDmeo85PlQjk
zGFwcX1WAycr?Ua=o2|{wHQDRDu-y^JbY19nS325S)Fj8Srx<YSF2#o|;}~F_fAMdo
zZnk~R=M^Cvri39thcR%F|NYzldKlJj(Jp+&k`fM{73$uRywc!^289)geiywBe1>CO
zb!m@O=M;l`k0yGzQwHFU^I!{ILFf+(t)GklKesIdFG0b*a$4v(#D|RL-3aO<6<qn?
zfHAN$*{zeNl8r;0gN*%jT-T>x6>pu>>Yqwbe3MP^)bJ?IJ^CrK*dG7f6wWpr-QIFJ
z1==FV@iONtzJB2WOOYk^tsBg;y7+9wh|&>ZA2T=1e!|@#JRxbET?;P)fd;<+t*KQY
zLOa?dTeq+{6Byw~%Dq4~Z~UIHeTOM9!;%X|Q6y`aN+G0EAcPGtL?F9t)RTzy-J=&k
z7%7Eoa0aznRPtV0u?=>Rb!4Mrc5!KAfN9&~%)m6#)VPR8nza+Qgorde3viiTFjr0m
zo4?f=3DvSf6SGUNI}zrJ&QN!qaH6^*SzO~!Aj^DO--_Z%OM|kfX=>3uR^Q&@H`SUQ
zBSNO1X%UellR1LqZxsMppnH`K#=u$5XQLk3B2nD_grLB}t?49q1z!fDU<<lDMYR06
zbNJ#&v=+<j@o8fN6H@^EWchx}@(H)h5eAJ|mu9u#&lX2X?9186URWTbtxXhvt}xAO
zv^q_=061|(njycQ0s56cTE}v7S8CB5`TlRhGxCPVQm&(^KtnyJBGWoF6hvBt8R6tO
zq^E))RT+7mF$Wr?GO-qn4Yt?27r>(5<L0GrNf68xm_g~aAl+}FUq}DAUuzbfTR2%i
za|&P>Tz|1}tFL?oySfr7p5l1DKfc=(m&gjvOV#=P)q3f!M`bRSA41(Q)DgQvYf>G@
z&BqcO505GA%YslF>fds8bL!q%Q$J^G)17K(!gZvt(=po<iRk~3JW3uX-^(~X+*!0g
z5X)L&4Q(a3$zf`y{_^~GCUD+;S_jsXt;1$6=QOCG@X#=PZ7$s`istj$<@VNhK%S#p
z7mPbCr|SZPm-W~4e%P{Cjlm`)JEp?hILkrWaGb4K2SB_toTTQ)6vfBa;~QaRok^4*
zo3PfKL2}?}K@Js8fyE7Xk1|Zz&VEIag>k=1)A#j^jAJJBC1|`H)qis@qB(LXMmzZG
zS=8|Zw;PMQT(#wis`C&`7!78f#^KJ|!ua!2q6f%g{zcBBCEZ0!MxM_j&fh+|t$*O?
zVh3$xbI|b`21~m;hG39Lpi$F7q$W-<eR8KeceOKSXNcLgOA(toZnrmkUJTJP-Kp;G
zoa@@_cCM)_u%M>E+?X`ynFy<hBs|&>ny%bcxyOXm=p7DAsxQJ~ZmuoHQYo3zHT|qF
zo$?Z7-3tni(YtHPrc}<xhhd7UEbJj-yUr;J7_2IStcPXGDz`gDR7^M7ckliwMO9**
zI&csH80&HQ9ugNZ&pJn3>{<7?>s?gNyP#VyHJ@E%ljS=#&Iaouv(<MdRzl{&6pxwT
zp__DtQYvB{apLF{+`V_v<$4^O)!Us&I1ozht;<vt!cS!bcD<4w&TZ}<#G6_=FY&wW
z9;BOVw;+CE+ptUJg|N!%ZC>bKf33{OQ>KCFX2nl5qD>yI*|YAV&8zpIpLum3{BA_*
zKlnE|Zhh@zyc|T>&-rB`oSx1v4`F&k`t@!}@jpQb7b(>#T~f2c$8>N3blp!HDG}r0
zoBd{8(_ga!h3W1MDp5Fd;j*`C#$wpv`a%w9T%YrrrOHJt|2B03#~=5%N0_pTpU;(F
z=0t^9hSCa}uG#YvaAI$Y@k?8QZFzoaDz43A-4Ve9S(L5Twgmgrdlzv)y|3lJVF4>N
zPu-Lo+9Ay4bTw7o?DI=7JtM5lV|gAUS!%N{mR>5482%7&2HEh-Z*^FJ5hobktf!?u
zx2U_$ezm>Arx$StGmmrSnK@mYE7R0;v9>hcQoX!s|7ryt{KSNvT2Ti-p}2E1VFy3q
zj*p5va-*~1N#OA&to|vp-xmr#_=#-yxuVZ9f)9RbgrE7M4}K#2^nM+6;Aa^T$aZLs
z7-VnqM4`okklX9!gdyqoazcRH{Fey=^12%d1IxX2u0TLdxP%iE3Gh=D3-Gf@H1Gw3
z`Fp~M2Jzdf9q=BiIbi*#d<i794XD*xf>6mGw0CrP^7eK6_{7h$N8cFVK>1v9)&A<4
zk>17ZNbl{<ui6K1HheGIf}Cddv)jxnlQ_wLvcn7BZT(XC4vIrT-)TD75YHY)r(oW%
z=c#g&5yRZF6>P}&XyDXOr3;tYVEpbqVjACCiBBD##5*gkTPyhJ$z@@a4al+R+_Zsr
zxzp=C<-|LMaB6tp;sx+p!#T$!JwjYPQ>U~9R=}NJRK(}1i4>iw=(WZ1*X7dLY)|zZ
zKJ}eX%e#c)IeI^7`Hk#TFB>b^9IgB%t#-eft6k2{Om&@Bk`4y^4u-A7(q>$yM1U$W
ziUXQld0Lt-?#S903i8u;x7_qy42Q9ow%=Rw3@X(VjHH5Z;)_I)Or`XgeSJyzTV@AY
z>aV2sTOSxD({bR-sDM9g9&9DSbJ^&ZNYu-IUXBrDkn@5}@VL|U+D#`Z&9Z$styyUX
zI`<&z)~VrC5lly8o($4!%P=)9Fbd-{^NqoNx@%I+ca7w@F09NzpA}qwA`Mh0mdK5j
zPmu1aId}Ryv>1*w++X<lTy>J&M3t<oN$X{T)~SgLONP(Q^Tf~Ms^4>U!-y<sUg@Q9
zMiiT>=h#9p1o#W#1RE{$ey}(<P#S-mvbe-cYm}Fps8mb51!roBS5P`^D9$Je`Sn8Q
zK@aeeTj4tQqg=;5pDQVNzuAjKo&Tb}822YFwGpF!qlLS0=}l&RLy?UYHL)x~A<Gkg
zB|mey7u1^97I;N!O>19oLtWftD=l<8Ep|ESonN}YSc33n=(ztmt~hwxtUl(hRr-Co
zshp{L5Cx!V@FF72Tud<6OJr}X<vK>wfjYq9_gN3|%r}zfAYzi}n6cPM71%fpOCMwS
zR4SR~W-)LJnnaGJTqhX<a)3C65-B%As8bU9EXkT%IOF_=P02LlKWWYwE(ssdF&#)Z
zIy$U|j{>na7`HU}7yoHVrcyR`!x!ldU93hh5wk_m3N*5YNuo~iB&us|A{QBBy+|gr
z5w~WbqEX`Imdj*%mG>0yTE%pHg235z9sI|sY#?601PNHO-TQ@v{K6%S*Y(BF!B{89
zPKwR~hRcVc@-EC&2aBeS)^UE4VbP}nQV*n4j2>Y7DxGR%1f$WXcQn1;@Ko#S%9|+P
z_E~}eF}Al9vez)$S1=Z0$~cTW_%M&g$nd888a^{_Mh3<)NuKpp<JRet$?_YF5x*KI
zE}L}D>Fo`Ct4kto553=m?%?={YHmCj?Y73$$3yM^Njp874cCkFbq4wlyFLUioK3oN
z@t>{h9LWY<BQ3>rUK1H<1ivsaCMGj_gQ=u6etCD8d%K;&^bUEQ&@%Gme1w8fB@=^g
z{%uo>sxvino8q0n>O8v}&IZ4C9VlPHwsCG;Uk}q={e5n($P^g*@|LKTK({8TrM~--
zCkN@p4GD88;`|B|=kc=K!yNhN>g_*gul)Bkc%koTNMh%-{kr?&VE1MBWcPLZMW=nR
ze^Su^>bRSJzJ#saX!Kuc24pNX?9Pm)hV9kxyRSz#`1$Pj*4wziHT0VYqvvfCQ?SSz
z*B6ZGw~xo~*kHU~aRY0Q2IDU|)R!h7yve-cwlj<F^nQI_;6M)IU9}RZ6%#+-`nP}a
z4=AU3xn52YD)(MF>D|jdjX??8=zYa^Y{KW!qX+o!*7pxL-GA}Q_WkWg|F-pDYx~i|
zhu?4Chx@i3-oO9w-;&L**oWHB41>j!<lkmzKy0%)_bs^oFZw}kYB=VUU!%>n|NN$N
z+)f&p!@}A6=lLg8s-yrHS~W~g{Q6h?NRxZT_<E9GTuzflubFIbZvMEwy}9+Mm7Ju5
zk0?uK@NIOS5AyN2NS>yoxBmsfST2TGEUizN1Vi$Z?xJFgZIy&kJ^9FK<BaM9v_GBX
zXEXN4fzFD#Ao(aMiy2l%!e7ondYupm*boFWnv7ziDW%xTkn$<H=u(TkSYwoVDM`WL
zt{J1lc`+CiS2-meju@tvU0=g&s(=DXrElc2lun@v%ei8}hf?vFF(_Wo%p2w?Q+>EK
zVqoOr8VF8?`(gn)v%P}1GN|@sqpmCPN@r5ED=^glte3@lqrH$$eNk`3HK<MXi{8wV
zEIfD*7KJ^Hi1;wc(}9Hv;8kPym>q~2-=UN-<Z?fZTTWw!4%=T##&0SK?1I`rOlrYw
z!opo<t_#fODJVU2f_)ew?jcVPJl==SIa&4SDlg8bS1ILJ8=}IGU_12S*&Io3f;2T^
z>MBba0U@2d>YOAeM=wr)+J#*U-`^Y`{i(Cx-cO$Y3>VwU-qD+%k2^14ohGl24))P?
zw|lscj=a<3&hxjYNASbS?g>1(LOTYo?H>M&T;RBUa*`Y!C!N=C4m!{tyx@5E@D!6_
zlFs4Y!Q1`L;mcM6Z6t?Br<`{Ux1Aof@Vx|bUwJY)dXc<tAMd?_KX;#Z4mzhl(<@(e
zP7m>QFW`N<$(!Bd)6U-8gWcog&D-NQM<>)8j&HwnLhxtp{SD{?yf<n8seO2woV?mS
zI0%M&^wVMc7zf~u^?93NJ9eKRwE1-~+I`@7d#5-o`)v;<5juGQjOR^zuY+IOe{REw
zc8`B<L9@iGjt)=S|L<G453VQsyRUa&!WbJ1W(QVi@9lB>HFg}!xUD58Z=au>c23`(
zwv(4fNBcDGC+*`ub@tjPPm+V96PmcUC+!xz<a8HbkFCJ0!DaaV{Ow5x=Z_}+@U(q=
z{PxXh=jgBrYyK0=5X`|YJiSkIeRN1;hRHfQ{u$fF$)KfZB|p7t!|$->hcdj=<6WE%
zP(V6+r|zBbR+!IIXRyg(`{hCBW&3cijaQGbp`SV@?Itf?=LGNR@XLSNg*U&&;nSi)
z-}tLT%Pm^kr1K)#-TzYuJI^;`Yd{hw9U&k1_2li|E17*p1-bR_`KULT0k2$<Jod{K
zv@?Ir<7%BITY)(duNXL2*3)B@MX5fzlS|#JKVi`bI#+SWr&P;;&6U^mi#}6~*7@Q_
z@~XJXFw6W(aL~xSJ<JdeF)xQ6;7T?kxCYZcLEtecmZEuFVF&arcpY0K6Snk*aLX7;
zgZhDeBZ!)>IdQl^HP`?G{|rpBO}*T^?hUd=)7-RSN?Mr52$+JbO@$22M0g0+3D#ks
zFk&8AsnZe;1eAGinc9u3{cKe|0ju0fx$4}>MMn5wK!@5{TAB(Q4h#$Si%JG^p;DP?
zh3BbYs%T4z6sOqYyHLSEsFx$HXNBuijM1ft1NN2(kIhZ*F_+d-?Um_?!TL$3UHOp+
z2BTn<mTe=5U^GrAZ~~%HZ*^2$t>T@8t~Q%cs0kOF_3Ka|fTbzMN!3!=8(`K9QHUrG
zZCaqoaCDtqWK(RZIPa&|u-@f$i2#?Saj8^@;&gJ&e>F&p**{Cx`e!XT<a<+&0$uBa
zv|$5#sc<bT&GtvsVetvjVo%7IBDySSj*Wii7#=b9U?-V+z-%y1jx~}N5L2V?`o>L!
z9R8~arR*gXtb7U*;>Z98Y@1{pvN-Yx5v^m_!dPYv7$~>uJ>cMxR<2sDm2}<ESr@9p
z?36q8HdUIOXIHe`z!+vzW^6<u>ENOO`Q&oQHB7PgN<SUrdMRPk9!2pQo7j8vHtFFK
zmQv_(!eB*sjoyXAAGYpQbX&tsMC|~nQ2m7@y|{pFTH<>wL6NMDRE3d1L)dW>+5ptE
zvukXJ=v^u)j&Pe+_T>kG_t9<8CbVUl2kLq<&9G#wsa2#qxqNKFS_z?*dQ2(F*bpoq
zY!wUbiMRF7HZXE&$e3r)qrKy!!|wj`lkS`Lad!{p8q+$?6YVD|f{8j$MqT65qpnow
z?lv5za14G8Fj@i-yDBChV9R9U4;Ox)tW2-R8A*c*2n50w&z4|d0x_(dW6Uy5#tJqF
zzmx+Ew4`5{Fz^R#hNnyz#}KCgfqD?`n~zL$Br#b$X3_W(0ry6%gG$LIdz}Ae1*Q?J
zfsT6DNkfW&BUTF#%=9ltKh@)ND!q}e@KACt@IriNMs^|em%^`7idTq8t0_?dDe4()
z<gys~EDfn1J<R#&WAT9zNp;R)=a{*oS=D8u6B+{u$9%D+M-)d;o(!^V>>hr+tX^C0
z>8I~=))pP#bW6X$f$^pw5;zBS!lM?WccpTI_EEzeXl<!vdR2H^z^H6F7BVQtw9rPM
zd+Z#JSbhVh2L#E^pW0ovFLd{Q-aBY_U+kWo`t#@x2>s3^@DQ=B1Ury+disHY&xoBX
zm|)$Dy8CaBcTp@R87l8h3OTR15WT>{f;P(-^t@Ru8evkRewYr)Fo~0*bV2p3s87^+
zB7;eGE*0Eq5L5E8OI_Om*5I1D^w<Z^MS!(y#%JcC+^2lZ64;lW<c;O#_~hW|C&7Ii
zVbtWnpU1qs<$&9^P)3yTI`5=v@<3lb6m>65(8O^Y6teEC|H4aoL99M?a0#_6Z(Xmt
zSP>rC+#W&_=A(?NZi}XG>Ab}P2g8D$%ib}v6G<*GYm?b{N;0e1Aw1k<h0$}Ra@}lh
zOBu!-atr}UaIi!|RWvri6tffI7qH?Zs9zA+p|TI$h<K5x34X<f2B6JTg*!Z+{IY1H
z^Za5);yEwUN_Gwe2*gjcMfN71RP6Eq=FAFcI3gOaLBo_|g}Q*WT!<-z<`!w5Xwci$
zszC9AM3?T5?VtH@IygFdlWcFI!vGQSh?`P{z5VCJ)ku1q*OIp@5sPw@E1ub{xv+_V
zj<z34sk7ueTz8Z;um)V2Eo^9aZ?FC46wLyNk9^R^!vvb5X5auHsAfgjU00WR@3P`m
zTH-^|IPA(ucx8EroR(2leNgtr&8?Cr6;v<*H^5s6+R-5a(BokJnF6&4g-=o%)x)pn
zLq!om`8R?+YZ;TAVwh@6q!96)+7{uY87IGqOhT^A{&a5lnd%=rP|-lTe03dONd-nw
z^v_sI+Qd=(Xd31oba5fNunD_#bUs^xNbk;DtA&r>d$7h`Y`MLl{nEv))a}niH;ebh
zC-b>|sqc~3$h;omo~F2HoT6S$mx67xM4yuF`d6ayU`&c~m$yp%rQsG^Uup;OTWtW0
zul`@+frBXQ7lYy~C0To#d0bgb^)N6ZutGz$)_8+hlgM<+#HyWm6T?+og2wGAns2v%
zX3Ec^hY^_`Zn;dL_npUc(Ua*c?ULY0PbNAdd(d9y1Za!}4Dw>e-T6b%oYh|`UX&=1
z&vH`^7nOeky0WKeGD$}kK9(TQTUK$fsjd`!c*gsSRG4Q~jpRw7M>DM9vt%Y|0WCY+
z7U-JkxJ2A6T|nv`C!MjSYMjo*4n~JD785Nmi`f8EiFD8?ni1bq?MYYh&C#F8l_2fm
zeP<cTu~Gn(urQq%P@{hFlZG9#)rYtqOn%R}UWo16W{vH|3uz?jWRLpr21j$sN(HFx
zTo0miPCxe>PEwC~n54I7^}Hhp;@zikPJxniS6JjrOFXV{NeYkMaBD{QNo1X*co4PV
zNqSZ&a?U{%8*N)C?Of&;mmA40PVtD8E|#SIE~=4_WNDQeZ98dc<r5L}3$(2o1{<m6
zOy2%rd)>L?v6hI{iy0NO$fxtUS+uaAAF9KP@wBob?<NhiOPclP#@hCRcT_hzy|I#<
zhu$bwg=GVgrct#hpyAc*{g$ZMvXrFfNp4^HSbo;4TTLN9YM7+U{pTg?T~}yZ{g`d&
zz1vMxO^6K<o#AzX;&bT^e%8?B5*2ggInbu%(vqZSyUSF<AiyeKqk=o)lK>boZelO+
z+27@&0I+1JRw5!zPwDqcGq@~q$H3#BftrDVh(7(<)eJbP`<Pec1P3lPML^t2R_C1P
ztHJgJ8P}{`&b!Jn2uT$9)H^gUu=qBWN*4cU>R3}OOEkt7YM9K<3CrcJz*lQ*JD;qA
ztgX13HW__js3n@5%+gu|hfKJcO)l6~Hxp}H97S@^bo3q;JNBEf=dI<prunB7I_kb|
z>n42JEOTv#y=_isGug@m1;>c?z20m%L;FBQrXi#HmHHIKJ_-bkJC1M8`&p`UZqth`
zw!5`^lJ`k8;z4nd_lRQ{9|4|}!18VUKY_~AGLNWIxT`h$HK&PNcY(Q&2X2)W=bCOn
zo0CW3Zcdn+w`K0!sjMX5=*Pez_JcG`b<XiLW{*#bX1$9+W))I>#?w+94+(ePVZM%o
z!QH}l8;&ISowv0Ez(l`%AFwBMCorfqE(N*mxc(s;i*V({yyPB@Vy#fW3$#Kx8kAyz
zhmU7f-e4&itN2_YpK}{BaS)D`2Q86S1_tiymrOR}^hyCTB#X$_#yAKAk#HB>;$kRL
zlbzc79r6-_r5a5>V^bc@4Yx3=XN(Ees@eLa?Y0IpiAM=}(M~;irsX&T=N|gr)U*6Y
zaZtQH*k)d;#he|3j;6gLlOe_%Z#Lni@`E>hLWEJZ&@M9#z@I!<7Hs_~>@z$>+<QpT
znCb=$8Zc*qw}?uj=k`d2v0jP+K^>}aJdQ-i@sJ!$+gJ_)k3#l_QO+EeJP@Ipt3GVT
zB60Dq^y5Vrx*dnxIRifRVIJNF&6U0wzk6@?pA55?!)YMZ#FD89#BgA3eFw`==Ow*P
z*aXcIJB<8(!`X=rByqiFBXm-=aLc2mJmG>0X-+&9+22_<MXM5>vKt$f0tsZHVT}YM
zue2f&3=ifRI9{2KqbtHQvy<$1_D;L6PP?7M4hE`pPdfkA4n<`A;0ofIdXFD`3esLv
z=RcgOQ+4GyVGp#EK;j_kLw&OkEQzgV!$O>T;n-OG(5M8&dTBBH*154k5fP9Y?=<m<
zB0PfhBm1W20`Hqh!Z<mB;jx{l4XTQ1&U+ztZ*?kP5jki;2)hV?P6xo02NYbFm2QA$
z7{lPtCr%kiR~gmf?PZgZy3>Z_D&b<97)97CW@97&A$4u^T47_z>d+{WPWppuslmx&
z8*G#7ES;1gt%fbwy1!bda6EvGQC0_{;dEHh_PWv&J}pU4ASFKKon(9=F^Q)-8W0Mm
zA_KWcgn9|-2c<hKPNt89Ex{a;69T2X$9jzG0iE_J{cx1o_Mo>UU1LGPuq{F^!s#G5
z5UM4J(0npt5|&9T0-6wotEN-Lr(DMd>DZNu!}y_N1ZzC$lsv;(Tif1@962IOIk$#;
zLsFr1%RMFH$GraF$*1lsV`qUW#>WIff*yZ;inaOZYdoI=KP0j9gHnm&Hj;IxJkF5H
zFgM#jl46`qKmM7V_dnqQW1sGFb=K->MIC{=?|8Sb?_5sbQQzKgAkQAA<%jsQUi?Z@
z+X(&h4qo&=-i#CCG9Ao8Bt*(`rAl5LBeiLa55BDyAS_tsI&3e-F6dXvwFg~#nN4kM
z1P5o4v~0Cl{t>ywMK-N%DlwU<bCJ!Q`KIa4;+>~k`G)l!C(AnaVM(SgtSD=)d)2+e
z4^r`*V5k0BD{EmaQ&Z2ry7|_|usb_(*~|T~8G;Ql7}Ep%4aM-&(*q-lU(cIv{H%$c
zk@_`v+GU>TB)<EMiFDz;d^pb=ZyY}kKf;`r2cE0`Qr-SxYyLC7z6+z2uTLU(DeuJ6
zq80rUKli-C^6u)ealq6muju9a5n9k`jM0MwgJ~pkS*3fPT2XnDtkR@wv*;&&N$scF
zn6fJwUMM%<hX{~N{8Hu1@E<imYdcpN<v9RdZhseRM;({O5MJNFk3W1DB~&)~IjRY%
zFTS!O->MYl-{!V+@8M>1?ZJ;|7j}M`n^kD+gQoZt2Be_4LTW@N^^UF5Lh+QMJBKoY
zBzPq!g*dV`q``)@c!8W+pS-Xh7u#5m3wXMU3<0`PLIv|MFSa1AHCh+con-UVxzQAH
z;93f<mr2ye)+4LN#vv=k+vGT-)*VxM_;$T}$6A@{7-hwvxD{t5F<%2&EPLs=JHhY>
zO(d^lMiGq{KcDCD8YU7pcZ=J_nq72ZbUWFA7l&*rV(BQcCJ~1`92ZcdVml;-p>j;D
zNn90Y^Ys17I-f)F5tl#t_1EgmG~^|$q4M2LtB}?BZaf#seB!9CoHR<yM=na_;_A-C
zN6=I|>Rs>l`>gbK&JU@ob3+V3>l_Z*l84YdZ7LL5mX1{&4U5v#))-x7PW_m2<77FG
zv06?oVl^BCLS`egLmygx*Dq$cwrbr&Bbj3(ch4mciPO2AxEr<7^iI2b-qUW-aa}W;
zbxYtm>fm+mb8DL$n-81I#4aHD%x@do`thOGE&Q6<4wNU-7U!}qF2{nCDvj=G+GFJa
z*07XdutSQ}Lq8t<ibg}+MB_<8HUg1D9&_#pa$xblloSMnuC(hB{DR5`Hn-nCuo(n?
zonA>Kv^6}hovahTZyJ6~<{I%3J|=^&<{3ES;*i^vgTNgN51OS*R<0y9K%9V_-$J3m
z*78Vzj?{e1=m0uSTlMzChy#t`<YUt%TLbLFCRB3dMaPu|y?Hu8prCMJ>;TB=;Tx(5
z7Yc1v<Ze*NP`-A84`D!@6T2(sdC8&GqzUZ{wkG`11fUCdz7As-Hw=ZSWd)x=k%=nA
ziZKE-8ZqJa3Y8UF62@7KXM=Qt1~m@$q_LO<PR6sTN0$V$<OkFY$LKwv;6ab7G)&u>
zHsf#_7UdM^89I7C8&I@l&txa1eL9rbUxPLdY)EJwO;qVMIW$He(6vyaErG2hS<ldO
znoNgdrjyX5Sa7$}spR310g2doiu1t+8xy{1TSl)CNgW#LYm$$0KWiEZpV`vjnzv~-
zImftmia8;}jaqooMl*opUFwmW#ZH|@nf&f=Z2wM)SD`uiQtXfDqaxFpLZEUmj1d>G
zB)aggD>Bzn0J^yDWwLF(Xe5ES_gUO26oSs{a77Ew;tL71J)&WB>E~!O11=UMOiBF9
zY`g)2&#DP<M^RDd^&EEcj2VszFQTe>w4P2SY|4t$!RzKlq&v~MDS<Iphq)WB>&zm?
zp~2do?4Ka~8`6%k+&W$Y4RG;u(3omT44Nt;2=CQL50W!XNO0oM(2!u0n$I{Z8HleO
z7nH@}<XfSS&_r|7x}nvC1Pk0nc-z)SvS&!w+$LP`ma)%cQ#p#skM7fEcJzFStilS?
zA7QD`OGe=U1;2v(I84V*zc5T792pOqmI8<i8M<{y@$q7MLX3Prxu8zUo_ch@Wj((J
z!rAf2VU!96i13lnQw<qcFj*^=W7}0X(C4^g_NY}NYqpMgXN5$$%b`?tXoQ@e`>5>Q
zM!HednHWxp6@|wM{%9}($-finw!xLQ4oCIKMebL1%a2JLO*O{@F1BE`Go2HW(+oDR
zM*jJLz-;T=a>d4qVUz7+$K)i!)VWyatP&*Ic9f!DpK&)c=yPXzzqB{L6)KCR_j%8a
zva7B>8$eoF8lZiQ;r!(^Oh)i_VnuCU<LxRWVYfPOkV?T(?1=BD5*sRY@Xj5+;i(^a
z5NNNYV#@;<ymh<A4O<uEfR9ED9FEmgDFc6dk&pVWk-a5L7OAvA6;&&-AYs>~^@y($
zKXdG){s>wULO|5ota|I>8o%vcMAiQsHG(<0z*lMMvPl!{wEx^nyOv4D%ve4#o#lpV
zfJ%jC$c+Upz`KZ)qGq+-N;n3^%}cbXGz2|EFg?mu9%d=#-9<ZPbFFj)9}tO?MQCb1
zr=41BRWnPP+?J`Sv$!bRsk4*V&H5`ShPsEFTglU>Nt|xynNaYF@J-zM&d#%X2(J_4
zuP|$(i=nek$GavQ8HvGV3r4J}o*jMo(!;}98t_#zCrR9GuV!hlvW3f+Pb;ytW}5wd
zL#Ij&Yi-$Q?7VsEzqYVXKAITwcX)?4-=5nSG+<7+zi;GHwv?)}iHgAl)s%@lKTc*F
zZd0+!`7uv){<#FfdEnCU4nma&hC1T4a&CSH0uG<8Na;h*+5``8MIT<~pmrX!dD=#O
zC7BioCL@>`pd>+a!k_>cE~<Tk#%$cx1uWdBspiR5=u2ghIr6cWfNzrCmlRaIlzI;J
z$7#TF7)gIhMP4dY*Dqgz{M<@{4@?Eg)ke_>I1s_9hY#6jk!km5;~PHpk)qQpPf0&v
z%zGTQ*7BahcS$%~&6E2XLsS=&>XUtQ?Mpg4_u-mnsoW+86N;*b1mqfV9YHNBO5>pR
zNL+5*=}+Ba+Mf-PpxhujMj(&IWXIip|7b$;Mh)+9OK#YcSqi_yrYBF6i100z$w(tg
z3A;*px7Fv=;2Klw9#>JemAztyGTc^_nG^m*(VXS=sAm;9ily3r&hd(J7-*Om!xNlc
zSM5vM9GVZN6evQP*E!Zf)$mDv-VbKa)^`ZI;#p#5%9YjiGK$?m+>J;Dlez4F(>J?+
ziCA8Lup^Z`xwWtldi*etJQhb*H6q#=%u<Ruqj?fE_KR#<Wp|9QaRXH>M4FVp<}!QR
zZCpFYCKy84p!vhlT3-O}NsDHK8YOq14`$`13veOQF+PhH0XZ;8hN0J(8y%h2*!EBb
z!-M%As0wtDOxdENf<>BK6h)uH(S1ywp=-K)oJ_Oc<w*QTD8{lL%tfRml1j7RC4_tb
zx#VEUfNt3kHL)pO6%#B6Fcn*II=V)4@+2kbJcBhiD|PSEV9HF7KWq3R!NETZ6FD_e
zg){R4TXcZtOV;e+rN)d-HT6!Vyc98;6nbAy*CiL04b{Xq>?unFJE;-`)(}{R=0c78
z7{n`>#YM{X9P<ZnW1vPd3ZM?W%l2rAx3~FCM0QS|vWOnU;YQg-O8(%}Q#haC=;4dI
zr)t%q(AQ}?9HU~$R-!S?vGO+|4$dnhFBroWumu;r8$|PiB4s<@?$HZ;ODN-TV@y)C
zq^QHEqn^oG(px(4J1#3ShdwtMfe=u8mQnv{FiP+yet#`#jEl0&&#V-WV{3AjQYtVc
zEcOrb9{i013ihC_JjU#!K?8njEia@|$;QTcK<aXS;#S}sn*Q!iE~zV6{$AE=-cmR<
z7uhJAfW&BITHh{zZV0WFywNX8dAB4`<c<EYkvtc~4W=1xk|QAu5{^cxPO<?LG_KrP
zSqy+04M+{r0@draj~OF0X#8+kfgE<Ft{b8p_6U`r9y1>0<}HckU4uRHF`eWoCbw!_
z9`}tlk{73kjo?G3cN*-doOd>2UMX*Rd)PVcp0xLl4nfQ*<nPy=gM*IzXpm8g5&LfX
z*uD-_D(qSK0hV5L`0Q%|2JAwD1W;k2vGXObXr(lz3+1KlbD<O*l5!oRe0aqHTge*r
zFenR%5BSWB^0T15PjOVUD@hIzYxH1X!f8xaHE?AR8nl4W3)sSp^kwS;@?^D=JJ?!F
z1cckqlD+QHA4AY-n~<&ivrBz=#$9>p=Cskug2dr2X_N0;dq&V2YMO;#?mjb<Xj^DB
zv{mLM-aDI^<j8ldoAuq1Tm3u3yevKjBo)aV1T2M>0#U?)&affyxWe?BDZ0-PbwxkG
zwt<bEqY8q8Fw-v$8WsnxloTC5vBU>_JNJ?b@l#hrFduP2ABT72@_$#Zw2)?c!@g8(
z3nA59B?f^23bytLlSZ?PCwQA;kw0NlI@ai9EVpJ%9oEibnI*0y*~13sm*_Of=)o~v
zSsLCe>Fkr6$~-cKTdWm$kpATwgW<dQMItAXKY$><iyDj=aGa4mUM?OZ`1H?CVy!ts
z3iW2Ugny?fr$_-RoNnoI<>rlkKAB#JIcqql2-%$7Ln(pmmF&Coj$h)22c5$|`t&pV
zv~Xf%t!ASEI;<b--+i~h_aq}!0tO5aX7{HIm2w!;b_-q;j-C#U*913BfPh$HFfvOB
zvwVL2M**;FBfwbW@aVMj;^*$m_F?<Dv)5XIo~+QkQ3I$>ISn{Or#*)aR!jIHk|1n8
zu?ji;YZ389-w}Vs*BmXcOZ|XDQi%>z)G^^@$p7_F@Q<(BlFISZt);?S%VXP5yw`yM
zK(Z$CB>!#c^rr9IjKAoOGcfPS)Ax<P#_(LhB7C(Ba#(h~agKlEK%=iTnD-?GP?Hdd
zU-YHZ>7ZT=K^9rersLVPJ2XMmR*cYGRSx}K-?FiOj%&!oEwL+}(c#RYvA!KWF|fQa
z^1T;W6Gk|sBjX$#9sTj`n=VlQ(c8UObI%i}zTx`zq7zNbQQTD!*Tj&rPF3(IH;i<D
z9k<2souwv!94A*iBI>O$T-EpwFD&N>#^&I#%H6kdYTcpnbW6--wK%QjL6B_YWtv*^
zqeOZ8?Z&2TYf;HV=Vn7Ga4z5r9)k=8|K5GLx!L4k(4Y_^P8CkKLyNVfAE8q$o@aJe
z*w*;QjcqyG^!TK6a_YB-Qde2OHERVPXKBNdS!}GVBZNw|)7o>QLOnM*GGt&Y?*57$
z9qyvno@La}nlq+CLNzT0V&CWa^cR27P#E$DT*s~C9sGA2zur$aHa76f;d@JY#jJN(
zzqVxMo}t^!ZYGnz_Y3*V3C%%@`!ZsKx6~eI3)cFV_oNgt2b1^c#6`B5+`-iPkFKin
zuk)$Y{~1oVe*E$N_v?=yY+Qb&cg(N<v-#-$qe%Uq2jA-d{5?MR$lke|?5&R{#RXbO
za0kCWRU$|l+nbvY?)`Xg`^Q97>?T=C_o$L8=;5d7huJTAa+sHw`EWK#Ntk+_eki5|
z{4*_QL-@8qGLYKsFsN}IgISEyexAI>h}+R9OHQwHGOUlwY}PLXK|qmQ6SntJJxOZv
zIb-vZIlmRgiZT%3*|k{v@oE>I$2K25Xp|YS3v7d|#Bk~Cx=WeZaE<;ZHU0xvufCXG
zHu;TCaiTpcPV}Hv87|F1I5Cva9xX?N7rsU@qU0+SBf?fpJtAh-TN}Tz9FeE2eQ5=t
z4e8BxwKrc-k?1RQ$dn|K&sV8Q#I4<DE9(5ZLySjgY|7Q5L#AgpC_YqEb;vg5R3D-(
z{o88~VKY*G=*w#lVIx8Lp)adF#O$zIeyCD=XzAiZ#5DZ+Ltj>W2pjV14}DqjA#BF4
zKlCNVhoqHC{h^x|AL6Bp)E~NG@gZ!duKv*S#fPw!MfHc~79V0}ex6OTQ7>cg#M2Gu
z6iEK}e@{``qKz%*V0ieItE;@@cK2RmY}cqv6^wM0fUc7f>=0GfNa#qSY@A7Qk`r_s
z@*l)v#<Lr=-TM!ISYN;Y@OwJ9UvGrR)JAYbCD6mLLyz&y-oC%y2gWzT-OnkX|2NAm
zl$b&BoQ-ng!;ur*9^b!xgg?Ll{}TaiL00(zMhRow<mulX!ASt8`xyqsDNxH*Hs}>Y
zcJp3Nr{l->?p<A7Z2)V&+_=mq1x`V_KHErp8^4V2{cX4oSMI$&y_XHA8<*1|Su!##
zFZej2YsvqU(6ePPuRgC@EMq{G&0AcN>U`AC&XaCe<g4zZ2i;c&kv#bM76ApSJOeC$
z`tA^PGjW!q@M83|K(O(FOBkIuBh|=n6D1>bxe)pcw~JrbS=_<a<@T<m_OZhc?>-lq
zi5k*kE%Jnwm<X63jvd>e?XDwiMf$66efK_q0ZI&wRi1GqH6E$Z8s;!1J{1D>yxVLg
z+y4XmZ|nU!<$GaZ9P}{Ku$kE|g&}be2E1a~cia!(QP=c+)ASN8Lz|N<9e52(I<IXN
z@7TIgtIZ`_-CnxY#tm9seg+yhm;t+F|BhvD&cE3Q%%`INODUYMSpayx{=fC;`$zXf
z{r}<p```5czsKiZO|{+a&2QCqzg63nroL6%{Z?)FTeaP9)pl=KZP)$=|4;xcm*7pF
z)qavaso^1FNIB<Tyj=o9_iQ>fY;l6fLiAJiSW&%7G;KB1=}uwSk{~BHag;on)Z}Sp
z?N`kWblf9wFQ!kX$bARbSSy2}xN<=N(fXRi>1^FruQDs$SX;@}R63>Lt>@eio)D=e
z;zl8u{A;JIDMfy*@0??NKyoM917>h|+I@a-wD(6?PA7#HZaNzm;|-Z+$_X|X5w|nA
z{*>NAcX*L~uQ*hnW`fE`nt>U9ssg1OLq$_~T2zMEKf*D(S=l_ve1~`Ci^`cYoj4UA
zO*8}2#b_OUr2%1Jo{%ZX*Ehxf{5lGi2;4|DToVUOc?nX@)UCo`Dv5HXg`5Fji!tHA
z;ypPjj9!skiNvLfYZgWAO5p^047j4UT||ZBuna0iXX%YM-QJ`a@q#WOHz(}H{)hmw
zbm<;Pni_&M(dVCXXqu+Sp+pVm=A;jvO1#fh^MMH*3AnUUBeYs(K1JP*(EZ85?w{He
zovMME+5jOW3)~It$YC+cNx)dp;OpHJVD;Q$wLwK*TF{8>Mrx(n$n%3YM{gE2@di$>
zx6kYP@n&{*?__pnCeUe&iWsls?#7ZVq&KtK&6YE9mZ=$Tc)sPJxM&<4bm5SD4uV2!
zWp7Zhd(E!einCEMJaXCnJC}b2LB)G~raabkA?3$+2*?04rrnxQ!qu%YX^pc?q_UGH
zF0snOa2_ZuN|IEN4lO^+sn*R#s6AJ5*l93)%dzyxV|WHAt`~tLsAqhiouDPl<(R)=
zd0PMUb57E$OmLs5c<&_bV~{%{T*EYNZT~>%0-T??Mv19~z#}1Eicyx{!F|{0RLw6?
z@Xl?fI=<)qUA-=xqqF~Bo;28m{et*VZ;+*<*;un-j!kzS8w41vgkd=`XErlT7UgQw
zH6?sW&1qT4tcjcHZjkg~g3Pa!J0`P5N=vC_f2bDll|YeR6u7NGXE3U4+dx8Lswj_?
z8Y<mfCT&Eshg8xq5Lq}{DtGGF`lU#C(4(2IJ(4MvF*l{GtlJc;)UpeldE4-+c`9!_
z#rlQ^An$EGk`2WxR|=<3?wTLWT5hPk^^yQX&F`#BnjvGD7j<Bgm3XEh5R#=fvL(Zq
zXXj4h#|ZUo863uN87pk>GMyxAaC6J1keWADBiMu*o+X#lVl;d7pdr7={uyS&-uSwK
z&E3&fFwwI(H#b)9y!%7zPEYUZHJwOA^BV>YK4{`Ia4gX?TidP8)`KQxll&J76=Tdr
z5d6ja+ql)HAP~qQ_Su<K20G#i5wfhzP7?z~%VHpDq33xv=<`WNb8m=3k4t29Ytv#p
zofxfOrcSWt<(3}YVHc&J-DFX?eY+;qn68V=Cf|b3$<*;fI;YY_kRztWB`%&^_Ew}P
zO~A5fBRy$@r*T)do6R@Ujn_}^S$?6AQo?^60=*&&gJ4x%Is$Hlsj{Em=n$kpz)IT!
zHE4Lb#c&+CeNOQ>l7<K8+q9DpjfhxW$O@3tFdktUO6xwJ6CEeP-r+nb_aV8@TVj~z
zcOk!!tf>l3;;QPF>N%Tal72d!Tz5v8vtbWTn#Hc%-zDp_OBe99NeBT96JU==BOLtt
zOgUNSuzPycrIMnNlxdkSlS#?RymZ2F8k{gp&T5mg?sNq9^K)|IP8nSc`by`AXfg_j
z0q@~;!bGpdD;1OGoB=fbRkQa#Oa2xc?mup6VOe>WZ@#8xr=Et8fT9TH;fd%XPwD|D
z?=!fLsZ&n}8>ncc;n{3d2wKW{hi#a24P)o5{W&8KLDjsK3QG{lgm$Lv8c!y<`RxSJ
zVj6cQd28<5?EP8xfo@;<pB3Ig25gv-!{8n)Rg3p{vD6_MS%K3KvV;5(9u1Rx1Eb~4
zp?b%aShe0BPWsL>wpTEQ4Hdi-pgtp~I)zluX9(ZugYqo1C+Nm{BMMbda8!}yXj#U{
z|DdPY#W0yW{f@wnD_V?c_H`RzxeH5`oFqZ~3b;-|siRz{ojftQ9OtWY|Eje}<d{<I
z959-9%f-&%z^hm!q$a20L*5ctBz)e<ZEYo&f(6WJ>yuK-JsQK6S8-gWk5$afT;<J)
znVne2SKf`vvYP;0fwL78Oy#uH%BF^$ll+1T%*Q;tqIy4Tni^duyKg$I#xa=L$f(Ip
z2YAoaf^#QT&^}G>CcXrOH6fr#POr6-a84z!n`1RuGeT>au<X=nfgU+I$>PdB=bsJt
ziD&uxDHM``yiYB}Qjn#8cc^hc#A3ynbrNTi^FaY?f-WB}OE|$AP%Dv?WukCaN%y+#
z<72xu@HGhCZ7bm>4SF|BG@6Sx%r*%Pc}wI|>tL1`%gDf|e(`XeBwHH5Qy)#yOD~4b
zd0mjq=as4*WX=nM$}RNU-SGJMEE2Sl0UW9^uQ>W6@*L0qTk-#wm+975i~Q%$g82Wf
zt<494|Np_GM-RXG|NkBzjY&IswY%lSqRF2TUroXUQvIERziz>Um=_4tcI)|dax#T;
z1H^H}C@t~(|C9BHSJ~MH#S6g3{|>E{gS?mQ7l?jEVRBe<7rVq5WkUHVp4{JNwApF)
z?&13<{?An4z+gI5WL=Qt-#vN&S3mR6_D=r{n}Z}j{F?$0@hodp-qRvj{Aq2Iu>VXm
z9bnB3ZGTNMXWTou+C%l8=v&qZRi<SJIiM73)7T3<@dK^ApI>ApOvEO1Jk}EoLd3~E
zZtr(ax~J`vQ##ymQBUDPO5MU_t(GYHYnY40hZY?2Si~5GO$np=7ESdp|Eci*@$9Ue
zoqf&luLb=7!RDjwkpDltfB(@p{{Q#*+#|_58UnVp{VfFSTL{><5U_6{VBbQ(zJ-8&
zSqPXDUUCA0MQ@T*#i)`IRIQ2p$?t+j_=aQ|HDF@UQJ#@m==XsoJmL5-mZ0E#DNC%z
zhJbyDWW6Fktf*^<yS2fVFDdo4IxH_%IYpW|q8I>?2g1=~FiW|-%v592$P6y++tOVc
z$iy`osb&(lpO%6WolgzKuoj{*Z8AGd2WB7*PWoZAOf;qJQYsJ*u4$93<;+ks$XcUG
zcDVC&m=CT!{}x^6C3?-TsM^u6-uNgR=%3L0!0(0C5zrd8-K<z(EC$B#Y&Q6C*`K_-
zuTUT!5WVe7d3lhH;JN!vA7{d8ihGI;2KPLNpAdV5d+d0?sMEn+_?y~)7m&@khHj+#
z(79w9nnFDUKWU#K5cO;TN8p45TjDd{<oqrUun?mucjTNP^0;D_?C?@7!C22~#G)45
zVq!83A;uT`O**YzZ)o#(TKWe|F8zbrr5`U`d+7Z#M6rk#XmXhvN{4AOZjA`OAu+_K
zT6peR*00@K|KR;pY7dv)Q4#2u`tzk(JF&CTvQtZkGIv4!7|1*y^DbdfS1e~|ph0D(
zk&7Z9AEsr=xT|KY23Zz?FQ=wz@2E&*tR;Io?E@&hK9(A3<rG=AFlo2rbyV=yHuO(R
z2hLy}N?;^Q?q8+ZD0xIXa5x(bObp#uA|T~{zj22GGn}_c<t_i<#ThTLOSPxJ%Ou}y
zx4x05e#>qhFST9G5%?8%EA)Q;hW#g@iTWL@9jx22KB@d(JN9b|_^vjA@WTU;uLr-M
zA`z`rVUC8oN_M4<K1HjBAsHaYAhdt3?xn!lK}`yvDc*%$eY0O?8SP02ly2|bsy(wi
z+H4BbS1z!^ZQAsUEmc>X6p~r5M-kGkgwq^0Be@xh$?pwcq7L*OG8bcCCXz#a;fd&#
zo)P~%+S1lE7|^YgkdvY*?(R(s{i#uj(zegFlJy<Cytc51SFVNY-9%PJ4?vDaK^Cyz
z**ir?wx15eU2=+;fiOQg&d!A#yi+vnv{^WJ2+(O`Q<Ryg_MIlss|_f|ftpbSVMG0B
zktqDw$;VDeVW9wXQ73KwD}|Yq!NUutCyLu>J0<09DrF{Z!8z<UbnXxXsnT4@urv{N
z4xl)~Rk{lyb6YR#2eT<#n~6YorgO;Hy~%M$UvGC}&_%d2z0lm~7InI|Xp^#Qk`X<Z
z-LL>}K#;%oC!G9bZ7`a@cinJOp?wp8wA==ck`gwp?TJ}iYQ$(%woVt>$jK1oQCs-A
z!m2<YP4JxUN4b%_nG}SlpHC6yGhi$ha=mU>-hi#lkH2-8hi(>Ho3F|_YH;Go=GD&(
zs%RMEIB(w$M#5=MvUJkBB%Ik`!!CL=G*NvsHVM;@glHNZi~=s`9<{=&B)rsTKbQf8
z5$qaxP7WRrXp3G>Rf=hnx%?RePMeh3tF-h<i(~jOSEy7Wg7OfxhPs*!rK$}VPd}Rl
z<sH?Tm2k!y*IGj>A%*{mn@tz8QZCdj4!P{oe_oPzawSLR8uPT};1&I>ZYOgzIR#-3
zKpIKUGcLSF#h37^U%SWW#dT7Wh*Qh+;hTy`<^^#PNi?a2I>>SyH_Bg?zMXwlktU7C
z5EBMsJg9QE);C!r4^=PM%0sFIeieCWUjKe4c_@74GV)NhcmH(qP+(aJCiGueBwDm7
ze|M26P6@a)DrL~LkiddygCyD*LFP)!S-Pya5j$V&H?4yVzL*i1<F(q}AlTq@1Q%zQ
z|3<-O&KCbBxcnZ1%kqN7oTd5gf<?u!7re!jEpEuIm`O<{jTNZo8<NCT>+q(y4XMI`
zb_WB|%gV4WiqCe)0)^wT1p>Sx*AW|2819bun#8EJer`$q1Y|6|5^L#+*M`IW%<r5L
z)i9ft5~KQgoW0OGxT>e^32v&sSEZcxCJp@VvpGtwF+s?*#m+^ihNl^AKMxPZpOCR)
zy?F0r5v-d(BqwBrCfJpTU&5zb!hhjKqpdnuJa)K(5Gg&nkVbW<)zGN1aL%PsY;i7?
z%2Bz1N~^~n{(_SYU!KGW+1zxTT_J;y94&VSx<*80?h(iNcY_)_^UiX7Vzj<PsY(uc
z)svPH4vaMCk=ExMt#y@SEm&>}<}WeHQlkgF#gWVE{g3<k`J&4~q&D%Sv|J=2&xDMk
zPNebHR<{p3o(k`1&qkWC?^=^}zkGpdf(3YYtyu=6|IRtVD?^A6BcMtA>QLbqP$E&9
zZXBNy-CJrxc?@sU74@Goi|Q4_@tIovs=$vFaYAvudY<XZIA?_6nDKMoU6|Y*x@GYf
z8Hfr5#=vQ35mWFN9wT;(hsTI}Z|G{MqY@p*ZH^72*%@S`MuRd*n({I#;a&r&?0m|8
ziO;$ZH5Wf6uaXJ6*{j@#nypQkI}CZtM;_bL`B1JaVy92!`1t}t$B#$svg`hY1mEx^
zTm96BHCa`9?jFETbRXd7^R4Q)xcTWOqJohm<*mQ7v()6``em7ar})da&rkM_JI~u@
z`@YjJ8yg$8td*6+=9RYk#qx#-Xv2Q{@Mi|5>Kwl0V!1KEu(t=NouC@-nqB3!WY^e|
z@QA@eda?EsY&I#pQn=ZtF=d8}P&bB?K*JO$TfCs~2d*$kh0^V?H=K6dCJ!lHfV-l;
z1RDlAMUxT%*b&$n0{eho&(*Rq@!Gb7u=`iVq)#YPu-<3+AfH}4chnT)r82yB5%Ut^
zqNr%FpmSiE_rsqPGc8rHu}C#ssz|o58d;rh*eyrK%|;+d*t%_G-a|WvcTq~Tr04`u
z%&nm(okl6mD^56HHEY$@DHH-Xe=j#l(Kp7X%D&i+pgv+lWX~9~gFmxx?8NHf`A)xh
zJAC|Yi~kdE@i+e*d)%r@H{auLyiFb@Mu!@Ik6mt6+rP^$k4@I^waec=Kj@siN}dYK
z+)18___X6pDQS{(cekrHM)gm>v?qPtb}P-+z&tv}SGw?KQjF7!bec)?bKCWz-C#X>
zN)g%$Oc_k_o8zN5yDxW7+uh^#8`ZcYad2jgO=tGV(<+R@1q6jjnH0F!{qRGcn`H@e
zn;0P|89k6Pd&99aT9)`%F0;XS#p8&a+s+B)c=g?TSdzcqTEUdG!}h^R^6shZoSpY8
zty?SjjAIrOWZeOQ*XAFsfz#@MX<}MH9s4{5-t{<HU0ZE#V1tKmU%%Ns4Vt#rCO5d0
zLa&W=N*=};eP`(rw|AtUl?Km{_|7G#vEtz=Tfnz5p8^J;t;M2>OFJMZLYxMMii}kg
zo>X}5E0}C#xj5-QlTcN$b`|wKD@_-z*QbPEe@&df?^p0*Ejh+k+C3yd3&gP_M2!1}
zX7UG8){@7G-AU9zU+IY(h-;Mp#Rg*inb2y6u<1wE@`NASHfwY$!!?J&>Q8XHF2O#Q
z0-I!gil_bUMuQ&ycfQ2{=hE6Q@Bx{zs;vO092PM!8Bh|AH32N4`OC+c@_eP9^m(t1
zs_GpE^+T^C$}+9RQi}3CO_(ML%{sg?l*Y#4&bodrdeIGc3~YZOFWN6=TkH@K$99Br
z6%n7iTU38p|2p(`M|h6wWH~+8ZL_}JTyqP$n<IZaa^wf=Al68=Yi2+WZ2hRSZn|Pq
z)Fh~@8Om4Tea?wCfGzL14F^rw`<u>VpKrP*K*9c+Je#*Ba7@I6SEqx<c~xUltP{qx
zDL9Gca6Y*nP18>z7aLLP^WPOurGo#F_Hp*VDgxA^`p@4#{Qg`0=YP=W9;WK@iYM!!
zt5VIiyvN{k*RT^u2#rddp<=>|B8NQsh8*$@IpiC1$T#GWZ^$9vkVBS64$;E6yZZ;7
zlhf|2Zr3S`>->0&La+M3nGVpsO?=2Ge<{P*CdCL&E`-h#2*DYgCR`@nSQ5CBL4Y)9
z9PKQ$g}<(iC)vj*@k=An-uM#hhT<mwY;JiHeH%IO!ypvf7RvoxI0RUTwuaBdTdTBm
znWg<O3<A!ff!ou@T7NcfHuw*VwoiXI*06X>^&<AGu}1o$bFn2Ye#kW1B&emEnK5vE
z*B1i)?RW<Ts5tFS3i9VG5%?NG1OBtVgBqH5!;5@UPVIFZy??_&>R!j0@UOpt1*U+;
z5#BR`dvMA9dr(jJ@4@v7?lFF2a}yCn^Okqp3Fx4+@#_qZl73^*8fwR2LC_E~Y&OH&
zF-Wp{KQ2<u1Fvz7s!!0;=_B4VFTFlFJ!*!xxqWeaQn}IVgV%#5TP!EVv_NvE6}KTV
z62mT~dx^H#`A=$n!`|p#Z4bxOYyX=4L&D2n0bw||wA?)#yPv|*m${#-91wN5x7*EE
z4Eo&>u`j0yLDxKoeeI4!gKOh0VJq@(Vj^oY*~Z%8KIZWec}gORG&aIEln4C?%_x;S
z?VEsd<h=z*la&|Q2;}NyGSl$y@4%t($sa%028W;h9-4qBccOG&s<&1awD$G_QDE`*
z(;}dn>TP(#X%V#T-u9nGKGI7qv9=UV=7syZJZvz|Wwt#gxO>n&IR#;>`>MUWpKMlt
zKi%ydBwJeL8Vwun;fYOE^uLP!|Cf9`Ovisu{LhE?x3|CHfBu6$7&gOTV(UBl?R7d1
z#HXYfWBrrAh>sR4dPv;?%6S`P_5?>zg5Y7Gr!lt6W@d7*u>L1M5Zb;zPu`qSa)d|c
zpeR1fDt+l^B2_>;pwLk*u3<JTCf8I7@f`Fpg#yvq2&^N%qErn8!~$WkWQ{Ip8%Kx9
z23Yk<OQ3-=3AZ3V8#ZU1Jedr*MVM)z5n}N$%-VBOLJERPOD?FilX;Z-snbQ}L8+jb
z_LvJn39Q!WTIxaCF=T9pAc>Z84993L!8!;Op=i5~jX_7xvn#0))iN+BDbE|0aRZJ>
zDmy5vq&ZW&JfYg7uNSISXEq|h*>5$+znP7`nT@`gjlP+UzL|}dFdKpF@|upRWRPA<
zF_$!90k&o0F5r)3<-90Xl4m=~%2_&DX(bq=GLT=cipikAqMZ5ZUxtHhwDT1ILr>AS
zr>NNO(8GL%pLefuGkz<0&~9-()BzbUBnGg+a*a-83kg(&_zAy>0FKT4q#$Mdn>GTi
zUXX4~nJHKsEy?~5i#h{i+J5*z*e~gpBwBIKF&*p5fTh7vmi0@Kqo$J-1BqCs0KKA5
z^>HYfl3uI4=&6p(Uec~xwk`m*4Xm&T-D6dG!#>W>@wuqAE~(%(V#p4(HWT5^!jBK7
z5Gnmit#sstXz}3*<|i5mcQCSsC$4JCug5;0Wz(w+CUp~M0vp<XcpqVKS4;Emb!WY(
z@;f6tz{KJ!u{-B*OiPdSMKsS+S%_z$Od5*AQfMEkh#kD7xdHr7hIkGwKNMiPzLd|x
zHdD@%!weXiT@)+LA`sE(Dp;A6OhK~|wZ%OoyMhB6+_F_!u^~F7TmgrQX<^q&HvyOA
zT3E~tDlu$8fI-QmO(JAgW(0~Ln+$1fKvc@xPa#9}uFHJIA`o*VD)$J6K+}b&dhF!4
z<+`{o*=T^pQ<D^{nDaXb{31iSnd|GCdVyGdm%4tB8yKhggsX7^^-Rm^gi6`8Di!f8
zw@gGVG{Tdc(i>+~+QmTwut<T!f-KW15f2LEIz$r4&2E$l!p2~G0}=If?uY3I4DOZs
zZ&bXE6cYTR2rRC?GenZ3(A?hC>IY_htpqo{Dy$|#dJDErCE^Fy$`e=q`_tw&{Qo{I
zBmM*b--IQGe;yJa#4q?8vB3ZSbbhXE&=z#lIiqshNEk|DC`?bX^ZXN9iJ6(Kh#Ip(
z!Yy$b)&psNrZ^Qx4LJ3<Zrx#Z6X<|=Q@S&ZZ(ajtxE4IYTV+Jp4ZcbhaAZ<=F<5yb
z47{MNFclpQ{{(q-0=nOIh>HHSoc8l#<8sIQ3Ad#8+sa>twDgFcZhz!b+tB<+LRDAG
z&wq8^yxx7&ecpMAm7IY^g;&}j3IKnRa+{vuP4|^@M1In`gK}ufb|9@06>dqmwIVu(
zu&}m|bkq`DAfab$&rU8JETG51D|wcQqcbOWja$;;KkXj8ZFgVq{<-_&xZO@3M0!r%
z0f_<+mp)ubK3kllia3l6QW-W6y*qG5A*VLpsYlh*V7BD|(X)wS*Cn}`)f9O!HcEKD
z`~2tA_DQ2l7IFF~cmc*fZY7TsDW7VX5%juwcZ*HuY$8WsQQ#^Wn!c4-@ufk%X1;Qm
zU3mpf!<&Z5vqVU+v8{1ke;K~pd`~fuXjEiJjD|_UwJp46DbC9e{>xA!lR1r2PBlLA
zWydq#8KIM}j#sf^tiA<$kvnJ^8Mh+7prG^P%AoK$j>lXZyMRORQ)RlP!{nyI8>Qg%
z9gGJY-`#4(7NTixon#;HZ|CP{89m_VNVDhb)|^qj%%*Lg6CN1_nAMF=T5YV2qcrn4
zd8kv~4#_`R9jua`NhLh7mMG3Ri8*6rq!ermzyBiE2i#)Hh0`G=ikn?F0iiRWc>AoJ
z^)UHcg{Qd-$$hI?$W~<u-Ej1A4Gt8}N@a&t0y&-hh&od6<08jQ{Dv@sH#%@LQ4l0~
z+<S%JkWd;D8Bv>18uq+dxziFF++Rtm<{sU3TBv4ME7mf4V<hLs1kz)LTWN;l>H{o7
z24TtRnA5XBS&kwjF%hwtK_%8%0RgdjWGr()aC}=SZ$r=|(oTvgE{Qy2%2ZhCQhEWD
z$D(qmIa!#xsT9AUG=42J?bf>xaoY-8%)KZ11=Z3Op+V)ZNdclVB}Nq!o`^gvqeSlV
z+XIqaj?=4<#{V*Gg-_7rdxZZ1$-)0=jc2Hae~*cM10g|c9x$!HpIQSOxXzL2@Z@cm
ziF>u7y?3B!;Kci)7EbPDbPRmR$7b1`Fj|Z$j<D~sL!1L<(-Gdl7(@ZG5WYYH<uSJR
zgK`A?V}O6)%u%WeZm!`NHVeL?g;P9ehC3X_aD+i4vVROXIEbv1q+eu|rPfO)6?8)t
zC16c}V0>-ZIf>nesIDs$`J7aAT)c4*=N@A&&aMw{kA%gK5i<nm;qKsxyMQOUZY&Cc
zR&fP_{S8-;8eeApBwhjeV(|3f?$%u*FYMIaEpn`A*Q{PB-LhF{;dIIt!2k#Ev~G;o
z|1t#O$vd1sM2}|jH1lAN<(vzTs+#@zF}68r(<yFD!qj;e@4S28=9>}8?mP<*BdYfM
zz~1(8@og%1s2t!VDKVwWSuS=0R*;iMAeJG}`1PPjK~|i5k^^)5V|INbk!(ISspwcs
zOVG6&jLlfWssj{r6ASxDV1lf({KzTJ=PQogyBEhGR71mAyuau+1O|GC-`>MWws^9f
zdF57l_TU^wk(*BW(wKR~glG;;SK0C=nSGgJ3lrNR7pkWQSXyZCKhKEB?z(0rW;b_@
zifHUV<v3;YQaZYBE)XPP5h!=-%ND^S-hcpMOT`x&4wI(KHuBK`wY#VQaGaG9Vct9a
z0}+>XFp)|cc&C-)K-+>p)|b<`PC#P9Ifq4&NFxKlYh*LBgy9j#1=0m7Hv5Dr0V1fa
zvT1A87s}Se;AJJVEm!Ef;-X~QAlXx<Emn=M@{+83oAqicbp2}xOne*Gg|9Mcj*F6E
zM5%<V_|WI`bLe|ydm^dQ9iR%i;!AL1P@g{9HT2pbt-Y0eq<@3!LcziT<ZbX4ew{rL
zbO^d6CRuT8x@5&rm`0p7>eL+?p_B3))vSP$V2fB8{;@H@IsyU{txNH^Uex|w?yn~*
zkd#VS*B$+dexPgiF<;c|jF5!O&?V9^aSdny#wfg|mp}(YV;e?A)uW#^rLZDm$<SGK
zNjjw%b+b`1ySNlCr7|GeU}&5D!F@GaX^P=^Cd!2?C_WCmSY5|0UuyD*%x8P!KtR^p
zp9-}^MBWo&)R|B?3$8GUw10Di4)nZKR=*0x;C!mZb|$p;eX33e8^ge<Vz4cvMx>K|
z$tqf2f$k*ZJeuVbRo~>*<D$$>*1G$Q^c)Vnb>w^Qr8yM2F0)gmOouvk+lSMJ*2ueC
zYFQ3#kL*mtarcoP$?Q#X2r0|{aI;Z=y*OVNQpV>u$Y%bST3%B{bWQe!IEgBA02&Uy
z4^AZ>PAeJTHLQup+u*_I&v&;%!-BW-g6Z+^jI$y9sD0s<Ow><UBk9V3jLdS5i8_N*
z?SokF<+Kpr49f|<R8UaXa3&=vVnbYh6FP9F1?c2xYqG*ZKx^89r;CaE#Vi!76~&10
zX3NV-KKkHV60{N0hu}mrdq9_&VyKu4*tj!Y9=69m(+OJ-xi(+7g1m3~4j3@Swuk%a
zDK)VZ8BmLTmAo76@~yd(!9(!dAg@w3@kp#@i~UxrV~SgUmN+Nhf^AzpLENJmKOc3{
zH)|NWxxsm>rP%*OvnNuVp-hkfMJEOdxng%-zZhj^hWLaqth`PM9@Bwq&BbKzGY4_=
ziGBEkArfesgw7=zcchE8@!h*HK3AYH??XYzxwRrNI{4QXu7cdYC<gWkGP&=`fpo9h
z@71A_ljtW>;btHeS~;R+gvOkqUFlbvX?az>e7K(teuI2Sf}gx&p5!Nl8yCxNEL*u-
z`Ua=D*=VsHCMJ!V9k%cQZ2Hm_XrwXe>IRb3`nuC11D?t(>wH_OCTfq5-LIQDPPBU|
zS#-|}a*vbuofMo2$!NyA{V~_rAWC>>){>T_6I7@xaKE6HRl9KNY0Ea4L;91M-l&IA
z=2tt%n%2mPY3b>m{3l4;6b-4)?!YQ9&4IG-wuFgE)DRqBXb-oeHwwLW6*r&vB5J4o
zDaEjCjROc~BzLHbW^8!f<-d^z*A(Hz-bVADx9;E;xx;&e)zUk}lYHcpHD>d0Bu~#9
zE8l523o;QH%72Xid$iJ$-7E=bHBSipHqWr?r^!3;)aP4soTZ<ZQ9~nqW-Y3SYQm3y
zt7|c|`|Fu+jTfqOD$TJK++`}*4>}j0I6t{u#<Ms9ML+Q$z5A@{K3j9nr_XAhxEr;e
zm<Gv8$uU<>=XfEW$;PoiFWEt{6~(&vaX}Yd(~W5~Vl5$u7~4Ye5P~}<c_!zf?l_8S
z%4`@-V9au()5Q11ryA|$(4MyC8bme?l)3Q<e?1e(V#=$rIuJPGqO*>6ty7&x=62H&
zYvx$n=8%BBMTiHPTnzyr`}3A|D=-mz_9?P(mEQcj&d6Xb+I069FGqNEESgH?gb^FJ
z6XwJoNOi{Q>E<yrI|7){`Xen8FX5DHs5$TL)>hTgICLr}d#&swM~Ao7<=`0m2gjI;
zk@){{4~+psL%H(IakkFZXc1&!G#oc42An{!8N^}%H1@^Ffu0yLkkAf)ktXRCd!{jy
zf=(eXG+7<gR~ea2O3G#+Ma@&t3arLjen=V|+BmtsQvH_$oSGb_q2V0#Vj*8Ly$10b
z!m;+?jGv^SwocOtXIr^ZZp!D_<_>-8Dgiwo6lcp55qsdoW?dzBTENZL9r0y*+g2at
zSq0vm_tiB|3I+`KS_k8&Z*8#H0jv1G{VW^*FHY5Fi}3)Wk7J5B=_|;*={5aW8^ESv
zsY+Zc70Yz<fhvf`9n}c!e$#$;^qn#0Arp-MNR}?V66aIn#g5*dc8^|kk9QAWwo!p-
zB>!zF7XN-qM;$})`B!%M3Q^&Dvek_2b9jF%$!rmX-euPN;8CVVf?|k7-<>feNk=;I
zs)*1lpSp#p?Qx*5qKKqa<Dx0SNNPl38d^TW6fmz**oD|GIzId`g}RpzG#E{1c*mA{
z)ZEDks?<cID(Ha0-W#7ZKPBB<97l0)%}ykTR#G;SFeh?O(niJ<MHd{=Fv4h<n5!$o
z8*Hqwjn|PkXe7fV!*Gq+RD*butbY+i(S)qgC&asD0O%J?{^G%YL1;ng&%OF`xosjk
zr%?_k@Sos2F(`MzbbYmXy4ftTjPw6}YVgMS^$3BRMM7}e%qa8|<bpWuSYLBP;{Kg%
z6z1*ZkO>LvZss>=ZG=vf&QruFLh0lmLwfkv=NQj-S{4HznGiiT?A8jZa`m7wzFD(i
z%u(AbCWv(qaQ97@u}g^cojZxSLXFjOd&}DYeMV41?qr}O@$dOL{(Rit@0@f&XE;^Y
zJ)twGEIOVn89pGdRb#_nv9Vd1d^h{N(n4}`OFuO{EN`*|M)dn2W>g!_M*Yt#fv@Ha
zcG8ChL8tyODn(Ql?=-I$s4&sk1{GJ?k}+R8^Z~BrCa&x`+1Wv?AGEew<+KmPt{CCt
zj4&}*_?B?^!rFh^h<L;P_Awd$^81bSZdPqPi^UA;;NFGp;D<>uTVHRQ`!-_t>BaZq
z#W0@mv$q5Od$ht4F)F#fJ;Yqp#wU<jDcu0RInwcIR!$oPdo#J{wPddmbnAP8!|C;A
zlUQ7a3eU3s@)~SL`fGpr82qA5nxqCt!Mtije#Rga5Yv60u+~ggP?A|`J!mD>OPK1`
zy6+ZBTc$xc1-Q-czh0Z^MTSo;*Pdm7q>3;75>A9|J&e7E^1*Jev>x5G=hDAOlayI_
z<C&;$4|=yXZytX88@9IZKX`}}^cCJR%C2hO^6Aq`Yx}0tGAe)z)~wwMXy?oK7`<`x
zdc26zEEhp5K{6XB9A5<I&ST~*cvqb{>1=lX?%~$96HHu<|8k4g#UjC+I2%OF&N<mB
z2R#;AhA)Vgjql0P6ttSII>%3Ss^P{KJQkS`3@b*)5fsxU8ORuYofZNINnA)slBX1|
z470@<tX|$O3SYi6<Z<%d##)KakP7z~=ZNnj3D|zHVsEkup@gIYF(%oXORU?%bqQRF
z-VD|5!6l~*?*2Q>l|NOTz#FLUzh&mC;%)OxrZFq@-0A&bI$y1a`-L96=rn)Ve~c4|
zNDK1Sb=;}@uC?@J{sr}`iW6rOMGr<j`@5p2|LcD$_;15(h^4c?CIH-g{I~nt_qQK~
z_-_xlzTv<BT|W2bz;S&;asLL#^$m{e8ywd+IIeGST#Mnje4vxjG(<Y-5Aw6hZ%Y88
zJOvRwn*_}b@*#rvc)w+n$tY-!oQXwnUwK{L%ZuK0z(1c06iUC*?Uply6nA@5jO8^f
zTv|jH;7aHD1*5T`a`N`z=<p>*Z=+@J!S;_2eth)(_Ky$W9#}l=*X`G6dG6lde%?8S
z76+B*wtjf<;L-OF9&CPp|NG4!K?-`b^$^ADN)wMBNE2lS|3w>OvSM3e<0e}0%NZQl
z6Lf2@=n&Kt9`r`dcGSqxVf(+@$4ANLr&K;~4}x3pI@|`gJd_XK!W~-B)(zV9+UD+y
z-Cl6-uQ2-MFTl#nCmOB*oc{tOkFrZzNY*D$%^Uts`VpO|We*gI(fSqoSM-VGEcF5(
zOiSmp0s9hP6<3VO%I(0>BhlgrnI@qDmDU&mS_JE^X_Nvm8mzEQ^XWiB0LDP?L6KTt
zjr_EA_U;w^cl$p<ZNzIB1v{IR2wqzZG0ks~L90AOH&Xot_K^-}kl0Fd#S{tK<RW2L
z<;GRn?G=Ny27jFtSL@qNDH>KWAL|cq2q+x%xoj-1d=yk>BSMlWF@hx>B*T0(L+u)?
z*}i;^XS_hoS{+#1+Z|wuTk<JgPN(C?_wHR?U2Vub{_to6B+h#z!^l;Tev0v|+~}qE
z^oUn=CY#&~TX*O2k1~(^iO;5{B4MWIhN*CC!cEKM-FN->q}<A4(n4C|<DWO|gFcly
zNqa8UVGcV}V>7xc_hnS)=Yv^!*%0pnS>oeV2fN6_|M^X1Rr?m0@v-!qCN2ndA)+@G
zM)f}0QZQa?+Tpqp@Si3&vgXZ9^B%XQ`y(V`YHq#C3_KeCuD8<aHJ{Y22(?i=!5H|B
zBu=_U+VA7TgsX$W)JP<4$`2xF5s3>Q1Az|6+C;k$#oOYF;N#?Z20=N;w6DQ6<`+>8
z#s){2(}u!eC2aPb!e?ev5{diSH0zNdyL+<xhG3mRWJQEEBZ~7jqspS!uslN(ucV7-
zM-VIkqSeb9320qTeqFR?Q9;&<lZGC{`p~$Z^vt~wJ&9KJN#wC#S~mDpS(eFvd8VoC
z6_$lBt5h|lz@6Zo4orsUx1&JUUy?g;`kcduJ#^^4a|h~Kx#Cp+ON;ulw%uCYUG<`p
zm0rGdG}uE9FA9eg+TZZb$ojY+Yn5DETSH+01=HRAebhiuXasro==gE+-I(+*P<zYd
zyTL4K2*nTalr`8`xOx${V)iMYHbS_f&)#1VIHlitrS8%^*RGdqT)bsYPoipke#`(#
z0wFO@FDT1^0ySAGpg_+n0tuYLsi$y5(}Ga4R9b-NN)3|W^gB$$FtM8mEC@XTT~=Z|
zZ!ySyM#CJToPkO`0>}&V7^WWt-3z!^-=rrWosflll8(yrY;udTZ7(Q-kzakq5Qipz
zMEMPe0<KC*$^>gfH*wHndSGUvdO2cFV%E;!niEC@WeIvR>JP9Y%-JNR6wd*cKj!J7
z{7?d2gp-C+#t>gs*y5XGphaS^6vauv{m4)U7{7}7vOkeA0Q0^-6_fHZKcDhL9_*f8
zdh`H=uI`8vfci!9S0`$6Qf9EB{^yx|+1W|Z^HY2M>C<HU;hgL6{Py?Wb;Q%vt82+y
zP#PaS=<YSPAN}y~hwZIL55NEZ{-gW%fB1gu`zAj3S?uwf&ES+pNwbR!Q4GHhr$%aq
zo;}$7@zL^pdI|P^Z#(v2u20gx_weOUh&l4_C>Tl_7m%j#O238T{JfQ10jC)t&ecHQ
z0^@`UoyrV9vopN;slRo9>;C<I_G5b9KYRG-5zA$i?wKY$l?gs&#53C%ubKuLu`=3d
zu#4yp&e=l==5Sa!bdZ@jetDYk5aGMe&j(w00$>iS<!ys){B4UlQ{a@m;x@0K#avE^
zt7;YBD6RW^ca7e>M(+xijK=HV4L4)Z9ge~OeLMa;vFEFsu;+RfeRY>dx`s>6+<NtR
zHR2m$4t<b+$fDb%Ns^M3{b1Nzo8T%~w4%e2iJ4@j7GafQ%r{o{WvLC=T;t=`uOGL6
z<^OJMY*2V$b%Ro?3-_mg{o_`Bt?l5>ZIPnO>tS`5-}?XJE^j3t|FN6!BW@RL>`t<U
zNShzGlgF@ROYhRC;iYz8h8vT5&`f@<C6Gq!5qJU)sx4r6Vx0MVz3<B&yuba04?g&T
zMo1<i_mO`x<^{Vo&b(YjjDWi*i+RV_(!$~!*gIdB+jhK{<a>1wh1(;3hLM&7E!`%{
z{92j~sWZub`?S4x+TJI<23`RFZGcvjd?e+jxk$Ug>Cms+c6z?Px`R}E*W*VO{pUtB
zT0@_DqCT6W_e2P@OJL_Ac@AUbi8e6)M$gorZb{u4CMHn*O1AFO5y(Q-ncfpsojtOt
zvBs|K@eo&9Y`rrL$a{fjgu8Uu;_<r8Ke@q+(I6L_etu(MXmW8m#BNG>L?H^1W>gKa
z(!+Q_E>=AFH9gts5<v<~W|_5Jr$fn(W#dsQeIezNHdo1proB!lfk`9Dsk|(%j0Fv0
zaXTZRv9!;rbiwO3TY?yMi!pu_f&kvM`=&$MVM{ZxIZqnrQ4CnJ5?2|OYs1v)g0xx1
z89~1;{%2I^t!x}~a(Z<Q@IOnF@f?n;w>W9DF;XRUE@{x6z<jt-mrC&$FG*x+vfZ`T
zN4&lS`8w9VuSCH&@AWY&UMMbCdK{DDzv5P#yQhW0>FbDzJqX@<^U<CZgS@}QU|Dg{
zmv6R$(|UcYwR*DpFFFT%=*`I{X9ZcNZa5X5Ke6Sx3|p&v{~S}YfQ|2>?Y@*UEFK$b
zO2|@%d{<Z<x+y7LeVk{#OzWAL(l*d}gWxAmps5j^RA`6<5kw7oM<ZhGXM=2LEN<c$
zz!=yuTuXbGEk>6y$mzXH$pS`^M}gAyO=+)}F;f&|EH)C7$q?NSz029?Luvhcl4ef8
zP#E)rb7^boTxFEgPMBnA4~xCPy+dQ0oWgI2@t7ro)Xpp)jgIK$rXz&wZBDQ$F-9u(
zC~NUjAk0n_M?rB_s*{2ta;^~FixK7$Ovhu3X?f|)2+bSxd4Q(ZU^4hT;}TPxaf&s1
zV19&xlHPT1kohG+R2_W2yZ6VpZ@NDn9q*qcjjhe?2W#|SmDy?YH=Besz<g8Rio?=Y
z_S<{Ad#~Evlg@v&H8u{T#_)ih>SRu)TD`<6FEz<7kS?|RHC^`zkfugK3utztBlG&i
zBm1H09mHdf6okX*re|_o>0ugr7n|DmF<poJM8oJ6oT1Q4w$}7iQ4T;KHt(`#v>qF`
z;&RD22HE*km9jY!1M)6k+cL5_IcM#b!<slij}JbuBjOANqtp~A@Y{MyqTt&0oYq{g
z#)e6mW_vXDJ;-VYiPACT`%RE9lNxFz7redw_N`8^79wL%OK7YkS4GQlJ5W$&ui9g`
zF`kJTaYGDEpr$s$v{_yXwu^=8Bwf49*L+=WjL3zHOlf==*tb>0M2{i}ub$qxqeXw1
zj+<y~@_$JlQ{Vi2;$6;Q=J^<LH8iUj&=f{SKe~s*NWM$92|`83<uonuf&A*$xJ8H^
z_`>J(i`OQTNWF+lb0=c1``cUrm0sD}4AkkEgc!fmlK#%KC|8P^5$X>A*z+t4Y*k)d
z-wv>q8@2R#!EE`h^E8NnGI!os!jfsL5jDR}=NC=qB60QGwAM}Q=aBV`Tf%${>p5oG
z*W*3JJJ*9kO`JmwTy74Zo+GfE>^9$s!912_QN>=emKn=*huK9+Yr0W!64BFLU|THm
z$T46ZhzU8a5QGAY-n&LJ75*nG!eD-)RCJ@;n~robi~+u%iwU)yf}l5Pt-LjUd{Zdt
zyT8or`yVIYm4W5d8AmytaF#m-=(+%<o|Tjr!PALcO$+|fJ1GThSPgPpIENUhd)r3)
zzS`~l@ol%;G?PJ5!Hum}a@slCd-+r6@Z`T*$(^f`EUfDujDrcrgSq{|In7OE9{j#-
z&^D~=CH7qSjN`_rAr?DA8C($BIQkhwC`37-TlzMlBNAyTk()3F*Tsy~hH{GXKM4E%
zVs=KJ(;!m>rLt*J4BX^JZEnjb**`pbTpznxeQ?`6m`xrp7uIPTA!^zrviL`5RsHLH
zD*1ndVsJH^KK%RT|7|^bc>jKw|M%eG{crhye~(W*|8MJuZ>fLZQvbfC{(VdR`<D9m
zE%k3f>L1>*{uMu_jy>g3fZmZ~OfiG_BZoLRI`|33f)&Wq5my@0KhO<5!;0kv>~!Gr
zms(S9#zzjRa3D9r&#lC{p9&X^2Wc;pl7U#u$-Gt=A2Ew8?Ok%EC+o){1{RikU!n7F
z;+Jt};mZ5%De%xs%rGP`KSpN{xTN>Rq?nDd`5%&T{s|O_q_O?!0lpVFdpbabz-fvm
z&!!@m5U^f3Mkde0KEtwlFo9^G2E`RoeQ~k~b5%xepV3z2We5^Hx*)$i*G$KA0#9Y~
zuy1N10=BE7x=9D~2%SGup4;!)F;)22sb9Hs{%$7s`O8-FfWK@f5BbZZ<a<L5!SIsV
z^!x_{)@TN()#zZMc{I~YEgMS1a4U@i`ybDytFi1=N+TuJa&TqV<PA;COI#L$F2hC@
zx{TX$;{ix?c$RE_+Wuj4Gr3E5vz|f~!A7`_IOVfZj<-sNPi|5H-fqHk>u+DcC!v+l
zaCz~QvBn7mImGJ7n3ncIiY`(EX4H@M#;vWb%}?-2_#fwsF{1D&q}2PT_U8YOy+2)V
z<46*Q(fK>NiW2*k2v8u!MWStO{X!%paZHgMg0k#(``{@81+pvvg+>)bQDdFwT*SG;
z?@GSda;+=?q$n@bLbpYrD%Z%!$cV^TqTev$Bg}(r;XM~QY;Tp?acggI?Qf~JuD)F-
zd!?-xb+!VPx~1Bic5SL`s#$&8wIzCg_dJ6$dqSCyq&3_<LM=3(@sMsgW4hLwBF3Ce
z;_*40{CF!y_pFE~XUT{{^$@1KOtQ%tur9_=V|yJfT=0%{JOB<kmkYE3QHuOL9jj|J
zY^xh*%x}@X*_wsXIv)U~Wt3)Mle~{}WPg%DzX3eVIAM&J%g}B%m=2MHdk>o%#WuMX
zwx$j91Y&lnnLMM9%KtTuC*pmH3I{Ujf$!WX-|_xyijuX;Sw_}45)XWEvBQH~8C>j6
z;tK`y8YBED&jtzVHbn6vopqoC)NYg?LQ%D4IFC!0oa1aTpi0MFVT}rT-nmG7z-K;n
zdR^HxS83z8M?ib(R(KXYi2fd--LB|f`hzT1gX&PQ)u&O79@cAi%~fd-Z_V!eGkffh
z?mQvM;HlH_ia&QsGb^o%(WC~jO#dl9BIMu~&X^i*cMY<`G)8ea9!`Y?f1dcA!$a3Z
zPS^Rsbv}4?aGueJvcCZ>D%Sa+XUOxtXaBmtX=eMlTp!1IdA<6m49*HVGZEeO3CcG@
zgG<TYc9sEGaDma~BRI&=0m}ZY;BIhl#|(DRDeGR^(ZKsr?Gi9*Bczw-nv)HKPU1Or
zU;U1NN8crP{re@vScxtlS2ekL^G$BuV3P<HX@ss62?VQ?jRi_>QpwE)N^Vift#V1V
zRH6O=N$<g%%@rH10&V1!2xqc2tDJk$A=HqH%MNYi9~${(!)l^IV{2@b?m0d=A&j}Y
z&TYkvf^#yU8h#YDL2Th@8Ke+M@?@lMBHo<5_}1`5x%eH9*$X|h!|V?ndyedslpL`-
z6N$@|w&S$ORMs18ZIGQ&0Ui`HmYgm?C!tW|yFgX)gmdCT<GO27)NrmiqGzzjIqW0(
z^b<|H{~#*jfji3cY{19b1$;y40I&Hic|HS(^+l<Xk-IwZuEg=P`2ex-&*O>98Y5Q#
z{I#8HI`5$#YXsd2@%72GzL)8tX8i*Z{9aB`vz0+vh!S(<)n`0Ke1;|l^JuZEMWDh*
zP^n}dFIhLml!|ymk|S~!Bu*){Y8N<Z4lR%AzLo03Cx{{dP%^Nn4eVqED_p114k`QE
zsGpT+sA84F1axrmGAXDzwQ)W)F6(u!@f(n(jVDh+7p1{^nEuYG>097e*WC1K`bPZ~
zHScYdM!U6m&C+-uT%oQ%;)e^*b<3-{eT82Ay5D$pNgNWH=I5<n9(!~$h(RPsNgb~_
zv#Yu>W`(KY168)M6}&U%bNTjDZ=d1)UAQ?6UftLT-38-oljF}<Jt!Ggp8l)}o3QA=
zL_f=sxe7<-DsULy6DaqKwDBBcIP~M`K!wg{eFk|fZf~m=8?c8x7QO+JnR-T4UUTy-
z*s>JMmpVJ#YOOoKM72Q06#1ZgVq~EKINM_B#6E*A1BjQF6>s@Ub7Rv)Za9i3a%-54
zQOW_psO*9{E>b-5ato|J!!X{+QAKy}>g7C3ihbzp#UvXZp8lG2i^IurG9Fykx(%-J
z9z@Q@T@pKV@~oZC;rD*B0PEJ<bhUZKt~Q}7U#_`&uUl8_b<67&Cc99t<PuAfvhY}-
z1jd4_ocvdEUSQ784Da|QstB2Vo+q3mIQfutK~Pp|1j}cC7=K8I)1f6^YBZgYu84$Q
z7D>^$e=v1Ycym690oo(N))ed$zD>UaWLRHcH?QG`DdA%$HB?5~jp`cDFxX|N&Sq6V
zi07q#1o^9L1p47R)Q?)Lm!fqb<)zV3h`lbUD9x4$%8HIuPFuo9R$u;ptT`BFb;xtx
z;d+GEc`Src7h)<}Q%{Wj2hdYXWwHt!m{QG*2lNG18RK}2Pd2{W{&r1NGpH_&mgaZF
zNj!dN9k)^EUQryWyRP9-cn~6KfBle5PJz!G!amalp{`xA-dHL=6iWt3WO}0CDxv)a
zJoSO~7coL8-T(K}Zn1WLqkYV||NmxdbKSfDfAG!r*Zcq9<%2Qp(7)jX5g?EDoI4Mr
zs|;Mlq@z_aFghm(32uPHT8+?A_<k=L+?Q*W`~7s(yU&`{VwF`hs}lYk*aL|J0LRoT
zr!90rm=@V8=dnl1%9#(z=YR{LWi#q?NHo33$f5wt;w3L$6*utc7^Jzr{O3?KsNN*y
z>^Vrh7;=(C95UmxuKpd#W-?@;tgS_l>H?Wk;N<PEfs?;lPkgnW_-Z}z)q3Kq^~7R<
zlhG`ha@KV^yD;v~EA2q1A6O;?!(!vR@3y{K-G1Pj5riTl&kn?_yP-}FzmL}4C$KQl
z2B|*YjMzh8OYiD>6zJI~yCfZNJi%i$$J5br0i=cir6>W{59l_>u}6QX-@1i~Epgfs
z$rl;V7Ue)>odhW^Fq4V0X-E2Lw4MC=eLOHKARV)7y8XcN|CNWi{Sd91ft~4z&Icn4
z5h3%3vNB=~ka_etIPeop(kY&Zs>9j}GDa`tj<;UJtIEPmOQZ+>UBf54({a7Vzk!gx
z$K1w^Xm%}_|J+*H>92KjLrFbJl#98&ZIqsD+5_NGCk%&dQf@9dY##O8TK=$;4`Vnz
zn|R=Y=%sD_fyH{A3>#`i5mArvtgWk6!=-sF8a%eJK-+l3vs&q+C15MoLVXppw!~G^
zy$7WWiZ1xVT`|Hiy6%KoX1wIUcImD`g<Yh}3chnevmxq|wnzYrfE{8SvJh~EYJ~hc
z5CT=thjIQc^bWzJ0CQf1aoHLJq4i2Z5Hx6~R_d`X2LnGx+YL)MD4^(lc+9z91u*2V
z4IGjVk_|k)F3N5e)@}dBHb&t_4{<K@Se#9tty?W(SlyTiRPD(+)aoINn;`o`mmK7K
zLNVHS+Kda(NFMhSWiJFPv?10rXdJ??C_Gt479}xymBgsoLI(+SO+~W^L<DTI*#j{H
zzr29nMeRk5nlkW!HqS7GY9YLx#xL^GB%et_Dh`N-(#Rp!zethEFL+ENAb;Mts3Q!E
zi7isDCOW>1Q5)HA^d#_z)p{8H_M~A80iu<jwWct;<b&ChgqaN*)MFoQDVuGB>8H?5
zQE~x7+Ot6a;Im}Hmy;xKr8&wr9JIyO7wTZpb`^!pYU~zDGqJ&!ZCEfvhr=|_8av%W
zgj;z&?Y>Kj>bC5SdrD;|Nx$xrpMo;cgCv1LOi@$?;=)m5Eu!R~p|4Ildk1^Sxv?8P
zejZS>bF3+&*W?<$kcFnzDPi*@Nq&e2H9%=v&bkCMrTA05`sy=;(dsjon%imUE6Q+X
z1GE~q4yD$hT>X|ah;~xgV`xO^W7%<nw+6<8F4EROoDR^~!7uF(i91ozTPeTptmaH{
zJ7}vnjW*HYy-|?>^5UG_332;0Evp0ITA%|e@;I8&_!}YfS8RT|VDr0lx-QykZ+@GI
zTi+*_^Ki@MFT%Lxl&QomWI{^QvPS@Of-*BPOL(*pDqx1>r~aq{ctu^z!z*db6t04z
z@NqDW9OuCt8*ypUY|R_KV*H}NSHe<?_#?O5eq>k17vvyWqnF+YQJ*JJ#uc#pvbp0L
zEstICC9lqTf<goQD=X*~L5#GD2m$d5l{TJJ19n)cMqoENb*6zjW{WsQdv3w@AS+<4
z>VjA2Xl=WOr@%e+dxL*_)!>O=3t1k!7XEf??d8XcOEQ%Ww{@GGTAdn4$Vj=B2n`Gi
zcJH23;W)`bCY)Jgbyaa($auT_C}IM!Qyj@Cj({GW0>{HwiVY6!tsa`N-mouCwwq^9
zB@m+h(Su}N^BcTjt<}p>PC=5z5+JaV*j5Alb(7e*^;I}wos9;=ZXE65poCq*T}cL;
zHJ5>ISj_V-?5Lw+0(=27J;XDRa8r{u{II};52o<R<nl`8fju=PwMf=5A~ck>*&nWQ
z9A5-$*(?r)2~5e4zTCj!1li$08`jW{`FddP@KpKT1f$EF;$`XB8^@c`ARWDv3TPu+
zu0h|`nZ)Ij9yMY5v06P(>^jE@xlXH+?f|q*Fl)g4ok}J}_xuNnATgu70bNc+!Rc7D
z@GC-<)Ps5D+Q5@nl(nEqGKO0p`S<`poVH4(y=I|*4rxUvMOEie>P4JRLM5HlwrWP%
zP!7hxA_9+Z2j6D<_35avXM$}MF;HuE@xYYKIs(JA&&g-3At<#ER~@~wPd9HB*%F>&
zS(NJS0Pq5Jy#&8B7}JOzbBk;bo!wMJArQl7)FpJSQ=TF_2r7|k&U(3<=H<5r{gAes
zuJHM&^!{~<cW((^o#bxWVQzN?yqG=dc9QgJ2$^pIFe@0CUm!)lWpPRsWP~m)RFYd2
zt$g3mMO0(aN`GXYx*}gBVjY%ng}?Gz(g+u%RV#{A(C_1<|NIh8h~}tQ-9|R(jSD;@
zRj&weku}XVDjl&o9#F7%lgY^Fb<~$vNjz?or7qrPevb;*`9<?Z3Q2oEa2{$E|D4S?
zFs6(-(J-h5{y_UE<x@qLProp>#NF-`70xEexBNwof>M*?B>(99^uOAtWdHH6Y1(~<
zSDrT)0b-{8$JXZNgUwCP{$qRn!NafiAHT;3wvV;q(Q4FWP5NcTe2~8V{+N#OYhGda
zu<@V~y^f0_f+KU(9i*6YVF<tfFEH2`ckbW7$bkcEE^6bTq5kJFbhyrtzFIqcwRZSw
z?eNvw;VRY+rDV^@#L?9cMf-Ey@t4f$<U~^V$N}x#hbAYpRglju_aP9P0X$Lt4hEaz
zs^)Y(_}F)=5woPyQA^@y6;94@we{$?-vW=(VEOqW!n_=7Kn;ZBphdM_aymWZU#MLH
zxpSmm!FdW}rTa`Pq4UTv*6ouf>`<-0vL8n5*k&uQ4#!10Og}Qc9whHE^aG9rMZVS3
z7;jZEuqCb&uI@ob?%8sBlD8fl7vl`*-YMnx8}fDK#`ZgkS3vih044Idn<VIX24cxO
zc2)TmkEv{wNF;@{kf?JP8HV*$ZhX|!#x`jHNk)eOC4-*rsK-)~$mW?fqYlmJXN)QE
zKN!@u5q-Py-DU%t+xiw5maWZiw!dvez;|wKe`3MuwfHo!z3E6|EoS7c!r3&m*{Z@U
zB3cNEiOM8KhN}Zgc0s3OO6d#%E*a;3RlL-iHm-&L(+xJ==B5};d3hq>WKVp79RXmC
zlWO>7=<1iW5)^ksCZd<*G(9^*l_~~AW;o+LEDhn?cYMW+oeYO)-QJ7tYkwpH1vg_|
z5aKOlr`>$fI{B$X6qG>AFic0(wM^54C1MvahUg{9eAjSHaen2dR|gN@JLv2jzNVwD
z^ZX~+LD7S6o#v@o%8bd`byWwLjfAwxs%e;wrXmN(uA#VYU>{?eX(;%fOq-@TvjEtH
zH$F))Vn5=D2|0j?v`7HM0b>FU4mOI!WdNp&Jj1Bx%4x!(3>-o$`c^5-(OBX=rc1~<
z<S1E|Op+n;a_AQ8(g~#-AGuPtB0T0oxrSNmJUur*j6U~cT?pRH$J{iTRNIg6|Gh{5
zES4G|{J+@SZ*@BO4b3h1+diDRosJ!`q`JXQ=Z9vedHk|nQQ_(%q?nY~Xvt~tlgbyf
z?%Xy!&$4&Jc=C=m(gmi`=q135ivhijTK~O|*CU<hucKOR19POogXgb1&w(?k<GqjG
z6ROE*rBix_Dyip}2f%38jCio}uYpoUv8o0c@%rN{wFvvrZ_(YPD<gIXC1qE+8Mz6l
zYQl`*bSOHpHrZ@Z3P&IjXGorPan{1|C33DQpC;!hWscaK#@W4S#=$oQ$>(gHFSu!H
zcnkS4#p`6ckHi^89P#%m80s~Mno~A?Sl!s%dhl@jn{U6n8p3-Gnq|ED*n$m?IQ-J}
z+6pz8_4{ZjhAytxnsBMX{3HAJU;k646BIInZXYFvnc<%Cq{0g>#%BFo-CxxSukGEW
zzRGPT+wK03Z6+HkEzXSgdJ3yvlK|YNtO^CKAE2vtjK(9@lLFmjWFh_1oHJp)^qkqm
z@Ebn5gD)xN383_5>CLH7laAN2xQSb{|76S`^s$bY)P@A(V?%_Ay6O7ugiJbcguBVO
zIIo33+>q-kE~jITk;kme?wQlM9VEg6fL%n{L6b#_)6|n_y`sL3Ze0yy_0@q3oY(s{
zOlklWdWJv&n1tbi$=7Fq1J}+51+C>X-Io(wgO^#oDovf<KZ#Z!1}d#SteCXC$3G@6
zxjp_v@`2CiOo6}kaP3v^)j(+QtRI((Rp3xV8rH#Of|P;@1bHB<b8rmo#W2B8GL=-~
zAi1cylkgEVRLkD#LT3WgDS@sb-RLf6>_$ia^*9W#Z{kU8Iu~F_xF<PXe9A@~OWhQK
zlh>tP{LmvJ{7{Yq>&b|NRqzj#PXbL*07Q;+_TO*zcD~==Yoou#ZmZKe*f~ViPv^M#
z*6kc)`HVnBDOEw8QWF^G<IX?!j_|Qvk7Pq{>kGgcE{s#hDvD9}+!nh;atGvbZ(q#{
z;Cs32c6d5i3%#%df!*VXJEQX~A)iX?q|;F^N{3ts1;YuXbP5R%1-jG81UhUe#}Fzb
z58ZPMPcku`rc=s2wj}UBAKdVJb=4*|vhva{V}g~B=OcNc>$e{j2?(Bot5!P<yo!eG
ze17g=S65B@X0AM_05Q}O$__w%Vt_8A<WB9UD%6#r7YfWubpRsuGNRWqUk8nQNU${0
z_t33$z-p9ZJ5{KvZfOAWDP>FRPX~ibrvl{-wWa(%w27*iiQQ6>Ws-{zWCvB6P|YDQ
zNccJ(3#+-HEA3d~jmZjb-HMw{Cwh{k*ReL=hPeaBk^s70Qkb3cJ&T?S8iLV?MU1h+
zZfKJ8B%o*UV~OZ&WO@So|9BCt3_kV)BoLm~qkEdB)lG1Vop{tu1|eYQ2<u*!<TwjG
zQ676T%BE-M_SkDR=tJlweAAGrDT>?By*DB%YOr8d{$aKE)W{{Xb@ZFbN3J@)7gpOm
zdunRC`O)lg;#J(F$nQ@QjP;WH3MQ7&Mwx+x_84-vEkgQnV5!WGloi6PjkrYcvk`gg
zBr|fhrh;SnAgg&+NOh=w#nT8-XTeitqeK`;IXWF#n;IK&vnhtRUWYf^;-4=lkrNKf
zfbQOn<f{$5nP+)jhV)Mdm8)ouw7!To$~5@tCa3I+r*HK7eKw&-hbT?eQ4NMM!GN9%
zS(#2KWf4E0OR9G@Cf+EqUU!ML7<(ob4jUS35lt)`BDXd7VO?!b6L|<pjcLE;6F{}&
z8<9PThDErT>N(^KO({|TWnu%H%6y@q^S_!GYZ2ZSMQ2&o3s5h+_c>(DCwCS>vRk<>
zTkMk?g9uD;79%$v`dpFV{7K0T;MiPp<4t^Fg7Z6(n->`x>5#kzv_O&tr^8{=OM$`+
z@M3LMCgA(sRZJ0De3M^ch5rC*K$X9(*A_o|Sk7U;aXt0(7e$uVhXRAaay0k&B0?IA
zH+Gg$kaI53d2~c61t>DDE>E7~!YaY@<rRFoY#m?1=IJB~qcgl>=-b3bHO3d+e7CK8
zf0-2fAN#(%Y|biWoJ<{;)ENsOC{&&KZ2J^(2&Wt<j*3q=O78mkj$v_Y9Te$n^v6;a
z-o``6+OW&Ig=GZbFi8rBQ9hfdy<`AgvHSL^A=9kmT2mqRiG-^wpJ_aaVXYF*1A@j|
zMA0!Ol?{1L|IH4{WZ8zHk*AYrNmX0&dc#E=MGjv>B0Q0u3rc}ZR*rb3>(#{gLVRPa
zFN;N?!HTYnM8Vl2T4iR2FUiVGU_hgym1y&2p~%4+mlMKQd`T_Xi!<TbQ?m7mKhqj*
zA{0_142PZ9WdJLNc`zc<=#p}`II$vc&%i26ony&s-c`X9OMro;tk)c6iFCaZp%0^K
zK}XX>Q=fG;X)&5XIVjG>q=Cg%o+{~C9DzHi9)IeFj`sk4Ue+fyq7_feglus@`Qs7p
z^N@nbD^plyaKz`hCkcV!WGU2-x`Q-fnPcRJ@l_yXf~&Rc6%g6HGDOZ%yLQe>GWtos
zM@nl}(N+MC2wltrU$C~7e$wwTKe!n<pO3D%7?owlvsMhC5?Vj{G1jZ;MGs$SJ>5Xd
z2ySStSga{1UD*->8(KPFtR*NNY{|hkUr)w<Xh{USGaWE#MY}YQP~mPiWJ*Hb6FFXs
z70E(7xJSTBcG1lhTLS)0=wSCe>AuS&F_Bv-vhj)zAEV-dXwt_Y$#$Q=OUIN_Chd|7
zEYK5a>@)#_C*f&`Fh=BgX%bd=*sV-MDm2nwX*7L8v*-%SqHm;(iYBGFHy!V(FjMsO
z-aR0<fju7F-X3Pl=oi=nGICpWO*eRI`hxVo{TAsthUl0zl?|&Y4yG^Zb19>ghbgeE
z*?64gDTeIDlqG^Idbp++3Y?7k*<=~**L8^g(ve5{4?zgbXzR$%-sIGzV1Dvc-5Tk4
z?nIs7(D*Tk;xu4WZ-pE3&8CH)Ol<4h3WoLaqJ^l5+LFzJcLpWqYUuHBxMS`bP4H3s
zKudX=Tw<;=hQE*eJJnbeE@SW~#Jp-Is)MFQSJff@K60NeRbABt>7NVG*()dz?FQ+X
z|NPHfB_|6KjcCzfhULCJG`J-b&@`LosAP6*MuYM{bowj1**LdBB_ul5?+-x~xhg9C
z+aghEi72FSv^+{KI-)1;qtv~e4SMnbCbUcsm&pR11+G%H)1;5K!IkyawVnGTyBfS%
z;b{3Q&J_e%xs$=RNc?EV&iQuuLl#ZwuS6Usa|)=2QU`!(ED~ZrQ?TO+m8>VPD%6#D
z00oX~H=sZz{<;WH+aAYxfFD&}n>MHsxJ<2j>T`vrx?Gm4g8l*KH^lGjrD?kF^{7-o
zZi8;&U@@1uEg7_#0au7r+Vah9S|q3t96dl>6^`CA_%cr!j`)5S9P#}O0F?`04UTLo
zxBwi*rqF|<rNEG^nM5h<OpK&EQr;f0&HM4Bp(3}Tc|SIMA6IFuLewYA5AQl<5o1Sx
zsA{Zl_*x8`?WYq|59Ji_Ja8}~rFl2XE`W!Oy9K)QLM5MHq7mM^XQe191G9YOT4q?f
zxVk)fJBi0*OgYvU<(j~i7~4rU1=dZ)jG@<61TR4Eo)h8zOseNj>AIvZ)QVa&wbpZJ
zwt-zEGNg08Ubb1Q1V|G}>J7l-M!@kUps^8v1{^N8I!<R88tZkE6uIrncFfu4aOc(>
z@38#i6_+^@M~7-7Q&L^4!k)>D@<~(1<F!?8W7SR;BX6HX%8I7!!bV9)#dIU^wr*1x
z%0Kfldh#^n3deo@;vWO%5>!1Y9W?Ijbg}TM<lp03;#IEJ3quYSmz1BVh8NE@`WJ>>
zaxJTuksxxBfHcC4Su-w0uCns(sw;OFjYT#ZOh=e}8JPRq%;r`hLu#A`JLuhL6f*Z$
zbR<wEg(#e{P8PD)+I;xHbl|sUk`R$^*NkEhjR>xKR<d_R$J?{|z2|hyh6oH3s!RTs
z_1X0|7a90HXXHpKpnZIc&T&IJxsjdEKQ2pdaFs4I<w$-Ua89P?gnyE@j0qR!pT&Q|
zD`w5`isXnp65H)EvTSIK5GPOlLSi_mgWY)HDi6=tcGawb{M0?C^qTltA#YD$7!pn{
zN4}24o8jeFiB6CLro0ao<n$un4(?{2VsIlkwb5c+ZXDTI^$A0z0wxY>m?i^9M2I@P
zP9|qbm^j2&p$x$mPOsiV=s>w0qb~3EX(b5(v;YQcl6@d#kA^s>p6h5^gR^A=S5^E(
zQFSH-6e=JZCzJcd1T9@B_27P>rg=xivK>z8FE;<Vdq6e*zj_y_NiMh#YO&e{1ZfUO
zhsWXdwnRx0g$u(1MEhgyin`1%>!K(+D8e<t)aQfjbUzu@)H}3BU8q4{Z`ADd$i0O^
z>r(b$JVr<|fg{g24d@s|mQgrq0kyb-70Z_9*furEf+L%{;r`K0A5HV~S5TtD^G8Ry
zoF<Jjd*Soulk}`p78}j6#K9@}(0#LaaI&>Y-cJ-a|KxD@@DXOei}LAsoJ}~~x)~MQ
zLePdnl{=;c<TJE~OGK>8IO)}G#z1zztEH`E%u08+)&pj;aI?%1mf7mh=}qtjf$X=>
zw%`h~Kx@RSrSq!Q+znkWIXlE_Ol61l8QlPzS$1k7VaMuG8QB<or}4{obfv1#8u*-%
zd-t`A$kGiT(rggwq{MYD^ME#?-XOR}&Rd~LHG{dgOQ@^02c^wQ`jG2vR?^A@H!C$c
zbF-d6i5uIjqR|Onto~ItE32-rvRSdl;+s{K4&wYtb8r7Dn-v@TQ*2fl_~&m{PtViv
z0e!u_%0RE)tAx0>OPK3BkK&dhI3iOkn-8Pqpd7o3!RQQoO8fB*MHIrAOIb`Ns>i#}
zb7b-++VD+9$KfQyr%58w!FytgcS_9QBuy|}8wS*w1YG`_fc~T2Ke(xi-Rya@d>mA4
z<k@&~%SV!d>u$-uo-!%qX;fLqoIS++P?1|Vf)+kPpdf7xP!nK+T4XtmnaGdP^2fn4
zrPq0%_NGwel5HX^Q%xsdXiP?W7*B^}5e~_N*^pqx%^Fh^j{h-*hGHLNG^qob-4<_h
zV<(x%hyYe={<&Zqk*eHfYveSVi&e*JI&!C1;oZz|p*XfV=INe^S69+6R^p)d;yuUE
zb>85~g@(8I&?Lu^*c|+rD&v#9nEbr8NrAA|KM7WOU5pI|?qQ;z8dBu-x?|fT?_VZG
zZQO|N3fa4hbnmWoT+&6}rc%DfkuD3;f}>Nacp@>0Zybt^6OE%83{Vn02-Ctgg~1Q|
z0IJ|^HJPV&a+BXcp4HIY+b0zarR>(m6+@R$GdKn76tFt7pi0rx5vXH_ShIhNrUyYU
zc9-DR##w>Hk~Sd+C1Zik;3FB^q9{B%gLTt<QN>PiLxn^$_sE<;A@=qN2LxDjgH&z}
zA3}3?CmzyX#DGThaZq9Q!;yvd`W#Cg?KMV!BD0@ST^}lZv-lYe;>U6K7_hkpo79XJ
zG}!RnJpfvt6?o_Oarc;MWuYMP8T38CLs(|>a+8a+PsNtO<;5U_{w1v)$qMr-m0pAb
zYB`5L;?3#MCcvjd9U&=XGXVpXP<MK87jdrA7!G2QKhTE|w@MVSQoOCYaIfX($MI@J
z6tIid%iK$cEH^^d8lK^Tsp=XlgbWlcI5>52pZQF1wbT<B#HX3<kpMi?KEPk0FKiE>
zqCJ#Y##N7HRHI<)IYxyZB`WN3l&Li22hyMfn)q3Xa6H81`#zRr9Yu0HvHP~0r^d99
zHK2t>NPrak9Q12959`MDlh7G8=B$FCQ<U~UhKpmilcuM#dvY;U6US`AnoLAWF>g~-
zPo2ALUS^XU=D6x;j7@5C&&*7~q72S2v#GH#iwAJ<_Aq-O8I++j6Yz4(0F275P-q_#
zxO^^PL+yGI#CRd&T&-<`H7(o-MGzG$bPntexW|6m$kpG^rV=+OS{^T(NZ+*E<c3iI
zqj-{_hjtl8VOj3F*S#K-u`<@zF(dR{9wltvUJ~+n%tE}>3&Yu28%6CWLyMf_TMtq?
zv##K09Z0UwKU2{W(lvzD1Zt?IO|9^^;YKrM10S+yN0ylb;G%}?zRjo6#QqN0^+>KJ
zyqzWnRv527$>AFZyj`Zvvn(hozgQ8FtEeEuq=?Bwk=*>LMI7IFl8s?3WSGy9VQEiN
z<kra~>FQf}g@Nj^t6mFe6=2vL?$OBOXoN~>jVv6rbD&n}6y(67B79KVM@Gq-hK?ww
zusILdKZ6#k<Etw4uCcdGT^hQM$ZCxNL_YcTF|{oE*)Ep{)Q}C%NOA!~WdxxZz`*PD
zr<iv+n&$DD32}nJl$ezq?#jYR6@Exzo~BF}l7vAbN9gRbRFLxI63uZe^=zQ|LMsoV
zmrghdE$&uKy?W9-7B##l&T{!sbR@Tgwgj?mXv|IEtZqr6IH%iy&8FM!s%_$9kpcj(
zxz2O|gOmoTBc}17bD1)B;D<an)#-zKw=io*x3mqNIzkJe_Ha}yD)bMBHO55A>Y#h1
zibT<B^z%j|+H6EyzeG=;sqHTF+Q3Kne(RS<e8gz8O**Gku?3r3r{*^2HMg#tOH0&}
zm}FHerXvq(91uWYC+M2S^_#3vHDSu5gVl|OIWjTyEGf%$O-s7P#Lpab{MYGlY|@Q?
zun3t7&qn$7EJ`OFj6Rf?DarFPkzn##=d)YJiIz1%wqYU-pQHWfC~<E}*X<G#UW);t
z5lh!AUCGFho5if--=wEjmo${MbS7P6^;wBNGx1JL&T8xK#8SgLV`-?qnIgLPB6f-$
zs;3g5<YE5IlBB4$wKCtK(k8m^C6Vpg$Fvb~(pE<k6=n)d6QQCZ&N^7bHA`5;9uUCt
zl9}p@jM-a2cfR%`%LxgbZ^z2ly5;j^FecS9UUiWK5nCut2)h+|ar)6R3>!d^gbX+P
zF(wQq4I?07Z-6IA_dGgJ&oGP{=R$B9_GQ=&bjqA2YLo4^UYy|WT|U+Of)w+#VM&5<
z{65*S6x%`khe~#`cDzC9C34X*9Ze<j7sWA{*kL0~I11IU9+t{@gURN}^8`2E>NIE1
z!po9}A~6{0Xgn>niahr>I43N}B7~n~sLH-8yiO{$J-`yrYXLL9!%k6tz*SN?BFb#O
z$LtuUSM+#nxb^v}_Ru!CqU~2zBd2P=@79)%b&w<mPc3f1>)M@ZBf2xKFEt`%=hHA|
zK7N2b&&@UVZ*jc$r<S5espuJMcVi|DcTY+3_36@E--Il`4XA#hOviBH5fA+Y3XZnN
z1I4=}84KrzQ8F{@x9gE|n}$~MM^P1GmyMC9r$Mgi_UX)~PJ>OwJ|m>w1uyORML5)^
zLr<}weeKJmC<T4R&pi1~nkw}dBFbJ_As6_xf+7pUC&@wxQ@Ii>Hf>`*pxGyxPiZ%f
zmvmtkR#EjP$3Zg$LK9$73Tc9mk=i85mvWz8?xF-Z(Zm!mH1^tibW1q68kbdyJPz7m
zKdYBYa*zo7m)0r<+EgX|w{8pdTl1V)XfNXWR)l|ElmdBMO$KKvEF=oGXQ~mDDJ8@O
z{^`hfiJ*ahI`X~1*fb)@h{&pIh?FCLI`W-sxUw4s6t~yK!b54ve(lnU@*=w`WqUm3
zvLzL)vvPr$yVmRQI2@$0J~j}_WqsA{iOuPlDd47~FP4~EY0J#ZX00F_(^`|7ca}P}
z3AB%$h3Qypt}k`&lP(1#E+OMW+!vk}l-HNUd%4*dYI0FAZ2}gN84bEcrp>5nVd*ud
z?X_W>`;<}ohNsQQVKfuk<HP3uXF|ZILKUm8x8i(w1gV|@iVWETg*>r<L54b7A7jD9
zx*e)Mg;0D>d!z**AfbMmLrcmmQ1g(>eE=(wBq)k?B<TtB=t|cmc_PW0DAXFyK$tX4
zQz>fAx>+icBwRUq?&9zu8ZsDl<Xi(sLk-p4qqYq-3l%t(Olk0J9mkUbgee`hpCVPE
zJkKJ&$R6zSZp5lYd%-I~fKzH_1GLXVD|+_?fidNpWl+)0q=~0bHyVbWAiO>YIY1<`
zT>I|xc-G8ahW=Rc1~M^L-6<(JR9(b0Os0oiiqoDwnDv>1aT~naVBCpR4F;P$q*SRK
zqWdD7^zuh@K}H%K+FMruoDmjhH1qS}ix=(I$vx<@b+G$ORXf%5{uw~ZZTvDH+B5*-
zx;>bmQtL(45?*U&dSI&?*O?dBHDFPDqf~{0ldEbt2~2B<Dd;$Qq&?1nwGGCVWgBEM
zZ`QJNl+&KRrpQbL!IdPe3o+sm8NyeWdP`v)#Qyo?!1bH+Wm$EFaZ$RQDBIhbXaub7
zlEBE+g&j&h8(*4RC~Y374aOLR#$Jr`iq`DbRm5Zb<~M)LDoH+TiU|c?d=#y2(4hp4
z#ju8$YqUs5Q_=b&?s8Ny6)Oyr4d+Yx#6ZBKSuH1tekvRJ?@H@>PhF2Wg@NF+T3?l3
z#Zp|w6eVvvui5pAa-|lX{#RA>tKHfXYq9S1qS~Ea{c$uQm^_Mpz5|E*o!&1E{S7r5
zePTxhv#g0KEVE|QFyn1lLkbzv+IOt9Ce}r()rZ}B`TBLH?d{Ba(jZ0##^hpE#pK+!
zLL;-9nLRq?TJNtFV?8VCVWki%w0I4+8H8_34I45Ie?YDQq6tFr$&SDiTOJw`O9wCW
zXaxF}hhNL3ts;MLMo=+2>G*=;!o<PlI1zX;z(*X{ZSaYCk>-iI!wuI`VSS{_#llL=
zvn8<aaTg+(j(><BcOVcL2SxTNiR^G}#f9<~;U8lD13$2g5=PWd5y>o)aRuRDD6w^!
zTXFBKiMCPm{7zmgn$f=PU(epBdq+C<M`&5z2dX^kDg%Wa12GoMxty;Y#D%YmM}|0C
zLIdod1J*~ek<aZVM;ct@*s3NJSMuvpP0bCK!OB$=D1(tIG#1Cd!&%|LJ2!TwIt`Dq
z@pM3W!n#xg_ji8~pK*+rB+k<W<7H+8I2TpCO7hBZV)s@%8u1j2OOdtGurxc~g+FZ<
z63du|!U09UOlkt!26qP2C40v@WY5Z)h9B918_vXa%qj}3E*nMNqC19g{)n4Jgm&R1
zV#?qJ0c^xFo87vQUjS0JJXwO5LT4R&S^=!cvNgMRHEl&y0!9I5>1KdoJurFnb@gWI
zhNf6}rbew%HPa&`f{V>m=w;PR@2}9sM-S!YA)14;OA<=T=jdjhsQ^*x2vWC;Hj>i_
z08pi1XGCL|);H{kNPJT$SfcEeobgv&`A85#?-JHCW|PIWy$`&rVlmyZS4G7SCHu+J
zjY^QdnMUXP?*+rkl-qUifcdHq6%H2W@@5{%t1^aj3VHDwXByl&i++32RToy}=9YZ{
z@afeK!|)G*oZc-$3gN4va0F39qC%TWTPXr7@rdFrv)3DzM+Fbs_X1NKcf}6L+jox)
z3i9QSY;bK5b1wJiW&NKl?hBj%SvXP0q|LyxDOoe&;2&F^nv4MF9)+}+4BxhI0bDTR
zfZtwdt2)BUd{$%;PNGUWxe9`~wZce3>!Fc^=($D`{cAp!uzR~!y3fWG-m7y_rH}*P
zQRP>n3y%QNg@$d=#ikNteY9cYGtp(C;PhVxT|Dakr$Lumt&*yQh>Ddn!vEANF)xI8
zzJY~>dc447iaMRp^4=F}A+IorND0%ro|`qf8WaVFtp}dOl3yKE`)5HWW|$g-Ne|av
zTU-0Xg`1l|k+}jA%M@V&$-|a<=r+ogHWD4IS1A^qt&O)~7#u8T<1S|EaGiv6<{TmZ
z0#Q>Y4(8ft9RFq+LyBOAfWx}ak{B1J0gLEEl$O!Ph3L_jq#mDz8q~l{s|_#Kf~z#K
z#$Cz)&V!j1!}J<zr&;PI9eJ}-=OswtY+4CG8XEhIaHCfr`pu7g!}sEfS!a#Mvc9Jg
z!$~_^v?wQakzss^tiULWyOS)>*}Zx^@JuH2246Q|RnkQ9WkDAxJ?5f}PtpAelZm|}
z8%UBRFVJfW)$~Xk63z%!vZKa{r3t$0O_Gw|6&qt&9$95;X_!2#rNaxwpeAc+M?vp@
zta1{F?0>YFE1~*kg*|nXY3oY|N!|@>#7jd8-0onSr|)T<7(Ci<$JPS!D~z>@r>(U3
z%u6FgUW(j`e-M)aI;n^_pD3Zo5alqv@)THtRM-uP9tVrcH%ow;4$0Rus_MRU)bRM9
z_``PqRj;iE$IfRGx(B0xaTXU0E~ex>(qa68!`?}(4TL74cW~6)4cl?7_1B{P<JRkF
zb@RJu^Sj5K)j$BmS6Yaxo=wYaYx&#O&h_l%<!(gT$yXr|9FhO65m*Kz>&Mx)2%L8Y
zy@t{Q;#Z#FBmA+{a1mTof6jf(45j!Q>%^66NOHkZq){Wt<qAF~El=uhO{^|H=hE|x
zXhao$$mRV6Jy<#$?funZw@t+hScay!COj=mb!Q`@tI#Y*>d<Vgx$UIAqhqn~A}B8w
zK3Ojkm$<CZ-K>pXC12CDI7h;%ZghunaqeI+eu9&=)Ou1T^1PMRD{D_WAn{1cy~uw%
z7eX#*7(ti;BA{d=JnG^>m$m5vg437`_FXt(Vq*!)YdgG!K;cdk$d5hj`LllF`k<Q0
zC>PyaQ=EoE0l7yZkMn3U9qDBsWZBrCiexi#P{&$!ItTnZ#=U{Jxr_x!TSAU}LfN8r
ziq}5a+JTI*1V}v#Qrk|4r?46}LtyUgl?bn{h#G!dgt+K@4dj*`^aht0um&se)Upxp
zgNk)pb(bapbaGy$(@zt49Qzr`WLAdANivMnQL2yD(pWF#-pkr&r8;c1VwOT2B)z8G
ziHO%EoLoZAO6&tqmEX?M`r5XC4t|(4lI%K28`7mMdFD?US4N7e)u~vA(%{Tez_If)
z93H<sf`xr2@duz1ohaJ*o&g2VdXJ-8>)>SXxD{b;U3>x}@RHT#5|JlD3V7>YNvUOk
z_8ZQwZ3IZ1b8+vdJ1ZCW_w>S^<dutcC5aS2Woa^O$WfZP*UmyZXw#t%RpA_xPD2Y7
z@`3<W0!ys{JudBrtLerG_-1JZo7FHKWxe(=Hl>~O-OZrxr#L@~^Sn5pkPkgzxU3Jl
zmB2o%)k{K!dgBKS+bG4*8*j3i!+5hZNJd`3Ca)i?j^(B7W9_2K;*jmpr`@@iQ!-i=
zA3JtTlYA@`x0!jdTf}S7ZD80<RtBWKWYuM!?;YpHx?*2{{qto~?8&%hrP*Z;O?h;e
z+)YgY0p%>gme$JlO=W#ZNxf(}R4nG3?mLKEyTC*ZHU&%gWB7)}oYH6X=jN)d@Js(>
zfZ+JS8wftO3K)P}Jw3LY@WTkGWXc3@W!R)M`otrHYG|Vp<>REA_S3HMj_!S6`{`l)
zjt^E<0g+CbP7&`1eA2QW^|G13qDa*&_Ie*~Ac1paN1WHAxN>b1VGv+2+iP0mXtf*&
zZ5SyqBor}RkUh57*4}egYi4^H1jDM%`nxX-irNC7TSjANn5mZ4#<I?C`5(VT*+=de
zC{COk<WWY{7b>!jI5o4UgDnK`JpnrPvgK4+LU5IL(o-2~hVa<R9cTZ}$^zwWz=pf?
z-N;KRt60V9J1JbEn~oeX7<cQRvMKvD9~_>jD>rs>P-a{#TXSuSJd5&q%8_QV_R286
zTv1%GR{jO6vWqml#=15eK$r~&hjO)6OLYnD`-3vu)N8&$#o5=J3B{`1?ARnk#KlXz
zAc}jvRCPxV-Fz&}*$GedPI!h}VWmn@v!c`z?(xWRZ0v2h5-H5!J;1R%9lQFUe`e;}
zyl0avevp5Re)&a}=X3>CbyXBlF8@g;uI$fp9R!G4m-w_Chzk{o3~E^)6M2I2N9dO*
zP9Z18(LN?PG4sx`xtCRT{O&P5WJB~Fqk;rTbXk>Q#U%9?yl2;LmAEK^aA5n*2^@qB
z4&xv{w#e&kd-vjp+|O~qe0R<A$|$2bI(ChIJO=uccwvD6-Mn4?*e)l0sI%|=!5M-u
zZ<KyyAEcQ}RhctB1q0aDNQd@fRQDOx5}R6g4h7>C(UI^$CgztllaFcna`!e`)Y!wP
zI3QvF_@LzEQ%zON;$EDXyiR$RplnX6Dj=AawOLF~O)ws!J95w=UxN;G=5iW?HzZvc
zay)Ux>FdNu;?;32(p*W(Uxji$vg-s%^7}n11xfPzEk{Z6)`Xj^UJci*&SrJ*J#~8v
z?Lg{6HRS9$&5_t`TBurqsoI9uiXY;~1a|ISR9!3Hvt>f2;(n>{&+?O^K+E@X#N{~=
zVmKPbB*vJLg&lTWZp19b6wC*<l+nXCRMan}MNk|PDkmjWd^`wm%EkGa&%u0{+zZLB
zR!m~F6@X*TQ%(U@{IBV7ELta}`82city+Ca%frRrDF7MqvYe-V!I_B;*D;m4;@qwg
z<;)ZcNCbXBX^R(9XD+uS7tB+@%&ubIoU7#Ma1`a!E>cY3-n-<d)^~#@T3QX)e^$8~
z21=4)NoJZx!~4ku`4^<m$n*}g9>}Rl=~9_}4M~+i-i8&b4NI(q+1Z!JIGU2Q7p>sb
zgznHRpW4v7pcE1+PY8e4k+-E5GH$+;qFHdRLmG-mvle=_O*seMXI-w%G;?zHwr-N-
zD@0n@1ONSIZ|8fmSwT&2r**J%xVv}ova|n>7ygdWeZaeDW$>{N{np%vb?d}%@mP!?
zpcXq-D(w$Es7LqkIlEZeb!<(mD2=$jx2cpDq*lE;=T@nTMHH?ClH=yvS$5+xLfzyQ
zhZ(N-$<>Y;2RmKdy9Gp?txARAwnWQd_3FPjAc;y~vM{SUg9i?!Ap;7ebD=+EVrE86
zLUHo1DbNVDx$rSrnYgi6d7FyXS1|#O97R_wCQczG)?lR<Mukcy*(zO8GGohvBX+Z{
zF4fqWbwmABO{t`M`1+RI1Lj$T+Anokr*d-UBsopF6PQpBHM<$#n%pwifr*$|uj;<+
z7>n?Hlkd-x5nAkEdPJ{ZxnQG-U=zY;uqn!Vh#I?=IWn_8X0a|sH`Mdaq(n*lWBz@X
zqBx*u3u@_Rii<wsd+bU|ruDenoem8j5GX;AG9r@75Bn4cMy4$6XS_j%B=~#v8Gw+O
zfkw1`4}YpU+LWgx%;M94;91h<lB)%`=IEPgH8HU=X(d-}kzrJ&e=aefsugIXvbs^1
zTh38j@mbjrsM4}U^ez%ma#YHeQsZ^G7mc*B!80D8PgPIh40|`{+74K+_PcaE*2=Nk
zopC+7GbQadb#!My#xgaw$g7VUx?>;rsJut4Ww1|mCGThg5GoY-JC-4`@Cd)TJY3o9
zY&6R@=mqUCq?3=LJ7Z@uQ_?NVw|shf&wO2_ug+v|S<}!#Jb6)9)l)z%20tJdtcwCe
zKoz3yCeXCFjH<9n%oZAD6F3QpJgyems#qU5A&RZ`jo4=oty+?jT}Xl|hL~`T##m{F
z`M;oNrr#L5ebloq)mOx5Kt;=OSXhJkWIsZ&erFCl1j4WlZBR*KLD{7kW&Ma%)bV_B
z)FXsopDo%N1QnO)b#a15btFd>#hA7cnT1Ry)3GsZqLa6eH%Qc`XEt)5<$x|{zoH9E
zvOAbgWI@FEH0ovOIfA-mm104{`tu4}jc^(zT`Zf}rXlQDpo2SmEQG!_KF$i{9xSQk
z5+h(KiylH@bqtC=oN}fH?j)$Cpoyw|7g4&gfATci@X3NP(tE)vFi?SI#=|G1m*2P|
z-<5Y(F#fD=)E|dx3xcc^Ly53hk%23it*a_67rygSY(e{ef-NT^x@dHWAd1>l6d<Od
zXe_K>PiNXv@nLQERp`o(5BfP7x;`U2*J7EuED6P0I!tWx6cNRp3dM{$o%Z__Y*Gxz
zCW%BaJH^X3kUTQL7Ca{h@tAK8FvOcp717A1ki;N_VJf9?s*=(T-HaCgl=Qv6Ex(A&
zBREA%uHTpFyJ|^eo)Ho-fvSb~YHT$U7=#>&`zaMO=Bjl)SPjZ@;$qi%)IvhDlhK`y
zOwTa2gTAliVOYV<W6Typmu+&`;Aqr)<k@xSbvwo!a6DR*f#guqn@PonYK_B{T~Ix`
zrx%Z_Rju>HoFpc~vb723Akr0ShFO_oiKwd=rws3MhLb=}$Gc<e3}Z~V?e7!4P0*fI
zm%-g_^tyB}%a?hIz5|h9yf&+eD<Q{#umWV%Kw;s>#bhmtDC-*Cg3(jDsm!eqSkgZh
zz<iC9WfQVm^5v+cGnB{!DcIo&2ALsSO)GSad%ddfj*%Q`qAP^2)Vn3xNivY-9Nu`5
z?9EWuCCJk#vm&p(2l&V8X3(#(AvGxeg@O=;*`tn#<Ki1j9WIT_pph%8tnq+%s(oAr
z=pL%zH&TE{UCvsZjdx&&XTu7w4=jAa5f%M>H#5WJJ7?Dlo<Zi2TfwnZ)?@~|wnA%O
zx{u@F^xny+B_aQq4j;ez6mXh(51ZCMj^E?IMvNV2Ii4)6#&Gmlthr~QR)@k0G9piB
zIlqvx6wJ^Rpb5KIj_4Bd(JDcQ<+}9}4@B!Vp1r8o-rRcdaQmBYzpIF{rj1yzjfyEE
zRq*6mClIcuDs?1ZbK(XX$NK@VaX(vHx$zlNdGOA+M1c*f4=ZaCM?Y05@g8>(LFf<q
z+xW6KmMLXeDXpfzs)XY;ZvQ=7GWreJOYJVXLD(P&78`+ko1r^(P{?%4sATO5hOYWH
z^E~1c{ca%CxVGQ3o~^q!oycO*`MuoJS0gk7PBe;VOE7Gg9p8{(y%0I6$fK+2h6bz6
zTH&ENhexAz4y4ymCyrrHZBXzMDF?-VjAtnwxN;hL8b=K$>%!Ke?PdCZW0Ze3&8KZM
z53*OH$X6k+RDn{3IV!@y@z+qZ4(<B|Odmart9vL@qU<hOF_<jsO|yRL&%1m87+`6x
zOXvT6J3;=PRO6IdTZict1$};z7Tt3;sVOcn7&8+4`$Uux(@Ih}d3T4=W@a3_5cD*j
z+46hk5gWLsn<s40hMIf&R5m>?Q}ZV`$ue+jVp0%W`B|;_aUx-$Y6g?8P}yE7@e*A?
zOaU?DBJEPL<_pE2qIjf3*Y!A<vho~suO6&x-x}ErBJWIw0T*U$Xu|_|I*}|2%8`}S
zzN4h>*~CEun1u;buhpPMU|Kn8)iC~$4yQvEybm>p+GR?0m2+djrMDgtQ<|S+oWDFp
zqq=AW;xGF~Q;<JV6m;3*pZZN%PeE&8wWMdFr-+W&s8<ky&lLcq3l*1Fr`}W_tjtL(
zIG_s#1T2g?41}36X4^SU2L*}AQ<INZuS&p#PbIBoG_g0&%D)C3sHt{~1mFT_1XEK6
zF4X^phqAO{kw%ax6=*t49G?Nw?_<ct&hyt*M6xvCdC7xepq%L%zF5R=X4c@@EC9{t
zqX_KOw&;B<Ro}hP1n+^sy;3Ty##@)s38e5CP$4d@mhzv=?f$Y>8v6oOP@Mzw07ULh
z$2AK)fq~z1NVnFTB8WZll}2K1|I<qpd7<&1-Uzfe-YRmTo~n4!Msefikj^WKQA1sa
zlDr+O9bsj2_FGat)L^gCzMTjKq1bS)0SV)F5WSo;W>DTCrOoh}NP8Qxwq$v)jP-{q
z-l-QXA^`n~eZlKw!q&IE9MFgEhi&SO_UlXm9hi!OF_i`;csFxN;aHd`zDve@IivGp
zCS_s2DslGj2iyvxQ=Qv;U?uf-c1K`Tvj?=;WDNt#eUhzF`gHwqls+l%TX=f!o-YdC
zh8^D>j%zN7NSPuCRD4lUrgqn_Q@-Z3N^8O3DzM0UC0NWjWo`f*WiVu%$vot3`gw5h
zA~nxO_aIu^;g!|RJ|O$5OYh~jg%qJg6=u<Pl^Gd!FzRuk0-`kLPY4~+t8!tlk1-sS
zw0&Q3Ja6&-jtD`14qVbZV#V;Vtb2zAP>868Tt7huSeI-R!>OUQ-4y-<gK=}FKfL52
zckx=Rogk%UDtB;rR96{6U4cNsFy9#@u^Z|~D{++DNNLi(ZrNS@)zzxg^*UgY008LF
z&c^rXN~JtO6j-#L83^mIoE?!aJ|^T4rEV>Sy;N>_d?;|HiQG7y_sN+D4orN=@w_PR
zBmTr(l*uHg>VHf7Jzz>$g>lkqpTHB!ZIMJz@}dU_xpw}{es-DPFVbOxPjCGVs$%5X
z%VaR9k<_}jwpNeE0EMDoTWTF2A0FS1mXN8Ami{^V=V+-Bbvi#ZJI&*l?M|m|TA-rQ
zXMg@lpoG=<pU-d0Y7jqaQvWP?S}>XV<IiajWFO$aZfJy`6q>KQK&^d{HTmowz9>-d
z<d5+Gy+{8n2t{7(?YBA|{DymizwPfGz_TFC%MEJO`+$h&q1}9-|DLOan~vFZJ$l-u
z|Ih#L{~z7SY4AdI>>8cjR(q$$N4vA>bloMY7Mi~48^khd?1$Fz^TT#4S~suW9K30_
zc55H%Y<pCPZ@2OS)dH+*0cj>3^|La~1&ZRgd&^#$oorM98Ki`@nD_xhRZMA+NN|ld
zx?CQQCbzVm1VSD9bUP5(wzZEGp$1=5+zV>NN@t<!a@tY1O}Z4QZWCWuwy7>z>)yPG
zfZX~UI~c-80RFE5JstJZzN?Bx+W+QY@5czqFRFHiDaLzCfTiqFutr%OqqKx01d8(V
zsSG&9WZEsL2~?^V?|nt*RNF6}B?T7C`n~wFcDH!XLHw0z37I_BYPw>*c)wP>@4#?S
z7T#E=k12caX~YHK@asBkHFY>|q5}ZvjEN4NiCQh=(|UBD#`8E5=XpCa7OI^%n2hTb
zafFLxlxKhk%d~FGbieLf+m6pKb5xg^pi(A&ADOv;wCuV3s;1Yh31OF=w3tv&6Q6OU
zn?QWiux(psL}!SemNkox4=yxnOdTC>py-k3L*prFT-V%47*{vB$JqSzIDI=eqr;-j
z@$8k4aqT6R{x&Cj47mC1&}z7Gl(aGfvn6G|-_O{N;K`enh8l9X|KtpaR>mKL+Uh^w
z*}|+uo4xukn2%^}CI1C}4hBLn(nd6HXy@agwz?+PM3&2P!}UQ9#+Ogkd_KAB;JetT
zCZebcH-Ved!pr$+>4i?Q5gBhf8FMA(WvJl}fco<qmr$VU1cMU_c3RrMti>Sufb89f
zFyh`-d7&@J{s41<l(Az*T8rx-pq=7BUHk{bGu1$DpUHs)m<z!EAE-q}_+e7Sbni2a
zi|%=1Q7n3`e8Wq`$PCO|m?^y8+U!vBChJ$w3R``2DLiF665dch#ACAKM(%_Wkk43d
zc{gjeV_+T8X!mscspcQ7T}YD2k{LX+9MQ!DHqE0b`7lnps4v9CU}ssuNmzJJE;Ayl
z1!FNgN_WpxUj|SLx91OmOV1vG0LN!>sz)&@D3;xXJP+-yv2KHjN}%x-?x@8E%U3Nt
zW)yJ=fuguuOx1B`PXf)>aTZH13M}2}EqPd>dvEZ-7n$LtG)1NvRnz41v!;i(f52#w
zR@=CXbmiP2Gf_56r$@J=(!^dkRY2axb#yB6!!>{YG_-~q;sQt}_^1P6-sY0_?1VV-
zi(msPEWFu)3T>J5<wtk#>L%TSmE7_y5M!6sIPU`#u}6^ZPA_^7BuQ|sj6yaU@uo1B
zv7ZZS6^Y-FB?T$w=Sz@s3s%YiGayA>UJp{!*^n}0Yxq-`E3V9jlo~vxLdunEdYWNd
z;V4P2ck93p>g8BsK%1ROd=V+i%B@!vK2Oiit<tzxR=s+<BI%Qz+A%wr<KHK$KK{CQ
zuMt_daAmh$1qv#Jc^s$(HS*tn!xo=C)uSt^;O+XBZ|3bQxvRP;wKqcV4ZxhJYZl}Y
zPvZ_<+bjiZGhV4WnAi~G-j3nC#H5<FJ3!p;Oo0_CvI5X-RvW}%lc@e!N$v2>xO0%O
z>|?3@iS_Bn6&ebn4Gl?sL^rhG>x>4uh#7%r@}@p6rrV!S&Xb_o8-A{~l;~S+(GdG{
zn_G#CA{mZ>26Xhu7hL;MHd?J(f3#TsGvEO3Fqz*Uj}od<0OX&EETvl{Tb5DBwTd-1
zV)X<X%V=Yi5!#cCSbZQq$RKXVXK_k~PF!pm#@bImEL%)GOO0m<l$wYL$%R<7N{w2`
z6lb&fpSK@4K0f(Kgjwy+#rH(~6NAX!$?@Qcbo;J6$>r26=^g|%m7G)vFMZHZovj8r
z<2YVm<fW_R6R1-odObM<d5)(9-{1fIi)1V9cBcqGH8atwVR0FddGg+SqN@5S0YngS
z)f?HkNQY=)CW(yo8m|&}t)gH`F}knm41h5lpgu}nvIX9%-j(j4jm?wV$SSMDA5l<W
zQX;tH(J{AVq}eF{nb#9!@J6)Rh_)KhgGThQ5pBa0waO|fs}x>^*Q-!!bqk%<(Mtq4
z?ck1*HsQZ*Y;W`1M)cix-znT-Lp&ZwM+G{t00g7+p@NUxG3km9d}*|HWqwfi^_mlm
zn>|c^wg>Tx9oU1FZ_EV1-zVIST^ygg_snXIP9#Z##sA1`?bX3G=%l|`#Ka6wWy2Ot
zrXAsf?gy46_8#tmrONmnVw2^>HNkZY_fA!ffR9p?{(n_SV^JI#@!O(jX0Yg4hsHb-
zpd6{`<;@ShY%K{>SUQJeFawBhd&Pn3Y|u)RK*BaK%Bxt1blXt8p5*_em!6K$1=)uF
z|BZl5W$^nQK*qMKe_4?61(<_s4?iHcqFsjRII@A^0a9=KKJWTIY<fdz;J3Tk7lJ<%
z&;Bp7R>A38C=L>whiu0ZWHrLbE(g0_z_gAuIMAJvYPEd&Fx(AYn}(~anV|v#`UsEG
zU+0JX|G<c5uQh%?Ew=K6cK<FbulMZNl~;Ryef=-K_INXS1N(ma!9uIQzW#fxKk$Ii
z6ElRHJ~QFW>t?q9zY!AL1PS<kkzjMZVql+v1hu6J$Mzsb>5K44D&$8gy~h_}nPocY
zWP^qoAn_-qS^be%dqvi9AxPo}4KmI~lwI5so*2NI$24IW%6PXz_xSlx>_$~9rA#{I
zrK{va=Pw^Gq4^dfP_m-11!zU#?>bqu<bN4TRk7yZt*^tFw-&GP%{tWx9Z(fDRyQ`O
z%1r*jt@2<K%7>`Tm!!ABL$`EAy})SJOE&Bax9E&`)>ivedg2rIjYa7C!}SO9PsP?T
z$%?I}7dkRFA8tz1o8h$#Hhq=j=z;JgGjZ`c#}WFgez~)V+@)a>u3KtDVken@f0v^Q
zr@En(&ZM#3xXDS2np%bad|KLgTU(Wi182jkCIZ|?z#YG$fE@!%eXO`y?@Is=Z`8Rf
zd6)h3C2ZDvueyY5BNLw6PeV&BCD14PX?eb!&z0PR3{;d&8Tp5ow-8#7FTrrNOMeXw
z*XmI(?O_Zz6U>zY?5QGoeW^OvHqTLwz#AhwVbEZHFDxeEVMAF5-aIN-990h=KHS&}
zoNj+*tb95PD+llKJx%-fU0Y<nXj$RQO)l)!c#6-E-zt}G<_H38#9Z8R3We|sKh-#f
zpKzdyYakYW1a&5y`!~dA%qNOgsS3hK!#2dxUy}#leTS}b^|{0nKi4Oi!RGLT;9*Er
zjVv&qN<#YSciwt`@x6CtR{bxx$0#Z;&#FrFn7<9JQggPVRdU95R0F$-Es3A&Y|9yT
zE$~^Ivup8lt(}XX%H4~fO0y&UxJwn%x>lK`;OEPb1C@qenbwl;3!chf>}s=}6fZzH
zq**MwrN6+r9dgI1cEfQ~@l-Tba=K9;H6g$(F&%f4<>2RPE;j1JJM26lgr&0&(xAV}
z`K*JJH{Q>8@?X@>WK(l`5?i^R%I2-s$L+6Tn94QYnW-HQMSa{I;+Xmeb?7vaT^@aE
zyO|{)VoJV_n6F*KYGm+M8sb&7=!-b?RFz$D=PG0NuRC}4&b8d+N=?n(xnDPH<z}6~
zC)0nA{m6-1B_sre<2PgfBKxrtYt0tnV4KV@+_m$g1d8JDpVR261{ZHcOYvzpa5?a0
ztgHlxoV4~Y3PaAp^ydKKhJxN7Xr=b&g!N|d4&$@-{8wOqL14?Jtw0>F-!bxlJ{$bp
z+x``9;Eek#T<RLLS%&n?OI@2kn|WpKw%kkl+_Iz-!aNq3yC?nER1&#_Zt6pw_80H;
zG&>D+3d<$Agzjz4?A2|opJj_&c$*3zb%ioN6ZFotKQLgy!ll!AvZQuDO(~o{9tRM%
zceptz)M>7A^W*1w%qzi0qS%cpnNq#3RZR#0_vDbGI9Rw<HZb~XT15F6w+Zsy8F|<s
z{slo-24N)wgR2xq5B1@^XE-q7mM;<**aunXRf5>6Uev!=ji-EpAGp#l;a3R3#J+}|
za`M@zGnb50w=7M}SUE*tW=IvBnPc4%DH=NO&sm1fE^90K(wtZs^szdhg~?`i8=o~h
zMdaqrZsU)c-R5V_PGR`m*=_zYv)lT-*(sVbZ+2UM%<LX~*6h^bHFtIo{+QW4{H)o1
zTy%C1f6v)1ApM8RU){z~7=@piNBAY$e7H`>8U@Yj^#&AL-BEJ<bs5($X*?gihzfNG
z0G@5Bw-Aful(dNS!&yhHSE+&<QM2RYwsLOsZ2=dvs@sI^`_02IYw53$oKy~9alE42
z>-h%!`Ek6g6<8R>gE;PZLICQ{I63xH$s$6Lj|k1tTODXRI;h{FEW~z*rkmPR+p?#=
zjN?RaIv%85?K|;@yA($&lv&B@V|O~9<#xg8=dXD~9V~$@&eFpfkkNoCd*1J+iz}JG
zR@jMMN!NQ#pkGsod_zFLVMC%n+r{IYd#0OR$SYlAeb#DT<2-c^e~gB|(b%-C$rvGG
z4hw;CX-W<?{VEoI#<}l-^-svCM)zRf%{vli9?I9#dsK^GG_+0Fl((JyXZFX)U?681
zDeEe_i}eLGPxHpOzVSsyIpYAHjnS(cjn&P?F}ebs!zlR`vHvyTU^SnKHGJTFN!(st
zKruIGkPp85?$3tWSE1EkG5Z>reFGHn!JmyHq8smNdKTT=P{{LF#+^R{>NpWPEsd)|
zo*7F|<t2PQz#UeD>}6zCzL?JRYN9NsLYq+5#4j8&X*U@hV?Ro1T~c;^83Sr(iWnG*
zvlVbky^$7;Fm3=o`_hgUTbo~8@L^pd|F_U$1SOc?eKBZv;B|Z-Gu@JGbE76@f1%ab
z*!=eQTn^C!BiA9C;4el5zLcim>Zia}0`7ztio_}a+U$lOG@=Ld8@|$d4e<D;=<0N?
zqe?Z#Og1^^<@maAa~5u!)@^RH55BwEWg8`Dagn}969$L5|GHjt)@wDSFAXf$ciig6
zcVBe5zW71)zjqDi9BW^86@8idfBTYEEW<*F)|Pc>ZB&{tUuhwrXK}52=!mC(mSy-o
zHqIu?js(@xR;XI9a+r%!qYoZRqowE&S6eEM<B@|fG?2VU6JULRhnT|~@Cn(ehf8n5
zXYtZo@L9a{1NbarG5>)7U)AVMSofPWZIYo3l}!k#3O}ubtf1G82s5KCRi`(r7)O=5
zH#iPlgBjz%*Vi3Kl}0x>4qV+C<G|O~9Y>W>WN;jaH#5e8uNN9eh05u{42_eeZ5qe0
zDU}(|qifE)QtyA=iDN!z@`0^icPT2h{MW^a8yM1+&|`t^asxxEGIYHzCAs2|DsXr8
z;Wd!=y3n}VK{tpeXX5|y<&L_U%n02tz;J%v+Wf_RW5Srg>-=X7oZ^+Za(oqPD8<Ya
zs}DCGezUdl?dHb%w-2^AAAY;>%{K5bX+Q@~QC6VJV6e#{>uS)9PG17wVTGjOS?X!$
znB^8eRw}BiYc72Ve3oX3A(cn*mBAOl?R3sHQfb#INR>+Chc?5{cY41>xC2!!M1R+A
zj<!Rp!9MTmAiQNt?-2?gdaw&llcc}U%Gg&Tl{aehZP2Tiw1Qr=Idme9S*KK-d&%ap
za1XzsQHy@|Glk76dJ;YV9hm3uz6%6ytt$KN;$^SA)4Z;>uQ05Kv&tSP<3Zd_nl7(e
z;Z-=R7IHQf-ey-?aJhCJOp+lbVfxDiB<AgRkxhD%ph#?h1(pIE`pIAATQVyOh5jsk
zjK`*xC4`J>`%~3eBw1EqFxMT09>x{=f9?!`TM>|`K`hX*Jx+HNf$l@6&v#e8^ya06
zBLKt64w6w#J<w^e?9cs`h;Vj2I>ovFN&H<aVz}Vv^ITzdHB2i7%Oa=oM>siaUZ}ac
zanYOM7;EcjXiDx_%HzjR*;9nZH$Us0(_@84RA`C2=SlaSxTaFZ_L)omxodpmD+e<;
z=CKc_ImT{y6v4J^z=p}_ADD;woAeqHY_kSu!V51Odasw#)a${|<4uG-;RaKN8Z$9O
z#3z;I*$Lz$`Ki}da_u|^tAkw2OxluKHX>1YaDNKSt2o;G)vo-C9HAX&c#S?McofwS
zBPUXvUV^9S<{wIPv}@^2(;WQ31VeG!@Kb>p7(D=LRY!tkH~c>ZJ*&nUs8PE}mM2M+
zVqOds6hLf>mN%E9G3E%wG;Dc+7w2>{LBUAi2eek6*ow-a5qfozu%i4texF3eMTSk(
ze@85qtdIbh=O!DZ@H2KoNA>7`Igx(;GeKfC+Q8_bGlXLG`LhyqZz4BA+^@V3=as*P
z6RH;u@m?esgMSs-sp5QFAns2^IG;r;oTtBDt-`PG23M<)W#g(d`l>e8pB?iNKYtF1
zK*9YlE)kdrk292xUW~_woM@?`9`w+7oF1)7fXC3WyJH>Hxdgc5GnNuAGbaCzG6*ju
z&{j{`!8=g42_b(#KL5-pOjp4)8sQ=*mif%aN-Jy!P*+$wC&uWVoH8oINTlOG0!`<Y
zzwQA82Lw!693uX5s=44r5Ps%g207!mbV}cB&kja#ojW1?eCEB71Gfe4hVV0skGcBs
zG<!%E32GL5y$@wN)QBEzeKX_mg10wKRjziMgdd^=tq<d*OGJDy=y3=JVq62)s<Ua(
z?B)E^QicJbrzq;1|Mv7ixjg)DAP1#ETsPTrrHclBP)$V`wD~Z4xE0mjCCNDYdGlcd
zRtDzX9ZYjHFnt<*1H8{LPDe2LpdKJ>;)gK=W~OQMOV11vG?NYn&xgfA)hu@9trj6n
zr~rQVqPf&+m&8I$?*etx9y<%&hL<)K(?o1eq7kNXGt0R2&mHL(MY?bJ|6iKqJ^wvO
z9_*197$kPJm*(;5z)eQ0ve0JJNwl>U<;lOM==c>6LRvNGJ2}I<^j?N6s~$M2?NE=$
z+Q4{l5ntv}AE-n{rrO15uu1uIaJX~$`sldTZvURdcxypo{J)RtBDLKTv*lSt_hGcL
zt!VDU#>TcwayK@wOLG?|xvS`xP_lx*{>;e}Lj8AbT7CsXVl~tfRi330Xg<;gNN8j8
zkom?1Oz|oPH#eF@*+6l7#_*osCh{+O*M&@7oq?62U1uD{bS62zT5OEj5mR-4GbV`x
z1Ui`HMtGN+sF_*L9o_TXJRzRCIWX`LiQ1UWFWxAF@R#8auD~AL=vlt=ReV|W#Qe7r
zUlu(`w<0aOY&EvLWAwVG=*&w7_Y~dyZV?6NgLU*x!%+|8cS)2_CmcL-kY!^;2)sQC
zs*taJ6j!EU|NYM40Imic81MrW@bLHx3k<toiOg3bb2TDU#W-(<DMTrZ?AELpN^&<P
z*TpLHSaCi{674Pm=l>2hmXh1kbjF!(2b`^($F=uScaq=*nn7>!b^Vx*>BsM|vAoNr
zkGQ#{d)!)qNqhTb`$1rr=$#gP``6k-2$D+d5K!Uvs(l;;F6(5kHKKp)9g*Uo;tspK
z^R59Ud-bY^6bMVRz)1@q+|E~?MkVFmA=G~X`2G(bahQ%bU{(vr(gEKz>fIqr+uQtK
z#R*Qiey>OHwz%P~Kw7NImbWVe))LR5hP@q9Dgb{#fWKUm2AN%)7r-h#jfOd1*xMU^
z0(1i&;Ub{H7#3TFKk=mCGSV8_c1=f7OsxU8MNC1~cT{@4WQ;*DrbV9iD3a3{*oPRn
zBr1%|n%2r8#^ZE4xJBhAo`RTfKHQKv65nCahYdKN<sROi3!3ctlhIA8T)lC(J0-(~
zztaw@*MuCHer<y|>uEiD6m4*$dV3OX(+;I?Ppq!^k-J|l;xAc&au7t*e%f^)1~5X^
z<|Kt~C`=E>5xLXjUV;af1vdP8Q%8iZ#;XW>?Xi4)0{pjpuO>=>ANjj<%&D`6@d(o(
z^`@g<3@y^~cL8gIIguRnp3V5t7%B*Oh>-fAnn_ljaa0F(h>#{)(H*vZcmK-v!V$wF
zyf$8>y}(7cGw-}e#yoZU_9WWmZ?k6%>qg51q8=<=W#%~bVJ#MRgv5A8yUx&NED7wu
z*}5eA<DGGs&b=D;>SNX*8x#1AdY^CX?{Y@@gE#y8{O^nfRiByp<gYLSM5Zr1g0RKT
z>^Elr5k3%BJS8Ui9FVxWKfORiGP8@$B)*V}itH^|`8+*4w`vcP5gbcyJCzL)-Z`zs
zLc3$6+|u4`sKr3g8<9*L|ExY6B_E1;Sc?0DI#HAV?KkZ7*;75CMerP3;Xad5H|wD_
zI><xzwbX8_(>mBW+}%5P**R{$U8GU`h+};>n@o~!VIM`0c&>2rr1>2EsQp<|O(Yc0
zln)GOq*l8#ZA5pb^~X_>74hIIP0~R~0^4IcogZO4i}~8oCobfqXsA_aXy`Z8>M!0L
zFGNs~_CM7dirzAVc+<<j|Bn~fT>eouTCGBXgTs?QAsXNgE-)l*g10-pKLJ)W<eMH>
zM}gw=@#TtyyMjTOFFKT)w1o-t?+j^z-cyRqer@TWqoumVK8s6=#RRb6rx;SlyH&Mu
zf=tOi>UZy~Z{lLFuWk0DJn3emUcN@Qs!Dte7|GW9gDfuUO14Rn&DdDi0nSt>I|ljl
zU>DL(%@&L5;kJ0v^oZU6PqXYDNI&m@-7BK$xJMS#lpys3*;EgmC;&4#;0@Qlr{ca6
zgJo^ZFSfZ@v8~05Jy@*RL$6qzV-~8KY`dpV?TdF{N#kCRoTn5F^9IFY9%le+^4-eF
z?1Si)Wb(z|gV;;itGZExdM@p;R-$&7#@6Xghr>(BI)(g=9QA?W&TdD1%dwdPX1@9i
zkn4Tjof$FP#d%!NfHjUxl43d;<@9g@RH>l3HI#lc6%Vx}3DhO1<O(JTgAyBGHU1ar
zNK%vY;OofOd*iQ$f_IgJE4%>AX7=d<OJ?s(t1$x-7jZ6idNa`=5J>d81NXRfXN5D0
z%%X8PiYE!`tmA&4@1(D`K#ZjtS{9;SY3Rcg=-ucnIC_6qZiP0sYBS$~<77goiKGJu
zeiEer`0T2vXU)tTQ1#jMDM)Gu=`eMJN0Rs%Xz;3JRtxVXGRso#Q#{(9{P%w6b@Rv0
z^Vflx4U5nar5RXiU=(q+%pM83I0s<}y;B{`il#X_Rnk=hs+PzKF0c@{7bjwYzGX)u
zF?P1$MG|%65p2+lNG?0#5u^VCsKCY>4Bhpm&!W3m7&4Js+^hL?@*Z!zuQ*a60%c6t
zxGpB>En%a9v*F#DnagmTix57XC?f>=yCj&4cNCgi84t{k3@*Z~3T0T#-MQotl}sjO
z)~~t0Py4zZ9W~qS*6wY?Poe;&%X8ExkYz3#WDS5@0>_bK&^Xu(x1(qe_dyppfAmzN
zSGX<UbU>@HiS~@+(-)sSzV+$W-;z-;?ce&3f2+?V>81H9Fu13K<bFQs-j9>D^Be91
znCA8E?FaaG<C}-;_Fw$E`Ecvue{4M1*xY{j@SDvoD7W$8!PfeJMC&&^j^JmC%zYI7
z$Mh70hUtuQbKd_&KR`~JAZ8E8gCt7cC!=DuHvytJf?b)NP2%AY+3rDlI*BKjYtbR_
zsObnc+-0;ET}(1!($X9lfFA5mW(JTZ{Z~3%&ZRvv)~Uf0R4>HQNq4|^AHZayj}IB=
z4Px}dDkkwL$FDtXD@B7&Y;lO!C9xU=^#POxFB;(JTZ5uldM6uSG6P-f)-fBy_Uh(3
znjEy_!F%*5O5oe5pAORTIE$XdlxyT8DlN{2Y*<NZv1iy;69@{mmE%E?Ox^?GkZz7~
zyA+cY291X;9xQ0g4g<}z>7>g?%_)G02RZ}+h9ksJ=x;VHu$5uf!z&>=up30P$H@dZ
z7$oBW_xEWJMMia4^|QesyTElo36<gvFrgnN#UmM4R2o~3P?JI7@^EYhfO!mq#b)DE
zRQz`}+<=s(-K4>-MZB)WG0|<G=~ztf&8VQ)?jQzvd$LwF6zI|diW&+`wKwf1q0y*O
z$e^w@nusT=n(AfUDVm4GYUS?3qA;&AMD$Bz;F~n`Y1Qa>wI-tHcaWr1k%ZBBNSB^8
zXBe<~N=uLyxIISPMmEWzvrCX&iEY!c&LTK_GK_=()nN=n+*u5s0!16#l0CK_AxPv|
zzqmjYu#gHr`m%9MSBn=D#HkTu7pXfG9-qA0Ye((F7bkC<$E^sy9~~e5u(#XVjh_Dm
zFI&;h;n7dWdoN#|M6V9_cU#BpsClppPY+Ix_nyBwIfMsG%{J6rq8$V8ng>5ctslv0
zB04;d_Ff<D??HRe!Ey88WUtk3M0*E2`)^Qr*@&PG(lzeyz1};4Vkd_U>=zp=*NhHd
zM6X-NJFnnp^ZDNX-pNnY<%_+O1MKbv^w$Kg;rL{4=gofeI68WBe012R)^L8id+nY5
z=HBbp?i!2%`i)vYv<^<9_ABB!oar9EJ!l={1f01(r?&R@n$P!J+#Sqzckj5hbAr<{
z-*y0qFvxu%JV&jaJ^a%8u>~_~9{<#UW{FlE9<*Ek{RYax`)IfMy7?03SepYKSfQOa
z$F0{m@WU6_PW#RC_Q~GKo0C@b^6+q%z}{{h|FE~yYCn$l58DK|H|<sfIyq@#_t*+R
z4PL|d=Wp732tNY)!3pqHZ;np(4iD<E=5GN)0D~sf-X&Nc9?+ZtSck_yVY>(nT8c*W
z_Eig>!<rw+^iGbO2#z)YaOcD>3B3Y5PprvC2d$U;doNoDJ1u;Bhz-5nYq#pWczbOu
zv&WskZ9>m)aQd`pFgE^b;c|nPHrjg;HFtm5!@+Z5Yz<JNy(j1cPup*HUJ3MZTim~O
z>u+fvc;|l9=`>rNSDntSzrn8**l7I#ilC(|kkh4M2E-{FrQNmjrCYirlso)BTDN}#
zT%*+ur^vzKK`UA}9Q{GYhb103XFzb0iD)vcI>)W%E}`EB*Li`-vPdTEC3$y}j?vvc
z%_-C<a&vzDx5s-YRDW}JeIy#8`p;oI?!h8IkTJhS3aJ_ePMnN!`>9AJG#zC2i2_%D
z^sKl-Jiy^!Qae2%;8Bhgmfp{5iTDim`$s|-y~&gQbigyb%%;%=nIvRL408bStfqj*
zj?PH41|<ER(lq8MAHWF%2iG9Qco=y2V5>8mf;KWf%TqL?Ih$nDF-Rl%ISrDq&cOJ^
z-ag<9(k7q>8&96B*X_3_K*8*{8_ruGW%{Mt)NgKGr`9fP*3R4J-U+q1>Ac&)CZD%}
z+_gIG{Z{LU%50U(G+zMmu!=mWd)WROn!r6^cih@<0cqngb@p~?ivU`^rtDQ7?g1@C
zLR9;q9@T2^v$R)_et<sUWQGGWijx*12i_VyrZ!G4#|iTWcuyX2F_4$3*#chTCdX!=
z>I;wyk0x2SR&Fd>Nz~T{DU|xX23K3@0tSqVUAn%<H^Vr82U4YKo9>>I6W~G?Y1-Vc
zq=62sW@X6K$_wPf(~rqyksju^`J8aPJxG%A{08d`W(1w=TMc3x!nzGCNbQJ%PC<+m
zh^VFjJ_%O2rij6Bimd!5L`VA}nDvTQCVlz(xb*76edSLdq<wo-f;8!HvDsijdp7p+
z(Toby67Z5BY4lUzjnx$B+`tk@nbgn~szfV=d{b}Aiyf`>?VnXs#HWEVub^_j`YkG!
zja}U&>C0suOiTSBB0Ayu6~t)E*+u;6X#zA78u-uuj3|`bBw<26NxIVsd6-z>>4GT9
zF1w%XVeo=9<rLteVZ4I(K4SHIk6k2_#a2bR@pggAN)#+d(!pt*v-pK#Z?HSF6>K#A
z03AkjBI30&Di#s>>_ZhMK7pEpOY3yE4I=ZTz`Ig$bomf*0C60g*HVrma`&C7ZBVaJ
zu)`oCdp&zg$jb5}J?3bAdKj{F*7njMT_Ny4R=h&Ftc5nZ`&Zgdh;7r5BpdvU$0-?a
zVVfr?$iV+m5F(*|3^E*^ug#-9BghZ|*FAbvDq7*AImZW&tIAO9DXRz}$sj(<88f`I
z1L_o6K?ewQ>(IYAVg0jyRI^qOXrho(Ru-E=l{8e!w~JYY_$U!`YPFgb#my<Dkl);p
z+vE|Dyc;|eoEcobH$B{!l;whJ<#Vb-C4<IlrW&;>E1NpQ6!1o_@9p^-ni`(3U3M;&
z)l*~GTxEP|Pglm4l007oE{LGI-rG1WYNfTUfPq=Z*Ks<k#w<3bq{V8E(*t0#nYA*A
znG`--P&MS)ThnQ>iQDm7Et-vNBN{Z>hE<xkgN_s2rLzk+qTq&xO1s&pphcKfag<>Z
zWRCtiR|zHke|{csKHR?1JAm2x|Mkty4PXENaQ(r<uloPr<8y!ICO)@V7(k`xBV;TE
zhv0E@TAXK-M?_|yPvTy*13M{+YNz<Uc@p7YRF5WW-E3IDWhwF>!H-?7%zecC0%@{S
z)YB#)j-$SODMl`0NohhObU`?q#uJdslO$imMo{NH$Y~6_BvP`y4e}Z4!h%dA^Kr%!
ze*0B(BceMItuTg$ZsKDpnV=H@Qs<SHbM=E;vlfN?23p4v%J=PPW>;EQ^&~HP(8=2Q
zGxr$~Eqpe!KkV{#bLaSQW@p@=JCW!6hdbYQ+I#<KMO&M;PUQZ5DS|#j<0*y*#S*8N
z1*+T6fQ6njBvNNaCqEs{hJeMxPhqOxc8civPbaO%JcMsoPt$@rbxLh*Lb11p$GeZI
z)Yc{y!%P~te2L(HZv7{=M?5O~LjEUKq~By{{-4?y-JI0W8o#5WIf@}afBOrvq5`&^
zlOG>f&p&$c=3obvw9#&BXTN#e#P3y5xX&jTZ^uqLg7eFC0<2K+K^<~Zgv}NGLJhpY
z$QgJ%*<Tte;5f|1YlGOPauZbfJkHO5{>7Y-HZlO>|Ix(o-|$nu{~smATK7i#n0@{~
zc(}2(;otv%v%U58{Qo^ZXmm>}9<8oM&*L0K?vtIPD9^g@5|rPk{XPgAa9+enxnR5J
zd2~vN6uw@(f4zABdh!1C;{EHz``3&2&%bzAx9a^N-T(2Ox{*~b^ZTTe^+XtW%qLag
zInbN()9I-E40YG;(-CF@N{ajGDEz$Wj@=jWWE|heSMKBK2xwT(eb(=eih(bQ;dxr>
zs(0!>N+y$0R+8c3$yr&hqhc0R>4-;=B2<7%v0`gP%CpvFl1(HsA#|abeSXj%7L90a
zZLNNbuRPwz9gbZye(ag^iZShDRg8S5YMAN=+7L6|_xVVSeW|17LF)vqBRc!711bhb
z^0=;B0LomW-=A)=4v)wCd;lwMkJr|Vj<Qkb6bsbt8zENq({H@`N%(jd9*2tK0ak;#
z==!K+_?S$xdPE@_MysmW8f%TwW}^^`a$3^bW}UPNFFG$<ColHtfPB$u)Aw$S{vW4_
zs!H~clPS6lf&dDv6-tTmz(mOapw?*A(Nk$1Cn!y`Y51z+hVQH;L1l^SsXCGo7f>xx
zWk#88xGlEOYEAqgAe_#F>^T53I5rgKU`}w#<p4#PIS9K6EMbb=Pa{%uEzte~&ur4$
zjL;8`{o%TlXbT64zo6=UYJhy6&VW~PpmF=Qz~gRoh}JWtTOc^xzHQb#IGMxmEmRGZ
z<#vC2YBd}%I+xy`M*m;Cm~PizBwF)^Xz;JJR9w@V;B{9m1Osaq9b}`5U8Dvom7Ohz
z#bAaT?vA{EL+jiSAXjTdVWM$UzS!;T>>t9(y%S~3E}xM(a-VP}Cc*{Z2TA-cUyF#N
zB7~fdy2M`Qz?EUdPZSN_XYb@{vEN(Hu|314VK(5L>R%9ULaBGry(syRbb%d)W1&cf
zd_7GZKYkOFEH&|+L58Jk?tJOiymZfai}_#+3nqb`t+LsCQkfwpj6KoayAiEC{%irm
za9p=gPZj#@H~fCrf?&P0Atq8!(UwW{n^k_1aUzQDHuUw>)rM<E!RwBc7^O`LL>Ujz
zIDnmd$!sbq&{-XGkOLo`OklZB&J(7c7%GuVlBIagx%c!<@_ss+eu#iPT_oZnh4h`C
zu4)u$9_{5qd2TVCLdO4;?Y!tdy`ei}TQ9PHaB$#z7<d!MU3DI*2Gse9&p5mKhP8xv
z;{+Q6W<*eKAMSVBu>D)e$sKmSZ?%q^`+GkCi*=XABB6`0Sw&x{shKp!^x?F5?Q`L8
zX`f9c2ME?qM;#QqNk7I^fY4t-R&*pVqZ$AfhSUdV@#Hi<OBzPh!}aIoN3g4t0}lgO
zpKmtT*YT9>NyC60w32JlYn0|MO;1I}u2CeHCNUcDsJ7y6F(tQ!DOm-w;hl`QjqBY{
zC&1P)0&ub_wRHL%;&oGxA6Kp3-Vw0+Cx;zC>;_^t!Fq3ZKfHWTqV+k4gSBvWYmZdw
zrfVPRG;i`sr)jGsUBnvkCgCV50tLhGTqL|U=Ni1dWB|f7-o&Wgc^`wO@ebtuL=hUL
zBQdDt9nR)Lyh`MYMX>`CUPc<81p%bP^@<g_zh%~h-aJLv>fLsw<vKX|VgCl#3!D4=
z1=|6}Jng9^V(v9nAfuZEy@UvC7xc}Y?-iJ371WK{8SfupL(#JJ(u3~S)gZTXaB_2S
zgT}58wZCcpO__{pVodf&P2we{BRVzS1NFX$Cm8dXPLPqJGQtY5k(ylVSFu+jTv@Wp
zNq2mZ?c(OBIw0(`VF3_h2$=omPd9ZESWSK*R+Cw~S#VI(cR59?29-r<c%0`hXBWAd
zwhc4tiHDjSz^zh)qqBXmi^kN4ssQsLbrpv}lTKtRj3u9Aq=ZMI%8imLEBR=7m@mU=
zc}B`oC4V~X22$)39!dzGEOVe-Z8o{8#0lVjF5U~<QM_L(-gjU?6wc*71~z$Yy_oWw
z+AzOEF;7-Zf%y!Jf)HS7@m?co@qR(U)#X%FV>gVS<%OOk-9)h<YORlVe)yx-`WOU}
zzrb262;In9tHy4At&fvD8@y+p;ylX>x;t3HZ%Yy#KyZOnadbsO1}3peS1R`zdq)_f
zhC(*ON-!3jPW%02!r@q0p|g~Z;o*|f`S0~b;KB<8W@>48dq<tagZ-bFUsVDuNiq{2
zZm!3gvxoxB7qZiun^o>Idq?jdAfmzFZ8gAz1SaUxM3_;X++rOR$kP#}&4}szzmIn)
zLo|7$Q&7r!NJ-;zw1xB)$Em*4<h6kS{p!q$v1QC1Z#j63^GHYiEIP+HHw|bQept5Y
z3cZJLJSRo%E*D#G2oBOug*2q25e1SB`#Lwi7N;F06F2ud2X9`tj`wz69kx%nx+xUH
z=Dx&IFFJ1y@TS2lfY^+hYADhs^Ouw3R`c~^4wOpd;xf`@v__*h9p_pkA?@GfJ+uIv
znF2zMA<Us7WvbC#d;>e}_S3oC6>X?99H81%llKemD9RZO9j!jI06-AfgVJ`tvT!&*
z9Crtp)0I3%+7fzG*Nx&MGZfULcSdLwEnUDwYk9o-45WA}T5m*xV;Z@%D#8o3SMGPa
zdPv(>7}K^jsO@>95~T~U;d(h~<sL82NgkuKdlPC`tJ?6_Ws)0dhrFp&s1P`fMhWfc
zRislRcEw;vw?QgWGg*UxcsA;uW1tTuFkGY<bq4Q>2ZXfUL6#@?voY#^>0m?)u8(-?
z39-cF(6;(^&Kc5r({43)caH(4m*`k0JNS}fGGF5uQSIIEIpVDfTdKDS0RF1<GR&Z2
zuS{+TQ4QCK0axRK4VzdXGrHKcIp`0@<)g+vSI7S+L6#E6<78Qru10Rdh1##>S6bDa
z)>AteV!@rmgM-%2iMZxgz9YSSv=M&)yw!P*chUzhqfG?pbMyvE`XEpiXoi8drF5Kn
zhy?P;%Vd;H((Vq!z3Mg&sR!fN7@AxlXr*15O;S3h4d=`y6pajo8+5)>8(16r1HAfq
z`xiONiV4uS+S2yJhg%Pq>KMcNv0B5b;~Ncn@Bw^1wZ4z>w;bjAeo*>TXSw{WH<mC_
z2L6)eUgYfm?8AH3u}t7pqm^OYRkQozM>9p9!ib!z$H&nayF@ktzdnt|beQ=ejM4oH
z<MU@KYL_Jkk!4S&NC3zzYX;AVm%T_Rnv(X;W<pjc-5iNKu&<?d4GzT%q!gGl3H42O
zQ(C`ADUisNOJ?B&@$)I>*y2MP{6npq{2ZeTS2y!?BG#S&nmJ7#J3TB!bj~s~7{VoT
zD?6NJiCEmd>t4D^%eSAZ!^It6RVUW|_2d5H<~_}(uy7b^)p-Rg{f2HoEToO{7-fs8
zcx>j$pudW`*vXKRez7$1K4)pd3ko0J1rBZTc+^vWH#qJ6Pl<?KV~5NF9e&&(x3p<a
zVFssW*PNPNLvMn+#)bis^IG0G)x4th6*)i3<W(6dUoF-~c@Fd%Hs!nWtEyPNG%1_8
zG$4OmTD;rTcW7V%z~e0Eauw<`ANrphgjO^nmu<_W)P-V+3&PKRB15(kJa<eq8l-5+
zqwJkTrxaQQWX&D)ict*WMdi`);Y+fjV~slA3zyOfQ_42$a#PoVT|Scxl(WGwyhdJF
z{W3d)ANy#2JcpcF@u2T3f(_kZi0+XIkReJ9f)ItyP}c!8c{HE3;&!Y==Rh)mZxdKT
zTVi(=?I)OfRNyEY5xOm(IIwdkYXr-&j{bQQjP5P^{m952n##^)8p{v{IKqG*m1Q?;
zcPZBS6`Yy_j7eN#_#WXvV)aXFk1%8{NAAS<XN0ecfyS7I<1Eip#Xw77O__Wn!qbvW
zWQ^03-@ao!liQ~lBC18M@n`t_GR$n<hMc8JFY~RqTACwj&_Uo@3V7nVVaFNZmUf?%
z^n7Aoi7O7M{1+N$c+)<v7!q>!En4U20Qj3`+pWDFV&AVZMf-qu`VUU~w<<(%!0~33
zeppOy8OIoYKP+=Rwq*vbjF|#b#5UuN+p{EeV@JTt!;qU|6{q)lHTTT@#cTO=<VXb6
ziXP3VJHD(*DH=ZgBjSbiyuP|orD7~0lO3K|Sk4(tp?Bzo&xN3Dz<bI3>mIhg;%lXT
zH;>KCLaK)uhn~xXEPeo*oj;TA^Qh;tAlKIcc%t||#>E)<+MK-MBPc2n8}tj<6n2B-
zqNg!D%FeXr$FPb}A<WWTm+xA5(t0EVo*hg_4|9>xaJ4V82s6}cKWrb42BkaQyi(ig
z=^68ex;)=I`eD0)|8$_qgZ-Zxq-6XI9pjf%D|UpIx6${hr0OL~E+iE(#GET}-^D&p
zse_^J9d%9zo2pdiEUw2H`+6H{xUqdhdYZVupn}G&ZZ2{#ko4XU<ngP*>`@SYL>2`>
zCHdJLlYR%>(QSZ3cQ~#st-zYA7nW(IE-M10(PQ?lYm#kjD%k9!M~gN*Lk*?TffwK}
zqlo%)${qKpEiHvbVXmU-`7AY&b-+-yO1ZaTlV{UzSO}aiS<PPc=}2kn5s9>rK}78l
zCnjbB=XYr)_$e%SAxU))1$PE>r7H{Ra-S2wDv9(+qcrOgTxy5gFtzn9q-w$+%J%O*
zmhFncAWL2zjLn1(vmV~cqhn(Ak@3gy<m!w7MrqyVM<0Jlj=i)e=ds7(y*Zmk(sl%h
zn_}H_SO{mdv?L*%_t+wlxSHK=GA>;^&Sz9thzB)mt)k_T34hJuf%-j8rkfBqCG4xG
z`0j-@biTlFa$Ht_l@(X`sYsO<pj$k$g|(BFk`jJGDoRTU>#%MJF?au0u7$FPv5a9l
zT2fdc_9(Cv{=UnLjFRi*DyXAg%pAjv;NhvU)4F8l<tt&#EG)lE4VF*V@O~va4;Y+Z
z!ziTECgg4&yC{~9>j8@pvgn1<wcIuf0Z221Jv3!V6TmU6XOW%fs-nfCE@(VbZ9B5q
z*th+`Z(n=#+s^Q3ASs>;6<E3m1`6f>Ga+Aio-cYQS({AwbhNzrdr;ZYbczf)-wraH
zo=N33_oC4YIgR5CU+i{3G(Bpyjyng<*DaqX2HqZhp3wA<EM|O=F}5`#0h*%1CC1E0
zX=xjq`Rum!>=>frZ($ev-%KWEOly1gy#CZgWai}F9PIt*V=4|$i~qRI)c#t!KLx78
z;>6O-(X3Y>YZ&8X=dYJ<dvGZJ;0QCHJ&iU?EXw%j^<SX#<-adK_Frt!i+`?LZ!EwV
zbT9Kgs!_MDFPVjAFVkAxP$tVS&=?oVTC{gWs+4FPrxUi@&9h-b=2)Bw2Lm$4lRR0&
z+rGUcy!*tvdo=T{K^xukBqs@d>CsZXK{s^in2eF90Kh3-4W3>`KmW2u_RSy!Qg>)+
z{OdF)@5nrX4q`EH2I)H+Y3pLLnubd8q$d&c$K(vAtdQxF3N|f;X>qKHd4`rzqir{=
ztcEQDuCI7p-(rn@SY1~`^~(7KF>?9Qay|OHy-rI%-^qV@1fp&92(=!MNXW$=WGC<f
z?4zNZH%?AhlzhNA%y^U-Xi1D1btk=?lhf*bMQH;Qf6=2R-GeF!g6i{$Dgo9JP3WM_
zWBcTIzjg4-V|}RO=!6t|M<nzLla>PuHc#U&9fw{|4tjdvpwXIP+7SGs16zIlEc7YG
zf19M)4Tpc56aQ^%`{6gG_;1@=U*o_2E+35Rk1Ni}*(4DhO4IRhHJhXyV|DNTVHBU{
zMD)lzA01I7VpmR9CFoh%kGtd}1BU>{zmn)@R2FlD;)U>ZnA}&v$0)Kpd*=62^q`@H
z0NJQJq0GmlF-O-z0?T1Sqh9hp?V?-D3(QnA!c#|rm{Eq9N$(WqL7j55oK!iZR;<zE
zU?dJ0juky<IF$<x8Y>;|KBstTFmi4w9jy+NVK%wMw%Fe%M@vVH&z~zdpC)z|Wv9R5
z1%rl;8zc>n?W~tSqPSt$^CRw`4e<!<9P5k*^GJ;;bKVunVDO02i<7YpXBUXFem_qN
z?Q=vHQ1Kwo99t4}KZ>K}E=F^K)mWARNrD;)#t%ol;KT?f*-Iv}s+i$^N|q?9zA_@B
zwNydR04_KuG6jWN|C%OfYRYRN;IVTBs`0Bf)eKf|@KY75@H>fBc$A{~V|0+gbkC;%
zhbQCiNdE}NDy(elYuv-HaSy4fuW=8*#y$KR_wZ}n!x?c8!+{THM+VgK{bt4)T*4FF
zZfgk$%D{cnopiS!c#kqTvd-LRbRbPAeBk{V$8z+X{h*OqbYtgN)gcg&b2hsuZy+&R
zC&nP3b}>=PeRMRLiW#<Cgo$tr^WzTRB8yZ*-eN_Y9dfD{Tb8!2y(X*A05;6Ut&Iz`
zugH5j9FAxN<G*Z>YGS31Z5geaTPn+=drzZ*%H}1a@`mv}|D5R^11qIxH*;R3wCm-e
zS=3icBYr|veJ%Ssg+@UO<Ybgh&(4)|JMqa>0##oaG~bvQ180m^uQ)2d-+O+yp9@1|
zEblW@3{~h%rn8<~vA_u2unol%V3`Gqp7zKehE~4~rujKZH<uO=KvqP)n<Wvl>>iH?
zz*tefOlzS>YKfHyvyRVXxpUtMP!E$j^~U+;fKne$>K<g+poz7Blw}ea?&(A%2GrZ(
z*x;1Ul~uk4By+9I`vrT{gV;NS9U(BXv9RGjqJ8H*Loj=fXiEHy9fQmVCcp^?I$E9(
zlv=loaY<iHm{F7sz^dO9`m)?*@hsKlEu`z7Pe<=)@2T?t1OMZRtw*2We>kZTq9yM0
zG&Aw$-p3Of)ThU{I9~#QXm6Ajm`9aCrMEfkVskOKf&|K1oY3xJB37}lNX7iAns`TT
zJW)8;90#$OEI`0Nmw02om@AWRRXr&v0-M?p9I2{LOH>m|-PjOng!5YKj~%K*&lp6&
z<|@LYsi;*b1|B-U9Cd9|=TIBZo<@OMel(_jpEr15V7hPQ>N|a`UBeQi%qy-h<jh6L
ztbv*96^H5x1V8VD!Zlp{d{S4oxSeLK(n18EiigNO4yl^h_fd7?1N0A~_&CxKy_ccZ
zg191=tbd0dAIY{35przXCF5$T8ukO1ge%ZF55AJ`1;{r7O78(o%oMHk$3Fe$H7QY{
zJ{rgN$JNxy+z<w+(rnru?dUiT3s7`K+_$7BV444Tuf)hxGHrw>xtfhwQA#;V(+Tu5
zxFnT<3a4tKNGKMBm8jACG)8UheirwR)2v2!lGB`fb$i67C?b-6oa_EcI}tm*uokl+
zfs6*1q+DWNNINXzxmBWM2&gNcMjmG-KcTSuz+!oACYx;8MA4*(OqS%td|zVVx#^fL
z77=q*;E2y7*Eq?=$+bL*-=nsYL?k0wAj}a%m0Ur;iFv*yn@${bg^uDBvn<Mo6!Tj&
zRtc#@0Vw~PCV4@Ma3IcI*L5-2Yjh8XLnAA_^5q)mHO~X%oE&G_@C919JMSAL-mF$k
zwqBavB*Ew{h>Q|P(##i^ae&JzlGGza{vqld^Gt<N<x#HCjRes%ZZj_&7?1^ntOGi4
z&YU?6p58hpD7}0VkIs_PWZlJUMA|aegPi6f@%bkk2p6#RGYoF8B9XD5Fs!n^7Eoa#
zFcuz7l7a!t{3LQTPqAXLSG}P)Q`0x)idZh#$YZ|=3`>u*WEiRjO)=VcFnUqMUcd@2
z=MiZ+(c>I&TD*-8pTBv*84YLyq-SRo70}opFmWs{+%Ok147@mqaUMLLCw{AN^m|Vp
zaZ#6xlxCh)VoTlhR8_>|OU+BH*BPY4v>>k%-wV($nP;7TJb^uH816`qFW9WvzOH$V
z6QjsDn#1YSLmU)JqA&Hvan2VS)aaViRHXLsrK)|AEMwpzVf<1-VXE4Yu#Hr<!6p6H
zOe6uaN(u%J2*Xf|4grukv`l^U%7xoot!gfW*7&KgxfTQNsCD>5>-fd~;oC~1YA@zU
zFyO<eFp^qVA4F!L_|GiYXwk!Y^!#4MexKD6gRdlZ(b%4NUQ+6{F=l^z_-21s{CPEm
zFly!Q;hPf|4rS<kvT5?(s5{v&4ZR^?a%0C?I<`tk_|)82wUyD!R=By;KA?-E-=8O(
zAp<f`6X%ce50cJss3GYLMshfvL?oL<HoMCA=14LaAbhdj;G-Ux<Lqn%6duN}4t<$~
z1Oz1yM7jfvInMxI<zY}*45A)Oe?s6iZBc-8_*V{RAn}Yt!XcJ*g+s*{HtYwkaHy8f
zdGJ*@3<!r9s9hp<j7WxJsl>=Hu{j8h?MIBZ?6)EwkPvbmA2=_vaW1ux*}RaPI#{@S
zu1sC{l#5i>S4%#{wXy{pB`>WI(KT8%eg1l)D`QNFP~bm8&4Wb5lU)6C>Z#S^Oga^6
zM>F%I<O1nGFO$a_Dc7-H-W?>d&+J>eCU~2R=?^TJ*xE#g6z!P;?M@OCMRz))Wz&m@
zT&^UN;Z<qxwzVR4S&InEl(#z0bIBv47U{(#Nt^{j?eB`NX5a1@aRZ~a@UqoCpg*Y+
zUOdxiui7&__pT=>n6bJn3Dm4|tm)<G@;Qg$G!SrlFizH=!brgds+A%yNMVuW-AOtw
zvITVAI?IrpHp)&)8@g$mv6QW>#_1T-n<#u30v`&fplzuMy>cTViE;$9FTl}d5;N$i
zN1|!TMytIve+L7O&&bN8hCeB%iqz%6P8_6sP0YZ2^$87`kGuty31Y(W7UzQ?hWXQR
zh36=WOYnQW;YP6@Clj(p(nnV|mbg<Cd%ABjf}tsUg!fc9QQlJx7Lo0=PRf>z;O?2F
z>ABHv>hY;vuh3Zcu72m>T{_@1o!47jYtfy<dA5Rv;(cR;-OCsZP>zsPLJq(-)}Av)
zxq#-4tSaHP;uwlC$(@uc$(F4FA`>`>;%=g$hwDP!DOMvDEFg@8A7_*70x;k_yGY(c
zn-l^JQF~%{IG!ZJWI1gi{{^pBlMiWL*lXsRPy$(oJ}t$dLTb_S<fgrzQVXInmeO=7
zD!`fnpRT*1EMH*mo`xV=#rT9ymm*6##IoNjkxEUCEZk8c4%bB;zkpcu$sX@p2TC}s
z2CXZOc6q!^AX$b{EgPo-GKbZJ54v?(D67X|%_?B!z%LrEX~R6=1XiOoe}nBC<wkGI
z+e)x)RDcaPw&HcXMMWmsg<Rb20*!#JXC<`3PjIW+6EvNRKVJX_j%cRzM~c_f+zPu?
z>*u$hM&1%>d6+LQbr=0!V|-85!=+hOKNc5S5zSDV(Ah213{RxAOHvE_sSHTjKVc(Y
z6@N~B$Szz?yoN3IVtrmI03eZ-)1({Yt%0rN;wFe2s!EwcWF81j0X#=OP*G?}d*Zi4
zPESZqNO!2DDT-SmLKjXXtaA|{mow8{N0LXlmi0RZP4#Nud+Hn*f-8E7eHq(hQ5`(H
zDSM(9y~UOPU+!u{U2DiKPT*SO%2&R<c{&9K_#bu8+xrXY5zHAkPmA!P=Up)O-0S6@
zce&hiua<jXbq9-FESv4>=6cYV%02H&8BY(qQ0_f06CD30+2RY5;kdZ0X^D7ZNyIn+
zB@ugKs~(=_l^wxOQ?VJwM@lG@I02gD&u14G;l<7UDvmwm8HDLtqtgub0gw*iFNrTs
zwSQC2{IEhC+|TUc5-X7dFIGHhUB>x_@N-A1UeWrL@$_j#_O~_lz~aN){8TvP)zcUy
zAIrfAbH_}JY?Um9BIM&Qqh-S2WuBzqFNuNAP5Ml}WY>v^h%^vw876QHV}fREc1RnZ
zfrag-MD9eYGu|l-e@?Y2VsU>;k>P>V0B?(a2+0Q!I)QNms!H&tc<{hA0EiFUOyq2@
zDspY6ln^*~D4||l#Fuo5Je+pVQAwV|Y}hx89|JkZc1S`-8)S4P!^raFwG4#_LIZ%w
zfOCAUu|SK_?0JfOdGi6OeoBHm_K3)&Zf3Dn%nOyvY>64s?iv_h87;VTY288^Sji>;
zwT(7i3RU>{q6IT59z+HvD7P(}ku`ecW>^m!gHUq|?6>GudWO>E0PtpDy!U2Q(F<<7
zzMR{wn4OEfAe7K=*qO|{2edm+24igR47U?2IY@~@E-fm=o3<2ak|Aq^(b`CRqm>sd
zNevMb08a+*<j9jNXLjLx6fLbhq36&3Ir-;kiH~T_6;Tt<q3#YAF*}*EUVsRkevo8q
z)P&=A-38SAd1Lci%h|eX3<>EiMFZewxKNj+ij8}N!6sYx*RbHd4dsX3C9{f+26y+^
zG=(+q-Q(y2ljVvRBY7brt2)fFT%)U^d93@kgYv6uUGXqv*@tR1kNY|`nh)FmW5M>x
zIKCWYac?%D#rxc)nPu<yvMGvUuI(6Pme>_o%*OKnS#Id4GNpMN1p{7UM;5>oEv~F)
zm0hCQHa2I%R*mx>F4m?C<=D#R2NJ`S-1|NQ!28e;{-;4~njbg_JV5l>+Wf^+Y9S&I
z3?dI0Wevh&HHEGNx@{e}Qb1_68&qpxA8=~+y=;n-oSyoE_*F6cU209wT^jE>6Yse@
z*O__G%)BQm02N@OXHC3E6JNTsw(-r`Qlqy30H}6P0pO2z{FYD2|34qclXru3l&qcK
zR3Eeb|JNTpc<B58Z?A7{eD(kTJwB9{P_H;J08z8Ov$q$u)x#Xl>KKzwBd>AuuGzk4
zc5MfpsW&#znfk$OU+Vu$j?`;kov6P$QO|Xv{_2AK)dl&h3v$Q>`EO}|)JytNr_%;x
z`hFjv(|M)S8@f-CX=_F~Y7bGIr;7kdl#F))eG<Z>r94JuX3h+n1i7O}!h+fS-ebd*
ztqkJR1bvbo-_q4oSO23WEa0EcigP1zQ6(>8F?Y5i<9KX$I>cm~!}tStqo!#ld2rZy
zvEO{zwo*WvmoN5U>uhNK-wS0V3S>QwFpipzX!4$A)N&L1hc7$rohIz4P0r1RqVib`
z%;NbFwe{UtiMKuoRyYrkKA79`f&u{oOG(Ox+<)8b_1Xl6TB$ww)^OIMVXuQ~5%qcH
zK0}Q`4RTymg^w}m)Z~~9O7I0o@i7sK-GPv{JiEyG8way#s1>)9#{_#>u!C+km<~s|
z-<xXq*5A+$p^ppWAU>|gAI+$Jp-+kbkF);o8vko^YvY^k?Na=&jR#-(|KH<te|BJ`
zufdGI^5Hkhheuz78GV%`zDg4ROC^bN#31wR)Q?9b0gCL%M(Noo9=M^6`rT3CJ<2ch
z`)H9+ev0vG^T1=gk1IWe!-?p7`OQU~1{%iz$U}V0d@=AzatX`^2<`Nv%ZfvR9ZY_6
zl)|9Yn|b%(*HE8DO<0Xd!q<k%|I{&QHn+9zaR@UrwzE3;r!?VM+R|-v7fygF+G){E
z`8o3Sxj1l=NnYH2cShl)k@lj63=4?jzswhTFjTs;R3^m<Tae*JJM}>qeVh}u8>3eq
zId3DAAa<k5wuN15$-0ehkHrLS`FwhoENdfEI_S~rC>~tImw9wfX<B<|3xn2V-E2DO
z;gzq1q^yx+dNPDz;E3V;8OJzDU?mRQe3{7spoerb{5~7VsY^#ES|ZB4UeGy4(~t9v
zE}3z3u|9-p;K1JSy*>SsJ9Yq3=lE?0Z7az(t<&E7M@u3u-Kg%B_pAu0;a+PS>zfZ&
z<e$1oy&LP%>*shV%CNB++<2%&P$}cG{^Ww+{*QaXLYGjS_Z9_9OZvwfncygX0a4v*
z@o~WL1DhiJ%3wJ|+o3O}9BieWjsPR$0c=>Z;lk?qxw2SZLz{U3cEKUjg_J@69ci=!
zjdpnbB9JiSfik-y+y2Z6FRL!F`)HwT`V}S$c26=G7)t@@<e2+VL6<Ne5>XC2#Mi75
z8KYXnG;wU1Q$^+Qn>o{`)F3-H)#S1ZpR|(#ErDK>mD=o%8Xs|;ya+E&2w1Y8l900H
zWh6kknB+su5Mcor4)Fj9-O6BO2EB*w7=!e205@p}WGHpZK=Fbyc+Q;L-9cKn&3<cx
zk-+RA`B2pGwPROqZIKoJ^HdM^2UNyD19o<59M-+3yyaG(A#w$x`d}#q-qw4BC=<Mi
z_E*W#j>2|2>B49Y!R}=irDkt5n&}!+YN|U<lP<I77;Fp|Nd<4l$I2Elv*a(3Tn1!K
zLrbZhVz^^?o02gmJHSX8)T_Z3A|D86d+cB(x>?<YUUy+0wK$=f?qdq`m1Lj{<&=FZ
zu=4NO!XBRw<NRGUYLwRGvEu+@%n$IXSimL&*CMvxbAPM;-KR7TL9syQEsZ<m*)Vte
zs%jdKM$zBlpVeo4qyETpnF<gQbS~`V?10n3#f*OYExJu@`9|e&vI`WYNYDm{psv~h
zxLYlv`%{O<iBrdH0<_xmGG8}aowvt(CnzNZ(;SEV0w`Oj*%a)@=8oDj5n)67&mXGv
zNZu2s^MD71?)!;l8sZj{upqT^n`jrL-2kk9Lhb<8s0a?LPd$9~3ek~yFI1=+wrt*l
zcnN5LTW1bU)D-NK&?K?rvguEm%r_$9-PkA$4`n%l^dVk-U~>C4&pQj)ESJVxmPIxZ
zkUh5_FSzA`Bs{$Jtc~vZfaowPDuBuva;vEH#^4peN(eB}niczKL<L&1j>TinEbWS^
z#V&P7sM&EMElO@r!R_rr3HevHf2r9x!|`=smiEI(#*@MBMVf$qXrd?9QLk8D;m&#P
z{i)D<f4`~l2WDSbc-g>Id#bB)j0zir0pX=!WjUJ9>Wp&v%vLCTOvQUUE{3xj0wd+h
zCcr^?NEV;s%aD*1k67tOMam8@0NK%W$Y^Tiz}54E)%-Z5R%>F%#Hj0MOtgXVG%Oud
z)1Ie(KoHzk&0Y^T+6e}lnN2o$K;GyvA5V5B@)8R4xM$ehmdtQLDgh8}tgma)3YdD7
z>rxQfF5P8XVP6Q=j*@aYo{VhAL-o<1RHT9K9v423)$-PAx}ke;&fkePl;>a|>I&a@
zq1o)yC{R&q!v5Re@4RguAE1Kg(VT;I#s^wCI6T?gX$26SrU_85(Rdn5&y9qSWLq(N
zfJcv_JA)~Rg-hXcGsvdb?;G*bM?XJ;j1_Z=jr&n*L&ZZvTyBW5Rfh`mnU=>fH_btg
zQ3)W#$MHJ7J(EAO;vL1wOAvq*JCt9IAF|y?Ey*BZDJ#TeMOS8BES{<n=AhY|)jO$;
zi>j=0O|pnwl8;1|%Y8puUX#*@ai7l{@-AduI&10sJ<3cLNBOymXh-`Ftp%8zkxv~+
zD|oKu=&5Hp8PcT+6}w2qCk3|!J1(-%j^eVcT5KGvg4lTo$fmolOU(kJqH2z<%>RT^
zV%ShxVYSVw&f}3mg1S1BdmFPFN?3{+ot5e_Ez~}k%B9KvSn2V?gaSXjE;G1VM_Q)R
zi#R7;^`n%sM4`&@EN`qIH-rN)hEsN296|4W<<*iamJ7D7;<M5bO8jRN($S70ieB=Z
zBGuq~ld3N3zraTJMn_WG(X9v=Pt)v(spEfTr}<(3<Z_(UptTNi4KLb19qiO8Oq_OW
zD&h%8!7;~40rD`b40PZKj(}W`;<FfiZ~{cd3*%8E1>ne0AYqw0d-h~<<)~+<B#4d~
zhlE{r=>p782r|BeIkJq;lleX!4049}i{rPRHU-v#q7dY|yLV8Wg%tE<AzJL}_bAv;
zT)^IWtWLax%x?Ve0(Lh_CKDYhz!_!%;5)DO_IEocKOMDjC0yB4Ms7FUi16BjG?qLI
z7`l-g3@@M=hQ<;$fkN73I-=Mtwk$_&AY0J0c!C-V7WK#(?l@H>1!sZ)s`>95?Y)<8
z+Q%D&M{crlCZjlVC|6tEz^t_lKMKzP<tsY-q~JhGR{NyW_Z)OdQo80~;N<apD+5AU
zacjiH;{+xAlVmuiNWm3DLTibFa00f7(Xs|k6y$$9Xt#ogkRpi~cM9*DDEdrp^v`=o
zJJD%UTqL4+D=spHq3#r{+bWIUJM2iQwRRLQAiqc@rzl>jFR?I6_c)hm^#>e){cM!c
zB{zC61HDDg-Gp)2IXrl=_Yzr(VLY<7CGuQmpEz5D!O?`lPYPF!6|>tMlAXgBF9dqz
z@NAlT!MZlfkH-qPZnf6$)ytXfolPLTcVp=V8o*$b6r#5_<>B1);neiym`GOV*iwg0
z;G(DY8zJQ#R`dp{4nY3r`lceL;YGOHh~LGv_9k4u2Ow8sg<m$TlL1IpNw3p8ttdc?
zq1U1kk#j(!-gIEgj3E+f;&_pFvDJ`?NZ>vUdNp4WnE`QqTt@u93Ni~lpA;3y%x;7i
zy`Nt<e>`fQyrRslw39_ma*<8mv0ct28pp*s?Pz9}hp>V1cG8>#DEucE==x2+={o=-
zgRY&W#;gMIFliiuXmEJ2|I=@9Rv#U;4tC+o&T*@G(pcYq@W6p<)qZ>G?>FM>xMP3&
zur>~6i!oTvk^;Wf;J=2MyDjtwH=D!lEs4z#1<EBOAPNYgcA&XKMgY*`CAU5=EZ;yA
zH*qJAYG{l`T}P7)Bt!)KoxILl*{L3asLPGwO#jY*9z{#j(YsN0G4fjpQU^W`h`rk3
zr1xg)B81Q5yh*AJ+8;+u&4F3M@X(9!0ztA9+LRkUmGP+`Li!@k1^7LJx{mFo_)V>}
zG8~_d2euY9N4#F<B{pbALD?_ytfP&qvRSSzRZ&tMo?8Z?ql;Pm2}QV4RtHQ1C`wiz
z+2@|ERpqW@bv^t@-!qc|K|De=!YQg7IR3ZTA*6-qHXQ}6%~=>U)pwh!WSFIUI%^p}
zdx0$Ah?lQfk2T=gGd77hbyYxkn@#|tD0Q0o13X__@&v^hblu>#n!PmSp4&$KRHMV0
zc7_iGKG=u?c>@T8XHgnbOgNBt?1Mnf*+OUv3t`!14ze>gCLm2^I_hWmg4aQ!3Hi_}
zZ+-(L&APrt<CBTRSCexL@e;>{IS?)kOK)q$V49~1sd4ZwPpQKkQy=S|2Aac=3Z5iT
zI_2Ls_f9&;Ez~u&N(b_MuEb|L>~oCwGci>h>w=CyGK$TjU$ax%%VZ~%o{b2?1&1cg
zc$blm&^aZENk}tcv~U_z@e+xPY?yXmCeBgk7i|O^unxe`>mbH1aL6%^;SttwCaD?C
zAWUq0;yJbF%xR}{_`Mt0%)lM#M=F8MNj^=k2y^$wnb1Mbnk&L)COEL&z<!$DbA%HQ
z*i!K0PsZAaj*^QB?v063GV_MYFVSsh;A|miWkNAdER`qOcV!b%M(b+83gsMwV=^5V
zsJYxL#58S?W$%zhKp`}eq!HXSCq{8vkIsN080lhU;H+%#G9+B2K;!^dk93L@7>&x;
z!d6N=m7JSy*ykwFgw?Ds!6vmCxkT&4<Mabr(UGnBI}GuHQW3i7Mz18&BmgfKT@;4p
z$pBa*ghP=GRr(hSL4$e%iSIc<za+NWl4v0VL^gy>&KMvu;qr8l%4GlpUoQ|UpJk3R
zl@Xl91)6R#O6$2u5&#PFO4qPzUU=*3Ym{vz@?v2u0-*u{z**sh4z$$6-d%A>NgJuG
zC3R2PYb+1uMYP{LIDw6aR`%&=ngq`wYm9%le>`#&vevDpT!WVNuoS93^ulVj^j<~J
z^9S>|bX!qk=|!odPBF31Y;!mw-Xs_eEuHxBeCha4`ixuS!KG{?QUMX7HB<mN);nT|
z)A-VQuYw(-J>VIoUFXJA<i!d%khj`_e4PcjJthKcOm1~b6(YyH-6_hFpO)SV!%9(K
zIUbS{Qf;G2+B-5sHK6i1SpTZv*3@jvGSurP%Q{B6a;15zglj&R#@Qh4URv>{mgxpJ
zPrA!ELA0aoB?Ez*1j7^FT}VkzsW>n^x+sLt$VQE00(y4Gtle!$v?&U-hS!DgL&)Vm
zVE6~wJezfGXhxLL1m3e+<XOa{OIX`AYkq02FRO?m!!n$bdO5bZYqG<L@sdhM89b$t
z&_toXX1jSLfpf`~baKg=Jh>f}IERj}ok=!=$*a{<3!(@s0F4&Jg7k(EGe(9<au!c|
z6f0Wv<7SpLB%G+@vr1eYvUB9K3WxLIap$;s(u%g$BZ^LjR5RDAMWUoRG5}}lDxLjD
z0}42znK;}k%4pnsiA70A9erP+6-C3G)S&1A3^lr!R#YH~+3M+uN>}cvXCYQS?c3sD
zPwDcK_kzpT8shFnt&+v18SC@$1P<41n)C6d?>{=|4f0dFwL>RfL*LBUO>|i|Wx_PO
zeNskV>K9L27%%FsoCZ*3Dr+qos9f!C?oWC^CS`<Jh0Ev6!j3A9cJEN5dv43P3T+WF
zRfseDNbyyeN;~8M!AloZrTDyEsrjsEK}i&t^(ZKNc-3y#0>~A(^QxBuLZ4-L5=<_+
zUF!f0rP2x8E`GAGbs?}B%kBk7{rIXqp!Vptvn^$lyk&1bWSsbTb!a=K04vc<qyaW^
zNy0RJDamBrzKFaaRMSKdPX!-48NHFNQ*cu>JU};1rbK0Q^xzcYf^5hjc6Y{EUW{Rb
z^wj-Ig_#at%&83@>2S4JnG%AzX9BYtrB*PeqON0|fp{c%_k8we{;0!J_AIm{q-6ZH
z0HgQR>ikZhM4J_mdW*c)#Mn5ZT7oh-!b-}uNhYS??E6Cz=_$r;8DId<5nW=*x@)<C
zQ7U`479GjRgn0>pFgShZ7e?sSMkjsZzb2T-j}PoK#Vh8Dm1I2;PR;EM7!N$5tr3?7
zWPz6OK9QT~d-rCju+%MV6HA^0dw_UoGy)WQ`5kkuEKqT}2z+rm%`g96Un9P`tc%p4
z`h&})^hV-Ui~x2(iN73NKFBVB23(BTi`Nmp%POmjn1wXC=_kjt(b+)DY9wrf@QLy-
z96D#y7{uR#Y#&LHp%hly+*QPBWcOK=^rc@CUeP5i8lPY0DIA34=%X5XD|fqT&TJUo
z?ZWx$S|0F~z-fZ*p(+!GvnQz!F$McO)tF}fFifd%6Gqv0agIUPrLkNoRS~{pikAtb
z>U03Iuxbq{9m>*V>4A@eGz*xWWGty61ALFYDW_Dnq6t_1BWx9!YrF;mRb-QzJd=W!
zJgUWEN0HZXN7ASm-($PK)~FZm&BdN>Jf@(t%KM~XnT7SNvWY}cdZeJKFaB8M&<s3#
z6slVS!t{oUIe_RHzh_f`bkNhtN4GD+yQ^kd+lw3B4>iD9A`QkRI-3dUB6?gH^${d^
zkyAWgOsHg<63Ipf@K+5<yj`60*(4rQDyaLwWfJ`G$9OtHW4+u}#mzVv1?D<z%wGS1
zjP7eouw1JI&{csHhaO&PxXWanAr-e&SM82ry-M(}=<SLP0yRuZE!|qMx?RyiOdT89
zRt#or)IpE*aVcj!Moj`aYoMYqhcxU}r~A6a+y$-g=2HTR>8@octr#Uiu7iqP$BvuA
z=forP!sZb7DWR9heweBzVF?ri^pLA)r7&5=yagDL&=@ftNmbjWt06sl&xo*M@|7&q
zCwK0dIY4>YS*gf89A+Ug_dMiuU7D+H2kBm!s}eHw5PKC?lT!u;Tm4(MODXeK(X8ue
zw?AK-u535yZ>24FNIbgM^xBpkF`H&tQ(X$qEbv)!fuh&p>74=E!!6zpdypqRs#vc8
zZQxVWfqCoN&+8g>XCABS^XXOz?EPXg9ie-PcWPJ3-2sy*ySW*wh@ap}MoT-y=%I#T
zl5l!#Yi;K&!II98#DeLn*88qS5>W>E(+M1s`TWKTWRoS-J7R^={UiNJ#gYd|)%;;8
z!17L8U{|@KM{uLy$7CKiYggxlBnidcVHp~a98FY;EF?v(ZiwWf8CHGm5{>afAD9tQ
z1{vxRl%y;!aJF^!Y|7C(IBXy7R1w)%<i{MMvsctYHTT~(e`<%aB`FCGY4&@{@Li$F
z<|YjI_<q0_`qZtvTn1Ri7NXbXXmvWhL5-4Ch-%-lLE-kWZeDNb8wX{XDy!2wmEof;
zO2*kQV)PJGR~>$PoT#0HD*=aPLN<|A94Rd@MnM;imY}t>gp#6UrySACZ%vI`6yE?a
zwnRXQlddu-Xq979?4pHF;dh+1pndKiuzG=v&}$ZHnInEIuSKm7bTX{1m5eNKI5j(y
zWpLk-jj%NgywOy$1xldrRqzk9Rg_JSXy<)k;r3K{!r8hB?^$3EkLd_gu*@aKL2md5
zza?{VDLP_GA|=i*WgySE11CEZf8HmPl*ubbS2VFSm}Fd#6P=<JVpS#B>8rX{s5I<z
zPU3;FGSMxSk<O5^&3Z6}m!>cQ=WcIuj+!`l&!{V@T&JFlst;l($0=b)NUh7HV_9x*
zNM(R{ug?zDx&!K!vxSAs*4ms|3Pn0~N3}M~1_OkPLX015Rq5gPTwsPph63%CtuhR}
zXIZV_XUX5Md}W_w&>Y|~_;|+Cip#L7&flU7+iqBZ^@XTvoKWK1ak7dGf~^9ROqoc`
zC=+KgLfzjQ`7jUT59x3^L{*rw8`dkZf;4ax>rf^S-eJhusaysk6~S=om<5y?H*Rh5
z<TM3JJh`kpvU<f`);)L}zxRA;S;Tu1Jy>6N_K8j|7c`u%%+4Du?ZLKeYRyY<OW%$>
zQb67%Wtk`^`#=m<nQ5aZz`3m|`!sWfd70#fq8J7G3hQD3&JwT$6Z4dAgR88MM#}Ih
z8!3}l)SXo+EA*_D##qhgNc5N1wT2U+Akg(f{0ODr(oP8o4Ze`2s8xMDXyhUsISjtg
zc5L_X*43s4q(eX`4U-}+<v^XU<&!b(C&hBEZfDLCNhGCA1SQrZ@Ea$YQQ7iq${vFo
z${y9cbDNk3(E{T+O*h<p@+w~oyE$wMAkBB5q(URcosVNV=cBk^s1&zKMn{cZy+jqS
z;uK;wM3{vc19OK#zi6^rk?wIYzCf`w3p6NHIBd;40i(?4_{(3ZbhXM<=)`#Y^3Z&p
znnx_YtY3@KJ6`i5+Uj!NRdOkt`t5m_jX_64-~T2slIy_j(={PTsUCZHC|mw2lJIVa
zZ3-yPb}yI6-0|eB3tUKc`fIeZ0zck6el1RNAsxv3SN_eFG9jlrRo3!~B(N%{$#Sw}
zNs=rafWQr#2xQ3e9;^IVFa;+eGET|l-=iY9S!=(Nt~2@-PF3s+zTLZLFKx!IEV~IR
z_Iihuny-eC`1#jg?8r=de*b6L+E@$CQ5b-1_1U<X)V)RnGoCT)`7@tYibqgAo=_c~
z8_Oz|bSKA2pEGo2j`m#){Gg(C*&@$dEraNE1Cr?;V+tI#emvSkuO(&o(qMBpv}#%w
z_3|=FQ7PZ54AS?^8ZUQ;y=4(cfJzs9nG+YPA&OeYSBWY|G5bc4Ij!#3Nros@B^ja{
zLDM8U=BhLZX+|6Ekl7pdP@0zxtHw6KF&R%J-84^)F`Q-psC=Z2%7FD)xeA6Ep8_vF
z6)}Moa5zIrT~Hzftq<dLk~9mO60o5w2YsYNQ(i_Z09r*E-X)jnt1O2OxuEls;Ynx{
z2HHYfzZh=ob^H!c0B`(6$At_#^ju`Xoa>7dHV6o8N!2m;LFevMRb9Pg^roDx8|&uM
zaVHxAtt_;qBd^X7eV<i_NGf=>8d1A-()zIx>BX}+L4XPL0h}eCM+t#b!Rxo*BIhko
z`s9OosW(rciCC?OA4r5|x$+c)#;n`B%$gIUvcdzx4|^_0-lUG`?=`11_Fso5<;~n{
z!+sl_FUWUn7+7;Ci$in_GSEB1HKNY>IVn%Z3b2pO`we^#m~1`T{DpG3Qc?~g-;8T7
zKpxZ?_;5_-fWq=K&Q{t@TMcSmDmmkpUfoo4l(PPl1SReRW9HdfR_{(qc9(+8({s*n
zbF^DoeWS3TCqcb-pR+We2o>roIG?tdUm$fM8jcs+qR=954NYnB!_=0Bk1`ZU5^0`K
zQA^ow?YDMLY~mUaw0JI_-Js>FT=GSQcfHe}w;%jsyPc|BfAmrv#q<NS{q>d_+>Lt<
z>vK;k<4P{AY~tbff41>oo&f#6GnnGvJ2@YX4%1h2La^0g?O67w-uX|EJ$4<kd4!HJ
z$CufwJ^^y2*c0!#yD#MAzNU@dIcG^>fz9HdKa|oG@L0BI!`&U0IN*~PH7gMM5zB$c
z-?B%}TVebG-oX&u(3$te037I`KH*7++4}MR(U0bcfL`3ajg~#*_$)3s)aj6GK^5y9
z(bXNp$#!PlG^h=rO6KCgu&OV6P*c)SXC&oWCf$jM=qc>156Ct_&uq)IRT6%01J-q8
z7}9WDlVg}q#%O8$VX0&bs{lnsAN&%MLhf@wY|;mk;}D%a2ty#KlJ-;a9>S!I+yfTS
z#4YZgS*fF1uxfISXR?rI@LB3|4wq9<fS#0=1+P3N=@|yBrS8sSG@(YQA||tShoi&b
zQ2{JzHSMLOVHtGD#7Y+FpfWSR$R?;UCfhI&#0pxdHE%Hpx<1GmL+$PY91qv@3>_SP
z%i@5nwnAKx`jk&t=e2WKSxx%oc>JT}0!Ens{O}jI6ZM=<WI3C|B{p=4jfxVRy2NHh
zi7orw|DcY1ztn@P9rfz7*pdIRA>DYj9dMeF%)75ztWy%*Ek=Wy3+sdLb50++vm`fu
z?O(w5kBrbtKti!hVpV$A5_I_6<<x~JyH1N^fkoxs1BmTAuNBLc8MCx=D`^3zUw>`R
z>9GI^jN7ZkskO{z)Q#SWwi31cA(WSu<x!;=8X&bmowdK0@8gwc%16VxDyHViV@$O&
z&hnIqBi%Gx_N3bB+?bzL>7Lzq9S4>>K|q@?61;acW|?q`fr$bb1^2UD07`CnR%C(P
zxB3^8PBmG}>5a9@R(NqMj1k9S0?t!kh)c+nY-Ibi$2zL8mY&@R<SJMfL7i?TbBem6
zugq8ID3uxcBPx{Z>qTkKb0Tz=!#U^`sR(QA#x-84S1gCRzTrEYFBjboZDmBwa${|)
zh<1A;bw8*`O-$|sq_;>uB;Bb)E?|3oC|DaLzM14DHDZ5j(Y|Qgo)U6ezF$n^F}f(~
z8@RDGE03jYQOU&!VA!DtZiFhYXdvcp*Q^$C?z^Y8ZbO~6-PLC)9_c&#d#!_$&fYF!
z2VFD+FF4FFC<<Skrad$v?Oy`UF6Ww5S%a3=06-&$m4#<yV(dNp*EE@2h6O$AZD*Xs
z?~H9Iydf^yd+^?GTya*NQfd25sTw}(0E&0=>CmYKBLT8#nWADQJKnD+4kXkq60?Dp
zw<qi;vaKJ2AgYWsR-B^+0hf@!Wqr*w&fX@<=Z{*mohYQ&A*F?*GOB71PCN3!uW5(D
ztiUBCKm1Wfj(J3frXz`uU6_uWgFI^}X9uez--(q@p?;<(RL;vIqg8JGXi3yfwC}2>
zdU6W$cH?usN8Taa-}^K}BHdF1)aXXpG!6dlwhn&cu+e)5FJ-N8{g?_y^rp4jIXFCM
z*@phgY}(q09JU#_hxdu&o5H~q*a=3GtEfpRqR-TXhEBQ&zQ&}W!L;Ctlq1P0?H??m
zVx6@2n?JNV?UUw7i({TVf7zBN$0v{N8kfPGDe7g11J^qH05=!rrt1vQoVo+`FrW)X
z`*R9j#1!eJ1L9CPF$<I#C%|#^{N02u>7kvEv9jUWrhY(1V0NK$t`{|v2A(!d29NPK
z#ieyK#OzMTex=@YTu}$J<nXK47+siSA$DD*SJzT`LGLdBN4QE8$VJU3z;<-aUn_2R
zgpBb8Px!7vsFAtZp?o&#aeW5K3XipNoazL(h^_@smDERpGW^QM5futiuTuc9=H;P~
zV*+K@ovM|*XRN&T<v2w<BW8OJM{JP_OcmPaxIvlW<p?u2#RX@D;fwHE@LYz9=oqoe
zDWB_XjN~^**BscIHoJG@<54)0?CgwU=Q9I9%x655;H)}OA2JA@@|44QsPJwT2Yg?z
zD8uT--hK<7;)d!|>^&VGZfT<In{2HtvF1^JYA#AMU=r;BOFkPfE6&n<Hnzw}*6();
z)RCmU&UD-<GRAQ9W#sE)V3Lq(=LO}SS{0WSMe7j+mIz_D#&SxBB7XagiVXAm&Hl+=
zs4dL~BT$&CED~2!FX|&dke`Qhw3|_ugcD&_&`ta}#t=s269ePe#yAtinGYU}J`6)b
z<rqb+BMwOy(n1H8C74MJ5kBf;RbIURNM(ctRA4qboS3iFq7aQnQl865#0-5pZiqO8
z)i7rraKpsTaO{XaSzDqEp+!+GE7A_?CYTk~5mNf(M5v5k0MQt8Gk8&N+|5rV{w{eM
zp04F$QRjO|S6SXU-b9~a-O%R{Z~d{gsG(Si`ho($o=xIO3S<RlM)BP!Kw826+qj2Y
zKel$nx)%fi4rWK#tbnJY+T+<NGQ;vDQIdET>8R4)<Vt~1nb>NIq18%8l+Y9cR(YRg
zETTnySaD5BqT}7?l&7AeY#$xBny)!)lA5&+Y(YGYMr2fJ0wzLjoO?XPK#C}B5z-)H
zTf&f<yB3_V79%0<J<R&6qXsEy&^S*}+$Y6D(QQk5hPpl++|qGtcdxzV;2uH{<fF63
zM&n@v78h~tAzn;i?w8@1UP-;iLyjo!-8UR$&b-i#C3#2eFYcOk$thpbclWUvLU+B<
zZneJev|A_I%!>j&;K+cCR9H*mVdy~fD9&>S90WFr+u}O9O;TvRcUl$oRC#zGGi7u7
zF(&bJ=(@)3SD%)QW)FBTjP^hXcNd1%aJCuQ#`R7SE05ER3j`6d!6g1RTj(xkF2^ow
zLd7-U^nAUj?hRW9f%|X*qKI!j9G+)TYdRC~ta3yWtHOv9dangN-PI1n%6wRHs4+8g
zpw!2$qkYQe9TyFKVxC?)!Gp1#Kyo-^c=fC4yp-U|T2^zlYaVI?t&PoZEzNjNnwB&8
zV?C?5Kz2Pq+Xz2Pi>d6Q#pZ_o`WH<#VqWgu<HR=WrK=@bT^-V-UjWNOr;)eLBG+;b
z7INo*&cbjlT<|q1QTE;DIoFD7Ch6`d4Ae)OW6MB`NL7HR(Uq_uj@WsFpHo20ckb{I
zFH7Yrkk}cT*q7ZV13KB?{bAwMQ04H}1dYPhm#YYYXlUXhOW7jLBLVdONwnd0WTV5r
zIy2Y_LfzXNe;v%gJDu3ly_xt5UD-I4QdC2p9t}}@rM_ZW0piD;u39xkqFq&i_i{&M
z&0rzhKbh)LJdvz4`o0hLU&)b$MG1uUgyjB8Y<gV6Azg{l3=c(X!T-;4$R{QMgkS0G
zMF~Edj&W1|y1Ehc=nII{rn!LgVqlDAbjME^-P9+D{kocu&iHXXat79wrdU#%YfOLD
zh&rdr0xDwr%P6C3y%JEEB(hp`lw6?3y}jFpV`A@M@5Hm5Q~<%z0He%&4L5)#fxQum
z5q4z~(Vr^>VEucpYxQz{^1*{z5zWiW4fNsj|LR~4dpO+nbo^!5P4jL%=|wxo`(^J^
z!x!Q<*_;Eq5M=Iclwk9_LB@4p-O*BU_6|m3jRB5QRN~Qdbv-H9-fUv)65rcU{+bS1
zZ#V+ICdbQn@@0qN@-;94Pxcz$Jyi@4KLKw8X96@|E$5LwLE8@nRSlLl!#!k<r|x}m
z=sw6+A6r1Tk%bq)euAcH{FL|{d-QfOR&?K0if&eacuoagM`DO{`zfi_9YaR^xXb#l
zX);Y-TL20pWsslMeO1(P0D0o++0~6nRwy@NR%lxQbkaiDlT`OIn4~b^U_l=%m!e&j
z)tS7(A1^dOy3)a`a&`GpHNsizCN~hlj&}wL+8U47^ae&78;UAGkYO)uGRS&=pQsMo
z`b_hZSEeZ<qKxtkALRueM)DLBehvWVCn;(wTzPR(GF8UznHivw&+aHET)hjG`p|IQ
z!3N$Xm)rmaRdUb$UUE7;+r{S<rAxXRR91{Li8aH7h>|PNO$cAzw}5*j4VFBUU}YSC
zRNt2ExiHQZaTun(9!ry=;kl2xpN1q#r>M_4c_zm?$dXE1$gyQ9C@AVxlJ5BkV~Gte
zl~TFLx*3JemZ<!Xly!rpMUo&F<Y+%qX_$H>PezPhtWa?kb90E!6+_A&Cu01qV!2t6
zU;~|)Lj-dWQ$7l;)pzluOtVc%Iwz+efW6f#&1&IJ_U;j#|IbBF+#uKW5gd&s_90&%
zsG!RjzSKl}@U?*6)k<kw1axwamR%{`vayJT`Ury}Z^k_+A~|_Dd1<Lto$WEs6Q%H+
zsmr{k3e*Wte@l3fN1COTm>7WmO7c{;jtvQ7cur9a+3iIIuE9;^CP3A4tLNxu0d^M5
zaXjRSis*3$yme0{*>&hyK$RO-4!s#kC<s#DCM8vo&$-MEyy9O25RwuY-x#Q{dY(vg
zl|@g8e$KnuxPAL}^p>IV$f7M0$;j8FlExLPlv5gn+CAZ6*bT&ms6L}RgTa)Vnq_s)
zrswu1_XxkU{pmsg1X3NtL93|k2C5@ll^R<-2oxr2mx~s~0m?jy+|wIhBUl+(XO>Q~
zD8ux#!f4Hjh~;=YIapw2yQD)>+n))NIvfXnBugecK9dWWEEC722nk$nCKi3+Gaz-c
z8z)LM%dLam8Ihr8`9_n1-W~r9K=(>Z9PD68>6Yoz7-PSiYrL$#if>l+e&>Mxbcg3-
z8-C~r)Q4WRuxS3hQ8Me3*edd>X`V&zW>VO-=%;LoT-qa41QNos2`C)lQ2!FOdq(A5
zAm@hgTf0w+<kc?TPpx8*^VQXU`XPFv=*F`(3?tke0LG4D&fboV>9|%nmgVv)EF<UC
zPtT@u$C-`kj}=4$gQZ~fL=(<ctMBz;aErA}kHlqR7#CiUsXt(Cp2NwYF1c|)vyZ*u
z%`HR;I$zF~RG6nPVoM70M}m$wIz%7}7Nnt42|xJ0_jEdVr}cmn{;AKywOf|yAIin!
zLEL2%)JdAHb+wNUEKuC*<u;a`1KlQ{wo&&|8=F9_w`}1%cqjTYybWBLC|^AIN0C#s
zNGC+%G#<XI2TtQW8H`~Ej4v^e3P-r8iR*F(#9!OPkwvs;_^dNp=+qz-m<MBsxv^+q
zNUP6a78&6mP<+(zwGMU;cL7m5dj}_u8x`}Z_B^$##H7KQfT=;FL9)Y-_wv@rc4t9w
z%xRuIGoW$Rtaepb-Bd=rp@lk%L7uB=Et#N#ny*ebDBGZg5l=1clX6L9A@6jGAdX4X
zp|r}k#57fdndgw>)wCEbHKGm5>cr+#23dG}>_cNgT(LZ?v$Ais&Q{+5!4?xOvB@Cj
z=@unSR=48GW;53Kzu)Zbe80cfc2@dd)3p1JCb~lZf@DSDeq1iGhkOW>f-?Hq%Y+`s
z6nrGb&=SpkHmB^oYBhK3fo57GG~i6|UrSxX>~l?*I!Hbg&|>2*6)fE@k}i@#Q=w5N
zHN>#jQBbS#7mhe9x$Zjf-|KegsCC@gc@2Ef--8TAWrgSwuSxh)<+hF9Y=k&zEUzp#
zHt*?i)ot%g`*S<EH<pf%-n3tl3B@Ay6uLD4#Q=h(3T2?-M=yaGBwFhm;E?bm+j+hG
z){Bf;j$%ryyGCw-Rgp=<pb%BIRlmXC^N%HD`5k6f#kQ6vV3AQCFYa;}{~s~v(rVnh
zr}xy1U7|^ncW;IWy}BB@<(@x>#i%+_s4`8rCcW|aN)(=qDsPCux04&9?=UDN@1&|)
zn7G3MPDVnmsY#la;(%{Iz=+`kKslfKVrD1ueJ&(EOe0P2-D}*X!hd!O{JW9hc5`=k
zsqx@TQsC=v;3`t1mN4A%m)iOkOE?R4UpZ)t@edSzh*o;3gha3zjm*Ef!~)D#tn`u+
zTGx7sG(t>8FRhbtTgd1K4F!NinLfWyE}?qBLf|Xv&#87j)JL%UheYq@54!LKp<g9+
zz}Ir-uqzEv56(RLgHGR>LtapvN^bbvC5z9SJ$|Xl8#{zQ!q~1VVEtq7$QQ31uit3p
z;~*eld1Vp`*Rhh%D)T-MzC>`mckD;a9N!NH7QxJ>coma(vx!YFv1^=rIwpA!<Bill
z4jSvF%L}=fr}B!FT4kJOi0DEqiA%GchH|$dUn+F^37XGHJJKbxFa*ZC2q^d$ZMWdx
zfv;{R0N_wR4xmmOf6-WcW2gTu6n|y&sx<!}e;IaXmv9<7r$wE~>>yTD;Zv|}U+g5b
zLaeIn=2{XVVQ5u@&M!b%wXg0nrsrj2u0NQsYkyy+he%d|4CVncxB%n#F<*U#&;B^p
zPYCCVA{<iohj_qczfz6gi)#E4oT4T%y#B%IEy!9r^=^XA{0lRe%nW{9oXO;r@kvSn
zjgZ;I*kTe(fJ2NaD?PTr8C*sx$R5pwEy&K}{9N;$%jc=dhaQb%;3teLC<h?G@>rcF
zX)0pS*=4$*>#>(<9|IDgk(tUe8msZeDgYYVip3*IC@%9r+WD&4e%1ND^%EA>zkg`%
zziF8`wR3pnQ8rp7$5W40mXvY!_0=nwkXp2z=>*n6bImwcR6-eoe4cV_Nt~|s$;Ui_
z>1T1obQJq0jwOZ`O1#-agSqC96}&B!*xx^dE~$tvqvj#zUl{Z2AIu}xa6&klM#NlV
z#B5?je4=MG1Ml4(JL?83vY7-LzHPeX`$^2cYKzQZ?A(mAVD73@@K|G{dl~`;qQD87
zKWK229dpBzWSzUpTFM%H*CaH!*=ZB`yW9}5s|b<Q)J=(x2#AFx$I$M0JYS|%)qJ_~
zJhfh;7pKv534lZnQe}vlIZwq$(@XL)o9nn4j^nD_#%FRG6<o%v*X`Cx)os|qEJpe8
zRbckdwe#y7z@7ue?ODVZ=q~I+`yePy?JD)@;HXzQC@eh7fF>)lrf1LY+FXXiVF<`(
z4lu|Uyh;X`uapByuvVx*7i3xfI-7W$VKhMs=IYvws0?7nu0`V2D}$ZA-Do-OEeFj&
zxTC#YMLlx)9j%zyVoYudbM+!o@duX_?1w}5^@l~x1n_Ds-FdTm=gm?h?X5l==JY2|
z{$=PUGzL|J`$Jk*e5d?WL|QqksmBf_R-;@DtdF8Z5$qp#_M3aJ6}h(J=Oa+#9=nyQ
z;4W+td76;(^zta~zFS7e3<Yig%JL+>0EjnCb~Z_0jLorm1~Yn!@gf`i9GJMtn#8>{
z-UF6vky8cRLI#a8!%s5w7x5ODr+dU*le8H+B(Uc~*cxhwgFSFk-$*~{5SPLDu_J?x
zR@AT?K7&LMP~{JrJKsku2q{h1VSNPXPhb?!q9@c5{8cSJgER0++ItqA?7eP9PwddV
ztC&M%72Ug^`E>2Lb#naE&f%Mb6Ko0g>$B*;-n35up<f&x@3c&~429<^W;H)x8z<Zj
zH2k|7!N}dT;vm@AR1ShJQT6MX6M$#F)Yx9EqH_#ftt+#j&O%<X6}2WD!cXl?_i6pA
zKv-XDY%E+yh!m~J75hQ_A)$VeY8DTR=(_r>mtg9S$t6WZyK2`48<)@{_%la9_<YqN
zF!nEuYNjIX7vfSv^{#q^*|hfM@!^}JXa~cuw{{K>+HYRBjw!$VN`L^X=$H!GBxbh6
zwPsJj(WRoVWS<3cEHT!L64HgJXbTTEMfbiK8MUl0!(gf;mX^t66`iVB${A#ehHwqs
zaR&{!zu@lsD-*hF-Y60x+}v%Vz3Ju)gwp$puh*8-QHhCp8hT9W`)YUdw2^bn1Nui@
zx|I%CWy3R?4q?*`dbxEwnXf)m@%9X}FF9~W5(|d5ERUBm{IOl~kImg(4PnQ(gf;2z
zkWneWOGCbkr@J0X>B?NKUmO(|8S2+n;)6+iNkk4EL5ch4?412{k{3k7?9Ym@-wm<M
zrm*=b1;gT&$manDu*#~AaSY9v;C23Bh<M_Bg$N*Xw6?a!Q^0($ejp$9nJLC@-P2%T
zF}AG9u8?DYoS`kR7GoC?l<m`guGs5iWj4kYzNXHZu|`8=bv1PT;jy|@v=Ob)B9^;V
zh)>0s{8P!!AebW9N7xrwjd7Mcy2~o8yQaOny1j}(DKjqxxmDfT74J-x(vZev#<B2y
z$il0KpO8o|pM`HosuK>pk&rsH$6hyo+;1HK;f0BI-*Ns?mcOm2icF5uzUgX3>-EJG
zB2Ol1JV-xE7<#)dJVM=Nij)LB(DOV!9XRg$D$p=*i3p<?yP@QIYeNpiiC;m$hVL7X
z4J>AE{BNq2G>h%?#rJqc!wh5MFBYr7BEy`rj;OF$yB`*5SIS;u*(&AKLfGtLv5%O3
zLWm#REfinbof4O#!Twg{sfj^D(w^o1FTRE3bVH#P;fVQhx3w=NU4QG!Bf)`16;{x=
z{KZ=gCn}dL=Qt=GL-(yKfqAesa8;00pp=Y`v1AmHeXH0yX3lfh(|Yw;mmfP0K=B97
z6iuv<1Mpn9p$Tw9rm9;4omsKK(*I}4<(2Tm2M-h@B{>u;@gyQMycF?*)MsnR3c1+j
za0|8!5t6E~kdb=qW@aMD0;=nv6tQ?E9`Zt!uFPFH2N%E)Ib;4)dHz)*ECH{CwCYnn
z@(5E9b0?uQ?z34L9}`}xGmAA&x#3+k@{>4yPEMV<4#28DD=cCA(se}AuqBgUP-vXf
zL?4nIBgJnlDASfu&)sDm?B%gvKyNpC-H>I_1M(@Z*?n9-xCQZ3+J;m<Xi{4x!_&s3
zYJuG;>%x&@IKMmwP4)oX;DidKG70Me0`bI1sD+85|AmoQ$H|~Ne3`B`OVxq<%G)i$
zhUR_D7Hb%F2aPP)TzIt9kl91LI$>tfD>|dpm3UBUw$d&KKc9k6Rgj%|wmkTe<aKt2
zA){z#Qx0>Q9l_}?cvJ3};{W*994c&3Ff5(7`v89e<j3BCP@>`DTeyPSfLOkA|KX>+
z2eHvA{Pk}bc>6((irt5wGS0h~BsYZe0gS(9J2W302H&B4?yd<hQmEu#V}F&O%$}`V
ze#U%F!SYO%xyY=^`AWeZwP`t}5=nIA_D&JQZ3aygdQr^UE-ZM9q|2B>%_JYjY<_ln
z2}Ptem8O;y;}}|uUb7XLWUTva4I_s!URc9OopYVN!zj%dEIeLHz!I$t-+S6eev4P=
z@DeZFhwoRPApq>xWN&h~!z%q+nl*++gIPc+g%LSTh^*ROD1rmTw%*&BUw{-~FooiS
zO<=eW4B=^dpfUzEI6H~+*s=P9HykqR?*Q9J1_e&SQ4esXOoBL*y3UEkBLP5fiJHMA
zg|iaa^&|*3UOLAUojcs*q!SdnMd_9(kjaRuaV91^ERMjA?eOFxgYv}1y<O-U4Y7`>
z3nvws4)eYJ@Zr`r2jAaK`tfv7MB@||l?OsMBZz3j3|O6gI2u1h`DKm<73P*!IvsHs
zydo>eY(Qn-67!-Oy^fxGLN<o>H=%>DXUuNY>)?LsAdET;pN1C?8BUsK)!8K|nH~bZ
zDruo9K@HQ`EVSV{+<VG%3g8VDAY`$2otq*C<KWZQgZ|Vw17_&PIMK5<r#UfXO*BAl
z*CH8<@GDt_;SuJUz8G_{DMhKX^F>hsKbEz?r*}G<4ofkuRbFhMDBWT2XN>7vk;i(;
z7WRR#?4H7ePEGW>-swFnK0VGF-lMtuDI4Is=8^b>xMh8%T;|bid;WIZw~U3opq-K}
zTqS1QeeOq|SNui|7OkOYYbE>U2lZ8bDNa$GE=uv#gO|nF=&yl__7L}kailv@7@#6C
z7@1KbTa+(QuIP$@sh<ijJTV;!bU3VJ?i+(goYfn#$TPv?2IsgpWC523`#q-jYLg+c
zok_QbW8(IG7YH+)h|(N$9`IW4v~ib@7+=tC#}Z&u-6h9)o^?|qtbDl>(63~CtSM7i
zj$0k#bIo-W=6+Uz=K{<-Z6(@7PnTA<XbWxe7V`IxJq`yoEu@@_j@J0Tmw5*#>vv?S
zZLrI`)^+cUUS_nA&8hCX{@6hG?Yy1NN+EF6Xg{MvFWf<(KjRE~1Ks^&f&M%f)Enp(
z?KtQ3YFRGd1XNEj3(UNU+PC93(CO>L-8cKKIh{HT^Hn<yXq`gV=_<4sjI9)WvXW9U
zjVonIQNy=L;O(k7ive=;9sYaN`tfKF6;@x8=-fO(aZXb+|9MO0LzrUX=Gl-L^b$L+
zVxX0B)dY3$7<KTO=F%jC=QG2%-D890=5A+q@5Kv@r_wt9p}F6A{?kdT9a=M+;|n!j
z22+^jFX5RF1`c2hXKz0f7Gp!%K-A(f^!gzkLV>}hN;j)MD~=${;S5noLSAK<Bcy6|
zl2*kAgQG7tDDZVU82F7*ut6;^siCZIJ|NyA1oN6^dGFne?qb=kY8|TKVPGqwuqq=A
zqZ^i4b-CtePdO7&m3|8t{~eSm_5hGIPT#$E@Zykjc<;P9KBk1t@T6f_^#+F%6%rH*
z5sDv=d55vhQ%?HV==hoI^XCa8j<h2orEyn1((*Xep53aOde3&Q!`MjwnvzHiLafQ;
zeag~ve~O{gmH8Fn1W1DvzIVjN-b*SJ<<c4&1b|$g73ZWzVW$8JZVV{={H1xIoZR*-
zv>gJ^IYbGUB!cPi6dv0nGM0`;(x#Y+E0kf9l{QoK=A*Fu01i`^q9-bQfd*=7&M|^K
zMOkY^81973)?t+B(7G1A$}T8r0Z916_`?h@7<Q^bLrz2qY6KHDk1$9<qC!E&7<ck)
zkT~W>m9lC@I#U#1V-=y@N?vMZ2*!HFaEvv7-h8<Ii}e@@l}S5zkQEXI^CIE<DvUFp
zlkQA3Byct+!*N7ui0R%1qtL_LdXe&-z|RUL!=C1>jR{WYxlU{iG)QT2jJ{$t2Jxck
z*JRuc7<Xd{yIz&nkmBCyp`u`^5n<%2I*J$L6q-{(<xLJ()ymSvlBKP>jq%le<%Ac&
zHCj4^29*AY=B{&=T7-c@i3V4#J~x<oW%|n*+7c(ddnxrFp1Ks5R!=n$>OLKHCuEHm
z4>*Lq(St*Sz{EDEMb?Jr+#V%w>@?q;9JYTt*pX9Fxv}6CMw=WrYBN(?dP4yO=}da3
z9hD}~k6uOq^JMnkDe_&Ez>pXe*0j#bWB4@SBZnVa2mq(o3w{C&N`<wP#h;c{OLs}F
zWcv4-H5Mwn8QL?UaE&Qy^8uV~v?RR6SUYFyA#(sZW{%C3GYoG!B*6{m%qIgEoyo0_
znW3fSew-JH7aF-gnC9m-Nz>Fid{G)PmBQ*)Zdo@krKK!U3|xE`Q{dWuazWHEXB#je
zp%_Ael=2>Dr}KckO(b_P=_N5o1ybLd3C~NpTqGT?)s$p0RL$^Qk+O{_YnVC4D2F`X
z3uH!XTyIDs7|Arxs$y=7*ikcbni*z7#B(FhfSHPOxsj$+!e?1V){S_M>RPHTP8ysc
z!@AeUkzpRGoD%_y)!PMH8zJ>c(FXn^;bfTzf>cjW*&MKC)8;yGPCBs)s?e}YD;6*y
z&?uw9Yc(XZS{=zwT;jc0fu)|Ua-k>0Y+-bHY3&Jg?fap|$=f(B7E~Wc%@#4>P29T}
zm;8xyJLm3R?)2V0cjK1zj)uLmCQafS&4QRb1Tf(Z`ppxRF_j2%#s_4LP^4$mY?`kG
zc|Z6dTmaav+4M|i-!e|inWY{Ij%M7q>})!BU4tsVh4CTEG#$>=PLU~iF5M<;JP<lJ
zf;%}LCB;EDqHLQrx<n4H6E<os6E)a8Xq{kgSUp>>`TMkYCn||5-YM%nE<0E8Ko3Qh
z$rTvafDf5qs>n-);Hl0T#hI*{?dDM<ItBD5>keh1cY*0QP{B}$S7k%nj!q|<Gck8V
zwEZZB^pp|-Ax(lc0EQEpdDn^!Xx?$<MTiHX#$9BqFcmUMBM5)n6bfHb?#J89rDX{w
zvSri(Iy&Lh&Or=$fwY~iW08^O?6wXaF37wdPXOX0U|R9$QqQsyUG;hrpTj&hryu8b
zgm5}3RzlOz^IzK0mt{EGJ8PT$==F2t>5-wLHgyk#G;%0d`6Ox_hNrHg4+J@-dUQXk
zp?JE2|J3U?pL;<vuAUM4_)hqGQ0~+&5^oUZbW(`)K8^V)Ud8pM6U8JB(!RtWNy$v?
z9iy8*)H1qe6s$)SUB;_yiTsagWl7+mlS$;tXy@=Pi~q_AmN7y>n{S{<>44jx=k;_p
za6|~Oe63*SUiu<k+P|#oW)~e#=5<dDQ`Eln>Ybk8og8Hwo_wENvL&P&;=rAS=f?8Z
zUNmd9kOG`fNAD2q-vTb>nHFO(%!*N5&|p&xyi!~w6gfW`I%($^l+>8Y1LeW>NmTpx
z$rC*4{_ekeq+UICeg3tEj#yT_%rqT@Y*0eiPF`25Ppv_k(+=10p8Lv%pJ<XaI$1NH
zuYECEm(ucAXkNa6#wCDxj<&_O{WiIH=<p|!k7ga55FC$qM2o}rGG;U`#&D!CO66h3
zcrlJRTuSE)0Wd{IMz_k!=q>qOO#?kD09eh}EzQ;I1Vfmh9=8r!K&XU<MK+Y|c9>m6
zpQCJzp#3kbn%O(&yql1YLCeiX=}^iPG%NMeFk@eSl$!lyCkpg(A|=S?lKOG3ygVHZ
z($PCLHansu9E&1_uFsLLOCwijEef~gu_`HloJ=r}i^&yab-CfI)I5D$7*G<)iom6=
zkwc*BrTM#=kRcQU$<0qo6NFX(QXx&?jb(FLEhUSgQ<JTz_l|aMG<A&59YY2}#NUY(
z*Tk|ClEf*AH7JBVbB0K`P-z&&I5N@F0ly}?G~mF}GeldI6qqq}STZ@4gflzgh$3=k
zbJH=k2BP9cf`>nd|6RO*f`Oee7e%^yI4y{L9;FxrCGJt2rZ}No_xmVwt|S8v%GC!(
zf~u^HC+T~o2S6=l{?0Wgx>VT`-yFPYw{~mVq)&dU`tDO|$5P^uQ4n-0oG#G?$}~pI
z?NecHE2xCpYc@JC+@Y7eg262((35nK*|;Mmm40l)J+l@Nn5cJGUUE+|wlu#`>Ih=a
zD1}q^U4xF&33G_k91X)zGU;Vl5ETfd|8Pae70EaxO6!c`zvXE!G13Vj3!hf3e-+tC
zNVwnHyJRv-1~NFoKFl0NlWauUq~SFjmmO@&g3oLczhfYQ;vK9St|xU-k^QZjq}vJ9
zNL<lrR@KH;8JcJVBmbuMF;Pj>HWN1>Y`E62*oJrbBu+4)RFR;Dj<%7)3)o1rMLR|j
zOGBYkYV8;gASP<0_eRPlTYlBc*#rbn4OETq7Aw0XUo){PBvw#UN>7FGwY0XpF&xEJ
zLtR&(vo&LtH6+_G60yM0v6OU!X@0KVO;&8XMdYVPnWgm-qIb&dc!8d{WU4dbKE>P8
zqIxcc!~UkD9&lL&s>f(mQBj2gQL66&kbWTrB=8~$%pL1UCVTnM+i2$YKdT#!sQlk2
z#}H3bFN6tDuiRB#vK|=mPp#WC11p@i!y&0Q?rm1JqU%CC(jveh+{l9~48?8)N*sj;
z%l6A7&aDlo=JZ?E{2(OPe{pm>_E6^3+*qV$!YditdbE(6zjzwJ(DB!Zv{E0+8m+o?
z=HHuGq@L7`iq_-J5RLnButrcnDRtH>>I5`!Qe$gYFD`+R8k>vsVOMy#P#4aq9+azu
z4%77zS4+^I#nv+apUKtP{X8iO(M)NYf>e-*lXqH#PYK@+c3X^J(?0H>pMU*D+13dA
zOV6rUTg_Zy*)nCh*+b&0Ee5a^Tf|#tt3{sX0(EDW590X(JvdlCzXumSi?_ev1bhYc
zmlR)4^|kdEO?#=5Ri0-TmT)581SR<p6<TIo7un=p{zxn-U`Lz?UrHQP?$}#k2{^yl
zMuJ~Exg^EM0hO3}t&VNtQf$Wcl7~f7IkMQ?ny;w_PV2TB)3{vZmL~>9n+m09pR)7K
zRy}&FWH=s)W?_~$<7G^Inim|u>Hz~mx+AW-n8af--b?Wos0SxYig$3!d35-FgA2)Y
zgq4909jvy82zi8r2WdhU>iH9wBu$at1HeQbiMnO8?pYa#d=Pi>hJqhqK?O&gl(Lgo
zikwM;R2OwXxqes9{(CgZ`e||d)=Y~N%S6K_kK?pQDpCOX7-JIY6aGBTn_W!$%cnMT
zyET*0z|z2oL7vUqNibVvAHwBps!McCM2vj_XenAnQYZpK*URQ*0rMAIB}!wpB_3+J
zofJ6!le7Sddx>-HqQyx-E2+xwjHk^$qF`|uGPmfCrx>r&mSPvOaXCGkW9Fj36E;6l
zdLOnzK;TxWXm_%Upq3U5Ds~RvcG`RYXw6p5;!eV=BWljkzy)n^-QpW%X)q92=E%AC
zP%}4p5i+k`EOEGqv)Wm3CW(DS6!FSZE`D6DBOK4f!g~Xb(p3CwHJXLlvQ<h<JV)pP
zp9Mk$+nqsgNpkw?Z5`IOC}hsNKxU@{+u5n2B-s@xs{*=F@KgNowGLVi@`&?f&^twe
zadpEnWdV?PEnAju%!)Hd8?qAhlceWcU}3Q|&oS=4@-7mKy9VDB*$#lY-I`76MS8Yf
z0V@bUk#w4~-4@E#W&jwCpX7M<HI-8d1nNBQlV!><nVh+X%r>Jg$qYK=v$eWmQ={=9
z?UEwB-JPW4Vkd^RdO`OWA)Pp~^9IT6$G9+4^sU3S#&Iad`Si??ryYi4jSX(1m9Cu`
zKnBd$h|1jGqu17EjeEUgytOCUq1J6Ih|KW-nZQfLmGLBlvE{i=9$`hyuR5E29c3k+
zTR>JLMNg<{zW7jebAbWQH<Aoc@M{l*34k|@8B4*`G5L^mryRE{$P1I2VW~tBHFY{7
zD`e|BR!l(#*%@C2kcNrXsf5C7PTp=Mwy}Ef1P)5t-!4DmXuAW){&i1Xk1(E|bxJoY
zS7`t0jk8E27r0h_db+6R&=!1QP4VZ@Ck5z0ikVN?&;|((FqpSEkcG7b<UHKBY&ewc
z0Ww2>IuNU}SRaj;#snXcsu7+NE@9dcw%IX_ViRJ&KxR6CRLVqxTjEHSG9o)f2fxq`
z*3l5{vMqx}g$N7{$!0+gs5YM};Vy|k!y~AO@>9>;4JrGmtJ09mFER{!odF|<35xld
z9lV;_>k~Y!HNeY|{B+?9(l;Yzf|#8aacZujXs0p&)@acJY(|*Hs7SU`#*n7~h_$@1
zOb0&M^KXrM;n~ZtX0O+dhvPxA*FPZJ``QwsG(lvkVX833Hf=I7gCx~#xwLLwN02!e
z%Csc)yrTO6l2Q#Sm>!N9Nq4hR!X+m)G9(6GQ)Ijm8p^QR+divqtA}`rrHYqi39_9`
zF7UQ38}#};b0kz4*%R12%Zh2qvZ4YXOV~4y<+Igm766I!kSG*O9_vM%fzJZX;Csp(
zm-e_IyEDh6WbS^t7D0BVPxRAaG+gGDRtv*o*lqxaowvt_2m3$$cGzhi9kmX2eJdBP
z^cm8GwY|rpqre$ulX!AT%LJ@SZ`$=PW#*bb;D^-RT{uZc)3GfiI5VJA@`By*a9P>>
zh~^a_QCFB4D|U;?C6RLA$~FE7g4i~J4r(kkIo9&=I2W6?`ZkYvS!F5+m|)u~&R~@#
z+=ktT17Mr-lRdp;Jb6Lh5v?Cu$3L}OJ3f%HxFJ?tvou?aDV*I)bN_Agr;=;pV!KYw
zL!D-3AYt@a97V!tLZiPiG?|Sm)#&1)%%W&xm79k;aPF+qTwT;rJzs&WA18U*L#>|;
zFd^dXd`DYPJ6^d^jA~+5TSp#KS<CuVfmo&rGg<uH=MYD9T(iL(GjOt~Jrt|iKZ5+h
zTq-AVcI=}<atHL&vnhIvQ3<kjg%hfKu31pY3p2(5Eb0QhN9F~NJdN`JCg5!%wiXvL
zMt38u*sMpCKS60#MYWyrZK!{Oi4>BJ@K9GH7$hWsSmo?0CpzXJ-n1(ZLJ;tv%SoE$
zk1FcHzM@<FJlfrB<8{t1U)LkceG#KwkTzw|rVA%FSRGvlj#TLlc(NKBJTR{*T{$ZE
z3G6I2+s(1UykRRNSPDscD!MXy+h`Cf{<31Kn|i9P1AC@Ercz(&5XPR86LVQ}!iLz0
zbZX6;{X!BydiX{Pa2pVIJ048fCMKJtXJmq?nQsgG6dVYvdiG4CwlPRirO5ajq!bu}
ziY8TvAu{)e%~1GiXL{Y3yi>`12#q2JL^M^Hs(GtWM&wGIMPJ$?JyQatvJ8k4paor>
z&4YVGzJ=YvqZ;R@EDc$FJJlY;+ZsXtXajAI@U`BK_S?-mTD{xtv5k`@C=}=HJCd<s
zd>40`nAD@I!z3^KCfFuc4<Jf=Xw(lIpUhlz*Ep!m_UMc!==Oooc8Ck^mb6fpNPLIp
z118p3XrRECOXtbRZtXNtsuMKn&qmq_UxNpgA1LP-+*^xU=wGjht=-(&G@byhOA@j3
zO^Zu0xk1N3rlsddOhhxr{$ZNe#H=Y!dl!m=5|}XuB=3xAfxc<DlD(-+nbsf{GHXC#
zx0V74fzC<bkvk}VThT5hU66POuK6l`N3afaB==XuUnECXyBA9Kuxn<ODu0YP9psN#
zdea+sb%SWrg)%pzIhJB69F8!;Y(b2@iU<xhRg}71nOB=bB=ZA_u8{3HAyvuBj)x?Y
ziamd^y#}e}cvqyBgTsU8`-eN<&%0w07$qYOqEL^k8;@BFzf3Nr1w+cy$tdy&%Sg=7
z#F@Y+hiN#j;s->zq^<B}OL-g7%LAadVFT8RC=Yw*C>l%W6-c;CG@qqwh@b(B_rL<&
ztl$*nne-WSC+8c6JHB;{`lxYMFzGJllnY%`2&2$Fgf)(}4L$k;<TZ*eVKLgDNkSTi
z5{{IoT~fH3IYY(#olW~i3>o>jXCGp6KoY;i(xwlCdV#&%pqrjpZp4V>h@wYb`U4|b
zNn;$?JPx3<1{*6-DvOjZqFkRFx$Gi(ze-ndB_b45<JK!X)c0&afVDO=tmmwr7Yb;d
ztl!7gy?S*DQ7_`SdX9M%12Ol|z5uoWiXvyzK|Ha2*2Dt5$T^)FW<^2?fK=s*KQ2d+
zSF1}1sr(YlMoH31*_2z7ep=JPNS&2)6`w#a-~{2QFU)G#==(uZx=%5!ikJ<$6<q1J
zQjw{xdTim>wml#t4)lBCOH~HT+veVhip_#s^Y8$Pg2alcW;VD5(X!ZW)GK!Y*PsfA
z2d?nkL?k(%WTR}F4}=-!{R*|Kw5BB*dzxl!Cqsq<|COC;dK(7l53S?phwTN`#G>?8
zX7)vvy^HP)2E8dNVU(tNb(CF{Z!E(q^V?4=L%vob2bnvBClfqS7u9*w8CQA9i7^27
zUcPA`Zy<pJ(F&wbU^9}QqTFJQe-Tp<h<9WWrd`J=yn>_L073FBVfO<G0PPvH+bgVL
z2k??nRHE4L2{#ZCWMFrCfC2idMBNkJk|UiJ96@UqU(0ly0G)MSI@h-q%KIu?5)!a&
zQ<Bx0RwuI?Q-&$Zf&x)O?&x8uk<RM)K7A9BgD<RDWFscQsIL&JhX-!xfGbg#`9=tz
zZvBV;uwhzGGRggX(!I|rj<xguxVg_de73hA;NOjJ9<JMe;j_8ExxM`#8xJ-%w;w+I
zW^)V5Z9LrCSpSb`{RYQS`I+JhM$vyvPp6||I-}g2_kYpPeX{Z0$;OvJe9nug)~!dI
z>+9dGZmw@^HllVsc#rYkfDwxUF9zv&oJCJ!3U=@jgP5HSK^z8_7cF3i&s3^cY71F5
zLdKp7%0^bgK;=%Sto^|F1UXs8<=GT%v+&6&(2)tLBZhf{sW9o$gj}v*K=`yT7D^4;
zP-CP%1rnd}BzvDyW>2Mq=x2jLc0sBVMM`t3G)xL*;vAL6mZNAcgQ7!eI3=x|zG#n6
z(Z8&#;Rdp3+D#f_R?B?6$}VnqEDB6BD(JO4h|?iy-NHjb%RvJaH59r33ynsNLI!oM
z(TL@+YO0rYr{pxIR_;D}XOOQJMvlb9dbxqV79;G5==mM6I*>V06k%ahY(PHB%u`wd
z#oSUG*(7JpC404LSZ5e0A6}B83C1wQAao2KQix6L7#yhJ%KF6x5n_W>L^(MNaTn^Q
z;!KU~6=7GN%M2)M!>he^)INN10%v3^g6~Jihd=D?wsxcEKf%jZv~zg$)A8QRS0~Y{
z!~NaXaXV@r?84K7ljFVTZ%z*3!BVpgHJ50|z`N$bPf_c~qvKY)9UUG=d#{i7_n<xK
z;JA5kve#-iqP>Hi{WrT5QV!aPfa{I+_g(|--;GWV8`v)eJ}lLY;6!=dI^KB&Kbz0@
z_V-SHqAp+Tog83yFQC6>bksZsF8a-W^Ef(sb9@Bs9}NxWx4YM-Ts5uTH5dc*8?}CD
z9h^k%SIzx>Z@PzX4_e1K0cWnysjdAzRN`}YFx%a|W034{TISmh01*bc4}|BawX=s`
zT0gd6M$O}&8qh4!s>6eJ>%ZSXId~uKHeWYi!W?UJpaUzk^X9nq8VAl^3+*@0+b4S`
zZ-Bdhd3d->U~jjMe*jUU{W#h`Y!l$#02>UQoHVg}Yz3eOui^XiH|;%y9|0Xhy&k_g
zI@vossKc7S#p~N>r-`1=1Zxl;aLxd%!{eW@T?7U#MI(Cqss+zs%@1UHC&x_$2gV@Z
zIk8JZuK>>zYqHTn>*fC5%hth83*R1MLvQ!mtvWB>UK`8oap!NF(DNIdJ}nxIjlWvB
z+@Ph6_FhEI-5>UF@LU*M1C(g*3Hrd(_M4qo0{t~|0=V_Jv_I-4{ixG{IlS0=*?D#A
zZ}2-ECH5mM#-*A^NBgZ#2Of;NgDKG1C(ZY8n8c@W%oLZe<L)HO*Uq2a`Ww2F^{t8n
zOi<xe?1OMKh0}(Lo2T7TF|b?U>=!s7%LI!rm+=ei06{>$zj^wy{h(II89|2;PoP)R
z!>yyNa$7xq-2}n3-T4tkrZy~oXJfsyUDxxryOE~7cWhNAZ&19bu3J^pp59547wkAZ
z$-1OO;yfNQ9S?re-mB&htqyLGPWz;J5^V%tylx(~gD=|EZw_BKe}rW}2);c$eBEj9
z93Hni&E5aP5`j4sasIA@ww$w;!)^Pd+5R3q4=P$jHAgXtyUEN2{_VG@W*!T)Xx+_I
z*mci$;3<{<Co$jVB_^wR-riMhS&d;RQ1iw-KS&CG>~sTLwDY{V^F0!TR=p10IF)uM
z@mV%{F}N%b`pu4v&mFZqe${N7cCk|zi29Wa#n<hZor6OVH4mEmYx5DxE?%)5<BTt{
znn!!{+iM*i?%NIhjlvTLx99BL>4Dx|tT{^+*=yyF?|V3t-n85S@^td)$f8QHA@2*l
z>J$my4HD7fvb($_GF}e=KO7<P_jgm<#rJAjNA@#7>nO}JTI<lADrfsaPOvWzab;9)
zEHuuYxiog;y5$N=MrGu^Swq-M2X6pXF$9!P9mRWqF3dU|j1&!mv;8#KlU<8~T~_wD
zrE6lu%)w>tL*42p`7p*P_P1}tV~i%L3*)8JyyEM1Z)~Ot{1<GBo|l)ecPjek38^Si
zU4Xxkxbq_p!A=X=V4nOU<tr{=lT{#w@c=~^wZ?dTtoHCcVn>!@7#F$&4CTufs~w)V
zfRAfgl*1b)hIYyNoXn|S8nE@UF{An4O7B?J;Vt^Co+YwY&w=a?*{-K59197dc~an+
zS&+Y8on#f*<thypYx45x7*oB8;)X7JMC761yLiE5WTbvZ2JU8mW%-8^$Rk5eY${_>
zCHJu*N_zTuNVHogc&Y+ByWet<-K^}Z=HB;j?0T*CA&_~X&~J{2uB-<stJ?DJFiMAS
zc@Xkq?*LZQe$zQ_0Xx4#oH*NF=i{P-PLE_~9Z$}>4GAX*-{1d?F8Ex`ULZT_V1Ecp
zv9`7b1+6uHeo3ANJ=Ul8k|N<OZ?ph5Ek?H@q`{GLnx?yD-jy=t2xC=u4v%*^+pFeu
z&0~fcA`Awy`|i7q^(_ESq&pe{J%Wbr<M`qc^Q45s)*2C<y+cUtN4u?38(jQ9fip+=
zwm_b09{lIV=GKG%gejqsM6rrGSW=pdILafih7$l_?R^X+W87tKNZNT0e7ZF9U~6*&
z8^OGAm2K=jf8B^iN#Qhdw0oo)*?O?CiH+>HpGy@WL>I6$4PYtWnnz^sQ5*Nhb%C)3
zhji=P?a~ST0iJC?C_RpcJ^hq8GxZ84>l7X3TbmSf(0T@EHFQ<3`+D!F-P(713Osub
z*#3{!@nHv;4U&k<Ex`Z><MX&YY<y~Vl!bEean?4t!*fh7Y&AH(oH)OS-R*BnlO4yC
zZh(VL^X+fnIVFquJWHG>>FIENYtw(U_04*qJp$D80PwtLfJw)0le;h9{D=?S_F`ll
zGY@`165b~te6a2uH-8H9=;z~c?6q({{!T%tTpC~HTOI)Qi*G{pA_pDzTQ5%B74d-#
zoFXkq00*p1=`wmqwU|KT=F^Xm61fjt3WnDd*)ZW?>THF^^hGY84%@3*8+M+=J(ZlC
z2bL?%Ad{jIhNQaSbd{v}>vXK{Fq9cu>d+hOxpK`yYca*7NEiuJxS~bl8m94(h+R4Q
zG+}H7flXp;+f<}-85GBb>Sm}9kn=V`t(l$mD7aY(XTy0?lv#_qZrt0TGDzoX<h807
zQjO1AVub+uQDk>()kJ~B0_xMJelJ0a;*Y~-r>tUCNaxEMI1a56G4-t-VLiqBN^4#K
zS@)ecdOSHUvngx6@fgR8M$5(!)_H=qr>AKlp57cY`PP3%RB=N2MN+()UNyeo18f7s
z>toIYG@Ss}ARh3YE7fE>Sz-m)ZQO2(4Z*YFX@sHQ2Q<EZ`hhAMb^MSuSojooB3<V$
zy%{OufIQ^reLMix#sFZ+Wy1L2Lomv*#$U(TMKT$8g-=%kjb1_eDIz4cA@a@&Mc7@B
z?x`BD_YMw^)eH0ZsClyUYQObEYo8boXIpd!z+#s~-{#5T>%AQZE6bXakpAT8xOLq6
z?>hHVbH<I*;Q9uq2XKqmHXG5lue0!mP?Cj>MUn9Qg;GK^k6*LN40*Jwds%?@WZ3C6
z#K<OB#1aV%y+iC#ONk^-DoE1jwX%8%Uc0(OsbMA}4{SJEYKIt(hI3|YO0Cdiw;g=6
z7y#Nw&EuUQ2<SNKbOMtR&cPjs6t@Q=k1AvmRl#F~T&SRE(cIsAdC=PJG<SAT<6ah$
z`{b-aYSE<Vu<dt;M1=*k7k-r*+iH&G8N9{^ozb{v9u4|65b~*@#mZY!(*gpV=IB+k
zqcL&yR~%et?&vH;GV*4*|Lb&K)%OzlV1-8@qNp_hjy`(-u)XjQ*mP6g)S!G%eP5rw
zE+V?lQxkpz1P0~Nz*KG7lRA2Qv!HYazd#$+M6W{6(H&1?6=$d(Qb`0P{wrxIY{j&%
zBG@^4(|qv))dD|hx!xX-4P6uQNYfAg`$t<%{O|dc?0@oJ9)obzy+I40+4eu{4<0_;
z^6h`NAAYs}`CUFJ2=2D`)6-~kZ9Q6DjhfL;)Vl=20+L@&8M@JQ<di)J!^T3}Xe{*b
zTE;?tTi6T>f&1}k-T?Wp`_-oCt4+~Yo1(8aMPF@-{ta!4_;`wlBf+C3Vs{~X-)M*Q
zRD#soA^$j?4efuoow!iS9M1QRP5l?En21~TNSIQ4W~_KZg%1S_;Ow?*a6si5hNn`B
zOeGHhxgo_-JOFxz_VLybj5kRQ^`j;WF^yh=T1~~@14a-}2dKC@?V2{2d$%mFV3Hs#
z?;q}TURh$U|J=wcOCN{A?Jeojd551x^3Hkzq6fc`FV?GKa;d86ukLGI*?hMOpi@!w
z5&ta>q%$S&IyD~oSss=y=l%{2QWy1~1cz*wu525Jt_xZ}{@g-KiT^)KvbFBb_A!(H
z-`LoA@Zf>R|3BDX|K=<I|9gDG_Wv6X8qw>xC@{q-Pznqj^8{G3;{To{Ku+^DWZ&1q
z{5#45+jC@r|4V{^Y2_<>|CPP}%HDrv@4vG5|7PsH;X{$_Kpxb7a31I9o%3V>yUBgm
zOHQX}biL|6AO9=QCIvo|3>c`qN<N^?p5D!!k9kt8btQr*>{()X8rqqj0+OkaWf_Mp
zq9jU%p*eI?Op<?1;V{d^DI1%`yW~lRG(mgpPDf}qmGnfT{qf^~Vh`<&j>%The?4db
z_lj?@k!Xd!)*sVN#K(N_Lp+!!`$h6P{vZ+AqWAd7t%U!gYd3)4=?#25AxjxK=B1;O
z;&|ugfLuk;f=mQo@ZW9*at-+ibEIY(IZ|RM1+cT~OyXWT&Eb2V;GJhAzcCn;)dn0k
z6*W&Uhsp4iF8sX~C|*#eDn?RloaHIUAi5cdDarLF+QKoxXq%G>oMNtp=}iw;ve2>D
za!efp#zW^v8Q>q=(&(YAsBc`$37c#cile7WY^$L`Zq~2CLlrItb0QX)jUrbfEiVt7
z1gd5@pt)_dOr6B5&v=k3)2(`XI_<v0CUs%~d`OxBKNr<mtYZuVg7U-xx|ng10%34i
zCTMDm5Wt8Vnc)&Cd*Fob)yCPFLfzitSVP3h=yY!ifCgkTAsb9~AYn7yr}lj8kO=NH
zYtB!Kp78hR+vt&9Y-RJYQ(J*f$;vhTup#TD#$8{r2VqBhwq}O;hII?~)C^qk-@E4m
zf2@GNn*hg`0niQRbP213EA&vUZo)RJH+T;jgr{WVPOTJRDW?ESqbGV~@C!46sn8~R
zB0s0UtTBy{d4F`@drx)5>YLb=6snrezWgRPIxbf)LHXn*AF%2mIZZJ<mi$=xaH${&
z#a=<N=eP~9{Qt||zc;jzBMam3`S<mw&^Q-tVjCMmvLS&v1W3YJ0y&sWb~cm8Y3v4i
zV!OTWHkX;n@3X&k)2+L0Ou}R@C*GZ4cT1&`R4SE9b-`4Ls)41E@+JW9(Zfz!<?4+j
z4UrUH?i_U5M>}siuQ&guKKs+o&2AG8NAX@fJlzY@cQ4z2d59?%&T8t?hW_3iVm|H7
z@hKf7WIV7NxV>|}d%ZLz*cdFsC`Dl)7*lw@q0yj`-4{MZDnMIfDn}=bgCTD4iO!--
zVKF%55TcCXJgip*2BI;^B?06(=%&(%gE6H%u&FF+Y8)T`suszTy=ZU|#uVCI7NT@Q
zha+zY(`|x+d2bGme+5ayw2BAY({rF%976R#MLN^r59?kGkD??#v+~A#Hk|45>V5MA
z;D*z?cd-8wEy(cZpPz3y&tcmC_`|?~_bpRz^N6ZRy_Ttm&o}=zHJ!%`%IE;S^y87#
zX{yAI&dh4fkijU3#_HZl?cT{R<6nm58lhUFhUZA|?Ik(6o+O#5kp`E@n4KiffJH;*
zBMWepM9b6$>oyR2Lf~=Rv*C$&iGo<=Q(lHF4H@>C{*WeKQ!^E&yWiknO@rKi5fRE0
z!i%>^GvSDN8=qGg6a%Smj8cGfpK3@}5z3=koOSC5pWjd|TIEF*3PyZOGEK<7I~hi_
zj(PlnCc0;M@E@8S6qqD-NX3$xvymrSH&2G*<Ai*4VDZLdPL=~qBvBRA?Ca2Ny@*_U
z<dqJyZfYYu3xJ>N@b;|EA|$F>1+aT!@n<VRMPysE(SB%h<+!4wClWJ}?6@p6Bd|W&
zT*H_Q)o<ZA&QXQTsqm+_(BxF+L^!%BPZlSbVgR1fJUi6z18mdX!KgB+sq&!gWxkPV
zYvn^cIdwiwsnl#XXVyDO3+pu-E6s<0nOSoX6}R}P`J}P(aL&{<KEr_%8+(CaBvzbC
zt-)%j5htg?4QEhOpWwd}m^j2C$7yu9pwF|o3NeWto<gG<3-Fj~;<kzYDdc?3dQ~JG
z0hw(1Q?-EG!U9u2x{RC5%c7S=4dI%4Hk{zv-cZl5R~zoi5eB6<#z7bW(-LMyPV+(3
zpNxqt7wz((3@}<UcJzDQI6OItx>0DZ&-@!ZSx2(!WECJz4S&<!mch7Y*Y(5S<vyAn
zTD&cb<WpmYP3k$Y{B4ds8MYjCU)Q`2C8jfCLNF)cIO@vzwd^D~%+a*BcNyFa#XR$4
zs^!u%$q5-wGsu^YQCvC=FxyoD@#eNkihe4CC8Gu`#Ez6Zerep1sa-E*Pc<4avpXYb
zTP4$rnO(OtT6L!vBY$alQ@5P!m*ZJT44#7iMm-?yq9u8Tcbd1eDF5A7=kxe-UUAr2
zdec{iE=+@M>+&>YmMFZxu+%g6`n;%RRvoqFE;>h~od;?Qp`K--GRh9vxheV#=^y3h
zi|dxNDhqwmH5iiTmoIER#4^^fe$MRR67Z@_3%t7clEuFK&t2?Cj(LS1$Zeq{3_l*n
zoIVUw8bJ@P8VWN;@Ub!?sgk`95O73^n)ss8Fu<gt%Bzj#*27i3Zi0*8s!T#))D=??
z6y><o!zWLc|I+$PtK}7Ml(ALqZvGH}pW+$ZMv(8tqzQFZR9YkyT`PI4bYU&_ucR|6
z`OytISiK{hYEk)9)Q<@VCuy2DLV6Q+7rEXjJ)yF9JUMyaTK<b<wIVe{Kg0<#*_*IP
zO^Nmie~=qN;~^%w(=i=&>(3|sPg@)u63LybB0!@$kb{}dL#<W)FT<48nOXy1T~ntK
zjzORjmg?}dMu!v}1-vv36Lb(mzRlVOEsVp7rhOKSFex+V9p$@1(I6(Q&!W~yF{qO{
z+YQ2Ktmv{qg1=J}<QN&Ddm~q2HFhu#1AUqpyNAbYRk;!AQ4)p2o!#v=pB+!+f+L=!
z36POFKq4a4h24{P)GGDM)2P)<chzFTy><_dHPoKT`EZKFgl9`U_rZF14;4kH!~Efp
zV)Rl9NiJ{n!0>!OPC4MdRxZILYr@<;!HGtRgjGycN(YfRyK*GC2XIJ{ZAjFBHLFcv
zeRR$0mi*}T6rvMHq`qNNl<pqVy(ncV&FXM|xE@OZ$I1$2f3--rLl61aJffug(Remk
zN?VlQuJmi<)WY+*n_9~6GhWDU?!VmIxlyNK+k|C^L0k=H4c<%^RUWyUb=LtYd)KYO
zynbffalA&=Ci@s(Lzr~&d>6sDJ@(Ecqj1mMCj`PIPe=6)OT6ohm-9-K@j9bw-yp`G
z;I3cDMcKM6aQi|ljp*;x9rk}GA#y~yJ$2YD+F^)5ts@SF`g-v=OfN#<%L{{OxS-SC
zFARdq1<h|I1Ixg&*4(X?r0~SpaBAUnMDG_Ge5D!cJ4?e$Y1~QBMi>SY*mSHuhCpa0
zyrYY-yD%DvoCFjziT3jaUS$hKhl7Pn>XcfzqEmo-vx#6(SkqkGn!2Ld4n@b)sch{2
z2Ixs{O#C+Fgcp>yHKdzs+8Ywt+apXDk)i=BZHsZ-Lz5LsnoHRmb(V~O;KU&i%+tf?
zIy^RTQ8uUH+^_=>o}y8oYeb<r8Q8g&T&x$uJ#BsjjL!sc&Z9u_^}T9GgQy>jVN1LS
zO}S(2J0~<6hbV399?4$j?31)TGPby5s?GN18}AgOFB@qBMx4o+GY1Pynmsnib@#}e
z@ZhRhWw!%rwcjziN^aZqcU5Bnz)3!#>*hFvfmfnocnL!Py0IvRC)gLd?|+Id!21@7
z*YZBNH1C}~@(2chAz7p9&(={O1o;}vN)g9^fUD9q50+l%E;X?5I(MnTXwiP&U=-E?
z3AyNzJ2y^?)r}{^R4xbYm7tXsTxBy1V|^nWvgRANl!NF0)7jbIIzY3P&fj<6?CrLX
z+>Iq?J%JaR1celrQ;LP8y<SXal{p8#;ax0yWsn@sS$cJH*V`<u=k%}la*C2&_q~Eh
zA@&*j5Htw6&sHF$Xy*%^Tv`v1fG83MXSwkd4QPEn!2C#12(2q&p(eSc4qBsHoSZ>W
zgY^y2_km#(T8Oc8gai%<{iA;5^4mzKp>r?weL}*uvmMzbU)7TkHUo_40ep)(UsK1h
zkU!<{CdndW7$f4S9<|)|PLT2~zvGJocMmeTyQJ$cL!+n(`fwx@HA_Ati7j7YV!My@
zgn#;&JL^8tM<!*4*<ve9dwQ;a<ZJ18fOYV{3fER^xt<k&pgPDB&@ch6o%10nJBrgz
z06~qp7LTgP_qmqs6_CC|_pZ&ohO~9V{rk-A@QZo4v94L5Op`aPzx56E-Isw)d@B5$
z6;iKZD(%1Kxe8s^E&i4iGn3zvPdvL=gcwdz-+*rgCHC<$aIrtkuJ!(qs%2Js@-MK|
zWfAv>xg`t?8&(D2-5<hm_A|L{P;|vWi&l{^#J<xl7qLV(4yNACwTQ8mFImWpBVgN`
zj4C0ez0Wpv9i`i*vHl#SKBbv2r*onYM57M}(mu%U4G_03f^jcL=dQqQVAtKP*Ic5;
zgV99NHfHr42}uPNk}#6!JgnA8GN_P9K@X5AGv`CuiljnMpaK*?>N^kfQhYSD!kLkM
zQ7R*89#4b|lArV<*4Uu@YgAX1A<`sj8>&Ub73H=?z|pFuxaz@)Hdl!+D_P5xnzm(m
z5nZk>)8j=FZ3-S^q&Oply$g-AS9j(xvV=?7NJUzc@z5HE*~20_5E&MotCR9Dq80n_
zN`oQm8+c}`9$!%x+5ToxElcXbMO~vEBT>>@%&v%1e|Sk5(Q0a?W~}<Dc~KT>4+0GW
z7IUkK|I@az$ZmLRhgYl1jMasV6@}+A8!7d~0c3!$3CtgF^3j0aQ3~B3$pjCM2TfFV
zwX!`wLIYD)hYl!(Xv`sSDBg{>4Z_e95hXD){qKh-sfLl9MJG7b;V_<@p0Uj;gXC^=
zm4@1*lg$OW|Bbol&g4I$q9dSY7=cO>hGxjgoa(^?&OU|JsyrpS71+Nu5UPGD!`9L?
zf{A7NAe(Y7Ohi!6hl48+bu^d^G$ih3g#n=2k`E9)=denrscHkM2U<WlHtL$8MLDLY
zvWBfiuq=v-QK7PTBTsyFEi+F{2RHi&&jO^Y8Vu<P9EdjrDNGL`YC_`8YLSmZqQ%<8
z!DePbMr*?Vow<A}wdl|^y%sa)gJW_MLT15oQ{oLPG`)m?^qF74sbfsTM5pukl5`qx
z<UY@}q=ZT@wFxhoP)p+2LS49HmXuM3$icWk6{63_g1N_n-Scst9bcnfo^dkHactt_
zFh(K{6zm4n<b5o6AGv$hCNVb_V(=tzMb!s51E!3Mp1ii`=3(+!$vDJ6$LM+V0Ns^O
zocX%U4c2BKWLha-G+e9|R>QB+Be)}PkbD0`6o1~SHmWIoVsF+c6?I4SBd+;08<C<9
zMsn&LW-aXI2h97}z+OMiylU|)^Pn+=Z8TSEIa?}$<6y4TO12cny3H1Pm@RY><_oPB
zV$~^v_o%pN5!A<py(onGm*S!fRSP07aN7=m*mN;fSp<f+NLw))z2SfZl~rrRthF#k
zHgXQj);xx8v3fn$p~{*b#S{$@_Ch{DkPn~{*|SEfa#?4vuBs*dY|%a}v}Ap?*?zU#
z#^9*7`upfZHGA^l$W%;gRkd9y+tT-XA8_MB1GsW6%BG-=@y>1%7M^p+Ruf>JQZDu3
zNu0~BXPflVG0PHlWVqBiqM!i2%U^vo?6t=hYIvEq+;=M8Hx)A-kd`)4gE_b&MdrHt
z{rBeQ&xI|p?P;YDrJ8bw7>-m7uR#B@JsFG?UJ;|S!#^faDtBDVPQe<Q)n-Q@3ejby
zwX+6Jx~A@(U}5Qw|MGeO!Q~79hNb5K$Zba<0?xZ@s~0ryyvtXIlEukRmq>EO3+J;5
z5Rq{Bid^-sq7?FJAX->hZv!&2mEac6Z57Bmy<Y>ID`&?MQJADR%-f9Nzk8A|8ji&M
zh<t2ZAo@rGQr@R%Byu}9ZbU;3PG@6}hhD0CyF-AWcOFry(%gc|>?QZ_d*kKOr#Kg^
zI}iQJQeqYe_CuHj0!!G_{S2Oy(*VHS;!urnSOp+{1tIAkCjOLh(nC?SI*NFc+x8dg
z4tVE&uwE#Nu~gyn0hAj=n9wqfhLzj;qXN5lPs7kg{STgxgK<E9*SJ~GjSeT<!NX0|
zCD{QVc1}l~An8iHKRUxN1}J^lpU1|6gdXx$o_7g~ED<WfH%uOV{M0$IciC6~qq3l~
zuC9*hufEv=GQJ{311she_u#;GaJnPrc93HQd)NMef!vyID8PZgTZ-|mqK!_{)<O@j
zsnwdcTJ}|)vUnB^DP|X+YfLpHcP^mp@vS>CZHZ&(ZM!SJ+&S3X-d3Mr9^Y@h`k>zL
z|Lu>z{q2Luzd_1z0^Z}#W&FKN50)`g1eMvxhx_z!|AXsM1|pH*Y^|DHhn-8g`5MY!
z+J$=fW7&$wk(JuskZVyqq5ujFwaKS(ys2G~std?u<vyGbR$_Q+JyV%7#lyi~?#lyq
zn9Q0BXl<_G_e^!sZ|$_}$~1i41;_#V{QCU8RQQn5d>iBXAPLdH9xBz!!%MWVr=e)s
zqP{V{TmF*DU(Q{=dqx)gpZ%g4#wQ5tQ@3LmSdlKn`j<jgbx*BOwk$vb*y`}o6FE`C
zjyF26*yCQ$IRHBbLv%-V8mDptAB>TtvPtP(i%d2Tt#nbtJPvz}<Z74(m*IGvGr`On
zgtUPuCL@~T^N?IkkgMu5{NG^#Sbj82t$uM`74>{ctyl`Bm+NNibk)UWvbFkq;o4&D
z87kSGE;~lOc(2iAe^La$C}#mIv8bJX#o!j{jr=(egNruBnUql~{{~}Mu053E=E%|F
zBZuIdJ5z}7n?uIY2Zwft-SJ^~vV|K~Mc!7kgDnow-U^gaN7XMLr)XF_Qv!4x?)TlT
zgD($Qy@u{*#ux%4285U%oUWKqcZd2*qe2b3=>$L-g)16y;Jp>vZ;Cl9&>=9b8jiu#
zGnt;q+z81Pv}=H;m&p`A#+s(0^9P!S9#o>ml`0zOIX5A`^pr&iDS?s6iBj0Mo((kY
zn>I)K!=ASIF7v`&J<g=c#2#sVmLESr+o;e42q(?*Q2b;ySGE~Bd+pFPvFV;~1m-%z
zqA|GD6*_>e8cW=2XKNYln$s8SypUx5;Qc1X0l}~)*{frOU(JC*V~`y8M+Z_M!WH<t
z>?|a=$b)E+^fZp~SFT7)7lKBnEXQ*<IlRo+3z#HW3eKXlcPl-fwu^ZDiD+$NFFD6R
zw{RrdqHS9?@t<e~v#mKBoNKpjccW*qM@MsO9~>Ta_7C=VFe{e(Y_q-PB;cb*+dJ@V
z+15SW+}?fL?ra?#9B#K&rS<GtvnsvPs=_fUZe3z*IH{8~fY&>(pYI$JfL1X87W0eh
z?jN*|4i0yy@^Y2yZpUO)7IeEI?Dq72iT>T*Z6Aqv;=uyiZSQOzZoMKfD^+Jf*;m?x
z?mQSrc<)o`MJIGym%5HG+GDO-2;buRu$qC-ujsDEMchHz5eK>Rv};`|W3Wah?eE|1
z9=*a^ANVV3pX4h|6nuxN{R8LngO2Sq{quh7;O+jAoVVU@?*IG&>NBd)xc*K^;%@|K
z(0l%~Oe~@)MjtMwxUq_?h~K5Ij5ck^FAfi03k<IRfuHRi?C)(J8Tl8UKL1&U#A%?Q
zdr<EA!QaGDL@Z^gs6RlNA><J(8VPSCGgArYleB}~NXFgHKdC!k*c)eBxmD-Pz!<#@
zhv?$tIz!OeY~1~8c(pt1g_r!`q#v9bzd~W<7%LCQ!!<f%1J;;gG^V_v0;M-OYX{;|
zQ!V=g5#xBEvP$>j_>-0%ec8ho-B2|^l3@I4G6GBwF^vLj2fgE(*%h2VxZXOHFy!cJ
z6r!-eDhAwt{@&g>GUnq?U9Qge6HEQTxR;Uh3{NO#=#4M6w}Xk+6Adxa(v>1hb4S|6
z0v*6kTzkv~38^$tS=#(;F{LqA_kH%9k^C(W0Zhz~&f$S84VYG;g-3QvqedHS4DZ|j
z`zNTWqLz#_?zf_qY4}oBR>pCl<$PfcxCaK^`ZAhJ5nRvQUl4C-2TtSd=AB6F5iL8C
zymmPk3{pU5Oy8l31ywPWK{L=15`olflsCsQ@g;SWc1F~@ho@+SlQacINa#YE?Dbel
zi5vfwrl?-1t;1s$`<V40-i>K9xti<elx`LijN$4o;pm4m2x#?Y1muQta6~p&KqFmi
zE*^v%zM+`9d>KCPP}n8AN0cDg0Vm5*7<Tzux%{6@y?R#7wv?Yy*=u<w-Mwqd94`BV
zpKF0CX9w5?u;P!IvlZwGZhgoO;k8i<Fx41G!mtt5gs~!x<-I?%A~?)SH->>`BY9(4
zfR?!<NtcEiQg%`Fv=F#{^^V2iSS4_f{35~EiO)q_BG9U#YbeLZmM;G|zA{eb^b0o$
zuQn<%;fWF39WBT3%50qQeZ3_P(gAC{$$kq5rG~>kBBQDpqm?Gw*hlOrf#0BW2g=>1
zuh!t(+?hY6p?e)%I+`O5f$ijAq#Lk>GZvWrnXvG*%35=?VX4HsJso23!9fs_x2Yx)
zRP<yvMEvk!92JuGKyE7MR0Q}jxpy7<v(yTw!mM6UqwVVMpe#_JCWLbCRu?}GnY4Up
z*=Qa)ph!>CfeN+V6eyA9bf|`EZvq!ct{5WI<&8ik-C|HK@q@5>1CV%Ga6L>Ees2Jj
z)<T)&flBlMj;;>D6*VOxG)N$V{|epdb9DFsAm7~kQK|ccoehjtuvuhr<F);4-S<X!
zKe=EUe2k!=%f}%s<7ReS)SqeXe$Hc}mD{GstT~`9gyvw{5ap(3M%f>-vXH13X2JiV
zV5jx<e+5LB-}w9q&kvM;I=YQfV}A92YvfwrXyginubY(Sp_^+gzF=Rm63DDh++g-|
z_)jnTgNQrV^^N>LydzZMnMog%+$b?7#u&M1z>zF(*@GYLGc(Nt#dOY<*9z!|U}b4Y
zfAaPZ`t!L|h|#nI&6Is%jsuSV+}1%yf9B`t*Nx!KR-mZ)K}Nrhc`eV&ylz0hOu$9n
zVa5CXbxM#2-h|Gl4spkoPYy+cismuPHyBra^!VqDDjjuhFrf3Cq<KVda+bakq0ghn
z&>!bqcRO<hqjlXxt^7$7C4)BqT)7dlzHFK}P{wpA*eR)lI9)68dei5J^eCD?K8a78
zyp_VqD>w|@)L24)ih5x=t#*>r8jYiIFfw;5!&t1<(g<(GY5!z34{n;iLS4_C5wq}Y
zV~(#FkV~IB<vX7hy_41KsFK{W+-OBZM-v?tqgwXs>)VW)(zjdG4Rd|d*8RRl@8c<W
zJuwaCQoCb8Kefnm(}=y{B@jR6R^W)O&h-xnC(gx>n6g?QH&kU{R%s7hh1C^REeSMP
zJMk60G)xKl$o%&!duXn$a7OrU>QC+)Di^RXbacHQdsRjyIp+H?0;EZ9!ADvB{CcgS
zI1f?C4U#mIahI+wdvVB=OpeRmvYIAux=XIW6PjKTY*`~%zoszw7Fs)p{V=739*z*)
zEOb8Z9dA=%edlG`EYyrdr^BHCni5Kdy}yQ<dwUi0oC@<Qom@fjWE6D6opTt>%KpL8
z?u(y0FL(BL4tKXmAJZ>eC<3;=5%mfHQktxBqZf_StDL0h{nC?;hzd{bqR)hDonFM5
z(J{>gpS}p)gT!EzUODbx*R)2(-GKQ%j>Uw;geU2i*xrh=O=&V3VEA{6%a?@11RWX8
zMG`|^WF=O{P1#riVbT_0-uo1;EeexrO;>}p2&XHw^f0Xgl?Xn**X;zecu_l83SMd$
z=FHG=qLY!ipwOyhd&G5*3(qmX&{WBKC)lu?xRzNV=cu@8fx|+t=JkJi2w#d1knt9B
z9ML2R3px(@mji-<?|x>l5R7rsR?zR#l>j=ZB+swt>Xl8PSnjAkb*vcq-r-Er<Y3F>
z>?n>&+Plz(xpMP|WYa$|r4)P6@v+dLtEDA2bw{@Nqv-0_RMSCl_XOwBpd%Xl8iz!L
zl_oh#H09H6qi+cA<m}-2G8&mYUvrkotQF!Xw+LplUb=>0ygU7HcuLVY{h&Kig#GF}
zQ5p`|PL%I1);YAO58|1UE#$|kLZ-@8S<_wtrb(u4i&fJxjh5I;@AZ|^2j{e{mz67k
zA*ui1tb**lNM%vmv!mtManSu#y~Y|o8|23{vu>AEE*eIr4YYx?X7o9>ngfX%^&7xM
zHNDF?JzTRBy6(?Mwi$NFu*qKh(kA?-N&ZsHA$HxiG5Y!@@<*CxE!We!YE^Uli6aEf
zT7j%bOF^swZbVzHYz@v`9j<$8P9wDr(9v>aGeV+&ZynWHaGb;#zf8Fl4efZ+|3sVu
zHW#s2u-#hZke}M}0S|<q)LDE%VIJ5P6_bhyJb_|2;hcAsK8*P1PjBU+kdUh*2bCMv
zB4gA!>qvlIj?9NKvoMqhIzLdz0Tz@!0^x8V;(Zz=?wCmuNZdLSG8w0Yk7OO_sOAzV
z8jlw#pOc-AI?jg+j7>&l?j)3;3r3ny9grV8#+Md&cf_p9n@k}IvtNWm3|7bcJ8k>I
z*1U<+`v7tIy>N&klTYMTe;~D0ERCNgRbm!8Sp?^#a*4xcn88ohHrsEm@IH8ImZ!)U
zI!yq{rFE6nT0CX!FVTpTj9$qhk-~<1D@^*yQNYMxNRKRvaW0LS6-)lm$>g}s<Kc6T
zMGnK8ql1Q`j9)FX;P3Jd$U&Tm>LkmC4=GA<u@@d7Jk0XyvZ8tRH^m3Q%QDWmZlvRO
zFM&EX5N9<%@<x-)yIBs!Vg}(hlnv-yGc%e+Z8{rp;pq!q4T-bGOaUc)Xohac9lYg&
z^N=q0Y62`2+vWb~){V>57gQBD-|DnO))b2z%28!^n66H*=fn*%VfTxoby?#~+pvyJ
z_H^0;m*9&Sl(8R5h(eHK;S6GaKAj~%WT!xELmBzML+hfR%Q|LEiI(OFD__8RGLh7N
z!=PeMzcq7m!DOO1+N;JNZ3}Cb+B0@tJT+z_l3s#Q`MhPFTO4*GpGnQCH@W=9Z^+K}
zgW>`-kQ{?<7tYQgtw|6&3G+9V)3DNEGod=YsG9;8rMmdtsaCsBP3T3BBG~rs))8u+
zuVq~Yq%#MZCKzCWa#I||e`liEJ=v#2HXjPjpw-Oq<T{tKI)}A6Mh!zot$tC@RjJ_p
z3~djZM%VIp3qMlETRwxc^#%}9*&Jl~k;Q4oag0CHR7bAb2+1R}3X6^|8THsy?O2g!
zEK_CfQPMgwR*9Kz&(kYc8D@EO(XNz}wQQCA+52<G%j9B=;g)TJfkxgPV5%2!-eI7o
zTD6R6dag-hV?0OGItA_*q9Df3ITX;6d5+e{@mF>IkBqU*)RCAI9X%Ldj25?6h?Z`N
zSME*W+q;JXU_|vdg1GEJ{3ByF;|wBQ58=remURpNVW)WbvM-Uwb!Ng~C<iw-FBz&<
zi|j+;*oNmUtxq%&-Z<|GyHZlxZ1G>$-j!B$YQv5=(?xp4X&vUv5cJRQkIsVQFkM&W
zW@~xn;p(Hue|d7;?S&_&XTN?L3`hSMC+Xz;;_~XZGOuYA5Pp67r})LRzT6u|hkG<m
z+jw7O^SMys$C|`fhcnCsPM}7oK&i{MvUw131QKsdU8d*A&SETF*CI4YWxtXYyZY6J
z2!J1j&chk8hC{dFF#Yj|$|j4{L-gy1sR<+f4Md~64_zgX%*<w#yPi0r(2X!)XpBzL
z>&c%)dldn#NZ4QWuBPaV#yc^4x}%8iM51u~=>_ASj&dpRg2V)gH2D)KN=_C~{V%IE
z_`d{S;83`LSYOjO&1U~J9>a<nAm~KZpEPSvnvE<Zj=D&vV7kvDV<c4An^na(TXpsl
z7fLY!CoLe|B}O>$u0-NVimA>5PDN=}H0wSJ59b_csvzWn?_ch|nVsil`k60B2>MfO
zK=wI@>!BH(46a@nuW=6H=^o$s8DmIZjt5z9{iRv-lEOX~yla_?PYT~rz3eN`%e-<Q
zTd3W~@@_WU+VZ2C_AmEp6W`?QOWA4hkB<1s9@1K^!h@Nq-McI>{Wu{I(Eq6x)9e>U
zq)pm8iB`%UVRRY&W|!h!SrRRlco$_;I=(`eei^6+1<KPF6PzytBcvwDWDrh+gEyju
z7LnAYp5t)hex{nV*jg166;y3(sLJYcy+TH$i>p;2{`;zV**clWUJ$2{;#)Xd;Cl?y
zGVAV_=AA+=F8tD5@Jklw(!xwytyY0z-G~ow4%#=A9&q=+i0iDkr$>pOSPQ58vUcUk
z3#iyD*#KpZ>>!cSjDI=LcXk(~<76%|t`;?*rI|r~{`JI#LrM(%U0TSJFK!Zq@?0Xr
zH{QMSi0RL?EvyKVGb35m=XBjA?F~06?PWyIt$H2Jz*+Y1wF7=8YOqOki!0S;&z2mE
zZc1}c<5os+XaZ$}N{d|pHHpFwHrv4K0Wz)P*oaP^rg3Pf8yA0xgN+xif5dSr1IT2r
zWD7^V4mlk;XWZk!JtlFYO=snGlJ*^yb(C}*{eZ+*T}pBqF3g&#*UCe8#@ytYoI7)h
z3#@f7TrILn_{xY?H{_O1umd#8E8?LAeqdtbkC-8+dk@cHGZ}qwoI~W+7g^0sk7cP1
z3k37^PV9<~VMd)<E!<rk;-Ttjx{iOBF(42uv4<aQU#Bs^WuF1IEC+P+&rYko;@4hw
z_$SrP&v#D9p5hM7=a2hd3Ix5<J*qC^m8}}~A2aBxqSwpx`oXd@e}(9Iu@I+TTonn=
zPTs)^O$Eu#EIHHPW%;}E0pq0Ug+ywT|N0O9(EUXn1_p+3DH(T{_`xw8o6ZKo_*0|%
z^=)8a{YQ@;;@{Te)u#Km*<4;;ZMGi%SL<PG`O)g?<K-17*LvK1y!>CP`Snd-|CwM0
z9i{$jay%KPlNsf%dH-+vA;A)}GMX7zla!83I_uz8Jh~cF5FJ>CYPs2bQeSSifTOj8
z{&_$)xb0wg0(C~CSUn3stQm*DVLqbMK@efMF0x+VKv<g~l@cuEo20Zi$qfmMbR5A6
zP^&g1`M9{d;S<gsL8_jFV+nAEYcdi=C<D5E;QY%q5(q}&co3y21t+H5$vvAN+2*PM
zX^ibUM2ZO0HNi{ea3iA=L5g@HIr;+E4D`X|I6lW$dff1y1Ee7xsfg@BD1#KhaT}H-
zEEX$hwc8J(f#jYqLd7K1ph3~7Kv#Q{Zdink#zK(#B5dRYra|@ME*-=IJ#$NFSxTll
z1I&mL1^vX1zPa;uJ7W5`FE&1;IKu$0fE5$yFt$%=3h+dYQZ&K9fWregY95oiu4l$N
z#z3nvXZ1xK2561T!;@k<>~VB%Q=U+A(v$Q8Nx&g0{K)CE3w0wTxiQkzkf|$4qz9Cw
z^VM!!wGUn#z1uw8QSklE;lWS4+dJFp`OoljM{OOv`T217<*Ot0>R@ks=di6d_qXBc
z{?Xy?^S4I_@SwcehMHwsG4Kuzgm?b-=5VLoRtJY__w}2-U4RD-9B%F(?e4T|YIlEY
z@9j3l`~w(j|KLdN?Y`bUf?`JpHEb7w<!h>g7wYxS;npkox%qr|Z};eDYVyVI(LOf!
z0@~YDZ#EB)cFB=Ty?J{G=YN8R{ex4%*52ms>z!>7%lDyOwe!=?{*h|G+63{)@9x37
z{hdSXfY;aO1Z!`1^ZDKmHwV4l-bL3V?3Vqu1%n7k?g8U@v$M5}Uv~bs13lV2{22tg
zL*i8j`|X|oeGBE_z1rS<z4;RQSh;3&V1~Bd9`3wG#1CE|oc7!2?W5hJw?{kb<-x%=
z4SRd%@Tc9ao%U0;chIJRd)wZrK_f?-*gQgkQG?g;{rTJWE{-1!`u-6}UvJ+W?H=q`
zVb0&d2*DU^LhWrD>w|sjGYr<j;m-&c2ZN@frry2Uf#)#i`_jFm!%Z9x4Dh&h<d%e1
zVLXqV&Z_;LmwUS}clNh-@a+Ktdbiu&sq*CQwz14EH~wxDT7HY&r%40c_^U(9HJVzr
z`$BDQ|Fnz9b74w610%94<O5IJZ?|5_=;N|jDwXc&gjnU1LC_t?N#m^SJQPa|d}yCO
zOVVBxH_kS^N2Hg|JnQwNWB(Z($KbL53{Ee@47e1ySq9iuvQ+StuD1PW0a-!#&w$;X
z`A<ga*%;0+_|S#dOISS#&r!I33;gLUBGGGsa_#Y3bp}<583t(5GfMbf(C_P*ve6jo
zb#(MavY_``$-_qw4X<1|2))^OCMCHeCva>>dgvUy+1YQm_ndO^C>$n9e+mBcJFQ>9
zi2E-Da!1#|FkL4uCOt|w;?V}0miSM88&HU0{~<^sgQyDw;Xm$<yRAo^q#vgw;`%So
zdgBf-{WLxu2ZKz#e$>I(mQ0lP`5<jQd9w1j{^%hStHiQ=yN}Dc@>3Pgu&83Fs-LP(
zP|p4BH%Et^-ThtUOP%)a-*?ns%<Ju)7n^VQjyijrN3d3Z?f|3Tg2f4JVa1erz4^C-
z_Yb}IN3RZdHi1{IHf_*SU<GYpKb`j8!BJba9<BVv)&XwvV)vy13v2!8;N{`w>(1-l
z{mxIDdvAACtGQ=SQb0!=sMN;|wwt(-Jf}kfv>4I~=hyPVJzIz83ZYddlrf<jAseX9
z1$%eDeFVE!aT@}B3T$V1c7f@4UhW)qXy4j9ICz6n?k{wNL`?}V-%dnn7n<Zg0<!LD
zgP$kw-69__GbTAeP?4}-#Ss0Jw7^K$M^yN!evSziK|<Om!!~(FOJs{+JT)=?b$NO$
zr}%(vX7=KEq!vR7ugmTYd|7@LCuuaYci{LNmB_^<leqgSOl|43FZMtN*9g|XU;rz)
zD=6yn!^wa(X;O{)u}RC4-uFS&@(M)aXc#8bs_3^Jkg+D(k7a5hn9?XYn^sIG<mgN(
zPbhNM3%pbAb?8pX@nfNX3>27@PqyNx@CwcQ?1NsA2L6*V2*&XM3l=@YSg2$MWsLP0
zY&Z&V-0Y)KGz$AbyII625p4Eh8mH)@HSAvHr#y{PoyL{Z+2-cvACt(Xhi-E2j1&-^
z{T224;lLPYQvZ*E9E5ye&!V4+whR>n?7U0NF_YrU#S`u6o$l*}?9p9EmZL|nnKh>t
z7rj!{C0>3VA9wu}O&B|lH&cGi0!+8C-@dbs)gteE?vjyG-X655WV-C5S%tfkG1@Y8
zfXj8JRLrgdK;k51H#gc9rz|`uHW>j8UsH@;b!gR4ac2<O1ENEoEf{K!UWhc*8BEgf
zvg5G?epXy8hm9`$S?LiiVaNg$Rb-?(qSXK0;tf*)m5|W+i>1!^cyi(r;v%j~v}1NR
zE3z{VIhy|(7FaV*C{8w49S<8IYMrRq{bChd+%C+0KffYEhod#4Uf&Qb3gBQE{HKL*
zCPTV5p97q975K*KtghmClMO_QCaV=8cT}{5<ik|Wpoj2o)=j~n0L~Y6vlyHl*gdqK
zlhFV`TR;L>P(dH5?#dkQb73Bt$2t(&_(0)#fl`F%ttekpb752SP)f=RH+-f9ueGS=
z22rBh>Wz$2tdfHmWhfrvbyL-YNJ(Qm9$@YDI;^ARL(NU~Dd4%5rf4`c*i1gNKM8te
zqvOqlj0Vxwp&xcrR>u)gn?qD@XVCC<V6BEyqeQ?_EftJWvt)0>IUf$XNj380;87>d
zB9I6v(lk8~V#TB2f-{2O^zFgj9V~AwV4I)y{`-_JTzSjlgIbogW%o5}v=Cu<Zl8r}
zET0xjjGyz8DP;?1w5j<_>u&d4!%SDsv@#}gS5(;9cVzl*UlQeFQaT+umAK39Hr^!Z
z9P$AS7@7(>L%-;3N_Iq@y_)uMy*<Lqjx#m{fCs)OyPHc6Zxc?a%_U?g+E|P?^T{~S
zi3c<^5163w<<MkIy#C-=Ee@j7G3|onva;!z*WhbTClj7y&<)v`$VC;~qLmW&dc|vO
z(W^kZS>P*}ngTJSY1rMiSJ#9~G#Ige_MeW6sM>RAP##@9B6`sA2AX~9WF4Clf?&ly
zAZ!+wJyvPDH5H&Kp#j<lS%B9If}i~pV0N*&HGel_p9K0qfWOfE9ZnIj6(czR@W?Lq
za0&ph#JYH`QlXbo+J3d!Vs*vS%$sfWq|mSA2uh|CxHpEcNR$~@GVDZ>8}w@8T@MGT
zb36y}^Ffe&$^c`pve#^~!AV;ZZH>{jWpjc&*L&_it{4uOX$7T-Y}p)0=91UfOe&c&
zi{WM1&4QQyQ>-2->~9Oyfi3%}qM2yTFi>07qo30-J+!|o?n%k5Jy&epVhupPVHTU6
zmhr*YHGO^KW(M5udPC7YIkm-!^zdXemBkiN7PWB=XT}MqE#@q~fa%4c;G;=ekrnDM
z0sXb+h<;J8a6p(u7^Q7kBvnV(({rw4e`3|RXca9J(9VnWK<5V|r$X3GNriDzfgcoE
zq*AS^GKQB@6x6Kq)6OC451jxg=nZ`u(M9b*LMCB;C9=$dDL~0Log^I5DL4<JJ|6D;
z&}ic{?)NJmYpK>KBvb2=XD2rWSrg!{tSW%Y8sY1M%UC;Q+hnGt8*OGH#a`QNo!rOV
z5LekMPT{I9=Osinlfq_m+Yt&(64WAblAunY=|>Mc=#S7%+r0#h&Am7!>@4SywiNtp
zc(p~DNyAE($7ZUxYK|twJVo<C#B6skVyihLd`MfCZecmVxyGkErg?mhIm6QPtiEYt
zvXuj~z+&-9FSx4QPtPUfHdmNXaNY`qb*-l7jr1H<7}doVD{yV02kVMoqssZIJJQsW
zO@V4r7<>WRgZa=NIB2UP+-)%r@g@6Cupju?&qWS?-c~I6G8|I+IPrX|R3<~br~-Kt
zx$0t-+|I?zxMChvtJ&PKUrJkr^i{IQk$$Vzm-wCJ{kwl~M7JawuI4}emi2~4o`qOy
z3-tbS{++ggrO3c7j0e<T)^>a<Gtl7x<AV~;sH9y6&de5dO}$7vu2VCG=i<;@Xt9dx
zR~wCb<-E-gWaV+q+s{s-epnNw_b}8`ccR&H+6%`}qm0>XH{0!<L%bVSFE)4gcD6A`
zuI4QT6*knpWbIy0E!;~MbSyC-@335>HnF)H;v*0i^~Be)*J|N%!JYhn#{OO^)X1fm
zo-HW7CF4F6N%7CR%9x5;kS4&7B}xLPn;4=cD|SGnDlFj{66TA)9Y&WGPbksNQd!5e
zG`*~EpjoW5zh!2vyk!DPcNseBKG>!uNR_+a2sw?%6qgHH`axRy(KG~8i;m&t%vLyS
zG>UK{B3c7lqV(jW8qKS3-s=s~6c_@)ww{4;8ly(49|pt8$lWeEz8znr^^^7WmY0&)
zU0UOOU;wJzkJ=%e??ag|67SN>n!bB8*HblhpQdMhU1T4$qrHD$W#+7)f6AG-VF*2m
zIDE&^URzHjw5o?d<pb2_J8uUdHw>gJ%T1lmvz}f)%~qf=Lj@Ihu?R7XeLD<HdGqbj
zD+)2HoED2#!?hqhD2PT8NDkS6kbWo*>`5={8ysm^PtM`ao4ucLiVkw_9`jIn;VjaL
zi<u^?NyP+>qT#RoGL-q#45Fq4vn0(<Xl_N!YHwy^&VrfV9G`vQr5NK=!CZbVm?R2P
z05g<D_cBT=c~7o+KxgUhbMbaW6SbyJ;5@(@T{?himm{>PD_7^^*g4QNVcx_P(P}}p
z%=n^agO}i1>AId54W^6)b0F9`b9?8vI+SPjO??1%GHy#;JvtUU!~O&Q_WR)ik`4IU
z?U#e=E+&)Xj{8Wi&B!g$7a#0`D&9zo;__vW`+UOBP^E45v&D9kv|xr^A@?T35%qHC
zh#6KH)n;XPs^_R<m1~BQO)f1yd6VSpZ&KtX$Nsa+Irmvs@FtqUzQj=z@0R=H%&yMF
zImc?%96PbB^x&@`HB>6@R00)LL3qgTrdaU@ry_c3KvCMjaB&x4bpy^ljcv$Uoyz|T
zn*Tf%kso|S(7^R)j%P|`jE@*hNnyuay7udM$@h3!a&Gr^TZz#3N9hMDR8_icx$HCs
zdjjyuO5}+>K@zIwngW^!aCqNA2cKbhQDIO|)$uqCK0Wnow4{cm)NAXxBFLQl(C3EG
z;L{S0-`b7#1zBD5Yz#Nt5a!zm^zsXiG2SSepEy|rjl2TF;dK=5W`dwR6hk~@T1u#u
z_YY85D%V!4uG5w(Ec@>8VE^SCI0u$%Pv$7TfAD7K@HK*Vy`|hPNjip`P3?5nOA+M_
z{HiZkWcJ4!>2CGSCGG~A=&PKw9uYH-p8CZsrDqB|FSyEY`kklpFv#(ZgH;O`o7G_&
zlVUSL(NLK9bp4^eW#xcbFM#|xs#VxWpG~nlsc)S0YMVQqcZa)2X!TybQ7yFbbZUu1
zr*Ed1-)}M&Z+<WXHl2l?NS`fo<!gBmxveVO1R#<Dm-FBb+i5(4ZWj0*XNc4cL)Bb-
zoyZHc-SFqzn7U*ii)o1e*d0j5*D)xoW^9o_&iYijuM6hPm$clKe_yW)wV*Z`Nrq#h
zQ<O9=ECp*CA+|5CKm~n*vh)U&!na0#)&B5CotX^h=uW}9+3ffAWu2>Lbr*s%ldt=~
zfwt@*Kn}_BiYicu9O$4+7x)@SXjtDE8XGOmpJc(}OWE4YYiiQg_?*QX-ObY5S@7R-
zc?Tg!y`QtKntMHKC<)4IlP0t7;hDB@F;ittOS6MVW~y+!-~l9}&5WU#Sw%9n**G$?
zCdu?BBM`GlHR9BTvT)x=A0D)vtU}uK&F5PVl@}Y*QuYL2MSvi<aHXp5shQPt?f?2T
z6VCKk?jeT4Xf5ZWVBm*3w$NO7FuvEyM*LY?&psMyHo-JpNXbOUbXN)UfcpQV;51Lt
zqNUF53^M!fWwZnXMXJhKD+wHYP|ZDo3ONfK7zv5|X-#3=lT+4`)6Qsa7s{2b<*N&5
zHfEfiQ+Fjmn?_?h={P6s*tTukHco8Yw(WH6j%{{q+fGl<-ORVv+{_=St6H_{t$Lol
zyJm*SrBmvr!+zSv3JaZkE@7Ru+5-g116G*s6~RVHYeAhJ85;$K)T3M*$e`dn!rLk^
z1EXO~T0+(%U>E?hDD`52()5Dx0k#~uiZHiIoZ{gMTR-Y1VQJ=wj7XGRSW_;%Tu_m*
zl;L}@Od4Y_YD0b^Wr<PHHo7qzfpyTVC!w{`F|Z5zft_^ttuBeQR$R~r_T-C)6HbZS
zB5s54yN(c7hya9c?k=D=pt9?g9e0@i+4~&moUt)ELI-gcSGDlvO;Hez9{c2S*u8d!
z80Bs;d)wowyj1?R=-9duPP}L#XIGa7PC~16Jl5#C;{c4h9%~FaCe+5^D9D5OG#%mr
zpSXK>G7u6Pj<aJ00*7J%-f1m&d^)Ff3az7s6dAaK@IB-GNDME-CZlkBwHl15JQD4N
z4dLjj%;hbQ4wZ(dmx}Dk1eW7EK}C2k1ABuqIpxr>Kv`E}1-*0?!>GS`g)ncv3lIL$
zh}qlDvPfhmBXaNQ$$wge$)DxYgfiB^S_6f!6{}#7gbknJJN4Le&`FD>5D11+5rDEm
zG!r+`9n-kyv8L~_h4-0FUt`O+FjtGij!KRtx@3C6o+-==Opvz1P1Cj!BwHL&REMAX
ztK=lho%nSl<Z2-Gww%3Ax?BWsa)kT3b_X@pDpCKa_n~!vCOHbP?Mkat#%hK6tu!;+
zPJvX#acr^6*U`9ca5Dz+-bRFvC(fWnDs{{Ep@z@}r0d2{+H_aV_T8Z(%aoTzh68WK
zu)x>^F^x-c@OO>5%u0d@cQ}FV)Zmr=V;bdE`vUJ3!ijGwPf)E*l=<q5Xjh8H_4Z<=
zU&Vt(UcR@BGtUd=AN4Z(`dz-a_B#+$0pOyL!&yTSz;#bUI8G^{;M8VCNhFSTCyuhE
zwWFW4sAen)9vCkNi`AVjPWaDKd9t&V7c&@=^M)WI$dJEw((#9AcZ>Z3qAMs_#N5Q0
zC7{<`VmVpuq$?WP*PFuwabfavqlu)|jQZr-w5kC=mMP_8DD~8?>0~uKT9xVKEoub#
z*;UZ84@M_NE?W*z#BfBcW^h416OutDw{kKQ_-f{OLyG76@m&&s%fR72J7>b8B@=cu
zOSuTg7&MxY`zBaYM(Lv&&!yWG5QI};pGX`s`JQ5jVSU48Nt1B^^gcDY+sg_ZX^-1|
zdWgCznVf~l*><j~6(*iyEg#LEj(cwiu(o_V@_Cz<2q$LxidB!O=nh-$o!p@qgAZNF
z7guT1EAjJC@_*oKkfz|YUtmt+JM*oo`p@(F?~xe@4Du?fe3;)z*9WtD^TR#wbz`%H
zFT?tcNyR>7LW#KEY9x6z%>Y$+LGk`=7R!EjHB~%oYlJghqZj-XI?gVLOzUJUqdI6J
zOiLzyoZ&$-+5x_B0fOc7;yA);<s9vzbj3b5-*F`s`p>MYS?vpaBRsd;Klr!}28U~>
z9xuQl@B6kaIO};nPi(bYS^a#qxXyC})ub6+<~ZEfRphGPYgcdccmvssLK@|t9HN_+
zuE#>UHtzO8?GkJ%p?Ujy1)NciPH$ZHU{9lzuKyhhl*8a*Qxi=Y_R6#1Vw+{-5!3H#
z>gD%N+=DhDF92ct_w=w(!R(DB7MmDbrU(wEqg?-}K$jY8*Ly}q=mu;UJ+`=T7M*-!
z(vYj2Ml~ycPigp!l$A#aYZKsRIgs~>PMjG1?pTXBI^S_TtV^|x3Tqv#KIi#|-68U&
z802dIwmp-Op?jzHfD&-6hbe;r;P5mVmz34z2CaACXKUHrX>^hrl+%ARx7^ZGzztNO
zaTCFC$s?I`Dyd)*p-zVSsIOXIpRu5WD!PXe<+$8EBQECt12Pc9nzGx6Z;O8&&b?7;
ztHk)jwRzPkO$Jq%$w8HAflEcNZh&>HGVm_i?;wjP$BUX9uGSDq|7tsQOaw+?0-q+2
z#%8vjG~f~OnDv;<Y1x%i>UWHVe!r^sYBSE@8q>qTjK6f0UvI@yt`SUky(~~4U(mgf
zL^BAXb2;@%4NMB0XDhy$S$SS5S=Fhxv0B&P%2rM#j(YSzOjESp6X_5N)Z{vtNr5fa
z#usGw4HVN?k7{~~U0LN~K)#gY8&Ckx7RqmbY&o$?AH-zET#HT7aSRj|Bv`YExu1kI
zh8qoR=T4_*cYSn_#tCqW*r<Xd91@U(ZcAP-gNpC37ANmzaymi{AYYhQlv6#1BiU56
z4TV}^o2ZSr;qHt~w4P>faquiEFnP-8D~lN}CY1!osq`v?&BT`&9I98TJcm)ev|dw8
zf<Ic!d>u?)Hu}IgYw1|w)n++sXwjUjDuu(fv3AQW{j)DKO0ep(6`LHPbN=*q7m1CX
zBP$QLP7A#*XcJT?jJ5_<zW@toWiG7Dl}6R~i<uL!%5OI-YN8(3r}W&5JA0Q`J8eyB
z)H^+0@23jmkx=}c9+tiF0`#cbwWfckN@+TDil33VGE(Xq;a<os89|67`_=a}wKcgO
zx<Sa#QuaBTQ<`M3!0>|>L_#Do{hD=h77!owL<p5xr`()jTu15nVkfICSWRQMaT1m@
zD!KL0+(&r0He=W(oELN*9D{Z6$Jl__Wge>8y@(5L_8v*&fq%6Ws%F3z!4+#QUgPVR
zbf((6Pf|W6!CttaH5~_IJH)=cXA~@<d^6&pwT^pmRqiF=<I+WCnC1j8szh!_5bGG#
zhtV(bnCN0T^ocR1Pu(|_OmSUg99#{24*c5%A??y9r{ef(=0}j9)0dG!sh5jnzemv5
zx%ewG0B-*-(WDs<7r@3x9-M&+0Y(r5kRgUQ9Iu5J_Vtsr;j$wRqlFW{e6f(45Z9Os
zDhu&9vX@*DY5>}3Q%J7!g-crdHUE;$V*dJ33>TR|;<{Qc&7cwk7K=fPn${wdNvQIx
zN=$EOdRpO_6yT88U+FH9A@@a^aqKH}OV6;{R>N_I%p#*$naJkida!>UZ+MZ?pfpux
z&x7HIQ5=Fv4wF;V%<NU~lQaK0b168h^G6eW#fn(wUoYErInWN)*gheYz2vRRwrF*n
zg4zW^iUsp}JH>M*MXi*<299D@f5KF8dOokkv9!ar)N<{T1r_x9Uy`EH1<m5kDvewP
z)KC%>oJ`_UpApBG?if2}Q{E?#LDOQJbLNMbVQc2hrw}ACVtWXLa#G!%X(Ax?`fq9w
zqO8;Nca3Mg-tLUCe-#_%)i_MkKXHpxz^g1zp}H2DtmV!SYs)yLOHy8k3QJiD<P#!g
zsFGtO-FaA^LQyXRDYLE{SqR^YKgAvyMCQ^EI~@uxAJea}NWCP>03eqAVqPiG1IMs{
zw5P>Mhkk*{#1h;rlh|`m#~YyLc3Q3plXO0kE{UE*E(LeGaHdQOu`h%6-Z=31r}Vuu
zF^2unlBQ?QO)8oswhI`inM{f!MUIa-yTxx&r^$yU$&n!PZxS4(ZjucntH-#{*hl&C
zY6J=K;hvaLk=t;y$agYj_#@QTR6YR0x$Jq>r!LYVu{hs8fqNZe$`s-6V~>fzTeg;(
z%$|#-&E{<BWsWJB^^T>Nc^o1S57iXygN7_Dy7#lsPC@cz4{F8LiFUTtLbJ2JTa4mm
z{;KHhi0x@3_fwW578N~$zthT}Yj*zv7Mj@xWQ6k?L`SAppdgf@PZf=B>I`s6klA9{
zW~Gc}4TB+nGkr|jqRb^bmv~L<kt`J}-5=*KbN2_#U$c<Ymma`(Afj0gOGdw9mRc>q
z1!aJsEzOs4mDju8qJoeKgV^)VD<=JFyW45NdA>%-aeQgVqp;|d<gL1;;&uYotJR|=
zk4iueVrmV=wEN;d45BGvG`Mh4QwsSgmiHZSST?dWue8_W2pG{F1g|HpwumAhF&kMs
zH4v>x$j9G6dCMtVSD~5LUP}AfKpw;0tI<rZJKW>{K8Yq$hs^7|4pCZx-&p$zJM)jP
zS(tH9MYrz8jJCEw@^kCJzG;P|TyZ7|j;_1rmuz6wB1a<Ay6cmmnytp0-B#hQFiqX`
zc0IPW5)Yl`3XRf6=<+ia46txHK7JZ}=UQx8&3sFCIUF;$fp3RuW|7f1E80S#td$ae
zF@1(TXex$W&$vR`Y^cuU_U}Z6y4#b=k@XXIwJ-94misS2*+GI*i-OIfr3+KGK(}QL
zpoV9VJKii&1f+F87+Ny3*vGfLvWVskwe_EyQ!u;MZ2fr+eHL%ZIu7k2%Jnnd44%OT
zQqWWjuI-L-+O&PH)kF+`Os#l&Jebz`P_3YLJZeJjNGR=2zEs-I*58|VtjU|^SSYSV
z2Nb!{;Wr{Ou;J~PcWeW^T;WQW*K%epFB|#`DO6x~)Q7gJDKkE}Xwc{IEC-tQ-GfiW
z0GlPHi8EE`p}$kbL|(phd`LZKxY9*Mg=?9bsY)$fVLV`VyzqXW!e_XBc{2eVkjjWu
zqf0B&q!P5T;l=HlJFR;HsErMS5iyjTFFy-0kfkiUuMMg0<0Q%M0Z^yK2UQ5L@x$S$
zwyV?plT@r1`ju{l#(AVhM>6ra2Re%#FhV+sOkLbf6Zap_O^)0;{qS%dB{m17>$P3i
z=!EE!vuQ(IoBa?2wO#3C^TvBxYFb(g9tY=-0G<7~qpFMYmz~otCPXB05swaUfGtKH
z{*i)5riGUajXW21I6p{xliA=tNgW0~dmD<dn2X7FK->Gr<RfDc<!OoB1(DE163=HL
z9-KKHHxLA6UraL;pjNIW$e{KK#=Zj>{<LTHZNd!`uqH9Al!QtM9?NNRc8giAf>Hyq
z`XNLNVaEeI+U0~rK2h4#ZFWc<pwhI<uk}UJuAp8Y{BbzB%ijS--#s2{<@hFMf}4{M
z7k66DM-UQf=usReAn1uM<xs4p0lY?Qetzg^%lKq&<(~1mmzoMytm79;o^z~_!x>3J
zk5qkhsm}%PmM2_tzvt*=nIns`BHYSARhFQFOQ6wqpAv{^Wi?fHs{iFf;ujPNPwnt^
zW0Po37i)zb6T~!z-T({h4BT+eI7nH~>9@hq6`JI0tCAnp(nKxhp@h3>D7*Gtw%rUD
z4&%Av-3@j}CbT(+L#Y9&0-tb6RW0|dmitXQqnlJjSACzKC@El==*M``i=(fAdJRwS
z9_`=`ooS=@i2+f0RK4bdDO*p2zc&jNm~*{lERmkz?O*@W?=Ge{=tNKfhO?lqmLg?U
zHd&yqynY)Zzzxd1s_OaI(7$}_Ys+qU<R>eZ$M7B8(@EAtL^ZlIRI??34%Z_->(2de
zsPO)`a_@{)V*wol^8q4mv)=cB`3X)_&`<u1$Hj^n;pof|l7kpRH5_$IoN_np^d=mO
zI`n4S;Ct>##m%g^-I9y9LX1b1L><PgfGzsFYZ3y9QFOU0c`*tdThTC6t5eZ(I!W`*
zTm(j37)EZ`lf%i3ZUHZ=(BNJwF1zR&2hJl}#@N)RC-=GSIv`>GN?Fi@-Xyc0OF*FP
z*|(+!L|bCafV~TvYjW7b%0O~)Q($-@1P<vaICn8-fzsJ9`s2c?kzZwP)9E7u`v}ry
zJZiTf;SayxCA=NQC`l~C7c=n?%OCF&O0GP7kWEsSX89KENy!rkL9a%9$e0fXhgsS$
z6~%p}vyuWdv8l=4FN_Kwe6M9tN`&%$v}S$MECD}6I#+LAESp?LN=63tCkvTa!X{{|
z^7%zQ>y*1S+i3T%;lyO%$j>NcR~pq$bi%?ol}_PD9_nxv{=8!qJk<YOI;$>K-YZ|G
z4fy#rP$(z8wltP``9-J&QQ^WyPBH1%wH{9vyNnaXwV>_@cgc$LRJ?RELsBXYcFhg*
zZtO3-zFDvuYywBUYBF_%`?HXJcTcA;#}5I@pIytY!i<;uFr1}}IZ3g~g}gx=ZIj@i
zp^cR!`DtO|0=4&NvZVr4u%S=t0eIXaktdWIiP#&4Ig;fm_{hUgp+_+bB^Y^yioT#G
z(6pR&Zv4_bGO@o(DrTI-2l+yxzs0NN-XBa;|MC{P_aC{;NuIF$Ej2IrQE+dLn2OJ~
zB)Kb~VC}N<;;_91u5~B$frS8VP}fh0E%Md~Tx94FX=XX+5PHEo2OY}*!mXi{T}-*`
zj$dvI&0F2QJEBjVNV+B~>!`KX`_;)$*GC<FHO`nx2F~?X+@LaN-H6fsJ_&L?e#%`d
z$Yn`69bU6|5W;N9;(Iq#Jy(HB+<ZUA8P++I{3am+BHeK+agUI?w*Y@9S;H?_%Q5$3
zl=ReAHfI^laIvgnWlLmx+nk3=Ard2H$87ZI2dnUI4t2V2GyR$r@p`ebeX4UKb5W2x
zADz<8yu+A9)S`>S3&-9v>xr&i4bd`{#ClyNef#G+TU@g5Kr?^n?6u5W`$N)PT@+&_
zZtn#Xu;u$~Xwmkus%XcE(_qRhVR!YHz9o1vXuZ{8D<ZkUc+L0VJEoH1E+Cv==~Bg9
zWPLNgYQ!x3gJa(b^0C4<X1MP$J64DuvoD_ylcktq3O}7z;00_0^9EX5Ca+_RdiMyg
zs?smy@5<DCxs6BNbB1v;=gh-}zNpff6{@3N)vEmx_-w3~G=dQV-Y0iM&44I)!Icl(
z#WM#}@rT=bO;<aN*P9M?PvDysR+T|(d1unX)EY(O&GP|SPQ4G(CofTSUj$2ytr|tr
zT3W1nFDF6w?cN!W*T{@8MX-BkX|(mU3;mDGUZxYG*Ne@@zftxpPlz2I5B1GilgN9N
zRrS?JU#N31I|Uo(E$Y(>!ZS2|cR6Uy%{591U8FqHDp14I(<Z1DxP&&*y$@+lyUo;K
z<^X)=ptvpn9A0Y!iiT-SH<$S6uu&Iqcz?I|bS*a(Q}tx_If9^Ju=z@3<Da?;wQpR5
zj{7EZ0z*~6rle_;2*3%D!4>oQPE)b_Pj@uYbm(-kH2-K}s@FY-<eIBED52i*Br1_}
zv<%PJUMFrx{Lsy;*XP}V5#ud^?Ax6bA>t>3=NSzZa7ikfdaP?G=d&k^JErnF6+-u_
z`2{I%{aF_6*QjloKGRr`4{j!!{&gr=N;HtgR1o3c2P{SZm_|GlXWH<MY>#n6nf0B`
z3$Dc5IJs5p8fg=wOuC4@R#6skuG!R3C4_6X5fTy6RAvKfjoJ+bzUI7<B5B|b9qO3F
zasnhB7{~Mb$B*$hZu4?S`zdA>jfhMt76KNPp+Vbm(P}`{6CGqV`3n*(g`mR_n?+Ix
zz9RAI)7Vc`I*yJGu^s>HAO%hZ&Na)b<Z4G7(&kG@b6g}g1nnB``6#?^x5=JrQ{;SA
zM8#xJe6*kM`mkYCTfgJml(0e9MU$RTYk`2G%YZnz(>X0t^XEp-$9uD$+*Kpyj+5b!
zUrht{4Om!O=%(oT9+R$F{vK`u0CndJKTcohXT!IThL<Wsj^{ZY2(RqyWz#zT2N5IZ
zF4_L!^=ZuR{Mn#1JmwEsKMp$l!q01MPAV1ek&(s~e|<bjOc1Bhbx|({ZCk+n&t!Y7
z)gIW7+;P<$ee>3MpE~0<XI0+p>_0krExhPXfJ1aF(ji_8x?6!4$%q{Im!Go2@^MwC
zuTcEv&hvp1X!;Vm#*A0s3vLlcc()5n7emo1%6&8hoBCITwl~c!aXSN(WaW<Q>C9@s
zdj`&jseHM9i=Yne@I5DHcNMJ-C~QL-K<w}7;vB%A{Hsk;%ev`W9y$}a83eCSEj>IV
z(FmvruZmWC9Q0Y$$k}Ui_AR|aVlmuG6ll-kb$e4kO74bu{$|CZ6+gWAE$@%^m#S6Z
z{=t$7I0Fm9D6BN_y)X*$HXi0t6F<SDz@uX*6yIsFS)8S<2*1cj3-@lSBzK^&r`UP&
zJKfKMJAzQ2NU#5D#X*W9G3^`uQuo_JrJ<$F)UuAMy}RtOLQe%~Cf5PZ-Q&VvFBby;
z#GpnMb1oq*sVJB+HHT7Yv-)^_%X<n=4cIZxf|S*g8S|wXGdZ}Ix)Jj;Ger?Co}!Un
z0hN`L%-8OpRPs`)!xZgF<dg?qQdVR?QbqREots6^_))u&xHzGxO^Zx%K+j^G!)wuS
zL<=Rtl9vXPS7j#G&agqk+_75}NPg|sUk|jad7*v&QEPpbT#2sn{e-mfw<Bf=(zT`L
zKq2ys6a2HQ^Y>TEi5Hi7A2hA<5^``acb=j$)Gv2<Zy*^-a?Ca-Kxw@p=Lqt?d7$^J
zZFJRqmtF+3#7Wc@z74}R;!J>tnpr|z)-&q_nKV7lS%Ths=AEyN93K)5e;{m6Y&fU)
zei$fS>cau&e!0iGH^YARvu-wiN|CoJs^WOk6BTUas!z74oDBUCzb696VQ-WlfUoF*
zA}X?i7P+WH4#VhYTHhR6ZaPG{Df5slaxoD%BiSmeiCh-y^K-+)m!Ntzl_-m5{31JU
zy63jUQD9^?rB;{Jay|Q)m&;dSwovyFNEuRIcnI&v;gxYgGP$bD>ncEXM(J|;HNYC;
zD#amZikU^Tdv@RVdV%MPau3325FWK|eICYUV)+!#ORrJ(J6-10FUDK?1Y6{&;In=l
zzI|vQoMauylU%7s7sP=#3Bj`CSf#C{=cQ=Q8k_1BsZt&xbf)l27<0tj^P1b*_jqsN
zl!AG=P9VwL#)a7n?o{7ZJ7E`$cLyuDnnu=@2OS6hvEHG~RgZ<yYPi<NEon$jhj`XB
zl$P$w`snQCiK%Cy-8=ayu_rOZ!nYlZD3i@le_9`WZNWhNulklg!gbo|-*@x6QvZw;
zsz(94mm)}FofO49J#-g9=8q~6fp#>Mz7#quN>30*c2C^~sr{3z<q|qk$()`r-e0JC
zDeTWwN1{Z=bF(Xz+pcR&Pu%_7i>-#AoZ5e1I&8#O*5u2>Gg;WcI;Ii&nz0`+7d@da
zqZ6k^gYt>RE$X!3XCT)lpSO<pzOTP!YTF!J{5@P*V>(_0W%7&W$4a{COu?R6jpNZW
znZ^h!SiEAV_#kYa91a+7JIEL~|CF6JR-@r0)T!>CY{IQfwFrNcjQ?|Mr3@`+!a^M}
z3*oMW!G&|@@QQC7-~kU*by7xOUf~{eUJ@g1a>2L8Rhr!pG!=-6DIr5jCYGi4(IN+N
zEHUKCeOFZH5<MsM#Fe(EWQky;Fp8%iSYGhiRNqlV54+{5btwR$xi*n#^s8GBLv3T>
zEpvDJjb_U%^$moE3<h3XbarQQW%IMb$}UPK$dsX0mcU|VM#U96MOBUOi>hD*e33Y$
zR^%1RoE`{Z`9-_HcY-Od0C#)yRl<xV>!?_(ISP4%!Jx|0n5AWkFb5z^AM>h?Fw-NU
zfL6H`bCLO(MO{z}CUm?7%XN{oTk*_k-PS_+POU55us2IPEVaM0I3{wPc1#WD*KzkP
z_%eT}MimFnw80+lsRa#;u|Hyc>wZ5ab~sxbSnJ%;35O_+>F;?DACb$l6`H!RCq<X;
zzBf1qi80rbeTzIi$^xnIoK=el^yeAJB2JBbYY$H4cQo)0sPApGCf}^vtZLId-}I~&
zq)Nu>O24~Qe_lT7ZtshmkRS>=J$<I@)Z1n)l?hWf{fS?-CN${UpyGjpA;K89v5l4)
zr)O_VO2h8GOM3(G$0R}pX=0ipe*;_hx=q<!(?=EV<P|X3RcP-K#~vxYKy-P~>f3`q
zTvsgrEoV1)8;lYCAv}k8G(l3y#V!4<ulB7Eyn<xAdNs4KN#JJx)8oC`t?#mWDJ!+7
zs#!RK*XtwsVGssTkLtT%gqYg533dOqXm1$0WbtVDaO?PRLba`+ELScwUTfq~-pbLf
z+-rFhS1&QZV5i(-TT`7n1&LkGD|MiKj3RhuvXWZ+)%ymDShsk)gy;Z5di=xs#}8l^
z=MaA<TN=FPV$Hu8+mNGpIX-qPY}Pp#eV7-L(lp+dPp|Q^0YA^sIA&(y9UuVIBljpp
z<3?r=Z=3zl{$*~o!3KzxWBA8lzuq*hp({2GZhkJ}>L{}+q>*Bn)ujqt7qA96)i<@}
zeF&}V0%R(;SP~8zLBc+j7t98y<ID-CX$~1gd!9IKc}_=I0UYHf6Y;P{RQUY`25H>C
z^AMT!=FUGV@wxwHqVM*D78Upc^4*7We3vHkxjiXBU?SIGn{|fpNj#m8iGfYGbK&>y
zfgo3T&ttOp>v@y!^L3%Yuo0jH6HmY$V_8Ln5nW4h=&$`5p%ZQYIRP2PF8LVBb{gH7
z4?em5IOAh0P`mfxZp<=F4zOWWW%?@a$r-<A>S=?@X{w{$a7Y?HB9%?8lfsZP3AXFR
zj@?IxxGI31e3-K`1w(%N9wYui)gI+#ig<iQ{KGJIdP<mecwy&5`_rM4J!)>4$iXvE
z(y$d&TFgM}e5xD2TUb)+Tw!;30vP_-S>kR<SI_IB9^BY}A~q?lc<!nYk=*&?z44DV
zn})hh^(3+eAyKoMy8@)?w!{<!Ru()mwXT^-@l%D@-^A?=0lY5^=A0p^;b@81agag1
zxEdM6wN!`$GTz<r!$Qm$g)X+6vEMN9vKZj2^`Jdb;HnV$>(G|2>q494#*7!vp_tB)
zwq&Cq5SVe$TaOwIsy$|nU1v|<!J67c+I<MtM_z3?Dw4)Rpp=+-s5)PVDfxax0w#<>
zeT2NXy72e}E`aa{;19FcOL(=q)mftr!Jm@)HgH9$-63v><KIK^)HwY@gtL)-7wk0U
z5Xk6)THZes$)k3XVjZ2g=`kO7%?E9Z_<hcZ{NJ?^WIu-(#P=?3lu!&%JFU*;#5qO{
zUGT6yMwB>)i8>Gwn&}>~;zdAct}o{L9;FNd1qqy)e6JK8<*ChZ^P8@=S6i#W6J|)j
z5ZQE&aE`^Nd37E13>-uv9e#Z#g9q`1Xc*7Tdpxuh8!@*}3*eSbuyjsN^16nbke?ff
z37W?PfPNCeZn5>rcTT<F|LA>TFY96>4r1w@$`?2jfc8nceS*t@<WQ|sUwT}NY-WjC
zi>qm%829Te<!M;XSO7VcH><CF*^=*ZSV(?b$8iq&Yy2k!oF!7%<&!hJz!~|8N??B%
zUck9R=wkdhyP>{dmkQ`w#D_CD{6imbRqaX9RP}(O(u;WHNB^R1v8I8FU-)(^7By}_
z1Rf+6ex*`l|DWr_@F42;fF5}8A$xrCWWOx7hWtpc_u)y5Lnpx-*24?qsh@%!MN&vX
z+y~<*YJUUwhg7*4evnr`cXdWETEl*>5+2m*)y`Wkp~za~14EFRKsmzOiy!S7-9X5O
z;E!pEvNz`0wKK|i`$8!CGn#R=h$t7+VL_Fn(z)jJ=YGQ&I+?hGgQU96x@dQ%pq2mB
zVoZ7?w*ajZ!HVdn%o+vK*(BsMK&L1><*$%skFw_RLx=b@DN@IN+=+2MOV7}8E4Fsl
zZx2#Y?Xc;j>97}KP`QvtKx5yb{e56QpWXsRKR>B%(?>id_pYyenA-9tklf&5VBfhW
z$ZQvPKyq(&+vtM+aPHew#D1XEXllqENP37X96B0{-|ZIB#Hc^bQp!Q2kmB}zJa@Ek
z?&6~Xw(Tuh#Y`D{l#0l#a+X8gqa$M6romW?+2RS<7khRTH+ajZ%EtP9iU~}2{QN<<
z->u`Thmp9*VZ~AVg~;w_9^{%U?MnSAJF%S28YrZ8@966)mw2^81}je>lf^R+>qXja
zcjJPzeR<io;r+1S^*dmO?c$Px<4l@4rZ?>@17Qsj<e5#PkA5urpc%{eiEGZ-RM3x4
zzb$rY)er*_U0RPn6)uPC4I`HOkNycSz66B^M^d3f+lIlK6{qqhfZ3Aq@ke_fb+vo(
zycXxT^;ay5Ac7;i{s3#-^Lp)!^htTH$R?RX9NV#7r|%N%IoqpA)Oxa&0KD(bZ4iS{
zD$jUt$zlH^pXn+K?&t}s_9w!V(uweBgwPj9ruxaDX=g9e*jP6xbQGlQ3IKW7_7==U
zt5{A0D9*8CsW1j=H|Giu@v#X@<dodpgnIt!GOz;X63vW*<Vk_N)s+IqA(u&W)vlIb
ziIGq}N9n()dT)?k!o9O$y(Z#)J<;HVZN}Mo3f+mk9{qyFtcs3s2MBayK{l`aOv|gR
z(f;!NlI0T-I~sw0<yW3nG?U)xI?vq1oKrv%ZZXdG^H-jYJHW2b<={sFD{Wk8xUFdJ
zCvXTqa7J(=S5SjYlLQ%6Ue@;8v>f=WtyWpR(K<-!DivvS&Zq79DXIZ#75-F>mq}gZ
zT03-Wf?rrmRVpR~Mg-4RNhp{sl%(5NsYukFm@i6Ts$IrTah91vp;qA)_E#Efha62F
z%h|%g{t8sf;7O!KF!IKgD>Rmtb;%Dqh)5k77i<Q{NN6VvtpzsopC-zo?vkj6-4$!o
z$_QHm8*HZogJl)f?KC@OR*vY=5T$rW*kbd}E8&u`!OQ!^^6Y3P(Ud46Ea`F_L}%Xd
zwV^!kDUOX&YEYiS@d~rnYZR9Qe4s#?LzotWn39JK&dbx3vM?DSOjoUaSQ?i7HI6X@
zQy@t%;*zklwI-k}5uUB%51B~#L{+3p1PFzsb3jo<dXnj?b<LiYW?LOCY_(|~tm}d$
zJEYu00l}4;KxD8&Onf)pO?P`~L$Z0Nn-1#U+1##U8VZU}Aq?SMf_0vze~i5NCODVY
zD6l&Y5Ii3+;I$uvLuM*-O`)<^Hw=VmjA!&2Ec|!IrKvG+$0|E((YzDNV3u5>a+*4=
z44EAvsPu@v6Uy5IO3_Cfd6bB2oH+}{8dkujui2Dgho|xq^zC%Yf?9~W{Y6~@c%qdZ
zps<Ak6NOaJ`|*lYG!4wJx|!C2U&8hL8*cD+Tq!FB8f*>zhh?|^O25_>{|2K%FoINq
zNgh=HoJtroEf`<VTXMD)y%(Wmekh3plL;o&_#;GsuhBS&RU@G~>Xi>p50~1uE|B<6
zFInm+unLNxx~>?WTsR+t`m|>%m8;4pL$DHxi149NLdS~7ajR|`hRrpjLc`3pyIL6y
zlF2alt;s8w@FQ9h#RLT}LD4IjzArR92~Xs9eL8UciWpDWd;lFSUNCJ<qXO`($y%2b
zO=K(yIV!mibVPaN=jpSID|BvGeSHm3E&*S4WaJ&abE8u;8!WbiG9`-1iU<ja#uwCN
zABWDipis)^`dTSl52C=R<rag#;xC0wOopM~kk#X@<O}vMcy@z;NFQm~r>7(o<`&oA
z5XsPkPlo0X1RB*dxkkAuEHTFXp$c)rA9<%?mtySBz?B|zp_ZI+(*7-|U!sIJ>Lfj8
z<}0F^%Ok8ox@F)S!UDoEUfRd|Tn@FB*Bp)8QXuI8-)%LCz>n~olbTB<VEqGj1VQSp
zjRV?)5_nO~ad3(+vj@-Txme9J3jc(lF%N|zpXJf{jyf88Nu}2SM!@I5mKIqSFM=I>
zzQn{)<q8i2E{jHy-pw3AT$PlVo%th{-^7Vf{MWsV=T$n;mAkOO7yS-mq;4UIRQ?B>
zGiicN<TiA>nS_YBG#LfqVAXM{Kbvf@j4^>l4ihc`T<*^-u4c257-WS9B>eQWd7Zae
z+@>=yXesQZ%YUO*DC8ct2kGG8Ot{Qj@L+5f4|0Jm+Y)Eb5T;_XMTIur53}mi6M4w0
zMrRyDFSRM~5u(SHLpUCydQMsLLAoFnPD}EcJu}33Qk#F0aPxSLPU4iCwCoPrYBt=G
zfF|`l$zap(@dyOAjm_jE@r!u_TslifYaNewAl!Z+T;d=p82qQluBN?piayc7!w2yK
zu99H1vx-o@6#l?eJQ2fL6Z2SE^TW&lloWeQEr-%|YQ0==D3k0|(EzwJn!crzyu<3D
zK3pTT!=ENp!8}>_$Z~pe+SNlQ7=$m}SWs!prmO@2&L5(P0a5xf(EKP4N47p`F<rx7
z^pyTkVCJN(_XxrzidV~y#m67TurR2>G(l%FrwGS}W7@bh^PPHf-Q1Mi@oPdA<&d62
z^7uU1WxlS`6yjXPWOKoFw=^Z0oht@&@54vbofOQo&Z>{LpVGaZ`hUKn$np_vv3**w
z&+FMJ`t=}^z$DyGLc^ffV`LgCDI~{Cl4pgzkv87rxGIu|wsa{R1Ij8r4aVSH<31Vf
z)A-rb!oEI}CyuAaItY0<mvte^Q)ej>XG{cYuOI!E%pa8s?ko$K7YW2p1v(!Np^u?W
z0QEbbPAx3_21J!s+fmR2i3@_?wyX*D^G5t8$Vw=JZWGhm#C~`zcklylxbeWDFv305
zf2rE9;8o~w9u<^=C2M6jPc`&pUxzD|m3iH1_S)1)X8aV?)oHghQdHd8WPU~ze0jtA
z+t0u0c3LEf+>smJ9?nEuqcrr>UXki9+t1}4?*~f8pob&wmFdUTyLs3Fj?4&&b9G{U
z31s{^aS_PNBGpNQ)%?LT>5Z?Mt-wD858=VTy0+JyYul`<W7cBx^(W*Mptp2>uUh6d
zL}9p5PHC=kR~ifVAd#0HV7Ojyq$XF%2qyW{a9Fd6{WV<2>4wW-NQ{-8km}ujY>bPq
z+*yo0lWMj7vr;McD0sF*zeNf>VEo0xqTrQxnFYiYpr`2;F?#y(iA(13vfIhA3(LMV
zBIYr1^DA;*Z1=K3ow2%nJ1nk{gVWLu@dg<LLAI<ows5f}EXbM)BWunf$;~bWqiQ5P
zD5jyPq<B)pcFZ8z2O=L|L4KQ|p8tLKGJRr*2E+X~Ef#upiEI{O2clSj91ylr>R+#y
z^E9rG`gUKaTHH;Gdj~G<O2E>y^lj}Pn&CF#S^eOTVIB@f3P)l>3}q09EXO0h6M-$K
z$d)lKr#u-WfSWHZzlz?7s#+M2KYr}5h)$EzQgw#pgGfTU{2(!=?_&cq>KTy%igOa=
zm$di4R&JYvHQcwGo5A&oe(#!Z(?Rd@LCjEHZt7I2F=B8@M6l^|u6^6siD}DOk2C&H
zP3D(vOlhrk;loKFcjo$PxeN7e$t?>!=g1}ve{h@liXY-EbvxIQ+AmN0k);*?3HGMU
zev=Q4zlA1~S%HROILJt7BLjpm2eV4-&@I5afOef-Q2Lh{PT@mlBFp5VO?bQ46H=OM
zgpLJ{hUjcFKxyIxS@OO3B#Zw9k{Lb4a1BW)qU`iq@yRbrYo*qZ8}$qtB@9){rV*gJ
z=K3<STqJKi_kQFMq}frwL(C^`X8s8_BxBNhA7o-efL|2r;aY9sjntB0m7Vh7wXvHd
zX=^kI6$KxU%8{^^wy=$vvbCrP<x<nHir1<`+UsKTYj?pX7BH83^fT$mD^Enhvjto=
zN}f8OhQ!}}9n2`aq0038<H$`(t_25rsE9u@qdpUKyu?=G-gtkJZ_baq)M$xu@sxr1
zO<>GS%Q^A>6cQOBZ=72?%r3|tUY-;-o_p|<8&8bRr&8Joq2ryz{{zQUAtzMApSM5u
z(2=BCj+Y~E*EGh^i0$gD&NzN9xEWHGtLa-LRy)0{EhHVzFkvg&^MQu!#YZ53z>;IQ
zop^GJ>mHKR6qy7su}G-ou4?eWxP4Ju31+ymk#A<>Z9lj$lU*L#cU6>4N^2|xM$1sO
z5Gm!uW}#S060rCWKqXEvUDwk`-dtmK$rW19yp`RVcXH~cR70NJvaNz#7`g$0ba;xS
zu!<{XxnLem2kuBHoRH3j07hbuQPa95Rtr1qtj52h7AV`8_jF2)p<Bj4xQ*Ym*{nEm
zn>CKoXM4<-ZPaOR<BT$#1Ce-J%aJTP^83t7OrM;nm#`qPQGSO(v0B<R4F71hil44K
z82Zpz-quN;AQPsF>jgpw11jA#DXTMz;$PPRL7;w#F$57ve3>^~1<7X+gtb+ANUen%
zcBahA?cbi_CXxGC#DWw^j}^giBQ`kxQ!k&6ELlH><9w^R{u~R0&QA0dS=AaL>6;s{
z*}ia5P>r;H?vR)LBkK<Y+%Pr5Y#(?>$*iy2{=G=SEVWo}IXGNYNdu`ITVDYLi>+-D
zwa!`lU&Clb#reGE^K0Gbh^)0=n<;Bg>WDlCv|UyyM~l5G6fzg|uQ3V(&9>Y8iHpYS
znY3F+z}ifi`B>W+T7ocEfTJ>8qA6J9>2X6*rDu1!o3%N){U^#tX3`{{fDAq$?RGGe
z)Y>>T18JLbX^(pN!SqfhGbV7N#bDw<N!VX0yYdML?#CJtwkA=$Y<@kTy!=^A!KK+>
z`ZD&@@(f3x$)Ya3B}m?OH|B}ipe1}obZyc*(t?_y3XU64h_up)m;~v#$aa=TLjpTr
z6uN|{ytEYQ*A~Mpp<b1#z5XO5`eHl(ZnbC{A2h9D$jHxJ^S&#oW|~1%2*m*^d&F<O
zFcsLOP88O+M}MlcP0%^E>V>;2{+f+ccf8(Y>F&zPQ&Qv{ol%(rAZ1ph3<jl`z<=EQ
z1_t0a)!&-UwQL+N*_J?tKBUXY#dpE6Sx-XAq?)E1MZ^jttUXR-3V9Y-^=G$G5r=8M
zWCkY0z9f6vEjMrP9yZUq6e4ZVRjqSU$~h$hTe!`jCLIi+uP(1|uC8xVY#uMLx)<vB
zCT6BmMxaNNzsqgb^OBo0Yhc4`knJ(|R%dsvzgm32C%Wnwh~~Gkl~_UEF!Tc%ueA_1
zWhPo!IcuLTLp_B!3hwRp{of&9f71@-C*;SyOl}PG;JW?mrq>DK*Y>}apvF0b@vU^r
zJ&vy&j=bLVcy9Rp#H4mC$c;CwSg_mY|0dZ){tfXmxG~Zr5CyNRTTk#D%mMXa0|Pm^
zeQoFuIuOnw_<Ea$Dj%dTv|G3abJC1z_BdN$n<7bLJnfqN6!qlLq+wyuck<BV6`JGk
z7|L{B?qW0JdUu}Y9(X8IQ8TS7?(DMVvdNtIr7mfjgoMoJddpv^HDmJ!s1c@SHsO8v
z^jJ;)ek0rao9SzYWDl23!1wUmZ!+W)Z;CZ%-=25PKOD!Wr^|ucbvi`mPRDG^lvE0>
z*gr2zxpC2&-9gdoNW4_TLG>Lqtu^V9WBox5a#_P?&}5dzJ3RY?!M)0VVM><;k7LUN
zR%7F>%<KNJ^DDi|(57l26aBWj75e*mOTQ!4o?&+5=EufOs=xJb4TsVl<ddtHs;ifC
zftH<k`_i52hv$#PtCwPd>YZTWwNbWxumFO85X&~^)v#m4wSrWG;?4bZK{b5aA%az)
zAkFBbZy3ZgwT8{n+f1(3@)q;gux^wXmKD@EOyU$#^6%>A;Wc$6t-G4&$qP2%WNj9d
zc1f~x83DASnzkH}wqu-jQgJa`7P)+J06A`=eK*P>OgpYPj3;}E?(7sMO>NGX{%iGR
z_HPGr*L}i<Lwib0my8fHmqoF6v|WMNQLzN_ox{bQ_2L(N{?W4e#h!l)pf!!KwvJz4
zKM+{EoVs%FUwKTo&-ldBZ$tVY2$FsthD;|ljqD0R<k1XP`n=szI{{q3h3{+BciR0l
z$r0I~EfL~dI(Mhm__=wdeMwc;IOLtZo3?B=RRoW-;Ex?)4t<XA^OhLZ7X6H|BYO_i
zlFMgA5$|(II8hEnv@Ti1ny1%d92Y%dtRkDV{{lJq_Mi^6x8fYQRb+WFUHGvloVZXX
z_b>QlY`yzIJ@9`=k}(Pq_5nOx;4!#sIq?H`MAGx8x<wFAoCp-75Mu5&_hoV6J(BjW
zg$qQos}KySgLM5HEJAQi@KvDtAfVZZhgo!-akF=+fHtEX@vVlDIgGAM>v;V(qew5K
zU&6nO{7?`FoJ?@3v40LDMTv_IAYvF5|3WG0g~97kSSs*xayPDkqM<heAqF;wf8j;Y
zol>|x*6vg<qAvdSy_;L*hl%(BJt}13`;}5gWQ^<`h8mA<c?sv{PnMmBbD<eJ2<S#g
zR0IhZ$_d-wj*Qa@z@H<^zWR0J<ddXN1j{KZwh-{V8WKw&Wgo-JW_m7-b_R;c@71!Q
zeie)*al?-6j^X3)>~Xtz{XEm^_07_~siXt#;K#q|`*tqb!~JJto6EL(`pd4Ffs1?7
z_xt%21dzh9q1Yr#1GQ~;{kO*LKWQZ|NGd8<|ASWYeEmI{1@`~sm9%YN+X1RL9FTYL
zn_+RE9lYCmTG~23yezsvIR(3{Pbgv>7yVi~+S1SdFJcMb<{I~a{hEUgV?@9qfH9AQ
zN2lx6?8Jd*u6TMd-v%VjW4YhY`^0}on9HNSmBYZHH-ulk4u>G4u(mCnrylh#7z?KS
z>)G?e^5yhuKF-V2u|aO|A0qbC%H5{?OZAGN*=l#Y)!lk-Y@VDwUeR!Am(9ojyR|3!
zKq9!;|DQ+r^?4dqjMvxo7D*gt#1K7~->L@rxpJ0K6FOXgR2Ls1D=N$D#Tq(qFy}_*
zh0z5CK>`oT@nVb)wsyb+z?G}^!Nc(K?`C@GaJ9Pu4)JK;)}wMXzF}vQsb~MWMc(|0
z*`<&S)qbZDo@T?^V*L`jzWHs1m3T4$gD6?l^S_BDg-<Qm0s=D1e`4eCEbyMSwAd?}
z8XsisL+^;+DSuT5z)=>Wr<N7a+KQ5VXmAL^!=S}w&Jx+bikIh9tzg{3=?-Gd2Z76h
z(iowmFxQfjk}rTV<s>=CmLISgO)$AQP6$G;ILd~3n_^&~z--FR7(3-IV7ClnsF?JW
zX=J(MOM2L~t{InGVr(<z%>}~BNR&ZlEF@j!xg^m5(6McCqr^sgz`l~JfAWt<nl#ZJ
zcu1<9R`$eWwc$~#hmzXSFK6P@)vSV~)i~r74)1q<N-9BV&Zge^$iJeJM@(atpiT)K
zOa8fb77F_)`C5l+f3cEaP3}?n<7-K<&x8b88W3CG?2jiSN|ke|V5vDiiAQ*iAbzGc
z99IBXA4l=cNx&TcrM=;7h}ueoiPej1fi;JumBit&g~MAZDPkHHO?Z!k7Od(S8BeAc
z2vY6v>IwG;T07o+8D}l3Qpl#CYxDcK*DX)S#||(5x68d}mLu_8f<Yf@HuUyoSvy5G
z#Bf6|ma;3D;1|w3Jfi@`w~rJ@yUo2Ia8xP7T~~Yv!c@yB5jXTQNIuaOcETe|(AF>*
z61N*tRFh$f$mkmQwLmUqgKd&Q;Y1RUeoJt~<&qkMYa}A0vn15IFCDNQ<QFw>ScPaM
zbmAg<iP>-&)E|z(7ECs;$6|8MgcI-GmqE1E8`R4~T0Ka>*uyz!TYIRNMxy?pl{Ub2
zb7Dkgt2v$Hl{>n0E{PAE(5#oI5FeSN#c$mJgr7)TWF)tkDvf2bd8bA(@54o0Mm?iG
zWYJOY_Pk%#6XvRx1YGEeOmZUp)v$VldH>E$D_?Ac<PR<KHEtW03nbB=A?Bf=+lX8z
zF!s~S`Qh+<sXF`x@FewMnHYzn;s^)K_^%v#NgjsjnFyH8Jzbn_aK|^$Wp*iN%CqKM
zB#J==Qk9tB4MK~(GF|D18^oP(y=Er5Xw#2LS?^#fnqtEI$bf^`!E88vdux!)=lA}}
z%yM7uTNesw$)*S4!MEBD3r9$MP-sp`;pv%!1vwDgmb6?)`e4Dtm`-vO_5V}7ir6Ys
zCaJdQ&fZocK({6iOx|1279vHe?D}Z|Gca@iG$e`}5p%0uFEC98h4|<M`ohNvLBHD;
z8n(_F88|mf0{1@e(9N(AiB1tMpNQ>^91if(s%-QQLcz$tHncsuEjsbGC(issK_aB`
z$y`DhQOt2SM(K@VgYK-&%|om)yxl&9=8wfF<8#S8$(ua1UPeIM*0E|uXa@ke>R;K~
zZ)izKsti*)^ukN8e?=Q`Bd*JPO{RU6m!}}1^ICcFLpP+YNs)P<-i9s4r5#hqiav^R
z6tLll!0Tg-vXXjvW~cj@jye|jJz!=0<?Hf#Qr$pwIA`3aakuQQBr;`*Jt`^hz-?|~
zYUwYY-s&mO)MSNpxrxazOTFZd_WVuTmC8aL_OcvQ33Wha#0rnmg2Mf!C0Nt9!VTWF
zg74{UtL`sPsM2kGh6GZUa%Aom2Rl46_M1zv%)Y)1Z4Km|=&VSDk|K_{gIBVU4#WNF
zXK2l6(GPuZ^DrOqw?9Sl`87WQgB~7FUU)?-H*F?MM*U+w(F;vc+dut;&Bqavi2X5L
zLauJ*jdv|DCFM6;vmm?5wqE(}I}Ha%Ry#`hQ`-*PM=)w5N6pJL8oMSf(o4s@<yJP5
zl?;Mz-lLFsFAAPvD?~G7<zLddP$6A1i^r(}66L5ld8Xj^)mBk@0moR)0JN>BGc@tX
zgxk2~godYf2`b<CpelJ=#b_KL_LL<V)nSW1ls0SOIen4{taV_+bceD#r1m^XQgrvu
z-~l$n*QI3vIAJN-5Df{C>yW2!6BVVCY6>2-^ANfO`pf(L#<Tn9D@GO{%Ur{2qU|vk
zl_6X0wW#iC*N3!A-Y1fOJ44HH^3DQ7bonLRYhBs(WNR>kmP3Zl!wWoSk55jp>WsJS
z?QGQD`>hEahNK!j5tYD})sEUV@m!E5Ovn5(;piRz?-aH&B)>Q3=xWx!6&u}JZo~td
z2D+g~XV4QOW7F38GSftL&RxwG)@arTpGimD+;9xOw!+mIvM85S26o^ESkLlj09c!u
z=70@tL8fppN%<(`@@+4xESGBMX)FT#t%F*TC|Nx}e9xUBM$FdaE@a=fsvCw}9c~2O
zi|lXM2KyN!AI+u#E%u*J@erL*<D)Jk;b{88ztL+letV4Dne$To3tPakO3g**Jo+F~
zjKeq^blF~^hIeXaY>fB1VOb(lQRZ{aqm}tHGH9DX#wx|pITZR@!M~*%4;;S%i!r;0
zCI$hG{_vwtUz~kC&|3uzTDZcfHIdG7p<0VO3j%DE>yJkyAT~-c_nJnUrC+xgaV{r?
zajH|8Wa#!oVH89X+%?une`_LYvs)R3)9g|57#@rS@QsCWn~TSqySzzGq)%ajP>6#}
zNN0scx-{ppPN)i)_~{kXxjq0KZ&Mn|_k*r#l`J8h$%gitj@S)Laz_`g2wprj%4>xb
zYDcOnDy$bQ1!nbCtQ|P}kt%dqRxK_*b!$J*&@3SvY51y0s74*ChJA-fok_(&oK85S
zSg<I`eTr*_dK^8dg<aK1*qFQ&Vi}&?GN7=5(qx9hlDZXF2$2({{-?l4;+m=!6P<#-
zmJM{)Ph4c-xmlt@{?1tQYew7PRz&2iRmpG4bIUO7C46*|BMW)itl!jR0h~W2oQ`?D
z7bAa(+*BUh)!(yd@J1-6jxHow^}{G+XV9{l9xoP|Y}^)j#!i(0ppJBz&2E-+lk2o2
zuvo!IrZhe$Ha}<|vHtjpOzbNe_isXldYH&a0JCG_XWqVbzmYG$yuPhT#z(JdN3MON
zINY7g9X~o3)4*OMe;j;d2F8|GmAsp4%Vj2k2j=sbOlk5LjIt}!NcmIYqiLcBQcZ_5
zGy6EEaK&$}0I{xrxo>>Wwu*gyzdh&Ye7Or;Ls2S+v{``hZ+v&PEa*<J`wLjJ6Z*CN
z{l?5M6{fjfG3do}^yk?9w(tAe3i#*(eQ^iBzCdiR{bH9wvcPkJE66^9sV7U?C1YKi
zGql4a2ES>VCE*4CHH>o)>hlrFr7Eh;Vd$HG`)q{YZ+v6Gh5<ECVLp$e5WJ2U=3zwf
z8H8eZL~_e+%!$~-6%&f(#BN~D;Bf#@IwwUQ=6BuzbpSI_dL%N3Jr{gQKwa<N*Q*fZ
zL9?PjHQfg-@v+WviG4_O5$T_{40*q!a-`|dT%=GpPra=Q8|4{lhtAmbs6Ep$-h@2`
zC>g&#d6^6a3cp>1N4Qzu6|3O%Ig+vfOn3#A)nB3zVHb8)#?*c({5G<G41H{a<c^fw
z?8{m+!}PK&bYDQ0H<PAFs_XQ|6z*~?I)~KoU6)G^P`J$y##(PmZ<+gjdq{R^z39j6
z%f#oZlw5Op$7HuQ4&k~bZ!W|)NF}}#F#gBZq1UOESGr+u(-kxgZ2ZF32N>k#R9vq!
z=YY9nCBTpL4s*d9u!TxyBe)i9>~*oLHfR)~{CiO-Jtdqe%s1_0kC+^NIE62VA>#`H
ze?5r&zW{kahQFi>)G?Tki?HA4xj3bm!9r_xM6A+r(20^B-Xug}UmwfiskJg_s8{g?
zQHa|Qy2-;CLz3h?FPa`tCS;s|q)r+{o#|ePFVuJ0$SN#KbnU>?NR)U2M2uOkf|Pj)
zHfC<!_hV851!;y3dU2T0wfzOqJ7LhHbg<7<YYG1M<Z-hm1D?cvVGq4f%=BSssT#>M
z7X;j9LBVda#z1I11~MB_)(Kjoq{)a+PqCvih}1N;x4<|73&AMPlqGu957DH<^RJ{6
zJm#STp@gEACmmRhqs~<rj42^YCsp{})o9>vbx%DsrZvr{TI)dZqp1S5-iywoB*OgU
z$5-kh-HyhX2qqXA%>n6E9jL8l(@BU!0C!Ii5QAXbUJen0BMOs_{-d)XK6D^9vk(!^
zA^=?^sMrJpF2>WrEBnboMN9>l0i?}YhB0kE9lM~!B?i{OVmcVrlni}pzx^f#QdURE
z@f_rR5_Xf$AVMw6BQM*R`yNOgO*B>>HK!JVwI(GNmmlf`7MR>3{jH$aUjH{a3MsAt
z&85unrKnmWsL+8afP4^!dC^{P;4rH25@QmlYRO>j(cm_|m&{H{glT5OQQSStf=MuI
zeUBmC%R*x7NwH6tk_3Pu3`X@0!^qZgUY>d{WUO@)OLhkQay(}hUGAPOSJjoEh+hYD
zqED-H&#9wzc$yJW8m#~}w#hhwj@Fo+MZhp{+8<gD{pR4OBDT!hMSWkDOomJ?O=hmN
zOLQlFtt`iv0^}kLfyagFEI8-X%{^Eg8XB=S*ymaFfkRb4#zpkl&X#ohf}5-0>_2!|
zz4zGmaLa31tGbZ`<e(5+SXVe6?)|2hoB|;3!J;Jq31f{rBDRkfQeHHBha@|=Gw23Z
z9<8be8HVbhkcly!slGw*s_GaR_$OPE=)S(5Y0SQN8_-t4pZ(tR7$N}Xh5H=UKR$8i
zD>s08oZngJL_66)!7N@6K)gPq`E+3M!wWJoBMGG!>zN0txv&5+tvL5E=ypLu6^ZmL
zzQ7#LSNzIatD&S8bk8&_YKHg8z+prvbn2O8a>v{rIGJSXhIj&?7vb@E5{$2G2x`oM
zh7G=NQ6{zDS6Vf-{Fj=-zbnnm-`um$JoEzL17!o6K?puWh#jv)rcLVk#=5|B3Vv{j
zRuf0QRGvWKsihCUc}pM<WCO-~mX`2Q<Z27}ashWXdzoFl%<8z#nj|0KRl;OE8b@dX
z0(-VD0#NX89n0xWQqm;t9c*px9qqo}=^X8}k2<e6;Q;IT@J2Bm0!_j?ax#?>f%XnW
z6xPDD5T=!hEz&HcQ{ec0pf?e-2S&^$GnRNn^xn&EBgp@)*v6ykZ0NxR@1*Tse_#6m
z(ta-ZbVLSUS5VyUEILJ=ftC(r=hnFgF$vrUDVCQj?x%xVTGJy?%d}>3J)zP7uO@cX
zm=&;AzSmRtj@7+aYxiES-D{U?08Z-Y*h23$Y|PaI`v~UF?0ry@TL@DKR!!^tGlK(~
zy`GR=vLv<oXX~oJe{TQd-T$C6Z+HLYZMQM|{-?S8xb--5|MRf5^7#Ax&$sv##_w64
z62GTZc)?Tp`n#Q5z1S(S*l|0zI$wI7Q;5QiZ*y+r8t0boZ`3Vb-+cYO%{&)2rCYqK
zxxI^;TfC*YwJVz2xSzR|%b8odnYpcNncKRPxy1{anYS@F=KtRQf4H-`{d%V{=-uuf
zGkgDEU2Z<k?f)x}zVH9v<U^M_JnwjtqT_j>PSDtR@gEbsW*{T^MYD@E)X(vRVkw<O
zu=(&=9k)@;f1259QuUtbs}aQ?DradrO4gQ^^ph%Z=y$B;;yvWYQr-KAU_sW)C&=8#
z;Ym0i^Y%gNGRkRgm0-!D<l}3ocjh)=5C+49ji>|B&g;#N)EOa1iWp3238)N2bshzH
ze;LZgOTlJQej%+2XRX(MgNP8fU*|M#WUmtTc}qRodZRcgA@AA%lobAmOd5CNenYim
z*mO^zj|kG-kI-2EV}i~S0S!2mxw1}GS%hKJhu>%HKM`EPAa7?&=z9jTL5IHcppY&N
zrarvj%@vN;fWru_X2S%eDiLP@9Rz|}A(9ROkpX&K!K+U-bm|z2>*5s+Ptd<W<p;}(
zwgZuFoBF{?6xqS8!S{?jZO)wG#ZG{B=xF%K+EF4M5MD6t<*<Gp_kryCVWY%OF8*~2
ztI_;{2nVAxO7)az=eqC&M2ZO0sFC6{Keh>wjUYsqrTyp=UUQ(h+eb<gIL3oT_b@+G
zOdEaUdK0KKkof9-7(p8N({V5u&_#4GJe>rm)Guy1MjAo-9~uqeNf<DSG&1BeiVp&E
z9;by$bb%<KQm96VQ_?*nbf*(aC9Mbp65)CP;20$T6h=dmdICbM$wOpSa1P5}iU6VM
z3-!}D?y2xHAo7kR5KA=tWTiz~y~H~B_UqEU#)mQN2Hi7EAj#@%@)6WAV-j(QO_^7<
zcaC^Hy@W4J98OUh4SS8J8>5*>uSQ|Q<FJSRJvB6_O=^4tkG#yE{F?Tz0MR`?gWm3*
zP^g)UU`Ph#pN6Ong)WJ(9vQcPJa|X|aAu}-{fVAQysUOXNG8EoZku_CERGG8Wt~fD
zJc_!>5|*h`nR<jkkn(~01b}!{X{x<K1>x~HzM!P92ofNsu;4V*lJ;Mgz;$-IG~X-0
zM8D$7W18>5gfz~i38toL0%>UhK?-*6PEi2YdtWL&pG199JM;Bw@kSv5{&1FQH<E*B
z57`rC5(Sa1{Wth$6b_%aw`*{mN$D?!7=tg3(!0>y;~qz+ct(i=KF|V*W2!;@WZXTA
z($J+0@;qHxhI(lUe?NMNUom588V(Yq7dF@s>=36maIA4;k2_LURb0Ce)gA!J9JH%U
z+mmrgW5`-`+|GdU(SZ`aFCK^JCv<{T$`?3>ed3w{PBI39WxalhR)!b|;NQp}C#?O;
zA`J{;&+Arptss$u_C4s;rw|TXF(8OmFTC6Bwe?6+8rTIgEP+;W?Az@<=reGcctq|~
z{pffM0|BeC5;jg7CHS2r{W=uEQQ8iVVaS)>lKfRAq{fq>*E)#(yL;OmXmtH5OtQG}
zu=a}a(J!aqL&hVe0QtnR6fMLHkFm~sVBt_=3xMIo6`~9xf2aL(`)KF&wm~`=jY1X;
zCa_vAEi;h)fKS(y|J4TuN1&IT_S+XPcK^0st_S_JTq<cXjYlF7+7y7IhM=v-2eq<{
z6kOuaB*)&e)7BCJb9h+U0rB>bVw)5J!&k&9ksh#FfCm$xZ9wQ26BF=Sq6uje>ZuCx
z)<{p&$F$q8r~Tw(iPi<~n^n_PV`%~#f3kEM4(kZ6-UXp0X(VUn{TS2K0hV=yQ7V;Q
zM3>k;4-IB0?&G>6Bzhsv0f+!N|1hh(6-m)}MEgo9$9nMU3az#L>Q+jWyAhLX^&^x^
zJ_?UUsi*W22kfJ@SqZ#k-{X)G@W5+f%bJNr!xD)bj-Ctmako<U3|#;d627524l`wj
z7C(KbCJo2OQ<&KiYzZGpU58cZrRD4;4}6Nw>9_}2DNo@QAxj1qc(qNGf%YLfFSDn>
zDmhtcjWL`U%XIr;Ai;6CzqGPsXh>O<bjRqpDx^Uzp&pAW!V){vavMEZQ@@5BqXy)m
zNl*i!X3TVsxjct)l!PeNpnw_iW)EByM+e9Y)rKBTup~jNN5Lk4ik{EISZ!&BKQ3Xx
zfkgNbCf@_x*-B_M8INL+_N&ZxdANYrf_x>*kPWP)wHnNGoS2_PV?wFu;&_7bgh((Q
z!pb1jqa>N2eE-oOl#hD68)j9Q^<Y-NunuAxFv%|Y!`coCSOpW0VLCh@gonOU*3$;e
zM#{>LsRvIKiiU8YkMU$ES;aLJabQ<LDcdiT)i{n*yUz60w-%9H6=!J|Z37cpGK?FA
zj!49;b9^P&-Wi4}tW*n2H7r^3b+WK8jI^vr+>4!egYGAg>v3!8KEhq29<BW4k*d&%
z27sv32M_84^zVfd)rJUn)=}Tpg7cC=vL(R*?O6e#kCvl<T!R(CzqelOZN6;7J~4nE
z)CVZbtPjaaxvciKotNd0Nd0(a2}9>jdYi;qKDFS{OK0+x(@&u5@W^E-gM`0f=tM%M
z(fas$b8qip>m%#{=g~MG(oSscCrw>Xx|8$-WKNsV#@#LPibn8)R?X_P!^>_s(#Ju)
z_(5jWL#jKX1;&yV-}q3fU!$=O2;kWCao7!zhZ$hF6QF(}Bw3yg)o`SS<$p2`PVI5j
zEHXHv3<+^15v@rQ5Jp3NrEzw8s5H;Yi2*!>>og1qMa!DHwm}jQcpY>>%2R*SQs;DV
zx>l+5I)<Go9!6c@pK<q7MhpkSc<v0kb4unFV=4E|L3{Ua45M?3G%#?&CIw_lQX2Se
z$<EYJ81`WhCv;_mVU7&??Cy@Ck63eo+7sNr2~#;5=*tI?VR4Ey`#?DxAa4b7PopD+
zBfn92s##O)49kb6xF6vb1p8=X7^X|h&DQEt^U2aEN>9+zyB?p^kJ?*xipaE-lSV!1
zJ+zoEBo=*~t+AX4sRISGW0vtYijt^D-)XlG4m(>gXMY9x@27Blj9Ub?UCK;UZgPYN
zV-WMYHna!&>Br;fH#|X2($OS!7F8pA{!PMApXtw~Wv*1q@9};|ep+t<LLw3tobPA^
zL4tF47I(37LZiu8^cb9Q9S+5&l`e?+<E|A3S>;Vir`$1KRD*n4=F=#`=Uqn|$ssb4
z(fSS1XpZjVf_`ZP=PQuLV9Tm7kH>pX9l*%JQ=P!Vtj>d?T0$Uj<X^Jr=<^te3~a@V
z8qvNECa4eXZgVhmXmv^ZyGGH8x`LKhB1+h0>TW9ywZjUX#1XqaH0yPu>nHGm@1k0Q
zuD6ySH=6LjmU^`E_{o$mhH00dEMXz)BLL~gr>qYnIf*tSQ3jd&R68c3ZcL0RHph^f
z+N~0HOZJBFG9Xon(beHWtC68fb4XdsGCm^GHyjuc4R?_$5!8Dq+!*veRQPX|CY@Hk
zXh*CGempFpIh{zvetQiB9+3D!kBW34jDtS&O~@n~2e{jhh^(Q$Q@NqqsEC3E>rI2!
zIiPfjM++3)#YYD3Rgp8HTvEK23rQH7myjCpYeS7FydHes9PGbzUyv(B42&`u)8m7`
zx^GYUEj=njk+S;|vzM#Em82r4Hx&uCQdO<FOD;Pl?Ld<1)I=@7D1$<RqWbI`a!T;J
zW2$<Lq)QV0rYW&lns&}Sa?o`T>=Egp;oZ_C8MCMM(s87DUT%jF2tHYS6otVK>I#<d
z=(t2vykuo$srONzdM={mOjBl1vR4$C5+ND}B0ax$n&h2@u+mSQ4lr}&jhj`re9(_A
zFAqz2g2CflG?ELGJo`+vj312frUFDoG$O!cd=2A!20%-ax>b5ZSQ&PY>mndI-mVVD
zNs9C7T~A#pO7*Til4A)6-5OaHuI`w&st%+Ztc|7vKC10XSW&b`*gw`MX?ez7R;1l9
z3rmpc$W>QzRw{MS1E#a4KIYziv_nhEJ|p=3?WrhpNF_s^Ac+@B^ih|OnqWbjAOy)L
z9uB%7`o{#PUK^lLfrO$_IA?QxOe>}C?#%;-jxVT3I))?ADIM!nF9^}TmNoVSkU12J
zuE-sET=3Wk2Rd9&KeHC^7>#Cl2Tam<#9Df)$_-k+FWo`b-Yb2iEeDCL(c|UXd4`(?
zU#V<-^quomL2=xuJ^~(Fs17lfF1~umu56s4HTC?;DM<%68-m}A&#$lywb}$Xh?;1R
z*xO-<e@g-BWMDLCCg_&(CD8BWxJDjD6h)ek8)RTZ@!qhI4j&tm?>?OBMw8<{rhAK$
z?u6`S6wb#eVSy(&rLfYm_66jXOYmXNMBKo=At{NF^Sr$cys{e(6LHD9ayhB2*Y{#*
z_yH}jX-~}R$CyKkHY#&WmyI@&fY<MhF$+OlHW0PtP!5LKflI#oof&1m&qiZ(vZ~g8
zl2|PXyOVK5@n=qxrSnOD7|JDCL`pU2(VE!?PH9R&IvI#?!~Y)l<Kv~t&^Nj)0p>TZ
zX*+H%%jF1>l-AeRjdY7l41HF4DcBo-{Z6hiBXR|laJoWJKs={mDIQzi2^=fnYxqJ%
z3Mz15VfXtD1=|^2i;&a>bC#5JgU3N4noU#%pngOJ#7s@>bE}A?t5~{Qy1)}WuxwFt
za@(%T61aJcCyooTD-cfvrU>FVl;03fSiLZ)$w8BI8^YqpO+lYS6X7J;%U`Eq7MlEP
z!FQqh6k=~gPH+|$Ud-~nDGRkGvrxn;Kyx21<X2+5ewr_R9R^%nd?L>#r=b%7iIj$V
zZ61>#%8K3+G92LS@g(VA@y_Otg5zf?ihci*5-*Bqu_G(&iI>f5_&4Tos!3`OI2_CI
zEDX*gIzA4>%m6FGqP@bsfF(y*D(&3FmH4!0MmVFpBkD7b;tn12;U5JMnrKqHm)Pr?
zRDdCL)x34)@goSVjuM{jGKTu<x|ESPU=7IaH56-yII3YkV-6$s6K5faU0QfCSMs^2
zf8ix?lhmOptu@)=+jeY8*0pXARv(HWAzfHI_Y0m)hwUI0{8)1C8Bh+@uW5XPaprXH
zECyXqTY%7jt+{icr^>gss2PJy=<XJ(E(McJUAHrS7t~R=Pxa`c#HnU4=k)%LH{?53
z?ht7&wdyaUJ2WF>uE$|Wp1R^F(-?wCTy4NdRH=Q$y;W3KXy1|2$(tDNNg!6vfurzm
zpks1?Sybh=$MnI*X#S{`YajJ&O1MX@+_1V-a~sb)FG*_+$M=~ZOH<Yvi?zu(GWtG>
zmbYu^>q#EWB2Gwo8%c0kih2Mi`Z$UBfWTK&ADyk~Bg>4sQCbFU8)ivJOn1aG2q91i
zScmswHz#O7f*Tk@Yp8c2N_i*1{}N(0v}G_My7nPORLJUL8uPGME8*4=kLeUGhU9Fn
zAXH&CiiX6M?y(6q4+Eb!0B-~n(?ZsP6HY1qI{D>m?&hs>vdBh#m_0cGy90h&Vv{m7
zNkNGMkEe`$pG0sL8PTt)uWdR|@jM2~zySpm{xOLt=^-3n8tR2spt1=zQX?W=;-7R9
zIS%pqj`oEf?W(vPqfvq!bG6N!Z^j1=qPm~evLChd@lnA#9BM-k>L7;Zc;QIRH4|(@
ztu&g#artD@{YXX<`X`)Icz`d$F)LqsLS0ajx+1^MKKcO&a1X*Gt~INYX+bScL;V%E
zVho62`lt70On~Lw`SW<8OkEP0I&t<z8zxz6(y1@mp@2El{job4+e^@q^NJ49b}L1N
zPhjr$@qCtuxs+3gZdkK+XsNKhHo9ppn8T8ho@l{h+&>s5+VtX+l58-B%h<7RSk0Qq
zH2%&fx3OAi&_gIjh6%;s1ZkbF9p%PXJLlPXp?Do;#$oNE&~P<El3*7)n&39SZIm{N
zgE*`K15zYbsyA=}2icmqJH6wNWTSvaI^)3J%Ng6ZM6(SVRf2_!so}uTTAPoWnzSaA
zrrRq?hMrt7P;RztT-*E-M{~&LU!K9E3uh4EelK9O`6bt{$&6xwn%Gv_gDF)IWvj=6
zQ}KCW{T&Y<%58}m%Ye=AWXsK%i?JPn8D+Ur<^!0v^Ru(#n5^YiBDrT%b-FL)PBl=~
z#R_sZ9zo8gNrWh2i^_e(OY{rgl|ORTkIbK~>pR}KksC7itESHi3t9!0kY-gc3&012
znU5boc7<yQN;-}P5}U;BOkkAA^7eRgVjV++@o87`!^FqGs>MZkaQ@V)54VriV(-|N
z$FMhv4VbDHak{QD&Z2J)4~`BxhdXcfe(r3&db|JE&hwv-cG}_~ytJemjRyD9oltyQ
z`iz|+ULzgJOj}5%(v}FtIGI)r*7|tT`zQflG`R~LGFN5>(hFIfjhSq541_Ub??1B3
zmUhFnqJ>#F7AmyCaxdAEl5i5Z$1bynyV2`CJ46z<DP|KX|0LQ_LWt?<`iQpOlL6tQ
zPXWT$4VTpG%ZkyXV2oS4Wc2lqd9LTXCpD4vHXm_Vo+kh%%23V}IkD#@(Hu`19qJGf
ziwrgQ3+MF;_Q<HKm0cJk2HufXFz<4v@6vVP4>AnW9aJQl6p6AXks9d2Q0$A@Zpq3d
zMyS_pjOl|+pUlN=mRzt$STAJOS=vmDN(ePLI%-vxa>)^{W+#_-6@7I>V?a$D^DWOu
zT#6r^J(8J(bEXmGP;178t<0b)z*#L~Xnl+l@uKKrakoO}cXz)!pc0O&ze)2;H;@mX
z=3j(EIPv1eNzu#xc(S&4__p($9GaFE@c|qDRK{VSBgxZcEA1Nal5U5qZqy58IUusp
zEr)G^6A+Bju@0M#WAL<8dTtaknSGVl*a+P`hgNJNy-m(Sne<0Eo_NaOSj!mJDda>&
zbl6C=--A(=u#rBVp6D9kREY^2lQ1gU&q!nQ5t|SOW%)&vyZ<BuY?ka%tPsvo;yFZE
z5`qGk6pzkF3(j2pNpZ0NAdeH6u&`G`DH3gQ$YlfX7!sqvku#bE7dNFiMwNPj_hxdp
z_z@=HV~Ke!TY&4e1S0(;=-UxDP7Ab!9`ngeVtJ5f=y@={Dv<@Cwj?0@vF|mp_@n4k
zVsEIa?jva-w9~FYc9If=m$1MS7&%r4I!7z5SgfJk8uE1^A97Hu6A*!Ek^D>ykU;Dv
zu|gbeQ1*hKCY~GZXFQmti_qL+DN^wnCMR^oml$KTku^GwK)Kzp@^@Fu-%(<6H4O3U
zk~LbM5g1o-&ypWGe%eQ~DV5mvC!$mdK3~z=lZ+OTEWW%`AW7(xQ7PMSgM?QUu2}Zn
zBGDULrzL~A9vyW6rN}TFh!&=u@N7OX1S8Zb>_2;yu-X!Kn+R)ilcO&^LyodUtUl`l
zfr3EzS_Vs!snA%T(;+vGM?$g;h&AYV@)BVLH$z`&y@-wUYb64a3jx0fXqdT`Y|*wQ
zVA8FI9+9naOgKfwl`Gz6ZVp1feZ(}HASDdDS7L`LCqIm%pL~+dmE5+yQz1(f$fa>L
z!(Z{Qq3DL#ijKTRhBW$I&?qef!p9-J4BLG;srndmejJACkLd}Tsn%R7(uzkd<J2U2
zro=@fTju~n25J?vg=RH^dhPgEHhe|J;dzEVJfpJ!dLE@{4#0|~f(6BgGVF_VE1&ZO
zHx(`5Iaa@7E0ba%eY%K{5^``rqNDgEJC`FEh^?z`Kg1?9df|E0)y(r#cx6mc_57gm
z7TFu%eHg8xoxi==J>2=Ij3q2IA(Oi!z!HCM$gYvIXp?MX&@a*%pw`QJGJ46}azZ7r
zo=bkG_0oW?_GptcwKj^>2PJO$h&2&LhLH{1ci^ds-~5%9OtllgBaYTYP|~U1TyZ>C
z%zB_%NezjRDb!jrTTent{X|(WjNS1tOi}rP60gg+MUeFSv%7TQa0d43;^kD6GjbwU
z;dCTUN)=If=raVe89o(yr|hIE1WTFP`0(j-Po_>u(@IhzaWX@dG<`v@cZdS}B5fbA
zef3EL;an=|jrRD;(tPH4;4Ttz31L~wmDZIbzS>LkV+;-&3=;{R;nxVXu0R_t_)AZp
zUWopQtdC+l5E`trjc6G|)~vP>)CUp2ZRSU^euR53Vk<<-%#U~pk4Y^u<biZhkmFF$
z`(Hfcy#StTv6D@H5nmSpB+1V?5EA}$gv^`<EsJEATkZ|B1il8|9YQak(_^P)SG;iN
zk4}^>d>8C>he}NU*mW(8<QkV0iO0rv6qj0*N|<4drmzJ>(Wv~ahK?A%RmS=xN1`YY
ziF-Ze@<z-#XotQRnl(}*T{rLTdKqH2)Wp&Il!ExA!6(;o?^rK*=Tvw)p}TfHE#mT&
z($Q3`e)M|bA=`dV&^8ZVlt$=9ilRn0wD)z|cpO!xsBd-3uzxn^{L+##N1Ohr4Nhp6
z^0qBW(5obFw9$2t{9R$KXjM2o-M%_$UP%MR=x}whRN{b<0U6g3)ZSz;(z-{2pbac!
z=Max;Yv`nz%10X2j}E4U+b|fx-jpUKsmMNyP@Ja2CjjkKffZp?VG?<h)8Va4!j#Zd
zh`ID>NGF*Xy(YzYD0>wnBqz<$(au=Sy4oL$N6F4Jkj3VkU8BK|FA_(2VwfaLmh#xF
zW26gx|F1Q&4rLDnUn8p6@WInp3xz)#0lswjJRvtRwhwdnPLUUpJz{WLV$eL2p7zJZ
z6p*otVoUst{5@O?>XhbGN5QdY@u$4wGP4kseWRp}caaY1A==fuY~|zj&YozQL>!`%
z&XwC5N>e2r=a-jDG}cEFjS5{}DZWp@ORu8VO4*?$l0_RrZC1cfED<G|1d8ZX`(s(h
z?^5g@U2$-94ofz;5LGvyN{yCITi<8SNJ1b}?L@pzILbsV@X{$)Yp$|;eeU+1#SoCp
zKTSq|4X+L{JzQ00#yow8R78)9%nHz4HkWjobD9PToaCZFWCJHRDEV7`#4w2;^&JD|
zW;E`IlmnA5<c~Ld1|^gS(4+<0VWSo?t{vfZ6s(vO6JbJG!!&V?B4ASI`4=++eLKWx
z*jUMK9#}&+=X8Nn4P!ORe6@Y-)f(ca9AStKjB6R1cCe?$JV##&ne#nQHtM8Iw0yD}
zv6P6<a#XEvg?)``Nz_kPt_^dlN_#ott7Ir5aG$q(qw7SQD!QKer~&(T{e4xyfb<f!
z7OqzBla>Ne>e2kk!PNl}8xff1PAb+!v=a5QXvs=6``R(nYWmm?BFwLuRLl8mq6O)W
z55to!gkp%k7iJz7k-X7UEApz;KY#{Ap=WSp3dIO9AvtmM;ABGGY&xnoiZ&v8JCt@<
z?qMQkm2c*3;EYW}9r?x=a?l_@n&N?F4VRgeGfsgJSoSV5fXt2{(xzIB4obs&@$eM?
z(<7(7M@^dz_h3b+WvKe&!Snyw**bDg!X+m}NLH)HSrDxDOGnqxrr9=Digp|awoCVo
ztZ^!l*)|>pqm*R{_9Q)JuRt-&rbAQ|jIEsIu1#a^CKrmjcd0h+$X~yZd#AQa<Rhbd
zVpQX}AC~m3F^s@LrkgXi0NXy^uRBBc0!XOc4}dMvQHqXh$ijUw#xjn?DuQt&G-~?R
z*SS(g-7A{R==)(;p{>urELL;s2i>ltp15)wUMo>2$XJ24cis#`IbU)PMwMI*yJzEg
zNHlFGCLWsm97bm*!I?Su*#3EcOBVYZ{_fn2vF%(bx8hwPl~X@kq{QVZOfS&j#Ze1r
za!%O2I96gD8M@=eHV;IKfpehYyKhQsueO-Tc|D+UTL%Q%vj&<Z!FNi)DBoe^%vV~k
z`qyv#hPzEK!(f09JOjBr>H1=gju1nlnw6JnY_-rF>o8Y(yEheWf)+WPPSZ%p6+;rb
zjk5YTBc@sOtcp>xULYCuPpn0jnDSlO^QpuZVTXT--(oCb*j%EQhyd>B8<~3ww3_6U
z5noNmkXlmLE#a+xkq;JkXvotd_8g3$_`b01pVd}LtSv&CeL=EupT@z3V<4zy1X*#P
zK-vt&$T8}gR)+<X&TiJnc-M#RBC)Y8ij3Vj#7D$+JsUC{F}jCk!gD8TZ=(HD@SS3R
zLY<4Ge?@auw{yk%o0zZn&Eec-#f27lqV|!A4TtgM^ekiG<oMa-c|BqYM9kYS8^ul~
zI5C=Ss5c;Ck=>=(GZQg68w~q<lX`vj?xGJ~dXG^VXHf#|;^l?5Fcu2$eWPA;Qo<4X
z@P6e3x(%#2#{b59Ou{@#19hy3);B>K53ZOjyrZG0QVKP{Y&Kvmw7fG1(ym-`(>2~n
z3<EgU8YJNji(NOQy^b<|FDci$^$j!vdEfd_-x#H14%WUMJ8?<O=xQyom#0B1O)K3R
zYfl>SCk8@~^J%cOy@J5_%!0LHUPKf_=km5#;pH5{c`?Zl{9fk%muucQ)Rt@Iar&ZM
zYu50X1b^gzpKB#;&BWn*b?CE?%Z5`G>B;@}KZQxH#EHf}Qac~b*-#fEL!uh$F|>hZ
z*emQv2_2!tv@75DhK}yz){`>=DPSm&4TWlnQn^90nqzMYYOpV}u8`fVjQ$(N98xi7
zh0vT<#Z~@)EVN*ot|reqWLSrS5(y4$WHLS{-B0MKK;*XFs$hK3a5?}fiT$kbS}l#Q
zY*{f42y~dcaNI=)3^{k_8HyvKx)#zX4SDuleK~1cyA~`gzKE%)`1%~K5)N9ZC9&Ri
zXeaG^HlBt3k$7(kA|fT>&2*!LDfC3mE8(!{wvSBVFM_N5;9AF$wR*Kw+8O>DU;Xes
zCBVP?NBqCpq3rqFm+e2Hjceln!^@RS{NEM$_C5aZxA^F&1x99`;eALUq>}Gz{y*vC
zt^Wp3{L(GAflK`H<JIZwzuC;j|9-f#`d@1GmhmY3{2yQch4a7LZokFUP8i+)Xy>cR
z;pX%I=+ScX`}}{4&ph+5qdk0SVt{M*|JEa*4R8LJTg~O=@B9C^_@K%FO)S>b|H>?v
z;1D}W*VJb6$yGM8uN-<UrcnxKWwr4Bf8Xx3F~7!#g;GB_4*Ll_Tqt3bsncN?@~@H`
z8|hQd9Zy1KV`$2B9CSaSdc>H}k<J%2b?AD^9_bi$K~lz`H!3?TV<<N{QoB|(#=iC?
z--4t2yA!wsdnw0ODQ_C)3u3Frdyj`d^i{sfr!iPE@7RLuy_k7$67eWWZ558J(SUQ~
zX+I?C3OY9#EZzBm|MFVw9al9NHt_ohhx${D9?(u<gbtujC;j+>!2;9-pT_c(pqfrD
zLB-Qh0+tZer7{0d$>bQm^rF<jxwyD!@FN!doLZ!b9(T!g6n)U|&?{RrJcc)E18>TP
za7?7Act1+vWS!wC$}`OcOgL#g1X~+^2^TUpv*g`@2FWLLCdO(^Qa!xI=0p`Np2D<a
zL`%hXwb)Ozg`*?#UV!eyHPJXa%|x0U<VuU^VF9L{??j3wU5o~6#)Vcc6N0YvflDm7
zD~D(q&*h{Epj6gTucmu)62i!yn0PB>7B4rtkytwVSg%!YVg1j;|6$Q}cnN;l4shN1
z@6k#t%l}te-}(PH`B?t{d~zy`R__3>P=z!}OtegiM0Vxy;{Z9b-4UL@eR=(6u(-G_
zDlTHK0AO*kRN6%TJ5G(~m~-6)CD2P^@hG<0(y&UKoGeo3DHjj%0zDq<RA&M1H_?Ff
zeLXVM8<8j4;^NNbi21y(!iZ#0xX@vYLS38!yQ0k*LD{r+Y|d>Gff`=9R&H**KgsV*
zftAihWrxU1T-Yzj<n(2qdDee-93*F7!2zyY|EsGHv+MuS!`Aop|1Cat{cqtcXE;Ec
zc2Bh4bzhq0zIC|Sel^d6cVXkgc!O8+`u>4#9HoVRd}{9P*$6wvO9=oEvW*fkQYRW_
z<$Ry~1I(2qLKvZwS<g5uIE}kOUFe!a98F*$qZ2j$M=N^Df^Ic1W^yl^?NXB0pg&Im
zPpW{t5e%=Y|B{NcdDg!q7wU+2(T!Qab?3j<Y9{~N^76{+_x1lxK6d@T;91r_WR?ZM
z5rUJ#NdaS6ZyCY<&bxWoz>(eHmf&z#r)c{&tE<3=9dk_1qJ_J$vq|Qwa^T3gkFMk5
z6>Hid3EIXq@~X&Tvtfl3uRSR{TRJcoZ;oWpCyQeA;UfQrg>#M%98rcTBO%yQh`UZ#
zJGM!^a#h`6h31+&;gDhxdsD-SgP9YB=INRKnlK1Dl!}e(bo<gwrqORE)qMZV`<aLT
z(+zbeNhc>KUvvPxPX24HKFZ2}4<A4L&i}u~$MS!&Y}8zTD;O@MHu^OuqZU2g)hPT?
zy-md2H6DgPn2q4NJ>Z|++wY(3r*QqFK@MsYliRro{DS+RhmV)P-~W7z&o%Sk3!?s2
z<7&|Vnl@(h|7Do?EdOt=EI<0r|G&kDdH*&}bEy;$F-sIiLDXlxHL{50@P-&RjSV*M
zP;BxyhwMY9V}t7;h+L))$AV`4$%h90y8urUOiwmJGfRHo9YcF+p{bf`5&s8!#INx&
zN4}>temvxL9U_(MjVHsTjuquC`E#cnZ0%%CiRp?HtaN={EjU&z3mnTS8icUX)d$gV
zlHv~4dib!}<e+bytc!6(pW!t$7o_VHvXX&n|9!qJ?|Jwr115JH^E|Q{@Zrw(Zo4B{
zdKT*MD4Ce5Z}an`o%Yd!2gGzkfc#<XW0MKqa*WbC8W`$)3Te0hm&PMg#?5hvj_%~}
zRj=z*JoP#{6k|e_#K%0w83Eu?u6+Zs&V{gy0q6lqbZlaZ<Xa3wm+>l!Ve_ndQpBr<
zw{3ZBlX2HiDnp||`7eBW!dSlbe@l{b^Lu?Koq0(oGyTI@CLa@Y!LC=w4B-F1grM_)
z)wlN#I{duzw!Qg$Z>Q7V{rk>$I{8vMp|pwrK6Ei<E+x0?{rkmJ?B|{|AZ*^qfBS9h
z55H6OEhdE}u98SE?{Jh1&JaVl4dnWchhWa(Gc=AHl-P%3fKleWK`>-H`anm$!->xK
z=wE`y-D+RCji&wN-*I&m<O~05@>P<Z+L`oO8L8(YbO4tl_dk1u%%oLGo_(8iUDUEE
zJ*~N$ErFsYbm3_&OxX~kxX!_O{%z_0PoZ>6jvO^!*>O@2i=Nhdah+eo;+snT0Y>~}
z->|7f{e`psC3qTQI1l=#<7n9X_n`secpB|LYd>c>V=fXhsMN0t$;iHU=t0LtXldGj
zp&p-xbqR-cd%~w}91aRNox|=`F(%h;rgo?tsAT3^kH^s|49hyN08ChlSDrYn>%0Z)
z8Vz`dCC=gtB*yL;9$D6hv3@4jlULC7B<1JOl}~jdj&%xmO?g!7=wP@Glif%!)0x}6
z#yL7sr$D%>{twl>R8sRPyViDt)IP!NC93sQokY1s@*i>7GLvUBE*BoP%HP+`eCtM2
z2?m0WlgEFGf=@>-7{e|>&8$8CrrYh+WB~JIrtq}ebqn8UJI;U-6NYZTkO=;h59XR)
zZu#W#FGebiLtV7$^`zTZ;VA6u2h*y-89t5UeiEkj$7KAGB>g(sp6g$h$soufg%9y+
zmGft#d3jm}8K6%5@B5MHKlMm72)aO{yxuZv(S7x=x0}yN&)1Tax5@p7@K<y`IZm=C
zn}418bViXYoDXyrLA`!H`0w*(qt$pQ<<RJF&CDv+Is-W4i6e1c4ZCY<jDO5C5XLc#
z)0!H6IyF2E*xNB05}y*6><7csB^1o8?vh4#!~9fI^8S72(aq>;w!r2?e!cnEopo+;
zHqR=?$1<5I@3X`b^hZ$q&z9Y|l{E*>t!}*vR_7-)YGhq*{n*`L)r@=GdC$liJZ^{>
zn0xeR?pptvTtx`wPr7yecc2yZw!PE&pB=fhgEP9hvcnf&d}sH6n701eRx|%OpKI*D
zy3yAffBo0B_P@)k%US!s$B&xd<Nth<kNAG=lJS>%Kbj<GHO~U<!xXEmLfJph%D;{U
z-%&4us4o|-9F|<-r(Fb;)+jLrxePgZz}b~!p;2Id%ErxZ3KTUhIGxj0YvH!92@BbC
z5exldJ`5#!bCQXO`%~^IT8|pdhqrmInkFV0jBavb{8l*4XX5cMX`C^IVyQ>AgEtYn
z{@g+LY}X8aH`V}8)75=*-R(5m`e*a=n|{3gpEY#1-o_Wi|62YY|Lfa)3g(|~C}D5y
zbmM+MqD#p}_iNg?M*e%avXb@xZ9at8-{rq=@L5_k8KeT0AQ#57<mosV<dbYTLA%*?
zAISs6sxjSQE~4q%*5THphpMvMKG06_RrOO_V%#R_I3AwD7YtTTX))cjPbSyZWh%gQ
zG0Nhov)pnJlCmb!vhgw1ajGe9Z8zv*RRn}?Xh~|ruJe6&wE^$&wfH1ckApPDL^27x
z@g`?Z{z#1S1YM<UWHx^GcmQ|`Ak-S3M3-yNBn8ffJl~`wniC!Ic^oE~AQ-x($1jmI
zO-?lD<%gL2f<hH@Ry_nHsao|w=n*gj5Dm|Re$*3>T)N(=v>vHJ1kGS84=71p6ed-{
zY>PzWP%BBf7qHpY50*jBEMx<!!KMS<are<f`!hKUT8%E%Z!86km=MOF^;`QGoJUve
zjab>Ls^w<uiE0P^^B~1wPwilM67{3eDCU{fVT;8xnbN!w5z_!ZZ*Qw*)$Iou+rJ-y
zJb^KqF{pUyjt(*LEJ=GHvNX;%{AbZH%|4^#4!Lr%_o(a*-&r~ThDH)zl<sh#Y;|PR
zLNJ@po-IGDmN3U4rTctuUw(L6Dox<UqlcYT5%^a?z?JS9Ft<g@?}U~Y@U9;YbsTpN
z?aiet&057|A;(&aRjh@jpO!v5uo1!QLAPIRwmMr!e^cG`k~5Bbz-e{8Uv47Sy7=xe
zN-OuFeD$e$_Lc->dO8C=U79j&R}gf~fnzYo7mp<A`XC&1M^}~m{H#WGuov-3g&$R=
zwv3Uk3nPIX6OV34LRm(pV~bEudQ62zS$8?R48g(ddAO8KIC#6bU||DoQc!!F4nD>h
zCeYd|Zs>)yQ!$;YEFun7nGHP^RXq<rB&V@;)ifiKglUE7sn*nkKtJ^uFl=UTVe<Y1
zRQ|op$%@J~RR)fjz@Zwy!b%#$UyP6cnd>6As!&o)YEl^}(FgUzI+c8?q6ZJ$+ybV~
zuUzL>^~_lYOUv-YuV9b_nm`WyzP0?94^O?<LZVOrXa>M0L&;zuRdmPYXSG(om#p3E
zm1`c9sUN3XwO^}#(`K%YCzwPV8pkO!4Kqqrb<gRe4<I^GJR$EH!iQ|%ssCnfA3X4@
ze^y~1I9$Gp2NTe0W$KmuZ=XG;VVa{wfwM(f(=mU9Mo;I6z_qE?)V==XmmyF`5j|_J
zqDf9yC3#|YRm1EuOSXxK{j<fZfB8>={Erb$qNEq&ewLiwLL1kd|MLF7t;en9@9}@W
z$>)ybpJmUNNCIg|V9!yE5nhG~>}qH}I&Q?{)1}g#(jB#baI~|Axd>D7d6`HWO#_P~
zV@gcbN#dlEfa>k|B)vd2?z<rEp7r9>nwYi8{+SeH4guLVz2a;bLjVzQ{w9#?I2rnq
z0{PCQYPtxn8ieSU7uY_VSw~;B7pH?N-T7hZI2tbDwSQ^IaRZa}Rw?O+;RsC|)|;hK
z)LXw>83DqR%Zm&32iwdpydQsXjB6L*d2sPbE&NV=P2FAoyihHbu+>Wx`R`Ve@E@wB
z?&?NBLRY<*xY=p%Sk=QzRmL1_qu?|evVh+#^JB>u9E>nI3m)H&Q+RWX<ErW-br%q1
z4H+V>?i$>w1&}ZQP`{K2H+b-T=jHCc`dy)TP%b}(odX^&9Z?HQ@SL$vo@NUCzhCa)
zTim7++|<iuRTU_3Qmd8K-G_P)qK9`MLPe^&v%hV@s?Q6AO@eXS{y>ZBf2evFzR`pF
zSk;HB{z<iJt?z98);<ONAEguieM@b8LHv)_<L~j`zsYCj{Bv44O3m~&ZCs=Od-QlU
z8~?Yt(pvq#|9^{*RY36G=;<UVEg>o+C@WltN^B;ur=@b<ysXLL5Tj~iw#TgKzu9i@
z93FuHpV0q%D8*ma;NUK@I{J=OTB2gmXH|rRP5(8#Vod{_GE&Y=hx&$5@!=M8M6aug
z_Yjo?BW{UbBiNVW5W$)Q#C_Bx*yEo*Mqq^p>+1i*XX@EA)mn94{J(Xj=*7l{YBl{D
zO4nGKQsL3G7FyF<c;p{#;ITP%$v|y!=E(|=5)A)2X6me|%-FSZPnM^QW~*>8TThG1
zE*F+v_Hk~Z0oSKxLL8Akx*CN_e<6*^x?tkWeJy)th0oF=D`$<;MbZFLR=$Grwi;zL
zpN!_OaE{sFZ3Ta<b5*4UNdkI9v_eh@4kF>ruq&)Ly&BfTtJVt+7CA!Q6jc2DR2Dfp
zl|3hoKvKc(o~0l>YZ5^T?<{SwZh4)xH$_Py@j0w?A=;e&fmAzI*FfqXN7Vx@;A$+?
z@|d)f-EvK7RNnvkLH(!}S_=xp2`xD4m(MxW9JG)SO`oZ=YSHK}92~LNz50f1hP_J^
zaqF$3evk3>nkrYPcg_XGJuK{B!-b(A{^26;zBo(YH$T{Ry*aFJ(A$h&1)jBL)@WsG
zaNELkP$GX5Q)b)5W6v3mb6m_^`cSNYEV|!*fZT(ahN>)9Xd-ro>G*1Ku^MP*+&`XP
z=s2VJ=?8TLZe}+{*UFb6uG~aVGjCUT4odjzBIc70yJ=@U8Ojq%PkxCHGDKl`0b!sP
z7xBQlu6|=1hKg(@7RBl!es9C$N>AgOr3*qONAlR9*kQrgt*bHSV?|YA#ew*s<<JV(
zz;U1oyx*nmco1^;YsfKb7HFm_GCNWYo2UQ4xvpR(4Yro=V9g~67bGklgAMFs+2u@%
zVPEUW%3mIs2nI%1ueWk~Vz-qZtCWE$(YFUczu1|aF4SQS87$2xuiF8<f1gJLu*o)D
zaVe(iwo|BYt+?cr#Y(TSLybhupin~uC@Xo`12L+{|3@(@Hw@z`wR8NC|NRYpCUD$%
zS?l|z*PDN9sn&ASeXtBNPP198<dp>_w6--4>B7d{*C}1DzKrqsfJ}WtWQ{AJLPe`W
zepymL)N(|CEp7ICK-q-WVl{HxBk;uD3mGS_pfwp!x^k%cEA?h*Y=;=h-oeB{0^c8o
z2}7QV8<(WpN_xW&=NMnVXT<eLVUCKq3?Hx?3C^iQ$k@x8vZU%TgMwjL{*u}7*>Mdh
zt9IXIzW1GlqQ~WC2z<#rd@)vf!2J=f;X0N2WY0zq7)CUptA2dytz&No@|v4Y7rJ$f
z+o0ayX>0ojJGpb*gv>nuAMR{!zux)kGv>AVe_9W-`v2zl`2XMLgNH0J7V(o{qh_7x
z6p12AqcCZdN{&K^WBUITN&atSWOBi2>|@dkF{2^)iAn5Xpd<~oi7CK%^_9pX`ZP=r
zVLONiv=XZstZE!;9usbH4sU202pB`|<5j^p9+Y%0a4h^Pz6j67+~b^3jegUn;My*P
z15+T*!|;L<%)v%?j(qb}-vjuDGJGfARrOsoe-XP4<qVDUSY$%)8EI9ZdTi@-$iVfV
zG5-bYUz}_@CqdNj;I7<AyMJQ*-{$he<-Gmh!|(Qg-{hn3|7e*x*MK?WKU@&FanV`|
z*pEWJd9k^>SKq*YOLt%y<NE|wN%u?zC+N!+D5Rpv81rr61=iXcT|g08flx{N-cxl4
z7pfXeFs?-`H&vKHVjP{KxgfRDkorWGl*(rXQ-@0ZeO%6%+lQ_P8HBFE=?ip~X3MWZ
zSCg?C#6$ElWV^n8a4OvZw9&N=I((|mLsGM_tbw4D$v`z5O)Z>YbRKo7?t10ivhTyo
z5j?*O-yht){QSWY`s|yf_x*l2JWbCupbw;|AQ*f(sDA%kx;R6A)RIQR%do3>C3pJ~
zUHiEM)eC{E=?g$_1~$}EFFaowVwj-&%-HUzcR|FiGYH{Fit$YBl_NX*E$i;Fl_K`A
z025~dw2vQVflNNQC$Qh&vk4vWb|jzQ7qRtUeq8*l?lSNXpVcvp@h4M>DXb;_<XRk?
z!2VN4g88v*CkmE$is>BV?kBc~Ou}wF>;VQ-`)qcVKe^jK+;+chw}-H(3OlU}zz#pc
zb*>2$D%9`NU<q*&)Voqlv^ALBre|o;ymYYG{OM)IQn8f$P+e2+aT%Eh<=o&?o>BC=
z7<Oq<9wVoL;h+sVIEABUV;*`Rq2+H8Y%Id7n}K&hnjT}?A3Lnec+mYnWH(f>|7&aH
zI@&ygC|0MGrQ_o-ZsVH!--j!!+5FGV$1C6W|8MfS^TX048IzeyI6Q|#>G4&m^z!iF
z?VC27wBN(ZC=)$IT{@|jnOX67%x)}CL;VHTU)bxI-zeYmx6$M{nH=-?bQ}y5@z3HX
zz?g<1J<tHrZbrUyx-H%6*%cg=`|&CKU+OY*<sYYEY!D5DLAmsS(h~m`>Rxr8|J>Q%
ze7ys`!?Vx(MJUW~8n}UXP{!{>!(MpV7z88CFZ{=_7O`{Kd-#To5g1?t*hrd&LkE5@
zJTXCn@k@yqeEAp|a2a)o@a%mV)8~|#yQ2B0lE+-?gJ}~@^{=!`nt@7BnFRt0zs4Zy
zloc|3)Hvo~;&%WUC7s~M%I0_+TvgSN-YbMq0SHyK=049s3Wt+{6j$Xx%G57<c3roG
zg_J+22dY9ZengDn7yVdMWoSD($rR=x=JBI919X{yO~Y@YeCK!k_F28xUmA_ZhjOlV
zJYxH?Ol@7use!*s_|==tL<wdkqf#l?%W5+0ql!)5y)T>M)K1Z3GrRDN=Qcwx-mDrt
z1XN<1|8M;W`)GcYN~{Eq#(13%EBQ1WPy{dY5EFBwEnMM4zv!<CtVQ?1WE|0sJsJ05
z^xhusHb%i1gy*s`t_v<CfB>3-lPk|qa*5lh9ra$^T^eBe&+(GRyP?|>51w_kAEs+-
zua1u1H1JFgEjG^LB(2dmN<pg2HlV3ak|0JB)n^<gBVa2y!%~DiZLwmIo-tMEGO{#G
zYwbz53scHha(0Z@)&H~)_PM(iQ};OTT~*zsXWo!2=nq0vW)}6f+Tk?tmhBie!z5Au
z1?l?pFXggB5S4Q6mm$5aJ}m(0P>31SH0}fqGMz)<mo?!gm+zY&)U)*sbp>Cf1&skY
za|i$~O}N4U_`LJIA#QqK{=f^1B8I~6#t>v^VO{N`?VZEJ1`CFgzg66xc^rW9fidBs
z?auF=&Wqi>olfU-S!$1i2r2CC@DqrpL&4_G@7d<1JdF#_1QOA+XZ7}*ovqUE$S9y|
zpGDUSzs#Df2&k&_(m;pP*dQ2RA$)#$=XYxGb3xGvL{=;)=Q(OvP-)<vIVzq^o=Xr@
z$5BcmZ<6-Vdy2*jI`C>|?@i|w`kZV|(ija>yQK579%IK>?!eV>9)~gP6ul^Ih%eL0
z5Q(MJVV7kAsjqi3k4t!nkGf*kBmH|xGsTV{dLVpi{!A7GY>J>Mh|-5+d4`3&^{M#<
zizyf+_P2~RKENvpg6h1*;eA^A?1C;vN0UDzbO(kvIw|SC{j-Iwf5A_I{7;WS1d7rQ
zi(X&b#x?T)@@gv||K;)b{9oVXBPQ<28ClD>Sq;c4bfkbrPwNC>KktUoIdB}{QWTXv
z9;&@)IJs2G6>R4NwCfL`R!W&ONUtX8bC*bkh8_f55-scR+!1T@-TmDo_~*p|RDUDZ
z|7*<ri4GsFJbnVNw!@PEgur?mwG(Sv6|$^W)I+uEy^lxcwQ8!CdW8KtgMF~>WcH;Z
z+)cETQ_Q*0i<VCw1ko?epBZ%;svU+oR|D!Q+PT|~mWboNIXFC8r{3-SZD(tpj$v>J
z2>LW3Zfx$-*52;)G9cxYN^f?zaR*pmIuFJeAx0MQ-QP`9pBv~2uywHiV!gZ+rV{;o
z$t!^&@Il6-bjjtrtulIAkgf;^-5M&vKL1|TPt;v$RauP|Mh7pc%qQ%g#Q;y2rWD0V
zjbfIe0FAEaeRMIn!aLC+B`+Rx*7mShHqeZml?P2kf%W9>ho_^_DCf%G#c@=3aTv_I
zlgNC1Dh3HaM49gX@D&}V^+204_T1|@K9x>i(^CMpez$^w*EQVg)X|7Xr~*^PBOt^?
zS~D~EDmj~g<Z+Sj3oAZhzAt$l1I0l5pPeDlA8}YIMhf+C<SDC@hm)`)jTU2yA68no
z3fdY@BL<-X90Zqq^0T~X2as!O@f7}Jjd46CILOvcqH&U%<67B;6(&LV-&V9J*#G<E
z$?e8~xw-$xYIEiBcmI!X@tHFJ{gX*Oi3Sr6oc49@AJ^Rfww9M4<@`TdtKa=UzR71+
zw2EhR`9DYK3mqbZ9TLLsxPw*~SL{-b&oGY4DCmYAG`zycJoQgY*a8NXpv%?{U%{-a
zmF82lQ*X;nGAU)$2=%Swq1@B#E4j_$L#~`WNk1w8cR+~0he81GA`1IGwirP<bnnGm
zE!z5~E*DY1&w1V|7a@IN{=Vo2VoBpP=qu`mHgMq>2=xtEF|a{ETh)fP!bhk7zhEd1
z4hHj7Fxrbx132oR4e*G~ue>U)M;#tP9GIt6r2;5Vx*&It#$h+&kUDgE3pn+Igo{&W
zcqrVyV|w=f74B#!lRoXeo)wJOG{?w*&OYUx4Pfk>Fcl!4^<^T$#8i{n>k6{E+F#KL
z0u2=@5Dn6hb}`UOhcxcA9>KtNBrtg8vZ^YT%cV!ns=BX$53H<KP2sJBxBEvshaD84
zJ3npifxM3j5j4t~h&=)v@=wBXIOM4jpvK+^?T}iJa3aksGPkBML&p?PP9jI<@PY|#
zM|2x`hMfw4R>lDc1Y?ZV0g@qtxWF_DDH{3_O#tO%>{NUV1BP=<0}qV{iNvtfQ%}G~
zc(b}l4$s3=5Vg#J8F~<8I@rsKc{+?QYL;ezIL=)+4ZQo^SeM75HOA{*eBc=e(qPl$
z2k>4;IN2QvO#xnjEaKW{(jBk{YK{7FO6I5uS&ZN^IS=}iu%@G&kb1lyeF}jDQQ*_-
zQ1_n9uSlI0>E`G%mV+`4f=k$d1`JalC7r4XMm-`G7=T?~T{UBd%MOt3Aka!?9lArL
zVXd!Ybu&tO#g<skoZ#IvGNlTCud)sP(&6U*cIWlx-@I}d6B@m8)-{xRmUyj8i7xvL
zZOd)NrU$Se4I<QKwi?YPU1PD;G$#LKx(*<yTvfNK?aQ-0;<;_}zRpQ4nYW^i$B?-v
z4I?>D@VgE@t#}M}G1TK2);G*B+CjHZwVPjk133%g#W)<Aa5w@Ic{9&6dL#uL004HE
z@Ptfg4Uf~b#kIJGEGnlAvd4>n$P1H>d!&)TDxTdb98_=3<=BE_t6qb?X@+eN6dUW#
zKFE(9uMU9k3{lo6!h5SWa{O;`xyT8^sj>tFJ!c3QTdQ859sNa0>#pL3%ZyQR4cdhY
zZBv>E-jLtFr2!1SV95_HN@bqNSzr_=H8o|%SWBD+r+BY7#0U<3LAfl3(m1LB0Vk%_
zM86LF@eF=Egxyr?g%`jgh3v~ubJbSeYEQgsvNQHnzM3!k)K{q<REt3}aa*H$#=WiI
z`=FlPOE%OAd36lCS8MlrMlitd@9*^|v|VFtiBot4@IWN`;G2}=m_d6rXY_0CG}f|y
zo3c`U?-Dz)s!ouI*rx~n(NY~9qSu}3Pu<rra6G>qAt);E6#-do)DMaZWC(!++d&cE
z2TQ-GE_&0Toyw4`v_BVZdQlpoa1<H|C+nu=fyudRNo((a{m`&nv3Li_6rZ)MSo>C3
zjppC%8CeuGz|8QA#TY4eDxOQ0o*0lF^3}|Uq35D?p27_U<)VFZPKyT`167gpW5{t2
z!}Ex}bvXbZ?CzY=#EQ&C<GoVo1?sSHY3)IUx8-~OJbSKBF3Ov{?*%T>Ak(1gCxBIR
z0sOEZTx5?P6EsV;m@KLV_u#T%k0eKDWabXcKgGQjZACJ$yk3jIR_6ut%sUQc`;L4Q
z@dMfa!UIBpdYAb)UOdqi<2$$vbN&O2FtRhOkfG`-JzUJ~A&4Zt*(fTW;d4(5urlov
z{g`Pf+L`e90z)>Xdj`;yCjFV-CkFr-d`+ABWI(w^kSJkKK)Iv!5Vn|@Bvp5sL6q0T
ztS~wj91+n9lH?|2{~9bwxaj&l#712RW`p>t?bYC@M_9#_h%8!(3!=4JZ#`)^Pu!Q}
zMlp1|N=L(0CT!CwCC6I{Y>JJ0SZdUPcIf~I=u}{%s@7<9T=*hXxx`UnVuGRk;}6A@
zg1akFS*3u?U?=ny*q*qlmo-$ZW|)nh2(m-(^?3f^c;F5z^wf-@o@{R{WxAi#EDOM3
zNUXMix2|%*?PF%o0!aYYZBByYRoFC4$wY|IAI+tq<a}F2uF{R<utEs=y(5p=lpREW
zayvK-#)DRK+EQ$zj}Y16k}`d{Y3EBq3KP-V=egnc<bfXw2VaX&>$5)AMJ`)yYcd|=
z5yDjz_#UFU;YK8;K$C4|5T<7_y6+~1j=M8>|BtF{cB3+y%i&g1c9#Txvb*MTvmmqp
zejJ(l*P32qzfJ|`FWBYjGSK`DxrH*)9jPBI<=B5+H^zV4i<W=U&lLSXWf*}kUt{)d
zKG*60A7$e|wH~*=$AAAeA8p>bpzTE$O7;<_Su5Q|S7o#Y|A3BDham{=$Kq7U+2bj_
z7;M4h0fk=U$U(G^*l03_y%^m`@5X4c^_euqchtd%w`Y!PIHvfK#x9TT8_9b;t)S%y
z1?6RK06<8KkG7%wgbWv=(@MF$b5yRC&DjFJFEf#qtNL7iH-5jCrhR*TJ+*dy6!)Vp
z0y&TI9;_eMp`t+Y?&#+L0moA0o4BSlgkf(s_H}WTDc4r3nUaS)P_})vc~sVKPWqGN
z4AZyM@3VB!rx1<y*RyBv|D6Lidw7PAI925{v}2X8NqW@}`FrCyzI1lhi>Q~Lt*wq6
z$^9(EFzo)blYSheYyI#fwa*4HsnKvvwRAxd3L2;Zu`L{vry&(n$9)W&oxs@j{3<Bp
z6<0YOqdZ?wg}ktO$5W~Si5FE0-M(WC?^9Cv*Sm2)hMIRCJ$mG7xSlOJBlm1HhHp61
zB_{M2c)Ns)W&1gwARQS<pNd(ohY^trvT>t#j9-~*G5SN(9@_l`rttQ`x?>`79G*tL
z8OOMR5x%2dt$Y&4WxH9A!=yX$%_w|NGfkrSfuS$L%~Zm*Wy-9ZuG~?Z6yFN9vDDeH
z_oG4!6?>Agy_WiBd2sKC7;uim-?%N)0HUW!2Ubjn#z;b)YI-l<`CZre%qJcVs{wMD
zo*t3W=zT)UHdF%jokJ7f_F)Q2J8>hF*67~wI7IJFV3<7tXoXok={qHdaayB0p>dCb
z<;EsL#NOfChS5{zIFx5Y-KGRlcse7F$xX8&+*+knT8&0_e5&N%^7|iA?~e?1FbpIR
zyqASDmoLxh=251l$W)>VfD<@u(^ZO&labpz?&zUEZM44>_fw*5A7M5cYBoT&`09?x
z3UK<M>1LN`iNgl3Hd!0dQ16Hu_%cwgyO3!~A`u{hF&wh{S9z*Q^fhBN=3|h)nnB^1
zZptv>l@2b~(`<y;Tf&R!j)2;a>3Gb?eI|K_a$$}c9l26N^b#T}0J;6VMIM-8pz(rI
z+s~Vx1_9N5sCLEUTz4ENNgX(w(eI&cs2~Iz(g`k0S#?Xx{_>O&42SXLRC2ALqd5ZN
zs)!zsT<9-d1cRwhal)8$GMDerDXPN<@Tm8o<-LT-bY3;5a#V!uvD7S!1+sxh8|wwl
zl1>fv0+~j047m?9QfXCl&x;tfSEuQitz``brvY#ox#8C1241+lUl6w3!I570fPNzp
z_6=vi=fn<Qg(3QEv@b!QX9<2g^D~PJ14+3on1gf!N`eX(Lw_1!j#BO&WeCE1!7)po
z60W?3bhFQCd|=H)=eWXXVFJxW@g%_uMY_R1k5H5g1s)Y4J(91RWxS*X%@oLP#lGkO
z@9uC=QMP7jG?%h$%PazVCYxNgkgN*$0dP%g$OS9;qSYc!_-BzL8|u=&%U^Sxb}piv
z4aOx+?#Q!gL!>_#WuC{%pNU0Psd%GZ$DIS{`DDp^?Ds(i9u~O3^^s>Huy2V>sT*#O
z%@lkE>QS%mqxol`{zDdb8UD{c$@7;*pzI}Xq?FwTRheS8o<ze4?X=l`=Fab2@$)@~
z@Pm5EjyWi*ygGWlhfV|R;?yYTm`bK@j*&cDLeZKZ@|hH#awW}4q`6S6Q-aYMnyUaS
zftrc7_c9BtSg^RGUI*h(vRmTLNEQjm+f;;p4#>X(V{(*ot^r-Si^ncFJC$#3b#|%m
zx=1-sb<grtR|ud#%a~pYfiO_^Xu}zmP1qK@AetlvOW@z01vwK)0})=93%Y4Zu@{|#
zXqNWFb#&K^dY^wO^Wf0$F8thhwgiQQTtAzwu8#@WX(@~_6R}6(&H;VNIhHT+Y26$t
zQKo`JW!Q*E;m~MDYUK;r@lP5T=uTL{YWhhR+qIsfBm;MX^HUb3&e4*gLTjoqCUZme
z`yWB=_zx94IR0E!OT6A19Mgm9Fb}x%yZhp^gu2`O=_QJ+ASRrjeilb&7|hMXmp@5K
zyeG<Yl((2iYK?*rC`SXy>WVstL#gZjZm9S5I&%TKLD~3#5Afhr&O;Vu(^|nRrF<}0
zVCORIYTH7xZ`1F{Zm=;03bgGKox-D<%^>I;+K!I)_{5eJLdt*G27vr0NZtW)Ltjx<
z-6&0Sf=hM&GNaf+3s%-uN#`&yJ4_KxogQ(Z5u8Hw8^$y0a5BJgqs&q0!>Sc}qRcBr
z^n&GUjMwN)zdq^`I1byoz_YMm)>@_sF8ZLw0;**^Mlff7=tG1V@c|-vSYPp32UYEJ
z%)tYImId->hd=Td(O20<866rm7yky)jkb;{(rTIosWkwm>pvjGKP@876#f4#MSkSZ
zHSynC51T7l|BuJt^FMr>&yjFA&1!WjR6OG!hxssYlues>$8mTTz;S9UdIX8P=!H0i
zlbZ_qr!iT)a{wn{Jfu$x$(vmV(Lyk|EWJu_6x($(&`KUDjU}d-!nCOPZX9+cOr!P!
zOjFKDg{GlsNzQ(k9cZAlwRf=f*UsTi`(W?w(eA-M0%+CHnI0YIbv0a~+MDpKQKCqB
z6g;0570xE15hBs>1l2bn6<VDRoKOdJppE+zl0c(Gt3BwdL=?pAPax@M&qGhjl;Wfg
z0+Jn!RBwWzcuIPYf}wJA*<uTfV2^CD=@1~nD{~v{QaTvnx^Lh{TPpnw!-@o;1E*ko
zPdJK4Cs%-y&0Wb%4Tl~h)@lWjGaMz-c**?AeGuuLY`0io0CZ59fHy!xSFND$gBqn5
zXhN?;gSiBW*G*=dZZ!odAe6cK3N`+3-zXRGe|FOD)!Btuhu-P%I!OMzfnTC-IDZ@0
z#{XQ&<o{cKxZHgBo&SG}&mG_r0muI2X;+v6n+&XEo-q+y%B+ym<Ow|}*F!y_=mDB-
zFqg($f>?=c`Hw-^<uq>y1K9Rh;`bIe2f(my4TT}(@t9a(*wf41pnzezFd88-5(gc_
zDH6^Vh`~ns{je`t3Z<tDm_}T;ZaSHmjN%Qo%dPifPG*SQ44_>E!<4teI3|11<B%?T
z&^?31WYa}&1c42W@x95Dh^-+wv=!~fqbqz7rJS}<T#?h@6E@I~<4?-6R?aY7_SdOw
zQ_^HvPb-FH&CX*Du#e5yN;k~zsyA`G%coGwLrgk&3V;fy-WlujD9~dIo6-BX(B6lV
z6GmZuM(_kxx9t61RN9Wa6XTz^o=e}@b6=MvhOIxBa1@{5PCygkA<UQP=sSdhJq}1E
zsR9rffqsO$ZmOIB3GV22p6%|pk2d$Wb|?(e2HnS(I3w1ZAU)e5ZNd7q+V>)^aOZi5
z;bPYjwGJk3#Pkk$39M%-7;@}TnZu$or91g%G4?}0I_5@U0@_^kLkW+w6eD3)l!>XG
z)@bjckJ0`C#hHK;=*n_wKi&^7-i)Jj7(>|E*RMig1P2GN+g<41X75+vt?TtC&1UHi
z7J{ic8jPqArY=~APJ%>HI)V)wL<GXG9d_5FA?g%U=S4j7p1*w^B%jvNrMz_KE#SD$
z{k=m`iu8|n@fefWZ%1PaqI;De9ZX&dT;W6MU4VXP&#%^rzUvsgtO3ZJhX0(1+~4+7
z82^Wu5AX>1aT{%XLH@_bAQF7{|NjP`>*l}N>aZnv2Zrew*2@>9guZV6S6f;C|K-({
z@A03$$;ZZjqA)ji?@$8YR#|;0nb0;I9YvJ0jd`g=Jww3|wk&vdy5VURPa-(0ZoXW<
z+k!ubxRtJR`pNp;-{JXZWWVJSH|ty=(a8-<P?gW+(kbrq<L(*m+IOL%s-q+GNpz`P
zXiFI8oT^Gq^iR<GO>QIlE#i<lbQ#PL%cb!EgZ_9`8>hdOPNA@>Kk;AuyKWWNuK(rE
zWYmv?-k-PrTaTL$bL;=ncm3Zt`M4?0zlsAC(8)C%K!8#$%$tHSppx#0*OgwtEn)_+
z>=aMHe`6rnhCT?akyLkaaj}G9q!5tCDp@k{d(1s9!ef<0X$b8o&0OS|WtEy7zgBT<
zYEl~|CVIR;ZkWoHVJjG3k%1%LfKnU;JljyfdMRJSFj8CTxc^{_{Oph8aSFTzleS-$
z5*VeTj;V6Dr*fV1-6#AHGOO{4%8lEsIu{rk7Y|o(w$g1F6zoXe2qvzk%k$rEh>3?i
zkKe4~gL4P`+_ez3u0@S2X!4pD$d`<Bau#6zk9wehu@$zyQS`LYezge|+HYUa0$%>A
zt>;?)|F9#!I~dFT3%LLF^55f?l`Q{XUj8oseUs0v@&6p1T*Li=wlSU|MiZ|mU&4gc
zADMOahw4sJl-OFT-dj)$)zZ%X(c#bQl!PF^V6iq<y9=0nN&B)5+@(e^OLwCog|I!S
z!FQ;In+0kQ<G~<GYqT@e?aokb$liczk_v1B8K_Tji;~LN@%liOi3!rEm-+Q*lAKlN
zV++@={}swjrYHB$SpO|J0p`~K>hkyX|1CcD{D+oq_3-PMK#o|x@(@VNZ2REd{@%gn
z_S?g~_44%#)jc4};@gf%?H{1}kS_}3q1gTM9R!Q482YwH;%7;AdABzmc;4wn<I><0
z{9F90+be#~CrNWw%*YVf+Y-rQcb&eLj3j010eG*@AovuP8W``F@&}r4bu@L1hGE}%
zBw13NCxf^*0W?R^zw6oc`{(OF*YW@ESui{e`|;^lB!Rpx{`>N3R{m?Pe2@SBZ9bX&
zPcX@_6_h9+pUL31wib*}&&d*P8O?bM->iHV^ES_vQ%W?|v*U3v?4E6y4Pit5^8VRy
zGN`jGlWhF*!P_1r=OI^vCMhM8hNqez=q+AbWnZ;EOhJF$K@ux-Y(`yuZS5{qU;a??
zV$#@>Ey@f>?V78`-%B&&Onkvd?5OTR*Y45zPI5kD+IML2-t9M7dOJED2fa{D#-|u*
zOg(#h_;P1|>*tL%^=x~my>+<z25qD^a=q873*p~^x~m_5C`pb$Q?C5W5RLh<E@gg^
zq=Y9JsLkYM)Y%C?6t{snYTjeUF&Ub>IQKjx>Ms8I;9`(Nfm1Z1a16Xm-DR@+|L)Sv
zHX8C<mFsmzYMuYA-3x|jZ6xycy|cA@Lv=4Ht9m`blmeJ61sc0^(C=YjHS#9{ypHig
zUFe+d^XJ26r8xtW2ld<i+#CJ@J;8sUUn%Hj4gQJl4R5;{Xh+}Pvu-V$5Ne6XcIn=$
zdqeo&F^w$`D`%h7gZ5oY`7=J(+JE_WC12FWHTGXC%~sa_YZ*#>-~YeGCvX2%Z1&~l
zBS8zLyjgCPu&tNja#)YemB_M_VHo(pR?z?kK!M;9jpHF2^wd;G?3^eP7w&v%N8vd~
zC1@;!YLZ?sN<|@$@H}%KF&xVnjZs*?ge-+IqL~K{H=A-Y86j4<%gQj6Ip!Ig1#$A_
zVW={;D&!gFo2g)j0ahxpX%ihP97l5jQ{<G5Sxy<ZJicd$0qc}al@Q5<jlkORAk^@p
z5Tl=BhHU5vS-nu>Z1Ym1$ZcoQ=~@3u^}-|?(**>_`yS&Fw||A%dHQ{LJL<<*oYgRv
zBWO(>Pg1np!)zqSj)@srGY{Z7MSBU598$7?#z`YDcWTF(zofxfvrTy7qR%GH$6?6Z
zDFu5*+h8`)Bl0n%n73F%3~^GOj)JTL0|sJdPtOrFIlu^wcM6A7E_=q|2~({$Rl`;)
zt1#dCfizFgaFF$L+_d2#j%!JrhtY!?w`bbuZ)oy%LnF6uVl;-fP|5l*Owo(K9uGk{
z4z)4VCWa)N^6tjQX0XZU)*L+S1tDf)|1DHQ%$%e)`{<Ajoj{lF8k3L*2bDk+qdaTV
zw^q6{r`a3kg<MMGB^+59{qOc}-#`C1K1K2$My=!+U$>J7=nL%sR^iWg`@e7Sxn}<P
z4y!TfeN7wJ`Tw;ZHM9AD;Nf@q|66>}Welf1A`y**Rg_osHljdUOeMt%Dq@Z&I^1p>
z6JWgFdHsCn5JfIbOff;BAA<s&1ksqSVL&L-NfAM`L6Pw6q;FLK7_xv3Y_ignzM+B5
zFzT}K*~g$nD7T>$91YLWjrLS;_?OTU1|3B-(aWn|rx>J3A@1bcrvvM&kW&FABwKQ<
zQA$JNe{i5KRd5+4oXaH4Il>t@7oh`)j}ci*6sUe>fZ>o0@M^di0=ti6ud`rGAEfj6
zJJ)%qqv+BhZAf~IxjU<?ai<F_TzM6EOrmT<|7?2y{_#K8@PB7XeR&(#^8eiZfAjJ3
z_xt~E^2r5z^~0;0=qgXD@VyuIE9JozFl`J$4ex?pPd}(tnvKSjCr>D9QBW-*+o5o;
zB{(~I@ejr!M`9U8qp(l8w`{CUjBMc*)*oohlBGey6!F7FClb{MP`6=y5TW<*1miz6
z(OlDcu&#ztzo4WEF7X-fKJKWkct|-NC{~_jtnU6&!XMmmV#g9+2+p@Px@=&Cu+V$@
zZP4)^S%loj4>%M=X#o55I=yL7)Is=N8U&aAv*5CXS&SO^O@}$U<ktB<i%Y-1{NOz!
zT;zwvLPvYK{H*F5>dx=w#quH*`dt3=VpDwo{P~|b_`gUMU*5(w{J;5VH7EZ+Uj82c
z`<r~e0smk9&*A?zW7!O;`ihc{#x~7&$`btP5IrQ)S=)kUv-tcou-QMK#TKl8_T<tA
zW4E9Jy1D-6aclK^{^xJ<xqki|rxBd9hj2ds(l)N+|ILRv`>)o+@9{sr$%ija8p&B{
zu`%u)!@og%0{_wt$YP@(pMIC_{*yn~uYdpNm$Y#W|6g6nt^eib%J=pEO+K#w51Jfs
z(6prVe0RU|X7lLPdb!b9g8wJu?ozq5wfDA-3Cdm_w2#(X%a0pP_+P8^=HT#XeFf*T
zbhP_==iu$pI_6y|?H_FKwAUY%4tL({?QU(h*P-a)!O_mv(av_~HN2$D(ar7cU9>OU
z-0K{Wp<#QyTrNpGp+RtE0`6cGF|yh}j?Y86@}<~5gAgb);ZwO`Xl|4+0ET(F$Cy!A
z;=u)ze#((K(FS1<_o9<46Pkzb?;9odhNuS)RL3DAi6`T3sLJMLnVcH#=+xvrbsmh9
z($4-i4ba_61^+&vQK?o1c=>Lti~?wxLVS7-7aThCy^@ORnG#S{O5j*-Lg}ZfXERcI
z&9t2Sdh7<#)<Hz?VgVb+@~)oj>=pee9;aMbk!yX7S<b^AdJcr}+?z@$AS|LD4w0LX
z3zPGdM~T9>sv!VCF9rntnf4l|Aik`pd>O9p3PHhpHln12_6(UHnCPVTy@3pS85$KF
zn=-x0U}WB6T9|qrwm8B`KShg7*AM~Qy8C;cNcpe<?S<BCxk&`z&nxp!Z(?!z5Ru>R
zEDPAX^jF<=7weic<pyQwNN4l#rA9>1US_oGC)BRN*{fhD>q^J4J>i(FSz7A$BRjQ<
z$3h8)7RopzTNM~+%_`JgX>9i3CTTqSlh;hlks+>GGt|$KESBVKlA?za(0LM^hjS9j
zMUZySyv`KjrhC}Rbfnu40~-Lor?VVfi>#g-T9fJzb%x%D^%a{5h103D=IlipM18Ll
zI%L-R-Q|3z^h@a*Rwhp=yB4o+4L!Hq1~rhy>#KLOb#IS+W{&yYWp#H&-F>L;uBy9_
z)ZNGG?qAg1C-ZU?nCYR1wm6j89?JvE5?QWyULhxBk>7bpG$6wN^(Y|gOlITZ0Px%g
z?>5n}AGV`Em?ivy3;7RP0e|59{Xq@<f%Ef0$6MeGnf$5O)m|_`LwPo^+Y%x+!RSns
z24Okx>n9(u))xN^4B2x?!0F7YVVjRf$~KRT;o8QjLrxvM=@quDNDR=yQ90FzT4^fO
zh$U6LRpv)HB?cam_OqzB!SD_-_Nh=iR4@Vbf|P<0D%!svsNHQ30GffSJODQkE$)F7
z3=u)a0MZU8&Wr8QA?%VEG7sw6IDlyFSVI^|O$4XJuTO;I)<?@Z2LQgdH4yl-?f^TD
z6No<pG9g9V%nD~zdu&q&R?&1IpmbY3nu>q6i2X19x&Hk3^`XG8(f=$zTFKr2HXnYE
z|MN{g{$xx1ngK2!J_B(CaEx{xBoW4eCMF!HV>o(Q0~q3iCA)yNIc{iTwxSc2w1KCG
zhT4VG*C2q$r*Y6Hqmh_nYojU5B<PnYOg@H09kP9|Wcuce=};bx)d8t1j{VKH&LL~s
zk%cj9)?UwKNlxK>YQ*TYr8xy(#Q>|R%Rm#!gdX-X(a+Oybb1Ql0(BalL(SvKsf67|
zZ&?a{8(=1O9XXx&njO5Z-hAxHxshsBP|9v7wrRAtA4hb_fTN$<p0f2c;PJM-`EsXJ
zuh#*k*fu6(fE}mtWy5@UG{Sh`t%lm^VMqy|5RkXB?=QDO)4qgx4ro`YDUQ606U3HU
zrJ_Dj)Lb1dm$%c>as&MrRJoC1G)fM@MZvx8&RSZTR$ZU7{6XUo?bEk+6SusCbI0KT
zJkl{q9=Uw4p(-2}cwwybhT$Mcyx$bIBMgI!B!#i<fo@@c9pdPRLv}gQG1A@R89R$0
zRr8qBvLTQRX7^3C^su4!VfM5W1O^Eq+Q$^ymKX%<hT1%Mp|^0DGum*8@B=cQbLm_<
zrae`<k^$Y=0A^zFlN@BIiYaK?gyP}MR1w+2&ZQ!c0_qW#7==B*0EZ`*fYMXxg_b|l
zC;5Mvu*O8ZG>C&}*qcFkB2N<_BhDZuIEG7(Fyu5v10HZy*8v8Xp(H8LB1*o&v#`$t
za~jHR;sjbG=T?;aIQ(?-O^oFV{r_pP#G|WQ$^L!){=f2gHEaL<=;7n<`~SE2+)>_i
zD-f{Z+Za<jtIAeYfhhK*zT9jzRXgaP2PvBAwgcGR`_X8Gde!IcZJ^vPa5vzkXzNS7
z?cmMNyZbMlsPQ>xsXL@69dS<Gi?bLC;<*9cxG2XFoPvcBn_~@12<+s9ZwbP?&BJ|Y
zXpPmjY{-0te6)ud-@3%t$b}14n&O|>4^M;c75fpQGovye9qA9Tt&ihl+`aAaz-q-^
z)>up=u#Ec`z!%YM0+VV{QS4JC9;M0p@1Ic{kc=rM+@0U?+50v4iGlt;d|q>&;Eu|P
zg?eN=W=g})Olf#xOMi5byYo8$Y7kCg(hWu-+7Cc!@6pE+=X_Q><MA+FTie+`*x5e<
zNOzMI*!!4sA1xfYgDL$@tji@g$a^dDjfGm)9C(4IFjE1B4`l`8=Ozi~8}azG00Kxb
z5qm5t43mYDz(<6jA6md48<^wCO<3jirhGJ&G<ZWOKvPoS!r?KKw(N&>^)Mgh!e2tq
zWR5rJ8_pJdlbPgi^emTWi$NNSMt@Ps7moWG{CNQq!>jG*a)W`=F<ZYQV31HwV)kf7
znIjrbU^$MwpkpNKlGp(KY9DRy?ql}kq$KD%*}Vj9{iOAwB<SlW%k;!8v+_ak-;zuQ
zM2}bpX;%P#<|`VaOZ`gVe8#Y6dikswls1%nt*JGG6+OhSlnTrxoi&5!hLW!}wPsMI
zho<735z_v%KLz{$X*jHN$f$6fCSMfs&Hr3;|GV;VIlKQqe)!$~<J){P_rE58YJy(e
z6e<m=AUdJbbt0#4JT=hy_V`M;C+A(3khv<EL@7Gp(%wp^?xhqJOF`rJE}R{K8GW{E
zwjK6QR1%${A>h`g+gu}4pM7()AiOFpmk(oNcoXE#OPtn_1ottgC{MD0;b4fOdj_%(
zSl0(EQA}vJ_Y_y-X0jk9Y{uLm$1#DFtJgx1-2L8}@;=+I)Em44=X^3CpPb4RcCe{R
zRqQDF9Eo?J7;w)%=?>TN%FlU1vP=2yisa|zhtLHCzizR)`#S>rjK=0JIB0W9K^O^!
z_?~Wf1fu$Y(bzGOX_E9|?;VblK-KBySC?3BKKu(+)TPj}^cTbR>zKg4F2OvV$I0aQ
zS5;m*5Ep#RR=l*ezkat1M?I$)5{hZ+59f_;?Q*sG#Cc4W5QBV^^a@DWqj>0cz6iwt
zbxYxcTq#UmP8pJ%g6U-eI6huV@yy#^aFwW)N2{6VcX67tWog*;6q2I>g*vQ{EDj}_
zy&UdSXE9guVe`qOQhp}uG|W7gd=u%9Z+*s)nLal41DgAV+}v+Di*IuR;=ve1!UbI^
zhb~bp6jmF~b3wh)9iFIX&pJE%+Z`AaNtJ_Rr#_SbHIfX;#o{yqd9@AvjZXD7TuM8`
zZZv{p3@Qvt!vxX72mw%BB0~T~W-eb3k>QjWQJ*<zZc}d4UkvGRRaWJCcu52>rPKHt
zeo?Adr`zQWY+;V&E&BTfu$=+O!sfs)oEjqP*11TQG7Y=*XtQ@l21D7|Hie1V{IfUZ
zZ}=&a|1fR(?PUJp&&}<>S67!?|9|$bzAKGn>HjUCqBG2{niT{zW*0Skh+yPA2wuQs
z_bAtl%%~HQVP`<&x_tMis`_<ae2I5A&pqdnb7EkoU#qLDtGlay^<w}1JwEr3zrbZI
zpy3>uV?CQAzIpsB<#Op|{J+cRTgLynU=WY_|5o0n;=inIyzKwJ%ZCof`a^Zy>*F2|
zRGwx!^s`)pd7u<z5<Hm7;RVf^KX%bnMBqF)<EbBde-h3EXmru)FF)gj?;-*LP&DB`
zX8!P!{fKu=(_4<4nRD1Q3~rc%fs<tr<LL$7%8hTQ7kH$EsH_|b4Bnpt$KIl&>d3|0
zxzMBb24Rj&d3}AKbv7f+Ewd-rel&ANXxzz9lOzAi9|0E-Oc$ELjB_&#8-o_S9K}<j
zMnq&p3dzK^FKyK5_8L*4oRJ7RT*N~Zj4zC+$)G-RD<2VE8S_b6x@@n%-@*d^z&$fN
z4TDR%SDv!-AaGUG=Ku+Qig)v%>w_k9L4IW7j1@B7Aczy&^}G>!rqMB=e}y=19^r8C
zE3tEg^1%4ftAvdg@}SY}U~1e-4$-t1G&FcE<6%u5G~~fkbo_PUgf1p>B{VPY?pBx^
zcu@|o<Oy7lNJR{_f@kgo1p?m?ERGKGozd-|@$lB6Hwhx2UpMXrH{P|!kK*|?p2F_K
zlLtZS7c7at<MS=@-{9$Qs^gLMe|_Wa+l2gItGvkn@AJvV|IV`(;_3+&V6a9I7!XWl
z3wGsY1ZMn-EMXOM93Pvfi^Cev#v%~b9fjqaPH(rZANJS}&eWQ7kmu03!MG4+M))~U
z^~-yBN<$(F=f87`d$)Lyt*Ds8>kl+;fW*vJCErQY_B#zEjW(IruLaXH8>^ff?#6^9
z35CcEAsG^2GFC<dn8MqEN-H3WopZzgm?{gsbMNbf-TnKhRQP4^Q!)0RJx|v<k{Hq0
zYNJH*JKmL+8}NKZTlPqc0gHSa)S$#kVUR)e4DVr+5Y(8oFoq6VYOszidJ5xpY*~YJ
z0deqe@$?SI*6h#7IfZpwB}nu~M#0e$*qkfEo(RtPQY7tR$R0`b8&rZYbP&<>%F$sP
z1x7boX~n>q$e@-vu+ZR1tLBp-vnAhZ>LBv8K^lZVV1+_3CP#Jn2F3Cu5_EpZN&`(B
zOa)0;Nj;JEibt|?D()znjGz*mO0<s0*1+Hge>@CjdHNx+mMtsU-iG1&>n|2(?ANY0
ziB?}TN(LMzZv$gx91SV$ox;e+#B(GXXig(Hx-XxtQef?+j8vlF*tsHgMG-=gj%ZLC
zJUMAuCpF#uwE#Ln<N=X)DK<jO%$6@yU;&EHg4&QwsdEUn0QMbVtu)EwnDw^GK8RhL
zI6^VLLOgw7KGN>$&5t0TsFb@cTtVOEwxa3n$a|M7o(5lK+yvBrK-H`|r%^DPO+^&C
z8{eH?RLiBwSN{9LL)(n%8~OW`wAyNU@|B&A9K_KNM!tv?cnZJILzqu)VHk{pu$o_A
zcbv7gO>vy=4E^bCm6eL6^-Z8lk>={d%}E#O(q~h!_jp=3b3mKEtzLMeYj5fg9phC5
zI(M~Pk!_ziE?N*))dNxF#>Pgfb9u*cVtu1mh0t;RSyW|2k9jT+O9M>%L>FL@APCtQ
zMc<T4af-^{_f$I1ZLNw?+j9MD=DXV#)n;K}gomZdg%g(;T9~4+nLvY0ek~6Qn!lD;
zm)15)rPr19*Ole@AT3yU0d~d|u%X^%LpXV7z_?TOoA+Bb09Jt|HA$9VS4yHTeydMC
z9*&$Sf@J}C_Sj-X3;2b_R&D&d38b4&gR5$3QxetY{~ufLwpO8tcb1xdl#=|6luU$q
z&KC<!Ia=7X7<hzqqo<M1Bm|eJ_+Tp~&qx@_hE_^4J!B9MK?W8oWyp3H@6!A}%2EFw
zrkyAoC}v~lHQ9vxpx;}oBu4%QSda|;Us%{E<o|#8{=c%8w*Py(vHpVp_FX<Y{+qDJ
z<EDR=Qn}3P*M7)82BS;1<-*tK5|4P!uh3t}4QSDQS7bG`#lk#zxI--Ca^pU_deg9*
zsKB8euRoT4)A$7Hc3@+Ht7^2uFYkj;dSw&Hy2~%@pa_m~Kk-74b13)}Ouah1;0Erf
z3n_mAZsL69O{F<PxtM4f;oyrVk;-|+&Hm7CJLYaKX@fZ4LvMxO&g1c!RKv|m#c7Fd
z5mX6M0Hjh_6fLQwTLLv26p<}~j=Hm<m(>_5NHpkKjS;70R89<V9&@e2Snv}v(0S-~
zInq>DCg)}sc;EVa%^vG@cKe@d-3Ej22i?xcX1!5opFh`n@L+L~)!KFV_d9F+cF=9~
zdaToB&HaN`vr*?}o!wfy-)!_&ShKy;I;=O_A6D4=!#-<w`mEL5Z}y?IerE;hYRHU6
zHrCmNV)h%|ojrI^d*5s|`@d72yUl(Z>)VA2YwV!b?KgK0TeU7bIP4yDdJTq6t~Yx-
zty*)xQ7=OMP$v}D_}FOoS#Ph_Y8f*FO4;eO``sqAt<&wX_YG)W?R~4kD}WBxo887v
zANwJ`VepLh4v+&H)>>h`gT_u1zchYpKtF2T-&aJby~e)|ArZV}_1b>z19WRCO%2>E
z8}tBD?;Lg;``FmdF6$k>@AaGg!+wK(=yd8t=U$`xvANUeZL(GeDZk4OdyN&SqhG_u
zK?*1Y=mZJi`}@OQlPK0~_Z!{rA$h+qv%StIpa`_H2AS(b+D@A~3?tI%{?11LX+gAK
zVW0LI@TQCOB#PCLC_SLuPTx!hHTKa(R`(Q&X*WK!ni!L+f$uw5&ZlOtu?&ON?4hA?
zlUMzz2K63N$B{3fW&Eqbjw@m)S#y`w>K~ifc##~2zt<G3LZsW-6ND$W{+mBM#D@xo
zLTfI}G!<+`T&|PpYs3$1F)TR-LO{DK0bwB~oOG2@*cBiY#)WvMCGzl`fpS3;e3fQ0
z9&V#Vn9M>@m%V5i>2u}@SBz^1CjIHi6WAL1SQq5}_?BJy-1$W(lg=_w_SFQ0^eb$f
zKdG{Yc9AfWle1Jbn~-^?^p}Wcr_t1(@?~Qw@;ugUz=S-3`LT1@$GNpkoo;X+E-u)k
znHz|7<dR(mMS>l}i-iU87?^Ii`Qe1ZIjnlqp$I>P2{{5qEOo0RlTsXo;9LM!Q*t~p
ziKWJ=a{|*l5p`iT-3r}_?a#8q1sTnpkN9U5Ts5VM@xjJXmKO+-imM~=P{_IhOLfMK
zx`{y~impD6AG?y<$fWy<bI|ImV_vXepXfr}tN>#ngmVx~DJ6)UMm3g}1|84-F)#?4
zc<(zy*6ICLRJQfasT}2q)xA^S;rhTK=~S!*8u!<KWQyfn-(zG0x4@l=L4b9-Rc3=0
zP{VM`z`d_5c&TCz=JGYM-(?sVgdZoVuI6|!yls04?WkefaY?pprR7vMgFNKIAaW9<
zj=kjiA?<8z{&X3tZNf02`IdyH$(<P7ys`H7m)yyIt$kQ)2^In&ynP1q$CIA*pS;nK
zj5Y%!I8v09FVd?zHGb%mM7KoJ(GzwwGj#NV@gFM}c_EZ|DbQ+uZbvc;_yZNZP$C5^
z`M}w;WebhEScwgo022`-LEt{5-y{T=;57^+6o$9P=n%HfDQchonaDw&k4RvcM-&JM
z1fvKhlRKIC?n(K?`|535@$o{*H(V{R!mDLVHup}a&*xvS&MmaY5^-q+!oh+`I(mil
zz`r8KlnfMP$)qCW&=l{)&?PV+6&i;}sZsaFJjy`h=d+gwz%u4BpT=4Af|Ub?QTL2s
z9A0r~6I=5a`-`Ck?}QcpV2k3!+Fn!xmS((Z2wUWZd>5fYG_&FS&Mi>%a<mzgz2^v`
ziFCr(#&GYcvLoBz`2n*Gd7fK%PQ%40^r!)(_wvaF0>G#VD7IkCHS<+&0f?y3FA9GG
zpQIKO%V6z$DHX;kWyosClwO}KV}UZdOY4*+Nc<3m&9#6Zq1fqKG=+_aMChk<bs^pA
zj5-oy0Q@e7fE8Fq`S;RWF2~Oyw)Ed5$*jn&7I-VM!khGlr%xfbsv%BmS%oIFe3GVe
zRtFanElrmD1mdb<@1?9%U7kc)>8~2<sAftyDatBk$VzBKc5Kc)K-GA`X;Gm`EbG!F
zmQT_o&g$txqRGi}pFm<&Y@EceSmCRxT5EmJAhUL~i*xW(RLLhWZ=!fjTV1}Uu6`!y
z`-E;Tq?((qAqUBxT%H(`{VVtsi$#X^C43zo`IkKQqZ^DDr#xJolj>)Y)j>DGWT<<P
z!HQf-Z@uZS7FEI5&;=Y*Ij(tqODVZP@79JRKey9rQkyfz173eN=AKMx_Dknh>S2-$
zpDm3hWf`bSiaWXBuUhiOL7*U$@Ka^6ImpxO7>k9OCMKA9(pI3;nMt*n;pysP0w>ey
zxgykY&3mzQ#=y%)j(ldMt};zRns9b%GU4ew&L>4*H4~Z<7bn5xuNb&yEc_%Jc)mfV
zRsn8eU}Sfu;i#}fCQG<kC|c~~u#LwZCq#SY9iav+Yt8(OceJ<<0Yc-J3O7pPCOfuR
zD|u%<P_QEOqov}S1i6jE(sJ;TBI05gAvr^D><Ysy8Ra#~_4g0tN;<uotlD>)#pXg|
zsW*0OhpoP#3+Ur_dOI{ncu^g8(aJU3&HhRMpd|{8r{!xj?rBfNNyKzA5_x#KlX|1q
z7aA1b`^tsgY?zfhXx5GOA0$CmvLdL?mX_#eK*V@oG)Q7nDw$$J3^8t0_>qYgLD7wm
zH|Ap3M*DtE^IsFYA9c@cDtO8cFi{&n35e84q5N{j=Nz(SbSrROW@l&Y#zQa@y!#4+
z(FhZWGWEuncP_85x@oVKI-p?ryv5!zTk-_D%j2vI8O|C!>t$P8g+^yL7v=v=`+(x{
zPkD|rYSKNw$&N9J1n0z58mKcq7gS>8b4-Z;%S4jdRU#NrRigZE-w9^WMHz8O^D!*Y
z{AP}t4+OAm*(r-9*n+)_5h0IWM7HE<*tKw+L81-XHXx)R!w_oBB0?WqWb$xqS+RmP
zIXK{Oq90`l>x^lA6Z%PU!#kcK=?yN6#MYE=%sEe};Lf;rLA<}SSVwQTg($yC;bu7m
z0LLyo5x)640M3V5F!LgDhae@1M9U#t-|;m^&&^-@V;A<$C<W0h7SEWXS2^Brn)Z8*
zTD{TTKF(R{GV6Gp%kP*WVNrMd!k5St+p<${6x_g+Egp{{BQ3$HbqHR-g2Ug*l?R?l
zAp!#?z8+hc6bOpXQsl+A@SdL2Zc`<~U*c`z6bqlhu!yqu{znwoZ0~lc)2N#5)%t9B
zaVf?YAw0d1m!%(9L1%sQGkd#Ek6j(4SO6HrC7+DrCYJ)70!7|9_P+6<*=9(5hOMCT
z4)}paBn!hMD|*r8_z`Y_;D@X1*cKs#;Tt)Po}5MS6`^;g9(+$`3MNm?Q|IDO)>C0?
zY@NMHyu#8-tjsp(d5=yxb<3jLh|YHD>fMbe;qAyy5l#zrlb!-44G*&s`Y40EqFF|s
zu0d!)=SI73QkmF*qBAMwQjht&RoA;-9nVH1xgO<xDcK!{W=1sGbOumy5Jk*W0A2og
zIGVW}riBz+l~%58c52pHTIGo`W^55)KmN!_0LE7Km}I+GX5k7h1rW4RWdOYp&psFO
zK#Wtg4kO!i;(K-9sbtlX0*&JcU$FQ&Wa{S+p`*Y;;qpUW{KvaOYdhWuv8RjPJj~{H
zKz8v2`axS0-cNBX3PX!`-!N?{JR?<4V@sf4JOq0rg52ZfFEy2}jL;^ZvkP~FI0=VE
z8KoOxyIg*=jD)O;Gk$)Q4?IYR`}%&090Ry&iHFm19^}p(l!6un=7`d6oRC%l|IBE%
z!2ENr5ySM9eBHTou6-v-IS1{cfmfo+s^K}yK<=J3AiV-8`7fnEm;71V07K?mu}xU&
zT9EZ_qmK;l1K^KBOv;qx&z0j@QanS3#|nCeDF1drey<qM7UGYJ@W%xBbH(>V!aFUx
zfuVpYNp9T51jn2thh|^Y6bTb6Fz@aX3SV-sgEHwjw=lf83S9Qn*Ng-i`#h{A6!2Ox
zv6RlP&j}{zR;63A{VpppUS+9k33;s{iV$ybYKs>z-K;09X{_?@$Ff@3<c3Adktkpz
z3?=NiLK?~<uuKG4_Q!bGGxDyz5nEe-gXEG)3I)uSHFbcn;(TRBK#vI1hrnU37q0~`
zUCi=SHJPQt!uv?UvZWE0@d}r^IEA=WE|65dk49?oCz)wb1XTeCq%BHgt{n)sEWE)o
zO3p2q)ns)<MbSuh=apQY`O~(#<0r2?GSUx5u=38vcvpt2U&e0TxaHyVQF8Gv$bZk}
z50jjf%TFEGiE|q_XNnZ1v2`4l{Quhc?!Vx3AO2(Vh~+=2;}QR_N~x0c|0=D&eZhbH
zE+1Hx5EB(~{e2PD2IrNIW5Ca>VUsU39HzZ6VzEK+BUEUa5@s0zE~`L@Xz;^vYo$>E
z?lM9ry6{{bT7yJKx>yyxrfV1?(4;rh+NhQ>8#OQWT!bdU&*rA+V=zf{@zpassq|aw
zZLG8SRCM%#-a$dz_7W)vqRi#Y-itUS=^hKMl%h*0B~!&9iKUg{Eec<S5d@ul%~{+D
z#|Uo`Z^S3ZrxC!-As+<<_m#m;QY|A&8^J?#`Qxks7URm1fUO5d&za65O{Iq@s4tc7
z>2UV=E(++;*dQ)G#-b{dWbY+x(DFll5qQEz+>jEHApRRtBs0EFMye6_dt`@#8CIyA
z6@^$Fgo1E*Cd^|?$e0P1S-2ND!<Uuu|H~&U{`16x{hG$~`(}Ud<mZv~|Ls~i8UL?T
zscgKg|KH=2<^TP2@lDJbgyTS$%lAP*cexL?%Vz3!&_IRem-0e1P9tx0mdgoui(+w=
zLvV@hfw%^QMv#wKwMrL5<x07-CLU071~R<;VWrpTuY7=i&Gt@rrFC%F+k?NIgOy&b
zUSH|qw^p~-{?IrnmrC;M27KLzjB`;QK~Ce%PI*H-p}5XiNtu{4m&0WP1$u$k%~3Br
z(@BjCwC}VxDo=9aC!KyznVraupP|cme8sp^x%J+Ilvhr8Nzunn4GjXllM6f~F9$j%
zUu8N0Bm}=x*a<SVEqo{+**<U#`^+r7CFqxVHSuxV9$Vw@D==16+<#b;hWii49ffsu
z@^qqbDyhKFKozC{o{&thCMlgGqfNsJ6Bo=zX_z_fd90cjdzEr>p6g!aSx<%@h$*Hi
z5~}U0JQX43Rrs3A_Q}YL*8|-v<fw`7N{|G;*z+4xK0%Jhqu`t$If!%9<FUp5N)^hC
zVTp|q`*DzJF4kCOHvXrZ;!wN>oEWL}QsW^!8cAg<7wbjHj`)$2iX1AtFo>n|*^wR6
znQyvXyZ}5@Bj@}`0`ye18@KSP_Xn(GkkQ6C4*{A>n^lSMTb#6HzK~>;!WbK=q(Xtn
z&P74N#qUal6bi%WnzZm_rz92v2@05=Hm^3-xl3Q4jV1Or!mpm%iOE>u7ws2I>`@xb
zzae$mNS(p@bD^A0XCd?-+l|KYBnr>HDJTaKp2Xs5eu3;$?gSwT>Q&6@OsoTuE{S%4
z{;@D=RWizBtw0)t`K0J5v2nwv3V<RQ1vkK#3A_$W!tpxFgE)WjU@M8_{GrScms(hq
z_eZKiIzk>Kg_tB-ywUSCS*`J^W5viysM}a*BpEaA39VL{|4PzIF6S+^B`|QDmFT7F
zw79$z`~=+-U*;xY3C*>m1bq}Y%dD~`3i||ssBNJy#Ag~k)q66L;ZERLaWc+z$r)?Z
zk${1)ekfE*5&I#s5>UGM5sMvfdTPeV;iAS2lF$~araQ?vl4KM!>rN6V&k(+=%H2C@
zPbVrx^ENc{$v|;4j6b!U6Q!9(l6|6`@VUhfn}@E-=qU2g(^OPjOz1!{MJE~|OxcuG
zij`ss{;tDcwVsQY2FK8fA%@^c>t9NRGT{mEW?cWuQ`2SUDw7g=+mzN)qHi10-6-TJ
z$(oWK1`5GOc;uqbiy5mbc4Z5{7im|uXvR}Qq4Mg8EO7W48Oz#pDapcnCHD8EVev>(
zyw0qw;-JSLM;P&%@9T;tiKOowYM=CW6V!#Ql44ORsOS5-0c6u7uVux_o+D9(Nh1Kc
z6O36xjrXGy$Z;Z71_?&<h>9>DaJt#?>~SKI56lV~)=A@EQHyAmY>g;2-MxtuMxKr)
ziRcu(X<tZRwZE_}5Izz&2hv^RIMEXN#S~k?#6StcWX%3zpm&7liMImA<I7J{kkQJ6
zrNGK_SK!<~PvTTbRRqh3ujgO*RHCD*L{V}MWR#|+$2S!y=TAm~N^yF)z@&(_K7|1c
znjD5I;gy>^4;nBf8Br*{oLN2Rb8q}F#CiKZ@xRvA)+@>QUvDZe_<!H!BjbOG;m(Zz
z^-qNUI^Ze=w@vBo)ylA>TuGEw6%Gt!NKtw`V-TmvJDZK@(qRHi&gtx&oFpf>1&pR1
zdIk~HlPBy?$q+2iOD0--jGSu`6LH_cV0>J|fl_+Ew|98kczj1#K*-sHOlIB0!W-cl
z0vc{4qKknf9C^Z^N_ZDIR39if{N7u>FR~7<n>W6QJcZr9a&83_DmRb<nTejjJRF)C
za!kg|S~MQv@EN~d{~V(o;CPy0$$IeH3`@okl&ZXKahV$aFMHS8oi@^>zw1}@OJ+9U
z2>B8xv+Klp4+au5gY7Kf@#Z)_wh#gogTzP>CzJTUZ#`Arx?oS7+jwSYtq+OOrMjvw
zb?fRXwJqKYC-g7)HF+mSm4&2yf8~C~0UZuB<qsdvKc<}c?Oe(X#18)Wclo@q^`f6{
zqk48+*apKzLX^HN?hSEz$!*nODz>&TGn}#iPN*v5>4WpimwpkW&=sMU+cKFX1@w?L
z<vQeI2co{b)Fge1$N$<^YlZt?N5E$j0VGe^1S_B0Yj$<L;=GB1uv~imZf(6(S=u%X
z2Y*N{&8q8(O*}Uq{7tAOBu}S4vN$G$5h`}MG6z$dH@<}C-~W*4-~UEL|Nd3OoBR8o
zv4K9EUm`&3-UmRwEL|b!GGzi%Gp|?z4#761R0l6v#d2``6an5PYtYYX!tw33k}d?N
zIXrZ4=I^FVw9&-xec%#s^uLsbYwT>HGF<<X0LTe4uvL7D`xz74G6mjrbvIMmEh`A8
zwt&?$HRx9^@5;Y_`npE{8`F}B;Zlx9-=_%3m)HMz{OG5(yZR5eaosTf&M276X396T
zafAMkr_1}lj~?CW|F?3jprY6vkNkgo-LU@0lSy?HE@qQxUggZjU*i(EVf{Z^`)Pf-
z{>$cF{{P##?kNm0iX~rb{I75R8OA@`^QOiNG(yxqVN+diija*Sqp%8$>#6%Ln39o9
zI7Ts&brOJVw|y6rwH=L+nIM2mJ4;|mHoa@|b)y9nH!veh6p1sX&V^cV3OhZ?zscCn
z=K<FMJwU?0IqISH9>cx}LKpR?ZIg=nl*u_!GdI8?S5vHJjmCfomW?($%dwfvd{3&{
zBy)czy?8&qZw~iJUqpSJZIUe?&?yQyzwq0_j{~0zpWaV=e{f%NZ}t6L2^Q2`c`pTG
z;Qruafv)VMr5ix>J>!%w-2xv4pD-IPLawi>Mhlk+nESr2+Ca94ZdLF_zCNxR<G*vg
zxjBk%O6$lL0h1vKuefkE*O19tMVdlFE}HXczC~#KJ{ek^y&wlmm33NKE{KiO6nv;k
z`(@aV#JLhZzv77BWD%bF?}+pOFO*{&B-k`MHpaj>NCy6-e4p0PeYp`RV_?Y%zJz`s
zYrj8z1%C&zJoE_ve3nI1=q(%dlqWzg1~>IArH~9X2ZOb|K}oOwv6&gbLP{Qh68@{Q
z{He6`^eO%>8pP^B-dB@tQ^wA0=ne+b3AO=|0d{A!(%-SAJsWx`?vU><ZZ?MhN#3hw
z5wbL-r}BvU2-pr+=;vzog6Uzx_BgQh>(WEUB-XEpiHkv%(nhEHei`)~{CSd&sx8ke
zSG{6<$4t*{voBj-a~wwlsc7$5ka@@S`^Uiv=wF^s!O~>H)$KK!osO<t-=(JReF!c~
zIg8zZTsz_BPBE!Zc_Zn=N9uf=|I9E549ReUY*BlKK?P^prmv2d$}mtr^6m8#$L%MD
zN9FZTQd}I<jQ(TB>jcgNLJ3cwUi-8F=(6z3I5vPZ+y(^XvJh8aq}6>p`dnJovX|$E
zVa<Q~;Cd=QK?lBC-Bud>H<8#+{#q)p%#J^e(p*sD7oZO4_8&~eD=&W<r6P4#4gkb1
z9Qvih@I1s>2#xx^5AsKzw9rIYF;5~g;XQNohVs9*)n;xxn`{1VsViEzda4=NGxe0#
zH2n)M@=TTK$48nHA7y5Iq;9Jewz$#e5)0HGKXILD2Vd^TM*hb`{*k<&R_;v3f5!D0
z_MaFB-_XWQ^*`5_>pyI)Z9cw>|G$;%FR}mXoUDQ^ATE-Wv*GkPfubb`NCkUCAx0(n
zCS$Fr+!geA(cwiO=L~XM8D}+gN#nj=IfqjJwaWRQtdh%HpH|9AdT7nNY_#%9D(bIM
z%k}$OH8*lJxKwWw5`hBZQg(6p+shwIEQ$W=$$xiU$N&3_U^1vmdYmfB`hGM?zUd6u
zjr@OO+5fkWErC1!e+w5eatt@ZHhH9#xXFh4v}oYz`&=bQXK5r3ewaq$jHGHJLS<st
zL*#l$9C{?le^QT&8u<OiXoMogkQEuAPY4Mkiar^JWM6;i%#kW%!+|=EW`1ZIl(M5l
z5m(6}8(x_F2ZU%R>W86Z<2!*GUR^iAjKzAMx>p_?*Q&pBzVTzVa`K>Tey&trmoIgY
zeHATTTjbMV@B{skMlt45JDzZaQFRdpzmWj?LEqQ42uo&YNIH3QA?~?$zIESE0VU~S
z9A6*5hUei!RuYsRrO*nIvmaiUaQ}75E-ykH81ShxqHt8f-Ag;IKvw#&f7ou@YnNu9
z|ME%6viN8XI`EFC|KGZ<;s0I~$BWtgG#>OF?|Zay1OMM30kFLP|I@}@{kL1WR##My
z>#3*vF-UAAGXT37oyLx6^Z7F*SsrXW=3katNg?$8vHLcNBoUv_B_)Hme&{Epv8xrl
zdBx0ld@Xaw>$=iRG@M_!a@rs^$Bp%#$-}BQagp{Q&;QlRs%70XDGi?{^Fa_f<7c^B
zLob|9ino&Y$tqau(%t!B67-Arh%eLa;yvj5xMKxmq#z=_j6d9X<e|PXO|q30MEY0E
zApv3DT>KaRNLmMcG91tc@4bniJh6-fDgzGW(!)wlo(y>}Ygm?(uD0<PJ;jLOl+iQw
zQ~*7D9hNFj3i0#hb$vshW=&!mt}=)ygTq(!Q^DK-grA;hI9@-|PZ>Jy&ZD5rk2X&9
zmn2QM6{K(3d~F|`b{a<={Tx&c`5<t0Jx|n(4a0H?pMC;qZUP-gK<xj(9~IqQEY!<_
zTD6)7ok}*Qs=pW>KioKZa`iC;A1ORT@%3}ZRDR@{k<3qFduHEYz&O97j%IzJ-+s7W
zeCN%R?Bpqwp7I-5nNJkXlbG-6*MkQY#_J8_b{S|^1YibjlKB2Ph!zCxZnOEzX}8(S
zy`rZ@=_r<jEk7dPAs3698?t_!END*HY1_7bkb}aH&=4VHoA(O+uTS-@p*rqg&B^Yr
zuel2HpG${-|2Don{%>>b;a&XStz1{fztgNW_L|Og@ZH+@wEnlgw)xXi{+IPf57+PF
ze{SXK6$*@*4D3kMHZe&}eVD9%=mma)hz-x5nd)80?b7!+#>2`A2BxLW`V!bdava%r
zaR!q!2$OBTLb}k;{*)Styp<I`th|WT)Sm(ez6({*mbeWRg!5+;*ONdEG|kP*=kPah
z0l|DxOcWd((|4mN8kpb}6b_Q(I-mi^I&etW9c6B2qqjPub0X<U6mo1xq82k!Z9$Zr
z>kV|FJ*a$4%{btdB*ZY)!(rf|pkE!OVE~1Yj&*5Y?Rf^8COV~WGM>=e_Lbx(KwE~R
z>mwP7KQSNAIJeg@9|mMv_Pt1_f<~HU9?G}=goXoMF!y6l;G7*)manO+qa=`Ob4i3G
z(r*wcr0GW(4)rUtPNU8<D2J;fjDo}$+Fhkf?fLmpGuUPr^m9=^?qWWc*e;EP#@AH!
za}z#ROr*NH@G}QGaY<>;Q98JS)WQ{X+6z}ba@HkkX&Qu_)*QiAiTJpDZ$XO9dtF%1
z<h9mg#Sv51Zgj!vQFRYwRhaWD!`j~7wk$KJt!lNJ{bEwMkhLkBY*66nD7<q)lYn!u
zn~jfbL@X)bin(2wt&?aJc#b0M5V$30&W64_#|gExBlY2IB#w2tNLMzIFjgk>D_m$O
ztu>I+ioQxw*XdPs_?6@V@&}eX0++~D^-LDtSO8abteRIS-kqR6p|;p~ZUubE&T@5z
zTFyJ}C-cm#yPj-0+wHlbnO!NW7SGeH#x=p<RCpxQwk(UweorxKfc?ghmphcdK^U6K
zvpmn!;JeVj$iC32tLCv!EB~RRnu9<F3+Lk5QfBUz(IIhdDTj4+#2!moCI$xuS(kPP
zgtvse$pqmytCBP#9f+_vK%UNTZW0dwR5X)h=P3o|W8Iv@JUZ#QO1(t}?(MN99hoDF
zfOe%RolrNeZrYEdb6+aD7E8f~>43T+g9JF_s>+y*tS_Fy^olPl;=(r_khV>h2}DSu
z;Hm&gXDQ)l1{Iq1>H8AZ$uH^-oQ$f!EnJe}(=**cwt=cRC9$q}j5II==^>|wM}Zdl
zvFW5StDGPmt5rA(92R_F-b0=hv!we3mncHiX^yo@L?WC0gf<D&LS7E!_0ST~XAVw`
z1>K`hqnauWh7F~ZiVK@7DGPcmX?0Cy;&Fe#Ke%<n@eK9C*Lclvqo%rm7NJ(LihPb=
znq~Hg7=4)GhE-yV|L9EnNmk8DO8+>Wx?UV5&e#dUGdp)$mnI7e#ta7P>>gnck@9nM
zuhwoK)K8yxYA;TATl>8;$9hbS7Wifwh<f(MKOOn=Q=$EIOkAd1IWu`N&XPF8!tu@=
z^@=zWyc#a{Fnl#8zATI{<;&T+Cc(km(LZ0q8B{V3ki`_hc%JYCkfj~_x*P;?e$R{I
zfh5{VIZY-tLXpvlt+_Ji(~*TSu(LHP9FeszW`UAH9x4dkS&oSw=2?!+CA7~UqO)l-
zPlE|*#D-<$78Ta2s5v6v^bhDS`W$zot8}Iyt?byc9!#)t$`1{6ot}n=BcCFW<eCN^
z=qlkHob17$;kgr*-I*q|8zjU_@PPCgqXf-;4W8aTr~h=5tYwT1aD<3oAWU1-S?*Jw
z!s)uqDLz1D@HWul)oD>*W;`BssfZZ~Zs1Wz%mTXHG*^4sGUKNMn-Ls6ozV&fd>KQ|
zTSAD5iU_fk&$yz?2cxHrKB>FUbeJv-ob{+K_c5axz*RFyXw^888)vT(^6WHyO;O9_
z@NdW3G-Qz?A@x%jlT=~V6T7IhvO3Kb$Po34q8r3;102%lB2jN4_;q$C3}?OF;#4#=
z!YBnLt7`%d*ftubOuO_ai!P!L0pLbG&-6eJNjIaH%gQ`wclSh4u{zldb_t&_Q`B+`
zAXRZ$CC*I>UN!?>yH?5<uV@?T=bx``WS<oD4U5!S>4YQ6^lQ{x^naL}tR$)?ZpfZa
z(~-H(m+F{CqV!4gI0s}cM`bvG1@38;GTBP`9+`+_K4dy({!4U(=g!=|8Ap1H@nfY!
zrVh(Ynm?f;5*MSft@BYyej|)&L^CakCc(gFef5Hc7ZTEAsINhuIh{s<I;k7wI2$1V
z1lfc$Y*z3#W&~XIFnT!`1U6?=OV+hyzRUC(EDEWxV8FPXoKp@%K<HoizI0L+tz_5^
z;Z-+7kuCsQL!eqqtyHj@uVJtnsHs(_hn#x`R<lWf$g?h0Lh~jE_&VDd`BNKOm5*g4
zUexP6C66>>z-LKx=!uA27$V4IG7~jiS6z2)MuagjGh1p)osnI3>b*&#(1}RY^G{KT
zvfth`84*W3r#svX-|Po?gLzlaWSw#|>ungk!}L6x3?h=_w&caz{ICDqVkVFksXuEU
z)=s;v7yGr|VW)Y#c5)`_FP3UCO`4Rc6B5~X&N)CNJsO87SpN)%_f`Mjco37KL;@9i
zdEdnw{1xZFA3xr>^Z(w)b<_B_TlMCCw~152U){zH`~REkkC)@Wa3=K5|9cx3^T&v*
z{)r1IGtK4x1!+{+Mua*|BJV{oQ9VB-5wI7KDoYyT4(WP+ERuT9ozK;g3o&Pm9lckt
z#lvjTp9CJsa0p#n>xL5uUsB!X)_6XjZLO|y6=Jek<&a+DMDb`<zLXDFfA`~Pb=_H8
zwXEmF){%lS5htk0)^stBNTW)|63!5Exg%1tvS6{&PPb7q;R06dLh~0{n7vcLmJ34H
z*Q88t&|iq%3{40!l77G~2K(98YSO@$5=SY(f~TE+tiZ5Y$^7MM!<jCbCQ&a-UrgX7
zCJ7#Ev7V%XZyVLRL_xIWi;B1`ECV2|Q!?-osFzDnX^eh$S{XG=dzAImm`B!iqX%UP
zS^|(l4Q*Xeu;@sY=0|)W6j~EQs<FqHq-gbfUe?Nr+VMw$t}Qd<LB7&6B_1_Lt*ls9
zJ`%;_NR$m5|30)O_}xtRYhK)3S^?L;k}U{J)g}|g&#}rl3(kOgK(x_pO0icv;RUHx
zF5Kw{q24=~Ci+}(6r1=;tKe$2P0rRSR_!30U#az&O)unb4a8Z9kEZ^d^hm|#OCBj+
zTsZ|$4EorI+MJt1UfKaP(WtX+4ieyr&+&$^lXDH~GM#z7H}QxWOnuA@wQ&^-YAx3h
z1`8r^u<-mp1rcNQ3?grl>cSEv9}ZS=et{Xslon4++If=oc52V%NdR5F-Bwq151#jq
zYMrK{zh8C^er+|H4Yl)%9ya+DMW^**x2JXw+KpzXt7`iVy1U=&v~~`A2Xv!U>(ZAc
zi=Wi?Unx|fZg#usprcxQFWW7GM&LWO{a&ltwN-1s-ac%gYJwsNYX6|8+O54-k6!B?
z*l5+d<~w!pT<tYG^<DZ|+iA61y;t1e^Hy&kjXkH<YU*XJ(`(fa+qI5*dDwY*&?Q))
ztkLS$+qKqSv*A$t)TV0w+T8CUrBl0oEup}^K;{mCYPV2(Q`#az8?8>W-UCJ1Uv=s|
z!mw?t?#pJqg+H4A(<E|gomVyiwE(r-{O?10i=L`RZLju%$SdE_Ei^E7vJ>`z^}%yX
zbq{yCy;kqA*HkYK4jSCs-Dc-k(viAPRQsUIJ$Be_+6r~Y(KKLCchO_|d*`s*LdQ{G
z@AsOW&f&{m>tMe^)E`mT5bZVkw!vL|u+P*|FCBDV0V=wIN5ED`yG^=J1HErach%4h
zUFx=aFaI93*h49(j7+uPe9>;bXztgWczOUZN3AaECDl5uF5YNK!$&o0^$=w9ND*H0
zXKw1+Jf5ocT-6%CwtzVL2yfFI=(hBHp|84!^<CZP&OgIy`sZ9X>Hps&8sw(@Pd`20
zSl0j7H}B4W+{(2(h<D9kpL*);nzK%N^_S{pmL=O`*mBB3NK~@ub1H1nCGXeo=bfs%
zB%f8|edta}rR?x-UwOCDsi+j6tkg3cWyd2DsEfWsituV4>(wF&CuJBB30V=J_kIPg
zoYV@^S}cM}&I${G-AYTh#%H1f^KEw?5h3*2-`rwyisOIN`qw8q|3v$L{n6v~wJY}j
z!@Ko=D_31l95P;b=BTzmLeLT|2FrrEOLImYh5;6?tE)NHNhtJMze0c8+atw_{wKAs
zQ-d-CeHLm|O|@%Bq$qawSe<DcH08e5bs0{(`GS-&qd+-O7)A919HVVCNCjgBECs>M
zHwi2Qsr5+5*>Aq8q6{Xz)@imGk?wBmrE?Wk-F}yWGXT^Q>g);ftaU-Tu99-Cc52;L
z_Zk>`wO<&OoTki>Iz&&0)vRTeDJ23b89ghs*-=LaonHh*Y6_5I);!!No!FNC)4Fsw
z)9+X#HkvHy{)g=zntt9n*ke#%gG1UrLr8JJo(kLpyunVa`{g2@aVaJ6&53)#=HV1+
zS>G(;AQ=Rn7*_Lfj13-~0OYjZQH+y@3*waST<_K*ii2!t|D88kBr*?;=_a8{lGdps
zW^-A>0I)ejmRdzEW|7{M!Zb##16&f2I=?L#*Nf1P%SlC*`S2SDc}*r@w5r6<N)@2)
z!nqTSkfTciSE8Y%W75XK%vgFZ2XOS^9bs?;MwO1}^%7)A-H+KCX0S=>dx9D6hO+BJ
ztUU;STkw-H&dX_M0Pnj45Ql3B)8`J>cB-}>B}~B8sjIlp4coVsx0uWqG2u_hS_y(j
z<{X0sa;V=*dU+GQsTV*?7Kx>r1SA38>lhw6v^n(M*uw57Y+J?lFgF^6Lu~QOY~aJf
zJPx)vArRUXdJ*BziO|p^9QnhDAg~d>jdZ(MNaIc7VeDgj&xIP1B-pB!z#(nxW3N1k
z5GcfhJmlj=?@do}Fb(2M&`XAZNiYrc<`w$Pk9q&heBogBqK{?3kb^z#Yu`v;!xcGg
zTr`ykB|>cA6C}(WM%$9!_cKqzB4)RMcqZmr<GFscR5n_slcFplDE4OyO#|H>0fHYF
zTnZ)@H;82p1)(*QigdjAOpO|I7>lFz2pJv~>`FeD&*hEGqhY#9a_~ijx5V+;g*ie)
zV9D;jYpBdQ|KNC~u8LFqvFYfCiFQ-*BqSuF&~lR`qS4_=4ymJ)%rQY_cGuR1!yukw
z#oA_Yu*1j^KQy5cyb-Hp>{}cHA)^X(KFLqCa|g}X>TNV35%0#qglL)&NwP9$@NWVq
z-74b*Sh9YwBc09T^ab(d2J^(C@k(8GNDegd2P0pCP!iyb&i)J}t+ZXVG4);caZ0eq
z9AT&fHDS>$2kw}3LYnzw#%ml2QTar34vB7VYKlODOam8!01_*u@1q*koTECR<az~&
zCK(@x5zyU!B-O(-6E79ow~Fl(Grg%hIF8KbAYmOoYVlHMrP(gJ^5D)?fg>RX3=(CN
zjLVQF^T3_W?c5OBW{aP1lBWG$oQKRp79o7BdjESKyJ0fnY>(VyPb?KsOVbDoJN5I<
zMO8Pk@J7stc!6lrtIh-#;NBA}03?}U|I6N&z`0eGix*swsLu_-hbXt{GRZW_EN!QB
zrZYI5N!x+xOqrzxN=fe|H#2FI+>o1eI?#gq0uMn&eTw_OfhdB@dxGd+5q*M)@^C>>
zTp#)rS5T1u_kCx%=iDX9w1CSaKj<X)p5;5=Ip;gyeuQ^&r3zaxyC7Pwu=7Tq3Tz{_
zp{p8Z&b0Xrlz90nMqZ+`av>|cF(thFQnEcZowTU9b8o$zHw%2z)(Rr0W))UhHK&|f
z96xaEk~;<8CNA-1cXXIllcla&6Ek58(*cg5WPuRy-A(xzky5}+I93S|$9}p;NSz&$
zcrZtJsGU2yeSkxGWQ)Z|j>=>=vFV<t0y&DZ)jdqs8RSCN_jIi9NDpz*l{KBNSM3U3
zmAcKW!f{E*A30&<`B70XXA5*HbajDTSA~AM*01j|IEzBNGs463*hm?{6d-ca%0R)h
zjSUwTi|&cR+CU<0*?INc!#W67j%_^{Df&FwnlB#?pEZyZgN^smHr$6xj?sSZ1DL>z
zNMO-Xs02}O5L2BBD$d>Atn+xRX~yWykQj>=4IrVgZ;*-rvq+~Ko?{Dayy{5#9BRXL
z#882Dp@)izvPjC9V#|!3h_G1sVc?oQW)>KUVBY2IY&Z8YQ(XiRr-KE2Ha}sIB3rOu
zZRm&mrt<Y7{!v)DM5F+y*k@-Y(*$!b3<|{8&LfyOqciYU9-9t%0OiQjsEA7?B07bQ
z+mPxJruZR=UR{hEBUf>>Z8^xOiQO_kXVEmmVPmj#bZ8^xndxHgdZD}LXyE|AY5_c^
z6Uo<!k@2-}$oAt2_1J{=;<V|C=qp&QqU9LFA!rHA7m!ZJ3Q$A@42f*MIpIdGMhp2C
zN`x&G6=)71Mc~k!lXq2|y5XQ;dROk83%#-mkrJ?*(67onmg{)C2xGD<1+o8Pg?(`^
zd#P}rF!il5ns~P03StDtu5t#Ft#ip;G3JIXYCQVnB1AW6X5D2kB?f1Jp63g6z@ror
zVRxhmD#V$3bSyKgv+@cgvO`%lmU<M+D(eneM~BG`f?_y)(R1E{kz`7v3`C8?<II`d
z*MG)Rh<}9b3$_x0Tx1J$mtX?r3=F#xydUmULC-m|8S!CU49q<eAC`@VEj%0t90Zh^
zphh{33wZBRd5^syMkQAzKW-T|fV*T~i$GUQ&af!s$BXyygbWgKf#$4E!4E<zw;vmu
zVBj<8p=L}nS3z1SN*tClWB3ZzF!H!F=r5X^6^t5T7l><th&3<?B2j`k0X*cXHfM20
zP{scY*IA-5SxmIdnC&Hr++UIG`RIEN>~715K&NQI+6xXmA~|q5X3Etd#_6S~<OD#R
z0~5z-#8xiCcoz&Evlq-_Z6TSbxB+y>B_=BmA_U-pJ#lC<P>PU`r1n6i%a)%mOK${(
zU_WkC_#Q@qBjK__2+=b_h+brIM9&B#dXdEvJtLIpMHWf){L*z~(L~SCh+ZTr+%e+J
zRa@*Xxvq1Tg?_f~zAzoJ!7%2J$%$}e5d!sHt;%YlyHs?@haF+t)Huv-N(>fugSrM@
z6Ipn@GO^??1?A;TE<si;)Y<3QG%27axV*>caMn~-uh?QH{dT-Uv5d>Yl`EG%5nW9X
zWj&J=9>k4A0`>ytvcN@%;ZIeTT)h#aLb^3Z&q*Xkj#3dDm?#eITLn4|XpoF|!{qd~
zvRxxh2=|&4;LR065QJgr*MX9-VWx~R8%a#gqKE}tuO?A6&fLyfMSWeNyh*HGPO^6J
zmE}(nydA#dgof6P8>k})9y^}U9gKUGq$0+Qa`xNkr0po$1}Dh_I~Z3`wq1uSJ~}S%
z&Eu^DW#M^`a{&||Z$pH$w^|mW6+<#dUxN7Uf*c04SSJrP74#<RHLY9bYg4Epbw;u<
z2X9zF0P@m>8m)cWbhI4{**eA>apFJ(ooB*v)r<)dpkvNBbj>4IOEO}|_=cQ?$VGaV
z1wsgtazY@5I00eUtEz3VJ0)C>*{(7dIansh{j(E>sJty(3Y0jw!ZL^?z}#k)xfQNO
z<O5bg1sOvPVI*6$OjT7P^mJUhcQ_CjQDrW0)s(81;sm_zSV8ik^cEw%fSf#{i$Z(Q
zs=AEb^u3AcITI}o&z=z~3p$A`WHw=2vrIxz7X1ek5}|Baa|B3z3XfFHD??R;bPifh
zLAV>-%%!NT)WUHx>9c`}E3H|2JXoU~%gT<WrZB|-?8RK2(RUjdlUXx}w7KqQq?4;E
zU~`cFR`$PU_Fs?1`;hu*Z2w);wWfQWH~(kPy0wqle;<ucM>{2C^Gq{7Qd}5x$AuQ$
z6tKR>Q^8ogZ#T;ohrA(oJryFb1}zI3WC476Yu*@Izn+K*g%trg5$On!mBaRgJp`3u
zHK2>N4)`-;+eOY?QS8t@Aj3q!a~6=ZDo;zwlgj1Gc$3JM;fc(ak;$p?%@c!LGg~4e
zMA`G)=<?>FEBo`yVfVg=EMZ-Q=ZVwC963)Ui|bjFfs@#thXW~t`qI4!b%vtY`?NB1
zKtLN6THT#Njc=irDVekI2cXd3VQMtOW4V@Lf%lH5Kz$}NQ_t?TY8hZ`^BIyaLt6_f
ztV666DVfgR(E55+dK>tL8Z8ydLD&HaEeIcF%o|fIoC`-5yJIE8lBBUxIlGQa1Qr`t
zux4nX=uHp|P6o5PX+6@_MF9}D^BR4TgMGBvaIIxB*$POw_<w}O)fv&DsBvCo8ER+p
zkqF<$gDiE9#cf0^oer()0?H%e&S`zO^L;j4msU?oXuyvrcc0Bzf`5dm$Lzl36JD~o
zegjpZ*bc}tb`iA^B@><08Ou;8<F#IB1SnZG#@k}L5)r4*f~#xQLUu15wJf19PXuJ8
z1Q~E)abq+kA)+G}M@G45`Ji4vU50EBMp`hoo$k02R%iAOV@r{&QEC#V?La!IVokIj
zvb7B69Z{V<yw(Hu9cvj=>EIjyYYWnxYY7HS%7%dbOIghN#RY$8*v6|>SVLqk0UB2T
zEC_ulOTkfKLbwc$1(wQ4r)E=7UdfR`#n2cjC@WhUjvHO#&Y5VE@#i&53CIOjje=k?
zbwaK%TR=0Uu@#PHY!<8VK1DDr3wU13RV1kSiK{5%>vNo4CMQ=N#R8cXW~ncVG%X&a
zi<E|x$C~Lw6GnPuZ2RCS-Ju-3k^tu$04lEUfp+|}X2_DjgHw1u-(eJ+i=j8{&bRc~
z_}27R?2G5Mf!6XSX5C>25GIqvWsZ9~*1|E6Xyq7?g@Trw5Dfk2P<uPaHKyL=G-y-R
z^3flb9y*lth<)VQ<Z9XzYJnkuB6H<Nj|IYI%qb8Z5>+&0b{sNBDuysj_D}>aVOB6s
zG!tEkP}~OM)I}V}K@KH)wj_}~5e@5;PAekTY%)V9viT$moK0Bhxoax30h55NnUOTC
zQUwK`y8fPVg-Hdeg&H55Cxs1^VisK20;LcvwAoduce;=e=o!49p#<{`f&|exI%?SD
zRBiN*VwtSiB583^v2IWqj3eR|l?6ucTUcP5t(v;FwBxhkdXM57i^AbRxn5NIgFu@l
z($J%C9cx%5iu3cp7#M{KUI~8eKf?gV<TtD`rLApYEE5*yq;Vw4<uboAK}5%^6xm3J
zjXVyRAA&rMOwzWnR7mW2FnLBSKW%jHw=`=m_fAG1O0m}*Z|oI=WxF_IF?SF@VqD%?
z!E)X#;yPthCFwJr*;N<bu=AZMH8C3n@gaye(xSDqTVtg1jBQ~OG1#iYlB|ue2}wwT
zO~w8}=4S`>OaQ7~GuL>NjOcSRT^+^f7A-d+me6TgW|dqB%MOeQC@!{4SAb%MG*V@{
zc{Esz9VPcb?Kx2GVVj(UONISJrX8ud0Ty7+7Wwz^4UO4GePfbA$QyC~d6yfHQaJQg
z$83i5)>-V*V=3Z;R^Op5JsSBVLLFFXHr6reB+y3H+nhzsH0mh-7BlU%ILGc!8ty;X
zls`sr{)t!c;)qqVg&cZdvhaEUKTq<hbXqIRv}G(4AJi7}^!ITF>qoFFuc!)7Vi`$-
zw5xm`D60h8&aw+oX{5<vByf-sIB@+?pjF<E(lSptJjb)XRWXYtnt|;k6<}_`+`J=T
z<{Jg^FTI_iaZYlWI>JqjXQTQ6<#v;~Li6m(ZthERwzSP0_f0|-HV937S+a$Pf0Ow!
zG)2x<MRJp7`U)36Y*4Ado%T223dp6CpkE9->i)#R@7G5E*v5No<M}t<W5@OXF-mf%
zhxcI-lr}p0+h|{+26>P?!<dqY(#~=qX(wX(bZ)0?3m-?@-xY86&$mtvQBKhp%-`dB
zd5qRQw)|UI{)Z*xw6+Tdb2$-i;*OYG=-Tk#HpF%tE{rzC8fJ(kOgQ7Lfg3WRG70Dv
znXB5E@tmzr3<sne2H1LVr0tKFBIP~HX%3Z%TT_f;bEyz38+v7<%_S8wH?1#L8oZlm
zgpveS7F5(|D`raCPnDquj#yZ0n0*E<Ho08*<dSY9*eF9lJT{AeKeL#jixx8Ok&pq_
z9)3#pIwRQYSh&3uCp~<+TiefQZ7LPY6j8u1>NmD~=Dqvup4G`NLGm=B3Y1T^el@_l
zjuC($)@b>9?PDSaqD6>1A6{V1{fh$DJs5CbNWl(WQ?nRBSZuaPRc{2h60JbxC%-=1
z?G5ukcwrapbjGdNcq|FwnB-Q_hsPNlbcr>AJIPu53Z|M#AWYf2Nb{w?0~#9#4xx5x
zIe532nQ^$C)qJ>t<vuJLc=)Vk;D#+0(#9Bzd0W7RR8{dFkXa#RGi~H5Z5Qjp$I#e8
z8P20_ttf%V$uwIjz@Ap{=2gLfNQY?X8rx91Q~)8aLBxPF4@~BW#@@6}c}?!Jvrn*l
zbiqW`Qi{xAdUhMmgupT!^=-&AwIRw58C?pGC0MGem2ul>wpqkpGu^K<0px%kW@0dO
zafhQq${E&K4DR8j5P0vh{D++FebSvx8J>3sJyHnLsUhbn+;+L*vc*aE+BL=OW`(DP
z#IV4lM*ro&V>LSvdIfgFR4F@o>%|WR<?>{}o1U_BJQWRw4;swjjsr|X@J@;{-3rem
z>-fM|#>D!q@_Wc=I<fWhUQjFmsL<*_|3N<KX*nCjD8@Dv2B`Lij=}&XxKL_sfLfgK
zYgo-U^UR&tJk$vfY>Iq(TWE?rd8x3sDS0{{T2o3%#E){uJKV>ch?@g4ZKh~CwIC<u
zS|PjF!J5pI8dI5IsI}&!?6#Y!+0+$qtnf9Y5OY5E0w<P@$NQXP6OM9ZS2HMq@E*`5
z8gB**ZVnyo&8nv{hEMcEXG3D1+<lAgP%U4!_H)E#FuQ$~n0MNct(NnXosc2fvwS=p
zrSKqwmW{vH0dO*iqyoSM3dg{}J5Z%r!vrR^Y*pc<R8Mh>iE{s=BAM0}DlGg^4hb5Y
zc6cQV)mk8PRSPUVnD7>?s@!nSaxlt^Sbo`vpq)e+JecQLZ@B#!t~$`&(VS;nP<mf;
zr+WkA7#Fbp02h9$;Wpxw&5AQ;%Wz^q>MSO$Vk2NT#G>arM<`vNNuh%|rTySg0BoL-
zUwOw42}}$+!T5@BZxuXm)1F2h5Wp}l)SWCoZsv;3oMJ_|pnERTnCQB+pf2jAdXYkU
zyhE5$fMmmwM!rTc>m*KdboCzleL?=ujSFE&yjgBii0vUxCUY4?e!~JtNa;NgE*`$h
z7NkcJ;HB{j$>qT`K^5e2Exv>oWi-`be;O3CNukXO9F+Wx!$(19PORO?5JAaT;xSJH
zY+K?1rVx=4*vlr1#H#t}iO%^HYE`3cigZ<e-pA{*i}&I(OjAyth~}e9;~@|1Ko}eA
z*i->-ME3@l`!>(RHAxgv<|`EdhjPpwGDwML2m4}S_OP@;aEl_39wPZd4F`!8P@)`y
zp=wU{69F67%U>waPgi6b1_?PMUQ`KJ01qz<2imd3G3@Oq47V+V*BWx|S+fdXN<w6D
zf?&00A5rX*f`AVo5yTUzqvG3JUW2;7rpP_&K&9sd#_&+`KX#v>9Hx@8&^7n?!vaDG
zkWfpIiKvb1Al<H{{3Nnu$cQVI&M6uR!ZZ#ioPr{|gfV_rxh~>5heih{Cr5@D)`ljx
zM-EaBRFE>Tu#2{BRSfiCff$Nfk)5&{{Un87ohM3hFu@EeT*t(X%ZxQc4h2~QnJgp^
zh-2!PO(Ub}1RtpbtWLhBL~r5sOFqdql)AItiNs^8*a*827n`zK$X3l(Duj?hk2+uS
ziTwIv+^1MRDa%7gU7ejPyh3)yfk9iwB>k(vz~@?|>R`bbs`0^{5n~g5=K&}Q!@@W@
zn70NIWt4e><(x;wD=b-Ht1-lGWSlu&@)G29;}C{;#E}c49vY+^O_>TVj3#CXM1DJ;
zjizUgwt*G2B{Vd!?_ysgvEo-i@@PAp9cFrV5;B+tA<NAa)hHRAzn3rEfM2}%`w@tN
zra~bx&@3eRA3X-z7m|FC=`)yG#4KVimYSs_`fnX%s6*3kWb?DQ#N5*iC#(X?ScG(j
z+glgWysG4(fGRuh6B;t49Xl*l6mi&P+b@tDR;wXG&Y@~ar+K0W7B9!t%9t{cZjmmO
zxTb;KZ!d0$7K!G(4w`BV8*l=%>=v>dX$L5qYK_u9)u95M6?CaqfhCLv2<)PlS0s>_
zm9#8`Xn?Izpj$vp{XrQ>&;S0d({em&pJw@A#D&6#(?_%We^#&S@!tQjdUfYx`ClH5
z&*ao_e`Lqt#8|(P+yVPGGQMpJzK%PQ$V6sn)9B#l$$n#b42s3!4;I9~Pze7Fr#DV-
z#xJa39IA{C%R2mPJVM2w(OGJ9s2|D?VJ*=CtEW7cH6wcXtljHPRO9)bH6oEz7Rp7A
zrsko&WY#d2Z-D2RTdNE&swE?tH`-J7Kg$))hxJ)p{-^9A_0e$ucft1WT<gpK)brT=
zKaa{MF#i+zx&A%mf9mk$PAV2=TF9M*iDyExDXEVz(VoAUH#-xEVP#KMC_^?5O3x%8
zM?It|>UqU42!rRqRvE@J`WWKNGW<fiTKL1h(HHk6`wJ+6+DZW<;2Ue!@c*mUHvBz`
zE`w?tMr*Y-_zfc%^6=Wcf2CJH<e}qcy@ifD0Owxphd~~}w3w*Q_9TX~4#n>4O0Ifa
zIn~4@-kP~RK%yw+V87AH-{p<iTyh{RJC)H7CF33|1lK|+Jsf1pesA~C4f~rk8uY;}
z1qg|+ferrNwNXH`-mF*$>0gWcW&4{P@YHJ9eloCwh=K)Q`>T`|Kqyw{+qI)Plum=0
z<PK@ZdG8Xuo%D8BlMXqsKx_}EQ~wC&624_jZD8HF3KI!i(qflY0cxyb(%|umm%+Qh
zQI=sSbZkmpG<xgqGFJ7gW<)5d*jSa9t&CB4=>M&T%0?g$5OPJ%Tea+5re{rTWdkH6
zq#WO@1qC^7B@b>`JP5k|k~eLOIs`s)=tCyngVDy=mks*!l`FZ<e<_kL<7ED;S1Tna
zRA%gR+Z)iHds}cb{52feB2#2|ePNinI}?&-P`=jF4d!eQIrBAxRMVY646+n+CyR)s
zBFJ(l9s{iMfdc_8Zs-?75VhR?@iPOA+FsX$d{Cj&<Oy%YmMS1|-_DG+AM-uWT0Za+
z#!4RyVzCL(!||X@b{HPyynFB<N9$|s5gxhdMjg5POpg2@CEfCHV8nRve>fQOk@DEf
z(s|eym5b6!$ajZUTQF&dSet+O+t*h3K(`Iw3<TEpp4Sz7-m1#PY-oYgf;qf&f@dh~
zH@f=Vbrqw6_)}%us9<|Pwb_SlC6g-8#E*AYj#kq$SoQp#%vfgY<WOdNdLkY{z||K!
zM#g&9u*dkRRL$9viSU6~<N*E4Y%J6!vu1e$LlhlLltmV;<x0E?X;g)R)x$_L0}05I
z=yH@n+0VfZ<Rh}dgF+zcqA9fz#w#xi7%*1xjV-oPt?ZtG%V@Y-FKF8^1YsQ*FjjX<
zp4{+`-`gzKjeBQU0~=Tq(V)u`dn&jCw&x`zD~-<mLZ7;ce_RsQ1TMTwRdmYdNm*Jw
zt3eb{EA$z#ca*%T^UMO<Ew28SVVAg3Tom%=G8w!xv<7EDws>x_7~{BJT$=>rLEmaZ
z?v|T#T9wPf*)#y6J8Km%(<7j{XANK>WVP~B7TFAs!ESNmQm~|UPJ)<jmV{?9y|*B9
zBZxI!@xBl|DRmjH{E?=r9nocM12RQ>WQ`av6_3en5>uN2xIFa(p;Vm&TNQnRq4kbc
zzzcITB#fTS&4j=cPA4qJ1rF}&f^d~*t@Mi7f(Byfham5p3{Dst^A5i&ZlE{j%tm^=
z1?FyuvKATfUd0_!9TAd$DJ}#ww_$_Pd_nXDkD99uf`=&JV1>|MnH2yqyl7=BwSif?
zgE@sZ#g?yOXgLU5t2nS50XZY2+3;*5Kk`=j1`;HGGxIL`eY%@t5$mhfeIoW;+`mF`
zLYr(F0z7E5U}WlHkv<*w@agxH);V3i3_}I4>Z3NC%IH}0(K*4)>q-m>fL_~&LxG^h
zM{5}E&9ru&F~+!_YM_N(7>Cu|)f8*I#g*ZN9-E2dCJ5hjQc0&Z9-yG}Z{_|bdl^3-
zkUN8PZN9D4c+!Fw!NEt)A>;3O>8p)1{iKx>)E8HXufqZFq_JFh#>qh^Mz01zpE_qF
zV^e^kp%^<?Vt)2xl@}iG0p7?V|DS4p9>G<9D8500aQP9)0S%iIi8G`p&9~TGkfN|z
zxW*w(yil4qM2HJLk=BEU>kjp>pfR=>JmS&eW7b(z7YrChjTTZah`j;?pKal-gQue!
zP}36z8-`^0AR69av>p}Y!N{TeX1P0^u4$3u7MnHc9-4GvOTcqNm_5VpL(Qm4f7f^h
zKMMS0%+uwC^v)<SeY9dYG776!d9mdQ;giHuQ#r=;x6po|^`!uZ_kcKx^=|MJIE+>O
zzOL0eDq0HqD+DYEt%yI=y%(6?U8|!5L>&Z8jHjoAKGmsQl?r^=uNS)>y}slp@ZSJU
zh>Yp-sE0jl9-vzG8}AG2ER<;R>gtK2jwl4BK|@ot`M&KIGDJ_ckkR>I(Bbshzxo50
zR*(eFjw}ZVua%?H8M+sdBPK*);AKCW2}9D?nQKWh^|Ci*P=AQ1#Mv9*Q5xM`rH{g+
zbOkOdykFf$a-O!y8&n%`r`PB(y2CcOCZkI5RtfO*t<(t04gG2zy}ebdf(W`^hNeEu
z1|c4)t`a_{389S_E*PrSLVx6KQ@2BeTRnp7`z#U5ga?ZB?{FXa1}9tbSreMNsVJt9
zL#uBz>AxZVm71<aq9r$e{IufAua;}*&d&>myY%CyRlj==ukYRIVPP5kk}XadF$6Ay
z_fHpDC|btN$)O0uA<4<`7N-LTv~3!60T(M~tc5Q@uRSe<^wn;3qs=-PyCG~EyNOEM
z(tx<+Ku8z;4dY^{W)S@S;gK#>CoDH&e|U%uRc?8rprvlW53{Oubp~Fc#Lu|!MZ%OQ
zOcQOOG94y;HWp)1O!1asi31JCirw+Jinb=I_kLZC>3xmNK8WQFO7vn0l4jgaJyN(j
zzI@TPtNH)~XI>jk;BXj|Kp(XOn2T6<!icprdQ>np#TN3#fqlc78C(}lDux8jWeI|t
zNpih-0O}M%5QNxOt<CX((c|Oun(R{z!2Tu-R_Og+f#XfMlNB%~bv9fX2hr$<i`yrB
zQ!Qu5qn7Q|<-SKCAj|b53L$jz)8B|5O7EdC0_JI@VZfkYE9U$3H=GjLOb`if)J!OG
zZowqz-*e%HqEN-N58Vy)#D1e_0Gfg}dQf$5_aW8w?p*;Y_~VntG|4cmPNysz>W3Rp
z)_Ym3zum5sTe{Jxm5~RITG`|wBk<6IKwrtwu^)^C+(e0=zYp%xz0^>bGTrNS!)of}
z2ayzBR=KiOoG1Wnl?&=&jCcrU7I}Z<N*1U}ox(9z4LOLa`WeL1{V;+;_=r=?znukc
zg{}>x!!+ftiUeI}Xy@f&tMs{)6$?88=^|5I5h3-fXuSwRs061=b{tergTj640VH3w
ztQd!}Z!zGBZ6P&xiW{!~bW@^Rl}TxrK3?865`1blzRgt8?9Rnuh)2`d<Ti&s`4g%6
zQ8wr!duym)Pk)#fqB3PfHS7k`REu|X8toEo9;(*QDQpv^T!=anZ{x&1CGryn2q-bn
zHo>4OEn<P|_7`_Ir!oeP-$t8)nSvF<-|pSK4KzJowTN_w)LkN_Y9&PF;nUA}G$kI*
z$TGhNYp9|q(AzUCKFI@f5NwLer~WNen-kFZGH-K+Qns~*0w4;;kxvDr&QSQ!JhK)#
zysJq4+g-nRP*}7Q!kqPR+(g-=Q_)&$eIM%Gh#u{fo)%D&XQ4+5i@>7PLIH=e*H+|u
z@+h`eS87%3Kxe3p()a!by`{xNqXqiVWd&|)33<yNR`JA!c;OY74^(;Z#UpXu-~Zvc
zQ5JuzQ{>$*t<KcLab28#twHF<_T3Yt?CnJ0{RqwBJ)BFa4iW4C%5<pEKLS@Jc`R^r
ze+3A!s>+se*bS&WTV*XTVQkNTgAZ&7+9uNM765Bt2W+V-?Q3I@?(s=~gRB;L0Q7lk
z4FvS>Et6~k#&FzeZRt4Fn+V1w8?Q3zMQ+?j?%JV4UQzyy^4P*!<ib)=_(-oW)w}BO
zZaCr##*-eA()sB|K5<cxt4#~eUb>QH)D+hzVM%W2*Ap^QIp6Zq);+qm;AJj~(pN1b
zl=xIeb+~Q3_gk71F<Rm8(|BHZ>7c1u?6pOn$#^)fF8aSR#SK^%PB;CydHCl)5)c;|
zC@{Aq)%zVD!o3^<1YWml^Xf(mIt4%Qe1Hn@YM&lAioo9G3trtj;wII-GP)PvK{}RD
z$z1bVZF*^yq7>{DZk~E@v+r07bkT3*`sN9(_IlPX#wE2AJuGv+>o=g2&ah)X5M0e6
zcCJB`$Kl+V)iTjySFA{q#apTZE-mtpR}%B~t66$CU^d!Rr*X3Su$Mj5dyx22o06Dv
zHIA`ZEU?=SY?Lb`6)h;L3p-P5g<&|Tlfb6~Mi&4b^rlyOD@Z!5((AcHAl3}Ks~S*X
zR$?F!)-dWC7UmUl8nn1oysgC>6K$sdU)+6Thq5Xk-U(qFd8s-fVOS2BJDzGR%po5I
z4~hRK=;IULjs{b7YS9<B7q=~4HK*U*LbuHIyE7w9EBy7WWtXg4wUEs~!x@S1l)!lS
z9Q`fkf&&epqUo*mIS}|w5<2uP5rhGl?HG2_j$Ot1{Vk~$SQzJ=YAqJjqIYIJx)LG!
z9R8heEeCj*aXf4r6qxa!Ne^czRI4E<J|HB8JnX)M(^Gjgkh+4j0XT=AL#-J&N*t)>
zU>x!VKVHjM5YHCKafTVDG%ng(DuBsV%{@(;^{}Z8n>E6q)rJ&mNOBuH1SDu3gfy#G
zY844BK&uy1L=?S(E+;GtG|L%57}D5x9zMZ{lj(534=3dE2Yn6WBWWZMwgdLilh5v;
zzoQ0MOa%7gxwA?36cP_Y{giAd-n=9KI4}f3(flcR2|U%pHGFQ%dPtSB=Q+X>0bmH1
zkzfpPHicK|Q+t%Y&Hmt<R=W#h8ym$PdD>QaBK9QY05HPOrlw7XFa?qg3T7EXnhn$(
zdh;e(*4~VAZ=DiB+sblY+?4q8q0qWkdY`2W+Nzn_91PQYg<icvH}XJx{=A38;kD~`
z`824nO2q+S4)h0Y{Fe8LNFfuBTEZj<at%QAp^5JE3ct{Xjb0ttQc0LtcLxpxP03-7
z)g?;eKAi@OPEGeG?{4$k)`Bi(DqHg$jk03R)=8e{HQm_PAN)>SyczNm6G8^{=bIC=
zSQHF!vzvz0>qMnzS}^v=osj!>>C+H`JB}(JP0`n*lA`S4y1h-qKc?lH>+>BIuJK;R
z344z^mXp?Z4WoYEbT&LbJnse7>}>H6@K^RNq(((*wj%1Y65{SYcoDQpbRnw6#iQ{M
zq64vX4oVK&!z~AJj2?c=%ZsaQo?c}Uk#?SD3_o+|tJ^@4-CP6Ap<P5bh8p*%kJ8VL
zYwvW{*58fG-3B1d2Z+vlYhQFWIb<~QXX9>kHrxxsq0Wtps{pp#ztWU{z3a}m(llbL
zUhdf1ev!&Jt5iuC`h{9*bM7%r*KY+Ykkkvl+SQ9FVTZ3|TT<TRnbPhR4Lgy8)JaN3
zXivX(da?Fn`L$7_0KIE!_Z8NZ(Ofm|WeR+j`Vg*4W;$5vWn~s8hWN77a^0Fp@~Xic
zV@m#ZLqz3;93ZH{lzfoyBnlW6Wov-ZXfx3OfBL=OYChcN>hgxi{^H~pH9K$P*=}hZ
zx<V57nG)L&r*KG^0KhGuhoonPhqW7zD{+!~NIrh_iwKn-Wt60tZ3HRa7cyk;#`lgo
z?B>IEBjBd@#m)aJzMWu{O$kxxeq)=${g<n*gSS@*YyP*mKsS_a)LBxGV!i>5O?io$
z{Pe2?q)`iDbB**d_*L^ZLua4cDO#`Zp)snR!^dt0os&K(j9(jx7v^TzRV=aWoLQv{
zDOuzXW%MmKh)M~#c``In@G|zuaLRNwX5Pq%Z;@p@i}Ac!#cZsxO5Fj$!uu4EjsYya
z#+vo(d*W)AT(%Y&@Ejx<1K=UL!da19;Y7u8K3}M1=Zu&DRVTAq)3NZ%&|YoF2_R#H
z6+(yGMFM(AMMHvVqWQ!M_%D}Ok?PK$RgQXSkSE1C>z&;?yGRJSx*Nb?z-#&^hySz!
z3CxoTQsSco#KExTQZM5bf#GY!uEdor#36!@kDK?u3lo%@h#w)E>W1P<Q;{Y>wrRP|
zfDs3@=@Dt<vrsr2NG1wQo(7tYJwUn$7^fG`R`A(q-or}y=3N&$T*tT8M2?0>Z~(vW
z<tPt{1q@L8%04{Dix^Le8~<|5sV{?fEc4beHX846Har@6wb_QOh{|X1)7QsnJPbG9
zi<|_D;TaY;{LmxTzbZU|eNwvhtvW^4Rs>z2*e-XaBIRrQEmYu_3toTh*-*hX<$pe^
z&<t8_z{==Uki%*ko|@WVgUDP6Zi9%XZ$s0JA=_iNvYov;09LWxV1I)ofA&V?+o2zP
z2erJ~Fvi%cx|f^mkgX-+!*+;(Oli*Bg3pNMBVb$-*B^=@sEXKu{zL0fYgF$7KMjdu
z^A5eVQk}8zS}3}SQmg=G6=Cv$NNB$JR{eulTnx3Qnwb_4ZQOwb9X|&nzL{O>F<Ug7
zrdHct#BT9gi`^E*H+~Rfr-9ZG_h9mzOq@0xp7^VHH+omcA)Q+csFqKy22BJ5CE{s9
z)^bQ&4K~Tc++NW3XzGCFM}63N?mZL&7#98(GwKF6-pqp8cr`p+v*qDJTn^Yh)QtcZ
zMCXHpr4N;}ZgQEZ&ebbCyYkh;T?nY$QhqKaKpqHWZW?ss4nz?`8h7JENdSAKAX9Kq
z#v;3sOq7>x3LlL&-o<qjFkg%5X4$e3(NkM#;p?bTH@=mo@oz<YwpAwxAM<9<wqt#>
zTByyHpur&a&7Kv!n_KYjl7Umfd-S-tL+<skSh?1E4dmxqtBM!ANh5+*2iF^2{dTBL
zFY4%Wxwu0g^4|q3x5&-&aPo7Wa~tV}mLM(ooOX4w4VgPvc@uD~(|uL^C{8H*i_DW^
zAvNRwsBu44Iy~MF>Wltq^{Hz*sBp`iojT-0Y3^_sJGJjn)=oPw1b?&*)yjDNyn4I@
z7!u|zGbhX=!R8KHP={by;Hx&e!byn#&MHTnSp)*L^RlU~ZpYC7IjbxiJ*ZfK+>wed
zGMmQ7r_vKUcX6pRx@_lG48JkZ)`VL7)%k=mS<4Mu`wFz+loz|84_V0+m%@ljQxrrZ
zlNr*BsIhHgq~5c}h^lqj?P3lql7sHVg=3D}WNsG?NM=@3tYsOp6|@jUy=i1LO?EEJ
zEH$-N`nEA!fKC?HWta(!<`0oe);0EgXZPA&BGAuWX0*Oo0U17KRI~0z4i92#;GJS<
z?kVn78(xE-0$#%CUYiI>g(`+AF0yuEM(b+WMu~e(x?a<=h`UOJnu!&5D$fm2x><@(
zp#o7tD-hj|lNC)E(QUGG{6%YW2$v-O>gtGfCEWt?Xgn}O5zb0_WZd1Nvv$okvPIY?
z^@?^P1^5P~LR^Ee_#y(%_!=}kMy#Dvb0ti)hT~+%*|BZgwr$%szu2~I+nI^8V_Q3R
zCY~fSlR0zl&JQ?Mece@k)78D!^RCC`n`mu?8toLS_to1+K5{#Ej6hgxs*d^SInriQ
z;L9ls_M<yV4xuPA?A-iy!gi8(RW3Z>BZcmO<Dj4#8aJ+AtrPZpiZz_ut|H!!@Gayp
z9g<{84j2|VD7Ph{o{bc~FwOQU2U|knpj25VD?R#S(sR~=)t{OqmLJzuqi&qe|2uM2
zP4ZwCPRxIQTIKP$3SnYWT>RzVudna*0IoU*QV&s%DdR$qJwpte`tuZuZKq43+DIT{
zAOZ<^kkVGW5cO`j+?1(F$>Cn@*RWt*V890Wu-V&DaQ*wceou8rp!{Zj^L=rb<ED2@
zw8y@&vEv3ay8xP{5%Yi7Y;X1EOm&OH<LiW(j!$2tFRRN3BuC=g7Wt1qQPGPXbhdN#
z*}6v_)oSrh);~rY&9gmQU(Cn_bWoq$j?bE~w_1kR&TiB7>1bQKugv}d$Z;mva73$~
zT?SP>6_g3raAe>02ehDQsH}Bu1@)|TdZ04|ydd)KV$n?p8&hd{6Pd>_^G50(n_4}4
ztT<M3rk?q3k3Id27I4^KKj5}5#mF=~p=Uavj7^$FBRpzvMq=_;HQ@N*D~||9#lk~R
zzFTN2<ltpHP9-p2(t23R+R}uIZrSNH!1|@c1$-PhUql6cQ&-q+MQPBHI{`54-%nnU
z6ph$-tTjuKN;n`Qj-*#SB~K5<5W}R0Ymc{5SB&`8Cc1Ko&v%%A?4ZT+qY_|d8Q;b>
z{uzGCwyoO?=6QmYp0(Qv-a>ggW_iYta#@C3DN%ezEe$@%cZ+pv5%c8?$YiitAE#q{
zWq+!I?VuyBfR)*9yUe<gA_N`QVry5+xvIkY#?~8>tI_VAS9L@GJsT|F{i&gPLBgww
zW+sl?6SIIv(=ua7woUStNxX0N?O*%-M<#v)GT=dUWv%b7IRK_ceInUbKwgrBE2ojx
zQGKA*xO&#Zmfw~i)=XarQvR--?5Ty>JiaHxt)U%(CfC*bBlg*vBiO*k&I1t*GvqyT
z`R^ZhyzigoM7t$yzfoX2D^@>)EJ{|e0(B>An7e7{-p!#S<ph=V*7O%?5fu!dP<V9h
z+W3>$E(v*07*EI@nZ40F4g5Lp)3Fqn?^bo2hzuA<UM52P!pUBmX8zE=LdfMQX`a)B
zrX2-lw4pY6vbS#QVXxUUG|nzpYjT{bBuiJwxVpArSo_~qAo{8;qd5S^$vp*o{|XnK
zRR7?F_|<WN$0&d~8P5VS727O8JEJK&h566`^L-pbN+$$`i8;aoGek}l25a<?!vc|+
zvKl+&>Y;U1=AZHzHK{`5k@_UHkD>+xYz*PY3wdCgH1mEcmEm4n-cA^@=VccI3aBkK
zpVX)8hz19tkV%WnWk2?&+}6>P?5>YGl`#P~>Om>^L?7E4Q77LGSqeiq2{5(!XJ98E
zU-_4FFVReVMg{%HuQ4fhh9wQNF>2V{j2~(Yx*BA>`V)5mSiGJ%x7)z-cymxI;~vDB
z+UP#)fC;zQLt`0`kpKf3@voy-XJDiZ7U$m$;QQg*$>v|M0@E(+)U{vlCmHoW@Xq{`
z^!MdwNptZ+bC+Ub7aA@^lE~kwSJ9+%QEnuozfSnc#bY-WabGPRp7RDNUuY%5)qexI
zL_E5WQrQ)=%CYTL&uA962*|PByven9O@E21Q2ebEO?vyQ<H;IJG%>dKXa48keD4O~
zm;d(ji<_t3{#HExudyoS7OxQRhBsYs&Vv2_r>*6|UVUpa_J_SDXpx}`219dp2kyVz
zc1qcfjT4y_p6u_#dLcek=`#|mx3E4Xa|E-zQWRE>5mW2wX>)|%-jaOmZe4}F(PnFw
zzi|C#No+`!-~R5XY~2?BIb2<T-un8FOQin`^j4P=ABF#e)2n^CSUM{SAN!GsZUBcF
zYu+M$K=+rDaEaT`)l{Zayt@gfJ-3c2@sXmU0W}_{0>=c#8BcwGwj9r!srYRvuLTAi
zXYS!aef>^T9cEqvA}dw6b0QEZnbgfI#bI$rdSK@J;uhU&zZxs-OX&>}Xr2!WkS+kR
z5xVT!XmTT=z)bI})NkRjwq>rH&{tdk{i0>ET2}T<dC*Q=`cJC4j%^13)m!lQ7OjA7
z3Oa4@%nt?cZl~;}$xv&^3!~Q*mw21?HnGWSfCAog)J|cVQug(PLD&oSbGAAAc409_
zKMEP$N|*W$fdvBAz{`O&jEEx5ueHNpY`V3bVF-~>9QI^!wJQV3TF%|HO*=YFJcwu(
z#s@EqbMjOQ)afuD(+hEFry2qA;Sq4x6yf6Aj?7kN)vFLdj~AhJ1H4fWb~LJuFA3(2
zs~<|PjI5rdr;Q9Yg1J6(`g}(^e3L4$!~+jGp$J1*m~bWAr6$^yb}BS%H=)AqHv@vX
z_oqed9f6vYSRmL|^mu8@$?_?kh1NIyb=V4>P-&P~y@5NK{kHn|6v-s#P)wU)i1*We
zHQU+!0?EOe++9I<ZRYQ=JvB@U1>E;6yXw1h_(maRiWbPH78pLW!AcBVQ(Mq4hioVw
zI&2ObUj#!KmbtP|5RA}vB#C2@Ka!(xIJvmznat8<B4-{`?2&HZ$m683)e*C^BU`IO
zEz75R^qbZhPd|p?IcydQFKv@TE$sJ>WtO`cql;?byP^~zX-4jN`6Y|-ZK^aPabt%v
z@sN^9Xpvv-+Jl%DXffA=FMHHGXFJ|;4QueF4mGCS*jNR@{yLq}GGhws9&RDbYn2Hh
zYxk`#3ud%%$zf^Ck!Y!aiZaKzljuQteXJsV^d>nmOo(tKt?hOXRMg0Op~*r64@9hd
zNz`hY?;Hj)$?(W~ZHm9*Lh221)kK^IEUjVC1kYlMFQG-{Fk1g9y-Vx5I|O#wdU8K&
zE9Mn(VeZ=6J%<;&o7{HnDlDiMSzeo|_=YVS@gxA>BY!6888JACqbTM7YAmgaUF@nt
z*d^8*9Wsa@VbGJ|h$W^fCmu9d4iEG4{-865Hv|~)S29r>iFLl@Iv7GjB7RIp&=Q&y
zZKu>9LcM;gpH<uqj);yJ-V=2gNpsB_tLqmef#|dn2sBsOh{k+vQnO%8-R3I7Ys1-X
z%JHAQ$?p-GYe$LVV&2gEZ;YGAc#;X@Y_v~Dg^UO-sTB4?rf(@k<G|ro=ED4wK;-S?
z*DtR0zcecmV}`4B>H7Nx9T&4Pd$N`vErH6a7X&R|zRo`_KM!TkI_B`OpNZp;392Oe
zATB&c#dPPWQd5G=dCZ*(iQv-Hx@J%fup6@TDl)npAa^sn6!5sTWxJt!GXO@aaUdNt
z%G;wPz%eG=Y#&2xWStyLG9jOA*z@RANM0EG@zYw9pf}h#)RxNz@r-B?UIrmg;uamx
z+b$`?A37Nw#vZ4nZ;*-+a<B};^SYxWdkjW7qpfFs^wvn3O#>SYWaK_o#JLrCWOi>9
z=Cj;%l+lIqlmphpoMAgbw5YY%q-ihc>xB#&8JP*S*z>*OPnDx~tC|PTPUnLZCg7%M
zWHmBul{gL?4IrPTpj@(<Iiu$|wAR?5o_yCMF`#<(_xm<sp#p{Yf%w|9z~j`wuy2fb
zXEHqM?zK4Rbh!f*p$K-7n>2HV2OMGDnlGtB*?>@ic<e4Hjvh)f*s(&(9ycJwY#ftC
zo0TAP8mdByN>lM7;W?8>?H1fGo!TyUoB^%Hg%L7`%LK&2S);IZ*pSUeov`@{0X|eK
z(ZVQ?`90UvSKM)x(8kb>W1<EFNuO=Ec)nn^Oe6A=9=4P^2vKXNNPcM4t??Q)D0S;o
zGcb#ytc+EM+&{1d&jRTJ2j|7avVq?a^wy6=tkCpEL5jAFAC7kp>jvXoCK++HwPJvB
z_LBg$y^n>*{=pmUyET4{If^D!+@%IQ5>zXY@RlB~RNWZ{=W}<9#`k_QV(TR#RBMYR
z$+*G{waSXCRAnV4|3)R`-(BWAQt39R9o{gDL)q5Q+|VFzLHX{q8M`klR8bna`VFF?
zTxvDKm48sHCpr*0<_?Q3s%mHH+_@q>6VIuQooTXFdCx!}U7Sss<p#^=^nim%#7X^*
z6G?is`O2<olEy3`$$u>a!I^b;`vDalf?Hu|QmgxNZbSuoP3gFD*drY@(tM4|>_nP8
zIJWvQ4o^Uc^`}(BYGIDu3zJ*PCIL2oQX&sN8xk4gG`{aI(%oFVG1G?p7Tj>yL0eZ?
z6B%IT^R%_njye%f1=hC83VOI#M~sHk;kk7tlxyT=$4RaC5s7;X*%OD!ZG(MYJI@?o
zvJr2g&GJH_#72LYXwsQ6Y^}brzy<}2#Fr|AA91e&BW2Of=QL;`h&neoa4#PtRuDxj
z;z1x6uRPq%ddrwgHDo}o$5C$S7ZEtpmhh{$K1@|=Ms$|Sb;$>_UXdt}!pj5W`FCh;
z+s~S<WQ`rhJgK_~wpdMZVT@7gGxyEx_7Q<`lHn*Yi#uYM8=n!IlfRm!u^6==XEhA7
zWD*tldjn=MBi}`2{*9fVxxiVw+YZ}GSko%sZDHJLB&IY(LF_k$c)GSypK^TE1Af3P
zfeNBQN-Y!lqZf(rPy3;{hk0o{a=A61cl=W}l%xS3SOyH44uwk0?spR&oa%h_fH6oc
zhr|<zc=0jJiCMo!n8JUjOa*t=JIQvddi(kkP?)U{lU)6Go#?_0_JNk79EMWL6)x5w
zTwdUVPjV+?fmG4_$z;iPGS0qORX;Q}vw@c%-#w)Jz;L&MwYtEqTL{Pb22H8c5S1se
zOYcPf_$OT>Cut0UsmLUm85dH5-E!<YQb!#k()VLWC>h5+ZmM2;{`dfMabjjHLB`&=
zMuXnx6l>=7k5ZCN&ebLJ*koto)>GZfxK4F^-H((3X;osCfdq|ZgFf!J6UQpJKdAo=
zwVBXC^#HI8akh2GZdBVqI-HJ)ssuHJQFW;@RsfPKmL6TiP^5Y`)Lr<rewr>En@WdG
z+Y1QCrO7LD?IWeO%a8&eOREzdOSe<63flE3QQi?GCkC%b3&@k7Uej{|e7u#PvZ%5;
zpmjygM>#7(X?sYYw7vB;Wy<p+b-bOOT3KU-4gm-9#c26deEkSzG|l3OoZUGBbk0%~
zxAtLvLCH)XQ}QXizXZGemlH9L`^MhGoDfy4OIHzCk#<2aW)+;!n0GpldUNhH0vz@u
zKZOc;5ip$tz?w+fH%5EN9n@qg5VY#?BhHkG(Al#EatTfZUC~a7HpzB$YZ!ZBoVumI
zx}sV!Fa~l{P|>KzG1+RDu#k~vP*qS}6!8twqr9we&3BLVAW>Hu1u$-%QM0-Wix)=N
zu^zWfa%nWUnc0t^v9~l$tXl*HZcA}#fe?kdFCEpX#&%TKj}xUwd!lL%o-!UUn$4hy
z2&>LyI=l+kWT$M>7P?hz2aQKn0UBPYR=cw^aR3$i0@Fs+F#Rg2c?GBU=?107IHg}2
z$u6p9U4lD?Y22rN<sOb;OzhK$rQU?KO<w|7D06~;KByt>k_<}iE8%vyyjs0s8N3vn
zIVxoV4Bis!o_x1s*%@APYNP}KV?9yx$tj$4-f$IOfk(N?_5|X~42u+hyb|{-C@rtr
z9@D11Y;M3;_`kaZt<mvdS!9kJDzMRZ5lM8exu<U_N&#yo5v^3c0Tcb<o>7Q|gVrR7
z8CBtCXG8$<d0|Zm&egNgkP3}jJtZW0xeCw5#AEq7HP3e<nRoPerj=T|^E9<NJq_>0
zMWMRsns65B;ghj_tx1>al0#?EBS&4BjweI=MDf%zdy*h>s^0=r7d0LxjCf%ZpA@<A
zfQ6|`nNv36HbM^t_=sFzG6Y0k0%toouk+KT4=L^VUIr#}ZitRcmstfdSL+BLdAe^9
z_w?Lca9F0SR3{F1INR8U2A^wn?W3Lt`@ub~Z`a_KZu3%&={8C~DtMQWpU5y;4Y~yK
zq@-nsn^Ebb!CbP9J<$_xLmNPOD9^QA)>L$cLsVBUDhH3S`G7vSOAFm8lm?oFb^k_#
zrL{CCpx|tBKrK%9v*TwiN9(K;<8l}ShCVGZwtRvJBMyf%z=lr}C#qh|yCBiRZ-yU(
z!rDR_f>a$yqY9=XPKNMhA4MX(19vuI<pb+-+zAqp2nd}xDFDV}G80XFDPwPxbR&e7
zyqD?I(U;&_V-_y*ZW_nDQ_<2&f2~^x^KjTYkNh&90C%;KZR8C86xDJ6jT;&aRGtRe
z1#ltEcVft&Foxg(LElw+jiRQC?qv2vBg2~FZKcjo?a4)Ym-7=RR&!2U!$g6Fw5k~!
z0XoLxb?#|qg<S+3q=&Kep@|&+G8uFQTG{KY)OZ0hOREdMu~aJmIVOsm*3irX4fozg
zAr*?lC!nj7gO*^n6*3>qbTqcvmS!HLwJ#jDFSEfO*+wl>{_nN!$6+-gsPOC534ux#
zD+0DYK{JSfp_nzHdYnhAnUUMlyuH@k9iCDC=zPa998f&{Z`dZ;x#lw#=x%-H9j7w{
zL+g4t4DDJ=vGc8Kb?g!&Cna<%3k?2BFK`S=wvJfb_!a<ppnwa56S2?3X}cLBoAs-Z
zEQNnyPiG93Lh6kXLdc<$kDNR@qL2`Afk?|k_IRwZ@Mb?PXsGavDQUo8P3>YXl%ZTQ
z29=8}KkL)f!g0nUwOKXNZVvzfxzttg7Wo6aIddOxckU%8^fj{$qe`xa--TDn2Ln@f
zL}*KkmfrtHKedin27l>ZUIV$l6U!u&z4Ak#F8HA}PgkyAS!=&GHyQf5z%%uOyq&<E
zi7XeilWG&oPAezAWu+Z|4n?#zNrNS$#(akr3TcIoE1X#eCp3h?40tGSl-EreS0+n*
zj`{;NSgGy3Rw3q=m3Xng|ILs-r*zCjPL%}`$D}dQfr(e6SzV?7>V$9svb0gdV9Sxc
z1#oXjM%rB`J>B0VVuwqbllxo&Wvj5{9S33E*AFi5R#y>#&kuqaV>*9NUo8cDjDF1{
zr8`UId;h+WomVf+g84f)L6?zGoNE%3<*s^-aPm#QICMT1DHewEd_yA8V{8pP8Mc4g
zTS;2$S6^FnydcX=FIZ+{o|5W@1D2YAl-j0V3X5+df`pABvn~uvjIoPg7XS8rE;dyv
zY?<!S+EqvUok;$qH(sH)({F(-0-zO-YMdy2IT<_#00Z;;JlS=&o$DhF<M{B~65p3%
zvxcRI?a&+TtG#@4_h14&djfUtd?cf~u!pVjlXa=`_gDcsP5RU(7=(x(3j5AmoRw+M
zJxs9H3&#-66fT7M->+QeL!xZU1=xp;usjOG5qJkcrGoHWtK-QyFgdy~I@0^LF(;0S
ziDH!h89I9yKJ+<P4c`0S2;_&tv|(V6&B;x7m4_K3^bndQuPMh07@$e)M<~)BU)u@|
zSZs8^;^*q48##i0A8jl;CZgD{3#p_VCCz)dl-5hE^SZ}{l|b<o4PeT2nb7=8r&|tO
z_zakMd+d5n_94TkU7Ye(-DPWHoOkZsv#6Id{QgZv08bf9wy)u3Gc%gm?QIu8G31=t
z=)g}ogjT8lWXUZfUY$fq9oGxREXi1ShAk7d40FTQUHAieAzqQZ5MYm>RYp_>y{o;=
z7f$wAme$TVA}zdcwTPt*_?{c1tC9V2MLJ?)9Wx4xb?9*<{{+4AyM`b$VU8hrGPBUk
zcw6%?U=fG(O8bLuxr%TyA}Cr9j-mDR;Yv=##@8#G2}EsW5hf?)>zU#R$C|%FIp;9h
zI2)TUHjZElcck1G2>tW}dNMkoOO8=Nnk~bzNTN=St3k;`J5Q#sy2@QEy_Wv0P%{pf
zK+HS{a!Mk0^FGs{PtCK@qIfQ)xdGlX1FHyBCU}M9apAf4lkD)K0{5~@mGyV=ulPly
zHMKTUl&8Mc!ViAzHMe7aEaC}jZA<sAv$^#ejCSl5f|dD%a8femSfh+)$b<zs^EAtu
zZwNm$73|j~>c&;XT}T)7u@i*6$48kq6*=ktmOeJ<v1VZ-Pz)kyx{$?bBacawUt#`7
z33nra2)%zCAWAlk1XyW1YS!${iXBx}yM|CNV0D{@hHTWY)&QIun;(_iD47oCuP6mt
zcP4NvS94v<UhMROQ@arNo^?*`BtONo_CAt&dz0)zMJMG;MrG%{cZ>-2Wnw~?a+YZE
z3r0(+<93q=F*HD{ax>>2lgKZ7pW|_bYGImc;zFbL)m*>UoWP)SIX-v+*gLRJsAl72
zW18J<<@%I?q$yznGNO)@TUk52Uh;+$HY=f<;z?#Kja|lcw6tMbyRpg&qrv3qox0hA
zc^bLOkmsDoE+f$3$i#SGTGU3~6G3#~>LOekNb}o7`Ma&&b<?`zrS5bgY^-uQL?Qxn
zu2!FHt-YgG0C9#cO`d^<Uv*u0lbSq|P53*%H7naMBwtkVUju6>l-H-?Ih1*!SBFkE
zjRpFpU0~ehaTNrkBgrk%2;Hn+nnns{YL_gZrC`^ZS%F071MIQ!WEEFgc=W}-PbI|U
z8Pqvi9>)tCqcm>);v~)peUkadeD_p$w5W7SK1&O?`8|=BjA{8r2p<R~RcD1_DyeUg
zZ53(@WkA(S5w~A#KBL}rxiT0IcIyoGL170m=->I3zFc%;_vxX=y>s_7d4?-FO+lOC
zQ+f-`a}e;giD`&aQ5i)-14>8B6?VV<9hA2mGxX?RdA;jgPX97~Cl0vQ{p3pcYqWbe
z|95A*>#gl~OUg`*WL%rPxmQV>urND6hlq_=l>j9ib<Dm|PrWu@pM=nNxjzdN<a{_v
z-|B*++UW6nCBIq3sjLgz#0EmNs?ahkqCC-rM8!&${ri4*Y|$_j1m%hh_K^>?5A$8)
z#ZF&pWJUhBL6s=q(TnE%A5IYC1v|6L1P_njK4vIE2IsYypJ4;$WH;0~2gjsS>i6?&
zF<u_6cIywyT4oPO@g_8$m>F$8gtsI0DU-C8GB0S0XjGabcUJNsiR7r$7<C|Ik&m_?
zz6B$-pzPJpJPo9YGenYQ?hy0`Pg6X*J?P0Sa4WFO>PQ#^hTy9v;-b}4SwNK&8~q`0
zG+lBKFnGLGp##?Jc8p@$egK^$Pyci{JS&7}yW}>E#Ehm`lPC)_!CphKGaK#`*t{2k
zf^ZK};>zmi@cua$8c!@yhO!6s)Op#;bRm{swH_8ruHuZJ$3-*6t9*x7C`b4ZygUB>
zmUi^g+V+U-m&X%5*;B;M-tIq}*=8N&h37NK&c}nSI#o?0!=s{_q?($c?&St#kiFUm
zZ{f>)zBprEP0L#bjpA+hJA1+GM4-~ZO;yXRWB@F!ob0>;{H&ZjM?-lM+aBqkW(l?h
zIAE!3CNbB#zE`t<o8HPV#@m4sh38F9OjarqH+CV&BN)5qNm5<f;q69IQA$EqPC-?{
z+pVVUPExH#Av$~joi1I1K^re@ZV8r4EoleEBn2EaJ;=$)*JBetTe0rw*M3P!_7L7~
zCw2tCDvnT7lqzGY-Hh&g$cHJ!_!az{X?v<-{!IcSqd}=4DCDCYDJW7Z;XyeASFsEA
zdb@EVb8HX^vnfihVqP^N2!X9U0!~iXKx;2rJ6l2`B1(QGN~%tz_zJ3T_!TD^k$qRw
zT#%eXeB5&Tl8mAJbdZO<DyqrosIrsQE0~z8yVaqcQ;@KN5YiA=WNRceR?rhM>>U#s
zBqe;%1u{WPUJxB!)F_Lz=-(r|{v~y(%v|jhnBk276@1O^{gT>V&X?2XuiDDEaPX$0
zeG-+bPuKz}GxW?N1!AZn_f=N6+&3V2Jlb|ETP|RfTiDyD@rVvY!XKWWTFGc+-#^J;
zP@IppRIdONocNoHwh8|-xuO%JjZWPfje_t0jY}LMSbhEru@}!V%Qo_v;4HF80oHoT
z8Aj*}9j!rD2^u13i;MRiY!UyNHHq{%pUzl9T1PJ7Z+4QIE0}_Bq$9lkB<z;cj06xO
zZPdI(L0n+Qo=|D3{SX-u7*<;{%N%izL^uyA`~5HxFa(?8B8Yx=+^iF=h}CG|0kbAZ
zF+~(TuF!<of_o&pRF5`d@dqB~MsP{%_+>u%#zBImS=tm|xJSZ_bHrx~$2s}y&wp%W
zWtB4AUyo1n-86rRP2ftSpG<XiRWJIzMLt^oO<?}`vHWiLWQue4eOog9jY3F2!XN}=
zrC81C45`pmW*yTcqBa(xno%{DP@1a<S>F7<{LDJW`3YAWYgzl*2rv3%O_8Y$g)oc|
zAenzBAg^+>S+g-_3rpZz#tefj&1V_lbn3-{ygt1@Mm2F(!I1POM3W@)f7X|zLPg53
zIJ<e;;XnK#pw8P}4rk^UqLqd+P9X&xD5uE)KJP=Iy{p`^=p^=gU7tZ+?Rrs3iE2|Z
zFK+yKqU4m5|2NC2WMbk(ob|%wkI_CcQ-Qbj{sBR0?|dFXTTIyFRwo9m$I!es+nZ!|
ztp*%jXEA(ph!o69@4b(RnR~iSU0<XQR99EaWgclmiW}&kTQs}q-11yXQtQQYj>#Sz
zmq|KVBlr{wh0;rN6%~BXAWI%zu1yQU!g2MWO2Wtbei#irc(~vB*iO|_ZJodLoZ!1t
zS#jC}^Jt5*7Ar2&)7!#=4Ewk<`R7_e3^7L1QZeC37zbZM$=Z#zFSQtoy2|&*m>2()
ze4F>&D;biLDiuzJGl!LcL=!|hnO$w#;_p@AC#j-H9f}%I+~-bXPykSDG#;vbrD6lW
z<vh;JDQL<uZ6YHdsqT>Z+Hia(wmJ5{yaTK8=xRW=G7}qnP^x6{+he`EY+_^#w*<RU
zbh6Wb6;A(A%Kb?a#B*62L2kLf8o6-Rzu>)^e`*X|p%5_znak;$_zB0?*)E=iAyIkR
zJtwENO>-uNqx{+eL08ZO5Ed7*S@_v<w4!9VWsV&bl!h+0iofDnFP7?s)>eEZ+uZPt
z#@}J#d4lCKU+}3dC0fyckA>^cj1p^F{i2J5pW}>_R7&$u$VB8PwzNRXE=qf=K{%68
z)#jY?BNW5i1#iV}vCvCO<-(2+VG(V59=<-PPG_;9For3gc~J+UAoCbNdn0;)k%pc9
z^}2<e7IVgS54LKZ<82;$RNj%+I#S*9`w(eB*1ItRMROoK-*wrgAN8Rm2^QqNF8*FO
zl(d1zT?wJiK*(cbJYY9Wx!4uFa2q3@g?N~u{(wPueK;N}k_Bj}d{p3yN9FM!LE{;M
zda}7~rawS@U8UG*=q#(6X2?30mf=X9)y#Ur5_@263N$et-5=g)uT6QyGISGoh{pe`
z>5=&&N`tuK#a0~jZ}8py^+@z;0bGr24aYDo<X>;Ngh*JLx`qzU($3fn?hUWzA8ESd
z8BlE|=SHDfvt;#;A$})=bTYlNnCe>GJ}ptKIB;XKn3q3%T2(uj)Y1xHMQ<)h{0^>3
zxE~7NI2$!WzxaLxQZXd#?1c|+V(q779Es9VXr6J49ndV3zTwk&DUY;!wP;oPp_CV1
zX3Oc5ESoa@8~;qAEo=_5&xaia(GkR-YvtGHKN~0(*m-IKw|mdcrZ{HR3^3sg#Cx0l
z%^3Ud%p(lFElN0|{ja0KaZs+K5=K%nQ2*0Wk>De*V68=X?zt&{Ky;<to5%i<v(S2)
zu8iw$surx%)1hiQbT^uyqr$ZqeO2G*c$oq^CmwQF2h~t1j!t2kUR-Ot+7MV|`nGP-
zPJVAM=cY!V@-D3^6sIVPLl~6~$;9QBHh_>wcA2n1p9!om3-JuTK1!xc4}0>1CQevc
z)MxSq+CYJqM_}XA?DPmv-pA?{;SWWc0tlihN0;<HAoU{%_rUZ!djxBx=`OM&5y(yT
z&T|a}!t&ep$9FZyZx(deda-3KY%cay52>e(otDdn^DO6k`D^eGK0d_ju3{#IeKxP!
z=<6=bu(Tr(&>82o6@<_HZyH}##gF5f_}#eCyKiwbhW@}Pj^8QdGM5vwjc`cQ>=rKZ
z?o<GGZ$KQgF5N}rpJ0xWM#3|MlsNfDgLvMK{7j<c*w`rJl6(<LPQFNi*k=ma6SNs#
z$X|T!op{tDp$xKU%F2m0a7V-lybNDz*IfHR!ZN9z7AcQOX7)&y@-Lu%&p2DA-U(}(
zr($K<xWRvbS>`r?!ppnj=|0f#pZ5F<=&5DlfDYe&5Io;gUx$3EB^8~35|%jR0+6!S
z{kKz^LZv!%B&?TJ<urx?4|_EAhF^hP_C9d8RVt-LYJ!<P%5&w4QQcEf$rA8a?b;=d
zSkI!XWn74GhDycZrvSDwAJ(L%Wn5B(WQ~doA<<|YbY|lTwc4l`1D?o?ZdHJDx1&vS
z)nn_K&9roG$od9fFqx+VTb!#bG$V=H*oIQDPj<U|{&u~xA>0qG`$Q)Kd}T@gEps)B
zj24im@`KlJZKf=RiKGs@*>k58p)YLF%x`-3V&_e2Gho>pDpy^xkT{<;g)G#saG)M-
zISozQhGV?fhYJ!wHSTf&n?K@f*IFy!NHv@e{V!Z)Mlf{w#5aiLvqSpe=mR{0nv;oB
z2(|ghcT{E2k3<XF2RAu0R=_P;BZdksrW$>OY3B&B);D+*pjZMy-rU>B9C-YET1lp%
za1r-rp-{u*n=l<q#C_s(Ans5{9_u;~PNl9hWQ^eo?F+AB*cNBGXGhx#0rx#sfJ%LN
zqox;&dduK+zRn&IBI>`au>Y7g5*XzM&Gku|;$w%wQ+%*pI_#cV$|KlY@s3Pf^tt2P
zj1paGQ7$R{Wxs_|nOi)TnkfZVr8|KMsC;(!eZ$*qQGGwkcSYS+1E9MIx$5`@-gj@Y
zoR5XkTTT5NIaQzKXJlEY?r#`C!ICdjTYojwy|_k3gL0R-TNZJRl{MU?F5_G6`|yp9
zYNuezMi*r5GyUFE(+v}=2w!NK)+WNjIqwh)LAefm7UNl?mY?eMwpl+X%5y!L>rYp=
z##+k6B&OmKffqFDH7J1h#5;421l5`Sj)ujp4hL-^E(;VzYN+}NYhL3W?FJ7O+ByIH
z4wDMUU{%`5&eA>psUNCpY9rl*SX0=Nnz=c#51=|Sa)t;K#D)eP!(qZPnMn>mtHdN|
zy$+rk8XM(39!2S3jzS+nWK0g>i&7v55f!9Qo&AkHYCD@I9xvAH1&~oYO(0n_<90>d
zQjU`yK@Ru(;~<SAm!dk&kLIe0xou6l(OL|VNKKfr?E36J-mt@H8aMgmq?MF-{j6!d
zD@X=^hR#u-Q_$UQoqm%yUnWzP$yoMLZi}{a&Ip{E=C%^KDVJ?h)}P6bwj|7&<V0nB
z_{6lbxHk3Qg5A!STE7#{+nnFeULM(#r6F>A6wwLg^B&5=`6b0aN3e+H`n&F(dIlby
zPck%J9EpUsiEQ-wr*rAq7RHwgrZqU>Ka;kWPUT$)@kY+OQ;RzC?#N2i(jAu<ISy{&
z22z2mh;_P>rsmn<o3%Gv+qN_dB=I+7So>*}G2MxnJ8)BzQxA%tFLhkOc|_Z{q~wm7
zNvW<J_O?GJs1|0(IXcujdhd!1zwl$phBXoNvf4+d-DI;-!W%?dT_ma@CqI3L&hx&U
zd@kOaC@lx<{xB|9%XC-!%6G}(x+0-Vn$_aYFJUmqvFt4I<+05PJ)MjT(anZBGfnO5
zX-Z~96v))j_E70atoOE!T)w#a>t>u%s$ei|%s%CmB4Qyz?&szUNHXT#YOu~%Q^v4v
znMp|h>@(vaQGlGq(&ENnnz=u!wgTopwcG5TdS`0L(wmv|tsoG#s%T~dmEA1^vG4F{
zM^=T1v9F2)XAUF*xKKe290Hv1O(jT*s5xycI~nmNHiD&uZj;jKMOHZhyDAd$J!2=z
zecy`P)V9(=JGG=xVgh-^A%ra$Ck&;LOXqgBl+~$v`$MzB$m;gPxsGqhDok7HRvMu;
zcpBqU>;sv2RZ3?ybFgRX3ENwNFO7eUIYWiO{+s9vo8#-;$KBH{`WClEl-ysH?w6GB
ziGaIu4)BEeYx%+Gf~A?C(DoS$@zfoGB-QYZc9aw@B*b4})21t{WFnTHMp7Kle*pJw
ze8FZZ^L|B8AfUiwEG@kWT3`~Am`^NgV5>_~aF@#}mI1Y~gCoga+n1uBVzY+=H|j3_
zX;MK72Bl(GR~y(<PO0;NrC3kRl>LSGLqeYux8KHjjkw~Z$ht6c#2Nv&5XGtu*&wj7
zZ%KOUBh`Pd)PrS7L)Kgpl#T&icF>hVlbH2<ye6ADFIeYK3(a;?p|U8f))-P~R>9}T
zW8-Vvf11vLbLlIY_2F#-NapQ2o6iR6K^Y=m&+cDtf#%9_E7wXlV=1(|ChN>6!vc6|
z!3fJ0E#f97C*E#KB(+WgVIbaCD;-;Z2jN1?5{~8X<l7-e-$VYWaV<+C)lIGD)XEw*
zdxP~KX<Aj?yrQ5KnvmJ%{GSET&!CQPG+5#;+k5>N1!&v)3(!2IUHI~c;W8Tehmw<V
z8W9q(tp0PNWZ_pKh7yS<$5dq)>;NqMhu$-UYt{##4638tqNvb4AcXM;^ley21EN7D
z-YF$ii?!q_c{xyZakAv*Bsz6#r`+zhy7!Y-evo};K>_hda6~nRmxuS7<#FD_g73VP
z2;QDTfRF_h5E7@-b>Kmzkh%hn22XTSwzfQ57svNKDXMGtXZYvwfpYgeG9@bfNu_n8
zhR{U10F-%6IOAeGpl55Q_Dq!}wD{5zcwqLi@y|`<3rL&mR@-P!Dz;eqQpIT3CL_JM
z7*;t$;mHA(^|oAfOC~Eo-N+pecnAE6LNH&TaH%LKlvv;!UjT;~&o{>h1&s!_$kuWQ
z_LJ$~!%~z+YGHFiT$t$%?2oJAz;<z?j?>LcXiLm{SPB!{;h0Ebgb_AKc!-xMjdJ<M
z(-!LHOm}7No(BqK@$La|KNBqq923wQO&QvxY8yr6>ZdgHV=ZEXvF78)YT`Hq`{SfM
zNY+{G%PQm2JV;BuohRpa@4r#6mnceQJ?kNtl_73pbP)3WnqV^ck+cBQ(Lm&dKf&Qb
zi>~bF0&^Cy(>O}~ne@g^HU^#h&DNT|fjJsW-%2=B>M-XKJ$@ROMt<K8X$4RFcWdOF
zVw>2obBvX}F0b~wHjbNT#ZQ|tAxi=LHSrorwtiwy(kr1IZd6IsjWXg$`U+wV`ICL<
zTc+^j7nIW`csC1S{W(*GE?TUjR2#jYFgEpcHtUA5k}^?C-P;gkIta?cpCfo)jxL&H
zXxDTV*a*Sso+-u@qU{_74+m^<851)Bi}a6=KnY*_>sEUs9|SE_gs<&BJ)T<9HCTe1
zK==9eT=NCPaBvj+1Y$$zl^*%q1jCQqwKi<G&DbowUh_fH6t#-5&7ov)M<qQ|E#xsc
zovBFwq^KPF`aZY10YfxM(wEr*Ymc#&7y02z0kww$UN>#ZFmg|{>6p@vyg6_r7SUnq
zZ@Dsk|7aWyfs5TEfC52a<TV6UM9A-jqd6!k<_G4;x`!*tr#csLGhN1&=d{BN3WCcw
zZPOL5^W1q=mze;Y1uA1GVy7WJCo>O|1?y5<{cn30@L3wZuo3htzvlaJxgK^!9Ky8`
z<UVkPGB=JZ_96X<_n^#mN3!W>^~xpuxnaJ~OI8|Mp#U$NCrwNYfXL25esT#&dp<EZ
zr{Nc<DS8t8t>FY@=!J=@$r61%k?!v1+a~-8cX%C9!HH3)IM8YOtg&r#?A097^zNCz
zo$DHLIwtRJG+l?wbc_gdYtLov8Pjej8cAkR(F67TL-suVbD-AkCDq)KwG}~;@If_N
zOWet((9I-DN;XqH{f~)5%=%SM)?tXHUPWq-=?F`U&3)rC{JSM!L}7(Mbk`L3N2vNb
zVGZNI$^=wmX0C|t+DGPE%7|ot;0P-|-D)n~u&;l%HsPEK#vi3B{m1#JGUF@AhwD16
z_zJ>Uiq!~pOfJz@&$-I^>BwddYD{(54x|-)KE6O?IMAAZ(;v<1QWfXCy+;}}gT`&<
zg@Nx<x;~PpV8dYs)YGygk4*M9#WT1+%VpmqW%fguMkbxF*-;SI?ReN`2BJTpzkGso
zIVs7IC)Td-&J*<r-4c=K<Vf)zrTW83Ub?yE<et0Fx3vL~NiN=#j97ct%EGjMt_^xn
z@O_DOb`inQKXf1K0klU4WaQD%KVFv`uP?S9QDdJpBFSQSP`K%(@0pbrstb?DTiOaN
zVjUAa58{dknxWm#sK&8CwFzxw90&c8%AIJ~aeKeqNoa;SUUUcFW&fBh<{Ps#Eul?k
zG1kp6oWn=n5<3O%W<^g>VA5M<7z4&ixHps?kQOgqPLdS+n2=@_ibJJ&<{_WjGv<uj
zjaCsjv2T%>bUA){!li|kB+^$PrbbBZLMz<$u2lS5GtEIE-I9|cnL^S`o)H?j`Q5cO
zP$dzen#3f{KgY_^Ftc0C9e1f;)S&x=szLTJ|Fy~v>V~FPco77GpV=g03RT(UsrZ&o
zNVt)udqijgbk6|SB8oZRKx-3PN8Cm(H$8UBe_E?VN&55tOm88>j!N;5|Mfxt;~I!8
z>Px3_@57)V%Kka++gKnRN=y`w9VhsR$Z9<(Srz|f;IiNll3W@^GDB<BQO$+?Fe@JX
z#$f0x@N~uV=Y?S{h9lE~&g3|r1`dWj?K$Q_>D;j!dRf;*xFJ_18X;_>e6QW3q)+7h
zHcG3Z)@rHnYV{tsqRB)Y^G)nO^gj{<M-09;WnLUtUy<?07veqI5t!)Z7?92kNp5AS
zCB2OE_?u@Iaxwwxi8)yXS@ke~Sz2Vy+$Vod%q#`R&7~XJP&f)Krjj}3e3k?MI3&%=
zE4|xjAF&vt33A{J$boYyjK*KHEAG_mLZ9sWI@2q$Q!`IX@eV4nC?H`vZYP=ERpbZ|
z`s(^Y<|CdfOnC90TnApo{e0uDRll)4Y^si@Nc+Gg7A`S_@ie&?PRI;R6ibHiBiwRl
zp2PB0sYMnH_~sRYmz*<gp*Avkpk<1)X87Z%t#<2i6@cTXY^65~TDPADtzPY<S8@>B
zCrZ|o9yMM{vmg9l1pzW%F&Ipv0YS|K=6a3*+Fi@y&2sr6@#F>uo8C#L+oiCUCYKHF
z?wP^T@xeOS<?@-mQHTM=`^SUU)5I$}TY7$0w<#By9BDlz^efd;T6?;AAMTVv6vW~h
zGr|2}fGLXKpV<?I3p(ws6;G)72(P<*%?<_%WSs{TCU49FIHc#Uh=&+BeJ>+36*$gY
zI0n7M4j$gRb|V!PWy!Xb8OlZ|UU`X+&?&F6;N^-Ao`fKo3v9`T@>b#zDhFv7%LoDH
zrNjuJyk%>J`r+t5<xF`|86vA^-bAbwzt;MqFPa=&`!AOBV?r(&2S@E8pfg`3L(RZT
zjU!t?t)+N|u%>jGg>JOLCpl0!GGgTz<H6VK{hGv{1upo_Zh|Pd)|LzRn9F^pC|Xje
zUivj{5Fy}Xx;2-gmFa})l)En1D#6%XVN+0&Im9_{Yd{Ck@=Zz@LNJ(3H)2S&fbLt{
zHg?jj)$%2(rGR*+CoV59KZ1&O@Kizv<(?inpR~>QDh<d2E9e+kGOr_9cB7hxM-qe6
z=CY5_{RWTGgvyT3#=tGINxKg}GJ)i^j;7_2>d7=X5;tH}qkehii?+T>fph-{QH1q*
znk9ROr_rmCIj`L>Gb}r~cAc>+Um$@^@XQKx>itM7VnVq$-pa9l^XcCy_68WYw4uzu
zUi%HFY(yLAgmRk<@AY-f36C-fDo3XK@%cMPOJ@YcN?VYF`Bt%5X%EZhk?Op|L6&S+
zv9m}Gn~|UEVN8N*p%Q8wV;Yi9*xTuuZE^{yL0W}tdVcB0!*@|+Zr^@W(*1*&m(E7^
zVw7@OcH5ohYCm|e2Q~`mr3Jhw>$Aue4>e0Fe3kbY_T_Vz%B7dH;vg~O<6wOI)!EA#
zxbv2`Z_wuzUlOv;282@??yXp-AyzJeQ(&C4e$eYH1*!TQK5*!f$B<2AKk;?^yAD6d
z?wGzA)?eud=Y+VovxBe>TCKuJHt<j8Q?vyrqM&nrt|seR-AU4#zC=IRuRln>%XFJQ
z(f#?;dZog%v$LCM!dgB4uoZolJ~~76S^B(BaIU+Oo|3pIU2XoFt}XE`l(A-_Z7pjl
z#M6g%T32SvDw-t`OpQKhl+T>l+J?wX%~%0HR|n6v=oV>E3qi@?!pbC!*kVY*T}b^@
zocW@)-UJ&K%tj=1OinP&8}<Vi8muwW@iC%BTc*usJZ92WeP0eo=Gvy%r0$A)3{iN!
zku4qG;I^V1syx8+ZEU<*wrLmndipa_lX2}D#ao`k)d-(espG2HJX=C)4=EWa))$>u
zOq|9YO>eT}5#>Or2oIh;qDntatWquE2u~M^gW9E8*-dJOSbH>rvxLxzI02w>K}b&g
zGq2f-<=h)_$1!NfYmqx;DrJ#RkpAu@1f8<IRjWOhH#TB=aCkk@_|~^lC9%Ad(y0A=
zaRk^gm*Z$w{c`}SIA`fZ-h#*qFUB;;UU;J6_VLItQWC*{(dQZ@71CF%BSjro`-nr>
z6<wNB8>Oh<?PJuf5n&<RQyNIY^i@N)r7fm8`_0<3b_5r|Pl|KuBM#|chS3l8aTDr+
z-xuoY0w?}Oo<q;OcC%=PD-C;R%zaQ~;C3T?SqGetq=S1wX3dhLgHfZCFXCsHbg!v>
zpgNp5mhgeClag;7ZxuYItWKx)4yfC+#taN0O$dcxO@>zPNtQ_I?w@L<yC;ZpZND3t
zV#h`3B7*zp>pOZ7=s4jNhfjeoJl}$Hn?d&cLWo4?md;VTm_L^lnzIQ)Kj!Z%Ed55?
z44s=Ge42aXu3MG4M<cOXEq%cLsX-n@0exUxk3<99YAC>6Uw`Kzl(2%CBz%8kM{lPU
z1qSep<<^=(u!X`4*FvEK^_RZr^8Hxh?O7du-YIsLYWBileS-36G@G08T&XNJ56zFo
zEL#d_>s>kN{m%iAz1ZdMtA}9=3#FqqUMahLAV%V-^eefI$IG@q%hEo7`)qs##oNup
zjWD5^*R!pcz-Y`xuj<xsZVKgDEF%IR%N1IxOFl+vlMr)Jw;>;lh!~(c;>KU>F*yWf
zuJGEW*5YD=zk#*VNH;KK&Kp1mL}Hr9p25dJoozo~Ry{*>Vty^UH=oQp!T9z9-6NwO
zCvrYw=E1W~T`javwlF#<CyAFGsCJn(M2`UdjJEQrhz$bL$js<k&)}$T$4*$D<CE`G
zTtW&O`d^EF<=!;^>H`{zY%pcz=K=dO1v)Zm#IZD27E}Ic9UJ(swF{~OEw&pQu(DBL
z*pw|$d7hY}Zol~<feqE%CL~9+HJH>OGQ+EOcab=wkBm7kmzfp{kU)ng_SDT#teXj$
z?K1Mn>}Mtu<sI`bgmy|xn{MGXmKLiECxr=GF%rD<9E323KKFW1Px;an?j_~vIuhZ8
zY+EqVSE9L|2{c%2C^@5B@$VfXLkJTvKQt&BUeL?5#6nYf`C_3pt(H|8rbJBOf^uK;
znJJ;EtI~?kZ<BAZ(q+VjLl3LN>l;VUy$+~;8dtMOq1#22<@2D`oc69Er3*!Dc0Uv<
z*6-9Cn^Oq?oatyiB#IOJdT@~X3OEN{Acg2%`_|H6Wsr6PHF{SXf;}unokUos8pJG%
zTpucSHj}5tbm8RQ?~z^7U{TAr+tiv3>&L<I$dGCJSWi-MD1rV{*>bkEZ)Ndx^28f#
z<|~Ao6?XLz*ytiopM^S-T15p;{e`kLSlB@5gkv&NCeM<E3D_&)ytAd{6qUiO;$Iqa
z&laT`TwFgrHg525bW`9iY~Qjqw(&`u!}If=YiVA$=)QgCj>wsYchc!yFPem%HY$D8
z@laqMBD;_f;UlFRbB7fYWam)_>d$gID9AUR$_M=LJUEb)!X)(&f;72*h<-(7%PE)k
zu`I6^Q?3-7c@La{(*VIcE(nLJgE&d>0b^3Oc*vm()OSI^4p{hrhIZ%xGCnCzIi^<>
zE-mW=v%kkR>%xg8OLS_lx^$B@FnQ#Wo1x3Oyo||?&_4FW@i!I&(WQ!6k{U*Ps0r$o
zzjt5%B#!OKPly{mqNxTq;J9dEAxZ3x_@Kez*DGmO>c(;E4Ru3A@4yKTO2fFW<#e)w
zc=UcAer9i1_LR8ph^+4S9E|WdM`;msw=kIL;$WKBkKhE7tOmSIjIp%aYBBaKc?NjM
z6%Q6S8Wex6pQ?@Hl{)92*=O)?MG1_qYAKjH2$kV#EpkZq%%znZUr{!8maEr-onxvp
zIrExFEb=lCsTuvo7?kJ)Aba74Lm`a*`_MN2A~5;gs-z##tmN82!4z&=gjk9-h<^JQ
zl5TA~`Xx#ff~3zm*o+x640JzbLpE~!UzVey+b9%%Y^u61?_>t<r3+8{v!wYrnk~$B
zE&+BW_D*+y62);JhZ3FQ*fqGOYHa40J)6L97+IfRCDFxU@AmemPHPcPYpWuNl_97l
z1a&2FcxG(Qr<`F2m1v||keLqZYAEcrG+HUYs?E6h2yoUv*lvha+oWHKgKnAYZ<re$
zJ6~Ap9XU`)O*RYkHpzIHt53w}8zw@adGcd~0Th!bD6wswrSw?-La8p?`(4b7Qxq5F
z>cy$&o~?YpV_wcCJR%sv;zVO%QQT^vG*XjdJ`W<F<W`67jiCXT>N~PqRhnVP?xEeP
z<#g0qS@|v+K?EG*Wo*UQqrJMLbj>hULh(MdW@N+ZZD>&W1>%3E|3gIqi{qMQ6h4mq
zR?g?x9hv3tJn?EV^VQXNm?BwBtKNrWxm_}m-8V@%K9IV<Cf-Q%q2C(|dm?5*e)dSR
z<M|dH@uqi^|4ImMn$Tv6SB`f=p%Cs#pBd{itCbf3ZEp<!uFX`4IG$rCryZlLpYnXt
zNJM@Aw#cxP1@w2?SSHP5fvQ4AT)7`fR2O28z2zSBbc?-_fn*^^r^*;c*7zYLFBj_U
zNjU0X-^CU=@w@M8u@2Wka1$Ym`zKj)@(g)JRpKicHKx#JkwKO_QMRW{7-cp?=meZq
z1LUW-M4UHs-Xi30%Rhq!YQ+M<##YUn>_8>qjKORi6Wtxfu`0`Ti>-k2dAp3XxrEiz
zS=;;-le@vZ`-7H0*fiQuD1Ra8<1esBOmpdT=a?6a$XPl2A8NIem{x?YxbvPXj{1=r
z6o|gtmLPIfd(&y-X{rC_try3>*l}vfq|KJyjdv<&EAI&Wj$sHnOaG6UX{4{_Og6{*
zWWQ9i)(R<cvPv?kxI5(`iO<9S4|^`Y7!*?kkK3CzNZny1d!r^X-a>aZ<t@vYN4naK
z1WjB4RZIll0U~v4*;c9c+mvSi7`h_0FNjwvUHkU4m_q^P2dpqC8A)vt$NHbd&vbU@
z)kB#*1|V58wXe>QE<4$c#xUcG_MZn^`@1j$BPN}ni(~EzPi|RF0Jq(sMQMIf*CULB
zqg*;p-e<NN@Hn~j{3bKCp0}*OSjnLrKRaVuaLlVquF1ycLNA(S^<UYW(pqVU2`g38
zhdU}m<t(d1)(4HTTBEi#vI8M*I-qGZzEML9TGc<?-5g57-T6c=kKgu4TxlSN1rwZ%
z`5O^yeQuLwG{yFxO-e7nIW#i5PgG)V2v+xY!lF#7xngN0f5>1#_h&Ud!AdSlFG4SK
zRDf0zo54!BO24(dM}xUn@s>;Xf^<5Dv6DG@$glk&GQ+#;Wq-g|`Ox9zhAErdorOz@
z{^{(_SZ#Y6XinpSbENFiaaZriY_^7O?9)P?Ydl2_DeN#FI}<hE4(6Pzpvyu3JQU1-
z1nSNsIgFH-z6{*ew=T)8#g+;bgGj<4%{J~4!%gl&4a_wF5boe#e{bo$Dk-5EL3Efs
zpo1137hBXHy~immdWK=1&eZoJO$Y4yx$VZzoOdLdFwJSrUrWUILEF=!o5&o!Hw*p`
z0HHu$znU{0epiunmMT~dPkBvs#NC~g?QN!LX7`Fr&Q7gf0d7%hoLL3{N+54o1@r*$
zoO|Tz?LGSN+G+<`#CoZ;Kr6`sf+<|C7VNt8uo5%|IR?rx4Du37rA^mu@Z7>Byh#SA
zXvL~3VKefs6sF4XP?K2rF(@yZ@ZTS-T|A*5lp&WAxl4p%x-se%O7${5GjpCmYTQ9I
z+9kLoQ~-s{(cL0Mb%6(V*Hk;Bn=<?zi2>5RgiP@d2-I^Za+3k#SYvvW<*v|KJ=~ab
ziu!J@(uSv8|LNxdF@vaf9OEa5+Y;Dhivo{x|0E<B)$v_>r4s?o<w|#VX7ry$2(x=G
zga<VvR^qY?^=Y-u7r7N+oaMFrw8fWCpS#+-fcZ#@kNrWmE(9Y!+_D%^YCz+ybR31k
z;>lpnT&j%us!8{tOOK0^xga?LT5+nxTM{l|f~j?BmYctmxt$@^s#+SWgm<#>1c7M7
z$2~wYGsw%7G7wABl>wL$P&zgdnG`G$$>c~YFq<H{os}t2SxG&}qe^uNn4(MRQG3Nr
zKuL#CrPgZJe8Bn^aWnIxvgX&^i)N9N1-fQibb$c6k|O_4m+%x9n7V-mK99ar`z)Rg
zkzboF^A&>ZhENniG;@gIs#<Idqvik@f?3$2IRpKw0`u+jQTT3J;4pgA&+Sn*zc(+1
z;;7)cdrl%)_%!TMJsH$Do&`F{t|kW*v|$Djc7aO1uwOs%IFS^$p?D64rZ=MUAvTvF
zRD8v~w*Vjnc!1MB;aOWvC7MRwJ}5Q`AF*&<rV|r+_x&(+X0>XPhclg3EGK`JUjT`7
zO!@&R7vl<rTwHn*D+>%+Rl%84j4zWr3fdj;GA{%0k1Y2r58c9?4Y<XtHXdTazZ1q|
zm)SAIF4e@P3xZ1)qr@DL`RPc<;&b&`+KUVrVnJ}d)6qX~SNFoC7K@w-$wRYq^>Pj~
z;lij90`%tPUeMEQmmAqaHCr#T!<&;8r({;iml~Tk>6*9_`i?Wd!2RyI=#OP?bn~rG
z0Acx7y}QG`^j-DURNQVy*pe)q%Wk5=n;}@f3s@vt+5>sbyPx5AZ-D1%ZuLa89#DKa
z9X;*pS4iTAYs&;t>P$50z?Tt$-H(Rr9Zs2Ifu($<Og}+G%<yxW?xHMJg4~?oP)<+-
z@gSTI;>KcGW|b7Pl<U_YP_67T{D>qcVk@vSMQoCUZ##H$+3<y+MAErZ3-O4egcr}=
z@%Ot?W&*9=Y{3FAohqpm`a>~U{I9D;6xoSAttY$G^dkY@XN-RdayjE13flml+Ct`W
zFAR0BedVa7OWHXN5=2DIiBF?eR`Qpl0Ko6}Qe4jYojGVyl&7eckdnwt$@Nwz{RMCh
z*c7|;$8|?<1Gw6NEhBBa6r_;EiEYCHXSe(@as$9s8OOs@9+@TL!$=VVTS*BxaSAz0
zA8-f_!n<zG{i7DU9Ixoj+}lq1bmc-~83?)>tTFGYjXvVEY}F%LQE*dc;6Uo)rzior
zfwikmWFny~rTd_cDawZAx`dl9RN|c-?s$&WJsA$%(XtT)WvAWaaXa#IC9GyrG9?Wd
z5&TG0X&$%-z0?x00F<&3uH00~a+j(kAjwCRF!V<F<A&UkvJ2H@%i11xk0y5{{!nKx
z5egy^hL2W-Y<l6;EkF}D1IYkz=4m_b-Xz(nrXC@SnG7<}(~^Ym9OzU#zOfIy@LAp!
z4ZIu=%&XJQ*8K+kjZJ1oPM@BfH~@bqcAUPM{}rqryQe;1arFUWohjGJi@p-kd7)Bf
zZOh)2vq8P8-m3_o11R0r5E2gA4)`mW&z8AuaYI<Xf>(Q>>BYC&^Vy>9STVfAU7bsr
zvSQTcj*Vh2Ns|#Yn<IIi#tRkQLX-iX-J!eGF^8c#k1V02ZP=vB;Tm@M4udPXQEzIS
z)RZIBy15l;4PmxIeHAGQY`6(F=swfX^@Ia&xSqtq2v`I%zfxlbQ?nJ}s<4}=NnrMZ
zLSwkfOV!dah9x^!rKU*Pp%e9`(3G!K*;@(<wO9OM=m8A1s%mJq-j+P}`N#gCrHQVx
z1j(->XH}dIj26Uw@$mK037?*xHTbt{-P%s|FMigpS-oya*P5>Gp0#V&b+3kUU2E5N
zb}cbFA3hMmKXr5rGK?kl8DIqK4azln{}1|EW=!A;FktG@*SeftFvJ3gMCwQzGn2jj
z#`2gmhZ4UtXC$*m8@(`+j?p~;i)LR(853h2IAB=WIU5g=ws<5mG&D3mIzG|QlG3kU
zQ;J4_@|~(b?CXNZlM{N;)$nZN$e8wQ9hKZVcxqaE+)a<uW5epxPIwfN4tz(yfS`(|
z_oIA^YI(CdOSiV4Q!l{shq9?{TgJ!E=oQw_NMxC@t!hyLr+_g5tV$$>vPrU{zQXov
zc0D_1EPnykW7$+)o|)-&hBl23Zl1(LO#1dm3i+~ijuG=<cBhfd8?2u!UQX{AyC|^I
ztm#i(WS6ZrU__V4SRe6tL@n2gnz0(Xg_R>mCu0l~vTPK%NVRl4aD-Zs2&|GqK76F3
z!-q1|VlHs3;<10Qyc;=MUNU63qO?0+UcTXgc^NTc*>W#7oy`GzMZ^<9ULM1h87Kcc
zkpBh@ZCBK)b&J<=HHeF<RW}z^evifEL99er7F(JjShOQY)TphwTs1?CB&qFNhN4<>
zXSY4BY%w`MuqxQ1*f>2hI-Hpros1_IEQhheTSg|*!y}U!>?*@nRKGC|4AkW0Xn&WO
z5<UZB!n9e0eaTp9qiw~Ev0?^IM+|f#6><EwJSHed9Nr0%6JP!U<wfM^;Hl=C>E$s$
zsLF78#YjX>{38!+&>C|gl5YWh>eN08NDNs?3bxb|?gHV*P&_eNFOLIuk6y-78UT#t
zJf;NQXBLXcz(kH7ogU0E;?{2@hclU>_3JmK2dAbd(vz8tyKvlMtDxL?w~^d|n*Zc5
zz8D;v9D%RtvB8a_>CDh6ljCEV&7<QR2S?#4o9oG`!Ksm<{<bz=1y|<QQzxg=TerEC
zn0n!)XH~yKw19ZRj&5_@ZOPK5ImRFyVZe=4v-M~K#fU8F{_EwsQ#XqVsn&N4t}2I?
zKw>DOrb}F5U9}yDt~bPXk#NM=%}THe<0%9E863Ai(zQWbmgy9%Dzruxni?z4@}Q^<
zGU3fC?<-X8GU<N=l(mHl&liPuu)&E`1cqW(;a@fx)huj*y7?$9{<_)WRI}<%#hK-6
z0?z_D^>7?)J%i7Qc;lWFI2FrdgVY}%MO<MOpr1(Ol=RlY(b4fCcgZ=mT>osjzJ9$}
zQRLl~oLvp84F1p8%T>ErOcrgs;wURcHYC7NS4%{Y^G6<g>cNrf08u($m_<!&GKnVL
zB%JjQtbqQtsjgIKvNJi`Dc%%kljqb;V314wtHm?X7{Z$`?C;-WWt4gF;0`dZOobO8
zfO#)?Vs;O?MRd;Tfd56KDbt-@@$8>pzV*w0xPu<vK2XS8w{C5i{D&Wp{I{m33*^7G
z4=)(Opa0|XU-10r?Cit11{Od6Yge!Bd2Ie4jZgUeGspZ?)^QHEk0$z`&b8fZJ@dbA
z^_q2$>3<%L&)jNud+>RYqw{vTmdu-_LUExNc)vNT3Y=gce~yMO_36P#q=Hw+YL!``
zuI>si;Z)3W%B&O$RHA5`wO*bDrmtCdwS^)yRko{e5PN_iJ1#z>OA>pHS#-By5UrZ)
zN*MJb{J|b8m@1$=o2=QDUZXR$#wuYg@pQ(n)$CHh3ye+aHCA_4_T$r%Sq0vjKTL|J
zm}h6UYS+uTB!^;Ix-;FmX_N5}rWFt0|8&zss#2ak>^_?8|DM%ryS)3qyYsRA|EPRk
zwQX$kQzOUYl6~sPmf;Ebn}+|-e$tWf@1OrVwi5n4es*x{;F2XDyX46am`{M;C)LuY
z*Cy?JZQiU}OHSWzY-e(Tu{zb&X&T0awGXL4NB8=U^=ph6^k7uX8c2y<sqXll&rXdj
zS@M*Tk>SCq{criz<)>CoxN+ge3+`Nf_0>;HT(v)Y#M76*;L>A8PV4x}GyV{H_l3v2
z{={dm|6uhaulwpzH~!>9Cmi_t*4w|eIa9lLMaTV@eroE2Q_&kgSY7_b3+LY4e$g=_
z_Z~5^{D@~RU-IH5$KCP8>t^5g-J^avbL{7iyyFSSMc?)L>noqT`S-O89=iX}_x$y`
zk6!<b2kwqvxAD@a?R?=Av#+@2k6-$ixBu$m=M8-KxvTEqGWW5k{C?;e`O-<LH=XdN
z6VgZRI`-y2{N_KO{jMv2eA_cS&%f&W5BKGse^2q;_1}Ns!5_Z*U%vam#PHe2O<tYI
z-E`bJ-}}bvYp;Itf4^z`qjR5{*nY&pAAauYUAO-1Ki-u*;@y3@i<diBuTDMf8E0O7
z>3iRM^gC9(_~}a~uIhXBl8=4lSEmfz^sc{*ANT8Hez^TJm&QM1#y@IZ^nz>t^#kYh
zKjl>)zUtp5ZhTkmsGlsg3coz+rQi6}^Kb3E^2R%k`ND%w8a(Nh6W4v__8;ACJ^8qs
zGw<K_o~vI!`ur>AUTr-7%2yQbI`{F9i(P#8H}3q>drv#J@6+eLuK%-l91(d!)Es@u
z)XUF$(PtmLWBaoEVlV&mT;z!FjsGY<n!V!M4;P2_eq!b8m%e`Rlnq}jKJ%;ZxNBSG
zj%UrzynM?m??2{+rE?0$+_t-R<a>Yqs~_L|lsAm5e8oLo-~8_--4{i--h5Ttt3Q0o
zMK_#v;q5>D&_%bm5A1v4gOB^=t6w+ztZN4^{pxMcT=AwaT{{<f#zpU1TRN?GXTg5w
ze>`uf`|V%4_Lb>Zt^MKt{TIIQRo{BY%l=>YtL7_z8ko5?|M-a`?>P2F-}>YA+yC<&
zZ@i}c!DBvrWyjiMzxwt)Fa2Th$Z!4hyL*2A?1x@?;g`PpgbTK;dBat&9lztUS7c2i
zcghu~o%#L~ZaM8UU+bBC^>LTJ>jSlK+}m4PZCE$|Zo}4_C)XVtdD_r@?Wf;#<7+>@
z?t~|8xpmLwe|mEHU3cw!&cwzKm%envF>_x&??ZQ98#(2@7oI)%i<?GIOYIqZ_a`qu
z{}Z>r?%OjPig%74_kv$v`1nNpvX#F&cVWkhvp#xf&uy>%?I)h~<mbHY_UB!@{*K(q
zw?2R0WpDe+`s*)0`;KSs82Li`-AVJo2fz8P<8S!ve_no0{}F}F>(6}L8=gMVx#Rc0
zJ>{0;zBhcsJ&`vZ`M<dfU;T}1m+rdawpV{LeSYTuU3Tr#;g|jL_|L{lUpeibdyl^S
zxA$N9ffs(Pc7E*mBa_c~!h1jZU$aNO`-V@y>$y+<_v|ko`0{~0y+51!*M(I-z5IRs
zbJw2!@|U0fxf8~Z`_k%{U9;hm*WYu^3$Kbl;om3bF5a~2;%~&RC=I20VzJjde|Y03
zFDv}Wyt?g}ufO@K__Lnyr&GE=dF<P#|M<9n-7#Hy^NzPYboW<3ao!D6x4-o(+ds8u
z?|;1PyT-8}c*5H2ulwk^2mbuf^ZE{4yKdioMf;b(`S$nk_~F%`{n!`YpZfVvKK+U-
z#xJtpd-8|YetW~Kj+yxScW?Ua<L|z0&F1I)@8+*ey!hiEdjCh(-XDF_2^*h&w7K(|
zpPljCuWjCY!W)0__}3U$eC^-1R!<(e;JD*o+*7*swHN;O3EzL{aYtM<d&y<byzSIW
zjyvJ}3*L6gEw9~jMD3b;zj4}i`(F8itslJon%~)%?>=(>g-<*Ai<h2o@TI4J^ThN=
z_Wbfw%WqrrvZGHw&^7j-Z+*kc3scuWaN^ioh8E7>bjzCiF3KMG%Sk`|lKq3bt~qhd
z3;*q&a~|wD<<?{J#?6(J-)U^T?4j+~9Czdwj1xY;X7F`q-SwyAUYY*%xfeb3z{!_=
z=#~2)f66)cq=p`>U0Xis-s8J|aM_Q3yl}!Bcis7<kM$n)AKjlkb7}hvFMZ0dXXa0M
z@BTj>++a`Nw=&jyp!%AZyyQ7Mzq0wB*Pe0m!AmdQb;_z8-~Yog_eXz``1XeTk38a{
z%BAn?TzcNOXN<=manV^X`pZpgv$wu!{birOWB1_sO9sw#oY&qua(3@2%RlkUH%u&_
zIO~L;e7?T&eP?|6ho6aEyyUj!CoKQ|&F@_L{O7*!Kc4#T(a|T3zB_u{bsN92_Si4H
z{N9nD-S^A(jtffP?mVTd|3>@dpZxwwH`QMM_)qR!o>~5yAAjRH*ALwE!=-00y!?if
zUOxD_oPF}$^B;cd$~#WJ>Ydd)ethm#pStXfm0x)9r9&$QE;{vBn`iI);zvKd;gsvX
z{6DvS?v(qN+-Uvw`S0Jn<!Ar;^Bex<>$iXY(;Z(vZu`I;cYfsu|M~Iiv1|Tq{MH|S
z{;8k&?#D*oKHB}Y>mPXepH5zSdFG8bJ@XB({@|`nZJ#>l6*mn0x%U^pxa&)g|Mr3P
zH?4Z*{BJ&McYporwZGfC_vW*1So4}^zkj6@|LYI?H<gdPrt>uu|NH$rAN=OzdCOjN
z*RQ^N_3SO*|M%;AZocKAi?4rh6^#4(i*C8Ha!+ca^Nt%|choD_e(UGa;)UbROCNmP
zUzfb;gzNA7b@!Vte#WaF|AYN^fAoUizZ>|xPi%>waN}q9-+TMz_FsQ@)QNAo?Sh9+
zeBjRcpBH}i`q^#AFFpOsmwx5xd%yFk%sa{#)NZ}*X-~U<_ElHj_|dV-56`{$dCz(I
z12>JIeZf6f{P*4W_I$PbDML?u$&22-`4vA{_}Rrjdt2X^fBck({`}nP6JGkcOSime
z>HR-G@{4;u{o5!0=1rNqzIWUU?VdMozW=`B*Is?~z=8dDz2f8tKJ)4CInUVm``>@!
zx<A~0&$Xp<7B0Kw=68H${m-_%^5Em%<E;IcZBIM#icfFYwEX9po1T5&w~mf{@jHLn
z|BLtDc;?Q_w}1D=Pyf-+Z#{VL{^y?ZyBkjY)VfdBUUK7~ZoU1i>_hecX*)Lg*3QSB
z>D>Fob#3>Ya`T^l|A{NDJKlNe^Dauip!53Ay~?@n!k6yOzj}0Q`-fg}$<t3b{`aRY
zKkJg${p{Wkow(^EFMHLi{&LFn+u!=8(Sg^*{`>B?TsPXg^Us+t)Ly*z?rZ+*f8Kom
z+`qqN#p~mRp`qv(=MH}5h=B)w^T30D`QW!+@$)n9nSB4I|NZ{fCB~NJ|N7S7+kdKm
z{L(8{TzAE;liz&mx-ai|OZEqEiSGRHo8GYW%CkTFyFY&S*Uyf8@sv}}yyv^0oIU@~
zw`GpK=qE$ZA3x_0$A0KQ`S`s*z2h}!KJfz!58b-^_~B(giJj`~{m_NyUHgp7CQkm#
zx37QyZJ$2zq5H16?z(+(Yap}X;Ge&9xqY4U=imRq`s~F&_~P#_&A;lkKQoJG-8HrP
z#3MQeUUXXO@!xp!n?7AX@${?Tec-zLpy$v2<$quGg;yLEea&6}Z+Iq`+wi)ZIxblI
z;`^U)!Yx1e`Pli_ZTRUGuRizpcYo@u_vO~@8d~~^{GL7KJ?$T>z4yYm{VsjhQN@QY
zy!*;$k0#!k|I0aN{q;|uxc=pPb|o+U$Z<3Mw@m-y!ac?fuQA{J`RD%e^sCQ*kC7QJ
z{M&Dr9N~QJjt?*GeCo+}ee2CPKc~3i%&+~qYxynDzjs;t(!!PB+Wfs^*1YB&_J-qA
z7f*ceQ@^}AKQQskU;pNf#~pp|AGf~pjH7yY9vpbv%#ZVb_|8Xv@`2ftpZE4Z-r4^6
zmmIw3oBcgYh7O+p%IVsk#M3`=;}6al{rE3_`~3g@?~%l3rq>txKDX?=1J1{ifBoeL
z#_iHKzwrL|KlQ7>|H&mUU*CP!+b_Fj<La*u*{`^Me&~aV`DNeyugxzw>C3mhqW$A9
zdhu~@Gmbgy*B|`a;3;Px`26_keW~mFC*OVd&i7yNtIvGz(>vZ)eete4Hypg`*2%He
zcYO7AM;$1Q{@3m=pZVJ9;!hv=+3PMkKQ^=Fx_dV~?~04x{hp)0^Pl_PQhC{TF5kG}
z!7Ufxe`)Xir?0%^U%Gbvaq^|_`0(q0{lNNt@3`*#+mG4&+yCkMm;b$YXwxn4Ubg)&
zXYXh`ap_4{U4Fy&C%%3Ek6!=&fBDTDFF14TTLVj8de{9oF8tx&f4$<^3lIF}7yt9F
zzt*=sbl`Q*eCl!begAQd`J3Oq{Wrh5`;HfVZQ>hSZhG=1zq@nCf$6<p`*z3A=RWx1
z)WOO7Pdnn1zwYX};RW-BndiLrhJnv~_c@m@f8$4Q``~RaeaV4)(r5RLbzb#fV;g(U
z`_Xlu+4H%d-uI->d?$8HVeh@WHpPGOs~>;)?Cyp9&-VWAy0tIA;YD{I`1R!*eiwVu
zg}=PF_)O#2T?<dV`kix^pKPDC=AFYA-k!gpYuAQn9RJq4?!M(y8@{yh+7o7`&Od(1
z#-~R<{>e*@d;5=n^Y!j)=Dzl;!q~36?z!dG6F#`(14o_I@r)zid;bH+zwf52H=lC#
zSx-v5?!m`B<xi{Mo-e-mo@agUt=7_^8*b=+)k}X~&VJyMcMkN<d~3Yky>NE_rrO<e
z@4s-{)6RYVFF*Bf-^+dAqnFK|we&4dyyCRT_&bl8nA!54;g6I*c+*cm-T$@gUi8|x
zU;9D(ozMT&+dkjD{^M`la_R7et9N|)r*ByJ!;$a#+?uPB8+)#OS;0s@`;2GB|9a2-
z{tpe;uRd|#+IJ1)&be>yIq~~`p15+y#Ft<G!wYZERloP<&;M>N^1CaJJ88}7zdrJ+
zBQO5&`=50BhJ_{L=9Zrxd(y(&zCZT-J5T*w;<JB95B5+0`KR3{<f?C&eEaG<HeYbu
zwcon*lG~2oF@D<7?>+s?-K%f8GWC>~TypcJqs{~I@0@wx@4M&U_wDcAlKsoqBU_Va
zT=Sietv&F8kF5Xt{^wu$`R>=eYiiZUPS4$X(($L>@$qxt^Oeq<);xI5|9tzG>t6KM
zKYx<(=PL7Y--qtKf7#`q_^($ccAxVX5KNA$jciRHb^DW^{j7EWdd-tQvJ3^Bk@VQ`
zl^b`z_-`d({hfar$^Ufgu9KRpm5PVeM`QVa?do;i-MakW-PzUE{h0j!XnZy-9UdQ=
zI%8Yf*fO<s)Yvw?adc$Jh$cHacB~%i=op?FW-r#HI=hUis#$h;^39Hp^jLHtvH{=X
zpY-4`{Fxe=8ch$3)=gt=s>_(L$N?y88Cyx2Y$U~9&d!DoRy48!ox+TX^k{#Slzz^f
zW!0hvg47?aS^H}pS;vVQTPD(*`lGNmQ6Y`}ZcR@O0%%j)lIhc?N4EDzdCN%*M~@mq
z<6~3lu_@jJF5y0wVAZPi*K7IYN!Z5Z)ET2`Z&w46dJ(mU7*@~pkkn)^c^{E_Z$k%F
zga$g;up=8bjt`%Kf458^F1p~K|Igl+z&BNF|0f|WZ77fykh0&Vg%)hneTUk;4Hg>O
zvMET@<faWIxoK|F1wp#9saW8lq5>_83ZjCF%2Tv}%A)eX6&K#Ch$!gufr?Mz{qZ-;
z-BJpfKK=WC@BcTSewvxde9z3BIdf*_+?jK;xGGn<T#mHp=-S#^Ev!A`tc=!VOw>&&
zph`<}K#Q14Mq6nyYpARuP+JX^U0jlzS28IkV`6kxhU$8pghj`~0`(ax{3;XvcWk!j
zFEuh|vjsWALQniH_#zuVp$$n}4faa6p_10B^3hd3;cWyKyUWR#+`|2In3=n}YeP3d
zSneW71;Z@3VPk<R!73!wVX<m5^db>>#{kfU?bPxufw$|01{ka?BOdO6UcU{fyfnb?
zqT-xer%f*|%j=od2Ag3aW7mTAMALP&F`B8cm>4!Xt5i2NIwdhRCO$beB|aYNx+wI*
z4P0ncTnrQop>qTisL(q|XeVhZ+}x@9EL4urYq21ou3#$YR@w}NxDdH!pA;JhMFsTc
z#O&)1jfv6O@b{98ih8O<OX+B*n>AQ1Hr7~GA4wHysX{I2Ln_}=>89bCA|{fWsiksg
zFkld@2(vqq%5qo2n^JK=<)R;SrP))dl*B09=BW6nc$iG(6y>4ACRQtKakP}5s4ISB
zre*_%8PI(q#0VsUpod{^!c#3?B*<>SH-e!UX)>y4s{^?u!~PBsL0+JNjLxTxE^W6)
zaL=+Z9(e*psBt!n$;7zQ#f+i6e$r%!nyTlVsEL{k^mUy)Jv0W_1gHRX(}ChnRNz9e
z_9%r16*5#gfLHig$vAX<5B2CcyUD;-rGxn~juLuYKRqX^#KM3v?4)V<S`lHyxa}s+
zBLKW^&GIkNx>5bC79(wEX^vG$N8l7ZOo8gd)dQ7{%K(I?W=+WxbT8mqj)ZGKM?uM-
zUPK`^I!VJlVM(LVFe}n!^xQ$Q6xU8lCs9L~Mf&RlL*q0VaRL--#Uf6<Vd(Ut8)3Dv
z0Id~^E~4w;i6#m(s0KO%7dq+s6kz#Uu?92X#Y24i1$xY5iE6>sLt2v@hISeS21I)y
z5D($;l1ex&P!_yaJ^|tq1RQ!1lueL-Z`Dq~)lQIByUJ}};JsMPwFC*@vaO7f1Q?Hj
zVq3FV)>4VirFjSA=1Lk21=q<~LBru2vD{7qj%gDykwk$AoJ9rBdB-PVe3FRgZ^Gi2
zrh^%;dq3QWTrwt?EXptgB{-KhS`GN(6-y>Vs9j>K^6Jq0)kM5EI2MLPi7;e2Ev_mX
z4NuG#qg!B%(`$ngv1lYpM5BbpXAnWFdO;>0lZlt`r4o(pUeHLuG(6-5US7vjlXpC3
zsf4LWKj9n7d^NmNNy1b_fzdl@BMq-@(B8qx7%YlM8JZ+=;DtFT^F(||!9-H7BeLEJ
zq+$Z8*AmDTmZ*ecint;2VuppaaIY6EaT91f#1D}hdFZNPA#^wa<|uDq#0QZJQ)n<w
ziS#ULzu5Xb$zfV=(AXF>Ma2l<0)w*xOmCnItyWqxNqU><Vz|jJMlwP<T2Ue`)F|lE
zi!l*Y4G&iMEs&f^8x~+8Bka&vTrKI;=VaV2cvM+R;6`fzFxKNe##ojEyS0D~;x->}
zSwTC^1|!MBARh86Ucx9y6li7Rf*bQB9x^0e!VQF>N-Yb$4Apq3ui_=zO3%`66BDJg
zo4`uUOHaf@MHMeqQ&f(XVZBdh@lZp>OY~C-T?sb8&U$aKBnV5o&M1Ogyc};7k|BlU
zYxKc2E2ryINP!emJbEY>dN}Uh(cZ-ea4*4AeB5<Fr5K#`R1x;&M<6n2F(h3IUAIZz
zD+GEaQ7S^%11PSGg=kHQW@G7GjNa`m*6GH~MU${}3KoVW+_+lM%R#+PfM^PqPQX*Z
zqTZ{nM3Zi!$C?zmRKB)cFYQmj9FX>i-r#~h$B6V2n!G)xZZvQ9ruj*bfH+8|7{E5n
z2Ja7nMF??6Bts(NIME>|wNRjn-7Xl+HyAm8k=`h!KuY3x!Rrsm+R}O!tTuZ=DHT#m
z?P273j27==4j3e|2kttNs7D#BjGgwr@dKQZ@&#J4Kzn%anWE!5J@1pAJFr9`J;_jZ
zl0CLHU{eWi;9v(Co?Fc8Q;CCA;;u`@b39+4OgtnLe?2l;dL1dlfe3gi%pBhIS6Xj(
z8S0>|fHTf<<UDu$ob^M;TR*tHei^(oMa|UZmK9FY#Ky#og&X~{5^4r#7jrQVlmczV
zh4CUe;myI==3thN2|zl&XIoCF!(@({SD?w5SAa5Rm)t1djJ%RkUGY?qn+u5;J#60f
zfCd(NWY=WiZ|?;e@d~OEFQ}j)NgDT#H!<)|m?i^%d(V%2WN0$bm-pP2w98D}Ycv^L
zfCypZm$wKe#JpoI4ui!BIu(C=&u?W6CQSzXPnH*RiVu-tuxEaZ!eQ??8=9~*8Ti|K
ze)vu~O$Pk$Juk;1LJm2M$YzVa2y(-#VIVjB@}ApisHLkxiY9{(5n+HxAO!d(%FlB7
zS)%;-nmz#FfOiB-!{MgMz~3bKxe>vVjtJIcM6kUY5iZ8=wpGwz!15sy3@@{MhyVj0
zgJr<~-t)Tc4zM@TWZ-Y_`Rh0#tm`I)H&mlWe&MLaZepQg^h_a9tvmv3Xxugr8aSm_
zG~9MO;_5X?y`cgxg1cEM5uDN+8qj&Klmd+R248QXttKe}lt9=q=w&ck^dC$*VuWC(
zLYajb#Ut7abQQxakf33-7if#!%t+8M+6y#vL1~r1QM?y;i5|E%trv8h+;&?+#wpo>
z6H;+Ikhen#5iW(42J6|E#2Qh^F6~RUcYVor>kYP-y}|a-8@<!b0;U@u*<SO}<un-S
z3ZzuKB?uJ2vKlRe`L*ykdj;!A_p;c9tDH3Ck4uvwhP~Gc<wY*tIUEWT;*dL74rk?!
zaRfN%N|S@ZAR&sS=>;4L28mIwnhLjB0HPQnw$^EJ@%%(#Ld9uev|Ly4A%X=lqvg7R
z4-sL|D_;->g@`a*xA7q&4D^bJATU6NK*k4*K|vyvLnz2WToM*1E<l7}T_&(ALKqw*
zMOo}T$U;^({GJ3J#1L}9Wpm&Sj2I@vp|u?sAVP2=&W8vE+-7i9X$=)Xi1-k}P6_2S
zG6Dz$Nl`51yAUKrxeNjd1bcyslfdE#aYh=RViJO+D1ja1+yFVNL=b_RKv_+6B?kf_
zLJVE!;4mOWh%s9kXmk+6q&TpH=3yX6igJo|L}5Z4bYsuKV2}`HHHoF6Fe#4Vc@IM5
z82DIE3=`sPhB^)fLZldBc-e?Y7w9814+23#l*7Vd92QapQ_Dk`T0)G|z>AWTWJ2I_
z+D(j2fWb(wkYGt-@<77`LJFdKBiC*qXO##d)dFlaG*}8jLX@aT$@M76StWw12qzYX
zh3h4_I_5*(ivu}L$ZWs`$PgB@8NQnoqqqnW5}t5$bH#CCLY&3Lfh+`!2N}UG4Q;uE
zAQ1|`?Es;0kProZsc|S6Btr2!F$@%9L|B3Q#GD5!A)%67m{6>s^$MP5HadVjLW`;-
zN@9n_*`Zw+4sy?UFY(x->ygkq3RX*nCk2o|PQjA_y=%Y2Nn<m7w*+zuKqq1&wMU$=
z6S09)TTu@OpCm$Hmc^OjF@FIGBg9CP+vX6EFhYzpTkIwQ2_xi4=;FjBVo{VBU1@`k
z6$CVnlA~F7g@^?aVx$%B-o!9Dj;W=^&OtF^tY=eu*HR}fb}R_@0tZiM(-JI-6XT@}
z?hSw4@Lg^K62%CI4>EOu9Roa_sL7DV2%Z_B+!i~2-YJcdV!>k6&Ld%%6vxkI(ikb0
zWyIRDjHIsJEo?dX0r_<eY*x2nUKVuwr^yh4H?9QCmct+5z$hW=9hr+w?n2Nzq7YeE
z`H=Vg@cdIH6eLN+J8CNTfJzK|$CS`;j>8xn_Krbkn=u3hy(4Bq;{{g=4ik(DnAzZR
z80;3VW4Va;;_y>0K17foz0}o(%)Xv+0xY&93PAz{H^#*<0mdO|6TvfNln*_e<IL*a
z61=1FoXUs1=jR?k3qb+|KK~#Dy(20)L8v5<0k9-Tu0YKkgpU#-@v{_3gbanB=1F5j
zxJoNi!Shat5+SPuy+ZW-O_CA4$J7IgQi$>JMLQmFm_UTa&;2A3A{6(8Ng5-<NuDfq
zPa(ofv;rR^!g-cSULHDVC5DMG!c#BLxOXhSVi3aw7`B38pd)w=#z#qzMzhD1D@h<h
zcL(<dYlS!R;OliwpznDC9*HDW>=rAJwR^K6bJ-X>EkL+4kt7(#DJ_dnAVNzP0ep-E
zC!DU5#7J-wLFXbws4DzaNE#!-b?-v*-m}u6QB}Oy@-YG&!`IXMUK-}I)3vO)KH_6U
zI0-BH7#U8&Od(2y^kk<bfdpOW;$hxS%fVbs#eB5+6vN&zl0^^Un#aMbPX~$abhz0n
z4{at%AVV9C_?CtU=Tivro=VLliHw3-I&dWkWN3?YqajHkL-(LnuSq7Q1oi~{1TRS-
zM0e+bwKqHvG%Xh)L`n3l7$?JauWoN@D;?}&oD3^jCJ0eN<TYYeLo8?F=~QWq2!~Fn
zieXZWMGErrB#X<)N=ov2zE#X;k%CA{LTAHxx#43ZIBaJT!z37o)nF7rC_;k52Q<a7
zcMR*f*J8={TC8-hMRaP7&nWJ-SmM1F>$%rr$@f~UbgxBpK90*M*|(6Li{o;3+qaOP
zhvRa4Vtaw(Cs3Af|G{?Ke~_NJLwUI)xMJ8l#>IHd*g}*9*=@F!B#@vz=1L(-g7lc5
zgeVD8I?IrqJI6U4sCojBi;^Hct4dx|>Ab|pNN}FZ2Qf~7MW?Cw5LtfwfKnRsj^o6c
zyE)Z8#XG)ERNZxCn!8?9Zk`9iyIaN$!Yx-Te{b(bR`Q~G*>3o5KSY|3c&$#+yb`*S
zgOo@QC*8<$TQtvLGT|qB(ilNuAg6S^NE67=@NEMkl;tjN6X3cP+M6;(1t>;Ikj_eE
zYvz$$lng1_PsJz!vI6uv^w+>4`6vMrZo%Lz#3A`82@<x-V6W$qT$B`PvAd*5uXmz6
zvI;ueGl`Ufl@Vk@h!bNyL`s@ON<pIkJyJ;Vj6<02JW@#UqWQC^H%~=`%-x&cyVeUD
zUJ@t8x`jzanm~Z&uW?EuL@1BOnn-8PqIuF`Oge@+Gq$)0_DmwDATAS&dS@F4+0ip{
zAxMCL2DA$41SBR9q9r{;c6U_B>d`x-H%L)tJ6+qIQ_>_d3ZhA{h}<SvG!LG!2Qxd%
zA^9i~(j{t593e(YG^Ut9hL&hcE=Gv+=pQkG4DF#Mg*X|ud%?uzI>46NLz=||611DG
zg4=5=-$!Bs0oqBMIT#2L<(HTpipcE_MV^c1BJx!;&MHxDe3Ss`wu|jUVFFBT7476J
ziNe>cnWM`}(0}OZfM2|djvJ|*qO8)=Ng6Z5AU>&z46KWCJK%}cG}RQwPUX`TRBSvI
zo066opB5iSWtWteQP88K=v;APNK_OC8j*vCGzvPdU}+O&W}L`927Ci&qADs1RSP?x
z1xt41inn+Ef3NTV8GIwY{CXe5Uf%zdoS2y0{ryid3GsjUfBro_P}Ha}oe90sRttth
zWDOMyU2s8nqtP+3(J@I>Y*Jbb5Y+_AT4jdL0I4tvN?y;dpQmR*55ANGxw`n3KAt_?
zD^uA8=uNegG@<$Eqv3p#Ko26={Rn_kQD}T1GX+qj;6KV!I(urdzEoGrxhctp101>B
zy<Ig?mx0%^U^>)gsOI7%*66f2Tqp&_!N!RHeJ-Myn^&4sqSKclKO)_Ta?Y1o(T7d<
zN@-O(7loD&$b%1ez?_x(S!N?uv;{edh2C8NlYpY4SjO!%(ohZ9D8{J*zW{pN+n!BS
zg~bl{@bFiyDnj4=7w8Me;G`*hPmijo=jv>Pm5vmA=yD*ZcD%GrM$oAhH06d`2zz2i
zuk@0%3AF_IY(|L&qsvl5TkExglj=$kw|D1v1oR|bL0g&H@hVt3juj?E4OGc4_3ewi
zw}D2(1zWdX0zAhDwWSO-X*~-TdJ&c+`pI=M-H3q(;`tl7)-h1nyh|Z1Nx^x`1X%;9
zLDqo2M1FNyK+;+1My~vjpK}AivJQh0upOvv?C=*FF92s~Cn&)|BiGz621`p7ZMC9a
zK+b&XK?38pnjq7w-C!~?sUj*suh~Hm{BCd|5c&mrII>z{Mr_gtn0k@qc+3N_Y8Jbs
z@+#yFnF8cuB31ZZ-dxpr8HQ|7g?sQP9Fs(LE8d;B6;4-tA<%m_>tev<B9^ALV`h0)
z26YYZzX(X44fY<quL_!DhHp6cC^!;GywU15p_iRk;jZ8-Ad$q#Zv6|$+v!RJlt)-;
z=tj?z3s^?8Fi&e}FoqCYB2~B&6b&m`#XGg@Ue!qHI1z?2&V{`p^L3QGI-RQFJo6&2
z;M23_>89$+@IbVf;XBy@3-N2(O}v0n$Q%S{b%#LV=SqNMUlpDSxCX}vUSfd`!*ZqS
zmJD&?NGXN_S__sLk&>QAe%M*~_{IbU708$Y4MvvtON)k^2OY@DVm!hz8<7JpSm*Gl
za8zBSD4g&$^ss9ypuj=}pjFLg+!RzaK+E9#8~}Rzwp2p5ub7J_*j!GF-~s`M?2JUN
zAbBKPe9N;lG*LBFltsfcjBiyfH{h_khTiqi6>HRR<To3rPHVb~5x9eCb*IBs!!A{R
zl#MZYN(azkHn2B9<v|N|qzc-%StLd*b}4^tRU%a$a|HAq2URdq60n_+1d<U09yulk
z<N|s^P(l*N{zAWTng;YFm?dCg^%Slg5<Cm*uo~*IGF9Qq@g-4U9b~cgNE1S#00JDC
zoB(O;N(`;n@o#QBsA(w^Nx?a>)=&>+3Ng&-cHq$mi-2+mI@kc2*<&eCAV5JzD2>uW
z(p1>PIAuWMla8f_(=O0GyA`PmgJ+dN6u#shRtNkD=^_#ylvNRQosovzv9lHvAO<#A
z7Q}6SqJVt_wE`5sbZ$PdL09}>%%Bs!unVCtQj5!4KVI5jXppetD47&4OvrYr@Nm7t
zin;&|d-yh7G%Q3n&AdVd^MS#FoWOIg-(h)L<nK+Io3AEIJD{UzJb@q$$6|f$a9V7h
z5+YScD8fyVQmr;mUs60pFDf<U@*jgR*AeHWLkm#?TF(HuD=7>vI)K<%Y(Sqot@WIK
z>OpRMQL8wt_kk=zVZ!??1mT8gq>80ooDz2ePB}nfP%L;-P;&Vuz|!i$$_$WUz~mz8
zF%yHQYJ(ZBkD#HOpFgAvRJb^}b^^rHJ?co%GNS>A6DR}BLNzp}iH%@Ln%!3H-w>|^
zFq`>C@YNG$bOT<Gq*DUR5lx!`cDLOO_$;m)!1Ax`n%=-_Kr^n=l}>4p$fGchYth2E
z7_Eu<m9`!&jH8hJ!u6SSb=H&CMN3OKM?vv7z)p=+K~?6lqy#HtI3W{hZmm!Unu4`}
z>j{?uFZ1|%2--j;`4#t~oyHR%VlV$Qg(pumO$)rmE4@grBO+C#OFprJ7QBFfExl$I
z!6J0+n%8sMg;cD3Glf|m${qYk@Sv8R5fLuQ5I$a5=OAiu!RJvBPy+Q1=&aOQk2e6I
z{-`spyx&T(_!_*btYT{Ums?Qqa5lWv2EtfGO7rrltfJCl>Bb3dLLy?vt2_-fJ-$At
zheT+m!TT~@R>9Qb(lT8RCxX}`u?^@t19X)suButuYDOyAV29q<>v7$(rk52KmvGo?
z-o&En=}jzfdRB>VV}U#ByyASkNB&jDncv}aWBX6+Z&HRg`wuksc-nuG;^Gqju>brX
zAMG4X@6A6dZCN1&Ej_W6CM*|PHhat;rcr523z3IcWSW_Ct!)PW&f8{G+H6=0)$J;+
zj$hm(a}0=LU4+AM6OYU=5G*mn@c924>x(wK1XkEc^=NzHTJtOHF4`i!#QY&)>c4Mu
z5xc^>y@l_pYiund5du34WD+1l{TEtUKo5dAp@l_TqNBn&zEHh1uy8!m+NoZfSG2kk
zzR=&+xFYr&6vKbtw89O8-kVim1$ZL~MPgI|CGq*Y8&pu|WKz8CgyQWfK$7{i|2wu6
z$h#hFDWIz1bE3k@3@IS92IP(k*Lbm`z{0%QQ6RB7Q8hr9TQtAUih?O=JWMF420fWj
zI4StUeDZslPoRXQhg1Jmwi7tw!zYDPqNqZd`LD8?z$S183hIB0%|ueCIO-3J$-ieY
z$>7Z;85z(}0++6wp#&_Z^-xylME$1>B)9@PPy<j=G`uxEm`2b_0UAGgGK|0_9sKRL
zGl~dYvE0}q;;|x?Oq@cSte{Qk<O#Nez(mdv5)qEqI6c`vB<ms)>xWR=nj4rtV5e(%
z+lNM6{zI#Ww!*3E!K{JzIHF0TH`WXY<*XV1mLUUf4fBfg|M%G}{`mZMpBvbJxHnV(
z`Z8{8|A~!>i;d}S|4B|x{=@$BdwdFX`6<bU23dpbpD^l_$!cV>g)-UVzJ2fV_g}&=
zOm%g2O-;?hg$tJ~St6G=D3y(Ve$D;*wG0^0G;m<+fB{Pb16yypX<1<4@*zW34jZ;|
z`0#s1jk<f(sCz>~R*fBdpGMO*cI@i$<JUw+u1!pQAU1YgV&eMP*ay?n9!g7l<d$1D
zWM^;6&E1%t-JX}%F?sTq!osaZMO&s!*{0V&R#x`tv}upeocYA;**k8#ZReahPuy|G
zljY@48;!dwD|cHg&(5F!EW^BDwLVu}{X$L6OD@;m`udmdymQ}@C9mFf*S@Bvrq<Th
z<;$0^TD7XJt!>@9bq_!M@P-W=8X8{h=;+wCZQJ(k+n;>$$!DK^_JtQ-*t>V{zJ2?e
zoA)nUc3{PdgLmKk`l?lLw6z^tv*z%+bw}5)e{=o%w>EA1OGn3FHg7($ZQDEBx4*l6
z`+HA5`N7jqf4F-$_&d30&&Mylbn4}oPaQmX@X(<{M~@zT>#essJOB31JMX;z{`)6S
zo;-Ex)c*ZlhYo#y=+K!XN6s8Q`o*zhXOAEM^4)jOz5o9ClPACa_~UO*o%;5(&p!L&
zi!Zvm{&D{N`ES4d_VnosXU~5B)mPu2JNLu4-~M><;>8OW{(0%rrSHH0`Jey1^7GF>
zU%B#se);8>|Fj_ezwn8K|KM1V`CXNT`;RQ#)xN*kZ_tD}hj(=xT&514{7B*M&9C1b
z96$fl!@IW}x{u0PIa2q`)+1{pN_WgT^31k3ABZs?eMC2?W9!3f9UnXwykc5M+ETya
z!(WRinXF46F?>{EL1U@1)Gt3vzxD9ytkHq%L!3Fj18$x_+&}lB=h{QlO4m@c(^dqI
z%xVqTZM#xBbx3}nQL*bwDz&doilhAeG9TR4ph{P)OFXR13L4L9)7CV-Hh$gmwweIH
zm~wgZUp5W3+8x_=h62HNn%?srkeeH-s2hEJ{qtWP3rKpkAt65Kk<g;D{Q9-})yrgi
z^KO26?k8-+khoL9)6_l-jz;+3^Ww$y?LOc6ym|2IvPyMl!LbMQn;$VBsZupX`0S&Y
zslPn${6cXua;l|pPiMjKn4x#DZ+<kc(|<y0T<enbkReO0eFn^$XRB?`EtuZ=P4ba`
ziriV7TF&@akJgopRQuE>=55YeHu|RE&l<<2Zf+Sl^xW3tQ%qBG3;R4bCE~Bk6jg1;
z**OEkj)X2B8FV;g`NWblvjQ&}Ml@#Jm6GXmpIX-zc2`?SOF)=I-`J=BqO+MkBipEE
zwehFeGi&{Rjy0?sT`{a=$WyvMeI8PNSY2*V_#OYey>Y-Bvwh<lst+%iIMsjj28HVQ
z{tdqB<P)0mt;c1C=UaU@-rd!j)X)*I^+KyAf5Ln6yA|1&x67^`U!428JRu|Z{xRu#
zbwm5cnzN@LIl4G$zAWggu0!{(JsI=2#cdzt-(hjwmU~FPI`7P~0Hx!{s{1~PyV=lk
zpL1N!7*)sq9gAJs0@>ctc@?K}R-S45yDVVQ$B{3xr<2ahQmHk1zb~JUpz32@&i!C$
zkYmQvTh1xIK5tgL<YTkUer+QUDu#AyZ!H|Px#>XgEs?vH9kbuxRFSG#cW}{w=z@(m
zjoQ8RbXMW|)fWzEzWns`;*I`P*09i3dk)lodO6J@ORrP5D!xt(Yia*+)lPO@-q5Jd
zfxbFT^MU&|r{6A{RjWKCcc*MkJP~s1lg~G7Y@G4*;xn&z-kvo#?9=U!H`9)#R|{Gx
z$LyT@9?AUS<Cb^7Twq_SNE=~0v!0r<W96(9`^^n;RQAx>3v-tZiXZxepMT^~?LxLW
zRi8Z|ch1G;fRR>nLcJz3n;l~`Rkz+`j!3#Vx$VJS-+Z<C?wd0E&iU!~wy=d~j%O}=
z(I+$e?Dmg;Skv##M<*p7*&NuGcQhqPS*XfgJ9NPZDfxE>l}rk_Yw@uS{^jz~FI7ez
zANWk{=!OB2!%BY4E^G|Ee7R-N+sak+D^XLL{4TMpUQ_+FI$~r;$emr&-jfyXvGp(S
zpJntbG0Qr>IoA==ba+sHz-n3GxZEJBeDsCfnoZxCj)$z=B|DcLlid2UTpqAv`QXvZ
zBb9epTd$tnQsSfE_L#1!<E|f6nd;$A<@oZjAXQbLoF6kAvg9WU`e^Q}51#diD%d7h
z{?wKIX=lPcew!`+v-j_f2+qCY*EwLwM_vC=wkwvVZ1x)$uww7aZ{*(``-I}Yhy6<a
ztp2l)pRB6i>RWY%ottk~-IKX=aARKE0pGJfPnJ<_y4OdZn=o|0DzxO8nO6>9IB;)n
z_JFEfKUL(BBT3IQi-!1bvvr2b1})E3`_&E2{^9tJ8JACFuDR#)uy5KA%vQB$_p8rY
z8kX%ddP3OZeqY}<=GDAS{W70ke)WnWh}BPS8vGd(I8Cu=@OORz!N(rBCHq5J+w4I4
zi=~rqYTJ;#wOzR)MIqmFb#meG$e&-gZ2aCm`I~WFZ>8@4alIkL84;ShsCnqQCnHlA
z<%U1*+a|BiSB{_8pgwq*?bG<YkKA=(dDujKk)@(~afT{$(8Pz@3ass0Ux_pI4Nh6M
z)R{XuU`tS9bLF;}XMU(#dpt|=OKQWUk#tb`tS!2WiD|d^TBgmJIB;nB(a7)WK6`9r
z)=K@J?e8x6?uVI6Kb29Z`<8{4tV{jmwevXvjV&XGzoy)o@X%)qQ};Y|x<FBJvgBvq
z&C7=+e7ALJm^>$~R-G2s`Dow9T;GbLNjZ1O1D71{qg?sp^sjx|mFCAovJ_b@EvFuB
z+Pu5L-2b#+Sj&4Mju?eu;E9L=pPOan>Z^w}5y$^>;3N0_0e*k-smN@JZZPzl6d|vl
zbu!fVD{V;LuCkmRU2n~Gem(Qdiob`M-^|~2^!=(<`QUvY<fqkWl>XD}3P&_;X-kaQ
zlX_xZlx^Gi#LjmT%j|c4aw%Z@($<OQj_^lvhb?_5@8pi!SE8PXy6sBg#+M%&sOs8z
zB5d^FDF?UJ{`u?v<+=4qSwml+`O5szzYKkEW#BzCo__V6ZBN;9lDeK77WdN9-R+%+
zpY2>z_tS>Jg}au2=qp$0+xPTY*>LaQhHaNG>hhg&QZe+Q^5*Fq+!N(h)%i=;%!^(0
zU`E^>Ot?>j?_ZBUz5j(1Irmq!XUJd7yywuf&3>!CiTovhPsp^w16Q+?bZ<xW`zh~o
zYS-Gl@B21>+Liv?Yl@sX7d~WsWL0OMI2bn~+b8knumNR@ZOga)t1#z{kCp|d&3NYi
zA+iyV6a>u=Rt#)7?(?T9r`2mmt(V0-t`18%5n`+QHp}s``IqdU_FX!1UnXUHF|GLY
zv586NU5g($C3k!_F*Z|k#I->kRv5U)pW3O({`+lLq8@5}=Kg1s&RHurS2ska$ubx9
z)yq!#8;<2SH(XQ)`G=mF7Sh_LFof^k(X{f7x4*eG?K#Wb_T7KIoUTyI!){u=T(<cB
zJHDSWuTJT(wFWEXS3dFEwC~Zce%bN%iD!LZc(VHKlo7X<-*3A;Q`Qw>D?d>kqRQUc
zboJH#pGP0K-6lWetQ>d8zSHlFt9FI;+t(40G@w#B{)+X|vtu@X=l{`&59g*|T$g`A
zG1{?zKw;L(fx9Cbns>D9`P06)kIY@?^xr-5ji!pm;LGLH`V7eG%3sh~ogBA(P?Yki
zTc?~p_SnCwR`gT$tsAhWw(m2`C(UXc7`UnCit_8gtdW@yWZDia8*%mg@;Cnc_gOdH
zyYJMn+lr$P1l&@$-|uBV*=x-a?PqUp8I=21_1_~+15+2j@I>BQHI057pXfj9y?tM=
zJEIGx`vt`ee$Q9^<<no!O{fpvqWEC3I=pRW$oQ6TzZy1|dM<lW&|_oTe9z`r@9viy
zAnSblu~oOQ|7vLnd1ce#5%*ke*cqC?_Cox|SALo|<jZ%rB+KGc20rCK^`?x^-^$$k
zkCZi+tgjRf-rs*vb;|%dK*Yc8{hOBG{lerob|*(Ds`5@G`9`w3%Z-D-P9Cr5$d5TY
za(&C-8IFccmt-xw)Xn9}<{txZA3HPd4SAy3s7YxWER#QX#-)8ftB*`(*wXNQh&=Z_
zA6cgClOWmXE{oq8*}SdQqv(Rr6Md(bC7f#=e7C+Ozpf=O*uSPN_pD*?U6kTViTqVx
z|3CL}DcXF$yx3==CSs^s`CZFk-{6_gWm%&>YYM*q_T6stGhuT5SoK}Id~4fMXJ#rD
z`|A{)wS}wwYC3)IY)h?`RjpO`opB+lD^QlG54zggKF9xJ-+MJ~^I7%I`<YymI_~kx
zCqB$bQb!qMWD&b&Pkdh1e^;y~wr}5Ejo%GY7XK)p;82V|zVfM`RzCH(Lce^>O>I66
zog>yX_|0!uG`%CA(5{GkFHvzpzEa`8M&{oV<2#m$=#!~jf6#YR_Gm-1y|nYrfJWu#
zxl^OZPHuhY-oO5IZ$R_NVO{c3RPfHAh~W6({_XNHo$`k(VxJ3>k7<|BdQ3idnYu);
z9Cp!n+3V`mFK;^$JV7!3t~dTU^{bOnn|}yxb<W+~xayT4+0@6>_q5AaRs|L~to=?j
z-r<uuB!Bk4gvDbjqR;G~5)k6EV_V?L*VJvYm~W;pnnF)HXS$jf_HM=)#}xn7%HS12
zcU_P<-=F;a7g6KJ4Ih}Poio_~gOh<N$#=f8HNJdo%rX;ub8KPN_iNvOKW@{dIQ_Z6
zTN{@AE8c%*%(~aydEdT2enRW?@#Amy-?bz&u`&3^n0MdH?+B8)4(AP8Up!{D^48<(
z!VVw(pv=W*?&!bXXZ{{#VNB5CwQGN#?yD@1jqzWw?u#{h^JK>M8PnTt4a@4=@W8x<
z?eg+NWrJJtj;)pt37S6W$hw5Ami-^BmHSQ%Dj6Z~QatW7uhsh%90~H<(zJ1J_NDy`
z)w>MCHR?)J(%J^UICX^I-iHkJI)%EA?Wc$HyOhss)YZH08Fj$;>JMu#1x0ACsw>r5
zKI`j)nj2*Lm_SSBhEM3c(sv$QwPwUiO|u6D`Yib}sHsg>EDKDn=$jyuzoc0_>LX3v
zAelO|&&cpVeS@q?HpuOmKe)rM9CZHfO)mxxzZBQ8IWAHmlTWzd^ZB^IZ>!s1{b-${
z!_O>Jj_t}@@$AiwYvwj(%g4%;=9m@F%vQHv*f3^t{Kj|tn%jMDY3LK%rHJfQL_7N2
z(vZG*){Ml<>S+xR4jo$<dz(68@*tZ-R;+(GdGjFCiAlvjC{>;H=^=jau6EGXA^EaL
zuLSz*^-*-=t>)UTub$Id7pfiQ4@Cv~&;R++J|}$r%9Tv!wnvqH^Yq0v6IPeB$rdhM
z8Z=$6R8c<e;g9#(@Ap`1P-&*m_SYUC5aOfj@-3ba*sAyWEN^>oR^Q@srN2Wt=dyaW
zdWQ-?&TkKn^}91o-Q1uoQu~xPJi1ojcY3DJv|Y;4=NFb7_g#N<M`(hNzEfGyR=#ZI
z15?#I4}84y*yWwahd=qw`9Qf`mi`~!`Tc+UxxW2Ray9Z-mT^P-Uvg4xLVRrZ`+te?
zf1LmNT|N^-a*K1|MLY@~P^9$Jvx{^&lqM=VdS-l1baZZ6F8(1w8xu>FISqE!0v~1=
ztkKbVQ{f#wC?D`5UKMRHfvC&kveFsc6;-N)Hq%bpZltLxNSY=_<KI;itrq(N%1K*2
zZv?{2z0w<jRZiOMaU-xdFiwCu<dnR!EYOrPeN^7G>AD${G~6K){Gwbcr+8{v-qbRV
z3T#w5dPc?4u1OY_iAqUHOpS^~mlAPHRTC>1Q$1?A6S5%|{4;PR_jqV^qQzE8u}&js
z4`*4|PzI}Ol14*SFisQgoTP~XxuOjjs_U^277of$Rn$`@Oa<+9G2Nc(P(^ObLaLCq
zJ1y02y4%woYNo+zqHRFhxr3?>P-WI;u!8=}VI1{N=x&i3X9U4?be@lUJv_Xd49}^+
zc0>XR$%!hlFj`f<lcufpl7m2Q^vE1O!h??%`2#dJ<cif|r0pz?lnj3JJC_34pasq4
zs)u>(fZXP(@n?YW-EBSw-+_xm=s@r|cy57lrC$%m`C<|rFi8M6IDm`=3v?-dl*v8o
z!zJS5zmtBG4?aQc;EAGRnw(HGW^_<9AypfzjYGG`;o-~Jco0mBi%*M7qMV$7i1&5j
z2g+$I6-5Dlz(=2xG(e<vc9)YexjFx3h73-~V8Q6zBs`u$fl&ea1wPW`js)7^V{)s(
zUg<Veq60{lN;`fw%DNp6#_3X3(st;269SC1$;|}?EP4hHeW`G#m(VFBmDymlSb>Ux
z4^?$8e5{dyz7SZdl3`3dadZ)$shCe2T~UnF0-q3@q|_r-yhk?AQX|phby#YY$%)R!
zNq*Gw?S+q;?Iz)rmU#Bk0bf{Rc3UGU<eN0AmWE#{uKH4j!210Ud4J#D#&P8d!~5^_
zr|4zI5nzL`NLfxIMw(le<yhCsvM-5FHmhiKH-RSE5r9U}4N{El{p?Sj*E&^Q4S*Eo
z$vn4rCpH`1^?K^mdHtPYaisy2=&J{xc>}RKz9)#znbYvG2gctT<xr=wrP#ecmh(pw
z!lrZol|RV_;`z6ceQs--^$CPvxP$lj#j9sjQ1%JV_{nFV4aXU6>Q^O(=-54#VUI8#
z?Yw~aCkTOp-!SH94<cgrWHt}7%Js5vr~k5Ey=!oQ<@}_aVx1%yBSuY~*MML!t1w&&
z{O2V`mzvjMAlxQ>=T@zOHM!Ckp%MHIVrtxqVWYCD6O3`XsNcB-=lyPA(<FMq?O0V#
zFtUZBYax~lKEf)PxH1@%1wTrdN<;Bt@Rs0P<WFcVgFY~v1n1<~v9u0@T-EEda|uy{
zuH&z1l{v7tSfBC!Lr_h<EGd?$aQ|}bdxb$Zt_`SN26sW5PixqV2EsqqO^&q~Fk;0C
zGWERrXLt^DXCYLeSee)?HxxJg{M5Zz!Y)$C5)5n#Ri~?ybxQ#Z5E5EqAWQ+o8gBru
zz#n1ml&6OOC4sJP0Vu$TSUZw7%o9(viGdq!j@AyC(W$$4@}@p*FN;-4d*z<G0bNv6
zIz{USg0+#qI5KwAcdOWzxUmfdv_K$CUbT%}Hymy&hY{m7Oi-nS6cO`9jwrWY<_@A8
z*d4g;PAiOKxhzi{5yPZtS<KbJ%cC=@-j&ED=ptF^bx$3^7DF^)J<*uosarn?I|mF_
z$05G~E(06pcE91nO5tFWih|Tm%JYhXx|v7wS%6@zk}vDY`2uNSSuBCi`Ws#6CR5TL
z%eKJC_R8EHu(6i(+&Hx(7FS$TCw2X9geUul&b#^G6$Yr~Pp2ql4*B5o#dT;euEV`Y
zNU%)b(Zz+VqA4fAMiME`%J;xIG1Lfy6h{*F?mln}@6JWTi!_E{RN5PNM5YaINT*$<
z_SW&C1;u+^IFW2R${-X7<4pOmJ9<BX;A0}&OO7wER{TRj%w_Iay^zQ;Mt<|9;?~9;
zO}E-U79Asgph-vd5-CUYkK7$j#8)rA0bY)cLyUKhqs@MTJt%O6e<211{WkQUcYzbn
zAtcJbb*I6V%3k|NZ_I~qqfjWZ>)gLG&R*1ueF-+B)qxNxcj*B2FU*gl>|J?<3mw1p
z$CF3z;D<kce)5Rcj&?=9bUQgesk^QJzwX0_@X>DzxDSr#ocowq3R0EZf%XWaZ1LI^
znejKj-+T01*z}{{qj=6)0USPUI0IAa;iJQGAY{2eopkHy4o=yVdg0^_2Eag~J!GPV
zMSI~sXmH`O0SZ6DVciqQ-`sbn71k1Te-AT0Hgc6Lu1t8Pn<0ePjk0NV=2#t3Im+nG
z#BD5x4W76wZn02#448>~oA265?bv@cEh)ZM0!;zsk$DYF55s2Xa4G0rGtLIbop)(G
z?%~ocT%+-u>lNN=R8jIl26NEZKqPqAKcqPnv*melQo7SAc^BcQL81(ZACAH6dX0zK
zGrxF9B@)Sp5rBI46DvUGhX{C$J%^|DY*t^wTET7zt&-qE;oVKSx+te2KhXNB_=t=3
z0NYzR6*z}~;7$7H#9id?@V}-tKg!FQ6Cm`zs#E%=)Nf7;c>%;te#TNpp3D1gG58-`
zDg3WRHRES6NcyK<(fcd6Lq$vf)vj0gH3qxmKaT(Km?)4P{&5Tia;rbbc?F6CM&a%^
zC7KN`JS%&U(cM@;r9}KMdR>+f`Ryo&cwTz(v40WPj32)Enjd0LN_$y*IcY>Zm{xt9
zJ;uT4(Hk-8V)(eH{)IUpyxl0@Wmtg^BZ~Q0<%4GJSiaj<&nBQG-P=DuefjFy_b;3#
zj{}pxd7N<KDd$RO3R{QL4)C!k_L{=DS-?z_qJ+>p@`jux=8Jd}JqSqcGyLCu{NGRU
ze?Q0n{RIE_Kk<KmL$5m3)BW>*@qd3iYmewZ&g4JblU$zA`}ElW|96Q0`xE}}FZjQ&
z@qgdYOZ3G9{NEA&@0k8~O#eF$=m-wlb1LB=GbQH8r+r$^s(Hn+_gE4V*Tnq~WGgss
zQ?KDHOZc$}_LAAr221&5A1@7et2;r+-SYofgD~cn@eb|f-$cB<lMhZH=WC?DoS0vV
z$vX^tHb0;GpD}sx)G31I=Y{`yQC>nQyZLeDf1DI6M;B)$A58O7>t8x|`tUztewasR
z-nsDaTsUD2FQf2{zeTf{70tQ%dC&h03rbS*yjZ=<U)yzlGo*!<&+hooiY4Hg)=RhS
zuX&UBlX3Q)J9D)g*a&kRxp#XAkv+IE^Acr*a>$v3{7@8PE}WS?HkS#$C-MD`2=ID^
z$Z3c_cibNP0Ht8z#O)O>59UQ=Ub2cvgW1sEfJ&!RQhkjERI>OaKXC?!eC+PT^^&6A
zL8SqieeU|C>)KtRFEj_S0u|hkibqk28XB$<em?>YT@q9{X+>qk^1WLSRI#yN>Tj66
z@|l<-RA>g2yOn>xe^RxyBBR`A3X0yJ|Fc}xjb=E~@$^gU7^Tp|U7-iB1_cK^*c{H*
z<B>ZhvUdNXnEK4EBIO3TdBZy6Z%)UYyer#=h0ni86TsZzCBQyK#n`+|;>krxa_fTk
z5wCR?Yw??``NtYqw|r&S-G7*4SrW{%Yr?HrAal-S1Yv8G*X27)4^X6YxA$Tof-4Bu
z^Yv?`z1^BQNH_D)wlmGa0JngXL}sYEiCb0Lmc42u>F6k<%MFzKNeKr#^?fv|FOs8r
z0|wDIsy{!b7Wg!qB(O~@2vkhl3~CHYp)AUuRx31Br3Z%$1;j-Bcr5hVs9k{HrOTYG
zQmgd>Z}tWX20L=VBtR#Nqgl;cH*iexg~LXTvjs>Y0a42==$7Z<9E*Z!PHTHk2OZPy
z{IW-ra@zXRw?l^!6nv7CDi{p%G2*GoWknn2yqs1=3*LZ`6){t$^mgUY4KD#2mZlw!
z&E{q_HjS8RUo~wxXCCnQ)stt>vVrKa!dCp<jEW1Hf{3F2@H?mL_};@G5AKp?#LXP^
zH}l0GhBT8?lw>2Og^9N!g(=0*uc07T<PY;Z#jO6@;^6S!-W~sNPaghlZ_m8?w?F*O
zJwLenx4U2bA^hO=Yxf2H2~E9uV}5%0@HPJxyy6Z~AYjq4_IC@K7>WfSYG&hd8vOxd
zHDB(mr8|F=jGXw<T|f20iQQ!MM#f%DfH29>e&#6f-0io#E+cTq-~{aFj;Xxo`*%(w
zpq;w=Ub(?jq82<JEcJILgj!#)5BK2z#&_|55573~68_`hi}Asi<^G}j@4MrB@bu{c
z{P+9QQ~cNcFB7ZBnX9y90WT8y^ZaTFr)WSU-{0qv4?*1}IiX&+m>XN@LE!Xs@J9wm
zj4~smmgH3Ra6h739w&(*F!1IaTq$<=a(_Ga)v$sWm^w;iWI=v=Wg5gjcW5t65KZx2
zM=Yi-QrS;e$RS&khc~SnRMue;+)~Y#HDu%g_(kSzF`?aXe7N`M&y)rX6nlKNEMr5A
zYOg50UAYfA{SSP_Q&nQETY^krAgyIyd1G!*38>J|5qV8G3wc^2^9D496<EUX9b+}o
zgk<T^amU$Az6NFBip_^$@PdzpiJRA0nk!fq#hY$_;$&-1D{j)W!2D?KiG(@9o3O5u
zWzmRtOfdt%z>gP{@pzD{1+*4=n}v6y)ABN)N6je!O*Nr4;~6|aT@cIa0bSu_v}BV$
z5yW;RJtT34Vb?c&r6zskO9km?Qg;a7L4yN4B%FR+F0|G0U?htgx39LS5`R3Q5ue~e
zs3EJpK-3txciSs3!h81)f*ANa9@{wrX&$Y*j(AojNb|JNfc0_Gh&EBcv4Heu{D{W*
zm06<RaW*heG$z4NX}%|qz|sSMkF&38;JP{&dBJ}%FTjxjyp|02WSKh3qIuwZ4R8!-
zn-|gVn4KDGdIMsg`+%~8{*3%|R-?OXA1hG}bJ}mvmYyLSDvJgkOegDVHjN!gOxfs_
zLrGlCF4{3$;6ZZZrbn3=dPrf72Lo0HWL$igHAm?1fDCQ#7K2pr@wwbrL!9_4PnmY&
z?o<O<f!iLRBJEBIvm{c&&>8$7v-(n3Q`65au1lz`<%5n+Hp~$m$Q!lLc1_lA_n&CL
zvJN@y8+gS4h+<wWs^xm-E~=q%$QoBRvLYvZCx3jBb^5+P{=M(r{SowkEVSG?#DPZ;
zU<W`dbxZ5k1znKrk;UkPw$1|P7WjghFJdqL(rO6G;AB=$-oZ|-ic7~j=k@9eg&_8y
zyDi-pl?cvzp*$VkVj`S3pecIv7c^5l*3g!Xy9B>=!Zg}MPOez|g}G|ckcL?n3-jns
zL)e6cXuYOmAZl49KKI=PH_I)H{bTrzv23IB8PQ50BcBv~nI2wrt#O9)nm_*G8851L
z%qqUa*$So(?r!MM-D)0X$-14B1YlUUJx>tZ10DxhV0r})7iap{3(~a|G6NA+#19Nx
zUIQLL*(8pIJr{B?zODs12B9H<mZVdZ2zfgk17n?re<j(NgIgNgZ@s{)m|kxf*rCO{
z1i2Z@7!ntw?WI;o?=L?^1mCGA72!7#^YO?M!j15676UL?$}JT1N--elXcuk?CVSQs
zSkTD@{>9%QfR;rf5;uyG9>Ak(h#IQbMA%1uAZ@JVMo2CwDQxNp9R#43x%-gFi(IK|
zv>?n&z%!|uInyun?A^9P7)n--;-`f6CM!k`NOB#y;Wj0B+yDX&+{U>h+T}USVg+Fc
zdD%|fxNLj+CXj(fO`r>kJXB<e!nGfVPGKb)G)06r8MrQp4<hRzMR`oPpX^L&d^m_}
z>a18HpWs(t?;&!Ax4U>bO$-}qD`)`(2stCM1zrnY&=hO`on`I63$GS1#50;0u{VXN
zDXf1^c8KjFNa{%{c(y<#wVJrwX$9b8lL8K?zlTu4=m^KIZ{rLM2v9$TRarMOT{T{k
ze9r9pycS1cVjccq*WnN0702{sBxye3B$f`GxHlWdY+a>&ijbq8A9NKHx9cQRk`{~e
zqEQkAldJ(Ab9hH1RCqE3*)j*Kjoe}*SZ7BxprnFwph0))m?Slz$%+{gjF%aF08B%1
zgih|FA>eUrg4;|iX&5X9d;hK?B^BaVgXjqkJJS9`haJ_1BYLO0aO$X&k$SfQM|_Ao
z0N&4#BnfAa<!)3w?}6eOhXJ54^`tIW6CZ1N&nTTNv$!7DZ4Iz76FOf6CUa7@mu0zN
zxephW*sgASi+0DhnuDsi0Pf^C@f@Azx^#K5T+S+%i)3Og!c$@d8g$okpbP(4ll$QW
z1QG8p^PwhYjH@+DO;6|vKoKDd5ikpFMDJQMedr(%z-Q?Q76N3@WT>z6u)<NZb<iD$
zre4r7MaRIHjhGze0ffDBycwKJIYi{}U4^G4XqW}+Q6{iXL>APla7?8m12>1mXF`iP
z9S|AYbf_Vrw&0=l53}(?%oq1U8oCGO3qHt^-Qv$ajKNKfg2d?VM)8)(#5M2PIQf9!
z?6CDrS`e)}_DGL7ioiVRi<x*Vj##|GNGL_~Xc7ClbBrnr8_ov!P?q}+VdIgpk@$-k
zm(Wz>xw~?Lu)U#LVgJoN${##<m_x7)+w)+&@Fx$kF~K7+L+{)O0)x8Bk<J~ZAD&$Y
z_mQW+UbyvZ4745COx+A1grw00>D(A!*qieUy*ZzU`=Xb?i~^5b>kY)0PWd*7wo${M
zIIMp%A(!Ea=bTOE7XgixWPHL_yQBQlkMYakPWy_mw!GiPs6cqSWlSUV#wz%ozt5$m
zSAhpDjO!unR2CMxTTganxAGVx_S(dV<?`^2d1$Bv?i8?-3CbcZ6f)0F^hOpR4GjcD
z^t@?)Q5Ct@=74E)gSZk46}FX>_@a7Uy)l+wfHQN;L<^V|q>$5_XI!-XE$9vHpdD31
z73K!7wkUrT#qK$&3Dno@jzljpr(}Ik87JGSRW~M_KLL})NSD7*@U+v*$U442-_ptg
zoaM{)YU$J<a9#V`o<sU*SZ>wEFO0D3I{rKO#1j&4reD0?dtqhXZKN}{q+=M0H^g?R
zVuq?#BP8MGtm*_RjBHvpk$)E8)+qiyTt185>Jv7Ns40Tx)55V(-5ao7z^Ma^vX4h5
zVl?eLg-3uIQ!^CDs5F~lxGJ_sG9wUeJSVs71gUBXg-r|?&rmHKF;r~#w4duutY4DC
z%H|1-XLP5tY&&1l*+dZzmR`OeWmkwt3CAe7$Xy$!?t8hy`A>6si(UtJZw_%7Jq<Ns
zLrtQgfnZ`H^&2rco<t(WAhVX2X?e0%@#H8b3Zs9h_A%63%(A1-txaPWKU@}bBL4lY
z8|(PJiHpHI+wBp=7IwIo_0UDk3mO{bd++y#h8=U5jrL^DdSaar-gQj@ubw^q3p2t9
zz_mM1D`eQlB2J3l(;a!KN}gYYlIItDk6sBJXv$@#mIzdVF(lYWT!O2dA`cW&6wD?x
zJz@%A({jW9p=dxdaU*;(mOy@u7jSB$N()Xf6WLyDIaXK3#pGZLT_qB*3Rc`zQ~M&;
z)V@GX?R>p>*F<_6+%oG$)dp5Xi6KYaS!CPfJe)ua>@tE_H1`)mx3k(B1cTXip+gd2
z^V6$s1(F<dZI8q(W)SwhcOo&Ga$Zg9S-tSr84U(5w4V^V^)=jPN9Hzr^Ghi8ct2%1
zU$$3fyqrL>))=p&BO68mWH~F(ikWpBAmlsd712NlkvoT^S_ZE!7WLw4Ua!r8$=I!~
z+sPUtd?4<}l%*+YVR_u3iD5(oXsp#dR&labIVs6N%Dq^Rrq`=j?V%ZU+@^%vo7Z6|
zqL-y38~3rzW5Xs#xN;;kgLi?eMKCBn5!V7`UpfzJ_IE2*t+0f}ynql{&YQxhZb!)x
zxIR~{fDOzf<ipmRfELjt7q%($f8v)@qWH{Ur!+)UEQ1_ol2PV;X39Mwju#V-+!Axr
z5Q-RFj)TF&sc~qK6agGD$=R@pM-+V`b`?A$u2nFPu_`iSQ#r=5z+-pyp<s5V@dU~(
z4r6X{xcBHQa0hvAL8L%FqKZ;Gn~49pnfp{cVDW{2UqgrrJtO|?(pzwL@rNiTg??r7
z3zSO<mZnUt>6#GWNlDjX`EHOeKrfCnOl$P?QrqtDa)H@6hDAK(p6DIb#!lC>j0{W2
zsc~MYF&cA2#FkSnAt^OA7_;W3`f32M9$4+kBRYyWMzCL>Ji>$u{M!K5TQqyL+)+#>
zPb;Bme_=K4FRXb+Na0>g3itLNd2?vO$cN6zhEVV!q0(GvY+wid*k-8F8P?ZW4YxGq
zMQ_flnU$wb&vA@}!m{*53t-Q$Qr<tjOP+;NJVS1^PQddI-*ReI7wSGiEp9N_U7USI
zwAi$$O5q#)cK#E*I<l|2r@v(X#vkB&pm25Hb5DN>X;7z!g)t~KvTL`wZ*Bx@w=u>E
zzu;tz^lMFlHI(;UOhKiTyl2KRcf#x$c>7MH57nzo!Cic#&b@686qg0&iHi*soEhql
z5R)BfXT@c46*Y8PUV3A2rzIQ)+E_U;ka#;<;IDFHUb)j?x)Oe>acC(5!Vp@%k^`wr
zs$=*VB8~k)cP@Gp-H(Lq-d$X+4ukuED~yCMt{sg@#a2+6<WTSm{XFhn@E0^kc}EtA
z_B{wDFor14Gw8Z4VPFN^k=SF~*oB~sL~?k;v^xaU<jZnJr9H%3bWTBQfxc7a5A%Ec
zpYAevUA=J+s?QEa`Qcqd<ltOX58XXA1UcF}ygS1EsG(56=_%x?dcWW6FXUBqe|eRn
zQoU)R?}s)fUVv#na2?%K$b1g}YY6{=BV{{!3npyXslFfOS8j6d=l5o2ZhP^<j*E4K
zil)f`yRxC`oeoC%KdFy@hTTlACNmZR+`i0J^y%wx6!&IE@XsixJ2np*8c0|OZ)6}0
z&7~WSggNlnS+A*3jSrEHaO7V37<R(uU&2n<UBf=hMzDNc`$l-kGi&Y$zPy&vqv<hv
zU_#@qTRx6I#Hg_QvKx6RHY$LK^@N4PSE|MbV)XHOnb7nzcVktj7+eXL7bc<7UmTxE
ziL59BQV6a(EaiY=C|cn-Rpo>blC>VtV7mgawvUp?28lTM%8Wr@#5ibaDSVygBR#-v
zVm|!|I>AKX{+E8qU-Mi3*_*VyuF?4CsA51sXT1sqW&)VGtn<@ZaZ#@lQBYsl8}*CC
zo$6yk{e_8)G3)FoW3J#4(dZ!`ecB07)o@hu<4UGDz88c_N71#LB3YxhAWju?O-%4e
zZd}uM6+1#~BIKGEg$2IX<#<LiOF$Kju@z9otge?NvQ>+PDkoZ&41)1FZz=eU6VfRJ
z3y&nF3bb|?D9tQ*#LLdM`N;H<iAU1fDPVv!D!bF65*Abm^8r-GUXoF$v*-78iJ%!{
zpq^cH*!Y)VF~9LaJD~b|a|1U&C&>{l=X|MaDqEyfwHwEs<OAm2*Q}p}DK)$nN&V9=
z1w&VeIo}!*i!5Yk0l|z|y_K^{#L~R0mP?M+pk%A}R)+P20IxqtGdLZv;SrC+nV`V0
zgozejlDsK>qh9vY1D`bCi7_9llf&d1u{{tS*hS-$Yj{TJvSAW@CZ!!AXxz23C_!an
zsG-fK0Wt_=w!9rSDhkX(?I*!mG;x6lD#Uh$YFgFvhUI{%l6#rLE^t2+<b(g!hovp*
z%Pq^NN(Pn%HEUU6@z!dU4{*RkwxL8ui~I2<?6^1t&8U4pvRlZ8c5Vo~Jn)79!`p)l
zP8=s+<)jsrIRe2|6H6QNN<_$vJ<-_UYE13H(_rol6;Lp-NSs|@ar6;SXi=mK2eIVN
znWPMMg53Ct(;&mbppcX$BTv~P$ci36eY2YZ?U?BuU(q;rS`r3|z#JF!Xlt$+-Z!mD
zI$^5=>8<D&e!t{Q7RtbK#EfY>Y-A+JCHo>M=}lWM6~nPTuU6qJl&_ytGDJzX%OrgO
zq(UIy!Za?Nc#N$bm^7U7(Ef3cM&gc1v?Olb%$g--av+&7=W@z9kb;2%Z8{n<9inN}
z{0;M`4j;N^>AD}7F%L)4<HPjhdkodX-B+i0hY#!kG{MM^K_BTbhGbj7f|`RNt^zkn
zXJZf!8nHR<YBSmu!Fhz84S_Aj-{X6!2F_9q`1O?)mMxYK{qNy^hR?N|@Z<cma53Z~
zU4@V+UPunE9(ACGHR9CHDvHXWz&GJ1Wn?$>)(*UvYRrT-HYsFQl<LU|*a)^zV3Y%7
zwqaRhNlyCX=g=$lP2As3E;2HNOPjDb1S_Ez3wk^*s-^<2804>%f^~zqSl(FJqp#tN
z!!b)LDsllM#t$g^v0M((1_YUCrZBF1?)Zm+8laM-wqaAIIK15u!?9{Zra}US{r*_C
zB2wI~E==SohFSOW5yxa;77MAd5@qJ)B-1UyRbd$F$qImVP~y1K8kkz4b;Q1DOmM5!
zx1eKV`oUSEd1!@`lvvtudY==y^0mNMXqv?m2q%WO`Z#eLK7^_2Zj&X~^Lxifz<*57
z5e^B(7k(`az+v1@>oHoCmonp~tx51?lPnkv<kvW8uV*5-fj7IHfw0kX465@&v|@SE
ztDx&=5(JuXEWqPmVo7+%>y1zMTe;l?RXG0lNZ*tM&4paDFuad`1D@LZ&ir@8h3#;{
zO9#Qgy1f6!^M7cDHRv1FaNCu^{rcD3r5nEa5CPDTQK=BV?Si`DUE_JSUB;wgU9TDt
zS2abNj0ub2Ak#E_v>K=L166WHAcHYrCb<9^smAL?Lp}1sq$IsLd1IaS-B-<~yDGZp
zcDbtH6}+gfaY^0!UDAYecw2R5vHfZxRZN_BeYZ<|q1fCTx=ra`!5}WpuJ_}-!Np>9
z!7pQ7@Jpu)$_?-YVyHkF??isFX;zYJ-L}w%f|Y2$MCViEVYn$6%LgTJP?G@iV#5hu
zFP~%SW`F3OnHt|Cmb%!#*ykwyCL9QbRta`$>>N&H9Y+fE@8U)K-QFV#!2jBWG6YK%
z$LA}A9UIsb3xq9gYTr0M4+10@^%}$B>>2l-i1ek2)EZu!ulro|Z|q{9=A2VFN_VH1
zH$mPAh%RMDCBht1R^)ruihPf)$OdJET*)@IfyaS}*8~gG$qz6QcLY1rALnsk`=@MP
zwHfwgN*K$i+AS5v1z??mC>GjAjeNo6wzy&P%=ZAVU<cNQf*cgU@~<fC3Ylfx<VHG=
zQ#7K)qsT~ffA5hAuZZG5VL$}hVO1#uKGL}&i9o?-5(L%zN5)M5b7-Xh*}_x!4+u)a
z|4j%B{%?&&*C*&`Q&i>Je2by|V;kJ>e}jLYR10@i1mj)n6Q3a<0WLoWoXq_R?GI8G
zrC~SggjV>4WUVcx9q_4*yBwz|9c4R`hdGn?=tJe^7NlkiEA7T!9>ur9wVCk|r{$Wh
z+uBMu+jtBKbH(b+lI$p>1TYR%L4d@%^+*{=6AYCx3Jlkh(YVN_)v82*MP=j{)Q?P?
zv&*l&a2ljU!IPBI2~!8p`^xdjZo+5MX?Ne!#C>IVt8!LwsP@K>5ADZ?^s!?+XNb48
z@ymPm%X@~)vO{X(L;*rU*LG6Pd|{iBpu8XZ)&$+Y_~X1<tao1y{~d6mnw+@TofJ2K
zX?PS9wzMLAqB$F(6!}xp6B?f#if)g{nB8GwiPB40B9)(=vTs97IpUcrDBGDuvTT6V
zt+L&zH4ae!iM#YmdzVt~-;f2_s+CYM4M&pzIuL9Dl}6(axxxj6@D&(_n-cUkPemOh
z1J-<CIz#D!1e8Qz8xM9-o7l4)QQoIzHsGwy9m3BDcL3fYi5-g%y@#3Mt%z+?L%dZu
z77*|k8ion@?ZE=DfXk6^UY)Cb1opQI(ooM!!BULipic+GJo;yUKiG`BqJeTU&cJ;#
z%HI!z51^T76A$=1`Rx4&-U>fEgWR4bf1fXB>&BQ(8}iV*_Zhr!bTXPa&7Qj6q0@XY
zp{AYa;M;I5j0s@c&y-&C>&J)4XBX!u_=>j+beGHcPX-t&i|9t~LpXkrZw6+DibFIv
zHH2|C5iDLjAf8URFtoTE7UnSAMYEurcky2M9UodtHSRkFNa)=_{?4v`=Q~WTn0DqH
z_WXWyH8L}m7AVXQtsT8%_{sg(FP$Z)>_82orZCq2Hrxz$Z=+`_KOq@An)t;wvgrr~
zf&HXY2%GESIXS~>7<6p5E0q#Z0|BTbHtV=U4J-T4;n0|*xCu=SU|TOj4^<KzDVXNE
z6@myOj2UCg6t-nUclHdz+cs7>>?<Sxy{HA<v1pJ?97e=pXr#X1kF&i{0(k6Yr|*|)
zFt-Z4&2jU=WGR{J0ZI>?<U(WoOvX4Urd-}eHbGH52hIAV1=KeDl|TGcf8}f3$yveY
zpX&?L>H?wZ^xIGTxAk;AtB2M&_n-QsK(toW@KHv!Lj2(U2p8p9!GSpJ7Q#s{xM+*u
zKw)Y!YbO>x%HnNg0>sggAp)i4&`M-{oq8OYbYvgqkeDg4k3_1nc}UuC0)T1``~1(r
z{@w9?B~g$hHAc81U=ziKCJ2I6UANu1VQ`Yes#|dEq6x0yBLBo)7Y`r0|Ja8D2Iu3`
zSzWIN#pfr(Pfvp204e#_%9&Y}fF?QR{I^^-pVoT?Wo#NGLx9+?$T@IXKy@9GgR2GV
za94q4>wcWtgyQ~7uNkC|#xV{jp+0yEKrrpN!UR6ldJ<vHi7-M!QGih8v%C&9C~GDl
zX5nEhiH$x5cy=(FFdFZ}hl0i{FyL;x-FQQ+Ow5UALigCbh&o1jCR%o+mD~gwRfw(`
zShd2S^Uh)7kxa*d@^6)Xc|#(QxbztqJijOGr+groWC9WuK}e~~km{0XizgA}6T^l;
ztPjIV#leyUe2=#c$vjtT`9UXv#;wrz?u@#lbcJw5X#Hl~F!C?bJK2Eo5W2%h7NcQ-
zT$;;&iD#~hs_H1|qN>-;448nsv(a46!y)<*KLSPI<LKRb(xIX<e?lI<Vvyo*Ws1`X
z-|dzE*u&_3LICUXxdhr`5IGy5Dj|Q_!Xyy~f}pWDj%10&6l>ZXAbT2r)hKeAu)V#z
zdk-H95U5Fbp&&XXVA5?R#o+FnZfINk+BK!m8S_W?B6I(TXj5o5W#k7xYt{Ryt^fPb
zy2`Y01w=TW6%sI6_8#e=<rT6@Wgc)PAPfguCFxX?5U)ta!Hp&d`zkzn1*H*(nApjd
z6kbYNGOnSZMaer=Z*EZOD(DFTLlnFVp%8)aX6;_iD(~K`+{>;>gpUoCNIDR)=MyWp
zK{@DI!7?koc0%l2(D)6l6dXFVTMG}hiRgN|7hg~J!0|%1r~bRCYn?I|lcVl}LIW_?
zmK<}MMZlJyF<}z6$y9_LGe_OgaU0Yfi||k)nvJ3E4TZO}e^=@}Kp8MFcdXXIS@LH@
z50$rM>D@`v`^KA-+0oxMQroo0OQ#LNP06@UO#NAPYNBM~3o#F5`lGD&#NE?6YuwU2
zJIJagIXrf=UT1W>rwhcRO?1{7tfVu@%(zYd6r9Eg%fCNaYt|u~j7b2@jM0Img+v$u
z#2HE$^mr$O&;izbJiHsKxOnIf?%G!*1Tpyv7(CoNd&OR-75B`)1EW5;+j+<R#O5h1
zZ3l1p?)V)#0MT2%pk3cv0O_qSb^1G?P{&~U{7#U2Id~S-f>jL;U-dbZQ_#`Mz_zC~
zSKPJ`7Psp1VT#oKI7R9{r$~A0c!$49S*x@Ooq1i=1kMepmKVA<)U)C5!ayDs$<v^t
zcWy<a-l?D(-)AJw%n2B#>-tCuHXX5fkLDW4S3X>AH%ZGZdF<;1GdwKpbF$ihuU7jG
z7EEN<Ctc6Dki-WN2{ym6n7Te;JV3+bVq}bPa&pxIVz-4vj?&o>T!OGDsXYwJgHXTB
zltIG^<k(su9@!zZHjUKW*P_G{ilMuIGO6G~aC`KHl(Qq`d>pR`h6|fg40f8BxypN=
z9oRSR{V>-$accf)U-!H{ibf<>2=FsVE#p;rhNzK<<UEqH(Tjax7A&3NHE_V0qKNbw
zHVf!vjVxdwr|Q)Gt7Jrg)nc_09TaSuW5p83f?*YV=e0X4duH3sit+Fm7nYq2;n>A$
z!bI0b3xNe1PT8=5Xv;Wg@4_T@RdRx0(6KE;-#UJH<>eTxL<^fAe<MyAifhPpuETL2
zp2sia^Z4c7qaSE2sEZo@CudW}3UEry@mRDcWu0Si-GdROo&i1*=DeL(XRvb1RaFB3
zeRwZQS=2(}|F+pHyk+Ad7secqgA$zdM^J;4FGj4z`Wt#HA0Xdg`}2R=P*g5)F5q$$
z^JZ<ppbL2Q)vpT|5VKd0$ad!5NL&bX6Ne@>dF?;-t;|?vRst+y@Z~8flMz>9A2tTm
z0cuI`K|mD0i;3cQj!EOTJ~4p+;pNyHC!nrUgB6%dn!T}16!z;t(i*X;qLox>1{@^)
z$$t}}$cvd{!8xP&Ias#MZ`>xzb{gkI(i?LPf!fueYOI2-iH*UGO(tU;@uI;lKiOcE
z*VsA+g5i(91aUC>BSqC94*O3uo^nZl|H4hU2XFWT?P)96YC7HO=MAY?KU3U|jzPK#
zBDyK)#v+^r?iIqp#E~*b#A1G26w$SR0B8#C--l}Pm{KJWGDlqMo&l`M>WZMV-j!lP
zhZd}@gewHeZ-*)mJnkI@;wa-7wjeqPZh!EyyYQ+7;Y=~sM7IaiG#-;w+f~@?D7Qca
zmHiy(4D(tqN>h<d3gtlZfUUlK00R_6RJ4U6qab{2k6DkAr5yfQL!=y7`@g}ESE?D<
zDYo~MBgVnO5QcqrL{JKQS9?b}fHWL{|MdNEl)t`r7hX8Lca(o|KmTPzfc?g>`WE{8
zMV__3WB&;0$c@728TkQZ(mE2>mk#lztKg+W;=%e7qD&kZg#}&GuU*sd@qusb-W&Az
zzPB#ld#kW9oxgwb1w3$zVVnQLZIt;8mbZ<=;yK&>)Q4XXK}$6=;2b{RBSCu_JrhQC
zL?A<yFW!lL*@it-HK7+ZKp-*{JL@31_m(4qAn1#_qFkVn)TO2Q#Umz@e>CPS^5J$n
z-UM4jt4rfA7UU7Lg&5maQOz)=hTyyE)rj!LO`T7?G#JQlpYD^EF#w}W`1kQ8{QEdu
zJc7Urmw+X+?fE`Iz+{NK>=v&Hqrp4)QwowOpO6hE%I;HvTiw+D3ml=8&Izl=i2*kP
zt0CQ!_&zjBs)E{pJ1VU2YY#q6tFoia?I*_mh~diD*GP}tP2OOCA|rK@7_ffYfelER
z8~qV*RCn1OxMd&2sZ{Zv#WE2zv&V%}_E3QG80HrbfY>k}2wI^eAOp(NU%=)9YuyYk
zM#*or2A9#(Z02AxGlyd_)UdDq=YC2?x)YHk2>Mk3iEikx|Ee3LtUqytvr!Gq{%%NW
zHJPli&br=Rf#CEfsu~IRGA`aPeu1+7g+Cp1zLQlCi#qwyYCND;jS!J))9~&@MINQt
zJXVk3clM%pq>g>=UwQpHdgqN86o#8A>~zo>!L=tEMsq8PaUo=&Q1t4Ppb7OE_DLoZ
zd7rR{M>h9p2>@`2y2c4^X2)4=8+eG`4*z5%E=N6XNc0#lxQ0}aVt!Jct({s@CQ6iY
zDih#%lpRs*l>T#YHXOen6c)`2E``f_J)0tAA3@8TH8PMy;!XmQhTBmI7r<>Q9zX%o
z+GTBVmGKA4)JEJ;fJNR%Tx2z(v{=uGC!qzBsIl5|rBmf1+UTmB*USyNOV6u*<_D`u
zDrwpl^bev{dket_iVwlJPQfMKD&q2-$A@NLU+WEC;iBLACLK>YFVW8{Ckmkhn%L%p
zj9s?;C07+Di>oQ`r1i_(%1_>rHl$fB?(GnQ>^ML?T`}fZjw$d0QR<DLi;`mGbo6Ae
zDil9>f`<mv%S`!1GwR%(HH?#6Tro0!wV?BaWPSqJiLTGAJ5o;d1j;nc;oWdvESKd%
z!7xoR8aksRMr&)&V_X~%Gr%6pbRG&zrmXG}mt>+NPlZ%d3#y<qWP{Ae13~^Mvj=9!
z=+rD=5K4q{m5Hl}0y%WiLkk)A2(f)bt72#ZtBq_7J~_-kMZF}7^t8GP1|?IxT%p04
z62km`cqCsX`sKjsavC;|aU;?}?=VG`F_P~eV#)UpM)LjIXT&6&1jaIx$f2<Y8vR*P
z-Bt2Dp^RTZNT=5jD?Ke&ED2z@D_8X4&sZ@pkYmiPhp6>X5~)c|B9*?G8b2B_{6x|j
zit&dp!jH6_FoC~Qi{%%}aO_B<Z^D=|lkgCP$ZMsqd@$sK)6=U|4!*`QG_if)H1~OD
z+gjOSB<;8upNuEt4;Ybe;x<M`R*&0QDQ@ZLT1$p_ND}LmZtxnd4N&Ugax3r9=^?QI
zlhT6@ON|1n-)CGtv5ATphO&Z(AnjoTx!zuAOSD!Esvl13UcYY2MRcf`ps5g`6$Avn
zSo?Rgsib0@h3Ri=Do?*K75t#tpjbd+79<r|y%>Q8Fvb>K2LhEX0tZF0lZ4ShfaS>C
z;N|tIWE=>M9bYKK0dI?SaD1)d9MYWLgpIHj+Cqzi=z~BoEf>p#$JmGnKPVO#|3SA}
zlgN5MXhHypmT<kt`MM-ttjesD-W=!<WZCi@cWD6C!|d)+Y*-JoTHml)Jj!+TXChUT
zi47BKHM8Y6qErTYNnOkK6Q3P1%1lm`?TIUWOd+&hVO4A<CEH^JEi#kHi(S$;1vQOx
ztl?02(+Ug{^v<Y1pI|_9#IFL)?kEE)!}wGv!tO3p3Y7)H^S$GKHYN~)dDmEt6Q@4U
zM91@GtQgqN&fU{?G<!;N4*(Qp0mx5ej!0+)4eC>%;E9S)JmR2UkD&>qPt7r8d5SXg
zy0%Wu&y(y}hDkEkPzqUrm9W5!{fT;8vI<Q$of`bM<O}la+dAHsA?PTKnhSdC&lU_d
ze{yGduX-q&rzEdPY#9`z{KR0z=`Uya%Lvl4Qa?ku6|d*P=x}teD-FP<P^N5O^Mc@@
zDBxO29pIx3?{m#DsdvaDoXeBP&!1Zd#}AKRKK}0M@za;DY%<*G;9i)_SUkMv=J(J?
zlMUS8Ukp1hd|`hc<@bj@Kd&Hf>)@{c`2c>Fm^b|04uF3@v|~K$A0zIAM4ROUI1g?K
zhx%Q5=%YN}{+*lCDF6L%(|7mt{P*&Sd)ZE<cz7S@8Gmw^=l24=;iZ8pQg4fogYQGw
z-L>Azvr~<^T|qQcX@f`%Bg&-qfjeQ~8Y~Hnxvzg8h}|hpEnz^OnHgMLkVC*`#2}og
z+GWB;s9F&mO{lz3hSk4E-X!QNkK-e8+MtRx!J16Kdi{kY0QxhPB{_J%-C1jRa7rkT
z*eILAH_F3l%jXW-1PqfvyLRd;Kplx9f4<y%^k)xr@^am+dYp0LHOHu<O1H);i5g5?
zb_hbJ&Ol}_Y$CO%PxKl9XcL*pT8!AYNIZzeQ9u%R60*gkB$L*SrYb39hi{n1uxNIQ
z(ep(RGDdX$2C=&E4`fz{l?=p79lyzMgN+@>7J9Lv_4o06ci!LO@Hmnqg#G0ZIJIa8
z?}uUIL0mA6`2A<<l}-%_Y(2IhQ;aLeO~miIf%!MPW08>@c97gQkNhAD-%h=2=9v>5
zCa=GfIffy8OYII3nGd;cxg{ik5tPzreyTytAZ$TY2j!$BK|pYbNHT@WXh`W-WgFt2
zGtzI^2x>eU$07hmLO;GP5+PHI3{NKwJAyG_MDOU9Yf6Ls9kxg;7AhJp7>_&Qe`Tz^
z^%BXH0R&ln=uzdEIU9)kuyt7lvx$VD8RE8wHZ0GSrCt|oVYEcoJN1Q$F7b47C~^qM
z&F;2#v>1n_K&>4;iCkF7T1BoNUVV0;w$%5ZUG>2oVx%yj<Vor~s2Z%52f@kZqN{Fq
zD>_R3VS2&Qmo$~56QM9#by$MO7YWZ88(e)T^Sn8iyhBv*<D^`3*+dbAzuSBC6w(dy
zZ=pIRdh~*;Moxj;I1s{jQcj_m7GigygfEv4*;+8kh;Mp~cOuc43--c@MAxy^AJzL{
zv@ET13{7%1-&lm2t&6uy3?_J_g%s(5DJ?uCBN1A33Wk)<>k0UJ^6467CP{RxW`&ey
zP*NXdUKk@`$?=XSqK3keZwtrGoFcHQ9nXY##(7yVfnZdy)3lJ8QVA9wz#NiQ&U{Qd
z4PjccM@Op|N^pw*5^B-$a)IL}EVPWT$ZFspW+lu44-go^(bvN9hW8~`EDX0rxi;u2
zSoe6%16HEs7sb;2e(%wDTI(qyJ&H)>93?XF`CuOrH0e_|1fnUe`vVhhx8yj<royYx
z&{;z4NxjnKWQil8`0q95o=?gZ7(Vl6Sx&0L=H`#%Tv|bhDB#^z*@AQfcswSv9|4UE
zo-!cPmn~8Zc690_QeQtE3;;UIIH~`VELa#9&t(TR)vG<%lxwLv%g!dk=yAHnL~sMF
zS(3#?h`ZwC*|%@qml|2n9TOF)aBDk7e;+r`9!zWV1XY=e#Szb(O5qlwgTItM&GTJ(
z#c8zK5#4eZrIdizP&$r<6MC>($yh4WNOH8dJ)l5)!Nv`qshy`bABHYPMl45GJf$W%
zCn1x6tTF1EoAb5V1;it$YThZ#uHTsI?1uEyN6~gKW!pOgpaZ#~_a@PMlkPq9z5mt6
zYnW*Lpl1?r31<NLzoQzhf*9nQ2Swh8M?NS)m=)hRkAHZ^IKYLbydV2a_S3baElp=f
z?gBQ|i)u=VM#7!4K`{ee`^*^rQVH>}u6i9;E7QUd;P(Xjz++_5T<H_z7x$~O<d?$m
z8j2f8et?J9wJ#}aSffN9N=|lOwi6$b;Xmf9u5q{XC9+Kd7eJQ9IqWg~3)u%L+uS7E
zkHRdAQJ6S}Pbl1f>SSvO1G2+F%dRO<T?G8%M1A_q>ty*sgLhi{iMv<D6b(U-7%d%$
zU54$Vz``jQD1s@!b?in^<ypq&GJcWYNshXYC<uG7j2%*^gv+|Y6AAciTq;fG*FilY
zAygKQ19@yy8&nNH5A~rqih+>)LCCX)S+LI-i&Q!4u#8wIAY|gN>Y%u>nJ5^JUDr^I
zN#tDl5!3sokWAxl5mag5z6fUpVgXq$V92MsX|@eb7sUBt!XSve9E}MLBVq?$)lR8e
z0T2lLLf*a=SIALz8r+zz>C*RxjGwtX=XNG9KQ^`q3~-VJD$H7I%asAZ#6tC$wI${}
zsv~&<9l^GcUgqnN2cF2z_8gxR48E;<p^31ZBt4rs4!Ocqqa%)#aa>Nto(jS{R}=-U
z;p=7uc>56^&m81hEId}8y0b!XJ5Yj*qIN3BBzbfYqUnu)><Qr&GKDi8hYjzTRdMMq
zG`U^qFLSSqqAN+N(8ve!ckl@?J%WAVrH+$v4K(I`NyL2?Rl~zNSF5VLC}T+gbz+Kw
zCcf#Egi<dg<M6RMt{(P*`)2qWk9HWZQDH3;2o*fR9qWK9(c%p3{f~`-8uQaHBVrde
z_|T&(p?HFJ3i5H8*{JKUT3pocBt69lQy%rxw;)hCVo&z>pKtH9sAk!qYAL|x%0jpK
z{7Fh!_Jsx9FL)p^wgqW7f*A`Agpcl#YePjOcf8I)+f~w_97$CKgdtAO>zZ_Oemx_p
zI7sBf?!EytY5+~5wpEt3Ssdmd23-if+_(oVSm5tSGTDbshhPZfv<*C%X+Efz2P5~z
zp%MezMx=zGr<>)05Mf@gf*%f*IunMHue@+(q<b>u#d;O(h3hH*48~+4tdmo5+fKz{
z{WON5xu=GwhqiJROk-sKJhUaL>H{j)c9`Sxf^oH*{m;tNe|TFfFIJ7?J|v^;ozL#%
zB94(x0fC&50d~iYTMe}cS%OB~)(Jud;g@zmu-Kx>J;&zYbI7Z*+iG@|uOw3|#7z@L
zhlR!A1Pn*fri3=|s0P!wUr4ayxnFzJiB4-#YkS3oJKsPu4}ic6z=BYX*ECEx7k#Bt
zY#-iy-D9LPWi5bBH0zTNo7hjWiLZn%jhi1np_|{l8Fk<;w@wG2-ew0*0qJz``K`{N
z?sC#kKA?k<&jQkCoIhCu_9TJ))d!!~hr>^6pHUj0nf?(k>&woFdjTCka0=0-;kwq2
z)F{d7B|sRe7MfjSKI_HY%qNLG8HspZ#^~Dcj4@`3AvX-TpXYi8P^XvO?bpQU_Inwf
z8%LMXSyNNU*T%jJ_uetpEd}&oa}mlia|<a}Xs@Q>`0ZOaikou3WKSXQ`<Lf>j1Lo^
z5e)##2Z265+)iHfe(%-mmUsa24BoYXaJffH5+Sh#Kd@*%%)<qi&ky@PKa4&PH&m`;
zCr6COFf`l~PnRi>AWNp#ykB{Nw_UN@FU((u9%cYHK*+!4qC*V7*_pMtuM?~Vpu=cq
z!W~QQi~G^Fg73;dsqG=NklmNK7cw)ZJNZq$%%gvTPRNYX?PC{)GPC{te}JL9+MzZB
zy9SKn?p@>&o>J$^EC10UNJXv;C^D_Mfo(C;-1>Dkucl@M52EmniohZkM^WC<LIMDG
zWHuz*BFV+1)MgZaptzM94v1b?AX!z2@rh|%6gzF)PPa#WGxP1&-~3r|toHvtG>jAP
zcqTZ&M>6|QBtM@YL_~iODtP|I!|27s_(eAiZ0;exY`ccXNZzTTbbajzA*&u34<aql
zMm?dQ<v%uEQ=3)@PMvqUqcy%O0uiEK^sZ1v_k4kjwZzqcONqJ(*%BhScKgBlk|dZJ
z$YFdr(G3V$Q02vwda!MLof$F;?=!d3c9CN4w&@-VIjCKvZFdysvi{!?7d0&C$>1+g
zHoAaCJn<={@g3KdcL1Ae_gikGbd!`}&~T6xPx_@3M9@O{1bI9=Wj#+yUw)BL)$MoV
z?c41aW0)Y?VtL-%dyh!eOGC4NWqF8ct%Kv6qP7Ufw@YbdlG2jbSC2sTtC8Bn|0-I0
z_>qaNyk%m$9(DJ0shtADf_@L7frH?~xZ`Wkc|hscCHw7Mwu?TkS>Ge^0AZo?31_9i
zNibIq#dUbwG_d3m_#xMGG6pNsNWnds5oNu6Uyfrh=SR0OAIanMQr*bnieM)Y$Sbek
zl~-@HonCPZ-<31U82s+b$gFZ6A6k5KgPy|ikB-vVOOt3CTf2ZuQOh(lO<jb$A8IMo
zwNq4Z^3ln7*ljG50z;y_S<|=1y8VKl(_+fj^spRv!p%ZzZhNea1y(8k^c)Go3>?I*
z6-2|7MQi-O;BaoQr*kjL%YMT2^<ZP-%pc|)yStG{n_eOv(f9vVv|3y?!OJon4Y1vX
zh-K|I(eZUU+KIfkclzs7xTWk7%`YU@jYNJPP*k3WpWYIkW8^2%xDCYdA%2Ab{Ptw(
z@qY*<!{3yh7q1okvJ*pqp9h%V7pYoUN;^ptDa#M`=Lo}owOQ6UPmKOovGbY2<`7#O
zp>_OW@6l7AmmNpfepNyYz6scb2rgDR>r)O&le#nN%nd@_GEU**Fg6O?>ck(F^O2AU
z1;k+(l^>Yk_CP*}8H~*-moz(qt@c58nFiv?$b;ZJvcZ^ke4q?g10uvuLa@cJB(l(^
zvkQU@yhgvnx8v+biT8sQVONk3a@nEfEN(e!1mv*AKBNEGAfYB3NYhZUD2RcX)y4F*
z@*$b>_lB?;c!gzq^O3-N`502jC+U1>Ke6%l*@rCci^QCF+^Z~T(6*q(umZA*s5J}&
z#o!gfnFs5gYi*o8Yc-ZCLX&iTu2&Rh$tewU&N9+o6y><BGas_J)5uy&vXu1$=ZJH!
z%HW)HEIbz|u$kUsMz)JahDmPSovB3+)#Zlhpe_1F5h0*Fyg;biv?rVP5v6Y2^M!=(
zaT#G7%4P={FGmrdmUs-=hm3(Xd6$JF))ycDEDQ(^*X>#a**yb-AGs=<dUjD}gk6Ah
zMPiGxAt?^4igJECX~=Qm^WilKD9NU_OgvF`EaDDfa3o{NW~=pL;n{`Fh3SN-pSlK3
zbUOTLxRlS<0N3-b{pVr-S#SSmVgF}|{*P;@s!}Z>R5G~&L|<ZO9{7rIG0BZ2n4C`X
zP;vjVZZv$5kaKW1lo}51?mhYw2T(tu0P0H1uZZvv1U(n)wgxP@iQ|^@8qCqf!hJ1;
ziXc?faZ!e?gJF@^q=s^2?(Icc;m8Sx&aGrUA@0qs5qVweA}nfo7m_ToZb<8qimcTf
zF!kyM)arm7CkO+FantA;X<kQ<S=4Sbd3zaNFp4FYD&`cO0ATqLO5*+v=nni2M%iOk
zIv`IT5JL`X0Kbe=&~MCO=`>UIaZZ33QV=Z<SyDndu(w%Lgg)Ffek*hj9%S8eh=y#m
zGGZz(AOcgw98`Cz;V<wC6{~mqj@9iqmu0#1ON0!RAQ3NXNkYIBGY%SuI7nXD{fW|8
zKDnA;jV3g(`nBKJhVv!lB668OK-B1c(Q%`tq-j)~&CZ3WuyRDXn!p^~#xCoM7;nB_
zREQ8<^QL(4n1j1_nTBx%IHA`699&yHqYmTkVXHZ+U*5VbU|ASCQ*q*{-U6<SBi~{L
z1j30;0N53^fgmi!*%?L|Loo@?H)-Y|GOQ>*TV@mY58?k{dV_&bF(b&`3<mJnPx?^T
z1Xn9H7jb#EHBt)^Z-vQ(a9pPKn(C8mn6beV40qHoC$eNL#0n7wOUPyv!BWSgzq@J4
zxo1WL_tDmM#V~ijuK5XaDn}`J9155Z3=t|;0BR28EZBnrW8bhB-TvCT&YKzL-%J^#
zOX|IbFH%Y?U~e?%w0OL5$NsV&!CsB}H_I_R#DmytFRMwpM^lk?OsrPl?cHeQ$n>2I
ziMeMJo2Gj<u?mKp+>@-MW$-xpRLR%j)2I~`)c?ZTXHyyhO43;=xrn(@7A}WMv4e7a
zHU_>}6PP++1H*}^T8>Odkj#U-acOOMqIc-NzeDryY!+ewnE9h7wfS4xC*L~BCBaop
z7(Sjfl{a_6I6uaPu}#1o#5q@}s}q>@0`b^ZqEvjN50D}*aY2!>Q*v#KsoHlsDOiG3
z<ALQsd|f*xY%VIFDh(;|sC89%Z!O9eE0@CNfO(*3FiUMwPBimOWdS!JCof$tm~fRd
zi%6rZ#A<}iXnpGml22NYzQ@;en`vH|yBp`_6vTBB9a_)+gWFKx(NJt!Qz`X1rLi*V
z+Nprs`voJv3T6tRVCWqs9n4xyAJU8|oo2<^sL)SO<iy!TjBsoCBsL)j#xZ(h3@f!E
zaNs;@DPhLqyu$#G4oBW67cj`8C%}N_y;_VpBv{26tCo}8#f5NBc~8ke083oV=_0Nh
zlP;)>ro7ao%1~B^jw4J)l>F+2HH7)7;*Ls)P-&H<BBRlOShwH57LbLYVW4n{QDTf}
zcba<FE2v@NSkhsKNgeJz`U{|SAKT=6;Yg2h5ijBQD3P8`7zEB)s%QvRW#tPG2+Dlp
zaUMR$T);CY$$RZEd2U##ai<@0jVjKSSYXDG#T@l%sz3<Q7!2rDrxTKTL~zH%m9RE8
zkDOCu1%3dZK`#1;{*xpJ#9V=JF_^H)-qg2=X*SV87br$-F9Xp6veF4eF8Lz$7IlJQ
zYNjW5q|DHId(QAX{Y09E0wW8!#JRRJ>u4>fNorLW1{KhwL#Ol-O87akx59)%!ib;x
zh;EJz1UiQyE<k8CMHnm1E}bcPWWu56?q9;AwP;iqc)-VKq&~4(q>N%K_persq<feX
zN8d@_D9uk$2y`+^cG!8UV+G5-6IR{e7I~L?+GJA1O9F0OP+_!ST97VGLIdXtMrrmc
zy2EnyE>5Rr%OxTDhxuD!7O?J9)nq<%8BAykj^AT$q(+BWWIBLyuPdk2LojE;*Z`oR
z^@{R^`7HpO3B?tl!s4W+>{ikhNV}Cn6;!5<8<5o4RS8L%Uca4|OLrepHY*yK5C@Zy
zV8+>xiy2kLCX1<S#B`K5SMI8xJ5F%UIQ&^*dPL6EtQ+WnYMpvCCAWSC@`a^m_w^N0
zY|?fnmGgWDEYy&Du<l6G{Mwkl^s;pLJg`tbgM!ZW%mDEQWvK*_0EuD_peWv2CQ6vJ
zPEdl>rR~Uk0_!6%ORNX#+&~o)_#H_Tfk{>nB&htKT~|~Z0{4WF_>Lg!Uehi~kPn7u
z_n2`<;MRcSL{~l)!suC1(9h<H6{Y9a`;sjo41lT|B}#J_LUp!;*9Y$-*R9aG;`}2D
zbfjuA0kNEi@K(FA<LqgK>I*aCdiEc>JOs*3?E!Vw(I!PBv2t@XH#XxT+5&30gjWcr
zjdC?dU8NC>v@2h<$J8j%77^e{K8lVlaO}%Ehr;p?z%)6ha)Xxw(i@%$reDA_(W4Go
z_jCDclovWB77nQh66EU~p<kgm@!gO_L>XCt(zI|wWJ@wEx|<c}Mo1W|wtw&@$ua!n
z$s>qY#=67Va<*<fa7|o;Zo?)%Tj0Qu&m#KNEe}y^*UJz?_^s5A6G8O57JSe6W_LjN
zIAElVDjxTtC)1!{+}`YsemcrPreuoYTSaQPFbW_$ae{&@7U7Pe7CWq-gx0X8l3Gy^
zW<&qt+nPxtXl1CxD%8N2-))csiV8cC?RI9i^Ohfrj)sl`xJhVWJ~lzWCQz6f0OC*%
z40wzR&S<OV;-l_;>=9&cj}f!w;@@%Tyix>KcSXRw*+=2`>S#bT(A&A@`kJ|170YfT
z@H7RL#l|odM$A?bwWCc3$kZ=Z$mU3Orwd5smH;D+?+LChz|_&iV$<WrRr0b8U>347
zh%@K_?%&QHeb|cX<T++7aX;LGSfzyx6?nsK0fHW#)J}d?t`DCKRgAxdjz4U1R3x?V
zi*V6j@pvmhj;xo(S<%Y2v$<)NM$gZB(DR|sKG^)a&IjIHN3g$p?kNOv$3P(w+ZY^v
zDzB)SkN$T83Fz@@9rzf8VssKjxpTLZdLIz8p=-eMw{MU|as^1Pbv-CPJJ|gFD)sRw
zZ-QabB#O^YTz~sp1_U1u69Itk+dVh=Jza+2C0-704eq?XQ67`jU{a5uH1ok-Nmtn6
z{k_%Rb>8MO&^P-es*i%V*&1YAtoq?dbh@4h@Qu=(YjL@b?9RNLTE<yx3e<#;9n=s&
z3BmotX>s`%VH>OTTL;|s{vX2E1>pOt=QBnZS2~s#B>9h_3;7mD_r5M$SU&CG(LHP7
zxVQHRgn`FU`GnkP`43#Z?-{t0Pm4*(R*wV0cqi1SQi=@`SXC1_i6k&>l#7%`?z<8-
z;ci%>WE2Y{u?W26$eGXA3oIy;NdOYX9$;s_A@qmMh$msFD8_-+RP(4|fGt7kX0%_o
zUg)fxm40O~kkIvUZv2Ad^Mr)(6r@+YE)Ad-Xk{iYc!Ye@Eha(dbH6b1d2t11dN<RH
zYD(cu5D79_)pC>5EYSmn&oTbXVg^<#bFXr(L9CFg=#=8`4pn-%<h5E2=!qOwgkaf2
zg)8S`?*{AlDnGBLQ#WDY=KCd9fo}}Y2h$U5AMY|jkW_5%#xBA=;~o%turnbTyStdH
zDJ&dblkO663$vJ9nWB<cvC|h(?btL3+7bdNbLeFzr6H-lrm6ZR3q>0c(?a#OSXMYn
zLlgdCaQTA%fb=BqxpAK={fx!pcrWzP-UA0M9LQHtt}|h7WGHSdK~$}<Fi=CUQq?t-
z!bFfk{{x%1pD^m7RMV*h4iD>sT2mu#5MjIyJm%SmUFZ^y!+>?xB&B7^D9--L$V&u9
zcRMRvF`;4Kre=~gaZ(j+g22W1=peht{8xRNb-0MeEH!OKm6I^m<k(M?OL>99CwA{5
zkYbtrL`@rXL0>#H4)k2En{!r?q&6n`;8dUtgrpQ+_>*shW0+tBeHh|~)53p4M?#`~
zM;V?xLhrR8kDlZ3X`{Q4-3^nL*9Yo!LL3W-_v#&PA>cBo$c9p&r6even<)-1qmp6<
z3lisp?6Ff58%lh@$B}^>D}0<Z^=#d;Q;&v3AGtjk_(+_Vmi_=NPmYw%ijA$-r>9NH
zg$Yf-4Tk_NwE`V<H_pDppdSWWwbm>i58$9;twS!I!j49%e+6UU(b=JR_RAkwfc|s!
zR}u+d0xCOD6WAJgpwu}wF$8kVOiyMwQJ1!Y){*^W|3FL+z3=yokc_d^N(%ri3YCk?
zvY#GEF!wP)XE((aA6Q;BsZWU9p4{UVB6VX?HZBS+ORH!WxGZiQX0(-fx*+wpJc1<A
z0roJYzuntXQGA@`-u-hg^hMtTM>I0x{8jbOGUCQ6Y+~3Qln~UoXpNDf<Pb2QanvM4
zK`ffJ`1kxp76N&q!@92lacv>~I*txNd{1Y91cr9vzedpb9<C(dHH7pF4OnL5pIV@7
z2;W{Y>?`#NA!QqxKUf!Vu3AY^&;^5Q_4$vF-+uS(#jE4TPyUyT!#=YrX~+*aGDrl+
zan}2B1lMtRca%vi<+`Dw;;`7v7{ef73h3oIFP$_j^${_i2Lt!dv36v=q%(^c$P#=I
zo?b;O_AJ^6t`ij13cLoZNoj0<rXEY?1!XfPFJ$Y->!onGdGWrQujgjpe5`YW;pGIS
zeq-twXRp>6SIEQm5iiKnabDzir8k&Nk<Xrb$3&@^ql?6ce2Zj#a4U4cDK-0U{@Y@{
zJi`A84?iS%1JBBT{yF^YEdI<l_mCwHSZJ$l`V!=K5kyXEc*Nr#TLu#<Uy$AKLsPD&
z_5L$in}EsuNVHaq;~NMR?5e0u1fc%ZYeS;4?uCXF8d!42rI5cYsbjk-B8w^ScJlwc
z^a7!guuLpClpOJSENFzJW;iS@kPyb%4?({{>WE<VY7&plI*5wdc79ovXO5k&t~~TF
zmmT65j#yml<lB7V^KHHeWUS-lc=7>>f}OmUnG-LD03je+l~ZJO&Tvb{{O?cCzyIp-
z^H<MaeEsx)TOMeickK6xd^O4ch-az_Ubb~8Phb4`*~{-=bcSM|Cv@Or-8<B_6QLdP
zDuoqXf(*(oK7Fv;5~UMX773|GyDj35M^KL`C`}FFzGaIcCWGgrJYIOn<6glc4Ua-g
z3LNJz!sF~H=t=&B%O<7dg)S9Vn!biNCKy#~f3AFj9v(y{XU3NYvR^kosgTq{If|w_
zGvcW?`gz2l<&<dl0*1_m=Q}ugT7sI!%SnH!>PPN6obW(`B1q<WN~iG^k&?^BC67VR
z(i0AI!a#7i;#*%QA!KqAUcBtGAhr`458z}~XS%mAZ0?Lu6wGw&^Ug6Pxi?(`AuQz#
zXH!(2bmM~q!5pD<=LYKOvKvNG&U-%fDuT9=5&tsE1C*#hV&o(MjO9eNAI_3xryz<<
z)++=X^BfgeKiZ0HBZv3D9F8)z!-hBHfLvC1YYh|k<^Ax0-QRoklG%JJ@r#UTVjx-R
zn|QTR6?TyWIo%b5X(>U|*Ru=rGBM!<WR*+zvWmGZn6;R}g$s`_v9Uqp%=ij0q-ptY
z*5SV|pZ@9DtK*k{?J(frhk(i+`|(O8GK|f~F>|Q3IORAL4;Q_aXgn+tHo?^Nnqdkl
zkkI4Fv7;A$fn@?Up8{aLZ4cSiMO{rX=CZ=l%x*QVmZC(P_&*F2#JJLAxFd?zG8b5%
z41pbI)!BI)#mNJO7SriUBQ<#?IOwWccsbqP=Ag4dVvUWL6mszr39|wp96T@KYO9*L
z<35sn=HDyU@2gn_W9G4|B(ma6A|L%I^yX7_m+RFM03rkO|1u>1FXNhcn3@uuglC)v
z25YV+L$p_ERm;WM-{+zNd#iLS0H5sa8)t*R25Bio8tyeTK%;4yj7z5){Q2aw&yF&<
z2{su&hrU1!_!mgi!9IPaMJK&SLvS#PPX3^Zzw#%p_X^^v=JLuAZdK$4g_EE4lA~Wu
z-69FXD<}i*@9X(;%(3PsbSVOdptaR3UcacIFgJ)Ay(%Xt!(fDjb)P~HYHmcMoqHAS
zD`>S0KMXWSuQM8}9)^OQuc$H-_Am-6$>h^@DP=U0E6bT#^#l!}g_^_B(O}B0P0<IV
z6@oB4MEe%P5lW=0@|{~;M89yr{mEHD;Xr*5$)S2^eit5^-|ap6CU6fOgIg#%G~bpO
z(@gc{i=Zrw0M0de46qLCUM-xMzdSEaO3c*FF`<KP?K)p9ourEg>5vquTRA26k4~|K
zvYk#ic(_+At7`Aj>-~C^f3~Em&7}9f`QzvC-XmK+g!4Tp5DAx})~mguY|gnc)JCP?
zmSC{Z8L@75e6A%tf`*sZX_(C5vFT&**y^l&FLq7l9A@Z7x1<c}#vA7y<9IBA@*F(~
z6`{DM=+9b@R1ykH8!<)$%Lg?!KFp%hyS0?{)>gb>m%I|_HfBw>YS(x|;6RfBa8;kt
znStD6iKYJ!iKVxR=9i_oYu_#0O75^tpVKnItvjphcQg<{vuMNh$v80(?e*YTq=Dxs
zvlomH;`fBI?SKqd(RQ0^$0b<vd^IpLvN_ss{i%PD-3f~X+(~T&3HJD%;rmDO?R?X>
zzDHph8Lk7fHdxYfL3Qwu$7!qOZmrTq{Eq5Eo@&TToEWj&&~iKqc&D?sZ}kXro&uHP
zF)(4v*zkd2Y?Szf>MHOcC%xt<V||(rKGpY!`G6j-om!M{`iEXywyQ1gftB!Wo7eE~
z-CkY5zlTRQhYpGBYN@4UXjAsh#pA0*7~lYOKa;8^msD+vOJgBLmh|&NOE?xN!k97|
zT$`&b%!-oai*&+natU~(d;;$V#H=y=W<51JS6(lRf2=v)5!h5B;1ITDQC{LS?AFRN
zv%5#!huaX}i8jvslj_wIzBjK&IsKd`hX0KTc+wW`nYIQEXsK991J_pNn?>gvbkD}G
zk2}NlrAS}=`24v(JSAT(W(0~a#*Pa<`)9eTIrz9c2zh~vfGHK==5uUQr{ANjw=>vs
zY%lX_53HJ5U|MzD%M&Sg;wQRsq}qBkS`F)sN18<|L^2e5Wh;(FT$PT_AOm-YezC3o
zRVMSOAC?wuLl=N4cR#mhrN8H%-o)CQ>QZWSn$E(LNeC#2%_>&rum#2wC@Q*+7M9u>
zPu31nM9^;~2Z0K@l^!(2OSo;4(F9;if;Jm#cwvaBJLS()NB?>1?1$j`@GBHUM*ci|
zi^DNo-7xO!@aApoI{!(&$F7F!>5=>=Ht+uW{8QXiT!l|RH>uSFYy#j9@0xaUJXQlY
z(BV-B2N6zyKK&&Pe8{gdbqsLEe79u$T~vP%jWkR-nF001fk2mH@Io<sQRft}#2#cP
zkOlOJU(g~C%{fY;0n>3A*jJs(_~O+w(hi=e`x7%+B^t>q_z8KSXq}K>1rh;2ie&;s
zTTH1Acb)2RmsE%SP<23Z3j#`V(?LFfKVAWq=AXJ12w%ikPQ&~Cm5=117QA%7m@4zb
z8wj#t7ixidcIu@h$@Hk#Eh&pmBupyYwn{hI_rgwt65E_2!W&h-uiC-W|NZRv?Kh8~
zJ^%6LQ*Q!A3p)HRQSumfSom;Abf>T438GB|&m@}FpaCfFN=(X!-LpJCt;syEmW9Bx
zlxo_0GJ=dCj=e|(t@M)=;-Oj>uKRmuVj3)*NYvz?<xsKkvjyvDL|tWqx^PLPmzbg;
zMFiX9|K!#}qI$v`9OsoDQ$nq^nRm)+`|w_%pn6iz9%QFf05cHQV`PM6s0}(z7JQ}0
z;bETA!F7P2L&P6t6Oj!dtce|kUYcI<2L>?VK!hlvbBA42K@OJJu&vO5Z>9l5gRYWO
zr-)M{46{E~XU*;mn7h-{Z3aC>fhp)&*KacpE9j`!uj?2`JayY*&cbO-Iy)`Z>ROxr
zeciAy#|y*1>cQtIj^wW>)pmkZetdrX^67C9qe73uv}BH}<cvm$V}PBah$tGME>?ny
zNDcyve8VPr5rs5}kex86;C&013PTjGy}%LOW&=;I0`3$N>(GbK_?%D$e#Qtg{~;S3
zQXC7Tg?&1S#<+AsM#D^#_42Y<O`B}MKD3lkJ7BP$EpR3ZmZ5I6j&%@fj)mQEd7=sc
zxT|;t)p5E?0eK&TJ=flzJM824qx|3t8!7TFr^R82D+>n?uIYr{JKY-|fi#xpVj`M}
zdzG9j&=d~KecJPnYw^G`Cfm@K5w+B;YeBGMVL<5EibiA`+CRYT4L>6HJzD0NW`Ih@
z@AJVSI-<{pK|_Stfz2GI=H%L<SModUoro)S)`*=z(3;z?-W9@D@2#fkHG=hr7Vf!5
zxDEF@o`yT8cgRU~FXE*KGFRJBvw5+LaK#XLiy|BD6nCJZRA3SwCKQiPU`-tT?YS?&
z9WdQ{kg@r&Tu_LwumdNrQb;BKs>TCw;Z$d9sU(A<HvytxPM6#9v$~!t!Z6*!;LDhl
zo5YiyBc2nMFpwh145l9pL!l!wNP#g5G`=`++&e6Y2Sy1eoG9RKX9@8HZ*uI^*dmHZ
zY?ai7gSRe=D+v1ps53+^BP=)1uhF{nAki1NimD5?oSR$;M&$&a4!_WC95MKOuw5Q;
z{PR^kO5DAKVK6cQ3Q(S;UJksLWd;9~?7?GCpzj`c$2CAp$<>epBq(a>fWz?{x@-af
z5P7G6fCz3YHB2;70#lW`3;lPrHj<a31#GnN@*Hhi+}_(WR*yO|3_11594!%`=7>^J
zcoGVTS`aMi#1m=;as2L<RI4h(*oU~msR{c$cv80(HbXr_M}-bDmE;*wf0tql4aMSl
z1Kd2<f+}LE)2tFC1v%{swIGOnS<fG&EGQM?KGzW&@CFLhJluU9P{t8+)fBmUqX&HQ
zg5GewyEg6~*;Xt43s}scaxWYl<rT+}F5G{9_E}&l0VB%)ghs1|YaxS@Gz{KJ-ssf=
zVHqZ#^!Kc_g}$Mx4$timzxe-z34BJYpp}@h_pW_L2H@XvAAi0GuA_k9!xig%YHnJ*
z$k5x^`IHanVd`2Ac1n(beELfmrI*r(cMome+0-&mD8oP$Vaq9v7!%{ed+MnTo5%1G
z3c1w)dbVn~4>gDbjM=OO%<8tu!<gG=KGUC4MgyaB6x!dia8Dur$2OUt&9Ke6qs4cP
zRhEMk84P@ac-bq*p%KB>hm)~mL82XJ<*B<h7Zfr&-Dt>|)lJ|~!3Vcx7xR`2Xmyhm
z@pb8rVojKNik8jGeO6s?U<;aivw_4jkR)cYR1)xr2K985^Tn4@246`?dHM9pEr<s+
z_hCwu;nunh`yOyvfm6=%<*aBC3Z0^_z)6X<&P!5_S!Xl*JIYSVNrB;6GY^Hz0HaVw
z0&Ntl66jDW>vU8oz!1Y>py>}UF^DS~q5W%Lf|U7fCre1kPmxaxH!Xy-FY?Rs#LZ)c
zP-SzB{E}gF_v|QyFPj>a=!P8M;)ft;^--pAX+Y+<7w&pMvfM~*R8iZK8$Q{Y-rVi_
z*}*QBGHf<!D~l{+S}UBTN48xE3y?_Iw25$(VZaB-FcduM*6^Zij1*zMG+=?!Jc$Wa
z!}(Vu`ym^eAn$LcvDY>$Fia%#P&^DV0XZ{6<GouLJIviwPvv|G&R)C`$7W%~SU?2;
zFuYC#5%>&~eH>9aDaMHk=;McM;0`SDeV+<|e`s)WFR?5;_POP??5x0?26ul3D{CKv
z(%WR2vaN>JdaC*)-lLR()kHD*^e}RpxIYcnu(!nnAftGI?Mn=6hN=-dGy&hlB!{XZ
z0!mX9!)by(BX4^OeJhJ>qT5$J5VNW1l47kO=ZFH<;|AmQ7?sHz<^|j@ZRI-3G;;?d
z3}rOrEQV9)QC57;gt5V<5NSFafRF|v?{6ei49lkSdUn<P<7*M@LBHtZxtnjh#~rXz
zZ@?rX)BtXgjyxlax`orov5xKfn57JQ7kqwb7scprjhVpMNVS=-{8Fw86N%+L-7q|P
z3F;7qFS3+mdSFiE2>o<Dqk9r=V2t>Z*pp7=7dp)aIoItz_{<IJX@0d^VyByYXOHDs
zDrPc4Dbw|QX+MX*Z(A&eHdAcuFRKcS%9r>r;bMr|9g1NXKWp4UC_$W53k-liUoRXf
zy!1-v^PpZ%`naO3<r5Wx#!w_iq-Uro2BG|Cj&Y4L^*RI~bFt}|khfvRa6%t90W!@J
z`KO?gLT53j+p-<(?2H&WEuau>B0Yx|+P3=_`w5jx(<plqZRuUu4HM~%J)vk}&F&-z
zDC?>$+eD*ejKc`VoJ@e?&^(62Im+(RMMYtE;J^=}j6(%Q8LAU^u#sTn<9OHp6M%*7
zgOFo*aFa8TlK$ijV52F<h(@df^WTRd^}pns<Up_q0PE9ZHFuM4dFQBI6UmdA=ZE%2
z!J$D6xs{*-*-2KHT6h@M8?RSJ>;ugMch;ylL(AIuW~7b23zwgVMdXL95lPQ7FN}j)
zP~Pjt4c!()zIj6r{Dxj^+E66#4cg<M7)D2Ul8L<!UHt<x7gIPuOIhkCV!`wIjc!4}
z96rp@{CpA$-XzN>4v2|Gh?7)o3<IQqboj>e&Qd<_tmQ^&c|)m{TRBu`omdtEr=+ss
zZQi|0p4gH-3B3OlqtPm3qHMQC^A1u_CKD_<awc3%_o~HU54QFTlRj6K63m%cHkB*c
znmphqua3X}L0&_^Sg8HdJKV4$u5IV#(^tojUmgcdarKxRwD#ot=g*%$30w2U*W6OM
z1K(c-VpF?6zKF-@#dt|OEavr^a-Z24GH{IVf1O;pvo+*mPHOz#($`nLovliMTH_iW
z)9Rv{sx_xG4D1?kiGqSsVoG=aI=FlI#ip^mI)3^?&tiu4&9LMYBvp5c*^GTjsy#5X
z?RAS5bg%HiEG#nxn3QuWeN`@LF$<J>Ijt5fKgAUq2|y&hEJ)0evPG?oK(Qu}H<j<*
zbSjzwL|(5KQHpqHV4YBg=+47VsKgWqWZ6w<?bXxcA0Ges>S=hoN-acSh9jjWLAfA&
zEQubaXf&+=*QxT=u`oa_LoqNM-1Vi8x|2nwAwXCWD_J+&rUn%C-H*?2GP&GNE>*Qo
zi`stNX+~X-Q#GbjmrU8BDs~#&HS+K_qbV^3BM+L7?;p}(I;NPHX7U@7BM8O-#cww8
zs&!7yB@zza2{j+FHM(ArWJoW3>OX`?m)p&1*m(DcrAN)9o0uLp8uGc_Ug<jAiyu;1
zYoxKn&=W%V90k`J^(ahW@0q`ay0*`5vH}}T%hGV~5{w8K6Kl)lpT665MQGwQf%f&g
zH!+|9{SbvACRR(aYGBO>H}W|lhFU=jQ>#|h8CD=Q3WRdsJwjy2xmMT?Mdmi{4~5l4
z8$=I3#tv~5PqamLUkH5UI$Oi6lbaSZ*W4#ZP-=t0#A3|R(53zx24o6GI(R;EBEb&v
zVa;%>C)PEfRe7QX*XJL@hHl&cVE*7+;$`nrde+5+dZt<|0p9`h#`Azh11sB-nlvz9
zC#b2^Chk&EmyMN_eJp`)xaAb2_T+l|aj^RtxSfso2y7|y7T|ZAKI{u`jZ{X_*#P(=
z3Yi`(*R3WYkWmr-(&!)XqAX_sLG~}iD&4eW5~*)wC*E>cVR<*$RID6D2TF>8x$jai
zrQ_@?c5{mriAxF#t|*+Wsxe+iGSo52`QQ`v6a*ls0|w^_?3NHC#coT=z3yMxYSEOd
z!1qi~ZgTWCib&M#jtB3%TKvV~vht#I&dw-n&Z|?T;x(CKy<Y{xQE`cBzg!#j669No
zV1Gh!DIsVbWX2lo922S#Vwy2CRl8XP8@XxWpHW1xU3q@AIS_T(t^h0NEfFk#lFo&;
zz%tJn3A;5gtOQN7k}BS6<^JkQswQ(Jx!7H`Z^P~wPg%e%$++%R{04%0&d?e!z2Knm
z8Y?E}aM=?COq1<R>bYYZz?!f2Hd1TDbu0pcm4~;@4Yc7MskUP%PcZ!Wc1EWmE)4fY
zHc~#$>eAi3C=&&L50*tA-~PgA(;stbkn*C)ftxH(dUZbD;{0lBqmbbPE=~F*r%DJz
z^7vnGnJ`{L!X?7B3Vyo%1q+)0=&KgSh1`Uo7S$|V9|W$y?NxD&e&n?<koz}Tg?dp&
z%ix}Tgmu6oMmJlC{<*6XWWl^!0$`JJ$|873!mzc)lW29*b*ooh8j{B!X9cn8f7NB|
z=%GbxMYazoRg|Km^~Pr(VX;YK|JYni5*k(ktl@=|u@%r&%4pnR!KlS>!RXoTFBp&h
zV=owWLklK*6c?rGtRQ`KqhsE&YVf1mU%=~_G;Y3rYzDf)LLi)Vv=UsE_|}(#ptC>v
zT3|OfS&X!N_3=cjUrnl#j#L&!mptMRI&td;0x9IoLn?<|DS39=VI0!#t%OJEl64j;
z6&D4`6mu-nlWF40PAwd&625cX6r_j!Ye!B&z+<rC^)<P~22+%7cHQ9+5wsEf_L2&<
zt?*y*3qDXZ{>3^|Fut<uQF-qAmyj$D9(^VytSO<SCkTDZ;+Wh~u0d8#IiR%Q{<0t}
zwPQ%uou+bz)Lgez^zpfnf`oBEM8&m+>gE~8Al=1~0YCerDB7S?KH%lcSATtR{5Y%~
zAP-Gv9ExDjd-Exk#epDdS}8)<?DS}AnsV#kJ^e1~&pqjM)`xo=#uId{_L$Q!WBS0Y
zJIVwt7>h1qu}QJhU31CTZ9Okqg2>LNWsAvV7H*Sh1$+)ruNk1!FesU>IT}@kJc)wN
zTq|hRms~9ETB7U%WQ^+#)}l4a?Xusj0V}B#F9{t@%}Nwo2wFIcshLqC9+^(J9l=Z6
znh76CM6cK!aD{0ko^1;gm&`o6_(IyOa)?gbXB<loKWZ&Eiq|$aS4Q;?&L^c3K(2Us
zvIf*{tb3C#L-KoHhGe@FX2+0>4-Rr+u56npc1_VQr@h%mHi-kP6KRD%j%AUnIte4m
z396JuB3u#jDjD*1hUKp$0+6Xg_lr|yBF9}9>hB0acPKCxZ`znqko!zhEOV)t6gb}k
z@MK?NGm6t0g#@ZlpK#s7U4STsS46UkHswd`C<vlWNhH`p7rW$u+)k2@G`z`2chhX1
zXX1YA!0$m{CcOxP5Zr+8dYFgJtJ6_{^x<u-PxsuUG@(t)#41g&JbrOPAc+7swuo5k
ztC&Z;iWme@U{JFUYg)+|d|DM9fiQQ&UYCs%v!q514ArC0;>m>r#&Ic<JFS@ixR1?{
zP<lOPx^j&2eK}bR42gBJGsq{1DenQfuQEkRATSkEx@%mSDP?b~z6cY8e^ZWgv!;AL
zsCU<itsP|uUkZ{m@CzFL7BWkzmge!T9>q_i#$&~ap+8eV&2|GNM^1>4;BkGJb(9fA
z$^1#scWwZc&TiQbYL|<5#Goh$;)cJ-F8?SEcvmUAp?uoQbF2xCs}ywFsYqGGvl2!F
zteHq)K$}fOIeg&bnE5i|`r?qEfpIwqmUOwW(K#?B$=M^>jxqtsflG+aOkS847OfPb
zr@6~OV-H*x<?J*ctT7;cRb0|fReKebPGXcYY**v(!}S;CQ<E=@dTD_+CBBJ%K~@d;
z_Vj}`2{rlPh&xJ{GHfvJpq+`%lM?5kfdzI%*aonAAwGia%ckS?z75aS`|E{B3=V(3
zJKS!FfOdBcPO32{u^Zn*#30%mys$6AX|?k2@{QODDJ4+8J)ALp;*t00HP_;>tFvMh
ze;lOZW5>FgqZ?OL&*$BI(2Xur8hi}Ca|H8gR{+`5xc`E>1&u9xVdD%HL9Pk|X*`+}
zpt;5HZHsC~&^?Mj1IsRNIe}aR5|{-@2kkKbpCMYY`x14TJMPOnZcftO{^1a5{SNL?
z@XNu_fYdCV#@e0^_C9Iy{rr>WZ&2vHYqfw#0-)LfC%D4j3}H9C*82y;p~vS@sJljn
zdE^$LT*_=t5j6Wfgo|)By%?AWppOu>E(XpaMgr@{8%XfAOgB=ky$e#>*0ZjULLXW}
zBFHSn3ZT<4GG$dMOIiW!U{`@NOA?$o05H9m5KM~p#v_5lPr3J08)#!>_YsAK0TiBA
zRl+rvtkr8Br%k-=MaMbzBIz0n<B+EH8jg{Fy|*3%Ia~at>BEagd_7THqa0*0TPBT>
zdVDUyEK%E@x)Uv_48a4bHk4e9)E>c})@%VS`IcG`dQ2<0eKKmsRX&~71=>U)nQ^0<
z?Cx}@JlN%=C%2^{vuNcTzNTp(xx4%9tUcfB4<qiFo*!UfClPhS!Jq=hLJmA?^N0dK
zsqkj-ngQK}ATfMf&CvOPOP~CP*XhoXTGBX;u*<k!gb^A;-~}r^P>TlZu3-vPi+2CE
zZpG`k4!ZR~P=I#|Ay1;P^dMX_(AR1OGWKS;>lEY)2LJ+yd;;Y;z^DjNjH!_IIRl?S
z6e{xZ1~3b+g)ZG^3m20uo^ba`Y#ZOYJz5t+ATg*u#P!DZZG8zgkrBIkxZZ={3SWOr
zj!Y+{ZL3;S^kW+l;A3Fyix3{wRzJbre17dIUVjSgIT!h$HCX}*of)Bqc0$)R$BgMV
zz+@ufu`_dT76{;<swSwnqZWb4g<(7$eLeeS*EsKDfz_;~ng9f^ddnV{8Xr7c1OYB#
z5fI^G*y2P(kHfIy@z4Sig*65_THF`NWi(D3yxdtU-3aTo(N9V7+OVjd$|Kv!LN8`t
zlhcnXUOBa8gEeV7B~1dY*O|3mv$`M53{V~g(T%e+R>h<|LE_?4@xBGW;AaIM->K1U
zcx^hatQ~-w+=-o(9BFOW4eUzm#bxc3=zdqo_9NEGV7&{hTj;|r090_uund@9iUx?>
zqfli7NyD-dl}b~?4lF>z=l1f)7m)+ZJ?S{WijZtOsl$neKg_d+CAyIoq+F-k*;Rw+
zr@&pt=l*{*KKK7S<D>RTBNX_-UHaXeVZ02JUzXR%d|B*>MY)XgUXs9oXmp5>^Hk^G
z9q|V4x<n+ud3@_Bx~A>aJWrCDUxh^FE6a53)#iSkXgEdWOV~X3Yg8)V8ToOe+r&1$
z1<!Ah-gsFMu(F1A-xG6J^WaA=LLUvJ<KO(k`!@+$F;Si#dG>Wn&?B(7AFLf`B4vS0
zMnTV77%g2XBO3_bDGS1kN>Hlaf@3rV-@B;l$6ce_HEA!?`J!usjL~9^!x6;08$*`+
z!r7stRG9}9{e-<#fVy~nvbd7H-JEeOu3m3`gf}j!l74g2QtB~gF1@ej>$!ogi00!~
z?C}2mt>-_Lk`nxI>yFc)^(`!*=jd<V>=^vXps)wt!Y84A(C5v0ZlR~pD&x^8%>w0w
zm3Jw1xExz??CYX_r-4w`&>zjfR)&dcolu2#6cNd8g$@}Gweu}cS}nRjsdYGK%AnO^
z3r0l?$`2>vQg$v;p%(DX^mE<R`=E`%^U>)r@7y2ocyxDr#yxy<+BJ=u$G1h~Hs~(u
zViVZG>AW4~<MDWxr0*gpH3HZWN0Rq?#5sI}49Dc_GsR+4Y?D@}AsfHOb&6{muR^Cs
zLWU$@idCnljxe3d(F6iJRFBKqVovs$T5VyBODYC2qQD24G0RmFlE~`@vwI%ahw7Nv
zF!c<fWlR5Lq%kX9xArg)w2`Ay$bEyJc7}Xf(Z&3ab%ox47!Y|akF8zkbXI`z>#~}*
z=kDK7Yug>as-Yq){Y`@*7=4}YZeg3_C!dJX5rDlQPZ<_Ne$?O8U&J{9@<NmP8gO^_
z9YM^iMd68NM0c1QK3XtkaxiAo;AyJCkWuVlv^NbdQw<8mB40Q!-xpK2M)P7u6*7vM
z`F@)Cexbq0;%J~CZ~bVp(?`@j9LU0L@@lxVO6035#oVPz=TYB^3c+osE>O<J?w6b?
z>7=7WEN-Sl^rmZee*7p4u`y?pOUU*tL<G#8Rv)ezgAulw2*O}$*We4@0tvmK&EeP!
zaXSXl7hKU5BHAyiDTGNx;TNPI;D;K3FeosT>Jq+1C4zMyK-P%Y!9qXmIZ=2oi(XLi
z7me(^8YXmQGqr$gcGjg6eEd<QO>TSB4csJxgHS?A1mblB{e;`qJPr(WaFeo65e<#V
z|1W*bX<LmE=#vJnSNMX}12DOf%P0({<`VG<Z`jst*>w)LxGmcSqecU`+$@rZ*i1B4
z%v{$KNfxg<o}l_cv-sGfjE%y^0PC59*Lz4|d2TzXEZkBPO9Z11FIB1$S*mo>#>3#f
z$Kv(5wC+yqd|pmLwFFl`7=n`^M}l)nIhL^aR7oH&9m|*kJ~!O;TTft=@XL=r3UBUY
z`u5#O)lA(?*SUJS>9qdo$C*$vr`Ah7zt)|bKCK_|u<meHd(UTD0^N9C|N9<Fx^`3N
z@`%lhRJI-GT|(G=YfNbH;<ml-MsfS6x1FNqTi)RuW1JnmtP+of-+kUk>rv(+`aH22
z_I}POcoHAgr&3&{-I%orBgcalFBCrfD9k|wxt)S0g)vyN6?}qTWVY)uiHjbi$HlK;
z^|(lzJ)+3J_@CG)vgP%Q;_a-WVwjPL|8$GUwzD~Cl$Y-z{)ocC5Kuy`iS#WGLKv6R
zFk7b6PSwYt$l|8mTNRg`S`6~+wo|jE-G9xB49itDuUfa@5)*FHgyAx+*W^>B=;_<e
z7A6bN4(Y;f5zopt+AjCx*3s*z*&Uh8D{t%zkHC&tmlO!e#S<X(p1f1ppc<EBzy9I6
zZ(F3QyGqrqvtw>|0|;=xYjG>e=Hhn1e?e}b1%)r%h`}f5k!v($fV>EHmA5Q%)1k!X
z8kBgrxss7x;^xCCu}M&3vkN6Q0O|*f^aH4|=~82J9cnzd)>2)Q8o#btq%!6QEf@eq
zm_N)fZh;UD-0Q`r53dRL%8tp%fr&J)TX&muze6H*B6!>i99&kNJ{w+7aAA3*7mXqP
z58F0AO=YKblC~8^^I8e)<LoKs&SD5uMFm0|4KiO=PMX<Rg=<@Wyib`DfC@<CMZXPJ
z+o_Uu7t|#=wll>{Gj>l#zS=0XI^zHbhym%&0Vx`I6YF_yb=65*n@DY`^(%jK#SV}t
zA!cl5rWJ$;awG!gbYc7j&~w3IU5jb7o^5)9-PCW08|xc1>4hn(0IU>l5?7*;3Q1_}
zIzuZjmm=P#T#BnXV2S+fwt#LtPvnMoIA<{~eDbA@kpr(vF7@Mm{&AvwrxXa3nz=<R
zd71Cv`Dg*&?7sz*7^HmOZWd%)Y77p&yC$}KyeSAe+(&qFlbda`oQ2KqocQ5Gv$v_b
z21t1d8K&l&G?emb#etP)#qz%nOnFrzUU|6k_~;`nJ+^zBK-Mxt&UA#UylRIOJO!ea
zZiy-2iCLOlMvaCfk){c;Lps<jn3Z533zra{?7V{i;a2cJc2In=)xLC=h=EYGFp9K*
z&&YJMa;pLd9E(NK6eYu+@9|nt*8SU5mz?Z<63S*!2NKoicE@g@xI(JCim`F1%xE=Y
zZ%y+88`SoN{Zzw*X(EyDxWn#nw4Kk}5gtp~-^gZD_7IdLCsc%;><U_I-7j^sZU7pg
zf$NgXU{NNu0wr)Zwl6(AGTI!QW(o9!EfsyGf3D)9HCIu^8Z28;q)Qf~m{Cu!dP4+v
zSV)<G`BLJ*|N89d^RI0fI6ko7R;SU*;pm%DcDMUedLi}POU4Jx)+YAY=zq?RN)YeX
zyn<n}?zKsKA%4sW3~0}fs{#|m5a7z!6d{|cE{WIzJ-W<sopVjV?onN?5rf2^BJ|oS
ziv!4->_j1#3LjU8+7Hd!l8#oNT-@-0ZQ`Cyss>nd+cm)S7Hay+f5BhdaFQqmnZj~A
z07ab=U>*fWra^oL!V<8)Ww)IA#$}3Yay8ei$+hL8mTRWDUP&$jQy`;hs6FSb))4p^
z70yOnAycbM;_CX#bUo`$v=!keTQG2@$<SONS}nU^=ns!u-m&OxUs<0)WDT{ZTKvJb
z&5L<+bKQbs2RkY%%?A|}OIdN0j-g=Be@83M2h`$m1bd6+c$!q@vgX>A%dSBRH>zAl
zXF9c(==<<z`s1pgO;pY-AnzO3Gi!S4nKd`5XSO>}y>>0L&5Sj*3BHSdwwkDNwsEO;
zF?R24pWjBT*IA!mi&2fT8*r)7)|zC0r%K?G6M;3rdpX-l&GCx>v%<32e*;z*RUT`u
zS9xrURvgexIt4R9HII?{S%HjB0))b|dv%nl>|z{it`|vC2!#_=hTX632d>hrh}88A
zf+kCojE^FaT8367T7tyl<Eu580<zedry?06N#r1q)A)i$$<VdY2fP(;FyVh_+SPhO
zJdM^`|0`JL?+H1R-d<y_V9_%25v;-Gc|Bv8P!gLVTnf$St_?M_!^2s1vMN>xE(8#1
zU^{kmTosG<LFQwN`PPx}g$8`)vmk@LI0415;67bz?;uE`T4>G*4b;P9b<<Md!#N#W
zqdWOnD9zM!>J<TiTEGx^k0;|}G;UbDSD<Vs3PkyQEmK2=&`eeUkg@T6y0_O&a6a+L
zZHH@6tGiYP<hP|XAj$7xG?vXO<kvYM?k?VYPz8N8NB4%*8VF1PLDO28JTN2(vXP*Z
zK(=C>*uJwt!-s~kDQNSlZ0kgRw?4e>-O+}3<eyKd&IfJQbIml|T;_nX7m00gcNxc?
zNnHbGyaz+ZUP07>vT5};i<GvVSIHElN8(^yP$~^C31KZ;K29E;7BeUif5MPG%8idQ
zExlm1zPl*a7A8K&5ur(`6f^#!UhD_46a&ZH!Blfukk~?NMur+T;s*)z%_sxYQMd>@
z7xhCXR#GN4wReYV=Z%LODKVLCYaZVgHHN;hsFUkb=JjdPqC*#w7A~B=^Ohlnk?wlO
zJG%LZC-SfK;cYIeWL5<oe8i)kNhDILfMrO$JC*VDazMN(Vvyfn#VPhr9F7mi2VRnO
zf3PFMY-`MHcHFN{<es8586Sf8)^P&@=ip?J1;VcZ&%@MJU>lNv>3B)85ovX2IK`c*
zYM0nq?O=nsNy0`tIWZr6n`okuh{`@qM%KA=GI6<)Wutsgzkg~z^x0xzLQ)?o@@u9(
zRzOQ_A_zalF9JiSsZ^E(f!!TD6K0wj08O%9(-otItF4lwGZI`ba&zI=9#!*NAew|S
zaMKyUT5$aeH#(;RE2f>8M-;*q@3U@&kKOz7Y3ZbGxH}s;8EXTXSsu4;T9i-4Z*~ew
zDmX#BAxb(%vnW{O-|k9|?=T}IEf7H6No;*aFXcckh|-@7eKMY;YfwxS=4#|zeH=V^
zzHl}S3p!81q_+l;{cK%;Mpd$&1~U@%$GQk_xTu-nrI7^Wfx|+G2_<}1U9W+P)Yjd^
zDtUIB*D2>r+2((R%anOt;tt&*mp$d++$9D6U*+cAX=4-jZa=9oWrt1j!`mVjx+Oi}
zzjkmFa@qM(JS!LFs+wd>Fxn*>Fx_ZA6~F=7UTT@OXX7DL9BE&%kM=t$1IJso;{tEG
z3%^#yOzKY{4}r<&UTNbt8^O0AW_AgN&RS?PU}h(L!(kZ!0l36P=)f*U)>8pmL<J2L
z$xe-+%|w^tlpk9#yH<J7O$kW5U!Nw9#t2lJoPSL%sT)Eh&u){co9Zvp{6{^dz*8l1
z%BCF_auT%f;Iujlj5#s2awB1L)3T?aG5ph8jmY>kY<tIb?+*#+tM+bcYm72k7L=E4
zeUp?79@jj#A1gA30mZ%9n!Bq#SZ(+Bty}s)e7HW~xnR+oWm#-kaI%%EP4xK1_b;9b
z8xZ4cU<xzoamB(MlSRIV^{4itU{=1lU|7v2;dJwgqKgFn($F^#`-+UzNyAOH5%cvy
zW~cegYnS%%kKcXu^kwRoufG5O`P0WQQa`;qe);UhpHjaZKmO|Z)6@^&{P^O@@w4xf
z&Hec5>C3MlA3shu`0dN5kH6Mmd|o5|`uy3SzKuWMM#b<~yzV9n;Fbg{bIWo2d5W~#
zWj|fxN8)Ax8ZQ?CJp>taOI;%Jy9f&g*kBV@cVlwgw5oquRgo}7Pd5AMVEU9EL~maw
zJ;)2MpXSSrZ%VPMe{Ot>T8e||jw9xBiR0XsJv3d<1D`Vdy&-#OxvHmYOpJ{ah?2=e
zTUs~CLp0hrc?e@@*C3uU7$UsZLZJz2QyLqB4XUAx7yhaFr~gen{2TI+axLlEk=C{@
zkzapa^CSrVgN%JMP?MlB)nzlxJ8rcUL{2a0$LKk45$^a}iwo+0CaKYeA~<cS|Af4c
zb4T7^D|KYoID_|{%n=yz$oRrPZR=!a<kR<TJ!3v`Qnr_+qYAIdv|Qef&jO64L9PjC
zT<qLd1c{y?5e~T$Qb{7RN<6B27{vDa0?6|?otRl*y~72tHU9io(jWj@K&8L1(Imf@
z+8W{N{}sc?ZIpC+5g9m_5e_wJ4p)W6KB!y>f}%$I#(>3GWep{XsCpKE@5hgsQ951@
zTHApBOswac@%|*M6#%1l#fg24te(hE2t44P38kwh?UD?DJ!6PEuqmp^B)tY;G@h$5
z4M#OnIB?46U?gdql5!D)p%d7Clkqd91FauEx;OrPzVCwoumCU&{cAJ>fa7X)ib+#Q
z<cCtQob9iUd7iARS-UUAh0kCQ+y~Xn3AGTe@{CY8Frl~xu7GtJ!1YtiC@=<^&)j`T
z+}16EkOpP>z^OTh`fY5rKc*-p{t&~}F9q0lLE$b;#ma@Uch!P;5RI{fVgT+2g-TE>
zl+UNk_uJYj|FqtapPTQoDcqPt_WbSyaXo#!0~gZn2R_(27>V`)YQ|v|ABbOrifM72
z>yZ&lKL0cyEVxiy{NAOT+R>Kx>^t(_tHgUvy<SaB&-OhSEY~}6*IqC@d~asnTdbE&
z@Pc`7Jv66dz2x(upF-QL%yhc2LjnIo>fK;!Fe%3?SMA$oHF*u1!n3bmJ^MdT-y8++
zx&L0Sste%HOUP2ehd`x7LKwr#)!csZTNnoGnE)~=b22GbPQEiXK*=G_6473m5D7NJ
zzMQ7BvPIqz;fmn1KsKp>`)V4Eomf_%Mloa~)O2T<$LxlUxjLHdX=mRpnX>g1<dQ*h
zx(?#oMp+^=2M|TvE79cOQI9-$^I>TjE3Zd$Evrsx6cTswP>3px1wh#L;>!mVK3W{}
z6$KuxHSm+R8M-I%&QY)M<`#joZD_BdBub9qVb9(FBaS<ssxcuz=@Q@`ouVkzww#$@
z)<wRD;MEvroeS!+;${Q`8nISEXm5+CdVRWAbDV>IDI9U3w<-llx0sp+L2+_B1Pe$D
z($i7MJ3hQK5K7Wr0q5<s&(>~wW6#~ZdrB5j!wT5#>rC)hPwY1ge%CEZ!7oEvYWIEU
z2@_V4>7kIws-}+!-)oC%7JYhI1Qq6xj;G))&EaJ(CC?SIW`L%?!UV*Tl`)97borp2
zeR@UB9n@J^smFyI=y#6ne|Aw>c!ZOOLaZCnjFOH0fM7*0+=K}Hx36;ymMqZ|v44;r
zu`w!X;iR%?>IK1<fptd$+ryE1@3<GBxKIHFW3QTaA2kz=ymO6Q1^Dp5Io`W72;Dr$
zFjU7k#_lw4L;@5LDMAtlDx*bd#@B*=>(u9!IGd1BaaISgXA+tFIJ)1E$$2?>*I;>&
zm<eXSG>JQXKx56iYIWg|aZ=T6m@&UXKo*8qnjJ9vm9TsFZC~dYLtS{xb@s*&+liUJ
zE^M+jUPd{noN=X0lpjO>X7?#2Md)K`gVOinms!&C&(-+7r^lO04}vM%<KGt(rwL)u
zgIlrG4r#HR0nnwEv9--mn5mxndPy9*Ea#~1K*Y?|c$i*%CrNgWc|v}SIP$Il^JlPx
zbu3fCquX@bee2rGP20Ohm<v0@Z)`o2Ez_CQ>qVQG6F$FfXN_(9Miav?cbL_@Xi^&m
zk3Z6!py?Y;2|nC1qwUh}mRhrSf2Jz4?%zKj4*Q+$W=_z-ru0hSOCzJBep;;36HaEU
zQ1Iu(B$-=ir^N-A4l(c@fVP-wD)AMWgktMUA+81EY39f+P^Jp0QRFz77?+xibC^z`
z^0%AXMOCkx9@EjTI#<2Q*vHt|)EX$cfyccY*Ys_~b-oQ*&hR>`q<|z~kO?b{k%7D5
z*piM&s{C2PNPR#bs}R3EYmY>Wkh-T>ySq`DC~>oEj&qz<)Jc&ZVok>i-I$XSwFa!#
zUO`PZ@L!==W+uy4VGV%wdeSHp<O;OLcU-05C$M%-Pv^zz$Ui#Un6$fhx;H#Rives4
zi%54)?~u*FHvy{wE$qPpzS<k*zb)p=BREg=8dU)r?0qu*+rs@?tj0zmQ6nqc<O|53
z(wzw^)O7bWYswjhA(5=7YBGPrHj4QCkhaE0!;!PZ($RA*U*~r&)|KysHvKzzTeC5O
zM@*^yU17;ooDPMfqevv+K3)ZVWZgcRv__iNZIz5W3ZZ<FRu@NR+}p=I+i_jG3Pw+Z
z>s=Sx3s5~RorcSquGJPCW)6eM#6lm$wam(ka@Nz;^If_U72@)|ZbG<V@NSUorxXnf
z#ikT^gP1?lsh5}rR6mA(rL_fb6-Ui1xaKDw7*mN5hC1^2nT1s=h1D#P6`weL?j6P0
zjI$RSH9~`{7L(a}DiSe01Jaq)a{^}?M#5^>-{TXuq!w;AI1TtF2Bh%pm%?#7#JMpG
z+Hoz?Gs4RbpIuA9V$o#RxCrSZg>s{ENYYvPC&U#<T#eM8B7_^Xn~q$NcI*8AvtV(2
zE)i#u8&)n3zIekmgizE4$arlwI1uX*B@_F_1D85kvBR&4S2j)obb_46|HK@E<Ojoq
z^?MiMG~Qut>yAVtCS)TUB1iTFqO3nFxO@S4bSOfppv25<pw`tvy)4m+=5_~a2sOjZ
z7qrqM8fr+%2D949L691;s;z+~Z%Zfu=>9I*hZVb4alVa8hcEjg_!wo776al*K$*`J
z@=XH{Erw~NS||5qBTVp)M15Nt8r>EN-#Xqv8}*n!B}MAU0jSl@H-P!jwYx;yJ93%p
zIwQP92BZb~-__Jn4JcBDH8sO}bXX6$q&miEv2DV=T-aNAoIQtsDK3Agxyo(st;cxP
zInIM0;}8~~9q85B6$#GO8e~6VFYjN%TE`ls69?t*${ICU`Y20eF;o8mM6Z`Hrsc9d
z$J{!T9KDgQ#d;QwiJyMt%aMCYQ93MtKgxOU^~g0|9b@FSorDBxm~}Kj7PlDJSoU(1
z#jGr13O*IfhQu`zn8C6cOs)LK8l>AR5sIdg48}tOStzE4UDqBovc|Bt=ypTsW|{CP
zGZzIv>$xXJJr@NF&$0tv^{o~Z#ervwi<aBGMYq^L%F3dN-W>(tAk}0IF#hgbL$n?R
z^IYM|F)Nmms~B*Gs3cy(eN~VA`^3cAbLjs6>ZEEBnFQO`#KT*?J)*D|p`9`6_t7=h
z#DG6(t8rwW&d}|o?h=rzd@uc{cZ)!jh}FO_I*Lezm*aTUO&7~CM2Tw7%^4LvH^$pW
zu93e;!FiVC6#9H*VBNhGs<PjCK{SXe9@8L(ka!`k72;Ei9APBUAthL)k^-inYpVYx
zw@xWl((#+dRAcW3oj=GrNF(2V|NZ}Z^7#343pOIp%%YFF7$xx5%csZjhwhR6F5Tnt
z<7dwk-}2+_{XT#8;%WRbJPUe8Z9h5R?|*#J=^Gygp$p&Ds}cZIIphLVNm}F44n_b}
zRXGoQEJne=ZRaChsU=nal!(ZLO7>|`YHl8d@l7p(xH^RdC9;FCZ$D``jDJH+IS&#t
zx?7m^Dia<PR^N8~ljI&59meTyaaA8>f~-W%k#Bqr%23l#7|(}AtNaDMraVeDnczlH
zQI4viTa>ns1Gj5@LGlFw0(^vpl-Os2FJX=#Gz{hLQ0fazrI^E_l@clo8dOgljWt@=
z1&Al^cOzU{>@;g`*J)<32)q6=V!-HAJ0-aX+%5E9=u7IUPte1X6-G-~Y-C|(NjLh2
zUNXKXtv-%G$fQCu57o~lxtuut1IE$-`Ap0P?xIHAo_eK~E;Plb!+gGb{Hnuj<=JMY
z32#LVlOJvWE@qbUY&)~WvBk_%9|kAK#|>DYrN0I%j&S3^Er>8v@dP#{WBIbl`+Fij
zRu-~RBfn9m5DA<bboIj)0S01h_&%1vWB8JcvHo)-GkLv|PFi88>A2f5f-VyN0G#j=
zvxiB@Dld(Wc0%O=0^$3N@HQI@03X_8p+n}8I}ck#U<{VsW%N8W82+p*q(*}O?yvP)
z1z;}L#gdC+f5T~sk>C5mgN`L~Yv&nNjcERL=DlQwOP+G|0BjaAanK@Muc$e9eE+_l
zFPRTlf~G%ps#=NV3RnySi4|HH3P1_TV@SZ~#d2998o#+Dj0PX*WStlZq&;-Jr{?U@
zE9|8CqQFtCuCl}_t9;OPbBjav#_h*SE`0al-U2wL7yB)1)gnC`@1%}>u(_`BT72r)
zNa|~DY`oTc$%}B;vs?clX4ize;5}-db%JjL#lo8yR#TNTcKozs%iVFWxR}`v5Vo1J
z4PLmk#xC%8TM)Q+Q;wmHU(2xCB#j`=^$k!rBk&s=pi(5Busy-PTz9KwOdqt<ofFit
z=4?DjXqUaIwW{Yp?fUu7E`V#$X|D-KlZy@>ePL6JzM#aS$LsgitOEPea{`TJLOftH
zAZZQ^*!tp3UIbh6a#decAgeWSC1JVoh2wcu$pnTMQHBmE$q{-&h6#7mj9I^ev7Z!8
zHNi?H+9XB|Nu660`6?Eq4BIUDsbo7o!Hs_oSf0>8XWYL1^Xkm$XZvJs4x0yeat2Ob
zP(0mjrnVoz`!%l$QFeOCfYeM9z&V$vgXv0S!uq{?Srh#cZJon@-7!3^#0u)@==ocd
z7TFyJ({p#KFbK>DbGLtHj-xI%15npwf8>=Bnv-xLDH%4c#oLY=sry`p^NKfr$02c&
zO@^_<9Y0x6`KYW`?8n2iOF(C4U9brOF!44B{H<QLpX$27iqY(YkZiEaUizeBsQ`on
zV`RU^UEK{JBl?hT6gA@-I%KPd-~%L3nMF1z$7kbFzDFZFDW+Z(`i<0j-WyT`6eovb
zSs&`Bi7B5f4de_lha9p8zZf3`M;uVFzR{0ir@_YAMA?Jif?MYj#9Yu?0>VNc0777F
zpmZ=)&z9$fJAi;`#D?m=3-S5eVmgH@%CJd&b`u-KrV6v#Fy4R9-+o0&^Phe-qFZtj
zp|($_O%zJUBDRrc@%&Ib^y61z<L=%H(qk}JdKBLWo0h8!i)0^vltr^>o8h|Iltabb
zob@auw?YUum<a$-3pid)yG4#d;FofG{c>j?Wx0?2(4by{03DX@`kaDe3$YHj?Fvji
z-V#%u^mg}yFdX8|;MHHGR(}JfCSp%^T)ND|ke-HnrZSd9&&*(5mkb>N(O*0i$H$B0
z0NjVmlkOn=<Lexm^ojY12WF@9(sN3H-1Z%}nO6%8Ufbc+WFLzYMMnc}qMIF$SQhpV
zcV7P;>xlc7<K^#J@13-iTVL590)-}sNntxRq5i20U?CepLuphVBlQ3rLBlLA<q9z*
z?W)jHrZ(<ZaD{>jF=VJKaASk1Z{Fb5845|^2J^$49I%Vc8_X^50xv|q1Sp8u_bb%i
zO#f<6E3V_bi7K8xp?o)|jiDSSCb)%!7Bj*&Ww*K0Gs;&*)szOfCgGN4DKe}d1cYE3
zb(-?3Dg(gUi56uEqvJyv^S8712xbh??6AY|H?)m^58yAEDLmO)*a|lTXA<u{KD@2H
zXE%~>xUV4XXopRE`QLO4x<P9ccpwE_5vrLJh#~r{f>G6|I#gJ7CJx@n6#da7#rP#2
zprXGzBfNy6(K&l*VHe)F5mH0BwfXOKSVlp3MV2LUc$$H6@V^Nb2`>TK_FDo-nKF<z
zyxkDA!@MjY@fpw-(Laq21YE}^0^3pl(Ki@C3tHQ>bhN#qIAgYAva)9an7X*iyRF{X
zxDAe_05K-B7c&qFA*q|<=E&LYn}T(K7a^AgQ&>)POHG@ZHtOyG6+H;<BD@L(Gz-HO
zPEj%sZ+F$hO~{Px>91Jd87kp`KqJjrS#RB(6PC^(8n7vXZ2eJ)tSb^}Uk%%?6XR>b
zbw{Hk1u@jia>dDNMMOs!;AFPeTiHknZ)P>vDj<rB+$w8=YUA%ml5c?37#ggtjTbpQ
z#(XK{I9Y1!j{3;eW^4M=FJkU$*64i$3z<d%@W6FWc<d25u3#a8Df^_DK?=h3NHZnK
z%&0Z4i%wfn0b&-S$WI1_w2VOps`<Q}LM{fN+p9B6L+j&a(O1P15LK<hm=7+BwOY?`
zywUO5RmvO>v&W~cq2O5aP_hd(4}EMs8^QDq(sM?3L^ad$3~?>=v^t>#3yY_Sx5CiF
z<wkZZM>-g%JiM(44li~|%Lxxzuax~vC);@P38m<9bg512l8cp4wc`?5j2qFUJhBD=
z$>(5x%hf&QV16X~3(yRdF$~&}hc^u$PF1K>iANewNj&w*-y?x15>Gik!53bPs>2Y_
zIh<P?Y3rT}@1`mezQ!lT0as1tAJHo|>P-{%vM@MQkSr^Xdc@WcH?0XqLk=J+OT|(X
z2aIuSR}^&Wt8JNRSBd@2eA*kSIB^sLqnw;_NIT)V`{_AZga4)#j3?zYx&{)21tXBF
zQ38=Yr`SSZpi#IFLjvQ6x35Y`%YE|nMs+6$RY5ZF_WFz?83_TJf_RYGYIU<Akewhb
zYuf1QY!^Wjhg~h&?kZI`!$sJrbV$P=zDPwFnr5bJi|+(+>PT%YWlSK=ih!!A0YBTF
zmMbbJ75;Er%LZ#?N`Qr({Oc^?%_@U!TV#-{x+@G%Z*6%&atoXOS6Wn>xu5S2OO~+C
z+8=If;i7nmu#<j!g4Pkcz15^HyQ@jhkFx4Cc761f72~uudj6@ro<+sP?lf9XEM-MV
zl-An4_(sdH7Omi(j<Tjk$05~1Y1DN%af({ea=v%bn&kr2pd2pW?Zncl%o9AnO%~?M
zE(KluSD&@*OGH`Y-6f*uALnx9O!b}M-Z$G^L#ykwJl*9r`fo>_uixDEDdn>F#cBdV
zC84|dT5A&6uv!)3lX0U^_dp2T59ii6cAOk&VTU-7$2RD3?*!cijZf=^6XRneCdVq+
zxN6j)e4)UsI<;;2NDgjM6$6@wTl#I>hqV8QkHjCNcHsUl9B*K07_{P`6x@cbkf~Ko
zFgIJWJanBD0#xc#dm%EzF&UV(nE4#rVpCx0&Q-$(hjp{ope2D`c&_!pAtRu|@Fg&q
zNJ|xgC<9v)M2oiO417j#Xf{>6<r5TV%G$>tN$l@UyKep&YLy)e`kz*U>&!+kFg+>`
zAK0xv%eA(EmWUr^;QXL76;ds=!W4N1F*vBZ0jjENS#va+;D9c`M2X4+)Ojl3qXcq>
zv1N5PCTBa}>=Q$N4Jl-^5b|qD9{>HtgQ(<*dHRvgP+x%~k{z)g%&qJmXxHR3pd+Tz
z^{Y<o>9#6Ff>4UJXE=C+!@4wLZg;J69Tn}ek8gF&KaCpS%>&rNcyI6gNJ%b%YOq^k
zfv{4>$3=OmR;6IU><>E|BBzLuAGAY{uC?g@u@!Aln%#sp2)}pN`FRb+MUd63S;k>d
zT=zOgc2^!5yJ%t$Y%y8Yp%<0HIcBa|XaW3K+HwB#&zPvO1Y;ija+e_AzWed{@yn;j
z?(d=aQBlY-coBRD#b6eY8*~8oKiV7JcGKf6dy=?ArZ*|MxZA#@Z;c?vs9o*2DGFcy
z0oy`t!16=C{~CMJjZOGCfeFc|gy4|O+fhCqk2l65P{dUjOiYo)7~+pRrO{umMbR|S
zjRfXa3ir`)<5A|fPCawrKTF{4gVp-9d##(tfh9~bGa%Yc9DgU}Sw&gV%pYYA<lz#G
zY*4A%^FDNTnmy(<ufRnn;(s5acUo%sD4`KIjf-$15ODa@sB}*F!%e+M8<~Xd;3giV
zANnx_6Am9A38NR9+?3lqP2<QVrCvZzg3tyrYqL5Hdx>86E+$_)^KRaSLfK{0y7#sH
z;aZz^u#1<~w!Vp<BqW>u%`y%=kBW#^LOhUN2_|Dh#LAs$clfV<1&QXYS)YXK>>k`?
zeRn8SOpWhYo-hn@-{r0T0*3aj=xTm~30zb&Y<WcyB?di5Bjg?bUzN*QF(FOvN?7G$
zQu=Ta^P$wci><=K-}C_f;DMA#SMvswz=0X1>TTRq5DOAv-2U-xZLo4Y-}Fw~Yc~Ww
z>v?Tk(aE@$Q&Q^ESTv~xf{-3@{6j+DhB?_g8UBv6Y<R@kDy~hoBTAHgDs~)x3X(3+
zh{Lq@PjjpFgP3}Wf-9aC*BrQ5cA}~dei~H&0W-vs_0N$M<BBv}$g!h0$-|FAiXWsq
zk<9d~kqdU0!D!@Sm(kfvI{6FQWRvz`L{~uVAjsNXOp6udLN3?sn9D#x043LM@d6_V
zerF4;OhPql!um+m=Wl);a#b;sV;wlQUaOaOfl{8neEH3@=K;zJKe7qLm92aN2&A85
zJ$P9I4QajZaHB9845*=<(49Ym2t5^^oKCn4Lr-YA{_#gSMLTG^=>sHAoL}PzWgD`0
z!aMw<vsK9p2L0?`foiTRDc%m{*v79ZO0zPe;%_m7BY8!3Sog!b@+u)U8*O8peGe84
zz<?TM6BX?MgQgW2W~r(c#n{13Cx*sRhWd4-P=GojWPp9cuoBvVy7m_NiPL+~deX#U
za)D;I5Fj_BE|B<`uysb7!Ztd<io!7s;KSRBST!3Rw4V<^%jy%lVP~FWA^=uAe%2<d
z-zFxI8o#7pWgNrmcJ!oZg2D@U0g~0>iJBVl^*C-`s^UVSCEy0Ro2sqOlE9xRT71Wj
zk{?-hj2takz@o{DsI*`1>4NTRw#%$rK*~2pxKl@_v&@^~;(9u;u(&>`xpzZYDie7L
z$6#LLd7E*)7%_}(pendBXVpm)P?bEq{rpa8c~e25?-5vu(}8IHB1f{EJ2Ag<o$U>i
zY~z4OdUWfiOlo$sS8JMNm)DGO@$7QvAjfBkSb*XL;o0j|7#QGN=a>X-#B=629dCyn
z=)_R^#~&?%(s!|=$%6jb7HPx(*zSIfeZ5)a<$v+ccLF>4+3kmQa>M=S4}bl2Hj1We
zqdEVpw;`c>_{SeDNW*vWF%Do5@wVmNo^aIb?!S~ZPDX+J3VR%cnr#hp9dT(WOd1O_
z1~ll^r}47d6hyslqNzkosXqN!5vAI}hGXtO`FMx@zx+U_&-2GW&euQ9yB+4>EdTdD
zqrKa99c-2l(&WsR`NlWHdWhyh;ejiLqAe(Y5S=P$=8g<?uDKt-`R3`%SI_>BHP+e3
z)?gP_4nud1nwla6javr};oMc%r#kf|7FiNxX|6Clg@@1n*h!Y%0kO#QR9v;ty9CQR
zY1gjtD@+#8ypduD$dKz~*>0wx|JZB|@_L(Zdou}rgGuR9QiPP;G;$IopUW;p3B1V+
z?u{$rb|+YhmBvtiFgA{=cCO9Tg%igpic!Q^kqB?WeP5!d5jz=)mzZ74p>MzSmp4Zo
z`WS%J;ux4q|FWWEKF+mo4#itk|5y_sGAJ(Z%BwM0$R)8Ikr=3Y`n*_pDmCwm5^f+G
z{FtNjvUziIr|hp+LNPe71#ljo9$4voi6WoFF9;&Qtaxp3k}FD1^%D*~wOI--;q9up
zgvtdFXaz7cJ}yNt|6+c#Uc{5aCqby_szlqE9|>#`;*t9>0vdU5VsUb-qx<Q4i*4=X
z0;=D2y}W$-&5LINqCPzdl*;3cO}zNtePUa{2X-hBl(jBa?(34-eVI?IQ(Ub!BYgFR
z-AS8#e63k;WF0TdP=a!Q$E>3tamBry|CDuI*ihdV2<wRw5J)aZ*)RH84>Aknt|09j
zU`@t<2NQ8g<lWtL`Y~Dqdbpd<*av@clvx_Mr(l2hN)QD-4*lcB73bc>;c?p*nXcM$
z;gPpM7ONKJ3=sbb7?aY0&<5X~LwdM{q7NB$Xv;OS+dA%sFTK;nDy{D#O$V}gbwUpQ
z{uh-(V}+Lutb#jgt1$%-XuJs2lV+s+1M++{VI|Ns!Npw7A>}}()kHX`eCZ)VYN)^_
z<+{yuGxU~V#vAAZuIZVe+x&X5zgT;;pJ1-0ws(gN@|0gHz6cvCK_Q{Q3IL9_YpR+Z
z;T**S=xc$)licJWKL=cl<@7aw{3dc`$xa|L%Fg={!a7JfVlAk&xogy;7TK1`tx7I=
z20VzH*Mu-!UxNRE1+EvR@x@W8o+hgJVepJNezKn)dU*h_dH6G+J9&6(%2}*cO9v?l
z69vPxriMNu_{`>1@P7x`jN~c7mbT8m6ZI_*Z{1rW4c|B)<xfslT(P`u5$Ou`#LcRA
zWf+GaM&QF3#a)I&eGnqfVewA1E&xco<2HBT30*VpKknoh(#%d>c%^&~<$<Au-C0ea
zuUd+BHUaw<8m}_~bKNdi^>jT+iagjvuub?R2)Xec=zybZ-x80MK=oyH{Jm=C5w(CM
zXPY6#)}YU9Ah+#u^ey2pVY5l~jsE3+jZc{4CcvFKnuJf!)tIb}I$ZK%+bpm$dMpY*
z1eZ9k1F%Gn=59FClPtHa{jmDLh36)Y?2#U+$qloqxVRoDF4G{y;;g6^9m8|@rJvsJ
z3IKStJD=^KdUSN29kekCxY-)HzWrEzP<)N2NMZr0!p#@6T|(2<XvRe=)ubiISd9IW
zMIe>7i&p9q(;P3n3xSI_DH7)xG!uZLpIuoCsz&no1R07d?Xp%3c~a*103X@9j_}a%
z#Z+bHZbjyqf9s&5zc92f3VG?z%XX3uBC8rHsKDTsT0a7Gvt+1jhV?-1+hPIt_a42{
zxCMz>h>C$6+u)EexIs!sM49+arX_?y!p5v{H`Hmha;F=&$Ct(Bgd8j@@v2tN927v1
zZrpT$e8Buxt}ZHrRXHmbPCq{@rR+j@R&AzioF&V3@66k&e2|`0kl|5=g&F)1eO0u*
zdfhhe(VibH5ANCL-@6Z?WBz!8<sVMM)nZ73s%^^IDMh5hg8pM&wYuPLk1-EsvZ|;G
zgA-AZy2%9L-d#~jK2lmXEnz5VhSHu2!9RGCr`HZsubO(L_FMlXPWg};C7wWH60kd8
zpPp6|*i26XxG3-qFDHh~HRZAZxk=ueJ23;xFFoPIc|{dPy9ZsVRtFS7xl%n8RxC%X
zwQCtdVnc4Ypxo!p`edKqJTl;>tXbrVpA=4gQ7y5|X}z#N(>2`ptK(1SC4|0Dg8C|h
zrdmK;fD<->F%0b|7-Eg&Orcx$HwN5<CAo4+%RE0VCe_T*Oxf7iDD2+<Hnte5u(?kW
zqf;}>X#ok`&#prSmBg`3W2gEKuxqS_?5mA%23Nzy(@521od|O%2#*hcN4!9k88ig#
zxaQO`TaT~_hGO{4dEG!HTz$4G=2CYB?+|z=x~g{#H#6*-XsGT6h3ROZCJokPhw?^_
zbTf(w$8TT|bCAm_w^(G#_9o!4wx=5leDM~d4bAxUnH}CB+%Mjf;V9iAZ)MylKTftA
zor1oWJ1$`JG}$g6p)JkE!N&e!vQavCTiS&47dHvdk}U>@bxXrl9XDIm$wu8Jv8}DT
ziQB51WLw|s@qb0f-#6ST`zlQ#FNoX6hsiF8bx6A?zXw-16~<x!S1M^3^ocdGOn0_M
z7P?}wVwJCx<O?8(RPi7S9HDfUP^0#Rw&9wHGJqYU!duTBG(vC=gVvxa8?gp|$JTl%
z!gN0@!gL>sFnxu`O-nIF1(=TG18J(NfgCh}O00op{W;W5b2^Q2dGT#U0<W}FA(Zn9
z0adCA<2Rc+Q&dx7;<m!c5VI>q$beTCtWSwNlZAqUuahR+*xVM(kUP2xY%zepdJ%&D
z$_E$u>yb#QZ-%knl09phHJMAqUc!J<-nM9K=CYD-VN|_SrzHX`>9_>JMm<re&Ye8M
zUlF2|<v0$J5LYPQRkkKCw#*~8%4if+eME@b6sSQp!wDISL_?ZCx>}0L5%K@rBk{a%
z^;j`JD^@3lHHT00!Ry-H&2B;6c;6&evqy_?S1uT)93A>%eG;<FEptZ@E%K}t8ME;Y
zFni7?Q0kP!29Q25-Ak5G%Fery^7!K7%zNC~9@fUqv@<AB>-K|(BrAew!&ei?ow6lW
z1cr=Yx#F_Jdrey}xqbN0rf;&*XR8u(()dgMYuAslUax-YEuwARx?6*z;VZ&>cf1HV
z)xiDvzfP{&vKc0(P%gVmlvo{jQR@4Y%X|-`L9pa7sn}e~m(Qg}CS`*e)`yV7&QP{H
zp94#RW*YEjut!3ws893D;!63`B{*6g35X)!$^f8$&#A!xxvG%8px(Y-lquhVMGMyQ
znJ15+;tEwzKJ^_?sR2+O@-C6Yt5~*6DD5Z201k|}M{#F>VV{eV@|_0;0{onesazaE
zNg&SGI2<3`-Fx)g#{GB%|IKQXHIFM$zV9gPBsBw=^?W_M`5bWB=8y;O?h7uj@eyYO
z-9?k38Vws5V2FYwNJXzDIW@uU$ZsfS<0)s@LKd-9(+2JY<ca!moH!V}-|BU1(N^p@
z)Y&KvivbH8_P!jG37Zc%Pq1~YlD{{L2Nw^YyAFss4ewcujU$XT9Fn`mm&I8jgThxc
zX3RJ_x2;kGBH2Kg`?r7wTeQ$RUN9{g=b?Ak0`CkvPsG>Z?kO~lCARKZvML+4?U2gG
z9S11$<upivOJ2`~nY>2{^wBbYbn-=jDI;Rdj}2;MqtpkOyN6Oykh4ye>a}k*a&AG<
zA$H9&C#;bV5@10`cy5!Q6NVyS?{zzJWK2~SjR|sK?#JOM@e$k&3euA$CaW6&D5bOs
zV`~gOq_7LS>TZM{_eay+to1X|k8l1c=X$j;r5~X3G`d=6)&N_8wVL`AxJW%6W^R6a
zq~cqE8`(?BZ~r88{Ps^Bf_>a^kPirxRi;WAc-eV9<010<<>I1R)eGFy_#nRh)A;S5
z@`t(h=T4h92>O$`mNE&_`B64GFBWG~>V}xFFSg-iHVD`P3@P9HC|kH?0xRV{fHgWj
zWAI~BMy5b_wVb+dWFh!Zs}9124}F)mZ9zrtUE8y;UH%i;dxAOG3r4&Lb{V}06-NAU
z$c;uskjII5zR!VPd0b|KCDnr#*zNHE7cF}?kPaW%Bha<<hjDyo!O|%t62s;h;hf0G
zj!|HdqWQRY@5;3lwjPAhb?J_njR?#h8Pc|Vu;p-UvzX@t4)W~LNz_kAuXQe;4m6Z!
z_y!)><Y8AfIPp%C$3;x2x4pM-{jin0g=kX9Pkam{7jd-l^yWoVOvG-e51ibvhSjog
znv$#@{pEN<-;()buqs(xZXTdvABv-cyru+WtX@&f53<#}p=%a{7$9g6Sfurk0cljD
z3pijjIyX2lLx4zkQct-ue7Ts~(18k7XbgME>kBCdMRTLU9E{r62NH_oE+l?@=pG-M
z$G@Fd(`nrv#s3~<>!qlxq-vVLUrCe*UC~=MB7jW*=!XHUB*-i3AM91G1&xA`BFLU}
z8VVXV=+A)WQt7pE_7tq<WWTBtU!c;&NOe9F0q@az0X39RY@!r?6~8%8YK*bf_$k(G
z$;<h&y^`z`8>h>)aOmb}s<TDGIav_)C>~l8L~Sr|4C6S;voM5rz64_juMSlc;>AhY
zUyQv*%V$MW97P^@?q3U>153@8m-g{LrUf#oco(p8KY?!0SyKc_*UgHeXa~B8bqO{F
zWw9xU`h7S6QWLV;+kr#_bR)$d+N2RtgRiQ2<y3nlui$o%={^Wz0Po{j+1f?GLxsIE
znT9|?a832#03m;NRN{dm1@m%;c}GqJgBipB-szy;?kadzAK_~=cnrg^f`P`oHPYIC
zh*KFbTQU$14A^Qj91g+~p#fR-kgp}R)F?MB_M&{R_FDLFcNyUw@_Iy(L%nPJm@04<
z>Slw!R|UwGB}H@^cOP@)XB|tS4dj$$gr<a&yT0@kqkQ^;3KE;CvEy#sDKQA=L*Gd-
zBKjK>Sr2^UcjJvcbK*K?(db4S#(<;7f_XHG>vXItF@A~SU_2nO%?W$w=&Sy*SP_cl
z&}b$;<q&0w1p}<2x!93oOYAXdXW=gSRa;Hg?vRo1L26n0fq3DD^agNBh$})vcpI9A
zkAZ<gZPOAWcG+Q%2WT<H01LQ&pw0sd98(dX)k5i(0jlt!kPTNHyoh#h{F-f2gJVms
zK9pGA#_kcTj&uch==KrZ381@@b0PF5_sMrDA2KRS>K`hd=v&n*Zwa+K2%&6l$m<28
zIFkfcosP2UdL<E7Je6Wb+W^Y**}_z;!=y>D<CgCs^ctik1bnp_UzEuNh2hWZOSFy5
z>uGfgD8%j?6msxL#~V+niSDz>taQw_^Y%vm6Rg+G#NqBP#7r&e#or<@+k~c_CFge}
zIp17x2FB?`+TXf+v^hVby`xnD4we|K92qDa;APO=SA(h8lxv_(hfoB+KvQ2+S1E1V
z##)~${^3My^jaPC%lUm9Pn9oY8Cy+AjxlEb-ctiEdZ59u9+)$k0iYuZ{2g317fmHp
z#bf~iU8Lf7wPav5YH*z%Wt<-%_MD}09lKR+C+C4xHq5~Un4oooV1xE@<gC_8YqH2o
z`Jl*8>e?N%#ZaP9Dk@1Y&Jl`~gu21yv{9S3z&Sm`n!<z`mK-sL+gi`4fYt>?(MOq7
z{jI_=2PSJ>(PU5NVp0cfuL7`{(pCmZ3IE6kyA#+;r;$|`CE>06^3TQ#fRRrtv2|AJ
zEK}93X{T<HHHU;0!Y)^8qj~~ux0Ha18LhdbN=qRQP=ts|6p7S>Ly8C!F6+gV;Z;dD
z!JJME6(h-(>aYU!{bOChUF;Y)G!7=_f~GdgT8*()oYpgxCBI3vOE-RKL?qdhUR6_~
zeb`Bc?A_m0afumT(v19_4=x-lxj5|ZX;c%00|pMvVnr!q7l*oga%8H-Mg307zS@er
z>b{YqxPACen=pe1W59qdT$D)DnZTb!{QwNP*iDL`z9#8>_hFlF12e;kia$sE4z{fC
zIPy3ty(F=HvQ04ACZ6nw+Ud^u)ivjAcF&Xqzm=63rB=cVQzjw;xT2L5e0qu<6n+cl
zU0uR{xX|wCwk$c-CiCWctW-AOwZ85}t2WwT>PgrcEFrH~EnNtzOE4qtwiQ@aQ}o6=
zVFCl$jQg8C-D1DWG~JZ)M-dmEp+}`OD1#qa|8(mDryL?E&EPimS|5a<t?9}nv9R+Z
zbO-#4xiFf@g^_w1x*nq0DAsX7Lxh5SD12b#RKmTH?3n#cO%^YwSOPht0u+N{8det{
zrCXFiiv@I>qS7S1A5Gx>U@oUmw$eq25$jivwXp#MOTfj>{<e<$fdU@6-WM<<M<pY=
z<Ka&RBz4-R9_%>5p$jeqiCr5#9b(O4_sgm}L$H(^xL?vpVz<N?+d6~-lfUx;nztZ+
zIu(|H84X7K3StjQkG5D_VUbP&7A}<Yth@!ETdcqaWg230OE}2x*;0_Nz>4mHND@Uf
zA1^pI&LlrZoZ<vimTPb3A<G#WS7u`gUoEX1Ag-5_vb`+bzz<PhzW3#b;#3<)BX|N&
zFj=uUapc6z<}NASv$BQD;ttLDF;DdlM#7a9QuKPcq{W-nmxN(h4jpN_0fK?5@$GRV
zUuh$qmkve}SKv-rdrks^eD{C4-@#7ZyRS3I5ALR-DHL3BA%4rLTh=)w=M*a^YP%C~
zS;7s8<gL3<zF*c0Oob~TGPV<JWn!&3)XEKm4mmC-pY8Pm>^r66-;hlVawC@Q*88ka
z4{_&Wqk7~?h?P6cvxVwUOxOZ!?ehQ^h&EF+Ztl$Hoa9eh1o(*@A^0Rf*C^;9Qgsz3
z#O;Df?-o=HgJ%;kHV#UW6BjWrU9E_B1!p!;<QQq1j72L)RBp>LRu=CW3%qTEm%Kq4
zsFhI&1pQFmaRrf-FTlBNucMqer!#F1wvcpvOu<1_QDb`HD@HdL*8;GIW!*Hu($rK?
zGnSn}#w#=SfFXmTr3GV#xJclN^8ulrkqt-sq2-Eu`Z!p4|Clwi&U1Tv_@^?^?&~N{
z_{Xp_{F5NM@94{0FP5etF#VMe5aR+oE$}~oPepUvt&zgJu{VmZ<4(voBnG+#rE4oN
zRZ0;w*Zu42&4~Zwvx7GqJn;0=-`^PXWl4ErY8pjWPlhU%S}#|XWA$8h0MUfp@p<p4
zh(%YB%XwDg?5iu`v8ow(8AZfZFZ%!82rzW306M6g6c{aXVX1w{(zd*{<oJmW3%)<T
z@0qas!&JKJ4;%Y4fC_&9LW9Tn?+*+ivw}lgREs#B+Ph{}ITzn$3@m;j3{N$|W3XmS
z$e>o-A0O;U$L|BP?t5?7bpqVZxd=_4TefR64ji+V-o)7i_634tA(Nq#lc%$C75e+%
zM^@QQ#^g@;s~Ge&b}<=os{KBW?8pfnXNw6r9&Kbp9%cT1>5R!oZHg07#d8My$0()I
zzkngSqoBS26)e$7g4k?|=0zY=Pqf}9<sOp54#VWI!@WmOG`09UlLMT{5#!ulNUm9x
zvx3WeX=ZYR^3tk8ccjTumH_@R#S9B@Q=BrApz(Bt`9|EjPc`BPf#mcm7E-O0dZ2D3
z&M<P6HZ7aUs#;2LuAjul+%bJ^OgL7ZLGg3PZhGBB0RWbMIHJ=4UbyHqcC0Pl5NORU
zHsJxzZ_s$=;U4MG`6AMLBtYy1)Uv|@0Ljf03qa5F!K4O(!QJf}TxtD5F_h1QA~<L}
zYhf;!*bwhoE@RL+9BT|-Tg?fVmd91tRq?gG#5e;YCF}t;!A=x4mdXv(KO=$+fS8$S
z#=O^?^8~6E_SkRRGr<{=*?@3=1p+*V31Ejbc+U%X)Kz=ra}YmtoE_eUV~CUzKT0g-
ztobOyyqdldcQd85fH04qM&m8!SEfR3HmKtM@#kiU#tYv_oTL)0b)pq5n+1t&0diZ+
zj(aEcfu2Ega)<^KM~aDaus!C$n;8w6Q;MmC<XoCC9$uw+fiV_jm)vo*bklYR%Qvt)
z|GSKq-`;eZM^>GCz`L<0i>3DV&em4`RQrU6DoXR9{w26qyi0q{x>=%=Qrpi{?dxk~
zMF@jsE&WQUJQwoAP#`$M<y6ObRkqsw0!#xl)#g)O7ZX5j$iZ96Nm0;B7R(g7BC>_R
zKeEthBaHjPJx<LP(CzOWkuf-#QCMUr4}g1wJl19DK}ij``wnDvxhj@jqJpRYrFW`v
zYv2mgvc}LX2sDB>4#lNON)lnb$~E8_UEtKf2&<AM_AGV<DOm-4D9m!i3VsPjnE22r
zDsoe*r#Q~&8zqzXcHYq|TY@}#e4QW&mJH~~CBy*{w*%%Uc+0Xw?5a5Nd@=#UP#9P2
zh%OjSW{5X4dECwI3j0ZWDfesNP6kr?y--TOxA*8f!Wv45<q_tI2X8=uJM*vzC;~$u
zFL|7&1lNVoK-4%RJz;J=Sb;I8{IXVn1<kEj{49>m>jtww$U?Q5A)wUjPJi04k}mue
zjY>YDzXGZM=|#D^LU6jg1at*3DB-Y$BPSG!2vnvECbLliNDV0;VC4Ag8_2nyaZyv(
zLyrwnYb_ouyT-Up<IN5$-&usCC}z(q=VZVm)Z`ud*a6`e?eRN+{IXRwM63=$H@2=z
zY;#1Fog<#Bf2z>jj^Dm`{N2-ylh-%D>%1m}5Y3YkB!@N_z<vJ1<0t>?@t?YV$vKAJ
zvH{%<PN3knk;a^?>ZB!%xdvSu-84rzm<LbFS$*kb*l)m&;&X$8LzA0~e7_eyAKx5b
zML&$dO>-^`Y4Z1X*##e-dR?v%c~+x{QuP=|i82K(&)N-ER+Ggdw`8>9x_%zk4KGV~
zUYnt8cDQ^(*@GHVve)S9q66itwPIxPFhjB@hKoXh_C}7S3i1CZbRd&6pohiyWIQn^
zT-`a*zPgL4wCB+?4ho^>%U9m7Pc!@c#6J&@UJ)&Kc$BD~1iIe5^AKWL=?{uxr=Xk6
z42=#GC1K;*(Cf5qHntGNF~ALiAU;Xh6LzyXz$-~r`M`aQSjauh__<abrc*C{9a|}l
zHSZHBP)wm)3Z@>}iG$M+T{ryH5;~=QxTdBhDWzo;8_1)#RL(R<jp5x<5tSQC3C~mz
z2g6x)Ks-}G0!SWX?$+~Ddz(1<Q9==%elX>dE%+sacPKKMZXBm0@%!|ySF(e_Vyz1V
zUt~pf!xGyF{orvRV?dz=^x|k@I+wI^&mB>cQ-}juz|)%?7VLb(_QZfl6z<VUA+usp
z2wew-cqPGkQZG)cvo%>%v0%*y&Q2Eh8x-f0Bmc*`#Qh4JTCPfHt-ICFRH^e(x8$M$
z!WocFouRx?dGanIad_b<t$2_eS5p=%^dQipBD5=hnQNeOwk#aiCSqmSw!~sB4O*Uk
z7AzCWSP)K+xXnd1BXv0%1gix%8^<IykjXA1$@EYalo{Zz^ZjbEUo-BnEKKASyb;AH
zRO<IwXh)g`CJ%RK&#CmT9e$s&<6(tnWgY`;g?vlxo&2rOL%R|ZOLj`xLSm_8-B$C4
zcH>;>o;AG~giEo`P<LoIxw>9A!8P4832O$G3TlX2KDJdFMq4>}X6vT+$zh#kh!Ul(
zu~W4}kZ?3!QMk7;^spXHOnh-AYZ`L<O-muU+-e}ox8-16<6woJU68CDfl55<btO<p
zJV4Hn;tR5x2!~>{3Rnbw5j+0?E+INLT6ZpsD_{_DSJ3^2es<uBHYLOculiafajB{&
zKRiDE)*{a11Jfj8=IV8a!;?S<)o5qy0`5Tt*z}U!W-{1OstS^USt$MhI*>3hy!bLP
znqXL4B#L3KEV-RX_!LPYEzAMy+2!zxXC8eHqidU3w8~Ig1|){CH5u}nm&`}n1BRQz
ztaioWrd|-af~!E-Tx?P?5crL*dJj#)33s?{BG_92@A_*^w<IYzf+H{8qM@y5Cgp;e
zEsDUgHGvA-1kt-3OclqZY#q&z1M-|2J_B~R0_!GluRyoq0)dF=!R`Y6ZD0l#$@s&}
z1`wm@OL0J#=U9YrS`kn#UKS|sP&?TmbW8>Qk#h#_Y>F#En+kZI?kTR?DS*tXdD5n6
zlWkk~n@@n1;6>;`E}Qi*P?C^4Jd_@H)Hpi;&S2LOB)V3_KLLO@yx2;c9rMYxq~6EW
z7S;JJp<X0ar^P}%rCS!TZIFl=7(|+KUQOy5uIo2q&yWuY(Of5o$-;uWRUn3a3)lM@
zDLM0E^-j~dxdrc_h+sQx%uaMDaL=**Dfqrh*AQ3xDY8AXO#_B0PorM#IcXVEN(+rB
z`&=VD-Ee+fRPTpJB&<{|O#+yQBR|1HXX`zsjPo#{O2ml3h^#p$xQ{g~3C>0k-?%sa
z{6EI-`a8mZPmVrcH>=N~pwaB}|M(ne9e&(1k&J$!jh2Lifj@)W<+K*(X_lM}eAV!U
zGydGY4SlJnGkC7nCv!)cp}Kc;u-;Y5PBP?c_AIz#yV~I>h=kR18i)z9MZn4@H`l`g
zo1D0kt^BrSADbGtaXOnN_OYqc+sN|r^>;4Vp{7o5+*Cuyto1pybEbi4<4`NCh;gU(
zg=*XAT#(aZP`H!&uG|U1XfHsfArBPJ1RnsSHIU#2O+-p79`jj@%}bH5&IXT(`>U-p
zEx{BTA%FyZ$t^ebPHT3Tg;faRyl{-n;9F@yL@dZH*qN47c{8VDRT&ngGTdsB17yak
z0fhB&_MQ7*uyiULu`Q7m=KN~uRtAg&jTG4-)G@4NOc?BL>_g+%rB6&ftb_?V?#vjV
zFAnx28+26k6zTM&%)`|>c{_;|PO^}#S8$&R&GZ;LawA=!Gg3`6@wsH?!CQY?lcjl8
z*KJT-Ei~wc)5mxi5}AAmZD@FxOChNT`o23>bEjjIAq7a8xE)%HD}pzaS{u5aGX7?L
zLSu!v+Z<$@@_hlRC?h(bmtt`X*SrW;{V#N=Dh0;B8UYd#JDEV%!vOyVP*i;B8|}Ku
zaHy~wY}nCr@2_8dJAYS}O9`OUaNb~c*U&3mPbs~^J%)S)s^E(4ZZhY8O)Llz0)Xof
z@dQ;@l<!1)$;%ql-2~GN^BP~^U=-Y834A>ZLuSL7qvVsO%i6}-0K|)AQxvX3=4QGV
zS9M!EAuYBF2E~+Z@d$lrm4sp7=RrZyb+Aum&rHB#tBFxq76t<yn!tq#Q)R-SGC$+&
z#|2ivxTfMlD0PCq$@ubUaU#JO4<v^(WFA>|-PT+Mg=(;43`V(VNIOVvZ;;fjd0!qE
zu0Bl=3RI(Kjtg9L0l<k31~=322;`eP)|jKzUUJ9om`|8<X&?g&I$_Tl8{Z-2aat}B
z4RK-LV~E2QjseIYZP?{>nD*rfKGk~Zdwu-k)wBEwmbeG$dBj0YlyP-YR5K|ajBwK+
z%p>@JHu#IXtLw{Vls~T)>-VGlyJC`m|0@6Aqx@ApbMl(|<*Qd;k1~vxBs~*Ea3&ST
zy5XUa+Xq)_Iy;>Ry(*61wzQXPs7N2xYUo`Wn)u2wfcxtuRSoMXxGLK!cu)`}v74DL
zw$epLI>)RtmSL`EsZ%jIISi&JZiRxTSe`mMvbxt!vx?;=>qdjo?n(o@YVj$P6@uG9
z)d{w6QTZ9lQ=W(gDlS^On{j5x;k%}7>QV3%o!jdz`TRwc&7TS-KvJtTOyup`0QrKV
z2B>B#8)(wuUlxxHFs$e<s21+5D-w8<`6R&<7_=#+Y7&%D8AyYOZH*TTLhQZ>L+rkQ
z`ja@Rjae|JxRJ)$N!1!3ABVKjt-9w{h0PG4&PWs<h6hflCf@pl5tK$;%nq{97f{!0
zLN!>?LWz4q!HYhN8BrCy*bl{@U905ID|}s3PEyP$sjp?wdJM9L(u<hQ?I8>c5HYl_
z?V>!xVsW_?M~r|MbzCQoI4>P{Zbp8O4PviP&0RN~ZeMH|a=!2L<2_!-@p)X9ZBuQ(
zILj!kV-_ZxcOb7&=0P8AlR8JdWtlH5u;K7XMS|MA7^Y@xuB>a#HD8W$i&|+E)Sw<c
zrT6SR*_-NHHtkhc*RkD=p`OnGT;IYpvM3|A5H8R>z<2e<4O`%3K@5y`dc!_^WHz;2
zxQ_`PY!ilwA6%3$kIfC5-II}#Iv0en!`PVcwpK#Xq3JwdSKf`Qk3LgS@J*@5^7`Lx
z<e|T&OyL>)wVO6fsXTq}|2=*`Y(|#!MctOfcjGw|9(JojYUQLj5U>c=cCxCQ#>;Tq
zaAs&jVEv*!!jkhhLALv6xvF!thA~?K#0VRI&vbT4WkfJRS^?59ATb4tr_ihvgr}q^
z1zLM3gj&|}Gyy<@Eztg}ulRI5Uq&kqj|dnZ18;in|IRv^bnPNPaoYOo%EOBkHl{vA
zOY#@HlV=N9%PwklA24<xcCurRhr@bt7FyCefK#E;+LN`RS!wI#Zm3C&$KjZD4AB8b
zM_`e14<q7qg?I?)<w|j&=V}q~moeVo5OyiD8#bp$dSSUbk01)d5*sYG6a@IeFRAE0
zK_aeCEyIv@^|AtuZbD(clTyMPQ7myC?gHcUn9TYk9|P(SLR1eC)=m{Tf%uV;)YN(I
z4dh2Ch=v?7L|NbqOXLz5j1Pt}K{kZ&kH*JQ0&a+R1$I=Hhvr$Io{HZgki$%^Nj?z9
zDvD-^f(RtvLmE=KZqFxCvmI?w+k41_`UfO(Qu3h%DF%Fjd-LL~n(U1Y|ItulI}ru6
z4`{}2gd8FUrX@_EDD6|`e~yKamTqylnDK)0EHH<@X`m1|E)f-MqZg-=l0@>PX3Rr&
zt0cykm}bHhyW?@~$JD`Eu<qZ2+;W}kNYlL(K$KA{Bnd`U+{A^G`3O+D%YBYHtu9n7
z>Eg?aEl0T-4SXn3r8p;%`D((n*NC7M#h_TM1w>ud)V9-N4mXcuK3e-AGBq~T5gK*`
zH&PS;1y13h?#~f=xpHg5yzJA+{WOdIejfe3i2hzC+*D#?&?{8!QduD}1SWWm6Rc>2
z((XS3F)Vy0sw9(11O|mB#%5iq-hTp1eOhAVOfk(sxe+S_*=-c!<UwW_IaDuWNm^jY
zru7=y{KwiIT1M>!RV923xfL^jA{gbRBe5yOKZAJ0A3*nw)0fUEU(2{9365&TsacNr
z3e3ZVQ_2I0^#MAjvsvKL49?Qv&L{u4Gs^FT0@xl6bq|^F-vC}fp}!WG4FW^HGmMeL
zok})cPpsPVAatLG4gZZ>{u?(<FKPRGLD`98PnJ=JgO(7C{(c($T}FSODlyXEXVLF}
zivF&mzhhtQI{N#6TW`8RiYT$WeSj*Ylh#A?1)y7aQL0j=#B7j8<&icMRRIZXzTRAp
zm~65SY@0CxVoZgcI%>ui>9f%}+l`^0;mr{-bb4rIunkN*QF01-g&T1)F*mHOg_Stu
za<fn>(N&DODE+cp@*9t52-kghfkNMx=Ma}gbFCUVG-!P-r3{nBDP35HpiMlO)%7ww
z%=yE7@7&$!b$(f|W>ZDr-18LyE}@@b!C}4kJ}ExigYp1;1_@t$a5<#Ecc~J9Q>#}~
zUe4sAjWTQ(<KPx0xOniSv$r1hgr_P6V9B~e1qZ09cjeW?0LoZwPMIw-L#|iOsSKG=
z>lW#!U(A9*0}pY%+yd7R!{vH6$}iF@Hu&W7v*APh-(cn1*YDoAW-sEE<9v-;uz|Gf
zLm}9Y|H)Ijlk+u9GBOsd5ur@Zapng6j%}rmy`MwocEPR$@)$!ME`(YG^`K=rbjQ=_
zMA-Ojx<~e8j?hLAy3t~TVa98CkwT)nI-0Ws^(mGdoTQ68JIuW5qE?;c0mRh$6L$q?
zLHvby6$o^c$i!EXHmUPVA5BApRLElyG6j}94_v{bxx!j`KJQVZMp4Ng&9do&L(dgt
z3nFxA-WHyvGgJ=s<MDBHTcdgunbuD+mr)mi^W{Y$v6|y2>LPGt)-auskl{agkb!Sj
z!waiLVpyWwgP0{vm-9yygX@<WAt?2^icqBZ{b5AXtXH%HCzAheA5uL<5m7aa{N$1|
zOJSNkWFFDoz|rWtF`PR6;U|d?B{wFuoZEMh=}IpPjb)~6F4{wg;<#e#fC-pmUjQwD
zXbFyA9*Or(n8-D6C>vhon%h2!prp+rihs}>nWup_b&;{v1W3JMEDzuf-R*1)*g|Oi
z!$`Idovdj*#{lZs2FO}6kzfo#MB4>>bp^a3DhEsAw>ha6HhrWqsnL>m*;Z(&;Y837
zo+ya6_Oo5Fx7Idl5~fl2Q}}FIl6N2g2HJ-P7JMt!7cne=FYhM2aNoPz(A**eE1~Sk
zMGF7%$wB_f!5)ho`}@B=Ymf5x5BYT~*3hT)-fn%kF7RJ>^H1)&|2Wv*$<EDtAxq}+
zN%N_n(_wN>^d+@|=1kYdmL6e&ALjr5?f2h3#R4ZQ`0K}4PhVm;|1Le&&G^h|r;Cg3
z6sd*J;oqOHYDaQytu682o5%3QXZN8~P8)E4{X6$P-XDGf|LrpfnxV);7T?v@6&#p1
zoRriVE_L>YU_=<rN)j9iEi+tpw%UMa_h9drp27b+e6j!Uf=lW|tMS=C!?kNWgK+Kd
zyGG@073H?eP_uFoiBRqdtV_RJM7e?u9)nw)Tp(O_)KpIuK&L$~`N+%p-EsCbP~{lF
zdc8pS>P8YA_lm#Wy?gg$0{@$8=l*UYBf_G`6Go`?>rdJG1-#clu7nJs*b%gdaN8SB
zLYPvD&?WsihJuhBaAa(*un4pAw9Or*(pT!b!;l=Z{asQ4t~~AvxFJPgH4=g)pczP-
z+w!S+VN%L(NB0%~!;W4Dkb<xclAu1^{ZKE;z>Lg|2fhbu`ZZvJ+^4yw`uqvEq(jR!
z{4eI9*o79{MI2FrdxCVZ$@&r0V6Ft3OhVO}ibG8b4poJkQ?`Kub{jHQsq74!YFDPu
z`-X8RN0M`MTWjG^=Us(W^i_@?*c?3Ib%l<qibKuBRi?BfzcRF~;Fdb>S_z<vc=5H2
zRo8~6j{Xkm=)th4;)!ag6oMf!JL)9gKail&%D4}TV8MyO4?AU3#ZH{Z>*<#BVD$H4
z!~?M6E+!{*)qLx~52q8<OtL-X`&FWcW_`MA57o738997JI#lc9*6%I7no{?c-ZZyx
zZ{=}MyIotbMEA#Ej1Qt%IVb}11F`2O2sJqW;?Wb0vUoCcr1-%7_QfNLq=XB}2VqR$
zXRZ{>>P=hwAOuWPL{pcabBwbxspk;8KrR3qujcMF^1hu=ghSLTXd~+x*xzQ=BX{}0
zz~19f9>6682L)KZe=Gs5V4^fO26V!j@!`9Cw*T|r2g6Usuit$7+5Uep)!6bdVFXgp
z6{3cXonYw(=Z8oX%q`(C0pWaFw?k7;h7@GKUa2-dDS}3#kC_nDUrsiCDVf>Zx}R=p
zWa>1{w&%my#&O3-Dc#0$QyWXrRn~M_Zkt83si9`+6zQ!^tT#2$5oyzHTyAQkm@OS+
z;A+v^M)Q7COXp6Hm*PR2w&<UIjfB*W3@{2ex|?p%AB>RnQzsP5qt=W4^t^XEePd02
zVQV{i%(((7n>*pB_~=uNdy<0k0T%j3CsVzkFNYFrxdaHcso10MgvP-;8G3KKypebW
z`Kwt@PBV<x1b5Kl<lfjN?5qYb#ypS^)(gHw;I4|IR7|rVVy`ggJ7Cr#!B~TO#yQzy
zpM;=b^M#bk!^Su*ftO@omV|CY9Id9p%6b`cVD=9-Gb;H~F!-YnD$fiCV0TKXD>r(}
zY>0bv?zZHjlq`Ai&+#^Va`{$4JO&!o`TFfAmv2&+!-muAVa9##sQ9a2-`)S+8!sva
z`&&<1J-k-bf^R;VeX_sHci1;dgI&o*hZS#_AG?hk#;A!xppVJ6kNZy1XR^O>B8iEL
zX1a%f{CB0UbFu$Vorz!PV*is*<Z*`1Ag4q^Wo`71ClAhl?tXGGT}-Nu+0O*$Fd&+$
ziR0#xLj5p4ccO_n1`9*$+ARY!a9Sp>{~)^Eh4eo0K@nv;84p>S4}w}dMvaX#RBn+D
zFaP9Kf|6h!z?wTZqag_|xFRQ@p^WG<rHF~>K;~zwdcAD2Fas`@V?$lW@H(XpPce{B
z#{khmX{tODLB^6v@`cF3`Lnj1$HK1IZ7TO0Z9eftD}H8*oE8bG;%XGfA9~i}H`#cD
z9~@ai?roOEXQH7yVG!4yxX-&9lkN7hZ2jhhOwmxpF(Tdgw{h+b<xdwgcaJt~qaiK=
z2fp?7*~FW6^QnB+H<g3`c2n7pr-Jv_&9{bAaJzfnUT31n%g!MhuVIFEi&OrOjf8k$
zLzOWGVwZ!^>tm+$ie4A<5oK$^TKF?)>_S2ML7&H&BJ+&9IXSiy6kM*t(RCzTytCbZ
zT=AbP3Y(o)jgzM)CV#3)4P9KNQfqldwSd?st-Xv;CJTSL;>!#MV3M3Rjtu@hDQ0jn
zOs!-Mmo5zg{gj|kLsVs8hC-_`nl?b_t<KKdQHE{`Gzz-5K0EN}vWy-Pjbz`xk=seI
z*eOk2>7^VR&iT2YE)D?3O7xftrNs4?E!Ao*x&!5VxDGK1o$@SYec*m__Y9oECKLnW
zTc+oN@fuJ7?PRYXP*8fKicZS2iqIZ|$Rdg&V*Dj!0Q7zqywBEBtS%+-hT7G?$6aw6
z;0~SGgu%G^mPG+c5p<VjcW&<c&L~9olS1Dt1G3RBCC%#=JYk=M-2<5f!Uj{sB$hr?
z+0<>ttZv96Wp){py{=SAA<G!IZ?Wh&;X{kmjY8XWlU^Vyw@zQGD+XQi1SB>v-O=G3
z;z2oGW0=SqOpZ_NcNC5Q!s^5cj(B#6?^P>0rvU*+@G^@a_JUoEgW}V{c=*ZX;FIRl
z;n0`yp;uQbXKEHLCtiq$(tPdf)-;(QrP<Rg(JuqWt|$G0faY*s?64sSFmt77r+cCC
zZI1$0n8i~ThiT|=lnF{c&LnQejaeIt2XSvhHTqUvy)q+e&odg?>&%M5yn>ocJCNv-
zVFC!~k}%h=l3O+`ih*BklD4zZ?R+{biel-jCQ*EeKm@^UC1ZS$-=itJwW9yHuXDG@
z3M<R=$qECJ$9evv0!pjpDd$R+n(gf~zVC-t?E8C<jxjbTnectxbZ-jtvDx03HGGYf
z<Pf`oiqT71WK$E^LVbS+Xf{C_ux~BQ$n}XFl>Tg0vjyRw=ZvM)aFGI%3bl1cO1gv=
zX74~}T~mX5<ZIa@woc7omdIH-Sjm=$j*8oE%mt=QXmVl(OTo|b0ZsMw2(bQaVsOH_
z_b1A4lF8D=4!fc?i-|)rUtLL+ZyzOY2JpIiGakD>$7BBUvx7JN#rDjLJEjM_FN~AV
zpL~wy3{r)YNyYhr=R(~VH`gWR1a$Q`+GfwN1_lsEv55V5LHeN`@3sQq*q=KN<to}{
zddAy4%3nJsHhM#g)tBk|3_odPS9y#<c({cY;826Q@$4h-p1D!hoL8qUnMzpnP_hwx
zKDJX>AfU~gY<m^zT70I(8^v}+&$sW`j&-7K2Cwny+65o9qxVC@PjNxxY!wyfuvSc>
z%+F4{J}=%c!aav4yyLr65S$e&(Yq_ertrZXh`tb}F%uyHU@az`S9bXbdA6q^N=zIa
zJ9Ue)!v9{ML{Y4q_X*hxP&j&3K(qp&piy)M#i!65hg;Cj=`F(R3s;Ap8OG;^+go1h
zCB7UavskL84dipO=};K*pVpU)!~sAdmjt%dDR|jIoEA$zK@v(^H#jdhJuMrL0S#-=
zny>>}NuoGMZam-*qWz|h`5inldkbdQ#OA)D!fg1KZUVZ3h{y>~8g+_lv5!H$toz1<
z@LHiQyp5B7SiHIE!kUW%#&7Qq%tO|gW}ojG*H+|+3J@2=S%x*iA-$U%WM0?@fz44J
z-A@#$1&I~eKnqaOJZb{58x(kTkKDg>p}n{YrNVuRGHlMUe|FHMonhcVgn(WVdHD0+
z&e|jM`I?kOm0cBI1xTWpoz*L+XUr9-4cFx;(=ctN1Ct|81}Y9XH>8n)l^Ydd(%`U|
zH*h@FrZo(OKZZd>@JU~W!t|GWkG?BFZ6?^gT<`_E1q+QxP1(EX3^@h20Nc{yJmon6
zk|{LohX~bkg90~?L4Y@v{R5D(;-s<P!r%Ge{VsQud$XRc+fLoO_q%Zm>TOa--Ma_7
z_P?4qx@f9JqVIfAf#Ypj6^mvY5*hXD+6f2Z9$aG}w>1n$B;hdJgKG?<1p;S}-G`6l
zurrjyd~h|&Z$6x>&yxchWl-{WEr6R;PsV+8;_hS*?C&9yK}C0LV7e;2?~W8QC(Q_|
zl{@THKoRiC<7hzOBCyf&5EKQ7PvhYZtK)e2ELa?Pu;V^8bI1w;u1<hJB<!*B0Zw+Y
zz+eA3#iwca!_<F}!obUGQju%+JRZ^cjzc=Xa#zbqJ*)bU`7T44mS@2T+~2z%DD>~d
z>!FwzvJMoM=Tyk8ARpL&`F<IU$NjzIc!<w}095|5SubHs@GrKkZtwYYR@bYbZ+x<2
z@1l|j)e;%s3fZ2{>uESH_rMKnlwa*s9KM87?^8-BMbkiaQ8htqxIgET{dy&F6C|Ah
zpf$AyPz@FN#}Vw0n8GfzSjAh5Pj*;d{-hf=?F&n-(N9^B7Y9;)=7&fFrJ(_dmkFvV
zE_B1haME{g&;4f^+uSH*3A%iJcYGhx$tV_dAgbo2Pn&pedWGM1;t%I*U$j^s^sLsg
zKLYssw?F>r>Dxa)Rw$N?%lY;4QwTL6CC@9t_{A<GolWE2#V7e-?!?rs8w^pk-3^oI
z7QfBD>Y(o1PU|?ULni0`-tky33isayM4FxzB#hsP%ev1G?#4qnxVz&Zpp@jkd;0?i
zF)!W+LvVj17rAaZb~`lJMm1m0rJCNnW;l4w$lYmRk#IRj+42JiRxNH}VD<Dg9GQEt
z%ceOcRxQab2fm#F9f_MOHmou8IpyfM-Zys{^|A`aysWlz431!fH+Q@&m-S`XNqxE7
zjYMvHIOA8r{XF<9<DH^#Dxjy{doJtnpK>!%U9kCb-7=yb@v2?K(^V1Pr|$3Dk$G6o
z85;R#m&J7V$h4kELxM;7;PsraHG0i`9Z2`2at#%*%52$`>uJ5uZKF#o1kRxW!0$3Q
z*18oNo|N+^ZogjC`PsSv6{9RQ?3ZyP!NUmn77*p#kZr&<<m6QV&%-T(p`){#F#rU<
z(PZ-bbei>|Lg0vS{Hs!-GEx`vh;QR@o_Bh(_dbJdgqOV50{462t%8DDnI4w3+a1!u
zD4)Nvj($5L!ossd+93EWb{=Nm>Sg`IoCCe>%m}EtrYz$lC670ptXE~i#Xtvb4_nM6
zx3!0IA7muGz{`rDl*==Ui9t=7S9F&N#g>lU4ILjvMRbjx$K$zyig<GcvH6ELSnGpb
zSH$haic9k(I^UV+-vu|;hjRVccC@?cXoK14gZ9?7dmazz27B8(yvTa{yU=?3yS+!x
z7E9o{j<0;bZs9+_QHaxy3AfCjeg1tnFoJ>+2|uzW0CI|rz%nXfXvDEv>>&aW?OAX!
zRTE4$pLy`ides;+H^q|xAt{b(L$x+qQ^BIbxnMI0v6#sZHBAkE@#u^A_UHVQX%>6A
zC?ya=z33H|8a-Cu0?m}>0M##(a~Ru;j_`SU=j(<xo5dpm2+SFyQY9?gRV~z0)rMro
zw!_}RkzlGFMv%@`JqG`_Zy*0OotO(IYFR=M7Wt+b6%ZBb?)<5SvqjAWH3W^fO{Yp+
zLkQ8$#))2#StV6W;t6ZzrwXd#tbH6H`%0fY$fDI9H|?~tYk+^7MHt2V0dF{>3O{iV
zf^YC1?|xUVR^fN<L9naw8C*bWJb7Uo3EZhnN!%Y7=oRze3m}gn0<YT_Xvlj|7?{Nr
zW(B0wqMEH&Wj4SpA1T`HR;_8U-V;Th;%VS;A1KIFa7mwiO3(nVK;OYk=p!l#N#6`J
zD)KNFUBojJa$E*OV$9)<ejB%VxF%*X$x}Ue4a?IjNk2{Ge!vG0@M{gYqatf4tD2WI
z9L8@)o?t**ZUr~gQ@7UVX6X2LKDhRv@jDIMV~%#SAtA3cLn2PQWi`7Zw=b-Pu;Rc^
z#Ktn0;|gAn7VsaPqFoM&U1RwTP$$S^ArfMj?<b^c?v%d7x?)@m7#pQf4*$Y+ng#;!
zt`}_DMnXv-W~wQPSyE>Uo{zXb+^VRAknneaHbX}-d_i4N46`|2+xHSNhRt5$-@KPt
zbi8jrzt`<z9Z##IfzVS@LGChe)qemsYoX}B9!-W8@7U)8l4Hg#%4&^mXBKS?L=gNQ
z;J1061DPe@bW*ZHJ>{7HU7$^AvCMVFWYM0NiJ49vWlT7ij>FnX21#Pz<OA~FRgI(;
z)ypACGC^TG!(S{l9iIna9Xex;Zx{&hyl&hO7TzbkWy(L~h!2Jj!bXft2HQr<(|GO@
ztWS#apD_p^622|+=R=8bcpBdUtAIrbwo`UOT*-CA!H5F%xuY3{cvB(!MPq^QO<r>f
zK?z>bYvNg(hvXcvA^>WwViqv61d+UT?S6Oq)H)xGQ@Zd)H3U6FKrlG%b#JvNS^Io~
zspvaz-tdU>QsnJRejAX*X+feF3VxwjVsd8Ujn!xT%6d61xRDV7F|5jqs&;dB&kI6C
zb|TH{qMXK~*u4oyp-t!e;<Ip+K{NfM7&*oQ6K9xrDv8L+Y+;@Y5<B-PdA(aVjGgjO
zXiG9!1U=T~(U=P9ixM#eDlW#Tl@z1W(eMHndzs@Macod&V2z;u<m`$-V|-8&2l`V~
z4x9Zt)lQ94u)_&Op~Ie0l0vpf60fRxHG|;Fx~rokMUz0-K2iP7a;h82LCc86EQ!ZJ
zVcD(x<rM)(NfBC(ZFGN`5adFN*F$pHss=&V;tFMfFhlOnph#Fvrx*#BZ_P@(%m!L2
z#1f#!R60(eGOXnQ5H{;trW21%qfPl54PQ#b{bfjrbaSsUU}0+ps+X#xSxp+{uH}>5
z4#9eu4a4QRMxm;H5!+mm(CE%bpq(#a56zhPNxy{eG1GYCDZA0F*RrM})GQZ?EDOBJ
zts@;`!`o0cW3;e9q>y-Ay>*33ce{Aot7R}D_h&w+PyXIFp(p3%<Q;&Hl;~`x58eCL
zEf2b2HMR5}#uG;gNU)^(`DwaIsk?12Vg8=8^>%6|H!qvZ++N&0pCU1bQ`)w)c<RjB
z(kZ+x3MS^~NEn;ljfTBKEW`3o`f2zH39TJ<*;X<_(*@yqbp>7`&WwyV61fKNo)xPT
zENxD80^pWD!4xI9F^hLpXnwr_vrskRDr|F1>IKON6p$8fT@VCznR%d{`zQS~e^p#C
zii4De5gwXYjP3mg>YIPE1NZn>(Z&3r2e+q%4U&b%`_$b)K1if<bQO{;p^$8GIp93)
z{i6@Ae|}$Tt~_#&uGJ}vQ*^x}7HS=h7~zSO7nbx`Twvs)f{IqpfgrFWHABRZodbha
zK2)2k1)zXt6FjkMCAHIwDf+qBt7sHygNw`uRA@B47dFprUbK=-AnWB=UbW(qBCz*a
zPy@iLQogjgmWNsefGwame7e{ZD4+uC^3fuIR_xKkP%Q`tqsNFm&Bl!5YxRU^M0=kW
zL07G&5}`&)NDgTIX#;DM#PW}`?-zm1A&<;cVWM8#`K;5qE?_=r-c`$`h4KQ_9{0;o
zI0jzKfz{TkMFG@WxOp8+CV<z#H8UuUvi25LbG=ld)R)fi1i9nDo}KCrQHUN}YM?(y
zwdWm}&qb7<8B%=Qe2nn0nR7TYeHU;Jc;GZ8U__Jh4d@&7>1k7@V4;n39macBwuX5K
ziHx#&Su~i;u3Wu?@IdwtW+|E}M!ZEsMQI!wFoISK3|Y&9swy3^ji#bXM<LiSO>CoZ
zt+T>@f_9_E59Mw?NDewST(|=gH4z_~=mWQP(FbNTk0RaPm~z=cF^V;1*uFS4g9Zz+
zUVS?Qn)_92A+?jU9aAw1dy#?frs*l)Im&pGcsmSes#=>Ph^}O6Ua)~i;e*BYH`8Kj
zJ_%{1LP(WZittuUC46tjOxW17aP{=Ez;q_GakNJ<n6YmesY{!0<g6%#5%G7yPe^IA
z{NV2JNVBigT>(*T@5(@+5buu505sJ<x9JYtX?t<9K8@H2KFbGa>w_G6*Vtwrf@HS_
zryPQEz;_J66If4<)k{yFSbwF$Cmr<Ny+zHp%%b+qADLVgydc4Z89C|EY*zr#)qL)x
zdM6vst~z(v>3Sx&82qR0q0=5PlyU`kP&vi>+lzbjS&k=*D^%fcV0RJE`b-#M;Br&Z
zF-p+h<mNNGFdTNKgtZW9N_Z1@r{so758XTnfxM8ql4upcw=xQ;k~*4KVxY%jZD>bi
z01{Nl-0&f`p4_(OYL4t`T3%F>a+n4$q-2PuW#EqnN?I}xbfhL}1s>R+BB%bT*}*h}
zk@CJUJ(x6kM**vPxq`jl`7{K&w10AaY5XtnS(Mg{@-r8Uwe=B^?<6!mlsWZ1Ns8^_
zP`Ee6_C}%kRHzZEJ;g-T)?o>5`P;^9)N$qR?R9nS=O+ZB!`#1PG|)h!--m%lzu$ZG
zJsmd3KVFfkZ$qF_m@8Td2qgqrov-Tk*?B4y#%FfbR=?XAC{Q;L7%+L~zofr+(x#CF
z-&gaXY&x43z#@-v5vZm<`Qb-YuQN2Pvn0eOwk?F~Mg-<NGeETF4PLW?;rKVS+#em>
zDY!tkLtH;o>=RqXyUVpU%6uK<9=$S<;{rN~s$(%Jx>hx4M~ZKVYh{5Nr`HL@D03pZ
z7*qg8CW;LP<m(m$UN`Gwx<Zom0uj#KR%aG`enJ*;DwD*?Xd&4`30&1et8GDFog!$#
zYDj5y)Kb`~^FPI@V^YR({j0_lpmrqmq{gL3cfgN}ih(7LvD3$#ppLd)P8d*yXOvax
z(S(II7@6u*`FW2A)SbLnVTp27Yxki1j+M`*?vm&1F?T<!;~7e@GnDXfq@IF>CSvD<
zgZ=%3!=YdHEBnj6gP|B|oml6ay}Q4Ec+WTJi=V?U_y3^3xRYpq`O-IcX?wbK5}Nya
zl)qXp+`oNE7k&N8z7DVOp@+#1Ex2;kOq<reIRiAqyeTelrDg?Ijy$QIK3^<`TPTPP
z$JgI1rK`eJgxqwryOqVGlHs{t52xms1woGe(fpgJ3JM%M5(d%=I8lrikM<N_zydGV
zb3nsl|54G02W(2)1)S9D6+tM3H_ys@d!I~Ha^Du(3*S_yrx9b4NBN*VbX@yjr{ps=
zX2^9ydLT5zoK=8>a1+h*Lm!5)$bb0$)wBOS%KuU=rcS*kg#txAk}246%xqXog^FJ|
zY7v1p3A8jE!uDk;-<OkhaGmiJccV?}`P_|b_dJ(yyEc$3&dx?<EG>#W_iL6BV4!JO
zgwMYaRRQY65}`Fvu`i17fZ)n?gJD=BkEkEVLWWQxw&z4$A8CA1F9f-$puX{Kb&SG(
z;tLw;xyxQuZLkqli@UJFhyBDI?oEsV+EBe;(rom4l1Wd!)f)DVbc&X4cRb808f~&Y
zn0EA9Bh$++fpA(J(X0SH$Ojk23ZtWTIG+Kkk$CJ~Bh{*2pp4_%s!ZrIH?8yUn8>M7
z{w7Aj-!`KVIZ7Y+AgI16eO=DV*2I*7kT|UX6ry%AxL)=o`awhE>}&oR6gbgd$QVio
zh+WDb$uPBT9pKMk9WVrJP|v0med=`L&07q=Hi@;MNL6l_S~HA;o^#`#;r#k5(3CCR
zdu9>zSw7%@1J;x~cxP^6+YLbBeQIc)jw*FSKL+0NpuYAM)n%gBq#T-zA@<cX+vqNY
z)Z(VkFd+zmi$wU`b8O1TvWQL6Nvfbpb)IANf}Tiz>crF1N$yvj*EuuZKUapdhxfe+
zl=Qqyhw4qFW{8{?6Z_j*4vdziMjtFLTo2z^LB3m~KDHC!ri(gNF1)i%u}5f>CAJ(c
zv$7?i0I!v!V74zQ7Yl-v(jp8Sdkoc(CxKww-#L9LSW%{KSu*I{EK>jvEP^S^JU;Mq
zf$=cuEr?`F$xS4_D4V?fbS5-bck`lVwN;Og)lafU_DkKQ?gyf@@RCr{?zn0UbRzrg
z80;3fJ%%Zg$|rasUgJyYcq5a%>eVPxniQBUXwc|-T^+Bh+u07R{*?`S6o1N=feryj
zw#T@TFutUW3xO+HOM$B(t(CpOhuf42KW<9#U4f2Fvf_0l_Q2<fSoKzM$c*C9Q~(c;
zO^68x%bJo#;y&3cm-Xa)kIF!Hdhvr6EIOeVk2uT2u%*zu<{u7CMpGC?&@vV=TZP&>
zp(z^LVJ&KBm7|?6BWZx2>=JMnRBkjG52#GKnPf7PzK}eYr&L1n9s`chV~Z-7ja@^y
zl;))%FmF*)xsese{R+)}ABF!8kamVKXT$K~2?F_Q&K`?)ZZaqrfjnMZ)D@)MI3`oM
z`(RZy?*IbzmFod=Hp>~%FPbx`Efcd3ja{w)XJZLMJ=Hvr;CUo8skPxmZDm8apji9~
z+LNcafWr*(gPRtjfC#xTj%;ozYq)BO2y0$3kgcfvn!6jpRWq%TXzATya9c<nlTijQ
z0xyCprsYc7?s#r`LpW_%k<@NU#910Sdqcpb+S30J+S329_Xx=9>+)oMmOm#m`6dgx
zNsshGMlplE)jSPoDu9dt;7T5n8xC#)A@4Z7cm<Td;;~bTX=^$RrJ2U#N1(^a1Nh*v
zDc?_=wCmUrh0M@Uz-3E$UlR9SI2s(~;)ilAy2Zn|l^<qhfi-NJs$raS5Mv7QrgBF4
z9GOf;IiEbQIT^m{*#j!dz<lYVbZgek>dSHVojaHia|YLg`xj#R%Do}e%Py*VhEAv&
z%j!1k`I2*85h)!O5{M!jl;gAUh|ZcQc#V{?uMHY%=Eb)H)me$paLpmeWxb*#95=TW
zhEUC&q}oz@{#yg(DPtH4qvlcwRJ~&E)?*I2p(aZd4u7d?G>{b3#fuQ<4UGXg$UbKV
zi!<QGxVLg>@DF>FvYZk2gY)FreGdOa-*PdfYHn6d2*tXfqG3kgF!#{Lx_(6}dK8FQ
z=PQHEn!IChD&y|#=+TD6%>~u-UHGDS7o20H8aM3mC|j*5@Bn>`wr;k(0#R=0EBq0U
zBZ0l-Y+h<i4K*6lsk+`s)W#+zI1sqi+x%=+pFo*(_Z?BFQtT)r!h)_Vbw=hT{0FS7
zDRv_=OAgU!k12M{c%1O=hu$yi)l_Xd3pIOFCR`aMMSA>Z39>-BN2+eaHA<#CjDe$t
z_7TRqBHoN-w#qxGO1vy)<$LDa3#V2&%7$%$ERDsLACF8@D$J0nfR8RvT(p2&1Qr^O
zyB<%CZ7O(}59-Y&%&qy!F|3+O#IW?Uo7kisp4aue&M4p^=qq?MuBEWxmkr(h8o*2K
zj7U9$xDg_%2U+J!zv!Kx=I)B{f@ts)O2yfrAO(_@oA6SnsWqwj^21)Cf0tFP7N>P*
z72%<-;^>W+(_W7-Ja-3=uJOe|Yb$m|)6L^=6uQ9Se1qVhTRDKqb#{e{;+1_(qg9K@
z)X6?7Zo!*-sc;+D`Lgy5=3WJyD0kDR8&DM+3n{n7<Xsj*_~SY~$gl}AKHn8Pf^4^T
z$*_UE%4&7M>bb)s+s1*G01Lp#S)WcdbCemj_N-?)tkM_2Erw1V=J~$ZigoElqwksu
zlR77R_Dx|bSWpr;QMnGZGd%^4d%uk+)jSFXTaDNbV>!LYvSX^_t}(wEp;yAI*9H`Z
zzUmq@1%_)e1TKD$QRW25a%n2uz^YQ_5C;0=4w)c>lH~<)#h;2RJ}ahE(u&+j11m3V
zjtt4Wz10oHRogdr^L%?ZL<%-L!S^OJ%YvEF=6B1{b<mRnmNPgQ?Jb;=Z!On8z0hzJ
z;$*qlxZ*R0AqIit7GGy6`V`<|JwM(uq@|-HExM2;V-2t}vc?k{V#s_&qL8O!qe9F0
zM~a8<%EIv$@9=QC+YJ*(&N8Aqe>Xp7$J8im7Pyu|AtGaz4|PtAc{SpsUhxkZFaCG*
zE;3vwbfWfAMYaF~ci26aOu^onhZ;$5lu_7WD=~n~;=&f3VxKg5cWl}#c7oCOnT{ZG
zN#S6)N(6ysXx4me9#zbia2eJpD<KA+K_#Og-h`;I=~5508gNaNlXsfyi0guzL5}un
zs$htJmdTOtNi#fb=+HnIiIW1s4q^)MnL^^EP%Nz2nGG;+3GRedZRL5jS%Efy`xv`+
zap||hnduU!HriPn{RNXlo!GGximQGUhyyInVl%=xQu#)j&c%84+T5<wS(Rs%yXdYu
zvymURn-R%3!*3^RHr?|To9=PFrd`LkULvFD43D4Z1K7t=zFyuYJL1N>d}zJwV?v$F
zw8!h!&jMsdsk6V+YBedXs!^>9X=#*iEJ3B-&`8PJNSI;dBwNHyL8ftpa~^!W>&$vJ
z7kfRy-y_tOsLqh%)!QAvoJgp*2_~Yuh8PSlKtFLUTa&$!c16KoFJdv#<W}N%r4A1<
z?VuMNxh-R3;ty@MS41N0xrnlg#Q!U9SW5QMVQ3y~UZPD9?bm2Z!yp*1UWIu>-0JGO
ztqT34sc%c;v+FiqvZ=}E@j`kWnD?SQroY%5GTf{Xl#R0E5<OGlB<erWOyv`Vn_c4u
zKR{KdHLXuib&-NjyW<~GVWCI_GJy<P9FTEAX2POHvB<r1c82K}&<?bzK?##oR03_g
zVh#*UG=UR#^YG^pos_1UBcLXRQZQ~GlMQ|Z9cj!eC5<F}q<gq8J_g|%Nzuj`HD+_s
zailqfN<!W|fGJ4?1E^~TUPQD56SE-aikGQU8ZMq%qnjU!{)gr6I~EQcpcog_dOk=Q
z2$J1-O$P0p37bG*bQ*$a%SFay+kH4kVz)xDs}UYVK@Bon*sAu<*rc>V8coz$q?vT&
zmV^{S@B-|5Pb3tXW{V;-+FW`w6d;O*iW7O6K_cHwDNeo+e<iKvzmcku+VS0V2$Q=I
zWqR8HmPifTk!E^C`X(XL?<zm}55pju8;DQYK;psB^x!vkHyOI=k)fM}4E@ng!hfYe
z9ZO3rQ13=i+{R8T-8%WKJSis8wXKgW|9LGKvrbM$TE9ky6Q4cbZpXAd&K`H-lDR`!
zZjX*e7;)t^W2aLm5m-A)H5;6LzB1bqB}j2n;wun(!4WyO$!uW!lLw=a1Ykm5_||X2
zECq}sICvBkZv1lZ5!^<vAc}6knAMAt7xmzgxO+hiJ3Gfq3*?#;h}v+XkE3XUZU(OR
zzAYDM)SEeGwswn$0VEg*%oW=a(+p#}*{Z<KcLY{IkE;_cPBCzC0r4&v6u{{!IyP+{
z*B5OY%N5FHz&l`sy<dzn=En^Bs+Mh)s45eoU@Y4lUN{A%y*gQY^m5ya9ZI#B%+?TQ
z!9+&ilY<;hEA)cK-k~GbRJVliAE5UN^Q1j;jvH(KnrNzV$AV(m^4Cs2Zr;2xNIA!9
zbVlToq^`41^&KEjfzmgu7Qq=0iVGOLnNmacXH>SSo^~7CgDtIAWwRH&lWe96he4`J
z$0bgBg@}7NI9!VUb}xc<(E{8+cn4CfktUNL?*|_@ZM|glVLbP=&dCqcYs$fj20WZ-
zR>A7iJ;dr6CH?7JAb0bdqYi1qT3H1?TC!0FNidxJRkhKJKwgB$R4751x=A}_dYPe|
zl;?zk)%aoN`xm+Hy*B~q(P50~?#c~G9g|#imYRc>_0DWfHViD_R}}f8F3H7J5C|L|
z=?THqG1NgitHa)M&wqUU_SuVP$8x>N-{#&zM-gh6l)kG9#Qy`UE@>L}JOwU6v!qH|
ztpv+;(^vamm%EL9S3bhWFc8LALl(}JrP<dO9ouo_g2FJ83nyoi@wj?d2K?;bk)!RG
zcZ!Dxcig}8J9sh&#qdr}<T-XP#1LSlkc0o8y=6vzI^c9EY$xTa)|Uqw6vXCqNnE?b
z*_(*P0&#k46Jp2|sACJ%RVPN7b20eV*UbL+IM^MtwjkKbHIx4p!hPuvG-#a|*n9N|
zFtw^D0Kyx2WHg+_QDYc9Dw6C01~>?l17HXVi)x2csE@dfjoaIO97vXY^$_AWa0N&$
z04av#)w>KE7KUM&I@;#*GqB17-@z{rM%JbN*qq5m!egTbOg3kHXt8}vq493mW|*DT
z(BGmwqx=NdaWw%aYDl}XN^TiaL^~_;6QF>+J;>WbL!<E^Xc3eF8!{@!R`@`=^&z>q
z2|>qhA@Ya$Px<Tp!#D0f_T0yNBlp(<{^bU=H=-BipVxQs7aV5iH~OkQfF`KD_HZx%
z#Y`kR1fAiZnBfOh;SGS4bs-ewOU;kW!$beD4|^jk435T8M$mC2FG_3`Mq+wWQR&Tb
zXIMAmbmrqe9*^a~8w~zf)IiTRSgQzi1Nj+*NkWPo70^gu7ncPyb~63Z7hsY)fxMq)
zP4+r(M`czJ!X@x=OkXf>e|Y)*cR%R;!hc$OC&zr)eD9W0NljX>2-(n|41yt+XICT1
zCfa2rhtW_Dw~VEC7-T)<aAh~3Yyd0fexI)Cs!HqtxFnA~auk)q#;>&)odm&3l#}L$
zTQ-Os07U^C^^A$XsKGPmO|7|GH%=Tuc)ap`0fT&yyzut;(}#EFS2WDup0!8$ojoT7
znG=XEcqdOef?5_8MhQW|-LheH2!EFd1uo=Oe!<Pc-5?zFh{2uyD%4vWW`v@4hy0H+
zm71sr2~EGm$nC#FCPRtA*)!DHvK1x+ct%gFHV?As<7H!eNlozScATQlWx`kj9SdME
z-rIEbeuWHB3LA4JiQA)aRIy&XWB;&)=b)kf#<DjdE*KRJNNH<cOtHh7Wh*=+LOpQi
zDKwsaAm>o9`Lnp%C+Wo8ufT$!Y&gm=#v-7k-~7+d*Ujp4wBdbzQY}6Y1*O6F;L};J
zWZz~YgRz+c?ayX`VzC337qgJ&#pK*Amd)Pt@<r9?d-U56kB`3%FSOL4VYuLC4Tp?^
zJX-gc^@>&yOD}`AJ<P>)5mYV1nq|NY+}ut$irKUN9|XJq&!p!?W(^e2E}={XXA4xF
zrW8~imd9O%oO?5`FNl8&<~cfC+>+83-XGuPv<dn9z(-wDM$H_oAiNdbZsBjtX~1oQ
z`D7O2N(6I^8!-2=TTaI~PsfsF=UC#m^(A=UsKyiBk+!odZA<*Dl4Hce4{|b5lj%T?
zB^l*+<AY!?#s_<ko*<7^3G+EyUVKW52Yusuvv@l*j)HJ#g*W6nk19aMvM5{kvIvL9
z4SH1sz*}ii05X}%l9#*OM-M5->UpK@iQ`p|kKg|J@yo|A|KvTFJ!|fmt-)zy6ue6^
zNv%)XnOs9!FJw|L)qX0~;4+^R!oU3S1aM&3{J>XUE?A2E!m3=BV4<<^jN{Q@(imUC
zpW}bS^@p|kuG|g%UUcl&ugT;?kYVmW--whp%ruOK_%+1CWB$!wZS?_m4o0m$>@@pO
z+vOzz5(SvJ>uk>RSH~}}vo!*`%5;1f((z%Jj>U49B;;>8fH<%mXTUF%P78>&<q*#l
z<l5Q1XeWvQ7(5It2D`7xpT2qa;_K_uE823>19apY56?ZaGF~M17eSballC$y^yY0W
zz)Z^vL9W{5te|MFQz!A466F99ZnI)SN5LEDVY>($85b`olZCvY59&DHMhXmT%64Hl
zaSCB|klYPO*{KiC%m<Tt<v7g}GHwMm7aiv1;>@iNWgoej4MJICc$CQr(pREM_<+@G
z(8JT?7uO|+Xoj=8n9iz`?L@sSChx#R&mU;uZTR?xg#G;c$6r5x_SFZ@Me4V2pA5cv
z>Rt_Mv!42IuRDS7zQ6Xll)*Ovt${dND1$KJ9Kp{j<%1#5(y!&$1)=goSf~+yL6gu3
zbd5%-g2zmnotp-QD=hJO0#bQf5hk6mRqwhC7MooKvef*i<ucQCDM*@dnA|q3XQd{~
zi@>9Y4Xw>pjS3M+T~I=TB_Jy@)H5y>k?PmSySVSpxe#TN;Nka}+TmHiCTYPSqlH>h
z`Y_USA8QJFW%C{vy^wyxr?zMC-FXS$m@1>QaW)AuWh~bt-jwQSz%fL_Uc!iO-FxA!
zd#`irKK|iZui&Vs1|px|ej11IG*~|mqoUR8HZ;k!d{6m=C#)9%0aRyeNHTt6SnM$*
z1WV37e<;wSP9D~8L00!)ZDOPA;;pHa#jFP}vqU0}BVrWiY$lF83!}@kK!0BOn#gk}
z)UU4g;b+zYyV+o2a=Yu~d8+5<$*xsik6fLA#*;BH03o7jI*GoS7*sX@kafiFlhcTA
zd9`K}Ys697TiCNj{K?$t*+55Ltlv9@2!_l<A9mQ~kMRn<txx_w^CiIilf-HFR+o5u
zXl9jy0_nHSkhc-mbEK@!CEY_@&)-rgdbtYrSRMxV+qQnuLAHkIGYxP+VqDdiaafdh
zFH+2jRzuP(b`jRzFR_YG4zNt_ihZ^SwQP+=Q9s3tAD=((UZIBb96So(h<{H23QxqK
z_=@xuQgu@X1IaQ}3#9!3I2Q&&Kmfs4FTQ~xo3sOoarSZ@P**tx+<ad_2COC7zmZ+)
z!GnkSPjGPZ*Z;2*fR8}<{cQoxyQ4S1<gX#Arsvl;u8k9fFNQX-HTMKxh6kVwqu~QS
zd}ux-z!CSu&w2K5|E6aW!)54^`(RpAEd*@e{au2l;~wY>m*<FpfnM+BPG1=9RbRsF
zA#Fuptxj#rU}Z9&{RE9WHDS|BZsqtb|Lje2RHAgh07p`4sqo<_e)u}|^vzD|AUy(k
z;y%EH7cv)lvb`BiK|P^ck@EN4e?WC5{~kwGx|iaQUTph7NBFvrhTi0k<djB%>~N#u
zz+wxp^}V0rmlMb5-yxuV_HR05_zH*e6ZA5+y};vNsP_l)b0B{qacIK*H?<J#ihKGC
zy-0@wJNg+RU#j=AyRTDQ{>DCxzvzq-)<KsmoYAN=BloWCG#>vHmHh$(p%-c7Mpynh
zRF(11cD0tjUQpQC&-p9TnSZ7skH_JRR6eJj_Y?e?Jd;}8tA@7Vhm&dn#jx;|wfv_W
zqyJPk;^&yHzz7DZWgeP`OcnYW&f7N*Q7WCC=+Fhd=9<EPV-uauJz2&>NKc*@(u_}N
zy>klTEb)7Itl+(F|4Sm=ME~)DhvhX?9v;bnw7Q%8Cb{*l#m*FEls^Td#I$8U&R?Rf
zl3(#_N^$;)QoqY3{rwBK;U2t^FSM`ir!L8kf8M~Vf96A@qmaHv;TFetDcqz;+w%Tr
z-S_vqk3Q`_`n>z-Kf8}U={|~2Cmcz5{@Yo5)O{PCK1@75OTK)TeEDJG+5dgm9ff;b
z=;h=7pzF&m+1jpHv^>DA>Xtu(-+vP<H~EA}=#r?_Z(lkc@YQ#ZpFhu^Jb(P^)x*8h
zx<<h@dk(3^RN3@F_MJO@-;^i$!M*(8_YdxW@!;SO`ByJr9p{I44<Jedn{ZA2&;5P+
zkkLYOa25%88;Ek?wYi_|@1y((hZRJ@b`FB%|M>sLKTssI*>8{?eC{-%27HX4PwNT%
zdpv2HTj=Ai`{&Cqzkq)q{O<l;`)~N?@QZtg|Ks3`gTpWH-~Zj=J@?+hmtWpL{2%$<
zTj+c1KWlIZ=lTCwpEyZ$z2UtrzyCM=2XCmKoGMb!>eYk%H?$@Bkz<F&<lWf{U>)}5
z$8Yc-`0=z}wEL&UyqaA-$iFRT7bPIxjq=B<3ety~V&RCYTvey=a_iKk{bE*~EgoPr
z0o0>(kLT`st`_?kP4FPUcX#>TJe`%N{-G0>&JRZU`Jwy2d+z_ffDs2n_%rB~3pap2
zfw!TEM}Y5MmekV%A~9$BxM{Cujx|)R8{vdIJA@9F#T25q_uG2;Aiq2QqMXAw^7N!`
z+j^e(AsD$n-89R6d74=Ar+1&;#U+Pf-Lu1@Z|{!pQ}-trv&m1J8nVRX;{$xdH9#)Z
zWHUSf+sFa}EbzMms<*z2$>jGvWKu28-MY8B^HV2hP}!}pO~;BW(EES-kVar&56%g+
zPn)C%yN)+lV{VbcV{DTgFk{;M<{LgLur=5lEuULW=;)lu?SPh6zAEm*|LYlv{^*)~
z&;p83n_iyZeDizwe}=*y<iEFjs5HP$9?C%))0Ju_a<(e2{AsBE=?+6P2jLsv$EfVr
zV4Hae8}Y`@Gu4IA(5jeL>*hgzNaVRcum6ASy=y}oN0u<WU+rJfW_OGP0wXz>S!2kH
zLAF_A@B+>xlXzvJ3n&(9jatHH67O$+&$a4Qb+-_<C$sx(G!r9r*S$`iI`{MUwc=N1
zc7w|{UemM5u(C|wvj<tPJ?UJmk4NXr)u=R!6A&KcYxr7|>^(}pf{}ID_$hZ#8v^>e
zT@5`f|7^_s`+Vl!|DE;vm+0e$`~TaGuj=vr|L~h{{<!~tkI(wgOUb|OcONCR-IwiA
z?JB9SH~tLgV&j_!8}$bp-z4>K9&J2)^zf@>c+pRqz-0Z~-SyMw$-(QL-K3r@{o5WA
z<%JdgZRzg%$@AoJ=VkLQc98tMCc#Nbg*u_PCqEt@y*k-Hxx4;^MsfG2yX*UEv~>4P
zLO<100v=GMz2?d8@&2pR{i8!yPsFyi14`I3od7W~B$I1r?5U~Q)%e33f>M}Rbtk(^
z_I|(_YKUjC7ZZ~}Y!o%BZIlIbBxlYdvwnB|;1wycE-4~g_o_XbB0fVQG75y9^%qHP
z#e=Kg&a^$Uo`n%jdmYX~lg=g`j?gNu|DDbNv&#S_!_hohuSS;jchi1<jm#fKa!qo3
zGKRomy_)pa`~aNfnjPk33@)bT-Lqb&O;MCbys~b*8a-9ky34kan7|Q7=`8urdKAgj
zFO2M#IOvf+3s)7xr2ES3R+zP~)TfYa;7EVn4#pQx3Cf!x;=D#Zv>tCy2Iz)=$pJ)N
zXg+Vg;a7RxZ`^s>#z=IyWoF6HkR{kEzuf_-uv!dNGH%vwYx>C1&@WT+wd!09aI<F<
zYu-o+x+q>M<;z46!!=?D9qv_I24LyVI^<S>cBsRi&DCn-u#!uwE;OYyAP+_cFdjH5
zZr1NUxz>n%664M^i258fq=5d98F`>j80*(v<Ohu$JMdG&@&3G)-sSVnQ`pZNY5VXI
zmxB*?k@C<r^%Ef*T^=?9eYo_#m^*F`G<-&K0POyZVlP0EGdeL6`8i*!c9-Id)9LdX
z_6kneTN_l9F#sqU^kT~T5e0gd?Z~yrlQ+s)T$`okpVyX`?y|4Upri5DBQH5NHuPIY
zr(SAHb+pND4<&XHX&V)#I$s*H7@hPkWudHR1zU<v1%TU`EUQLXpQ65;y_d;!6@h?9
zo>cu|a8b#``AyTk+Km#h4Gswfntq2N!d<2pRw{Blo6uGjw{g;=u;74QPSV=lOk)KF
zFpZYrFss1i-`W29y^%u&SIiOJE+==7#C+DJZ0%vplPQ)weZ}BB)YFHlZU$s3>3q<2
z%k{{q@M$?qt_G7S1}Jy-*9TJ9<G}z%VUm-Pk27A>0%o*NWyXkW=p?hhoLgQ*TABXB
zW6SYSpzlmPSzzDDW`rlWj|VncqE?sg3KE#6a4jD*F31_+3DyX4gNc0+!a6R9gKuu0
z@d#pX*k^a55)BVNip$eIjz|I>8YI}D#a3ea9-Ns(ZZ<jve#PWAH-2al+7r?N&|{C{
z;^XGvNYNMtK$D$_5TM8|of<ZvGN$F1{&13#sNlRe;y~pl|22DgzD9{9o>2*zAKmHR
zM3`-K3ozHCyLipb#(0#uV>;jfvuAJ*UHiUCf1mML<8=U-ME?xF=_O@0d9GcgY#oDV
z{G1X;VE?pT1^D)f0zd7bWaFcIfoct$`xGAftldYSEHR$$jWVe=nDV&Ez6bS)u`i&p
zg`b+R7eL7Y1vu?VGn7?;21BF|tT)?bU{3=Il2SQD34_pha)Oi$!Y(h`Ls{t*%3snU
z9RV|ZC7~`q{Se}6#E0-OO(awWw+0LwoQP{Aj7(m7x2C;lOAPE~chM$x?D9YO_(}rp
z2)jxmM48^v0hC<2C1E(`jesqpuwNAK*xix{)G#uErL@zTiAjia!Y0$)@mS%*WW{9z
z5;t8uwz%6G*_iEOqu{`F7g44MfSqm{xp>|+p{qDBK1bUGOce!cm(w4t*wx+aB7I*J
zL|~onh^PAp%@Zu1)V~fkQ-gSzRip|_C(UNEb8vFBq{uO;)T?*b&n9;-rql7G2M^xA
ze~&(w>*?hD0kb;$JI@Y}PEPlCPwqCu_3_Cy(6O6T^6e2Com}(qc3z)8KRQ0Sd$687
zUx#f^o(|4uy#X-&a7`YsC;Pq0ENc%3ms#iHnuw^stS7rY3?GV&Ve{ze{}D0B|JhHu
z{0HOmT=v#c9rl@h+#vs{f4vdwf4=?d+i(An|NI`G$Ink+qN?<Hb7v3!obI0<G$~XN
zfWXXU`+NL=U)+6suz&a>Ic^?oEs@?NyXf_%OUdbvubNv+NPs=)WZ6>k{J8maYe_VS
zOBm0D+rRtx$<f}A+p6k)UWb2nq;vuLTiSlS|MFRKa=Z(TrRVAT`Jlf9*z<I235K|o
zJUKevYaVZHY(IXmvwe5Zju^W{n?7aqh$^)OG=7hBgA>Zo1^`kHgVe<9FzVL_v;^C3
z(C(JTW3se;+#{~Ag9PVjhBj0?Q3aeDmqpYMrQqU51MY%y9bd3Br{wzjgJW3SmrW`u
z-wTWNrk$Xu|6N!diHD%PdB7DO;CkF8PUMDtO#A&o2fYK{_s$Yjs89pWVVo8F-EfD1
z-=>svbg!f2U|tuz-Vb1>ptniEHmu)${AxR}F^G%`o=yg2RFFJOHvaw5S6@B)s!?QA
z0N)sf0l?_!{IgH+=Y4LF|9=7Of3y7mt8X`A{NLEv_yhm{9v`%k`2+<(f;Kb7cL!<(
zJhu9h_eS#M+3wN7(ec)jSRyRZfo^Q0egTR$wpqy#=@_tt>KM4x<0phv;UsV0{ps%G
z{cVwqJ$|siO$rBi<P;A4kXkWHhkQf-qqGl*>;4C7A8=T&09rt$zij`%xAMVm*cVek
z1he{w=^y5*A9TOV)DL#vUseTyJ=@m*S!xIw12W$@js+AEP-88nF{>^D=kib2MJULB
zNkxQ4$6+0Z9F}>C30w&)tcA5&UR$Qc`V`FsRrmFOSJi|cdextk+iE5vME_6JPSAOS
zyGOJWd=HhYDCBsq4ejClAFZXZOU**k=xCQ}D|D`Dg2m(xr|aA6EX>nVtwq#dq_;3f
z;s1i-LKk)HHslZ8#s5{^#bQVEAELuhFwB^A`$LVfh#Er|?TQzzRFi@C328EftMMeA
z+t?y~1~FEm&anItRzRi3<0r>A$@dB#vS<mpEwA_B)^DNw!1|*6;JTln0U_47dGwTd
z-T$YgKK@fI|H&qu2Vbra67qceb(#DJKau?B>#tD$^Yxb-Liy+axcsMl|A*(D_0AXR
zW4`?Ft8eR#uXFaljX(T<ewWXKmAfk|A^^k<uU#dL^@o36udg>y@Lhkf@$f<Y&*)~i
z@%5vJe@=jE=uLoNWHVr>`ivvPB)c3aCY|6z43o5*j;}dV=wUh?@HI=?kGm@m?%w@Z
zQNJXQB}~`FHavt|2Cq37Nvq?2aa5(_rm4hgl%?Pa=N5s7_E{P|K&Ra3(RuvfvUeFh
z;p{ZgLke}0d&YAK9&(_j=oxk4XZ&pU<h1$fWdE<tJN1pmS2O$KFU{twmpeb)`D!D6
zx(l}>lsAu`?jP<PKr8ZQ!*qeE^e)?zciEjzJDawUd8_<)<!ms;7nLUmJG(EQ?4MSD
z`^)qF(<Xd7sa9>}cfI#09jctyK2-1gjG;a&l@Ham?eosXIyMVb&{pDG&b_?v2T)CZ
zLrB<dNsCq66FqC7PYSef2h*EQ8!*T$Zm^cnKsR8d^0kh`ckP@F+nsk|JJ3wN6*qA|
z1l~m~P|3m}WKemUUEMGQ-_jtX*xG}?_qvr?_0AonWoZ;MXh<8;J=+V$k8gv@!<J5=
zyt424Mf1nMG<ROOP~f`H@;vD3`<;W=O;cLSy64h%FgA+n0??3FlV6#iLvL~nDKqL^
zSJLWcf<OWUbY+l95Ggzd@Fux`9~MUTzQgUL00Rky0J_G;`M^Qz=KW^!F&u#_G{qrs
zPuwcJX`FY`$`o7u`R<)N1uZA05H;<$zc<CKL_l5+y8xU3=;v$O&vxB2fOC9;94ipe
zy$5j2s>w=nj&L<bJ`2|hvBRK~P#{>2w+f69=8io?=51vJL%vJ7URucWOs19TbdZe(
z!^$~KxH5u)Zx$}!`McgVy{2HhI8=1a(#JJImZy8oojurSm{;;(1&ChY+2Q@B3<P;m
zK*1k#qYT#wCP@LoTPGCLX$6+-+3pd)T1j)`cWY1kdvB0ox3tbY6?3jrdXT*zOo5rL
zq<kKyQ*JV$$e=urlhfn<!)K4=c_MLuHtE;LsO;;L=JDRn>5eabN&@bc%PDLaY;<D=
z9mB!VJY<_v42RSpY(Y?qD@GBHSbk5TE6GC+mW(Ulrd+~kLvVs8+G6;^cikIZxiWL7
z@(NC#pU3O*_rTw+%&v4ESF(cImmbArcD1(cyTEbMlVocvxsTsw>zvJuCfNZVvDf|1
z&#Q1LNM<EDzcRBVRLa+#H=U=i4|h>k>1Twq=nQF1I_u{hiXgE?2M7k>_Jx1Ki&P(x
z;H0>d)14;=&9H|H>fj4C{~YZe!uF?MvV&L0N2f<&`{U1UUYPbr_MC1Ie0<Cue*~oI
z<t%sV`BeIoKjWc5Q9LAyq-J_}yQ!N4mYnh7#t_pUVm&F5%mmCt%&E5;G>P7stl}7J
zi0@~+7U1$2eI}s)F`>{@FskI99juu-c8RF)En=x<Iq)Q58})jU5o7Ro5zM3<KK!jT
zvy7uaU07?%WQ<DNxs?howyfR(W*DIu%Dg_&+QI@os~j*k<o3E`bax3aHa3H0Um3%*
z`{#J^LyMF&Z*5zb)fel`CKJK7xBwOW4HZ|$Ra^=ToTeLvyLQiEZ7c_5*>5~l_-iQ_
z#$Z%L?wur|;ou{)!F=1Kqva{(X21*?qHDX<jl+0c)HNzFr<auj#gEjw!Opeh^kwVW
zZWVEt9d;5CMs{p=0Qqfnpi?w-b7*LYzcN&!I)&m8p)~WngGnqe(ynhxw`+BaHjn@y
z9Ma8$mJ+nVMWdpTkpKN#e7&4VRzlI7d8i~H4Q?q9`hFR?HI`dboaFEZFg2pl$OB$v
zpTedym~<$dX4pNiqH8zTl<z1%-=y%Z_Fq0$ef81pCjKX>b7iYGE#jl}QIj^xM0=9d
zG)MCY6>-4;h&2YA^5s3CTcE4-u<9eucOnld#8PtlJw03DbQ`=m7Y5q-RE5|qc#oAR
zD;}(z9G$2L9hjF#dre0;QhA`okg{Z!h8|U`0^Mw|f~FKSY--;DgP&Uk>UJ(Bm5j*@
zYND1bzgzYwWz$vBxtCPB%2mRFYF~hMTpMPPjOyu?fz=D;fs*@M$$u+f1DvJfS_B_-
zP#=jrO;%L-w}5HYkvx8!7)B}iEljHve=2_FP%+?|-0{8$Z*r`$>2VC|=5d%Vo%*xg
zTC%>r?nf+j@VXbi<wE9%#j-R}T_VOgHF+fLsnio;*Bs!(tht<(x`NO>yC1w?Fanqh
zV!QUlkt1^54A$24ehBE&`%r^Q|1@|bmoT@4&5Qsxa58s;W~4jemT=Ly99*cfrUCC{
zcp!o>%LXA_6>?WR$J{GNVK}Z09`jlY1I6*>@fBwBuveR6JTtg^t^;M=EP;McHliA?
zn3l~ImCXnX%g8r_U6#EpI$WDV1EHu6vjCD*hKPGi$~2I4wyHI3BjJSv+65)Xm0dy$
z8mNv&Vks^^XNY6t46-a^`wSHJSu#`6E!8VPx3B2=N<T)oNHPG}krKRWB{cpimP1`~
zWw5oenG7EH8BF1v4OUmHLS|0h!I8lHM?<%9A*e#FcM7Hjttl%cjsEJJ)!fmnmy@<-
z+*%78mK_bJU<>F0Dd>Hi?-nz20NSASjJqA1{=&;eU(V@kn0Bt(lY)tozH!Z^2`ief
z)P){^<D6iL;%OI@^E7%P+#uIFn-pEtyYgnGBgA$%<IWJ7O=ZDxocv^v?K<41&=#%-
zmm5Vp@0J5E7RMkvd>sN6HzB3$x*McndN<euYYu(qNXPM`F_8bWaVCd8KUXMGEuPEp
zQ|1ykPNfXE#_S}gQpMEU2uoSa6`f4q?IX|m!JqTaphXGd<U+<2p$D*P12pGd+s0_&
zt<FI3u%y*S^0zZs#(NJD6%81h%5p71Puva-Nm?1BjTp2+&%#CkJP!C6K&Qzz-Y5I5
zmpeb~?i?JP@Phf&y#Sc~Vfx+?Cn5|HZbVFM&~QV{<uJ#r>*lK!o%rL#bP4xzW97-t
z$^LF@cfW;-f#7{r;bgBRfzx;Qk(u%(9yDZ@f|Lj6aABd<iz6!#*I%?JT^bP?ZB+6N
z>flzBx)(`)wUXH(>n_8f1!5X26(0M^>CWy88vbhYhtuO7eo&1n=4V5%bV6F}v!~=*
z<>BLmVz^a2!!VJ@G6swV%`hmZ@M>_03$zPe?T`9!iFN2WhgbEqGURoH(g2`vmZs_0
z-8G#7KND!*gyl~j(-Zzdm^g<b2GocYq=C0EAhV%yu(QXB6s$_$@-w&s(!@8inWRuj
zMwq0~cmBFe{XI#=w`di7VT@`&7^)1P7@`m{RED&0RZEiS9wcbVL_#jcKD7kT6(=$#
z`)rg!u49d3$tLvnZ!^q7GQD1Qjda%y2{LRUw~o|t`y8`pA<nx=;FX55w?O1A;%u5&
zC_KHpkbpaqS}Lz8g5C=w=k?+~$4OY)FyLZ|HLNn0Vzw5I|3daDu?jL3_P*=&#<;ej
zyjuuK+^)1=p)pngAL#GznIc^Y*n(trKFcJPk-W#M5g)LK4B1@wvRoul&aW5Wz2TBY
z)C6B^k!(I75Wb@!?rQmnB&a5j=1mu?9@whp1}>RzEN?bwXR6>aEryS24nU?Cc`-7;
z|6mkVre}dbIRKGp?HHM!qiJBga<aQ_(1qZFqw-hB4e(-MM)9j_gYUbA#OlIbjAaGK
zg$p>&t)JytaK_`32~+cCvilNV8~7<4?U)Bk=9`P14;iniJYKM-UuUWK4u-W*O(2&{
zH8eX!TfqgpJxDv>w<oqfQ}~OHTEeW`89Q3lY;cKUL$_liN0W+p-C=%|=@uh?Dd|M;
zB9jpC0L~kQy}=DqIVW(CzAx=fcB<($UC{VxZ#X0)Ws;A#Q7?;0x0rQQHw_U5q4on?
z5&0b3ktB!dXw7JZ<!-dPInD1$+7qlwmns>Du1g^MjB{pT?%w1rukUgV#Yp*9rfIs4
zH#|1NQhn+15#Br^oRa~e?nV+Y(OrU~|4kwfH0ukt!U6&(4zKyLNQA?RWVJ-C=m(NN
zCNsA<aY~u4QY93zrZss_LX}@tkQEytR0CL1Igp4+@in6i!>&%+@28ouMqome7ZX>l
zWEpAe0>(hW)BP?mhDd&6nInx#*G_cnI2jS$1@<N0k|Lm{SpMlY$ce2SbTDMZf*PtO
zLUB(F3C$~qVyMfMBV6<{rL8Cw8Cvn3SjAj;vz9=Js*7Ph1yzi|)=KwoXxr<R^1?@&
znSvE6jf@!6t0BZjgQ2kk;I|>97oTa&&Eyt8Ai#3eu@y0LWmo#6L4E~-)8f(35uVDa
zh-IG$Q^a2bj`2dy>uA_!x&VibDOaumhsc^keR-}gHmX&-rgqv+cA1}iApf2(k0sL@
z&hy2PShQ}#n0U@hE&7vQ53pM-t;pHEEI`@|<pB*nZDF%aJczz?%qYYt?2AZUS669A
zsZE4#S#>cUadqkXbb8jSIW>hDftt^$rdGO`SEqnZl~e6VRFcOdWCc%9@olx)4ltpK
zCiTzHbrjPJWwh`!$C4s88sd%sQ%`~F&U$NWrlXhC5%7fA3mjcyN%;<-J~Kk63v`;d
zJ}PP5s)*;deUt5mH&=TPz(v_`5w4-DarF*8)1S4MJ3q7zUcYR<G=^!$vcMHC2m6&V
zN<N5rrUZ~NkF46)a{C6n2uKCn&Pa)cgoK)Z8ZxWEU;!bAI$c{!wgHtG`vtF6o=#CR
zYCw`vFikD8VM_Z6W=u^OygaJNtz&Xu;7)84uo-H_TrXw_qEP&=#2e5i_uZUTg3c-8
z+V&=}x*~5j=PWYx28(+_+s_}^?$ekV7~2|ZLCtI4k=Y-;ODaf^5n0-~?jSS&siqOV
z2_673ODLL8!E`(jY&k>Ill)BPm_z8!V+%l*PttUH-l-auHjtJR9Nm!fMvHeR?rLo7
zz;*LIQDf~cCaaLfTs^rWNH$6f?AFInbmP2Wk>p+{d0F^PhC!&o#;WXnPts~)kuKWV
zg_k0q8w`h%zBWKG99TGY4;!^a-;xmZtE!jN+81!RUhW?P_Jn%?1-2^<Czd^FO?p^_
zaItMm1+q@c1k3`-Wocl!p`XprS>2Bsn*M7GU-F9z+Bf0XDofm3FrFu`pFV9K!&n6F
zqzUQA?Wb^Un79=C+DgisevmXA1^QQ+m=vNj&*f^`R*8P&+3xAf+ihe{qL{aTp&4S%
zhY)~ij<3nkWku~>fE&?Egruqg4>Y|L$PxO8D-nGZ7_sp#q;indN{&s0+I|3Tl>>_#
z#Ld_ZB8BK}V6-DoW>@YIhfjDha%OEZerAwJ-1`<!t2J{fsHW1Z01@&MO_8PdW@mm7
zIh!-b5njedb8w_M_QkN<MrP*#7y=9*a*?L*6sYKygaR@#V>r$wY#kCZ2q&4ULo2?>
zlJ1O-`LkU(T<4MDS<W84v4V@APTNBqUMBcU02SKqjh#9Vh;OtY$wavV-PT}f1dYK<
zVI$q!)w--z)eRqqy1HeK(OwIU<b0iEEomUtUpQe}JKbKGHgL*3<Fd)&T88EQTdMQX
zaJwiSq(}<E!Vz~%%RvU4INGuUEQAPCjd~<#U|56BGWO;h!wZ4LNw+};PT32y#cKpk
z8Q;xYo_t7tE4U!_K8FjGf|e6wNfVaCD(hH8&A7YL+cq!&4&chLc-^RladsS-g|8is
zyP&XC*a<a**Ar`piwun~^WFuK!G~2^AHIIsI^B78!oza37asp9_7NN0>+?-#>Wg|F
zoIB;pjszX}lHT2F1HHId@n9rGH;=_|OP}ON8!|ykuW{#cw^GCt(P*igJ4Fa$MI~)W
ztZ59JuI7}HoB|ry=>z}raw-HlxwCLO?=AE<b0W|Dj!sAn$`%17`|5lc+}^S~10vuH
zOdvm7AIcpFFYd9aGryuITM7FwaG?SvsC~`f&}<xUHmD68guch8z9hdl^t`I{#KsQZ
zRSPZJyr)H;G-yxLOZa{(a1#1u*5%_zG!>$AM>@Hz*&LV3iTxa<#hZX}3fdXlZ&{9~
za@oE<14^HKffyj<6x+>{t$$!uup(XVv}Y*sIJ-_bOvqV#G8v!*o5DdQ%eEPzEv&HJ
zw=CoI679@g=5nCaJhJfcgv?Ut?iIm%HGkL+9R5UvAaNWlBj}HSFLwqDN~Yg!8E=Ko
zcy)nU(u^1*<R=-Z;YzSaLF)`7OyWkq2Z(_;R5UFwZh#zd`v_<Jc8pGsldB%OMrd^^
zE}dHyh>XlkyM|r4_rA4JFH_j?(&dWmaVXLA;%WszC$0{l25+e0V4TPuDh#f!b#$|O
zL*GFBpy-ZnGr)($5N_Cq^u*tvMd(p013<}Z^$!$c-w|g(9NA+oq`npo9rM^;fx~nm
z6?a?K5la&b2F;{|=r@HrVELt=MIgXLbdRQ=UYezsWaYqVKG1lIBVNg71x^-L)e(rx
z>{a61m;0PlY>q)!X1YMx7D*#UX>y4-;#+KB*};rq_8BR=;ln8y0RK$TKE7yYJzF*$
zdniQKIhg&nGCw8$<4xD5Zlah1FkD@I6Nu|W7~S3qXtt_~mna?(tp-L~!}77zBM-Q|
zDCki_Ki7oVi&n<qUYz1~G)JpScksMM^gF<O;d01I8+Z01c%d=fW|f0;Yh|J4P0hI0
z2dlhdYdiLD!PWIrp2~r1HNWVJgrjwj7yRSzwD7P5D>v+cjyQK@oz%eVcO0Xn52UCY
z+jbPGz#sYC9KwQ|@fj_C{V~80rMo~l&Tl~x8k0)h-gv5)LePI9j#%6}!E=$f$L@SL
zuqj`~$Bziy(XrLb*-!-<R2Zfqf<3P4v;%AP>Vw9n;!}7#@NyPeg4O(8mKSk27f|eA
zZOdF=73=k5cf)Uof`ZeBIA>05ZCiv2QT=<SzEKbOaX&TzHmd%xgmQ*(W~-(OFUlHD
z=s~cqMXn#dR{~$x#zNhO(qz+a6qKL{gfODm`7Qa5Xdxemte!3=i(Y_rW-P_-B8vY)
z;X{RiT%xaCVkx4tsz$t%C$#30TBd)tKj~<wnNS*$XUR*+>LSkKMw;$p$bJ;VAL%)B
zZ`^_kdm!WohD#jxB=m250T{!hpfSb71x#@6NSPU+?xpy>%KqYG`tfc^_stnoaP$fr
z%E504yTVTP=V;#TkE<Jzqt!vFQLYU<autWE$UP8k^Sm9`ttj4fT9c>=_Efvib_3p1
zja2VW_=8#}HpLy0myMIa7o$xFTzC0m$~(qiRYUoyYnPiPG~->TF9#zhX^!RSo=0qF
z!fcU}48sZ2Zt@A0?aY*&$!+u*S=WbqEk;Ds+bL3f7?-*G{twyM0uySI+_A`xkWnBj
zn9i}o&D-FH3r8N{^G=8ACZ;zoU>bX32W+j=iKeEki|`c0Z88N=0S{dljhci)@z9+>
z@Y8l%gmz^!@jmnFl}8b;-}387hZIiON&(4LdJe%7-;;$AR5;Fxm&Q?K0u`TG-pU;g
zQcqol;aqYGcynJok{>{?Rg8xOO*y=L3l(GKm&mOSgOV-(XHuvCKk=Cp{}Dif&DTFS
z4CMUykBx60K8*9ffBWsjKk~o-E+5vK{<`%^AFO&XIGa$+d?3fiZHnssU^bF(2?G!&
zlvsChCKaeC(ag6PW%ADtHoksPuP2Shqm8c~J*?-WOcn-|3<IH1L~e>p4COy<K3k|J
z<`se4Y0#DI0NEpavJDI%yBv0bbiyZ(i6xv)hduM~-cO_1<r{bd4V;gVDZ;1deLALG
z9b^Fi;0gT3EC{_WEEa#EaQgW6;=%KRw?H{hsHx$DgM!z?l$$;UJiI3AB>X*ius<p&
zPT{pRKo5!Zmq*J<MWZ~UFTW_B&>e)#$f=p$-)59o3tnJ_&IS5*R8ThmfHO)EuK_n7
zMamW^s3oJVt&QZe*B)g~fPy<mf>5a=RUGKpN{I$9*HBPK4AbtaH*h->2U}KD_eST_
z3miF0DgNG@q-)dO1ZZ2z8o`C|Z6DtDhiRKu3*}|qbauu-v<&}SOJKo(W~M*}Hf$;1
zmKe6wKkFcMA3h>6N)|rLrd?R*_?e4>nh$eo9<*m4hJ!N+9!hS?z(0K7JU-b!I&2-j
zeu=`tuQwVdnkBSx&|+0Dkrty`zj}urj(YE*EqK(&;t0Zh)|a!!OJRhfJHYI*yL;Sd
zw{miN{CfAawSQ>hNcv}Y2pqLZYygUw_sRZ<IH67IF3f@BU{phuL)Y4ZduN(@J#cNY
zuK&Z}a(2n^TLD^{MWlqEIH)}8)S)~vCpz?(J3l~M6o2($gW7>3u>4^eKzf|MXIJya
zcechL8#ger=p76xih?O}&A{*SXAM23McjrBc4wED*B&7v%Y>$04ov_o|7|vycq0xj
znsoMvy2PWFbXdNI0Gf1x*4{LBz^``p_Vy2-!GOe>%GIw5Mu2Brw_3Fm-#OTSc9<l0
zD$)W>#=3%ir!6Os?DHxwHzPjH-(nZ&$^NrDJ~ZvY{^{vK^G@CCwq_&TTs8Wj)!Ec}
za;q>wF>HfFJGerr%&&Etv%-T+@i|}t*duLAYbO$X4Hg)i;!>Mo_$Sx`Kp!!8!oAW^
zR#y6#Q}!w9YE%+-DC!Q*2h$3@ud4P%a8VQr0BQ#IY>H-$lSdQ?qU|MPCZZm8+=lI`
z0IXs(g5*I`-{7!q$qIb6uhtSC8hlyaSoUTN2_po`P=Jiak~<WP@g<nSl4A{UDD4$!
zd^K6ARA{zn97N3u-S50l!Zq2nOVIWrON9wp27#T*MHSA{1;xoEnA(zUU+3SogkI8i
z!n=Caga{Gy322FreYBgnkMJ(PuaP&$IP~LKezN>XzMa9h(AN_ikr{H4=dSQYt}tER
zLFofmdYCJX$TKK>ns1OM92Dw9p{NwyYeAuIzL1~<Tk3=FuWp}r{Bu4x2taf^>OuX1
zo811gQ5a!lj=v+H9@e!;#VX>U?6yJ73j*+;x`?_dm4~ERV@(Di@IQ5zYDUu(e6qjS
zY+sR{Ec?6V!kvD{DRekgDhsFEn8HNDeh{zkF?`NiQ5x{!Oj!4T)yVUb>n1P>W6aLv
z8veUX-l0=x{V+~53f=@j)f+8G9+R-@)0Eq*X!J_V>>|i><${qMofCPVIWaTs2brA!
zUP6SEj>&imKqBu+Dc0l)q!)5%B_aeHujoT3m>i>w2QKgRc)ipcpDF@YgF)jJD?jV#
zT4sM**GIjT$Wn4Nouos#8+sY%P%$)m<o(FSwSj_|o`v|N6uju;R(d|#LAq06i<gH<
zP?5J%&Kjrm;A6H86)p_ogu7SOjrLqVj*9W6TvYO2bZ*=EW2=-y=ut>yQM>%M@teyB
z6;Fw!v6gB{+qHP%(S18Sk%h-m2W)rcGCOCfWotakF8bo!#c1Qo@OT0%$?~5%%P<Dq
z6C)ctXc0b<Nz`izG#d-O0{9uvrb<3XutTjq5l4tKi4QwDuNlgv9Eu2qx<iQ#A2R9~
z@gxt}+K2H84i#FaaVn9VNc=aUv(VGwCy(~t=m{PHZ!2127tv9hs8)n{uhK3!^Z$Io
zkv69Qrw~^faLbz`8#83xRvPT!4R*nO-A^_?^!sj~_~AA%Kz}Y(qZak3r~^CR<^fnQ
z+E4D5;ilV_tPqv6TEd<s;#QLL5JEPnGvzCw!r&_af;B9Jc%&>#doLoEf))0(q|#|9
zx>)moM280ZoAxfz@9NArIK%hV)i?AIE12i>6Q%x8spKqR_h+qfPTAw&*Bym3f=P35
z`xLj`!?ZuSOlt@-y>Mjy1P?m-B*^VWT6MW@X#NqsdH=%cfe<&KA9P?JiVAKuqV)ME
z$qrFu4A!5CMv4yxqX8RsomrJB%?EaA`DY-;&F0WOO0!*ERXwb`dr>FBBrSQ6;*E2^
z?*h$J^x9Mrq`%%PZsHhuv*vGfspr>abxRuvz(by?zoo)4?n~u9KqSpU2AjXb5<@b_
zWb}pm2Gnv;dg$JG%J|fMiwH`-6peTyF!l4em$!ki;Oc5Exp16>Sq*|^?|kcxhde3#
zt1CEfDQ;+}A2dXidD2Iu!bExr@&^3pTek?JA_$^-Ul59)o~aR|ARKaBak1fdgW;<P
zqWsobVBp<P9eDRP1MfJ{$$}{;32aB{u}>DvZ0M1XfYSY;={+Eht9o*W@oXmN)EKrh
z#EVAhV_pQJ0hR=@pnD_nj7vAHNtRm*^5_%dJX^MAd8Obh-mYDel3J;H7_0*NQ5<EL
zxn%VnRTh%c0U|^E6zDet)I=nJy-N{G1E&D3Rs^|vCe<2Ed$I_Sq9eoX_VPWvD8)6%
zSn61d=r2c94HFXre2}MlfE?G2Sb)wMCXXLGVgi5u7EoVK21*hLp-xH(o<*sg&+k;o
ze=euCD9pO~9jOjC?}ln@ZdQnJ0XVm?5-q?C<i9Ka2L@Vs{Fu+t%AbY%(=#xXj8h_+
z>z%U*k*GE6e2){wa+_{AZQv3=OfjLVw*)Pii6euDUa}RCJ*>(oB77|EavPdQaaK33
zC@#5$7^{KUs%z_yQ-|L0RQkK}p>~u*SXc#!0V=YT_WNjzr;*F+7{KbB!aYwIUqR`$
zwM|^l1I&Ou>h?ZJ@|gM>hPLc-d?yM%{~kl+z<O=)8v@u}a~xNoHA<5UyEMI6_d#Aq
z-g(x`PZ&K2IZ#aR8G`H!5n{MFs{sWDPl{=;+`>}p7&fzu`U7l<f3U>95HG=oF42aU
zT^8(~fqwUt-j*~UQ_NDqK_8ryNMPH-o5V-OF0k24v`~~aUHbh=zQt)ii>6_-2H6lL
z3Kh%72mJB`Ln)i<p@Iv#O55hCM348QJJzubj^df16@D_Z_v6Au<!y;Z-^FF`vNOJ}
zASLI=AB}Y`(TFnQY8e3*O|gHA2^Ld}`GI$DJ@Bp@cz4l(cW*K9PB8F@u(PBTOG#83
zdJlUYWWLX}dbJvy-AD{3_uX=5W0|DAm`TOuIl?Y2;pc>=*vm8xda<Qw>gibSi)7?O
z9k~&FChF18jVQ>jtltxJE5+Ns@D7DkyuAcT_+%ec5zH>^*+zP|#&d+<5!Kvt?mqFV
z`F)#>*mT>O5MY2pY~M~?cB?|-YVEv=aY5^OI4xZhre_vdmrtU!<<5#|Y#Nav2&fbd
zgNdlz?V$<`o?DIt%4_4k2m!<d%p94{KlP4}IIz2JzjIRLB^5en%NWlG^~e3e2ZSwy
z0bI%~uX4fj>haPd9Uz`5?LjE__7KJUcx7sniviTapp<9X0H{8Gnx$4k<~Ry%3`1fK
zKnro)J12{<;o$5i6jCA({JMk$`BF_pk{@gIjLCF*%3tL<tx!#Xn4ckXs1b_z$hH>;
zuXhgipR{&f?Gt=K&ln_3%qAni-@ILMFCjIyJ0u{0vP(6cTmc*WVC9Q`?yeZiyUK1A
z4fZzH&}t8<`}Gv%7O!6Kt{o53^@P&NP|++=AM*9P*v2a~zRHNF8e~NJpIxK5^oWAS
zQkW5--w_R*_sD^qons~$R7lUJ?ZJo)wlL!ujK&%KWodu<9ytqA=Ve*i8IXZjH|>zX
zmUF+MSzwk_C}&NwbRu<@s?<@p2OOWIPSRIo7?;kb<T5cCkXInG|7eEA<In=6U6w?F
z(16Sxnw@368jZDvnY9Le{M)0+je#73JER7!bTI(O0GJ_ooZ;gR@SP|P8g(B4*`D=a
zIiZaKM{%$tq%zPCG&07eoyuZm>~e*nFztNMHWE$4>FUBs!-btvpJZH5?NI2n6hrk;
z0v}BUgyxTTIhJwzjGglp97bY@i6g<?82e3@SJ_3IQUcvwk<}yPL-HBZc};K>aF9pS
z0c^w=s0h-zM)PGTI(^<uPL7_Q{$=O5ne3k=ua1wt-`{KQB}+Re@Egv>U-nO*AH6<J
zpv3Xc;pvab(bHt-@W<rE{^1_3c=Lx>$IX+I<mforfBEWQzqwaS_78UtUXzK_6R3H3
zbebIOzuZ5CW>1f(OKEJs3H6>rBQKlByU*dl&XfIv{nH;Y6yNC~w)zyB-AP{U9G~v*
zzCPGFhLdsp>gc2iL)e3c5BCqBVsy&p%jV%J%m{jhr%CgB_?etM-#Iv-?si_o9FA#>
zyGO5nJl=oy{4{xfbg<WihfkU?I`kLf&JKUX1A4Ht|FV|s?Y!K1)}(qz(9SUxlo9^r
zd6OPNk2~;x3NeanvwL)SdJI2tZBCDlPhI7|?4LAi$<Fcq2`<dj<0I$*7Z&OqQ8Q5U
zu*vP<qT|S+4YxZ`2<P(pr0K`A*8~K3`0NC$+pR?7;4k@k@P`k=f}c6|{}`wKb4~y0
zGvEII>w4pxMr8jFr8oYt|NlKcY$!u^`Lf})tE92s_<Fs*{xx3p^#>dE2M_B>{i{b`
zKYUdGCU2X+i(#hEd!yc@jXt?3ZUVyKZkg3SV1F`ejt#1_X_qXUw~gsCj;Ph~Mx?KI
zTDwQb%>ol?`-J8ZnoUz=z4%!gJvi?~4~D%D(G%b(qbKZT89yB37_#W;xIF=iD0;|I
z{n?&drU``lFSE;WR_UQdWDn!eq3W2v^{XL|MM4KmXIJTc7(<sG;DecVRFQRWZJUCv
ze*Xf^!+~??VSC8x9<~1C^~+cCsBa!c?zt~oqrot#Je`d?LZ0?B)`g%loWF_1fysE0
ztf)Xk6(ap?ZF}5FwiEn<0VbzN>`i@ijfAF6=30?Oo0Hg^c0?${4%M1pf#T8_`976L
zmHqY>bvtTzrdRDr9Arikf=O>It8Nd`yWpB)6**z4^}~}koZMy$I3wtyzqXCL{}T^$
zt?o=Fa4gT7r>&z`yGMJ?id!GD5<hy?Iyl<dJKR68f+k$rF^zvKfvP*l&ssaC;$~QI
zn)+f-ii^PzxV^_)Y{~$;ufL)GYF$?pb5Q^ZI6~?WvpGjG;B{SBM{9N1QK%ZqyH0YW
zs3lrH5L#J#E-TdtllT%8;;QaE*{vY-`Q@q!6l&`}1QzWQKo#<@mnID~!nW{VFIot4
z5p4TVguft|5!}Ex(GX$Q4DufZ0@cAQsWO~u;uoBb)Joi`!iT@GcthrrJ^7%M`Hz>c
zYN%iFC(uoL)M-zt*!^E>I3k;@iDE3ktb8y`IrhKAM;M+LA7P9?C1-fjn>xNTx7^3g
z)7Qs`HLZY!S9!5xxesy<1<MMpjOnhxkfT^`hyOg`Kf5JeV`(S}rFJc|>oyMx6&O?X
z2OkQDK<A_*_WZ!x6`-wO$ObAn%Hz%(Rqu-OYl~{HRmPoFr!rFyT6{y1W6fTY>Hb+(
z;p$bkY{nA;FyP`W|Io^=fo1)`A{@e!Fytk*UA4X=DS3Rc1V_#qLK6<YCSwdtVJDIy
zO%dzcac7zMHV)<i>|+~c(6nZZmeCGKociBS#JkL%q>P=%Q1sI4%t*O9@XMHK_7-x<
zYG3xmspxE&cHUJfC!0Hh(Altk){Czg-kR{PkkdHs7)a0uA9J1^b0EN<akrt*{4z#+
z?{-kj`n{EVgKe=ee`arpT1X0chvs79oM_W9%dizIxcEasF=tk(*Ej*%Di1&cMB;N9
z5&3!pe5Jz~%+tzf&8h@YF3Y2^HE)%|OMOswIPhwruw-@0Iu3{6^d+Vpu~%MYJV4b*
zHLwrBXPX6c9uI;%HWW%+GbhnXp+pnKL=3eT?Wx+`k0)t&hJp#!_ha=6`lssS5r)8k
zql#W;lqV~)l}D9Kiw!%A76v;P=;X|YG#Y>6<-wN1AmK5pq<6brQe4nzJA4H%p*71m
zpvWPBlTVu`r*Qhi#N8$iz3RtdN&4xGEqbD3GHy>h7r0rI-g)6<F?9@ogAxS*G4S)W
zqsMCQ+*lCE4c>0K3|MkV(b&YVBET&!8VU}Y*ZsKp48cwwcp_*Zuy*38rvXL2tvW*#
zp*>a1O2I2<>YSBM{0k)rFT~R{$k9XVuzTFxIc>J^>XHf8f}zkAFAsKUY@2s;^4lo1
zZhF;|$Pr%{6qS560N~!%WJwEdRw|EW+OrR(L*j2&jI<r}%+o2-h3pstufvJvW7Rnt
z_9LE|KQkqB!|m7U3!z}%%BYR{rL?FHn4y-@Q0m<K<jPVr3*H9}f}i&p=ngU#e<Rgc
zbQRi_r$GpbS(7VJH%)(6OUTfWFm$cnu$gvmC_27e$a*6?Dn^=|rbrZryJGkz8x)CK
zdTfVXFk2pqf|O3xY}Uu3nei}gI6DCu!USaj`R$fl<`eeDB?~)R8P=u8hF`y7BcLNZ
zALJB%P|X%$G=tBeooF?6I(U@~Ma!&5gnwy*ow7qy4Gx(EDeDG#AdJ;q2+KuB1EyNE
zC*IDe__FbI8Rp-hatvUoAwuN7nmD%-SAr!9eGLEnA#+KkO(Z~HatrBhPD1VVrX_T@
z6Dj~^?R`L!jx-xce0S2z@v!$nHK+yM2l0lr|H35^JsC`{7{!k)W8}@W=#q6u+%3-*
zu1`^3v$Ff$-Rh(U-amO!p(k>eMq(4SD)l|8k%>9aSZ^!XwQ4cO!?&=oxnaekEV9l}
zG1lSH;c@feXqWd-I-u3)VPN-c9n+QOnbLN*n+G{fnDWklz4E?Qs*4o}q$q(}Y|#C{
zto-v9(BEVq1w}4u3GcBaZtW}ZI_`0((YyPSmQ{h7Qt`26547zFMYF8%^{6#zzwiBR
z)*c?6{ZdgX{M}D3&;5ua)Kd#@Fz{RGgk4xpX+~p}OZxQoXzD4)&7?yXo)YqzGw%76
zBEG#EcY>w_1UT<>2t!PWc0NhpUs3EvS~3_rFWl%|&8>*;MKQG?Z1a;3%oy`9B@=4o
zyDlhC*Zi^Tp&FzhyiZFgrF_g~PLx6}BvgQhNsH<x6ol;R`&WiD9lc{)laHa;i7i`R
z<RMZs;L4pZ@J6A@U__FDl)w=Nh8kQe6hR>8yDG*1<P^A08NTwJTEob~Ze@G1)yd8M
zSrec%9p?L^H-#OY`Hs$R)e-Dw+)vN}K-HB_#%(-rm*+Py%nXXUfxds&yWS+80|U%Z
z_!&-d#SH#5^*lb+;Hc`rnuhx$(0x%n6?jWS2(JTZMTIrxc+m;$$TYVAOYZLYu+`@7
z8X&{W3Gv+RhS_kOboWG=6Ce<fyJy5&t+~EL+~p8P(Cha*$52~wmy-eC(3WA&;*#+l
zlH{&TDq1hRSn&jpdPRcIxfjf*E*&@EFQ`p@s+W?L;fE9b{3UHvH-kaY2+&HvG1LHm
z!?c4-06?5%10-O?w%Z0K@XP1;5lY~F(-Nv#I1V6iXa61ta^Q_Ni<hY^yXN<j&(zd5
z%UL9+h9#yt#A}=4J|R`nD$O6nvxB223ytD~83k90hw;f{*gxEB{?IhJRtrcUV3l0^
z<&@DaR+0kK=2x<yyW38O;rfwzg6A&CpK4C9z<Ft#&IXp>uzZvlKRC9~gve^zSM9-&
zb6RKVW$!(fs9NX`v>4r9t4J;#C@;i88=0RnR#FC&W|4sWvVD#2Ge+c|1uC2}o!672
zqXSZjK;P7Fp5Avyw^2m($JdDC0P@G)tb6$ZKirS^4SlJxCdz!0dil0-{iizzCr$PC
z`2O_xbu((NbP=e1hbpnAJ>@0cy(nz`gKhnVZ#s8w%33{q{c`b!Eji{-D3Vz>r5pAK
z%=Z=w=sALVa6f31UI>a}41cMXcBV)=O#2{0R=YZmRxjGHmq*_>^D8=ct8zg-3?t<4
z#-sf`biZ&9{zJ5F__2z8P253-k0!6UbC?WpAq;f$ZqY?me$3jV>-i@wqBHJUM%J@>
zWt2@4o@n0HfI3>UB#<2=4B>W2ps*(em4Gz)4;4z~BxPt~5}h7al+C7WC`w3gFiPGA
z2|clOWBg)ey%dBvw9-i0eU!>`5J^L*sig=iH(Gro_zY{OeTu7e1tdK1(+Qr=q~9L;
z{43nR^i~bPG3;4W6|YFrQ$D45ZTaVYH(i<VFXTdE*E;#m+3Y-u_1|2P=j(4SkAycY
z9_CpU6|37rSt!fx{}T9-(7q`B5KB-Cgt$1<8rPC8Va#(1PvgQ<Pb-trl9)4DBa2&{
zW>4+nIYD{mBFA{{Jt;yh^JLD!meW~qpiM9<$G>Cg1u@OsAr{NijJ)(-a0-PUG0VEC
z%n@-#q83B5Zm%pehrsSfPM#?7zs}cvG$>?KhQ{6~TBKsMBI-Iy793|Gvm+1ie!TO#
zMw|^n)Hs$V3tGwp5Cytl;100M>oKU`Ub9zD|1@Vub3k&Om$?)Ih>Uq5Dvt;p^PA|j
z92Hka7OLIe=p9;`QOGG^XO3S~V~Jy*BG)G{17Ni$?NK){JPVJu0b(?p1N?|$AjCe&
zBUdH-gyxWlQs<CjrLE*YB<P~*z6V?(PtJK1^uj+9usVLRbMm6nE1))mR8}_=wDEC^
z*1Bk=0h)G$HNJ67#bb$BFgamjebDyZ4veEr0vmkZdqf9VMiXHW%L^5pk4WHy*-hYN
zlmkD!v`67XD7%2SH%Tu7>~6SUi=sZ%5^5>8aQWDEg)$C`OQLsbJn0YN^&C;!Cr<d$
ziw3a(V-!m{Za<C>W*jR1hzD}hC~|U++%S$`EVvXRy@=Mq{RA>&F`+^M527}v8buJH
z?%jYqvJy_R<4#o6?#Gx$_)s7M9`@%F?C$%!-nG}5qFB<=8-<rio;JZcp@y}TVrf{d
zc(l|9Pixdv#NfqShQrMb1Rv(fHl57PTo{{j725j6mtLMxF0fpRQJ%F_C^TvtcdDc>
zjh=;OPEcUs%LG2<ZCR5~VdU>sjBR*_G9O36ESw|oXDI;aO^hHGDv*jhu|uH=TaTAA
zCvu1l*LrH}et2~1`5m#8Ukg$IJF|K&og?bh%2<IgvbGxZ*xKqI&Bq>VwG2N`G4*pg
zJHJo~V3OnL=boK81A+bVCMv;^kl};}{yZJ@iFLe@cqFq-p?W)HGKvNo1pFF?@KZ#1
zFCGPAtRhKVU_-<q!-ntM*BSA=n__uMQkF8zr=0;WYq7hY-bhwO{pBe4MbI?W^boIn
zL+Slz91H>x1~975+I}!X1YlMhg%^D*yeQ<BiQyMC7I3LC5_4d{B8Yz$91zVONM&!_
zej4zn@BbIy=2CHU*)~sa+UDsZ+uYY}?$6t1M36`ie-``xDch&lD4yw?<>NQu0&R^t
zxuLnmPWz3*Zad4IP<js9#!nt~%Oq}4fWfu%WweNkP?BPUaM2#4ig_OOD1ophFlFGL
zSmubX9E>_lPSju7aFc`jB4}<}q1mP)B?{mxX5-%6I0WpXH+dUK4)r#N#+X{#m0@@4
zi17j%pRK8;ve3dB6geDa(|$Un{4o{dW#o@l-Tr9g;%8sM`>RGRnW%W|o^h<KlgQRS
zX;j0g_g83?*{iGIfF3pQQNup+k<)@x3xKw>2mH>2=RZJUM7!Iq@R$HP3<zk2lh;qe
z3fb&zZiSbx55fwUv*Fwdd;8z3^aI!9sv-WCp`pI`TePPLL*xR}9b64y_0O)84MVb-
zj-kN(ksj^+V>-S}=dbCjqrZepG)~{ot?>HrWmsW0x`YbFg%6sCal(jEYJ@QYy=cWx
z*&B2YrOCuO{9zz$8F2nw8Vf*cdsLZJZ(ca{iaBf_itmvFWE7tpO1Hp40WoHKf{tKw
zoc-n>Lmag|!4;~4B^!aCkV->sKqow8P+r(0*bwBy+;3QOC*iY#1L*jXhD4`k>P6xO
z8%;DtC)c!5EtUh-i*K4nz;*;a!-eHaT9xYc`PUUL8eCN=tXt}gf$Bv!R9;7j?Vv^T
zO%9t#W`(<X8<sZu<l*3kop2jou%9^wt>97J={|@Lrr3QJTAKf96^?u<vYJCKS|Bho
zG5s52U`;?ZZyztCb@<!ITkgQhb(_{Vc{XWdlZWkFgy)a9wh*9P8V?$g_uq<kJ76(!
zH+Uz^X1lHaj{*;mNv}W1`|7+N9gQc^`Q#PQ-#vCSXsl1^E?W<jsqmYn*+3=IFNZQV
z=3aKkt(W_UuTMgmwY^-ckugDDl4a>7(h^Kb^D|0EYt)KH1Z$6`CQ7J7RZ89gx*(3>
zzBz%#bSRD*h`~onzq^6t5&bb^dPC^lVg`$h8k)a()FrouJN=eqD}s$DgFJ9t#c6AD
z8@qG37tLG+8#MT<1y=d!xS$0hY!_}~_vmnU=d@r8tddVtqKlHr1v8c~UT?|AV)-Uk
zmL`p~oBKtCnTPb(2j-U}sr>sRTbBrsl2dV2t>*CFoW&?&I2Nm$bD~PKMFFJncE1I<
zIQyP@7@?%9`Mfh9bXu}%+x*#u46{EYdDg!{A|C9`XLEr`pbr&ezFUE+9ew}z8U2(;
zKmC-^m!1-*5B8mtAh?l}1V=LOK>pjPs-%}YvO!Iv#q#%@@!O3X3!;XU5MO2H(T!>?
zxKOQ1HcuhNcQ5mBp>QhD$_5iFFehltM>Weaswu$vyoQb{j)!p*a*CUSr@pPiJB-m-
zTo0b!P>&H_To0b!P!CaKz8*ZislTJ5`N7j0>Jh5V)q|%u)NB6dBS$T3t>%A{-PGKA
zht1-88#mNDIL+5PIK8>QgM$806?#*>XC?jJG|p!w{gu>PoIHWMXNWPeiv4#-Js%{b
zzqXAJ@R&;IB{ZSJ*su6FCo^&kRIceju@(1J<k)8&x4p$TMOb-1z(AMGKF|RdYbErd
z8`yqEw0yu~Oxo8@&>Z;7iBFM4-S9r&;?%|u&De{0vzI$RV9sQ6orB&AGQNhvt8n!O
zn|FQSqcBx7?F=qB1~Yf2m*oT3{mBj9zkt>L<bg-q@3%e*6@w0WfytEc(WUIKWa$em
z{yScVC;$w1&e52Z!ztZ;186c<AVZlaS_HYy@y_J@5T%P}Eal1<-z_ZO@x^0r0Xlvr
z5Cx3BO}+vh@uwO}L>&U^!j;IAd%2acndFnRg%;xj4m|%H10c<r_Lfe2fysW*$<CQ-
z;2u^Q_5gE{h>smQzsu8UN~RrNT!9)WH1fqFWU%?*;OTzzVDF^$s(IXcdhq(>xki1b
zR#93djZikk*E@JOo*rWem+z8|<dJp}Er`~+r<+bv46*Jaf4#sEJGO&4*hkek&xrsb
z5~VFxO%)&E;-j~3#iE@uI1|ekW8u0*ZPNmAzyS;bt>#}6UW#@|;-7Hvntyi0%>TDO
zbK<|Y$Ak5YFVV;R_^%rqUu}F7$AA6m+i(7e|N47;Z2VW+a1Q^vUSF>#jg5_OAJiKU
z8s8@MhmSTIj~ZX+qrdLVJ`9F~_T<`m#Y&FMgIPP-d9}Y-9N2#y^hZDx(imD7J^(EL
zyjvV_l>+MTx1PQ}+;v72JCt{T%jELFQ<eaY;DBu4-G9aWG5!C;IAzZH=g72QAOQ6I
z^Z)SMZ#KS-&i}U?jj#SV|G&q_o`2bJ!T=8u1vESg_;XVK`q4u`0T1&i08cvA&B(Li
zqPk%0XYP9+9npQN1`PWzZMEOEnIS@@2c2mAGQs$37g7i#Nv<TPT!A8@qI0{%E6T{$
z{C%2?+mmVb2)(tKzrx>~FoN5{-_+0{Y7jJ4pe7r8*Spq$z(bVTcL&`zrf7yGIP1aN
zv9oEX*0CLGkTWK9$T^G|mcB2A-Y)oKh<qbprMIKyB%5_EIE-O?imeQLZ3=QY<a*gK
zg(;o&rtf>b5fF<wfe{T1x}Rk|n!$6N5B$Jjo|l6Ul2c=VlzP@drSC){SrB#g1Y?0N
zXK1}Vpyj7Fc9Kh|L8i^{m_lUY05k|j#$#_|TrhTllkiaNz=JJd?P<o%IDfgyV7<4_
z()ARe0=>GH{aczhR-zp_hYiTEB?_vEc{(n7yvCh$I2;i7X}XpE()XjVPhOJV2tW`0
z^e}oPw=zuIXfK2ODNvm44$Lm8Z*2UjhAAwFpT#<p9=4Vx=V{tqmwQUXl~Xpti|rtQ
zIYw>?1DMl--9Cc(r-dtDFgQ61LE`x6CJH&9%FFf#2ejtUz*;x{3wVwv`==+kAaHLd
zbP3}FV9=B8r16cLtrWa-2cMB6Q|?X0)?RB=^+vWOcQ7~ook|^(eM-e@7%u%{oW5^V
zrnOO(#RZjf3_n@HFl1=;Q5jV^LlZxh_@hAsuz64%{)HAygGmJ+t!+=Ut93?gwh}u1
z^x7jRH?FFr!d4zv-Fl*32ZkKr)P*(jcA>*85hpp&E(~@yoMot49%BMST>S>Hw0smU
zde_Oc$36xZD2<`?j17U~j3Cqw52uc6a>p+RE=BSu_+wUMtzP|&W3t9;N>*kxyF0$U
zWPdb$g|8~(s-K@v!8u^Wo1rmI+t^sy(V=|`6uWcB1*DRse!h71fjok@)Q_v&on2mD
z<JbXu?z<nYYLpG?5Cs<gwdR1LBu*b|bP`Vw_wg(8o+g&(uemak^Xa3+-6jDY<$vP2
z6UM>~_M^{CKv^2d3KoKCYlb?yvdA9JSfNRzw?MYi{z(?gMW7z206<NBdVi~okUeMr
zE{3Er+|neKAUwb3Ork`9;sAn~ddbJwt|j+JF2Q13Ts1U<aGf(2%Wx!Var>u@HyCuT
zE%|_@eFH97LS!#dENZ$65W_C#oT?SIqeB?qR~5b>GP(*9GBl)!)O~+x<U;xK%3}}y
z5{j2UWD1-=jjAmv#czfDR;>DxA>;MSC(UCuRx>ll;Aa>jogKWL(~GTpa*BC?3hFW<
zN+#|18tkjEKE}Uj?i?00;E_^tHm89DOe*yHq<OrzbGlQ|j6eO!IM<BI@8?!K??m-J
z7Q`cWn@Mo?7RoLoY|9r4xzrv5FprTy>Cxc>>^EfkOt7N8poGREn85^@96k8`fXJgD
z#xqsot}7)#5XI%QP+(6jM#A({^=4)7oV-l@OB;yk-f7sz+#z;>^WI^MEN2EItLv=%
z<oB9L&3LJRC?&hTOA47xH;qf+rBR>DRvyosG=rPK=WRNH8)lNVhuM1a6hr<46@*mf
zaEOfr6n3x!LaN0DJe`eXF*b450}>FEx^e%mKiqXr!#xBP2shzcJ>EKuOe#AUa`^sO
zpG@EFcay+9&f!hk(!o&nGg?kcZ-DudCq|`#=+DE8+h%NR15n}sHQ@sk$4*(FL1h^o
z!)yeY<w|rb^<9LM2Rel79$;5QcguE{Dv}VF^SA9*eVlj!Nyc^vjTYnKN%UaZP1WBz
zh^Fq2n~RF1`$o)z*G<d)C!veF7#vUB|2d^MlQro(Nq{F#y>C$;ZZzBi_hB?kXtyy%
z;{zntXybnSEzkrBE<T5MP^PK^^wYiO&fbgWkF*CFvInq82nV!HIk!8-O17B*Qw8Z)
zG>R+5%uLqoz3I|$T+0RxMus!B>ih>nBDgbwJR4&K*i4RM!eEh(!nD>38Odq@S%qc@
zxbf$>&=o~5A2kBz$V={@wI;KX&u6RdtAbaTXhr|?pt6JwE!jB+G33qI#H`roifB*p
zP-ix(mZ+DWw<!4Vt<Eg!S@pEzh!vWBgkt3-!zjf7cR+~0Otq}8GR+b!9uqEn3^0l*
zpLlbJn9vpX6j$7bCa4I|IaRIQW|PCgkVy~YMek!~!e~uM)WK@qM+D#qqYX-|3dJy+
zO3=+_cmdR{k(Q&&*0$o=!F&yMA5IrhvqQy&6FtWx=)inXtu8iOI}!Sa&vMYvoO$Pa
zoj>`UA^jz)$J_x6F1%kqEyJvQu!Z9ut{Hy&tfsbD>=ih!T#jec9&T5bR7l-8yUc!i
zBVofwa*u>J7%C#)r_*%6lW+Xjz-Jz6vsVBuisQ)KvSgQdsZQ{28HM#m^DDyXMsL|P
zcS@+PuS)r0RNRFC8kcv>#70df!Hflef6xHfm01(qx<V^ki8H>ZxJtN8gEz^x&CA}V
z=-2$lny$5>n0BDROz=YMK=L&=Qwi!C1jN7z+7%CGS(&1V$0&VY4XWUJw$)E^Sh58p
zwht*@T94pA-t{xV%*P5ACe~rlhf7=r=z6MVhS-SIOtv_Nx=}F88{B{`96a2m@b6>a
znc?k5?E(iZ=n22%DQN{|*cK1S@8;7}@34Oj6hqP<-8M%}MSOwCRIxR;bp#2W9;|SB
z-T<2V4c-PE0cAF#d`Bd34X-nAfgdHK*~o_+o?QZo!#(HN%7RG`&)xBz!go2m!*g?b
zkz{g*DVtqhI+^%eY-`yUm2=~#0}v!6Gz+SETqL{pCvSMZg$ED1--61+^T%5vPs1N{
z+~C#9mOCX_38kY+hM9?NV6<V!50v3-61*N@#yXm(=XBuNc0?gN>r*ZtTx0~--CxjJ
zayA}Q&Yw#g+zHzpK#TC$dkmN}k-HTzuOO{ekju}lpk-MoE=^Kt{1+_QS{>u-!bZK(
zijr!DD1PW&uUIp#BD!I%{>HjCbTkM3M-Q#o2jH+_hu;u9xZmd9!xts+NVj`AILg=Y
zsO@tkuxZN_j;sYgdQx;5d@8tFqU5fN&OTUMtL7LOTs17}5P6<N8CgnQ7fSI^$V|{N
z)C)l;YFD3dqbvytvuJtUYHO9e_Zv_$w7G2QR!-UC5`^nL5Cr_P1po^es^g>LE5y`-
z^T1*`jg4<4b6XMl_ZWXLNZxg{s0(=>)0eig>`~z~aW`&1%OSVN`^Sk7Owvv`p!RG!
zy3}ECfdXN|DhwYrFVqz_05=~fsY?L8x9*)|H;0mNVZ&l}<LEWm42ro6gJxo|7ro#1
z3J5vIIhLw87lE`+WCXV*FZ>({8b&>nAAxuLP%~+{9p4DI*&PFafD9?EfUmqE`f$BI
zI55PxgAV113*X713s21y&AjAXCpP1WpW>9Qz{t4E42<79;w4PIN`=E*Ws(kyX|8z?
z$j4Z|Ulg1=$-~jsEr}Rwd41tuyBXqZS!2w%xuu(DGK1oC0%R9umdMq%K#%q-qIysA
zky8K~%{t%@af|T2g0{sZS5k7IF|lXrNZ@a2BkEcc6!>$jEnetOgkybd#`<gFXtRsS
zVD!!&R*OlvnN7W7C%rX^t>KP5SqWXWM}v%_h6E&r0J<~+(5{17@UFEtEwh``24!g(
zO2!ss#(4pdB`;*W9eKbLwYJ$eqi!8<&B3EV+!Dm0Y)v8t-SJF}JQOyoXmE-|$TnTU
zxqFl$6ajU0P<DyJ%c@(c!gca87rsxahVbk3UFSofgMHrHG6>qQ6&`6?8*C8^*5dgn
zrt`L-*qmE+YrOls#h5^d@0-zqNh>Aiy5bP89j{p7Mx+XN797DEH&o4EmJ=bt$_5p3
zNWFJvXbxf&4-ru)H_mGPjpNUW_uVqY8PWM_8Uj=+X4xbIk$}th@&iZFgm;Q(2k4af
zo;EZz7bY7eDog0Vk)lz<4Uz7PXf8ut(+CHn9GhzhPd)8=CvePsXMPjd<Ailrw+!{G
z-J>$IZLXPc9MK{3T)+olqg2W3=4WY3%uwV=%8;C-R!F2nNV!xDLgE1{{Ha6(Rs=yU
zIE5BcN!YH`>?SNYl0caSFzOa)4IYI`*pFX8k|jVbqTTl~%ri_gKIGdNEhsoEj~oX>
z_Ehwgs5iiFYY1o;AEUJJypvYY5Qs$n6xdOzi%YmDd3ii#1CRT|_IVc2B>%mk3yZG!
z=>&~dHMJ(0aiyc-H6k)npIs7ePx|e_FcaC1qW7>Pd+Ti|#bbyfeRcyWd$;t;cLJE=
z`x_V4ax0q=sw7lef{u)yQwF#Q`j)bRO^u;b3o8_|H0Dlpm8g7(S9!J0dqhM6rI=L0
z@e3<yD9yDs7Bw(Z_i{sb`yr)k%2#7;t9cjk-n8?IFovvkB}GJ=FD;G@As3b$HooRF
zNuI_kBNX`=h0&%aRu46EDC`nLIx;L&JBC3<y{#wveH=kt&0ERQrg{^(d`p0ypn*rY
zJOj1it0feIF=_=zJW4QZ%(cuCZy0J!T-tbMdE38DuZBn2#G+$E-d$QH<#R9qHStS~
za#(LwsD+glyn~&_N$f?&b5y8#8tQUfrT9=-Eg&TVVhpD*k$(-B<{-MFIb<;rY79sU
zyd&}|f9<nVNdSo)^cm?jQzJRe8FCu2qSE_TMU-E4Ga^?V0An+wu$_;JGgP!Z3Q-EL
z0k22#Iy0e(%j(HiDGx1Co*k71N1&9>rfLurfS*|pRj(JpH%*CG(IimkdV*q@iRRH%
zbvSM^!CRxEbfHXLb74CukC!Fxrbg{ftQ=Yf<6H<DP_%YAHmY=jqZJJ-(@DqIb7!@l
zz`_DrL_KVKn5A^Cs`0pRQd<VmjR07vTfsV^o->dT_-(UMk7RHq=RRk)8*CS10IHz6
zl6l)?gdA=vvNW`!*jQODp7ltDAA|->ux|X1t_>)+w$1i}TL`c6W7E8yPW9Dv>Zln>
z6&W0?yP=z3j92Wvt`9ejY7+_W&V|oMhqR`U$z*{T;yF6m=fwN^8<a^ihXP@x(9o7f
zPg)rGle24aat)$othpjh3we*nNx{3Il_2lCXTPaFNqwVa(Q0k=PH8%_lya6W9;;dl
zymw#7?j^DWbH*dELe>g16r)l9UJhaRQPG1~`B=5aqQ)E^T_0h-EjIOz&FqQ*gzePl
zzy}nt@ZnODM)#zywOB0bR(#%4>q7G&gM~IGk=A$z`@MUM6)s%gXmv~0_M<V6hapFc
zTfU%nH9yDR6r;PAZhL`sX>g_U#x7!8Dt4_w0RDH17H=|qoM-QNgT-TDghfG4$*c<R
ziD^-W3WLuG0F62z8}~Yc_7IRwH$k0fe5n)$051)mw1{Qh=i`_~?czK}Ss163VwD2C
zG6%ER2vGryqg3d&#CG_2oNT%Mv<qt(`3<GNDPUhXy5KUQn@1Z)FO29m$=iUIX>l9`
zLQ&P^xD>6CWw5;qIQV7&(Ef1D@9D68xD;Y|W@aL)p?DMMW}hbwU10U~G#Q5Ha~E85
zFpDb8=aYU{3$OAy6Tkm%&b;ZyDw}uy{wkk*beH`@CNHR0@<V$Ja^tLxu75T<LtD(2
zTtVi337kiMDR3x3O~Nk{?HmE_@4ZQiLV&i~J_#%m^7zHcHHndVJ6I;3|Lrf<TalX4
z%J}*h&E-XH2!3%~a|CF=ctt)BjlTXuCSRTb{3Y2gq9`RUjI&WxwQI=niN|9*OU`D4
zp{U5t+Q692CV<U*8QzpxI+?O>!3Y*rFLzG?YIsik+%P4yUqlIdgir^hu?ZLoVXnF;
z3pyK&P$DTEt1urfipyXfe}Pue?4_=&7VIvX(NqSjzf>QX#VZ-+B@PqQ3|?ByroWBI
zYhX#A(+Qahi_n3<5QjZbIl$ZL@_Mq9ywx}A#-ZYS=epwoXo^Y(0vWb1MHqr-tMxa6
zdy@)2+Q7+7e{xT&<QL$Ki*aJHWH3ApMcQ70EeZvjS0w&IF{B)TJ}_B@qqzr85RZ}y
z?`G8ziO89`8##9%B^Ytp7T>hV;Wqo>U+VD9F30<<RFB_l2bxrnbiD<;9Vt-!wOFWE
zb4Kv$MoLn=*ahMjPr*=`c6ROb=+uFf3(+5A5z%g-M=CoCcG0)Awby*|`dRhvU8dm(
zP(H~aOnNRR06!WV_d!O}PDI9!K79_g2aAFs_y6euDCWd}NZZ}v;Oq+ofS4cu;j6E|
zYHY;uAL?I!`$znT-{WKBKj?<nu9Eut*BAieD+~bf?+@tz7z3vM?W6iP`2Y}m*Q53&
zP$p2Dlxo-#V0y%P2ebA9(IEI@!NkDi0ZqPZQ*yn>iz62xLPkm*ydDicB-wQ~?OlqO
zbbHF)(cNLcGpZG|fYtWellRbn<z>5*9GxUTRIwnbYVu|O0?03YpVcH}L^hpq*Cf8x
zzBxWX5DtJ=vn)h_j}gF=iGl<i>_537MnHS^f!bdRi^(&*trH3SO=HERB0fS7Onq0j
zYrq<0+xe@br+4mPV_2)TL~Ug~z}#)L|GRZ_M^8_hukI{iL;m^xlUK*hr~5zLS;EB0
z@bgi!<X_VWWGJ>y>*>z^!JQ@SUgk)Q6a`Pr*av&q!WE^wc4i#S<723P=T6-|!N@^(
z?lgS2K%I{#>3MemtXcKWok|6@sMU>XoUCcsnvE0)sSMmKgEP1YY^fC)N^uw>j2H>L
zM|*nVt6{m_rz)$1>e+RUpL4y14M9naXH;<i9l-yOUNsM^U&I|IumO-WJGkMPVwAV8
zhP$OxNyOl!-|leGlGFTiYV@i-7z%fs91KR7uJL3xIy!+r=@38-gLNM7|4>VwPI|p3
zCwn!D;nJJp*JNk^hvcjEMlE^%>h%vvz0Sv%9OI$QYrr(HczlEjhxCW-t8{{=e9Dnm
zu(5W=8pqj?XEkhJqrnZ@1dnlwBMuegPQv=<I|&6V9E2R9B_iap2rzOo_aTLvt}t}Q
zrb-J#D7EF92FkHJ#3NY2m$l^h^kA=bc=Q*?GE*5<RbtZ^lS?GJ(0q5u(vLvB0d;}_
ze&$(l@hE*87_+q!JgRnwP_{x1@BxxU#kU@PpT_>+lg(-px;!vQO40E>_`+v*;gf4_
zzhst?>h2#1@DaGb=Z@vJoKbu@kDzlF>he5<5s~*GSe(uJeYB-(z1lgYsGOu^Vu%@@
z;rG4293AgD13`&`fz@0r5-eRcMWNWU-t;BWEKh-TJ8WO}b}9%tHR{h>2^tOl23iZy
zH|`34Rfc$|0LFlunN+yu^3Ojnvxb8pQT1R4EiXEpjnpa(l?>r9mSQ>73iYx4^TzU~
zZ|fZMMzOhP3xkX*kdw~~!e8@;=I-A9F;B<45w|!W7!_?e`v6j^JAd3v#BSaX*zOn}
zD!#i5HjGmK(o0(41Hi^jK6IOQJA0F#>Wx3Y(bauQafn~`vaEd$+wk=0_~p)N>t*xg
zWanA4wg2q!=otPSo-~h7Pm<q~=>5~<qnE9dA5Tu3FEs)&ZzK(bLRoX4H47TONtL6+
z_(bjzzK~M78$qeQFSf*Vq)huy-JeHG(lsOQg;74<g$GQCS1Qk8x~DsbyUpsCxB*;i
z3Eu(-P*b|vsR$`ka09rl2BPYpjqw4RUQN=@PPaP&IEfah^cE<Y!9Nu1|9G(X4?z2e
zjK7ubNggOC6o%pZ$6@u$cIRR(ebBugb{Vt7^5JMG?O_+iYHwT1$yu+Du6w&)a}6A(
za29+MSjGUk1z<0fcexFwu}}nsT5upY3m*3YtK##+6QD!iHM;}GM;V^bO^>ipkx@{r
zav$Dd&JHdi->^;jib2NI79_+T{;fGF(dg0%x(#qF`@@qXQc>VFuzv}7@R&fAqIUz-
zhRSC5K(xQP%KIbZNP<tJh(Aj>2Nm|W0o9FwI$GMC)8Y=?aB(9lHW)Am_kNPXwXyr^
zHN{Gs+Ztp1xIL8Yb4>dAL+Nw?1;mxbrmjsd6P(}t5de!ao5;Ephea~iG@)9V?ov*%
zb2Dx~Jb67r$l|NM0=v!M7<s|l!-M_97cY<YULQ1DN3Txzj}BYM&6DP7>tN@vKf>3i
z&EqB@yOYnp3UUhpROI<)(TflOMVmB5>hnF>&z@nJxCt8gcR14cY)S@m<PX!CwAnj|
zty4KUs=A=|EB9K6M_QtLssz!Q@Ei>(j?a+pS1d_zDy1VWs~U8R+5_$1PIk$^D&BE8
zYxqN$pZhRxcV$q;t^69C%m|#EO{i=eO1r2dv!~EpE#ao&d2Tmf9q)g?bJ|S8&^YE(
zROz^R`ug~=1>c&-$4AF%F?F)n1JsgUM}w{CjCf8o#<Gjh%f-{Ku3jM$^EisIj=e>B
z<-af?aCmZZeR-A+fyT~wiPQAmY|Ib$N5u!o-u_h2ncL2x+Nc)^oO1$ST%epK-(VS(
z;iHH^IXn^C<fzYs#gSCM7@+|K=x5OsSoLXpI6P~2-sOd$pFuV-nZS3u3i=8pf9*3m
zyGD|@ckuG$*&R6ERtAkyNZg1Xq2BJM*yLQNGZIOoLH-nGLA1`&Z7?uP1d((t4}0`^
zn3a3L-*Y1?6`(j;iGTRXGAqDe;mwyD>F2??29J%_A2&erO58@)wK66irTFCkDf?3f
zN8Aar8EZQ-4mfg-LUzE6^l|gq{>ka_kCemO*(4)SI`U^E$uB0V7bRx{Y>f4~%$K{c
za;%9)@#M%?Ns=-1W&*e?Rc7sHS#Q#9PutRnmkl^id~77Sh8tSliqnxZ^rrczW2~&{
z){43r_1@clRA@pg%;nU=XGN-ePjnVX^rp_6ix#;h%7G;#ddQ+eYYp@A7Q5stID?#^
zscilZhFE;;xLHQ8t=4%bnYPap80tmZ#Vn7*VWxY%oF#89npyUI4%wzqi0Z)^2bV>f
zItqYz-kDw&aWe|;xve>95v<L0YwEeRMOb4rX9rdhy+)#fU+)xf*`9dVZD&DF!_t^J
zRy%XUK`cQ(GAYg<W6m|sDiA?%5xv2E1?+!*VS8b--bf5f3+eb=9LBs1f)Ootiv3u!
zAe1wNe1j;c;=aig!-0!Epa97oeSw|zL)ydn@UrY8Xd!1{CJRMZ;C!wb*O4vg1jzj9
zV_abi4@QG&Nnt*E6hj31@_U5?)%`*v#=+F>8W*I9B8tU`E04`e>cPx4{(CQ8MuQNk
zolOzOU9v=xB3q6UO4msGpJ?p~MH~FV&QgUK%Fo)(fdLI2&>gjtJi-8tgP2o!7|aHG
zt%c)cMHgEdo6Y@vx^H>X``c_V=`9<R_s^sEEW}~VGLH0Y0R|ax6#a;7bN`?z$@fVA
zq;CP6O_tRBneEe9Lp@N(v`C;A9tkcBoV?<%K5NbTmPDzSiePB-dmpCgRXoIFvJi=3
zpANAfG5(SR1@sJwvvy9OpEO@p3H&vHS@v!)_6qsT&(PIHF@H56u7Z$QI#Q+3Sowgu
z2R>y%*T#{J{KmW`fa`Z?6lTyCjbas>9Ey@KkZuh<_;Yu|WKGbq^UkJqw0Fs{bop^)
zw9#{xoq(i_WiI*zd*%T!-b$PnzEzy2`V;}m^(7`9_V$lyB|UA}AM}P@r7W6<-|rtE
z9TH&yYeL;&S&v#{<&0uL-S09Lk%n^}1I_}}unxpf6?jxlLE9E3&64f4NO+=$ixEw`
z)0vS<Twy>!SB8_s2f|&q<T7bl>Y}60$WDL7D_g3mLU3)p+&O;1tG|%0ipCp)n+kFm
z8959iWOo<ckO|m&A22f=Vp_Nsw0Pin%h#+<D!hT(Q*MQ37~Lb5eEoU!^K_JQS(P!=
zT%!xkv9KS>B+b{ZMB3{L4*<w>oMzboadCJ7x<HZzh{Z$)&WSY194se*uNCgT)8kl0
zC)dVyP!=dQVn*gdVRM2-N|qks+9C0uJN7XMAq4rGqyWIGc{-M+)Iw3h4dju9>KG%<
zC7a9vPz+}<3qr0Z+<n>Tf~#xtaVAy$Hj&9Pn(gBW@OT_YLqwPK=68isPcr=Ib_NB4
zn=<HBXswK8p#9l!cpX8BU6;#uNL<il=0FR8KrvF*%JFg&x8iO&sV*1Y{xd`yZZWZF
zHIX9Z^95BUi>Dh~gq2)_4&{^4TQy%NKH{&Ao-PrKs>K`*E<e)C*zGd<EX;<};Fk2$
zF9z7%8^N_?{cZ%;BA71*-OiVXU9-d<ezZ%klnxmRf8^cL|3jhNZo?!^r=PkNpNvrg
z;>8~ZUW4WJ<$wWm6h;}*jMrYOK0XDc9XC6s&_l9vC2&!ArQa4zXe?2X`o+MaQp|4_
zfQP_`aU-Ov_qLQ*ua<$0oL-DlPgmK^SAPDI8;l}4pp2fCQHMlAxLRJV9<JEOyCwXN
z0p9VXmzQSe!S_aRyqOYSlCC@yh&0s8{_535$X?e@K>JcFONC=utH-#bPzvi-@4JPF
zIA}bHhV;|&pR(mQOQyFu>?WPf9!4SS4O{Fr<Sm!^vDhppE7kk1WHl$+5k~&Ax6nqi
zC3&fn5!3RJgt58jG7b)hwD9U-*zmX`hJ!%Xs<O)FUh!r%3ifK6Y91urFBddsFlEvC
zcb4EUl#(N^(N(NkiG7-mO)!^;SjD&KQ0bz+%%xrfZY4aV0xD#sDIwkEmT_k_aMGev
zIhbxr_8JaCYpkgG{AT5=9-TfZ|JkR{wKMPZ&F46k1Iclo61@;sEQkzB^i%siOmM&i
z6h*={5thV7C4zw9gct8_9xpp2@Tid6@EAFF&o!!sgA3(?5qpQ)1CiV7;lfA8rO;2o
zihv!a!u(JJ@#Etu7+%!`O_%AFP%~KAIr?#LA)~}35w9%+Gqe(H;djBgDPlx*i+fSf
z4pS@8MSTn)==@?D=%DoY8Z4DZ92Q&sgpV-hrB)3ooOp}mq-GiO*yu1YIiFD?nyI_R
zT?+;KIGK%fxozn=x<7T3<pmC|p2cV9cE@BsTnw?!MUsGJ4H#)wvW(7Lm^MZi)Zpp5
ziQqAv%xE<&lT)Oz(>fftlLBCIVqQ1FPg)-8zL+HXY%`3{7sT`Oela<GlH{!E`@PXs
z5qW@5_AomwfVl+=ik$%XUV!_4ds0<fcXMtLACLMeA=3U*Sj-`3JR^8f#yT$1s$`uQ
z!OgjXc%kU#K{)JiQaKVAwaE}f+X^qDSRt&i1B((pHJB(Cdv#Mx6oc+@MR8H1pyV#d
zb3^h<jB@u`Ffe<YaW|M9MrTtkKQD@AEw0Jorj2~m3C&MS8oW=D%yiRf@e<byaWh`o
zORbkn!Eo1GFOipvkZOpQbpYj!9`3ws@_xgZjNgS5;t($^S6RwtP8bZ7iVsHGzn7`v
zA)uy|HRX1tJ!fkHPhB_-#E7j|JG(D-o;4B8DXqtXFT8MrZY~ESAS7uJ=s;gB<+|M*
za0qJ)EQX9>sX)d#Y{?LAU=zHkY(A$Tx7?PqkHNE3CDB^q<2|MQh;R5ZOagaqz{4FM
zMg8*TP44~;=v`+qQ^@&+{EuoGlo1H;GSO9@57V>ukW;Xe`V(~u#sr5gUrF&m7Hz0^
zs76%ZK?@1Hz*^<m!O@eQgA-XB2Nrd&f)S+Zqdi$Nmo^kOxj!6qrgQ>we2ayx@^hVs
zyW*Y5?ZOrXYcwDr{7x8Mi{C4Ibb;hoLI+&f?Ly#LtA}Xd20JV6VnntF8dNNzp>srO
zU|h9nsv4rUz^Y0RY>dY~&Ow~+UJ{HZmyTa)i~(XL3x!rWSr2m=l-&4orYSTXUl36g
zZnuE30araR$!4f_FE{w4JO~n5_-NkqNInZ#QHQ1L6`zVZNU=qz$lX2Db$J3n*?LxF
z;`9Y*!lXU>Fc=O{mP{IliU#wXpfeqi#8vChzVrGAR9f7*v-ER)Denu3lJU99Hkd9W
zgus_%bhWUeJh<9>{ZhLifCz+6X}VZ(?QIaR29tC|%#-579KT>ZaiLq!Fo^R-&K!&I
zFh|c_+T2{ijKWKsvV8E9Vhv$hOnHRwwJEP)u)27!^<nD;V=H05-?WOhn)V%-U3juK
z>`w~I{Jpp%P#4J|2m%_E!MlToA}=Evz;W+98NX{Gd71r$s2P{`*CnwK147=Li+!xo
zE5;}MhQIR*cB#aFfx6r*?F?$goe3#l^K^-HCBjU8BR>}G%o;<pkP17*s-djAW)!~e
z`)(~z=SWA`4QwOYaP7R>Pb4f51=3I&uf*YXAf%x|hKO+!wbOKW*#R2b&a;!%qY`jR
zXfrww<(+r9vLC@)8SrvMh#dq*mlUmpd&e8K<^Tm+i-S?@9=!zc*5cKq>~2=TDjaW~
zy0PWO1bjZDAqb&J?isIvz(u?U@m(gi&QjVrj4M=ayrFbG%2|;;6^rl4-WR}ZP1Y%t
z()#2q+S1^S5^#kKVzA}Dj>Qx0_n8%ou7+1;4l=wHm_=QZ<$ELqmS3P1Nil_3ihz<7
zcpg6*Go8KW)1B7`r_v<yLedykDQKx<n%ebk?M97-ZFNjz_-2ZhZ%EP(&J&bEOfF4^
z_W}{LH{3!M&QgG|g9l`FM30J5zVV~?6^+qB;j;5U-H|l&VybT09LF5-U&a}!m2LS(
zcZ+%yEa<yL1SB1nw-+ey7N*8R<iZ$SZ-c5a*F?)?&OyNZQ*=B7y1LK|csY;V;PU%t
z$K(3FKXc;0NwBJabo{rCZ#KUACXWAxfBuO7_B(uR{5Re3+Evn6|MPl%y^i7EzI{+{
zJZOB2;omkIj~ZX+!@o&<T|P#YcRhe2%HJh{=Ea4ji<C9cPt^tD!Nrl(T+}odG>xA{
zLDP1Rj+-|`O}p$}Mj_KUq;K>P3B_LS84m;f1zmcjlU8v~N|N#R-uv8h&vx0(Hd(>!
zG#Cn#n0IPZ5YY52(5WMv^b8Q}+V**e#)JIQv)z;IJ+3fSw5}?u6(sj{8B}*hJM(PU
z=Y}Q>DI+LMIx3^CnGq8boud2CeI5|>KHa<<=8ltknmUeq;Oueg<weMsI*y2&!Q<%}
z2WAb38b1OwSHdFFCQ~zFb?g$txNOyu_e9*NG7|{hw@9Y!Tgez#_hKD?nJk|4(p3s#
zuM$t&NgLCwf|)*aBk@D8>$s@EpHwc~Qp&YeoO=YpM$&&!C~ORwfAJ>=I$QbHs@k6!
zJ4?%GbuKhdAcvQ?Vc<;>oVsg=YJUhqyeAA9VHPjh0RARfEj75dzz9F*;b;O-t>*_B
z@R_a&csVSH<Q=$yO(pzJ3)rfK4f?|klniv*>ohAnh$vfKttZ<_1;a*R8v0Wp;)Sx8
z`qeNtl*yPjP1Cc%xe!QG%|usm{noe`r<ud$#m=fLwzbu`FKKISdzxLX4|^DYYG@zH
zDqq-VC`?kR`)&))%(O>nC1{Hh)|k{0_8o>xm|Rg46s8zZXlHy~nP#iN&(MYpgHcn%
zl?rcImC9ACKMmh#^eI-?j>s5hgMqUMw_KQmq;M6CS>WEGg^K|0@wBl$yY%2nK^>P+
zFmqr#a!DL1h_O7;sN=&K9?XXgGZYFKt?>SMOGA-AXgC<qyFt$meqT}j8-NG!nCbg&
z<THujNFnYOPN<>V9*y|UNpWI1JXR1;edu^H9hWo-6#1CKDQ$0mU0qd;O<$vYp`1KL
z$H>t+>Yhf+Qx5mcMk*PNF$)?T*4+&<tZxm0!>w;`VK4Y?jlPM^m1NZP7Y75!Me<(&
zW*3hi!+0te+uM!mYB(Y6lOXgbXb{6-yAD%~E9Rh$j?GUBYvwua^BYBzN$NOn{{&#k
zV`06w3~oV7i}riDFjC|78JuE(bOfgg9<9r9g|<?&5oA@|6?Sv<@xY0prA{u}*J$q0
z?X|le(_;^V44=_iuO%teh4mPn_ZS1D?iMj{XVJgUMu31vA`Uw0wM5;tay}og(JI6P
zEIAv;5UbGS5;O>TBz0$c05eXt9%Ef9R*Ge33e(bB4#j5Zl@_$b_13m$^AM$Kf+X3V
zsDNm(xvEE>uTPrCdpoB)zF9`ondzq>Un##qn~SZarxGZ=zkyufwIo`m((Ypz1Ij=&
zy+FNJ)ec3lB1172;xe4`4O=dLW02y^^31c%|BGDl|DDeq{=a+nWx~JT!2dTMe*N`V
zG5^1@@%114|L^g!{J(5Cg@3Pad}ZRl|M|hjS4sWPkG|e`RR42c0I=_(Hj`x)+Eu}8
zy!N|fDz@`#{}Y)0?jVh$r_YV3?qmZrk1rli-73txXQ;E#Xf0)SayfZtK7vT8uLbwu
zuZp>f`S$4ASlTS6i#HJqoNIWfdY|hH0^`eW7#}5?SNCNx9cXwlZ+mi1gD2`3$s5ga
zhqi$J0T~&fwPqo+w}f`EshWZGK8%6d?R5jak@zGu0x`5PIxV&$SY&tR*hm&_jB2{X
zh_HTR7xT?9BcqH)&M2d3{%Wq7*>Ny!sgO}%MJc71ss($nq#`G#E(0BY+E300S3v);
zjBTlW#%j0#JCNn<C4&GW;m@n^w0YZrt5Uthpukj9dLG=+Gww^&qhvL@RhOm@w1Oil
ztVn*i0!PFrXct>FDjgnYEa$URd3!D(j%{((^4XZsTyrC+DFN!@HJYNrlWcs|-ZUJs
z{Z)_5O}s@Y&g6g&cfHiMH3*kt%o-jBQ*b3dZ~?SRvPUgv<&d{<@JAW-feV>CV}`TI
zx%T1a%Z4s~weREBVJW)|Y7Q(`B=FP2E0kYFrCEPCI+-m6XVqmHlwyA4EvgsmYgmN}
z3{s+g8R+DiY;x_{$fBEI*t_ZtHJA2;4s{&WAj)DExrA61bU0w`&U(jfllQZ%jck0d
zQbn;Z3ZRC2+Kj;hprRf_e{@dhE^<hZ+QFSr%Mi5wr6mck7rXdu)LwVfkY&EHAKdW)
zCPRet#Z~>)l{c32C|o>uU2n@L%WjPoi_+p|>1@(L)0p;ToxjTpg{3ai$+QJTzZBG;
zVOcU6Si<ypVyeKU&4a@7z>nwagb$0x^!}nf<-+*QZC~N+hs(0oLC>ApWCFJk_QMUC
z2jwd{D{N~t8)w`Iek-p%D%l6bJyPGB%;rk?IqR?a^FGkA#<*F*eyQETaNjs%<Hnb3
zr+;HRco?GVI|yjvHR#w(0fHT-opzyl>8&wpjFMxA)%a|B#OR48RI=o7BAFH#tQSWS
zE5#Ifgvm=~f<EX9&^Yd+Sh8?1;t)vjXWf-qddn@~H&}eH%7hvP6hU+$*y8mZUEt}|
zf86%|&)CWwNskpC7LeKD^MX4lzh%<Eg77h)YXBy8HfE2$0)p~f<GmN28Pr$@J{;0<
zBU*vj3>*U=V3_HMXbCLQkOT<BM+nz2O)(4TZX%=3yaa(2)qI4|P2)Q~NK#aWFsdex
zbP3}(_AC{Iu_)Y)z+J|K@T)-2t07;AqgpNH4h#1o$R+7FO9}MCvo)uo99TZI;|ts0
zkoF6L?!0LJ*m{0+^a3?>7t5Ow;eU~)@A^g5J|EK+^x?z76a@3(@7MsPZxG{JG}`U3
zb?_1obx8<|B{F=Qjqny+nzo&f>(WQNSve<P7xF+S;tf5?2fSSVQrhG}K@)3@2*h)q
z)*%k{K;>6}i1YSjZJPqzt6e5Gi4P5hl59JsypY?Bic3R;$%}BfF*68gR$TZKqB*QD
zy1D{33S9vy1#SCX@3Nh}3!^n=_=s^0ZKJ;fsI1B1E;NW#SneR*L}h+sxzEd;lNY-?
ztQ;vQKPf7I+&nEQJ}fGJuz%Rp@-$jZ16(kQqt}P0=2YSP&`zGFJ{$QZ(Fxb=vKT{e
zyAV|4elX{1LKS`*tge#Myt7<V7$zK-os^Zu*~W#3R9K!l{k)%QmYXXbv~vt;oW7eU
znEcY`wA>rdpSaMIs+fg}38w{zc%zVlY^uwLUqUtED$XIAY6?UMoVrra$s-jI&*CJN
z5hSFeUOEvUw>)bek}<kg6s%cI&fPiYQSn!@XFz~S`+dT7nU^3N+A@bJN<2oH(s8RB
zksU&+<w=jk4N1i-hH`qSn9R+Gt~ECyJ-muC7=0;$Y$4v5JQv>_A)Qwsp9moa#ahnb
z8m(3cDhdpltxGADiA<gapooOTIR@Zk`Y;<*>Ji8!%nk5)3n`dO!1whVr8PYOXjioU
zX88!zX$(OzErMW8Z^bGDEhzLiZEjTqL$C`SKFfKN*^o0q$z1-t0vNa%3W`XG#Cab3
zoi1|Wnz!G@c~<-#RN<|sq<sN68VbTJDS-&Ct0f;F7C{9o^a@~t>}obQU0_#}qp$Jx
zh8WTG$FpfxLA4q;w4Gp*lqp6`Gn7ytS-nbGvOQD`j^f}FWWa}}Gg=G%C#FA-maK9k
z2}u7a;w4wab#WbY_+r=b(pH6M-$^eo+oNt38aD%=6;{G&ga2<NtvvMtab~mtZjmSf
zVDRc=0ixar;e@ElSzGC5hlfAf)XUB9n+GTLJN3pL#0Y4<2Fxzn%Jv5n2{52fIM})I
zJLSraJN1pYa@K<-?-tjNfQa(}6-JgPe>r5r6;05XsL?GII%QLiBt|LX+>GC@udj=T
z$`=tj6p7v&{<<VV!PXpMdl2(Ij#uOr7}}0gihP&Ufur59viJ=(@}jVp>H9c(zX`%3
zF%_UKoLecXGuX|LR^b(Fcy?KM69}IZzS$I?0qbG=`gv3y<x7I;PuiUxW)ynFCB?8i
zFZIFISX~X37&LiWrfmgnya^oK1U7Rn0QyCHl)M#SUgl@iNcLT5L{}hsqCrSiE9iII
zxwgj3g`N<}dFockF=)SrNF%piKTiRcmyDq(pqpzMpKt1>bqa^*gSb-^k$hu`F0bOD
zkBX1X3Ea?^h+YSySue&+MU%0~TdcBV>0~sNAVA@58YXagRIHU?o_RfBne!ZT&{X$P
zu_8c%=Nq{@(hwX&KTNhm;-T;CvK4hi-jRAjeZY)R`X4}o_D_9d{QgVn8twEJ>W}OJ
zI~TLjyCrv%xbqz}y}OJS7Qv(Ga&<09Cf_MEnv9%eb}<-oAi4m+7hjymu)TlkZkL43
zlaJl}5|xt&Kp#*p#E5H&B73EsZZ0_|6z5Pq)yde%xTzC~0AQxHk~pc0;RnBvAN~~)
zoHavr`&W2c+$;RyUy;Pvy`x|Lr5Y!>_xivWaV9UWjC<k>i3HIVk>AeE-%KkDrj^-g
zWx=$vVC-2q_AEEBEI+U;8dw$&%v~w`UMP-|umC0g`lYn)u*e5~?}_t(Cz!}X&_CPO
zujn(+{u8Iae)0Kz+~EJ&*!b$}oc(A05C6~K<rCO{@`jW9=flO_KX+W*8b#}(#bJut
z8;5e#j>RlN|8>x(RFFKV)`hX|lm~YU{WU$CGwvMshLthg7~|?4@~x|ohYLJH98cbR
zn2(eKGgN&&M5XYz(yu|mJC#bM4+ZfFB3~rWg9ks2J8zI&Hw~b_l;x_Sk%P5u_W(Tw
z*0#^uS<gMHG7j2rp*$;5*V1QXH9047#_9JQx--31W}Db1Nl22S{`rP19Kp%--99jT
zb@#1N(nfnSm=>kqjwb<4-EJ0f{cr$+$Dg&*32@N=i2mnx@8>_6jc(3;atUw=B!5X0
zRR1!IucE@~lBkqZfpZV9CMg`&mGN{=dA#k?aZ=fb3X>UAW@xjh!Bqa)Na~NzKkPH_
z{!hPz^T)s3bpJp6dZYd@y8pj<*!biA|6M-8{hvzghlhU_-w(L@H|h`Se@^h~|MpRR
zqbT?TN^mfW+OEWW00c6dkXZ0w*1o;pM{oMe<@ggFKhoO=gb<=9@cMv-2p=F}6FoYQ
zA1oMIA{`@k&Z4K|_9W{~ZWV;WJfzbbKZ{2*8+B*6u))KtxYXYVskpm*ewgYe-dk&v
zUI+6K80zq|vqn1SNOFh-Kts3V<QJHp2=7U-#h^&cJ-!F15;K+D;}wn2Dq_k(3!Xwt
z3B>`pN-<CPu;)_aKsl3|fG%4!ecUu*LH3X%rS|{?MW$Hr4l648ln%SobS!o>?+4S)
zMN*L>PNM=8BZrbYK7QGJ`N+wRpr?#j-v(Kda#JMKV83xM$AM~C`Q(|8A;F>ljSR(h
z1ONY&ZX{hB><@pT_%E1caKUa*emp$g`QcIS`SI(+U^uX}SvVLVtT8d`np2mC*&~3g
z5z(K`-<lf@{wFPMNz*wyFWP9J^f9PdizKhD;ove3jqU9r#P;R@J<F*u3Srk0{Y}Du
z`A$lewWRsO>G4kM<aB5Eg^S=y-V+>1pw$_mz#A#Lmpeb8*~p2;L19_tdyIuUq8uRo
zVfx-@J3$K+ifzEo(iCw78in@Olrw?GjbM~Z!wMvi;||4=FL?{tC0)*UmhfS~%tynt
zv%4?C64OM^JVIAi1lmQ1hYukyE{}Z6jC_-y;xB&Q8SpPT-A`Mb-SwcR#WbS^KK2Tw
zvBapr$8e$fyeYxq#%6dtra2zLXqS_IyTS2qd5bIZUbNeFmKEioN%YK68oCp^g$@5C
zo&3k;*m;qE4DiqNVv@d}gL#ZQj&DnGjd?^s3A01Tbgs#OLA!YR{P^fEvXHI~tK;(R
zxmF0~&aS6Dhu}P<v2XggJsNbp+Q!2I_7qm)!-eU}@vVDk+Hp@A&-6aPsy2VvKcx)I
zuaBDs0EH>qLw!B4ZDZh^$loJg#aFZw{hH(=pLMHc7t8P$g1KMT-Rw8yfr|;gW!Ekj
zz{KNEO;!``{C)0$H{<w6Qfdx=VNSNP(yx+L01L^hdAKp-P%Sb?Nd%-<)VEqs>wLaQ
zIt+X4J1Jo2PVvEa(vD%5-t(d((YcS#TPu9<eaMs9c+=wXin|+p1FH__Vo|bSn2mWy
zkR>LG@@4{$T*OU!Ju`uqSZ{*yJ!V%>8K4eBI8?$1H}o0fucSj6AP95e4<8T<F_}z9
zzm~Vn#RUyk-1nO*2%4$5@8uOf2AH;Ta6=Cvf|5I-6v+qC)8frfwt|63{_tTKdy1~C
zReO=D8v4uJ#zPD)BGd5k)3jnOXrkuEr;x1Y(f6|D%Gg&tI6t6O6Isii7omfA-AfjG
zcmKwf_6G_YE4W!pCoN@o+DxFBU~<~5o3)TIL7*_b%N;pFLl7VeZ+EzxThZtQ)}-Mz
zCD{BToWqS+4sQNJ9Lec(JEOUuXJ~&#TQ$g%-YA`&Us!{(5T?m~dL?K^Z7#|y1n{s*
zE)0e=@_U0*i8nL2(Mw50a*Yu(O$-Q>KF^bHo{~^47jp%%ZCswn<C*gy%mqJZWd1()
zLQ`WSqGMZf^o86;tE-GCqs>NAD{sFjBoLB#{FQ6~9F=Y@4n<}kSQ_5HA5d<JmdDdc
zchK**n622N7=m_7k+s{5N_GaV;=+R1jY)*HOd@SKjUNdz{Og`tONcF+m|u6P!B*{P
z)_e-o51Nn5szdbwpC>ivRn7h;+RU&f)CNs%pQRiKI-j7;w{<gn!CS@Vzq$lyu)cpt
zs8+eS5fb2-1ZQwLyA-oBIwI1$UpC%2=GbgYel<Pr*DB_;6S9@DMKpTow?sw{Y)Ly9
zWrHr-hQ#Ka5m{PUA(#=vGqb-zDKo@-0jw1cs=k?@zYuY5K^f9~{o+zuB;dtZIMMF@
zGJ}o0YERme^IUWWRWR^*YIl%#ih|k`e(euFP<4vAIhtLLp}9+9h9nZ$#k759LSk{>
z2rihR;6tzL=%r2R1=vw-braBlbbVK(1EaxEY_Dm`Ktz?sqyK*Ac<1<8RZcn#Z;;7s
zlluw3Y#lb6dnZ^5m~073*PgC(_;$Fa*0Sj}OoD3#y!Hs5!L($^Yi7t~kVf`}D8u3e
zcA7jevw$S<P&}~bJ2Wf@J-d9Kp6yzYiVxWsBY=GfZ>A)X9f0!BQKUoea98Mz=yFa<
zP<$9b5D-6#1PgT}j;ltDk0(cwy9=68xlThvvph#$8y1PYsGukZtT&P#THe(}5sC@)
zK10Q`2~<B?)?Tnlh7IjOLfml=MIx=yQWbh7godNRUaN9mT*d)PQ+Cy3XiW&dQBHu7
z5jkvJ6#kXVZTYz{j7WxNvc=^hE~6w>^MVbirG<mm0h+jaSTWcm2Ze^c2xMw{Y~=K<
z>I&PVW#348rgpb08|xOp8>!;@n$ApgB-a@g$)UnQCSeODMje%^#-soXd2;w`I=Mzh
z=JaK;5*y!Hw^-#hrk8vcPRTax^6XlqJ?vX?`m#m7S{_vqzv(Y{EH;Vncj`+?ihI+k
z@gbaE`nZNh_3wLRpGm3>>wJVk@bS(e!8F}K-sHMHP2OUqWwY^P12bcwzQ~6N5W!kC
z-1jkJ2Tj`6nY7p{j*u^NhVjio6V>bxD%PO;5v`UbERZt=cPBjaGsDCrLUo*D6sn7~
zD>j!T1##AboY+&6I9iDW`$Lg;tEzus>_BFqJ>SoFF&wS%7F(WqKwA!`qp{Q@Do0xL
z?nQgTeAE<XNk;pz2-DNHfE9!StyZlJ309($%cx~RPS_6438%u$U6wT_E1h8hG!+95
z!BiEOPxjoIXKN96AIT271K~l^q*lXaf2&oO?Vd0&&4ud@8nfT;D1N}lYuiJ|+`+m*
zweGkh3@!g~^Xd%oirZB|_QA}~0ag@HN{_?I8k^Ht1f=IN0}@}wzKJ7KkSv8>#*1E!
zaJN``CG;UHISP*KzGts&pE^*;1Z!(9NS)eURkF_UOn5zPbD3y3QqB-|1*HN3s838M
zltezyDgmYtYnF!RTZ-}JnjfT$JtPwal~6O@wdFG~NZ?T7=R=H!JM0?E?tSvMhu8md
zh(M&K5p$_0r4?iuv6+XTfWPo-Y(XV=Yu(IX_|q_EYc%z6X-}rek&n~CXljRze3@z$
zHvGsGji5Y5zHWNDOyx&}`{Bo9oelni>)(@J?q;`x<Y{Xa%gd|RUe1A8W%quHtE)UU
z=9yrDfG|mx$BeEte<NNvJtSCq-AIF^?7VV_$ire+CL)yWO<gcVK*k*fa3eRztKDO0
zE>u})XloppF?g@VDcAFehYrpc<!nC_yyqdPLV$O59TK`NV|@eA&xO_-!0MI&QNV*^
zfRoA!N=hiB5UGhe>!>G@we6;aXoOp{*G!I67f~U`48WS#$YsEpHAvmV*pK_ogS}0I
zfbCR(ZdboS&(=7g_Koa%JYK-1V-piLJk9awLUkZda7^pXC)AJ^`5WC7*8CM8rt|2!
z(rr0zp1NHj|IXGRgR8wFR8!$)FKZ|sP9;D=@ef!g7vM&uX{`(^TL77eK+Fx)uobyO
zG!e0^C-!&;7hHCJ3=OJm<b4}4UX6t%F;*!*6Hb0-dY~KI143>m?+QxcC0pC1S!U+o
zJ4GPU%6Y!Bo=t-^#yoVXZx8c<RXvf)M3nG>qLGTIUejNOzKT+aK`kw)sojX{R-6J<
zo??B@`e}GyXqpF%N!IV72eEnz%IZCK*CZ^C6D4`(2s&Yo*i|99k^@wz<-O4CeM%Ko
z`QapRn;yt2vXX1Oy{`{WaeH~*8vq1-x71s<gvQ=yV=Xel^T#Nu?4p+zoUH14a*7VV
zg`5=LbFiIc<c6(aNiV8Fk~<xF@(UJ$?D#kg{nWHdmH&ddRK@$aM(H20h;B~4F-Pja
z5b$vdts~T7TW+`tfzZQ)Bogx9$YC8@4hv5c@oQ?FvAyN>5NbtZ?;>Z!kt^phN~EyZ
zO^Q?&#vL#0z7n<z_iOZId;4Lv8eD#bDj8$&<n=nZvOF4o<Dv(M&#+@uJvZ(b4Cc)A
zk#mD=7o%xt==)ahL$5QNYAh=emK%b}&zkX0PF7i91cXFlw7;Rzg+Z}96w8(zJ?N>k
ze6Sc*QJ=xAYMX&^0^}|tphPs1&Hy&U9K?>y5n+OA9~G0}Ft!6zppwPb!fP5yO%FX{
zCRz7@1}LCXX^C);$>GNFPS-y7d4a-PW{X`CU1Hdgz)VGWSiP>zUHukAAfRx7Ix-Xw
z%OVHa1!u0F%*Kea7&7Drd3*GVBxlRPrK}@-);w(;z1lt6YgSe&NK2YafUX3BN@>D|
zUvQs=TfiINiSWW*@&uXgQq||88TO_qgjio+w|=<?hDvta6$wN~&aQ>jgU|~~XD;E0
z4WKQD8UyZxw%AdXl$^&XnI0v`X*(Zml8E><c7rN4f)fwe;K<I?)m3wmK=^33ZuD%q
z%+8&eUa&kml*p=-i+K?|KEpPO#F07jUgK9gYf&CH{x+_itzxv|WFB63rAAIU+CM}b
z_smhEEIz?23{oP74fnQ!MGfhDyP|Z9_)LB{+EF@M%VrtcB=))<GcDQilwWCg=XF$k
zU6C0yMzkR-bgo1SAt%rY@rpB0+>$^`2iE2hHs0R4wDXE<icIc=)|z34de0NNt~tb;
zTVh2^G$)6Rij5A%c2ojdv?uQ*iB8halDC*JY1!b-d6u4mPBmtdLsVUWhAmlP7fO{Z
zI&e1$ZE<ZaT*k6fU@Y`<CxEYqq5}{}qeBq5)?n(cQ2EJlkQhx)7a}5<+S6(8a*XIv
zZmxD`l4cntq+rqWgWWZvCC)J4RC{v0WI@cT&>RaQ!bE~6m8%R>K$K@aw0v<qhg)bp
z!t)k&tsXOeMHHymhY~R*)JopB(DUBuu-hV}=O6X@MOersHlt_=STC?JHb4<JPE-%x
zfSrM}F_F!qGeL!%Re`kTe&^fsw#fe6%Xauzz5YUnoL6Z!?^L(dk09-kiHoN<tnWmD
zuuB%!OM{H%w>Vtf!ti@OLeTaUA^4r~+hnkXA1&_*Z&OY%7hRSSmmF$TTmfqz67KA#
z+yiBH<{#rtG`n4bT7>azG9dx<iMN^-pQgLs73bs?J(7K;lxAoK&~I^3!MuOnKT1~q
zj{Uu4Zys{$;hmBP%)SC@qNKvaP2zQ_s^)xnV|323tc7+tpSf@bETTM`5==)rx@c~!
zVL~P(e&P5L=<=_CG}CwO3k*axUfce=K97wzrhSx#z>6Pcz*SLE{r$Gy($VKWw1JCB
zjk%~aq`jkq0<_nGz&}|B^--NP20#~`{W-!+RVuA*57#L}FRhOgwV<Iv^4QfiCLzEg
zOb3)k&!0LM0a~Tl)GR&CI6A2gjGoB?!Esb&qahzV!#u$l;%$Y}VlZG3tmObHF!a}r
z9jh46W9sqx-(kFe--Is`!CIqi)86CseZ0B*<8_MDm&cbboScFy7OoYV7uL+d^+1N{
zdy6|NILiNQSJXc~|AfyR|L;NiyX60S*l0X#<l?_HHvaJc{yjd{|64YkT)@A5s4n0e
z4>rDjQ2#2afBop;!$)7&3thmGDDNiw4~~)w$~&^_3@G|4G<h}wYW>zu;DE?R`Q(3}
znh%iX_2u&cYIFNXt^LDSuTSsP?W3dDr}(T<7;s+#<M&-u{N&fA!Du|Axc9)><F}8S
zp~wZ}sEOvKfOCuTqV)&Eo=LieHt!?$;2Wi0G)u}76zC#z7?@fNvV@ZkIMcmB9Npfe
z&{KtLm?-4NydtCv)PWjNU_l7Lgpx#QVT#Sl>|<}FPQ}Ioy||I3!fIO9MDOg4!udSp
z`NZOB98IAB%!ThR-;rBS6F1I9^3CNg;ShFFU|FGg6eg!BwmYVHM3txe2hC(<r8;!s
zwPzZ+ScK77;`z?u-a(V>+6*8LQnF4gaz0V=*^M)w1#u=BmSMCuUUHZsQAG{8XzIDK
zDc?BjYJv}xx0U3-bgzIB?fq@WroEUO4p*xPOkJMqHf@RtbV^Yb{W>DYpb18ThO7-S
zv6&1vKK^QHX<w``3?cW-n_9FLGBV^J{LbrY;p1quChen@$DrqTJIRe)hP2WTxIohV
zk&QU1B%E(ik2Hbr+t-;`kfS2$EjPMs%V8rD*B2cyu@z&Dfdw~{EUn=j*vXw#QkT8U
zbaKr?f*QUc-62J6U`xnhuRo;*dtG5i%@VEvM{&a<j)@C1XNI^C1HBTXnoIC8<x1=|
z%4!ieOB|Lu>s<SFP$P<i9OM?j{BV}fS}G|CWN*f@H@r1g^IL&6sfy4;G_ibt;}|mz
zuuY+-;U=n){({3$o23&xFiN?VIY}Tq!Y@1$;!Q)X1mg(ctWh=<uDCqL&1Fc+@}nG=
z4pR33gFt-0H-AVld#T2qA3Leh%2@W+_^Ie}yX%?cIqx{YWOe?)C%yC85N?N(f%iXS
z;1#Z1fgyXD{H+IW#sl<FYwm96a@)q(d<|p%wz!dCdnGJ-kTD8Ta;z1WWhos+nCOBB
z;?Xfj;U74)`Qi8b$47^9tvHH}#V)j_?gqf9`U%N=oI?d69)BnJj7utFEFAfHr+hOJ
zU95zgiIS4@5qYzC1e|%AtgnvgJjt;4IoTcX1{Yf4R^#D5Z@lLioAQvWB{!WVe7O9d
z##N+!%5OXwIUe<*Q5O+gNpXS^2G2lGi9vjd^0H!v&I!-KUIub!$hz>eK8~#7iMLA)
zQ=w2!#WV}qchSMy@N^$KBh)S8AbQ+kj|&X!l4NKM-zM$4&$wJe%a6{5__$?y7pnSM
z&K^nVZo--WW0!fz@$`EmR?mOQ)sBwH<#-XgplFOzwQ{Qg@r!sc+!Z3O0#dIgDH2BA
z-iP4qD*By^^Q0chZ1J!M6i!H<TkFlaq@%mT|CBirj4{DdP5E8!7i}@#*ahn6HsQQA
zXVSGCWcf?rp1%cLx+9<Js2qd?7D~C=fK7FlyX7E&pBpfOHfuq`$@3jwDcqRrn`>G(
z4yhAeSL(*oMhER>L>8Q3*pi@u?M;xUs2=nqK$MjOk#+u)ozx&(Muc!PFy4sxNkB3u
zouWbuwy!c7MJol@2uWEMZ;q)0OiWzd9@-F)>wO%gH53})9Zl(Y3xzn{5Bz1ybahBc
zyB&gJ0YPmfF<Q~+H6M5an*iWFGHGn2rCt`=P{(L|%#=6<Xf)-1(KL9#p9+p{Z3OT)
zZUl+aA(W&%t2+y}QR+=xojw_!zaNmrVh^uYvWUUEw2eYH20xpv=>~d|05Fs!^>u#k
z(3GS{Tj*w;kA#X*klwPT_~!=f6YSB@=1nLQ19~#%GeSuoH+S|vJ8WcNzt--y#P>cr
zh;oDavv<hFy6yr*U30(E=WRcH{qjlkxOK9-b6896vlyrz%SwF~p>E+C%@dUpSS~T8
zuq2vq&i3RiJj2YoWX;rX4~9YZCo_5UYHjt>Tu#?u=9I%Tp@d1D3M1#)h<<bwSv%U_
z116_d2o7$ggIr4U=xLD^A?!jPY3BFfp!Gy70i0wJHJPYKCB-Itj7KTR$U}FU40*x%
zT#fZWp);vyM(>~5i=J|ijcIS8*Vj*<HjhvC|JuYkd+JTh&C-4t=<uLrh&pW6SeJ<9
zLhKtv6Hm{68TORxCI117IRRm#u#5LKOVJ?8q!f~C8ZCS{U)k8qW~gb>lJQT&wfY-Q
zYcpD|+A+7gU0f;{Fq~*>s{U(fDHCC{o05o4RU~hF>2UdT7o~0hxsBpGjDUqvCT-(6
zHz)^DxYfD)RY0nyU?K6I<QJ}-`X|0mE-@!HoHQB$`>ac)NgTC<`(gp*@Y>W^7;3R=
zwm-A*CjRh~Yc~$MKxt&XHV$uaDc2_Kz^}Ifaq4gz7eKlm1(9v2GoK`@oxSsjW`u5H
zeM+A;c2ZC57O+1yrkJ4sW=86EI7-&G+(L3Hw~O{w&&?C#bnvP&_EOgx95ear;2^fB
zJAtLy2wDL)xJw&CITipDAcFHdu^0^Mp&Yq$Q*u1>oC=M-4CY)SJC9q{zdE=>)vKDU
zNoJi+FLOR(Wc}ZPqktMALCBojoZ2z=a)qRgv_^Jkf^><0cAK)r16-|Z)-iV&1Ani`
z|3Lg##lCWk?pBC}(J0cn{J_4@Gt#F5{TCj3OWue{3r%U&I+<cNa7}~e=B9*<pPG2A
z(mmj2w8`zQts(5_q9!9B^~6()nqrpIOHzhezTSONf32X5mA~in|9S6CJ3K+h$o%US
z%zFS#zeim3$YWxkhb>ASXUWBJ0sCslpgKcZXR;u}#Tfsz@rKfWtt>-vSmVKnDRWGn
zn~s+3BqS#F_$T1m%^)N|^YUo<kwuI_TDctXd1|O{y1<VK#B5t1O6x=_%x^me>>FBc
zOUqu8>p!_I`R|Hu_(rvAuBewgKeP~Mw@xkMDjFgjE;MLmRhT}GO6Nu@49KHsa2$#?
zRtDQ`<Y;Yn8$SjhrLnGw?%@{t)xcMvSVpC&=bp@<I19H;OG+UuEgC7Na`ATp5766X
z>TXiwi95pZ6LhFcIPkgryr%th!Za%>5dI~{<u2T+<9Z9(<#Gu@EOMVCg~KOeCP^Z+
zN?jde=(^C`A`sGf@HTN4SR(gbfP=jZuedbB5qDF3+REW5>L9Yk@U{(P0X}1xvK*4R
zae$F<(bW`fr$z#jTcbwRG5zPg5i<4|w4c<_EQ1JX_%OGwc^-&h%60-jff~jT8a{AD
z5P@RDvB_U3k}}gH?<a$48DHg0RBl6#sAX#1vs!wyZc@HjccI4DDRoqKp<*~vxNa^7
zf2Y8bkC1>Hc9F^Lrf^nzAAq(7!n&PNpM1R;oau%oU+&*GXtF<s($kn#fBN!N?PY@O
zzEz^_N`<T;I~irO59Bn4A12$J`~EJ^4;PLMZB-?U3F@KpoLXJ+bs=(AM}%VKEufzQ
zfQT>|kD~xVie|I~L*Am{`8cu<XRlY7a6Yi0qvY{vx5svKC(Y)I)(Hk~pl`dckL6qQ
zaPQ-0T-RFPVH?%}4-P(>-*sja`~&R7k|c@rS}AW$W7X~BVE37LQl%ER=DK3J31%xv
z`+expD8uk6)_SOjhuZDqk{|$cd2Z^bbo|EQ%XGZRm2I5Ey%AF=Z!+|2f7%-kD}BXj
zd4XQEYtt*tmU6p|YwaH$K6zS8;O|rUd+_Ax?Y3-$sZp2uvmvGuUBcVw3+x%ou%a!4
zneFrXB-!81u9-!9m=hYg?l{DTtP}30?*sP|PVe6X)16=sB^Jj<aJFMhks*>!<!3N#
zu}{S-CC9v)?=9HwPwLC<KzZv?VqLP@HHmfEY^3H4KqS#CHP4Uft2|a~TGboLV-j8S
zWBMwOQAo~D@tZzmJKUPr7RigTFFrQqks?}hiWAL4%bH+*E<f}YT#xb`zR5#EmHd>x
zmSn6gUb6nJR;(W^n66AeSQwd8-%bfJ5<SB&J|8cFwmhcq(S-VTK1;3Ed51@K-f@qV
zdzD3zU-MUh(?$?AhqiE~*?LF4_j66^Y<OE&kVp<|#u%#095uLBw+xK0?n-CY3aUX?
zP((IrR&7^hU0%Q*=9>v~4)coiDbuhg^4VQB)37l4Rm!H_B9(eT8NQ25m%ZkD#cP@H
za?(5K9ZAKa`y^N%_hzm#`JK~?<r`_}CZ*$RYx5GWvKXMb(s;)XrX@S^P)rg+JVc9y
z^MtnIWx`*(Pt_8qGxVO)EnZ#+U>nv7j+Cp`x~((x_eue9I1{;#<=LqRX`y+JI||;0
zOu)JV)bJI2sRpZ8p$OJAfXt}PjmBGsQ{_dJg%K5TU)0Sql}V36E){LA4u<TC#4n@-
zvau=<1DZ{nE`oS2WR=>RR-Jm*n8t-e9OYHw-j)gvctH!nQDN$uY+{XB0X<=!xTrLl
z&RVkpepX%qXfpzuCH}tTVJDQRz|Ua+N@h@Kd&w6UwH&U|I9MWH;<ytv7`ySf(YYzC
zQ81OD%>Vdo>HqJ2=J@|%D#$OA0QQFb?+@z_zl!s}e%)yN;s5u0e60T;ZFub}sjok*
zFP{Fr&0;lT570se<$CQ)j{k&d-*2A*w!nq&?}JZB?Mk5y;!LagG_4ffq$~}p+_-;j
z^-)n-VaM=5b*zzp?Olw{-)q}sWp4>7ieqrMAiM~^;5tZW^DPKJQ0`kx?z;>PST72;
z!Zp3;6DN`)Et6o==FwlVFf@lMF-d1tmq!#ZT1KVDdoa`n27+3tV1d<DbtH33;X)UL
z>w&}JUbZ|jD6&9azslc<`-2fh!H;B&k;Dxf)3CvQ57hRBGaO+2l1)l6afT{LFJtBD
zaiqDN=*-U%3suA1LF}Jj77_rT9@8czyjL1D0ym3ija!czeOY5JCL;6RM4nRgi!BO*
zVYX+(?2FIp2=ib2ybmj?@C#acizE}LIx*X*GdYWmBvb<*S=L-`hFk1IT9obcNVP)z
z%UMxe4zdhwT5va=a2L}ra4s%f9MqbQl1KDin5MyKJvr-5-}ic`8A6JXR#B_>E<5Av
z${C%caV@zNCWOkYZRzM~u~*&CGm1V+r?q;Ptm<Q5!$8r7=0E(*&GEYgL+8F}J&`hE
zoq7a|8W&}SBY1?H#bJrJ=~#1&51-u42Q3!uI?Jl6iCCccM~-1b5Wxm~7zyrlRE<`{
z_lGe4M?i`H9iKV$-(`Dx@kJs)%%}hA4<BxP8^?cm_|;c`(0{+j$I^dp!-)p`=G(<-
zKo<c5o9JPRxK4Zc$<ZH*;yPf%AxS8s{o-*Q{&hBj_L5iouH9GrN#)@>K<L;14lw%g
z>p%bdxBvdI@$k=IeN%O1j(7I<cMeZlubRiLz2>vyW;3b0+J8|0^Tzr{HImok$Xo5R
zLc{gE#c&@=R=ldhzo<+6rGRUWyMb$Uv2LK?XZ2F35h(2D;?w)-qzf(@6#T4S7Mu;1
z{Pcd{&@9#s6#T4S7Mu;1{Pcd>3xitwvtX^gFc7pq3kuo`Z%_NP_6KV>7VoH0(o-!d
zdfr$F-g|@Lg76L{KYgZsU=St?B0Vhn89iO5g+^Ni9YM)2zoO7+p*mbr2oES^oc!n`
zuZI;%hjD)}4m1h=ZRv~t*bcH$jI{qYDfE9UK-y69(>G(BzF({xDEQ^KVwe{CxaWI^
zf}cJ|s9fJzxS#sQr}xwYnroqcpx~$X((Ns}YK1*K$df}i_c<vxv|O~$l~3ujKPg#H
z3Yk@MwkG9E3x~B=4bG&ED|Pdk9CjDpUn;u5d7+r@C5NQ|a}{6WWFi=w2gbfIQSREI
z@twnFw@NlnjbsM+MRJrjFh}XuD9BD~+be0zrW)@ikEvf3LCF}pv4+|B=3(jl8s(O#
z{ox<7MC}j1{}OFezkZ2m40D&L{b7M6ngBbPUKXtqx|U#m$v-V8ZIm{0md^_CiM=Y@
z<ijdWwzldVcnAYH^?DfczCFy)^|8~&h*ar_M~vQZ5^NA?!jswP=;U5Cd5hgws>>A8
zP9w93Gy0H><=M6Ac;|2rgXHJ-Vj@9z<#)Bh4gN_hRFen6dwou}YvL&pfPoqyvqN7g
zIEYum#-jpHp1jAt-xbZBD8pBo=msre-6Waxt_2@`cXjP99SyIO*?0_1km@8%2ssM?
zO0bI0y*G?qOzMxfX5>M<M5-WIe%wurD|WqPYZX#{la*O@RrSQ!yUwXjb9y^lzG+qs
zoz*aX4->*#W@=eDx8eM`l}^7=KK&t0zwxQlugunlumIK7VZkE29WF1h4C*&hVub&G
zf@Y`%u(%XUcIO`Q431}^<tLq)f<?9HBMeOxS+j|N#~8G=&(K0GaRL;v978@2pF8$Y
zp97!ipTiG*j%*ZK<vRAuyzmv^hdf8N$34d%`aC5=y2OhO{EOhZJO--DKZYOj818ZZ
z7=AcAJpctACjHPCz%BR+_)A|*xG7KCsBvG{yr3WY0*O)g0)O}yz6<yvj{*Jr$M8cR
z^FlikLLUQHW1hn=XF>ViKZhS`ZP+&RnmB_)1~ht;SkMbzBOK~P{1Y`#9E{9H;V=Ip
zc&?9u;c**|Kh$KiZQH?L{zdS-#AuPFt(3YOOL__EgEA{GDpqFH7#mH!+&O*j%%<e{
zlrV^|_RH<h#)GAjTF+lUYqq}MIVi7tF*_&2wSNWrf<>d<3ajg1zS=o$y*%2h-Yv0C
zBCsxRS>FCDCTHl!$myRgM*m;?nWO)a{0$eM-Ny~~KVLm;d>!k58t~{3{m<|4vHBm~
za8mz#eGB!^!K|HdGK9r+J%AiY$09wpF1%L9J-N}4Cq4V6*O`{t?Pyw(@uZh!XzAJQ
zWu3`jJWVN#>0LCr$076pxe-GB{`;f-z1khk&+Y<OeSf%rfXMv&)8p4o`to$=;Do=u
zsNK0kq**^rFiSHUZc_*Xpkvy|t^uj`PDr%xUmU)E$?YR8xP_D#T1~-s+uOm>?#@BY
zv^q?&h+=vv_4*YcVZINAI1EQ1u8A}N&8wl~cy@5~B<#XfBP_6q4vhBcIV?2{fx;05
zGa|d*=ALbe4c2wEVN-4n6<}bY6)`CO{y$#6iq?@6Y*6A)N%H#raT8bO$w9MrQ^~`l
zLn>?witBN-io2LD`ljZ--#Oknem1w%N0hYzfeU=IgDc4q0xuBo2*RXLLPYv(g!RRo
zhRgoSEI#y7!*$zCJ|>wn!%)@~frrTRWTrxasaVstk?$PB1S!j6?*lM!6zdCG@5z>t
z1J4b``@m^)`Hwn$BweD35mdRUX(Fk2o8|}31TJS^l-)L{`V%x`+a1Z!g-{?QAxNmh
zF0Gu46B-jK0AL+);_bmP>q@kV<a}_2BR6@_qv4{-J`+$lTuJ96E1}Wqe1J_h*rF9X
zWe<!CiHbqLpe}|mWFz!RZ-%z<y<v~pbbCT_ov&bqPR;y|HrEs<J4oLybq;zTq{>io
znGIo!5Ebxx*s_*7G(Hk31<5AloUfxBkgS{yHP}#lKnXf^J<hO5<^e~uFjF3ImlK-O
zEyG4sdViY@V555!zAkw?!l!!1iK1<1(<w?{aMLM?=(w|t{ZVj$x4+CT#|ghT!1{}J
zs(`Awxv)5;FQ8UDa8G(YIOXaPgBF7LC_4Ehs(Tm9<_fovijL<N9qVpWRyH*2yaE`W
zTSdw^(|A5GqjqNsk8?6ZfDVkIkn&wI86XhKzW8IPX#OWn{YZDj>*mQD36c|}SBg@}
zamTJI;5@C??RAE2AQIQKW1sQ;qX+Cwc2n7JJ$-$+tH*2TvsRTEQ-+3YBFI?mlS|En
zV-V)xpG{Q#FZ$d}|9`#<z+C#jzVYqX4>$7k{~z}Mzssk9{^tZhUo|uVQ2jxD<3XdI
z)c^g_!}_DI8lO-9-(c)7Jix8({qe?$_<?TkY<3<$OQQ#r_&$6Dm+g&y1BDDoI>u4N
zyoz#GH~Jmuas&_AGc-&(bkWW*gY={~t-Pz=xl@6E(d3$FTJ!_Z-%P$%eMPum`Sz*w
zGt>q_)qYl8+wQMz%dPYiKae|N@aB!FO*ox{Tu|OfXyd9jtX)>`pgyT`Ro$)(t5ps(
z;7Z_o$C8b3d5CNy`hqX^ieB$>*D>i)y_+ZG9NqG35iO$$&@Dydu5l8OV@DxH!IVTg
zn=-*P$l#_;$8&Dxe+_PAs!F-Jk=UX><eJ2>QJzTK5?#X@+;2vCWJrnSu2&c_HAIVp
zL3l=vn+qBmWUjBUxwlkxnKKmVR6cr&+ox;6B#0@lFYm{s2b5oi6T@WFKrCGjMwoR)
z$Wt36p8bh0W}|mW#Zszp3EL9DK1{*_HOCRHTvc<ikw+b%Mq1PK9fqC{+Vw$wv$gH%
zIu`->K7G+bX(vVM%e^@{J>EZjrn=G76Ha)rGNouOR66TjBA2p0^^DdJ=qfG&TyVS?
z4|F=IOtWe&nPR2vYJJ#K>-X4gm;fJT_?!YYnmdPfh5<Sm?hmc(dNgf+V6_aC@rt3N
zAWs60SERiEd6Fz8+Qm|ho1tbKI8yA0JBjkP`vJ0cuVVO;zKo9Egx=rpFWS?5=>N;?
zoRW-Wj5&~f6DCeV+}$mlMxUp#bcrW3$Y|grPX4LOX|QB0-2bEb?YX8fTqq(cXr!>!
zxin^eHsL5Xb<^N_kT_RR0~Z{YqgE6b61{whUn+ovPAOD(j6NUX@x!#@GJ_We4lY!u
z$st9J^WweV!``W*5R?h5I#p}5;@iJrhO86S26D5qNy?~b3jnQ4+$C1()L?O|cYfuN
zbCnKUFGU9jx1hS2Sfds{KvbikQa(RK+*kdU>X+Wc<`U37q+SRPtTPRjrYKDrLk=@;
zYEn_KiVl?WVRrMgDnSGx80WA;QgJDUmi$|PHmbRUP=G{eoQ3EGma1BlbqZor8R&E9
z7AlDi3JMSl(7Hj)n*p>4a;F|jk#_Eg$XS?X`NM#IeQZGIZlPYy%jF~pKaZ*hr~or2
zLXYT+chvfi*Dqgf@(awb^iICd*0Xh$3>F+eq;@3HPRTt8Bk*gbrbIl>3cUON1#Q8L
z7B};P007Z-R)pT&LYMZYs9eWIE6u3}{WjrR=8>5SQHbsVf+e1kn+Ck|Awz;&MmDie
zTc=_;3UdVyRiK#;yX?lA05ZmJDpKL?e%U&or0=f)(CLiO1>mXI8nrd@zk();@c%*D
z`My1=B`431Pf_||gUv=l7gkS-JERWtanwiEjOHgPw7U9cT~@_p;4<axplwn4CR5+V
zSj1=T$z;&;Q?F?u3;wpf)zuKm0)f-gJ=DBSLnP#ZF8TRx61-O=6q7|uOUYG@1K_58
zp!*-#*mc!4G(j9yBjB{{mckCFDIl@iP4H8|jPSgfT3;QlaxP0J)4~{GMH`Bhgxv}1
zqvZ*uau3C2wcJUdC7~@SIFs$}FSBf_MYEz?XvA<cf4XL9GA`l-D)#xRH0A6BH~E45
zSzFVqD`W$06Km4MItoUn<Bpupai^H#Wq0hdiA~dC@2WSvX=-w!>@c=n-GcG1t(l_L
z_1>r(j57{?i0UV0qGGBy0zAW>IIGUVt&o)pT8*jZ2AXQZ>(OkS1@@YpP693w72Xcs
ztiMBI;tDUB`}dRhCEqmkUN4@iB_LYuEbC3+C<N88hRNaKki@{=-6Gq6pQIzlY8IR?
zo&^A!Ia?}fhV!MpIzx^CTlXEd)^e`JTD*QmsM>8-je;)kA7W&k`AAuttJ+=-S`N{%
zD<Gr7*Jb#(@9?i%TeAbSgD8O^jV>~%?g=fILp-@I5dzHd#%gm43+)k<cc5V}1g@ZW
zfjJ&ouRZBp5Kb;V8_{79xHgAytqy>lY-0q2WZ=;ZyPI!q<-|^U#Z?O+(wH8u)qM`$
zemWa<ivpWnwkPjsVTxH=kASSwOV07x&;SoSg)?_Hv{*>0Qw4nEL`=dSoY70!84iyd
zuP-d&5HTbw!^@Z0;vOVNNMzN{3@6gh;tV9ClsQ})q!0G*=tpWuHU3D%9ygy=oz9ih
z8fB{BcOs}TtBh0+_)XbdOz}l=Ed_vRZ#63eMuSLZW8^wiqe#QF(VMRbVoV_ZaNukV
zkz9F0T;#`SQ5<q`n@^ozxz6#Lr({lNJxpTU#R$SGOUor3;hwDVtcf`7VK1J_CMD=#
zv*Of-rl&a8X4?r@AmmVhcADG<%V&9U{dDq+jvqW=0jFVZG+uOSRl~gE*x$o^8TG(f
zC5+>TN6jIYVN?_-2w4D$Qc$~DeqdaqnCGL@=;mE6`Gb*$oS&z6b8N`wT*9GXp&dCa
z3ti7IbiAAae`Q*5rq@tvjQJf%<819=3a}BAdw2~1$yiG4$yZpD0`6?ie9<lG!*qh7
zW2hY@*RT;?45Jr7M%9TbsFDWL5!FHlw+3Z9%X-7UJ(k?VV}w!dY{LmiU!Z9wLqkT3
zMN|`%(xZp!d>GO?%9pPOT~0%qbO)&E?TtFUd{5iBN!0YD2bbp+s_><4d@u1MW9);~
z5sdF`vGJBP0bMsx9sq4{6G7xZ9i5tm6^tdoN5u6i%_qhMp4=)Ka5X4`84mCjlnLJ#
zpPwGO3-IA9k%6zS66*)I)Glsd24hxAY!~%EC)K-mLNO(AY%H%wsi<RbS=uDm$C8&|
zI(1L44R7!*9>qHq{MYsj7k$y_S$Pp(b@ukH73nc}hIpAeRZS>*!B?g{B0{4DkpiAY
zGUSQA)LVK(ALw-+kOTaUF8qk9Ghl#N#d0Be#*bF7Xf1A_Mojl1z2SK+CwMk9_A$Y9
zqE&xpQQ))lWS0Q(=v8a?;OL|o)TZE*8yaS_EefdKfKrcj($RF10;FY~blk%mg_a#y
zzEKZzB%Y<yi>h~{lEu0g?-vlk_x#|Zr49BjUfLuHRzBETw)L@AKHj_TMT_j*rYXuQ
zY4QPh6>J)XYUMPTG4i&12w(He;ujEgjrGl7zO-vBO#9gJP4G>6DdL;}H|!igYd!gZ
zh(PUA*_;itT=s|Q`}us-m>8&WDd#k1(aD%!;QGik%f(hwNW2@B@~c^6PYb*sEbzWQ
zZgLi9>U2%qiUNL{TQA_ckH))bv6hkoi%RAAZzc#a<{0$%^62|!@(8~@Yn~eVCwH(?
z9#XDJw&~m`(HWAT2UeN~Zzj;Nno$XW9YpX2MV_Ltj<mZK&u8{EV6)Pq9zZp@5@vc+
zwKxulEEME0F~Xrb+K3Bs$ITFIyAC>vWvQaG{e!1#b$$E`l`;rEJmjwW=w0w@9Q+a?
zXYkBj0qzmuQv<G9I-7KQvIP7?-dwgnkcpd|%Z7%mQ`EBYpq{h=IY<^KPPOEg=z@3P
zIqrajf%Zt1^xJysyq!4bNORhFQr?hrEbuN!9(U5=kkmSYVuAkRxY!NKOa<5RG!=Ys
zA&04hYV@(}K9nC%iz?&`=ky6kG!+2nd}zEK9yGTaLj8tb3`ktD(1{mOY&u6|4o}R8
zV)>UC#&C#$z-W?DB%Vx%9pwi>W-ZzGHr!PO2q_eZJ4@R}JsO{CmHqn%(gz@M+qM>1
zto?Vc;dg@L;P2`8xQDjUcX}1Ro7-A&N$9m9TVb0UYjflIlP}S&M4A`Ys|0J{j;bv=
zx354>7>EbG;Lx#=wl8Pzx}^mpdIP>bV^$NlU6Y+ewBFg!iCiK?$2e3@HgOfKK&OD3
z?@8Ezr=6|Zft*GI1!wWFnOx2&BbuND^|fXxPc^WFQ6`vAEykgAD2Z~bF**q`NPm)E
z64&L8b>U!ts$Fj0*4A2IIkW)WM#jd#1(xsbI-zBhlIs%p*2KmA0l7;GB#Z!XUrW{!
z4!wG!cvY1xiN8K8ru2Q+AH#(HTJIx8+CpK$1g{u2k8ACp@D~Xzs>UhnoCQtrJXKMY
zBRXf-rOgM(cIONZ98MlNFI)Dms=3XOPhYf}M<@KwVcn>bg-$mmzRN9?7L`)LJ(=gk
zM?v?)NEof?*f%0kLmsSrVj^z(z?#5PJv-ic`EuttIevZ6JW1%;XEqvMUF1DF$NEge
zQE<7n?c}HB_2uNZWcktZn}m$YXz$AJGHvT!@7mp1D0~3MT4fJc1@<l+C;#1G%wmz0
zlGVZ$pE_Xi(k}pHXx(3kB=_rexo!6{zO=8|-|FV6b2*s$@=wcbthfATIR^3kn6We`
zk%B5T%ByOy0#~F^W;2B=5ADu~270M#WaH0B3?F|eQT%Ku=8U_kT=MB8`;64_`A!~q
zHzw?3mw97#@uD@pGNLdds0Y*DrAZF$_F`)NioA=W@jX$`qjZWgN9Ppsb^_GOq`U0>
zN_>@eaTVad+Sdi;G0_fORQXUfL2-4w;RN(lgOxF{6(<a=@aPpR*-EG5V9`|raICOR
zXY%%^Wmu{DTL2d{#euIkok=gS<7a`;&Ky`2@eW;ucXEWw4NQ$eUQQ+20d8+}VKtHi
zibpfRs52c8g&Ovw<bXTzCP7X(3U}fXIox4Y9s#QMawlzTnK3y|Q6=4YM2}g}?V4~$
z`Mwd&<itiN&C^rn%dyL;7oyj=hg!Y^Y_33n<DIl}f}27f1W%EGRU}rN2UobEIMOTO
z>RC+8*V?8ABbrdM(@|<psuv%{(&YQpoLhBjnA_bn{mGG{q?b?kn+JOwmF(%k>yzgO
zlt`40y*fAwmXx-&Eibr5<$@>$o5l>X9isl#Y6ck;_3%nQ-JGBj@YLrmu$i#SJW!yL
zkR_|eYoPC=6~4_PQT&V72dBr)Q$1(&2D6irzB4679;b(owEz{M&qnF{QGvf+HO_l}
zSM>$D|4#pK*9iURz|ALbeevG;eOnyg`qS=*6{9x2z;!5#p*JoqsK^gKGCL64NLRO%
zR++l{!Ip+A;=At_xeCbKH8#!Fmn3{D!g7brzX+DwFan%{_3U(bn(HG}k>TG9{%emT
zmq5YSG!S%7LqX@b6UsqhXVy^`N?{3{_`}5}s9a<6t71H*J2!PQlMl#Ywx_}lA{$vj
z66w5CwKS)@G=Akv1CES4rphYds0=bik-nMlw#%7ZaFs59glpVHsS5GBo)W3gVbp9B
zUMolOz2sunC|?-r4d@crT$Zp$i~MkEY&GC_sVbady&biC?XBYRCS~oqLmS`OW)t7H
zo-ETaq7GA32UburNdNxP&KQUQovk?xExNGaL^uM<4C=Q1xR7D_ZpQ7&6ua^G#;)m{
zsTXuaici%v1m^Y2HCSbUsqo?Ea@BJYY|GCtJ}wiq*65%!7PD7b08>D_kOoA3R`AgO
zH150+8+*VAjs97M4m0%TatFeB8~_>3)G*0}Y2MP>?#-=TRBb9kX^shgZSJ#jf5#sV
zoDk}?(9SoT7Kv~v5(K|R78rlDFJb%N)|Tb_$K=gTsJ2YIHKG>0Xg-v^Y!s2)c+#rN
zYTpEO*;^UjGF{&kKhK>zhoDT@#Ug}Jj52t7Fl*23>nCRcoij_R>Eu>d4Xj7d?hlq9
z!QRp7Np1vh*VosVBWx1-HI&5DQuj_@4=s71r?;@i%V_hYc3x_(Qanjx2A(WI)upoe
z70b__@0`FN;MnB%VY9i1PfWP3!UlfJOW+n+ONXWkU1pXZ<6O7#0ubkygUS*t@KV+K
z%~d0mr0D2gFu?owlN^3>+*)MV%|_t7YAT5aio>0OVvFsyq!RWRu4&ctVzH@7pdl9?
zno9U+7kJ52|GhHi>MZSE&vQ*-E2Ul+O@wNWrgFH0ssjKgZ!60Vk-V)gi*so6a4*Ik
z2z87#yx^8D4Sqq><*)0pV<B~2z~feyo#}%PRnLAYjANmtnj=?=w$fW2$;6aah`O&X
z%TpBc4s$c03n`dIjv9^cwNuJoPk%9>#_9gip}FFWbXa;bHVbwwIpTC=jS8EKbEz*N
z9&|-vgGoBb*8+Y0Xyi>~^~xGfG>k;v3aueyE2~IaSa$sfykQYpt6Wsn9xOVu9mafk
zl;=8d-Qb+%ycOL1`#0HgXi02EZ#uL|b%*~(?qkkn#gtyfQF?B;cuT+;`^oRh8#-u#
z%_;SGPr4Mq^Or*rwp?moo(;}tXaOb0U=`;}OV)uO$R~ir|HuzlgW$EXb80c&Ulqz3
z(HqNHvgjhGBM7q$r75(@)<ZIJlV>o;D&}@7lqLja96cQqlGSCxBj%Jv7m$f83<PJ<
z?pOxZP0Kti7;<s@&U3w}7k*<q2psvS{aVgZvSiPgb3#odkqlCP85pTPa&vF7;6f3G
zf3?l$?qlzq?Sfh7uVF7U@(wAXLkn}A8s3d6;;~}|uZm81PV_vu1qqg&j@5{y80@Ni
zN<6`8#7UbzZ?$hFk_8FyE+z_M7>JEhb#ZjP{aCEz6vzdf+^WBvoWua`XAWssZ1G2L
z0z8H8aScOY^amdh{HcaJ2cg)O`<Ah{T{ced%8z<zzs>lItROQ(*5yBy*=Pti1!|Z_
z=V<1F*N4RH6Po28pei!KAyFF+N9Z4*CNfOe1So(H<b8bO&Fjl5d-5BiC(+R<)?e%z
zQN%p&LMlb)xjS}Y+({7C9b{-VaIV%p;RT*Q^f^XNxjQxSkH(U(zaUDQjhw4|c71u4
z4(B1FoQddUaM_+*FS?bk@Y=RJ1%88prUKT_E4;9c<n0^OM8AC`FWd$2oB#UpCZ^nV
zVb+XYLN{F=*Lh4cgV4Ia>tdmg7x-M6OL!sqmCUnF6E#gnD)k77<`nDvDbk3Un#DTv
z1%~^`4>z|F3ye8`m`YWDX0*tclnhlnzs-^(28fA@QX(c4lIAb2t4|(Gl!{>9;mQV=
z<6&>Hv*pVontc88N%I(vh>%FXC5QV5@Gr$h`i;Yy!r%4v_2jpL+sKk{za`3cF@yV?
zJ;e*5Uc_KD9*cmDg);>McHC#e{=5<xI3(U2e!iJlEG7xB=8%J>ZNk!(j2y!un}L_M
zfZ>u$nxII^i?l(JmP;DpD9nqrVkK_YiVHvG=#yH=N2AdgK~7*(7Ex%a(;lJ3a^_>O
z7%`N_3~TF%lz{U0P~1^+e=GU#SiUBz&CxPTX_93U`<dJ(X2rN}F?Fc#HYj7uMs;x(
zXd$*|ksDu+Ty%BENE8pG!u3Wij=FOT!oVNt8-^&HNF1_Akk;$b5zu7kP-m24v@`PR
z7>k9ZU<v(g&ezeY%gb`~>KK1-n&n+v4&J`pKYV>+-~Vg){-Ald8BQ{2`t>3F-HfsA
zlYx%>Y_Raqmsi7{clP$?jQiyE6Z>{0n$_zA`}RTjc5nZC`}R*!-J_u2{|eu}I{M3I
zu-v;xhr2uBiu0qe*kLnVxn}sf`Jch-=6~8DJdU;`YWkoV?U=2*9oBso)qNJ$eHIOC
z=Ws9Flf%8Rz|nE={^)ofusqo>gcddd)=1@deH_AJude|W;TxW+bTXJ;6RFv20|)_h
z!7)SrdD3=BLTgiuP*S#Wv`|-_VixKzP60%n93Ah$B@ZJMWb^Acwd9+RHUIb9TJmkd
zUn1jHmy@?^@ZW=FN<bzp)B%nBI~M)AmVEV5qw4z)67epF6s$w1JxwY++;*0wok1I;
zK~}Z7hqdG(wkCgzn(O@y^G(AnDaF~y{VZ-F*CI+ICN4sG@@oUwczh3-yZ$lXA^XFh
zQ}A#MS^glMRMm1%9X($k?i~NvdUd>ibi9B1<DEY%>*Duv7VKiC;n|U8&Sq!Cn4;yL
zC&_+G5F_eK)aVhOaiu?ERgRwamfmp4%F%TWVgMCgz)k6fa{+6wIo#fovC6WEO(}Ry
zyD6n2Yd#3Ji+m`KncPB3UJ#7mXZ*wa=IWIMFOn^X{sVfD#K8Tef<^9aSzJ6Pyq^qP
zZ@6$@toabLcaEo?p+nDAXh`Vx!d!4H)<?Kw`MclHi}qDd*Lcv&idLBcPG`*5MsCXL
zKxih-I0cny?nI~KH|vBjw(ZIr3)%+HRrUfGiMOC|)r8Tr3*y(q8|K5}t{JTa!IezY
zA|9;59b!NNvmy7d;HU*tAT$tcOPb|IK^3JCwdrR=v_;@#jZXz3r(;#?u^B$O70gD!
zkF`;7VKHjXiF|(KRledwP!r$pFJ*`zW(fa41Md^nN&F+syPdv_{GeO?bU4H`#!&=U
zrIHF6z$P&-_SgPX^BZpMp!n;<Q)If_`=gUb0YS<kKl9i2M((a=#V-4u7g~JqJJeZ_
zmi7iglJiq%?{x3s&(dsk=HJL`Km*V2b>q<Q96q_2^O3Lgm9myw#RX8tSe6vZ83oQh
z0fIzIMl7;+ff$WADzsc5VSNt3f$+hX13N1{Khek>w12s$E9%u1new~fI28{6QR5IZ
zH4U3mLvsTWHM!eWX2LO8;i^Mp;~E)Gj?D0Ie(fmIV2!61Jj14ZK2$QlbkPe;Yveu3
z21eEOWFO;8*OCm8JD{y|bf3hAv}uX>(uNX!K>x#bhkePAZKW_U^qlgE$a-s^;To^!
zqeBbt+#e1)x#+M33qQQLjYGW+gksJ7`G&iK5dlpVWGSH~2v^kWu-!P-REcBf4KMIN
z?D&HH{cKz-e5SULk_yR04siv1oS8UmoAS@pbD#?~!>JnqVbmTkz@};pa*#mbk8mUX
z9=bk07LJqBHGR2Za`vas9;GtjWOOZE237)*Fa!PdYZfYMc1GTq_Oksh?6A<xMm24@
zI6vmdEd<<AphtyuZ_yG-nj~`E<E=y?4G1Xx`q%?qsRT+C`lR+)a^z@{!3C@5{e;li
z01W`W)YH6_#mdiebj3h0x?0!x0vG%wlC|825=xtq)y|bOD(1KgvHXp;oI{abgw@Ne
z)+NYN7#Am5OTx%G#Y?vo+%bOUDx339bT-o8Y8<GjXkE9Ky$Oel*EaQ0oXT8y5-!4y
zP{s(NXBU!6+}pBnMkBT{sn|}9*GB?S-S>Js-^{kO;tzJ{QiZO_Tyjl=j2gFOM$R_p
zP#9Xx%lOD<BOUcn8?W1Uf1#*NS{-fASve@R>68T1vOYf?TR{yY&Da8U`h5((?2^gF
zlV7VxarEK?vcSk9%Pc(oB?KG2Vk@lBflx^m<xi{|vco3c?m<u4;r>B25#J>eq;s{m
zq$J6fCBDUw1r-VL=zdb?>7b8F6+fvf%e7pomvBIhQn;XLyU+%C0n#%Lkwh7}Z7ioC
zf@2(bNDl(n_-)IFf@1I}47Q{<4m9TCC>3au(QgcsY@lBx_U94p=Y(LA3Mgw*D%*rD
z5*a>bE<vifzy+9=Bfs7S7M#8$z}H`%?;kW7+V+lwO(?M8EF#9J9Xvex09(PVf(0x@
znR79BPo25u)JF#ch_=sq!;095YV&AVn~t0xM-g{YFR<Dqy%5_FQDM)uNXRJXn-wf|
z%@3^5Bf(g1(qyb>Ld5Bm#HZ4EsqYS{E!|PhFaXLRyAbw3lDp(QaL2v&bfMihMPd7o
zo3ENXr?T(Fk1{M+GTH6vO-{JjaBJQU8lb4-IcOB`U!68kLyC@Nbc_Xag&Ur_<4|R$
zbQ#pitWBf_Yv&toE-eau<671%w*VlEka1-&B1YAWuj(;0V4KD|V-6qVRb!br;yZ#R
zjf{hU!OdEN)`PQi>64+>>^21#t_80gLDNZ5t_T~S^)A~Z0J}^QjnYMdcSo3PF!AW$
zugair)?|v+sZf68ayH_zn^>o)(qC|4Y|-MiiH>`IfjH?WKJ|+;r`v)<DrVUAqPsBQ
z3b5e2@P=nt!;8DO{>~whA~WgxK|X+Y1(wk1q{#Z;n=>o6$b~H(WTV-o51=9K00MEB
z2CYnl_2(lDxO&GmIMH2b4xbfS<Udpx75~etFd1eUhR3EURwU+n{?1&+nU5*=^yv5%
z9BH+XR1sD3C<KT(0x*MgP<o(=Gvh%PI*quP{e>K;e;wXc1waSuhZ3-xhf#R<;6lk1
zaT_o`o@{mbsvR616|7n@OIkz*okneJ<d!3Ema4LZDNc8K0VnY-4`vw+)hE*|!e0fq
zdPSi@rW);Yl@|lU+!s(+Pys97kp86Lx|ND*)X6a|YWUAj^zR#Ym=>V8)c83Ja#8B>
zLLR>)p{zQ`m-&TRF|(uu)cnHP6kulw4T|HktYFYJd06B^BP=d1fw>{XSJEWEi>lR%
zs&R5NccJFR9n6FVb<#0jLzG;(ryQ2Q@07)(ms?3axIv=Wlm|yUdoLp46Gs6i1C<vd
zQnD(eGJ#W~z(7Oi)4}MNNunaK%)5CSxTMYZ@w*rv)%BAA^4A*v`Izh<dKtxn5ShEU
zMm8#=o`m_Zi>RHHTV)u2J_t%?@N|N3$O4(wg&-HhYu&1f3@@(a$6tnabLYbCN!U`U
zbCd{z7I05Bt>rGp{X<5tW%l5CdC|jKPVD4J3_b_g2gMg4Al9pz#X#8@^$MuRL8*e<
zCkdNb0_7Ut{9!J$o<jRVERL1~7>65z0v{j_{!M|ux(J6G<MsvhV)YzZK$nsjk`zIB
z8I$rBDvSPoUa)+jJW)~XlpNmk_eO_-t>s5@M}<gRu3a0vfy&p6dGY??BVAHkIjlC{
zb62e-x7bF~`tJ@#1@5~a=X2n&-R1nZXDE4dDsO3+%RaL_slO=ff3<*s$D`RozNIx!
z(;AmTAN&2M0DP<te#89r>GS5HC7fecy9_9xC0HbGN-oG^sYnh1V2=?+$r3;uD|zzD
z6)Nn5A5AW&UVoueD8*p@Fw}U`zseM%=O2@w@CE;Pv#21dPbq%o2i!>QaW5Z9zAulW
z{qYM?FiJ0%DvA=uQ;5`3UVi5Xk{8|;^1I~WEiuZmz>Om=UPI5L76&)OTK~8~mjNzq
zYo*;s?>wqsV<)|IGJ)gG_Y!L#Re%tIDN<(^OjSa0^E~|U3P<mY-X!1Kf9jA+E+!M+
z&1FH8o#-BJyZLPKBG)|A@m^_h<<sUE;;NjtWMZ@2{oUQn_s`1gtwT)*D+I8-l0=k)
zowjoV3(1C8Kn0|u;dPSrSk~k&D~1V=dhhZ6&P!KUFG^KcxFux@2n0*PPONifVi;AR
zOb`ELwRUfe>w8S&IxSv64!bxdw<X-lgXEN`bGJN+SgtEH3b<bEajo?>^nP7XbvRF~
z5#5}4F!H%zi(|8DQOBT=(;04vxMbPQkk}78`XZ;nV)VVdzRar@yR;Q~vp-t)!6jUW
zV*U`<x1k86aB)O}#VA=Vh@`AKD7hu_OqyK`3yX?z%CNF)Q&<%@JMF_M8DqrYBZPQz
zt62Z(F+(8Rane^W-yzFn77xF@XphIeQMRl$NKE0<HBn;xxWG{-1pQl1aa)d$^A-<R
zEM5$a8`L;~6|SmsMFWItzJIyjTsSE}bR3RcTk=c<@lGxf1DecG)Jpb~&T>)<?Iv%z
z;mk8MA41-w;i}y31>kvs#XWAGzCLzRgj)*_XoCT+ptCst0$J_yp(6g;>lw-wJTw+3
z60#<pAusgXZ@I{;n+`Qhi2lMM`7oP$xYJ-D2Ej`492ySAPO3T&lqPXHFB3PjB-TY}
z#nCg6hgxwS$`<C@VhEYG2Sb9Yz^DsAv32xn_h_$afsy!q6xZ(T9}p;Sx(de9^BIHj
zPE@m6l+Z_wF6`n)8Jo-k=HfBPlCeqX4Mrwp)8c1OOOMnCh8f^ng4+nzLB~|&er#4c
z3Q$rU@j*9SMoJ+!&QoSGG4KY8O_qx~&*eEX(|!xj2UkD_hx3oNMCTm_k)ZaYZ7{xW
zKJ|t<i20k`Bcq~BWu*ZJY`{jbW+iVSlmjG}y)0{=>vR_Ivqhuo5aS82X(Ho@>M;sY
zU=65aZ$#4G#|?X13D>rJbi3yFj^eiS_7<{{g(wY5`>-rlDMX!=Gc9{Zw;1G8bQ}vu
zslqhZxjeYt>{)jnw{2_@T=V|f?Rv;NlPd9K+R5F<ao^?b6PplE!1EY4?jN%mLF}f0
zkT+APRz*~WmdolU9AGNPZdxD+B96L|*%I@22(Qfi4&}CITGDFW1Q$9J13r%~0#vPi
zJ~?jgyokH>hGRFbDb<gn6@C8ba(=@~T^24S->aIw>3w@Lg6k!?n(_n{J7JU<{?R*F
zhhKR`etNsP{Kf`f8)P(iVR`cYX&Ti~%CT`=3HjrU+qF%%Bz~^Bz^qQt<C2M}p=6Xw
zYdaT{A4cOKQ~@<AVJd~RLtHRdt~@PZk<Zl^kHGpb|4TlTUU!hKW#lgMpxYZ~4`3@F
zWRnj5UGIF6J~rU<%{O1+-}<*-Z`i-^X*~Sqn}`2W|Ek{j=IgJ&Z9If>^=}?N{Ptgx
zjW5#s4WAjxj*{eGW@od}bT+5l4e$S#e%M3l-}bwtl3DN6u9EtC{hN*T`g$X2Y;1h{
zpx$`U_;XVK`q9J2qsGHzk^%__7_RwYoctTsJ(#r-QH;84?O{rCTR3WDoH4=ICvX6F
z)A2PsOdqCz_Q>N1d%Iw7yML8@#K~i1Lfgaji*5UC+8w01N5jEc{0tRz_{?Xo1*Ft5
z%`Z`(OTm-&>;pBm6c&?b9#ao}o-B3%J8=AS=pxTqvc{A2T$FUkxx6|)dWO=f%{VeM
zT*?@XeHdin!e4tNG+oh5*%d5ZRjf7}aYpmW`MTqLkr}*5(|4F03&#~26Cbo#%XWa_
z`*DLNv+=aoy|+{(y>55ZP!aAIadf1OsSIk#$^Ns}-qQn)kUc<WyOdJI!t?#Z(?ldS
z8bXlfSLUFi9~jQ%V1%=WW$R!dxQer?=Nx_cS;{8VqzC2?cTQdqv-_L-33QD4wR`j$
z6BrcPPK*J1rmY#W9<tap?>;^6R{-K*&2S=1ROV6gr!4u2`S<Ki@)IZSNq)kRNN?V(
z|2$g4qB~c>VRN=eE{VpGkK|>Nto8U(2a=-KnV~%;E1A946JMj=(^rwa<8Y__Z8pFK
z9-K|kS>D&d_hFrZtTRyud_I|VOfE6uA&cC33{m$qtFW;vX)L=)-zQgasUoNt;l3}q
zrX>-?(Lr;Ft;<UIVhRO*5xN78BRHpGjpS~8#t6pyloCbusR*cB!dQ|EnLnqj-?on~
zvvZ%@WX$F=5f~&(f65*uOSNR|`_Gqvk=7Dy?S}D*xpX?2#)v?9?3qda&A*9|!@`3M
z(~Cn{Oo6MMaX1^6VYDzu0|kZR!kbRUL`5X)Tf*g+D$I<hXTP96j?&{y(MgnAs4fW&
zrfXW!t?={Z(>lhqqSm5G2xXo`ZWX2gm%TGgQ4uVJpS(=jPoyr~(XxzWIT)zpl0vfo
zU9UIBgc#5zoCA+r&U=zJ;DGVTvxB22I|nD^W(PY;dMxkWA!8xRDcXSC)I%Tcj|Kg$
z)u9JB|6DK1_my|ln9~u)hbAGBjEL<gfnE<~E`BAj0^*7D-bC8=Y!>O}f_R^P+gt-E
zRiv7c_?p&mJ*wb`9Kl03rAh^-VuX>m*iHgS`H7b}DP#p^X0q6v<QBcvp!TLysZ1Gz
zVJf^}0XlZk-H>(lFaeXFhik{RFc=XxBr#WAEle;4_cumwVct#xrmDP)?^(V~YkCz|
zS^Gc-pJy}H1?GjQ&?+R~B^$}3AQO`Io^RUS<1$`$+l$7lDMm}?$<|fqG46c=&fAkS
zge6H@%xlX$K4w)yc+=c-9-G~xv{AH89e4V6caIJZn!Be;#+2g@bA#)RWbSZ}rkF0m
z#*do^&7G4bUO;@^?H;}Q@p%8)^V2+T2FT%n;UO3@egz8c{7PWbLm>f}a_IU6p1Gvh
z!j@xYq!~JIs`PqwRSn!{6c->);HPnQSwY7s7^vB`q%vY-W%d~<s3XE=p;Q!353J#y
zz!Nm|5V293CYKnGCul=y0=m>V-TDY40uPeMG!)LX?y(b`6OXQGzJoUo=-67)p-={9
znTT(HBW~SdztZ*vtlRG~p)BD|Kt=;R{W;Yv?N$!=^jTFLZhB!RT#tD8cpkKdX}gQ{
zU8-7CEipQitl)JE(|rBo8@cWah9kt`oB?IG8z1NRrB2BZVb~j0$N=HXj8`esg;r27
zG*k7&r3it$<X|P-X-9bFM&w6b7fb707&Go2`fCB<ayc%fyGZfj)$ak(xOsOGg2A-_
zczFp~z?ZL1mjFNO_Xf{xTuz@61?p)tELpLw3Tp{%3EG#2{hB!<#G-Rv<>2le=Qa?y
zVMXbSQ>9zX?lzB)PkuZ+-TA=<8Xo+;*P13npbj_ZlBh$w2IwyB=}B8<ic5j@R;f)y
zf7nIZuPE#C7=COoRjXtl<Y`@K9{!IcueUaJMPc;QaiC(2skk^6&&LpvY~*~>qD4g*
zroCGL;BcaRM1Nxb^@sh#SFcasZ0gIEGfAB-NhM^BH)Cj>TuwP)mq0sZR(G8_GZ&%(
z+FdfoKq>$|U@oUsPU&b#OP^tq@^s5p!sf_`L(Y7gm=F$Gm9w9QYxOszPycx&*&t{g
zdZVsr^hdq-_{5RyS_NusEC=8lBujUvfqL2CJ~UOEF%!wyFNnHAV=nJXDX69IA#X`0
z`lk#SxU*G9z*2O2>>jScw_HXOAsf@f2vIp>mln#R-RfH0l_z`=J?G)1h{_e2$duu9
z!}ARaYQiPi4P2`i?VyhhZajlA+}Hpu_A!{hC-T(thS~e_izUWu^(sFTNRcN?Tg3A(
znR9y2qaSn2X!=0mCn&z|6s{OlxOBTTD(@qkTZIkb6<umnoV!t^`PB)wQoTPAFn-2C
zvKJ`y*QV4c*nH?#YH0s8Wu2hJS#SEj$8NI8^nJ?1wbjIA^}u^i{F1W4)1}c|;PRpJ
z!tHIIf{*aM->n-+=x#clUf&FJ7Q3Xwu90=>*G(gyF?L2m^;SH{q>6B0Z-5C{tJ?re
z{!#(vz|{$;k`2f8<_MC4Rw#f@zzbr+N)6Kjl&<8Q0C*y9!T?7AXF!<0o<N}zK{gz-
z@BYG2-0C>CU;uc@(KMI^x~sylBGF17Q@P?LpCxARvFA{*Cu4^vl|N<Gr5hV6pik5W
z+~#Tt5RrJ3BVS6~g<u&tb6I7HWMgpZ)7dl<kLeQwJ_g2en3BYUy_Rq_w_wqV!MU%{
zt6Uu4oD}I^_=_4c5W=MqiyQN0vJwVVFrgk#Q)Wbb%IJ+EYgpJ08rJhZFRd+A9k|LX
zt^gMzzQ*^=G1Ct8?I{!GIf_tOpis(|^c@Kup{xqdd$sOOjO{rLQNBNm%(`tj`{GzU
zh3|3M@N**{@jzqdk#Da{jC0W@gGY8L!~JS^NUIBF5U2JyQiW=N;BsgWhLsQ1JHO&2
z;LA^qH<Vuz2#Tt~_PH=Tw5!bW=OAchJkT%hiQ%#ao^9o<Xu^?Vzq~(&f0e{R_#P=2
z9NOBl-ceHw638;|z}Q2^J>b))_EFkQ{f(kCuIg*L0Nt)7S)h<-HeJY@)w&x!P)+a?
zcnu$QpPPjheN-|+Eizc7XINdIOb!j?E+*;h{34#k)naX3g>mVE%oN;E&ol)4xJcha
zQ^jszL&)2WWzRuS8BR)9P{lKL5#^z1wP4tB@J}V>2ADfy(2aII$DZWW4j9$>cA~8u
zgrjI?R0h|6j_B_=7|nV)dl7R2w)g~m8ff=SvZD~Gv!Hd$oyFCpu^H^4meBnRDy*&!
z-uU8X;9N?MMm21)Yc5MFhg5C_NZLzEiG_^UQhevf%w=x#KgNJqGGD~-_M$1AvM;2w
zj;obU+!ZXFyNG_6(d4q#!g<PVm5#9@$=mvHm;+PR`T1m`^b~V}T}TC(2t_3-Aam^^
zO5~z*3^H*=Vuk&~{Zn@*^6TgTZ+MeJxE_yQ7;A8?qhS93Ee9+aOB*XB3K&c!j-b0o
zT_F!tSPWr`X*wAiPnet(PA)NEt{z$vojSPz9c(3X951jLi7Kdpf<+2CSV1bF5<aRj
zwKxM<>9(hBPY#>jQChIJ9gKr0IQ<1zeGBmm(8l=n%75*t2;G}u9O$MH*unw>-6UV(
z|5Zy$%3~+MGunoeQw&1l0=Xbi3MqhLRAwZ6m5>yJzqbQr&p`{b0|L|ok?2hOfz#u2
zFfjfJL667Hlhd7Jr{91DafDR}tCa&!i@8Ef0a_zYA%eFo2~%MtexDXp{_1Zp{E?cE
zJvXEm3bx_s4`U=zQ7ml+T@N&n&Vx++7+P1=P)AeA&04M_PigDGh)w%WC-_KUr?b$i
z`1w_HBM!I+->np1v~^lrZk#x1*)DhPbzg*}zsF##-@=%}Bpd<iy*0>M*pzYkC|JC>
z%fS1=;}k~H5|4qbEHX8-K(P)XUMFA(@h2We#srE-0`j1Up9-*n6H+M>5m7ImkBah9
z95W;15-Qp|@aR?4J&q@qQ(SXNmTU`;I8pqFh_}n$WjeW5E?uV9{9*sJ^>k<d;Pr7+
zfizne^_-$gdT=EuV>9BUS{=vE-zP)~e>HS}fgplvU|coXCMB??$=`m1-c+LgT`)X=
zb^3YodUv;ZazcCZMeYCQ*neJK{x0^PUw{3u-pJX1!s|cmKYxdhwg1EouU#dL^=}@o
z*Vn&J8XNWcgN;8wsDBGzAAR-kQN3Pl{&_W+P`LHWcIN^}+uNIce!7Y0)n%*Wez79|
zxOs!kCmW%JCZF9jdVrP=(WCSD0h>p~566^%FM3L-Dff)$6Fj7o7(cs=9$a0Db*hVZ
zg&Y}Gg@4c2F40P|%UKgL&Ill0@aZ_KS}DoPogYqjo?!sCJN1nXXpw2))9*Rx7OdX)
zK+B0eK_z?%)33Q7Bd^Fk<kC<{Z^-GC!mYv63RJ4PD-?d%B0}C`5fRlMp{k(Ktz>Mz
zgl{n5_UzK#i&<|v;+KGg@kM~@M~dHLTAD@Ddc(;yi&g9=(|7ybga)PR&U^8Ma)gg@
z3#98Z`$<EQb6&{C$?5SM&kO64B^0__r|RExUk%h<W;L;3pt<wHG>B%R{eaRZtx@ki
zT|w1wHN+?^7W<QV4-y8&y83;|<wq3nxTE{b3A`@b8FI=8Yujj+i@&@`HK>R}+zyvS
z^+k6~x2*q#+JlY)Lxq~X9~$lwOh`v;Aj6u0UuBA78ceSoJp>clBWpCZjm9RQA04SJ
z@R~`ajkb_szX$t=E;`DqNebs^1vSr|L5tk2U@)CQb!~gNE~$w~Rw8pb?hPwrpq9o}
z^Ny9A%vX})V~p9jJ5ofg<nRrSm&2;E*)A)a)c&f*uP`1<A_kLiw5v{#k6E+gx>jjN
z9<ex3q)CDPfUl2P(B8qHI?j8+KzUA72&YvwS<Z{s7?-c6jg`2QW4+UtuzSVF4qhl6
zDyHd|t1H5S<9b|m+~D0DPbb|$zu%gw#%GJtgE%WFc*@L4ZwiNsPZw-9S(^8)1z>0o
zmoJVf*2k)jtLL)37gWFuQ>rv<m}KgXh1`oQwm6_7*G^Wql82jj&6fC<Ig*;1@esS!
zqxcMV*02_)xwSRF2pNx(_JiMwz@cC_i}8rxzx+NG?r6Msxq1&pBJn?MmkKJt(vMZE
z`w-LF-L$P=McevS`L=%L1LW~7kGC1B7&&3lyuFzE3;bR0S`QsZpBBar5sQ=gQouBd
zen8(I8~TACc`0zz(WTeO;^oOUe^Zxy<n5Hx|1l9`G#;m%s0Wkqhz+y%TMxTnpoZB#
z$H`YNY6<1frdT2==MMx*3Edvxb?AG`_xWI0!Gn(okhSN88p!xPftP_ACV^>OqJw@r
zn@%rrJ1*9?f$VBeIepXV%NCh|v00I@u_PFpU~{K0gVrp-TwzuzML_(q8EL%`R4k1+
zni82oToCn_2=$kbhu}ytm?@1O7VDHC<?`$r20(_+cI*bjKWj~|$35poG$lu(ZtsJ&
z+Q7D*(e(7v$Sxd~cQc$`QX@9Sc|K_`1w6a-R#j@1!e%_vOEkYp?m7kZv({ub@{Udf
zqQG<LQCP|ylI%+#5-B(BUH(r!Gmdy4b|u|79vD~%g5mNrla-zsZt061o5SW`ZhvxU
z^gIxPFLQXHgZ{96?t)r5h~90TwI`E-sJ$=ZdcXgn^E3a#=Z-46^A=7tf9U3%HRU>F
z*!L06v1v7mVnck4+s4vzN^~G63<G{ldKc~N!bSDN<9%Px%KS5&MQ7M5>|u_rv%%;l
zx}%63EF~ok^?Ca8gfq%nC6Pa)#XE|faV3cf0HDI=h?KU|CDjOkL-xJ2%|^b>tVaPK
z=QbKJrU53V`5|QBaL0{uqr`C1XiJLbdHEF=%yT)doA2eTY(6)vay>vA)V?f5LE(lI
zDqy`xN$1UE&=3$%k3G4>15T+DjN8?Lc0?_NY9xoR0H<vGN8FC+dSDRIh#PjqJh;Z~
z2S+lIN&7uzW;z16fT7_QHpI9w9!=~5hcmfbAO(rf6D64bq9<yhEuMdp=5DnE_<Ge^
zROA=)JG(>kkC}>lZd!F@CVLYk=jSXvn|B1~Pq`IpE`J8^4bk-vGXPZrmdjcSx7b3=
z$>uar_0aRp`baavSvB{NWf3S?k{BOqM?RF88q@4*eb^gqMinQ%;v}qyZzf?yZ(Hm{
zA&B<bW*oJZ6{LCXjfQUnZJS;bQH;9@#aF?cGn}hzHs*AyZ-3q}0kw2!7}HJ7)Q2w3
z0DAtVeL>Gu5iXpw6s|pOKOlUD92ssn;k}<Asl&-$dfg&ZEmvV!6%RdU;Nb`aQ-o~e
zZ)#Hkn+j%^08^T(8y5Pk*J)!y&51hhYD-n$64VW5I7~<9KHGP1w7iKnQ0a(lzS}Go
z)!3{(S|rmLl=oInL*!O*-w}k?<m<#goajSGa(oQsuz*)H8pmARGmIY?Cr~(D9xVX%
z1bdCZ#NQ{Ow3bK?!gh}6aIhHCZ!GQ|=Bf`+Iy;<JL~uLg7_RtrQq4CbGVZt;ImQ)0
zG9uHZhRjcB3>EZ2gB9j^EymUf5Jh=#>g=j*Z?Zl&u0V`yU}N}{{jb`Y-tV$ATesbs
zrZ;)_zA8x4!SP#;t`1qYn;M@``{BNOdY;>!#%<rb4K%nzN^o#>6DUk`1j4jYeEF-I
zTujUuAf|P8%Hkgl-ZPhTU5f+(0a5gPdWebCLt{GglJqZ+Vle6bO~GVZ_i&<}+6JB+
z9UU}x4qXdpt{M*Z%vDq(9VV!O#_Gwvd%FC-!2|R=etptB-rG6dam|i{X2-tSsJ5@D
zOdlnm3~JB(Y;s11#BF$r9yi=q4w!S_ihVqf-fK1g(=nRHb;mK!Kw#!W!O^Tvcb-uE
zMKh&~U`iLao6<$`lr9RV^a&%64Rg;s!D!vjMxbuOffm~kT1iI<$q4@;5!$fv6?9lP
z5RhI1#y&?y{)ps#E>Wo4nb7Pmk~#CoQ<7{!(-df7l>_Om>PC>p3*I+kr}W;i$Nmy*
zf7Ru%&KU9?V^UPwc-3G_4M$@T6>hOKY9|^bb22voKcuJkth)+6uN$cdwdTbJTBIQ*
z-7f%x-J`?Zol|4IO8Aji%?o8rWwpaHcZ*yT{CaI$XuS<#*pz`sVhw2A>9wKvIEq0u
zm1NBY<nXdKl`X*PWg4bM+X+I{qL@b47roF#=gl!>H%T-OEwJA|#^BGg!I_$e;YUd6
zDY6FzGjpPO_E2@+sR|FyE5P{AaGV3Ed_Fbi_QW%c*v5PWln<A>e?N(Lc0{?DM_!6*
zh8d4?6pzz6s&1iJwso@q*XAiK@N`%$5Jt&b$w<?y-lRWF-!B=V;gqT0SZc`Y!0hH<
z$@YyhB9RR38M=XOV~HAe>u}i63M@6!!e%nq#&8I0YgLzwlMXP)29LOv(q$OLi*VVy
z?2NA~JkHfAoco|O&;U12GO|XX<@WXnXzfCtuha!iH85G^?ZuShYt9D)xUtc)n-->z
zVmrS&>9f^y5+PaY-L)wbsKIUH3~3x%Dg1L?&(E;epGMx=gduk(DElndOSf}W?pfhg
z7!~TUJTVnNbE7XftI?lMUdjP)R=jD%8H15G%c(%mEJi(Js*hZCTx`usCtsl>6*|6x
z4XUBmC}-Xr<qT<}j{mJD3rdZpV=HvVfUYlFJ9~SNjC~F+nNnNrZnrYR!~rmZ%>vIH
zsD1MKNm=b|c6L+km#+`XYG2NVH`U(T|GuntcW`xM-$$kMzD#eN_p777l+_-m?{BL8
z`tW60?b+xOYUgU&lw3-FZ-j-^wZdI#(dCH%h%kk{0U)^OFV9+SJV6eDayhjdVAI1a
zMS*3zGf6Ya0R)Q#<Ul)nmmyv7me~z9TV5v1LA70*;90)xvErOOZK`*E6;h$&oy9-;
z8pk`8LG?}rsg+e1t9}3j=BT|up>tqGPE4eCAG@zYV?&IitcC=x%_rC<$K1vo5O9M&
zd5N*_pZP%g16F1ojdv#J#~fiv`+q|HyT*2NjqTo|vE8t-7q=YRi(2yY-8=gyFDiC$
z$#==SRZ>hv&mYa3$ctOfB-i(DN#DB#eTVaY@#Mp;=l#x2;{&zjVWyi>)~kcsxKo2x
zf32Vi+$yHVg+oGTYkGl!Gp;!jOqKjewK5uw0f|Fis5xV|<kt_IA2&5fnNZOLudY6w
zA0QY2zt*Ohav2s$Zx(;?KyBXZ&7#*Gdc7OHj)W(ZGcvEUPde4GztX#55?>B@#)FC>
zLW1ddEar=SG~Wr+*cNml=}IPC()M@<m0Z3hLN1=e(YTUDQRMI)qB0STAM6g(Y&L-c
z9indds;6D?clAn{g(F?vlO8ZOlj}z;cEPW#5A_~Ef?@~R!K^J7gzWI1w~p)}-FCk-
zl-PY(c5NFKy-2=cfe3W&a%S+(aBX|MwoT)tObcjtje1mIy-al8IPAw=Pp;T`p&J&=
zO$EG4{&-n^#Tb7k_mhe>o{WR9R;xDXcV%rYXU~buTi9S=jOnQiXSGT?n~tMT$#=y2
z_;5s`ANQLFdrC5Q0W`?Gl8$U3UXP9_Mi08lA|Ss9Mv*QN;P2goBXEUbM2Jn#5>|%O
zg~CzU=!!uNt~g#Hn7*B~y|Av0rx-7*O-H5)B=G<|8_rg;<|#sr3j>(1`gluC$+#wd
z<7YgoRreLSiF_kc#rK83Fp~~(%7}!K;ekUxs76F%gpLFH@#q!MQQtSMk85a%2<M-!
zUc;D#KE{#5tR`p9x9A(>o8y)(qC7Ba^vokWdpm|qXK<g5UF<&!vWX$~(SE|6!V1*b
zty)lBWN0J^^&<;!j3*A5@Z%&qZW5!xQ1Lsko4%yuu%H=Wn<wpCtQXAr^{el9f>BYR
zP8g6`sm;<ILfke(VQBW#*_*ZPtK0R>0on?d<b1Pukr*I?;rK|Z_s@Aey^$S8AjNj_
zs>zw%e!a~COHFN(ZngGppb%yj$xG*SLHk}4ir}_Aoh-J7pS(<R0Lzvti<XLuf5Iek
zK=^w6J%+@aUCI3^FlJ!#O$?MQDF+y=g=fH;mT{Td?GDMwP1|Xgf$-o9yQjBVio@n#
za$U_mk7OX?U+$Kl4q-i?t1}AOQ1s6l&;m&l?C(z5mhbWf@@y9)MBQcu51!g73DHu3
z_M$rlEx{*ei=0$ErJr_&NG#&V=16=a8>xx-<Tg`Aamk!kv)Nfq#45LFmBc7>TD_dH
z!V${dqE!;F%xSedxT=X5<~CzJn!m1>DX%M(yG5%cj+xWyIDKCevCS=7B{9un7jvFb
z3j@rQGi95m)D0pbf4PS&nC+;X1!Ks9ITg2bBN93~jq#7z@;mL7P<pIKLfXh=wM1H4
zVl$Ew>5A7fun{%{S!h~+BNf#=%!gT-w_TxnI=5S;8qT6^g2GeWriwZ>j8qAV?N);g
zjv}RmJ7D`gIX&J#e70c6&cxx2H3qlp)2GgI=BlwtqyH#$1rG~VbqH>Bc>saR9=HsO
zWK?k&1e)Pb-ijKVSVC2os&e{E(Zs5Sb6OmxS#S7duGQcU@<AdyYiD>}byy5la#IHP
z8}W}KF+97)A^4A%uk1{mL@Yr^KpAp&Th^)hpXC_vMYuXeqO9ENm<^-sr)Z!eRGP@0
zkwp!pzIMY)CxtGrraNED%S0BL?!jphITsB&uz#Z+3n{yQ?hFbE(s%}HBlbUS^ry{}
z@HpaN-TeX-94f*Baq{iQcKZ<lsec<fzzp~-H{h6m4`n40J+SDMK7QilFb~tMu-{1Y
zSO=2|1#pzSS<He}>V!o5neh<A)YgM^mIcxibY8;J<&wVq1x~(}(3-ki;v(uGi!Sw7
zyT@?9#`mfhF^6#g6I5@fDlT@`92liK6kDT}0jaw&&_?LUn%^Tol-+nBXz4sn-c!Jz
zUEfgUtxR#5B$H^1gYG5m?k{Mv7UUN9AIYc8@3zD3@G`)NQYa9UmH|^dsay_D{)jx5
z=0>92vSs;Lb^;}t_2Pi~djO!3j6^3vrP-R@Wig<&H5P{32PQrEBg$Jt;Rhz@UNRUZ
z<6*l)30>T5(@`%5lU=C0KkBE+N@t*uK?j;Wv$ZBS8iN={o0@$H;e^?Egk1{4z`Bs4
zB4a62=?qrU;D^dZy%uEtG2OEg0R`722_kEtry9hmmP8_Tv!?>*TEGl6SxqWBAbPdN
z<BZxMg$zucT}G+ID*k*d5Vwizg2qmy+rjwWynx;G{V1MBbPs4-HQ#L1xr*<%Ja}tK
zjd?tou+7#u?yO8DAhv<3#!~&&`Z!DwTQCxTK0>`%G+uyH#jqTEZ`9)m?;K1c&8G2C
z8A+`LQPMqpM}-4Ky#U(19j=Xg`=5v>T{h^?#FA^#T|V!GMW?G2TZ%apV7)Z+ST7pQ
z+M2(IjqN4wP#z&nW+T+uC2uc!liqUVzHHZWlsa=?Q^vR_UH7s_Zqs11GtIIX-{7=j
zH(sLiw8sTyjCO6M;$qe4Dy~uPJhXsdVl8N;805>q<LS{cI<s5&FhZ$p+8Z0ORC~2i
z-7G3M=zid>^af&DrCOs_B<JX;GvPelIm~TZ<EU7++j>k(d(WK>X+QbSdX2z<YTQm<
zq!51|*@{%Bh7*eJ+qsN0Cwy=LeFFFhr8C&DB!V52qL`HWqxO(j#3ZB0*Tz63zCIL1
zopbMlt#2zYF7N;#cy-)-RW2-(fVyfqkS{RSJ;Ti^EhONCa8!;Ryqpk=v$`GQdA|=5
z(0N$6=S(9xt}Y7n!$TEX0&5-xxT`6Pg2aUt(W82Mw8iAz%9gwdo$GQe@Io+pt8RJ0
zZrdF$3H8>vU2nAV^E#VjtZ7cNe5YXqGR!X{Ryr-fMobiT&IoQWyPffvp!+r#P(lc%
z&KXAfiEvh2qApukS|YlT9F~W=4}BWSbqvzYsURyH3YE=4;6w&Qf{_OLSU}i`l?4=a
zS9Gb+nvht~FN?boX?+6ex*DqFj*mEBch0KDE}gGEv^@GQhmh?0pvMK&R1f>B9#x*C
zc%CMMcHn+67f@JsQI1GIRhV(oJU!Sy$w_lZpCrvyhZ-Z^lyEKK{iIGJ_5vA^(_c1i
zq0-dFe?s9^ASbzD(?16Nbflk-ZJP|fY%rAA)YiwN36-BF=1iy*M=Sj;WPsM{)s=&%
zXpeQ$deuB`Jw14R@*Kf0_Q}8++ZetDxr6p((!Q457`<LMV*;PNC?en@UCE^9DoJn`
z@?mlSzQ(3kfIZt&;1@apgt18+EcP~XU?cLiFdgVs#Nl(`=#MsYu+0H!G_($CQv4{O
zy*Sp)|IgmPH>Pnc3FGkluk<M<oJ|B0V1eXIB+EG%VMkBUWhIo$I$k`$AWaMmhXG4E
zS?_0m>(;lqAY?l^yZZ|#$AX#e>gww5>gwvctP+pr0e27W(~DL@8nYzp2iYPZtjqJ1
z<~Ncoi2TuJlav0)o#-Ijm%ZOC4XH6toND8WTi3b*>fkP3c>!Ny>v3PA6}>`>f_9(V
z#12s-X$zAHK7wN=0^4^7_czQb`rC7;2!FP=%ES*6c{_%VeHsP6WNBI1Fu78pv?g{V
zzrD?|BSAQC?SW5Sv*yb11_LyVOB|OonkP~XVFRIu>P!U-%|XV2lXcSt^H*D-iWanQ
z&&$uZ*7&h;4*1-2yi90<p@225vNTPJiD+{-t(>W7<qX1?iHVo`{>&f8S<2^x1}^i0
zJR_Q4;^Ne@=KO>$mk+%T*RhV-E+_q%nE0$!`ptXp^=Rs+Cq2HKloC@iah(8d{AQG3
zm{S*@<V>Z^IqujO`b%ox$M$ppiGOt@?f;#hCGp?=Y4~LVz~2-9eYXzp67k<3Z}0vU
z|NYPS*zw<Kz$pOy<Hr&Je*4*@?Wd2ncfH!Pz1`Yg?OApJ_{Q1MgM+^F4(CRAAN%v`
zR2+CX65SsM9&mqnAb9L>A`JYO3JpIFk}=yegT;T@u<#4m>&Mf)Sn*c$CX_J3K`@!W
z0YL#6XyM;r6!#=S<aw*zYFxD7S3wAQ_RBejsDR)9_UoiT<r|Cnbu^1royKM7`_uCa
zyTs*rd(XSMxv3)IquCX`!6ZY*xe3P%x5)_x1c-T`T+>hScX2|YRm@pO^y28Dl>$SK
z6Let4s$mjTNH^xL<xm0)>K40_8r1WCcj_z82<u1%ySIe*-P*T9Asdw!;8OPovn=N$
z)WYe2@~HfLVNQEGNT(BBfl8Tt)(&>~>bc{AVQ9t0v6%>OYb6qdQeC4|R8$QnEvuxi
z#DnCR{rl?)Z%{^_r_O6QC!hbqVJxLHDLlWDL^u_LbQZ$Wo(h4CRh_2QohK8L<)}DV
z45A9q9XOBH@@d;Q2R*I3p9NQNmYta#I=X!8<j14)(-SGK1Q>nVQ5TVm*-YZWYZ=Bh
zfN#^$gzw*AfU5R6MUap(`&y>4(6H0Wn*bvw#(nDAXB7-t-JS#wgCJzKa4X6<DfIcm
zW)Z|`z4&+DH>#8rdIOa!wYRB~dn-*m6CO-0E!LG>!Jz~?1r*CnSIl=ycoxv>r`r#8
z`sZMRr$@ZwQI|f+SbZ{hL}aCFhtc4iV-nHSj{(q!a28EWAa6_3y?+p-Eo)Zn>+UN5
z#RjGPWtuFHwG`zCLyxGz1cPHQY+~MLN1g<BvW_iTJd5sW?O<M>Wc|XTqX?HcHAPvk
zpe(ZmN_)|~=ro!?pkG*unZw#<z{%1o5EsYpRk`&5H5Gazkzh}n+_qvFBoAWNO|zaQ
z7Gq~lLxp6<S|twL5{emN-xm|B_jb@Oo5pHPySH@VY}0o*i^gR;Pu4uj&b&!U@1Zco
z#fnOnPof@zxfyPIcjYD~?mKz<n*OqZ9@ft+G>`1f1%Kf;*iaZI7Lu28IMrD~x3jW@
z>WPY76=<l6F>rw8mokV<{mY~)fE)!Mg3*1XWfZW@NmK5GrCIsy!pFMJSL%A0v@`Rm
zKM7O$Qrv=6WN6ajm^aaAkg;gsDXKgu91PXPht^NjV-d*xC6kUoCy^Hn@#`eGVR!W`
zzG*+nTGj~_4?b#3)Yg`PEN{?B$?SoO6}4;GyeOkbbb*9fBuPkCur&xJ9@Lz062MP@
zQp_dBK&|OwL=hYK^pWItoQFM&6qa!0D%*{Wk~alY5EJrV2CpOu%F_1dh<4PiE(g3x
z2utFUX$z^sTCrUtm1w1l5?rOeePLiKI`UQqY8AwMtClCDJD|4?JSxn5{9U~0p$9jH
zu%}DsBLBgNrNNbtA?HgbCt+f4WKv$tc$QIKjKeZ!HuhXg>q2yw3A%?1PU<5>-`X;}
zN6A%{Q8Y0wY^PLNr9YgJebxT(*MEGmt`YD4hu-q`y??yGfAB8E>EJ)$KM8u~cHGJm
zv+DS<QQ`d^jxu^lsV%3YupeS*;g}Pm0f)ipwR4K%f?3&29BmSR4^mRTxWK0*M<q@q
z0)l}oiTedgl9nh~$lQP1D)~<IzyXOIHj#mJX=RDiS-j>7Pp{k>3cFO&5=zaDo>gvN
zQN(d|#adQk8k1YgVj#wOHcAyW-F%)pnw0cSIqjixys$3+lE~QI&qV5>D-tDfw(xiW
zd(V=`Q=`A)o@niJejg6F#%PUg24K&tyzrW(?9C26pjKI3dDBy!1|y18?Vi@);K#vL
zPfsvsDLcO<<uoVmxFAG%nX{r#GD?>xmlv(WMB3E3S_IS_wv7vsMy9})SRD;JelvfY
zebNczzOl^wY^qq$QvEh9syvEInv>(46>r^E1}#HDTlhqnA~6?->?DV-MhXXj<vJo{
z)+{iCzz&5Jiqi}X1=-ETLFEQtip9fvPd>6b=Xj(;gN{%aZ9UJyNd@=M#0Z<MS>Nl<
z%&4U>qw*!QEl2gtB6W9J)za$<I}z2h*W0#HsqFD<J3&DN_(t`d&VF)F5$3*q9JQI9
z1RJ{JOUz_WoTX%1N+3KzKAbv06x#(*(<A@r6lN1EFC6{<F?y}rbIEl=T%C5#sZ&|v
zA`^-J7|ut&@h;nQg14(&s#G|c0(LunP(GT>gDZ`5D8K#$q^;na3I_?xo=mB0Y?>n@
zgsJ?nf^m`Z`lOQK3dF2*xZBxtA4HcZ8U;C%|I-+?6_fg20U;VK-L1+hzU?NurmwPF
zYimW7YS<yYvobmGqzX2?!7G*H&vHIhLCua(?Nnje-Li-L5X@qfHikYN8|}DbDg%fP
z#k$FvN_6<&)UvaNj&t}ZWqGEOChyFVV|$__U1r#yq%cvT%(L)U(E}nAZdj0x%@npL
zfC^U(jR0#xAfF+bxse#mNT)*~C;=*sZg!x3DZf}+T;e;JGy`q~hbWy`KxHQQU8!q?
z8ul#soGI#29Oz=kB!vwi(RtVhwo9u_zmYxnl2P!td4?=krp}`;DTo)paz%0M8wEt(
z(;jHp#eQ{|amo{}vyyoF*|RS-pD@LUo>Le`KQ%*^W{ObzL2?ijgGi5qr5Bz@S!&@=
z90AfSu)fwAfcbUyvS+?;j{wEYyl3nE>;Z6B=(S5lQ|#5{NwafwY7%~!d6Zi7-=DV{
zhlZi#!qj89bbu2p&6%5aSMM8h(HS_okYlgdL~Q|a_k_m4(RhHEn0Hs;syPy><p=0A
zvfIs+7;RxF7ZDo``^xJRG0BkwZDDOyTy$Wa$wPELnONnBMz#zUm#xfanHXjW3yCoP
z3iDASjz7TG@qj*~7b|qa-08<UTZ)!NWQIzsTC7bFNf4IIZ*fuykd!+~(Koywwc&Wa
zN@`2|d;qeCoLPLD&cX+)HbbYKF*s1rljEC>B<WrO83w=Xphhj-*Y_2>j_!lGeX%>d
zTHl}s#lI+G73$B!x(xM$$)Naf5;zmGFOCJv?{<e1=XyR7H~Rj*W}3dy8PaxgXxdH=
zWzQJBDEoS}SO-Z4udhk|Y`YimazBM0EHq6;7fpxyZ@8|q(wV%~sp=<+4OnLXntzQn
zX|*RZv@(Z14gg>Eqau{}Y^Jc}(Amplv^|&6DhG6tl!FP4&-~h-b4IQ(_G&B_e+~<_
zb&E-CS)7^X;X8Hl{gmxeozfAN<(K+y(^=Q@D>iS0JT^?g*y7SOs(#%&3JkDji5u;O
zf3LuCm6MP?L-5PunDYl-t<6;*-PoRU`?@G~b+pRt0BA#sw2-H`usP=YRJTNz@;<ox
zVx836IxT)m1Fp7oeDc1OOA0Rh`9d9>Zg58YQ6uYKY0gVIw{JY8>Nu{G%DFd$5A0Kz
zJIvM|k$-o6|AnyIw<xb~re7#x>cfY2Kl;RhW0gYgx}1=kWm!e>>OVlxOf#a96){)=
zCZM0eAAue^w_jEVfQsT~ZDbj(&Fqnzna*YI9q6-_mCrOepuOLcL#o@zIGXl;%RQWm
zbV=>1@r2@5vO=Yfu_AHi9Ww>aVpTZmP-#~dwm*MkaDSVss&s<mxht?MOV0JAK|p#Q
zjFkm&#*iyOHPu$Wq?c!biTpWbJiM~8$){Ox+^>+(ng$_gCS_bLmTgMD(iF&qX=yU=
z1t>ZW11`mc&^FzuK1x~O5>qQjdytw`tF3=YEagfc+B^cpkUZ%l{yga;L#VHRu2>T1
zh$Z!uSYl*<$+tPhoRVZzhk+!lsK~4E{P+(PU~(;^{&2}A&X;TwbX38?kcbZ?9moXn
zC(AjXF^853Ku$OU3NMh9dn$GFRm-`FkOZkZ>6!N+8hxhR^cfa*%LJ;-&<(aMwIZFO
zY&zX*Z>GeS_(5Vzp1|@Ty4@qU<ZW*~cHY*J>QNtO3DfIZdQhTMo;`7nNumLeZHV~s
zK{A!TU&|J#pp~%>&cafRll`}eSCd)84PY#}#Y-ko%)a_jxMT}u55a{!^KTZbVw3V3
z%M$Gz1Tr#0E}7C=3ajN#?}vzB%N>rsu(9omlk(vbT}pUcVqCkTK<CPC4~LhM=Ztvh
z%5mik$ScTpme8M)=Wt46K8CEhtWu^&`3<i!`}7%rrNVck$RBKwMD&hBaauCsY%w8s
zb~F_i8Bu!&Q$S>ic?{@H2yIR|_`42>oCptMB~*K1`{tIiyvp3fk2L$N=6q;TwdYRH
zBECqpD_(YvE3jZe#Vhc~2g!VWE$g_Cb|Bg3{Hs_W^EnQ-wMtbi-uqW30g`}eiGHd^
zbOTsM%-Qwm7i|C|I}94zpF5S41LwZY*oI}Iv?Ttv?@c+ZOE4e{nJUf;4(v=}XD(Dy
zK~w?HBk$d?%kzrlMVB-->7cRwM7rr=Ch1v^ycmdkr`__VirH0kAH#uekS0!_Bi+y!
ziwKV0o>nP8U=r}JU^e48Iw>r5*EuC4{+iBbgK#+P&i}w!LrEYQDUNVPYe(i%QU{S^
zOQ1SsR1vvbh6arR?6kXSq~()-HGdkro(-IcSRw?|Eb3RS==f#=d7esg$pbyr%Yeol
z?|8~CI*de#7s|tzhcVxhk^H!Hxir%YCTGPottFGVXp{M&Rzc>nX|BF*@)k~V<s@$O
za<ApKmtV{EO^ovV3pGAy+Qu2VH&f}0BWM9pHZUl)J<P0y@k-BDn;6buYZbP0P9yzH
zmXIE-<%G}R1&Nif*NLKAzq&xb*u`M!gm31|c+n=6#hPuE37s+kkJ4sQ`0G6I2V|#<
ze^j?|Qs>zO*ea9$^<wfK9aNY~|8aEc{qtVha55xQQ-1}56uv7+jsNIkI9gJM{Ijgl
zL&QoMBvh+)>d#^pys(yO<Ws4Jk!Z50_R}mx!>$|pV^htzo|yjYL+wLFej_O=x`lDu
zwhE*nvPp4C7!#AUWb{!LmYBko##SbhwlvW&YM(+WJ_#|1d@tm-N@r|y+}HlB=U)Yt
zegqqZS%2EuIduz?a#zPUH`o50zqw;zN$ni;Le;y<7>X;o7_iSo2sm{fdfmL}*r9o^
zDlc9)@%}izX7Bgo#?RgM<#Fry{zLTZ=6UO)(>U)e0e6MdVD684ck>`#1!VKI-EK84
zkaRE^E=Hp(J9x@+5SJ$w0AS0no2){Nfh`B<raHqUNf_JL`++dq^ZrJEAJzY}wr#9+
zc?`4*y3-l&#S5>ty*ffxa>%7%zwx$jcZS220AF<Mc;BN%cN~m8jBHq>t(6}L=kcCD
zxADal>7&=U)4I`ZEFVc&*E)*0UWl31^s!S+VG;#W2)IF0n_Uc2ZH+r44ppxD9HJQm
zW;8FR{vr;Pp??5J%V_BJ@A{);Xj-Me;7BIn6@^?+B&SGZ)Jw+PUpgMG&ROHq4*kjv
z6263^f@_|@YaE}IhP&0l5qDC8S`8qn#*2~Dggm>i5zBfN!BvDpk_z36rbZ@O>AFui
z<T#A`!D!@90z1D$ob4S;PTecm&*W}9BlHd@DC79*9_twiW&^^nPaB}5iKmEFS(_<^
zvS0B+0iR=V<P1LjiFXJTYWYB2&EIC<1!zSRsVSj`9m^sid}@zyiN{0@AUQ!|)ls|5
ztwPPo)AByJ%e;%x#O2OsTQX4c#LRQ;s)Iezot&ULrEd8TrQL2uZpOw*c}YMKOH*gM
zUYt}CPV`P_a3l2x<LUe^;qS4cC2yfnCPTSpqotBtQOhtMlW2a8Ex`;PME72e;j0D(
z+?Km{@-G@@pV;)t!PFXN%w?nlmfT#Js5yK_80z0c@nl-I6tmnwL_M92rG-}Vtdl@d
zA*D|*E>?KP$<aZjol;=D@(c~d#M{K?x};K@iwvq|%+dufZJH7b<ynBhvQD-@l||Zm
zK(Cb*jRzO#+#;-69p&xAk-xa@ieai(6ct)1>$I#71sH%mVSYQ*rzB)zTHYUGcEp5d
z1f9-RN~%y#sUe=+!?>xIH32KuP*RwnI(I^W@Z2bPDcGJ04*$*2v9Ybx#8yVi7YfeO
z<`z|Wb&uMC1IT_pB2x~IzXB#hD>^vhQF-yfK?Q~y*}+sImIE*<CJbPi!8p{^W0mHs
zI0m%kIBeF2fu~IStOuYnCa#=vt(j4Db~4>giP-EnDt11xOMT4FwpaO}<Lu{fzr1<O
zs4pW<{KpVSt%(dm4a4LnZ%DILe#xLPF1lsJwC`W+z%EeUF&NE=&0<!bQ*tG0|Epsr
z|6lqniT_Puj=w|z@a6HpYqjlKJsJP|$?lWC;(z}cA3Odx4>$z?ufc!SItBoL`lwca
zRDb5xcK04X+uPkq2LNv@Zo^UN&+e?NRCuqW?*()v5aAtpOc$@BK93(9GCZCS;Hc;Z
z{>C;R9{Kx^2;mJMEr=wq3Nnuz#DL4nR3}Kf5~(W+{e)!C<L;QGM<u1{%LoQnDj7L%
z6i(iYeGa?kl*+DE0xR4_;!!G0E9_UGe`{e!X^v1`qMEdLbf34w6dl@sI33zwfDR*}
z!?ynI(qVKz9hA!zJ;7*seOvINr*ADoD3@%PQ`qJW(Wq9IN<zvlKCtM1tV|v0d49ha
zA5_OVe+^0hA3zdBNfo~=s?<3V^tDAUm2u?v4{3aLqM76nv#dgKSsD9;KH1V8ziys#
zpqkCiDayYX6k8_<-8UVd?%PDL$d1({2nEW>MM^vgU7tsb5BRcF!rsEM-9pFlW}D)B
zfbh*!Q=??$Z+d%RYV*Bqv;dywb7tIl8chaxFiwZ3<4cGEI>ld^F~Jmgtn7+W6^O4L
zr6K2mab4`D%Bv0a$O}rxYikizQ~+DU#^l80Ho@&&30iscN7OQN?%JLkQbOl>##u2(
zjgpyBYC?_u+52F?z?)r0{>qtdL_x{IM<>j=SlN!k4*{mmPDUQVilhZQfZ?A?&1)YD
zhI3UMwwY-#^QKW88igUxBx?yMG!|7jTg?KR{8#Yv!!^*J0S}@DvLakR0{$Jp-tfq$
zRbzxO1S<`qsvhnq3OP;kv`tsiudGR#2Ly}aG`D+W<Am?CmaTnx4uUrHQWmaWQbwKe
zrBGNx2=mj?^HG%RC3H_V<utMH1W^a>Gz)@E?v&^<X_Y=GCSdVIdyyhb(u>q0AkD5+
z7qGO2KCL%I2N#^KfDaVUP)cBfJ*95Dm#;buF`vnrNWq%5Iy{rOf@Yd_v25;Xn0Az2
zXwD@1DvWz0yqAwkYR;tTtTmtpy92%YGbRWYv!_Rj(ds0p?nGEhek|@JtxArvJT^yO
zyANg0?3h$JYmXHsdy~okF!OXGu&HU^Mx0obLL7vt$a{CypGDE!C5cI+AlfA*VvuB>
zC1OaqVPc1%$N3V*Pze}k=ck=h)<;xcytf3NA#1GOD=7<pPt&ib)@zE}n<^nsx2;Ej
zOb}ucIQOw7v8l(HSkU@um9SbdY2ZxBFz$YUXR|BonVrMldTe2nKpliu0AhnRPpqN{
zfDbhTyC?{q*>B=#G3(ouauwVzFU%PCvL18I{h3keESfSHWqS<D-qD0jd|<~_6C+)3
zsw+)(JNc#G>(cL)x;MYDB6K-959oBUq#hH!oEVm}vRG<I{U7~Vetk7-%E^faC|}4u
zj9Z&3ma>K;=X7MwK$dX~PqSiQE2_V9&w+^)EuON&&iXh9C-;Ekq7G+aQrqbS8paN#
z9Yyac+V-R}zxFV0oRzoNpCgM3ym$C7hI%(9Ztw8hMioJv(@c$d4+8eBWlyplOz2c!
zp~jh-;n>0aTFqTPQqpS)ipWo<770mh>LjOlo>-c&JDC~sCVX3^z$DW?>D>EH8VfoX
zz>7qMU^1X4mDpe?(#P2LcGzkQSEWjokb2e|%Y-$pwRf9_zuI!kcxu=e1FnEC^2Wbf
z6ZO~UU-4O@|HWuYVeboQfbYrw_+-0QOXz=}*6a1Z^uK?`$JYO<0WW{>YSr3KU2;Iy
zwjXUjepK7_YLEAJcK2%Erd7bOWlaYD40g1zHzQ3ja91%#z%#keT47ZFPW|~jm`y5U
zf8IwEf(I*s`>04xC5aThu=6a8Qjf5I_vVshIwX|J?W33XWs_Xo5_mTyqc6{JyY$9B
z2<K$;zL=o>*9Pj1U}J+#0a!eARJFLkr^S9r@%v(tE1(k!yeYw}l685`R<pBiDq^bG
zU|WGi;cc5Q0Ik?)H8{YS$WB(wJ934!bqF;_g<$+Rrcpc#Mrd2(JWB_lqx0K{61=Dx
zq7*iJI`xY;4t$s|JyieDF)x@5OzsXS5Bu$Q2`ge+8PjA539!X_Y!#>o3vq6p@2J9_
z3U-{JUA*YsM>{7h9iNPr(b7<Y#0RLLs8lpHEkdIQcCsdRJXsIz;Y_WavRA3;niM9F
zT6^x*O1fcf295AuI20>M8}_pVqysGC#@w?5>upgn%ya|AD)dAAbm$DNtDqG%pI-}w
z{5hq@V-{e%<Y1-w{BkiI!UF1j!XVM>9@N)H^F3QlGD00bmGK7yT9n`Ppv!MYZ%u9N
z9DB_arSj5_jiQ@mFv)bc<a_u>c9BKk0}_BoEYzwocDp-|2<IYmB@{Bv^~!_0znD({
z*L9z8{<Q9=W_4z|u`fBJLrHh<@E8+F;+_dVsZ=P1qC*PR4$XbVYCdJ~@w)5}<FdGq
z+`}yEXzh~bveSqxq3>a{2;VSTHbx5-tE9%CAIP>8+B~<&y(>{GFQC3^Z{$>dL65Zw
zm)HoiVJAgH#!E153==7z0@@aFyo;#rC=%$3$4G2hHo5YE?Z&7f1g|n_>H{ft-DJ3u
zEjk{dNH&imIId2v3TFJ>?3$D1HS85PaaUYY=um47vEB;N63sCM%A8y@WwO%2ngt;l
z|8xX(Ib26W?J*|=wKI0OtMMLoQp3(2xT!7?SU+n;hDJ#a>uh$VZLqcc2gm+Clmogd
zYj_&=f>Y7rRjQ(GP4%Ev%Fa&Np<hvHwdwU7lhd+1eaW3I;;&L$6Ut&9MT?Z1CGTZf
z>27$bmwHxqRyQq0Vw}^iWm;pIF;qlTmBpx*b@MNVdNeOAYkp^xg>0di11n!K<r)UB
zIo@d28d^+9^Mkh1i1`%=xJD0FSe=)O!tM8iPx@fhvqq=WIzRD_8=dC&M<=iG*{4A}
zaKj@s8)x0ilUGM4M;G6>4%dnxkvi|rPA`s--teXl2NxU;c&k*c$9NXxvHU%`0nGa3
z&Zs;>@cIqvv98-TcTZLVQFLGX;}qZhy1h}#scBCn#o4X<Y4Q%T7)9To&e3|wE8^UU
zui;1rD}OOjza(v?bd4E+jU4rco|^qf(now$z~4|XhsMu9y3XZ!>jG1lSybA$DBte3
zE}Cm=8((keM;B+U=24@4u~zucf7{&pu3CKab*11gBU%()Y0WEI1F$(3hkm)>8=)J*
zMr}jSemr_%fQb>Fs>U&9i@=n-@C1LT4vgMbDF?_wVrn?)d8~DUb=ww~Q>c;Qs&iTx
zrFepr?am{0Q|k7|>;jCcg|=qg^b3Q2(U%vvN6Dj-R`WXj!<Tt|)TpW^?(eUtMO0r3
zC8w8;=kN%xQ*lx!N6juJafg*R=H}GwM(oms)5iF5VfWDF9EKWKiq<n{U_ACmK(TRP
zaK=Mr>_JP{UV+%_zqgBpufHyoyh2HBRK_f2t7a6_g3QL7jZ9Sj6V@yst{@B|(Wj5p
zm4olSd%Izq%jETA)t-#QnDWA#e!NX|L)s`3K{4zK5)v;AHp%oT*({>Z?tbsXsTagB
zzQ{U)>Q&Wy_x0P2lEMC?v0@@f@NzlrQW2cemOmepYlYNqU7ABAFp_kEe@2e)@4hv6
z)aef+d)rfJ!{6|f%U&4!qv^E|g2#R;%FssNF4v#TXQS+L1H0THyn>B4v)sroC%9#m
zo7&~3xZh@%i|ump)b9t`<ra21J`!e@yK(7)A>=a4-P+}Dmvs1_reINmne1mpT+%u(
z3|9eyqZR_yb4{)hYQqrXp7+%(h)XG+O7o;Q1Gyf<R@k$};WF;ez`3Wqvd=)cU}`13
zs(Bi58S&9|R|?v5z5CA%<Mip|T2>9&3!WCDap1N12Jvn)?~8pUCU2tkonEZURX@D4
z7nydtv%65)D6xIvR-Li2+dZh;4NFT!46sOfvin$*ZW0X=tKy(*@bD&zTO<7yJxa>X
zz}ZFtQDUXhOzk1=@~>{}839$28A3ra^1c%ok5W61a?;Ek52CP>7>l+ByN*34u_hoL
zr~r%BO3+h2L9+cMQ?z?5q*=DFrncGrC7^o#$e;8x<SQ4VwO!<XGWK>e^+_Hx(=&Yv
zQ9IsZA}HxCub_`Ln=$S>2t46KW*I_J1_m<0+}FQRk-=@7XMnBNI$KK@)%J*r$mb<@
z&!^~VfqBS}D-{MtniVzQ)jnwa;`I_?FmN2hYKjNsUV_UxfCQLmL1zm!XkvwzIkvam
z;CAZYCxfjrvMa1Vb4(C(1x_cpKwSl(5{?&RPtc*H=ks993s2}?jJLwlbBpfCfGl31
zSrnEl$%+!56fy;&!S_KhjlKEoPTYQZt&q@%yjmeL3#P$5<m)~gi4a8UQpRbBcQwWX
z=|@N)0%ks`7=dmUOL(DT^wQW5!og%i_AS(s4HhtlH47g^8qoLrE3_Kc`-(H!^9DSe
z{Fwtz2a^5$Rmc@*kxJ)bbj3nVIK5Wl6=p@8m=UlasErz_NfQ8V!pVo<qPA^CnVFO<
zgU)nylz%FHIM+;4TSdId%32gVXaD3OkyBjaix(1V(VWgpS*#W{pJUnxMPI<2HscIQ
zN{s_A&UwwLG!bi6Kp{wfw~U$@8aZ&L28@{wz;8C_Wd2bNQmv=O1WsCN6sS-#z(&T{
z!3_F>BbT+^;n0xVjeFWJiswznXl5xSJd7TbcwrPwtUqx2u1K3)cdHXOg@UUt_za?p
z6tx=JZLN;El_%{ZlGWA-Q6J@&hcHfeBYC+|v{*?6xHXxHqo=xz_Ba^#$J1g4<#jGO
zOLoy4y|k2OBVSO2lj#+L*oXr`3V^F<9&L~xBVGfI(dcpxBMUh67o5eHwR}0UaS;_7
zB4OYax-+nfRa*y&(nd+b&5Q4fRB(KOOe`_OCG~9Fs+S#2tJWPj0g{%3sFjnNthB18
zq<e;YMyg-ZfW-|g@M&-fHIybN9|SB>kQ?vm#<d*F5?mtCl3uJ*%%YN|$Vny@Ob1Wk
z4;<-s_i09WhEv!x(&Y<VyKp+U(D|6?#87u)I0G3q3}y-JU728?zo|6M4q|BiQcreB
z)JJa|Jyf;=ET!#wgW4|7AL12I;XXcXRDDCL24a<Ss!$&?=T~Y=BGXg_ti&|0w90UQ
zLpxdW<#DK?^HU$lSSdz>V}WW6RJnP3a0ZDhwbbaQ&x|bBD5xcKf`mhq+vBhDDsS4=
z@~6!K4&JKMCYa{Unv|MP^-U?s+{3d@I4(<5MUE|gy<PeG+frh#S!*S^V6)ETcJucy
z9MOh6VCmFLE_xrW?*wHq9I34u7n9H?i*O%PtPAGJo*Sf1>3x&zE4K6*UcBh{gJ7V7
z@wzboEvdOSJe{tb#QdAoS^u^{f6;}5*R)wMS$y7|?Q~xL&O?ozIlj`StvZuT_Dy6q
zM6*!WGYVfQl7zJWd`%N`j-=i?Jn2){Gier427A!KLrp2YI|S48*6^JkTMie8u5fuw
zbr!@aK0*4tqzH{WV!&IGI#an!HF>m>S$}|)9<uf+3iOgaV^jBT8*dvEhppJ{s%}E5
zDfIes$eC_sOSe*6xfP(?cd4e3Zrqqm*CmZs?&(?)PT#0nC}nq2AI<OYWG*B9YMjf$
z=&<_`PR>&%do&G8lDym*0xX7|Kwo;-I3lhYOWNAK2Pmgz-PEib#o?%)P^r~yb0cOY
z60h__FuS`k9*J6e03cofHZJK12n98a$zfdVdEbp{8&>t4TX7W>F%JA09;Nt(54wP!
zLvc6&IB`wi_l@f6z*<vaZo<)sf~O;21cu$a^WNdX<9cRl)$rt8tBfQ|);omW_b2EM
z12x5)p9CPv7Aw`1IcN=y<A_(tvE8*{;l_$MTtxYi%{t6R0aZzf;vkRQcZA`Z?==3-
zaY0T{a%8IGM8grybPU2mm70A7P*MR#Dd^96Kqw0aQZ%g^;}3MVa=^ginpqZc&Eu#0
zsfm4`qftWpLvC<r_tK3f!BTUC@RRgE%T`8URzv96GT3)Zp)3;;2aN9J00Y0HipO@+
zbqu3L#zyY$RlHa>NPjSZsT7R@ku5AOnSt{Fn}|g0ILo3WacB?qp<S7AWSA{v-WX^r
z7t1su1x24a6Vy-^eF83l5iOyLBhYJ;#UxR(h?@aUsV!0$-!#dL?al)f1cA{%g-S;_
zp?N@O5_eXRFoS|x4R$_9gP1gzls*Wge2t;wsOUXc6)f|~#QLFqDCDW<7)`2*uHmEN
z^#~<U&VWgiJKT}F{^B+>ie0F#a?B0|oGGc3TW-o*OX={YdFAU^zMin)6>fZw1uxnD
z)=ExXc&td?Bm%;u265C|eA?s<PqBW>V?x8Dy&LxjB-A{TROZ<JE}k%Xlf9je!hVRB
z7XMfT@!XRBp_|j*?0pfW7-hy~)QswAht9UJOHPA+2x6{wAc{2{ieZAX{0JEUZ9tO0
zx@@QFGS(3ekjNr&;MEJSpjw5$OlgNP%RR1}JuJg!H?CLWEpr6VD={)U7@3)M_m<9L
zXx1_vt7{*aa{i=$4MaF_EQP+q`}i#!WcKk%b+&fEJ>*y8xZ1|(HTsukL86P-57|Ek
z5SJ|w?T|8#Mb;qzDk>$tjzFGJ(SJkIVvY64DG9;MrII79X3?}(F-c@t+vo_&8C3v_
z3hhYhD4Zo(I}DT2MI13!FfeIL>tqCMN7c9t5cYc}KIR65Hh_w2TU&HhT(ypfU-6(j
zVImPUWgAQeEpjyI*{%pIWT&l&wTjemJ!KZ00Y&u9D}&iigSleuONzTPoYV?XOg7G8
zu)uUIW{D5PrJoZPAq)Iwl)f^V>e@>x*Gs8-FhYFQVpdbeT1u{@Snq7`m@Z|uJjH4m
z3)=xPiN=nlj>7uS53C04H<r<(y`k&Xomix_L<4=%!&7zE&sn30))8Zgk+GDkT~LYb
zB~Lj507yxfQP-z@)S{-ogTp1oN(fLlgx9HV5UZSZtROlp7tYQjG-11ka7z{^_Bbbe
zz;<@*fb?|Ewa*s`NN@frR}#I=XV~VOX9-GdJ1_cHf+n-NKmu6q`fx=HbrPXvdj5)b
zjr)}jT>OX$1S!LB{1|FrAcg@RuX2^?NdSayp;StT>VmUFH$!r@y&g7uU*eRMA^a+)
zBMwhah+>$8Db6Fp?T+@+N=mV#R1gh>15!M$GdAV34@AnvrN@&VUGOYh27Rt}ObF2~
z*Ev9c<toe-pi;uzIkzo40>2=OvPXuUvE}vBv(JFed0bb@lHXMW6|}v#WO=s{j?dV$
z4wveTh^Zy|{l%C9uny!Bz_K+?XrhwyOhQ)w@pCO_zS*l!PO`MMC>1cxHu34%$;i8U
za(Vo+b-tH)deJ#QI(cpMf3%{A+`R;ed9A0fE1jIKmOf|hO_E}-4wJv5q2f)t%W#zf
z*x}$RtJ$QSox3%OP$I2y)^ys=Xy(dFhQ5>6j>^*dRq8lHS6_S{0TB$(BtswOwe3jQ
zo!Tx{+0Nsxegv(|02HiJRN&9`<$;s_f^Z3A1EivoOeY+#l;T9T#IXspR`k8E<5EFp
zG|nXC)C$(Vx4vwR$zrmXSTxHyIA1LfD*$_K+UIrFUv^Z+D)$_glba}I8k^4)m)7e>
zy+ifAKA!WTnGUQZ3ykDQ_keSka=4@)DFHUyP0#jzoX=E3TUp3>aJC-uI!@i!^2aKt
zR%)U;try&!au}BE#gCMW-XqS%4X1X>lxKPDWw?PZ5rnm*Y>C1kqpCTe9I)}^g9Gv)
z(KTCYHDax0S35D5@tW0hEpqQpN`Fd>g(Fz-f&^I-04J{eY7`hWdjo49HnC}q;UNm`
z79}$Gdc<avg?MYPxA+q!5#vLln^rp0Z5{h%TC8AC^f;zHFSDfWl+Q4%?RXx}7uM~V
z(P(_6h%X;M&AZYg?@GFYX1iJn`vy%0K3|NC@s@VLm$bzfXg*csr^Su0zx}rQ?YF}X
z<YmFm_A@jIutLjVioK&w>v-*Pt&S})iyV&pD~h}83v^a54a2^#jv)%bt9Ik{#af}V
z<^65Dpi*t+qnQ9yj6wSHKses`y0T4}4nTea5XG(9HZoK;Y({yJJ96tyM+>xcp24O-
zu#vx0dTzT*uTIa88=W;eL`K6RA&H6#`Hc(z=%n-N{J7mZ!RNK@Qd;i$$09<irZfIH
zQV(&$+0`dTE`XYDXbMZ-+$e0Mf{*aB)py@kjyk?SEo|&5`-Wf5*U5%`&6#Qkie`wD
z>h)%9y>t@NeRP`sb(YzRCHfYA{dHDQ+tB^+wpW0+y}eyPW$HZ;GcJ1{+D-m9W_I~8
zcep-g+cNk4i7bFjUwUQnJR8o&^RoQJ3TfM9+}x$0H93sGA>BF5XL#{Q)4ohbjapyf
zI#%&QH<qnRzm2KLq!BXSbk@;Q=}PqyFYW2DK~0p5XGy|Ni9(*cNZo{k`L#i6X@z3l
zqqi|COvX_>FPVxWl~lEdnf3x(4Ug#zSXFGPT|OC`kNI6$g_cZ^Xl7xgLTLzLH;Lbq
z6DqJ$a?gh0oAjr5^rGzPsb!6<zFos2XgrvBM}X-a&n!z_GR;&-04t=JW69~OxFXM7
zwL7ucibZixfOq)t%?Ph!-bx1){(ucVXAO(t+zNT9mB-sFUL8{`U=u5quD#X0%~BI*
ztYLE@h-vzgfkl+8Jkt)4O4uK!cL|~W(!B!erPZ!nQHhcKYfD;KIcAB{w+j}}JqxVk
zVW~<iRnD-$Ca5?<8^PGx(!G5M6k29qf9;0l=EMs$G6_31qz(<a5enWK!;(2#7oicJ
z8rFATSF2Uq3!4BSsop3-DZjdwz#KKx))o%^3!EEC&C={jFL@f;f(qkf3}(%YFgpkx
zl+|+93yDf=u|N|nWf|Asa4nwVDNL{Vu!x;xaAl4iWTqgCxPqo@`<auU*7$Jmsjp$8
zUCl0vP8V`fG7Gia`69SQ2DgRzdTYM^{FxZ*7>!>X^}rz6(n8*FV=qzcO22!(%Aj+e
zi!XxUKhmUQVVb!O1GM3xduBLU*at;iSQ}6g+2scAr}!XoJ(+AbPWICh$E~IwCYGxY
zDVs#HVv><)0pb?9fz`IR-P>7}&(>_(XkjIGxo8C}TR8HPp2bA=9T@O&)nG}(UjC%?
zj7bV7RanCF?;V17_Y8q+m7UOK(->sTwK&msVmjF{vkW#__cn^rP7Q=i8vNLMH=VRc
z*BhDF*Es@~<dU}IlziQ%3!7z^H0q-&@yHcQW%N1_hK=caGt5ra-z=R36G#Lk{Gk9S
z&Fe#gckwKz8t1{4$3bl0plpMq^Lqh9?-j~A3g5>vJ;hZaPw}ff#W+>+6u-(-y4x!2
zD{b|ZX;HSMC3$lt6|8$T^@eY`)a{&l8ZUYR2fxZwpp86)Z|WIFu~1L(yF6E5_07CI
zhogx+g>U*9#TV7j>6g4Sh!{L5;D<b=@BEx?BJkgj>mT<M5;A8_8VB%*RERn0#krVP
z#&46xoXs^k^^$>L0xQQRdR0brRki_IjK^+L=oHhaIM=MY9rcPiLoioB3?c@c*71uA
zz;xAiZ4Z1291X&lsQ~Q`!(cSv^3bntSD8LiRVXa374m}6ga2PggQfU6y)c;!PBBxD
ziw|m<V9~daUfTKCG3QKI3g+E&&w{Hko(KAp_@Z+TP)-`ht+K35ApGB8hmlMkMb2D!
zeAei6U%xs!p-5SBurO4B^N?CR_PDuZl1pd+51cz3;>p3Chi+cg+Fwak|G)cL68|5w
z(tnWz0L$b5@7C(|$I1BrJMieQ`2T;x$BzH62b>cCd<*}tKEWKY&mL{pDFMKfz1=5!
z^?Eu1z)L@dJx?>ul|uU88`J+&<M&HHzIXtCwND%ky}M`u`|w?ihyOtYq9|HKVN9@S
zHuv5EqS0c$QO08ETjKo&vrMHen_t7GrLGpM2A($wf`O?bm{UX1%>-m!6sk9LO%$w0
zAp1}_763`NFd$-$K&qT`+DLr$Za7`cWAgBTFOpSJoO|YIAuKr)@qV0cVSExK(L(`1
z52727oNz|bl{XAWL779$fTW3T)g{W$V=2slS}(hV=pPY>7b|gIyCO%};GQ_Kg|ou%
zI_E#v62ZtLN<Pr}iTI3$wiw0{Csi#}R<vwZfK;a5TjiBCN6pwl7<(zlhJg`)PA1HC
zTxZ+$CC40fJ~5<$gUy&H9~JkNd~@GvM?s?Q6x6wdG}<p}C68uRvG6O){W#mD1iy$A
zPjlojyPJ62QBWr?)ZAdeG~MQrOrD$>huk1-+kk<<xAhGLm%$T#$%Jj-j3zL7@MK`!
z2^jT(Ke@BbTU2o1FgAJ=JBop}Sk`ZO5;&#z-SMrt2f`fhIdaI#H?Q=xxj+BXdMZ*z
zO!iH;Y%7d9+SL+ezWIj#!tb3YM7sk0mWWw1Oi`;em=jh<&!feN+~B@JH#jV9`w`So
zkxbqMe6Y7IU-_I)w<eZZfeIrf@fnlpP@rpgEfd$>Ac8YL98oZGtQ5OyT5^6+ZrZ;q
z)s4~<=&Bjs71?7+Lw`a)OA|{G;0~l~dY5g*PJ@gaim&+Ma%*;42E+sM)_{%}lwJfG
zR<<T)eA3XW#>y{_gXHPOf<{rnEs)F$MPm)i#f>OW4x}{Y$-^#(3)_ZbFu(i0mAAmM
zLdMs^^U~(@M2#!!EW6wk*;&Kdy6h@(7B<T`F<|S?5UW{~I3{aVj)2w2wHh62b?HP_
z6iJpdr`&i!2z&R;vr2me2G+z76^=3NnI&?dP9AQPw2AMb4c%)cY{jh95t;GS$)w6M
zX|RpCj4jtun=G-ChFJA%L#%?B6=qpq$>dytqM6sN;_pjRQovHsoS=J&v2YhgzOJN}
zua_f55FX+|u*h<sgXL(sWz&LFGKiXaIqSsQ46wvu&|6%A{3LwVTK3R{_g!-F*TiDa
z461rj%GnTf{IhMQGyf*>qK6D?Qc?cig~X0Xc?x|C3hWEOwjJN))D2n9Qrl7`E9n73
zL|#LqIV>=^)Gi#39P7~3G=P<=#l2wiA)G}MvJoB9tb^HyvK#MC*we2Eh3uJXcv{Ns
zRB@vrz|UH2GBL8)Zr`2;WNj<KM0~HQ@%}DXG{qJ6x_$bx(Y`o3Ic)u0viS)e1m@T1
zZN3ppvS=hh)i~+fq(<zOkb3V<6zBIg%|PlY24Ydf_3F?)t0xF$%TKgFrKBox;^wu&
znd5Qc+hdNA{UsAK(<Mn*eyVvsH9euc)<%tL6mp7Sb$5%{Ry&!AqL4Axb@CKVgUSx>
z+O{X9b|>MAbO3O<U82*RjUu8H-uGnXqS2lCH^Dy^$wcZ)ch%Hm*Nw-rDaS{u0bv34
z(rQTIv1z3lm$PMM<Cn$zxv?CspMhEYM_}eY-pN3C$3{5LML5l@`joah=c*!^8&FQ=
zY_<uDV}%C#5ge)e^DBSW^RKeAL1kn;pzpAI#eAhzh@qRn_X{BTpbH#+6~Mxz3xraE
zG7{1C53Y%+zo080{Em;ui%~&tZ}yW7%jS&ih1(>K+PvtTo(Xqtp0_SKjq{HB**tBx
zTg?u)uO3~V==T?$macly>YOz$FIv`be0_Y$m{8-+p^k4Z)yAm%N+@chqu@4E%HP%n
zIFKa`8?ji`!RT!nDpN6KQ(|7F{A;9Nt_Mud0c;g}sSwCMI3Y?~UeP{3^&Zu>>$}Si
z!wxb?xV_Xd+u|#>uW=Tvl(A?gmP^m(nW_m`*bn2A)TrZt>w2fuR#{*abL-PNj?47y
zYe?U#V{jbN(Bbwqr?^0{1#j@-U0Y%z9K=JAw)en#hU}VqqROT1)DLIz=k(GMDMo2G
zX;)sl3MQDwHky@lE;KC<{CSWlWFPL)A_T4QLQ0d4N<;f_zmpo#kUE;<98Lx9N%eOR
zDYVZd%^C}%3~nDL_P|g;hW4aP3*T_|*oK2fJ$tr>|C>hAbvgc|0UbqtZYUKjwusGf
zkbheth)#dd0>8aP?paM~S(R0=3p}_D(Wa5LN8=!laZ7evs5|7tLpeEQWK_vsso3HC
z%kt02{OHIB*Ne$}<dW9@=Y))j?K!H(K=W99&?AFcvb8Lur?Uo`aK?5zHVm_sC^l}x
zT)b*!6CH0EYS;=s7~1IYWz;zwN&+%@<(Ul#zQZc!rf3fy0Dk;%fp$~CwXrH4$>l-^
zLq3wJ8Ji?UbU>UjZ1?=&REB+`>K#E>p=237y*Nz(+QYMQpR})H05|b`tckj+*#`{W
zJBsEiup3`Y0Z98w$tI$7t}8et77r;|HWvdO>u!@$3DQt-O2WlJoAFY3I`77xO&l|t
zWHQUT9g}GSVkWva2u<TcHuteFakOeda}aeEWE=RPhCzAAWvVV@T~mjQzh5e(e(Ff+
zy2o1F!3q$uqgb79vT>6Sm>DA)W*RA%EAS!PT9-Rk`bLdTLg6BVrzw+lHRT*aO%%Dz
zam!nkd3z=E(-iMm#y1KFMTA&N<~)5sM#-JT)nXZADo*Bjh{l%7%ui8#a+ikW5#%kv
zQ)?I@x{E;t=AnM%@e<iuvN_ox`f_|M`<8dz(%Ggt8t2YT==D=;hSDxvwmavoj?+uK
zA+M5=9G3cs;c931$i>;00gl^yLYPfV@ULU#Q=Xbf+&<2FP7&}`p_JQ;>>ey8Q(TOB
zav)5rGGFGcB=;@34zdSX??Xzwq?JAr-Mb=*q8DZ{&PicRw}d8JF?#(|g5snBKrjmI
z`~M+%L`#k%8jeKDVbP09p)m{-#w`u!*HxX|IL*53G1EL=Mal+N!=x_c%ex{##n*To
z!ayBG;!emwb*s}^)Pv5%B{vfe#kP|4%LW3HqFSv6Z*9Hf5-~exmd63A1y;Aduy!3i
zS4v4od(3V)O4ut%kn6u~BrnEnk7*r{-968xa!O^MVeD)5P(t)Uxd~7z<TrZ9!)Z5>
z*EyFLHJl%zx>Z19(X88RMO>VmOU|COYu~%a<nR@TqfZroOLDQA!|#&1aEl>1hXh^7
zi2JpCE@R8}0%gm?uBnxfv&G(iDgl-&Rvn!635CxYT4Y#E90?+ArIStG?F2b%4<n}~
zGyMVdRO{-2n-jkR_;?j*E<cU&j~#w~hUy!ARhm9UauOO`Pk^U&j?Id=Q@bbPPL3)o
z!9TP*Et&7qj@6TZm$DSdsr~ZwwB2f)<fD@g&sjq~MPWW$1O;!;D^M_-!aYcy9JP~8
z*mn3J#TT*wD0O3^>d>GEg2bNp^)xF$4aG1e<SE*I%5cbugmIsu@CNp%+q*nve@0St
ztOK)THt>1MZMzym2Im}Rl0;4=`N=h#NE~QfA<Wu!03~hK?y4){jRo}Gc*D~U2Fq*!
zu@I_t#{TR*)$;Mum2aXGIA-z?+l<9rzT|7BZeYX+=9@8IG~gUeggr7_C1Js2*2w^Y
z334U~AeIG78z?MF6sgR>b#CT!3|*3!U76@hNe8Lapj&BKh*+*6pqRy4EJtbOQ+v2+
zhIyT|!G7}CxN9V$udkD)8XV1A4`diK<b67}hn7L2ECQ!~JzoQ#aKS>Ww=V8fvE_!v
z#{gc~>QJJ5v7C!BRm6R&9JJ`bri$<{c}4rBdP6^ydlg;msW<#fy^`Bv^^Sj<m&Pi_
zl+e$#PZpo*R1x*tdTqb59?N!Rz2qlS1QpZjC4QI3w6&|}^h3QMlU4Nse<+VHxmi~4
z)Nk_|x@EnDU*=Wpyo&WJ7P!?b{-s|zRE-^~#u-$N(^OS<462CwtzWyuQ@_<~*f;bm
z_^w>p_;gdYkCpQ3)*<VyMc0(08|xo`|Fi%{ShX3=Kn5q1ed9RrY2XgXr9hecH&46g
zmnUo6Ysg*}lZm*YS+6fHFV<@KI$p%EwMudytH8<W`C1(dY)sIgakK%447SV0fS&#&
zB5S<9>Om<{{jk+IT-(VE48z~?1@7p?8i-fHEMrvZdRn1XATuSz0KW|aSVTyCYbWnV
zB5J0i7O7wT$XqG3DGzd_&*)4m``(wB9)T=Exs;^$%TcR+s6-b71So1rN89dIs%x5-
zVHehqNJJ;2uovpGgB&Y>>er~99L|thS$UFpwDzqeM%I{fNk@_pc^zrs=FYGo;sEYj
zwKE#U9&@8|`x7&@?JdmYqsF-wjnz#{)bB55c7l&|%h^ZI?9omI&Fn{dBUW}xjx~<G
zt0L{$q(CjlRHVCv@N6cpLWkj$-Y&nL_7}Ijf|kxzz6zV@2wUb%iD{?Y1|2<}r5Hje
z1R>M>Q)_&Tvk8b$jGD18l{UXRkikwWI&5)Wu1KVJU&n?s6l`)a$hWStp`udn@IiOv
zU%3LvEy_n~peD-8Uqll!J+z47oPHUdqEjz%t%zDR^HZ<yk|l9YESnL%bc|{yODD%B
z9l3UwSsFK+`gXq&c>$>eHxw7|@DvLRh{VP?ahjb-DE@@_oB~?2AuhWD%^#xdHJUZc
zAF@WtQs<KvD+cG(%S=^B>6Y|Nn6X~Xo!FM>zHN<1hP7kn4KbaZVfZsIh%@i1bB<0{
zgMjFkIpnIWYes#ntXlDev*o?x?r&)0`6Yt|#JZXJ(@z<zyb}?P-o4|HJqG#rch&@C
zYfUx<PUSxxIqnu}in}fvZdCb<fz5WounuPCo`w~5vuNsHA*mQcJ=$uh@=O8csJ@)~
zCvBlVp7d=q+|=@5(z*8Ylstl8^xZeOl&C|6_QJPJ!85nN)EzHz4O<b3!NBxgujbk(
zxmAX<XzaDICUkHG7oUE#WTqNoT9;?ZVEFcoU(Fiyj(tqhO<D@jJLP<loZmUjQKYjh
z^|8!;$KJZ+@Cw_OYK+-!#9BLy#bwHH#(a_{4(k0Vbxdbcnlm{6)}cdauhK91w|c3i
zc(=dm+((<OdCR}$C60@Eg}>wlkyyQ<AK8bp&y6^1`>en`!9W+w!dKGuwIx4WAFR}T
zrKfs1@nGSa6gvxZkvo5f35PW&?uFcbCtYty3zO~$w=dC6!~vrFI>#g|?Mq>Buso8x
zubE{~5>jXoj<q=PBL&}$oZ`j^!OCSzW#rJnQYs@VKeo;<5~c<=7V=t!NwGU9uNVi+
ze#q8$k_u41qa!+wemDx@P;P8qPz@^koouNxMW|VZq~<99DjV}fLe?(t6qnLk$D_#j
zPN}FFE8Ot3g406BGO@`GrGvU)(F5OX<VB@Xg|UcACW#j!=z*UR`z9-7PWG@B-hWsU
zv8CHZ*Zo3LGg-VTRrwY0C4}Ijo#O0@Scz3)%?(u|V{TZamTRh<z&GUjo3WPkLbEsL
zWEh<0sg8o9xURhm)&Gh`^XGn+#DAHOtJhzojpgxQ;QP~hBL2&hoyWU>#eexTK6d;U
z9Psi7uU>sptyOCn_~q%NTK!S|saM<C+ph1`AEyJqbbJa5b{!4k)xy5~EgViT!4kCA
zy*4ph=$8|Xg%3F#c?GfberlYbQ2LgT<E0pTR4<wh*m#J7s{|8}#%AP%UWR&Cvta5K
zPR|cp=U(TyfLNd|9Ff41#Jf7jUE0{o{Qac$ll}8`Q@$LZ9=7Cb>)*@7K`ER2TvGvd
zjrq0rZU|2|Fq%D_ewk@QmB!(rRKB=;sUTjq<=f%WkERv*c6R!ce7ih3mT&FWiTc*j
zkK{}9^rYEPPn(Ulf_<{KmThAdP9(zPf`Zt7gu)m56q`o|<_dc<9~ZC6!Mq%lFhAN{
zC#3Yg<3D@euh0&?s=VL;<KKA2+T!{1Vo)Oce<=pjphG8wF_a~Hwc-_2nU7I+dlS3`
zSzos-4Uf3tHHFCQ;t0-dRJ%l5)KT}a(P?C;*r_pfa}Kio{<@S$Q%xz~`H{s3gP2$B
z@E%V#njn(^Mc7^wzFtU3yFg^k`@!|@U>;|S(5i6s$%&IRY7QzS^%4e@c*NbQfd~>6
zj@SPZ{*RmU7uf;s;s5p8ZZiJYlP6E=fARl6<74xG9&p+Lc30m48W{(LIq7%9DP<p{
z=n4@o#F&m5BDFqrzd-2rjv>Eu_Y74KjnbP+Ql6C7ihW=tMKWZSi15uOzb#>2kYDo`
zW2z#r;L>Ih;G&YQ<hI&g+G_jrTJ<)acCGb)hU6w5^h!<y^Q1ek%`OBDQ$Z0c%Ry;^
zI|njF;gQQBwLcZo<rMm8;Ls^=Nf+$m82d7#eA&C0zdsu2Pz`Bz`KpW9rf|K#+He*G
z8AL9tffz2SmqQ>;$^MeMnY|QJEIwrHPP{o%eb}2uQQsetMSqcBD|BI9mBmvHN_1Ij
zc)%WoRi}t}VypS<^FQ#jWd9$9<8U5-0SVxq{eO4&aVq|2edozv`~RQuvG;#9;1vGz
z$+xSE0Bx#B+RL!-(N16H(D!KZz@{?qC}`wpM8~oU%rrD_!GM;uVN$N+he`yDuPqbk
zCw6dA)vZJ*QK&;<Lo;H6>hmFS(95Hf&Q2W=0C{@8Q{PX%K5iZ3%W*JHzM?nsf^_r9
zfn&6?9-#6v9;0pe#Gfx_{wVf}<aO!Ky?0n_gA7@eKNvb`nn-kHZKPUqBH<w-7~Or}
z5`Zv|$;Husv^r}h+tYumZ`-9xz2uf{V~^G_9s{C|W#yZcbu-DGbi5+`(}f=xp~kav
z*0E|9V|q?#Qz%yI9KYNj2J<`Wgcy-oK^CF7*fpaRDb6HVhK}|jXNJ4>(a+?{izcJH
zeI0~=Q!kLujl?Ff>x+rTbu=2#tD9>Ka;n-QT<x54N0a#(zAH{kc(m12#zZNaG*c42
zaAYae10WnsXyaBS@JCRKf+biZ#?$7ab>3~Xk6xb~w}5;duid?bT2z6p>r{A5B%t?h
z5u?ALj=f+gwm}X@r0YG=(E{D38cj)~IqEL_K9`a<wCAsOPm9GPxN;q#JHP-<x2}{0
zT{xtb2W@eAGa2X#wj10|i+wz<uN6(9VjoWIs0q-8{b|T1BY3=r!d6*4)&GqwuFSHw
zApvA|=-n>mw;g0OMXiKg_)R~xaAFwB<p~VRp{~h4i?=1!B77~a<+-A!prPDuFhn69
zbr!c%1P4<Hzm;??yBsaxVpv+EO0u9aMUO>5DhHC8RZI<kR!N-4sw5pHsED@Vq{)k;
z{vn*9TWV$O_ph-s^6c57ubH!o_2y3u+aZNlQHAg<dAlCsi|j1G*@JP^NY6Biru}FT
z03$BhDmcYf$%|atQtVP^mDG;vzUSQ3yEz~)I*sNJYxT$5sygf|Iw>W^bkos~<tC`8
zIyA*361dXpC7I_mhQ~)I7oGD?<0bM>)0F*mZKrO=KC4k_uqXK=4RG>DIy!lI`RY~c
z+zC~!pE|(xzPCU}V3@)7`oITh+=CyPu4q)^lvzwnDO1MGK?6VR@~t}EG}|zo7plGA
z9pL*mKKmbS;&7(W{wyMog=jLLMI(=PU&Z=KV7SJ(yD)|D-fbd-4~>rSJc7dx)5p`;
ze&0Ahq=E0WE;<)x+DDTC!lBv(%Ua0PX=E|WOWzvO{GUC?<jeoZ{`&y!_dmal<??@R
zcl&8d{@>nx`j`CwXMFw!3zEl~m{o5Pj>w4_*zEe>JY?b3>LcWLjdt6_eit#`-5+#u
zHFM|)0MiLp7l_(ad$^df;XIH%8i)Vn^$b-H4!q{~jg!|cuk(G&yJ&SfM<=f@yqB%^
z=}%tg)VsJm>Uh7LUY>iclOK=HPf2RZa~42=zhL0}Dd33#iK}$1IBPdL7lg(%isKMB
z05)c*uH&l%3}FglN3;3efp^vKuQw_A>48@{t$UT9P*(r9;_)y1w6xwhKLByeoAnp#
z=Z%y0(aQsLB_4&n_48x+I`%5Vb$E*PM`NmqzhKu@AP(SL`_O#FvO<d1$)R`p%0n4Z
z)1vB~oO&m%)*+HZXw^9RrSm;{XbYXbKf3VRM<*@MA_estPz`TkJmS#n#c-UM1p)q5
z5o1Q-WO0kEIf`#_2fMmK5<!hP8u_y@CiP;saj*v6!$Xq4-aI{Tbx+{|$WztG8{yWD
ze@R@VFA@E_7*Fvpsg~jI75zI3Zt)L@(D3Ki^);opjf{{0U#D<Z3TF6?4D0y|WqW{c
z#IWcK!XO}viE8ZwJ{$crL=>P3Y`yShI7OMc8sVTY=A7;!GKnt`;hua6Bl$A+=hyNz
ziscKoPT#Oy&gMh!{eh|tCtCcA7Ae2Q(L}!UYEdu7@fCXB2pD+M!%9r+&H+B5uc!1?
zUNq%RpMUT>Bq}*NVIf$k@E9f>4^aueQIF{hf|D;$xkQCK2lA$&iga|54i{;dBJ1ng
zr{Uj<IJe*lERDUje=8C&_!+4mr}$3&z^V$!UIu#WSneEt|2^a7+TXlGU_fF61S?TY
zV3EzlSd*6^)>f@_s1>`%hyoOCHcMV5;&${3Oj1XP!7El1W6zLoWsuEmn0>T(-XqkH
z@i7z6GlXLm36%Id!-szbY~}da8*NtmGUomD^`L(pVM+Y!6>wC%12sGa{k++vrvS`)
zMlks~gE#LQ=ky!~#XMs=({mxY_3oITA6w59v!gefdD`!VT2esK&M5&DQ?HSDn6-ru
zz>_eT^x@o%VWTB!{4~N_C&T)IcOhH1sDtMeJTpe9?e}%TJ<}w}v`jo|3pgi@({ba6
zR*5EGvw2Xs9rX*IF!BQJ5QjL#z_Pn%rx!;*TfYz6r)RB`f+sw_P#FzI^y^Sn@6F~T
zuhN4vAv)hdlfbAGZR%Zv;Wkb#j@H+KhvyY5JOH1cM&(Kinw4!~1(2}GT>hMd02>{i
z4Mynovc4{ROCGTGb=q{6_fj{NZfP*GnuD*`A!g^jgKv}m0yd5qP~Z*i!A)4b_#1^p
zAk`CyJI8+CJH7CJ_G;VJoyz*(?t^>WXr5mD40zy<YN1i!-4r<Y<63n9BhF7c_@o-#
z1_j&@VEG*gXNlo#0w?WCR8R}>0C&QvSE<n7%3^|?F&J>g1ST&pkJ^Xb#s!RfyP($7
zLBU#k2bH+sN!u=#O-8EESgCL8>m(iAPgt6H>+2##e2J-wO9z+#C?vBRUiYLm9YkaR
zE)E5>F?dDHg+ylI&>jl9F~<*yF}sUbJ^TLj<d@Pq|K0Og!sB(XJomf^P0Gp3oEfr5
zEP^FP*pxsdJMDOft#+%^f+<bX(4I$s`>eCJBw%_Bf7CU#QMoI@>6&hWMc}z+lPs2G
zu328XCdukrUDlICb*%-XYb6*791)4GNhG>n*CG#M$X~ONlr&iDMlQ0GgXLGiXHt{J
z!99@+GwRUuYZe8wDMB4^d#*J|S~#=_mn0gKiO55sgfQz$#M@KC-fBG(!FEqI_^{EH
z?h+!><<IRJ!BVrpj6cr@H49|iQ5fH&dKqY^TgmDHwVW{~S+g;-Ga5yEG}2R)W%xZg
zI%J@mg`7*D3@lYE>v9rN)-D<FRadgw;qEca+=aSMr<^@1{il#SwfNWN{IMqokqj(k
zUfZi(PCR?+?6casptIZ_&+4q+MxQ)pvQ9E)kUPoO%@J+S9M@LEo{pe<+~lW@70>4!
zM!l{Ng?svZxEgBeOuVNX{Uq|{Vwa>QFF$?$-ZRU%@2qIkgp16&Iv($-gYs(qRLA^1
zJ=FiY?P3+4x~|j_dkV%MGI5fNTza0d)|FCZPruDTNUbS7cm|*Rnc`AlU28hHrPYU6
zlr?(_=|6~IiD6Ponmw(rSrJ=i3G+;ja6cy#)Ckv{rKV9twGLTDuZS9{diGcjUs@xV
zFWfI)>iy5Go&^4mXt}QSZhQLS!^W3|B6sIox*(F|G^l*wq5JUZ%=}a3oU{Ng43)Hy
zdkifDDbui?D=Fj>D6NaCZ%^revbwgyyv<!rR<|^1;jB}{(@!+?lzPAPfAK!-|7)Km
z_J1roet|ab^Z(jO-Tys#^0fBX{okMQvF-nOz&ZK%0~`R3IQ)@Z<{^jRa9&}+8d=)j
zR?G>mO$`v22Pg2>xw<oxdgponb2Z!fpS_Z`vn#vW6AGt|L+!t+ir^iNj?71TyvEB^
zAuFaE7CAail?WsA`t&08I*QHfi_UrKy&d<BY)BfN?^A{FaAb-crqQI0Bq!dR<qoV2
z(c9$ji`2`H9k1!UiSF<Rirnb*OF6suak^Aq;Lb{4P2TQNR&W4a*a{Srh%}2ObSQi`
zihNClwE6g#pD}%w@PE0G{QMo@9{Z2_<66r8qxR%4`;R~6!~7qO>RyKPQ@l~|d=G{l
z16Z&NZLFd*(sIR;kE^vukE``6*1Vq2r+becL5*lyg(>qJ>YZj+kKi4LcvS4Z*ev08
z@~l#a5%-S6_kni?i?Zr9Fg`XGG3L%yseKmA#$imhVPWi{m2dCPyPElvc`zuG5d)>|
zyvA#QGMQyg?mWOd#%-uK_d~SKL_io7W_qU`gyU#9zwu{mpyJ1I)DL~k?lOq_WL?V}
znOq@AzMH~@R4SCHsX^e6l>4lDMYfO_RvwcQ&O%A{!F!QlqDqhy&h1d99VP%~9*Bc7
zVO#db(I6b+-+=lzUBDqWzAhseShUbUZ-IuPF+T4H6RZdwdW1HI0T2~{;1(PW9UR#(
ze;y%}DbjZ?6r<K}uA{NrCA7F+%qGxqFra=%Kt5`eF5npu))+>kQFKEo)1%3N4f^+F
zAUp8h?_uzxzMc>h-v0?39F(aUY<U%5`xJo#A;^Y4p!76W=VpirUguB*#%Uxb%!y8`
z2}QO=r>{CcHO^b!(S>(*e){9lVe8N<G%nyb?E60*b-q8n?4YyxdE=z>3!33HPJZ!z
zI665b%C~+#J8xZFc&F#y(eYXPsC8KOj!v5G%R{omfvR{R)IK^s>aeK}wkgn#T2Sv5
zLOE`oqX`d43P<gu&M#%})lugJ!M*~x4ezXR-Z^Sswj1Z(+2#4!=>?kl90KH%qmx${
z7rlk%PqYA!PS7r>^&^@?U3`yLTG(LY61s6tST;}3emOsS{e8##{<MAAI!B`_zz-9F
zaBC;O&`NDLj*iRTVdJ>*x<wUF0nj;>6dZs0zD19q$p-vK>28od&C`?4c?0uaB8gAW
zJG%ByN0{KUaej1x#Cdgo3N0XYq0%YAfvP7h285JH+(}YYV+5tJJC_$NgVA9N<PbCt
zgZlP>szH9^0qs3m5_^h6-Q3(%QCNwi#jGC?kCGzsBUl6#`B9x-PrbKJG+DYsJ?fmE
zspvUtg<5sHS}&}p#M6{?nk|Tm8GZNoqKPokZ20)%$0n||c)q|m-pmy!wm=_K1p)WP
zg@O@LG1VePL~VZi?FLpDpc3G^YMcFc#ipA6?auep&LXPB;+`T;cB#mdT`VF-v$huv
zwf#aH$|@iN)w_UQCAMIz=a>B4Y82PKiU=is43m9DDWosEFmw-3FJb0FL4}srQ;2yC
zmLCv4A8}U$XdD@<Nj?*E<3xeUBY^)Q5=1^Z9|#mEmf^P=4sJ{9h$ut$dX#X)G#n1?
z5KV}+_uPBDUB>`9lj=l=5j2@a5u)jWDI{qh(gmq&*bvXYK`}+1k^;1K;5~Wz`0>uS
z-|p_#wn4ty-K|Q{`1*f7u5ZCVHOsN%;-|*hS?kac83pztb*@wdfIaWU3vZ`xqiYJ_
zdxKsu%0}?$q(j-QGhVe%PhQhI<qe%vMwiQZzZxJaBr)g2vzq&X2AJ}|Oh$=9hu!6V
zT48~0B3&p_O!o6>@Cwe69kfBGSc!#(w=o<={(Qrp{N$5?9#4~gG@in|L~~X0wV>Tn
zWU_)<lLG2;@_vG`swM_VS#kqd?QhDdo0WqFdrIZaU8GWvBgUF=itg03j%}Q=LdAQ9
zml%4A<Cx3oOPbVypL!Jd=@I5L<lpwXRBZO;d8<?Gm8@WZ8UcH#WDuZaY2S+fXNMvL
z@R*|@oF|X1(gv=5$%gPTS+57;Np`jWcIz3uk2>Acvm$#|N7Gq}CZ+|J65c0461Uk`
ztOX~YhQ2Q|n-0)nDyfr)`H*Vxr&1|FO=wZq#ne@bj33tpG3piUFJ<qWgOc+Qv!wo4
z;@K@e{Lcf+Yp@qzkBU9a#pU5FdHx)}*)M0-%NH-)m%e$a7EiLwEHcm)c<;XiSaGLb
znUqRS@mZp{l+kr2R&ngv#rHBc!^vtx!_?0n8Gbskp4Lm=H{MQ72tS-Kc8dPcIFfY~
zUx&kanP^$EU(C#lne)OoZ+!O+5UfmOOFW&?Qz)C7((#Qyb$dyBTxJgy*C$fecZsb0
z;~92z`*t|o-d0b|Zy1MXG6e7y>LDPRin#VutMfXzeE>=qn(V@xqKTyI@V@h&d3&Ck
zU3yUV*WL7n(B2@tLMR7b0S>7<yN{ndefF*2>%&wjP-!gJTMXYkd#mF7hAN8hM56c-
z3YE#emjkZxvU%8gRoJKKxLlD4ht-~Gr5LVh^wcW>ph^XnGv#_g@YsBas!9$24N|%G
z`0c)jgK*&O?(5Lu6ok-d#-MK5Q=Y$*bo5t8Kgzc1Mtz5al8BOuk-Xt?p}eN~smIDg
zuYg=qUf@^r9QcfSjv}poj!8?_gz1>4x90J!^_*9Wyx|}E-OPSBbKm*SOF!`zR*b3^
zjjX3L{nWw?myALUzw0+Nb2UxiyLw|Zs-BM4dcm?b9f>Q14Q4Ndoqs&#7+uO=o`eWI
zBzw(g-#!A_pH6=-7jrr(3@~0+e~#`BKveXfBlQNRK^zA-rcMK>bhwE&Vs^b&EqTqe
z%eV?>br3Il0UR+xbfF<H^nWZuG(bfS3?~N;V1kf0(7b9pO}}g$b}t&|YimVf?3HJ<
z{=Pa;i;w)r^TJ9dH)DIb+fg;MH~re~&eMAB>66Eg+nPnGwO%m+&wGRo3u{&t6cz<}
z6>9q|n4wuXhS;XTK&8sCf<4z6q-^dnj<0Z`BRMg<CyQ#1@MZ+ACFdG-H2mr4WT#Gz
zXvs@q{iL@2q*i~r^Q5i9>r2~cs(iR}*gS7FI<4-jv&$~3Dq811wiug37{vbk=fb{`
zzB0fA=%>3oyU(5_!IO2Z(>?dNkcO)$>cYvMmAEs#4<-ezv$qolAY)NlNIeXaN7XBS
z9hVAagsx=EC35U26?c~ynBi{L*@ntaf*WX=xTjOZ6<=%rTjQ24)Bnre|7W*x-~I37
zRQ%7U_1(YXzx^p6`~FuAINbp6JYD?;m{M*}fw?H|fVTww>&4{#LqobS3U){r{Ukfi
zoAr>4SPHbO5<(G0h5#h?InutdPJ$*A;nFq{naeJhu<kN9F-^#S9Gz}@|55gi*@u6V
zeEID_=$k6`I0r3wAHYtDiMf|ItS(V6yVsJ_o?%@JAVMY8i7ZI6jb3)Mu(yJHZK^oz
zKg}>QwRck{B%mpO?w2Le&Mcf#lt>-wqu=eXQ;G+CpTtL*Am#LoD;1MC@WE;{GMp4!
zpvW#vif9Pzc0!j<bPH3d==d*k17+(4$WcWpXV<oGAJ-lLkK)G;hhZNt5OBx$=PB5)
zPS1}U9RN*mDYOGX%z>S({C%r|YIlqku~w`94+|!+JpS{Su>QH1|L@eEq~kyT#sB}D
zPa^(vpQ3+0`vc=YJJ$znGx@@@`<aguRzK(oe2>{r=58RCkcns9pz~1dHQi@pHW*sJ
zKdP{tg(=ssNlA)dRhry_QGVh%u%I(G7F6=bf--PPR^wnRT#Z6ZQUQ$nSYVr+rLleq
zG3QL5>Ig*-rr^ue5jyy&NZIO?Q^1R$0Ul}bE6Bt0OTE167fcER`WF1dy!8hIei$!$
zQf@KgFN5%du4yVvqZ@v@n2h<$D458Xxq4uVbB-c@PN^&L2;gXESfO&Tz3+w3F%~xb
zH8w`Ci)|Btn)E6_mkaErWL2<f6uvbkMHk&+cw0<V*Qq8xP;y90+=?3v9L#9C*omlk
z<s}lCQ)oCkTXCG60!O_r?0M029*$w-;aG5fFDB3DXh_%Z_9A?={slr?TlQND4%8>&
ze9u`MXGH}i(6&}1D~uPu^qwDZsC0e&p3lP=Gx*HMI;GVlvhde=tQfe8CjMUsR%9%U
zD=ty5Ioq?}zZM@|)PW>Yx1qYl$pxoUg^f8?%x4AewjywI7<s1ecy8y@oKxELj7*vx
zG!$&9RGQ;CD)l%ONd%KhX93AbAZ|clh!Bi_?m$_r1|^Y(oT~DK9?#z>tluV5i5H>R
zcg{Q*!}M|10TJYFiQ~PWc454kLzn)y9+LkLf0oF9S6?Rj`@QlXDzj4ZU;VHAAAicn
zmjA9)^!M81)dj%UoR=J=KHBY~*#l4fS58p(tEC~`8QC)xyop3SZR?eRh&hP8ZeC1%
z*j(WRXFpO|3)gD)<M<|kg+Tk^T0Qk*ZO48Df6??kSliY3Q4Bkj;^2hK_t>+r|30?S
zK|{wmyo!sr<uQh(yDfR&@E&IZKK^%cY~O39Yrw9EMRW;NiY9@&CE)GYkKY%2@VfT=
zIo^=l@9O-rR_@iIfG%9aYdig`Zq*re87pWJKpG6KhDxbUb77kVnZ>0yT-xedW?_I;
zm-m9c1-)o@&BG2PkV;f_P+L|Ru}ajn5zVTqXGz<?Lpx9kx(0Iub@#A9-i`g)`(Uu)
zQGPHqpQN|jUd2lKd2=0N%1p8l*)FLvwcIi_U8e4o>5csUd-ZAuULi8-__2pUc0nW!
z&=8jA_#j!9c8!=zVp=xueQ+16Lc4i|IOduv_SiuQWNOst$JfzfG@!^Gy+8@l!9e%p
ziBqW%FQ#y~Qk5|%FmVJcJ!HvsFZt>FqfTr4<x$7t2lT9l&kQqo*={s{z(<A+ygE8*
zw2%Iyb%>7*EBK-H%TKMw5AMSs8|}-Mdc13a_?fFe){idqvnMV>@aSSq&m)a@*`RAj
zWDa8*cU<}OF%uLXRbE{6ud6)4%3d}o1BfPv0|*ym3XGzVUG-|_-%+&9uPiWVHDu7U
zj7KOuI6uFFI#-n!{l#ns5+qOI|1@;4+ZbSO(5vzXis|X#1U%0H3BN4}R?J|`9;NVE
zOZLqB&x5Rnv1@hJr!~#~mXJkPg=ug4zg7%mnbwr(j|rsSU-emlzjacIz~<TPYC<J~
z17jK`hi-1KT_9u-_PSZrwk#R(PodypSE8=!#NO@73;IqP(2CdkxpR)*NYGcxDlK+N
zc+isrK{WSA91i$}I$OMM;*yLp4tGfc-!;4OJYdVEk4ap6{%jV~RoxUu8_l8sx<$(m
zLOC83U<&oCeuRO!OP+=<Fopoc6eueye<*RgS<Pbd<M{*HooBV%W9rQ_nt^(D2P3Y`
zjj5ItY&=2cbrmWt>#7A}84lcAMgrsdJ_HTwd48|W<p7(XaM3uJ`ZJKf7P#YNWr^`e
z*;!Ybr0aRz>>Mvi3u6kSs|b1xtWp-I;%Yz_Bal~DDmn@$?~~no-8|(TY?CsB(?a&<
z*{Qr3!UGb%n2KsbEN$NWxCaalY7&wtJ?4L9eEDDaS#tiTXaHZLjr;PyJ*_`Up8p@$
z{<{D9Q$F_jp9Y*S|7#C%|DFST@%xni;y4&%5XNJF;!E0%2dDy|eOnj6Kivx>owdc%
z5U79_g{)g56|%o|+&Vu$zIeSxW=z2(T3lUwW5TxJiX6vE>iGb>SFapR$`ed{2|H|&
zleqB)1~S*Av;{}w=LaUk$|KBj;eAJH>8)C3q6oEB>t?!S$=1UZ8PTM)2@nYMCV|>B
z#phAf3$H*(Dkadx%?)}&CQ4;5F6BXwOJ&bWnxX4b#Zn$p;t8>d$L;L;urq+X&#h0&
z-n_&YBn}-J)`Svr3&eS<BV#H~GD8{}HlBp)RMDx&mo-p{g<{yn$_ap0o9VhANLvJ@
zCIExzod9F^L!&Wqfx1wyW|0B=p)9%Xusq0DG+%j2SxM7igD!G8m{r~jHq$M+g(z)9
z=^%j~Hs&vGyVTS-T(7Kg)6J!jRNYc|dLPOllTQ>Ga$2*A@uBQdjRY~=bcD13Hl6WI
zN)TM6hdCq4N<IX@L@%fN5BmrtB1lTA*|ZkbeKOppL+7Q~qtLp!65<wiT^x7GxksaQ
zUtRk)m#ie&_)#0vtj_=Q_kRhT{sl}x?(zTMc?$26`5&JArT_m^K4{KF0}TiG3nx>}
zELzNgSH$byCj4i6^7qk`zqZYu{IJ*0-g{?@(J-0~yyvI@`TP63Nl@)a<Ep=SA=ST(
zE5G;ouKeDYapm{Ej4QwQMO^v4FXhVbEpz4Pf&5HYe(&>L`2~;9bmjNHh%3MM#a#Kl
zFXYPaeIZwV?@PGyd!Ove@A1jN_B4-DDICe4KJg3~Nb;GnGSlY++1&7mAO=#jix0w}
zXz#5<v~8$XtL%&7c^~{P1s;b+V7HYgxPi=z@Cf+WcrF$~ABJT5IxGT8utU?UGS*Y?
z{Vwd)Me`t8zVPb=eP!7g<~E!c$%*Bon0zt*Wb{>(?<jYO3=vEe!er755{3XmDHGn}
znPt1Ag$&Z>9(Wg>^Ou*ex`(Y-jmvh24m6CKc67E1Ba|)lF;ySfNPgY+=D6}FJ_wXF
zfK;LK0=Jg~ZHYsV1PtRQ&j9At{MtiTH}wbxY{t$>Dg0oip3~aVg$H*Ne+)xu15g@l
z=OIP8;wLVOa$pdNQBmwGes2hd)1+{^pwx_VhEzi(gTZMayOYIeRE$gFT&IVLzu~bZ
zF<e#|1<%DQ8tUOLIT$_!Ii59TYFOUD=p736L>w^b*1SiwL+YPmU*!<ICUC?^C{E4P
zIKV7~GMMQpt6wQfJVM2S8v7UC_MYdpK^kHIOB7E~8i&b(+GFmzUE#S`sqLYPBANue
zouq52evppaOf&Rw|F8e@oF}mKT=KrWe7y(F;dQ`3CHT`d47uI;tH19%?yi)-g1HY)
zOJpbW*rt$P%NVFYCa<z3%j6tfxA^twwxsgr#e3e@0~&EyVf-DZ6Mh3elRj@0N73Y}
z1cPHOp|V+{WwnH54t^Bp{iC6o!g$}y7r4MGWTpV1J2kUV?vui#g(zW$R@^c0#uv(9
zj$DudC6WP30U=sY+H;t4HQKX`0A-NQp=`-whO)A4Y7z*3yl=Q(nu&dM28H`qN`T>&
z&wGi5A{;v<USE18Y+CGqE5duhII|l$9EaX9&Wya_7Sw`56x-u6JhU!x^7~~kcY^M^
zaKi}p7b6&DWOH4dD);VFv)~_eaQ2|ay?a*XGQ{r6CW1bzAh`#Fg2m!moSawZ3!X(F
zBBPB08rMdc1(%$2)h1>!JHgG`_%zTXmQT@cg66z#8Aa^)dWKg&Sb#ZD8KrIz)Pq~U
zKZnI&F(I`pzEG{1-U^-NxwI{0;=wZ;selSCX1HxnaHNC97@?vh_f-XMt}%CCQGtJ+
zM#pY_6WF8OoGcEuwRKt*{+({nbfl<T-Ez4n-Y&yFWIuz&?`1UXOiVqK*x*`C0GTSl
zZ(zhG1I$#YxVTIozOzOq2%E#zB%*gXIgml=*<wwUQZ>no;NZB*tam57Aw|{#a<*)H
zJHT)s57-hE>-P>`tg-<(tFq+K*+_D_AM%)4kL(@7P?Oun1B5Gqs`jF-t(1h}Pcc1D
zCSSEhdU)Xo$5X!#oeLE+#h<vMgsG0F^Sdt33B&btgof>XEchmT>$nu?!68`B-I1Y2
z+zDdstH@cbU1t@HR5=+CL;W`z>RYakc-m$7B~sF9t5R|IbeFtvjDc-e?6b(yN_#C_
z182m<&{GUj(2Ew60iE_^k3$lv1kBN5K3&XZy`@%-)lAmPamRA$@l1^{6heAs?v^e!
zo#mBxuoG}V(hu=OEi<0(Teg5i$Synd=@p<LKF{9YE+=%q&KZ*_ewmJ>L~NDfH7J8Q
zay+>vB37&R5lqdm14ECT;e~lQpWU%I<__-s+S)rO5sxd5u{Gom9%gAScfCGjjLRN?
zGEepBrZ($gI71NgITj&pBjH041)zOinbxk2?`IK=Ht^%oojPxjz6&GsU7?|&Y-q$B
z@F}r}eJtRzhP;U-7&aIaY#UgrIHaO9AsdvnZ=#E<%pLJ#l~ERznbc6>J23mas4qRz
zgsRUbAPF5;Tb$j5CgBPk2$3HQyc+EAl$24;6n_*)!p0~-NyH+U**&G*s@?Fa%gi9S
zg~6Q@3od)nr54_S0pkie>?}iFySQvNQLAU+NDfUf(l6|V>n>h1AgO_514JXATHGmn
zXApE#8*uK@{t)i@p%=g+ygAtQ=JCPq9_iI={eS-bkL1h!0u~_m#eaae>HOb+#sB|P
zK94x~bMyaQoSt|Tg%IcFG@>&c?Kh;xSC>Jwr98s8LwrZ1A_F-KdxV!b@!asADO%L4
zyBJstJ{*D;=yfZ){5Hs%Sb?8%OabKw`E|9ndxdPIUZWiWj!l3QiRL()y-Kb6^xLOT
zzTK(q>^^%^-vDqxkG~1FcDA3955A|&t<RdLCqH&ycV8WMx-TzZp<)wO&Q4tiIlxSl
zM<<=u`AMVQ<>FcT8D0^hdN6vbLrOe(ja{vf#zRvDu=ps^WP)2jdy)aiL_m-tw4ZT_
zE0TjKDnwa`Ly{0wlEOkUDGvmnM*~ZPy;<fzn-WrD6^`)N=l@HeCH8+h4bbPdanJq#
z(<dqWzo(cI<}d#LCwy%CKRw`_0;c`|FThi-s#64f2xs$!k2!byz!-xE8UhL;wlSc2
zlx_Nl?Cs#oeSo+B6rer9VjOUK;c&tM5$R4EZ_{<0Y(9>~u$fUV1E(Mb>V|U^qpyq%
z`1tVzU74ubkzIwgQXhiEO*}b-VG8AUjSX+ldq$Pv*Gv5Mt@_n;e!aZKpEWM)6|pRy
zS+LYRx(ZN2FF~=G%Sm@$-lAmLP(O9BYzhP@J2_w8!*L>rWABH3p%BQcbZjAdtb6R}
zrH&?=T>KOy{{>X7dOu(Rr441Tt=n+C7<0LGPY#s66}G#G5eV@~1<EGz>fNDr9(Hq!
z->!Sf_w`M9Q!1mPvwuzIDE?^Zw5<-Y{b&Xir)UI$HXo)F3YY5o7o2qDq80%8U^yM*
zboo7Oylldb-*|b8|H3$Z<ikkMk4ZMs)5Z#1q}@>Q2#a*UT-{3Yl6k1mkDcg^C>V8{
zYir-SPhO^<+^($^xip+h_)*C%(pX!2w(dSUJzHCQVxFCyUeKd$=Lys+@*4&D^sMBR
zXiABOD$sD>zm)eHwPxZyAW!c#rI?GzML>!^o8Ap6LC_)-$G$`o8Zf`HKMAL#qV>j6
zZ02WNW-nlzL3iGGfsqPBWFQ`y6{1HL2%D9ftV;NTEhBL9QpD(mLS^rHqKdI+Zv5Oh
ze~m@tQ$&AWsaC@K%0$W7Dyl2Lcu_0qLn}-x<^-rt;#rQ^aCq^&X3_E)Fk8}^E+JBG
zvS=gSgGN>dUS{+(t6Vc(u1V!c0OsuQz`#B9r{ojHyUB(pg8?f@ua<Yy4Lg+AapU5L
zT5(dIqOah8<9`;{E^U{dKcAG~pJ{1nJKHO@vn}oXw`sJbCab$EP?Q+7ryETZQ_|js
zoOBkiTNui_d3x9?hR_C?_nuChFzw4gv#|8y1+PDJoaFXp8J4$g>*)&%OgTcLgeAJc
zfxq8yCsaLwhhF4pT`gwx7Wv9v1f-K<-?)vc%C`A3bb+Rh=|G4vYz+2|1oDj(?oz+J
z$j7`<W>CxUUI^X|2W?$51L>E!NWV-V{W242sE-cuc}Tx3GpJ=q_XO#e4$``22GY%3
zq?-w(o0&*Amm}RQGpJRNZaPTonpu>-%_sG3lGeA`#J;_U+P7r^w-UW?U4om+8Q8~y
zzTKIMVXrAvV}+|h9cq*b8!fgl8G5BH3y|#{ETMxz>L^BKzuYVLOZP2T>h;=xc^RdA
zy*QQ>GLvyhp}rpcQU<cOjO?F)Yu}7yNsAB1%!7gba?Z5CI|rc_cDsJSocGZto5gaJ
zhH>Ddl#e<ZABEX%d7^?6mz<0jN1gK@U{=*AjR8*^cC}`(s5QH}CQ06i+rEKrfjYYQ
z0Ugg(To8iHP%w@Y?JE@6P2C=3!Z<l>{rp35Mk``6FTpne_1_AXwG~rIK)p!s2xZ<F
zNxU+^xk(?9hGN_WtHJXh8jLmvJkeMS=|i#oP_*M?!4S7t5Vz!vWPv+5?Vh(@udONB
zLjyWT@D&XQAN>HMPY=yd0ZjdaG$s^~;v5k~Gcgd{n8--K2>}p-A%7r)2yAEF64I~W
zXyO$(;@;_50YThF3%MJR$Z>cg;EANNCD9q-cK}iOBA<1P+O@U@@@u>XXYBqgBm;-_
zF9W?&0n|^=y2qzKw#tt-*Bai-weupZv%Lc#$4i)z@ZlnuUiAklbE^v>9beui%e_23
zZA($Fsmm5$M$xGBa-Z&IU~iiCx3-*WCr9lh64h!|;evlB;Yim2=6iYeV<T0CoURwa
zo0o3|DJlHAefm<DHa&RV8@-WUyj`<_QvkShFA$YCFs+&;8~#NKz73b_HA)8lMFM$)
zbY|HMTo8ws0vfTgkU44nl!N^5AK7;e_RE)Lr_M#I{mLni?vv8peJ``~QnPV*m_a2(
z4i0%XYS_x<%e=CcWZC1(j5)+*H<M)#kABQ6`zQtXG#B5mlV#6Nf66QSpUJY9C&$UD
zSV^p*lhaPJ2;NDkQnC_SC&@zQrqU{kWt*ob%|<7ClETWV(*MsHO{wz#j?b_>NEd6c
z01xo51+ew+1{k?La%T@@l9jywKJXgCLwWrQ(w)qD&%K;_o@ct7T{EvmsfkrPtqW<E
zsv;?iM1kiAFTAFMB~<ZL6<AMhljq!^sbiCo_XdK3Fo^1nc4BIh6@*vDWz($GOKJ@l
zc^z4AUsf>v6!*N-IBL6~#4>J4RYkRP;2-CDo>=vq3K%IY4g#c1P*PNTb$Z@DJw4;P
zv2enz1FV60cYs#mkSXx|JL(2<0wT-rp3E3x2wOX)11k2BQ3AMU=dA?Xih}D|lT8hu
zg9$U89lHbdt!A2(3=aUN%;K!8e+Gq92X+iSrcm!d-nfIxOtyV=kyuJ^icKK;=Bu+;
zTcKjiTOhcDqzLmf#D8AurPw~bkg2@ZA4LEj{ii<ovyftJDfKdi=<yb$5h%VmC{gE_
zfC%C8yp`Ia5ZYoE6n{87Kkb~pd3pP`oE+*&Ne}OjjdKv6ECy2ctf|C5a4MnohCc(j
zg2v;c$7+Us>%ehxc`RCl3;U#|+bEGm-1;A&-amo)icW1_akJzdO+2;cIB^O20mzhu
zA0B2m_L@qUZEVtcRm3RYDjP~vxr*u3_MQUEkYW_H-vKPtzf*QkH1$}F=36yPt0Mp=
z!7Zg<o;V8LqDIgxP0viKk~jA6NKHxbtLskBn3x%T!wP<%u4+uDc+6t#iJ%0CBMH3X
z2=g|Fnp&*bYBIz`n+nHNo5D$WeiF8BMYT+_M}jIS>mHKw>=Hz~cNX0?_<jKT*Ho>%
zie{9@29^!_N|y1iV;c0sA$lR+-~mE=J&K(Y+A^?#o!{>V)48->ghm4NTO9hZ)J^~K
z7U*64KAgrIUJ)5U$+<})9POc{BinC_@$`#dCh#ExRgkRSwp&GmwqQ1gPFKmPQ*IE#
zSVbL-y>0ZOfnmqU-uhv^va<(64l~4kzFT>`2P2et?mgLaTE&^9PiqZT=;@xEoue63
z18ELN9?#PkB8}PAF{)D0?1Fy5)Iy!LeLsb}Gnp%rkrtJ@OqWWOI8T@G4T>0Ro5lun
zL?H5};tyU%MSVVuW*W#N`zVcJ+exX9QJXy#ik+iBjTZh{H<}{(;x`s+e7kQrCLGrJ
zcBnX3$}Q{4sO-WRzs1ahmR<{Lzs#&G<mH@N4uBUgyxme7O!MJj>Pav-$_))CjXA45
zo+N5??yd3EgrKmfoCto8H93aAMd_{DTfSkFiy$4fos<`bMUn|>I1k38_W`c37_-{F
z7Yxx1%J+neIg{Vc4D#xz)jquFo>4m3%Zu;V9&i6E!e=eZ|0L<kKD&+O_8*UTc6WAC
z`JZarf7yTh86PMAlMFbSe>|&KYt^S{{qgM4cKuPU=GC6;)gSL|KTBJGG@)8}wV0V;
z3(62=<(wd5`Ozmxw&90<V!3oHvyT_qv7uz!`}{qWvG-^FYwAzo?|(1gatFi)61hP7
zjW&3MFvm)$ewpSEw5IUyf2U~wjgyNbY;-=0MzQibLv}QYCKZ1Yhu$#oLAVMS0}M;>
zx`p0mMHM%7UQ#N?8{Ci3R7VG?vf%lXI|Psfi<_FH;j5~vYRODl>~=3Y=SR&BA=&L3
zmaP!CZh)cMSE`<RO+h6!FiL;u!hlB_L^Am~8gRCcPA-3TtKj3a(~F~@Q%?`ur)RB`
zwKYoC5e!h)^*}6}`Ko_=US%{GC2~1Y)$>;45ZY>)x)ku+t{qAis3q7QH=3sxE1`SX
z?jHWqJ|tWRQNU6THtZs7H)zip4OGS5h-vDoyd&^EoZr!YhGs3X_w%DuJbGN*!GrPo
z->vv=F)a9bFd=*3;?FQ*_fE2z7ZVs1jee%7tCC@+rjLVank>gZTy$E;XQ}5$7mZHm
zmkcVx=%$`tV#@dbhfoxq44KXvo$u-BMmdN0mzXoN3?R26!Q?|YizX!SnS(dV^++qu
zdxzQ9(I7fN5h3=V%h#|VrJ<vfqmDjD0_0_Y`MiK^6krovCB}#7yBYqI87@jH_E-S8
zv9rvfv%>&G19M*-qaWRQ`4rTHf}4iPDpSx8+%nj;wSxLqNYPh?ZcyDHaQ+b@knSq7
zAQGxZQS=^rtLUnimL_HM^ME#OkeSq*Df>lo?DdHsl2QCb96$$@Q8k(ox4aJF1Ot1;
z9kNNA{Ln5+fw=4ls9_S}M6uaSu%Q|&o6ibs<UI~f%s;_y6y3yS@|H&rAAii#0z)x*
z#f`5vN=h+AG+}$W5iDpjhC@#v07S23D(YV8xp^D(7bGI`=B{oCIo>p$B+(EsHLco*
zN9SvWuYUa%cKTm`P0T0tu8^9EdPM0awov``*YBzTVZY#MsD+Ftzy6BLLY`wyM`5Sh
zbZa&fH8bYC#s)w#E`!m?tuIgX1I#`NgN=_d1f^p^g@w*fPhp)rTEw$Q7zttYsE{U`
zD(4kqIJN{Nl|Qc59%WF`6orYEQ!tCJk5(e<qa{>bM$|_u(-iQCqXb3iL5iSpRLJ7p
zP~@U@rWt^qy%Jp-9rA`8T?$T$3*gtuoh!N8^)`#*P~lMl_r)C02ne?g(LTsxta`;$
zy)uab`HOjk>ykrY5IZXTTBw%tmbW7TQ2*8nv{+KJNxglPNgE`$MI7xx!>m!o--egL
zcsinQ7?q3ILDk{i$BpwJ6clmnArQ!A<S9n)3g-*fE};hz14CY`z-ySTpIbPz+?pa(
z4u7)v&qj>U^f;JZ^|iv!XTFC#7yb5GMJ}iEaL$gby~Rj-LH>PHXCODp*l?T7+7oCR
zp|m#(e2h$I%Q$_1qNdFJI*N&_8iysA5v}S~m6V#8LzP%4YVa+eCQ%@b$GE4f$86?6
zeD{%=f4q;EFr{h_=yFG!%^)(eA-W4|BZ6_}j!&~@KZ8#oDc1_$xo>2^fM+K*{nuQ)
z;_mn8PW8HVu4W86bY0CbWCA86Aq^ai?MO1Z)7xN%ysJBp<d;i-pH}H~K0{fitF?Xp
zAo#}u^)6~KWC`;EM6+C0fYL+QBMpG7@B`UrUPaLWNEP9sv=_{8f`DDH@Te0_u4IKe
zQV#WOO@nfeXqeSr&q7MoM+ZfiefUbvFfGKik6z}~L5<<SpAEEtZ`I9~_0+&CT^Y?U
zT?=Os&0SJ<!%*D#cLeE`D2DwBMM7`|7dB+2DXUiLq0;+{g*;iAE7Mdh+ms0mUP>rX
zyfSR-RdZxkhX=}x17v)8dDK4aHZHo@7}UKYS-O;YY_Q9g(x)v<AX>tZPWD3}d*Xx&
zW6<pmg8m4}Q-rNMxWy2Jr3{XnE*p+jSvm1hon)o8HTK$Dx04=^k$}-~PX6^i1x!?g
zjA3$WM~wu@-AO64XiXZjXQWCIotj_bL1^ZOI9UXY0;Z!x=E!8=i4`s8aX3J8ciKj)
zx(U*<<~G3&iKWDO$!ZGQ=>^N1T0Z5O=hKUfS?;w)!$(*BJ_0F<OKa@yRO_^L<GwU2
zSs-AyFI<O%K`<$>RUc>Gq|2X}5*N`fg4=o+dphYk9T7-c8{}$9fWrY{x_xKz@er-C
z$Eo`Q35y4R@=xcOh{4Fwy1YKQY<9b(Jt^v+o3-t2Z_AUP$44ip=UC>&fw!|=r?M)n
zv;ov=ze=cW1g~z_pG$<&Zns$c5XNCIM6E$lQ3+Fj$ka|_uK{I<!qP%+UG*YEukr6~
zk8Ra@FrTiY8;{~3d$29W{uMm>$0C}eD{%zd&e+2M%i5nKDflsm@~vYshJ%3p7Z_q{
z=lu6Jnj;oA3f`>;|GMuk*4Cs<;p@0ia(Bc-ay;gJ$96U%V=3ivWZB>8Fb=S<^=U1V
z>$Db9V5W2MpK!u=ckpn<{$Z1;o-u-JPqwuN_4hBK!rb&Oa3`zyBg!3btBSv*nl!P>
zV2Rm0->f?s5iEj1MJL@b?#^Lt4T3qyR<X9G6+;T%g2M^MG9d=H0fjd(lrU?2(CJN8
zxd}FarOg(T2}P1Z_JF!G5aVFXM|at$4sj7g*#pILYfHo_fvN#gi9Nz^vICQQ5ec1X
z^?<7wD_IKi#Uz9dlhWKofp=(7EUksHk6*S+2|gnVSQ}nOJXU#>556n#yC}|1q9VO6
zCHL5jiZ#A!<y&-mC-=m2SMg~be9ljg&(d0<S%eW^lmHrAGZWZ()va7l)<)HPI9d4W
z{(LE@mGp581WyOQpxLiK;b<vFbSK>m7qWvWmXQ{4z@bwNh({wh28?1)5PzgPkd|Kg
z1swlhc!i7?b$o-b5~O^6(l~A<$wBH%#kdmvSDZKJq-~d`MKYZQa|xj5C-jv{yi6#R
zN&J_{NW6H(yn?FO$L;j#M>+(ZB?X1uS+ZR}yVNsBacQxSB++If41q#Jux<@`K~AT#
zmpw@?c)|!~1ShRNQ<$thuGQCVzJ&=5scA0E+aCoRgulL;m>i9p>}`AyP8iuCyrc7Y
zin~=cR|I~P1-*bT3S=AM4|Lak6qPXa$6Y}~z!;HP5GcyKAVNUo2&nqAbj{#_ehgjv
zpi+J73k<x!C<b)6?xAW0U3D=r?a8I5DTTxkJTXZ)iZ3DSfwI}By5uP>k3p^AKhj;u
zel1NWxubediDt;L5HI3Nm@cK*D;?<9Q;@H|;@G1lmrKf60f2CDORg)SWcrHdGnlgK
z1%@b+Z0nN>3zJyyJ4s06!9jY^6)cN<43|K9Xb}exB-j`f!#NCtp{Qw1T6^rVOLm7S
zZfGx))hDSynRawNn3{2MilJf$a3(0hli_F)Ul;XnM2lv=%zN(95S?0zy|S~C%Di<L
zVp3&1Thb&+bR|LDwckC#YG1y<Q_O9b-~CjL9+lUJM12VS`1wMR=iU_`bze8n8W?O{
zEkgHl1P|j%-Eqa4lPi6dIoa#q_2JNkjDq;_Gynl~GKVrt<V(uI+{CE?5)dphWj+<d
zVIRH~ufr?tr9>hOx;=5Mpcx|+i$^}akZOVxinb*$V~=FL1MmZO9kRB_BtO*@S*ye0
z2nQbie(e=+eCP-Vn&hMi6j4VshGeVvx>?Gg?(t<ileTd11kMhkx{%fC0`Ma^Y=+3f
z=*%mvTCuesKyF(~piCMIpe6D`IW|c1q=qy^^orlx<G{4;NB%5!hz%0Swh5aMvl5ad
z(>s!Pfi!^+Lq*9F0be|T#B?|zZCB2iiAt1_UUkfX&NN~$U@*O4Zp9#j--H}tj;Xz2
zVugBcpmJwxZ-Ru==%C-tiLs(kchYpCWhF~A8X!|Z6J8L`!zj6f=UG!w6pJi?BF8Ck
zh;0n;A5kMAYZ4w;x4HKVvV=+Co6!yQW@;b3%<GBY!`vh+7<zbtg2@uxexOcnB0C?>
zyg1?+nA9cv3e1MU*+4k@99kr$o<5agi0%+(f&ak|M<k#D$c?Gre~%MdK`7;PR(h4u
zU$$Ysci`A~Sy`;C-s72)SYtMV!O*4~)oK+@wds<Fls^hQUYm>q(%KhMcZ$-CtUE+v
z1IlcOi(pEwbNZ9f(c{y@dwV&?`<Zbx&~*Rgj&2aBA;5xFG*fC^3_ZE=^@e4YYdX21
z8sEt48uTD*!d`UF@9h|cT$cMK;H(&p4mqXBY<KBy)>E4hf{~@Rn3Zu0QlyY7Xnu}x
zq9Ko%Kll*F$U9htbi;<^)VBBL4a|YJZ}WPJeOg<qWpSBTM<@4><A%gXy+WI^jnuu<
zJ&P2MNO;&u0O9$nAHrz$uXBfr(9A#|4QQ5d7t;ZddfHvQJ|n*H_su+}xx62A--l%w
zp0b?Y(C0o94{-9i?PYgLkYBe?O<~uchHRT7Cp$PnV>Dd~p`nlQ_yX8*rHR)yb{7&L
z(nfT$3$pfEjCJH}NcI()VE{46;~LLmbSZ>e9~t2TVt8SKq7N|On~A<UlanOzAvBnW
zlg?sJWqX15j|JxYh7Q2y%afPXf>$_wo9u8c5v-IU7pbsu1W{4pHB{YMU}>L1mBLEs
zRK3nUEI}Wd-?y4S*oP%m$vN;C0%Ce<M?U8A#i+y*a^j4zq~ga6<&Tb-;|OTRdb=kM
z;&hOo+oQ}eYlm#e#TUBn&Arw%q~JwEJz4c7<Vx4GAs_wmbVYWUaKxPrM|jgl{^rV2
z#S`j7x9~tysc(DFy`B2gC)=*XBwb&tJrNzARDd&Jy|(*w_u0;q-R(9uhu55>aKX^p
zAg=>7?n+V!Qy_QhYG{~K7U+r(0~}dvP?4S{SRT#sf;Y=v;i!8Fb$3YfhOxx0z!g}9
zfhO@a_fU4-ht<41ZXM?}iWwp$V=P7CUdTp6+3hVkUhxo1lX%osaFh5f1u75`wgWUh
zQME<FO%Too$}Yh^k63oe>dK8G58%DGAb>y;x96Q}$D&zTkZs`bZwN!f^z1kO9UR-D
z+56b=q#Hc@NyKNeL*v_b9)c&k6`(wY-GZ%tWgCXjsJfj6j#pZBcee5jTC<1IEx_+n
zk4Z~_Z)CwFpu#||an8;}HF$1p0eF4D;;KEtetKjDlUz?p43QF9D5jrl9MP0D2gxO1
z@ijlqSa|>qeflm`JT#ZbO*p3s?^XF4O-j&!Y!c3ev!K72#dzGccQ}HMartmFn*ojR
zqI91uWl89sE@o3ST;L5TMz=#bdIkz&G?DW;!U%4!{RInaylT>iNYyhuM{aMYdwtPq
zG=IqMHf{v$PYb*9T-{v5zN!RoGR^hLlX9t|mv#uR2=Gb@AT1ER_L}ygDoLzWDdhr@
zqycnkvX~Goia)MfhlNh;8>EOBvy8D_7zxJ}GAnGoJ^~5%7YbvNyi2fXxAu(b`epA8
zg_K3?oM6XVi&Cx~Nu01eC%as}m`4aOZq$1;51OS6R4juj_RpP34s+3!B#hb_E|pSn
zmC`*9)NJy3lFp+D6N82WHQvDYE+TFH9h-1Fu@bpiy@7YbELl(k6`efGqqN(xBe;qw
z0;$~+qGOrU`p~flFDup5vadL7w`OPM@~pR8AULT;Xd#FkT=jlrs$tieNJ#5GX&!w=
zFoGlUj@iptn-mS1jSywfh3=2?tKo^vyf1O<GYF<~=_CBFDHJKj*J$xWcT;%vb2pje
zJ#QZ!sktO-+9k!oNLf|tJF$#~#2gA)R0_8r8|Nv^EMG*lA-0TbFc*i-oidlWSAV>n
zQcdW_veBSuGMB9-s4S+kR6Y|2)si+w5MwzE-~Os~PKFeMge2&og<`LTk-xZwBcgs!
zYc|=K4RCFZW5a)0h5VOfiE=_exjcSpEGx;N68C40LM-aU#8p}jucTchp;YcILO9lo
z>mCcuYJjOJb2m%pR|(`#YF=F5q?#A$%~JQ`-3UXe<Ei7D!~<>b`T0~jaDrVLdUX#^
zFJHD>8E@9O5AG?X(R9hoaT?e+&f8eT7%@S6ew#!Iqya&Orm2>m-x{`V*iyd;vKP(9
ziE3IL^M~Y7?vvrN4ms`CdUf2%sB|+6=gCSI`GL2p%tEm>){)MMR<(Hmw^T<}9%(Bq
z6DFVyYy+rui!F+nd*%78F2Jqklqq?XOE8-xYiotCN5ewaYv?<^#cUA;TXkS{vly2r
zrL|bH$rR&KIRT*T6(^-qiW`|e!wJ|U*&dd`6>RTiI@Oig+MT0L|GJ&JN7Nk$1g3xh
zXKA4Ji_?;^62mhWDLbI_rV8z<jd>|A25i~5E3;ab*Dy{tJ+v7b8nS=2G&7{VP3mO;
zfIk=%eZI8yOIv(bn<x@5dZtJvv&eWcGDS8siwwdKrpTjgD3OJWSHZ+2(M%W520M*z
zq>lQQF0+`70m#}~u>yb6uY-Ru1Zwu+AhVg#+$!@tyGURc$p#a~6MurZ6u+`shX*hx
ze2PTsp3o8uRBUZgb7>_8!$K!|{gP@cRh5(vt5nBdM_H!$#xMgDfZ?Sd-}T=3cQ!QN
zg~wNjbFavI%H$4n%1~T&IJV8NqXDfRe2Mo~^XnOJSEOi)$%74LZ)5saMc=nGbeRMG
zV+{O(i}-ZG3VRg>rm%M@A&PiZG&%769J5D`Sm}yEcnCFrgm$NVRU49i18?zWcf<`P
zq~|G0bb<h-41+?<$AG25Q6OU}Iy(`W;byx*>!;oB#YL+w=DlpPTQu*&oo7#MD@U)`
zJ?<X;>^_uo0Hb8kJ`Rz$M8mlj=*wEwJMN);mUK%xzG!xTY@J&{KHX_m49f$ICEo4&
z@fg<Yz#EufVLXRJd`?ZAU{D)4^I8g|H<37}*K!rlq?KSisCGgH6ONc32vkDhA%e37
z_eXvV$19|q$TElIL-Vs24#Ehe_WsO|?@XZc^~D6W3$!GgIDLLsb7#~Y?DOr^s5{#C
zKJG6i1di43-iHXU`$u^AcA+lzy+suuVoc!y#<+U&^zq}JZ@=B$t!+Pk{B(D>y1nml
z%wa4yN}8EGfO-}m;Y)YUUYeu2LkS&^VyVdQ8J(o4$Ojw;cHpwOG=jRg#a6i5A8iM7
zc>znV(LQ>8g302$9Wfk5S(c8qlC8-IGyVwnbWZM&ZM(?Fe_c<PkCinG9d49lTznOY
z6PN2^qXET>Df&G~x>>FkD@}qV5a`j#om%4D8>n8ykU^AmQ5<f_+7J1%3RX23*f6cz
zD4LHCRlPbgY=Wq3Jj3;BfeB7`8Jn?MG&qHwap`=2e)`iR{(An4l5^0I3w3Vff{6)6
zc(ziSUgo};I}r$;L*BNKjbV$wji-;|U=Dx0-~-TwBb9A!iRJ?8;fd$b0AzOUozzto
zyHeA-^_~S+Xkeoh*9LsmdwHjn?PbE9a|*|@cX7+QD`a6lVXGWuy|~HwF=9qnb!9G|
z!i2M{#_xG-#Fc7XR_>=%Dba1x^W21SI@m(D+n<gWG5#MN$*FM*!Q^1mNEO={44n4m
zV$yvD#t&bYL7c&Sh`+=7`snrX-nodGJJBBRcZ$^pH7hUB&jpSM9JS4P;#F!1P8W8e
zCvb#EZ9Um+4L~@&GXWCP9x>`tQU!Y`@lBU^ISFqmKWLh^Me@N4hQqKQa$@Ox0;tN|
zm0sDa<<kOtENw{flJuG=l-W=C(}ln5<|0Ae<ESNI#+u@iEgh~0BKzsMrp)h2<$l(=
zJYS|R>ibiQR-?4)Q%sOK(<*gfNP`6(59LLLY#9=4Afaieu~dL_wdh&K)(YP>yyvv#
z?)ex4h3S*EvUJi)(bEg<qp9Ldh})$0eU9iYn|BC>I>%=xjboLMFhL`Ap!V6Eoxy2?
zX+|iI7pk07wh)U}FWifw&U%D;)o>8Zf`M#LsPqj=spu7GQiHl{%6QH|K;k05x+LqP
zy@g1?<(R23^O7Jmu`vu&mW1J)D~;ddemG4#%|$WLH{YWtGrkT7j9KmglNyFK>n_m{
zy4WiRXmbE;49@QT=^fe?7aqY&@>u?vKA4Uf3Sii4=?9$q_LW6;fF{Qn5tYKW76Vfl
zULDXY+91=;rY?SMK`9qYK$D=VXS9mR);Y`c*qY>1iZ~ii{hJA?fr1+q*8?ZY1Y~C3
zdhEa-5h*5Sc!#W<3Mf7ZP$}@oIoE{Z?<A+ia6Dz#JdaZ(S%T4$7(r*Plf+4c&?jCt
zcFfM%SeyueY8otrMO<lh%A?XQBleCNzPzF5GK8h99fy3QRzaxya2&e1NZ3Bcd2Py{
ze%TwNu{?(GAQLJQPSCnvIV@7;Ldh$T6evO|<|hUeULCbto2Big7$+J;;^Xr&CP%hp
zd>yo--Q83|AG0K}1Fk4uD&jHSz_LJ_xMQ`Ab?`C{<|}ZOag6T#Q7i!-?9|;@H>VYS
z4U1ta$d0QRgyhvHPInvV_g=<i9~&{l84bv|5Cw~k*c*(Hex)j=7*BXA(Vf<N3>pU<
zUE~nNo!G7wgTUvs**>iW>=45wt%Q(_<CcL4FdFgkcPNL8IWXf63x-^a)|#!2hvR@h
zWp<9?9gqF@0WH?zR1N_oOAbgQL$S|fv4hO<9=B^24oi%UlF(_Y1ZeH;u~CQXc;$J;
zpVXnmvQ{6fwh5~NH7D@`796pG5T{p%YSnYstCVtsX{=5x?A|)L(=?VbR=aZ97=Yp(
zFx|J(F<@%KDcBns$6#S2Jx%vE$=Sz^CT{mXyDxufALcSEMmrJEMGa(bh&cAOOjc=U
z+HJIc?wmI+&Kk`Y8Nc7KO{I_)Cd8~F;f?#=z@Phk6^RS@VvcJ9Z|BHf2;W`dp#Fv@
z&P}$kkf;u-G;6xy=x(n=QAw3pzaVU03_*DE!JHOROtL>(XIl6%nuk*pRw{K4Hwl$f
zhDxb}sUZet7If@Ckra5+2sW8c3EKF5bt#5>8l3uagAOQlTZ;NHL39j`h_z7H;*G|!
z`uG$l@JR+^!S2xj))4;1Yo;;$y~Avu!NBRC+X-g%hV8aXIR%AFuTYZF0*2nMmF_J}
z4qdB2<t_o#$^Ag7+sUGdurjaCkJ~MMIVNtI<7j~KyJr#}kG0(95{g`zVBRaEXuciW
zsJdXg`u0pgAT5zf0y>b3D!z)5i!N@Ti~t3N+*op%>K^(Ba5mhOUvu!8lxMqe6+GMG
z|4Z&or=|`%wvLj)`M8T~Yr5UcI3*5@Wgym_unb?~=2nu+Qw$igX>fuCRJAJ+Yd>&f
zor={sayp{1ZNjY0obf_|M(0k+1Y;j216eQ%&%xb@scpLTuMW-or+k*ge<myPYX9@w
zSRVg*cl&8=I~o6Z`>*)Vf6m8_|11Mu{@~TC^>3@S>Jth7{P@xKGYtRy_{m=VNjm)V
zAw?n4abhXt$0{+OEyrqqc9j>-*?vaMn?gM6{ezJ1I$?9@%G=2kj;$7)C;l|VN7fUH
zqUt_kf+U_ri3g|;N<4~szkx)Ye5kUkJ5OobOFiR$IuB`uCZCNH4?c`J7y3HK5^@6H
zgT#ucl0K<u1iDQ))HFdJI+_e4Z?hkkol2WnytHp1q8?U`|I_|5I3>!|fVz*b!WhmA
zMR-(Fxj#_Pi`rb<Ymj^`=wzXue#glc5Jo>lJx06o0-(?}Xg{pHKnLvsU_meB$3CU|
zrbedy^I%l83PRVyE&@kfDlbOWDfH}PX5Yvk{Qlly1P^RqQv?sx@OEF&hL_Lr{EHYT
zx=yxN92$l~#TcVqQjiG5io{va0e+Yyv~62JVQk6kJlVf8peKD)*@Lan2`Wtup4G@H
z>u%D&o<$RsYbc<CQopkEf<Gb);I@i#H(`r`7;o>R_epBuukR_^F0@vr(qqaDK~zR}
z2Qx#kh|*J`j*oICEA2B9i#mz!de~Ad^TLyI-ZrO$VJHLyAAE%W!@MBe4(R1RKk4~#
zfKS=y;((Fic_V$HCm`JJ8xYbIniNp3jv_uNS+lLiWLDJC-N!FiStR1_OKoYzg`p@c
z)d_`rL13w+V7S{$;W!k^1;!T7iD9Sr!G~bPGk~{-O@C$<3}5yj<?IE8zp=t7LLV<8
zEQ<29@Oj<uGh7U1fz}Z4;)TMsi*I3}SGX0AOI9j8FKC8!EhdCBDud7HieBY__{-c6
zM`Z2GD;6{QfZQBo?$2-}cED8gqs(KjjT1KmLp7JV&=Bu!b;J4sti~w&v&xIGOMRyq
zhga_Kt73ywbDYwQnbx11Rl^U$m@g7s%vWi8+i5}<+}@W+B5+peUrQ?l4F_;Bv4&8l
zlp1o2*PhKH5Fv0=f=W~RQA{&fsbAEC=Y5yr;ohF;w{7tD9)@1AY$LsN+rzmz;b!gH
zxB+5U1mWQnC}3e-w75OI!zg^T!yX_pUg0vKrtulPFMF8GII&sS!Cfq#P7M>KNk`~f
zd9xD7p2TKjkTq~Ie}6QPtFHrh2L&p^7xWj|!xvjMprm4uGLxxVg_Z$MIP|lcVDBa-
zlnkJ?f%&!Q7RlS_hZ}6uZ!IV3N};%^FTqL$Zbfflx|CtuHp8*ULKsixVCuX+hUYkA
zY7aKE6j?~#mY(zb8Do!ohnhe<U}#s9!LE>OBrPdcvhW)e-Ik?6t}E2sf})(pd4I{W
z;i<Qb81erWVgRB*hPWPQlcB8UBmR(G7k&Z<r<pc|H##-+D)bUAKqe?Su~C3x8d>yc
za?V4b!N`ar{SmB?Y8W@wR)XZ<2#nDA!oi#7+k#<~D0C@pAXzV%H^8>@-%^%20M{%y
zEH<M>+Gl5k7VtXtqLhb%E@wSnhLkDqzDl85OtnSg*>_$6btwg4Bn99`x;sGX({BHI
zF?k;js4BV3bmJL_f~J3EEAC_|J#si|U9|}(hL48_LCL&SUlnNy6`R%wNIy(dB27zt
zVjl<85GH0sQSYhD+CHi4(v`)OH`o*@B%}^yJEv%Isl7~1=Ak84+cNbqF|RQIO*o=e
zRpixH%9x8Cwz8S?e)fHL65QYl-o{%!*)1@w9il{Q>;T)*6A&MnQlW_HDAt7sAVq}F
zRbe!D&=tIJYs=yrJ;srmN2C{H#9&_bRE0O;TTGWK_@D?cy;58SN^>q(lG7&rSr;A_
z+v&rfzqp0<W|&2ip)w=H36+p;RqjvsW5y)!@aPI(&X}ojauxy1C+TKFvf{oGY4;h!
zeM)7CxhG}3Z^Ai9Yejmg9(pKV!rpzcv8SJSnqwA`OAbr>`bBRR`0v%vj}C;910lV1
zl<;OAiu41VLvhA?npmWoko7`Sd!l^LR)RH2!!o=>aJ3XBYOni7l`M(WX&S@9bK$t-
znAs9=DUqe;d?GNSlU>?6)w-Qo+Q;_Bp7VPMea6PvJW(4HsTpsz>;RQ((Y@3GAe<08
zQU=9R|D(*s4ADR14EYIbE%PL)SDHntgpi{iXGkiWYQQ#LY?K`FS#%0UI$^4e5+O;v
z`8<r3Bu?s#k}Mlugw_F)qA0xBP~;lYCd>?r>T$KS{Nu{`&cRO~*}k$=CU87UANH0@
zdrTXN#NzY_B{sWPHrD!`;zD|!7<P&z;-Ms#;^@fGr0RNB<kv7sOPce!>@a7;Qm4~k
zt`M^L{!njH7SlK9b+_p@G|f~>Zng+=xKvcPr}<|&e3J6~ZrqDTuqU-B?+ID!V^V31
z<U=!#{jWdqmd){x<OzIRqJ-?lui%^3(QfZ2ilMb>aXK$g`=vFmw~g7!r+qvZlBRPy
z=dBzuEhTEtf-9^He^l)veurA{7|x$#|CUaVSiiLH?#t6zz+sm-lYlylPh}rtaM-vF
z1aUiV{7mr)XsApv^cKT-Oz{@|4CAhZb^FHSsBGQu8yA#)9Q&7mYr*;|ulh-=b;tnz
z>%S7B!96V|FvSM7Q?($2yIw{yBZD0{1A)R{R+;S#7*t*qY_D4#$%;#_@zoo<T&4Dw
zj0<(D?+k6IGXv0KA<{DlR?_RP{hX%(HB*EFTL6B2UA79Rq*pw$lV|fBP~we+b*MQB
z?SGQ8e9w8(X&klFPq{ztGs)*`#0I7uw1=bjlALu8v{Y;p!tBg?E7eQP*+}hF!Tu0k
z>ih{Of~NzJF#hC)1)_mzmvQKl>w^#dz;Y8wv@v6{OE>dGb(wN(?@2dj(m7i+FvTwS
zvY(&tIcwjW<pKC%&mrp3#Sg_9ieMCXguWZ*@*YI5nfy+zOGkS7n3|75H+%lXz-%$U
zR1WR%pg5KL3*uMi-e+IFVG-Hj=Mh@7Pop?g2^{dHGq7ae$F^_-?;U^?QGg1%D_30=
zNiHqUJnN6NR@C?2O@hUI=8rb)CQ1xYR<^KCTwO-1PM20N`-p3E7x9NVEjTMo&|(hI
zf6H_}oi=gCMW_#T7M(fp`TPpkN5gs1GnY0rh0RaK6@WhXtgPH6>!q4YzB=#81U7lm
zqiHE|z6l#Io3^~)Gl;#^h*4?tqUpXMyzI3`Nc74kqdGQwe~o_GBu`J&$QR`S|JywL
zZyh{w7q>AY22CrhBpCJVrL<z}ac=YRs_mb<=O7&RLBKP<zg64n?OQJ`;eyIgVqo~2
z5HRd2*e;bJ?X=wzxAoh;^XSp0O4BOVw%Ys(g&YZffOo2~+*R(=&1v$KkJe)7ka`C*
zA>hb193*F<!ejWxQcS@c`*%q=bmL2gxp>%PO(#d1P+Nmk-uL1NBxyFFOhUPelzA%|
z*Y|u*L(Aq(vsl?WjlE(>8J<h-VN+PcZ_F8f18O5d;hW(K=411Rfz2PVPNi1)?d^V|
z2FsTgrx+;dL3UP=Ie6_2WH&9j^O8RwlVb_6H-6h7f9?-xFRf|Lq}0X*Y6yzt5f~0r
z<2k1UvFI@Lo^qb0NF<W$Z{O4s+r5j|()0O8eY%+gu^MTfMQ1t$PaBTf82bA%Z^?{W
zMM(AD`5X4p+W_ulFhkx6`djtXTC&yz9aD9`wV0C@2K!q^1Vm3eThvi(8F_%ii=iyW
zcz$_$+O~NL>E01mO&wrqNrt>4zjMc7wSHjuEn3bQb(i$#D`!%s<af_Z(u|t+gjhvM
zBh)xKN)f|H_6MVk%L4zvuU^T*B{3~9*|eGy5?U5#2CV;gy^UPmP7)XB8iiikOFX|&
z&n+a~?L;3+R%_*T`}AdIGx8$U4yq$0BgHq^-upMbx2tWQ1h@Sv1yTzVTeZXnhUA8s
zh%YQMuhvxa^rYG7WYejyl4z(Xr1P7IL%B=_@ycV=d3Ac;K0Q54x6#L2+FG)aXriMR
z6;)_Cb&c%sw**z{TMAzjsF2|}xGI9ZK!Vj%?8+Yw(K!S+CMXqSSbB`90WjzWaMez$
zKBpg_owxMkR3CP%k;P0Ok#bkF_?v(N2Iefmd;vx2Ybn(MaT?Ul5T^+#Kl=?P)xl@t
zpF#}v9gEo;-(?XG@BdFR+M-saxPs4t2<bKhfMQ#~6ZVB!(mtPLcgv@$KKEvvhZEeW
zr*w-+PHJe~tJE@?Utei4QMiU<XjRTHsaZtqpL}sI+Z{N9XS7yKC=$@TEwfRr8|^dV
z`DphmS<4@1^F4D}SS?TJ2Tf*CFW3^bqEYW28ueJfT}t|USYbkqu>`KS1zXO3dW;hD
z0MCtS@jayw)OY*Iv06S!+ou<o=dI+@gzctm3-#%<&D3fON{fs-g>8d3t7KhVPE;`W
zl%d7r8i~g^P}2<YSRagQ?#bAa7NDiy-j>odqdEunMvTfk^Yr-i$5ti@Q+$LibmlX^
z4?AW;dSb>w$P4R0Cbhvywu23cM>>sz#UQF!dWF@uC{}5vH>f<_=g|d!!7xXzxOKmV
z)t>mu;!lyJm*Oa^aFK^EF0I$I-X`wB^yni`c}v<TNq$1jIX{q#I}ZSv&k2viA#q$)
zYClU|=o;NA%@~u&S`%eG$wcDKF}!=vw&n`FnEo331XT0&DYTU%-Jx(Niobs8ZOJi;
zi}{KtRS0RGG>R^KSI9-}itLf@w}qE$#{T<h6lY)ZTc5PyyzZ)HeafesOiOodWr*x5
zY3FG4Ww|Ej3B4UZ+RU{_q^xS(x2>9(imRm~_`BwZ8J2zYTr8qcQD`O&0yGVXC^;vO
zYq{PE^!1j2wXPqheera6wS1ZC{j8HkV!yabYRp(3<g`X1th8I3xh1Yaotb&%96J<o
zoq2g>^L9ljZmW>TGLf|>k<Qegs+UO}CUt0xvIrmkdVKivH_{@+bC7MUxomt0WJxG%
zhhEuZ_Ya*WPiOpm;Gwe9c-c;M?|nkqO0B#P?$YC-sQg|{+xHm+9-{APE`48ToL~`&
zMHU(5#w{Na7-oGd_norQvmU-#yhRHU;y_6}rA#iS$;0X&Kq?Nnn8IL%ZH$a4lzoAu
zjgd(q)+_l8_fx%(h!!cvM&YE4T{zj>TPFJ~&w})%y^q-5*4`jYXRr!7x+MLPkVh9I
zikG>VV6;npxf1GAO|mNcEM+io5de~m`>pDY!`npS!?PInBI}(xs~H_tW+^#3J3UXY
zb&JoaRiCk?<_^Dj5;?O#IXPiiOC21P&dVxcwy(koSXW#axCkTLBNXeJGmI&I9@+q8
z&6m!PY#to(Y+>V_sk!g+4z$(rzK1eCO_m5m;Hfe;#3A6z^OAFUYs?|AQ)G=vVifv@
za~hmX`z4K$JEfIAG{dr587SGW#PG61tzo(N%^bfLBc3;oxP{R#4p7z*QWeSCzwAY@
zQ+}5(yttD=>S(u<$atN=%=ku(-}0fUULZLUqmtU$Uw3DViH<r`z=&R$t`&y->lptl
za3q=w_)_%o0kO$aAuV>HWe<YpiAvU;_FTQMEd#tz_QX0gF}6TfOtO$Qx-zwD`di&d
zd6uv+tr7RZCldP^o|HT~6i(}iuO(!Bm8ggzU=uZ^hBfW5XNX2Yke$H)3#p!9O3>>S
zrYS;7JduvcZ=|3aR{->5cOGf<U|!&B6KjgbVOqz&Do;<ofnsGR#nhc)7y@O_pX^s1
z`lS-8Q5P_vYajTD>Y+Z(L^BLw_BkDN)>|!a!NDM;R@}UvTe@!e`n>k0{uW6yufvxW
z)&uAK3P?SyrfLjxbzXbGL{~t*mH?DrGX(g5y_9BawyinE09tOAIgYRL97+0mcTSyo
zVAOF##a+-?BqBV_(eTFD!@o7TrZFzVUbYXc7+<h?aoVnUUy;Zd<6|>rC9NfVxU^?Q
z$}nGmpeN7J<isv~9q)ZT*kiIXU~IhXA!+v4m7$JVh%`v>GRyN4sRg8iB4lrBn{jeL
zk{Jc`<5{lbK&B3l%#aimygg!r6y6JnwaZKEp!bzy=&9b95b47%hx?QuVXgCX_|KTx
z8;2fcZfQI5nDdBElb}2f(^aub+0)3e)e8_jAyuUeIXy;`Oyg}}^|D5ROsB%RF`Lco
z*!ks2igl`$wQL~_$MdpBF-~zDKloj`UxpqNul#_)|9xQa_@L}TVRrT41y*D)X`Wgi
zthq%%u?n+&fD%jw1jB3tYC0)5hEI+Euq6Hm2SoS+F(#JB|JZ(9fBGa5|KrJ%$F;xW
zfBYFAJN^d`c=>}@tL{Fl)~YoO|MB!ut^TO~)T{06ZP)kekJI5lNZoxEOe9k<3fyfD
z1$uuJkiUgPQgc$<-D?xpLw?)AEk?oZr^nftQigMmj=_CC_Gj-o+Ec($<0$?tIyA!)
zu6jpvNe8J+a9AbKi!h2jz3_W+G+J;}L0HnjXk$(R!g;}v5n${*uXsbj3+X#@afx?{
z!7t}=FdDikkWNm!|L^kn%qv!EC5`LVESP$Q)APgDIh^Uv3n~(siK!O{WaAklD3m~u
zsATl{GMt=FXT+YMX18&8Sf(!*moNFt@nxI893K5BPfn%G+38PZsmJ%)>eoq&3$*@S
zJ!yCNNn75$mfx>iszl>Npq`#<FsCn%PT<S>M?n(<jX2m}GV+Yp(aGgSSt{!0PSlf2
zgyenXD*Kl4G3@j>BZ|YgOo26rF}gb|Q{w=BEUIx8Ir3XKhUX7mEP~c=ST`y+%J7ve
zm*tIlQN%Y}$Bm!GC@u*I_B;%82SS&ip`OY;A3pWODNtQjki*PT_toV|Q@PCOcD>>&
z*coL{!n*3#iB;B(vXjNs1BCYTp*8P^MnL#a(*dQn%OASK@Rp;dBw#5iEvMQf9A#EP
zEvE8W&aR2!I%XdNGAqb}kXMg$GqWz?-fEguygmPrs?xdO3`U!Ac0E2MrR$AMa+FyP
zqOdcglyMb&@Mq~R2DejSbA4|!$Zi<k*Zs*IUJI^R)wGOtCzKoI6Dxo4)1$fy!sls1
z-P<1W&?U93@9%@V92lfW#SAKWVCFWM93WRwIGoQG=_PP~7f?=zQO>XV0Uf7SAcbNm
zO9?{LTx@yrAw{sG2lEFHBiW$1m2www8agd~)D>tf=Q*`$vu1P7Opc>K%y9)R1u~E5
zgp~&-kByMpC9~G%s3z6x*)+n#r{4>bYa|cJ8SEr!md|@5p1aH}$(`O=07Nuc3Bojr
zR|ZkDf7J6QSnlAVvQfq#r6qYfk7${c_Dzh&f3@`dzyGu3{3oI5KEI9S=f7I*Nqr|3
z|MBr(@gM(`kA41=0q6LSyKn%kOZ>;$qwO89_IR(py|?pi`T+QvuhBW2^uvyQ)TDjx
zQxBF$Z_GUSrJ^DJGmLaNM7%o`*KbORBDPNw>;sV-MAg1Z9_7(`z(XNl+dD~Ct}ry*
zTJf89<;AFbHRlXvY!EoRvkR(cT>Lfs!5Zo*pY9|uw4D(gNXstzUgub%jNz%0qR3ND
zAFkuzL{X@_oX6br9$TlMmyL^~X196Nr8Fbv^DJ3}Dm$f$^-VgD9G$Qe?Yeb36N<7_
z%+$go=IiDu4UM<CdF{v7tgga)q@B7qS;P|1%4C3%!?2i^k+n_uPYmK?L*CctU`q*1
zmX`}Ol0XvK$6i5AtESC`AYcEHoh4qj4=IDS9T1VQFrNR(AeD64&RMi%#7u=Xx=kb-
z7xdQ82F<EN`!0Laid$)mWef_oQBJ&Jr{-o8Y_jsmXo5u^CvcsqYz3~PaByg2CWyi)
z@a+AlDYw6FyYMb%GrrHp+1xjd_$D@hDQj-NO;OgeCrVmz`PPbGIXC7Utwxu$$~hWq
z3oPE7*@6D_w0S3nKEzx$%3choDh`0b4pS8Eo!z4_sx<Sl)P!Onq6o%GWlw%g>bfuC
zHR5aGAC%CX3dJUJRRc4)!|(-^$~`f~VC~BbY-AjaBOVk_(y1*5`+5cA70Kc@9EF(1
zf};1M!H)v0+)5V|u2Nl)++2tAVBdOv)u-+%|5a=ixt>4k`B#C8gb>ZF^?4J3lrW!N
z^_6p~adxG5xIo?^IRpd45@t~}SJg=NL!}!U(Q_-za;a>bthz~{m$%8_Q>|Xj{5!Wz
ze3I7?zVomAaN<@`r7=NvfOfSQSRP}h&Z9Bsx<~@LK@%DW20r150jDzt)E@;n6HCd;
z^YH=)RO+J@y3!h=OR>PisQGHx0oLm#Lphd==lDk$l1@M+ugtvk)aCKqx><v{0W%K(
z;>w7xqtRgBJe@~#e}q#f#a!s2zKNr?MbmiTKn>z~IMy=`^`Y{>Br!L@{Qi7F#0@#>
zyA9~758|p?bJ2}A#$c4MDXZ(dUT}@Z5OM!H7%WD?hMB%s{i(0_A)U6GTsM2c9Olvl
zqgrCxBMi*@x*6M5<9RS0FGgG$ntBJbWrA4&!};BYS>erBYB^8+N!VArf)#2PyEDPN
zN9OL5D3Aci?X-~-_L<Wt`9+RO7<G*q7rwuoLM?Cc;TnH4MI>z@=VPo;5|@Fq>L{>)
zwqm2Ur5OqOHJ-mgAM8%!^@ZHXjss|%CooPS*hIrV<w#JtD_z)pjF;hWI>+4;b(u>x
zJ#-U2_pd6F@|Uj6dDF4EtJ(11O=*9^er_1XoFWHZMMvXtH2EG%1~Z$(nJ7WLvFm-B
zO%gDV1?D`R=WXmssR8rWN&YK$=XLgn%~ALDe&T}MzL3O6NW*MUOXLKC@lJki<YU9Q
zQ)jv+Lcz#ismt_0?+NhE__vr2!4bTxIwkg79JNC3Q~Du~dZL;R*lVT*6jtvyY*A2!
zc2L3*e%DoXiaY}GPQc1C)Y@+fzUNJvnc~m{cn_3m+Od2SH4&^+*{wneT`0o|Gt(J}
zq$sU8d#?%0Y@SgD8V>pFX`P1^bD1AH4@N4aw5q0A#g&Y1)~Q7o3nm|u+rf0C9Q)v9
zIEyBhEN(U<WE8|F5?i9fKWHYg@T8`awW;>WdEI4Xau9=ggxv4{sUw-1&3yGf3;LAc
zp5_;Woz7>2a5(JFmAyb#y_Asz275xxNQMA(K#RYp{r01MNA#McS~}6aHge<TM1+hS
zDFt~EC%)Bv<wMXlaUs|-=mf+?6my)%=Gi6f-wX3V1v2Z8_LKbh+Iqrn0#oaW+5s|m
zi}|&TJm(!!okxz2IpAYAZM*IZkemV`s0>Lu1gk#a`Zrhos6LO2kpy)@C4LcpRbD{f
ztMj>X!0B9c&W}!Bm%VTJ?L4*)0R~3#8yh4R`%p@@wz$7B%uamR=rnY5i$rS+r?CZ>
z`QVo6kM3^>b()={(-YlLf0StH`hFl}9Iqi<Cjd<E2XJ<N+Bww#rpdm3Sb<<@8gHoe
z!2&S>81smLVDdl*jvZh0fnaHnS0T>#=dH$}nK##x#-1jwGjAt%WL*|HbJy@7Gi#wl
z9hxtGz{4r*hecDU?7>qyI2x6;C3L~p7KT8Tb>v!dWvRJaUEFK4ikEG;Z8Yrr*W?{q
zqW@Kf6rY^|=sx?O$J@I}{qN3`zx2O<%E#9K>H#Mcpq;0yn*gnn?nh~OrIpN-Jvnwf
zwBnWZ3+ZTW8$2EC{Hz;I*$CH)9ko?^>mAUxTtFWyGAA!!%#9z+R}4mCew`f259KqY
zf3a_w{z;6Re_gmQFPxeePSKOrPfo@5EB@9vJd{V5FZs*yr2sfQ`ca;oN}03MpZLq=
z$+3Vv?MN3|C;Wv?cKG}MJ3iwtt$&wNx-|dov@Sa48(=Ij8g0Qrd7JPrc46o5;$WhG
zU_=I~<Gd2ra{=5wy=a-Qm*?_>-FxXf?kuj97ELisU2$Ia%RNeR>lKT|dFlD{rzH<|
zprQ|7pYYcneBI@*efV0Zub6XpT}>C3!)4kaTxZ(wq=9M2pN{7>@b63c-K2l9*4i3*
zB;Z_KBl%R2+%BU@E62W)zaS=HB(jpXwubYWo&HFuEvGB};8em0om_{eZeFEJ^Ost(
zE8!&1tCz&kt_REEzUGqEwD<Z0`=*!JeR%$mZjjbgvflPR4PN9mxP4C#FLHXAY%q!F
zMGm6(4WMEg4<!t;m-|K`SqB)=L#qJGdT143ZV#;jZ1BOYoIbcOz*--=On?bLv<k56
z2QS9f$$eGM6IFN%$eW~2L$S3iV7GAU)b5|yt$%-Ljdth3HCo9U$^Ivo4en*1QU{jl
zLsuwyVm`2r_TYRV_u<`lrTJqItL(;~QV;j^yx}^@>s?NJ$=)UFsnBaV)lPDVLK4Ml
zJJqdI31p9lZg4E6C`HP@T896e&$9fli}CbJq<_8d{P$%0aXsb#@$|3r-=Fev^1sr6
zlljjB+&}Otf+Dm><7tSOTjb-1E_d;&#z5($uU39nK<eS?T{8`Y;*4CYiwX4_t0%7e
z;mD{}G@Bm!G~>^oW+7g2+|VC*hMJyDx_yTqd}%QYr~12O1@I1`5p}htx`NM+gK@D}
zo|N%2qkLFe!)Grky+E&AoRl_;6xkZyIJJKCXT@7A?yV^x-`tjK1SJ|4Z>fUg(`n%H
z@rTjwmHA4AZ&u0%%S{ge00GcJ@UZfN`*Co9anycacd{VBTXw}W#fqEooe5N;_i$L_
z{#9Nep>!ez2LSm?CQ)v}0l$cpyvsn2PXD(DMf_XBYf_su`&r<QCUb&zn*r_K%51D(
zwCwgj3CxdVPmvr3GX1%4G*lNR1UqZ~WVXon4$`9BLcp@k8EzP6rP38o*|@}yWbiE<
z4=8H4>axZG-7MKjIaxj?m40;;OtxzKw3(`vIG_0;UD#~=x-EBjX}H!j*0`1JW<R>C
zt4VG@v`{S4i|bE$XhpP=m1EtwX0IW2vu{Vv+N6XgE_J5~>h5REZLHx>=5Y#EdR#C7
zMtO1|7{A|7%>_HD)<k8{GS2OM1-R)&2j2`aLQ(iuQIl4f3MnB}R>79kV{}=kcr+BE
zhSc&Huy%dT#ECI)P|eV4oWNTRUNU$I{LES>m&Y$#=Tb>l+T{Lfe5)kYWS-Cbn|Yj9
zRfV`&U$eq5Y?ojzuF=)}1f#xO`%}Ezgh{w&=MsSb^bkx}8UlC93^Dv*_?G4!=YY#u
zu$1a(<yo<hXbGE!tq0R4Y<qj&Fp*VlJ+TDT3t=8G`2n8HfMxKaK6)cPU<O)4gUxb%
zphFe@Qv43Hv=N+JhTNy8{iS7s$v~C(xD<CQL)eOAXYkgMonQcShV4^%gJSK{SW(Z9
zgM%ruVY@fPnz=(}3ORH!DGbx^+@y!*J+0Cq$HmNgD%o<<uXJF>^ea0xhxJx*Wc^z)
zLF*yU|6v}T*~F)qEe~8{9EoQ4`&Q$yb<V*gNN~IC@|}F~TD8La$aOhUUbV`CF$#xn
znq5D3gk2JJQH&Mep35#(DcYi=ngM1;*pg(~k|E1RgtVpw-Vq)m*46ewoBpzNb#OyJ
zu;PJ8podkee4wOI{7pjHw)9$v_l+jDVNYe8TxEVE(Lq#oq{zSer1ID2kN7OR|K&5(
z=W77&@&BpAsXuxD3-A9r|Nj{u=l)j)oE?Db54iqC*A$8X0eo6<%Ge{zEn}1MV0Azr
z<xkWGI2r=jZBozB(I@d}6!wzOaC>!?3yj#q)eD0tp+*=7N#~=LH4q9f=i!I3crH01
zt0-E`BvfeQ73J^9v_F=$RQ}P}&WdG>1hJS0S7=I$MlprqD1t2&4qI$ihZmuRGVuH<
zy3|k5zR{<_DhBwuy}d1A`bPATMQc%XFff@_iZy)iZF=?p<l+?m2a~G+0Dge+jL3zl
zNJYtq=_ZVWs<m&PqLWa4*z<}`;DTF|a4RsGM}ymGqyq}wT*F2Tpegym6BQHo79-)^
zVg`p7FH{n?fa8>_?2otJbMKjs^>?d6Yw7sM#Q>{6f9~zj<*|;42RK!rqDuB?=-d<2
zN8P1iua4h~89hOKUm)afyd9nVH<0M+`6%5&`KP6=XM|T##Z<QfqMdd}(N#U0icVNg
zeE}X_b?a~HkDn+r3D4Uu*UEMH-;VrmH}Sv6_xz85JSl(P{|Ly_^5^~U%K>>-{=EPF
z-vWZGNZBZlbYgUSCBlTl5N0C`HUDhi!`V(>tXQ(}PG;XN2<h%5hC_VtkA*)v?fs^r
zl&i3P^Hd<exf6mBbr$m)#U_^@btkE*N*L=XIp#GtS)@^Nu)T+y%`vUFa7v9ZJ20G@
zf`2F-27oVn>U&)Ukj_w=IB<HpGV+C<t}f09Q8WsGwNu0i%m;@4B{lD>uXJcV4ZeN!
z`g?5@n`mU}G%_`fP%*79;X0PmB#bSCXrkY~3;3$<K-NF&R(L!;-mnSQ2Wq6*tjmp&
zvdMmrD&Z>@z;pkcTs`C^2V*2y5}FcVe8a^`n#a;l#3;6A1)Go)BaiWvH}vUr$F2w%
z4&7ASxZS{0x&7ql4UUvP_V0QWsqZ?tg=1Df9Qz}lt8m2CVfqZVw54D|dvuqJ79$Ja
zGVWy>X}hssw>PW+wGw8J^3<XK3y-?JF@`a@6|<?U-WHIAWz~riOn&~xJEYy@SBWMQ
zIZL(P76JNwOo<{Lbu(`|r+5r_2VGtkSPx#yrWJ@b&kZ#QH80Q<7oTBSCY2o>P<Ch6
zMV1|_V-8IG?(4xu8UF3VzhA?t{Oc*l?|S!jyy3B<F*!rnc%=gN-5VXy4hm>wfC=Rh
zL3akG1;vysP%lUswZE_Vkp+-K&2!Rfg1zzeh84;&Fv+s52;TP)a3qZryr6<H3Khs?
ztVP8#H%T%|MBm?tH=KkY_E-YeKm{Ox1VZG;iPSQ&mFgQR6pE9@XjHNSs9Tg;E!EgY
z-$hA>8m(K|3F*Q1TUm`oUKb9ws243IDv(hru8U0cu*hl{4jc?I#krl}ylgl`8Y3qk
zKw_lsX?6HXt&X}2zt8OWvs$0#jLPn&D5BZbxdh_Dv$y-?>UB*K^m^#TMA^GcMlv5(
z>(t3b5Km!Q&W951wea<{kQh$^U;50U``YP-y^Oyuteh|=iw--PvlH6OnuEL+6L0FD
zIXn5^3CeDDegkX)Kn7cNb%3(qsj#LL6`K8t@$m$6is(a=4$Z1!iR*Mw>dk?NR~d;!
zFLp#(;^>*YcvV)c1GOe%8DqOE#%{$3z6bY(ZI${?)K=*iwPwee)!~V~qC|*a%oAH7
zYx>niDh}T$m>7{)3XpJcu%Xy8;5F$_?}`MDOW=U0+PsU;0?rshp0L~+FC?h-Mv7Jp
zuj9k_1U=MZ581N^`~5haSia*Qm3+<Ni!nk6@N#Y+!>!M}0*r$E)=_;Ez4-fv*<7U8
zBQ-;%D_i0OimCNbDe>;_784N6aZU+KDR>*u?1pDn=7_gaC{~on&$<QJU=`sCrUC^%
z_g=X4w{gPdQXExW3S-t3a=M+uTtZhujA+d{6KtLZO~R_-CIL~?>c{nT2?t*;kRtgT
zSrP^QTX<`lQxpv*B2C0oMFVL4*U7K5f=c{|YtNT}Y#s^=+P5{2%&OgAu^Ycavk3x1
zaf^hEgZ#{-zk%lhVtn5~wYNq@WdhJy2u?*5*x<VanI{P<mOUD)2aJRczrJ)>5|Drr
z1#7@Q{*Sp&S)%_3UfKtC1zYX=&$|RzuK$0!TYIwY>i_HTzrXbVf6B+`$KkYdy^0on
z0NZ(<X5BnvEdguWlbUqvfxoz=CJO7e3ch)K@%jv-QJpl7bu_Ainv8|aq8E)<Emd9@
z?Z*Bv$S(gQUiY4!Fla!mqUw0t)!piLcBSU&*)Qj)Ou<U#8l%`OdG+mDz3g51qYoGb
zJAiK!VD;g28fAkzY+W?ZkIvA0*ee_daqM3OXV`qx3&&HA_QLzB1k^6jaTcQo-Nc+%
zemaXVPzk&qgtGt+xF0BZ7+$-~LLl#P<LB;4>!NdXLZ-?p=$eg%RfL#R7N#~Bul594
z?6H5VBH3U-1RQ;8K|ENYM3Yl+!+wW%4Y==fBodV=$hwojpdh$ujiQ)>FyZxj7>h)q
z5IVZ(9-VZ$onOvc-PXTf9{t#8w@y06+p^awdBv|V=M5S@VhE^Wr-a`QP|04h0x>g)
zC%aDl(h|skAe5e$l1MzDK07NP4Na&SNqB@2w@|^!H!{0)2csxb_HKfW8783jcIsX)
zoX1reKkpKnI_sR{m|zF-Cw_Ov?&VSEq6-ykFdk~JO1|6HV}(%VsZ$c!KT5btV?-i-
zNk0|^8$HZu=bqZqQC(e6n@>w{ne$oqV5V9tE3vLn)zb^1X$;RLi_Cjmtvz~Ntyi(G
zUf^ndXD)Bxb(1-)zkmMyYV3!jYCjskfZ7P)dOn}-J$iHn6MWIb7muXqBb(t!;a7lx
zjjam1z{qmqER=MI5wZZ3iEe@(%&U2@XSH<`z7MNv*N$dak6?SBj{LhvvYH>gBE8m@
z16?r4yqkr^YsJWCZ5oKMRjJebzH#!p)joYqNYuWqyb5|1qE!)Zf48f(>UL?*JDP;^
z(8s*Vn3SAq14UDX>r}YIoF$m_BODwYw;3?CL4K_o)H)6)7?Wsm1^C?}N6IO^Lv0*K
z7#IrhK~bCzVrBy<-uN*+kq0FLwY^(uOlJsc*MP!?dD_&ycmcD4A`uL{v5gE@f10Yk
z%a|-i^AIMchfO_NOz;n>=Trc#2qQlaVXQ)+$Q=Rua%+UVsbS$&az9=RmI$zGOFN!l
zm_LZ(PXR^j3g@hA#q~v7K`fckaWlYt2^4@&1-3M8#Ga&o3I+%*oKUDR#sp)yOyN5P
zJ@SE@M3bs_!5Pr0F_@*aJYaJQ2AscCX@C*f{MyGjcK#G!00+QOIC9JgF`iKW8taV0
z`Fs?pHj9Y$C>YMMM<5AC3ydv>(DZe7sj7&19#D8V6~B*TndO15daq&Q=0HrSJqe~5
z^9&)!$gp78=XbpH0-9>QMK~IG@m)L*#@I)U4vnNE2Enm>5G-&KT)S`#nulXva2<dk
zRP~`955wpLuma$#(Xjb_!~j<yb%)dx(2rU0A%sJk=;r8x!ki=3S=hN<fZvqI*1dD^
zHcMDpAE4|HskhU`w@3+*T?OPvrK|=%6;Qf%xui?L!Ix=tHcObg3}X{%MFbTjott$R
zPin}Q;gt}#jM*V+lEL;ph^p$4iRalzT4_cXFnHvxRBUYl;Eam9sX25Koi+pO0a8Nu
z4L?&m$9kX=U4LXt#ia|<lej|?`|rNB%d5A8e4Z8#O~N3#cSb|CVi+t)C>^!>D9M{z
zYr+(H8TMxZ+nr#NG8K)G83LJH6SwEpLfKLDtaaK#z7l)&Tb%jAA_*nn53ua+Q~*s{
z3#Y}ClE6k-z2Msa5Jt1AM@u!~@iU%wp@q!3yxEg05IyJ16h;kwd$`)ZsPs1Br(lp!
zNAhb9N3T~;ME0@rV?y3Of&dpUZc>J21rlUkey+eJ0C_GXlT^|QAj(tS0V_ABfEfK8
zqG0yTVo;K@>R#KfQd|tmp6ZM=&aIMuQ)s!#f9a+!o%hUBB;Uk;6teUJ{Vb8qq1a4z
zKLA1f5@i!sDyfyn0E!H6vt$hdbcGCC(Sg*isX7PWD=&Huspyf`O;uh{z`O%C9x%7_
zIOZQ^)TNs|(-Pxu^-(Ey6O${>Vy2X<S-1Y&OX?hDpo1HsN>O2r{IaxJm+m=TOfo;0
zOkAvNy1!+*Usf%-cMY003Xh7eZL23?13{G@H?XBjl;g5dzL`c3JYCzgP?4tzg5$e<
za$B=(<!)}5_E|H|3j_GjHgu10kg1k}=FTeu@c_QuU(E0b{{X%$ESX}*G3&yRahRhR
zL((GK!)#Y{D1V6|Iw^uGrHexT8(_$6Y7+r2u$<>B4y%r*#FCNXSM%#KiXIb`d!UIa
z9MVHP$K$z`;-unRgroxSX-E>ImtuZ$gOwL_`KwMcvjC%*VqtDb1U*$2r7gaYha)BR
z0T<6=4008oz@#1O0M<k|(Z#GQWr_@iCRmw}9eg06XJfj-;nWwsIT|c@8`#bUZ8ePv
z<>o`Q;jBUl#Wgk@R}iTmQ0}gO2D8Ycpx|_}3IAyhm3@E0n+*>L#dM~V0mpe|F;ShA
zkI%Zz%X7>@c#2u9PEdcfo&C0T`U>Y?joBld&(w9OiUN#Y38Mf*>8dTbYU@xOU@seo
zuZ}xjoq@gd2MmSH9&&a^poL?UkYHoe#2z`E8`%uHE_)>a**A+AhYU$r6!4oeZVzCT
zdT!y?u<tw~f!*RK)?mWp6zTVE2g1aB>h{ZBYIG2JzkA(2wg;>VpY796YOA82d=%+#
zn>9c`U9*JG>vUp<ZWcu(#pA5fDLy4Et8fOKQoQF>Y5mhOi9M2a#OQ~jIL2~>7yz^g
zVP2zWwr@h^js5q5DKm;9R6WoUXf8Zu=FAtN03M<e-TzhZP`c;OJ$|oV;s;-5kQ(Ok
zzEw&|*!<)p{7n!qpM|!g8yMUV!3Y{K`hq1q7w5H_dQ?6jE7<tUY}sy^>%r{J<F{rB
zz;Bv}ns&JNJok3$_O_0d=)QmZ*55|6V<_~^_ATDnbIjsfjDu-kYB5-I?)k`<fw}<%
zH5}%&G5B`hc}#b`)?J(hzP=26egl3+1G-b&+ocyTp1CFJf&vxDz+=b3BfHVw@<#Ck
z4cB)wT6T&-q1qF-(9XRb*uAF%j~&U#5gglPoN-XH%%w#($||H}Cl)kdwfiycjYq9k
z%X|8Gmz2pf+Q*osQ_y!<9;3k0z*x$5*3MXme!W7t=&~guzy{e1q4(xnSq6L=fReg8
zhKMz(2v9>(+wY<lU!Dx;$urB!Z9tlRZn5M{yPg{VzE4>aaJ^82nkLq=Q6lM9t^Ccf
zylaWImbL@mI<GPYqE~)gN-d29_L)fb6p}){`>-68pXFou>|QLt)%VXIQ#=qYbe0US
zT!eTzjLwWN?evqr%jPC%558^FfS&^EsMVj^&n@~)yl;R;Plt*|EKZWG$}J`awP=JN
zZqzWr#BgM?L3cFzI<W?{w!n@&OE%JDM#8AsOWVPqz8r&PI1Exa)Sl!ZQB+s}2SQJh
zXZwj#^%YRvxerzRwA=Xz2PuSi>h~i|oE4F_8L)-5Q<NQeo+JzItVD#}6^QUSMTETG
z4pY5-vb$Pu)dy(_cs@>bC*AKvmEBa|k`zc**v=$Is)7{XsV9p+UVYS_tU78>R~ofv
zD~y^Yw|vZ&2Q=%cxDu8%rp2Pg#!6(e#WDV`{LkSv*k-N%EO*%qw(W`Z2e2CM^wTFx
zP^cwQ_}6e6#I#=9eY*Q>=gID~C9GypPa^z(n9~e)lAZmF(Rlx37)`E7-Yavh(td`B
zMQKVtOUQb>T*yLk>T#x|`7IqJrJp4&8pBbNbEjA{E6LlEV!@Ngk9V>g85jXdeRO^o
zm$%%{S8{nulAolOkwIsWkB-YZR^%Ehag6)9MJ}gEa*0ozW@CT)ubE`eawi#}^o6Ea
zkTs?V{$DY{hIz>RpPF9FFEPj<ffInOpnc0!zlp~t`cT|^k7G1$qRzFwBxIh(a+f)e
zM%p!_0;gw3o8qYcxZA}HHQ#2*(z0aWjV`$NW1U!H8b5L1CHyE-)op*r+rvNge6`Ov
zy>d;D3|k)UV9H644MQlU*OT1}s&sYC2N<6Wtqvlg?C_TM0WAcJ=tnFjv)z-+WAC~5
zczcJ;Ep6jL%V9Uv{nVy{6~x@w3gX)%!O@g9rh!tNYy;hKBZnfndMhd`%`ichI;puv
z(GBMMLc0W{l8{E5AF-mG%!K9<YQqP?oYKdzy^UyQ#;|Gh0uvyE@-g`;um)CB=7Y~^
zJhF*BF##l(&KHY_lN=&yj+|xFIw{%QGkd_9dZipDms0)75)q}_WQit;utksh<(m*|
z?Xf3lE38vbq178xSMv9a*&vc^<0$i3mVT1j#9CcHUP;c9)@5#IP3?Mu-^e&bz2DGb
zh(@98{btYRRN0w-lPt?-t}cZcUna2OQ2?ObrJGU;qK4yDD|-c4+}f3SS^t%<3Aqyg
zMtiOI8*Z+2H}xBaw=<)iGU@%z(j|&n2z&WMU+S)&F*)k0A3$F1mZ*%BRvqT|!Ci&J
z%fN1W?|9!Y@R-p~jnlTVHhD!pPMG0y&!d!kh)2u_iaFd#BxZ^?zz@jq3opevr{%Ty
z1Tpt%oE?=d#^PbLHokdhS1K~e!yDXyjS+#7_#;x+quxP5x=}WH+?KD@_p`->@5Sj}
z{@R!8bg_=Y<|e3Aw~<1*L=x)Iq_7EI^*T{RV8Zy?WUfZP3~kqzo{l@KO-E?BVCFQ>
zvv8zcg~db;xnpoU=LwdYo9J4MyPoB-Nb{o%LljJLoCs@#Ae2@&-x^FXQTB5m^@v}<
zSbOuEXwRgX)k2KeTdE1@&UTz~84LEoog*B8oO|e)O5M;I_L6H;ykTkm<<`S*_T9m~
z%ah$X={ERt>O$+Pu3GEobf+70aFWm%uS)vF2_;DvB1>XM5Fu~-qXp*OB~y>_G>XN-
zcF1dyQl4X6l^NQ!SkG$SVv6(rq|B@F1Qrb$XI=-KuUK+^3NV#)zN}qOFnQc{MEr=y
zJsb?g0G9Kq<7^IrxlS_n7j3XLnG5GQKwGo1f6E*uZ;#nY?e=-n(Zt<6)c7+Itu?4~
zxGQvsw3zT#WMlbh%>9(x{vSSv?KPaJU=@AD=AL-}Aa+7%=s<x+$abO^^eI&{`^VrM
z@!4z}vw8-`O(vh*L>UmAidOg@bRe~+c?Dxz{1+W&Q_`15FA2Z@`Y%Ue^i|q9Xi~CW
zV^qsuksKB~a&DqIOG?x2m26QMKd$bOj!`n6Wj)Z=W{n>^2oirjniWse6;-nI^*fL~
z_wbtqf+n}&qcUJWiJ?hyvDqsP*HwY47ph)kWXx04{>04omIspf$^x&iIaPK6-ax&d
z$a!pIj<$LIYu==g|0o#DW?)|UXl27Qf=E|I2Q0LI^ReZL-gUV&I;5dNPEP{@IX|Gh
z<wgP!&Q&Hb(p{g934q(d0WW)M0xi=PGpl2|A$+CW9hi4TGvr-lxP|qLJrFNcMD#()
z-hK1OR>c*-;XCjoS@1{Yc7|=Sah=$NQBGav&68+SK`XYh^d&AE3nd>VBtNFJ4bVrD
zYWgG;c^kEjGTSW8$nuQ@lnhDzRCz`qlpFR3@$VJt9wg0?!G4N6w<%<~%<E;x1Zz(d
zayrX(iOA{J%svNUgoFpH2j0})D#K)b@wlC@576p>&pL-$JD7^1WtgFnk=x-oRPJC#
zP?D6`;ty)442GvLFT?R-4Cm@8T9U>QO*Spz(qj35cWsnO8%<R)`s9@#l4d8I^%o-_
zr>r=taH45yNiPqY18z25)Jw2k7(dSPWi3%xRiHPfFh@8l&eO5rB+`7g;);d>_BJb&
zN;<Y%mhNb2MLV|K{hL~*t|0?{dP7R?N4)2_+sg`C1lkm`uC;P7OI9^HOdDCf<r%ur
z2q(#@4ye|uv;paWI~gl9gGe8ZJfs8{i3tvq7QHiL;^hA9YQg&(Dd1o>1pb)MSIVhx
zf&7q6oM8#h$jVsB#$xLU3n;Q6p{rv!U}r~`J^^I}k}GpgpmLlR>D24cW*)TiZH+$H
zCHX?p-$XHNW7H%<v&jAvj-xtpdOYFcqMR<~6e~kRCNal7GE!ru)f&Ph=@`XwLz!X1
zL6*+0x=nTfvD{7CMh8+1Sp^cJI6zoPjDJUtMb}r|9F)a_Kc7<ggo5qM<nhGy9tPHu
zur>{A42)0?Gblzq0i9ILd58I(7;IM)^70D0A1Y8tXlm@Eq8FAd7m(Zo-L_py!7!@x
zBJ07$XF|D5*mdZ%hg-X)gJ2~>z(;azjPCXBY+|8EL&7_bE&5lm6f}=4QBvTc(#EbT
z$`9>xpq&lGFyEo4aU$6|NO-5{*IFH9R=@3GqPdmY37Zt=DwvQ`2RH$*BjwOGk6<05
zqR0~9tiV{b3>@jLwu-|DUZ5NX_usN)+_elS%MF|?mdFKceP7zotCgcz<!V{h&|=yt
zR>CS&fz6pn*r$s?O(x8)&aC`Fn$QeX3+@Rv>4llndJ;Ck6de6#2I1P}ej;)qTe)jj
zQKyO6(w**P>CN31uKoD>i_tifo;l=L(pQ}CiF5k0Uf%;Lr5^ZX3IZ@%4tS`LeS!97
zGLV-O3;Qz-fb$6JwOy_@`WtfV<Liq|eHdbAZ$CC(<r20vniwwb9AqA_$c$f_cChG|
zZAlxBZZ|sYH@Q0jTEHis*~%*k`wMu{8BA|2*eB+bL)dqaJw*$3>|^?a@a(<Bz*Lq?
zifFY}RlEqp*luu6k8XG?mN5Q!hLcDMHz5G$kOjzk7gOBjCKL<H67grjKNjek?R#4_
zkb`ii7fexSg=cxKwFQYJf;~4JYOSDx(<A3=^qFDZH|?KXXb{1<02>Ksfue@F<iisK
zd&A}{vn}uP!dyun4#Dv3i_ZD`UcnT_U5|U;jW9j=O#K?sK?%<=fj=-ZiX1P{cL>gQ
z&LIOWkoR(IkKJif&)D;=Fe?PS_SR)%j$@nyA$jsZ>%_fmyTtp^Fy{itu=2A}>JRqv
zOrl++c9zq|IhGU!EsUi9tmL`cJda-1m*Tv$oQ$=-9NWtKQMTv^Uu#b=2GO60dOz69
zGw614fBX<~7ZKb}9r|KnU*AolpDb6Wa+ug*dAXe&Y9xy7E~U%k<wIKE%dtMapDbob
z6TMiGC@a!rHIjTWiu8wjdB*TANxpsXOd*>NizttCW`HTjRM}1SH(8F!vb%j>xm_xU
z#^cM&JzhGKO}QsaXR;~xblFTc#hxu4w{Mrv<ej}7)8h27-LHB|iPDK%kBl{txXWNN
ztT^f`4*H5?zT%LtIN~b~_-f<*#fG~tTlyp%WnC`Y_kEerYs;a_WTLy?4DiOzt@as>
z2=5*Gqxhaywm+j4f6sCoT#3Oa92l`8J26^iTz#lGLAqCS;^_CykOa7d+o2Rt{(cF6
zMQ1405*#M0FJtVPx>rS#-k$BGxDtnVX(Co*wjXDjD9VF0n<@iEm1j$+GDy8mQDtx+
zRlZ%3DuZvCDtOdfQAl?CtB&&CfhX)P6Eg*8Yn0Qql%|ddRWB#YrzLI&<kG(Srmw3?
zvbmj2impmpUDo@Z2ljsF{@(Ab-us^E{i;G=e(#I?W4W|vecTFpa$jzRJPFV$Zx`Rq
z9)@hDktV@|M(O@BT6u)z;GE@a@<-3m>?4&F$kLy}0e$t34eXBnHTnJk3d>11?L+cE
zXyTAg_(8oI?&Ub6{55MnhrId{*<*Q^{9Z_1%yvn=zzYWf#)Bf$hu)o7`%-LYQX^KA
zif^S0B!8V}+a(D)`MbAD(1Sef-}c-4SgS1sTmDxLHi2M6Uw&W3F?tm>;1|Zt*SKXw
z#=%cg&JqB%r1<S>;vXn*)b8KRT#$MF8mfMM>+~z(LARt|+1<(}t`t~_hu(+pvws!7
z*{e6p3?(}j6^B7fE_}LQ659(==?~M!Tx36mntuKo4To_sU(r|1^w#V1FESsV%;}Qs
zL|ag*I~T@6r6lCiLJ7R!IY5I8x^(#F8}BQ@#Px`iI}bC1l~Wukg2)PG?9cnxWiPl5
zIq@C01cS~1z2{{1%6-NkCAP??+a0`D)BFL-<825O#JeSxE6|z}w&{nm`*239a3qz~
z<q=*lP2|!Etr;03pwQO?cJv~o=y$c?!s4=arWZY%1<VV2_W<lJ=A6!lY6AvW6j^b`
zw{&C;qs%S|odgP+u4V*F(t!g{?r`_ltvSLW^1kV3dMSFFrFcskz<XVH^w~mpgtuyx
zkDJ`u_}WxiQ;Q|73IHv3Ox$5InAg@!^JrROyE?fQ(<Y#Ul+gp)-SpWQe&6d?={ofV
zOdyz``1m<@cprbbrZ{;Q$lvsBvlF^DuF{H5hnGv5uVoEr;W#7%9u=N@Vp%aI7)gFx
z%sy6XE*WAmyFp<;dWL*uPZ84!W-FDzdtsairm0d*;8UK8Y?o3sIBuHomu#|xSqW@o
z8)K~mi;iubf<ej*2i7F!x5C?Hvh<1VRbfjynmcl2G_N8P!Zkfw!Op{C#)VSS2#JU;
z?Nn-fL#)Ce(m$prsa_{7u##yiWCG)6=Y5CJ_dLDM93;?2ASPRHo(0gD@(@GgGGh`C
zEORunsR>=3j{H6diR>x!9%f}90pT{l1_%g{!kwC08lK;a#0sBmk<bKd5j$gkG?Aqa
z$Aq$`4BlKLVzym_T}wNJsc}$Vv*Kljqt9|K<7d}pV-Mdl(5j~h&0vtmwzdpe#1<Lt
z(KQ7|t~Ghk*-#ARYs6gzwxmd!h^#yRJ~|<+`(hpM?CqJBmCE+Q6#&>eQ3CwB0s`QY
zYoci;KhE-KI=5z4o#Dv@`q2l5N`d)+VJikL)zJ-^LWkaBqC(5IjEz)X1JH^RopL);
zE1M~t>J2gH-2SM&$}C#DLzaoxvX1ZkfgNAoa}nAydXM>{a(fM{q+dp}-7;GzcG)6G
zMIOM{Ii6LIByzJq7{t6_6i*Xt$6f>##*Rmv+JB4qq|j&25o;M1^r9*`B(Y6E@xg*~
zdXsruQK#v4SDq#rOUMKVTf}$VYrFwGzHE2STOBiO4i$2`PMa7RcbVNw1|~s7TCGXR
zJ@1an!Qb&p7T_ve>1u|R5BQjj&=MG#ruKPo<@Lvd_zk*jF#5k2C|g-s8E}6r%VVC6
z{DQwHULh~BU*qp&5t_qJA$p>UZ9~WRb%OP18cezz{X2Jdhk7X<`;&!^x6OUTIXmW*
zIm&UHY@1-ls(CsKMt9^9GVx$cuVAI(31;R|lIgH#&r!!HQ3;D4S!r*Rm9`F`i6kvO
zQsLF<7bk;F+Hb3Q(pSraHf<b`@NE^JCFTw+e2VW){tk6h6w?7|BSS@y#sG7m%zYBy
z5^HTlwrjLfl9}tQrIu{2Kn0SX(K)c>=6xwRDYGI(oyTq|OkHY4s8&k5rEsls1$UET
zJ7|E}K6=@0oE>@2{1vOi%o&`R<TSCC2X`Q8O{OX3W4#(hJ(~7786Q_`xm;Cmt<pWN
zm@@-x$K8kYa`{#i8k1?4HujeD)6Ace`KMYFvGQ+5*dYB)1|#RZ_W4Wj${y@m=CX2D
zYkw4>w`7s6V-c;gSNo);`mY^qoqclIh(Fr=qMvmuL!GxYMP1dyypbN2L`zxNHYuGN
zf;dAf-<TpmgK&Z7z#vy&&3rVQ<{URDm7t#CD&Ry4lRL~J6=TYs-ki^z>u5sVNB<d>
zBQB1H^BeMb#Y_@$9Q8wTsU1Z9g_YVeL<3!vZ~#K#Lh2MaW5XcuM{2^VSK4DAIx(Mx
zavouqS;j+Wlf>PSTcP7I_Z_uJc=$nF%ebS3L;M?1=cbF^D2%Vm0A&y&_}*fUDRuC1
zKbT-W=*=UHqa6S_0Y(_aN@i0SN@R`*fJ~9Jb0HSBeRD0RYTX|a=-^NnUvs38K?J0u
zHpzaS;J8`;U{mH474aSoAUe$R*{`o>!$flTk(*2yGbTL9@+!VY#?V8$D~DrBvS#&b
zhFE|oI-$&cn81QqNTR<yi#p%8yo=LUou3-#E$`^UJ3Bx9@#wI1=oK0l@EhcmpN=};
zpI&x6C~@96>HOlIzVaF;zj!|!og5;?TR)$jw=OQc({u0W_^f@@IxKrfC(ZWdA?6)@
z2{lhnJ6`+f_^1P5JEzp706S_yy;lI_xOI*R2|JCKNA07|FJ<r5QRf7qz5=if@2qj&
zIci?E8|U8H<@wp^MGH_k1i&XpC$G@Ivvu4$=|GR5Wq9hfeuSUi#rKVNo0@A}LLbfv
zN0SNm`_uLz@Eq@D3$P>SQ)=ww7hIq1#?f)vJ8T>`Ubm>;DZn|Wf`Z{s-?!)ywAg_E
znv@V0Xwy7B>72t)q)q4ayrV1sbac@wdyVs>3na{|^HXR52@7>j2@KRcX)zomI${nm
z^yok#?91gv%iwd^g1zYE^#xY9hZ0EfML&=Jhh)9}>!UvT`M-ey_7=nH_2;*-JpXrX
zd*|t6H~)9-={6MqEC2VO@BzVy2ii*}3Y@_%8cu>(C3-cYMxR8DZO*C+r^VTO?`$yw
zL27_m#AomS{{C(fV7l9?zfh@gzl@mSeZHLGeHlT+`!bS-_eDev?@P%V-ZEi>2l6w;
z4e#^i4Z-6xB@XY4h#cM*lR3OEBy@ORNb2yugxKMIvfRNr(qyW5&*S+3<I!EeaGwFU
zz-Or7yMP1gp4VZoak|ly+@L(yG427P)23V5J;m!(hC2#9#sN*HlKu_TL3->1iRURE
zA-sq{wz7u@DwTOOR8M2Rb0QZ+6@Sc0T}nU>@8AR)_5oQ5j>bBRf%hTwg&9)-gVK6d
z8a6&}OH$Is(5Tw+gl>Lu$INeyqj@x7Jj?^hY8YEZg5Kf^^R@|EbJnU%5TA?A`OC{!
z-NV+a#$~(Hy*T=hmd+fO@y@Gl*LT#}I0ptSzH?d*d4O~QuTr<u#!GtfkX-|UTMVVB
zarQPXq6%%`m@cKrdshn3ExT1sg~-V%9tZQTrfa&MepT9+n0S=?+``ZXMsWr#7^X?F
z88OB1UR<m=QjKnkg#oK^{VPHsr%85|&FgTCds<(@$WaN(+S}!sl|VIJcv&&0NB8tZ
zs@QnL{<xS0x#(nc!fBA}P3N<0<eZj(Xp_M`Z6K{Lrvp;bWzv}gHg$*N?8#MjY=fXw
z8AIb`PdNh$MsGg5a{)SV$jU&0%IKSb8VBQiApLt*fWXKaLdV`|K3j?dmddT&UpfgW
zf{#0nyw>pEP<St@_<F$*bz%!%e|ox(kjW(0MBoflX<h8OC`bre^iZ6TkLw8_*3{P<
zPZk`}2m&}1y1!CshwZSLvVR$i4yCoVw-ORyhz7=qKc4#ifV%6awy$)zS6SI9q$SC(
zp+-fNoB1SNdAUksDz)H?Z0xK6LJ2-rw$R%0bl`RuvlUoD=16TB;P>_Sex{L{Q(Gpz
zaqb|kGCV6GxZ0{yI4&7PqpN2kz0nwKZQ(s=e|1E<iwRwL+>g)aw6rR-TdD6>MgewH
zOV1Q&z%IAKcxNMhA9XTt|ATPKW4k${^EQWDt}X$%Ou?-EO%B;)&H41ARc!S`xaWr+
zZU{FAyWTuL*xe)9`d_Vl`5*Af*Z;xaFQNSV|J|qmt3P=H-(CIRlbzk2zx029#^=%I
z`sSwhZ%2bYj|RN_!K+p4wP)2@^(kE_KH9E5s_nqny`3j}^=)q!^@153s9U#F@87U4
z8Y@;Xb$Sc;Jx&fUU*T-r_9s^hIEF~cYBaklduNx;%6S--y_YlppW(<WUeD*#y+@C3
zZf>e0E>yw_7eQd@9Zy8dq-<6PS_z2iy>&b*>w_h^2Ix~H|H@PyIM1LssT0i80#pS)
z3y%xyCN;Qq&%9P>Q?`*>!FhY$YPT8}E&aCoxR6yFZ>iTFZ`Yi6TFbLmaPN0(-+sHx
zO4lSMUEoS%v{pE;dPl)*5yR1V9QUv9%3izbeP4xhz4t1-S_C01|H%8s`>E<R;dB~f
zC&_Va#^DYzJ8(3fh8UEUOva1vo(FON1+>3WvQmYwVY3%UuTL7C%X8@UuiHC2P^Li8
zSfk>G#Z)nfL9%_Pt<5$_gGj&mr<IG`vOilZR%#_e6z9k^4i<x`5>5s%IpXz1mGjo?
zql?b@FGnYbt)H<X<yCTuv`&6JI!A4sDN%Dvyl$VqY_u=z67`ZZxf~n2u(Vc8R;$2M
z#u;Yp3=OAnKU~E7-Zl#Er#~e7`pZ$PeYoaMjMn-2`Q^!4J^AqBmy=H8=e3>W^W)a>
z+HUe8{I~XaJ*8GMh9>&kzA1#ead8vhG+&7=Ny&4KQ}*?U7;6*qjl<qPx|xMgtOw_!
z_o5^lMLz1=9t{>Szu;7Z3#EU(n7pSkR1MoQj$m*O@Pb*Q`7#SBn~Q;tlD8TEvy|C|
zpAeTc0B#Dwz@*Yp;(wOq*<xVzaXO3U5hYgQY#QTec31I@N>J0l?hK<SSdjh@kT7`j
zH#m&w#v}Zze@!TgnZcpw#~@IV7h-bScTP@ET5GaU+!sgfwY6>cnM5dFOH8*;8=27M
zMeF>q(P<>6okS;IOUycnlf0IgcO0{K4JMxR^ws4FDU8?Fp13b`qiatSaK1lpH4fL-
zo~;X~f&(&!m&Vz{!QlK4emEi%MT$h-G^VymZgO;T(P=b)SgUVql3oQ9OfKQU5pL$I
ziweEHpotL!7|;SoEW6*A%x+;GYUSj*IEqrBZ1U<Nrib`iGXpD1E&`kz?EbZH)y7$-
z@_Cu{m4I+`(rLXG5Ry7#e_i)2rkOtWC*gE4qFIW4qW$9R$XfrKlI`K<|IgmPY`2kQ
z38H9JpI)b%7~IoeaE}KvB?2S>5zs4>6ckC3ki<%mRFPCXQlVxz00-$Iz#Rz(_{d0A
z*C5wAJ*%%c^ZN-kyT5UVci4lwR@bQW?w7s%0Z@-nW@QN(DFW_h+sw9Y+qP}neozHj
zCPb~?&@3~cLsgX?@rTNyO;?a*4+~mimYBm)>^hqBa4~;2fuZy>%h)YSWrmqW!=zG#
z3uF~C7Pe+C9t@AYBDP`KqM`{NT;<o%mS*o(jg#QKTOBr*e%E%$A>{^@ER-1^p4@uO
zm2(=q%8m)0kZLx;%wh%-Su^VQ(Wl2+6&0S{`eSdWN>ZWQN%N7&=e#U$JjhIaKEA$x
zeQmP*{vhTsw`iRFz7UX$+@P+t8`BY7*CkWTy!x|=J=>|aseJJJxj!muyQ#mmiig0Y
z>R)~&NFW9$=*D?7NDhk<w_OXb@r{YgV%m0nVfybqu`0{td(W;)qge#N$Xl#aQqbh7
z+a1oIcSCF#F0KdjE=vVj%ZfCv#_|s9#JqPP<Ze~P*wlNYs?Pz57tN;@G3S_#&2Y6H
z<Y>%S?aeB+n?zxH2^8-<1+-~Va#UQoh%jwBUQoS=s+?;h6Y;tj&`sdv6Zx9if`>PN
zf){g+m+#F#7r<4}bIqTgO_ufLrd^SXy#lN#!}=xS(J(UmX#u1~{G+#Eeo<>txZLEZ
zlP^GE^+JhI3+gj_ZIBLX$?8y9EZ<E8QVtEp?9ZN<HwAK(e|Z+XtL#N}!s2!p%o`h&
z6puFY(T9<~O@n?Kh8D{Ur%#`a^CuAcjownl?ZY-es*+-q2hqh1SY+Z-ftLG#9EzwQ
zc`qtRJ`xoq??DC0J5hl(4as{<gIoQE)9?f8azuH@iaTpk@EyIH&iUAjdc>mH=~I}4
ze2P6wG|7^~XaVzh7ZCg_m`=q(Fz+;z4=}|>;Y;q(*aC!j$OXgtEK-vNQw3%44ttGr
z4~QBxag1_$K@Fp>Ew>M>67xt)XZnCk-^_A97K>n4x#bL%KwlTGl%lDV!zRZ3DV)08
zI;=#^*(PL{@TWchEU5S6(J1IUia8=l)=bkdT!rt>@yX$fw4UtQ&Qa(1Wc%nOttfl8
zvvb((c6Q)JEA!&z!AV+4CXb(_wPe_A=S5me22VRDFScJEchYJydV^K=Uv^g>=FIn5
zRy~66F3)`lS(KXMF&svN(a4Vikd)nN&Le3GZL&aXV->~lAd5Ij9xtGTIr;REK6tTu
zO6?w`haDCO9XYxy;dWdtZ+YZtzgRhkSZjaShc>c!OtwkG`N$jl{b`(h6u=f)6K|ww
z2~l-rMeT$fKA~QTs*a{u_J8H0&E+kjLWjX{t0=E;Y^0{}pK;2r46D^z)|(QurKaGe
zs}8FxY57(FX8QtCG-qEArTaQ{yT?~CcHuCwS^@lMy@u+T&Mv4l*40#fg_ebtNeP~=
z=?KcpAUGQNG$aa<K+{_c;9#$tu4V#fFKk*a2{HpGL4E1SNo}9$FosN7+T+8649>7(
zJmv9vxeas1+zd5Yj_XNv<@=JRCleLTE0;YG43zh?aeby3hS_yu6LC^iD@!{pr!N8#
za@8HrSr)?CatIEHS*-gXG6b!+5sI&oL149HZRg{OKMQ*y;N)7E4sD7q+qYXmPxA_a
z@9O)3N~$N&b7limOv9@2tKF$Hm$KRVXMKwAqpF|vH5Pc^%r5pFlzLcz;>FG~RkjQZ
zI9!Hh9%kd`cyLIIq%xHh?`&m>TH4w~fBHbSt+_X*x9ZK$Jm}Cz*bNNaJG!f#3p5T#
zfjo1A`26tjw>#V2Zb}Bi$9M(b%slPx9duIS55XV-=x*lu$@X3s0D1RPof-Sdn@nf+
zw~x6ql_my<wfk4i6eJ4)ryM-V7Nh>U<?vCqAdeu`GCr&3UZV4y>2F&c!5LQ61>X##
zMa7h2Arj?1HJ9ZvM&FYRxRS4o{4WB$`co-&`(AKCo+jygWxiE@9>>{h7t^gZe@c{U
zOK7s{`0$(~Y!Uruf#iS)qhY*AZN+kD5g@yy0L1I`Q9eWmO7<9>29|tGV9+x$_{hT-
z@=rQe->6sb1}KAdfN%~|o;Tx23UV?HWnu9*;;t!8Hx-t#WdY_-H<m-FH!Ukk&eNxb
zQfBd>#U~xiFT`KT#v2}Pw^m@~R8-un^jjn|UE&AcT32hRrReh)+FJ3;7&|st&4Mu?
zjsZk>?qlg4s^W(c{+;>ZD5qi)&!_!BSEcuab52x>wy*qhWW9{$lVod!9?z>{C4lw<
zLK}%GiS@+-A=}2tPiBP$sC&tIJe{2;)BY<m7uZF=tk)D_PnW}}(^KSCn8|%QGtk4+
zerPeXz_F`%%U&06Kh74VnBzzNWTK@MTho0Gm-0DW%I9z?pTnj66@*JEDMPZK%l><T
z{r?|;6Mhs2fW`Lz8+SKa_tN(N_gnWr+y8%xk8S@?6D|$_4fvne+Sqt_r`fvGdgwLp
zZf>+TTlcf}|4+yrF&IeLaME1n8t#V?yBMS_^`TYURG)vk7Wia+Z#@|YW7i<RbND+l
zc3mMUN?ZfDKY2d%zYAmUcYB9h1^{l@Ef8}m{pv~|<S6tLuX*&%iM3wC=qI-J<qsg-
z_A7s=Vj2_pQ-6$kwI5@QXajSNUQ94r9(h^(?i4oi5j@PEAonHs%1<TB$A5@+oI0aG
zWPQh%?DzjxRo!w_Bfle`c77vS>`^gWp}*uKg{`p@DvZr~OpcxzE!yu+1s0WDNdc<5
zMG-`Cak6I4!bT-+s&tg@13Bs1kj;o9>2s!n>5HJDCRw4sFOhO*|5U;sT!0`!5!*d?
za9Q*)gc@fzsS%(o0(qEjcTh}B&B@Awe$seAV&6MO^|LuY{*E+q?DU&D04h3KGb26K
zXHkKplw3?BX$Y`BytO~%T~XfnV$!)rH0>&z9v-ki@G8*Onx_rzdv<?UD8mF4q5$*C
zHJVj*0#A;azdIelA=5us5TW<_n#Kh0eIbXN7kIeI5AIvCxWrHPx?}FbJ)r3A-aMkd
zWsZRpKF-Oh&qO~57N{l$t7LGCOPi5^Sd#|*0SmAoRhj^__GC%9F5AGvqY9dfPsL9{
zj%RrYLpEgN>SvZUK7aoDJ`4Rn`;Gp`Xk$tIx8}x!bo{pm_a1)s|NJB$*Z&hHoaDdz
z_fYnGa0mZudCiBLcOPyxo8IVr==yz%bKumgB>n|(MdXcioq%U^(pGH2899kPGJn)>
zi=8_i8PWJ=2GeO2XWTWz?4z6@QFsYPUY*t!+&}H7TrQ6~IWnj9z@J|cY*!E+#HnJa
z6iYo4VbyxVIi1oECxn{RQ`LRv;XFb^9`1__;>FS7GYmhxLJq5C+7BdM9r~)BO+gT*
zxW|^yCY*v_ygXT1QFXm?Bc9L7c2)R|`D1V<WoOi3esD&iYwZo$ecT!T$_Y0z^Tf-q
z-IUV!ySOxtdNQ%0(-Xc9@$i}fW81)%Xji12_mDdL>UH}kkB8^I-6|T8!iTD__wO|+
z)@En~!0*rIumRt&KB637w-s(}80q<NqT38%haXjJSmPi`{Ih@pAq*!#4zpneC>_&K
zly4=Q-mT>Os9aMm)>Ls2B`}XyrSt9H$?4PWz3$7SjuQ`sn(O;f6wjRYQ1@Nf7?+1O
zy_}}$eupts!^0P4KBA>ty<vCe*!9BEV+@EjdC+dJ)>knaL|!jZEbBw3C@+<`AD3yN
z|HH9YE<_jStbaEgr%IQ+GK~SNc(261?6vm_2?nbsuNwdfN^NU5MJa?SgEsk{=hc-6
zEg6eE<aUvMJCe7!=Jdmu2}+TuFkm(AZl#Q`%T;(#QL7<LyzgOr-<PWz%0xBnPci>W
zG`iNW5_wgy7InD`Rqi~#^e%!aE6Z~V)-}L*!qMnW06s!^NiU=tFU199q`2DNaV3GX
zBXqJqo>ctl*~P2ybuFp3+jxw!SyGG!p%f5~Q=BltQH|G3ZxLt3z`rsMU`R}dRBYq*
zmu-r(bo(~m9Lkf8s#*W?5DA6C>jMMy!bjL1htDtZWfu~*boEOjY)6qH7}@gP1i{1$
zRR$cLnN;T}gRz(E^>VeKdh#YT)hVpX`g%xFV6d``unG_5>z32X+e}M^4PlfmqS(bf
z9ccg~lh<c`U3Qji`B;}v?MpHm;o5{q7};w*G<m^u^~XPYYw7_^6|)?*Mz9T_P0Ry|
zEAoskUnEI|J#N(&2k**5&O~?CEF~GD+6*_cLriq7f>kCU%nsSi0=Y0i>?Nr1Yt1g!
zTUp_<XgC~SMv7l@X~vF_CZgdjlYiK5Q@SG{{EEyMBKAueT2%<!87V=j*TdIpU)9hQ
z>2W3DsKA&!VZ3ZKL=iP=EUww<ODqW7t9r9)af#!XJ3F1@W9hua2MTSTfoToVpP#I!
zyh?v0)=Krq@M0a!1?!JTjfr6&yg|LdI%G)I3+>!rAR4P1d$nsp$C|iV>BL8>J<cw{
zJCC~d4r>z%$|>-NZGij~4X&gT4LS*ClNt51l>i*>Yi)>GIimjbRHa~o?X3QoFQpO8
zF(>0uMsVeJrR*8;uUb|$#{L!AgP`hzDQwbjx7MQdrW8Q2txZ}p0H`%)lYVUgT0o`0
zPcjDKbgJe72$kny!IMe0YE<Ll+Lb2lNSY@45e|y!NghRtee%jjm_VRyYa;8B%G@E{
zeKqN?ufJ~Z9Cfx&I;Y!Dt}2HwPItP8$FPOeHelu#72cu3+ubgdY)V$zx246!k2)tW
zj}E8;C(M%B9}*?Lbv7e5OiR&FK|~7DIZ8|lqOg|-FONIBJm1nrWk?V!lNuFo)+$f;
zx}CM^y!s_jA}w2dft!^GVWjdpM)L+wwm#aWO1v%dzPLr2B&*vKEbsK1I%Gpzqx`cK
z=TVg{6fLV)4kV{qZ721|+1BOh1wOSG;Bd>@sxjLbSu5L_BoP+yY?iIdvluf5M%NxE
z$E0H_QNB%J=`GrpNtH0ymfgVnilZ%Vdcr6bS0YPEbo{^?XuvELt0W|FcT(n?b<WTR
zv^8ui&LRVl;R(B~;yL!^DKX2+uqIC*H&rpkiMjhU``&Kb-3zhjuutRt|0awc%{xVW
zFJJb`nz`<((sEiTV@ZBJBF`4dJLGYfuw@)<P25R#YkIfRb>@*(3)>j-X<@f&TA}Ku
z7ek6G;gp~!WtX#Wm~?(fn+wD{n{2mSqV*C*Q*99w2?kci)@YMyhg$?~y{!ljA3riO
zMLCLX67$Z&3qf1AZOmz<Zdc)0h?LSDM)CaYT%yYmb&`6QKqL)XD6&fE*F{@ahmfB5
zE+JpWG1YD-%ju4)5uR;sV(+7f-oLcc>htHLeHQ3{N5R#n(Er}uxZBF;fA2Rx>wiDV
z$JYPSgx4;-R-?7iXf|4?1OD}$X7f(#uGhS`dH+|NtyWI_KM=LivUWT2N7sJ{rZ>L-
zS1Q^*-hsPXTQb!QmTPjM$2ZgDE>zm$xNo4LrE}agqo4(jd=sTDt+3QHGPpoH20aA4
z<*bazqY<PXb${3vGXs1^Rs&WIEVGv!pjeNG5Y&A*RomX`_t7dI&N7dus}hp#@MyPl
z<Q;X6J4au4c1?m)@hMd{(%-^{@g|58&q{Jy_M<_$=9TG)k6#8c{);CX^*0=r`Odf;
zaM__RZ(&QLKPsaw=KI!#L;6jWfM24J|HPQ|w9FN!!6fi!sse9T_<VLA@Zag2+JTkJ
zwJ*<MCsySf4Sdw#KkYXD`<VWHMF0L{TNQl7Cb^I49m;R~ji;Hv2l4Q+6vu6xZ(P+B
z;oZn7;OW%NE<S>9HG5L3H9h^+lB*ZR;vgdgS90Y$64&KE=U+6p{g{N8W8V&y+|)y(
zh;^^&J@$H*<%P_jy4(&ft^5&OOB*pfZhQON-%=KblRGUHf|m#amJSPU*rW1DSb^ju
z_fXOv#nD;WqzsmZpr3XNYbsrD)(QfLgO(6ARaKw8ddf266%JA2K%>PD8|w7=WK&XR
z4&UaOIaJM|JAJ}Dc)5S7R)mx4@<dXHtf`d8bf}hW%W8>;wuDD?d^!xTD(Lo1_S4Fs
z*t?9U15Onm1s5=V;-(x7>|~UFLP?IrpE1?MdJ{d}P7Z(DIXLZhRMyoQplp_0G;~9Z
zms7lNsf6pzynb+#bS%|$3zL3)v}5c!euaVZQa%jQn-=shk3i{VRVz8^r}qesBS*(4
z8ogEyS2bKN*ly>VU@=e`tUB<9Nk0M{Rpcd{YyjM$9a2S+Qkepu-x^fQ3Y53G#HOVX
z)UCb-Vygk|p4n4If9me&Uo)9zZjpe%u4X5MhsB6ZF2h;>T#&19*~d&HC!B?L(|N)X
z8r^3cdr)CPGpE(>H&zAB_HeWjm|`_jMy?e$GZic%A-Fce+$E~`NqWdOTE@v)1_$&8
zyYh;O_O%=|4^Jr~LO7_fArv_}amQIJ227W0P<H?{ujzu>PBw21@M@>5OtbI}ZoIrh
z)DVC^uyXfGi|HqUwGUlaw^IZG5F|5iVM`sIcTZ>M)A&+Bz-l@KY=+|{*U`+s5k?t}
zS)NYa!M0`%HEY;}W`b0MoI&aLf<_W6u<1xQr&+P=T%=9UXR#<(k>@S~8WBEDz9#3X
zwU~=NM}H_Og}{dJ|8qc~;=HgY$wB%DC?)PYG*vTppN^|~UkqkFRs+YRoTB<;{|)Ts
zm~w;bU!wgKp48ECFNb;Wuo~*wjwm|bS}NegS@tw#C>Uy5a#3kEs(3UIREgN2R4T$b
zGx8v{tON@l2VDgHfMOw{;(Hqtnd+!3v?a$c+t`JwZ031T5gx<E7BuAbb$78Sv0@KB
zDYZahQ7p?8w0^yFKk>BQ4q=eSE=BC<fr#pslqI7}lFF`8)0pr9CP?VvAm~$&Ho)>~
zV|7cOB7Jt%4{d1JkbMeyXy@>l@erZV6ThjmDI%9(n>`fYQJ7b7hKZ;0zj!HD0xz2S
zsW^7o&$!oUU&<b5r3JE+V$(Gh_x8!lr%yXaGHs#c&H^#awoP>BmdqT7;Z(2YJA{03
z-F<IYWH>!`zTMl|?t0q?+uiSe*E#wiaCok?)zh^4Na|k5m@p`ll2E?Hi{tZY1s=M>
zdDY(2={_PO)>}IMW_EQWawVW@rZ?CR_9~~Zv$*P5o-%hc_R-G1D;B4Ane^67#~!bO
zrs-P1pS+4*qkx6YRz3a&4QKleEK@IuRKJgd@gDm80t&}?N6Ebga^dSrkCyQ!LLg5v
z&XEPc!ZCSBk*QAr$7)Pa#8jtzL1BI_;N*FMqas}ZKB$=S8ZM~%wv}DJ6{!D}*T0~L
z*ybs{dA0G{+r+g^;H+sOh69jm4j@?pI0zoWKo23+d3E`4h|xz{gG%mv)V$k*t@`7s
z-fmJjBey(^xHLttHV0#y$X~{o%SsuJ$bOR^h&_fH50~1RM}ruV7@disFt?~|TCD9W
zeY}G{U?%|q%%eaG(z2r^&7mo>iDzvLq==f3k(@$xyn(zKIazyKm<+<Ra8_~FB{n>W
z)wZ3tCf}+BkXJuXGa{rx`=MqbjDt>qxBrO8A3CdFDP*Nft=G$fZJkasxSGTfHh@PN
zuBUtDj{qY}dv&^6EgoZ5W>3=tj4GF~*;P`O83{-33VnalPE)l;m&H=3Yiho?)Iz%v
zw|MI^dlWxF2AC8HPV9c(X5LK|7Rpfx;rtb8&iMQ5)oLNzm#IuoS$nm*h%i0w)cSf#
zI84Jy@Hor;-}EYVcHq~U*RtyibuOp*5_x)!Nl@-!Vk64niP95P(IQWgi%-p5`crgd
zmRt@$;QLiHCqrR)o+u$WJ7^;)wlG@Yt3{G06Oar8we*-@75Sp?MO;b~lp{H(8d3&N
zq}<us(i0-5W@pv?Bu7^|7k3VSXY>MDc39C|>MPVR4ny%uM&wJc%S#mt^vTrj$78ZP
zs)<~w&)~|Gig%<qJsCMU3U&_nUu>V8cHz`twFd{3y{U)G6QC9lN&QH5iYV0Q#?z@j
zNES%k*r`-!uz{vklsW*5w@vO_Hg<A0A`t({;wT<^uU<78jn}V{_67l_tHBK#5C`J}
ztcgR50`)e9#*%vMlw<t7{u%J|dUe?p;b|)eQ>_$I>-DVy+#vv3z>g7;YMd!Nc-~nI
z)B_LUpfcH7jvpH_aH!jKA50xoSvyg*YEf=>jXK!<QZJ{Bi=UBY9S+1a!0vAr+2wX!
zsix9Xs@g1I&-fwRy7Xg)`<8?YLE~o0g(+$T*$<T_!%~*8l$N)Vdh1@Lg*p3x!fxnp
zmw!HhJ)*UyK~)R3i~OB}Y-BO=Prg`o({1p}HbVJmT-WB6!en!}B(8ukng<IQ<x-M<
zk4~^^^#l6xy~}iPGd93nt^y)2ZnktYgaIag_}*c@3lVKv^r68%YC696SGU}yV+!?j
zp<Z#Jp)NEmE)?lPQE{QEE;KDJG}DD<#f2_(p^M@|IQfLpvlw%8k;#p_iy1DL;%#|y
zho15@1SISfL6H7%>SNk+Kaz78X)BPQxShyhU_>IwIdhLiDYj9tH<8tSka*vJU-P~P
zBL04r1G0SomD{|q!Jnwo_g7a}>DO|LrsPKZ)6aXTPi*Ou&5gA_@;_@Z_0<h~BT=6$
ztLBeB?yawfkM81zSa@zsqq6Tk_FnEh-#$9s-~Kj@!dy-eBz=Dp0DJxYJc#-MUwLBi
zp8}3xW`pYYQ?K4Szw&6wlrZ0N!DZ2t2AAF(9e6pr;afSSERu78*JC6hrA2)2{jYhW
zeXn@ebN4!OSc8eXvBsfD0C}Ht#8QcAfn-!PWelh8fXPlc83MX{F*=v1V<vnzW$}81
zya*DCO+^O~dyy}P&gW%!myyFI>ZvX1*{0`Z(%uiM;;J|Huf0JyopEeLTUl*)37cc#
z*JUv2lQEGW$Gt$|h+DIdUuhP%m@LfarmI$AoT9SjH7acE%bVQE!0ux6tD7(W+|%Ha
zSt~|!E|RsXf$;2<COXu7GVdg!U0dXYgU%g_eqUMiOXYGHbQoRuqtH2)8zz;@q+QIk
z-(!untu@w8_wgr7kTVGA{KJ-R*zLfh5A49Bn{}YuDeA!E5A49>n|0t>VF&*413U1K
zH|xMbVF$`-{=Mq-$T~!&ZMrPord2$j>fJUQnL~BK`7}>U-6&U6e7K-cibJZ7?H-=s
zWhSzyMx)^}Lc*Xax^sB2vwflq+hubWalWjoXR48zsWfkqs{>bUoXb-9{vpd!95j<q
z{!`A>;B9V!n3U2XgbAr2QX{fEZfTXXyxi%1o=BVBPIB;?kJg_7drq7FXmak~<le&R
z3Envm;AJ=rG0y2U&k#+0EK3l(pPAFcg7x9t|J?Yd#jgKOvg=Lc)_k$mX_Kr{(sq20
zal6f!?q!Z@+QcMPz3w$ZvUaV{w$dv*g;z&@cPGIi7mRVRMBd4OC;dkD5=MRUrczq$
z%ZUSKVieTn&YVn>E9)@KJCqzPj}=*ZyOi}v)=I#bgjfa`u9XIMP3=BuqmVC^RY+Bi
z%^@bl4lu@R#y&((Az50fW)wiVw@m_$P8vsnU3{@I3LfSMVZs4v^<9W#r)XJsVap&s
z5q00@=jLus+kp_Ov|UTefX~F>%E6^!gt<L$+nT)mvANwd?+rJD{`{q#D*g?97Wn_L
zYr{wI09q3N>F&n;R?7e9;l{n@XaAp1@v;4XWWvb<=<WmM0raao8_hc#cfIEQ&DO@|
z-Ct)tfSyr^b&nSNJA3~mvjGTJu3Hav<UJgFFjzv$#pWgvn$FS>vJOGnAWk3T_%lnz
zFXaKFxmV>1gO_l|nJZL;QP{rDw<ky2$1k>bto#&cxWy@0Mo@+9<VSO|@%Pqh7+@at
zV1>2O^^@zu4xnmlt4RrcYQY=j^`)vU0QY^0JWkt#xGkd|NuF?2LJqGTcpQ<RAC{~%
z7GnF=eU`Ef9^r1lmE_48#yjoO!71%1gC5^Gjvh@XUrSdTs#(U5JN{@y%0PcQ^(9nC
zw+XTtoD)v_A&Y=+&;swt_VM1%>CPVc#?&+j+P|<aRkMJo=VaJNFC7T#bpV2Fx+<dI
zs##}KP<IHN!z0yyepuZ5<CE>3-%|6?1WhhKs)=>A9*m9%p}SpFRn@?_K5bLi0d$H&
zmHl?T;x<yZAy(@-!xekf(2TVo)*s^n7q~ON+)jd76sn*e{CIs`sTY;=*{Wq7PGZ&%
z{czQ#0)dK+SU;r^^~Q`DzpX2iTfs~E{uLv^=4M`Th*wKb`xH8sCYX{U8S<#v)RCgZ
z{EF0U&7E0m&fn^_jehEs3<Bj>e@1H9zK`N4d#2YZY%WKqA;lZz?{P+X3SA&DxheVP
z10JBW#@Emj<Cz%FON0wbyysbqoW^3=G0O^&tB09MJ9UQXq-yLVAl_OVHLq1w#+@9A
zYbaevav)e)t%~8OLOMq4u^41yL85}AlkF$CU|i#Cvh<ah)p*?H{wN?PGFCO2-===E
ze_1xXi?`p|?;IWNA3x)><yrmlvmIo~$vNB4-dj6EGM)J&3Tm4r&&f2vrcNcStUGzB
z>Eb!W83V`^y{T)Mk1}%ax@=@ao)Ovn{dnS*q(n5CCzNu=R7LtX*=5XgB+5&HK)i!A
z_qwED4+<h(Ql^zuH#Lh^5ThLor-0{RX;%N<FhiTolT_z~lgnmcx8TE}eA0IxN-|mn
z!)9GX!#Oq_6t5v~ik7V^iYp}19%_1Ogfi(lCAiROXf$h-ZC%ml4l@@FHK8iAGYnN{
zU+Tn!EtV4?klr+oXJ>sp_d%i7SwH3hri;O%m^C6~IAk4`&(d&EQuN$U&YcIs+LSIy
zK}ZMUzI|q2^C`|OJSNjCvu?;3j77GtEVT-*tf52{uVV2zrH4@>8!{0~=!0tPB8zit
zO(A^kP$o`Bc+TuP`vh6=i(H2Y8dLM^Go{<oHL4odJEx;CqJippXjW@Z>P9T-aDxiU
zRL|6e*(|xakSAjckz&c%ijXxcbk5NmHlG{gMrEykiyNrzH_Zyt++oXtVj$%4hGu%c
z!{qWD<0)DAsoMS?-KOh})FIN!o3^5@U9ZHZwI{#(T2viI5Ef@+9-~GTo?_@FnnvuV
z8m~+8O?RQeUXPD05^h$D=!$V+=NB{dtTRV4TC%BiU6*VdS($Ud8f`ON6WMoVZCI_~
zLgQ=Qjr1DRR{aJeY63M2w$~8vn(*Xy1*!w%K#roeHqwGQyn9AOXBLg@xuV)60z$v{
zaMnVqt$g!*@1(QwWbXv??tI(Xg>Pz48vD~X<hM<WlSz*qOMy;X03oU9Ql@szJ9Yr2
z)+;PEB?c(Y1T75Z(Hxtb59AjH3=+x`zc(y$L8`WSW7Gi9=$ms}Kg|{q{A7x_BFKjF
zten0<?WCW0j%^*y@*S?IS-ILA-L1iWhI@cDJN7<mNpfZ<aMNTsI{|#3_)%zY)bQx6
z&%J}~bmw@2;;_6>o0_$!sg7L+!30`9>)XA>hxFvOuB@8CbDY~KJn_%)tnEC$4E#6l
zli7GqxdPmW){bRuSb9J-3MS#b(`P%BbKDwjFd5HB=JozdgNi{g(Xv-Mh{DPCvttRM
zfP^)B6~4B*C9$e@PpAInbRJ>&KJua^UZai;lDrmG>e}7_iG~AXrH>z*oQ4fgETPgf
zXh$6*E6Kd@l26C+EXg&E#VILVSJz?sIkFgZ2L3zipX@I_>$oQx_7#ST&vs7sjTD6(
z|Je?VbLMlZLgxFl5vWuUHmB8TYk9-S5f{25{@E*B9F;IWDXM42wkpSu$hR56S$m8d
z@$DnYkmB1D%&m}sEELEK88e+h&(Z8Pg&LL;ToGD1<g#t0PFXmZlO&i20IwG1EQi5m
zJc=EoeeU>ttEfo{^<787qa}ZSBMJedH_&C494Pd)WzqVuh|O6cDcObRTXTd$QNW7(
zmRTpCFIE0VKMU@EB;~<}UjQw>|GC%NXl|tMf8g2Y`=3wovG0G>gi{KT=KWtcnvJ{q
z2B_7<9B{3T&HK&l4bb-dDjbDAs!w%3YvlC3c{svEqm(QJU{C#N7~DKV+=2*k`58g{
z>Dh;72|@Se6WpLExHvG!#B7c6a2WPcrohb>&ZjV{1`R*Dw)Pfaq(0`uqq}}MP=cHb
zdniUTodpp}xUi}ElgTI)p+(hfaMBZX3C6RLx&`a*Jy~)IW+f`oHJ=`JI^8|8`gpps
zfx*5>LZYbaFpOz{3H+iyC)Oeipu0UxvFFR_o$^ql0}H3Jy08<8cz!QAr2@Dqh1Hdn
zN+qnKu?pJO;MYfdEIR5ugH9ZMw|B7H`PTc2UTtF9H2jP>Q8WjxMhAe9%)reR(@*ao
zWTJz+b{#f!G_=(e`oW<lU`#L{cB<>{DVkYuxE)veqj=yxCK<LvPrwmr>f6zGBm=gu
zEla)}S?SqD-F(|u-qj$M@caw`jB$rGk(ausYzm99hI$}wsgU;GFK!LI%B=)rU~#u}
zSCsT13EinGM$@}Z+1kbUS7lddsD#@X9)QHCa+S4oBBmqodfjnZV)e`qNiZ5}mn904
z4n?Id*+vr@VIfLRV=Qm_4@Y45ZJ9phj~PWI<Uc0+2drifF+t!M10}EcBSTE#=dIvD
z-fE$$WK{t%uKZQmIxZ}m4p?1QH<xscCoQjcZwn|BdFah4b4GEhQ=zXZQWR??oM=`O
z$tt*-kZf8*_fm?IwFtBNGvguXPU24liJfwkY|a8xB~;9<OxP0t>~zU^DTbJD7N5b9
z0giR;PGR{hlGVYhdwNM+Kc~r2a1o4(*LixGQ*pJ_`9MPUyJny91*RP=&|b60BeiJR
zyDgYe9tli-J)fB@B8rZ!4E1bhm@-<!y4G^bCjknNRwlaCx#sDY1w9o|j(;iFA_dmE
z#44*$8h9?Rc@$LJq{Hx49v!h$E~5TiQm`p|I0ha@W`j6I7jVeM-4SSjZg=4~MIgW!
z-;<gLg%zKaDc3RV^$;#B)DUp2S`}bHG^ps`bYhPq5C^bqD@F2(WiZtN9^Ss+p5+zp
zSwvWp_Txs(0rveHEbW{avdQe#>nu|dZi#7$ByMB(6uM*3$339eO9CpG@wl~l=gP+U
z#2$sObutNOcjI?8k2#?on7||vS;Cu&I-9q8l%q;2UzN1KfU!rxC2BGF)?@*NTP$68
z#V`y;q)Es~XEo-^7Vl76(}qf0X2~ZUJP+Vt6nPd*u#i7O6%XcFKsh=sorrQ~6rd^x
z^~qs8Pdri+;U10YOyK-5)5VSYX@WAMz1;AI3`cJ?XVCC0@C;f^U0j*!PQPwIBsa%~
zi-~r+6*mG{dXrc)6w3OToCSwB7zGo@FeKPlDussV5-GSBDuP%e#B7|=O1^!n%2)OV
zAOxX@BJfo8K@4YuP}FX|8F6Yuct?^_@vTw_wEHymFN5FDeIYLRe=EOFC?INZGshy{
zqL`MR!Ep?gdhzVsG@jU%WD<334BKuzM^?ZYvqwj!?!4vLG(lSC;!psELWN0Yl1DD&
zev%648K}TVx%p7IN>ztlw8c_x2GBDdVpu3SBOt&9QV&5#ge(!ZOsAAwr5Q9*?2LP)
zMK{CyXG>ehz>o!vFKV?dH+Bby2OSF^St+y3OGwGM<!pyik&&feBNbhv2r&}mZ*8Pw
z+1jxQ^-3S5x5JTy(B<GM)jX`x$Sm(hA;V;O*I^S{*6|z3_Gvi)C5P;Y)zrW~5=TKi
zmED970CJF|GAf>~N0mippd>aF9h)Tt9cx^M3s3E<9cRb3rznlu6ppZi2OOKzR8_HB
z7ZILSaiFJDoV^|K1he+&AU<kib<0()2sm`+^JW1cm!fbDQ~<6G9cQh8B&?8q3P($a
z3ly<<ur+6(I1@jm#3KM9VbUG!+45a(H};}gaOR*rlqXB^uBsZuOVz(}%sWFyiE#0N
zZ@w7akAtEcO__9L;hbs7R3r+L3G%ug_kK+2!!C6A1Y7y#h$T?TXuq<Oh#jF-34CUK
za|7xfNEZN|WQ&%u4ao?!Kk4&zz8qoX7c_A<BhKlOW<mxg15ur@;ga4tBODp|QaQ2Z
zp6UG22&=v;+Tk566-T3s2)EUd?z~C~g<5B3sKCOR(W1C&gk%-YTIDsBjK5f<<}_<8
zl?T)6q9f2K?2)o*>2lFIPr9c^0fsr(EM<@Kb^#z-7Xr^48S_0m<Ve^fdzDH7IFjBh
zgBA`g;*IK$5h{E^qX{g)5hB(0O^G@Rq#@nCkAQ|uuZ7{vC)T#jp!6<nMkIq5D=JHa
z1uPR)N?1T25rZq3yu?yvbx(&tfO^sAoF>Yr-NWtO&Td&zN%jnaCkE9)bL^0MujI{Z
z`y3>^U$@KaUub#;6Eu$oX)TyOjoNEhA84mRf~l5u6^U>vPB0h#G~{zTvJN@6qJt-N
zCY<pZhf={IeyW-CQ4W@#bq}9xcaH^0nm{?{%a^vET4UM>|8$~-X&;Wl{*1_R91rFu
zi}bOD&y*rCeW+IN?1OdvZhAg4bJ51wo}R<--rj&!3LLj0&1J;qkWi%pguC8UrlwSl
zuOzRf8XU@c0Umm^wTgC@&0U#><i+m8$xu3<h}9DtL{F{_*jY>m)|nmTD~m^5XNIov
zT_4Rd=B#WSv8PMTbBj6XrV+QQHPvr@cVW>jRku-T58jIL{sGr-u;`*XTHtLmZy*~c
zwA=pRE4YGCn$J2X2i0sOc#2@2-40<IVk`VD9V_gEB1W9i$3&LjSWD?jlUQuiV?QMe
zzYN`C-%<9i0u}#&n54+Sdx>79jL*=i<hZ;@icvfB57^eK=Za0moD5*tg^F}-=0YKt
zBS<VKYMH{`^{`6fVaDl<h$DpTh<zfV<zErJxhNN{ffnu*r@+Pnb&p`c9#k9r3h(Lw
z#=;Tgf?qZp62ds93lvYuD0Z@?T#W`UmRwR*iKU4&W@$;yNVaJNS?OAh&^y!AqLv3w
zzl!UWj#@y`Lx5&ky8R(q{VI*Hbdx%8L6$n~bC`u(=v`v>&IrsJ7Ew{6ua4E?(e|8~
z*_)+aEN!}eSIry(el??QY57WVI#w*2pA}86#e=rqeR{QMF>9!NBL%ZvK^Esuxteps
zqg=!qttPgh(UPxLUvj|8G~dc?UMKc~Qw73;69VdZx>^}1L5)B7N^GGb>@1lt6s1$S
zL?-Wh64xIa+BB;W1l~!8^eT}OT5_}UOW!4SPoHpTyq<o5w(QDZ@^+63ifw5H0WuIw
zoCL#}RIAqQfu#~143whmb`J!~nnzXZo{Im7G=OsNFuZaEd8laBo7$x%KLJ~GL>?zc
ziHF|Ap8;{}C5Kv2YHZybDF-tSisbo2<flJOR*kHd)2P!$ay(8DBUhS$yF|e(t5*a=
z))lOkD4F+yW%^Ssmgg<>aBy{FGI6e`S(K+U)*q0IWyvGh%3F}oAdN_eO$vC%G0}|x
zRXHzsi5iO*DoSNAh%{5$&^iEUZe(3{i%ANQM!IB%A1oDCl6n8!bM**|STLEETM~;X
z6i7tTqQpkctE>f*=>tT$Cdh4qP)<Q%jvy$iI?9}P8F8K<(Q@9weq#ijd)nT8X7vDi
z6}w&F^N<OtR(xdTYM46<Ht#s9Geqi4J~mUQDx=im%a63N)sPQET!SynrZH3*lW2<$
z7`T}6sADdTZ+4#3$7e?_9LkL=(qhvwk=N5{uUvNO_&8^nXF)`=kFeIUABB_oh-^?k
z*p5)yQL2bwPpT^w_^1AO0t7{0*fXi>lqAnRD$0976;D9G`zf~<#bl^k5HVJVHYDBK
z-#b~U*pUe^t*dij3dWP!wS-u$*qh4Q6DKznZa}6LefkhPKKH60bF)P;EKy9|5ZQjA
zDV3<byq-`BvnL7%D)XO*kMJH`ztK-e7bDh}<>^Z8W0ybpah}Y~y=rERI1~oxJ@%Tm
zB3LnW?m%}-YXW95s+iE_oH-a@hrlWzTP-^Jv#F2X+Zc~<OynCaVhhY??SqFE@y^10
zs&Iu`Cmn~SCz27=rEio9xXna>2D;MnV^0U^$B#T+Z*%w+^$@|YyO-iJdscLHy(+oE
zM=~kaK47e!s7TeGJ4R`$$GOUGYrh44F<C^dw5b`A#sxu5S|lLkD<or)RpBYkNJQyI
zGcux^_fq-wsC;Y+8YQNM%4-S6Ct29=joP&=8!hSW2?=jPHpxP3Mk5sEqt!)e%9c&9
zTs8N4ehU=&s-wKw<ThBa_5{5bM5{~h&rvOWTl$2A0eyPZwt1@AKWDuE@(}f&IS$7C
z$u$meLbya&n!`aIJ}^sR;#07WE=HEblq<ZTZ?(-8Q<p_WG@Ma%wyfUBqUZ&~nDR_t
zx?8zsmwdZ97+6JU<WKAl<*k<mS`2mS$Z>$rOzaaY#bzF7*R-?ovzbA{$z{p0e9D#t
z1qbsRULG!)bmLu0s->p~dtx&513+CBVQwCUzn^0Oq^n?H+&7#fkjUC0^{?i*fLM1S
z972h_K~&OqF<2U+8dROV(~3?t0xUFpWy7|00=eT2XPF@*;t<xCmf8u;dF*aEswQ`6
z(_on21X=L9)slr6sien(qXY1-tLX))jwf~(6ElGh@?6D*6i`b}w5Pc0isvy&4c2T^
zM3IFHa2^%WbWPE-*&eZ|9nigi%9j&Y0lv*NF;0s}Cs$9WhJC|{%+4c@&eF?$_<^7s
zV@BMM<x7-~fd{~!YPLh>CTKd37<jtZ?Raa%hfLD*l;r=K;^QHVt^CaLFn3Rj{L_tn
z7T+0SFStKzBcf~hQRQF}oFUNo@(=5eb$>PYvmdI<ZjT#K;h8i^m%oq7O7n{lhZv>+
zAq=aTXdMay#<LhuA<lE$tf}}0>KR^w5e!?k$koZ);VVy-^fs-7qkSTpPKV)Q3u|_S
z!oqY?rInLo(+7}P|H2oq<jPo0OD@=!9Cy<iC>yxQ#%jsf2IYM}ipUQK{*$Ej+(88z
zV}MVmMp>&*<5mL}x+K*+5@4~(&j^TP8Jbl4Hf@cFqDi$yL9}WVYM8&PH+}WR^iQy3
zI}SEg=plR!2QQ7tSp3M$#xoi=GGs|4r*WUrgJx9kZFDh>^!3xQF{HVLXYTcd1Hhi9
z-_XoxoH%fX6m-JOS9w~t)n-&E705=&lt5$ca%MWQPZ%8mkk%&{<{F5UD8E=$oAAph
zyaMhM^c&Pavj@9)ll7}K$}a3GXD4||i3uq+1E$XMtdv14gAgps5`+6fWwV`qYj>FM
z+nyb4pS(QkU~*?@$s#dos24`$otzrQka<T2%e`{V<Hkg;px}jJq~Oq<p>00DY$g~&
zb}kGS$b4$<kGvm#@nxgYP}f^GL~0rbfZ$SgqO=LxJR(?qHOi9b>DYBhqqvH(-?&d;
zsO@1bPYo{2K`m3nr6gXliONjHkRwc3h~)qw%r6iDh+@ji0PB`RZB%U$QMF{R$3&LC
zi&|y@XAvHH_yC)*O!$Ku-fBwRc4x~U<gc5X@JYqAkVWR~>&Mv*!8*c<aTk{?-o20C
zb@x8TDC}zYJ}%t76Apans_)Xfttv$uhpxfYr7lhI@#0;=Qr8sh6TFvOh`FiVo^dO)
z5im-)!;M6Amg*;WUyaDR_OX`1F-4pgXRO?TRrJVskt{SsOtPl71}Eg9VQFaS{z{3h
zA9n7w)t_slQw{=FF~lSOMYE~Kd(6QT<yT~=ib=;NqgbJkytyqp;?+vZ6#(s8=jTRV
z(x)2^U`YMprZZw0hvv#LoKd8`DD~!W0y8xmR$#w|^$#om#rDD8&ZcJt+EIS!5r<;}
zK;5}d0U*#d24vM-qAcc?$_6&a=-ULz>snFrXc&3QFR{jvSam#?H51$iC!tH(bWi;m
zVTo>k>0366)n7Ue$>+~s=Cd&W0|!O<;5HV=|Ji8XyZ;~)|L1f5hfniy^FQ!}Q~aNM
zcN@({6T|;JywhymX+6a7KO3#h*8ObwpJO{}b>&SEOep9Z!%HN|?7-_?Bk!!<Ed0+e
z!eNAxll1EJ+)fW6Pf823IB?+MqO=WG@&&YJVosfy<O}l%y|5)_aCN-`@9K|XKVENE
z*Q5w;<@UWQKIZ6k^E8~7_!ywf8HiPBBw@R0(}!y6H;ytb2vn<?YSvLSuXeeN0KQ);
zH+ibNN%f91I^4KYoyB0|(AEe=?_M}#%wVFabUe~3?QnaiPhTGFXsx7*h@R`p1iKk;
z@}}NP4s@snmg_XFM8ukR!sY@l2p#y@#?C_N%#wfbnn>H4{iRpy$Nwyk|Mqk9|K{CR
ztC`{d&5h6e|5JQ&;=eKf|JAQ<&i{X=@NcpKNFcQHOlUM`1F#Ya<%ECBiJ7+8c_8<2
zhnBmUV;$cSZWXwtC52U#DfbpI7d-b^JeFGm{vB2=4xMwM6uLVCH;46VKUPgWIzen`
z&%Ai@B}H!&^VtG49KPrrz<3<^+PQ3H#Ll7gLqo#TDZ9q<nW>LjGNgka^Z|F(jvHqw
zl)0z!0RCI2z;7w-$w+ykr4=Y-h9(E3ou?{564D~7QdG6AQqDbD#U9qr<U45G=8CA~
z=XPG)Dx_!arkP8mSx?a-P|Dx*1Hq`E8o6MKqLdZDQZXFzVa><I(fGECY<p#_R?vVV
z;M?!-l#L%9B4JryOrVC3)RW?94Q^MktpgJf!13r`(3K@Xbd-U75ZgIn2DS>F=dFIp
zRq{J^%mrhd@Qb_l4rsO;$d1Bd4JL3)ZoA1JQjuTM<eLVCD{R5)TD+U7NGpW^QscnK
zp47F&R4wFlIg6Url2#w+7?9hG{NPE2=%wIoxq#SeEtj+8vz6Rva#?&>qu@|qH{^9U
z3%XVucCDx<WCZd~G7XuPED~y_8G?2d<ap7t7=7k8v=E5cMBn@Z;SV=KU*-Z~K@V=E
z=g+byDXCWlsU)hR=-n!IERj7snJ<=8K88n<>x8tmq)Xb_C6^}N#oJ|>zYB?QV!QL6
z<~GLcX3b0DF@<;@&PU$Z?@!|ovEwm-@047j9F{UI_X^L{peDkHmN!-~2C~TM6$}<J
z;I!oFNK_TBScPx8ZZ&-baHAhatQ5*dI;uofxhzQ4w<9k`wSlT{1PxugGAICHIrm}v
z>fqw;#R4X$d8tWlo4RHLwmXp9^eEP2ui*E0X<XIi)=llg=3NL@tk|$hL9OlRvFbN`
zuY}pkgIHZb4`EjTqHtNJdcmY|I#F>_HrNk&|7G{&sB?mmNV0&<)Fmm%&YO1!oeIw*
z^tQ}popGN*K9n9BqD#dC!#Wr>e1LxTLwQjBEBEcmJ;O>vKPel&waM1X3WjBuFu4+C
zJ!X>=F_gX|#!n!Zq<u@2qCK=NoGKD=Sli<&w(OV=2Gd;QL93fvX>O+d6#7-tENjNa
zE=!NRisiGko`P-|n{nAdOLkFGSJoKH`a0SwkP5oems!Td!V{R4UN{P8*Bl+m(k3v_
z`Am0iCDYyPNGL+h6Xq1${q;5xXOX<9Y}zwhojtK@Pg2J=YqK=Nu4Y^uiUcm>ypgF>
z>}j$9*v()qf<PVuHy?oUBgw1t;bsjP;<yZF=VbGnTqm<&Or_8xVj9#%*Okh8VC$p~
z4v#udMINctTUF;Jo8+sPO_!!nm<Gm#`H^6t75@8`b}z_fhMWUI0FLJAh-Kw@gkanb
zW0u6Ym&BuB7L++3tqv2NWzsCL127WX<zpoIA{LFMQ-FZ0XCRGSbMOU_+|@S?&Q_F;
z$~g1?4PLSQRey@_e})rG0`d{k|17=#d2m0I|7YXgz0dbQpW=gFZZy$e-Fph+;0&*8
zCNY^?Qx2E}#gJ({hZjLo^48!#>*fYFXRo!<Y}VnQmgntb8pjv&(J-D4yhnH+{F^t|
zQP2S9-0<g*rTU9tIt~*8943?|r+4k0P5p>+N03Vm2sOA1odq>A-HNWg33LT2#J!mx
zq6HTM@;R;+`IrNwBp%K#ku{>nx}PL*KlIUpYY_J-%Z8-e2{G1l1q3AoQ9hPR$VQ>5
zLEw*+9Hm~-ZW2={a^%Z&yMV`1yik&!s1l=a97;O~fsjN_zw?AbG*7N;XgnMa@ozxm
zo6LKoFgdRwm;nYB4}0?&THN9Deh^_r7|@+~iaAS02qeU$L_?>KR0bMCC=<l*OfW{R
zU!KQfcSxAvXg-xZn>g+m&_|7;(S!iP8p9Y9X(LtOxs;^RWK$;c<Q$X#pvzTXQ$)mf
zdDI)6l!=*ad6k^|6#oe!$gSJ}QSMuVn_^F3Wk!_35%c!YrDAH(4b_k59q;(?>B%?S
zM;&kP*n4qw`1Kx!gDY<z!|!s<`)2Rt`QghG4@w+uADn#W9X|E855Dt$3tJRnzVq#i
zqt5ZMcX;IO?Z4>mb#`ms-oZ}y<?i0WGw%shJvcmJr)hwDa!73ow7m}0dx}u@J4ZXu
z;mP)sz3$%0cW4T6a)4l;0^Duy#rDz3-p<SJ_L2AE<<X17;|_FU7a$+(9X!P-&7J+u
z!3mBE+J?to=WF=w9Y5dhcB#SbmoSVY>gCSii|>y1o;^SDo*#C1LAdswbfACRPr4m$
z?ch6Fs@?6q{hGJCy}$jeLlqAJ&=HlCK7RAOLyw@zZTN5JWbg0*@w0PyaB>7c2|p)?
zM<=@WH+#pOnzwzlcZ|q+dUOaaAa<eBA;E#F2OS24n8&^&5Isjw3WxLZxMO;>+X2b(
z;Mp<Ow<i?Q!P48`9|Jtf$mLVyjzQ25$C%-h6GX<-2A+gw@t{)m?s$pVc2>Q4GyqX^
z$GU-*73*Q*&=FANd_t+AI4~JHvU6Ntq_s>V97P{E+Sph0#~k!@jRE*mj1q~JF+xX@
zU@Sdq&G%-&<Pttvs&ie4`L}*Q4`Cygk-l^GGS2f@n9<B!ean`Px8H!y?%elw2&Vu5
z7$gPyQYhiDUtWS<Fe>LLr|jgx;CdxqGmSwYO=!Jiw906e&JWR<3eAIuC0N5@;&YBO
z#W@g*ctYTIq5yaRwgc=!r3S^YX+FS#rx<lTN-*shYqtpLc*6|cqO>o{N*+%xJc3i1
zxKrNDC^*O#jeCzK7Bk0=;Xo2%LR`-&%<?sy!IKcABFaL64H|sW(Nl;f@m`)ht^bM;
z@Fv1=cHF+Cjl=8&SUG{&0JPeTdD2+rRipO0sxU*fahiZ|$Nn`%|Lg@CC;l+-D(%Pp
zsh^xzndwKP(-9z?68}_T;t&efk`4l5G1vyGIwwGSm^vqEcrSrA%?b(O*oWZjNRF~I
z3L#JkQl8No=N!WDNd^~}F-<x4$DRo~{K>kQPX?HUn*mm;B{m0FDu`FVdJXe}Pm)MF
z1W&aCAAGN3ZlN>a;v0?oRVfSe_|y+6w-=|A#bDfH+JVCHMDq2i@ru`UZ+>=m?G0wJ
z&&RDbDjFEk04VA*90b%gzYo-#*iJs!*NxZY!nCo9Y7BhP;s^KjgS)StG{yMISebV?
zO>w#{iY|+t(DMR4ZYYm0{J>^AomJ$)TgF5Ixnp0Nua&d>4(E=-h3s*f8POi;<~O}p
z_4SSVul@S<cKy4?YuXggHof{r<3X@~ALSiVe1PDxarJbg@pNPIbVF$NWx_%PUIZ}W
zr*V%g@d6yskYfiza}95ArrE@pf_wpLSrFiES?KUNeIiPQ7-dXxcH*(RC8|Xf&*R~^
zxg1Wo;gN(g4U;#_&wzZB5z+|8)kfDK$skR1gFt$L$|jBGsvI-H$3R9pok!g7&!>q^
z>0w0PRfu)!%qjQeRF8zzSTHb$@Ij`cGD6NsUr1GtFftx_b)Dn))nBigSiN>I8x^*Z
zoaE|6eDY)6{?W*-t`^Yq;0h$pvv8JR0=Y>Xq3W>`z;dJP#g$2w(h~8smusA0i%E_<
zPjURbKLSCtHcYQpeHw=@1f$X4aZK06opRhGkZge!q9&FTypY+bh=8(ts;yH<n~6l0
z1Wu?q!?;s6lcJ{#=alq-uJ%jKmVK9oZbH&kam*{2^0i6T403`YbL{b9T&F~h@feN_
zBY-}OHH~xPqcI#!ks>F!zcaNf{V)%3HF38R8nEg@!+SRO=}g6I6VrGDZNm?LrnJNy
zp9@b{4o|?nU3AKbv_U+lP-x7|rH{@%Df#E{_cd7Y=;PzkI<$=Z=;;d(48J~ocKUSx
z1a-oqZq^0Yi18x`{xX=Dz)J9B6htZ*(p(2JGvs{Csy@vqD2FSoOis~YBMM)wHk{;>
z`CK%A2}uh)Y#Fa~gL}!|-D&cQjPDc0ZR4``MgfC3h`kIWq<sO+z+t!drvo!W>5rAS
zNYJm8=iXWsTir^JV8hu#pxNCy=c5e_4d}2psXdT_MYX-WxlE1aIobV#_&rbNKzi5S
z2v79Vf|G6uz+xgT_V$uC*1e{+^C^tkP2}#ahjSuo=Ir*~i63YGWDL;1wvV=So+MO}
zf>GFy*)!EJLDO$V-wLVtuY?F9I%YzV>E2Rw@`@k4X3t4A5idzrN|CFk1w;c&3DSwd
z#6)tWw%j<5gNY&DH7c7&=h8Yy{ZXXL;BNC;6p&f!x{YId#f3QD-0Q8I5{r?K&@qr(
zvALuyZ|0Ka;doYNmdH3kwU8oEWMWD(eUOsgY<V;ZW{OpF2FZ$LtwYX)Q@{)E7K(r2
z!$Gs=4O%q}@=nkAxK(N5W~M9PE@ytgo8~=BRNdhyFHEZ*x9wGKHJbO%s_d6+>Z+M-
zdN%kwUQ-tBpyj-{rC-1(P(B5ob!*i;X}(rx9~uw*Xj$~pbmUYh9<Hxb1&~G7p$|4m
zXJ5CrGB3`oro-2Eyryk)$YlMKKf3g<6EkynTaNUn5_>9b+zgq=%;HHD34%AJvr}lV
zVmWWf4gr&0FtPgdv20JmfjoF^_949q$&RJYE*a7yqB89oVt4@rgy*?<es-R>Ia#Y6
zHu!kfc<+5G(##Q1k~dJvObQ*h`lqW^okcbyjff~PSSb)w9*=_Fn`|DuAv%Y<8+Qg(
z&Ab`O{F8J}^4y8;OKNjB8Wq)r9v_I5^kC6Ek_%rpuk{d*x%mBxq=ikGZFTfw@ek@y
zpgx;x5q$u~+Xr9@y{srN|4^(}$wj#7haQYGxoqF_W=Z?rCTWF!F8%)k{~y@GKF00O
zQvc6;&4>3=_dgHrZ+yQ0`6M6P|A!`=oPQo}+}!yGt(d1n4BQP*_xV7*???VwFuk#-
zPu7RW+!aHwPW#Rk{LbM~C(onDdNRQD+9}u1L7aMk<9#=mQL#1JrWD$A!NU;>wBOSv
zzGiD>3QF~U@fEfZO67-`(`ASd8jl7X1jG9wa$aEUII0G<C^FgHhf@jWi4mPgg=97r
zohBT@HWHiY3=OGfI$Xh?VqvoXx~fW$I*K9<ZS~L|fy|B&#t&Dk`2Z$R6>SknyyKp7
z%^xPKG(Otb@!D<z%yx*{TOaSbG}=hmv!X;$PbsQ&h)RL!=(<+WWoT4oPQqZr)EY4C
z{yCxyw+0X`1C}94_7ucK-uA)qp0}eAse8hmNT>nPFiCJNm9c56C_(8eeE3c6;^|ty
zqkBQT&-5s(E!}hBsRwpZLZ(0+g6Q*QRSd`!<zuL3*d_7G>ARJCCD~!nr*;4IY#Lws
z^Q+VRs4#?fmV?$DYNJ0Gy)Y@T&?SKfuQXGRGN=ke<5MdqF;E7zqhfT4FRzM3A)(gV
z4DL=#C$;Ahi@X-joUFudrK(*4M@%u3JoGG_&C<DupPf$Ukv5#w9p>#@`sN8>m8At0
zi=5$DiKLi`i|(U2GeKTdRs)N>TV1o{YxVMxGkZ!<Gga-klB5P?hVgvNWTD$tNapAt
z`=>%!7dS?lWtm}tU9;x6YRB+V)5BR+_|Qog79@}YVyD*}sGH-=C*I+2om9qVy5G8_
zIE&+6n93Tf!<V?TQWo{AwKxLSjPoD?ln1cNnV9a2Qz#3QJ`<}>3%ZywG;n2ET^1}Z
zUOmgg;c!AXRr?H3{7f>^AW%6o+I$!Pt;lQ&Z>HjEf-7rh^~Z_@RV(lVd7Sh{x}mlU
zId9v*@IV^r_=Y7}7Q3f-@VHclTAib#{my=-m(lWGLU(5I%pc)}7R8lvAJn;r7>_SX
z1y(X-^Ou%=K7SU<{}<zr;QNoCCGvl(wec`5|KGj;+5i8Od~Eq2Cmh88R^$H7rGFGQ
zFTyEBE*$%P*fN55jPG(Wwq5(_S81Wxo-3r!#%@p-EBIE7rnob5yNFFDKS_&@mu1NI
zzjnfP#g2D^&ek21p?C%qCj~@E3j(cFDpbXjwk(Jy-ICQN$%imf?0>Tsx7cYzn&yOr
z@&jJs4I6@`N*5dr25Ncmu3EB#ut)&DuTMuolEB#@lZT9@ypyjvM*JxKVCuwG(a==8
zi=oY$nI|m=UaD~$Q7VP5dPyGT>PM8{D>b3%ULDWg><uL0a5g^8*Az@PFLhI@@234X
z!S%a2*>Mj5VFf)%{^C8rps({;L69DJhgXS7L0!pjlACE01O)M}1@Rg+XMeMSb^eWf
z7VQ7Xct1)TOZNY}_wT3U|2(*R_wMKY|5JSI{U0Zs_Wy_P68a5&&Cm>OM?${M`yl3%
zod(DT?<fllVp|rVU!|Mt=d5Rc2xC_sptFyOrNEww-^;;C-DY;{kLm3xr3kEh)^p6&
z{D@q`*2pDQtkakQSF5t~Q!A*NP>o=GA9_c}XtbaPhy!|y7Hdg`YRDl^S5p0;V_4nm
ze0y@VeM)({;1@*_H3Ne&PfsQI`A^wVV)hO0{`&gXTPs$be-WrMlPY>2%UCOusylLy
zJ)tY24SYNeEG$+kY8$F%FbU_sl&dE;+z*$wiWW$x{V>xmRgI`B65L)ij8pAOP1ACT
zB6wRdpb1NOGlvvw`F_3FIfDIcWo2W9;>V-iD%yehI`XSe;;z#5rmF6&tTeIWAatwj
z6jk_cuhZRKX<;2ILq)F9X_hapsN*Q(QASK1k5-4+s)<?86vVjRwfDo+idsvyEz0$j
z9r4y)V9ku*qS8%^m%l4SA({jt8Np?u=KXH(&|6D|ATePRQlh~wMF~2O<2QN20R=!8
z;Q(_-<j8bp)^bHU&WBDiip=+dZY%|Hlmo)_BM$^2SU?C`Z!VQhW>XM^hNxm14Pd#}
ztS1ysBd-^6vS26}R-Xq^fCgbZJ9{^c#h9sTa_7BMZOtKbtGbkEYLVtDmvW|43^kUI
zqp5#sFN}gYD_RGpb&$zPISE_Pf<EZe1<j!);QqBrxC`XJQE>Hf1i)qYzpago{CB_E
z`Yiu_ijOV-(S+0e@BMcO{@4w!Lf}H)cI1z)|8UbwUoG-MqqfY)KbOjU8Tsz%-Vr5x
zI_?~O-GN>8{zKY6$Nm*vql|*+Y<AA3=&&~g(+gk)m*}Nv?a3#HzwI2Hb~^_;cyC#4
zw&he<T)AaH53qy1gJ+v4MqbBr<@!SRwbKEcrqLy55Y5NIl&&FaQ15ISOuX{p(QfC+
zQ=Kj&Vz8WkLKh1t1fUOHgic7;<6b;Mv)?G5aYSWjG-7je^4nAND{H5)Qo|Qdjyl`F
zt#P5<LweNdqC1y-*?Y=g54iZ#ZT0f$;Sv7@zKEV(0z=C09nhcd;m&rKz8&nz-@_C7
zE47b0FFM;NQunBH^74o)o;>f!m!p^5-phj%0rAcAy>6$*s9=+$3_{efcMcDBwz<LG
z!;@nk%0JMbXAHK>e-7jisqUmZ2iyDnly!q#`S7^(mi>lIyp1f*6$t@6Lxhz+93$|w
zU`A1QXJoyp1XO=I^(Ab<EPfM2-VZ27B_zkucC@>FvYi*(Ywmx0N;MMi6*|&rsgDCs
ztGodcFpo@ubv)!58ll5t9itenl24D(>9UW(MA(o`1lLR?lN0LZPbHQ2_6-}x2{Z(R
z5U_z0ewWRL5?t{ns(^@jyX1xuTX$m)M{5rcUsf;_KswKh%K9{!OD-XH9kBzaz-&+!
zH7ZGEFfT72^#tXJQdp)cHw=$3)g3Nsy&r)*>z@byK;WWyOTX=+GGdHPDssaxk+hEb
z85wj;rr`zI5X9_A!&0{mBOS_xMR0rgm|4spbESP{FG&ecI2RH>K?6P^93G9LiX@&-
z`++-ZerBcdCK?<BeKsJLk+Z{?V~mG)vU;MoN_n!?x2M@8p}B(Nw<v`15K|JErld8@
z(ISVEC8Bp~yoC|NzvUQhtVwnoS`;%pulrGOHFIGU6x1|zv(mv8J0~sZ-Z)Xg9dXKw
z(0d)t{N=Ec9Id_1#Vp*YMIqK*7<TiYHNSrypJMr+%ymDC0qBzWAI<x%bo`G84<0`J
zEdPIsk0t-hg!2L5zK_!XgF74d@7!&o^nZ6_bK|}@Iv*OzpDK_`Gah|!7}wnxd-hQr
zD2&%`^tSzF=AU`Sp1G%nctRabJ)K8``FO$>q)I!7BU6FIF-p<PQyQ!(am=TID;1(J
zQNNAG^6SIB-HK>AiAN%%B~@qDO~gg5@s6XeIr$ez{_KZncq~Y0?Xv)@Kvcf~BQ#b>
zH>I|muoksv3FqNp7X=jxZM94uLAc#l!uH0N7e0#MpY`=>$p~KU<W)#c4he{${d0`#
z0zb&Yjq>pUkWJ;5T>k$1@5|-t7Dr0hGG)I1-YxWfZXw?(<mZ;@Ic0jeWrj|fVQ!ho
zDHG+EnL1^rxn*WfnOSa`3#ZJ5TLwtNpO0pnD|p=yvg3WFGLMq*3}cbep|Z~|qbn;b
zYU(gg*UAcI2f(Kq_^pk*^KvayUDBw%P0#(?9CF)1iULVr2=2u+p2cgZ2O|#(i|AOl
z4+pRI?P2}#8zvJ)CCU^+NQp4PCJ}qx&64hM6pqk{Z$;z76nt`c*zIf|n8H1B`$AiZ
zue>ryyg}L9^vXjYkWd7J4{-(r#c-o%=w4Eb6vTq+eA<KR_Bx#Um#~!bD(b0}kd17Q
zdhSmqEbQx1e?`js_N_s=rtxF}dRs6rgCI30)@1BOd<X!pv_|O_+At^h7vPbbQy<vC
zkTWvMV_Nr<J}&%8A6NdQua~|B&I{XE;nk#1Y~XN$9f3)I*1=Q|JBPcSN?294y*@tP
zK6-Y#Z9VL%hfl1Bef4n1E_tPkURjS5^E`20;86{k9{#NiYZIn)y&Pt@2CyXI@p@C6
zLSoU!8&zHC)vdv6EW|epd>g0V)nC(+wqV|>|2m=KbN|I@JfWlbtN3-*=8({#!^u8Q
z7tz1PEW_<5JDYU+(C~l;e9JEr>OPUGU$ze?+tafH(^n5m?;ZcP(xY&v^=6&o=;3dS
z71(p(>@0`VPr>OEoW62Jbr~6S{%SL?qit^Bw^eIY)P!FH(7mfPTJ_uBRZ&Zc-Bb(>
zyg2>){TEdSZOH=2Nfz{5YldQXS^#?YaC`T+?$mq_r&r|FE>|2D_8Oo7k-mKK^>%mD
zet2v@bf8my=ZdV#`GlBC@|bdt%T5mO)bm%p*El)ldU;Xv&$@?Cvh7<>GaV3K#yq@t
z^}4zU{0T;pN<r^FHB-ezg(m#VuxKc5OT0+44Ibw;xV^jUcHrd`=lA|gclf(|Upv2F
z9Dd{c?)-!EvwPzH?6`yLkzJq+lirBOU~0Vl(A26HA)r@H6S1CPvtBa*`^5nJ#Q=-&
z3`@%y^wYzm?%`qP*^8sji!2SzVoz4%IxyN+A@%HZ5076Sb#jPsQm&Ci3=}w7Oo2cU
z-M!-zGbR0Y+v4Q}4f;ZIH*H$$(5Ke|&cTT)n&owB7teAJU6+%((>AT8{$rB(uiEWq
z^{aAuvz(O8JA8FjqaryQ`}4pbU@VxTtvw~&BfC&~De;AAw^x5d!CmNUoBVwf3@su)
z8d4~e3LJ~I%axu){Vhucd2Bs3Bfph+k8UNKw+6LagU4Rw)_@{JiKuWZsR2?wHuU#r
zFtd^dcLjTmJFJA*#aa8RJodu~Fr{x&YDulM;ufsoPtne*N2QhHiY3WZYu1l7Iel63
zOI3)AsLE^<Fc1veHkLjoqj)A?h2i3_GIuC~Qy`X2u&FRPy?`Inv#-kQ(EBpZt6iq5
zIym;Pw5?9HCWR(RsvoQzm8Sc$n&qd$%&mmbXvU46J^nNisQBcK^?g!ZBHAZ;#75%1
z5fa~6y;R*waKfu3INq9UVxJ-#xrGPGv_KY$JeKBQp)0;w%PcdLE@JH_;}BF?qalQU
zoT0$P@ZW)?dk$-6l}gKSE^5GEvVEz!k15a&N~fvk7)(QC*8I`G6q(=#<5%K?g#h(v
zF$$1tSmH;!&AyQAtMg7M0?0OAv_KOwr+=%R;vMBm?)h^#AC2-xiQ#~3W=e5M%&}>x
z2SoL$o2eBsG!!YcWj)dO9&(5C2A}FZZD!%?8nuYa@h`2<d)Lnb`;R!mNRyu+{`38u
z_|JDg`~QEEk8S@U6HW@?=C2#g#$D6_|LV?0^G@?uUh~1`-Cu3OmpmI_4or18Arpt_
zOvU2jh^yD{90wqnPNP)dQ@&kX9t_n4J~hu~;W%)$$~4rJUb(yXWJy#3l_1qsAN%sG
zWQUiF6D#RKZd#;*j8|GGOHoq@5poraE*B_=qYWzNSHS3?+TJ8gBz_ZLccYe3h4xW7
z1$uEj3Vg~Nsv>LIAq7)@&8imVUXkMJ+0aT)0AeDaaMcJXUp4#q22nLtGc+l5bSy0C
z#9i*h+YBCaeNnVaaT+Wqe9$?IOi!CCSCQ>b+}z4(a2kv;rgctxc{9d7UFp0_f?{dL
zp$2@*O;pURqqD8SVKu*7)ZDUeP2=&>ZaE3^;swQ9OGZJ7jZ~9pknD^`p68BcHl7p?
zM<u6uMf%zO7YEz>c4Q{8x7-o}U`Q2C_6E<j5)i-J6gJYi`y{aj`B=e<B3E(jfsa-*
zzlT+%CZeo;qus0=*w|7!0%0hKE*8<P0mx-5`BR2xeKPMDvTHY1^<ZH-9{IUl=#%I6
zf*yz;BBr#e7(1aV)vHvickG97w%_^f@#%}s5ggHXa)$rGnV3$1QQz66SOgQXmZNLM
zpS<h9pSEv(htcz+*?IfcxaJM~>o%NFy>mDxw{JbKVa$Z~t$kntLBD<LxP}!y?~;mL
zg7ocO)7Kw?|0aWE*8U2(%?GA;N(Gmrj8}_t^P!)fiWEB!3V9g6Rg{-lskG{?ng>9#
zCqF2J{QbRpfNO;}k4K)QiN=uWbPm^1HRMD<Z&h#=Y}Ml?b(X2rPV;U<!H%8Xd?aSG
zoYK)p<)|@jG*ufofP|SGrWK=vV(=Q3u=S?5$&4hnI$m#@rH|e<DUMDJrq<ipyHLR3
zojOl<8r*fgVC&7QVs8|IA(Zssv)Cdf8HTm7Q`|qAX;wBCa7P|VnIxlsIEF8j#Q{V+
zkl83&2pt*9ri-c{10_tn3+jMX5zr-@TcWn9^v+(s)n`_XqTcDun^^^kx$$!=5g_9c
zcDNeVshH3fVrMrSqfysbVISLWd#hirs>n4jPj>X;fO62_*_a^Ro(VosImbqoZ^DW9
z!<VaW02!+$3Ac7-Y>{56s7-9$$Dv^nQ@ZJ_oTjyb7#DOrsi1~yZC0*IKo29{aquFQ
zxes^jU&}`GYm5-1&0UEUbT~hI4VQt{mQmmv*B{Tuu)LL`)hPsg*(wCT@(Ljrw@Ts9
zykfw@ZCLO#w?*6}>~e9m-pnhA+lo~Vf37!wy|Iy3_R?(|e-;3B3tp!RYVJmbX)m%$
z({FW^Z?9X9BHn*>_q7(ObsDuEKZ3V904V-w(U0#pR;?N;fgLt}Tiqp+qGJo_eG7@!
z!~_+>|B^tG>ba6oU|w1a0GJ6gitS`U63;7`S`nE%H+SIeUX9HN`CTgdu9&m{pU}ZJ
zH3CR1gj4BjSy@0QBMjA!fr8*jK`}Kc7I<{+BrxK0nAIOZ4~0futE{h^o_NwKhru1v
zk~CR_IUND!Bk1>O#;kfHH&GuAk!vzUUG%MWNi%Yj<5grr-Y${quv>YoQZc{Oj$!4{
zL}5~&CeeUh@)r5ivqVo9GEc)38POPeQ=34C$_m(;IKwq(iA8QY=eRIxlIZEW&pH`m
zyaT;aaQG|#4W?z8$~HscVmaa-I^wE+CJkmf$a}L~NiAY725cu?jQNsV4EavFoUo>5
z%LNF_I$e?%e!b}yjI%8Ze?kGIt|Iz#X=Fj^;=-k*G_WVT0x=A(k;hq7S1`Wz8`)wK
zO=U<W6hBsNkQFUe<ZmqQD|2|TjtR4+2P1TAETZ8oY*o6V`<ULvg|L@ce7n^_Fff%{
zlr%9%Gw`8_Dcx}cor{rt&cIa)8xnWOcE+E*LJsv)cjt5)BOAisox^T-`=rC)PriG>
z-}Vm=&~E0tA_PE@gO~fAqrDv}ezLdUdApTv()KEWrrG9&+AjmI0P-vM;}M42rLVZ8
z%S_22K}@g9(sr5roI+fGWyE)xwJvYdT8B}QB*#2QB;$DE=p`@*a~#QpNv~8_3l8cU
z<rPF{Jb7L7M$0uo!Bxf~f#wLGYw`&xO*Qtp^X=Zr>G8{*ozC&Gdn>1%bSTXwDyK$a
zkFg5iek#*B8%BX2bzFa2qgMk)wR(j=)f-t5_|{rY@>bMkRMlwD^viH&0mYy4h7}O}
zPU|k@9c!!fJN~KPk)Fi7!=Lg_Bfng8$X{NoF-TQw45A!TW00TxlB0YQQ7O-?4_cyj
z%G!{<hT};PoyJK4d!p2(VKQUZfg9T4F#uriF`nTpf&HcR{6(Kd_djAn{lRT4zW-@$
z+<WjKegD(i_#FS`lYE@}ADM890n@?|&@H(Dg8v?%6F}?NoA+`qfKD(-1u2X;KO{-u
zcum0&Z|E6de1f@}?G~(`q@qQG+)5Wa_Js_^bj=v~^JNZ&)bP)^hjKrD5mKHvjtzpn
zw$njxAD^6_Y(HCJx%K%`XM4BgczeRj<CTgkx8AI3J!t1@HuX(wAcohu#ZoHY^vR2(
z!;?c7i1VHd3$6F5l+-7?(5v5ezOzc)HQjhgexT_2O!+lI?C-NottaPB%4hW1&LL+3
zRbRF=upQ2X!uRhwF<=f<3hzAj`_q`xT}Z4F1YxKAWN%)nQnm5I4RJdwx<hN|LAM1o
zb4rQyX4ZF1HX97m9X;ochLJj-U}x+R%j0J|QWAN*-8TBKs+Wj{T&yC|n5oS=;F|uQ
z^>JsADBwzB5#QWMNj*Jm^lM3OB<-E}XJ>%3uXQWNYn`64j%I}e@o?r8_P3j5+-|W+
ziP(dkv+I+$uGO-)k26TOj+9`JqS08hG@G$5HO>u-xYw<^B_-xzaSTPbyhw4m<t2Qh
zQ=T<hxyAX!>6BJxSNRo`m%Cd>>4$Txh%19zW1a+45Z(OzDld;aN9fp{8VBWiEEou}
zAh$fFv|HRz7c<40*4(M}`;@{{*r7AM3}yvmSJofTW~SY<zH*LOA<-N}$w?(lEKUHg
zY97_2l8v*zsXfW5oHr5&z{J##3hHYLb1Ftw6e-)SBUM?GTg|)e^c%gZER37_mD>(H
z^1gD~nin+X3^Co<+<=(7P0dY9bE~2LsGu2(#Iw!xM+U-q0RS_R>DuR}a<8DWSuD<M
z^ej{swyRb^&QzRR!Nf+VFi3O_5~^3+h@!f>eZU~8#<z%6;Z?<4aUa7wlPQLjAa6p7
zg>LUh)IU7Uq2M3&uPYcolp?#0OyKM<Qwso#a8GC*;ZIbx;1_#HXZ`aAtSxI?)Y>S#
z2qIXRm9yGAG=`-rH*67c0$>J+>$6(Am=2z1I0fGKW!VHg1+)upvB`=+n$6l~Cvb}E
z!nG?N*iSl^X?Pm9sXlCAr?Fnc?aGyUqQTOhfsO?>?8!UBp5(xG7-qVO-a9wZ%V|RP
zi!^XyC*9gI@Emf`YUHfnridd(+<-Z~s;1lJty9%^NeyGx*PwJY-K+V}-7ACZcj}j7
zAwOToc*lLmZYh@h^L0xJDDT*@pC4T)X}x2oCbOTrS9HR<Nv}#y$0PuE@5d(o(^4Hv
z#iDLe?^*yrKWfsWrtWdvln#4sFK)^AEqV-H#3y)`DePX{l-}`vg&MzruVR4BCzOjP
zz%0HX$;HzFCB=?mBTHssL`F1pV7Rl!M_i7)2L&n#8Ef%xm!CuDlUB0A-%6ZqLn8K3
zf*OK@=35*cG+WzL&agIq#ox1}$#2gyZ-qwqwfxXSnkh>z>J$IUbZOR_xdSRFmoA1m
zk76ONOxdV-n2|M1hh?d~84ks;2RnN;{-SMHhj&eh)Rt`jICT`V0xT&yq+o<9G|(Wp
zGSe7v-t$BS8f80P3Ub4TT~=C1+#6~=d$v_!a_|`0J$*U$uY8c;BX2MtkFU8|m553O
zVxt1svIRbI;v4aGqI(ACOD8_)tKeJwRQtf=VfWlm&gGh20`c(u@mmzy>1@j#w&UlT
zU<xb5NbE}rv>QpPbm46#P|J|~k@~K`xIGt)s+TD4zdxdWAjSErHzzPRL6?fs#WX$+
zW<E_~-pe4m$j928kVaj%bsx(6fxR|}1?8wz=w*&R#WPXs#jsiX9nBMtX@~c`cF<hc
zQ+-W5+uerN)+P*2$H(==gbjVy!a<M&l>$_u(^;tFpN;(qvlNLHLMw)YUtvL)RJ(Ei
zYr4!5?;}}gCT^NfiQ;JPKyIFfi0^c`tu^htBe|G(pP)-Ex2O)yC0$QB{^)0dSCuaP
zhc~NcxK?BU{aa(edNxVHn51ABhb!%(FX+~fT!+4`lpbsZ2Psy7@v=szId0P!9%&aQ
zu`X04#Rt!>uKo4whqiAXQZiABXtu_F@<tT1!DT&}T~k7FgkW>|ueXmd9>MeNWB9YO
z(oDbDJLWGdE3NdagHC6cYu(EUeaDpZlT8TXKBi}Z-NuBdF_^D}RJ)`Ex{930Gy-V)
zA}|v~o@HCOqL)_1v!4WMqb_Y(D$a?~X{P)Casq33;o`pFj#Imd*>@=DoEO5Q_%gCx
z7L2x3!w?~fB4D1&PfX+&L|%Us1FxtW`#a`^Vx3C4<bd|xz~V<blS+84r>l7GP}U~X
z;9@KH4e6Ze&0B9IjFI>vzP423&?V&Hj&fEWioX2&(u#vFi+Xpq?3JJxLT14rhz#@2
z%+8K9%M)aGL8+W~G!GwIlO_$nYQDztDJXf78y7a<@?}zU3o5CBMBsOG;4>9C(A5vp
zoa=^1)I$Tnl9z6#*hSrkQJmEu_Zu(?RSQn{=5W5u0b~^S$n%{wB*N2ggKIJTur_j6
z8*dTg0mfsI`wv>yu#!MZ2_xbiWLN4%Z>-6jUA!TY2b#&5K>}yg|8QEm@QJvoTjA*&
zto4?P<<w@{%Uk}6h=(KpO!#^8(W8ks4t&^=XZ{&TBIoe{<Nb$hLq0))jv_^RR{at3
z><C+z*pg>0opKcSBYd?gQB&<LIZxhEEQv}pJg$hjM7g$LS2jleg&P<qf0P>0wWNZK
zlaM3kBwjCoX%P1-{hR>iZFOqzwECgPL(i-Mz2%Wu?D&UqJeZGQ(AqVEXaHqi3Qb9%
zthDOTp-bLITh7he2;fwb8mH&Oq*6xpN-%EIzi0;5Zf}4DY=YQUKo-93aj7a6s5(cL
z*(I!ZijM#@?nFXUb6J_;N}^)$wf<O7vI7VB)8T0p%AN1ZO69iu<g{AKgv6C8P8Hm;
zG^#;3LL#F6Q8D@jKhdg=B>ZgjcrN5soI}P{UYz;EQ~1&v_HI^o*lXeU%7P+ro}jE+
zhZt`D9rI{uAh0G{1J60qBsKfWac!E-50HxIc}NCT7sLEqT8`)0c=m2dsI1S0e@YuQ
zh+mWCy}4m$yhfvu8|n1$w0}O2-e6V?E)7z8D#R%X+BNG$WXCN1tF`8N_s;_RABl_j
z;SS)-;(u<m?q}?OTA$;8ev*%E|Dz^c=YYB==0Eq~Kd<@g&HK&Gd(Eu*&nSj71ZHN5
z$CD7P%F!NzR@gho1U25<)^<SM`k8XTqmcK$Y2mr61+hePk`<(cC=j1C|621fmiO=W
z4%fWj!54|zy+)25c6=Z{AmU-oAE=PpzX*p26|k~{(esZ_PM_=@Y#;4)jy1;io>uxb
z>kgaUypHJ+S#_rhu27uHe$_7MxEqR}nCb;ga?R=I<@q%Q@JO@l%5nX1w<b>GNCY<7
z5XqElP=vgR5yn=@&RR^BC2#TZcLyii-;%Md;>wynpj-RF7`ol7MJ(v7;Ik*>)QV3j
zjTgPpIN=f?dRC4xWUI)bReZXGE-S}X2maUis0PBsifQfkRjpae2?R^!fq)2;ZkJNs
zbdhZO>>`@t$a*~|jXPmmInJ~JXTLk8D|A5F?*P8a6TSD;t4zN{xvo5iv&4jR;sE~2
z89z)ta=UR3ScO~U6+p8Q0YAmy^(qh29vVxh0g?QZg@c{EdW3!K`6Nf7Gh?}^1xuVk
zI0s_XpKi-4cEhggAiNBVEy~kittoJzDuk0C9(>1GSS2@$xeCLD$0!y3izW{B6v@Qz
z2TbtrkC{NvCgj9CHcp(!7_T0=6W8W4=#oO=N+q_zZ0d(26rs?Gi%u+=5JWWpD73r8
zmx)3YwblF{Q%ofeNQxub$DUjW;bUK-njNu=3oC_WJ5u;lD@7p5+DL`_a>!Nsgtc{K
z9=F$eE-5Edc9<$Y(2}u+HSA?}#BU0QE9n8vNZ+&zf+{&i6e`m0!WdP#fqB{HuWfNH
zQpl)qy>38E6R8)TtT<L2RXgHsUbtSVp)4V4R*S%1imK~Ky_O9~&04j`)uNg@NUwFj
z##m+mvOd!QbeO*twUZG~QCALbL}8AdoSofC!R#`5ShG7RoLz|%)s}_7sE9+wv<h?}
zz?>Dji$c!(lC4tw7mN=b%FW<(;k<>aUYf;<m8<!!^3_2>qpXIu+m+%AP@9dxwgAz*
zdh%;Il(dy8CMtP%L|#r*H@8GCQR#?l1)M_|mW2piV*w_tsB24T%`TZ5_Iol`q&7u*
zvh%I4<8VNp+u`U%k3Bk!?{9y*v$Ngp9vcC(jI7?9#b~w=OlY$oB5Ix@YA}0WOqjvv
zwlRR-AvwosZHR^+DkG|@pqEf;pep#Cyp+&)=E20Q5*5)hL(A?ZSLQw5YPBuNQazO$
ztn4d&kClC8-)5!W>b?57HZ;H0re-~4b|DW?&iWE?{OnY$8!3jKh+X)Lra>dOUe~{5
zKIw@_9>ZMrB!T+!Mac74bY^+p+1~9OspvlRCdqq4X&Bfzp>nPUWJIA<4K+YG&0!FP
z^PCba2jgHFs>r~6B+eXa>2!j}RiSa}4xjfdMHDQSnw;Zm)-jG8!P5sh!h}YRcPxvB
z5~!MBukwrIy&gB{C;qeE+_EFTa<RPNuTrPn3nPDeEjAZc6j%!;PH>~!?$Y1iwSPx{
zdu_@cRkA1a_OT^3JM7{1aZL-M;VhW?=yqOie^ss;?6P||BONiS^m1x?SuMBbotsla
z8%K+CIk|?pbcU&R9Oq$`ov_c>+XZjo<=XlBdYcpa5ovslba8l)^XBQ{(f;;{`(lkd
zS-pL=C8+@L80tr8wM7!ORo2=QxAI=_DI)(}N@UI!uw1X*_Z26k(?;VyYV_qC5GMAC
zh|X9rRTKi?-(C>Q&!6}HEYkn_r~Mz3IQn1>@Iw7>v(;?fZKd_U_gkOyzkZSrumaT9
z?)?4n;el88=ua}AOycQGd2s?yf&VNOE-D6F8_kV6{L}KheSiAKdodpkF`eoo^uznj
zo9ifOz|Pt5=Z~fO3ryLWByw?zb|}4T4|oo6o<WUoR^uUUj%O4|kS<&&!8AcPyWWg1
zx)G2M`{?9aCss}3;q20%22g(B`AHJ@IcxhM?$6PDPHsv=G`y<J&I1HdK9)-5YK<*r
z{Shi7(aJ=<(xFi>@%%I-{#z60Md^tuK@O+f4niO#k;%(E32M|^3|lt{hxj+3@lEEv
zQJ9?95DY9pXrMQr;e8W6?*|c9gaO?_8_9q?EGHow`r3V@GSCo0nIL{=f-!3S@*FK=
z?I8iWhOl8n!@+>YjkaynC|y-EATpDSN2B->^+O=D4A`l6Qzr5R-updNBK0*zM6A@O
z-q2mRnQVELoTH;;kI-*>fcn<prq~mbSwqSnIb}1x)Sw%xAJ049@!`{xZ?=y*-rlkI
z;^^?}z1_~PSKdB`-{qS3&ECoL!<Q$Rr1xn1;N&~+@Ts?b@SXSDy@OrCeCOL2N1fwi
z@9@am+kesB!xXuD2Rq%DyL$)EyeClg;PAxj?(OfL0Nj&9YEz)?b)eo;gtFf`+IbF7
zwx8^E_fEd6c~AFF4iGFz4c@l*V*BW1Z|7xq`^bCo^616kamT~tya$H|dk0TZsnOZ*
z9Gu{&plx{Ub-sq*-tludAW?(cFJTx*)XSa27vCMBXNvdyu!~}>_oM^;Lz8=M?ch6F
zs@?6q{hGJCy}$jeLlqAJ&=HlCK7RAOLyw@zZTOE(SpYvfhX*G|@RRU!a(Hy2Yk#wc
ziGa6{_Kp!bPmd0v1;j2?IwUwy^`OIm5cAk~1fu5%O5t!`9(PQSc01c$0C$Y_?FmJ6
zu*v$4e-ZdIqCUl+%F%o@Dl11MB<yJ*RwM!P0MBtF^b(-AKp2_lu`P3=@-_i|BX992
zM^yvOSte@nd%XK$V-0S7PXe&LJb7CGl}Sv?eL!e~K(fr^O1KP(;=KtvYz??^*hAtu
zoVErHZx8bb|9&1$k^eD7&b&#7F<g5lxYZzz0tNv5MvPfeg5&VY(!0O+FZ`rG4JSCN
zF<W=5j*+E{EF|Xflc3M+Ly9nX3Gp<#R+|9yRMy);JPS6xT~yXm7{COxDWHYP?A(t)
z_T}dd+D-s^G=Ku(SriUKK(&C!4+s9ayK$=u$AHK`)Ar?wM^<{6@)n<QH)-yGuZ4+$
zfbI`rALDre4|@~E$~^xLThE|aoJa~@95M!fW^yw3jO;_VJaY8dpPi@TP)l@y$Jxur
z+(^;ZQ)mEAQf|rN1f!It3N{*d_&=1xl6d4#!(<p<appoDCV}?s)BVF;j67m24(+Fa
ztTIt?*<6x2wdKf@sx42kcB|2BY?#`xAis&HZ~SQtCtnf}j=6i@WaQ7#@HsJoBH`a*
zg?&Tdi29}INGkN4d=D$?5%7f5y@Qj^(ZP226dBA@@?})7_xFyG>Bt+~NDo`Ms(R=Q
z8Tk=@1+e@bf7HnrsG7MU-0eKwe%U=aJqG3sO#|nGA)j~~MFozwfvtJ1qSwdUPdi>S
zTf1|BiPKQsb-LSm0W7fz0&k|&Zs#VY1lHcc*T6A%CBNNqPL~B-x?r;i;%_^h7pG5N
zK79)8xUi6<(}V4DXOBpuc~4(F@9rJr29$2G^a~0iyQE(??f!<ILv@RedB2s><mus)
zzdwD_dA4^@vmSJ4o2Q?!XS?t5f%RT8zRNF@6&`=dorihZ?W*rPhuy;i^J9O1Tm7(L
zfAbu~2cVRlj(&M`bg03<JoxRw;Wr1Rw;nE3&YpaVgFKyWrQ%4jZBn`zDsFU0DOj==
zHY6%nS>wYz&=_$aIb|3t<~QTT{1(jE1-f1Hi?Cz=1pJtvPD=(yRsqD4`6+mk2iOvY
zf65wFz$b%AKwXP|ziQooAOSQ9n?cg|CqWCp^D8pT)Vmz+8d#RJJE#)H_?fu(p?^3E
zuW{d3`#pKD;1<S4aJt5uAefv=(skT5gPCQv4$n_#7VIr<kFEIWVM00JPdS*S7@}ui
zlSOFJ%fufBnRjFV>J$$Av-8Xwi8Fi3ju;6!5+DXzUi-1vp)x3Ci5MnhvFdZZQ&gUY
zcm~KcU}3}>?;yx+J^kM5w=5Yz%`iNp<&sMc_Tph*ru5Uv%y>=ljI7PZ6Xij15{y9<
zV%;hHJqxnFYo6N^Z>>K(Gd&lnD%EYCo5EgaX&C<)pybfUKW*QM^w1LVcvJ7hJA$!m
z9#h;I4wkSbz7Fhuq1$6Xr{o;w@~V6`h5xpAdC|%;4C?#u=cxI?5P|%)X}-41*Sl)%
z^Ur(c&3*Irf%*E-l<)D=8UKk)nVu;#<fl{fGB96<PTNh>*QV)f)AY6J_O)sH+BAJ_
zn!Yw4y5)am-u&8p_089wTfT4J49r*4|K`wQlQsF5^ETI<XPJL9wHE&iFz@6vb%THZ
zUDe@i*nh3P`)H&9l=m=?^8PwH__@yKI{!B6NLW)2QVNIDr+d#{(h>B)Gl5HG%T380
z^m7=@`seb{_L1PEdIiD?3q`{-Ns=*(b&#qN`;3Ui2+19lrpoMum(O29HI+@mvlB@`
z&GM6%&o;f6I@b>MP3{}G2Xppj!rOO(A-BrZDGtHhi8vJaIqIB2lmZ#aI0^gHvpFlf
z&i#wP>jkJon#LF5fOS{i3!mehQ^p*;SU}yjgdQ}`;^?6ojwhpQ*1sXxSK(_?h(o8t
zh(vp;<43wp?-Jx-)fmpof=PiorxbYKo)FFjg3;I2)Nma6=^6Dxq5g~mq>rlJqc)YU
z(ZA@ol;?6&9+G+nt!c)1jiOPcaeR3mswmVJZ0U$KkvanSC^b7dbf)h2(FlkF%8BK!
z$6=e<+1i<M3;hOnh!BD<)lVhra~5qBgBggCf30C?4UkZm`XFK9aTsweI87+b^LcPO
z9Vch69^89vBwrDP4Y`{nGSCy%i)z)9z*Vdl6T4dFWU*@)@jHnmpC-4j(+%)Xw8_!N
z+6t?^V0MYLev40^nC6&=g+tnMSEEf&7ziJzh<kYZwtRsnP>-TnOPdCS!mQV}&jfEv
zie8=cMWdQ7pCXxNnmz)G70%~py@)BMXaSkzQ3(S1xFlj9V%CIqYx;n63TL!Hkxb69
zhssDT*2;M0cu0p0Onyup-g|3PlN7eeN3EE)XM-~{qB{a5n$C3GkUp`P0RmLORaCe<
zr<#K-ix%9JNp=-rni{z2v`!z856g}5Zh=#Kqry{Wyv{%>25Q^e;B?vMftkT9o3ln@
zQE;Z`sTlJk-LY4y*6Sj|-w~<~aIcC6WPlGlSa3C)2IBxPT}UUuUch|iC2F5dtczcY
z3L|~SDw6J3-XZQ(mti8VKC}<gV%qdJHnoc|ZG;SF%WH0WQE(AVQ;#3RbC3kMHiAKA
z(x$h~An*<Chj{Tq*EhIH11FJqL%>$BeBQ!^{r%KcQxTLK$}2!Ksa>_^-BozcG6rI7
zx1nDBajsfT(U{8Ik-Gs=+JQVEgd0krw0CfViu}b;?&d>5M5Tb(RCG6oiUipdFvv(m
zQIIfCMZ&nF0y5LIY7OO@zOh>}H(K5H0Ta{A6CSd7Nl%e(nqC>Kd{Q)|wT_<<4e6$r
zp+SbO^{%`ig~D-&toxI2&R4S~GoM!DetH5(_kc<?@8yl1&J%hrMca<XFdVOS83(d7
z(jPcX+LTc87!6Ks!BPK)iuM?@y6~HDFRPZ#y3}389(2gN!&X(eIMnR}8vv;N@Ei^=
zoIrS>wfL}|nx6jGqMoKjiK1f8b}zbhLY6Zacxuux<w^=t6~~jQ>dFJomW$WU>JGW!
zmXc%O=H5d;eS!DFRklv1Nr80~4zE);6sLmD9O+Yw5kf_rPR&RoO&gDvG_;Wt-_2oq
zFQOz1*D&e+fi@9453YP*7U9?*2@^1uAI6TOtTFXA<@I}$!NHM)Lf#ExkZ9lX0kX1T
zuGSYUuGEcA?gGn^q!$R$eD!36>G$A7H(6z=j%!IT4Q46o7D3Gw78mS9H^Jt|#6^Cy
z8Lsn*5P?BWr}6biRc>jv&790|tsAf%hKaavd%ux!hv9Bf%FTD}z1ma4%s`^x(jJLu
z4X{?#+75Q8Rqxr3$I+Ki0O;dc$D2=Nkajvz0LtM;M^=tLJo1>(TF_R`bhs(~I1}B7
zGyRrNPtW>gw}1}P#D%J6bOlm63_9O(XRD|pN#@yVq)aWWL?@O^9W?UER?)(lRUvKm
zW7SHFbXKjj8Bn&Z)OyLbnA+R2?G{7GH@nI9!8T^dv~QUbWoxE|xoq{ckrBtXSY)sC
z*xM-GOtetjl&lD2#)y)VW#w_=pRrA{W!#zI5tnT<WtFf`CGFH+=sogU_a7+dQu$CP
zw9!e3dze_Xm}Pk!pamnm#}kY{Q|6$UPIWk+lCF8esxlqpEe&|}r&R{6O@6lWO1-s8
zbq;oO%e;~@+At`$)N89$5u}=wA%maX5}Ue2_b|Vm?>D4KQ6rwbH<m;BaAr3w7u~Sj
zG^d=J(3cZRVr|imGp{$E)S<K?CQsS`hf-a9RZuA`s1!y+ltxKxEULSgs+(6PDu9oo
zSj~(4s0jGM4S>%IfTOCe2yVHc4lCx0YONOz1KCqit$N-V(p;dqv5*O@ZmfFiUYG);
zXr~*;Z(uj(nB)jq*+H`jjZIYV#)NDOH)?!i%hR7bI_kH>-!c^i+3;tppuqRva|!rc
zROAkqxKmi5Cm?!-C1z4$R#+mE5>a7^p_CXFmY7P3X<>;umzb}*xO^FfWF4pGP8s;K
zTcx?vrL7FzC^FZ%MpTp?EV$|idAA!`Ik9G0ui@L8ip-2U^ktV~o_p^B0wX}M&#hlB
zJ>%QbGPZAoJ^KW^!+sYaw1yyxB!S1VpvrkYBvJi(LMcVnRVc+_#qV-Ef%&z4ZjCX_
z$D9dzAe>5^K)luz2NI1$%b$ch&JScYRLF~gA{KKy;skL-(me$(JtuF6-8e|1)tQQ`
zBMs_Qf;zWCW_q0-rslSI9`#+NHCI5GiLzgmQ$o6kes4#3SCW%H6OGK3hER=nTOuC{
zeSZ^ADLZgNzGRpuea(B|RZw7>3+eMRNvaK=PxKeVK&jgNbsCVJtct)gx@Kd_F~Sg&
zN>y`@)K%!(NA7*s9<GHXfz@>uzyTEAU3-@?V!s!7=OD*HnM?oLZTZX(VZQ$H{w;J$
z2?p~?BV~Qdf%i{?@nm+5){SSg^9rL~jc?u4XA`L-lZVJXokw_HkSeR+mshL#y945!
zqi-0U4^JIx1TAAp6GD`|yl2R_Ut6Y{uo}5yu71rWEbf*RU#?**92oaPYmnXn7rZK;
zhU6O<=!m!Yov)3=Z4wi^%X7VQXiYYuEy=$@$wz!|GM`FiT$kSC_J(H?T7+^PRZ6LR
zDRmaUP?P+w{8X(yv7mipRvaAXtmQWgFf={=#)~km&Z8In(>YZu^9osGBmvYo{QH~W
zT2ZTIv4KIL<;d)PiHXcCiZTG8Zp{v`ZivTbqX@&z!RXz-?NCPLjb;#%UXQCe_sP=q
zp4cWlZhKAdE4y9Q_HY!#M(~CjeS^B!H&i$cOBIK=Y@(5VX|VfdD_avWy}q7(K`2LK
z7o+sCKj;h?M)sXGe%_YMHyh9U^MpKKk^AU7P@vFAn`pokRBa?!&9|)PMP*cXZ}Q3R
ziCHSKz3?J?=?h0wlW!GWVsPqBSp2kV-cgFc+1Z|IMCN0m(Y0b#N~T7E{v>@v@MTUp
z(dxL9TOj+?JX(>=S?WzPh{?x_ws9&(tvsb=o2#Ych}hhT?5$rev$%nPmE#Oh#A6(z
zH`xJ$D4w64qt_*x$<WnKjDh?Bhd6dQI#h7os~wP*f0gWmkkfd+7Es8_W)jZ=cD82e
ze+&qPy;W_X3d+l96ut?(GAohFwDTfu6I|vn*uP|k4zI$^S@5yFVJMyiB9>lNDE>P}
z5kg;B?>XJkp_+w~CgT{XkCyOQRe*W{+9!}GA=34axDtWylVF0aBZm|_KEP4BWd&&H
zhodAt*l&o>l6x)77JZ+L9K8P22MiA8jCN?G^X<ve_UZA-_ReorQX&O}=BS2#tC!@$
z%cx;K5su;fKLPH5U}eMGezDhZ7OhPqXhe~(aumBAYiwi%QB9G*ZEW;DQv6NC_?qET
zbn#9?^sPZPE7v<?%LcWxg=1E0f7r@fzT~zt#|CEQ?{aDop$1*OFFF3PYzHFMm^5ic
zW6c`B<jW-4@hssyd4~yG4$_Cbi2cU>n!abqN_a}Nd$p>y^;pFSIa=y%lGNLFn##z(
zMC%A(ktA!kTU%Wu#HzkDtsMX{I`uElf>}s{3v3;s1tUvtveTq!#yZd{s3}3>?J}Ib
zUR_M>O1k>coo4yz(fEMnh;}2}HkIlIHV0XFA(0hEUrd9GKzaVL!kuF%s5&XxlwG>v
zB{_hzCpZ3jcOgL?VasDnPCM`qFwV$cG}O1@CWhLQp*2%O6X`59pc<TYXKdaFTPAeB
z3``QE{mnp7F@so>&<0674s73f;2DAOu&iVKMixgJD=D$rCBAVm7TTkJuz{RiTx}2P
z_gfnyHyCTy3v}r;-nhej!GG^&J$9B}@qwN#I!>RRKHWdTD<l;s5I%U;Z+je#;q>fu
zIG$A$ID#{o@j9;7aPYN-H(LTy)xVnI*wUJX#k_!}`VZ#?Hx@W8?hle3dzvaq^iU_i
z%uboj;C@=IzSq$<wT0a9r27f>j%9~w!IWa6=1A=-YjiQ^oV|D{*c~sgrdC1TuHhb#
zTB#a^>+JjTX4yTBS`0DWamh5A>Uf?y^M)O<N4dG0?L<yP%Z`Svo1DbTd{#mlq}>4}
zb8R`QT)WGuuHz*U8Awk>32afq+nW>3$CEfRt*K^~iXv}~V(wTg;!$d)fJtOZu4G)&
zaxaiuKaGrTaVbl8En&@_#n;q(Og4CU-V|gg*2b<0B%Tw*JP%s_YFrA^4y(=>QEEEd
zzXHd0vsI1Prm5X?iN@EeOt;KX`~I?CQ>t&%XJ-a&?OUNv<z|FWJ9AchYoR#BZ?VQ>
zZzD%!bkADF&8r={5P5lf^^Hc8Pf-$sfAPHJh(x*2x)>nt<#Fc-^P}aFlx;DF+0WW+
z!1kfCnbjHmuxO?O@T<pn@Dgn-c?&sxdBsVnSmRNs0m#pj=SQ9GU5k&bk@hJ&;Hrx3
z)(ebwVvu3LH_<TC-sjlRmR-)9yB)mEGh5{5-qBVw<6ddaiewc&HFi#^*K6rFCU{WZ
z(Qb*`DIR~wCe-*LHnr29*0?UzFu4bcmq4wPX?TISkjp`9imX^WZSQveNUhP5-B+G5
zdEQax2rnSL;3{M#)w0G@)?}HsQS)av?rH-HH~Wp6m#Kq=p-BNO8<RaO`!-gI*rW6Y
zW|et&ji1veDv|bKV~Yhc7hGb%AZAYNOOPibNB|tsQ!EqPsES0K@z&@|b<0_4=fTw=
zJPT)-T#*y|og1A8;sPyj9<}kQhq}{qc2HaW^=evUO0Vi3lsBiKr!ge~$B>7_YlUL4
z<R9T^a@A7TeAtk$8?xFNX4`3Qc<ZV$f7L~KJ!1haR-91&o|Dwk9wrt;B)qacm_y4J
zSWIcRk9YR=sA(#WN^Nq-g{J5M_f&;_Bz?GIblMscm3>Mjpdlqrlw1bFAF|djFkZTs
z(GBt_$YRNvSomRXq7}k*;YaQvF@;X`$Wa@}dx5b5FdlhLIB>4pP~>fs-u^28Ws6?k
zOTCnV+<k3%E#VAcidJPWg#U1cZkPs&1=_H!O*lHJT-~tz!?8QjU@Z3Td6=q<Zob#%
zv*E8&7vCB<te#VRFG(-)Yt1cTT|aGH@yEHA(A|856#ww4jcNpk*lQbbnJdoB4QI2-
z?RfHcadQRjSp^?I_8wHdKSJpp%ZY}HHd94!L!rA*x$v(xGF@$DyUKkuUA;k{pFX`=
zr;*;UBc1$SXGU1md8*TTw~^k>87U1dXQVe6a`Wkp2mLGV)6<&_8ZmT(QNJ6e?!FtQ
z?&aMgv!@4#D#qJP_PS*EXM#$CZVdA1Sr|p)@{KFH`M|R*rZ&Cr=ikBy*Zuc%yxu&U
z`xG9XV|A0j!pda|GOlH4WW1JfC~A;7%(lc~B~EezkdhJZzKX$c>|c^h*dJ8IxTBp_
zo%|`jHEKxw!G%wucxha611i_7(l!rLSvO1Y6=7kU-UeVSnfLLPiR23(H1DC^ByF!_
zi%w!(cFL%#WTgiuh6hdUz1PY#6O|lrCX3H-_!B>z>YHQWoQw<RpH?Kp6bqyHcM8TS
z$N(u3TK(Yuo$`_Ofh9Xo&>MTw=i+xjo!0c%cD8sNSpD&2HWdrBoCRl}a;<$%wJR+q
zso~Es{fZmsz2$M*_INtpbariE1<j^+<z4HKdi@R3IoUUDde=y>2=P2TJ4dOe2ZDgQ
z-PZke0AtOjRTD4umsC{scj#uHZ5Z6Kc@^paS`NgQjvY*Dl|TK}#s(d0Hm-K*t9#u+
z;*Ge=HWO>|Rn~fHCUxoIws3DFrGZG#k7~;VH{$g~7cD3qxF(h9*47;QFqB7{ax}yC
z{`g0y{h|t#{hTVzS8pUc*}Z4Vb~?`}uzKsPoJBP5j>DDkTp*9q>YXCw+7sD|1{%9;
zNJxP$^wg#hoNAJ&W(P^-OQM>c8_qB63jH~;-mJ7|wP-Ve%#H+G(j)ROD8T9MHW%Ak
z2JVk;MG#eS$Hr)!ma@xcV$F;kqz({SnN|A`Qq8Q`$pWVlHVsGn66bpnBirVUiup9{
zT(Tdr;TP{pxffL9U~HSE)*sKtlbXj}F;r%eVcSB$jeI)c{4eKHHjl|UsJ_>MH)Z8L
zouWQUZFB?{2E*4++O^Dj#W-nOL#xYo69ZR@(h0pG=Zm%{P34akm$~RBc#t`}aV__-
zZg0_RmN$j&W7^Ha(p&Y<trIMYSyR5a;k#aA*M=)wB3oc-4)b4GGdO6s<vvY8JAM;R
zJbizy3!?s7714B~wyK#G5SW~2$)p`a%k}&7F)wyXHG`iu;dcYoN5-~#=>SLLXaXem
z11d_Mq`#4<)46~g+GnMd2Azuf2IoJ(xj_mu|MF_qX7fD9#`gt^p0ha_Bo5S0Ej>yZ
z{N^qXYe8hPP_wC2-sM~N;@{@6&lz3fdyv_e&uQ9WOUxM#Z(wOBtMo`1W6o}+J>M;0
zM$A?K$&$mBw8xVIbWtO=n^DRWpnv|_MT#}J?AEOcERmyG2+B9GHulh&*Gs2%Id{WP
zS*edwvJM%V=2&Q_$pAlZGdRg1+#B`TbmzUgk){S>Evw(J<}C}&WU`|$+g$|GxNrF)
zqg*>vBsM?`qO*}jw5Ac`iKdnW8t5`p8A$dfTR>ar$st>2|2$<j=M3R(hJDIVI{pm9
zXTmUkKaXKyRLWKDZ|xfF;I&egXQekfzRO*-eYyH`YXrBYyoqG4Z^4PtDyt^RyOVQD
zlH-w_VCr90HvagkS^xEG{`b`e{Ig!IG~~-yl~+OM^{e{&>#x)kaU(N3sn`zjPFlr{
zB*6j9;sN{uehtf;B330TU@4l3iB+oZFWS>!_bAHg>iR0brU)^0`Zv^JW9sTFm&u77
z<H9D8qrfNIy*~ugII)KiCMiQX=rrd*BEv8OQI=t#Vgl`B_3&1yDL3a4D>!5Vly8NK
z*o9r;Tx>L7jb%O2E$YEgN7$fS^+F=No&^zwqSVUmMy@_0+sp!8gq>i(7Q~EXaTNS$
zg4w1ga@{_@B7`>1ZT1QwCCiL~V{_^ytQgK%bCl!&t6RV(w!pKnTN_t3I$zr~kpq0g
z6(=G}!9knoB)xg^@f_a%k*-l_M_Rq2?6)>MeQrd2^-(uESo!vC`Xd)QRaL8N^)p>P
zg+c4lM#eZ4h9#h_Vd>Id@dpj)rUTBsD<(#+nT|m?tj#--AKBRa66iF-`zB0cJfR(G
zSk5!@SGx7wO3M6m5%Ijhm4aTF%xK&-gG)&}F~|y_wW`Ee!?UnZ-xsaGSR1b{K0{@B
z;rpE`qJddo>79e^c5-$OnH6pRDPz&=6?P5=Y@Jx06NS8WcE=kE8r-&$F&sM+s|jgA
z2P>e3j$4yfwpyfRq1$+0V)pe=Ia-Q>cix||a#%K1o;#T+pOx3F*2QYhgg7T4Nrx$i
zP=*5R;UduWco+(x&noOJn@!Qf`w;?hUAq7$PgzrO7~JEgdTMmI_E8gs7gzwZAes36
zK-03Eqa1^965dk+yLDi&WG9y{b$AFzx<?YT%YEsF9C5|<l;KT|Y^FDeSv(EMa)iPu
zQ;^I{?ob1mkhoJx9M>t!JTy((CmWTn)|pMh*Hn^gIHO)k*{Vj=4OJ1Ud%NUtrBpja
z-$F8^>s8mzC<UMM@zdgz4qCNJ#GayeSeEqEmi%pr-wHjPZS-I_yFsL<;VFe@_bGQ_
zlo8`S>5_Zpf`>?1ngxUY(uymR9(Lxqk>4>DncKQgV*U?{{Ol}1;xGxzm?9Km&@GV&
zRuS$yRb(7vwGm)QgeaAQQe81I0D2Y<&>?XcD*aB+vbfMC>EeL}LG7P`ksiZ@++S;6
z5YiT=;uI(Wau`n)2o*>14myNX*cIb4kf4dsWOPPEr{sQ8aRA9T8m@2cxzZ=4sVrYh
zR`ZnEO71jRo+#%cprH(8gdCP}jEIv`*H~<=Al?_$Um(V2yffZ=AIlpaQ(6{FnO*<J
zSo%_tnzd6K(^q>iX;DDzZ8JQX<pD9dHL=y5RfHPid+*mbV_Ew#I=4~Kx%=<eIc?Rs
zsBawT@I7&I6Z%Z6T5d|NcZ4kz01gx79A6V9>I_8~y1Nh=%GRD};Wyy?vXneqD4qCJ
zWe=lj(b<}eudKQhb;R~gPMt3O3Htv|L%xhhfrQqTW7-<)@a>c}+t(YdNN8sm)p$zo
zSE&VPLAmo07MqESCqko-hD&q~oZW%L3LV!&iGb6O&muCmB?VK%)~Ubiw##BGp;9M*
z7{meJ+i?#`blp9q6x}<RE1Qx|?|yf%y}!5P?RWMMkG}KZ`Qgs?NoTjAQkT>0YlB`-
z8vti@`y_KtEdkf4>Mh}!j5aw9J7I`b7j))!ec{p5?-HH)shaKBE)p|rI;TGZaNg-*
zk&82XaSS1n(L^>D*X$3qvc!*b?Q}J{fw;|ODeH{uI;`Eu9i83+aZUG+Q`ofgbbL8y
zB~>~t_fu|EtEtyU*c8J?TS5gA*nriRAeR7XVltvruP8q#rc=|3lWM!eca%VUE1@O9
z{ed68Z6Jd=TGA6h2&UpSw==9Hu?;{+7^~ULzOXt!>4PM^Ko2Es*LF*&*Yl6z0&);A
z%%#-ChA|lIU_oPAvt;c7>G%fOt-+3RpmCOscEF7<5xI+qF=ry5x|x$ChXCi1r$tZE
z<}tFtf~n0JWUb)vQ{V>5XlBn6^Z=NVBjl3la6Agsa+TAqqWZfMKSb?L+SsSjs1^II
z<r0VD-a73@CU&r?n>x=cUA%P<tFG|S+g1m)NuP8YhFwS~(~RVuT@{P>w!E`^s=Y7G
zy+e*qQ4SN<`<jHULf1UG)=ZCFM*jk%vsfN{3Y{qnf9{mc3)M5{P9taI&&B<s@lt5k
zcN}g%9#MGq+#&KsYrZ?=@-8y9yB-Cq-Q4CdxGo~Joo!M=Lf{oSdO+QM2aFY=tcWCU
zMwV&Pw8*n~diM9X-+6k_#TgYSOqS4-+{wDZl)M!QO;)W5<|e!<S6s2O{CpIiM!0dk
z8(KGDZ#U;`t&h*yByiUP#wL-KKbW!EkytX$6*pQ=+4T~taPDE%x$=Nf!ob*BL!<Yj
ztf?Gq{B^D=CjXDSq{@WL^5RAH^LtsT6dmGjZHd#4tF_uAHyy&s+reCMUO#m9Fa?8^
z+go-sX$Nc_Z9+R==UneB2AOfd&PfWFr-oS!RR?8HIg95@cLlz}4n!TCJr`n%wcZ3E
zDs&v@+`R|`0n~Jopz`e18(h{=I4bi&bpU5mAh0)lBBC=h^2LU&z>s)u?DD0Q_@nUb
ze5Ra_)g}}sY&{pkIWq7ExdM<~4~IqG%K5{}_!}=>!Mw&?JxHz(FSDCsA6~W4@Q1M~
z&D*pj3NO9>$S$}Dv$4#Fm<rJ(*qIltRf@@9RPXFM?zv5?An6@nRBF)HtqvK4Xp1Di
zUY?!%kys5^k|6Mop6+<}9<(0TKyd5BkwW%uwS7yzV5lRi8;S=^33~%Rogq6yWgOBS
z>3HbUA)F@qirO63GR`%<K>Q&qc;SaZjyFlI-%#2-1%vOvB@!c4WMdbd8W`KWoW^)-
zrsG}Fy(>_!6W~uF7lWUY=>lu-33KQw^~XPY)`RA2H(jNDU?s$es!D6f6q3aM1GXpp
zcDGfw#1hNz!05ch8yXRP9*+ic&o&FELHfFe5HkiANLo^JX%Y!a2eEi6vTaWy@vab{
z*uxr}lHr!R@1ao8ibAaRNzvvSP7;PtAE%AJKuD`tgqtg--Oky3^W~v*$t>!o;!NO;
zV^R@M=I9YLoH^p<g0}Odz%SK3;thD1z$?prXh!x(Yd#v57B1hjd+%WHWN*8>cbv{Q
zj;UC5qBM-V@O9@1v$WuLOi{j4&%8(8{f!noypAWpN_*iboN>5s3^jAV(Nq>(MADcs
zXdd+wjtr_SsySg2>?GrOFdxZQ<B=YfSGdj~joH7oIhc;8;FDH2oH8r$B!_te`UI?~
z7Xu#YW>Cdzzu$lpL_D9$Wxp+LIi2)Uk`}8$smM`qhVk<yRAV%s*sj^3&FfuF7L>$^
zRGKI0X`-&wNSxn7-G2bVKt8|yF={oDOz1WSACYj+DMFAx={=b>^=IKlkjk~KC@bxT
z4V{p)0s`yD6Vnl82Z9kTQ+8Bpqt*+jj>C2j5R^ZvKZ<eXU=bP!_K8N0#|dnZ-^&HV
zc?=?oZayU#I0>dI0D_$4Y6d}iE7v{X=t-tEiP>+r@Kz@Z5=R5T;}rH_a|;ntcKI1^
zz+<E$>MVt?2d+B`Ih%DtTK?@Mf$cfT0HF;^yVENRfGCdYn4@0V^&4Ls>++x2fZQ2j
z0KQF>%upz>Blwo{Y!{{55_Y*TqbK<>PN(+%JqmjP2QcL3^CJM59NxB${6hsA=)eTS
z1fxBHwcdfV#dx^}>s#gzRd`ksGlw4WffOU<I+Qi)-%}7h(M!aNtObLUm_yt)i$qNm
zScGm-p;Vzk9R=y1PF3i%&e74)OUEiBFGOCpL-m|E;TeytW7m8E%`hnIh1Z8I6&M>&
z6<dE#IeN1Yp!g80omdeSfEmNum|_t&HFu5pQX<GcmqjxRF)ZR1VX3g(W)=)$)7<Z|
zbFkN^t=(bp+0gxc*-9^SiB@x7SpJ+aQe*8Wpsz>*R}&10ulcrS7tyh;Em1#JBqv$5
zDqoPxIv;?(*~qDFZawn4mtQq=VUpWwI!I+s<CzR?xqz$~GC45p{BXI|Q#bQDAkugD
zxtLf0roaTi1p|asuDOKemf-Z3oM4pKo10!&g64_YrQxY2Jrf&~QfwlNndK9^TKQQe
zBP|oT?>AdG?Kv#u@bSm+K}YmV<(stcytKT<o3Wcf7`5lr(*~M_r1|Qi19@)pN3tzR
zffp2zEOW;b?0Hl#$u<bX_lXY^M>*X;+&$Rd?<{Kb6bslHCvyRbz`78SlqnYp&Ndrs
zQ1Zwd@iHt~$k3d7b(kiV1y}Pa!_@2~xG5Ra=9(7zpN3ax_=zqOoDVdGZYR%Yw!;f&
z8rGF+$rdhY4B_jHB3eWO0|Yi%DZ4~~ERbp3@R)ghbiwE4jh1<eCqcwRFWPg`_=PhP
zoRGZE0i~K|3VYT)e6romtYzOj8^t|;<dq3VS(IpnB8(0qDMRAgc`G87>eAU{9fq@b
z%rxCg25v~$VOQzpP~0jMzX&(|&;y2$T(<9dv!s1*lWfAj`26_<ACRHLq@K_W-2w3-
zxdXF%Cz<x|jF=$LKfDbLFYw^OJ^b5zcz?tGi=S5O-o_Wrd(GB^`}ZHV?n1fd!;NO^
z3vc7Yn_m8zqk)g-eKGINquG2xxh3!ajehQ|mDbk0U+xVyJvHIA3$N8^ZZw*Wrq|lo
zczCDTy3=~-HScb2v^HD!y=e>*&n)&jR}=4-SQ`~5R5$S|=YDct#fQg10LRzK^%P|V
zG`0%KlpUEz<Gdsar3kqtw|jc7)6we(P=q4M1zvf?*9DF9a;c;Xo<*pTpVh+ZO67KC
zR)vE<JV4%Vio6M~D^Ya?3q(*L1PS%J5xucW0E=}?zys?w#UO|G6{mg!A6HFR;Av|n
zkesGw7tmIz1c$)AQw(t`JNwDkEUN)Jp5q3Hxfm)Z%qM58I>PKxTUJG<N+MM({tV*k
zVgUIqV*)y><rB$(xVEf$s#nx}A(Z?+*d1_7EbB#a7nZ=`as&ot{}dQf-O(9N@@GUu
z*fs>E6nu`+7Q#OSlJI5GghW0TEPz58oeHWuRb;1rPI~3y29IZN_68Xm(3O$q4BBz~
zCJnEx;N9&!dHJkrRX)H&G2;w12a`An>9{Y!C~t~;-G?w4%*SIu8Uv0j;YEG<OY_IS
z_0NL+e-0<y-ly3A;lJ$ufA{nL|0zE9{x1^_`+u`>_rbgE|Cr2m;7@^<g}tdi4TI!n
zLV%G1sC8QkP!DV=0PB@G+Tw2mj8%vi9zk8g<<RvRKvf`+i9OxxcAjq^>~=dVD`ot#
zW=jxQV&|~C_XN*QE9HJXjps9XQATzJk59K>>=D1JsIw88hgV&$OD8`IAjZX45NTl*
zL!;MA!0nm-g>f;cFkS-Z@L0o%lVUh=vINfY$&m&mR;`7=`27-q``ahaHN>$$J1>TZ
zZ<j#ZHOL<Xz4?O9(d#A9x`*4l8s5b3zrov;LWoiz2PRT17NLux$uzhK<9T8h3sS8G
zl%#?Rsp+s16w6MES8`X+DF?f<*N;4^T%q)eFsmEY&pYhrkM&t{{)hdb|G{l6-v65q
zTKDg#_y6XD2cP%<Pw`2g|8c@u0QeOM0C!OU_|=__)}7`(ulZo}-h<8izseB+h>fvn
z2Ok3V{V1GZAUrr8+*lBhUH(xr8vqY$oIftPDglrN`Yv<cdy*#|SWo=<70EPZx0pOL
z@Sz-?h$`J09^j362IUokb5&Hca^6&He1#%4yr_ytd`rm>hzR`td6?qar1usTJ%2$z
zUaM`<U1ytbN%Ja63Ke7hdRt}Mbkobb3gj*sv$KVWx<OBAnk8v977e8+M!r=S@^*2R
zPqRyR;;J-;SIsL;H|RVDrNic!pLo-q;Qe>k$!+Auvr(2Cj2zo;15G91=sh1vYj{oP
z#^lb<NZy2GvE6hg`yFP)zSQq3e3Rjk_U%b$x1({r_oV59=*2=MEhnPlLe53uN1daV
zJ4ccon#@;jI8$T)Dk_+!(*wS3<;3qB`4f{nc^^J2xg_Y|Q72fEj!0^y+?0RTU@p=*
zSi4TfFob&HJ;pItW#AXavgxfoJY5~jZk1A3EjEr>`IC?16fbbO(_*kmG1w)OWXZ8~
zGaac~iE6rLLBTX2L~EolVn1NZCZ)^3|DjtcWA$>?E2Bwa+)HA#TrV3nQ_dP`E*|2H
zZF7nkdywJh=*Mf59J>Jpqrk99tT>4iE+wXou_q0oa?&YnXT1|+s;-;!uC*z~fPG0w
zfW`u3@zcs0X?fT*MwsH}b6Qp5nj*_M-wHYO)--%~Qxmw}<xC4X^Ov)6h#S7vE$Sw5
zAt0c~9-OZb&l+VvoK54)Rq?<HF{Tlk@uEPYE9<N105{9WTsN%OmD!{i0;(}*tPN8;
zUOj!stlXpA9Z}NPz@K{awE_9I2#LyhL1Qs%Zv_pM*}`0<s~lQ$3S?8(w9ivnR+erS
zyKt6OAf3f2NA)!KGdn0inI0B=Cs!{nTgb|1!X|ILShmb+Py`cCW{O;>uO-=;DovDm
zu;A_6^ap+gRkmBz#DlATK1)Kf^_@q9<SUs4D{vnUJ)WIQmJaE$!hwq^udX+MSp!A4
zsNQtYb(V)N+4<TEZ&ZN@(%XUukANiMk1M%lV6EHN|4S!^zN{;nb2bUy19N9M&|m`b
z_;KdfWrn1p@CO4jtw`TO5aympX0;w)euQR=$;gi-N8AuU6kFm*tpH_m%KLBSRzlwR
z95><CfCAmoF$A$}g+$RGwM6=H)c0YDNRM%MLVF}>T6K-y!BBaR=vA|H&TtC1KEXr}
zfr;-AY+4gV?IASpCzNW$Hv54R)*=`gte~9@TKXf50_ij>1cliJbyuG^pmpnYrJLGp
zYu>%oiAN*>dWP11WaS3WZ}-f}ge}TxWcI;C(F_+?I5t>T1I2eRz?!Fr`BumzM6n9t
z@@j`VJOZHxjCzXxX7JOy^w}YXc3o{BoZkiN0Im^UuoW4LOZ_E2F#ptkuMbxJhk4k4
zlf=^*{-{v25eyXb!}jPbp2AK&CWoQ@!`+wN?fTu-ns-FUZ8$;?&Voy*yM-0K?ZF_#
zC=%ZU$q3^$G=Kf;yNxOzrR^mO>${bAyBYGIADva1q*rD3`H$6fRyrKZX+IuM@|yAa
zPfxgh=1kG5YR?5Z;(Vp$=?FvpB(4FUeKN{_;nx+92Ih<&B+#=UO0ZK)Pf@+Pl1b{V
zqPlpP`N3aZa(cojAxf@SKBV206_+_v*oILuWF&TqoJAxK3#q3OW2A!95ePcyC`AK@
z{#P^ML|}u(3Cf$B5&xO<+^8cEG&R?Af}s|DI%oIiY@lgP4v^4~TgvK-8qwmD|7!Fa
zdi1I?TAx?%v|e)z{8#hW#cG6+yTMs+=GKW+6B}cbEaZg^AoNGn@>fRILh>hmMqs$7
zm;Qu`!FFzU$qFds9%yyr^ZJOq7OEn;5jYX7(~=|dTN!=PxWd8_j|xZJk`&iG;_&sO
zg7Jn1h?4@f_$*5p(Qt}q;U@F&2)p)`Eks-WGJu>APB}P#o5p-Ai}|}5%ol5@UW6C%
ztZ?zyo5d8U-`V5P4{6kZJrF@(U^f8;DDXd`Z?7fdoN|n$g+dNzqjh3XbKo@=(Tujd
zAK}kj<y_*ubW1Hs6n&<lAHgXB+H5pJX_gxMvC)`YlSq?02|zMgUk|-`G=r6lGlO2I
zFHA8@`QZ*5YJm`xKh?&Bm$u}`z%vSjw0JtOY}aW#2r`xAV-aD7Ifo}RwtD?XJ+>bO
z8_UNAwK8M7>*SADWBc*Z=w}?;k2z!GR>O?D5Q9)kJoxENkfLjZqFM@ADlYKbEQ9zl
z<04l?^~JnPft%N@bw(VPy5?1QEmXxz&YDVIG(f<5so-H*lXAG;w27JIydTj;I6*f=
zn0DnSeD05i;$@BWAM#!^LXSH*9Y=J{fbAGqM6h+*=;{`de{93j3)|42EpOBg*IPDr
z947iByhW{hd%oq(+dtNwlCt3<QhqcjK@maiq8EX<r>h}gFZrZq(>0}eWOD@Gh%rf?
z85Vgfrsc4rqxQ0U2KGXQ7xy;sa3P)c$$e2NRub1WyY*l1ZHWHLlIoym@zj#-h-D?>
zD(yR}p06xUd{gCmA_^~~JQ`z`4%Z!fb{VJjT-KyC@xI0q>^GDl`rG%D={;NIPWb`D
zDfE<_Y_w0>PwLEBQ>RAqI{K+B7Zl~1x~g!Whvr2nZ*VT*DgKcss5&o``d2*>9Z*f_
zE#)zDAAHQ;<Z;3f69W;ER%SNIPmEjC+Y)+2rA;A5wqZ-*fmlT_RjOKJF;g=*%bvde
z(wC)wgP;8S|DD4Z-yQ8edw%j!+E`})_wZrb{{KPqv;F_4`E=*L*A4q{$PG$$^MQ2@
zFG93XqIZ~}YajtmVBL;&iq`$T6IBNHt!X@%_n~wz7{!;3k`*L`_G|%4rp`$`oL!=;
zF>cowaHJP-)Cb(_dNE21eSZ*)!+wcM#N%-=?T7xzo6M(^7!xG{L?178=H!|l;dwoo
zHA<zY0AUc|!IhImPRS0z$KY=mYvz15n{3{>b9s5$K$C%ZdUi*K&^VusM;<_UzpbF~
zQz{wbhssVBl{NS3t&L_2F@hbac`sh>)Q`d#+I|7}#njELzs60ickP`~w3<PUaR<mp
z9pPC}qpX9`wKoZ-=-(ChRH{IqqBoRinsDp3u?_or+z-jIdl2_&pJcynG^R|v3dJ5f
zmKvxXrARmas3aLg)GHF|Kte&C1%=}eIVLO`TBv+M_<9tMLurA88pK0V!lO?T)To~|
zbeRl?_&1<oP3FB(n4D7_UI5*LDTc|zhcr<&9LF7$wu8~A1Q5`MPDoPqt|nob5jW7j
zpolI>F3%-$l^#i$l!ma;K$ALrO%hX!6s1aHUzm&luy+sWjv?7Bl`yU}Cspg~X^z;&
zg}Q(fFfp?#uaa|L<<lX{6x3Un@R1tM6q`rG+8I$jo-45bsbK=eoILM%$A?c(zS%zN
zczeg*i=)G@_jWtGUU~Z%e!~Wiv9S+do_J8=X#3#gJMZwRw|(%P_uIXL-I~|=_Qg@>
z_}Du<D(&sR=<apk+1|lU_vJ2Tg?R$?Fvxay4;DKBJvsESK>@YbIYwanoui%S@N@gg
zUU%>0yISe#-pK*Ne0q4~ZF?`ak52Y>UUs*SfY6U#93FR|`CR~euy^njgT{6CI|nBX
z51NICUgvB0<sCoAu-?#CY5OH~{|Gzi>8;6oe%RgZz{4jU=o;#|xh)vgPIr56zvk_3
z?{7crP_09Na#X@%+&%A`=N){6?QO$<BxT|_b`B3tj^JkvhIw?NtA4Y045G>Q(cUp)
z<mu7jeyxP~gc^qg1nM1h7z)K9ccui2;P02m9SzXi?SR~L@C@eXz?r|FgZWe>wWh{h
zRf|&j`~UO3V;KH-A8C(SV*mH>?!CLI{r~>Mjr*VX|4;FenYN=cl}eal-H*<Kg!NR)
zH~)TP0~sL}@x1!t50vNvh`E0jU@X3Mx?UEy_~aU7|8YY<PJ%J=xPC&t!0?6B7^C1!
zLv|_z%7qt6Q3X7%+`&_jRe;hF-EqqSKnctvr7&WdL=<B=fn*FgGnyhlK$ln1a2rGj
z)WiL7i*n{keU5LY-~M7ouf`yGh&v>uEy5r|aIVD|a&SsA*wE1&Hu(~PLN!Q?S~2dZ
zz}TvERaMja%E~ORihU0Eb52<bIQCGY0=GyomRNlB$n?AyzyP5LTRC0gku|6?40UW<
zvtmrBfNWw#f{}kP>K#ffP-hQA?`g@wjEX}|%vt2}5;)e61MedAu?c+FIOi5&)0=Yr
zk$2`#dq5~q7h0m$xl9jE`+-ERq4dW?v_h%J!#ah+7inY^Tq#rx=Oc=117J~JQgQJr
z*fFGTt*HB96#E02N@+#K%)>c*aIfAA(G(3%+fktC0fuye`G|bzP0uO6@AtjKWA9ro
zsC{9y>>`1qNDqv<n~@mI;@qGus?TB%N&v9HP$>1Qh0E}sT810%u?zuOAxtPt3<wz<
z&TpMiqg`K;)F6zH0%k%H4+nF{F2!g58Ae^6jC>ORukBSpGLU~J!6vfB<T*!Qk+@C(
z-az0cFl|a8_fbfb@|esz^~6%-LQFju&VX@TMk>mJtSglPlujEUfI(Acv7h3qU?T$4
zt(vx?!t^qifwGYDsR|kp(wzAw2r2{X!TNinIm#wX)T>usqtWnQzcz&^FHG1+8Zr+r
z1OJVKTLLF(e~^=;`5byj<D4oal(|4<SgBTZlrbF+Q?AMRIZwinEBpi%-ckg)M2*J;
zH<K7?In}-g+CGcati5^#zhyOsR~VrSSL_sKFU0HZPz{O#CURb!ks1dsC6n$YAgcoM
zFAW-J4eJKBan-oqgw6swfge<F2#{z-U{#<yn2v1fT|%dVYUS6}Y9q^;;V2Z2K`!#~
z^f4Px@O)H*qcE<5nhG*rBbKmM^MYBwK~OZC@1M`3Hylt4%P`tFIv3sE!m};jN>D3?
zKd}W?V5=t_Oi3}#nL1%p44%t?&KfEdPmN;9QB2e_UjD9?^%2ZB%gKz>3Jiu_!eA;f
z@Ze1%mVWFcLnDMGo)czH?&gs^tk7Ywyg9dy9Gdz{$!)UPSbH#fDa|H+#H+wNkJ0`G
zNqs)irD~MU)*sa|nn(@G#BXG0S+o<$QE?M>6c(tVkDAAt&Z1Oj6O4;+Is;~`c)l<}
zi^m67P#E)AkLRNqV09{qWm#}=nI|^S&!Yqz;gEU;ag@f{p9$;CA{*}t6R(`i24UPd
zFH8EvYqnCWaLyurD6s=+9x(eJY>^2~)sXEMIDVjtfrZzPEbo|oztJbgKAj7b2qHj5
z9FZ}mlEK&y@n8>*Md1+L*AjT!@b+fNN~vvNr{&)u@uK|{MN>wI&_7->a(zMT0a<e}
z8fGy}f()WL;y_yBAJT8|#^4iSht6!P*p?(Wj>oicP&5eeaIUsDoQ=UXbPQ+=R}?Kj
z-hpAo^l4Xzbt%@DNT^A0L2Lx}sTpP5md;`@8xdCOBCOD)>OD;DR48dp!VxX_8HH?0
zI1aApw@84SVmMR~@%ngs(c=ukgIHW9)h;a3=`;}G2IK`yFe(ixL&v^9!OS#>GKtd*
z%u@;>p;lJcMyplY`0ytoNur1aKpF#NO_a&GQ7CrYZIDUKz4sD3a0<$FA6ce_f!7*k
zk0emOrKym{59k#4L%=*1V(Sy!2L&7RD8$*oTMK_i1PbKN8$9f=@<pN`URsibZ$gv^
z9~}d)yTJ5c4m%Tak!ZfFza$6I)lI@Y=6}RMh|sY$en4+AXEUv3EwtiL3CENyp0R&W
zrNL0Zh65rAX-n-_RAGWi>2R;c-osfOs0ej*O#T%PJ?&qB_+xhF`tHu*{)_FC)1%Jz
zF8n>|9331tSg!R=GGE!e5i^(&o#SSjD>8Gtn3y1?+$sivHpi%fKCl-x^<(?!*-__&
zJCGIY9Wl^MZ_a?%?dZyvMshX)s6O4lJ6rAnpdWwevp`)A12x$ir>qyGDGr9iupc5X
z({*`P0YcH%!uto`fg+pO<n0PQIovITnn7y7&>^%_C<{MDXHi|>2<NbsRB@nX+W6&w
zH&^=zZrf*5e=N(Hf(HxRND;ePHbWx%+^C)DN;ZRTK5&jjUIoPAa}dg9c~Z<woGoE~
z2`pGr>xN8lw8Xa$j`zGB!p+Y5x?n<OX^bfQT4KkDZ*CCT%1(wC5hOlQj_&!$EV=s7
zizn)!Maw<begDOmATCV9i8|TiQIvS0bhd}HMHx1*Tf~V;PAz7IWVizy@kXqW<_-i!
zihxQP*5@+}6wV!8O?dYQfSdzwzjJ)N{j5WMIo<Adj!vu-Gs!BXPgeq!@dKdCXP?aP
zpsHer6U#t_*EEf#^<SG0u+7$gZQYakBho*kp!LAiSaHD10pX$4l~l=7!kkl2iG^!Q
zhh;-e7y%loC>*FPn2cZy+e12WY{uH6sVO{K<EEZiOqTlO_bD|o5;-Hz)D&ZH-Kc$O
zuCB1lGkq6cp6UB<zC<^W!q@>bnkVN3BM9D<7tzB8)5FaaW58%S-*`_u+b1uNI-7u!
zIJzEVIDm9~PY!kn>kRcLWfKuReE{Ta7j=)1fktr#c;XXCLkcKW2ORzbt!SgRb`Rym
z+Bw)&rHP&}=N(G+YPs|<CutJXxd|jSbTvY0XF8}){ON29<}aDiSMRNYbHkGv32!_^
zI7`7PO(pRdR<5dz>vmIq#&Gnzs$Ew%&nkaV{)j^riGs{j=D<w3g^GG!b;PN$e=Tc2
z!uvAdFu>P10fLBO7*mywinWx0q)wauk0f&r@Vo=(+cP-9{K3}-!n7sSF_^k$+pPN}
z%XHZ4;M^MYLrdf^U7*#SsO3G2QA4(5k!NLTI;5byEcy>g3X?dBH9Kp2S_r~rHT99g
zEzN>iT1Je+UqEtYbC^+rG>JSW0WWRx@m!~h>Elu&ZbSELczPLvcs`?>FFXiw+Fn1o
zR@)2i#<L(Rcv+$z$PjfcdmG|k*T)CMKNP~@lRgX9G3*O`_8=7x9$TmspA1IVEH5C@
zQ@1(ROrn-geTPd==M%;d?8W_ngpXo|(Q4dhhH*1lni<B<;lWPl#mOe{FC#^j8J8zn
z^%@8&qfyVt)Ek@xfzB!Qae#Oald(S3MgvK4&c`e*>;bVMm&LrwxbIl-&i#RjUmE#%
z@~GLO9Ra$Gr*AyElIC2F=l+FGrH(OwvAnFXGdMj@_+rzD`<~aqB)WXrItbW+V2;v(
z>4;?8rKXgogUHG#Icj;F$Kh;0y$Y@-XrD!?SW!jyHoKm*l0+Yg^Zf5ZJIz8xE*z>^
zX!`b;Rwhy_({bgOaJ<GI{F3Yq`J2{oDLK<j5wwSfS0vb?n3ahB1n}i9bgOM-+~x#~
zbt)=KLe;56(Uimmh(!RGQ7HX;N>hBDBV*ByF^>lG@nq4WxJLp><Ngg7MHsU<!J!7t
zc+>$<`_{<83Yhi`C09uxOmXl>gH*-z5l2)DCV>fyO0ibdsS~>%tb697y;~mX^KRkA
z14!5eG<5;Niteikyh___)I{v3<IEK?xnu!~Ta4m+H$<^kdI?XRN<x-|%n=AdvSYI8
z2rW`kuZzZ$&r3>u8BB-7o5(^(i*_(#V8j4|lM#r%;7mn1F6$+qqoQ?I=QJ1svx@qh
zt^|((!hUiplCH#%E|t*dOiF!%_f2@aAQOzD1#L7RZ#tSh9XCBkn9d`ip%l}jbV?(<
z$PisU9RJEANgRl$e2TDMbRNg6RRuG{r6%EILFb#Q^EVZGc_u(s!UMNCS<0bWSUPt?
z@w0)=w0Un3=_|TsYC_tSvnsJ*W9%R|+ttrjql-TI_8)r($0ys}?ni24iT&rpdw1`p
z?LQve|7`#HNj@^uY5R{S^Ke9BAv{YhZ`AFw8D|d)&9oFS?R%``h*7QHo3jH0mLcX&
zhj-o?N}dv)M=JN0B$ld=0+6`9eg92>`$+?1%G+JR&HQB)UWo~b765?@0$aM~!-Dse
zt~m#>S4QUmI;oUAvit<;>N=iJwO*esTrtIa!`mB@#UJ^YsJh<O)m6DBF*)EnfPoq=
z2xPCAConL#1)k(dguO(V93_Pc_(1DJ|NSTly<RdPb58uLZh~PKn_uC+A1Ck!hJ8s&
zei(5KOg>ByBYQccKqqG&2^#gYdkN|ff@DVf8M1SPQ&TPBZ9Dd&#uJE<5?GfC&oNpT
zS@5#-Ls^8>={6L}nRX$irFS02m^<(iz+hrUntl#ILOQ)~!e|g*CR(0I8fHY^CE9G@
zwG|4T#$xy!b%y~Oun@uZ<0+CE9?bMSfkZMxM}L2a5>?M4nTEGL!g(d503U>s_>GQe
z!uzvPpduy$vLMDBFTfZ^qx>~MtKbl`E@8I`H21BGsZ;S8?#*gAA%ntmF6tU^*G09n
zKLQ|pRD;Jfqhc9_Nmyx0Fsh0*N&!@6a?3zrThjpAy|$ZW$qZ#%3GPh(<!Xs}-(hd(
zlqQn~qAheSlhq^xFK^m-vauJcC^3qN2oMG~sW}Tv4+lw6FR_9JmeZWw2x-2MB4&7m
z*R9awvSjhZ<h96pIHREARVep^2&>GN@isr~p$|<|%M3-lm{0~`OJFqqrQ6Ri+FTjU
z*~p2W2sC=yI5);mI?Ar6W7BaEyvc;>!4s$x_Q(c^o<L9T!2g>Js!5=bNqa~H2`By1
zDZT7bA+E^jl!a|ztnp+_cO6`J%5?!Y9FWe$S`7yw<_CRZ4SX*L!ugQ3z_am46e1<h
zh}#GSuRfpxnb3zg34L@N8V5@CLZ^6HVhjS`mgwGkIEVB3Y(B)$4P-|_WI2eV)tNZX
z(pc@`<&Ekl6w+hOJN1ltlC^COP{-peHcxiQ)04v&?bLRlX|<233L^t3hl@Ha5+5i|
zh=|~R$fm|8WSi-xxev`B`T>wZfZA3yqh>P`xdN9fc%>r#hUcC1`Il)N)$3Ht+JCvy
zb1us3+b)Q4LequG&MqLOP~sG{3;?01nP0z;w`P`yG}R#I5&@0uzwe`hP_b6NLI{Wi
zL1yqRTZM$xcwuxAli~s=lUh7vL4|RRC&rq{1I9Hwz;h9khCK{o>8pSwEXW&M&Zvkf
z<8xecA>EF$eLt^GO;NZ-vq%CUR2lMofmy?Y4VmMOLXPN!n;`a)kWY3M0cW4pwk3Tg
zw{Iv#ZycS`ttT6v4NUzYqSJcH4nik5#<@Ur`g0&5bY-L&QTD4wvSArRyd4O*Y#Qj+
z!{`Di6{Rs%R9<b+a&Qo))v75nN{OE+PZX||<ws9v)i8fpb<!l_?93BnUL;x0;&_zE
zK7y~(>lUEc;)Tb$e5I||Y7#^_C4K(RP>#uGi(B?IX1!<yb#j16yh|2tqJW^blPw2y
zlXOilwksu1dZ<;}H7x@u7&X)Z*qfD9hTX)Ugbg4BQWnBrQpeDjnEpjw9sEW00RBCr
ze@DSpqhDHC8I3_qK`P>`Eck6gRxbFJt#0ufDZKa#8KqEFw!?sjGXf!MLHKq-zyA=%
zTu$~!c!Y{P`8w#ymoSzu7!q8*#tD5<jqpQgTD>O2U8)>~&}l@6g*@7K*(iw2j!JY+
zVKln$5EW!(#f4<oLH_i0NR)Iun-9X+YaDb=SR6zSjqhP=!v%1WG<p=U3T>fq$Jr6%
zr5AJ^QC6E7u06e>g^6LpIK?bnS#z(LBi=1zP3R?YPa394Gb@x=^DH|u85AqxXkZQR
zaLR`v)o%cawph6N@NErtfHX|XoLPynXm_iGYKM2?0N$YLiZ>r4jbXzG(&%F8%-}2s
zYI++j+#_6#iVK->6HhkmCB@M7p41EQ)+)7*8%A*?8~(o!#ZkWg2Sv0yAFT~i@;tm>
zr2oNBTK{wZ;l>x<{g2jz1)qQC`kw{!Pdows`QSE|=>InE-p}NJX*C~y*8hEq4+!Wz
zI0e>wam1cMeKAWa!5gwMBkv?n5d-Zg_@z{m<P!e$>{aviKejPkq|f0!UbSAg@prAf
z2tv798ny)p?D^<_R4G%bcs?uF%9p)zwW?YfZjzyXMFa^H87lHhnaxX2s`xS0NC{S{
z{`=tO@BUe^{%2^&P*)ZvAHWEftpDcSyD9$PYQl!`dHsKi53F*UXN(CDp6MvUV%wq5
z)TI(?MxZd-RmycJo&J75kMTBG8Jyy|Dv%>ppgh&%X?PamMV+eJD2b`ssd~~@U(_4@
zLZ>43@zNX)>=Yx&ueRIT<O|PgsC>}3>}&u})<Ko>t>2exR98itlVZAUh8*CD9RE>0
z7{#V>uYyX*S_~&}%zuo>DDGvOPfZvYD;ma?yS4K1sBGS&nSC3CX}Jyv>4*)yj(ORv
zk(^`vF*yFp*s#Ro_6DCmb-D6pxrT45+)4X|SFTad%F4j1T+_qCp2CX?#z3_m!yw>s
z6&URI5q8xc^I7|+x9WQm%&hUxxE;Dz=JA~|PR?H8pV#J%JZRGc29L0``%wkcJqOW6
zrCR&x^pxD~+GjQ6d)J1-Z>uHh77|>f^z^Xfw40?~yM=!@@C*I}+YEi(DAB>C;@5h$
z{%3A~)6W9_AN0@TPa^*{Tbca7t&Pw3zn|oT3R;+F*LzAEw3SMvx^8dOSZPDy<KS(T
z6y?0&!Wzn5m~$7G>|c63pFi*RS+xG6i;uGWm#%+U_?i5lpYwlxnh&gh@;%G*`Xs~Q
zkYu=P?-K8gvSOilo;#94sJza-I6;<yn|;W_%Q8V=2s?jj*H_#6%j3>b?Zx)V^Us_6
zNBk^U|L8dLDfa)?!`6e${{OJ~dHsKi51#)n<CIr5nd18rsam;?VM)0wG^>-W4jS4@
zhitvs6sB(3!iy6Yt?b|m&zm!4`1OLX3DDBXdlC3kyn91y1g{AqzOMg!3f_8E8`b8u
zAsjOBsPt&A4t~so#%;U_YD__jiN}?By)wdB&g<~+3N#BcPK?G99>169#L&knnzniv
z9~dBAVc7bsSL4@h{HKOLS5~mP715Y-4x@pYa=x}sgHi!&aA7$FLFY!gSlAw|H%lrs
zb@-?~XR`ym%Cy6K12Bw%JjST@GYpCheZmJAFu5dgjE9vg4E;Q->O(MEjI_t=%2`Ur
z5#oqK9-A2uJ|dkRKBfwM!1OQ-GJ)XVH$;o?aZqfsMxvWpJqC*LOwCvWnPZz~YM~HK
zu6_iCWWKQ*bRg6e!8bcdt6VmsatguFb&cJKu`5JU`>`F?LJR*t>Jkc{Kk`@^rGU&I
z6;^(1|7eh+(b?80UMa+^pfhI}=kaA_T)RS=R;T(gp3J|WmGj0!aH+St_!Y_CX3Ag`
zR4S!IfFr-raahku3E*}Lxj&*csa)wkM0Ot{>;pWC)|&`!3%|lLqjeU~Ba;WB!~-lV
z4N#dzs^+(ev!>++bm>!a!_}i}1YA}1*{tvPDsu{h$svJ!V2|^FP4T`RID&@a8OR^p
zLC-()!-#-sJq88Q#tYnlS_%fGtM*UjzxSb7`DxIDfA{?<{JTAw()Vll_wVNs{X4?v
z^E3GOIGDh{hkaC#AH)~%?{3g9zb%!VNxM1!U!?z~Bi~050G7%B_wJ_S|2@3>;Pd(a
zlYD?O*?^YgW05Bw$0``H6Re62K|XuHF~%j@rO1Ch@mlCiG9RP28@{ViovJz(Y?qj0
zG>K)2O0*5Uhk|0rK2A49%&jOu2s0?r57$m>ey!KGVwzM&wbk-hl~<>?E?=)#%U|6}
z)+&v)>MvIrod1vQZ3ed8_FXmykjk5i3z|1xxz^)lnqrE7>8bf7p9SlG81^tO*@rWL
zrT4!NGxGm^c>Q_(e}WH5<RZ!s**_EwZ`fycW;y96mVh8{1E3JE5>-q3PDRJTf`#Ny
zDrWDLEPk}8VL^LsOvAu3DzgZmGFU4?*s~yAQ>HdwdHQ3PE2!S9dH#COl38gtW;q5`
zmMGd=-K;c$&QNQql$Oi}{?ge0%YPQE|BrC<%b#WI|G~YC{l~-B=k@<dKBE5<(~l85
z+)LDaisP50m40j$f>MA45tGy|QVbm}I5Y?y3CY1=`bK%Dme<OpNVuL*lrLi*()a2U
zuRhYoA>JR!XvCsHctWBzztF;IDM!XgQZh!eNXCfYfRHh&#gp2ZBWEPF@~v05>R(lE
z4c4l+UZb4x>e=z@YUkux_wdPfw^84^m8_HOQRZgiH|i9QKPK&V`Is-K@du2YlL+DW
za{4Cs49<KY(o;9Ad)c3#M=jd_eR8$%M<2=omfC-8q~!nB2LAcH{y)J77NZHnqv8!w
zoVfThm=5P7I=s%NzK&NxQC;hknBu3Z(AT8PQ-CmVqEYLWzJu-BNCIbSBNt)7c{$Vv
z>>++v+9)kw_!YaXyt6)1?93{5l~c_Aa5wtxVJ^TN;Qb{aSuK$BjD!=!re0W9{tQX4
zS$dknhdX}D9wpNTCO*gfX<|L15+`N4GD=kNUoTo4R-$^-Mzra$maR&rzisck%G0Vx
zsy*{GRMCYo+^-PE(0fW_MU60W6F54$3MRzjicw<K%3lKXa!o^p_cdENg|UR%8@1*G
z<nt>8A^Lpf{K224_J15{`-66XrTqW?{WSl-_xb+k(|ol3AI)>g90%EGw?49{!0Uwx
zdi#*nCE6Txz-({mdtkM~F<4*)-chKV0$Vv-=S^^GW$*Fh$G`+c3<Cj_)HC$5$}-l>
z7#cfvby=%9%eoHrJ~gK}G^I2_>3+4iA?iGca5!>pV#vd#e@UOu7KPT+dXsco`1O%=
zNKj-e-(eUHbom1CW7HE{Vq<QzmbR)FoWaQ!N8{KID%(a=5S>}F#i$QZ*6u=g?n_HZ
z3?x@eShvcoM#tr<Evixv5q|(2E&VXGK)C`y(4^3NgpU!!;%hFbx2EDT3AfbWB`|jg
z;wyZJU9FX0drC0Qy};mkOfUu+P#^wNEBB}HR#E9+da?Z#eircmtHH-H|5<wezkfd+
z|K-8M&-wp8%?FnJd2r>SKSj#pgQwqnL`QPP;N#&C?SePt&^?>ZgWPj>^Fj9HEkdWe
zeAC9-8^8M212(|zAkUWqXUV*WNAgMom_ljA2*Um90${Cg&2EBGx1n^kDiV6SmfCIZ
zu0ikX@^BPHm4qBh+#7>buWt2$Q#HyWv3eziC;qeEeDGH*s4nvV3Wp!%`fu6#zu#<T
z?*Ce!*Z-&akQ$HY8P~sd)#zP&yXe^eB&HZR!PI-StH1vSU2-vE>P66iuaD6bMiPDi
zocahM>A>F-+LhvdW9m=>A0&N$f|u{VpHsBHyc#NM2AU_rd6GDe;zP6&+iFRcO55GN
zuRHDX|6N|$?QHM1%m1sa9v!Mj^|Ez?F$hNfb)|~u*n`89&Zc+#-SJ6hzrNdf(K*=d
z9Guitx^c8>3NUz;KfR{7FK7?ltl@pa2Hq#|Nx5Fvwi<EL=wl@1N_D--ovxTinABY=
zxi%M=O!2$cZsoFeZn>9W(&)=JJZqo7mBz23@pE-gGJADRiKRL7IKIAu*O%rR1q-~o
zdfnb|Z%WLK&5ZkTy3^@)j~Nus#Tn(q2&c1iHtZ=U=P+Mo6@8l`3<MY_6RjG|C>YFU
zGVw2gZ(<b?-iNc=ES^+#|2Jy%rg2_xs*ZBc)r(8>0>gHVhOeOhIt&D1tzY4Yso<;Y
zHL0+EwcdQ48lp11z<9pc-<@q0XA%Q4bLeyo`7XCasC-F}Be;l17eNJ!nMt`GH*43m
z>k0fDwkeSb45Y?iYU+zNFS-uB$KHk-4nw#C2v@Z$fN&)cE)|4J1>w@V8@qB~C@9H%
zjEF$=K$l>a;UA2hXda|~PVjw>=8B7?04yy(NjEuho193K0swKyv<RK9RG{<icB?Ak
z;HAOWRh0YX<z0T+q-Pt-n$5x-z>%+$<~ly8Hysl;d!C@Ie5JD2T-K%%3CWLCp)GZi
zK4y~3P{m;CUsen~KuuKWqlr(yKOfIW7|#IH-%#LhZ#WA3Zz%q$TD?pmGM#G8@}!$N
zMyT-rMxz4w&<J|G!B`>QMwmg~R&~a$YoaWomph9t@Z4A=SwWD^7-@(u7wQA{QtYYU
zpd}737$^LbUhtYRZ}>O8Ld2OD_{+LER^7s$(W=Hc?%_<w;Kdz*u8^3yR5|zqR(Rgo
zJ~~0x<uz*?uzu9P@V_nZvV9l0=Uwk@=~;Jgw{t}0Hmq_R>2jTKUvv+5J5taBri*W=
z;`gBV)4k*8x~wU=A*I!~rh0;P?@Qe$FEL@u)9!b=_Zv04$qfsX)m!yUfx7Q8)20~T
z7|vd<&dscL_nvmt+~Le~&<!;FC1Ov^j&mL+z!0H7IfQ^~IP=nhNP#v`p5Ui2MX;uD
ztF*XmB0*;*#tz=`g_v5LHu~#2g^Z!dHq;Z@OL+2X_iOj6nRhZ_wbp&um9wvLf@=3_
z&6esbZU`XD!Lfwy0`>5q3gsA3dWDVF!&j}pFIUm5k)#)lzdco4K{02&RjF33O#^;b
z?RPbULHSmbH_Yv=hM!yQo+DQAf`FnAnU*vo(p9^FdarIF8;&a2id-qe2L}oN7yDp1
zp}~*GEu5kB?I>yaMNT5q&M0QF$>y9ySobz+t&M*t_ELXqp9SYXP9ygT?7v#~n;HAB
zhj%}p|31ZseXUYS_2MC$Ne!(73O}ec8jT#?iD+E#rN|djy!;$a39)xeVu#<N=&-jE
zw8qrFVP*8}DwE2W0&JFRr(buDj`t1^ungwj{2adHXZtKz|ES0#_nr^s088z^H}0kH
z|C$@0{Xaj+N7;X;Jv%)$`-Lu^lnkU&?)wqOQk=?#PsUp8hjOD4!eL~!Tx;=-n-yw;
zzdmbgPtcTusBsK^W=DuXFVRG*G;3!Wmr;<5;58amU6pHhtEH=Us{|)6@=r;1_lN7%
zf7h&K!TRrijJ+Q}OV|IswEy>m2cP}FKg|b^jlr1AxaK;|V#299arsvI!6*sm6clLa
zPlM<@2xnEc$LVjh>#dF2{f#>6L&+}3T$1eIUF`}LYxg&5{f+hJ2J7`!Rthg{?lv}t
zaAfJje!qgOVkLFWyJA0ix}b$&yYlNh_p59D^}DSbG&sy{P~R;7r6=iU{47}im{NAX
z^AXxu=KtNgo0k6{+`IRA{eO~=i6JkE<H?Uur2}br-Z8~Vryvkxoi9-$wsW4b6ATYQ
zhTefn1Q4*+J!aX0!c{vtLv#uUlUh%zfz(ms$gKediN$I<KLaLjXp~CNB{49Dh7Rf!
zu_l?1#~6WDWo(iv9G>5pEv>BZcjRwY7U3iwQEocS$cx~BAcEh|eU%l-<DGD2<$X9M
zYGx&nl51hPAnFcjb1yPgii33MsNLBJ9jIfr4Y^kqS)XFzu*ZXiFLC7e`=PPw;;f{A
z-#|)=f0$iZC4A(v%8N&`RVuF{>Xv2Ozp}#41_izbQ1~3rkunQpYf2vYJj;|bfbzeL
zB<VQTP}iC(D?4#?>0hrV-ZP(Rxyu?#9g=dzTS*1M#J5KOv9hx0jO=-yeN<XmSt3y5
z6-o&GHKU=Q2oe74Ac7K9#s!HsqgL({2A>2)0(1b7n}u*d-J$ZEkZ!(%-zU~~O+r^}
z(?R{(p4S`27Q~C40ryGUqWmrIxqnTc1^d5Vav$2pGWoxmjsJ4@;r-A1|EKuKwb3$u
zYWYU9M(;A7Vmb=a>RAfA@|XX9T&MpgK8yXoKS}(zX7g?~{@dNp`u|VzK}Vj2f*z{Y
zh!=p=K?%oD_{>%@7X|2T9l>$>pnb63gah@^iypPuz8u9oc07X9Hd=t|2UMxvtgiEy
zmK?`*@D!EAxjvasCm6_y0xL-utvvGZ6P>13lvmeJZ%Zo~-zoGwk`mYL{;R9ks390q
zN|<Za(Ut4=kPEJ0iS{*oBL#s1ckT8N&pYIl5R$l*@^wluIuT%G!}QG9gsEp2&|;*2
z&8!mjerbjM){|OPyQs}-2Xf64wK?cH-k!AX(KRg!Zk!{BGZ0hKHIBPZ>)HGETc|dR
zSy0Co8FaZ^D`T`7P90k-<4E970KXGp=`@b=WJGao093UE|Fi|;_>&9JgMpOzOB46!
z&(hBV{%?-WAK1n+{@>cj@c;YwKHL9(k`Ly8cxRPJX%LKNe!CgeA0Wq>#UtR&Q9rP*
ziy3HTh~ax`L%%lcX-BYryW+3+s&`t}J#thl!}D^j4}bkOh3fHo@VBQ-SAakF+il+?
zZEw4We<|Fb-%Bcfy;priU2+@^`n6u&XImBuRi@e>qO)(GVGjMZVgHfqGHZ3cPhIa<
z9j{sazK=ue<Io&aLW~~ZP2-rnV23I{Ziwn4;HBOxz{u+cr9(=*Va2bm4J*)pE81Z~
z21JCqD)xOt_52UDpzR_Ss@Jf3@twScCc8DD44kkVP|w1|yVYnuJma07uJZ6f01|y0
z|KbIGRD<>a`X8#*s%0lR&D-<ICtAfuTZ8}Auj)+~BYy~{m~GH|)vUE%m(&>H$LD?G
zFZfv$|5YieKD3Qx{QurY=KO!}bN-J{^O5ua`)D9@<G6VBz&mJ@$)~0t?~f8Cj$I2R
zDif(1$qHXI#-vMVp@uMWLQTC>h$;5ZXw@hQa5{)oST+6uRf{`~kVD#CQGKM8oIjkc
z0@n=2F>Q$B`DhkSP@xN``eCwaAAAT-Wm5CbZr<UP6{)th_1fN9MFn|Ku^n=K=~M~Y
z56AHUHdAj>_5M+Zf=Htwsygu<Y;?e(4YyXDKR!(0oY=P%r7P@M5LFJ?C{)iT93sYm
zl=%cF@W2VmV-4v_Y)OG^-oUAj@h#T4l7TccR@)|(k17!Z!K~GIY2<U`0u4%GA9*$q
z7gyC42}D7Yh{v<UOyl4B1@DqiKL1zASU*l1OZfl8=KY81``^}s&-$NF^7#c_(Nel%
z<!@(Yz5fN>!%9L-y8z#T*|~A0tewi2y?dOLze9>BI3@K&-$`)|^<mNPJl{Te*6~iB
zcf8}y$;sZqvt#c`r+fH~cXH?*zuY_VzB_z*<aG|d-a9%x*zX*iK&{*l0{qU-BhML#
zUv#%mj;R}yI7vdhV`Mc+qlB;8c;E@JE+@)139>o8von089AG6P;KM*^z=ODN=P9ot
zVq$NGmu-E#B@c&oN^#EHG(+n(ILg2-iL4YEdCAT@?%kOu(>ugQ_46lt2W{_{6{}bk
zj_i?szjv^cc`sS%b(!wolT4XW*wgR#x3g`ieDtMXFosb?=mGn<)@j%2Vo^7-f4EC{
zQ4e<TflgjMBe4P?bzg3u9vvQ@)aYAxckhUk8RM@V_=RXTbYv1t^8tp_>NY0*szDsK
zoaudX4s$>}?w4Pe>@MZuL6w8<J$JIDHzen;UJv@}WDo~Dp~-wgH`?X;q%5v3P@(h-
z%2dlavt!a4!pRw$QVFDWj&Mwci$n6g3P>`XlAeo}%^2Id{rW_Yrt@vbp82X*AA1`Q
z@88!2cDGNqGX);pyGJuB$&5KQJM~jFVdpXKPn2tJ1M8^Xz+>o$evs*k^(x&7MDj}z
z1HxH|i*f(AFz0P={05d1!aUkOAYx?{2)F1Q?0Sb!J+vR!?4scv9C`<x&MtBcVJF)M
z-<>>%mx`4<-#hlYdj}oQ;TAh+(Gi8{k8CA8hc$i{%!EB0w>>|+0=i5>ua{s7gCM}a
zBn5?(SbBa1Gu)38_yb(@lClI`;gQ~-h6ytke`b?X>Ew{tvPzPP4`}h?^q*Tq58p6<
zHGGlO*ymoOaYxbq`DB7M2}_E0@Byu1{MBT8hbDFc&1#hS3dedJ1%47VN?*6V`%vVF
z{xt5FO3=m4m0wnH^e{*K<+w_|P|;>-rB58*yL}s`a)0}`ovQcC-*7PU&6UA?Jiaci
z$PVDSm&&D*AYjvzat<h*{;IVk0Ymmrz>obC25tX@Av<qjdE38nxmVrxY=Xt2JSXW6
z<kvw;mO80!;m@UYQhmptR0sEwqB^Mo;?GivmxePZ@GXTTg2;=>YF~`Jp{|-mwdn0#
zsL?2uaC?MezajIb@(ZFG=xSL%f<p!IDx{OAhe!M74F?KU&vD}eSYle11e*>BMQ7&W
zaY_)u5Co%O7C1skqg*PnL_=&A7B22IL*Q6)d?gyRw<FGs-iJ}t0Z<TON)O<9hsPzN
z%1wkPrdrW3JcGR%xICs?hl2w=HmEQ?H70e)&`kwT#h<#ye2CbvBP{9M?zlF8d1T=O
zzh&21J)w?$PzUVB)r{vhFVhWk;<aURthuq}ne;xIEd?vdDTOO5TME{WQwrBowiFPr
zQwoVWTME{PQwrBh4lEQ*+G)O#Ew_^{x07EEd5Kewm`k=Cu4|_pE%ZG6;~F5L#}%p@
zc3DNQa3sFKb9t6-CobWBO>KW|HF!i%j;trl4(YLQM(3THE8&37J2gYXX`FXzUWB8S
zix(RjIU-@A#VHh;N2rrP=@BV><R>6+!4eOyCet9HO)X?GhD1`-Bv^q&g7IW_tuoe@
zMlLoexq&6)TU`*FSXdlp5MuWNqgegr*Q*u^JKfIqafhBC(Q~zI>HQzQvuQAaw|}I5
z*8^`gxdT#u+biE$m7l--<sJO-3;tCu-+^J=S+zUbIebbe!>G+lPT{P)n4JY=Q1Qyf
z6`pvN-h9SK4OryJA`?L400uTgcG!6F{P5trYKi}DQXzM<moT2fB}Aoz9Gn=X5FPzX
zD8-IdFbExBT(OzYn*P7KPrm-=qnZBGXPN!~{Y?D#`}ZDxj{p2gK0MQ!x1sD`N{d>B
zI-dp=h11l@;n8<g)VD41`{$TjE%A~tl7KtJspYIOPzMl@D%bc_6cUsFio!IQ5BwD8
z0bfU@t^w0KJD=4r1N>u$o7Ogq-XKWAvnb&E?BHq!%!m?<d;VlH3j2JQ-O#XcUxo7=
z2Bbm>iDX7JtxuaC)jZ;ub$`VAYSo^Ggoi>n@C|2|Ac8f}1L3JFuky_-v|jTrLJ&By
z;%eeu20cI(UW~xOdp4VF-nnymd5LGGMm#;c<23{lIXVXYISHzQ?ixExWNT3fj>h?H
zJo2b3DpOxC2qGRMh=F52y7mU)a2TL?h}irw=+7_?csxg&CYU+0_tZV`D4r*6JcTU-
z@I*Jf=51g2;mGgd0sp#if)RD-6vAaiC)tZZaQFNEAQ*?NVx!G}+D9J-nUn;(hQzpY
z_~N^xy=Tu)s9;XFVCF%}54dLteh|!{H3C2q2B5cxN1DrM6hoVXg6U8NtRe1M>!fgq
z+DxBOKS5s-it@2jQ)8RZem#$LKr}p~z@GaiiYdsBrJTT3LrNOxHA7JVrVZ$iH;!S!
zy^O-E`Y3#3sWocs?t?R-v`ZY^i&n6N-C>b}^`<sIV2n|}Y+e8uIHd4#dhBM@1B}2L
zPZ*nBMj?zB7EdoGkC1CQ2zt8#h+H$0?cm7{2AZ4ErOt7mRWtDP#mk-gQ5bs_tnea^
zW`HIXM|S+#c?=VbBPQlDBd}O>5O{y@M?pBH+<B4rWa|GR990!XkK?JcG9`2kg@c*{
z&}mY<!uY+W110n@XZ>pzdGhyv)G2+uHt3S);r&AUfB2;L|GOYAc=tbE7m7ds&iDV~
z`A7N=`|(F;W10Mi$-dM6-}gTIe|)0P-+l2PzVN*NLf`+t|KW=-Zo}XI@?ZFO<?p`u
z;{Wl#!C(09!T*0l<^LmB{0~JC|B3$l;-CJB|KR`N%fI}~zrbI7@@M+*i$DLF|KR`d
z5&i?8|NN)j-RJ+Lf&J%Q`ltv0X;(fI{{1KQ`?+0O*O-~#&+zxI^`YYb{O3PE|MNfp
z>7W1ne_@6H07XE$zqtF)|NXxoUj4T}{p)}K*WKSB^nc#nJ^a(*pZ<0CU$F)K`|y9#
z?_KqK_xZmfK>hoF{&)BHKmU2Ae_I{UzyJH6<Tro*uRs6KKjCjRy8rfPsQ+C5eh#>z
z_Wz^(`!{;{{QIBGc&WaH4}|~B#uv2zPnQ!1pI5ujCpNzS#3)ts@t+h*Wxn)pYohGm
zU;N2TB7GRX^?~;P{7?Vqpa0hv|LM>F`o-V<`F{XO{C~dq;=ldN7himZ|A)%|C;lHw
z{vS8_zbdcl1FUBN^X~xm-~F#I{&#5W{|PkrzmV?!PX7P@Mmk5z_r5T6?sVGu{L=@}
z`Jb3z|HPF0pM_$1K7S*#@LWw_?%#j@*Ig<H1Wfh*{O8{goPYk;e-gN}XWR~vIuQf^
zojv;>U+wPx%m4A`|KC6TC+IiK)EEC7{{PSa^9xw({2i*nZ}t9PzSw>KKQ{jSKWS3_
z$N%f^3Q_X;^Ka}^y#K>ty3zkAZ7j9_yqA{$9^CyL|NGN??ySMFji#CccH-A??DH*9
z2#3_^WQy8vD1?XI#7kxaI6a{sJ0BNSc{U+GhZ8Is4>h2C6f*$7&#DeQ+`=<bp7>L;
zZ<vzif`Iv6nQZ&Y+PWNI+$oiQAto!{BWyWtoIkdnmFeEQY(G#p<K<EbBZ<OUFeHrz
znhiqf(_;)T>aBIFrJqXlDr)0nIOopdNu^ue;-?|}#iMQ|Y&W+ki#+_hzFsYPKe35o
zC4Ahhs-Sq7yANy93j`M?e7#WV*1~Gl1QV!~Zzbg#mOu+zQ({X}xL5$9aFk!W3~$PL
zHF|N3diq6e+C{vtyfWr*D0`b;dFTTy1J$j)d22!dx~H@2Nr3rT2!Oz(gkQl_59Dph
zpd})ZVywEcReFoJ{xb?vTe*nC0nLIvEi@T1G*ZEe_+uKJp`j4M7YdP_G+QM#_U`E*
z#_I(ra`3X-t$x|wsCq-`1dt8TX06OY2UDo8H>;{0Onw(I0oeWhORvwL`?L7`cRrac
z2eI_CH2&wqjQuAT|IGhC!RO8$PZ<xvSJDm#K89oFOGD&=JL~KC?$IOEp~Jc;@01@u
z);4Y<R8Z>pGyVv8c`xYuXe5TvNUg4QntnpiN(K_}(?#rDES?Hj{NMia{MkQ?*Z<_B
z2!KodKU?YhzX$g|$N&2@pI>-9&nW#(-kjCN@<N9ILM!mnFECh-IOr$?0ClI2Z^@Wp
z^}l}IUPXgM{YGpF_4}jLdt+p%izpMA#+qAJ3?){RJC<$H9gt0j;nkhh5`S4>CjAqa
zc$;G(tzYFEN9)&FyJ-DNn?$Efk97gd>iDOx-=^)3?IuhiKuX__;)rfG5dS5-^*fcJ
z>PjW3Gzh2gz<SNSl>zbF^e9UQAjfUe{O$%xe;Q6u=-%|UBd>#ZrED87UonM%3I+2u
z-`Z|MzmMLQj)LFM!)cIgdZljIgFp4|FMr}Lz4huN@(3G^OFP4ne}-@Oe)*H>)?3?1
zMC`Xev-D5;Ddztl&j)B3|9{X*pZ_0jv_AX)e3DPf{|7}jnEX<SyiOX8l6Z))@5HoU
z60Z{dTf9*8@8cu){mJo({*4A?rP2-*IP3RIJ5RgY&yL$({jlZLzabxnJ+y%&3+nyv
z_;t0UzO_C0+TB%^z8Tf(9elF)1b+gH`GxgE-ow`cfE{7zJqoc{ADzQt5^tO9qX>f@
z21)5?zwJ$-#t_3A4E_0NrmX>2#l9K7W6T*}Zp1fH>j47r1eh{N%4h?JC(8be4dqr#
zC3wHNLRuBHsNSI=$$-3H{swg|-CtJ71e;kT4j4O+VQ;8mKIw9(EeeYNWqB3$z{VZF
z5zl96hRuy{>TWb*)s%SxaA7{GB+A7L+Wch&O*+Y<6zA&rq-xpeuhgYgb|1jz&7*p-
z>bILPVm1p;j}`qJ`gTjIUZ#~2V-R4}O>f8&l65zJb*tBIt)^a&1n+jabQySM#VM$I
z00x~&@%tih#dS)`_u-e7qkR}74X7VeOwei2So78zvB8zHs9X`^T1-2ieD^En|1@_W
zrH!TX|Gmup@7;~h{Qr}DNdL>r6ixtaVm%FNqMZ#TaI2*WW`~I+jLt@ES<Gr$38xRl
z1HexEj*`}&gpIy)gr~s4?jug#oO%|gAI!&-)FWJ{sYhq&2czIB^<*53Q%~X^+PtM7
zPOzs*>Z!0-_aWu2$~>b;Ebc>&z?yoN?#(>P8R|v4)E`1ZP>yoME!TrhEc<lO%RUR^
zoM%y(#tViT$QF!om(4s(vd;i7*@uW1ewfk-!IQuAD*4;}6!ZU&X9K>B|37SI@_)DP
zeUAU~Nj@j%Xq_qU>enj3d%~IgB+NUjg4s9~1HQkE$e5Ipz`_IE5gHAY_G=tA7E{EY
zdFK+PUEJd*^B!7e4r09gX_QKPLl3Qv#p;v&QHFjvs-fS`>NGHJ<)~?%<A!76QS05Q
zL?+C(>l~V^&O8=49Tzvh4?7!LfRC;l<kpJ9`P2C*bJv;K;ToltUFCue0$W)u-3P%q
z21rVMzEY$-m(H&mrT3~-3;Q6nZ*%*76g8p3H(@l0FBA4~S0>@fCX5@cd=W<%SQhJ6
zv13!r!`Zv0t5^KH?@!;%6YtqHoc;gVd(-Z=jbvf?ezned{sW?%*rY?PUXoar<|>lx
zXs#{!k>pI~X7cbrBq$*!0R{lIWXA7re{1Uv8$pTkl7us{NT9pAySlo%y1JIMckVqu
z<1hamPJ-oZav28EGDxO=wk3TSV{FMP#UB*7NS9B25c!WuMdW%ZlK+sm_+yw({GoT8
zP5NQ%Eg$TipxrKojCqs9qj9zf9X*;vUYM~C5$7?B$3rv<#xViA`Il~LnT}65IonmY
z(E#pcEP?7UCu2mB%Oi<ghfx{u0r}_0mytbv05CUw`m_WMz6zsvSd(tHtz(prca<sK
zfGaY@cN7jN?oV*8IXVGuV7}d+0+MT#MSebBoh1G^#id3Og%G8^p$}}i5GUP+%K&mv
zZ?gWY`M>GoZF$U8{ZGOE<D18;tAFwT5Al(NyM`VyN7i}Jd)J60vGg`@&_c2U6`JXR
zs`>y{O%hMe(7_-H&L;4X(*jU73xv}GZV<^ciaZ%&h6+qa5Vx5nQ*PVd`6PM=pa*#1
zJ`J!W?g5+u?3#VdV+EV{2H4NSKB{kwX$cHl<sl0)wEOR{1xv@{++p+=-N!dQKA6-O
zQ@}<UMaQyIm~~&a7ce$gW{0#|@VF%9ZBO0e9e5?dxJKD>x2ti_x!EOzr4H1L4j@)C
z>OQxRU2Q$;c#Fr2RwS}M$ER7QN|<hOXVGd%Wmm)4SyrYu551Jy5|;~hVy9C-N57~6
zsUBd4XKX-XmqD#d3`Mqxleb76;NLrorlzNo$?>e=oLNMtlYu-~Twabim7KTkCcQ57
zYSTm87L)CsGs5ZN@KYXm`KarLOrxMN7KS1NDfU?f`cZJy7^HtZLrhK5K26PCum5WP
zZ#Kr;wlU5A|4||T+c%G%{$>CFK|ZAaIZ=}QX)ug0l?$8_tx4eUwQfjxm`j`^l@bb8
z06@x%MJ-bGbUakSz`smU?G8pg1mQFZ&|e>2y&gUJN*x8VIKv>ps7eKZ|AfN;>;YsW
zh@t*YIamdXV%}*Op{J=io`_F>2hI+G*qlh*4^qbhxYpqSK%?TH&lvz(#bRQymUQ48
zD&!nD67*+7H$!(^U$hqpZ!rZ!!hGEFM)}n#lNS_uTX|8CaEDlIdmL6V%>WoiC1fQO
zjYw^A*bPLzKJsuNvLT47m^A%7o(%gOUJ7Re@dB_)B-CZ>ZH96DvyS%p!{MHSbdH0O
zz)u`hOCouZ;7ia@9VMV(Qb{=#!#s-G@8EFv?dvy);4hsgj&6`5c^w|@E#y^m=VjWp
z^Ma-eZ8`zQe)q-OgB_202HpRui~1?gHSQ!U&9?_{kN0-Tr0>056V4<sw1-gPpIuSI
zJGDFB|Lz}p4}b4?uTLlF6YD+1za0u%mZ4WOJV7f+r<vc$cv5~~dHXk&#^2b^c#@tE
zL$r(?l2IdfLCqfQ47wz5CS;SSb_g_Zr15+i4gjwT&qdXti!HRe1c-0DG>>Mu54~4v
zT!fZ~9*h&;{sTivC*Ea;5dDzOg&hKei)`!+-5Kho{R3;+zq#%PcHUcar^vI+F258T
z)DmoA|EFT>OLX-f0G8y-$7Zsh@Tb=Pix1?tZeyzd-;+Z8=k>L<zxMwR@%is07<sqT
z?fjnw0<z07XE3CpD0ytn;s(7aQvf}4)jytsx3A*YP)5EdYs>xNup?h#Go-J}!BxPX
z1+>A#FA1xqfV5CNNy5{K#B$#CFJRkv?MIWur+TkZlljIU4%`1{0qVdZfsQf!)qDNV
zox|5}_FwI7_J$rv#KZV3_Eui+dMk(P-pW57c`H3{Ww*O?bkaTE+j)Dm*F8Aw?(V%g
z+S}Pa+0#H??H~NlChph@hJN$<WD`z;`sx2!;5c9ZXW=W|^jFXVZk^x1-G8;)-9GN_
zzIx>iA1*_oelR2~fY=}x&ZoapRcw&zz4BJ#N%l-55Gzt4V8Fo@#tqW1mSIxEL6Bzu
z@BaWp{R;c`mA9lGmX!0B0Q7j0fd~f@RWC5DY^+Zo0AB3aeU)y~99m=I$#(mTWv2Jm
zDOJ{2Ea3JNvC7U11?<u#7=2ThY4n5d(6~gbzpCpo_(9#nvvI25%0(A_mzyy9F4t$d
zITXAwahFV9uNgLaQ_<05eBh|58TeNfC$e0IHTAK%)nA`^e~SD6ufYh|VLZnG5I2bb
z@O16zU-2J4#HVKd`}3lK+2{Z1BaHw4*Zkl8XUhDmAIn#x;c^(=tc_av|1qrf$2tG6
z^|eRqf64zJ<n#P*FtaKW+vbC{<<$pX5cOib=-hnp_T<IVw-5fdwLryyOs<DPdLDr2
zik_gGi&=1$tz4zU#RZk3{5%N;n~M@A2`K0kQ?|2^F^H41U^xo16^Q_cHCH4iE&5N4
z{j(s|l@Khp{Kf9!&dERD?0Eng3MSXyo44P;+TZaOmsVB|w~zOaS5|gUcH#Wd`yT3f
zKfQkC{rGtK@yg2Hf$7(x6}c()Q=obDGL=YP)Zhw?a0Tnh@2lm0)?f5~Uif8eVd1%I
zd<!7zA9&5OMNK@<!fY69y+ut9o-X|1^A&!?ug6K;pY$@+18u1_^?b#C%H;$z2-r*F
zA)r{MW^wDkRlTk}`tRo}R&fEq(Woe$_m&J^o^5GdJg02G)au{;G>)FHm<Og%I!Wls
z-i05f&sWq>Q(z3;h@;ctBstyMrY2xS)-%=oirv2YrF)2jaIuN##Tzk=5`N9-{QKVP
z?N_f3cT6=K%|JvK@i3Z<wjMoSF+Wr@3M#_H!Surm(@0;uV4$aFhTP}6Y;GRa6Mp{%
zhGz9iy-klj@`g<50uuwup0QO49k&BH<Mx+5?+|s|;eZd$mq8L}RI}mBb(+D6mfLJS
zYUdNuUn)&-sv^FkzI+Tc1}7S{O>}!--got@SNoP?+IL4d{_rfSDn&1Yezz7BjK1zQ
z1_Z2n$0N9^gk1mns{VCa|GGb=_LTQg{c9XqFB?vIjo&eW%ITDHr`J=;082sZ)wD}T
z-zg<0DT)f+H2gh3F-uFPhJ<C@lGvFlOrr-hgJxy~ipf^px~2q8)l)0hTBQgUQy;E*
zVSjT`qDL$`?Dy6F_ea}D|ID#oKk>K7%xy%B+2aL$3JXN7V6VtqVLiUi#RMd9ayK@h
zz?eQq2z)+4-44B;BtyOXY1s+4yhY6}(5MS-x}L94wXJ2~n%G4(WE!I$@O2cAVYf1z
ziidXm&x6A^u=Tk^MO>;Hn*G`jiN)%>g8Rd4<2kYl=2AmHO`-E-!G=#wm(5Vlaj)PC
zTldeP`bq)3YFCD`ZtWP-cNGC-`^~=7f8E_NUPYjUVV=vIelXago1cfz72#-3rXTQE
zENWM$NZ$AmNw=HH12iYwVq!MG<+}rcftK{_20iZGy2qUAY+9c`?x^vy$c#C^XEYr<
z<L;r=?{Rj^fm07~<NUPom#3QCetL7_`Ao;JMTOZ&XP%VvL56Hb%+k+Y4!5GSdLvq&
z&dv|wXeqrDmVR~DJl%#s+{zRufAtSa-Lnq)<52g<M49Tb#?aO0hqEGt;3`Y}&kF77
zherEHS(|3O{Xf}w(+@u2KL9U^{`gy#E6{5tMbiP>=5zK@2L8@6>H@9B!~XaN#FhgA
zhuWE-6uJ=wmpAE#3juoZ!DrCYBYohhESU-D#%(8agprG;Pv+e5D0;Tpa9G~|+tCpt
z;IB3HVb)Y`^DI-S&a{nMoo_w7L^IrO@3d`?z^bcyi0@LtpKGWrL*oK=tFz8U?=&9!
zzfERZ;1zr#9%mnRb1u_e&$dqIc(}d^Rka?<5Jo|o`e#A=7P8qKC-N4vh-J5)(?geB
z>Cy8GKe2Be&^!70ih8(VROZ}>tDJC^(nhiF>eAi&guaP^=iVvo?j7$O?Y}wMKRj@i
z?F9`<jdpv%9yGdd<Vmw-PpI)klY5dNwE>h1i{9yVru;S0STXd6P@*q4F3TQyjVO41
zftQZ`9y#et&L_N?VYkVaKS2Bcah!4>K#B4UtOXNq#Zg;)t>Xk^0y4CiUHWkX@w-G+
zQFB#;gWfDS;67vPwfb;rKJ9pc-#c%NKlI}cqO<H=FqQ-<25rJP2K^wS2)AAq3pngI
zy4cjuCa2Ycfh1=W$!k^YPRRfs)^)d|os<MtaMcTleAz!Mvu9gfyTK@eE6jZtVum}L
zO0wAdJxJ8J2o+5x&Q<D{PoPxS)7XrNrN`-{cdiHILIThaQV*?hJ-^?_ysw-ha0K%e
zj)y@hnoCvR9Z7+X?kA~@InH-TPcHo7M0J4I0*9Tr_Nw;;O+vtIQ?ux%bw@i-OS(fu
z$2#6MqOC`U@e+m@h7P_cfaJTU@(^xfd}c&!JZLe0l^uXNE6foV-)b_w&W*$8I=l0n
z1%UN^aPD7(m=#l@A3Y_|!L5(R8+F4M4`4r{SQck^FMfmJG?+KJDXCznDlMnMIrdb!
zUyhRihBrxv*G2w;CN~Kt;X_}FVt;ewkLzP9HSp{xei{Q_qAb->VZ>S>2{7X`b-V9P
z#t4|Qi2_yd#NaQG^l2T#xx*S3Hn49B&`3jBK}knq*to6Yk>R?qRgU9?uvgYKnSW^N
z?HGyxS@)o89lM}Go#wH1sFPfn?6L3b-B$)qJ<P2<o5?dPqYfR!8GG!i>8dA^k$>%t
z;)}o;qh6660m7Ri?tB!N!DJ2<7d~Q^*lJYA9R=9_U<x9hlYHn$*%mrKBKwk`9gBpU
z68|YK-@w|<VXF0hK1C{nMNfuU<DkcRIgy&0tVf*6s>R5*VFmtIvFN5Ow^NLy)YqV#
zG^&G1hPg(~Y|7H8MZVc#s-_@{J<jmr#XXFux@^nl1<AZZXr6M1SS>eSIcV(^iJ?)c
zt45{LMy2}AV3iib)m|tXm6SAAQ<NB%Gr$%ZazP_(WKi05bB_K@*ov{lV?`v0c+()c
z;!}tic9G{|4A4)6onB=VTw0o641)_G7i5sIp`V7?WtdW!mR5=E@*j~<+5kI9d;zc4
zsC1Gdr>exQ!jlIvVCoXs(lc|+RDn3q$=*5I!V7%H7R7i1WV_Ozy02b#w_okQJXp->
zSpa{dEwd2v#akBMht7Ro+l6Bm4^TP6TyWoGufi;VwutJthZGT|j2+XQVYDk04)K7&
zf|3I+lf2rF<Wwdxw${iV4F7ZcQ#mXpNFsrdbzLusO<V}r1HwM=v0`s3A!0xARAWT$
zu<uk)Py$d4=J|@ol%v+NC$`y)&obSGx&Gv*x}vKXgTt{gcIUb<F_svdUB=~;?f_E+
zP?+>O(Cf=N49<C~|99``u;EN&(OGA3UmvOSQly&FEY=ZItOGZHlt8@CL~xc6GxJ2C
z@kL(1&?OliXyE)n^6WUl^GN0bb84}G%4geCG+o8GDW^epNm<~dEQW&^$rqVKQpwKa
zv}Eb}WD)DA4eZgF5r`E#lSk;%seg(gUpiG73R72uHUIT~va`MO!(Kx&;KKHb&wBG)
z@^4cXwX<`KQNJXjWe=tqCd6xH^tWw^oci3QW+f0&7T!7<F}Ig0;tm~ZNnAJ$bnq>i
zmL6sD=zABT&t}cqs#$#~=u8Bd<bEx)@518NbGZTAa-O3H20zBBi{82TmUmNj5BumM
z7_1tiMiMfV;@)AfG;e|u66qcs9?V8mRAW|(kuVDr&PPy7HYjdI!~8aJ0}{9T2r^eA
zX!)^`l37tP3c4=sIr+mze&pjxpNGLg0F{`^VJSwaXYPebZ!$vgJq(U%!?Q>VWL(6T
zsxPtyMUkzOl-=$rso9?=D(^s$IodneZYs!N**g+s6jy`oBJv&P#S9Ar?llrTT<&o0
zBXjVA!GMBf!Jdc7A=Tl-0f_EX*4Bb7jWqDspBNKruy%qDFp+hnmj-j3s+u)b%QY4^
z%F#M?f`bm)lJ0G!TY6qN=QPkvl%1kWu3kKiUe-a+pyYLx>spm1;6$P2=y~NdXT%p*
z>+0xR8{F$S8l=^d^;fG&t;G*?7gda<+H21xj&fy<QtCIoo~l5mjYicG7nw$5XKC}4
zOyFPBN!sU7+aw*J4zN$LdITOtr&H1JK7olTQ`yXAVqi&*hj_y{j~R01be@YshYD)A
zf<-Xj97IbfV|R#=WxyE5nUSnf>xVt&f#>hA+@bL4U#(|H2T(V>uZt)sbX4gC6fWQx
zfgyi^Ximdnn9=b^F%`uDpsNIj>a@}}@AtH4W3a+B7!LF;Y(ydAQH`m`sy6;ALYzW^
z1qJ7-quoS!gPS6(7F7Zco#?FAkN5v~uY1ycz5SEbjajbj%9ND$y3ll~RdX(NHeM)A
zI#Z_PtWka6T;c7ix&>T`!n+9q>pLA<`+1;~Bch(Ae$;FP(145RuWGGa@+B2~<!56*
zRY?_!yp3kk$3Bu`b`<`uSPYJm!s$;&B5#Dzc#`QGF#}Gsd3|MCK_DGb72q6P<pJAQ
ziwquPy26?r#}P%*=Sw1WRb^c$)@#1?^w!gSlc}!NtXslQ6gvdk@lFA6Vdjm41f7FZ
zbE2TpV(8b2IOY2`VjGHG<y%O}Rjtk8Q5NM00KzMEoIOm?3An~6>oawONUmeyyOc$8
zz=DA1JS8iXz@-UH5*;UsiquUnIve9SS1?w)y666g@`R`(Do`;_;)}44a<G6<e(fZF
z4U|C={7PaJ{4<p%!d2vA;CLTnI}C^BD47OXCUJV<yg)om4@#7AuprNZgrv8gbtxkN
zfDFU9zmx`84e?xKk!_B$*7-#3Y?jH34~+)FQko@`9&*vXhmgqhY6E)A62|i@VAZO!
zQVj_rySn_Mhs7v#3<iuDfpnDx&%VkQSKyEoNRB;CW&OA}F)=M-J|AIU^ff(>9XEf!
z&w8Fo&|#iv#9=t@73n2!(oFod532*ua%@y)sWY|B53fcA&l0#%B4$%DI$qXWK5y`;
zldiq6v(xTXsnN=}fP!P-?L#;V0yol%UosZ1M2egdnC+HgC~s}eLwCnnS}SK^ogZxV
zK-3224EBagSGzIP8Y-EU>|OfTCdPFVj42Ka(K#%I_}yg88GL-qao<zdkVes<Y7DPE
z*d~)}vkT-*Mf6JOkOBmb`6(;`TFvy%9EE|3ew)Nuu=ScWV6;y6O#lk-dpO@cU*RHN
z>ow-`wC`~d*V?|s>K@wRlsYT8J0@GND6YgdESUaDj5=sTX^8bskxcTA9VXQjDP|Hp
zgqCpmhb7(|Y(53t(Y?c(S}QHH8X~(({Ds?g93h8MN8YHOlZx!aViYf{rXwK!JxNiB
zfL>`MTP59<tg_M(sT;p^B+{YMY3Wf_Z4n&tLyy=5<VV>d<sD#*d6Zy}13J@WCh(Lt
z)lZe)A>_qE3m5kcCU0zE2z^BuFy<Ff!lHQ7zJ0sIQ|q;Y<+Ejiz77u+LaZwZz2lHV
zEnPkhqvdcJr2^|h!g{y9%o0QHQlhPBwJ4$Dz;z$_Sn3afYfxk*#y$6zx8sBY_A78a
zwZq^n1Tmb{g|Wd7XIs!&)QsVRhmpe0V1h~e7oC+II-h^>^Um(}$@b3+lSq=>L@+>@
z#BgIlTpxg1et!Im{t1-R@tA@(78c-NZ_^VKQL5VBSWp6xLMJ_6?0EMD_I-kZ{JZ0=
zLiq&-2Y?>y%7z)(ld{T_LLC4&Tn`{1y|h9Au)5)e-g6!VeEs@sj4ppqx(*M?VFOyc
zhof4@+%7QCd(J3SDFA!V;c(O@H`(!8Yzf=GuZkCkb#LV%MzY5AcbvwK4sNRa^769x
zaAo2BFTbF-gELcG`JJkur7wC0b<q)K(Wq<7l)KehTN_e^+)5IG7BnZL5#IY^HSBXQ
zHCKIxsVI*lmsdlBr+!Z@JtG&3Y(X2iDPQJc!kOiGi?S^4>Ki5nOkv#O1LKTYt-8U~
zvD8@<I&!szC!g{WQmPWZLpq;~{AdY<P^EMj!Ept*7PW={U2oK(@mx?BA$US3hZm6N
zG0TE6da3b}lJq7W!w#8gqe%b@A2l7eVpO?NsxTnpuW8Jo5Er-petdY~vBaSRRLLcb
zbudJ6LospOdis{Q0mWbH(~*%~h+jsSA5t42_a}*Aaluv4n^@pI;3JttZ5Nv_a<yQj
zo@wm5s8ooV1);T8vNa^<<<wUN+2~=F%^ocp)INapo??D7BtTyHMcNZ|0D}1xjoHMM
zeGlLNrjmt*BLAsIw7vif`%yq9-J)t{o4u{2CE(FOzDvYNp0CJb=c?A7Bu)}JNksi4
zlQB}0p`Y~46Jibg!&gr=>CnhbTd+mqti!1}!TVp@Lomk-%u{?#79#d@ggn+$E_aO@
zZygk7=qP>>46ip-A5IP7n2rtgLr26Zb_`RGu#SiH7uGD{W_HTbY+w8{lmn6$$V<9&
zWw%`3CK`B-CYio5HI35!K4v;Pi^v*BuL55GDF$jIN1w9@1d}praHbzJ8z2<~2;pe|
zPx=8&0Ba8r#edGXr=&UnO~&}@=nm^2^B+Y$rO}6#!}&BxF?GsL7-VCDX{B&7F&R@t
zJ!UtM#B4HF-vY}LwCRb^b@!}26WXdau2ZFEb3A{FTUeF<k7X2(C_W9u|G)_BmTHVu
zd46iCUwI9>S4Jn5YQ^c})}AO@uZb)<Oh=-{TH+h9dYk$U4`$?CuRl4;@bS72<TFJ2
zAnu&S@i4C+Lu7KSM<nCzNMW-drafSFe$+DtYMJf6Q`C0LIgEZNE~ysr^$ggNTv}``
zqPhdyT7=_4cE_YmPD`hjniB1b5*(}>kabDwMwz;zs<w<T3H+!%Q!})NJ9C{<Pu?Ev
zAG|Dyb9oq{n&I+XutsrxX^ZyAih?f*$#mLvW6?MzSV;^!aTJILi&kD*rhh4^h15RA
zj#?yV;Gq%Kc4&_PTMmJ9OvDR(4xe$dv?Y}Gl1a1#C#IZVg<0jiXIu42`KEU?-1(Py
zrkB`hSY8=t5rN=(@sYu$o5j?tcS1G*g_pC2K-jr5Nyk9H?u8c7>h<U}#&p<}6o!JF
zGNgPoPAG^)7PlxRlLX=9e&{%y<{CyRA#~4z=psyF(yd#=f~S5WhCtn&!-E&kSNKs!
z+gh1q%Y7|xW}G&(kA73M8w`U1B@If#vvcxGG%f?~MpKVS#S@9$bJn|sJYNfQ&ZWHU
z0IPkHpm6Y<SX1=IgC_0Df>#~|<d>%iJP~RYC6yomCp01wAqS_}bo*KdlZDYYAV&g7
zB1nB7*`tD&2QCZ4tCjXkE)s4;I@;l+nkMvu^#{n~Fl`Yzd1GIc;jt%2VFDFK7iyO(
zS;E_qW(Tqk$pE~EIi)Q96dr@ghn&hjV|<T&U}wxsPgHh!<Yn)I>zw8Wx`bZemcB@9
zivZ%Xe+rv~r6s~=4-1+hWuoe}iWeTYzV1+1AZX5|M_UwS!Ih8uNe2g!;c;q<y8R6E
z+IAw=uRL4BzVcg~8bhZv^68_dXT^~dVV2`gTF$|dr$tDHB^<}1_*3)GX2>8L1inZ|
zsn^2MtqfpG3ECaLMv#J{YSRU^t<$$1Z*7$n1#3?`vSA|)(6wDK2(Q}AAg_UPZGee?
zDI`c>7;b$qX1yo7JAD^Kh9Gr!=>6AkUhTc!J2=_K$PwPb;mO`{SzPMG?}rG34}*HE
zl|D|CKL2?SXIbSS$i>7@Pm_1k;^D8`@$jFoIN(SoIHhYZb;He?1<_ojlT$J#@L7sW
z@eohu0hl}h)s7TTnp_o7Z0zA8q$#FXSWHGSNc=O6HMv+z&?viydgfsW#~oiend$pu
zk;ru%i~Yd|zzBuJQ1{ldY0DWz=!L`aci7Lth)ARpI0ZVJ-bvti<6Cu7Gw-`ZMTc!o
z)Ygwod8`E*b`>+XedHT>w}TEz+tDu<4~tWwRVB=za4<X$G9c?udI6nM35wh>D-O*E
zP?&$&-Iyv7-V!{)+c8`WL<XtSkzK~gJ6<$&$xq7TBsfF2R=R&hh$Oy(OfEKYVonmF
z^DLjbdvThj%Vv{fS%GhPKmfT4Nbj*E*37UNF=o3gr@q5Zc+6~1FDpn!s!#A}h%D!n
zAzs1p#z|AE4Mc%Kr@0QOg)Lh?b%Qh&e4ubvIu8ZOL;A}42|Q?t9R;2gS;!326z{Ij
z!iykxm8C`#p-K^J5E)paCOpuKb8<=w-H`nW&_`5i>l1fB82A#|g_6mJ?*hIm1>O#a
zSRR;I`1o|HLMarA^e2HK9;KhK3PP8Dh%b>xcJNS49`*h^IeG+9YSk_uU^t*FQFHBV
zY|klY^JpURY*6c0)KO>+VA&Gck2Hyp4#r&_1#TuhP>B^qXA{v!n>9r}L`|7>r)g0e
zUA7DVjC$vAHW3RoT5+Q|&FrDbp`WCO32C}nPeo>NDP}DKN>j$U#h5K9RBD$wvDs2|
zn<`43pk7zA(%cTkCw`xO=J1|P&y^_mNIFgeBn`{mKn_f_l590r*^Io_UT?sDFoX{|
zPJ5?G3^Er=Ju%xE5*GIO8!aEcij<-AHJ~-4+VY$7&CuPIuqbV9MRS$rCX2BEOabtd
z`E+M9U|yQ&G5<CRd+$h@{MLSqowB=~T{1Mp$yuC`sZkH)bS0r<r=AH@(OOdgx&v%D
zJe$N5x!6_>XwH>{<ouKZ2emG)$*MyX|31##*)R~)>64PHnKhHdIpEKO5JqzuDTI4?
z<t3I}qq4a>w!25;SFTIY2g-1i()9&&lx7c`!XLy+%(>D>k9gP@X^TJ&s2&u1xA46<
z&H<{*ip#^?o{Od8h!e*HX`cH-CWGH5zz#v0YJFQODf<bmtSlf~uQq{7nB<w!=#VQ>
z0PoVw@degq2qgyQ)j^5+@dPL?AC!p3CmuSCSECxGb8R4a&Xc)}ufvvHeK)iavwuw5
zk`%!qc@q&(k0huGUk>v$kX&k%T`rGMONJ6HUC~WHtlst2uh@17wJ8&h#>GY&67o~E
zj+~8%$bQHGlfbp>px)!LJ9XD}$GUQ`p)eIIwib^n0oW0B5Q@`9#-ZcjEjFI!67|i=
z(eD0>7dfl-($l}O#pWwYAa>+is6e9K_bjjl4^cg!Vg|(mZ6?S<n3m6M3oX9kx{fD6
zs>~5#5R*hC1j`m2#-vA-PB4HCV~H3wkOAQ4+~@mNS_%j=DchV3`UsX<A+`@b8*pp5
zG-<fIisH$<GQ1g8xX!i~omFW>>(%s~oGz_2B8oXmG;^>?NvsiP6AP&<`G)BBk)aQf
zVxHo*Nh=9uCdYG=yi~;$CfA9FWu4f5v)@to-8y27OQP|B&y+w@Jb5@r#oHY}a%`ww
z7UwbwRx<{@^GKXj`Mx6x@EqWaV?VseW4kOE5fnw=evd4ieDAv@^n7u9LSWXODnA+|
zmh%KPIzButDerx!eeYiaXbL#kmpUpyW0r&$j1w~M3;L;XcEYVOM#)NeLlP|M%N39g
zGX90<T1IGYTd<7Z5m_Xa3m3<^fh`~bmJlfBjrS0IDpCTwzH=g)qE)B(rX+~Wr@Qlq
zI3Xle7{4dtUpZ;ejIz^km?X&HP+1}&crWx6AlpRgg>l$X4ou`8tOaNCvlr<Z);XN>
z$RZ9kiA*6y<r<0L%i%J^>Ym5(yEJdfwv6FfLi8DOiWQC8xYI%kbSgJ<J`kH~KcwBx
zgk2C!lb9~<H2Q8qIDc-K>U=<#xfLvG8~E=C8+z>hPxw7;JE?><Q>3hf6P#A>>Ek63
zhb;Yy9G&c~4Q7<KY!NLv4jW8rdXC~7n!BJ9*5H<G$)qyp1T9n2o)B~RDq390Z(fuh
z*Si`GpM`m7C=QGO3LwQ;a!DvytIPR_RvC$hAkGfc&BaHH^d%T?F0L)Y0=ty2x-`Cp
z%>qkB)LIY9(Ppu^h_^7%<LaX8x+q=L)Ruiz1vbNTyX9~Uopc<NSv#{M^MRKKd9QVT
zatvEO5JOD?GSV#gH(TuiD(%iZ&rak1^|Y>$OpKV_T>N&C1^4Pc3~T!L^S8g$cdrsT
zYfo#SqD1~^z2iOpwgW4m<9)l@@xFs+YisauZT-fLK3cDB6k1vP4q8}Whc?%rJiTc%
zPaoGb^JpEKdGsx`@EC{pWNrP%C|v)xrk$scp`CA@LKEK->Q>hu-?Sk>MIGMOaeCIC
zJi=DKA^fdAzVQ?RK5E*6o*?#CzkyaBJs~8nes|+}T0<UO)7le!4;09MzTrRL;-4F1
za!QM9tK7)iy8L~7i`J}FzV>8s>lN<b)ooAh+SA(%{P7g%>oV~5$MW}E{`+YCHm!a;
zrPasM>SJl`iM0OoHfY~sOw}<>Y4$sztTjE|>$jq=N7Ls}(bsp<;<`rolUvR2(`gg@
zNX;;?K0&(1`r54~S&&xG3S|jDl_tN{sP|sqVl_XRHq*!(r6J&t^6eXq{M$4xSewEu
z1?Sihb4<bgZCWOr)w0dk%r;*$+kDMz^EQZ{(ju_U*TObm3)|$sPjA!e<0-AKORMYB
z+WNPG=3C9{w^LeuEUiA4)}9ESpWbRtmzS5T+bnz8oJikHC(<`eq<fl3-!PHx-G)f_
zrV!~K6X_lk>GY;R(za!5_(`W0xv*WKQ_(b2iK2mwV<&+YM>{94yo2r6d&h6KclJt?
zcUvw}>`qAsKJ6VIxqg;-%@D|qhIqIzw5A67%bxcmTX<cMr7dG`D3?29Jdl&kJ)22}
ziKpB_R?zQ+6-}9+O_a_$h)~DfSDxS6tS7lNMm(0aPqI|{c*!X(3Q_acsl;&v#N_&P
z5)S*W1;0mO&jhy}<z??jc(t?5K7s-3T&&KU#<ViRGD6CC2+RDMD-%ZjP{K+@+O9`C
z+R0^&o;73mL&_df(yo#Q2Jgxz<FPUdVim6n+uuhM>=Dt2a$9!Hk4>CS@}I#79!iNq
z?hwo3!DcirmW7z$sqa;)XZ~$Pu<VQ{AcuDPLC?SL^wadc0n{mCE00n1P}ey}+&FHq
za5#?Jad+EwAJ0X0X493x<FFQT+e-lPl7dzX>+#S<O!+S7jsH!}4RkAE_w#x6e|PWr
z<mm99d%HEGFdZdWQ#)%MM`SLQ9fE2hwOyGeS;#?6gOC)LWLMnO$(&Y@iDJ^g-I|oT
z*ao?R(sh++C39h{a~`2pzMx++H}n9F`v))gU;MNC!``bmdq=ISw)f>#@ijg#DZ7w!
z1YKUVsuXFi?JX`7T`w{vvm>Sb?`nIa%v+L5pP;b-aaNxqKIzMn67^^>j(g{pK9qh}
z+HC3@q!`!ykZB$Er6fqnf&l%!eTsS8zlJ#td$wDRtNSaBtXFXEya*DE1Y`wY<iLye
zKCJpGWpnI=Kds7?SawLp(oMqJ!`-Iy;TezEAq5ewjFvs=lX8ixj6#@qQmsUY%vS?+
z<Yuynj0rIAr;oc?Eg~*&fQbEpik3mXE9{#ZMjb^dY$!xF5Xe)Aq%^RsEC@xV%O5+Y
zh?Qwa1EByLXp$m9`C-FFYyhXSCQ03Zs8?jh!FF&MpJ8ByWW`;No$p~2B{t?qD&D2o
zp|In=8sZ#g8m%PG=vJu9jWn9|LajOqKr7+7&;A}cKd$scz7*8=`=)1P&ZlvQ`^P`d
zt*FUp3r{8+Xt8G1QeK&4yPt4a5emXR!s%|61!(Zf>MLiAD7Gv*T$8b#H*Ztk!_l$O
zkQMEBZK4&1l}sXu0>Sr}EF1#B{xBcuxo{)J41Nox7*gGfjkvPlQl6!V8!x>KGcwZB
z;Nroc5<4uS5rXp2j9DLLqBFBtXI%<Qp<wLV(6CfDV8U=IpXxvxl%1mpEykaEdW3-b
za;516Ty{Y4kwMj8_Kt%})Uya$SR>2OartWB4OWz{4#3T^bBBz0s_a$u1g-l^R=8vR
zKSRs;lp{grSYxtpfZ}odi`_izTS+gr7vT^%9-738eImP};f)>zXPX0q8~In=!VuF&
zT&}!o9joK87jtKJuf>|)u#QSLCmyKbaA=s5W@Kt=^sd?S;RHrrd^H4Ag+Ygkrr}C6
z9uw-BQesTTbC_d37cY}g*o{wzAtga;G{@ytZ?&D>M5-%z^;3tItPUyvesnI@`V1pF
zu#<6#nqYqD?FXlmvssWz6+S*Hr5mLPbR#5qcZ<M5Xqg!_z#o?X_~_$ae0=N;{ok*<
z=<YEK3U#HAk4Nmv5_jd}uVu?$bry6wZmu8c0K5l#U>~)a3N`FoyJV<Rd7(RQn)p#M
zcrg6-wGR0+-QV{kP87(SGtCf||M;}dz4-V%1N+e(hNow}-mFNJY9A4oax@`iE~(zw
zIJJ{@<?;Jr@H&Yu!>F0cptR<vL8(hte?I<-rz71gD3t(E9~+aoI8=AI=%-<Df_^x`
zEGXm}A0LORA0MA{UhzIS3lgQu$H$`X$VWt@6|<oM21}wjd?4g)W2;MXv~=kw7^=u)
z9QKuFwJ!+)Nll6_o*I%=U|rzA&-|gI_yZx#lEK{4=nczp2Q1!7fjVl`5QHC*Sc{0u
z$)rl%V5`@$TkU0v>g8wwwdV)nr%ppDQ&i#rFSDuClaFeh;3En5hj-U$L0x7x8>N~&
zz1AwWg3MZe#<idn1cO`{K<JGXiIN>-ga)jJmo0*t+tO%${HU7d54}jjh>~P1xrP{}
zOU95LEgh+uTNdu(`HM0?0m@XK)7|WR+?Y1)N+0cDyd&4;`u0%gpwSn_@Pwj`Vi<eA
z(9qD%CuibT+B*5+O<RTh<6AZDPF}~P`7S~gUEFeiYv(3UM-(L=_*_^~PsIlyqYCox
zw`xqXSO;k%)2t}=ptmaY*HGedjC_-5^)xsO$;qydMn@c7PY;LV2PEi@1i*ShLUDA4
z!9}3fqfnU!7wQ<nY7wXo%}HoT0_;O$%H!f6oFi(HfZK=FPnSX$VS*tLbRZF+A-t!;
z`>KhRl9*#p@|7sYjAUOzT;iwK#Pn?WtUe;mB&v!@BdBT=mj=Dab*7yLM9!lQ`ijWa
zZ%gdZS9E=RH%!}xQRS}3YPhL|oE&N`KKd>~zd5?grc^Wfg}O#FQ9rCmC%Dr<s~Cxn
zTv@TpKePMZFW###np|~qHWTL*4-^d&-yv^CxB6VCEU#97h*2Z5^N|W1IY|SH^#`MH
z2|5EkL4^PK+QSG6=P||vU~gj%6k|A-jv-4?1~@g{2PF|nct*bL6in#RI=MO$s_fjd
z7&}O<i;{^$JUdm(DZo-W1j<o&i~)kt0zhJZa8^Eag_eAgY(N`aokL#<S99JQ`)M=9
zgp~bgJ0Y|U?c6A^)(j-kc7h8hK`-bB6miDTg5m*~#N|eTwPvAE(;L~lv@N2w?#Pu{
ztfF;{v~bXDDa`|G4WhGAPsxM$S=DB%gO!hy5c489A<Ipd_+c7gR6DEGMj`51c`J^z
zs`~5-29`ijXy((!>qg~>HDcz?J9OyDhWw)tl(NV}R0fr~^N*svg$h8%@-sz;QCZJ5
z6cse&N^DfMtyJXNFx#Z#hIP@PTpKa6HpW<~?ETNNQ+1RiC^09|6NsfZo^+|Njpxa(
z^wAjp8$cG|LGlQU;(oyKt=P^}I0bdIaNJNC{4i7(9WFVH+92>ToRTs{=EH_-xrb*8
z<)=_Gb1EtuPXB3W+0NmyjLAvNmpNt_Sw6*)LkBn}iub_wpUH%yYwB1J=4doNzqUrF
zN99OeNJ5Mubi05WDG3wMh#M@BTD*+C^Xsu?Sd{A;MGe9JVWgeFz;={?a6D5A4>)0Q
zJT4tO!~rMfVOpfI+m=AXeQJYE&PK7MoMgL2vgORP{o<Y>JVnA{5K7f#V5FhA7xHHA
zm``y?d5mD<_cUwO0(|9eP&gjWnV;UwaCeHqU)8d`n=|B8o86*jO#}NrAc34Bn#L6P
z697?Yq9Je?6&14=qJtMfp?kZ$A*%*Q(I@SBr5H)vL@)8vb7aANsDTC?N?)bDghc3i
zVJVx@MtjI1+a*;Yr+KkiOU*H}WOhrY%^WtBBZRn2m?f{&jFCQw7VR^w<A*tRh<0sG
zO0}CCVKy-?tRmY6=9u#l4@xYgwH>Bqe`&NxgM5tdStcAMy}(j@?($sG&SIrR98cz9
zKTBshIKp0c$&$P~n&AlORI9a{y`!1hHi7*(=siZshB*mYR!>c$Wtt&zNAop2+*sg&
zXt!uQ5(5c$HH>^|>y0W)+uB2NC+vHza2aG2=)^^kWGedS@4sJ@R~af~%$O`UmHq|v
z+|FB1uFmGC^~QGA+x@Zo;%INr^3Jm>m1JTg3avg(==e^YG|~*AN8#Z08Ny7YB#S0B
zAfBLhEmYdxz<x?Oj6!lGz{sA&wgby=Lvwq0kFL5|5LsD3tZ0Hd`W2^kB)>t5Wo1Aq
z2}lJ_$0+mCCP*&IbB9BBo=DV1712}Ney|?~AkVE6C>7=Ovr!!Oee`MU;jS`CE<`>e
z6KLknLDc66s2bYuK@u}aRG3ouP=UZVNCR(GX{FF%vV=$}$3?z(;b;`}LtipLp)@I^
zU(&$Rn%W$gaM8QWQezsq$EpT2zP9Sg0>coQ)w`UWit_9wp8&LqkL2AG+{6dPme3of
zwkgX6xM`b?rq|ts?eq!tSKGAm%X(FOS>F>M-DZ19I99BTc?wa(yteXOUz={>6{GlE
z_W}#C4fX=7bhEvH7-_q}HeXw<`iWWEQ`u)JcOVHRu)tvCbqtJ3VFVSsz_5NJKZ;aV
z9ZnpCaY3Ot1^KlCsNyHVTt4F54adrn4)dGeKR8YB$JyxGt{bP>CUCqF1=iR8ZR`a0
z8SMc!aegLyKqU(-eSfPxpuQ<<5157XPTK?K!+eKlT?rkEM<Vtc?GD1`MrKt2Zt2u^
z6MjsZ8{}-bNSH54=yu6upp|Q^k!lTN%V-ZxLe_<`v~{`}x*~K^4?4LZX}Hpg#n;6L
zv4t*;80{6kUTHUIyZH$POj$O=+~uz1;gq->I)W?!;85RAPdJLXgbO!>Y+~Tr5w#`v
zgd4^jQ*&?#aEy<eOpLVL3M4|qkZ&HNI9hTWM}v%46cFCzxa39*edjX&NNC@fvwU&3
zP#0)UD@Ks*jqj-%5~d1CX@jvR5THJN?6uba-_!P-7LJu|yYX7F>U?nfiky496(EKB
zLwPhZz;>9q#%7{0>y!jIsL45QX4=XzD!HNkOr_AF=IDIt8v?7hO3Sdyt<BO@uj>7r
zi>cYGX0yw=q^Ec}_u|oMD2X{#u=jY9jVGBA>@CdSATM*?;0?K+hIg*QTx;zn1t~`@
zqSiyQ$e#<SuPg|yOu-&a9U6v(Lsr#OzLvz~pr#O4oWz@RC}frSMQu94h5llap!9^`
zIu^<C+`ADqY`ZLhs#{TMa;?lcu6|YV;z*C*a1@=Ao9(-_)d&s*192cN8`RczQc_Yn
z3R2tAW)g)MZpG&$MzlIxY>tvwKnTA+LuQnaxlDW+HS2^~h?IoNoGS`5;Nyi!TjiS?
z&?MNsmo%Al%dK4Z31$zbe8XT+5&+|6dPs?-GESXKHb1u65NEXY{IFj#W!8b@A{fSF
zxultH@HBrmFFas&UZ3L*Rl4Ony2(5gg*^otu}(SMDf3%=8QYY=)3<|G#Ix~!wU2<P
zz<Y;*be<4dH{-e0?6xGpJst@1SARoe6pb<9%Ns2YM)CTl<CQ)bf$azKr1OHo0MD|@
zjCtN;woOR{(Un(+bG9h`brLo6nO24GjQBn8=X&?@UmCBIze7JUK{MX#v5SfX^wGw}
z<N>5^ektJqrYkTvW2l_5;`~_|z+^`<>6A?&`<7V^Z}rN5Vg_5*nL!c+mW2{Ux6{pO
zfVIuq%{}qUn=@VGrqDvyG)qY_%pmzjuxilO)@mXla=@#?;4t5-Y35gJVr)Q~=?9W=
z-HL^!cN@COM2CSh+F0;H82iI_??#DXZAVdX=Hto3z%%<ySqIBZEE~HnR6CJ1a9t>w
zl)JldMZHnuHIIeoe!`jKTK`{Ef+><J_fOO3p7||wZ?%vL9X}*o<s?&*uFf%*4%z4Q
z0+W{vyMiKRiQHG3UdS<Dtj+txLak)NVnv~h$La5-s}t6PZ@&BtFQ8@Ec=?rydDfiI
zgUn~}^fkpl2&v~hd7Bgawv`zwp>!+SG_2X7TeW;kbJCJ^X3ejy%(**peikQWtNaI<
z;JlOZ3^S~}3F8U;87#@Ft!HfJcE$3YNhr)DlE?r==t&}$sgdJ}VM5{o<nhqIw(hk0
zp??;|s8|Btk&-hM)G#+H$0xgcM@QWk`>*y64(;H+$QxK0Vc+~HMG;y?CNU;Rf-bd8
zX5Xo_I~O;`He)WAhSzpq3{stPl`X~CxDjaiG{8%<IO*u%cEZolhb113QGY@=9M;Zl
zGN?NNfRz>{jVB2uR__PT%ut%e1-9btc$?m$(A+bWAr`A6^Wx`&9l0}#RMvQja`6wY
zPdzD5e+<WL>QB3D^*P}}O(IgA8&Y&<9Vb;VU&VP0mX@Q+FiQ#d%%N9%8|w7F<vkR4
z$dS9M^Y?lw>W4`%RS6trm*$Q9T6Hg%xH+%Pw`rO(E%!~P<v{N7+z`+BagN8svn~%F
zZ<uliWanMA0#?Y@zE%^hQy7utp$%^x8aKYdcO+EjhSrecD+XO8{5!T*w9>-jRhnF(
zwOOr<#2UH=-enoX1HEAIqBuk4Gl;??Ox=s8TF&@f$c9Vwo=6r|mFqsUZhf#;Ne*07
zhgBu{Y1Q>%@;R3f-Wjbunb)P!EFRz=)A9SnxO0;mx8=pnt`Nt{?Q4;Jt{06su^3^p
z`$d|QMZxPLXJpiBIXLo@ll2S^MxxtN?P-4mUZbh)fo{62k}hMu^1N1L1baCR!7-1h
zHUs(L?aRG4+b^q3K{nLDEu|c08YWd>Y3CZYdvG|lWh-Q^!J6R5OabS2M>9l_^v;6R
zK8!wdRQyizTv}_a%EUQClv=kTv$*pYgCR5sd7w1B*3CkM?x`W~HZ;TRgTa>&lN1v&
z;DLLJ(MCmL)!Ia=9gCMaJH_d>go}rMuyRJ{rxhbAKgrZ}e}1YYk191eFUPB<LH<<X
z4|2kBg7`H*-n`}oi?zch8XGPc<QKf{OOCb$VRqe20HFwTY>tp4S?f(B;RB9n(ALrb
z)h1Yrdb83G%#X$*5jCCqNM%Kt$a>kRU+B3{u2OVxql$8yj3!4jVW~G6l_LpWH0q1C
za~i;62GN+bLENW6@+Po`eg-@dpStje6_`@58}-kU7`*^`K!v}U6Bc3JC5e^5_vJ``
zUVkzgQ*_WKm^;JLWtgKEH|g1Vcy_*YiNP}J`er9|mc?g#k?3v=!l-~h^P*AzsARqe
zFp+QMiP%D*r3f61VI1V^WbcxMNO*~v6SjU0n4hTMo_tZ3K**NMTp%@oajrfYPm-A!
zT{RaO_w$J}iIZfwxp<ys<7X=?co<(ki{rClunYiK#w%xdUdn)VrYnnE=7&*j_&rP>
z{(NP^*N2u(qe1_9;E%h4u`bW<;?@s)+i$!#M~A3H(coSj9=+Z^u|2r3uEsXkg`FMN
zlrp@U<6Z-O3<hEIBaBt&gWe6^a0hw;D5U&n+-1cxH65oC)9zfCu>Jf4WzZ~Pf>qF9
z5XH35H-q7egBW;avLW{Z7Qtv+3X|zY)G$g_WWe!SBN9N!UdxTV;t$i<7~u{B|D9p2
znE6d@rtRF7a&dIe2Z9^D9`%EH(wEwPXQ8kB#{B6?HgB{@BN6}#HG%$a-KhAU4hEs2
zshx5ZphO?05*df(e2_vprpu6`y^u|K!Jf!rt_Asuh4}`XSIM?eG*@8cv@x8PCCc+0
zb=V9mi_b9rfawUH=_9cK7uz6XI!Lx<*2MwI|24fuu*(H8&U#vzKCCj(Qc3W*Inq4q
zOO#DD-Vn}4|Hb;B@><yE8&G|4MebHHlal?Wd_s#atA!IdN=CsYa8#9-$)t8VIoH>>
zPM1o{n<a^N1jt*_+>?&k+NezvtV%*!OQ&UX@6v4D?B>U*==j4CaQ=kST(wzxcA1-Q
zbB+YNeF31)0(}B-m7vOHpv2ad2Zw<?QjCv*S|aj_!kc|^Z7M&h?z09xALl}!)^tDm
z0jt_mBmIT_0L?l%m?3Zex{wVF1@8$<hX4q@0M2nSxk7-P#dLc>N0N)1w58u^Xy4CE
zZ)%?{XOjS&Q|G70^p2F!l{@b870(J%1kA|<T{<vhSWdCQGGj%2<<f=T@lZ#JnJU8H
zEC&h<3_zFsI$v&@#fjK&kjhF$rX}|bVPxoaO_!b2f9Gb)b(^NXAZrXqAd|pL(anou
zMv+<ZFlu2$u%LoHvl<w?Lu44FHCDl9n0LkHjDBH8K3CK{lyJJwh1HF0Jzb7UXJvLL
z>|HhSEn^|oxN48dAKi<PU|}KoeK`4?2Fj<Qhm+-+XxVI-C@M&prgT!_i#RM?YNDlM
z28WuU_bxU1ik!nNbcR9jJ3Im9oHprr=x3-hFF8J;mmnXn$W@SjhJF1#4Su8VA$b$3
zUwFW?PFzMm%}KMJOw0zjoqRi0$B3c6gK>31H99MG=%0SHFV_kIF2C1HveQ77R=TQN
zRx<LXwf4L%!ffr_EPGE*Z};i#J;!2?qNQ9)Oc@Vq<<h*G(mX6)mWUqi(zbd~0;fzd
zdFnZAgVhzhOVPQHVu!^UbWq}+=Joo)RWAtosnWiXU81_k{TQK%Y<1}@1d~&wetHCh
z;qN|@qaGPnAz`pyi)Y>_V#&^o+~SFZ?uz#g?uOrf2tI2f=uLH~(-yt?g?0mnI?IvH
zMpczV-E>DfOUTSS)XnHfry=DX>Sl4IGknbi>L_uf`xqPumAbPrAgu8z^Pg9antIwT
z@Z{riE6MOKO9xSFn~P?Fiu`Dazv?7!?lxUX>{g0bCvi>grqBmkz5X3>>f9OeecXpW
zSBd_vdCXY5!mWe*-XxjwON`8uX!~9_`ls@aC7Vd!O++9)*LO$88Hiy>N<PPp<dj@;
z&nb0$T1F+seMDKjSYQe<N}RV-6^ZQ*-Y+OG7k%qQoY!%T;i$s>KsiHN2BCrs<^BRF
z9{9arjs&FqQf49|RjHPcptnyS&*?<&I`ubahA)NMSTwc*N7A_(<!8$+DR-_js85u3
zkK__M50}RYxJ-aC_!K*GgDsql^fgujmc7HGG=>-K<3yqY(G-KcqRfN2F*H}6SQnF=
zCusge(CqM5sMUlF=5#fE8$$45vIxIwCh$LwzM_m8*t4VY8NaxQ8Z4D5*ADQ1>*ks?
zE$ZT0sQ{6JVdr#Xo4TIZ0Ptan+uHnS#`0mEg=nm5e+1@Xd-DEi*@uOMnHY#&@6XOc
zoaNML(fl#k2)i{b%XwrL>Tzq{>O^)EaW)qz%3bXbQt?C*9lf|ES?d`MpF=noVSKRR
zBt0(|15r&MJF#>1vAE8J+{F;VFA|mgwj@-@9QDJc-I;l!a~&;CGm?1SG%wx6$KwUI
zS~9!!PC6Rgi6ge7TNU3X`;=u8U2L?U8U=Y!o&w}0kY>rGhau}Ncb@9=QVHoDqGFGX
z;X1hkga#M|07_CVaOANLCOGNYR&wJY31hr8vLbJKXMS?(pV@cfLyYG~XJxd^OZ7da
z@_|!pAa@dyTx&QYTLtc`Y7{~X2J=IFiCb<*wQRQ-rk=SCIV}yHrEbkA&Xj~*QkGvF
z&r4;d;NYO~*uuJii_TUwD;ABZ<l#f5nDXYLps*os$GLzM)`>RI=CcVY69<^6WaLMf
zu#5;@l86BRo*%EJTL{$1&a(P+rFmPRdX}ceUZrKsc#i5Z*u__r4nhZQzF=+m4C)Aq
zVqCnEK|<Y*%sTGH<7;IXO)aohtGyG5k(9(gLjpqcZYgIk&k+zBr#tlg0f`{xOB$_H
zh5?DFmJI@KLt;8Eu;W1vf(lx8YQq|bV&H%wEQ9emtbdpq^0)2iTV(B<tNnRcK9$rL
zmf#tQ`?{|#kMSBxI%L)s_1Fn;hrYg+V(vm|1B-*eHYhL%O%rq+qtyo+z}2vqeiT59
zmR8&EuTTM{9yhLbk^xXUHw*^>-LwtEQOLtfbMBG$1S<=XC>$<jDxfh(|H1i5LN>V{
z5_RCh!6Y{cj>F*+K&dEE_TsY$RYkTgu~t<Zre|=LIKQ>7)(MMJ-{9%cj~ZoDt7~x1
z%x(sI=sJVQIf;~W<YJO@Sf?B|=549TQl)~!ih0tMlPPY@k>zk@8BANggc1^KK9<89
z92^VRilOWv*X>+)X-Sf4o$B~t=%3xWAG*j?%&eOclwISaq|@7>rYS)F6`wYy$gR$D
z=W{FtW$&YkVi2lG^b)95d^uI%!*Zf{z5VLd;m%Lplb!9IANCd<w_W><9dkbG<)X)1
z4!!v^Z!d`{h1``sPDyYS>zaTEX$Np|GN3uqC~zkKj99Zd(UaAab$jD^dl-2_BbDGg
zdz^~+36+?~M_LLd2YlQ}HVWDt+A{#Dlf)JkDN+Pqh{N83G5{v*?Wc1+q0M|WYj`GW
zLffShU$b+WJI_-iC!FN-=pjylx)X`*fs=8~1nr0voPqMr4%@~)0*!RWnVNL1H=rvd
z@|!PSB<bVR9nb^F$FR#>&q5JW<ujoPhvA_|5KG{O-<e<xxEqndq?mVjg9#qZ)fDMO
z4s)D^(i_PJQ<2Z7P<m&11DWO~dk`v3m5@?$dHW!>W31bjqV@$TCu%Xb#(3jvzXx$T
z)*4xrJ}MZ;z4K~SjO~LGp^i-qVt7aUZGx6{cE{n^b7l$PR<C<8G?<R#NLf+2d)&^+
ztM2yE-of^97k)XxysCyPX4@EUY977;ItdeI)VL7^QOysodplv34ktKSVlQRMgp$wq
zwo;bqM@PNz^hhXmnu>QK5i!Dnd5;!Kz8$i>*;J|=HAzfnH+(MT{#lyaTt7LKlu8Z5
z0nt>tS53t%DNG3$Qkh+=`0_>>T;c|~vYIArQQ0u(N7jVE8<92D{NQB$hSCc8<*DOp
zXx3Io*3fQan!SUa3ix2q%>6Py6;$(sPsJ_^PlQpGtVXt_;0m#1hkldurp2-gDkmq>
zzf6&JG*SML=-ODHmPws6^XZuKr%4r69ZgrQY}mQ6Xc=)u?i{R9u`O#4Q&%X(;w6+t
zJ*FLnL4|jq3(nsrA>RXV_%U0*pDJ_qz_^R#_2_}oqEqxUAjw~yybEThS86o5BeS#w
z%D!u^`(tx)x41)2m3!}og1KFTGD`9}g{t!tLUf=~F$a7!GTI+Mt@AR@E&ZkoJij%x
zc*zho1?F(Z2VTA$v#v(dc83Kri&W@Z-(H+34w4@o5jS1*;NhDJ<1NkA^j&^;@A%~C
z@Sl6T7T@d``)#FZx6HQt7VdSpud-_eHCZqC7{P|!)u+sx@dYRIOA_?1dqW##gaz_X
z<g3O|a<EfaTijbr1WQ*qw^WQ(L*wggn054pMIHB)0lEgQQ_NNs+neLsPn#tzDXjZ+
zJ~>Nna^6+0Nn@DV0JE->UlR1l@fJ)?FwfW<jr?)R>i@8!@|3KsG!?E0n-+yiPTr<2
zYs|S!LN3meG-l7j-88Fhkzks*vEGDMcH}%U4w5BVpH1?zT6)M_e%2f1=+@v$YMH#O
z`RuEtZ51y!=M3+L4`N}&u%?nW{KV+|ctM=|c+)VkJ#T25g1*WAN3n%<>Q4IzS|P-9
zVhaa%Zjw$3cC@r6stpBFS@*OXtde=0`Dl5|%?^eru)_S#Z~fdLb8*v*pnsh8(=4xX
ze*M_B?rQyv+}y`^wSHU#-2M8QU+(X_UO#MN)ICe$%Ptuo-0*;%gL2ETF*jL6PDpH+
zKkSTHPyq#?haoJEmKbjgg9|)>J4Rt84qjY6H-G%FNiwjuG0dhLb+*dZ0j`z7o7^#?
z<S+i!V*O+8ZsNoisHP-wn-X3(H+i+uc8wlqKca(r*qaRfgyPd#aenRaxhR$gm<W4(
zex2eyQr=aV5`=qeFDVQ&FUqzuA=Gxo7{FZ25J>7bgU3c5*k>`aI#TiWoz!bl%my`c
zTrVz8Z?II#(Oq06cDbq6>2q+IlPTmY>XDjFlN8id61vj7VBVBfnw6eE<{W?nD^Gk(
z5t+<dVO^L?o18!M6%G!QbV9c&r`Kd8U|Y{kqIVH`4=Y%5X_ExwA?!$fC&MYyGulOk
zy`Uo|n*$8(bZUi7v52tjIP+oDZ?1O*-QMEPrp6d2;Tb2iN0A_xAY}>9FvHNSP#K0b
zl`X)dWWrS{8eZ7;qPC`1T~X4sD50ZmI2A^>a^hgpWGU?EIN>k?+THyj9>Glk8J1BF
z+P81EJp-n6p)?pkS$IsFL}A9)>v+>j$+L4g!7ckg;Rg$5aWqTaf=dwii{~uP)cu)l
zEU>~OU+Uir_v8unq?_Hl_mIAA=ofwSrk{Vsx;S|EP`;XX7(O@5s2YE@tLc{y)pzrj
zWIC$H--iD0*VS)<@L?61_ml&j-qSbpg0yG!g1&7mysyt|qtdy6OjW}Bg!37Tb#3IB
zYPvM^!X7kAQ;aet8{(c)%%gsI5%z_D1jG0e7=aFhFp)@XmMyg*dsJ@_YgEfZnQSUa
zl%jj4lx1FN8;u#M28bCC0<zMCc`(`PIy$cq*|?%s2Ln5C+972hWYMpNr|s4=oyx|}
z<c1;z@V*QmpgC$PLlMLB{9;4ShT0qv?*TbG!@!RwV-Lf2jK*Y#p7#8{FdMs1oOg)_
zW;0MG8ZAV_6C^VA+f5l?x(}61hFS4pAmc$d2bQid=?&lj03e*63_!LYsBK9O-oU?z
z$?J}CMVeYIL|i<8p70yYq%*v3TTt){!`j5m3uR_wVMZBkS+Oxdjzl}K3H#w(E6tK~
zDj~+J>DjsZKX~h?y*j*+lfwe0?K9x*OPkZ{Vs0@fED0q!wB~?1zz3p^W7TF>BHDGT
z>z#g>KnHkdCT?wZa%TI=JHj!^1Q8fX5l*6^iFFrHI#FX5ZC^B`CEOcHBfXB|aT=za
zH5gb;78BpF1txq0{Ci9Baf&qd(0HY_Tn6o?7*>^SfMiLC4-4X&u`zTdJ}b${imqJ>
zQaWcUM8Rbj4ur`pK=`m_=QhD7w}Svvbr#{$oCORT06C-K1f{nCz`SM_5Xv~r84S`?
z7j}kefS3RbUGZ;Cb+(*MlK9ZSh6T8#C3E?m+w``hoM;wW+5IR3EwFAS$y&z^Ynv2e
zRof)~ON@Uqj>$C_m#3`!)bTNOyHZXaCP<)cT`FK?L}~Sg1Jbl04$GjGB9{bOV}{71
zc)*zgP~nkaf33r`Z#+OSGTIb6q$r1%0bVPl1-5Ecewe2}#4!p8ba8AOXUY5ktHUbR
zbpRQ)SP+W@IUT0C^->}Mu;jNmb3u{_H`L^yCb4oOaJmLNA8x9(V|H9H>W4CkMsc64
z>vG1fb=0H3(oVsaXYPD*R4~ie&pOIao9hbjV-SiGd*{n8W4xV3_eivXme8llN#2(f
zWzZ-lB^E~q%twI-B{=>Mn$b_lMs>XI^qi3j0VOG(-<*Gz-O98HsDp3RG!B@u9Ygsd
z)kqUItI;0kif^d1{j_E*=3^Z<D_ivx$s1f5ZX*Fk^%}8dIR7+_hZB@x0_2oFS-JU=
zvW(e`N~T4}LIy%2ljRSkT&8QFn95=@An6%Xt?4q;%H57AC?dJ4jaa(}5J9YDnj<xp
zlLAaM75VVeN~2Y?QE<Wm+ZbbtZqU64t-W~8>!npF_ApU;)HzCIw96L-vi_$jk$re+
zjPa8ff+%*wXDtWmpGF{ZPM5QZMExq6$k>LZ?7GA&Dx(8vRL18Ed@Z-@7q+~roPwn@
zwW5y9hS!n#Ig1SajvdoGCvQ!iypD6+8>YN-m}Sh&*@QkTh#9!sXy1PB5yhax9M|pz
zq&-#adgNYYs7#Ng7CkvN9Ull&kvENIgsrv^R~#l+QjR)46yi29NrR5PMHnyn>X>Qz
zrYNrjne%D0gtsZp-e1h^&&1q}RoslcO_59Sz!#xyfZP|O_ZF8-?HHUnjyH|dH4^ea
z8IGr&c8yqc?F1a~DdaC{D%rACuX=Tz;#_aolT;THr(omT+>%#^#JO`3O5Fqe>A6f1
zLOd9d{qSvI41?$_JO9iXmElja)6T}46p0l$lR7rB0wr%5V5_1q4T>1*AX^Ee5;1Kq
zOv|4_0j&7yxQw%}vtrdv{B4wD<wBbl)-;@{N91NlV<W*;9+4Xyjg78l>Jhoo(b!!1
z$Psxa2^ECL$zT9Iwx!A<$w}v~#YEt@2_~?)`-5!o7a#tM4>#w-ie6?G5-WMJdX<s`
zMwOA43QvLjm~uYWv*fv)oGnJugf+V?xvc7kWX&cVn<Z{av=D_nK6e@xt+EhS?78fR
zW=X@?vNpV($EjWHLBt207^6CVn_ku)vuz#fCvwcL;JjkZ@)z6vi|tNlyF@HA@?0UX
zBEw~`Jxd01BMAsook45%=j6X=a>K?$<&#8q#m<Ee*$*+Fb=iu9Ansp;X<!G3T3%ju
zD9`$8IiT(S*nM%dx95b8G9_&W)3){k6m@~@v?Y`s%hTM~I{SsD3--Oxz;a}gV3J#p
z_hp2dQAj`xJ1B}$%8W!VlVXjPQ@Q34sl6$N+}pqkw_500MMg00liCCD+_y9cS^I*~
zDxm{9wb(V8ttm4i+Sx2Ir0EVP22Hp^sn2)6p@{k8UmHp(gswja7^i<}kL_KFC~n4G
zNvO22D{)jvlF6uudmpA@HBz|L?keakZ`LzfV)TFYdx0_e@9-)QlQhd2_!Q|Vua!}3
ziQVGLs-KqaT(&d9?3(M(=dvzmWL3Ch18OId5;P`s;82lz(e)vWI8H6_aK;%$FC_PS
zOYDz_AAsG8QTZpxZs)@4W`a@PjhVRRUmUjy$K^O6vvFJ@)H;q!MbaWCG<>Z>)t%#p
zCA`-y;T$q5K%VA7R_V`kB`FFD1|KCxaW=tV+dPmzErU&S92U=hfQ4SBj&kX&tkyDP
z;2>_~KCQW}SqHcCY)qFU{@dKAQCImm;fKX#p8Pv;OEMXhTrYv!W9FtII`TC?W@G_n
zLRcGNz?|Xokp^xQp~GCA<s%Ku5TT<}i1THFSx&u<uZm*PG=fUr^0CzS@edPCBfW7j
zjeN~NGNqTr(wI)^4Pt5BhSDqJO*D;lGABy^OyXXo%fC(hD4UFCA#tg4%g7ct+3Wr<
zx6Doob3*|V<1FLH@*iRFZ?t>H+(yn(wYww#YL@YvS|0%mD!7S69G6I&6zZfm^wT*?
zJJD$v%_aq6g^wZw9+;$=n1oUzV=n0@)#%P=#>e?bL&!-km#C8)P2tE~Nz5Bp&;sm5
z*v2gQ!dhm7V)fxiTVF&(CQB1~X5YaYV?;$sa5fWVxtOBr(=wYrTE7EinRUlemB@46
zONajH+-V75c5g{g3dBdCs)Jls-}$2{8j9j!CJv=4eG*KHoiXo*d&@v?z?D?ZPna{2
zD#~Eb<?Hjq;S5=+DgqfzC9Y0s+?P9ud9|01*96DAD7ch!PCUsd3^W;p(*3m+xural
zlL~A>>Q(1TO=TjnL!-I(R+0mY@53*hsLAtN0MP8DS>9}?#tkM9?<D3wWBZ5?C;kWJ
zGUwnvk?jkM@qAFhn#FTKA0?J!@u|xh<GOenZ-mH-x}QVFKTZ)!S_kdsTN9qWEE{5@
zoQL@%KZvHV1gtn=5*J)F4mBy@P_ckbbjv2oQ9o3as_qnH@ov=-vnG=K17?skb8LgF
zo$CUv<=)(4PMz=}yc}StD#-a=uLF5LFT%p4!Oh7EOV1<R{9Pwm-i3Z*5D_;)vV;gU
z8!tX(7nXsCu_g?&NlmE^*7K<>TA;;=O0&hbZW;8%y1&F?n1^=@rNVI%48kiC4e4jt
z*Wc6NH`cb|kCFOy9{7M?4Z{cnWS(d6=K{BKTAM(!LnQ$=Uo#A`Y|ZeSX=`R)G<h}~
zQJzhs%8$+J{(-qVB;IdFC5kVSCl15IP<<R{T7#oRjC3N(8FgY9IdqYd91IsBUaw2&
zU|^YV7_OT+0~=xgR(^+c*1rR~p5TwkoznGZL(k2#QkmknJ4W6$e?7u3N{$(ahD}<+
zPR^i3!<vlybj`*A8!*HZ8Zy*6Pvg7|&$={qTqifF?#mnHm?P8!oC19JMTuLsg|)em
zi`9vyBvaD8xoIEfNH#AekhDrJ_@U;1{&Pek--SPHK1Hg=G<EFL#~*i&wqXOp`?M&h
zm{dV=fcpm7Wf0hAM?5l>A=BE<(%B?;HH`+lrL$Z_<;OUeQNFKbjh04~kgM~7Rx7o7
z15(JVVGD%dikDXC?fId%`MKAw@L3`jy>qDdD%nXBM60~QRWTDu@5_7f87WRA1HI*q
zMR~MpGNTm;eL6W8QbSNDbpU}d>J2CTAfHY{z_F4sTpp9%lRfvjcDbOHPL(Ruq&J_^
z9$BBv(jHYPwg+QOat?d}MJuL&I~TF!Li1IieVwRpZp%gioMGXpDxc-j=?7x}OF`IW
zB%QpkwS<J1D6&rKN%1y@lVXNBAID2+5Tzk4M!%2`K{a54T&K0-OODR4`QjqV6Bm{$
z3Nnr)OZy;hZ1z}Y=!mL6y)&w0on&>A_)$9cNwCvtTfCN>d-?jK&Mr)l+Re`4?4N(4
znuDoAs2rcvnpu?+YVIqDyEF4D;y!=UE6LnEXJs=7lyvgLo3>sX1?sOi^~>|2soX}T
zGI5*>is_abl8N2n`DOg(zQb}4(Z+rTvQSk%agtCM$t9ABa!jZA3_KVQv94h;%}4}r
z72aR5&W>WfWHCAv_jZSE8_rhP7CTa01sV}4$>Mq)32tXh#@&9oVv>v!j-BU99KsZ)
zv^4~jE>4f;+Tk<Muu2S4ijZ)?&dR+Q&bR3p-3=*_9ELAi%0&jx>GH@+<lJZZ=sLjg
z$pI$Jn4lG3os{Pc)ROkp#lH-&en-e(NR-Rc^UHcGOn``G7Vb(FKJi5~O}JNK1f8W)
zq<(A8?`j@%`Q!`Yc^J7}?x1!$lC0K5u&9$oAExS+r?R(<0zWdoP>F2eC_#liOfm+$
zH!f|_EwJHAVJoN_x8cZB`R=@FSOu$@X*1v|pDP`gM<7YvFmIPQ$0oI+#cEZIB8eF<
z7Y@c7P=dzU0XZle;PW1iHW=`{JXhbK%fn!6G>Jxd#o#`*Pjb;kJcPk)ts~mikLN26
zP|A@LjzU;)usDuX?<?Y0V6gq`vFrhpNO*O}vs@JEa*;hbRAw9I@fsG!`i#!pMCSQG
zbWP%lx=9CZiy}K;wTMEN)UF3<1{GY<^6#^=i<{HK*6;JI)QW$?;HR+hg0^5@ixUNg
zvm~BGeX;6ThDn#N&CDSi!1=_Nv1jD`oH$(=)#8?Uq~YmNG8HA0i2P%<iN@SGX*rUi
zz1z<e0{LKi_Zv@Cp5bDzC1WE<%oPi*b`o=wcZX92eeKS4C(;Dar$1%tvIKgquR+LC
z&5vT`GN=~bCo*@VNfunei3rd-i{x!;E&sa*{e$xFH|kA+sF1Rw=~0k_k2+h&dhbGK
zaKsN8BS7~Fh4jOtfqJd8VSH-s_-PO1lMQ8i<%z8q=5E$_(pWJ_!OawdALI^dQZVK8
zlFtf$`h|(3K6O>K#Vr?m&KUKmknP3e)EZgE!g*#vE7;w~y?1bI`E3%WAv?R89EPz7
z>C`zB+U1_-mGmS939$=+8gxhYD+Gji3rCW)h9~9{Gj;*6CF)f|M`JRtF-2_qL4<;X
zkPwwUKf?13Mx2!Db|AA3I`W>!2{{IbF@_4l`qUhVt1uZ7(@duWRk6z?pC<KYTR~PC
zxUoLMISV2RCvvUNLL3$YuLb~_II>}Qb`Iws{FnNRoke{FZMazUDx)4jKS0z>r(yll
zN88n=7?<IeVH^QzjOR~us-PJQg1Hn`Mj8(<#7j!!krfoDI58CdLlKqW;9bBI7owDY
z!C|WDfJm1n+zZpLIw#}NG_#OQA*q8D0i6Rvp*Cjd^j17H0S^+6w8uS>2pgw(;=Kr9
zJ)Myl9u8Pu2VpfznI2()bx0riSA_H~BC*NR0}x8*#(@wO&F41};G$6`LA3#A!@!*r
zMdt>WPR=OA8^r_SyLm!7>|E#Q`4>k*iK7wE+!)Sk62wGn1eAi^U3(PAwU!FWY;9(g
z>`X=zV6dopsKteYg53DiWrTFhhdEr^B|WF0g7)yt{Xy02vfSUV;H$PP-7___2r2Jx
z$xBKyof|fahtJ6{^P?c1q(e*zX9l2I(XGZn+rlNRkuEclhBIQ_6=?RLjCi=`1QdC1
zKO77KdZA+_DBDC@Ls8(aSWRQ@(!Higm1#PGZCA7hoPphsm^YB-m^1U9$Cr|cms<n6
z@8JTbJ32dXBqd2!{Uc^4J_Lj*!5V!vLe{;!e06VbB3Oz1H?u%il%Pul5gbz!vFzgu
zV};@5MKcXhL^LIuH5aipB1_t;vM0Kcz-I)#uu^ZE7wvd4X*OMu8Sm;efGysD`pB~F
zvnDvUl4~aZo85Cx2LMGEpB_ClH(4&JS4syce-x*E>8_{UvQ)NE=^85YeFx5KZr){7
z9q}rZpDew?+^Ip&&Dc#DW>DtM#<(w7YdEPn%TDIaoOEvFiwtc;J9Vo1^fY;QTSa}_
z_UgpD+n^s{W_mx(vuv_!tGzjx$Gw5+O@mNhX(7H>Nh(!aT|a-txS_P!1J_j%-CP6N
z-GubEi$T1a1n)9jermY7Mq%nSyow-RA21l)ye(fe+1wxsTm{+8H!9r6C!4a^Z;fKU
z-JWdb7Fq4i$R?Wo>a9R9QG;u@4-igDo#QQ6<y3+c+qO(}J3DtgPR2;6x4|MqxRVQ(
zsdfdp#$a<E;{s^8x}7#^w|apU$>Gx4(#7+i1Mupxu>E>!rHx;8a>kb>mVdqd>ebH4
ztM2yE-of^9ce{|>o(*rX8;mLG7wdh^QdQ9x=j`;LEz)Oqe<;|f-<d;1^R*%|E%O#o
zcYv>g$H2_!%DE7HG;GOLgX|N^W{kACwma`QCY?K}&8X|F(MB%LTKZxx8#_9_y*kA3
zMH?ZK0V1cv{gCl%F{5rT3CC)qwIr)MAee&7$IJwi^8xup35F#NbCCF8L0a?EX-PbH
zAePQ*P+Am6KL-m_GxgerG`kCQ-oUo8fY8sx*wKzxC<bwi)CNut22E29J*~sNhIVJt
zHv1XfeCk{eq)&3%^ox8LMaLnm)~ic<8JLYwdv(o!PK?Xd&F7`)jP*&*P3@GFxvrVr
zX}`>|jW6!RAkKKeF2zZB7DfcvE^b9|S61hoMQ%VTtEB<TPs;f=>@u-r7@@{6c!?3X
zB&f<AY+g6>I4f>pe@+*)8@P#m7^TMz+{H?E(LbmE7~-LU?^unG?oE8hL_F27Zs9s+
zyNsEk-pq9@=Xl|=x0|?*QCF?=-&_LdmtHVLq|v<n^#a5B<n4kDUo-S18C28DAQ-2X
z#h?ZBZcs1h{y89DAbm#YpQ`;(S`VXRgrVW;?VB{QcdLS6+_J|1_H)E=KBF13ui3cs
zcXeBJdmd!N`HWC(R4yN$2MNmNz=K>!pAq`!!-MWtZ$`MiJrA<sd`2^5-`U<34@wam
zH;WdQ$8rwTCw?Z#s{yPFQ#-yD4a$p8e+_!sT^hVF@*=*-yZtN(piiFIEtC2vXUpvi
z?k$U|OUI7tw@Hv{Wr#kOJxI|8j{N&MfH#Mf<pA+XFbpnyIM#4REI8fRJ<A`~xlrzw
zfgcuCr=cBGOG4_#)H;X~Ks=aP0Zsb`*SX;TG7w!m#$I0nKfbHQ9`)x%Wc@!rk-5<T
zswr$ZNzXq466*(wd%0Bh0jW#q`Bug>IZ&S`g%#I$Dl8zRy+uPq0=$DXaJlKBXf5;E
z>2sj|7&|?uBf9&Yo{=|)o!$ZTc`gyfgc<h|9R$5C^~`8^?k?YSd#^Jln34A?p6i7F
zp=jZH*<vZNcQA>VIIaw*y{r-m3@a!T4epX@3lZI3Bya%z!KhJ*0cP6cDpIVG13qzD
z)Nra~hz~%9^N<~KpgvDhoJn@LlQe{RqYaRFmw%ndwndQe=dWxx{YTipP<rEpqD7xN
zb#F#7#LV(^cDZT0o3qA02xsZoCYX&6v3JQL6b0UXtIAX0A7RhBAqAEmaLacz>rnhL
z>F;CgPKxyAu|4I9?@zK%8Tw3(8+tim-r4-o!LMQ7>SnVi5I^w)@Qy^putK=WOrU`g
zIhEW=7T$_ggd5simk<H`C_Y2wEScFN_393>h<rJiFCH1>r-w=I*WKX~6PwQ!lLYYd
z<ml9O?b3FKTj|`9E+9Wov=`$S;b8b&;HC>PW`zL;ONj2|TG;HE^PVOJ^0V7Bsn>Ue
zX^Pk}M<jCuy0QQ`1zdlUad1p26#<7mma7I_jFiJ(x~G=4y#&iaLDWR{n>k>Pa}xiA
z1Lhdbn(}I$i}FT8`-3TP9F^}MM1}JQyQr|}cn-G}C3O5pPy^kVjz3vN&>!cD!y@3h
z+;fzW@SjAPWK;P^P$yY43DT_kHRrjsAb)nEGS82h&YYr2=EZ7Y?smf*0FU}{JHufM
z&}S@9SIf~fG9x}~aE=%)qH}&)jr44K(MX8?T%wQ`2uiZq_!oY7D_7|<cz;OpvIl6v
zE<ddanThm5b^fd*mUeF)GN=^bADGBwgiWc89lVqb@uwxTTL&5{1^9<1Ga6x2GGiZ}
zKRubvBV<n%%s(`-sX;cSHytMEPfKzf0BmmCrv>g0Nodyi8gHFgg@cn=UebS3LYvzL
zYJvL$6WUChry(@k74}a@XtxcRX2bbIk`_mVYox=#qE?W#KOHTx!o7=S=Rr~yxX+lf
zOsOggv&LD^v&>Zm--)2L2EA5!lykSvCnm`jr8pjQiYSZ@XeD1)d7_5!N7B8`La7BZ
z`)C)|^f1Jk!#7xza$KY^>NWbMeh>{~guAXpw(DX{5ML4Pb54ly!`}8A@6FNSi~U!7
z-iyPd*V`vB@g`S>MA9E-=aljg7cIiHGUlj&7d}wiHQj_s+&+q29Jry=PbnYW7$)%)
zGu?%mxet4eiR%2QzcuE}J?f_?UpN{T<{=9%f?<ro#Gozcp1P*<o=-FjnIuCPe3p%$
ztpK2YuzVKBXTx9_V6BW-&M-hq7RSSMWpT^=pqgX9_s&O!E&-#E;lS?t{ZPfZ9aDHP
zj1gap2?B<fFqF~Fx3Z^MwJ2sG%n6ZkU{LUD;NoC`>4xz@C`iH!bz@$IxDMkth|c|}
z7mVmEBh!#h#$!x}nVU}49SQAw8sHEUeUrCfQN%vq7!G3C2rhB(=htJr`pYQ2xec>p
zMQ8tcd3pI4D<C@ol#Fj6mmo<amiewD@KXOBEkGifUKYXH#Z?P{&k}z`%OyJ7dj7@F
zJG<K_+dnT5wO_2SJXwFd{_VE_JbU=eTmN=#_31P3$<wEgzIn2??)|*_%v(h^N1ee!
zkDhsto~%Ff)}DUz%{Px8KQ1Zq-FNW%n{S>x26*2+dc5}Z@oK)*e|xJ}PX^yU?fc)-
zw<rEuzsK+3_xg9i<No6SzWM8`tB=;6;<wY&_3ys@*0ch>U4za%eTokibnM<5^zP~7
z@1D|A(;@i(cX~h!W#RSqn>TyA-B<hHA8jA)?;Stm7r*=h3?_#-qB%2zF!7jslnMSc
zz6f&Dcsj|vQJiKASqu!1^Aje)c<A?lPKeaZL?hp~;zP5AkqO;TaYA|47p!6xH<5!d
z820OD{&@+b>s|np#XW81Ic7BNrv7LQFI6^YVwV2dSrTAU(5+|C`$-a?{+h~Ha&_K<
z4YM~Hna3l3Y!k<G<_6tI-Ko%;1N-i~+e7<rfEJItgM_x)=kk{+@_Fv5^A`JoVHL9k
z=5~5NYH(zMQCOM_l<&Tq8BFE+pmot(c|H#NTd@6)p>WA!G0B|m{kE{-_Jh;O8SH*%
zT{h}MnuM)Rr_zyacX#jmw=ZArAH4K1Va4GNZo%Kb+IxLmviVXLWDU2YvSoU(rNL&<
z4}4rsu(k%_*(3>8PAB28Z)Y;j*z%Qj$h`1JV72f^@iGf#(Dq6fAyE8X;%g=WvS-{p
zBu6J=jrl=32{QztDsWET>(MD}wmR%9j|>G`-jr0{=hPZhzhedzM!+4QAnh1FG}I3~
z6o~@abJ00t5-m|~4|L^BxM`9eddTAJ7{gwWBr!;H=>(r+Ufc-{ISGOeLAy*qB3tr7
zU`+U_7i7J%4e<>RT!c#$I4S(6NI_$e5a|H++a%5~jg3w)g25m7ApzqEpmuOk=75;2
zfsu+KLv;xAzfV8{#kWepY^4EDL`kTWU!ic$dI%qt$NA?eYkM%5KFSR!S;uhlBTT`J
zkp#>lKr%w4$ETDE7PGuY#J_u)$Uy02n58P`5xffelhGJ^zY|BuqbWl-4vWgmXmTT=
zSI%g#LT)tpsAvhLMgr2sh{8#ydOZLwj<c91%?u1W_I;3D2Ap*khMZl-hU9tmO;Va3
zmKftSC2<yz1ma%r9nCmqs_lT(=bvE?99}BA2UcSxq{LxeakE09jp<Y;(}e|gfh0dd
z2prlNck4-}mLG8&7OXPq2XtG-u%$vA9uTEMYzAnJB(4;W^JMsgki&>KQ5E^-QYF%c
z7S6*{3bnpm&JznPk#PW$VRr-)9BQC)%y57E<-y_c$^MS_dhhsn`{iC48{8iN4zHDj
zpw@{trC8AxX(U04D4q%iFu5>-qUDY@ZI^HYmE`Lz+GCD*>7L2{o}jSM7X#ElXS@*3
zWyGE1lij_eqb?qz4h}6r2S{m;84Q8srJxoL?mEyQGeKAp+?^!gEJ!t!57V7wInt+R
zRkV*3n+8CRB)-vf^6*)R%h*)~`5&{xa-s~(;a>JO!IyQOS7%e2n9J1O5=H@I4UmZ`
z$`d4F;vX_qlGY{|g&Eg_({qL)`>CHujffz8!JQ;vxT^G6!U5B9JVL?LPbC5R^l75m
zmCZ=aFyf5T+^aoI8DO!Z%Z~kM<H8LAnZW@jH78s|<Ot|7+3KCfWB<2Fz=-B&z(`0o
zg*iE!;L2Ag-W;(VymgXVd6S5h8jMufbWD(KhQk?}DEOp002aDWTA(fwyfcK391u9d
zk1z8fe2=;d<oae9pi(f>Y3chhMdXgI(X{kTW)^A&spEVji&$I?$hu8a1AHHb?_g`d
z8fM|ZFcLpK_b9Hr-^bMOWz@QjX<>!g5RH$4C52bU2vRm;JUfpkFbZIx@R!alO47hX
z3y6>_xgu)2Zpi)EEVv5?j!B;H9qpaGJv#7y+<x^o&+!Drx>g18%VU`FzMu5H?Kk^Q
z1!tA!=GG-iV+?G{^-9Va4$30{%q#k2180F^%=gu7(pHL`Z7>;b7<*s<P)WlAOEnN$
z*3=}DD*gf#9>o^BVZLVa@;xWkK<{9MzutTOe8oI*>7*QEu$PBdu$BRH;aOCU5vk5S
zWL8D9>#bIg9kyas-WQ>hD=D@4?A_okWnj$0!of2~4eKZg?H86x(X&3R!nRSke*m;;
zqfqID-Fi92Fb&19H5$T*QXJU4PJOjw^5KU<>jNcRvLWoc2kZpdONQH%*iX7Oo}+>f
zUPWgUSnivPJBwt~8xO4f)FvPDbJ7QHExRD9RIvQA3THDRvp|oHkoh_<=P>b9D~;=V
zT+|&~gRff_G>1XITf-+5eJi$*;})~<3DuFx9j}5<ST{K}+=6wj1s>RBh<e5SLD$+}
zi(-~VkpvBvgQjMo*^W9c;vFOOgw*Aj$=uA>I7{s5>wM7twll{KS5lwIc851Z?72s>
z9D1un?wIJ{2CHjAXQ1iGmf9NS{_xVjPI0%m5H+^CiGrgxrI>=@;%WC1^-Fpmj(g})
zz1)1_Q4cg_)+2==-sFv_XbFq!^|IbU9O2#U?DF2#bb&7^D_AS>35Xdv`Hdt#>v90T
zq%d<~FT~>zRL;V)Njyna%O=t=*}D6pg-L_tB2>wS3ocR1jVAf34n?-`r^P`aGxE(5
z4F%IV9)B<u(C<zXGZ{DEQeWG>s9*tnf+Dpq%bIlL!z@L`%Gj90|796k&G$%~!?|ER
zzmIvAvp{?Ioh9*QM5&$dZl@W#(%Yh|3OO}snPJIBW!<wSc-<dO=pc8p(n}Z?r>C<h
z-AevmSYV|qQKJLTTjW_ux?COK+97tewo;e0MR#ZUank9O(^NM?g{X+!Q-0|HpcL})
zEFOiYIi)}uQ;{mC*ZJZ_&a!GuMg*TW+n{t=iU+x;CEgYcyifHEWD#u?T#nu4NQ$NW
z5vH6?%69BP1A@!L%i`F9Cy|(uamO5=9Wb{&%rG?~YHm^CZUKE55BmVs>81mZn<xRh
z!OBc{-y^fIRP@q*=96`XsKy;&d~fXcQQ0;Qv%ts*HxuAy7CHA0PHr`!@Yk6DE6yHO
zHLqYLI3>kqD<CbvBzhMCqg@FjpzW~lz;MKdJ4MHvy`$L$@a+t~k26-y!AzofhZkiY
zowcd+#NT{f&H=||vF1`7fh7FlM!WrTd;ehe;TEqOl%VR=BS|u;izYP3p}g3B`)YPN
z-i|m$>Hv0jxuiu!d;sEcFH31uu=8Rlebl0ZJY6_2>VOtvgGZ;A{3h_QOi<?!PWuW|
zfZTw9jP!wzZld&_q*%9$`)FfTAJ=Ilx=fYptPPtxZXX5el*&PL5hgL6^j($m-ocOi
zM~4TmiNzJJ&|G^T3y5`ZBZNRa`6}p5l-ZjS-O4W6)Sg?h<5rTjB5GiO$rc+zbaxI9
zUI10oqY{eF)3e-^m5s%&RoR5T8Y8o#a{$?6^G-f)_+ezLOw`37Euk@x1>c&<<!~Jl
zmy>WA0XMr=2(HMQDR-l=_tW<4H?K;sPfudHWTYELIsgY3c-5qCjO7%pXEN=<Avf9@
zM&45DJ)qmgXIU}{9(XH3)?48Pw2THC&sU^uuJ=~MyzO19i_bKkBt5w)BL0tdwqgQ&
zuI`!r3CNv(#@SQ}oJ7>qU33j}Tm`VP43njfJ@q!d#fS~DpRFx!G`I4}BR>s-u0Kp;
z7x~9~d*1e|<HHi<KkuO>b}-<{f3Ci9Ii2{<eazKIesmEJqseG%9dCEl4-gS;h%CR?
zw=(j_cicpJn!LN?CMIMBcE^n{i<{QSqgytT1y^Bq$Bmo?8F~DWM&RZxHCz><tjh7E
z<CE=!-R+~@Ql>QRx>CkicT<@!Ql=?12i7K9yp#;j=#(9M`^SeX`+GZ7`MYnw`|jD=
zci*jgExA92x8BZotLjd;U1>Qn+tr@5FNR9ci9O&g$64Q7TU~v$ytcHyy1J(O@aFJ%
z|EJ}(VjtY;G6b--@Lzv@KFtpt9>NsWzOW~+^n-D_qO1{C`taX*HX1HprNiYgx_KL`
z@Ok?5G5%fq=E<u4mp+faS^KZG$7}0PpFH_y{SlN~Uw!=a$$xpP^BZRMX98nSJnz3I
zr;{j~)Rdd@{xkhNhsk}GX4fFuod-eYU5$nyUc*D}&2o8pxqSI(IZn=2fD?VU^3(CF
zm6ODeQe+s5p4hx^F0L)F5+5dr;fUNl&Vd7LF8()EIXXN%`EMd8q^r|7eureWxKdHW
zKTW%7(o5nv`){N})5BafwvmD3a&{iWmH^#f1lhb7qaFX|;v^d^eT$`^uejs<izCTr
z%KCTle#17Vt^cQwzR9iswMT2~f35!y@wub*PbvowwM3hXC}gD9Q9Mq=beWo3+=A*M
zuSqIdS&wcR#(0EE7vb1E1j%A^an)M?sO}q*X&+kJn@UO~#4;$uE$M;`JdB266fBQo
zG?xBN0It{&E1M9FlWIZi`WiQ6S>NXy{0LlX%K8ThofC!MMh2L=|F4y-|Hpr={}1u`
zu=~Fvr#Z<0f9>kG{?x30!2QZx+Q2pb%{Naf*FSvR^^e}JApbv^OY2iUfAaM|W&V5b
z&X;?)ZKIz5KYIM+X@35{d9?oYFaG}_J}VCwyodAs06=fwbta1kUTgjTt$p2DZ+pE-
z?_C^w=YD!l-ldo5@$cbV%Q2r+^?{E$R31`M?-Z&9=8gm^L|!i#4$}@f%0%AQrnkn{
z3+s76=ud}05SY=qp;-WmUh#F%7dsDazUOw*^M_~fDmx#MQK1f2fbhcT8T`R-p7+K-
zJMVZ$%N_5<@{48fDDDq~1V+BP`nc`wFvuSmB)U?@lLXrW<ZLVWDFgDnCu^<s_OrG1
z^`*7PkC&x|mqCQ#Rl?sjR&)KN-i2vzLZL_OuI(l0<Cv!CclH)K_<GrU?MLXYik<ad
z_l{v2l56Vh)3&z_h>nMZ%`x6k;jM`3ns3ZH$Wk=%*`W=?FyKrPFF~iq{m6TR7p_5{
zyrtyw@|)~jLHb9Wyi3pHF*>U5hUn>YI>8&RU9#qYwvV%9(#s|ZOl0dHyW7VPpl==T
z*asT$c7||P=y*HZ9R=?1el+o63^)XZvNG4kNeb}BNze;Za`zGHut>u=FLDGBx{Czb
z2`({Zf_U~u-X-*(NlsjeDXIY);X!)@GoXm~P}J=L0y~`~eF_Tm1JXZP+9eo;qd)1X
z*?mF2$le;8f|)7wU?KR!Wtl7lMqL6_UZ&`5oWxh*2#+8-IL*k1CzFvkjQzehfC)tx
z!2wx0CFn$pFqHGNudY}hD#Y^VKl<C3wD4ABN$U4p{7V@(7GINU>+<)p{QcGxUy{$)
z)Bf6>Spz7m%P@HN?<0@?uB~h6{8^{RkH6#B-#&%ETdT|8J$lZ6pFVesKcZsat#R@1
zzLCG*%HQw4bBjNAi+yJmvoOQNXvfYcBvN!2K_nVAox>?HVvkswQ(wItgzQ#_SC<s0
z2m#X3(({hv4lbcb>q|t8PaiLxhCmM2DI6_<KVG5{LEyE%MfQsYT8~Q@F~Y+b7(g&&
zuq7*KuAh~KFZ;m&I_>>^Pu-3G&kx<5?!uR0)EiFvfw!pT54!UPuA(K9F05I91k7dm
zd~u<+28u1y%4n$SNmmM|Q>(I<KNhPig@~P2Ms*>cR&boao-w7&BnyYs_mz3i+R8)k
zg}N#N?vlmm+QbYbilZggad_y`8TJetUG|{rf;@%e-tZpGOBaoOTUpxgX5K^i)A8^j
ze1|{n4OJS=x~Oz|o`li6>hkj+>jH^H-f`e3JuP<NNZ$q55`TgWMag~xmatmU<P1EC
z`WxQy{{QZEPr9$Se?mYeKgj~(Lk7r6AQo^e+(b8}23uxy9VsMz=y+tL$rf)9p)+mo
z-wTMN9+iilY%JWHL=yfg1k~KaUbjMT(_7u}LhrfP`ro&$wYK;Cx%cWNExhmF?)=Z*
zNq1-O)vMz+l==E=0(y_ewdvgl=u2C$pa0wvJXBQmKz92Dn!g7~Xkq20EyUIrn;x2%
zdiU>p1PPv@^>7RRc066I&28Qjyf$bGTYA3$|6fp*49Yha-sh&!cvI(QaN6umpSrMQ
z(#mE@CX#o?pVxosm^r0+Te!z81pz6nA#vX$v|%;I83Uj<D|&q61U7pRdl)1wx_g4d
zP1WS;FW!BxW#*sY4$rz6#fFNeZEwk21ITLbODWUz8%G9()qG>84dQr0Ei7;FWSKsv
z0mea?*6X!9>b29e_YRAqY0Z*r1qF^8GA|8RC0hsB579QccCE&P0a=8FJg*D)fOdDT
zdlcX%(NXYNTo8*U)i@qrN$Mm~ApznBK@o5KNpVh)PB_mJyuff~o{ybMQFKkSC9<Jr
zM3FoHIoj638A7m2p;5fam;k~2a7O{nE!Fon?n_;m63XP%ojiTqVx~dQ5wAf9D#NFg
z<9tvS1(mQPEokm*!Fk)IuhM!*VC@p-wkgY$nV0n(scgeMBh&OvvQX!z*kKCE`1RKt
z7T+8A!!#&zHnf4Wc-jFPx1lMm<EH^sq1KUiL~{-2n&2X&I3yk#29muYLc8YRB2k~b
z;U4PKT;LfqOA0)JCm*PY=eUe=FQQP0N0b0h)aN0c8K?~mhLQxvBo)tmeLT3p7{j3#
zgp`j={4O|<0)|MDLk@SN43IkV<5F-quwJNCt4mdCR;r(zsr5oDk{9R0hwxl4*!&B#
zXmiV(*E9Ud_*W(qn_Jw~96#ePh0R(sKiyp@!UQEfh2KI<s)z98@*D%jw2(}g6p?`t
z2RV;pa)}eJfRkzGUX%7P&=O)%1vZ6wrRu#T)V`t;T}exJCb|#8!%#r2-~!IJ6r!lj
z^?5=`cQT~5b>cUDqyZYi0%0bpJu%i1S2n?atWZa10Y+zmsuY$3&B_ND)CvhV9*fUe
z5(of1Qw!-6J+nXCDeUO_TrN7IzC?Z;NmW@$^kW5A{p|d%j^W*0wo)QOUc4f4fcDl)
ze=K6vzmYhRLf(_WWBqK=#I$+Cy_Ye8X_y;cCM0H<m+G|5-n>%Y#_uyKAg^S3z`11r
zCqIu)dxviiP8Ng_MznZSWQAV_Fe3vQ%Zo7Ti><rjPnIZ77T7orTs*|2Xf##Q5{&Z}
zq6P7N4PaCHA$-38xPhdF^^igod|t9hd;6I;@-YS*^WU;oQ(&pXj*z=lLlitn6=4&R
zYll|ymC~ET5Ah|MVRxkBC7D5cXA>XjISbg2z$|4iNPGU+fgu%(OBbkfLIIP;X)x)>
zOBUCWI(&VPjGefZEtK$jA7S)WwW_5Ou5IEXu=9*C+z)ev5F_5UMQbaemo8B;5=lL_
zHb<6`CH@#=_X6F}vrs98N$*VIs4iovh4N7PjDN@@n8gz_e4GhuJ4s_~m5lTy5S!HU
zJQD{@?`^!3(Sk%b0}9NxEEU$<-nOtSRN^Y)CQp3RI=h5MbS~+brkJ^5%uyMe4q<}Y
zA_A(s=A2oC573OF8{YC2-So*oy{F{dR64rC0tznCo$~;AF)l}6_Gn?4?sC!Sk`*JH
znI$Kw-OQGf9O>sC2}EXxG+QV&_C=-4?nwR}f}T5Vx>8rgS)fF;F!F+yBl6F*2vH>q
zY!svmXRptnA)I}G%F*zI<vi{<c~;N&ka$zH=dk|1qPKHD9?rGDe5|r1X?9#UDKlxw
zU4*`3kQYIjfUAyG>Nr{{(3<`!Qd8t*oeZQyNx<<~DblvSj$zJ`_7aLmdU`FmcI7jb
z4x6-A2tv*l5&&dCo4-&e3NFi~aB0%jf`~ZmpZKTtBA|m0Y+oHOf-V$SfXLTG;8>K;
z^m1U@Sg=k{bY`>;kO+^@k@W33H)Wj|kp{3kKZn08+u{@R173aBdtyVf?$l$=p6Do8
z;0_({J`Lf%&1l>%t8o-r9I@4V*mph`y2n7Fz!C;kr%%NmU_sP)S!WcOSUkDFANv#n
zD`yN_q%56|$191{4y6Jd%Wv4cE56AB*{2H)Ex@-Vp#LP|D0?0643-7%+T`JO?qhg)
zVPblNCO}Mvw8>&APP8C_b3tf8_cDx20efAKPQr20=O|F@zvcM^McgO}m|A%5h!v?h
z9Atw^DLj-G0Rg>4ZZA8U$r_m8UlQ6a&^+n%3R+2j@239xq$P31c;bl3Syk}zbLWS>
zSNjKhT258yZ3!e;5Z-_O!%ccy-mC4SmwTw9+j+Hpd~EH7xT`8cJc~1Qy*~|xU8X)E
z$9sT0JPau^YKLRGf%rWeF#)Fi2*0#D+@94xbtu9%I<)LM@}1n{x*)&cX|+WJOsmpJ
z-q@(KRGW5J9f^P@fOpB%%ejY#qRwC&>hQpi<%#^T-@6mPY0n01HKk-=3n><->|iTu
z0zyt?U&JG=R7RJLG$JV){3+1*J1rr>h>y4l3gS$@)g+~2JaZ2Z>X^PFB-x((k~wIp
z?1w^5ZD)!YtiqYK>NYf+gIB`k?8$tlSs?K+!vJy1SeSlAWGh}BzUMB+rfl$zxSQIw
zb$F2v!J<$&!ja#C=iHR#=!FXF^cGyj<|hjlgQ;UGr94F`&EO1nc=%c(z=Ub^0Aunb
z8D6r)WB<(0$Yd!EX{*U7NH&z=x;Rf9L^mWY=U{@CD_%U7GqMO+V{H;+bWAons<~E?
zX%$wS!?JG9v8FMs8}h44B@i!RTa0jUvT$3*b}PPCKyo9lRwXa-P;mtIaAAyEpo3Yj
zU}jpQJt7qe+IHYe<SSSL|H}0fJeA8<d?8=+;-CR0OS_C0s<+l9rD`1(_bMVt9@A;V
z=p@x+Y24OU*2<D1*E@t!@{BO(JZCxFea6~FexxWXr>}*VkJmRmps*h)(3z}h3eW}A
zG{TTF36oL&@S%4Dt*u1Vpq-T!PFC5FaV(=C;tM@IIhuJSAm}O^lHuGxST8k6DJ{Wz
zh1n$Pd{BLZ8YZ#xA~+?sUUbi*bVC0hnn2OwSzZ3-30t1wDGZa;&`}jD5+te2p~-M(
z%C5&8AA!TIYtoSeq>M^k3ZS};;NZNfSn7@dE+kU6HwkU&7GQ@kg!i@AdIa3dJow6c
z)CS(P0)KGBT2}`{i+}+_xtLCuf?A1S)qvlgA%7}oy;a9bAe`M81J$ruCl2eq;So^U
z;Sstw6}-2SxiqUtYmgNr>XBN1q;JD-NVkple8U*#wdY%6dzsY!-eI=4kO+9PnjSOc
zFfZ-eVnLHG&m_BQp|u|jgDj{MTFWg$EY|ts-qH7m$9u3wlyzJfWrG%veetWb_0_oj
z%wwkd%=>Eb#p{#F)5nV)PjOZI;i6RYZ1(Eb68>6Viy5u;?q3nq>2~qTu-m1<$*i=@
z?h<1Z75JxZvHz*1r1K5S(Kx1-m7z^7$D?dp%8pw}7DRYtb=#$+L`-xeU}%BpleC%S
zi=(~0?%&@Y{13|jyjEeUwl|dC+E^vg4%KQzPL}Rb>)32r1of9?SL%3_f;~@k-VYxd
z{rAI%dA&F4`m_k4)pZ(z;qRIUx5`d1)n+7ZHXV^hT!o*$Wi3_uVTt0?d!mYO@qpSn
z7)Du#)k#B`uP<uDG5}hINDu@IP!^3+)@HE>F>}QF$10JrpkOVvO)_F(1*uq19n&fT
zX-K?XC*R33bF_t`Bx|NjRccqI^Q4i^sKuI*V_RD8QG8Lwv0bb(e(W{j+L;vB$TTxR
zW8D_o$kz=`v&AbX^eQ?>D4NvYFH{nGC7m+>Me6S@-H?IpF{q8=OMyynQ7%7-GdK#P
z@sOWfvr)0FRbN`#U@=T?K+gT)MPOu2yej7$S~`TWx3=;aj^`MpRNq)yvi<XVRwSy-
zDwWDQ(4#VVEvvVsUm4j@@CjqsKZ{VI%?gPAgtXm<hp(lhIg@B6f35v1xvZ*W8dD5c
z%PIIzOT7&+Yt)gHu!s)jtpe{AgeCO)=k;HxE9Mdx>JEdbCG{{mAoL3n)bUoYzI(j3
zzCL*L=xs;pw{ug<4J#vSr|q@eKCo`f1n<_$j_vDZa>5tTNDqLwRNnxw{=VLJF(I+m
zXF<gzLOThZ9#j6_!;1}lc>=SE6W~oOdJ}<YvV74-@m>E6NjieZ+SY)2av$Dw>{5u_
z{&(L#di34XpbEKaEHhwN*|P(Bp;v;PkL~Z7|4i}!<y`W&^Z>5)|6N=A=9~5Py#Mbv
z>uZ1c|9*&1!5{1RWc%d!Mjlxo)!C|-4W|{sM1QEto92==$%3m!g(&?q_21^#XT$gu
z#>XWv22A?1Dcy}Gqpn>dNPhwD^l$AKclf3?%C6epm+&tfM_<1^+54&c=IHQ6_vNd@
z@3&ud>B-*l!k3c>W$eQ@3-34F4zQ}DrhThG^X9jY_71iyT35AqPF{6i?wzzEkQCsQ
z+xGgg_wRf3`Ii<J(%(JJqqFvgeto6#1VC-IB?FZE>F?@%vC5_Ywea4PQ^RW8ZT$7R
zYCkM=;a`@*`}Aijz5P>nckj)~55H^_OTa#C`U$^LxhTK55Ot>cuuNhD=pFolk#Q?(
zQ1`G~>o^^)P}R2qaGC?E$rWqSRF9<Bk1ag?nn%^=iYa{jm>&N+cLd&rOC`Fw^Kphw
z-|;xJvtpV9DlO~W+b;Z0f3_cFaYn0KVnctuhL~7fydxJ$Z^s|@CKTuDYWez_{putb
zpGw+^_pI+IXEtZT<fJq-8b3+=Yc@i+?U~Mktc!WJQI>5@U{p^ZcQF7wCLl&#k@F~x
zlMX|J(my|C0g_~WeyO$6sy-aO<dxRkvvX7ynB=QtOgh~cBcn62AWG!WxNKk6Dn-M4
z)26hs%FsnPeY<~f0$oOT!WFA0n;2PjwJnDUt#FJSXM>gj`;f~E3><=-nIbr@u1S+B
zwQ3})V8Bbqd)o09(MSHP2`X`^MK2hpbS{?K4XW4Go?g9BySDt=Vtb>)_)YOK-k6Xz
z9iJQ#dwR8Z@bcsbZ*Bcs$3WyPh-51S4nSnZn<O=+J^2P*Vh8pv%K2MuZ$5rbz}%vw
zH3*ofN(ZGISY&znEBQYlMVj$6SO!%vbm1}ZddEwzZZ96DEfHzDNqmXNc=+S?jKq2p
z0(c;*JXFT=RWI;gwbb&$gL>YTuBN}#L3p%Y4gsGV2#h&XD&Gc-7?p1C^b5J;%~i31
zI#uw6y0Oin0RAY02gHV}BCyLM(y0g>5aUZyy5O&+tzY2;fwAT{H45YjO!*))<u1d1
zhIe!8Yvvic(OVVqXP07Dn<79!n9G-q4`ecVb*Q!QkNw?~AIvz{)=S<H($=2Za-JYc
z(;T(l@y;hBKWfX?2?HlrB^dvgU)tq<ewTaji|p}Vf1Q70HuwTM;frANo@uZSqe*yn
zo^9A=6;^quB`vFh)u?vbHs~fqY&bG7DYN&EZ1GpVxpPo_iukWv(wL(}&IOM0hY7Ao
zvz2T5qbyzOYj4#5xr#0S!uH(UZ5zo<&4pFjPhsIGTHSlSe*#$Vp8WI8o*{E*BKc``
z4I=+Sji--iT@TQ&iuE9Sj6BjWf7wv=GzB`HD-tY}F4?n2ApBGzw?mca9#+nDxY-in
ze5v;nMda#;Mi5(e;~)m#r+%U&hSTF>qTO^UlulRW%SH=>4y@)@R_^jqAhhUHKgClC
zJ;oA+{rj&K_1B7;VMTHFmgUuDy|nIC=~sZ<ezBLFtTxd}P=khY)p{g*gU@Lhc2C2o
zbSdg*P{1s`&txr?E|<U7%PrOmPyzf|?C_qnnA?lY+7MM#Zh2@T`ZSlx%0q7v<km%s
z0(cs5l%p)>;3_=L<Q^T#74#_X2ez`Ku)eU0KFtCB$yc*cStq<tWnJN!3HnohWa7gL
znrY~v$gv5}^&j)B_pugrelZu$SNdF~&r|l1$~sEfXQ^M)IO@K;Fj)RlH<(-I)V{r#
z%!Ot9KAnBkQmR-y8+WnEF!}49MU<JPOM#T6q9-w-Q*1i~j4i$)woJf3&irvl{*rCJ
zZP^}SV;%2TBoieQE9Qk@fMMOoze-8eE-Oetu%tlKiaVS5c;#YbCH}GDzM_Nhee=4c
zZdD~NtyTMnuS7qAdWUYD@M*b2OPh|#z)grZ7Ej~6{=fW^gvZL``h8Of#;ninOvmzK
zx%%+_<(E#!Hu5#qQC|1gKAEdRWykn0zYOf-zB@3%Y;Js|!z&bpQQ8wj)e41X8F6X-
z@^P0ItyN-_)-VTyFV)Ea35Ct3g+SI<nabPzj`m-9_1Ge6ek<uX15;-0ky6Y{k%*O`
zH3j<93M9dAlORR+yQ(6T`1Z^#U=0FuOAh_h%J)v)Cxuatt+$VLMZ7SGQJXuUOqTSX
zL$2aHFY&a8c*hYBC!>h(3lN+l2nyYmm_EU-fU_r!V*F11?y37O!cc5A=!gcx33?aS
zlqljOkMrsh!qTA}J7ev}<QnHk6hO-FNxT@oxT0VINPIMYizZz(ShTt5EpG5KuP;*A
z)A3*05}rPuF836~d|ms|`gED6C{W1AZr;8PplKIS>Y{>j=~8+xaG!1hY{PR4QOXzF
z8a=7AD?k|z=t6WyuYkHkQu3a-N&O=b3h})~+%camN_k4%?kAaw5iU-#u<v1fok#)`
z`F*4g_L{}$7F?BFPI$p_tg_KKh*A!%lP5qdEBtn8^NBSdEUwC(jg~m1lkGx5N3L}@
zZ&xz&lcakZoWYUV1-jVQ#_+$Qw5sG3ed+7{iWcoy6uv5hb}e)AS~ga39<Z}6^K^V8
zUxh_l#S~ZE5MU(oMyikjuNb&y)D}ZloJesTx27-=a(j1AcyjlZJ0LFeP!^RX!hK;=
zLQV=WM*}dT92(5iFY_F4PPsB&{I<2{y<P48eeVnYEk>ZV1b_wDzoqQ6w6yfEXwjJ8
zTFM?JAi@}7h=}|}9-TE$O02A@NHZffBi^yptkqZ4L?D$dqOio-h7-iZV9k(FN7)oL
zgV@hQ?B5ciP`ZJrqyvFiMD~;(Dsop41<rkI9o%5tv~sLr^Gdoo9%TjE5Jd{OIZRo=
z7EC1<+-7!iFtv1+pC4JW)&_U4Mh(f(a$8&J-bM?wz?tLIUtR7@Wh;-?i)Ja59QqB7
zaH(mq`i)@qo4_*U@4%u3uOLa8X}z)tzqVhh+%$NK<ZFRZp{bBGvDd@mV$;W|NOH<B
zsn~S<mqN==fPs}KatC%FV}RwQ23DhT(3dLBVTG_)x*|%N45GfX5Z+g<8MmMjFDM`}
zQW@Su(cg!T$U&NTJmviSR0mXcOun?uS6d(N%p(oGLonJHNAusx4bN(NQ(0gYO^o=2
zrA+@3h&DI6XB#$2>)w_bk^;%GI#C8a!jNwq<uT|#;~3o{sdM~U<W?Z2sPbum*)1uL
zB-tZ+=t-Z_@v#?2)MS*Y!dBFfbBtd}x-Qf;XO{tGjoFugju^61Rf=K?0vSeUgUOJP
zq*4Wmo*IQ?%&@a8HCCEq$xC3kE~XeEQH%lWFe6F7C9f63)gm|12cP4V1hgUV!>GTk
z4&PGbSM^To8f*Y+ZXOmu3FBQBijn(JeyGdz%gXfKGK#t7N~y=Hob;rmb5;o={#+5W
zAYybp1Q0n4L^hDI+k}?oycMPJq+*o)!<?7#rydY7*xYF7nJK|+GhfDt_*9Aq<Cbv-
zqZnoZbLLc_LhT&HnS{9|wj@V5Svq+B3^CIc-Z7rW7Xd}Q<${}=3;+!<RS2E>n}_@Q
z>Y>Qb9A1XrhC4$Ho6V;*aW*ukh_XwL!l`k}Y2kgH4ty9~WxxjN^x!$&cV49(DG;RH
zu2F{1q|YvvRn1U&)8?FX;4`Vf=cEId4op>pJLL*GVoMKu8wGJg<?w8Z;R>a&8mjvI
zA#VrnNb_w~|4@2wv)Bs#$m?mhIqJU0>-jQZhj@}zBpwlivV&y_tvI?e@9A`983CNT
zwoJ2`W*Re9yi{vet=6)1WCFqH&@{;DDic+-s5Z$R4rfvy*iifBQ2V!oI;*;)fhJDX
z{B)FYGGJFB=gxLxJ&}bxi$e0~bJnV@<G8gZ!fmwn(5cE5Ayyve%H(z%Q8ltVNe<rE
z(`9(oEsXJB0{SD!@_J6oJ8B}i*3fLJ*vU~xnv0%#W+iyxhm$_V$gzp=scp5WQ+3js
z5h28Pq446Smv^&X+vVlP+S{{56l}F&Fn6=Vtva&p6qQYoPTdie)dy{E6&B4_imW<s
z-VL_yF<G*5me1a%S2SPc^fFV&gM|whg_eD`WxW?F1M~s{7qm92<kr#EW!)EdCI|0R
z^;TvbQ9MREG4?6HkwoTeP=7D#o7tm^HEX8HK~0R8SPG-BBrLHZp0R7no#(Q1#I6aF
z&(qjX@kuJuN<U1p>ux{j`PW^H2RfSk{=50T;h08s;9pAa3SX!m{H5|xjdG-PFzS&H
z2dTcPc<N({=ujNru|$d<i6C{3pezPS>1OA+`CGo3*rjMZ!4axoBfozUrusL%?Ax`t
z<EobY(zW=vuBAMQaX&CSj17)oX=zJ-_T8V>CZL2roR)Hk{7OTVpMCdd5n@Kkdb_9B
z8LdtYZZgh7vB#Ok{7lI-IeA3U3QHjO)lc^buV~cOgqxa+ek!D=pD{aeRpbKEYGzvR
zc&ySl{^1Igr9I<<UD8M_Y7ph>dJ=ZH%(TwH`jMW%H`iUVvMXE%|9C<hoaip-1+W%+
zK`Elx37XrP+9_ultNyubo0~|Dj9LTFWdj1weK-?5VH^TTvyo<XX&kDmFrH>LsmH3O
zu&PEiZ64%cQ!yBu`liDXKIB4D%xR%;Ejkq-GcpGpKWf}Dn_W87JL3RdM(aYl(Ex2u
z?SLy8U|w!y(yY?;>9=i3a`gA(!-J(XyB-F(@PLqGF}bTgHx<^IyJF?+MBKzJTF_NE
zU<=Ew8mwEiC`meS&9W;V@$@pR@0wnHr4Z=l6aZ=wmI9!cQ$~?nj5QqGE?M8J!or*m
zRmwJjtI2mNR4zFM0lCFm1Jo|rgyfnbz%APZZW9F9CDoEV!Q)Nsn&iV9(?9EFOH|3`
zHS$Mm-QP2BYIMo0L3Ro&_3?M^<2na?tC(emN>5>5f3{dO2$dRP;gsu)ilm>?QH8Y{
z^4zFGODX=;ecWJFp>qweNWxXsfFhJc)0!c1f$~A|yT-$k;%Z=PkMeJ(k4*|%qvI!)
z<4Z4tU|csoE>J!`e%E+>QoLk*@@D$@q@XoEeo{F;S@(4#R7J|isNOanrLIsiPW^8B
zNOe(btm;|iX!RknYOG2SDH|!jYdlUVUNTB~GkuIw&>EreUd2(dG-}jbHd>}fDhNos
zxJ8+|6$}jvF*oBtMz+|4fr`YMW(t2vmG;(VFqS6Og}dQI0&2**DtOny%J$+0+nG=0
z6w*nTQJ7A$JhZXUU`_H~m|v8RlG&DK49r^k&q38?%izjO1G$Fga&V<&2~@RuW~8*&
zC<{!ZG!hsLrMZ&u{3xxU0{bK>je0pRO0&hrc~Y7yIL?dGTxH&jly-~?IB!L+uUEV*
z&H$*Tl_AZ4>T*jyUb2}Ry{|lE=E}5-yNq2z(MxfwDU^b-6k*>h6sy^KB%D;SijFMx
zr1W(ip%+VA<X*DH+U0F6X*~ig%ZX`7FxQ3C_u%q+dNW?HEYcJs*4?GSihei+J?65q
z9ywa0JPkGKN^~~Fs9Ke1Q3aYJMU}VZYq52hf{=bgg!G#tq<<rX^rs=DKO;i=MTGPl
zA;h{Zn1T{xhcOi?`oeogwCH-(h|xtFqej=Tk)y3mrZN8#W~?mzUhbWAw-0u^7-XPp
zB3HNgW+zU%e8DEykkGPN{r#&}dAaC)=>qT;@fiaNJ1Tg>eYen;UuwHIX$YR^sJE4>
zmM`5<RAQ_q5KN?os>V!AFB?s@hHwIVqpFtay_g!8x7_UZn<_7sZ*un86^pS@SUaa3
zwZ~K9M>e{fQXyw+)u2Lu)(Uz1sP@bh-TXdVFe*05(<gu?ZTbX=*<RfQ$XaSX0c!Cz
zo&Z&$@dT&}A9Mm3qdWm(X<5-fvA#SzOM)}R7%wI7YY|(C?NE+KX~v7A;dM#8p!%sJ
z*%zm-N@}sZ2HdN1)e}dEE8FEA!QHu3*C33bQ?@IX0qExd^h*JhTW;m9?hTNV&9vd3
zk~=1hg3**if>Wa8h+y7V9}se7@R}?K^<J*X^rJz(f^#s)zpUHC^JVJ~1*SBVnKD?4
z)KxcBD9}K1amzari~FkCD6wSK7|V!gO8=|%0n8TY+KvyZ<kW?>AsB(2EA%UwLCv)A
zRUq+#+^{U20~f+n)$BJk%Mi;Yuh)C8WkUpxro&p*NmyUv1HKpLZze}Tt+2#}%kChl
zX>y&Y#t&6r1oTJ`D{+M73O){v@N=&mF>G0t-^uiAWpGtl0PU|TUn;Y#$^y2HR%IdE
zM5(5uZ1>eJ-T73pVt|sV=A}Rj;+usv(L}CTu^1UlM@+XX(@s#VUG7t*tCrgKodr>l
z_`^!;K8`GD2Z0}Bd@(ljyXe4w$cwZs--LpXsfZhsN9*c0+k!oPjK7slUz!2{_y-}V
zM+g!#R7~)nl>fnhd*k$XB)(HSs|NN0$2PGa+LmCc{lXa3r0#R`0$VXJawb!j1=~fC
z;EgX?&W<k{8dsT0i$ChG?m}0VQ~*@z0Xc7~tL7^egSj9={~q(lFQHP`<0Khg8c?7{
zGSM|YWCt(yUv~d-w12YK{r*rq%G%m9%H*_RpD8_f>CvKcfg&=XnUIoYqnE<D%3Qu+
zQHIb6uy(C-a+KUFcAZytd^!v-!gxYfEX6{cd$#lyI*FFQ8T!A2+!6QQRnF^3iCWQM
z(Tvb}T4yyUiE*v+OlyUnpe1y9AIU~~7@nT>di4b+(Ir~4mzE)ZQ2uI?p;L7EyDJ?9
zLi=Rpisb0F>d+zdYmAtQ{DFY!hlw<K!k}A95h3|4+@&ObkH{>44Z14h(jr1z<ccaK
z&V7P#pFya+INs)_QcK`njkOBOC_qTt0&aJuqiGzQvhn~~sSWg~F!9v(_phwct<k^h
zWrL*UgMj^EX06>>M!r@%bo5-ZfJiegg!KXhRb2uUlp?Pi#aU2;!E(mX@ubhXCk1pE
zOs`Kvwc&XMsybEMP=PJAD*)vt&YlryziNJE2d!$%z$xqh+k@l%mj`>h7T>m;k|rh>
zvYEQKSK8&X1n@EECC%*zdBC!J7eJ@tp;-mC8dEih(xO6jlUi$8hqIj@wvW1Rri_fY
z^l`BnV%fIlrF0_(D#m@_XcATK!S+Cj3>W>=ILQ{<6)$)jDS69cwfjcKNXFdG3r#Sv
z#^{_<UT+*Ez43%)%JLGnv|a3#p1Q?TzxVDefx|<;%NF#Am*PVQLY_*BrmV_;Aorpk
zO2KkfLCL+SK-loCE6#f(|EkO9%kCh|%JK8-BzjjiTfYZMT=tyz*RnUVyOzD;(@g2G
zslRgCf&P|vvUKiX_CZvrpbHctIFD1^q_azxvgf6r%kpztEv5&BUR0?l(TTy7ysw{i
zKm!3z{n2=6x&x2pNd*F+iQZ&Xjaw>1hf+9AR{}ZfPezqE2I`4w>J9_Hl!UBIc;&N{
z&z-ke;8!^}SRL$IAQc`cbQWKbbXWScx{g{?#W#ZB$`{ozdF(7O(gbUNQW366batFd
zOF1{uKKy+Hf5Rb0ws)DfIRjOZqjMap5EmEA$-JJ<OQi!kAr<?j7hi+ElrPk>)|6;f
z-X_y}qb5~Rx8ke~>eYv?R!<*a<UIFFTej-tfs`FX#SEO`m-WH$5fp-1L@}QArCqSA
z6o8a<B30VI^uqP2uRTl=B`a4@S{Jh2(IW{{i%B6-0jcs?rdil~mvTujj0Q2fL&lyT
zsm+oPXB#GTErF5R@L!5=MxM{1k+XQbGz>0+p$bqt{VGq1C8a@o<R#9>MH7cVU4C&}
zeJhoL381K3Xh6Ft4CtkAU0)fEHK7d^)*G(=x`QLXevmL`R4t#9ZUz#g1aSkLS@723
zxK9d4`B4|7p8}m#s*)Qy0U5%|w_K2zW@x#IpHOwnzfJrogY6fKT-c6qrSoh`FaBTt
z>Pg&-QYCtMlgbyhL3>hk@r{ocoKsuMAH=0WOFFa8(<vqBwKMcuVgAbZ5(|#nLtgt=
z;Rw*c+sG1?=u7<Qp`VsV(vS}4(zH@w=Gg*hl`lrAuy`;To#Hj{0G-6GJ_XaAa7ksp
z;dJl3s(<IYgXc|qcwX$HjlkLad#*cd!h-i>FNosF*|`dim?Ho1y<r@WIY``PV8YC+
zxbrbIL9CU)v@n4$UKHx*9BmxWrizUq)k(*ewuC`%nwvU)LJQZWt-4^|9Ce0*HyDq9
z6Rtsmc<Yc1&4RyR!D#`d!@|O>3mH?nBvoJ?wK5w7q$WS^N9z~4c+~X)SBn8^xw7d1
zf}A>bE41~D2(W54!9wXgHHwj16I0L<KFo48A!cq8X0Kx1S{1FOEA}U|tXC_5&>buw
zfj(^!nYdo_SxALoP<OVN=1)cnWrmcB5@c0fC9qb-G~omCc`zIYNlg}}fL*BQM?Xlj
zB)$&%RydPM<P<3cKFJ3?F_JfQGChwc!#>8V?FYjE4VgULBi;qUSOjTOlX*xjK3{-!
zC_hBV;dUiIM3(qKNu*<hm-s{m;q}m>LUsfdy4cvZso(}mo99M4aU!5_)D&Jn#n34j
zou{DHbAo^r-cm%LWJ1^~yo2Xjx#9?GVq>8V)0LT%vDGtf`*sC=9xjjPU=>vuSR~5_
zg_o(tNfByQVFXrIQ<z<(ObH6h)vXZv3BH7{se#Os!;tyA6I%uO+PQxb6eo<CO%7h6
z)G|(-6*fiU=ao`GA<o=Xz(^4WY8}-S0sz*+wkfI(zFp33!}6^vAFRje`|eeDy1Inj
ztdx>d`%5&>0M5lJv)P`qB=$qOVKNqWf^rr4yS<jm&IJ1X6fkw+8=6FKu-07}2=%%d
z5Lu07n-)9t+r~n*5Uqt;)-7!-RNpPNd`m~hW>Zsop%-;|FT}K}Xw6p$nzyay^O^V6
z?-R8L$d5&pU0d)&kKwq1c*3u3vnNOm?tQMh>JL5s7aF-V-*nU#liPVbXN<5ezSnC=
z4r#M3jgmX4+8J<|UNvErbB5`lneElZps405Q%J{Qe6zJ+*PYFNyolbMF@FVh7G^cg
zk(L@XJYIb9`egF-F$~J?r}e^%QY1dES+zmcY%yGMDq0GLfNG3(h{&8FvBZbGae&C1
zM~JKr5jj0ZWJP?)1|c6C=luxOMGGB}!l*7DByWj2Af$C(D#UH%qAk0I4hg9SrVccP
zIE>T#UJ94%&K&h|+A3Qp%kfjY7@hczGoGSYgs`#$@M*{U&wtEm2!E(!kOZRE2Yx<<
z6+;16%PY(F6+qn`fP8f|1nNXG3QvE2^o#po7(~Xj6Mnb7m7-;+wnP0LfBd+8w2wEA
z-R+~J?SHoT(#=ZQ&`~3#s_r4NYn9uuk;2KGBIh-{zY>KY(oYsc|76f`a<_`Y$l(>r
z4KyI5Ou%(w!?aWiG70tq0raf>f)TBW<jPEHO@~geu`|>vHwvv=4e=66f7c60X|4$f
z$Mm%etNb!{XTScM3cnWxf$rYx?N_gm1h$X%4z`cGyL-ncM~DC1+og#r>vUb8OJ_!R
z-R=3pJqq@~#BNCz_8Pc<A4DS?<6GVuu7xl3VvwN%q&JieQY!NOnhkZ@zWCazm~zc$
zDhhZL)=Jf-cx6b}P9ELchz-(csHqj525)vvxRuR@xDzts_k!YG%|-H9E}bq!x_*&I
zui;3uVpxrDan}WL16=D)%#3bL-MTxhO}Y)zO>c5|e=9UvK)cJy4R86imZ8+Fb54e3
zLOer<eqLWC-h8i^lF2F8;W8AxlNY-48nZQhHCYt@hI<XB$G~#|<*HZGh)@ZS|L3pL
zU!L*trVLok#D~_hs#;hyOEQbk3Ca>Qu%+g)k)XibRI}9?w|%t}E4cwkC$B%{d&}0t
z%OuQ#Ztt`$7nwPSh>pjPd#CZ(|7{}SpzR`Ps6+&V>o`afTXz_Y<KDSZHiBr6o3mxw
zxqo=jilL2;hpMhNt6VW(1Ma)%taIFbbF_bO(&e(pmi-X?G}m)S!2k}P=e#6vpQoH-
z>Y}dI_AdRDa+$%hIlU%DE1XV;A;)7OJuAW4IS+d8NNIa`_}V)U5>hxuJxr8FEudi$
zWl^KtXn41XY0I)CJUa^#0%5|ua0aw-g6HNQIs(TqXvrR&PEJ#F2F0yKb#f^QhIrB@
zFr0WTlniQvNz@}P@ntx~h9@vM>|r?I_Xs(i^m;+iPiZuKm`3!Y&mqnU;@<MKu_GHN
z333VRqMIt(m)rD!t!eOvJNJCSUgsJzf~Kn&0RM%)30F@xH@&^>m)rXXO0HpULgd(5
zeEw^|54N7cRz8Z8Ydd_-zz>HL%D{!EOIg{f^Z(-B{|mamyu94j{67h@NfN1xjOylI
z7~mx!7u7|*4V&zITj~ZLM~I682aRG053uyw2#W!~#gY&Hwfewj%jsp9!Q{212tKV@
zH$?66Gg>;p-B01@^p4rc^hI<JLrD$%$uN6ni*oj9BU9Q3OO?PUP{U#oD`Z;px3Zfy
z?^*sSaq5nz_>VwPe8yH<@J4XoVvnWV{=V7CyWOt$J=XHn#1dx+(Ml@y;H}JD)uv;C
zQUDgUzChgWY#%<?6VLAHd&icM{dBB~&Q+FaRb5P(Yb$eGwNNKuR38!V7dHzs`Laf6
z<sg`b;H9M{%0N(tUX#Z|L2=uM-RQq&`XoU=OqWvX%St~Orz@)2l{D$C$WjjD<=$*?
z?awNFo<4nyf7iZwvTFZ@&!fjr9<BY?+T*qLr%#@Iv;GLmt*<^=d-7l2>dl*M{+Yno
z6VLmv$>}7@CN<@zy#Gu;itqh>?=?rSkU#r}-JR~jm#{q#Cw+^MSCq@KrV})M_eYpL
z?0m6V1@)vWg;T6qTh)-^lr|^{CPNz_8%7I<BwP5>^O!BG->_=JfhuHWFf}EehlS!H
z8m5jw!pK)~UO3gb>2781s`m_J0faF!!KB$rse~t<vndKbTpf4tk>5+=RIH}r=s^bZ
z6($`Gl<0<loEoy{r)pmYR6i8H)Lve&-3+--D`<O`8|=RvK1|-El-mo6DL=P=O%)5s
z98@|)ERHLw?ccbp-P5f)&abM6PC8nvmnEHSTkmRm_ckJUWXp<{1D=5AUQX-ey@{!=
zi_~@An*2Ep;2_RC3+ipKTTY}7JxD(%(J*`$46n<{LVAvUD2#byT4z=s&h@hb0KFIL
z5HL>SEXI4Fl#VKJu7CsPkQN;q%c$c5YX@u-8j!cLQIMwoS<uRz?3`0wYI&Q#T|e%A
z|MmrXa(J!Q+FS4WbFcO4WfvbDzUYEv`Fi`O?uqxc_Xv>owYSz*Ei$ahdP=7Pbic~H
zD=X;`C+=ZuoH6>Y(QoMiA2sFZ_%Iy?QFm<hYS-@78Z>KlGuMGWbii((o?;hFTh;9x
zHg6}+50pmc53?>z)2K;fKiQ3~*EV)FrLoztI)8#iik0=Q2(FEW`I9jbrES*Lm?lwj
zws}Z*&~F`|?Cu>Mbzkhi+B-M|)WZL>1cud0+azl)Xt81Mr#FX3C)DJ<)<Ze(n(mcr
zKvG5y?nnPf@J2gPrd@@>(Qf7=5SFYXIE~{1#kz&oT6loOt5UQmh9i;WW=EqhL=WM`
zVV6ZrSmx;lu6yb%Hp`0gG-nrM&4671(Z^#y8-}MnWIPuk2t%GvOb6yL>iY?5A`>{%
zV_sZTwVVf$*L`{LwtIZ|_Go7hqXsc~<5@LEXaWZ<;~1wrXrShW)5(B9wM3ny2p68~
zbpzk=0tJu6EVp$3v48Mrec|2<pnN}j%_G@vy*NC2y^Voij*qur?sZ=r9lq`!|MU1{
z@3k`0rv_H#?Adzt=J@2OO)a%{|8aP<+vb+IG-8C62x#T=WiSN%%eY#a#sC0N<Ka;k
z{<nAX_UPc4J>34WfAWKclQwI^xw8Fy;hqea;{0f=Qa`C<GIr6eoZ@uDBXy=sqTcwr
z#RcuM_u%W#{Bwz}XGq;Z$5UrWAb6<<^{tD@2lSzNkRn&8n8g!#<dAHFM_D*udeJ!3
zlWLv<IC_q=PT_<o&75X$&?ijGb{1k_Ewg=WNHm)$INNYT-Hbcl!-#G#G1V)!sW66`
zlIPwkUiZ-V%}u`hp&wh`qo<5ZviYKfvB0ysfPpA(?d>1@xJ`6`NP_ooW$%Ok@ZlM3
z%bdNqtF=vlVVp~ZuA)O<BAzb2Vc_>sod{Ax7Nldp2kQaY${9fBy$QPON7sBHhY@-z
zi}1od5i~Hnyv)34iylh;P0|NF_*eGenI~T(^Yy}f9hk3){^~t=hI*i}T<vLP62D#I
zx7;D@!G_%Ayuj#z!q7z3%{9Ju;guIvDkv;r;gNloH;hV(4C^wFpSw7+Ydq7cVUR2X
z<Vgu<TO5Q55D9WGgZCB0HxZ8CL)%+mSZU1cJcR$J1ZNzlDc(ntp>6>E2bcgb!S<On
z+1(7Oa54hwYz50_%arVNb<w*JwJiKvx?0q}9-7LKG#`$U7$2-YaOZUV^V%==tgh;b
zTGQXw^|wd*+hhIh2~7Zhf2yB;!_&fS#JDQmBYOQ-s{&1dZ&iV@b?KWYkDoOBD~4}|
zv92zbW*&#B^h7^)1|r|S)!)9eD{bq?-|KHX`rEGlwr5v*VgK-TnN$6(r@!^}x4^D6
z;2$LzCKRtdwJv&0p|z*F)Y$ua(_6Po8O5%>UaZINl-PyTq%r3rYt~YRC7FQpou(dJ
z)~!2n1V?*O7aEwtnUI#Zh?a4qgCEZ~aZc#soz@Bzho?(S?a#f_HgCbehgH>WyXybC
zRo7NQH0Ju-RrP(l{_mCbeW`Equ=9>H<}ty)irqilqz#9@f4!-9Bf=Cudro!C&GsSS
zXE0RhCY*ibX#3#hUfY_E+(uG4F*1uXKfr^zIR;{m1MSvQOP_e!*em;Tg4m1-VYh-D
z5}B4LYCMp}@Bo1x4b<=3Zhs5*lV@@zM7zB!sup^tx~AB2>RkrRUy<;1|L#2$Xn+8@
zw3O}M7H~^SjSaDj$U~EDTu!*$!cC8_`9qeII5(u*1jM0r;#;DdI=T_k5}IP4S|}pk
zvbKtA8ub~(p_i7}V1a8cuCA>=di><+H{X7@`16(bm1pkc*5vm7%3IlV9y7XR^<IG-
z#701hlW?O?pA`}|%f^Sm6b9OIL-9AeBirBa?C!l#w`b4nSN>@a_!Px6tr`)x0%N)F
ztzHe(5Vl~MKc3R@_nzW`x9s}MANK$LKd)XN9KQL#N5>~`fBeT!|NP&Y;hdd^zrGue
zqImop$QzT3%d6|(d5EH(WN{PNJ2EB~N;gsX+-QIWdq%Np>725}S%#eV$Owcgixdd|
zh32GlpHpua7R3!zDmW%1turHNu^0(`1ChKfO!x|(EL}01!}-Al2u-Z5c31%BL%z~n
zxSWtAxlNQ(rM@g5d~TMH2(ei63tiQ0o9`DYq*O~jwnf{N=c%Pe$~*1Dl&;&)BAXsH
zH99(A=OmVvp!=qpB^;QA!f&fFs9@2iNq5&q5Un2GgWM^ytnW8fR81Mn+S86*t8zdx
z25(73DLo7=T#bSeo|;n&9&v!57HMUpm;ZX{6jA@wvG+n7LdgKKL=S<zJ#6MPAWa3v
z2kZ_*c<RgexO|v9%?_;C#@lb+>>ccOcUrv?%{$t7Q4BXHb|2bp5eI=f<re@U%xSqM
zJJ;-SOAy_>aUK$2n5}qQSR0ugIrsvzX#=w9*)#o!uPkI<?sNBPiW!OtEou(|=M&+S
z-(Td$@n(B>ch4G5$D;t<9S_5lt5Du*jQ=8u_Z7VH#(p0U?Z^&v%Q}61zbiwOVBf&T
z)^K#IFtnD8+fx?HR0iIv(09&rK!TuT)!a1@yR!R-YgM)Sg^Ac`Vf|M#-E4s(wt&B)
zw8}N%2N|8HV)rzG0i!dGYh35h4v6{DA5H>;5qw&pmJPeY5k^QaMI}W@{<KC|Mnn`>
z`sii%;O*<Zqy3#0xg5HS;$LR(F=juwn%k_pRE2mS`P+kM){<dYLSPMka@O+4q!qLJ
z$$N<@uRwVJ0qN-5)n_$;jQpt}Rs$T?_h}eMXHz>hoT*b9WHrFwrgzHfSsk2NJJzIk
zzfPS-K9No7+^>x~*A!Y--zhj0^~1qnI-K9@;ppH()1WjMTQgAO2hY%!>G(Rz&I1rQ
zHoQs7H!j{+W5re~aR=kBYeETX){tG1E#Ljs={MB(LeY{8P?t**K&>)&;3#uZUuGS#
z<4I<;ZeKlkCNiuoTUi=odE@Zb!rSq1l6F}WUH%ULabBUiew+k7l-Sqw6P4>i9y#pK
z<1G@{6}=N#iH|uVEFsILuoMGJV?6ZFv_n7vV?~@P#C$0_ICbp$LW_kP^4#D`E3<8d
znyd9Ta2z>7YUQw72hYpHGq_jKoY|;@^>ryM{Ko+$lUEK&pGzzXqiM9Yj{{rp3zPB>
zETAUEs^jQ=^^9<5A4+ExjpTPZry-IDxa4z7ds>ZWO?idBo3VZv?X&dN9DF8LmyAwL
ze68+HRL={SXm}YZw`J}713U&x6`5_R`Gup7Lq+JBZln!wsS3)Ow(?Qq3(xXxyN8xW
z*{f4ED=Jt)E)b?1EP3oFeikQ+GU#q&KzAF<57Z=TTC#L>wgwTHz?pPLHS|U`p*5=Y
zBqofhp29vpU0^pW$wJ03J5^A{n-PVy$uwblmz#ObF^UxNissH`3_PE8oM9-_<}7}p
zo8bd%@zehC+XGqhy0}A0s@U*B9TWIX&&;p-o4GUnT{^^|@DN@>IW?%*F^ctc4CFfq
zgJcT%ekIL9?XSL4E<^gr@^CPXg3WDIsL4%J8_Fu$SYc<UdyHl?JA2*zgZ&dtbwpTb
zF<{wPu?zaWdzD8YAz{>0uBZICW%ixF;WmZGU~5<Vn<hWl4&fbavhB7Q8r)9}%$bht
zmB@K7NQq0<;A~hqY>pL?buHw?3OSYn>~04<x%GhG-e$lPHDF7Bd&eWb(ktMnTaW#x
z+l>9HIN8F`etK}{Sm>FtI|4W-z_Z7=u0|%C2Qj=&Rw?|)Q@?-*+gnV*z*clLrd+ui
zgL@0DuKq%AhvtcGnN)%f!q?gjv5^W_o$nA+cYr2~6uuK>AZ@24zW&XaCL$}8Q?A)z
z=QIE2a9l$9H>7R=S4P$-dEfn_uDmnJn>*w#`-+?9AaBz2p6`G4iTYVVlf7W6&y~@f
z5j60XD6L(yI^|=hx{&*QocpbC<Rq>$lb|miLf4{I3>?Y3??vlT$9vq)-Adf(Qi4oV
z|E(3<Yy)9#Dv(g%7dj<nMD|=y>?4h|YHmbyv#M+dFFY71I)~AZ!Zo~Y1AEaEQ1fzI
zuDF2FD?>2MsCCu|ok^v6<Qm3=0WHo{aCUMwPP{(!0%QJai`NME0(1mIt26}#3uCk*
zuCA>2(OMQ&T4c8-l#QOg%bw?02Di~*&5yXUI06)46s(o|A@H4Scuii;%TyUfO*67u
z<Kn*+Et)-Ku!v@3OpHrRO@YT%d3D??kchVLjp=(kPbsQjEn^#w#WswIGDniY7@HcO
z#%~$}Ku<u}_PtC08iTq+xz>3+4hECq@Vd=r+n6ObPOcYRFK#kTu3d6Aq23jpsx{eY
z8Ri#_cCz&h_No^mVbq{A&HCuDU4}s$YmVc4HOAKPGS$JDVo>uQG+TJ{zf%UgKp_Ou
zEKbnB35pI2zG@UyAWi@kIPj7GE<oE*+bFabkH)B%gl-_b9d7`?QpA*xF$B)YH7mkc
zdXYs~U%F0zC60X+j(hbUc{TorTm?N4Kel6M!_O4|-*Z1bzm4lJed_&xS6A0pAG`j)
zYu`NnX7w-s-w*LA`2YT}ef+}*cK!X>IQTPvrmTP1Ho{SGOAat){Xc#B<Wb)LfA#75
zU+e!vd_ENqe<8GK#mxSy?M1%dfAwnr@ZcUQ<DWi;1L>ODS1hBF*A<1@auVX^Iqr&l
z&%B5D*Mz%P#?$z8X^Xr|qSPFwED-C}Fw&ssKn!|$nD7WB92u4OHI>;=&R|$ewG^cy
z*SU=mJUQ(tu%-1!0Jt#(Z$;s-6xNKOzOMll%>?T!2bMh%y?A_Gn1?*vG@c|qhD;^!
zE`pyCJan4W;6`IV2?{;)i$G89p0<4I=azShf7{-Ydh%SJ6guwr`&0W3WkAZNc0}nW
zl#N$WO9nk#n;sXHrYuVP+J03e<Fa08x}CZCilz(Arjt|5`B_|qg^8nr=eb_w=8CJ@
zMYlF3j-~F)(xz3Q92J$FGON0@H#Qoq64lKYn;uPuSvVdR30XHSCBh)Fn}&~W;y+HA
z`<^{l&&6iajx7cc*=lkfjmFta34MPI#D@;V73&ukSH;@yNFQ!m<%%Qihp5A;9w)v}
zV`q@^h>aJWwpKP(`BD}mZIv;ZBBfO~Oik&=i(JksM%{27s=xHaN!dF%KG}c0*L{6>
zaCmZfu)jm9U&o1GdUF=!X^?t_?)eD88;}RD!Wd;O?7~LJzPc}i?D#s(g3$@o+fHA=
z0UE!x?hojMZ<R*%RLjuAAY1NV{t%v>@51r=gc=31d9)5x;nBNS@uhl&4cU7sqtu4|
z(1X9k^eVi(f7t$Uue$@^{>NaXyK}gGbiCJ|BhpeR-^*ya@bcKp2uVGVHr`<seBLVW
zMaR2O$&l=UuB(xz%h^SjHhKO^JN%5J{m8?d|M*^S@BGl+{{Hyz)!UQ3E)Hm(LoCwU
z$nTwZ{nIoaPBJKqV{EHVra@iPblq|@^x}<Nc7fOxyvBpRf8DyDU6>FDWf;9M7^SZh
z764H|l|FL-DCra$3~C83j^Zqi!XD|TNDFF<9{JI2D8*L(1+-Ft2&4S_p3W`o<=>O=
zThfV*(vD8XeP9sW%jy}-ym;8B>9W`eiE;PUiw>dMLM6_NJR<Y=AN;6449ExF^p(gx
zHQA4KY@(dJkZ*>Zx>U#l(;F_K3oEBh;{I$d_ulLWV$b<Lhl+Ca@=JqT3vU~Dqb8Yh
z{vXC?w^sj6JO4j^`puKP{_oM_r+=OQKg8!#IsYS}VHq}Kj?cOmej+&|^j`An@MZVM
z?IY{L(8r7bz3wS2C#*y1Ir<o{chlQGIeZOUHW{AK8Z@znj%a13v{*67#bv<W&%RtX
zj6qz%EW~)X5S*dbf7$auUgDU+Nmm}?JqLoL<i)->j%hF|*Br;fFmW&Z0lma5bWvYN
zD$Wx0(pj*AHrZD-3kngz6&*lS%hr9)L)Ar&uFChU76>|3u=5VKyXh9+paLpHF1aVF
z-~V~AfjyO&xyC(D9aC&Buev$%v)*}-mUI&iY<9c3Fi-}c#XC9$yQH4Rj(hBKS|VpS
z10Q*{vQn`D!)e@xMzL*_?}n}~nKBGC^dxi8Y1dNlxRwPSYB_Ch(8h)L+GNEDV#I^x
z2MVw!IQ4>yAi2)Y#i@(;F{fh~YKQzwo#ESt!TCMPlTQgKtMg7>ih?v6w{o+Yn<NVu
zA0UlkN4~A+^KMG+$pI5i$)Bx)zX(<~GzKiI6L;I@FkQ;VOB1^6%eV#tO-Pxh$igag
zX-%USPKKQEsDi5VCB3hek(2XS$v$rk2SOfr8Vq6y%tP%)7!XMqPj8YWNL`x0kq36w
za<%A}ShAJ7d4HfeuSc901FEyl60lXwsE7ebLApZkA#7P<8e>#Q?>a!vdJ=PNce?Ke
zU`wzJE~&b*%YXr)od-xN<Dq|z!|)?n3szp|FJw0u#(uwh+Pd%T2pzQ{Z14QvxBEwX
zZHLxyXThCffBO||EW2Hhi@SRVD4FewG*@tosbFCCQqM7Mp-h)wqwJXDTL|U3i*T6u
zs$GyEkZWfJ6V9z4huKP&1$Rl=j8KfH1+#RC-<>dOiTr2<bO?WfFP)`B@O`xRYWt_X
zT{}*^U7QTXWCSiAc~3IoN`8=>-uCt>Jd(Fj-iV`^S*9`spVD>J+Zqb!OdCoy<)~-}
zhZxN2G9+L6ci~u!j)vhVB+&py1mu*35xe@L?OSg7*_ip7BAL9OIn;OQXNvsKnTEUl
zG`+<!pkDr8d-CYf)BOG4H;>o;lK(%%r*Qwj_tVMV!AW=b`1n%_0B-L6>PlJEI;CVf
z4kK#xE@BDq`kBwcfz2jy4|BO-&tNelZg=-yY`=YVvf-A2_lV7&oP5yg71-Y*EKyva
zeazapI8MTmpIp=TG=SQD_3L0|dvW2tKIZJm9*>P8(4Ze+vK84>JM7R)0Y!T-ff;hp
zD7cgiPp~f^eE$rjQrOSK6u}V(#US0rbvyAXNMCmDN1pC_2GRy6Q3)}cGE72<vC6Sz
z@E`^LOd(Gva4v$$2sjd;TtOHZWOhj`9>pF^I3<@9DydzExF*O56OL!jY~G8<K|%&#
zWI~r-N4@hTj?jph_lqpcpSNUxm~^vyx_KpcxTi>x7EKRu7T+B0?Wn2b^QHGaT8R7o
zeiEdq+NYpsJ}&P)o@@>z1l6{=|9G4Vd^D--Q~n$ZVJV>yRYq69jEHZ;YmZ2tLS5z>
zF-Kz>moC?^HR(1s7F?afbgH0WRp6zJ4PFVE6#2!Y-3|m(0xJj#(h`_sfjRQ8?j&}y
z9kKi2g5eq6^fY<bQr_!;6j&Cx=~}UHHJ5}jn1D50O_kQMUW<Xvjb@gNbxoXCL-=-o
z=m{z~wPM#=WMs%Kf-fa5hj)%lYp7Yc$A&t_<Nc1c)NHXC1f={bC`is51!Hnj0^~am
zi_L09cSlE8F7LIjf=Y<O5F}DiUZyK{*(_7_&X(f#wvX*$Xceua__xNR7mwJ+>iNKJ
z1Qi7EC&J55@A%FBfh7+fZIqlG$mKt{g0p@``6#u=KSfsJp@~KsT851wIt#j&f&UH<
zHBNUr-hBl}$@1(qVrC47TM%H&Vsg<?{JuZNJk+iGG9(?TdMai>iU`wlgBm&1<j!Qd
z?&tf36zxoIv5Fin3zPZ2W?`d;4j<XYQXKX<G_&A?x}0P&@~wR|w$2&Eu~HAgz+2jR
zV0e>6b}wl{1+$%uaqq#_)ajHPRn<4WJkMEGakX@jO`Qe|qa0c5L!0@#cp5XFpngYn
zvy9*|*h6@Q8E6FolwmE7U?VxjBxmDsjL{!aOGCkVfhF^qtA9q>)zls%ap44pI4+>h
zMGXKRIXEtMUmi#WZ4Y23jzvWnRVz#T5#1NTUzJr5ZD8<=GV)igxgI!nJbr%&3}Hms
z(`f}h{5?ow^&Qq5>`v5GX&xFlW0Uxvkh11iMu$l5NfP-_5xi<fo@@G|nQo)J!ba;7
zDoC~s7}nW@dxznX(FDHdlf^u$KNi^g1cX-#o$7OLDm!gkf(h@?il5@g2WLJmV*}pS
zljtq3P2JbQAM#VQa1Rh*sFfOPS#zL>mP*;KIz>P=yi`HSYi}H>qC$IP`veW+c#ISq
zfuNhFAQIyu1il|%0An5`@d%_<c*9D97-bx;D=E(<!9aonrOHEy%N{l7X*>!@+r;%q
z-sQ@Ctgsw>3c*uqmcGT6^jaa+LXHy{#5zG7;&>!(daNKJO$Iu}kH(WM@Xq5)Z-hQ2
zWB)8zBB}&>!?|Jy@fHAlK!d+W_ihu{qM8ooQcO8ExHhW>6?J$R;M&MGP6Me3SibHJ
zB{~phSxk`1m-+3A!2&c+qwHdrJj3EzZ!m+v&ffm3{ezb+rIBfwKth6yHlv4Yi5w#!
zV7GmF@EQ-UHDH|fJ7#DMR@ej<qOYoxram^gG!3qvK^M>$R)lJy0Ww%PLq8kgWN!bc
zD7NGP(i`9bD*uj6DQ1fTI*qy!eC52bZBt0SM%7mrQ)gZnfGjx>=^FRX0$EXZPdVM7
zdnu4tTF}eEi9Sp)*XBJpX(tm;kuY#IV1I3z$l?8K_8HaK&AonJLN4Ba{!=npx~;M*
z70V1GVPS%jCC*NwREs7Kg~5&HxaiY_>IY;S>Ex7%;Pg5RbfBf&nowmn&6Zd~l%~`y
zbSbqMdG`4R;1obJrrBXxSrZm<`?b_BbmVK*5t%Q+(FwB^p@m?%F#oWzU6hDM*ov8T
zQ&6KxO&JC&!z8V#MsT%+q-ek_jH0My)@iAnD<hk-(lrPcW}u+GfzpbXw%h<KPPNJ^
zx&vR>@(X_CH|9TpE~RiT;s-6t^<h?$1%t#Px<JgqlD?eB@w*hIBKx<;QEoWQ4J!_R
zI6VBH<J=L*0+Y!M3;G;hc%Oghq3X`&5?+_`z-Ii-6g7-a^5$~Y@dN}b3@6bG`dvw&
z!xLbtO84&Dn9x5t<&E9lwnpW>Q82<|F%4|hnFyH){?|TU7dWxx(CuhdO@BgG3z)Jv
zMl})2Im##@@h_#Ch@a@a%i>Tx$x`&1CXUX_GEQvXoL_MH6A9mJ9KJ4JZ$%N#OhDy|
zD-~}fki35UtU{hNE3?7+ab(n-IfJH2YCsam^5FT1p@llf(BEQ&bS&E1%<nrCiX3w#
z<VuRYwaaGP1=R|7$m)p-x}86s7-NmHk?<I7aoggJ3-;t_X}eU*LpgIPt)b~rS0Bje
z7kffzbXA<D7V<kfLvnZM8vJ!nOE9R)mzzGIM>B>(ufRgJ%Bxk0QXD#w#OCIL&5TM)
zo^nac^}|9dpxM$em7+`IqC%B0s|rQkYED_erdgXAOa+wRc{#H~q0;+1(Di=o+qF;s
zGv)qwoJ6-b0KI|#_mj0pf8GCnh)?1E_s!A4%fI};|1_T|>p#ho;I{7HQ`Z0b+S=oS
z{WqF~|F!-<z^AbOk4}#E_C7z;kI^IxuEe4P?Ewz)PJ`?X<CJqghJ&!@V+Kr2OcW2i
zcfoav+AA_lj6I_C?!QqP+@X*@@8PrrX9fg@mJ)0<Kr%2Fje^S-e}h9YeUZxqJV*!q
zvRmW7@12OU+mtbfLI$y_BQ*(d5ED`Vv@;BVP7@Fg`Mjl^nUs!3AnIFXb)m#jq!2rD
z$R@B$TVxrDelZ<yksd8}ynpPU9PAw*caOFY{)Y)c&I1mZ#E;(L#pH03!uh&gC16)w
zt_t?ze$WkuBShYU^+>1$9fjO$pFFBXGZq1i)H#L~;ZwRM=l<e!6|dFX9j@*@T+oMg
zjdue8itTLg{IK_G|9~$V3*F5*^W@)Ss=KlgZn)Q~R+)ZdG!#dR-{oG@JBTTvFy14f
z{W#hj26(^MpOC?%gk#c1Gm;L~jRg39;qAfO<Go$4*uUy=_hsO80are-jT}V)eGhUJ
zL67D|5jOlAQG@|dK@nDWOEF{KYl_H?u#_UG%&Zh)j~2fxig*>kL2}L{VRx{4;3XuH
zAKAu2Da-tlToia?`eASX<qs#`mbX@dDIN<45eR~rSB})<TVs=-1kg0JLpDae^KjTt
z$gSgl-?rAs9a;?t%BDZlpI?@7r`b?>ci@TlwYTm)cLu`DliYJudMZw_gHbYdL-14l
zaDdU4E_hbNk_x1R|K+qCGR~jFUzVwbT9a+M>BknnaBm_jF)o;el?1gqo{U`U{npx!
zTF<DxXGcPw#tTSrmi%pzKrNIa!6IW91GMm5Ev7i`aN`J0wqxAbWhc#ZOBbe8RfajR
zHe|mqtb<zmC-J0wT{W0mtJ58_a?sr<_$$|M_w2M?yH4GO$cxih3VII#Du)+!gcOu)
zq|XJ3hb>{0`w9Ud%YisriY7x0y^BV%Vdh=>=<ye3p+5w=?6XpxZ}~!W@WP;?0OULX
z@<FqWOTHM#EaRuwT>3#04E?L1|3HNT<($41i#Vr`#GaL@*YuintOEo@Ues`BPBAPo
z7pr1h+N-44jEm<<G!4^vdl2!7U;~Q13&3=Cj#(hdUnm~3mk<l4zE~5WP!4}al-dmT
zq75j!AT|qVh76R7YRME%1rg9(Y78=RibzH%Gp6DN#QTLA$EHOLgjkeut0bBRME}Pi
z@FIhrfxx+fO?d($FF7?QaGTXFt>q}a*xu()={TnOQaVB`T$oub=K?6HUm}C(Q%T8f
znG!FoN2~3MMrhjYMoI<Ul19|_UD-(GMn&QQzsQnnoS~BO!5=yP_k%I)fMPdZ!RghV
zms?hG@CG6rJYL$;a!a|`V#!u>0Bl`_p%kOiVd)WIh$u%++?c{0>oHAeo>hRyNhlHC
zXPg*kA1#@DnrZ_~*)JMQ+`sSX2qRw<)&{MFcGZ@x_XbOd<fFqHni%NWQI_zxo`#Z5
zipNYZZc6a^Rarss!qFRu>oXGk8~`^Vc;`&8QOP8mVEO|QeA&b}`)bML--O^TK22P?
zUA2W53BDnfPs4q^42F+}ar|yF?w<QeGtBq0EBy?A2<o*(-MipAk9qk`Tj?lF(X_ah
z`&7=-m!&5)n}6_eOnV>Mm^QC0)i8SChi7oiJDo_9b~6&J45M*o3VyfXKN584tZwq%
zn$x=69-REtJs=I4eQ1|i)aZjbMvW4lz*T!No$|G<<fq0>bziO5w>DhwHfZp@i7d-4
zV7ic<ANF7Ewv;A_?6ojCsm^zU9NJavEUlUJr$zyUwt=`>oVBBh@j9NqZ%CqLTh`P)
zveGPD(+OvIdp7xJi^!G7w2|*<sisN+R%B;Wwf8su)`;C@`?*@?R^j_t;%DyFFCE3g
zEbjHJ4zl7>E)-M2Vq6AIvQrpjsrAxuOfJiw=a?MMJJXoV)W6rqza1oaI5v!jevkc3
zCgV8rkmY&I{=8PW94vdU*1Y@Pt99;*N9)8xG_;=)96VD67hw-r1KN87pyV3;d!YuE
z-SArLZEqA`usvZf9u6g8<uK0J-tg5LL1NJT_%gy<H(aymPW7mb86AdDNKTN&H3)~7
z7w!@)u0c4yl`KL<+OzLi4ObchFJVW>qwQrg3Py+_xq{0vrL|ui@+m8_ibYHr=W+t~
zCMqR26y8ItWNGJ?pmQ2M_Gomf;5ai<0fFYUHr<gw=AD4cmv>dO*iDPQ6?i{3qKm4|
z)Bq%CO~5Hw4fnKS%O(Bu^kz{UdA_)mEq0?RFBYP^k5Ci`(A4*S!J;`M5b)NQ-?moU
zRTb9DE38#kcx2sIID7KCy(g>1XK%;(Ho~^rZtvxmcy0l!n3XvI#m88=<fh8ji{m2c
z`<c%|rz6zCAL{8%B%9I|2q1~mZF=_|SqH@o`VPdc$%=vF2>xg9pWXd~AGcra@8(L{
zIi7AR6*cOqB`3|LvvY}4^VjEYKGW<!(S77@?Y|y9USEGyu>X4U_%Hjf5AiA5e{R3r
zyIJU;+8Rtq(@NdFnV5i&1)ghcaQx5Xos(DHA76J5f80CTIeh(k|HOcMo?fRb@Lw+*
zE}w7dXztw?z*E0J-tAf_dwwxmxfpdZSNn*{^1)l3zwb8a5C&lBWfNn?fgXqy`JKGM
z#D%IKWE_A(3_sBAAk7kVM}5BOAr;u6Sy(2#7pLOmildK8gV{6vyg53AjhYbXwdlvu
z-uABdACJEO<7ofH2?1_Z+TC-i9ULA&N$CYl<Gm3`pWVUGKTEYf!@4EF9-_xL`>>@>
zcqQ*)c0TTo@XVMCuf$P9D29?hy!5YA`bzdO{4LH*a0Cjmq#<P<#&v?90PEz3H{I8V
zyL%?MlU0lkmOKqz^_U|D9RXv()FaY@cv1g;?U66qvbUe$wa*3GE>g6nFW9HA=SSkL
zhK23PB9&8Fp>85gZHl4ZT~Hz#OukU5A;(Fa#o6^ZNZFH~JE$^8T3+`_FbEQiPu0hm
zQ85OwL_kCzp~>jy#P|?uOuLf^k0iE-mK6k|{Q-gq>7LZ|qf;4(!g9Ej)2wl4-`?Fl
zTK|6gcu(B6q$P@Vsv-syDk&d$Zq}}%JPz&n6*_|j3jFT+VX4u0lUnAT+6#Xpm)F9&
zdHyj>kPmHh#7`e1fhq@J6<Opg#CuWYQBL&DQA7y_z3t#l^}r8@DX9t)iQbIzrM_;a
zU;uV=Erb7#_j>O&@So$oqaXKx1+~<8{zfl^-8=&%h_x$)BS3z|d`hcSWnlk6^#zUv
zW1PL-e$#!i|I^+sU4M5>?6Zt+%J~Nl^r5AMVL0)?3$DVH_%qPW82+X@tQo~*x%4?p
zD8*+BC_0-es78+SgSkX;p<(hOJ+vYpepbe2$q!dD3nTH`XhWDC&oJDMhu&VRu2LTB
z8ZA5%5y9JJ+-&c^+S}DO!q&OK!~@O;kr9w4c#OJ3{|7S3UM~px6govALz1Lo(ptJS
z$5)8*gl^FZ>*k(3$244rXt#%If3b%u1_G22hx)x)(QjSA42-EupirrjSXvc~B}>9l
z8E279)HZ(^VmuT3feD3E;5TKlGzyNaUu%#Yph*R~Q7xmVt14jvHRQNL4)5ZGs$o#-
zSSOMX^vGeW#v7dI7(;>6FqA!%uC|G|bga_Zk@|gk*di{O>z*4<NGLuRyp4E*pcn)v
z;7>UIO>0mX>09AtNrzPsW0SsNzGXe&)-A-V{+p&M>rM%x(J|e1N5<S-N2Rk3Y#Z*i
zA8-%L6Byz~b^w&frL9%P{n_?~(^;v>BM%81-8=>;Ly9L^{fJ<ly8QdMFZPa(4k`RH
zWh}o3PlF_hlh#>~b>UkSqZxTV<u<VwH!1Vtb9Fx1dgkpR2xMG~`Ee1`ShPmAsJhQ@
zcmRvKyZp4(e&&6Z{wrEksk~WBjl!yb3R0%JCByG6bN5wXKzjXk(_wtsvN=i<d8WXn
zJf1%wMH47%$<yZwG*SOPxI~Fis$S;fuF#HQ;5|2lR}y&2l2Y#VV=BatXk2*~!}+Xj
zmTHa7up8=v0C4QZO3c4<JQ+iZ7D(J$r3BRuO(gTV<mC&Q?aJLFGz2pUcSEp8^4^n(
zRo2#K^LTf2S5HYkGK-qHt#IAqewL@Bd5FhWj5R*0mU56h+c8MB7>^NG`vKtWy2F8L
zy~}tq>|;<oPRWiDu`oG<9TAIimE(xoz|X^X0f9LPvhR;U81&ON%OfI-_@^mF-vyyh
zGQAH#rsFss948;aUB-!6T;c^CJO~DZuorTuSCIl$C@(DudKCW*&WIr@@u*b}I5)%)
zU_o{sQ_NT+NBUZDqT?65Ly><8@!uEQP$VV%Mu37V4y)t+5MSb%xFg3lIx0iMDIA_D
zH3~}ZcyzmrDb7f$BG=_M4+-8YBJvPDQqUeUNENa`@Wd7$q}~OyJ%Ykg9`+rjM)`G?
z#Fr^uCj!&xlT=KF565uOMd2Dd0`tceY0wxAG)x2W4`d<H9|42ORLX<_)Pa%&=+y7M
zQ#oBMjCPEzEQjFa09S+<d>HHYIk~|Y#^l4i;|!<llqkWn@IWroyep46tjU(k<wafs
z%8948oLMRisl{YTu?kdf5gopGalCiJ5}37$D&>!YP>t=D>?9TZ)iSr5nbj=JD5c~Y
zU~CoT5+_2PmJ+l`Tq?WC+ngDz=w)cICT&|OLnQWB<bLz%a@AqK;K-R1N0e!;K4|Jw
zPVMoVPn+cj>^2-tTVE7qH&a`kR@-fJ8qb}4XFvFwNP;N``<{9L_Wone`^s8SABklR
zGOXg^H-}iA^g?Pl=Uo%*=_V&$sjAPtDxOnek){+X*#w~~>0u!ojyW9^sJV8zIZVK&
zejDEslgkCJW0&0;yh;P+!Z+&C563Ua8l_A_TfPRX%PWnpt0(z>5&}ul24xh<UJy|X
zZ6+G6{ueJ0AR?}7f&j;nn<|KO*G7>tjZsY1#+`JEnzkIlRU{RC^Y-W^W)<E2asPO)
z`{HPCuWcC9$nRgk_HH-Ho^IGVtV0!;5t*Opz(#BZAM1wP_k6y>0&S%<ZPdZt!-JE9
zJ!Ay;?|c6uMa&lst91W&@96Njesnwv(}?Msib8K0M3k;yJLug<UIg5U>aFMoxc(rh
zF6$X=0mqm#_|@L=4pOKIgNeKD5RMf->2&+(&C_4v2o8$HFDu1%p0Bym#k5&2iXP{a
zv!IFKA?FMouiyTyX84D<FZZSqL!oRHMd0p|yO5Ra!8}n2puy~@cJd3sp{CMhfS75%
z%NRVCZ($XfpG1Pl+qPuwX2qtW_*0(dxy<vy;gp%ydq~MtGk%&+fsN0m(=BywFyU3L
zl?yQaILi8y(FZ&3<R{N&q`Pllzp-Nb*Dz2l$rCrry!GSHZKN}d(>1nGD)%mnYC0rj
zPRu&~=kW;$RQm@n4xu6p>}8N0lc=^I4dT}QG_=I3G+gdqz5$@ebQj_7Tb3n@*#*yn
zj4%)7TV{m~V>pB8a}(Oc#L=MDJr?sJNlWM+h;oT6UcIEU&i#X^m)l&)MolA29eWA7
zN82u&?U=BdcyPQJSw%Lqt~&i4g_HDm(NxESmQ#?)q7-Q;a;WD{&)VGJC_Mdnoh}XV
z+bWu$@E|t$$r?U!Dhd*%_fV$et#`cpPKV%k`a7qX$CId~m2v0{V@S~@LoR%jfq#09
zW-+bBi_x-yzBs?;#P>-1<~m@#``+r+Be|ck)86N29uDy|{qEd%;ZSjS^iMHAd5bR6
zFeZOEM7IPxP1(QWaS(MV%2#g~r@?zHKxPNyI88&z08P0_7bvv>yE^2Jr05V%85B4r
z#4tQfFmu8=In-mGju_*LiP;r)gfc~QJn7U)KvqVsr~q||b%5!c^exodFB=uo@LOO{
zxHz`)Qo^D~#25}8NYSo$*xh+`xcAfE4qh}2FdGqO2WczhsahRxaRvK?=5H$(qZQNF
zE^8uyOb)w8z!zWr)1#>S1~Bwn-B-=00j+EqP^M}fj(X6GV37>qfcv5gr^^?+uwhz{
zUgD#+_aE=YuH83eKiWL6RE(d7Qa`&HQhkm;zkSkuvAgq+-Pv&L&4}PzG<KKx#$MN>
z4m;nP6J}<Fb%z7D{4fXolHIX_iNd}lyHrG}05?@+KK#`k^r;8;OYWX$<`u*oVG?XQ
zqGvGHz7YiIQEO0$JILL8?ll^fx`L~p7;hB#n8G?`kF?ci-VXtAWxQhXOkui7@z$Ps
z+k88ff3yC~JD|8{xfkZFjVPnddDDBa`T%cItOsikoXyF)aYzF)1LfQU%9duFl?bTn
z9-fRwH$815s<KW(i`MHhyHOjd&RveG_k{%(RRcz;r>v05z*bi?HwGpB=6k>em3DnP
zWW>L7zAUX$f*M*zrDti4Xe$mtRex{ZK4+AvL|+jpR)-6xLAT3!dmCy%(~~6&=*)?7
z<{(V)Xvmx;$b52f!n&gIZPDt^n|=uApjfA_ElL!-niQoI{#Uff7X_}>h@G{8EMepd
zPljU|U<1M=H-~hdOt8h~+WT1^{=$(7p|y>AAY6}O{LDXoQAe?+FsPW*4F%w5di4u~
z(2|$1)xt>Hw~@$Lz^jyvcxf#XXM7hVQ7~K?jaEPmjZ#b!i77~c29V5FWX9c1OiB8x
z71;)F4vrP!#m%dV5I&DR3k3V9HyXFNEBOiT=+h|;LryBZ?n;?KfqS@|siHL|!do=P
z02;Lwu`$Puo1*%rrAi9WJC*eUHgV%PF|{FkFUqUG+<Y0LG%@BAN`0af5~{!!8xC;<
z=1NxhHZogh-iJo9!|8T)r8gP2`;6t);_=n-o1^_7w@>!u#(DeT@L;3zNL;E6$$7#s
zLP}I3HJ4a*C++t12Ivsm-mov<-gFNR#Sp*R0>Qp--*hYSC4st%ll5HahpSjyxR={Y
z#p=u3CBm?8NE6o+$JiTIU)5SR8o6w~D(g-EqB}sZTbC?tgF`lF=6~;NSemx-Aj(V*
z?K^uBYHF{G73{(lxZ4=_N+qzG;!>nX{=R4tR0?*ZJW%+@c8UB`eWv*TYKP3;c)Se%
z-KdQz`CriK*Y*EhUwZ<t|MLI+03YMBN|7M9EFab=xZE<qko2~&^X3ixXB=RA<KZO5
z|0s<WEak<WMZBoc+tr6mBvI&-Ijyg(c-uqe6&ojFZW^W-dL|$*#Ndke`eiEohBd-u
z^6RJGdD!m<kq28%O1_KnKqOhRW=%O*^OaT~!&A)8mH6Ixm?60Ad=kC;8+^kbf~js7
zog-tE(WHJ`L&70qQ7GhRSrVRNj?q?&JJVWJ#TMHgC<XgX2%QawVRj8Kxvz_4FUJio
zFE6t_az>#<Q)O<<W<m<B9(l%MmezEc)f@L7Dtw`>0*I3RXU}Yn#zsl0pMPmqu28BY
zhctSQs`Vtkgje_5a3)17<Z;%pxyFDr9Eq8&^)}N=LZgk#+S;I-^~-Lp2@E<s;VR(F
zr2Q^gx2rU~Tbthc>e{2#@6i2t=j*T69zRG4ZT%%~&a4rVfu@bAFxfMWrmnVHx|;hO
z9PS@r+J&5($~i2-VQ_f(x`Yx)L=!w&PH)gQ2rU>78NQ)ND6SCnT)$w^hfy6|cDbFz
zlfNkKz}kAbv$OPg`CH-xy`dkSd5@P@y?#ulnPl5f0MJ3m0)nP=Bv+|xUo1mh*c)Y6
z8~g?yVF=#t*~Cx!&rOjn3LM;mf^ANvs(Q95_;lN9so@x~`4aM1pIJ~m)IbeBu>L79
z>vz;F-i`g+YF>^!9uQjZoMH?rLOq4UKC_tnB2Eev$zaaY@hhIU$zss57GX)%nHCD7
zr{+{m5HM3(3%aS6b@fe?48Y(BH^x}Y-gBah{q!K-BVyY!M7I6vAKU-LB(_9pLSlfc
zeKg3ZCfAk$R-m)uz{m}dBamT{FAR#?meD+uru?#~oG9CB&-S&cXV{jti45sEiQZeP
zXXSv(c=`=N-GEz{w1h{V+50@VrWP9P90&>~9?v~3UVIgm%Qut8)o0loDuH^p+Hy+4
zHr#}!j;VUdDV4Ym=9lB%#hVi7q>`MB3clm5JS2_7=EIfMrYQLsz2g1Q^I+4dLhNkk
z=PBnujCFI{^q=+Tzx78?zj^#kKK|3ACr|%6|9yy0@pyOg>hsI~M<JQ&i<m^o4NIaL
zvT@eIx<bG>(Zz2{DPklbJi>UV_HdGgL&<eG=eRbxKvHP51i0;jm`To1K`%?mDP#~s
zk1oUL>=_nWqCzOfrb}B7ZQ~{<%S3ihU~M=do9L;Pg+#yAK%wSC{lj@pN!|5({&hED
zjl3Tyfj7r7!c%geomiuOa0TBnP%j^r7ToJb=oXchV8tMzxQ|*^IVn-hm4Q!|wy07Y
zUGA!2b1IEz%9r!~ES*t#wkm;h+8o*NXxyBkyrQ_3B`r5%9*uh6wglXkuJkwWzWV+%
zwe?H=uw)+Gf!Pn6;Q0#+&n}wt;ERa93zDk}qlJllLXa(@pb$}uNl<ZhWajAgc-V^C
zI>N6NOfCBI%Pw95Woci6-)l*ar}-h-oXU?8nny+$h8pjqSrUqe{jn~9zn}y>(4kz+
zOZYM5*;c*VKiJ*-sj`3Nban3`_L-)`joE)sx;3@?nu4(_20^0MYg><kaojt%AD}Pz
z8HJ+2lP2DlS}#ZbRku(ewM+1$ZYHr;`EI?sz+gB@&r4ndF$@SNRquQtg^RMc#2?F^
zOHi(|&gggJl9yWUEUjw2bt+5d0Ul+1It(wuc#@Ws;M@eo=NKxy<T2exQNp6)J9Ui#
zze?UB+A1D*hvDg2uUGSS62V5;FDXFVRmt;7miWD(<i!>D(tcwumdhR%#)EHc6QKM%
z;B<Z%<)4C3lz$ZQUYdUlJ78}-DH0OCt6d$`v8gMBIuj<@HG2K}*WFR!?P&7*@6~Tv
zTA=tkHLtqxyHNGlN%SuN3_bGl&x(_WPb+4QS90NLabAXJT_tt`l6V0FnHNR@<%Byx
zxx(b+s8~HiIeie87BAry`juh;+!++mN_s;jQ-3rb7J#U?B(`4o!_r31(4VLD4Qvq=
zb%udom?{}eZ!&Ti5#x&Eo|L>OvRDapAEa3lU)yhp<h!9QsFuAZ$}D?9SLS6ek{}JT
za!{3>$Sqj?xN_;J64lE`l@KyKkK=cx@0o*iG42X5KXiy$u=jB(R;ZbFPoY-GvEHg)
zMoDm1Y*ber`lnLA(4v$nsXLSbh1FGck&@~qd{Ev@L3TO~*J<~+i63Py!O9zobyj>_
zzVua30Rv^NMCVm6WZY%%iYrFpijs!dFB<TQ3Qj|h^XtEyE6~%zN~vTo)r^U^0T~R?
z1oG{2`KPpGROIvJ<@ycFCBbhKSm$X?$)S(NHck4-C8zgM%1!N~lxxsOB(d(V4VqR3
zr?#yMHgB8)Rh%{HCCZPD%Hj49G%1O^sYy8?;btXaFjCTHSfyp_CQw#*qp7hAPbUql
za1$Cf#bIQI@ze~?RH=a*l?ai!B9k#$yj2&-ZKnCRm25s&u$tZH3XY4MFkgZitt&u{
z)pZ6P4eMA1Z{xK^c;rz*a49dQ?BJ&rBye@jG9ITkE5)Wa%LS)4d+OIhQM%W<hAPfo
zxni=3pI&FRoCP>VNEyCr)<{Y9nq8uT>Ix^aZZsK{9nR{CCzGgAStwV!VRLzf!Rj~V
zxHY&c)T>wrhWxcQ>h;?bK=bj*_Q`Qq7w^8@J5ai*e-)s7`6Vi&aQyK&ZQq+(>e2_f
zXnL`946>}>`>jE<mr;;()5|dHo!6Jn;>;gX2fD-#YYXEUbcUi#FGwt?w0t>?PyL}s
zDt}RlD-<8TA%m3~R7))Yjs+LEAiRFjefjF}`|Vd<da`${(mx%(p*G(HiARg#hRs^c
zqN@GvqrHReisrYe=~Il)W;NfSIoa%~md<olS#P08-qKx>jPFDVjdDXT8+w>J%GE9(
zY`@;a#qn>nk9gm?7a6@X<@my&jz+C}PrQ42NV}wYUr`P}sO0_f%S>K$v$o{9YuVcR
zwyN0C5K;SX>$+Re+^ULA&|}@Uy2d)hfck7eBQE;D&E4x8R1IT{R*nFR_Mj5`3~ENP
zm~8sw$sb37c=0>R>{bZaAQKosN2nClQ*L4IxoTfZ`6#JL{!J)eRBl*+7aV1|9{GJo
zmnXRuOP3U9mB)KbV$!TztZpuL3d`o(Fsf;*H@xxWI&U8dXXs2xKWH)KJHiS|yAx_-
z%=N=;m}P~>Ri(#vaZAsgD{t$^%PZttaCGKY6`nmROlymfgMoOhxwXq9ei<nx#Ys`v
z1nZ)gF2Q<Ec@ItT0xVbUJ7YhcoayOu6#X^@!wD^4h_wDz8LjSDC@fq9ScNV9f3CQF
zGf;{^Q<U-MmXZ5`98mk_pris{8RU?byHBvH5wp*ChHn?FQmmQIbwt$FRxwdk=gKJs
zb_1#)PvWwLh&K|tm*(QaURe6lLN%Ye%CKk568Y@XjwooAXOYe>DVH5K@ujKLK|K0d
zuSMBs!%+G^dlIcX5WA>zH)549NWpfc;-!g0v}G424l>HGRO}%;=T}8?B^NDryUtP8
zu9G|D=4q7gSL_bjH!|g=={BaK3g6UN_3)O)nL)a?u?paojZ=W`a4J`cb)!?gMC=Qm
za+WNGifmYD*OYK+w(8o)MtSAckPFA?hV34?_eE9gO<x}6SruO#IYe&VC*@1K8-4zY
zDPOv%GPXxurB!wZZ7F$kD6`eSC3Vypw5*mspXPf^TIs^@SXZ4dOSe~rvV5mi*boB$
zU7;vlauqS$n~X{jjMrX`q^L>}lNJ727;)~+swGQDq_p>Vy1B|hQ}<a-witEWRMJ!H
z0!}qhb~opA2iTSFw0l!$V;EILg<`CSa`qWGYZZ#|39K3i`AfZuP07CCo65v1uKlJm
z@`}qqtDb!cm>+?2L0H&-t&72Y#p2B&Q9?Z-q!ZXyyEWuc6mr!SWCfk&Ou4wU1DKC;
zQ@|9-Ro`M3JBjC9caEL=P+J7SD~$4@d^>7yqUu7_!F2JubT%~C45I?q>hg64gmaZD
ztWN=0hI(_&+YtS^d*NAeRNG!9p3F`2Ot@0js_``ya2d`@5A}`&oVx^X#*qqF<INaS
z;lkXiCO74|ZmIion}_>(7A}|R1-Z?Zl#18u_KHL$T^=T1w%eu7RWZBNdA`^wpHPH2
zWVY>P<iJ!{V0p0m{>+wa_?giV<bg{8yN<i*yI21<Xu9*y6%#{%CQ?V02B}&CY#{x)
z!e)h_sRTAtCNHd=6^j%EI(NsnOcAUymOyDrl}VByWom(yO6G;t2J5%nl%V89o>xmv
zv3{^=&piUw8bjFC`VFe}i`CQ>a(zX8(R>3Wi7mtINXnaEG)9tZjnNoMu5rc;NXlDl
zFp}KsExO9s-9Fjw9vtrOwd5ez#PHfvw?14)bn%Q!QpT%Z@@*I`7g5uDrn7c+xi)*>
zkzy7AynJc~fv(ibK&VT!W?=M{TNx<(mQ8`HAC`SB_rBu*%w5Dyg_pm$%Yk#Q>ZXs?
zz1hnT*1pVZ21{T4y_cdZ550pp3pf$lmlz{M<&VK;Ip-XOfkW4L;CmNgKcK{pP#MX!
zluRq`%VuK$$^@rG=&4=CIn$=b>o{lWG{ZtJm_FHCHXAwB*Ho5JcAI4LG^Ihdi*jnQ
z1=O^9Vkc$SB<rOq_1MD6#Y~fW%8JUxOM{x)s>%^bftZRCdpQ86yhhs(ofaC?V8aeH
zJU5ipEjc{Q)I{y(YFUHLy1q(m)SB;=MU%BzHq0^`HkYRI5_mJSw#J9anb0_uL@bNB
z8<B~wKb=$xP33JZ%H@sQ*jda(kP5yvl6(&ttJHqSt3#{XSD=puy`6all`WgxeNUC?
zqkXwCR$@R&1u=xI&^(qHMNU2L*PBXCJ@(fdP&%i2=df2{Pia@6u2hw0>q@&gHC<Jl
zZ7rQ^IW#J(C@vOf1;uD(1#OB}KzF1y(v`@L3hHUs9J6+&wDDx2I$KNDwk!sfg-NdM
zv}4;@tXkjcoW*CMdTpm2D^TZhHVvxQ0GWj5&-m80PL+x1luPV7v(ciOitI!ysye2m
zuEK)sAuB0P%q4AIGH$(7cNi+=+F<BAle&$`&&{_{sky4E5`m;d$CZ{SxhnRjf}j^z
zm227kjW_Wd?A$lmuBYzNGstlzHoYa=k+BMP>8jp<*p|n{P`F8TGAOo5+A<uTR^Kr)
zE*DQqrIVW&pEg179E6cN8Kkmv<@(Dq%TYp-V}9zQrr9`WP_C6)-IZ<fg{@t&OShc1
z9B;&Xt4)Z?_+}ZqEE55m?)+sNewmFB>RpPIP;W3)%i=U=vv6*%d#d?qBPD+l$E8+b
z5?4W?K!sVbFPkyUf+kN6y3oXY>K3L`)6J%=riuoX&LNTP=L!Y+v0X48XT^O09#)tX
zIjt7#iY%kolFOdD8Fnrt%PoTJa(S~LqKk_CtofE%MJz?YSW@wD=1*8seW#-O$H^=8
zmG;9sFozdg^5Y;&y@!1m-`C#5H0e=57C(zeA?BU9UiQ2b3@Z%(PyIol%*rua!gY2|
znd4FflU_%?^CXVYUd21T=4{)UxK21Z;wV5KML0rJA2EmEB|3TfxRv{j*7DFfWeMRt
zhu&IABu&K2lf&2hJKeWWA1~aSz}`uPdy}M#gWU9ZY~5iDyDK(G(524N-mC4O_I5F(
zrBf5}QmhG2%W6uoG>enKw4gfhwE|dDRgwVkY;4j1?ZlBQ54~66yWkQ|49_^!vBt24
ze+rxj#0G1drw67CZ{wD&IZ%UJ(2=IPil58aO3*!?hHMEvlt<IJdZbe0;kYEtGtr6A
z2t)jR($e1yUD!{AB2@az@<|6U6?1M?E6zAnYck;qdXxFSi%?5?ildZrGc70?dfn$F
zyeedn1QYJXqp_dK4-hiLKHiuk5)}l`rzE0u1LU<r4wMDQNe@W?7!@myj=S*d8K!LT
zC_k);iCb27cklS*=<uI=yQ;>TT|<)0Jd?=1+(pXAg^?#sbTkZa#k`-R@M7+@dzcyR
z4PVB1{a~B~B%FD;MPB+zUk0qgix1*N>Hw()Y09@cfj0{9bj^DKkO4c_c+#9?;gpJ$
zi}ND%OYmWHPt0dN83IhxWD<<x3-a9Yo-VJ#|M>X|WnEEdv~u65>0wlC)u95bzuiAL
z>Av3n$%5jdiTb9(ZF%W=JQ?;m*_3x0P^M4rE{1<+?;ox=0z&6u#~}BQeIRqhS>i`$
z0bY|q*$|M)7iSnVTIyLgjl{Z8Zgs{iDa^d*Wh296a;-019Bgh<b&Qo&f(ps-g~_NC
zF}Filk?Sfhv?4ewb%$@qWGh)jdi~hZ*79pC<ZRkyiOmhi#mH_(;eyrd&}DVYl<Y@n
z8QQ?0FSt+ziC@U70i=CF<s~$o=TZ&-{kdcSszn~cFB0V$K_Ti1lAXPU7pmpW;YmF3
zWYWt}f}(>0a6*1=cisB2k$cA*PzHm-FZA~PMg`o5_`}l#(JCv_Mm?AW)Fy1F{RqF{
z35BbjuAT*1tF04w6`{bp|ND0P;N<OVrY{+J4j($~H9q2wOO6|uf%{l~Y0Dipyn^{)
zj-!j1f!iyXp|qUouO6BnlNzJtswmaV##ET%@*zo1C?O@(^SJ8`3*Lz001S~dtxln8
zt4~PT*0OZF!0FM=+pukgPba9;R;0Vm^9#*0(9O~v1h7LQ>HPof{d;@c#+5jZ_h0c<
zz{+<WQl@0txpddE-A9p?RG-?iSCX5wX?}bl5|R*;00WScm9F3WZ_Z_A&I|?@O0tvg
z)_ocgz})A|nR7pt<1dGQ@0pIYSTi0=AY+H)X%ZLiR+|TRYzpx)_s4gK_%bQsrTQ;8
zJdBZ#DStGNXu|xHSHsbOM35QJE#T@n0tHx^Q5_6vEduYcNq!$jD6?c%Dp<ZRYS9tV
ze}~bwIlB%Hq1zx-PYZBJB&_e<KuOl=wwIf9ET=WKZb_bFpu(x0;^8+3hsV)I&pFXx
zYV1t6zNx8gs(%Ps?vJBQYINYYDwmNAv#9k-qE8=h$4EuFu`Q!8Bx?pwy|a*QD9}{r
zY^?%>?9X<`%|Q;b>ggEr^zOUo!!7KBf2fKJ|88vt{ZKUmey=#T6)NomcRf(_JUYnV
zYRatv)SM!)0Ma6$vv9}N&j$|}$9Fg&52{3$KbjxYpSIX?C)zOA&ab2ecnomWPwA#<
zJ!Tzy<4Uz{PHxiXq`6J+_;zhoS7RzvT<iqQ>LN#W@_zwHcR~~8gl1X64CREUT!S+(
zNG?*u?2433YVgKAx4@ccUEG=vo<)JR-SNxod(AD*Z>y#0vhxb#%W7G=0KKyKa>oS}
zq9=k^Kjb{!36?Pzazhcmnj1>+CCw#1)MDle6(4Ps6HVSa)3!uzpiV5ScomrM@OO93
z7aQH@j&;o~(r*}o_<kJv%<N-ZTUrNF+nQ05?C1nR_2SP;>vR}#SGLI5z?{Iit)!)R
zZqS#`72KsaZO3qn{>Yr6OK)uWuydn@MBweTkh0{>CdMsvT1dC-ZTjo7kh0_;pi*{H
z9iT@CVQ4mtrk4AaLuHGDWamdw82-^Ls5LB!3gDjxL#I*yB;Kq|HK`7kZ8yapz-iZ>
zcC@tVhB>sAO>JAo45uq5BJFMiCSvt(xAvrNxgJ+a1+*`y;OoPaqqj}BA}Y7{(T7@`
zZwFr?SECwAwr;d_jG-Nb=+38BO=r%B9jD5quF9mgN`=<6mE2FaxE1Y$k<F{!a<5#+
zU2kc{^wzNVD<MU_{-*WNRGdPqqFudR%{@$R(}UUD=04nFbT_tcw=}t{YuPc&GoU3&
zF)Q_hee%yDwL<2)kvNF*y*byd%&BR&!uQDo5oQWQbtg@AC(U*Bk_)!4h1Uz8%24B)
zb*83k+U7zeh!v;LM`P7y&50tJbZB<yK2x(W_^ozb*ny^bS-4PbBk0*u(>;ExtI6&(
z;i~*`<-O2NHgAS)yYp^P!`^n(5nuNMgQG%l{Z^56sMMhTtT{5kibSXdT}}NXR~=5J
zh>-tuZ++6<`sC)V>(koUzHzVV0!LH1-P)2j1WLhzt<V&1-UX-+jUt#LIa9~t!V}WE
z!q|WSMvG=p1Y_kb!;m;8EWHsb6qE(Za-Pm(Ak_p_*|Hd(HX7SO@6A_G1OjB{QMsIH
zWqui5CDSRI!&F+8qNu9$X(%QZR1@3gKu_xEb7iO*c<F?mam_9Cjk;5}bXuy_my7w!
zR9*h1RE;S3Fyj?NA5GKj-Cz*iQ$Ps2XBB*^2{cJaY8weH1+}+h#FwN243P*s0b!?C
z+G_7vwxqW4q)5-tlS1#G$qq_e2n$is#SQH$vKEe1asyYR$qG1OD8XGG7)u4n^+k<&
z-H9!>npV-PyTKj0l`T&i4P62s9z57_%^2*O2abN#&YZv>ema-{`>QJr0zKT4XC(R6
z_l{qjm3jBT5~SL7^gsVYaM(I1ZJOz50`Zkp`qhq>G-8y&k~Z%?k60Sn54Bh`uxue*
zSrIr_&um%2cU4Ov=<~0;M+dv#yxdo>k9PmoH*F};rJBPaNbDfU_Q1eq5AdeNbs`Ax
zb#$euHZbd9%O=E%r`K4mdK(P3dTSnnv^crcIJQ@zB0}fbk`g=(bzSMj7=d8|?QJU5
z<sVjVy4xMIwr1>Sv>np3s4s?PmGeDE<>S_H5`3;1yBHm=%~PZ~U}N@D^+wxSGCoZW
z(P5T>uI?uJx-Y5FlJzzX9&>v>haRk3&#hNYA)P^K?SEf3t91}hpGGgg8@<{6Zr`t`
z1xi)>OU<J;3=>6j6%oP>=IhAjnkOnHU^g1HBWDX3n99zy2=7K683AESC#3(l*<47o
z(mD%LiQI4&tZ=Dz!o9R!B~s{pw7>hpaXhjPLtvEz0&$Xi!?+yg3<5LrslE@zcGhYN
za-1b|kIC!Omv94K;MM{yEwf6eMkr%LFN1}i34}`MsA-nxnC3u=(cz~xiCa8AA1~gI
zs5fFNpu_Ne-l0F;aJAn`YjzNoEyb|dzUWcf2h}X_3cddXgoQ58^o7@)rYm4k6yf-N
z66IH!FwBpq(9kszj{)A^LWKkQ;h|TDtP20+)TB*f9Y@0^z|G<ilIW}iWTYj0;Iic8
z!wxq?R3Y4?WS}SMA$6i1ni#;d_R!b?6NRYza&FQZdTK}y6XuB4Jgq-jIV<93moF~G
zu*~9YvI#+y!LnOjL<t%<&vV4}Wuyoq%m==lPN}LfXfBuYd0s3ubEXZPw|d%i*%6AC
zp4p`QAd3a8HnUngR9P)(fm+u)8;b(>gN4`5b2ZUve3}433(SI$6!fZwynss#NCsx6
zS%AKI2+pg?2vrm4HPZ_9yy~nf&|vo;U6nYn6YRa+c3MxWh<P-~?w?HGCpo&;EL5kz
zrqgT0L03>}2=@GWF+m3b@DEVq0{hBHea)iRuU~DB<7KH}DJhCvf!!GF=*MaVE;tFQ
zDP(Or47eL;R+sSsGQ1w^>91RG*|egi3{t;TSB`SheU!%WLl06i=eHTF&!kL@Ajs_f
zi#+>$p|<1ve2UI#dfcj2Im2bPNT=ZPz-OHSK+&yB@Q90qIHb(U$ARPnPt)gHj*Ek8
zLor;i*9H=PSti9bKmr3&qNN%DUCA`LjI)J?gD|JBRwUDi0OP6QvDyiUbelP*I>AZW
zBrsX|-2E~gWyw{IJjqanl0&joTnOy6j6=P^QSS6)-%q@|#-*0TZ4<V<R`&p2cN7oQ
zw_7DA&<n+2Z-DtUac}GjN*^~iF!#=!q@p5kyGScPN#>v^ht*Ww@dYZ|PNp+;wJj#O
zqS80ie|L;uT7oIx)&Bf!t1LX9R2%`UplSvo1=VYcFxmfQnO??IKyn}sT@>SsB3n)s
zr;jK{bp$xPzn~xVy^mx0eCu<R7BU$8DZ(;O+%o^z{v6g7h6wG@hzI>XcpA<Zh58MZ
zHY4#uRn!+hRWtfS+TZ=d*ZYSj03sn6QxFDIg|WJBxI0zR0WZ1$eiox+?xr30S)G;f
zMLL}*V2z%$99`c;cB#3jE-BWBF2<VOne&+SE+Nghr@I3rfaRH5q>21Y6Zu(9#2cS_
zX-;!(msmKm3I|(4H-mFgP(`;cPFC%$+LAt&0OT<vM1cEr|GsHU70br6Il+J^Jj9X%
zsS;k(+l9rbC+v!jjJJMVyqu$~h~GeueKAd)OpAAYO)Jn8nXQf-Ntu4;58Bg9m-)~W
z-NQKNl*daVISYV|Xijh+0Nmh@&;EitE+}{*P&U$fDBz+R4#@lPnPvsmvM=(b>WCJe
za)dqFwp0_BCl|n1yFY-G8T@7F{qqQPeIt}TuRdcM5AUTnEB{nr6)v07H!RK=nJ^=t
z&Y{5?Sj0|7?@;v?>O9<9FcU!53|gd_HDKio)#y}pKj_)zbp?8iq?kd{3_QkWYgHXU
z^H3bID36SsG|5You!8nME6M*-ov;~d`;Zz{K%>hm>T>~(opVL3LXd}id47SE24=nE
zQV&;#bA-_xJjoUHOgE%Lz34QnsAfGK-b~o<=mB~4+Ox-$c=UFT9-Inzw=BJji}1`@
z1Ps9H&Q|wR8F?*nNEhLK)%uT*z{TkXS6$CwyUK-klN-;HFxwUK#Uo5KMRIx#5a1{j
ztMmxyDWZ*hIuYcCdQt;qii8R%ddwD34~VH9a)iI(R<c6FrE~Du{0L+{AeR^WZ%+RF
zldY$YN%dPBy%OU8HS4Lx4+Doh*!^zz;IN)N05@_qepS*L%Z~JdwS=Bj;?Zhy8bvi3
zMLJ?rnp$BmKEB!NdKW0tBOA&evANAhKj{{+EQ1|P+8_}*Ve^vcbQ~BqG>mA^^<GD`
z!@RXSj?(p^z$c38X0b=CkVOHjUPT&XnJ%+(?$kts01Rt1a3C0Z1WE5{3lN8?X7vP9
zbK&%(08KaGpevWgsK-`wma9u~dL3Q{F<CQnYTP;74s&7lyzAL+K8N}Urypr`LAAa}
z3KYkIoYY)P2wj~CdRmoFNY6J?>Gs;UJw1JfXfXZhCM0DQcX*^aH|-0*yONp*oGF$s
zRZC^wo~n~a1>sl&uo&_kP<2K%3L66&O^vE_Gz)92fgP=aQ}u{fLaJ{Vf4(~S=BAj^
zNZZwqMIX*H9bGjCN2o!j3oOhSM(gU=`Y`(b;N)=s_;_@*d-xYfwLB!F3a4ffXYWSI
z`|)&HLL@rJ7)6Lzs<IarwHWe*pH*RF8v&v8^Wt6AHo{YR*iw!}#%U@q7f@<62Z_<5
zt;s;?_NEb-yS8i#`wf4LB-I<B)aeflD3@-gYS8JtK79GN{y<T(kgo#%{exj$!Kk4l
z6u(E%s)-dYs3G&s{?V%)Q$29h^rsJNYr5En=t`|c67{!5w)yXm4o>##h6JZb4vEi`
zz^@-`Sg8E^;q}o7$0x_eLvzOlDpP-K>Ycx)m_tJSlS?}gbN(pP=wA+_Mcd+rCSVp9
zIV|y+wJ(c-D8rY(x<=;Lf~&z|aG~k?11b%x@F&|)^u!d{(GAX$*?4~4CrsKW5@m3|
ze>nh>2Ri|s`9B0hcX0UE-Ir!<>edZDeK5<WxXwN>>$n<f(3gYNK(}sn<<2`>%pZCG
zgG+g<>8Kf~$}}k$MCa+K+h_Fl@c7`n!+nIAbP!c$MHjImg|zwMz@7>{>~DA9zC2kK
zde<(Uz%SI#PH?;wdhi6aWuKRd`<N<D8Pco3RXthGrzshDk|+bTbP6k9fx2xLkBhui
zWfG%S!;%<-P?f&OuhhvbK~p=P&vkL2*pm12ID`BwPNsWc4Ub-r_FjIsf7l-nqp7;#
z6)lbMK;yQm0Xx&|v(H9MGu(`XXUmS2h<M&XCgkm^FW}T)##8Z1><QBF{jo(+dYj=I
zXX3=X|KL@ey0wC8d`a-xyRp)oy|u(RY2fn6nzDWR1{)#Z(3a8i6Z6I)u2z_bRS|WZ
ziIC9P!`Q1p6a$n4P5+0%X(ibCO#x;_=;#g-01^Moz~TSmuF~DbWg)U7WdDlCzbw-N
zOaj30iWK{CSuSUDyvNW;Aj_k9qPWBibg*dP3MSdmm>LyIM3#jPKMAoHgE!UT%P?yB
zmj|UAW0v0xq`IAYwPF7Y5B~3Y(NB(FR8Pw6-zTMQ(`F>k-Eqo);?uJC`taL>@AQfJ
zKXP2MPkdPJKIXKG>o_mM&_)UW>;BR4!Rtd;-!pLRuF(AWcKdld#mL*kx5xW0OlWi{
z1p8TMz8t0;dTS(6pvptjno;z*B86VX{LMB?nqmToik-I8a=kWrC90>%Dz0jMzw%BA
z4RlyV-Fc_b@|=&GR#P?kBDkm#S2Z}FfJbM&`Fh<NwimAVWH1oo=tT^ks8&=Eq1JXn
z=ARDgfHm^86hWyKmUGN)S!UH}Q*oOi_1FoIjtI)R@R>zjcA)t68E>>R#O<chLHl*1
z8kI@KWtVyyxE%`<*?Z$S<NCGEE_&DJihy67_1B;NoY0%+PojOW@&?(|WLjR&`s-SB
zs{gGYoxFT8I^6%^WElNpeXhX~GuQuPeXten#Tl>|>twkDHE1-|#s5dP&Nh6G9Is8=
z2(zqakl{HCCGTp@O2uSN50kXKT^D$kZ-e~m&*EyRvk7;G6ZHI+2$aA5A4H+yy{Mon
zHs<PpKe^=1G3crz>S;BNM4%cH?g)iC^`E0BVNI5))u!F6!36fw_&<erSGuOGQ~1Zi
zrfcCn1_p&m;Z?_s4kS%OzQZe~!{C3%*TqL;$pk~qPJI;6EkB*6mubE%nJ%j@KS@rP
z=dGn6CRl5sY5eOou2^eHUQT%Ona0{W=(F6`FuKl8)6?_uxO3TMc7+jLT8eYXjh0f&
zMG=pa)?)8Dj24&s=sY{%`1mw07MRCR|8xfFm*m~?pX=(lK@Q~8Xa-hll#;?P`4f>n
zK@bp)7Z?(N2BUx14Fuz&n;&g0XFBwX^I){xfg1Cq7|)kFOp<)^Cn~>noM_cSKB{?L
zyAMG`Ic&J)4fPRPOgE-{6na<ISN8+Xhu$?*C&yvD{i&|=qHYC5p^<tnD^>Yz-Cpcf
z@E+9vd6~VFzgDXaUg`3eKlZ%<3W3t0-%WK5UV#eXhq`5>P@q&;|E?_yXFPDU@kF-*
z`Sg6m(X#*`DPW9RE8gSUuR{J;(<(<ZRrO3$@>KxR_9_>Qj;kSmHLbW?7A+vt_kkB(
z;Kgf;Gcr_PtS}y?V|W>XeWP`3D$ue0DPN&w3|>RwcdM*8MRKe@uQnPR=qvnoB_J4`
zPnNTJ^?8L2I7>4<82P+H3)3WiS9$zsbc2v=XwV?n``=D<Z=!>!nmQbai3Xx-AoZrc
zVK_Wgyf^_1M&pY-FB38W*SWdaypjtBqW2kR2k=D3KB8ybiD_8<M)!Q(kfR{LQ5iyF
z$LfCk4@Rm1P2ba<$n-}GTqP45QkH)n3>P3A>~wfTb`DL;C|{yA9)`j2{Ov4T*39Cg
zEJ>0#<TVVt{AT}X@6B6|$*=zZ&CC546}m|Z0(c@%T~Z2`7VZCP>k1djgEOeCx-~H!
zB4%548f>bn%Y&z70fFM!x&zD)ITa>ab}YeXN>-q?;wQ(q677In<(R!SFX|+Z^Gty+
zcv!}Tjv%D>*^i*-iL?=h4FAo`7y#yq=T5y$=piPHw(&3@($xueF8Mf(t*N?(%2|32
zo<4N0G+fiz%&7SKjW6SL>dON3Hx8nw`$=jtH{x5YGS`bjYhfdSd|1f<OF*>0`7&fo
z;IMicbaZIEA&tR%3xnY}xmstpdeif8+w*GUntJHc{3HpFUA(`|=tVP(;=_H=ESwnx
zt{DagEpPh$C?Jh2*BhY*!dl($9ctvfu2~p2bd_sTrCia<bvzWc`+_0ef5Tm2Ek*-E
z@$axYCq-ec!Pm8Z>aEGin)qfnUOJ@LfIIpPsVD8{X-UgEl@G0qbg2=vNf*#|Se%>b
z4k!a`BsmjYKLPNv7lwNZc8#}$jz>~=l7viIHl$V+eWn9li(_t%76%BD^W9nL?x}$l
z=E8nMT03NX(Ft}8mJD!}pAu6-Q-LAWV9Zsiq}!s`kISzS@**AAZwW+(IpYyAW9A@U
zOC6RxV%nekw$4g;o%Y36_E@YNoXcC?dmnu<or`PDev6*T!1IL2YgR>4=p2(?IE{5*
zdA*J1)*Onl-fs0dmfXMBzsvgbV%=s3J}Q1<&R#m7|CVI_qA{#(IAMn$U%rCY92ZTI
zF5*%5NV$${zKL&d+8Q_kJL`4RnWvIQ{3vSPm^VOgd%c&a$MHfbR#%Sm#;Ac--SBIc
z0pQ;X`AlrgP|!;fuk<JYEJmz~E>kV=(pA$EqUjU~bHlMZZ>2gQljW2oKU5v_qr|Yq
z(brqs>VG{Mv(-u8QH{?E{_jo^C##2>MPjW>ItZBpq8k4*5c9Kp3I-iJjf7|sM&deK
z78tfPO90#D(S<rv+7n9Wn$XLs){iT4mpXh|lw2mo_2L3touDDrl!B@JYO803XB{E7
z+msQBR#QCaK!dah7EIj?4JM#23z+~yNt|cG2s)V$^(HN>FxKR3GCTj&+qgwgqL)>Z
z*bGbvmzLewT6H1qBKZqcw>~CJtXYykvMGtxNu&FFxTpofZsPVEarK%rEnfl~+_=?=
z9Nh<I>ixgBbS%HV&B_&tV(bi+c#%x!N%6_(331bH*lA&d22s!lUnJ9YWjDN~?X7LJ
zY6ms~z)A5z9Q}Z}tjZB+Jox*H!n7Nc4zzRXLWa0LRjU+d6RY5fgT$Ddvw2>`1w?3P
z14&fj*!Eaht-Wt)4X|??L#oL%`Zm_e9nE1aVc_Z(qyLDq@q9^X0;|oW*;!7(zs~Z=
zWaA7B2MYYC+Qaae`nrObo6k%1Onw&f^iZE5B?968_En(vbPka<r};qZbBvK+ZM(*{
z(rrDI@=!w6nIdx)(|#kMYJ-P=<t?Q}|42K^@N)Aly`_n69bG~o@jJU*EhT9PNy4OU
z7h7WxI}^IfM6y#WCa#0~Mpaskb1D%wV)o8xTHNXO_Q!hStM{exh`J4SAp?F-Vxp#9
zt|q(DNl4x7pT99I)Lr(L2hOyKKM)|2U%<$k+m^Tp6ztjTB`*ARA~<demL^{;C*(L=
zDBcR2Ss-1Ya5IqMhDIRjpbePoNnAJ025)^OlZu}z(&SHZYlL&OgmVxEMj`>NN`J%B
zyddDJPTi3yn#r4v!xAc4!XG-vmV{1^l5t*$oJ+}jG{Kq1v^C@F@f5ZLWI5Ey7AXp7
ze7{Ub$#jP4M@(m-w6&_-B2K||4KK+XrM|r>=HiPPVVjaRugu|0${Y9+-g!J>)N!hz
zM8rJQ;X4>C$k<eC<|l|Pp4mq<>IxSP6uXgke%0{5jbjDG2D5XOlG%bpbtt=>#f$NU
zjFnmuPI+VZQt?1^`Psa03X#z?$e`3KH<gB14-yrw>CSCl9-HvO$?SCxORlOkrAWKI
zTggv_=oA~$;?qi2<&MJBp2=q7iF+*>Zr16Z4>;Bwkxj|XXF%lo!PEY>8b8{dVW9RK
z*QuH+S+F$)(8RZg*mk>cl5OuaaYo;A-Wt7`>ECw#ULWR)*TxWpFg%c#Z2<d%dWq1H
z{RD9@T-oKUBp+wamGy~aNQhm~r{-pSL%S$$Rj8`~-D(tCx5%}<HP=ra00kBy`jZAL
z$IVCpmr2+`<y?Ov7YIEkYvK33k|m0+cq3z!##sftYBiCJQ{2#fYlD^ONqE}ThU6j*
zs|~Gs_HSm~WDb}+?N6@t<q<ZX_YU#lWo&3eKZj@R?a%*?8EX^~o-$vD7kU2fH;sSM
z5pk|WS+<gomUeks?~&oG5KYZlwH-|{+@4Snq^BL4@D>4)|Bb>3_+z$m%Dz9n!F}h=
zBsq(h(*-uA5wp|OFsih$qbE^C)fJx#>$?zvhB|^|=uvWZmW)jfjLHtED$WpkS`%!7
zo9*q5jt^e$AMWjs4h|1a`r3m?{WHEkoo3<fY&DdM+*&gZzjbb_ZofmDS+kpA6?ffQ
z|CS3^1v$5*E1hXwyOm&1u1)JeT;gNZo_fB8a!32GPevve=z2doFY+s5H~s~%JaWZ0
zZooiiba|akuT4r`%H2#Qg!h<D^-?i+{-l=&CaU1m-V>y6m&;*LM|0B-;x%uCGIgil
zo>#79DQN^-<YAJcFvzV6DQc{NbBgLMcQBT3_)~P>bgAfGgFkRfRc|~vbI7V=lhKgm
zLG}+;<FWhjQO;FeqAp=2sWWL>%er>KA3vtJHg$cl6+#y?yz(jq(NmurjMWlVWj9a4
zUyLvt7&a}iVj|!P?_(N0uNU(0PO!wWfzQ&7TPB5)jOn$c^jLS1O8Vm)$d)<`$?rm&
zC2TBLLU|Qi|3G#cV+!ra7Ytinmlm1@k~OxVgbu2aTt1yVsr+4vlWrlGX%=Ddf##d4
zQ8wcg{g;r>=n=!sRS}`^RBI$Mja5IP^rie=314as#~sRE%HNgf<*w!{Brk608}8+o
zr6OY?TFQUF-90>c`>HOe6BnPy=gBa7v-{nCOF<bw$NnBq<FYnxl)lAI(@d2){N~{B
zxIUtmE_^|y_1~7_s*t+Xp?ih!;CFVGmp?*Es>eV5v{fYM{H<|-)JUdEm!Vep19+`}
z@wlatQXR?K;fRlVJe_Dj-S{04f|}C8&2a2}n6~<0pjHr0W{Hq`s)M|2O6)A`H6)%t
zjy5}PI#)D1S^i3MeGHF%Y~w+{{1rlhEC#fi12+m($91$F-DoW(DdnxFGvO5$){e+5
zZWWLH_Kuvspu&??hRw!Tp%dLMfY#_NLnNNGU9f^~<wCP;$wniBb1M!8wVrq_36P1L
z5iIy`LVZ$V>)!?UAVo7&dA=wtTp5T8N^Vq9%lvsX-3_clRC9U;12Y6Lv7kUDegmqw
zh8|s%>Co`@TU{$p&WdR0MOd@i*w`o(Y|6+Ne*<9qsN8Q&IJ)0aB$)2e5I%aCgQjo`
zxN5Zu;cCbjEBR_|wIXr6<Cru5>QOL0@xHskEgUbP&b#c!==iuh3(*sQFV>7_srpVa
zU+9imWuIN2ExKTIg8@S(6O?2ID?lWNF8)y+uFT4x|JF<YuX3blp>B1esEJQ<pnh}b
z7XCIp=a8>z5^fCG+n+1bwp8t4-e1${bDPWDgt3dBK8?O$XpqCJDX5sZM?46-vUE~S
z?NxTFDYUB>lGb~41M$_h;YZr7i@f_0a}QJl15%J}5p)npNqo8aT)g$fGW88{ykpr4
zzv|kA4mR&JVqdP>3`M>UG({h}Hm86qog@&%Tr_20b{<tcpL?sUUv(b|C~Cb%>`Mbh
zZS7S3^0MX3M40bsTW;>4QhH04?mYN#r-fpKI`)V~s|Rj{4pj^G=whb|^`^6Al$GRa
zQro|*Igo?Uqkuv1IUvS9rIZHxsm~&@&FA%*4nl2s;rj#4xh3d=@b)CoupijJ+OSum
zYr~lVjB1niTSeFyXlXfzy{YU|wb@vs8~nRP^#%b@33M{oII7z0yas)RTESfiHo{*z
zw1EpAY=gga#>8fm3BOQ~gGD||$D?Vk&cUzC4$G*K)9%UZR|k8eqy3k=KkUEoWV)S)
zVzAWB24j(2<8Zo<hmK8#!8|PfApwm>wrX(8ufOc$*Y+XONx^ovsNE0<b{^R*o?NEo
z#~2&8e4EkX^d@&dHflGBU^_rNBCNaLQf&8DTgoH*2wTcyyVaJ`=<a??X>7OJ($iQk
z*UA_JtKJdv!ka(SG{ee6G1c#AI1U+mL*!m*!XMh|!(xr|>GdKhZ#b-K6Sp6hq111B
z^Jqf<j&7b3r22yGvLT4V!!W_$vEmIDfI7@LrBF+ETugU%19ZaOO}ceAxufoi<d<bq
zF3Q#pb-`P7IgKF#n7@Oo0+!uaZ11kXod)OZ_HEI*h6!x?W_JvaYI2vOn$(Tz;YJT*
zBrcLC(K-))J-SGWBuW({0Rg7+GxbG-!a78dgg{it>P6AXMT#!efVVS9r4diJdSG3?
z>U3S8{Ak+{p=*sDD-2aFLi92pze9OdilG^b1cEh8qTM$KC5L&0lAleIGeufQYGSY6
zp6vfHf?2{0vtcwHpi9cyKU$~$*=N~jpCLz|&&wgzfoV;*GF18EYdhrCo4tzDh1V{;
z8Ue3&yOzs&nvLS|FGHts{dSoaz;?Lpue2UlSyGJ1G~4Y$esSgyt<(wm9+<_jeF&y`
zx}{3lG6QcyUAuxLZ*3hpWp2|ENtq_4Tr_-7Z-ucJ0Q+~-{4}0Ms4GuO2eMzk>4S!R
zZB4@lv{eCjuBiq95mZG<PdG)|c+!w53hKvm?3iBAH*DdjL66#hbM*S#(RVLjf3y3N
zdfY$meYVWh*wnyq=x>sOJ>hr^fx%bDE9iH3;Qwf&D3}EF=0T{bc^Z@`Dm)9$Ky<2b
zDb|Nc)DIdg2S-0sPi=ShDgH$hy)S?Ii3bj29_S(X{osI(Kq*i{NK_sW!&#b*r^^Xo
zMB2Kcc0<f2cJvHFP=!@E1fF`aZ>Y<;wY7s#&ftLRwKLLgt{O4hz?azFqy6Lk6LC}s
zkZK)I(CVbFpn)r^n{ny{s<>Vq+T^Tqw4cCXq!3W55Ayn|OhSg}Zix|CsoNB_4qFqd
z9W=}5WPf$dEgqkb7w`3O)YjmnDu<qCVtqNHV6r$^5{zYIgBFU2%OZ}AYogT_U>f0y
zjFm_u3jw0ji~`tv2u%wMZ$2kVM+XM1E2XWhAQ4c<!fXk@)wMK98@iU(^2F8(QaaVG
zY`1|hr~6C$a)2O1hhFS)AS1T3m3xmytul@gm;<Zr2aNWNsY}(ELc2ev6o|44scEJ*
zREI-FM+U~Peo>=9-InUp4)Pqr`W<;u5AW+*H{m~Y$KAM6zvId6JMPM#`dyoPx9EJl
zEYLiDwXSuo)mczIXUM3$@`S0<ZI&7{n<T4u%++qwHFyuK+%Z+U9dO;GV_oZZkad%u
zO*Jb%V?wLeIUwBstvv*OHdNKmt9V@0?1Sfe(Lqk2@1vjZNMbV$qRbo0Y{cO1L~!E|
zZgNM1yCX4+KRn&+tp}*U-MHPf9F%G0pjd~Uo1PUhlDj@HD|^&5?4svd({*+q+w)!<
z&DBRC@_f)`nAOKIIT5Dh18JkUqHlrpT!B!5_oR<B{rxfi$%)A-%}=$beY5dtaNY0B
z#r_X<|B7UimYb?uwcZaW$-I2{b3z?FEQ_&u*c#Wi(Ee{*{rmdsFX8W_KYq0>|88$T
z{_64LFaG$4M_)dA{PkB~{qgY^s@&u4FTQ&GhiLm2eRlr0RC6z)=nu=&Wwuy0lxz9^
zFZxf57i@r`QSUR7yd=@Ofd#D^H2?w8CgYg`nyriVZWZ*K5f?6@W@A+f^xM_}DRkOO
zsgu!G#0DPiSaLRt=c`YDaXn93dzj|uZAEmud22yH6m5lyMUk}bC8Ah#Q*NID$mLth
z{MuGR-7xQxqOH_&k>c*&y;&|q@s1a<QPmtNB#_RMh)9ZMff?LEvSbpuTZ_T9ji14<
z8+QrHt0|lzmp=Ob;P8vbcwL)gw|jDO)W1sNcZ1$%Nj6E(@bgX&Y}wa9auuKEg}Nu8
z5op6ye6jz{+wUk(xVp1c<!PDVBMOb08pA=|vPC&tX!z%4_Kup2`h-~~eYatZyHxq~
z?ZL~Jg8??W4!y36Zr8Ej^_r<bkEG+hWxp#dANF~s4$MdI()PJr6!AE*v9isF_cNY-
z<;$;0k=xf=5Q(2`yq9g&iTT87R8ZMb<cnksa(OCgh#LfX1a*fHS!iMk=#d@P?e0?D
z#YK#tBgm8jY1b59zf9F^0FlB8jx-Iw6@fk&bpgpVnE}lSI^e}c0?qMI;-ZK#s(zFu
z5LlZs6=CWdTST2v^z@!6lIvIauHI7WJkSx_)_&aH+H%7;nt_4{4_?iX(48%(i*&9i
zVbDn6n9xQRllGa`wlvf5qioamfD&TrBF}ixQHm3c;`w}<j&XT=m;&%!QbuL2unicv
zDm0@Oj^+f#XDC|N#tG3`k<ak8p52=~g~d~KVjZw_LE3SPb6!&Lw7uQEKkvUhINTrf
z*g9f9TCilg{E-U(z&fRu2d@rJe%jI0KbK#s^3D`@K-c}YOgz!}Mt>mHH9V}fwT*Zi
zYv?WcX$N)uo47`lRU!a?25i^lVq-%`?X`Pw5d-2&vgJ%9&_tKaWhRLEwP(>6L-%{U
zJ#q^?_6igU2v2~ESyNvhd0%DSHAwBDhP;>0W@?i$=GW%t^XTX7R~+YuNY-4KrFY&s
ztwRC86txqg6aFpWg{Zv9ms3b5i7+^}gHWJ+tT+<|K!B#`Z+d<nUQEO}CfQIq&96*g
zedy|Yhy*A<rX@34C3Jxu7e!Le^9&V!r>O#6IDTcU`npyZOfr6l9qG+Fo5trO7yqk;
z>_2)7F1hYUK-BaNoRS_n1pq~^*^iH%kA!l?=P#VkjCk$mF9*F3W_v&s@t<~MVAdn3
z3h33paZmmX{%iX$Fr;UXP7dP9DX)%MaabJAy~YrBnE;S88X$Fg#FtKV_!?V0PzU|*
z`$ubitBjiF+4*35Aj-;uYjd4`Dw&@3ol?hcivq+5whCaD-RdTyh<?3TTMO0mhP%Tz
zW9@YKx(v^NuGYG7SG(6^bOE_-e0WpK4U17N>>iK^polFUXycgx1k!<i!ha7>z~gTF
z{r1<}+uj-H8y2$|<Nc}zbA0r@0-e9$i1bpm)Y_4gjLd6^jYKXEmo!B}uUL*3d13Yw
z=c-1&`{tl$@fyin;2Y-?#LN{3XX+lxG54xyN*i>Q;4*xgDl~o#s9{+GoWnFgg{+n}
z**eFp7l<yFbB+cPae$I^p~_w>JU)SM#WKqfha?Jt09I2C=2<eN?7FHAi53;%I*G1Q
zMQ)6XxV%tE=^BriI(o3oFg6Es;_I#GILDT*5<pUlj!{>vx93E(P%CLx?Nd=BSIKlr
zv-&=XCVBSx0=mar9_Rx_qc0bH!2%BC7GumMLeK_e5!4TFCG2t%qYw>}45#2-s)lh*
zl!qc})WujvNnEHW&MyKT%!?eel_061rZUtk8E4mO{pWE(6bK@rEH7r*CP+~hB{nk2
zDfbiQE0)<x?ga-LNC}BCWbT{N!)P6TuMZWpogD5TACHc94+->j00yUe5i7KxyjT1p
z;74r{Py_FDOMNg{dGzXdZ}ivwBfuW>B0itRYSu`A_1Cxdj!yo+ANJm=k)UCMJtW8b
zdnX644@HrI$J}9-Kv!yt2dGac2=Wuk6Exr>^epm@mccvbPlux)QFa(L7E%!h@t7uv
z=ybxaz!26p<~tM=e6HYeo+H;C^^qkYh|0%(FoGEnZO4MxwQ`5jQ6XWEf?WDcZ5I5s
zR8+NY)FpT5_635ca$mkZIojRZ7wDZ{^kW69!)QEEAQ=5q+r}W|EwgF*PTiD!d#{5R
zvo3<Z*W97vO^OWoCj7gjOL(JFrFTs2<zj0NPS7#i+31%Td+F4B2{%c9?7oCH`}ddZ
zr3!x3i^0Hjtq0@`(DeSn+RJ^2t}fDP67}I`_byLwiR9&_s53;&NjA=xun`bsC<CN$
zsZPm+g&mHRLtZ2o>Pm+qBQ>tP5I4w2kj4OK^X)Pten?>|#a4hgjc7$0(;0sjY-f?2
zsYxj$2)0P6D!Ry_AzYahX;@^892&sK*ox$*6S>n^Oqcmslm8|;hwCIQ$LjWovm{@Z
zpgNd?aLCM@rvn4*RVbN>y_;D_&<`*VF83g@HR4LaLw>*eHz2Nne~kPd&7x^-lsSj3
zT{_q9z|mQSwr1ccu^0lo542{K_X4XoK(S6`-`yc{PO;F4Xdh4DD&JQ8uz*)1co5d_
z=|3mK4}@a}fN;xnv5YNvLsR28Q<Rm0>1l#j^U2HO=rS%+%-c-lf(zedy4Z`iQ)-ws
zXB=t~jx?}E{4*_$=(>3qVG{;n-J)3q>hRaatbcO+;&227hLMR=2tOW^o)CTxhCB`|
zMv*(kXokX4PPDeo%DX@`Q%Y&PosvGgZ(^s_&6LWygT><Xlm6?B$aZPgcve|sC!DF=
z13$YZH=`QyM~qF_nc$#oB}S8q?fvHX#ph)-O;5)FSS4lg&hv%3;p6$pg+2vb=F?`G
zfUWo?O5Hq=>jH04A6_z73aA=nRhLO|4ee=)lSO}Ee99!pvPe8Sdccs&%W216v#btu
z!duD#XhSfo>*<jTli@88p<ye1kDb0V2oUR!!+t}k2A#D24fdkT8LlgQaEELQ*<o|O
zOQ`gW)4<vypjZ|y*Ue2A(fVy~dSY@QE%5-&86gG`<e)+Fv~$NEQ2PC_!G}7sGMTqN
z%GwH+z?(#irD7A4(Of%fVSa9tgVnlW?e8A%R}Z@@eRR5&G4Y+Qmi_xqwP9r9p0C!O
z;=1g$!d;vti}A%Mo=gJWJPLQ9N8GDg8T%Kx^lhuQ&yDZy{rB60qkWAkqCFBRJBfZW
zyn__f0oSNbYEG=DBYt0SE=%>_fK1osT+l2?GV!cGTnK22ib^Z!fQU#0iy1zGM%dbd
zgR?XRB-u5#FuKySaI;vcy4gBIqt5!t@(yN|K|}%e?Fucz^K~TIPyyVa4oDZDgJJ=j
z0hu<Z5N1}o)>6DC;h+=aOD>w5w`#|(1TQhqCfZe~8M%BrWD5{mfiXe;U@;~yT~N>K
z#=oI;6FOFJFe`8kAlXR5w0+wZ9M$S*p!2Tm_)-aJX;bffutq6css(5^Job_%F~AiX
zRJwA_dKx;zP^u<ti?Pj6XZEbW{#2{VpFfF+IfF~yG^QbQ-Q;$PqIE6yA?+9L>VGV^
zqFvA!Z~Y@%w*y{7Epp!)p{soio&LK%_O*K=6p+<4ojx84gJ#n%xXtU4wZf@huuf2a
zs>(W^O73d0;8qZ+?(#HcxO1@s4_+sd2lT~vs%c&anREIBccoEkuknSG!dyh}gL1XS
zJbGZ3o)>&HsuRzr6DJZc+*A6Xo7t;EJbZA;GN7VgH?50q-z<%8ps5m#p?*Cl$+&OF
z)U@ilH&H6Ebh=c4pTUC5?3R!tV=dndgkZ`y2O*t@su_YzDS>M!JchwI^bCoykS(uU
z5xE4qg$0GL+t3#~zE``rQz<D+u+N@TiPsK>>Jyx{*&!w(4}a%Iv(Bx?ctzLyqA^YK
zA}z~&oC3iI*`}#4BIx><eVp_wfcqzj;NO<>9BoMz{u+?Vfr*qwo<|s=p^}wc&qO4~
zai{py8@%v`6RTvcbn(@Wq`X9#%rE4vrZ&R$R~fUIRrb$CS^RdOi)P`nnP1q?SniHE
zI3oVGEod)o;UV`*ul`JJC+JwhEAJ$+q&TZiU#Hh|MGekF0L-5x$W@lkry+S0|K!8u
z6F6@V9-&tpj1iYmF)9ilVA}v0_kts1s-||-BxI}Xb>BO!10#j$F`dIwcBkAxL3L#d
z>pN$Go=tgFzw~Q95Y~syW$Ju|CHk1~Yw^ZjK1a=@0K%;(Ish1)=Ox;?kZ_1pl(_HN
za(1fNpZttRfel@t-UtXL5Ok7eGL)S0N|ggS3-Cs#IYjq6T`oxExrQ=NlxJl*8IFt>
z8AzSfX;`Yaifn_Y#Z_*Mw8nXcesbADaWTpJWUS~rqw%Efx7fCd)y_lErHn5?$E)D1
zTo`q9d7X_fiagVr-UaD`=S6a<nrAeKM;8|Dp=6oRn3Wxf(LYrB1UrXDIEYeOl&97E
zLjxDKIvT6aOf(xT^JDrGNBE*5Lk<1+{g(WaMAD1Yj@$>SWjpopVt;S<Z==JLgT22T
zkKXJbjo!X_v3s&_nFR_q?Hrot!3$xQ%m75)Zry@Eq1ZQgsC9gPzpqWdFAMMy7>{wB
znX@7(FOrE1_pp8XNPDZH`1gvxhL0Q&$Gbea7VuWK*wG>I-9}=YV=$wd$BT=hJ}0Qw
zKfPx1ZLC<DGGTi=pDm-0RSKzrN(3*Jwk*Vgx1J}(c)ld81lUV~z}}m;EP7G@|K{cX
z3slC+f-G4v#0?D-B7loRW@bCa!={#CrJ~lIN8?whrgy*)3x@d;316{MReB(u@Vk`e
z9<4})oRm!Lbs>0BaR11gcsh)J)}#ON@lO!fz9<)?Y&o6o=({{Ek@v)gR2l3Gur-o-
ziQ2*$sC{9SV2%Ok<}_biD3qCP8reGu`sjgbTAFVQU(nk~k7fI(C(*Yc7_hdgl`6LM
zBQ9<F)8XtYbsid*`JV|T{;V+GWA(?l$#auG|D=hwHD>|vy||O1IkRSwo1wi{u;V0b
z@uUeFbZTL3TZ4!LSq9BN^3Xh5s@f<3Heqpy@2WIya<!A_M%^`ZQ~+z?yjgUEck)GC
zvN6(CQZ952dp#RV=90lr!DI?I*&1yP{B7JDIefzpnzTCji;AJqd(GU2(Y<>=52B~G
z<jop1fMOc9MWF{XW(TCw9eRoB+c}9lU4Sq(2}&+3Rd?bjQ6$NP%{D<m&W2mGEsk1S
zS21ieS^uK-`}+l?(59YHGpxQUnn&-7u6p>*6GeuB(VU^fV5=4wMNRGFX`)L`(vpLP
zsQwew_W_bX`})9`E)}J+EIsQt8qP49utD&JX?>joaAS#eO)PmZBo8Dl_y==Xo8YSz
zx?B*@G)NT^2*k7&&Dm95sd;n3q&?1n!p!4|UXWo#D;`Z1RlA7jle4z~M6j!3I|Et(
zceT)9?%vNZT339s)^_b#c(1I$P6fQF#i}p}ryU(w>QyL+w)7a~339KfwPx|FKU#ON
z=2geUbv&(VA~3yP?FqW<npF`0ny(--Xrg)p8J4u`_Q?$~tgN6d#0~=NYCf?`#xZvu
zUCx*{A3a{a`RrytXT|ec7a6$O%sM<ha4<n7WqkXE8=}eDK5B|kD9d${5frPkd~ysH
zw9C05l3l7eHRmPO@GhjALVAMBOGRAL9}8OXtxru-oq-&%D?4u+p&6hYUvPLg7@Z!R
zS!!=|nw4oDWJs#YA;sPhR}F*KuJ+8pp~KT@0<^6nxd-g*MVM)$Ri0(NQ+(l3lPtGR
zwrR!MVabZ+GeV4>SvM)xr$7Lx$Q!ANz4uMjs<GvymTgBe6UKZYMJ%u|app2IM<4;Q
z;T>Kj#d$(eGH8*R6ycj!#9b}o@ikkQQ&r$KF4GAJe>6=w$s;fpLL1~O@B%83JVGOT
z3PgxKQGMKN=wVmgk!T|g*2Aj#AyZJmL(s@Tn|`V)Pt)^@#q^r$gTcI_W+ouUQH(Iu
zL2q64<C+aY!B7(7gsL@^+Ib#;j;4mL9NMR*r|)DdvN6K48iBhc^(B?>p31ghZ*`|q
z?IA@agWbkod|@|hMnl2O*4ESmSof<Befk_IK8&Vm_Rd^i{GJ0X0=RHLx&cB9@}{g+
ztD4)PVT>P)%*Z-ai}TT!=6E1dkY`6dm(nV3KP#67%POz5+r<S)WWeGX##NHCLqQ@r
zW2jAs<40$Kfg&%^@G_qyAO%;jx_(+Hs&734yE$%sk|!lJjyBb*NRdF3NYo3vI5hJB
z(8q7%M0Yo+_-ab?RYVc!6gR?gj-U$exH?#lzP%ESa*~`b&%;I$SPuv|GEJx!vglhQ
zkcGBm*s-2Ij!;;wF|IDHtXdWv??YTs)#p|6Ik7fCU6zZ4JaioC0O>Z+na-@?_<A%|
z$YRR)+JEii>`JwJLBo)%6vfCRqIYmPL6A)AqCct!bB$yJ7qlkb46{F~X}ITy<lBU6
z{}aq;)HBg3N^mB`e3eOd*_T<5Fq@)UD&Gg=&%1x!2d|g6NBg7i_D}W?|7t@BIgMch
z!kI7B&cX5V{>j_#4qh;!q&8r&JWnV6L1n9~m6mFYd>Hf>zeD_J?^R<+$8$z!cYCXX
zOQZs@5))y2o_cG?e>*<ef2EG!x3ATOr@H?xSsY(0fSny=XL<jAnNrLhbZ3FoiCdGa
zLlm&QK6^tBRe4e3DyRuoVgh{k^5C1jkzSG4um9qN4gkUF-s`uACj)cH&e5j#`LpQp
z*4IY9W6G)9aa`nhc5G>ND$8pS0i3B-MeT`N<~cZ?4AhNF4eC3u)ItQ7TEH!eEp3o5
z7&_uD;1XZXNzy@0MHokjXoRF7x3Q}P{qCcfoWs&H^u<_!Ebt;nS<^Xtxmt;onn|gT
zK5RV*e<6<V0{X?vPWzIoy73vhaX?C$zUz5vbOI&HWbeZtk{a_qnHB5nZyy*?#a{BF
zjgI$5hi{Hv@9iHSzdkx1y*_+-Xu-_*QuKAjXVK;((1t#Wp4cd`1NvGu<3Rp6ba^?4
z@zPitU+PH1{0v1$kht?1*ix$>{hFIlb91J`(`S(^2Jy!!JUpTe8^~6N;<73$7=xg0
zC_sADzx**p*3m}BM$fo>7^&ey`nv&%x$-B`soJb}c*h@~?4BHt-W)-gEvg{mR>Pwz
z#N7T9L#7!~FCYyy?eRqsoVMy2$K+B`Al^97av}=__uvQBRsRV!`lDXK2M>VrzvOVO
zjYXm0=l|ILT*#BV?*m*>ex+y4+wH)a^m##ltxQq&eFQ9mv5gIE7jiMmm+wX*{<XRh
zvk|AFaY|jvQkPf?*BNyc;1w|Ua|J_ZYCX79fHUYyy@3}7?5L^{?nn2yEf?mn5qgEN
z_4)4SPYB9B|Hk~<GrwM#U;F0Qx1T>TwZAiO|7?C8m|y?T{Q8Ue^-|P+W!@f|U$4!t
zH|E!Wn_oww_OW?;Vt&0fzy4}|eQ$pKAZq{3y#2d)8=JSM=GWN#nwVdS`E@30pPRQA
z=2vQd{cL`{Gry*y_RPG^%&*-1nwww0m|umcU7EKG^J{5-U7BB4=GS{s``WzyRlMCc
zZy%XokIk<y%&#xaudhVyug%*(nqU8Ee*KpyIl|w75y}S-5X%{SM+Kf#3h?;?BNhlC
zF<%s;#Q+b=rn*Qr<y$x`ROeEh8elT@i7~=RuUmzHo@n+G+rDQ`q2}=zO<Wb}B601A
z_aJDL!Z~pHtE;aR*2C-SFkVFOlIwqD>y~r#T;dEC?=^PwDxRw2KTF8_lsh!-dQE;H
zIo@sX#jvs!B=nCUJxl&BiZ9S1PhDq#yy7wVKm&;b-tlORLKKX`s7x%ak#$L08WJ2t
zCZwvzkOdfZK;iS{j2T9VUyz@1%@n<@fwDVQ%u9p<wCQz(j5>u3%5pALs8vfLJ1f-$
zI~m}*z|{aQ55<xw?2qRATIT>*cnNFE3LNBRXERh&z!VjC2C<lWRvQ7J!U&sgusZ-0
z?9v4lzBoF8|0RQeXK-(7e8q+(42O<410)|RdpIl3pppdSrKH$w?0bzDweTV`*S`qi
zCd}4DhW}`}ug--j{{%(J5dfrc@P_Tdy-}~0i6W<xge<QHTf9fc+&?^S>jLhOth4gm
zO{4qHkO}WF#H&l+${@Ce#%-A0f0XL~TN~vQ_z$`#V25CFJfQa9vFj+lx}-$yB(A`q
zBsLPBI-ZIN7_z4X2H(KgQ5+BhgIcH~E8XDND!%U~nnYlQObj5;<=EKR%}#+{M$03P
zGsvBh50(s|1i0=Dw2fc_r1-5pL@Xpd35^;W)gx!dsuGzf`k!ZbA;_3|e~JQ;mJ~;`
zJ)l+nA5jA%;`tTuWu-iZrV~Z+xl)Q_-idPjrczP|!4pOGt0$<e>UpuL`qkOrBY(;U
z=ytcwTI&E|3-EioJp1v@?#Z7qQ1FB3(N6)2cZero<8sHaZUm;tO!caEfnN#^3v#R|
zUbzSbp=91gUvR0o+_nv#Qq8g$P)sX;GaniHzztzpZ+`-caSg02TrDu1*gT!0#l34T
zprG@-h-a?Gn@8w&Ntc7vRX>EBab5(@a-NLSv(&P1Yp@sFlHW4zt1tG(ap(Q`3H8DG
zvr+6#O!fATAHH*qqK1^}o}G-`m?6wVntg|6Kq>{{A}a#0H%I&59{kYLSL4HEF@Cu2
zeO=d4nAN1$QSgN_3R$I6g2WP3g!BW3qB$YSwx(Ku-4&4*Lk&{B@_KffPu0nQ34LBh
zFegbR*yRE`1D^VN>R`WnX5=yI_W-VRtL89ONo=ypPCJ{#)s7N$=B52GB|(IQZ~9`_
zH2LwFSup?|ZqxxF4}R=zPqhCRPfSW4v-3%IsW-lH+pT3KZ@7MZefX`8g{rsP`&8X$
zSkJyWOhE}Rk899iQT75gcM!s92gw(>A49IIVE?SC-6SIFfdNU3RKeqATI3mo^wi~b
z&;SPue1fC?A(Hf)n&gPdYO*N}wC6U5A|Z~nv!NL%D2rzL6$#6ILi_jM!T%B0-@nvh
ztL`I>Bc)}qSnB>b+52-p8?4d4fArS+d~&kE<|8;H2=S^rMPO&+*}RX04!$M(ra_>=
z(O-98zTG#?23ozWwt6{aIxNuYpLY*myxbps^ZNBm5bueG2?(9JaJVJ>=zZmZQRH7L
zNX6E2O;VYf!YZ%Y07VMM7DNL?Zu>2W(X3TTSn~;w+<_#N5yaPrvH&l=U9BC{nOzYp
zRy40Zc)N6PI8w+70!qwMwVE8^&@XbGl(tM?{TwJdp$|`$UH`$f7rzg;r;3>NpbWM5
z90;WMetW#%C!@E0MJL0K;~=o+kb-oM@R@(&+i5x<bO8zAz#whpB3jON#G)}Corrg0
zO)W~_9*7bUE5p#si(-*4RnvX7JNFatVT7_45YJ5;q;3M+K*10KU%vSd!@P<wmr$I!
zlurRm7W8pdarL;SU0VeppM7Tb0yb8*-d_v|Qsj{Fl;|&}JK5iwGY11XrX#hup^gBA
z!X3r$s~w5y=z<6ex|H4Cz!6?~0n{$v(WC-9u0P?9zg{jj^Rvw&&dwEa<$eo6K^+*}
zc(ufNX~jW&#@`+uQ*h``r<~J7(pi`1(?=VcXR2TiDo$F3S~L<IDde^popc+g#76$m
zh~%#h>=q*n4sBo-rx_ojK6<(%_wGiha7rq{MLu=$pS+6y1u@_h?mXtx=tRSyr_u8@
zF;M#*4y`;gZDVxK?2QL15fq%!so0mBoXWjF?;efbFhETPwuNR;Vs3Ukza~DZe@P0*
zHL+Gq3FZURT4RYPH3cm2AfY(FX5}t*AYd#1kzN^Mx^c$-sU*5m%Q}bAI{sZBG?&9Y
z)rIkaYOszN>DqPeh%{PU%-4O=nVApZ?%6E_m6)>_BrC$pXssfwk<E@~ke+Iq&eDZ6
z0dxmatpIEpr2Z5Z=`IOw+*e@6vcB+QS<_>+_UMBDS##W6$T|!w`1bPRbOaA=(@78=
zNOd~B3ho}|dR03|KLWcpDa$+DEY%uhF&ek+ktt`k#>~<#fV(vqmB*wLqS{~$oC@!w
zz#{7}h=KM|qO9#~aO(1V&5C;rG=qt%9X*q^D|6bhqpCuV13J8^zb6o~#EMOAqTq;s
ztq(E(0`;QvxDBIg$RV2L+Thl2(_G%Le2`Xn#A$;|)7HBCUiGv2Xc!$HpB%hG(>N3Z
zZ$y9j@3;L&+uPgh+Xgk&8){#b0BqY(=ZUUkE9^9l71J6A#_GQR?Z#@3yD(N!dnKOi
z!525$x^LUEKCnl>&UDI!q$&&vLwZPOYZ~;r20e!Du1$6!urp;t;*3T+-UpquDDpE3
z*;6XcU`Me>pmX|ogWd(|Z0;VLs_ULU)^;z^j5n0-1Ay|i(}!=h-ODa2{a2S?cTkJE
zYw255Lt0!H!rY8k9WdpW!2?9Wao6Dw9T^{{InFtcI@kskQLWIAa67C?Yix+isFwJb
zXewAi`wFbnk1ACsaN6{Iq*Lz2?;&7AdYPybyRg`;uEaVxd+AbI+R01-XLO;90RPi|
z6R3XJK>>Ncb?15A^aQvy*c&Q6Ds+tuZ%{|zG*dMh8D=_h5-d46g52~-^cZTsu4D@>
zR8y@Jy^2IaB{)QPg6I$}g;hmuSKpN&635#KOYtvGFIQYG?Qy7lS`QEnf@V->rc$M}
z!(9&-FoYErYG}wFF;m(^<dBGFUgT$uSOyBHQwM(tVXTF?V=f2;?pgZYx)`mCw`%O`
zKPNQ}IsGv<;coe<wG!K*GbREO#UDqtM4(X@^<cd+p3SF;XwChA7|$RdlMtKGkEyf?
z(T0Ke#ht;;XkCRd=m^&BLuj~x@uK&$IskzY>rX_Dn(sA(H@LH5l;@M>Y_3O%53M_e
zUWK{}KD1VuD#V~`!0+(2InB@OC`$E7&?^=3j6kK@GMrXK)f-*L1tDEUjC%#2)RZ%t
zb}O)PN;twBD(8Inr8u>Oidh0VSrD-dR=UQRL3d>$ZC6uOg3^UcrweHoPcBmkh_pOU
zR=SW*{`}?^x6!|r(59{Zd7KuOdVyB;eZ-BkKZk{l>Kmfyo%iAdy5&(>T6v`qn%C?P
zm13mx4E1s{dK-GJ1q`8Ygz|!4>Oav{)w9t9UGXL8;9b)~H^6hiMpQ&rbHdr5_V2@4
zMkaZJdC({WKtnA1N){JPvO>vIT`%-ddKA<hxcT<{gef}VOHZcm^3rAww8>j<Ef7rI
zF+jOUtY5C5_Kj-C<6o9(kxXo+G>+K<c__KXvXW`B$5t&!TT!emjI<NTyhw@8*oMWm
z@&!?TW4_1mN)~9D^V(m=d+y2_yTEUj<@M%OoI-@5MLMm`8VMG8(`3Q<2-STsPr+9h
z{$!Zs@c4~7L{56JwKYhmC7{po;ug74Y{E9eB-nO5iRVD!^zU;Y^sVZuUf+;OYZXq%
zvlCo$*DcRC%MF8gysbmjNV8)%38b?$y)gBPgaM?~FnNh8R;1cB*^^tD{d`lPaUqNr
z%=gK4`hB|KZNta_6c(ZyDMC8UHW=vd>xl5&(7@Q@I|#`{fw9rvg-1RVoyX_EW2*Vq
zW<i2tz=TpMv(-(-nV)ZMcD$H&C{(*ekMtICkQi)<H-}mK?qd!lF%(gFKq;jq(oP~n
zjEZ<XbkJcilVMHQ+JKw_m?l}iJimy_aeQ`$!OhQgIEyQbx?~UnPX6e)MGv%<xD%<6
z63lQ!PAzAzgx-ucWGr2sTSA8iuo0!e)r2^4@T4K9Ver7Fq-~tGTW9g+L002e4l0qS
zY31FVP+cQQ^)#JmjUp?{9dA34JKT;;_>Q)W%x(&4ksqMq9a4v^>|KmhbwRGtD_~X%
zu+)SGcfuJFnp%{hl-vknZl<S_1MEU17oAx;1fG7r!Rks_qQS06+v?jon41Y;-j?7a
zKw$u)e#KoMV-~!jTYR*8^6l#*a@fCDDQUB9j`qG8L}VrtEcy4>hx=|LWM_`=sGj|z
zcpQ`(jHfAp@MwUM0iu_RV1Iu?LYL1?y5)GGD57`jN;BU5HeR?_##jr_(Rp8CEc+%e
zvCL==kiTGLRsB3xSM@~RKpie1f28^%3f)6)(viyH)M+jG#_{u}@TD9+*!3r{5;}r$
z8)J=%gBHOPhe>0^2Z2zJU%i2N0t<yehmnpqP2_5v34AzLXJPNn+vxO~f+kQm64B`%
z9ywE?w~)wu$B(22pD8<-omN$vyXZOZ;?kkD0_7w4Bd1<Vqw#kr4-yThtw~yfA^60^
z5XMsX>Pit@L6HX`nYa1@#YpPyY%F|k#H_rrjT>qSH%FS>Jle4E8+aw|o<!SyFy+;x
zTR>nP>_HOLAs;za34n>(F#SMSu5}|ZjxXbMipKcSF`FFd5LfEn|Bof5{t^0h5<W#N
z_|-3;L^UU5unJ`<lx+gm8xnXmPG67h>LD+ma73jwIZdu}#oeKRDeC{nWPp>!ZbfLx
z%DA0@v)IJ*Os2OFDNbu;KT`}4b+&X<YfYl-MAP|%q#KT8C4{yJWvbqf<`>sa9Bx|6
z|A-z-9-(RVw2!D*G}j+va}&{(>Zk-a<H&-V@9>*XCOXDT|38)k9q2`Ea2{P;LnERF
zA#4SQe;RDHY)5r7aMf)9JpbT8_(I(5zF4a6OYDNO2Ct`4R&}B|I5Xe}?xoswCBpTP
zjp_=FyM`u-f~c*iHIDRij#o#aE3v!H;ws+?g-Rz^^V1{(y|%8y{$CLFOlOv-o=!0{
zgW6cNH@a{-*)mc8Ff3nji3A8Rp;1f;VAO|__kz996O6T1$`lQL_+qs_n7TQi0p%Z;
zkWT^p=n+aMI*R!uijC6{+~6<_OhH;nHqlSE&bPEnzE~a|BgoiOVKg^YNmZW?Ae%eP
ziDW)l#~?qL^_3z~6~lO$P7(-Ac%_Jxm@=rT!Rs1w;VXWPBM~n!z(G4D%(-;y)gjg$
zFEEU$qHimYgA+w8aq<#TpBse9qJI<18di=>V%2vC8@p_n8{WPFaeHG6lmq3(POlL~
z9VL_H*t@Y@T;5x&#&)K4t7ZuG3UzbZN8*7Xz|szF_jenfY3Bg}sLP9>OqTeyCc#KM
zljQKH6@PIf$Xa2EaMU6itjG(<JgkY-2LZVRCr9()(0ut-mJ~X;rNe+W<nMFJd0_!{
zXNHRPV<7?vHitiyxqE5@5}MG-z%PknI$Gg}wk@}NZAZg=YJhK~pYY$q6Cf<#Z-2eL
z-CMJ}O9BEB#;m*az!<2%Jyd7*FQcRVleb5Qyx0W<Qn1q-ppADUAUMU**G0+_dRpNX
zR!T60yCV?;cal2WEF4w%zt<$AQ7c;2Soji?mXXNx%g!O}CSO6<=70#VNTv|eUj%%F
z7`!F>$P&bIM*ufgHqCKATO?loV)<g1HVo5{X2YM}aU#QfMij48A@oPlWQnn4paM;6
zUL@WTvZ0n;$&<bqSUF^bzmKCnra3hWIk2LU5L<}Kt*}(#kvp>>9C&jlSYYFes-PMU
zupKG2x^koLspA{Uve`8k%1uUJgVDM~s&~*zZ5UP&ft70aOjvn8IIHTYjL#C@2|Ef6
z`y}*NF!FYe!J^f9<FF~FggiO$(uB%31Y1q|V7>-wG7Rqso#tUexmIY=5wN5C5v>si
z-eiEKq`V6FZG%!dSz19J3za6x9Ahpiguup|TTuj>66~apl2>X$-F!gSQ+1G507@+>
zb%@R^1>6e6!?|E}f)15zRi1%t$K08BEHFYrJ634Oc&yViN6k5whkVg?fxpiAl|ymI
zSiA3>l>kL#V+1!x=>4d{fi0rjgt$RAF_Rets<}NuJ%<jahFCh}aAzEAeUgut5Z?jb
zBntl1yfD0_y{f$VE)?Sr>qp&@#&eA3`=io%QdB^&%s=rUe}9pneSqo`I787N=%!G~
zkY6UnnIc~4WV0dC^+><oX>JFjqhMRxQK?SD6eg)4fwWWVZozMlMB}H+*?g4D=8J1G
zH@DoD?gZ3wh%G2&j_eFHU@!pNX`c|3I(t20uxE3%4~FfcIGcnrvpjS9t#r(@gP2me
zBKv6jKBw5UpR2ylaUUZSbIPP9g7|bGr2xsj(=(9DBZVVI)W|5$$Zo}5Rn;I!F(_IN
zrUSSFeI<rS$GLIvEp-b{QXAC>dob>;qHQxV&>SjQOlQkkMDi;2pL2{hLZPw@d>4>X
zpj=Q~ERqj_p-g<9==rcY-VBTvbR(RO0=l6Qa$q}_qF^NRD9>j!UMJ>LJ{wWtowg=m
z6Ch1RGTFqlswV()7m~tNo7Xl#rnKqIDjwpg9^&VPjT%LFPx&sLllTQfN^MePKp0l8
zXoc9u3*%Kr5fBJ13&;+99mN_z*7b>Br%avdmWjuU5(C`B{LYqBY(lj@iwl%Fm5Q`0
z6z(Cz9%g#_K#naalhRPXG!e}pW)!6#c5vvx4{b&OgNOQqT8XA8`VyJoedXYsXhS?w
zyk+~m`CQ@;VbAE4@zFqCx!~EYD_nQn>dIFSPhCj|>^Y{AQ@{c=xYw-vpX&fJSh#f7
z&D@gejFbt94a+%5=2-@XVa+jfnU?-MGzv)iwgs{9zJXi})9axEcxa8WH3h`X5(+p7
zc^EK98i<`|@i_=9Fm%y^Z4nOh1*9&x0w6W1ZK1g$nS-=2TQH`^;O2l$PeFt^#W>P<
zvuXbLWN&xx&yXnd#pv+00=vGA2EO@d5GuC&_T=@e-IIeor|e@}mgHmgMOCx@#X7mp
z;+efQokx4MdZiS+!y$<_HgsTojU6F0bqab+`wAXM@Y}u;_>;~gI4kXl(0OcOlV%h7
z)=25wkFPUeJiqSDq7C_sCs@ANd~V{rb6x@WtC=RB1ox|%aqz2uirlXl@z9<@_oH1F
zRU`x$)z0*isR{w;(AF4G0B|_QJ;yMz6MwMJqwTGh)FbLTNVPaRXTO6A-lV8kmEEA%
zR(Rz^{DeOyJm`|2eg$>S0)|d<uS)KlK(Z?})o(%Rk&-@vN?P82QeEcoI$P!KG<}y$
zulx5(i@CH>JB4Ljh@3|AMWOgOL&d;VsTF!$f|yEraMP?CIU*N)rVoiO#5R#4JF{uh
zEvQ)(>pIys??W^~fksW6I^Blt&+D$#{SBi^^E$(tw;iM-@pnUja1e%FgWv;0kwze?
zpAn&eV)j{_DRK^gd5AfFk~5$!S<6PTj^|54-)t?bs1!il@b?P1-fXB)|D35aa1G|z
zl}>INoo-41nBj-DyuZ47!OTyR8}(Pi%~c2MrMOrE#>&}6ovtH`OXoP?N-uo4{1&vP
zWMYw2Agz<Is7SH-Ul%jK18N_~A8d?7vOSyVRaFs33lUZ~6m*C9rv~Lvhb)K|<~*eL
z6l|NS3WGsOjUxL<S&NM-isC@s#W_NxHpIe)P!q`-w$U_(<ZGwP@w>#B`-sudcYD7=
zC&^^A<U43dw=Y8pzI^&DI)+6Ar-!|lyT`|lkg8t=AyPm7Nv*-Ce7x+x+&%hk9~>*V
z@)HIS_#9WhR{?6EGq9_6y|z%iV&?n|n^Z%7jG9KjW0d^3vki}Mr>7G~2CgWE2?GN|
zX9YFzJMZkW8+nj9f7lNT&Rq$S&J_AVpLp$&n9p*OPsy`_+7j$;P_f(UIuRbN9kh2)
ztx0ANlN7_t5>bn0Jq2b%g8|Lhkn01USK`&K(h}hLI9Zg?)&}keljv%O6Cfm$6uG*q
z__{HX8S1zQA1Ao`Aj-WkJXOCUrKvm7@)YBMWMu6VKMeoR%TkcAz)xyQZWtx+G3>j}
z5C@VYU>$mFG=Y)7P^MtyNj*+r&MGQ9Sm&%wDiq~2cFWsffS!0%<xVf)*npSmuAVB|
zk)(>xzDUn6HZS7oS#%1IfR{kh0*Vv5Xm#Q*lpSzws5HXz3QM4`5{C46`n2M_z7hRr
z^e}pi;@i66f}x@}#~uI1;<}Y<s=7KDh76Km`Mq$MZe9u!YbDV+2<tGpJrdTmm7EHJ
zlKj2P6tBsG8s48or=RL^_*$|;&!ZSIJ_t031emB-5$3i`0D*r_<}~9eGKX+FGT;^g
zWJo%pc0rvKwN3Et8z3l%J7mrg&Do>FhmUcyFu5fXMronX4>nU%jdr-Nh4OgnFx_4{
z1q&BNkr?=sHW|DFeY@%R1IzwDl?5LR0{dm*QMOIH`>?ua&z@C4qqaTYW2Xjlq}jqy
z0H^un`lk2)zzUFyL|PQ-OL`K`l389{6H=U}m&`{HQ6P|}q4t>CrR_Ssj_UE7+Fm1&
z7Az1mjDpfwW?ES3P#Ze8TArZ=;Y2|IaX^m0@3*MWBx_}tUM<n*%}R1PlWLAYr-)pD
zb=@G*EJE-H0vV7=)8eS!Cg4qmE{5fh=z0>7C>TaTO34XV0Sl29i-wb3N2j15yomBl
zmPZG?_+660&63X&5Jv+21imbgFXi*H#~E5LlPqQFG)POKkr~PvS!`W8K7jLFL5eul
z*b1s_NOhqV6>tV|L9N1{T1FH*S<YtHJlz0YrsZUUilkSpu{Y{$bV>xT7Pv*o%noH>
zl*OST(<L{xN1#M-I>XGOY9kpyiP*$j7t`qKlW(wZ!$n(G1)7?^AR7HX;Q~6f3ftz2
zV^YvN%JZ4Mm;MT(znI5|L%|d^b|__7CTiJiGgkkiSmQ-~WE5{si$UqBynpFRb8e4j
zUh1jlM;wVLXPx+;s9NEE;2n704<uVAR<0r`wd<&DEnyi?L35X(NS?#<j};WItAl->
z7itel=iqYE9yR|@qO>bCwx&4Um4K4Z6*2>g;8?GIWyg)@vdlz{3*(tE=%@+0B|*O9
zC?3Oep9xk&Em5iGL<1OBhG~7x%D4g!XkGFKz@CJ;-0GZ{2Hao@x^u6)rlo+5Yf8xL
zslc@}+?m0+s?7^UEld+}^oJ~s0Qw_cXn6xA(gboQ+mzNxBw6UETk3+M-`j=&xMAX4
z!I9%WSjNX|?zsVQEuT>|84KPsq>{+?`C4JRLS55K#ZhSkQ$W5XNkU$jssnaPLBvv6
zCAGN9grvoxuG=MgYJXiBN3$?&r_x2Mm<p-{+V-0!OAuHmq)bTzOxuQezjUqz%>O0!
znFWc}(cl%t2t)yvz0~p28Dg4MSWo)_6MwuH=(+CbIy-x)X<e&RJkK#krGiMlbk%jn
zyl6B7UJI2kFcWG*f-TDg6^*Oz;bjSpqAeaARJ+X-GH1MaPlDgYdoZTOP&C?KZQkd7
zmF%zx*~4~0+D^}i)nJ3kIU5@{zcr4~bh8b5Ox-(a#2&rX*um7_Diw~vWMeggm>pAG
z(~ng~U;8I?W%#AA*B|k7Z@^l3-COgw6%$#XUx1|rdk$<{7hSrUfO^{Dnyw&@l?x^5
z8fp{_J!>8xT!GHhxA%s>?k2d56qSd_b(=!g;5S*!mG20cEAr_SEQd(;4NE)}VXeX!
zCRV38`a&Svr<vS+Gbw7{lMWeCczBVSuVj@EZRIvG#RQU9aVZ7jZD%oxUeEzYelvwL
zrA6YpS336<Fm^x!SYqg&>Z+?`dX2;lki{U7N1{aF_vQl<fDCyq7$s;Z>A1<YH#}e4
zySApu&^STw&4tT!z$J+5j`$DEEU-S9N^VMVTVA|lF#|C?`r7tx9*3;6l&Cn?qS1PC
zRMr0b+y3@o;03Ti63&rX8L}uXTVR&7QXBZ4oq09?Y}H%fuE{cLpMEcmxa{r8(eB=U
ze_L;)=)>M`$ICHfx4TF7FkR`cwT+3V^tFxe7|8>$ZD#YIcx-|*Ty;gdAu=5zDYs!U
z2LV^;(l@6dTElp;wJi{thtnEqtLGJ|P}zLNK!iH8Nd@)~U%%Ra6&P8aEebVIS#qrs
zv!ZEg*|FwIOFDmsVg4Cq@@STNjaD3RMt4v^tN2wx9V^1dNE)u<YqVq~abA8}j>&`^
z{hab_lMG=1X_YMG2BpsRY?drg-m|#Sf<dtDLb(Z_%o+~viF2NA4it4pG%X;~zJ~{g
zf8Blg>7ncPAc6zeRt!daalskhHp|8JG%?15lcZ{Q+GNupWQnVY5sk~0+1;@7y8{5C
zL|=<jR)(1_n8c5i;B0I~?z>SD+S+{&B7wSHvoc+MtToR59<~FIBr&|8HU|%t=w-6_
zyo}BZMYgGPTp;BcgXTz^;5%Md!V=$lTxo`tR}72A<wCk*fK(O|rouUg)WhnEv{E<h
zg=I*lB2GPIsAje6jsV&xMLcrNZA#macW+4n|3@_r=L7J?U=!#;bqY?^k@Bpy?Frid
z;mzx#lSrH>_21o-*GKl%(f;wt(ZSw{Hi}0qY`z}8KKb*}>+hotaVk$vj`}*-wA(U<
z+3P<V^h|cpz7UxETKYBj6ytjCxF%ET^@Lvc)?U8;u8&f+EoyoT@f(DQg~p#m|MBZ`
zosc0Swu;H<ee7W1_dwq!{H;d-uobWeWmur^4W^w=xu8j>Q^K{>3`Snzr5rrb*C&aR
z|B<c3fN|(s=78U)wVm)Vt!3OJ^Hy5K8Dj+Q<UWJ7Sdr?&zsH!}>(r-OdC1P9x|Lq0
zT9fUAA_PqHq056Ub?Ku|r=o%ZkbsSOKbpb1sC%~0rj9e%oWhu)S=*S%hdAi*cJSto
zz`~t+14d-907E+hgv6oA)GdKi584~;CxBPqV3;+>w3ve+F!K1T5UH<gVVq9@8G=u4
zxZdFSCf(?87pArFQK02s`7rPYxm=Emfn)E{d|-UY@ej^~IVTN9bdFe=!!X|ERDD_m
z{}|6DZ_3EQ^9|?FvCq2cQFJ=BC(%EA=Fm}G0W@Fx<Y(^g?g;<%KKfsJU~hDHwH?<^
z2i1eCTU>CT^e8^=KN?1K9LLT%%peT>$DqB&-pNxPh0dHEz#SYk&w<A|8ow(-ZG0z$
zn)=-i?(CUBBkTy|<JF;Cga`p+UUVo!O^!)r&=*#^TrQtZMv^##XKl1AO?c59u%a^(
zpgPwQ3a!kkL_aV>h<0mQjN)Dx3F$C0!xZE5EoEh_Pzv+q4&!E~r1P*LX{QnLA2~1~
zf|++Q$(Fl#%k7g&xefE+ZXr1p2_@f7&(#z{2c(%n0Dw&wrHu|Tq##sH>Dsy+wi+<m
zH`B7i+yO_Gpq8>mJ!y4Ejzq~<;@u0Y9ch2VN2qbL18Sw4!-_lfxu;g?syeHjKdi`;
zqZ)H({DE~04w}ddy{Qr>wZe8Uh1h8Uh{i5_mn05mgpra!#$*JA_uN-?Ql}5A=rlNj
zOGC^d8|jY)W_A>O#Q8nAE!}%&<bFD0XF#S2dM7UuJuGLPBE49s(dn~n9<&jPe%8~c
z7i3-s%3Rp{NhN3lg>NpYy1Hd_E4<C(l+Yd_R9KDb7PjxcQGJPddqr_&$R-Nu2Z674
zI#^GH&7QnIC^Qr%qG50wMmYM4LRg&Hum-Ple{SFz(SlUwO_Gl4JmV&3K#WD)6Y@i<
z_z8&v<SM+igOJTd=;5hbHfg=8+KztNboO1(p?_n7CQP7iVZsNv0t|7qV)^MbC7T0v
za{BJ!jqXQpcF_>;_%Ct}#?%bV9Q<a|GScyJQRENpaM(!5SD^XGVQ)>V_@qKUrjm4t
zP9Vl9ohLTQUzVtgq`D>$3i*wxZXw#`^xCsw5SYZb!!#6I)rv){2?$-@mq=9}+evb|
z)Y+!w(oas$b?Ft6@Y;>gur}DS*tiZ6^T-$t>w5Mz<6>)lC(8q65kj4n!nlY|S>5i3
z5dI9K?iCmA*4Ni<@2|QG>{%G@1~u>{P%V8GYT4E`Yq-Sp?e%Hyosw^f;3eT;Z5-J!
zeATSnO89p9D1sbcda5bq>LnEv*DOR7PTSEQH2HG>aBm+`dtcuKj*CNW>1|Qe(BIl4
z!b%Nzq*ml(R35Ix$IQXl71X*3P*MYXc^MCVy(-w2x<J%jko>YtFXJiuk|3~xP+WWJ
zv%;Jz=x}18@B`Jzph8Ez*5O)~Y3Z7r`Q0?czKgy|zvrGh4VKp2HM9dE!Hv=XheQ#=
z9m6|=a`_!%qci!?w4i{Ey4#@CoA&;1LF$q#SzD8bt)0`*L8EP@T1!7T7)Dani1{5K
z40gdVPy|luEBRd5Gy?!n(UYhmVq!3_$R-R);qXkA<O0?Er(p&k>@*w+i9dp>a0II&
zisi^3dTHH@Mj$F{ffYbj!URI&D}&Qj53Z2}_TTZ$ldyKp5!P0nrK*naw=`i23%&JH
z44#Ng6~6pCXzUa=TdevksWFNvxme5MAi^Z|Cb1Oo*aV3VMu%R(G`1TBWWbH4CT}YO
zKi<kFY?%#eF60K#Xi-uH=@lSL@LDo72`;hi7(Q0W0J`~ch@rc<@yZcyNM!w~1OG4Q
zusNJ`gVF^!@lB#rg&o0$j_R9i2xx_ha~Pm9rUa&tLf4_-QQc|augZz6Ot=^fN*H4V
zW9Tvh0-)s3hQ^tK^A+gkXYn;vzKG{@FfG?stC+#DyjU*K(}n}qP9YSh<z1fuKND-N
z7Hg0L)<rx)?^`~dV$ddIq=I9viOaL8){K|y3SH<=A(#$D3R8=s5b!)HB%d3;wMS|V
z=wz;Pafj%v77M>xBR-7u>xN@OZzvJ12?CRXb)YZ_>=3G{j@A-r-@9(a@LTA?Pel+?
zsqRvy57l$a*aA?o6X~{#Md3#^X#^v0i1jy#iwQ<WDAGyQrqNH&`ueZ?M@I)Q6cqw*
z4!%45beecHZ`Af^D;d7r+~l!heAa04B8EeP_TR|N?0<=&N>^Kg-;qH}z0FxIm7ufo
z)t<D!;`66HXP2#J#5X@wmvwf;c!YjuR$~6q0%80Aj??wgP7N(l#{+X&M^qy)v>lkJ
zk}CAzctpR@v!wF*yO#&w?2UA)($}y5GT=M$e43t)Z6Yhsc^sX*d@*{lzyIc&gTogQ
zWc5KGsL3=3!jlrTg3e<Wze6W03N$puK)8yeO@XK?(-Nc}il!<c(qfX0lL&hHylf!=
zpppK?VlgkDJbZY%JpVPFPUEdvPJi>_{9$>KUyan4t?_yKr*!h{%m4b~t1ll7;NG@z
zf^h*-3dW1E0_KqO4Ac4o6N$6t<iaA%y@+K4O;Ox!j6nWg5oI<8`WeNBp;QQvp%%9(
zo=ns>LIfUMB2KUd4RL5yFY1|Oj`|xTWQH*F@IbOe$hgC&op8+!sLFgZRd$e<;QN~z
z&;k^%dyl%n#<=KC@3ScKP&Y#vQ%DGBO@rn;!yR@VW%H~@xn)f?9DqI&dMJBu-j4QO
zzdbzBQKNIto~OfxPt)uj1~q~RJ_rWr5{<yAbMcLBgnI=!XYrT<7C?K7+etzF$0-dI
zNuNWEN+2rHzwF!r@~zy5uE`|Pk*lFO7!3!8#^@6q$@%5M?r|TsJsYfzM)5-7z*C6P
zGwS!%)Z;She@0)2sC68`VTP$HxEymtYz4A&;3|PjJ%eQf2kx`<y^e!KcoimVJ>ldS
z-W=^a!;lYDu<qI(jSvd<==P@V9*tmKe4|lshh>*ka<D^P(JpuC_1mNUed?3DG!ljl
zlpDD7Qr}kZ;#FW`A@3vE)9i-RG0cYBTZkF3i|KXEg;(z!8mY`wDv~y$DvFR@bJ^8<
z{%fG)5M?GiyIj4mH?NNmez0o{o;#zE|IfxoBwT;$7TT>C7zpKr(N*L-^MXq=R<lfV
zC!Y1wam~M92f+6dK!)i41q4ia$IgK7162HwdIC3_buDhCzHd*}*X4n@5ozDq1@QgH
z^Z|602e?o&CK?8-p||%<3ecC|jfk@Ft$qU3xJes|6~5a)86Cgb-#hsBVE;v5ZwrTc
zaZKEGy}$1ty@qOiyNBUHaR{f%kXj3C?ZvZa{%0F<T@S7;Xp}4T3)Jy?kQ39HXGIIm
zoyv>@Hc(Dwt`rALtc%zv5uwU0?hNe1YM!F+SJ6@Ut_IYCZznBsk+xZ@hhm0TNLrKd
zB4ifmrY!jF{1q0gzv|$zz&dO(!<z8$xASJmx;Qa34V(Y?<K*Et1+(ww;vk^sMlKE&
z2&%F{8(gCagnA}&z6GQI-A)sFRUB)7qiVUi+e8>01jj0!3CNSS2HIRWYxA?HU!00j
zK_yi~ZH|Upd1F`&mXBU~_IUFsK?>#Npm21sC$4erB&B>w5V!{!>J(F)Y0;92BrKwY
zji(Uk7owQWNDQOOK-eq@FL}O<i&$~!6m*u;yCs|-Q)~+u0h^}na4{fy5d-yT;-Qrw
z#hRq^bdfL1>2*}9ftP0~#9oYcCsv6lwg=<Ht68zum<FSO33G~|{AgJe&>xl78ec_i
zrP=0u3UUWbGC=hUq0lAKRe`MhFjBMQNWUDWnt~^*c67*Q*2QjUBbGXY9tM)2bB%`T
zfOie2Qq}-!eQLN$2ltv!V+F}%ZCJh)W)}cCN~;gw$-_tK_EjS_YKa_!&moqKM?wJ+
zx>L<%6i|da78^c~QZ=D;nH9Tf9^2Al`;XA1qbILy&=<0dTrrfC#qF)cCwstD(up-w
zpzW!70y%lSkb=}gmuQ03j6fcSt)Fj|3u)k^oWhOlN5y=gA;*+R`c%tp460LYux0r0
zf60ApH9O54m}z!)N9$KI|MYBvA8q>>J@Eo+f6PeQRidoP#!_7H_Z`A4NQHT}pp67l
z>$z>B-)={{-DF^O#;je)019tv0arqVA7OM3fkkf+QS{T>Kh9UYWCE9JNW?G~0tQ7e
z_>n?y9{aJz2DV;2N0*j}1{qj{?T@nvnmBNngL>YXsH9%{o=^2fGMy(yQ0THE?~K~o
zM(GP>?R5w_+9@85mN^7ZEI03QcW&+)4-f+fF0+QLT!+hB*_6LRZL+C5U#4M=_$jn<
zwKAx>r3mbM=N0c6Oc`Fljv!YfuK5V-*dT+Ei#eLb?}rBG{XS$eRe20Y<fWaY)ZdV<
z0M+cQUe@Pmz{U|JWp*b!3Us-pq+DA%m5}CTIqW#*FH?(w$=i(-fcRQq+JR5zxbze~
z+mj6qFm!e@1~u80O*B7_=V~;ni3nsHYAj<4-Wxd_?|^JKs1L(b({zK)(wUTrwL;le
z%nrL=BoA;=r0<O_D07|Qi(tMJKi7%qBX&AzC(@{@B-D5uVPefB3a~{XI5XWzMVy@{
zBx4z0#MzkBKT$?BKW{3o_*tAzbujvbvwOQBz!fbZjN_uf81ZP(Q2~P?rS$_SA)yhZ
zxf0!$5HmcPlrs5%Ttj!-mMm(G<3cAnD3!dKSh9jQ8$^>~v1HTj6%<A`pz2n-miw%^
zD}9~BGeNrDOcW_@n1J-k@yM+cUv-WQ6S!wse8spt<m&RiMfT)gCaxr^R{k{nsB$Ms
z`MvKVQ^LV}0ZDy1lM9Acxw^8TNhGJ-qzrk_pG5|jerjpdzr_@HC8jX({*!3;%>mf4
zP1A7-rlj#{nNKevWyqpTre|=+sB^qX#$^3_9;cAUlz`;{HbUS4A?}hQ9mg_%E$0D6
z5k2SH8c!8AWg2B6Qv*W!*908Ey!*f=LwsGR&vB80{2%+Drn7WGDg8Lz5@qt5DDoju
zNE8zz(I_y<<P{|-z?>i^qikGaYAl#2&q~h-hpHNe-oUojWDL8YcJRA;<}`|&V*M1-
zA`lXnHau(9tbk1-8ol`v^+@?cmZJ#@9JYYY$!$^}-KRV;>VdYvzkRu^5Qlb>W>u*D
zW-g;nqa6&h^vQ0?iX_cmmz5lX{`&t$(wE9$o&*Il$OGR@8e#4vUmAhYuZ^|9jc;w&
z1Z}Pu2h<{!e3Mh!WO1LrJ$!q-|H8YwU0&IVtl`e4ti53?S7_zd?0(G!ui2jPLeDzh
zf0-}W!*D~;DOw?q(#w)<_MAg<8IXV&#>cH`WyK~zXW-O@+G|Tn;=4GPcLYeae$JCB
z@#jK`9n0hvU~uaQU6#<S&_YNqqB|^q5ze$LoZf&7@68lj4>3C((psFe`_!h%q>LUq
zy<{AX6%&}xSg5|`B#B(Kd);bQ`S-0y6Q0DdHv_-tMV-U4UI;E&QN(>3pXGL^WzM(O
z;`T4*zNm5iZuQW1R<+qtdX->&!DH_FNw)|tGsYvX^w;4dUA)qc1-<)8X18oHzZJV%
z6C9;A32(cRZih9_Zik!80CH|v(Yr#m;`XUW`GU9ZWUp~k1TKL9E>!_%l7@AA>zWWy
zGj{*JCH{R&eDuf`cXvsY;YfvzmqkmR+g=)F+pTdkhDM+E2CUb@#RSB3-iZyRxU&<>
z8VPW1Mqq@!I;r(dxt0)~%PQzCz<Ae4L~cEi*6Xcn58Zi{U}h}#qZ%)!%-xPJ;v(9}
z;#neW+2__KT|G^cY_30M$<^G^jj9*wyO$VCinDz$4%M~D_M!S!Gb<s%hx)lHRGIcF
zd63l8{_c0X2ZwSq=#2%fn~Q@v9GvQVbPCR0j1p)WX#vf`;gacfx~U|jai-m3bhW?(
zj9p!h>1hBkG%%>IbLR<W=<a=B(5B_P-gnXP%>bZ|lDY{T*!2^jKntc9>Xw_|GTl3Y
zg41gY0b-xcrqfiKQH4Se0$JP!QQ&AS)U4kSPPm!h6iFDsz}3{tcvq-mr8(a+q#rLi
z%9%&=LTzTBBV3?G+h}~M<4X)9iAn|<YR0GeJpN_LHa4;dI{vXfv_^<p?cIluo6!tw
zaz1(@Y65z!k#^=?;U*7_^=5RPUG^nLw?|J~8~o+%@$NS-_t6nzwD<b(_{0jWC2>~`
z{Ty6d(M3~q#v2JAZ!CkhhOvq-cTHpIm~H!Foo;e#9oRK2wyu|3bL7zN3RlGK1)KY@
zGBFt1k|13eKGZb<20l$(0gSzq17i*fQa4Tt=2AGl=3tfZeVU#YaRHGjA^46~`(ktx
zXpAjuIVz?q@~%JN-~`m$!5PHyiRYk9Cexp>YI*@SNjfAZo32fA)Fx-w(oTpqsIxfD
zdM1b_Mvloi@+bEBcpyvahG~{GBQn$#O=El@sx!Vwrx-$WjA4Z02<+1^)KWekFAFkw
zqkY9FMibRIzy{hrQ5(=2HuI!13ea?;dKpHl26Lr~k&zXx#6%aoh$j^NsDL9oy^h4;
zl}R!3Vk;7g??_uJL!_BYFi?P2ptFbk9;Q=9muZZxg!Ud%eJAG-JE|yoGiiNz0JIs3
zsZq7&T6MXg?IvY<ex|OBWueUjCwT(KhS7PRPong!=ce@lYicxKq{y#wo-sywdKWFy
zS)v0)nE?|pVvHzq6<m&~EwyL7Y*Cp{mpEFC_5;3*MXnC%Of`0}z|ANZ6d}qFpe5qP
z+AW?W<+w;sVPvQ1BMFlwP%U%zdQ7uRu#doj^UA?u$9lZZU<sI(S*hV(Z{O!7zUHt*
z=~?E4Px*iQC!QEVG&+!8^*!C-NR+^<A5p7Ant9>P+%8|eJ=y;OZ;R31H$AuMIogfB
zqh?hT3eN^fmENeP0`~b&&&0}jiKWBnXCT(W2?OGT_>Op$;Dzp3DW^^73X~SoNKEob
znyyWKNmirZ^8nQc{xw?Ui<m@gSU@3&OyLwWd#JD9so!%)iuZ6M+8zJ0Oba|G(QLU$
z-Y1A~;;4+zk|-}GNkQ^apk8I84%NvbyxQ+PN$en83d}BOLU0JQPzJEr2rL56i+q`B
zy98R&%4^;5cC~+PD_CFR#=SiX_NG?$8&&EZN0sKXz;xvhpX?k0@a6DY!GJo)c<{wy
z!_C)Ek(i0n=xOwy>d%7*G!p#wGkyD6ebX=-{j5unaJto>@n<dC1UY(7#M##p+EM||
z_(Batzd)PX?I-x##BT_#sPtx1|4v~kc5D-mLQOncsfov-CLXWU#229^zF4V=FGEdy
zxl$8fg_`(kr6#@(HSzUIP5d#`#2>php%7z?Bq-Sc0WO$u`V$I5ZRGXNF{~b)5361Z
zd5JW^XbwYLtZ+GS#qPI*xf*^aH-SO)-V(GS{G()=uxY$T_-b<b6_E)<U@5||ME{Iw
zvVgD$E=n?MQF99+#xhvR;H}Dy+7(Zw5>H74#lRX^fFR6D0Bovr!|R}}$q)WD*gS6k
zI@DKeTQ_)5w-i#xtmYgcM`1~~4yWOcpqD!SzYDx}{+(erQ011OThn4K<OT=b2Dmky
zIB**-gK~^JmQX-E)jucGIfZGFQUiAWf_xf^Z^Hnw!1rC{#o|KouA7>%2b=GVh&Q0=
zie$1JLo$!}91MIZh)WNnx{!O^BWTjgI9XmGTc<cg2#YfzSE}tmK~>^iGGA=5pd&oy
zlE$G&h@qRg2k^EESS66po@O$)LcxoJ`T}q@RCl48>*zwue>wc>KkE!=STdFRbx)38
z9F8dM5sAq@^#1Vge;@as0@kzyap37Rc{oYt<wJcXJS>ax!wRa{8n52Rw)*$=*I&Zl
zM}PckTmFSFUu}P}{f9?iK6?E1S6}_{@fWJxWA*QgKSbMiKi%rTrJ8#YMSobHF0;k5
zp<K)Nf6;%RaSUj4u)o>e`^$GnuiqZN7^xG!zx!geH&O&|Hl8jOE?hUzf#@)crw^rk
zCY~uU+PYZpRzbfRap4kbHdZBkg2g_9q&j*LFXAm0BvW#xeC}aq^<p!nY)}+Oo7b<p
zY%lh|-F^G=gf9Ock}mON6Vpgh<|bFtiLIgC9=Ntt&Yhw#YP;C!X$N*ya~8j^)-KUK
z@Q1+WzC3t!pc;Vjy#+x$g}cWdQB<r(HjF60F<mfdMh9vv9I!(bETSr90W`o4w0@vC
zoiPgG&!_n*2u)QZAa30SMfTW4L{k@744DLA&?rm2dYDJ76~QiJEI&F8c1Ho=C#Yyk
z%(`TO6)_*f3${ZbfD4gkXL&SFicR!?qm8Qc426I^41b{&{x;@(!&x3>2}u4yQd>a&
ztyvP4%lTZ978Vf3amEv>4shpVP(nUm`$l5`_1}~I(f3EYZ{F-5*%SJ7GCdn-TNlqw
z7z>~g`WsqYPs)bT8QkW5{c;gu4g!cuJYHzMuoduwFJrVp3Spf;Kx>hW-q<z(yo3})
zdtF}@kV35>(X(c1{As@2{rlfW>c?N0bx%ubB$?<O!ur{US2n!6B1zSxYx)gO+NhMm
zbBDj~{NajPjMVlkS~F=_49Hr6LvC7yfeg%7-Kf4E91bILx*lQ&R)8NVm~H_UonXtA
z=v45K!J~?<gkbcFEPWCE(~~AeALv|Ej~I==Z<*C$RE_>Nkd4>0RPuonO?9irx#nx@
z;Z}ukgTk$s>Iy_fuxINZiV;lj5J|!p{9z4iAhUfr%95*2olD8B>2{Txk8V)2Dww!o
z1BOGasb2#sWP+i6t?g>#>edxkh1i+0!w7+o#gkS)w$CURfb$APmKvAU3|?Pv@nQsP
z;NiZSOQ|xJVGt1M`hvfRLaIfs;&;h%K7zYyR3<tCGgQz<*Xrlya|XgiKAJC!^8}!g
zZ8E~HsZ?vBPI@*%9VHcBQ>YPoq9FOUP&rK!8U*+HK}1nXvne1ESiK&kfaRd8#`E<I
zGX-7uh4<!ozT`Whnn~%;yMNsu9mDpFj`vS?zx@_Oynh??)>I`}f)Q3P(Uu0X(LgAL
z{(X8i;CHHGU%eSd;yqivfr|{FHfYKWZJSPWe%3dg3}j`4yZgfKgn&nXL5g!nTu@BP
zC@OYJ6y78uk`A-u0OP;NBiLTdj(U*@_~5&$h1NZUd|1c$bo}SnFJDA&4-QYh{&KX}
zf3*Gh%Ym(V@bcxs>qGfj|HHgCuQ*#OZgQlNW28z&v$ACjuMQ4Js@eUczwW*q9Ue!0
z-PuD`f8c`%dsz`8%?MJFEH@~*--v2;DQQ%df{0XoP%~R7YHr4m?5py0RUur2!VjJi
z?YsFLR)3nG|Cs&+Q3BLiQEa(-AUPbiMhzXmdj0z3&&MbGZ`6F%e~-Jh*tbnao3?%R
zTaWCg!HyFboxKGHeQ5RhbJ_7X-@X~hIA(hOJ-K=u=!p@6x$_{qQt-<2*1X4l^B4$2
zz2%=|K&o(x%Y+oyz%4L#y3Y$RTfDbkLW<Ebd3g<t;rR#FBL&&9daE!r%Z~Ljw89*(
znt=hc(+WfwMtEvK?>~!}m6_%WH~l*4>%k)4o0Y?8_vH1f0|<uva`%V*7h1F{ns_Q=
zZAWj^>T>*vM4{k9F`5%hRi(~5Q701}g_@aHK)yWv5PNxWs2EH@c?t=>+~0q*<HjC<
z#{C)7*vt+iHfKbhm1ctG@az~7VYT9OLhlY~6FoC<z}E~2+%-J#`skuI7?)97>}c(|
zIF3!H$ga0@hMt?mA3_Jp8cqr=2)$PtHi5LF!(44ivAB+Cs6{dc=`n;CKW5CwN$nD|
zQ>$-PV6Rw<AXe#Vs5Kv*yC(+%fALtVP*mN=jlc@m0ut}`^fWk2AH_ecc4r}G32lVB
z7Wd3!GZU1UCs_#*<B;QklawjQijsLgz98c)b#c&)aeRIC->1>zLG&lp&J#6ehQ9zT
zZ@_4ROYKbw>}5H!k81saYWTUTs^dF1K|mE1)hsa|IBs4IYI*9MGsMx;)1m&kgn60Q
zW{bmjCSQ`%Q+pV7#pj&?tp%KLp@WlKGehn+%%wj}*rmG~=CXE}LXny&3NJ1cd=aU@
zo3MaP01LeX>OI+S_Qh&G=t6}(wR<=qsJegO0M=6rSkxbb^aFUWj@Dx&!m)n0)udL8
zZ!A~szU^zcZPW_lFS(m$DI5#yX}HGJt6_b6^?E;epyoe4ADvC}yyyoo^@HdUD?VGc
zxxa)Zo9ZRATm8hT+Bd&L09L^Qf1>SbM}bcyk>L<R6aX|p2MHd+)+H`sk0Wx@)|ny0
zm04j4h#p^^>}wQqAS77&>5<|u0S?ngM#J8XqSQ+0&F54eZ(H`G*IzUxf!{PDfSx+x
zX=}-&hRKlf_?DxbEr0#BZj|`V*}F%;OFUM$kNWil*Xcu>JOKHsm1F@#d{-!1LwmRL
z^A8^AbJQpu0Jj^k8%8T^0J_B`-POlBQR^6OBq6~|TCmH2DmuA}Q<9mlDJ%eQ^0P^N
z-M_!Mv|*~51YNNGGp&Pt50uv9{(bpTp|i`a#ic?QWBpSx;A3^*fn_CM6yv*wfMd>j
z7y68CN(d>1c0kjAyk#hs(Y|RAj8w~-@(ctsRzw0X6j;%NI_+E92t#*<^{X+K_^X-4
z^Dgw){rf$#8MVl*)8u!En*5#v*|Ez2?Qb7^AWjoSAD>||=|yx_K%j=p0TY{MFM&E^
zp;Sd)B)+kjNPl0>Cm<@8CFJKco=m*zl3OwNh~;TyL(x-SkdBM6l8}v?uIU;<(k_m|
z7?q_N=W{q0rJ0!n@zqrjC7m@82NeQpM3_!<4U!1rd4b!G1qR%ldMR2P*wR_BcvdNI
z7yjOD4~xMWjVDIESd@Wdvww2%YX8OSw<p^1%Y*~D$yRoQk`Hy5wjSSEI3Q9@<2w)G
ziI1)Lj)^)ANi&e&do8%&B)DV^2Fp_j!@X#%wj(Ma6oy5=vI%P+_rVdM2QI)l=$M1b
zmJT9u$N7+kg?eTHf|{--ZlZ?}Wo7`+phX3o5apWn<cJj&6G4az)#l5RaiP<!Y&5Kh
z#~vDn(zRCo@R>F-N>X1YT@ls$gvu4Dc4(vXZ0zSgXrWcC(ht>rl9ZgK*{G3!4oFZe
zm)7QUgEA%CIffgV_?Dy~j}03ege**blhRCBlIqiV&(h3mYap~tv!&&DEFsz#q_&O`
z?6%}CPiF#{WhwUlzhXBx0DUdE@&{HSCOc8hGzUhU)-3iWbW3>F&t2kHfxHVcg3n?x
zS`&S(6=SjyM^GL{P)3nF0>8(ptJ3a>qR?DL?P1_J!>1p&e+u9v4vUmuWtDKYyygwq
zLC}$*MnQ{z!-jic@|=i(QWQBs-*Z8%<d`Bm=n1u|7jS&phQ@-AMdtS!kok^X;YQq#
zRukHM#CB-SN7kGsf-U6pIR^DzbI2D!G3qb~+Qr)dr#HsB75i<A_G=f5ZDDM49IHPs
z7v6SA#4kFO8Q3vnC{N?(Jk59owW$dt6(4kJ-&`ynU1k`)0CwHnR3F0a)?ZIF`j7^G
zQCzbH4n%GzgBW4{6d*d-x`wt+aq@8qd0B*M5U+y>f)TU{>Szz7jet0~`YY94#C>b0
zdC$TR+=@+V)P**ByGV+3QDPg4CBtO&+)kv(SshATy&+9FslnCbnYsgj-o4M-Zc`$k
zPN)!Y&aeuQvtH2Wsvx}WA0K=NYI6vpr(mN5N$7p5s}G>5Y?ICMM(Qs{cE=v?URR!(
zR+G(Bk8hlF@<74$I7-y{EI7$4EeUkI6-D31=@fJbXn!9pgfZYLaQg*hO+jz*^CF(9
zd-Ec`O!LA-X-5GAHqvROXpJm(gq4!@?P3{=UDd^zn|Q1u=d)0<&Io%Qa<?ctr~e=5
zq5=k?VtUjg)!>4rBGmXtwmuY_GL%y^H#1nWVrDb#D`T>p@!iYYZQH5btrS|L<}|9o
zg{{RlGKLL4j(BBk@GFO2!!N{OYOE)s4%&7AJ%!Mcn?#K8qz-haDPA3<QRC=l8E@@<
zzs2`ol}vp^L~4x<tW|^}1L`iqkLgb}lxH)Y64g^CXyee8)zI0c4>HR1lb?B}EAHJ*
z_QoRdGSwzp8@#a9!I>n}_}YfaK))TGDu^s{aS2GA-;o4pVY%En;gw6B1lJZW$Odu<
zF$Q6ZuD8&A=O*r17w{0diI?9n(ie_MK9XYhb(bv83&&+J(3&_Q0~8UfxmEy75KL0-
zvl99O<U`oUAToi!5F2UC6GS}{_ZTHVn)4GyLWmwxcL3l_^L%debm$~(){aEXNShA$
z#MvrGx)SE6QU1S;?6qT~igW@Sx^H7tlWB=Fnkza46R`o(n8wSDRN@b<Gk~EZSQ_!y
z-J=5xKDB#vwEMR{92kx0&7KbHIAF<cry5nQf}w)IBgj$EB;YPxQN$EZRz?SUM)x$<
zB!f6S9W*bYtTiY-0+kPIW$X8-fuUgf-eT8QSyd;-Ni%pgm>JP{hkH>$p1238w?18k
zgZutv*nSHHggUFt#u$1U`s?@tBjQ|TQBHaJc<W+Fss-vGhy<Njns&UH8oIWOzzh;%
z=B#mqAQrS$eQxkPMtuMja72ky0Qv!*h^5J;Q!kiiYhCn$ULBxsd5f;j**0JDokSHR
z^%&IP>#l72T7}7OKSFDS#ti#%6+<j2P5m2LRA^bAVd#^!TKjKvjjz?Smuo9=^b`_f
zRgSz~?BwE`=FW{FM94|(8CpHmUnAc25fHfE9BQ-4PjH{DD$?nqc5&SCN&nJa{X(!f
z5wuIgz3K^L_=Z>!ly7hyuom_#H^J2<IwpAQjF4G$$!Xo(<lr6XUYg2{_lA)Ds)xgu
z+yulhA<+%$2s8{^eIii!`n5ymQZ;*wM3p*}4(9ou!x{P&Xn!fizaQ?t+8-Uhv3^@>
zZ6L(&D4X}~tLYg8zB692qtkQM#bkY8Ed34nI!_949w6RE0i1l+Set>Z$x8yH>H|B&
zfhMHr3Pxf|wVdV?V7V>b4Zx*t;O|ij5NY3CU}PZ<;rN1*?U7)qga8Z4*;z7PDB2M2
z$mBhyIn|Nz$PDv}`7}ep_o*e$2+X2Ete}X1jEI7INyb3m-67OwyplOs$uM%4z{E6Q
zsQP6YPyJo$)!ZhC>1=a9ZLw%oQt~F3dYfxcx>!{^&{g8!B$98x=J3J{9)HIj$v^mY
z;#*)2**cAg^%w!7y1U?4n<Uz5zeWMv(NplBW}j;UsrV@BW~<p_GZ<z=6ty~2EOd0Z
z_vUTsGFRF%RH7&|-snGSy_j!)Aqy~tfg<$}>kB4ZR)MnOb?r3}gdjsUqkR#w9;@6s
zXr|zHQ%_K*3zuxYfue+jHo+dNN)gN#Zno{7bl*79JWOGuw8rJN;=7AH%a`T!8cg1(
zRJ6?mZT;>pwj1_#yI#=d%yY4AiBEmwZFd%X1r=9NU#qP;t+gFPXhoa#gF3$~CwQfx
zP#h|!R76%%Vz3-reV`>4=H9{vs>ZLBgB-X=aOEtf*D_2kH6g|Lw-L&bIIiwW@nmxD
zT~#NL)AG1Z8Uea`w^!8+IFhwhIlvW|sd}Dlb(Loq`;|JyeZX=2pRMecOmf{KK)93Z
zCMctu#SkRAn`mwrWmH^>G`2g6G^l1pG{-Hn4}^`of$~UW?`y?%7_k|So+5h*4|2oX
zLSPJ*DKP|fz7UeV#O8mdQ!c`tZ2Qu_I&+_jC@1q2C3>2**YZ#3<zp>b8pFmJ_4XYr
zTX+BsqrAz%y#brp>0-Wtw4}o}2zv~*Zx0?ANNl#$vR;2593;_1ZW3SHfImVJB>vf1
zym(i{s5yGtlFL^GNb$cTeBCmc#k+|Ld);K%b%q~J7&U;kfqlR{>uP`k4Y1-m=<^;W
zal!7FwLI9zir&#hl17cy6a$RXb8Y3?T&3;l(KIQkNWZBp45k-=SOS=L0EOfL8gVqu
zfeJ#IfYGpWRQ>Oh&nFQm$6?ut8iU%GagoNLEz6yZ4O~@2R&<<4@4zt@BSJv}i&G8>
zMQWUB0?7`by(<jluX>;s&Xx<X#y}rVtIHJ;c&i3oH3B+e&=qt&T-g!5#sT*C=_l?D
zmJ#q{n)=7{{uZ7);19CXbG<y^T}bdD#f)$ej6*=kgq<4EgF{Fehy`n$dBw0j)R@~Z
zE`%yI=;jF6HU#O+jm}iY>fXdYBL`;dWl<eTz>nH7vCwXT7x|Ss``I-LV90;`D&d3_
z8l#fy;3=6=fP)G(p&dzBZdX#;7gb(|B1srCbErLwn5ljRJKNK2z%Mf{W%@?flYd_C
zjh{(BG`o(z3d?lD@iHLJo~oduXH;5`Hls&KKp8obsQ26i+i$F|{?8NmiQOW?V-+zy
zu=&kfxBlE+uy4M7V>HOMUVIOpxf}373yo+;naACc2shMBcYk50T@jg$cFl3t2wjpv
zry(nH3dETRJC4GMGhX{0YLO$SQ>$q;bh_N;*@j9;AqlL8^IiIC)<<mWWP9AJqNXR^
zeUTl9>5hg{I(m6PNfr)i=F7fC0+MFGms+Y@hu~_KV0IX)A4Bb*Av3-14E8FMWNQI!
z9r&SXu#I8c?r_Y3e%cH~<P18r*09|j<{yeW_YtOVySanei^du?J0Qny1^7x13uGJj
z6a`)cENF<N?xTGr-u9ZngayNK4YUMjWly#+2Z(s9eiqgd(>OrgeD6Muq3a5=P#ajz
zLEJKi9=W?3i_w5rc$?xbYnRGYCQ+|fX*-ZLdc3+YjvYccTA_;LQd_6Yy3L{Kx4VDV
zHysd0<4Dzoy_^Yv4@Wl^WU(qO0xLQk6gQ|o8{(f0Fn+UBv8tGYxD?<K_G3lrSH(DL
zawxG_K!8J*QNR-Ha5WM}uyr5EA<$t17DlIE&<f@<QcPZY37Q?vd<0D_SG4yr8}#5=
z<VVjS%3QcZ2X`#!B(05iRym{sz!+roPtC>ZFNV+5@H9y;(@9b@Kwa$?xF8_Z<1ni2
z41+02AtCE4di=NRQ4)xj>;{&0{M<w-H}OkVD;%owESgNq>skNk<fWR={tqXZc~_QO
z*Z3z`UG~@%NL(-qGR(j<{`DGH9s(T%BhqUxS=vg>lkDmZ_lp7&WoChiXa;rtAKsk)
zu?~7e;zvE7AIs>pOs7eCM+suT2MceQAvxEBAdK+!P|Aj9fG;p0TnT{|P+~@%BszgC
zX7P;Q=_In%(Lnnp<`h+(Kx9d^I0;LZVQIiHS)mKXrpFUbZwrWs^-_taQReisHgD*_
z__J6^tk9W3bDZ&$RJCfHRaG`+|EwW=Yl0d33{}X}xA8Q03^gA*8YYZ+TbOej0M~{q
zuf+JR;D7;!EUzIu)a%8zd*1JbErcM{TEn?%(6@8WiE4{RC~NiYoHL-*fP#rB^a=9m
zhpuamK@3;G16pQMzgJ;Zjy7BDsA9*(ud>Vjtg5l)+fBK&PN}NyHG*huTUnQ1qcOpT
zS)vT$I4dHmp)9RcV=519Mc<?~W$GJ1YpxCqQh2vRiX@^X!)KlKeCyS(<aV*n1-?Hx
zIov-!9v$r-{w1(9-@SbO&91hBaXK&J?A<7NKb|g2MVi%sTAex##Nzez>fkgk71?Fe
zx3dw>HiE{mDc{Nl73EOgbzP`7Fa_7kgTsBjvULLukPu>ezZto1b;kDkfgQmdA+RID
z<&tk4ZM;?kM}{UH2B2nL%R`#sMVE3fsmY{(yn>ji&4lLh7Sj;%T{!6a7Ve(6|0rC!
zPQ+co!M}B0s(=6cH2+%izm>n<B;lL)uQ~tQ_LpCO>E(ZW^vB1K9{oH2+o$+<r<vUp
zv_NV$LyGObJoxT#|3%;4aXkue!n*15*U>!9CXdx$1%N*uzBxYl`~LBRM_`!sPm}85
z&GFwy*Gbu*o{!Fp`7lzf`*aZxA$%|X8i2dgKYDBZe*f=p`;P`spHfK(;tOx6JiVr$
zgTc^gJ<IDGHwBOP`k4O<zhPNj#@3pbzYe3*R3X~=d1(u%3m|_7;UU#1p})^QQw1Bk
zT!VEO?Y-PRKHfjp!U|pn`IzPU>3C1g|K;w{cl#qnT4GH#dys+*dLMRH+Y+4RV|s>N
z!A)_u<c`*&`-Tm}YoeyzZFV3G{ZE=6Ozbg^9;e3>Q#bz0??xvFhkpYZ5X!=P>`^*N
zFQZvLSx(i@JSnr!7dllNd`e4X)~=&Rl%FI)smJ=;jLRr$Of<Z1m+<j7qwRh=SWAbH
zzNOm#quys%ae*mX)?YxN7<KoT^=&<BYU}Z8Z9Q&k>kFso7fnUKbc%l2RP-yS=vPfe
zzjlg#-Bk3CPSHO$75z`A=zlg9{V%8Je>HC6w!2BqJO0QmEVi^vIzSfDay}?OjUH72
zMMIwf!}{8ftDvEqG40jY4nT`;#<W*oI{-ks8Pi^U?Ep;aW=wnawF6+Ln=$Rx*A76Q
zZpO4%UpoMdx*5}6eeD2z>Sj!P4bTz-S>2Fnv7vqlicL$lP1AxXtS;j8&Tm|3__NQv
zFVu3)Rg0h{AHI|iU&)8B<-;H4!+*+$|B?@|!s6+Xd~&XIb+>(N`mcrlC!?j&Y!=UN
z&Iq*7|Bt>_#J-#V`O)?t|4sjYl7E%_&-*`|>>r+tUcK6V^ZU&F+*C?}>&H(L4Pt5(
z)E3DiPP6D)MHYRuf3kaUh^GG_9O9cC9w{p{qd<7^Q4;!cECgN_mI|rGVQ)e3R|TP%
zaY2AT<{_S@=h;kE9C8%AUlrNtM8(Tzvy{SQnP8t_dV<!3(2LvtFhcVD6@b^?{(&OT
zzw6sRNM4E@3na$HmUnav!$na1NuKgvFwlF?ocM=wkZU*tsUh^EXQASOS8GyPuF6tb
z9gu|r4r7XIu*{&ctu}BvwRL_&fm;jy|25B&TT6hN@&6ZJDctYNf4=%+```HgQ~dk=
z;rD8`=)b={-0yuBMa%%9F1^f`#W;!1Aij=z1oa2NY6<o`FXG}#q2vDR<LHOMmSKz#
zd6UsMx_@)P$g^CH<O*10%4<=AUY>_Xf3_~7S$ci}*<+$bo<kg4(5!16{pm8DE`SDw
zWbP0SaGAj<6!J@o=rSov-P`NqAGW}gN$cyOM7e;b=6OjTc3hmsmY0bh6Y1y|*YgBc
zh7)j%c(q~T3L^<Ltk&`}nLvy>_YL@rF#hUqAV%tk+uG2{$=R*kwAA0Af(;ef%|uig
zcdHVrdbwh6{f)CCX_{7bLJGKB`k<15z9x`(J-@E43Pouh#}^9AY~Xu{?6V^rjr$v?
z@nU>2>bS6aI2$%{i5L+z)oBg92Dr36!9@<)UEr*cGEl#eV`q4k-~mTleO!IFY3oMT
zFQXYgtD9mVdk$*8CB}uArpZ|s==l&i-xM|G9X2>!GowOO)DivK!PkN&fTq-&0;FuA
zcDNg~D=Qc2xTKS7Ruml@OSS%xf5lD;|M)LKw;TL`f3Tw%WAS_lbt}g9P9fnDktNV<
zGRuo=G_FmG(W1YAnA!k$V*dE#0pvimh_B2#aDr2(G2T8KeM{9GilvKO_^eq+A5PU$
zx|8W|B-wJ76!9W22DQEWlk=8f7@CR$a_4zIVTf%&Q9xfNF%1iShAXATX+YbcKy#)M
zQFfZ22TFRlP93mZU7BQq)zC4OBE4}_ISWjIzC&=n;jaM}pJIsIU`MhnTl^_<6>#Y}
zhr)w^oNYC=^LfXr8n^4xO$*Bm-)QuWB2@lzJQ|tm8tO#1;6{Q3PiVcU+W${S^EZ7A
zOm=sAVcT71@nxJ&acU5aCSNW_ggtCTI37%q07|Xh_zyLwNu4@ih7_;jAqXmco*++&
zEtTeIg^rFzoATDdzI6}YsQ6JWZoHf>@HLs;*%~-ES*=LU6{sbJKSTK2RBxHJ)g-e~
zPzHJ9LWeor0UY5VI$LJActDhbEnZ~y2x!9Rpb^;mdJBzEMKBVKOmKCPU_6C%0hQqn
zgY0+l0tiY<dbPM%mgME0#P1-DWUfeNqzpSPqBmGvPN6$HIXUW!h6f)*BH_qS*tXgm
zwA}JxwBZhVCtS%e9!{C&o5HCxlH?6npQjLr1HW3lIZ|(<XVK=PkF+}9YWSHK`67oq
zkC+>XdB7>Ncz7DpN@p?Yu35uT!|xD8yR`j$0U?@1u)#G#%TzI3U&=s2b;s>>6&h=A
z=ki8lpe<9hWVmAUw3!=dsoFktO$Rp)UWmW6wP4GXT=KYWlwDe79;OEM>HNNovZ;#X
zSL$f%$|liZm{e5AO`Y*l+y&?%lKiq%qd|JFGEU3cG<GR_S>&TrTDFPTllWr$l4r+b
zAv(?SJjb9Gfz}LlxB@6US1vVUDOtX4Blx2?d=i5~%%P_-pd2rWyoIqfeyrTs5&baL
ze7ZN%KkZlzwMFBka5#+sW%m`y-0-?sB2Mv{r+FEyuSnmfW5BZvo+pFVyN*>-#$D@J
z3OG2-o-k8&iDm7U7+zzdn!64{5P<bG&Yj<8K<0dFuBl%2p6ac5Pl>cvCy+)7LI#23
zv7(_)lW0DT#|cGdOsy2KTtdj<5}bIF?6UvGV1Ri6C<7B3CR?u>kSrPs4kJ8jik)%^
zY-ITc9-b(_f{QmgIKy_XlIR^oO~68`HCycpMhPx4n6P@I%x4L;fUZVkighxdrZk>>
zNn%WhKB<Otl}Gcq05l0fj?ji$eT#_(WI8EgHXq_IWfPOrfI@S5MJI_V{IIaUA-)o3
zEWzPJ;4f?j!slZ+r4*<U@O&K8sAo$QXaUXY%oV~eA<{I77p}3P0>f<TeTfycgH1EX
z%Fqr<It~m9ViiE>=$Sg(`DJPC@NH;jy2UHOzgHq)0I0Z^pG_^s#o?B3Lf*K&a0{kX
zZC70>AYTcGx-oEg+AT|_F*xovz|mA;L=1+SP8F1}X&BLwYie}!yiDI)3I@{i4N)~`
z2HTi-rZfFzGFH}at_V^3GdD_m?!_PwU&0G{6S{7-@!8$geVGOau0LYvdkqY)Mn!&N
zknlS03>T{rv6V@gY2%%VGS}XkeS%!AP1u5hFx%pG2U(3Qn|fyU?}qT#YbCNx4kmf|
za2TvCxr9je2|JFG;|zFNDiBf_ScjPLsPx_~sC1t~NBX3ON_Pa;sY!$^ypNpn!s&=x
zr%<pJtjmeeY@vY+x+xA)8eZ*=tU`!Qs7_b13f(3wYKSRYtVo@UQZPf9wfjmRSvRq{
zB%E%{q=?ICd#9%H6?hhnC-spL5$HHombH2S3+%_s>iz1lJH6i}yCYWZFZ)M_qvN-G
zd;7=7e&$Ie(t9n8kZ6mnQ9^LM5^JPd47JgbJ*uhQ!XlXq(m2Mup+k=o)^z6>QC$kt
zh>21YNv8SL5M!~b!dDm9+67;S08L99>W>k0P$maLIXp#SiQRd!P(S*N$*o}nhR7Ot
zhs<Aq298g#Bwoizv{xFz`2G~UdQn^x@yyHzWraPX{B(*+hKzfODx<CgFlE3n0+<+O
z{0_n^Qbd9wB{+jnN)g6JB~AiHdPUM@?ialQ6?;UCBkTqS7{JI_!${pT8H77AtcpJz
z_Akd|Xg1gYoH|T&h?!n+m=rk}0>MMtVA?TkiQ+q|Ne_T=%Ivs_6;g%O9!2q0d`+wu
z@vNyLGJeGX3(S_7&XZDyle}O)hZ4zv@dVA8#+}S;e>`1mXp+-+NbQD~?Mxjg6VMXe
zJgzWeOm>Yi8Gyq%<;9~QG1!V;R+H@!qt)V+2ysxq=|tO`uou70vjBcTfxjGr9n0|%
zD@AcK)!c9qKQ9t@|DwF$jKTm0z!?vz&KMalTqFhqg%1>f^BFTK3Ib=i;jG;=XALUq
zlLbdGP?~*Y?V0m}vQdB!5o)tqk^-2ScsAh!zWJ#35Vwe6n#3<moPD2AIFKv{AOqJQ
zV0OogrK))iR!CEhW;|7-4kc`%FgT7npCd5wC!x7_KX_{WKrN%%r*F0QPlJ$%C-$ZQ
zvB(4_Hsx3-rwN>ki$p<^V8DYJ(lu+<EL`HQcC`@{=)fL59(v*ytuVvDu$Y6>L7R9e
zDH%sXWjHt!%1gA}6pCA(M*oF&RzHKB0v1p<L?m<-x3d^5G(R`SkE1u*Vj9QDv3C3d
z^jjC9r%Iu*Q)nD6bm<hj3>O08Q5S*Vl>*Fr>N5OTDaH(oF2;|QV)zjZnpDAc=hJ$n
ztmH>@yYgL41vw-8rc&4{@E~MCy>icAR0f=9(SKF9j=5d4dHft)beE@<Ti|}FRQ8B?
zUDJEL)AQ<yNo`p|S=Y92{QhJ;L*nad=0#I2lKg2{g@>lnNW<DmsfVW0>UPp))z7Aq
zg3hX3JMHxtsXVLFXH9kO1!0c7dDB!+;9@(wF(pxH*wh-M70Vaa)~&aA=~kI4nX&;Z
zmsVH|+P&Bo$)u%2EA>_`qA@adsclVMP!{i*R}$%a*OwOFkVOJSeKFU7R}ybJJ0u|`
z$S4A%{=U6q(-^<b<aHP@d5P%qEu%PsnJ8MAt~(?O1+}k@MVKg@Dv*S`R-3gX#D|ny
zih+oU9fo@mnq8kN#Ds6wHIWWqg#k)Go)e{}?q&`WMAtK8a<y_qR&r7SY=#R$j2tqO
zK1+*o;SY$k6jy1PYyp9;l?+H25OJ+&nGz^h5Kh+gXJfa8`Z2^cloYxU$|(U1hg>k)
zq=o%J%>j`}t79UysV*qzSDuA7P7>BqRsf`P(0XdyN%Pg0;){)q!F?<QS-CYNc{w_c
zD8Q~JK{2#k%x31mih)w*0@N;;=kRPnW=2<WN!3+l%Vc}dYLg6@zNNSu-%vt1A(#u9
zZw+)J7DWg`xIjgB`ZORgfk*_-i+lz$1NW+g@dbn=ShV(J!e2OZliXRcx5nrTS*;>5
zk5Xes-RgtN=37H*!J3UBAF0>_g0N{EfOP1C^^+;5MBpS=NXZ+U|AY?uS;`ev=WpG9
zbVdX@M6wK<)eeD*Sm37?cveqoQr>*Zi}Y+!qJpo2MyUEp?Xg|}dN@_w?<^^+{XVo2
zig1sF`JIFp8OexIcDR(-REtp6d@kZkUNEy(#+ZyZg|x>U%W+Lh7o3%)MFqVriCoHP
zT*T#tiE5QD@clcxub>*Pwqsc~eHl`YT-Z4uo*ov-rUAzk(K<>X0W&2TYFN|7=dd|f
z@io_`LtPKMdY2cdH^;lfE(bM1%y7wiaENsQ7t96ff&3%jLJQR|5{7UTOt?#J(j|sY
z2hZR%zf}FFTWZvSc^nDgRBIBS$8_7Ndt<raMMxJSHJrM8PA^l+oLRFv1|Bismt$$@
z#%!$vSho(vEe*nKpdg@2WJE2KW$6r*NJgALT#v_PYY3mZ_M2!h0ZM?p81y8E&ciTB
zk|~gbGX!lCCZY(2H<83v<+Z9c3j%Up3?XgM=L=TxGqmaveqQP;(4l8)W{T<_S#a~Y
z<t+c_f54J+Je&7xO6U-SFX;0t9Khd!q^YWBcXY^lZA4Os8z5L~LD>eU@vkXmUsWeS
z9lL3IItGy<3Kz;=5N#lZM3%g|8Bi6im#{qRdJ(}c2J83L@%$?KOZttXm`;}qw4?Bl
zrx})_1;_E!z!FE7CHoNr@NnsuG>T9g@J?@)Irl_zxi@#kz}W_|CA4_~Hyh#%I(a>L
zH`T9c?Z^}}#e&}IJQd;Kw#Xu*<UP`FnZ-^<hX8w{4Xm}p9u`k9>DXE8eA!Y6ocb`6
z8AG*)ES{N2hT(>+|MH*kZ}h~8WLeicC*?bmq{(<$F7lbiin|NK)_AEPO$TQZJryOf
zYh+#~c5V<$RS*oz2#FZ;dS|PvY9E>+8~i(v;P3uli~lzU#J#Npc%%RKqp!dI`f<ho
z`|Gd1__zP}r}$Ti|FL_tf4KXv7x`n7UUm!)GAYXy!-zB$MfG1>p<+=a?ZFd4u``~+
zbXy0wRF~u@2yj9cye|ksfYKsglvBkNDEc34HCaE)>6zv8{30$vWWl5XG(>^TODqaA
zg5dY+u2399i3;8V-Q8nwwO8F-#l?hdhNTDfJSoQW<%n{h&hiOSfF+0VTU)2^5G8nh
zesQgT>a;`jzET7NEma#{V1y3&UiI;2|7h>cTRtT(_P^bI`|?CxlR9lD)WEcGoaA)|
zLX;N=M<;(%h4*&<HhOhzYspHO6;4)q_4e<74^`3v5Y7quEBGk6J!)!VCsfq!#}*ZF
z5@njhYU)5Q5Ttt5hmwlj9!Bqn(e;3Wajso}l*HCHQLW(j2RjXQZgsqA&Swi?H5uvm
zKOTN_aCrRF$G1=S9j<&YE4J+}fI~V{oNER=(!5B4rp$X0XBNQF60W5?+SxdXfAi5a
zop~u0R>>EvGYP6U{F5W}s59kf6ULq#KOp|VAP~Rjx@j2<_Ad0w&S((iI?SN9Z98Pw
zUqSam*M)+HQK@)<=AL*(P;0LWbI&POP=A6Qz-KU#Dek2Gj}*J9r*k})>6r6a%@V~T
z^xq!7J>Gv2HILf**=8K}oklM4>Ba<1;xs1Oa50Ja;NlGjpf)nfiZrw@uo>~pIWHB0
zHba4AM>Jsl2BiT!bd#J7#s|4@$`WXeF=Km%5&hCs9Q=e;d<4wJT`XxUL7fWz<%_^Y
zmu?-NH_k+6XkMC}pJrvM8Jc;KpmOI_qgV}x)Ug_^yG?9Jlahe+F9kt*fF`3`jKA!8
zG#^gsgHwKrics}&YE65_;Y@J7wYq~R)@c}-MTu|?ys0yX?@l{1Q`J+<^d=d@cAIqq
zL?uIdCMOyU#s-h%Lj%UFix@0n6;_=?*aP@R<2^TtJQyh88>ZxOTfgr%-_zM9MJM-V
zFJgIkT}65U?#f?BDj1K)phAM<VJw}f1JN7x|G?Qf%yyva1v>E_x2O?J_TAhyMP37o
z@2-h^b&Wyv^eMzV#aMOWIWE8c()J`S%q_~0%zaj-2-QM!<UMgFT5Yvv()DAR#gogl
zy!+8`yQ_`|Co#F}(NL>{?i+>2@y<6&w%UDRxYnI-l-usA<GJgNlC9QllsvkG$Xq<u
ze&99ptS<#4iLjS?dm|DNy2!T+#&IyXevBTl&cEMZk&4hYyQeDeUV$zp2i4Kmpu<b~
zEAVIwnP-U71Voz=GHk-{#pWS3rhhBIOaN%;`i8{E+#+hzYT&n0co=o4rMHZW66qjo
zI`f*``Mf5p%xj|O)n3cYYvRsp5}X%1Zk2aAGu>v#x#{A%T@6DIqE0QD`Rc+v<Hpvk
z?YsW|{F%GB?$=EN0Z*Sr7*6~Il5k*Ars&4YV#+5AR7D&Rtl9$BvD25;6u~bZ!*iC{
z#$ZNw%CgA~H`_-aPp(>wbfEoJWfyK9sS2U@a3flb!6$Kadc8=%m2?Sx*qnv<5nM|a
z35Bd#V{}(8@*;7@E*ly~+adOe4`wyL77vV@_+>icTvyzrViMw_0O}wq$3;3<eUoHG
zKdGXs5@<G6g}!}nn{H_77j?T#(~Og(yI4}aK-|gb(!-Kse87#JLOAK@zHM6FdTCaU
zP<_mq*IEF;Swx+16&hB@f%n1(0NQx;u@FPeE}-kx$BJ<G3C3E<dtc;dHZ!=PJM;~1
z%fQvmq6B>Abkj5zFbVw0BU&mz<@6goAbu4iImN7oBu0Mq_GJHu(VL^!-;Q4Fp6vE9
z^_`k3CpN0&u?uvAjn@?S)}wwYRF^*ubrW*lruA?K!HM&90WW+PV=#(2nA)KjoqWfj
z<8%s=|B2Q(tTn6(vG2Gxl|936uptfgbr5v0CdOtY{VLj$<pv#EWa4V8wMk8db!wAn
z;tp*Rq1LHQ&A@hP)-bz`ElWnLp;1w+OM9(z7sZ;}145fpN!GLk1qNC-QQwe)V@`8E
z&ga(_Z!PB(n9p1dl=)U?U*|f@xdQOSuO$kU%hLteK6h=nfeQDo6)O~z;;Z|on#8a@
z0Lo@R^belA&;ehT%y$s|^Fg}E^LG^au^7o$QmRhBaL8BbA_KE$&L}-e=8FqZnLtue
z>Qt9d4|5~s8idlw?!7+RA9DU)GYLC<BggXx7UZ5BL6Hd~(JWaO&hTO7i5UV4yocxu
zPNsjxA5u#qtJy!1ElgF<<Yr!NFXYx7ZD=X*G(H8(AI@*<sW@1~3-F`U!Rp^`U=hpq
zLVLswQycgYX*sp{4(kI?FgzxZ!2&6pAnQ-WHCM{efyz|iY|OgQz0-6ti|3=W<#gIN
z?E@^sYk+eevVKM5=Qt(MBP3m=FXh>Cg(h~;(j91d4%6E21K$K0uNMP-gG?rc7`kTj
zZMnW}8}<Pmu{L-qkh*aeL4l50H803YC1U>n+dttw*Um8<*}>g<)lX&LHBuoxY&ZlL
zZ<=cNY$&!4!dI%1qAp)sIY;?&fzhAPoK*FIHvVKfO}hxXS9VcgwtzNQER^~$@L+9A
zEFi<H{4`K^u5hheSB^i6aQL9!)idclaIf>t_JK$LQ2`DO8|9C*6F+Sk7(t|hE)8k}
zBtN-&$GmO3xWD8OZ*m%<$#xuF#zl$-m-qpqg^^b<A0JTEL)f4t-f&vA>ZtH}0z(9t
zfjH#c$kV7gSun9K-GD*_W}btths!2mWY&bC{D4&M0TB2L-%H$8k0LQ^wm&By+gY)S
zIF2-4efTJ#P#aRT>xYsKTsIGxms!RCpffx(-qZbcLXbm&#(Hb~VVRXTYQx8bX=X5C
z5E@us3b5YyHJUnh)MPS3;U{i63nDO16x0d|Urm*OIHGYFin^;ChWaFj!QrP?lmaWv
zXxrKGW&>YBjhGr;XT$7QY$7F;nyzhDA@fX^HhPz)S}C>P1^xvnsnx{-p@sDoq;rnj
zgF{T&#}a0CVRpYE?X!lht8Y%?S85H`>Oy~~e1Nc)NJ4|1HoakicJzciHyt^~WHoIE
z3-+i_A&`F5yylaCule1r`J~&L7dKt=d^%a$XvdX}=(4YdhSzOb)l%~zG!=EN551nf
z2_0r`B;@}q0FyJTV1789rO)}vXSMH~V(`zeU;pKJbZ~fZa<KdI;P3lKu-6}p{nIA^
z|JK7MPmQby0N8dYl>}#`v$^AZ-ZirJH~|LpzQbR-aOyId<OR&D4WpzjpM$}iSa4z&
zsUe)wFv9G7(S0{{o*ta^WxL6MgCk~}oK7R=CYa5w8}bJygN+&@p_vCxv)!l0P<~aw
zb{0)D)Xvv9$Zm`8OhT`aoeGZ8L8~M?M^{yJk*BfF;%o4tL8l-H^!54`d4QpFW4u5&
zZmwaWGD<NGIflXE0BUGwofOIE=-J7cCAgv*#sn=>Ay^SOil-RAXd5F%ZBe0z<hp2j
zc*fa`NW@O!i13u0O44DRXXrRm)~t#|@eOJwQ*uQ_xJDg|ky^jNwaWccV`+qCt2d0X
z#4?RjhadcTH7d}kd=33dNH}`_T$mk6Z+lv3-^|a=W67XgB=gR;u0kpo-nP!Ww#v1~
zM~R1lJBVnWM^jPvHZSXkp0}um8aFfbdvMn|xTb|%)AFK7_2txgRh^sET=YV?q6w_J
zb+DJ!lEnbJ6-7QRbyVCt+_yTCs6wvDV|O<jMKfG+Tax$lIGg<T+oJbGxArf-EdnWp
zw}naS(vdhC**NMU<vZ=xAS0qW9Pp%n9}8?gM_tLRGskNBgkU2{uv2TEtP4wd02?L*
z24Ky3R~gDg%^foMkP~k0BCv1zcS(j3kfIn8g+{uviT$(8(zCpnsT*C<#*=)e<Lgsq
z(f8!GoXm5`esE@;hbj1^2vOrGws@ktvtgv)U_(M>1z=EL8U;+3m<>g$NgN>H2|w5O
zFgLu2eumI61=`{8J6x~(^nMu4i|m}E^rDdu_eq}-sI7qy)z8X)Wn^@bG|z^b^tC9M
zBs#dSIw&^@2EzbH-^^q;P^Bkezi;+q24R;1!=f5bNeEnt-7I?rrO`A$A4y-JhQU#I
zYi<5jE@u{*$rg08JAN!|2HbD+B7%ibG-HB6=JT`28IPismeWN#r<e)|mbn7Uat>rF
z1QUU<v+4U}vPoX;<t)z^7vN<^?I;3#%xNo@GYU3R<P%7fJEVXhAgP`t+W8-~X3-?S
z$~erfIv#5JY7wq3@@WFmxlTb*aYmWT^|?^<XL{C;@m=wW6AD+T_25~=o5mA{VBQ<X
zr7opdNo%1smC}4@N+DO#+c)37ks|T%rZgZR4G(lpj35+C9a=PYYX!<(t&r09BAcR)
zukV&rr<zwFTV`z78~v%LEzo4i%}PlU`>c6OSXuPVN8pMm$Kl<qljL-HF1U`G5ss5|
zDkr$MR{an?^M<Vn_Q3J5{zmm@kdB+MB@A@={F&3N;VDB!-I5KnkmZc|RA-2(0Tyd9
z8c#0cY>ar>p`-$Egb~F=d6;iykD0+tW}rB50Rrs;`vIsJL>r9#q4WGqpC?bPu6Irk
z;a73=<hZ0gXkX8CAgeud=1m5qYRI$vGO3LDz6aH|ouBlbRh<*qhnjK&u!O5j%w5i3
z6+}GJfs1JI{Eh>iXuCT(CR}9u0#`TG{Re3;T90h>9q58XBhFeB*Ay0|g^~|~rm#bC
z-DQJt+2A`{?;>lsV;{X#kEAn1=>%+Ob=Seyiuq_?<fy7>)EzWcsd4IUKJ!TGjr5*h
zBvX)`bth)p4!+iMH4#wUJW@J%piCEx=zXen3VPgHt1ABP)3SotaWK&{JtLwcD)l9G
zt8Kv@OvW;2P^?cTZren_=oT>6Bo1dQM2pw<s_9})N14JNCJNEF*c~>jYUptuL*#vj
z&tMgBE&HOcFs%L-&p6UneC(^$y{m+`*ts%RLJSU=-YIejLUjuY2*P_5bkgNlR;$x+
z?8HF`tWJ<TUy1(Eq3y4AdH@EJ+2TEi=rZVcuoZo)cD}qYu~#wp;}!>b^JqAAnL2}d
zUO@$aa!36nL>+31?q1dWEupBd{Q<;>tKF8h`m3Z4=~_n#=W1}V?~M>E#T;Hq5D^k&
za0OG4d2Hjm?sL?{J$qPW7+GS*)YOF2U;g`T{}D!K+IHCF)FMQ$u`1=p66(+x7z1qw
zOk{m&Lx8uBo{6Cg11BuH(*<RPpcOcddOEX8Ed{8c1_{9m`z`~2kbutAu%f~+mqSLu
z)SO^fd7w`B1L@9T?AFMkpH^~!8K_9eK)g<nq1a}X|CtGZM~2nThNIE`IzFrqT^%h3
zxY4fivH?)|j*|D|>9R~OlYtX+n02rp%ud2KQgCxlQ?V8}cY$-G(BCV}1_c5&P~?Fk
zM{CkJNUBNFK80AZr1LScovT7z9ud9)B^vzQkqNLWi8LzEqE5OxROzH2#0kz>e+r3M
z<kIN*fA9)odL%%Vfn)#lS)`!);MM-<cz+LE*8mYnJW#j#9cHAimeYjhb*Fc9^KI-v
z5}Oi0W+SZw7J#Wqm^Xk4Fx)X_Tj%sj6q1<&R{=ceKvDz&{{DDZuPf>F(ezWJf%G>@
zD<*HjFW~lV51YsjQ>^YT!$V&ID?y9HpB)dy6QvSD?V37A%c5+WzDpF{dXEdua<$}n
zmX6hZe*b<{BLmf>D>g+S3YVQ53jIWVjIKcL2(yAHVi0NhmEy)J_$Nxl;S;LZp)lsn
zg{tRak^9g_FHYV=LIH}`O%YF315|l&Jx?Jr>UDHB&95+s6m*Wkq^3E9*Uj?f`31N^
zrTGMN;b8BSjMxb4DGBE^Sy1S2$ThUg)R?B%94s9|q%D$jL|Nss9487mO$cYiQ$WYj
zjS0!Z&d(`k^1Mi9@d9E;vr>R4%@WNGsJ2rzfjyv^Lclf{Rg#r4p9C;JI7{LZx<)es
zYC%WErj*K*#TW)X&L;^5&w@N-i_J-)aC#;}&Ifc5&Svj;q+HF#F62AvNdHw${OsE9
zlL=`Zo#zrbWNNuCkf&wuGLrDY83$ZtEe)h3J53VI^$INQP_MU^L2FG6Zw9AsMta1G
zsjng;j@6mT5{Q!*7uO0b4k;RI%#q(nZmmP>QUKni4i@isRA4qfu>brSa^);I3b>;G
z7m%?nI$HvaSmhDkhcQGQrgWT<zH2e^F69&`b$>o&aauCUD8;Zy>E$fOiF81yehCY;
zgwVnWB?B#qr$AxM7*Q84qOFr3I5@{?pvoLn*~wZgOGvIw#9~cmJ_2{rg4Znx*~$dA
zi;ApTR<2+NU9a(jYEtz!+?O9rTt(e-jh~gFA{ttjK`t0-IHp#mo4TN1H|s{k;A$ZF
z%A_S8;Hm=7I@0l8kkT~8!jxWvzr90AX>53;E|0k2-nB?5IxF&7RE`Ts;-ynJg6M&+
zj2R?a6!=W5?@rYrn$40)ikBc^s|kf)r?icV28T<KQt_$M^Sq>MNmZW3a}%FES7r53
z@=V}Z!|8$Doh1Dsfn0i)QlNI74O5{`HEz13-=}J{WeRBB5O9i#$^ae5n4}Ss>k<EO
zns5r4GmJHXNjFn;j6O{kR|$th|L5i-<T#&ie?Z=Wu&Bbm5b~ag4G4{1oTiElP<#vZ
zrtvQaU}ZOJVosJtOhGBvDk8ah#wbj@H`ARh4)GqzUEv+%sc_GE>)9ZQa|q(Yhg3Ic
zjX|r3q1j4Ttd%=-4|ja(p_55&c<5}d>kd6+JfPl{7u03aVnDTuqi;|H<7q8wW0Z1(
z5S77TKkb<OQT>KNI1cNfClSSC$m)s&P3{bzc|x86E}{`F`F3XN73cOa1)o-CtvDfe
z3#^!ICzt8i1B9AI=lMC>sDW#fE7un3Iej0P&9cUAYi7I;o^>#wbmRoOYKzqhm%0nU
z3ya(W;AoY67(=%S+S+6f9GX?bfsWl4Wy_3Agr!vtUS{<cfx5O1AY<CFk~c?$X+;t@
zh-Zr8!&<)vS_~BVyU;P%(WdP8o)N5J3cRRu{YJxZy#fy&1WhiYjzDOZ>4CO^*zo{g
zamPks9|ZhT;SY83n`jz%J3Ev&4H@&U=|N!`vYdQ^)5#ZxNx@dDrSXP&qD|KCfkf*5
zeSbf}d>zpP5%2f3Pcuw%G>ui!kkf-M9!3>Fcjyu|i#pII^D9JCsF=-r_mNoQRf8Rv
zrn%=@N!HrhsrvnH$JphAcWjJFn+p)iuneHO88}AV4A+`I=u#4xxEnE|7RtrJb^w$H
zYsOw3pAOUV1SQWH%RLNdAFNx(tqqUcJ@E{+r{k~bXqvbnk5+1nEBP&2ysD#E-e!O%
zq$OXLWU}VB$j-E#!_b=c%<ejoV^_1o7G{5ZYkbfd8sz2vBzl2NSFG-UysVN^EG*(w
zs?lYdPt`@ti3O2AL5KfLHDpj-K*~@tPor#hs4M}0b2uH)+$oB9^31ogbaL9w3l#W7
z%M6RFCe#tWT3mqX(F~ZrG=sL7Fo2|@I&Y|`0-PKR!jLUgoS=dL;=MHOX2oLAo|cRe
zms%{dp-g0D1YLwjRQs1|v}dRS2P;uO8D*`s{!UdMwITj%!~1uzU%GqR`B8-#?4X4a
z){VUOmCS8bg&)f(x-*_F&Z*94NgwqbazQg|ygNJYSE2p1WKz$g`(#*6kKd~EQmm)x
zhXJ0cG61p?q|U7aoJX)4da{lt_Z+pnA^M^L1Xy<@Z6Ze_i`PSW#-q}Ru%j@lPC4A9
zsGrTJpGHq9@?U7toc`T)em77M;%;nrks{acPWPi0(jHbU1s271O%qzL7adwH{8dcq
zkT}CTKqKcAFO+$apF_@MCg-YBOk8qD(r*F1tFWur2)q7a!i7~=6CXaeZ!^JfSS$%{
zJ*Y0lE7Q@Y@SJRmQN_z3WFo&)jgQ&5WiZH#_%f-^4!DpeGb}Bv@RnEAx>v6N2~qlF
zQxpnn#%IkjhgB=#(MRp4yhHMuhJ)+K3hG3429exc#u&yLlrX1BnE))yZ#%gTQplFc
z`4rWS=M%uPK|mNb@sKpIDlrmX_6|)og|X@qU(riQBy0scxH)qqz2{C2ix#S=K4b^?
z>%eYMEa1@zO#z&A)+cqk6|cISLbgB-MWu5tg_od9>_9z?1j9^Wh5Hz3*y(ZA0kZh0
zWq`78uF<V;+g9xe)IADw6=|tNk30xL-`XLtP%bbKO)^qdDKciHfRa9AY*rO4P?N|J
zt9u!mMme4p3B$YAHI@)iIr+DN2yNcTTFdC9P{$SR7?@vF_c18zQZ`zk&ecqkh1OrD
zWKaU|e#N#Is3eS+idez&V14w>^<0fa+wUZEpk!hUJGaP};|p!7LETa#5Jp^Ga8W-$
zTc8;U7+)ZjgAt{pSqh0F2bIoP&1W&4!b0#}r?{vfv4Heng2F0?L7s#aH|l2N4V)o=
zykelZae$N<uli_JdSAcH2@=quTJ4(71IV7&*<zUjp2g(bWbUMh(eq`jSms5Nlx)=n
zvY8we)Y|WQo{&10^uuI6Bm2>-Wi-(-8{=SJY_KLOO)^5r+#XH!Kuc>P1h(`vjm_v7
z3gu*-WRn@PpZG!zx5SBn?N<rLVX7z@Z&3<z0>(&<v&iQK=-{zO9)2=~Ma0aXG#Zdl
zVs`OTl;buQ$!wk%aRIs1C#tnMQS@{U(DIA~LLdw($`}nX(Xt2q5|#<Zv%!|sDb5tS
z+u|v5F46uvlAi0sXlrY0K$Zn&<-tupQOCc$&?dam_n?5|7RyDEj-gOFPvUoU9@CPt
zt*?jnZ+(cipm6N9%W_05>wZAUhJq+XE#(ko5kiWprY_Znqjlm^%~q@BQP21?W)oDM
z8lGtWAU6n-m<)alEb(O`qz_Dp=uYY!r~VDpIc|MAu_mUbt$|r@+)x=#R1I>R409@N
z(^b4M)*CMrLm8Rh@Bx$W@`nxc0Foosta-+^ZE*@0#(_C0a=tSJP3~anVPu*yPMl68
zR*LHkBi94l;^0y84M!C<4svc;RM}#V9b&Eh3m0v>`2_?x2gVEY*Q(!IZKH#ixS15Z
zjyTK`4PvPS&JwJT{e^%4rN&kmGt~n^j;0<Ylj#o*tBk>L2BJ_gM=K^$88;0Z<F&)p
z-AAO23(6r)?E0Be$S6bpa0TSu=u|cE((MNl`218KYCN4bd_sK$clWN`A)<<JQV284
zU2*vKZZpH{622JMVRL~hMCTd@tTEjvOCW?eRi0^5u-gfC2jB(}5A7S@isp!{JVyWw
zHn`~Dgb*GeHZ<r^`&R#6r%Ikc&O9Z)_Q)lL^0DkayNhU*)VaRnuh2jaA{AIWx8KtO
z*63*kKZ6v(xpsl_Kj8xCZy!3|YtAsxoxYMFi4MDo;u}hhRO5iCD4hJ-=!+Z03z7~#
zSdd3Ve#sGpbPLuV3WBRp^H5-hB(Wl#&eaH!6zqv;hkPX{@C2n@F}-$KpNQlQid0hM
zA$mT5fu$l6QGrUPk4Odc7-r<WrInc%@g>`3y-O66m8#J})EAwmkLl=QIR+DVAOR0R
zW(<otR*QL=7GOlG8-+78Da%b8INNfC*wR!{is~&;>8Ln7g^)73IUpSkaSJ(&kxxSw
zO&Ejnx`BHD1ez~$aIcKUOSR)OcS%Sq3H+&<J++`l2!xd#9r~NZ3nZkMr3v$NQ?*xv
z=~^eVv@W4fO)ge+<_X!RY546D%F|x*ej*cYrHuvDanFHX)iK}oH4FJ-Q1?xHiL9!K
z1HeMK+Kkpl<j`6kGlAGp|9l(|bIBh7z^kJ<MqD&uLuAS84x%dsZ^)fah+F!0SpZ+D
zAUqk8dkC?vn)x;>4Gfjq3|7IxsiQ<(;xv~C_UH#v!3w~Afx}U14UeTLrc1I)Z>c&|
z<TT@A(V`cLKEFQJa3d5{(PQOKk^8`OE-WB^GePx{&^51t{Vn2avW+Ofk|8I?8zNY-
zVS4P^oL|L+da#Z8e9G46fHclANCTP3qeez|#x~)$L-6KLP~gN3Bl8Il>bNQ-l4t>d
z=z*=%FY_rP(Rd8P1P}+rEc|CT9*3tk2#f?FG!QZBnL=ezd7X_fiaY~W;$4<sDPTM|
zG6`(@^D;s|gcNgrgTE1BSa6$DbGk~RC2`PnBSz>5kN1KNJR#>lw5uWpa|IF<T10T>
z&1ez9?SR|>F-l(QjF-k?2W^Z)XhmqtV3?{V&cHRZhcj4<Mkwg8gsK<z8pRy3_PVt0
z5*eDfz<JcyT7-rvY+!VH&0wWvNydo^hA~ONu`meTJg7#YGg4hd$Xvw5omlAB=g?r&
zcp0}lAkp4or7ne%rtr%jGmbd)BizjWu;4Du+}&1C$Dc;+n@NU&>rITVqVzylqa_Ji
zeBejWt_tFTpO(~p)#A?vE^e~F3yjLsyZW;H2JmUoZh1L~5D;4OQGMLBVK>o>HAkGU
zrhXboP!=H85`Nx+xVs5H-vIy(q=vz;Mr*YCSli>yHx8B?pfgiH+7B%QuE&1O12?EF
zvXZrMN1j5B)0(>4E9}3Ly6J#izTj@fW_4QgQqng!%gyF!&2;LXVJO*<$=Z{yl;20Y
zjWxs=?xei#ihy7kT3u>Zv&FK&s;!*+h=3`4A=RTQ-m{kqNQfa+bPeX#f|~3<Btfo8
z%j+DodjaJvkLE*<O{kLhX^ED;B%DCr0f?V+4g?|QJB6`qkv^g&l@&!d)1)=UOR$q@
zus3pq91k}d|M|<|T_EQ0>62}4g!ZO4YBejBL53H(T|$&ug?CUqWL;YP4KoB`W!eMG
z&;^__Xb3$cIN-T(S7$Ltzb%(%XXzN#O)S+g+Z+)SkAz~LB}OA>rXIzoip3dHJ9$(l
zaiIuMC<@FYlFTMl?%l&|&&7yn>aMu1%`>3krRbSM{sJ2-m&+!$9Bg@(+73FHbtPxJ
zV1lNDUqKVCM@+hFyGn61#jBOrx0+9|7*@70*y+_t^gjglH;6>#anxs0Z+QJ^b=a0&
z7nZddq^{#Zt0L=+)DKxb3^SpaT7=v*YZ~jo#vQR)N`!5Qvo1E8noW6HN!-Vf=76R4
z{*gFotp@mYR+yS2Z_c$9MdD4YtK`VFno<~cWWEHM4@wAhG3QVczg{Ge=pJgLSwk70
zC7d;e^3A-X8v;!M=4`fbijvlx&^^RC(Z#`wBh8m3df}@fKz5oT2iFl(g9QO&nF1#X
z(*qg7DNCZDMj54NrVb_n1m+zi8Q_o)HUVZGjJO5w9<GF`Y{GkM?0$SAhWA0sg9t0=
zGvtD|U3<O3>|-XP&p6r;G24y}8P_kF=yeUz;@uzb&Ng0N0~(Fh*;rN2k)YLr2gs!_
zEA~4Jlt7N)3K*4uxLYtbmxu58iy29L$=G~B3Mnt=tqBW@n&)^tUd~Rh7aYIVDs6{R
z24mUj36-o^kOeM4Mq*Pdlnm&*Y2daq7fk#?(C*;dbfV5BF|uZhe5J6xPr8viHrhSU
z4+1VO?5fF>u3J1ibS!)RoVY?Ns~S9~t(v5ly8M82+_Y>>I&Nb=qFE-b&2)i^u_&xz
zozW+=Vj78)MM?woRc~Ta3W~EW+X&GRbr+%0EMf!B1z@s*y?*^lp=JUdq}4dq*0s8J
zVAT?v$pF+_sF3BVoNhq}FoZZIAi`Dn!O<D?(R<>W@Ge(91)}a!wf!^UV!RdPAo$g(
z`i-%lmJ69S41*kro6>|omrZQKfpK3T99S>j)JE0htlESRT_;#iJ&O>k_TPk*1LKjO
zm)SeoRaZAn8--s9fuJo(b<1rcc5T>lfC!dizn~CUA$7i*N|Y&ME;bPncWt8|m~8YQ
zO4a=n5oC9<o8>H_;1`_kc%LwkOsT*?eWcD7-WRWiR$7M|gW)kx5^l@J9O%m4c^DA;
z)Cw2$SxQ|Gj|#@G?3cj{jgsTY$kA-rBlD!gyka9JV>;(ee|z{BDd3Q@xw_E4{us$S
zqSHVrR%K{7-yZGnH;v{)ZSSi2|F?fKdiC~X_nVjdQBASvnFuo*p2AKq$TaDkdmZjy
z|5|l-#gNn9{pr~R2KXkEmpY^D;gmggr{(qw8^0Osyoxm7#+Q-CkPS>k(=8+}A=$zz
zcaSFcu)e&4x}NC@S=b$i5poG3u*w%kRN7mh>)=+Vttcg014UKA9^Tc%*NYR>G<*Zq
zT|sI+MU0HVRb+x|t;wK*PH#9oarpv5fp&q06FD$H^kg>Az-(@Qkz#Lw(Q7u?xlijx
z=%)|~+z$>%#FvGSn>q+{M3z~Lr;M)2MO2J#?qQ4BlF=T<ohL1@=H)eYuVdSK6$U~)
zW6tjQBF{^mzM!12Qp!&EgBLKDYjclbM$H)o<?x2wI_hSD;Leo9+o@TD*{vg+&U4En
z;%YJptH;?oI2KTksqgREypuvu=Af?TpLRE`%J}*BO;4sb_m>9FK;N{jt`|@<pmnu<
zsn#FfvM%kuZtFh2RV^L=g{@Gm5A!js(~cc92BQVao*j(9^I#0I`|xg=PvbFC^VXGF
zI4V~c+@>t9WVP1HD7iG2zV&c{hB7<-XVKp7-k<kh9vtp#6hMQi-+dm81{jBTl6B|x
zbw##i+l+)gdH#C>$E*L$@=CIHBEbYrCIN~>w|vUQ?ICQBfMK(zT)!1I@fn%I!=}I7
zJpvdwIHZGSi`T##NkxQ{g8i*9{}en(cY2Lp44Lc30Jmbb4XMqR?jTf>KWJZvtl7n(
z&ck6~=zD#1g)IcWcicZZXJyw)Kyu13O$fDW#cRXKgjzore;Q6kb*rAV<iltTZtWUB
zYEsjFx3^gfm@Ew?9}I<uEl!dEEc<&{f$o*zxnY3~Y5hq6^p3X?2k&T^S30)_*SKFQ
z{^@jWGUD+G4}o*S;z+!<%4vS3(Ba~u!`>O^n3@BfCjRVpD%p#}FlGb6aV_VT<l)ca
z_v5J=3f%?#Qsx-1&@%eUp^f1K7PzOxD!3Pu@6nT0Y<vT3d0LkF82lBj6yK*RT+UKz
z_}BtIdSP0jYZ=uI>bp$<qQ&MeD`@$jinv{5AavMcVT|#swiYx#4D}*}TJ^lmhXCfL
zIXfywr@$(G4l%N_NeTkNc<Q*0nh5@s`l4qvM`Y)#s)2<pE8$T5#R}MT!4b05z`?&1
zU^U^q3aN><oM)S$uh1q4Nj!Izah_TRR`!v@czAk`ChrnScGRh+t=qn=*e2|8^g>;O
zH1KhEVT{kTRtb7Ko4Yima14P06gyA8v7wbrCK@FI+6H2Cv;GKssxywPb5~2=7$m|N
zV7vkqDEdWH+U+w}?~eAr*(O<{r9jJ{B}K{k8?b?V3MSGIVIB~SPr^UNFb9S9yBM8Z
zP<o`B1}$q5gGyZ6iDP^tvXD|I5j<Sb?|VVE=V-IN(1FeaefIQ8mLUQ{dU+whDzkWk
zxiDPacI1h(fW4vUs9a*}2I}>?BWgo`1az8BXS}mw^g|U}YduuEm5+>T;R#o|%t)WR
zc7y|GE17hOP!>7_f(}8714K6*fa*3Tg5B>hdkX7Cv^TisP&!AG0l00IWdRsUK}=Qn
zO_F$NwqeCmMpiqK!dkO5hHx@EVg!4;EFQLDOv#06j1pSt88#y@)&pG)7<2_8QZ(au
zB#p+al+DUFaYs`KGo(&3<w;nk%#ve!v4l?(feat2&gY5gWA{XfL)36w%~S=AZMf!^
zv%l*2ys@<(QcF&EIHp~RfEzAJms}FEpWqgU)Kl)Fbmg2@l4k@rE;LQCJ`I{s5!<bx
zHnV(0iuF1slNmil0ywf#e2|Hm)mVzySIMb+d@qLBFPQHP2nX~<z_QUr%xMtg*_>W&
zd47Eb3Z}O~R*FpH1FrehFxOJ#<%qSh{ByrpT{4=RaJ{1$f;4cRkC%NdS#nFn@7)r5
z1{zW8%Y+s;EIPKG)d}5=#UpN;+D`2QE#hTx;z8^N+3jeo=)cn>nkHw$;<1d;2zSj%
zVP@}1m(Av34}RLxie$B2%#iDEn&#=-6?yJY61KO>ze8COB_Z53TCVEN*2}2cv%Nj_
z2IRU&FbqgTxXSsdJD*Z{X#$ek%TJHyxi1M4n+mH@5fn)nB}ql#tlGnG;A3c8l_Gl2
zsfuR&A*_q%jxcrwCyZV}k0Q~5khiz#Q7BTa(1dK)>XPnCN8u>%%UGRGUrk`7RT`m~
zz%|<jzFP2$wR7YbDd{J)adTKRVMps(uy~u)vN81-T<%hh`m1%zJn5f@0~^+Dm1T2K
zWSy?V@QWwKwT+Ju#DRi`yjOb%GR<JFyQT5}k}7c?Dw`9ER0!>deuV??=}apZk{%ty
zdJQ1y^UneZ90P>d&_h+tN0apIjC{E{rzi?1t`ZX^Sv#kb2m&)bQnU*!2tnGA&YDsl
z)P)TypmqU0dB`OQ(|*n&Mu(OeRBhmEa8SKMuU9$g8VD;kDOC{TRr!C4dVdH_pg#zV
z8qLGwDJZb6qX|eS*%O*iaewg8!At`ac#RJSOq9=uhF)_CMSo&oc%onJpxxGZeoaOU
zZ0AKS;B?A~gFIX))hL7HMjFj|n$1aBj^;%&w%L*Ni{^xceOqzB0c56mJQ>;WF}i>W
z9<#gm-)|3&_A5lEX{oIAIE-vJ=BKr`!w}LFttIeB25hCNu2U*ArgviAgvM;5W(_Ly
zINE=?zk9qd7E{E6cGPQLhB;21f-4Ik?gTy-YxwJ=e?MF`9Ehhrr=9K*-6|Ob?<QBH
z7d5D1#QIHO>}~7k<&j!t{lZmS*RQ6>PqBV=BVK9!Brk_iMn;h1gktu?x{aD+lbUOP
zLtzn}E>DmK8wzc6CKe&&2C*0QMrv#=34p>N3NZGjdwZkfgO~e<d;93c-rqK|Dc!8=
zvBbU7muI5)9lGAXQ*(pR800DlvTG-yvAEm&dMrqns1X8T*r$dcfbwS({-e$KwZr{)
zN3XvJs$%r!;P6Eqk5Hd0A{4BT`3Bq-j`qhSLTCZ(Ht@jJs2`WV>Hr^=Ef%(1HA`Ao
zQ?<`aw6kjb!RnL(fT__b17|fBk@SJYIP2_TUU$evoHB0fM_uKo@G%$i8`FK7jXQMD
z{hlQY%sJ53`J?XrtHZr&|BxQ)M*Tae)u>)Znflq3dDx%3h!E#CQrod<T+cqa@)#BC
z?F1GvP0=uf7*vmThr`Z*Kru#!+cu{~KzQ^G6Nyo8o<*nI=&0%H%k?*CQ4e%j9hZ?|
zQ2Ev<3q50zY1evyok#-y6lrGmPT_Luq*>cIMi<<c?DafX1okvOO{SxyDDpyU6vBj#
z0h{fg!twoDD?X~NNCl@c<S)9I7^8$bX}gWdO@U%Cyh9*FjApX}6D3K_FH_twU5R<r
zUogJB|Is>{VI(IA%{4C4xtgr5P{|-e*_Qmq0pks$b@RNg880W+%L(q_=)V;m?z9PU
zW7JU`PZi;RnKaMPS6JB4wdm|+ZN~x&Xuq!32hA!!ou=q>>q!<tb~{NF+L=MRGBhp&
z&X58HatJboF$x{w3xT#sCd)BIywVA?k(W=^p_)J;xM(nTJ;;TZS$dWiGmb@%q8zHX
zT%^<VR}x~zGl<`nPSnv%$MICgL08iTgA>SZje!h=Omhrb>mWE7D6flTp2UmzR5iMQ
zFlygoOz_j?xvG{bb_&kF8WcE;L%1wzp*nLRBdrOknV+4N31?LtYBeJD^e32K^n{_O
zPsn;8EYA3Ls2;ec7@j_c4xQMQxFH=WQF4hoyir@rU1N)evYZ*L!U?*XkEaQVtd1t(
z7JRcFio>*fw12oeLg`DF(^-ROO>DI(2855N3Za0+0ONaNEIl2wP@$T6%F*N$S6VFR
z7#Tk~J4?n2Bq>53$I(!YfrSP%0&zb#&(eh#;}lJ!C?q30z;Qo1vIm{7YtC_x!8#{V
znZv=sNOZ=}9a{on4907u<H2LW%w`YExjG&TFL4DN(?y}sLp+rhAKHd8fQ!6fP#QvQ
zR$AU96j(H@xnA-;TI__9*V?hoX2}FJ*;CbtHa8QA5ePrcaEa2ar?HW`1qh9Rg`jG3
zd=X6vf2n4P$Ea-SiW7G-(#j05JaJM@t}^pVTuf*3kg_Z;7G@FDG_NsAA!Uw0b2<eY
z7*$oZ(PtRos15k*bBsVJqvhfv0I+kcP7Cq_Mz&K7RvTLPYH;5IjP@2B8?w3&D=x4N
z^y;j!dEIfD1*xSoQb`<B&9K!f^ci?0&6a4Ral<<dL_$!j^rU7W6xp<yo~-hGaI?64
z^`GB<x39C$HZYtaF1r=Ad)%f%@ZwDn!HaHgf#9{m5B#hhQc`|sznPq7obltUrU~r+
zb@!kX0a<%R$uMrGZjyk8+yIo$uqYyJIwYoZN(liB#jJ|86PUWL<+OHibjJ`h6^TR+
z1Ta>t23|Ne!5K&HapTS@h(-oYE5~|kid;))i91$oO%YY<1I1m`rP%yGP>zi>A+GKu
z2REv6i8zpR!^GM6+J@YYwt;nDlnaQ&3EB*UvpBKFwo5-BoJCj3=a}Gz!z5>>A+2M;
zXlfJz*=d_Co=Z|fc>0<00yDy3m>z{8E2{g7%OLEHqUJ_+R`srel)DjGbHmLeOU(No
z`ec%Wug!DJr&QC8r<G>zUI5XP(0Y0?XPJ$5od`{QFKPL!7Szg-Tjl2<<#az=^O^>+
zF;sIut7@OA66z|7j`qJ(I1l;I>!j=>hck?f2Yv*Ow*Tm@P0~vV$|Ew88qw>s{70%d
zP#k&R)D8EN<&{oMvEx1cZF;V-=^X#6bp?yVjQ=VO&t`Y?^KuA-18k+sjizd|m-E3I
z{Zk_sU4Ql&m@07({YP(~KBaC3(SxW@?L*>n-PT~xTZ2S2BUFd(ANM|kSpH|;k_Fyo
zxqf-PSMl8gyz*|lJuiWSWVxD0ZHT*jizT_8Yau{zt>6$JwGS~YP3bTMM|NSXf~#YA
zd?(9Pl@13x`=Y%wP2M&2qr<xIbS+LKPv_#AhOC>$mv^~lhDfOE?W^|Q5IMTNi0ikm
z;jiyx8Zt3au$w=&chfn85gh&SFa(WKfpm2pL5<NIo|~hzdSSUt^0T%v1-hsio42No
z6`g!hw8_Ep?q;vjLjVZvA?Z*vbQC*Ps~*Wt)x^=f!8D~pZiU*dmq3Tw@-paz)f?Mv
z$L_lN_#&NlNYUeh{HNC^z>0w8k%netDI1~@^dNS)I>>WH!zXOMKiF2&+czr=2*bN~
zw~7hh_AW9`vw=xyf}M*B-zyzIk2nr@t}v)%IwSoTTM<E~SZoeHE&wO!w8s9ltmTod
z(=aV0Y<oH~jUHBg1sm*zivkWMQ~aU(&IpTZ$K1Hu!&L@l=gLg(N_T@jimP1>p?VEB
zgDl?ZVhFY0>0YR>*mNy4)vCW0nrgLQ3Jp_izY{{0J6{R)m2Z3_gqjRq2!Hsr|B7Ui
zmYZt$r_<!&B$<~Fe@<uy56fcw5QG%t+xD@o{(b%Rm+<$|AHUj`f7QRokG_2T=ns#+
zeDwJ1ufF=@<1bXXM}Pd{%P;;AZQsQN+x{)p+>0ps!}4^QEtU=CTE72_{?j4`V+nS0
z{9?2>>V2lJ(dlxMMC%3~v>l6q5TNSg8KexjSnpOrzZr4i5^6S9CBax*2YA@p3Sqbq
z?65UAz-s><LTvgM@q!$pw5Nvk0mWof%Xzt@Kk;e+mBZh_0GUhuC^zEe{_f%1H^(4^
z2hY3D(lZdBn9b5f|9rH+YfAS<BMzcY=7e@@U#f;)zu13CAEpq|6MAv-)|kpDT&}5`
z8fo>!W~#vo@D;>&^22Az6i_8W+N3Yr91LzZ+Bwx7y-TiDT{eU3K9te-2ZvugR)cu)
z{p+I_wm$sev`ySBG^Agt=KhK84gCRqXzsd90QPzqlp`%|FpW4u04DWZy7;_=Sn7)f
zhTG8T!r4gw3UzQ;Tz#EjxOUYZg@=z60#C9@0>W?5qLz@B?KlU?GaqwwD#HwzEZauc
z0?Ocb2GRE+tS~fqdTmnLvEJ`Ot#eXr^(dPHHlaZQlITuGC0u{%GP}?Tv+)xK92qSJ
z6nUid@7x92mF)D?%GGVA+sk6jd4|0(y$ZN2`qUp-K<LBr_GJGDxm(a_`%Wu@5%;>c
z=52PbdAGAkde-|0xP~}J=o91R*a%6?D;g0byvh`7r*I$Ig<6v&9qA9i>3{wwx`&mC
z7*T`?7~^Y>1)?0X;R_V9`hn3jxlE?En2qD09!YnZaE^7-@$yKp(;Y8zLvs~Fx?3+e
zG^U1v7?40KoaF+rBK~_YAuyUX%wG$)03JP1j$**(sDElS>e?kmn{H?)nuWG>;>O6r
ziOw6U&eMg~h1<|p?&!>WOg}cFbPKdIBI3xZwp*&cwcNU);nuC~wr*{<RcEz@3ksV$
zk_K9H3wO_aTdi%d)G`6;Ad0^<)k1_~ohz$w?`&DXGoRAS8PL<$Hz@mj5EME+_Z;q+
zZyQE@Qh^C$L+X`IS1XRC%h3WydwM-r--2~b_`aIDojY{bGg!??dt^N{glz4q2?eM{
z=IyB235jMTo+%P_)MG^>0tN?s$LKCt7$9_p6s#eE20PZuY*~O-+_tC#WSRV~=gU|j
z&_yD0iSnqUvt>3mnOHGdsmY20B#Uqlr(7@UhSIiT;L8V?0Q0e`t2r-9@^AwTSVDOE
zIev%CIGAD<JI`{{H^u-<Cic+X2#c*X!kj*_?4i*OT#T>wM(6@^+I?g|s{Vk6eIOWK
z@Gsl)t82<}$HAMPH@|Yc&*E}nF*#qpLGY2+pmBzMonh=dvTOsq3VDF@;+@_S$421e
zT;8^5`xXkj{HCd@t45p=Lwwwmi`eDvUklJWBs)Yu;`AJn?`k-{Pz3E1bDy85V3Q#{
ziK(4rVe3~Yh(SlnB!C2V+Iw&jlo3g`uVe`4)UBtD#ieL@h|F^>D4>a0indjk$hqOz
zJ%<Q=SfQ=x0AunrY-js+bU58z*Ax<)LuTb`4rCc#5P3E1^r{=&vcEDISob@~4*>x*
zi;XHEga_=)ETRKA{z2RP-8iX?_Vy3d-|za`4n^yqM4KGhiaKL9i16Juf6_0p`e$m5
zD~x?mEP(;jJ;ocVqd^Eg_e=}>KfHN;bfUQ^9HWj;&P<|SX=5gY2pY(7bphAPP!z*^
z9%Gh?W__`h*;u`RZae+S-eIs!lbkjf8W#6er#8t$#5Al!_&Z%0!BF}WnQPV6GDFZV
zkRp>99tujL*T-VGeVR-4fk2-t!lJ-T!{YWg&IYvJ@&Yu|Qd6v1b{Mspg((knJ5yiG
z3y9_A(c1`-xpUZk;?5F|Bk%OF2GM(4|FR4>!<Vb~meWZmr86!+$+SlweGuHc1YpqW
zp5tun<S^|PJq^@X43|xaT_6!1FF2{Ycb^c2@gfH^?h9l4XwoTpbptmIw}28W2;G$?
zB{9k*wL{_2B!yIbNzxwxg$aqNrs)~y2&Mj13*RD<dQpHyB)#=ImpJf=FvmQS^!ZG!
zT4^$$T6)(>3rJ2HRGSE7^y#pLui}y^YsH=J85&r`<DUQ_W{f!%PpSsbv^X4WU~@6#
zCdSB6%c8hf*m>Wiv*oVpvMhWlKdJkGm+2FI8C4I9zNkX?o4Ex;ms<^tm^yNgAj+^#
z0EzofxjKVOK15U4M8>hgfkD{RYA=+|OmQpzj<cuQ6`0h*#*srqk!+H2vSO2RilVhZ
zIVb`!nHW!Us>(-#q@WW#A`z#gF%UN9@Z@%5^|G)nDXfAj3$gRT%ZI#HE0X&Ew|}Az
zw`zE#8w7Eqd<HjqJn!;l1&IJ!%M?oB;GCvHka5;F8csKk)4B7h4~_8f>0%J9k+>Z|
z*12sjUW>BOzS~>}lrBt5BB@ec06sv$zsM!RcZU7yugXgXNF{&7kK7T{E5z>-<+?+7
zxDiQq>q3DrrZxrORrijff~FwedW(c?qzPL(#WiGZr&(Ffl;Mc!Bfc8HdHwojq~7el
zIp~3A#O~mq4-St{b`SUVqYIF*y@2>Kq}w=~TpcBG3F3&CZ~prF;6*f@Umhh2M_n>E
zp>G#c65jf7{Brm2e;cVEe_^zsdeC&<?#YQFG~qZXngK5d6o_kLgpUnFR;BifeO<eT
z&~s3dID7ilhic3;(zSeV<073V5$3*DKg;+!T89qSQ4<2D>xeAY=S6%zi`5pREM}dZ
zra-}hik3WwP_tBX3);TQ>DGw(VgMO)!m>~Zy{<?u^b)vAFoqxG3XHGf>mJH@6u-aB
zpiPXi1aQL(4(;_miz2d@rY9!WG)TNU-W&aO{|HLyH=~0e{_|^i5k))=bvHrOr9K$J
zB*idVe+Xf$-oDs>GD64!r^EF@*D4a$s1_=<R;ayFe}V3B2|hD*d6)X@TYE<*|KATU
z|F%Ay<_e?3f(`VF8Q?wM-#a;YeJDx~L<Yc<lcPQiZ_tDDwbrKt7Hv>eVmX#U=$xUw
zeW$bbEOHidNA9fR=ex2~_wPs5vY=CiFJ%6IucGK=CUT*5XzI#RS5c8bKz3M2^MRCY
z(FXh-T1_9T^P&y>K?FD-RK<ZN(=$wNNiX2hU|6?ys%SFy;Ms!_DApw5^xtqx6KM(P
zR=eBigaS5~0JtC%rmco}Q4Gl8h@xxVhY8rAw7*P8pz2XqbsxrHzLU0)jm3;?1&VAw
z=iw-R9cIMbRwxWheYfVyqZR@08?}~5FN&j}Dcb1?lRx}!E!yzWjt_@Nb97AV+!=ap
ztTvCJ(~jBRGtk~#+ysVJ+(HgEeTOqMB+qYckn@TEwb*}w*74Q`V9oYlUwr-e(O16x
z*Oz~M{BQfOPw}r}|Mku8@&3P_0T|nb&SvraPHe@>Uq79pm<f@j*rnbqS;Ulu;bK0T
z<r54A3yzB7y~6ab6t(<f_heTQ1#cAT{O#`BmnW(=kt*X01<@PTma=%3lt2DNMlI_)
z?jkrgugA+pPCurKHZ9lD9_Q{&S9r#0HU*eN6|OtXcygJRNhOA0-zmjvu09Yttn0^n
zrMxZ|$;`|b1?+n6%rFcpDt$!^;RYzk@jNb?f?fH6v3wCc3-u-w@UAxDc`Y}DuYmAH
zcYAt?guq+H6<sXPlV~2FQ~d7|r4u&da*>?J#e_p&RA9r2$*yDhYOnu_{9niM6Y-o)
z;T;*(fo2VD-FKEnFDpsF)pSLGe7b#MUFpKD#819YL16FGI(YgLwHAjtdtGa59Yqgb
zQ3PD$e-0r9iJN9YqtDGdDO>*}`TOVzClk^>89PB|>!C4o@Fs{Wu=$*nA}(-*C(H^~
zciI@ijJmFRVEb;@2v44f9HDoa-41>&yjB8EOLMBdxE#lmM2jmU(g<NBOr8vg?Ghld
z#~|ke$fY;am||dntS?7Lc`zO#^Q&?>2BRV^qZ@N4>gPNuz*>oAu7KS@9ibM7O(Yf<
zWI&;7WO~w^f`L_4YOi&?6UBk6SJRXXDLyBgsj(sg@>xVM4z?8_2-E=ulCASCo~Rz7
zHq^l6O(6e<NG;S7Nr-`QQHwXR!Gm;=EiJyJ=s;l8xwyckRES`fo?lR?l`=_YWPge0
zT(JWaRW!RsaU}#CQcagUC>x|e&Wz#%#lSd4XR#W=Rh*Hvi6V1Z-U@@7PSs#Jv&<yA
zOpC=bp6Vb+C^6BoU&?%z*ezIWo-P-gR^pB=R-?gm!W+o-x*LaR1HmzpX#hm%3J{|+
z3q=h8!o;wR2#GhUEP?kH4FIfnua1b0HWq9?5+keTU=b7sh^&1W$5q757Hxh^^yhCY
z@UaMi)_ILl+`UjS4@cSsB1b)q9swOzSIk3>a_zmo7y#M_r6Hw$Slj&LZbl}dt95h^
zC^n6dtJCA1j1a)L<M<HLKhFAvk3|f|@gAx}bNO6RgfluG!DgQ{U9k30au|~!Q7UqI
zCyVItwI-BU!-!X~&1vvXF%roX3?7R3+_m89%h-WHQrx!`n#~<<m%h)*#RG-t&?4^1
za-bU}-q{JHl|yQQcMQ#Jbo^*P9${Tlsd^egKWC__20H|=Q8k{v_i6w-e-py#6i1}{
zlaN$q4&lxLb8#}D^U9Vpk}8#b8E}@Z_JB^nh&NW=gr%$;ih~_#QPPf~piiAN$vnf1
z`%<;srWJyHtk5dhA+o8(>E?3`!sRI4bbZcU2Axwem)g_C!W18HYzUsDw()2`xe9(j
zaF>;Q7CFEU%~phGtjf->GLzlmKCPGVgrpbVu(Y8XO=(AqJNJl8y28LplL=CTNXp}k
z>9kN{WV{2pG11XTXD*`&+K@v|1u&tggAw))w<(ZN@Ui>$<TditAZ$PW^Xr!{y!-Xe
z+aK+23m5f!PWzR$Bft%;vgItbS*mnQ1<Na{nCVU5X7wf}I9*uJ26oel)EE_h{xt>t
zChmrNU=Z3XheiWEeszPJGv;H7bti;|=!|8$qMji|LU}pGBp(F$UfKO-kDbUh^1;&$
zFm<1c>BLdd^XJja??!?#rj((25vVjDV1qg6D_^5(143|%GY;WtEtSw?Th8XpP;-uz
zDtgw4{5+nInsdL|tVvc>fmufk^f>vQc3&QRclZk8-05W$Jp6yZ-90>c`${@BXsJWB
zo}aV{k*XPR6sjVwN-bAV*MiLJr6ViaNo_{$wMdr%2bktR=+IO2z^<;CZv}pI@#oKM
zc~w_e3to0B4TEM}X?s`&WnE=cl-|@tnE-xu9eb(LylgaeG=zXmAg{dZw-!nbkcw2A
z_P&=?g`iRcE9^(^+skM3<w9e$N%G$4<T3a{xsWOK(5h&XCnbeAh5E_+abm)sD#8*<
zTgxAvJ_B1GolSGqb~xc(?TB?s3&0eba8A@>Xk8uScL?F|qv+-*H|2d@>;bNAxN?O9
zIa`s94L+G*@^++Lfx(9jD^Q}4Q9NVdH?K+lcnX0XAuBv(zh;Z8agmqcjCOi$vU<q0
zUAvQ?mymZFv2dBrQnmEcYrO2KzC(a0MwjKe!omutVFsmU;b3u}d}i=Rj1F7TSa>s%
zN7!I%Z{eQmyG;+GTG$NFl$`;OJ~8)Gn2Ep)hygN;$L<niD2%taca^vb-+TSa#aFXr
z`U>2vUX=~&1{b2P>D`O&648PH9+U%o`c&4kky$$4fL&2c_iJy>LrUx-q;pNQ+`)<#
zcCTD7EnyqBw5cI&GniCN!>EUe$*5_UK~>SsL}}z_73m$FS;BlK5@`;ix?(}X(->X7
zC22=q-a~~5z}cJ*d7N<$Iq0OEC*$-i1(BalO=qSH7EI{OL;_tkHtj>sHXAZ-K%iR~
zEzK6N0Xdpm6`7$vd*U&aTrmhBVKF$uhbsy<Ns=}or_TtoWmw|M=aRd@npCfJqNa8#
zIUC!FDO-mYQ`1zOvqUc8pbGQBE<{5^hrlA*L44k^DgunrtCkW}G^OI~rq=|4g=Q^M
z1y03;fPw-}qmgdDP@t=rs8bfDD_EPP<<9^>K4cehrtWgE+*Z3tanmDYvvDSD$Ojjg
zO`%9PzQRplzTPk2rKE$f-x8(=Vv2Z<F&U<dbUsaVw0(oIh7kl7rn;5GrQo$ZyJj;$
zG$j^Cg+l+^{Z<T<LgSYN`Ls$}hR*vlOIZw{cd4q&qv+mCxmyaq>y4$YdO(1Ll$`-^
zgl~=!-nY;WGzx^pdILdTk3nkeePah}`__UJwANv~oGi->K<Xl$+I?^S&;1@?cy1XQ
z+!MdxP8|>1cV7=2ZLo_zDBBQqAcmmj5|ZPqOJLb1U9_aI;7v{`M#jwrh++lnxo*sM
z)+!%Dl7z_)!KV}P?k<XxUb&0l$&MH!kUJ6t5LU>yuoWNx#&er;#*2j(BZ1ixyE@h<
ztCtci4ptqKs@bU3Ywd!r_C+C|tfu7l&bT;eoj8I{K!3M!Dc^V&xxjCw6ejVLBdg#8
z_DrI6pMDW6tGxqVaS0!f5I;)?<bl(HTpmSZdVTZxVfYUaKU(2yh#mFcX#%ShYr;qU
zaA}qy(mv3ReeaMkhU~Dkr9+Fh(;Sj42$KXW$ybfcAV|b`bSjlGGA4U7zbNuKM-G}$
zn1Tu&H5f`oIWH|VsKXHmCAYq)x<Ycj1hGQO>2zx@sb&y^D?~H>2y%_zgs8QOxX2fF
z*G`}#j`vQQCnA-P`iSnV$j%3-xi*$LR87=lM(x2fDQIowW3^_m8*=B;5!$V{@UspV
zNnGP|zNK1ayuqo~bF3deo)91~3zzo|)v|6ZE?%W1vW#VVlpxVJlLHGvr&KIbCEhrv
zqf0OH6|`*$HuseAx0OyinM>7CTKDC_4jpN|+mMh^a8R9TvI_feNKqsS1oLJ*>Af<I
zOqv{?+oC~>d~q0R)X<@|vWMWMD+Cc{Sap4FKBuI+lvmb?0X^@#_>*_UeF}$z4y4yH
zICL1T!|(N>n?ncmVm$u#1UjCvTL@^h8-TAes^V$))&R#9!O(<m5NrEqHQF@@y<ShJ
z;{#xL03%Tr;fRs#5-|d#m>2_6J2GM&hPc}e()j|p(fv`mJ{+av3fzUcTWao}KXpX=
z+={EeQ@r8!M-=_u6zjLk3B5BPxu;zcNDTD$Vu;zD)aq|UTAl{8fm_j??i~=Ohd6jf
z_`1+4RbACpw6@@a5T!_{LGzd{f-vDR9D@y9HGdU)_49UCPg}41^#?Ltb{N|_c{_La
z{`>90(SGN_lu3;uuKtqu3qX4Fl{Wh}H^{!a0tCC~_g!bQ&n_ji`Sj+@m?O2_NXo1t
zuw{y(Dz3eyls4u%OBUGKJ~wrrg7Y(bW|{YHTubGeaTS#@fq&D@BP`zG3L@XT5t?p?
z?joVFtx9mfy#X_)q40GckByi{yK%Emq-eyU-Z13XwT_01LVy{B?v!nrVTYM^&0Q`7
zd-K6n4AqT-v_m?LxG-jPY;~G+NS^8^G#2c<%-lr;5Ov59*QP<+GSWDnbmz{4N+x^C
z)SXKuN_1o~Ay!y~jgl8qR!)*xoJ}^l6l>q1F%<BTtH#jL0nESz35D&O<n%I+3k4<^
z;ew3im+Ha=rP2imbBcJ9zJ~@ekZYEMC46#rmX0w@GOD#y@j0lgRO9oD>k@;Qvg%-2
zsxB~OLoW1G(40_J86grL&C_cTGGfC4fsv!Lioj+SXN&SEQb(xophj1fmUFEL%aRy_
z1PC32Xwn#wBCUv$s*AWVAp$Bm@RqVDK_vJ%RVKc7e0M6B<HE(t^tO$>&>SS#jD|2>
z+mIB&r)z0DAj6^ovxsJ+O{du92)Hd(4X;prIJp@vF4%EPO(DrG(!4Zo#fBj^?JG@E
zy7v(gh_)1xlRD-Tl9>+45BEj4TVWO2w=?OxA^8liY4|Ld3%4=&Xjur+Dtyq~gCMB=
z%dZ}<Ih!PtkTn2hQ~tF2wj1-6we%5A8`a)dC{I+!uAF=%UQg(kNfbFG;*{-^@$|Mn
znp(Dmrv6njH|+Cck5V665`^||?F{{Y@L!AnKW*SGBLFn||36m$`@-}8f2_*?+yDQQ
z{Hyr?b4u%f)d&ESvb@7s0rQK_No8&wazG>KeEJDO4^R~E#hS_4g)erX&|i{kYuhOk
z4S?^cCecn4VBqG3qISm%4l8UYpc>YTY~Cr_gsB*i0#460OEin$kK*wnMV1msgO}fF
z7=+C8yL%@Gf88H_dvGGc9Iz~aq8*&3iy0cwp5;avQI5ph=o!*f-yEF0+I=%RIQ;gt
z%;M2!JC_F##n_cHNX}8;UX@GEm1$5#a0m+eNd@E&<f61eKH>D6eW_jBGzwcvzTzST
zzUT0~$|!3_C_)n;h1xU%Y)Fp)Je%|DPdx;=2vp@RMxa3zlTMh&X_B2UE><2-Ktkna
z^P~az!`&!G?uctmU3r*t8hWTW97va^&a2G17XqPVmGx^f+`rNKaacQ$kROlsb`M8y
z-X49oj{yfmqqPpGztMhkyr|}({T{czW}&}*eYCg#qJBQ)i~L&wN6TXK;C{!;Eu#6o
zQOo{%_vQZa-hOCC<$QXlNDTkP?&E0%$=2UC?%MlH!^8dPE6=l_S+Y2r{>D6)avGlo
z=IItbm4#2KxjWmrSpu-Q>du*2x!WZQoZi*uRR??b`xeWGmKElJRc`C9E{a!^f>wnn
zvY~lBseA8ICia7S-^mK@m&Utk&DN{lNu2c$%7BzZZ$~o<uC(Z)-sU!IpjEW#;1~Pa
z0bUaT8pD8r+6L%6w#ArUqg?-dvYgGM1tnn7k>wfCSR453QUSquS)fhqPUz!BdVaxQ
zKL*PKvh#0sv>sqr^2PN$DRKNf8Xe3>*#BcL#3X|_9rGdu6$U0*L{>RPC%2vq;O0`n
zCTBu08k4~TmIkX})FK&QkEgzF{uaklpr2+QW$9cT^LSFrumJw_aH}}#A$F#X6s;`7
zqPSKkG@d5q_)gZsX0!r%yM73+k!(<0MS4Corb+9RBw(mb%?n>xduMxE8EZ4zz5B?1
z^NZ1WlJ(ynzCGT5Va7wL$nEe@=wKg*k*WsaTAi6EWrlIT^VxjR>%n;iyq09k8C(Hq
zBT^)#LQ*5v-woZjXR6O-k$7*joR_ipA(HPGmg{$3YrPf$$~1}3FbXdKrBOE6jr2>Y
zeVERCFxsHDrM-pOut(~G^BOUL6B|LjBdyUM+^Qp;zEA499tD+M!6n(@xEyHReSrCA
z^Ri4aQo2r3#|pIZ1^8Y~qI|iC&We170m=)7I4IZ~YDv?D%|xjtqpd(9(COek0b$cI
zW9=eWxOU6|puza&BA;S35UiVH)&<n*^I8Zs4^MIsP#iw)u$F8v=`LvVT5{v8ho?0(
zs`y7c;WcIu-Eo45@Ms*hm6%Vc9R}(hc9f-??TA(K;AfdnH=(?7UWerX&l}7=_<4yw
z-y+hRiJf<@F7yob^Caq{eMAo%On`BfmPwscgxHl400Ukq!IM$Nx|Y24&VyrH5j<Db
z?VT#jxSThg64A5gJT;6sm$OMriTe)SG%AZ7Y$5l`TD6In)@Gv#p)dsASDiT~X--4W
zLVyvl;izs@$XLL=f@*?s^TJ{gW7I{+ofXRd85D6qu^5{R1zKp*&^Ks#8^#haXrN+!
zG3CwY+H%b*{;3rmTs+W&jKXlUvDFw6I2=qfkx->1Z@FjmP6wd)7_$ypEjlm2a3TPR
zav#Ix%`Ucf!HJD{S!-9d-a-;mHJqa*kIqcODu)gD%Rmgb+Ne^J!(5^+f;+Bh%}fm8
zIJl`0uo3e#faeobGDaOAs%D&36EwRTVgcRh4?0Yy1`huJ?7ewk8%MS<eE)?{(Z-u(
zOJebo3>Xp&*x`;1egG$#YkTyxqy~B{sTH*ZW)eT2{XJW)UELC1lFWUhUt*;0+UwM*
zv!ANLRmPNYMhEv4pfo!PS?v=jWgR}odyXhZG)zAn9{&B<)&{A|-M4)WL!XY^q|z8V
z>7ICcS^`6Sl$s~~`ehmqC-{XzycE(n%5SzrbewRkNKN7uy<!>asBnQrA75yOojxoF
zQgOV5C*&^K2BwdK)Cdf4g-t)s&Nf}&MEjjm#v>iFbUbNx({Xp2PB=3caE>{JuO*Lo
zj&RG=A<}ushhq#{97V1?_sPAVUa@f@r%#3z=bAXLCfR%T9RGbz)RS`99?Zy=lO-Jm
zqv5o$s^^5LAx>+C^eqpR{T`F?7+zu)GrnN0jBWzH;@t328F+dQ?HJt$<NVkwYBmR}
zJlQOZ?eUp#)J@WUB^XtKO$ZQRq%XFQ2#kK-d9i(bJSUj(!pwkm1!A-$X1p54j^C#v
zAZ?{4XLO_O;_TNK9L%|wK!Hi3qD&}@T5du)vl5^-u?s~WbDZZ+5)IN1<O!!h7~?r}
zWe&NUOO(PPG&0RG2!*!lRN);OQQAsc0?Q<V<pxYpBqpk%4gn(qA4XEazz@*gs1Kk_
z-Hb7-4Vs2>{T#jl_%n2lG8{IbLzKQDnB`Mt^a@X;--vEqwB=EemIj<bZ;(jy*(HUT
zFc9qmu!R`#T>vjo_%Rjn$_DU{0VCq*c`}4KPB0orN-oD}LT*HEBr+7yfw_aw%G~`G
zlo=Q!Xd^8k(=|o^t2Dv|DO^x?!f6L59Ld^}pY)P`Yy?sIQVDpvNsG$aO@8|RZhZ9|
z&+YQ&BsIfTCX0UK!)bYrDNBYb=P^A<e3TpiF>NrRJ^Y~zKeSjX%dA2(%9=S(^NGI_
z{qeNm9P;m}RbWWMU$P%8dKBtXDsd(KwO_cK10~!C2E&?+dhT{>VBz0*wc9!g8&YhN
z)Eya9Gd5z*+dMJLJin|d+ZQOfG=+5ul1{l$@NJd?%n$b!d_*WNfeqx=ZQ!h`9q>*I
zPSj%6tw_4!0%Knku0Mm4MCbpW?>=$JB$v>Ezb>oEhawq_CRc@Hfz{tBpHqf;IC06m
zM?=M3;o;XulH$Q4(CwIip}uXN%RXOpC-vMDW|x%(W7rXQPw{^gk9QICZ3ERc$bh1d
zDB6@|K&qh>j>sgA7E!}=2D#*4i#xy^*CnGNwbY{oh?HV6R^S{_kojiZ>uuPH4?9;9
zcPv71w}XsvWTc2Ngcky-J5}VkI#n2Sk%Bl}`{>Mpi2~i-mxXb?@@5`L@s#@OKvo_|
z`$Q<w%d8Xe$%pt09$`9;g#mx^am-Ej5)YMAx@0<%_Er-`Nt~5BeSC!Y_+e^VIo3!n
zPzqWkzdUIFswYhxRElkGZOVeobs%{Ffo7T#7~d>sJ$zY;8W;i4M73dmF0B6s<A<^0
z6OB=s5%EH~Y4s<zBpJdfTu>A}!;q<Q_gts4xZ<2JocwjHNeRW>B5YO*)N{0iH4z&E
z^n+H*nxU%)GK2DHgpqtIPG&iCsrp0b|6oIC&pUTxYPAUi5m`I3JyrFux*W{Y(`n)K
zdWsx}Ky?o<(a36y_)B1Wu5QYZgpDK8`>S;)+_^=R+o1t&%tl>6mQxM?O7MJfMXDa8
z=@+z`BT}(N3ZbP*Fz6z9jSB$3q?ow6J@Zb`N8POg$6SL8Zm=~Vip@t*IV<S5L^deK
z^>w0%o4{-;LLfITk#pe!_r~^Q(<)}%lMgRgo`nG(F`67jI#&8fiVI)@g^AxX<|a#r
zQ%UDz)~}z$Jy|(xKurn7AQ9}{K{ZV!d+m61p5j0UhVwJBqM1MCifVR}e9}aldI6n0
z=_itSisTji8;d$Y)UX;Lu1Vgi#!*;~5LJ-A35(Z@Mi#!b>XWdNLLv*-M<4T?YjyWi
zMqr!IcI8$3mQV9I=}mzj#oR9lEJ_GOQqyrVC77ZM9Br}iX67br5f<Ov1N3^%kqCr_
zNlI#@H#i<UoMuXy3aZ>IFk*TUrj#H1$KM@Ad9<pBTJRJoI<f%&Vc5s(8Ni=9odfns
z6x>Jqz-44a%w4VGotr(O2(Pp6?eW(*6s9LzIsUna<@dR8ZK2fHzj6P3aH}NTRwfWt
zP01~_qdBVmVaZm^@zjG-=aX>|Hm1V!{_021D4{+A3OIdUenn*7pecVWIW{am#si}t
zMx(5scCVuDd6sq)IWBm=VTJ+2YPcdfpqQVki^;SkBy}EPzQaW=`v%0Qv^p5h^9rqw
zq|=nkM(nyu$P^{|Ebm9FQoxrIHhR%W!X1QMNYgkES^gyscH)ri*9;8m@%tuHv{2Is
zGW7R;8NmdEhGsrtGcM8ORT{yBna!Bgy)B)}QMderTP};ES9+p~g4*xw>?2`XLRM8T
zrp=wLyVZkex1zo>?lKWKwm2WgojVHhy`VFqPEiYSHjT%CQ<EfjxkH;ZWVpq6C8)pT
z21Wp}=>WsuU@p-EBq)KmpKw5%0>4RNMwAMP8_--Ui3{E&9@}bY1Ahm?EM+6|T2Q36
z7ZfLCw_>>zXj7vx8ot9uC%r$F<*t2+vOvrU?_s}ST8W~Uv5SS+`f5Ryxh4ws$r|EH
z$L}QF(Gow(1*~m~wHexs0p|tTUS8LbeM2``qC^TxnjBNa+?HdNX;EzKcn#a7(yd;!
zk9CF7deG4c?bU-~j|!XhQhRkfYo4G}RDs^ubd=`i<f|8OLWgk573%IKqse)Dl96tY
z7e|$VA0r(yMuo3&RE0Z-M|%xXsh5*0w!1(n2<r1ey}0YxU`u~%xvZ6HM7%c2ieH1L
zLjwiK8}tsrtGOhxl!Zwgq4{-8;I0owLCoOg@$zIMRw%$(be{(tGZx}2LkfA01@N3d
zKMU1x&@QKv+HPIO@?)3@Y?0qe7;z*QY1dcOf3Y2RB=GG)%F-VDMls)En0>T&+i(k*
zD@Wy2)(;d>R&1j>7*m0W6E(o|gqhM8N3YG@qn8mddpx`X%3=Rhy`}uPaURLF+c1{*
zSvKOR?dgO~Fs8r+_I2xWZYi5N+LY+tJd=C9mK!?1BPX_G!pIr1Kh6*(!g>>*yAnHr
zQbXWij6Ibnc!wMa$VmYq2`PKZD<cC?M7IEk*2T=yX$UD))NELz)XhEF^g+y;xe~CH
z&qB3UR2c@ZV>@Mffw&H_geGjF;ls2HX%_WXcFtviiUgS+YIrD2%AUA@h(Ju%Q3mXh
zr{g?2WcW^YQfR7W%=oZ=%-rEH0iLgujoEpHz4W5!m~vggk{Y9@kLI-PrAV3s@jHHR
z`?xR-h%#W~%@?H{PLLy>MDbY+loR{8bhBZ1I>yLdmfB5g);LkD2A2TMCgI$Y5Fv_b
ztNm>6#j-u%b1}np@y%fR?|)P7>+4d#de4e&Dn~M_S<may0aewIc$S7{1Y0tH*h&v|
zmUAW!S<#0<{9Z&wnO`7ov_Req7>))vN*_Lm-&0J~DKO&*&ti!|W{!QdyGCopWEhc0
zF#2U?g6hdXixc3G-ZA#GW#QBnINF%22#Urwzy>U_UN?v$6yIV7j!+A;VgSw~o*KpV
za?of=pofZn=j~V(4LC}wXtWB<?I5xa)YOZFY&hCr5q@UI9P|Lb&`)LL!MXYi#~+-x
z-%u37Yjx|yA}sbAa1-bygsBijKT94r2Rpz`c?LAv`hRX?8y~@bDtmuT#(mcEeaUs3
zm)KpX+{B{T&fF#Q-wNS*|EB>>sfg#A<l;3i|FCe+^;^tspG&ibC6YQ?Hz(GIe^~<e
zn+$vAH`);cDNWjUu3mHn#S0p~#Ub}=dDo%MQ3bE(I9d?f&9<Lt*z>Tbpw!1V^m~*w
zn{fp^O^vKh;6;}<0tr2}&KI8=ra}4qsdcV3wT?5jg3K{+qIn*d<CNf+Wbgj54!RJl
zm^<N@onRcIfZPz}WR^TZw?hLeS$Y9kr&*S`S-!{CQt-lEul<hSzH-@+Ui@UsYB?zw
zWtxrKB|%K81@YEu6~i<Iuq4G`awSouk~-2nmkft_RnBC<%sgtVS6RVau7x#rfs}FG
zI7L`cGspRu^Xy0W?Lw%1eX^)Cj)`@mx9Q4(qHH@T!VU`Zyln_$(okG*;8#!Utmwn9
z+#&_@w@esuale)@Qsw@{-i>-~eoBe<OUdwHCCUxaT(ersq}7Oe$S57xljJ=rE>VLT
zE)n;j?KfJnn-)>G9FQLAKt>^3SS2~b(QI)Gm<3PTKpOxc4$$+5qHDA-fn&o)Wk`10
z^qq{<{eBAlYO^+Ca8S>WmcqbWjFbGFTTuRSspVAHODJ<QIk9p2<Y6~q7Ly%-qkfjN
z%ukPt4UExqvy0aIR1Y&DFndb#O;sV3;IQu{K*Y}WaU>B8q~5Y+=-@7w0btyAq5n{V
zpt8{#04LDY>|530%BP*rJzQTH$YDft1G&;dd9Y|8+lOW}y@n3hh{Zk>@X$XL@F)b!
zAIs=N!P=paa%B<{h2MTZnS3~+2wup1^INj`pAvRznPkQxh7wa1<$zIaO97Pxlhc?h
zk)WgmL7RaoY476*PCa^bvRm7%P&aiqBuy1P-YCjsb(9mlbF>W?&-@Nk%3%_1alyI9
zEztb8B-d&K>gb@i{zcqRmF1b%pyMTPRr0QU!<>{-a)x3G5jGCtq{%VWXqcV}E)Nqa
zt|dz#K#$%93kTqlcR_i<!7=Irw^_1}6$EbRRLzPeSMW^?oJTWRAv|Ur<Y87yfqZ8F
zmOd~<)XyD5kK%GrOv~}uR*09#qP3CWcx-!y91$0tQy>D#0+g#nJro{ENopzJ6+P`|
z9XPiHMx2P8V+vwxD7-a<D?62ww|GCfh_Mk2J&1=wGwLSN!KFbty^PJ)IR9b9r<?Ly
zi@!KUXF{Z+-Aa0Hn0Ah{WkmDXUdDyh_!{_&jr)d{ZwxO7&6WebqhB8@MQG%hpNL{c
zr9<_YF_>jO7i23+qa#+y4T8I__y8-WK^0d)yu+7Z8oGdReN()z$~5RJ_e;QP=?<BV
zx$gD-XS%xGyJY^Wk?usfAcI$<C9e(N2-m&DIO8!V-18%km4I>ZUMncx3bV6qovF=`
zb;svidVvd15!LR6S0;<T4zjNR*NWS%1k&~WR%8M`y>sho;}d%_P7^w!r|f`;4j_1j
zEqqI7RgejjiRduhNq|svbLjC2H%6f<2FZ*7ePSVo8ZzL}W|-Q19h1y??e{8e_bP&#
z;{JSj8HV3Y^j)-y>4Sq7fD%r}Iw!rPGd;tDqUP-i^^_&VK{jlX@tiJp9s?X)X1M>v
zD(CA|l8Z+eU+9Rp6qtzj!|Za{gvCbULP25DI%`F}DTQ1?#VO?ul-g_c=v6WXs2afi
z-6U!P>W$DB4N3!tufeNj^?H<?#p7OIlEJ8fHO!a?XuOfIMFj;=CNhC54>KI0r2SN5
zq`1m-MRi0Pz$e0*$D$>HVCA-<LNFubXq1g7nwrr>QjMvp?3C+wv+0<|J4Bzp4jPou
z;`J<hY1vJ(nBU&rJzB%G<TW)p;@tHQi}Oa4P>Fi9P=tsloJCt9Sljwv`GS*Gsju3a
zLwQymD9u-gTNQ14E(FyuXbNI7Mq9-YpUz$5tW8A%Sdk6=gmIV7&L`1u+V3~ft3%3@
z>l|$=!oqlrBr4j`W2gy+g$bIpDI%HgDz=z6u}wK@1({V?LM3YfxLVtrBw1+9um$zO
zz`n7IO1~ST^oxG`&9z4;(w*X35hz&@BHh?@i<BA_1x?UCT1(+v_0FPb;h7(_*7GQ+
zR@_#26nsj^PyZ;CyP$kM#d65ri0}F5d^d-#XS(&xb+5fg2!;V4kq49U0AVh&!7^9!
z5JjAOO5VY26gQ63zL^I+zc7fE*#dG}R&1KQkmi*?vyJD;9*=B6C02efOL7z!kEZO(
zOxT*bg~l_>X&5fk4Gy}8ZFb2~^)9(^{VO9*F&UCglL{n#rDz*;gGFmoJe_`!Z;`+q
z<J?u2UNTb!o)$-A$Su7bw7nA1h8I@G$1!S>ygN=iYU&hWFo#jVEtsG>lN(}7EW=7U
zH=!+@lbk1t3ePa7yo~w8ij^JX3fgWxrSuyn4(6zENa-yQYdxCUV(6UaH_4`GHCH_x
z=vQL>nqlpeywQpwC*nHc+@t6vUf*ac27K}<kcJtV%%S9BDC9|<jf=@`IqqLzs^&}B
zR1CLBNLd~dFsn9HLAx0myq>SSof^t;vNXWzsnQj(_%RB<ErxinF1Hwb{T0b&s=UlV
zBUY{$7*IKdH*8gj90O9<xndE`m0OSOWu*svNbC*=NXwx`Fq9oe(~;8~Eo`VS0gQ(C
zOg8#U6Z;{hdyw|8qOFP%87f0g_;<fz0fkK{i$a0%Xl6HJ7za&wS*|l?h?|C)@JR;E
zl0Grz?*}|HXCVi^hh=dHJW3*c=nky_6;1AtOi<{4&?E*!n*Cc)iStAu2II`Wtnj_$
z4X_+gb+0#cAX?R_A!Zi}j!|A_su?D#a%5Cro^+<6ooe+;1#Bw<My!e;)}wPMVry}z
ze<IPm1)Z^>bW*jh(_2RxtXW92%hpP&{kq<&8B-6TMeQY##juvjUChM_i(6VO8B^(6
zSroeqO%<zX;N#O4)`3Jkpvc)<=cW)O`B>p`_Dau1gT^#po=gh<=gjL2Ghusm^{h*(
z#h&lpD>}H`oKZ`U#Tqf{5xFosS^!@_QW<4}teKxjtX(44CTBATS^E091+Ag8HRJ^p
z!;aXBeYw^^sfO#2q8}AUJW}>;2D^ny<7fhN`MBr@;3=aFZAl<g*!@$WmU7X<^f3IQ
z<LIrK24ssxq2oyQS-P<(E-+mQ4RcOWg2{q|DefM*)O6A_iCt1>zcG~$1SxooXpBL$
zF_t#PZXkLXi7-P6Gg(4PAS;|P>$0&Pl6E{iVpA^FFc*bXL@E{q_{=xRj?F2rq{aNt
zmR5QMj4y<#B56!n!D;3JVIB7g<3|6PAV%BXJWTpVewq@G24>o4PA_+LGT{qfs&|C?
zWZjA;A@5j(<F$N}7t5{>6;WJeN+~;)#;1jD30F*|<@}D7d{KUYRh6K`T(6(l7}eFS
z6`~y(IgGkpeoCA}KT0Y2kC8HPWcxUG0vKT?JE|>c2$0M;s88_ZqO(?%?n-^@ST}OX
zVt86BQ^8$Nx$xaa_;3m(;M3Vsg|T#@yQ0d6`u1yB?qYK|)bpL8fjUUkcyh&A;#3-t
zYI)Q6pWCouG7(LO<V=T*cP*%SnnwhIv3XTwG9!x6LKKon6z(Fxob#db|21JD{**eX
z5G#2@5i6diBJ}PCP1Jt#yLrg_7h)l-g`>1AXW_~mk>|QqO0SbrDRr6Txj1}7!(2Z+
z%(cRFXm;%L=RzzP!#mk2%W!qR;i6rFC8zL{-p|0GiWmG0&(Q0Hq;ORyW!O3p7*U!F
zgvc;f{ENkP2(Fe|+fB<8#;PfO6syrG-L!2pDMgP8OJf^i5JLt?r<V<2IXxQ%Ul;Sq
zUW{R@%YvDS=9{Fzr<!FFT;d{dcP52kfDkb9wz*@Q+ffxtH$j#hBR$w2$u)CMweoF{
z3@FbQy;*6Pn1IYaGD+u~3rJ-d^Su#<WmG@vUg|<>%Xf>BWFR!#W%`qys(6W(Ih#>o
zze(R29k$_YOBG$rL~6!!lyp($l1Fllz<Et6t_W)dOeRsv^_ighp4Zld<s->6>+DJX
z%z%y#2ie(KpS3v%^uWO~<)DC^+_CG?Bz~XdoWl}LERpUc@`YNEsH?qXAQleXyTP(3
zbD6OBy<J}z?13cFypqh&xF$+%WvBUdlPtpNAI~Css%V!gdL@`#xtEj2c^As7ue8tH
zNg(;ttUy*INL(6?(?LAGTEa$+7?Bdg!4te3RBs4EdJs|#-*fOw`(jh++w<H-+5T;3
z&6{Q{f#5khSKafEvjSUkF574@h(~6~H76yNsC%JAZC0<kL+*Z7uS+>xM#J7GteLL(
zhpie-0P}+66AT!1mP(>@i&;QlokS$_e)Qdn(;%@wLbjzdPK6&2w^Za(7Q#&*0Dt%O
z3H_v{Y(zD4<m$Eq&Q#~nR0YCmL)7(2fH45flfun)J_XzZ`%jTzaf|q-for5aIUn)$
zi?CrXlVaMf+54b#XM~bneqqF<6IJm>D^E}x2oMW7P=MG6UnpjRT$CtM44c!aB$|qQ
zYM90?n^sF9&($uIyJKVaKzwf0NzUW`DP9)?&JzgN6UAAvY^qr8%|Td{I$EJkYB=Dv
zTn+wZAh+n6%6KTKDrqJH8jw@)6NtX<RplX58zAr1Dx)nHGo!#_;%ixUU^cn6yr&)O
zD0(XIg|``Y2GA9?8?IjD<Xo)z`ha65a8pbYt#|IiE)dD8F6f9;a1tI`!5G7wn~xq+
zG}K{cBPb$Gq0t0TZ*(|JP;Gt=O~sfHl1U0~f$bi(e+5P}9w$v{DM2IMJe!Wu(Sllt
z^N7x-N}D1!6=JN5`oS^gAS8K;+JtsLxk&mE<u_+ddkhQ8byJ}D0K&)?aXQW=WRwWq
zihJ46A|Oi=7%JxGB`pP(jB?imq2&ueN1*w-OF()dipW2P88Co$IA{~pjgTKIoKuzC
zajb2m$za;3K{D2rnT(9OU~0wWr<ic870o8l_i#Gsz#9O%UYh?4ji#_MZ)9RAq=he?
zD^B)8>pVmDg}kL^EWd;rV}3P+ky2eh=;_P|)NZ0@nx&h2>bkO~IgB@WO!Q-r4!?Yi
zYp;DL(zO+}FBy*&sYka0B^A=iK?Gyb$V6HSb0#6INi*9?iV}I$_G%feNiC`_8y%!S
zIUBZfOpA(aUSMt9WS)V2qG8_G?clzMYr56Q6K}PJxtBWk?<-b$cKgLZ^_XO3Iw74m
zV1M*W!ULv~sT5Y)j%PndcV4=k&svwth~`$XV+-e&N!UUFM8{58(M{z8s)A07<jA~G
zbS&`x(oZ0%^&JO+2+<*A<YesAzvV;;IVWkeUA2adh;`w2c+eEITE^+!OEbt4Yr$k(
z{$%RSEneRO2E6vrbYVpxTG_j8kyPom=z)TjA62gxOrqh8Ml6QJ=4H_ufD%3p3F2fN
z!8l9}0S<@jpk%{J-bjL|$=C%orShtZR2KwD*SEaX1=tJiIk&z{w!ytS^0vA4eQD~<
zF%|`MmSIVi@YR>1e!9^1573f)0aJiKy(IuUN6u>nAOQ0vHUD!c6qFvJ9H4o=8l2~_
z5%?nAiZQ(1?`-1%!}i2(UU54i)dt(9lSh>{B4x%++Cuj#vQ_(9_5+>|s_W%az*L@9
zf#dq}W!BmP+TunBjTaPt{t6}ubB&jen={x_MEkp`0HYN*PHaF0NF)9V$E9%Xl+d8_
zssFUIMOSjb6lhFXrCvsXelz9=&_yKq&?RReamu+AkrR`~R^;9}DB%0iYV>5&A~~8{
zJXtPIJg{WUDr;=hY0V|=$|`M^cBUocC|J(OVRJep0S(D?B={34SI{JrIe`j)tWxH)
z;GwQV)Nl7FusEGE@^?XJluPExgj`3%%yfvMcmVR8!1a|eT)vS0)zzZTq$#dPR4B@;
zgtRDC+UgVWSxQ@@v$fGknR4~3XmsaN)|TpOLsq^UiyA*v$0{$El$0n>ib5oA{7Xua
z{`gcnvvrT9?$8y-znod0CqvHSjEmwLhD5=<IX2fO<GV4Z-)lJ(l@LTTF_%RZs@Qcr
zQzuwKfUz`dS`==U-tx8^@Z6b(Xqe0Q!rj%OiOcwkqbgy1gveVQM&Z`Q^-0V7F)R$l
z^ab+?L@Tlrl$~^xPL6;qJdel!!Kb}SqWgt}Y6UY`b9sD{hzt|SU{s}E3g`lP9}e>e
zw+Ct?a8N=QxYyJC8osbQd=ctDO_C;~nqQP=RP2reSINK{pDRIQ0=5LL%#v3X_PRnE
zXD@a@TyT9koWQs?0JfzLUyuOwL~p;3v`s6^16H6#)HMTV{pX^qubhhQ+QC|8BFXt~
z-p@?-SA~5m$cD0*FBoG`iUYd^<L&e%$&;>%R)c8Va+v^^jN&Az8&4*f%sC1{9o>{-
zJ%~{&$nZ<*NgD6yA{nE%TR(lDFk&ZXdg#3d577-iMbi&xZJ4W?9GHXk#mSIE1*u3f
zrRKr@E)_2G83*>Ww(6rF3h}d&G6n*JcH^N*3^qr$j6x{obO=OKI2l9+1lG7RlLl3G
z6KMp4??_83_Krg=C^cJQsVt*s(@)?w@O|=iEz_&azPUv&OS>;sI!OPzCGRzNRNAZ)
zzPDr>=gQ3c={`CBe*3#D_!n65OE?y@9BSNcDuSTp>ml9A3fZYJ=L!eJ^$Of)bqu0n
z^w~jzf`&Pw4&c0H5u)#S@X>lCOJrWq19%~`3pp&zpJtMvZaj8ruQ~JZsP%D(1C)?f
zF*SuG$-lEFuYZr4%U>s4o|&v|C&PG3(?nfE5?e_pGv~ybBFSu&r3oBU)Lt@KQ=xm&
zqEKu@D7eo#Z25$ZjK~Zm8*1?{4U(FJ4S>6mgt7S3wh;)Vc~pSp$}}fPVttrDzMCtZ
zA9<-^v?PMsEV=$|P-N>rS)^PCQRfxHFv?s7uj?jZQ3Hf|Mvezj2p`m?p185IYydY4
z$3=M|VGVJn_Fc{v7gjT7QL2!Q(kv*b!Y){z8Vs&xy(W>3-Jhdg38dXrUCqq0i=F5I
z?<Em7l*-IX1Xz+kl%Q!hiv~cj0)nv;&MIpi(uu2Nomwrv;K$YAXQX`7Agjx=yGa;y
zQAQnvU0{VTJ`r{qHiFPgt-8?rg@6NFc07_D*pRnh7dEgHEBZ<`aA;x{Yi;}q;bq}t
zq|DZ^fVtYLM(A{IXr@v>r`;^!C>`2Jcn}ZcGgj=O9t(|j(R_3?<uEN6MT;Y9$O2Nx
z3nz51xu$ArG<m~{(VlaFb){>`8!EQ@$jU8SFAd{usYJgjVdvbX!K?FkGK>-GuqvnN
z4UdqgoThNF9ADdcDpD@pIz{LtPat_2&}CgG_4nt?2uu(lwJitQ2J#OLD6VWjs09t7
zv7hSmbJFc`Dss)MX+%(+8{22r3q<NCXS`O%OCc)VQn;w)^E8&2p6A8((eu6b%l(6$
z7u(0jMu*M%4t+7$hB<kZ09qRNRmOEOA{At3=}Qrvw>fOvf+8Xp^uuaR>Ss6!Ut__`
z?z4&&*ESv&Ngqz-tL_YQ4<Ht(49mN<X%;QI?{AJHi@tU`(`)84b%NM)#k1JYzgdFo
zgK_MG-e0gsdq1CGWW*m15C4AL-apts+24Kv_~Zyj{58|WX$<ix0`NPbb9#OGx4WZ7
z>2^tfW>do=mtH_iWYkrTl$$0>C`@~dqOXL;)8qk4@ux$<9($H&t7YWi5IR+|A$Op2
z`3aWz2)dT+rG9|H;XCW(OrvttO4<t8<x7Yff@ep`dy08y3bDeCSD=qOeJrEwA-=L2
zf>ct0^uPYdKTCCCF>*bXN+2<QHeX36>qy{2P*g@iROA0oSI6>zY5{dDkIs_K%MeP7
z7F4$$M_V9@N+#pg3z~A4sClpDDZ%uYFJ!D#@CGD`f$Q!Isu_c4+dZXas*<mDNJZGV
zs|oPvG#%#?6Tu=T0huj9v|O1*m`HKVS=?yaL7P)6s|QIcb1$xTf$le(V@E|P!L&0B
ze4VRm!||sXSNH3qiyM{bV*c~_(Zy4I7B(nVO2Pp@;)$%25x+90=dDPEMYQ(rQVt`A
z0nqCyU5AN`(uhe2NaX>OW_KUJHMV`Ey1F!%d}Bt10E+q~3`K_Em3H7^^fYU}b2BZ(
z<7*bbe4Y9+6q|pQu=pRnM&2T60hqboitj%A5SE(*NwI)IJwGb9=$4vQsm3hyGCMR_
zDVMP52yv@(R`!y7GS05P3W?7K%+q0rsGn;zzXKg#wG2K59~$ZJd$<3IY4zpLB>`IV
zUF&}!S3o<y0RYiY$jJ=vS)R^in*R>GLItRPHk(j#yGm!FBwKT_6Xi|*3AlsnFbDIn
z17&6_L@0d$lqL_d)6-l<Qfgy*km1?ne3qbsaWRjjCJ4S>^WyTkSzWmwb?~{HS+krS
zDC^U3VZ)oey&h@-{v^R|KLgo(WzNB}`3aqM<tJ`2_$B<kfKl151+Y*h-KPLrZDc7c
z|FwxagFFKFN)WR!0YquJeL+CrbbLi(VfFzDh%K+}@2VQNFhYpHbYz^#p9uk~(R?-v
z3{LTn-`_u<LHHkw)6~|?gVi)_d?|+4!)vx5$A1QL!?+|t+;%fP#k7YQz2>;RvwhHh
z^%@n7FSh^ZA0ZrIgb9Bb7EmsmwxPdanrhrwbce%oz1%+jdtJvCmNMLd?*pnHhiZDb
z#}cW0Cic0R414Km5Zzi!{TD6v*@&xJjuvw3bEEV8PKfV!5#P;^&AuWstE93l*#F~i
zVwchi9n1N|<vww2QClTg_}Ssn&fac0a$wQ-^)Yd2NaO!dOe`vZa$H<6=TZpyTDVx2
z`!8(#^{}yMfBy9N_zNqY{uCH_HbRyI@aIIy{^|TuNcq3_UT(j5akv9`=oKL6!|fM)
z$2)r=EWr`Qz8qale`4o-yVJO)UDJ(0Jj%7HqmAd-#(cZm1yqq+skU@9W65ofnKsU2
z%z%`P(;OyECg&7`n4+jk%5ar0v=vc!?Yr?^z|rG)kdRUNS;jg8Z0#-vrn{^1dzti(
zqc|N)+6x{@9@QunZ+3}#23RXVUocOxd{+%nuXQunyB)7*Y*2U3(eJ3;^YrXI)Nq}q
zkmk_<vwB2#c`$c%THuDtEXhlp+wEc?t<j{A$GScvP_viv_G_Igfv93$NCY$OxgLNy
zw{XWU+_|3rWI>&^xhcZ}mWjLjI?Aoz_d4Tn;B#f{YO5HUbA%xYWF>Z^#bx7m?6yu3
zDkLVOOd~`nm0VhicH%9nHw;AZ-W!Ne`#Y=<82i=_x>nJJ!L3=M3{qmdu%XoN<O3p&
z0A@ICC;dTNVx-b{SZwp717)r2nDfEg5zuI>BuuGmKCQDG>#3`wY*K&Iu~mn;Y&Sk*
zJHEhvXrl;c#qxF^PR(>w^!Jdpa8h=YcOkz~OKg606e&~K5;_5TPs}gelxvPk4wJ-K
z7H>x!+8w78>sLpk3NvgwHi8+y{nTnrJ?4I#cbysNpyQ$gH1S{ag2AZFuYWLU&4~)H
zsf+UNj)qG$b*kl}e-x$dIKdZotn2O=O~grN$GCW-!v9L}fPJ?y0AG$%@{IXqnvS)D
zh<%m}D0-B#MlFnM>i)S2w(J}T3ue_JvYXbIial!fNht?d%^Xq;YG)PK=WN6|EbEm9
z0--ALdNGz_8G-kEa86%^#tU#=9?3dW<ESsJ05CPYL0I%fwN8>lU6h!-wPTyll1Y%&
zo5K@TNEz&uY1&{GXin;uvK^~_q=#@@dg;Wh@l%*fXQp#Am;N@#c6NCl^Jnsx<s0EG
z%?uHn7qsMyoeswZZ6>espU!sBDprfnY!9N}%^@ZL9{#l+`!uG0)A@Wan39#6*K{oo
z2=A<C)=10j^g8ttO2kb2vn|^ks-n2<RyI1iu_L;%bCq@uV~>e{D()|fX8H-HBZZZx
zm;*VEks86^qdkg+g5^##j2Vt1oNm@jqA7+$B^^AB79jpS>5tHobUN&E#DZ~*rk0Bm
zA5G(sUmLyTqqY{Ulc^?l01f9Vo6$HuJD+eyE#*J*M=^P^<|blA)ZFXnXPr;wE@ELR
z6n}9?^`qhg8%F1vEqDBuJ8sJzi&qJ73rId_+#{p#vU$2|MDSJOYOj~f&Zi^kYHS~V
z>a6pbo#|bv?#v(<)#0Y9T0)V>A+&(O@C&CuNUg_qpajFQ%d47sA`L(B*m|TlzH=ok
zy6k$f>_*7vAr3M9v7O1rdfute$x-OD(NX)X=W15Ggg)1B79zxzJVXcEL&Vy#Sph?1
z70HXQLVvpyMk#GHn^KPHh*|`%JpuSWA=*|`vAq1l<g(_&yOpY<cnx4x_V>qVR3dXy
zBh}9v(Nf{rQi#eCU;S5yhc7C-RHU@)lL>?rP0X_i(0lk_e|`S9e*kHuIR;q+c4`?2
z?tJ-Q35TUv&d1&5PCCIf+TG9UV+B5sA3wyutKU3YvH#Mm)o&jD*XqO7wa1SheY5re
z%B`)eJb3h9(aIN^W90|PuXr3q|26GQhm&bVxf$>OLq9ixD*(pGu)<IGPk<Y4@3etQ
z9(MavpeUC#NKlxdVcge1f($@B0N81rFU?m$J!wnf9BWoqWp0p)E#Ld1pJgoxkXgSz
z-fN#6?d^$=8bd#f^fY5kZ9l;42ES+yeh6<F!D^m8-O!=%ffJpMfcuzYj4`d2qdL)+
zV}QfYo&ewUKd)=6KzBTeUOZR(@^brU_;y^kUB-8S)Sn{zhj~bBePeJYVb^AC+qP}n
zw(U%8OpGVCZQIGjwylY6V>a)*Ti@1J?XNzkufD6h|8!N~=YpGx?m1Ijm^3EVak^jK
zJv4;GA;K-;0Rw{EA@;fPB5ZWLZ$`|n<RY>-QBHOow<7hK;l3LKFym->NNKy}r?0Z4
z-pFH#Q0yVz2{Y(zVgIRCYP;Pu{jbaEi7t$~7%e&{8&%tmy+}C%%RkSbr?*d4rUvAC
z>{BFavITSJVLfB@<+nsVzYQDl?>0(>hBH#^de=UjZonyF-5^siAdY$*YCFk8s(Ws(
z9|kVHw7`?ozg;9za3ZF9JFh6cL-@G#Nb!=Fa3-D|Q1q(8!Q`^w)LQf7_jkBOMZ?B%
zAb%s^Q)KzOjGo8#<G0_@EZb)e%E%vZqQ~+0MsQO&ZQSs_(Fy<+_3jf``CaDz$CGpB
zj(V?}b}x|;1!hm?8KF;h@ol`>4YH8+%s(M1V6bViy{fRArKS{8SRqNt4LXmkhr9wn
zT|F}A#*yPFNyVg9@IW^}C~Z+(+OweKGGfgPxAc`S85?2(J-B6{?%qxVB__vki<an1
zfCR!$nt%k&W5ZPA=^2`e4~b1oGu0hRLDw8b*BFq<1Pl1b4Y9>M0meH1-au(5$Sd2`
z9U(&@EFaGl;vVI5=-4UEHb(Z&aBb+FY4TTuf%usAiz}~vZQQUMv8=3a5+mLROwOJ#
z>lrxrrW|`Yo79<-2E*iHqEiZJ0><w2RckIonyp{d`+xuy5xb8{V^>^PHw!0OuoDXv
zxzMMXu2{Rf6L30uqlmN*M@AmhQaRk@qi(z*qgn5K7gU95@aOS+3j8qIs9cOF5WE!A
zBNCElJWpKE7x}NyRplJ;a@y%l=v2wVs>GTA$roG5D<J@SDHbwTK$xB;aH4Nz+cNXO
z_d^#pFf7>wOZ;wepA~rd-SBUy;HV|UKSaxaek|XepMv!taZ#WDCJaCS-P}>%{-gZh
z{k_Zkp7Zuk&>Q{x-$#biH}m;|W$rij$?vDTBFH#`juXNi0ng9Xw}1Qsp%4Ggp%~5t
zOCIYg)n2~ds!2|q1e&68%sHBfD$W1YN-b<BV16hX5`H%SuJ0;$hx2dUe|nC3-tUk4
zojxycRt8j=c2>X2v%A0{XdWZ5yN;}xoR<jIBBqSz_QP-92v-Gu1*)VRyjEYblL(c!
z%aKefj=S%}J0Q@fQ1*|do^D__IwQpz({A&@JPPH)Lqn&b4QbC)s0~QXRVaK#1J&23
z@F;M|5RD@PgZG!ZCh&u^cSA3zMA&IHR1Ll=b9(s#BQ<Fu!TQ#3&XR&Cvcrp8{8k5x
zfN#K2AD}}!1a)@d8FHg)Hmb>M@oZcQU9iAsmT|AS{e%3IWuuWV`##)x^zsn84-OhO
zoRlsmSlpzi)i>lD(IHPI_|h?Cv08xA(}pJ{2ZL-|D$DY_&-?=~xh`ikSeXzPlq9e3
z-1Fn83e)FmyT@{~&M;f3M2Q}xFsj{Qc~g*Uo%bCXNN4pCVg!3@l42NoYjVeA>=y8J
zssMRR&!ea906dvfO1Kkmfur$3PQlghdD};5aZpvhIBS9t0N-SswDRMm_JI;f?|NHa
zqPa;aNHj{Ytyv$asJUxTwOj9J3cwilI<zP7(d+M9_c|wu!PJhfgK6H)KDtR9uPfYD
z^p1&RcMAEt&Zrg2iB@zIQk=IY&Qx+Y)qpNsW|BQTz;c{<Q9nFLU!lT%FNF9o6|`4v
zvWMsG{O9SY5$H4p^hkw|;}ORDQ>mw6W_)6#P$1xXf031kI2sa3s)ka-xdG1zr;K|H
z2tLn^lJNTYk`^igXSawNk$kj}OgE}{LVC|D6IAP<xnLhS>USA;IBv);)KhSDNX=b5
zJHOQyxfiRk<1Ga~S&cX{UEIhSkehOFv<kTrn@KWWQ7>U^JT8TwDoyZ7!va<k@?%Ey
z!JlW~WFk*3`RR7tBrfc$-FIq9zS3e7W&f1Hr~Fhgk|fErlW`>73y|V`!b9f<X-KS|
z?XK`aQqdYc2S>hf2<tZf(A5Bq4K0#gp{WLWMv_Ep5KVck51kK=em1dYC&-KxBq{2x
z`jUt0-Ghb~O6tGnm8R~`I-8y4c3@7H9mKzFag~E2W6Ty!c79*NYn%g|%K`Q%Z-I${
zMK~sQF*VLH73n%=+6^aP)u3e{6+C)vI5}Ym+Q7?M)AZkd6c*tdWo#+Y3e4iGLl)yM
z7z}OKW;__vLm$TO&_Jugevp+sJm)%)<(aXg(BL(fBc#>yE)WQ2R0K0KX7D~ceO+%r
zLV7z2EaTp?S|MuWV4yp$>TZzgIr-yMQ>xCp1vtUXc=Xdla==L?@qZ)lH$>p?S&Kj)
zZ22;Vwq5$vdc^*a5lXak66R>H!51Ygng#kFnqx)pPB@lCNSMH;ryw9Z`D8v%=+sZP
zUxmbzLw?Kq?<a;L<gldNENX*8G{MMK1Z<Fo)XzLVvK7dU*!}oIdqV;D7xu0q>oyVN
zOOhoYK*bUCg{qC9MTk8;gR3M$`BaICt>o9J8_SGz2P6F9!VfOqyuL`Q+fXzV6eVV)
zl}OK2E}rg!*G$@rsemtWh1Rn8c(RVez*3!rZ-S-=qd{H%QI>(RnFWg?#YsfysB{3K
zjPolOlht?QU%uNS9k)l$h8z^QrmY{^Bp<?HIf{+Y>6-fHa{!AXGNX(_xi|yw^o2!W
zN;l922eMKMG)AzcgR9Ql^Xtm0!V$Vrx5T3hY}kxcGA`5F>IM^aGmlb%IWar8@rmB@
zSeFU8!8F1kB+#VA-M!l{3U^qd#)!7>(`h=g`f5ZNfqR-vtn?zliAze?t)Gz|3z<!Y
z&-2hkS!g2t71uwoQ?DMm<TKaR4qYnL+Bf7vadMF*wNouLO*vg7&j*4q6}n2ZHlIwc
zD}tEn_A==~4#ikrIj3`w>l^h5v|~F+gv529kJW5er8<vRLf>+x)ge_U&!q}&RaLM~
z*$(6-9X02er0(U&R>AL58>KZLsrvCOLtm0w?xLiD&r}zqtx8G!MOVsVDhI|@4UN<z
z;OW=hwi$uNbUWY?%cBf5gDRl(h;Nnt^2`g??~TkiE3)T>0XEBu$=C9N%XBMhFga5U
zzH48V9ou~wVqnsC|7WCzZy)CAl-Jrlhmb2DF3kjUWb#X&Y&)!3!O$)1<y2r&L0vAK
zN$8?xh(@>arBpCC=I!NtYPYIsz~C+kLO;D*vDyCGAM6>BU<sT?m3&T&`lPkR>-ENg
z*R2wx3V1bBuF<4lF>)X>Fh=raLG_!8<e8WcTkqDnB!b5@wlXvB>6mfX8FDX@^6!dM
zvv!c3Ze8vTQ_75H*TNAqJK-`tskQ+Tu4XGG#mav5gkZ4JJFZ=8`w{0R<A>|#paOIy
z>YUi*7)TR@|GH(9`dGjA>~BlECIES56`G}EmAQ_|M>AEb02VeBL{vaiMX3^_tzVfp
z20>(ZaulLxbCzc3Vo1OllA(AAL?~k-r`4?EYvRS$9a$6@15gd-Fxu{bP?@C}oR7me
zufEVQHJxab+Ym5aRn>JD@>>nUI2iFYnO*|9>N9Uy+ckk!R+5%iO}J5IOrx&bL_bwd
zbU_i|-RHIjK$hSI@ne#Zr5WX9u*aMA6>8q?SFhgQiYw3xBC-E9G<Ih;h1bY+!8OaO
zHr8vO7)pDf6hpp&1Pm`e>#3ruR7-JZ6$woe<xV+<)C1R2SD2ZH9btzCtL}$y?~^&W
zm6>9B{G^!fJDtGrE8RFahX={&7jV`6QIE+ze}-{@k@wf5gABX>EGyvV{%{7QCwP=t
z+DA!<&k!V6|10ZnC93=j;*;uKP_mQg27RN{q}?bg-;*7c=k0HSM|kn*d%n*MSw`BB
zOqZZ%S@@S^3lszprWSU`n{<qk49pbxoAZ@3$$>WXP<Ba_CHav<UCu~6&3h2*E9{Q(
z1N@wp`X@Fj1-FrI{1$U0<h?8<qxzC<Gs<@q1$1SQ^@j3J{GNBl7h&#JLcdc-470e}
zlK2R6Ugz0UCUs7atPqaPVUwEEY}Kl)cE-_ozgp{tPHA?LePUX?W}Op--w{)In@nwg
zs?JfvVBeIAEwb#3Gpnv-;hKBV_4O7lnCbXvDCHSi8FDHHw0fo>lD@m0$bO(vE<9}o
zs@N_#G*D6T=Ob4eQ28)q5$;-P?$Y_>$*d$zXxsSQqX~;mzjSfVMRoL{jB>JG-;?x&
zVnDQV(6mxV+W=-mN4c8f9zY>0&^O@r78Se0B2Xo!BC_0ONO;wZh_ET?vpE_L`AnR{
zUa5#5za7SNEW)uOa&xYPtdWT;Etyix5!7X3w(OZpne?T}jvc+BLWd3IEK=3rQNJmH
z8<2FB)BAw&kb#2aW$NGG+AC^E!sj)kT1W>4bXm4WE{HWmczoJslXT209{7}8@{NAO
z3cDhxQDfWBQ;Y!uCX^#mJR9&E;=98l|5DQ^em1t%@OpXS9pv{83~aoK7U)lcZExiZ
z2x}3%esE>;W;t4V@gPUeYU_~0aB2v6+Q4~w);Xd42`rRtDK&#lON;T76=+ti;dUno
zhZVH2+;RR+1QXS;7IM{l3Q1tKMYce>+%U(5xIu-kpvD!U?Q<ODb6ogyoaA%d=yROI
zCE@Od;I~Fwc>T{`3HDGWD?r^6t7?WzBPXz$hg91wtnobBd>MZ#lQo^)Lp-~`nmbtA
z1)}K~&SDz-zb7r3Y_E+7xPra*;En^k1ZV!IW=)6uKMlfh0c(2rPs0=Jbt)3|e`~n^
z0zb>SgS`&njuTkZC4a8!sK5B1`ab}|aRY1m=nudf>~#tE-{xA{8RB6Ld&<<3DQ>&p
z_W<q~*OF<MEBI{$dx~?$=#LY`LyS*t&i_U{n09%B-&U}v+I|o>h=&^1bcY}4=O((C
zlRs-#@TYdO`#*o)=l_4u%RV9H$GoU%w{jRB_Mv6?tLwzP3y6Bx(A#SJOVW#u`BCFJ
zc%RU~ONWT>^SUNFMj-L5)EJ(`UwmnNq>f2nSL>A)!b^wATGv_bwLCms#o%lpeo1H1
zc22y=<;6lttTE6F#|k$h0oc-^>MO7%M&536RsO8@$u;*f`TK5_Gaql)s$}0+s#i8%
z>=Sz^?W5CGWZ#K1Z$r8v!0p@73p#WZb(QzxZhyQN%M9<MnuL)xZ^Pd?jkel9Gd^q8
z|Mha<!Eu5_z|ML!Q{Mt2TBRMsyMsSzb{?bBUFomr-lo_J%Fp}Gsp}M8>Le`{d2^Wv
zkPt43k&kNdFh&i3;EKCP#!)U>!sDL0WJ}Cu70IF2w4-ICxCG}tv?yz})+8lyTKJN3
zX&{ctW^G`N6*$3;C}ErWtq4I9V76W(CQB|k#-6{DgvgGvdq(t&q_Cv@7X{7A_}#T|
zmSIiAslkSdi7yKLoKU675@U8keoXZlM-j^D@Uhuh9IDaB$60<-K@B#LCC{OeUntyy
zW1_d2tVro^8juJ|;%dgt%3<0Ey(>gS#h=YkXAHwuc`G`GKty$n({1W3bBg+P`Xk3(
zeEsEiDq9`Om9$3rqx<TF&>1(kkCgJzjud!5o;5B;GG*E+w=l<=9Lldn2{oYlAd_DR
z*4f;`C(t@RR0o<%6h}$TyQ|FTwPQd4d&NQqlD_h!>_Y5XW`iRj)O5rU@ld>!`d9`G
zQ)tRFJ45VpC0>U1cAG|sOof+5GDP9{ZMv32A!Eu6J&JK9IhFz|$_ssB9;lX(<3CuQ
z4>F-MV_QyC`L5;zGP-~dwHI{+V&GD4=Ty2WZR!-pD6%Y^Eozf6*judOS$>kNh;QvE
zY<%+IOOeYG#nE*ll<|t8+rE|gY*)EqPa2u_jfiV1q#wJ{_=qv=9-oBJgxbC}LktDp
zS?-A%;VI%<w^du>BhSES$uH+;BlHzDtoa3@HJTl>bkf?sDiKiz5OpY##)g$@oB+;q
zbst)(<$LJGDudxT|LjXej!D|`GBPq234eUe)3FJ4&tG<e=$owh!=3x%)`RNF9Cg*j
zs9{XaG?szt)cMNz_D<i}+vR+T>g-YBpWZI4ZDZ_oRI+j;N`l6%Z6P81D83mDBI56d
zBRI#DIs8viv{M0f+UI|0_{+<rpsd+?NI1K{;5Ak<PXGvX_{|F1T78A6<eCOqYDB8Z
zGMkfUI2Kb%-S_Vod#w+rYCT6i$Kol2!(05CWl475=oJZCMx)Y}VSP(*2j88iH*d{j
zDC?ucEOqt5<5Vm$96YYsvvd#e181;@E+zGz)NgkJ(sM(+2TaSbcp9-*_??uDi~CA^
z>gmyaQp+pb!v++cCYebuFpc;a+}pU8Man_$B7!BST`UEOLd=TAf5{cVzceMZbIVSf
z13luSWnwH7Yh0Wvz}h~Tvw(+1v+jU}raP^xMT6(jY28-N9Up8w$nI){o5CWdanw2>
z=bn?h=M~DZ?C9j`7Bbtig>z2X94u7A+VL!u1#xrxvl9`mW1WEOh6W;28Sx|3lc%&k
z_wT9Dd1?IiA=bg%UU<?Nbz|w)UdKSFH{(ZX3*FkK=3I^VunhU2_RGz{v9#ODBd??g
zDl6cUiqlX-NWp-WNWi_3UjhZp(?F<amy!MFfCL38%h$Q%jOW)nC??9bT?|yV1nRP6
z^S3&nj}rRkc+5$gc3kP0(Hh8Ac*;<nE&&pAwkFsS8G|(q2^p*uCef7ZuQZMZPZKFM
z<vQ}xC;_mVM5J}=$D<v$xltopSLT^b(V8OF+C>8<!cq#%yDJ!u;G3`=Z;q|2?O&IH
zI3u+~yak@bzK>aRF7)L2lub~lL>a?ojvvw8M}X#th8b$NY^0_f<Yd1*J+E#CK8u0e
zF~nDJz25cqGo-+^&HhjyGaKO<JlGe8h{qES3XuuVWyk0O88!m(w{m|chakNCAckUy
zdolu#S=+Fj0q}Ows}_b30xSI`_No=*ie;t_AhvbkSoYE1=_e3o^@3tZB)_s|tm9>k
zR55J452ak9J*RiBXNJ;!?mhLi6EIIVZ#@ele{W1-J{p;?g|v1s2^=ku7H6NvoRi_R
zXdgFLccQi->g^5=rZqaN+j0hX43*X_3Zu)7@YoCLYH{gwfP)K?V<tRp{0XTh@lHy9
zWl)pE|G=GLp4Ut+h<PpS4g<P*N9hg)iZTq#cS>SMtR`4Xd&`d4u`X*DAn5Lbm;s_>
zZ1gRZ76@Yj=RC4v1;VAV-3ua3LO0A{0n*b`;))jofKA~(Dp3^7MubAl*Gij~n#6*I
z6E-8ebC)6zuSipym|I5YPxtJ}w?8X1oz-ia_p6wv*VeI_o^q1joZB_&uGXs|B1;$@
zFy+Otes1EQqA^W{@z_-YV=0R<tV>y&tCF3EL(j>bi8}}HL(#_K>6#}cUT(<YW%X+3
z*cRcqxuLIn7Y<*-*7Q?HpE*+TIhjD+cXdDo%!@KnX7J!8UGmFL$;In+{tJa0zJ~y|
z!l)IZxlM#QbC#_A$IGGaCV9a8qM|}|OB%=Hoq(_ldfeEb1J+LWsRm5sDM8<a8X=EA
z9Nn{0h+Mz1)R7Iq!L2h=3T!$h3qrYqp$8RiItdnz|EoXVyo+E_SFCSt9{S4svNgIV
zW3#seLc%@z-tjzx#>Dom;f{Q8X@=hPSx9z%hF=k6g05n^KDjpRO3PzHgVE%ezip`5
z#aTIXD2=QC{dP^o?{Y4WJy_(@0t~9&9&*f;3+vhlR>dVIi`;^AY1@1c-7a(lIXPko
ztR>?hh~tF5iUihdJCSQ~l@yW1f#;M|-A4PXFpMqXE@QxZ5-fS61XoksMoMWlnF0lJ
z>-k-TKdBIS$3q!Ce4@-r<kCmRIpd5h2-wIs=7Ef$qFxAX4m8CL?@*LGY8Z83umhP)
zIoicWc2v!j1_6g>m<VodhDwz5+LuS9j-8%|$#_}`sv)KgI#k`oR+*rkZS*;M6<00>
zl%H+f*m~*>iJS@{+(ednN4mB!`7oe?8Ci_4bW$@&1qe1-wHri^Iq+`U6VL;Pe`SO%
zF^&b10s7X=r@*xv!pW0j8aqPyH*RN{X=IM;>vdP@4ThtKP?$bb@9G|}-l@27M)?vw
znn#jzjNCQW4!f0HHnJi&0$_m+bFwn&w9E_L;><xIon4NU1O-zrB}^msRVZVgU<umu
zaDb=acmW5<cI%oSTxoLyI0eTBo2wR2Ua`$kvI)dC1)69e3>SIiB?7tAA(2uON2WB+
zgB7_-<rB8Nt>MLh_p(6_RzoLemDnHgvNycMozxYXD8WG&HBvp`(J32476oFZ>B#+}
z23t{+mi@J+R&oQ`C;l1XtOHqe%MA0pNtVs3e4@eeS=!x9rJ@4406?yvMOj-L$4Y{}
z%?P@|cfAAqHd&j5SQ-%LQ=m3Lv>zpk3|F?l%Dbjo#|i>y`fb=h*jw!HlE}F#Wv!gq
z?lnzhAk%0ZwUtxnowh+hbOgCX@cAr$O);b4joY}Wy@dU(9hh>T5U}-r%B@f`!D92}
z+Z)WHJ_s210u5!jSTP|q8$7-+280%oZZw}tZZWOhpNuPsm8(1tH{)JWU^-@177)ZC
z-H{y}#|6~?Wo^e#nmi?R)WexS-~Ho9S0Yh#IzIvUEYDG-D0(_N`flDlcQUQ9^KIoL
zaHkqFLlg~CfcWZ^iIMi$zlAd;h*j3x$`$Z0f5Y$|?9V8aM7$lyEYwCJ%zDQ{e6_JP
ze{-Ov-L3w<a<Gjf@PBXw|8CWgVpnf@*<h(QKxNXgxFFq_Sb=%3KFBlQ)}2<<_KUgO
z;K!<~8hd;p?K%u=Y=?cN|9aVxrpisWos~$K+n~B}M}qh2fo&bP1W=^dMr%cFH)W0t
zE5)s&S~wM0V3w0Y>r4?b7~g&+;K&MFFI~YfC)BJ_u3&#x>Xn&^YtgodVABk+VxDw>
z+j3jQT$iI8%P_RZn^=|7m0YhS(XWbOymRRMQthp0%aI=MEXV97Y9ufZf}$C;HKU)$
zjOVVNqIJB@#=u;<4Q1cst`u=OcY%$Kr$HVWqARtms}yxq8bio04$E#$JOn09Il@NW
z?Glb)g2NCeQmOro#$vml3`X&v*aVcmF@FD7r5Zep09@mg`zqcm-ar2$s3^-?N+<z(
z>pE!`yA0biy9~=E>T4Lq`a1||XtXturLTl)52N@*Qla|=H|(UotR#&DwQ+4&Kr8|3
z8;pi|c7lElm>mx2<?Xg@$V!opY7O6Pf{4|0@X-V=TZrTx)9OJ9ckMDNBhYo``&^tC
z)^!$cRYP7h_Zcs!pam6I1+9+1#h63b)Qr+FE_b%{|4Q1JqSeIk$u<`k=gCfW5<$b#
zf@Eo~Hv0Z<ySyS1P!2(fO|E9bht@lX6oGb-ZHp60!`?K}&Re66x;N3PhDR41*|lpE
zrW(mvm$x!CUM6ehdfD^pu*_N6l1QdjVt16lnXg}9Rb@!azS0iVxH5&q#-o>9D(-gY
z7Dq=(S!T^<nOC48+OMcDu;QP)7yEtfZ;xU6uFVp4ZZ58e0<w_5a&%yFMs&UCI%nN(
zN5>_-Fp8R9rIlG;)lWV!AwQvda_W@7px7=u1_l?=!xQ8D8K~pkr-|B?ATm2=VqC0a
zF`zN!kqzPiGrZeB9iZK0G#VpZ!22K%2BC%dM4z1Dp}eR)ix6k<D-Q^?^|#}Fb?Zt5
z!IEsB>h0^)W=O=1#F9-*w`!YXpmKP=Q8WO8CdQ@M{O|X&h%u5aoqXhhO*&tsZp-yd
zly5mih?Y`u)NM~K3}=2G&kM|j$^qf`{4wi^JftqQU`uWe!AUp;jY+Dug_m!rV$*VU
z?CD>rrdsQL^C*ec$xzGvKXmTi1P=|){drmgYEm~76jgDky+>U?3Ivbn7Q;xnjWO6;
zWdVG+#N1Z-?z$-ox1{rB32lD-1q!8vo%N*{hhiM7g*E1#-6bBWI%|E4qC$A~`U#0g
zs5)a-bl;lkD3MlSLdzV+tzGUo&3+)ymHm686FK0qmS+Jq+uR(+%~uhh=T^-dk9M0g
zqip-{(+`)94Rc#bx>{Y>qaPoFz2o++)}FL6i>h6~bS@&PKSFHN91@KiGmIY3CC&$L
zr*GnpL~<_txI*}^XGV808DhN*n+$9eg`B~GYf~w-{ySm1O$2}*eAa4M%C8d(Mhvmj
z`uw1~Oj=}}jdW;?&V9uInA3|i>YL>$U{WaYERxc6{mvPC%|W!}(2J)Fz1#;NLymdi
z{q+D0DEsX3GzgwFEesF<#Z98nKmcQZiKEZi`ef4CLAdON@~Q3Ph<9i4`I+TSe2(TJ
z>_rl;xt7|dPO8zQiFnNOL?zDFu{M^R*!-u{P7*qoR!Ui*y<aaws-ELHtmOw`ESF_`
zNGd~nqcG&T_z01%f2w?AIiW|QzwTm1Q$i)jRFiG(>@hMFMkJXqXebi&!K)ue;obd1
z_rgt6G~z9X_M^_9lza`=rUy`Jli5b9KgFN8ml%NZ2pWf%H9MqbgBU2&F+f~}N?0N|
zkCRvJvrgHuO!$a?x=F_J&9QQBzOV^f5Oi2}@c7&y9pLnP_7!OyzT)9(=k6@e`5}qM
ztF_5<N8I~3QMiP&f{a#3HsCqlUiUNVaY`89V6X+n3Q9!bNFIm4=}cWmrTdbh#JuTR
zDGk3lnnMb9KizJv5~@vA5w#$z?Q1vKwezm0h{xgyI$DPAZbHHk@XBB2F!CbaHJMn1
zhXgjIqJh@B#j`k?<hd3#$`816;10O8mZ0|!q0vLFzzU`^JJd$gZ<J|D1H-SH%MMMG
zvJ2<KEd9l&#;`-t5#wAo@ThO+Cw$-Vi-SN>^71GM^axDFbbuLNLz*(31F4o)KP<a0
z%ql+UjDD>^3T)mx6UID(smTI6>24vf^g!<xd=5BPzn+>5!Hz+r;}0{cGWN`Hbg2!Q
zMm`^VYUqmyV-tKE8*x1KVoijni~M>r0g2tJRyAZK(t{2@l_k!E2m!iDsn2SVPTX!Z
zIAOc#eh{0<b}XB~pmu$wMTb`_gUxasi>Av^$1uLJPkUUVb)`g|JeaJ%elva6W=w-)
zg&zR*jWYdBpS81PbzhPmvp$_3flAdM@?3UKuLJg#@sYrYQgq`hD0^SE`NKTh-1GIQ
z+g$q1%V8+Mye;-|lDip8B-vPKOIn-LNbU)=^}V%0;POt40i66+6|AEnLY+)Sm_*CG
zFlxkzodB6Su@Kkn)`kwo&d`d%GTX|LT>2Q0S{JHy*?PNm(637h8GyO$#=vwabu=;5
zf*U9!fuKQCU4u5pbJZcz;jDZm(QYxU1v8+zsX4a0gUygs;>Z<T1&=RdIPt)Z!6~ke
zGIc~?o8C+`CqTn;z%m=3?>dNS=L^sqj9~qB(&o~tlpi(0oa~ScTBs`k<Xq6%>Po7&
z2^2|^Ivt^AK<yIw8}h*buu@b~@+JehV`9z;6?RWTl@{-5Gvs0gcT1^V+P>u|)FdTj
zdK5)mjkcX6sy25%iwI;jH1|hKcZC-=%f{$nr^RTXZ;+0+U4o1>T;COF(4X!$pAehr
zHh0~bUX$OzrbVq8Iq8w@Aq!v)wx<j5vhj(s$y~LXLM=rzDqRW)-{l49!%oS>c!J23
z#JhKm*?t(EbqJ^3`leFoNy3Q124}EbCUT+|tk+fC4{S9y$LNHFx58_k{;Dm!)+fRZ
z8#ymq6c}!>=pYCUeEwUP-lq<Hon6!T`$In8GB(p-4}(%)#Elbo8GKudrGz{x(6lnj
zd%82sNcip`J596su_x4zzL8;z0`-^OCu%`x9E=%e$;%CHQGG^^M4JOi?Z@r;p_H<#
zMkygWEw7(t<XTMwIHctXawekjZ{$xs2>O^k+z%6aNPy5bl6!84ZY$d^_c8q>glAEA
zvZACH3?Jjx7G7dIjTj+LAf;A@!_3TnIY!N{oFX-p-ACD1Fr=+HhFn#QRgFP?1bOhx
z4=K@By;R2PgGXp_KA<GAQQYsr=Hn0&&MmHgx6ZuGEZQn`cHy{29YdDuN=p1*(C((2
zYwN?yp$y?F$%|NF%I2-!ui3}*_AlYQLjrXdaldm_6;-QiK0UEDt|D;l$7?+@zb)ZS
z4&P?z{KjnV0qf(nXRGZ~yHR!0vH-#wRoj%+8(l{9LM{h5=5L^NyXBDwv&KP{5zPZQ
zQs}FsM2X|F0T*Xkx6K|RIUpplsb&mzM`icj%Kp~8{&jEf?kEAC?lpo(dSju`YZfBR
zci7of&({@-hvX*&PEF3jBXbpG+u7#gvQjxIyd<x(PEJ-ovsYRPr>-`*=2f51sJJwo
zHJGm=_*%$`5#4ndO-{>9W@pm%U?e;0qEliPEFRzB_1t_Xf-Nw{Hp8Bc&0#qP$xX=*
zpV12|cevug!qndwmy##lNf=gC6SQ)XmeUb-q_PCA{grMAtXjow1|v79k*3uH%9ZCb
z7h(8I=RA$$dLvD(NbOc)7mT9gB2?5=k=5qHU^&RNo*PAjb(bT@_1g3lZ>gQYQCi4a
zG|+TUj1}{A*kdP#jKBeAQP;q@&X`FKjSn|YB<II0d80hu(uow{(DjoKw5>&{Yt6B3
zOdV^-6gaS5WdO{wq}uKA4RZhClIVsRLrYgfj#(Ag52z1Qnj;m?mD=%Mxy7jVIG4@q
zFWXE-E<OF31n++-ds=Ilo+gDO@FuYxuvS3y;}8Dc?y))~u_NJI;F=-#r*_%6^ynS<
z1_RuI$YgjL2&UYiDd=%^Oe-5`+~)TR(Jsp{=wSsTeFIW|iLvw;d!&3+b#^`1irkBN
zV>3AMBN*ErSCWoXenkeMzUg(A*r0i+2SzIYWVz)Y#aYTifCL4?FM?DwQ<+v*>Yk?J
z-KSH)q6rtG$+U|$@Z_JhC>~sg1Yt%{5`H|96H2sD!~}@<Zji1z%BDgRazkjws7iRv
zo;A%eHEBGwOeS?v!uw1!XuRX~1T+Qw**LfqrMWHuk-nJ!r@9ry;X44m1+n-3JFIKZ
z6Y%P2%i8&MQxU{Kj%+3!i?O$4N2N`Er_1oSP3i%ky{I`AqC0T~I@ab`vOr!}le$UM
zr2%u_sxp@PeWVc-qk!5DM=D-A`&pK+UV!H?*^>6wycz~{1Sz-sP1T+_n?-JUI$N~G
zZD=bjjCBfj%Qi<$MPom}K9}l6Zb^Hvp!2g7rc}j`8=@w&)|8kz4?4NgzY-8O>#@XV
z)3%T{Od%tuJ+bqqJriZZXDIGbLlvri2mTcLVZ)<5z}c=IgD=q*cZ}>PUUCqTEyOGW
zrW}X$9;S>Fwyu;$#>1|?qDD~%qG(~-pweO)G|bDxkALVe2&1jt>`WW>%T}yYmv&-6
z0NaU7IjjLWWsdvUlh_p(vB_9ft=I}SQSuF`J^I0p1U4`TDwnxWUqRhk^6se*X2DqG
z^nQWo?pri}sE;9b*qZ})WTv{Xv~*CWrLrjpAh?{?wG>q8+WpW;=0mVEHhe2{5IQtj
zH|X3Cl63^1-L$YwUuU%KKb5bI5!g;<3C^9mDrdzH!oU1P3?Fhwn?k;)en!;pwOxyS
zpkyt-@o#+o;BvD5aM|v%vziqsft;ElvBauARTq||d9;<0dTvN|JJlGC-8@+x;(cHx
z{={rK;cQux=Iw-ptS%RndraScd*<?%{_cIN0N9zVPt&w`@i>pkvf_lx$l%S3Z0rHQ
zgJs@Hdi9U=4j=6ROBrQRbDOvcrK^$#a-)c@WFn0w6^o?9FWim&t~n{>a=o}sk&lbk
zBF}PtQO%T-KBkKNUZ9DJiR4lgav{z7r@?V90{1!~UW2~kA*GgIC=~7Gw3RHsS{}4h
zAph2<qL0DaLTPvochsuE;vFK;=92_j8B*g)G?m<lOo_L<?=ACXOOI#4<CdclTaY+v
zY{6j6z!3YDzD2l_=Fh+OcYXNkVPUfeyS0p)bAT#x(2S^J)%lET4YG?z2ev->3v`Y`
zW`PT_p(4VuGnNh4i0_qPna_AFnuSR{PNWr;NKJ@Oj&as=(CZrQHQo$U0TtxShB+h=
z$QSnc=-BP^p?HORSzt5lEA?QK47|JLt_l1;Wu_a1Hx$@Ig2s$_2{L!_n;jd~NRAbe
zv0YEp)Ehs`z8?weuQI~s1hWDAsE@&u%PFM!uq`aeIO%kiu0hZ7TBGA#h>JqM_{I34
z7lY$*QMv8JVd>u0+ETIYXw^4EFtgr#MOxe3P9x5D=AL`iyT-fb-%*y#2g|OjZLk{p
zn{Ves@aij=u+8xDhJmhoN01Bnv0hd8&GFptoP2;Rbk&AHd(dnqG&G9g{xD5ums^jV
zF66>AE{aC{9=Oou3|i>k`rWunoXzqAdTHH8pRXgo*Gi%N5Nrss{43bDSl`~^q-L`x
zHI<|7m&de+jX}y1hAJPCxJT5=DgqR^sO_H390}KXQwFM!^IZzXlb1_E)Rb4WKN@kv
z0d>MCPjj}*dOHPvKX-Q(Q(aP-_hZ><5{`HOqIc6hLjT3}W=a>%@vk|b{8EZvD15m_
zr$HSA$o}{ySQyHx9K);@&+pe~+hIOZ$7p!!9_HH#9K+?9$kaHg-B>H(NGM(#;d(Z2
zS7Jj*Bi_AW&{UHo@{rOh$E)RtB<v0RlIM@H)*T(}LOQnNe9Ffbf>(KXm-vKjajl5o
z3N*{l&oeU@Y4Dtqtd|EL?)L?odB<nsDg#OkYhQ1e^=m;=jn*)kQw1V}DN;1rW4tw&
zY%pSl+{zUj^gTN+iB8L>s{%0d4!utGll#rH&-+%iINR|VMwQ@T?!auW^R--jqF@7=
zSFAdIo~>KiF(Q+`{$$cFgtTdS`-}=kCa=>`7Z7zGF`~5bFu06r85Ps}qgVnZtV|-_
zs}c(pdTg-QMIA2PQ#c~frS%IY+)^e=Nb$*GJ)a~&h#(d%@(^}WQae1WGqnj{a_ja(
z%$y~~uoh?{Vr?i#Ma5aUr6?i-xgZ98T?x^IGhEHgZ_7HypCElL)}WeH`b(MtR0!5y
z9(zK|`B3V?j6muZ)HzQcTIPuNYZ=W@o(QRYAF#6i{B&N=<_%_N+O!^dZ)kMfZhKxj
zAtz^ap1DOQ9r31tGS_k&C(O6A(b(DwisLe3)BL5Y4l6s@tT0DcK^(j*!8}J~G>|6e
z65Zf96PUnHt<{9+=)g#ngx}AOZuVD?{lTm7XMe<QAihNMtQbxZeybCEzx9kz{W+~`
z(n%jUm#E*<DcIYn{&6CFfO9bFtYd$_-U1$uo@0;Jfl4Z<Y?QHm-?Z`UfBZ7lkaFt%
z+cv%vX%A9OVz5x%sPLk?&l~oA+bLX<vEmhc*>*edE#0RNycrl410vSK75AG)<z%Bn
zY4_ustcNo3kCYu*Bu{-efq313XA7OTBsv$J=^TC}v_yp;byGXp4oqpC%G%Ooo^l>z
z7CL4fET&4rv<ysYanry=_B0Ih+kXeKyLAzNEeyV5jtXtx2z`PmL10qYqdcUe)N>Bi
zaQ;+lYN*gq;;Q$By0JF;XOP^Pi7@9)ZU5~&(Phx9oUcs*$cR^HaMR6CSfEUSi~H`)
z>;`h}{znDp<7J2PNL-oZ_HvuGwR>dDq}8f}{95QrD@Op$`4oJ2tJ3I+qna__#B9RS
z=H@hQCqa38KIPY<b$wRr9y3G6cf$ApEieIZOIDW5QZv5~DbUX~;ug2kfitO;8d_sj
zW&h3^u$Jr>5w}qjz~Cu|S>s4m2@>=tK4Pg@$y#GNaWgf1AA*w^%>sxVW(VxtX-y%J
zAq91$RwHa`krHtc3JezVmz>)SSzD0L*m<hH`<c0Jtp=hz8<r1;QI4v>L59=YKmzu$
zmbdn$NFBLw)q0dJj<WoeY5H5FOBE0K%DyUb;OF4U$oaqKlsPeN^}gVBsFez=pCsA~
zGZq_0qKIb{xpeey_|x-GwQK<w7t8DOZeAWpj2bX{{xqNn1Hv|qY22(FcKd_v6EdT`
zi)%+jYpAG5&WP<s*;BMT8K*^lp@m3Y#Bek{cpnj;GF%1D5&JONy-=@6KXI-q*<bxp
zJ7L(jWW!YxQPn2Dm9u_juHptpKLNjw&p67PAo@JZP~=Cu)1@)|p0^Nd$>?DZ+z(TX
zgivyErFFP;`n$b;6maZ9Q1DnuY(SQ7h#uM@<Ks3<Zc}C2p(R$LP9(+|qNLBSqZv{(
z44r|D^Ox2Wi(bTrLfcg2Ov^4qzJc~nNJc{?Y&P`EI_8VpT|axF7rGV{dF#FKwxHN9
z^R47XYl|YaeqsOWn76=*S_&%Z4#@Oi9B5X&Zv&eBvq4zU2rah^77Q9*<(ve_@}JLC
ziOX#JBRQ|qttS8r5c+|#6}mo~HwtyCZj;98zZW7Te|Le+Cfl8<C|G|DIaWm93kV^!
zI7<iKYR}|^X$Ee8C>n?o$XbhkxbBD2SH=c7_A0}fY+p|G((;7f!X%c;L=;NJ+!P9W
zVvJ~Hp?a|4fuCT7M@g4(`1OYs1+a6DHnc63U@9($^2=CbJ!L7)y9rlZxNNY?zaP<`
zWoVVrglU@0^<_xLH2@@6_Z-OQ90gX4ZsOC)bzSruFDZhpbC35!ZIZX*;h`NCUp5IB
z(Ox1?19&xtsaA&%WeTF9)|)zN^rkCf!`dqG7RdpY0X%<7&0iN1X@wXmgJ}M)uVZSj
z7Xt=dG&3%hWP52)<niR+-unbI5nHU=Y$B;OSfw|!{nK%Vp4*W+z%Vr>y}Wq_4u}nH
zV*)&1CnJI@W-BWy@Z@i|N^Y%;fJasEX-0Oi{?*oQBokqEHms42?xY3I^jw{6en8@G
zI310)BW`_zk@`oMq8^m6z~VgT+V}c9H7ZA(nJ@b!+3=U4??hQFx{2>7sciRfE`0v*
zzGrOpC%Pa7dA~eg3H&={esA}}Y??<)ShAq5U{Go0^l0>Ul~YtxG3Cn~Xjr4hK=5hN
zdMGUbJe1o})^<@fA;j_-J~WsW{v}UWAbora<BDQi)<3ssFlo_dh0tFkAQ5R)tYbRo
zn|E;5NbXQO@uYj<ro9lMx@TswU&#!F0KhO!1kTNBhwG_R_JV$f=DJ_(7z#;j7I!mi
zX+4<=M<Oms6_&9NN(I399Z>`ZO5Q)hN!QF~Yjy{#z>btYkRG@h7X~7#tfH2y=g%!j
ztQwHs-`_*aVLBKL+8o-<?t3NDuIV_`TE(*73q6(}f^8me6lwss;|oymbAg92Q>`3+
zh{(u%c_>KLd~+T&V!E6|<cti->Z%kh<GWixWFy``CHowIxyygq0jizjhoTEPh1A+8
zaUYr}aQ&<Wh3QOESml%x8}a7jK7&{X&=qNTFVy(Xw`*JjpTcOo7>1=-iO>>Q@JUf-
zbd6S{OvoOHrUul3O$K13?2Diek3)c%Hb@7&s@urKz+x;`(0zMZS}4pdOf=7Nz~AVF
z%wh0@n!Pr)RkH+_1;@eF&#ImYy)pbY`J{o_AgED-$b=)$=sa{C&Dsg<kxRfA>&WG+
z7_V)})VkvH@2#xS+#V~z$}rmlAdg^6cr8;9b^~uE=B*Q}>ld#g_#H*>wSJ!(XN3Jp
znUC4z<cjozal{`=T~{NkJsY#KxuDaAcoYUcmPISIY$(0#SYf+aNwKI;)sgbB2p_+;
z&mWij2TF%FQqOKR=TYzBFr2_V9CE>mjhgMNq^ko(f+BnNGGAs{h!fnk3gV4fS_tp@
zmj~zpjgP1AYf8knbD}l(8XLQF?cw&ZfEUl3f4&>($5@G++1R3Q)g?~b<F|k5IW0Km
z6#}td;{k3%)Jcvb@8Zg;c+$&}U~S>XRJWa}5a(E8DP(6hbWW7GifX4y@5%=tgv;e;
zY9yf&cOTgmMH;23C&mo{a6L^yX72h(<G|S~&ryRpy@a^9nr+hhPL@6=;XRlikUsBR
z8>CK4P=Wj}gM~gly7x&ew@f`f(z|DylKVxCn~)6&-u#g1ucDljGv#MdHN3<HiUwYm
zOnI%3D?rCuzEz^OPiNN4_o|eJMqij9PN?O<KMIh%n@cMa|8O~Gs(aflKSAtKeYP>I
zcw-5cKO(BIIH2R8+|C*-E06r_#BBaSt{fT`A{&776@UJ2x$vH6)iYvaHm0L8F?k}V
z7|=NkOdh(nQdRnC*OHIj2$rWFLu!^0F;c9;6$yP|?-gx7>(<kwd_KHN8QtRksm5B7
zYwvolCVlw$Cq*Gv^%~yxk$nyr-llhGURD=cy_&gfT}$5bscI*VmtWyqh!$;z3`qBB
z%#)N_UHl@cJVZe6d|ZglwXDU{Sf@V(`4*mi0INqq;YRdTZTT7S3MFBhBWAzp1GlBX
zmi+j7UYCu3ja$`-dy~60#N6QU(v2T|I%mwRK*|G~6TB9qJ3nGMrtLKJ*)YHmXD)}}
z$5Ms2M-O%?irrGUL)BD(h;f||cO>n`Z+`av@9(dtJHdnEv}1W9ZQd`lj<o1|^I;Q)
zlY?t##vUs-!L~T`S3dtwq<^*k4_3q9QF)NGhy?%sUjd!}!(M;UKY+%cAuvn7()15X
zz_;y21_I?Gz?pUDU%3CTQc<HUZ|UaZ7ky?H9F%yfC`hcd2VZEfvU?mThNg*nxEz4A
zK<pV*J;+hy9-Ujjvwy!UD!f^JL>-Uph!^cUb>t3WlPpz$aG?*L#XAdu0?DHquEZpA
z$yOgn9`Lu=GEBXE<vI?f(kKOUnpo@v+Em0H@Z5(4+Z4q-LUu6i)Ly_DER*~h4~N^v
zY@<_6R`J)yhTyI#rQ6SBzJHd7hPfQ5r<*W_*+q1ghUkpGo;<ok%T}dEc!f21`-2Hk
zA*%6Ywg~OEWz*t%vCw3V*>&$d!1Jo?W+j}jXI~AWuPS~~d4cL`gg>f3qmKf7#N1DZ
zqlZ4yh_all8br1la0SXIUrD8c@MOjABTb;pf~GU`t)9cC+4#6(x0G%+4MLg}h;O;&
z%YjcDibc_eMcJ{_ZdiINR~S6_vQL(yr`(u8=B2p(!m72vHF^xf-(S;NnQ9yjKQfOM
zfIeM5(k-|&hBfg7wcy!PfYCQ+?mG;$9uq!K<gfT4OE38^dPlWj20hx0rQcp$a~;x_
zUd#UUm@eaR9<8egjJ&-z_?7PJ-j{Lz*A%xC+@fcFCmrWLV;MGz$9Wfry~P(=C^Ggj
zG?MFf`|PuHVdHs&l9Ol@rxo3$LC`^&`Xgkr`MlT9{#canPgn$pr(EtT;>rf9O(_KI
zOwF9|At0;14{?Q!t~q<g2(oC>HK;=$NI08ZR3ihyI5acIwUCUC=T8@Zpt?#Mwnvn#
zR!sF*ZnFO`|5Qj@E=_hd{@P4$mAbPDD6G_b436atfXltMWG8A4u&`8@RDfK(kd#GY
zBupD`shA<MoE6XIL3T|DPg=tse*T?~v~0>LGg@q;Y(U>-vQCil$`u-i_flI?E;(gs
ze`1_Kyc-NprmhXbqel_Z^TxK%kENeJ0k||j?bQaMAMe-G+eRMt<8Fuvo-YNomi#|{
z-|qL@0@;5x!hy@Zr@gxeMIzod*^VMOLC*?Zi4m}gVJ_-QiW@3iy%7Cc>VUOL?a<TK
z%jbq+J*qjzDH9XV4=rcfByMQzo?GSx74Pw^b|MX;&sP2jX2y}I6B}5AU;nxvOg>(<
zu*v)JhrxNzl&AtjeNbQK!w`r`MRG#HJ?H#(2`IjV{{-HNC^kaVQg_~v`bu>`A7(F>
z%P;S9H)n}v@oj~Iv#RKbVId2S-_=Be=c)818{7k1M=rW%E9O)FLA*Pb3|D8UbXGmF
z(?D}eG>f3F<OawX(^NJoXDha+5zawlxQqa2EcXK5&u;w|qNtu|&sBFwpU@45tn=t{
z)aqE$x2}if#HNen(L3@q59|_MnOE_8KU#!?tsFDr+(m2u%Ex&Lbp-$6>K@-26KH;L
z7KD7>#*rU!_l0?ethZq&p)*F4TwvhwFH#;`gJ&mlxTEwdDt-7}bZ>(KeCen|;=j5@
zlCi6e8JJRZMKw13{umF+=+r|w-@o`3Y|6Y87T#In9&0PdK0cL1z)>tX>$6a^7RSuv
zEG|ymxChOnXwb@N+J`q{pr<{<KX{mf%p5vKDS?<uNb?<$G<5_tp_G@qXZXt!DQ>rm
zV7;J&LCZ3;G34IYb_FnK=vgIEn^MSkZJg$(l$9VD_YqoAk*TXYk7EgU$o-crE^((h
z%ZRK|z_Lmt)#B<z1Fc62lDb3nZx=^=oE=L<xc2$q?izs9D#|R{aPlHbpHs`QI5lTw
z+$t8qDWu&FKH_-KzIE^72m-sl&TMY|*-C1rp_;0YRg6xHXn)Oxl}h=-A%j}-F_S~J
zTx&NXY?eelMV5s_YL~1{z=IveO=1vmjSO3BlK&f}z}7XXA<D_Hd<m5Xm<5-dP;}z1
zJAk7?YjOP&`uY&t{H<RKtPiA4Es(tuuQK(wY@LsIg@tOB0_LaJuTEQ;Tv+jJQQT4O
zCD@y}`#=ZYe$E0Cv%HcP#(DlwJnVheALiJCNN=<$vk!<rHHmzr&atWJ<7Fdqg_c(p
zE};V6@oee-z2n&QL<nCBwo+N@%|#GgxNd>^%BeVfE86s&5WW6_hqs})a^V3^T~mF(
zsz687#i}wa-SsaEanC?t$2uE6A_sW7F32NW3qu27F&*z<b`act>Zb1LIUQD`$C#f7
z*}ZAuPRm4xl;s!}eZhSfpMK2zhs#<{5qug6xq>G<3QTd~T(Vo*KhSz{hhR<p$qEVu
z^&a9Z_>1t$;fM9Hx+B1|@hu6zC%C^f6hoCm7R(`NCB;go1TZjL|FGf#yqYJ&@9zjT
zqS)4B0nl_L79)J{8*HL*8y~ebI8V{ruuG)p*spT;cuD$=KC5nj>zvs7IthFEKiJja
z;z7VBGe)vl$J|=!j)P0H4X<J@)cEGe=Ib|MvCPZ+$nR9o#T0u)5NWzg+u*#&`U`RC
z3B@Q+;p<m*gr1IVxdrL)tJf}%Qz(wH{P}x5#r&WdkJwd8Ffgi;rP{FG4Lx3c5Oen7
zI5KW=(6)Yu2-f9dhv2i|TU}{EKlgi3Ae>L&#>}RO={&lrfw`KjW9#-g%jtfSZM@*v
z&+Qk*4sIoizqzG0^C%M5joFm4xJI+iIzKTvq?vHiy%Lo#j1`+Ok@<}>eiH1462eM-
zt;%3*av!b|L~r}IH*0eRb&AQ0f{69MOcLGWA(|$6oZ)h1_QeRaSYr*de)8rJp=B03
zfdVpB^=HqXQ<9h>EtFJI)yg35JF%7@HJ4mE>@eH)rR#F9%8}QQ5Inx(-_NbWn_*^3
z3Sh=_AfCudQ1}<7FRsFrQ&*Talsyrx>r^zNAP?eZdmJ*QDlnI_3f@ztG|w_87|aDm
zyYnSMJ91^(tpkdzG}nVFj{2q>m)`Cc#UQ<_1XI-au=zN6+oL?QmtvkFnzPdK693c~
zBUYcmE-E^#m_*_VveRv{rlPu?Y0PPfNebyk@ns;PI=w})BLwa;U&g_K!OI1tMg{|f
zzlRs5O)9P~es-!ccC|eZgzMq4L9ZS4&>?|;b(ToO-K~tEr_O$HFIVi1-~x0sT}Mji
zu)_?M9dcjk;*Gy(BmE|cDzl+k@4zh<*0Ud`NN!{f@m5J*Lpolg{(hh;`5K0998{Sw
z1l>IKUmW!4Tb!u4C)1*M0HPoG$WKZNF8BM+h&$3u`<}(AV@TMUvp_P$HP%>_lEG(-
z%G42y-lSk{ub!r*oJq6NzpvWH{$x`XhILhlgLJhUdJi6#_0UG%z)Rw(i)gamT^ZKd
zh?ytX^)c{cj+g%t-*BpPWnWg8LdVB0CJ%Y6BWF*T;Jwf>ljRQicSF`>nG2aDHE%!(
z`P@r|tuHS^yP>_D5gepZ+*EmAmY)yG=TQktKV<|EoDo&r{IHQa7Z;HGM+<#%v5$|q
zOK0<I{wE2xL7u$!%~0&>-r1&bBuM}hJexsSdK<!gB<q;s#XwBN8-sW@UhnLdA2&LI
z1p@)$e*tkoj=vl>G^-MQXv@h<Sqw=cdoH8@rEgF>d{6oVc4wCvq1u<W9NtY}%XA_D
zzZE0c)>SMi^LPwrw3lGa+R-E%v)P@%+a0w8<>edt5=T;>Wz9NHmHmcbzG}P`WBNrm
zIoF6}n&nq&#ab5=4mkkVOXq|*hOkfNVoD+G^$;f)osP4?mxVD0=l7D%^h|I)6YN7M
zX%plNX1*9Dl^#J`==q63H92x>01|0y6wwGBrgYrZ!l*Y3sy{=vEp(ve_x$~%rv7C8
zsJOm-U>qte{~Sl5So(_tqFyb={&Zc`Y_JjZRCFAf7i0^#ii5xfaVF|QKLcx49S2)W
zTY;yG(^gSv=n@p;3yRazYwLL1eq5Sm^j7Yp&~Z9KyX?GYf(XTEsx3*0icRWp?#4=q
zMhqo$yo6M8n7ro%y0KvtO^U|p*_pN?qQ2$qSzS7#S3G;cTiHvsG({?eTdgI7PSWeK
zWcB2Dw{9EV*n3+D?OxnWiAs&vdz&nwIA=mK!1d7Zj4(^lG3A!$o2RCltJm$TG0d8k
z>yg7?3eSN?OvcJpUJ5}?e%^@0IPCdOd;ehPh;~KACnZC#?DRBGB%P6#HA$s|;}?e~
z$L(V@^`qRPcOndsB>BhG`~$a`wFs8{49)4aA~RH(F1m`!HI|A2g~iP{Qma(vKnxqR
zXjIDL&_d<{BtOEiste9~+}Ach+KME7*RqX8{Jd-%7RAhj;3xxvCP!9e!qOydSeB3C
zZUR*AHgisJ;?Tyu-<R5?rDlS;pP><1b{UU*WLpoX21s6XYXF$3aV{|o4mM2C;vS8_
zu?6&s#yrw>Lqu1aLZx*@ylx7TmRa4a*Q~@))&W3s6Z67eIzg+}Hi%iE*@rK%(v=2U
zUtv0OGTbw>8Ck}X#YBCdgrIz6UW&whEG03$`Nv4of#&h4!p1JqUIGX!X5|b?WyLd&
zs;A7d-fjBD2@R;-K3WXt=kXXrSr9m?w*KAD<F#pxBNN-PMwF2X?-9`lC@~q?A&vcf
zcvcHe5Mw)+PGvx2ML#;7Rs|{5yP!76x}QxOmKV*wbIr2<20F1!#(=J`BJ})1v~bGS
ze>hjV9kF098?rkZ`*{$Tos%SFoB-dPDdS8|sYf12ns!hi2bd)r_sI5@oJ67@vP(3i
zZ4eewIbz67E5rDG-3j_k$v`l4NIn?@+mBYV&}j-qGIqyN;ReyeDi=>Xk<(<D!$uEr
z1*W$zu3+65V@_Xk>=QHARGZCG%#@XAk_<-K7@((r#Vz-V)s?R8S+hA+op34i*))y9
zbvsH-;KP#Z)MGmY9Byb+bRB3>CD_H&eM;dPosDhabl_Uz3A8LRhL-de(y$R2noI@d
zM4%J<*e8N5k)7M0%Cu<b;vrfLWi|r<bdl$zrz$Zex7`xb4?$2{S}!<uaW4Dsm^WT`
z_+qf<Fn60C^H&dstwEZWEDX^<ZAh+u3`2BB@>IH1fZ(}1VShJ+Mb%d>gn2~zX?Hf-
zb@5}vp{f+Ig_w@<q^1QKQy#=H3le()=$x^1l&A&(Z)zxa(B-R>qxR0;J|MW~H5D`6
zqvAN|JXg5?`yp$61zi_IUo+&q!qBR}8OcXWkn^HV6F4M+v|COMRP$%0u-#4z=g$UX
z1xjK039F{*`)q6a8RncpJ!_a+E@-}I8PumX;tCj1`eveOgZPNWQdN|iONn4s*bu=P
z#d)a-g-Fnf$(7NR!O0b@wo?XH#TtK^$pxdblyQ<<(F#QiG>55NtLT7<oQrC^zA6Pq
zLDWoZ<YQ2m4%JMNZY2!$4WGJI<-=ztloGMX*OP?Kv}+^yV)tSBj4Q_}uC11Xc-<iG
zJxcmyU9XwLh-ps6)&T;HG?QSl4sr(vC}fx2381!_bidLh6>DntY^9n#W07cCwgzjs
zRr!l8I>uV4PA29Tf~R4Rr`-wDx@P?piBg&{LMC0&yHFGq7NUw}BkGp=vw^Q9Y13?u
zO|fd6U@mw-n6#54R20yuMi7A*VzNX){mC3535%_?QgaOG`W&czX%$bkb(vU+C5n@r
zcXEbq@Nk$fdA_F5*Nv9tMFdy&#zcv|#4b2;1m;jPFdmENVIj(se`A+hAhLPEC*J6#
z3XyVC#rZ4}D+Km#(=%1GRnn$Uyz1xBIuCtiGu-}*Gp$-?OvX!a$%D!jTY^SRK3?Ih
zzT@$n+0dmyr64urv=`4+Ka5J_%bLit9)APZfGotlsK%b+KU;pv_gCwUP-xlEFcx5D
zwm$1DLnU$CNl^PF7|5oQ)chQzW#}dL1_mOjI4bVX?Jm?C_Qa)x{j}e&&zUUH*#*T1
z&?ah)j<fR)C8LqbJ(T=26kMj0VUp)69d|DoP0kr%sW<RrRFpf^6%}rSk-d-}<khdU
zOra~Ul+CVU?yl2aPBxf*w4=E0aR@+=lY|Od)l<+8-^S5g-6hU%*5+(*ZKZ?Mh44A=
zB88igjjh+Pr>1JiqlkDEYUpolz<xJZKXwg!{P<f%g}FWySD%W{girs7IBxis{3a)B
z57A2(sec6<tiZFUSe?c`fHa*|u1tIvI0aT^DC2IJR4mE{EV3jo@KzR9P$=Qr&|i97
z{Z%zp-=Jqh-9KvcVLj`x-zeTZVQSB$JT9zAi0AuKYog%BK6m2Nag9Yoz*F0;^4)s4
z#789oJobAnu5}Ah+;E5dRfYunr_nG$ePuibhOXO>2cxJEr^KW_EQT<760M*ub?tv%
z*H$T2a-j%3WyyqAL{pp-XF4jx2&|Y}%Eg?;(pCL#7^)%^m)@**BU+MQOAR*^JyRFQ
zB3hXpg}$g^5}o&^m$=iLi6jT*Eiw8=k9BWZx)1#j7r}iJNGdS2Xgwa$qL6n5RXw-h
z6L<z3t&S@b0NS!^CXSuVowJxBGT2vL<)l*{CuceCH179i6f|<!KPU#(2<fCz(n1SR
z(h3o!CelLHKo%<+Qbg(8!zt~^8qnv@Z~JE@1h6-0rY3)5re(maQF+68v3>M>Z{w4O
zQI`2Ys@ieo3*oVE1ma`cqP@!G0WOv<h#TgLNq@Zol!POncOVsU!ar>sZoKH?F#hNm
zXMcUlKQrS0sh!UHpAiFaM*QcMZyv7t@&CSg`1r5*f4|445dZJx>yy2o+pi7}UtkQt
zKTQz8xx)Kd(2DI5y=$H^nP>e5?1z8doa3BtTCuQ1(@i4$Ll}^W6pUzP2o-C^j`#m(
zZzH;YKQ$yvC^;E)+T5Zi38z5fPO+C@vOlp9Y-i(Mg1$hd`I$ZzZ^0S+KjZwLXW9Gw
zb0fgdI{%MXANld$AAj@L`Tt!$*N^|ctOJJ=a8Od%IO?a9Nk1Xmx4b(}F0Z0y6E%BR
zcQI#dhTdVrDIl8u6^8N7#uL`LK?!UPLsp9q;iZIMhBpH{bYm7J!(MZmC*z!hFhjv!
zW|hT|?og6Kwxdr-Hl5^YkCm~|c`_zjqJG*L6KAWu4=*`}x8(X7(4Z2;23arRINTaF
z?*07g@aTktf7R~M>_urjOfK8_yI!jsQ|`)oFph4a${(=*GtNILO1|#-Uwia$^_#-^
zfAsLL^Z$E%3im&;VE=jHf5mfpFo;KABvSAg6UWXfG@YdVuM<XCMHm#f_E1z;Kdhiw
zEl$}kkCZ?EPR5ySqBCX7KNdZ$P5HNDxW@gBY%!5EKP}k%QR^F4IK)Ebc?T=M$Yv4)
z^Ku9lcM7V^R4gL>=o}lO@JjPG)*)BfLZA%;<~ut;ti9Mf*x?+@H6<z4YjuMrFq}$c
z#5&3}i^g~H)H9}(8R@AgQQ36ZPv67sSBv!~keF0{Zbf|Vv@EpD1ky5!pctOOr0b@U
zTc`En%J|jj*gl%Xmf7fv)|LHp^@5S90{Yq0mD$Bom*>e)g#+OHBy8NRLc&-s{AnJI
zvYf79ysRmwL^m6cF{l6r=~$*7PgAjX?<HMI!6Jcj8xckrM$wuX4&3)ShM2(#@JM*j
zITN=!D}t`DNd;uVWlj8TR0cOCw$wwEz;j942;1L7*FYMj-8u*ax2OU+5YE#!g+tpU
zRv#$?_R$?ZnR<PeG3@fa=s3YO9#AZ6ik3iqQ%E78n)3E3Ok4RD*Nx2nhM2Gd^)j7g
zJR8gYoyw~i73{)IRKR@Rv~H*wSqJpbZIeBEujUkV;#17__jDR}10N`nRmeip!(u_p
z$Dyqq&{#*i)#`mQ`iEIZ5uu(TKspo`IRzWQ)Y&mU8U{J>zyJOE;O~kZlsYtgyOJ8T
zA7#RxwXJLocU>^LbmEH8Jkr6aU(*3mG|Hysw0tM&ou0?DqrE+zMkMC#9|KJT3jgoD
z6BImP6so9D01j1nJR22*9>iCjWWJ#X_7QWrw0n6T-qTYc4fJ_o2fagdia~3}WK7tO
z5FKL7l%s;H)0AVNjJN~52_ngk1XrF82Y5JoZV+Yc5B4pFgN+!*9+T`N9CUbqi>~n6
zLSdz9dd|lD_+#l>Rqcf-7H!f6UA5pFuGJG49dprP)<zX-J3k+%!}lJg;NR;mtq_hS
zP!ViPDrfzkx~a>KlA$S>L(?PR-=-$N#+v$gsVq$C>8UB_cMvrrp}_7VxuB?}o=tV=
zac;?cwQ+*gcXKNr0lz)Vl?^WlDwlj9|I<-?reY#si!@l1LCCE8WGtF$nFhAezC=GU
zHl!F@!K=vs-yWL@-Wi&zs^Y3Xd8VSRZqO<=q63tr9XC9qR~cJ%nsV1bwj4KG=Xjw6
zmJ7(522j^AbN#L6*L6J(n;OX5y>vXel1|)v$y-Bi#=-4UU~G{T_5so@spVIY6!xx~
zc{UTuNq4QY8KT<%v`3XzSi0fvn!4xknIntgS!eDmlILxP{XZ9xE`us1)!CWUCf8ji
zt*wxaQ10{=N!oN`*2Y6ksu&902JF2mG=I%SU3q)vNn3Ox+BxS`gF710xrCYq9`p_3
zCM>>K(3nDCcf85M6P_Tzfv}R?1YYuAXaa-jzyJMvPQa);0*+DEKDmJ`ZTp45_6heC
zx_JtVU?bxh(=E<as?Rgu88^?IYv5>X99%<4W}YeQ(=9iSeTVnvUO02n6wP%=0@lVv
z&XdS|hZXC0;x2|CvJ2ePKiCOo*wzme3s-D|(6PkcrN0HED0PFWnQ>{uL`m%4x*m-b
z0PfccT{G0v&Usi3Ga=<WYP_RL*)wX}5G3KSd)7u<k_P2;LR5aaw}FP!FfVHL$0i+F
zr=MP=*;GN9PTliAh<(Yg3R^^=V^>0zqiCF-rRdwQZjEe6@%<>|Ia<>rsfd?5M)gG{
z4k>w1z<`eNy=0P%2T*^)&Mb*!@<E*t6eC}K$@bInN6?5=I$2n3-KTgvliG&EpTO{j
zSSj<^rznmF)BYqK^%Gs!9B3Tko0X{5ie7C$->cghhM52RHyXjAeVn+qX)CMQ`wx_?
zMN*j-$@^fFI&5$6?jEf@-9Fx{g&g*{^ZTk#8X`9(G|5m%0=o`1-;DfbHY|59uC^uq
zrHT`$VubI8BB+&kl%7DNZD`HU6KjN~JjYrp>>Cn(6ezRVB(X)eUXvs)rG>9W1h)q|
zVT|)M{@}~xuS4!Ga%2Y#egGr8#FLSqQ#xJBI!kHu;8>lVQ#z+E#sVAXPX1p#IB_R7
z<3iI(Px!n+{XIqJOoJh4LOC2i07y93v{DoggZ3THB`lTGrQv0D2m1%qf!lxKwMMR1
z8MApxPPsk7I3grR;Z0|^TQlBt*c|mKE|V6i+?d7dc<d|fn*gXqx|fOD%9tBIm@dTe
zX{6w3fL_mHN^3;%R?|Vkamn?bSu-&E_{3U5v!1lUdgak=e8Grnt}$<f;;%Pv7Ecg!
z!0{?zJi@v-JE*XKniFRu*8oioL*EPr8Q$^vqDnajw=cc5GbY<$Xch^L8`X;^n`SBP
zOZ$5B^rk5i7z;|7Td#&vcfkIz%0bwX1QbB{%Wt1cF1pfVtqGJd(g4qszM@6v)C$^2
z)KZbSNR*;Gsh7Bs#zx)d&<ko*U#+RG$dB`DLai~CXhO&HXhP?asZ^{&Sq{$M|8j9I
zmOt`RDY;Mt)#}EBD92Kgm68J90drx<0lQLli;Vzz%y@sn+yu7)8Lfk^N69dQ#n;wK
z!zAh9ERcwfSxlpgQf=}dDTL)hrYl0Oi&nr$ivVR(BNW1rhJivQj1?p}R3{hIdYF=P
zU4B3o%|#-TnsE{qUt9W30bv}CfUv;X6N?u3PL^-o65b&}+8teCAC0mtXy|rnM7e~P
z@DO65lIp~dIiW%pcu5G^RL)6Jf&5d7!S!>Llaap2FgSPf2*U$f=ML*Okql2b2phI%
z*P|7OYFaVs#^8tD>9G-8siKUsXpoBRns~}cdz}dyUxMP}Pt;k@Qd(bAC+#Suy@1C>
zrSx^R(nQwHt4&aVHIJ6p$jU0+Tua9_YZ0%tDiYSsX2W_m8>XDgeI{&%s+m(*d<r<y
zBxWcD_I^IuJ2+|oaCrFlW3u|$-+r<GKYK?Ti=V2eu_sk>v<eAoDp*OHM8)YWC)I3u
z;4~>4kjW5otwH#^GJ6;$1DL1h>u8KBm&#-QwH|TC)O>KAWm@r3r(hSITxh23U=W<I
zODY7&Gw6UURVE^7Rc3bjnRwWLN_TD}C3|NI<%OP#)T=XA{A-^~w<!&>T|!Z1y;Ag?
z`GK}LTmu9(XLNN-QnmWJK8Lr&|Gv)*`)~1s`8*5o8U7y+A3u2H`+u!Hdi0n5_wVs3
z*ncZ;_y0HxaMgT9?GYwXUR>mMrK6HW_vGuGj$cgasuw`Jj<5~<s}c!hqxhF;Vn^+1
zZeeqnsR{mUSdXzm%nAg5?8n#|JjOrvV{RB;@RtJdqy~l5MLQXfF=-86Wjrta7D+lY
z?If3s^G+f2-ibbhkF7XVqcN=aX>I9=TK}ze&aO!FBL6htelC(RT!ZUNczs%_P%icI
zq9VxTKk?d*Zs)bz)A|yW=4GTW<bt<hN3!wCza1{=_H{jb+37OxWXM<GLI&2(vwka<
zfSo8=@{RDu5LsTnGv1<CEb=i+WT3tB=`x!=&z$XHl}y?yBIbT&b1IqoFq?ew>7ygr
z7g_>;cqPl=74w!NG{=(Vp!i7FKBED2#CQ`!j9AfdsP*d}TpOmQl!xv%sfg(;Z*9WE
zby#3(TB*tD2U>lsqU<GF%9o<`Xlbe8jqLY1_^|&an`<w2$;MhmyiN6YYQw!vFoK%I
z1GNHOS$l^+LlN9?f&1{=t%d=A?21ZOxr<5jCg&<>_ebwaQ&A{p48acSU<J{%Lw#CR
znp@bWZKG1?){8yy)w=hhcoh2Qm=mAf{mt|gb1C}n?<gE-?>sf5D;!VUCH(_~NICPc
zis3oHTy^>pZ1Bxw*h^1m&;56x|7OttopkuQ-k&q+|FwsYSAGA_2Wx-%fBr6?KMReI
zfHtFb#fxH7e0f^&txT9CiW`MVpnhFc%ndw&BmL}<#LQPoUK=N8ZE-zBQ!)NZ!IkO@
z3kz=-7k(`-(SYVoUT(kQ7A-MijT`vb2=_b8s=C#6j(2Kg`v&*qS^I1}qQAYQKf&a%
z@^_T~oANHhHy95Nm~{M74lbJP{d81c;1A5k8OP0=@NccQ`ufQe?g7nlYTPtEqHlF-
zmM{Gg$DDfcyiGPsjlz>?Ir19Rbqnp*>x&C$XxS#s+}`ox%_(7Ee~*IChnaeOytDXm
zLyUHK?}5cL@sc(A4}{;)p@<vN5`6a~yg`Sb9NkS~Cd1}-r(+ZOQ3;Kcctm%>9bF7b
z$RVmcEF(v{YpkIfy@(eT+cGd!sq0M4W;^W~X;;VsQF)A&1k1vLp-5Q-ZT8YuMZ~g0
zJv$9oM8cZUK{(>o%#MnYuIB8=iD>0^^G74>FZ`J&{?pfu|FHUC^}z%G{{Lq6ulxUZ
z`IN+e`p=gBRTa!fOlfG+zrAyG(msB*f3S1-`rt(0!|vngAwa64+rNCc2jutSNlcs`
z4$NUmUTpu*Kicr+?~CF)!}+|(;a%{z49u_TGBcLX*TMp#x=}XdWJ;RdlOhgMoGjc^
zg?nuYTBWbHuec&;>hKd<ox{d;fhCVdJZ}|0y-ub`WJADmM@;LHot^a)dx_YDaFKFo
zX5<EWmXX0xf08y;DK?S7<%@Xtd$r=~*U`Y}hI-%rY5(BCTHO!wgTr0)2C9C-t<y$j
z7Ul+=NK!Ui606F^lgZdCjE|JCxpogR)}%eorV|)SUD;i8Q~blOIzF=%f9}|fj|h)O
zI&wN_P!o9deYMS=0l0xRUTCX{7|O2QWw7mbYVJ!|OZsB3P)!%E*I0k64DafOL1&Vp
zU|m9~kzLACb-^@+P(|4(XZwVgWY)78-Jw^KiV2@>=pZEk0qFn@o;pZOQP}X~ll_-_
zZQv{pU26p<0*Bqvlu|3KG6`tK&_^8C#{81Xjbu29x)hxPXu?7Kq0K*>#eTW{God@E
z(#xnpY6Uu><}TxuWNZsg21S|t_==Y06n#oKz@9QH!8ta!hCHIU`^z*1f`cN`TVfb?
z1-k^AD*@VeIJtj6dZLD@ZNYC8iQZ-LyT`^Qogq-k?0?7(IVs9BPs<`#I0N2r1w-CK
zt}iag28mnI9o{CfY9yac**G+>qkNy*(y)u2Mfv;WQp_gxUQ@vh{Qzy!YIo=%(w({o
zR8v1#Ll2Sm<h+O2H=bmJwA-enz-Ug?o<3Ns-BGKJo0SgFsBj}%6?SI(<nZPGPWx!@
z#rDs8yAoiU7cpVCp9z|x=NO;h0_Jg<35LaNk`r_lh3!M1pKOps-K%cj_9mYfBAkKe
z(@yok{W0SvRe+R}JA&*zr<8K}G8)B`a~|wWD1dseX^*1;ZYNf6Vs%b@+RdhTAu0RU
z&z+42RJ8R3@)|^lYxY4z<N&(7dJ99CjN|Ual+Zx5xL^;fjm2|XHK~eDX)^LjHZg^u
z4QAYh_tfJUATy?_;At&Z!C3IT?e6F+s%+@EE&}UYktxoPxJCad>RRc`hMRPUQMiYZ
z?MR?LnzqB4;BT9eE>x*oi_a{3aB?dp#k`fKV*CaO>kC#bX<F-J=sq%I37N@M+)*=Z
z2=#FYE?wasbL{$%1~P$52~<iIf2)eDp$e<jn&~yC@R}XkjH_F*xttek_6u$F1Cv}$
z=_a%cfw&>B*jl*Qnw$w~=ZTbbWJAr>4ac=k^|=`;yy6;q%F|T^(j3sXAkhl$a=^Hu
zOrz+*2_Z!yso}l(5hQI&p+P7*CX*L$MmTr=f&T(SwFSh;hn2^`RV|qO2FFJ~p*4YS
zQKT+V9oIx|8dH2{4Bz06I!-8A_4crL441+VqG+cHxd2_3u0(`~eK9kY^eIe=&k!6Q
zw_hJT+ulE7uAnZ9!aV_yxbKN_+o)&^$5U)%rM!wm8)Ho@<*;)i5|mBRyqhE_DKK+*
zbA~uP`nFN<(yykxy=7kzBXLeNF6HW0*qLAu<D0zOPDjEO;U7g37T+^C;#a$mf|Ryc
z5m4vkYLsx@hD#Zr{Nt6*cu}0YJL9O(d9g2*sfCMf%r`*4l2RdtlO$S0;=_x+8~TT$
z;_cU))e)z8uN-?SHE(T9<p!~43A%d=Sl5b^yJGHktrVY@8G2ZjT`Ho!_Vs9){HyVY
zJE;_K&)J#dVK85JAu)GpZ`G{!9Amj@P;uZY;;YBq!j@&4<GqpV#|KyCSzd0tvPXs+
z<D{9Y+W>Xv)DTL9mIU=I(b|Zih>og879+|hQdy5^+(QQ|c-vCaB;1HO7Sb26DgQ}f
zbBhSK5K3hRqAj%WSx7f{0|dHouagaH#jYE9{;$uU;Zvdi**SdmkNtz^pWnv}`;P}}
z5B>Pxj~_q!<}dxv@9}v(M3c0LB3E9fa3SZTq??|m=x=xmm@1bj{gDETD9@(jF8ZgU
zfVndzFJ8Fs7V~N6Ul>Ph!jWf;GjTudVtD`c#pW0OETY(LoT6iLZKocst*opy*H%`)
zjs82%VNiP)@i32`{0o01-*@9-HoSy^wty1ZYAtT}`w`X6DLwP}0@VP82EV}u*P@r%
zztes{j-CN)(Gy4EXucNy#zT4*cN0L#aM|q-yJeLZj}muThdpxhg)NX($0wb17>_Bb
z{2*^|qzJeQ@ozQ-#ybOKoU%7Fc_~FBjMg*3<Ojf@U8JZLA-`aEmw<@ur4tJFhLr}%
zWPNe96}clK^H3QICP-k%Z3$9J{-`86?CM1rX275&wVbsR6yE~P8?YI>LkZqtMgyI8
z`*Au*#;wJ*;wYduYZcTeV0yhNM=bgZ15pQ|mvyJ;y-F*LjX|Yl*Z>axI*2F980eAQ
zEH>>B)wJdSn|<=b{&94C`0V7T?W4U2zP~y;{BeJGZ#R1SkLcuwy$BKT(f;!vPNE+U
zU+nH3)sE}Y|NXz)$58g}-Dvw@7ykc8wD<F?qrKzf#lxd$|K+O}`%oVmJlZ}u*~e&R
z=mP(G7w~u^diwe#IygLuUhKczKY?N=hYjkdSS>nyw)k@IXy*s`x&3ti#s0}ZsJ~}y
zC=)${&bFgh+eat+JFj1CA4RWTAH6y}-ivT1yZgsGFShqz?(L!z`T=ygxcB28u>8kA
z0Hstqv!{D7Ff!4l)?sG5`$u~_CpZQ9wg{7f1%fdF6L9=$Z)YFB?ESn46WBibM<arY
zJBJ6yd;jM(6oQx0?)J;==P;jIaTylvWq_sMd406^5{G&CEINMu^!Q}|1Sq=b`QhR2
zF*ba>cl6`_&ff7x^a8kcEcN<$uK_)rY-7iZ&;%?GyoRz*Umx$&LhT=%>>VAwes!{c
zcu<GQ{sb!lW85Z{53cCp0ZkPa<?!eqxa_zFwBU{Cryus<`4O%m%<AN58yDmF<Y<5A
zB(jP@e<!FGGjog%_MX4ke~!`Z5iAa|m7n&H_v)}e`^Q*dpS%5O8~S`rQ^sw9QSny`
zFkyXR^P>G{i`%<D?&GkfFzom7zQ6`8+0GBL+^sK<>Hp|!@_+58g8l<YJqED-{61#o
ze_C1f?SCFWe!TJ*{r7u(9<^3mE6tVW*~(vM?EjCSit`T?*76tWgK|86^Qip%udMjz
z|H0$O{}ny@BE8S}{Qvy?&)9$Uqm`ex(%~oeF$@2%t$F<a+Un}+U-|!jm(R@`w9olD
zMwv)X(+`{9^WX0mlMe|Qc+x}b$M=i<w9`w+o8R-_?-v)pf3e#JF671G_HO&f?W6BE
zZ~e;eJ}$#w4Mg7`A0F-fh%I9Vz{syfJw{8nzF+$5F8aMbGtWONbwB;+)2H(MKYH+Z
zZRJ5B{=;AP-@ni2=8b51nvZF-li>vli~5U;HzP}q)vZUXfBW0FO%#VUqUTwLCblTW
zf?`22)=hZv1teKFqc0=N!iG?qg~P(nz0VYCK{G5(YJ8$Vt85r^O0}TAFW36Ckw8Ns
znbzC_EvWB`wA927l2k{iqc|8aCJSz0(B>Vjemco%Rzq$q8?(`2Cqba;N%B{CilNJK
z9D{6<M7%Hnc|8~)03O8;hh}Ig^6Yei(q08kO0M07YAFKQ7{O@B0F~!Fe5ibFq1-Wv
zaY#P1|Md0A;n6X)vP43<C0|At%`KyYHs+GjMKh#yctq!s(~+1iDizZ~GlxGN>>Y`K
zO;2?mp<QGN?Vz2{7TdWi^T~ocXh(_eqR$cC5zL72F8XBQ9kdb@-$mCH-{D4;3Gkw8
z2=JgC6uaGwUX8P}aXdhb6p<cY#Y{!I05#brwK4{W#gNRyWqCJlb-TFEP!--`CG>z)
zHOFYULdD5&#frh&?bi7$THPRS0DO!I0P^IQX@Z#v0C6OUF-&3u#GC7ahN9>R8S8FE
zPvDBjxToW|n`}|LDPc33*eD*O2fsBX3bd)`MP}vWCMx2QM#AY#C!^_v(Z$|}crfZG
zIo~d~0aIoDT&SjKN%~l#Z`kw_jct!Ch@&NPZHc=RKwe9D*CnAwn#~E?ZI!k4Tn{rt
zD{k~$0+hziF1_ivq{*|3IU0<IaJkUVq6I+{3XjfdX#nYu`k3C~B8{V^vx}wDPMXbA
zxLNYemt>bw*5#4*iOKi^Msw?2k`@gwvi=2<3$)i){1h&w?l}x`i5i}_|7J5igR3Xm
z#O?r$zv6gUEd=)}Jj9?iR3KX7j!VXixA*4$(`W6S^Q8NJH|wUoId%y)11((#o&FWw
z|B^KWqy35lPtF%M46~o0l|KLqwUHC(S`(l{Amey4PR@W$+rqh{=UgkI<EVN_bD5(8
z5v}Ap?L%`EMtC}y!gl~})e{}Z90!6?VF*}T;iaHS4gL&^AtU)6mgCh<bP@NbvLq*m
zyNB!1>l};qGjb+Tk%L(;|J~vu64VT-8}uFM9ZZ^%^RMU0BpXfE*I#6q9}A!CT=q5=
z7YA3-t^eM`E3YjQ{%A8=`d)izV(>1&!rw1#P|;U@$+gxBykhj6bF6C0DWkOiu#p(1
zng(>9!o<38R=VgjLit@{s7V-A8yZ9k@nbA!SWLip*hs_VgOTB$93H+v>I(RjbewU>
z_lp>a(+(nSSR`G+D$&AO+=kJ$u~kgLgNEFTQM3flF!}3Jw7F$|pn7;|IN*oymwuxG
z;~Ii1KQ=$<ZTJ3t*pUgpQ$O&{O=P3cG!yXfVdq~bv@}T9LIbdF-Scz;O9n5SnmCpF
zY#nPu_w7-yqlVJN?+v-yZqkK}mlCcR(Dl9SGLLGncAqx!4vZ)D2!$zA;_Gv2O^@0%
zsvkLRmwu4kpG-1pEyLB6rK7J6s~B9+DZn!B51c+(S~zOa;c@iyA{lf8CAYVZdnF)*
zCn={~bywMxKnCtuWKWPrfb&B)8yu#y94*PQ%w;T_`~B|W3GV4qFPkjYH|+7k8He*W
z%!bXllV^QE&MK=>I#C=3^g$djLSdiUd;TLe2NzqN&cOG3Kkg$fh7XeqtS;Rk%YqTK
zfIGruuF;24@02){WPBcv;AnTp7y+wCjr^Tb6Fffx!kAimPZ7k=;6muBeqJ4~z1n?7
zZ%6qWG`2)*Weyr~L%8$3E8v}onISxwQ}x$JFWS%cPIi#&#5TIqG49J!GpB!>r*YcH
z77J(hGU;%3P{x16#{+?)BF*R15y|VyI==P8-u5es1cLZsd4%tlk<?Qt1j*|cdwvOp
z!#8LpiQ82@b<ff!5N1H0Eq#|K$j;`QH<!4vm#@p(8%(9i+IQ=3-+tG+SN{$gFKc>n
z7PuF|-;CuBW<s27ez*f$oo2nwA&u?%(cw=gKltN18)ui3b6E@I1(3-(Jn)Mlg$r#0
z9+aX#0UPEQx&$2U%nn8schNl>2*44u{FtkWSZhQ?z~y6GuwKB;?Cq8;9hXdcf%W52
z?;RY!J}#+@)?L&5t1i9X0UI0|pVQ0)FiD#)b!du1>wiXTSEB@)A#`->_#ZEy9u{^k
zzZ!G^O>RgXXJPnV#BqCwss`TdM4g@IN82yk2iq@;3qK&V7`lzU6OH(^!$8qPJj}U6
z39%|Nj6`{y41*#iAf=)cbDRN^B$8&iWuNF{98Ap||KFUW{+oYRe_M)L{wgoohvql`
zc>HD#LAY`Vu73-FYn>OVmz>7a{zQq{a6M=~uMhryaQM>!#{Ss`P9A499ljrCm&3YV
zUCe-o>?fS~ix^`7VPwQ)*aKGdO06ked1tUnHCV25U^vkC3ivy~rN{=St)$h6hG_?{
z<T}x%!$=%08YD@ByL_7F=aelknOtH5hzD!UPD&IcwD9;L{ZP0UiO?)c#$(le9-k%=
zN0m}D1@tYoa0cr%Tjks#quq>F9}8XBOD@{OX}?cE20xbZ2dn`3T}92rDsksdbnBmo
z(dPe)mR}zKln$5c(XR~J_&8;b8t!`(D8pTyN1Z7k8N5Sa7oCpa?-IE<psY%XFoorU
z%O^ofiSC{pmJ{KZDNS?lv094aCgHuuH{3CjRI#S}Sq{n9n~5b#i8kWlm7KsF&%tZF
zV`02`g1BnJv^Pl!EP^R&rb}87fGY>3+j5LIqq`JW{_ci;BP))%hB4*{4iG=l_V|qC
zuGBtmJ3U@RTUxm5V+<$Htm?0@XkuUg<jLOQvyH{q_<DU&Sf)3E{NF`Sgh|?>Z?s5T
zcy7!u24l|mB9lZSTrIo^Tu3(C3bfC&1R(1*-3~%8xG%qLHY~oRGex|QBjRBLO-yuy
z@jCFF%EC%s%{;>GxlAz4WUkw!2n#jNQ)q-z*cKtKW^){0)<g4=2AoBbabp^c2}_mW
ztQ|9q5RT0{I8>22N9S2SSw~E6<Nif#a1UokpvNc}3HxXnfqQw9DGErTvnFB}^fbrF
z0nTD!E#1kR<tIp?rQKxfoz&7C6e5*K-eNOn$;32-;&E&VIakw$x*QA|Z@45|BPtMB
z6<4o~&l?4LN4JH9OjRpI6iysom|mfa;aP?zy7?pq`h1;Rmd!q&Oh)U=%Y!Q>Y|#LG
z{o55YUo5<TYA*@KjbJ@fgAuE&s9;q>OfFel>yD<f(wO>H16s2wsKp#i?CvG82aFXG
z#&ZngeC#B76AS~zf*6pchnh1+Tpi5&1Z}8O)lWNPJSFOQG?Z2+N4R5l5KjuUc8d1v
z>NQg6O)+4OVE9e<c-B~@lw~=dC?(+{3<{kh>~@#o)#)<yOJ^3q59U7oP;ZE~iDkm(
z_~Vu6%o%DnNN$NDOQu8APEzazOfJR8_m^oh#-vp0ND7OBQ^iP6_~tyjq=VDzam1g<
zMj%wYnWw$PP@}xENx}<_lcs}OL)90_Qr{z+SYM|x5sTP^DWAbuPf0-0bY&w9nr$9n
zTL#!VpA7noi-(MD2rQe;?sVXR`!Nm(<>y97g!qh$V<OkhC;0D{DlTCjB6&(k$lxvs
zL?U8ZZp4x`OCv{9Og<RdFA&&}crj0wa0`~AGa?4@dp&w1hu|GItmyG4Lp8b=Oje*s
zK4kzbaE-c=%?B&61>Ia4!$>9o&YMqoA~;H5pK(t~oe9^uI!%gljWFn^5&Ymlhw4Od
zoA5(fu{`OeV`y~;Dc``=rw$U~V6Flb#^O<e@PZ)rd>jL@5|7i#)w&+AfV28=X_V@z
zOTQ1iVqcAAXccvfiw2q|WmP$y4!g|P6|1OsT;AUqUg^rt=(uxdi-$zbM99j><Vf-0
ze3Ya$qE};TPGB1FImt4LWz8$WMTqStJyh{i)w2s9`|GN&;Lgjt<8(B!6%SmEB{AV@
zyU&W{ktHhW=J?0w#qzEg+$pcON=ujtJraHrF*CQ}OOLHKY*BT20}9;D=M^g9;35Lv
z?W_;LYu_7!-(iXQ9BAm2(PWdd6+jUh0fV<UqdY3Bf_uYT<Jak(mezrd@k-|xXI0zc
z!%AA(_VfKh+d%S_l{Unxq7s;ZR57IR(oy6eM)#>NF8+Y`<tw=(U5pObUJf{)NNWD<
zGALnsSCoX;2FY1m=OpajG3C0<)a0SM@=6d6$>>8pi2@ZSWOZg&3Uy&BIlTa-aoOh4
zdcAPZXsKeF?~OBzYkL;!+hw2hY>|GZGE{aEpYCWum!>!}XEi6;B<^FlVCc{7o!&(J
zM(Iu9Y#|EtR@F$;a<7fybkG5E19v<jEvDNLS05zt&>4ZQj&Fh^fQcD3sS6%MxK~Nr
zqi@M$q*hSXl%W_1DIs7&v6yu=e!KF{R6nH~IUB;&2rc}8gbWw&BpBZcp5Eid(bZck
zE03gsq<0o-03TO3uqq7<;t###Y@8%|0xx6qvj<8VaMm&$xU-BBG*gR6&Eepzsi-T7
zw6Qi)eTGkvbi~x8q@foL9nVgqMO8;2gdF27nu8Zq6R>1oghe7KBFBtXzgFJ@q}S>=
zhs!Ln`;Cr)!+QQ>gfFnTp0e6Jq_VrH!_+liVkkB4MLHZdSCmwPm4aoAQ4M8CaGJ(g
zw4cQ96{nkx^E%Va7ipe$m}3M4NJeb-q>tFFjbfSc7%Y{iJ68&J-Lsc$kDrh}wY>7;
z%QWu-cODOuY--LlTw|M0n5rU+5E8+yV_0jXx3=CiTCEoHvu|&`+CKS#_R!KP5>ZB%
zoT5!~?=nMrc8akU@KvrB9~cPdL$)6SWDCw@jYQvRmHAPgAZdvN3mxt~OX>KdC>?on
zN;~=T)$ab0YU7onba}I~@l`9@wYbN(w|+Q$xhEQLyA{-NMy3^7E^jSzYcUp$1&U%h
z$(9oe_4Af$JoG8ILUAom=4_71$5JyC-6oP@b2hoF>`a1|C@7MKwmReN5}2(;+w9|u
zw2xx=yJr`77t0Mw=Ilq=ljNR3iQ!%2sCAE;Y~5qCl8R1!E0#G2u@mZ-TkK59jx^#1
z7hQvtvt$AwJZ~?xSHNcD_SdaN^~hy}W^T1sU-V5rKB2o;J9cL_UG4O==t_e~-AgjH
z)wKr?mp}KExXpdqA))bl4e4HxmUZ7nTTzRr(Sn!Wc<eVNgL#&)NJq;#?d!9TX1}nk
zasMh$wHfiStSu^tncP!S+S3qlm0F8?htDW9;ItD7rY)0cs~OaQFDHInhn(>2RqBf<
z_8>*p$gN?7GoIl}ebI`{psm>*WA;V58sNXD$Ga+KMNiuiZ-}HwGk>^9k}2J?w_aqq
z1XZ^0kJh5rARQc{q0TrSPOdiS*r6(!n)7XW;gRETzgRTnb=H?O2DGfGcNpZDODI22
zPbVAjh>SO*<CERJqoZgE-@YBbMOCx+%2qp|D#fq)cKB@jWcx(~KMs%9BW`F(%pv}T
z>cUt+3e%XNvM2eFPHL+XArgj(@%w6Z8s|+UpQfW|G8i?r)`5WS9Bn>0h%RN@Lcp4i
zT2$vJG+1Y;orp34vaVQ7i3U(eP!nNt$zpe4qNpCF^s3ca-YF@(>PCnHBsdAIXrm~y
zDt32k0QA!OI*bqph&mopj=^uayl>rV!9!X|uk0u<6t#<C0HwB+<&b~y>UjV8uXpzk
zPVRn$M{n=s0I<9g8;dlD9W)wYd6$w{E+Zxpt_B%k<H=z9;)iWAIZ-+?{SrfB5v8OC
zVIC{uh~BubP>NZsfF~0*V0XReMo?C)!&0&0b0hi+yd&Z&)RvO=;o2|xgPw2<M8B31
zQH5G0wc^r}_na@R&>JPRDYgZddGVnLvWhQ|yeU3KDNga}DAXNFVgiFmLr+l-Q+$fI
zPGIjfLklmz_3PN|Dpp2D)St4&kV=tNuZU(ju?v6miD?W#nJ|4?&FZ{lvME%JxVpgX
z4eu6M8D^vctqI>0?1+Ws@ajPTaDx!*ik6DwaK%T(_pZRG?0tECR}>TgM@RS*8lSCr
z2*8pp?FpPrOO8`~Yl&%sEwkt}ba>I_AUGezSgQ6M^ShyPltRrf86!@a5CLMdb4BbY
zai6VXn{=i2606;9^iE2|=+)L7e`jjb-V-`$qdAXN`xzlXrk_~Rc9IN62XG%?=eOl1
zf=4VF);J&Lb2UnAZTuxqu9vU`17#9?HM61&Z2+ML+oTe)*BwpucRV8c2V1(Ca(eH~
zgrw6pHpwR>V$xx6Fq&LZPb6Xkl3OfrmT=V1lZlAbYNV37v1Dk^%`M=j-J8tQEHBA5
zrfYds<h5T5w%YE;uLZCD8l<Yrm&$73Yrl%ppQTH|D)QQ|r4(g(xE8$fYglS9s#L5Y
zul<Vp7M8W}D(ct84&he6QMwlNIxsD!62g7y*M%|SVJPp5Ui)>B6sQ0rd|dztMJ9xY
zr(YMB0vPFXu)x=T6=8?-5{Tv31z2LjqYTXDwO{M(!hv$X*4c$$fe98<$*aJx{YpU0
zR2?RGU08x_QdI+9`!z;+<xEC}sRMyj)djpREb+xzRSkGuSl+a<4|wg@0HUj^2E6ub
zSeNXLz~Q!D`!$Vff)S8cQ@;+?(<+72rBFTfx&S`5HlkS7e(hH^dWhg?_3HwDAo*Ed
z2C?+IfFD@LP<8_C{7u$Ih-j{)62C6M6e$(bveD6Nzm6tN!xw;lU4Sjt2$T(wUl(>v
zGyx^Ijl3=brKViNK&fAcYYI(zqW~e!>%tXc=-p7S*6VQ1(q5g{g)P)n@{JH+n%4y+
zXOqvxPMy~U2sM;*XsXuh!bN7N>QGJVb>ReRiaR(_^SU@#Q~;G8L3a5nT+w;;6&<)Y
zk+3hP1n9L_=VtVJUb=ogFhC*f>HG!;D6dtY_2{?XSjJXc+8<s3$=ws}cP+0kDH44b
zXmR61h&GMAc-&J8EtFqrz11S6)~I;|FpJle?5-%&6RF$^{rI?8Y(!dj+i?ZBWi8!A
z#fp-_FN@TFSqVkR#%!EW+9quR*<=GI6qpu=B7zoJH(x5_K9U~PkgEhq<>IGOq19^P
zts{bxnUl9FTUKggP==`Dyll??zJNz5V;?ABbM~dLRsAha6NhC4`p7{3^h#SHu=TLm
zqb!Tjh_cLBsuw27*6+acDVw;Ibh9XWhG*!izgZlV*@?i2c_Tto(fbg1$=je_&}Ps=
z%OHvqmz;4td(^}fW^yIdR<m|n+>|)_6+pIHwps}NYL)1FXpu-r8JMY&QmU6V|3oCe
z081Tx7p+9=IPXw7IZktw)N)LiaIvH-)(kuqxn|%E3N{0eQL-6$JPK|*$~FU!QH&WH
zVHzxr;?3aEGcv0pVDY}q4_8>;gCyB{3y|<}le8>{uTRL8<|f*t^KbS>m`tu35seBB
z*nGR)>RD*~rPHp2q0W>mxfk$CQ)51w4qwB~c!D>hx(sfjC602hVd<2)Bvx%K^3?cX
z(T%3WQL*^Ma5y7Ja&)FedEd)3k|jY6N5FMtt232I3u6Gq%JHjK6uOb`08sRGne+GC
zN6&wRU3PY8KNq`>*GDgEx3I*Um3Q^Jznn#>oxS?p(6Kf^lqON2H&>fjr>#~?H|?*J
z=hH@>qL*pEkM09`G7$x@Hk|goO@aX6&&%Au;nAr{h{|qwcfvl!Y9DUUTlCLIq}1tC
zO5@sHv6H@w<kSp_k$mnd`vJcWKNZ+S9V;SUM($DVeR7qXuFZ<ec~<4RWL%(wQTf2M
zRL3Q{rJDIws(m!)Nc5b}2GR1jTI|w@99}$Tkh2NI-IULfLMrwq2}V%>RZa)pw9JTc
z^>aP)Ci^=~vS>UVM#DjbQPz@4x2`Qhw3l}gzDTh=*N`b>hZ$|+UY(!O+-EHuql#DL
z*Jr<8*1l945iJtvkf|qv&ndi!RG$Vn@bk_87Y&wct$X#i-`C!(H2?PQe!ceF+hurg
zYdJC?M)!Y=7KV6)Z|O6P&xg}NTizjByR~M&B;N#h_&_~GpswMYlt@wh`^0SnpWVN2
z`UU_W%5wWyv=J@cN?U4V)R|gp1<Kw9QqdGGNWJ_z@vw=$O*tcphim=jT^z}p{Uvm4
zJ59&A@p-dcrfhFM)RUuWwS57+9WK@FGfQ+EW9e52RP~Jj*pdy+D+Wr`z0}-Od1DrO
zBv)`WO3nl|0=-VGFr&so_>h{_ecifC$7l;mVOShlK2iyp;CJIAi`FOT<ls5Z=A(W(
z0rcCr+X!pa?fVrI1Oqut*Xy!<jj-2@_Ccez(SdeM5fi9ByYzA(G4kgmSF7d06+1>^
z$XNIR|F-hXI(s#HylU_B-<I#+`t3J9(qdrpjJyN4hduU{5QCW7E#<rz-BOb9=oa*X
ze^{DVhgJB#Ewg-{Oq9JjdIrFJq`r{v{BAQk!M_5kx({!urbEo$m0(hKvQMFSWbj~s
zxaF3)%egoZRYP6)*%<YAHEYOT7i2;GU6E2_B{|@iyLUCWVtS%ldenu+9SES7Y^=$a
z(}6xyW%nQMl<UpeE4O93#Wm-A)SJ=X2l9VIgZrwbIZ7yUruI6+n~o(9y#Uk4ao;GG
z3t0zI69joy{5Z5Nip9N#1AqZ#n{yZ^VWYdGfyLpDssA2rEPgAWdEEj!70%MSeCgW3
zNK&wI@JF{J9nd1t`WXMg&1gse2$bjB56_3};*Bup;M{Npx=JHpYRMA&)YQSkQ8(;?
zHA=~|5G`XLb?M~=3zTYn0L>Au?um44(Mm;E$p4tGZnBwvK2_nZ7+io6OGr^oN#@Tv
zy3mAiS!OxJQ42Ma9}XyDSk5(Ue*kEU;Rva%%S6T6(A6o$_5_XjB{VKxWB{(l54R^|
z&Ip#>X*%v-##eb=i7RQQjIVB3JSTosZbiakxAXPrHju<Q+=T@~TW6xx$nv{r38+W)
zb17N}=B!?*_j*Xd6J!AOMua>g@QWT@A-j75yI`M>z^*n|D|QjR{9Sk{Fj`fJhwjz#
z*0lu2>tjbfuQ7_Un=rHzHpT}fo7fk*b0L`#g#en@(B43Agl8A_OXAU=|5#I|A*!Tp
zde}g{DeN0=-iEFjnmr423hnRF<C%S6G^;r}xlB544|LZK&^U2M5BbHJ-8hZyr=(NE
z+Rk&1EUMz)z{x}QXF#UG=Q>`pwnoiPPo28xV-CzgAA$Y~tCGp7xFP5W1lnSnBp)rO
zg#)w-?)TxsxlHc%h%N;@LX*t6d{k4>oiCjOb(3%fCVhoVh*Fy}+A$5FxBX;-UcJa*
zHnb_MxWt=wWW48b&TiV!PCtu#XlF|#v_0fr(ocYLmSxvQMZaQ?AMKUJy`((5bw{|R
zK6yV$M$w}U=ONJh>F|AVmmI}{hL}bFn|H<{W7%u!S;8k%^`p;_?wechW!6io=|wt+
z4%PV*7DvpQ*}~Z}EbC_de$t&davN=;_`Svi#N8;hg3~}YYSS)l(q`413!ErQVem2X
zwFJIF05p0Q*j)4&%X4;^XTPnCx4Bw=U?I`GcJKIPcmJTyA={8x;W!Wj3TH9w>2b()
zNqhkXub`$_9%vDg#6FQbnH|PuQG642Ick7%rP8w|%Wslpo#UOT`cx+0WC9u#Y$;Mo
zxK54*`RhkbEyg{LMxpk7ly;e`>SL%-q}O$zCl*ao%p~LvHmSD0U~Jqz%0{)&7S}b^
zW?+IEYi|82Pd@4r-Q0fL&Gj3EN9z^-{K&hrkNX^VP*jDz>ww3!O&m#y10Jy6#$A+`
z$@nZ$n{K^o=$>TNKdMdH?m2N96!F?X=!!3ZQ$*>Qf;J_$2`!5)bG5}TBbHW$>)3J?
z9N=2jj&M^N9a!rRlkhn?nem#nD^^X~7p&EVWrAOJ>27Y7yw2*bxy!4O6)&_7{z0bp
z1m}9Fu(mp^YVlxG1&24o<r0hi^3`%1P+}0XXlg)#mBR|fg$pj5Dr#13?lqID&XOtR
z8zWwYBb@V}Z!DI`qe3!lRY?hb^iX*CW<Wu?Y>BL^s?nmvl%oRIx_R11O?-V_j{j5z
zF!zG;u;9Xmkky7X#F2SX^2DzB249*waH(;q^@(+w6S-dcSJF~Sk=KDCLa!MlqyR%I
zcYnk@EQ4%C6w5e9e=T4+P=Q55=WuYE(H>!X;X!hqUAFx75td)CkX*!ip_Fj(hGtWI
zTP;mCyYiv(d*0F6>1GB0ahm{bAzUSX2(=u;t^69@ilZl}m*~KLqSB#u`&Yl2j}}qy
zbXS-~bmxvm5EToMX7}D*&p1MPMr>+Xmrb0RF}I7Cks9K!QpBS8{FQXus1URTNHN?%
zhj!EC-$xZLZ;u2nuQHVCNu)fcx;RE7(4`p#@F5>tAZU9D23W@R1VWp^lZbT`?xXJ?
zrSt*Zki*U1(lIpocP<Jm;_>ldFh!nErl+S&<@fs%jF)V5_*g758Noq()a{Bxxdf`1
zsB!X+o9Ln9^LUJ5TaX)20mc?@vV>YCTNo0@K$KJ_fvd)`q*#fWA~^-FBTYCaG=+2~
zA4$rp(xc?udSEYcBG2GPCIBGCGu#Ozb%p<7KL_1-)XKBgn!YE*O>>2`h^COpzGz;m
zUrXeky(clVgTthyRflvYCRIBwp3+4CazKs0Z@DhgEoGb;1@>+NFNrRaOVOPr-eT4D
zm?K+ZV23kWT7?>TXKTmjNx#1bG{`8aegFJNij6F$O-uEt1ubrw0F`T7cUG75VY#Uy
zd&uVWvT28?*8H5DD01yHK^ZSl#B-s{rdra%c0bP=5iJ7%;xLPWgpd1aOmNakP+BDJ
zj}bblz)YYGgD6KPCK9s>Bpd>A>I~zo43Z)CmA9-LV;y*tt4?CAkQN$okb8R!XsqO*
zc54R6UXV|Qf@r)LFu>=P){08Z`!i8&mM=IPz4~UZ9H`nF&r(AGqHeQ>Ed+?r1$hXQ
zv&P$G6F%7$6C#;d1qz>^ViYCXKOV8;>>3!i8l^vQf*bLtt(v!<WnktqQG0gQ31KnI
z*F7bnadYtV;^@rCeo8v!!*accUt|)oUg8rI2(K?MFLOm&Ksl}dcZyH`FGZN$jmMW9
zVpi?*arE;#Y-ciLMvzk>h?yj+i8$I2p=S&uMJL69$t9ik3|ld)zY*qCk1>J4d$hgE
zPEmsSVI#u3h{CU=U8FBjijg;1=A+~Ji<l*6$K~4bBpZ>20QcdPS{o*<I=%b}&J#xC
z$tUXIX_->)i<?Bj@O|8;h_^K4rDdQXm+k1y%V$Fvb@TG_vMEi8R5wucL#WspxyLuV
z=Rgi7>fvb$%bR_mpR`&w;nM*I4cfJ}2D09_ItGMX*^pUlixP0bW=CT!l2KW4KUxGb
z1{VKrqUwL$qv8(mcoK7nz`IVI|0O&v+&vu|L=txeON7pvRX2FxgbuPKRTPvFuYHx?
z#EKy73AAWEZv93kLt4Qhf|}{DGbNgxDVl(B8EH^6Ac88XI}(c-EvmanKP7$20|J)^
z`@`ShSfAvv$F6^O@%!DD!UGhInFyB`6zdT)#of&<@++orrZ@v^IhPb8=y{lDM%)mw
zW!?UPMLXXpkV7?_v{v+YashPLuOdeS5_3FQUsvP#SdVN*8i^v9`Y^fl%0+j1x_24I
zf%k$dr>44qWo;w1jn$i5ij1n=t#PG#bhmC>gK@FA*8}1L!wNxdGC*2>d%UcuY9e;5
z-QQtR_ni9&f7=dsfYL7s@Ib<8(qvsG6kIrVBZw-YI&3klm{Nrm1+MzYSwyy)y1huN
zW*jao>D5`%A{Jc5C$!C5>KV)JPNN%ov7wZDnJ>Q`FE5{&gdsPXD3fd|O$^76N1Dx&
z$&z9Uh~Is_xTxwL;~a9zb3+~kEMg_5p_5Q{ObYQD*cL_FkZ1y0Y1>xmz5(3E;-7Yt
z^-^HKBeVlhhVQgJMT2{9vi1!?(cn)2LBTp+W@w6)!*vf6bCa}LBLN)UBJK<KFppMU
z4E`P!4-})0!bq>kTM}Bt`TN97#zUO4s&bdizqm3og$o5d)nhA3jaoAbokB5@0V|(Q
zF)dIuSY8Hfm&AEWfmB@ahS@$pK+BR%!zlLzu0B})=iB@qPIS4z+ZBo-F4o1YHTeOa
zzvK{VHHThOY#mA7fR!JUXdg)#^7>HJceBaAfv%yHpBbTYI2%i9eU=tKH)@BD&QTK1
z<MSeO=-4ODdev~8zX6F?uf6TvtK*Z_y}Dk(pslsOJt#9%KOLk*(cM}@LG98KD%nZ0
zvQ|gy`xUE#-1r;%0UONl@0xnuP|pz($=cD{$Za@QwObGBR;xz*^9sXK<;F%xL3Y^*
zSXwfDnL%CG1g63WW<E2RPcVd;-}J!Rr4qn5(4e6c;o!|bqqoC%VPLSqcy+!-m}LiL
z?~%1CDq@gja!TaUtyOUcvFHq|><qoT9=~fp88nP&n1<`s18`~iny%JB`aCj<{=k^-
z-&f<9u|+jBHuw%P0-e?SW_xh8FmyYfMU8P+kwAo_MT13$_9bP+Qp7K-U*n{%{dH2W
zZ31Ri7x#1KspWga2Zzwb@>O<t)vT@TYSf*M$CeI;>`%HJd<j`KOn{h8F<s3B*ChW7
zKIS(>lzo{A6t%O9-{83aCI(Oy7rP-NDhP?PAYY=5Wb}gB2SaXJ)PwI%Bz07B!caXu
zgp#_1&O#M=fU6ElrR_tj;4+Bkhzi%hXn!EQYZj>V<4@;5?NEFL!^29m!|NCwMt3X^
zlevrzuWfQTs|(NMP|ODBu{JE&uvStd)kx-+&yndeE`Rr$!(u7kcb(+Ww%p8a0A+^A
z(Yi-MOGY_Fgo@<n$VctN;=eOmdFQbT%jZ1QQTOEO;^&=p&tA$NrPekmb7sq!*|S3C
zDSNia?8Nn%UK7Sw!der(!ezc9SXvEz`;;6rv7YFv@7~Vu%3M(U0RPr*ue4TAZ{M!_
zhT6A^p=|Wbt)ZBihl{$4<W#-4y0X$*sYlBW^tkTLpYH}zK(zee6Bd#xl4SlGs~CvW
zqu0hB$+gzeF5xy)xu)hk-_n5ou^`~LWHPki4$gS;Wba`2@YxT0FJ5gd+R6ioxJ)Ac
zMG<vTkdw0u`X_orJO3_vBSFVk&DXVeG9gO6Krz!(;PImK6q-l>F8m=Gb#TGGv)+oL
zpIB!s&0q!$?Q+>b!QEv}@*_@{u4DbW^_9~bSshAC9PVjJx7I-EtBSyWp6CX#3sPmX
z?Cm_Gl;z1-SxRGB)z&yULpPx)`7pvz6sTNQDbZp#$E3=|i9SQBA@m%g+-7jq@V|4d
z><jdZL%lItefLzfdUcRsJ+89p*w%(ACw5$KLLbu5a|{}OktUZdPt90tAgF7^&q;>)
zOowNQqnjit_gOOGh&jsP<ZuXMA5K3s$km)o(`G9tl@hgO8bLL0!|wJO1(l9~y3e{P
zyXkr=-bG1__eM5FlKjpA!o{pkTB&wPu)&cuIorjO+x(Jj?zOu%IS4+pe`+m7!zNoh
z8b$w*bn4wc8Z*OsS$W3D;sn9MxCeAIIHmar1Dd0Gi(#Z_Wl??oh7#D7PYTMct;|#E
z!8bEY>Ak^@dBoYcM{3H>RYbJ1It?794u$&`aZC>l#mcGol#M(Z$+jr-W2}+_rFgoM
z9MKd70FUlM$9Ef+_XG~)@7Bhshzf*CYIc4|e5CBRu-58I9hXq#2iFHrFJag<V56Zi
ztV)tVCPRz{CF2Zjua@N5-vLvJ=uHhrCDF?5)NX{5VJ(N5Nu{Vf+!~RU?4HE_q`jp+
zDWX-A^Rfu&!&B5y;9mZ77vAj+Rg$j7#b*?DpD!v#KAiqs-vN;<UW6IG8yeShvRS-i
z6tYf-iyBXhZ>LFenS>C2N-^Rou_2mGaX*Wc(L7-nKY<2*gY$bf9g~?J=PBr6bUn!+
zt8L;V^3I`Dn-X|HWuVN{0TdZi2Ff||Pj*LBMGB8O@8mqS&}q=Cwy3EEAT)@32=MNj
zhmhziK~8{!wK!~me)RnZ<#S$Jj_xlvxFyG;<W?NjzW?C3pvD|w;h(i;^S5T5P=aBc
zf?CFcyu)n*FhWTKtmG-J-gIO@nrMt#n^Dasfmw;O^c(v}Mr6-X5{!qJjT_L6NT_~n
z>q-km_tH{WGq|rvVT+>b5`~3lz)9wGSDI7CDjy9MS`hA72D*|%lI(9SLlnhITNXLA
zwhqj&O3Vc#<`<N$oXM-uq83_M$4R_kJk!YEKy9C*pEdC;o>Ok}X!MbRb-=rYqXbF1
z${Ht7uXA=mu`xrsl^JVjM;MV^Y(-76z&aD-%Nqh`4yhPv7#h9mCu{^(`*$+V>QRkL
zG%=Su{L;brYP@qzIL&F+t4ncB?&I)lcVFCt8*7FBd!W9+f2;aCi-l~nt@j)Z2kp|e
zuZFD(QEZob+uZu~*87i|JNq63wB_bFza8Rnes5`bZr$V}TaM)yr<@;gL=!1--vl(e
zNvhA&ECa@9?cTiyYju@Zo~$~@NuRQCMVFKrkSrC(Dbc>2Y%<9Px|s)Su%#1DGnYYc
z57wGwKA_g04ZaoKSy)S%{+(#$!!!9bSS!mf)abM{sMrF}GSC9Quv(BNoPaaaexG9C
zp>Z89l5e_C?>4Q18~U}p`+rfsyz*h?-tsb;ejztBLeExAB1e?o3ef5ZOo_=ohx^v2
zT)s7G1wFG?AG<!C9)gj8mMZhDiJ7r(4Ne;<@CRjO=J!WuV*Tv0Et5lUl*yP!(ukVh
z){WWT8HKX~!uwlFF%9g(ICq*kPtVRv+F5<vh^Q@Y26NG5(2k^^_8Ti~EEK8TUHNbq
zk+K?W-F>V(_oaoFr3+&tJGZgp52+DN!Ixd5n-Y;+i2!e81zqB-33enjyx$sc{<-|_
z{;h_X1S!fW!Av_G?|=zp?H!rJzvs?i+JkufJ|V!oV_5^<Z8n?H-G*1Hp$%6Y?-v}X
zXXkR4vGe9#78sqGnz*21H^%W^x==(cPRYLr@tgJ%v+-M=po`hv=<bHy5o{oN81X|2
zVn&8)CZoB|9YnWIL)@x3zZx^FDS9`PGaiL>Kpl7svk)d%>@T2`P}j(gDH#u7b`y+7
z1`JNKshiBD1)wmKvlv6AdYv=&($S#)1@l?kz`surxBg1&@R1(e-;5skW_7p%vRKWn
zH@E)vPOH~tX`0Quwiugh*$Zzr_paIz7Y1dcwWQVc<0R`(v;jbR)CdiK*xP>f1%NX0
zM<GC2)CUyC!#OR?h@KxE{&e!gA3G)!pV^FS=kVZU@8AST`maAWG~m2BbC9FyUAAnz
zg$&33i@mQqumFZ}i<Y365)XaL<tIHgk^h{e&<$kKMnH=6rh^d;RySj-G}y+P4=6et
z)Q*pKU@%Y0x>njM!DUaN_*UV-w(aBC?Pqy{&4zqpD0kp8r9C8bYipI28xKi+x)Vv6
zhzV)klz@oZ5^3&|ZSfPfnS{$b0mS8#!8M|m#fypj`?H+#(po{Z$lw+;%b<L=nGA`R
z<3%Lo8B@3&5gX$os~C}h`_Qy{=hbVa0jNuJh(n*HAJFP38E>no!L@orq9JhHGUD!?
zjEA^?oXD?7f&m#E$~l26e~)hT7YT1*FHO)z$t<bJ&{4)lWGTUdw|um$R7n#*H@RSp
z*>sx1X;?7hFdA6Cu)>bk!=WR{x{!g+kPc|wHj7#i<+Jn5Q8hbn9E(LmN|eV&!{$}E
zfS>4EvnPzMvYo5%)CgVEXXM4da|W}{!_{4iw7Q*}v~+5aI!L$2@`!it^JGGfrL|k+
zhh8UNUH4&3!6kw9@4}X$8?Qyb%17}}W{56{fjQSqqoQJeZ|n4(0*>-s6>}ze9|?ZT
z28lBh-g<ACF80pU3N~iiY+nMY;=G6Jf8`xHL6Y-||87-N2A&dK$LO{h1U)FHL7xmZ
zT;eIkr=qp)dZDV6R`2$=d35`+{I9+T0#+Hdryr8)RWj}-$a|e?yN0q7)_Rwf)%|o!
zTj`e7#l>)JCK+6n#eni&sM$viIcPLP6v&33zEP^+f*m89W$bcJuE!WvObIj*D~*#;
zLIkLl2b0CQ&<0bMtVGC34u39Mu89t{i2-RCzmggaJ@Js&W{EnqVZsRXuUe9Tn-mhL
z(;@|&3b!;-@k(M8h$8MAM=`YU%QPM%HISWB%hREn1LkK1W(Zon^&Sao7{e{}*NG))
z8$4Ww-&35*C{9INB^Q_kVM2K=!4~Tjv_yLY(a(q@Z{rvAEP`gJIUFg^uSE!UM~`Rc
zxh3bS;iwukByt!X8E*g*iS|A)k{jXaf<h!vxk-04B{YQ<2Ly$PrGc38BIR7sD2VO>
zYkEFKmsZ;k9A)Xba(Ys%`vrPrJ+Wwhk%led=r-}SqT&@rr%59iVLe!jU)l8xxgoJ#
zD7Z3D8g&3Hw-Gf9Z6vzbi%J(tNxTPM6RQbCsqh-n)_p4ngI+RRL8!D*Hpa-FpmRwg
zp@Ec%&L$qSAPGR^ZVpfjBP5E168$QuXqgMuoG*2&Dy!^*3=>a`{JyPzw<lSf_7P)-
z=$FI5tHlDY4a8@(?X`9P1qVFL(tu=+qqae4zN_n#5s|;EcI!)bI4Hg5{D`F8c@7lq
zmM+I6EaU8G=Xq3HqVTWzdh`PvVahyQ@ExVysL^5j73f>Ohyph)eso|Bx{}nj%s+nn
zEnG(-U97YAP9k#f_mW<CD9g1s|6G4}zrJ33+rxj~{4>I+&d^)ry=mRA*T2(Vc)`z`
zTW!DvtMGq$w;Y#Tz$qk#W!WRX#$$kAbj%!DM0A<{q(P(Dgxg5QZ861>Uwt-UR`2Ap
zur4%yl{nQBr&^+`!K_r?3$p&l<$(Vm!2gfn|HttEH<7WJ^uylZk(59Q)^*lU+?Vn?
zvV<<lc-a~ri`Y!U4!X!1&?JH*L#?u%xJhZD&&hEt9!g3e)v4HwXm|4-%MA$^t2nUs
zDe&)!+R|x%so^d7+c1i7jGIat8!iQQ2pcS-6-zd+T_Yd+)K<8gt~Kanu0hXgZ@5$h
zk?L`~xP^|wrW_9&^8A?Ib|o9I<!Bka<XjcD<{d!~!3+P_DtJqAR`3)s7lvh(uCELU
z-}V_?825r+l=-#UFdO?~{^8p9ztV_4I<ip~(@y9zBo>9NH+$1@@)UjHDZ~w#*%QWY
zI771do9y%yje#ic7XrZXw4-XRzGEK_`1;_TN!Fmprd0OKu|2&a8cR_J_V{e>hQ^L=
z`AYKdltjcS%`(fgVO2|py?H7bUI_C$Boek^%;|K|QoylX14>frT0Jq52K}JMz+M<N
zgoZr{qd~B=K2i(*)U2Wnwcxr+I8gu(pqL`Sp#u%{;R;~$AM36j$OG`C_e_ql0~kD_
zISlUcIx$W&MSJx5T5wjwT2K?bQ+>$!S^qZIvbV<j!>*{pN;Ns`e{8M<VrnqnKADY7
z2^_?L1lh9n#hcRA8#7wysiBQ%8f5pxgmZ)J`^Hm2ki_z-8t<T`z1CT)VOm^T`S9(^
z<L<);Jq$Rre41s;op{{pcH!sh1GscC8zjDxat~LQ-VwU8HqzE-pZT~)A8FS*+&*-!
zir<_o7g1%Me~~n7lfF_iKt%SxF3F1}9q+O`KxYd(Xojkc(RFqxeh^K!*;lcIn#j4L
z?5zo_7YJ;vKNyt=$KI4B-CX%#O=ecbY-HC{Q(Y1*6+sM9%7;(?d-wIrR~P~aC-d79
z$(AI81wLAjZrxD#5GvQ9$tlNq(Gf#!a$K9(7&w8)%~kz4CWpi~=+$NZC)A|`%rYb`
zWd1Ud5wK$SJR2EGWAGdM!mhu~H35pA55L)Q*Iy_zD7u)Pv!aSb(G#@-TkB8EytkBK
zE8yrFc?+b{s%Wlvu>8;HKILqQo2NKD-_6U*Y{=tlHc4&X6gjxke8Y;MzB^*{T147E
zBp>#u2D|*3_wPN79>(Rgsen}<zGIOejqR9XE+lNZsRn{rA9HVzABBZI?1m6JZoRi$
za~t+r32m+bTHkr2X?|W4;B0V1POws?l@Q>fcfz1cEiuJ8AvGz53r<bS7SwTJ*jlmr
zG+<zb9ByLb5NJVy*r0VxqNH7Mj;4F8i}8a2=k+KPVGx3BzIc;Ukf6ff<QlBeGeC~J
zd)vED_x7GG)zRoYVKYCH`XLzzm8~GiJQU^?6s?FoJ55ulKWas!^fxJk?0B*yHULVW
zOwot|T$zg!X$j4e%wTbn6SaCR-%P-m=;6rPFd`M&xgD@fA{)OKI%FZQT^?bmRtihU
z5)uHy7KVL<abaH6oHJM<mKt@%^SLI`p|NH<Bu*XEZQyv-RYKukf7Ljh1H3XKb4gO9
z`JRM_uaOlOBMTRUwLTePX>ltt(QiAol@A6byzMNf7LP;+fal$CPqY&u7-=Rh^`^P{
zP8+3#a`BDO_>a1`Pm;?kxEoc7)jP6+qPnV{$_T37(vP~4nwphIj3hE*f<^Gk$bw}k
z@|@5fJ~s?k%~3&&x}sx%TW{&R@0L{LJi~V_vJ4a<htj8NKE1=~0twKC3;5Mwm17){
zqC44hFRqhlDDb9JcMJj9D88v|?`Lv(SdbVTbLhk=-Sw?2>dZcu-_t$&FC<)nM_4gt
z+>GAdW2v3))FL00fRP;J^=@wi)k<y`S#&v0Cr%m^Bx<c7rdpw^o1Ni2i9IRKyuxLY
z0^ShObh1Yj(-wEIRQJ{4O2WzSg@RIt&<`*dIqQN=+rm=y?gtp7?CB3=jahR=FsfW_
z=}9lWfXfaDgUz=~{p1Xgz}uy*+xe5uc*}M~e6kD$w?es9)cH3jxiV{tg%a{fqQl>O
zC3apz+#kryt8@AZEcWju1Nh&>&MUyWzbOO-p~sp7wzC-f`5E{UM%^ugD8qZi2k^@?
z@*#XEbOEi(RzWWvLK@GqY+{gxqK5rJs~k0U@KKL02v<~TQ=E$G2E|LMfWPd!^2w9C
zdxy{NZY)08J={6@$E&>vC%d)yME!vp@Mn@vfYN$J1}<_pK3V36i%-aGoh*1Zm(b*7
zxtr%pTZ^5n$MVfnpx~RQ@gVJAt;0DT=FL1Ar>A)Dp0An`sKH&2R$Gq}G7K2R<Fj<w
zWDD-~=;7!CR%kI=E!JA2YFGeq3cl`U{cOA*-Hho&?}pi^>=lrKc#BP9NffAxbm>Dy
zSe%K;(Cq>%^x*;+9(^pYr{f&ok1|ry+3(lSvkTb;6G^nG+DqsoQ@KcVdscU+lrARJ
zgVdP22lPO5TmSak6}m&j%XA%$z^Lq#W!h)lZw@+bZTP?9i<qCnzH8kM8$`7y+1VK;
z>&yo=(NbQ-z;t1pYC58Hxx*X0g_urnk&aNkOIlpEE_Kj`w`Ho+5#e$$^Syq8p1w|5
z^H`HOszp9pI3AAW!_QktgB+(FOloNe5G--$4i;?D9Z&bwCQwfB#EO`L?`fr4%IA5L
z>iQ3%BH5HJp;Hg}^zcu8u#=YL%G_mVLW4o%?4HIjb@#x-Ceb#)E-lN^#bda&2!}j?
z4;VFt@xd}zgmwrMcnz@3&Cs}>(~dkqUhK~D9k`k|me0KBPnPch=U;fdwS4DHJyz~I
z6Y>nO#Hxzh?ZN7>j7a1H!XKkq0h_rDugHq=@*D`)d=z(4N`R*P!2e)0<|sNuGU77L
zF_ONt-CS*nSG{T9=xK%yB`yM^+S~kI{q3<IxkH&=tQO5Nr9{&Nz^6R##8ENp&y<;n
zKXNu8N4^5{HZ^R~Y^_cSJSH*Pge=~)r8{h@8XK2Fc$fAPwjCjZbj?-4T0G^PVrZ-5
zxFEBff}?4xjJdShrd472<m6xCG9zUs4M5w+T<v8%I>{90Nw%S6Kr2ErX^-Z>;u~e1
zL{y_aF`ZV8ax>|O^Qgc@DUKSM!~yObSz->9y8BZvF)IRd(f=-r##s5s<s^hu+fZ*U
z-h>j{VxDX$PJ+Af6f<b!m^n8nG;qrreXjdtxj%BjMEfYw5I<dgXIyA;5v=vKSC<O|
z=S{#Vg3X!bAH1{mnf&bGJJuz*!+7+LGn(pP=6X;ygu6~+<$0m?#)0?PI!Z4WH}%+W
z${uoAYiohl@O%Qxa*~Z+0FLZqbmaqTMGL!#4KXCCyZ){L7R#aDyc6E3Ku)vcgkArm
zOIfo72t^wCN3SRJqDbEneXL`nxZ)U=e>n%kAG)1dNPEU!f0)G1kfBszfE&&{5}ZXs
zTur^?&DuMQ3sn43VsTHFDXJy(AtuAzshSl*14u8Z)J@_7KcZ#h8W}pmFE;EEx82q~
zQ61QRyOA0=i~PxsE|nCHZjrTjEd3{4g8{<;A5bkHLfNe1HjU(!5$N@mW(tdZmTc%c
znzxY9$deh_;$d4Qh*B{JtJPHSV)Dc@Yns=&$?u)go6aRBK3oRqgUlcSUHIS^T6pVp
zrwq=2KsW!@bqpOc9V9v_rWmox#Yb}SWJty!6lH>MIBLMQ0?}6o`4VW6gQuF)86L|{
ztvycn$g)Sb^;)nA0I%yp>!`W{6^wksu*SCAxQQpN8Y&4ZZO3&uMZSVAH<^1$%xSam
zYsH19j5Ybhy}c0en<=qKnOaFW^M)vKSYD;9iLuz#2;&W5u9x_f(z<ksJ9xFK_iB-i
zxikSpmT~~Iuht}K$E!6URi@NP)<rH0Zt`(IrKmc392TH(>=2>>dKpj)n4W^uJYh0t
zNhf<j7Z@6hO($@27?LnY&*VybKLB*l0pbNGnR9YRM@6!PsC?qMg+ht0d>ULSPlPH^
zp`J?0ti3Zx9L@EUU#x(>938hGZJCkU-Uim_Z}mO>hJeWf3rxJD>5_I!+R#+%BZ!X5
zP8XHuj?_b!o|ZnFV?Bh`FMBZI;&Io)I-sW0swFL+P_r%%*CSRgu}=WC24lZO2O&UJ
zX`c+^ZN>=WiLiyDB(nE8Cyb3BU!qIA8KJrW`aNf_<U0<{ECS2r(XEeM*^J?DxoBRB
z1f}yT0_sNx1Xm11(jeRR43v?Bv17o|Se|lU&Wr(}S1BdLc%KFWW3aeIjLEOcu)L7m
zGxYKn(smc;^hBIHr1`Bv66N4JNO4~fTGk1r-ziE-KNg3s!JuMHaw62bVt>A9*#@oq
ztJXODOwMKE+>aKduy7PN-cI|uo#*M<(1{*5$@sD+otD{?h8|DDIc^vgYUpsD8pqS+
zpm<+uuR+I8dg6Nqvo~ZH>?28@4=Cxdo1=SB?isr+g{!2sRpt~71iutt6zASVei|u7
z74OPwU~S$80%5Z(zq(aMkfxc}!<ZHsMG3m=+^w`$QOWO4RV96w*BjY@lRCB76_sBr
zD__#fZ5_qCR^PB|l`W3VGQ0kUx}~M14R4CYO8NVAWE_{5n$4!=k?iOj{Gv-*k;WGm
zUC<heH}Js|8&?y;vTh+B=C8NNV@9>62th?#;AGksL3#J?hW}RVf(jO9?MXK6o+rJw
z9PK9aU?(~W=NVeZq{E^ybtE^Bts}%d&o1B26X7(|(~)eZ(bFrlD?C)E!k?t%MVuDR
zo`{KBb+4E1n)$64IkuQv{MDcE&xiceQzzN94m5v1;O`k5!w~53eyPJ}tQ9(j=&+$f
zn|>pgraUA0h4PJjJ9#^~{cTRF=L*wB6zUS^%G?x;W7YRktSr4&QCf7^vPd<<;_;GJ
z)Wqa5Lnn%R!s=ubAO}EUG)h<+=n0ps2!}dSq;lU60)*=@2g_QAi}+i-<#>@XBG=vM
zZuB9leY+AhBfBK*x=x5IJ7NUoT*RguP8CQ!auvtw@nhG&_7vlJ70;$4_mB~4ICzqe
zDBdI5BWT^#*6n=#cJIkDzT27s4>ESz1QepMA;)RGj*9(2B<;RCNI?<y7;i?qNi!LY
z&STWu(Uwhz9M)5O&<Nw8BF^l|jHy|gJG8ZsnMJMAsg*3u*I1UMdhQszV{BNOPnqwR
z9<|M+`Paa$(~ZJwa}Ow9E-KuKXv+p)D_)yqRf6dZxq<HOUFGnp=?Qu&mb;2na7qd}
zV3$);8Fj=QK353Qq{!QnD9B@P^-7D4phw;p3)pwEW6okxsBu?tKe{v9)G9^9)V3^u
zMpZ-tAq~Y$w_#RI?`NU#TA}b--QO7NN{l=j&c;dZMP!>y-q;Kg1IRmQ@&nCg+`!-l
z^sN#OY}f!AD(L~1sZ=D=?%uWDhUgZ{__AOWVs>qK1$V&dgtYC}mg%itEZZ){Yj|50
z-mXI7H4~@4Xq%$gsyQ}6iWW8^P{KQ;<)s3f5VoZ8&F7@=r6=dBgvaU6+u@VZ7~}ly
zVA$f#w@XE%g8JJfw58JsUt<0%`lm*$!m`Z)+|KPt?-p_l*oUgrF!exjAD3#usVeIl
z@2!?RU$dTDwte>fQMOh`hp$ie5B7kQ4}Fm214^5sVwmMo3&V`j?a&I@%Tuu?sz}*7
ze34~XoKws+kC4evap;Jbg2JOOCpt2MqmW1lh{;FJwNVpB&X&R5j~<baP|aiV?7XnX
z(Z;dNP+_8U@0*@L%Cldy+0G4(bg{wVYGku3Hd1p4+~HcN+?rD^c#YhQ_DBUC5zRxK
z9IDha+X<-O=a||=5heM$RXM`A?`${KY*I}lkFm-qTP-PLaibh%pO}PU7OsqTWcZQF
z!;H<rb)<B~>Z>Z-{XB~jn$^$*sAiguwGxFO>#DNh?=04R!+EX64$e)i^*O}G2-*+c
zxKiJyG2fz56W~>f)I-E5ycaSvbQhCMgSf3WH4stgVgQx<1PEv-SxTJZ=euZ0Hf^c0
z+&VUk<2CV+Wh2Rg3iidy#Z!tl@#9UGoWz&5Za-4gbmVdnUU5LFP*_DDQcOo7{Ln3o
z_hPS${j$JA4_%JC_<pVMUU8Rr%AJ?ENad`EyDrYM=t({7trz1dDNepWDGb+n<&N~0
zW3bDE^%)KeEornC&4rdeDs1kFfWribZVKQTD2uIPT<cZG)XY{PDRm1!Q>g=pZ(TNi
za(4D%(){8`P+m;hQZ_AP^MDu1RMp~43X#=3{rd~JSlAw^OPWYmcgvmw3gWPcM8K}w
zG~(*YO7uj6>xjjDv7*DJa1vh*l>_fMDRe3cKPFigbyAgLBrpc;vZ~p;n-sW@xE{Va
zwP&7oAt|}^XXuqYol^ONu)z<_jfTjw`7<UE*)37p5U|ind`CBxa#XoDo&gO#|A_vz
zbxY!YoT0W2V_u;t+-kEEW8^B^P68eIfU-!ta^sXJwES+gzA2y!k@cpm<jO=+YZ??3
z%~+{hIxn~7apI&U57bj<P;tPhEn?z@IA$_d;tBY%rSwvVEGD@QS}oz1cRZ+yARU%@
z4qxhIEe)r4Oku<LWWzXh9)?h$4im@VKgXoU^E+FdWxccb<xF%IS%vaGF(D5`P(PB~
zL`Le0ed1E+lwR7q{d-uA;!|3;wwm0EwQ}ymztjjJHG;t&X3fzfM@fwMonCl+rQ}2Q
z!aJfiv-C#V_EF{cv(g-}+?~~NN(ZL|oHH3&n}v;RIz{-`hRwc4w<(_+@eA0WOU2B=
z(MERMNImV~Ydw4St)C3eDj401ygYApFCC(D1_4#uPSX+xSGjI$Z|OPgS1Rp5*$PyS
zg$a!}OfD_KJl^{lHkhnNU_a4vJMG&p(_(x{p_HtV+OX_Sz!Al|KB-Po4e9ds|3&$4
z|9sn8{_Qt*Gd~%p1D(ZSskOXh6hyS)K(O>PG}%;>Q9PZk@?j?`WX&Ia>*!Xrn{2Dq
zLZ(P%4>%Ri=SPnU6s-d7X5gc;QF>lmvicb2Y@GsRp{*EODv;xqWa?tNXOaQ+buMb@
z1i%W<m$Z-%*m{fr2QBzpdgIwFBP8$EDqQu_6x9W8(`n$?x{9X5#|Yf+(}0G$T~JZ$
zCytI<^&whnBZ`(@+~<1PFee;Z-m{s$b%K~=M-zRuly>ejZ)LD1osA8f0;`2ilq2Y;
zGhS+`X)VCKwVXAwFN2b!TUb2a+m9R|SYvyquwGERtj7LM(bUaftARzYSJc$0&|Pb3
zYneYCC@gl!Fi$lHLli_yhA;A#PzQ^MmcDbe3w92Y0@rK>nE2=0{QmNC*@@S8(<9=c
zOCk~zr)-0INkm~PXF+};cyPb)ARQKPN`W|b_v3@v58TiVe4_V5J@NM=0Eiz<SQu|H
z;KODJkIREJn<WwW`%o|r@E2uf!8wf%sw@rE9y@%-?%@fCjJ5cMY*NV{ltfz}$CsbS
z8=(3L@O?W(@ne#4dan4k4A}m5Wk5iY-)6l;1$C!5qb8sszB;A2v%nACbK2C^lipcb
zb$m6eI(DIxO}RbOW0@VHe0-R*dl2PY5$-{Sp^*@=aVM{pkjI@m#d>!ELVYUg0f`>2
zQyC*Z7$9Ctd^ik~HUB1CC~Mswan5!;7F~y)Dq)tsx3~`3YTEZstzupjqJ}EIqm{9M
zq3-nBY}zUs?&^uL3U%c(2btL^dQ<K!K&=@7+>%i62Bx;WPEJ)XwWZy0HliF3+!-+)
zPc}L5#zurqI1h0dTzy~&i&&#6N%dT)pa&a@*>N*E905U!I7GyeBKI<WH~Juvh_~17
zWw^<9z`O6EdfhKJ%GXA{Q@`Y^<F!}2&x}~qoT#%4hbxd)U<g8<+s(`f<}%8)@ZI<h
zE&b+Bp?Lx$jJEuqmbAFX8((sPE*xKOjJ?yj2l-oJRhxz0OUFIZLWUXLl(*13owJGH
zNSmb%V_sl9PUcB|ab`p!KP5V;%P500J`$!BxxwQfpErQ2Q-Oer(SM@2e;Hp{?8ay9
z7L04I-GXx00I9Qdu7!nSrir9jVJjH_9L{7zM<lTWI`ShE(~+>i35L+nVi3XywWVIl
zq3BV~w84n$?Nan>07bDt&U>gakV6&}u$7II${~-V^2wxugBs|-*yNoK6;To(xxGi2
zbe@dckgkMPbmCs~<nZ<8+of+CtE+FVXkT6_#J16!%d|H+-&|=u_~udLJV8e)__6lr
z-G;S-OpI|<5Wkfd94q8aeh%BZ*~vaMFk}dgVC`XppN{%53WPsQ8by=ArGDH=`mFAI
z+YkNoc8LZv*S=_DK4o~pyn((=$~LaBbGo5tn17X0gb#IF(u7S@l{Y|lWzs8Nm2xYV
zniN)Di?h2cT*5^jsn}EKKK1IjFhP^z+wnHRlPyF>L?aKC1DKW;W3pi)fmT{Ap@Q^j
zc!kjh5Q+%Sjp!h%kj@hE9#slwO+&~Xe9QHirn2buE!W|bibnUN+M|`$3J}uyFXIW3
zbugTJ(JDM!c8Tk{%M{Y){dy}V4Ubw7#pPS>+md9Me^PiwV1D1e9WI~wFV@%9b6GA5
zHE5e&VO$3z!cs}bfcLtv1ThKKGA0csCD5&|EeDZe8ou7X#rQ-h5w3#WicCG`<K*md
z*3cJ%aP%W@um+c68pG~+(tYoFx1YMZ$=UDTCn&*u-|WVGuK8RN&b>%EZCWkv_2AYu
zVSUUYFhgn3x6M;b64`6u9}4iZ3HQpCGO#c=<Ec%vTSJM5le8HaPmNPi#(lE3XL&F=
zFx9OVC~q0X<%rRJ6*GEZu2~pghlG;BVPiVu(RqTA=Qbbcf!Z+Z;P->ufZS~yJ(Ru2
z@8ggO_|n^@M&LFebwM6P<<>C?yaLECJ}u8U6?sXgY`_Y%P5>Twewv4df~#0~ZnGRH
z3SiWWTVpBY@Sz||{OTe~Es~h_`zi~Aj``W<kgXiT;u*l%GbweF9jh`g<B^X0*{Eoz
zkO#&}Mm>%%KU#?xSwNm4C)m#}quWS#(98s{A=bh;-(GfVSj}P1_SKuwiTZJjNzdmR
zp_PHnQMjxcg^TIJkG)5@VvP5|EmO#ru#%-0bMj7srj=fRy$A8oVpC|9-ot3iq{+O<
z(jJgv{nI8b#dj9AQ3>D}lA-EHvIuh@LrZS>KPAR#(-Ff1idEmPtgK>L&)n>WY7A@q
zYSk-*6f6|5Mf{F|cd;ajr-vIJV(_$$4C1ws)}={|WVjl7Nf*E?=M0Ys{t}nsHhQU^
zjgurYVT%t;iYm-AhIQod^m>@qGZ_;)L~iIb7UkS+z;|v#c02I$ESueqr?^%bj(9OT
zA30wU|AMRgqsWu+ft_dYd&-|BY1m=QFcG^F3iAPx)%~b1>wTcA(ipQ!M=}W*^!sEq
zF)JWA-JS*-Hzl~zzyg{}kpcaK6Aeay`-9f@IdG$wP5_jguDpk=-27OqtoF}9apXNy
zRrP4zCy5o2zEIk6ZoV1)9ZJ)LdA<p59cRsht%^G-tg|xsq?RK$xHH9%L&|K(@-#!t
zT74jSEF2ZO4FkXfZfiDeajDnEiq}P9y|x_b=^*|f8|$aW@~2-?udpIC2V@|u!?KK*
zKEs9r?uubsVXwV)vs@nWjYar*vosF*-Zb!q9<NfT_Sp~!ILnCbud*R;ta5f%0HQ_I
zo5T(|l=yd1?E%o(u%87QJ6gA#>Y2V$4Q)lM1esRLtFCeNC8=SIY<$gW=n@FERSvE(
zOPb@7bH_hE*AbfmVkfz^3OO}8%CfO-c1$B#HJH`_X@+XOL4w&HbGUBKC^jLX0Zi{F
zYk5iBx){(<7RD^&Krbjh(v6Wd94AaxHLyIF<P?k6;$X{MOl=9ArhE6ImDV@TGFj!e
z(9!}vb%jB7eSU6M-+fCO3-iQyo7xn=<~#C)>{V$wYqwA9sMx=BVc>&~TlKcafoI;<
z-KbUED!SP;dU1Z9^p*mv{~A*bM0p<vg)we^nNm>`=}j!;4M3~Z06Y<C$fKfj%m#;l
zgqXff0slzea=Ql`M$7~oJ(tkPno35DA0U*i_p9OeMxqd8%B;-@zNRrcs=7s`f8beu
zRI(;Ej%3mKVu4+oAsanPSn`PninAdQb2iOc8pcLq*hXiZUFK*DjP<0}@x|Hv0#BNN
zW08z%M$?j3G(wd^76(o)j<Q<ynnaP5vKrr!&^CfsD2`kb3jceQqHab{px%~QDELL=
z;V{Fxy$#bl)cF_C1GT$%8`Or9!T_eYo7<=-rH~kl;zRKStFnY|soicbMIzy&AF2?r
zy~*X%?1L2fFz65S%~q?mrCT|R(%$A02~1a(A|jkIa^xl%>gZyeo`P#EpPAarFo-QZ
zsvUAfM!V)oRyI_?8@J6^>6adCad@~sZ4({W8#PXDMA<&9ackPYw$fOsFMY9@7G}N3
z3e*ogvxdxRBkCa;BI}NA@gAdir}kZ5x7Xs$KbPL!H;chPYpr|V)%CXVv*j5pcx!c8
zfM$OPrv`2qTCPT<RtRRl#mUzt7}OJ*jzFNb!l+-kIQwt?+c2`aDRgzAwS22L;H|x$
zZ@n#G_reWlCG5?3+gn=pMxi^qb;q07X^NgdxEnGZ-VAS@Tlea<CvWLZeficZd_CK`
zwYFS223q%JAF|ZSdT7o;YRx8L0<F`rQ_fR98GU6??**O6&FCkpiZUs3Savi*T-{)#
zr7eX+mOP}So@=C}HOPQNRL?$M(qYb>ZKshHLK+tXS0~+p4qW}@#+#kp?UU^{i_6Q{
z<*Rsz-_9qK(fac8<>h6odj&-9zgyY(Y`N3V&X(6!R{plUy0*OXEpF8)9ya5q0Rmjr
zCOrIimJNF2_^jEdTrF42*eWKs>ci#H!$1|}{J#!+RGW;aNSxy-t_uTzA$>BmqJpM|
zlzx;YZiDOsBkL|MF5kPi2&AG6Ig(y5BsxA0nbX2^eD$2@HS|UproTYH#7q%m$I-II
zT)r0>aB7H+1(u>nc=yDofcqr>M|6tD9RvP0_ucj45%WqZ`Rwtyo6*Y*{UKz2&NEy)
ztXO0D<AhyLl73xE9d`bOF=YT+&(63mzWDnP(}|~fK6SeJAJrJ!Mo52kWB`t1;Js7!
z7Mx%{CM0pC1!>?2Rwd3&gRs60s5gmT#^Y#hC0hA*{o&gBqm}6S%M<v$y3&aLCxPC6
zPUGx+nnINYK(+}9Z>MLxwn8PqUgBio_UZM>K3=jqBflqotu~^cpzbpuEusg}>No2T
z{<i+$K}BD$M?DgB;gaDhQv5qQ-O~}FK@OLK{nCn>Rao9RA7>aWRl0`8w}(Ao8=@CU
zb~;XaJ(&#R;W4j@6y}`n*b#*+=q5vCu+W`j>_NiQ<6TuiE$B`*x*8MxjpwR~(<*cv
zJ&9X=_2YZAKaR(PRyP}LwW4jbcx5JHoWQDHBp5GI_O1t@Jx)7Q9Xp!R(+`z}B0lK=
zY95o%$N=eI+@Fk%){&vLk7@&18f+K%Ti}0jnK>;xt+$FNYM?$F_ENS)rEp-$L<406
z>+6j!x9n4CDF;(pXG(&G4fDOx)vGnkCa{nV6(=I+;D`5wGPXOHAUS4a&~LXN11C3b
znGvlOM+7}vtD{B)bM8&M$$Wz{BO+&zxdx@YlzLfrI?z$;pvE%#^^ooJ0Dyd)#{Jy1
zueU<t{9r(7GZ{6}lOOhvqvOM8CqHc;?M3kY)zRUP`@4I)(bInv!S4V5-|b^4boXww
zeXtAv|0CM_`PI?h@o{u`6z#u!^<sZ-7h8qKj<yd@_V<n((f+~Ci`TpR2XN;-eSH!g
z02}gR|K<J(ba8UnfC22OnpU;w@LBY7?`Y=-___Ub|Hb~vKd?(|``P}<0rvO|y4;Rl
zZ6BTN@4SAoeH6WVee~+^crU_<?Cu}$yx87<xwqSb0YInG-j90+C(-c_+b>=e=XH2Q
zC-3m!<Y*rTd3bajJ>7$0Za;mo#~r~`clVF>c200Y=GzV|6^!r&puksqJNx)$@8><3
z&i2ti8m8Ifz5nwX%E9|+cl+h`bC_Ul#=5{h?7TkOdx@il#W;Tb^!Q}|<n_s3^!)H}
z_gLCK-aGnne`oJ_BYJUoOsn?#c&`!R{f*sYE3jVh8oob$eY{UAw|{W5cXagn)ye+h
zK|T86@F!TCqiAOvs_xRp9v)!ZIA_?M!=ry-ySNy%4}gJx*n{UsxUjTj+qf3Tuyi{o
zb}{G@R`SG}DYkmB_x#2F^Sy(eJuGmD4gIu#yjO>9+lTQz$5yfDpSGdf*EDwo5f~eP
zwZOGOn;PvuqtWjExR2wP@&F0P`vN$$d^<nL(rd^+Pl&EoY9PGOb2})#4tES_=yY<)
z8J2qfDWv@7S+1P&vE_IQPsZG?WN$>jSIQX($8-cp4DY|3a0j4h%B~Le0k6Uljz$^W
z2q~sJOj0`B$p^_0j*Y{SPY0uZn)Djjr4PzDyXD12Oyx1o$W%^^x23+ABp_G{sN4y~
zw!;J`cN_fsgz|sLk3&FZ=}^5ng?c$ql%pT`n$Bz34>G$#fE^`gm=<WP?(v*Pq$M+f
zy1y<iz|-vsBd3I)Hh^|rSXj!2bU9B)<k$|hR4uufpi<ks>j9NRZ@ELFn0Db=u_Q*I
z^h>^kXT_4zpH=Sl$dp=MR^{MIEG-xTeY=~$rA$O5-2lW@WFxT>8ftk}jB<1KCPotZ
zjNoB9QDQ74BZU}UT=<A<y#Pe=Fuq97;z>4cL9gTOGu-1z_9DAX#ydcZ)aotD5`TDF
zyL*{*-lvnhbvA&78AyT|SkFC7t%7+_l3_Bg-KAL(B?Pcw&FUw7)Zknz^$naFlSj);
zEG;e|BUIJ!?%_*n=(szED{fZfl#V2ac_N6C0r|z*Zq{u9R0{Y$z1r{9SWvXFxNz2D
zQ8qBO#7Wbmb0x-9&pv7(1vV78JEC}qVZhu$QN~m>-IpT7#W?^z$i_hG1N7%D7npH4
zScK}+wj<Qym{Ed{VBA7Y+ayta)M)cYE!0Xu@m3cO@^JF=20puTp8W$03hOqqhki`H
z=IFG{J|Bi<M=D^Pen6;!X$ioz3de8f<Yi4>Hl&IkHrmoG@w3`ebYEV#V)(k$upV^$
z2VMU`&wr5k4^HtxeF^8O#%iO1+LE3aoTa>OufgtgFarFlCQJsHNZT-rl$=icY<iaf
zi&6Jh0CQu%<Qax0|0XKTJ1WdG^5^w-7)6EUi3-aR`P0XGz*xY4tI@k9Ys>S(md6@D
z&e~uLlj?mowGrKt+CHTew&ppU-q1cA9M^`^J{-@~Zskq-&e;*h=)y@Mp5?RS4bDIF
z`p5t}L(q3KJ<*5?Px%Ppb6%<+|3CKrys>Q~Nf?LcU-MHSv@#-T-a0JHS7cd^wPPJC
z$%*sG3Imdmgoq?K0I4If_p`rs^#y>GWIHpnzjwVm5eRfwU)9xB)pg+Y2&|l>fs&;p
zav>W^vRT2A5X7(L5L5;G!C>MGLB+B}`d;HpY@NOe6!XPvcuT8zX)==v+V%P<vJ9Y3
z?Fm=eiT(i5+LsReftN6V3fvL=j`BH-rZ>S<WX<}M28g}4Q$nqqD663%3Ca>EqCfCu
zTxUEyQk$%FhA@#h;K6Z;aRJCIw(tOlDYu5`28#hR0=4xp1c%TeUi)#BkVwOQxX6$}
z*?Q%=(JlfxtU`Zo%5?%=`osQMqpvmmtZ$z@MaIsmp4ICiU`IF}+>|c3-@>rqobi)Y
z!WrUMps{8j{;gPiXS{$O3d08+A8;TP0|^-#4|QfkyrX_F2YE6$BNI!oADBf^^Q|Y@
zU2U&sbC$CDsh2mnFb_VfymnT%aal~iaRI)d<1>+6jl$uB?}Ea28<au8+#Z<ER{Of3
z>Y;&%8yTl5i^4q&6nGo<YBu?Q4fZO{umyACpXnTg#1H16w3c!Z=glM%amZVUoO!<2
zZg`+?1~N#hyFz$u^+jiD)I<B1baWQ=gJXUI*dm(E+b~I_o_`x2We6K0$t;@j-_vkH
z@>hCE7S)8DoV+kOBqiq~#ic-%8grf!7++aQl5D4}B#HaPRCx&sb)+J|JbLCk$b$Z`
z8=g&J?kH^!r8^|8B`V*$k*Mr6beL%efC|x~%{AE=8Q`j%J*N~Z6=V1rJC#}uflSeA
z8MsJ5p+V&LExQRU;Z3e0JNKOQAfbRwIP6JOkc=|e5#1$B|08h<apaWsM`cJ<fn-ES
z^3WJ+NG<`I3ty6|LkCnUBV7)Sw@CrZQ;*FQ&^~*dSUm(_te+10re9Qx#!L&sS&DpJ
z3zIBz9t+XMD5Vb>y5hs)2vaZ)7OmOWy4CKDT3T5>$-d){p~yJKK<gBFiL*s=(6ib0
z!N!;&-$Qzy?Xl}&tq0#pf?(8%P}EiS$$16Pe4~T8aqOZgBTO~K5*Z{}>B*C{O>(K1
zgaaf{<#iL1LnoS2gPTN=@sBfe`&_q_%A%+Df>XkdQf-QS_dj0a*>SV>#IK!h)ZUyt
zdO^wYu!Fh`CNLQ-PAHXDNEd)A-6Qju6a+!|O-A@=M7hoe(6mZN)g!fFmkj)42?!@(
zf<(5Fw#G>(`^#A+wAI${KRdq4cPLNsX4C*JOTqceor2+-YzDKT<kr>Ar;L#9i%H)E
zDYED|L5~h1BXUJ#t(LQ#RW|Y+NrVXW<UkWALmY4|ttMM1UMTV8{0RZaY_I6g<59w0
zMs;PlZnDhH+R`|&>f`6~)7!CU-kPR!N}5^2ebTIyj(>e|QYouVV($`4A1vhCpQyZZ
z;l!Zj-G;z+^Xl`*9~N4cVV}ViJLIG<@q1L-8JyS<(<mW@7djiCv2q(~?J(;cP$s*?
zTzk<mr3%7piU?$4TH;p|v2xSYHD{ozoH(`3cZpgkF)eY7+x<6DtjYOBaFeFcVc$e_
zV7r5`|0fpI@d8cMmauQa4NyHhR;8+3_8zHyn+uj=l=PLCsR|;9Z)nQ38whFA(1OL;
z8f?*EzQ}f^0lOX~-|P&#a7_8oFb}(vSmykrhW13k&m65%d+p4M1x8S^SpX?09er~m
zfE`|hW3j_Ev%%>U0efz28{qTk3S;QOemO-VgBgzzO@Vnic>6@}Uln4@FMBV%H3~@V
zduJ1``1sWQXXR2i;dpFoaAU?K;rv~LO*=M*__JU6fUKOG)MCn1Bv-%^Wfx1)?|43)
z@Oqh!*wj3g;nqrT`<<QNmilF%O}hH=f{&p>vBeXo73w^)pOilm&@ceR#w9SAD7lly
zemn_#Qw-=z8K<RsiOf@xI1)D|nZ<SR&vZ&_kH`RBT~YNOTETEOY&#dW^qeCB_=5|w
z{K6cBf*}RNIan@NyocmoP_7y^RJ)N_!Ut$X{@vr$#?mfkHU6E_0@Fk7xwquHSt0Z6
zo{I~=*V=A~xo{AuFlSD&R3tjsw0Y2+<UDsj(-4&F52gEhx4Q1hA^QR5!fWRNE%JjH
zoR{+q%3nt$0t^G(=<MFvi(=RTV>Hn~ldFhu0#|r_{a`xMG{B!|Am|=S6-TFRr`5aZ
z4H#80lmhJ1@xZ?!IVqV0exF37<Yoj2qP?goS)Q^)(~=%t9-hV|dIYhcN8KJg4;2mT
zRX6Ju>ZqF(ntZUSHquETiR69z(ojBFc=X(Onw>;|^$<h;ne(kApvsvEP0=S!Iqj~v
zM5YK-kekvtS<FeTWRtg%3(rhL@K0~?<;z8)ts24k<$5y}^*z%I(`s%8#&r2vUAD3_
z=5$`m+j9r-Eqh9U@7g;IWto$lGd+`Z;5e_pvdcOlm;(CL`iNi1x&8n>K*GOc|Iva8
zI+r)pS>p_5qMvofNtR8EDzNpf5?|4EKZkKGU<EEoZUDt99AwP0l=0s0`3t=Nvp#Xt
z_)W~Jg(s5_!k7Jsx97-~joD#ZU32nrC!8@#D!zm_qbO`rR<UB7m?|9=*?vVUjPJg)
z9RAc*qz++6(PZ&_Mt~B%Rf4x>bG1nA61V=G=}d9tldVRHUkmjqK7vUlJBk`U7=vbe
z`~YuqQ=`7H)8P;gZAn&-qZZehS);a)ToO%p&;pw97NZj^TKrR{z*!t!P0lrXr#4JD
z0>a;6^MNGAh5?0)dg`0m9+|oA%e*S*9T#8IcI&`vcDgqccbnb@GiMj%EwNhQ1}yOM
z+REeAdefrt8sk%hBQs^l+Mui!jffI|XLa9vN@nBQlHHNuN%<)`FQVQX1TKFRB>|dG
zvP}&?&cMJK^C1YfF_;ALXa<JCNys`zXrx##+Gqy#=3<(`dZ#l0W!6qHu3ul;L+)TI
zVa6Br^4^^kkzHJzrWlw;W(!jR|M{P~|BCXV_|?0v_^No@E-UU>W&YxgRFpk2b0Le8
z(Wht@5&wA-1rv~J6pkreO*CQyZ2IodWDM|w=3Qj>O)e|&bz6emqdE-j($6@C8jC&0
zezjZeRr@FCLE)VVAYH$T+IZ2?bOXEkv46tKb7)d^Q6aWeP9JevAHZtw86h>Kva5L1
zAvfh~I)cU=O@v?#s~J+s!A)8_!*>wh-8`vEqmJ*U(bMGf1Xe(yf5ie+z2h$ar-%RP
z^LlLRF8qhDN;<L?b7pgw=00n(&6b+H>uNVp?JP(p-u|W+iJp<BAMgDrGN9HyRs~){
zmufz6n>~;a$^P*wOw4D_2Er=F?c|W!+3#%-u%q+f5M{%eQ!nqicbzfHb2_=mJyziE
zc>j!C{9Rg`$sB_fkiQnifz>}-J!JJ+c8k(Y<WXx=9IrxD`5by}^~Po7%>rv!+V7a+
zc=aZSq(6Em>1uD&cq%=c_4=W=h;Q2{Q7p=#nRrE%s*1$gPe&Kzyroj&CQngU(2v-}
z9B(7!${9B)d?qtna#2*ljU})G!CV(`MRo3TybxDk$G!Y)Z#b2jAg7p>tUybLcv=--
zT6#+bfCpx+yxl`CRQHPOlw~cyt>#HubFCoA{*#r#t9gzZiS9M1%dguD$J+f{)@#=8
z;cEp&xX5{~gda)^w6{ChLZE2|+AH9;`d-6JZzRD9dn;Lhte|=Q0R0iweC6Vx9k)qf
zV{mVVVQ3o-q3S?P5xH3bodjrZG$(e_x<}6z!V@h~sF~&aAqG`@;dD_mP1%9q-_!`a
z^n?jin}}O@M3D3be-k3J{U#>6fiJ+56vrs;YNQ$=b(9s*_nLxqyJ{2FDFOXdb@tzR
zaAJY6Pqy`?yPc&nXKFd@$Xm_@fvW+QD2q-B>#{d55rG?+F{KX9tODhHq*cIr-=VHF
zQ^--4I$03%L911CVLwm7mQuF@XPp#Ib|zU7w#%97xIo#Bo5%=)ZisMR@nW&6iPEcZ
zjqEPctd3nZm+Q%AdpHya+E#&>hptVu@6Nt_`#kjC$*sIL{Lz*@nDUUTevgly9i5NT
zA;!U3aE<R5clUNSjyB&eervUljrXLRFD?G?Ut2pH@80cgcJ>dp-fVyPp+^Ge;;e|8
zi@no02xfoIz#HBIZxmc@gCIA%0LH_sc()eIG<@HF2GG;+Y;=z*Xexf)`GSg69?<oc
zsTp71QXm8P-W32J?pcG^^ZGt*+`Gp0y=(OET_d@*%B0u1Z8Knz`FI8;ZrcG+<aQXh
zA{i9AD?Vb;+b{*n+@Z*==mTY7=g$4!4+g<x{^$V&B_O;5oZHI*untIV=Rg|o)adPn
z`_ZjyyuNM~^6;QQPZXlTwVHQ^SGRBqk)nbEdEl46H%jgRuM@?c-gtZ)F?k&wlESRN
zF;Jq%?7|7U=mrdOeck68bJnP%`ojOk$T4UvaJQ=6DKM?!=vG89CFi1)DRvp$j$Ll)
zxqzcF>Y6ar^<7IHpUf=B0r|<s0~Z}Qd=EBm6yMZ*y*?`6DcRuc9eN*TwJDSTM>Gm<
z#YDU8ZRE`^dmA;d%ic;BoDSbguk6xuDJ4xRIzIXF1u3Yy!C6SrVH#rhhx6Q<CX;B0
zsxFl;HMiAHhtr~-MbX*d_IbtP(fB^45x5NPJc=%E1#OqL6->Z8{<)AceO2#^9a2h|
zuO6p#1tzeB7**!*KEBt%%b8R5Ma8&8H<NP;#N#OjUPWtWe%U+P+@bDxWN&S1u=#%w
zjHD8iH8Q^=JEGoDhzc{tXjw|vzgGbpN1YC)7zt5oM`U8u4{T@h<R$_7!p0*h#<{3^
z_32mBkhwv)<0VBNw|pt=GKLymUq1+XQQUtQ^)5td{Mw)RGuO|PT8Go_Fr4g6C&Bgo
zs~wKR(cK%QM%LHgk6;F7BUY;1;b6`or^_Bt64<*z#tyHq|Brs2Q(lel4xKhdvB!5V
z{uYoah@m^~i|kgqOq-G434g{@4M{=(CqUHvfes^q4ip@0cys@~y00K>{J_Kn7K88p
zI2fIwwKv*Lxgj`okmjdeh=Cc=AY9cY>u=a5?A0N+BLlBJ>et3SIA40umoOP}M6!AY
z$pyzP6kA^hVVf8h_3xnvU4r8+>`^MZ+!=QO;6OVv2MFmd05-={ff1(x%%+iV4mNhS
zI$OK1JDqvO#=y)03U^?2?f?`u0x(0j(p!xqCYauC!~_w`k7ebRS{%_PQHqJXqZK;-
z3<kLuHJGU;_J@3PMj7bYYm4t_q&}h3;nBg~?vL+&@sjBoR+Z?!A>Fs36G=P?(R&*a
zX&Cs)G-elkff3e&dR1<NPFYbhCX%hN&cg0EwFl|~<1HG$lJy|7XIO8jK9-O%g7c2D
zQtWSHuW-TGTa8A<FgaZ%^sY)<13&9w%5@c4w!*;BQ-%tmgJL+kj0PA~j8j)gg1z+h
z(u^yrl2ZGW)4D51xv5@@?cw6$ExJVAa$2WoUmoR_cQuSk59cK8qZ1o3(E>-4N&a`V
zkfgCs>Q)ZbyQ*i^Nav|&rObRaE&js~zz=Z2s@JL-cIH+UA?t8W@%w2B&D>dfJ*_I#
zJN$p2F8glE>y)+i3<b8jq9g)HcFd@Iv~727eyov77=g?=h|!)8+ld1RMX??08f|_F
z4?T1Tk~|7k6Lru5<tNE>IA#w_x^#|%%P^WIiX>g3(<)M2;~7c{UL+ioC<~5du1MP?
z<G=Jw^FLefZJB4Poi|$pes>l3eNdNB(%_?g|6|`=iLvI>8H#YUf1((G3i)A<;5Zqf
zBLYTt;%GuZ;4xB@sLio_+GgUes`A`j^l#5j^F{mh8z!U4+1+$ofZM^mTEO3bE-q?$
zjxhKz;*Ai%uDBrwE8+lz`N&WTIPt8W+io^Tk>^tintn9x!f<K)6wh%=Xb}g!X`Il-
zD_vuVQ&o+&u7<*jjSwB}*aL5XXZQ_ChP1ye^7I{#Xd(EVI{WygE!3tqSdgOLf9*z_
zv2$KW;>(wegP!<qvwse$4>8b8j~)4#F1}<hJ1Vk+-`uOF>?TPYJ=)GlWlLDic#A1#
zo6q#~k>g*(l>BChZZM&wG=R1mbep8!KWbTDa%@mq+3B~YsVNgg=?&TU7|1nFY$8k;
zvB!GWczW3ElInaNbvdPG|94n#A^jZ>)P@-fR!I0n%h#=;Nk>Du7+C9BLMK34E*g7-
z;&MBPmf``bGE2@$owF$}GTf3l8O&RLcbDWL0dnNGA;R|A2&V4qFd-xu|0$?|0C<J_
zp3b53FUAj^kvky>7j?xF)BV<M2%$*4RGDkAm`1Z(j7TT!F`|q`M~Zo2r(XPYUz5(}
zeGoxadz6O<GrJAL_BQYweMQ}bpXp9+q`UVjW65=(vG$=yc_cxQqaz<CVPp0XHe4*e
zL=4`rao4QLfh@<RKKrsQy_((9tDKfz-L)k(ZwE4EJLuGys6!Q<1!(H%^`Q`gFPgmD
zr)lAUJDr-T&*_u+RXI;-oIfEhRA*Mw2+uQ+k2Sq79Q2oBjMeGZSE57?sPvj2PP=4_
z=e=T8#RfA?^7gB?%>6fqSF>{dzDipRUt-$TlyMy9Ug?a2Gcqi<7XH#u{Li=U14TIJ
z0tJR0o%NOGm*Tf1GEK%To_KKbAs4UyJL9U8o=@gu2D>05Xu@<Uw9fOp%2{p7Xi5?T
zEw-{A^!^Cqh!XXg=thJGYBg>n>=#~&byfp$=(QeB%6ie-?>YV_O<pEV)b&-a;bZLc
zNKMndx=c#>^ccRIKM41=!Z)1t)ECLYsRv+1$55dk@<zjPWpLx8(pHoy0K10{02DUH
z9&cy~H#0^IHPf%SBdM2)>9Sw`a3O+mAtT-@-Ya>e4U?S>PCC`M!S&YlBp3k+*GV;@
zKR83<o+Wvr)CrAM@vE9ngZO%8N+@S~B4=KdEp|q`Cv8gl4mBAV3?jxnF#Q`~+wf8Z
z*gWx6BL5W3InAfsKBmW2lR1si;@Et6fAG$j6JpG6TqP)Q9t;LsNzWe#r5~V7=grp9
z=G!gYssMp1a7v$Fc3$nhLmy{V_fxTqvD$+;CP#UGt6Pwm3(vS7<r$NAlvq4&G|p7$
zDbmQ}j^WVSNo^2C7s&9F2RvU5Pe<Xk`@WzP1W^krcNyB8n`4*4A*e;=o)&3lbZ9Kx
zDk@`~xolBAZTvc#4m-l}t^=x+KK37#O~e5z+)5=8m39s>4L08Ea7K-~w;SnL9{!~t
z4ltEmUA3KaLnLtCKv6dQ!OIEUOC|}YjtzoT5eH_5BG#+hN=SyaO>eZ0#FcWWNA1-8
zuEr&)1l66vdy4-+2{9@AlUvDL6u87NC)3?NdRyMPkBY?U6?VIdx(TNuI&2hE<hx|&
z%05IYpf?+Kpr*wq3e6OaYOFG2zx0Hzj7FIJDj|22R7XL2s{UHSTvEx)^+u!ovUL1w
z<K$79vUZgkpB5-##k;M;^2>#)W<CH0tS`{p77n2(si=x-Go44tL{ge9w2drF<{0p5
zDJ$MCEE6CEVZp!;3Ks21en~+G>Xk-A7e>PZCLl%bo319!QrENtJbtX|T2<W<p=%i2
z<}^ShmxHeq{*jUkX<Da)T^S9S&@P1+PGj&M8zXD+=V?sRSEjT&09reYC<jpmV}VIX
zXMf|zt)lUiz#i}Ottn-4EPu;B7!qx|0jTlg!NyK!7w@U1GY-A(2vxl+(cav7{cd}A
z%c9y0A(wR1Cv!p!`-+4M6sF<&y+g*oihv7zYC4zZsjF*_7Gsk-Me#K`knWXp`g+}L
z)*k_mv$BM2lwd(FF|HjRXXNS25s93N-+df?_uZLY>)jhFrTuHTu;x_ZnD0UN789@b
z4#;Uu8SBB6^L<oECr=y<LP{oz!Sn(@!DycxMRJmOkL#^=eaXX+ewfP0^EMGz$Y~Y0
z7&-?c3`C9@(I!5SL=IRQbKF&c-4A0n8p*^Nr2<z`eBsBydXUutRK_0HJ<10q6+t3^
z(`!Vgg<WXVL!1|9vx6YP8*;1kn<%C(y4**KJ-Z_g7i+ciz^70K-vXQE{$8W8It{)R
z7s4k}<5%Smw(enCM@t(nld)i1g5)B<!YC;3u-zDb4ei^|8yy$knk`y0cAxdhV%TA@
ziG&?VZM8HCT8dF70!>kqe&{G(KyNFlQ?~gYzB0j>FRE@?5+8RFo4i_L%>m!aNI6>K
zp?_UNu$cP7jbEV~llfAXRdX7Q$355-AG@<#)NRyieLyZ;yyyANxr~Z}pl?BavW7Ie
zCi^TKsN8-`s`yeA1nY&C@^VI#$%k^+gGxWrYin4rnj3?Jc>f*;;=A-?q7rE0f?ntx
zs7sDf3g^hV2?jS+6Tnqf(s25?>lc|1eg2GMlD=4!fXY+KABeJ<F)^Y>$l8*^$6=hX
zo=b)m9q{{U1zR{uZ+!c5R&7Qo_7`kKMWPdJ1qGCqqMM<jAh7rjeeaqCI6%%|WLdo-
zz6~3{Hm@;sC`Z`^CJqIF`Xgs=OW?NFXU&^g7z+?;wVGAjsKD(qrDMPL$I0=p&rd4l
z=SVyj8lI^`42N1$)c@e}A+J$Fv|4Cu6$;((<&-q4n56M5in~^5sRZR;E7+9d1*q`|
zxoF0oq7BZqOFJWn^!K~}*xmbixASUycjMp}OY5aeWO|jBElS0oecCDO-cFdPs|3kQ
zNE>VM`(&}|aR@qmuFuF-?&(ERJ<zjarr>iSryQ;(71R@x39psvGu=aBhm;AQo;?nv
zNSg$y^SW2`>P}~iI0m!=gFmDi$S&f1H5nkGW?SKK*cy>ZwAzs%xY%2ge^dJ5<6k#w
z{||5v5d34UQ~&ONDvPD^Nx7k@rC0p^`|q3WYv@uG_fa}&1ZVb11)y}p8^|sQIbbUj
zV21r+GKVMlVaz3z?ZO<lRxO6g^*+|Ks5%#Y{(S;n)iaQVRW3Wq(^-D5w=^bY=d>mz
zQq8e@s~)xG->T+DAB4$E0=_`v6d!zlXWIm<YQSb$20HTt&dq1e5fhRe^`v95{T#B*
zX`-V(D?y9{HXvUJ1LJ`5bh?Z=mz%f9@X$PE5xHm;VV+LBDhqp7t7Li!2aF|W>G=Np
zn;r+rhBs3VR4%=6qlD0z>0jx<ybsBIh0MHIQsB_3wiyX`L!1lTE~ADLtzXcM=>}j0
z*GeI7&s)E4B*FAKH|`}tnu%I4ZKUrPTq7OAeNt<l!D@JaddkG5^ZC&upf#*%=QheD
zdtkuKtoFmS=c+D&Rqv2wpe$P+A)5u_d#Qwd`?J`*Mz@dRLZ|qddcv7kus*Tc`+J8+
zsHLDR-i+3hAq%n4q|#Wi6{#v~HOrrw!Bw9X{5iTw{oUr_%|(jE|5+UH9Hvv+nJKN5
zw0vQeo<+t|h3_HFAeUME_(RS-&N;Kp;bodlhpYdZ4wvT2U$~M={+iWCKp*d!#{p9f
zsO%_h##$mBBgN@GdITltTAtz)JH!F$2>L@{kgl_VNvUAcDFoD99~~PBjJpI2QTO-G
zB;u{{XHnWJs_UkFjkZXWS=hG-m|kk%TU>Fe!ma$dy{FpFD6O^4u(4Um-b0RiUWxXp
z9lXZLLx2`EvA4PmjM5}wZi!N?YLzqI?P)4UnufI$d#nuXkMNGLA!12P5)bjxkrq}s
zQ3<RN5P;QX$t1u*eguXQakwqt1Df-Fb8RrVrT{>|)`<Xu+Kf2tD=S~OE3a+<idd)5
z;OQ}EHD;5+IZ{ccor8xV$#|;HcQ(CKrvV(MFlU#<v}s8J#WFqRWIe;i_I%IdS?`dg
z`n6e6%=ANV3s;YjYUtmn(B3L519`XUtTrR!7ZOQ{GqU}CsCOt8aw2TYUYRW?C2T7v
z*}36k4NrKoI4y+=3<XSNv<&|Ulu=2!iblJ&nw4HB91MappMr<GF)HdA%u5V$&N-5F
zh6dMb!PGX!<mux1^v<p*Cm1dRj_$uO<~x!V9f{eZImU4E_{7<;);*qy=VEU=og_kT
z3xPBiEnD3r<>VoE6=ZY#M&^!G$0lWoqQ}fyvh`(^YgRF~lm&f;k&|>?^WCq2dhXi6
z(Q>bL7MweZ<hx(%mBx49*=kKb9V3yktOj*W-Q<pcp_JU|)=LX4sC9TmsrwnFT)L+c
z-2tL_EosM2p`tqDbi!7xSqyfa{y*;s&Oojj%Z(0di>iEaQg*KjUi1BI+VsTg$qZ}6
z+;7CY(w7eDbW)!K5ILqXuuf=)90r`yD0N3>U;U-#aE3ucM;#~5&imTM5?PBZt?53F
zuj$m!hNV+@h!Q`E_2l5DYzr`pDWy{*0j4*e)|BOhte9AFtIIWFBGm3NT(NXauE=tb
zcrNm0_*ZjrgU!o*r&&9rXSE{nnVDcaOS{9L7WQ}E+b=9uHdXKV<%wf%O+BhZm;SE(
zv$DaYRGF8iOu_x6w}-@56%DBsAeP@7t};E;Y*`GWU2kFn*i{{L{~;#)HPcILO$p`T
zSW{j*a4h8?SxR@3=Mnjw9U^m&4`z_?KG$+UOvuU5XEi%Os0C>4k#OQRU6CBqIeVd!
zkm*0H2{rUTnV!m(EH0IvB=s8TZnaUZSI_hp2PNyzRnc!cPid5UyS1^OMz5K(NdcrB
zluCp9@nG-gqqlbkC;_MDg52EOJ=)qm+TPo}Gg!+zKdmau?0-1uaEZ2dfBLidUt750
zI!8PEueT41;;x2Y-tO&eeMT9l@q2(3ixw&S&a3qua26ME0Y6L5H|u}_=>0G#72l7D
z$3$92DOWXCnKRf1vF<H==h}(LP0n!KF<1UYyGo-DAL|Z&Sp*8hZ_KQju4L#|`b=^H
zv>9V&13OKEtxKlV?NrI7Bq<T!^t?CB7%k~59+Fl`EPas`ORc%e97=Z}#h(^7w{{QT
zAG+jO-!(bzv_JaDsN*4K`|<00Yudp%bkc--$DHX4f7%oI*>b$4erL~rC-aEYpI3p$
zg(mg7?ZNvwk4m~#X^F@)m?kPamie8Pl`nBb4!WH$i?I}DxSes=k1*D0sa?cZV2Z;_
zy0<ecT6NJb+lJY2aiH>BVo3ws9rw?1G;w?#9r${DvWgO-0iD8Z*WmO%FxvXuN~{YY
z9quN7(}xr(MSTpD77S)FoYoB-OcGg4N;Ji^35v1N3oZlFHw>b)5?3pG4f@qCn`oZ`
z@41P1oFc;1{BiRHAmwzd<X*qz7{pY)W)*;E7*9-p3Rp*W3W$Wj8cwY%_fp%dRMaTS
z=*=cW5L}ioj~=DzrZyCvH$k&J=BRQyN^I_gklWms%m`E@-}a_M@n`K!9*yB=^0#{)
z#vG8RCUl1<ik3mOIR~{x5Bu>WZhepRu{pzcb0?5XC^T||vwDGf%vi;)wtX;)rf28o
z!h)_IIPeLKQ4MY;?#oE@78v^1G^VuJl=~8+;z=Z3SAwFCl#dWQU9v2wO^v399D{!G
z?3p04=N-j2vX8B0=WbP{CshMVDqZ>EB(o3f_FCVzz1|@3N7J!#9S*L;NvT=RAw@ps
z13MdNq9}<GQ%!#31(4z|o_l62UJXX<*x#DTn7yOTR{fIws9HF2wn)ZcckUibuf?NQ
zdNu4E6(Ceoel;g8#Xcux)@ehN2^=y*C|9HSC&Q>e<<m-xP%!2er*_2cWTa*iUNBGe
zApsy2{P}crfo2n^;|2JGkSH#jVAP$=;3E!{aEgH#WcOmq!Np_{O%|)lT4Zp;y<mfv
z00_80s*T82PqK>ks0$k&)<eA`0$FO;y5YnlMK(QMMKPuYFZBbw<iIXTwt;YjX;{>O
z4}gA#-T=QRO;JmzIRzj!%02f`r-4+n0Fsk3A@L`cHR_s2DNxpFUdB^HT2)qXV$^iM
zCEdZ2SGo!op#y%e7mQ)Uj3nL}dfhMb^=PwPFTC3NaeJ2#X6*Ma&|=>NGvf6i^vCUm
z_FR?<rZ?~tiWI;c&#9|Y6A3gJV1BVbSw5A2&tFKTtgZ_+7*?@nP7$<w?gzTaN~=wo
zvD(WVrgDgy*DfOEP^G8E08`-vXT7nO0}tjcF-;zy<g_^*;pB7({V}gt(Ty;*OKaH;
z&uYBdRqrQyGYBV>L68ME4&p&4OggK}h*JQtRkgtl+4K{siNXz7SH?iz={&(*vNfeS
zM$Zjg4yEdU7jRCX3B^nD`#J|H&z>PxhVRFs9hqE5lA;D`FaG3jpIxnrRm;6r!&@f{
zi804L&ou1O)9`E>bBsJ$7}^_Vt5`Q2ROh+r1pfYPAsAYG;147@B~^;pe)6ILIc%-0
zX5~;E7S0Ay*B|Kc_#I9WOUQ>AsJ$x;OmRhVT|Bg6RkuHDxDG-SN^9`x+V2OwaELy=
z=RQXB@mi~9t-KQa$`+DHfT_lxQ(A)<Rgk6Lc?_rC^;#KowE>KEZ_Sbs(-oh?2pz>7
z>{WnN;?b{GF-Ipr6`*dyPMI$Yzj1vRe_DLXvB4341*w((Myp7iW|qICnO$z?mEJhB
zbcO5d%2|e}%({0@LH#^J9ZbktskBy&@MJWJKWGHvwoAEP0U5ngWOT{D+NMZmKu*!Z
zLoKeB^?K;>gcI);sDYr5Ql18ZyWX`Sp?e*o+baK09EjT>T7IBm=jkA_5}t;f$COe<
z)47M2or5T0rWCM@G=;dAhW>?hN2viw->nqvF`Te`TwO(I2i}V?6fPV!H^HRpb*J1n
z4FJQh#5`CEqDgziXOkHY=%QSiPD8p(Uux4Hx7Cv8e$x4;aV!Nk530i%p+C?{75^LU
z6k0{v1F!{JPdy!;i#<)LcpjcP^!2mdlERDIsYT9Kg1KI{aeUcs8x08-`>+_7#D?JA
z-{OBS@(fbkL%&RCE>LAOqxXUF>hc?5MgX6p)B0bqHJkIg{jb=XOYOX^$@X@n`@G-Y
zBuY-nfB^^5wvkvhxvnROK!IV<H0yW^jO#%MpmGAOXQ)G|Nmoc=jB0~N^4L0Y1YVP+
zXmHB>ae-DMB3>7EK3O=CLo@2|dn8X%1GN{xm6kq~&80T3`whkRlPJn{;jsXHV%YNz
zqlFD-7^^wwqI!qt8N1Csl=6>MKwXN26p<Szb($y_5TAkHQ&Dv9c)F&zgYvBhm0Chv
zEjdfk;6^Vkxrc;odJy=@4Sih~96_qfe7{uX*G&JyVThjQNp^X^lKB6Oc9^Ualx_%B
zLq?tbA&BS#?d$@+S+wql?ozuW_JsGxa{{osYyg<ZZZpCsndVdorM63?C|YYT2?t1o
z%ImmL6Pa*d%_)-4su-IfTZCrl76|y)qX4fMqIx<e(;JwYs79h4o=VDk0|D{T2Fo^#
zCV>kDW5-L>E`5sWXtCxzgVX7C;1Aet2alM#3+5m^JD<Rgx}v)?+UWf-FokFj4I;cH
z57|!L%o6Li+!v2pCRvhBa+X~%jCQ)aC<y(~;{GjuKh^Geh|+eHYwS%i9Ox8%j%APt
zorfUVl!$<)I`rL)lkV?-r@k;p!q8x0fdeH0*kUdmnWR*bmcLi6l`$<b_TtkgTu=4A
z;eLl<xpwpVEZD`}VmPIMH1kHsc5YZ?Wm{{X5cagNU5eQRGc3^U&2E*p6eCQmH+s?o
zn3x)%6X_Sk*q8*Z(jYoxr}i=$nR~Ss?(wa?H;O=`ej!DhG3ZeL`aTp|+)gxIcC%Kp
zmb-tAJK84YshzCcYl!?HJ9a&0%~%|WLW6D!s0Bc4ujVDuFd!wsi3P_$MUGC@;jpVx
z<wV7@WxauDa9E(@W8U71d?qhw5%Lok`BY`TkfTBqi|LbP)QI&R7)H~ALKsAv7?cQ2
zn0D?ac0w2o3^X15bBedD{=oFZRZG7g@vH=WYO98g=@D7iVMT*`a?ID%NqHVm&#FMC
zu;;{WkaXA$Ce)uu%BMLnTE7?RqgbEBIV_ku`3;SqmDYAan2KX+q~<n~imj`}agtvM
zc~PLPD)fX&JU&t6dKma4j6}M4iM)VMw(5ZSh4iej_4gFb)p5l&q+~iCM~PU!V<i0P
zD51PT5+NWdSQ>a`#W{(_Rl3*5(B>+~0SP#601uUwlPoUTJ(Wxuh3{hkRq~ypU4eU;
zh>*ah(u-`BD5U{JUVAFPV}frfq6^RgV(=El)^<^RzYwp*@E;{J4DU>qkjQV+Exnpq
z{slWU=uIambs>{zZ7cvH`w2bn2APH^_kuE9{T>VH-5@1pIyC3xjM}oM)T6A4F;kDH
zQHB!235MxU62@{eXNW8{6lxfGJ%Fg6V;XF>0%eT~0bpZVl0&<w;jvVl&~dbR!MXA&
zpf=(nibkH*ThWZtyRn^S*K^+xlCLb$-=($o(yDh1zgOBT@TS#XTW+?WoOnM_9d$>*
zCO0OWJ1#*23sz0X0XG4-(U8Mu4kx&t)Bpr78{OVoeKsyB3II|Y^sl-=>DYqIN?Y3j
zS|N6^$WTU+4Ov*NZouv+RjQ0rl&&t>Y9AK(WH^lmKucI>PY9BTNpUYa8=+MW&*=A8
zKJMz87Xa_9jHD%VMVJU`U@Bwi59}@uw!op&7k}P3*xla!aeYxY%1Uq=zvKYuk}D4|
z#Y1%5(N3D8Uw+HuL;}Z=J1Sz&kg-0*BL}r-XdR-X5QytQQG!2!gd)|eRt<HNn*_my
z`Ce<$doSl7Qn%PqULqKE17v#g-T!!v<KuNYZ`M!9{!K#=36GJ6)P88@9@~^uGQJly
zGvEY?!8ixf*%#)X@7qN>$i$T)L?C}s_7yj?v4~$5HJwqfcOwdeA0|3H30b`_GDdX=
z{`todJ2vqv_@xf%lx>5ck+;yo+hNl%7jtnk@N|esbJSX+upO?QRx<98Dr}G)z)LpX
zI?r@*hBUavnR(Q{s_H8Ti#ZusVxUf-tG$O(Ce&<?DbO*s7OWbayF~Aif&%Ii2joym
z9Zx4?X!pjx_{=rvB@v=j3#`v%odWM-`(4T`R|m~`$WfkHcofE22&HjGuc@;YlN&Lo
zNPaHLk?Wahh*^K35*`(BcE0S04CN?Qlq;9=V==#3Ow!e74aITup=dc2A7`QZl$S$?
zF3saakq-g($4|}+DSta0G4lR@e_F5&*Y#KsS!+OcD{hsBI8Blfv&Kr3G#<z<GdK<T
z7T0?{i#@WLe>`YVz#jTzruCi<0SdgLg!1@IuYcknRv;()W;R<H&i*j!b6t<Jw2=aa
z-lB_#Hw=4mq>OWO>Wg6(y;fKCQTKO1m~3HAf0A(F9bf>65D<mlex2B%$rwVC1p!m=
zS=09&(zj8l1Y}km0+7?yUSg`gg_R~&(eV>SPsu8}NFv!k53ZGVJ$>5Qp`^|-CtRM<
zy#!))PbXPvYMf%}r_58o9*d3fY8sPm>ss&Y8)D<zOe6n-E$LWSetjd#(kR`Ewr&3U
zCXkPH;fwY;x<CyD3+0+$3jztf943mBCZ5{jMC(k*Ev6T}!YoO{FrujC#I)Z?Xh^>%
z!4FV(Oi)TxjV&~w=Eo-gUl}>eP%>Vi8du5D5_wXwSp?$>L`Gq_a2QpQE-8F8I#7FO
z;h9gC5T)<RxC^m$eX3~A4$l=nQ!IN+bvI$mH`QSy^>kW--QbG!RSERedw=w%wx-lp
ztQVK1=+i3X97qDs96_3`<633rtsaW7U1a4_k<KRRtRfevxx+|rbtfL6<(aA4&>cd%
z;oM^-GSOFo)`zDzyd;Qdm>|RRlM6}sq)u<-Cp1;Wns#tksM9gUjG3$9kyLg(;t73)
zFNi-`@F-ArqgdT?Dl^=Tqm6eS@NRnt>)v6e650CkvVI)({E;LZqm*TYgPEWfrWf&9
z9ZkhN{|qHN#bu3sT4M%`Bsy*4ZrL=5FRG<IFmLT%ddBg=a;J41as^>5k6f!A%-y0l
zwF<W=tF6q3;s6)LGE0>9?t-Nhl&`39YX&lvY~u6DrP^g1w+``Esfcyz^?H#zj@{IT
z%a}!sQBOtl34z@JZk!uUzP#%*{4f@u=8wzKB-AVJn9Pvw;xuBSu~T=UpJQ#u#}<4Q
zBbEvg&?c3)^sI49M=W=kzn~jm)H*hPMC@6R*9qRTcj^KYvJ5kF>*{2DZ`{ru-i#=Y
zV&2r;+8s)hlbCg}g-jtg#l1mad6b*37`4?fOeh5+U&sL6ODtMdM3$MYM|Hd&P9K+`
zJqTuww18R((Ebf`k>Yw9h7M46EGD*=!6IKZ6Q_`P;cyuALlA0U8Wh(f3a7c_(cX0K
zK!A;zfoR#`C|N$oP24ujeVBU|+H$T68xROrqm^q_uj_{cv~P3IG{uH&@_D7pYvAfY
z;TcguCb9<+ux5VJ3qy4l$h{u2TgLv;V(tFQDJ^K>+q@=*j*Wy+pP^$u&~=;K<LXhX
zSak3%!h0dSf*^~dxeH`OH2I>u<`rl3d1mS`9jhPhMo9dl%L16j9tP9Bq96;D-i=)1
zP}(E)KH43>jjoViSBz{wlI!zRZ9~CI{ailkp~vGzu7ecv6lsK52kBA`yL9Cv_lXa9
zO`tR^7>^U@CPu5y5o>yXhUpq(o)wii)1&K468r}oD<g<Wy-n^6?y@4Yght7%_9ug8
z#39P0j`8P6i7yd{!s|_%q77|0ri9r{=<|nwg|UCtprFAXC!^HkGgCh9Ekeh-0bd5@
zyNs5~1g}3Gj#0tQW~>(Dh*VRsLAvojUZeCeDL2eDY(E&FT?k7}E&V=~@@COn)Irxx
z8PauALD?V=%^L*w(E3J1l3%2*a~Dh{c1l`M&-SKv3_4nD&|#WL`}bHN*{w$w22i`S
zpx;+9EJdrBXT?N;-_7Jy(}Pv+7M6I(*rc@@79!nUvEeD&`nv?kV5tMJ_KfAL`S$>#
zwNgJ><D`CtPYaGT?%8?zIJy=7CX`|Y8;8(lH96-#!x-jxomnrqm-uO$_}Yt6a8<H6
zs#D{WFZ{c{(8HUN9*4zL^jgNj()mg);0<Ro#1a%aX)y3$flXbS+PaRNtV&|*-z-ak
zmM&04PlcoiMa<y}dvD!aQf1rg>Ht%{DQP%M>qt#pwH_>1PkmoTdn{VLF<=aqa=OAc
zGsg0*N%kU59Yiv99P(9(Ei#emMP&FW`<s!5J>D#ByjQnc<NF?kD|9NDk8DXJn3MXp
zRA&11IwDI6n1T`Jk|b*y<LZ%U35@lBbv0ns;0t9X!*M0JCHG~R`TfjWx!>%dU(0kn
zNy(aysvxCDE*QHLYtRcJEly24Q>q*uZXuvP7EPV~nPx%_x3$XZj;z_)6+5B$asx|z
zE=J(x)QoT#P0n8mt-}V9EO}Nui01bZ+RBlARGyik_tINNtNF6FrEqV9HYRlBT_cE+
z)aO>p>y}4yY9*}H!ya`p$G+915KB+8o0LIcBRR}5bJB{)ll|U8U-iZc)>;rg5Mzdr
z<{1?jN((`~wA1F;c}JY1=6A6j{2eWg`uJcUGCJu<YN;1~w+(T>n3s}4j(fG*Q}e@K
z<?ovn4E32>V9IGywyI>apJel&=sCMn5)|c)Xs>{?qhL%0JD4!%%XY7r2|JgSdtT~#
zn)0Zk)^wsYkmcjYCuN=RAl8T1LTumGJa^7O`lc>pp4;ake^J*gCgGd@HVC`KG1GY7
zh25CKvuRGB^Sok!Hv_H5EH?agv-0Y&LzcL|O}k6+1-#c}c~Wji;fS<}W8Z`faLXGJ
zG+jyVdotCUv#L?n<QZ)(&95}8t+qOf)O64XJtfEq>|o&fzMf-qHG7_BZy1?at7T~c
z@v^ViKqIdPCX-WYcOAR>^!zV~T}_?A5HOwe2<_;;G(Nge!<)H#jVy0eDE#q}FSnhq
zf%O;G7853y1zdL;4*HjtIf$AIZ8P!B=R<A%BDMYeSwD<l6jekhj<k=cjW%$DPz-D(
zp7zJ2!j;gt;^WAU2x<+)#N(ItwywvhFfVeUq7}gT)FkZTwd#mf2p9d>ZD_zS_QE~Z
zbAv=Iy3#e63P%~e=&%5WtSSmi!XUy1Ig3CjJs%?FL@(k5|1)aiQ`=a@@|l<h<akbJ
zLE@>|wogqA4mSyEq$O1hS6hEQVlkK**VCBHLwh&MCJyh=+0t)63X_DDay{*CsGSe^
zYDV9XK%uVR4F|{zqI{s>`y-Wxo$mlN5ORI_z<Lf{ni~HFyVCM%XscVQeQ5lmqVdr1
zM=fHL(|PV=YygjMn4ngrRd1FXP_*30o6V<AO>{pGI;TE{@Ii9gDCxEtYT2rQ%~zhg
zm8`GH?5|Fc_EG!RLA2E%+JC_y+H(gn`)h9WnS6X}6;k8U%*dB470nt~d}czLs1<2E
zPqo2Ik$L?&uM2mb=y_de=XW9Jb#5&9QVvOQP7jM|n5jpYuN2U?MQ#F3bwa1Pl9H0r
z--HsKRav=`kZep<k6d#u%cN7u;~9h0R(p9B{;sVxn~#^5(IC}*g9fS3uu^Rr4_-9d
ztE<hGrGii{^c}@G=vNVWu_fL!lJeJyp1i19&eX*ID07zv@iSEwYnGr%NB|*E=+tbN
zRXKRj3YE-6v4Dh9AKc)v>svD8Lz*9kPX=E;Srv%Nxtgh&rN3-xfTp)G?Ivg160daG
zDzB?a;9w4843F<zt<E6ozGGh;S1ElExe<_SEn$2W#g5)|KxWN8p6|$FKzI8gDuB9E
zoS+zn7Y(WPGhA@?5+P?EzR%#~DJ1eMgY+J%Sj;^wx2A71d^B7b-Ei;*y6+@d6bW80
z45L{bV31c{VePLV;AlS3KNgLP{K2Wr2*Kh$nR)gwKCy(Rtg1YuIw58*`~tfbn>JeQ
zwST-qH)Xz{($udu#@G;g(J0ux(#NVvmo6i|-n!;(Yt6sp$W9;CdZF%mT+chE3u45Z
zKB{>{n(wG`ltwZow<*PtJkpR}umw0079MSeU_5EJ*I~{dKYr3)T5S@=a9_D3qjTAA
zthATgYioMEAby9`b+O(n@%OTtLT6}oucVCqT4<wvMV#tG@xo)z0W7yjrumB9&g08i
z%F<u$b47jZokzoQ$-e2OD1m(MR1`zpqUH^)8^)r04Gs)6CA!oZFX8XU<Luj$61@8X
z-=n2frCe&z`|`{3%c9L_>Pw~7GP=ycU&*s!apuy^g;jODSwl72!!@G`;TkaMMa$)&
zXxl#|t|h1Km(M#)Q!$E$5t3&GK`WxhkDdSlT$mb!16waTM{tC#jA)LgSiK?b0`xUN
zo2(JV^437QAmFfd1Ghr`;uq%Dg^xx#iW0R01~(eYsmkP*H*z}6F+Y?Fj!qsVi4YM6
zAT-0i=TU1{;(5kMz4knpIaDTnL(6=zUvORKb|dY_D<M&o5skb5i6l5nQUlBcV%t};
zw_<~4ZVb&#5^6ItLAP-Ky1rj|5ZcNZTvHm|L0!|m9JTRMaN5PyG=7`LQ#+U3JzaQ)
z@B3_zEVy+Xt@Jor|JHFd+BqZ1XZwFf4etcqDX-20+J_XYcVan9TW6yk!b#m0Xi%C-
znM4zRP%}IkYX1_Fn5rZwb4CPq)wO8@-Rt_|v^uIy>EcSNwxDXO%$u2fHL*|V{T7XS
zL3ruJAEA!;6mdAO?`UO-HgG&d8itBq!MsOooIhX#g+u=g&pJ3m#J-apemF~`5vaFE
z0uOJxDIx=A4uFF6d^Yug@tVk<r1&Q};+Ex4pC?XuI`tU*Zwdal><Bg_S3k$x;cbOc
z{5xrvUGkuqVmz}4H_{__p*cj5@Hw_|#k@_BBOeuJYdoyjOEv?=?He*`8Bdz%P9!jJ
zpfTib5*0N1A%>%%D?^9i34c|((!UXH*dUo1LBwcbD9a`jUEYRE-EJJA@Mp}PJX2I_
z{_}P%G+Mz}UNf$3s3?+Ymz%^vwQ8_8xX%tTH^E<X0?S(Y(r$(QeLn+uM!uYxlJ@7+
z45k;pRZfv0vN7qhizRiK8CkIwS8ECNVJiX;sxNZ&)+y(Xw)ocGUpalTBIa6V$Mf&i
z(~920zd|d^sZMt`_V>45ciwHkI@mba-a1@QWkf{1XO1S`wbsUenJYGikLGU1ZDb~N
zr3b$QT+xB!E!~ZhaZxH=m#-rGw_dD!&q#o5z3`6tU0c6vzd+%@Z+U*(^Ow-()|2QH
zlvq(`e!--Q6`fSkD5dYlQ^V5_;uyHlaBl~d?a#uB#U$U8MC0Y8kgeyg`uWak=losh
z?8rPN6n~NnL3R1XSAvMv)f}s*l9&ipCCn{a*`Q9z4ixnH_B%Z0>2q%ITK|f>yS%Hr
z8CJXI1|Z*hSCspA(764J1j&cq24>)63p_f;w41xq@>%BdBTlcHFMT4bPFp~Wj=Dt@
z!sLc{2LEn-%;QU2ZrVqJ3%nEoCP&OPM{FG>syF=*DyTI}9a^YH0m09^G=hVQ9$+2(
zLgnYuclNaFXvlY?{VsX9<7x2!X@aikv_+&*gFLCM-<8yxI<5QH@vvb7VRSzTcQ{V+
zjtFx;sH;sY$uOQYlhVh^C(_X9^XAs$Xd#`2M(kZMk&nyHA5KEDHgV#EB#{>3I3yg}
zx7Ea-6e!2g=U8m~5B0j~8y2%GJd<L1{>eut9{g_w{<r!cbMi6i;gR6<Rh;?zrsrag
z#(@0Ef@_SkQc6=9H0a@1pVOlL?2?)kxy$8_WOj8KT;7a+(Rlxb{DAh5ex8}1znW*T
z9Z0_I^_^{4bywj-?+~q^ZK+San;uLDydU`^^i0Q7y1vE{G+wiS%gK8=i_xjrpQ^l-
zs(~OFb$aN9LxQu#yKr!a6eHBsx@{|9GHQW3{b1nV+}&`=a{0NtkrdvI%xI{s&wV+R
zy-d^*tvbz%I^un$$mUrwI~0vqB;NZ-8vJ_YWtq;Ibn1CtNwxE|)xIlYsO)Iu;v9`&
zuT4Czh-w|d0gO(djw<<xm)dDmu|RDYt+COtqva#se4^nG-!7$qlF5OKn%ZK3wKBOS
ztYg9ifXohG^<3V3wP2&;AS#099^LlRl@g3p8V7^GPl9s2B8LgAqL*34PoGkxH3tRm
zy!7cMch5ALk?#m}|Ivb@ad(gO|8OMvS{ao<&sjp?!%D|~?T?e=U!R{;%FmgDOHaEp
zJkzlkW#X-QCzIlwf@a={hkT^CMt%b?7R(#Rj7S^1A!owlXz*${TuL5Y*TE`V!4uP3
zmUbJ(tR|jLt0@nNV*b62xeKIbZ-F^XB&-2iPfSt_>n1yi3~unI;hZxJi6a=h%)w6y
z>N%2-ayGjg>F}osAPB(;G3pV;P!Mr<e((BW((~iK)^I2P-VWOAVp?5m#dDH?PR2ZP
z<TWhETh0T$o(TwG{VOhhpDZG`0e?`fYY;g%*l6aq$O<V#0$@s(%tU@Fm?*9`PC8D-
z)>wBV&)ESYWrkY2{?z+%$`LBO@9V8o@5i@)%+gM0HjEotVm6Q3%wbRSPPKov_UfVc
zBU!=t6naNvpOU}H1J3XE`h11XkJ{su@7MuGvDs`|#hT`ys*%a~qFlO49QzQ%94Su{
zc2uZ~QT+85=J4!m_E<TyXm(fLP`>U`^Sb;}CGE!27=SYA;I(zoSH6Rmw@XbLV>cKb
zcEqjr%-qeSE&_h`V{$O_948pM1dB#zY{xW8jVs*;eOaIu20ttPmNEk@HjCc1I~vT5
zC}nk`A$9>(iQ#ek>TE+BXJ^<bXYEP?Kkl7NK)7y);}WWXOzK{Q&7%f{VmAeffr|bo
zw0Tec5HpMsHPY_KoI%w@nxl$9VTMtkEU4-XB-JXKd^CnP4NOT`ZO~;6Js0U7Zb8Lz
zDK?-^12b9<Z{Vq(L`C$xmD~^3fK2E{Wv!GjMxzT~Oj-=!^TGj9&5$BHlJ6Hs`BFW}
zw8mde_huAO)#p~7U2SF+_d~jEmq?X(MK}irMM8p=kK##LoRLSO^1E@u+@%Fell_+I
zPk|00o@a$3YK_t3I!JnP*u_S>5gF_CBiS@|3U*oa(hvO58HCBiy%oWH=_&!Vl&+^U
z>Ea%x_<K^;K4*2fIQf>NQZSBuCYA4}UmFx(s`07u$<8q@qnEI|^on{1EUp?oo!<SR
zJ0&k%9d|(Dr9!Em6b%E3mD-EObO1G`Nz99hwM}q@3@}=`*Xr$U%O{~W2h60x$UeDB
zzuGBmC#UHJu>#6WV{W+&mo@`nogVKBR!ZCJm5K6b$M>V)pep2ps6oiqQBxi|(xdM0
z=mAeNNEMHu-XT}xs5o!pXt>9v^ppaOj826t9<BV}<WfEKpIWQXiB3;}Gv&LKA2FAj
zz-2ayUHt5w!-0LAoK9pC5*0Yc*%(7*U!l?Kkd*aS?inPH=9e7W0#`X;XA|r$K#w|;
zh=N;<|13)Xil3`qv38E`f&hW=pW=e;z51`$?|1g$BZ2zlh6PLIbX7MLQt2=8BHHd>
zdzjnZP`g8175ewn&W5~ur=Q-0l)>y214Ezbi-T6vs}uUDf550Tm%Htr=PkFJt(Dc&
zru~F`3_rCim1P0)#-z0q^YAM50G9>ZS2>9|iIvw6&q6Gs({*XvmxmrBjRcUBYHMhY
z4A@{I6L2O8Iq#^LBnC7|9Z=bE?MYMybHPwrczBJ@w#r`f`nYvM2^eS+9J@`yaVXN(
zq0kY@`Q4IvXJI>kThZU_+a3NN2RISDFu7>0dpc+~9WPbyvsvslR$@LH9t_hx^x4sq
zcP72FI{R6jXnL#W@Wl5cFu0q%5|r6H^gfhtBQ#X{3&>3RmAe4?laL*1<=;hgBsTDT
z!h?@Yb_Q9pbF{bjj);zcN)sM_Z4)0u?W`MAn0$$!VZS_c-r3v<DRzK>Ve>EkDh;mW
zJW@k@_V9%wOY{#1@ouwoxb@@C*6xvfI<D92>N-+TN>|dO>~s)g4KOv*PUmRr!;#Yn
zi7Cx%649QVt~uWb|L9w5t@|Xfz6rLqS613~4Sx`xjlA}+ZLhRkmJgT^4M~(T7)Do-
zF%e=y7zy*!yf(;bg?<g>BI%)|1!CPI*=lhQXnLW7WmBisq4wn3x2ZOAFsVyphrB&Y
zz08S}Elc2B)_yrO>{;pK)uVE@yP2zBQ%g6PscLm)ZvC@a)z4<t{;ot>-$~nLaFlE=
za^81Vmy3Afq!lTqgIJ!iwwPb;%qoURT(r(Aql(TM-N&w=c<H!Vd*atlH)?NA+;PgO
zHhYFXc4aHfhM|tjc|Zhb2}r8COT(?m4XsrQ-O#cOqf)ls(0e+~-6Pa_V?np3ZRY8W
zL@)1brj}f*8fwaUmD|?8`yiiv5>pQ!diIf2k|U|i*^37^Y9dW^GD>8z1BXRz&kIJE
zVH}OnxS)_)n%sj<&x#uVEi6LmhmI8!M#GNFWwnsjSnbs$9SfiTDwpI{6kkx(8y#zp
z;)jNls&|Si9Ti_hiAoywt@0B0lEcCw&naOE#$jKg5}@qE0irw<^^t$lvanenH@br~
z4&%-Q%<Z5X-BZWDmrfWBlY){fMnrDXH?R8Z>wY)spx|C2W=pdSd{6G?FQ;p9mnYMq
z{f<vmF;q|#kAW)Cw$|(gs_4v?*6K^t;F<U&nE(t96XKOPsv5^s!7jQP(g$+)<OD`o
zxLaHVF)WLP1TZ5x3X^m5+la85M}3-Vyzy&k;k;bK|9ngy)$7-Fyng0i9}gd`!~gK9
z|A=m-;YYocM4$SD!KXfItUh(8D7chMrH^&IxP0{Ssv?hnHmggY%P(O#p>56mW(sJ^
z0dbLENCm$DQEBU%u3Xl24UpeN1zlT4@eLllxOP4ElxEs%F0D6Pl<Q`t`MBkYT5Zs;
zwd+guc3r!5@q9UpsR^^ErqBIsZuS;(P+?)od}aY)VcC6w`lyc|KQ%s`DHkAz*Gwii
z=syA2Y;&5{+w@^%?upg1u~Q(fOcKe|SL~w+uXLje+F5GS-C!bjob&a+cvkKGmY&q5
z)S>)^$ji7$g7Y%6B1Bf4NT>VTTaIMpk)OCYMTdW|%WOX)52*0~q<oCf$!f!BYTWkv
zSwkA}gNB2LlV9--9VO00$MeMGHrA|joo@>9ykZ|LWVACNM!I4;kc<Qnt^aSwevu&F
z#6j@t@U_=!)|(z2*^{Y1kfgCB>GJS<)0qC^8&YP=$*-g=oi7SYohF@rgb!G{l-wkZ
z)1<*4<PV<w^`6K=0>arX4}q&(Yc^Mf647(Z$LIE{hc8a?AG~cYt@ur$UEbprZ)piW
zwwldlZ*%WwZ+FwX9AO-O++?`CxY1xG>q^p$>Mbbr)~j*QjTAvBHLnTn)nCGS`VYSN
zm_VEEOZroSmOt%o?qS8<%}=|#oA5;4fERN}%3r_Zt*edF!ir<K5#)&tUl1xtA?W;I
zK{?%F{f0Ei08&7$zxjXI!#AkKf%0jzt_e88?UdpV+C?OGK5b*Q%Ipd}HHPcH_QtY=
zW}+oP7=ZL3SlBodpil`0b`Ur}?Krv}6x*%VED|H-Dab)4hA&dNvxpjxywhMJ_i_#>
zI#B$AqI>GLgYHG#`$Hq*f0w@h;7N6Fk4R@Xi@7doEt7(&`D(1^8q12>&G2$|j9AKM
z$0ADAQ@?EC#Pa&Ja92RUpOU<++Kpt)UuEpJSt3mqhJ{RBMf2`jSKCOzFB39SW-tcI
z8Dakvjuv`<j0LK)JF99RR#mT0?0}dX=$+bUrw|~cY)C<QFZvvI-5+QrV~JyQ3*PFu
zre-9#NziMfXiG-7te;amPd-Yoqvm(Xy4S4QQ@emBJ@)#j`H)H^qZ+%&ym@pwmp7yI
zBIE2dXIeRlG+U~i#r{x*p6Ow>(}e0a>-C|3-5K{dXK#noDUqE%2UjO<BEW!>a=(x3
z!XXAi^fBcaCaFt%APi@i#ZoRKFlg_D?~{AckVB1#+77!%5TuI|xn7B2P`E>3DbtdW
z62GqbvlO(FH9e%;d1>Q19Qr0{6ba&^8xw=Yxnb^krHkMuDSeM&EtAiV>|~uS<6hZ2
zo2V|}jxxP*i#^q{b<UzIyBq3$Rl%q_$CQ|X=0;NoT%(vpj{1|t<XmeJyj4D!D)TU}
zR+|K3ED2l?(0Kf1B_;2j<3jf95}i(Aw_{AxN(;dFvYj;t7@A}t`KjrJobO}4YNdJr
ziZ14DSFu0#W5PS1+%JMj*dt7Z69l>*T%&DgI2qh9i-awrr6f!YH`ppa($DC7{=HWs
zR)~41iq}%UAu`XFI&F=#X#kKH!r=%gU@>BuqG5<#k87i_iw9Njd^);F_^=EwVRxd!
zujj|GN9gtq_CnpbMy2UAo3L2c>w#_UkoL~jt0T+u$Sg(C;aF&qXxXOSWD?8tRBMk_
z;8ne>&iAG%K@i%h673X(>~{--EDx_ps|=mx$F|i%&(q;N*w<)E{`t(@o}Sv;Zrh-g
z%GI8GW_4{XsM4QV%lp_}UhivX=P#QYTv7?B``1j)?3qC$npjPb-9g$}x{tKCtZt^d
zMr6|N!P6NHw{si5#~w-Tj)how7<-2=h@Bj~wewQ^Yso3z%-^4!_QTWDe=$A9CQ}5p
z_H_gmA$}W*+Ku8ky0S<r!^y*!EN)l}AuCX`DQAXi;-E9M;r^sE4W^w2GnYt^8aPD)
z0PG8oNQTkmI(r|w|7hmcm-WR$IR3V2CzmLg#q++&yv&;vBq-fGlh1#}w9J_khf?Z^
zksXsBt3@%p`CWFp_w;_fYUlUrt{dYvqKWZ^dNC)@@c)G*6Iz{N&i$XlYnC6i{*xF?
z2J<sVIF(c(eO9sHG?RTrFvh&Tl&DA=Ge$bTR$$tO6(rsHgJG25E!rhoH^F~S2NaS@
zMX00xRV5igPwTC)T>(Y0sVL;$HBPM`4{qxB!&3__G@Z$z+cw2W@nh+)bGfnBEtHX$
z(cylcJ<sLLV&zgGyOUqvdwX&<!75AkjFqau)nHPy%E`i&4E~adx|ON?UoutsGnV3o
zt#N-_-uH`!nn$y@*t<igg(Ll&lTur2cT|Wqq`gv2GN;-Wh)J6Mj(cK|;@TzZ46Hg2
z6lN_T#f#R=Od>IGSIL*O9@q1ZB5&wRJXi13PcU&7fx!T3Q9QA3@j1R{7<)Q1veI7x
zkq*z!>BvF)RHi_f1-=2h^wBrarh*0{U29ooP$LF?I*jma7*bx<px|7jIkpO9oQvdf
z07KR(_?)tiHjK4ktca6gCunQwc53k|94%I{W0*yZg7sc<25SOhTQvYGpw2H~9~Q5~
z_XDilOYD@9>NKR8D{y>b?pxUJ4+6)6Rb4YAK`<mg7(a}y>&LQa@qS>Fh!QOlGBjRq
zI7TMyvuA1AQ0rYL+YH7ZSmb6cp#4eV8qwbn&kWb#va7%@bZalrE}204^!(ZT;ZH))
z&$fyfUMTxCc!Yu~6P%;#<xef^lh*Rex3=}o+%EAqG<23-`#uTyhC(Yx!&BxVF!+Xs
zKt(#HZ@HHhlI2Vj7pIcrAZrcMDU`aoLR(*DSA&a0N?)`Sr@U+`DX4Xk!uGkeImsdJ
z*i3?`yit`*&g)upt=~x3CH8xQp>TO4I;8;7>B<LsqUQV=(v;&gxD)OYJ3ps^VDdg3
z(Id*{m;U;~go*XM%;#FoHFqOZA^?`@0r1{{af84$g87^~N_TSXK{C!gd(MM&%Q<6A
zfq0(j_){-kCN)s^>+Er+pzttNSKU$4g~CM;j1%hwAsQ?0i@8gO*!6>s_(C*BW#g1U
z{6Z{=c3EUttMuWuxhn8*r)#|Y?6C_&FDOwP>2c2u+>^7$sp=Yy@%Yl0oV=Cc)lsCf
zi>qB&b?*MuwT@h{RjmzG)u*JnHB(2p&aFy^I5w>|u9<ez8ObKkKA0FRmJe~ed-@2c
z&*?MVSe3dbJ2je?xAe*Gp7>1mNEoMsWSia112`RS?AR`xyz@_i{#hJmW#muQE!P|4
zZJ^H1Hdz-bOL#QpNCHbPY)e#?ltrcfRMeqsa{QchDReP7E#iMS>AwNxzQZ}w{=Q7h
zXSUNB_q#=X2HmM^Tt%sRZ|PmFAHW2h4T9n=eU+KqKJ~0gfP)s#d&~=mq^hqxtdkqy
zu!d+V1h1<)Whg-y4RN;5f(fM(B%?`^?_j%^w5<!Ge!@YF@y?J&%u(`_vI_jijg;n$
z4Ze(v$O#v{7l2Whoe|pdwO{<bRV+KXZUDChvwsHuYImo^1J^sPs?ayJ%hVRLCdkZ=
zR||_YEMSHE(;fyS*47;o@t@c{blMohk8m`ePHaA~%G}-vc4jd4fk%rZI|W9fzDi(5
ziRUGQF3dMfdAL+Y2c6tP8-`K(ZsI#}zV!{K`p&yvE`kY!m`#*ANY=`nMg;Rs3<5Oa
zr2}47R!%#TyLgadXE8dpiry}>BeCd>+jf}fTWD^$z!E-T)CjMFDQ&5b%%YwT#DxX;
z)lnT$?nq2yZ?GDOAp<g~Le@UB(kfHJXxMS3jQe4Qsjhdnu~|3$D;xb0S+KxsKu$yy
zdu~{XrP*rCOh(z}!->+zSV%@#E_euRuh}%rD*}IwN1rFLHoen<f5!5QF>jHb#EzD=
zP{GXZ88=om6|X<%0p!cT`Ag$b9(1yvrdT^xAu{C=^J*D4K-XNuXC?eyaMo0bjp>M>
z^okRs1SAG7S`93ENhJG&Z4?l};$VQ=@<v6Dr)(>n<TD%%h+Wl`3D>(IzG54%Umt88
z9&Q~1wRs`p^<+3EV;sN+*KsWK*>)i_EV-7-OF+PCHFd<oBbB9Da57FeO~z?`47ypT
zZFCV09)+Dt`90AFM-h&&hgN5?dA;bdC%onFG{X+4RQx_+vvKYP$TADzNm*O}aA7@X
zro7GJ*i{XqlV@&|x2xv0;#9EhV3Ze%u9IC6GXP!{lQmXtot{5ogZb1VOR>3iX&*hq
zFgNZ&odq@<8f^?h%EMoFUhTa*RDRRX?f{lf$WKKTa(uR%HH&aliSJ9O#rZ-};nS0?
zp?tBWBQFdZQlM1~j-Ypw@<vA7Bu;>gd+6N4Oj`PY<oRlRj9-2nE$EQ5DrSQQr;;Rk
zlvvTzU3faDzO+6fUED&)x-QN|HMGWd8%4WpEWz~O38f#zLm=T|28{`VY3r(U+Brfs
zO~vVb^hilw8Iw`B!?wNhy=|5C9DtxRAtkBVebfzGgJGul@EnNp8~Ke6@g-+ItV_nx
z5UIX(HgdjSXzX*&hKADCM&>{gsd-*}`Et<>Yz5pTs~mmBuF!Q*Vj@P_UB@;ot&Mzk
z5r~Tz7j%83J$RVm2)v1ZmarN!2H_%9@wCE8V$_F<n?nG=!a#er$jTCycMg2ba5|WT
zl*^&VA&PoRyB8){S(*UOskBY}G_gWAAOK$TafYGEhFyw+2Z9n>*Luh&4dE!{=9zm$
zDS0}HhJcuq(1$%_(b*aWBw&)VD_pLZvA#J+^f>{{?Pb^xRBDQV7<$YD3sp6<NtZVW
z05h8nF@2jq?1D_j8SbXBtes9(hpJ0f*W&dKG=l}PerW{MN~J###ivY54OvO#DpLu|
zX_H+cLxBK*PQzl6f*`{1+f{wS3yLbeBz9A&GlQUxbzcP&Ob~ZP=~B9+aPFgb8DC8$
z;V>NdF$EwTE+$p21Unr;ZO*VMsHL2!{#)bb$E}9sTenl!bE*{@BjqJK9TgtTMCb=|
zarr?iZI067?Z*@yi`Y-Vx*;Xo>pQ9d+OSf*q^vt7S2)Pes4}N4c>FFX8-?f%k<>YR
z-}39k)6L==sp_$b`H%r3kZpz1bVND?w337`XdSJu9v!k-_3{YTZLE#={DpV?eR85$
z9Owi{woy1L6+O&9&W)BezmpnYF1Lcm=Ya1j(DU>3)P%WaOWXj1M1{j)&<}k~50raK
zxNMA^dCE5ub;vAoqss{20kG}|*t&p-OdptMTLA={NWu+GVzhWYMV=gkq#@zxa{LAg
z7fKoZ`qS9i^xkFYLyL8#G;#^%U#d7_r8JCIqEDc9pR=lkXl&po7CCmnbl5fEIo97-
zgL;MMiiEfm!LL|1?D}`#|LN4$N*d9+aY*0-$1_JQtr3U$Djlcr#@gLtWl&l}cUdQN
zi@ppYwFnMbZbR($aclUWi5T!jM*3q{J~Dc$+Y@&P#`fVMxAn}<X|$_RWL@iY%&?TU
z*)fOyLCYkrvxH(fip^_eP~ms}R>ysQtae-RrQUic_QrQ-oTof;W<1e4CZgE5Z9V@C
z172D9qEOS0>8w~xbt6KvA`AqvIQ)JFPoyth($kW2ot2#_Cm^kaL*Xr=N$ikp#$5r*
zh)q04!jG3^V9z{RTX8Hz5U>?9=%V`nneMWT?>B=n9BR(=NCaYC;*OK#q*=ml(Y3++
zZaGIr8f{pC&RC=BDa3IV72g;ot>9rT9S$Hfd=o^?9NC)2sW@@w8@Ya!j(;tcPbweF
zm@u;!0sfX>f;@vq)@MeU_-sm6RhXJ2nF;9G@vqNboK#*=U8(GG(rnc2DfZD9Xb30;
z;n#YFyi~6qt*@6G3$2FZKp}usv=!`3!48nekmQUyio+rEWH%JO(qccvngBV*gqhn|
z?N*%AO=w{BT7NWg>H2wd*|#V0`&qM?p2I5fxux%8|GJz7MlnqEY{E2H^Lgu(s`=>4
zM9^?pu|<1^q{T2n$6YgAj4NiN4=k-p=Yxx+LJAt++TK;a@#&NE^<!P$=oQhILl;IR
z90$<j@RAOE6^x3);!roI<4phFkH+XdCG^O2Q0q&z6s`Mfw1YMk(;9G_l$o-Gf6Z%-
zwVHk{Az1C0rtsAYRk{-<y<jl#M?o}AOqf!gRh*AwkutP>1;v(>cxxVByCiaJ#F}j4
zj|6Qbf3I>&;slccXMpnuH-DhmL7D!}l_&wzx%KW1z*uT?ShpB|s~~Td_q3Ja+|G#1
zSt{`+k+L779urj$%={pNhnNOcoH9+AQqBOL3R23^NLyvJucTpeDN0L?XAgdDm%abm
z!h{1I4Bc{Qha~Y#EOD#CQdzXBCUglQbTr~fV0+!)k0SeK5ht(XMwcwO{;Ql58xBn5
zVQ~_yI^Ce>BXdHr9=qYFL2s4NT41L!V5)l)()+5Q!l?D46rIyVY?%7UdQren4ZQ4V
z$V{7BB&JT)S!Y%-TBeR9q0%vFB$Q~;>15HI{%>fVkQjoDaFKW=biEIJ6``KAhY4Q&
z06SUaoW=U80EM)&vAYOJ_ea@9^sG8cK{L9iM$M#p{F^(CwRd>{+tzhKCS?HrbAe<b
z{6_4Xb`<}053d`FJBL4qqouY<<z;sazIs2izN@Hf2e!V}#7o{d*xla!aoyYWQKr{B
zMC?sbs*yBfW-f}Fq10hbJ31jS@6Co;u1zvG&ct~JA_2_2+~_zY0XCf3<d&svPxr7V
zX=_O<N;&CEXfpe<%vr-Q#A^h*!Ng1#AST5q$E+v%)uZ?Wh9|b<KNLtfK`E+(&}u^B
zxj$6#3IfVkZ{kkMKt#`$v6O}(&zn25Yz-UTW2L+#yELU)@@<6=FzYJXg<NRh?P81q
zt$-o7^KmdrqG?Rw`YFeSQtMDc+cA++v|EDHN@e_gsJbLN(*4)3EW(>`re2}g13VPP
zwvB>Edy&$R$Xil{aSHE<qZG5zy3Ch*bw3*NojqdoXjsGNr+MX4SNvF9ztXj4&N&5-
zvgR8@MzR)>LpA}T2G>6A2?;bMI28L6ZIL5!nsSFB;ij-#{5XFQT=LY19b0@VcY^w3
zE_@X*He1hxj}rOs$B6EIaXG%Xp%?>7TsM|+`50eMiD?{K6UAf~f+j>x=cqV#OrL0Y
zoR#tl$$gC#);ZA~ViQSLuGJ&~B1(OR>p(m_HAgdsz;{k!+{(IQmG91Ds}+=kbQo#H
zHUJQr7k{Ge`#f(Cm;EZl%@e2lX+o=uJ!k<*g+C%wSF-NM=#xY-kewNM`x{4Z%XRnA
zKeFSI(tM{?KNLip7F3P61P~YO5tlisH(By1!vKnBf%o!!IO3WTkPxj>P`O6g13bTs
zS>yx{WZV?2tcxEITdaJ51mGEV;>G$itn{LeF@Die;VLkrg*{?Y3F6)>0WeBRH5J1Q
zy@;58BNQQrDBhGZZM!pn6=?pA?zxqLZmQc75fv6m#h6FvH(@a7)Ac{`B;-BM4CMA{
zfwzw6@^$;Zjs=7*)UCy#yBs?m7QVvpi(9)t{aLh^1a>IA=kQ{jtB$Lq*1J^w^lSO!
zf77dvTk9Z-RZpx~Eek6CdRtk_rS<u&Ag{54oUI_K4jWRv^t`uz+-Kv5MI*x09o~Zb
z!x`!4M2hEFXp7aws?0zt1SAhmN+XS3Z<L?PF~Ig}MXa{2;=vaQH9|Xjtq!9^%;2>h
zcOI)chPm0$^jO4PWts4bcF1{^vBV8lFYN1X<Si1EMUl0M3`hfp{(umXPQp^OH{{3E
zj%1jWlEuDicU_Y(p=P8Io#Vp5l&G_wR#uGTW}T@5NKRHyGCah=VxrUB(C;ciUqBKh
z2UnAjv5H~$D+^T}>q#8PD2+PT_fIE*Bpg7-JAwb6Ypxplq7+}hJ)H?+N|v5%J=Ggb
z`$`N;0Tcu%DyRz*5>hL;WcgDC^6hREsu%=OYN@+<g1jeH`69ttB=RL_Qr8|LO1@?q
zt#w>lrci|a2gT@Lfpkf>{27fXe(^A#qh)Gu*TRwDU+bcVU&9)Hcl@hg`(vZ_|C+TY
zje527yms=PT%{S8F`amw?4m}<3r+%S^QBrtJ;GvR@#DwEMV;d+-J#;5^JcO5)Y@?z
ztiu_2)rFwb2+K5D7fDXFvYuK}x=cAuz!YzdF7iw{o|>=Bx=4{=IA*1<9H&2%ZtgOm
zU?x2fG+|Q(eUpb6CTZdA-p*D-d@b!8YuHS{sr#(LdPwOg@bvS^aBAqGmMezc_;Vmg
z1xG2!26*4Y*F>@bhU#ux8FZFl-~&G{{lI;ezK|rAl+hgBis-8^*0`)5fy$rhgkG5o
z7lcg9z1Q6auWw+|<dXc1xL`9!xXW>tW^_R3*0HRgG+ZE5H_?>l5T`F3T?TMEpP_n?
z2#9LpbQ)u$RVvN57wa0Z3v$M5PdUqe{5Z3Orv^bmOYc%}_GoiE^;zL?5}tA50FHty
zD9r=`T{ufEgYT@2QQYA$aT1d{&EUtU^T3JQFdCvLgKzvF+8_%{<#Avf^7hh~nq7SX
z2m~WaP{qdr!;p*!iVJaY7F>@xTad*e583ba94I?0?eOkKMJ_5lv|6CkgCf*UuA&-9
zs;oex0}gk`abn*bR>>$)ew@%G<=<ES6#BbEJ#~tnSff`n$!AuAM7t)%3M%R>4sC`b
zp1v++J6SS2+ucEnvz)e4@$<7K(gtRDE_ReNRk5kV+bRni6}VQ}neFcU1?fJlT-OqT
z`{YsCE7kFTbtkr<cKyOASe}V`D~vNMs+?@o3%JKSW;hrvw4nOCja=(EN|KP&y{PBB
zGOih@h(GsZ%iKoeMtG`Wh+yG+7znB+IvH(yUK)fK7@40teHKM$Kn&5<DC(7!9z#J9
zn<@f!75EnzaNkdupCR5&L&ID{3QFCKX2jk~cy_Rip=lm7$hiN+Za28@1>=cQ?P?IB
zw^9~DqQ)6{qag~&&?PjTqG>K36}4*oEbM6roV<k8vpDl86qA=G2?)N2>MY>OdlxtB
z?2>SfSFIz`teRM*R{=+^Mj4Yxg0|h)8imw)B*vB9nNuJ;iTBTGFom;(dBbkNGy#p|
zVFYiZD`X$5lwynwmsIr%PsZS;;?xm|j}G1{`vP1AY@*?_?*#VI%&3Q99RkXMC*7ra
z!+5VG!n2teXOd&@RSd2e^Ie_>Gk5f6x-beuPi#iU1HZ>fV>A>N$(g~YNl{BoX5cg!
ziVuK}x&gvlJX#b9yH?XssK>ap)_55ypg2ngSAj$tNP($ZON;?3>BjvG5d56xZ`4=w
zY(*yE_QesFplTpz5u!KXJi8p|VU@+WjnSTzl(>Jip(1;HYdV5Pr4}JXqf@QPo7e%W
zt>_F06o)07)}J^Ard2)vAl_Yuc=g2vEmKL0CfPK~h?q_eUM)_~>UO%9Dn#dP9ZfWO
zunjqL^Z&9qZ`0FR=C~Pe1j~hA51^cB;GuWqORNjW#FJ1yW#XB&>(oGQv+uNwJAYP+
z7&h&6aeS7ECthc$jhnXb)DZ4q=c%L}XG+n><C&SH7saRc^qT|$T%1j$H7cRfN7#vm
zyBaCW4yi%r71r8V=rq^)()`O^SYywthUoAarlc15=57X!{J<o<BTG^-<VBWl9hihi
zZb)-Hm9Fq23vVzmDS}VuW-tsViDNzIca@i-c>jcSpG^6l99nTl8Gf63wa~I6JJ@~4
zTMlh+@NN1%?svbo)7UGw%LUuSad(II=|k_W%0edE6n37HgrLf-3%1mI?C4}VA{)x8
z@i4mJyu}YG2URzeea?y*#rahAWwKMvsuHM#YIygKN?}fjT-8aF&*-`c1z}3s0$aXW
zFXZVq`^XEBkui#zN-q9_4ffY;uKbE8DOHBkw#xJyOteizR=QGQM5L2MM~iH8S!B_R
z1uwi~_zKa>G%k|dmx^8(hwA5$Tpek|s9z_?WV|w96ZbF?U6b~Vjp+q$A(1l20fj4?
zEym3^md%mS$URp|JFz(U$ZE)S5Sqr;8#q%iD<iT6rdx+2wv>-ASg)g^SmCALD7q$&
z0iCijbng_yheutqA))csP62a);|tj*^C4bj;!CxP=-r973E~EdNqq5E=*QjnP@8=g
z!&AJ1d&q6q)i~H~l?QPAs(YC1k59Z3VobnM?W-Qy6hu*@>&L)lZS1}#5ZyXyO_&R<
zBXNR`-(b&G{%4~~F8Q=La1w$@iWkjzK;!vb);*$`OAQJ{n_dv~6HOs%r<}eA<;g@8
zV!|>Gcwa}S3Ys<-QVcIwf)gn0Yk(x8s9{%C2!jz{>nlj2@RkEeuFd--J}^w$Uo-{m
zZ$(DsWO2Y_qlG7YqHr;ZiWh@-E7?`3BQ66j0o0z-W!HFEa-XhOn5_@$)NF$o6P#uq
zA|D;Z-zfzDA1`_ME9&GQ)*B0de<(Qp?K0U~p#|uDUZ@n;JKq%6lvQm;^GV;jv(Ho3
zHGed;!Uc>`Sv$!V>OFddABrl#5dcDsAI+mu1E39iG)mS{V<{bB4}9N^6Y~@ev_^bo
znU2k)oNBe_KZ-{q9U+d^m2Cq^VhZ|7$*XQ?0LjUTSiJZb;m2grvbrysOC96N8^y}%
zis_zKzyXFtG44ZA!6oJFdCgRUZ50I5C=54M9*%(lK~jI^->}2csk)S<fPf%DlA;24
zJ^)b`QU$(LR+B*esh!p}j_~UajnvNJDC?K~Fo}Stxg_(a=jaaX`c5l^$_rY61TYne
zfeB2R@Awp4*Z-Q7E5xr1qkbSv4O1vHs%JnKUlbW}Gh?!v6ibcV!D)6eukTVrhl=>J
z9#c2HPoCNX`MrSx8D~~0!`CU=U>`6N*c5jd^Jo9Gc&8y`Ktn~n{mFzB1+J>%K}i@S
zu;GlIO0$5<1oB2udK$pY*TkGCgFoCU6*%t6p`~Iu>ab#iEym~s(rc>Yo8fDjSmH+l
zzh89%NpaK;JfUfNw6lrU(9*44&ZLnilszNW6qenAr!<pZbW8}H)i2Hfl+&lz#s7$&
zJ@i(Y3q)%AV`PV{xn&$hsEA`&Ff_nz{}WNuSq+yBC&&h}PVT0WXH4%<%Bt}xY!$1r
z8jPhP<ektXYdTKlD-?^hGM^oUJUw5`Rg{jB@lVvfh=kpU42QyNWyPmmmD$js=P}r-
z#opxhF`<(YIC~%YII>v8i*+C;SAKlz)g!iCQ}R=Oh#h5gr``MM&elSDYl7z_6INi-
zBwVn^z(_5l<+g8Mg<BUVPG{_^@jLmf(H&69f>%`{gBwZKg@)6W;}pj7-OLN1nSx(|
z6$o?=vuMQ|LQMVPPvdafZD90OWDeJAtyLAA7QNpja36|WCV(Tzc*984(F$QHjtbgU
z#|dx~0kPf`0VH6fC(?T|99xkWlWPVGrdI8$MC?(_Eg)MoLRA`SP*DK~3?>=dKID)z
z-5Yhu%1Ul7Vn^0M3)QeU9bkZ3bvEFnKxHNKifNo`3Pf!ar#N=*J}rv@Z*j3IW=h^-
zXR(S!^_Ay)9TVA|^7T|k4lH+s#k3_J{ODkig3el6=ro^NtLbla!`Ct4A=F_E3~cr-
zMg(%-KAf49LUnK*%_CZmFwTk9McjEb%!F>6<s3#1(DzP*D?lp2D7_v)w05J32smu8
zgM#Extt&B_+@k>=%F!Sb%h~t-IStY2+xFJ>>Ar+yq{|=<Pj3)`uK2R!p}tkZWTz_D
zaY<c>g+wGVc61qq;H*9MTH0m?W7ea0r9Bf)s?IOUb$|(GqN~rA=1qcPdv=B*4^>fD
z<V{-j<gs;P`%z;J*kJOleUdV;Fu9}PKYIu3-uDT{<N6+BE~2Nkr(?EEhpBTeujQ&~
zNNH~$J+crl*G39T7$kIUq*8sf1}^S7gl^F5K1a5K9S)D!9*|(_x#_djNYzXADYa$N
zU$Z+Wvuz6OmV4zH!fDVv7m?U7e?BI)R{w>lWRpCDSLLdg_W>PIpK4%mn6cT?^L%Qk
zu`i36dBCCI|5xx-yfpp_JbjcxRO|e=ip@QQ;LKl7<uUosK7_0e{@)?=pKu6a!j*d-
zLQ8i)glb>4xtIRR&5Z;9zeDJoqtX{1LbshLOZPZY{=<>(Kl?-h335G^=H);8M6o*f
ze<#X+!ij=92y5rhJVuu9Bg?ezxuKW;%3X{j{J*2)o8!!kqvMVz#PYplj{i7(`j0sk
zUdQ33gxA!$z)0b@$(Q|u8#cwUBVNPbMk1LT8=+1|rmawnyE`lA4yGeTvyE*==6ERR
z8+EdpR?*fb(=jTpkNv9Gt$O|={7;RZS|<VuJKk|msbiYB<9}Y2eEH|CH2MEve)<2r
z6`%jllOo;nNmbX=#Wet3PpYjdkS)8Oq)|FG_2lmpZ$<ujDy@-SPhPb=4M3Gr4{iN0
zuU=C<w4`{em8z#>aHZyrj&PnhRzIhXLH0mNI1FnxADV>VL!%=xsufVSLfIHE)n~7e
zM*3#6!#zLksJYj#Ryu0+^eew}mvx*6{q(fMljnET8e0wCWwkTVTdG%2Y)}Rhq?GzJ
zA1AWVbv@H}^{Q<e)UW1ZPTtHYTuMVHtjdFKf$#Xvvg9wYpIu--yTC3aXMwqs)&k`%
zwJKw^gRcU2snd{J?sTOl1$Jnwv*r%bv?!mf<v$Ii^xc;~HNn<0=)c)TGboW=p<7Yn
z_7=_RWj<wbVkVjp8Ok}jvbPtd41KTWkgjsxIhfT#eLXNs0J#S+VrOiCFN|%3>yu{{
zLP>^x0*mlwWBc9KYvmU>J6zBH#^Is%9%OGmw`IEK`rH5g`}h6B_*ob%2QOh8{a~Cl
zeh=6IjG{cLAGIEZ`>2PbFK7ez+3M;t{%t*8Y1)7B-%|7O>fc(+t@i55%H#GDlxxH1
zmA`q-Z$8?be^a!I^t``KyMT|=IpuEo{=f9!!|!OFlk-Ahir(ENBm@t7{=|FsY-{gL
z;XS@YvHyox+q<u~4}M6ag!hai%e^S<aU41<EV)NMd9`!TTle;fDiHiSeO2)xJo8n7
zRk0(uAUZioNmY<sC;K{?o-V=Jc(|H$&4%Ao@oIFuys4Nmcc<Z?uiIw;5<J5OAXeba
zej2M|lUSn$LdFO_IJK1jM{Z@Vg``=ksanF-&aNZ2GFZ*@kIiT1Rf9=OcTguKoKp=g
zPg2$36*_c|IUvC7s=b~T8qG=!$02%;&s%^V+GQpA_4w1=+T*dRuWFCcrh{AnqdP&k
zzD`5feDvr(eHirh5Ylsfhsu~$)yr8Z^eE6<<qF+9!_fr>f8#jF^#X2Mkfs?epBI1N
zhaZXsw7lx**VZriRv;V4;zFwki&?OCZ@KV*wr$}79p25tgQrgmdjG=Lpm!d5#UE6c
zI`Rcza!Iv4O;LEGzw)Lu-!}Jl-)#S=KXd=g=lz4NH`^cdXWnk+vrs7YS@xCr{(9qR
z!!BSpktwsiyZP?@>n*z&ZyHnN-S#W{Gj9&_d1u4vMXzTKZ_~Uc9I!sUdAIT7q4_Kb
zY!%qwPZbdiwTgWB;1&@Sw7UM93wS?leK<PU=&0Y;P!ngM>Qg0!2(3bp_`UyQ-Tv4A
zo5TOr{qguRxQXKW&2aEFZQR2DwH`0EQv6@Dy}J5;{NKOgpU~@dZ}Cq$hdwVB3RZky
zWaftcBo42Mt@Cyce>ptb+FAE@ws(L0d3BkDzRmsj>)!R+YDa$W9R9Sq?)k$${Z3a}
zYMV;o>e{MR<(huosg*lG{i5E&cRGVQL>SlMC=N#Ceo2=OUoxC~L!8miZ_%&0FbcxQ
z@k*n`IL2Cg-dq1TOm33Z<&WP>3*Uc)llQ54KTTqK^F5aTo@$4uD!3EP1qH+Oicn==
zV&}f0097RzU-{!s*o&hiI-Phwg$Z(%hm&bPjJ(!zz4`H{&5xJ8OFvEkLcQxxir)7K
zF~6Cy--F{A1~!U_wTOpa?I7uS7_I86cD1@(`yM9b``Q_>rSLz3kyqz%dXuSxmdk|#
zZIVvXi^K7RC#vfw=U%Pn713QEAr#%$^@b5W7VHJ!a@5RHo5AA?a^yx&IL#6E$&%kK
z%6B8#*R>1D({#uEKTrP0q1OEAb>k~(3=;Xrk5^{VfBfgtfB4#J{>@wY%69Mc@Bh!~
z|DD!f2tzG7|DrbLuYarkxSc-#TPv-{|9AfXEB-zF&Ql7YhnRMNR~kvHJoze0c-3R7
zN3nHLwxW0ma!bl7#K=GYL#uVL;+2Nsq%oa@g9g`16cW{w^KzZq+Kk3GoTZ`l<Vg!1
zFz{Y?$4@}AI0xZ)GD*B`s1#176N<NR1aiqJ8boI|RDU01zb71Llzfw_<V{@lD5x>~
z1<VG{r3<wsQ$s*;;?PG94x1|qv4YWjCK!{TAN8i@dQsv{dgEz~?(TRCj4s;HN0^Ec
zS}UU|4LW0=20>N3YjaejhgPbIo*v{VnuM4?dOQyNm|S0>H}KhHwf86NT_r%WRjE`+
ziKf-aGf>4f7Gpf6230l9Osu5MJN51QQJs9cReEOZTpu{YNl1?16rXxL?GC~o8Wch6
z=$kDr;(C&;Bo=yl)g&q3uqwu=jze_l!>a<!OQ(lY_f%KdeSH+AJarNio&>-o(-4SO
zIKUq1)YGcn)berIcMi$O>s0jdX1^#Qvk_`=JtlhsjCDO64=`XZfWpPT5p;$1VrL?3
ziICbegpr|RFn&}{q7jv65Wb2Ng#nu|W5z@8Hyq$1Hv=>3#nXY>Jec5&gAp+w(DNnj
zHE%{L6Cw<X4@O}FI7$WOe4((=)Y&7ule9gxgSCo#^y=`nhO2fqMsPr-lB^K`q88yZ
zM(p5eM6W%HkDw}JI5g@khAr|YA*O5c(GeWuv5AY7C~c{6N`bI<xR_`NCJzBxfgtDk
zdT;w^|6uP&if5172+EP3Ozhbwi;+nA%&ylYP{DG235SNb4qE~iGUnKbiFmP7=o_>K
z=||z@d2!)S)mH6uk=h?~lnK9^M1$!>XJ6%LpA6%ibEk8p5(-B_0dzgeT1p90>KLjI
z2Q<9I(P29~KT#{gOK7JzR&O`=>1}U}Z_j~r=?`yr_FnThd`+LDtC9J<_w%lNhS&7@
zEH+@@{&*me@ilzrxKZ-?@aSNhKhtaY91qpEgB|)158>_bq94Y30RMQseZXVD*En4h
z*dPhIb^^N_AVqmzESi@cKR&}3xX!&{A7Joo$VmB>9<<kdys{#rq)##=d8Urab3Ej_
z+-a`{JooU@Z6S$!ShAl?=ua4{&J;N0<gs^6`p)m3d)MB{Q&?D%kl5L~g=)|TwO-jX
zUFRh$Vv0_WjZ66vLsf*MY4G%E0jl)No@xv8F5XglSoU&fVxgUFXC{ycfv7oK&`5GW
zAZG|fP4<FDrTYO%%AQ%J1&wgG&DrF6rR-^>!KwR=_B<@ZClAk~#iRj+8jZ!@Zh_Qw
zAZeV;0oT0)IDm!Qo-hT_spt`^a6t^<Qh4wHv23BmukaciUP<`y9xy5+iXRzKI368|
z$6H!kMFJ&k7e?cOTI=vX#8n0CG@RErY7P~!K#o8t&FLifj}^H}u77~xWkyKeh+ON)
z@I|B4r6CaFLI*Tl!DzEt7&`SA+AKVf&Gvv&<Q{vqzPA7$P00sp8^JJTn$#O2C4~pj
z9DTr`On%5o4pee&4z9_mbl6iD&#&Twfbg&n)Zk<|E_&iAjbWyUdEyv6>RKuc6g)a=
zF~W{Ss#ICL0-6_!7TxvxUV-u*QxhfTpQedwtZd@cELIkQ*vs&xd@Z7xz(>FunF*!}
zG70YbcwE*^K~=<JygE2ZYKn1H;G;rG0iIp&KH0i4Q)@4{hABPaZsDR+)B(F1SwQM*
zy(;mVl4Q+b6YjI8a!9JQR>XkHSm@O4M^j`$C|o`V2vb!Pj*dO_Zzx&~h0W*##|~nJ
z#DPttmL4-vc$$pHZ)(TWME;f?9F0#lC{hCDr5|w0WOgD~2>}!$0cd!ohzK^$WTX}V
zB~jT2s!x+@ga7=xP_0*iwx~pWCJqxpw`SJdB6D;DG<6jYALD%?>H~lgGhw@tf9|~j
z1nxtxfO#5T$T|ZQn<YBD2*)sI6N*ZSY0!v?)cF^tq+!EjuFm`WJDgLRKmb(KdsY&N
zY`-~tzWAW9SilG10pL$<;ZO7NGjaiu`S=-m>O)+%<a{xam?mtj>0zk`r#-_090#dR
zkQcvSEFj-k^JJR;<o<lN=lX}n58wZAwkSV-{T_b9G)vnNH(o$S4B6f1i;L!{UwG)%
zfJ<$9Cmx;j4|FN0sh&SC{MiBs518Z%zRB#ELPdn3t<D4o7c`&bmd)8-`As*9Ov>j_
zT_NcU$hLZh_8~t0{qF@s78EbwQfp7@sjpP=DVuIlg6OBP7ZH#JhuMKyaQN%(a1=+7
z4@Z5yOMjSAn$;ivnhQrCEfi=61K6HLBEH5<FF3^82!r2RK~&uQa#U~>UDd70wz(D|
z#-2@?kiI>)$P&CVWGVl<w~%3AU=u*`2e=WO7JthYRWzLC6rXYrl1Oe*I~X=1-5|ig
zTrgGP5DAh=qDOF?bB6O0-g9{Nk-`~CDcr4<8C4};qi|xj<p}W>aKJtnvebA;#tjP#
zl;d-Ua(KoZJ5Fc*Q?Vd9EC;kB!$@x!i&@}}19Ld`iZKTT{FA@HHgD3`hoU)}kUl|7
zhmeLa<IZ75S-MYxm?P~>G4>y7l^ElwA}K}yC(#*#gPn9SfE#x9>O7+Grx<2c#e$NE
zI|ZGCh)pl~B(MQi*&|}84;l*1tU@nCeY>JjOBLtLie{neUq)2`gtY;memPm059l6r
z<+dK(nXu#nDzNjDLrDf272%W{*oS`Ipd?ALgmr@DYO7KAq!7uq8euaf3kB&!K@4>6
zssFu`{$GqglWF&hbj)-0|E=cg<JG0C{=fNu`u~5$KU@E=bNVrNN)bLqa+r2ixFu#Z
ziBoko`0ZM|*;)k-H3)zK6h-VCa<O6U^Y*9*$dCF#m~v#$uzao6sx_Av3rc6HlJcA)
z7^TmBs#E6>x{6Ytf-#T!4LAu{<IkE=iUB33Ks?l$pE3O8kDMLV+b3PN_b%)OqlB}M
z;+y20q)XA?&l<>6m3UAYu`a151YVUD=9uW0gdsjO%0#v)yMr-t)v8*RQWn!b>jCQA
z1Ltr)N_K<^=VfF~{poZ-I$IQ)w~yZLy+86cc7O4H-Z(he*gg8?sZnlUvbH#*+Qv|}
zaG-7-Y`%pW8?UzCZ6E!DXX~5oqus5;L+{Prfw$r9ZyX$LZ@z!Gap3L0KiJ<p+`=H8
zL7--qf<x!d?J2EJOyWBneF=~G7g$co!b+-CIQWC`63rO-P``D}@LV<?%@b=1NeG2Q
zuu3T+o}Eu7<Ml@4>guX~Hk#I>_^dHt5J}?&cV+|STM_yte~H{F&F@21#9idJ3{p-s
z7MrBD<`RupQELr+y5_Mro#^a2kFRJuHpH;N$jI8(cf#l{C@Z=3tP2_50@Nthoyv+x
zvLyCt<l83cpo$>9rRRYo4ywqqX!C1spLnmStn!Zm%&jX|wf0S^_~ZV&%cWwO761E`
z<QKqUx(>W>U|r2Ko}rq&`a#z5g}Oy_rq2*6s3{bTZ_ac8IE>!zr=}g#av)7RoQ}r>
zW-3kM#B5PqTbvXL{#<89kK^TsBWhN%A5-cym6Tj%P{WQ+VCG`JrMM0yws$XrHEkg@
zH+Lw5aiiFYi96@JCU`0|v;?%S7i6O$-NewN9AIC<_~~5C_H`CAiI_NEHqBW$sVDxW
zKN|VxdiTJ~tDxI>Ieso&0lawXKkp8rZihk=JUxAG_=OBzx8sL*tqe#idORY|*zaAy
zG$q1(196DXMzm^@=WBESJq;Y)JW12Uzc{Hh<~E|bI*$hC!vW?Rs3lKx1t@WaT2coL
zPWcwPqD#{rh0;#On6p)7aEb%DR~3aJ2f%i416zf))JiY8i<NvvlyOg}UKbg0W)l0H
z({&os5$r3EYswNOVV?cG#zYoSqZ<HjrKw3>#cn){0Ati*tEHGk6zX10DyEjg=<t+c
zitk&Aa$(+s5e4n<of88fce$b*98viFgnE$q#@sN7r+`%tVAVQDzwB?-b~bk3zuDM4
zdVjEWP}|$zI@mbc-u<z|#$`xD_#zv1M3Qof#P8sWe8Z=4jmYYJu>aUP*xh=U2c2(%
zui}Um0HkgriHZ(&l|SAY30~u=TZH05v*;)Q>y<{8)O}<h{k-^5d}c5|>G9tF(e~c%
z31Vz*=M9b)`hf%7c(=WASSW1HBT6VwK+}8UKwe<PW%jQ*uPPrK^-s|VvQ!w1B})L(
z7A!x(^2mDCi1*Uvi8^8uEEHoo8FWwBHK+b%)%Ds@_0=nOzOgG64rssN^#*UuyHNCE
zp&$@(9&v{nQi3Uh6z^Dunfn6XQ#tgfn9D>M8A&#ODyjwC>d-u&dz@TLuG@F_3W|Yx
z%9?uQudv>ia8fX6T(RfH!clzVef(`<7|7x-8urP`(t;J>u=L|Z>!>MbifB8Dz@x(R
z48%cCE;g-eO<X(&7e2|)3O-Fd9qm@oT~B%ufYDhc7f=Qvpx$Mso_x&KQqCo{^9p;2
zrEAhgDyFM>Whw(_^duS!Q?0UknT%#CCt^3ota7TdSAOu&dyl*YNY5iYz3Jvcr=@aB
zS28`qtU7Y8tCkm93pkLXE=l((2!q~KK!WxM6%9zm{lUN)fNU}4t|N&6%W2|D=UClo
zeWB$vp&Kxrw0dt{3i6Uaq$O{b?U4}ohBhX`zVJZ27k_7yVIB#BYn2IV#i>1sA~xYr
z)stEEsWZq_Nj`T@%r{X-;TdxNbbcUp+}zvQN8tsrd5=h>BH@Q#DI_f#+KqW{aSsAd
zG(@#mmNnotGF4%NbVc(5^9sCkH|Ru3&W-S|A4~Ph$8zms>G;>$Nu@^r{a9XTd~D-I
zG0&!|&-)0vUi;_h8nGDm-}Jf$bj<vKfy7bRH!u2OFrgF}>IIx=@EZ$!1ZeyYhBYu%
zrai2Hzws&mjWl|JM6H|jE9wQpych)&``wJ6f!_^v6-)%0L<8Ug5?!!2h^Bok<P=RN
zK$2>`b3aP(Rg|=A!H}jSo(wN)qv+C?4FEG<)00PUx_%O3s!2lodo4!`mjgi%!pkhz
zXf8}+&Juis25Zw1=8GDchGk^8fn_)g4b^E<IxaZ1Q0)j+P73Nm$;(C1dZpH=DKMmi
zgkp5NA$^kV_VA(iF2Ia4W^+hF9BD5>`p4#eWZlQ?1!Y)4UK-8l2#N|pHabiA`qny&
z`#~>ZtGwD$tJx$A2hMuu52U(jo;W#l7(K<P@-gPPo8JS9-f|TX7?fVbY|oQx$DA%x
zcF?-)Qr@2rYRPm|0n{v$QN})--@%EBcOrDQ56Cir*l4<;)Yg59)XO3906pLy)L_hX
zU=71D;d?C!{y7DZ^c-LY6h1=7y_Kal7dQ*~Z-fE|Zkh)*f5H_WFEyL=u%sUP!C>NZ
z3lZ!r*n(VnIy!DIEuSa=Q{We)A$<zF{1=ld(ost1YM5}V{uqZ!PlE|>QLGQE2uJgo
z>iDP^3yiCTy2D*xT2<X^$-{X#LHvPdf^ytyFHxTu;I-;2y}=yu@HZL)m(624!~eqC
z#XfNvlTdZ%92lvPO829|7_g1oIy)c0dSRY~+8Ieq2(~+<o>J){9He-QrKWX^IT>-R
z*9`4qGzC$QI^*B)vi0JqJMjMq2qR$gz<=HCi^ey+*4@E0Kpl)KTI-E2)VCz0ZuCNE
zpGJ8R;-9OaM}NXm7nsJ|n}FKWNm>26iWAk;<u#}8nq3u0Lp)6cwW)XV;?_EGzw6e4
z7jr6|htq4_2>!SV+E)Kp)hBpfxm?WvN)a)Vml|uUH4vHLzvCWRU}<P87PO^$`*P(g
z;Vq}&Eq^6EfKfkQu01(XGa}Wa#HlYO<?kiK_{w%KO}onG6~qBl>L?aGRO%-hDJ7~y
zdAa_zYjU~zZ)mlWTDkVuz?=3j2;LV1fPJp|1CQ<cSM>&%w(Fek!0Ry_YBdT^b{6~N
zbF1~Q>;B*dSk%_zH8lqO9VPI>DX`*xUU5FU-_)n^ByS}1dnQMw)jdfc1E<m4U8RfR
zlLKIE6T)#~`Zq)c1rh$y1k=Bt<n(s9x^@9aGBCRW01Gn!CB3{3NG&URMb-|m2ZSTH
zxPk^VA}*VUJjp}vK(j@Z9u`X&eWt#!A%lI8u~-H4KuoGos}T*+G`~;oC_2L+fVz=H
zKXQ*DT0zYjJ-{1RJbPExns{J-^8EIb3wiS6-uddXr=L3AK)%3<jFsqbfK+Jh#Qa=Y
zHP5TZkIkoX&tExSeSBg8VetHv0)#INDE#FBTU}0p8!jz%+I2OG7*AdJZ_rgQhV){1
z+#Q?*{1_Y$x+na2dEAz!@p%cJt#6Ny;lHYx%h;p;F17hZ*O$Kmyum*(Bz|!Us6bD>
z<!cm{)|x9V5}IgF^QV5Rc?s|OOZ;bm1^dakwR(Nc1%mbkyb8u43>g-l-kpYh<S<U-
zr6&Ess;3jxq4PE196kKI!hgqOU;eb}$IaG>{J^==PsgJx^<MS=Jh=AHA{j!s^cYKr
zYpe9<3IEY$!!dO;{AU|Oy3wnP7VyvXG~k&T=$RP|RbSx&*9rc_@`t!J*nUmwJMKgL
zv$iHUIrOjpi7&eNAI-TrKZrXVBHN9BgE9Sg;-3is;L<(*(+%Vy=&FZ-JPZO;y0vPa
z30?UC%380Z-XtK6m;EzUBo6Ho_{%L2uRP&Fn_q4LLOu1E{<Pe(D)Y}wktMgtQntuS
z(<y>KGew@bMN-`i6Q7n_KW9G1&gVF%z^YSVHB~?_0zGFw+Tih5w!o@WAPYX}wmkP|
zwn+TAb>XF7*v0I5%1qMadg+O09`&bDtJ&sS@U*11(lELX6+%wrZ!(7E<L6O7p&6&Y
zw14PH5$jP%XD0q>tG|Tt{3K0}0MBtiBd95R4K+S%@G6RFsQ72prw6rt$Ng~&dy9W@
z%ErIbe+1+>0-kS-`&*u9;q){0RDP-bHjbzAa1;AO5Vh$C2!g#!8X`R@G7=9SWA|dA
zl$75~9#O(e&QTU!KH<mq@`-PrX#DuRL}vj#EuY9+`P1bugTR6%KbC@lZixnkfAp&{
zA3pS#zw%SpJYK5Dwbg6&I0z>CF`U@IF4xqD%O~ckYaTCEVVS*&e;#2^Cm|m_@OMQ&
ztjNQv{9VHpoWzRKPrIl`P%C^1hlt020`<409@^?5(Qhu7q+XbWQ=$J?fkvt8HQamG
zy%sfoO`5`+7QLGUqePC<KZxl6vDVBoW-jlf)o;w&;UKeBc<`B`D>I6&WQwllmt0L3
z901Axg#Q8l;mJw14lP#A9f4GZbB;C;{5|ifr&e3P(N9UMjWaj81TGu553Ciy8Q)`~
zkeeMvrsXwgS&rH!A^GZw{9Jk|%`VYtKU`tbbV;1R)#?hZ(S=e~43kz4A3bsBsPG^`
zOgm$4Y;r!OgZw(_`GX)^8%m|7`1;JB<P^N?V7Z~7o7+^-P4`ub5Aur-(#0R5o)g*b
z-^RT~FZTK37}z%NHz~P@g%opMYL!Wsx|rw-5Mb=_HV=J_fTt(NY^+ggm)RmXiu+zs
zU||9Y%-%{?+oMy;!5N%^5QOSVyhs6Y<3U*A4M*W(%IGgPcjCr9EP^xj(A(?&j)|K=
zl&6bE8V9=c+9C+`2%4$X;Qz|X(P(>=XO{5sw}sZn#dUq91;3rfKQ5B$SF4BnUJGxI
zj7QP~?$_;tQd&v^(WX{0!i|1rp{9l!M<d|quP9^iH%rK|U#zU!zeqN5Dl5>AaO1wR
zL1+QT0it9ayPW$DNQ(Rg1XfjH<5WC)JES4e(?CB_NtSIYy3S?HFHy8nFT1{e3g|5h
zIQk`sIQ%j}#$UZQO5om7lfEDKexIB?;b%CKbU_q}_@yX1=sEUpMwk3}(~or*P*$S1
zC@t~BK!XA~iCzVR>m*b!PnVh~@X&|T$4zb@r6+!frFS4f@!xBMDI`VFTau&nYY>q5
ztrn;BPY|Q*XB4UQZ!>2iR;i!3L#Y&sR{ZcpJy^9+z~Yzxv}YQHEcHB4D>SfH2t_UR
zjKUTbKsif43^dBK)Wsk0FlfqYpx!L4n#Y%I^{Dp~pCtTxZH;@2;u=37bH-07i|IOA
zYU6K~5NC>v6ZwcDn|>4=X0c5_TB9M+&Hg1DQi*TwCzjZ(0!oBS6+^MjF2!P;TZq_w
ztB|n&ZXwxjMx0B3MhVU-!XjO!*iyRKQeLr@W~vyAc9~*N(#0}eC!tK25fLv_AWjvD
za|^Ae3aw@eS&Js(UZ#NC6pMV>LaV7lc};<&=awSTFIx;{y;MOK|LmgfT;@z9N`Cq~
zi-G#{Fw~R{cqsKmLZA9YLLSu@!OuLKV+>_HeviVQd6L~DBA_k}xXkazJP{-n%F|L?
zZ*`Ik^$(B>E9OUNXd8)#RGS1ue)?Vh@SYv>W+E|AS7Vvbd_ZZ@{Uw9d(xa{#PxT{9
zkm{$%kW@{iNc{=qNPZ7|13x6IYP-aG9g=f;p+rIT1I0=ES!Py*OZ80BrTowUhd_A0
z4`!KA%ygjZpD1d|qf7$Jn!4s#aR4G(+Rt74$EEoJQm6R=a;F0fg-_?j<(esc`NV$i
z+CK#TC9iXGt#N{+QT-!SJOK%(>S@J#T+xrK`pF#3lW-6i(6PZbCAg~JD3DThl1$B0
z%RDCLv28tGE@>FPUVfHn)i081)sJgA!kNwHM-*}S363FiU~7?=zmd?ZM{`5yr$k^X
z@dpmPd=KU~eM?YfmiTNCbunUR?;IFnY4)Ddb-HzB7_1n2^4GU*t;HZZnTQxew%oeA
zTvGRyEYu^+R)<i?a1sQLy+i2k(%Nb_>1TTz!iSWs2j!%<OQgel%o<PpgBBLZ-cBYp
zc{}dOL*k#pSm0qg3a`h#-0PqwL(tH3W{+{g6hdL+JUq>j9#IPMhkfbvv>&P(UB5R?
zaw^dK)Oz^+2zYT8z_Z;2!b=6rjp<bPYXIv*cVNiyW~&n$EQNHH2`Lfj?^1JhZPt|;
zephvdFw7Z)7n$5$GK#gDtsuJ!Wm8kEmNWlSP%aAHOEzQA#b#U$b5jWL{PP?cAH_!g
zrsnV_xzu&SGr9o7zj=M3*+{JymgQN*r+$>P(5Y(Js#LRqAeu6m9L-b?2<-T>0zlS3
zvloy)=L}e?<!;1mO>0r(ym8Xjr4^+i#%6rU@b|n8fUnc@Ih{3nGWt=lr`J-x>ks@<
zFGqXCtc_ejOSS$D%(1FC@Ou{^>1Jz^{Ois&Ss11&<{=1Gy$`Bpfm^0XE^Ng>h23Ex
zZKlL0?MyA{eK!xE)-yG!_Xf8*3)<=z0DF={+~6gdekt0ER&xsZdcj#Qhx)r}NSaP8
zs49_}TdkL){p_{G2rjcLRHb%KrS@%=mhx&X-Ciw+w!+I>tL2aicsa8go7MfEH}}8K
zn|o6F<TS;~piH&lSXZR`1N@VRI`rOMy<l*v>ykm@bTpF|V+mb2O!yW`o`^vUCb55g
zn&h_3rO@)w0wMKH<r!7odO4&HUd|j?-zU=m{4?`(!jG!BHrvHYDH~p3l!pGb{9&<c
z7)n7YAXRcGBx!Hpv(*rp=C;Uq6n?@(4gn*<k*ndrCJ{2xX&7w<qkUHxZ3AO4!Sj1b
zZp6i~wwC_Q<vwztHBTyNJ6viV3g{OzW?Fr=8(+&if!Ex^>I_~|6%p}s4%1cpFzs8L
zs{i}hIOlFCT(K(*6JSNCq^dQ(Zqusb-#qjY@whu3DAuSOCD&H%iqx)9nHjTURksHj
ztTdaKAOz=Jps91s!TN<LDJJ8fn694JaRuO>=We=*?l2n7=4}mQPX$#a)Jtb;u)3Q5
zn<1raJC5{;_umly%;H|Stg4u_)(DUH4!78VCQ1VR!0%@)N)U&=B#9J7i4q0#^tuf&
zb8rdO)~>JsTuB~d${igk+&m*?Z_ZhdB0Yc1vY}^D-r?tRlUPQIpD#66nq<eWEtcJy
zti^9BBlbd`MKj$5oDXw09^Vn9>JAgT-Zh+CcdK~KCmh#Ync3pXycWr3eg<9Pk2xFe
zd`ueT83=Jcwu{YX|EZjdzf|LVJd;h=Rj`bybMb_%GU-3Ka%1cFtQBn9{d{uKPD8j@
zYR#xGqP<gn>9{?+!St*=xmZoLwtDaWK8C`NZ4ma0Iauq!ShK3H>6#C{H`^a}w$>@&
z(BMX2R8ieKfL+6z#uh=f9^rixwVnLlJYxCBYbQ^nynclDPnP)QlcjIdEt=!j(&}Rw
zv-9STbGDXRxwU()+}I}{8)apT&%l_Bm#hL&lA{1}I>U7K)YQqNikTWv%CLKAovFNj
z@J}9z<PxevWo`8`kCe_Z({}C0H3ezg;Fj-h^_>rH*@pI&uq;qXH2A84vd^O)Dx5V4
zW5y|jKNMfZkE&AbG9i`||J+HJi3L@CmK*TTavlLjCObL91HtihBd)auwfN{GQ1p&}
zlIH?^T-M*nwq2S`fUU$f^SBnGfuUwutO*~`C91K4$~#y1%3?kbhJFD?lE?N&(Qr7u
zle){+lIWT<54f+<!O+3V-fS~YUHYg>`)8vm+C2@I+DkdC6fGnECp)dfARgo?pqQtc
zPJ)Y^I<8||x-EV2ejNg6Jt9mRbek4d93rrwT`iY2b7T`K=2ps6$z@e8y0EDnp2q$#
zr?MRB#-UNFRI;8Q@T;;D?jEVXU*He&09S0Ol80Y&P>bmeRc-K9yM^rp@aw^)^raw+
zgdkeZ7+f6T9~oUQIz833;_-Q&)R`-c)ugztd>sbeD31ZeFPXYrT2)SRRpc(SPla@a
z)|agU)N2eUHERW68{LY_P(~HM%<ZQ>ajE#FDn0UhIU+Gx@1zVDp`fbMi-DKU6Tg<B
zPw+M87-cVhn5{dVHeA|NMaQZj2U*Z&Y<W<NgKnUtcbg)LyD<KFOd=>gt?8#Hd1D~_
zLtkj!l`G?}g+E%kL&t5t)SO$9+?D0RpT5pIJ7>b^T|Ulf8eT%dULiws#p8NdVc+W+
zW5sXzXSL!WE1r8`gV@|A)Mh=D&1|-_CwsQgQr;0iI?u-`mT+uwv3G42`22Wz<s`pe
zM$EM90Y2S4S<ORXw0A=XM}<#R)DW$^RpNrGv1pV`qI}5{*PAY#|EZc&g;nKojw&Aw
zV#wiKFLYGHd+lJDQ&xXdg_B@*Vf{@Pj^`AP-NMm$rO6gF(Rj7l%OihEa)>U}+2x21
zXv%}z!(*!++9^3u(B~s{o<zxV9u{OTpQxZzB8?RL7?DnD=FWx#e5NicN@iVqJ2%Tz
zOsasSCR&p(QvzY6nzJZ}10(&Hjfh5+8>8HibDu<V<7}3dtIb-<ui{t7-5lwG+40FF
z)P-{F<7sZKG8oH(Oej|H9%L3{N}qL=Cpju_bDFC%dC;iTeXsujn<pXh+hcT9xS;>6
z(m`|$Tp@~Lq2F7YryjS!z@|Y+SbvqhSp3QPfG$k<p_A9|)f`A6TAIjn+dPK$`@CM|
z!OCIO!^b)0_}XTL{#?i(HbLUaVB;s8j@;>A`SR(9dE>^pxm9H=#gmrX+Ul3L7KYrI
z%&z?-bid^f^edXqHA$hxxHrHYGBX}I#}5(NavtTilssehy&LzsL2glpd6x=2MOfuq
z-Jb|x$J;NQO!EAFj5%kfUnzr60x+kC@bL@!2y$;eI1qd@Jt7+<Z&vXyYTceA_%(l)
z$Ots2SME$HFmvXLs@%K3$*g-A3;*&p0xKEWV{CK+ai1)t@XuYe5V4W|@bUJ`A-e)e
zy!RA`<KZ#7M9k9OBw;WN^c7b;p&f{Sa<5U*+}KQ4vh;+E5tp9i-p0^-xAe6X&$XH1
z4^{=g{iL1O@tM|$NjJ}<&$g9!(T|Mf=hsL(%{@r^c?uluWdNTGY1@V*$kRyD><3yS
z8HAeY5yP$-m|@JmsBDg2H#whq;g+1Q<c%0!XZ9vqZReHDkQQTueHBxzlW>?sDh^Z*
z=cbAl(ov!qSn_xVhNrII+q%XyN9xD7>3&Yyv!zEzNJ%EKKgly|CEi)S7P1Nq?JCMf
z;OH!xhv-<~zT_*Jj&ewa$Q|&}Dh5>LmXg$Ov>{q@s^u(qezj#&ZE03(7jxQLn$=dO
zlGW03Zc8i+%x-Eqx2fD(c3b&ZFqvxZO$&|;*AV{9RNgyFbxY3_Ok&>o0XgnC^84|0
zG|E$UF@-R-FLMYYIy}rWYD;d0!(bBUSOBDGPuk>kvXrM37r)b)%}w%*?k01L?#P!S
zTV<|0wT>>TU|cUf$*0HU-{cYv_HvqCJaaxwV0CgPosGM$FBAoHjJqbt*C53pemIXO
zU`+vOO{u~-=Z@AsKdFhaI)LDWyo>dZIY=qKVa{%2Q}~;yrhP-@=6t!<VwGtRpK=tC
z@Yd2mS}yLF{&mjXDf+SW^Awhsc~&NF=}UdwU5>|<PnXy5|9Knobg9{@olbubCyBxh
zIgDm&@MfJ`@@uA<`YrWlFVC!sSF0;|9v!PIwX1&4EMKjmANg!ml0<tf<S5*(bMHgu
z-IHBY#3J@1%3+Dwzvvt~cXJgC)QthhE?_Ss4r73UukLw2f@de!ZonyPj?bH6j#VLg
zFU=w}<jzEVbhh3fS$~CasOvT7)N9VHhf9^CltTALOF?KB)CwRiNhvueC&!hwW7J|)
zd@IhIMCMkB<U>kot}_%66iSM2gQ#K}14=89R3%O#mK#PG2Rs^2;S{Vhirodlv>Ny}
z)h`!ZZO+h0x&=`-xm98r<~yLE?<$2^Rj|lhGzS`+ks5fHdG?Kl7?DhggdYn%lq~m@
z$O9e7dIMNZ4iWr%YZE6G!%6t)+=Y=bCNs{Elmv}_s`<xF%jyMrdgYLdlmpmZA`qFd
zLr#Ptavsf-{y`eakr%u>M+&-~N1~Vu*<u`u0sk8fwIUw9ee*60(0E)2>$MBFnkzY=
zCHO<S27JfMwDA@G*YDNfX~ub=Jbq{mx!QPU4W-4hD^=92GHzK3dLwq5q`W?ZIPm*7
zH9KWc-|>G`L81R8!BA8rN=3PxOh$@E+3_izSlhFMQC4dG@C+p0!MzU)saLNwV6T|t
z0x9@#81*p{_I*L>ngF!dway^r6`P93X^*j{vbE$!>C8k6uNQQV-6-L#kHw-&u<Kmb
zs;mu+8AR``ghM*l&;tpU&I!jcK(0jU>9bQVV}_loh+=vwL8!thwrOJQQdKLv8AjyM
zxykAn@Om0YvAD*u{~Q07SyQml?oB_}=f+t5q>6oFx$ct{lb64!wo(FIExC-BP0U_P
zvPb6N8k4NJU+eAZl_~)OMuS9+`F+#HK54nc^iM65-@^&AT&6Qqj>(WPEe$1KQo-W^
z^$=wc1Qnu8Q2t;N#2C-@GVpfZA0ByIyRW_NU2nsyR4rnW%77#53WKbulgSCx8cw7&
zN(5N-{8P*ah~?wuI?o1ja%fyle{q{s#FQ!I80%zpPfsXr$RpYQ+5RiF3b6C^3F9f_
z-yl(C6OLo=%kSRkf(zoR>jylrDmFkg-sWaU984Z>K<V#bI^t0E{WB?|kg;N6pW8i<
zf#{=?ZUSG72ma`ZTUI<{EBd)FKgcMEp4gg0x`+HI7miL-kkp4*9&}<0?r1zoPb1kV
z(AUdrU_0fBBnqBYbp4>GbD8hqWooDt@);lSy4Q4aJeVeG?f4;{@Zw+d3Okb@%4D*S
zJWrjZ?_l(Z)uVcASMP>^DQCQBFyE>u%zM~ZKL#P-@8l*^H@LWnbdxH{2>!62acDA1
z4icSeKT58pbIR@oC+1qAOEi@%3IoQdh?c~LfWfAz4u}X`R6kKbXvV*22n3(kD8XC`
zHUtpUxuRNbRH(`d1OcaRK$j9h;M4->ko)FG-0$))bP`RKzB#*+j-dG%BerCRP(VNo
zkPjp^3I+tj)YJ{bemIt?6>-r#uP)0-tVA%iRQeekSUT@a%}qK}b92l%vv)ndWXcq%
z{*MDihx!*XBDU*uYf?yaRZ`E2Y@hhthY67#*7sxe9kDb>b)G1N!ks9&2q%IOiXM*D
z+-OUm6wPt-)rhwtKSFcY`XxIY*1}0@Euw_sUkZS+KNzYF&DnUkdH4}b)9c6vlR{~M
zC6U6IDn~zX&KyDNewd_S5JNlkxnf@pdvv|Ze;yO;fU&zzb}XlZo75a!+(;+R{qTYj
zChnUFfsQ3oKaw;jL3$QO!KsuF<B6Jz^GKgdr_<hf68d<cV=R$jz`5aqdB^H4hbr?5
z|CCttvlv?HqcS|;fNNNsDyQt>N0VrQv=;o)vX-l<v`%H~#eC)j3Vf1UHq*p;LfA>q
zIU=qlB?%cWDU4<EaJjY?yVEU^?*;3xi8^(sXF}?Ux#CYx-2Ex*>)@c@)0_87_=~ep
zvf2!VQ)6UBBReJuc(j_i01)%%0t$ShcC49j^Is`e(0%Kao!`VvK9D(=m0P%6Dx;X)
zcDnZJ9cr(t+Dle#Az5m4{F8DA>Jn%lX9`%>a=6Gn!z9x$Q|lDCmB6Y;zpc;qC(U?I
zf(!lL82s|(L*56!7n(E*CJsprqnla@7Wk*0v75mFS!s*C=NGDg3F(t+t~XIf!X$Bo
z1HI`udzjqjE83{PCT&lBv<+nCqZv9pYawAj4w4|gl&D4yiJ_FA$YQV5Y3I_@Etr6X
zK4F)gJ#SC1BMME%W}(a-Lk$?SiMW-d9X4yoA>@8QaUr)6_^^~;<7QSJNzhCA^m>$K
zf@G4K5lTp$DVt8&xTsfJ$Xw2sYvm@4@9Bs7lJBTdQ=S?%*Ha_qj=@a4#!C}gruN6>
zFbdQM`k}F(L<9B7_Mj&td^5<9JrV>HS;wrE5t!_J;>DN?lCxd^R$KHWv!Myi3*P``
z>iH<Nm^7Tb>N}{AM3#l0QF3>+5hjYeMeCi-rY1?sG43y`FPs2in8Td}Y3S`VureC!
z^p2MS99gl~o5pc4nhb6*Dd#xxFk~4u9KlCXZ3JO#<raqbW6EO9$#}2)n`%a7?nQ}8
z2-nw86a>n6yc<y-c7GxX+81NYfE;qZ-${I9IE|u{G`PsJdMSZs0Zb7Ogko8e+G6^2
z%CLek0?9T>j0i@=Kx?3hHyz_$q>sTy@GG!WDh;*Wj29-DO3BY^rs|%Z_?y$tbfZhm
zc7GK@lSz1n3D|W$ap)-Lth>Dhysn@&DA+V$!Xm&M1(%qI6LW({tY#X+G)?M-nJUAC
z!@H^-WEty>r+Kd{aIQr0NYil=6I*pfs{MFaVHXpJDX_mL!7wz(l8$X=g%nhAj#3s}
z5_34)CmonK`$+{T%mJqY7Uq9i&Hs|2t=-_1gKP(01@9R=K%4lcF83V<hI7v?K{fS}
zX09h0hJ-Iv-&rlRtS5Q6x>k{>U7GTdpe)~&@q<1bNc&fB+5p6w#VN96!>4R`IqNhG
z#(5J>ITYPW>5n<J$T=Zzo-1gwjyZm5rn`Ec`Obvq7-<X8KSFj4u}=BFHGOstOA~6d
zk~1%@dP}$3)yGWNa77hnz10``p+AM)p`Imu5LWmaO&@Z?itDdefo7VWE9Ocn+hF=@
zbP>+@az57GGY&Bo+jT;@MkpjvQL8HwU$KIA75rOb23G8NITgz-Gl#vaU@}KN5l-Yg
z!09uMr)O5@BtK*xd&41|dTi0g45OOzl<O|hnCZyZP__S-%}VO8mQ5ke;>2_ZBSz^h
zH?q1v(yz}fW{2Da4IguvI6X*rU`c-^Yw+9|)VF9^_PQc*V)DKuXL@~6Yi!=LNoyX9
zSkc)wv-7J$uZuy5Cjr>yr=FnevFW%m$jxly3P`rOALtHG&z|42=9}Dg^EkvDib*`t
zX*h!;qEqkcTt476Az$n#d}!jcG6kr5U0_s@34^!9!I<kPPJ}xSdlyt?5S@jb<J&4y
zU>@nYy5pUFM`ztvx{ibol-8A$8V>{@owxLY6dNMdx@GtdSeL*HfKPNC;FRL~dR?j;
zq`^?oQT?6n2b}K|!$N;&ec_w}I&_cuuFY|Eq3mEJa+@wemk>^g{+a!qZY!Mc%6DHE
z;VTxW%*bhjbo@q5Id9sG&_An$%A;tON1F@kGD>)y1tb4*LMaiQnrs=RYx?QgQn%%1
zU53f6%VP9Nz4ZEI;N4H^GjPN!-;6nf*4o0@)#}~(8oHP?WVbaI7-pmRn?*PZIaN`M
zh*B4lly?#Ca}<|Q2a>GAs{n+gb+6?2`?d2Zy6_gSVzlEv4F>_eNW4Xigj@q50;wyA
z3;GxSH=e9}MGBRSZ=Np}-4dsmMFxv}zkXBuzS$n)fBLCHFc2s~Rkz@=@HhKk8~}!3
zLFjO!AB>a6?*S&JiF%FhG#vC1KN^zw`)nE{$=~k(517a1<Hsxb7qd{>f8nXUvbwzd
zx7Kp2y}GjUxV^Oew`RNDgjZhk3);H(zbVeL=lyNkosK5cIpuEo{=f9!!|%LCHykyR
zb3l)c2?&T|k_Kt5F>JT8HBtHpwtji&dERC;zKO}=q4nfRyVh>DR=qcI5O{~tDe0xX
zH_>#|CoM+R+aC2muC!1Y%hy2WX|@*&1rd~RTj0GpUM+fwfO$%?H|BvSWCh^{j$XP-
zheNr6<}Oh`JiUPz0A`BO3|RUO;$fmRG(YaX_kILg9m7EOr`<u=^WKF$V0QvcML)(j
z$vIGf?hQ%o!OVd?^@5Oe6H0%$q?!<TRS+})MhQf6=ynVeI94lrXu3w1{;DQSq8c_Z
z=V!4$#F3i;V)}Ukd=96Ks52(42k27zsnh9zxDbHy^Y+o(z4u2RCZhd$<KSRp_vn|W
zI!rtTSw~3Wa6AZ6YvRYTKbn9{bPAPswhlJmLXC}A+wZoIenCO$&Gymm*5RS|X79k;
z@b)(jj<z@7zuP$Q_TL}u?;UOdhjSPNYGw-$XU#1cBcUMH4<>#%NO;V@z;cS#h%_p3
z&<n!LfTP5ZZ*E^RfZ-2NelzwlGKEi3<pW$<73g{3Jv*OF#_Ns7)zww~Y&5M$@mXWQ
zAd<!l?#u>axyqWWEo@jJGOrI+Q7!=p3n?cWixI7WeB)qzy}+Va8=+kiv<r1zU0>3R
z!!cSAVT%*OM{i>~iLg|aw!zQ`L?87A(?0D0LU%#g1QT`XzR)0O3s9q2cPcA_g=5%;
zJkdTPkaQ5%l@M}E&jVT}jXXHM=q3YZVGJ;Vr@(K#*OH(|B_9KrTUV}X?VD2Z$NhJg
zOT{uT#2(O+a701k@Qj=Q&cf*Tp@mn`<Q#xK^-yVnQwI~1;1!8SS!kiuD=54*fIU1>
z`|1}V8A{&At(Ta@<<wCan@spAh$MJg3%;C%lX~J``lFG5t`P@bUIpF8%kgt{9EOvp
z{`2l2>UPEh=+)EH=k`HK-Pj)lq#}ef7|>zTI}a$4+cPd$lUF}T8-S99!ceg&#f4_k
zzHzA5D~)P(@wY-@n)qkI^Ww+Cdwf{;7MkAi-u}_{-tI}Eus5BIMbYXa7bS9&6*9`?
zVX%mc98WRp8??X28bc@#WEFWB&#RqRy;|)&7>qsjZyX~JM^lLJMMp|}5R{)_dBcI|
z@<2kV2Lm5%>X2%~$->8jQ~wg{tEIBqbMI{IN`->}&ANabo^fi5yG(YmP!NbXmx#3X
z`gx@VeOi@aUT#Crdf`hBMA~lI6E6|!n!pj#<6VoS5w*S0N8XGH?N$_4q5ke(K~eRm
zB$g7<$9i8v-eG2NS)UgRNAV3~iD1B@q3Pj>*-t#nig<+Y`*A{f1BbW*1K6j9t8=7<
zwDlGqdbP8O*Yuux{Rmc>h1nL$vbe$y!hDjSY-Qk;3xamCFZ8+;0T^9*0Ef;%6pElE
zl&L2lv$Y7fu~9a*JI~al9al_O^U74_p?5fm#&XglDeVFJpw3-jB<JDj<f+$<1OGx-
z_E25<o~{r2XugX=J?z`Ms^pfgWO_7&eILq&k+i(fTEKx6J-iE2rRhRQ!Lh(t@JY7m
zqmBgaV%1`O_uOkfr7c!)8l6ND8{+%%*%Yrm5~o$UfkGV%h+|`KkzXuAC)!?X1@UBa
zvjdpddG&t#-D{jhR4f6S#2#79!mhGNbKSbl!3}|D7#^u~bV@bY<9<l&l8`mvHsnxZ
zj;aT{2-dGpvy9hf|D1+!0OGj`{B9KcfaG{+6S)B9st0p}r!Sy!73(Pe6L)1d7(`df
zoddgZ9{7C_1?gg_AHa!6ObITju{1sP0SAb@KJ?z=DHS72J-DfQzuA+q$TPs5Kyuyp
zetWxjc+}b4T&$x`DVYHKhg>cuA5~wF5$Ok~cr3D3iu(q_957Zm4r+E^^<@J4s}IBP
zK`(B2s5DcfWDIX*{sYZ+z!U*rP$(q9q|@tlV9R$%Fnqqq>s!S2#jC349~WLe^-A&3
ztDSlu7oZuQ()J6GD=!<P>0t2Gi-*uOf3-i9y}$pRG3Vogf>%URA#HpSP}!}mBBS0C
zU>^X4)AG-wo&DF_2hST&;WNDQ{=`Xn{#$7}^pgt@WL50W@B)#;tMvizxk96N_JRHt
z%XT}zVQJbmwGk30Bun~DU%h$iefB<mqPBEV;L~64?Qm)6fN5r7p(Y>kTe@F3S_E3Q
zfjaeT3k&lr;&juN{@IW5wt8I<0nQgdgrG+r5rK^<w7;zeEs6kJ15X^@HGuYJQyDyi
z{UF^_fD~o&a0&X;;qc};_N_sWxbm{r&x;H6s^0VDAyN-<Fpx)>Us0jj`>DDhd!!1l
z>7c1r%Z7#`OL6@a`s3*qP@#=yE%vw9^UmOZy|pJ^@5vKBwjOx6+e!;PuLl1gWqQ;r
zdj>H8N&b!lBpS+ASa$DVV7;O~7O=o+h<}k1<6lLKuZzy0ir#bY+JfqU97P>P7GbLb
zvq2*Y3#h_^!B@)ZKH$XAw+el9zsc-*qW|)cFG*1W@2QdA(cnD@`b@!q9`!*&Af6Lx
z;l3n#-#ffU75j)dPLXh59lpktTzEW_ZlQE`?*9?~Fp7Hhcse;lCzhZ;MXqYO)?BN#
zm&<rim3SkadX2h2nV=Gbnwz}>`x{4ZpD*Bl*Hsn5L*g9qHJw`TcQ<ynIy)PiZ?|{1
zkSNd?YQxl?|MbaoODau1zdhJ`x3zI-)sJV@S0&y0hrb*iZS9!qNvgW3FD2dTKW!Zx
zf;eF6U(RY?l~nb48x<G+w4r}4;_i7zc6Y!h<Nq3L-ns3_6PO1nkz{X(gTkW!j<>RO
zA99AKesxKq-6ItM@Jn4dm~O~2<J^z?WbpZJ`_<-ibUrUUKozRDkjA{i1325fXU}R|
zdvB~A44{>G{OlCy5fHMZe*OYq>r=AS>Ac^>20ERxw8SRQP%0QW<&<@zDQWB#AChg2
z=_$Mb&iu6S0D2_7{%yhKb+!zpu~q|E&a*fGR_RxSwWv*ms<30v&^+j=@qR*XXdQTX
zl)RBi3eQF)MFA<RnLDg52m&PjpwL0mz%|TC0z0gpUSL7r&+Dlb*S`fn%?rU8#tGso
z*LQ;n?BVswIwJ-D^h)SxQ1&LkC<c>6seDR&!G_lY&~M;K%3_QYkpU3aC-Fig)yZ^>
zs&o%ikF#q78p~I$-{d_|#d=m5_6|Tf#JsG4!1M<7AJQRWDpC1_HcD7O0oJW|&h%^R
z-5a}+ig!i5Pl5qvOQ&nW0cAUkIDa}ReOMq;S`@KTO1v&ei1-angRlyPrJRJ_a1c&z
zbbiE90-Pb55e?yZ@<(AZBw34FWILZ=MuYI0=ADp3X1^Z=WCes;sIZ5YQ?SQ+h!B2P
zSz_@e2UbNIs1+mP<4D(-{@}{LNs#a(UkMYV^U~Kb?nTm@44xPHFETafS9Q4<>0qk$
zV&Q><W}OWXMh#UOyW8NCvQ};+NX{1o?2IzgB)&^II_uRX>TiVyx#&;*VvMFrlsmnw
ztjeBqDs=&Z$Dt}zamr*$P+C`0Bsm}C7U|kWa!RbYK&+rcx==tl-tjsNr(Iog<qgtN
zDg7FJEMZN$Z~IuTR~D)tTU9nm1Y+io?gDAVpz4*6rJ(z<Od!StLkAl96MOY};ZFwo
zIpx~Srum*Jozs{zV!qg8E5to*M0d!C5YvA$!IYgsn}ig$fWqe>(5a11o}0ASH68Fu
zWSj^nB+SX_6c3RyZPSfc+x0tQP(awh1_+vNS>wgepV0K`6B<K&qBxqL02wNu$o%M&
z_{h&X{E$1OmFaY#_ni)`MdqxjIXmJb-iyjfQ~Rf?2QQg9dcc~DJyffLXzEQTNS#8U
zUMTs3Ji4{H_vQ`IbVFaus7vzeNK8tG6qoB7*g*hOH}d!!5i`C#K{~ws;iZ(*6NJO1
zBh`J)^M*{Ug)H{O$_IrMuLIP3<E<_%7ZCfi<lburJYoDCgJJ}Fb2P|ttnoBy1l@&3
zV-a^+H@w?MD=r{Fb(QR5?;&6wDT%r3UDzI|KW_*XS2nkNQ{sa}b$S}aWNexQ@qjfH
zoOX9|J_VKmIdCeMz@EU9Dh}ZQg)`}GbcN=g#FBwz77<^7rLpcs5RX8ZQra_1wMT&#
z&~25m0I&y`JY{+7)2TTPMYG_aRn@LZCN~4t^(r@w%py2^1kFDWpH@I7<@q93T}&^%
z`s&WU;#6!3*Ep_qPAJC&yzNa<BCmtY(5kl6t8qv-3Y+`yJ4e6lZ#jm+wSR0K>~6iQ
z?d@+JY#eRx{wPe+Iv?h8ofCtMGU_8I=1d>W#yK3Xz_H<Ls+8YM8a{G(s1bsx6LI@b
z!H3Vag+HSN2&&8kJOMU-hU3=OP*&Dok>jT@W_c$u(q&_l&c*9&ls+4?6)hIO()9eN
zI{_4WWZ1*odm-iT-VO0-y{#Yb*u(WcU4cUlihsO&SBw|!ZM{LiTGN$0&<3jb;NAxE
z5dC@Y3R5}%&IbzkHXirZcfvRYHx*e{JdkheVHVEJ{@o4WA^B|IallyA1wf(J*7pwI
zv;+hzk(@T!4sW?m;b>CQy<tL=@DKEwxdhztuP(gBKl#dPVd=ApWFam^_lB`-U?^&}
z(d&T_C_W9F6z0BavBcvfMj}MaPB*|D>z95=o>^W*aV=oTjTZ4VNAYxZS-XCK%+jCs
z^aX3{$&(cfdSr|cnB?I>!Co1vB8JxE?)3c|B>|BO!#EsEge0JPbWq*!i#VE|os<3?
zC5INBG*=QwiB<S40b-~PI7!g-vI(Sc<K6z-jgF$A_WY?)(+o0eDyP7&bXCU7?R_i(
zt6EkUHBk&)Z{uUDF~%c8_r^#HZhPjmDsKI>?3LQB=IU~}Xx3HfgSahqY+>R0%H4~<
z+uRV~s}20`+MSx923m6(2rgHg^7U1zu`#d8YJQ#l&6$<PJwILR@!e`Ywrf#K?YZM|
zT3O{*+VjV=>b6l|+k7RpW_Jy0t)*&hypvk5?o(^?gVcI`k6KSQq*4QZJ()YUCw5Jm
zjitHs=gh_9`V*-!uZ_n~93gDO+aJ|OhId2-Am6q3jja=v`zcdS*q3y{quB*d!(h<&
zY-0|o^C4Xa4ODbBV8DYo#Oq3sr@B5WRW5@8Rc+PV$Ymv75uS=9rYN0leb$)*0uXxJ
z-hu!8^?3iMqYo#{fKFnNNj6_^z4`I&_J953-Oldb{(m1F9=-qR=MTU9KhN*>`oZbh
zdHDOqU^t4#|BRE#^z!QZ=8xallOB~YTOYQMJh~MV9~V5%<Q(uXBaAaNp0dB*C>qt^
zK#BOO1!-}ePd~b@TLAfsZ)g|2rkslU@=cwO8@S>h;hg=Mz0f<mM@q>D@&rl|%1}O>
zEGFJI$9nK$pKRpdykKd744T58x4(C|{Q(4qE}t4NiSK5$AjY+V;%9-YR;RV<;}rs_
z+}O4S4g+4H5CcN^tcDXsw2A~pJtrHM!An_1Lf;yuEa7gttN>AFYn<yV&Gn_SQx#X8
zqKz!oSKP`Q=)zK2f4{r^p~Gs3&QI&WG8neR&R?gTD_mCQc*8$IFvok*$?;)wawn!n
z`_80b?F>&a;KaRP>6~6E_WiK2^rUG+P${omCwI5jAB~@O>^dr}xpK%&x3S!8=CPO5
z3VX^sd>hD72iu36mGxHrxY=r-K-Ew9l3gOKw|WKRA^ReV*Tj6r5)}dK9It0xKv$^2
zy~FhsP&Ip8+68lX(0<u$t-sx_z5meI+26;yKn4yE(4o$Ktw5%d)R0%i5L0&BaOE-$
z=k2;8KzFtev%e2__B*dPYw9&^T>l~nez+R<!=$-XzZ(0e-MW8TABF?3wB^UZA-<`5
z8y7*DBwJ;R3ebpK+}(b+RX2B&#otN|zIo%@JNK3euPV`7OkKdq(sJi(>aRF*iRve}
z2q}3`17uGEc7;Z@-iL|5)|it9e;KE?+UtYEml%<99ix-cE?qTfO1^(#Z-8M{W>n){
zj{Cb^S$~Xktv`iHn5g$knqUT1-%onA@o$=kq~^+Ars>DV)aU_Uy>cHYSn>MdbmZb;
zW=rF?Q4uck52;U<isaY&iDcol$BU7+-%48`xvZz==-eNClO`&56L?1Y{c$u1DzjUL
zT3_9AxV8#n?FPjud;dW<4zI6+QR=-Rdlb7@M>m^KLbwHYYyv(tvKcDg!}q(alfZV(
zT`SxB*>|jHmc+Vk61mvsGhl`5>M|;6L=(<2@LYo`=nGmp;B67Rv!TYe(|NbQy4>ji
zo&sCZ@&@5WK*kVQtgii<i3E_l5w%6vT&i0MQ;B0QZN2c_b1!S9aAI3Y;N3n=_~OIx
z6gVR2jz8?LE-yaijk0~%0j7KVh-OFLE%N2-V%ejMp9iJQ&At7j!{^1~EqZZPf%M`I
zWXq0#`z1t7uL~zB;crNsh(IwqsxqGuU%uroSyfcrQ2>bDDlk@6HlCAE!yw|0IgSFA
zvf_pk=Y<egK~{h3$9?1U5nTH{ya=Ii4qQgN9UvmG(*e{cmJi<yZp3DdE^Y}~4tdPX
z0uqqr`m9a7^eraFQr{E}#U*WC?cz5hwI2fK7bKNWhs$}o7-cPyR=50@KlVq!e|ztM
zMV<O*I)02+%%|eX&?NkZ-r`HO|9ZEWGj{Z3ymjEUMkjC7OO@;ypz<Uz<oUD-ir~2k
z2Nh}Kv?|nCtzZ{g|MVKcq}LcmlYUAig)ICeE-kE7Th*oV=SBD22f>1vgA9da+oiw%
zJ!Sf`WEM^>nzdp$-m>BhZX2b(Cs27J@}_-8HC}9o4V)(D<Lp#3IQTdYuJ1D4eASbL
zlPTL;l36x-I}#!1#7z=17B)1SbvxmP1&Z9kT!t|~LQ8bK(7AyP4^*IJJzt%Nfc6}J
zRH_!qeKMI8@y<^D2#OfC1|{T)<B;PU-I!E=;c*a%vUJXJ1_NOaq_%{7D7+#L3);ZA
zB1N=)r{4lZd};>B+S7WgJyS$a&?4Qu7SRx%eqvK^*y3K*Pc>XT+B+<I{QyQ8kQWbs
z)1yaUYnmoA4cHxk`wE0ewE!UQjnFVdTV)K$low!=LXvHfX>tSx+U7=NwloNaY_Bcz
zc^rVCg>Z!hw_oF!a$X<hY-0LO-m$j`DdhN`ZL#u~v{pIw2Y{n)d*-FpqIvl>?SVkz
zr&?35?6%aqyr$^e9hy4#`*0*UO{rIQQ|et_Q}pdFv*=Er+dw{Ob0Ko;ltJ-zq#F}p
zGBfjze%LknIv<V*-+7>%nCf?f#&Y@&6m|N9iM&vuf-pKD;4Rme^6I^RcXY7*A-5(6
zx|!ejPa7W;jEW6JvJKn`M!VT=u5Z5MUcfrFmzT_M1yIGdC*9In?2peW@b7InJ|_Lb
z`um;j{X@cVd4Yqc7-X}g19d_905yxxo_S;jsjVP2<J`kA!}z~~v5Q2Hlc;|F!t)vx
zI*aH`KP}Of$RwismP!NIceF*r2<jz#^5e5!6?Js6SAplt<CC)YXF-f0O;Ij}1<IbP
z_SC8Nl&Z0*q-B-qmCmDN(!m)Z`*i&pr)KL_IaL^M$bZ=<bH$&^c;xdSyi$?ygZ{%R
zneP+SFnk;pxm(Arld?$HrDpl5G26@s|I@+pt>7=?<u3#e?AP*A8Licn&8hX}wsv9D
z+@V?dE1o%}S_{8^E|8IGN;Fbt?8Zv<?|;Xd^b1<ij)@tzPG7eHN`5SH^aeC1<9oH=
z1P)s@bg=I8-<+lZxGLls=K`y|_+CBrKHF5lnvVG!ZAT&#t?wiK+S&NfaS5#=Ybt_~
z4z)W24D!xP>-+CGi?IWO6Qj=nu#4`2owvYB(=NAqgKEK>5s;3X+xmFd1_(?Cl~uPv
znU2!RaEzL?zWJf?{=@oXoAjE@?-afJaZW9m8X#ZGZXG?ZIht>&1v1US(wthU(_!PM
zFx=Z+$7nBFv-$c*=&%=))mb7Xh`^yi8%h-+UMizWxDt5w5B4^<4iEPZp66)kM1ir8
zDhe{pu(!6>YBs$S+_|$$w4g-cfuq<sM)#wQgCDn!I<K~OHx7R3Z0{az9lY7t-1>Zt
z^<dmMreJV-&ERza-&^ZmV{4Y8!c1iUjKbn%_Xw7@6|Z*bZZBt3DP0FwqUxj?!(^{B
zTS;qfch=S_>#sSSm*6<Ao_Yb~@u!0&2NNXrR~{k|Fv1;$1;JqAdr(UW1j;l4q23j}
zKD=hI2o&YF-~y9WhS&5V4fs8L{wb%|6ICm(1*o&UM3j>LvyMQr%>k>?%xlgo@d07@
zJJT3x%Uz~(JI()a9@VpuVu0OA4RMy%L%fuK>l@o2UalXv+9&nadb><A61?)-^>)35
z;wJxS!4D9n4vrf8oA^qpL{zRR3_#_vgr!_=ytD8!pqtz^?;J#Jx|u{XkkAa!bN^ZD
z&2>3O7L`^f`E9W%AQ!Pui>#-utgYe@+zT#FaLh6K9IdXux@?uE9bLQjH1UWMx>$y-
zt1msaU+uu0{$x=YDfFAZ^iW08rjhj-dugW5-$#y9pk*Wv>~@>(G@;w1@9bhK<rVI|
zu!jxd4%1##<_>3;MY85d^I6gdmS+wibc2z)cY22IIb<syj!G2I=}-I*DuKW2bm)BQ
zjC-XrhkC*hm57CT@L)WhB&DK#QwYOf0<2ppasevb<Y(b{5bhngo;+6NH)AXPAcsLQ
z*2{v|I_sJ4mY6Y<kCB=G<$KP5KJaDt1}#${ONA?f$H&VntB+4$dJ%8X%xU|zZB#W#
zpdVgs6FnZaTF9#%S|(-8{k8t7m4p(nVWH)b<r)mvhUZTv0ALHS=ugw+XYB>$?eG1(
zb+9;d0<aG0-+7GACZhL(5j^6|4jm+e@p%6J<RZ0q|Loxk)#FJ}N0%?}6D}?)USN>5
zH|y3wmtdeW4M~I9--SlA@wGc#4e5@X+oE9Z`lo1EcNkBAfn6r$?<Ylo*Oe~VCCen5
zFXut1<kokov6u=n)klMNGFH#DkTIdby1-(ynK{#Mzt66vvq*pXAc!d>$hvNannx`I
zPuQ!y!@L>8blH@zCUyC{|Dn--*=(-As_)eg>ly6|Rm(Z$p8(7T=2C)l6558LuD9yx
z%ID+knSDNnlV2|q=^b)lwP(P}teC31`gjeizum9BSEGNs|NaASfID5o)Q_95)MZS*
zE1^-{Q>#m@m!5+aZ})khvPxOopIO7R%3FmmQblnrhJh+Gad$WSSumj>2Ks)H?*@9E
z-gw$k!C!vM6hGV~swA5<b+@5Fu+K!N8%~mZ5bQMoy!z2$9tbsgZf|7vgy&yrFO~Ha
zuxSWRn8zLj`x_n96SX=`tHN5kLMx|2%T!ouJBwrQAgfB7+IV2~*&4p;Gk`>BcJu9e
zlU=s(<LYwe<CXrnxS09Kd;FnC*y^>Kbqa~C4I+3566BHmgXF^bPk}@CO_<uxS^b#|
z46W;YCI-0}*3@_%+Bb)L?+-S&T;^udhtq<bj;*&KW5WmGb&R?UvGz|YXt^D`xKoy{
zQN%NxZWt7LJOY+wisGawjgP4W=;fJ89@Vn&8)~W1lV6-yf(nKcqcwNYZ5_k(Ctj&2
zC<*))$1!-CU!j$%(3)QXkZt|;IdOW7^THe=^_f8et8TZ8=;k)e#g^LXVxv?sNtKW;
zmMZnx{2;X`=~us-H3Cwx@*w6w)r*<ihs@M}Ryb}HftvHh_p{9+vRrUFK8xC%7CVd}
zISRucu<fKk(JqX=q}^$m42v2>ZBoEYO$;1$$&8I!5br`&36DHZPKe$PzA||cmp0{H
zEwO?mv>rxh5->|`Do*CH9svaa4oDqbFBhbOV<4*@2uKVphE?9~Q`{co!8eMA0gwj@
zQm`&y6to356i2V;)txY`s@(GznR#fn>g}Z&aEbuv(d!M`3G*SENnm(dgC$<4Vj%Qs
z4oYP$ZIqo2`JXZbM`M*f92^Ce{c(objY28ab$r9jP1-mM#rSW;1hK}zny{IzE;U!0
z6*l`+4CEKx?&KaT4=C`tK2`q23DVSmF7bargbJ_qIj+PI1T@N7uCkVrgmwrAUT0@>
zb?qONePk3w(`0a?w5_6~oWxU(R_C4<unPo+ywghBUKC@9AgLY)36MBw`JA0qp&n96
zHVI2XphK!GHwH>anmWM#BpP*x1I#hEy$ae6Rn3EtInnM3p`GeO`_?|>(f_$sL|aRL
z=s2<_Q7@%EivpO%hzwv2MvAFx=@})>0d)7frd+KHT?;+9)1A<aF6Br<kBtar$yRGG
zj~_odu|H(2vU4OgscHjst2J}0Ri3<jSy|uN-)e;FVz~k$U(<e<1Bb%sr$t2^j&fo|
z<At$|M8C@!2PKPh!K_(ea+=Q6Al0c=!4bdMqY)%xG4eTaB4N$<M1YoB!;8!<!`$*&
z1=ko2UwY{GJ0ZJ`93%TNXMuI=ZMG`wo0z@inlC5NbDVyfw^+nn{kJ&TNsi`yvwb_L
zww^qUN^_I23*#w>nEt?zJASXnOcBpP5BL?QHQbW?#r=?;jm@Ry+xvoL%(#}8XAf*?
z?GDh^9B6B^q1~ZtPS56a>|o=U$}hE@{dH%>Z-(PqFZORFJ@j0ct&ep&;};tB4;bem
z1O0fT_Ww@UBW8{X{=C*c79Q9QB2<i?B7i@Z@!EXR-26eQo5pO%vBqr2v4#WW4r4ny
zbcZ#0()?!gcC@tR0$2W}b_>IcuWIA)r<U7Ba@qP810dh7&Ar3MaO_z90OZl7)Bo|8
zHt~it>7<;<csIOxto=@`573J@@Ba&g$@g^ktj(8)U*~G5V8T(WL5{xyq&oo(=9*O_
zFiUp{<KZboXfZ&s$NgDl8>*T2(D%>g7l2I1##m`)W^}pk&gs8@{NJQSck0-7`3okD
z4*OS!uNzD7SKL|DD^0a4>l;Zg81+ATTf=UE3j4+_o=W2$((v#Wdv)w|#cIm6#Ma?R
zZUvMFV<uN|7jS6foDL{*i%|)OnD{eQ_OppShQ2P^be)|{bf3^X8v1p+lv*os*qh(9
z(!8Q!W*h%n_*v8W5Ki=8e*AfR_m;))-JD&88Sl}Z?cE=LUR}PW?l2skU9DyuX{qvE
zsxGxNRbd<4RufpX%upps_flIKp=e4hl6vA5p>mNOnbD%06MoKWC%1dh&i-xV8s`j3
zys|A1nRHE!dw^{kOUS0jcuVIvO=uTILfa`asgtk=_=|VB!Dt$e0<4SyF1L18myc#4
z^&MN--mvxsDO~OW!1kg%URqu`0n(+My`QWQ@yfhj%YBX3+uBeh7eg*m2(q^7dY0?z
zG7oum!j#WFbYvf=cRKtlo$<FPz?3EIP&NpAAn4Nt>^Kf;cpsyko}yE4<LK{4-h0^K
zb>qU1AnxzJk1x>TM)~Qd5HB+??{B9n(+o`^s%l6QO(;*l{W7&M3cvD*)HsL0iRFQb
z&zN5`4#v6et=Z~d>pECj|8e)dwvSY~S$M&v(cB1j7U=46t#N{ZA*+kO>3%KziJ@vg
z-`1^aLn`L<s!`GX;%v_<k`Q4Wc9U!_P;;(A-Q9LzyWNpMwkDkJugAYOPAG>8vsT69
z^(oryub&k0nf#LA`L}x<erh6eSfw3I1%DgsGYm7Pw>}!G0#;JA<vZ~y9AYoGCjzX~
z4IFr>ur9jL*R({DwCqOM`CZwCH-1GuG{xg+P+YZjiNhqJm!5eIv@U8uDO7+c7x}H9
zR`7ayZYU!tvs#{2M#Tr(-`v1bx5O&KQjc#fwe{2L%uZQl9?$BO4nPEj)+)Kp=@>xF
zSw-F7`%}zDP#eeLr9TO37^n&@Yb1M{XCiwJ`t>BjB*i*N!@^6v2yco4&QlSqaerZS
z^w}nbcUkwiXI32zz~Wxe{YJ=(K{p&oGj2=Ft<=WBPG@W5)%G0&qGBs{NK{kZxre;h
z0JO@|?bZI~Vdtke`*(}en(mWS&RTchtydViG;8a9_qyk&soOStkuGE8dcVnn_u#0z
z10?@COl|{nxzzp!kb?Hbw;9=KeEDqvN%Hz{1B}k8+abX@H4ljYtq!Y;Ry6!JkcLa`
z_#5FQX1D)FkkGf!CYAUiJ$GMtAB?H^P9?q~Kc{;*^FuI5Cr2QMyLX+A<CmshyDxLz
z$*aNx=uJA5H#f#aD5uR=`E9<+Y4cUK%~vzp)Ggx2jAPuFCu;z3iz?K?b#dWO`2Cr}
zn^1%UePK!O^YO#Jz_gHLbvYP(8<fNNT<Q)i1ulwP7k2^?+msYWj}^bsju`v>ILLx>
zm3njQ<KXNqM3<lAT#6({Eq4Z+0qTInWY5usGIj9CpF^>{f*-)i9{=js{y3?uFS^Wa
z3ZFPE^`f`v)lS=r@!j8eT#>*~>b5es>xyyRShI_xIl;W*Y^JS?&ncVL?2X60y!jR3
z^^Q|K?#+a7$NH<wgB;w^y|9Gn`Eceyxf={bmdn&8p?BZvT*RPX4s?zJb~|h|uAc|@
z95t-pri<s_3eY$$P|%xiHI<VPBa3|#P?!E)mH=Z6%mE@AsITS0t|!4L@xRf)h%0>k
z%kK7v#&~kQzN`oy{P33RO%4^NT<Vko7v?e~#f`2gnE>K|;)Ml%JP1wlYtBqG3=(8)
zrejXoDoJTZQ9ls%AcYj890NBA`+z_>^<62?$yqN6{y7aslRW=o8jlsTZ)YFfCTK|S
zN8vRkX61OX(dlV&9z~>~M8|)fPVt-)M<yQTACVDYb&2(qP)I2c6UmeLC(T2<UZ;U?
zd;X9DtBs>1oP?JWdW}_H*oe`4MVPLKb0Og!L6xgh@+=C=Gl?h+cb!s?#zPLoMkz#b
z(DnB83fknDHU5NORv2D@-Jf~cfFa5hgtUKB&Q$IlHro0W+&)F6^A%-ulE^uf`Hk;Q
z7bOAM*3Ji-Yd7-|#SlwO0x(nu`-6eWcaYc9C~4P%VMZwo{rYfpSX-hfqK8L&`?v0Z
zWD<>YprEpxgMQu$fs5wANNxt?7<b!_R^{@fvYQcFy|h)}K<nKS#x_04zF&s-PRLW*
z7<$7)q1&P)5VXqc+iz@#Nk2;Zzn`V!k}?3kNLRfRgFSP-u6r>5-k<KuclH-psjWOF
zcOzi52Cl~>(6WoP!=#l3^cH;yY)SUqvihO*IP-UmTO+L*k;zzDCr2eiaDGOD^SFLp
z#neS3Buqrs@W){gW8|#Wx(*#`-5q~WqDS%99gYoFG=W4b%WJEZGMoCi>ckMfm^)y(
zL&`6?k}g^KRM`v$K^%?JO3H9m$_jrtf2+B3MXQ|B(%*sZQ~>ka%2ZD0endpz{KrY7
z*RA7J=_R)?&4eeZSAG(U#0Ke|^C0{-Z{>ltGYKLJ?9J=0lg-{+k9qwnIW<4g`W|r5
za_hpOUU?3^UBvWd5Ate+YfW6`l*2|A4`x(fR0vg9__64~qSR4YfGc+e=vB72?*wu6
z9$obI<LDkhXK&<Q<Sys!`+h0Mn;HZfbD{MvIE6DC4@J)0ZXJ5-j&%UJ4|DX?*Z=k7
z{=Q1Lw>a)CYVJb{0TV&d{V08(y3W%c*(!U+c;Mf7iGLbkB4<BIrb9~V3u~o=zphhg
zPqeRB!9ppY_0IdlBMfe*-Ccm`p%|bhx+t-Mrps8eNXJ0Y!{AL-jP^hVsXxAcWg^jX
z^ibf0!@kKOqQaE=UN4T4q(+J^&C<yY@T_wNueJvqQfw)G;Eg$?SjrC<gb31`I=8&x
z+G>+-nFnG)?9d$esLnEs$w7sYVKax(;RMr_0)D#={5MHs>i1#ZvtIm`4YcV&B4Bdq
zBxRSEW_}8jN$lG_p~-&eZS?!XQR;7!+cDvU<sQ2+-4NSN8PQ?&iP5q<GLK%PYtVa1
z!Dn?Ky$$d}v$DQ<wEY1O{>qAM2#oL;p2mPx#e#NLZnm0i#v7lh(Wij*FrXbpFydok
z1&)A~*3fZyo(o|IT6x)Ae_cZuEA^$6vvfc7yS0Ai3U+5zLdyJfyh3L;RpTQk_HcoJ
zT3xf0e2W}y&<-cFs8xH~`G@RCUcMxpYQjL8aGo!*zw<@_Ye1C0-pgtw?`^|<yUcO(
ztru%6?u)~JY%HhVygqEZFW&x`dhvLr*|Hjf(eEA7fwj13O#}vq#U$KeA89YlhZL$?
z$L;a2-buyd|4L*qoov!v{TfJc#5o3YdAe8UsN;J)vlw{J)keKoWSXUgKe<<*EoJMx
z7TAj$n~`&7PE#wlHDxcpS^G-PA|r-<%YkRQu)BG{ZMCWWo&AH2L;b>9;QG?+B}O>^
z)@A;eF7*AD`mT+QC&*8KWn=E`lq)OR?_lp%QZ(;A0wEIM=F%)XX#<mEy5{I!jt&w0
zw$sHKYW_QPheLGa0+Z++_kl+7@%A^<)0cW}OWUbW8G$>az`jE-4tI`UZJiuy1(iLu
z6zH@c<etYal!F~Ou3%sJqX`14RWfjrQSJg^#l!7;RY_L}l{sGu>1RtmiZwTRpwscg
zXYk*4k1Rf&lIQA=S*B!vYxijT{SH&w3P+m*NgN7$zioo774Q3#bMNiWz6Y{69H`Aj
z(#$pBMQ{p??gRykhrkp=g=YsL1~cu~cj~YF7+A+2dc7S#9Mm_1Q8G>HKkohX!scS9
z)K309rnXgO{msz_=9k`JFzp|M*dO%0x4~5a?VjVGAMi$R=*Jhqqz+=mi@GxY<ec8x
zw>)G=^lmV@!t8&@HcqCA8w2sBSL^?-tN_&=la$QwFaDp~#U$`Yr#~cD{a#&aVz=rx
ze?12xiS<8eb(6r{_osvUk1_Q7ha8w$oDlez*~~@v1f8CP3`8V{mGzB=ao;u+km4cV
zniOOdTqTwD-L0PwYbKe4wd11EO%2OLNh<lw0kR87{3;4xlo9K}vhig3<xn{c9aQX0
zHF~2S!<w_SG75TDTols<ct4BY*l{AU=sa;Dy9r+fucGVqSAhxmh|fBxAsmUgtw<X`
z^!p^fz6z?|{{ALqgsi7%Y&U@aPcP7`0A#|sZNPUFQt?l35RK+Ez$=>92Alx%njqoS
z1E?mTd|IxZ0rjmPUQ88O`f*RV=U6BAhRJ{~<XSlA)I9u9TV6kWzrS@*a}hqdUS>3z
zj)V9%j0Y$yGoY;83(D#YD698^@^}W6$M=G=HUrAq{h%Do0u$d0&c^1}3_yM_xH}}`
zZh(zA_s2=pzsb9q=RFZiiQ9am@*rhR@a_fjwI5%FDj<Ev+sfqE`t-?5e-%tG%(EgD
zbJ<i?G@g~(jt_gfg>>9Of~G=dJLA#;v&AP=JgI7fz-u+VR4%0Zrcip2lRt@Lt=uPp
z5;lJCBuZH6mPAS_geDfXlP#Oz$s9@yb$R8?6f@PLi-!jfWWKYdv=Imw#HOq$Vfa&r
z;heqV*a2rL9(o&;Uo*H4dQ)PrdOf7eK>aB=*^{bA*Ti0O4yPmE0{g&vq1u$|)4eQ(
z&%i5hkFo?{J|@qHWkfwMtf<Q6DVL$DY99@ZD4EkFiUvvD^EO5|>A=8vs;S;QhGR}u
z9{8AizQmiyYjNIZdRaylY#jV^8pae`QRRQ(2u7;D$&}1_zd}hBhQVGW@8-tAj!x$S
zued2^+#9&jIngR~0z)&>g)s~)>`_v&ye*|tY-LQ;E!Rb+Abo1_Hu`}h8BHR^J5|>I
zd-uaSrixs`AgF6kPHv+tw~z_wZ%WoNKsb$CN(55mV%Fd?^b&es`{(EuQqJSTNbG6V
zI8=3u?r!bXUas%%?c$}m1Sqo!_9%#I6Tp{XSQ{l7-~1G;!!3{s=fFyWd%!xF->)RT
zGc4#+G&-C_<J193Tr6=@|E!Io5n2RHQ`7V6u#Jo~`N}yGayP*bwImFNAo%5|o?jm}
z(h}ahb1-!uTDxsT`vZUUL`yeCb)!^No3jVw!4yxU3Ed1~7^j6E&>l?gA%1stPZA4q
z+CbR86D9&g`uOHbfb?#dp7ABaHCID&#B!#Xu-J(~Rb#j-mdvg&n_S<|Q74Ssg!|RN
znHTz6aj|2Zl=Msi{v6g?Zg$!JxMh?@u<S{znW?t5yY*pCrC=1KaOEF|&<eHIZVG|<
z$Gglc%<i#lzjNWE!5DU^o$Ansf4r-;azL%j26cTg$OToIUB#Y~Y_;v9!`W5BNjmxM
z);4Jj;P3knu9zEy_`lm2QegM!((cV*J`1UO(5KR;gPVIe@MTmSKkXbk?B(scs@sC#
zZYaZClSKM*n0Qu(S1h%yN|9spj6y%DLMnYxs*LUATv`9H#koI#{`{0a2d;z6trwdv
zUEJJa{e*YmSm-W6JL;8%oYbq>PTaq}87z}ib>rZ610_FBR~0$<ryUOBcqfDk(ovw<
ziFi8+2hr%Gw>JvjI6X<p)X^w7wR%A;XrTwJ(2Kvfy=TwR^I)O5j>=Q9oa6kP!qg$r
zD-?*|N_ufPo_Hn2U@c6-ArM)AI4)PoHu2O4L4Zhi9Q2~IQTPX4;}_Bt+PjISbOkJl
z2DeY~O{^M#rlLW=O6mKq;&2ia>;RF(H5yw0J`gCOpHC!Tn|5L*!1V%5*!g5KUT-wc
z!bv^xFa6QTKd+ySru8U3!<Sb<xAAiPT(uESp8C(bgQ(j9G9Heeo<6r*FQEVLHv@^b
z3<VhdLX(4r4q`YDZ@exlOQ+*L45*KJbz#6bz|&|jh^}xN;fv4lKSwtOH06(noYD~|
z7R@s*fWn=fPtcA6<{qXV@9lMl*4mh@F@KOQV>EMMNiW$jA^>I!`D{N%TSx<&*z!>y
zaD*32LPxlZqfr9RTZ12kf;KgI?r9P>EW5W;pO~l!-u|ZQ#CDzdZgmp7PI9+8mv)`Y
zTj~@tAyue$=52~fy9QeLk80U(Q#A@`(L&xD?mw)jKIJ#UsnFdTbF!ot(%EY5YN=0o
z4brDf7xkxEjj2o}IgQDuyqX+#tzku~(={`n(i7@XSwz#cqn2}&SOqkDV6(`cRX~{L
zf@4Eyeb-inNOKEBkXwZU`tYFied)&`lHg<=UZHkq-7ES1e(fARd=`li)=q)I(u>4f
z#NAb6@(UHrFEZqrtb0Yh{hlut-4eX1p~&~^H?{AZ?IHfBpDF}o2TD-YEqE;a?JxWX
zVt<%myD)xOt8vo!JsA2x?s^R*pW)dkii59g1LUOU>gqE7Z9QIT+JEui(#qr3-&)J9
z_Ug*YV-Upu247cO%YXBl-(-Zh{F~yUdEVcq-RWpDom1|X@Bd5x(SBD;UgHy`;JmCS
z=jsI<Ri{9J)fq|$jQTZ*&g?IfX`+5kW8h;NeZZ*m$#77=P6qsI=#R$!S&*1Fy2<Nd
z`VCf1y;=gO`o|bptHvPgHsH^We-Yq*g-2zRr;(as%8dMhe$yGl(Lcnyl=C|kS8qCf
zVD9GEkx&gCJYSNr-wWzz!RWqK?pM6?docNeR;b#Ysw6kVF6tlstBZRSC-}EjnRW+Z
z@6IFV(yBX?>&YETPe*rzo&W>g=?(lO3G&z2;N_f;vr$Bs82V`adRv*%*$nhdm6^GW
z7P3c^+uGwYx5J9r3u|r}6k=o+3XLT0H7fPvsDGlKVfo;FJRNmVf=KGobb=cgf6#xB
z_RtU20{t-1vB<3@I=TZ=a1xxw#922m;3|3O7QUPFv0llkss@tt0nM{>KJ>=p`3*V+
zavQ}GGaKfQR^!%ut2dJvWQA-m((iTS^1*3Szq6VG&UTUo>%P@M>9qq=-Y`I6)(VA6
zecbQDf0O<x{1+`>=;u$Hb^41h_*2gZp^7Lz6rM)#UyK-qKL(>ZoEdl?1qu9~z=2i2
zOd5s8FuCkCehx=VZS~`Nby+>a4){IjO<;`hf3Jh?^sJKmNgOruKRUpjFVxb%`{0*<
zbNIjQ-NU1eckk-M{#Uj!pZ{B0X)Q0M`M>tc|M7qSl7Fx8?wh<yMtybXNIyL|B`<(I
z>w7U{IbQ22-0*t-2vr<@;w9k_@Adqo0JNU&E**u*)j4cSaRv5b^sViO=r0__H|pvz
ziKcNc@PMiWq&4z%ViM#W@%IoII{lz;Mp1v$RozFOlQ$jdPMiBu2A@>9E$VH8*CWFr
z4w?OidqIKjC|P%N6~z}`nCQ;<(@BIp6&yyo6R>M0^ZKT<ka|FWro&(~VO@^g&S1YM
zXySyOlFSYsAR-9QI_pM1BE?-)xT5HaJ>XL(csC2X6euCx$pAoLo+o&#NtddrCBsA-
zI5^S;$}R6u6jDJ*S2=L@dW(8Qi)b6=(=E4!3rIn|%h0FJqOcqRb1&aJ73p@O2MX<z
z&q=)iA~yP_T>8+5zV-*Ai9pR};4SKPUQ{~BWID#X;RKzlgBV)!#5a#;6VdMqK~3Ul
zfEWY_);lkpPDec~<)e!gPI5p>)qWMeqZ^h+T)e$jZpKwFnDpwNw>Rdh=)*qtN!6&4
z(_k`;l7^RfC0s$DgU_%__W<UujI(MD2+*hE{Z^};2ZQl%j7s~IEHYCQ+mb=nr4k4w
zr{VSUXVTXi?wlIzoEHM=FkoMK46kYJD8K=l56gf6#`gxjvaWr^e8K6|Ci8TIq{tbd
zR)h<Z=N6+Qp05c4?gnNG;R)WDT8a&;+V4OttFroh)VJTm22|rkU2;w3<10NI`oBl<
zi~6%+IHJFB0z>a!)Sivv;POT7?Ack^fAL9Wu#q`Igi@-XQ=&SFhkM+osln^aWZFah
z>gjagB4d?$hMNT8m?cjpa3GStd;&X!6tU=0hw%a?=(ipuxV!#;?7e+s8#k^m{QPTw
zim7{&N{*~(^zORpxlZDwKASi>w$pY`o7L6J*q%g|6pfVF+0Fgz4}JhSL(YpdvK_bG
zW9>GUW=IeOK@b2z@O!T17U4~g^(0?MfM_uB`u>SeOsNM*-6s|GiGB7W#dKksjl;QD
z<|@?`1hlw`DiDXLnGaW#?za+>x@m)<c)Gwn-E~g=8Q-ZH_;^L~l-^_0B912{#dlOV
zgyvyt_h^dyqmMN3#%!MOO+%wCNqV3cnpyWWkUrJ8PZ}`B(+@y}Qq(FTr6O&5<5Q9r
zs^{P9)+=TD-&SSow3729%oNG**pO;udY2P651j&yJjht67E5aO@hSs)2MkMBv3L%G
ziN=Dnq|1UE$|y|-o?G1!@43q%M$sa_3u0qo&7vt0_3Y6P{qb--+6p`zd?b-9kG1&V
z<m|M1;KnECd_095>P@llfKovzOd>&#tu>!>JMf+lm)AY?dG844@Oc-i>`0st7Se!&
zYq3)8y?C}I>43v<0RwHeV2KczGZT&HOEzmAG2b0!?AzST#TDJ<I4M^4sN-6~O87My
ztlx{RJfN=nQ{aFXhKMYIsUh%&10pnGH|<W8c!s`1MCcCLO~CT|+?$<^2bfHfEsNM>
z>hpjiyXJS0K(g)tbf^ZDR39#h(10N2-$&v(P85OieWwF#I`XT8T<!W1zW-J(m*2+O
zSA%fQx)T^oIKPXdyTn-&Vp5rodbN{Pz#wq%a@{~D^b<-s5u2KvdURM^g15zYJP<}l
zW0$yf58$GvEEb4?fAoX={V`lU896GV8DjVKzKXNcMa!|F^iRT9#2pM~Lw<KQN~rJj
z&j^1nVDiUS{BgfOpN2ysxD}$yQn$8#RK4ivcUI93-?x@tl;5e+d@4@4leh{>^Fymj
z*{Jf8?6Ox+I!|65Jc}B5eYp2*|JRQ3POpo+5WeRmFi1la_-elyTpmvE?kqa_jm-#0
z-+U;^qIvyBK`f_o(EFn-iGXrW`l}B+pg*1<7mjHwkTj&XU3FocnsARVwc1-UIgc>i
zpn>r&`X1?mD!5WBaUx|l-g%u3Xl?2xg9{tO1RUa=j;UCycb_@lABXCN8Y7wmwEmn=
zSRwBAXLIO)a?;G347;K@I~!7+(AwzhZ>%_K=cB>H<N0jMyMO|#nD!|r^^r#=+iDT1
z3@M@^v=W{wp-mGF4b3Ws21f<~P{Nu=0hp_>RJ4J5*6aYpNOJ%Q?4cAQ|7uM{ontuk
zmM)lz3Kv}`Wlqv~sc9LUb*C(m)!HFrCuAhGAy6q2NT^~~`oTFXSs&SAIrBKtk;oXf
z_Ie(ACEbQHPXnv;x2a7iv;@)5A-goY{U`%fmqxlfRFi@mFM~JNMQ>63X-E(U+;XYc
zd39YOmZ7fhhGJx%03F97t5)WN`3Z|R`KxKV3-LT~^ivFMsNwStHGu@dBi)-d@)ES#
zGbQWQEM$0Qu6}C`?~lC;tcl7f4|FDeDj|zOsQ$^YF|<&k8X5u8Ojls8(i#?+FLWQc
zKx~x{_nENJhoaC{O#ZL^iuoUw>K4l-Z4U;ssjzi-rqW3DC7+mH;lj1Xl*gyTanIQE
z73q@@!8DlAW^BX2l)B#Nqdy&w*qYX`;)@T$K6rJpgwcS^dtor{4Hc?YoPdZp8U)Gp
zKOz^`>zoJQ*F;NYqKcWjHGq#&lTgBmpqx&HQ0N003jRQbS6xdhk=!F%;y_(o13@x+
z=9A^es-`#Py=r(5&it9mMZ)U!rIuEMIS+uTM<}-o$fC!6;0KH&revU{qCAsn8qiE7
zjh1hzU{{W5%a>v6DmhF8&s&Q@hjWl@h{h$FneAnP2$%=mQ&4@@^&=Ur=!K0;n_Ooe
zX?b|;54AUpl<@bc@AU=dBD7F*C43y`7uNr^n}Rdtu}BJ#m_>~Ok#;)na{e|L-rfHD
z*|ghd14vtLkrA&PDE+hX7<LKkGNj>R85RCj6FyRKSTz>63JIU?lv~mLj57Nvu6%$g
zJ|E$#8)4Fdaw$PeHVC^F7Ar>ePW$~(aVpG5Lxe0vyrHX6DP0E@XppBcKZ!ju>Trd`
z&_)=jK}M21WwoddXnUui0?Iyp`cxi`M>>=&Ecmdf*OUHx24xIFoWqS?#P}R-&&7o*
z@5wMQ0L6GK4eUagF<JrP6f{|)$if&A=+O`1*K#-XE^#3!Lu}JI-P0}>h?wuesA%0W
zGq}WB+YfaqfC$qfZVgqPSSM-T4dcQ=Jb~Puck|Kvho8MEvI~k+lDd8Foy#I+O+^&l
za3osLkw>Vwv7)5Vh(Tl83bmyeig;<LQk=$#&!K4fdhT^e0Ef%3q<AEK50OMf!fp_*
zQF?iZD`pS<S4T1FHOIhuw)~Q3g=$fm*a{4X4=OfLD4lqG;dtnYCIK^0BNZOXDX44B
zRN_mK{+wJ?Qq|#%(O``F#TafE(o-8bb0o*g*-94ixi|2kGLkh-x|v!)=DZ|Ak0!2{
z5f%kxIvwLq>TV#%70%DuuMpbRY^*vPs{IWIRx#ZFp*Tb1YKd1aRD)^4YFAoLhTYGX
zTU7nM-EAziB3^+EX(+QZgqe24lV4zmv8*r3Mjn}Ksp!UhpS7nnUa0ZZoPd#dUsm~|
zC%9iF^4^fa1ci_71KFdP&%6r<m=dIiBvR#@KFI-PA>6QuH+C*+!~RIQqR3wI`>a11
zOf?VKhGM=USvCWxbFv`VmNRt<5$B5g(ZZGzEYMN=><}TaY7!=-1#kFnjmgaUh|P%D
ztc<;NhS;DmX9S7aQ&HV8vhml-0Q@jVNP<W$Sc+jC9Ezbig)C^G$B9h=1M3oiiU^D~
zA;t%ypSBn-ivo<l?Iv=NQ1*nVrwtAoO<@b@2p-dUdd>;Rxz8j8NPYRtbqTef<PvpJ
zag#*394muK^mk?d_s42Of+U-FfplX)6JwX?g~m$s3SltRMm6e$9PcCzbIN;B&gASe
z;M0yWtJRFsdF0%t^EdyogUB0)BX5K^#!j_@7YS|h64xWgmkhNYs+S}Ut%d2Ih!`k=
z*-9MLS?Ui-Q~E;1LUmZVGfA9`25L~)i`kv>8CzBbRJvYqV6&Hiw0Ba4XIL%I{h1nJ
zJ%dAB5=?w?5kvpUg9nZg(Gj{)qfMBR_lYI&z#Ed_Q1e!qXg2TYt(q}mG>c{sD*+e5
z5F1Kl)f+zHBju44UyIJ;`*hrYj4;?=k6w@xbV-x;%)@4%?WxeiZ;4H-$suCjPd!pM
z<V(EO(A2GxcskYo$Y?QSCIoY6raPZ26Lvn8t!Uw8c+O`SH^r=`4=VyvHXTr@YP9kI
z$kL>=X+(XK;ub=2WCM8?WZ~+N5FvgyEYUb3N>=-Nmy-tA8_2qBs#;3<)ntxCp>^$2
zo0>Z1i@n(ZOx3w%%v-Na>HvmN=06fJI&z#mt}m+L+CnoyIC}CkZ4Bey_h?Lm(8;XP
zW)@Ytf#P-3ghHocuCW-V7=QZF)5-%dW(YCt|F2G^$=>htu9&b&K8e0;Ogj<zN(1^X
zP&#a{uiTK-rn#H!se5kYR6CoWdLhT_ANjam4KFHLEPHJ534Ig7$Tn>Xao9V^FN{qI
zQ`1Zcvw`p_xX-(Q9^#Yn7b<TdIzhav#N?yd{G5BLzUS*Gl0u%(&r_G?vf<RlqzKmo
zzTncXtygAof_ZvIMuzSa7;vLOcRC0ccO42*_%I)XQCY#_lkCJIL&vR_XytKTXE5!a
z%rwGJ=z)e*RA%vyvhzF{bMz>|hD5^NlqJH@H{O1xp74I}+@EpMbG`ltW99nMnww&O
zS_!299KB&HyfJvmXT*51?!99zk~cyX98!D-T^7begG6T6l?ws>VFjPJ$Hk$DbodNa
zfkR*j6q0F|V<WhX6bM33B3#9~!vxXTkCJ0--fX56J2MegsQHOgqdSBf{q)S3W%>$T
zN#MZ}5D9L1^E=8!%eqHs7;vAUvrb2L+AHmA@wHQ(bb--(T75~O>Z$|K;q8-!Q~W9F
zt+Y$6&GJF4{@Iu`V7<3!a=&a(FhW@<guw~a1Gl-=yPRpqydJ883Gq?AC_;>HaAn-W
z5T^i`KsgxmMg}GTH;~|UP|8%op_n1)1j!_D@{cpa&I67dP#Y7HTSP6cKfqZMeE;yF
zgbN^76MIW~^V83yqjVnzXX8&D`c>|q`v2(<9#t#N9~}b!X2jcTjCX9qhHsOQnJQB(
zoM5o$w5%%hyB|FqoYD0}8hHJ)k#ba!cH32Hi6b2nw=$r-dHt=Ts6kF>*z4ic6Ejx}
zMtw4nW5Sdc$b%Ox_oML$LKn&R`kq+)>*hqJ!V;|jG?{S`s-^5F3>c|$VZX3r9G7cG
zREm(03Jv-EzB<4e?k1-Q<=X#Mep;pKTVXGeV*)CsK8e^J418szTci|E;glIoVqS!A
zLmQ@0t(Tm7Mdop%S&T0f9|`i5mkIuswn(TeH6URKCZs|a9(I3<%{gF(*kh;Xv+Whz
zM6`Ms`a{(gUtn0<ad6yAzM~k^h;;fHrbwWdR@r)l@Cir<{3P9*`2F{R#Bwo*a+Jm=
zKZq~XBE}h1LX+7_=v>-1;P9~Sa0@!y)@&HJa6u`vh;#hnNbXh@Z&}1l`bdMevL&{Q
zMJVwul#4>L<1*5E;n%u=mfu0q+`Qy~JbOxu;bFJ|Y0YOB0<EMpw!~(nX`Rb`Df5X_
zU~N?PC<hQ|qhdK0#Nex2)1k3x`OPegbmgDM=|L7jl%T?NfAfBq+APw>1jFhMWd-r3
zGcxW8YuVltC3AEl2u|lCY}+Wkxf}4+Dkpkf4rJ4SbqN^IF>_vR=`pL6B?2<iQPOsl
zvSSU^IuwN)2J1cVtV_22R00p5JbSVG{OHlfe{TF={`u>##sk^J?TSf(*uG)+G|=ch
zc?dgHXO~i$hNMK`g+Z%!gsz@zQ{Ktv_|!pYsj&~#)F=sxz>DPKOo!1@^}dJbR-Q-*
zOzi_IPZ}lW*kdmEu%;3?TfeY-u%u&WW0HUmmxKz{$qC5-2_C|Yh=D)lIfcCYG7a~B
zJwDv+#0aP!CdsJwZDWL#+7ESkxf}^8IuSLdH1TsqaqWa*dKZGC-dMAQb$L-B2MIER
zBBDnaR1u$ES94nGwvm#KZ0<_h|0wQEK=Xb%Hl#>FhTB%_U6Gk;BP?wA`gLx;W7dgM
zO&RlFsHt7n9C$a-X7zXd$>clX4>Oz?@o3{QdpE_tV;wTwGavK1$xZ~#FB;YGT6$j=
zS2oFU2HzV_tR~n&BKI&0T<P+Qr=1u3j}Lbb|K54Md;F8p^Y4a(?<513NHaS`Pi@C3
z$4eNxpn)zWBa=XFwn(LT^9Jq_7P>(tmeJn+h~v^&+y;g%5~U}gN~T6+I~#OZgf=QM
zW;()C@19y4<)U)c%MCCxY$0R60G#o1_vz1_XNP-x+|zaFxZS}=T5FA%OO9+{9~thG
z8bWvTjq?F8E!lx1Mp6iIUAHA(waIXNsS>btbv(YBxtM_CgdSL8PeNDRtLq$gjO`1t
zxMiV6IOoUiXcnWAmht)$Q@zgc0F}F>Cu3byMy4bYeCKugA3Nwf$NN1RjW@{rREKWG
z1APC!9oYRO5rhvhqeJk=LLdpzBsQE`(IV0}+mcqn{t7Lw-62-(NN7*|A@3vF4~<`g
zalgaodhJK&%E=u*VMJAg%9T;o=M{SX$oj1WgY_)dA?tC}CG+tl@yPmZ_0)W*`)WMn
z-u6k4KqeA3KH-c)=AS8Z=)gNA76{Th&c`|I-ZMP$X_AnMei3iV51UKOaG>>d^L&Ib
zt27a5DJ*&r-Thv-Us4hmzoEmddl&RGz-3#PMbS|951zbu^K|d&{-GhGWTzhXRiLz7
zBQQzDRzWPJh~53iR|6H3v@drLt_Fw3()5o#-8(wA0lgN@$Wd=Fnh_013UUWZ&ePrF
zUH$@*B-ljz6A7=MaZZPYR+s{uL%GH5{nRysrV*d74}7Ra`bk=M`3wmSsi#)wP$Nv}
zmkXEmShXwb12?t|njH*0&Yr@K5w-q_=O|4D;{nktiaOo&Gzxg)18GngWc!F+F_<PJ
zTI6R_pU6H8qmAiZQgnS69W?uHU8!Z}{*|$QYlfJ5TlyqKV7@P@$f97~?tyW3Y&vI6
zh<660tN~5Mgae^-9SgFqTN>yidwTZ4kP$(pT-V_tE-{)yU!rlcM5{fK<5itO!8yRV
zf&i-W0<X@%5iJPdcM&-02ZO?L&8A*=wr;%lgJAAuji){isKq7v9fn(<zb7#0fJo9o
z__b^wp;EyBY7nI=tQz4Hb7xE_Mh(IV!5;q5N2ClB+<WR^#b6w#<C7CdQpf1bub;dg
zLN`9)oO2XI%uM&u_r#UP^`(`vIH?(s*>33N18i!0Jv<#?NjZJ^FIr<1!4$nl3>e21
zoGm`_XlCj7qmQ`WeHMHcod1r}G6ZMWY6J1AtyUu||4*gTtk~zjtMtBgcmDe}KL1f5
z;l|<R8~;(<C_a>BCwNHGs1q^3<kI;U_V3Q_CiB19XTkiBw2^DJv26a+)W6IB^#^^v
z{f2XU(ac_FHyNL0QQFUrjtEd!82A$5{vW=WthkxrKmOC%B6F}3-98{?_uzQMTLOoA
zYbxg+dlUWj0YcK(rRX9h%K4A~v$4LUz<N3&5#A;)1}y1}!i#YFqetS8`7D_KoSEk)
z+E}{&S7PhG+iXyAr*RXFFZ=v2pa09oA33D1+s5kS->Nn1cjJE>pFHD#KD#LQuhGVm
z{GZiEtrge*YxO(*|5iTV>W#6DwA6YV>+9e8CnLT?=*i)6=jiqR!IM{S4vyEqRgPf$
zF<+jzE;k9SulL5|;W{x-2V2(#e3?0$^rz_jb6wv|^vnJMZd1pVMc?d8M1%j?douOe
z>2xG#?{-InqlrIyGNvIY+$RWIKjP#<Ns{8*C=>yGZB4@P_==jH^|ddA6K?w{sJ)iL
zf9<KmoUe{LZw{XA?jLsO*WZf8^|cVZ^T@H^cJ>eUk9QV;0upf$6|R8GE%fmZK7`So
z&88g=PMPkkOaGJanQr&-wTL^PD(PKI0gOnE%ZVp-OU~=#pAPqSpLSlpIo|uV^K|do
z?wc3K#hsL9Rg)2koka7=)&|5Y)A6OkbSEE*@k)wmbk&nC(QIe^%lbMWUIFtU0%9Q-
z<sRduBbYW~5yl~PBD76B@n$i%?;%zs#^Z6YdD(RwbmpUzu0Q2=rSY7gG`rF_nq4ob
z_=~jKNlK(Ok|2YeE?P{87hd;ce6rsVAyo5MCdHfd`blD>H>Ak%M~nBRpFHb-ZzgMk
zdqpi^$@)((WA=a5tu>o>>;G+hmahML@JAgow+n9Z&(G3#pA|lN=Kt($@HO>+n(Rsa
z-@TjvxAMuO{~IedukOST`V2F^(&|osN)Bfs+AM5h%f48UUq$`6J3VFf@rBk!kB)aq
zZ9jbV<`|cOOvkuU(<6PkkY1t)sH97xDJu1Zn?L4txNz|1#fy?tDQPGr<m%)Hc%$`P
zsrg8ru_nvO!Etp`LHP*%kqx-``)H%c3anOa(BF4sf22BY^m~&OR|bo=e(CzNXXEJ+
zAEAE5Ti*pPyMOQuM#NqbnEbN4f82TX_`mj^9Cs>++|nS{p8oRc@G1KyJ2*rRmHN3i
z+oRu4=%>Pt0TQ{maM8IR7H1V4_<)>h913%PG@HQYD4JloXQI|zduUB#B7z}<P~wPd
z9vIV>NE?CpDfz36frg=rm6)_JCzNLPM^C#y%_o=q_s_lQHCBLS{vWqei_8CJ{ciu~
zRz6GRzf3uBK!*=(6!3lE4QE}J4tT*+ZWQ3V@*nWytsiG3f-9K3>ZRPQX1p#&7QSv`
zJXz90e>}O2K)5Bx0+-d4D@{QPHtU_4YHl8Q{Q~E6a27X;v|aQLt{MvserllL8Yl$w
z9#XH&lBF0?<>*j_M}aC<bRIe`&5Af>IAqBt4S}?N_ezK_o6?v0Nr?|Nb&zTNWay2!
zFS_&2tU@b;L4hvtiQc;Q+n)6n2}kI+g6@llOaFXVaz>!h!%gRxvoSKFZ9XJ=P$9)u
z!H83LofPg9UcdQoOA5a&zvOJ(+j#c!c;2j+fZ#(%i0L~I9swvXFTV5RBeO?}h~i@c
zX4H~Pzp#~Ac*nRo@0=f~zVq(E1F6ErHmO{Nt1+@qy}o~rD5+J@EpM3kF`Q?7st<=X
z07#Bq5Yj*BYObIV5>w*HX_fXLxX=i6F(?Ct0#RYp5p;1aJX6HE=isVZc6<^o8pWdX
zpN{K%&!dnNbyeM<x6xG8it|A5V|5}NhB*EH0zQtrPxfaO|4-#M{XdPn_5U_LEBb#b
zcmAJ$uTQT1-|p<}Iu4-a^FI;)S#R9U|6BR!ecYG3$3JzRbk>*2gFhPIyU)#jR#^Y9
zECQCzf433$|GI9Yb~pcT<CDw&cQ&;eP*8@R<Sv_!RBj^V<6zT98MUFtSdfDJe&^0s
z`15`8%>N@Y6Tja2-=H6f^}klR^Z(t-=i%l$S^kn3*yqFOQ~#sRH;aLH+;Xj4Lm@L&
zHmig|-!Gr}({XU-pLe(B<!-<HZu0Q|o#Q&EhcAzrZyx%ifp@{zH-|^{KOyb$roQHA
zz*#utpg;0Y1j(z{hJN201-NL7v2~m$<H_Ze@9Hb`i%yl;t3>~_oR{-iFdsWdU4J$%
zIWN2K$Fnj0p@-*VPMJ1ve$ogFq&Fj<FG@gCg5BZJVW>C>8F<r=$m*w?Jj6tqP5s_H
zJUTcJBvGy$hUCM9{-`T=jhzRQ@`ID`Ndf_Zb3Pt$RwH%q*pySNN{&vQfN3C^6XFN%
zMv|3@6LBb5-YlXCKASN#nU)Ga&PL1$FQ!OhEXi=Xz41rBv_;4nLE<!kQGQ>2O`VB_
zN<bf>i0om*E^ihrLJ7wkBRXl6sPBWhx^acEGI0qJTpcSDOoX6L24v@XrpgbIqMDD~
z5);#0=njK$SWHknwhY1Oo7L?Db<Y}SwNm$Y;Csk`2Jca~qJjZul#7}|+Dg9g5Uq@-
zfsq)K&wF~K0X^lbya>~CBux=w&H}6RJhQ_@hseh_KAC;u<T@%hO_+jNPJtpx?hHpM
zA|TAGoFFcm8OJ~EA2~;_o*n<Pd${M&_t%H7e%^n&_tbg(cY3+!JbCr{?}z)(e>!%4
zdiCPz-r<q6d+?N=9vmO;KYnxk>hMSaZR{RV^$mWzd+>K>@7LFddq+pkt3zl1<?9#w
z1d*CJ+&wtn-#aR)v-A50&r1$LaSmP`3z!%CFZYkB?D4A-H=nHQyn5!m+&g^o6aCzM
zy#HeV`0w24v;E@(H2Cb*p@7<TUhf_r?>~9-V)xK_{pRrXtD`*!y?nZV^yJ0v{>#0m
zWx|8ncJ_YWJ2-ZZe%gKU!tS&{diBe}-XVHocH4QpN7(K@ezAupxzA7c5BHuNqjS->
zCqzs_^hHTP9lhRrvQNK=K6}))-NV0^6yT%1|9(Ry>80~@_vP+$>S-Ylm1w}8ygA%^
zi5?JXj@~>zI^I8ibG+v~fA#7q55Uph;m`X|_KtR(7q5<(fNzfW6hcT?z$g$LA|aKb
z?~mUc?K3g=503W^58u2###N2P0lyHX2-{t%|CFiz>Ht00ytMb~@b3T*y70)9oL_$0
zqvwYpG*fREWH}-#J~=jvQKLju)xD_S&cWXE7yHlm4xa3x$SZ*QW&dceNCUZlgaZ4F
z0PzPk{Dvuj0VMp?&^@zRyu@Se>_2mMpZ>g$UZ@(x9Y_0$otTVIep2Ir$?|ah;U>?R
z|HBKdBU%+d=uLg^#5vl3`IIKHFUjnmA&>D(5)a;p%=6<<Bxby60hNks=KY`UoTly6
zTJ)Skns_N%#pA1DW);*jR@x`mS!r{wvpA%V9M`ye;DxOEoTw9N@kQEMlB?tdo<}_J
zWRG~iJiC}NowZK`#LDB-h`mR(EhHy64|D{KlL#4oy#KtjM{{(Sc>4Z*=Nnxhdfu!T
zLrl!4j;n(ZOu!ujVy9!n>~y;40|Iv=4gIwH^Im87#qs{ndrxi#;;Vxfe_xE9<Jet&
ze(>fAb&?O@eakt@oQ<ug0!Q=#EBm!v9P-qJiNkvul{ueJklGr*hnrhh`Vd&R+TJ32
zRi@*hJL^i8U2G}t4v~ScPr~PDuj<IPFp{eD$vW<Ay2=Oqnl(I-7$H843h5ei&LImv
zpO2ul{6Ymf$7FninjbmcMP!)czTsd;vQN_YT9s_~`ET{NWQ*@4p>szGF#dw3Rs)~#
zXSTDhqNpu|L60k7+v%LsPu~grn@2J5)|Vh8KWvPyfPoFhKtT?{sMo>C`K%MDRsfUl
zJWz1MB%R1E<*6jg)C4P<43O*pcJOv5tj~58>4kHh4;lb#)ur&j5&qyJ0@UTaIp3>H
zwH2J}h4hx&RZdjKBMY8N!*}Va+|Zjk7pec5B)Qd4^qh&AdtMTRXZxfUJ%91)F=;bD
z(^3sJi4?^cGNl+HI1LPv#O0ljgzdVJfkZx3@&1|Df3GK!$}NYR)Yxbf`-HS$e>{Lf
zU;W2FUy_>oMfi#D91K}V;1M4=kDPy!9!Y9}TXN(}Re!1JFZFctP(O~2cS!|xp1nDE
z0v+lorE5{^{%8oPtwwo#Qs8emlE6o-QpF65?$|q?(Zv{4_61I9O+T3tR~8g&Zj$Lx
z3K><RX*T^)NrVpyQ}Zc+hF1cl=2Z$jPFX?Y-@$boJm08#e|C}HdQ=*-!z^FY7;N$@
z)jaWV0#G>AxMavJgg=u_S|zKgB^fK>tWLymI1pp^#au0{W!74N)uNo%^Wal=QpoP2
z7F^k@5|;C%#?+<7k+rF;<srRV5O`IoCe11(Sv*qu?k2uMmPMJ<tSb?RSx+;NwC!UO
z6heh{mPOE6)C01WahZ@O3b=}8R;t3{8KXqCa%lU`KM+{-MXf9=RW-s+7j`ZXl|wHI
zqIEOd>zuohx>453vbltulKeaMKXOty{(m6V<!Y>gfZBB0MaiGN2otnsQI>JzD*uO7
zW8Bas$&BZ-$y{BKV8Aj;Dp!lWh;oW(g`H7WaOA%7H%{@d$L<R9Yte`=l4gr!kfAC_
zyxdvInGH+MnEsB3JL@X>JHomOx=_&{ZT&d^t@_sa;Rjl!i_X82FKcg$vMSGpX>}`$
z>bj`QmB(n9TL1A!bHoMk7=Q_S#=C!UMQWr#YWS9uC^4TYJP122!HR`3!y~+`Qm$PJ
zbTQsm<1o(BVANtT&ax)pA25=&MWaz&Jd*CBx|Q1-NjKL>Ru+zAE!Rj^(?@b;nK<-L
z?nI&~5*G`%3=QkAFWkV{SyLkQ-5E~_nJ<4u;dZ+td5gmBtBvHJL%1!}YO(3%1>Q(q
zS2e{gf`Phk6jH~OEmI{`j7MGipOzp<h^;r6(yV`@TJLJr`d6zqSgqPu)AI)7PDtNy
z4owYHFZ$YxzV;C-zqY1-4)ml_50n>0{kl}F9nIDIWJ?m@qZgWEA|2&E8C`HB9)_<%
zcI>Ke|8OqK>Pw-}QxA#%jt*U-g!A&~Z#2pN;aqZ|^))Irh(zhp3)ckfhJalS*fjvV
zF~F_{>>7aGG{Dsma8(1Y8i1=Yz;z9{Y5=aL0j`CBYZ`FP09=a!u4%wE18~g%yg<1A
zTk?kcwRofYwRofUwRoeRhc_&7eKjGJD&%ord5|gcWN%{<c=N#+-l*}pxG-3A4a94)
zimOZUAp0RK2Hc#wCHkkT_;89dUibS*St6cgT1czPyF9HX-?{1?AFPr?Uk=VS;oa+3
zM=t$R=c}yAWI(|Qqy;~n2MmXv5~9fKG_CR>Ip7Jb*Wy_D3ZpL(UJ9j~!iBnaa20&M
zWGwd)C(HwHx)tqj<>Ul&>E{~VQMk0q12G}cj@UOQG<CCDU@8@S?^$%?TDVT9R8z3S
zB;`3+GrwQe<l2(+?$5xujN(d6o53L((5l>;jevTS;L@uhz&x;(3lH6}w0L8980R#r
zh?{~=Pe?^aHlzN(W5LgW-ch?6_eFi<ew9L4U%hkb*qYKI&B4CZk#9Y--SMls_>*fy
zv>j0jHI?{;32Dh>yfAvkItF$8(td_nxn`BI-@CE*)!6%5>^-X~7xpt&1TGV#U1n`{
zqo*81r`$2&Ze>@yYe<ITVW)T5i5oT-=4R_DE=r?U%H^MUliVCk>=@ab289c#GZ)Zf
zsx8tvHVp&QZ8qzTYU9m|oy?`?&)3)L75my~HY@GgcHLdn-R1kUCSLhA+RRxpqD4;*
zx+j;Zuv@qpEcR$~0*JNPvQ*JCCUu_GWs<G0Nvr>O<R~D&sV%1BTheOP-m)KG-P|Ui
z{3yVF{E;4*kmL)|+1EY6@B4ga9={)Ms@?Bbe+zf<aq3?B4`9(54^!lZ^$=x<9e6Xy
zSwqU`C?N8sYUwBUYt?8S(D)R%yg>vjJ!OJg)NvUbBVB;t&VN+n{D&+8mru1Dnq10`
z{OdQ5Uo78|&zPCOKp6xBnxPS$5J!xAg_Ijxemb~PS&9>e19k9*FU8Zbf!@VrJR(RO
zjVU*1<8~LCxE^0gs{PPPcN<SdcN3?fB#b!qW*vVZEpmFF*c9D=dUSlaNZdr7(zh4O
zow_GVGiA|(vHiV=>QGTd%G9cbVhE^g3YH~+7JzuTjwy;h5ezBQ0Te2j(zgR*v9Hmy
zX8qbdOMuAg85K<HS+mYP(<ywFcPzD|(JfMZ;gIUK67DGmL3v$;{dBa#?{NAiV*v>x
z`EYv_3=)re=h=HA<&>o)r8Vw)C{}fgG@dCEJ1jQ6f;7g>qSIM{UmL+o%J~4{Bd-P*
z$i8s^H#Z3#%N&;|jkT~`xNeA4!9t>ClrHn&fwo|T5L3mF&T};?w2CWw=uItJ#(%4n
z%R~R%pB2j)<iVd)&$hwBVp26hG;dat^B0;Td_sgeadDzPZ%7+1m_P3+SjujbtS8}G
zL3ND*Q`7+^@$LtKABuN8yZ1=oDKXufdfoSiP&Vo0&6aH>rt`H5BKgXE&G$PSh%mTj
z9U^@`9B>R>1V!$~jwr>_d_EfDe)8@prmt~K^eGPU;P&sivd6=Tl-<2>BJq|`gj0MX
ztrlcta}XOztIa)e&FUJG8fVA;Ef9!$YOh5e7So}Lfwg=>TW@Ku-Xjb2(Id`Tbt4mg
zbuzMH8J7>He<S{mEL82|h#oz1s+K@8HsT0KxIZ^_P11*wsacPpKMcJq+0dtE{^u)5
ztr#z6Ni8mxkXphlSyJn7|NX`gRr*te1j~ArTbj|V`5Mw}#pT+X<hC&uC}R)RW8TK!
z-ooC)74;B5WjS{dIsz@28W;;k^Bz$Zfzh3w@)0_vnyNeBm5A&jW&<Z#n$^1Krt2!v
zls_4=@^dntPu1;&#@&+)+w3rIKF4M6CtaL_0T8|t(>{P0ifmI1qwF&!!y^e=T208a
zfvn{`T&z>*&U_znEXt!Cw@nF4k@PIkgHY7>)vc`wq@%myZIrWoz{-7m=HV>qB5uG@
zKXDE#dq0La55i>Zn-S$UF@Enk8-x#z7Hsg5V4PRPwZP$cTVv}si`w77VLW^S2ptUk
zQJ?IenH&Q?QT}CaZ!nl*$%9%PkK`c?_eZg)A3zAf&J6sqLQbjjv^%|wQI7TQnZ@yG
zs%J<yc73CM<o$L8NP4&HVg#RZ0#kK&D{eFWFz*hTbH`2rUI}FStF|G);q<77SdMUn
zlSqAzgGxkfhph|hS>RuE!iVVK$F4u*JH!bjt}0h!!*k3#A5+hrm)*Ye>gZQzF!qAc
zcQfa#`_a?)<*JbnkQ;8sE%L!A^nt3#;6(OMoHL{?)sWLe>U*(K*ui4iXXzSfmS=Lc
zHT#h)%hpRCoO@1PFXr)AKk7RCCbnh4NQU0iqC%4EJ#^~D*lPGl8;}b_Ju>8V7|i^q
zlh-x3nl7(rpT>9M`m2cRI5S*dT>pE@>NM--%Cfq8C0SklHx<>kA!w-GUtLsJ7m4a-
z{VJlmnjxyMV3qNHT1Gq7qHX@9NdJg3%OXL#N)s{m{&B>45T6wu<Wfw*Q_@PB(3Kvp
z>jAX{XtW!Hf_gM1*V9DEW-x-W?~!5G8}_oz`-S@xA=LOp(XSZ(mKKVJ_g*_L-@JHX
z`pgIgnEe`~qQWqTKhNF`s1&hZh#tqcP1I&Qb{q7jL~<j6%C+5Uy;iF>YHwaZq{hl1
z-k|uF!@}6u`$t9zjv}q#z9E!)psD&Lm0h_TX}eWod`4BG=_h+BrftcCcpdg+ca*TG
zUcw@^Ih4L}4h*cAcjCYI-leflB_WhT5Z#c4H2|vH8G55rm3T#cB^VlV3cqXpAmaB;
zU0Q@$1ayT-P(q?>K5-hG4%4X6uzMQ)IQIw94;C9VxX}6kV$%r-X{p?-*0>SsDELin
zA%1b-PqGWPjdHEbVzq6fSi>q7KCYSFAfj?NBnX5GAa%MX9T6<>)Y5~Fl$^>%yBE?b
zd|otM`v!y2I`8}#y8C#jsV%!e97SC!oVAg|Uv~SG!ss6{0YzPc{BRtR9`;LuE8?TL
zlOo%=DtvQ_2dDTRA)HZ#`T@e371KoKR8f_?xV06Ro-`k1$F_hiTP`GFlK5%NuxKkc
zizt2yQ3{B{LH9^az=*u%{N<^oG>LRcIOmoCQ$1f}dTH5!&>a@b8MPJJ;xN*dj49`c
zM~Zh*9`D8ZL&YnFl>74&>GsHC1OgnGkpP-9)fCD+$VHjdQdgnOKQv{wR-w#4u1J}$
zuOTRlVB|--V#+3Kq}gM&QP(VGwWPK~PNtrxP`XP5`e*s%%K!c0TGziV&HvkS<N5z9
zZv8I*_pN-E=Kqxhp+`f{o3KpoPA1dwg^%or!%JrrIHT@p9C%2<7?d67VC)RXpU4>9
z9F3=&&U`|G$?5SmCkSx@7<Q}p=bT68bWW;0>HgYSmD^)KbQmZK7s6CVBgrtVBo8(G
z!y~>ZXEXe#xD&swZjJFqVYyT%y2BNrVk$KcaDkVUzl`Td-m}JAdT1lw1jm@IsgmW{
z#}0K}M4bJ2B+o|yUPL-#N>w+bDueujOI<=*+*hTdi|xLwU-PQjT=##07rt8lU$@d~
zG~)BW;ojZ<ek-3G^WQn9@9Ybh2jUXoo%=A%S4~iLo1eCVDq&(9ek|2HGow)OoB4(x
zajK*WU)@;wvIu~}=8^SoLb4&OWQI3N9Ztgf$l2K7L`%-0=Z$70eEOFR1it+<Z#cmb
z8Sb7=fOqibW#@2j4|yjKjys(F@5rfE!u(&}XnxK&g^fvFQZShSC9+!mUf+6%vqasg
zH|lmq-Y4r#b^VJo4N*c0G1U?Cq48rU9Dv?<Jao9Fv+?*nR5obGa(}v6Bx*NVE{$sI
zX3Iq5X~9N?Wnu8ipY_k2g8b@tNz7S<_&&M~euG|Yg)cUCRB@X|W_i3xsgOcHvsU=p
zu1Z7Ioe#O>d^GjC)JGC|h45-gBRG70FlG`Jm~5MxTI!a`!X`f{7K+^EO@o-~zI%S;
zJW_s_@NzVDFPC_K!dPc^C>iIHQn)ShNv^RDEmO1*!7K6=T?YJ34$(<=%%U}oBKK0C
zi{T&lEk-Ii_whC8giqxfJribfIMM+p*)N1{zbfkJ$KC#H-W~GnB+L9{+6~k9@eIZ2
ztn<wFgNPLhrspfd2xf}KnA}L1&hy!;!<W0qo!5u^2glC}Zpo<@)#ZCEU*7wZf;lyC
zK)*}NaJgLO=00{ioQt|U!Fbazxhk<cDLGOU1EeJD$G*ClP3}dNe>K4F1SJUot?C8&
zp{l7$8|pgLY$*t2SLqyIzxr3{9FR3R(2`dc6(pA3S~^Tfmhg%{XE76BS-#hn@&<l|
z(kM>)s2F~w7DFeZV)$hWC~QA>SU`D$NIda)O*+EvxMS1oIaW4CJX%~IJXlCaSt_k{
z5r1~#O~DZmhL&fo-EX<E*ihaJoWi}J_`P#4piwP3VN)e%!Mai`iT88yP!=sIWQ}o1
zqw~p7<TnW*g&OEqa`eMc5-8ko?I(%&klCXihy244dJ^tuLlxmnrqbFP88<Jx?>#3#
zmeE+$?zoSWhbp`JZ0t<uqY?BDv=Wr1GL$XZ`{&3Fl7Bs~-^En}vor6KbHB^I18R@v
zq}%t0)QT5K{SY`&?ex^+GbAxIWOv0UrO!J#@%qTgA$4_(0|A$f<H@`?Bnt1o-WTj1
zYRibbegRohDay{RST`{y*tZ+zRKGmK!{s_Tx!LH!y_^zlnZmWoV>;8WCwzT`k?T%R
zSuE-CEb4I~v(!*MKzF&JbIn*F66?d-TH5MF<zh=>xYCmbT#(B$Pb`_@{21Nro$Qr1
z^9+^L#85F?h*t>4K-^ZLn7kRNYed(QeYl^d9Efcyy;|6<^nUR;#*j@>-!d?YA)DyT
z{Y=&4`e=t-7~|-ztu2yhB-Q2*@6Ai8UvU-;A}^05W0tmrUW#diGH*-9>wKWG{wxEH
zGFJeNnYs)#%2=S`o>_~<I;Y9*f+3Ez4w52=V|q!Zw6GMGnYwuyq3*^)0mZ%KsDING
zm0XB-Mq`5!|FCYbNq60T7>nCi?+DgST77;&pi(e)#^=6i=*op9v}(_Y5xbK~xM1qg
zv`@IkW%S*QffOz=xBFN>yFCQuNgUYF1UQ)Us%U{Mugmh5B&s6kN>sH}sJMPTnR+Mw
zMaj}#&%Ge%o{AEuNS~%jlUAkFDGfwd%%wG__<xrA|7HmBdw4A$6Z`mEjqLkBD~bER
z+-l|ja~jubHRtDlx&JTc_@Ddz>A2^O`d7IKcFF!v({0sa<6o`c-T!twpQZlaWOk8t
z>_T*~{a(Pgfj69Wd3nIaT1L$1=u>xkKA)IRd@@=}QIu6-6Htm`V6yBBi~5kN@st4y
zqUjF<7Gfmx7RpquE&RQ>lL7)LECDc{g!Q#7?~l(Xw5D*cgTm4-I&tf~(@k`{(=Dcy
z>y@lBJt2!pXTh>tQeS%TFrYq%;&*!Uli!-ioDznyt*=d}`{$;`rjD#lI3O20Nlc1p
zwc2<y@-E2wM4DV(vFP9x8MR`+g_#tfBS#EzKg2F1jiQL^@=i+WUPkF2FRfCBduM=;
zs)qdzgS)~f#S|CQy^UutkLS($hJ%*6DyaHi@F;vSr{5c*+it|4bA?Cl_p%BAoj_v0
zOCg1_8fG;tWTQvaD5|%;w6{I2NJnU++XF@Si40iG>8d)#?%>cp^H7c)gIE0_A6XbV
z;|a9_mvHw}_tG)l$8NFs4XZqgQ$i*wxL0711^gjS>q%B8E@Hiiqw`gG*23v{@94Pm
zc<=fCfvCFLml>#U7b*zQ6alWWDO|!PvH5dD>S+cs1}l7bK{}k-f5wCn**kceI@X#Y
zG6{9#<CcpBgWJa|Fc5P?+~T7Ms$vWWR~$ps4+lvGPYH!VYy`t5>@kcZq)Gv&;HpSv
zHLXz#5(R>E<WffR9F{`bRJ7NS8y`;9{5*gT%KKM5F_(yqPOwONd}Wk5ZrPk22ozZa
zQWv&iE|WtvAYhhj2_ciNF@dB9oXQ3XwpmFwjsD=Vu>H|X#$t4pu?V8cJG$a{gfzAW
z!6Y;l8pQ`<lsyon(9i(*qln_BQ{8q(8NRy2@@6{nVp7w5l_I~)*EY9We#9j0?m|HS
zB%fvW|D3ej>v?~!;QyhwjryJc=QcjM#=rmmDsG?fvn2kn+Nd|<{=a(bF8=pcK1=;S
z@r4k(Z3A!U%~ZreFks(LFn}N8{TXf}d4I-sdw|$~yg%_~{j&mFwGzGCVP|>)#R*)2
z${@?}`?C^`W8<l8Id#su!I@e}jHmCtODwx&RGX{1239n7nej|;joQeCMorLA$Ef3Y
z=*QPaWRbPNTV@@9#E1r7ciKOr_556?7s{ghn(0v@f(5^EOr<gpx+<%r)<HIQ;}3L+
za-v9igOsFL1AG_!2q*KxVw^oeB@zJL92PBQM7XFpIR8(=9jdj@^N#m{TVs+Jcx*}>
zzRCTM-V}A_Hl=3W`#hK9_`F|*N7NEMB<1aY-V`cD133dU_w?bWv(G~-yZmX%mT{t!
z#;^ELA6Yc$UNk(I055D}l8T2OiLKQai4a`aWB&o7Q?Jo!13<FR>?oveA2BOmzuR*0
zFK^<9b_RX7*q=iyocAT?Bfd$o&G%%mZEk+#;%4dh0X_d1aP<HCi5$SX4@=@do%`?0
z6X*Ld9^qs7w#simT5nM{ie30<{Yo&nOzc8z%z)xY-n*C4h%vINWbiVY4J?!uEW*pC
zV2D>>^<i0Yh4^GP1?v=qltqv%{9cCJ^lu1J@`Lj(&1qtYN6Z+i8-6hx(nkZ*M~3t>
zt~px_>q|I?vGJXxr;<*3^OQ|ZJ*%@w8qE8BF9<gDEInkAd&jOqURi)r<;)VERW<+D
z^Xy_7tV%9rEN9E%R1(*c*Q)N78qARISI~2mhJ!s6L%#_RU+f?6y*$El%BQau=sjw>
zOn#Fp(H7VTTpx0S+Q&^Pg-LlLm>WW40``vfL9o8cPKe2o2p1mBhr_~z=i%~wkS}?f
zR@8dO^E5n*?W?ocs<b|iogyic8p-6hcW>oi=JQl3p=!mveM^>20eqjv`TjH;bSU9d
zL93}Ppgt&}ptC6H3B91oG@SkEl{gM^vHB%My@?sEAf+mv##nL=i@f8RLUDUly$aPA
zEiCy)HC$HykWpQ%eq4b{hW3#H{n|vbz%xtoU~@!#;CUlMc7_sw%r}2DVAfevNmWpk
z&*<r8gMKUS684fhB3-`Wc}=uaRJkuNL#%gnB(7@jy}*f$#|Ie<j33gqee4d|&g3+0
zN|{h?zn5m;8*KePWNQfqp8WRyE%qKhgimdTWKz6;TT<_sr28}P9FxrH4yRssaLM!{
zo9Dd@74Vl@(J?Uo=zPCxDymrh`z0clk>f&7$p~MQ1-Jo>cZ3XRpb&W{h<pj*W=-vs
zzS=;O0Kep1G?qyXKRF-r3yoYd!?&kHevuKM{{B*lkyc}wz*r(LR;7<MpYuqIRmfuj
z4|m)dL`AC+U(tmkRmG2zrfz1an%~Yjceb!*{@pTje=PEFCL-KZ{c&cg6m9m;z15Y=
z|BoHt;OaX7i~aw#id&24|8OgfJOBT!d{*}VGcR<4`T2QwdMT$UW#JA!m*j{ulCIL%
z{>=Z#hy4P+=Lj3xlL;~}uHndYD03bm2J*x|6~JWHSID5>J9xEsaLi|?KO<wK(lfXr
z!*x4=*a5=**|4x7TpFUV5n1Q=4ZQ9HPZqK=Z6RJXGD+(RfQ#tEd^p=!)-w0lYF5!8
zYSRh5!Z*{Vrmop)MDefJu8gJGsyw-Fn-b1pa)hN>&_Xlx3P~>0Ygzb4FEc%)BXEY@
z>8Vcct41m2iy6)e35E@U@(TkZ-^s$jLh@&WQ*_AzOwm*y`OS8j$Q0yG*>N^e__Q|}
z_s@3h)B~W4S!N_tz2uAr`pc9QY8<WEF=q9O6V?peJi-C=&dc3jpS;*TI)e8?PNe_Z
z**)Al*rlc2U^Cm7k;9RZ!Jypr4O5XaxRhUph712HYA&s0v8UDM>H-Oe6oYc5%mZf1
zCuw%Ekh0}d(s`XaaZMb<i(gj4a-<_zBlI-82o6~oUQdF?kQgM97~DD%dQK$9D|~a^
z@menQPG_djt1OgvRx0z)-gImUr#bP$saHtMeGO5)FyMt(0(1irr1+wTCJuUNf)44E
z0X!y|BT8%YA`yVROeV_MS=xz=*3h5Lh9r$QxxodJaz%NktA)Bv2zTI5XP2GPWKQjs
z^sn>o;G-XezxkzA>wNzCb5u+H3Tw%4T?^@j(5p;=n_t{&@+@~A3kO6k7Th<uPwK_<
z&Wqi{=X;%(`v=^1afQaa+}RxRUh{)Sm+jE-p@6AmuMD#@xNgd`K5}c6Plod#zD~sS
zmhpt_X)djY{n_rD7spqXFU*}JSa<-lT8^yd<!jMjYyHckGiK`K-a`3#odwUFs0kTw
z&*B_nei5Flprht|7DAy&xIL6a>|`J$FK-7OQ${Axu?6TYqLVdXaT$JlC}j+o`SRN6
zWT`HA`c1Ffe}6hf?$3^h-VWi{8zQZdz0Jf*$*f>bHl$6qhO!cEZ|rJ~1ot6HX{Ax{
zjVYXEXR0hI_Fvly%A&P6R8{OkwmE5OSk~l7QHK_-;bCibp#`m3Bb&4oWsKKnX9IN(
zRvysGn7j`lcB*DHCX13_(^~r8$oO=I?RNT?cg^WXpRp<2r|-DKN3|0rB*mk5V}DfO
z0_thnc?wHk18c=h*)*?GLT@WAF=AISTrC0=cW|ls3;ONgH{u#U@t6$817bI&6sWwB
zk}q<B<$Ei3@9k+fe>KH}+3Qblcng+)u;Hzc_+t%kg~Y$1;XRA2<H`b)J1+Ha+lmLC
z5seK@^~0sTzK->t=GeUAYH$tT<qa6NcTUVZC+1g_rGHlGb?c&QiLf!XT-<4*XvvvJ
zCA_tNPUMM_u$01_<|<jCKN4*?P)S6%ygl6a=H;G0!m!_?1uLp2nLl#qz^I)q^pH1n
z*zE=UZR(u{tEs~D6_-5nUnqv2Rez*FQ*r*bqSSn7W;|7_#h1c*!|^A_=c_COdK84W
z(29!6G4+4ADw`bYk~1C-I^oZ_C{pDYd-;O07)sV|aMVEBCMhKME{Zr@6%;fbuO<!=
zS7srhD98m(9IT!R9&rI4y-l>Xns?GT^H0o808YjM?vo?-m8|8fESq;G(7MX=M8fAc
zx7vQYV2MmfIhI$^a=4U#xI$vlyzYvgf!5%vXbrw9T9Ns&GGaGnpJeE1=?JTZVRdv>
z#p@eWE3zZ6NLQe)TFJi7sH^4iDriZ~>yt49GhUjnfR|d_zt$wVDq5=MZBLOaq8sU7
zU)AIAr&hCX)<a;MDWMFyl92+MMoW3>-h!4IS=$JBy<it10ZmW#On4}ee_H}D6@x_-
zumIw%1+V9MqsSSOPSgA#iMWj3Xg0izLA{nQ$Geyj%(!Kf!*8REA3{pQD6u7Uh8JHi
zh*W9ss!cc}Id4`Z3Ap|AE$e(roatmz!2Z1)N-H~S)cDfZP(_V<d~ZktT@{@{20AyS
zd0xW}7a?iPkOZRE?73UH6p|KIGGwE?zrJ+5VvaT|%D$9%A+b)0$9DKz_Ipq;^X+2T
za8qSh)zbdYedguv6Mb@>|Cvn3Cmnw<KcAF?v(?*JcK>h9ZN>AySMSdM+|K9QZywT=
zei)psuao#6PiIOQ={$LL@a)lsXw={Hq05bRS^<7@HZK0-pAyH@0bhLCK=!8#cf)z>
z>>%sYXq^vyBtZSgKaHPXN~rriUs%H2)g|rt-1?1k64G#Kc*;$6g6{cb=zU)aAMhE=
zkKN(-m5ucie|`N<=&bt5HUH&7#~)wq4B(Rdf2~F>p8wBnwyJmY|294=pZ`<ugV}U8
zo}YIwpu>2h0of_6-LP3Uow7~f%{ugTG%i#Owf5ay>$N77!bWAoR8C`7hoLhQL=rfs
zA?&!uOivTl4O3;2<r+sy_WaZ(;jHXP!Zjl?jz5~r`T8>Rp>7u^fJyZmcvE&#5M_GZ
zz|-HuQrwSB82q*)mou)h;S8c1)h~89FQ3ksvv+t{@QQ0|WLAFbg-`$X=H>3Mg^S`^
zp%8*7UVQs4;`5?HM=6C0W^t5`QG~Bz(n$u_{)us1TjPJX+|nAb+1o$(dG|%JwDxBI
z;FwxKSlpLVtneyjYpsQaxilB1e=1AiKH#Dc@|As1lhXWmdHF3ay|uI~7p_-hNYg}E
zTa%HiSBn~je8sjhit!L{Mdd1sz*UT9rQp(XTN&k~U87*-ViCX#v*o-cx3WsA##K>+
zo6<pQcy4wXx47D<Ir)m!s}2`)mXxbpaIuTU_}8n8ikZY{Wh2)L+jJMutR0qWbD{QP
z%qkr&)yXckLN_bFa;aaJl)5+-V5iHV?JgL01Gk7AZdO5QS40N?NhujYbcIFmZ#A9a
zP^uLXxSc&%+g&czO>c8MEGB*3T~h2sNQZyjW)iiAF8Ay?mwUdfT;+lxE(ciol|e3t
z_&H*zTC!X%EcZW4%gJIYSw!fy{>lZy9}p-;=!l<|%}x3Bczq0$>RD^2nIF<#R5$S#
zH=N4q>c0(@hUwH+14J`o?Sb_ML*)QeTLoK_(xC&|(7({o){m^tAU%wRBKLQ0{RqW{
zA*88aN&QPI**Z+<XWP?i89#RJ1-KyG`F-PF@H^>%Xvw)Z2$Pwmfl~KKTR6w?R44_K
zohQ+sq>2`zXQ`d)WeyC}(SXmCNfup^Z0W%=APKB4qFtqg7MzL8Qe?g?ODv$dVkB{H
z$R#vlPp6rZ@$s8yFZK@B+=hxr!Hr|`>}|Ad6SAfHJ@iJAii&0nVP7#sWLoK_)E%RP
zvGY&r((mg@o>kZt_{y&#Qjv8!Kks&S51$`(I>jBXWO5`mFzTOAq<nU>1Zm4<(*pqF
zv{%Wk34Np-^JkY%LB_!O7^u-GLbRx=3)=#YCYGNqR-nR!N+x}ZQ6s4q(we~j;(R*u
zhn_<dU&|(fN>p@r&{L96GG_cs3n3mDTG_}5Z?@Xoki5|kW+5rj#nYawF!uub;&8b{
zk$R&E%>souDpE?(Uw#oU?KleJRx?Ni={QoK3uTr;Azh|i%Ta2xyopjxPWzrx*66D<
zKxgTJS-^O|mG*usQD7@p;(<}(feGS^UU6iw^e<FfWg@3d-)cM0{LP%Q_B72gQPl#7
z>+RwbHkt`aTqkCaZO)J9GZJqb_EcXwiHaF6h4@^NF*)<758xg7!W&@nrct@acl+GK
zTlzu2?hWqY7d<q}=}F=w=15q=F^V)|^C+drCKqX>LE`zNifv_pN<bn5J-w7;7i%mj
zwv|%OEU1dnWX!@#mk>a;#mK8tTeVb@IuW==R*QC_>_*LUn+jMOG3;{TFr|VtM<FVj
z+L=zb*B^9HwsY?Se=8Sw5<%<816AbP^fHjcs>GNJ;DHIlDDZ7+38TQgBf_a}qG`Mz
z81MCK$9V6g6?kA2c#u|LE8fD^f&$Lc5)Z5r`CD1iPqV(iq`se0|H=aqaRVOE@W&WJ
zJvB@Iif6lzpXidmW|h>i`0sc9?~GUK!VP&J@LzSAh=o(Vs)|hTH_V>S-k2=%4+m0q
zI3ArAg^cNBunNY@SrGla5d8%ZtsxqYjgpl`Am@uf#s_V9VS){ZWYOpie@#@Ox7pM+
zspc%FNV51sN}CkS13giEG1X17JIiTr5<dfcVg$?~a8?-yb0D0Yqw!&-!AO=~G!`FL
z8j57;g(LA{rGfac`Z#>J;xK%;!YI5`bPabq77;2@c+nWV^H+f!FT8LB-i>3W7Y)F>
z`7+RP`oFt~gU?0&cfY1qi&Nh~ZKmisnN0`&$;lFeCQC1(=*(XUcA|6$JGK00g-f8q
z_ZDFiFS`hj&;AN<{l#!Cmiauk3oqiB&+{dK;|%lpA_hDczkL2Rt(IaJ+y1>$KIiNm
z>(YW!Y3~w#u?2<xA~A6J;y-2=U+?}$`rfR>?|*F2pS$>vTlg%E{|Im5IsWNzZ};iZ
zTGhCm=itfV(b`&7#xcbWHM{8ax`E&4>4{%6hyG1mwu3i5F<Rk1eT(^N!gqEaLOkY7
zJzPaSn2!>V2vJ`@Fr~-ra^gX-sC^fW-r5@D7jEsW(T^`to}*58dfJ)oSZB&p@-2PT
z3729OITI7^uu42HqRP&)EhQniv1=4jfvRu)sQSIeKQ10T*il6^UCcsXlIft*hHu*K
zd#PO!e8c=u!Ec&D-X^+{G1dg3oO`@c_<|{sLKfAsL6}&oD!HP}NLOVXcRp3r$O%;^
zw+h1B8dQB9V-7bYV_OPAIGbwdbgca$QFUwT4f%Kz-z?xw>F;zppWxtkJWwhBQl}?e
zDfW<uF>OW4AOAb`0&jMuWnfACU$fp!#Q(aL=AHb%jn7i~uOuB<kl6rH;GOZr8%gkO
z-<!+|e1Q<Xopeu$qdU9>YzDKP_(PA=VCV?J6V4}hf`eNCRoEcb`}h!NoJbRV)%oS{
z)xnFuTakSuuW&L@E^Biu0JURhk<{Ek8?hXB*bX<Miv@4_&ZwoHyg`L1w}0ySsW1yY
z=A6!&AYe0(h1o%g8ck7w*Rj8D2R%nqU+<_|uXl`WAt`5y7IlpP35*S+M>cdbQADmp
zwYqa^V+C0muzL!S{t({;t}{i742-iHvv{Xs<2M+0B2iRGCB%|(<eK&{#*R$Idv23*
z#coq$v#8^qGw9B`=0P;sw2C*GGWy}YrD5=d25C?dvu$*$IV!%IN0c*kvQ!#&##8^a
z<iyd66{6nHOtwob`x49Y-k)^*lfpOZ<QO0nS3HwBp3KU2<Jqh#xTj`Tx=DUrFn)@9
zX{}|$vq7i`n>Y{TYBx4&NhD~!@19OQ?;Pjbdfx04&Jq8fLge2!_^!1L1>*OZxcGfT
z#O=dP=NQpSfiGPGhXv^u=2nw;h2@*0u~EGK{L4-7t57^++_UDYz8RaTDCBcK`Li>}
zrnjo0NSiVlIk;mn(QN^m0^`PLlPWHfAz(`=lhMtTVTi~W<)WIY6s@F-444~c<Ed&h
zB5N8s|3dT6G!wKMrj)cZl49O8Qq%aHJR4y<qRRD0Gn}xee`)%3`s2wZqWCMUvEct-
zcJ%5C$m`jVaRb{(UCTQvIVtMkI=Ub#q0#iFYMYsJ3F7Kf#dGhxKe;U2H?c11K7^}v
z)JD-#38nLk7svk4>yGA=SjK_`c7%Q6nK0tgl`p1+qGzU#Cd|bpdNX}*o~V)Gys0=y
zu04ZUC)Z_|Sq1bh!B<Toumlm;M8u5{QRxlRh(gH4pQq3?rBuWOJ25}PB6hL+7`|AL
z9)YJ8pk=K)smT!dE@!papfZ*k!e*kynn_H)mvITwd#Na!r`K`KqQUt%{6Fr!3lf78
zrQuuF>E)|!T!5Lqj+R)n-w8eUwu!xvRI!N^kt(=x=1=2jEhJ(|1FkdslQM<pNNjmX
zcyib3(K9}pd(?Toci55FYbpV*TZ;~ey?Xp#ox}Zu=bguIo^_tQdUJ5R<~C|>`2KM3
zXz#eQe{j5a`19_IwGc!l0`c_C%hyJUTC>&4>r4%;3zU%ig*U@=jOi{^CBQN6za^1>
z3(BcGjYHN@D+qqe+L7=JCP-x{Scv!boqI7#q=bL3Iumt#_ku~0F&8(&Q1VFo<?Dwv
zuGWy`Lv``wU5aVu^ffM}mXX_>U}3w@0|;DG2T@(?jI!T65|^yH>R8V)dZlI=eFUa>
zz4eXB@~k(LT$64|^Vnu`w4DczFObsKSG1HCyRSjVt{wgos;y6;b~y71>3o;!-~mWP
zJtqJe_EeG@1}m;az;ybhk<X@{!hhLLLZn_T@jB$#Qowtf>De0&8oU;tG??Ig`LSF*
z)77->j-+s0NJkB%8~fgtcj5C55rTo*Y@)%JmBv6zH)cF4Fg7VP%C=5y^RBU2+swJ&
z!KC(az89p;zp-M}y_pS`Wh-Pj8p)xc)sh!W*=jKj%p^!_1T5A`0UXWKv;odumg7T}
zGRpSit*^CKBny8hq?3M=oag$Dy)@~k)*`UJ9y)b^5c=1hu{lk@tsKvRPX>FpKOF~w
z>G_FvhzTIA{|SL`A(CaeG)P&^N#4@r2jsWQXY)$)Cv&b4IS$dg$b%;W*&fA8`n&?B
z3AqfL(oFC@f&-NvWwn&r6iV-^Y*Y?sbyDkvQ=o;mf98BbR>PhLVCQ2T9#X&{!kLUb
zvEz2*HFD3bj{j?KN)$WS*Ug{Iht7qDt*VNvIHoS!Q}-fz3u;!xdf`or#H78*MqMLA
zT$hc`i18Vzr@`k3ak?c?8m)knYB+QZE@LOcS}oI>(7Ih2UxnM31=8rM!U&k8ZB7$P
z``UmFb-l^dr=HBl&U8Lvi3vT2kGBfm_U58xIN7_6hCgR<4z>7(M=AZC^7o{_HJ@sk
z_16gO%K6E)|BpnW*9ZVx7XQ_(G~)4J&3f%_|Nk~VE9d`_#L3_Ynjxp*%^073-16u2
zpbZVeWl(;K@KWDNf<4|pIMTnv^Y8lH;i+7?uqLSlu{u&ycp%<meUkwEulhR-oalxD
zf&12gA>l@Vqs>&kdg)qQKXQjS8>^DeIw$Lk=bhab`_B&w^yT&L^F3?<r&VJIwXQ5U
zu*_FDz{lZr^ri5U)=a86O3O%Jc2)K6U@+~F)*{^~X6=C`4NM*ep{fjn`u>B_i4k8Y
zqTc8MQF;nJM8KNT>LoD{5S$g$F>@Yh>(?NzzVX4?RE-oZ1NyUynTj!%9x_c#dK!5b
zq)23H?~f2Z1=R;{NHfK`{R>j~&nI(E0Y!9R6z+YVN2leJC~B*G?SvMU4C>2zdZhrZ
z<m~x_SCd@w|EwFFeKq;-y3JNSA^#h9@xQn7dAPYwv-0@N4;=Ou(qH6@7&tVAc-wS#
zMy4M<osfC&j8B}Smp>6VcvDm>oXuvF;QNOUQL=nG9-j`qGEKRMlZV0i85es<;u5=<
z1R<D<Z9+OAOv#t~$Ij62d!xV$VG*cLpFWkL@CD;Jse9$|^z@-B6+ArmXItt=d2%)(
zh1_{Oo}D?c!iNrKDQV7L0B|H)#(kgTD|s)SjaLTA-TDsZ>PJ6-q@cdf#?wo_uLzd>
z*x8-KYvb%rNdN6!mKfe>z%UZEro1WdoREd(R4Z-;_33Ywa66{{dn9;dCmNd&q)MO7
zG&t20Tt(oZq%-TjC(W1Y_q^|^5XwE#m7GGq$nduSJcgkvOxDY}A24=AZh-7vI;Vsn
z?=C^0VE_@5hYNM79jM?FZyHdAac`zP8C}K{@Tl+%j1i1aW}kp1ur>%g829Jc#a5RU
z5&HxPZ6;mfNY&UVaytXBI|M+&7_aqP9+~l+gC1s6zYj1aM-&piaaFw@`ZVy;2oC}1
z!Glbo=U7K&6Zm{Q@K5m9<Ni(Ny`dkR;eKC0@6j?)0uL&(Gh05ys^AS7IRfHS2e{J_
zj>5gv&;-PtDRKpP^689*-0F|dSe=mIr-nVQHW(B6N^#yl8Iy$lgg%m1Gw^xyNe?-3
zjnnOoKN=k4kUBtED<;Hbj7D0$3eLJ>>MMN?dx*?v^i=n33N%REjb?s#=paKY+Ku<P
ztnv71&pCSa?D&`6!#!vJ$a#JE>gWBZdrzH>-6Q(FQF4CSKmO^}n`4Jc9PS<*|J`}@
z%-KEoyYsjGgQq2D@7LFddq+pkt3yEBfBE{w{vJKXHHvSZ?jJmN9#hqWSI5qaeG&x(
z_xKgJsi5ue9Rc3Uy~8Iz(a+t-`!Dv7|ITyq+5YhXAU}I`=<GVLcMp&EpS*dod+5A=
zbNKqz(H<f3lpr7MA3TE#Z13gX!Eu=yrf1IH&-BAN`iZnVv<7gyZ>SrGK-78i>h<3b
z_n-fC?ELiV#nU}{_;`=-+kO0EPg<kiJ$bRa|FYyf-F->gAlG_DfVh(=DQG&s{IrLs
zXmywV|Kxc8)dBkR<ki9PA^j{-cMp%l+P~}{?UkI}!~G*r=Goz^m)uiOmnywtI8^mu
zPXK}P_5e{4{C;z^7s7O&?vdtt@SH~LAU>cN<cI6)%e4RKeW(?%9X{#~MJa%VppQ~`
zqxm^hAH3*%>`r}Rw9ZAl*{M}aDNo&MJMp+#$K&-cj`i3$Z~;Zjde`%3LBTHVsBdDJ
zkPzvgkpgQx>mzAW3YOnHN^7fCcd|+mdSNm8o?cG65i3U|>duF=?=fRZ`9ogiK|!mM
zx_@TWwB1oTT7TnR-Qbt<a3fc*qZ;%yqe_ebs){__SW1g9AL-uTJ4gHfv$s}lG_5#b
ztFe#Xl*E4Ly?2>GoRR~hr45Ub3JF=5%!ousmEI-sJ6SnN#tKRK(BYxBs(FDJHIED+
zn-1YhC4Z)=45`t9F#CH!Ay88FN@o4yg5pGm?ywZWFUCFMC|Ro_ic1+fQQjP5bDO%&
zwx}j(aVLDG5vn9`QUw$W6&njU`N*u<bf6461V3Cx*nj%Z%9j!%$z1iPRQ<vUgVZm4
zt2P>6a8Co(VL*ZB4a)eI7B@;XjXa*zn)t0Xor=6OmB#)H_@8aukbGmw;=2ZQLotFB
z6x#VE;IO6keRT|)5bQU9Go;Mhl5>ANpT$OOZLLQ<{+=yMXTbyuQR1s{2+nU++1)m0
zoQ+Tk#d2V^I#PNHFF{I*eHElKg@mzd&g>_8IVYd$PN&^VaVW1Q4*$7sb3=>^Qs%98
z`l~Lgc_PEFgGlBx@pR~3Egk+8LR*8Mjz>gr8=2K{F-JWU7d7TLipzo(0diM)acIsn
zxZf&o5m;0yI{(s7Tz=9vo>cjX+oVV8jE6k0@$;(W{z>7IZ~YUfGyk=x?kjk_{~TVP
z{oR8_3}oCzRk>(Z-CC_u^WN+@x{C`2-l|${Hrv%ozq`1q9w)16zu&A@d(D%m>bKsI
ztn0j3_bMlimgm*3fOW6t^}S~GDp)sb?Ru}<+%~Z$o9JYrmJmhy(S${$Ut;;wyY(y~
z$XGh>Vw|zE+zSdt1BZLxUN~eNI;Z0qzUw=b(v&aFB<3yMy5(Zxv{H(evOs;)N)M8P
zv%`7KZOZx%%>`?oUcH?MP9ZGiY&mW*dE_>}f`;Xdbu>$h3e~3jveF90)uvwvXgz$S
z@k;I$7!tIYunf{DqRK8#({BpI{9sWy4_x8VoN!g)E1uRh$WuytEEZDixzXfJ`2TYG
ze@W~0&%G;qfS34x>(yp8e*Z_cdguSWl~3;c50Cd>yx4zrz!w(~4?Zcl`uZkh&5X|_
z;TYa|;~AiS<F0w$z&G9(?$eKwQ&(9eD)m}2kXscW1zfmjl`i3KT)4et|7Uo~$M;gA
z!4;6e>qk(Kv(D?UP<v!nm$ozNFA_CI_p8h3Qw<4(7XJ#}g5NUHt1iM|X1&zTb<N(z
zS)->EZ3DP|&UKekq?bh!_KW5rN-vWt5r|xLIiGZ=-nB`yhy()zf7PCbqkDqD>|=Uw
z-qFihtrI6UQs9J5E`gKMm7eNKbv1Ndt;ykW)-94KyCV8qCSda(+@Ti)A=K`Y&eT`y
z%vM%!tVUPuN>)$eBwExNx1>cptCasHLsYX5*Zeg`D2FKN4hCOGj70El!tA6IxLv3J
znybp6^?1w%HOHG^)_t>CortmNP4=c?LSIo%<?B`+t>B7-n@$(s=)9ZN@hi-e>yBa;
zj=C2Q7GwKI4Nfrc;V3~;tG&tDryE(sw3cpkEkfwl@{U|WO|upeSrJ$0NLagajTI<&
zxAM%t8yjOk-v4@aGve>X>h2#nqzSBD6YKh)e*Dg<tUnpvfDNJ{g#xsa$@<j_Dqnx-
zRFl3sV3TL`n)<T{^~_1@R$C=!TYcJJ5C1$PH}F6DgRf*D<r`DMz<zfvdH`T>osnFr
zGqvo#)V@Ynat!L?G39^zUvp$rO?#U(p&fJG@w+K5)Qdsi){|m-Z2#Y^duiIjs(swP
zDYiWykH)j{Naab3KP=<}GM@~{yvykUl{0Zxk`oJz_RnoR#%U%8Zyb5UA^+Z>946#?
zH5y(zhyKL*nas*x{Ly=)SQ>iXB#`()1iH#D`9JwUn?jBF%ahX=HV4Ra5>GYPZNT%Y
z_r7C%Ny8vTWy{D0PG2fUosfMhGI$Kn%$1VX_wd+*bX(cc18>H$l_1D;JREKzJ4SiK
zgqS7pq-{H|7<^h9G!3_N*8S*_t?rE^!c@BquXqB$plm7qaW&;RN4Tav=B}i?p>aq9
zpZ-`+ytEpN-sxGM_D-f}%A3p=;p9qrrzX<B)zP~@#V3FM-&uclQ4Y?o(8iMUe-*c$
z%>P@h-tGV0#^>8_9`^jv!{CfW*opI-vvKhs|MW)S20jJ*Wy5(y&)f~?t+RtbtI@iH
z;D_;arcTIpp1eAE_K4HMe9!0E?Bm1VS2os9{JTl}XZ_@w|L^9b_h0Y)Z>!=a&;PdW
z=KrmHmhb;BI07)A`9m{FxSVd31Oy#0O^1_G$i)ZguO!Wfsz1cZB&!hBOg_x6bKbq|
zdFeHcS5|#F+4>35VV#rlluP)dQ!DkQ6LddCFRUOhsi@wmW3rMvG651f4M=Y^U`6>j
zW1(YN)QU20hN)0=ruDRg(PnxT4hvf}3IzrhR^3SkktI*dCiD67QQkr!jJPin)FP*$
z2;(WA9q#RQ{_D-b-$IT1CC)MtIe-z)kqtRc4^hE5uKSSwLv%S#kx8zTfjZ<HUcv2`
zGLG_+5rWiKgai_sC5A+uJ-0?gB^vz_ACn{>rjCXp_na|^(?6Y;h4OQabDZq+KN+Rx
zUz@nbRLw`?MH4+n+?zs}jT00rgh_ll=l&=}4nMn+-zXfRV8=+8PD+yZQL@!AYXGtF
zL|}GsR#Of3f*DKbWxU?Wu9;oQ%C(xosz|;Zf00@`t>A(NVuKd19lc&qGrN-2FlWLM
z@~it~0^=+R%_E&0LXT)>E?u1!A;^^)iKn%d$|zvixUu1fM~Y!~)EyEbe&CN}r6}2?
zF8O0TYa@$?;I|6NgYUZEMTrt#;{@|~9t<y?Xp&n3zz_6QG~OUemGD1r3X;Bv+hgBK
ztSR+s%e|>4Lx6U(oFg(6lIo3!%HXphC+#W4E$h6HHsY4dlz+9*R6RKGJ}p9i^xaI-
zY)Wagw*}#f&Ol-YpM_qWYEmWLA_|3_0iqYt_^Omr7-+~TsvVueVHTCMO1A2u&d<zj
zUY;hPS|gXr&a>16meVw@wsLr!dIim-Go9<|ftv=5XeqKN0vh>d)xdoNC*J9FJV#!c
zGejSD#4a5aim_qjUU=x^%osB(1N7Epi2Q$Hd#WMJ;rNXuew}~)%T)Uez<W{lKh88l
z3#QI2B8T_0dBJ7`EH69Jai)~<99WWKeI;~r;+lfss*BNrB}HZN%eg+Jmd+*M!z%z%
zl8;8{$VFyp`2s-z5I9=aX|5bWBy?Wx{`%y_?$ObfyTs?u?J$C?v|~4dDXOw2BjM1C
z-NWa5otHQ>&o7I`;uX&tL_{dXp9;!%uGRmQpIrW*;rR3`-v8NZxrzKg4foFfb1R=~
z`G3F{hWm#NBUyBjm66__VkI+k8sHYVKy0@0Db7(L@hg2Bx+L6Ryn5dGdH1lhf3SaC
z*ciHUGm>4dnk-jME!XL$lq{=Q;b1n!(NtZBu_`%&9It=K60GtvSEBQD^xLq@-HM@X
z0@PsK=^?3CL3&igBF|9dCQenv8x6t&sTHfsDps>9cDhTea*;1~AV`?R+Sz#O2drZ`
zYVddi)IS~J;+$_XE*9f9RK4t#k4muyGaH}#xMrCkc6x>TsEkcd!g3U5#M?c7^>Y77
z=Wy@E?yq}KQ7y?;eEUt>^KP%7`KsJ2XTBV|)djC=|LWEo&42Y;?d_~m|N7Uzmc<sJ
zw@Qm8k|8?bYZ2^<)5}epHm*#Yyi?JbK0ADPJDf)u^G@UPl_psRySw1`m$dj{02O!V
z#8%PcD)=s+qV9qzdM%v)MKj}H!|J~V-pSWS|H^VLqu<q(e&?NM{^;w@v@D8O{xx(J
z$;&-WbQPVWE*;A`M^WYEB)v}BbnS+<G8$Sm$rm)XXiZ(vT(#3nuh`2~wU=JC7m~Bi
z8T61GZahP#iD0awcY^sjtlWA<fX7z#TV2%M<r61s-du0e<<to>D);hK?=1w-%LAZS
zw6Z#wbH9F#xqmtw_qq$r{;x9gG3U$Cgukky+v#RZH?73p6g$Hka1}Kb2<E7-%iWk{
z4`>9Tc!h_{uQ9YL5p!Z}t>H+F0w0O@XWsC#O!{$IaodfI%A(1#P;-Bw6m}7P@JOF^
zC&;AlpNJAq2>ack|5?R}nnX5|z)rFCcj>&Fv&rW5-*c+VbK_1;z6pd%&V%l$$LUXy
z_;bhk<T*ss?<8JQa-3co*KbPZf5|(THf6`7;UzZX&bvC@irf}{;;4HHm{>FpGzq9U
z71^L(AB;)(pK=z`KxNew>;#e{kjmEy*fh<XQtY{{%V)jS8c5cAky5d@CYQ%6rqJrD
z?z>$6AMx(WbqRd`*J{q7rSX5&X3YOntJWHK{-4|UEX@F_(tqq8?j7uQ<nEx?hp(P>
zo^(v#kij8jVc$8D|1zIk^Pfb`SB(E_G#l~w-%7L9yqo{G@yX%;J>e{0onQ73YSn1U
z{}5aT4?lH%D)pnz*cLBr2g;Gsg<zZhnLi}u<-(t_S~O9sFTSJv98ofIO{Cnv6^1$h
z0+lY%e<kO>l+}CWTdvv@<~0&K)CF?`SXT`<ugl@}iwydg{bxt}&kuHA>^&_A;Nn7f
z+y`2Zr|14i&N&X|tl~tMZ6X_6cj(;1uIewxdxtNnfe<!t0!OJXBP{lQMJntV4*U*p
zj*fSa-yG?;xU5kJeJsQiw01srhlJui6<)zOroc3|r%m*rI_WWvD{l}EDs7@U_U7H$
zKCXtLf0e<0<jwe^OHwOGb5=L$3n`NW*+%A&H0D3H+QY<lvc|~uFku)KB0wamq%Idf
z<`~{w%JqY?++Mh0TvZqX23vhzb`P<J7Ypyf&GY^#Utq72ypOz3f^)1N<KduV^~LCf
z^)9m~5)V=4f@Vjo+R_=7`7))es>P_ajO(5=`Wsz1UNFykFTXP`0m$cj>4}Tv#!J3<
zWfE_rS-(ajCQJ?hM3a%wprPBt?X>Cwwe+bZ2wG6TI7qMQ7!WHVz$ch_3ZMwPictlH
z(gY%eAzLacac5}R7B;y3Y7wDQ{&eaMy^q}y-zV@3jotVYUl^yRsCDUcrbKo&*U7L1
z*v{;1pg2U|wQP>8lG4T?{Sicz{X@P{6ya0<+`!_X?jZgGG38x&{g0CZmq64TzOXnm
zP}!q0>agTSY&dZHALhbLnp-$J@%wIbEPq7mP+E5Q+?-5egfp=ZgKxd%#&*`NTUPm5
z$uY(%x)s$NK>aMdLseB&&ld}D8>KXHuJV2V;(hngL$dCX)0>|n@7~Ap@FQR5+#Rt4
zf)+!Ov}CIG-{V4%@%;2Gygihm^oKN)5sbtz`rVOsR-p2T)`R)XyC}*PDpH28*BJ4N
zJHwq!3`Rh+$M=&*i@Z#T>0Is!Vc&x~qUiDI(10KwkpknP_}O?k2(yn1#tvf)>)P?U
zQ~Fn3SVA^0?qqa^{)q=TCDbRZznh7pgj!Vi(Cp-9sbZI)jVDeaK!e1NC&=@JXemHc
z?Mbgf#|+>ypik^b>GnU&{i$b>6Vy4GPYK2p^!bJFmQlCNOudPx?r8-Q0tuJjghWss
zAwpQ0*5lqO(>;|k`_ra>eE#PW041e`Wr={e3|Lz<i&%3pM6Efw7fol;Z*ENBF7zv9
zUsj3MO0nOuN%>VGv~t;h>Ke2Ub6g$sdF4c~OY*-~Y7IB;|G|;aJNxezJ}ck<C~=+o
zRzrOPBUEljJ%1FG%xl=8Q5(gh7w3NOxB6S__mFRXRhlXN#>E@zmlP@*S5NGdK!v(J
z{-^}21fz0%D=#qEjXCvLAo^2<1HTUVRwo7`X`QuO+jBIJ4+M@M7}s9QcLR=+qP7a3
z*A8JyncBM|oo#|FQps&SI;Ab_NMZk@7dA>wlq==%)=Fxg-cp-F`^C+L&}`K@c3O#h
zVXPk*<!X3+yh*5VMAy=A?_C0K#!iqkC}psdwsIJ0lWJ)_V3>CNx^)Gm30HwM9)<F+
zb3!Zo)GQrkrZ{3AR6L?8sH@V$q>o)^G~OcBU_)0jK|Q+nd0yPGrp(n5?R)<4cJchO
zc=wLOx8uTtk68AR-oG>M4ShZ<vSZ4Wq10F?SJZhb^jHprd_6hCz4*iB45*eVV`LMw
z93!eJZDOy~v`+}1<#OjrvQLkwCI6yfj?hppn4Gxel7Xrj$ic590(D0WF{pTNXo)WC
z2MZNpV7`w2YY5I^ir~mK<SCNV07a<9*va`%tE<if2X`ks->Wu<wnDJReJ3b6r7fy}
zPFXb)Vvh-$DM1zK*TeHYd4wVco#ag450of~q~tIrCar<iax-lxa?5<?l0O~7$};qm
zhY=G!5NWNQ<@tu)*<vP&?ttES#%yDD)$E{gm@M8hP110oh#e*qRKvISBn@5X8&9Y}
z6mF4h+&lx8XkKU>wjn=_3X7N7h;|ZslZtBO$o~=!%LB(XrIYG-f;Nw2J}`g~c;2ZN
z-T%#FW$YhhYXw%SHND|{^glQhwe~-63UyjO-AYyeDaNkAQ<9Z&PAUQGYtai8kz@9$
zVv28<#rGrCwDaSSj=J+bDaRK|Zd)??ILxI1-M*|FdIg1F%KS~tpdWC<7M`Vw0qLV+
zNd+PWIG2hEuv3rcR5}*P$@JqAJVM!JAhZaTRFWueQPmQ(2-(t*lu<pw;|jF0TU|!C
zp=Zh>Az=!=GI3piTTB$?8&(4mA*(gLLcw9qF_{-v4ZlkG8?0ccxIJOMjKs>_*~ZLI
z{`_yJgZcU7N(tbW#(%Zq{=aIq;okZGZsT+F`QMmXkhlAz_q~MIM(o2SI3e8KeEf5K
zR?Po+r68~+^S@fJ*5dcSwQ6_s|5iRL`~R62re2gzWflxZoRozAs%U|eVfPdsJQV^|
zayCC83`lbkm&RYb;V*a{UN_sHPshD?L8np*zq--aYV@@R1tc~2A5F1(0;G^;12~>|
zv;G<H6Ec4ESR~l5o#Q9FPk!3#9K1T%<FFGT+9!>II$5}Hpd((A=wHB!VpJ{)Fi%R-
z`<0?q;#pOMILH?llI+x*70`>4Gl|-^^Pgyv7A!&+IU5X$%!=-tL|%}O-64$;3UkZp
zU3b&FZl~oA=>$8|96HtHu4K<KoD-Z_nfQ;mDS#uC6NZMS`}*1kqJYlWGQm-idOL%<
z9^QW_8T~pRfAltT4#IT7D168mg%1ly;ltM$h3YD!V9glS+@VhEW{g3Y;JT0ajkHnF
zIcPo@v`<H{wi25d^H?Kz6t!*fh?oY198%WcTH&Gh(Hq83v0QQI-4ba3>nw$w>;LFF
z2|$+Y|JPd8MErNFQn_3IZ{xFc{ZAx41T%Dor=2O}1@7PGohU~R+VQkgXYOz{_l)F8
z$q9ODedi}rdNS>q8+;lXZ{e5+_5l5Upl+W?9>AP-Svtq@;Tkonp>Wz+5o#|tRO=3M
z=~pCd5sXEhJM~7`KQv@6Nu0sFuj92iITw<j1!@l~iE3|URC}wSy7yu3(+Y$=gluHJ
zsL(QWZ(zKxGzPT#+8ujFi~ZIoe=s}KI6LQv*W>e$=jSB)x;VtC2I6b>hkeYt5LK$V
zJ0aI&yCnLxwWV^ct-uBg`9ME0(TTA`f$HCP3b@*t9y}>jE>6^^2<NqiPz=Kduu1rn
ze|qMOrvq>5^!%B532Y^5^wGWfM)WJCX&NktMh(vPLapj-r8E|)NoTPp$0yE7e25L-
za5fU@>0Dz3Y}O-9A~a4!oRyXcu>g!wuV%0a0cIAFn0BLV$|%}pZB^=q1WwRfia;+9
z0@o5Ft59quI^Bp+SOvTIRBzUnP4#F17LGvbERumRCNSU49!=m|n8=D3jEUT=|CuK8
z=XsWf@_BA5C~9kO1@(j=ueLhq3jgz_;PQwRYGf_Hc-}eM|DU~A&pNM<4~v;<%aYcT
zoU?Lk<_`GR&}JB+Rg@WB;Rbqeb4t!vAN3m@%9~e;zIy-T611?WViA{(#w4utbfHGI
zm=zcC;v#)Y7*9!KAlW(QP=c=|dljP_qIVgsbO2U_O>VIqieoLGmx$%0=QyUHc1Gio
zA(S($OUeGRI4evN^m4d-xOgS7&?c5*Osn-uP%%Z90VUR3oeBhaDby4iq%Wq~#=c?J
z^Af4!cZlsfhr0*Q_tsps&lA4l$DO0&z1M5ot?=o=;oj?`H7c#sZR+V?-4WQ%4-ruP
z=)ofcnl;Up_W_e7T*yhJNhnCtwkkPlQl|(5!N!|NgeSiIAlUMcFx`Aa2`xKJODt?4
zlp02S9FQH(3e&LA#;f@Z(~p0KXVn*IJBw_VKg-BOMpWvk1nll-R9B+8^f5+rR+<$#
zW3;C7H$m$ZwKCKo{~YwTwA|$rffu+Nm<O5)_K4Wf(<T9;opO##s^nX~u3TYJS+b(6
zzML#yOIBM*maZbJFCmN9k41||?x?N>x<F}Rv8829!e$pU>9w#_Mv**tFGV^J#yQZ9
z57$b2Sh@Cprn9NH@~O}0vt<9LQLDuFf85I5`On+=Tr2;(@C8coH{#KO*HQJI&BQag
zq{DbTNGm%?79M)tlQ>-CS)ynhuK7?3uOr>V7-6G6C!m>)$Ld(uZ0rQx6Bxj9Wz1Mo
z01%h--}5na0XdTi$UmYh0gY~W!*d{zq)c?BnHf1#ax`4QIlM@0M1UkzKM5S)bxsq0
zi<Ch3BgAAuRw6icI0{DFCDqoBq+(T!z^NEI^AWNSsM7bj_|}h{M-$Ic1%P3zC$TK{
zC7B3A5A)8%%N4VNHBiKk*XXCEc(Kr3f^4`f2?1k@UXmAc4%s^7a{4HRxhxk9Q|c6m
z4G=)>gk!2kinH6OS6^bh$gFSkqA_!>$%`g%d|#0lV^jF%coBdjUNo^>#EVh6OkPBh
zuf>Z(z*Jr|<=5)G7$2qFycido_5d-cbY4`iQWSLoEVp@`PiB`X5ri2*dz$BT4;>5b
z9sOG3t-|lt^Fepk<$S7z`{6@lq**`Ka>@HtQ2i9OITkS%7P1H4<QedblvC#u&}*B7
z5gH{vE~Qkvu*GEcqV^CP8Ho5~A5+soc}7HP4!of^^UOA5`uewX&hc|_{L|sy?$e|2
z_x|zTVfgE4Z!g7C2yvT|TEN4o@C*+}b;IK$*iBJih5S(oGhocV?Mf$S4sS%nWUcyy
z(nY~8DW_KTDG-`Ho{B%WL8x5M%4|tRsAnTo2@^ygz>9hmoef^lSgakJz5kMIoeJvH
z)VEnHg`J&fplz~!reWk@%CJB&8bBncu;1xSd`Vmd3wsjE8)<`q%_oEIQe3Zxpgs5D
zlV5S>3%lr3_%X8O5CoIxj?KVR*&eStcK@$nM5|WfNcBnyDyf_J{1L~oMzg6HqiURR
zy<#c@rVZ*<sVfM?d!(ps^yvl&om1wf3sUU2Bo@OIX%TkAdGB4SRCvNbe83)|*X!Z&
zTl!frdoCM8>MSa6oP7bznBY#AjbB4D{uM+YJ3XTV$5ECCr8{C6iVt=Ei;&dG`?^<{
zfIPJR+b}~zI0A~+ssnmIF4qK#b>y9N<Xw)AybC?MSD%D}DfjE$+xYa04)m`){i1xk
zlHayF8mQ~a9G|=DpZI;`ZKI}nPm{*w(LH_Io-4lN-vCBs9^LzP<JrsOi`U188<Nz;
zeu(RQb<KCtK<S=oC-pTHK{cq>yscXEHZlIMkg#y*oy^Y1fto3-og2H!)II4rE+iJM
zU0S4a)1{24&9G}pxG9az_}o0=e{i&S?6}S7$UiBXPQALm7Mz^V_`-Dhixc!PmrlJA
zgD9XBAJ14MDC2SxO}*XudJ^Xk6r#5w>p(t3qA9j;)K$~Mq<Vmw^#aDtU^3GHr9ar_
zv!4&g<M;E4#fDn+rAWoNBA;rh6WDC|7;iWxDPx6Fgf*aNiRBnZs|w0cPWq{G@|s!-
zgj3#8{!@0shzc~t*_Rc#cU8%EePJFWg*?6eQM^IquZjJ_rDP44D@F2N2@~y_px#-I
zi6z^QBI<0XcPN0O=R3)wDWxLkn_Yg81$&SJe2@Y??%Uh3Jgh0uqvt6_Q%YrlPQ%=I
zkybdZoC!X2&sV7dq3^Ghc&EHc$rsSvl24UJ@xSiO-c5e;o&W2edcoJ)|E;*S#Qje$
z{r_(N_clJOpZ^Chbk63do*D8al~g)E$>%vfKldSRR1yGGD><8}i0`bqhLuRB{PgDe
z9{VgdovO<8wu7r}0R`$kEk5*{!62}Ru{iHe3ZhC!phDN9RL$DSQTUj;VFa`2ct~Zg
zF7!k0G*}?PWiazdi9MTi&Uv$wuu|V?Av@{LhjJYuq?GO^RAiNWv9SAM|M|hoy@TV<
zlfC^H`v=cW6HnozslXmZ08+U3_>6l<`htdU)F|;;X~KW-(GNT>rbK332{zyqRSft>
ztUa+Nq~K_r+2kVls+!dTR(^RqAA!)S*U{)*Ii4uu%Dd%Yl~2C-A8$s3;0><01T2aF
zacix5T>dxi<p1q_t`+|iO#G2~NL-sEWOYRM8>x4)P#}?Q;*p1Ep;Kt@^{Xd89j&dk
z!$+_84m-y`J?$KDx|X9gR|C+Y-UP&(jQeLhDKAE_CW13>u#-R&m$C?=>aG=K&76(L
z?*lk1&g|Uww{-!PeP>hQ3|sWP(fgmy{WIr#NvuKD%@+y>!uWfqveH#fTBI7iiv=Ns
zWEv1tOvjgnBt=YJ0EvrhiG15wO4BlLYmal3)Hp{H=W?a2aJgFg=6JjYVeGOyOJQM-
zbiNeJ@x&)fllKb@3y&n(r``#zo@XgB{mk#2vowR*xWI;uQj|a+FZIs4(4QX_GZR2(
zVJZXzuGk0UU;g=ISm=*Oe1kA9ZR(#BV=w2KE97X`#nX~wFJUA`%4VHK*S$p*f8V$l
z{7!@|m&*}NN)Ex(ti)Nn(}abn$1CRS7Nz!n-h1f;)Ng|2+YB_rNiQg64X1dXv!=TO
zkr?_7zzWJr+EvOE0kcsu>u)LzKdb3;+y^zdZqowAYB@g5oXvIIm<26h7P|z^cCitq
zXPs!;nZJL~tCsmxJK!E}I*;eU<rc0W;!qtFk@>5xH42;P&!-)=kkLX(iz}Fh{){{v
zrZ{@Nf4~=z?~^6*KYNELq%O)Vgf+o=viJ?h-9cwwP;*_M=h%Jn-*5I0$-bbqL%H%I
zl=T4)wA>wZCp`N16$bIWt+~qP)KLvYU~Ik=K_o{#aH9flLr}TEJaxktRD4J7IdVSv
z!=b|$2}c)Y@eN;m&((K<02qy_JxK^P&{?f;O@iENmF*mjsS<{tRNJXWIyWT7*D2!o
z{$t~^MCV_68!#n_oPNb5%g8_$?msTd2KW0&pL-ETdZDOd672nG{K@&m*Rp9<M=m1s
zXX=!*VgRQ=SidvH7raMC!^_MOYDXpHY>UqP?Cl=yg|1rrvb*H=p0W<2b0YC{d^{^f
zBx?c^nd91*&KJfy)ku*-+nSJj*i#dQ>$CF!5n+=4chVgs6SstXUr9O2WZo?zRD@4q
z)St`)xF4vUpLY-UcOSplqj5jn{d<9L=PN0SlfkNMg{PI%cuf~Fn9RJ_PrVh_x|Tpu
z*0kh~h9`2zGsTS;y7^<hHwLznHn3Ub@=^*5@BO0Xm!=raJ!!<zY2`+ziq%$;T`_TG
zARZH021)Y>DpTC>43x`PG`Hf)6_O(72o<0gD$0L;juU6*)h+^otC}h4dbj~`9*77E
zsP6&a?&3M0#?$v+NTlzi`qcX{r-?zFL)LbGOqL|lcTcF?>2&;QcIKQ+yQk-5d&qnZ
z<(Q!Y$~c(rHcqzi$ibA@jQDsnA>)i{yb#OOGuC(O!dW}_c-T<M(c93bz)}FuJtE_!
zh$^kX@yZ)DrPlLBO)2<NGOpV&w5XkRZDP)_T;tMUt#RoTjXD;<So_T#T7~93fa615
z1Q1>&paz5SuY|EP6Nz`jb%-p#NC43zM5KmNs<<OBe^5&+H@)?vvMVvx9W0YlDt=&c
zqGVeKFRQ`l!bH=_DABQyLzR0D+s}5XuwN*#6|2aFd2WC=IeG-@x{q`JChH5=e*)9v
zI!c6*kYJ~QC`(nol96w1j9QGY{;-dA%Ii|ZxyD@@dl$Hr(w9V!GC5_WtxGiSef#<1
zw+Hz5EwzHb$oa3~Mkqvp!?uKoYX<2aJW8X<n(BmlE5G>7m$*oIGW1Ah;1+AS;n{gA
z_9*5xf{>;j%X$0^)flNsawmYY%0dECg?QXQ;fm_YC-y(c%SgGA$^}}{&!px^QHv@T
zoxywx0IWAz;=?xFQ>Py*a;b~4Id@WmDP-btMD|AdlC^v_<eO^ErO;ge7UF*;KXIt5
z+<A%RlkfgdzI1nb)g8da{@-eye#HI1^-A^5|9cysW&Ynq?qAIo@BousB=L02c1Hkn
zjdY`v`H&UHf!CX#o@&W>Lh^-78&;HX;qiC4QO|=;H6a-Wi3vz2^HCqVP<QChF4blt
zWKM5BgAN6Dr5~4$+ITCkL*n63Ct#>6kjc#M!VD6d5-LPjt|wOJKkrj=qn&B@6Rt0T
zda#oM#tZsgR!XR21P>Qh(`wisPkdm}?Z3y})Z^&Z>3%oxGFnogqSn@Dm-O2st#dY=
z_i34(pFrOAr~ZU=^G*<dFoTyny(Gy!@wm~O$nC_=SJ{+3_XnL1^YIKmpB+7D&&JbF
z-6^S#xZ99}-B`Ehi?6Xn47U6cxAoB}kj~yeGvZ3AqtKVe=S~-(;;1^CMHv~>uX!Tv
z(Li_lJ>_zVRm2T5h69oMD;Gs3z}rvY!A(IS4qWf*hC{DzDizM>rzeGtd$^nsEla#r
zR6&iPR5H=zjcTf47&mzK%_HZ#-z(oKwFq#&u`$~EF&r1IJH>GMeM4Plww75l+9MZj
zWi9yRlLE{rD5&5{Lgn}GzE5rA_pl9Gjo<GWH8!$p7<k3&%(CjtGOLWTs*HZ$(4LUR
z6i`#jhOR_JD(riG8stq06Hs*XXAd4IR~K{;HHk1UX6%tx5Q33{5yyvqD+g`-4f}O1
zzOvGIsV4X(6)m6)m47@xIU$V?w~w9-$Dh7oI;1oTtyO_YDFAQ!mRZ2KnroKm17lh-
z8kbBg!KB;wzDe1tP{6Ptbg1lPu3V{wO@4GTDi+jY!4pzWr<zko>y({$!FZ%Vl+sJE
zs-lX>xx)~$`nIFQAoc1ubxF<Z!~KKfXPw7yo*`EEZGu3ZxHN@~u%DDc<42B&*4QiA
zt4M7tSvZAZqfV%3arsr!JyP9e>Xe-OmIT$uv+P#DBnI_0M1$!9iR(?LJeZi4e0t=_
zBRf$1&qtY=n1Nr1G$zYw+VHa!;>2bKH#6}2Gjjsy7Q@SrdlGPCNHFynB0ZAq&`JD`
zTdlzpSgmn<l(kCYvZgNN2lao$Bwo)W{i|T~RKEaf_FL-P$#_gMYC~&t&;;m_!(IM<
z!>s=PqfxEfgEZaPef(r28Xssk9rT6<M|Cq307+^9c)Is26F_)+H>?k*x@Q16J@WzN
z`A_?CAU=Zi?=u1QzAWl?-g}pBysXd=`|-2s;`ZLXAELeg`rC^|FyakX^OJ~&$QupP
zhR=TdMYEpC7F?ZY@}u>Qf6_X-zVZ9)cZ~7x8{a$O1A0W`hevX}!gx-@g6Dj@m+_bg
zjmMy-@s!Acr@x1M$ZI#=e&N6PcPA51nN@^nI`1(A#~}_=XsQRqF@m4^O@q&fIfZb5
zZIp_tAdQ;+BC1hUO%xg7#I6U>m0ZHfweNm7>*4V2Yq=fuu$Y~5k*m(s1#GNfWC)I>
zQ#%a^W;K%-y>wiqRpqZyb?yaJNpmx)m}fBY&f&)rsk4YX(}vw_GsdREDoZOxJY)B4
z-9|i#Yx=;Nuon-oS+e9LI-&#C6S!uNK8u9Th|r)_XVI#GmEdD{7_I|Xlk>pRWr<5~
z9d{#Fg=$!#n!OZIcj>$A`fuzy=Fb$7Og&jF@SKP6xQ+viBRrc+k*tMC){?!-09{Lh
z&M4{TL!urcQO`>$;#IhJjfd($;I)WWxA4s~D-9M*Sv#0-;;RSqM(iOy4!fe(ity!^
zQmk^#uKYzW8zrmVdc56?2EHs2A!ZLl2_o}AFDlIA>IW@4(Wpf2s8aGnhFY&t@uAd}
zQbdk{%VLRR6hy#<Jw}RE5*=H**bq+zi`7#@F=ZW;es78330?j3P!<I`C<{)mt$L$r
z#A%_FJW0`9L%lUhr8}=x=}oJ>y<^0_&6{;JRtY~GnUF&WS`+U*OTND)G(W9~WmjYg
z__u@xr_{^rdMuRwR*TouB&5po?8+=m{#H-um^wUckX^OGRU3(_s^)@5n_RP*UpY1_
zx43dE(On)}bhcK_uH5Fz?X=3xIx5R$8`zF>Hl1HQXE4SdC3|1l4eQTnN}~?4e2w~^
z<IlbeoG~^#dE1^N88AJ9vg7Q}5LkqLex5vzFW~^TUNjwl;`c#$eQjld%9AWbl)iV9
zDmQT$9&VYMHE~Z|*(RRgVl<zOXAL~FA2mfG*D9{@riC{&yNpL|ZYG*r%QP|WS13UL
z=9-H6->T9J`B96+=HKdqxBO@@!t%XoVk(bXjG}yR$8k$j;DFK+%?(9LPBbX`doF=_
zJ|1+3Us*G&umN7N^al3Oq!)Ly6%3!{+<rpNrD_q}gk3#D&c!Oq6tQaVCnVj1nyKA7
zUeqlXi2DhFnBA>K8qzykrL$XN`MIBvpUZla(bVyxrdZ(aCj{=w8sEE$^Uyi2EEZGd
zJZ7FwQ}rqdJuj~L(KFvodIIpcn*O-HP#5$YDQ*S7xj?;3b|kV1D@q^RcTKHrzh?eA
z)+!&psGBe7cf+dIT%g5q%Zud>7b!UrvGw;{a)-INJDn~PJ-#7(atNPnk%EUw=|in2
zO476Rg5%!1B`sUbFJ8wql`3sE>jp9=0KNXL@|O9Zp5d4KmbahrwfYvZE0Jm*l&y&p
z!snC)5r(Uvc8#hllC9UBu0Xa})z3Fe@!H!AN@mwdsjx_};az!U?JLA1Dc}Gw;Ru~h
z@#r^0YFY9wa-W()%oby_nAnT`jKiZ*Op}%T=5tC*;rF*W?cI<BN;EnfX);WgS}ewN
zsgh$6*7&)Cmy^`$E4w%mP&sqxU*lPSJVdB#4~Z)N8S>RUnE5A{9c0NWkqQ~(dbSq6
zU<0VvFJt#dq$svB#FE%ZG=PYWlm@2$=^0vRWVJx`%od*RJ<Dq0^vqw-LS_S0&1?Ys
zAm&m4lBxVv<4?s{qw<1?fJ87^uc-%%UQ_$w>$qNIjI~h)L`NSG%p8+NiePDPVW+F^
zW>yy12-+}JazI3F^-yiD0Z>#@oD_MnkLro5BG!WTo!Cvd71v#%jkHdRp_JrXV-Ii<
zE@>c{kCJSJUA3IZu4EQ#I4ipTdE#pwFPx<+7eP3ucq546VJ|50;my_1^rVqXl#pFn
z43tP&bE7C$2-9`Zh61RQV>f|{>8%7!74vtRT)pDG_v}P8ep|a4#&gr>XclJ^+IS$k
zt??jSB@&GYr`!eL{s}($^8ZZ7CmjjW?%*J7IXGLTjV1YiDlUDu<9}=Q%3c14TlswZ
z&BLBQdKjFM9651*b2cvi<DcG0iGuOTmkkL23wOhL>+HZMI$B3|%E@>-(?LB?UL8Dp
zw1L9kbA$jhiyY?po<-xv`iXxx)&HcQtIhw_4gxHh|IMl!kN>Y#@AALg&Sz=<7t?A}
zDF#ed;KO~1j1Oi39Ytq{b0WT9!a(7*8u}v%ea-?h9$HCP_)c~s=|ik&W(F21R|Y?q
zQP@nv5`$r;Vo6EpaW5zozrQ#5-brR)(9wVn;K>27c&q9{3eZ6Mo`^k6V3SJH1<1r3
zRrxndcB@~)Bs&>nTj&-MHof+{+-j3K`rVS#=>T-6gKsbP5B55p;&S#0matDQuE{&r
zMlKXP$IgAL#UxV|zwXd4q^yP73WFCc9lT)K;3aQ|wAX<S-}k_0mKV)lz62#LF96`N
z$(Y4_8yi{VLGL!se8~zSLCFs{B^i=GLP)NhQBmhsA=5s2192Q0V4O!Pt-<ZE(B8A%
zH!qH}a{{SUc^st=?vW%eau_F_kIV)X4RDSkckee~v<eOXt%z{spA(Gk$Q#cCo{SIq
zVABG+{4;i#C%O9A%g?g)CoeH|zW;^GP&$EC)eJJf-aCAmc4~JinZpFzDI;%_I=q`L
zb#`vV{1jn^H+9?8THU<y_-OBVZLQi^lA7nE&dn3X9ifDr$KQ<39d8y<P@e-aF#FAI
zzE!^O2!yXika?_U87G%CeH_k0uF$xKG>daFpQJYPdNYlZnZ0cW<H6!%;2VpQk|nr;
z6P`M9YK^NiQ=EC-i35;$jH?gi5LQ+PSKy9V(S=O3JOxc+VUq7UCk?W<V1$C-H1ECL
ziLnr|OU7G&`SO(*Dg`HY)}7nnYZLsPL^7CUCKzMRhjrCq#GDPP!}W=i^~S8sx&e-v
zZIuM9*{VTlQL%8K?)-s&$S1%3-|hG3=T}Mru*Ckak?9|^|ErZ+^UnUijnDG@uklse
zT(%{{P)9Nj;q_Xh625)<=H=_o{=xCy;m^A-*4Etc#pC17lUHw$2m7bJCx45IG(vL`
zVuzV-Fh8Gk#uIO3+<U4H(~l?JQ(TYZVISHu5^1sGbw$U-oN#`y6X*y4RoEa#|M(Dj
z*l3M>)%oS{)xnFuTRwx4S2!WnYs<CM5OM9;ojFP#o+Q$ylJ+8`#PRsf#GB$e*g*%`
z0%p^0-$<*dbO$3xW|+Fo6uG^b+%@Zl+Qw#b0GtO#<s7*VS5>H#4&0k{IE_^Ymwc4M
zpVqpm-tqb=KU6v;tFn5QSkV$aGuE~!Ro`L?hlG_YuLdfo+(adllhp3cJ)2XJ*Inl@
z%2u(!m{}T@PVE;<&}phzs2*3aj8uObv5c9*C_4Z8m(t_>2QHo@Nv3+C>5X(ym{j_A
zK~B9}S-7mRc~J1TWaNs`7)O~4_jJ!V58u=Y3GYaABwA>34^+n@9$@V!!372n>9hCC
z)IJ|%jE*VDro+xHD12ceH5EIM%_m{*)6_h?D(9J%h*zF1N#PtinuMLWj%1q>W>P2d
z*4Jz)syQG<tp3II*sJb>3k&`4RX%g+f0)>(Q<|IurLV811}@wGaqIE>Uuv~h<4*s(
zjnB36|IcUsFtJG_l9Q9qbP|lyfn;Q1J@P)mMvSDlhoC%nCpEP`3P@~`i$twbHB0U$
z8Z~!$&`PwibKfInD)^i;>$z^O$H^h6#y6h6Z8zDdktFFJ{v}c8m2q?$wEzrjJbg1=
zIg*TJlq6eVdTkEo=RM?PIdP(LVN%wp)zNt5eD<c}vO47b#qkiQWH(10xuNE)rs7#J
zRPMbAEfR}(La1~VmXMl%JVyu~`IthuLG}560Yk*Kw^T+*Ng~bH8YK!#9-7=-lFAq3
z$*jBrZ<sFB{JgOWE4tTjE@Z_>Ha(RDSbY2;wad<6>>(R6()N<r)}zJ@sZ62eQa#LD
z@?||QKdr(}6@}G;6r*)hZCr|Pczx`0;k0_u)hLz&?v={g8uIe_H=U0pooxO&xFq5G
zx5Pu@^%)fYYfnXtJ>Grtx95js*FM#DD&OX;E^~JHE@$H^=Omu~=wyu2_)Ep_r<eGx
z@;0>O^3f|l)0mSDZEgL?cQu!sWHq*eqF9Z`$;n5PA9IfjhFm@hX8t*gGqIvZe8@pP
zl}LN_hJ6|8#e6bgJB(jNB9hD=BlKJ4Cgi@DnGfMUx#-Zh_XQq~U@*cL+}$gEJm<Tv
zm3xAp%y6Lr_$DwiKTB&m8{wCD1M^YNCJ2u9VCZCi>>aU)FhanzxN~AO7|96*{WzHS
z;GED^LJ~!JkehX6s@BE5zJMt4iQ{nfdz=(fdH{(Ge5@Sh9jZSb4T7@DiazwbNx@a(
zF~4Z|)*B7{lO={OZWu{$m872@i~Wl|aBclMBjjJD0lAco?_6ebDwd^%1+*~v-)md{
z6+XG_{}02fU;g_4ExrGb-nC-(f2CHx+yA+h&$aCT4?~sv*@=`m&O;9o;v>U?KXQJn
zmdn+q91M*v`8zm1+}}HLwiD@(hdyMZ{F&{9Z$At>XSifso)_gko}kdWU6({6759ec
zM(NRe9S!0SB>8c|KIKcPJE&4HpgWuR%W_trk&=?|7RN7Hr{+)mDFNcTv2B2%hbsqo
zrQjwRZBvCe!3?_!3P=6DFQ&MJvjLI{ueMi!5Sf`>QmIH|FyQg}>T|~1NN;Dg-A~vZ
zIUAaKAH8Ydebok2%t;J6%0xq@1`vOMA{7{Up9=TSOwH98bp0ah%qm|3tT?-%c_HL<
z<DM{iWbdl^Y5sLx)UaFBli&QeWgn{Wcir!>r3W2Ccv|`p6;ou*^tz~$8GK!Ga&}}X
z@Aol;Hs5dk=u-n4)e3q<<GZH@mAZHC2W)Vf%&+0Z8Q%t`aochks+trTpz}@x6N8!E
zp1%b7kfT?f2@Bc``{;+gT-Z$$i7Zara!nhV-t(lm(3DQ)tA%uV;4Y!emsGKq)}}G0
zONHG=F+=QPGcgXh62i*@717JhoSBMRX$|D2*4A=rrAxM1*T?y4K+ceFdWPz@^b(ug
z+KkIVORj}tKwk^0WPrY=RjsHN&GhD-YSEyXjkz?LLANj3RJR0{su5zP+lYzjEQ(FN
z^YKUT-<V=KAm%6PmV`;z#M7mv8)oad7SNQDITHuXUyzp#%o8IM5iycqUxBR|g})?Q
zUy*p%;c#o(B)Qz6<;`>XN(|n98$H|XmYmHV{nw}e2&GMr{yU-nPU*k1n;bV>nrAGM
zaJ8CGTs-NUPpWt_FrV-}-=6t|Z*e{`pEU5~)O^y!lQZ*4>#ZEz;3SM6LfJzrHvNz-
zGR-@<m25P?^X|!v?*)*@oYD!Y9T|qUQHPhfB}h`So_G7xvAS3dg}XyIsxDR1NAr?d
zXEbIg`i@zhR`MJ-5lx2P%!BvL`Dy$K8XnAC;NXu(4+o@Gu-lC<#i1$;=iDC*a9h9$
zGgu&ZPtF9bPk!Jj6n31!7+3%aon$h7K{$z6G(n)KNH15ZzE#R1D!n~h`1W*p3xq^B
z8wNE#$c3dBmdYbgmoopAZjaL@X32hLj8EDd;pNyHLmH;NNv)$q%8fcybNT;BKRvsK
z2XL|fuU@aT;`tvc&BmSo?^Zs!<G)|-{)#JsJ9~$Rj$5vHTie#F-N#4ftH^Em!^v>m
zB~U-|W*}U7ozCm$`}&~C{=qX`3;cJz(}6;<7pfKgz$rX^{Gvl`Iu9K6tr*re?ps?Q
zjOR#W;eDXlG%Uz3h$8i^7k)eMUZ99Xk{i#uy#UWxBB;lzn7%>mgo+fp&X&`|?Zojq
zp%{^!urH7+Tpjn6aaF4Jqa#3yMdv@|YoWW<D?X%G-<!X?kdF#rLBsjM#N7(_*2%Kh
zPrCitc<OhD(U$pzxTbVEZ34=MZ>G1Z%9__B=fcprP-&C8p`jH09V=#+{-k>8hNI4D
z_x!xu3GuT1WEbiHCt2wQUAAyR#Cb%GU2M6<Z`d1%<sBi%7qW-Ns9uQqegRag_!2uP
zhhZq#Oc8G-JdG*EiV^Y9bjh3qC6n#LiW~c*{&+g|`nVHF)zv30f#k&_J}r2W+?}UB
zNAc7erQa&$O1bP-=+9dTr-s+yQKejM6wUhu<@kf*(U8RFe$Wqd1^kA1U807bMuf3j
zuD08iYPC_VH@DlBR;yksIh8VmaI?N$uWncCEfUaeJgin~)pljO;nr(zb-Ph(Q+>iJ
z{wX<I^mMyjZMkg%Qgz#IttwC5YNge#R%@+hjT&sYfPlhnS^!+P>XOv2w;PQHT1$Zo
z0QGjuZMpUKcD1(MY`Ba<wOwzvtL;{$-l}f9+b&~UZ#AlJz1eJTyY=l_%iYGq=621k
z6JC`@V|%;asBUxp?OLN<ap{#?X}5?JL;|8qrLx_sHIay@RcR3=@UY%)wq07H+Kug6
zo$zQg30vE=mTeOOt3;nheY;t5s%6)$*BkVxRc}<N`Dz;v>x~-0Y_zDy)q0&kQ~heW
zU1>L{PcHr2px5<!$*Gmy7Qw2uYZYprP;E8vu+emD)RbGPwW(t*7kkpR@-`vl5;<B;
zm#71(IQ4R^*`)6k`coyen(Yc6w%V;aAzQD~FjVS|Ht5$VSKVzYxZQ4UZxbtQBQtxW
zO!XSgYNfF)xU~rXCUuG$Z?w0;0uAaO`rjmO*{(Kd_^K5b|Ep5_t#XCP-=;E^R;}Hr
z5xd}FqgDq?)S9hEyH%@l{dT!hrE+cR00G@@6LXcEcDX?yskcp+6oEPoWUJ(Cmn*fJ
zOK1XLYOqF_uCHyEiR9HL4P2{6W47Jgu3*2uObxpzv`s@s|JJwpX|qzNF{OUexKtaJ
zb`vA$mZ?K^Qc2uxVs9F(8g+r5Hrv~^TCGl8yWJvW8#J(PwOp-NiFn&oo;ufbTMPoD
z=n~J@+caAU-R%n6tI;sf^rHR}+cm+T6@E&UiM&MjdIgiAj()iHa)TbUXt){`^snur
zy#~$wI%!7eU8{i-HGbM8l2(WtS`~DOrV~Ik%QR!5P_;;VY7wF}A{#wzQ>_+tf=FC<
zx2tVpCYMHoFrx`s$5^ztE6h!98-q;D)u_<8SEynIAll^?4IRxXA`v*W%~))gY32~I
zh#u8yz1ASU0*LMMHq9gA|7`-~wlO=2`HA*bs@)*IZ&lnTA&;jt(V7*Ik(jLxSyKm3
z(Bo}Trb^t3nZ3;tq*^UEh-ghP6pay$%QisNXs!}nsu;T(O^iwf<fO;#W|ipBuDdjj
z)RP9yt11zhWC#(CSglUvqtT(KMC5Jig^Lj+2<;jRH+tM|62WO&xNQ<l#CpURRbu!W
zqzd5%Qn|!A^t46Oh(@AbL*Hqf={rEQi1s7|T$;)4Iw3)XrozPDZ5lHoZhae)r_JJF
zyIgIxS~M5jMuo}}_ky+PF>xPJkr-uroBq-qCs{z`B>B_C-g%{6p$SEVb82q6)~eHt
zuhGnDwTKHFEF!8TV+mOjo7C$T4H|}zo|5FMl87Oeqq$Fgfsi371IDh=)FmK9IcD%$
zy<Ei@lTd4s1SHYq5?|0$;w+*iwbgDxHr4?G(xcU+2~%qmU1^}ULC#vUT*L4;s)TT@
zMgjulthLHe`)TlMSTGtO3_m4e)AXb%x=mlUsU|=W;fMs(!ENd`HA)Ojg^3SqpbW$x
z$#oLN1ftFh3(54xHUxBySOi$mV-hh9NOzLPnAr{DfVxW~Lh=ielyJmkfWWL0U>e~j
z$&41st~O0ffT+>>MkFJ#hMC@m;H1LDa9~5~0EWXwH|c4;+;r=Zq$Gr?-8QiRKs3rV
za3TG~z;2T)0Tv`->un{l>sW3vQ|T#5yls-*+q6!#TP>kQy+twr7iYJKQY5Wuv4!Ao
z)5_;!&2501G&5ad`#P~!qq0q+mpVssui0*6jx;Kes6;O!60sq%bd&gkp0<gSbs{>k
zM2$26NYn<2LxgEG8el9E<J$s)NCe?Xx&q0*#y0c@DopFwHe@8mxC!YDhNGvn$kb@&
z5;<t1R2nRP8(5dHbki8Rki9etRJcJSLWp8cwE@0a0|??FT7H_q0Ar0Q1Q5hTP)vxw
zsVjs=o3Ws!g%&^}E%6Jjro>Mbeo6wm0ii{#0S0J8YBjb=J`o;G(r}2CYE|aWCMgmm
z*oczE7$g_aDm{hNa!HDj+@e)uds_rw6Vt3pOQlOZOG*jJV(JJz1t~}Z(Qp#pv_jEP
zH)|wOX~6+ngjlUXtpWteCtB-k5M5+3gI0uc6Wl^787)mTF=?JvkX*Rg#L7)Lkho%&
zCAkO?SbOOS=+vThj>ZXvX+pJ$<w-EmG^2USN?nuWIx!BGS^`24s7nArYbx<1DSO1j
zG@_)mP)Axs3#^c&VbHSBWI0Svi58^LP;1aP+E{#mMXQQ+i-wt$4U+HMG`Q3edP?)0
z8I+_ljUC}nPif|m+{ZFYJV)yk%{PFcsng)*>unNJG<U$tE#eF61I^!Rvks|Dnh-rD
zz96VHmc*ST#EHuxep@7!X^s=sFg1zSw=t-#HqYNG2^+{RDu6YPo^HeYP$7BPggQY=
z20(0=+gKP#384uFUTDx{Z<F|?c~9d;{6@m4#%o;L#pprClF%R-Ln{|1dz%zL;ssg)
z>cnuw3@*5{P0B%qmS_^DG%Ja0HRxFFI%$3_k~1_Rh`FjXW(=Z1gG$pAJV$h(CfhU{
z=qV{ERcNk6A3%nR(x&yE)WKE-(xFX#r%?n5$crX4Sgc4S04kVfZ7f9<rWi333GG&$
zDAe9A*P&q2n6_FF;Vl+9+m$jn4Fn=2+K}$lk!|9DIy7zKiEU_c%$?iB07S4>13D<_
z<}_7VTO-*?lNO5r!6)XRrGN^PWB`onHbgs(BB4o7>mWTXtE9<QfJ=27+_~K-6HdfE
zK$#{gsflQ>NrD!O0L@;S$0XjN$8VFCQw2dGQ_<&b)^fH<N>&@_3rRCtn8^kr?%c*Y
zQfZQr(WpaHrj^U(&`)9_nv+d%3w5T|W@3=0OVXOgnVKgiq;^Ssp*Tqa5}UNNljy|E
zBxaSz&_qcxLHN*$Pbw)xA?9!M#G#?21&t;rLm{CE>XVqH^%j#8YB@0*^<5?qK>&YM
zY7B*XPvU`8TN2W=N<-H~aq2$JZ7@01PcpkI3>=FD)JYlxsMi%)8i|8Qn3Fm|$U^b0
zq8=1s8g?2kU_u%oEes9TOkIpS_=WXzVlv`=)~0FXThKR&0z`VOj?gzr?S-5pW}rrC
zS*nS0N@_379-3h-sLdp?NabKCq*^qoO=2~&m7sz_N1|Cp(v$=W^^fKe2C4}~8#*qn
zb|fok{<<(_U8XK+xx~P2%m=LZmFBkeh~yrb3N%M5u(H5ij3TW8#1d4HNJaWxg~Sdk
z_hb=6;UHR)TqHm&!ih6U6RfeKMxzXct_563O$Ao8C=h}*Fk+qQLK-Pq4&aD3)I`V{
zHYi}LkywC@NTwo52}~+d_{&5+(i~yF(mF_DTnr78`lMPB3NDmF(l;91DD+Q~d^8|5
z>mVc`>8MB<>lEn`WNwkLA#IAOOG+h-q8bs5R6xS8&UC54Y}&?x3B!}rrxuKHQkH3q
z8qj)aC~5qN#>{o}oCG^5GVCm9V61_94N{&K1?mlyC$h=qF->w8qN)X@2}(hm$B2|j
zn5Co`VXni#k>aF%vxK4MXnK%<t%F>oMUu`=RuWbv`lnr$c|;mx3np5#j-`RvrNvfG
z4VDY3tlP*aT7gNs&4$@_8T`|NXd>N?mf>xeZ7`_SHP&L<urNr`1r$;b$>`Z;&5R}i
z@gL7d(hrGatF*8a|I(ZziORT;DoFg&Zjr=kK<%i@Y$RQfRBTLXW-nT}ppOs}lLZUa
zl~x>@bR=(B6(E3R)+e#H!=R|~%0pAITqg-h<RS<SSXj{fT~_=^Gi$<vrOAzXz)(n(
zHz4{TDv8I4Z-7e!ij51Q2t@-%9V8%eGVv&ESeknc*dp69Mx^GEKG=YEOLQQ0pw3n{
zX>?#@66D~<ZOB&)9cgqhX-F!OBqFVVK(fRnoer)LlDsgIu#9Z8iA#$&Ngd+F3hYtR
zSn3R=MXL=7FS6mPka?t~@;o914sHZmPf5WbxkG~qR&PLhLpZaRMB+%~E@^Niwp|Pn
zi4(8}FQ~+5B-H2$+!(Nw+aje%TO+|l#tFP5H2G*E^JD5LjWJ1FYPAh1BJzdwHDW6Q
zPn-x16nu^14Ll|cVI<N>lN!v1coR@a3c=4&$5OJ*@`aQ$YIGa^FX{k$qcEhTozald
z)P%iVg?Ysjqlu0ZoA5#eW4g(HB%0^+9E<^_l2lKU`E2J?N9$P6n(Wyi#S2z5u`N-T
z1Xc^=BW=}f33XfWS-4^sk`h{l&V%CAQL^bt?|^9l3zbK@1<jPe6P_@SXw_?Tk6LW&
z(ZX7<Kwy&M<8tv9*a&N53kz)%N)H}mIfgMs><j5gDj<&$>0S_&P57|da4FO(fI`X_
zEUIm|rLerhw8dlMU0R$-1E6V9X~Fd49zp$rp#Y1FBovs8q0l6S$c4#GmORmdaUlha
zggSKfCQSS~tSg2>vy|3(l4<n@$w#6XFFb9yzrb^}M1%TGk-Jc~D#GARDDE^dcm|NV
z#k8)m6O8EI#6=`zFOaHBx@8rB;96uS90{#5Y-*C{r0$W_gm;l0EH0L>7TgEy*&(q3
zD5P?c?1GnxL{A+{15Z*?u3B(>lF>wp6s%lvSwX#m2}Gc45I=B9qB!I(l%)z*1(z)|
zJSMpdZw`T}LW6`k$xvEYkZGY{wHYQ2`%g*3qGb!_PL-`RQfwGFJ2Oa_lcrLK1g|&Q
zO+va96d)Ha4x&$;gg^^EBhsayauA<Xn9;YPztGesLknvH<_c+$G=MFJLdr9oOE8H^
ztHxw)pm?L~LiO4vncgI}Ao&2NPX+c9Em2iiL!_CL(kM`9DTR>&+7Oqu;blPac9~=c
zNkl@9)_f@PaOFT}s>A3f9kU_whrKpXny~B=y({oqH`*=scM+4)Qc67|{Gfw~XNz<u
z>I}^dSUIF<(c&e3Fk(_H+%DEvn1d~hQ5C*I3}lVw3$d;X-p1nwX@OW9sW<_qnZP<X
zNj~DEIt(dVOyCiKuaAn;l1Xbiv6~CW3=CohPD|!CC{8vZQHA7aZJVKxB?L)C`VXcY
zO%mwcR0|A13`DrojNOJq1dmBKXwahRvJ0pJb&_!*EeLqSA4RjBP;R#v3aNoDwy?M1
zlxeu^<*LFnSHsRR^^;@~9NdfxX+bmsBr8CYD#pJC)S(5z2}oKJkzpI)F-D{X)!0I+
zLN-*er@>rDS`f)dP?A>wxT*n#v><pVXq=kt*dn10mp*Ab(9fuwFs)c;t+AuAT4tq)
zthffWlop%Tw207P)WPBKJ(4VGv7eB%9T;)+ms)h8Wbg`0#wcbf@e#Gm*6B8k(kj#)
zlCZ?u(7K8K@R`tK%sN`+Fo__&NXZqaCrvvNMbsdXidIQDl;QOxy^h8WM8)1ii<$?D
zq}GtiMVc*H8gPo&+u}MUy#{Viq9iOvA`GiuWX+K337wNT8v8qy2G0OeYp5lfD^zy7
zElUSOX_QHjkyL`BR)=nim4q-Z!|bZDj>T?{2BX-*t`o_0k}D)tp;1*B3Q0^jNZ?2y
zKA_3i<VHz>Bgulz9U>Wck=Y2oE0T<DcqCnMi!gObuW8d)q?LnV=r(2Aky-<)z}%*p
zPLr#F&66tWFT`7<nUiE7K?r%wT-N|MwlGhKv4~BGF}XMi5-<a;4`iB<ZqRV~F|F!w
zakXisBaEt;P7H;(5o;H`RU`{ZXBE`9S%D*lfx840=BZBlO9R?93<NmOs#Tc*q`$y}
zO#P?zs{t=7OH9&VT5zqvt3zus_Fy0xNPoe`3hBWOIHQ`FOALjqED{e?ce_nesl_so
ziZ{!!x1eId3qTAA%Z8K~ICW^EW9tVtNQ><N>KXA%3yuuz>_G2eCM89M5G2GgfG7Yr
znNx+H(r#cA(ZvoMNwhZ0x)%1=D!l#^(qyx>u#-gdxQum#YzA7?V0o~cnpSIQ>MrIj
z*<=_xUZ+W4B8!h$iaO+C$;7@Gio=&rYZ@sN*t>+`fF6;aLhswWozsBVoa!=^b{S4w
z8VsmuG=8$HM+ym6k_r|_=q1>>gFC-ch6faDQVrWLkYa$+hCANH{vintcz9eMBPb-;
zQLMuFAZ3Kq3EmVSSx*B%y{0!ba@go(D0PzFRrZ&_R;TG*#gLLhg2FVxo5Z#)SRY_%
zcz<Xig<GgmXSY7vN2C&zVen!Tmn@4awzjx9^@yzL1}oq+L`^uC9g+pKHq!j3HMs#@
z2lJBmB3#x~;Xa4vNl<xLg)|SiI*2Y1Ca}X<V36hk!<Zx&)K?fy6@dcJ9?9+|w3{l7
zP(~e&9n$q^dBDaRt-cLtK~-oT@C?Es+J*ytTci{;4-ziGlU8JG2Qgi?(Ibd|Qg?_m
z>hR29zl3@O^Mp*)7FIyTyR<66Y`}6)by^svZQfqNW-ZC82Cbu{Gth4g9j#;VjM5*>
zMUr=9DsD3rj1kOFY`irwhF~w6{$=!@;LucRRGAWZ+=ROeQwf`2H0x<l847V-9lkb_
z#4XkkTiB<mfa{<W!Z5(rBFt~6=3?iYJ%Oa0k?IBC6re!GV4o-4V1y^lRiI8PMg!I#
z#6OfrNK-tnL5`3WO#+`(6ryOwWhj_Ou!URLh=3ChIzx^9FD^SWYuItCu(Pj5ssz+O
zqE`j3z#2BP7z#-SVjv<FG#==J@YWK-<tjGypfbZzO(g(@R0*;dh=E%0Ps4}X;9Vbf
zwA7({!O(;l<2~{!ncp;W#NycgZSuAf9+SQcZzHr~phxzQK!L2|{dCdZNs3ibya|7K
z8%rq~#Ks3hAz6nZ15dzz*bu$0#<~RjmSpi_ndV)5Dh@Nd0*7A<E+se@(NR(*8qlvR
zWcy*Og*wdCC0&B1ce~Aw%qnzjxB_U>mZ{Aa`h(3F7@S}ucuwHFB=N{@D`GC@7t$Gs
zw`y4GY3jk{3-y@T8QT+3yhv2jGSc9MmoO`1lOGgo!Sf1NJ40z>LlYhrTJLB`smth5
zjcgL}-nK|2BWR(99%28CtUsEE#I?|jNPFb{LFju>Q5x*Z!zvEcd9REn5sL;a_YJ7Q
zBv#>5h2aRjgE+O$&h{Gi#bDQ9Hp0zC(792vvarMg6XH|25ixYw0wY0!-D~V@5NiwX
zlFmR{0LfTv9k}qF@J=J?3?vh==Rys%5On}WjaF+yk=kTuCJY%E>jb5Nt$zH1bDTsH
zy+V)J=Rt-XEIyLUJn!%rb|ZC>x9B0I={rMdKr(DYLu>P3V{M?~?68ELNz)wqvFkD}
zB-3c!Z$W9Q!{gI#3KS9nkZ|z9VSk7ub&Zd(W(HRw@@LWcLv_kYN5!TF4240nDi+EJ
z{!)QP2)NR3eP<I<LXDk;@m5BxRY^rmWkf3>Vt<urD-FgBw(=#|%3mC8H9^{g={d(*
zx#cn$G~0HpRmIJYwNjN6QC3?<nAH}%N?2qdUErd?rn<9*odOzXT3yMsC0n2hfwV=c
zD$Vn4wvlM<XjE8y(PQ}Q+wfK*bOb9K7e+J&u|*Y*KZv$EKP6Ly77y%1ZDSw4qCmiy
zhM$RM1$GCq-HWH#@OLrSY1-oAC4LG;v;m6;{(85`u7@oIjJfOwZ(u(P!7f}F+u`)4
zT48mm0v@NQ(3{9I-o^}s>)90$E>;AR<1~@6^MaTGdJ6IF!Z}3tKPgug=^lK`(C@bq
z#fA8Z632{fV-JZ0XblQITIK*VOz$RyFSZi4S$5#5i_IJOV_|aD*yl!%NzP%P7LhJ+
zgw~}nHYTfxEfQ-4vl34$h-8D|NW(;;q9Gt!P}ZPOkvxDtT;;+fj}Y^M*cEs#TY?*?
z%?{``_FfTnz#v%vr7l!l-g!}l(Pxs|#2(vlpF_*UQx_yAGGaM_qeDQz2STD7ViX>9
z6>NviO<Gt;<Hwf0rV!~gSX$vGff!^-M~{i%?AmI<&T8m*Jramy&673a(ppK#N%u(U
zfgc|cMp(hyikz^QnurV}o1d7xDTNWM!~PyH6T%|oX@jGVwz2a}1Z0ow7CUOGIDA4i
zI6E5(1Z)BlsBL&lNNtl5f&PFk-8u|wIB*0+74=E^A-#q;eY>R!Lxk6{y;<k|6v2Wt
z9XQ)sJj_HsMGKdda@bHbTWQ5|YeIW?JmG9cd><{JRrRzA2RwFv;c~38nTW?w_Q_Ht
zLPKF|NnxS@%~EWiY?JxC-4cdF=tTn|2GniRNi|<o5Cw)sgzUu@*}~1tpvYuNj?1*c
zHl@Ce!L|fd+Q{<si1&;%U@mGCp~gX#F?!XdeVe#$g@Za%#vyIUxPD@Mom5sx;~LaY
zvY3<LM(}8YaoHV{;PP!oH8vq?+^N{ysSE!0L}L$id`@ET)=8VbsGpqcPO4Z)lOU*{
z6gN()WJ(ias2`JfHRhj~aIACvm>g}Xpju1l)~nprn0#(B|JkBk=$9t<ozx{FZ8bst
z<kI7$u2N|W8tNxkKPRzJ!V!^JQ`^#hYysxolGs{Zt8k~RWu1M~s2|e-K<b3Lz<$Q0
zW|68GDm5j)N*LE`mMepkgfduh7b}BW@tPD%Nj-}6Kc(cYq6I22d6mF*$JPV;XMVLX
zd6caQ(jq}s5}(1zqkobpWPap8V--0ff9UU*VtIXm3W;_*gA-967X#W^2qUhBy6{+S
z^S(zNK>!tR3w~%YI0DIFG{PxV_qO0YK`;uUCuo{t*R4sVIU=kLQwTfDRrZQEsW?0t
z#F20$f&U=YD|pPPHxNCJC=l$p)@t5X1yZ3=1`x9O;5`>8G6e`Xvay?OOlz72^q6OM
z1KXS~Hc~m<j~?r}C31`wttQD{dd{;80S&Y~(c(mQY;Bt!BSwlAEe@W;?mvkwmmjaM
z)e$h`!Zs%pmc%1)ta6M#?}pL47GhLd^q8lf3m*V>#&N2_ZFvvi%2Ed)2#@VHZ}-EY
z*Wy)?#5OGei25R#NYc6?D=5O^;W~B^k4ExQ_7JcLvtJ6{WnKlEE(>fITk-T1D`O48
zg|4ilEo?$Tu+mZjaZ(eZ4+6m1gb1h>f*|3vq7?=q?6mY^-x4bXN0yV|XSWG0KlFhs
zw%Smln?x2iifB2hRCrU18HVb%>JqSyh*Ma`EYq5ZMrvT+waz=b;&Dgudb`T;twew9
zUcd`guJRTsqUsUqN``(L(U4`LP`g1)1j7b9`fcnv0SpJ7B4&o<ZG$6f%Lw2Hr4T?(
ziw~bxp!KA|%6%29Rtd)v>Iis5pf~J%Y#OwPiMJ6pg%G+XN5PZ1O;Q@m6D@xT7iL~>
z(U2m}4J#9eZfql10zMkV{x@WgAKFYE;W}7INr#ZwClV0EtMI3^5t_|0IJA~wn~&D9
z3c|oSilvP3xmKI?v6jnfxC^gn3oe@)Q<Hb^n`LYwa`XZzA*{w!Wru#7gT{zgF+tbY
zS{1|&6TWT4uke0gy8?$-3y!@uf`}R%F-R&%6%0WORhtd6cDqdd#HJb6wi@@B)*tNJ
za7+@mt2h`Bu^ih7&w*-zn%nT6!v#bd5n@^z979*fZ9eTfLL+N1FcByRmk#tEsJ#+9
zRH<XXhqwVgAP$k@a5ZeaVJDatO5V~#@L9`kBlNMxLm*_X!&A(gx}@^fpp0{nRtv)e
z$1ygTB!-A6fcP(>G(wj_DN+V#(jw-mg)k~80o&M5LvLvgV?H1lutBmAd&SsGt5kVw
zcpGsYSeA)SG;^U7Y`5xVc%Kk9h<!^uYS&07M1V?z_xHHwHe@0;>Ts}wP4{gk6=;Rc
zS9NNIC;(lv&8JOB%rT{01PCGKqP~p)ED171JO&)cBxVUgKHO5HXOML?=V~|uAY{fw
zXh9kyY^B9yZephayCXE5+oIZl_E7V;Nn2_l(kM%bz#<b<B1+CX^W>l>*^iQW8zRL*
zt#->*iUHCH7|WxNv;k}JQ*K-;bS%*?=pGHu@xVB|6XoU|;XowDmj{oWmP#y|qP)B_
zl$XWYi>M1F!n0(e6I}q4SeCtIUab^`1`y&34G~?bHS|qxSMfOaliZxLSj!PYv6{1z
zmg59x-HC^4jdHmbKatp2tl|i97=l)FSbyflrNPPs{^5gem253Xz{J&@RvBB0+f{@_
z!Q8B|vOp^XbPeeGSe<E27Nvlc?lwYvFd?=PUCxU?pQXbFZWFQFHJmXKr2q#oV7I~I
zK(u3B9>Z^3!yzdcpA8a7tSdl4f#D2wz6P7z4Rr{(xp@sounB8FE+6%C5tM>(TNsNq
z1*KkQLD9tFD$Gm;rGXPL68wcIuevnqaGW#A4D9W3s7#0pc5Wc>TR5)dZnNSdx)n@V
zTH<RY9V_y<#(Nv}b`6$mg?ekKIfzTd?kgEEB>d`ZkE83fl;T{|Hfpf8K}#!S94*eg
z&%mKMv{+&jfdn!Z`nqfbRS-D?Z$6HhH4%oz4-p66h8+akl>->qp2q1h#J0h!L56xY
z{X8cdsk{?{hz2}jdz#1qBM$Z~8K2v2Rz{#P!fqmsmee|&<P)tEi3nN<F0Ep3T|zn`
z<Z<``vEq$3Jo(J4RjkdtgwaU15R(t}q`@(_IH`mnAy*Nwflz7i7n!c0A}eyFIJa;L
zt<B1iP!(sHu;`N_Q-uX64hgV#9dXRG+8{Pr90Ca1AcMAnD82?qyD$Mrt!!`e78T4~
zAwZ?k#;yvYgRpTUiZ?CDe7c4f$R?|iundUB+c0nuy+F!nO?a9&NNGjKfw7jv3zwm6
zkOG5<;TklJ7PEN;iX1{#+K45W9d(@LXduY1jW0M`%<M*sX&qsi2o<by02(QCurg}!
z9$+7}-f9W~U7QU@6ipSXr*swbu8wU{(zYwgNrO#zXs9^XfrFOf&S>E@a|`aUR@Id$
zPyv@Tu!joAO;v0NoIxP&!hta!4|E+nF?FP=prNm{ILN!)WLVn>eQGu(iVsqP9ioU8
zZ_3Fe7!C;L!r5R%FSVFLd<vr~8+H};O;izGNANh<5u3fdWr>)}I-*dZb0NkU{N-ZT
ziD>9TkFD@|q%uYYM=Eg82Js0(F&Zxy^9$#&`E(GJewR0Gt2kwY&?)i2;It1!5d0%`
z8E-zXf<R+AV91<NN0b|xEqvmOPdB-85Vcva@`2SxL%bJoPvNv6rWUEG+scCC6T0jf
zX^KOm&Idq<#bEQ)SRF+G3pG*W)6*O!$_qjpAyg!Q5SYxi6wWCUqjT^r!pm5PM&J&~
z5h5&gq=^VaPz(wcg3+psKNRp5rjrXDjc8tni%BR3LX)Ni)@#d2Xi%q(=;&>P@iiro
zm(Ph1gThHeh*sN5>LWl9(I42<mKB1g6%C;aegFfq%?v+h1&2eLh>d9qo5-X`KRBwJ
z*TW_#0lz4juW&ly8KxUd>skxZc5JcL5SR$-9>+}E;+B%=7@Qa+yNcs2nRT%LigVRa
z9h)^-W)O)D|5puh=}m1<(K>*5evEAe`fwZ0FC21rApxQ6XK9GWI)80N(S)^BS>$4(
zFPgeWy3VKzhiaoVatk`6Qoc%puV_G8@3YYpuUJgsi7Sx0Y7RXzb$fILMKXJ^``w{u
zCP~rMrM~T~=coPp0?MsxeOjup@@P;nPC6P6BmpQbs#Zy<7bk8CX_>G`=(2G+$!zL>
z^f}p>_hIgTq?e-^@`iaAl7-B{ZS?+R==V7%fBa_j+zF_X*;7hsZ?TnbzEEz_*drJg
zu}20i(%<k<-(~dw_xW7y{=belLWP_;!Is?rM|yN4mjA0xOXOYtuiN-6&HrWItgPPQ
zk{=S_$-At+=W9z!qwbXWBlzAeAv;y_@~7{sm5mhbVc?y3v|0^Ty8<jyFpyU>yaKE<
zk1hezMT$m_Nw>mT7LkcD7@vEeBqwCgpG~{d%MuB0+=+_3j^h*Rc{gxAdCsS<lIo*i
zK9$6doJ(?c<~gH9w^*SO(2fdFg^^u>;Rwabj<f&W5ZCpbVjY<|!|~`;-4F)^Kn5TX
zO#G2EpP&=EiHSF5K>f)aC8!l7oHTHm%%`XR=u~C7^ckrx`&Yavu8#dE9qLXd)A5CW
z&g+!UL792u79p_djHpdBQFiLRXR3p8PwWP+`x)?EXPtS;y68;r={@WEL&?1<RfIwt
zIxDPP{Ki5kx@ssI{9fV)xcs-VnHTlmmnKRK)4Y*4LQf%)9CgMuL{Z<p^tI3+DZT)Y
zMS5KN99?Y^D#{b6Su_sg2?L*5BXb^&4Blmq4DP8*$800iZ}00Cgp<w_oD?V0smEAl
z0nS7w3lZo3qSjLyr{Y<hVqKXBn@d1%822|~o+ZmhMBsl_!%ha$oI7_TER;<Rt=%Rr
zXvj$#i+=?_P$}HC$5kH@ae{@!SzXHCNvx|%tQ=Q2+I*Jt{>GZVRT8yf99I5NmilV_
zbStrr*8V;FsmJr`cd)NnT3<;&$XJi=jLxs}$z}h|f)#Ikw?E77f3Lc6`wsylclO_H
ze3sgOY9p4WwlnC?x}E;e>yG9VG6IPnwAAuVQ|6ljif-ZwO8}%vPF6%Z--@;PUO+x^
zH8|n;p4j7~ryUk9Pj`=ZJ2*}eF1EYV(>Y(DGePwM(4%!%T5wM0qdw>0H&qy1DjO<3
z8y~yFxu@?Zdhj5%XWCTU1wpW&59WNiUDyoi7_(1fhvk&qbvK?4VB?L+V1$Xt<{`t-
zbp0*}Zzf=brXDVD@Vi6*v)tBsMg|z!m)i1@+gqtnze{yyrX?ZwhdPCb)ctPYWz+6^
z>N}TJ$)4A2u==`Iebp)hbInTCoRzBIhpDgO{*}w8@oY54MZDeqnKvkCwTSO|jbI8(
z$bHywunW~L3a-B6)x7cvchBP5r%80Lle!%nRqWfb*9PkGL_vz*mga1(&(73sz3M{l
z?o_TqX5NRlpS~11<29O}73n<zQpobX1lgAun_SMtc<lq*kzJs!z+J@l%Ae1?!khzh
zLh-j+WMiBZviSO1L`k`Vb_o$@Ar);Rst$&j2ZDLY8RYF@cvIUh?ttKa5Rg(vhqwpg
zV)@h!P*SiMs2kSuw3sqx8izxVAkHwOF~5f_-ZTd6X&I5Od~$;A6I`Pk3}Q5(IzuQb
z5gqQEazyM9(s&9JBXv8py41wz01Mqoo7HT8hYYE&h&Ostx#%`dYF@3ny~Mx=<Y3;5
z1BTy<??p_L&P-pF5?iKlpT3uz5TEGI`b?fJDgf`sqz`g!bRAEXSpCJb1l#PB-}fLx
z;T+?kP$;p-$`5(NyYTvRSXUxgsZ20)Y7Xvf4y9(u7^hy!+Ea3BngyO@tQb7}s-=P6
zyzx{cajiE)h;)qJ4Pp{ysi0u)#o)w6;Wa1l!%gQU^_aJ+W>fzZIrJku;qo&HXu$`X
zY|=)vOYepmL_?Rj6sD_OevOJ+H_&V&-Ai2Hw;47vK`R}y;JYWD)fjP_Zop`^M}`G6
z4C%9F)9#ro;SgTX&a(kuJMf5hXXELm37TISW=>d0-^(7&=;bY#9I&Vnvz#&>V~d|m
zvtK*MPj;XDwAVR!b+C60KDY|q)ga^AqU1n3e5X&0lj8KcZ9Y&)Rmpr+%_@}gh+?ZN
zahbV5GTLJv%Dhxbxb#-{y^&~<L~2q5X91bcq#X`qjzV)9nd*_DQ!6EYLi+0Lq@eW%
ztr?KLJ)VkIWZLK8%6ZTMpV)VKEWR2(wq%`UP@GM)t&@--!2$$#cX!v|?oM!b_W%Kc
zySqCCcL>hl?rwt*uEWgbJGV~Nt-Al#&#rpAy5HS<uk|>knA8=fP(y~Pu5<jM;eIZc
zP+0FrpLrp<%RtBY?z}c=g=Tx>fAMAgZy@~-XpBWVKs$i|;&jNzTi#mUgWmW<^nw~g
zM7u5uV-gfabXSwidgZ8G71R0alDEIYLc-JvESfAAw5j%W?B@YJ^1h0x{0u+N6j*Ta
zM6M1tiW<C3Hn8%x6q@fWJT(OIi-nSNsme{<=ox6IO+FO%l=j3=QT<~+ar9I84X?bZ
zi6vOa0Z#w7<Jgopt3i|`TJqh$jML`y3*;aEwI(K3Lt==Ac-9no33^<zVszaXao*wJ
zP>*9y?kIj1m9Y0eu0ctQMz3w3!h|JmPtveH;X_WP2fh+|upWKeXIxZ3Ejz!P@ad5M
zBJ!a|$8<OA=Jz}xi|E9fPh9v37NN0!binSBu&Q>l5P2%jYPYewJAm7G+BaaUdVCnU
zIih46tg!J|;akCHLB>wc@_sPVwA$0D)VhM_ZQ1?~wxPT0?tPr+RJ@EX&!AfTc5qR;
zxoe*smqERZgZrpUzR#zJwR}?|Fs4y(EHa(FMX3M_Od3fGubgW$S~yo}+7A!+BQCex
z=^E7LKEk!q<DiISbQ?D7zS!9L+=Q1Q-;JPG)Ob>os2c`MAf|gJc=>QxfUfJIBaTzn
ztvtu$<9?a*NSzk?sv>1A@+{?6U-knX3t5xVASj|Of9d{9TvL*HG(s9xI`KD$*n80L
zxg6z=7Ui)_5w<rrYGp&6(lB!k@6rt;O3PcAH}0W8_%Ns^mUg5nH)#_rBp;(}NDIr%
z1F6>`&nApo`8nu8vH|rGkg*)dyl(w&>3g_)0qv%i0f>|-p@Tph$jP5pu#+<b0tGR)
zv)shK7su7E1U%ut^nCO-Jf=UD9{JPJwKeSw_K?@f%f9QZv?EVoI5B}YV5{XlX2$oS
z?(aWrc|-mJ*(L8(_>jU|W#RAV6Y~tV&c6}jgSrST>%Y3c<f6`-J`O={L(+WVMslcq
zUw<FomIIWlD^bQo<033Vij&>sREku2Hs^67&j^ASVE6o4D#JVR0YW(VL@Lklt%U#`
z;v)mL+3BL?%2m`=!Wik~vH{}S<=wwo7G>FR!z_C}ujMgmkWp$^eK~j2K$9hZ5b1}f
zEnxc}C~_9pr)ZUQL(k+g?(GxQYegl;mU&smKcH<-sj0R{lvnSrvK3J5&ZN+_rO*1w
zU|!<rvC8$M(}@o`u!#F!iRnVwv1q~bW5t3~fSCRlidLR{g2eDtzqWi*q+oC6E1`*q
zQFLQM4~7;4%Bo)UN5R~^8HUS{g?BiWZ{JefO|BId0#kDqf&dBbn+l6C@Aa!tF`S%+
z?hBV0aMBxt1sMUMjC*9b6k8Er!mj|$nK|%3?rIV?A#g;w<u8sNi5|yRD$7`XLIS|K
zO$%T4BWHy_b4Z`t$A;^29@^qlSaRKkZ!S`eru&QV>%Z6s-`J6)Ob3wPN3DG*y+5!>
zO3jzZ_5@_Q3oh&#Qm1NWuv5=pw~JRb?&L&&mItxZj^K~v4QuAXbj~9l$gGW)$|a}p
z%i}1yx~-&VaxWi#7c^%hRI)1l5#`2`CqF!&af=`ZV|gJROsi~gz7sv-^2v<y%V8P!
z^rIn22>VbR`g3z1RbB9A;=DKiQY2~&3ky@+Te`x8f$0zA3O1ppATZoQ@`;3lbpd0(
z<J+!%x3o5P231yxt=?0*pc>AeznCa=cz7*0t%JUT)3m!0Z$Z#dos}$DXOU#`W=yQy
z%>9Q5GKmF-?$WkN(u|jl&hH4|ZhQsza!au*F}z~Oq1=h%YVm|uiT!OS;|kP2Pye+y
zuluBpAlslhhVptFliL}B?QMGb5a_snd%=zB3pqA+k`x0DK2NT;J;eo%eJq%Y5GDv%
z{U^Hpe?6RkWtuKUc!O(;#GwDfQm`soFOoV1gF2s&yI;OeJrk)qo4yV9VlV~vDAhg-
z^L9>M$C+Ofw-xXZK~<_a-=PZjewu%v@VMf6KR+1dkG@kt6CQTsxi~@7qhMUG91+L_
zk6XVVc>3P4qFO2JzOSmxHz%!g`Z13u1+m!TBDbmQo|ERHnJ$k?=>8QxQ~)3Iv-T|R
z3wbuXNQOnuSl1(y=fo2djiP=_pb+h!AWDs#Ne4hZ@m>E;fNHI}K1m_CQ%@LO8z@ya
zViY;0`E(BVW+#=W&!W`uPyTn#lN(cpp#Upn$L!Ot&^0fn2WgJCL4>Wv<m}0NE?)XC
z5tPJ#6`zwFIEd`8u@d80+yjqt;HIbpJ;Kb`?|xkc?du`QZ6eG+o%9Qu3LRrc*^pb)
ztK5Wp$s8J^y(Q7!Q>JVX64mKT#F<!H=L0gyPhAcZ`!FcaKcf6bsQzVGF*mM4ImmYa
zFIF~U<1pHo)EM8&@{T_M=l~b+F^i)py{jSdIpigB6A_dnmwwJ8k+9fvPTwq|8J_f9
z#LjXKF3%Yfvi%j(h<vCUZ=L_)`i7ZZ*}(?HWeO{d=MLo~6$xP>yu8YHPM9!XYH;Uv
z3*>U2;rGUI6&q#FFE87DjyF5ATfn_R^=PEDE~J+3IwFtoH(%%{7c)}V3RS({a*5lK
zjzaOMg3wFsjL3)%gsE*fyVW=*FHT<fDl%zTDyw|sj@MweW5BSCTFUU2m;C17!gZY%
z6oz3Du!}tH&A&vHA4e?g!U)_NEC30}>g%cCZMOzcY~{p`uxHJb?XRxjdiZYrHJ#ZY
z>(J0sl%~~16pI3wE>g)>@ofvJvM%lY0DP1l`(6_gw6>pQfLKSR1}b`%1#sh6L$Dl*
z#-~A_;1+ZGRuCn(C)?18_x4-&0@<ueejb~eol%+hDn+jgL$2eTHjX=a9ng}Ft(npH
zO+AlMzv<;tahzLX{Qfs>H_O^TE|POIPA>jW=#w<64g+I<h1MS#@4g?+4i=(b{kI#a
zRxe+I%sLZPjX(D<f2XPhk*Uo+7R;qn8ko>{M%2<6Y<U%Y<qiJq6{h7i$w4#huQ717
zlVFN!<42*63MDAKI6BgY=LX~5{CUaYyjZa11hJLld^MaTNr)}<CNcM^Ux`tu`%R;$
zSUjef`KzaLVe(i-{&N*OnWySXVn1%vJedx0tBkBU5>_WgvDR>KHTJAJtSm*hz?l~?
zX_Zo3B|AhIhXxYyEBzI(_@v{gRbQ){TIU91DfAczr&mERZz#pvmA=x>>r^}=Nw<!_
zLtmSIpP{JwhZ@KatYTb8B?Hh+Ad|)Ufm}hANl}N#mQ-k6(U;CxVQ6tG^(5yM4I6_u
zl#~1*PyW;TEPs*C{_N&iS8=!0+LHt4c1XTJ2Px!ew1TUUI?gk1UzF0%rK$CCp+akU
zIXLMSS9!o_p6SwEDG)<srMVGD!!tZ%gT~DKl#v(2TZbJ~(z9d6YezQR@@sf@yX~aU
z3a>O=QF&)vX$o0cl<31C={Y%QgJB|rgcVNmVKdTf8}shiw@s!!thRfA=!Aa@8yp<y
z2Kh*C8?*_JfaNG#SG$ppm%>QbMtOo^!ievUqWP&BAUhx#C_VpaQm#^#)$UlXtr!20
zDj@k&x^Io*YeZfUd%*S2vjFNZ8Z<}VMH_~c&BrXku0>t_0+c*7+V=Bok)V<@P{kSO
zSZTp_xBby^+$U9H_%+tx!&a))#4u=^j%+2w=HAM=YJ)hhO2$!k%6~Kd=j3<@Xv1{_
z56ii=va0mbV5Fon*=#Hwolv)ca&fsBX5@5(b80>QYtif9d`7vOx*0rItJnhnX=l1K
z(v2_s^aJ@KH^G?=4K+YfWn>^JqN*>CI6#zqPF>viPaNeyPSHU6AV@)$>A1e(ZQ(Sv
zPuP1sI&)+1L(z|mvE$HB!^!q&UuN8aQdEOWn$kgEa2(s|cfh%`6EbD$epTD}YVXkV
zW3K|)4nG#tC`VNdmftH{xUj5oLCxj__%%AP4e7&`A9O_)mHlk^`jr6P$0+6sU-dBP
zYH8UbPU9svnNj9jJqGR+Mza>-vwRibNF@|9u-5#*x)VvB1ZO@3w@7IPegXEE(;}_)
zUprVYJLuMy6PAs<)05QM7W*Xjs#e%K{!Pdk$e50U*@_&$;8f{VqNB7*YDN(2z$+V{
z9KJuAIu|CZzacISESlsrT^Kav(ITEQd7a4S`MpBtuVu>CLDSQ9-@i05K*~-#>fZui
zHin=ZW0s;|R7pWkFzQ#=d?i{FtTS%5iK_hkUD|=m&jtj$FFh{U_;(}zE|Y<u-8Nmo
zMz;=-?J=P3Ak=v#5ACZLHuMqr9~@|N?48$8rEYUC0VbyX@Saf3B_y{G-SfpVK=5F1
z*xHj&Zf!8}8T%_XD=oELGs+s%Z<ccVO<JMs@33U3HJcl~r$^u3`;}N%%g|Q&O<Mq(
z)$G%aX#};M>;!{aZ`w7%AipD2wb0)t=_pF}GU@0J3O-5BP`i<~*TJ^u*&dRRBX<^1
zp1b6xE3*fqq}#{wt-h-65Ek*4TD|C!#8g#djvCKhIG(`64^15=RG44R@%H*9J2zuw
zGayo^A**i3F<(zTRl<=jy5F7tI=a7*x5z8pJh?*TV2n}nN+A>C!9JI8H|7p8QUh}A
zF`jf`@>4hgd}b#?z3S2@A(me18!n<9Zy|Y}MhujMX^HsaQc3OE+U`?tKLL{>TH@z@
z3S^S<54;^(QjdPP{j3zuz_=l&Dl+ce={Z2E#ARO|Z2J&*7_0U~&g#<!C}UoK`}5Ib
zfa~^Udare%lQw-IyTiv@-`&HW7kL*t<o+Y{;GkU6c66AjM0k~plpo?Ks&`DLX4(`N
z4&jms2ayTXU1)Tv6nv5t^j|b()iw@44Pecjkf|zMw`ET-lQm1o{~1$9^TtS?SGzzh
zSa+9b{ndl}>~GJ}_~lt+R{uw4S$?m!%X>ns?9<k-Ur@E3Eb$rlrw60lUoF}As1^Ld
z$D^+cGJm@Nd^46w(H-y>xRZi8+X_02{O$kIXt+sUiJA-`A~Nw=tR=!Gp0-P1H@+he
zX3^;!sbNs_bbaU*J9;IO1BD+ArCe}&VC2W;6l3ha5GCHuBu*3$v)<Xh=$_3v<(gu*
zci?mB-+x1QwJ#<)pB~W)wUKAT?@#9rl{Z6HZ>5^N;!3xyoiJ>R6zCXlZCIIZd^08P
zUfeuVb(4GwT}&-#{qjmpRdJ|B(<0{6wyb`cX+6=&A*YPdLn+Y8aqGq@cM$_!z`;4Y
zuhSYGGl}f<d?EF>N`oK3Jw3y!iODI15juTEZqL%@k^CLfbnlztFvihcj;c(}-Pl!q
zc|^2nL1%2pqDZjkr>3YnuW~Q)I)@n9fl7G<F3H@{r<YbMGUa#TqpXM~E&6Tg9M1Lk
z9B0Slz`K##{DWg(wfV28U0Yx`XEZxc2BtpRB}(3nLX%;}lb5zs{k&X_k68s#qBkBV
zGoYM@*XOTOQh8P?2KuQ<%S=pc?@y`zj?NiTt|>0km~%lywC1jpf3GD<Qb!g&BY_mI
zPU%0X{V%(H{PojQocbD%7V*>ld5DNyPKurgoFMZRJlpgbF4UE*_rcFjrL|WGpvJAI
zRA;%IN;awc-!<PkQ=Jh=;^jycDGg|RgH%WV9+lPqEqk7vR*C)s`}g2#m_#+$`4Y&3
zIy6=x)0qF4H&0g6=Y+sMo^In_ivAz*=f3{Amx<4`-3{`!AAI)|UX$84T#{iP2UFS*
z&p!9BEx-iw?H6lqj!!+C-1YMTZ>RHIm(VsSkhzG<bb~&u;4|@l>qHbWW%jlvWh^}a
z1qT;Ys~TZ_&$)hSNdFmWI4~b83k>ayqFg9(-Ft_7tLS8k9b%TJ#qFD0_w{=7phu0E
z$rj$5h~~imJv|L>2%426KcHs5gMj@oce<GS&^b|`=KH{YiFGtJoZbZ}-IuR_%}!ON
zF;lBUiew%a$Wu*phhmEp@nWkiJlQw{mWs%mw{OCnFXY3!Rqxv4t@$gsK=_LJDM;D_
z59M_h_E)N|7{ij_ay(CfKqXbv`;({N;Q%d(9VQq0ANzTgwEYh&nBBY`wPfXdFrD(^
z%R+?o)KoeHN+XIar9yeT+1$Y2vsdHh^>MunJ^1Pp(^dlLl1WiJTdzs6fvQii+<ejq
z_Wt4R$%opjaMt2qVAP}e5uK;SDA}<{N|FHdzF$tmyF`Q!egXWwPTftrX`Go3wkVmB
zEE<*hCh3w+O}zY_eiY;r`;B&Fs~EIAZ@KnY<zsFzQW!NQE=R^OIq|6aW06;7WmP*6
zH4LM;sRgzfrc0>Z6H?c4W;`JXM3k+l%=qt*tK~dXNajzh)1}=OxFc!O5!bY1ibE#B
zJKS$a_M_xUP2t4n;hGjX%GYI6`+2Ahh=Rs)zx>IFpQ?I{5)d^ad8o?xr(1>TOe#Wb
zBVg()z13!LO2dX}<RZUwefH6D$mICJHoDWx$p}X&b+hu+<R{R<P3<J4n<{ZKwe_W<
zDBxQI1fqs_2{8}E$yJ`1?fj9W4A8VE-tWj6;6B&N7SoJO(0F-BBTBLy@OGlIWYn~1
z`q7s6!6CI#%Uygom+#wiM<Gc%p-+Ex=$G+t0ne`-A1%UI4s@)?GlTPuI7X&Z6WF8?
zhs<<Q$)2e`uw|7L5}SAhw0+7Yu8jhQQ+l1UK4&=cu%wldh+hGTX~c=sj|X=Hk9UTa
z1U|AyNQ@bx>mR+O@o6Z~DGHjJ=fO!#+a_GYj6R7bsoX9tSd8GC)SqCMSN!vnE;w@2
zuxW?{Y+4KeMtnAJr#guJx3E$h!<{zgO$t@i!-t*o)zL=yR4Ng$*!I%8&iX6aWd=Fr
zxKSto%&o+l(DTIC3fYu^r12TzA~c2tvDJDiCf@bSVOS#J%fEVr>mf%<^}3{Bg}5=V
zxyhAJd2Z}APHk2S%lXYwyeEeK#NL8xvpUDf@x7_SBAtBmWayf!a29p0@W{g!Pp11n
z1Ga8U)6Z`HSoE&hMlv0eKlH6Sm5vSnL;W@&u)+coZ5@ud_x@O_+E(mJ%`VC-<Cpct
z44=0>&hC3V+jOOw7V80hpigoy&sO|rw}(L^-02h#CN(RIDGGs8q&L^VVJ(f!y2woO
zCn7lv`~&L0zt)zum`?MAJl_+xbYKe3N~6PLv)S=o%e^JWPCol;4yV+P2~J#+o;1tT
z?SFVAt0@1wH-MR_W%bQf_Eg6<W2q&oAr)TsZ^&ID_Ix>^NYP>&lG+92y}g)*->6TE
zzY<6&RjTV9{kxao-DjFg)jn}O4r=RiRPQWw#xI2+InVc8Z4PvYY!*#10qJypo!u*U
z>vmxR#aKuyUznX0UPLUuf&8BPCO~j}8;bTCj{-@q;(4oE;qB0RehEL;ia{q%4`1oP
z&(M8=Ul`o|);p%{_=b@U&3Nu#`D{|3od$UMgf@h|dZ6c^P>PeNsj$hi`r~q8PK{f5
zCSO$b{*q*xNXNLn*jz<0sbzB$ap{@6C`~7p3<WwO*Wb@WYV~a$TbANvZmn#EJq>70
z8g7WIJh`m8KZkr;UXO;Z#r#6NdqH1BVS7@dmLmKdFhQ8o6E3`=O7PEK{D9eCM?oGY
zjsZ@U6o;-K6{?6kxG{^wUjMK=rxvD8mdV6Wr6@I)+u@gC)!deQ@)?@v@6FxFFLK<w
z3#b=Tt&SXO7GlwRr2nSW+(Y{=P_U1RtM$6eITVS^U{F2yzB284(nEB5=g-*k(>%G$
z*z^c~w^1qhL$9(XltF%7IR{o&_2|B)e^Sgv=1<EaQg|?!G3aH46e3g9g(eGc6rxfH
z)Z8<)BkoyywRh>is3BLoo&5B1NyXJ~E+PA^*9$R@5}vAP8YG#2>+GS$!egI3t`3N$
z!?son7EWDNZ4H-U`a;mSgKBE+@V1>^;tsvke&N#L`xY~O_c+h~Tj_z{w8xkd%zGnL
za@($BOk20TaJ>|7A6!LzfS}eAUvF`T-d-ps>~~2TW%ng2fEL&^(ISgLHa9?@v-I^q
z%)RqI2CyIuQe@^<&9B(VB_NV)&L_O<4&pwob35fO(u(SsOfR{fYCc@C88D&iX(#-p
zRl=1=J67zjZ{}{Xuj4uD8Sj+5Md%5s-)OgKh32%ePxFyUsq&T0UsJDUu_?Lsf8Pyn
z*st!X{Fs{Ot%<xPrGhNu&@1}lW0t1V_Ji?<^~ZKct&Xr3(-9(Sr+R}OEVSfH7gIS?
z6J>P7!$JphhGgDHmg?Beg^FvOnH^Wly*Sv#9am$}@_zSw&iCzrR_}iZ!!_^jz^kS<
ziAoB<03ni2GVJdC<*i_ISx3i~hp@@RV2~>=X!JE{<T^>@yl+|JyfV`tj~(aJjs;HN
z2Y6YA?^d`26Mg+O=Q}ap)5O%t$Eau$AWgI7F^cX!cZZTE_xAldHh5TtmibbH+*uxq
zcHUf<!Jf>Lj108Ygr!srEN}autfWCXt$#byExg!Zz~fQk(;H>Wkps>}{6Am0(N|C#
zbJ}nr)MDKwg6YUD4=%7pp?ycGhdON##9UA5IbdZZnhkzEA1SFn?p^iJFN|s*Lg@7D
zEYgV|eJb*se@{&#AOsOP9iia_s940ZJi`Nt`uN$)q#`9UPKt?jWCGQVxO!5;qGMpe
z^5bNQ?7K>2n141g=;z~_deBNg%1pzcm&FQILX8y%2P+`Z0P(o(u0auo>R&}yCRJuw
zoQY1OGWQ`PuW(Y{k*JjRFqH%sP*kJ$Vpmt{(Ujzd1tr#)*__CR9u8)c13J3;@<re6
zqDh5&TmmbF!)O%EM|qVvCpzSv3_Y#};t)v5(;-GcwAB#VQMX|I2DUSP`}=0xN)3Dp
z)x=7_GKVG4_;$;Zv^Rf<bT8KK>X29QJu)M@#G9^Q4IC7mlAk)M&+LJk2XZ%j=di!S
z)RQSO_E=mP>HIu++=aX5Z>2{>)^KGIi-|pzEVkTEES@!5%Lg>cA0d%&%vjA?0(3Qe
zo(7I%mEC4!hW>FR_Zx|1n=ss5nza77Lvb838gLnzz@ULef?UZU*~Xuo>BDGx_0g#4
zLKhfmh6irFNdFVlKN-bGi3t(0))?`&TsHrgW%;?EHkCj;Z|>kkM>*UVl9G@>_7;C_
z*CB=%<7PZ6F?952M*03qC`41e2sA`boY^R8MT#f^T$=STM^KX{V|K5m>KTsr;}=qO
zQDSCL3G2?%Q^AR7AUj-EQCD61T;&-SOEXeUR`QQ7Z4@ibkbxY3J+YrvOVVdoS>Z@s
zU+$~(?RDq`gU|adhnb=Qc~!kp0GIwsCbNKjOJ0`TItjfRC~mW6QQw+N<{lll5^Pa*
z%BYL}Edv-?!q{i1e-=38FjzZNm)Z-yx@|%yI7|OZkfLhzx#AbPFKUFCvv7cH5aknI
zi^mxMc($x}-c0=b&h1T-X2wwSbAMt8bctK~umc(acX6uqkFf_@VOZ7r4sGhde7uB|
z={@V8LCP|=13?PyIK-=G{2Z@f*E&}rDt8-!n^(U_PcW|E7Joh7ErP=iS7a5OswQ^q
z1f{ovs`*ABaX6=|ddM(+Y*2)9yywxld*b%nV~#|o24N6-O)!#;F+q%C8bige8i9WZ
zPfIyM031BUhcLAhBw&IpCj*mFGr_Gw*7;1d`PW?Y6Y=2`->;G@Im}!t=%#S}l;4AS
z4CaH%(ahm@rS12a2O7fe`d}9A@tej@Nm5?-0p=gK{}}H6in7!qe^B7E$V^#+Gi{y%
zyeN;Z`73Tq%GPH){R;Hff5k+iB)9*ku~((Z6O#v@Jw~WbuzlFAyP|HR+%Y^%aWlq>
z^4yYX>hpqWvU;09UmtZ(O|3PoscR>zAEa;7gV!d>ju|7>sBVr-M*-9a6Gf+F2t0Zt
z=CmHeD(P>GS{dvQ4s?{V8L6Smc)gObi@BX3yCc>{G=Ri(e|X`-H)!0#p+L2GL?6m<
z{c`&Qj~6<wi{t}&?3;TEsODZO%8<{{8dXPx^N<*o&_&URmv4fkx9(kQg5dRfGCr1D
zAdApw{QgYWt`Rv*0lI~=l~fdS4k)&fJ4Hw3x~ahza4Fl;98ckBFiZZChQs(>uV91o
zSJ|!12EUEiHVy92w4ao656k^yzk9xFwklErgZ>U8d&sq|94EIKxVoR7O`dyceXhXA
zXwG0axEINk%iAx|^I7C&!qi$7(q&2G42yzI9Dz=A#YZn(AX9LsvBrZh>0khujy5Ei
zVJ#nb?ZkR#^}O-Cw}9bkM`kO6n0kix9(e1Ks<N_X7q~~OtP4++c3EnU2MW7*0QB#a
zBO>YbNY0vNC8m10{mB*Ux%?K`rWC9`xDNP|(>)ZAh(iY<_$<<f#Pt&eRI3d`;qXez
zpQFVIqqCuJk7ndMaeA_z^~u@BX=W~zr~2TomHyQf^r8Nb6tGcW!5YDE=#Pp7-t3k_
z&K>GMIm+15p5|g2a!K2gH)~yd#2?kd04^#O{4@t)2vD~%ZZv5=-fY*!&H?qb-)Z_*
zq`A6b*|`f#6lE!5YG^Zb*)k)3xIzQUB<zG1nRRl_gw36*ZodG^`Gwa>sPNOlqQJo{
zQM2_Z?^6Qqs<QliJlG-2(fyGj%uP;2<r)RxirTWWNs-M=4odds@@vo-WEoR3wbT2V
z2J;WgsqYju#T1c0w<%6>-&E;-K~HrM;myiND)Qh}nh&B#B!)ZRyP|ry`xvRee)8b5
zByujuj*vVXZl-ooI+_@1CnFKah>e(@iZWjapsA)VEK>g7vS%Gh|ML6a4os8<K^<D;
zVz7L9%4ZvJ7tQDXL|FG3iJC~$ZrR^7K_>d%WDLQy65H8*ewFO3g(?ow9lmV$T^fAj
zht#b>6+f}QW<pYie=NE*GfeVwya}6Fy&TQ_b~~C<8V(Aa<sC7^lxf%a^Yd#HPV#G#
zsvRjpMKV+Tp7sWX`<^A{oXqzTl2CQ<FnOOJrbj)!<u__##G$J;f8C*P(xfRJ^P(7l
zHUwMFN^73NgIbA_Z=rfQ*2Y!3Ux~t6Ee&dbNxc@Wd4>h+l4<m<v2Lo{D@Zly;=AA6
zVJb~jEoq#`oL~z%VDM53wjV7EmUfVn#r}rH=$yqe)+owW5ugyqdq;3D6@6uxQuc4%
zu7^vj+mJQuS*k2h5ul9lO2*c!{)otT3DcLQoYFpX>&v+OR9mBCVX_CC$}+*R&y^)0
zxv$GqtE0yNv;Ww@Fz5N}!~NlG_w=nv@_^9$0Gh~m!yNV95>85B$AavJy6gHv=26ko
z&|<l}v07!rFYVT){U|>{BK?|?uz}q;&?$+LR)~a=qZ|oCnI+38@2W#gIa+gc6&=}&
zO@F{_8VYVzT7%r%?iHy~P;!$OcC9Ir4DL#i6Pnu3`%hTUSrmh5gx>-VuvFq=+$VfY
zm`#_etS}ozuS2K%EcYRnO%@QY!lMDpaX)PpnKO_6a=_@T$zJ_hP#z{T##j%>Y`!~W
zK#DfJAt^J6_cJ0V%w+`UPgz#4HfxvM%)NGtZ4*}IKR(?%wVnF?B+CZ|0-m?>1|diS
zp6sQyqAU}tKkDTHx%uKuYfL78lV4}iu_JK_ur0SKTM29AeMkY!`D<Pr-yQS!^LQZV
z{Q6cUUzFW~2<!Jy<B+a@8gaQ1?p6&`qIZ!=sSP^1g(s~tq49ScgvfUs(sSYq$2)!r
z%*b75cjUP)t>~oKt(BJ9^IwGg#F^!#uYrkRdHJ`2MJ0nF#Qo?^{}ro-8wi2#<k-yT
zuXmu^66V?B2YWvbCG2Z%+;h@@&B&Ksv329^PH+kHvXCa>k;z!-uaEEduK-9EVG7VY
zM%Ldf_WQ#eP1KI6G(5V?(Wx(aZ4)9@FAsYcd65Hh2iI=kAX0%lCCSlNW|^gdw_Opp
zK}VlZ<oW;WHP7D;de_!mh>pq(N)B9m1%m_~c_8W@*>4zS^jmiAs)>DmHx$@Q3t8`e
z>zS^z+nB}`6kJ=UuivjHq7A3RVZuTN(fznlIjK<m?2M2{%1{LJR69Q-G(S5?)$kNM
zl(i2V>eBVLQ$|gG(+n?iTbqlKKe00Q?RYeM1m%S6zflMBpLT8WpLcn`xjlNtEpbtJ
z?>=K@bk1I!;A+=oXr)Uj^@^Bed7=M~{)uHfZZ>%uqXCHIWTpR6zcCSN{EfTbI69;)
z^seGB7SRzRFT_u*=2+)Dn<rXB^WH`;==;}tA|W;m&I<3i;Cdm!21@bS=jGnwJ#N;M
z`1%k!(hG~H1b4Zk?DPXStbvQ57zx_20~pRL)&xvOxcAPQ<$3h$+q3$ikP7vOBJXxD
z-?Y?5`U_AP+s%D~TFt_`q)Y3^sUJIJJ!Ustgp6qKwWFD=EHv4E?&AT*N71-R<lBB5
z{-Ytn+uY}6DM<miv)3?@c}3&0v%8}r2ri0mlsVgFchR-TW#%P8Yjs{9pRs0~86hI>
zYA(K7P(|gzcdK*7(#?6-Kc#UJHQt`b*}lO26H03awHyfZCmACtq@&i`zIA11iqIlC
z+qsj~=#sol&dt7&%kpUgvH7744{9L^D$eHw5C_(yQCsNw#CvRX1vfH>X()a$!a9|p
zG{v?gSe5)J693wk4Nn@I(Tvru1}@fCagk+V1>N<eLtGIzqxR=PN=nArr)#q@#*?rW
zpd!8)(L=NQhUAx@RBqoWV;a9FTn)zfPr%AvyE)i!KCCjw3qJ^;2x}@5T~h3p{8FX%
zxASsVe)+J%R>+4+#H;bjXXU={(PTn}QerG&3b(Md)PHQ_yNIN8pS06@noQ;-LqAD`
z*kjlUysj<Zh#Vo$F6G1@Yfw#QRizC7QBs3aS5`w$Lx@^48a7EikMk6An~m&*DF{8s
zAbzkL9YApLazdb%ChaEb5z<X35q%NFi|d!H?PbD>HSF<m2hY!5Z=Fqjga`)H&@t&Z
z($QCI)c-t-%sj6jaS(uC|5Fip6yBE-*aBZw=US6MsB9MMm5IXgLoPLmR@DIDim>+5
zk*Jje`&RX5t7JUAIZQ*oJ?oScW4CL=^}(F>Q^rj|L3;0zf&>CrQ)OwX446(%DnQb+
z5!b(>K7>P7_bU7$22-*q8oNcm6gD`p`VQ*0_;Xp`A}aE-$u*ZU7DJ-SSWLj><J9|X
zbW$93|0?!}y-%<t<X?H8kdton9MlroAy?wf2mfKKa$l~06jB9PV0=2+P3Z^Ed^m|-
zsR$kwe<44q6EhtpjvHjotjNb5SB!@*<nDS!n~IDX>g{d8LhOtU&B;__SpHTlzx5<i
z&4F$maJ=H>r&CCIxMPmgr*&viOtbE?PxUm$dKP#O_;#d>7@#-U_H*LQMSvTf`y=PR
zp5{-#NFOsqJ++xxR|=<&kf1oJ%>o%!ckXuYQ8;X%UlUg7Aj!pGY*Mj$1gezZL3E2I
zzDv<iiMZcp0*g!CPzrpM8C2LeaLZ6CrTDFXy7!@MlnqYy)9Qi1PT`A7Q2EXL@R8SX
zCDYFF++Tag8TB=EoQ}7E2krngde<M9qKTpQR%@qB3>P`=E{Av~Lrx=v*s)7qZA=8T
zkHdxdch;%_qgV@{xGl;*&x^N!>|AUkHclJenQ*#n_YYajesxFAbZ~shkds)|e!2d&
zYGgdj`1&wHNnF_lCS(;eh=iV)0Z$K<pg=N6Sv75=TP&28@x~LZ<ah|gz7_^_%*X|^
z@0$VdoNO(Pn!;*;7~l!pb-glS!U2oUdpEv<<h6%X{icNM--w_5DdgjQ%x`u9Q`bvV
zw>9&lXcb~@P#mQ{E%gDn(>L2SNk!z=4vZ~jWIk;#sChn-(vL%BORH~yc{PPEnV{ol
zNDn0T{$9itfNir17S)S?YitT?$8V>7xG9R;J2UXbU1fVU0^-tH<Go7!K3u)DcJXTB
zUd>z;E*mpB6!r)@fy;Ar@b?DRc?!$TVH;#&uPbFm@CM}n!y13e$b?e!>uq#eAlDWp
z1cC@9ww0vIqTO_)&AUAwcX+;Guham-*YN>QAvvT5Dip228BY1Whe=^uW-fipL+$7B
zhunLIK|h<;bNxLmL29>}4RGU~(6ehpQLnOlCG=eB&9YVMvt9+^=4ZD*etrS4+7lf4
zNfBMCA2S0bh<TdYMgbB>{vMx^?9*5pH{1Lh*aZbwg`R17`Bt;EGh?gGcwHS7A4jXv
zllU`o6;UiA8x*OaWR>J^8JlykLR`Vjh9(M=4q$?^v-PtZHb_X${k>EAwtm}<(yi9k
z!+|y*Df9kmqWQm0r14+E+D13+<w3Sw&-f3{PjFb;-9F;j3QuyWUtC!nou&ElxVc@$
z9hWu#&e}I0iy>|kDhBAk{@U(xMSZ-@45(oYMKpUL9`6O5^9K2C;J(xt@t;!kixzVW
z=j2W(?oZ|x>F_nY^t@dlI&=mo817<Kjc@pXOQKXEu~qIGw~c@Yz@@A2KgpYqwzmob
zM^}u3z^A!so#0p8<JG2$B*5h=pxP)C5Dq>&Rsm-;Ue(iZmQ9av*tgWpwOt7<g!~fT
zu%za|7UDqb1C7F?B%yuDbD(sWM@D8OV2#2Lb;lx}+y0qX-L?OcIA93~T@vK}G*<rD
zP={k_DvVKLV0N!KO0t<}2PN4q=b7WbAZxr<moPjn(8mqmMGa_s2`yASz0JhGG}0<w
zZN`7Jrgw0<*oyi1w=gG)+`HLw7<P%g>tX}gbB@vZm=`O18JZMX%H*ysga3FCnzXu#
zGA@Yn6lrYs7I0_HwuU!Qg73QC2m1759O<cNW+JmQ82GflyjiGn@K5X=*8JKaG;F&q
zO%0rC&i&3|XPHDXuXg)<aakQoek_imWIAhdnc00Ye^Gz%^o?4?4Z*K%ic--ceH8!q
z@ZxgF-qztD5*r5vPTNruOUrKX6S`|zn!xg=dD`7B)Am0flL2Z+_m*=CCx5=KziQ#V
zZCc@VTQ&QLo$lbMPIo_mLybSrkMX!D)r&auyP^P%*wh2BT?LJsa5dXD>aK{P_@kv(
z#2UqA1Eo@I4^zbN6tDLh9T=D1f}5%fb(im-s&5uG$@S4@(CFCN+^k{zVZRyk>%iSl
zOW(j(Cr>u~CZ$Jh&zqhw!F(D=&ueK5AA+4hqtdWQPLtjTNM~Rk&nwycM)4Em-*3p-
zgbwAn7tUf~YMyj)8~f?&X#uB$c+vnHy92~q)+~lFLVKl#Q!DY_e2e|*Q)bPf(~nq{
zE(~_&DxUTVTN9~^A;!`dF8UXpQkLOmz!u)MG%Z_SK)sdR8#ZzDQpT;4)O=@%_v4;h
zfbXQ^6G`A}OLvpD`*3*Lb^kGA&-dEP<wsT0dr`rIu0Cea?LFFi;H>rd>urR0f;QvQ
zdiTNIF??iU-UQN2$?A4f!0nN$7!4X1^?JCk6kO3~1h*V18N(qZhzqdJFCHaNU~K~|
zK<kR8sD!Gh;WFO4h0xsic5Z8XyuMDq0k_8PnGnwC-<sej+zT9W$%7j!|Jc{JT>z?=
zYz>o+50AY1Bs9h#Ie+QeJ_y;^#Jb>oqbQEp5;U8+#;&+KbN$gg396n1S*h_e^`hcH
zY`g9}C2o2K_LS9tYf}I-y#lJ2c)M#-<7=ZgW8)r&u~5xoe+Zxe>xsH<%}KbLt>6Y#
zDm(gFvd!GzYi68u8_KVcUA(E3#!>CKsiiX8oG(K(W!2qsEO**zH(GVzdvfD>qjX+V
zQwZucxIDSSPB;DC`U+W}dA>G__HluzDNLQ&hYS=4#+%FPcV0;}z22!#g*+Fj1WXAN
zIwFVf&vEsWp4{|fO#^m^F@cBu7e(xio;ChZl_TAbi3D%Os(}jc!zKUQqaWICqEp>o
zS2#ONMD65SW&zATlt$vdTYBE@M|-jh``!RP0;ZWFhvzQ?OkU-{Q7>$yU^Z{zivB&%
zxtm}EHa-PlUQfZz>FdmR8kLVv!eNQIAAAjU;F9HLmv=_^#>4?DP>2jV2tX4YRcuvK
zya?l!8#?F+D8i=9gJn-p5@Sn$WzzL8P<shgs2Qp};^dtU->}7h2rK2?LITZ>WS+}(
zr}nnh6!w2xPEx#S8IRkL8~naPoN7ssn-+nhd~E?|Wfq<*tQ@6V*m=aw<6<uCA{TDG
zk||hD*5$WAqB9IJXFAPaMqr+osl(D2$I6lCV0N7(z5w@H`OTM`7JROjLMkP?9WXl9
zc_XGV)d~r}D=3S(wiMNPBkbcfd<LpM#qB2*mFa03UoD+K(+ltWfu%B!tU1G>qvLmk
zko_8P*JF5`XK6U`bndu=Po`hahSxO|oK_&vntq?gEz$N46Wx^VQE<>RH2xGcmLSa!
zW25@~6s6?obWNQpR~%JR7f^01Igck)Z<haNxpuiEPfs6^xYY)6d+GJKeS-~PYK9``
zda`9GDAs-Y%pV8^>ZD@dz6vX4dA>sJ!Cl<`m6lbX>RX8%gx37J?iUB(jO_ed+~3IT
zR(z8Nx=-eBNlglvfPH-r^;<4Pnez5CtVi<11Z!RaZg+1J*!Tp&*!jk&n9-fu^5%~}
z9Z8=8eg6?dqkW#g%1h2=s#P`*Zo#G18oW)$JX&sVtVla-c3>tYaH0FOts(L}CN?$a
zUrzKwl@SdjUhQg;Cd+vhDm(mKNxdCwWwfY80}Z&oz=XW%BWFDW+WtC;@p2odRcGcK
zw8=U*y8;<B<yk)6k3XDs>B2|Zo_59R${9U&`$2(?j%oMq<R|kMY0PZGp-t5o?OfdE
z4(@~Am&;+*P3iOAiZb5~oa?s0Vr$1&@P9GpLDYb|aGjsRo6;Urib<;vY9&FWjf`k8
zlCkZZ7fFI8_?Pqe6ZEW?X4?}db|B^bFE@^;HUx=0)dM#67r8w@2~m5aG8>ilCN8eO
z5TgYCET4P0>dO?|3mM{a8xFopqB`g18k$yfaY29M9y~d}d~eO<C#x4+|8>2nz_0K1
z5AB7=SP;7=b>-hEm1!TFI}}y2{<C@Q*6BdYHOAzsWzDuD@sa1Dk1y=@xKnx3Z*jhf
z{pGKeC$#<9>co9_dUd)OQ{M2P<siV2My#n4sa)6%2h0n<I@f_v_wP@uKR`Bb|5LQ>
zv@fyvjUxbVI!Vc{?a%}I<2dB*2_u2HPMvM{#vMlke-ODXIb!_fwSY>X9scdzlE4y)
zyxDnsRhP9Kxe-&7<AM(`-l<7{VePp<2f%-Bx382L(voK(S5l847gpF1t+K8aH2=fT
z`f*ox+PrOmIWL+i9{<9eb6;H#LeurlDAcjPE1-?Y2Kl$1(0Lh){Hp*-v*&HtZg;tA
z|DU=p%R<)l?G|t&+}SuO0jCmU)+D82M|@iMkbvXfMgpsbR-C(?fA&8GUFb7l{klbi
z!mo+kGMm5+)O{tjQGSso_u>H4TMW7sz<cyhZ!$Wgw6lLK`%$ijPQ^}fF_~wE2(mu|
zbU)It+MQ1GC6J0wOFfr)nsEJu#~0X!7$<_y>|AazG>d98J{+`(XcJ5-zG4bf<DdW`
zL}^QSjyJsD=OR`1vh$0gbgH?~`%-y%_;b2eg1G>aq+R!LQSEi}17%W1Bl63SNduev
zjjOG#D2hf5W@;S~GAMD0Z{!Njxn1cGi~d+x$79}!;-&%$q#0MiyqUf>c}!s0A{UP*
z-QkkDl7D+0#{wt*%UgbJc8n84g~in&%gQbn?x}-dg+&SjHW;9Ks~(pUOmk>JR|C}^
zeTq}hu}VGUW@F%}kES+daV#rI%CKoAtScaZuvTcLQG)iyCL7R#iZXzb-szX!(J61X
z_9iM(E1QB$j;wWZ?-cW5fJ|85sxGHyGM^M-H=R+@`V!Q6_V5MYP8_pAD3GqDvCHl*
z<xCQ87sJEeNbto)17y@ggv(Mb#Lef}qg>BTyAe{iqv_<?`*mo}duUDS%<S;tY#?se
z#(;>NVW?p!G7_@7?_1g}y!N868}PIv%q<Lh?t3wYY~X>k+)XI`M~-2Ijn9CtCeglj
zrAF{Jwckh_gdOaO>1>Oj@X3R9WTs54!@0Hg9Oa%&{K-YtU5G>lgU&z!<NEs`^;>qr
zKNLug=_fe=HEHGneOjq+cSB<qZeNooP(?BJZR{mCKagEaS->1Z`!{Ncpoq`MhUQ(&
zc+vDIkG89v<5YVoD3rq0L9fQez%Iz`!ah#w<%Ed$ZrD0jNUNm>6~;zkr|`vtgf>v|
zsVWw5I{ebiO`T<SEl$(vYf~aNje^<|7m{QLdvexz@s3Ic*o7^k{HTRLyf`VKBBM_m
zZ#fSR*;g~aUD?`9p|^JI+-7|{fI4HPn<Wt!ROBh-R<w1xZ+c5=l)*z-ia1v1E*YLi
z!Q0)aR=$oPGxgpjo)wMx6+u3pbXnm?&C16(;;m;p*E2^{BJk_l`>|RC7w`hPhOOqH
zenDgmtkk@pIW7b3<0H%qalD?qTApnajLmj8-`|}(dD_~N<9hOYtTd;9*W<sqakVG-
zC2q_xx|_OhD(gh;dkFsx6z7NVx87T<v!qNX?vo=&QIb{vGam2Crt-P)bGg|tb%3l=
zS$WY48@)9`1ISVfxYAfYr^l>SC;SW5OUxZyyirh63ixUi-Bq)TUeA#7L|Glh^SeW>
zG|E0~9Y)8P<NJ|j@|!JzJ<!l(eP68utEctxXgy}ParP&Lcnz5#;)~qIF0o^iJInT(
z*~y5ea6sTI@LBR4(HvnV>($1it9NFq@Avq#d^<K%QPpvj!R7*PO!er5sk`avM7UNA
zIB{9R=3G^WL~-`-Alwgs4z<%Eg3ZP48Ku#&bvxvHxpGjSH+2Lj81aru&@8;nN6h_g
zXBhNj1kZjdz-(Ih`AEvj(fH3pEstccYq!-qxV5Iy<-!O7bnMeye|4Sxqva(y;iKEE
zIh8MjTbvdu1<^-=ws*h2G5`F~`2o7RpddI6)zAW6<-J$jVi4v=aUz9R7at1)dCPS4
zdE(N>A`FIaf8u98glq|Dpab#}Z^#)ikwXZgxO`natipzT3)Qw>&#=Jh#UAG76EI+4
zb911O&iGQ2@EfhpSzUX^!P(jJcF6aBBU<cKYpps|X^yk=x5kj12#=^>5u1-_N<8At
zSfS1@=iWE_Tx<7z4}izk#DiIq-NUmtz{5EQz?VPrp}28pd1>i7Dx?1H{NQ*b!-`Ot
z2twnrGJKU4;9Ti0eB_u>`Ej^Sl|xIaATCI_!xP9HSKAzw|C=yj)`V1b_UL@!W3wNJ
zz^QY7Hx~oV5n=et^AC~FA(79&(QFwzz8Zzn`pf)^I>NH{hRa_5G;^k}RYPsG_&GuD
z$pOeB+a~jxpL)BUyWg>iJMW0PQrBa|cZHbzB&6)8V_9QQ1}f=}&hpq090JgsT$eRy
zh&iYo=;A!t-iZLGIIXqz+dB;0`Y6L2e22d0cWtf~!2Kzf+c7AL!d^ZX;V)a>G_3z)
zKa`}&Yxr`O_766<)r{$I3zYWf;fikSE$7QJ#42=!fAabM-dOAE_{_iVeB3DP0Rf}o
z^LO(i^ytbOLyJLLL2P7B=I~TpG%c7Pj02Jm{nQ1Vv63-QzlLnola}{hxAZA@z<gK*
zh^3HRv8h`KqT3jb>q2&XM12&q)WS3UQizs~HjmUuS!>(BI^4j4jRt3dIP$gIXG;>|
zw8U)YZEQu!7&Fpue@hyiAz{ymv*zmD@n?|zsew*Uh>N3I^-8!WguSbzK$I&{H0&;2
zmr{Vo=f%yUIEy$i-7m=Z@#pKE*^3EEut^%P1B|bkKow98EaiWP@LZ2>66fl3Hyz`e
z@3kymx=XJKxOCJ*sKyh%eq;AmuNLXJvwkz#6p`W-Zs?-u9qixkio%eHuD@4B<7G=G
zj+L?ye5O%Z3o-TF2uokWmenL-|D^s5f2psLG>f0|+rWVv=N5qWOM6cKd4UOCf$e)$
z^6Yca;wJx_r6qqOpm*xmo)7%o!O(%3C*Igp&}$aaRx-5}{p-3gA;2{@?xCzxTt=>y
zB9;03I`|z)02)_v7#v^fcT{Kpgv~*eO<!B>3a3{F1DJW-Rm&)f=b)$hcXFrPJx%KF
zD`UK;WmL59-R*gYWTM6DuSlh|ADe`Wj#ktx7p{ZPK+Z$Ypi8?Q?&7<y8M1K6g%=t^
z&gxvcg3^1z+wl8BPN_dD0c&Q#F}qhYH8O$4mI5(bKDHIrGf+1fULx+r7moDXDv2-#
z;tdNgf6t-Vgz2OS=5OHKWw+@#vKL`(i`;XdM`_uCqroDKn<&I+F?lr`N=;7rlmi7a
zg7qh$Ldsm5{$Q)K>zrPSZL1HD5Tm7UxYuzTP?aZPS*X+@wET@Y23m9<=yn;$a3A<Y
zWYz<h0TMm(jeq`s<v|ZzJ4p1>H~y9A|C77E%1=b!#ZmX9dWb_oQoFAzPXXWmSH1)!
z_Yjv5N6bCu-wD$AqsnfF{I8_j4jFsQzY#3=L;e5cgJ8Kos?B!D+GGB^3@2(!5ztL7
z(nyF&{lTS+t)q|QP#^O?6@3w7$V1%iO!N*3z4B_4+8104ShRv_IKy=K3v6MWcqKZY
z4GXVV<J(_$Slu5bpw&qg5o$1jJsX-`o0eh5!X5L7termv;Qpfxzp1GYk7b^(YIz7C
zyZ;wxI)oSQ$SnplHNpK9&?e<7e`mw?ebcf&;+|5nnZ{p<x{&4klM3G(TC%E_^_^t9
z^{a>++wVt>7~y`yCOL~?q|Gc)jsW;5?|wYyskZezq;)p$u~Z2ll6HGI&TnKd=-t$Q
z|FnB_gtN5x=n{A{U>3MBeKo6x%NxoS*Pw(&u(_YhNAGj;cU{9sski%w>d<v+#YBh?
zuF-8UqS0G-k*I+1r-3Z-0VbulyEkK`!PA(v+ECNfI;x8UuiSpAI?G%qy3qV-^zFIA
zZ#X3c5c8Vt)8+Fr=95BVjQFp%*W>(9kuwBrmqoVOct1YB@v2Z?&=zzr2n@X3@ASOf
zd;=a0TurR+j=6>|!ilonw@#!*v<KMF43nwMHQ4>y$#_Jak292^!24NOC*r~OEV_;}
zRKPJ6&+xS);jgy^?Kb`!5A=Dukm})Vm)WPTnc}FHYFot~(!QelCfi<L*j=E6UpJ$e
zM_i3oyl86$(HP*uA&Nl4fm{u@br;QP)oN?*Mi~k*=;*Wpg*>QZF=UH?%z3A?g0+uF
z2Lgen3<lTOwKtBnGtAu)i#sns>^CrvkqZWc21;!{=3UQXIqdOJS(t!+RNnn+SJbPq
z23ehfcZR&-<JSR$f&u@NJM;SGc}hSiEZ{40VvO+emYe@5bF#sqld{Vv#h2)QSKkG#
zs9v-1@BiE#0*`$6UJGQxJjQSSgq$7s#}bJxIXbU186_evcelTJSD<vACN%zCzw&#F
z+ptSpwZ*Qx;Q1PLwi-V#rwLWtp5C$`8RwqmY;XI>)cN$PKDs@(MvOID*L0^P2*s}R
zOGyGPLGX=U)6PPthARWWl3NFfo!Ul++^un&F3=Q@n^Pk2UN?B}WOb2Hrg!!NQKh>+
zCn^P+bcD0o|9c``+x(B%rF^aeD(WE&9Ko^qLa6NKDBQ!{$*P~{ha`EpAGe4+GYWmh
z%nosWQY9T1W&gP9VM?Ve8xJZvUnIAGZ?qI!-Jhb2wm{jf;sfPMxf>5KG}r?dQMxx#
zCXV>8N^>DTW(VJ_AL%`hxA)d^tf-E^8FR}sKXxvcrDIDhvUihnElI5bvAYm7WKE;7
zde}yjG%RjTmTK<w$h&*5KKRu5{_s4%b4yPN@Y@2HdNC>mh%0r>u?a(2(`M<JtZmAo
zN-wVROXwjcI{pzFy>)=Hk)6%Mr4WsAL0|KfKi$`B%lFzx3>lfCdtE6*kfV-UE@CKN
zF|;K2?W^x0Ta<bHzwTErccl}e6y-z+LC1L^yrPW=3e*C%D`R}`?{>qMGokMd6(4I8
z1a`}Nb)h%RvMY7qjoFgljLeRjd&<I+TS7wgM6~@rsi@I%`js+V%s)2Xw^B?oI#!T>
z#WPM(QNn!bQDpdIuOHnW2k-v@Y(SI0m>#0$YmtrN(2wz;KYt3GWq`u1(0p&^KGt{f
zk$?UrALZ)<mN7^t1JGSohOk0yCocvFpN=Orl=67FBu06mh`MCkmu>bV?e$0bn`k<J
z<)&@$KT3*zj$d^WJ}O-0r4W1h1rxDSSpR~dTH5BTjM5nY`b59<vH=*gZRS9+6NSm*
zc2=cD8*+R4mG<+|*-5{jwVez1^m*H`m-V+V+WXln?*0Fb+d7QY>u=tj$Zn_I%r4w(
zZ)l&rd<9+04a#NOew8@ai>GJ5ITzvJMf;T;gsYx^Y4_lzA=*QK2WZE};<rYJwDhKB
zS5KCGstaVv=S=@4AmW$8e@pL=-dz5FUdVTI`TtE?zQcdNjh_qg-wO_L7DIm!&VJrH
zP|~sZ=k|*s+qc!~ez#pZpE0p1)AjWBu;aD1>b14CaL;=BqR!Sed9){x1MOiYjr(TT
zBO|wU!58oz6LN=yz@<d#FXr(TcFb$uVgCSan_NVZk@kimlP30$7h1f@B&QWDuq)$<
z@4=0;uhVZgY!u=t^HnsbLn;^9(LbF|DDv^K{112&D$v<6kf!0re?D2mLJm(H9i-u5
z;VUg=`I;U&G&z27EaW@YK{7r})thENFM&pe4o;<G>5DXW>;B}&^Lljn$J2yWd6V27
z->oU#u_2fl8U0YkSG&g4yofV4`}w0xlcz01RBpB2&8@tXg*#R!E5^mQOno?6wgv~4
zdT+D<`vXbeVA-+H2pAQ=ai;sk)<5hX9X_2t+hTxtMBK>I{YNBJaqNF~@6Mw~s_vdg
zlB&;9+Wc2}&iEmW+FJIc=lIY93R_>^y&t|@zcTSr9E6SePp!-E2#Ur(m#_ag-8(zD
zS`OF+=YLi<^XI=P0QtM~|84wS_Wai@ec0Y~EwB`}j*gXKKU}~T9e=l_6qdV_W3hrm
zj{ouYGZN+}CntSLC8PKkc`<>)K)1G*ciHR7>Bemi43ctElZek}Yd2)!{_rvK_Qpo?
zVC(M>AKbt9pCgiq!^zsyy^UnvCe*u^lUqMs&S|ZiAkr3Coub><eeUa0fyi4}W{BPq
zi7=P)U~u&<yK)sVx_ujjTu-oJRg*49(-SHe>pk12mYIAc^B}+3Kr9UWs@YvRQ$3xa
zPw~yp(bSd#8|F_(m$dC08rTTOy%-TUhBurfd_B(ve(58|mcZ}j9J!SIpB+yR-<<uI
zmJ9WN)4ECD$^W<Ub8-IfITbr~U2xI7nB)s{KFKdwe)7+u(yKrE>h68-su^sqm{t{?
zt67?Q$}rm6-rGJ#%B_76+BE0Um3FfB^7pclulRF${m;t(UZMQ=h5J8i=JWsayn0vv
z_pSWAq59vZioC1&{hR-})c*hO?C^Ud!hRF>Un={3!Tu|Xcl-Zs{J7&?Ci&LxjdvUK
zf7Q?B`Jb<H^4rga=YPGx|C8qL;y-WY$DRN0C3g=FWI1e~f-u!;6>z~GOb@3AB;7te
z*?x8~IXu+_{9D(TX#soFlT)o0vHjE5!R(WC<KXP)pZy2##LI8&=koghvp41cE$U|8
z{?F6q9sk!``FZF6eI@_zvt|C@jYK~V|7;!Y$6`D3;fMc{|H=D)ILCSY&QpB8r#Qq1
z7s7+<ztn^LOFYIG^#5PKu>b#h^ZnN~>bmSXmWTDbe(rkH%RJTcaG&uk+lm^0yD@sk
ztF1gaq2ze#7hZUL?BclF=g!Z`Tbv)u`B^$au8GwX6t?~Ufca5>(dy~>!{z5^_S@e-
z^YN$t?|;qxeKPlVKyh5!Q7tdEbutlk`vewR@3wySIs;Ib(*IO{zq$c<q5W5+^Y&j>
zzw`gTl^<vSUBaNtWVYsQI{j?_+1BYUIkdpz-kEv-bAB$h{~vwv<>NOM|IMo+ZRYoX
zTBYyezi;KoDrP-?J|%mfgKlynmVx|na&(X|?@4y6xK(h`+Vj)X<4->R_{SfAymhdB
z`ux^xcY5pj^yFyve0s2b^GxiJTi+dj{Qo<+Dc^ql<zrnoA8V!MThC7q_T}KVG6p|x
zYbmUg3AMK5m<8Bqd8A?|9L)N9Vo#4`8UBb~u|M6N9L^@6$X(o+B%d7}|8z2a_WU$i
z+g(p`Sza6RpC<Y8>~wZ^lswv=o*r!^Uv7VYbb2KJ$cG2~MzY}F`VL!5PY&gEPiE88
zpKc{2CTgp*q$laWH9Ybm8|Cz5x^ss6OPe~IQ4=zm9i54Fqo0T<-9Gt=Y@`D@@2Rwq
z9G&RDM`x$jj?wt<2CmI*QKF9JrLD-YXd6FF_o(>W7XXN3Am-uT)XF)?O`)yHX&e)N
zKAh{Oj%DcI?vYse2juNqsc3C~d*|o}z6!$`TS_RlDZ{=Ym&w}LmquyJ_u_DGu8Xkd
z?{7~JCMUPf>ykX$jZ@zxdH21u-AU|~@5|7^SMQZ?CU!6h@4t7ndp7tqx%p%2*=e5I
z0VU$5qL>cT;+xXB)fU{ljb8iyWUB3O5x$LnSq}@)tvz|Icp;PKA4Pf&brbX{M<+As
z*-y$45NbnD4)^5K2`f!{Dhqv**kGQ{MlY{Bd(U>Z4&UtP>FJNGz_37*ndrSNPPu=|
zx;<f89{NUft<GlQUG1C4f4loAdGz3m$A7=`a5ItLzk2xKKkk0M`FZk}|CBE`lg}P}
z^`8&#{`GH<lfON<_xa|-N6DT0pUbEBA3wbNmnV-OJbYvg-MI5eZoi@5-nsvu$>u-4
zdbs)MQS#tna`(%x?%kCZ|4#Lr`;YH#KH5mI2cCR>_x@iu5@{v5|KPDTbMNk#cOT2O
zj~{I4;}`Eu9(<8}x%u$3zsa9>{&M%;-N*l_5B=iq<NG}Diw6&_sXNJ6cOE{z``HsQ
zL6WbYJpAgxqs@f3{QT}CF-Gowx%v4m>4!W!+5C^q`;U`He-rI#{L<FagTLS3e8`*l
z*G~SjDZQnt50BJ${`~I4&Cee5a`Cs%WH6<p_cpAlM_+Azc31wA@!6DDyYuirH$uaY
zHviuza;1Eke17N4JAaioUAxRE$%K9O<l*L*ynzhOqbGlP^!V=MCyzIizdm^IxlX{N
z&4>SS_p{AMx08Dh9_au+d9)ci^!c5~ceD%A&KH_GCcppX$)meEn0N0#-hBA*$ybl>
zKDfUwE8y=kQqtQya{uQ#>JRSo=KWgQeDLr;X`XS>nb}DG{<lr}{2>Faqj!g4c_gFw
z*<*j1JX8iXyk30o<o@Pg@7?|D=Kaq$x#R&&{r&Ev&2^c`yN|fwu697yhdlU+jsO!V
z{R>m~#dwKt=v*gvzew(U{vUUFi*Sdmjz@RHa?)Y^>~CQn`l^?gthMkLQNaIw>(SkR
zZUTWy(<NWjWwPcj`#8zhhpRq&@Z|pEtxWHo`!G)$`K<TZnhSO)%%>cX&nAakVsh?n
z$w$2*{q?t2TD>UCG;6cGYoBZ+Syh)^*Q8CSe`KQKbw!%XA36Uvja<MtWtEpj*Olp$
z4QZk2>b!2ts*taeGB2{c%u|}nv$ANjwrXjvX!9n|<R1N|Yn!yF)3l(4yl%>_Y3nT2
z#}?99US%cM$wSkks)~j`s-kSWrmA^RR=0H}J<2OuNUD<C@-ElzwVfECMV|3T(WG);
zUhxf`OS4=$Oo!wJ+O$Zsjux_}F59|G%Zj&X^RkjBrS?aiS8dj%^e!*!POi+$PQS@=
zzND+thob6=tgRaz2QhcMs_6=SQXwC<UESzN7I~93ZBg-lS=;fbJhhReNN(D+I{bOj
zv|V1Mg}!ZCiUnQDS2_-P*~oBd?~1gQ(UQ^B7DVN4>RJYz$0l7}7I`VRaZ@hi-!+X5
ze_6?tb$O?6QDj9aGttyK7xG=&(MNr3ChB`v=GsEtm8JAA<C{VUqRLu*i>}Lg)xzeY
ztmS>XqSRNHIhW2?o!(T+kk(~py=$u)3!$(T)peDOxXndTNpEFn$}F@{6*6zSCcCO^
z^SaLHkPLpF%JR*%50$)Y(`ALeMJChQ)-pDgcD(Ln$);7NOMr1~Z1|a!R92EbsF1gi
z*6KXGg}kCHG8=vwokm_?`#|SPSvWSvc`l1N>#RfajI?VjUDa7DLsztEt&L}56_rhG
z!{5k=O56HJ*0!>S<O}|g$IFtG7q=B9qc3a9)<Y(*Cd*n@m0nl0Mbk+4Xj|r}${HI<
zmUxrOQfqZKWj7a@47kpw45_TpTDL+Wot7bMY8@dN)2yzWRF`hj%0BP%va)@V%NFWV
zUAr<~O~*RWZ6==<G9M~A@=C^77HrYkYHegU%Ij+%WOe1T016w2vdl%==-}ltOY%aE
z%7<LOXxpl+bz)MvsjM4Tp{xh#THB^F6xwmwXL(!Nc9hj2U*swu<PGXV)=*a2MolXb
zN~w)xl@+bD(xmzpSt?t-DGQTPGU+UTotQ3{{g>w2LdRwj*%<bw%)9I?l~GC8%JR?U
zt#tp$uIMm&bv9GEtIKp}6|yp9jLTBjLn4b`9-Qf7lUJomQkpZ8(peUGWy6XTD(X@v
zCadH+B#g<)u9dYR8%1YRrcz$7(D9P>zyfb=tIO(Exu$bb%UFqIt#u@&lO3B&`;e$4
ztSa3kA`N8*+E({{BC}Prtqp5ZF?rPV*7YDFxs%@NT!=6iVJJ(=#FB`}T%Kg&MkI`!
zEV|XRMs`xiZqOD)HcNvd0(DKw^X1S{SuH}RlC9YkHpZC<3mFX^6cN=3w#LSxkXLB)
z*7mT>k*x4ck13I4vT&-pwM8WIQoho8mhIZm)5=zqtZq5W<Zs<SE#kPcn@Sn3ys+IZ
z>s`*a%ubwA{;g#Ll%WMVSmcGPR<CQtUM<?P4Ch6eN!zxe8CY3+Ceme@$+M7N(n2cp
z)XCwba-@;1U9r%0O%@{Z5bU~RID<tzrgk2-98+y-E2<QUDXW^Bidw$R+FaLeBEnD_
zObcB^BDX5GkFIJtGIRDxkaDu?<S;8++dp|L_f^`Qi1xIS$<ci;kCi!Zy0AbweDg|o
z7SdfNFl)kAkfkhZPq$-HsW{AS_+>-NlCX`+TgalYK5%$Rr|bn~*QK(GD;w5Y4tqIO
zbgL(od?Dk4P!TCtGtott+L<L6)m@jFVxT%p*XXcTa$<<&)U_t6gmg5^?EsU7Tg&z`
zIax3(GHpS)%84%eL~3$Gc8Rp6QcgB>$G0Y<<bj<my}AxkPFAQa-O^4RxvVrPCr=Vh
zM?{uxbrE8+AVrSoH<hlT(ppHHie1+Q#YaXTX`yf1HliemY|=mE6i|t!Q!A&B><U{^
zA}3@E)nO6I6=hqQLL)1$5iKLro7g<1h;?0)(i{0oZql74ikqC?A}O^G=pU_2sXnO@
z)w6C3oeLRv=BQI4Am>hjIv92qCsQGVW^-1`3w9>U5|QR2<V0`L<<)f}&6*;-AI~j=
zj6%%GeCVc2M2`@eo9kwhMcAOlq&j#a$Yf;%g(j89v&L*TQ|W>z5qc=glB(rg$!)|%
zvk{4to9wA%+$v_!Mp6W0lNBbbWhK;=?06I7A|?wC1KsMfDQeIx)(6>u%$msuc_nFF
z=OU4_ut43hEhD2P&ox~~+7kt?RM9V&$YGz>T@m($Y!_7~^yKYCu9T&Yr0idLmZ|Bo
zYef#p)>5I;i25vF*@-Hfsw{?)l=&A$JJU5OGbkNxQaxluddbwtezsG+l|4}gMPC-4
zSO8sP@<CdY1K*S{(OG0Y@WLvQ<)G`Tuu)}oie^~V_8>NDt^>}_LK7@ha?5x%jjX6t
z=R!8E+#}mqWlzSzA#<i@ktlhk>^PIOGBM}{jR{u~eX{mUQ;|I;s<aHC$za(@X)pmW
zQ4puLv*e%@p(UzzIFw}#$PC(JJC5Gg#FB`#3K?M{PgGLg%SKXe7d5%iwJY04Bx~NN
zz@p==X!o|>Wu?e0SGgTOqBP0jT33Udlmp2|oI{>b)!7uGhA>inS$bBW80w0WQIk_$
z&Y;p(wJ3A4_A1>>B6?);g@aDIEW)+Xw@^7P3qW;MG-=Lg(~6PyGEt@JFf#o-*tBOk
zY-Hcnxryfv?J2i?FE1bmc4KcLGbRg4lsny7SX{E8R2>oVEZt2TJ5gmOP>~ut)kWJC
zMZ2_pA%ZZ)4$&1QdbvEUD(vv!#1lcT<IrYu%4DWgaV%zNW~NU{pG6rD#}s0qOl@jq
z?#*P<sV${(>27AHx-47{F&jzI3uGp$#-1d4p3IHCt&9PCPRE$1>l!sdB=b-qEQ5>^
zZ9tSSdqIo?S;@M)QFKLxG+nM@5adz%ezF4V0x@jXfeerc)TXtsM6(lpM`v9`jGQK&
zEe=s(OIfhN&XVEjm=PNX5t<Eg6<v992#O3;(TFA?=eVp{9TY@*ZUR{pHfc@l?$$Ih
zS&?FMs_9W+s}y;q7QXBzow8u~NyiH5yY8%{lLqA+%z}(c(d9Z@M52zgbvT)1h*|Na
zsVx}RvW7Z4lSOEw4D0Tu37IIfLuC9#1ZOJx<>W0e{PeLh=`wvHV)VR_%aEa6u=O&O
zMiB&d(23-(OY<IZ(lv4v1Suz~lGu#Hu9Y2Em~LM&fucs~dPrr{sb@ilU&c{P!qPUh
zbWVmjx8BuAR~5+W!4ONbu-%O%B?7uNy*g*_<V`qa8WC!Yw4JCOI*eJ((s4P1(PVW!
zh@?b~xAh>hqGPAoJd1e{JQy;p9oxcAURhD{zOqP7{}$6-R;wO?1&V|Sb=8jwl)=mv
z5eK>STDFRvdeXTX(Pn2n!Y8xcjpP%{BQ^I=-Qa2|>|hcDOdcAvK~|(}Z<8arv@V)u
zr$=B?tA-ntab~a*v8xujbevHx%?~3gRmIV+vzc;cid-;VPNYjC+ujshQFSvmq_!ac
zC-<0EjAKJ2N!^*pC#8YfOodAHrVbrIJ1!EmWvA$H$r={hr3zM(s0`{m(fuRqNruHX
zwAx?hZISIL=Z1_#kdvJEMQ+-lsCij`{xD}8h-ENRISCM>;fQGPo0!-w$(s!xEsk|D
zCL8OXY{nJ=V+tVJF50;+P}$#@@^%E4X!mUzP8>PpF=o{aL?X#Kpa!CB;YRma7e=VT
z=U3ZYh{nu!cIsuBbU?(d&L)Zl9y}cskx{Y{OyfrTmr2q|7XilrHMv;_vgPCzyEaHe
zIgVtiO<2hKLMt+%iPIyPA!60AlgcvK7fddWF>QfI)!`2jHU)NswJmy*Sc087Iz;8b
z5;AEoZzM{B$#gl$Ym`-;GuEN30GpVkM$)$7P>@Z=_6wdInJ^K5=86-sgMcq<lOuAt
z>bEwvviU^X>v<@)G}d`Iab!KqQpxPRV5`^Rgcezcxsj@b$?@sPsxk#$_O-Oo1RVzV
zlMH5SqC;e}Y!lOIYqTJ{P9BRqu5;^<NO2KZMVXuBE+S53xk(r{kEoG4D6%pTuBOY0
z=_u-CYqKeKki1-5hm#j|MixM4K7tyjT-yb2l9-V)1G>9q#8HB5qsnQ<@fBosi-0Ii
z5+&HNRqrU2O)EE<vr?>K>`gfi^bgrRBBbizMG?u>w051WaJHbW{tT#rNL|yTu(a`G
zYFE{<P^%HaiG%Gg%eM>1wHO$68V(tewK!H(+=yJmQ>62Z?L==)r)}^Sr+Hy3Pt+w*
z^G%15)m0&{g9(jms<tJbnTsb#`%cYT(>rs#GBQ!>x5DyAoim|=10FY#YByr6%8PeZ
zuyG0w|J+U-IbR!mO|~~>mp0_!>wz!NZ%yey&A<&)6(;3SKxO0Et8-+Eb)Z`veHiym
z9t3=jM7IH_dxh-;X(2;Nl(8|HE(6kb=K1GbliAJmh{%WtpnRF*OY|OKA+4P_gb2#2
z3rYv^2Xi^d#MFr3){G4~Zu2VGI2Haw^GqPCQxQ_B+1;{`kuXJ2A?1|8S8gY-99pQ>
zrdK0Do7OZ^nG1SdRd(RxeMrs3#318nYl0M)JH$$|J=fyM>^1XB-cB9XHsZ2n3iGYw
z9gu@O&CI_dBCkg0(=9A}y=hf9L64H1Dknp5pH>Aa6hR4<1twdoF~@O-THM(C$sx%r
znuk*?8hNPs8j0%4@3Lp?5JjBIoS9i8GPB?aF>xctUD=wghiZyo)J>P+auD&X%4LDN
zj$bpgGpm&T1Q&b-uutB@ysRB|O<M*9DMOl8X35BLTEPKfj$^Uab6Gs*>k<`>NQ=q`
zVo?oFs9@_An7n52h;&J@0<<}?Y2`iYCOA4|o{*dR7BVNYj59Mzl3c}gX0}jE8=YB;
zWvM&0u@hCyOEDi?J2!FNl#Tf*bmhv?(S$=(ti#|HkeSU8?`G@C+K{t9v)R<uFLM$4
zAP>Rlv27+YNo>mC$(Ez7N==W-WI?qY(ZS=*3#R7JMVY9uVS^fr;AzdphRK{(ZI_yS
z5J_A2nz^iRc?~g}Rj8C$R;{i)=~p8HqOiA+uHZf^%&--uMF!HW1I|>u+Gf1SI>ZSd
zPCePCB2jf}lTQ9^3hg+)7SZ3N^X8vSDy+}WG}nemqYSxjGfrADpepmwh{O`X9h8Kc
z;8Pv!Zdt5yMAW%CSUN1vyfgI_Z@26+dv$hjp=K@yPmP^Zm_CWIiC5A_JTFn4bnPPZ
zI5I3Mm!mv4X1f&RDkD%!Ta&V&WZ2E#6hptpL1M-Rp03(F-Xb(P2U0uD#0rx0TBDAv
z2LzF*&!wF!V%D@KxKWYu>(r)vl|;&d(IrO@_P<48Q2Rw(l;-h~!!$z(Y9B=ZFQ8j6
zw~h>g$XPo#MV{1nZf!ku1Vr0#$cPw6`iCHx2rf3Osc&+=SJH7ilW}jQ!3QE@TsGIB
z!-#q-b7SVdNLP$#TO4hgvC(Urbm^*Wp`e+kxEoq?er6(HWCBCHM}|jQ%q;pU8l?Q0
z>6*lIBpPmIkz$ciVz;NJLgK0trK&O$6Qxc%ZoZ8~-d4<Qvt3XO2-XDa0Cv(`J?IH8
ze0gyjNjbbqoUzuN9LOzZuO1#1(xIz^Mk+E^gi2w<FE1l&)y!866+C`wbmd%DSFP=f
zipWu;u4idMlqgxqt$OE~PEiFdl$Xff<4`sKD;pNSj-3OtE#w`8HwlC_(S*W|Gn5On
zaR^GuwB)UY@MWVm!N()hB^H#tanPf%po5FLL_H-`X-bud8gw|7;`nrA*Q*{yI7E#4
zus3CKi3rAqQb{D|eIwJPkCiiBw42iOs01en0#a8sesa+*f<8$Q4w0`To}<@w)>m1F
zIB?B3D2In^r__#>22Y2`lp@SUnX3u>#57mgsrnVFQ>vPtxdU6aY#Ut4j9#0WCRSpB
zRp`^<^v|>4@y6=!h_ai4+epXdJW|_5dMpE{j$>pLDv%uD=Hza1x0r#*OBDFlO>kFo
zXl5q8aABxN*R19adqRd<MS|#-I4(^2YSHF`eSznj@KJDxs8OE<Pfmr)59uAIsci@q
z>Y6Na#ad{`(eqnu)+ZKI%aAH2?J?u@Y}fJX5Qri0A_uDIK4u`YLJ<+>SCCgy#Uezb
zTC}`UUHY<yM7DJXSU{%BSOyQLoWdo6LY2Y1f~=D!M1thyWST3pH+6(evCB{d<)E?_
zY8A&8Ai&8kDnyqD4WuA?o*Uet&UHDMF9_G3D8H@!Q8yY2wI!a)ktYJjMzRFHQrZg=
z*_W$2Q$od9ltZ&NA8<#w6C8ytaTL#>1u^TQ^>x9k28y5y#(J&zmB!BQ3^$XEgL$$u
z6&<y;fLWv#t&T%WWY`QpF+&P;2s8I{T{Bq_Hwqoe%&UggjI+b+5P9ncr?Lrd8HS3#
zP0|7t$V1RKl?BlT{{t$bylRu#sutag{^)j;HBw7|Ef6QioIK3Dr*d+YEq?f}k4Du5
z56qZlr>7P+A;c&)aA#)`AtD)ZgAXNLhkeo7T*x94Ez67&bu-DK(3*f})!=8dBQPW8
zZcb@Ysc`95UGR9fVr(=P#}TtHqmM;6afq{PB#6-yX=X7Zc^m1fjEe0|W?i(wBKR?7
z6*YyeDA`7GS@=T)yzI!_7C+IsD$mVgWg<n*t4tcorbzMhm^%Z1Qf*E;QHeTrtJxpy
z=0=?i*m@``1ei_I7DUs7`$yhLbas_6(x_~i%z`?&&Sda{-#!t8ry@jZc2*6Brr&0w
z*vL83+MvixvH^pxTHwbC+Mt|ySSc1>;e?WdIGDMz59H!H9M?p_a&tY43WKO^`j~qG
z8p{@&oKsaAT+bPPDLHNpQ=p;d%nlEPdxj{o(;uXhsQPUX9VoGtd2%vBL9*h^n_e3X
zAjB^)<nw?WAg&}U+(K9xRyaC?O(2$*fk!Y1ur@7rAX^)RT!?_^+K|5krmY2DW_U8u
zU~&!yTh+jvN}EkZIWd2kjU?t>7J?oqeBiXSxke_a3x4~Ir66awi5pR`Qx3f*L?>~w
z7Ist7;UBS+2~7)RMQf4+&s1i{b&g|L?Pl|Vh;G6GX(3>-L3$h&zVNauEwqapMb?VB
z*3lm`oZe<Ni}EI2s53j`rEg^y;8q=B80p4fKVgZeUeI88RK0gGQ=dp@r=D25?4IBg
zLyE{Gn#WF*X`q98h{~#y;Yss8zKOr5)mKlNN_4@(piab)TlHU?aFvEz3yb6CkWp6P
z4JWS%ELnw>*%t-6L;y`-g@S9-^{(i&++v1`w2@csf+mLC4-y9O9s0XD&|C0rvZ2iX
zP>O~p>%fLf&XmT+*t`e1E=0Xf#7Ggmtci$OjDPI|ryBlEGskdyXxzi}Y69V+&D(bD
zT6L#}y(!DT(=%SiLC%*p3!oQ~s<P=jJN<L)XRHWwi;B`IYp=4A<PgAR^TgcW4FF72
zCdAZh@}dY45LsJkAG+z}G%Ol(#mVWfF=#XVaFG+@wnJ1_Yb8dtMZ|!@5Q{YoXMs=&
z8a&~)va4-kWHI3=vFJ*JO(+}6>@2YhQlLq;9%LyuRS>(fdzb*57*XY9-Ku#<s3pTz
zOY<H%Py>OqrNTj*n)_Q`qvJ+%HG-}ZUCNf1EE}TSY42q%RJ55siCjZB(CZp#u`Ei9
z`xM`Xq1bB005rBY<%pAEZJOZrNX1M>%$R5-Xi?|p{!UeRnKdkvEM3jZpigE16iXGZ
zI6<&aEWlQmoV@0l0Of?sHGnBoQ4p%43MVg-Q|VD@r(=cDo7rZfr=3Z0kh-$#8;kRn
z;3~-Z3VRa-psrAP61Z3y+JLK*F>Shlenebx%9zk>09cv+fL9tYRucfCVsExhaQ{@L
zVpwcYM2z8@Fg+0uXVX{&1ocBE(_$!v8lQ5+cKy_f94Xr{F@Wk!^z+toPWApMnd3Hq
zuSy~^RR}K^I5<TqGSMjQVH?|;lm}rso2+Kx%eiT1xBAn&07Fzz4lX={2(!K$iwS_$
zNY$%vXI9z~AS+D)1gItr>XT$;07dRiX#6AwDg_AF;+Qd?7`hkQgvoRw5tTV3<ix31
z8l54pfxNa&?=9<iDf2F3;ot``>sn4n@ZMzz4vRXHRc22EER)O3G?tx(Fbpe7jz2<3
z;U>{}ihlKLtU73#ILG81&kgmA1D&XQhzv@f5Y^@@!LieWV^GRchVO|g`faVQUR@9P
zHN?CNcDKT<OkplkPJya4C{V-f<>nZ|$tb%y4Qe{pT+_b=VW|#)x%Rcd;57GlQUPMG
zP3g#aBuF?z+!4DFq14CJWX@7^e#%V@YisBQk?xF3ZXwME^j>Ldr>xB!%b^I-No&H+
zZX`TM$P+W6iRGFnhgWD?3y+C0*2rkKwdoIquDmP{+F+xWf+<y?K08BJ0;;dTcbIEk
z4m^B8rcWx+vItIK@L9lkbq9)s!2q`2=|uP6V5f<K(%Pw46G}jZu+=X%eP&`8;aV}s
zW-0&@>r7Wo6wpyLU6A%NYtkh%2#B#`PwVifD6&oPvbL;%)(`>oloQ8J-je7V07V^S
zjp;NN{E`01Q?mfN1Rg4@yvKpyZfOnW#rX<6!h&F6ugP7o;m00m4D+7=g;CpEAB2po
zLp)1lUja15wynrqM3ePZP7=U2=JTu7+aExZa#&}I$_b}lrO20X*y6em&Ruq?oNfU}
zDsKREEubGOPJ7!Izzsy@vUpaG@FIW_d_lM^%nzf1XW3gp%2hZMdkqA0hcK@>H_-Wm
zg^!I&Y|wD@(ouGI&`4W+g>BHIP;H10>+Vi9v%><j1;GB^VF1*p1tVk@D~mdBY(?R4
z6BR2npIF<noH7HSiYf@G(fskazljvvuoie&GPARAORzS~HZD<jI}6N;swzik9x_=t
zNo4SwF3fXU;AOBrbc*Y;u!-0tV3TY%Yeg*?>KXHncxhqwri{HTWD$ASU*0}1k7wtn
zt?iSO?VpzA@u(LJOFX<i(6Imrs~BWZWxBzu8iU(3IC({UYqeQ;9M;nL;PNDYqBS)J
zSB!|Mq6*PnIV&x&O>jeIr_0(d#Gt@g)xj&7DgsP>O`;8e9?n8WhiD)o@GU|H#<c3v
zBE;fAM`Ea&FamLJaSy-^vNv*zUYByNBcTJhQYJw}vdw^qGMxWy@9!te#X?%7r2ywQ
zmo<V&)`bPTM8?%sz$^f3EV1eWXjKQ+a0Rm5H623NGACW#ncB|&L$@{`GusB|mpVg9
z$B_9oaZQ|GvtVrbstd|6z6EBMbgBv#f2*kbJiy=NkPR^?lv+|hEOMNx+Gc>hLJ_M#
z!b8*oe@$v`wzANOgyAO8?LqYgB!N7VlqMbU8V7M@vk6R7jKn-3H#rxI(jw6!RX8IJ
ztXUGID{Um@d$oxz_EO-ym!;Plvaur0YdcabSW!FLEPyR4j4ne}W9<;K4kHOhgDu)w
z3n{ur+RsH^)pY>na+1sPu(P}+R8r?bgCodF9z|GrvcR*D{(yH7aJaP~15#yXgw;S4
z(-6fXdq#142804D&{+gFY4HN5W+RHY!4(;T8>K?#dw(7{c-fE!JQveXUN;MvCPFPm
z2*lup?o5d%SPYA19W=NSyD-m-0RK%@yao&lX1)0<0k`8FvZJ#S+o3g^hutljAu(zl
z@e;VS2sCXjSFemYF%nJt6DvC)3BVu)n;=0=RBBJ{xTsiiScU{E&4=nNZ><IDBI{1Y
zO<~Yr!)51$V(P98i3kb-tIffPR6=&xp(E#vEDf6&nP^!JjYW55@Jl%)0uGJrp(1GA
z<PXSIwrh#{i=@cffUnIJ8EN)eg(I=HBq)RpX@|Cl$>||E#r(FMbCo%BG*Fyp0dXKA
zRGw0pIh56!;iIWes8tx$T^<r|h^(iEut7`AnO@Txkbh)H>UHMS3Xn3Ebz|uwNKCNA
zxfuu;t=2Y{4dc=bxfLX4W?>JD7DB$Gb*LiH-P(h2+KFNm@B$5wC8tc+WX0KQgNHA!
zMjJNQ9B-Q1YAryB7HL<6ysk{)_y&k5P&69L_rcdLBCj(q8$t6nFGD(v=<jV=1`I5i
z4p~Sxc<R&)VaP<5g&e<@Z6yO&;@&OIa#QDE@U`QFx5&0$mx8J{3rO+Vb#38ASzctc
zwU)$&BP_M(H8M&h5l|tsl}m(a-55%Q{FhoIu;kt17&E+-1$t!(g&aGeE~LEaQ7QAU
zAXwdI2;r`^7J#<M<}xF!L2?&WuLGi2%ZX~nAE<{iWRR)FQyK=ATtjr}5Jr*f#pVh2
z85R?MpI}`9Uo=Mw{#}`hB4i-~lf@o+qUszFnbfRpkp>m#N*+`al2=Qc^%@`!sejgj
ztS9EfM4l|wy0gqM76&0$n=|~2031TDK%?+5JMaPC6c(^X+h|Bb3(=dFFhko0AB${+
zyyzWkl|p$;{%LliIY<a@Xo6K5BC9z6b33NUDIrJ4oERF%)a(o($R*a01%n8Q$wtVk
z5J@9B)bw_<%4_qGfTqN=l7-|Sf`+-_%eqoQTUp5aB-CD;FB$_87?fea@Wz4#Hl?Z~
zW)#5q9gyL=F!YBg9dee{z2A@1CM&~}a8sn_eHO8p6VGief&`*P-YUfEJ2E$#keJey
z3TZaHK#SQ^n}n&vL{UKS6Z7wC1j!^V>D6RfnyL;KuM56aSq?H$L004NZ}I?*tTC?Z
zvKTx-4ROpqQM1M&WR@T?l)5t*Q^CQQ8K@8t1^c-Pr+<!5sy5dzII6TYwFO`!sd?rM
z73q=!GqB}VkO2_<nq-lp6q%)q8JJtB(2zLTL}qFc7OMmL4TZ7k+7S1UjfAJxLLwL}
znlZ1Bl}kWBnNP75O(H1%3P6=1Yl2^sB<#XeEC9AZ6zvEk0tIe7IN<1e8_XPnd|7GO
zPgx6ONw$`wUu#s-{NXHJ`Vf$t8R=d{Vc<&MwC-~SaEcPn3lRfCTqf8=k(Mnd0wW6>
zHSM~#57dgRX^UW=k+d$e*(cR&;)iv-VbfZ+4vu%#It)C(p$lB130~?P*N_=K1R>Kd
zWYV#{+s1M(bFc!S3@Q_b1c%BV<0eDN;cqV}#|V1ArJ?{}m2IQn;Q7MHRBKy|bxkiQ
z!oJ9W%h*wZ5RpH#u+1_w*RY6~bYS4tLd$6xas@gt|Dx1{SUss_7LXz~ESu0E5R7i6
zdAKTwu=mT_@B)dZ-4vEARghJRz_1`9*=eB1Y>9U`)@p+%5eSft61)!b!;stF<alh&
z`IX2XBi$;%prw~3?&L76D6Uz^(o0z^mXLu<gbZ!lB%RVAn1v#Oxx+9I=LJc(IB!iW
zmIdE6<_SaKl3Q7XWEL@OTMHkE`q!};4cH?~ywL+Y_*Qdu<y$zS1P5<IC1LCpbE*e<
z&C+d}9&DS5?$m~nl+{HT-s~(iL6NN?owm|QpTSl%Y~R_zRFiRG>DA!$K@VF_Z=xy@
z`E!QY0Y+OIC{2T@U0GP<So+hFn4E<OGbpLXd`<W{7zr~<MC~a85-~%A5d$sgsv;+I
z9IqxP)pE3aVZ=d(5Vi;lahJ^UJ^`_y`k28}ld4#y!Ag>?Ao8LPab)vy2MP#{2AOgx
z>sA#pJ8@bRPw8I3xS@>XmcX1rgpdXACHex1&3T{Yp907;XBFue1jg+2Z}20x7J2MY
z6`M97cF-*AHsB_(8AQOCo2N)MIveu3fEpD6{?@2eN`nU#lu8zi^$vYL4{31ZvC7aE
zAwJ9in{Q6@A~EC3Kmmatq3!ecI7tGBhp40-QI$RuNDRRu*xkxwlBa#_vc&^!x#{c-
zC_yZ%yM{lZGW{X=8_k_6(?}wfv8E(I#VUfWwkAna@2cS2z;NlxfWrm)B+J2Gy~Y7*
zS`Y#WN{#^E=~#t<c_PDl#UXAoil9zz@gK#l6CgD2C83w#Ur`LKsLSR%&Z*F5{#cdO
z9dRPtwwyNTJLW#4M})ccxUQkAD6Bbr`eoUsA^#PON7`8ng+_DJ;7%opO$1AAOFS1F
zDi|BMUNZ2z7XRTG33fL?AyGNZMJao;Rv~T%4@ySSr-6{{+vZv51G(B+pi%&riZvVv
zFCZ(h_!dT1t*#V1H#xMbAgc>a0ya2<hz><QwLz8<K{Ao26UI?uhXUL&O;Ls@7EBmf
zYYw+cxjoWgUsRw9a`Q*!03!{YM+}NYtlI2N!hscboaxnwhcuw+z;WQYHIxrIgJl!q
z9)z^gJZQxw5LlQSY!QLt4+kCXiS)6EqO7h;#HQi&@iCW0?|<NPV0(tpz~IV*m88KS
zQLIBm1S8yVRhfEx@}O6PWyK?w4~e@)uhUi}uF276t5s7+&2>+T4=Rb}ZD`y>Z2yqZ
zj&{`8637)(7GhAc>(z7*$!>C(717R;y;&2b(e*$yqs{D(CRHOpK#+;&RaH3JYTO{f
z-=C`%TU$&YKsh-yruYC&z^V%_eqsWKCjzgkVA5{D3!o61FGyYx!V(*=7XPc^YemI`
zn568<b{NbeWT#;f5UdU8Yw&93YQ%^EUlurPI${x}5jf;T;EhKKy}Bj9Yha56&AAAi
zCk6Nd2n52ah9f9Yo*;y9DTi|th-1+^7C_Jz7G?lKDVAhj4mmVP0YhwqIS^rFZz0A6
z@Lx-!CL4(ui)Ay*W~c&f2WuRoAg~<(&P%Hx?M;|kQXEi30=;S&<?0q_ihvC-K~?qP
zQ=A}KW;!hie^uFgatQy(`cnOygPh~moOHOuz}*|-N(nqd)B+Q_;7m4kzOM7E51wge
zdObMM$uLX<<VVqmxn+ha%&+XaK(f#&%TP$8>eL1cDl+S}3wT3B1(E+AyCM4^GlrfF
z?HJ++^PROoT}@bMZnMY)bJEGKz*%ql1Fv3c@{P(7;38FN{yS3q)535eBsY>vmxt6$
zd;)!z9*A@Togw*$VK!tI7$$Uv!t@8yT1(>xQ85BRNbpxnTMAIo{euT2HA#y)lqr9Y
z2{!b6v&fSgr*EHgNh(H)9I?RzW-bSL$UQ~tuz*8?x`63nMuZ4g1?ZVpj7b@setPs~
z!Q;*HD)3Gi7z<7-g08wA3jCEtka8ra<0K2AFA(x(Dqz>*aIj2iY%%yR42&xCpXXT?
z(B;xx6F`b$+2U|3Emlv?MJnfi0Oe|aa7bm%)Ei|dFR8=wmu<R4fv8y;pdbj|Cbd_>
z>C}>Ftmk0{l(%ey7DTX0#7anMQy*E@&nCdCfc;d?C=(VqAY?xl!R7^LiJE37uUsjo
zQ(%4*Z9=R{v#0e$M=!Iju2|kM7i0;Eq_)|_Q&=_TThB>N$22l;ncAM}U`DB`arOsZ
zIvlz<-7L?gBE2c>VZ!P7pzN`%v#Jgfl;z)rT%t^iR<<FJ2S+p+$d;M}<P<lgJ{Ic>
z00J$bWMH#&VP`d(UJ>vkr8-tk6(Fk7Sq7~NO*|Urw}*_ON<%&qa4P@^0b)b^sj33(
zAB(pQR5D<dOr2NiB<z7SSSU5wlvN;l=vZzcr43g$R-NgzU?Al<x0l5kL@?A&oLswI
zn*Javi&9EGF}w{??!wd-;y_t&%8+4NSG`Y+6lFPT&B8A;<#{kkD;j#MECM=0cu2E6
z59uA1^5lgU@SbIc=O<oQcD?D?VV|U}VZLSLTD|azg+uDji1LsRq}t}WITpyGD$@{4
zBJ_+ZYZM7^(*%kOL}{&%r{Eh@Gs{9)s*0!P=}k(U45a}Wa&_2NX-LQwjYBlHG-O>A
zDCtHE2zOwOyUc>cu&fo92}GIzXcE(IL?=K+GkY`B9RI>t*AjKQS7G(5;Ri#DjSvna
zbL%9;ePnanxk-FLBwf(?YMhC69*lLA?>aauMSvpo3Og@a1(8{V6p9g`|E357^T84c
z3GFQgnR(q6CsBvIHGF=R`HwUw8!%9x@`Y!&38`uY8IE}!(4&gnNCPB>yw;+$tnNfs
zKPsrbAWV2by>0D^U`0%to=7044LP_Z3s+rgJ`i9cWgc8FvJ((rA!(MAiM3{KQEau+
zyd!Xvkux3;DBu+kKb99+sKeO=8yQAf7VJ&=ibJIindOi{<ymN<!#5Qe2{K&pmElx1
zMpySqpq=JRwtc1(zSF=&Qt0th8~zl<6Ee=++}|CJr$B%LkgYUwqJ%u{6l{svdX0jJ
z3{ajacT(MiWY~&eVAZFpaa4wkYB^U3Nwz^7gsrDDRg;kf_NvAP2(=n)a=%F$Wj52L
zD`VMIeXO~KL5;Yft{aA^3sG9lyeR@rBx$4>29TX*B_6F_(gHfIO$uaW5uiPprjqIL
zW6nHHtbkX{j(8;`=+R-o-BOD+v(y@RPYhDlqE#7(sEQ{{!79iH<#n<(i8i6>F;7%m
zO4T!AYC5s-uIRH$ASg3Ju$(AUTI#MvpR60j5*mtDc~wh2$e|4ZJ#B|5M1(LsSj1f3
zo7`)g%^Go>na><wHLV0m+f+<?VBS$f)-vBX5jp~hA%hlXh01`&uw~V_r0kVQXqS`9
zk{3uTZdzNdkn4&55wg?pFV}64zd~~=EKr|-%nwokcW0}<IK$~<U}S+$rBM3F!Ymm=
z52*eoCkdOOw^-z}<v<ROP(V>#8?p^VqT$an;B2DVc%mi;M?eec!g5FOFK4B_1q6sy
zW2|}Vf53TG2MlaR7ENpHdKvEO+~QPdd5Wz!DaS!u^_gLitl@VwumFV+aQc|6?r^YJ
z2&*8wI#9<Iz;4sBs{^*HF&aPHn}o(nqeju3iLNm@Df&aETi^6*+#`l32aD3kSxqcW
zU!BNESp-B9jAvz!`U0NY<~@IgvSkJd(_-7@bpWu)4rWYDse;@kHU2@FTA*yT?JR7)
zG7I)*3HJz=hvmT$D61{eELTu;0QVE%15%rX#DPMS4-7?19I5KcfFB}O*)~mZR+fq@
zF=>x8E=|MfkNZ5&E$afvBN+=porhBi<xb};CC#=D`(6&OuC9wdV1!B=5ELDW_mzny
zFkU(5y@f;2Z)B?&)(_NQ+th(pAtmS-EH$J9Y2#+**6Q+W3?Be1O;?1x&x|yQs;6Hd
z$0ZB=I(ey9NE(hxva15@LXJlzsWU*6XszrrbH0_ttIIano5Wd2vC<)e<4IHjLm+|8
zFU{GX!!RhXk%p}9w&|)Ypht6_T9tuvi!AuY_ynXi;&OEe-6$zpNCN@z+NHI5dI`s)
z3kITA@b-jNY(taJ))Zlh*SxC17lCzW1|3v9GWJ(+ZlGV`vNK<hl4O)2^`Io1##~17
z+V~Iycc!woK~btpfUSV&w-ZOMlcOn+pTfYGS@1jKqLO%cu)CqLDh-4Nv499&JMc+m
zsR%aeiefSJUc(ZvL|z6g3IIX*+aSmth|11<1R{|%q8JDc<ZOfnCxi*{dgW!$r$WNN
z;fKf?;aCoI9PlaUd2m|5^VI~8U9BW?wVgOfZq!ZlCecz}H6i5{H;25Jp*R|)|1mda
ztK8I0uz5+h0#gu1oNTK!B*n>k7cC)Bd6ybGGu0O%m-qha1S)B`hz;&3(iF0Y9vDmr
z-ZnH|lPb$X#sk`=$TqW3P_NQDsCgBzQqC!T3lK<EmxqiF9L0ghlr$Hb47ecVX%Cqs
zlbeC*c|<g!!W?A8wsNDWg{%o+kJ&iVafk^`0fcm{<}?o}&{d&4jkW|}9S>+?qA|+w
zYc0t5L+`0u2KAv1F%+_~<wUh%O~?hT+bTE$l%BZ_*@`(tZH*ys64GZ#3^uWwYqm&X
z!A^2sp)k?el!?G->Vj4*=UEjp0?7KnV;0=QpoY`lj88#x1!fwYl~v#>$kp3igbX<{
z7sU26dRSRaB1nS3LLG(n&YZRo)-(fKGs&vvTT-1*Gb7D`L>#lS7DT8Zx^fGCxAdm1
z111MOUlB1T4T<>{c6fjfC2nhHawUU;BVVPQaWZEC^{4D&Mp&yU-W+Z^{27Xb?P1`G
zm8Mq*D@j&()|lr%Y4Mhorlcu(eG!fbR0iUG<{Km}47jHqU>c4LJjWU?sseQ%N4F-!
z+E&-Rh!99nc9xI}fj))$78rUeL~<LL=Shf{!`HCWxD@L?vm6YTQZv}WgxD^EUR|sE
z%|MB;i-6EDDj8m{Zta*NZ$oJt0>oNV5(B$Gp>rnC0K++c)h6inD%gz7lanpu{IH1u
zcqqn06Z$~-z`V@>cW{yhWS+tS4B5@nfFZ|HFfzpugnR|KYeeHU1Vy3zot+`!mBxjH
zbc4R-Shcx1-=O}%wbSzqL1~!<ilq)GR>*?KqU?&+<Rs8Q5f63*f^I9To_$k^4T~~R
z>Hs25b0cO)K`R4!BLNl7n=y|a$kncHLT)<T=c%PIp{<fFXw0~nOT;D&iJB@Kkl{cY
z4Mnvf&kshwG>kZ}sw8|CK7yvVwkS*ju`5nQ%WEYNZiEEtT}+YUA?LEt9GZ~gjYXF>
z0a4Qss}H2D%oY&SEQ|w*ks&V<)eY2`Jr)#OXX&P#9t7V)HWH4@GH{vXN`wigo(Uf)
zIJzzXQ#!Ej!T(yr%xR=U(qZ7txp6*ainh)}J|Lt=oF>|Fz!X_l20k`GAdSUXA%ZS-
z#oJuSUhM))Cm;^8s)9DyLS!G9vq{v+IdXKzARD@>2w8fa+9ZKV9RzX_$TYB@s(#nv
z&45q9JQEO<bb)^hb0deYrI*#B{~8q1=umoZI+^Wh5wsihaLxA6J`~`%+a~m(fq^Ap
zI6)wR5;D)FvO$@@O>y~Hx7I?b<V42wMXVH5cHmS*=ctT#PgH3R|Jvpm8UuO5V4=WB
zRn@sgf=Zk}JpmNjjOb1w)c}q&Gqshh0^))^U>DiXoxQr|U85?5$XN%uo$+@fx3Npi
zBvhWlKC2tnoH~>(K@DQ!&CC_8n)Gc`0Aa~ZNn6sl=-`+u+rV~E0S&LsSHjstc0hQG
ziZqiVprb)(cXqUu#Esjg?DJQ^Kv@Pyg4zjlrA3rUR;?^knou#iPHK2sl;u3=QB+k?
zB)oZ1AjRzI7uZX<<ZU*Iy5~*cIwCk-6^3;Ovku`wpf5oy&uo+Akf=9-H-bFWhEqmu
z7kmk+k*26-PG(*=Fm({#GW%Q;S<`?`N=a`@yRgl`%XPu#g)gRTLl%x4no4WZ<L$ws
z1TuZJrXdlcE%CGGJ-;uTGsG5i1w)jEyitC0^`t#fYnYVYwhKuXfKQvobQn@J@aqTO
z2<2)?LjtoV&xMR}5~V7uMUjw$N?5I0p2t&{3-x&9qxn3ZfB%1<tVyewp_+{e;6`RK
zUEfIfiii;OI<@lJ778X^->};f4Z4YWAqt5IUoFTOZX<*W9;Vim$`ZPVe7Fq?6^zVW
z$yXFk-9HV~20ZUbVpK3Op!?e>HGuPt=yR7UBU#bkCYxOZ7R1k_YZ3pghNo$i0aXf=
zIf<xk*53v~P&uJ6`f4SQh))9=S%I7*MG_Bq|1^RQ=>Ozv5xzmIA8rHcfO#oLH5rw7
zBm3JRqs`DE8?rm)G)TMQwn|MqBnjO19OA=BqTq|_i*T#>Ru265G|i+D!IZX2z#^~N
zzgwvxCiHf^2E;G2;kHJhDUH^7P!`~{zl{@LF)bXKN=Z@1kp#4a0~22>0JW+cMpEMd
zsbL~BtrrlVhNRT!DmrqfY<vA}s;{QRnLDu8v@$%6GY<A46s$}=2*Y$MUp3DM?W`2J
z!<v*Qi{xvS38Yl=l)M?Hn;adj(?g5~B8MWbNuXgs88a*PB99(AnJay}^k0!bL}}e^
zc$ZQz<q%CGxciYLs}X+=kR8ro=~f&Pe3>nooyPtohe3Z^1^IHSf#nwCRdlB~BoLIh
zN;m`Y6i}XF<A_YtKwYa;g2X9?r=?)Cw5}4$T@AWqxD97})oRTa$X>H5bt5TCiR=PS
zT!fGeLw_4409k~@Ku{25N4lqxX@Vp{{^N)4hT8yokYwKh9BS|!M_JOKOlPEmD*t{v
z2nCiKQDE6}5X$oY@!d>I&Vj{3#b31XX<+P?X)6Uqjgg<n+aRAnWRo06g2J#$017J=
zN(-fI&CYZqSt<PuDWxUMt@W^!Vd7wHJK`VI3X$_PPInD3L&306ssY*^HV)^m9Fw9Y
zp_!uP4?_Y)0KQqG;j-4@Wgmt_);FpiFbrs%MPkR@jeiT>QN4#amWJCvyws2;!88Jx
zuZ~a4)P@G!02H4%+At)Q!p=Fb)M+TM63>7{15v0LFgKG`KkNW(Mu?T+^TOFtrg6U|
z(D_xY0OE#}`WS=)=<E_*0K^rM_o{Pi61k7YmMI;KtjuBFVEux&JcFx-aD9{|D6|-h
zAj~<?>SowD75OD8G3Ly;c)Qe%q#}vo!s--18z+F^a9t^T2#LC0mH;`1!yO!;dObuY
z4kKA;?FK~$P<||RYmzu`1=TrpO{iaG6nI36<QA;TPR+?U-5G`|6%;Zh9Fch)Zc7@q
zTfp7O{hVa+=qQvkPfr}uEb(g$X8?Y1CKZfntv>g-CIJ#<>U-t{1P(jw05K@21c!4E
zM@{PFBosQ0@{*E;(&3C9o|cpA0eK%r2!QG+@BkTU07XE$zviF}O9rAQ8#-CA@9`Lt
z>eDI%bv&p_AZ4mQ7>iLA&u&WQR7xWP@l)zLnL)>_HZ8eH<e9X?AzYJ$R8z_f3<c*^
zoNh3P)aya(mWA8uUJOG5Au1|?vSNd?iW>((hn*`OMSQ`E5Z{dynU3TEW!|j3IwSfG
z{t=+dNQWlM5{)3{N)plny%H-tF0Q&$N#EgO2d2{Yx54?WTs)9%As<?I<dfuQ6;*VU
zVLKU4Q}VUtt_~+Y`2MEy6JQ`SlAa2_Du>-oZj16|zyd*RG>Rat&;tx1Cp{2;z+ogc
zA(nJuHO%48it|Qn2a!u?M@i%IVct+;Fwoc+FqE{-psLB{fQ_2un3hCbreHW0VYy@3
zQH_oasHk%#S|C7kOew5T$+0!)%H(YTS5i^{-0`W~Z}8?TEdX#u()@-YK~8ANgchy|
z`V)6Rt7)Y~Ao0W@W`<6pD(Hq+W^Y1=gPgP)2V|BJ`oh8*6nePrbFIC?0iMB*8l|$T
zirD`ZYaAuFjcbzRW2kpi)IjM-Jl`@fAsVbNNCKkp+OW7l*=uSldBV!G6(>N>E_^nm
zp^)Pwo5aZybL%%4n51+^sVtq=0+%q`kz*;k_An&i#pLWDJucPs>L`MEGx+yYg(kOt
z2b8MplP{xmrGRN-Cl%i<`X`+vfYuG21o1>MKh_5oW>U9t6hPikvz}9em{}S{kfB~0
zLg#8g=WYVffQTyqXCn+g2!%>hI;gIw?A4I{J52%Eq6tM6RmX}b6q-WUMgc7fVCJTA
zBT29cKuN8IO3=ZF2}sqmM#!ENWy<@xHA${HDr3$Oj<appICvEJT*0lR-^J;!)j)%f
zfT$aEro#@XAvZv8LZt_p-o(X~5~FGm$sESi7V3r}L5S;lg8>TKE{a#Ui5im5NWFz0
zu#L)-GLl2Eo8ykJy-5pwEodq@9LXW+>cM<y8f6YGu|O+;*L8e1$}y@ltfp!bGdw&E
zg{#n%AaxF+u|;)8&cYTqF-9CDSJ7Hz9cH<n-<o(P?Z-}%(pM?=0KY*QRqTxLoRXEY
z=2GHKPE{+lhHb8jDt@3Y8e*s;1i&jbtVwu^nmLjOSE~|E5&0ZM5Gf&;rp6^oG1Dl_
zk&rN1U?3=vI31=NH<-c+Qf&R&l)t`{8I@TYEpL|*mMNnBhWB1;A)p#+joi4n2y{cU
zLSzv&w{7CP5uQW0)9nA;`4kdZLX>3{8uCs{n+$7`WD<qc!Va$7EY4U#!^{Ew<8tnt
z2O}ffMPt;k9f~DZmu?4;JgmDI>%7j>D1x-cuB=y9odz!o_q32+2xWon?yek8oKk6N
z0j`Lk$AqZ-8PMtZEZ@Q}#sLzYIvA`aWj3`wP%|>bN-DPjWyHS#`|)rH6CEV8kXb_#
zIpwL+oyaCs$4}}69>a@2Bvm^Z7oGD3F%~d-st#8XF&QSHQhWeque7LQ9ao7~Jq4kz
z@J*6S%IMS~Q={O0f#&jT|1@NKrS#e@7_GQUGFYGBPbSe=mbu6puV4^ruTa!b`^z@E
z#{iR1Xb4>{>p&pKA<1>WSE%P8&1LHk8;8_gm|h?dgr(Ohy`-IxG_3jBR6LExVu|p9
zBNd!KoYh%;8Zes_zVcdYO94KJX8<uK7^o?#1&kp+jkH)T*ja0kUiujqmj?PZWeao$
zs9FDROnGUQjum_`h*$jo;O<jM=XG-9yOos&vfw|<Er)hABpIdyg=V$-Ry+d=LNU;c
z<M$z8GptE0CQkZR>uc25u+GZQltC9W46f<g+1-?M&{ZyKYN{(N4hh8$6-A4zM6N|+
zg$l8i8Wt@$)*^45<O1M>RR>0?C0%tm@+k*GhAFA7&}dff#DO~qkN|I}wYi6-4E45_
z3Ipwd>op2I4oqd$!30uCJB%c&fQVjel`X(5#7^QMRa*t7c1pC?gD|JGK(57$a1gY>
z$fKMjWv&Kx2I&PGXAtHMFh(34n05t)Z=7b10)PUD@=~hw7$%_9ngXpR#E?7T_8Sp*
z4grdy^8e0<M+ySwR|WSzb-;WlwNN_MNlEi0Nhn&2x%vewUC*hy-s01!gd*=w@nwd(
zETiWMo&Zi8j25t5Ra_-_qd{VVH2`1foN*}lRjvhFN+o)Bk_(DmI0cEm!9G$umn~m3
zN<K;$L~e8bk_?x53wEQy(N{-@72A-)z&H&Q*U+|ZB&qzPt|xWdWNFm!2u%^JZ#69)
zV574ZF=nZnthA6sp`&*O%T!CscQD|l(SAb>CffouK&$ei9fUb*atWwM>maKu)hYC3
zJyH;Zax#=NkNPBFz>LBM5TYO;ykA)kXWkd~11o0Ztd5*hzaj`lEyrjYDPM=OQPrxE
ziTsMIgq#ubhj6f>Q#-#hc_b8eqg-iOD}B+hyDKe8-RX&BnLly53uTu;tF3^Xrt!8E
zyhjW5M%gK0x3{}d$sx-ul;Dc|k)e}~VX*KAq5{@VGe;Fq6%kw@)d@aD$9}H0plh6N
zq@A}>Dx=D3HDP?LSVQrABQcc0#ENc|PtiF(@S#FPgX+lPAL9YITWgqYDSyK@Xrl-!
zl;jkYoTk1~d?h*>q3>={4zUg81c@gORmO^1ZT5~rTWvec8|k!YaVc&Bg1%*(fK+kh
zI2*NUOs27d{tUn%%C%%4aF4=yXNW$bY;o`a0c#uQW+Ce&Ro^OD+`4oTF{&GqR!bft
z%4HO<oGM_V$eJNTrfK5tCSkT##}g+YoViiwB3Rl%0Z*ce$b_gVAn3u3DP19+n=0<^
z6c1xcg{>MzGjr2TLFz&QJb;JQxb5N&pb7=MP>ZPIA9E9+RgY4fJ?ghjqr(cjSda8h
z6MRZ1%+*B%y%x+Etd$sjD3lCK%h(kP)pM>0><m(SWP`S(|D@40BAkU29Xc*xGNp5C
zDpjIr%C-8QQAL~BNqm-Vr`|Cbp`FhhT07~t;&*agmxB`(?S@oJIadnw%sk#k+!3pr
zU^%&sslN^86=+3?;Z$1cCvH<zhz4AQmVSc0G+I;*eW&s}i%UdH97$s6X!t-*A(e8m
z4(KZzEf)sSht`XZMyC4Gpk9V-pM4OuATk6}ELLFq6b5&4vcdPuK=W>$3HtCfWqKuy
ziyww`0B65}7NmF(b)po;Hk{p}Yo><aCx#$Oi_?N2!@;U*QsuP+kUTsM5+s~UG8VWF
zWu-)Y5*AT(@KSAZppnBi&B?b>dSEIS=3bu!H3{&vBODAnkqeQOP`<Hf;ZLPDwLfu?
zjY^S9;GGKK!{X}LZiK+qy8*z+Y35C%@ju1V!?YX22+%dxn&VRe8fd)v(2|uxxpipW
zaYqkJxioeVf}(KE0Ud}U2>l-M-)a5@(k-fLy7y7#AQ(l``ZY-w8U{JOH(Z}_B<V_q
z-9*7&*_bYHU4aKe=2coDqln_Q1i-DOqF|cFFXUxOtFuM81s3;i@Xin_AXSBGE@*5b
zl-&*>7!Fx%3NQ&8$HAl}=+43;6${q#)>*;{aYK@wKm-9pjW!O=P>z|xf>4~4bsQ3y
zP{4KI4X&XLk5)eZBRu7d1!3O2ipL`DL-kY@ng%4MTnv$LfRRv)`&%Qnv6C6bR7t`o
z`CBazqhXa48jVmEk%De!Zg*3*kZdM+h6=m~!;pY}MH>bQ+-XVl+{sDMfEDB+VD&k*
zh8;iwZ{(6yNzHxu$832dBwMtk%+;_1S}lP9xErgz%w3F1b)yF3k`4lJj{>h`%@K^L
zu`vN;#Cb!1rmQLM1}(}otVzPb)N?=wr5CE{432#gX9|3*U|_N5qa6S;ilSby!zsSl
z33KX?Xu$%w@kv~W%99lj13L(pPg_KFM!H8nK4&pGtVqQ;-7wA+T2>9mPM*c{O)00y
zj)kRB^Xp@@4}Ur?Zi>EBYoU&vgii&vk9YxVtczZ3&@CKnxVI6@-lEDe^GmI?r4_%j
zsNwMl{HF-14%zJvD)tM+>}=~C*km2`Niu^J0Sng`Ohc)gx0a#?<o0qR0ojd9Ia8Kj
z`VMSB{x5DEFi~1pnUHs5vG6_~&}kVJG)W~mabW~<B&j2Xl0fcL)5UlIq!Z--E7Av?
zjEm#ooQJBWq23;Nis&8#b;-$2+8s{y!r3?ok`hQZ)%Jiir*XO|?kdNJx>4}%J9P&3
zewa<k*3qIXLnldjm9+rA3LcR(cd^A(sr)+#?_^i1#Xrm&xCp9@APtELcg_`|Y;2_(
zaA~HqH0-xr^=etk;2)@r;iI&LdXbDcsHRzG_N7FxVAE<fYbGwP1{fNaVhgXH@;VNt
z5tLSdlGVloFYhDJq_-DZ9}!ZzG759bbHjg>bK0i_#GJKQRGQyha%!Sm#v?z$>a4Wr
zMO7>4I*K5&3gIoMj-D1LDB_7zDWi{;O`;fa-8jWC)ry8t<v_Iy#x=%q;2F;#*da22
zi$C6`;lWxHU*S=!hj;+TA{Hk0m~>I=3dG$_v93(LD4cXeOX3cIm;tH_STBgx#Ek>(
z9-=c<RYUc|!480v8IIRh?W3-8Ytjmyn(hJa&H;RCtt@UeoMca;COMx1UT3UV3~3+|
zgDe5p2}&GC9njR)so3-yniZJinT$G%78O;JFyKlh0WZ|O*Pl2U%C5*5&S+RH;%TZd
zodUEC2t|^SJe~^-0#trbhH~(`gR0U43RdGxW0uab520}d<OITw(m4m9GhuI2cr;U>
zxAQ!aUq->_f~b&@X$?9T<s|?F=Nz1hJ9evt(t9n&vLY?&HhK&@`~|?MQ`S&bICX}g
z9I4FUcgXEe<B^Y*TxIG2!=l1R>pEEw_USZp3@2+>#r*~qC-@RgDHGx5JQ(;@5m5NK
z@IuA?X2q;9z*5o~rOlDj3(dT`v?z_<Hl^F$V8;rIk-)Oy^b$x=Ae1CtM1DQ7!eJ?=
zDy)eHQV)@H!ugdm_-<HZutwGq@sa4M*lPZ!)~{>aZJZ?<Pwg^QHM<yn(2xTHw2{GL
z?fD=f{3&Evc3OlWjS*<w_ar!y(51}X&i9&878dpwSXxRFAYwd#Uf?$FRN{fYj~X7O
z)?2MpTPf@)ui{dM*AyiK7Z)L*xC6i!69p_Ss7<_P(C~;;B5yISVUTgcoTC9Yc_nFA
zF1L7eP-~Rnwahf+i?ut1)hz?h2j&m_6){Li^+Zjo*Xp;x-JGUCwlI-jSxC7?d50rk
zD@;P2L~<}jUg3aQ8HD@{SjYK5*|TWl0GA~|jX6vl#Cc~rNLaALD&u(WqHS6!QYck&
zI9%YF^Qw`mr2MuNcZMA@0wJN3MRnkGz{ga%LztplL<eCzfE6<zb^uT<WnP5y0S~N?
zzoiQ7fW#U>!b%#B4!l>XmdB#xW}3zGEvYaS$;klcW5rj7jngXEDDJMBtN{nR1P4sf
z%#Nf^oc~$jK%QC}4^07I3B^g`iBnQ!K*J^#{+A*;tXjBk<l0hMP7r>X6Xu-)Gf?Ir
zh$-T{AwuLZ2QSf4T+HDVl*&J)E+2;#V5J!C(<)s|8*o7wlO0m0RIV8O_Uu$rMxwuj
zJcgV&CW#!_I4<0pY5`%Y$Pt+7+97HL?n)URiHsre8>e7kj%vyQsYZnY0)|fF!AgOg
zKy!_AJ$6#**g4>^;v4eqha*4LN@&nxE5mT>pow5-;DwXXfQJ!4@vusOe1P@BOsp{)
zo!N)GOiKk(0EU=gJOdz>)5D<&NaBbbAbdlZkW2)E^?-l|T^ZuKT(iv4&PNb{s?}08
z9VdZCoa?x|!CBLtmMUx*3hwMyGNDq#Y_+;&<8;#jWwEA$Ac;?LNFeL2T64alNY_Qg
z&M0e_SokC^;@@#v5V%hK_Dzm*NJ$g71ISh*iB%>SzP;K7KvOFqP-;<iD)bK1-6*9#
zP$$h~#Ov?o4Vo4*ssUh<3=rjH$<eK_1FIJ6z1TRbM5<D9x=`SE1XTlJVT)7aftZbp
z372}FfOaoZMJ-3jO$K_8!edm0L2oae)d8GWbD>yBT0?u7?ouUE3b$O1Jyyl(CXGT1
zoHvRN%_4F@EGj@My6>r$F+z`VloYso@L$7K7&Sa9fD<*Upg6<nR(f5T5ObF)r-uTq
z98d(+s4)tDQaBufm|L1s>G;9aPz7KxX=@^HU8?$11ASCfXIf1X!}S8QX@NyByqiLa
zlvo*Vup)J`q{UVu(n<y|9>*9FBk0JMrdT!Wp^fhbDv!!|;QB=5!R0rsNv-{$?CqqC
z5txjt1k_JvNC`H66C*1LWz1VVg*d=q-*q8LymU}(!3ROwR+h&=TFDZoU;#XFfUlhw
z8=?;&=Hy$nXrvM1Mn($6PNh{`?>eV*Y1uPaBw;}T78Nz~25%p377S4sLgH=EI-&2A
z7o;kB9wz|Ao;ntAS(954mvW}0${FEs^hO>%Y*Q-cV2vvupR5U|hRQQI6Vxuj8P*k1
zRjY|WljMS#2|6ot`wiwL=+oJ9go&a%nxKDUSv9zkiqyl2NCPIMRcVTJ6`>o@I#LJ<
zZ6DZZ>)^5wN~i}?*}4I^M(90S1q)RzZ=gR;oq^URQ=|tZa#=)cCUvHCXfP|IptB9)
zeuFffb6e4ZWgaD$^0?M)4uC9pX<Y6DnpkN;YuwZ#1R^j?oq{mWVNf=>s^b}e--W1l
zrZI9@iH3PANN<p?k$$0!($%PwkVaIfakWPL;~@<ARt|3>_HdOs$38`kWJ?r^GR8QK
z$`c_YAYkZFL`xh9#%Naw#ZZv7AZq8pxl|d_fd<$?*gn1+{@Mb<Fp(IL?3B(wnHrWI
z4+U((?pUO9JTc!U@c(3;KXFj}h<g!sB+BbtwnWr(<P)i-g-c>UoZ<FI%D}<hdgwhU
zFpMJ(9@2S+rL55tD#4rcqe*KAyDUj?gRiYo(=>}afXx9v64*;>g{FmzQE}F=gdrBk
z3Em94GEs$6Nm|f=N-E8`I8H}+hn0uHLD_{tC~%fEgwaTt5;@bkObh&u@cXa|Sdv}Q
zxowI93$<61DZJP@8nMCwH&BkZCf8vQ=3T1AI;i1PD$>d&4Jmy*JET>{@vf^Qo(sGO
zYY6ri=z^Rf1`RtFZwkqf>b@>(OX<H^A9kQtPI<~<*2=BoJRG3W?86xZ4gohc;yH5@
zkdwrKd#px^67C)*Kx=0b<s>GIqt!i4YcMNcI1U|>mE*<%`qJQ5%1F+{PKYNC<3u0?
zPb1m*O|%2ZwO7v11{ysCUwk(zbHNrv%%#RIETb%enw5-8_DI7Lib6r@S%~fyN>`Fa
zeNxo)0uo&<z6k%f(}L8Wqx=e-SY*{jEeMzyiiND(LLGz7(P-KH>Y9h%t%|`W21`Mb
zE#53@1bE-8LOD|W&L9}_m@<)2(Xg^I*OU&-oZYSYVKrpIX!YuMcfuTGH&F=^u&SnZ
z$D+mtH4><{or5=!YF#5lsS;6BhBb~PX>-8xQ-+$TQp|n8BdCy@&R8CtVyITDY=WZI
z>h3t6V<eL#cq&DJL9B`Hwtn7PExCrj2!k?iQ-UKI=4z&e)IcM|cgywvQ_bDN$c~0s
zrojNJ3pbh((>e_geg`xs{hHu=d>Ymb`Yae-QWL5;Z+PfQH>RdGFdi_7!);)2aM58Q
zfoE*}kx#Ok$Ob$Tsfv^s5$m+rV+sH%=PS2yKqhn=ks({HN~8VOsUd^!lzdDi=Eyxp
zeQ}^_SiLygqnrf2gMdLa=b3YUCltbD=29Y{fKMD+Q;V#_EZ<^5P?$E_I6CH-pU@Yy
z&{Rdegxo{=4|t9$RQ?d|uvG{Q<EN=Am$RafLu>$!bgldm=Z*AL_=^iGNu5P!oC4ED
zZ-mx0Wp^}A!&AP5yaO9S2s(}C14~(5Gm!s4gX7ExD7-PPao8z_)J4SVN_owZe0Zl)
z7bMI%>LH{j{st>{bVZb4i;=Jtf3G!h&>bC&APPyRHfHVdTw32yj&+Vl{5#IiMImNf
zS+!;*z|R<+alj#fz<`U=%(VD!omP7$2Y`SeW=?cP;0<gb*h*0od>}2?Dujf<NfafM
zDdK`)Ga((Y(})eZU0zp~jSnVBHKeL^h8X*vEPr)<YS<?3074E-IHj^Q!yv}r^u*zy
zQKoMYvd&y5#)KDzx>Oo_A6AKGFwhUUBcOG1695_rzmz&)$i<HW50DxptE_zutax~X
z)&@p3#N&c@e6UTSihyT{8fO%+8X><G2H&aOPHtQTjDyG`YYt;li>f<7T?tSDB@OQ|
zj-eQ~OKObj7I1EbGqiCBRiTzy1<P(rvH3baO$4!0H{tAp{h)MI1&WlwZ%DygGL@o9
z%h^iAh^$TE-Iasf5L(N%{$8or_AZMG1|$*0aAX~zj5XfRm1$xh?jS&e_(<a7q6A}s
zCkYFJiajp0Mg3UPKvPXOuU$}{*~U8w1&-DpbO_?A)7S`%RH%n}oHrt#Bo3E|20WY&
z2uUOZ-#h*l0wwO~(8_KageG?grd$U&XaIs?N#V)LEIBa@33>AzZ|rTfVfSuuOxG}4
z<BwMiS&ZdtS!@zYvCDNyM|GyiG*g8X4Dy0CF(tTcQ%!dz)hbh5sS^rToSf>0g#zrm
zh>Bp*0M5ukC?HjwgSb)fJgWdv4!epA?!tvFLKX-_gURgF8PH!KW-%0@oQuL7FsO2O
zF)Gw$bBWq5JQw5x0wR?2OdYKKQYOCBlG{Wkf`|*3{eyE7G<c!@YBt;;6u@bMA|dA$
zUQy>9fFr2VqY__f;Voetae&aF5~ajPnz_?7SI|S+DRn@>h8q?a<q-f#5zWuE#H&+h
z$j*R&gj~wfaBQKIxmNt@YQ>ZXCvY#hP$dBm0HMw`ac<B{2rOHTvPLz)2oz!GLmSp<
zUTg(HLPSNNp5hWA7E%)qbcUD)RG3u??&89afoly}P`wp5Jg75=)X^Xm>E>Edhs5Wh
zlh_j}T0T*Yx^a{))SLiYV^X<-tU6{~cd#}o94A*mtOGBB{BP(dPEt~!95V$xXV{CH
z>q3=Xm!t<~zhVs#QDXhYBt4*-9ikUfsv0gFcjB~~)j_5s(fKxF43TJBsTfLu2I#Rf
z9|#rU!pPGsFyTez2_!ze_P~~P$fCIpM<nho%s22o(bLN-5wq@~%qE%2NiLXRD#d*Q
zqypdTpc`cRW~~-R?I1yLfCD(UsH)Xa;}Rylm@-jP+|5WRs8XIg$463Yf)&Zy9Z--u
zhRGAfP-z}HsXuk<WC=o_8sadEXen_Y572a|GOg9wR+lc<h~x*9XA;Tfv?`)|EK#Z@
zm|D?ZfiSr+f>D)Ys^uuD)QldKUNY^J=8QypoNGQOv&2(Q+9*7-NW5W9!UeA69>`q)
z1kPt(DG4MTNnoF#yK$?8B1pKZAz({AqX^zTT2p40Qpuv?n#8e$Zer!93hx|HEOk!m
zF*<naQYOHukknXJ`X;G!4!~Imm{Dt)lQ_^u$39^|^{$Zrp!@<3cBvJQa;womjkpK{
zLqXMJpyBW!Y1^f|mwGf5iYJFIIL6-~9E0AY(F7Uw?ZjiTz~GRVZ>>;I9ibbbuRE>L
z4u*j=6Bi;O`b=b}({)xv=msP<#NRahL;8k8wexOBGT;NHCJc8jw1ql|G}A2Hx^kMi
z=9-~YLE}zVM9k}GuwGcsI4A)HJKU>cedWEWLIL?lmASK<unT;Zko|#=a53Rj>x5OU
z2GQ7%F=Zl!bd|_atwis+*C$D_$AwH>qESA;xN)G1)oKN`MkQTPo*Xqm6h)z4+oFqS
zHx$A+usPWbJnG0g6yS(MS#gij*_hcxR#i^YiR#RxtU2d*L;vB{C0U_$699rud6MCb
zMg(}NTxup1eosOPO%>xf(7loM2hJ2a<=O*9tU_*~av8NU2Ck`tV~O85)U+;$GmSE$
zO<-6_KF+%=x@;>Y63LYG4z?PH_|WX~7Ggu_4~nj9oN1)xSe5h;_oUA^CHaI?2pS^X
zYPCatr<$!*sUx=`uhb`3Vp&jW0WU17c=U$iXYA;S%sP9+O*gRnPWiQzd<@Udu-`hx
zn$=3+OMa_^r2x6DHG{QQVsYn;gHB4sJ9H5#a9XEeK)5GcIM>SAsb;}B1*4(_1sP@l
zZM)q0Ua1-fIUpbf=yt2<YDZO|b8xo+aZ4TG07!ts$#F=5)Q;zyrYBLp7N&L8IGuY;
zC%T0Fq)?Bx*ST;gmzrOntJlzFCBth_DV-3Zbv$~*nrt<BU9)C!fTS+igpVsV_O4pN
zMs6viSW&&9!yW<l?_7ThLZF~00Q<77qMS@h^(g@$rY2Y6!**~hYH$eafXdrZ!^@P1
zsl)Y;52y9pw4){%iwK-2j1i8ChlvC3jxA4!HxkHbbyDiEXaWzh@QBt-=wq&tHU%Tp
z?w~?v&y>(w^ZCnq$fZ?4B@sPBST%ihY2g}atsu#SrN3yi=!#HGWq~nFd_rqZ#HFm{
zKAbd$X{;Q?4Zk1<CI>CVkS=8cetu#csn!$39TtT-egv4Guzs-YoPyEPH|iVVd8@Se
z=^*e5O=l<Cq|mVuHw);DMnghrt~n+Vi3;*OQ_8Pa3jvNuA3%WN^B}3BBiCvWL3l+d
zzz4#CL{XPCRIA4o@JOlw!6t@C5;E14X_CDINY6!$2(S`h#`*`o7vllYy_H6VgiAN~
zsV=ZA=M;3W)JcR_aWKRP<pGTbRShK2`(9HL5Hl)~1H8%W$n&Js61aSnSrOsn;-;9@
zZKGJsmdIE{#!;THEfm~DRqfOZJV>qJumX0;YIcA+C9H#DNnWi5VB*l4t>NY1G$XUC
z&Yek%`P--iqtWso5iU#MCsnhMe1jT((HLw3JWm;B96C8%w(bm2oU;;}H1x&s;iZ~E
z-vJd$6=m7Dpao?*sQ^$F3Wjn3pIj-DS$QQ|BY=5lh-oo&&6cl?6e7CEAZ-QEMJXtR
zuSe=Y<)r8bnfR1!fnjmMbwq3yUmgSyj*JS09F9ONH!BC^V#1kaLsGGmaHjLU78I-K
zR9;l7@5F-&5?-VbXy06k99=vB1R<b0Fb660u@MGFTrLN7phRMsqXr3ONK?>eR0A`b
zo-p02e5Bw9m20<ls#>O5{;ZN5Zz&F!VI-;3*l<W8oA6Zl5J^ES8FU;@2~TWCX$8D#
zDPb?=ta26=U_06MCEj3i_9LRP(vUn3WTHY8OmXpUf|R^8(Gv`(LBpdk3U&7&ZXrL`
z`^*(NfY*b}6Gb;g=mtqRTGCq1ZoK+g=S7hGO{A$*CZW!u+NpXB2^0)HEkf3zA|Tzx
zV_Rw@SC#Q-WKw#dQ7Q}y3;Vnda&I+s+A9AiiK)&TN_4JdoWSsvBi<S13n2$RSFXZn
zh#_V;5M{5TpkR8%HA#tN+-mqWa8bIPOs(_VDe!}$ORdk6M8iNkg+!77aAe;DuGpaq
zqjCZ>artivsiInjPt+PMsTfi1R6}XO?4x-TLh_JOipc;`pgecexfqq`_T-q8jF+i<
zpmZLL61ooXbW}Q4zgu+uQK_khUeZF6&Z$G*q}Jcn+Kw2Z@!j%HtF%y~vC+y|&VXh=
z)yid!#}TPG>;PpYuL@<T*Md*ZtEPt`fftx=irnRQGf@g|Q*S6(T8|AS?Fy<33VV^e
z9O-J<RD^I9rbH0VNoCbpY6=OFi&{HAJnG&RO3PXjYQrXv)7=5?6w9E~R8U9lNC|Zi
zrK!3kkR_Q@XHxQ1l&7XLM^iLuwLS)=5rLzEDT;@%k;^FN5$F<0(oqW{R!m|IDO8y9
zj==|qnHC!(Js<UOm;gc~C`Pqb9jV)q>#u|UkFB9~D!r<vvXEH5oI7Nd`^XBK1%z6y
z+4y*NhuhSl&{YamCXC`dz4A?~fP3{X69;m+4|!+Rd5pKKbeT<5uY`e*V_FTa$U6f!
z0jyl)+5rslX>(AkU{aSrR8t5podK=H#6VX&^+!h}YC?iE1xX>WR@y&Dw8aY$YtqUv
z<e>OuW~>14Hmds;ks>hRb->=jYJ~II<q2z^1o+vSGeE2QL`bQYe}fTQafo^9_!N|M
zrBf%J=6$(ra)_4-N^-#*jY;XO4mEuM0^;}~p*&JdP)D^>M`Wj@DXr%m=-9ZBhh^%X
z^;k7ZG34+iXmP-%7==huf)#`<sjo`pV-N~FA9rk}%ra%?kl&PREY-|v0D;zdjCCM9
z6hw;=M^=IZd7@V#!j%qO#cWLFEcJ+0Bdj9x-uZ$wfkBA~2&)ptjx>5yf2kn(*YZ$R
z?%XWsp0IsURtXKT=v>sOBB~4O14ENCJI)Y;ki8{YB2#=u?nV+psKqBhw>Hl1hFQG?
z-<boCYp5#ds0t{9id-NcAvc1zK`((Yhiq#q&Ej5nCM^k4nvu}raBDnLrzHxG4M`#-
zu!HCgB}q~%@MJC3Jz593q4o=JS7_lQJtK#aBm}PBVU8CnxVykLSU5-tv_uFs&z+|i
z2R6!NOF^2t@ILc~tXr}+Q-&M(Z#?ovEaNoO925c*j<ynR3Q!7~S_Gq$<L83oLm`13
z;F!+mo8l?Q@u9AJ?8!mk0iA>gACsyx)J5zh)wnP`RaGL46~jM73^Nj!l)A639L<nI
zsFc`&qPEbb#WR4!W1wCHiwVbi+7ki^IBoE9!4w_w$_YvGIGZ8aBuL`OP4&FQB1N<1
zn2Ro3N+y=%E~cPUNP=~mIdLYk6o3oikBRdJD3`oaO-n=1$=qp*XI`uD@<`>McH1<E
z1W+vwElcLoRFx{Ifa+6(31C8pXsooZJQ!$@l8r;`Ljn$vC{-3giiJ77Bn6YjY6P*F
zd*?Sr>^aqQKnd#mk3u0QQGv2kL<``+c8CuxhKDHzXE2P<QM_VQ6L+c9gH}6wD2Q{i
zOv%D<5EnR0hc#INg-n&137x-mKoLeki(I7!<0<0#hQE-C<rE*H{<SaQKv^Ivl~EZ?
zlY8US@N!Z&0KAlPP(%eIfoUD&JTbsd(JT>`(h<)~H7^>Px5BgBkaA|>vVsiXCX3Di
z!fuV~yg&~dmx7xBv4W`#+#WO~5#lEO?=l4sbM|z^LEN!OA}Tg?rR->V>Da(H(})ei
zJPttG87t_~C0-O5$Os3-P7;GeC~y#HEY1<iCml*a1;Z717gW4qO`;i+X^nG|GM{b-
z5YI03aV`ArZKUEMaE-dFFrTc`G$0p!fIkI6kLV-6#@VJgt}(XY`>Q?hn3I+)F9msL
ztxAkIZ}352%~J>uat@d7i1C1#0<sZWb64g=nT#lGp~g<?SvN`z-xF6M(+G7rLO0N3
zQlc)j3+%{wo<P?_WQgp-&WscjxJi}Xi6CN5xZj!UEomxRyrx#KLp-~aPGQcfy<)6a
zj@%Ti5JkbMwWetmF(5;k2ymWCM5i*{aS(T$iO94RkYOG*bJ7kKG>Rr?`4(|a%1i-1
zDG24aNVrIB*Kl%`TGzB8@LfCcs^eO#iCSrC(TFibrJ(A74W^bTi_=X?Vrs<#DX;7(
zCUEC4%nh{{HH+0Lh9G7rBB&iysP`~$sZxXyouWp4+cn;#%^J1+S}O}1Rc!KcI5VmE
z2b&UEu<mIZ{v=|CW5LvcFmE{abOE5sk$V<}x#rGLG66(6IU|w5M{~>Zwc%b;Q_|5^
zlIKDlD6sm(^&QF<R3b#Bg(|S6165OB3KC>;j7j?7oO9<}haQ3B93siiyT{0gz#5=x
z0q{PDvSk&cxQb?EwW6FIK!};#=#s#IQUye7kpmBX0c!+2UVJxb{7866!6Bv0dUV->
z398joMU=c8F&-C6CRG9jE^>wS4<d-nEIq@hvjqG&3iDj!Dhd!IUClxay)3~;Q7Bwl
z{rE1^g25tE*49e6-lWbuLv@lutGsd`OK&}Prc0H?7KR_l5h5=(Arpj*W|`LkZ#^7~
zIO7!7O<D6ci)Xj`qdFxn#Z6ro9tbHb3)6y}4id&(Y>@#09>S4N>2RN<*HX|G?UrGw
ziF`yx5iMGs0nbf!3p=Nd1uHrzNC2yrY4ob$S=0hpnI>;gEYBIx1&3H=3#6*@NPnn7
zT~X~?+-JOlH&(2q2nYsZ;SlW&9t;A3>Shp0NZ`*MR0K`P3eUCNIczJ@r;zKauPMuf
z7ru7(n^LbT&3{`eRerSc36-XVq&w6jP#Vte){!VkO(6nPr0!{*`pa5)Fvw;Gm488v
zuAQH@wogvBe_B<e3mR@YH=slj{hb7rxKD`{Xh0bEfM{}^vyHIO*&M14<S@9De&+xX
zX_TZNl&~`dNO`Jo>9)BtwMDEHN1vjPv6s<^9q_f)aFQk(!c|o@u|`*J30c?;@YJ=A
z%r?>Uf;7a2=#cWc4f9=K=98E~*uKdd2YP~=A1Zm!RGPgwBra;{*G^f8P|mSDT#{JV
zn3+X33~5?%BuP$(af#v;=mV9LL0~zN;&|LLt-Kn|eAtI@c__~~Ip+?$fqkzEtjaG=
z_(9@PhYPd|CB#T#bx@rO-ISmZ3KX?@;=5TE4t11pE@O?kgd8pEW!dB+T`5L1NIXs3
z;|Ba~>e`K>OV0F6xfmMQ@W2l^8H9@(Lz=TXb0wk>lw{PX4oEJTt36XFPX{cjWJ*I3
z;sS7FLn$@@hy$Y3aTRF(DQUgXok6DJJRi94;EWU-zta@17~85T*aU{DLpD{u$^pct
zkf<<6C_z!0D^I!BRBKoZrFVyxtpeM~3WT4Sif+SF)>;F+IhbCp!4{V?fc-`@1qtI+
zRn#!p76=h}5;QYuojKp1*k~A3YAciE7OfRHZ>*FXjv!!D4m?AAmXcLUG9;@cqF_X-
z!VaJbKt&s<?fX+$vzx(&>)xt-9uGd~MiZP#(#?IL72dTX)K?mQwa&ejNrfVHnh_;0
zya=Ka1de(998elWP8XaEy6<tfwZH^iezBMUxZ+hGf?zskdnx%dB^t;>C*&QWIvJ#{
z<dx(~lT#a!yFIO?1RD4apdjR;yYNGyj(#Q11+Rl96(yH4#Zz>Obe7x`s~I<4&5l>B
zNg65raeIR&&&iq9nRQ$R_@X<453(!qEIJT91)8bO$NsMI)VbXabs=7sj9QFJ$u{in
zLdp8rPn~98yORn&GuS1_N~w%(a@gG@+kwre2ow~qF;32>T76Gz2-k3!L^B_3m4Y5x
zJz-J@`2c@Kfkr@lg!$8GWrBQA#u<Dw<YM@ocar5y4}k0yKi+T#G-^SDV*nls$Fei2
z*h;WI$_$XbA7Qo`^NfJi;uH*u1L7ge;g)IjD8suGqZS&ntBLgEaqpr+31KSrc@!n1
zEFdvcn-pjxo2#{mROX#QFzAs}ih4^(A=*ZyPU0-AG!q)^mLo7BaUL^9>swPk$iX7W
zC#@8o!I_%HA~LE4gBoM8YI*4<iXe0+GPxSHJL<|Yk&u^+#05VL=*eO4c~4OCo%-mM
zS<N}|NTwhxgZYNu8PV{J6dALn=7&<q$9cayYJjGuMSum10Rb&HqMZ1YysTPJb7N&w
zRW(%lnV2Nj5(NVn1d|>E=_@DV79p1try?42^hFQ^E8!E;=qa1e$6JBhX>u{<f9GnL
zP^YXU3rt>-;yH~Iuf&Aaj}7dd{P*aKsMLd{9?e?w0$uG;(3B8?A)1tazy;tssIu@x
zVu)!S2<IVI|6T{uS?eD8iePN0R!uRmAf6pZ6mn`7k#1K)z1I2&Xsr}(6tn=Jl6m$w
zG-V>z5LjhkU81tg8UcTT14JncJh7URALhXKD#f_P-Hk(9rE(U?qn%^9(Ar&C1G&Dx
z%Zeoffl4E=tN?5tRfQ}ehF73@hD#`t5LcMNsKYJT6tYqs^qX`#2w2Q_(^k<P3V|vS
z4=t_JL5bokZ)B)vR9BZNr>JwRP?RaH4s2|Ada2XrPgA&nNl>X3rykL{B%)Rztk9nz
zR`kN0&5gSgfy_f4=QL<`l0Yj(m1d5QEn!NP4w7Io&hI#HxbtC~0Y0iJtPWEOqMoz|
zDD%*J-Mp2`9<3gFVr?SMoz5lagVs$YwyLSk@mQ=&O%M@r2svow*o5T;Q1oR?K%Y?7
zz=vrY1#>8@ors?Yn&Wg$6-G<>jVz6cRE;|QU{1spO|1`Sb%3cZ;S$vnQ}Emm8;2c3
z8jLEGNHJf9RWZ!G05k{iW)1HK*^5>jB*aydo92h4Fzb^*6V6LlVOA6EQVk4%CUnNB
zWvXD7;z7u=D1uN%)H4H2o6Ve!QVG#Y8?A0aEGLh}NHh_Xpalg4;av5_NN_k&YmWRS
z@G#MQ$k{Yl*2K$Ftt;e4QWN@tH*|_(jT;BkUKU%XMeLwZ_nNtur=S!AL?E?83uYQB
zf~k~rW++jeMMc$R2*$}=Y8Cb2!nEY{!cCzyff}EqRFP^9bb<2}zk9@R!;aJ_*(DKq
ziV!#tF&wpQROXtj$Kl<usK90ed!qVuSNSRjoB*2MM_|6mBEK)3M&x&<N{GagPkkUK
z#lhY|FbyB9qdX?q0#O034b9qd&LBl};q4;MNtTjNM*x|`CM2NQbe>BUJ-Jp=@D$La
zPfNymM{EtQqne|`lg2gV@DX1jhaP?qpQQ(*1tDJio2@JF2$M&Ja)SEQ!Hp7W@2SeF
z0-KYi(KFRO4SFTzD<J2r_31y@{7Qh4akgcJ^Tvr>RAdJAw#XaFBfuon!gaXZO5|4M
ziD$_8(*Oz;RW&x@O2ulO0LpSO9&POsyeoK6aDij3z`GbZlt3usjYTsg%IFhLAqgy~
zw8D51>U3qNOC~Gh{6fp?Jm`rNBhx5ar>^We+HdgNwz#r040keZom&kL5%H%If_3Hc
zjxNIv`U5H><}i-<Og1h1h_g_6;oz@}us<^C)U}GsGxb&KG#dq3OlE##n=*QyaM(bF
z3C9MBxGqr`l3~!O@)&~Uv4VrKzm<iOJ5*K*F5X6RG>H5r)6(E+L{q4qORPApbxd<-
zcPF)`DT8@bvhL1l<{VID^Fpi%QHzg}fFx2~SQA^yJi?<>ErW|PR<J@kN4=Ek`XT?K
zFc(uE-D3nZ(9<-74{{5a#XzYZ2y0W#0Me>9gLuVNqopSyOlDI$b*55P5`P@AVNd$a
zF_jyOA;8(La3ZK6XN%x$-WWknJm08rpg;r|)>~qhPBE-iWx|;bodmKdPPfL;AQ$7D
z!f6#n5K4Jwg;pyiiH~{-;9Sj|M8*RZa6?jKAV8d30FcgHQYPkX4zFOHnybtE+C|Mo
z2_s9U!gP(%Ce6lgAW0)PKePHWz0TFBr`amm5Ymj~W3{qFQx=$LfpRK%$A{9{vK?7Q
zuBJJ-bfsV*!;@+fK8=L+S}TSYU?#~4gDhzfyo6*_q4utbL}3{fP6b&Da3{L-*31|{
z&`?REY8+h(p?EY2z-rJm<e76tP{@hUU9CX#(kCuz^<{FE0q6mijyjj|LMvZWsx0ts
zm9$_vsTl<89Z7etJ`2UB3_jnHpXtx;R@1+Ug|%qfF0=w%K+CzR+mHZ7)Jw<=f^Y+=
zP2jt77;ZRfP&0{lLn7$F*m!z~V?wZsqtwBW$e2zk<3Q<3Om-JqfjUfyUO?7qWhV!E
zs^GX`A!kJGeMvS^6AA5NEyLH5I@Ug_7j%kqER=*Pbu}pQ4x|PI0~?A$5sgeJ5edrF
z%4On7<Fo)HG;I_B0<q~*cQY**!nx5ZrHxyYT7E?-v2ZAM#?{ux1K=a)NNF22rai!f
z(+ehl&^-#ace*mnbf9Ks1*UKWxq}L~k)BZmCsBxFY)dUIs?(vNj_Ncf9SDA$4JE)Q
ziYLTvN(s_N^N5Kh=gxe{APFX889^?>DfIvoq&`kdrMFi``ly${iA8!PUh@j)PJ~6k
zAzV`0wbQ<&4!@UcT_T>T)f$R+fHdM!(DXgrwK%yP^%AEnYZZ@=#%6NIUr&+kOcO}(
zP38V+pgq_-Ago%gZx*#zAS;y?!-ZwD990*r;ASAgj<*GZVplzvfEF1aok8>+<Rek;
zxfVWsU|?PDBA{BHo3j=|^rpy1!6wu@WpSr$dlB~=2q|p)4)c_~<4ad2Sizk(id#|E
zc~r59Cb9XUN>$n>S3(0eHj3`TBSuP9bVp~1EBrcG=2UZYs54Y-v|+3K-54c)n1E8<
z11Rj!L>0BK&r&JyJ5>UZu1%u>ohhlB!m~T+W<IJzOv*CPAPP$@T*vxQDyswVH8iZk
zhoI%~0SvEW4^q8y+N&H5iqX?~2QlbK_DS<luQ(?#E@_8vpx`kfRp1#AV0$<Va2%5F
zDZ>Cau&Z*w@rF;A1&A#4nQZ7Wt@`!xBh^Z{)5ki1zM$OUszz1v78P1ps-+<{B|D2J
zjtGQ;TstK+(m+qVEmMXMLPWUtGsm__75Y|9yPRzL+^cG-(sk5IjtgO`%lK_Av`KmB
zM!{YV9GVqc)n4mrC_REBp3$-;wPk*jD&`1Gs?0JnbJgs-u8XCH5@=(o&xbM(%F3}(
z5lz9y$EDtJ07e=&xR4<3)dKdI#lEIOr@?8>o5Qo_2+c{4&y{Bc_dlLscXX5%NyY+I
zKcp)Y*kKoES|1C%Vd;2c8+bQz>?xSXnkEMGVdSnfh7JWc>&WR`XwKS@A|XL`Mf4Jp
zSxP#g+ogrk(Dn1CI|rDRl2DcrQ;L{jJn)2(c3P&nceN9H0;R4%P^8Y#N&K{0L`~~Y
zq?M;lR7@OLJY0?>*Tk4G{yQsSuQd%DUs(!a*Oux5hrq;H`6UJe1w;`sRDW=eeMq^K
zH(U9!OG`xRJ@loX&{X)Qu83#rPzZ63>IjQcVW~l3O#;(u*~O%EvYtK74QUvS5(iV2
zppDF}kYte%sPMQ{gU8+($MqoFiG<csauGn+LPQ#_heOO+R6sJCOzGP=xv7gWC{IeK
zQDut8Cbr}V@k;z~=AWnX46uUXwwiQfJk0=daNW9SAN-`me<05V5bRukx)Mqy$Dk@w
z?G$?K9vo&kQF0|HkJch*x~#l3(?U4#v$}&yE8asg%v-dMI21-ZRa+Hp2g=it#<iL|
z179$8asYisfya6xkPK2uiM--%WJOfUX->o(ro-XgpnxIWKubZ9gz5QeF#0&z(P~JT
zibf_Lcu=Ea^KwvEo|&9Zw3`19#>cx^$bO^dNs*)PV>fzmsKy2rHH5>w@^oP2;jvEn
zmlBAMR;nU<68nOpyX2HdpSh+$!-x&<J(Wj24L4f}B43JDk<A$uj0R&6?h<_Ztp#xV
z+wd9JEGua33ED)j8kGpCIHln5!q@21+7u)#wwh(7RS2RNTT9uN8hi(Z+<48LbjD73
z$Dk{5rG^Sv6fr@enxGVJ>GvBD9sQVKY!OpHq3~%4YZF){(YecgNHWtbfA%g|g;?t;
zQ|psrjHG1(`*P{zIC->kA8upRJQt;fMuiM&ptL1eXb*y^aHyjk7K+h}JbJ39Q|U+^
zOD35^v*0gb_^DY9VvqxJxQ$x2>Z#Ib-YCBqlKj>f3>bpCZJgCXm5f$vx016qLc=#o
zFeJ-VEFAS2#v#ECujteiOUvUff!d_%W+2>wmp+D)ac{R)2)!as(76(bDg2RezvWtW
zo1$#di>=;!P`cC_D_n6q&NL`8poAwZ<18xU%+|04)qF^LbVr90CE!F-CetD&cqht(
zf?Cu<M5losrv;HCoWWVFC5gIm^;|o>h<-MybLwygbZ|P<cv3QT1xMux(mM)RVYA{v
zcKRf_<O=w}`X&j&5m447%)x$7K)<T}QYO6;p@*xwp~&bkk~m6?L<L9z$An{$0hB@(
zkK(4u*NM~=rCKDJR{mz!d5(AG0nfEo7=fNTx;1M>Ot)$rXk95+381F<1W+fc4QFcS
zMXwtEN$L>i0DW>_y0TQ-N?dWB9%gN1St-DtBNj@f|AA=9ZBy733X%d5<+(d?H1i@;
zf)$8Qs}WCZtL1vNq6oEvJ=Iysssi+ltOG>gXxwTo-T<P4%4S*aasoS0BrUNaMk@Ci
z_Go{sRvd@Q$QeC`8nlCrM1@I}kHjmP+nO<@i21UKuoMC&d1|8Gyq})^4X&gHZU+bf
zDkn=sJIx7l5EUc6)Nv>g8NtzvF<up#AL#0$Qr<+dSIRNqY8fUa`k5x%A@fB%Ij>r+
znSZ#xT4nwBYcewy0J7Ez=2T5w$^|}G^m2|A3`S>U*2-VN8Ubly-uqs|W6^b5;i`qR
z(1pqI7*paIKT2*nn^AksG!?HxK!IIxtVU{DP;UW`N};S(!^Y{f_J;B`HO3C<Y*UT|
z$gP0R6nPr$Zt5<Rxl$<aYf*Ym7Xmbj>MN8qEHB+@s<jPBLuCd)Q@Y5CQpJPw($p3|
z0iy2#Q(;M~3)@p3H&6m&hP7JTxvJuAio+HWVwr#Fnr`EeB?u=AJPxY6#8M1EB&nQR
zkX{BEhI4$t_Dk%9+zm@G7_1HrWz=eLYY7f#QBkW0C{CvsdWw}s^C46Bu4*R$Fgkae
z!m9At!avB`@+2QBBuMXu@fAzYtw|-;g+YL`JB|GHqGBtm1giqRGDgVz6rk-c74S%6
zR0P4G`;gT|O-@94>gwviiGt`N)Bv4L?dtt01^~Z)p+%<~=h#m=^+y4iM~!Q$Xa{J3
zjQURy6T%7Wpc}-JH4#G-9B}c+Bxp`3it&)!2M3wwVc?wP(4+FY?2XFN0s{pih7TEI
zrqM*_93ZGyf%QaUv|Z_Z=B7K7?62(du7-(H;t=_jrDuibBY27UnzFnrJ71Rj%2Gga
zkV+-+3uHsI7Bzu^a;W$>VLJ0fhVbN3;hy*|BEos-wWu7PE;!;k4_?B{*eHb?*#ShO
zBCi+30f08}kHZ?_P)MCR=83{m2DB*Z=nGN<fFKWp1$5oH$EZbDD4{Fmi^+9}IJ{0X
zo@!;XuAy~xE?cIt(yU)K!8=DyA!2~?I2!oE&(-;mWT!?oJfAR5wGLqgE-ce(DY}Pz
z=@XdnVD^IZMQe(<Vv^+FQJT2L>7JIkgQt`EfF&-Pi^2dL#0@1<6G_x-!e(@|z!fJ6
zP})>I9Fa{p!Jp18jTTsIyWHgjij*POjx=t?{I!nJ0(Xe!;Whvr>eOL+@j2lc*IM-I
z+Z}EzK;l%TqCS9=w_a5f^;L`RkQa-R>o{=RRNXu{#?>?8aOSO&DncEC`WkW}!@DUP
z5@2WbRp*`%4~7@81F2<9HIY18%gs@nh+I!it8*$gS`*pBrPA%zhC%PGMX*;|1F8dS
z=rimUrLUfESZzS&xF8{k5^6kTn&RLT4D@uCWU9$X_==*Ri`q}M`tAt66Y6wM9XJEj
z7mW^4v<|7GRYO|M1d!*J9*0MnKw|m1YUL>D!@IT0iw#DJq8u7sbla315vpR5-lHW1
z1~~~^0+If@(;8o%Z<N3?WceBoh8r=u$3Wmvh#Th~uKm)jN$|4>Hua9-Dvq8fvd@v=
zu;^)k-o=DVD*=Tg3D*J0wCFEUm9f^sc4g}e3Ma5qG+J>3ii*;lB0&Uc6a-SUTqDVu
zql9Ft)Ol~=GI{Z+bLCn;PhA{<Sw|(=Qq2S5fvg1tOI#)BvTP`VAZ_g!WHeW&!SKh#
zM*_v_x#;UeGGIU;Fr;CSewEZp-~sy#Hdh^!*KvWNH7Vt;<~(|sGsj}5Ji}ytWpy+k
zDrJ7ov}S~I5V;{~RO6sf8sOK?5>vuRlI50LY13AbjV_%Wq#Ss0QmCyQ+8`%k!LLF2
z*YKYB#g(b5rj#|bm^ns^Oo<{}wH1}w(!~QZ*hi7|6mBs-u6R(vWCZ&HK3ILp%pDyB
zpD1LSY1*A*TSULllo1OjFx>c#v#iyUV4$Gk!NyfKXn3H6u=F+A4fw7@#?`3tDco@e
zp@~wN?1lhsK$5>w;pC7okhkgFEM(w-4A+{-rLV6Eni{7h`?n#9-aB<Da6l-GLi82;
z+ZTdvl`6GGD8sAjXo2Z{3k9DNZ?XnsWCaH?@2k$X&ei!yNcXO^EF~d*7J7^akeY`a
zhhq=Gk;6QpX=;sOvW)S=x;h^~Hc~Yyw3MN*`%SJKk_$p9EcVjnzX94p3N|<?!~}Az
z>!guuRz$8CfX>kX5aYl_!A_RrJ4>BkxzhrmX<ZogW|<97Ly0D4RFzsk9v`P;HL8sk
zyH?T=f>gth0D;uXQmt||)Va@n&_o_c^jfM=W)bz5fH|%;6A;o9@}!-HhelYbF2tL4
zF>8zX8!Nrjla?&QZls15nu^xpuxruY2N5KluC$mnaq<yXO%o}Udzg}imYO{r!dRTJ
zF&9ed++;2uAlsoK`rdZxfvJl)Zwc-U@`oWDpbC)3Vy8-k1fZ70%-re9i4xOU8Pm=X
z@9xN_%9bXiLcPpFkFrEjXayFpjfgw)bHedtK<DZV$fG5U*O)48_(`FE^klYpKnX8X
zgqDy-8%-m8?Ub9+x(S84DWWikP|j*F)S5RGB^SQhLiwFERj2XfEGZZ@O~b||iZ9t!
z@j+UIY6J?Ta<m(zQvBBBG}oO%u?A~VX%9uWP)O9+4#2}s#$QJT3m`tRb||c_a=;pX
zm!0EXwo2Ais$hoQCFYwFgN08--nPbX({-Mpi?dV#gtcz&BGO91EJ6IBQ)fCfv~ej@
z2D~NnNg4VYf<$rSaNZF@p!N#^H|L+k{L$)<xVm$<O{rszBGxDeC3%+a>;{DZjU)s_
z>S=d841tk?Ts_cSuAp$D8-ml1N+9Gj#5A6abClSW2FuWG95AZ^@Pi^(S?*bMv*1%G
zlwTYYmWm{GH<E~OvfyfEQFgc>jj*-K7DhT+<0{>-sTwT+rS=RgF`lB1W*W_P1MKWj
z5we3pE`W&d&>16>Bm`q%lt5jQCd`&}Cl2c-B?d$|fn5^4*t$q?MiD+`r^ilKwse?h
z*0duu*V=pd=#^hg2`A$2ZgtfGlvlast5XnsR&q@e$;x7s%2`p;h`JWMa!2Oku((=H
zTFF|4e^bTVD;Q9swA3;$IJk3HU63?ko>Z!eo>vYzfZ~y9h4Pe)HI&pCHOh=ppixFi
z>Z3SKK}+?J=&2=b9S5#1HK5^@Do7k8&aH{d$rxKmrmCWcKG!pha122|Vr9OL6;4!i
zLh_@j>g@0(2tW<hvr8MVPg-eH903%{EgM(s34a4VeT^XIgjHQ?nc}+uf`A|Buug^v
zs42OeYf_fMdtI2kL_cbj_6v+s>(b^pnSmAKb0QPf*F#cnpH^8@DJc@EU=pp;191j*
zk#wR)g=s4l;@G|Fjf{M3jmE9;lwdrJ(j6g@CD2V|NHZh`e@O!Ns|7PdW`KrLoby{<
zYK>;s;2Vh5b2BY*NHz!I!$z5fqs|2oUtR1#B}-I=VRsXfB-^}c6=mWPAB8S{<>2Ww
z$-~u;2AM$+j?JHIp0V>Ou>4WyAqaqMKN?~vaJc+2wGer=kJ18RC2ikuDXC+BgCiBI
z2ogF?s&iOuAS-AAq&#&>5fTGwxS+KX5`Mncm%mc}qn3~<Xg#p+v0g+D^EKdq$a-3f
z`$oH4sZW)Lu2YS9csB^5sA8q1NQzOgiHcWHOhA924aO6PN>rpgP?nm2LgDM`WSY~Y
zQXInL!Ue9?t%tUt;ZBkf-65<y00#khB39S1P0=6-Kau85oZq=3loK*jzZ>?0XQKiQ
zBo{+!OWd@`eO?F15y&7?MXAcX$4o*>vaqlKjMqy36GxKW4osDS!Q&E{e=NNpmU$)P
z8S#yhj7A_CMjoxB9E%b*N=2gHC<V1-4m*Pap@q6-&QXM#s9*s7Au+wxT1upGdw)r*
zoQj&Q14Cu&h6HRyK}s*&oK@*^paG33A1|yeg*F;PB+AR8MMdCJbya-GCNJ1F8p<b)
zEq6{G!fPn`%F<8%le2M3<tU+$Dz;|oDyDGUz%x$)U@U2$ewAvv1hxoiU8KiFg&rHF
zP{slE{yQc~d{iB;odeD49Kgq7ji}!hlv*g9PM;*NDJT3(?1(5=1f6NIW}pKNi>Y$~
z(1fz@g~scYy;+9bQNch3K^7|nKKKC~27?S>tZon-rB-<yhJ;{{#+cDox-NH;E9Hn%
z#zj%mV33V;m#XZ7R{>rH{j`JLtD~y5GO;iwxH`m%*0Sle07qFWb8{50WHFMX*D1hN
z4pf&k1ltc#OsHGRx^#L8js^}s<yxsUE!cTyYGoj%Ehv7x8cI~9R(vH1Z`jO(oGeRC
z9U(VaxuV=iQldkBosCvvsOm`Jga4X1E!j<4`q-m2sdJ$@z3fHG9LBQK1^Wzf$BpPL
zPQ0SQC=DIe4(h^@G`30;22%vEC}6Wr;2~mAYg>>f85APJkSGZ|Ov5B^$ewiK6{2t8
znp8SO?J7Fw`UCDL(i|^VtNBzej8JQ$J9HxeSi6|nR2VFYDT2=?uN*9eSiNeDKoW9g
z0E%Zfz)313S&e{vR8W|J5sJCivZBuTa9fAJ4R~Bb%%ZHF-Hq+TY{Ax}==veoh}7>~
zp-Ea`4{7B254AizMdzSAho2@!jkF|kp(S@p$dDX%M!C!p8x0=9B4+L;@Gc;?=m|_X
z<%q<J5}SqMKx+*hJ4Sh}L)Dn$58z7UZd0|IQce&-wJu5vJspNW86%}~)q9S>7Jq@#
zj4A7L41j_b&|onW-G;QkewApFFf&(bL9Q<POA!4T;gJ?pQC&FJjRaFE(~_isPPKw)
zRA&HQHCmkpUa;1kZ+IOwNdt1_LMvDfJ0R7n8zk|i8r5*g%<=|g-IP{cgEGqwnn>+2
zz(E{sS`;(xH--@4j7EhrKW|i2ERBB^FbvRG=ZwQZCgx4W1q{Pz_7Of~1wg?_X|vIO
zv(P(fSRJH`apP#fI@bt}R&R23tkAGgy)7*hP<SNkU`k42D!|RL(Hsayli@Q3HbSFP
zIvALuLr^j(sYq<y(*kQYN}+NOoK%FkDR&{RAo#vZEeq>PS0Y{r@+$(_^HyehK*6cq
zX(f=x`CifEGv&)Elz%33ieV9g!8IjcjIlN@WmtHa7b?<FX)^9^`9Q-JV4KQ9Pu$o^
zc~gKo<o6-GT<sZVi{b`K90*$2r6^(WkvfmNN3lE+r+~$*rQ@lc3*mX?Bbl%lqNsLi
z7#5NCzBa1kO3UyyYSTvrL#yQFxamkd!1Xz7Q<XrdEe++fEYG>Wt;jWiUuwp+`r@N7
zM;hY201pqM%4gf<7=9E2Ag!osqFz#HU5!lHz5ugUju@Mv1FPK;MThGwrh}-N)o5Ng
z0FJiE{o+DGYEm^ZHoOaira<)}kgJd{DWJtwPV5v_oq>D<ycZ8)Dzhj}38{aLf>d2l
zzU3^XRs()|TqnL94@L^-8^(U;iY3E<L*$cM1eMl7bI!O<wf}|_1uA+^K&jOj!A`^P
z4mqDo2?Wc9Pn@Fz=YQ*^GK5owBHl^puN*wR)-(VvsFlgb6Pjm~ye}1ZNtt^s9n$NQ
zqIoL4Iz{$~d%HE+YV?zY9NJ8y{g&XM!y`~o1u@kk@J@RLBd+{BR`WKN<<vTpjdJ#5
z(dWKaFQb^|T2}`jM(J{(AtQvIhl7Beh}tPn_+(m5g62rU4;vR3^|?_<0Hu&N>VU_E
zf+V03qOL_#x<qaGkMQrc1Pf7Mo%UK8FS9HprARBXSf>%IEhPyCf=sQW=JVe=O-Uo@
z1e`I8MkXv(WKX9`#(-tyOe5-j!{<N^EI{RvWQ8Ku<l}>TpxATaYlo7isebgvsE{I@
z2ycI@)!1;0Q!mXWXh6M3agZD>n^B7)60O74DiTTcF;^20Dsp(-L5>o4ai=M$+yVzg
zp><l)taNCWs<b>vjw)G!g|9_lYVs>|V3eJzU4nhtX?0M=UP+Itx{f#nE!_x>et};U
zt<f1Ps49h)0?E`59B*q$wrjL_SxUm1FIPaogrIe)nEcA6sRF;|+@pd+r>CEDwWDNG
z8w!AHt6A}bhR1%cE3FR*VmoshUc#{q4>8I&TO<M@MG}^oX2L7|dXvX^ccKMMw8jR(
zIglR_2F6$cM^-vp^7DOtmJXUK-o9fwWszu$^RUneGWBIq?LC1EXfMi=L!L->fg{FN
zw}vLNU`A%nG$Q>Ly9Xzq@)Nu01KqHaMk43&EjTJ3t!`sE&`N3)cYtz~*5IQFB#=Pq
z0IXD@7V9WiG8^!OF>uX5QK}x;C`7EDb-mCkAW&^lKDcnDz1WDdR48qkDjvycK@gU(
zZ(&VIF_B^#51(b&XDA+8lE^t4HBm}4k)Z08T^xbOAZ}oEz$489b4jrP{ph5+QplZ)
zN$7Z_v}TI3a{*3v`Xs=T6#QYPJY-!|)s!Si3q~q+LN?;mA(}zV4&AlPd<0sn@siX}
zh_RsBhqF3xICPq8j!A`J8_odIQ2+>Nc_^S*o_~^@Qpn+qrYm=O9r(&fN2n{U_ul$K
znTi}UQyxP6E+VWrPE_><AJAw8`H^^Kn8EP_Hmsr-TRH7ACDz3=QjEx>iF^{~2Zw=T
z9Lw>Ph0@#98kxp0cc=&$vk27!+Jwfgj6Q{=)!bGR$qOx=>e9jiDW{leMXOwAse=<?
z|3FHFQ&wrj+ytQ4s)G_%e|A8OEouT4adpg@)Jg&N+Z5(mQtai`l}9o{fh)s<Q;W@b
zNOKpGBr6U=5Lgo+n22sofGi3r)-t%vhKoQ`NUKr?#5yx7#$mcinkK<S)QL=kvd&+k
zxG)$_iMK+Z<zUVbMPOO57pPz7;0;>ql2Z<MQR%?&<ae`ml$8xGTW`{G9%8qF`5?IN
zn8|T$QP)+|uF+%Nkf>ITy47+Ekc8;iuhsvqxH#CC3Kv_%Essk*_#m-#2Js3#I_~dE
z&z!V!&<$8k0q7DPf!Vx_m|n<i)zJ)uo7%0OWFO;zlHkB=bRgr2Q>V2S?#@w~Q9GTS
zL`xtygSwuTW)w%)pQ<_;SRqzW=VHR7&%m4v4FyT`jq~&ZdTt4?C{C#;-E=o(s-fqD
z^CGAd0ppOw<O+2pb%_(prSX8WfGdf{ID?}Li3qe+6IL|}2b*(#Yl&8N2Qg@B!3`4t
zDL@4nM9&Xm)$t6_P>pi8fH8)aHu~^bCkPa33S+mrm@uwC>I354m$NjDZcP{wG6?%h
z!u`~n7?B5%QVRW})~JlZT@Z-?SZk{TuQ_*7GuQkOavBS*RaM2Bc%_yXRvt-(-?z?w
z)54|b*Otaco$_HwaE%#PH3>|{)Yf;hRF)f(n9wWh$UTOm(L66ufkCn72(Izp!FE9g
zIK}GX?&eg-4hWpHEJ;sQ04%FeRfh#zMx__tgO>0Qm3%RiN3~}PLensZz+u;Ru4of!
zVJW9xNi`2jUc{xG;DW|L1q{<<k+d%%YTX)gR3kYaz9*VLlua4Ntk%nnTu6jJZ~-W*
zATdIR_|WWIIO;Iglw~{`D;Wk6NffvMlo`Q2jU#~EQL4Y82u7?Le0M1Bm@|+LR^DL+
z_c_zrDU7g-NqVT{@Yaz8!=ci;${X1Il~zSWN>ZUc9#n*Mp-<C!AlJ}!Qg<%UL*Q+2
z_P8*)Y8PPY;27*Y=uAm_Z~_y;#mD4}%Gat&)`p&Lau<QF$VvtyqFLiW2O^m;rZ`16
zG;2VKx}z{}$Ua2j64M80Y(&|DnI`+0Gar9q?(%W4-ocG2Jsk&3#4BsvZjBgMN_5(I
z8wZ*%f^VhSNB-U5<->tYG+2?4F0+Z}s8y$BX3941ZuQmV5Moti_hugEjA2|V#)Kp-
z)Dw4_Dx?)tndAtoRW%&>Kt2lcy`b*P9I73FPO99#&{E*D^TmIZb*-i#U0ny>&G2p%
z`XsN92s|aS9XOXV4ESS7QZ0xoxzHB5(FEVguY_IN**Gw3Ra%U=AseJ|sCJF(keN?u
zh`Jn=2Wi!jg_jr10cadYBGv%a2iUC`*4hz~DB_A-o>UoySZl*{vx|(01n7pyFSkk%
zKDn085|LMBQN;$}gEL<ts$@Gh4sbw?G4LVqEXX3GLVS#Mpb(NJW+WgUE(<IgLlPR6
zLj5Xno3j1D$5$|j>apbfT(WXVUxi?ue5;5rVOeP*5;j7r{8(|D!VFj7yCEc7Hc@hA
zS|Y8W%ytU{O706d5Sai_rd`jp*4rRnwG*VGLVifZ+wA}?fPhz5BZ9<yh9POJEFa_=
zz@9wI4UEUIop6S0S*plGPibH<PYOE4pXZP|fWh(c;rhcPUq{CWsR`Jz$_}70Xs0P?
zx+y%FWC7%zbL>Nkkr^2iysoXQDuT?#?W#aq=tz8Q5f(H`PE%V~-_6B@I~<{%RtW%r
z77Lt`y8+3iQgF*0WzL0!<RZjG&Ebxqw(lfPMiLYXt@2s>jg!G#MPVY`u9%VzcwA5$
zUD^87BU-wRgU>V9G*1rNymiR$5>gYa%$(Z09OS<ANe%_8<=HANSu9%y*DNL6WR$7k
z;<0L(a?xVolmFCO*{@zx07orPLSH9$(aA|I0ZOg<N(qB&hiXri)|eO&EOht?Juw1F
zWy*4^S#>T?7!Yk)Yn~qKFZDEfsNG24Ofvz<>4}{r29heHA26>pcivDaK}vGvsllYR
z*Wxx+o0B{@lKu-gon0rj%p4wbs?T<n!_MG(1U5~uswBqfz)MOt0_d9qRiT!{#(_(l
zp@IYiWW3AV#V-#Is=^usFd5^f@GT=Kc@H8^rLVvT)i%jNTDF>!FfIog)GB9Grs-@x
z+DA4A42T48@vFtkz)DfCN%#2b$iVdG1FxHD<bo8pA_9*y+`bwSD3#(ibEz&`$v|ri
z;ZPuVKOP;p`L)Iyl{e4<U2L(bRO!O`l4+zox{#<8R)C$Vl_i=Hh_Xb^$kr<CrFhyM
zlP9%0AQON<S@axoaGe$;VlX3nhmD1=H!?5bVbv%nV!OyQpG%9kA=Q(J(E$$@o!`{f
z!*>Jtk8FRJNl5mLCM_x}Zy7UW5|j^$fj4OLu+O*vD0ZpB=3w(^$bF9t<JuUGAeccZ
z?&+A}*%GPYzLlSR2&5(Ivczr3`=x5;IW0&_G*VlNtj(%)j9FmG0kRPt0!Qy^V?*-E
z_E7h6$v{SOQ@kX&%T+-qvDzmw0Ex&r^Py<4G8th_Qtb<md8$lLwa3on7#3P!8Q}$Y
zw1WW1QK@BhjR&BpofgET6fm6Owkh-4JBZbCg~BIKk<iYuk7a<EC#;p~xgSj<d<;3T
z=|YJ>TSshXNdb8PoWeC1i}*kjR%y1N!l7E{oq_Sh;9ih~0DFolN|mkwEe2aFdVgF}
z8{tKMqVfhuQX>GW=wpqRt0_xQ@y>}4$(*Q^E$2q+GOjfip)o%VAa%|aL6SQmRi3G|
z(lL+**fNFDOYsZXB`%EzXGg2zi5de<<BRUX3`$rXraS<CE&y6m2Mmug1*9p!7nNQu
z<*aoM3q_o|lt3_x0N*rNEc-Hz)K?VVV3BKq3P34ct2Mf=Ki+)wc<V2lf4zHu?Q}9b
z-Fh}T+&bAl+}jc>lxkem?JDxE(?sia75UeHx%c3+f8Tm^_n({JCjWQy%RBev@2xwJ
zA3t2%-k&}@ob1W^Szo`sc<0tD+$*;xQ{To(k;|X6rw6C<$A`P8FQn_&wr8`+$?4YK
z*8XJe+2nNVV0swJip{1!Pl|j^-abB3MoFyq<i;JYNVp<7JvvHe2iyDmH+ZPDntW>Y
z$@)=PQ_#J9_jJ0yzZG6&O)lK%-^xGX+zYpsTzWW-Pm*ibd8u=IadeWbP37zKb}~)=
z<l2+JKl(@~?Ar7x*Ze8@?7@@!kGC@Wupg^4>B!_?YyD(Szug!=YK!mtf^70Fx9X@p
zI6FN)J53IzGG3><&l9>b{q+648`1z>yY^E4C$l7->)Wyc&@abNKVjHh7p{kAeAzd?
z9hcktd*6QgzKo(YD*y7d(XA{Dp73&UaP0kaH!@e~-quAO+&Z_5quX6qm(2W2+lrg_
zKVRIGL%F=))~1xV_`1}ped!C9=th#h08Gcf-S*Bd|L#qmrZ0cRo!k%In*6nq{CazN
zSwG&`Zg%VC-ERKP?dCz&*5$C9wKS$arY_x%tjkO6XMgW#KVNva-_hF2$*XS7x*TuK
zy1ddcOAvRw<D}uZ<D}KmGtRwqygB=eFMHGuJz2Rq>+;gulj^2nd&;yf9=5*v>8o!~
zxB6`eMyubReKHKoxhr43)^&g5i!UF)sLLB+`G-H*1L0QxE+?1Ys;}173%03VFzW88
zw>NGq_IE2E_xP&k?{9O*jt*o!k1IK1Hj-i^k-d<;e7l=^e9~3F>b73imp8bvmzFjD
zO>OM|!Tb6b?`qj4*AKR*hig9^P51N#P9~>kCx;1pe9cz)ybZkJK6YBw#<Hu2ZL%OU
z=*Rzg_w&2>IhpKDXE$f3+dKP{kM}0WvyZ=<AO??iKW5%PJ`+Lk@%HJ_!F2c5?iHT_
zuVP)7{0m{4|Ce8>=JkJ+{sxb1A=kllll`A0eXVc0;^$1>{Uk~L&)Lq|;py2q*In@a
z|InZJriZ)xXM2<6hE8`s`CI&T>-mlA*FXO7dh%iN_et{M_Wr@q?DWIr`SuT!WcTQB
zHl3YL<N%*NKRP*04z~{`vt(^@>)Ea3h8Qb1^fc(t@{Q!ij($R8J4Z+R8_DE!_g0cT
zem+T#4kyXv#qQ+zbb54{OlQgIa}lDa@=a`7TSL;x{c^>P;~R2D(b()rzC7OF-j%0|
z*phEfPxvl5k_Jv@@`$^K+SdNj;j`rAOdfEW{CIS>znAPxlEdjPXMZBg{OM0LCs)oU
z8_CWY>WAwCH~u*J<NkhfHj_J^OCM&>rw6y>o{z7;w>J@KJxRhzaV+P=@cZeB{M8TR
z=_lIc;nCqu+f&KuPsj4O{pt5I1N~s#xTV)_f3j>0_-J&K47FbW!}k8y*+#xmeEUiA
zAKUw9G9E`y_3~%aA0~%-QyB2i?mSYdKGT<x8*^>CKjSxOj<J+)3jJnpGMkE|u(usv
z_wxr^97m7VWO`4xH@H00|K|GNVm;YAO8!ffg=^njzjn$;x37gC{h)u|?f4-}BblA;
z%52Wu#~*(v{gxpY{gGMxaeDeZ%;`4MxPSEHda}JgI|^@g=kbFt?|!y*@4=nVZ%L17
z!G?S5z4uPH-+K>rRsNRaK3sYC{@urGbbtM}J@DG-+3qSG7apq(hfCy6X)8Q}FZDTV
zAMnXWfA_=9dw2e^`Fa0@us%YEM6nn~Pxi_^-V0?)q;K+cd%8c_yTOeMJ$rO|bTS#b
za?QQzjBiH$um`N@%{e#at8RK-ubua=t#9MsckzWcU+g~LK795%-g(shNoe;nFMrYO
z^?giCA)D;UJjypy-B4$f8`i{YAHCtRIt)vnIUY;*mx}o9?~x25BOV=}olK9;W;zvT
zCrDOlkb~hzkq#nqMHI>=I66+Ylc$p(Lj$K%IRS3@Hb1`h3#TYZ0vV^Lvb`s_ht^D)
z$9jwkeU>I4e31O1mmWc{4~wXmHF7y)cDrxLJtFjQ_vqkQUN^3YA7x;CkM%Yb;|~Ub
zsp4+_C6=$8RZAzf6*{I?1(I4008Xp3<Gt<E$#C7UKVJGlwzhZrW|L1p4U0Iu=0-m^
zG~Um6vM0*~ar)y4(p3~9d5%5q#xL3H7@gs{HWB@pFB^iwmhm<J_K)o5r)T@g;y_qm
zda?L2naBdU@G04nr#v~FEq%`6(dpu|<_3IT8tVY+Ch8aeRhRzK1v}mos}}4`yD@rF
zT&n%-UvkA>VOhmdc(<@#$HI!gzD$06E@xx1madPqu)FskZ~k@j;VNxx(8E^fL2+#@
zC~4#M{e|f4&u?z;?fvrQJ(~8Xw7Vtk{_@jzIDD9Zp}+me2M@{d$>aw;--fgC^{R2n
zM^OvjIJZNKOK#<`&(3z<$goShZ)Dh|-M2mLH_sh**P&M!cG36W%xXV;L#zGpt*`bE
z&R^|^S6S^xC$C$>w_!gzc_X7P>gZb@^#4A0&|`mIVa#9nL4S>7{^AV{`ir+e>i^%l
zqyFNeVPATHt4sgU<A+Z^du(U-dOriWY~&(QoKDVmPrVMJ2X!`fr#Lk+ep0wkUM6<v
z<Ig|6J=X!zPc}t&80l00C4b+P@pu2^FE^Hbouub~z2xp|<LC4(tawiNdew9KuP^bO
z^WP^q|9z56zfWjjEld9Nr$lp|{SBjw&c9~v+vOK8y>{W!ungvA{x1(c|Ie`S28W%t
zh>!QwuNiZ%X-sysX2O<Hqx|e}rXgN$nG<0>daA+a+4{%+udmZ@*9S|TL7ab@G-4M{
zza2!^yx&oM)g~$WU-S5Dv7lTp-GyF<UOpthw-LFv%5qqCcW(`?7)39``e6P>a;Cw;
zdH6w)!)Jy*cu$PEKdjyRtH!J!e6jV_<A<1+Me^VOoy1S2pZe*#h&9@neLp>3yHS@n
zcc!O7$R<a}lap;i2s5>?W@pF8M<?bfx&9tT-1TdVlRV$q_a=vX)2E|A>%z-fK;uji
zQ>$JsKpU4o&^NFE)Cdo<SjR?ky!s)>`iR)HzhzakEHxhf^V#Zl<-6s5AKkq23By%;
z=R9I>)gwlCubzgmr(_h*nS@nSFuM6lG4;5HH<o-lj;QyuwdAv(&z60-x2(-K6m`E;
z{P*BrSC0MibAJ4nigwvt{Ffqe@8Z92<LAQoZ+|}Ce<V9(^WmdwMf~W?M}K{E?OLX@
zczs@5J^0tw!R*=Atp7zc&iQX-f7$PA{Wa^?_NRy6-zJwsK6*AeT*GNN-QD0O{m<#f
z&>$hu!|&G@0d8`^&h~7&yB?mvBX9T5;;-2=2OHDS0zDwww)VlnzeHcU@#JuD!1mv)
z_u&wQi1nx-Oar-M_ehpUxLLHi8wdaDErFd$GC4Rt{mI`&RQT|0f1f)~Pkwqf3AYAo
zB7VBwx5A_4z@1o3`d??0vk7tVp=Eu$<1=k%Bl$qy@PbZeqfUxqbGl8?T&DG4GMjBb
zo6Psun()2V$80R^ZV;RD{e_*2Z7*y1qE<mk=}lunZmT8$2Cknz-`hHw>`taXOis4g
z@2BCc+&+00*T{!59G@m@_WQbg1r~A8-FV(Sglw(f6v>CS8P*+|Y*=j{%0F^Xcp2^L
zwb4R2It`0q=}R9@q}Tnc-+yxNo=(iQJ>91-?4~qe#@tnm$C6=~iGK5X2SHza)qB%Z
zd&)7t9y1Q1<3Z^ic7Aw^r6Y4Zw<ALn;~ja;#(6DvU|k;?)*eeQth^;7wM2xRK0ldk
z?@jjRqzI#Un)J(Q_`n8s_I1A`zFio&Um|YoDZA34)5+Qg{li5+Us%~<>)C*>+pbug
zuh2m^WxnnHJ%A$4FPMe4Uxto-cO*Jf>=mQ>3Xj&i{d4>KU!J?iFRiTg$HB(<vtfR9
z0sPtr@vroADg94m$oG?zH-!I#A~0XX|K;!Wzqj#ovHmw)Ff0t&c$1UE?frgTaM`^4
zw6F9ZweowF@!{rIkCHt8{rK)@|NbZ`M2v(R68puH11t?-Bl%7xpj}~N)Be~94J;Kl
zJjzKL{r)@q{yV<cJLUKOf|0fq9)^VIAGY2<ExDO|7eVk&blY|2e3rg^`o5T$-^qX1
zE$`|(J*CFyfE%ayoO9ZKIz3t4^vi{GvE{Fk4yg6bx#mRz>`(Ba-0)|ysO_tJy0o3x
z&GjJ};4(e40bbec$z(P;y<tbgduNAO8+OOJ`7W;Kv(aK)z4$I#ZPzcoST<I!5U*e_
zEQZ;_LzgzhI4_tZt0w(YJ(-{Dr5#x|-IwgfWk%)lok>1QvbWHoS6*woN5?;1wAApl
z?kp~~Z7<YZbMn=WSVpJY=fBp@E3Uj{L%j1EhWE1lh$CWxW&4-Dwn*pfHN5&8e(lvO
z>e6bh>-om=k7r9h*OeK4iI>v<zB@boe(UMUWO6kX@B;lWP4fl)udd(ee{bc-sdqBT
zw{~y*Z#9Jem;PL8|KmoQZ5^M8Xu667IDh|FRa(va|MMbE-|hdm@$-x9zq8ZnzFyS3
z{wIfL2O5)n@b8=Vw;uoJSDRb+AKZuG#C@{)@Zp1pb00mpJN^I<(D;)t?%aDc*U;mK
zPv$<k_m_uvKKu90$Ky{QF8x%m-CT0z+-ILXxcA`x{6}AYd1w65qsI^L-v8_TOMLm4
z&4<8lj=rB9ZZSxTyO|4=9B-e@@UZp2$R+c@pX=B9@2-7lzo8_#R^1<@$7>Ar+O^}O
znfq&ha_IjOwbcE&d$fN$_Vo7k>+_xauaKPe!{lV=XvVF(&$mymeYkV>^mg*`hshtm
zN&k3L*2Tf}a9b1}fMi4KJeh0mpB?Oo5_I%5;ofagj80}?wsu7b9X``0$hwmzN4Jk&
zW881;cK`DBuLh62=li;St?G5SGWk${*%*dA3B$TEnk)Cm#&r}aduk#b+US4Zr<wkD
z>D%y!bWOE4ZR6&jt^MTFWITU2{~VtIvcpeff9DZke;b7GkvvpBvI*@!!p!(I3BwaU
zls?F3Hn+>hWO8zHbTT(6+G!B>e;D=r=AXmNhg^BpNzIo&`*BL*``W?_>7~2dvq>^1
z5I&I>aPEuJy!(8zx2Bv6bJwYu;KCr0^!RzYcH{k@&pzRQiPNr!<)lfQJpYsAM(;&%
z1GJIEfl;5tj`ZMr`9(I{_SydFB_B6DVbu2caq~}*ae8w9$)nBBlK^o@WblV@$kvZ1
z)6>b;)4jDvk3W|;-}>V2z0La%g8u%&+)T&@`8qC+Z(}!P_K0(i-{2c{=FH81Sopdr
z7B_+4>FZJa3~PX-ltB)-UdiVcQ5in8m72OwY&rW+!qUy$N49X&Ro&Kzz<jrdh3h-?
z2kVh7+CFCHF4#znp5z}}k3YNf+23q=nu94mn&Idly?uN<Iow+^W`+%8B_<z=@YE+p
z86j^YAMR^FTNxhgLL0MDk3a2u{BJ{?i~GeA536BWhm%i|lVvaGr{SaI;&yJ^2#)#@
zw|j!cY-{;oa<GeW&Qf#_k+mrAx6waoePMZUT#Q%8N4+2m&#+9t6{D{UT?Tde<oD{w
zwMUQdJmyTk^N>S7{Ao%?_~ZUY5`K9Sf4k>?y%(?jqW}1dJMp)B?$<~D_sw|Y<Nou<
z594o7+^_Chr@Dks9xi+`s4V^p_jj+V41b!M(*OClI}aa?|J>Sq^x2)SHs?MZdT4)r
zKKJLs-=A-|ArER$`1{MdBJ<n}Y~J}?zTf)i=EDc^)6ehz_3mSL)#sa^-Ic}ZCO}?u
z;i}Dld^P%G>(Sl6-XDK5f6JZEKHL22F*#k9iuP&Z7RsPhghLoPHINs5_L(#<68W=D
z%N5s9_2_aHVk@uD7OqFao!k82W%~IHULz+yN87r`jC^%8oA&$($J-)_L`tD)$%cD6
zIWbRL0BqXJ|Dk_-8x`B<DwTEzEya!+_vmkFW;pP*p>QLow;N4P(ra-bV}qv0^xp;1
z?@t2vt(^kyOwjN8r|*WajXwI1$sa#S?6+@r;;)DC*OU0`=^wRw!`a-oA^N9%F<u@b
zIBqY!{&4B#_m^M%bm_%kEWh}4>BWziU;Opbi+h2x{GM-@-t+L>d;V+nb2gXX@pAQ3
zR^0K)(mPbJEx%!7#SJ3*mfvt=`3(ri<u}}1dV@-~<u@!}MPBwTzb_kBXg>T_48N7u
zs{K(7AJ@Zg&G1`0{MIe)ipj<KPB<O7-+&g9=r`cVX3`*~ik=12J_^tczwJ>7hMR8s
zi=r&ph|<x5rE{8x#W-W9o!F6G>V(ckJ)iHm=mx90eY3y*ay=dowF%eTt2%xElhqRK
zY`JuK@;jTi`%lgpgZ&j_aPN0F2=}fs3ctf)IBy)TaK?`h_TjuthEp&Z&bDMYvy#zS
zG(KnkM~?Nyy-OCIuM0wNBotTlXMEe$gyI+HEP?IiTGYZ>|37GQmJY$4R~83id;abQ
z;XGk5TQv&5H^qimI%gavE5~6$#r_=(#OAx>;nz4GmZ;3;>-sg6=Evu(fs^Hi^TXfS
zR(SmIl?{i-4}Wi#gS^oz%SD{7zrSI4Cl!BnrMdU!|5{3O@9w*#4<uQRn)uba|M2SF
zfA|~dzBxg!I`+Tn!g+Yru0Q<MyRL5GEA)Jbll^)f|MJT_SL%3(=>2LP$4!3DVe`#5
zE4}L>*7zz;d5b14y(4{*rs2quU$gjY9)B(3ujMEH&MJOU$6uTHYa4&<Mt5$<FLvUu
zyYbh(`0HeJ=hNYfEOtDL9nWINv%=q*mGO(%@ho;ciyhC}(VboVB6d8B9nWINv%S%s
zllaBc-}qTQ(kS98S*b3$wRp}#z7dt8Z-!q#9)63O)S=gRqAImKfOk%mX}QvFA@<*y
z!fG#d&furRFuu8v*x*iFn9<$gx4q%FiNEQo|KrYZ&0mJ!J{x}feE4nC-}J>fll}Sc
za<)HzH{C0y`*%9u?<RcZg#TV={N0pa?!f;aKHa93U%`5b;J{zYd{NNO`KxrvB)&uL
zyx9fi$M>AcxwU*m3@rKvhQ!i$&W~`sLWpDaO1+HLViW%>3)qEq|G#@m>@|PwIhl+5
zMyT}fOiH*n`?ZIBej7~YRf2f{@jt%$y>AA2#dBum<}g4Xtr{SO?=L@He}!!nvj=`>
zyQm-OUwaGvFB<OOn#}rLh#vnE^O>Z|8)!wMR%g2C_q$}d5eyHXjZzXn`snuPvmqyu
z&V;H^^B07Bw6AVN?Bkc7d2(r*Tc75w|AboK;iH)8c6;?5M?2q5b{7*m*KaRPrn7sL
zl4f~6UB6sM3*(ke-s=2b!|=|3+=I8~KM&}I`Hu%9bFq1r9`imP$b}1INVYEyvT~%B
zr62ov`mzT6<Z!=RkPFF@a|?8NYNIuKygfZxJ{d!i`^mpnPRMd|n~iwmD`~i=lvOfM
ztD-tPJ((UVovurrolmn|Uy%fQrS&lcZ7+P@yqJBtVk-O!zF;cO8+vVKc2QdKvS%(I
zo+00kPwbK_z4E0-dC4&MA?Ax8y8Jx5%sXG|C|rWo_{6<yzkx?GeQ_MlpS%^a@=6=W
z;bC;^+@b9yd*|!7xosXU%A<bZ7T5dgb-jKiiL_!@{6dlRKxOcyh0=n6{GIN*%RP7X
ziMed+E{@ugr`zLKX^L0a=$o&7o3B!EuD;JVFI<iP^)|P8oW*5Z+3&?=O3TA}ooBU(
zxQcdi;n}!+WS$+J9wqzRJCl7QoUzAV=6G3p=arv$r3ndXrK`tt`LpH*^}4&@lb*21
z*muTe7qdE=p(Wh(-_4E=x4fEeyaLnPeSs?D76}Ew#ke~@3pJ`3n~y(C9*03YNwf=Q
zDQZzE<6XLT<G+$`ZkQDQ=Ef(<Ka!WqrZe~P;Xn5GSA28!kCor-uWIdVf7Mq{|ADc!
z{HyJMto~~MAFIEbt$G$SyyCmlf1Iso@bqNWqhuCWwI=hs;;V0Nd~^8Cjg{Yh^YeLM
zp8X?D({nFK|8da;a>WG~r2klT!OayfmEKzUMY?Jr`06A3&X(?1y6nTc)pBSo-nef4
z&3%jUvn3yWl6;+{OFx%Cw&mY+BgvAN=U(xN`#${hQh#|lw<XWrkmDW5cCfZ|McS_{
znf?Jof3|g?!rxzi8~&x+;rG=3$-+P3&zt=(S$Zok+^>_;|8aBl*GK-Z&CwsD3pe`<
zZ@SiRj+(zYZvW=^0XIiaxH*2r&G9q7xuHkLH#hn}lW)G!|9mX}+mZhr%KuK}f2Rpc
zcY9}-f3wdwzex0+(aO>_rRV+++b3E}^iV#L33p435odlj<o+G`{p)PwYx#Ire$8KQ
z6yJW!7kl!Td??-eglT*EGAxKirut9`Wh}3Us(^m|`1&$qQ7^YhgL5K(N)eKQIxsTN
z^&fe+--by(&(v<D<l)-Ddo^6GkB9{DjvdW9W7k9LH>%O%sh3BpMQC_wi~3bxYd&H4
z^ckNd@6T@ZJ#nvP^+LS8vvSOT@reI|@mBNX?F{#*>C29{$=EB5wr8_e);1%z+uaG(
zV~&ou|8+K5&X_i@VMcZ|E$Cynj@9uIBb)M%1uamOC5B_|vg7q~nY!iJZ&md&HPQ9`
z=-5f~8~@j&(EoiF{yhl)?)887zdRd$IT(KFKiUre?u38CQSg6X^q==1Y!AQe48IH?
z4OjQS?7xT?y@(I(|KhkBY8GvuOb)kY$?k0|ulrQEoiW_>-H0D*>P+PHlSO+m`@~Gq
zpuo<4h9%GT;PCWO%?!2eV8z=#l}XiWX1A<z(G6FeD0cmNh(mlZ``OA0QDthO7D8xo
zymew<Uz&oPk9&JC-TAuE4eve)On;%Y)pTc&DR#-qmpR-%m{90(C%o0I^wyrNy_2J#
zZVc}r-%=S(AJP}`SlGJr?ajRtoz7UQ!w{|N(aulwMxSYq?8ndjx9`B}A=Oq^kL$%z
zocXFPVK~`xtK@Yo=&~S*-G?h=aZjG<HvL*JzT67y@6)aS-M32$yQ~zp=Sf>@@Y8Q@
zygx%T88^Q|-u6zDD^w70hUA9(ctPO3nbM>0etrW#m*RiloBr@i3cy}a{{iCn`TDO_
zTEF9ee;Yr)i2t2+v8?!)e7-e#@qAmxcKU<4)l`m$b5g#Z&W=#+^4r57e@dt$n|!GM
z+)h6FD0~r^d!@zc;nO3#TYtShe2gIPKi%jXRMFTU%-b*E7q<4p_k4{K$#<h?hqGgJ
zkM_w#?ZTVvLA0so)9}}ymOKmTI$ZG4r^)E``i}nV?C5klImEEwg?5h)L|2`x4O-0j
zEoo|W^8Bm?Y5K1=Vsk@J;sNw`Ox!pV@Be(Z;a^ApzA;?=?8tRazPmAubG$1)?+VA#
z*5Q$y{&Mfh_TlbN{*anmOz+O3*ZOlQ`TzXr==<5#Pk@W$e^ICN^?%Z`cqjkg#?OWF
z-^GFw*1^`UTrfdIgjmRkpPeh#bZ?KZ9by^bVr0S7vqO2#(U#sLABauzEW^Q|zvW&+
z@J;fOeypwZWz~EWkxlt;4<7vcn*VA;dp_IRpYH7H2jiOIXNP<?+0*V0op+Z<TKlCV
zFfyNtjZv@G<c)G_iTzFfz}+Bb%HgxgP|I39m$w#60lEjt&G*mt_qqA#>{MSxWbWSK
zAE_btz1_T`B;CdD^#T9BoflJ|-}t?_w~x3!-~K_Ypcj+fGs=g|ztm-Hn$bK4gT{}*
zyQ5?A=Th?DoCR8ZQ_RAnr?+O$U*#DW)_-e?Ir(3d`8)mpt^B<AhmUurhab<LU%x(i
zaeQ=gn)H<P5AJ{Q=?!LE!xtO-&vfdyX4?nH`;$-7cZK497eANU|2xyuEv@x+H5KrJ
z{h!OWpV$AYvV6Dy-^R}`vj2y5p%(_7Owa7E9{fGu`fT&=y|vSgWTus9PNwV0-cj;j
zV9CC5afYdUcl2X^TOnzDbDF#ef9Rj?*Puwe_nx%)-g}Dkk~_C{C)0iVaBYbvT8^!=
zeTqiUHMSxmc)Bjua@)r?`aWFz<Tbf7TTlM<r(`O9u)p+Hv=BaB)hm0#%jIu8bTWTU
zopimVQ11H1&`0;x>aJd*r^|+uN4ef!rL!Nc=<M3`qilU;hcD<akJQRjx&)=yd1b$j
z##JxH8{~SVx8BUwwPUxF7s;PKb)B*W-FNoI&|2uk#qa(?-qo%hzb)5o4DHNE670n{
zk{6%8FDJK5<BKo`!yt^u<7E<%vg!Jw6EAk@tS(jKp4-`HA_wYnOP(heY$RWN`Irk=
z+9LCf7Wt}1i(DHma%)sBylkUCpDk<CoNF72y0m^iyNYSCI3gR%zmQHZ{X%;7n>0Tz
zb^fd3x4n!1?e*7xO`9}ZsQ;Sh@9Mw4m7mM{f7H7Zg1TEcgSMVcPDhbfLe8ObU@wry
z5D&Zu=H4N@ZhfdIdbCdvdcXh>rS(Vv`FefM711LA?2$uIR<7JwjPwV1_xrQ8^-td4
z8`W`~i~A?kaL1LQKo{$-<ty?a*NGiEp-+o%y7U3>&qBrbQFGR#(B{i?hIqDmh~?>9
z@!?jlaeII3aPp&7D*crPe)wqUjJ|6`Tk+xg73bw+0`cSdu|_VKr14l?YND33yJDi8
zY-CGpO~pK3)8X~sjJvQfIXY#d30l}{YKq^o=5B19(|BBH+UZ^`U(w&S?e$(UIQNaV
zH<GO__5W@0+r7K@H@CLdFCLQF<%UEDVBr!L&_yeGVZ&T@plpg49`_2v$J1n7cFrBa
znH#~KR~W?8=dAj3me-OC7Kijz22WR+wR&qjh8I3chw_4vTmC{}{kg$A@5Ntb6)tIK
z_UZ$;>dLDv&0jFOtNQTjqdr=;=MVg=F5c)N6fsRpI}<nH_C~>jc;V>TNpc)dsD41U
zcD8rFKRwyrolsYD)M)Z=NtS#<j{fy=Ok6v*bGo&ABwE~Ba1sm$!DfF9q)BXh@hH%0
zwnNG07eqi(ci<eKo@@bP0~x+{ya<Qmmh}-9?))w;dEfI6&Ecv<TevZ|G-B~%>vdcz
zOD3&96<8iC=XBL(Trkh#g0h0>iZT0sdb~A#y7mWI1y85uTh<z-tInw&p?85e=|Su(
zg|Rji0e=_l6K&2x<3Ii|ahrD|`NQIlwmgAlgL>J%4NrUZ&i&y{_HO=pm+M|X(hI$N
zBb~eCyp9*a{H(r8&q5p8$U|A#N20IF6VOvbF3)ROh~t&<8elbkSN<kF6YqZB#?Phv
zKY9S~?sHsS1qO7!|0k=8MgLEkz4QOPm7mM{e@q9vjwXJv{bDPwh$wc3h|b~u<i)AT
zoLSV}$U7*%_1=b<RxoaF-V4#Uy2=&NXMqe4^@$+Ehu$xA{eqkYQPLEQZ#C1GC3Pep
zCktsEmq_ZE-3r~gmEPjU8ym}VIxfoS@ZHmVj+}gs;Y~HvGB<|j_Hs$0$1r~5sj)${
z9$u77W37%xG8{|u)4eR?%E=p_;qJRK-;BKQ^l*<f_`|))3;SMwHKoB{ECaJ-9or!s
zZer|y)^BtDdu@F2dQ6B4SIa1j9w2w?S2>^BRiqN?)qjeeOaA-6qlYZq{HOVMv)exU
zX#9w9-;(DTrr4vd7M?p~{oOk{I>r*)o1RXO4n@7_;aEG9Wb&`G=?~koB2GgWK7Buc
zg7wzenNQ#U`7Bv`|Gl4ItZRm#PJo}R(a4RvcFv3cnw^ZjRO76_e6%Lq4MSJQR}k?Q
zD^;w*<Ye;0M6*~&6Sn@z(CMMe$<3R8PUiZ}NBxCMzQ55wf7xqY)aP-JR$jjDr_M~)
z#i_b%TYkL!a4a1!KcN4!#%tLs`Y2od3_{ucYuy)t?l*iK88PqolCxuMmgC9E{!ceX
zPg<CoUP%2}#C7s-@g-*Y+1e8EaWh+&ZX}=dmt^C`EuX9}>C5Sn_BGK*-Z*!u49^}u
zy7?BKao!U`o<$<2-Q<Et%r~pxgC(Q*(WPJMu%Bo5(3jDFb&mL1Ci;5?;#K9)qCaZ>
z>>uASoIb11NZ*%N+T*sKFPz#{OV<y<rB~9cF4i~sgmc<IXQiHtkhrWybxauW+HtQ-
z9c%ixexa$trXd}xZn;c_N<K=yy7Sk~ph<C$sX}rGle-q~j_OmmWQq2~H~H*my@KJ>
zV9ivMtA@7!`@a|UCVPYa>UpJUq2)zgY3?Dftb}mW<#Z4m-K*+J$Eu6}N`0F<*uvFu
zqF2b>{_Ev3pr05y<U>a}y5l*&<cxRMEgbQQpT4;bcTPWDN0wiBz9Mvq`$r?vzw`1D
z>BsB0KO#$3M9_2=Z+Js$j_%xfEr+M;Vd1yE*KzEEY+;?g79Au!eU+y3#-4NjQ(j5m
znQyw+c>H*N^a`(a8GUC_p3IAFcSK%Ns4UlTkfJLVcz;-po^`qHda(v`&a#|)wb!9v
zEMJCi`YGo=<BFQhkqq|J{i7ef5;L!<4r;)wIetv7nY*J`XvXXFJiS-<$Nfil|GD{S
zl`<X<=im^tYm=kHq<=X-(o3HA&nIhNJ%0H4-7mh_`tr^{*5CXCxqj=hKJ0ZoX?_)%
zmb+vW(*;F%+<dC+RA+~?vtv@1CVRS&maJ2|ec8CZ=0}W1>f*Ln4UCt)y(pSrVPDP9
zLzIJalknB0=DWXr>FRn@4;!znU;32AIWe)bWcZ>6JujigPg=Wo=iy&B>ELJg?mT)F
z<iYy<s<?68X=F=Rhc&-!a9?v*lD;n&bY(R3zqAi?6LBSYy|+<EAo^8b3}?Z+`1O^4
zE*1a%?(FdUE&cEnGk@*pqWs^isu%G8#XJ6oxANoif2U8Auag@u{-6Jv9I_g=o=*4o
zU)~Uv=*EleM)GZPJ2`zmIlP`E%MyjRcjTi_421LZ<m4#)%F6jfSI&*=Pp9uT>2L1m
zQv3g3C%=UL>mvMzZ1#Enm$WF~;XmHW&o9dVm36@-AAgwKKRei&oFqq26S%Px0B2J<
ztdr?s@^yaeR$hOrShyZ?dVll&<A--ef$O;W(eeIth}&~VcI#Gu#ro*JM_=8$`*`c_
z{m(c5kyO{OL)tIjK>2#Md#aD#n%O_6N=)NF7RBRVCu{cQI;dD^PZWJT-4g|3j>ra9
zv90hL;ilxn@b?()vXmUP@4n+m{nrVA?X?d=BVSLyRc!9}>U4=8-kRbN|Ks)_MYo#X
z9@oRro~i1?U_oFj_nq6z{xcblQO5Omm+bU+eZ@2By<84GCmG#~FJUxh-wlP%MhgFT
z8%Z|!hwjSa*~U$+8lx!8htKvWHz)g(1GvR>`2?Nwhv`h##qr5xcRHKw{}i3pN3s;c
z4Z(f%s_zn<Hvi+_38pw*ST9ajtgP(_PM2QKz30dY+jm!X;5jd_6I?div)K3Dvy&69
zyK?_!Jbw5k{r^htSFZNg{SHgONz&b;kfIQFSKp!j{k~;$jRZ))C2t4x`?BpDukqH?
z!p;wuZSm~i!j=#7v#Yan^UqU~BEywy(~rJePu?FMf^3Tfgq!_T?Ij1(*}?Yd?(;wp
z{GBhC_~thDc|Gr+^3n9>cQ-S6iN4#TcX^#Jap|4BVx+TWBYo~bzvdl!(KueEgUh$y
z_R~`(aOSZW?8CWZdex>J#vwcJ`1a3rV*%pw+hxnl#&~hpF5l@(Ui4&gaP-4PqUQV!
z|0}%lTb42+WL{mcyaAap=(I98^1s-r%XMg&?&Z7e<tv{YOV-oQgjc-e&Uu5&YSfR*
z@1(bTc=;pXZ5#k^;1rXsvHV<k-6!xbJG_43A@Sx<v8$b~=c;itY~J6J=>``zEjbgr
zFBG{rH2N{GKd<V!yN9)Q(PA6b(!O9h-yC)C{h|3`4UI4O=xQCB-vZ0kkb}wop3UQL
zUJ1eVVO@>4r2cY0OdG+25*t{uVq?FxZN}p2O|Q_7UPH_0cKR0%$a%d!uj%wP55udr
zcctK*S-l(MPyAY(`^t2gxerI@{@izNH@yqzy}h4H`Tu{Mo*qtSS7v~}!2jRWWj@dU
z`HuhhE&W_J|1&IsE&1+yD_o0ivgFgFlj*bD^LHKncqoEm;Wq#A()*y(SaI+CS4;1g
z1%3K_@m~M2-8Z7SpKbr>-stwickZ!^U(WSw@dEeoxtPO}(bQ1OuG|rLz=lhvA~oY1
zfr~(xjxUPe8(MDkT1!azN1gCvyQ&vU9^h`f=n3;P_zF*%yY-?c`T2gu5$(S|**^SU
zzSe(q%gmH1V$kgL5kvpn16LG3=-UMbx%j@@8%ZdYxV^DBsXN2BJHGI_h9$Od{+T{*
zBs={tRC=*D8Z+(x>uh^p-^U}T0E0k$zt)bnlTSY#5`ecOd}!@x$A7cqQ+j8oC%f_*
z^6bD+XTPkU_tL$M`|2;R^YYsofSc!zz`X6?S95$bD3)%!4`zFZTkg%}Pby3%f4}?q
z{^p}cTaO=oF6!ys$9M1CyZg`0hly5}T}rL9H`zIRroHVO3*&__*q6W8KJZUjzrApw
zF6Z%8f%<6Kg;a=OSm$q88}Fs{?1?oJTd`73G7vYmZxCK{wFZ|wY!CwT5Bgx+U(H*d
ze?@5T5^bF~9@*;{k6+wKzG6^CX5843LCvo`s5=)9>dvJHb=j3m2Q_~kgZhgb$zR9J
z6bmzRc6jNv`5RwxuWfKH8k?QpupB$j`R-4?C30WRxs7D+HzNJdk;ncuR;<+Dpj2KZ
z3m0E#nOyoUOT=?_$rVOt&We)-xA@KNWtT6#GHTklm)IVC@vyn6k!^5ecX4WZWl`R3
z_m!q-*Wur-u-3RIWA2)8bHewIWar!|_D`@x-T4P>Ub6WWlez4L&za22jx@omy<end
z?Y;4_-FwqxyLYvXa?Zhh6)}6!Mlu)0WsVoyCfobJo@w!`%8*}hvMt{O=j+Z_5dN$6
zxHr0ywtwkHdP7R<Yti!F%tqQhJDK&2wQeW9rERp#yXoF(!O6Jl#?|*MY^}vR7xvfh
zVspR3R=M(KT)2O3aF;hiTC`sD*0%M+&5Qk9Xkke&-`L5xd?hcs{a;Z6TuKDks|+Ku
z_bW+)bELp>32^b4&F{MlcKz$ycnjNN<(62r4bD4#=GXFyb-Z%zzW!x-nPnCO2XB9E
z&Bwvq%Z#E_%WhbH?ZVm`-|@<8>(U;aU$6*W7srcGzgV&e-$17?ty8@QU)TIT8NdJL
zino8wGX4r<bn)U_+;x}6w}j?47C$oI(2~!4V{7?$L4REK<^0LA>>3jbZypJAIsWg1
zqodR3v(w4(l^`G&<bPLrRnF&sXYcaA-_Flv@gEk4?Mpr;aYby&()k(&>i>#anvXZX
zTI0Ko<oQPOVk7x!-Aai(mzDnL%Lfl0|BXwozjt;>_NM;Mv9&-09UsE6^6VryHexT%
z4j`>I4)Fz?<;Ne&zWOkE{Ctx1x09e6TO~{ERKEQ>y>%=5mQe7s5Eh;#*~j^<B>9iY
z$@J+@+RW+m?Nhz_>GXv>;rNJRH7Ao}s-hpBYVzM7XYoN(6y@ZAY7lbgp*EqkN}3+4
zGE6q!>9#cT^yKIuJn!M;+4hNE(qFrg0NhP<e`+H`hTF`pK~jqpfvSn#9Zt5TN2jA+
zYGt#HWTsbWBSSY2wtpfU?&#^$WalUH;SSE^Y4UHJrmg$@_fc}Te>}Uz-5<-zes&Ph
z#q&Vqh5H<OmAgLrbbjqjzYP#onL}!<{`>#?WG&QKb&dVyi?6iW>W8CG?GYcTPeIm!
z(KjVGm-NDM>&Vi1CMRFNb^_(e-F`?;kB+2^vI}JBf0!I5+q+s%he_dO<=8yj)#)Db
z+DN1OeWTm5<YRl27rT?mo~|gp1E96l@z6mD`|bEd=H%(xjrVU@9n~8;-U$<Y!mY{L
z{`6pan!LZa{>|Y)Uu<uyPhEKB_1p6x^mF#t!I7LsM~Bnh@dg7gzxDjQo#l2DrGPXC
zR+i?_p5}Aw{@O^Uw<foe>FF$)?H?V>rkrUjhewAu4`tn3nU&=3p*)qkB)gO3NBMtt
zh^+17?Gp&_Paq1@&5%5s9EPM@ZDz*8)lGUlo$OA2oI=SKo|8N~nQV(*s#`IEo?;`}
zIXk5swK2H;>uh>5iQD}7<Ydw>bsK^!toC6Lxp~=|pIea6H^Oks;`wTL1x9BWOc_Fm
zujL;mH+Jp0PPK0jqMz|27rJ^g`!=k7x8=q=j=IYCwndug{2s_r8BjCXMKo>h;W`P+
zmQ{G)y~+OR_9d5?P3TOP!S3n)PqMalWnuyLutE2e7oVoLs*Pm(aL=epbY1ip?@i_}
z&TgfHj91|~+n+vr&b2>Iw!fd8n9#Pxp)yxak6|vRr#}Uex=p(A_8ud1+AmH^@MbeW
zco)|BX|lV0CUdI0U)8<78rW><YKy~j+2xmfoa7`uEPVdH77)Mu(j2bnAOBqB%peWs
zR<2&-XLCr7d8G5D3uhQOk#}+C5D)3Cl<L`9LR;r=$jM&4+Q(zlFCk8m;j&eW`rLtC
zvP&51KQH-)v6k;{-n{adhOXXBUeB2J3*5%E8pc$X`7avNtC4vv>TVm$zmC#v`S&J2
z-sJ?mnV-w^e?2{!Os+)#bqW5jYTo`!>+GHV_cngs2LBf;=N<jmZ}aD({U3xkYWBxh
zeFl5HX{wd`Uw-EEf3iINKS}jEUv$;a|MLC+D)T=JC1hXK33!40&(mVQ{$G(c@8thm
z`MH??EjabQyz`Gc_wN4nezLaK*ON2tI?vZ5uiM?nn-7y>(H`8{o(11RDC>NB;tDC(
zWe82oh9bqMCmTus@p*>kwwP>(7-w5z^(lp{X9hnsc6Tue`^z?x)1%Yv{W*KH@73&U
zeS>e8rr7h1Gop@3vX-w2EZugzC&Q!UyY{x}wDB|1$NQ07{0?P3@D<R>K7n7GRdVv|
z_E6YBdQ^y28Snn!1N(F>d&0C7>J;lQ{^(QRu|NMgS-bbwEf|0we6jV_<A>^6yV*bd
z!dJg`?NGaO7-owRHf`V^Tl#A8S?kGv4=MNkCI8%f_&_@s2l3z+w`3zG?|G;NU;?9o
zeJbYL+OU3QY_j$KJ+AGD$@INl|8mIvzxe%W+xq?oTLD9ZaS2-zzEx?N>-YStg?E@=
zQ@&F#U&$0(UH4aaqBpgc?4WnX*8iHHS2_QO)%$Ss{+(A)0xmlL>vG}z&zthy`TsV4
zE`9#rfBd(Hn|D5clw|2RTbg9btv#(s`rh;@0lojb8BD{^A3f4!O`rzX--G2v|5VdZ
z{yyBBKGhH8xU~cL`ss5KK{6qyA<c68<k^^QHIzrUvSG0}@EXoFI3iEi<raUsYvtW7
ztzOoj^0!?X;`vg!!{sixv$Wpuu7(tRvEkuXUu>8XxuM`N;0g`=O%IcCBMNiS<0`)0
z`$@^!QiRaibSR@-s53EsaH;CV*DQXkbhjVMWWj{AJF~d$4UqtBf3g8?9G^@NwoiWI
z*V%-MV*K$^-Ix7{a%-3X-`}8Ytc7O}4_W^>e8R&&Twm53+>Jw@`sVdD319Yj96%mS
z`mo^s`@daZKGnKUNt%3;Y<_X)$-T$Ur+Qvd=3D74X=`~Y=0FtGPugN7W+Mz@Rx*at
zueD2-T8`i(x03c;LDevJZot;1cYaJ(b~Myr9x5yyJ4GvVdKTi`Equ4~*-^k$4$t=Y
z*NztpJ=2meM?L61J$9$B*P;5%l2qtXA9SfB0SL73i7p;Q&LV}<f`S&V^o(E9j%}~C
z541Iuu|d4_W7ZG3lONN5xGwpS?~X(V8=lZ-5M0r1J|2&^pohK6`M-O7d?g>y75qO<
zn!oe^yp5k%oqshSZpm-2@QjQ6|Mi0ZzbIw7ywm^Q!q1@p{pnzGaCGw1pRZr25w7;_
zY@eMTB~Ooza1Bg;O!kispRJXvjuW|Ve4xlJqL74$xE&{x{mJQs7UhqRKTaMKGUsO8
zN6*Dv-Jc#lyM?6IN7@&2_k~{VY@fJZt>}_mw9utx9g^$L?@)N!e24VDrRTzVXM&CI
z8#)VKW&ej0|CNJ)7smhcW`6%?**pB_Tlsli@jnanVc5Nk^!-ozd6oUIo<gxXtP<F3
z^Z!&$F~9%Iw0d{`zm=cY5dSIGDFJjn`7n8Kn9P2folXvB$&b&cyU&x|?ZZEwCI^!f
zfYmQfCx@rA4L#ImhMNPpB)?5(5j+}TofF#Imcv?6cYD*5)1MO4P?8@e@}Ga5O?SWF
z|LInee06s63~=tw<n+hM<S^O&X?K4z69fBn`b^rH(a`Y`&z^4YCl4NcNwLDot!KBA
zBEPvaJx%^DM(@#&vs>3e;CcGEV`+I3O}5qEpj+uJz4pe~o*x`Qu@dN<{VYvH>v@TJ
z9DVb8)y&7XhVQ&%OM2<TPehMq6TSKHXiXz*_y9)xc+G{z78B8r`}hXVmS;m#>wLU<
z_x^v}x!1qhkT+!D_NVHJ_(2-qb1^EbLLTEDx0eOY=A2hPKz6Cv+1wkS_sYpfB#2q0
z?A71<RbM>ZF?#yNDD9)8gY#y8L&s~h2HumCd=%cpJ64RB#*@4EAJ^s9XKU$;HXZ-0
z2mffIKNnqUZr$;+8?L+eWUj68SHT7RN^3L(s9s^Z?mzf)^UHIV>HnX-KW}W?MjprE
z-@n$Yz$$JnIg+fyx8rOb$4UKJ$IjPw+U&+%g_0<njU+0h<RfXG*Z#}_fB;DyK9Z(g
zX}2*60)qiC7z_r38M`VNsR9mHK3j;<n6CS_9lSh!2RH4Ul~EnMZ1iHRgC&T{U%7*0
zt*tP%jOcZ0zSWCu`)81;%&W6}w`BNZpE_w$Pu<=$!Zy`d9>q}px^@yg!jYu}zNgtr
zaC(Zh1b%pEdkNJE6Y0saE!d9P7LfkGF>Jqk_U6Uj@$u1d9Uf>9$dqB&CThwVl!y0R
z+6A?w!m~CtAQC~{MlLc>kS7S58WFW^qQb0^34vj%$o=r>({+AR{19dh8;1lT@xNHN
zVbT!UYe<1}NM}$)rrdg?H@>|U2b!!}XiPB8m}6OyS95u<k?OnKF+g1Iv!Y&WdEg<e
zIPRkVx$Pa`@%z6@t+Jem|GZY4#ee-KziIFPs#PF^%%z9)71q6Ozhj+DHoGnRv>wPi
zI&7!2cH^jBAKs5RX$NS=nJ9oNh#x;qxvR>ZWq%0IV6RasmGWAJTM&q$aV|;teHqcn
zj$>{AWRZCLl|4YOBR9BmD<?s6+X)~&ruA7t=E4xTri>r&J<|$c`8VsGjR2NoJsh3?
zk39${6zt>g$Ydeew^6~dolM8#Rb-ibAU-W#DTm}^h+rI|4C$T15|*sr(r_&ZHuo4s
z6~+(}N$?sK8#04BqH$KVAxWcDF5$PVs_@H9Z}OG&CK!dc-SMx?*+gSUegZOc>KRBf
zHmt_X&lfAE!x%a#!c!t;_@ID1t{9XUN%q)dD1vCyRuY>)V#3_e;;8u8TK@AU2Lk8w
z{TDClApGR-SXlzf*g8?rt)F7fJ5?4HA6rW$Zt9yva>}|BkVr7q+orU}Ptdre6V4nN
zyus%!!;U><i>%b^%liW(<S?)VKMawj;e~d>pDqkvfUGI}#_!NTIlal{11=K7F5gN=
zuMV9Xap82@bW!;d<~82Kc3Q0feX@mpr>SqO--5X3pe>PGri8>S*)=xOuqu<x*xce_
zFIaZm3I}P|&yu#vWy#u%0f)#?5eH2VMese92wFpq=<H%tE97;^6GQA-n=EnnQr4uP
z@XFt#wPsuFeS>j(fvthK@!TlALl~_-8Zl9ldN*W{nG}oi)SOeyqP*$L;z8=4wo;|t
znppLlgZLyjzfE5qsd~oEer?WRoP3=8C-vCFHX}8!Y4BAHDoM}wU5Rp@RKKQWC*4#D
z`07GrrkZlkqHHRwKMm_WH%Db-B9JO#TIX2?fC*SJTR)}VPO<ot6ALDHyW^aP+htV=
z-gY360h`p?)_^9~FcSiGHz#}S0xKi63;A79emYdW*;rW+BUEoeVcpQBP&b)i*+Cr>
zmWki4Gm=%0zCEKav^>lJj{<x5=2;L`OJ(`qw4*<H1cS*#n5uK38F!ZpW9F8u?*`5O
zuudZCmNChr4UCyX8gECUt=}J%%nYWDxS1X^6BmE{!7NP160);KM%tuJE=%>N^7EL>
zj%b{~uYI?*8F_#}M<iE%@Bx?4D{pWixF)t<F0r-n)^z8-qm;?f=*}+QeV-Ta()f$c
zpN%n>(Hh}2g>cpyb>{L9e%&vXk&)09;nn?0t%&hAQ`8%=#znPESnCK!1F0Cg3dcBd
ziMmY=n=-7U*2)K|UJG#=j<&Kl%<P#Iel%uBk@tJ5?jQPwTP4{1$fFZP(ZDc1pazOD
za!A8iA3_9w?xoRIIxXGd&_QAR0EZAti4r?}FkfevN&o7<+noPME#|F#0F6KYNwfd0
zuC31Of4|9ZX8-%Y{kzTlR|~>J`+r$U*#FilwORb{Z}PkKZ6E7sMQ`Qw>F4NEN)$)c
zfnL|S=3}yE2ZTn;c+t9zJ?V%zdH8DVwRNJo(U#|h`Gh`2fy|pO@29<9J;goalvBWz
z8^<FKyNoNxhPp=|u<DlLRx;j)cRp;j2Z=k8F*Fb8MjyOdJ(;fH&DnL3R&<26pAJos
z_==dnrOr?A=o4ME0%?xXVH+n}_k*9Tpve_f;za!w+7eauaLtJ{hPg_-&aoH2VR)gY
zR6JpKL^=B3pihjt9;#EM@mKzikt8&O{7Y<nZg>BOk1Sia6aXfy|EnMZB>cZrs<ZX~
zTl{Vp|AEfGWjG=HkmmH|<aFosq1?WZ`;Q<n1%$|rvIC2c1I(}me_Ivv%c9eVH24?3
zF1F~o)vws1$dIp1#Js<d<^}aMId(Rp1r7FeQqohva{N+`sq*vDK{0_L>+ik8Q>pJc
z_kj&{oQB(}bGkevHf(aUKZLpbrigp=$VqEkQLm%nPra_)gbV_<{e^$?tPrvr)}Oj%
zeXD8x@3U>Tt9u@AM+;DA$wr-Jl_f?$@Gm_ec!#57pa#~bfEYo~>7eqHwZQ{FaL%P`
z9<wJ~lRC2HrV>f(`|L=oX%mUWXq!bQEt^b~ko|o$F-9wdYb!}BX4~#XE%y<r42jvA
zz8v9XDrQuP(b-m<6O4xyoBk=#5_7LYd{}nHb2o6?@L#V9?Mk1B6pu!AFb9;#j-0tF
ze_Z;5s(IG;b=9xs2(e%W)i-WNU?A(JkPH_X_J_NCC@+tsT}g<wyyL=R0rKpSZ#P8k
z-%<4_vrCE|16avAb>st#w=)nO7vpQ7O_$TfjJhX)HaZw(f=)ivIP--`C7#A+Z|b;?
z;zkpwq?Jx3qv!u*I-xwR33L*hgws%pQDh9Q@T{MbR?=BPoLX#ZXc^RCw$gccdN9Y-
zv|Hv=B9ozR#xAItqMP0$QBH-9-|J9BDBUl>yjjw70#`&v2wNG`_#k!KDnniDH|G+#
zITodole~iAKC8|UwNEe>52bspv7u*%jaX4~Cq`j0ZJ%JKKQQgM%XI0bQ^#)vmlnnG
zuqW-ayTi`F>!XdQ*LBGrv3cP(KhVi)!)fu_;gHRCSR#AP5&KA^6RgM>s(FR`=lyGJ
zQD?ue_`A*iUwV5SG#w!6I-e3vqYId@|6g8Sjr;#vS*gzae|(eQ#Qpz-9Xe?QTv%IO
zYkwU{5}0A6`d+RYOi?9CQKn$wrtT|7>77kqUA&KRrJ<Z#G0fcWiA%;dYWdNvkVVNf
zCknc1GHpkIS+38xCZKB0OWQU=UE0Ur7x6peZAlU7c$>1p_l5Ozot?3XWQO!tr4QP~
z=v^{`_?{@{@6wKGiD*PCz8A9kn>6D-R5jZ&&9+Qm<97%9zgvfZpWy#tZ8hotVYM=g
z|MX3Mll}kM8JGs@7ry@?G|vZ7%+JuYtv8(JhjWTeF6WHeDn`?vcMY66e%ruN)(7TU
zL;}9Wtr@7fYtV-p1jjyukc>pF5MS&?g4_*^*lI-FUBb}Ki983;ZFu4!vfCPd>n4{B
zO<@Mc+OqE*m*qwAiu_wG&}~DNhb+MBIxIvywd3|=AJXluE!p$eY;F$BuGw_Mu<jHR
zNsVMulU62#Beq8d4-kLoPp7*(yFc&M504J__)4^R>B?5|tpl<NaV1Ni+GJ_8J(VT`
z)pJwq98+OgKA)#Sp^}b5<t`{x?uJ4&9fj&$P^czQpy4BL*L+n0mWrm|?RtYHqBYTU
z!lu)5c_>ZtGw#f(R2>lHR`zp-uLunZ+Gf@@t=p2k)w$6Wq8J_uD>Ie{8eS=<U4}e4
z2yS$m6!<Zzm6lKSmyv8<)?|tmi=rwoTHfm5@Oq@sY+_z8?4cM%{7OY+wgl!XJ&AnF
zYt^~uI?kt?)DIxO;n_|CTG;Pcpc32&N8wuCh$(13SXNzwOq>(PS~VJEVp7QnUn8lc
z!<6^KkV#Kp?6raf;mVR|0<SJ9Bhg9>MJqNIsiouqSmo59q?e2h&>w$@_{bzZnDPX(
zkIhXqXyi;Bcqlaj#tmIf#MX@9Sz<5~#YJROoL)=#4XF3hW!OvP1BcnlG;>Q%!>={9
zunR{_hD72BYR9~3Y3%H0^sH$7^=CyRIV*H;B&bS}VL}Q??FSy-l)k_Z3LjmWg-3&q
zhdpzWMdO*ABXN?AE~tMQ(Q3RPoM=UQR}c}HT|o&7`jpda#Ck)s?v?WaW)>`cqUZOD
zEQ=Xdu!Nr5k|LQoi<Tc^_9XF7la;$pZ|HPri&4ke9ef2o+B`&;4p?l7<X*qScMb~}
zxI;df(lYH@64J6xWog;m;h-%cf})p#Si}nGnKZ9v#(v=Ta|xRa^ZtUAe|y7j!wt}3
z4aFsqk{9)Ns+fn~1Y|?4%MF|~I@DaMO3IXbkX9uWoGuk}LnMzL0OkE2j8CT{ny^py
zyV4mMcNzKvqw=C6a$WEIVn9dz=;^5Eq0=z5vCebT%s!5~N2lIdBs9kWx<><)9r2@C
z??_$UD9JD)7m^I|fJ;$W)P^{@U_nhXknKlFFLR0{#}^&Rx1*+61Z$9lCQjA(XgWk>
z6A`n*XT;4D6FFlJn~@)*$thKYrm%<Pr7^+_&)gA7)|-S<U?54}8_gIXIaMWDtoXgA
zTarRh8dj1sewoN{XosF;HRf*MufS{`JaXkEb~1@s{C(I!+6M7|o-LRXfg8>H;#0ZZ
zk;PcIh@Tz+bjya_dQjj>6qM!o^}#TAW8hW7LsbxM{B#vj(!*9F_mXxsocK@`$qj-m
zMsE)VS_<5<7`@#NG%s}jn56m68~&P1U9h!hk|Ni!i{|8R3j4f07cjPSvGdD_E!b23
z7Tx*4+-T&j(#eAgco^+zxov0I8K~F0gVOBFf~ZpOLVY&$Ryz3BL&4YkSsT9I+TI&~
zcSH^P!~N?pSy`+W<I_XcqqtdWO<HYs-?}72i&es@_lGWdS`0d;P76K7!a(uJNLXfT
zfiYWlZ6%(Nu&pBnDQt<pGq?yNU0+;FHWCu$j_c3H=T22!M;{WZ>oKh`Q8f`sRFeXp
zw<Y6DGnC+jovQnM+_ogP85z03xWlI6VddB9_am{DYm~4$%_c?PS*Uv$kbcsltww&-
zl6|KO;>n3rNPdk5{OcN=+{XSRVEx^L$NyNV#^Zli*J?BSk8kpu#s8Sa|Cq)9_|xKl
z#Fu+mh_2Xm;zi)~KA46<1+n-s8uJ0J?%MtC?!R{r_D;};eB@lWAbvM;oc!lRRLa$5
z!`Lc(hpE49#T=dg=S{9s6^oQx{>f+T!=Q?N!}GT1Kv;G8x1@{c6xYApFvE)`<@lX_
ztpAQVuwmqZH+=VdvGQBwb^Ukkc=ID<52C76*2k(D>E2{NlIzeoe+lgNkd3PHIa(|}
zRdGJ0`(Lietdi@ace4jR#!+F%yqwQMStAu4m!kBAA?{s$fpk+wT8-C>gNQ^#ss`DY
z#Ul3PQ|xkh9^Yl(qQi{la$N(<-ELY>0rMEJr(KC=dMB}m*mHkidWnsiHc)P1jb5UT
zia8#)T#YL?t3ZbOnTggC4oxdbiVX`AFF9D0Yk{8Q=)+_kre{+x3VypCx&!@+>{**o
zvSp;UI3Q38!eV3CMs;;8HE&oLdTDbG4<@4drplrD0Y)BVY#w{K{E+IafoD7NINNmG
zuoIms16BUe7dZfoeV#`LG6N8lL-E6-YxXuwV+B&?h4P1tUmVqTNz8cIkE;PJ3{5@4
z3LhRh?hh-NNP?@!S?(t{@JI96KGM}k{D&E;W}j#RPpm$ChZFfTFq7IMGRuNkRS(PM
zjTL${{Hed#KRBpA`}gUdC|^6y8=Zc<bNF&kRLjfjDPyA6&8X7EQAspp2@G-e80hlY
zS)l^-*QrAWOl0zN{j?|mnOK}<doJ{88&^ix&7bng<3AiJeUF|ifoB+gEU5dHOK(lA
z$tW<gM$Bu~n6d)Vz>QmObmu<)J*9g`u+ninl$$>HaRgt)S@{uXWgo4+Fc&^U`=qz&
zG2QYp)-Bq3Hg(Uqj+qRYJDDa^QT6r|Bg`JJ*>yIx<YUwlIr?et#Xmk~l%wY8>J$Q7
z(j`6i;z#NK`%9eve+?o^hO*G^yEVMYF)T*&Ec$GTb#)oS0cAT5-msEaQI?^xl)ROY
z@lrhV=kG4|nNb=z;(`qAE<-bLH99Q{$q<`QV-OoHmP{j+5FFFJeFCI(YHw<zESl5q
z?3F8fs&<Scd$UfN{i9jAqQoy_gb?n9vGme8XOf|v#fbGzZyZ!+W3BsS6Vt&<Nl(=k
zEBzNpeZB)Ln?Yw)q%#Fl#?=@>W(sUhWzYW+=a%=PJO%dg<1O7tMSH65=!;_Kqp5ES
zeD6n)3hwp~NRqmiyHI5`A{xxpG-{*qF@{O{B1AsKFe(bhO;DYz=tHvaiOWTqZ&)UU
z`IKeii$Fhv(*w5fnXZa)a20^`r3e<B^!n0pnb6K@xq<>{rYVXYAN_D_>`c>B^R1$2
z-dlfQ>G2b8U}FZslf!bF5}J3b$ec#W+Xd$wQ{{B=ISl|)hUgqq<%B4m<5t|;1nP`q
zaEDl(2{OOau}e&~W}dm=JWE6|F%uFCs1+0CFXiwz_PfpbPu~x{>v|WzLtjjP3^c+2
z&&o=||L=0GJUjpSCcnw|f2WB9H;ZHab>dh@;gl#>Xs*fno4qI}LgAIS%t&{Mu(tY}
z5_rvK+A}`)W8Vt=Re_f6?H_`qk=*n~Qmoe_QOQ8U-0np2-nK@B@{8-a%*IR;(NDLh
z=Z<X;I;ZD0l^>uv<m!HlEzZYAnjSZ@ykuJAJ2G~#(PMA+4^LN@>$@p|d-HNvC+IgR
zs|wC*Qj^Yi@FoV!{v`c;Pu>08R&%bTbbbl|(&?jGSxFFah_~;w<>@=EY3Hnr>a=B}
zXJVZuK~%oCPK&jm!lOE(C#9O%=$W?tGssEi)mgqba=Cr<*im6nW3WerKutKg|DJ=P
z^4LY;Q1Lx2AS$P)gha&;4;>Vhos}m>dvyFq9%vPl5q*WLNQ`8Zfd^gB-n`g5K0Z3G
z!vl>31%4d1*}XV!aN()v=YRwuwV?f$4BL4L+Bgm4cP7*Ep-81aanFiH%FfQC?+Lo%
zf3a?^n$*})bjvh<*4Q~lAAI|mm+Z#cK;sV4F7FZDGA>$KJ375ACw7H@x7e1q+5gE)
z%(o5zIbr{o692IVFSGsMxA@KCKmKq3?lS)$*8Ue}e04ct|GPYk|N2dS6ZJo=*?ALU
z2$az6JE)tHcd&8wzmCqWP`?u*ouGY>^w%hrJ)uwf9)zT0rx<Q0NE_3*5f`r0$A~My
zc~GOn+9N6evYqLu0`*I7Ksurbfh!JR5VX9W6L=iP0LdC{;|RHyrQ*@XzS^Kak{M!I
z&|Z_pV7~50ukdc$+ZYC}@<QJ&uRX*rU`vU4vb$@(3XeTTpta{{Dfy83ZHjU!bh@tI
z!X(|#As%F9nsfwmKjY6dt01=VGu*mh?Pa?r%h1oRh;|hmn}bXrMX~r)n?NedzOly$
zDfeyy2O3uI`j_8r2Zf)C@!Gy=C&})iJ<j*pN8+(q`L=}gzk6RIL|D_`mjJOdc2{C{
z{bF|gV(j$`qOjXvzW_>0xq9&@-0sket>TW@o^oM?d4+Ts#VpBkl}g2=)rHX~#N+O4
zl%bHh2Vah^^b#<781`|qC|RrJ#(>$d!LBQkQx{anB-vFY?KRvB=hBPUOU;{DZO2V`
zkb@r6wd;i2*H43`3<9RB_HpIz6^{gNnTOoDRksiYh@x3&N;4q(`%=1Utv=E2arm^*
z?_9bRRt{R!?W1%~-7_6g6oDwJ4^0#ip;zur=&IT1GVp?%u5qVvL<KE(%=FXXtF`zs
zK(2kgIaaKG1>6nrmHUj?tv5Y1J<=vG{jEIgBxab&kCi`vhL2jNR5#ppt@=~o>fsYb
z5%tbJR$98yLIg8%y-P<!52`|h4KMD1%*3jqDRkdf-+B^JD|HO>310Kr(}X$Oh)c&E
z|I^>v-R563i;PKTY}<Gi@r<h^=Ueo#n*3PRA8W~vwR=ru)#Q7+o*hjpssimgSSL+Q
zg_i8sa%DKzD{pW?2Hfe({&{kpswA<f++{A<pd)g+J8;XfacZyO=`JTqvjqFrL}D1H
z8OP{Kgz1g(%h(P_ug0T0J!R<C^r``ePziS>gs~M>;}umOqM~#%k`r}Ai>ePvRFYv7
zjifsh*;kw$7Rl(4%M<2kiY$3QPBG<H@Q&dBtPUJM=Tcf)iLK13RC+rh_pj6PhvGKh
zF;AW#7N$=tLoAeCL}KARXd>0!d_qyrmfitKX?4D+D?M<9lRYyiR}3)^3;pIKw+jX6
z$KJV%W_21W9WKhlS3;+q%L>uo{sF3PZvXJ;n!F#NQP?K?LTFL~c0U7?c6v>G=r`Y$
zQA0i6w*%Q`HKlD<Q=VofaDb}cL9L|{TTMbng?>ROw+jjZk6slD>}Y_zFpP(K)=Po=
z<!gA&n0lx<LK#_QraH?|@Y(c`J#bJLONSKWdRlfg7mYcqu<Q|2$&!a&dd7IHXuvq{
zC9Ko@oFl7Jn(gpY*X!x-fj8&+7P}QA$`@XBwa@!{beCT5Owt@*tT}JApTSSOld-n%
zpB^j<(kM3**X8JfsmQ+Kn<W^&fO~rrKB#NiWVZTAZhql)QM`aWu@yjCI8Z{%Z4A#v
zW9W5SAs)$#F1qvWcpva)?Z5|-bpUu1B(^dv;WO~aRBsmSso*wl2>8-0vB@zFi`pbk
z=tdkYZld3Dnyzlll}q|e?q`7)=unNRvq4j2zz{Qp8xq!5Vs(<|`O(Uxyg0;GC2Q#K
zwIY4J9%D=BsIhp?{6rEmn}PIH>w5gE>H2ZSY+j;|ECCRENdrpulMU+bU3F_O7p9Yo
ziM=(^-wRDd$u^2pfmT_!qjPy#b}KX1CrBUIWy~pvS@Jf0(3^m1Povjk=wC(&B&q(0
z4E2$D16yg&Dr5CMGVoDC)e;?=j8O1MXQ#AGSmLURqI4%iYi(u}^Ku%Q*O(tnlM*vM
z4j|>cDG8tUq{(DzQ~ds~?DD_9MfdG~x3T|}?s56b<1LIpC)j`2mRAz?-)oiX%>MIR
z{HDJDdwBZu@!rmJ^dgzbFmugBLB=@&W{_>qM1ixl;0Ro2F^Yb>n1}49pg7j8wY&(a
z?@E~hBWtHeEr5LC280%wIZvw|-##IxC+{>#<CsJgyBy2u+I&+6jAv8JQBJEPZl%B5
zeW5Q5*~$65ym2$;9+JL<1pkh>d}R3HvzkvHvH3QUx-InOEB1gLb@to0Owj}>WDV?M
zLm?%<9WrW$1ov8m7i3J_09hE8FX4n_?2P4vj5%#uEb)b<*p^FTRhP0>PLeKfLr3<(
z<Sv-L2U3I!lZD4DHlu5ZIIRcJ&Q|zN&HCTA>`ROHoPKF@y+9GQ(x(2migCpRz{b>m
z&vrOtu%QQ-DOO8I@QWm?Fu4S74y48=PH0GETgFvT^M0NjPD3?;gU!8_`;ms+LszJZ
zu`3xjiPbHtPy)F4-G_O{W|dSgzUOqMx(=1il*&KRFsm;Ki+Jv6s=&|zd@=a^on%*Q
zy8JCg!^!d=i3dyfsRM<)wY8Oz_y6D*lmE)qYWe>YD-YGkalij@`ET0sr<Xg{ar^PF
zRMysJ<Nqyww;KPG7q3o>cm=E*R%+Gq@<wT@o4^zHf2(UN@%w+vm6`viZ}a2peW&Dt
z$?KpwMc`e!@Dli4f#WSIrCO<mnQ|9{L4R{;>FVmL)O7|IrLgIhF1)}GFTAc(9G0AB
z>G%H9|F2twuS>5^iCmUQo-SPsx}AJMdWE`j$SG6cqOW>byvbA)FBik28+1c-_=GQQ
zAIOk2&K<Am_Cj|PN?}1EcK!ZMKoN&?&Ag}r4He*@HSuaV2#3BnalC<Fz+l(@z=uDO
z*u^IdFaNVbm?6FCL34x98{Cw{PNyRXYKZo`7=)f~406U}oG639YYf?^Ie;35cpxl7
ze;71fN@?KL!yDWybi)Fl5P*1ufBoTr;dK3$*Y@}tBgIS?eQ2~dKq;ml_?KRb#2IH0
z>w~7>Yk7S4(cznq0LvXjeS*Km7@E|V62GPoyZkPYJ6^EhjSSw8^e^#~?9K?1Ky@Z`
zdx70^b-a)qahX{3S}_!%=4Qw7x^7S!hZ0n6^pipf+TI%Cp@PE7#6=@`d#p?_5rRUt
zzvVZF=+ePagSrIc<&z(JAYzycPAAmEVuGTvB?v~_tY#m&p7dw$3cRzU$XXMiL3_}w
zC?gJ<S(OL$NLOmH7C#69GrHS4#JPiaTYD`?b&=8lQy_F#aAyuetMN3mTRgL=`$E4x
zxIzk)1S&$1rja<IyoYofAX)ZIAVjNSDBH?kPJiA%5hq74PJi7w-V^Zr`uOOV{pWkn
z#j}6I$33xo^!ne&`!9b!6+a&xJl{J$5j%&^A@%U|c>md()1%`P29(`7f#O;Ex^wt%
zvG?}%@!rXaI64;luU;SQ14O9ec<1nRfA6Fq_78Ut-aOwwd|40xMI0WTGMIz?SNo@s
z_w=Yh)hEk}qZi`U-tq3w@VfJC|6u?0-&E;~{nJCN@Ws(FgW3_VcaBf@ci$ZB9E;a)
zj$a?0><Mh;^Zk?EgPr|Xd(TUN2h=V0e%U)b6(>LM930q<W=KcB9_}4uOU!1AXM2F{
z&a;C(tdiRNeE)cF_Y@l!J?%ng0-^^626gg!Z+9QwpnvwDX*<XNE=a&9d;jkZ<b;pn
z`Od4Im(bGOG`$1^w)^II?-jNHy5{7~vy;>P(>JGk;^ooNa~gn?z2jf@cQF*p!O;nI
z;G2^@iO}<%(;Y$q;6N8b9(aEC=478bbN}#k@A&x5>(l+C!#q&Huh3I~?GBWGPQ89~
zh%HyNw0Cs;Zv>D1LL*ZUzy7=j>Brd7)O$PFEho^6yQgM0s1!O?HZN+oINW=Au>W%J
zaCZ;093iM*_fPinFp&Evm|>p~0Q!K6-%t<W00Mq;=w8?)UZAlS`!B@K^I!I{6|w|S
z$H~4VC+f!CpXE64#q&pAo4nTGx>yIo+Ie-tVpRQSt!7R8rawXjmAOi#9OXWM_YLE<
zI#-F_jw^Fj^VR(L>f~RQId;L-Xsoo~m>;V6p|R>V+8Zm@hZ>h~;XlXvunZrX?e^Ll
ze2G3lGoUN58s+FE{;e8)E62ZKWzEJ)HSHVKx8`nCnrp2$8FW%0sL%FJk-N}bIyl|`
zWp7t@yWrBTT)n>Y`t`wHy`IPOvlqbRj!xcUCS-1^4lG;8uFYM#P2jkuAAmtV2VV-p
z`X`@K{CH&XV=QF;lTsY|bVP9+xB`t5{ad4dm(xM4E{n6wXgCakp)E7Cw3ZxH>#z5Y
zU!{UVMP@!%DO3x!LbX;{DXbRO3gyB^p;9hXDuv}jrB<lGzbl3HF`!4_X#!uCuxk|!
zyi$#zms5veBI1ZE!Y5R*0z_0+u%;^*1A9E?D-ygyA7HL0(9g49JWY?p>W)sr+=15{
zUjH*ck~%*p3GquhA%0HMTuM%)xzFk3m7aTbnewNQQ5qg{tmi&YMJ;0>V71c`MQV2_
zG^QK-F(3$!sfPHAbZ;2rIST6jb6Cvgvb4KqroRbHzF65PR*Kb1v9hVSbWw5TqT<3u
z#dYzdj_MF-&y!q4u)ehY->vrl*6Cm!un$WYC9gMWk2%Tz*Ya}Q|MSXfdFKD;oBX2l
zUp?;1Lr*l^Dn$-?Hgnrj%}!`I6T&Hgd*{XtQECbIcfGcEJ`CKF(}X>l8=~VMr#Tn`
zq#L<-i=TIX*{h$N>{Vg&({yO_%{v?*TOfV6*YsSrw}VZh4?CD)2!)3|ya-NyfY5M_
z{1P=?DUh)jK@HeSkP^h-Pvvj@?yCP=U#%|Jrc?jjMgIpZU^f51#c!tno9X{%`oEd}
zZ>Im7>HlW>zi+PpBQYvn{ii<J+P~WBs-^u~wUmErmh#Wk45ljoS`FA&wv);~NP|6P
zt({c<wbs_$cC5rQmDs=n532kd^$qKDH&&|at@V|e^6yVq{#92B`v0})F|J;@tNL%P
zU{;|2A6LB0^nZUD{oj-XGeHA5C0+alRe;3!H-XU?SBq<;1>97ex~MpFQE}p;;=H32
zfN~jm5dELA|DST}Prvc||4O;Kwi>_xv0N$7_W$4FH{1Wu_W!f}|7`z1+yBq@|Fix7
zH{buKZ~bZ450czJ)Xw!4OocoqVexwX<>8y%dL6{lM=*VR$a=GwL%^KIOX#u`P^NG~
zSo&a>F27bbHfn37tctc5Nwt)LzN&9ai^cd4@;}=-+20k<_g?HD?&E;M%oT}z(A1^H
zMez!Fo7)56d)IxxhaR#)&Y<Pa^IM7=hVI9q+XKE&eGMo&upo2>UcW;Ov-)4etXLt=
znnYH}sz^|gkz;{zT{yT9M4?9TS{?>134n0|&`Nck0>9GTW*38eVfZ>&I1Uj3WVhOB
zw7&f+Xbi*>7N*#qRPSM}ibbd)<oUUsUg_0^i+;_|od8#N#*V&V%}_{2qE!f$%$lK!
z+#zIJmQ})*^C7BST^?N}R6$i%DY9>3d=)Vu4zwF^p?(rIa2()+Arc_ONNk}aSlU0l
zg<t7{WX@6=4Vi>Q^?1z>V%Vo3f3#Lh`k^M3EFBpPQB`E1Y*bhwN#f9j*G7jx@DE+<
z90scUp|@Z$$IdWSY@)JGvv(S3K<1jd6tt3H3EPd+9S$QEXE)I~*xf?L^*l&NgAhs?
ziak-8*dP{<rfAVIw5T#Qw6D{mW2;3w_`U0d9||nfNZBlKo5O%a4S|(~7O^og4OnO-
z$qXbRicu)Sn=WJuXsVy=zj|J>^q!)8-J-CgZcOiqA6jj<*;tF|Jq0O5opwU+$sh2y
z`X*`(qZ%iCK%GQYNB5cJgH1OW=na8jMN;V-X;GUS>n?1&oi~I$t~kWxwztJ<c@0+w
z+c|)-{fF;l2jX^&LY3;;#@JGrAz7?iU9XHSh8dE@ma8kZvBfY$3X+v-Wqdixky4OW
z$FT)zbxk6=yu2~KAmvCFB-PE>g3<~jfhrk&jmK5q-%1QdWwpF9VK^v@EE>9LVhM-f
zwS*FKr~{%0d}SjW{3s#B(?|e`{f()$Mr*WYzuWw7rT-(X&n<(0{(lqoe{0pXxcwgn
z0G;XozQvFAf4hFSKODGH1u+-~AWU}rb6l`qI^C|5yUrJc(}eXH1x#3JD`j-N>;a{)
zFSt;t14xsI;c?tZtpX_xQuO(~NL}^X``{MDtI}=>wzwtOM*oaX^>USs)m7M;b<X|3
z8(efnb)&K=4tx+}=~W>l+QS|N7-V4YPAbd4l~6C(?GAgM3KA$~#GTz&Vk5Va-&|c^
zwn6}Uy$&vjEq@5qpXv1K=hRq!7wiyGzO)M*kBi+A<gUe2Q7)AuKdj=3SSv|~3~h{%
zU811b6p#!bt}al!n)_ttgN%#Y6j=&0KGucMAsf0%r!NSs2xF0BpC$qsrmm$-1-{6z
zQ&1c>D1gf%;BL4lX~TvkcU>%(R`T!(VO?W<?Q2Lbmo_Tv8@2V78m<ScYc=s$x}nJB
zpa4wIm5r5ZZM{tYLg`Ob2rqPR)K*vc-%6f76s0E(_*z|ye(U+D*m}+U<pJAka#NC|
zLf|_-QW3oJfRhg@^1|}2Tq<4vR^SkjqOW&D7fzp)hFVH2(56leYn^iHLGI^oO|s7}
zoWa1sv%TM4pxu|H*Ciy_wX#XDJ0~D~Z<2JJXoGa7)scF_oqoULK^-SpX$S;~8}!ZU
z`bx37zBYzXy%?Pq<OlQ$E1#l9n?&q1hXv7gP{c$Jq8+~=&e01fs@)4BKz(#UG_czM
zkk{VQ1^c~st4S9yaxV1sTrg(Gc5HfVa{^JWB+H0+0WT(Bw^+e6L`^2t@EwrU#Lno$
zt9#vtsx5jhn(a2GCQpq&{t!4#xkvCEZrABFhaDbp*scKTXg~~bogQyH(3_sDTux2w
zspu`hFBE)1&2RMPDknF5jHWafgxP)#G#~UR2?0Y6{6g;(h8?p3zR)8oP&#H?+?K-z
zrTdgwha~eDm<*C`@P}jrQHkvJhNJ`L@T{_lj$|H12Ht>I2PP~s2)o@p1am+R<=>)i
zfY-`ziqXLfMV&JWLsE^C7DZ!AcPZyw67+dQCpu;yHt?ltcBt{u=@Hh8QGdog(^Rd%
z^iZq!cp1@ZAkV-zz@~_55`O(n_ba>a?Y&ze_r02o)%f?`Ez4%CaG5z2S8>D|VGf&G
zgb`;aodgNL@(_z3e-y^sBIc8zBeH|ya_krNXeWlB@sx#vh$Ir7u$<_G-?$Cfd|6C2
znHoUN%j1N`S*Z$+2P@$&aTx<aMWqqXf9YMiJs3CG9t??@_lUm(J;}wp<6q$+isN-~
zAML2*o*$s_VV=H_8n0=rAsw#^`)psH^zeq<)l8TVLf#d<Ub|HK^c$bKg~*B9$OihX
z6*Og@)%(gkzk1CJ0Ec4F|IyO1z8+gTs>_v4r6p}5uyc6y0p-wcIK#8fo>JG7+FGub
z-&|f>D=v?fefsEmGw7-%#acB!!qQOSsEl!*j|AL@;jc(u{}E{k2o^*Q=@E-)=wlv9
zyj+4Exn{n7(d=MQXYAOes$@g~@tDebd9}I%U_L@CKW;@U2EOO`S1qlSH_9NFz*1Q&
zSE|)j*haWDoI@zWkR(zo)s}1Jm9>?X_1en%dZoHvDX+N8dCnwOOKY&@SX%=aYvuAf
z{<l(-pCyFHV!5=kQLSvO)HZ6BmF11~waW6!S_Gp~s;$*3tFZ5f%}aS>d9_lhaupH+
zXWCe+tZaY`Rj!pGUuAh2aW!DnVEePWy0*SiSzBMOt*tGuxYfLbz?q;eP<IVlTV2~&
zt*x%ELgQWFL`%v;7ynjD&=t!dt*x!EuYf4Ays}y;$NHsO0w~aVD{D2_a8)*zq4Sob
zHq}ZSwKCwcvJPS%^i8FVAY%PeEuofVZ38;Eva-GkQsVlm(Jw2d+Qu@-^5tq}xw^cz
zQmK^JxXDJptO6bt?Dw_hjVg>2pj0bE!zGO65^MuOOf0XJE31GBc5T(I*!{wkXRdol
zbsvEyBR(DQDm`cBqC{iOi<}_m0z<Z^Y~e>pB^f-(Yro9_lJttMgDAQuk9<warlZ|5
z9?n)Ikps*k*1bxM5l9<-(97Ri3C4bTr3}5cwq9GVESJ|-mq9FA)&nR<5cbTq^<^N)
zjp{0h@XJ8rHMgkxF3PtI6jffUu2hhyU?AZyN?Ead6@XU;7|_AXAn32I*Whs-$;--C
zE3GaAfv(qJNLOjYP+lo7C$g=S)>b!`H`b~!_^V|=Z@CPUBav;nv|20IY5;Jxva$-T
zu5Q32No1=4+kknzh9tDS0jR;0tt~6kH)$V+6LuskKu?v`<z<*rFqf*!ZgC@y9uOq#
zdCKd{8!)k<69G%?<3z<Pz@cHLt-yQ(h%0NjImJ#^ITQ&l17oRez(`fsme-M-u^ov{
z26BfyYqc7T+De5kK4Q0|48|(-E_QRd0s~Qo$BpG=zkndLQmbrKR;#P4z%qcrRbeve
zY&0|SajKVO>ZFq7iWH@6l7xDobua=O8`X_!75Hck*rr=ti=zW0v;x1?^|j^N^7`7!
z+Ij`Dtt3ee_{}Qt%C*`$kS2`L`YQB7Ez!Kyl^V1NSQ#+s)k?Ki2DX$&;u|nPz&$GK
z!0yV+z(cFG)Luo(1z6CI3a~%mEGz5DUIpS<MUn(=14CY^EZ0^yQiyUDumgUzyt-V2
z$qM}g8{KL-jVPh}fZeawun*TaHh@glS5|>2D=SGduK=Hffvh3<!g#LZR9#E71LjK&
z2m^8g5v?q*uETnn?B})8`szB&y&ALu)__`dWuuZ#<v3PA;ItwDhggPnV<p+ouu820
z0j%SaTV2Dx1L{lZ=atgN1~7;!E_Bd_HC!5bHpFL*BF}W5O*B}P&LY1=G61JMfCRaF
z;r+L2iBJfQ?0Q;gGkzYpWQrrug=EX`DusjIVz%1#s-;qBwLy@<@PbkZrBf-WY1jv8
zZaQhSJf$dFy{{<x%nb(x@f_q({CBS;j{OEKejzC|R$@}=#u%ZL!KHU-x=dPKMwzs>
zzET7R5SbC3T(}?^KPw%OWV}&{;c&dZvMF|8_`6Q<0lP63F9u~x%+unvT+UVUo7Gya
zSgoy$mzA3rUNx6cy0qF!{R<L_DNMTs;XpI5uPKU4^MX_^AYu0_@L#ncU{J0}2NOa<
z2nk^g{#%CsR^Y$YF*=y-q(H8|0zF3}4f?NLK~>8dW^hR21_8FR3>>t)f;q0QDG?b|
z3za|^B<C8nE40^UxgJ115k+L?QU%k`YtjA$J;&ndztisr{xy&(`_qL5hdlE0h{&a<
zd4bZIe?_{SYg7@SV#l6jkNJb+z}#Xb=k>J~!~j51xN+uztfG0bmC%Yv+_5`qRhb=|
zt2RJ=-l$`smpKg3GNLWR5YvA3I-#@${n_iZp{s9XF_>ML)h+QmEeib#b!(M=&<5&T
z*#UskBJ~2cljO}lOn}EqLIql=@rX|9;Jz5(aT$C=Hldbx*-uYVaHLTs>09eD2!$f>
zF5F+?V9IJytJaj`%k<E^$TO=aPHt0qq=zyD4gw83Ki1K}vk9IOlS&`jM)KgvUc&;9
zAqnvVv2l%Fq)Me<rQG-lc62qJ50>av&L=a{f`ZL>tbuTou~AFV$$(P?LN^jXRbcm3
zrJa$?PWh`_s`Eg0l5IlTMb%lHepT-oo!4ZF#&NGw^$2tjsfl>!3~5B*IH74{U9Rw6
zS`XeFSv{mFS(46~t7St^6H^eP?S~6XX^}K*r_N0W=PT(%B^gD-B1xIsq$VOHrcA=3
zai~E<h57-d!A8PHR+uCt9ISp-asxU0Q~H$#O_8V?YSdp2sN=|iv_^FRc~RNd#N-g0
zkgHb8L|P6F^RoF;UWs1Tm!s!3$|N_Tt7ReyCr^(1m&9^asz^g@YK~rY!I}XPb`nNi
zu>GgE3heq2poH#7sIV<lU~37imshJMa%=RmQLAdiYyisyV8tl2y2dXRkf3EDoB{Z$
zx}h7c)C}wE8=QM>xolPeqPMDI1*?!<R$X1@TnZ$Jt@HslhN`%Y;3}4`$d02TwdGaS
zJ3Ikn72>qQ5ntq4_*f4&u+oYebNs5`a$!|J)nv=m`?7vokx$_&4X<8tQf4MhNyWYN
zbo^pPWkX_|LT1Iagb$0X>jreVMIXba(=jcf5?arDN}F_oHeUL%PM;$2hj5JE5YMDM
zM43#N>q?r!m{!!tMdZqbM2ST?ss#6M>5BbN`Q6I?gF_J3FMR*QZ7zU~xBr0MdTk})
z|7CUN|K*$fm>)g!K?Vz8D>;z&gvbsPr3V~$lqPxT1r5Ep^!O|rc3pjSafVOc!*FmB
z_`~xH<{)N3l(|JoKI|O|A>~Yh!qA)MdqIZx?73HUr_~AybPdyp!=a;BIvv;$;eNM3
zp+dzX#`99oz#4%Qa^Ymq5#Z@YkkL6=f9sYgjzEtP;Q9w{t1z~D>LFD<^m*XleAD{P
z=5vvIS3fcm>-pefdSqJecZE)Wh#~Vj&Zqki&qE>vQ?==~ra+0%FwpuMD24sb!;KgH
zaqQPdg0^opy}K@U*{$#c4B{9fQbvZx-BDCH#*qQB%^7xN!q$jf%#pWIqDt`BLMDZy
z8Hom;biHG2Z%rI7THCg5o4dAc?{?R=ZQJgy-Cf(ZZQJet^u70-<mB9Yl1XOf!z7cH
zS!+$6--8I{m@{*8Il0)W&{xPHnj!^c7g5W(aMNz<1c^Ak&ReK2H<!Kn1RUQ5aX;c}
zHW0EtgmvG!z<~glih(u-=};&c5oRdcHaq9Vqn~hv;F(PW(jF(w7-|7xk;N?32K%1a
zNl|{jd)lYw??@k?eT2Ffs@sarcj#K*oujrm;_Vg}FYhgqV#QwhEZeA4yom1Mf`Ejw
z?@j5Cd7Ouc4(=!1m)&q<69I8O-eXp`KUNUu^NWm&IR@2)I{H?W#*W&E%AVRUdtpu2
zdmu&K(dW&lI@)P_E6Lyerb}AxOU2n9WXXRNIv4(F0Nzed4gR@eV&wkZaWGv+-KA?+
z{MIUN@Ot<vRvylu`!tE(Q38m~BZemV$(8;Tu&jhwlFc=-6GaYEPFY8{nEFA{U$*%9
zS2z3$(XVqvh_1RgS*eP)mi%oE0D@1DoNcV}{RlJqu1Xua7DLdf#SErrMMCR%0&lDa
zGx$Wc`c;~Uo<$;)L{v$O21qU^W6=aYiY5xY9?9m15X>AkowB2z!#M*Rg@45NK(cUG
z8;z|keNF!T%gw*pT6w4kLclt#>L}bW6HmcOLmBf+gpn`xjTSOSlpZ<HMZ2<Vkko=4
zV>lYvWaO|EDh2_L4N|xnXZbPC<}Xf9hQwc`N9p2aS!LUF{ZtwGIBHjtRrX}LP`4a5
zP~~z14WYy8a6c;+O!FBlO+Wl`o3-MNcJ`|lab!DMsV){+MaHnsXeB$^6mJ#Y)qIth
zUO_ITimE7m<2kjPX0>kCfa&o2WzjKEG^LWRlk`YB6XRClw9g?j+0rpCcE@g=B$KLr
zXABR@r$I?*<M-+pP$t=$$yD?<accR^5NYgKt1zqH7x6T!7}>2yd6AU*E?v>&&pnRG
zM49NKX-&Jo;p>U=>@+58rOj14aupm!>w-C1!>1fIX&JG3vBi2%XX-LtUIy>%NST>|
zH&tO@w6nK68No#X3vyCc$YsO_Xf|4+qjMu0@eR<4Zc_Vkf>>Dz+&A*i>Y%n#uPPTG
z7R7+B1OY_7=vN!Lx5q=m1+WoHAiwS}G)2R*46tmsNXuTP#ofWu0Nc?;)IEkWSyGE$
z=Q3FXOL6<7=V(K?`Ih)r)r|~Lqvi&qE6OAtDXmZ5ED^Tz_JU=tdA7!30i1|Z*pj#$
z%70jQGLi=tP-Zxs?8c=1LRDSmnG`S&6(=KG^4un<B(A!AZ^;h@rBKsh-TdrWz>?oQ
zNur$FN@`yvlrZo;w$`F>NfeRrtRp6QGe@ERP!tIFn_Bzzm(`uu4A35Ne@$x@R2kP(
zGm>Tn0-`C1OLnYKq$Lk1iOr<5f=$G|Cq-3P6{?F4e;~t6fhP)fMLCjtYSh994B5L4
zj?7{ACVRG9(JJoKLrot|nzTtA|KX+IUs!)G<Mt@mNG>U@;XWb%Ol9SI#hk<o>A*Pa
z$KNpE)nr5*0eWw)?*z+WzNC7jz5y%hD9?G7tN??Z<FcF=_KzH+Z~*cKNNnoX6iC^;
z{A)6AFQus#K`KM8_;>URpix7xx@X<vPxi1xgwvy>0k$R>EnX9kevlEirM!KvqzG`o
zJec^>!xfpUqD2~9XKwH?{g(@%?k6X;IcUJveNB|yY6qLn!56{tZ<aveZW68L^%w1R
z6!NWUDvz_(E|vf)Jk?j9*e(x!Aj-|v<!D=nR?I5ks%xE_i)+1_FekfnTd>Jc<i^*(
zPnU;h4f|EE)=~o{M4W{*_xKK_z?B~#T&@9#Hz&aDEc2F(L!3#Cv;!8F+OzH^1B#Ab
z;M8smj&TFj2-}NR6uCU^8tZo7$Zz$u_dNQA>iuWUC@r$E&Q^h*wDWn^z}Le2+4fk4
z@W%TA;Hre8XPw*Iqt0S(FrDik5jK~eVUH;O0{UEmi<vpP-b>|EStr-8;ceH}L{Ot^
z^^n}TvN}PmefDI8e>ohHK-}(IMjDU0qv*y=P*+2qT(>+}r~z<uPFO8LgPFbb=TTEE
zHK56Zm@p`p&9}&8vJ7D_Z6$<8gP8fPppX<Vb<q2nS!pJ6H45k@7keUcPmFPHvpw7~
z-UNDKIcCMbxp{7`FIKVvEo=n@zW1JWI4(R-_N%sDD}q}gB+lW-I;j^tQ@s{Ei7eI&
zkk*Ue2nVd7m&3QZ)|AJi4_y{^`pSU(-kO|t7><yr&MDY{7K5>F?#ZY7eM)Z93pCIo
z#Knh&B8e{OE6L=HP3OdjBX4BE4&jxdVSOM-altiF43mjQA%TAcOMTymRs5aweBkF?
ztZ2t!zP0WSUYCLpNtJJ_Z|j#}6eN>dIu0n$lR^Qi?eaIBq*_9!7lz!u%-ICCxyW=M
zoo+HG<dzapytt+xr<25K5|BXnR5(krD;gB4-yOW=1MR?rUNPBnYBoRc6jmtMbifwR
z_5$wg`T-|3n{XCrm%H%bjrMdeawdC-iPpjxwYX?R+vJt|*egmM(i^B?l?bcaG4jP$
ztL_rTq#sVhdmW|)(51rqFYjL$4l>o0dsx>tjRGb@2+w&&q4g<9XYGHZh+7jO%BV`D
zz18+2@WPpRk?9Gkdca*e0t7`xypp5G!nNA2S~g5Eaq$*l)7<qf9o|YZu&EnEV}6nd
zJ$C=BAB)Ry?wRK>`6=2h+N=3B1q<Q@*R>CLE2quPCXhoduGP{@74jNU-%3^tMh%L}
z{IY}lUHm)zlChIqiUP4_L0Pbr?B1L=LpGpAd7e=_ITK}#{A~W~56k;WwEx0CN85gq
zNrqjB(G-U_QSL<Y*zh=I&WoAT@Fko55_4y1|66}T90TU^UlXv{<;jnRt*H4_5oA<h
z5pO_gDt1DKOdC1JAsZ}7P0rZlGDkX}mDjpw218Q=y2yDauWl4-neo}2s3+Dz&r~^0
zr3#DIe(lu0P@I0hZ6YyaEuL0OxhB4ma?O<Ts$rKe7@r-yLUFExzC=7d506{X?928*
zLqFxI4UXBQ4T7D!m8K<ZSUf2$T3{nf*?|@$*mvdPfcCKJf7GbTpsIbQpkxiVTjIWW
z!^5}HBRudkBD-7={*dB~IpK7L*itMJrDyFD2qww}MaFTZXHGXb02T0nbny{3eSn6(
zo=(IFK({9O59|L+81$Ro|391W!)qR$c!>n?(oWTBs8i(<J1gIwZi%rtOm<~P!uK(a
z8SCk`?hs4}r^MaG@~t2*+IBXAH70CGnE+QkmIsz>&6aKRdW<V6!Ec00%i1^u{nqZi
znzWU1T+6--s~Gj>`u1%9h^LgS+k$<Dp0Rj=<ag^Ew12Qu<N_0kTQ%sGbCwwGJtAs{
zb7MM_!IN@J0cIDg&D;nhm}_i(2qbwyjNnFJNea}yd=0P67%TuOY6KsiLM{Z|0P%?L
z>bahYGa~gg@JlrDej_M2n~Z{z=EHn#zb>~=8gw*>fw2>-5G%27ziLH>UXcQ2YC24H
zn97iGX``+>rSjwve}aHAkZJ#Am?ii(KOp@88mo|Tmi{svl@UXd<Dxlw)n#XL6T>($
zy*+hB8=!O;&mn(#7-qTn!HfUBlF27XN&QpFB=?m^(UX=ZYo9rL{GXM~+5ak;b^lc|
z8UCweswj(D`BCwe;(js{Atjs*Yufag=t>B0`5{cK>83ufOg?i4OkvWd7*}gjW71|t
zDqx};Fwh9-s(N$sk|-Byi_agBZ(9Kr{tj*2FjHOvCYp~N`MwQG+W9sBeo=(8<MN=c
zOn8XW&e^yc_{s%JFt!(b9)|`jlcdGWle?ui4Ra%VPDsW90_Q>W6+0R`#U3&~NIvEz
z{Qvj{nkc*p+qmE9F!tgaq^9Zn#Y;0Z%wyJ7xw&TS#D@G{x^n5Plf@Kp;xA^dcW%Di
zyuJvvzc*uHW$OTy^cpM14}?X}lgEG`TI!?U&uNnda4rD;*YL&V$xkMV&BV7bWI4X%
zQ1-n7+1*qQaLzqx7Kh+H1PiITNxO?;i>SA$2i)oqgoiPmG^TxuVDt=n5Gb{U>x$cJ
zKfOipj`|1+zJlHVh)^}8bU44NxIIo_z%PMeq=MZ=ax)+4{W0V|UV;Vs{kTbccX{}a
z%dihf1dp2~f2OxJ1NZK5)+IpM^~EqW8Da(WS<a@y#L|FJWni3*-Ik7Qti!R%_#d&J
zv&b-h+msQ~I2GNN5hT8;2ra}mBg00P;D#Udv!U`09*Vf&9CN$<u3yTzXZ;@hY#Bg^
z9>sL`*cmKyzuyxJY&u5iuS1#g6mN>vRzq?pBIJaW-za{y&5<jDVPwwY3*uZXNm5}7
zTD<xSe@1C5ntVV|?qrFNb@az7-b;e*k(uVAP~}MzpAn=;DAm=*a`C2c@&}gVM9jn7
zUSE$!8fEeo&mN>&`l9s#jffg)^~6&h>RuU|s!A#xiEdG10{+Wl`8N7oN8vv+oU}4!
zwD3JN<%?1x0S9`lYiMYA;bXi`_KZTpG<OWNeh&t(2;tJVJMlp1AiQl{cp8=oN>pzr
zx>un9MAJ1|@W!M+=<&P8OtoJ`FVNb_tx7=Oi9yeMnpp0CL1w{M&g^aHlNik!vd8mG
zcN5VlplG!yqgRDzjv?vDvSiRQ?)KDB*whswn1B7n)$BP>$KO&v?ss+b*Dg5T#VMm2
z8(^y1ULHjr(Hug5t!*Dd%{(SXV-yh6yg?9CQuU(^X^2=F9EtqKipvc)xPxMdEI=EL
zjdE89n*ikk2W_DwP_dLYhdYyRQUfY-J18+8#MWVwfP#pgNrR$|nEhf3IL6zC%o<Y#
z)=AE%azj5vF{Js+v?4*X_xOl12wgWi00DIYTpp9f#!SVQrq!uiJxHqA^XPdT8expm
zf>x+`nJ!cso+wq$BwPUDU7!H2j|c=F6$rck(gTmI!rQ|EJRvQPdQ)AesSV}}&7wW>
z@^KzK)f-J!%0(a?65oGlgiL1YdlK-0Z_-*I5A0839#2vq$#dogG2!ybu*E7#Chja4
z^qvXNHtY52P7_;L>_|;jLbz>ldC+Fyrcars#S>UEuyz!vNgcivs7cxi>2K3aWOWPV
zNArrwqDnO4DQw+~YF_dCWj`WPU<W*#qfgE(eJ^DJaR~g<?RVwuU9D)fG#*U)(m4x1
zHAKV*jA><4bv^fmjXS0K*yPlH!ed+?G5e+}M!1mU!fkuSATRxfFr!QhriDI7pY|e#
zlrxV@^yN^XhCm^&54C4;$>Yw0o5sh@(*62km=Nk!PujurPV-XA+S?81+tjq5`H5iT
zL*Clk%;l$r>o@C<jNtfrhe*5x*Y5#x<G#ac!>2a7@uNn|b*H&)%dKO{c4gW4c<Xn}
zRm;kH^RqUs(aV-?ZFM!fG2tu%ZhloW?viWfR%`OD@>O@rlR@UzOSzrq&iL@VRYxaF
z<45kA&(79$7I0c~&b1?$OPAuBB7hLmr}L;agmew!PkE`!?d0=^Lc>>XDiDR1p91%E
zYaIY$x<`v%U48bkL%qs|MqN*}>R-90gHrvrQt3`pc=3i$<&NG9U}9ndcfkti+8)rM
zn{@^F(YUt&@~!|DAAq%QzyCF~`|*7KVPJsf3#{?@Ygb!a0uNIIa|~Yq>2^!4N}d8~
zUxjW+_Izypu4Ugm+`5Tz?Fe~6B~*soUCchdhr;*Yu>K(%vRjmbrk??s^Y~{V?B0}u
z5^eWDcXo$c`NtUBs4!m?8c&N2MMp)x#m<9_h8zN4`~6`|YuzxBUj=BSqJ99**VoUj
z0Y4l@AsR<jCy(a206jEo`hbY1&N>+mu6aLZ+j|E7Fjrua%{q?kW5`b4>-!`7_QbC8
z-HiHWlI>OhD_LLKL@U#4&$unb6Hkw$<=H@WzsGV;0%JTRI-a{?X@Tl(r&i2LHM(iB
zZS*ox|1FMwt6re@1Qkh83=faNORUE7Y|d=e>8GKVM^&F3lUK8WHPSce7Cw>CI?F%$
zlD`Eb?_G}M1nw!gSDcCbJQhSj{)|>EC!3M0ex9i)jhWaa*CMw~hm9Ig1^tbNP|F}t
zjXFTFS(g`gVQp5C+2|o>nfxLU=Lz(o<o-a+3H?#2>oMDR#`e}J_un9P*1SY;+)GAZ
z=Ci_>hp<0~=E&FN!FdP!<YL<Rv%@hdqo<@S-wX?V<AaiHX#>0<A&F400UCdnwC4dM
zbl)>S$M&&@_3K9V$L1d}{Xd5vOE-Y1=p&$fXJQt&j?cU{p%*>9Zv*;Ia9topFRxJs
zKXS^iI;7ivFHqQ0D7*Z|j{W{V@IU_3ll}8zQsG}MZ}>)r>B-yuKn?os;@cp{2cn{q
zo+1NG?aefo#8UqLX-h}%{>R7^>Ey}tAMSo_?Xm`YcQ^!=XUg|D`6DuVZBkbO*MEAA
zA;Qmaro2M_z9-M%M?=a2sG7i#PDpWMtjky@wJTP#J#(f$!C;kCzl;}EwfBtr9BXrq
zfn4qGZIdFf^leCzMQcuiqS1O$b{>$WN8m-^n5~^PK=M0DQefgC1lJ<kF6ThjOU+P4
zL_}Ze^Ixc?KuU)-<)MJ&rE|DgF#T0v)s<F765J2q+^;vn1nWWb@>th(2u1=>oU_;t
z1%s+(#a~L=e{dUZjiT0h$K5=qmF|qcjY?PwTCqH8DLQ)c0eBP4Ff3*&@lwcvZq9F^
zRWbDeQv1i6h2=4cN@~(dDRUPdLGArqWwf9ivymrOo1?s)$kNH*eJS~S1=|i@CqYqA
zt+|-Otshaf|K^%ohMe3KU$pU5lZyoH%#cV*-MR=?bR-rFyoP<l1mbt@24T4jCHGW$
z0<lVC!&%9;>j`-XL-#exj>=smwk*WAa<3R5PQUd2DZW*Q&qg}O0Z@7=Y(JYniH9Aq
zU(4IhR12ruRW-hfhYwL+B2$z-EdRCFch<M7Z)sAeJm~z=>#*_Y9JAaEKlcm3RLy4~
zW=s;q%LNLzwP0<awgpoScUU4YF*mCDTwbI)vRiRk+Hl@FZ>t%|B*2ks-1(dIQSCY6
zJF(ThV^#D)pElvJ&FAewH(rwRxvz0LvO#3?Y+~amxUBqv%-p`DnwN;-{?V>nL=IO>
z+avO^QV)t$a|?uYfG^dS@^o~x)O>VwuWeJ^S>K?nRV}naxM|K2BP4IDTPsQ9&)mo$
zrqGX<e&!-7aD48R#6hsS{O1mGHpR-}Tb$1WWNAB+G5WXExXU@%91#R+I7A~>)U!>-
zvgF||C!A8AN+pg@wktFr{GanPw8^RIo`jW-IaGz{OVSaJ3PR(nvhkX=gsC<vjmDkw
zovTkj6|#Pv6=r>aL1p2zU@4$>$^5RTdrU!xJv;jnKW{m&%fq4J$A0PG`M4E{zh2|U
z47?$wI#NuaKjvz|zY`Zv|1D+VWNC8r`D;2>$c|#3TofL0cRopLMdJb4!%??*T%o>~
zP8YiIZDOk9YhK)uot7#-JvdU|>)1)MBA`%yY{+;cjNco(l`Gyx(@<mKbHEZ}#*>-Y
zPJ+Q63FvWkz*@p~L;EV@CPEX&oPBPiRJ;fTYBWM@7d0ymtm8_MsCW1=-f@O(1by~g
zw_Qe}6tZj@u5q@t-ZP}D2CnD4Ba8}E4aE3jD-MM#cYLaDN#nKePReLf2Zu{v=_Z-N
zAQ`OT5ennzVm5XriZa%Vf-SHl8#C+WCBoPLRD{37LOc1{P5G!@$##+B5qI$LHsNht
z(5|9~viB5z2{6k@yl_sV7PVsU9sig$7kRA(ht;)|1+8Gq0^djp^W~syvYqk+Ybun1
zxCy{>iC&F4@0MC#s)#c|Ga%e}KJNC@DMVitT|mF;#S!R&<`QgB@5bQ$3~)9qd*uRt
zI_lp4=Gp(xd`^?SMatg6y?O)Q_78|>^+wE<seLQ<I(7b*u_>iU$5gL8@D;{ErauNG
zXXjQO0;S=9ojinFmQfDKI(?`MOVbA21=_4Fa~1S&2m2i61#|@^@o@GWsl^p+Ry(;i
z=6{AbZKM+G!5^XlK0NHJma{&Eb3Q!es|hA{fj)ox1Tru#*>Y}GMdWUR!8VzbHhBzH
z>`juoStHzeO-jGgVc2lfO9K-QnM*;2uu22{!XT*Bnc+VZz*r%=jR{oxdPD$Ju8F~f
zwYvvkz9hp;DRD`s-v?l&B*XTpmi}=^bjEC688FX_;TwGBIIAWe(O6TzO9S~`@>Vw~
zpm~A4wQX5rkG!)*?+DAxxDQ^Z*_vfX+=iL*Dro-wQ9*;uEKNM)n#JN^QzLh~Vi<}_
zOd0(1=JTmue4)DnNvb(_lVm=8bMQirafwBl3GvKjxg2Q2T38{Z5Y;jjRtn57Kiw>}
zVf~wCcEL4#DkL!<wQj_rKuVP*V%m>z#G4{v46Rq<AsgD61^%)EISzRotxm!z9Xk2H
z=?9rO4eHxi8S^LEA+H)K)X@SN41g^(XHaNl)D&lybc_sQog%S<NFkz0j$}cIK#GKU
zlp{bE++%#ZZj2O~8`u+$5?cX3sr-Ebi-RSXtJI$_lWTZxn9aXTgj*a(1&BZn=YYxt
zr+2|cESibp9=^#4k1{-;Uzo?T)7=Fog!1$)|CLK=FxWO}q-k~pnv}vhO0*P0fczXI
zLl)LMTgVusRnp9ASH(3-jG>|zm8aVQj5S-7c|d9uaYRWL&pXhx6hu&+30s17K{yZN
zjcZO8+^5Q(CDy7mNWf-haEt<)UpTpP!sHEZ?KJL?wQ>Sgk{~kffR*BrEH4A%olC&v
zm%?pEg}*|CXW)!1s5f37a{%S*q-t;3Whz*n6p+H~0aqZld|~<?*<siL6$OI8m_;eD
zVCqbCQN~%mLX`J^t9<D4uqD`kHqc^$;%!c{#%5iZFsy8?xN!R=pE-tB64#iyzWoi0
zD+hePu6rJa^c(xTtCc$WwQLk2upkQ^=<k*DuN9D0$%%NvwPQO|?i3>QC}2LgiqC^u
zSsFl{l$n<}O`<ANR~vQ4KHIAe-$W5d42?V?B~vq#?S7f1S|Wj|&@*(Cwow0P<-9?-
z+iQ+}vd0OwKkr0j>Wb|_2v~bnuVpLod^lSHFL{YKp(@7k75%}$XPnZ(=L(MbAE4^`
zSj1)$s6WX7#{oP-iv?B{<D(3=Xr7riqe0mPMAG9}_=7A0;&2U&)yjxL&dlFQ5JGO_
zdc61(@|Tb93XQcnUmONIu3iHS+bCB#9azRoh#;JoMWm?C&;4W0OF9OfP>j;Iu^K)8
zv<vj*xf_G;AlL;;Tf`Kjd8|&s1lz0Fp-%#EjKfNFt7ChRh&~=_#$&4#k~J7CuAU2o
z&k(l-5b&%EcaaT$bLi5Y9$n&B+|<!ia;|fLxG%dl1t*&yGKr3wN$y`uQ8#ooz4%$*
z@oG<w37S#;Ul8&nJZ9#Gghnje@EH!Dwb#)zaym1rfEizp;fT*=R8f6r>W$j;s4Qlo
zvg}T-l$rh++WzYj-hIsEtY9+MDh;5rOn(;*Y68mSruZeASnhR|{YTbk=wPe!C`kTf
z2D|YA4F#Oy*+HBHa!8AtT<0(&C_^H48%tdrgb7u$+{+<egoSuM@|OMP_XE4nzw)o0
z?aG{>prWn!sG<W6-m<5ak&m!4Mn|kewe7FmDDyA;0@Gqp#a-?+EIRxzNp@S&6-x*K
zUgf6a)Ix?_Wn(4vhLlWNaY2<dW+^hI@Jt(d{>Hu22CCFBin#1Ib<fTPv<<ceHrO1!
z!w-laoh`tHZ|A^OPsF!@hWfYzz%Qk_`Tp|zN5(t%c<Ed9lATNFs=LBOdLA-asW{Jd
z*Y49Pf7MSIwrPG(hfWxFJ&XRxeqSW6?+ns<P{7zo@Yw^pX~Sh-J6E4S^FvASoQmqb
zk&4S98L0sdzzZW<2=68YlJdlVj5!Y3n}vTMC)W2&vt>Nnrgw%M@I8cLJeCH>S%IIq
zDDVW*3TYS;^yB!-hR(=U3ArykcoMK)^VqJ?|IH10!ukCyb{r6Rs@dX?_&AfF&rF3>
z*SR<K`{YT$gQ=nOjfqHmF`tZCKNytm-b8=-S3d?B%1DggA}KVXq@&ECB9xJ~57K6K
z2kL#XnIhL?*j#I%79C$%)!%B4Ged>ltPPvCY7FjqWUA>4>sfld25%taZ~qoMsIe}B
zHej!yrw@c)k{MzCv@by;3lI6Q!VJj5HHVyBtml|tlJb9d?#H80JuyWw-44@c&$jG^
zsZLtad5CS{J>`V{5D7dQ=GRSvk6&JH&yb#9^K#<vScb4%2cgxHNpZU@aSD~c{fo<K
z-#8mqW;G`+CM~;$gK#&hs#%t$@y|FaqKT@tnYn7ZCn6X+4kYe$fm|U1nw$bI1LT9#
z_8#@SXgi?oQ7?L+sr7~8Thgqb{SIy+xr?5oz~Mms2Omd(EO+53s#@wu)sGRPFqjVW
zx%#E)9qFz^195~ygw?J++1d#ua^QK5o;HkeRAilA{LEn{;zVPVh%>ngi<LeGvCf-T
z9w2H!iW^Q}h^G|QGOUX7<lR7$yHmlAZ9)-E9OcGL5=2!@%v#1H;kKBnX1j{3rR-`{
zwV%AK#a6~|pJkH_XQfJN0<=4J%g1lVTY%JrLRE4FzDFcX8;L@^BG}^bVme=$EkNY&
z_9eqf!|xa>Jr#GpXw01BSaz{r-sg6;o6yBu;RT;z1m>XBLlKICnPADoG1spNi5<tU
z>ZA&X!A8j$K8kgDRZ0H*7|om;%wUckz(9;D!Fjx%Jr0tqAPPRXBle|mDB_Etmn&#-
zLlc~f<*w(<y)!aYeW4o#BgudIoT{6n0uA;m%9)dB%CDeuv1fa5-5^kj-}Z|;wCmrS
zJjxoCczAz+n05#ke_^^IQ7N^>rt?vA(kc%c=ZRV}u-@Q6d%(DylQ_kF)<o~Yhz<ut
zk;RU|CiSP@fuDNiMT#Y75bA*+Lz>A)&$_k?2H+s;)BJnK;{VfnJU$iBislFW#u=4v
zWum{eD#W!AcbCF%Jrr{)MeRn^O=nFWvZBA&dROnR#CegwP!FaCX5>TxgP&MI0?1#D
zdN#G}xG|71-`wZ8%dNVW%{gkH98uqIloEhL|F9)(BVD?o4sn3$92&N3weg@bTR-16
z{p-nTZ&Jv3X3g$&f#8&3JebcE40uI8AP)RHJ5rkh>^nP_YIyi7+xC)D>?_+U+z$Bx
z75m$~M7zowjdm!-*i6OYv~Yh^Y$zZq@*o!GZ7fQ{b5P;KZRHE#=u+~m_5%3xqq_LP
zW&cn0#Se5a^#Y(0FS!96rLBJZO|1hoCQP0Ie-2&%xHi$)JMz~6PRUhWOUh>ed#vz|
z<Tc=~b@_Mk6(Hwn?!&LFOL>Eex4G%d4>Y)6yt*s51z=#KPBU>)S^dA^Bt0YFgg?7A
ztJb6+`1XT;21JTrqDwH)An2;%xh;O@VaC<|1JtUnaC9Gk6Mj$rC`ESvFG`Ujtdwp*
zn!)8)PuEv1oz4be-6j^W@y7;@LMP%%u$1$_GXUpmd4tGrIdKFKgPthfvv%jF=9gsy
z032QkS|8Kg1By7++_t_YIy%ooe|*xi!q}&u0e%@@0M$blBY+^e+9x<V(C8hf(Ls-H
z)!bW;@toLDVpJqJCi(<^GvH+C;NlW6Fk8KSjr02Y<@Y209KQMS<5~Xue|@|zFM$6E
zd#hvhqm^)gAi98l)aDMzKKoPl>H6#e1$lw<^<Nc4HPY^~+r|$hdYI-K6FRyKj*aQ7
zO%LZ~6U!d;YD0-J#2g(~U*4rSnj+IIi4Z){{(}R%hBmSHgdyvMB<pY*%~p#<ZSb$x
zy%|5!-n8t>b!--AB;|jR=HvBXK+tq0x}o{<9WnWdf#?Z@(z71ACYa2h-}MwKGOPSk
z7k3belTkXH5>jqdEA<Du=C{8(;;hIp!4C}X@12CvWi(RIyids^i;D1BtE|V!(HY>M
z9H32O*mDgbFOlEFaC${#ZyT)~^MiPASEyddm$b{j3S$mnzEjwZ3<NF^I%@oJv*d+j
zf>t>H2s=fRU%b$xx{R=Gt?6JaL&3}moUU7?n$2+_c2;J6Uymd}4&(EDXLi)b7<3Wd
zL>nxthVyB|*eFDBDTGY(JQb#JZj{ZlJuG87b$4mKS^CReo~6p2y_b{`Fu`%>rRLkC
zy2Fbj6vZy(`u0aKen=45^FTm<JZ^=;^xHEgzLI&-NPcW)*7Q8CW7(TjaQrU#`h&%o
z0f_cA7`f}wI?zb#FJZe#ya^D0PZSc<3HPLndCt6W@yf;SC25?<iEVA{+C`ntRLB*>
zzp6h7HA}A`KzlY?BKT;ciUEMXn~vX-qBI}V_@lxRXgHzLV2}|yx>AXwaf&W?)cbeW
zifCd_t;(kr2!G`#^_d$;O=dg}BgEbJBYJPjzd~9^;_6+TfIW?wDMNs#L?pqDO2bD~
za|K5cga|7fA5Y59h_u?JHp!ZR8kH)8XatOcK!%@Xf*VC&y4`;{A@*R@BvGRkpXXD7
z8##0Qc+O=`W=nJNPrY&l_-GpO12sFC2%~lxwGtCkGoAXYmy$LvO|HPB4v|@>BlSi>
zcEZW0vxFydTN*aPu<ye9(9B*6qgAb`BK6ErEb399xtw#R%Qocl$`x<ywKYM-3oTx}
z`Wl>7z;{M?Mjgy)j9SrA79q-fiag)l$fEXu_N#5yi^PO;6=O+`oJC)};m51SBo}kU
za()pMr0`7ZUgfQ79N7DPy7Nqr|2^$#5zGcO?^HhmK<BTv*1<2qK6>u&wKu<O+dI`W
z&i<3ZQQu!h2I&x$lA&+Fx2|-a^7KJ&PQLf`UgRXXod;`3J+_Aq3HxFtw@$W>V|Ye}
zrKN6Qa~)FV`usLAI}PK(I*gt%P7wI5u)&hHqcBrU!ZH@^@2b+CmJ7xz6jBS1R#cLH
zQ&(#ewisiSbpR|x!{@fSy)(-Blyl|B`6D({X$XvX?xDSV>(R~K0(^1wtiA1Ae%iTy
zbMgYRasX4)0P_>So$YVTp>kx1-g}izP|Zp3)%SGT-js27Qo}P13J=J(C9969VeNUS
zwmDng2%Uk6Phh{wopGo(<v+G<l@}ANq`QJ!Q0}gf?&hF;9iX2~6uqMloB<=4v=>9t
z^&o&9RoV9PbVnuTy+Y%5(kXurXlx5e?~Yf6po<PL|IE6d4=D}wmw}mCDd6KL0Rb@3
zn-~xc#oIP<z8Q{`66g&k?S%$+u!zATjW^^-1Feob+ugt(yxCb%QZ$FuMtpe<F+gxx
z2m`{w(AL#An}XJj;?Fh8g4-?Vf0eXwGeK_)^+7j3_4I2UjI@r{Z`Cp)_QJcjc_J+m
zWcAIX%XPO7!4b-kA6L*J<Y|tg;t0IAkeAcjN+zU4Pgpqx`W~cv#cxZnN{!X2gUJ5!
z<{EENK?n;HI`!a)XkmC4M!Iemf=+_+i8GAR^*Qe1_PN$ufb}HI<rHQFmMXGubMT(B
z_64yXk59M^Z`JG<C+iBKE*O?+Fir%q_o4=m_ZtaS-3$h#NcIA=6O|fWKVb>fQlG`V
zpi*bhqXG+7;M3hq>A~8KZ4d8-AMMh369N(Cg`WoM`_4Gs_s;)67JT*8LnR(F3m8{u
z`F3;h@x(-GfgIJ={kXWt-xp^A5zW+Y6Mx@V??@>9(i`v^hhNAV{A%vG_B8YG34U%>
zv#sH_dBo#h_@34k+MEL)<N`M>Xejs=M0j@xuL~hPgJM@zk$Dv?1Nqk96q1zzN^0s=
ziG8qn>>d5!)L2==9@MUHsYrLJuU_g)#KuH_z^?#54k6Qn<+B9D0h0Tp5?4At2%P%A
z{r<IR$6Ns>XqPeoVRrXkk8$Ly(exph8M3Gx2m6#|dtYFcq7Zg4Y>eLKzSr#Qevu~t
z0e5{rV3g~|oGrg4#OFNxpj&8F*Y^k4XUd*CuicNJJRW^gnUI!QHau4}-wqq$z0Zfd
zyPLEr<RgrS^ELP!3Pq0VV<QVm9pUDbcc}|GH>0v!W5AWd`P1ob$SJSU=-uH{$c*{!
z6D0WRD-fR@Q6>V;zy0GRk_k6k`#f+Rr&fu8<F{o*+dah%ymrtge|Q<}HH4xX9zNR{
zKY}PkS-*PRfV7o8Z31ihF!``^O(?nirnDHfLYi6`InLdU={tP<^p_jaXV33OEenhT
zREyfi!qdSX;<nQdJ7ZYp^9)e-7H+OUbGZ<-U7%>^Ww($Fgodj*GtkpXBKrY>%dayC
zG*=>RG{jINAI0(A(-ozYdcEmj!cGA}4Hg?XNZFaC=y5Ps-ti$umMrhSEpC+gPX(RA
zqsr;rxX36H``ZSpcVht%6EgALx`B!M>rjv3t9^@vt?g}$hdf9FFg{Z?7cmV}KbRnj
zDU44TZ*C6zxIt)IulTlp*w%#vHpJj+9$0qvXKI+-4>;Ux{NM7w9Ba3Z73Zm|LGC*t
zp>Jqpmw}j!BGbWWpL|eqCCogvZ2~ez6m~avjj1k3iy3vHX)=?T!Gu2VLEXUY{9}NI
z1E<s47QEUHm+pR2u@#0V6o}@qcRm7kmUr&Nd>A8MHNy%0RLxMG*xos6?|8O&1IRP&
zi~7EyJwGW;dyVvjk2!~kRZ5e%J-WrdM2mzZ2d4cg=RO6A1Jq;RX2jny^?&8J&v=sf
z8l^G>GhZA#{X4yKAg^t(wi%oEJU^cwW(%30)6ur%UvsfE(HA*8rPuOQ>Uv1#6Y~W9
z*L@ONU?0?r$l(#GPp?&Ek8xmRu~t>i_f>BN?1fqwi*VTer+7Ve11lFZSciu(qG=8|
z{iHgS3L|Hik8c8G308%Jl<iWw#>k<P=-=-8+P#-81?w$jtks(rQ9Kb2j^sNDfkaOA
zPSN$-y?}`B_-T~=DX<$<*j5edruBTj?K;zsBUJe^BREdGTt}`bL6y@&4R0#sp{{w4
zIl*o$p-s1Rj^gwvHfaag>B~%NTX*da)*Inl=zn7GkL7@0-|Oqre?JW>_Vj93-w3_+
zYNieWc6VNnhy@%#af1`YEUhwStb?dRNS^&!_Pef8LYQ^+&cg2hoIwz!LJ+kxfybxF
zG7k2L!-s)HwtkJsTr(o>gy-z_mXVihYj64Ez4oL_q>m3n4D)Yl((fL4)@#?O4n_64
z2xliqpfMVzwjLI&`PNqKO2VQ^l}n@a4#?6~BXEUNMuR~aPM=LWtzNk6#UboJGDF^5
zY&xP91`!CH7dds}u8INC#QAel`t8q=em+`ZYd-qU;JV9?e2B8A9+oMU02Ns<ECT%&
z0QIN|qjcU9Knuy8;qz;Bs_SrSXw_Sr|6s`gD@2Z6uk_3Lp@7RK1{WJE^kzQhCFNc8
z`~duyg!lpwbFdh2NYIW9?S;Y|z6qELM&AYuPoYFgYI)z9M&dLa2_EOVw~nvJyM`}I
z4>q5-lAQ>f`;HZVqk~U-?*wOeQyFVM^U3>tM~Zxs{JXOOx*pj%0O}9&L^vsi;sts>
zq~Ph$=fLpO><%J3ftO!o9A^qpzu||mN;pp?Dba?U>hp;itQmKAz+Yji9|E8d;?5Zn
zV{@0z*hJ_-$tpT$3NE!CA7<sZj$f#t1jqN58*jq4pNw-e<#!c>%S7YhO$naVZWN8o
z#!R#8wlAz1O)(Y;5>QxH<@Dn``;hSozlo^#3T$`%p>RReTn&vwjOFOy2mC2a31ymO
zpinTku0k5^9&~2erzgUs{Ot6EFv;#MgP3l@5rtUkrZ_|OA={;2(_RZ8*%<VO?c;XW
zj=6b8fjkqp)PaP48<oZ~*Jj7R;~e)x9-F|Qn)4BUq3I_VdfY)D4>jie)}O?6BBLEL
z%O*?a{dndlCW-`})G1iM6`(Z){Zj8Tr_Y>k2qzE)9sHH7e<Nn#`4}-ZP!+kcA9kz1
zMB?A5uigA=CM<`%#II-<Tkf!GO_#6<84dPbd){P$cwpi^jkBSwW-ws4WzE=D*BcIY
zc<F7HYYsbQ1Uurs4emsm43br>bDAx!Zr#7r*r;oHcS%PGX^ocP$U3^R@sL9QHr#<D
zxsV;u0<IN7afx`WDi=RiBXhhqK1n?Ja_3zlHl45J)l*_6W?q;l5ik=eI0zJ8PL9T*
zYTUPpvwju*LOmH~tb&+2S<FKB+a?%Z8f4xS9n?5TDD*X4x4u9IpM~*Cmz$F~YgKeX
z(F){((yP2ifS)IIVnMJa;mL}o;bHbXiBxVMq+x>o)51umGr!p5(@loSGb<tmo|4_G
znVHCX8>XMoZ<IK)pt&x@=OsiVNWvH}1pWCz>sjRFK<_;2JY*RU7C>-5%ZbRd(YIx|
z0J}8}zwzBWe+E$p^4(LQP&Ek)jG!~yj{}{-sDuN$mIL=|v=~$@IQHP_cZy{lH{_y5
z@VO$x#8s=9&q;7o^OJ!a!uQZ~y<8X`O2S{%x*=9NH$|Z%s;sS+LzL(!ZlQ=&r}*n)
z@#OIWeCbxfHlwrp<QbuTS9Q}yr%0iKM_9y6A8@DF$RBqOAINTi@Y=q=zf-{G$vAlc
zkX*87chlArXcdAS;$8yA&^7#{x>r{7@`G7!Q4?DaFR#wKjnbi5GHka@H48=Pbcv3{
z=kZ=1y|BVFSK=_D<FBLQ=Yd*m<xeGZPzW-yDCjhzu}H#Jt(8G;kQ@`s?kW~)uqQ}a
zJAd6TVCng3ex)LMHzbedP7H1FzTyxB2xu6?Kp`C<WE7fE@J3)0_aJ;369PCd#b$TJ
z#V)VM^QGy%2k^zPmtqfsC#pCk;FR1-MSYI2@$|lxhj#Kd1l=sycmm*T)W3s*qV-c<
z#4=|nks0X*oGINUXOGUbZwskVy4DDDj8L%hq>sE*g-Oh$+A3z?7h)vfKuu5Z%Kz#!
z3b@@ujtv)$GpiBiXxyN*-`PV?h@mFSi|_1bfRgGoX;X%>3|<hGyvIPf1%tFGjj%#y
zcj3X~ttuv!n@7Lz!bGW}lB`xG3=)X1{@RK@5Aw%Z&#zC{v5rPEctaMXdjKsq#ZS=p
zvIS5_Mgwb}b4MsC5;`PdjH}R=SXDIWDi6X<4cU?1UE+U}-1cbjen39P726BLQpL<Y
zt$m(&Fo@$}Lt=QrACV+SipIK!#CzQTYNbxu)6QVNp`b0*&r@x|JT^M>^ikf@cb7(-
z*no}O1J-tRw<qxw*%j`huw_JaJu5cTh*<f|<zD6XeltHg%DodVo#pOxveu<0y*pZA
z=5mA}NkUS{HvE1ZGgcfgu)Udw{nTICL~O*@5BE|eDcS~!r>;}q-g_K<M!TWSr|*`L
zZ-f~<?A)Fu3}xaBNY~tx*CA&Qk_qK=g@-l6Z%3pM#&>Oq&%hk}W0>gQkr`3$yy>SU
z_~vo5>)(SLn6BsBadJUl{ADIXv+n1zl-=O~Ilfg%s%?vkt8mYgTWXZW=+A$*E;^jp
zAMkzgPh@qaLXVLVzDlDvu>fPWVyCtEiUJzO`Inp6eFrMiNrKq#Qt52>Hcuh3l~b%0
zRfS}CJ7Mw8LU*bBsFm|gQhTEk>vp}ZaAonSNE<nH><>BRxN*)<-$`hSv@#NU1(LJ_
z^mE5MPh>K#*B9j)l{zE%)~K`<$BanwiN!y(YDetzkA?mwRCLPu8DSZ8Ex1>s1wF3X
z)}fpK5{{d10dd8LLoTf+Ui8jE3xDRp3C>3l`2l~+#7p<w+ZKlIoYz73#mn=+<=+YB
zw5ZJBw)MA7kHxB#7X)+)BeCE~0ilUk`Z=pIE@om8Wu4D+rX7x+pu?G#bvM}y#FdQI
z9s@?8%2|VEGRm$4J14K%tBFNeSx5$xOVh)QExYWJCMt1k92;69s7|T;GUvwA-*9G=
z*s=VD4-0FcG^TXrup6-V4m4epT7Qj?FM-)uwFokM!95W+mt9lOq&#beK%Gy0$Z8tj
zq<vuz-M$GBvLu<a`)HJ7S%?!zcNEP3ie?ZEg{B4vY0+s?B*Pg~Dm2<`8j^p}J!&jM
z@541d-15<pI}FFnmiN;j0z2rado*$%ATd3V$1~ybAt1Bn#lW3QhQk<wP|$YHO_02c
zi~p+X6`i=KFeQN3S|SnN3k>0*?7Tcgm>r{um>#WBM6yeXuS(7?CL*Gxl5j-wgB0%~
zgY$@^V#W*Xh4_OJPttWDP<OIIyRk-panbq45vN~|7&m-4npu~9#i~VOvaICO%kx(q
zpNyA5v1q1YmL7ru_7NhHhY1W#+IXjO`Q_*0+CeipJf4I+J7}WB?d6w>ejv;+2zg{J
zkcNs*M}O}@rQ0k41s$a=5>;Z1YpKm)%n=Vclo#H!*;Y_kGuWD&S1=?q;qq`tCn*jT
zumTn%#s+lu8w*{&zHjI(&~b@FvO;lk`=*eFOkL=##ANJc1N#pdM>Dc;Fqr)VcYUxn
zM_-MygN@5!N+s;JQvI@fNVMZI*hE!Xo%I`kXTP;%G#N3*=q1?E;%paL>r*i?!&qTB
zFGd8%L4)`kKE!3Cb>e2H@-tncJj*{YV^HfqJw)tD7M@hrcDAU2zm`im;*m1^Tk#ut
zf-~epOEnv+VT)BL3q<KNVW>@>cQ9y`&BJL>_&*6NhkWvu-5O#7g<)mmn>e#IB05J0
zA%r3g)NfQWm!702I}~=D<Q81{CN?U%wx8|Sq^+Dy4WiMQi)`?s{5vgJAFxQStWP*L
z{`m;<a&}pWOl3(Oo?Q_9C1cCkSjrWr==_C2oQ6Jlcv{y9%cALzBfSXbda5`GQ4oVc
z&V4P@OcDPIf9<roU69<IdNSxLXW0)o6sb4m8y8sYF1K0%4$kL-cDzP1*%r?p^z)Cp
zoVJF+>O5EzM9jv(l_g0(Qm$@_rp#yqhm%eXsn&aC*Q*KTm`ynMm`gCn63lrCB^Ok*
z026P7#ikp<{60e}a2tr!KnoW^WFN(A1V{SQm{EeMj9rmUw`Ym?_g_Eod`8i*h$AlH
z&Ej+D?HPpHEH*z8U$HkVUhoSne>oF`KcTHbgamL0m03{{b;-;TK<4;kt+=<4&E~Ce
zF>sP5<vZ;+g)+!Pwh*oI;$yR(2Q!8?Z1aJSX1nF)RiaY(4zPT)S6z>nv%RyfpM!H}
zM=QNP!A(~U;hfw^(pB^#g|<f(U4{||QR>+!w961Ib_EHZ1#kb+p?Y{F!0d!8X*8M+
zqdf=#+_^=0m@aL?;x_z}753=?y&5y4*1Dk4jq)&hL%blm2KVO;p>E;g-s1LgN*wI#
zJp$|dM)k^N#eBREyvO#;nI`L%{yZe`=uUhiNlcM|LT-*02cLgtk}zGAC9R$9Ti|F(
znl5a_QJN-UwvYnsnoH^I>my2+rb_RJX%Wa&Y})pEiy_yC@Rf@Gb`$i+)4mx|5-;J%
z(icl?4(e1SOhu3OfU64cSM0Ms|JTOq8i*TGS>-<`huI%ObzhGybtQ98T5YK8Y;sp=
zMii7qU5Kk&XNpeMU!n3_61w&5=o|#milaoU%i+?tNQm;r0ycV7V(_qwe%7HG#Ac##
zZ@xc~BTY+FlV{|><?gpIXk>nRHFK~M>eOX_=VVv@EKH+1!7w<%X{O-huSQb$t3mq9
z4Jr>6y3V1ZPd9+x`xRYJlPKcr&i?%VXCT)HXe~MgEFFE$5%bC`-T_ed(V58@nkjqY
zYKC}%U~ytKIY#RDpM0+tXLBOBnFpCXt!adU_i+?Kzd=ERTSA)X5UjWP{l&F1u<SfA
z7TrL+k`nqmhrKSme`HfQCpGtn?Bkd=Mg!q(jiPH9a^4ZHr1fV+7M%2Dy%!D2NU0df
zbHuGQpk9ID)KnaXb*yOZukwNJ^?r4nsXdARI3|53C0()jk%56QJY$Vva?-`=CjA+;
zw3^2Lnl_umn`(KtVri<X9$Y-m`J-uIzuxRl{dQJLKkD?pI?TK-Q^alt?~S|v#@xy#
zQ_E?<+WpXP%ZyO@j}h0zfdA?&|IMjbZ1jx)(!7$gflCcHFNV73%sk&m2^1VjcAECk
z+w)71A<Y(OcTtbIPYwo_?7A&>*wTLCB~u8WFif5{A4(R*9}Y77^$G6=#i6Jd_Pw05
z7}cfX&fzp0O)c^B(Y>R+WX6medg#aLs#rO)*+Cs}aw`qWYV@y4a9bd2WZ{kxHuU|s
zF7T+JL4ujkCCW3D1R9JodXvY=t67DrG`>x;u+aD~M5g4{3u6N#dXa6XcWWykqWmN&
zMS}7Ue(yO^9Mb$Z+Y!6bC5Z8d*$q&_jUbq?eWUvKFze*(-E6$R{2X|XV&J`w85R_8
zYX~CXs5f1PJWAF0ysV;>8kKC@-{nQovB%=OS7^+LI)mQpr_ofTSCfVs<!?y0IGxx^
z9(h<y!3oToF!dCv?t}kD=heH9Wa>HCKQ?^tzu6Ue$gb}a+^G|P5U~GlVwz6d`6Gky
zmq_Nl4LJNuSn9GhqzZvIy^>5pBCZLL15$yxND=G~OboBc<tH4^U9s_}aC2byuyinG
zA3sy))^{NBHk3HEe6}XeT39HX=8vspvm{5jCvM{Itg_;By?j!uqUHp3qgwQosjDxy
zIp)~9)oSbMiLq;U>X$Lq8nFDsfa|A^Kq}G>Na5j;ZKi!m;dc~4@EeWo+)3I}Dvi?m
zwC2*|h;gND;n-I_(2sStva{kf*913}D_JuGc5}D+4$IMe2ojyLHkd<^YM`;H=6eer
zyhXASt?Bl#U$mvLrE<m<G6c7r2T>w@$zLDUD|PvI8hGurhUK}M$(Cw@==Ud1Tu5?a
zocX<ZuOcgYQX$$TuFMn}sEzwtrRH~(CE0-y<BGK=y7e3_k~0)?r8vf%Ba#9J!X%Li
zQt-)pdQ+L2sYF_%;;YEAB+4{fViJZeVM$T$;8dvY_rOV`)i89+mwxDMiu2LfoNaC^
z+5(5E{A~wFcgeP{UA9c3lxzd{9=}s(FJFKO5<+O2#tLU1hUs!pm&&7RV^`gS^~>9K
zRGQ!oV5bK`AD^J>+i!%j%+B}i>8b}%)F@s4picgPftS&Il;Z_j-lJQwoT{O|vdoEw
zRJMTYiXILM3x-MZ)M%0|JWVTZol9OyNKVnHK2<dwL4*r^j>_l4LCKh}1L-!`dP>IR
zMbAiI3f#w@MtKP(1Z(y3CdqfPYszJ>SFeFmn^~I;i?yt4R-{g?&auqNRl|XF@{6h;
zH=b~I=E|Ho&nS}qxj4Zk?_1B46M)O<3f<ZWyDwE-$bP14%hOLKIJ+J<MBa>z9Npk;
zGuo4-eqJE|^yP~}BwrZfVKRz&Ubn<^(HH$I>+W-2>#537o&7IcAKHwkKe8W~`qXF7
z;L`&Y8)Lh#3}3f;RM2O-TIuW^Du&5h-3yPp!-g-ap6*o-`n@K+dN#dNpOFX@-oO{f
zPp-7Ka}`265H===#`>|6uPQkTT3L{<v)%7niAn+d@WJX=2y5_#`@15iSoJZge5_#~
z=mh~66@sPCzlpFY@g83D5*YjJV~*z9QG9<d{zV|?pb5dBj_e1fC#3snd{+ylmKFC5
zRo)4VoQvZcu380yQH=P)f*z$HMeTLRNBhjRW5#I?qHAS|2s)qT5@2uLqkl?Z<$rIA
zd_W~m2$Nk1XFZ7t0v#pN3M)VL-v=F|c@GEEn6&#FplB_VizSQ3OTklyP%FS(I$A6_
z^aE2H7R)EA<`z(fcWvdx{X|s;eiMxMl+CkzcC{Ng(ocn-l9jC%ZET6hhFoMd9`}27
zw{)-SPSP^LI>GAbIK>^(?g!^YaVW|M;qlKo`oHS#9EQY?(g87<IWRE#IPnwqM?JZ)
zEP%H(f(~|T|Lw$75OdZYQknm&|95>iU^W$AkLnqt$q#K+9DNMg+{;)0yU#@NDLm`r
zbYDe=yy#pe0*eCdv(6MFrC*#6k*pqtOqxZ*&+<N}C{>Vsx5Pjruqr2)DwJaWuaxDR
z2le@q(OQw?q&XpUJe~=`2&6_g*9#<*?q2Dn>R41!uDi><UHmt$z-`QnE~i(Ym>J<b
z2ZcDbJB@ncQKiS-CqTd3H>Tc1=EyAbvX^!siy{6Y%wDEnC*B&dxl!Zv6i+lvQmoMb
z>IDmuOwt(-7k@mEDF9;k_4R)c^-j^5b-~(b&`HO(ZQHhO+qP}ndgD&Vwr$%+$JU>3
z?>)}BSvRxRTBDxQ7&QysYv@B?w;<?POUk#5v-QXPF@?h8v+5cy<Wes#rGv(f7lEe_
zOix=?93}-35)MuL{bi6UH~^{W*5H2_Tq0B^LbOk|z)S6wy;jXvV7aP)ZXUpOWDDkz
ze8Q@atZt{m49E5lvyQ#I1uG|CqDl(MH{=v^=h`5wv2=Wq+b$k%9b)L?-%Qlv%<l=x
z{(+DZ@skI-AS`Boez~O$(jy7j`DrwUj^gWW7#+fE@4;VxX|sbx?D&;`J9H;>(UPr`
zY>SY0Mi}0|g!}pH<Yu0p-`#(Ecl%FTsq5S==Y43P$rsg?463fu%=rQj%>4_+-#@Z>
zn~=tRvkL3+*~E<69HSp;Qfeajkb|zNq)!~^>f}-B$K1G?F~oHOutL^k^?R|Cc%0CA
zMd8gm60kICs<Ybm%$!L9+fM6V9$n=kK8hX@+p*nLX1EIDOc5Xy<$Sriq1DT(X<+aa
z2IFVrq91~`d-lj)yTIcO?u6~U=wfN&Uh;E$J^7Q@ViiF}!|3rCD4bY?p}}GMAl#o1
z^-W8U-dmmMd*2~4_G5pa=48Afqjh&Ld<2YiX0C8|e6M@9sq=4oHnsfSk#mo``sKNa
zOIk3qJdi&3-oWmG<K^OmMcT#57cgGPIFR@3C_(4Bc~y1Cpm68qVR#%GJnrPgNxOCc
z2BB$D9NEvU>y^Za2bAz&fM40YIh|*UHzsmRg44*;<8rGq<on`zg5G<-L;kqn-?Pmv
zI8#M5?u|@m*cp*<=iC|U!Kgw(DouDx0-c+~xAXVAvn7}=@h?&^S`6V)3sNBrsNgb4
zeoU5p{(yjT*O`Gy7bV9+0>iNFE&Lhvk`U}#j#L>_&66H3?l-rZ_R7^;U#x0&BvjmT
zxg9aezOO8)*yF?3p5^$9M_1qK9;Ywd(f(5JHlL|Qd2jZBFNHBWP<;rKVjvA7b^8of
zfgE01L$EUE$>Qb&%f?An1I)!K__ha_CGs|%R^XS=OacwBoaZE}g=INBSE1DRFYmPW
zI6#q7EDY|+0_@PuD1|?rt0#4V-@m4$$gbWlnbM#fC>!$3?ME*KYo@hVUQ$iKVg8?y
z(uGcki(1lKI$r<s#O~vub5z;cEW2Tc=~PA>#|rZtZ7h&BB@mc%Ov_LZ;e}zc2heMz
z!CEd(jS=s<%vS$e3c>E{PEOwbE|cS3&ts1h1Tp3Ye~A0{-GVs0n#YN;f45&3%AapP
zbEc1Or>R2`*SB(lLmXwo8ocf0<K3Bl*D!T-JgV0)&Fpk~!P*=wNt&I!oK8`GNMEww
zpX+O2w*_$hT<f_$_`oLseZ4tdvouhDcW?h*<a{5SyWOV841#^-ym}o=^b?D0^mE-K
z<`TRIfzJ<MzR3!@FdrU!!K{hikdv4R;ad#ra&Tz8?~Fqu3Go@W^vKNB|4!xf0gEtm
z2>tU;_}xW9{_wGR34cZyoQI>85sGhu=hr9mkg_(wN+A600PVKZojN5XenS8BoF^{X
z+2ZfqiB3wH)ZRTkTNMhQYN`eI`z0rGe1F1PSGp)p1U3gq8AD2-g7<@X?;jD#S2dSr
z>dsUrFDC~d7uQfv*{K$9u)582JhKGr3;HnHcWw9`uaA$|zisBE8<>1+%*U0R@iaw$
z$8o0i%s}J-7Ns(84j!nF(cGySg)2z=H2K$=!c8voyz4HGvE61YHy0A!)`!DFkA$=E
z2m3#<{#xmHUwsaEFDn;KzEV%wFTW2d#wcC^ek27Pif6PTKWz(9diFvoIuLQp4vYFW
zMIxYW_(wJ#A%G8J-oOB#vj-s_$>O!#$kTSpBQoW72`GHVTN1kN!6R(xx3R&=bIG$t
z1X@U%99jjac0mK{88FdC4=7k4<P1aPs~o2C-b(#&Tr9odTFNeGIBJ<cs5jaH?zIOp
zVcop~dG0JMQ?aJ%3PgW0UO2}vDLIGvNlmU4X3bhHt5y%^USgciYTdzvM|v3=R#=pb
zJ!i6IsmDCn(?PrwBmNQ)FJtONs-*kjaCP<7{@Hma*gH>;-fOca-IeBj;A<l!A4=mO
zF(vP()e0G*+lUm^JB!A}Y9cG53x#&(!(Q0T`Wnr#Sr%c|XQnv}WHa8}(lu~LwSwQj
z6Qit;72$3kjy3R7b!uWS*Kf`JYW7R+B4qC&83cX%@`S&l%y>YqD1-)Dm6uS#wdSA2
zfOnU}K^Zd42OxnpBZdUgJ{1g7DJb0}5mKI`0LzmBt&6O3i!}kbc(^tv9zM9NEt_u<
z6R@4Qnas$BZ0F}al2$F*)YsvlS8jS_Aj%)WH*V0aLFM8$8ev>?2H*+zwCvR}R#~S*
zfZjw&XDQ|;O{gPBoh0I6UCl<LYT`D;CbTlHd$)Awmx!>T#vq6`M7beNtF52Ll{TIo
z0ije3rc8MEX}hzwoqjv%|8%hF^u`>=($-D7;uGu^*{;TgJ9du)Vgo!UrS6J+K~Eel
zvKA8dj35%$(uF(}1x9RggB*TOA#H$gOqFhs%j&1+<Pcygsu09|Ba4ZM;Hm!Xb<uCv
z&5wJO1D};3w+Joi)KULQ1oLClz6iw`F0LoPV9c*rBubei<fBcB!ZKR|wPMkgm%#U6
zVD`{pOaL^Y+6@Ss6SDFR^Lq?x+K<&S#=(p|+4#p6!MthH`7$2F^{x+E=>+ePyzUDh
zZzqC~;E`S#d<7v9A5wP(A=BuqNYZ#Niy89z>!q}I=tYoZLEyjY2}JV;%_Z~-u5jNr
z2&Y3Q!M`_-p`B&h0`9>$xYCR6kw@crwB;n7$c5D0$4AQp(49K(@jT&Us)QvrNdGWT
zi4;@*9Xzn%t7O+Ap<ByQdrNW9T)@J7s6@K+F@Ddt0F{nx_NPjXhkM-lbboIdvgPB`
z@t~*wYje^jr>P=Rh9gF`trtTRQep4*AcNYu&<p+E!G6+Jc-E`v?B1OfqEmUqdBV$2
zGQowvn!QHBigyc+7VWvj?lnpx_mWyx{{nh9g#VcAmEeD`raz&yC<1BZJr`i!jWII^
z@LNx_3o~u=+zQ81*SY0vcr3;{+`;fm%qU10L{YWA<n&sU$NCGQ0A<(MjwXp3KP1+r
zWq-&&EWwZm5dZuk*8ehYVb$6<RVHRJaTX&V+}>ji%T4X`Vf^276?QBmiF)*CnJ>i&
zcjQoxpZPDNMoxVNQAs~P-_oWccTd%FL6fCe&VDV@0^E^i8`a9|(tK|DHElm&jQ%>{
z^pa_oT0(A;p>2+K)Ip-W{S}O$l9fB;#jHQcr_@yPfc!p3F&=a-%MNAALQ#lu?;69X
zkB+X2Ih1=OxL^0q9TBW#wCse1cX_`DgUzok&N7c1rI=i$>qX`Byt99h<SUVky8LS7
z5@(Uw>djlN{03P#&K9aESk>mrLcPkyMAAOM!pL}Y2uKNaIKwS?+fed7({YQ?qj=cX
zek~CfkISsu4AA5-HDp|P7WBxJu`_P{@^B(TWMiMZnI6%~nwlgHIIy!QBtRnpdE<h5
zZ;~<S*t%zxOr#imK=D?Qzq7YFcQE6$)~MEI>CK>@Yw(+Yn9fv|$R**L#`Rv5KNtLp
zB^)gw38KNL!@8M7|3TzOBI<PMgQ?sa(^8L4(UO$W1(eHA_6?S=zVgzX8v4d+c_j&G
zHquc{hoFk;jk0ssx7Q!l>O{FFU77U5&JPx;>hO0pybCfp9_^SKW11#bkZ1=P<VrEF
zD&)gVYc)TzKnh0jotL+A%f=uZ*~1|*n#BJ+;%6Go=Megx^sjfT=yZCB$SRY8c}8sh
zwJ*CZQvemCj{*Ns|HHYEn{z%R5#HgSkrzA~>wf}Fkw@<{f?}wsX?Ky0C<JEoio-iv
z5X}H*>=bAaT;k)AD-#+H{;*z<FHTU&5D3D-e^=zM5R8s0jmcC&aY!6=ekjjh4F13#
zP!dX@kRlx{g53I%e$2_~9Klp{pj|>pij8csY9SFo?=SnksQU2rk5((eyLH4ywVs7}
znKOn-@en@Q^<Z6{pxigy;_z0=F;U4}kSpPhG2Nb={`@Q4qoJ+birKmtO}6%jcOxG0
zc*Hv$jz~^w0EPdDBLAAixJ?XT(UcYo=m&qzLL%l8Bci3GN}2ONk7nJcfk)3jUm;yD
zq?)x=^qL#OfVvG??fA5s#VE_jk2ME~tFTgb6`=&_&^%84n1%7wlBlV5Q>o(|IIee#
z{$KVjAYGSVUs5&LskoU)@)7MyW&a}rBc8H{5V77<*uQ>yGDKNPX);XWdS$~6L)%yC
z7gOi@u@d$1nxryd2k~!`yrVrIBmdAf)3`+{GtptokE4J1JSTrFz#^C+XS{CGgo^x%
zOSb*kD_H%9Jull~Z$stnr?|aNAW>oeLt7;ttM`b^_kdA&x;T|kN)XTIuN*2yHn=@S
z#X0uBSS#{deiQ)&Kt(T1LdIj{BgrjT04(oI{~elRNBrP@NB><XIWLw*xxja+DZ@rZ
zN}FjSvqZs~NBe`lmc66H@W_8y|7PX4c}QLuT($l`m-HIHmA&jXwhl)6pGg0sSPDqg
z#_;U50r2usCKh=wOT=_-)ZD6NoA0$hk|DM0CL_ffvMnTQB2(Uml%G^3zs>QEjy$0y
zC`v}A{F+a|_yKjnTVdJ!xqyXSL#B_0ma*hFBX1^a;t#mb1y#;2@K(g(MA#kJy+--_
z7+U$_ewgYuB5$We6%~N`vf>hR+2YkT2FkP{KiM+q4KETge7BWhaK>9lo0)h@p6=7p
zpo6Gb3YK;Wt3bsyWu}n^BO@Yh9zs57qck4MhCmq<42jGC_;_V!JJ*qlW5VX4`Tq^q
zoi07dy8N~w?|(F!o@EvqHpJ*ZKRgc+diLTo=z|}gHxX3)zn&E!mLgk0LHqTi|DXp1
zu{AK7bS%@~$^Vi60A8~tTWE@opw$dy`JWJN5NuZ?m@4vM#Mhx#p9FMlgp^d06S3qY
ze$a!2_&<$kDF48|P{8(Ht7%?ZFp}b4K$_BHo&R4fQ6${ZF8<R{TY|S>Jd+MyO5>{v
zM@BrOu5f*md{4!WDsf%>($YmF3tPn>tN4$>Fku6W;NrG}BH)?-bNGy~V&$$x!kl!B
z`~N9N(QUzh#_=ER@_hNvDuz)9d&V%u|1rp{6d}rE^Z)T@?K4GL$)Cf+11d!SF&q3b
z;eYv*%{E&9n?uql`TvV0*fKAae_IDP=i}0#$nt;U&tO67>)$#C31zcX#;5-@-sfeA
zPg?PKHXDipm&~!@<rd9+LS?tcv7Y8S(l4HTqImzU{bZa);h9f0jyTJ$wCcefQFLyD
zHWF&$1FR~-Oe7Ta@x}#}(mQ&^7{0Ftmh`r1jH+fykbrqr@jt&<q~3CI`jCY86HRN;
zb55&6bnJ?<j@B8u{>Q^W|7-Ge@|-eHf8+F0u}*RHCFazviGHICr(r+e@?%ZdL%ARF
zi2Lv52zMQoy7RWvtT7{;HW4YFzH@rHh6auQ<cPy7mWx@Ka4GAyZ&L^5j3yy{C+qmc
zXXFiy2?Ga8Y1&tc2t98ousiQ)H(MgjI;q&2H*^(|-`*wtFvb;?dp_j(4vbN8%&Ajx
z1mSH6+<vax)_RNmw6@>jzv|<vcu0Pu^han(RA){|t@tjMBD@WWGB5s^2)w@j0)^YN
z?)zzJyA;MH06i3><wC!no(45dU{T7{&T~F?wT62n{5_nWof0D;q(3HdasfJMN*YRQ
zRArm$?;`~km0nz_R_rhVfGc^@X!g3dl;MvehK*6c1q!p*=!58_zZ_QgD7@u9ogY(V
za#)0ps`>B^;oMM5wCIy?$(_g_J>Lon^-hj8m#zfdsId!bkF5!d$~#xfrF@MQB9n~9
z1^eF0(590Mu*NHxoN1M0-V`UnA}g?{nu-|gMQy=QLN>cL2a`Qr8;Gq;>$7an^%e$4
z?1HC+plud=sdFsEnH$apAo;IEEYcE9CKwu-?B|Bb&7As6_NPL|$4FlZdmIoW$9D|{
zEimc>OjBl3TgQ_2q^2MZjrAIlCxkmD&aG&oFTvQ$f@cdmyRbFlJ77i#oI6S4emLD@
z8dI3B@K91k8amOOzm{A)e$>pvxEIO%^C>l2i>w*h$2JKD;OrhGd3&PbaGi3`O0F?K
z-B7Fta>CdLi8IK5zD`QxWUKA1B<BYwauYx`ytjV|#rP}E3vE*r<MeCZHcY+(^MZ~l
z;#??VAakNc*O$tMx~tWrw2Na=eEXlmZ#=$ZKz;S6+bO2T+wnNq{rdXdQWjid6ZL#Q
zy1`KYqM(P^^)sq^V2w@hF2ya>ql6id9;K{bjpzg4cGRn~r!9Sdi#@w>AL;$`SoS@=
zHHgj7Ml8_SH6e~y?81FT6=OLzthm@@q3AX-SMhZ7wNl{*#|nc7Nc$ctS80wQu$+f1
zIHZ|218*s8V8+gfo*7Yd&uBT?#KLe<@LFO1TR25JRJDHR{Xq7lU$&l7jn--EH~zg<
zV%u{a;xQtcvOQrkTFA$$twxAwN*eCs$ke?L!2o_FWnTpA^3CrMO!r1QZq~?c8VTBA
zpT~YNUAh9a6S&n@2xB2yA9ELzS<Wl{e5fy>pCKSNP%zea%!nkA%|W0m-06ft@Y-kN
zjlrNopNJtF)ReIdH6=MNn;L^rMua7mo?8jeu?}3s7Exq`x;nt4D_D|2uNaA>UYHV4
z0W7UzQfD%W^mxQ(D1FI9Oq5Q-EDOYJ`hm2Cvh4TuDU^XB<#5DJYNY&)FeH$?iUdu+
zo|!dfOp>BRY0PORLnsQT<uw6C;x8F!&VU^$yleplu1=L&PwA{W?RzIW;Y^Rxrt#^i
z!?g4vRJG^K&a*RJ2?BTZq>={G2E{AfO`?oO<Q8zx9}P778JEY?Hi_fNs3|@O59(%R
z?JlnMknTB5nVkvxFWDcS=14uKt&yV^Wm3)q`p`odR=H7aYJ&o?L0LxCy@w9mx4`tT
zq5MdI)TnL|?u)J_4En*z7Xo|a`5$uK!aF;(?GNxPyET5Qw?Izw%?%6?B;)=_L;X%F
zz36*2(EDrGT(Z|gfm<;=n829E))e(tD^EFB+jbuG@2I<+xF=hwMXPM&Hig8%(i9me
z?B%x)^XYG}0p~!N7fo`7#-7ABN(wTmMyjFFwa!k`Q;|Rt7s}K*jd`lj7(G31MZ}lg
z22qkXx!;Kpdfbtx2Z<c#MaI%7p%jO>TrR^5?n>`vPyCnv?m@Xt2v4wZakM*!@Rc0c
zv;Yp6Ng4?UW;^IE6QR1n7V3q0G3WIU$Fw%D)U~39b)E!yJQdfM|8ToTdv#R4fY69m
zfC`U-k@~o3%lHirz1TsP&(Od+)3<r0Gbgb{zz5gsJw_0p{e)+Ful?3Iw@V|0Ub4n=
z-o~*(VFJ)!x~fs*RSq}jJu3*@-1qqJ(m_k^z}jjT`ZvLVFkzcW1|u(o0E}4(O2!jM
zN11O(h!4d0B?MS4;ke9imdBjTlG`*`c=oFYQAp&q#B;{uztOjJ%-l@b6K?|P;-b;P
zM6s7^jzW7i?OK`7m`56J!JUMQ|G~_m7HANLMh+HL@Ob@EtP>P@PO9>nON8z(9cLs<
zexL_T8Iv-k_(t`h#N4--P%okjdzv?wy&y&>OG*k_P$PC$No{t)qexciQ{o$#pras$
zw=;&l14R{(+8^K394Lqk!kry(dv3HmVlVeZFKMm3dp=8<7n}GzZ3o$J-;0wg4B>%9
zTvofjw*fP$f)5f>su<I9p5K2OtCrhJ{|#aG^FwdjNr=8)^FEE(VaimI7tWLBYitUn
z=Ki}-es-FFYT*Dx3S@_9RSHY&#$OoeDsAs>ba;*1_EO8Ut5l<<4)^TxS;1Pi*umar
zG!4vqBlAv2B~X*`m4vpMnOLo&R98tlAf<}!eMh2#P?0~Y3d_xg^!*fm_$pGL5d$!;
zypxb{4T%4m;#{@G8U({!gpiaeMX_)t(ZGP=cmuhZoDr{iLJLUl48VcCLzL}^>Agmg
zShI2>+PBSE85o5WUJsWDJB}sAv}`j$ApN?b7<Y)mi*k30sO|9>99T@6JU1i^kTu{6
zP!MLY`-Le`9I5YRs3~HEkg0%i#MmmF2$)h<2_TB#KwqUUk5zUFna(0X*r*f-Ie(+w
zEyc04S*)ttW&NzSNpX!9-81dQ4o9WoYPVJr6P0q8?Fs$U%|*||9WITn_5>cHdzPdr
z2ccRvIZ0}Z?5oP5hD6zX@*H(CRqA2xRcM4!njc&KW}#6lEIpP-!cPoEiIobWQ%`T>
zU_AVr*Qe-0o}!v7oE~!h=Cs*p!XD1`lK&6I>j)D#$99X-j24b^hl}lyz@cj4>dXF6
z2_r|Z`5LL8&;0HT-Po2Tnz*{bJR(N0BD#?+hl@6Q+|XS0KmM~yLcP}#_UeR2-&j<k
zjSa`p{uHJn{5UG&P*vK_yowNHGpWN!EhpZ29X{^{|C^iuu?t$HmhA^%m+AX|J`hY1
zD1<M^4>RKAWk{q-Fld^L5>5>7p-DM0#jX#M@U!K!+(8w$vfO_n*&v<l6Koa{9sO4E
zI}K_O>rKa-An9R5X(b>L%5D{wxa1V+(9>261pbnt6`*@_m)XZXvm_>F0AL^%M{qbF
zKp~~L9TW7My<Ju)^FHjnPhO7fiGWXVNdQS#?9iddk4=I=Gn}fIe10<7#m;DTQ(DFM
zs;VFZy9E^MhXN;bK2D%03o!KNB(<3g7VkJqZ!uvk>&nE)%?Tv(e;`T5N~|DM0sbR!
zV)^1a=^7Q0c!sf9b7hrt(_MHq{J4Mn24RZvBGRd>(*GW|FnSSNf$!n+)>k?~8LA?z
zaS%*`av$zzu+`C^H%=H~!9Yda5;l9{z_?&$<ET0rU@GJ|-oDp98=fU&zqH;AZcOQ!
z9dr#<v{`kJR?|;KnF^jIsG;&CqE?z*jm#AAufvJ(Sr3isYf&4O!~)}jLOc<lG+wbX
zUca1};e~Q4Q~B`3yVtq+VGF~JM7kfnAij-P4!pVqTW|jUqs@rA!eK<pspU>NgL*#N
zPO#@S)CX2QW=Cyr81T<EI?;P;j5i!CgiZkWWfQWR$6KV>UvJy3z<+xzKocb{3X&qs
zDRYC-<IK8k&QwoIOwDOb1t;3Xm=M|cLn<?*qUOU|v_aUHVYNgv+$_yzYe=rFCBH!X
ztPJS%Y7F=$85^OGPRG5Mnx`#iS(NKU^iI6%Q-qfncY!&4zz#Hoiv)~-Z4s{kbX1yN
zz`Pbj8lY4WcnjeQdwAgWE?MA!)ZzC#E%Rq<H}IBn0X<QR`;E|VS3xJn^^zPzd;T*n
z-;mq!!c*Nn*_J(b3w{axBBXJ{=5;LIy`F>hr!01p+Pf!EJ`B-E6q(R31TrJ#%g$~1
zzl_Ob%vO^ma}HEUUHycp0*YRjbXM_O&;5y}@7Q3hYU!IZ6&vC5FW0S6axY@ULf6@k
z5)uqnQi_G)5$)MBTlpAt!y~FhsH9^5BsfK*h9P*~G2_u_3Dh4ooQ9t;=FvncN*T82
zxX8U@{t^cwEV22(R4v28q@h4EU<HQ~%HW@c=9DJ+;DxU<s}!myLLY<#ZPl#cx=jsj
z9G_OAJ?P1)?hZWM9I;_TLq7Q0^{LR!LsomWvD(mZ6oJUlCQZ1;a`nimOJ*#CBqbfy
zW2%;3KISXnB$t(tqa6SGa>7U{8zRRbJ+i$07;9U>Qh%pcqNS8%bnd5max;%WOdU1X
zh$_WQ58T><7_Uwc@+&C9GXhr<Bxh>mp5~OJJiE>1BhIam2Mg4)QRETW7w?)>=Ajkw
z=3=spe0sJ>Lbt}e>=r&F+29CT4yaxJG$*HW{{^KPiyT%(;zr5^l{k&e8C~1yBpZL^
zEMDw>L$}qrsw-57{i?cqP?(BuJ@ti5IzNFn#ISOuyjNK33RpJ|GRlcbWN_?_w<iuI
zFUnw3nD6i-f`(T;hP_x6ny721_aW%-wXXX$*LlOMvgiiv?E<jFi*eX=-fS}E;R3T1
zuY&Z(U)uGOmw2ab*lKj4p>zu*hq#l0l+caO;IdA<T?tNF7uk=jjtTsdw-(QIIxdz6
zo(v{;OQ8*B9%nECGxY)1pLLVXWxTNj!BxDU!^6jhYF1AQWh@85yRziQo)#zL%JvYj
z<`|9(dNFln!-ctRh`_%ZmepUZvvRq#23kkbC(=;MO$cN=_aT`GFHrm>a7??acRXL_
z#lC)UWwfDIu`Z?Rz$+9AUPnkXQpatrnBTpR|ISMt#kq>-A1&TZTt!?{qLkjcEV@3j
za2icsglKFemn=xHQb1!k*Y$eVuMc`Ru26Y9@PS79nSS$+7A}qUtbXl-wj+d=Z=t(%
zsU8K>8Ok+_W@c@wYU8dz*EhOs<7%2`eq)|G$72-SV4BsyoVRsta&WfxR*4V=iTqdy
zsIE8Qa~zq%kWE1erA!v+kUNM?Mtq;QpuU0(TXRk-s$E=*VSPA8fO~u}0l>HZD7|=<
zw<aYV^&Qtg&?y5&9Q}K*e7_Y((OOEs)QG9V{j&am+j2}`zL<bGU6&yYO3;423Nj;U
z%&~=tS>ZPHj=I6Pm}L=ne_4Vab(2=>WQC2^DXmE7C%<ipMG}lA9(IGWW+AgSSV4~(
zV}mcQ>a!vxu7*)*e9CCH&8z=&;T3^T;9b~vO(g910DK?Lim<Ga$ZI^V!3whS+6yWQ
zj?=0W_tV6ARWhPZiSettiYqxq9#+^(S^SST8Gt2@HU*PmF*0sam-eq+L7l)i83AB>
z(@sxiBDK;3v9+4xb|aYDgo6HqFamNF6Rd8>I*rL>3-OG8Ef1KxGWJMFGY$b8lFAv*
z7$wTE=D?L#q&j{$o2$SEIe}_d4a4LZoCyiV;FRPdtlwl*ZM=5J#O519g5Z-JkGFqD
zQN)S5)k@M2PaP|Ghh@$J`bEG&S^fMe_;a9Z05Ex4KV&3^W%DL=2#6aXq@P30w1)Wx
zwmqO|C|^v%mS{Y{Vau-G5VD?YTz7t*Jb@9HD@{1txX*udX5`i%^NZ{z1pdjkjqIEl
zLt-+Qw}>Ild{sM||2llml*GDG5c3L=QHx^WtnUe~(Ztj~q>*k(n%=(8XYT%rnCcxH
zWqZ0Q&1ik4eG{otUK2aJUTe6_%$YEoIPp~Jt`#YF$~SGm)W%ZOmyq&)JAfic0B}{g
z8K&rMVG_hN6dTKVP0b4#nz3N4aYod8koxZR7~S3mrAlY?Qcnuy1ZI{HIU*N%TgJlp
zMHzzM6NJu{xKFQr@C)L^c}S}*3)@B}5z1q7Lu4Ro6^oHgtcpKUGZ|GKkcAZ=bJ`+e
z4LbsM(j{cz7A#`8Wo?}32XcC?aZOF5vP||cg0_~pu~{0n58Xz!Wqyhxg=uI>N^wlb
zCPh_Mm=;~{-okmwn?vRTa~fYg?xAbx8iyD4na250l~i}8F0hy~>4{RqNi?K;_#^*{
z(2%Z&^8u*`M)kmnOCDe;XyP37;6qDVAI9V}@Oxq{9mN{ZCAD7=a6Uu~Z6==hD3=no
zfcg{ZpFP9oIr;i(2ObrQreT0H7n+haezXZeBOJ=uv_X5<nLFt?2!?)%d?D4Ljr-Xb
zh8Fl3rxh(=Sh|y>3m$&C(S%{K9?<LiDx)B#t4h1^xgl$8<wl=V>Xj*<<`ck>YAzAq
zZkB9_lw+^^cQrJAzeyZE-F7E>#A;_QGXN=VoN?x6&qAlqa+Ok}vU)1hi`TvkgHkpl
zY+t0m&-H1^6{<YHO?&AQpT2v-v{LbO&ahuLLLlgRSREju<i--#;x!97QF0A!>|+ej
z4(~8d3y-EokF+>b4mu5V^&YSbSeNZww?Y?+{UK41-AO_>#j?Y`B3j$bsksI@EaeF?
z#zVna+~RtDre>_y-O-pG?2e=dv9RKL{P#F59k2>HV7LMcjN;m5S>3bh;uU?UYPQ<2
z0yTJ*ZR_y8-I>of$nmvuP+Mt?E+s8F9QIsPd;e{w8!P)#%G>4oUP9PTD-7kcp98*A
zYmMs&?tI<V+_c3eCuPy}TK!6XL!9iJ)Z~*Zt8Db{dV9Y;ecxq#J273i%D>6$aqn|&
z(vRoY|AdEyWA%@!aDc&xs$Rd-ZrNd}Xemj3B*r>(Zm3xti?}_vTAi_br(8Fh@LaCp
z?6(KgR$C;8vsFV6T=o~w)#MyH`pqxb?(tt0<ICPe*b@QI5sV8|c$a-f0xBUZ9o7<L
zwg}id#&($jPK&aCdC=9BWg$CgTX56pL=^SI*nSyvA~H!wgZ!leT#`P-q-5$(^C%fV
znsmRZ;AQ~3QA$~y!rS>Q_bM|1u+}lmQLVV@PLkQdnxvt0w1e<l?B`nn$&h2JpzMPi
zSFCO>gm#P?K1XiKa!s>%G-jnto~bjs*Q_IdHFLx|mQ%ut_j>;xbQy6bKW}$;uketa
zNoFmaVRzP_6Ge=39B~QP*OgU{4$3;Jrzw|6k1u9o=a=qh{HmKx7*v6kJ?n<w9d&DF
zvV{G%B3fDfOsJb1r2VahXZ#-Kdj^1-;)8~AWRrM^eAM+Q3JhO7%-km|C43Mpz3@<a
zN?9IQWo!iJ6x`j6a7PW$Lyg|YC+JnV->0k^d);YfGE2L&Z&Wfbwy^Oh`u3+77_CXT
zp1>{T8Ta^d!~AyZLaX`&0moyumlDT>AIknWPbsgF0X+CsT-|olObRj|C)_bwXo{c4
zg%Dr@cdMaN+-5LB4kCtWU}q<XNH@07P2r|f7>G0`gvW|duOzpRwTIYB_F=uOi3%MJ
zP04zIQCWFC@u#F~Jh)oHy(oy^)~r_og}PEZI`!Jhj_0%CL~JDA$d2Zah)Q>qUH}=T
zWPVX9mpDURHVOK=@OX4351-8ro`8Jo&j<1C<V9h0+3XPZ#p&$ccxat8ou|xP*pkbL
zx*uc(t)}FKB>>7GD(dgvDV<<GzZ&EiTs|#nNH5Dhi7Razy&^)J6}C0T&!Udpi4SK+
ze92eyB=BaLSRkwhI-0{NV>{a&s|+2!$(zaxH9kxh_*3Azi6g^kf)T^+sHCn*NTd$;
z?O@qIbWAw9Wb4GC!D%Pybb0HNxHW;6Y_WnDqir)r*cK&M!8Vjmnp-3;nOX>Ie{B4s
zj}|xiLt@&f{#2L4dkF$+@=N%H53Yb;AY4)TfuOxO$m?AAn9V^*2UPBie`T%*48iB3
z5gd&5>rd_}E|I=NU*K+c>>E}YVHkO;YjaUJ5yd<6K0_UO&rc**x17NUuO8-rne!4w
z8J5@39EehN3M^f7fbzgXWU9DaH?P&`Rp*MoZ@4uCE9&1|;j`40<@J@*$!(z>G~b;m
zJ9oB>l160IM3TEXMPbpp5gEzs4JGA_1!~V5pbdGhT&EUHhyVormEa;~x4u?6cN`3#
z(=%M^kmZz=#t!Q3OMWx6MG?Ci&VJqZUVT8e*9LJs(~T{)31E}7E6)uF14hrP{t^K|
zBa4${h@~d3JZLc=`$>2+&y#AJTkvZ7-o8*R{lm;8<!;1{_>1dO{h~9396Y`=+k8i+
z)C22ry75^`-zRO<$o=puMN&LyXf*}4V~Eo*zQ^Iru1R+`Ei;TgieWva(9X|fe0JY~
zR<B_Hah&V4pT*(3q+S$`_*4R4Ka;~Wv+T;?TR+a>oi{2z;kh}O4jB(Gj~0eK4Sts)
z^eBy{fmip>8<LrQo0Eu+SQs-yIy;A0{z>WvqoQZ`{wj^JWpEXKG%bBSC#xo~+hK@N
zfY>Wp-{FJ{_%PZw`4X>}HbO7?2iej7c!U>Aq(N8V*pwJn=|h-8%&UrA8di)@dSHlw
zf|EVu9UEf;b!f^(DJm2BNrLcvVZPpR1|34R4!wxgiXV<AikOOi`pt>j-4f!?e<+;Z
z^!iqvepF*i<wG9a>i-=^hxr=OaB0n%HDkcy?#YthW~3f>tm$@6*Nr>cbElFL6?Ux;
z6`P-#S270gA64b`ExUahtkA|O`R`<XKu`H<U$2vMGj$`E`*Oa#aUCFQ@0uXlXKrTY
zps$ID%58`JITj=kwViwO<pS?P#+3soJcWg#*h$EE_!&+kv{zPi#KsNR?i6mew<)GS
z@ULm%%6&8F<<<3eN?WnQqk?qWak8U&XSjfurmmR<uKnrFhc)<A5<f?Y4!;1F{OIq1
z2P}5c#V#h(pZ-riFN5pNh-UB5Nz2{jlWCCKyg$%2o`S=StG{t;I1Ngd26vAX9O-&W
zatMvx9_qjzF<*q2<Z~EYf`PmHZk8^{%Vyj!TswKDB$}X3OIpUbxB%si(~k7IPREh#
zf5&{G--Au`h*S*;x(<LWcQeJch!KG&d5EAG_$&u^k$Y`Ha}444M)i1<x-DjVz9zP|
zD5L`Zkz;*H?*JH-i^BnV0w-*X;;`u`-o>Ve97?+8vnJIwEdL<DKYNW)H86bXV0hdP
z<wC9s6O*7YQB`G!JBe@#%*B5qHbuL_&#qMWFv72NU@h=YQ8)HKT2?Rw%?~KEebILv
z<1Ohp*cCa0nGv1AxG{{19-uJ+vyPOt*s-{;oE=VfLiLWuLV=wAch|@;kO5ee5a4>T
z?pddA)dO{{TE9RZa}<cf4ly_`q2hXhx<<Ew3RzD3Arubr=!;MFPG$94bQM#JT{95N
zQDaG$9gBdnUv{Ia|A_CXd098LEkekbiI5`i*c<7%44cDA9-Zzio<l^Ew++tABuHPL
z_2^%33Cm__xIpGHA=v=>_=ep8%%GT+gqHFm)^Gw@%Ww%d-}w4Te>HDh<s@$@e$y5N
z%#07<7}N0&BA%>>Wz|mKH~LCUA{z@_p3U&}e0w|4<ZKjYlOWwpOP}5=hQAW#Gue8s
zVF1=bNzBV{s9R@S!erIxEIq?%9hmxRSByC&+KVY?&o46h8oJybGWXGeeN@C?cI#5c
zF5xM}@*N8!xElyo++R5Q65$lC{H~QeH&fihZsMY)LmkhJFAHDunWCu1kZ;D70o(!O
zs+WLd_Hgc+Cz>9XdHE@8&zsB}ZQ(epS$-Z#(2adxxt`uE{=-whu1;K<_{~~XzV4aP
zYh9{xJ)_L;-Gv#$YvGxm^E0MEO|pz?8H+T?GHPebw6+`tGT}KwEIoTkv{U6Xk@H^+
zW_nL|5(<+l*dSj@34I_YKE|IcG#@D;0Ds9w6=n#t+h9ogCrVfwE*^qG>1QuUHuXJO
z2}Mel&cQOtt<nSmBoYP5kHs>SUkl-aL$s1-{I8ZO=yAg{@Z7a!=Mg9$hh=AP@sRz(
zWjc0He&-7izmk6eI0e986i#*8A3xE_H|}p{(hAB}xXbug<e&7eajtXlaGeV}6g&rt
zYjEr{nXnm{`a5f|mYa;Fy*A^-b;Sj;g-lh<>>vv;y9Wk8K1Wg`YDRFKB}<#4sR{QH
zOIvq{#L!aFzn!-DvZGmC%UP29j9mJY1$Q6k8V92iLOD-$+e3*D5NZ4Y0KdH?=F1Vm
z(Om<p0k2SZHgD)w35Q;17!$-shmDaA!I+>xbvWT)jls_%{BWPZ*QtgLSe2@=Y|iL(
zF}yZcIYf3mh6mx=?i9~a{pY%M0G;Mraq?*#b~v<NzR}IUhCK(Yb2}~Dpnwx2m-M*q
zNrk-S3mshRZ8@@3<$0=<W!$jfx8JA#xb*zD$o5o+6iBYS1hi2VO~;eY6tYHzuzbe=
z3=*n{HL<rZ!f|lh!_-fw_|7(mCkBjBwts_~(E0b(p|-`=F3BGWzVGnc$V1FIv;0Ls
z|NK|WrNB6J06~*SOM`VgT<GigT$)h)k!3be5?T_<{Hp!aLN?Q_9#H(YeoDR8kfNbj
zcU98yaJbuNXDF!FQeeEM&T3^0tzOliXsB*tXN?GSQzOXWlDc#S0Rk*}UBbU>O$c^p
z8<jGV6`52Oe0bi*;TnL@(JI?$5Iz(fqWd8ps<TTohYkK~m;{qOh(DYDgkZvOofBEB
zW2Sg1E^2tpl2MX8#YOVFRgjoUYP+v(`c(1tE`A=+V%?@3+4(^hp5hJaPl-vjCThGX
z;-<KYY$CUS%IheF=u8?8^E<`Kf-8khKe>WD*2AW#bSUuaHAkpzL)$7p;id7B^sk7i
zOXN6O?u2rIj*<wtFjp!WZauq(1*%BH0auqHeniK{vt%qevGW3|IR26=Xm@w<p?!BQ
zeQ^H)RPZ`a7X%P}PZA?_WLr3sk7a;>#^)$zpeiV-(L<zwi_dp3MpEU0qRT@l)*RR_
zbZ1IAvhL#cqaX!{oPS>)go%%e#_OA!r=_H%m0+&0f&<$;0#~A>sr9Ip=H1}y&rTH$
zy41NEcS>PXwAz-ci=kSCqGXp-m7P;8R17w!7^#*qjcDmUZeaDUt$xcH@X}E{X2wjS
zp|w&Z=&Ji{mNkK+X|dVcJw!^|4L-W`V)CJvVp~U4kGclJ)jQqZ7l2{jB@vdGk)9!8
za`ZAQCi9Cg+-ZEZkvfTUcqsG;ozB~}=D%F!k4EJW`A_y&1v<M$e{G%#`*bu$J9m8M
z?iF;AMLN7Gena$`)KzQXV*+giJr|3XtqY$y>G(uO1|}gj7_82Wo`Fca%UK!V_@}+f
zGP1nWZ73zzi|Bp4;UbRGP}fuc1XeJx*?)mL-A$;zKF!W|&b~j{cKVylJo&h7oa=u_
zsaV0iw%VfQ4OKHy8>7!0L6(zp5XpR#bs{)BCqPKQO$*QBzHK0NcYW6tE|AQH;@e5M
zH3Ajt1p-073D<s{RsSp6@38M{Oa)WiKlb3R|8*$&6VFGK<pL+>DYjlVe9W(Dnr0KK
zL2B?DU1RlN(5;nx%PCJaLrOpAT~;7~+8x>tkfQ)NjIi$_bBID!NrZ#K2f%3(G2nBU
zM#s49+R4bOh$yk(-ADpUjF5=7VHrq7oN=z|CcEXcF&zznV>5rn#A`<S!;6+D05UUl
zvEd&_V9QkJ+&X#vU>+zsZz#4gfNsHspR}0QGwbmnjcLT<!!Wxsz)k3UX^!^?7@iA=
zdzt1pQ$F)9J(JHnR}n(OhP^Ah(|N7W#}?eCDSd6M50n`O`0uz_;R4*Z2kiQxk;9%J
ze{K9W{EhBEO&61t`S5W$xtYMu0J!sIdL;@O3}HqiUV1IE!{(owp+{mO`C`PasE34M
zf-b6hYN^NV96(LYDz6$1%?2aQHT5R6qIPgj%Y<|>?K=fe3kE11$qeK0@=?GK%|-sD
z3Bw)blyLA-m=RjO=hb+ez3lB0Gp<lFlfmzO!J>XhdKILhGcDOsO}$6NqAXu9pstU@
z49-j8l7|)0>Ht*HnIN=rSydVIPOVfeAIiWVqx^!xPLgSZuGN2vlYfebgEe3}qU)8D
zix-?{G;r+K72x&0zw@|$oV%?6mMz-?+s!@z1x4vJl_gyd<W9(g2lrtH%P{yY%#}O^
zr0E2ck|2}+S_w_nser6%q$L=PMkKN*<Ov$%BCBA6!@h2*fhhlIo&jSRSvJsHVyU^t
z_frqukW`st@>jV-Je>YXe_8%X{&})M@KOxcU9dRW`Ii;d60CZZ@0d4wi0*hf*ai?<
zrp|$0Ch-79Yiio$q!eW1Aa!&iJuNy=HcV`n)L8_^+Jz?^jZn-p*1KQ}n;IYnQ9iIT
zJ;rR<NzGNxeYWvVbohl#gB&r`FA6IubU(H4t%$RVCR~?39ZS`hElpvnK54Esx~fMJ
zhy1cYgMxf1H8BXchHfOvN<UigBe@PrzAN(l1uoNIt|}>z!3eeVI<u6jl`2-x)?DKj
zjq<m4$zVEjo0~F0QpJWyn07XYnEACNuji81D$Y_|V&<HII$f*_q4QTh5p|bu;WfX-
z*J-o4oDTY~=z2I<Gp=}D!BM|nJ+c{K!Mm>i_p*RR<Du9kXm|#PmQ4VD9dKGqfe<4w
zwwwoH^{hwCWD^5H0Y6MuwV(_qln^*kP?9XZCE%|Q@C<6Tj^*d_o#xptjFb@1cTaka
zK6Fd;ZMyCq_t~x-hr<kE=)ror7;;UZpGf-^;#E879@9WeC8m6B1sF;pQ*vy#C^w){
zK(R!Fc`+^g#e5w84isNDEkT=vCD~w@t?Ms5p7drV_Hg>HpNCbklMNPTVq`I=Cu`}M
z<-3NHPNcXcZG~b=FQvxb?-qJ=yRwN=mE6LK6CM@Fh_R}-MtSQP*wo4xw^pTM)eXv?
zg?{gLn=H5u_ZD}}@am#F{hR2-mJ>Zu&k<9Rf=+p9P$}4mz@@f@hI8FKkroF0LVyHJ
za%$9mb5)!sx=NdX8UX|<22k1fFim-3;P#=$dY{9gZ_;m|KmWLAgRt?>WJ{ze3#iTv
zv1H#&&ZoWEoIwgGvC~%SRW4JaOo7*Y!<>;M#iB5$d68&qV(EOnWz}x=bbIfFvRFwu
z+-{cnxRgNS<O}DHiAEp)Ts<$YTN^Gu=hcr^8fltPnbhs;TX|^G#-83`t$D|8gJIF>
za&$Sj3^gA_`sFuz?cia=?d!ZDm>s{=UZdG2wOk0sa9qCvpIrm`jBNTP1_^lV*Ji{2
z3N~-g<K|-q=Mw%FQD)C?G|*)?*oM1ii^f<grHn!>YUu@V!hpmH$sk}BkgPCz$k3q4
zzBQxU`Y8l?#hUL>P8hnp3}#^|i;QDk;y;7jj35L)7!e{WK>xzs{R8l3wPJiMFd|aM
zIUqO8bS=$$G#9<IP&a|Ss`DM4_>E%}E;??A|M%^77ok|y^Xv4fpHMH{F^d62?!FWS
zQlW)o3>A_wYS04Hnt`pyRs0)rBXUFCYSJcW)U3d^dwAjMx8KUa?gS2}D~OqU$mr?F
zv+$|$@g=VoK&f1KUW0D;_5sO+!yDg4_SGq{D||MQemJz*O@P8IF2azaX|QHCp?$CA
zR40X9_kajL2{ujmX=DSXxpD2<o_^98=h73kz&mj2XCO0r&sCHWa<@}~buP8xObo7!
z=&f4>%}JT=mPAmNI^q;E!wKbiYfu$U$i+$5UUQ1j)uK#T)(K3_*rjab)VyEZ@Lvf0
zP`Izo;)P-eTzJ!{TM6Enimfx00cdAsvqfU&N|VeUJiXctkIbn6P~Gu2mnYkFG~p!*
z1+RiAX=QaBJs6)J=N>7{u!MYMRBV{BTAjrqK>NXh^mZIMf16@Fn#kfPNS4Lvd8{G7
z@`0ZjjE~W<>F8y^F;^I8tQvjiEbC=O^nqP;>A%|WG%r7(Yp~9?;22H<Vd&ktDm2U5
zPcdqTYOl)<^(-_i<@;VRGQ^~@1IjE$q@U?4$+NH)uuIG29v6YxBJLF>e8vG8P72z@
zVPIOdIt67kou8vCV-FRdwd^qAwWXQEQC^}I#vywM!^y$-Sp!rn_Tvd9O?e9GX(__z
zZ1KxJ$aupyc%ZO+^03fcb}$rCSUh-1Z*}KSQ@47#obztShmYI;zM?<7PN+z^zccf@
zO^{8uyJgdqEH&i#Hb{@QgV+Y1_CH0}3R{f`eHs%&zjKeaKh+DiAiH?E{_t?=d%zb6
zIBZq->lYmLKL6$_YOc$Cqv`P#l%(?31#uLZB3GsQV}E*<Qof3`6+bpwzWnj%+Yrip
z%DnP)1XD^ub9kLz8|Zi74weFS_WaBx9VLaMC>&c8m>aW|N9uhQw=)<l-aAMUgHCg9
zOn|YIT8Ts0$+zuY_pMfDl6QsAx5FQHE6^ABy9AhK2ztBBcc0|c#}k|GOLr@6V4t{N
zWDE#=x#{IOZlz$KGM@u7ig$-|E7ISF6EqyE)HlUa;bBRxNYR5Q5=@!Tao(HDc)ddm
z+g44zsf%C`fm;w7Ebh{E6*EB@cRr;ap4G%X(cQ_2%cculL~pzRu8{T8%|3)m8txHc
z|H<bOPA~PeJuigeOf7#Bt!Lw>OsIa_9UT3!h5UC}O?<rDwbwmf3ndh|JqVK2JP&^B
zpmoS=8D0Ys*E;AiYJ!EtO5+#}f_YFQga|~dU_zaoN7u(OJ9Kf5s51N!8&F$s*|8!D
z{s)jYw#t-veHxe9O6FU88Y!#JJ@{dUMACfd0aRHwLou=jcJ4`3-R=V>>=;Xtl>{rX
zy$Xc(dL%mmwQfHdwpe4vlt{Ny0o5lfY>Mx8C3Wkkn*0u9OhSxp=_GvVN~gB^-2Fi<
zr)V2Hqg<c?zP$CXd^0_FZfSxH)}JNrN*t}gmRJ3*zo{x9I)^m~f11)(J)Iq*cwK#5
zT-tr51%_|!V4`m}DPT3D5knlt-$sH)E%<975i~C(gtq>rHD3b#RyS5U%=1pSt3jbH
zzt3ls);05l`FM>k@g*D%*Q7v+&vc*ANu7f4q&XNpBeUi?;U7`>F48tVWGwXED<x$n
z1!jyiDZU|N&+@<cwA*}wf98?mV1g4Hq1kJE!5r$&VZUz7DeHTUOLOb(>GmEG-D1;W
z)F=n@&hD1gX_ba~^tVl2_DvD9+v#hMd7{xXW7m?x+?yP&>-oHE%hus=?-@$6w8@vL
z3&yrUz6Tny$kTa<F~xE}MBKrbR*3Zj8ZHnhssFvzCf1Gl2V;t==<BWeMVLig$w8K8
zn9-><Ss7lEO0os-ZD8dH@0Qq0^QyU(4IFNSGP|xwBw;84chFiHn!>|Q+KdtNp(`st
z5B`)}5~m}93IQSs7R5tSQIUEMIk0zQ2iLuRW4r^1#F*oc<f-PcgP9~Rz<Y|xY`%(M
ze{gXJt&FWg{IfLa#g6)(H(~U7tL`~-@EKRiX9rpMTN}z}@vU{yoXwQRxfPo}L-vzV
zIUh<{@<<jJ_waj$;nzUF`6kJBT6?2mL)|YCiyEIuxXw9r$f*esp&g%S*p=r#7nw2~
zHD{w+*)t-TgWZTQ|9{VodnL@R1!s~^q!tt*;OD&P6!CGKUBGaSbz&Qvuzb26SAl{j
z_wgKINt9e4QOnLAc9#~;6M;`NWb1)Drra3cJ{bF`1xYl|4gR4KC<*R59EEHSV%$FH
zp5lUB=ZUsN6CYt!GOE*;5VIXl6}TN89${ba42O}W0=8qyx}L4FZf6<Ot>tQDWwt&N
z{OWl05ux<={HClsAK3J;2Wp`eB+^H05bYtI{O(c=giLQ<j~;ak;FV;3xgs+z3Jt6l
zWPW61K3sFYzyI{@WXu@IYuE~`E0pRl;vR4)%AjUWJ4dMf%;A4$$hb}bOg^OUkeAiH
zU%VSJe0xhx#7I~x4+gymoyj!4_EySXdY$`4|1oayM}JQ7?uKy|v#WB8g@v8s`_*rA
z3iq5c79Zpvxyi7nBs-KAZA6foB%5i3%gB)Cp3|o7Fy}>0UpVW&;0BaVJBIVgR|tAV
zgGLJU5TfxRio!qcK8EhtigQ;<_u5nG&Iba@YR)O9$CjRbvU#^Wv9F0XwS_kGKlj0^
z!E)<$Q$7_?+r?8^kF;-tc_@djN}s&mX}s7QruSn1m^0ehK$Y|Z`Y7>PInU7iWVq*Q
z($98tSELrY^d^B5#w{3-+OPB}xy><kc0ng&)Y-skT`=f_$y;<>^j47)i05C_$MMl^
zp6|%$P{&fh&C;T5uquR*1Tm<ImeVLBZ(+y~!!^?5{7h)I0E7b|$!vSkCiU<L%mkR_
z-Xa1(BTn!l7X%IE6pU%&NiBQIqlFHW5B3$Vch~AS5Yn{;6jPckGw^n&XxVonG(>ZP
z65j<DzeSQPfUm!Q{c8igqYxf+C<0aUPH-1J{hM}@^Q^Ek5AgwSNADCogGYOt1<C}}
zAC+SS$6G8N@au4ZOss?(qI6scW-X~tL*ViSAr4Vx1hwIpdN?c~1v~L2mFJ`M-vMoi
z^r~re6yE5muO+1H)*7%0z8W1ow}u=tR)s7SQ-AQO24kaT?_x9#e_7mCjX2YIM@9*@
zuwc3%rC!BH=HwqK4Ys8g1X*^7=yf0H4BfN#vzCnq7K_k_7SZn~ZP>3kkx=;9un%WB
z{|>qQum17A5*5DuZ`%*LySFr=_W)H1<@j;*SY5XEL`mkvwSdIr#zaRs`?$58xGwEj
zV*OZZNx3i8jKVr;?_&E;ls_d>uoQ_zI%Bb@(x>xI3LTrj!tVbcW#1GdO0cy%wr$(C
zZQHhO?%8A8++*9eZQC~QoOAEX&HwZ#E0tB9^jjxYy*_oH(8qB*=hAZ@(528F6Jhtp
zg6<tmcHS@QqCe|a*bVgTcz3kCJfqwOcA^l#0OVOa-Kz-UISoKl1@`A}uWP<i>?jg?
z*XMo670tLt=@MSo0V*+2uyy4@PDa$_`x%1EQB8)rM8dC{7RXUXX9d>gGiQO9ZCG6v
z9>nrb3J36erkEWcviP2`_z~MBijRP56~^k4md$GLLZQ4TdwXF&SI?U3B8=CWEWqAQ
ztDT5}oTjxTr5D;p8G(_)=vlXtzuLfMSk6}HPEkw%PYcn(czvsx#e};^msWf)-`e-M
z*L(!7U1S>VZTU<0(B>RXOObXKKjzeoDr+bEo6GW^DrtJ_4)Y1ja0-fGVAw=AlR*%;
ztRJR;zR(~JxnyG#$(IauVZd$Fh6=WmRG8@y?4SpB0tVa{*66${D5l;V5U$0K<Nz+%
z?TpO2%7Jq=xhnV1dqco_qe!X`8Hkq5V91!Q;%(Ywh~vmz%%8z#IcG(xv_QT8ogjLX
zZ3c%4rIrfQa5-PyofSz1I#e);avow^qoprOf5Y_q6ZXP$DaYN0o0yZA<Oa(zRJ>l0
zR$V<WQ^uUm?;G3NOjiF_hWI93N|HXKbWis=)Lqqelf;;7YZX!drZ|yhy-XvXP$yo`
zC8*sA3L-_ogIrXpeWtj0FFjmTmXo%!EHNC%DhA<P*7z$-K0W|rhkURZvazMrctyH+
zXuhMM3^F@gi>#VLF7fC)g=sUFqT|=x6ZnwkZhO<F79KpiQ2@PnNBZXnn#ldgjf)_M
zRe+~`Fn*$NLIWz^Dwxu-QKx-0M$bxuxy9Sr@8}6?-<Mp8mSz?$VILU;-vkCz!_G->
zj20E-<3S{SCMbvA!GJYkkK+=y7o6ZG_*zKlQffy=bc5_j<b^wR=no~y)~^rnxtsA$
za<hZ=^*62s=TbfBq$h{N0_R9EgVSEC1pg5Jb$uhIBZ9GtQNuw;Hi<}(!nkG7TYRel
z404s`{*=6pFT*nI_cy|Lxj5Io6NiN-ADCYAk~;k}{PUm@cA7MHF)fK1tAz?9s>m}{
zWSz%9zltg1OzRUzqozz;71TX!%qy8H7-_2ZO0C3hn5TU@VV1vSUwH!2ADsrP0|4Q+
zDC5xmPY%FPd6oAB0u5%7olXXV%B4NA=TNxLU~D|EJR$c~T?Rg!$@3nUMWJlc#bwJj
zOJ7{)#`9$t)w&e4|D2LRIf48ezK6+tj0sO7&upfOJz3OP<pf41qir|M*<CE^IB-lG
z#@<72EZanKb-lz3-D?dgfhVtq@gu6Kg+a77D+JiW%x@w^dH6wp$qjfhN1U+udE0);
zGB84w>Pp?Q+SKBg5tB#znKm&DHcrat?<L!~=^<ika}GSm9qli#ZY7#^dw0<z!#9>6
zypl=&9Yf+x7c=Wm(d(FN#7-MsbIZB4oZ}mIbWbJ{ThM)Ir6Tb~4#Xrg1tT_o-*)T0
zb>5VTGlT5P@b#foQ<(>eSUlg=ACzF6M*OJ0B+Z_Wmp@Uy$o?YN^kZf@Jv;h;&5=nr
z*$qIRC7L+882F+3OI3TH3-7ur!D2hz;Q1oGaJA~RYbrd!Eqok6y&}K~^t>m_1IeOg
zi;RxTt%7ULrY!P|UjQY|=jwu<AVCCzMS>-WMV=|tjKvjgv|8+EMySR&Lu+jnh#`2=
z$JTF#5F@rGJli^~-H^MbprvW5I>D$)0$rZP;vHs*n2(c>ubshkr)mkcDIyjw-LHU*
zuOc(2-ru&!g00LN{6t|Ix34)aMc1UpMwLaWQ#a8EZ+C4&6{;~JZInJ}MQgR?$dKKG
zrBr}bU|MeKL60ZpqYRu3n4OnfCw+6HrSMZeoa*^IeAZ#G7^Plzi`!?!7?du&Wz5YU
z23ncjhahZ+Ej&~sR}hT*6?y5`^fo>%?x7WV%C(v|*r>y^7-gUtaW}7CuAjT$cc<r<
zUGiv>hQ7z*S9N#NTue=5<|J*p+qxai#q5LgJ0`7Y-lnI8spqqIaahkN$DbS!U@}pd
zy=z1A^xkYVxNCvLjYBSbIB{NaEvU8(dAE5HssFJ)7T`FzG$>J6ry5`jZ<-alj<Q}u
z{=3&ZL<=?xTmR@B#pFbX?iT>p&o}X-4z|}z<e`leRX=>c6$BI5YaHr^N%+I+shvK9
zxO36-;3vFn-e>W91Okwqcs>zbP+R1IvXD$8v&cc!Wk`cVAaR{3b=Tg!ZJOrCj=%x2
z_n!PA_6hbIp@(3jZ#d96qI&?dhC}4P{3uLBM+x;o$Ebf$WXUZ3BzN|R%8n@9cbP3N
zYjyUhr^jL+cL10{7|j6V&gZ?XYlBr-?Zw}GoTEt9IUKl-j4pC$XmW7-dYFOU@9&D?
z(IAH1n>!2Gmy#ggz68Vy&@F(72J2|-!Y&B>HVE58<YvF*!J$106ER>sGej5!O!sRH
z+xu&@hXrpTPuqU)<-=Cciw1Drdl5!7OU|}!DT%&&f+8h}w*+P7zha-iw{;zd<0I@k
zTjb=qhrgkK=(3pXEbJu~Ah!Y@l&@`|3c^TA4v~c|@RS&7CUbh3(cuV4oM+r99}1hy
zsMby`Xm6iNO2<Nl5tehv$nzNJq!DsEHyH(&QwPg~8AtV1+ZFYYec?L-FvJFy_*GIG
zCaYKpkWGYo$?pyNQKQ=LYW_p(Dtuo1VBiIuSLip=XLrdp)r;<nA=f*7)H}t%<WgZ2
zaHpGwG7pyJ`8O*2ZU2<QJ$nR^c(aCkN;Ud}`}6b=(e=^-*>h6*LLlbY5YWOr>^OCW
zCDhYMebD?fP21*#Gc$4L9m%&kBiGb%I&jQ)1bUW%tf;`N01f0JdDF;`i96pP)tnF{
z=;2sREGQ^-qAHExpB$1X90de3ib(o2{N0=G8+!zag>SV;Zk@3hl#vqiU!5TOO;moj
ztZmPe`Uco6+!Qe4zCg!APsfyW>g#}3wM|EnJI}9^75nY+)@w}(pN+x6_w9{^F5##X
zFQuA^yx#*NTgO5|CZN2bGhj!SXz)n7zwMt+N?n1*I)Nzwbz^eFO;$8VPKtV&$$$m&
zr^Myuvb(#R|8~Vsy)%Jodzotd`fbKaA~(kClTLl43o@aSQLaLa!4qNQMNAWB9nyZ&
z5T9t%n1bPbySEP8AYLmrouw|P+H5i>idhjrv@U@R65yk1;}B8oyT7q{V@j-lLXjm_
zTwei7$xZ$<11*$Z_GdkJ$Ud<i2_^E+wGnswp6P?PBA^&ouR3`L#v<2%5uw#WWO5bw
z5`b70`xC0zIq>P%bt7oBf`p9JM`HK=#F(tct|45Gaqn0Kz<~*9sXHUEap!i$4es~7
z=zQ^BL5Ak#=gHO<J(t(Y^)>#K86Pt{7?)B@^XrNutf-4b&?+y?lJQqdkrxe9#QELE
zi}+K=2=~wS*Evh9t^7RCzwb7dTpVNBhjZlI?MxP2-_$!jnH2BL-Zn@jAwzz@3yd?X
zu0|eM(ilp<7^;hli5+Ca2>-+L5pQsBZgTG@b?zT`m#ECp--y?O!!Kbuy=i~s^$<KM
za{bTS6J-Vi#=l`l>QfyDN&_nhSVb<F^Jpg6Mafb}Y?UnkT19(Ho<vwEb)<|e_3Pst
zPo6Hi22P&zn~4=LCs0MD82hYIM_pcdgYtVs#+NK-YXwi8BP=5#G&HFxMp#BijBWn0
z7~<@Y?cW)vxD+Xm6Q0BOF(jOz9rO5)hR1S!)yhecW_nHT2=6e~Yet3l`%>e1cTE1x
z7RwytBo_|YjC}ZVwOl(U8oM((l=(IvS_zRoR5qq64bMxq`e}KwI@#T|X!(AahOG1^
zFB$phC@Cl?)x?eRK{e}Qye2Wp*oPmkWM?y*^ct?b8LtfY`frzhYu8sD53Ge3j~`?x
zo^k>|(d6&SmEFN;L*wbM7p-7s<277tKUGY+H_7oBC2WqDL7t$D)1t1UO9%I9ROKZO
zh6(-vu*n4HG|XjQ`S4uH91>yX<1#FcpA+kK(naLw5ah^bRSbHE@VNlMevr+)?FqhZ
zsXQBHKmB?f{4hnBQ?nCqsI&&Yn*?G$Ok_@T|4gG4KOMzB?QszNAV$&m{T`XS*-P)X
zx&5}gAJfT%x(s|ft<uV@$93?p<>X(XgypcddFNBUr}fUoj$>vF>CFr~;&_zwbn9VN
zTM<bXrhL}jVCZr9NmGa8;KTaY+n%TGFs%9J?eb>asM#>Ic_)K0$N8+Av=1(|=Yz=B
zI?eNEjQ_Pcep>AJNC!6lSFF1~-#fnju(-L;<FZfE?>qnL@=eFpOWY4aYUFNap!Kt-
zJ@%r|w=>X@)+Ybc@x6LZ<G!r)@b!MbudIE04MX2JkTGxQ&v@*u?1s?GT@OR+XKm)9
zcXOoQ^<&a^veJ{(|F;uCVtyO@{ybr@XztvdNO%P4_>&<{#9)qa!a6^&R^<^zBmApM
zCialhT2{d`0y&PR^Gcx4E$U~vk}JJWyLa6x(DCp+iE&RTJ^fOL24dD`FoPbhLWdFM
zY+yBRHsfjh^qG4=o)alHi&A+8<RI=#uN%g+?&P&rDPlf|X5J1ndETAo3+Qh@wg2AS
zs#aOKnWTWlfbVC3^<W<6G|qB2%wmI_!Z?iz^aI^fLe{i3z51R+4&b4A0SRD!<}}WI
zG0K$@X8z_p$i*BJ`I%N^u<H@fc~!?qg*2WWhzrx5gWvSqHAW%#*MZoqJE}C@{gqpW
zCmPbzI2@A08zU&@I&%<-H+J^g!hP-*7nM~&xEkU?84Xa<rW;XBw#b6I-zoEm^E~4C
zbY|MSfAS*Da2C&x<ikIO|J`u;n@?RzTD<{P$B$L*Q1c;IGnC&!fq-guTgoedjA0&z
zFXD*6K?{En&6!Q4K;)x&?h#GuQ`C>*3E@8rvexDLGr*Q#vyU&TU!9dF9*=IyL*g<g
zhkzH(9#Bk7r&9tN$v*TkT&o>K?4#IQ^<ah^8Y(f%jc?RR?Fcu@QpRKID1wc#5Mlx5
zhk@2a<8TCyPjS3Pe8=Um5qDp7;MxUP2_#=9p2J~y3I^=+z|eX-cJ{F4g^PRFP%(<O
zc=41$C&&=dzJfPA<xFoF=L3^*(vD$Q5t3FmZrUX-6C8TIu>d6I7u*fn4ntXY)>7LP
z$j{Rg2dU#mIB1|BpcQCfpwqGwDj-Tl9|eSPHzsSptK%HdL_-AY6c;%abW|4(z&IU(
z+#WU>41#Cl3}JRnn#Rp_o_C!-NlYYlka%r)bn9;yGde8dw>ZCk6AL-|F2Mu+JBWxq
zC=2C)OO+e37F_z;%S*Bx_qeBI9ISd8l%^x*armKP_#!x*J!@M`#Zb6HScSgBqV+M7
zpdf*4VUJ6~L5eC~7|>jC0`C>xL<6-1K7KR+F5qs{WLM~&?v{<s@Wq7793`up(xdO<
zcm3%Zt^?IO7yuFR3Ea0et4-fS(09iGjDP~OkmNgV8S)NlQb3q(e7`v8S{V`V_$B#x
zgOhtR=w{%qoZUSJ!?igHA^P3E`?jb?s9#0LQy0N7+OrOvl5gRR0eMgQ+tPJM`{bax
z=z$$y%~0+Mx#n|=rsgG6peYL#&tb6}&oYDY{%84mF`q3z$}QQMM)I^LTHyAUSE$i~
z&KwH}1u=9vK1ZuvLkNuzKArwiHo4Lb<sdHhNl8uwJYB-xWJosqML`LeUT9oDA3%|&
zI$FWO#s@#w!l(u#px__fw`t4*n%$}>b!ggo!J9dTj-OcPX4=3vdDoNs{4$vr2?q{l
zaeeCcD;8MxVHm8NPYOG=i_z$%%v=GeSRYep-&?b3FTT3dwf44r-cvnfN<4Jkb`i6B
zH{f4_zfty$7*6f!XmxdUlW#w_;HOiCdUykdc66Qo0^^TVoq|k3pRSXhU@0mOD8Yl%
zdeG{^v}aEO8-v}-efxSmzMK5~(fhONslDS1{e#=()#YC+4!yq7()Nq0Gv3<@b^>R-
z7oH6C^z=!iw>AfBKk{=NcPzZo$~)xTWMAUl^zel+A<-qGOjm<dqK?9X4DaD`owPRV
zw*&Hd@LE@uT&5vBZxydR8@xp2sVuT#D*L|N84D8qMK*9b{c=OGYY*6~7KLy^ka1rR
z7dCb%Gfdj<9<qcklYy5CgcUIH7F}uUQ?<%h(nR14fmP8cJEeL6f##!CNij}ODU=~y
zgDqLbLKnjZ_RfXxpc9p|6Q>>I7^j6#5kR>+1nImBMRCD87=2+_XA=q{bWqF}Q0x$$
zrp-=ualsT}h~?l!`PV*nLHVu@6h1{E5KyX+7*TrtP^tx!jF%rGVUTrAjUXu4o`_@;
z_(vvaft+!E2#bTFHM(F8n7|*jkV}BZqFk$&thXg*1J9sHFB%3g;yt{`NLI}WCGpn~
zAF44X59E3zA6)|Q4}c*i+y}1S>wui}U-OZ;lK|<NlW*cRtOsNiRdN^24g6;kTr69q
z2VgYI{ctG*cNK#-vhxTMv6BFOa0-mkmT1Ny$^Bu}&y#HZX9uro{}hn-kbN28V-ynH
zTv?Y|2*QfF0!EJ2oh@#jHD%<5n;nqtw_n|DhNmKJ>WX0F?}g39km-8@-g_JTuIR4s
z=MmWjiKPW3@xjunPfGQ3B#`sF;^GO*&Veq+CupT2_q}#kFP2gbdE`5q1M~HScQXX!
zTb6_429)2EAzXSO(EI8SX$vckqE}nMPjy&ow?CY+N6!k4t>F#O8v9=g4K}+$IdC+&
z(*B=a_fP4&-+b`g>9R?TMKysqY&U`Op>*P$N5P=JlH35E;S{eU@a^5iSM`xIxA<7z
zGo^lcd=sIuq2tqe4mpl6T6&X4R`-EGV7bu-7<1rnQK>(MpyO6ZZw65=sU>;Xy>`Ib
zSA@B(h`KFDupR9vk5vnRd*G*6^8?{yn`(RTnUtq4L4yr|<tHqafaDxD8g#lv*UBMS
z^C>&S;qb~7G+qhB2DSkJeeL}eFI|1IkRs3kyPUXnS&|=f%UK{5eme+NX|l0N)d7Wx
z9#79#RiHF9TtfX)LLI45sI(_ErfchGE%vlmjrkYbTT@sGkS3eMjZslHe=XJgN^N&P
za8c$qwp~?JtZ)@h0*f5sq7XQ`IYMP)fsM#M@l89(idnfyPeJa0=D$IIa0mQXvbVef
ze#{!5-{Mz0@Id4e*GxB{0f03Sv?Q7xS&mJoG?i36fSX>N<KSk1OQfm%%c>xz4QoK^
z3oT$fwy+t27SWo)E;e#%w)Z@MJB;;&Fq|_C&7{FXS(ha2cebxU`tWQLVQfw}K2h7h
zdXMNrtMDr&YvI80ETwdSRE&BR?0=b*wctE!Iidc|AiQ1MoL_Bz^)Fs09w(2dX{w5b
zT}Pl2$dAda@=0p}fRc!HPLN!Idm~o~d<(mfgNZ>+noe@8p}+~Pl0*V~w3|j!{iKmC
z_KL;b)uxh9-<^PKSqR~JSc0BOo>El#$x2Z}0TN(>^TXOIYhkihq-XL4(2meRKP8wp
z#@U#%Anpp1M9G7y30Y=%()^eC4Ka9T?7)(LnsDlskxHB#gYXyA2LwxaaAp$57a>2-
z`C!hu4<*{!@dM~BHOe+AvDleUqLibLRqF6Qx-pU%VHXspWeTD;8fbzo_Q&}jCe+RK
zEvF(hFkCZi-OWrk&{h~3X`w%<tj8@&iO?Thpom2U(`GZh`udFt5;mCG?OM}wb3#7b
zoqbyUU!9PTF)2OkfC335-OxJ`fK2xF(E0F^LG*eK;Ka_fZb0K6>(mk%C^}cy$6NCk
zqW-Lg<%Kc58N}k>3Pd!Mn_vL(_Q&Kq${(^g=o^-YNsWQY^jRt*<|WH0We;uzMt#vP
zkodEcdYN1$c;5QqX^PjCJ}M4LEB-$$g<XO4dKNR-B(8k>4FYB{YYHLI#JSCLI$Kl=
z!RU^rgW@}Y|K@FG%}6h(P|ZGf>{8o;1^olfw_sZQsp9GXVkwrtSW1Hp8you)dfKNx
z$-tN*uJHz>_F>5}BXAAbUN0uhz}1_7Mx?w&wm1edjYzW8zsoFB2SgYK=E{S;ypRzz
z0V3bLgcN8J$TtFU6I69df1O%*P8l64rvkW18q_rwE>*d#B^8lMTIGa;U%6eN<>W;Q
zb&M=*?0@8Tnkde>9oX-BcW^o8EYrEEq4t%U3?bP!A{d1r39rX5c0^;s8aeBKOMVA$
zv9Y%Kq#icZ;UKgB<#ETDmefgvkjd3cMpuB{=Izu<Fz`QpdSjauyMI0VRF+R}(csVL
zm(cB=t)WC)c(F4BED4{SzI`L1!4x*!s!CC5v{$RJ{)!iuh;fAs!4m8WV9w9*n8TCA
ze&tusV_$bD4`gaam8&tju6`|V`C5?#)e@$%YNR~-ZdzjFg>_l0Bh5uprv$9`^|Vvg
zku=qOpMQLM!_8QG335tNH95C>7R=Hr2~9;7{&F#+V;8mEG&vFvpLX-y%+TfXRf)l^
z@N(EMIud(SXZP(l({!X~EpSz{laKjig<$2RAfpbox~XhQZxg2D+qw}&h^t!Hpq#MI
zDl-lZnv@m_ocj*{Olk^?Ikl&00`jP*T%3O@XOMrx<M!PqjEU)X4sR(_&A#lsUiMrC
zf#Bz%uEOT*axwUqB%_fDOT`ma8&@3yen0%Vnw&?%3(^L|m4mJ#e9PJ@JaAH>1gTzV
zSHymh`UjBhNDMX$IBPNbEdS@RVaI)AK<=ct_as4GuOt}!vUULb8Mdl`aEbjR+c4}$
zkSKT0{A^We`Fs_dU~=)U(rF(O??i39DVPy~Dj5Ujv=?T}@Qhm)-E}b;swPvB$WecD
z&vS}PJCNv!64$F`#}TaBgQ@kbqsW8Lcf4a;kU>Nlu3l&0&y16icAQiG%h=Nfr$+O`
zJ|u&iAMX^p!Wk<9><!K^w5@5w8!gan2;G*iq+s3EQ<j|WnH@0>DcKCpm<}pYDqd9j
z0%B_S3euI1p3k?@V%`L=`>zKun4R)tXmrd<7Es(WzBa;wgWa5K7FV{#%C8eX4?9rF
zTOaNp%WRqgJ+v{qzvm?9X|Q7v3AqG%@^b)KeFr5~Nit%~B|-(Pd^MW;Whxc2s)JOo
zDn2+|RR$QScuT5w4Z)ZNeuA2@Du)CY=?8#k0#_Ra^`yuub6JV#u&)ZL_(cY%VIu{E
zW7aB98h8#Cg7)5i_Wip6>S222&kCNU!`JI5gU&#0ND|PnJ2!cdkF%gE>DXE>oS>Ye
zTsc{2i!NC@$Vpkn1&hV`iUj<PT5Ssv4g}~vF6EwzK2|RNpj=o;v{8!~x9r9!1%ShV
zqm1Jm%~L=!tO8LmT)SUPx$`1J1}f?v7VZBSDNl0k?8Z}^7XtSv(3o+<ia~>h&z2eJ
z$a{PJLPGGxN-W8Bh35Yyqri3Gkq8}+yuQ_GwCaVKTWDia{kykyaLstRVLrM4W~j}F
z2m1E~037xhbC`x78(-vDuF8XYq{K=8Jto{t$r1&L0|Be4NN>z2px0V}TivM|tv|gN
zNrgO-AlWQ`Gzr-2qZJx8>POdrZHpJkFKh79jvr;7(}6CRx4Kpv8oy<DclGK*N&qBK
zS$(h{5++a&M%Ow@Zzy=rf&FK}Ml3sF_%E6;P8x(u81lb>qg%q*fh8L)nRCMRxb>jB
zunZ0~k+&(q?S3jU(=smuABS3kkJ0$(do>Pc)AGsdCg87Kr}(C_2o8e1KDzx%o`OpV
zE+~tfr6xf8_M$(`yR&+z*?JyFV8p4yIH-E^hY=nY^r1SRl1F6(o=+n@!C}QI({U3O
zo)n4Y8e;SY{Kv?q<zq~&s<Gu1dc|ZD3WQ0;1x-wp@SZLl#K=+q7G;`8Bp*0>iE`On
zwM}7CS)f>}gqF^rlB<MR3uh&oIW9dtj<sIAwtJnqw#i4(W)F9bx91WNo<WE2NfEsU
z-Fv`+e2*e!QQV|!6Q*Q={xsMe;_UiB%%095UR`i(iA^wuZDO5E*;HDVoe-g7Y`FIv
z-76+W#j3tiG?dlcv!=Enmvd$|qzP%VR=I^<kd{*`%zWjnG+qE=f8mz0fmc<pJIM*}
zM-maI%$uT(Lu>R;M<;#QVP~34--SofPQDhV*QHPXS@_CUM&M_|xVz{)tzV0>%gkU)
z!e?{u0^FXQm+cDQ-LZk(I<o0aJP`5`I0tlh`u@56^47=ZtmlC9|M~E}t(fJou|c*m
z7GlE0a1!bz;hVTJNHbwG;fmg3>#FPE-Lj=iyzP80DR;4aT0$R{F+;zRtNo``rjj5<
zTBg#}m%~#>4HZWClzG{y1q%&jvocGgshhrDD$x`2me8CW_~X!a-tVtww!<6!l)cPl
z&V!M*9gV}^eqI~@2ag*nr9lq0bs6e5QzLK<0zgmJJ6<C^2x*;yfK*jUqBY>F;fVD!
zAQ5qS9y<IizHySK^L$nypNa?rE1CX|Zckw%?xl`q?6S&Awd(%R3EoUuwC0&@SvSIA
z2;`JmG)^k2kw+OxFC)j+&6bD$WWwNl9Ku(nVu=Wvn4%z@7QZT&n#KR_^*Rr+75q+!
zpBUhXA}Sr4x=yRAl6qD~hyWV8EVl_zc9BQgmfDjjGtSalu6b5$ba)~vgaNYsT_sf4
zHzO9kXm27anI7`XCcW<m8_`IOT%jR~BY!bg1K~STp#@Dp_}ujk0ztu*?;udkephdg
zJK_Dt7{kWGTEm{_%kfF{U`R{XO$BvX-$zH6HQR1!1ei0Dcw_j)`O>nAaJ$LLndZA6
ztI81UxeebXm&ee$3B9Srqx%wq5n$}%qN|QLRu^E+^EC}aUfp^uo#2cy3{O}QNfpwo
zx&k*noG3h4Ms9c(D@Pj-FR}FU$u$Q9Py5JV&pdcGiYdyC%PI>kNB#a`Y~o)n#*ve(
zJ#jn`G&$NQX2uH=Is_?$UAXt%f}SCVkmtMO{lwHQkLUNpUDM5_kB_Y>>&x%D|MseN
z{`NYGy9uLf?*h0$mtQA3UB{%Zs~1&ckaqjZ2&KoeS6y^LzyO_{iGZiBC!4Qe4)-bX
zrFDIDdzcUSv6`%~Fx!}{u*C`pxchU9X!S}&MUBiVv1}_OAAd`Y-+;!wEwK2BRXb$8
zsOB|Mxkw?awLERBWd!bK;CU=yY%R07k;-PNaYB8*koWU%Oau-l0iK;q9nWq`66=^^
z-*-X~C?I>wbDBxWikKWoiD1eHu6HEr=ut3XK1R=pTZKd1L$$jvMXb~|M#%PI3|WtE
zn_p|67mrwH#wjWw>-g5XA)D|IC^;U%t)m3CSfO!@0)s58`WuO~UD1IzUDm*g4kn+x
zojlV-^?1D#v72tVjXfI^nTktrikGX=OMY25YtS8Z0*5ygXzwE7s1b{Q2%fekW!3G^
zJbN7$gW$u=p9O3p-UqIb(cKfgR>(*jQV0SbFVIn_3-bUoxiRjoDH7KSdr$tvN?K2G
z<^_lBV-ak1DAzRJEzeiuDi8jK*7NL94cP_BWwKKeA6WWH^YLUm4}?1VDS$R`?v=Nw
z()lyVbtTgQNc)O;yfZFnG*I<LG06t5J+#zKKuXvygiIhIkQi)7c_cpv!~JX8Q_7&n
z!`k292Au|SL#sNkzQvk-u~VspC;@|pjyFmhU$NjQQ9Z+WU(#;yoIQOXB#-WRP}nP5
zl`i*&{5i*=DvQ&n{<Zy7(XrT$^!>l^?gKH(mgT&L+rdjy|9{B}_3~(J{m;7n174A-
zvBIyhRr}lguj&V(0-H%y!40atPL}2b&&H;x)pXpvip4%Jk9)qR$owtSJhJ?_KZt@g
zHIbMeQ%_TR*$7v<0oIPAa4EO36EZW-${+D%KsNsq=`TBvaYJd={@`3(p#-DTK{4Ma
zaki25Y(FdgR|1~LH*ul#kZds%E|TF(d>RC|fz(5(2T$$4f27T*Rv(R~3&Dd9u9~96
zN-08l^3q0D@eBr_OOB5-DkfvIw9!pd$^9}7`@PX~bVAVKXa)jw_Ym1fGwvz(Gwcpp
zlqH&2bG1ECiv0VG1Wi860sHjA)<r^st4*RjWd4xQo5RHRTYcn(Ryp-=<=xES!IU&Z
zOj2T({X~EZ$^LZ`QI7Fm+911Cg@wm`F?SPWh7nEtRWd9bUSR~JH1CZrB6Acwp$ll{
zb@z+$4Xnb@&3K^_?dcO%B3KDU#3PktMJdaLFJB|x9MqeUf`<J+h1Xwo4*b^yKepju
zdB!3;3>|rj6_7>#X3L~@30{NI#lm58Nm@U;71OR<_(R!ztP3PFw6SI$>N~wZZBWDh
zF<I>=q;)?o-Jo?pkA5iw-wUBbw;$Lh@R55vCX7XA549+KG{00}X+pSYwo5#B7!%-v
z-kz4vRZ)F2Fbul4vBXuafxr@dU83Zo8Un<)Mb&+{3-%uI;Z-w^KNM{B^l0WR$LU6-
zxdDV{0%`I-ikI*2HO@Gnqi$Tmjw?p|z@!55SNo<yw{*Mz1{2QqDDia_XjK2!YCCYp
zhjK{Uz}hyT<@uThZJB_VczY-J_Xi=&N1qk3joBO;$MmXYEx;QeXg1^y=Zt+sw_dj9
zmc%gvA%{v(zRfIk{oxxh3TUBJ+`J<;m*q$u!YM9falJ=@eyt7?K|Rh?^O#(DsYL8K
z=wZN(s+ojMuZxqvv#ao2u#$pFpW~g}?e}or<Y_nN;ft~kwIIrWMR5v-yHBEi5x1Ff
zjW>eF&nYwTA<Z>}#5+K*GuogjMT1q0iGkn2vAJTe@UD8641`lYfu2PNE{pZ8@#8(O
zS(>pux$gT=QIWVz;QOx7YnVpgmd9D4R<jc$`Y?2j2k@RNJk}5qfR&B+{fb~_t<7c>
zQ`;_nv6Ubalb<In<My#OaBW4Dl20oL>)l$-oa>MG@_4M3zZ)OeHL0M-XXi7Ns3WE5
zP@ybE!0`$uHdO{&ejgSSOb$s3n67Wy>zLQ@ZGXOei>3E7qK}jkScAL2I0r)2!?_9C
zYgH2oFzR7}>2ny=<m)t<Q$ec%yNzL*;|kU&8bWHW9@OiW0hD4`*x!vLeb)*pJJ0Kz
znuXy)PqqsG!VxWC@5KcdJq`9+X|F6~B!P>(#VWOa@uC645k^fJ%!xufDV%*gHEp=W
z@;Mf45O+guew)V;0da@Wy#m+K2=V1(si~lDK|K2k>l!w)xV`Ei80j?q+khT={>EXD
zOPdxAyrPP<U~-}sKzRA~l#*uRIY4JhMMRhxG4D_(;DkjjeYCWLMU5KwR1B`P8p;^6
zx8pN`^==a;O(S6=&eN@`K3SK-u7=cSh1|C-5OYc#Yxy<sSe>}{EFz7T_#m+~lyjcy
z-?qnTY%LHK881;-cR@dbI#)6Zl?6h^;xju0(UO&ADdP4CL<2L1bfch^Yf;xN9gyj;
z{%@pZ?&0m%^g%ZMv+W5KT9Z|fm>_MFwa2qWG}nS{ZUKlEafysNd8+0lSxJY$U<Ucz
zV<}TqGpRU5skUICEWKKp<%c^N>LTYU{Fs*#W$KJI;&@9X!mM0wE=#h^VtCM-xm=Cq
zr{O8$SS2E47cx}uQ+}Qx!#@Tpo^N#ic*j2sZSGUeO2nCsxBtC30^~-mn<jjBb{}L{
z4ocKHL2NFn9A&CVZmu&^sm^uQuFm$(2qc3gEO(4tB`OI?6AC<(@pSd3hO0}OyEC#V
zU5`KKSWvsrvMbOU%<{x<A!kW8hPRB78ZUx9!xJ7XX-=XA@v#o!Z>)y*B~J62)>Ve&
zaIZ@9>jGS(+z`g3uyw15AK-6R3k?`ubi(@AOWq}B^n_Q~%^by?TExxQE9OT8aEvvf
zC_#(!9%)M6qDF~l=LswA+^`W^O7r@LO;fXywyBd0ndbTf&4s*S8P{AlvUL1rPfR|=
z$VE2X_(zJlzWPc)+l<BzR9uN%vWOb^RO#C6rAPJ5@H9X)(HnAOIb?>DY)_u12!Xzg
z7C<=2a}j69x2y=tTw0uhl$GF2l62)DUPJOl@|Nzm%AuF3>pvi`7KT8ZrWd#!*4T+`
zDC*Qnr1$Usn_89w{8!cY!lJ-joE$t{NQbJ^pW1mf$j2(C?@}g#KX_cTPXQhs$!a^A
zhJdn_6PQoyq@eu@8`P=a*<i<{y`NEPG7B(Pz3RL3>k-R9cw)L*(cSz!bOSmUf@@A|
z1zLU-FI1@IU*PdUkjZI}=y(JUpm{BV>)ek^=Cv5>@;NF+PFjDp0Q&J;)zN~~Qb;du
z#sAd;B!gaiu<W;8hRUu{<jgG5)y-DQwVZkwn+uVgKvGXA$<i?7s45qFhChW?2Xhf}
z^Ox{brV4sUCv~7?YacT_jh8yGcS%{x|20AlmJsusNnxcV8@Wo%wmq<Qwl4A9l*7U`
z_QtCdMvxw<db!lRqO_s2`{a^y_7esM4)Y5*Wf)T8tK|lya|W%OL(f2i;ZjA(yW{4=
zDbxKE8K#wI80g%Eog8%QBW1ZHNa+*g2UtJ*_eQ{W<>)-jUZBdpY&q;lHk&mvqBd<u
zmh)S}JZTp4D%Ab2hyZToIZC<^(EHyo25kze*tA7e^P!7|A&oI+l*JVj(Sk86lsT^!
z3dAasfMuzA2zgsvnvh%#VL8@wt@VWfB#xi1_cvJs#+Bd<hNb5@M&bzah4g(X-VTQp
zv28|_(ama+LJPK$Y4edTr@`qaTTP0q>Pn=j<7!j5Ful#;Ope*xykQ)QitY?9{I&-q
zs$6D!T-+<x=quX+g&W^jVv{O2XAx~N$q)dPiC=;2?-(TDCMI+sGdjs!5t-$qKgchK
z)d~2K73fJ_w#K<{Gz+rSz6^YuFhqy9?|yX#EgZ~XzL&{x7hJtMCde6mMtjye(V_lu
z1qxb#M96l&CEi@OpPf*t+F*9}*u$H9<S<kY4!vL|4uq<WUO(^pffgwXsA4zoi=RGc
z;IPf_ZquV1Okb=J?&sxAOVm}?=OGqkA+TU}KxLlnCs4Jt9X-vaU{cA$ve7AE&;eCu
z*v5~A2)ZvSMW3DRlsemkCM*$qS`bYvi(Zd9VYE4bOY|g)Cgdy*fp3tg%@Mz5*XSZ;
zSs_nia&px&H7&o@FG^+xXa6|3C{Nz}q{g4u5-W71Hp@}BjSOo0rkYr1RBwC@eGDau
z^m(Hc_@{R~YqwgCrqqI}>1o&k@3OHOPDoT~V%s`9D<BL3Ar5gUL6J*I3U=4Ih5tEy
zmt#j;<lk5q4g!x5VIcP)Y#g$>2SjNK0Jp+b5N&}Nw~R|1B>`Bs=?tyRjx|=IU=u8)
zC|W37czkTwGhTWs3SjuJa{a+ir+3HG2wIcz=kwdspb#1H6qdCs`gAlD(Z~Y0*k<Xy
z$#mHbyx9CB*`DbJRTlZ!HA+bXUPVsg?u837+MXZ!;dS&WFBI~5ifpxcH)KqDe~L1q
zOGu?KeIMowk$aEa`->4zEPE%8ad0$+PT6PqVUy4X8Iuj<i%PKRg(c+^+Q(Y@+Tt_D
z7JGp3y)ggj8agMXvihqr%HQAT8|H`4zPf5|CpU-v^~PNO?k1LhPX95ZwiaQ;asx4I
z#$Rh=m}zD?$5Ce{#~ymKGbUFASGGL(K*Yv)hY5nXrLu|o5}Gjio7)8VGWIl3Q_a?Y
z@V*7Hz48IB-7ymJdA|hLO6I{b@w?mO8Tsq$Y>n+d&#qX%KSYWD)d5*X1#eVr4E9~&
z>+>LwE^{ym0rg~7yt-e2enmI`0*Cf?8n{jDHcG1oouA^Vad2(>>tWE4ffB~l0&|81
zdhErvn~?zk3hi0I=_Z`q3{C6oSBv3Tc=*;*EE5R~(CyQ77po2Oa$stS<>?CGk!nbC
zn<B15e`qu`Bv5Uj<F`hL^Wf?YxN<uJxgz_v@GfsIXO;uVenL30G^d$#+4OZ=VJhx^
z$eY00mh{4|)n5bGvPt&8aLr2awg#h*!hHm4K?n6TZ4AKs0OXk(MbG^)Hbl=}mLI2W
zcU<vWfG2?N#FHIBYLlHwnY&A?u+s$&X7O!GSvp0{v*9;Ua+66VjtW8AOpV`Mb+B&{
zz&}f}XquAtd-I0Ho#vQ>m;B!IZHA@N+amTsUg4&#2KLx*JZ()f{^hI;6THf{a=C=j
zt}_hdCCAek#Bs2k2mlyCY_qblf&4mO_f;~07RkX-S)TN0Z|skrJ?1@0KeTo=nRoKp
zUR@P&<{8iowv$-LXtIWJ(wPMYj|k)$X>_CR<~y8I7@AT<UL9S3(^d9S7%c{rV17~%
z-vd!^AO8W5vXqniX=&?eYH@F^qRx7UwER^&&-Pq~m7g~0FD;fLo($cmt+ztt+ENre
zj;K}*(RYJiB)e;)3zfvYT5>W4zdy_KqZ--!3=yu#(0hwwdXbY&n0M~W0?YbFvf?`T
zzv$aXxn1b@svVpjdNAKlc&u<yOx}UrC(-fC;^;cP^lup|BG7+Zg?H-HsV=W!{o~WE
z%Gu~+@)qpLsoAS}t?UwSd}mfrNSPBQ!wqQ9kLz*jn&D&SWqM&WL?jKC<Qety9&G+s
zeT|C8Xi5C~d|I;9WG-Jp4g1`_Y_a>Jp8MT;uY5Iy*uL0E>4GVt2+v}tk<SaQYM)z;
zb!V27mG=R&V*ecOvQ>i5mvl6r$AhpRp<I@yUzHq-&o0#jG#^X;Xv|d#zP~;)iJ5q_
zfIg$1Q&Y|7`|eZ47K#e57R^?bRl?Z<rr2AF4YZ8}92hmX>DGUa2Jy-dN0T-CeiYmM
zhiW;TQIT>yvlxO@v@W4!2bPqc{a_uZZ78v{;25}+SBBqPLaF9}fcrzFWKVr--Ycb|
zP-b^2dLxML&HodTE23u`fyS7z8|7B#<Pv$@s6!vS^$STBjS2Kp3y|w48p8K3j<c~w
z&XDTmlSHq6%Mdp9N#&d>Ct$DU`IY(glT|FNT^~-Hdsxvb+iEOa@&iSIP*-0h2T<%E
zwHCdY+?(@l<<YJtt;J_-%|l7dtp#Ae(P6(zZL5opd~SFPrCG%7&)8&S+#nh;zi>0J
z#0um*sztg`BUJ7+rxPl{w@iLS4-!)Hx)c0<((PxJ31$6(A7~lvHrQq^itMk8JOnBL
z^Tf<@pJaWx0*J{tcYqXPMm_;xCjpZ)h*_8cEplJ^`uXvwB+hLaQ^HCf^eCn&@g3Ry
zgCLt6Ep|MqGK4rtCIK$u;S5S_T2fMMC+`aZ0cSx^@*k3z&6+Tgq!$|EL}EHR64Jp*
zC8wL)U0Eqx<xxqH3Dl%8E`22{ig{7e{4^=Gc?)^el!63q3F+y=(;IM4&cx0vQ42Y0
z&L5<^v3k?fFR1yR3Kr8Hi6TGhHm-jTU73HTkQy3B*Uvz%la$=K=C~_9r_lRfNWzte
z?t*1<JpK7uYN9FG-$1xLOXLmw@7;3GWwst7pSNa)^$9+-C5?x&z4?I%8ejb3;+Tk(
z;eb&VdB}l2v~Qx5i~;*Ox7Gjx$2$g2G_ifk&7E!g83SXeA8G>&GhFub3decec1w$S
zy$O=i!4c~FJF<nsz9ov!>V0-V?#^P{?m%GN{<47@v3wjnXc^XhHMg~pU!IJt93Bx*
z(hF&t(+&X&LqQL!^h1Hn(`0#doFELI7<<o(Ry_7%&0j>~NM;30Aq|0Wya=OHO%dbT
z(OL0BWjyty$k@lO9*m6j=Q_Oy+x$f27WbxaGxxj2aR}WZtwnR24KRXnU~A%bxCh5j
z6>JqUlBcqruV9Gg&W}i5?}i=ZX(X%t(jKn~m>}K%=BaqHaJY0JPP06sDTn;1VsQFO
zHcq<H1zLE9!(KozY`b2@a2fzLbt^&8V`jB@@s2*C;0yn=D%;ftba4V%?Wy$!95Hec
zJD3{!`|4=Psk^eFqjN-n9VN_XG=dgu-X?RdJ@ae;kcVaJHmWWOZ%w?woU2Xg&I2uM
zNlQm7Y={RM+e6~yXr-$W9N0s5?qc{#54nPCNDM+v3PCp|Z4QG`3gwIRMSy%ui@U6M
ze^IGd^&*|i#`fzQfdh2VKSaov+!+>Z_Fe(d+VM8<2Qo^cajfE_7D-iPMD&rB&P+Zh
z!4TJoYnq2p7^W=oE`|!mXvWKzx*n+^p6d)QF`ig1J(6qU?xT@8-r((#$S&MdV&`Ym
zQbP53S_lwPPDoQ^TJVnB9?A|s8|$iYxv!&YdCaVClo1`hXLLB&&iFu}Ik(5-JDLBY
z0tL+jgtW`zHylgee3iu3opcrA03P|4=iwIayQ<8{0zZ~GjC<?rnSO(ryDbMyHl^gE
zqv^{}M^_xyHF_^jIRtTAcw*W6ULLoZ{VY#w;zN#CB^1T1wKN9kwhJ>tmGjUTnFK^W
zlMFf@Q*EBB7-hZBx#6J^^C?xnxMQa9tYp@m*&Aj79}BF*1>6ik+NMq75VdDbXFN@8
z=Lu#!lV@Qj)3R7b&E5hT;zwB9lBGpjb5)HZRc&Id<6XqDIZZ;z`+e-RAWbPACFwzy
zGqPM&g|s}l+tJdk1207FawD%}u^%~mh#taNB8@x`2$6lShHV@H%%ys22;vqjNB6V7
zslmBZGwS${ASH^x3RI;WL1k`(3p8@>c%dHRg-!V1mj(e;&s6q~Mx>LGyu`h-hAm)P
zq%HDQJ%-`ex>=}o%?-gE@y@e&5fii$P9y{o_DSRePgcb1r+5Pd>nmJdUDdIO2`XBi
zibd()oxU`hmN(&iQgF~(iOZ^B-CL!3X>nwPMYW{tJ%8uOQyiI7^_Fb~=Ubp<WBZgj
zzu&JYv6-4DY3|^_y$Tp3%yK4qfJK9vccYKx%u00Y8^a^(-6c8tEEds5BG)(`3-^A6
z0-tF_KW(gj@}u@|P3NNhL?_teY3ao~D162Dz6-I~8_?fjyp65;utT5@PA1$#Q|g2q
zPz}XJul{jSD&@n8F)nJm3{kabzDl1;nt@p7_qknuu1DkKpVRr+5`5}%5;PQ7Kmec`
z0kWkD-9-_t;F@+eOtqqxMCs38!!v1&do1u=J$uum#-N-4eFK_|t!2GL+9!s?cJBHt
zr$tNpMSs;KLTfK716W>3SmEW}3T2Sp<nAPNrFl2pzv$jtdm$vcln6NT_8<pDr^((5
zPyE9I0LcPKUfF@rRQB*aGiZl2FTWu@DLx5_!uPw%G;T2<Matnfdx+b*`<J6nT*Q+x
zDcN;)qJV~b?}X1@RL!d>iK6=z@-~`9PDqT5yn(*u(rEq2)hbf<Qko3R)9a3?_kY9e
zQj$sVO0}C*^g&a<572whRB}qzh{en3<|2E}P)b-}Es;_NsXMY1b?veWV5rH*c>w#=
zv&^DIqr~4$zhosqZ?F$g%-|~cm3=dvn3I@4puD+<=Nz4H9IU~e0uuLbjQZT!BfGU}
zR)tL_d-=rg_Bsfdbgn@&p~sB+Hvfn=02CyVJEv>W2!zLjljzu^?NNWb@nNf@U-uIA
z7}lZ|Sm<$I2@AjSY|yBFK`#XJm3Cv(sQa!khA!V5y)Dt%pv2Baa|js3gl@MG76P7K
z4ICWP2Q{wmqtCR1K*j!E(3=O>g7qugfqzn<HpsO{>@#XftJ-buR3R}Cq&X~`<pc1H
ze;i8MG%dRMIk%M#QJZ5xr(@WkrEec@QKXdGu569{{TmS5s?q0|c^`%`JbfqHSgLtk
zIClT>GDWNCl)KsI-MN({-Kn9*7k8^3xs2XgIKDUrUckX@Q|EJd4`!?Y;w4y*93RTT
z70JX`n>QM@6oXp@-W2TMc7E}-oVHQ685*wY_wVJcyjZ&w$-{kWKxM$5!NAMkpE&2?
zwFgZ6@@xB;j2i&nhL`Vf3+o6YTVf*XxXA;(6Ym-HB2Y^iC?~r>5KY`^r3jaTj9E`$
z!<}Ag$(hC21X<}>r6e)7Ksb9!4P*YGhTTz^)*@~u1qXxUjaFreK@}YKAvp*JwIyJa
z333d90-+N>qA_*&J+m56Q+~AwwbB1w{}NkIrr%pI61W8u8*vKI1yPYrz<7WRyOF~i
zCEE#Bi7Qny4K}I*dm$jNKN1<Oxsl}fgG>^#ILL&94g0Y5_z<7qG(*qaU3D5}L*8%Y
zS^+&=o4H(<n)EzXGih96ej&x)#>5*6^9_}^T&Z513VhQX1Fr>czbvW&SROzqb-kTh
zLmrU+2R@w}B!?GEgR&TD^Ylp$VvK=po}?3BNvgvj+DKb4)~8TJkRnvIal<}uhI7Ds
z?j&o^ova7``9{zQ|FUHKGWbh&+&gYz%_+kpiD|VPJ02E<PVAJ{#O>=62n$?Xruw$1
zM=m!q_6VQ@qBMhq@faClCz~fuwwv9TPMD2i*~$Ul$tZy@^z%LEk1&Uzl7#HS$u${W
ze|$pu%ok<>v1smqRpC31+wUiuT0S#YCj>0Aa*{*=aa0?(RCoGxykyQc=#TRW{(aEE
zrJs!qaXh~#vUVe*VBhs|;+r+t^<n<5xY^-vcfSdqpXH1pu9IMV(Gfo`v22tyDdbi&
z;|LWxK;#EAvd~?(J!}*WVLTGSAif`8y0?cc8EPl@_ZY&onzQyZrb*KV1)96$LtN}*
z#n&m&v(|s2+^i0u=T6DI<%!QugATT5_Pod1OTD>auzQ|<<7p0NhNp!+QaH`puCBJ1
z-T+`o=yTcPL|wuXw=r{sd|2<|>2BGvVhxO=Q}BFy_Gm`v9u4wf&xM8<<8?73<T8?g
zMU)jBSXc*K5S6>?KuT8!hPD)&p!1_l^76awW$jdpV1?TZ;2!I(A@8A|LMm9;g5j?M
z&r3)7+;SfHnxQ|bPIa@tt$pq#X3r&dXb($l3;fHAHhI+0)^r3L+$6tURN%(jWSK&f
z8*f9b;E0{k6BPgplw<;`aaIsti{aS0`CiZ*XLogm+=}xRT`$dPw~l)hJ9vrM$L*s>
z2c{}$H-1f(^7G`}*<EIFT~E`4bj22n8yvhGT*egcf&SFNfSVNjk%3po65HuU${pL8
z5=ZJ^V?L3BgMn51Yka&PE^I_{`&h<aT)Ems#1v(hjyVPc$8~$#5|NR}SfVKk)+4^}
zGBhnpx(Ek}(B%%NB3fRUx}P9IH>j%}zaKnBoNj4Kuh_!#2C~8*W$@+C0mJd9(;7_B
za(G;71YV90KI02lYIASEHcB-47u21&P<ET^D=aXfKJ@Y3l)BBRQI`?H6w%8rk#|L4
z2|leMkjf^H69|-r7cmbbM>}%&b)M)~{O7irV6Cd*N2INs6OGmT!IP&s!;UAsLC|QK
zRhuh&+^k-s=Pfy>?DxLWr>hHAHQd*{*FLcZE{9LSC>I4&b0X}$csQz5IXe)NY?(RM
z=eJs`^+pAG`r^GG$-+A0^jn`Q48D*FaMb;5u|e07D^ZsvLYXt_Hq5ilM@MU-(3w%B
zSw>K@W?Zds8%+ypCJYqf8RLPKy0Tc~CR*s70fyom#fYUYT&XCmaMX%NoyztFAK&-C
z_rjSCy6Cb)Vf2O>r1Js%q^06MsUHL*xUIhE!^0dJ=$a-jWKfXK^psa57s_thj{9$5
zkxcV64~O@eoAh+G8Z`z(>(dR~crnw0k4t+e7Xw|*4C5z?yrewe`+$71W4cp%wWYS_
z98Vd7`gNteD4D#sL1t%=9n>xnA=m##`2n@OBHV`isbsXnBD+toBYSR_m&dDCyk#?t
zhoAQZKTMDZ>+nf{<=_n`F5DVtXD$1(L#r2FDg&=GrBbMe3&b8=4v2^co$C;|e`G0J
z$Episb&7o=$eXZfgC2O$7Vj;y2`nxbAko{v3fFDCDkI4AUIUU>BSLe2BRnnyKItrs
zxkkFcu##}!669}2p>Ze(nd20QCGxu`C68)&!~ppYTK$Ja!tvhHJ;f3hqo>*92X}Js
z!RPL*oQ@Z^B*%GcIvSe)iPGm14$Bv0+c0v=d#7f+r{5&ulQf!pv9A(s7OowdFwVqV
zx#i3J_@Y${fC)@qah9{YaUsFu5+sT>hW(&jA6(%U;g44UEwmZhH@9H&qB~3iZnuNb
z@s$hz5Rv^K0Ea+$zfC=m8?-~9ll@baAQ%ws-0FyD_Aqtr{sm6ppmRZ&4`MzN8W$!a
zR)K}lXAP`8fU(PYVh6sGL|WBX?id}I1Q?LY9E}Dyv3*QuG#LB%UqJ*bEN&O&)`f@z
z_Je@fNDo~oGc#p}SjnK{#l6Kayq}0zCg8dsy?=lSxCwL3K_2`*wn;(J<9Kk0>OhpH
zM6U3vG)C7Xse_<c5YH#3ecvA+lXUsuC8EF0{iMGjyhThi_W5mqyeOHnSk%Fh))3{E
zATjLuY{_EboqQ{*>a*M`MgT}Oh#pS>Xm98_2t84AT#aF|>`fLMSQyz@Y?e3-TjYZz
z%Ol~w?bFpUOw<d8+#!FeN#9KgJxXua4?Ln;gphE17hV->Wz^12z3Z4?butVy2t4~7
zeVQ7e!GcV_p4majWF%RyuT{Cf%uk3Pfb!mnHlbV|JLnUtQsK%{&vof-Y~{=Cyb99<
zmm#Y1q}z}%>pOKFq6o}*w;IXk8dLK9k^)M7#FTqN3j2wzlau4*F=O;-1=h^8NQdXP
zNX7k`sPGQ+Nhro16B|SyI_uK*?Q?rz2REA+HfZY36jN#{Jds&-f|}lL>&@wLQ|*iw
zzr@pE@2nq6C2_{j(h}uoI8&R3o{TfLX^N&EX3au;`>46y+HEy=;`w0{@(52BSLEjs
zol*`-zYkqBDV}uUbT8-5;=N&SVD^2(gdx+-7)IZ66Bv<@5nAqAaqd<xiaTwPCTAh^
z?wxmtf8Rm<A0SKLzfWtpNWFtRRT$=ysQFY)l&bl~XOXNK&Ctd}93pJaq(-D6QH`0{
zgw)d56h5mqJEIZV^^QiHr9}YQJ~~2gUi?O<L|J^~@N8D?utkX}1We3U9FSBRbv{|t
zP1C~Cuq}!c`6OD}jVR=DP#b+`EVo0Q>+4AR_p+t{SyQem*Vo_Ex)P=4uUT2NQJyB1
z?qhY4(?OdIc{5>~PlTDL!FJ{>xYs!ln*skhQmY{2S+rrxvoo!>f6oi>JK^(Zo<*0J
zz5Awx<9XPqJZw~E-l(Xd^RPL2*qq$AY`mbsWw;JK39@rT3eJM&?h-SB@<Dh$2+x^?
zXWA%wkfRTB^iFa#7yz`}wFXRG0nB{=G!aME^^+?2y|}4Yw^6}`XPFe}EN;CLyQxx5
zC>O~x$sAPiVO_DZ%+w`T&viHAXdn&!?%tczdqqd`1}n_^PH(Ujff+Ygk$irGl_nO_
z_hq-mzxB+1*la#*HXrn*ht1}LlJv0IeAsOM&Bol{Sa?2cHXr2Zy~|PlB!XUY%)i^5
zj3m?AQI-75_M4GMBLn*!AB{vOIDa03CXeDF2|2xwZ#%=LlpB>wp7r;PhL8$xiX~*2
z_nmGeLkhEOAtM0)U0cZ%qff<+xvf48@!GxhuV&H!^x>}bVf*@^fjw+rAJndg?d!w#
z_3t<4{>H-dVf*?ZNAF#Z_FQjh2IampHh5gdWd`!Da)-U_j2N>vwj7NSqWN3wZ@D`J
zdf>doTOe8=+v}z<sj<vf?{nLmU|@3hn*{kzH^B))Gxox%aR2RF;sjIX-x=>79`A3R
zkT1NW<JQ5+?!yN8VT1hL&4ItMj`y%Zeo*WlHpmYf<OkvTut9#1qu+xZ6+5;2-5lS;
z#`r&XQ~ZrL#1l5de~XRqG@Iau4RGp=x%1{XXX9HaJYw58<<)$zRxvCR4<^s9OrQ1b
zOUtQguEo9}fI$FHd@CUG;IB4%5#Z7sY%Ye78@hHBCiAA@QlVN#?uiX@AG|5~s;3n{
zQM)xH>?;dAc2-<JD>C~3Ct_?$S<&W{Mq3U_u&Ox@+&;7-z2O|l5I`A?=Rnl_D13wk
z(X13UL;=WivuIE}r@@C&M(#>6Z1k=Ta?xac*TqK_6h1~q!~z-l&Z2l<XxziLRivzP
z&-4S!t1Lr#-(~2d&F^^jC_vedTtZ~<*K}NDCE$5I4uq3OblZ6Dxu1bEutj_Xb>d=S
z1~yR0E-jD3G_6BM`^Nu;)vcgY7i2B7`q=mC{<-bQBm^5fhi#st!9qssxb>dJp|>zC
zmNc~cCZgC5E4sR{I~S52K09~a;2fjU_|R6?8@Qv<4eQ!|#}_EqH~|{sbH6LmbY07L
zN)(FhGfe{*nZc@khRPOV*cA;hd;XQLW05F^wtrzd-GPN6*c|KH2KGDTTNf#4|8gt{
z7<bO&MPX&KFnk-i<VEJ|2>PBo9<d@6KtJJ+*kQZATJnXzW){PAfjvq~`@jmU0dk-R
zBLngH*3fhUy8|d{aRNk~HPmVy%N_eru;W=6X^5TQu%Y?cVm;3th6QW>MGX)gTmQB?
zL3~U?Q!Y#j-iER0Wabc77YsqidZ20hwK=`En(TFZr>YG{fqsJD)~sT2)hG1m**a*S
zfLxYd)%3V-Ai4}ueonuxe?bs77{Z;7JBERPct@6tU2z4>AB{0Mph=+)nLjZ73mA(~
zA=byNfrai^p}Tl!M2@nK`H#wFKwPVX6tC6s-};Bn_QyK<xkm+sW;*@|1%mpevZBf1
z)RIX4XZ^$3S^cByuhL(^bo!1UBKxq-vqhJwY$8KWxg}O%($PBS$6<T7LEdNE+lTCM
z=Y&12t-u7jq$vnYcds0ZH|P_`<bV-{cU%+~+~=(nCVY+nTIPeqv@n375>I|G?qNVX
z=7F3NIACfCcjb{dc`AgWoH>5S#jg^X@IR}Sm?^T}!W4n^kc70rdJExUi3EccP}2GM
zF?WaG_pA}?`lF%WpMaLVtaq);x-*8-t1lln!fI&1g4C95hfyDJ>E=Y2qYmU!2u#<3
zWgnfG)_D1K{9_HKrFV3NK7{W?uMmG#e`Iy+p50+#2hzfe4;r!4-yVtDs@1L>Mp2@9
z+ymH&z^=gSg?c@%;_63m6?&wp0m-}w2~>o887Zb^V!4+QG(2<o8AVMJquratm1-x4
z#NwyXRrga}$6Hjamy*kmA^_o)NJm^b#gMufj_F`k`@^nO(IYiUznRMeU_nuq<$)ld
z@}C%Wg8xgtn(-rILuy}CT!qYtk+Thig7gb572uSGE1?7vB|?O%xRhFng66s!<|gVH
zuvi4RZ*)D_XG`71AGlWx77;b>VeWEiNoyf91qRTx#}-L2Q7P$N=nx$A)v*Wi6Pg0r
zh3nlcD+lAGSX|je4T(_VHEFPHWOhEAeGu0?CN9##YeYt1IfV~YU{T()hVG>WY9LDZ
z9+lyAp^^-_1CTPXAmB1kOE5@Aa`Z0>(!0^@yKSjw#CO<QI^R`4B6sU@p_dFH)p`y1
zt?QrXp4s7x_~MsK)2l+0Zc$xpVSrfM`Rr@KcRK^uw|EIWe(?nlJR8>q=8w<)zz)V-
zt|qi2jNA6+cx#{3jab@dY4M9lx-At_%C@(UTSq66qC9D0$(^l}tw=dc&`YuEkUd{p
zD}{S>8QhwJ9`nd7p||$@pu}II#cn;*L0|9l#3)Wj^__(*KHfUmYrVdQsKp#nYT#m?
zwW(kp!WU<UFIK$D7>EQv<)Hbd0gVNriwW8bxx-?1nJEWNOk{@1-#ET8{1cD<5N&XD
z%m=ay1%;C&&in%AyObw73+_Rx=;%^qON8Yy_y;+YEoY*9``(00bRuPtomlQuM#_8v
zKf)1|66{0I{I;SeVyqCYdXrsi{VKb0JrZ(;AL4X8*Z0MpH_YU9r5E94wuMK`g&WIX
zuS_pH-fbNpv<}{^3)Pz{V2BdWLIcLvE5J-b3**b-ktZHeCfP}~+zsLC28CMDnuK?7
zYL}(4C&EHL7Uk`OE<U2NojM{{fDgL!2=77nI}+Tu@!Q*(_tF<f+1?HgB*x;Wb#(p~
zsRg*aw=-EZ3$8INg%UG7&HHbY){1R;#l8c{&5}A2C!Mo1+87#V#X@)*0_Y(<S}-c$
z0nr`AI+78SK0N6gYmd321MmOvEN318BFlbfVr1*|<Pfjb?;=bjj_E{-goYU+zdneU
z*~E*+!oR1G2|GS2YQl!42^^K1hAJw2R0VesK_QVbL8NDVV{w#eN-{K^K3%QkSd&PY
zsSHXa@CK9LAZY|6ERw72C89vZOcM|y_TQEW8Ov3}Jep&mQ;{Akvk_YD933}zTkmBf
zVsORy4i>d`j4Mxp^M)YrTp7$OOco)*)v!ubrLZP){%skYPqD~-F~Ee`RE||rt1SW^
zvqszwDNe<<AVV1Xe2LY1%k6!NX7!IED{fW)Rs2+#Cg^eu4fJEYIa(a%8PIJf@omQu
z=Fbr88V%L+#u|s1YKU>rq`ehSSC&T8^jY)$(c$q4t1m6p(`?76QKRws!0s6S&CuU0
znghEJ+a&JOgsxQKPnZ5&vz}*J6p*<S4CLSQo1uL!f1pMZxH17siaCJw%I`zV_szZ~
zf1;~cpWDf$MXDZ(svYrn<ofnC;2092%oEA5NKk#g`0Y!Qule6%!Hk3%$1s;n4=yec
zs^H=jB~+y*V_!z|lM%#o`sDDJ=J9cBr)lhCO6$!*(ymY3AF@c-EPl~`-m;K55eq1%
zd6&e6XyZg$M$=@8xf=Eh7ZY<eOOi!H^U5<v94umD85buBDVEO-1LNsJW(rfHSsA>E
zm7j}628NvlF_Xoq1s1j)MTq=y%VH$*v!JOOjMF!@xs;LLSYGxnP2D|irua6R+)z&3
z49y&7_v>()ejVOJzwXc7ufy5<HC=ecGbc3qZlX*!J6obnZg@nVP1$rI_fuOg^YR<6
zFx;ix$IZF>TTwYftJB1JG%LT&cM|TR$(b^KVv8?lYH)PHkGDCNo7wC*mN{E~bl7ga
zpLdkUX_X2XoofIv9$v#zM&}w!)urkXc05;jwt+u7H~lNy5f+PCb)bWHTo=yG&gY`E
zCsKBf%C;y=i3KI>(hMwvOdUsP29l%CCV;0>Z4;#;`={0~TPIE9U~9kGJ_5CSGqbK+
z+TJAhJ_!T_r`{M&y}O9vVT;*$YJ-p<a<iCIteCTzP}W4_-h>To6mqH_h!)uh4Q@_%
zwcTqJO0hZyEOwU>*iFr>hoJIWs&5Z+&lVKel*bDSUK?NhL64#R3J)9<d~#H!6_aBM
z3fO(UxZdZ<g2h=zVX`>zBUxj(LoL8ymm|K=>Gj=lFdD<&%62x3`{rj0t?g?z2%cEp
z;+IImEt5wVwNYm(_^#WjUj)NJ?b;tqU0`TBBec<*sgR=VdN^Gn@nTRFR9}FFc$HYY
zxFed8=LYwHCb$_{;;G|Yh+y|@d9X*;3A4;0KIxneBhI%vnLYS36p(b#kFYU_hGWsu
zz~68n785y<8sKka98LqS55sBU^-(x&8GR5=Q)coQyc-rd1n-6=9D#G;$s2&vAk@d-
z)bM%3FFN*u@hD^LQBDLuq(sKvdX7BID6J30^*r&IQ(hmM>yspA4jz5Du1^x88F(fS
z;q}=i?aXz_fu2)WmN=fdu5dc!)Rrx^r>$@5X_J9apEm1xGCZ$*-ZWaDUd~^1J-$|C
zGc3w1Re<Oczouf6Ot~vUsk6iO>D(RoQufS^N9q3aW8!C__l9Wf+#MA;(C-XP-?wIF
zk?JzfqNfw{7N;w~xr<LIH(`wHqfB9;b!pN_FGj(`TJsm<#V^r4)$PofGDo<1_4%Gq
z8UMC|JE2pj{zO=SHUxLV6b|(Hxs{wWbK{E4nt4ZpSkQ>qbK?+GZ|?G9?%lEcTy2;r
z`t$KkH?g%@P0Qq@S)HR1q^w8b$}4}))6Qg_v#pA0R7}U6Ng6;zI%c}%=vwFFEc+4R
z@Pa_5cF94|X%0CkBikJZWv4jf5b3F|IKnb<bBbi0jp>XjcABqG-=sQp`L@_6P`{$#
z*8tyaZzo;Y+^?g+!>99k20VOvcUORiPYVye{~mn*&FcG)hK>GtaQ64$?C*P(h40^|
zHB6+=AP-fExg=sf6%(ame(_l(V@5Ny{*6O~&6(7QG$g7q6Pu7)T9|mjEZOXgM)U-3
zG}<gJ0?78!5nF_R2((05d}Q!!bjh(OF@=DM*@pv;N~1?ZS=3GQEtrOFac?IBEsXrv
zZG~J8TJ#JrEvq}%*OBz^WlaFGrd$=Sum8$*AzJ%ivodI-I!)@_$Lb)5zc%>uM*cP*
z_%jdt?aWbsuVX$o;{S7`)IBeSy|LrDgF$uRx+8zSRWX9%?wf@Ox`%zk!@gnWeM5W%
zJ!~N!wh%blLKk&F9`CWCf7$uwCoijW?lxBM;pAoYL4rO=(AiI3Rv*OXgV_8QCokVX
z7S43?k|PfvPF@~PULH<f@=sp=+;!pM<mKVy<@=FR1>xT7o>#;<7sPwm8$4_c9<~Ov
zZw(%H1`j)fZ?QADcR4uIzTjb7@ck{g58Hyj%eLTQSMaba`0w2naJR|Xwz=ejDc?4i
zK&H0MCFnHUT*}C{&86%V+gy>JYMUG8W!UCwbxvtL+dkPkX-^$&Q801jxmj=61tADA
zH470qjf0q;%|Oge;U7;<WuGdM!M(6Poq6bB0v(rHAishOx2t)gOJ*I^w~F}#5G$z;
z?DMg6h4Bq1a?wz*Gx0Mlmc`i+BA>@0Tn4vwfK0x}u;fPb#8GT_j7dx)cLs6TseC5H
z3nksp#UWByw0C;&u63}pS*#8OOx*3^54hqKvk>YYNV)e?jIPZV|A!UZ1k6GPp!aWb
zB)ZPB(1ng<o^dg#QJ7Ii3p<+9nD``#4|cUKm=gw;KAD7r*9*(+TI4ZS!GhH3y3|)u
zFF7347`jg1vj)1q9IdEwl_Q{4mVsG3Y7xEZ@C^}rF2#LLTG@o}oXJitD4;DY!knYV
zTh>rsD<)10WH~u}jc$QN?{Idi9@0n9eEyCBk)gU3dn3f1>i{{kT$V><Xr&>T8Yw$x
zAW1nk5G}dHMV)7pG@k-}Rl}HZeW-XZT0Nv6O8?2GbHm<%!Y1D#F?zg)kEAi8DGw-X
zIuu*fBj3gt#)?98%NSPV1k&zbpex7#!=YYSa!WvHV2L%c3M_m+wg&+Q33IxfQ8p+s
zrq>^1m`bhcD|bBTGC!~f17?m!gBux492>$6&|L>(AO9<$6J@BWxLqtfg2vjt0udMO
z*>Ytgwv!PACc*9;Lp*<==;6dCKz_@};(VN?kH7f>q2)IwHSR_}cqFE)l5N=~5)w{3
zijjgRb|8bTo#hCIPf1ZO{g@>Jl6sUfmF(1letf6R5KFU8M{1L9lWS+1zNszd2#}-b
z9~~d=hRae?<Da~BlA3G3)0s|f1;CkgRw$FFutN4^Z54oWR8`8&)l((JoirdtDRdzh
zFaj?1ePN1bG_P8er4!Aq5ZzrHnpzc-J(r;er3|ptc`~0iWSsJbzK&`()RDRBP<FvQ
zeF(CRM9FWc5aG0a(1vExhLRndsS%}v-lJBOI$YA#qIA%|t6r4anjFO_6Fyrr$|#bj
z8qs|E9u$hnf^@RVktIh{^$nDV(<&P%6Vf$}$z<p2A=4=#GixAu>c?c=BS-O=pmp3`
z<(N(1xaWsUP{JMBLAB?ZL+Buv)`2-+Fs0(Uho?-bcpuDe9?WiLf76sTlpbtx9&B+6
zsrN#-T)`;uY{$1delh<}j#kgqr88^g5KHD13rEhimIE6uR_@vukp_h{qNh-)m14>r
z+ALa~lKb4H^VqYxs(wtCBxbG`x#c2j!|a-7l2b9&G7TWEOXl7n#tx(QzX!E(@(7&l
zQt8Xk9AQLVb71)$D@B9MsbPQXs11T+Yp>bfP6?F~8_nX3!T?zg(tf6jj+-Z2t(5Qu
zSi=SGQMx|AQqK?0;GcV+qX8KxB_jv}hfeGts6Nc23PoROiOFfKGLvoApb)_5S|blO
z(}9(8?Ka1%u%qMvFo=;0G&8VWNA1|LQfB*1uQxh#=0u^^ov?dWijiGIBqNPukT;tT
zv37<HMCK->hldKe8xVw;dh>z6X&Vnr&)#%kZpwy(C#P;UR91!wL|EUHoZD^f?agXF
zGUf*)x!mJ0Q}d65r*UwsHuLE`<oPLFlo_df)JpNj&cC1HsLHDqoC#bN#VV%QJ!O<k
z9y)TRaeRjp#{1CLABiJp_OpNE*YSi7@?OT0M<(dh$>hLBr=IcDvF#=k`C5(X@$JEa
zU|5;XBbO>G%WS1G!#*MNluqZbek2!3|CZ-(a~-ki)FqUjcqR>|$l|X<+)g#WQXM|(
z^K(j>b9!>Tm8CRfOPy;GrZHFS2%xFuj(|@SJlA1twRFx1fE3ZAa#CfFUM@q7N9vxE
ztM9YoxaG5z#6{JGb^g+J#}iB|3D{7;Q?of%E{)wWkZiWc08`kXfJp6zG^mX3NTqGc
zZrR@2e%mw-U+=YkX&s)<Y^phMCwQU-fT_CyVAEI+$=U3N%oG+=YARbLd<H93T~o4e
z?=Z_Z>|NIEFfRSr$8^IGcT&dK@hs?Vq;=-?d=9KxYdzj*q!j+^7JpiDd#=l9@vX2g
zfH$>$cx`r@T)Mv$78am5<}Tdc+mfBZrsNu)1^AsV>KWu_tnxX~S<8M#k=r!OhMd{i
zIyh+_A8hRzrw7MP5OiCw_nPU$BI6`%R@~+}MU_qw2j4;%^m_i_9;HAM-89o5OMMqg
zf6z^+>v$mAkM9B~F;#y@A%KPg-X#pPC|}Ae*DEhjI4n?j?OwU~kM5aMTn5;0Co-_&
zd|5#de*+<bbWR~1B-k`!0b%Es2fMrNy}ei$50V$j)1r!Dnj29RPpVA1M?rEg;$wQD
zfhU)EJogt%48~GqMl?}Ljb!p<x$&n;iwIAXq9U68oyv&_kr_fF0mCIk^r9mLG*v*%
zA|f&b!wjM!T_8*^5>f<#W`-Pp+Ouss_?QQ!NS9tEx#NHj$)^>DwuI4Dt&;MvC-3Rh
zpl|#>Hl1KR%zHEyLQVBtDg@tPdvA>YJKZ`s*^;k{!p!jYDTH~-))FW5@nY<U*ag>Q
zt5R9R={}32Qx>KZ*o5H)C-4YCrezSq5_gWa-ZVAdV7ks2p53(qs}m$RBl7v25HN}>
zv#%=(UFM=8AhK2j$%DDpf{>vY644h{7EmiTFM2N)sco~d`mGdDP21!qpzm4-PggY%
zv;cIkI0(@YW{n*iRwJH67NRMuRGK{stve)8H|Y0n3$`Iky^TVQ2+V8$+CFLSgLv6J
zWWLSe-&jHW#t*Dv%jvo0$G%<J5Oywz69=YU>s}oJ<J$Hg)`p-v3UT8jTgpazo4UK*
z`d72EA=^Pj_E=ehZ?b9w_vZ^@@oVt<ZlgHUg{eSNfv#$7@b>p`$#qATQ!c7L1DOYF
zZSkro+Je>hu;zo)y}iu3dt$BbLD7G7ak1u=ahP6b;QCg%SJ{}`4#*ojIZL@5o}c8X
zluh{*UDGAp*x|ye8(Y+uYGQ5oteQfz#QH<mL2T^&oc^RN>bTnH8qb_tp!TIL{dZaZ
zr4UPB__bV;9?>)Ys2sUXiuzDs#zEtl1f;~FxU1_8Q!N~bg-KBxe~*w@uRDCbMq%s?
z5d%p5u|;P8O1$bT^n_LCV%)c;Sa~Gaw5yMV-w4N`OxjFA8ybqFfG1X^FA1QeO^W=;
zVpWS3>#z~&)Q1+Zt>;EyFGl`nK93?WZ1rWmYhBiz@nFEdN-I|S^gU~YNK3!H6*OST
z!SxRx)+ut~`p1uFPd=<vf5Jau+UM7cr5Gaf>N6{SAxXj(S8q$73Od=?S|l!Iq~a&Z
zt;UMTy1GCMLfMZ3N3|cY2B7G=iUMkSaj{&+FRad1E0v<kOzXUIIg!equtr#n-pP;z
zw7GtmXwg*tm#llWq4dq^CSujpSY1r7w>lsOg-8?$@tKDm&8WH9)vUbwTN=g+8;*gn
zbBn=f8dxTLkCl;CRT2|*Dsl1l^i7kCjFj4y_?V<=8c0vp<(RH3a==-%PF_Oko(8V&
z?U)A2Vd8qI0+o_XUW{b4<<jzeG~dZ-g#ej~egVsuZ?ULEumFayeCC&a6O;R_7XMO}
zfBX2wtoGnL%=*=rj~lEJ%9F^XfZ<iOerGGu*)2%WDS%}SiGp?3bKT(fm*#Q1b$GyM
zp3<`>6EDhTkrgEjhTTeBu*T;`tSXQJFt~7?;*Y0(9-9Aly_dD0L9Ei>^KrjtU%#yW
z?0DAY%WD7UzTJI^+fCV`*e+9v6E0Br!B$+x7q34FHy39>kneSfM`uO$_%Z8rV~HCu
zVo(vjtd302w_r%weif}@yH@qe^*&bv&$9Fd;1icofj72N)|u!BSL2Zx&>JpLzDqPD
zYTCc0lr)iXmX5U)hfG5>BeqPk=Atc&z&Q%>l96?)EV@?fMA@-=67SZo<##;$9D8-(
z!nU$nHP6qXuQ%6L;5&^;R6|4;-4-jU)2bE>M@4-IBt~5Nyv5J(G819e{N*1Y)BLP{
zi!mQxRAKWl<i1=|tB6^~{y^GKveu;Ori7I2OhV3KxVdlpbnq*XK??@fGQE`?(-k_t
z$n0B=<(YxSY!J^KU_pQ-&fWgl4@E*$-@iw+%D|IjUa7(Vsw>t0%9NjMsjOsjXT%b0
zWr-q6zfnPcg+%4bX-XZR5}*dj+RabY7Ss`<*|)F?1Rg8a`c)W;3>Srn3fe#wG>H@C
z_S`sEQ*rV&U~Z&OQ<36&GB?V#RFtqZ&5iLHVw4}<H2d5Z>gveqxV_$Vw^8(V{pjTF
zadRu(VM6@L{wTPBK|jZveN{02XkTQ^@oHZyIq$Q5(e$);`*DRtH2|-ghFnx6H^%Zw
z|4ec%^3-0oiiC@JXD`wwJkrl8nfFRx7K;}DhR^gxMGsH)XM3t2>)y<F`YCYt_((r}
zw4}e%&w%~AKGRQcPR=|1>;l;j^|Q+4ztk7dh40|ml>nSi_yGqz)4Rcb#b;3TMlXlk
z2@yE4e3l^eEz|2<+?NdGFQhoixD<Slc7K_)6WR<6652zT<hi9f(*1)^UjQg-`x8h3
zX&_#Yde-k_+q1e6U0gs^2ck43%H>X^F%l)IBSSp>B0^>m$EjnMgdY%dUm})MHS;v#
zn@*sC6r$NNL>H6vma26mdlg7!_g&V3R7x_IfJ|5tK4Q$|!D?rZ9GWzI$JO{8%id(M
zQOdr4l`@;dNTn-F&4rOF^|L%Zmmk7kdFIIQZ-zcy!N?!CahY8Z?-@lhnZ@I1;}01J
zP(~yrwj13+uj9<V*$~CzTMbH{W22$U&AZLm+1uSd&^H;emc*ap5>KLUad}e4V_X3r
zBkyiYG2!H!i0)v*vKxWT+iP?OoYrr+yXX!cHWsrjwY>K-SJ*K79=8#4Af#^`RPNt(
zs~{VYvpLW~vbO^vR6_O$u};AdXpTnTj&rdpUXN>!kWz9}{1ApvX;1AZoha?>wSV2u
zaEo;Z>tVU9m;nf#&uC6KtLg9r3|UrU(PH1jQv-Dxm1dF^Yo+!WIPL2_z7LL8oHPcG
z<$tHvz)>nQtb&q2+4jIu*x3z&BS)26C%cEo|NM57%eMl@99o7my2}L1!7^!*g+>21
z6HRMvm^A2>E6c1X^RV9HH<)W--P!X^gZa+qTuAAJc^3toJoiHQJI=p$^W<P_ziAvC
z<#?FZ59fA_<7V^V<aq1gBu1f(bu^O?K2e5TcFFP?KKIf<(_JOq+i6{A;DRpIw*qu$
zG5cX%r1*rhx(MvUQQcp+e~5HM_C6vBHvK`J7yL&Y)kRqFr<~MHoFtPD>LwsaJ*SH{
z^DjK6%aKO$Q@R9b_90ya^qZd1#of^f*O;DpV~o7M<y;zg=r%$}w8<qcLRe-)(PW@H
z@B)1nwPC&6nbrd>zwI77u)yYwf_rwy+r5Fs+|Kh_Ke_PT9qtN5@m2l7!|sEJ-H9G{
z!?B}(9$f1F_qx=*$2;=}E&M?Xf6&4owD1Ql{NA+itc5IHSH3O&z1Je?gW(QJyWTzJ
z?Y+b8e;WIT2Ztwz2d!;%i+$W~E;CqMW<O(|7j@RbGsib{9gxM2jj_Y={m%Dr_$+<G
zCfvRFfj9014D<bw)nS1Ts_MdYjCmaR_jnAQ&b;JNbOzjadK{fjZN`ywHgJ{`sq_-F
zx{{(}>GWP^jeGV0mpin+#XP>l1pXdouI5YQo6Kf8jX^(TKZxhaW#j0u-FmMN1}s#;
zl`TDs{mfPhj~Lf=vtWb`SlxCm&4JyOO6NBcAQL6W-$Z0gCo5(U689k;?p-VlVI~>o
zx$h3ffo0G@om~!0Mv^u0lO?~0xsO!UiL}fapVs92Ta%O6ld~!X<~yBONlG*3RyttT
z^h!d{HN*C|w%;0CuiJ-vrzcJ0q_v;1_GY@TM%P8=q(~bAXlggs0zS=^waChLXDt9y
zTw1G~RJYc8ZiZ{?NZpOtqxTta9q#o$;T^4j^Ia$KvUk5t;CLP`6CN%TX1+{NL+9Zx
z;o&afPO?!*=y_uGWEIU)-sGD09cXMAR7a2#-Li$-xa6iyG`Ib0+qm-Vz*=Uj%dB`|
z4F+y;nLWEleNL{d2_;Tue5ab5TJBTTH7!?~@BQ~2uqKQ;BC630wuz_hrU656dn+wS
znL5bLe{SSkov~-(QG?}N#zFu_va(_UM$2ae1=N9((E+2mDbZ1qU^7KYA!WVY+{O-i
z(>!S&{E{9tWdf&A6k+w9(KyB^JtvD#k<uA#(qNKYiezRoDOSylJlcK>;}ux6eRMiM
zi(rFd_5iyb+@$eI&(3951Wz8vG{6kDMIiEd7prw12DY0gTf4ihgVxEf^KjAjfrfG4
z?nb#6CTDO>E0@kK1(4v9mXpPu2=>{y(rN=oPT#ar+{{eoh9P|9$Y-Sk%XG%0C~Goc
zGWe8*F`a4Y&<PG^fn~8Xn}`{L%+eoWo4&o*+&VZ-HB8TXs++|&dW_q#j9?H(2b<7I
z($s!94y<bfXOGe0$UEn;zRCs7>au+N89kR*DA|Ge(3$->iL&Xt^Yo<o-ax5gY`;z(
zBu(zdk!Rr>qwu%u^9M@#hfo9a570tg%*u_VCc&nUrzT6JMpcuUIkD9wNLqxoFfTpM
zT9}{gxI~kZDxnU|Cqo?gjsb{w0V(dF5N(yX9~vO>P{OWP=R=EonR5d_fIf%)l|N2y
z*6#sb=(jG7#hL+6YWJl1(#>FVgM8^CfO&3<w1nfbxf$xX8WW_|mhfu8o%Xp78@e!0
zU38d_`&HQK4MzhDt+J9~p6?T{U~wt~Q^SYGW=TeX?71K8?rr_+SA#D4QdW)3ARp3K
zB7Yn%4nx;9?g+2q=ay(`x0V&>BRS1r%}JSHf*o=}vIcntS27AFgow7jr3~9NO6IfD
zJlShcFvJ9i$Wh7tL>j^vgwmgf6R_)z)HBL!Xye-I{BZ^H4lKXXIpnuIWsHrOyB;N`
zjJRY}_q-uDjiV7Yp<x_FBgEX{IB>hsV6bcq?T$b5d0=MQOf!x~!w?0&i$lQxmdQZG
zQekDoXrJtC8^TShVX&8*Y;~p4Xsqs4&~0#Ng~0(24vnpo!~NEF+b}9ow7ij82o^3^
zw*<3LZkm@SXO=RzNSU=`NPE6!1Z-&p1Ew7QtgLKA0dRhcNF$f-0M@C2CHlrd7=zr(
z^RgzQngmoC#VYWilz{D70p6^3yJd5kU02u>6grw*@h}X^EW%}y0ZBM)QjABm%<uG+
zR3kCVXe0`eX)qFk&3cs$b5)Mk3>%R<2oW^4Hw0yKOOwe+@*;(bq4}3fm#pwfI6uXl
z#h<W)3MVWk+)y;o!~}bMy^OHSkjHz^IBxE3y>ISR!lEWn<{>ohkRuaO%h?pcjP5Od
zXq4gU5kzA!-|6&BQkoM*Gzpj&M>GmO>zsudA$$EBPhJ1Ux$DHuMv*sdvDDvY(w^hV
zizQ|nZ?T-JPFGFW##B?YtRsV3NW&;cC+t05FvfYEK3^jc-|=kK>CBm{aj?9Zs>9AR
zPuss9e8X9~V|rIGIuF}igIt=!26GaMtXb;%oGagh!alIiKU<ztmyL*C<->%-hjxBm
z_}r(fs4G8R<r8~hL8-wqZwWF{*M1Ct5kOY8)$KlAEjO02@QBCPl{mTn{d_GACs(E+
zljD587Q^{`jc`K#{l@H-y_THkD(5?$-;%zJd97z>&1VTS>pX^jp$VLRfps@4>h7iO
zTk{y*WEIV}m?rq|VY;Hx&2VTs83xk4U7Eu>{QtcgNmC7JmeD-pJDmZ7yi6Ntm78t&
zOdxYwJMa9`YB!Tp;68>wjM-&|H5j|c&F1`bAs0{H#4viE^>>{bVSDd)iV#oICkfB`
zj;9F`m@`pSezyBK1vb0axTDkKH)_UE*QDRD%r--DsQDC9>%#Q|qca)<7z_^k`HSaY
zuU|Yjp08EZX|@i^!Ir8^RbbutdMSjumv&5rYNxpi-8BK%0wUSiP&h5$4Be!Nbdh%F
z*GqAMv2%EEa?ot<+=uYVz?Cb2x~>yAmeu_`3nA6+dlp2JHyOf6Wq;2CNfMbSlysO0
zf=PnjRXE8m%knCF&vWd<!O6#+)BU6SnPnN+CeE|&c=%m-n7zw9qjqmh024s>J{ggL
zIg^pHzxT<AL{6HF5@w3Yh@i7iMtvG$XZ<PD@Wa93M;ZC~J|<!gzO1PjT>PykplWUY
z1Uxv@0PkxO0_&1f4->!B2?wNQOf!+gCs(R&3-p=ZP$;aV0Mhs5Gz3(0I(L>c5PK?P
z_EFWOcZv|=$@=-Z(oZsOJP{$R+!9AmKg7wL#iS)M9Rrt}>$0b-)pI+L*AHLJZg<%q
zpWo6I1YJgyD^twwS<q!a?{Ye17i8i+2EhAQ=Ezw4>n1##^^;}_l6Ds~BhsG3J-Xq&
z0Dmxmmjl~}`$t>HO=Ig|$7sLXIx^N~$NgpYB8=N`L=V2_!6JqTj1X;b;4%3!TU)K%
z2`7xW1kT1hDC1^cQ+ysN3&<IZagQn!I~f;BVK}sm=B233tLZmSz4z*yC1Vb!Jw!|g
z{7zS+401CcDrQ1wtArVaW>}w$-NWPU?17V|Bi_q0@_g-Hmys#Z&9;oZcvwcJTt;5}
znafD@u5%tN8OzA?wfkR25a)l$GV<c@xQx7*b{To`_gY3?%(RTWm}ePzabL^Gi>zg2
z&f|t2jaK3F*ys%YnDFKy0-Lo2Xdr)`*uSH|o=>LYXYBZPALg}gZZ^*+G$YmcS-ze_
z0M0J|?xFPq7lzEYV8LKc9^993)JRDRL_PC66@r<QT?xJzM3!BG1~!*%!t2x4-bw4g
z*xvis{hR0r`#9G(#!k<)J$jI5+`-ar5~gf}JH6cZaD3|ebtENfZMVhWuh;`SxY;*5
zo||rWhc9dPx6roAc(0z;>_aCWH~;Unb==%xKeNV4V|8T(V7W3>jB)_Eh7V@M6GZeg
zzreMvg%}|Hv&o>U(}Ufu)-gSLq_@@^aaj7N{22eOBs0fOH2a>lrD$zwCVG+l?^G;A
zsmwIjivwjF?dg!So9^j-{>`MrVY@xDojaM|rXt9e1wMd(4>I5mrnkJ!d)f>|Gube8
zFEZD{^wa1pyuaCpJWZQ*l>Xh$Hl!|dmdVWQ*@Y0Z&#LxO>mXw`WxAU9!*#5x@<)*G
zZvtTr1v|CViD<Dj&l6FIZ1)pUxRmGPae$~J3Z2uTp9Azf>lP<fB`^uul=4tGS|H`k
zaI*FvQmRkB?a%5ekV&pHxCxh9_$ee;%G>_jq4Tf9gOq!=To)ziRmC<3RhT`UYB2Eg
zM~;BTxz@oa)l-k1c)_&M6NkwjKXJ&E5tIZ;b!L(ZmNGcRP3Qn*hugIV`kbzsLKwkE
z8%J@>DI+PTCr|d;#{S_>bC2F92A+M6?v#ykS&>jaE9!lBR;*Mi@tzlLovNO6d86}y
zd|?QmJPCgzp`(m2i?bzmRU1<{!VB9}Xdyro*SfildcC#%&o{@1rw2R2gVX)L4eG<v
z++o}s5W8^Q&ok>L6EI}H-@{_k4G|Xm9`qDH=t2(ZAtH<x*=v-SVDzGuFA-W1MjWHS
z1I0pzTOvTMO_j25|6v)h{eVBIz%T|iXoYy0MGGd+mlP;!M0*=to|mJwGoBquEb}vM
z4jidnLF=hyB4$-9qxgVt4v_~sZ_1o0_oZzm21&}x!vx58s)Hp6&3b#72ABExFb<rm
zr0L~C6VK!3ZtH#0tyTVG#l6;R<yG$O;bE#*pd2@3+USXl%Gjt2eMQ}aY_p&qyYJjd
zx@F^-Am2p6?_I(P$)!`PWEUl&gQ`0Sr3m6sEa}PR#`9(N<NXT{y^c)r5dr$X1&B^+
zz6gm!P7oqG_@5(2@Mr7I!CZnQ+PZs@7eXcUnb|c*0c;%@Ic&6McWN*trYzYJ^%p5|
z7|wTL4l9UDH&cjEj`}{z5BRf@numIS`7wU2qyxZi3{QqQ%rZL?eoVO=%&ncRqm$Mz
zP2=Dwqj(ou=D9bjiu;l*nf;TLFWI2qsg%hiI78Ot!e>dG%tCYB>|_p$^u6F;8AxWw
zcyn-Sv=2{@x0_SQkqH>?9#lrhR(J?4^AK8Q*3dGs0i=H(0?a%Fn0W}k^&lbt%O&JP
z@T~{g_|0VF1r094b&M<1a{zcgF_}PfcZr!m`5-(Wgy+n{Gi?+-$k7Kmdbc2kfyalH
zCq}FfFs8?@?BIg+oiX#>F+NM0Il|#Qcrzb1DP)E~W*{;Hkr{x@;K;s*6G5QUaib<(
z_>?J`G_cR(X&471{V0)Gw{$-4^(?$CDD&SHanoFGtgO(fA5Z4iDVtgsl$))CU$*v^
z8ON~9WPuS>8T87<fB0ukahb=qzt3Qd)Ad`*<CZB4ey8V#Q<9(c_+|Ri{7mt`B@|@J
zlb`8WHS0-g`{cNJe0+Fp!2g;jr^g3vWBcvavGJ~T@>V<JNk3AZ?<EjOgmc#&fB*_E
zgg|n=p^p#KwtxC*!qcGq!bz#hBZXa9X4mozQP{ZnPTq+|q$F?F%Qyso(21Ebb)iVZ
zVV$z1xx0AmSBxRymguR7i3=H+DQ_;+)1zIPf!4qqXW_)G`6#85KWwtb6qp+`5NjAT
z)UdcgEjIA2o}ewGuG}(HH7}Y7GGp8cm=9{J@fwGTzs?#P;(Gvdg!vn>BDAiWAE?#n
zPMrM@{I|}kjgK2Cfaf20XQDIme8|p+{KieLtNWph2r6u)_6)&^#H<o9{o0lVbEA91
z+#VwhW8}Gg&m58%DOn{xA(Qp=K9q?;SkVer#G9B)Tb~$~nsxC3%_dy5hajw}K(++(
zYe5{qa>hgGz<)DA$udK0c&u-k4P+u)5-CHG2MMdsp0nE|UrsJ8U;!voS0qzSd*CBW
zVndR#w@1v}e)6Qgb<l3HZT9-<PmPt=Y^%2NtoG~~`><nm*vcAPU0Hehv6kQ@A7ajj
zVQO<-*<1(tI|N$g?++^<^Eo~GP;G$ZRb9k>hW{QvW<2#=OUxM>+h)+YU?%8@ee`~5
zI?&ka>3e9UJS2g^0plmZlZzl2t=H@QPNxP-Zq4=j_2B@2R!4}^^6SWtYGbuN^!qET
zPgkDSE`niPaw|Lo+Yfw&$@DrG_N7(F5_KT0ifZ0Cfc`<O&#H|EVO?oFZ=_*O?}FdO
zc-TnGTpD5a<KNSxf2j|xFcw1kF*Jza>n8g>J^6=32Jrsa>Tw?s)}`g$fHdn2Kn`><
zU<r<26`N2USGl9W9@>9U6g@v>(#qHfKbY(Z`{5k_>EJ(I{Kvw7diYNt|GB__Z2aek
zf8)QO>1(oo=mS|p{Kvt6T>NK*|NKthexGIUkazr%uAu1qgbaw;Hw5>i_otJSQ1G+C
z<k3eoZY&ynMB>Kc2vzZ6G1rhuh+Ak*J}w|85S9`iRxc9^16!CJIE_pUjMs;Ud!QP~
zz-dwCJfn?JnX0Q$Nb26)W5dY~;x^u9*>)ptNVNMndWNRcMO&z3A`^_L|J&j_<T}h`
z%X7>@eKbBF*chZ@c<v5hVYvn--3MCFzBB_%;We*5e+#_Ezpdc@aC25T=Fsv-X2+^s
z+$Y+xbKi)`;1UF*@8k2hyP%X`4A6c8mvi-g5PBB2`ks(Met&Sk$nLMHge5X1`IL|1
z5ov6()9YV!J>Lj0V0NTf4;F!FAxfbl?l>5Y11iOMX3Y=G;fS5vj-sT>b0TRq|3dtR
zF78o{B;62{wy_}F&ZKYy?GLsQJqk49g9hYZSOeG=bUb?$h#fT+@lkjQk?*4d&FdX|
z7N9`c=QD5Y;6twf@%cA?U=5k?VzC<x@`@2&{R>*y&#mCf0;#K`;1vP^Vv9`ah|*tX
zzGa1JC7;%RsHiI1UL^u+fTR`3Ez#JwdgB3-<MI<(q6d|QR*%`V@CBgT_^L%W?wEC5
zrxXC1E7J*3?f7h2qh-n&nl}JBbT2IiTLr5N80-LQ1mLh|g0Xn_HZpH~G<LKcqB9^S
za5f4?_XsOKN&`H|K**_9J&P7T**+-eS;$n?c3$HrzQ|b4rO|WU66i^ujR(j+EBjV}
z1OnHrpu(<f=t*EZknMSPw+k%4!WHNd8@N2Qb0GVES@3CziZ01I2){%FvWL6a07$?Q
z?iff>^J@jQC_aj9DXvV~b6t6Mz-yJ<7}_u-oG#MtSXZcF;G`1>mjTcDIAB*6`|P+^
zh{18$mFs;rJ$LMM`RK&KMv;@38Qx(cBbI3tS-qa!v7rxeWVGF7!h=l-`6WgHMQj$;
zBk<`U@a$_Ct@sF#sJ7@h3D$E|q-cnmFjSB!FrIDbH+<yCzYK1WZiIoteAZmpeVmX1
zHZ3+1#tzWoBWawwa<Bl6KuQ^{nV~<SGcIvY=&(;^>e<zoj~nbO)X-&Bhn4*LZ)fEX
zX7!J)>c5PS;>$|)C*$MNS!J`fR6lFfN2O02Fv3Z(#fOX>>0tA0agn3vXT#`Ml_w0a
zzDH$BULp<98QiL902-jD0RkwFo2AP1_hRq1jt^P~Z`K7{WbY{CYO0#DlaiVxp`R1e
z>c(vtML>%okl8{5IN#cB!@tCn3X~2rUvIVF8e7M2et~TI&QD7#oaX}FW~2x)E0Vpz
zXR!PoComS=0K}GsI}d$m=$(l~ekubh(nmH+thB)t=%=(^R<LJGbvVc!C{%*lEG}Yy
zAG-m{WlxNH6!sW$j?(>g0373UT>7bS_~Uawu!AudaC9?v1|Rge<HEOPF>$&oPvq1D
z1~KB#3JXQQUaFU{aH&-9Z(uYCoCYut3~X}8Gt7ZA9)6_p7*9KcX#t=${8B$VYit6d
z)lz*VkI=&INwl9gFKjmq0uTbfk8N7nZrIUbyY-%!(RF!*Ud5AGBZ~FkrlECHCrkCa
z=wcs4UZFxi5NnA8)_)6^i26AmJM(l{_Xd`j>1<v5&IQPCn<OugFCV_#egy7R7VGl8
z^jSlH8qL0bWsmC;tEwP@2QdJ9vH0fM>a8fT4h2eLk3(}6H&9)>*Mo}aH)%md7Ah<+
z>s{-z?u<cv<EWL}whb10KwrIzqR?KUXuCnZ4tj{Iu<He8xZ59(x+X1coZ3hQ>9Q)n
z#Pbbl3LvTe0XOwg?m!ptHeaN+c|l%I2o6SIq%_gb<hi&Afg(Z=Pg#~grv1-4%m|ok
z!%Ke3Akjy#FD|mjk3*<<UbGpyD5Uu|2|G@M1x-+s4*~H<HE8OtBW+Q3#@NBto)(R%
zdvYcOykq$bC3#RI=RiRY&yi>K>}xurI6(gg_`H^qHgQ1^#~TJu0$pPdrsL53Y%%M4
zM2Zi-&*!-{g;Pt6AlA}1ON(Flx7$*ou+!XaZ&r8cXoBBU8gFUmGO*9x^MCuB^gU3&
zPB#leRk3m4tTSNo>%-Uo+eWQJKZmiY{&lPz7i8O^E1XBHQDetk#YP1P-y}LdtP*@l
zSUkm<U=HxH$PM5Jb$c+dx;1_n#y1a}pa-2To}Sg}wfY8pt+|VJ@#XyA@U_H&?afco
zLn$DLt5Wof<0^h4npSJ<$g@UxZ^v7+(>jJd#5)u|V=O`z9p*T2u>)RiHfoKP5Ry>9
zM=H=LH-&!3bw$^^L5&<XI)YaW&*eI}4T3cCb4D#BzZ>R==m>j&71`P17ggIWwFMZU
z9q<*?N(Xu6izPrXa7zW!Dg;?H?nJ3VVecf89H<QVtTT13ZM09ePEOmKwR&WWbX&xM
zLrS%QR}Gshv>k@E$l-fm!#6K2LaimnV8o6&Okj(VN{cgGM8lAxsT;$PG23&%ac%=t
zq-nJ8j)Ky`VjJ&>zmf*2!8Zzzeqf93x6QphnAdMC$MVd8s};O{+?^bcop9gAH;F_P
zpEsQ`=p{~|_Kb8$j>Wds={X%M;N4eu+~LU826I_%oN+35t@ClekEV8ybO@WaXrfOC
zZXYKm>}{-Ty1FP7sMsdI?!`{>4Y99{r1?OL6Nsb&H5s-dYUtqaD(A#)0puE}IgIm#
z^G+PsCOCVR!`er%#ZG?MqeqyvzXsdA7I!})t`=${E2|W+<uz<!@u2;+3+k#xHxy75
zq<>-ObZc)LXxRi^MbIyk*dt=^{y*EW#Z*Vfs1PoG`4{XMgnK)oZecuUYd9WY2m2S5
zEKLa4J_Q9o4o>&>w)b~7*GUM05UZ}$R@tTHp-iO%oPR-syR@GMje9h(0~*$#mM?y3
zJSi@|D&E4D`NHm85C)s?mOT?h7K}M)FANp4Z-F%2v3*+b_@IQ5NGBBxpNoTTT<x=x
z!dTiY;olOetARTT*ukOkX7BK|(LR0MJ_*e#Kog;@E~~n@Pf=|Sw<}8{*SD`>@3hVp
zVS;6ps8kA-8x6@po1D#3p(IBZB@~cNwnJPnxf@Y#l?HR(^zj6&?G9i|>9ZeMee8R6
zJYwTEWVM2j6PvUl`4c`RRihM9lm5<JKoz9ngI9DW`;2EIbU-MaaMIZlUYBwo0<eeW
z98p*6FrEb4)Nu|hnJ)e{{Xp38e5U(mb`EUD<EuaXi_le5^$(aAw38O|Vo{qT(#H-?
z60Tyr|3n0^Dtd%cYrrS6fqE~079(Rysr;%FH58>V-EhJjhq5RpW3=KP`-gw0Y7xPi
zlU6O}loB4p-hV37XdHLW>$FsXAc6nOI-|3P)1zg_+<Q@dXd<y$q63Kp=Hg<5A1D+{
zkupGI9JZvZ<0-gd?s>?ZMiG?7;(NIrk0aKK2z}r5`kRXlc_1PVIlO-K6sjo5#QlV<
z34o$?2^iQ;AkI&5xY`m2P^5i|9K)#ZS?E!(3}6s-nWTnF@CJsWM{8%Cr!XI?9nB7n
zfFwYvAU8cxR05G2Rxu<|6x@{>9@oOkPp;d{!4;lgdv^aKh<Hpp+B$h_w3|m;$6F_d
z$6|T<LGzRbl}2G`^(kW-3=a^O8~9IYgY8n%BL2I<IC<-dl?^8~_Xn+ESf2^Q*RP_B
zVq}#zkaxGz0by&m4gbEgxHo({`C4YMiKCr|V_h*+8kZRv3|Sr9w+1)->=~9$G7R~@
zu}h-N_W4=9M|v3mU!p38*9EQzBF=M%q#_K&nX`G0a**n)LUpL6m0LXqDvUt{zuVgT
zC%Zyy9op^i-3A^#((&Ljs$Ey^cz{RGd<n+I94}MUat_KJx=z5aSPqRWhNIwypRm^|
z1xVa1vSM*T4p1n)YeTcIU=HJ{w1+GF9yz<=hu5IsT%h#1vgCOxp2~;&8Q&V29=ZXf
zMR9lo-0E%ecwLJte2&u6{Ne1Z{&9&_SO^9AB5D^V;x@oQ`WE4z4MyLh{m3_*z5$gZ
zV#+Ph5jO#AI3OupOn3>>toYYWelW)&JOxo-T#-PMK$U^%=b&|emgldD8l!p#4X>`<
zrPG2QG8i-{z<Fu;%b-H~q>rCNAKoBisn7A|2lS^;FuJ!7_xHCBc1nQ8cDPc;<sR=L
zLJD1bj(0A2F`{)<En)>BTS8lKeF0KEfO8^t<`kAnF&_?d*O{<c?3j*fCC}Or0DnM$
zzZY42w+ziX_uaub5O*MWX-o(4B+6h+H-uC=r9<%Wx`yT)G+7+1(rh(pta65c1VaNZ
z9~9<VzlH(f9^oXcKCP{=(|4@{R9`AEoL|GN6F9U&z%)`oR%<I<t7b*mMR0<OIH|@X
zK!*44Q0WaTwyi$;LZYn#;}$1u2>GBCa~S|NmCEH3OcR)*C>TJb_DPKrR%W9v>Qm2Z
ztF^{jO%7&p+dvvm^WYbT|Lt$J_UIom!uf3h_0ctKnihF6lE~Px$Tif9P%C0(d6hsg
z6{gyhDsUsf2)oV?0*=~^&C(()T}SQJ&C*NyvbI@z0$-qI2YYSij6nuD9X#dU+cvgf
zJGU*>YyP{iw{`I5bn8u1%MdB#&2tAES1Sm5`Oh30IRMFTQ}atIc7kNV&OY#6KHEEd
zW9;sHETr${(mnus$oI*`PcSOTumR-PCpE~af?{|pSi_5DQ5}v+UM0>>8iekp-NleA
zu-$d#4xEm;h-kpV;g=a{+LqHniOtc~aCLTgr}3LtaXC-3iMJQ`?O38gdLc~{5FINd
zf)#7Xj*n(LKZ!vlN}4UnG*-2K=jM|kSVLDg7uRAcBR^2t)DKsRi%*NUVIJav-GBV|
zVl06WPI+h}I$?1Y<;LP#A>l|?9@j(wSJi14F*9s+;g&^4kv6Jes7cmvR%Z_)yk^G9
z^FP?1vR~wG2X{I6!l{rzE4oG43@$b_VnQfwm?P=gq(E9zj1;j`iwqOgNXWpI6=5$w
zVz9!Yt9;r$^9z>%c5-UmASOW{f;_Pl2ek$)Hl*N=5RWM#*?iLevUQv!8aJ5y=Kh8$
zFi8SW5H!eZ(nfeg+Ss@)(6Jl+-qZ@Is>RVKAcg<-PMeuM2pL-(7P*IvKvq#1d2WlD
zZjT?~qV1kd(qAY-R+qyc!<02Y<4iTXmnLMviU5Uh)!<zcF<|BM6%BW;m^lPS*neOc
z6F`S%<eqy4-G{quK!-=sbRfu^<S)}nxMeDuf}4>Ix+431Y<BVJuOkuQ%7wZpYHOx_
ziL{Z?gj&ITQWVO>-y#?PcyuLJmd(`-wcLoc0oIwuYTAyLpG6^_QiT6yyh;5M+8-=7
zo@|~i;+(uyyV?l_&{&}%%7Bi*qCFfAHqaQL&0EKBYPDKwZ{v`&JbWj_2zF>8udtRe
zU(a2xK>-S1+(`#`&KKH12^|X%^#`E14aAx`;9Vc>c<OXt8dEvKoSDu&NVwyUc8ooN
z+lS%UC&LnH%)%%r2F$W@xl-YVEwJCzdy6{e4DvzzKY{-MY?DpdHN+^5(Yz6xh-?v*
z^GaIpWRwxx=fzjy%_N9ITu&OG5*>y(xZNz3GGX6bIxCxJl~T%zUy#aq@jb6(1wLrX
zUxIBmMwW(RbhPn)MW}A_SOtJL@gJ=Pl*W&pQOiU&ss+AUW%X2*L)IRF<n|N%NTpuX
z>y==e@{3l#%8Sw<b|RnPA63C8t!lMvfmSAI)GHSlHpO49YMB$(Osgcn57V1g#GMap
zo)-nbph`+2j@R*qzy1;bTRN-MmljLx>?>Miu=f(^{aLwQKdWTqU?)R*O&_1CHe9_$
zZNkC<%^K>zK~G03K7*R;U+}UR%?{AQiGTkc|J>p~_21rO8Tb!rnHIJJEzAY=>i|)!
zZ?NA>pHSp%(QNM0Eg@Y2k3e{AU%)1~6M(jVY&v~ZicPZV7{F#6%|uJ)c?TAd{)PST
z&x4`kj(+$2V0?LXee*|2fbKO<PMXK<&C=HE?VaZCo42k1{pa5P!Qs*W9k)+Te|h)*
z*MBKcfpsxb$zlYL0PWg+JAnFE8mmv&o<0BZ#ZM9mnVU!ydl3}8P@&M=etT$aZ!-FO
zApV|+-TfzdMtCg_>G4yjI%GkkL6oj<&N`(}JYM%w2R8cxO=+RDv9a(-{N#pxXtqm7
zF&)WJ+^b*TR2UP)lmMALH2~p;HSl_1Z}s8@ZMC33wp#Dm^IGE*d&$(8lQsu>^#yUX
zw^1OnMMFzfrzCgs+O_@SqWDv@t}Xc$x3uBmbyp_C+*6ZO$AB4iy{MS3aTrJ%e#V22
zFiD?3V%uJ(mcP{Sr5`y1=)hrBUng2NDGi=$`k?h~mZ%&*!hFQ=b?rId%6R-JBDiu{
z-wmL<{B;2YJIzCf?YDmg{qx*~wc``7n<|BNlxS7M#4rW#>}sO?YK86m@0+6|_A~Cy
z*BGG2BPai6h%fN{4S}!3?`Cm(PTpciF!|8BVNA=YMAmXR4LBfuvI#{$|ES&xy9)gJ
zsWW2L(Q%0v%HmYK50te2LF+mk8R{5PF;U>B6LQ`cGk3(miJh;<F~f)mMSnCiVtkT1
ziesZPGPu2A&NvK}FdDALD6W6uR-a#2hbM6+_L(|DTo!isC`>V&CFn&sU>&Q2rz_r#
z+!}}qLO&7G+)<nd(q%xEA12Z%UtMIXX|9e1yBaZgKyoP*I#~szDP0FreC`D1>H=A_
zuFPsPNTB<Ovl1udcUtA68&zH{H$hQWjnc9aFCEyUl4dL_vFNRlcM{=1BQlGnMFCxs
zWckGi45vlYI&?;83P705SMk~suEVhY*O%0y9Mc7&1yCVCsC<Y#1e5g!jdopk(8xt)
zAS8G?9YSajSYncHpn*?`cs6x|_gr$!YNyfSJUWC6kG%bGa2NSvqK}E&(4a6j9n4tV
zA927dtWLtCe^~~EKzIxw#Q@A;UT1X_?ZU`0GzZ=+DNsd-+J#6GYjwzmhI4U*zoIxo
zEmu1`k;?(h>D|^|_E7+esS~US$VNcA7<07s1h#?w@c<u(+qk%-;1_2WoLoFdZxq!E
zQN5<$k<*f}C}Kk}<9f3s!1;Z@2D6z`j1Hjq{tzUkctSEXNBF9TTQaz4Ol{)r52&o$
zu%yz1EvnBmI-}8Mkwyp2o11?uMfJ&l97Q$Ce{A^w`0!iQTKONwKl-KOtduBAeVrWt
zB1X-Ve~d<Xbrz5r>^W?QvaEJuA8Go7cUaOdK+K|uAGPLL0;S*-CQ9mPH8exQXb5EZ
zcrkRl?8$Y!I-G2ssM%7ErPH>wbcz)L=9|Kd6793ZrNpv)(uDVLbfn>;W<0b^yo~IP
z2mGKTaQQ(K-6(g0F}(x9<7)mW2YDn&!FkbUR?w-%j-hNks}kU5FAy)b@u-U)`|xAX
zjsdi777O9?Gd!{;v(K(>@+ORsFt^axE#lrBoU*NP;G!Y|isAF0@Nt)Oi809dnH)Xh
zqk}XmTwqbc;j^juPe~!f+ve5|jBp)7B!w`0t%HBYuuxJ6A+GJ(8iY*3!)ok@#aD%b
zi_dy4TtA>C82WR}*J7s<UFm2dG=Be7D26Ys)FYM1>p>XLOT|JFbOk&ky-on&mATyu
zHdy>2;^LCp=EO0}$Ba3+1xN~Z`8ra=pEa)YhV`zkt^uRZ?r`V~p$a@ys}=I!Ru&5}
zqEeo0Dwy2&p^<)=b&_&3NV1{ZES?q4KJnpR;>OKRVAEEH_a}~HSGerd%sO#?;<PG|
zWkFz}WdZGfIvv;J@B7>wqfo|9`RlVlyhig2CYcEHxr)0ve`Iy+o{cBYK0Dc>!%!HC
zn5B_P(@|`nYK6inwrL$l_lLuylh)zEN8BcUfa3TC=VA3?8D!~&H5iF4I5(>z142w)
z=BJf(g8<OKAha-D454KLECJ`17kN0!xg!i8{3tg3$d{v9-I1cP`hUmze;?aua#5{v
z%T;-Jpnt@jGDk=TaL8RDetpE$MFeCZD@))rLh-T`JJ2NqOWqlhR{1OxKJ?DO5|R<Q
z4taubvOnRc);@|4NblNwct}Kub`vGthxL=@{?XpnN%Lb`JG8Fl!zaR4lGUU<NxXd0
z+#NH=!*Lh36P5bwg++ZL$6>_W4WUFr98ON(5KyKR3delmBZB}jc}8aEGalrNOI)uO
zPWzcf7@zdK*3Dw<9fGp4HcYSY%N-#;?qqe)|NZ)hv$JCH?9<ue$2#r~AJ_Y(Pep-K
z%mxr8XN8DtEGV>mQC(SP`OD~Xf$=*-xoAVJXNx-JkbpcL-H?qKD{sR>wbEE+yPjpS
zw%ZG?P(bXWDT<g*EvHlCD}7XMi<@lJ0I;kt%5w9IEOZ5YH|^uoS$k+>D@K+#w3V9K
z0m7EiB1*)VB*_5kmfgF-N89}Q|LCf_Sz6>@N(JBR;8wV_$iI{dtpn)Hy*)?~-%5q8
zcmIT+@NcQ0?6uGEH*JwH*Sz|ChxLFP;mJcN@&km|e1jW)r7!IB)ay$wnQ!P)QEWjv
z23o|(_d)*VdVwEMa6R-9n(D1^^C-TyH~0~3wYs$VKjN7qJ{+N54~-!ka{n!#^@(jL
z2aVWG3Qz(Rum3_|(g`;CnIIimV7+&!H4|^5DT|F*QMy3X3e&$K0<NEE4}isceB#z4
z_EzYy^3GLE6Fe(aqWY^Qw!`n?SM^PP5r6p~)d217#JXgfT=u@I@8MVVO@0x7`5*lE
z7gkBwS?KbkxWRAoMP*`{{3^eyZ}N-y%l~BI=2&8=`6~ETe3M_qU;YRG?Fyv)Rf*yP
zEka-U7x9<>Q8b9orC)kaa!X-K7Kd`-K#o$*Q}a&d<b&K&sggJ(A&G?M?MSJ-;4Q|U
zZpUuCBm0vgD}_{)igHXu=Qwv+$$27{&#&^U`X;~pCA`UPsoZDH(N^B5ia6HC6@FlM
z0_9sosFx`FC1*4$!frB$=dd`sW9e07oq;CaC>2gX4TEnh0#S(`D9~FUoBWG%6}qU%
zfx0-CX*gbFO$E~Tqch=mEI`^NVTgW{U&LSjhm8B+8`nfBE&f$~lV8MN{zn%u;vp8z
zERt`uOpD_#ikT9gqDMG4c2N23J7lgh7xP4w3U~NMQRrnj8qkSGku6F`o9UxMU=m}E
z4{q)jA);4V*MVn}cC|^j?u$AL!jRnj7)ie;%)%1W+rk{xCER=Oy!s;0C{-`95GX2f
z_x)Zx7KGWeQesIRQWQ?7&vC2b1ed-8{xK~9ih+!sh2z&7J7lx2KhWD0wVy36aj&>6
znqA`gbj`&LKJ{$LY0#oxO~a)e-HGr#<NgHrqeMD-rPoX17T{vTuh;6;dLRD&2HVj3
zqel!M2gBFJI(zh}zA@Uk#{WwEedg=K_juxWESfEzUy9Q`%#2TNs1(n0@zv<u-HqOT
zS_iF@syZfmgu_~>r^UrD{M#+g1^4{lp6dpfD!x)OdAb6MjiEWhJpDHTgg)RXl&1ER
zvSZ;q5hM}evoI@B6Y9)}?TK0KU-vai!e4(gT4y6-c4$7|uvU68Tb!}YdvA>YJKZ`s
z*}@F<LuMUqy=fZl*1wu<ksT)d2~GPxpqcbJVEE%6`bvP@XbPd6fBRR6ZY-2VU`={e
zh%AZp+$FJ2>YKZi610F8XYvkNi63P{yW@x3Ga-~(VICPN-X!lxM+(N-2~qAR@0A#Z
zbsB<_J}d8~gLH(`lM(fCc`t-SQBFZh%q!;Ih=?J}u0Gv^=3JGhqne^><!ke9)haYo
zRH;02-mOZ7X6h>Mg~1V2ldHaKeR?Gk|DToE-Zw-lH^UL|2olXBXo!bS3qmaX@E{JY
z(CCgtC*X*HDg-IcM<?J(E0Kz>=3mT!3ZY|Y$ld8Q7zi-F{S3FZw!`fb<SI=2+W3lE
zDr(NDpM@ufeBX(hynb#go_^wM!$7zArx#@6EEh9ubW@6n+EvLie^u;=7butfi6BU=
zp2>qqp(`TtPakjxq``$t_29b_{yenCU!cnB$-4zTe?aXb&<>ut8%iXNom>2MBt2ch
zn|aR~T7w&O<6!?`dgP&qjBDFt=djJzYK_{{n%q`LHtA~9DxZ?;T@rUI7wNs|g--&3
zm@*kC<P3}72PM$R>70Q_&Hu!G5r3!p7OgEz?fxz_i9+^5p-aoLEvJJ|Lih1`Naza`
z{b+O<u$CV7;hUTr#dvO2OCD_*?9_d{@$I7n%K(j5>B0}bS)OosiqE>b{LT+YjPg{(
z?>{c(VWfD7UJr&NdX3_{`1)mtJ`Jf>e26?iU%A*aeE5xRu+hISUQ?O_>9bV12SUID
zHxL6(5p6ObCn~$LovwQoK3tBuze3+wI5W;Ia!%-2-F39rBC`>!l{W*Lj&{c9R*z1R
zAf0R^&=mL_kNZO3v@ZL!2u&;13X9^1`75`>8jdzmkH)|F6JNiT@EA_LhWsB$CjV6&
zYJC&&knaCQ+4Tx1VF5}+7$9Ut>xF3;K!u#D;bS-rd7;EsRHfS6x<-jL*eYv0WsPTr
z+t4)DL}#9zv1e6~?$~(36za%YLAC5tc|0`z&urz#ACZ9JXB><~E_c86o<7BxFCBVX
z6Po;C3ktVP=U7cx0aq7~VFn!TLvp+(w7%nID}~$1=7Q<-1V%?KB2NpVs}ONPysR9L
z`1Q7M6^*=z$aY|v^mcXN^5@|&9OP{$mK}=AG*7;pk07W?Z`c=f63J`eav0<+-HCpR
zc{7uX<VC3#_2i`Em2ZRiX{5Kw-zU81-a+28(%DMmS?Lo#Id)j*rVkTlnLkCx=?P3@
zXGDhGwb-Xmk?TNoJPK9f!^6JQ@vs4}6CRU=2W<Wrl(!wp5UwL&-f@=@CO5#q=gKau
zF66=#ojjQ2>JDG614*_&<ks3fnA+!N=W{I{Wx<R37Lcxnq1k7PXQi_<?~Lrv`JpCk
ze25`<kIG7~n{QeNFxj{PMbSL-&Wr4}#D3NvJB7nn^G%{-qX$_gkMrf-o@)=Y^eT~(
zk{(Y(<?vRJXy@-$1X(3?p~**O9o^VA__ht^kctH%4;^vL2l5#P!Xl_T`782y7akpw
zQ(SyhsbBinmg<jxSbWSqJ`U_*y`&ctnDD?+s|AJ(y){V8K<a6ngybhO?z%2E?Wj5f
z9|L{LqOtE;BlNja`VGddEV5bp#}CF2k61|_S-@5*z-T8pyZJGF*1yt*zQ&}$iL~cV
zE#mzv8nyXJI^RVOE9Rap*5B7hMHcI^u%Ykq`dN?iA@HGTpUyJvp@uZbrWYQI8atwo
zIp%Ga{`f<7KvB{1gZjpdF!2Y5s~L=J(oyv%AcEa<Smp5o+(INaHGcm23{SjpZill(
z`YbP86#V*c_4bD%*|z)u<GuKCvtAe#`k3+Iw;w(({ZOwL)}aRm1vHX^KYqOwwy{`R
zgnSHt20sex&VW#!m1}2T8f!1kZqF(;?)n^H@bakvxgUyWXJ|e1xZcNFf2;G_7a_@k
zEUexsob$@oCl(SVkYHIUQ3Rx{bE@(wTFpg{sLweS`G6Tza0)<tCPp=P6^%?T7C+We
zY8~KdX#LEAg13cIas;Gwd}8>Z{mab5hmVi^Q523L?he2F*&><JuCTUY`{;|{10;Q9
zJZ9f68r&BDzhVKJf^8!UV3?<*g28HS4Z1$+_~<05%w0QC;xa3~D&o~B$vTWcM<wt!
zbrb*X2Nz`m{LuJVk)+u8)_Q~4>}QD@emr?n5$}bN(oK&3gZ)t^MNq<TejkhP_ag0)
zNEkP!h9YfB7m1=>M6D+p(pW~c6;>>YGVmn=fK@+{G(2HXrF(Pwsc53I708b?`^gjg
zql6E6#I0*?bzjl~Swq!Sz{e~FX={m;K;Ou|pZnSm7$&R__?lg>!)OWLcj|9FqpzeR
zrOp<)b)CQw(Ix8rq892CU$Fno(v*Og(NvyDxAZCMu#)l6&nmQw*qRN^&INGCyNL?>
zFtEli==Fx;k%&E_M{f4Hc8Xg$S~+~Fy$RD&-^DNpWq!+1!QG*{@}TYEEB@mZgMGhe
z%Pk_W3%N|WxT!1Fip%tbV+5VdV~9X`a&82DLe4VX0a*`oFB*<AZUvR~>H^82VGBq(
zcG&B>xc4L-6dj=PHwWAg7F2;dYe#6PRFXSZ1LgNppyKwwekG!ba*9b6t?3Hj<p}y`
zvjn1Vfqh&e66o6|{R^TH1vUsll&|afhte1M_w_Ty!gWaL^CZbgl_Z%d6MkD?B8=-x
zxL#e;ioolm*I&3CyeSCbODo@|qzB<|xsSftX9u}k$k>of-ciZJ$UE$*1d4ffRd`5(
z6Cz_*B`{0Xo_M1sAdji$D-}en9-v4HMP3h6<C%_6=U`aB2>eD7C(um?td+t*^^=CQ
zv<$=X-0F78Djtwv)2m&#LkD`AZ)Dz<WqvH80$+$oN+Zw32g>4=3|1M&61u3_4j<>_
zqB%@1=qCiUyxRc}H_yZBm_cYDO8%H7HN0i?0?0CbJZieoE*t4IP(;6(S(%rrJ90k=
z)$4k=aS?hor$N`F`O`!!SNt}5vm7V)tT^LK6me`Cj*(@yBdn%O&of1g*^cMRE{27W
z8(ibT6-wZN{n@&*frCe3U>aTm9Via1fL_~>+n^dl7rb2N;ilUMmRtY|5yb{3>F;BU
z`(7jG>aN!{JZn=$5)s}UKE^|fgvz+4IzEo5*dW0`_eOV0>-4WLMCT*=mro1)%H=2H
zdS|cDMFqHrQtgZ@>F2&Ph$^v&ik+2tZGz-t>8x^AE`Ru~T=}?EIje9fNtVR*BPiQ|
zEkf~ZwRl$8k-ym4(_(#;g-l1F6<Nh1K;yThiW@`Hu3}W+5yxhwG7SY#O@EyUea54^
zh#)V~e(2<HI}~Sf;Ucu1bK1mSL&#CN&xmc>aKCa^DAxPaZ8K)yQbaciI~BH*w@J9g
zeb8AzLz@1S`Jnzf#-QC5N_(R9R~b{vAHSY0R_aXKUYzm$g}$pWy*}(I80{&@$B);C
ztpf%)E<P$s<sK@bng9jnuX61k1VKZjJjE2QUMGtP-JWA!W~-HWX~K7_2*aFZ%wGk{
z%0R@U3K@-|*x96Xz(a~U#sNv$UD#0ZwfHINsIV$)$VMt=6H>K@c@#=8t_s@dsUC0o
zp$d=UxyjIQz#Q&)Lq4P;Qi{A=ipzr9BT)g{5nrf?gF$R#?0UqGVLOjCJ>qO5odfT1
z$iRjvi&y1gVwpyeb!}2yIe|n4Z{t^D1_gQ&;l1P|RX_sd$_VDD1Iy4*0*TA-TVy;!
zaUQEIG{ftVuGPWwUhbEKH0GeDc8TEt*hD*A_*M+}isJONz67iiyp!;PchL1qb?F8|
zaEuQU^ra`yUvKZcKg(OEBYPkDwlrh+ldj3i#T_4h^Jn5{5L;wyeK-277gFBFRRV1A
z`gY=3Zn3~kUxm&SnEjYd6{K)Ws`U@MZ}+x8l8OA#?ec&nkh`IR+UQ<JRCxqV;`z9=
zzEmOj^*s!-w7!iAnb*=-m|sZ4x0GvW#QCvW5iQuPu2;k4C6z47uZzE+bLtf1k+1H6
zxxk$&uNRp1?icwZoh^5CXUo!n7*grcAw9w2iE(ZSHtZ2yzB~3h2p$rwY}FBwK~K?z
z`xVhiJuVYtE?6L4n!GW_dC}VpH|YULo1*fZ0!(?tom|W7aC)`TvpqlMqE@^Pm5(in
zWPXFY0BFkMeun$W=DN7_cU&Q1V}<^Y2}s<Jom*_@uwC_o8<aVSO5OwW*2rr#;dJ}c
zI&6*>H1`q+L{3{45?sI(^tZi;-7lX}EbxYh2>7<OE)by$SkALZx+us)(DAzTVcJmF
zedPX`dk#QmN)w7+%6MfgJ@8_W9-GUDD82X_l->lVIZ=N&k@p4KSdwo~dg9rMjHZav
z8uaFp58Epg${<S7H341S`|Ohv*(E9Z^=I2<yJppvML=1OYwXK+yA_bjmOCPM?cxRw
zmOv1?KHpqpj4SCo3qJLwa0AGqL4hJ0%^HSiqhg`KKQ(c)6c(a$ozf@lH;tJ~;l0z>
z-#+}d4x0SeuN(f?b@6?feeIVD3!h4nU_rH#T#&eHP~IsrsNQuo5=t*llL7{^7h{=n
zX__O3lcHc!^d=2Z2HO*H<Q}mDYaDnO21q=Bhs8y?pYyrp4UL8_cdt*D7amtJ=m>!C
z$3?hD5mhhRLOtl_*<%#>OJ`sCpR*+<&sa$!T3s?b5^U3_K%8q#x*3yKh#%;c@K^1%
zupZYk1$!K&{)9_wjJ|#WruFJNk-iRMHhL7p#jJ?YGT|^(m<NO%qe+RxTe8SIP25_f
zJF@DiNQqHTRx*8hS60yyslKd|Ah{@}@@AzPP*C0apXJU<I3eTvL)$BE#JomP@6yuC
z<1}!$BnlkIV67rXfHch~1;-t!Vt9AGS&O8~h=)u%dW>SI$5tB6K^scQvl<1j`1-ZP
zqXcfTVy#x>dj`;8qh>9O5!51JVS>D5g`$8~Z~en>6f@&%y;l3$2k~4N6oj)fhL%s!
zVzDwKOSm)5wA{2>>fv-$@h$)il$;3Yrg&~I^Wy2zb{8IrkWih^SEkohq19~I#onwJ
zVq`?=lA$q$4;y)VfxLjh!pIU*23YJ0zZoRGYf{$~4@1;%L@m<NI3U4flQmFi7-x@&
zcY+aARp=8OJ5m+ouCJo?3(}*U*+?Ub|IMO9a6tAfZiolK%*%{gQ+Sz5$t3PX%jPqw
zt`Vt^APp*7Fh)w&zG4?=_amC7+MbZoR0-kZftL_^a<roWr*sLSpjD_EEibM05qN6a
zU7SP+qhjgoCp_;bgD)OYsA~o$zFPwJEX$y<HkknLw%+eI*X4Cg=QHfdqzcOK>AGmz
zWnHlw%k-r4uGQM}6@D=g;x(}JCb@XhQ+>;FC@?H47BXYARH$n}{L~CZ`|o)8_6oD`
zx~x9JA8to|$G5`j$H48F155ox^IQ5}lFo<8tDy`J&J784BF>6RwGfJbkz5cjX_WEK
zOtk05@^P6^gf4wul62x%NhW>|sl;D`NLpZ~)@4-?`xv>f3P{WFz9W6nSF0Me(&15-
z@_Rp+S2u3we&5RC{H0Mu(I6iy_C8(|-yZix2In=T(-)a6`TlrOe3KbrCp=zM-({xg
zlgEqvi%16jc=3xy*exeQ{CeCkDX|pZ9csG-ewBTNrvjg(4;i+}KGjM%>Dpv@+2Jxt
z+djc^IV1-<c%VX0vtcRGW@%U4;PcyX(+Ri}MVs&c^=O;_GnXeKoE}sySHI|Lys#(<
zng7^tJ%9=N!L0tVRsEOoQGQve{`7I_RsDzag8%hZY@hM!tDLUkX5{Mzw6_2~rZ2Xy
z9;Yq8j}xFm_Qt?Pssb1H^aRAetE_P8;o0HuNM$-m_&b6n4i-&QpwSk}UlB}E5IrSP
zVG>kNRp4T2;!xrT&s<EIsD)xd`Qy|iEDe~mVz}Ru@)ed)vg?(nQ%UQXmogbwt+{uH
zB5=CAO^%ZtPeYk5OmM%DgOhQ1ZC$Fz<Nz!%A@KlN{IsE+MDx<Z>OUPHzb(~J((m=9
zO~foW#_2Wuky^vN%Sd?1Y^oqrmh^F^9I&2!(nu{8_|cYHA3#l@dj!1Qz&q&y8WZp<
zcYo|z;%rO+OuY>KC6wVZR*-J?V+R(xDoF%#KUw^ABhpvg|8N8ab(c^LwJbhr@xjDp
z3`Lk7Zlflej^)k=u4=BoO{l*7@<XIfb8aW^l)_%DFC`DN*it<_<iY1J6k#SY_jSXZ
zQc_&-ODOI1NS=D$!vT^!sO;LkNPnc%l@(cKrUS`v<e;Cr&IQH*$(#_G!17>Hv#gAd
zD3PoWs<0_qL(d8ecViw8G%E@DGseSAy<Uw|jP&yNo$K3`8G4R8)YgxPmA}ZW{+m#Q
zdQm&Dj7yj3hILjC4bVDlt?sR2rt$^GG+*nJagcBvX@<2>s7H_F@VLeqqKeC(jl_J<
zu&;r~O3Nh%|NF#L%mimsLOVkNvraJVE813-zVOTF#m24h063hoz^W`DI_ryb3tc|E
zg)Vs+63sul&zDcw4){iAcM<n5NVCEQDYwN9x-DW~`705agTG-lXNyHn*O|jxTTnjv
zGjZz-k=R9ZQ@q;f0J+WM)z0U0W44i%f?%GZ#r;Ih)Ds!Z;eE3aWqIhZC#y3zu(v{o
zF!kx1?32We`2B$zwFcdinfTnyoZn%|U3yX>`BQomDl`7$`cGrwTs~fS_sz`w>6j3&
zPH<tawPb4kB-=OxYobnK{siXe75<6riMDeZ2E`oM%+DI(MQl1QMQRoN(R_%pr!46;
zjIB<~j98m;*pTi@XL=^^ZC{Yv=vW<OsV{Hnsute4zxuajysD!dBLmmmMy69dO%s*d
zp4pl=Rnr9SZ#dGE&6uXm%5Ts&XtTh5r#3^!Pup(Ql<C_&*Kqz5+aAo=_~{4xH)(ae
zxzi5Wgx5dWhJxn(hdpAN0ck-GroAGM)ghDIoyfo|(cffCStzL2=CKGusgL{#h5{$z
zfmdkhl=n1Vy*V0lpDl<(#0?33sV;|)`8p;BGLD*^h3}Tc<1M<9L>DdY71~8{YX}Mh
zzzy&c6(EXJbPODf9nhNwH_K=zy>r+WmmJU}3_Rj%MJPHb+2wt<MgemHFZw0YtkdWP
zWGqSyMcX(>`^y0xFmjgR#aFO_6axzGG>ZoxC1*Tc+wYiOmpfRZ8yWI8O92XYu&mk&
z<D(v{*TcqMLL*pb;QIVUWXMS$>mr{T=kg60K$bnLf=%Ey<LLf|7{$#2Q|$cSQD3-2
z#EupcAv>wzR~Eeu;>GC<R8VVP0xNk?Y4jtcy_j5dT!SB_&><jRc}Cr4_~Q;5$CClD
zsXSqEiiAgH<yJ{}K4yeR#Ba_hq=(hf(xo44zKI~`zPdYR;deN8DV2eW-%x2y;DO;3
zV%=*no|T^Z7=&q=PM01(rZ;muU^h-+a-u}hb}r}<D?KHE*|&*rBj`+;aB#y;VtqKj
zX!??MFn?}9j<`&+F!lp)EZ$i%<&~O~s~vxl#~=~uHF61|yW&PC>V6n$uDA$mEQW{U
z9=Z*3B28Dh(9MpkdU^JXg%tnaK0nM%A!ou>z>K)?@SXzuO-(fq+P=;<@AngL*f&7`
ze1qN2-cGq*u`p~B@bimWghldgyaBV6n~$=AeNMigJnPcdYJi^!VkUsjSAV>c`7v?n
z!}Jf5$CDF{nG8KA727QSA-vm33UVRu!h_S}rm?-dxAmqSX;qk<!Hwz4%|}`LsJY$R
zZ8dkIHN=w>l+99ZKFXT!PmZ@j?6M#9<OEgImYK5`kB)TAYGjDyWbaJ@KPM&c-=~hz
z_wSQL<b&RMJimX>+ZY>{A~|nFPf_yDV_L5xnVdJOrzm-+aV_!3#%LC0)0di$s=b}~
zP$m2#IYG`8;CJCp1bx`fENZ4MG#^bn?L#BhU_`GaCn%b-$eexEdL7}sWIiM(J8A;#
zd=wm`C7(h3)v;>H2|}hU@>gps@7sGPN5_ZTF@DM9M6;%WpPQ27!^4w!&xzzTLMDO#
z)x72RMTxPfu92ekOopD1ir1}!oz`&zFHcTTF&TPJnX+}V6+=t{f+r{C$z<^P=x7~m
z@15>6b=-(JOiqw8U5U9RTN<}{a+++L06iZS_{Kd2FHcTTF&X-=o_D_2!Q<LEg(5l8
zpeexTqeEB+>&OwYmYkqv$|Cd8BaX4-4b=|2BeYBbK0jY#$Ymq5XqmFeUp?|-MkkWY
zMEI##g)<bpGhMA;woaPH!Pb7WeYCaR%poNOa=zMAKC$M-s!A|uJ`D3w8@<U<b;ZLv
z#VDM<)O=KlgEk7Xs&POZY-_m*%4RD$=Zqc)Zr^g^{UgqpMQ(CZPhDz0s<epeDflTj
zLDRHl=3JQqGw?I9Q*Ls3nzGD%6k*7dl$j;4V{U?=DT~ZcPjz6Qj~xsUk%rt*xv7-R
zRQPT*_B)*n1{gdylfdap-hn!;f|NQkNt>?Ne025jS~hdoU~Yn@DT~ZU4?ffDSXsz<
zZi1qz3(ZH<wYX+UM=x>{L``36&bt{mCJ`g}AvbwNGgXN>sWJb!0Ti9j>9}QXlBOBT
z%|}_s>|9t?_k3Vq+88=IS_9=8DmOvj?4{?V^7=ZbZy+~G*;FOwqvji2js6)oum5l6
z4_dtVRamZpXZ5Z%@<S`4lT*Czt_{1hV~u`R;Pd?X8vbqk_-sZ0i(j9vt*!jO##&?b
z`Lky~u0930#*dA)=l_qb+_mCqK4WOR$JqZH!vY+PbKoZA|4l#STtT^m_Q%7a>Dhk>
zx6k-62*Y@dV4cN@&b?ueERVvX<GV+4_85#Q>NHxH6x5Y`+4Rxz<g;3%wjw>r$*^tG
z%7ll?0w`4qotDuP$t&0UT;O5EU}&O$by#!J^9ee(vO6M(*wFO@ByV7M2$wHiM4&m$
z1-fI$hnZss-Ll^lgsDc2y>+jwOUpz5pv?8Umd8z!Ac>jKjIPBzeAY&><aFd%C0W-L
z&=sBw3kGBj=z$b@&JJ5BTo90DmWo(L#$V8ObS%mpnxOrZKR!pofC0-4sB(Dtd7xLa
zA6YSQ&91VgQrsd3p28{%TiM031yh9RvpYKVtga9(iwC9xKU$Ox0nep$^vMQ5$AAIZ
zp55^a=QqO522|9sFxC<g_!(`4E?tkCr+H=<R*7B@ojPME@&lJd3iDvrK;xyEOkx1>
zu~R4<$KZs~89E!dw9Uc?ZA196d=Uhr^?GO?=~zMd<7w?87!DqB#1$ZCiG4t`vp%_P
zHG&KDST`MxM6n8YEY`#^iQTJuB7|fd(idLm(Hnx`E}v5Y+Et-56sJQ0(zv;q)=#4R
zGV^U@(AdFviO?BCbkQ^#dwn^s&_N})n&Ts{ix`CO)+9YJcv@P>J%;QFxY?dW+O-BU
zQUf}ROHgJzIQK5?;D&sM<3s>JGAc`{kF%;h?)NF?*E;)@VCQ<^jjd1I6@_9Yj0>}G
zg?!{AffEA&S5}wzDGW~&A6Wyg(RAGjW2>f@61};FSR=g&EFA|nIm-yp=l;m_P&!_W
z`{)F-FXSK^jY>OX{`yVeW@DcRg@DC%+yUs5z1M7L<D&qEf&Xx7nofY0qn2>lH{ikY
zV4U<lbLbN~V(b8;cgo)Hxo*H845B3JQ9L#Lfkewm-nGJ?!jzHv%(id{>`M{_#<6cA
zdJ~<0p+%(+18J<Dvx|6|*lt2aZI5>>w;m2jpkd{sbd#-tuGiVVjz=h;m>Bx8tihFe
z<A2gT6kFH8Au-OSnA$!%6&=K@#K@t9jK^>kZR^0|z=ulL_JSLuYjw;UW9UymSfb@B
zB(52Zyzw7@%!4jkPK>@C{K-i6b<vCd5MLRy3-=17D=cnmOnO!@_8ecz13nC;IW2S+
zA;YzR8&Y#gu8g5Q9*Pp#2a}eE#IteP@G%rh{~~~F@?53_ITs^VaD@RYk>Rx7YNG}%
zj4xadeJ*vwHlQrAVpL*7EZ*DXFqBV<$OtUUDZ^uOQr}Tf0;C#i@7#1S;tWg|2gAnl
z;mGAyg}3q&v;r~&G?Su-Q~>Uvfx;V{n@FAO2+8TA&+F(K2BXHoS#QqJzoLNX*w;5o
z8&I7%MiDTCBpV&7a`2ERN}4d*52B+9XsxibWm0Ql7tmk4EP%kWNz>OHps}``!>Gz=
zGok01ebnzv9&MFo3N0>z0xohTG&)TugKiX2Qs<ybyH?+`NF-p;hrz%a*#3}vE0AG4
z#AFrSD8vE?2vRAQ8Om=@1i>NoiWA_%O2+$Ct(B3XmgrC$<A7Z0WazR2bTKH(>(Uto
zLS?`w3g|sHkcBfPb!^iBKz(O4HVDJ?qd+gE>kBZ@ZX9!Hcf`s@rrJcD>H97$0z7W4
z9GRdvIf6Xt^!>u*3j;Z9c4=(DSkdGn`HzC-8P=6rzsA?qurg|B4>WeZfb%JYZtfl7
ztUWPnfE}Oo=B)D{D7)hs7dMn)_XLGh>Co;A9bXC(pcBo+UC)op_H!Kma!CXJH@QE1
ze;vExEsj1Qm3yy76?!}zanT>@C+I-lcJWQfAF^MyMPi+IMTQcxoU%ZHdVEfv@o6FU
zKsmaGAEB%xd}TT3y6jVQx%fn*s!qI$O8!rL3Q`}%3avlIE%9;`o+p0dy6ilx(1&(D
zAL6a{lM=oR-+7BUqWfs|vy?_Zqc(Hdo|wv<_k=4HCeY(PXVM<XhDkh<j1W?Ly|Fy#
z8v#Gi8k*PZji=v~8Ay9tne|2rFJ$L8Wmxm*HnLiUspi;2R9GX+s!7Trt)~7mkGAfQ
zZN4)@=}^%0HeI)e<pZ==U`&!poI~sMEM+-HdJ5fzLKtkD?>g~?1O~GZ4~7JbNvO%q
z9}lx-p5t3~-0`V>0=`(GWDp;KqifRxEEJbEECYRzhH{Tjo6y(Rjf+t&qI=6iLE8vP
zRW}B+ti=d3wIL={+99y4!%$U)@&ze=^}Uk5$ED_|rGl20<~4%a0h>j~;IK9R@<}W$
z`=-McC!X4sD=O}qF08>QLWu2<hblbAMcTzOA$EGC1faB#s|XF=Pzm9_4dlrJjW66$
z?8ak{L{3a7CbVcPYIl6NS!(ZsY4mUi7rpa;!)hR+`Eh+-ZED5brz0lJ5a$8c<;rxd
z;}`PpjjiM6!B$0EGYOk)aeR+#MSF>>DX>yGRu2-1PEeL$)^w>4_|iw`FlrbPhvnMw
zfhGnAgTXdKuh;CvW<)HtY8U8PxLwm$RXNfE+Pk{$=UIjsRA^C2gGx$8MnlGT<E%6G
z19vEQV&d$I4<z()278Qf1p@vaI<&1MY~)xdejo%&{mA7F(YE2*)*FOfBHqo1w{L&h
z=dJUhd3_ir<MSGbmU_?ZSm!`){o>+sSU(@Q=k+0NN9q@&i%}i%*LmwZqY-yyPfB{c
z>v<F&(N+te*J+%fhl`{_H{QI~XyqLQ#HI~*)HdWkchW&YOla^0yBfGvq7JG#x9O$o
zlt*J!yryfYE&V`{COXFbkw-8fH%upbNagb5Rdi8i(cuX1VR7O>PXX)tsldp@pl%Ki
zV8pQ!OD`<*@+Lguj7~8zz+sxH?hp-?qKp6H>lH0vA<-0!C?Y<5A?M`5j4s^LH!QU|
zZdCqWpPc(28P>99J9n!i|NiG$<Jrnu{Ql?pk1G%NKYzyO5!=R?d-#%^RK-iY+3-cs
zAUu8l_ZUxN98z`pX$FB*RPZ76@yngl7aoPd1Zo8W<NvaMFdhw*s*2o`kO7*A08C0E
zVhXAlqhyQ+K0HWkfI=A-v|9UgcenMv*=C@a@@LiSo2(9EppN0-x3}@<tL^Pq1$=Ks
z-`~G~MO8<xoWhuuwZcxbeS((5n+0KH4#gJBBDM00C%!6Z_SR8=FymE0m_kPZc;c&q
zG#-!UiquyHVZa>C<%zEf()bpeB)-2YNXt`96yIMJbW>f-(0=nwy_EKwxb&LBM(Ny9
zkLQS);>RmiZ7r5X!HRG{L205UnN~==oFp`{#8-vHGe!i9C%!5~-W4K<o&bHWGJp_@
z`n*_<*HwYEIAToGF;yyswD)mQ%0+U7b{#aCtmxOlqDeGv^IIYEW9`sVqZpwr@&Oc9
zC%#Kk^sGn<4P{XTzPu{v?}ji{`wc8O<O9=%X|jKGczgn7C<T;k*sKlg^H&890ua2s
zi6k`Xt95Nrb;8ORlc0p~iCs8u{z6Hfb@{3gGiRkLB1wS$bxRCw`&B_b3&Irn17J>1
z4w0plEPuQz7}O{xTPGULup=<IZ@E!fUM!<i5yl~xF$oyl>GdzVo^OEAqF#dyga~CA
zPKf1KA=Im|2#Q@KLi_y+Gr41rDNu%h9IO1TA=Z*!6{1$God1y|1w!_eT0Z_(nSa2F
zV1&w&1{Tdhu|}rQirvaMdYkw6D-ED9u$|8a1ztByuXBOw93KwxWRRxX(>?&ve&Tq<
zQG=5Zzq~3OwYH_yfW+_@Ot+J*<2TI{Ocq~ZDDH%b^82g835aB<!Pr0CX=0B48(R5K
z9P*G%UtokC<BzRl{H7`vUxD`1{Uf9O>prJk{s7o_|KvmR-9Le}ZDW6*2*WQx);^z(
z`?wbIARX{iIz=xO?4I>I!;q;L?lO!Lm<KR4IhC!~$6Lq08Z?>#$Ih=n_b!xry|w+%
zNbY7a6zebtiv{wb%Q3^I((Uyopq5DRZ)H6VSz56I`q}A;e^C_3LBa>Wk_{E**r*(x
z_7z;b_G~{On-g+MRKw+5h*3!e>Io7>RYdbl&#n0vi5#2&g>B>Q&T$NFw*RF#nY9Z*
z&_3Rl;$6&S_#4)Y{<IgOd3;Bnl94#XO$YL=)O6cPPY#CWC@rV+`64wr7^Ee4?aQ=e
zzH!dZF}l8=lRM0y?ZWg^iK7jAS_WOLr)IeQv}9p`V!NrC<G{Mk%rHi-o5~^>9QH7k
z2!7L^mf<<6<l*2<OZPC;XIchX=%;4<k(SDjeN%Jn&S%R@&GA#mBkcPf3p-f|mc?@F
z(otE)FwJ7RJc&;igar&-WJo+p`M`y`eF#Ddoh^a5m&!~;Ak|5-NKsR%fncjBgcz?l
zTqq)Vp5)^(Ms`QwLU}h!NnfV{R<vnorX{Wd6g!*;{I_gBA(>DuA*n=I*+4O$Ty;^I
z)J1dk-C(&|C6KCIud92Jx>$7(txXhi+-Nz@ti7n<&!su+Y(e@_tdx?dqYiGao<?)K
zxpMkxVdrqWZM@&#o2AtCaKOvGJ&^?^8f`872f}UYzwuPA!b^sPPF3<LFQ%2isw?sb
zV#7Ivi!N{~W$8h;TXhoqfn0vFGmVw_d`>_#(h&^JAR(T^%-}ks)bE*P+PnKF>4or1
zX0hO+n^6h`v8O~*_W0j6PET5UM(g0D`Q{jA_ThnKs?35-vPz;son3@wEC-n@Pf8uL
z<KVLeheX>rJ!qXEk|ejrjvds^^bY5FsFWCJKakFD4ut3B37sa)pQym(fEs++$SaXl
ze6-wDJtxdh(RRX2x`xTgPU=2krZu$jEIbE*t2)1rF+%enIZf!f-skMxG?hrpO;e1*
z?0=7)9MqU=q^heim|lwZ5rU+sT45#**%Z|>3XrOi=^z<mhv%k?7oHa+^tmu|1Vb?|
zH$`{TvU4a()9&<Kw`Z80&UiQx25&+p0QI}$Vb1U;7<&qs2@-%{f=(_w353sSa<QBV
z`FqZA_&sMvdFMHK7KU@OawJcx4jpETr6?me;u1U?YGCG&=nvudg&$Zsec_Li+c_;a
zP1}!U8)RCX4V13vhxzHd8LfPBI}m27O+gmGAC~8;^*M4TMf(J8IeU`5oP|r4!8c5i
z#ZX(JQ<Nk$&J^Zsb#q|%VaVi&z$i4gdPr}+4w=3=PJjvHhly|ztA~luXf)azxK|Sa
zN3L&Q8$(osfejPEy(y{nyHf%RQIUEok_9XbyZE@7+!5E3l-PjlTwn9?maTy)@1vd3
z2#pGogA3KS2?Gquq55KzS%Od_HN7$mWn?(FPmY`IRCOQZneW#@G4tGW%jv*^RN!Se
za5$GL>X%kmY9bO4X7H*jg+jsu#x%!giO?ikXo>mCasTZp)VygPXcVPWyAB()&41MT
zmQ%Z+1BqYvjl<XfE6VT#iuI7i|EP5$TQvV>2)ot8iYPimF)T4dMWPZICR!meXrjeN
zqqKqso_EYpA3x`ib;b%$Q?G`=_}}Kqtc=Az)tM_$%vfBOoUvkAsoYuPY>D8|x7<0n
za9v6u)92M3I5k0{P$#yaI^NX%>5LU9+Gy&}LpB#n3502w6t^pp<aqlk>8(o^)QGMW
zG+jcgJWQN81(U)tjz-Iy16y>8r{+&F-*riyK*y7(q%Dm}iplBBh%Xg_^*m{c_Q|fQ
z9lbp~_;sC3SGu;(%}2UM7nWZ<RMUPAO(*=N%E=SFbK6nhr9FfEJ+RLc@Tvkm0jtn{
z%kQc%F1|h^pZ1KxXAsH!n`aH^3pA<S+&(<m**g9e-5I2;Npj5!c^KuW#-2xPM;O`!
zc-;}y(BOMr@B!OZKnm71#uTDwo&0Q)2#F?NLuxoWFwGBc29|$eK`qz*AXWgeU@|IQ
z@*cjzsxDi6l>x~Xe@+tf^zM{EC-DvXRMhCuL{W5ntw&B>3z5;L^7tXF%9H8XJ<vfd
zG1~ZZ;ecM4@Yh%PKA7KRJ`xuabQ4^t$^lACl~^;^`IH1brCW(Y<mQT@l3iLZ>v<R^
z!bDd0e5iZ~eND)M3a3OqL~7f`6|~OTiaz8}!4Fls^_c1pLNZ=d*-yc)w7R2=9}W(a
z&f#Ryj2g4aD9CP3DVRg16cbYyf}MyyBvJ}WjV_BZTG4IA7Lal3qODSh4yoDd-~>jC
zD}$=Enj!-;r7m5?%xY5%MMj4M)KvX1mDp@z@~JH76Db49q}EJqNg-Vq(`!=~E1HU{
z*Qw=qGSOvFKp+TT$W{I_$cZbjQ&E+IJcBqLQqh>Mf+l+>kG3?jbmb|dxtdlzRZF8N
zGa4y?uuMiWpen>Ab{t<TaR3q;l15r0tx1y#=2T-OLj|3s3v-mvsn8&F1l6o;E<|*_
zL|-Rmwn*+25^CWLg-M`B>b;*1%wpcm2$k7G()2@H;Ubz+MQKHqgl-b1q;|~C-d^)P
z)+6-<)USoIhW<5>oKR1D+uYh|9veHY<2KXJ;4;sx_?cwZ@zyjaU!qQ4A1IHIT189H
ztfMVt))nZb7&8t_xSnNpF3^e}GBo-T4iYQ%rP@V>^EQj05uU4cIHoC1<a|Qgo4DD*
z;VW8SDNF&IHk`<IAUwb&OM(ksC!D91a~@7i+Bav&qB)OM3)$SyIBU@bSl-S*Yl)iu
z^fqtQ-QUPsXF?nn7G9|so{QyII~AOq+uMXd7~5AnyvLR8y|5v!;8s!JvMs#gMXUS!
zkrLJY6Wnv+&a?bV--sZB=w5_VhWcMBVakdai?XkfvGwksP(g1dmTNKG*-N0T5Z6in
zEDB^4az({Fqnb|a*O_7<Qb~`7D$_{g6ohCL{M%hfqGoAiDbC(2Y5zd<;=%&D%I>ir
z*r(2L#Hv1a&El(1j7L%wA?Z6KO8&XH!Nk{B0DvJ2W0Ec=+Y(YWcjml*PdL;|mDwf_
zmY!$!WY|UigBv|EPP4F~Op-ltfM+;>f8MPiYt@vT!X%T9s_5N_w&`4s$f{)}!zvlD
zI>(o_-bf=>N+<0p1pcH4EAqXH_H2jhl<ynh`xE-9ilM=3_?$>)<hNa!zOwcFg>e!G
z6^6uun_s`5Uls~$=C~OHb?X=liMJY+S6j!2rzfv~J$lnalY)OBhnh)^f@ji@%vpcJ
z^)jbFwLTI$otS9Li@zm0SYu8l+M${{SRD+PMGq6uett(MZl|*v9f1kkKBopWt@Up<
z=kzx^cjjbh!JN-lfw(&GFl8iMAyo%{(Cs{VqWC@+<IyZ&8s-z+U)up(+~0-cQ&vCS
zD2E@DSuG4BvN$ZWC(Y`ZYW#hT<9p?5)(}<~Ooo49dgx1xmZf$@&p~%|bQ_|}<Pbo+
zrV?0Kyl|nQ-QTSvzr=Gm=x^N5^0(W_S$wR1j(#jCv0d3<T^G08!X>y?ZpeOo_KYnq
zo`>Z@FFK1NPXR)huIpGKO+tN3p(}hcUQx=OAo79}$)B0!lKFgX4Jf$CK$k{yeu-oQ
z()usa7XG@ulFFZ{)T9tahOQQBVG|JKy=#d!Dt+i>w~e}Hz`I5-GI<ycLNwXKNCQgm
zg%J^Zw4F_3ee}7{Uo=Lkg))-|(I5>^_6SM^PbGYvCC3s=_5_QzHAJEAS(EJ+eiJJ7
z+$TAL8C}kd@Tzt)Po}RUn^Du_NODi!A}3qUeL__5Zu)6T`{=rPy7uXq@>`)prqVju
zG(v$-ZFQkzC=|$g!a%)xolR$s!<X@jD5>d3A%dw4aRi>ULX&K5q9kwyBCLIql})6y
zupc1~utbxXUPGZkMkWMmfJzbD=p;5O0$f8ksgwp<;B`(aAt>WDAuNm1$Wm$0TM}VF
zv~cA3BvLJ%;nHL7X+}&Xg%fBfzMjJHbb4b?TCp&H$hv@&NO?M_Y*J(+a%@;+(-J?`
zXq{`E=FzvTy(!^-AHNTZ`NE#k4fr-|`W{O(0Ej?$zdYvDvf7AywX8P24+c!4Jn4?}
z`=C3~4>NVvUr)aj<GRRYp%k2+$Vu{Fuu2z|Nxr0UiX7CYi!zX?XlDqb+8gr2`HZW<
zJOE{a7y@ZmGqJ>ILL5RJ&S@~=Ibj4YEjfDClai54Oh86%gVI_QF%gTkB_l7*xGbfG
z*`+5yWSi8bv^Fb0)0|Ghq!`mlr6dI=zu+XqHFq2&AQFtss6J&J<(T<Rgo%<uTi^I@
zv7n51*SR%s2%qC`CLaidLlywd-9#QoS{t}2h(#W5vBrL0_HY#DYL2KXkyOo#6trEM
zE3bzp%vm*zJu8{@OY^u5vQ}epXhj=M<JPl<NB0~ut?-B)Th(YFD)Km3E5vm;;TVgn
zaiOeMtz)|7j7qJUox(z=%WCy7lRbV6pwi)3<oq$xS?L%H3y3SdK(*>wB<~9e3V9FL
z(34muowQ9PIJ`p4LXb``lv$4s5!<O~BZ>c-r8TgN2;6b!f-W;3VdOAi@(}${Vnir(
zOpD4Wg_;rJyLvJr6~)r1(uuotU&_NEkneFohDVrg51sE?wL)TG$0k6;+B`a6UZG|z
zRM5ZLhv!{BIsRW`y+3~)`Tk$&6ZQYPy7Fvw?ZN-+pYh4*e`$Vj=Q^;1fBf;;^!?xX
zadoZn|Jbv8Xy3%oL;p|e|Dk`0f%k?ZGnj8I%-sL0jc3o+9{T^!_{`Y<=#bXw`?ZT%
z>X;z^S67}kV*URVem%(lKjZUAm@JEqH7*K|;3o!T2~!I7CAQ!GWt(+f%Xdlv6A-<g
zUx)t&H6EU-J01>im>MDI+8=c@9;6h*&UFiHiBz?7H@IL+^}-`==4I@+w++}4fO^K{
zHNeldgNSMuFEMq50nALs(|o&AHeTC7yJI@LJZv4F$<RfTVF3P)Wjh$z8R3!0L3!Xh
zeRf@8UkVFj$0y$%jMD6lLSez~u{gr=V|y72P>BT|dXL%c32ST=7H$hNWo4sqTga`t
zjDLB>q72b<U7?cLUg7|-z<B?B4HG6e_W4=`0mZ#$Zo>y<)m#Hlf}XEsap6&vkTjk=
zUz?gMkH}+1z0P()lu(dD?DnUt)pJ`s(M7EswEE|3l!RgXP@zXp@8+dx4^SLodDHjD
zLkdb`2Lb5v*l65pjvWL?G7=3O3^w#+#+x|!u=)|HWIpz|UmFbACcDn-eSrC}@-d^a
z3>yfYmszrrQu683B%i1gaVQYS9x-ih4RD-5v&bX9?HDpC29*R#z$8EjLcU?3zYONM
zn(;U{|7yYX@cC0dGp_&JKm9bj4mi91x7t`;dC>p<jL#hX?+0D<6E?jHn6Ljeeq4DT
z@BgRIS041gKji~!Y^#09wtu>282)KAfaNt{vWsci-bX)CzS|4fFE&Q$W$j?xwOw4E
zU(0BvfTP}OZnK|W{PffM$@VJSc8BEV(qdiDgrenr^M*ZNW~(bJ&noQQo5ouGpwU=e
zV~7U-gA$_~4?_{Na;JiD&#Umy3$`_|u1$<2#<nl4q2<}WEOLxv7uKxvF%RM7bSYxB
z?JyDf5mU}>$E48N-q2s>F{hwS_}3i=h-K(@Db5xT`G)akMi_-TKvxV>apj?DFmO%J
zmC?dGuEXQR@gOxrD_B=;VU1dhI&w^}0#bIxc_#Ng$RkgkV+g^HVgjf_cE?)g=qRKr
zDAEI)heg)w<^i5H!l2sDz$AaRAwjE2f-r1P$Q(%!G?`*!rO>2k5wy)k6XWewxVmm<
ztYQ;m$vSk8i_sU^&<vov%|W<<;QdDdgtVq;&3uY`5sTrw7^I0BF@~=8DD2lc#h#<E
zlc4mt9!5&0pzA}7QOR2#_#tUf`y~cA#|UK9R-6S_*xO?Kgz*q5-YUEDaNIb21o^&B
z+sWHjo3#&jPu^`EH(|c8qvOM0T06}h_WD=IY_hG>ledS*?9->MHe{DdZ0leL{`-|R
z-ye}9H^^-5AMLf8JBSa^9B&<*w3_W@#?3if2XB_y>(di<aCpM@TKlaNKz?$#OxQ(9
ztr$DpMLhe><L$SQvh}*P*E;!?YTa#}9AJ&RP~{do+B!aIZJ+LK9kZj;<D<hi&<ai1
zX|=cawp#nmof;4Tl_Iw0FU^A!)_#l8DYQntZURADulJf9B{XWMb==%OLDIu-+rSPW
zWRC_t1-F6k(EKLQzIFWTGIC)1@SxrNzf*vNOt!PNzx4*1QqJc9;zJ)Vr^n5Gr0;N-
zwNGESPg*CZCr$R|@NkE?+io8J(%NpeH`v}G@_Uz^wwucgE%>NzKmnX-Zy-8s)M>j#
zY(nFK<KxpK?i}y!;XB|0P`U-BcZi>d2h?U@$l>v?h!>eb>|Um^@$PLC@{W;>(7u!7
zE#yc0<hZqcqJu)6Cx^!;T5H)s^UYrCP4i&83AscUB6`<qH!ILdtv156c<t}Dpz2d<
zJoXF_$G>XBa+&&%wP;{$?flZh1_*fQ_jXH+5#rzWTfu%g#P9V}D9Douc{;$LmJhI7
z@jRGl#Z%wnQ&OBVP;6V04vFPz`^ghp+Ux=BGJhzl4NpBp{V`S@M&CL(G2R-YQn8ha
z=24jt$4iEhdkc@m_T6<lR=CGf#~K40mKGn6HE4SbO^Gb3>^aIuq<Dyn1PW3SQu8JT
zD7MT#kK+rtcoR|BVu`KeeRgGG$l@_>wmoyie!l8lm>yKE4q1p_C3HFp+tDJ_T4Y~t
zONb0GNS3iay7eati1#S*KXc}<b5Y5=WPA0;r%%_JZ{b3~wi&ul$B>vHhS9SqhId3+
zI(GQoUFm9Q4LcWJiEsLGp|HB@M9Aoj24f%pD=6}SILT1`ph&hVt?aGp0U&fobmF_`
zYtS4VBs_4Z_n8GZBMUuqnGOXmg=NF`7<%qq=8XkqXcTxxPz#62JAPb)k1P4;=#~v*
zXm<y6%Uf1y?_WGOD(vf5rc(Be79>^(E*w3Ztnn0wk63v^QVrvZS0zsfqWR%bkZdZp
z^~YM{MXkYFX#4|RNbS=yAgg(8c7p1a-3{=`K^!bTC~+V*hv!xo`%s%#Yw}DG3wf4F
z!CFyS5&=4~Z!m5>t;9aA%E(m)33OcZ0*m=Bj#L_D;}I&8l=WT)7#tGQSy{2_XW|sa
zYDI$S^pc<TP;LB!$c<nl1&E?}E1<^nbSOMQ3sF5?jX|m7B~|4(rA7s%>Kvz4slZgF
zV^t?V7fRB{**Br71k`vwp{WG*bai4=Rh79-Rdwb!RaL4tmBw!xbubN7Up!w!;B<rn
zZmhucF~15+gJTcJ!_-kP5%RW)x{QHk`n;`LKDJ8F=dIKLusu2eZ=VK$#OVOBHYpm$
z=`@TL5#tOZ#)^t@1{GsP#yCcX#<Hhu7lS2(f<K&@b-jGf^(HW`H-T@xNo-5hALCk*
zfEd$~6vTMeOJmtuROqsfIl{9QTm~=P0YxizDbP6^x%8gjR}0s>)&UG)(l|0^DIec*
zHOiS;2sjSmNQ#ig!|V7MsezW6hzLrpfxsfNDpG?|szen!Q=YLm6rSEsUvW}<cxYZ{
z^Il|zb*!>I(yVBk%{OIMH+^|~6kW5Gwh&#VQO`qDKiEVV`&-+`XaR^_1H`p0+}gT<
zgS*Dn)fEgLjb0+z>a!n(%BC_KTINq0xv&C<1Y4PFvD7?4<9uQ4gC>uka+#0xiqWFP
zN(^l4J%Lf~)_Xk@#=Ag5IB@s_5}sO#19CJxJBkKog^mU%383Mrl{lb8!@ujf(49IO
z>|H>^Q!8;miH3hyxu<%Qjni0@PxYoiZmcP%I*E`SBk@$P8nQ*zS|{qGE>A*gZ87$m
zTkWtjWyhw1@K(tdCP7qps;*6kAv}r|Nf_0is&CU_B%Wkfav0U2s&ms}B%YMMjJEwW
z(e~3s!%mY8J55l1nxy(PK~mV?dLKX4`nWg6YN)q(cVbuXPVDL3$sN5rxu16@ck}M#
zUf!MD$-7hZ@$Td<-kqX{cc<v!-HH9XruDCV4@-A=^9t1+og62*l>mtIN&%ee5E}U@
z>v?vyva2(zm3+&tRzl<~@~g1Ohm7p!E%(}R0jznWiL!G>lFCo(T7Ba31LdS5kllIE
z{+-tDE~ieeN@@96eYh-9$7J<P3}>QaVmPB*kFs5Iq1}38Y@HnLx3)P}9P>I8^?bxi
z`N$=CkkM}at4Ue1{i#d|&m0uIwjzqdiA1wAN`>PsIiA8Hri$=E_HO&_79Z58VToUm
zi>LACz;~tQhUaIIGa+haSUT3tVFp{#IUS~dj3d!_6-6SNCq-2P8E=d1nRlYAsNzUk
z6pudZl1eFJR3m<EiV;7x>We4sCtC-TwBNN*!F|4>kpc?tK0jom1I*L~v*Y3eZzu2z
z`lNqhY?m+1L4`5+_t7K!MNBajxjeJ+Jf?3(a-Xio)W}Hg^R+@mn#3v|Yc-!Hs~+oh
zpC&6G>$RUIs~=PSA-`62er3qdkYO<)xvfOxc0xdIEAhCUGMHlBOyenbLLQ!me|#_t
z`VafeXa8}I0j;Mt0Gagu<HwbR{qK)YpFP-r{28Cn{+Bv6V*e{swCk%YT1fcyRk~5I
z@fr#-GV*oF2hH{}J0AxG#xBfDi@iQP+(QdPKyZL-2wmezEF;tR@yg!C*GDCv-dMA9
zt7D>NM;UQe*b1ncKWs95fhF*44@{?D?F{gG-{)lUdqIC0uNNH4>iSF@$DAa*m*C`@
zKAI+*WSSaO(Lw>5SraD8j<{9AIt)V{NKrGW_(pioCzwEOr#zKJ)Hc*l@}mGNe|WcO
z5VsM`piGQ!XGo={5w+74J#!CsnlsM-E8FS1SH59g2c9{t1ei4cS680L=KtDrwEugU
z|KI*2$2ZOy&;|C7woXtN-#L8O=59ibw`z#y!DuqV@;t{S5fKjAoT3lL#((8!iutb+
z=B;Cn_g^ckKR($1{u!TH`d{->FjF0q`v1p9LjP+#d-@>%|BTP0AL{5|!Uru+Jape&
z1ZATGoBE%BZXWI`1xN)Yd26TzA(A$o<xT-{7Rb|Omux{*v;`=Qug27GjP5(M^b~Hi
z11V<(7JgLr$a4cXf<mZjeiVt*A0S$Ekq3CNrNzZBqVczhLBIF~2)!+;I=|xHe8j4k
ztn@~OY$FTN+7dgzVamb5S*@fMLbKDV#Y%piE!OM(5@ev$1>s09!tOX5l@U|8oNA26
z<r53e+5fZ5f8~CD#yaMB|M7h7>4W_LGd^?m|7d(Zusf0H19^2!>i^Zm{{Q*f^N0Qa
zpYqY<KMG}Mh%)&T%A>``Cn+PH%}?YZX7P(Nyk%blkCoO-4FC5PV|0|hj65_4S!~>v
zJ_*6bigJ<ow`D-N+fZg5l<{|^$YtMO&4B;%&s_8W+zyO!U{8AlIAQ<)JURbi|Ns19
z{{I=DgnCDh84kAgjMuFb9va|nQr}Ah3Qquv$q{4vzU2kAi(+`-rHZx=_F4x`rd&be
z3wAnQY@3c92tS7MFfP2lN)ofX+eW90U%yTQstCnwA|!ukPv-5Z`CpdzmiP8<rI|e)
zZ=PG0qb?(Lg)lVGjyGKz)fIX@-xv(W<>>Q#`UmFR&>ZQW1Tq*<7Lep&Ait(~Mbp+X
zeHB^_QzD-p_aEaj8j~A=h8jo6-Wvn&jt_T@qmyH{xv3>UMY<yfAWzly$QtCA-8(#Z
z6Dd5HwR8%K7!EY>=fmy5W%h71u)?QtxIByY;tPKDfPZ2aJYOp-<H;;eA!SJL)2Umi
z8kACO##RX@5VN)F>1tWo>t?kIx*Mrm&FS+=v<aUT5!y1arI9T7UKqJot47DN2hr}}
z&N!~C)eZQUecfc&?Bz@HFcJP*jr>}R{CW{B_dN3RDV2QkWJ3{rok=9JQ72O8?zbQ^
zNfqAWxWmyn;7?C|TtV>e2Z+MwT|KtSAK}_QzLmMA^&qi?(DcyS5sHXwIXcRTN&2*+
zNQrjSwHhKR`M@EbuRM4l^3aCDe){6M5qtS#n8Pmgdpz|TASt<$J>~~}qc?C}FVda`
z@dKy>cJej0e2sTwD;0EYV){c?E}r`y`$uD${bQwASiog(ofS8|Vi`)2QO6;7fLK$R
zkO$})nXa@PEw2*R0)^Sn+{A8w>wP8cO(pOvMAfYj93f}KGoINS8(pgidrG6T`&hba
zIkxcaoQ3Xe00}y@k<u+$ZZ%mhT8cl(l8+J{e>@tw9v%td*%N>4MA0~8iz-DWMefSU
z@DOP0m!|Rhw6%BAIxx2P{xv&mr{rQpvWBy!Tz<iR{yDn(RaliZ@So7{OlR;%Igi)T
zwPhakgYunw<yI8GD+9U2D|3-o*@*mJjs0GW{eBVq-FRNv$Qjof<kQtqB#~pIYXl-o
zIzGB|mqb}?<xYwsB3h_h*O<S$p*^d7G^X7{j9Z1Yqso*$!^73zU;dfz{0{>{@Qs>p
zoKHLjnBf0q_1Wsv`1#+;%8w8G|3BlCz5hpV2Vy?Ajn}!S0143CvjG1OItNf_w)Wm_
z{o0m-7A;!}G{E}Z@o;4Ht-u&NfZ#JMd6%x;B^g#<0*wUihZyFdWj^SI<lBS1J);9?
zOw{mPngii_gkEv5kr`Z|aS-7N$Qd1)5<4#Ik4?`6Vl5x=^i7X2UAR}mS6;xb?7@Hq
z=x!Pp5on#jfwj_`a_%36PBbk3s@x(K3dEh#BqNlO2AshVf(*K5V8Uv%RM36`Ys!J&
z#bo%i%&m?(WI0Mqik74=xH5IbV#N<8c!(NICjhp|5M{C!T$6A`(eTr6=o|a9HMl8@
z;+yQ?bZ<{Mzat35=eR=~`koMpELERYm+jc9GK7dy;&V!t8U5riuu_HI_~O)5Us~5A
z8$_I}Go?z;l9fjAPOchj7MzSU9d&zAyBP##=fa}qKnKgd7d<hl%R9lf*5mj~bcG{&
z+*#%Z!3?JbTN(x4GUJz=qNw^o%}?)l*#;<$$_sVgMo6oP*RV#Cgk=`3u9DXtq)%&x
zKe-t~xf+uX20E)tZ`g8_SHXO3jW^PdHj-1pv`T{+TkKg=wE0`KB&=ApWg_LF{Pj&d
z4l&G5XFN2<BXpS`5jT-O;=+eR@eYehA1;2lSN-`#Q&KD~lVPP4PHOs>)zjn(FZ(m7
z$YB~SSSRS%$H15#^v*=c2w4@fR7_hEVv>BtZh{V*g@TheLzT%DjZzi>^;(gr^g6!@
zER1&+*aOiUc=kaIuV@mOn668>)RI+EQp&Cv0bGVkoY>EvWjO(?gq<5>09)UIS_#-o
z*yHf(qDTm@c97#(S4`B7tD}#v=;+`kg>ZeyDPT41B2rgW`h%3R6q$^eIFm?~RwLGE
z(y-P7phX6{Hk1WseiD;9x_Rn(fajI^(FIk6gTw#B@K?uW(Y?|&?GIYzxU`57k~c$@
z#FEpI4sRZFCWgZgMr=7kd_|ifjnn9$0J>?Ne0&}(%jNCT>QJBXhMAquFj_hmf>1KA
zf-+&l{CPa$w25qOJru_qlVvH_BxhPXvepevMBPQ=COXmfLmElshCP`ooS;&eP7%h7
z9@1JYJDR^fO<9_RRM$If`qd18=?#9)Sg1^xU11lY4<ONgHKQi<P@)%j=j6`37*-S&
zI%X0bq3#f=0rON}6H3lqK#5uE$I!jBy4j0T%6P!(8SmTZx<j1gqd}k6j~}xiM7!|2
zKE$Xma|W4#Jxfwqjkbjl|0DrH;T<CiJ8rBNa67Z(;&Tj+pvK6nBCj7`XmB5jaVc66
zMXyYs4NQ;T9m3`Zwq$02A$!IEd&By|-B*Wqqwg|Plv5&vFm%ijNC&Gc{6N9}PLv`)
zov<J|q8NH&>|Zc^_sA;|gd!5#p#Zxb8<sL884U=@8I>rTSe<x!U9CvM7SZKy%!S6m
zbwHtaz?zF4JyDqA(uG1#3@|J(Nf1COZAivS$Z?!jipDOH#D|iYA4yRpP){RrVk0d}
z_8@wyzLGA6ve4iloLUs6Z1^-riPq3ihCYsxP+?cxC7$bjmM+HF51e5z)5$m4l{Fa9
z6QMW)u1;6*u)!aoOVk0GCzvA(_d>$!DS(e?=-W=8BY=U|bs3#8h$Dy*Vsbhb_x>^(
zzz7Z4XUDw)^7|I7i0fSb@bYw!P%FrhnWEk&xSFye2q~g*GqJ5ppy4uTb5nLqa#2uc
zF(<s~J);MTqwESfek#D*!GQai?N9`-UO+su3W~$21CJM6R!_ia#3QHG@aK+Q<uML9
znOjCSUtQRp3*Mz3-P{Pzew-2>H>^WLL14b%*bAb^&Z(D%CJG_w=C0)jo_hnM1O|u+
z3r*KzR<DQNAkg`XOV`Gp4Um6Wo{K#PXaGO?iI9gs6Gm(%`$+7Bi<)Zu^y@NWon=wZ
zIY&sW*J@*yH<I*|f=O%YlndSbYE>qW<1&qhX2`zFh@X7^?QS&YI{!z*ekZ`lx9BhV
zuIK;HpFNA)e?M=mHXhFZ|BO%e`G52MN%P<YV-%lmpR{w&{}Z73wt#^<v^#hQkO#%h
zY9>Jq$ANV{3F!C1B#6<)BnXm@odF6cpRO<DGhoXZ4^gnFIRQ(x)aw~Y#+Bt*9tG)U
zl-G#oQM_)Rw;IpmzT!!(ds={HUC$#IgiEYRX{_vzK<kE83Egt|70}+%TQY0{EZ+x(
zN4ntUo+d0~iS=x2(DmtLhR<n*UAt>}Z3hI0D+f}7%c+kGD=6F?!8*bbthp`@j%|l8
zgy-v^Fq!9kQCvqAfP2`dgzh@Vjv`-6^!tx>eGLuPx&A{xZ20kqMA}<t4oY(R;Xsa~
z2yn!Q)oL~R(Sr}`(Z{x#O`jlOe{?(NCVZGFK4B9i{p)NCzw$ReT&bYl2xk!}52$bO
zdmz?8Q#9Ch^azFa89Oj?+>VWVo|>uyS+Y)w6Mkd8f!PPmrHjD`EOP8jK3q^S5tYeH
zF1mLLIm$oi`4ERK-dbVz(yom>WDiC@gC(p73aAqx4FZssSuv=WHB6{qVZhV`DKs6>
z(Y<tl1<iL*Q^Ertpldv0m$s>4vc+*gC2X|nd){*OGpqTdiyI%3KzX!=u6KiBTw}})
zQGnVOa%)+kkQz29XFxkz`SD+IM4;JW3<Bog_<=R#_Gak2npeQ%8u+jQ^<ljGim*5q
zK__=Q;G!+?5DNlhD1HEUmeVuG18!HvxgsY3XNvrl#S?s~0o&*+s{~R8wg5_zPEY}g
z@b6<#UD2MAE430g3=iRcfkIm(*h(D?g3PCoyR?V*$LE1`vkv3Xt13^Ma)4gIIEV}-
z{D9_-dwQsv&J=K)gL}6nAo_+T8pw}smt2=4>R4$`uRTCh@Nz`2Uk-6znS6ggc3`80
zw4z{&A;RiP9+rTbP%56F(<m5NBB%sz>N+sfVSpp%^?1LsD#aAmI){8Xkmq^wal|>U
z&NfuAiUcBZ9EAgb^Q)Fp(;;Fdujmplw65=RDdf0LRZ)SPOYuF<csZAeM07}>R?`8p
zN<>eFp?BEk8zex>t4HM2HF&X}(Hcq1IfYq<f_N2vgCjFuBaCjJpSM_i3*y020%L4w
znGPR{R~ElucT&0#)-c$2!SaI#NmwflL&YH(q(vl(F#%M>&;b7w$+DAdFEWPJ%;YN)
zEk}HA^6z413VD2fBMW<0=cY5@@nO2uIe4P=IYNM(#Y&(N&T0=@9a$Z4)f3ADSrW)9
zfm6}dUn}zmtyokBzs3c~*r!H^f*<p&YaG8iiQ!2b+Cacwmn<wCec@Xc#t{QhDsbu1
zRx2G-xN!0H3Z|XVQn({{irEv=1o9DIPtaNwL33$wdu$x~h{s=MmQ59Q$HZp;4};De
zjgi?6qq?Bjb0e#<JWPu&m7(H*3dK4*7!S|6*)jf>U=&&i8xisw)Q&a<sbLN;QXaVh
zt+F^ok=n6ig9O$VK>S3?_;iLrF&a$I9pmELV?Vf~K<IqjTMZtnq5+B-3Tkr7;@Ljh
zs)tG)wu@pe;#$`2de}iaBr1KskF|Bnj}WuW_-+t{Z4cK<%fmyC3O_LsmNrA2w4{wr
zY!<Fl7<Y%b!23}}Jd#IXsyy<b%6T9H2$0nAM;QJQ>sCXbMh=W$yYI+z9X$C-ZxgM2
z7;_YOF&=P4-G7@M#KY046B=onzp!8#sLO4H-cPpL|158x9v|aYXSdbd+cDm?c23?d
zvuI-bZEN?W!piiK=qfAMjnfL+Tc)9?aC6qQe2%RWKARGIt=BEsXl()D7DvGt-;})<
ziI|^LhS2Js2a_P!UdCIUQRi|N;tX=zdt0w1wT)~DL0eX>>`8XDnK&~V6H>ICK}SYY
zwh#CBTPG*Yo&5HMU}=rg`0*sO`h2t*?TV4NoJUkf3wKWUk1%3WeghR$TKnQmdXi5@
zF8+*$MyXuRp)I4C|7so|PU=Mglh(u-m!9Mjkb^s;c{+8=nKWfhH?nLIEnCe2No!by
zFHdr+&PJOx=R&fUvxv!R(Z5;;s;~Cm7~9R(o^gQY>*=zN!>3L?jW<uSsmMl})wqzt
z<t$P%8h5aJ+*I8~mi}CDy+3ZgX=B{sbaHsH)HZ6|dXh~{HqwkXYJ@Ilk&@Mc2dR|m
zO@ES&G6N$gv#fdRhh;Ra)(Tx#u_JzV5j`vjx511bfsOI9j<nwqXjL}t_gs%#FX64p
z!otFmWuShA7ZG7RYI*Az*K(r@Nq8C*hBV}a$QwUNLs=c%@XK`4bRxLqC8ku21PV@E
zg<l&Atm4By)M~Yl;ZOXBPRr!6nYwD^mqH7u4bfN2cQy(Ov5pX)n%n<eD2rDymH%J)
zXzNY03OY>!x+%JBA%qsN+;|LQipsX|+Zev%*OW<<4N;97ao_A%x|SgKT-dtZZiH8q
zdl;%x#3fr+J2#VEf@*99H;4?QS@MHSP|411#|TP3>HNOY8w*SCs#F>&bMN?6q=Me;
zUjR;i!Yg1z9vvr^gk6NbzY==q?*qdc49j9)7gR6-DUDFi1FB(v;{~&}iSwPh(DbXM
zrUMapEA7*zG(RhK<^I;70PCXK(S@Vc2|rb(`iN$2ZL`GBDu=K$K`Su9cz#-nIR-a-
z!vQ0IAv!fLjyxAOx|X^cT@Ft)IdAxN9G+g%L?wfIGky^tgty`RI>8umon3+OuD=Zf
z$N)ppCurDQ$q(#uJ<`nRA_)`Vh2aDk<hVSE|G%*bd%!=?roe?=eMf9W<)9FOXqCHB
z7(;kWH@1>z@IF6;m)@)Jz5`o246e1I5mpx)7&HpBio@+%`^M>9c&=mrLE~_p0Y<qA
ziZp0pfslMSIHHC2N#mnd@oT!Jq2A-O6b~cm47}rdTy}Q(iwLJ`4M#972-$RG@GBss
zfPeb{(tLmG$ar&nczV<>D}pLIMaW8MFOFByX54SiP-|pVEG!JXv4;H!C!jwb%9kHG
zb<i11v>sssf@dMPp~b^H&+dG_fw8`?MIq*INa*s0Fp<>+S|=fy{4jt&HNhihl8I$*
z0|nEaaxCl(JovJF9ghrJD}!0!qCo=+Pw`85!T>G9)#`?9S1|nVm>;Nl7LV~O4|n)^
zlnAh^gkeRpP)x}`#>hZU0Oujw!dr*H_0);6&s%q{EMs_(Kr(pIyF;9Gfr!U1T934P
z!iueH4NUa5VGb<6gXEL-GqWyjntdDGBmR}`TM`J5ay>HA!2@_J6v}D<y6ylL6T)oB
zLL^jjjRNA=q2IGnz+CtLn#(=Q9O7NVMa_0H>zL&K=f@x8@Be;W`SHR3<Dc?L-2WdP
zH@Eh2)0%SOujQp&mK$<>2v?5z7wT!HIs<;UE}S5$dQUMVa#M3L?BDoxZYoMaK4RXt
zLr-Ie#twWxc(d0`;QZg_3BC~@$E+XP2LGl-_s|@dITiMAD=;2Ca`X_iX$A#x4|&Lq
z6pV)k9$)P@Bj{>1#hq6+27DL{3^HTAekJh4sMgTPx9_R6zZ!Y=CCX7n*Q<C_Ce^J1
z8mBoTIBfG!GZFt5T5kKObpSg8JsR@)XJA+z3JRl;mwFYEM*i#YKpz4_vvX0$e++u&
z&x5@rGx5<vO5WwrAnOvnx>?4mbVXW3ZLh$VB3G$acve0%1G*;1g@1#x@OBApm90S!
zH3962D)&j+1vTKERUiXuhvOlde4#tiy%eej7v^YWIm|M>!3`Nu%X>4zZQ_y&ni%(K
zKXQHAyw(c3H+y~L938iQ!6OeGKkXx$XBY&?Nt-SCV?I8(#9$5M7SB@HfQcp%=;4j?
z`ibA%rAd&T=5Ff%H>niV+`v<Xv{{1rl*wMGfg${oaeGPr#FiT^cCGVqpKYep_4@P;
zy*og~B#hw8?~5f~OxQ?4jy}YUE~xG)h}-SEp&gptOVEFei!o@iN&MtTM6&4Z>6_-<
zwFwU4jb=(cyRE&wyP_VLf7}@O_B#dt-qyc<HQ>uX=c$AOIxoo|yfQKS@fX_+>)Ad$
z*loQrv|l*{<Hj_FRx}{JD=+vHEBn0P>15Pk?6qFM+1|ddipCDcfyk-r^Z=dw&s`me
zW?$*sDb>Ix5bqDR_L}YOI}cLKNSkeV5Ip~U6Uc)>8tRk1J0l+RhcZdrLRY#Y`fEPq
zQ}DkR`q3RL=-|V6!v!tr(ssvbOxoVse%mw-U+=YkX&s(U%P_tgpE_N)Ge(nqd}4%q
zb-7r8$iK7(?g;bn<cZtHh-I5w@z;2aGfco3XNXVpQy#811Gf+Ro&rCy$r4j;+6u9E
zIPLn7Dx%xKm>uIy^JM$zl>DZRJv<+Vc8n~qGa4Io8V4-}ErFY$`RIiJP4gj_d(up(
z_RV9!#&1(42^p(Mq>>aFpktc9)9}n3k2X9Dt?vNZ>T(4Nl%Ih(D3N|Qxi1bpo&_}O
z#Gads(djsv;0S*pmq0aHLZ$Z`fP?N~U;0_&fA{csyJ@t3Y2R%c5GT<}qfgcj2KOG4
zQs3*X?SJBd*TIf)@)q`A(@NE}6N+&Erj8`$+W&X$%ju(kP2B&luCA`d<3Bw6@xlM^
zpYqAJ|KDl-l56zO^QZOt%cnTmBM;r~cwq5>U^t;+G}*Mrp>0fu`wsBM{s)cI@Hkgq
zKG=>hBwI#&eVgowDB@)gkDfhiV3O&*xZFE8eVXb}Gx?5O7DY^6E64^CHOv9M&c;(f
zR>o6Z5pU72pdo09u0H6cx=py=A@O7ti!a2goMKa&*mhlhjW~2Yi~T;fJD&$P{OZnR
zAQ)A1`MSc-`svJ(V?HMXFo*rjR)2fC%H<%paTQ+d2mzhno}*ExkYws+LR=mI5bRca
zuHlDYgN;Hm_Y1dqB2S+~vu}5jiw@t=NN1DX(CH;e8G1m*(b+*ctcoqk@9Jfl;5a_q
ziuih#ZacAn=>2>|j_z{LQBSNX41JZH?Wre;&<}kPrNb8%WkdIJgW1FJU;~y94_C+Q
z7tgED*J|t#yGS^E#Zv;HZCSl5M9S;|?&Vu}YL6GU<TDBnw1*~ii{;QWWE^<p5(Dc7
zs$6ww4hxs(!af&|&Wn9+w9PJTDD!lc-<gO5b#A4`hrPJyyeYCWQZMcUfOcpGv%1&J
zGOss8BbM11vIb=L=MAB`L8qq9<OT0+^@^Cx(i}h+{*s)ozNC>*kzQmo288GVnm4Ls
z7vJqUnj1nnbv7owr6YmzJ)f2TCw}Hy{{ybQ^Y}h@egC(zwz~3T!vA06Vg3J8KH2O4
z3EzO>W!CXQ{`<cK=xk5vM4TwPZ9}VPKD;($x-YCcFl*2kxyI1M3vdC#lh9m)FB%I=
zK{RPYozp7AZVrJq9{i=0^Z<D9x^>Xz=HXRti$E~T41+PT6|^nKr5%xx!GaFN*J44G
zbQ!zgTwoqI4A?iXF%UMVxT{^&*R+zN!C^}YLbahO9R_d!AZ=(mX5Zp(jQBft%&2|g
z&ia;nK>5Y8c)@<luxTAUnLy(Zz$XmwWnpPZ%zL$5p*IA=1qeoF9n#v(T^!J+MUa8q
zEAR(iqk$FBqj}r^HyUy9XDd9=E4so`=1qWBmd1I=6*=+3eq?$+Av8VD<Okh058CRu
ziC1A5k(@`N;n%+S<N?$q^aeur&yu*n9V6rA+c<jS!gWnF+NU7^m5HZP;Zq)R8)<v6
zdkbv3B1c?Sv>)&|pEJCxuG&%0^l{k-#SN4^T>9<d$V8_BjwBt}-?t(oN3bLu$JqDL
zL7}-B%5;SUi!fQLNpXEiMjfWtjW_}jx%8GFzsXW^3JI?aIA~O1txj(FgH8hQOA;OT
zz!T0!%s9t44fH;RocBAnBfVG3O8qgtR*kg)%hOoq<m5JEIi*e_C0?&`EACmt%=&1i
zNBt*EY!TI_W6$QbWHs>;hLE%ljPW|1x6vK|lyNYFk4i(1SFIf}0y+cBbjG7>06Hu+
zhL+$)9&JgwNWjan&1s6TRPk!b!-u!gs(s!Q=><}tg|y3q*XY6E%TWi70w0TX&D0%}
zY`l&Pc8xvP`<z$b$n^t+F-C|Wmox<mJC;E=4>Ha{!2|O6DnKG`ShK;PP3P!4BLh5F
z&yQ;h4=Vp(_?b)pmv7^_1MrD)z$cym{kXE4^#8H;p#T3FpKSe~Kdh3zZMJeZ07=-`
z5swO=pxi2uqad!Z#AKxwAqtQ06foshUt${fU>mK1d>u*j!c4>LcFS=EMI3~XmrXiH
z;>L<SE9hKc0St8TSky(!T}`4}7WU}e$i+Br?rptq?o3OIKR%z07ASBZw20HS7&VHa
zseBi73|upp9g{03Z^D{WV)8^dL4#D$kqDSP+2;7=jQGtJfeC;<boaiw3EMS{@uvA&
zjQW$WM4j={HA>VsX-G8<CQh;BN0_;+6Pq<4^oz4JhssJl0Vw^5GjZ!iuCgT8+(B1d
z#nA%I(>15<0*M0CoR_K!$sia#%S5NAETh;g-~fdrF~s3m+$aFEHq?^<AP_Pnff3?#
zk6yg6=2TIh?#i;dlWTgBU<Kq}m~zE|lzLUey`N|g6NYx*Q@$^GBV?UaTU>ubUh*W3
zk=!vd&yTq0%vIm@R!XgXfqT=FjgyXzCwd!8h}pZVPV=4rL9>8&)7}A2SpT2>*od$H
zYimEQJgonJ#wUKXA8P4sd^>o6%RY~zMCT>+bVuB}pIg$PPxCOcjJHxSKF~5kTI^+?
z8>%|u*H_XtFK#VtbAV4<V3KfQ$>U{^utR?VAQ<V@jW|2md3Sic!^Ff>XNVDC`h^=l
znY5uFL8@Hx{tNT4C21hRQWtw<k}r8a^bw7KmGy-2OE{IBv779T73`UQ(8QnRifCv^
z?vnV5S2wYo%E`co(!ZF4v6423psi!1YLpCD$aE2wvH)tZ)t6d7@B(Q$K%YdgptZjI
zSOG)VDM^}*8|C|nXZO*8u<6jV4JL3gvX&6CJ;nR{t$Hbi1a$c!nW#w%ttQBv;5bv~
zwe+)^>=mM!Jhek#v}1j-%*y;Yt|Fm%69ti1o(-!+@n<PwU#>IiGJHlwZYp4goH<3l
zBA&ajAWri58KW`M23*V3th(P}$YvjhNCbMjR{lHV12Zzv(kc~BX|)a)4&qVeb$e0x
zN_^l&C&0uWk*|ZIouc)M?rL}9^uQs$-~MHrkxX^)5tw*xW%m2%SO*V^BXUQMc`gI-
z-w-u&2W4sNpmoyP+H3u*dAt#!g0$gyAsJ2~KFqc0a;s*Hl9Ur7he+YM63RL;9FWF=
zzs23biFh3<3-b2b#^LFSLH<;Cn(v$K^f(#%{FdSsZ9{wz;N{0DLN`8;v5Al4D}V&z
zavyoc>zi3#Ac97;?a3Jgh;xVajH5bpP|r7}bwRTbXH+eHKu5%VqKpvx6D9>8*^@?f
zY)nVTbM{caoodvE9ryod?_C?)wvmP5=d1lI*!0;{N@Yhk%XZvkU)OO`pLLuZU)t`r
zJ$fjKvbm8&m84?3-JIY4&J7?)f)wRA+3s$%+gKuj!C){L41l>P?qpsr$l0=%jQA>x
zOR7n>%S;+pZ5T>O1xUE7Rku}99vC6aNp?X>KgPIhCF+apNfqGCno-2kdZ(G7UQaQ4
zb}1r=h9F4yp-x#5)FM%)wCGGd>Oo51s5EPJ6m{nj^6I^I)67pKD_sgf+)HAk8NG_x
z`%z8i&ilgYqXzeG`v0Bwe~Z|ktY84T?EJUa%i4c*o6XPXzn|n&eE!QRT1$3sQb3nT
zW#TqZzew)<*JAe8A%~zj`NYWyO|E_MH@i6bi_JkRdAr6|Y&#TN&E3+;*>eCXf=m%S
z{W1k^%hlk-<l+Yk&gTs07^3fzjMSC6Dh0x$2zygEa-s#r2S#I4v^Pb&%|RHv^=23w
z7tI0J*?^Cumnc|bIFh6F{^?8fD>~ReuWfE_)}4O;`+a<P*6$Nh5g&3z<c|4l6d$AO
zp^heyviCnbKRr5mdGzA1{qGKs-yEJ|O5ZPU@~`o^rK}>ynLnY>eaa}(xpqU0!xyP&
zjEk8mq~77SK*uANpqb?8h*mf6B*w7@Hg^39IXa^4|K$u#WVB}`hH4>e74)5?stQ)B
z$pU&F9Q4nQjt@`Jf*-Vs+PgXk(0AHhu-|`qa&Z8(O*lm)HswQ4a!q?Tb4(fV#TW3R
zL6Mns1-+fQsTWpg)^m=!W;;}>0HnM#+;G3hIoc*O^yKt#|KK}}K~_%^VwaXvhdX%Y
z><l~%#>wFET!&BI7onFRpivAxcX)*(11ooF3pL^*I>2RoFi<KnsVP8cX@+GPy?bXt
z4Gnwn+hU5#q#CXtj!ru5{3a7isWjkgR3Ao}pC`7<N*Qt{m<_fB6KHz<QX`^Ns|*UF
zd1QCcf`hyz2qp%SJ-c$|?2nK&`%deB&TpkW6~vPDztd@F@;`Jy1NfZ(`ICH#*Z-X3
zQKeK6Wwmg|C8x-gDGp`Ibbw|A&I9402jueb01t$t2ORB&PM0wiWkf3+)}v`k@-HX;
zawyot5oj;rx=k^7BiJ9nzZfa-bpH)3fjPOC?=Bu*yuiifuzz-Zc=*Oi;?fzRWPh{}
z>iFo@(Rn6}D?Q66o3Ks505%7shW(uz#`KN`fNVCeU2-_!m^+t~U;x_<a;K(%yK|R<
za@8oxk=$y5Fs}0<RK5i+-&lX|SX-A26>_$pFQQ#hmOH<3gg6C2S)c+>&E>0vq#rV>
z@)QFH@wdI?8LVdX0{<rN3f4edcA`>1B8f+Yc>O>T(kU1bdXRX)uV|`z?Y{Lu`6D09
z1%-JqVk8Z)4RmuN^$mljdET7Cop?8KQcHm$`_q~`h=K{GSf!u-%$Y?pII{>JQQ#%0
z-{)G1OAM%PsJP*%)515%(K1}j=x!9<Vn=wlGt(y1Nhm2+$SD4lq{>=^m#id^-z=ie
zO&eODJNi3FTe>Y`Al^K{Koz5RF5Mha+6jrMj*e6wEH_h}FDkb9wZ418J7?fn9c(<`
zjhG3KYBvVT@VzkY3A3gmQ}yGZPuTaN(@gm@v~zd@AmSv-B6J@p6G<`ynNpjXn9)$9
zKkH*T3m_U=9xw}#WZV!4mF?q`R1CXiGpOK2>EvURPI3fO{#A>qyu@y3a}0beT~o*+
zNwmF1HB41=MQ`FI)`KMr%x6Qw)jxN;|M!P)VLnwo0a~X2ZFh3#Kb_`h{qK`}O8kG0
z4*qg@TJHCwij?~M@M$6W0Mp^YzQg=OIY%N~Dm^zMmkWvsx-kl_XOt)a6cl#mAXnRo
zKlL#-!(W31IdTvTy3b;l7lug*H~8upPX}(D8NP@F9#_ZmGYl@^k8h!Qf<`H7rCIVZ
z35G)qt03`tF(nEeNl3H!$Ei`^U0esvHV_=`p3@LqomRyFK@P?gH<MDH7{~Rn#Lv)a
z0F#$!4^)bnTF2}V`Zp2l3TS{SMC`7>c$*;(zS!no@{{o<V+z43=bOt%<O!{7s-*LX
zzhSOT6B-|$)2oeVM5d>@9sOJgmb|eW%t>3rV18?9myJi0=VT~A%}WtHKc|Nl_=2=*
z0vDiK79f91U8ETOk_#0H{zWe17^FhE4mlhG&e?x+gbCPS84lwGIsjqJF6FN~lN=@(
zxn~xH<UKWUDY2S2jjWEv>y+RkMc|Euj`T8>6*E=x8>dP443Z>c?B9?^i6zvt)RhrE
zd(VH;w_D`A&Zn6U=7svz`4i)Sm$40}_9so)%Q_eOdz5XDPwgmy%(cgnH=GA%nFkKu
zh*MPN8M=xcsTcv2{0WJ6>BS^LLQKX>Apvl|$TY+>Qxs(2ItVG}5Tz=EW)Rd_phkhG
zCje_CSO7$58No^8vJce}L?@mK&^F;rcr@7o?(1;m&o~b(xw}!aVLAoo$Zo&|9PJxq
z3@CXFHx>n1wqs*d%;zo?gw`o<iNvl!kwE!qYM5mW#e(74Ro5Zj^j=q;XYyTI@|5TU
zk3k1s`<Z-*;C(H54^-)c%GXbAocn#h1JC>QdUBn1@>-6q(h+0$T9O%n#xpm2ZBimF
z9QN|Jmlo4vQ<mOAG#N8zZTYNOON)V2*V5J!$rW%p&UU(_TQU2FXU$9f=+&xRNge(W
z|8H>s`Oy5YomMYv|GBl@`>g+clFw5AZ)I&<!T&ocx+JsfZ1v!<bR4*9lGf6)zbz}F
zb~)vxw03Ko>1k)VOE2Xnm$CM+7cO)r$P|xKu*I8JUe>ia?X?@J8e*wX*s9nxnl)gN
zFd?oLxeXe5=gBlF4dRP5jGW`CNK%YzMrk)WDmVok#}g}9WA_KaJ5N+{s0<Q%$Pv)Y
zxZ#%035^=M7h*9KO@eE~AEUn9WW-o@%YCVpDUr;OmpEw-PRTRHTu}^@+sqQg%fv$l
zxAE+9*q4Q(o}ypcw_71nB|SXa`Q#kEQ=O{j;eBy(ad!CJ^k^z@@y3mcd?mu8qC<UQ
zY=9tp=<8#6SHqt@Vc@iT_?|wp;*9Zy_q@%zVYtKCz^YD>9*{=xB=PuQPj_sZCWH9%
zawW0yLMIoEAd?NZur=}mf0%P&*A_#m7sv!P1g3mR>RBb^iwq<lagz=>;07_)(tb9>
zt00KP=_PSANi`uAQWm!vyDH*L>2*m+0MpMU#V8Fi(<S04PIzePK*q-=^$t-arK$);
z!cyoAFO48jlu1?MN(rApBcb=}!Ve`7gvVkeQaK350fvR3T!-T%-vJqYxGLroNn~}T
zj98m-UO{cHY34?uX9UD0rCJXF&IX}7<MtFYSyJ4yHvX<9jF)929Rb25J@y@mMZoHY
zTv0q_G>DIju_QXDm<0o{{CzQd%j2)OMO>_yC+Ibc5Wob+Sp{H;e&UY&Lf%hnI%pwV
zQ5&m8sx<@IwY4d1iM^QNHXBI~*^2r7x@mx2*0q$;xxG&-b}4aNLrjYBR3l-=os}u=
z&tR*;-jy@tOfQO~ufOJnFvDA>*f%{8$@S3rT1H;XQ#0$7xh}{IB5}Lg3XzY6v2=w<
zEeqBt9QVI8Waa&{rxM!d;X}OwaAcm`62OUM|F}zl%B7@}L=Pz)3z`ubDU>j(txNY!
zfV(%uD_Y0Lj8!1{Vo#EU-ORmNBmomSBnQD!(O0>Sk!<NBFEC8`sa3QopXuNFQF}qw
z@bHi%gld&wq`W#T>qH_XR?!_$AGNF`NqTo8&#LQyERD9+VEJ;Oc!~>tqq$ebi>hnd
z7Rdi93qYk6ASLoFwwf&SxvPoPt|s+M#6C$|7XF6oO<{RWio5_Wk-!AsDub&CVWpYe
zk0e%dcvPgS=LN4024xRVWRbNN`I-%{M$c7TwMuFUMx#O&J;T1CEzH63{@Iz{X0EnW
z;}NLv2g{*RZl$IU=T~aA46mf{D=1Jy33l~J!Oe<oVyBtJcms)~%Ik+XNz*$xOKdBx
zL8o+Qkr_2BOpMsss>>ESS^pAbzA3<k`>CH1>p$YElrNC8A?o*NHw!f0D`)MMxH+#@
z{IR+DS)Q3!nhJSo{eg3V*G^+D)Pzu$^}{+5mZ?3TdLn3!Sa|}Z4?zCN6CvU8brren
zGINxdidsfj7*Y@lc#~-|8qrU-A%G&Vv`JWtlpdCPqcE|=ic8;Z7`2vPMPv?!KU?Vh
z(LQ&&|H)^1ipuVQ@RnzLd#lL)r`gKc|MYs>t<U#ApW^f77kD4@IJ#P2M`PdUb~+$u
zPv`%^p3-^nfB(M+|IgWTMggp^9&GoV2kI8+|NhQp-<vt+^uzjt^%3kNKTq~Q`sZ%`
zAFy)rUa67^;4=TuZaX{wx0;{r|31y9#Q)>ygmYk(`+FFrO7BV8pdPo%bX%IW6IL9B
zmcjaalCZ*j|9g_(A!DGOWbl1#rt@{whTZ`+@Es>;_lB4+X>hCaJK(LfW2SLry$G|;
z>k~G2CP!-xHX#Hkw?p(rj5#lZJG-Uxwx}UF95@9eJO#ppbb-LRofSfcdkacSI+1gS
zWa~9EY<^~})T`SDZEr4R_RL2kd8CPSVj)jL5piNQb9K{wD;;i)$ufzcFnQRLp9eY0
zkrj>qWz)d<s1*^hg9K&ng?=!?xZTiWiXyCYWMJ@YHgL>$Q#EAtN^)MA*7=kmCQ?`%
zq179LGLD9nA{axRH%s;ex&v8P0V;W^l33?r$m8}bGGd$)vC>_jB8ByFyW_EaX;FPH
zA`r5Sj|p*-;Nz6?O5l7IWn;`6K&hHRR6E$vBaaLqj(3BZv|`B}K2<&Tq#!0hCpg6j
zWQP{mF2TVvs0`SjW$0pzi>{vt7`8@;Ik!3eSe~=nkYoQ*o0Pl7|CPK>728<4{^#t!
zx}ElC{r{7EN|$W0!3rwdK(RUWb5<5y5U^1U5<-q&>Nt-nGcx=3j~3#HHoQXrFOuA_
zY>&tdakRi729*7QYU84XaRD%AL@Jdrzt$RxwB^+?57+N&{P{U^B$7(tizZ1>9?wLi
ztnvY*d=lfDhC#<psW3`^ik|#w^u&1qh=GLEm_BiSe(<O0=LbK}9yD~tKIXkW?Dre+
z4Ua?c+m~K_PXSk9mvnRQ*EIU?(MtdnjaoD1`%eUz1#zF8@4b<xg7K_oQsU>-bu#t8
zZoFH$;}?nBKRM4k(&&<oSL^gzDyYC-Wn%c4euUFVrU+s@{{W)c$Uyf03G{pEeOWJ=
z(fUQ5wZBfyiB)Grj(&R;QHI6#BBI-6#tI!HT$m)o#l#JDKnYSxIX@d_)=0&9<^f3s
ziy3Any{=I@>%V~a_0-6wrb*RN_-9M(`~BQ${r`29=ugY@e{Hv#+5DfN0DNBmKgFkb
z|Nr0R(VzbNc-fBs*HCl<=h%;8BSKM>3Q6?qq<@9pS1#Fj*Y(s>-fPB!z(t%#zfP|D
zl#NNx+4t*NcxI$afQ^q}?&Ix8x~w;u>ZX4U)z<{=@nSZ#B0cl2HQdx<qMmL%(|9_3
z@3Lo+Dj8e^EPQJ?E>!j=0RGpI9`o~h@*-848qyfmELfz=qcOD<N+9Y!)N&A&jgl&Y
zi`$<OwRz~h%M~}Uf5P?F)5N<m8&7pNg@YAK#6^fv&tgN6bCg=MAwh^&K_W*8)wn@`
ze3L(GOGo(F+Gl4pU{qSX5=4HT2r6kVU?u~o&}6!5P3l1FIW+c?l`z+nr_>X!YAp8o
zatf@{Tnbi5vvck^CYMp^o4rqKsz0gHW!<sO^9=cHR4XJw63Aa`1v&EOdD}wejPAOG
zh9!iHVKecs)2YH4w^!Q9(3=MDyk-4c!nn)XR$*5xopOCFBB-UkP<6xFc>*kUX$g26
zmU?NZHnWK9a|Fa?%gP~Y(Zoe4+xVU_vPoZrL~*V^r7U}AjI1Jl?_Ll?h6nW?s=jkW
ztd(EwSpKMjToT$S=9mm0zw^S#tI!a)lPzDZy^?dw|Ng*$aCf`^zq&{LztiltwsQJ^
z`*Z%^Px5&zAvxZ-J|4I^-+AslIm>WWW_m3203Bt_a!;V%iFfV12*N2I-ko`q@y0#{
zc~V6lP&AA<o<~m}Kfb=c-T-DmnZF!Ho5Sg1(;F=w|8F$$+&Bmy&)qpp3iv~yH}D!E
z+MJKZ((VrwK4Wp?PkcALb>iz_4*Pv)0@`^4b`{Yu^ao@e<+$RxgJ#(TRHJU99X-Je
zx?bq>eH>n}?E_ceMt-Ex1#E|Y>_wgz-fTicoAZc~e&>7FBbW;qcLUR7{dpAlPg~8+
z7XGi<+idUd>^uy;`BV6>^$_LUQ{9vM{j949c(i|e^IiYDzLre<3->T5cq(V4+cowu
z^Q&3)P1o8ZC{CL0p7jkbv-UR=N=s?()Bvs1AczamS`Djy2(U8Xk3>>AcrxwBw;Uul
z%64CH<78;*^$Nd03AIGj=-0+GdApfZuG;`cg#hu7R7@25Lg46WVG^)lrBefN$Btmt
zbT@FEmvjP)ly?D3PzN;El%P*7-VJ@iBu|TS^r_FK=u-^4r&4qo`gE7wr^^j*RM2cw
z{<iS%a5|Uf4TT5`rDw~U$?}ox39wj_5Y76&RrVg*uB9;|gXCs%Fr747fg4(?e`>F(
zyMeZ`Rc0C0l*X2f9W<uFOD)vclO`>DpYlHFs+t(NJwc_J-8AYiWtEC7(r`lJe$6S^
zS7Css>5fuQsWi_y0AieIC!RLK9#8XRN>y$aRJQUCIkTJ8UTr$)yAqxjdj<W;qh#)@
zsy3^+wQ92_855o;7+ygk@&^+Phh8FpY@@5>0PX-%M~10g6B?lxy=2bdR;+JZGAE0d
z3u8VSQ{eF<;|C~7uPB5)>S5I528VK2{?l~k35psFlUO~W`H}PD=*4TPkABpkB9Xz0
zvIQD(2vD+sV*4qI8akirz*+!Y>PJ9cs0UPj3$GAxLxRO20{A-#%}@4KE>}_Y1+h)X
z`9T74sxWObcBEgDdDaXstH;ng3Y;1U01TgtL(y=e00T$C7^)^5qD!FS+NS{O`txAE
zn7Fa0@!d4Y``941h__Z&vhfXKGO|FixXR#)d{c0#nnh?Xmzr3!p%xje@;*Vjg3Q%b
zb@^h^Z!cd8zqKNKOZfsx&B&yrw9FZ-D05e4X(F}+Xp<iz?F@k<vLv;zXU3xP#Qj-$
zc3PN*=X6D8F%GcRvZf#u@{S0N($P_c1aOLt<lXzV6t>Ga$-p$xd6L>o_-aY*C0zC)
zZ7;38oC6I2X<n>`1WB;;K&RBeEE{W>Sw8;R2;*Qd?#FE2JT}$B$0CQYEY8Zk)YH`#
z!XhC|P0Q@1AP}j}i!8Y7EE9#jbbFK~o>uIta=@}FusRa0J0bBY<^ql)kBLQQ4MNX-
zYqXh_K_7{WHD~IlOF6T+Df=Waw=zn#HT3DF+N`^{u`9CajciucTspxJ#Kto@!Qqul
z=9yL3DHp~mU@5g^`L43KUa9cUY79%2e^d2G#h=?TW>~2(GN;uN6(!Rtqg`XulO}$i
zSIU`!w!@$k-*JmGS?PcvVGdQVWb>Qe8CkcAOGj#=PXtm#3k8{F)Z$ZhJTHf~=3x*A
zwYntgy7Xoq=Aw_ZWr;%tD8ONXI|c&Nb|@MGndD>4>R%WBJ9omK40AVhr<gc_5^t%H
z(|`rks;LmM$yhROZr_dLP)_y6{tZ)I(?lJ{{=Ciw$qj!^75?%|Hd&DhIQ5l8lH%x=
zZxr{Y^Z2&3f;!wy>ZrT1Y@L!S?yS6#Oege>yHP`Rp2Qi?^TOu%ma=~bM5U%3-y(GN
zZEG>Q88##a$T6YoV2urxHN}xj81m)F+yilVWjCS(9<*(BIS`{tLKo%O>yqTdQszoc
zcU(|1-PV(=jOPqdAR%CoB2A7x6^v`iy+U1I8?Tw56JE8nXJgt#*Av(HnjunCI#5Al
zYPf6-+88NqylZRBJkB#hA6Zp_^7TDg-S<*`G+IqAT~_N_p3^g?*dN+6)i`vlf|hSl
zL9n7t1(BBFwY}lhXjH`8%SDmi%?qbLoEx_nX{Mj0xxV~V?;JhIXlfJfUA!H|-tyTM
z`(!wb9vN)oaoxoI&7a%~0AeUrus}H0Hyyk(PR<5#(OXN71sOh`28xp<)*U(Td^ZOX
z1R7g487G4pU7s>Cgt)w7>@)@l4<+pcwepzZsQyz10CyH|aMUz9(*z=TF6NWKzG1g0
zq&q<oAX52tZ4z8Mv-+k<()>wYDQl-*JNgi}NRL^vr)pSv-%tT9b0FDGh%R1n?!bJ}
zfOGR^$$^j*k_}D81{<kLi3YpcF{DKRETwB&v(8-?ttbsk6o-T{6aWkoW^`{Q-n#Dv
zAuacaUGrjZ%?7`C?~o#{DBm=ZXq2=2l{^+IklF_hM&Sx&k(sAdg@oob0I?H#LsrF=
z97`mUNW6wa{;^76(RfKtmz3~Al|wmQV@et<;El%^+A$bQ<$-tQz9V6ay4*3|dr;;W
zEu>k(xf6tl=_^QF+Qc2@l}RY^laS&U5!xi0DdVoH40{W2^dZ8o@;a{AYvpy^jIC+A
zHmRZ@P&DCH<pKaUu30SV#B!;KFd8Yzm|_2{tjn=~UO6e6q#tEwR-BGSTF~+xj@E(_
zKABHk%p~||j)4K=WKAgL%LEpc)f1eSvqyMAICL@2=LGiE?DMXtDc%`kjvA#K_%Vfa
zP*txzog<MoBWV5Fqp5@eDoC5~B_RxAqw3AjYKx{ZC!<osvYDXu*g#UP)Me)=sRJZF
zi?OI1%MKm$t8I>;miwS3tG{`inLmolA8o3j`N@;?l3#fhOK4ZX4??7sCPzXjebSen
z9ZS1lPFmxu<f~@Zc4~k)o_B#*pLpY#mL9Py6P0+nz<vAd60P18=hvk6(<Me%NP?6f
zL1i{0_*7NM$TU>Vnr={qora#izyQszGY=v>q$67aoZ1wF9cPE^J^a~QI^QDjs-u+#
z%s8QB&@8VdGdWI!$7H}pQL*$5K3N;!%-`f0sMi?+VO?v8YTW(R*8nZigsyu@r80vg
zE^V$JNhdY!QyYpEaLH)vOPDBqA-$xu+C=1b5s4frT!7PZWLZn*B}$4mSz(jiO%y8t
z34QcNX!)6b=7MqA4Zs&U0e(;WDx^p$w-_@uzY|@;<7#~tlghiTGZlHBrmo3#)M$Yj
zL<zTJwbV_Unt(PQ$xo#!*QNz5pXqZ6!>=+Cv(t7dTV|R6kHw*tC69fHNyRNCYx)1E
zs6WZ)Zt?%z$Rm<h3jnw*{!gpj%Etd|bwB(6e3DN|{J;IP!~XeS-z>@fmMWG{{|$^X
zz<@rK@mv3hEs4V6rIeu*;L_l$!}I;;`{(=p^Y7mDpC7*1zc@aJy;SUSjIXPCANZHD
zd8zBJBRsLj4Hs*P7$81!BG_heT)nHsrN@cvB}|z|jjG^y@Q5$B5LDz1@e-Ea6XKho
z)Hel~iq|$*w_#hbk)u+u;YW97r`-fhFI`FsAh|>p=Jkf;fS;14E>E2rMnG}G7;}80
zmK)VE--Oz9Hosy5Nt$0pA{v4Hi}Tk+BTR~Z_TB5_=O`uH%L?`Po6c4;Y~E}!#rTR=
z0t39KPP3t-#U0bZza&#5x*}PLs;d5`a~?P@MQy+GFRz@_vonVhk<i^WU_yYtcF<>Q
z5n*l47gF;#y-j?NiA#V05!u#W&hU!T1tnwdg?PvY73y?LKwuu=us?8uIbEug(JvYH
zMwpEOw08u@1LJ0goG@C<budUaV8#j@FAx*PA}9ot1ifSK&>gRl2O66ItILcTj<g^~
zM|B<_<3;Wi<MhC*$+deMJ!m-8<EcA(hv{V%Og<mP+_sJj<y82*)bJ3q^XIA4YGmIM
ze0kf>zQsAxr^MRuwzK};$-j-41<o_(|9|Kj`mg-C)A}FHF@<O4HkPdatyVYZ|GVA$
zy#9ZZPx1PH_U7oMbmf-<x&-~klu1YX$47rVJav9=Uc9$uqfZhV#2$zK!W8t#R7DBs
z>D_R?=;N1b*T?&a-`BsSROjFAe}C9NcymGc{IGv?zP@Ju+QVYFJ;N+w6M#IS<nIn1
z{5SX3*YNKR7ozZ9_H3(!07ynyTi$s!M%8(Qe<eSeKwhYf)4opUF~@8Xx~I-J&K751
zz;&|b6BdpSk87<9=bLYwO!+#z{Q7H2IAkG%%21T4#>wMURwNi?9D)81M<<;&6h0#b
z<~%sRqP+J2<V&W|T10s;ZgCgIkBKInMD)uAaf%ExrTs2l8JIsluL*zX&z<By?9wsa
zY}Fm$68YcU-pb1Vt*x!k^8b^3isk>|kLQOc=M{E<nSxn?FU%6DFZsP6zld~^D76C=
z@ZY_D{g*Ryd0E3_rd+X?r>}p&luUgPKF^)n$(u7Md**C7Ep3+j16vhgYD2mzkLD9U
zu9KzH5XHM-(NGc@b1h9S`-1+|z3Fqg{urtuK)zXbF#8ZmU(od9YtNfyBB^_6_;i7R
zPiNk>JWAV79=}wi#s2IcoFBnL_u}YWZ-aZ~@;5y$1#<Xq@gKu`jsMt%$)1h>(*2zO
z;gfty;y<32$A84v6v_iP#f8Bgbwovd^jZ?k<JZtD2qc1UQo%>wCv6u*XbdHk;;*4T
z7)}SkrFZot=!0sVL$$%Hy^?|w+#*%b9)&7Y!46Z1)QVb9SCtTj%d2t_46|xBx*(L|
z7;83yROlr}ILp7?t3*mOc3@FE<pZHA+OeoQ64{`HcOXf&Tlu%eB*~Jqj3fxDyrab=
zv2k$`Nv5dkW5K@5l;{s~X8G3OZH679)L&^(`vbn9Q9o9y>vCQ5ft59vp=Tgtt6z#9
zI(ci`{=D;#B5j@4dH6+YhS<?5kwtk>68{~FB|t`cUqu*pKx~I7D3yyghSz~J4CcNU
zDUAYyuBWvI-O{o#W!fk-6^$C2Ao&_8zR~7cE6G>;xUOkSGR3skS+(k9Sq3)GB%fk6
zP@(@MP@qXZg$o@GV1arXsO}HH`y%V>mb`*$48YQ%FBHtWuJmW8sIbJX&5nIKieW)l
zay{W@lPlss7cFs5q+=_0H`Ted^8V4F8T~7ZvUvLMdXRDV`(NC$gtL3t|F?R%{4ZNu
z&CX~2|5JRH-2dVp^7N#_4RBI$of*S+l|)-<^ZA}COqS@F2qttM<ttL2(Vu?VTVLn<
zVdv4HiFO}&G+W<G9^zkA`Z3$Gq|cqD^XE3yDa2I}yyXnK#&3W{ca;Q)?R_(_%%<v$
zy$MWD4E+$%T)9$|sl?f>t6<K+bl&L#%-KB*e&HYe!<_(`rex%#aEwiWf@3*F68dqv
zK1pW043S4F$DU;JR*yq3@<*&0$&)F@gBm5jXUHb0hUett@U|+R^B{_`e4j16R<1@S
zY2~#jFFBh(1VOrmdX?){J-P0G4Z2(WUo@Ynegw2c{`Z=_Z2nL9(fus{KgFk5{=eCO
zd3aW70mzoblbJVY5rK1b)4_vGEQ05xBMeP2^=Fc7k#;bg0tiYELw_EtL_ZYN7Haih
z?VtSxujlyo$#}$fQ##}=yjWYS)mSdn<?L3PuGdrL2!K(Ru)`zbIvpyp-wGl}b{%Xh
zG8%y_N^FMcjYOCu_bYktrVgQ~vHj=IPun<;Yi>Q+GS^sM*K0MrGn~gEBI4GahtB_M
z6m$4QI1@4G7R^9BS)NiHzKJ9)1qwfV>O^@Q4i1lwk4|3JqU0P7P=KG#*9k>3jng=O
zr_7~{!Tj#x<>9IWD#)m+wt-UbjKNZmvIC|uunn5F@Uo9w@_Om;>E>4+!W827GK?Bx
zb|{UJOt+fHgJ&kq)`R_%{+o+acyqk}x4-g8j%gTSC7QUu-8%DyxHLshw3yEWbY)bN
zQx&f9m2%zr$3OHVEgu;CtNrKSAHf>-;`H#aj`P@H%PbmdPV)&$w#19qrw516GpNF-
z4&j>>Sqc7qE*WT(H_o+tOSXV+INHFfSit!K^uypfqU)Rh+872?G>npKni+x$y$ycK
ziF-!@wiyLjC3J_k?3Ch<lX8@^5J1LXMU?pr17y;9&O8iY@KyZB2lK#>0_f5MP@AVg
zNS13cPPa3%61?^>Oo!ynO)!g;p(1V7qu85^ftw<S(JOa$3%zcb$4k)YET*{WBg%~%
zErwU?<Q9r?KW_Z^R;OBYzQ~UF!-ufvUNYv-U!R<x93DQW(m#`8SFuL_Z-=L^&+5cj
z1r=ZIzX9%ey?=aoc0e+tkhPd`bV@og@8B&5sb(|{`$KouCuZmq|35WXp&X|oN*M4>
zEGO{i*u`(s3O?AY(3J3RVPk@OwdQhmoO%ZZ4_%C>s_X=t4OBOu2bdU<@^4-m7M!sC
zKubqS7p!3zri5Z^h%ol~Db#Ur5VaJ~R3^`1C#l@FRz7*1s&3ZDEufexV*L))zlbE=
zu^4?ys0VR+Gph%2Kbihe-Ek;5KG}H63tG#DO3J-=(k76?TWCG|>h<$OeF>W-vD(pQ
zcD?3i*La1OX8q_ErtVa4clR8MU{Bf09De6q`xM5XWC9>(*)>}>%e*`>$HBHqmMdK9
zmTUkU%&U)B&Zun<16s^VK&icsa5+`4R#pkMYNeBDx=MMTYt?GtWT;kh7E~`g0*zy|
zm{z3UD5zeRHkNW8VvH8dEaEF-9Y;XT;~b>YJ!nS1|Mxry{SW=zY5yNbqrPOtjmd<t
zKb&~(Y%#Z=2`u&h>2=ck{|>(Yy#N0cA5lB<lm7hdd0(EPx5)nU{=xC#{>jA~JPPo_
z5EfkuOftqhuIP$lA`Q^AmY8P58h0>5-(}nwMx)KE&Fr3iwN}-t*B7Qkpdi8M-$}HW
zdri_2-zJ$rN4k`LiGmZKuP2MH{~OuRK2}VP0#Bp5fBeJ#U(dt<mcXnd7%AJo4)J_4
zWKoPN7}@}5kYH=x%tKI0NTb`6R|2s1Q2K|KzVCHVja;|huP;Rrd)iD8Qxn)g9-Uo4
z-3YnSOqURWgkX644f^Pw#z>Ga#)Isr6@XTPht@-{l-gFYF9`^PDBQ_<WrBDd$DjyQ
zMbZL@zB<8<a=;SOa0rLTuqu}^74!8Y1-VANila?H#j`lUu$~OULp>SZFCB)6Pv)_u
zckZMZG(}zI4B84j-m+qygpu*#Q>R9dm{IfW&HVEIv+nRm`rPgOKMcnAcmLb#wL7`{
z-)`&k`u{0DCFlRAuU}L<{!bSy%?UnT#NG|11y{Gkyb96te!Mn_+n2-mraz5u_SVg{
zdJQ+x$aj0zr(%*_@KTgiG22F|qzm#kXiaRqsdVJx@z<V1M+C264RpwZS6g-S`^emg
zM;0*DXOM@qou6FRQV;89?KHBNxar%IgAzP}_b;zDuHBd-P}12T7Eo)Y6$A_vwyQzB
zz~6W{Ldx3G>Jtov?<CcqLj?yPI?-Y}#T<+-8twaWF$i}!TucoNPCYtdfrps%294l}
zrm4e>D>qC4a1^kg)}{U{7_=!JlrsqilK^nQlb=~I+rS#mVBt?jk$HWToG}825~Mf#
z=ii|<z4NtsaMt>T)xZ5A#|foSqXt*?f4Yo*@#5e6iy69id!xqtT7CdiY-k5ZL%RYr
zE{{B<tP0;4W9TSmY5-N-Xc2M}OlDSnpT6lhhnP@_9joKezr6H9crS<03AAf;i|{di
zq07$gSLD|adZ64-MihrohadDMQn?&ID@61ZF#$tc@4S#4?o(3$kD`Oc<(2Y`Shy1_
zEQWFIV<dBrL!!ezBLaSMNB*#(-6(WLDhfrYi&OW;pDrjpDQK}_0Kb4Lur*1~M?6F4
zPyrGnUB&`0c6wcy+36{r#2QEx95-_EQiRc)2WU9q)9L**0Jig?yadT*Qo%RAUjVHv
zN?{<9B_o{VaF2P8Bxo2+CIff)R_S!`r@`-I6sY(F{>sVTVm@+Ny-UD|B<2SC!Qk&O
z&>6D^K5xt)A}#0`k>*ma#Z(*P(DS5)k<o<4HwCX4)*vP!&O<n0GnKd@h&_7e4O5LG
zRpQVcdg<~|Ce;9oz94uDo30!UjY?VJ@?VGN>w-7KBip560P2D|kTYKcq|`f+L+a!n
zZ)6xxn)|`ro8he@j#?vi-dop8ShlqD2vF+3x;Wqe_V_UK*0>`eMlhPfL?j+vVX8rA
zW>L*j$srpB*&0{%i<;;6cKRiQg$)2B*3`sv9t{^Ea7xs0QjbW=na^m&p@PJRnHN+%
zp*A0!>V=BADb4G~Tg4poE5%wq9nfa%c@p4L^;$ENIf5u5@vuGx@zMs-;46g-|5A8M
z*|MUToX?Lf(m|D_FDYC|8rkM22qT`vsp7);a&D2r%A_}~s9CcxTbU?tI)+8~EmSaR
zX{vchQ`JC%0#2-4sciq!7b?133cIv2nQN!0V794rUy5qc{ZJ{fEagiHM@3Q)Sj#AF
zgo`X25JTi9M@`wsEp4@_q2uFrnu<vsvF2-Lk;|26m6Rwk@v|4q8}+5i$s(z>qdqUF
zHT#Szzg$V}o<8~A%ANNA>PcTc!OPER^J>$d+1e=I|F^r_+4x_bW~<fyy#N0cpW^-h
z^TQWsW={Fy5~2&IHe81<j(#*vb#M=~v4O#kHx&15sC+Pf%sM+ohQgf-?M)Vgi9dAq
z-yB7v@^f)-q(Y)g9*0;5iEVH&<p?8Y4PmA?u;L=3Es8d<(m|ghSk3UMJM)4?G*PxL
zi&<vth&{<YK9J|q_vcI^O!*r6BMB{rJ5vm=K61lR((Fd)O(=O&lF*4`zu)2(jdx|R
z?!sy%Va3=2z>eMP?+;H;kDed)`~BmiZvicOytEkFVl6H7sv4|U_~Pj0$<l(Sht&Xn
zzqHt!*JnpRCJoCN7(;gS{r>r3|78Ew;n|!01F}=32wxN<pV^2;2(x2N{6Xl3x4?}4
zJG>)DhC^agijoL40SfqwWqedPquc2K)~$Cwa2#ygVoY6(_A`Do#r>`K4o41#E%Kx&
zMSi20VFM5Md)^Hjp|AxRMHglxA)^t{Ik4yuwsg=AvIsg2y0|sxxj_t1%@=WPh6IX8
z-+}TUZm`Y(9Xoh)f%E8=Jq=xl(m-LZfEjyfqfHHbC*za3KXYJvG{@8_6wMCPY~u{0
zXfgQ3#Y-G`_RbG+H;>R$=%s@6z+%`!&Nm+#0;AzH9fEf4M{M&VK=R>!q-!Uj<wN7J
z(KjQ-4KPnLV6JcyLr*+<Qc~m=h06r3KVuk3b*2#qF%+L^pbC)7W^*3wekoWVQ0S)D
zZO}+wU-?5m&sgA%8O7vo^(bu?)^<5hjSl_>51sCIibTgRf&ZUBKcxet=ZTr)L969}
z^qBfX;e~guKfyJ7(>DB2y1#$^`qk0FSr*XCg9E4EXHY9ZglYn@9B_0yTNUitUr$m%
z6M0H-8D<~Gtq-EKKlb9`RZWLkdeqP%m&nl;D@%=NF<4&1#IOOp2V5R|3<Pl_W+Ma-
zUcY*?e|p&8KY89i`(gi0ze}cbJg3znS7Qd4!VXBAW+q~uqy9_BW;ow3heMibcw3Du
z=5cx@3_GRHp)|$V60iuFRS3u1;$-i<oN$&JcPHG=ABk`~R>I*?a*Uz2CclaQcIw%r
zmLY&$2onvyy*N5PKRW3j9RJPIRDkw$W7iM+6c+Un08V$?ps`Emr|<j`o7z8jK{U<^
z)Pl4A#mS5Pqtib8`irIA*Jo!S&R1`)p;%=U3>RoA$Rk2R4FF;%Y8^~6I73;BCTK+n
zqV&#+5YTkc!nxM2^NL+4HZIO^JkL<uv2-r-hKrDP=HBcbqT@%EhU)C_-~xE#<>C3^
z$@dnxJ}evY;?f@pf>mH1ot+(?U%Whep6%;g?b~U;nZvRW;2SZE**^!i{!0;5K$Olm
zX7kk{1Hz~_^iSScXfPx`y+i}ysaHEd_UgZSee(MJ^~n)Vul>`r!-liDxmlS)b{MNR
z{XuP78k@SqtG+vkg2^I=eLl8W8TzaJgYWwL-=4ibz5o^M{OFafH+K6uXvDkmqZqZ5
z{TT1uqF7C^Av&`JV^U2+&-?c5c|(u)Tkp0%#N2&|rZz-rh(ZF*k@_n)4%{+nB|#8_
zqUX-%oQX#7!9tuu5o>>(f>t#ZDTSFYggBiPY~cv6C7o&@8jf~cK=&M9`Q?zsmQ)Z0
zGci!I6WeMhW+AoKcKwuj7Y^s!S#Uj5H%ji<<2@I=m``Y8(zeUlp9bhlLAotjDMhqr
zoi5O*-%E0o0G!0)1r$ZP)K)2iNT=l6H*z@QL1Ge%E}c-q8<_<X{Op8a3LHMC=x9~~
z7{iy&=_>0gZBqJ*oA@%GjuMAF2E#$E-atf|p@<bJPO?g2taezcFRVdJ=x5=kcb?fP
z#f(Iw^vDzpH_WCVsf+!CZ%Oc-zy_O=q^VBElZb5KLCueW*090yEbdEL>K&hvMgMVb
zBl-OB+l!YH-x{WVBpKBr(g>IxBG~ys`@<`5_%`CpJ_(l{@nt535KSUfS$jt9P>=MZ
zv-AD)Gu<@p5Th7%Y8a3qU7=%8Y6~o?n1+QXj7cw&5zse}RzP%TzRo@tIOi9$YfQ<5
zJgRPY)x{bqU)m?E5E^dpFHU|qI(crwMOE$tfr7%RA+lx&gAcpbVe~<e1#Frn&XQ4C
zkUVyx0j%Gk5g@yZ<W+GDlUU&t-93r}ya(sV@|Tp#s0IMD3Tx67_3BK#Q^fKCx<a{#
zYJXqM-ah`#3xm3~3onjXInwnPd<WXDZ*UH0A%$JRIzN>|16`dxY;XrXfS(}KfrDPZ
zer2uxqnsU?^~t9SmvBO!1%vvzn9=szRUy@7Il$CbE=-*(Z)EQydSaziTrv|`OieD=
zPAv$o{Xek5{_l(Zlk<yLVkl9A*8zzl(C%;PhKqdQCOF?Sn~9_{b?x;`97z>qa!E}L
zTasG%Lg9$D5+77mReQ8bbr5c`r;IH8$UI8LGbWLE#7gWTGzz?kc2?faeBuxNIB|G1
zavtod;wad~h$F-RRDATP>KX_t7`Q!%JWMZ7<`de>ca)`&>WQ|I7$;{s?&$9>2JY9#
zF~ZbSRzV^@z@>-}=<Jw?agwGO>3-_Q;s!YkT;Q6ar!7EWZou@Sp(a}vc5CB}%@o#D
zoT0F{4e9A7dxkP)DGDd7_Ru1)#1vhN5Ta}b=<!s4JZ0CXI-lGnu9XPsd+yIZ1>UGX
zmY=An;Y^uJROTqr8DLHHBP1kr2pOCc0I=F4v={}>BN)&}x~Gp-|BCb>!y(c}{m?^q
zXDvveXA?3j<5;Kz^ekmBLBN)E9d{<V6Y!{ukI|V1bh3_L9W?0}DS@XB)i8VMjFUzH
zoqF93JnB03XNwz5=-|qkJbHY=>j?PIn+-XrS%%iar-o{p=Nt-;7EHW?)%Eo7d|&pO
zu+(c!1v7*I`jQ_6S!n8By1(IaJ#>@o9;7rC=?#j=7aCyr7RW*tRFo70!?WQFm|$M)
zJV5g$=p$YXp!|D4p0=<wh0e7b&dBAGRJUOERZPnZP5lu}&LK?aJ$>YXuZ(7J8;=Xk
zBK9YnS5_kEJDZCW&=n89L)#36{dgRuPXhSXgct<IP52Rp*2D`BxO0d#5FAw<M|_x(
zpk*H%jn|78XRuzCzAk-h<99<6f*?Unkp>Aft}JFgs`uzk4T_bhiW3(-!IQOvkJ{<5
zH(5r2SB7B_ktW5Qf^miXVG;Ws0JRVMufIJ$`u^zkg&j}MpfU+A$!U8G>+%HjVOj=$
z@Ho>rae`|ER}ha^_9o}$G<M(e4FfFg4$3)VV|2W|rA+2_1dm_8)O!Xx<Z)`R&zv9Y
zIFOO^TQK9Pa2)_|yI}yeombH9jo0cfMBRF!7f=`jODjgsxAnKzCz|bEd9W`Uv4mAo
zBxoCY<%#t196$u2vuh|%4pT?N!{f95_pj)3=-~CMSFksDb@=M_>0h6)wE2pJbJY*p
zwGSV|0{QsebTetUpJ-lQ8U;LqIzLV$@I>v-zlxj`7&_jHCw9WvAlbCi;vQ#@f+Uqp
z?yRch*n(W}ZTm-HrAX5I8R?TqBhWt8c)^Q9Mt<BsoxJ`<>j9Jr=W@Z5hoq#!tn?6t
z0|Fov8^@>!2a6d=bH-@okH^3{%5qfJU5so%N>8LBLO2?S&CSgQqfGHBoG0p1D0~~K
zZbovx%uO{YOoBFly<Ns&${H2q%+L*SXK${q(KUs$a)Jdd>Q>B>C<;%~m+U2x6JX4%
zaK08ntYc26-pFVDPS6!1G^zkg=z<Z=nRvSQ-V~PD4cx8}PgQ|OcEJ*th0`$cjv%IM
z#|3IldsX1*Yeep)O2ZWSQ<xIr<W^+pvXADH#Bf=M<RG;bGhFe>$5KkM4vw+`ts)EV
zaC6~PmK0GOP_Y;@N=30jDzByhzQV0W?PjMZY8|?J+Ba#>4__ReWIB?UF~aFTot*#j
z{NmM{)UgfS+t0KRF=R-QBAoOTfmIi2we#=ZM0LAlBMFohZbg!fHzj6pi9{tXI>dWp
zj0If|WyBX{0%z@H6S$4cX$!>pS)ab`OE9j3-CZ;-2R&yPJ8!*PSj$ICPQ?($>EYS=
z>CpilDUvyaY!d*FD~>#DtNHEG%l_fX^P_#%xp6}sjB7q7g?{>!H@ldV;q?pD-!l8;
z<b_#x63i}hm5*PaytLQGH`(e=A&ez}a?qe7m;%Du8_d&C+$DNTpe`r=U?}I?4#jVD
zYJGKhj=vjDzmLWq=5Ml{#~=1-_R=ugp=23mOK5Qg`YW|nR$EMJlKOHathso}<q_2x
zO+YaO<$qb7=f`J%<%5)cNvtHN!FtNf^s)8wYb!n;-haOThVo?a?UnQL<bsV_#{SUZ
z<VKfXJe)6<Vs{2=`*XYuJa}_a1S*0J^_UVL+*X8l2Ak0rFYpliuh#PsbaKISb<d4K
z$p<Oxp%0NO+jTs_ykr$z9p|H{5`!_jT={nY;4d#vUtgR&?<ZrFZC9D(DVrq%D~Cxe
z1Z#M{gxf#b2V6@$EQ`S())Ke{`rYA=Z(g7BMBwerrf@#~l6?)Hd51-(lLxO)UVxA>
zezEtytwS*x337TCGGfJP^cYxRQ*B=;UXHb$qcdd$XSrmKLkfb>$Kw<9y^h3eoG$l(
zSNdnKFHR2*jf1-a&Hw!L@bvWcY5x>YDlX6p7`Er9{U46bzcb*J8xe~o<{hku@8<tY
zwwe9KjA%D^hu&sX;s#7Pp0>9N^FOt=vhhE+o88a$zn|pu<rj|!{_JsdwZ2X^t5cM^
z|8EFN{QqtJKWEPwfo|-~p8h{?cojJR_xIWKz4MPabiR7>m4pBLhkO0j`Rez1i0&2t
zxAp$3{|CjX>;qx+zk7YC_Wr^8D42PlegFSxpF8^hgJiz1{GY8>r`gTt|NQL#|4BY&
z{{Nu;mizrvfl_~eHU&k8|FTj8KkoA>@dLHgo{^n`gV*OUJfIm|h70zgb>@+`7zG=!
zgBt}?WubfN&2YCAgirJt4{~YkmQ!dvx^cdChIQvp&Q#vhi6|>u0bp~@2G=t**pG3m
zhW^y-J&a9yp&yJA&@L+fuSX-*dX0?wL4%##LbLvq4*lEzGn0K_&E076eme0(2*yrV
zj(mnyp{XMx-g<P}g3p=fIe(cg;;XMB=Y0S5!5gOo`@6%@X2bbDm~3LK#W`qFt!;JI
zN-;^<y&&?q*P-jrVtqhHhhQMZ{UIUBTTi;j_9NKix|DibpMg2QE?hE&m!vdoDoqDa
z80Itx<>naeSlC^|XZr=(RC+h!DUDTOATTa27Ngy+GrS!#vD$P7#rg7Xa&Nm0hjcoE
zNXI;&9!J5ffuU2;;-5{`<?e#bvz1*o>t(=q_xgEEDyhsBhYmrG&W~Q7oH-jC4(zdB
zpB_3?=$>2EVV`k!?)N+GwF|(a)9xSCTCHYhtF_hcw(99(2kBxUgSU-@F9NC8r6Rp9
z6zO$(-Bzd9Zg+ONz3tsjv$>T6X_jwwyY1fYR<qmO+1c6cb-GP#pddn#GS6Pe3CxiT
zDHlzD(P<}k-1OXxvQ*<3hmVq;Q*dk5zp^+^%C0%zVy~MRKrd~v*EL$~b<0|0N7`I_
zzb$GiE~9D;gYPEC2yf0$Y4TU^^_Skn2BA~E7aVd{V!mC>l7lgIH%2xSU+VP9A7dhY
zd-(F`#Cdb^?eWn8y6AkAsUu4d#<`$@nOyeCSira%y(B9(b$#ea{A3C%?oP%V=wk11
zou8T{u-cCvDKK>qPq0T7-wQN5fF-TLmJ6c*!$_lv-{h8WO^t})d;&t}kN8lV2+F-W
z;z~Pq+@7bRUq7xm#}tM%!x%sON-3_9IgA`Cs;Kh)rNT5R^vndlYB2vc<!=j<VM}l^
zP1I*j6GMe%AAbY9*+!??H3k98w_r30+!0|YIEg>X>EZGIkB86eD&e+)(i)~Cqr};S
z1%R@N6mEwzX{(%FUr3vHK@XJedpB%N(!ciHw<Zz~rK3=pPWGvxEN(em>t=TD>gWkl
zXh-ImNZ4CVA_f9vY2w*4r`BmZ8+sgxY$6HZPjxAo@Qf)V3;9K}2o+0MWJT5h;iOr^
zN-#i%aX<k4P4|A!LX2MbZp1JJxF!XNZyBQB7OPDjk@_Dzb^dly15NXrZ(x)`h^M4}
zy?9dLvU7iPN<qs^snQvhVDND#R2sL`d`eJQZ93ITX}*NJGAmAYx#7D?2g5J26}QQ5
zY=<TQ(K$52@Z)54jH{0$^Um;-!l$VPX@xan*#e=Z|MJxV2$`D_2AeA$ZxO-p`U+TP
zA(;|}9+@m-Zzh*DwXR~UcRdZBlKBy0IuEYfeXK#hxG;`LO8~#*O{1r&$E4fb6w=|%
zU+B#}^4E?-*nDzRG6k3w@++v2BpD~61M#TL2CVz+sq<knxJ&?RQEQdHpJoUEF=Ghe
z*QXf*XecuT_d$A7;+KkhCCisd`hVv!NQCJJ&4Tj4DR}(!IT-zieeQJr8^(ASO)<Tz
zw6P@qYp1)Nz5m&2wm;whe3DP``S0oZ>EU7j;QYtZLtwL1E)c`SbH{JJ+sF79lOKg-
zC8LaHo#Pgrjvlw6;5%=E!e{Oc`QTH+R+3Y~EDrVkI#~kYL2&31c$G3+pkDc8y-t1=
ziFp=UW|7+j9sHuLmdiP~jQ9@N3Y**>;TAq*hs#JT+d0S;o^g^z8=jYrMiWmRNe=K%
z9&hQD=^<w7re4p25dnR%2+<5}O5T!W%!J`MG57?<yb*Kwfj?uf6+mbdiCOy8ou~Xk
z+(;R}FCsjKy$mtG(;Qtz$z*Pd;RP8p<vqg08A7|tW*b_2hcPS?(ut|w5ToaiI}XSC
z!~+ku*F(c2b<9gAs%W%NCV9a%>!OnWO&Rp#yD1dI)~Jaox==@a`i}A+sECQA$@vD|
z_du!$!Pb-1UBD%bw8N=C1y+Ejo)I;NG3#fXs0&bmM-jPaXpW$xlkb9SN<pN9s=znQ
zS>SR+Q_VOt@6y#QsGJ#qGlR)H@`O)DihX8@nSh0lPcOJd<#j7=HIcf*h~OWL!#YEU
z$PMx{k*J^Or9`n}iHOmHdo~LaT+Q*%jhP=u-efHG2t9+?V$;X5iC`ee#=YUpCyPji
z3yC$(ASq{B&?gN~tQSNOB-0-DJ11o0?sP40<yEbP`y)%GdSRVD&{Rif_?s7+zO|tu
zF8d?GLX`FGMRP<T+M5uK=rS+YDSpAsW4(r!G7JHl1XQdS^%X59$piIh{}}dor_S%c
z|K5E6zTwax&{uSDO%9(U&`}Wdy~(s6Wgo<Q1yv9sB73S{`e}^$#Y*ak%1?O-*VaT9
z;~7W>hqXue9rUd-WK0xn4M!@KLw>5VvS{tW8h!sMJNCcq5iE07l>wQw`*t|ML%(pp
z*bmt<)<&<KM;v0dRO>X>yMGJS^Pb}WNm+X~fF<|;%}z6y|EKf${{Pc_iuJ#vlY`@n
z=ZEF7|BXT-s<q`EY8yjL05nH`y$MCx8ic`HPl8I|K_EzBylt<MHUtZsETDLmTc_(2
z(JC-B4Qgb5h|ceLhdqZm3Oa`Gi4!Zd#$kn28%EfLXfdE`eV=dg@#e-w^<?B-hL~wy
zLJp9Y;NxK+tBrJbJo4O0%*#A`58OKFb|>c7+>>#zz?D<Z>}n`O*<*sGWW-75!<hsK
zP;rXXFG-kWf+c_T<Oax}s&E2~1ipqf+-L9UKr}D8Xh*ECU5+0}FhMhn#EnyhR?-#^
zGP2PVwk$|YR{Q6FeRFsQkDkCH>PcS3Aly(+$cd>01vrlu-YD1z<}PS{<m_JJ20`@M
z%r$s+etL0meg+LbXJ>h&9U8&ri%PguD0;|IsL8#4<P9gTa<oOPbaV<pKMo3-<<lL6
zbz}+FfW?3CzCu%w;2lvgxTbK9Xa_qPB_T1$IKt#g<X7c@xW@y5!^S%h(Au;;3|$`5
zuv0Kg214c;HPcfF)o4lS3J)ckATh->@p9De8tk*6(sOZB<Qs_2fGIBXb;LWM5(Z?i
zr~5qvjT*z=%{aimcnI+U_!Ho@uioh?x0oB9A?T3~0zyu@u8>eMJ(C4hu{5vqZi0@!
zaZ=xUF_PaKDNHq?Zvhfb=QtIsCWS!_9jkFtL^0Bxwj+V=w9>;<a|=-v3n1Jix&rX4
zC_lsr$vJ2Zn!b>83CHNbo8q{xaxiF-$A;3^2H^;IO$Ba`rYiOU15<~%I}T<ep&*6a
zQX<D40Ck)i#UnJ1`yY&hVDst$$uVe6hQOoeeVz{ZmVSz;N*?I+KI(ypEqG8*wr2r4
z`x2RX8W8*e?tno+0I$XD7;Sjs8f@=}EYzT(jf6Bg5(@`%jt9<)`rYB_tHbl71NgH4
z{P6UQge_A8BPYR_sTqYk?DW8E<z*gv?i5`juO$8)WvUwkdpFqCon7^{fFAoHM`Pki
zlpAFZ<|(c^(!7LAyPO0AKwGbkBt^*x3dZ(|ccvfF42fm=M=_ZwGwb7{6U}MmCV+0_
zRVzulLbal-PgE<*p}SSdk1`Buh5O_K!6cI@-glRgLdGo-3Cl;WVp$HJUaf2z=|RP@
zu8g$uq*1}jjEWy+@RiQ;$p=5bSxZEF6*j0?n%JOXSsvPoh3UkqYGL7milx(e>{jI%
zqvA(09%aq+55O_9_AeJ5#080_pwlFA1=*ocpcg&>rvNEbd*ZpM;qgvO&a3&Qjx>#+
z<RsR<6_j(kWg}j>H_WG%i_3&Dx_>t+SCw@Y8%p<LDez*vmfG>BsJpbG{ERX>RC)-P
zoI3nloWcDwKX*F+8@|0-!To1x{?AUcmG%GG`h5QPX+Fj0e+Pg0uJq`S-<QiNv=Df}
zAqW=3w?ROm18BFMib4u|wzIeXT<vQ;i8HCQ`i;@U^xw%z1Dkz?9yb_|jncv4W>Li@
zyYyl@Zy9+mu9U`+<tAgJj_n*AgM-%>C+G6~4f$aTKupoR@F-~kOxXU&n|Kr-xTbF=
zb@jRp@b`zO-@ZOObW)b_auQ2{53ta;7YBbiJntVI9v`1MLl1+s`Eu?^VIpFQ9x{B3
zIj@~_+&BlYm5%x1Q@z4Y;!Q6v{J09F@8E2$)$k!+^N@MgM#jfs!)ety=o?>YMJhn&
zHDDLr8i#}8#em18%Hv#JgVD7S5)b>*kDZ#C0a00c{nY-YzL!p`hgIHsw|J<LuVwzK
zbE?qq5>g=zQ#i;~+wbdZW<|crGoRoY=-&E!Y<ox-i;wyK+!zMFDYiqGw0xQ+#N=!>
z)=X>+XJnPIXFiFpfIHvXo{iBVE%n@=p$%O6S?GaqiF6J>LXaZwQ9P&;r$7}eH-VLy
z1&ayXc_!P3PvN4dk{ImKq~g-+Yi6iX5LUxQNRecc`Z?Z@RJ?4;@`C`%rV!2snKM}S
zaoSRF>dypd#)J^_BB~eEE#fP}kgTr#2>3lY-zLBYcR#|vd;BQj-beD)1j#)kUA_H3
zsfLs83h*IiLURYgn!=g)EKfh7hmdpZk3Br4#w-W!B`snww#W|1Gb)^@I;kAGb9ab&
zdJrEi8)n{hI`80HqCfo6=A%;q*l@BV#0f6#gQT+583NzljtHKY9^V}qc2K-7M>?;A
z$7!C`Gyn*kzcdSr7Ki|64%yM5y$P@88Gte8moOrwBYXIq*|*8uDmlRTKwb%IXw;u@
zhGGu5f&NqaXq`i+xXIhGi{1cu*FsS#DM266iJBmBsT2<KC>1<2Xu_hfm?{G$St>Xf
zEuBoyHcl>%k9n=qql+Y{S%y^lsT0)#F8aGl707h_){Xq3DMXAAvY?r;bi{zJ(||H5
zbJ|*Qf5n#Rji-*E@d;b@G%);=gI>VceY~O_cn)>J(Tl}~G&#cv!sr?i>5j`L9BH8l
zNlJ!9K9>+NBTNN#3#)j3qGSj~{V1FXne{IHKnSK`agQs(Vp5pY$L}<&(xah)bB)?+
z0P{oZoS|_Ytfk|{gh#hXHcMi#kOBd73TYkznu~gha|x0TwH&pSr8&K3B_-()R}`s{
zuG`8`zHJH>!Q&21s+yJCEIk6C-N)zM{|A5WwEtH}^KNW6_{n^h*#B&`w>w$;?@p)r
zdH??@KE?b0{nNvfea<IQdJd2-cMs7(C<t7oLVY}NTvn1~l7#a&0*oBtGLP5SD7s<A
zW?K_hAyh0kaj=$rc65(U*4pgB%_;?nYTC>$LREn`-ms*;R-s3ex|mu9R1CcpLE(;R
z*RH}~Cb<XrVgXH%)PZ(7W4ibyUi7+p8>f8o7-TX%`HAx3$5RKq)y9;?Y%5NO@KjP|
zt0BW|JdLF+H3XJ0F*l6~^0t<Ecb3^;nkD&0C$c<CEK6<Wf7hF@>~<}Q+5LFr8Oa~;
zq{EA#bD(G7?Si&`AKVfgO#`*f%5`XM#{9HreK(SK8nF`#N(mNhsisXiSpCFEr>F%J
zi*9oF$n0E9Ds!C}+-gHP6^K?$;z47h`W&uCoFArMcuA)~sx>(tD(SLnaSzwtH*ScE
zI>rPBu<s;ZC?5~x_Pt53BT1r=>YcHnUR#4r<3#cXP(#lR@D^KS6VH)1bZ;{p#Lw&;
zq{{zp-Rxs5Y1rsod$9a%7SV(X?OE$f*jLF_fY$bfP^73G4#%LShDJpY_$?bXvmo0~
z=5WeQWQ=K9Ig~Xp%>x;{2RgK)o(oesi1bFvJw~=b$rasR613X$^}!<NWhAgFos)<X
zWI4XAV@6^*Rx+UJp|lTT#HUoVB3Za5_g1_#0E12AoAhZ>GCMi<i=5j`ZpB_54K<ae
z94E_wp0Tfuj7Q?`3E-*Dk~xx*3KFh7lf)v6jcOal^HjbP94<#`WWC|lOiggMwXcaV
za3|O9En2E^*m<<Tl6dLfsNP^WY%zK(MvBV5NhK>1fI91xQzHYjx|SFw6%?+yDV*kB
znVoC=7kDqe-770GUHtajEqTM5jp6ljuAy`hweIib@Qf(0%#!L;=ni=Y#8>lN^D4j7
zh?gV_sG{X#g$kopE2v3UP{q#qxL|PZPF_1eItN3aJbV*lXI>ifM3Vbw0%d70(aqS=
zB6c!QelmW8`0I10=%E+=A_t9_CrO>j;BJ`i6gWjkc15u$5^EFs`O^tr37k0_&dIk&
zCua&a%gn_bk0%%e>^<Q-c8;I2gq76XlEw|Uvg>AB<Uw+Aa&dO}9G#G6a`J#_QcY>*
zJTiWg6FA1y;Mljo_JhSGN7lezs`yX7^VDhX!Jltb;OP{|I=uS&Yp$jo#%nc>KwCFk
z`^o<W!#znX4vb(?Dnb#llo+KhJ~SY1JOi=Xa2^<s9-vf#&kslECx>Te{nP!EznI&C
zhLZvry0f=^k~)|ZuwGYA<mmW~M|u=zL&P=?)+-j0z>l0hK)HN|9-Gl}@^bVjn2-w_
zuY}|-#6amJko?Kh<4JbODc-^SwW|zd_2o!|Za6t=*7uC)SxZn{%swKL2JqF;)L|)1
zOvt1IBMwwWmXF|a63%%vuO}B&)?TO}C}yB2418dT;lewibia85^@Hn~7nby1HS=h`
z!hm7^?fW5u5!B;m89{^+l)_u101$5OnIezo&eu<!8<QR)50{VylZ=0QvIuTTB$Ol&
z5|c`yRX{2on*$b<8;rLUemMO$h<*w(5)?o`dx~7Ymx`)KzV*RuBiWSW<xJ!}8o`zx
zMj;9@04DuHi5Tf~1mk=`J3H|nbAt63k;)%s_yfC+<{i$ahmH-4SrU)FHd8wdbt6E=
z(~dR~kZ>QY`Y)R#!y%{vNO;Q#Lx+qphF&fkWnC6D>OPX=X-+Z_Ov~`50<5WW&?H8W
zWnje<$QXxW`5;kba&q#wMfIuRq@vE;ML0rhA4xV=YGnn{`2locks<oj>JpQ&zi)x5
zu2C0ZJ_ehOSh*NwPzWo3U4U6d(xROEWTaIqf?N*SWNtCB?_K2H*9dGZ838gCkhpCq
zOPqIZ=({rzAS|6Rj)^|#HIINtB=R;Zi_L5pDwbIiMm9`Eow5r=08m99s$$E;VFf*#
z_Grn*6{g#Yia_+6k7mRC*H|4iOzO2&w@(4DXAU7uZ7o$W%S^Jpr1qT+-v96xb5rBc
zFwn`KAI}Q$Sx!DapIMD+njzrN2hc`jMk#63SsFF9Qol=Yd{g&KpKpHe>2s(1-?You
z(l(aG|7vz}_rF`M?&tg8Pw^?f|NVCV>`*!7mtFv83a;o}Qpq{9(v`5~qSrZ`4!jW_
zZcC<ufp_W8W)eA({dfl`k?3R;xO#(am9i)FvKZ5q1TjBV%3LVXsU*U|cbNUvn&Uiu
z2Zn#;O!5Sc&=?ti=1hFvhhb{~i=NA=mVrRL_6Tj)lo4y_LLqg>fGHg)MkFU_qN>Ux
zSH7r2&ZJ+eNBhZfFiGjJ@B(p!_rsa%Av`1wUAZ1nwy0}R*0>bCh{(a4GZ&L>nFLkC
zbabXYs`CbIgxFGhMpXr2%8}QPGZzqZ-4QMzWOx$>c%2_{k6cd4PWS90w{Ri4^x{-z
zcJ4st28k|^#LgHgiTNC9GmOWSPR+b4pyc$<G#IHkoOoEgwuVpfbw2{aamG?@K#V)>
z5cbov*f`Km%q}q+9hoA}hM3C&+E?Mbs2>J-kaEYtC8(G26&fbsfFrsp7#+qxp^$8G
z>VB3Z97J*vE)yiq+(}}3Y``E+($a?>UKmCkKu?XxTokgkIsSo;D4sm?FkWchAe#e7
zq$h*&JD&9orarhra|ym$mT8c?tU!9$<^~s6hRdEir&-T5lP=?wvCkOA>gLo_+y<Zk
zKE-~J8wPc=aK;)D8BZn`s~Ck%&ijqyY1MCit+bas)7MqWBe`$P+~*)qa(3KEWyMWH
zpYc`J`y~c-X(|3$zxogP+)4k-`r0pPV|o17tp3+)c0c?7eUeYH{&&tH^r~opxuT_d
z+OLyUHMz2~auw~*mO4%Q!?#{YilJycij7l-W#o7<B~@+_@;&*+I0#}&ameYUB;M9I
z<V6(&FH!hTG=ss=SG1r8pkbiJjI683WpQE>MF_~^$;%wxU81%%Mqf1E8PokZo$=J_
zX$PjY<P~4SbL>UDgpXKZAm7S~^YVZza_6Dq<*?7+6Gh}a@oYdetqZJACh6oo$BDOs
zSq$1-uu%FRL3++cK(UJOYewDVu%)zQ>eiH}pt|M{#!NeEj!fW`j|koGQZ?nXG3U^p
z!FU{baiW&`CPL_eq}T)cj$r$ww)|vT10*JQ<P<^IBA|#}1@RsZw>U|-ppwV&L}KF(
zVT90#pQr<jLNGL&&?Sh%0M7yCnuWCumE@Pn6iIX~!`9;02?n;TspvIz^oM+#9<PxX
z4MTq(2O;0#B<5OUJdo0?%OfYT@Ia~bR1`R(GZ#sM5vho`oTxlf8a}GymzN<1#`VO)
z%N>S66d6#GMkLCYn}Aory7FT}L)A|@gGZEwFV!wbca=t4F<XvlP16uigZMOT&)8}q
zzXW=QC<S(n@`S)Nf%jY*eQG#bG!nCcG+lLERNd33yGy!7x}+QF?hfe=kyuiY?(Qz>
zZdefM?vhx#S-O#U*T>)c?|kOY`A*)sapqjs&?!3((s8|%`vlpF(WUwMu2VdoN4IxK
zB<LjRWS-CKzQ%{+ns-iP(b^vc_F>!K+e|jeQ0k^`x{wTVMNjtyZzzi=8yOE+fWy9J
zmF-ku@AD$ra(tlwC6#O^(vBu+l!%ZxSuT+_j;oe1P!<mT^r%`_%SWGWHxEA($E!KD
z{AGq8AywLQUTgV;u72L`dfMk8$Sp(F7p!I^gQc<KcO%5fyVo0xbL$aGg4V>SreSl6
z?Y}xVRS5Z;>h4>+N4C+{t0Uwk;*tNM1$X)GpYM6^pFRUqqTZ%Y??i^)-e~i{T}Hi^
z)>D5DhKlc9_Pbrl$T&I*hmWirgjUYY>U1ItWLzkC7L0Tw*2`9P4=UM9*$PZZ?{;vd
zS2b!6aOn4|0hR00G%u-!6Bksz1t2adfUGT5+>EqCXiXyfcT}9N_>4T5xvB!Ld1)Uy
z7*A$gpXRVY>AnKzSuxNfO!Zk+i=#bq?4-smpLL~n02v5@0je5KaQ+P@`BvvRzMfFJ
zA`BTRr1Z?Y3oQW;OBd-<vKk3buZk@Uj`Hc4opuyjLAEb;EH1_VE3~c)yjFZl0i8>P
z3N(rTQtKFUVJJ(V#KbrJP}q32$<p&RISz+i>hS~a_G*TQVMg7sb}3=s<9Q^U#^@1W
zo7<1~p|8Iw7P+n$X!C<Z^?CJFF?ebvDERJrc;$;leYQzwcVjIchcf<LgQ4}J%#wOY
zr7f_6>p8gx&YSzwZ(h2G7$5Tfw3j}de~mJCHjj9-CRzM5{?y$Cdi8z1mV^A(ElSAM
z^88yyUUipB=T!S47m0}a^kdm}a#<zJWjL?1$S70EahDqQNY2oq8sbFkm6i(=Yqmf(
zo39oTI>BefwXyJ7|H`VfGu(CUME)JzWwlMnwz780UliTKR7`Hq0zoLaV(4+KcxaE)
zX@nxm%oL@MtI;Cmb<&D66ay_=t3}t1&Dw(Z+B_6ewQ-+&Gu>{kf>Cc!0`mL-H`~6|
zAm+fya{!86_loGBsOygz>+^Qm6Yt{$_mV3QHn0x`Vpm35Rr>D(5q&m+yXC>}42@|g
zWq9#)hAtR(HISy646+9L1x38w-F~*fwH8jMxlK`i`{_@2Dj)EcKEMRqlvG=Zh_5!L
ztrF9A6CFhLUbyt04RgxgeXY@6`bWU;L<aF>q&ryRo#47To$tqaUHn3P-Y#wrozg!}
z^0BIr7ZPd9ZbrRq&gFzR=HTYw$^tt`;cd!75z$^;i?5}}W}z%kM}Fy`&#RJD9ef#N
zgetd@JRM%Nlh<6Z=MP6HTDa^S9u?<Hc0>&ck7DA=^nJHYh@PQQpDQUNDDikGRnBzC
zr%Hao@QqJY;L-kVVP<4SzuNt~1UgM+?m~*;f@wX@{Xy`(39Ou2?du=2x83LMl!wBF
zP4{1jL$Bb}#u4*rVv$?*k#vh3dAnNwBTDNfS{kY9je9}Cu5aCE&pQ;c-ySObZ+4V1
z+hImhB$IF{?d^?xX-Kr-!egN5TbEAnb*gri_jS%tnibcI+DS0#C%B%TpFuUJwr?O-
zyxR4Tjr;(C1}+cSn=#RE3vcyHMj3%ld@NK_L&k{a9Bbb%bgmy6-45jE)+bj}II^Fv
zZT93piiWQ+Eur)-9zRS3*|TM1>X`OgJV=NV{~W7>6NZh|O=wfIZuLsb*c3~$-f+io
zt@64vYW4SUySn=Q8kzUf`O~WU@@e;>mPrZ!OcJcpnX+uR?LImvU@$^GzbSk=LSZ<*
zJ{fpIv>}_Qs1=B(GBMHi-lrjTLw!39@x*>IC<eU~ZaLl1>AB;J=>eyoNfWckrF?@u
zSZv0mF~OU9d+$em-6*cM62wuNC)|6Q82%S48Z2yq!3l@(6V4{$o_F&u8e`Fc-@bUd
zq4nvw-bSMT?qNGP!GkG-es(?<pRL_l`oMOYlPFf8`|FVKRkN%2e9tHouFitx920uN
zV-OtUl+uy-EdP`c%+0-IOf%8RiY%&$=uoff2vS9q!S4v19`i2LFO5B<(C5aQFkY4`
z>Fc5!;nAv6`xz!5N%@vUwpP-A?jl3;*@#8MFiDRT0e4-Ro`laPjFK_{z2SuT2kU|+
zV-{_ERf61j%%RPy9DF93r^Gv&#~Ti_9=HRe7&<HTdB(Ca7e|hxDnSxcda`=~xzrR)
zyUJfRL?pb|ro3;O=ygPYS}c6s@2g?6wI7ps=GkS+m)~vCmtq&xPYR802bN1=;}_x*
z^G8cltrx-)P!1!IXW$oOQH4N$pdRt^e|x;1;~_3xSd*rPJ|X_#4%VA%XFVB?u45^C
zab{tN3-8;f49onDNv|Q729`XBKUiWj&i+2?G^CGQEVLLAzfnhBHMH=1mW6Byj$61!
zuW1~6l3GntsrQushmiy<^4BlKik&eLyukj>wiQmoCO|ry^}!S-d&SN2%t_L>jmJUT
z)3Y-kgQ3Bz$Kz=E3(m4=ub*2VvnML8%Pmt{31im?r;kI8O%1vIDsMrrfB%`;`A$$;
zFgM-)Gc*^9V^s3eW*ak+(++y+GhFHUy-M6&H++iu+l|{>Z8A#T*7#ca(q^54`@Gsk
z`885rAq_#ZaS|owLj?v-@!*e>?V}cXSU9r0XIimua*KZ&NSs8*|FpLMetj;#X`g!(
zMN}xyhA~@y@o$|QUw;GW=bgWaj+8z;zwJVPnO!hFf)8NreMFP&+9{&Z<xHYk8-~TV
z!Q*d!1FakhwAM9A-_FClkDtWAyda!<9P|G?uP+F4at5wCI+4hjsk7#V10O}+v7g;*
z=6gkp)&xG61y5gPnXQ!pCTX7SJCdatU#rzRjSR`3GAmBe3w~Z^RZLJv_-7%QGa%nq
z66DmVdT6UJg2C+R8~ab0)$ib=zJzmM_DbpWmkk=%p!0tAi?_ukGf3k`wlv`wi;b?f
z!l|0oey@)<&G=FDwOvHLhe@F*gc2u}zKW^BAh*AxCK)nc)&Q{EeJx|`qU1{fUtoFh
zqr~yynoQ+av8!QOXeqQqT408#Bw4BhPm{Rv&*1CBZj7lvwXBnBVIy5^c7Zh2)X#9$
zhD;Ul&B)){`-fE`8sBKi4wX;3WnAF<{?xzO-*=pLzHHnb-2UAzz4X?nBXe-ktO+eU
zs(JA+?Yas(@C%##7%|H8XZRoEJ80(FyRUUs*10djC{{6R8fHhDl*@RX-F?6Q>=+c8
z-qNmqRiCxd7tZ$FX-n`YE%b8_ikW~FsWp-`COqZW4a_FmEm6W|$Vz*U>OwFs?;V60
zQ!_o~AX*$fgX|rc*plECTEm(lb8N?PPde(c(o)*xbjRTI)pe>0lR;QqB5UMaus-hR
zJCQ%RiUe~R-htLUT=PD$6#n=eenulXzasiC`M>wLc71+l6H)50I0q*Yj&1-p)k4cW
zlPUi!SGM9t)H3Y5r9$W16{}sZg9jtj6z2>c=54~xE|3|cAG8p%MY9ETTW7Y-eTsOy
z*-)F-s6cxw&s*`8_M2g|*@P<g<seV0q5QmCk1Zl8sy;OyRwev}Ql2te=o{Nl5(e+$
zmmu{THU<=?x3okT<RE)<!wa2nhHc~L^9UselRPl~)CTh^4HsPBr#+|^Qm>I-=izzw
z@4S$@d2^}ydjnXlP8h<2V<B{|>}~A;`FR|CiKl!eI-xit|H7*ZTHSo@wB#}86iq>7
z^y`}_=0skPhq2td@vV(%jZxH8G-lhHW*Lis6$*^wW;Y(L2*ZvK@D%8XJ!>y1XhpUv
zTLtd~5EOFeit|knQ7@$*QE)+u)0}tO@nkcmyB1pvX^=w|a(G?KJhpRG<bFOmRpql1
zJ<U`0m<%sTJ8g{$vEz&}pLUND6?J^(wfT9eX!D0_?pLmwWKY<q<H|?<o{%MkklPbH
z@%(6A!w>N4J7U;&1EhastIej#D4Wj<*b?<;c*qVAC8ZAl7GDO3>zb5FT)RE}p6nod
z5%=+$V%{}-z*ZN_hlY`!4=zG;%8ffLf8pWfjc7Yx6KSVt$2)x_3!w=t-<c%Acqf&M
zN74)EbE83S=f<U_)xITx%6wQk?OQC87EQNGvFT+ZG@>tn9N{EmnjC>yi2uEvY2czo
zWGGQDcbD$B%^K~cK6b=;$RGoClDjt%K5LhrzfjD3JI>9RZnu2qXQc|cOhOG$Mk`mU
zDR6H{=hh))@JdhUOGH;j8;q=8Qees85MDAP`&O|0jAB`F{o>&#m;U3Pyw{u3LujmF
z$@H>M??@*TThyvw;#+uMxeE8o?+0{!#ST(`rD1KmVG8E?d{hoPmL@G2B11kn)bsG$
z!-RaAURtLiJfc*+l<W_Y*m{U5a#5R0KQGjKGUe<jcV^{>Y#mIAhVww~inyQ5DY)Ka
z&sT)yMzNk?!vAE>OJ}&wI@7FEco~%a%P;mCYD37TjPP|9+AF*K`*hpv)XnPwBBsr#
z2~2x>qQ~gzJ*KSmRhzViP^?a2TVGsNwjSXU_xt!ik^!@pjSlO@*6C%x;2NfQKU>YR
zdpk{X&5PbTXk`6%W;2f83!Yn-cUt@0DR2;0U2>Eu*pbuDIA0T7)8jLVce445G7$Zl
zlZw|s{-y}z8j@wIIi0uIXQI9`zf~<t(*CQUueDXEFl{vB&v_42mjlsYEvo+m!I$AS
zUDr=(%LYSaaJ}fB@KMT-9a_$ABkb|_G^Z6&y=Zh3Diu42iHewrQI{%_l7|$KVPJxO
zo)5<pmj#9bkzj4WkY2ewuFiKAxMp(m)F_|w4%-=(xsENNL|6Hr+|}3g8p4D&krli1
zIH~!UrCzzKyCTp>^>AZ|^coHH#0&D+#a>KE0{+^Ckq3LY2ha=}U_EXqOMJ4YYfl(Y
z$+=>lkQ`5TZ&kMHG7rG=iudZ7kS;T{_@6chzvW%=+l|x$lj<6KHpd(*+(q7!YD+aJ
z1jj?UHL;PqQl!1iX#;cwwxwsIkLbxgBP@*u;1Dzh;sR$N{lY^EnbFKb&NcZ)qU(Fu
zfX_>KC&cJdeB{H)_d{8lP*xfG!s8fzMJ_5Fi+)!$sy4`Jm$9Nlj9)3mkeCHd-=oP4
z!SWD#djDeg27M)T+f0NvjV8sWTzD5ReP;H_)q(?+!xQN^gWLG3+i+T~gu3pjdRPuy
zdZH_m$m`5zkm>#LB09!AcDZ9Ic4d`CS6?r?e^}}OYgdedW8u%&j$VW+!?+)zGV77(
z&JM}k<H{p@r-i6f<1O#^9bu%ivI?Q)8%!ti>soUKSj{}?k?tzaIKK?*Dk(8axMF^b
zr6^8O?Ae{sDD6sPIu$aBNw}(=zSK+f4Phc)){ZP$hn<zd{iWqW87|VEI3=NL>70s|
zUp<m%jT!By=8g9T7P6ThmCzU#u~UdEr8lwKBCO?;rN)ek#nsHr?0tQGrMwjp+~FjN
z8j5r2?o4l^BI9Ny6D*l);OKkVE2WlU+AuQDO`AJDSoU$*{pMT}7p@1l!~Zl)5hpyl
zaetTd5%7W~A!y{2BzKt+be(xTDjmWpCRX~$2klSwvB)@!c7U~DcNL&%eFPnx`TnSM
ztxS2XbCg^hr|cl0oSds+I(iAg1QrE$ir^2D;wAG(DHPgaoJGnMWH^aFwcBg_S;5w4
z5A^#0bnBuYcx*}A`XEj#^MYrFoYdfA^5eMR_c3ar5#65hip-{%C>(Bf45V7_f!+W`
zWG%tDJ#vFgPV6dC)gIze$&ld)%sIsMpMP#N_?tzn;N*Kj2&mjw%+vV^siaozMl{_<
z9m-!dm{d2NjEuB0cZUXxQEq`I`>aQ`SZ-cnqHbSwM4VdOGX(Vq;k2HFuEJajK56od
zdwFld?~*l#`e46wzZ-ddFR%bA=Cds?k7aXg7*+M<)M5r6*HlFOSXk7uxqlV!f%>gl
z)&y#U#r4O^+Fu=$&tFjO9uj9WD>=S$hBu>=A4inqCgJ}$>nL?2nw~GETO+GRY{tvH
z{`DK&{xc=f)0{kKlim3nZ14(O3eQR=HDu50y${-@c+uxQG_#c47sTlMKMR9Ck13|c
zUgM_&qK1|=<7D@Z8a1?aeVZN0>_mbb220)aNgJdO?9K1Ez%zHly$+<)?Sclm8FW?_
zMyaAS6N!i@&O&nl;v0oC?+l@v;Bt+RGEJ}X>+~8!H?a$LvxUode(j*{7PD6s&gZl#
z;eod-b+HSWuz>fk{?(_a(Qltim%&c{Eq}Lfn*Djx`GZ(mI|d7NOx=EyH-*{V<!Rf-
z@=j7k3Ar=7)>ZsH&Cuba?L>|tuvINjeBKpnSyb@ch*c@P?6h?3gjHeqw_6k`+BDMC
zWoy)m^KF0mTWi13rSsID((3}G0sS_hb3EAeT6uZK-~G|}2;jf9c(K9O-49B-4At-R
z?|$aI4P5Q@Z`5l0@g~yC`|xRK`M3{@yi<f<P$j&%ByVAU8=pGW!ow7SQ&#SjIJM$K
zGCb9D2+C~I)s(2P(BHE<_@*T9i6%cpA-z?S^o1r6efn)~Q%AYf{ci4^du3&VqAD@$
zR#YqAdQYD6yZT)!l0c{3Xj*6Z69q;y@yLR=lMA7NjFrCe-sXsVA~otEE#kxbKQAwH
zY3$!I?(>!|EF`O#FYR59u3w7G8{Iy4AEnj0+I3`(t%07q`OpbeGBGFK=FS{jSKFUO
z4Gi-3-bx>mAN*fDW1%H<4^wMl+Y2dj#}hOzCd8Kwv~lLtnI~|#Finlw7&NHZW}Fj6
z=xa-^qo+q4ld?M*_o!`7ZYHA9SZ%QujBst5<XR_+J2By9uL#_BBsWnudznyb9E#Vw
z5W(sZzUT0w!Ar)0#!PQzIWp}(zIc#}BwwB4P`BzFNhzE~d}Ui%ID8xNvElin_C!zQ
zku6hE^bAFF)<|u#$8nlE_=CfCMq?=2a@3MH*Hk)#?<+Z{Jhd(RSv7V>I!w;~XP3IU
zF3oLPWwVgVmy6Lp&B_GaX(yLrSRdOyQR`45GcrK9t>K4Oj1EF<$~4<4y>Q71)sp76
z1G+{Q(#&Glsoa%q{L(84O2zg0QQZ&Cjo2~mSGkj#s&hfAytu$A`|J$CC%K>}sSget
zq7Ua$MRO9X@$$uv-1*PANgowKtI)*dy|1ejDd^6OqJptiLUm{kcAJy0kSBh_INNXI
zk6q-tmL_u5zOc_K?V)JB(^>f5ZSr}ksxk^)XsN_<VVr7IVFe-lA5#4&n<?u4^fVYx
z*L*@Hd}=SoC8o~V1U1zwv&g`go9xACX3bQY1<Ca{UR{bZkUZlGU-38LiEs=A=&HO_
zg_{!ht1C|3PhpP5|F{o%P@lxL#fBaAQCL<f7{RU_OXz#x3$whIMbZ4^OsJ^$Y5hYe
zV(sUdas#47xeR&FSb{nJ9GG>Q%qceGu7WT21G>l5De=*CXPY9}LW1jWEzzi#?o?)W
z?OMYVg9WY0z6?^dM=I2uT(9pdy--Gy-j#+~;_csubZrJ9EFg|Tb;-ZOVn90!PlIv3
z`%F%Z{b3IN!Xz-^kD1rO7!}JYeCiYI4YiT`qn)ZBG-q9*zA=|VTOiC6t|+tPY~@dw
zlxEK|g4`eI7}|%$J-52{{O8`D?dr{<sl%nq{P}i{SSrlcf{JUe*qLwo4kw(34U8Vw
z{s<le2IQH%>70ve&$O7hgaG_}O!QbS6PDlX+!fpNrQ7$^n@rm>?U6gCzUJG>LREbE
z4D`!J%7NjmbUwfLvdCQHSS6dH4QZASX44Xtn4M9Zp)d22TIY4jU;E2l=$!`}>CMqq
z1sgp?+^;H+-Uv>kq~=MM&<0DcvJ!<|`7^$_H)up0kg;)fXSH2#@8VU_@E;ZklE9~j
z8vHnA66Kk3`Xd*;EyQ$S^{UYoF?ZtFyVsebLQUo0ryl76_TK!E7Jl>|VV>{X@(|2q
z=$g6t%7z?PaI>$fBTf93F^<6p&62~<s-LZ+MuL?cY1uY2E#3u-+QcjEhD#d;I{cDY
zvA*U(of7<m(*9bwRBhY%HK13#)~obmsZ-yax5Ry@(jab;1WXRX<LV~~-}Fo&1Z>{i
z40PK*5BMT+?Y$KtBUHPvA>+D!Wui|)yR;GnW*^cI(rY}qr$c@ch?Tb>XI{j!P<s)F
z5~-2sDnRXXb(?8mnnO3Ju+ktUjjVGWhT_T2e>l~!obk*3O8V@NM=$MVqENzOXZFKJ
z;(N3r`xge8PnFietUu*XaYmbXaR++7u3&Jvd>kd&)Gg`%p#nKVl^rvF9C|$G^UMsE
zAD|>xFsk9;Qza|%e!c!Tx%mBV27X(n(~r(1r+$lxi6~n0Y}%)}?cc`%ar%=UwY|BV
zAmN5fU{*)6`0Gh2ok#ZMPLL`M%}*b3$DLPI13L7tz4_E1^6(ljnTPt`BZe{<9t}^$
zI#tMy*K7j%*7(?)DC54kKBVPQWg5kQl=PvX=Y&sd!#ytF=@&Xf<Bxi7ppnM?vm0Jt
z4BIiC^As-(8MZFbH+5Is%U`@q<cFa*`%Y_L*=U4Re&44s-&(NYxr~#WN!2*{26|(|
zk&f0nH8lcC)%80625+vPfBF3iw#q5>CEJ+Xx{@?U?oT|24`i=8cS)sTLt**QtP)}7
z2&~KUnOP;tu|wJunTtg5z465!3@MrS2+R`)JjR+jad$<M?g59s;z4m)#eq4EZk&4N
z4OxSsMK`9v^)b-Ljnd`%EhLmDKj~|nuNm*Hj+Q=N8(AUSgcqyG@6tL*M9ddQE5&l7
z^`s;>Aw@`Y;`o#k<{fhjsV9iIWbvU{nZG6KYL3@L9f-lJFsUV=>Mr&c!eYc(8%(i)
z^H*wz(e<>ts4~5fMW?HM7$j(y`T*PE^QZvAKj*0zVJjP{Uu8<-Q#gth+h3w7e!yc0
z2T=8QTYb@gGV%?vBb~(#uBWh?LUoPbi^u4KExU<S+N^ioBPe4R;r-D6byOAaS3(RA
zytZnFNr%<Qf_`q;`ms`x-$58JI*ZC$L2K0!UqIsAW=<7f`Mc<#Ph(__*O*%=nyzj=
z$;pAWhGHEin!45R;LP7Y{aC3M6Hpb6&OxPP8zGZF8Gk=g^qt5FYZo-mj=JT;pbwq$
zs|kNoOLO(oB*9t}XUhNap7$9@YJYxa<3p#Pi|=Bez<iv$d1kvS+_P>FDe~oy-R}=W
zAvGfVW1!nZbE9J=bxYL(`4)iYPKIX6>rA8beB*oA8*!tXD<ohBt6n4;Cv5SbO`@C&
zH?~d`P`DM-J*<QsG)|y`9Re0*8K0^=I>7@BCX3P-Uj<sGLdnlhk_)^FY#EG|n9^z=
zIx$Z}T8l}3<k}PUoh*?3KC^hEz+gQ1)~8bb;$OLN=HB@DSpej5-}nN#rwe^+sy`Fz
z*ocF}C!ajPc!U>tbrZR~Fb>9nF@dv+X6xd(TqDxoZs8U9by^eyeaPr6zH}=TJ^X-h
zkHrBa&wpitfqBzy7tb`so^HaUjbbBhEJE6qF2Mr(j0BiX`{)nGG(teI#D<oiZs6#=
z`cMS-4Sj$4sMT}*+UjkS)G=rPvpkj|^c|tzBMY?<sx%%HdJ6LWY+svg@|gqSj!qd5
zX5sJ<EFl_0`e|nT0d-)7%5K<>ukAiDyf6Eb&Feq_DfK)_3SM02Y4%WD&dLeD`tO`y
z#)A@_vMML@yeE3P&y0wphknG_ykwpXUtwb$xyD=ZFx;53vSuHB4qAsI4v5{hfUg}h
z1?NvC2CG?VGAEDgnXk4ml3fLmk%lVjmdu~nQrg%_ZxTpMh~D$^<=`6ZQ5w#vs5b7a
zPZoV)FTy(U32}~S$sdTl(~P(uodat$Wq(r|lDtvgp+T}e2SO%`N67_8cXJj_`$5^Y
zgrSqcUd0NMdaL0DtCbX_3l1^nwfzRxeYmBgXA3vJEiTtrB6k!@`jizZ<c>OBMo9m<
z7ynoUB}jXL+EYX&$%!`29W9EvUAS2Fu5ObdR$i|=!?Xfm*lXK&pQ-&0m3^^OR|kr8
z6sfvXpLZp_bR}>CCsM6|k#-I#-YX`;yYSe~lX$@20)_d6^gaR@oY8vU01MmqMGU6S
zfv{h(W0W%9?>ti0N}95VCk6re_{YtVvOm%-?xfswg|uam>*At1O^Gpw_pRhJ5lupo
zr<{xyrf7PP_Tjdux<sQ+tY|p`MLps@hqMnr)emi{oPLF?Od_Kqp2Pl`Sq{&<Qwnp$
zfNu1_R%c=7*b0IQ`}~fAMc(`yTN*{O(1oTQe6GrOm>l68T{BuVm^u4O3VQvtb6+BS
zbru$&Tl6X=hf}nf%yhNNo%HZMPu~bp#j!v5`bH>MniM+uTG-kT!NT(U3XPPP(4@Aa
zA9sy$*u@7nv*Kpm(|VMNV`w<rUhYIh_-EKwa__n}ePS$;K!(4OrIq-u!kf!Lwrpx(
zexjc->RA{55<#&cfK&5<H}B!D#FMnHJ``7fu&9Kbvs<Fw;%M;Rld)uswkJgkJGQIV
z&Chp}S>pho3*AZOn5aw>{(HI@=>DiW{54~4TEhqSK2N^k$ES@?ADA*K0v@mgLZCre
z+ctPni|^g^Bg;7Ob+Rwz02QveWgc3)YGrT=^7@+j@3vk|;h2sha*XkJ?P3j6et(dt
zZE&f_Vg9hPI8aTodq9drFn|1Yw`|ru<1(NQiU-%FquCTI)R+s?ibk$C{Fj?DA^LYb
zWx&2?H|sOttUqfY$-w$7^lTos93|1W|8*6LM)J?7UiD9g59$$LtasObk__2=VC8_9
zQat=wd7Y5A)J|&@Lg%WW_2){#m`PJhfLZ)xMc63bZs&DYdo^ovXBFjkfu|Qiq8bl!
za60WlSU|cLFAo;FQG~8_EhFE<pEL3vsaz6_+A634TZLS8xaA6?S9;Y0K&XCykr{0r
zF?UqJi2LgcdJLv(D<0{42BmL{<fgO6IL21h#Q~fNv;4lG3w7II{0n3bEXmzlrtN0B
z^z`BC&?WW6IQBt(lO$a9l!<hMi57`6B1g+zF1g|CWDkb!jZoT4QY%&^PF`8`j$xNe
zcFN64asU)KVU6!dA@$|r>-UAi-9o7j^t=y~sLec^H2!trkArmBFC$-7ubpyb@%R(Z
z;Ua89;@2-)XIIvhM9U*fw`JQtO!B{ue8%HHRL&qRx5sjU34&6Ui8PrOmxHEU0T4~w
z?7g@7P}ef^J_A0z<62#HIA6MtQ27AETyj;U10U5-v8p6(iwMeDl~G|bvlRB~@b(c|
zLc#yywQCSvNWP7AIk9pB8cK=;0Tl_d$>UI?UWi=AM0L~GWyKs?lopWPGC2kk3F(ii
zdReo9zHBo{chVNHkgCl{_I+w<Du%w+LmsC|N6H^jt(ZobVyY?bV3}J?(F@VZ;R-E7
z+wD0rOWaxcgq7k6IQ|JwwK?>(&xMH|pvq`NLO636pzwZ6(6ktP7?y@VNIa)0KfG`t
zIZ&*`6US|CKq!H1*us;SMn}gEM{2|kXK)PvLAXcUXzjg*>I6;s^EWn7W`~%9j;d0G
ztmRB_i<93|*!X&}uLQT)XA_i#A2LVbx__KwzeqMiJ_53oa9L!?U}ACU(Iur&GC0a1
z=J`O5gg82WK)y&8xP&6g!=@kcGgT*|_3$<`k&CbO{T*cp)$w4KN?IJ<pc>S((Pi41
zA(dNLN588FUlZ`^s(DpfHt_kg7oWX_aBuN2l$lmPQvu7ZN*5uV;QsePQhTdPvlH+%
z*Uvi|wk18`n`3?<lN8~NgG9#S0-gL>g{gFpxOxIM0-JE?TM>a2<KL@}`J08Rj(RBC
z)P#<#iR--MpQ;>L;l)WJQ7EhM24Frz#zDrzUJOAw?q1%<$*G6wf7=GXL#LkUL=!xL
zVy~m8iFTPL$KB8*#$7H+r`5Xi?qEOIshhivK2EBTe3<UwaNpU&hrA!U+?mBsQ;m`6
z;4Xw5&U#L2M`U(YX&2o|y)a7nRD=mtMkROur8hQcz+s+Vby~8ZLz;dGugPVTDxG=~
zE~F2YWhI0>SB0|SEC>^gz=lt!)zuKiOi_#NnsZL#4|6rqngxs6RK1Qod_2pm(e5g?
zmKF>Get(>@8-bmqewoNG4{XGScU)NXXEk>cx?R9h%@m*@M$l2|Y0W<EF%Q68Q|{}u
zi==qiUU0u>?*|w|Llxbft`}xA2AuN71o>fKLPjsE7&$8G0{7F<q9NFP!EY{sfI_T9
zpo#2AuhG6;qB;Cm>2m5hlij`=pZPDocF=(EIVs5!j90hg7+)KAvt<WPJaxqdWNybg
z6Pcj4_kWZ`4hQR61ng_~`aIE)zgsFE`4Z~jWCXLQS<IbbLd{$UqmAg7ZnUR58ftGT
za&wdNd1AT5zmHsT?S-Q3xyVK!?#t%+YWQgxiaEv>Y~sLXMT4nR_XUL-a2VD%fH$3u
zo-z5DP#2Iy*(ZJTIV1y3w--+gPS@gl7s0qrto`>i3O@ug=*&j+(7b@)^|Z$H9%CEZ
zm@f4%>O+J`5&rhl%*AAf)ff%}ew>M+BC+pq`I}d!uRn+<WKS^Hg&R5BHs+=ly6py-
zzj~j&c1#m|nj}39JWRFbD_d}ls%8$9>+|eozZ{kzj#s!f#9gKpM;Nl0jp4%IQ$#X-
z@1WVSQg*GQu}O4LL%}$v>jo{rrE$dPL@s$LjTI|f(oXL>bCs1A1v64$jh?j=7NwW@
zBG;PkXu@1+v5RVg-4#z#d_b#+dlM*y2J2NhX%ia29Bose&-dj6AKCYn`MR5=;!47#
zBT(axasd5$8C2>hMxpGLOPXV{{=lb7Q}re_+TJU&1d((cG#i}RUHHB8l`czhlJOW@
zEcTbH>6$epB+vHry?x`5@-$BGo}@~~*23~EXQ5vm*N`(2Rm%))fXhnz)U#Y)+D<@r
z9Y!uAJAe|ZxX7)~Ygai=mKxRexIS#=2cNBAi)+3$&=&=SqyPEd@5LhiWxyB@gjzd|
z3{;!^0G4QuvhDj>QzyEs($?Qg?M!oX{iHuI(*$J&TfpU}R0Q`CpNjqHE%R7vycLIE
z{=EFFL)qBCPgxG(f-_5pm5TzxZ>r32pu;IrF$CwZ3%kSeHS7iZPWpi-ZQZo~VItKl
zlB>yiv0^#Kyv=&6o1*bpX<nKbBuh<$sl=AAVhYmDP!%(`&Ekjc&iAuT>{X420Oaa1
z$M!ROR?Wr=U0YT>%#Z;?<%y6VpQteJMP2B8@p5a~yIx_fdgY~gBE&ym`fm2DkD2QC
zf2j!n68}(6L#B>Js%WgC(1@KQM18Q7Vh^027?g?JCQjj0R-ZdMpq=xhO2(n%=<$6n
zFq}ZE?A6uAAuPw{`SHoyaE{bT@vPG=-;_I8q8WQa(ZbgSv0jatvr3E!C7hGIVKWDx
zG|x=@8FMcuu9td&@al6UKxDpnR`th~@}j+!8tnbJej#2~JIUvl;F^FQ-H@5Vi)hei
z;z=4`-i?n>I>!@5s@!PY^|L!NlbEj#{Z77Ct4Mx3dhoGyGDyAfeaU?r!cPF!l$2Fi
zQONY~YCJkLmVrk^j#e8b1kx?68LGO&cPlAh7!Gi=^YptNv@@YQGLxjlE;CY;s$=jz
zzFujMwl5c7YJ8Yb;;ehucycpsh3H^zJ{7IgAM^mWy~`kmj4%;XV-`vtMAuXg941_H
zzDkr3$Bui(dsLM2icsl~*9&=m!^P)bZh7}euMR&EZBNG&ID^AK!t%<j2kRzG!)?I;
zGheY&=6yR)Cx&nl;=jYZuM7yPZSo{t_%mP8m{vi|>cTM}b7py*?9+ud=R>5WQ7?{=
zaBp9})#5;`OPK~H2IDH#_H7U7Px8MvW}T(*$TA86w1wt)rGA{8&d)Q;0oKK&SWZHw
zh);eQm-kKBiAcPn+e3?d*KUV_E}lzdP=q*?D@ddG^)T&=(12{jGDV9oIF#tj=!{I~
z*WDJ5|DJ9|{rx2w{Y}C_>ZNd3Dw;-Ss^h7+2<(q&Oy|peWc2WvZ|R-`guF*C`^lhb
zmb+Q_v33?%*~bf_VNepqn4jI3suJ$DhfcMs8LjCNq~H~iY5HHe(6td4qj*0<AtQmz
zRN2a(WEOW{Pj9%J-Bb_q_HW6$O8R_Fnd<wGE5A#BA}n7_851RqJY30{6WjJxR%@{&
z-Db#@^?-dAA{wvlu3?Xr-z;8Pw)yb`9Jy0iu}q(uV5WeHm1fh|z(#3CZ|r|uyrOXN
zd)T21-AD_Y9vgN|Xp)-{gGa64#5=mTWN2!7qM}yvk-y$Sj>C=%FJp9-a`S1;D}vDo
z>D!1`x4?a$F5(WUb5b=bR@4G_q|VatgBRL}4VWXS?d}7vTiGD>lBpO1qOJ||ASFUJ
zEfTsvUN~g`G?%_a5J|wURAcRM@W(+J#wor)^`+hU-CrNY$NNmqLXr$_#J6^*b*UE0
zz1q^fXcj!KsIbP|rnU<VzfP5fcSY-{uY?hkH}#t|aR?QWS1M9UqukJsEY$<ohbg0d
zj-DDraUq8u7oP;6@y9FH6NV|ytefnsd`+gpDrc|*2@sq)ST0~i45hdpsChZ|*{CVO
z{fW%~{?-J|$=b-5pspq2pV+}!#S9g5_i-#l$=RTnx3X1@S~BW<qT<wobF95RVI&sy
z3kEtpac%nDBs<kR8!uTl!`VL>WV{-NMNP`TL1+W<yt@79j+tD@)Rvi=2%l0T*ceeJ
z+^QK5kbUTAv{&pi#y@oEWHyE{H5fYfvoUYKN1yGTDt{SHeBWczY9Y7uP&u&HkylBJ
zP}#$_h+b9z{x-zd!Af1pp2DMoYDIZIGdnj>)_5`J8tv#-A0VfEjhZl`*x7t@zV`v6
zq$dB?>DLQ7iffZSuGbVn6_xZDl5nPN-KE}m5-Sqh!SW}733u#tYny1T^<DOW&(Jkf
zMy~@l8!Ap!8JCfbqu%t)`{xKh-Ha3t(_-sJu|N^^@vUcS!=oa~A3E7L?xH{6E^sx1
zj;jnwN|#cU70&ZJj&d1dKn;3&2`A%ytnSa+mK#mlO}6q9l}*P;LVkD2A<4~O^PTJt
znQ|MCA{YBwiu9xt$R5uu50#5TujBl=AkX@bZo3D0F_y9m@ORQ#{%Vq-2l+?asG#t#
z=3kiI&wuS7b-X<c8J*0sFZMniyHkj2Px%`+J2~dBe*CFDs3#JK8mUueP~CU`QF;t7
z>_)PI%$$I9V{RwVbv#lKU#tCT%T}KKeWg!!3T((w&&}g_ZRJAs>~YuC$;(AR0nm(6
zU+->#dddLaF2b<6-w*W;r#SJwZh;w8=5nMw^pX~bgR8x-M}$u44TaW74WH6kjb&Qw
z_ZJMR?x}|&J2(oLz0#>L`5*F0Hyd({)oqdAexU<6y(^7e-U^mv3#_%;ZAehxGd&(F
zOTD$bubFoK3J_|em~*nt=wKS1FLs(CC*7ze0z{OfeqPN8vx0-?XTuoV<>*?HP^XWJ
z2~>6hW}%_r%TvXNejaCK;*KZ(rXi%EP!j(7;63l3-LJ0}r%zXp!uEO%5T_9LD30UD
zAx$H#O)=OaJaQN>iX7FUNQq^vAd@+W2zNhsKuHyrW%n`ET7YEtB12G9WM&bQrB)7C
z)BEFCD1{ly(yM3eei=?b{~Ais*=?F<tV=a1ef)*$-x~HH`R!5t)@>f%&pMYo+fF6H
zB@NAiHCmJ%1UxhDfG^r|ZHkgC@`^v@2kL)pQ#eb#3PFxgF)Ck}Pu_M7wy2in@6^&j
zQBQm|pA1fXbnLKRyN8~bMVIv+>Ty>%m$RI&B0)KF+{!JqXkZoG(Yu^fEPo@~$SEY7
zFj59Y=99qc-WFTm+80(uUWe6}rm1LUWNqMTiYiSm7>Vx_DE!>pK8!0;T-%y20oxTR
z%GQ`Qev{b<^PeSB3b{^Q%hY%Q6EnRSjPelAFT_fVM1{z^pI2dl&Y4>jP{#Vlyp{Ia
zdpi!7Yj|J76*7EN8=SVZK8F}ds(~1*fH%6;#kM{myDIxi19vH4+7Iw&`;13l{0j=m
zmj=;1OPP=kt+Xy+6~I#FeB^$<vN@Z=cybKbuxiAeb(npfLmT{&y(0Y{d4-U**QT9h
zJ*-4eo*F>k_l<0G%5WnFsm``?3g`Mk6Dgis8UM&d+Q?p~Z=uK#9T7eHD4jO8KZ3Cu
z4UxFem?7KERv|l9@gj=Lhk;Y`NNgb7y#kT0@kgT8`gZ`mvLnNR1!ow;(;6m)t&Gf_
zV{*$^C&=dDn92ssd+l4*J#uq99hZqZSL`J=llLU=UV3!PxaeZY!hQrB?z^Xa+B@6c
z`W(MP!DFhEQ2|i6vM#Y|nf<IJ8*A=_9hXvSEb^6Mjzg&x=e4Xu+M>6}?ty}hE|qB4
zKLq~iv!`FnovybR@5seeLjB%L+n9bm0Mk`8L~B7xu=*UiTzi`}G#(!#lvLLR+TY_I
ze(lqD@Y8k1$ko^*uR`i|%CNV!!z*9Z6NSHbtx&zFNkLm4{5N=VM*WDG5~iwa%b>PG
zb<^lMM*Fu!uD*pd-;c=BcA5&wjmMRpGsp(cQJ1VBlPts&Uqy2*&zPj72GrV2&BaAh
zrY&tdCSCmYMASwYuxuxW`pFjYaJ8f{e&h1-n#EqBR-(3b+NpdKOLj%bfoZ5bGRW}r
z+iX@$fNC5Cf9b|u_lbE!^xL(IXaVmPjpEOb>7H>i>q6eo0Ow<6x}J-AQ4(bWnkiqX
zS@V5mav2S=H^#`W$9=63p3IA*+m46U=B@><x8BmZla`gYQuw!<mX?-PGWw-;yVlmX
zxVh(HztSlf_?n&Pya5xAsCV!8Qaj(?z4#u*S*M#nbYpxzrJ(2*Ii$$RrpV0&Q`}D(
zcYX7F1uZ{rWxWCfEXNYf1m*-w9Q$p0mueDJbbl~>>^oB|J#(OCa4TdQ+GKtiL(TDM
zJZb_e57|1ZA!H22o!wsZg*>Djn4!>~afHHsFOS=rAovZRNq@9<jXXK|JLf6M;6r}D
zbAmrV{P)1e9)c~w08L=zj@QlZrMYv9*J=0dLAsy)M<h0io!TL5V&xnSS)<S%ZfjHr
z>Q25d`h-6!k9@D^+k5==8Jn@G;LEPbvSB5M+P#sxpfdL4OvpwA&Loq$BJ>GWVA2Bj
zzkFv9_>Ku8GVW}rN1I^&o~jb|>Ns|2dt=Y*js{xz>5^TWGpR%bXC3wC2A_|Nf=7T}
zg;>X9a)WG9sfU3pvie+_=0poG9I0fO1?L5nI|aKD-By!q^Gv)T)cSY(dpG%i{dp(0
z_4G^o817Bj0QRoA>*a1BtGU@@>1y;lK5VV_ragMS1D{UJ_N2fhdUsbfYzIaykLJ7A
z7UD^G#YN**e^vW+E{#0xcZ)~+R*mhDks4~iRj|7tW$p=)*eQ<K83C*vH+McLr`js+
zrzNy|By{sC5JuK~-uC>=so6vSR7e_RCT37g4r^y0-O}n)4QjzJsx}h?78O9L6E?SG
zg3g?P&E^GawOFc^N2l!hvAtzo&FDs}^=3^*Xv6N7^8zR|g!L@C0<GQz#HV;LcFxYu
zAM<N^%Mf9wk3FghPYGa-9WYm6WKH4ByXQdb>&+L~4YJVrXTOrvR&k>Bt67M>NTjRH
zCJ_))|05VUZWdaVnr{_pb6B4@>6;_WYY?6~@rtX}fAy$LZv?e`;5tT@K0TY%22_HM
z^d8Ez#+Um*2^TXhCiAv1B<>yBlTP@qcWp~4HIAs#?7D(Er#YaKkU0I2Y>?eKxP@>!
z)&vf;Vh4GL4Pk`HT)GLS0>BkjPbvdSm)4s{inOV$TRnz=)NzpSkH(1eW2Z(;)~zV~
zz&-Z`@CJT#iy%-CwCJ%!7q<ctdB!z_R<?i_?GYT}K-i4R5A2#d<${klX#&D#gI3oY
zMv6Qj;$+svpd!Ydnpdi=07I;etB?zico12j`w5{7vJ8Ny9&`Vsxq!$q{S_=cDpze!
z!Qd534`6&Fu-a6kgN~Dg50wWGWc)uy5a_E{O|zs`YYQOjSDZ%%h;<iSy?8e%28ApQ
zWS?jeIL%cehrsa}b42%=ZGkW*@Ue?mWkdKJ(lLRv+zHF4tjy07r%qFJaRLxHB+!VQ
zln|nEtyHH?Uzx`6^6Dxm)=kO6!>1J<*gxs9`X67{oRcFmMa1|SRC>;7jgb`qh2O`z
z36!LUn*ln45eU%v9~*EL7kL>c1GFqHD-0Yz!~5C-+=~g8rfvlOGH6R%Zy704rn1Hq
zP~u*aw33JuYjHp21VYx7fO_vs%LxR6z<2r(GxK=OGwgy3c-OB8<A=d4>5Wi5tc`*p
z*}{+?;38}y#@CNqTJ+f^1R#7YyAICt2`McsoFwzj9#<l$W$}$eMNZZ_P#n@?dCDZo
z!?8-_?ooWe1yV1i5;X%04`+L8>(aS~F|ZT1b&xWwT?*6+j!_|UycqrRu3Bq&qd2oS
z%YISIFxc@>%i3p^wGk+ljh^^(6+c?iDu{eG6d%}SpCkjKo^*1&6)2Q!lCnB?6XQjA
z`8~S)mw4+Dwyyej@gt0j`Loo2i#H1sM-?s*WOS|CI)Arm{BP~Pb<1fm3gw{9yFqfd
znMDYvBfg8rn3Os@W$JSNJJ@*R@3~!Ckb`}ChEJN{rwL$JmcRd?Ao!3aw8FRxRs$#y
z4D*bE3BJNH%XwsUX$>#0o7gk^_HzOkV2)5>#1@O0^C56}S9i!y;vG|$r}IvEqPvZ(
zoFR(<xoyyk?U@@5atOxXJV<!435fqv=ZL(?5Fi3Vn1=6^A&R#~@&Q3)++iqK=JTiE
zfa9f;TZb!~%J4?h0t)w#I9;nC6sRvP0)JQUUv@M}os@;>&2G9%Nwd`+66Y<I4O%CQ
z26)YS=vuXUlTpQ?7a3z)w<6|yM#DiQu7+r}w4z^6^vZNWaK;Ioa*Tm7#=wg_!_>cP
zmMuMM!y8xEJ*_E?%rnsKW#4J~Yf7{D&NFR;m0f?YnsLmUW}u_8f)`f|AXxyRVyOB6
zm;(rlK#r8kxT)A#LdOu55Ys)g4)nt;d8%T7d|&=CDm&ZLXJulHIapBsCUo~E`;U|7
zOkgz-dkpM>8rNvj=d=fgAO#ryUH~Ie4wj);P#oJELF~@D4W7ip!ZvFhAB?^9Z8mK(
z>R%?q+&vb9=ndkjqA@V~y{-RX0}O8jPPZ3);Tdx%>udy~Uk{8fuR?;z?3)igmstin
za~JA~DEYJAKTZ(KlDSl6A14sB8VaHZKUZaULBxXAJ#+|$At<pxr*sbWfL4g*|H{qp
z3&&W7sQ#%MsIZcXUqn55))C~0-AtCcT*n`H1dUc_nIr>Q3`FK#O~<wjA(P=DvrB+E
zeg0m(v#*PtW$A&4Pm9G;m#q6>QySjbYH~}&ZVk}00yNoK^!=rnN^pZ?|GFqti=qUq
zJVqDi5y|IcZ(j!-&?p|`1i~f~-28L|j;}LpgR4*LnXGAyQkQd_5DD}Q1st#blexxf
z(}EUm>0w=o{;_4Qehi#LJ-JSN2KEq!)V^E&I&*t>6U)Yn8D(tiKIx_<E0N=d@lb{(
z(D7Ld1S$lBkJ||o#G9u^P_U=~NO6H603zNR8dCz98wK;DdO6qs2@RF90FPWWj-P>@
zocl8Cnin7?29kznr%eFqPW)4dR4IRJpoUv+mqGusFraibm7$jtxO&Xp3b@oAfyjlF
z2E@kC$uq2D4x2F3wt|9?aE7pUxwJ00z+;)iosf`2w!Zw{oq?1K=T^h%S|Y45hu@-S
z;LVw~ltw@lpAU)3CyTqraRlKe^up?;la+t0J8<}+78#(B;~Wr(3}P#mZSZN%mTXHQ
z#8yV>=9De1E(gv9Y7n8A0y$*R{hV3Kc|aiW-|DMHAft9ch)vFB_55o=pypv3fr=Iw
zoKKX&EUC)|6Z0QX%fcH0CYV%(9#NKe1i3RfUd&fWsWsGMpsg=iIx7$^Px5uCCWmZv
zl67ja)w&ba079DIxtksyfHCSg6QBkh(p`>uF0}!3qv`iRy``oN@mZIjWYZ?#QP2#*
z7??#>)x-4Y+(B;_yXvP@Kxg#~MpVMzwcA)i;eRtW8caYO>WI;~l?r7RZ31%MQZs_c
z4e*u<5MZetLu()4^g)${`$P1HjJ8P?&c@z{9S35LuI3<nnzBolC?Pxib@4N&xRyN>
z@4pI=N8F-JHX4Kg;(<;wpc?1;@j>8%5qP;pio6-+oDvWw*u}E`mmJCgo6~OH9pv!$
zdha459l}INsQ|4}|8QKThTQA{@vP$^*inBCAe>HW)Op$b)nkjScy;+K;#<=IC&`^{
z-SFA373U-w2<zFR30Q7P*Xq85{Sn}ECpfGPVFk{u;k?*HS@Nh7@%#YR)z*&`^$N-^
zo!&{#J3-dJv~xFYG*4Nsh7bX5b40^n>kQE9ApBR<-7F<?2&#^C6MBPi@-c^LmB@3-
zzbXaow=oRj3qug8FLeYY{Kti1au=5o=gkZWbPX6me<tg9>*5$Db5wt?1Uq8=&M(L(
zgADD1=#IGBr3UdRgnX)vsa@Rig3+MmiOByOqy~tG$Xu-(133ms&p;ZOUcup>Us|cm
z5Ne&s>6wGG^Qt98`CSvP-$$|#HJyw45iXIk)JQ1sUG7YT;8GHx>&Mp-+{rw+{^`D3
z$4wgD0Ta#v<1!m~4phn#V(bhe^#~2B$I7z2^QZ;R*%D+!dZKg6FoQmpb^$Qt@^u8^
zN|0j|zC3{{wl!ue;wnw5%wJf7b;RHnFd!acr(r5)ny+5d<{4dGK{-MEvyJ~j-7>NE
zkzt3F!__c4@Drqp8$q-py%meV77LzH#>KS#4zJJSrTLc#@G#PTf!GQl_Wd^k*$8VR
z>N%xMewmvf1Ztq%>Pl!S%Ri{iVMQg7vJ1}PaU%EmpUC60HZ$x6$W3Go$q=q`rR6{K
z$9_5QHCnaGh(Y9rIOs3NnHFB0=oUSz^IxIp!6Xey|JmLYafUz*IKk<Ic!yE<bPwhP
zUSNFXvWXjzw$HNUVYaRd`1P&J{J&T#+Nztw5rbg#KAqGCTK<dB*v=Yt=~g|fKJAvq
zIT*dw|6*x)#uM(C0v4jVU;@u{yKUMs1cGtp2~X?adIKe3AlN3=atWynKBwP-ERfq@
z7wr6?xeaifwKM2O3=c!*uhz}os6L=-$W002p_`T)vfaO08^zm$0<Xb;qj-tLeFzp>
zlJJyAZSNe4{U4vlic-7KZ>tP+pB+de9s4hmj!y3cSTdTJ8`XpZXAn;zeIdlZ!T<oh
z!HgrM5g~C0dTK##h>&ofenx=ZqJae08Lz3My%VqFRoMl`EJ>_^*+2)xMy=>R!^W%M
z5SRZ#5<1K=X`&%Kg~>3%wq4m(gFxbSY8_;5gjnO;qXVk6)%-ubcdUHa!N`<@Nc$q-
z#sdF;4tHt}E0j2^8y{rafp`X@&Td=G(!^i2V+3sC|Cd3rf-JuqIr39Y;FugqF#W3t
zAwk{t@eJb!q_F|aR1mPmIo|!3rBELUt{cf91@XRV^=$cHO75`yj^_E>uCIcYLE<@(
zCIsSx9b@O#A(CzgE0F!r$WX2-`)^3DJHehn0G5S)@err@=fKOm;iSsGoEpdjMQ@Pk
zf4LhA@Ia6#z#en>1>a9hY1ugC1StivfYluil>~^uI;PZ=;ZTSbc0B=nSP(b~%XN5;
z-|g!EpA*EQGHwcxv~qSn@3jK`Ga@N)J(f9Mkh)Ra6wwclXZ4?P$ZrgnKY_!?5imC3
zPZ$2ng&|lKkoZ~n`1;YWD$x4zZ}5MWw9aT%-Brngr|LzJ(hkyRLqZn~$jnc&jGfWd
z7&Am9_Vr)V#I3L_&qD;Re+P}Q5+CVtK-$ZhJCia<Q&acg+;>**_&;rA`dpIIz(xtn
z!0PRPZuxDGzJd~OGJn=HiBz2QFSCSo-F3s(@FBhKk>hDTM-_h2r^!2yp+ZS;<TyeN
zf?q}B|I6!|X^|a<h|9lo?u(uHr^(KK4ZS`PqVl4L>5JX+KTURAN<T22)(nG<R>*Gu
zC85wd@d#+9X4nBswoc>FY4v}MmpnE+XtEYO!`SgJ|Ep=9oq|{-)qhb7+UTL`H~d36
z6jVcx4KzTZsTZy{{aa+nF#-M5b~+Y3lh~W(EfXTZzeScj&ch>^O3Dh>K4`6FL%ao&
z8AImI3TLq%J}5LzRWP@||H~HWY27MaKr6m9ZSDW;JXVzXvWi0Uo5I<V`~SnRm|4#Q
zfF}*i$6WargitoLI@3Twlp-UctCN*~8bBerRd)>Q!rQ#VZ2m9)A_8_j`~W)Ua7-hM
zH4s=vZive`caD54H@r!r`-sp)uQz+KV|l;+53E2_ztR2=`ni+;|2z!F{U{C>!#JuC
z0RV@i*#EzU0wnAIzqQr=?En8MKE?k3Z%$vo=%1aRUL2gCl|}%_6kPvO7{_^#=bYi&
ztIewirA4NT*t=O)Xdcckmz4<zSYn;|)FGZ7#Qn(meVtRs4By6~JEV|1%4>e&&9ES5
zP<MvG0wF~h*LHo41CBg;^v)aZt*<R+k$*Y!Mr%-EZ~grqc6yv5BN65J=-ZbE2kX$<
zb2oM!#$*v<w)F@D2*iOi@duZ~q0_&ZUHh|9Ut?9PJ45Kt0De2;#cYVtv>6qQT!KwW
zzo0j&Yw_BnL2P0-b#DMW?)rio7y%-ED8!O6O&xbQTug~TIj-10fBov{pnuWpuCFnj
z`!r6_<}|*+Hi7IQq~kRLGPsSs2pgG1-ujvw2UCC8Us&D~5=cK2kKrsCrZ@1wpKz=Q
zb3Al=!$lYj{vPe6A4vllw6X<FTo4IGT5q<PYQo0D_y%J%#a`c^`LXX#{NDhdM*j5-
zx(SSDc{5r}=k_}DMR*DH32$+cdJe_B(3yfva$vIg(Ul|NW}q_lTL#kr5NC+TuY`K%
zSE1*Q92|6K9E48HzbW<uv;>c)$c9&*Lu2Y9moa@A7IO>mJ$-|g0O<Of^T;^}<{0L}
zq30XV0B-;Hg+FS*VloW<>HCH=^M+m&xgkbzAG(Xk<FXXsec%xgAT@HfGg^c=z_I6s
zqu_eBi7(9|UPJHzeJ}e=T4TH{tkOV|#NJTF9${pmqi>B)BDVoN_!9}B{U{2CK1D3K
zoCE_5;1K}4o7kvziDX8~;1`217e~*Tynq`<)>yzGdJzoiB=+YMAOaNsDsqM}4n{<j
z$ensJI1K`WLG*`#cf&w1>Ib$1gob}3j`{&&#D)Lj>%h5oZzFCsS`4oUfK>J{Ha|x6
z2!PeYC-iE=*>^_FX~GX!fXB!s1W_;zFs6U(g2*3X^N6M9RRZHU#DJR$<|Muf7ME85
zA_A15s}F!sqs7n*AE<VSvAOHWaEcfd`Cq}jqD~n!!I5ty1bhHv5iO=Lx(^6%&mCUj
z_(1nUZx&A!a^8(M1PSHLgOFq=a%(a{RGg?f(9-hM31%A5r58seiz(s@kds=BeZUTR
zW)m9z9R*8+1j&166b5r7V3SiJ#8-YKkdO+|RWKQ;7%NwP?6{XeWB37ck^4RNL!^@Q
zQsjUarMg8STP&T)&m4SDQ-?VF*q^<1FFlM76A(uM^@XLdUO4DuJg!;-I<7Mam{xBM
zE<X<!o|?A2bkLG854|~Hu}P0)nSf!0Ve12hU>?@$I3>MzFi_kfe(Su8l%R8P@l*X6
z1i@r&Z4JQ!SEx=L@JJI6Z-m~2CKB;tX1?>3$xL@sbgt1~i&(>fb)uO&hvAA5n)DSU
z)Z~^LcIH=ZlxdKK8ocbonyC6<${2dbf(Diwwb}sHF)&z)>c;5eyPTB2G^P9-#vyWM
z6Ms4g8V)U>i|G{8ak#UQImDU8d+iaD$DqIoEQr8$DB5Yxid@mNOXLJ{HPKf@1+cKo
zV}QYr5D=jP)bOxGFvI6hgoihrBV!>=U~Sspn}SLNJEja!BKq2ouWT^h5Z6!xf#xnt
zx#zq#1O8W@J16pD<SOd6XqQp89uu178T7v8)I{b<J6>2vk^~_Jl7i+VckChKXe@XE
z)BqnFO4}L(Pt7*ZQ{oFzOO`jJE3WG-l8nV2m{Tq3B)<s`bwVv=CVLuuM$<jYhzn93
z1PQ4h$-vV>GO~z|OA#N$^NILy&b=v!WYh~#?N-o{TS@y+GYzX*7inSa{8Bwos<Tmz
zl;Sm1iqks318O|9-f-RlhfwgW$o~z4_<3V53|TV=0Wye9<$n#8|DRgF6i?nubMjsm
zPF_~4X!e#&N9R>A3*unr4=EQ8up$gEvYE4(`M)ldzTo&Hn3$MkC)_Mjn=~gCf)q^(
z)K?&j<4yydHlx(0g#~tg;-yz=yYiM+)Q)&okzSFSb2#V`Mv9yTvki=m$UPc@PJra+
z4)<r!972-S!Hr|!e&h)C#JidMvRtHBG*)L}Nuw{BHSK_Bm9vnYnO62aQy9yFNnLfE
z6WGAPfRT#E^hwm->nqqy5{aicKuXX_luV@*qoP66SVj}$wDLL<P^h-zCA~j`X=vd8
zoeSHA022-=&UYTwH#VM`>k2#ptPf3T0n_0vqpl}VL{pOUG5IV@a6o?Z!ob)kJRW(;
z4=s}lm;~F}i00l97<FjU(_zH`b=uby>Q9y(f`fa7>(GyB4KXW`5W+Q@h&+Z#MiM+}
zRzVf&4c}fN=|B>+W38_{XQ+H&MOI`pbjBlwz9<OBW76_qHy!&E(QOnoTKyFFQ20DY
z_I*f8VDDg#aS-u$K*tPYN1av3;;i_0_UoScqwgb}^rK6Dq(>jK@IbS%p_q|!oYq%Z
zk|XykwHx;kykXEQ{J>KJ*dreIuGOG?rR!d~??eemrpbsGnZOyl7>+m!cqxKWy~S2$
zUxBha9Fn+F;zx@CRN_KvlYkJiQAQ0EVrJD)UoDJ03o(0`|4w>}2r87h4^*$l-$_s1
zl=3Kvhw-GIX_Vi7l(j3r8WHm#NR-c!X8J*LD3o81=%DG_^Zu*-A4^syCHl+-NUu$0
zr{w9wz5m>E@_*OQozDN|K<{!0+q>J@aM=~WlJo!0_Esx%{*PX%pU?k4#i#iEUygiV
z9vt+~{(5pydIgX#s|(Akqm!fa+UDkF-TA%W|9-!}fBN#Q-+!M!a~0m2deb1h?b8mb
zkDL4(50A!dZ{6Xq3()rp-a=gucj|?8u|&b!$osWFjN<k8j_oaqPTjlXqmx65AHFU{
z$9VKsv(|H_L0z`)hi-&h>Iii%JokA5nieQxVF>Cx@7>3X$wWP2>5q}rrvb*WFQFAR
zu;xZnKnfODP(Nx99ym{)JaHay@dx$2B<=e8+WTd2g%%az_DL|%KUX1aIDUh*Yj0JA
zmK6Syg32?SjcWbA-`VN)`*qAxmpr_IXP~(C>vA5B8Vmd%6~7_qwy<bJ38E{2^Cl^P
z^ZAe}rtz3uW3L2(OpR#nhFAv^>?Tj)*_Gf>PGjL@8;zkHFoE;sao~>dKj$C({S5D}
zh;&98lTz-$*|4kyf{IPhms}ewqGtod#KYSmJFDPpx*S@@1@Bet?tR!5fC>wnY#d$M
zbg@<jdbThxY}W8Z3#S#``9(PX*Pi<p_h3jL&|z`=0^{Z5i5l*Dac46DO+IiupEf9T
zG-d=bm*C~CO@>*kBZDE(4H5y)#xs7wUqakj(~AaS!^QC%yw@SExf}!7<frWve6xUV
z!GxGCkZmDBaFYX{W13xm_?C{yNRigiG`aBmAb97g<7*@X!9^t)3m_!(yxn!^Zj;8=
z87%w>Y<?QJF}U_*2N4Jz9auWP!uwZuB$<E_*3@$W&}BedDBMUwuVABac?;CQ_pfKt
z&t&}4gV!J&XD<A3CrNFebn7UF{?f4}f<SmoEq9E25ydjhC@hN!=b8H!njubt-O(9!
z=GvXbd=!#~h1(+sxOnW*iS>L!yX(Mwmco~MCG&P3di`kF$A<cX7@(kD22qS}2|M+g
z2)V$%5ttzct)Ji}BJP7WIh1+vf|YBphEifRA&V)YRLYE6WwBV-t8ek5sg||9L~tyv
zqn0c~n!GQiK%S_7C>o^uQ;h~`y78U=`}Mpk_ww-M@O1zDP*l0I8fSHhu3$P##zrIO
z?_x$<)klw=$z>mpPU|X(N!B_cN%le+SCk-kLT?@>nNJj3fB9w7;Fn+aV_m|?0Fxd+
zEScniVJO7HCa4<Tro}~#IFH<h&ht{NuW3}O>Pdol@$}jgfM)tFq7q1g#e@<#Z9Gd6
zO11sPGTkrTb}@S>jbpDU4;Z78<mNGR@e~e<k)1~m3QwxksFaR}3<z_LJ83K%nvXyn
zr7Y!%BjW-i1gK?lvfY6-Y;woK9F=Hqn-Jd3@XDQCRwsW#_7&#EV<S-;p0a(bj=0Cp
zi_r7FJ$v53wQ`6T{GdlHV$u$}n{8R~>Bt*T32~Wa5TIvp%Z}=TQX^pL{Q;CPSc~z9
znv?_AIoLmgg*ljSG6s(geE0;mhUcTHtY19g@J>E6+wdI@r>LiR9N5PN6|nEaLfnt8
z-FfYyRB0dtyiJ<a5jqWzOdxoX05lS<uR5-B9+?_fg^wOz)at6wF=K{3@^0pIjV(hz
z@*=!KDVlZBVu;rq{b^9nAY<2`fL_y27)6OVv;qK<3w42TWyDReQ)vtZzj|iwG1R9?
z1*2ItAjkrVK+WXN!*aSZCaed5dszr{zHNZ8kK`SOkG03o1NcuIz%te7=;ZuE)uR>k
ztpY$RivF<|53l;}X!LPqzYtcqK^g@<fQAh=K>4^=UE~$_Ct3{tIsJi#KSqBL^gm~O
zW*=pIg7BZyogn-ey}9{kb?2t2Kjn9JxzqTPYr8w$|EMQ@^`t-YhLb{9kn;PVX1CSu
zX6}Esdt0r~_dlQFQ+)sP{P5to-0?$|NW3t<!3=_%SI?9?ME{4QlTMosP*e%@LI|!S
zDwI5aFpb`cLKHuiBA^$=p-WyKcmSi|^}6_*j%1Es_P^hM{`?ekA#yYL@xm|&otKhz
zl8)s#rDNnQ$k^$o*LB{(HsmtmDts)W&Qx;1pBb<hL@f16JrxS+8mfE(n7=6ani$b-
z^cZv|cbXvwy};C%>iO9D!nl{1xx<MZB^i%rE}AOzhZEnM#dzDmJuyMTe`s1DP}6YF
z{(9CYW1Gwo)yb(m&h%E7cak!hZl})8uzWE0X4w<4<aUI?qfFbMjY71aQR9Y&Kt{6&
z22XIQVfuk4#SR;wD=@HqOx`1aSr9v96psh6`}@?aQ;QaJ%#1x^lVM%MjqB=GC>eLv
zcD|b?kr#d-1lA?=`?*-2WQW_o1SzTqJ2fF+pY<<JUhE&8_TkrGGVKM?W3q3~wwDI+
z^7!c6gTDOu?)B>|lnCwT3UP+{Gz)ADiZ<}s=jO9C65s8Ae+W1neAnOq_U!fX1?ax#
zN3RYus7&4A)nojpZ$MJhhySE;faR8iiSc~mPyIL&F~kFR^fzb?ZDbIf;w1fWjlR-b
z)rQndUL@7jv$a|+LY=%H*J}wZ=h-u-Rj*sHjYlAI7%Sr$ZVYn|g@epT6Mv8|Hj8u5
z086vy!FU{baWFPIpdQJV1F!D9u#Uaq&OEHuYP_ecQx5NqXHvx4DYSUXB7x7M^ur-S
zG*^aKX9xZ74^LCf!`)U#$k4laOq*3kY|rS!oBi|eh}x}YyK4^4`SZim)BcO2<HM8J
zPTP3X@1wI(zYkwtT$~)7AH6>5_pNMt);~QwJ3l=-IA`7z03jN0`@<LjsILicqVtv?
zktOl98_ux*a>fNZRp_x9Ht=igO*8I%U!ntwdpUJg#oCAgJ#o6byS+LROjFDG2E$l1
z*U>D|A0ma;{b(?8XK!nmzjsLYx}r_ihPaXb>gV_?yr|$G&R29}`eo62w3vZ-WJ!=6
z>G5zDPk5r0sGgrK#Qw!TclZDHXA{hi-FKIIfG^Ykdt2LC`!6W)S^xhOpC$g^yf;4U
z?=SZNH;Yzt@J_@SauOYpt{aZXcy<&=qZw|j@o&TQQif;AuZE-Svz^4Hmt^4(9j(I{
zF965>Wgn~5mG6KPyz|2GB)B&0yB)XLaNL$*V|>Ks9_}11hS;D)Io3qZ*adCUn~~pR
z4R-90VdDX!k?gg}3Im`M6fRS5IJl?rrk-xwAxF-d+j5>gb!1)vonWsIwc7Q>HIu+F
zU|4%DF}M3La3@|gB;R0d+T_m2s(gl+0+6YPXUl#xC1Y&9RKe@H$idCg2B}J9ES~uP
zvH^6~q22TVcbksB;i3!8MXy_Xn2g89vt$?=$^!88@Ob~n!{=!IGYZ&*sD)sf&ex9V
zh>fO2G-gZ_w@G$knqE(>#G*2IfUL@~g%dXMr%X{S`5w=W<x1#_(#w?6o;?I^;p1$#
zmF;J)-*xQ|pK|&^^}WXIooZ(q-(aVR)b{rAt(}4uh?S?6omB6|h&|UjHVpG5-I>L#
zygQ;*=({mJ0pDkZ0oi33^Bv~F(3@122dpvTe*ZVGR1hfV9|G^7!sep4_V7yCc>z0k
zpn$&fjMkU{;ywkkfxT7c0hA*R(8rx<Oq)jPAJ5Puq3VXrUvDH1Pvo1;?ywX8@(O)0
zrf4u0jAPo>swq9<AQi5%4<H8;GV<|aapItEU~?I_AuZQF)wHewFyOo6{nMAQSvop7
zINm=yb2ik7{MkXa-EeBz0#Kj!+g$94)7<-anyPoDilzs50f}<|vl8ZD!WPFr?Em%5
zyu4JCk<OSdy;z`nqZ&?Cv1cYGJjAmYkT1bJ?z5LuM0a)#_V%U#4Prnj{xm*1De<mH
z`%%LdHF0wnA06del=Zx0#~Jbk!_yUb$P?12Dj^JL!JfPERfGMLR1}3-;9M@;(1mFR
zL=3%4H`HLRK#)$*Y?BNPFl+%@9iW>I#V}BA(g7YY`9n|KpqVqZ50gkd1EsxX$M{*T
z>Z5F}?xg>R=sHv(@RNMX_5aTHcC(q$|GTYj_p|>0DL%#e|LOVZ;bE!TuS%3^`z*5W
zCFoPg9&6EPSwUL;hZ9`#qh)0UoEVXl79D~JxnYO*j43%vGS{C3;v!BKzZm3Y0xUFN
zgrEUX`~$-U76sJQi(T@iCNm}20g&q|IY*-GNjxuu>lq(ID>Tt)7yf_0A2tMjY{q)H
z0<{A~BpySfgDzS#5AX<;HUcvKJlZGU9ewN6YOM?Bn{Qy9dfCU5Pmoh@&QHJY)a$TR
zsaueGx(QTAsfA??976*D<IVod!!(2{*qwb#Nbxnyh5<5*jrR@~cw7~d!QPZ@j{)nO
zr%tPB93l$GA0EB@?%Zjil8`Ol=@k`k+lp_si;8!W<2k<2x|l_aIa=2Pi_EM<dFO}m
z0``2caRv=BA|k299eRHeVdx0ZoQ5$P+K<Tw*NYP79_Ju<pk9vD_V7B&QV4kg)tQ(5
zgTtd^=o9e5S*}CJhx;%32d`hf*~b%Au|dYs@aWbB7gFs+EFK%P$*pB{5zt=_{|W-=
z`~Bmi=fH*wbw*ro)z`DO$1E<;{lD)`Fs@nVLA<wKR5I~Hn`1mN&^||dxJcKy<nLIt
zfi!&2keo+#iq4e;df<XsM1vI7+d>rW#LYoO<^f5kjcb1d@`3^ekjK00&txn}>+pCK
zJr+=0j`a=a1;zxqA@6hy5&~O>UUvi7fv!H~7@CApcgMy-?0ioa3n^w|cM2aCjGKnY
zF?NiIChkBGAdv<<_Lep)tjfW5iekUeubU?ffzL&r2po<;@Pr`gqM+%@$GMS@<H^VQ
zX>)V)m*gk@0|f`7ZyCck@%o5-HXNP2;^ujD`MVxY9k`B5M!x~xT#&w^JGD`2Af=!K
zTnM#hDq)1Vv$7}&Bh8=uE6bd!47&{`g6yq#OGA^2Hzsk#(6I=sZDs<@Fg5hncQIW|
z=<3)ID<xn<7k2Ft$JLQgW3YZj^I%4jB4)<KW^<8kaF^o8nP7XVZYm;VyKfDaf>NW;
z0aMaMktqR8>qZo{%Oqm-Q}dV2Wc|?6Oyuq}kn3w%NwF3NLHv^}dRl-#HY?VD(F~TE
z`_*e}HeqGt3^q&bRzyQVLAxkaNFehcHo>va-d3QxdprQpTRn~lCBJMsM+`L?ZXRlk
zID(htBmbQb$`anGQ<w(UbP(1ovw$|(rHQZ#L1)2<9U?Re+C*h=I~4K}Be#llL0G~g
zI0$m|!(JMxS&$yMUtoLtdw$5CKE*NnT~oGUu1{Yl3-0^W3Y=7Ko0T88i>g0vzi*^V
zns5J9Sg)wrP6}A3u-Q(g*-on24j{~@0!7sywX+q<0VaBrfG_J;k%mI!=3IGro@H`2
z9lXo*@~&k)1%XRn8g$a&V4xXtSxRDAWagvusAfE3u@Kkw>0raraMe*DKtt&s&YXNj
z=h1&1p7&o}obP{oe3*NmLnE2k8V!1M7c|U@HZ+p=1{xGv#w5U~yy-mktkf7SBgd!=
z5yG?*A}0N;^e98bD3CwQgyQRj6PF!%crcndGfs0{a{86WE%Rg&1aBAf{*@bMucb0f
zOa@5&OoA@yAAC{8Rt>Pk3cs`LCS{6#)4DeGBV1&078IPyX;2340JN5Bf)3`?3hcmR
z67^4=zg^T?b?Y9^2q5gpf{iDaDM4(CvW?a+o2uLfOQO=USTNPd)Q#RsD+<32N2>~J
zNq4Xy6#Cy<O=GX>;>NRuP?hlmDliY}HT#Gc(2!@P5O9cb#QGy2oyhxBcmD52NktoF
zv_wRD_RJvSL#3Y_od4KAIoLn=?vMyuO2aH4MvFm?4T13$lGK^|B4&y{^hcA>tPoxK
z<G75+EEKeXE@H_7hBRodXst1+r`S_M7_hI~r5976Yd-u*#KRNklux%|Kljd^EKu)q
z2HurB8MC*&Y#b^67?uD@nB41X*MI(CJWF-rJ(6IKt}_H7!iVT=QmL-8lIRQstC0bw
zLp+0i$1DG0KEhLQd@=Q4U&%LP{!DEvlYqAwP^u49k91ER$e6t2zc9$L4?9~NObW?G
z!IK?t^Kvsy7XMvDM8Mdy$_#XnZ8ae>Z<o<+$PX5>9pNB!%1x1@5>U8Pa%6T#SzsJ8
zLT>3m^UF}rxyEY;7-|YFi+2#L25Vz9%Mrl}YXGfQ$YOoOt$eMrEXnYPm$3BOlrk+#
z&Rxvw!g=i>RNi<d8}3F@nT6S(Gxu!H6ZK&K;J+`9P7h1POtLw*_ElcP+%Y5%Pqg2a
zEixG%CKktf3oK8x11bswZjXbb<MF5$Sr6DKkc1aYd{rqL;)aMeTCkxZwp6cpr$r&9
zS<5vqY8huNhF$6_*<zk@p@`83tRiACR45h=#(ZN<hcN(PGXr=MT$^zJ*Mw^mYH36s
zrs^A#%{VlvQSY=|V=HOe5(AE>9*03e;%+c;k^2=<8r*Ced0QI>+O=Bpm6`_XBzu)Q
z$lL7B2&L}-njo4tw7MAv-6hHbpZZwYkKft3FIjly*ocvZ)j$tr8ROIKtF=v_)v_k(
z5K4_prr&%6sl!67Jn!TUNtuh2i!+$fX<;J|i}mBI+_A`<l2g-kw~Zy+Dg#B<!4iQD
zC2b_EyhN;sx+RA^30e3X&Qya<3*@3YG`)jlR9MP^<?>tm0(Rxc|JH++Ovdz>W#?ha
z)+HGvdTq3p8y+4s%NSL&q{t2kPUC;?@lb-wIvnOG42)5LN@atfjA2R!!D3Qo7h$B|
z-52?@lA-bd1d~yJ^+BMJ7JHU~G?%&ZS)v-o9SjpS(J}s!f+MmHmXgdOno~?Lq7g#+
z$8tOrcW5-on#v3tlhZ88=m^9t|4JC+aR2PEp1tYG!BA3I{k7Du&O%Jad*vXJPyCmb
zbFp5e2Y7GHSFQCV@zh7)EFQl~>?L@aEbtGmzHIP~^)=zbhpO&U9;@2SC*raEA|ii2
zjKdK5du1?MArS1xl}#&f(0vK0kHTYVUPrQh4CcwLef;kSu?}<1osR&rOIb!V-G!0v
zEIn3PdTjOYbKHt2XnuWG?UpPXmP#b~lS}#^$kAFzFmWRs2_J(#l8L%lfS~sWb&kU8
z<87+XF)`^VP%<+(QGh30kr=nf+H?e~>%1GvYPCdL$|Ei6&Rv#Iq9C6cR=!**Up6zm
zsaDW0=z!rL|8RuqoRe>lPR>kM01Smn>Apf8CK#v*)hQY*rv)NfBLOLW2hk(c27w4z
zqL-yCV<Z=o<U~l*e(28dT+&FhMCQW<<M8qLt$62>r+IcH`GTyHu*uzv(Xg(3H)f10
z9<P7#)FEdfHPp%80ml1_?5*0G_=rT4Al9o|?g|Jmeo||f+_I(CLA>seg3`7s1t?i<
z*M#Am7s?*}iF4d?xLpU@o#QPB;*x~?p7?LQ$!$&3Y~vXf_zCg<WmBW|RAE?Wx1RjC
zk=58!rv#AUghhp+7vu?!&l5`UJ&%SY*FH3K>6<Deu($IN0sh2ge_{V3oxuc8VQFd{
zx1HnD3q=47^Lyo^#JhIq^nU8bLyA(YC7-fUVJDgZpCCaA0?)f?@Q$VBJcxX@cbs8E
zi#b{~wUpOe%HWVL!20mt!C(5v?V4Z5Fwi<4nSD?uZDyjM{GvhONMsd;B@1eggGSm0
zMh7=Sq<rTYOavpo&>E#1Sq$(BhWi`Lh_m$jWgSqFldR=%&DCZ1mI6d*)xed(N;Rqx
zOkKTOXUJYzj}xF(Aqu#36uQC&n)i)yGfUEn=o;a$mI)LmjYdgvDZ3|t?<6VAFnwuR
zp%6Bs^(n`&CWrSwxblW?%_N$LpaTLTWOL#*>$GmNo@ELkwq;{arD39BNt!0KSgz?S
zV;}m}+Jisp?jgB52k7wP>#tc77swQjhR*?JY(>_Kj@GgUDSAaW%uSHSD&V4CNHZ&8
zPE9ioDXZ@vmYKTTVL!1ZM(Y9-Iv&>Qa^YsGQ1B#47AN9SUL`A6-Yk=}#{7QPP-83<
zWnvQRk}Fzr{)Up507{d*`WhiCahx@NC08kV?TlKgYsh)!u3RJ6rx2nVuBYQ*-bLxF
ze6w7MEo?W<_dHkz`!h9V#0(|z;X|ir{P2OwNy6*}1r4o8UCm6UE8SpcNBtwH%@v55
zXS#9$a#zyXrC2%Vn~hez=`t?3{%wg$$G>G{%@CoKs%(5D#M75ilt#n|C4v5FVzQ#l
zeQ0xwrw$X!K+fq%$<SyR%>FK6jwEvjOCYhJao>8%(%;zsOS3M(kI4k+D)5J58&lyz
zO*rY}55IZE^C;|Rmoj*i9NhmixkRrzYZ}YE1g$>*)>OyxKq_-v<(0=6*DQy8v{B6t
zpp?L$N+bD04Ckk~%`F~l`wjb=P^qZA{Ra3xII6JWG{+P}$OI)xShMi(a>X;tRe16P
z&oDobKeaMj>5$fPgs64QGV-w|e@`U4k7=p9{Q=7P7f*R|uc)D8@rJDDiE6qeGK6fJ
z?;{|@o#H>BTb+vkRv`?;lK5}U?shi*!&Vnwe~$m~2|mT~AHLl`JJjJv%ECZo3TEcL
zIwx5drr}kCUH#}0OxA%)Nhl&1e{VcPZ`*>y2^CSHA79P;-i!jrBynhznHL72F-zi(
zEmc#+oH2r8+9zDPi~mkBF7Gz~{dnrmD+honpa1Qx?QSmqOQ-pH{(q8B$^1V$f3^Rn
zeCDen<q=>)n4x_M)Lb5n1<lJBu|HWgz>D@sOuURRU=#BxMGj6vw2M~}<Gz+WIDUQd
zlHyXla&P?UVk))C$bT3t_<p_pKTtus{c8V5_;#k<$Pv`>{<rx2^zh}G^DG+}V+rh$
z2fds65&~u_B}4C$9K6w?8g(lbG&t!{8lANa8lq~i)OO<LExSgfx1;D?0fAIF5Q!u#
z<uirX64$95q<SVw4Q*+V4wqrDn5P1SBz0e&zP@<VKM~;B@pis;I`u3r=_>4}Zv|LZ
z6Ocap3sld)*=W_(8O!s)iGnF+@^mM+kx!{WF}&Eozf^wyI5hA={G+ZtjBVz)5}<|x
zd$`UZT*TzT1Z9SvgX^M;8B6j0qJa)an39xykW`jcG-z<f<ETGb)ao2vkm3rq|EJ?%
zp!JA6x{{_aR1bQth+`6ScY1U<)K9*<m@mQL4=Hc~3n*%>sQ@r~WNAS00Ew~@jyO9j
zBI!DpKKh}hLlvZkUK+rr+l0nhZAQCHxg-)RFMbB&Uodoa@yD=@x{O{iz8J}gqcIFA
z78FN5pb&BP4y;>xz{vNHn<oC!fx=D}0clkOQV6#YaQn`HEss=V#m#l@vpKpyEJdRb
zkM5_yqZ~EOhx<{qm{P2jR1gmpl4DlLrg?@$a20s6)jvM`{_r?Iu?kqX08G0GOs%ZB
z%$zltyQrN`#dg|D+G#Ior(3a|&XRUIOWN70*iLszJ6+w5aFS99idhCFF$eX?uK;>+
zK+P*F=L;5%Z=TwPY<|T^%knY?DXL3JI_wp*iUvn$sg5oN=Uxrv_FYkK-yh1Bb-4`X
z&RtRN+#kx_)llx<73J>zp}e&k%3F6ud8-&@Gb+ymGc1oNn5fS`FjO(SERZ0HDz3E(
zGSA-a0}gbnjg6=C1vP*Xw`f(F<*D{WA{ylP0^F4|=V#?gU(1vHac=ikPs)GoeDQ^)
z&Y$vi1c&c}Yv^9sV1r!NmeB;4A|2AodWjjt{Gr0~=;Xy~_~+>SX#W@ho}wP@4#NN=
z2_rz!m>smo83rR;@5DkFG{j4ECl^W^qjReQBD`}$3O_J(qalZUptd3!12H>xM<ZXN
z{11aD=74XoX<mes2mm)4q||c`(KvK{ioJ~HP(Fn(SNmgsHV*L0fda0fmGhpl86i98
zY2;1bc@YIRrD(}9+D5yWW7VoQBz<1nTF<`B5mJ^bmBt%(1~aAQCw6M|sA1%B#A3{$
z>4KRxQR^hIFDX(ZoUhkZUfOK!R$=Y7QM;gWyRdR+dF4)F<!(~hX*GlvHd6d<kZbMt
z=KF^Evw%!o$X23Ns8<+uZ57*v6%&wDu|%URMypc@y}cCrox9X6tk}snT8vlWu1!}h
zM$BRkxz4g5&#*J<7@1I5mCMYc^lfe@SfG;{>yc#(lbqmuyvfh1YPw)yFH91tbAB6*
zGEpf-LZ+i{zNQ3foFGEQ*!(I|sxz9qNVIu34BgvAt7Zd5aXX+#ea^+UxBfoeQk;*E
zY07Ga$Z>Fq>u)xYqn7MWjZRVMd}0v9aWIwWODRl<K#3=5R*_GK))bv!=3!P047-DS
zN<CsmBqfo}hGWfZT(lD7+?tg5x>ZjCcH-)S%N5(~OJn$u66bpCS0i1))ii)UQpg`#
zu#7I!3do%Ya_GRHb>&f$Cbue(TfV+-sj!{}46|lC$10?bqBxh^E9b@c>Gc^XNxo_3
zL$u_rrC0Gs1N@>hpv=VJB3(79MHTQ{L&9&`p^+WJ*q>nT7=bJW@mH<5YJJaofhR@B
zi^*gqObj=}9G?na;UxybdFoJk^z5UNm0!YhzigV*PvYokJi<$=j=z2)Xuq(5_<8Dt
z7IAlciMfLjUU~HKRWlvE2H~-5l9;^+ran#%GA2hG@+RAmD@27w67z916cVKTU)a})
za~!4ZRyeuQdfI5H$RW=h3$e~wfhiJ3AWW2C1A>{<yxdEyp7G8h>7p_n(gPM3p21?N
zWKh(YNFTqbU7}lP5<3ndJuE!vtrwc7D3<<6lz4PGUyU%z-X}Lg4M)vOXmJG+&Y{f1
z3=xs8jF~jIGBE+f|Cpis%4?v>79n!EXLi55gC%Rzn=qKWml$l0=O3qEf$h#LlGw-#
z_8Q|W6y;7QbCRY|;>&^aN6*MsdPd5Emdr>TO6&&@^IFA0SW6E>T1@#F$@I0OhH1?h
zsI|Kf)!NE~wPp<0nvl+rK5K)}bKlat_e%IA;s(ZNJYGD3r3038UiX36(6MJvb(F94
zM3jh}YJnIp(u>P#6LRX$`f5@N$>dRfwk=y%c(5_`QriEA)s3e)Hle>88+%MA0W!H{
zd&s#L_L*IunnxY!gQOaR{#y0|Egrx`en@>QBT2x@3^U<q3pC)+95QucG~F|<JX3M#
z)bo0+rm6UhW!|41{X}K(qUTSLO`xS(zTXA6hulZS-Ub5SJhd>Xg&;|IyISj*u5t}1
zI!vssl80ufjNC)x@t&-`>4Lxs#}_gM^xO1fZOvrxnVu)46t7X91tHwE8)4YVp-M%L
zG1Y<5=&qLMj41a~kM<taEJ(>koK9vH;IDKwsvvdc0^K>s1P_-kyv#;v=ede_aUMLW
zIP-4M8elLnl1@@iEI@n_;`K31x`0xw4?VoASM`F~2I)vDGr$_F;d){K%s!qSiv0ZA
z5NmlhHASGV_)O3Cg4g;Lj#u*hX<86e89V(_%c#t%rJ&bEAETAxYm9oKV(-dbyvbB5
zb_Iqw;S-_ivnJ)7L=*F=Nsdx2Bk4^}L3K2gvK1|vONlfB74@Mp2eo)8S)TY9OeSa|
zboX>(L6*RZaysQFKF+Jdu!0wwafl?;!T?7IR(1TE>cXCpdoZt?r)X!gNox6vaQVY&
zXsmuqm%T`{RP}99nq;PynbL1^TBWfE6aKB2t%iPXsgv!~WzkZU(P@5R?97oA2%6H*
z)L{Csex?UynYskUe%aH!!W>`51}PlG7nkRNFRQ)Lc=MM8%UY%nbwi&l;w9Db>b$9Z
z6LLF~l!Ba@#HE`XV!%(dy;+mURCIbUS9*HYZO<p#^=Q0sVDwI1A+f58t?PgAo@n{5
z@BTMMnil`6`=WxuT)XRVs*nl^pby_ZeUYJZ$rh^UWU$;lL~2yBQ@@k_cgmu7xsCA>
z|Bv=|b1Uor(do25+kbzGPqF>?{^{Y#e*gThZ<e@!q|2Fx#>usWGGg{;w5>_(m<_XR
z!)BQccQFGbE4=4NCx69k$jMz)rnI)%HJ`Kj@N;kMVi^9BH*{~=)|Ju_z^28IJXrNc
zX>-!&N2lk1?LR*}*oP+1;LD5si{taPzdf(Dny`^+0mCL}yt???-<B3mrzU$x5i9)R
zTeR_wuRYB04M;gdj9rpJh2Wl?A07PVtpDclw14sD`TqIg8iLK;5AmEN7d`TCiE>Xs
zGqBbn%INa^tEj9hRrEeiwH+6=OZk1!xi2!lo0nc5@D2(`*!c|Si#~&!ViKa63nR!|
zHwQJehQm=p*t#*8^Xdj7meRK4E)}o!)E(3#(0}myLtiwpDaB|J;@%hZlo(KS=X3Za
zVWSopM@DD3<2e68lCYAZ>xDihSDQ~3WS*WuSlp8cWp(?MDkT^hAM6$t>d&ukiweRz
z+~6Q$`>_AU4Yp39jqOGXbu>30qdR@7QB`&`kB<gp;M2yYiUwoiPZ6!BPN&jfSm2m6
zA~>1WocxDM<!F>E)O8T0?{3j;K&9%Au3SDTnYo*M(U!*unNiI{n0g0qE=175f8QP-
zKCeydYc==>H`?X>soUWwSz#r8`TCxcxF6_@cBl0}jz-m2{|f$}&31PEZ?=1%*Z)uP
zDPI52&z@IU{moLzvdD$--NEtU{)w^|Y3Eig<fMrH&94&VARbAq<K!)ECTou*87Nkz
zq(!hdi0kYFx>r7Z43z(!JUQ?7xtspaA#|tFyWxlH|1j^n-JJg4-u^uQKgFj+|L54p
zug<<dDA)f}<#a)LjHX_-&CN~N>h}BJ@59>l@~q!~pV#yhPf>cXKAHRULvP~Vc%z2>
ztve(ig@U(G*Mrr!xGt6`cpG`Y_J>gnih=E|sizJ>l~9E+oqE5S5@c8CH(|bRnXk!5
z)qLAF-}d`3-+J9tfetmUNlTG(=x|R8jWJDH&5ATAg>>A|#~gALPWoFn41F)Garz^W
zmOOH!TK^Rc)2lj07)d|sbve!=e064?hsnO30Yf2$4-KksV~Wg*H&QZu$??)Oz=Qgd
zk>&%DSM<g}56?p|lT;eVqaSyACXx<5{88a}v(wArNV+~EDg&It?5Q0yDY^u+l)?S;
z0F#KlodwtA+==d&pm@ffz>f$8y1tuF+!%gL=?TuD%?C+BCi_smw@fjZi7+Mqa`?P|
zdidrPuZ{4Cww_`g=gTi0d4XU1aSqPG>yv~1^P1am26Y|zeE)~k^K6~$dmuIdAC%&F
zvj6I^Mxh^Y`_OPSx@kPb#mOjWfpvEA;>FRAy2tg>hBJi|H>z~Qg*E#Lt`*wpH=Ugd
zrCLs_SD{$DLYa=!>#pY|^~=MP!_)oqLy^>HHIy(77EXQso{;3{tQMwh$bVj6Tgq?9
zXnSI4tC;W0FO!D8{1W6>VuG$Arv)08)UV9sKqe@$3MpvBdE_?K;Fd_kReFXe+U~|P
z)y1EyOEl^2QV}idS$!{S*R8KKv3rDzCgOX8iiHHl6(UPePJfW1Xelj)nD`LW2{e|G
z^&`+nR&)z}WL)sff7wXZ5&Jz8zol}&Dt@X)4!=r+WaE18hSLC49;ak{R$%@VcNNL&
z{t+twunTzWjSdB^hH_m|#H~G)k!VyH2*8rUJy)U*Zu+v+L7y`>^b#svd+yunENw9K
zBkyMJp)->ZaO6ek{9451(PD__S^a5HPUf-ePZoe+LhdS}#-m`~+AC-&9X0ZM)!>g-
zgfGO{tB8IuNjFf1p$>Q?HD5Wz3Kp)y1i$q?L%vXJPaUsru2U)7XZ<uCqMgcV(xK!a
z_6K--Suku^oxoXfVpn2aSZrZ4@P}t!(5rv&C@l)-UBDY;oOKQ;{!tR^l{y1T_SBul
zpzo54P9kVln7$ZkRXV5mNq5iah>5JyKi11MA>hU;+R)GIcT=KPmGfgS9$xj`(P)JQ
zdG+=9&T@W#H2Q?1zL-GKV(?K3^!Sm19(qK>hRnHk!x_ctnR%C-y*n_%Oa*f<bZ3~`
z2RFR9i(5pF9}57Cv=IRdyTe#qpF;ogDo$pGQ$trHJd8wFPG>{Gt8X%d#|A?E{ycOq
zr)~`~f-QD!zKE{s_2Tz(nefEvwz@qon45$}oY!zRh-f^atgQ$0q;Yd#E3^CT5615M
z7`{~Vw_^C!`TUOb2*N)WIbMhVOlsWx(a7;*aDVhza=m9BsDA7liaVYEt0#T+L<NKG
z4{Y}VOYZ-=on9+_{@-bCwY#6s|3Ag2`21gmJN>rw^xrI18nTgs9#gDFO4Jhs=qxbf
zTX>Edf{Uz+m+2dPQIAu3;aO~@#kj<Iw9em#1g(#1X^pNDDX4TKDMw#)0y##AeS%a8
zJX2ZcEd^urg(Uzxz1ib5E@)ZAMkCOz85&j&Z>2@2sj>q`?ik~I3_Rncc`=imVTfr`
zS3Hr?*b`pV$pkvzxO$J*o--=gKnoZZzWP0<c7ffD>ZS8%x?J^Bwb3sJpQaz~W$+_F
zLIsTp9)g)PSILJO30)2U9jKtK^kYt~=e`3~9fb|GDF%@84#$o2Ej@MQk%62EX5*P<
zl-4+jlZQ4h>`jhNFOty@4Ux$2xxUGMCkn?jz^6~?9c_zB2+nc387n(l*mc25b&ml8
zXGc*m^d*S80hkNZLMD0Z6#c~QMD1YLb3ltgDoDCh8lpBd)uvG=LF{ob98_c3EX9$T
z<Fl8uq^A@%$MBVl7;}tjA0dnnvxtLKZ71YCea+wWHpK>ql7>X0LqmDj0fl&hk%R~a
z{BSQZYysBCUR-&zG)(mFf9qqKL}gNiqkz#a`zgDjhY#)6I~W?;ELew<yrO@hrw-I*
zVW6W{)1XQM;*{ME79cCAJm5OPftnl7FmG!=z8dLR@u|V8XKk)2Ekddpo^&-mr!3fg
zfpcH((K2RcI&go(k>s*!N?U~iu}B*4r)i86i9-o!Je%u*T~?QfX)}ViRlGM8QyRhY
z%iHwtu~8AVc29a~F6!eXs9Bm2nKPp&T#O`r;=qv^Q>prmV^%56g=8d|@;zFEGnp3n
z;)K&2&*RX@pTOA`lJ7v^$-o_=Wx72b12e>|uOCQ)gNJz-X4)}(@++vukD`7-A}=GE
zGyH3gMVUHnXegh}eR7{W>HieKj0P~ARj>hEX8+%5_p<gsJ=hX_*8e}jr&#|#-ambL
z*gyOcf0o+-W=nFgnMceeQ=1IRYUbimw!pulr~l@Kfr?urpysQCl3(rw)>PC9jeLXB
z0DWipA#ZADK_8O^XWFr(t~6TePyHFgPCs>Tin|k5=}vjGsV0+7CQT|0Fww2+hV>F*
zQ)6sK-1)yRW^a`trSnL&29<cWJC?%EqyIWQ@4vb@N7X7{puD}Qdpqz}Yt^h$(soiz
zMNUe+o`>F?-g=<A(FxCz0av4!f&w$bkFM@eb9ogNF@h>Z#Vfg`>O2g_{a99OnLGNC
zsCZT27+5Fuqg?$wkERg7zeT`8Z#lSS_PiPK^Lde9<?{jle{3LBaOP)zme~JpHM?2=
zzg}zmv;FTU`7HDQJ3BwUI5=N+3YafjAtMZKpq6HY;gkI3d1Gc3Qp-@zqViHAdq&Yx
z#PVn0l``B+7qNG<tPqG}f9fqO_3O%Ma!SiigCM?&Vs9yp(0S1d=_uFgNBBEuQ@@=J
zufkvkD3FsMd8qMdI%D6Ph}-3wP?6};kJr|w@y(t-lRAeT9v(iq#<`IkLQQU+`69ej
zX%J-V=;)KM5!oWF>qt55|EXgf>o|~Xogtu-miOndNZt5Ta+^p0%#6>dGY&BXB_4{Q
zZLi!5yN(0~<)F(1Y2=47;Obri9YBQm6Fm0D@cQrE3FX!?Yotn}fiU1DaNODGaS%G8
zhvgLda?$nM2uX){_NNhbf{}jgoV|Me`uw}I^TRj&6a1Ic6|FIcVI>+?w24cIjx{kR
zHs$Iy&;6K&s)jS+@S~Gkjvj=T-e?{&3f4K~4=@JMnhLn1cP>T*qO-o4ckOud0Dv<+
zFj6(4%YKS}%<v)(_9?lBfkY9gucHM8u}0TSjycY>A9)k^He#1epE4Suqpc2IuG}`U
z%EXI3MER{hXDl$N_R)-Zbm+oNX()G4#!*lwdzWj5H1%Lqr~=v~zC-6v=&AqCkBK@Q
z<(tAFVLT_|RrrF}kRt}FhA$ZgddwsD92lL>l+Y3&n9jT?;#lM`*r7yOCD#C~_jk<5
z9Fi>ck|ER}@F-V}9=9w(o74@(Vv3a2LyGjHs7(NbyUz^>GvKi;44O|i>x>?|zXFYM
zhWymr+*GhQ)T(nxBvvV+6(0<4Db^LtCTF^s#6FBlWFo@$6hdxp2o2W}<&o+e&>6Is
z#gHG<t%ZLT1S6V=bXuk*1P09lK&a=Fgv*g%0ZmAlxNI+GJPT!3Vk}(`prRE7zRr^O
zxxqX<aZ?OLNtU=Dli1Zh;DqqTGnS!`HfOp~SDcR3+1QM*AT9o(R8p@V)sZGTl@~c5
zOx@Wn3l)MwmFYYmo;LuU&{MpX2o>IWfK=32m=amS$iw8v-s?6j@+%EpW)*h^cA|1=
z0A*pG<iwQ78lIq-H{1(loS`_w5F0e%WMjJNp*YZf+sSn12mnAiW-X8#FmZ{QQZrN2
z01q#ruRrB5{KW`u{3amACGnOlK&;?U#Quo0C2%Zb4>)TyVq$q@8YKM5F{5Ejzlx;z
zXhEnUmH9yuq@O^MEAuFcB%m%~=<<VvWQ^GXM!eq9yJTS|(fPzVb5ZoBmd-R1v|O{`
zF*G+7DPZjp{bbqo28{uexDT?9%}m(Btw0y;C_eHAi%as($%?n3=TC&?_txL<Wi$@a
zH8S&6xp^mwf_c?M%7FNOJBKc<a3SYy-~}hXhB@SeWSC()RFiHK8x*>NQYg*m6Il3=
zdK(dlD_W3Hi=jsiJ!Nq?IS?P#()UU#1*uVoR-o)_^xxMj>A+LPk!GlSh=}uU5E&o4
z$zDby=bi5+tQ2kXW4TzHOn@UAdR5iMHox(oZPIRB6~ap*KN^NU$PyQqOwnedp&O1^
zrAs=Xe420#AG1j<gVk*3IL#-hRVm7uy_W*5Cl)GXirHCMb_r>vXn_ng6K?paZO+#p
zk_*MYzEBjW{RYkAX%NP0#i8sP6vc#7aXcm%bf2cwPqhdfyt#0E1QCMR$jK$)G<PWB
z5EAWFPWy1il9L*hBVc0*>_|)R)Q><TO{5eboUE-qQde}`$2@@)^W|qT)Ry_HsdEh6
zPpdJX7)C5e=ok?;T78OY53?V6V-6|_k3CFlS9g(TQbrd~PrWl1Euuw79J!JdE1o<s
z{X!D(s6R4gTs)*g?QV>rB?SLDEGn@vd?j2WN1?w?`mo7RB!pjAbOj~nr1j)({Z~|q
z)%)W9W1W(>1SPx6G1}<Uj;G47(XkmY&ti%ol3#nK#7rI!Ze!0J);FgoFC`EdsfA=|
z0h8Rj(HfTC$j~{RG55$qhcyUZ>Y`O=<8L$_IeeE=S2b#fl4jHcRZ^!j&^j+8eYXZ>
zLm$oh7`oJG^3<E7xT8Iz1N(hE5FYkpRy-L5a^9VUjsj;icVbx+hopI^_3%#Jn=z0y
zDRCZV2e1sjT+}3ULWl;N-5498_j~qTeYTy)Y-aFy<e96RZKJPSHIP3DCKFgaXhG50
zXCq0`gi;Ww`VJE#;i9gVL#<&crH&NQYZUPc2h{!;R)Z*y_Rq05oyWY1*r3Fxqfv-k
zt!VBJ%a~2i$rQ1ogxNqdLM3?5`f9rP?YDwgAuM_5$86B!IjUG2Y#pceGBg>`HV744
z+TF5CbFw*BNqb|p>>F|aR_ItN9u#ho@C$bh58_$V-`IHOP@jscaF?+P7sM*6uc_cn
zCm38fmvNW|48s^+Q|~=WUIoL3V@87<0shhWmb5TY>VI9J-JQ~d1SISY-$qW2)>m0V
z7>&Bx6q5;0q_yZoj|Hvg?<n^GWQZpk4qFzpX%nW}ViuK#a1}#rhVD#`FdUDxBAV`a
zE&<J}ZLer)U#ZH5%$0s5yOk^d@@gUnFcZ&xXRdbK6$}%6EdiO-#>l<lq-MAyL8_u*
z5pH*G=D4V$!5^}{>a@=M$Yn9aG^&pw5=q5UgQv5Asnw99m{}a++*OKi7%VQYv?fWK
zeKF&SxFOU*9;g^u(Qjx4lgMy-&r;lYnd`S@waqkOOt5`rj+jguy}wGNPNI1OOYxAR
zS30-C6>Ih79VFXFi<~7hmjq2JR@@5>#pnho9(1I`nch_LWYAmYBuB@X(OF{ftsnqU
zouMr-K>z9F+oO}zp7&df)g_cc+jvst_?U=Q>O_S%Nw`Y;NMuCd5q{$Z=t6p!oN_GY
zbXe{<7%gFgGvo0&qKeUGEJDeN5ATZl_>*^*3OI-xVCTOtX0#58<{I%vb&O{feCk3c
z2OhIN%B=}V7fDKPjfe+3RX#XR1S9`Ww~oe>DD=qoNr37$M#1$=&P?K~R8vMkJq*yx
zlf$9Edwj@EK^M8L<*~(#o1D+rssGlW4~hRYY_%!{fLmh!)!Xi5<G*#cyPy3(KFMck
z{HKFft4jDME|%OIeiNbK<Gb5uB~hW|!T0;8{LlyzWdvC%@aHmqmKK#*6OQd+X+;Ui
z;n*H7YY}5r<XXgs%UZ;8xfbzZX+?=X;n*JL2uVRK)DJ$g;b(UWAG4+$@E+@IvyUE|
z?$B#yT$%npH7mhP%A&;lv0}tzy@U5rSM*`=C9yb1Jye~Z;1Yd+`>)x^4M((T#T}li
zY2YgdVD4Mmy@(|iY>XFT$F~6R@mIPgyaz}=DykG<brIsWa30|Oz9eTx4Ta7MuY>Td
z3wro$WN{`gpb6mCp9M2UBNZm1s6yRULzQ+crom8W)3pSuaw-0U$F51Wlysxv7+%r;
zI-y;%Z5DOtKQ0(cm53B3vF;p=;@-&mFA^wZ31Oud_d;5gzaFoSE<<-hor@gw1tZH6
zCj!8DtW2>L_-s*oA@U|4O_O|8J(zK#^NBlrn@(=NY8;VD%i<~#M(lw8$iYT(ZGNEW
z`R4@(v2_UBtk$7FSWt{yoA=v`PZPT#+vNTB;S&X*$hBG0i%MZ5Xd_nr(B^LO-{r2f
zVhH#p`~Oa_)yevQb+<p~fB7VzlKAfj`v>10RtW*0F1V6KaxUgOb5^9?mhw^I*(O03
zi6|s8s{j%`KwVKg!wE*2hyw}|kfi*;%a0ivMagYAW||78yn7>kz$XP@q0E!eB1mns
zo~Yd%TYiw82DVDZfD*q#Js-G{PsS4nje^u;sl{B`mrAkdY7yhfZd%z8s-B&rO7Q&X
zjQrNu)@rrHp{s5<#J1}8nx}_HCkOj5PUld&sB*iY@|%m(mmpS7|61H`r=Ti^`(LvI
zQ=_#%h=R!i=s)#mnS4P!j?pBD#kd6Rv?63Cyy~zL>g4SB_4!%<47n3?1+A^MoB5V<
znE+Bit-p!NTjI2-o{SU?BbGOeXz?m}G@`pzcf$Mk(8Zg=fp;6=MH}(c6nSUlxWGQ~
zwa*r->!}+?l_3e)2T$sg7}3d1DE1p`@kSq;!kd0d^D>}dDs;EVFe}gqN2uK-A{pih
zS%UBde}aUU&QX+xOs-gp@{Xis!i!c=R)v3H2<qll6<cw8PV$=jnn@2O?EumT$NOhV
zs-@PJ8e}Q)@}PhA!{Ol@b^YlYhWrV+jayben^7i|2njP{Ixi2L2p-HMvCX@LigcQS
zGk5CVI)(uqS-C6d(5C?nZZyGQZ<AZPw)H~vYQ$4F0PNE^qtK!ICd1IlI&7*-patx-
zcH5Z&6QO6AV3@WSneLgb0VdY5e2KFC;8d$cbpBJzlJ~JgH-eO}vgoCx#Qd|<be>>p
z+tel7`Pp+v$52q&ltQrrJ%ujN<ANA27PS9%c>0>okdO9{kKl*%d-Hwu27kaL#se>v
z*a=1wc{i3hpKns4iR7E6&=gCukfc`4f7&hEo%BEP+^X8f68*2$+s^8L-PULS|4;KN
z*8gzTE?4|i37llk>o?~|uTL=k4Qz+rxgp2wUmLN>NMjAn{wSbVKZae9F_#$1n^QbX
zVIXIw<Po@E{nu9j_wP|KgFiIA;4cLL$rilCf^0iDX;2YWBUf~aMcL*QzQBq)_AlA2
zv{6uFgf&JUo?qQ!r7Cq?th1P@cB)hvU==jGkWLo%V1fl{iC$LnhWd)OB-xVd>ym>-
zjffgb*nm>V<*4o$wzhpv>(+-luo-^GAqXskxc=pWIE#OBpaKI*9K-}dlEf(^h}ZMP
zoZKi*(pQ23kTpZb09Z!~poA=$m)J)1Q%U1rw|?Q)k5pvi$oabpUD3~?L5}RkLylTd
zdvuMNI{L#w62^e<Q3$0+^@haU84iNE`|CntH<(2b&1KH+GUx7Xy||P77bn)LZ7lKs
z-tKi;dHMf2|Jx_|6wCit7w3mRmdbxs;vO8h*~krT*Oz)9N26s$uKgIDCR67ND$NuI
zpLA#JWT9^N(XWRPU>9DD+Dvv|<arsov$yDZ;5uw(mNR9>0(i4ASwv8=k=Qch)==3G
zC}U5m!mf@SAad%ZT9PZ@nK%xTMe>Fl4L#m>&_QBiPMJkTD)4!uH(G!1q+X-@qa}xx
z9IT{@M(LkW++GSOx|rcM1LMu9j4^n8k3?7_e*yGIATvO6!sbj(V?T^y!-11DZ1lgB
zN(0zv4WYwN*i%w!qaRcpEYQ#y9Z1Qzm4@vqn4k#=*OkMS#SFVkd0elrd?Y=E-X5Sw
z4oFv@U`Q3RuY+k2;%4tVmmIo$EISUw>yX>=<H(!97CBf<MpD%!p*{~iI>F^zeBFTV
zmQxe=D5<59lamEB9$n)Bl|{O*>DG_e^mm=}z5m0}NvAD&yZ8tGdvcEXNSim!9_;G@
z)Y<6|7>d|YpEYcDPp7Pc5(lTSYdOG$<?sO4X`=)sq56`tZq-!UEiD9IpY<<JUhE&8
z_OSs@lpaL=#cb^QA#vK80#yj%?9I^$*M#qLe|B7<*8k7mn>My>BniX&Rr(c(oUuun
zltk*VW5s?(mSsmXwxrRKWH!liK@y@6lK=yNI_&uU?QdOu;UFpbn4Mj7CKd_wSzTRS
zRb2<u9F(;>yU)4uSPWQ<X92Z<kjz=oE|23h8^d<*iyiSj1%`???nx%Dg%8*s;j~97
z5Qu&dF6!+|w&={<P0)V&YL)#O5vAfQOpQkV%-F!&AQ%%`k!K|vxbrrmM!sQxNM%)i
zg)a4&Q4Fs%xdF5ijfbStVh1%Kgp@m%tW_CDQib?}qW+CIt8o)z!H&LdD~pVKP!Idg
zLHxzu^Rrh7XqhNk<jQx1N+pR|Fh2|=$^O*J<5uXVyq8;b@<A(vpR2gS-5}~+jQr#+
z`b_{a#!vwOeKZP70rPDCv=PuAareu}*8mM^NFjU`42Rn8rU%>}x(IoxIIOs;8wXu6
z$Uh>x*WO%Pyv-KA#~0zn7ID*I_F+u0!e<O_bpXYlI*4lb;eGQNf~Q{H&e?%(>6oq4
z?$*xf@jq2VwQo+7n>hwmw=?I>oaG)K?z;l>69)OMr}!FuChpWoetxrtQ@;ZRod*mq
ziKTyT4TW4Ad=}jS47ql)<R;%xeKzr*XVT_$czu`on(AkFovLX9*1j;qIZ@a>WA3zc
zZWDK1x!hq_TsMp&yjEA_)TrU10g&+zUv^&XobK2PPfK6({@~<v|4mUH+wdx1tjYh2
zIivPZYik^F8*lL7%ZC#3SvFm({abCo8Eskf^xnUJUk#9k=eADoK77!Y0-pEN{^`Nq
z$%$R5wnQtk)X*=FcMksE0a%>YKg_k2KHc!wXt1AQxOoQdlaBi6^oQfUofpM67=dt3
zA2Xq88=aE)xc$o=Rdt<;N#1>$_5|-VMcMGY#q^rJ-ucge5*j-yxG-fpf*z|HIIQzC
zuTYD17WIK&O~OlbxI(osyVzbZOhWCQWl+JYkE%*NFzVOg1?fJ><@3E|R&zSKHPS{C
zWE6u*a(gCHcO`%6nI9^KrBfCqKj05@AuLM=R9+wWZ)~8029i-e6y_b;0U>ml4`o`_
zOc9*$g!P#flT|WlS=`R5UP>Awpr*t4s(k6{+xhV7l;pbD1R#q)tY`!E5G6;kv|k>;
z-ED~v#+jXnC0F@zTh$#;h#HHpB8lLYT0#0}0v5YQ3TxjdaNPfb0>N7*70OfZKD}x_
zvlI#o3;4JBEE2RIrw<>h`~v(24PJPV$QR&{B)vf4HNV|9?;<rh*mP*C!%b7(3BH>>
zWf(v4>|Bc~-2}d&Ob=`TjMws7Y1c2w3sbp-bHh{729DF;iQ<eWzzt~8H0_Ud7+qjb
z6jbHC%A{h57{iP5%}zlu8ijz?&R{927^Wgi!&8`sWz|5<+~*&<#%E4@DeJT|7$lhg
zP8J36htzT<t5Dpkgl%;FRVzWwbTX3B7g3g=AwIi)zhAo#g`3at_U6hDGjiUAIWVp{
zPt_VoT`@qH`Xm3kq`vbMQ!cFWTIeRmH@B!SxiP4GWS*zq!>69w8|LY@E{WO*<zd#h
z3p+1Vt|C302!sEmFlaLte#CRgmwQ?$$B2V=UF&Utes7X=cz|IvP<3qAp2>P!py3v4
zI2`=(-s_#8_g>Vut)`>ks@QZ%e-8`&antv0@ab+#dUSkvD#u$gp2|5$eV3-$i{!pB
zH56&J%c^IUheQ6f`}d<_RcF2;RbP^>%>iVQr*8{pyV^$rw^Z&o0GMMAvgX!$-yUJ^
zge>!qEr*X^5TW@j+XYI_Q54iE#$K3w$3w}ll2{_N&40e>JT}&Z$`3UbL#k(6c1FgN
zq!&~$aQ2lZM>33ueHECFuj)&#3iC^CcAA|L3^U`QUE;D1Ayd1;sFQdDhF20@yqmzj
ztmw{2uknV{@^vLB*ZFeOT&KY#GFF`eG~QCg73B8(^MIquph1O-l850$(BiQP>(k_~
z9v;bL<{9)cCX{V5n@vo}K$yDXe+7^XG<5*uVI#MTNidEvkTH-rb%%Gg8hdhCS6{IM
za9QU{`H8evawyI4;gB2kFK7+;iSvK@x6l9CTH9<F^MAI!+JAhJ&+Po4J9Fj#-1#(i
zAYIsylPsJW+5V2v_iqyr-wJbIk!nqb&>K&}ekW6B0-Qkbgq0{(&bLBt!uodkMd%MZ
zKkju-c7ND=(RsCZx_fk1H_74L9_tkIO?6n;*V%YJCg{ij&04ADnk{ofN(bSw2$^_;
zd=aNA3bn+9)HzvIY*Xlj2w(*?RN}(LvXq50p)r4^MmnKfKzQ^Q=)1cFBm{7OTmUat
zsk%<GsI%<}LssYxP1xN;k$?UP#Z&`zZuomIf-fmWhJ{aC7+~ExN;p^$xj2)=Q^r=&
zWoLYGV<QWtH~rzp_!m)DdTm7nrBk|(#;CCr7FvZ`C99IcP`suZv)6VLIa)9&;0Z^T
z!zh-LjT18%I%z&B%O}UQ!)Wj;IyGkf_Q+$>YC4bMY!1kqvLD<Hr>Lgl!SP2K$gws<
z=$Y3tvJXG{3#_p+bW*VcF>5YxDSjl8dRZ|i@K?aqFbDazWo6lP-nnREzbzL7>_}rK
z?Ir)#32Y_trJY|?5``tfc@m@-o$$N^!$!8(PL8Zv&4k^|J(j$bnQ&M-m1yerUsoy%
zonP3k=p-6ml?dkQ?S-E*vq=st#zEsoC02G(S9k2BCzgDr?jUeOJmXPErNh=EVyhV}
zkB(o_B@6+Yl_0vX6^FnyW^v5EW5DVnFG_=Fe;}!?$F6K{^w4X?Rq+1bj0t&97CEgi
z!A^FuT8aDie13uAzX`&t{L@rUXHW*R_DuyMXl<lmz=y?o;XN}oYcUyF34S8jDv(oW
z?iLz=>+`*+;(wN1|9T&9x3+a|Y?GL^Zflsvl20KeSZUsUXZIgx`^S58q{k+KzGSFw
z;%vIG;;G^c$?gvwtR%W41u3Pm-FKddABEDIe3+4TSA`k`K-;kfr&5C{o8Dkm32EVp
z=p^KBlJk<?Ed$3V4l>=(SdPjCN33MOOw4VZrt%!d?MDx3bh+e*4Nrwegc5qnj5_=T
zu!sHHwykkVa&L6V;0}J_!oS^mcpUWjBZddWie2mO-`4|<E^uU(Bc?uO#Bl1XK%Uhj
zr+bvLeC>iZbt~<{srWEsjFof1KVk^PB~e@4P9hU<B|Jx0K<xreB^MpyC|MMMfWjFI
z(kX>?*D+<8_gN9AJPG=)BF$1m7~7nVUQgURl)Ele=)Hw^m*^X=)BV^9#1+=!RC)f=
zLGe8Bc5>-56qcj6?~q~?s|f4t#W+sl0a|A(hD_4W>#nr!s&10ebAx~WxoGEw&*OMW
z3k~3Np%nx=B^!4RiQMJVhq5c53d}GFtMJ1mDEd<Jn=<sN*#ElwvYAvV7RN~dG7iv3
zU^{y^vr>C2hC(?7YmtTnt5Wb-Z0kl+Ypf}SkZ8R`@xx2TEq$YCp@x7;i%yy!cCDgQ
zht4pH9LtObepUI?Ei5pz=?sI*V5mU=I~>IA$7n^0RUSTEE-P+>jFteq(a3s~1Y^n<
z1Jj}Cv7{_BZ3t3g!&t;p!4t-qVK$#}%!H>r7y8kOV$2aTq^i?2)o7$pzG{p(QTCXR
zba!e3x2ZFh5f<x8dUb?Ivsu#gQ+3Z*G4~Ji<`>`jw~Up0xBTDnV1Dnfnf||z+MD_K
zuj^ZD>tFSMU*a<*|M%gm=~=(&{ipE#5=~w_ckaxhf!g6K%X-XyOp#@upS?WU|Ia<I
zwT3qJ%2aJ;>4E{QQ&bh(So>~E$Dkmqm4Vg_0vjSs2*>1n@aKbOKOmI`unm}BgOaVp
zgU%%&A=;>UX)quMRB||=XzG01f_xMd9H@L3RGO23!HG6XgW)Acy$gfHPkI-q32Lxc
z!-JIvo=?q5);a1u0Wrv1lFpWJbiZR95uaR{!fO@y1Sg{{_Amv&NsQU!u(g|bLLMnk
zBq|9Mtu4`!xYY2L2ny+d^JUS)`nI>a3P5#=u9O#EQN`Q2;@$G%T`9hvZ@sd8-NS~i
z!tz$JhJMZ!HuDt<W75yL!j=GN2iWf$bR8+j4s7D7jP6fv0vgWHA&Bl)ymrIeXn30q
z6;Wsl))$yqPJrZRUV_;)DH8raVQG384~CdmLK|eZnYS5I;!aH4n4$+9q8Z<_@d#Fy
zRG66q^ot}%MZ8keNQibol*tlP#(8{lcsob?%ux`_AH`P~H6?qHQgB=#Ff?GQK)y|q
zlo8PI9Po-VZVdy>Y0s`v9JZFDH^KlY%q`CHys2wbfE8puMw~o{5{cM8;IgUM-t?EM
zP5zs992ZqUmrOnfB&K)zF=m9!J4&jSQ~k}jN1As=M0yPzB!=kWlpIUga?ppR<xH~P
zkYD2~5jK_pct?{=B^MiMe^87dGXQ8`#YrClhEa6Hy$e$?QUqtx3S;0>kLUniuwpig
zVwxgP<qXZ6$x4y{ZS?=Db8vWS84<tm*3O*Q)+;J1YF4l17E_PgXKw2{_BVEpp+SKk
zvpoPxMgTmvDy-vwvX+|pdkQq+>6>cIL^c@(I;cS4)pR~n<np5culxNZ9MXQk>{*zy
zavKd1)#gF(RooEb6sjIy_?RCt3eyWxqKF7fZl}0)*=@`d?F}Wah}G3RUUcK;f}h<R
z-5@#&-q6!JW3^V%DBNQHlv(eZMnP{`zScRE!A~$<zn77>nq0c;#Dae04>)-yYVT3R
zK}15q9Wil)^9%emlyr=0t+4%m+@a*Bs^7W_)nQqp!Ydtv7(F_i35fLI+IH3M>-JVS
zy;0s3MBkw6Rvk5y)$-FajIGmvFs`UQhEjl<p<rjf8sW#({HDAQF0Nxu$`}hnlWkxH
z%Uw_x31=x;HS{qXP0#~w2M+Wg3CdOhh-zUC7If$CIP?~IbMoUZVJuNrIO)aE1&{>D
zDrH*2{6~}-D3w^|RzQB0!Iiwa1KUW(JB`UrQc-R^GBCR=MmFa}$>SIgGz`NF^fvKz
zjC1Ui_8cBaO?V31Nm8$%-sXftX3<M}H}ZQ)4Er_cQzBmUSj@<OU$rOAA-*rItgI~2
zC@|sTm^T4O`lHb8ybTjEHj%tX>~hP#xk;MQ&`i^O7E;5^(Al(;w`+;mOXtaGJnYCU
zY6Zsxk8&XZ8ql-u<ouU1RudKYmp-Ls^ZYTY7A`4^BkCl^OcCojdM?v_3IOat*Hq4l
zO0um|-FkhH%{e_E6kmhq)`N%oYBi1cB(A|A8>I{}FhhSypLk1VK&1^`+AVnxt?tGA
zvXt3w+T~<1Vg1IH-F$*xmVS+v>I{0^b<~-@fu^7@*tjt-qs*u&vxq1u!>R*SOOQ+C
z0e1xZ{(@WptV#zScbr$iINIUw4qs_H5APXU)aLHTn%2_37yL8lf|4$tx`(aRpir)<
z^qncEgT;nsGY;FSJDe8FXw?UCPOq)ir>j>;%=|Z0to)mN?jHZAGmhior^x@axlxG!
zw%Km4ebxVbiO;O~KSzg$ujdE?B*mtxZ-DW*m|Mj&Z+su-bb$zt;yy={;rL+`9|n$S
zk^~wUO9R9&BgDQ%e!vH=<cfo6wjCbJniHJ|?ai%XxE#F)Fj$WHVTH=EOT5qL^HZUK
ze#v$A8;f7;nrB*IKS!$@ZyEoVI60O%IEqZ5vuj@jL$o7mlJtWnD;b+9c$o7Rt-dB%
z8ukMQAwYIA3`#7a^CrxT*7)da>40_YU|573VtRxDLHy`&cn-?ey?_sD_n}mS;?KtC
zHLTI_)~@@TYyDoY)os|7><durs`*TT*lv04H}5a`1^#WigC33FvONdrRhW8P6Q!A<
zz*(dG)WlQ4pYQX1!^4LU#cyw>v3w&xv+y^4N3kkOn@o6EUs+irCiUZhOlXKn53WHl
z9I_4km48E#gGb$d&_}HfSGvNDf($L{k{$qCY+Z(t(5M4jaXc$g7gAruj+=m4q>Z9%
z99hiLHCIJ8N!x-$6F1NiJVM@{BjSj%Lx}@~o6M^#$y#OEA|(m7S6NRKMAMhJ%==?5
z1fGE=4T6i!HM&;+Xt<c)IouU?P!|0rXR$vMdCNUp=9}BckJ#$n_A;0kYBOhtt+#JG
zxfZ)&IM3RjVl`V+fzv8LN7ZXjt=CqUm{#m{>F#?k|Eyg?Px4DZ1DRfg`V>RN@~)pg
zy?fu5h2!i|%+uby+u&28%D(^s4CpK2UEFX}Azo2@R-v}CIQ(QAd7AUu?TJ;Di&Ht#
zn%6mpIo<y?0_ol2f4{rU_5aNHulPN8|G%;IHUG;O`Amub4b18E@ZVhEllb$D{lTa8
z-cg+jTb#ZVG3JSPLa8h$>x8cZ_hFe6REqoEZW3IEk|&OmRG^L+FS#*<*AwpuM#?|J
zsQ&~+s(x_Izf&~d<o5Z&<cW7i){7**@H793w=-l{2bIhtNXaf*SZrX(rC%K5Fv!rW
z0EN6TMGgA!hP^0_C>um<7fH;u&P8h2U%CJVHhgboumS_@jMH~*v;?JGqDhu|2zyTO
zLCMDlX1L@Cw2hTgzdbQEe6NN@fEmZBpl-ZwXVgGddcg5rk-?u33}_Xo6N+g`qi2zf
z@1;|WrHLVPbvweds|D<gVK{C03$#k|_oT-C#m?d5ryQb{1X@ln(wD1ls~LGylWR7)
z1{PVArE0g+Uk;8C<xePDxE>Y3sLj>xG_aaaw+xerZz%|0Fe)bsGjvZw7eZ*Wm)23O
z;r2P-EZjl<azOL2XMwNURElOHcN?Rz-&2|Gz0BlGq)VPuuQOIoF|QHhpqncOc8G*6
z&V~E+&f_>E<$Qy4?67%oO8ugtY|w9zya>2TDs>71BPK7fL)~HL05B0-LJa|Tg1`J`
zA`D3ph8UD&6Ya6z_nsE)j5ue<;q%w~Kkgr%oe*1iwDW3DjEeB*nz9<gAKR6dv}3XK
zUNk$hCS!n~+KyJ=aKc0HnMe6`bP}ALJuPD=o7CfT)rE)R+HlZ0hlNaP*wXjkx9Uyi
z@pPf|B0MMWh-(liUcX}M&bfA89Uq<@c@Oa^PF5v!x%Qf3SzMc5-sxwMjG-6q?fcT6
zP_i=RVc`8>NWKTNhlWm7FgzKSdPqYpt=L2#ER2sLS76u?Y!);S$MFB@Tj=#a&uRcG
z9IG0NGauAD!q932SS)zIq?x++?3u0(%XVJ@t_H1h<0ZqZ<M`?>IM{;^f%p)+w#>QN
ziLpcq;>j(RkUrh&SUDTGI7gj5RhZ?Xn~RDt8U(dLK7lB&HZ=qgC|zt_mLW-H@6Qhz
z(-G})wQB!gt@h0~@KE7-t{5$u?xCj9X9_|?Lv<>Rt-=VM9_^v%okWwD3`i}&LilYB
z#X@YZ@lcP$9W%g1j~Tu{%p;@K^E<{3F8)y0w6G+7H!qSf*)PEn=}erd_*Xr5RF1{p
zOl&8_S*i>Lu~kcRTkg(O7+uM*q^q$w@u;)fYP)1|6>e%)e?XfjA4!?#+bYwjbP;7f
z6D@Q}AydC1@pH(fY&fpqHZoCYi!gd<mB;<_|Cyf_eoh2m%TUyunAT~o5J_zTOo?1r
zBO1qy<I|j;=$2nQI3+hLj)cp>wy=@!VKz2pI^93`XTC-2=*mXG#XT()L^mvMU%Y^=
zD!m{a+Ndy&uiEsm^Nta*ZaeYRRE_U-cYHdl=S}sTwKXaZyFE@9^RNpW^=`!<{Nrrr
z;PmW`un2;Ch;h{{f~sP7HYbyCYaT)RqOBo=`+xTH&%r4a83k<PvvCR*qd<Ckjb{}+
z0|<Ds+bTHK@@*#sG{5VF2&=8~`tb1YXGdm#Y`ci3j*tR-u0h011Mi*vgWqgtBy*-z
zPy=V5(7AH^c}|_6<yvIZnUZ-sl%^7pb;lic%EYFgSS7-tgA+Iwo5DTQ1ddVWdqEjz
z%r37~P0Qdv?xcj;D7FDbz<x*JC;wG#xU3qyc8kx+L%NmbU?ydgePWhUQ=5N1S1Cie
zD`Tk+^69*#b9PtlvNAkXdmxXdm8@n?pFuxM+0By8VDK}?a^7OZB||j<2zU>%$mB4e
z#Tj$;`Fc;=lTXI%tQGj2XLn$8G{()%<>(rpfXS)ZtSK=#n&EI>VZ~~4G@bXkCEH!f
zUfhDe_)Ofl?ATkg-*cg41tZ|>+=|^^bqv<6fF9N<pTqyMEzJ7NT}dfDG0OKUt+UcL
zW8SXFi@U!Ey-XzoVwE)qHo!bV&<yJs=Yh-TVjNtE7deJJkiH05L`N%k0rLXMccIi!
zI#}yc!61?#rg6eog-AlfSWPwS8FIsb<5o*gRp>7cI?k?ulIWeLV6u)oR8Z$iXNq>;
zY7{5|t3%&g0fLU%a}8^gLY!3FQQ#-!S)<YbQU-DjF09D4DNF^r8Ijupy6~|BMgP)|
zGQ63Qyn*Q1!)vE<)^q**d>ZUdq*f5s`a=nP#!e1Y0fxrawK-&VCAr7QK`Ls#3zAsb
zcu}4)EPyT`L5iuw@p6M(P<ah;uXx@|a)$Kr8taKQOONm1{)8`>pv!B+*EeAljwT}m
z7FD!~pNCETvA(L0D(ZRPZDFge7F{gk*Y&o3+1l8EC#|*em*3$aq$0iC+Rzc26d{$J
zz4Lni)xn#+gVWCL-aa7ptHNa%9UgQhGa9M0c>jQRwG-oAkz5YzLkRjBuOJ+>^qvP-
zc<+JUkg%d~TwM{a=3{DU+??n9r@r1Gf~AurPy~SPeujk+<TpmyloX)ccdq404w#CH
zIpESnlf0sY0yy(taHe8FCz&^gy~)teRO&|9bWOU~9QorhyZxZ=klgbisjJn62#WQg
z#F3F(tHH!iVE+Z&p1pB3R3>u9I`>Dc=+jtYQKKfkftgOsR4ZrdtXU3gW|*w-75y}0
zmAl#h8;|{YYz$`E|8H#;^8Y^in*aUFe5Tm{%kRVK=Kofyvdo6+H;_|14bsaur&}AH
zqvO4o`#*b2!{Ji??a}FR{&gY$(yba<vNH17W%}!FZ>hiJKAhmgN$%k_KD^F7>~C%4
z#!+aiP@>Rqp+un<m`Q#@g?>uP6nZKtgMBH`DubHuVXI3(-DgE`9UbrYoz!arF?c@7
zKfmVZ*ZJoNH*AOT!i5&LlYf5A&#&{(2{PCa{4Ie8HdT0YEpM*rjl}o>`bk_#j2<3-
z?`>0fU^E?>oS(x<Fh<sstl!~5kR%{5)*ZKz=VveXj*ky1xWK{!j8qu!8SRp>PxnT-
zQ@n3nHZFS~#BH&zf|rdjJV%$9Z$6yG?uQsza<EO)5c&EE+DIU;4*Z%T-KDun0Rji7
zFO}2d0>?2yX9Yby`~lw@;$A{7pK?aQ_hEo{3TSD8X+(5t=rl{Rcmj_cH&^6;lMr~&
zXq@Q=%~Mzed`?CaGz8!ab1A6U)6#A;t?NXu1*g(F@HAr#=1xH>CSCLj#U)Vh*X!aX
zfnB5?9JeIykZ*I0BN+MFg?RLewk+R;3<9U)h%rU~Tb`G3-Gy<xjozhA@&a9Sd{|!|
z9>3W+m4&UXH@uDdwiTI%oO==yD-aw6&`z&Q(p#?^kNrO;WCIpW&^06WICe8xg;9(V
zTLAnWHI!^@i=h($A2CiP1I%8v%bv`P9@dssr*(d?oO4HRc>Gumhap!sdk30!kDseU
za?zd+YI_)JL2ubotKqea>CaLTo9(U8Iq%a3J@2b2@l5Pp+QVGNO5tCKG=6rn*E#v;
z$?guuf4zTS7l3EnMP0MhXMhLkO^O&)YuCNRN6&fOK@p=7KBU~$nhb@O*%xgxYKNVK
zut+!zvm4x!l8D-}9~9y>47)u={ZI~-ARRZ%oJZcvBnY0Lyx8_eXe}3ygM>8}FwQI(
zp&U&nmF#+ijf|5RMmB;UNI8jpr?%9@>XL;FeYc?<AgpAZ23#?o5%>h=2XY0jBe@jz
z{4oYs;iTH+kHiub3(8kvABBFXF=3G4iK@XtW^N(wM-c2HXkCYBq0XhLr+RRDQ5v-3
zw934^I_`U_m2OhECQs_TMyg(pPh*v-6$v)esb3d(GpJtpnNrHC#<{z)J1G}yDd(((
zw4V}PvF-Xa&|!gFK#sDxe13RMbvH1a^=I@pxRd-Rk%{~0gF8nbGvvS4`g-2}f3x-I
ztNiyxKGpKy-p{9~<9cy&GF1R{ifJe5AexL&s{ts2DN=hK9mf|PVH?&9I44Iy)IEIB
zvR`m`EPVCUYd03HH=KmPqblo*A3Xg6HkBGEjt3;1U6q8_E4J&DRmGO{>m?IU%sRt$
zGaOe8?TAZCVM+%m2`|mqJhN-~2}UoKRIB9eoqvxRR;}vltKu`3r92Z?c$@Q>a>L*%
za*NsS{C;0p?WyW_iN3y!%3t*z4lPXO;Ep(qsC(`J8!wp=rGKPAz@}J7kBWYE)y%AF
zc0Ssv)Y3-7|2588U*K~m`ridPc0f)59Z4n6d!XVtm_h&Bn|b=bzSds<>i_jcKGpR9
z`Ofa&@oxIyMMu(&;~qOcn0_2gtL0=5M-o}UqwSmn3l>7<LZM))OXgf@i>Qfit7TCh
zOORM%y-Q$3cPP=cL1<}y>QIY4qH_?E=<+w)4!}Tcml2l1jR|hCogVy~*}?m*oDVw5
zj-uDau}hD3r0(jna>l!biK3Uy4`z1h4?7f;fBMlyM-@Ml+z@aM;}?BqMdUx&fy1r3
zN6FN_=JYkQcx&F`Q}VdaQLC7>y%NrnB(<1tlE73|9Fs^=hVaU<^s=EzPGXIs-~@Ff
z8+#Z2J>Bd4bi8wPw0Ep<6{WkegM1*i`eTsJYw9ty-RUURpHg0^mwrYb-OHjgBle)S
zth6^;Ut=0Dl2!%0kcU`vIIZ$Bg{7X#a7-a||4#hJ$H;%9kw2bC0Gx6DuWhyp^56RU
zSNZRYd}hjjZ{F-2&2{pZmoJ?8Ns#$r1e>cwh(Uy^<>ZtZG71yD`Q(&-p_f7rbBY=6
zB>$cEd;W8${m*CdRG#1d%*y}zXsr<cZ)@{w{)aE}sowvRGI5TbpD#HhB1AMRc7v^6
z{K8=)h)1Hh5sI_7B$0lYWH-Wsjx6Ti7FH(j-q}S|nX>$q`MjUoWtya7#R|m}-otKf
zK(iOX@xea+<>bxb;pq=2r+Y`81N`^ow<?)Q5(ToL#B`ba>-s4rx<&?)6gYG6=~}v2
zjzlhSZ`@FW*3d9pc3~=7DfQBYrY6+Ok>AV0%fNa-%~-#wrs8#Zm~&5~Yzl>2!Rgbe
zoPw=&n|B%wX974(`X)zT7?~Gce&Lj7b2JPO@9_VIghyGbFq>`RX0LHRSK)Hfu^%;5
zflQt6_3eTb@wdHGbqOxR9r|714h9$r!PLj6`LuZMedibh7%LILRJ123>;-{hj_KJZ
z$J5oKWzbY?hS&in!FYa%+5jsyoY)Pg7fBe+BRJ=q)-#HSePMZKbVc#t^ARua*j4JR
zxw~yhBc99NCLCO8@wAXUG{2KoZ>maR0PgmjIe=X8I}N}BHa(ru0%t%?i#i{R^~H>{
zPQz%I?I!vx%*q)CNYe4tBzjJH$?bO@4u_nJaK;o0X)c+X+W9dv_*>lO`b--q@p%W+
za*Vn+S&)Mwqw4RI=&g)K(*;E+uoJCnlkXPzWGCy(E4CaF*yLO9WO+*xyY;%!G*(sj
zmVxwPFgZ*EQB_RKM}l|!UZvNahH#d&#Kg>asx_SH+U<|$p!_abv<YRNG_oL;Uv+oU
zXhq?lQJm#Ta*nvW9p^At+1gM$dDvJ@l%pVxmU8}Kc%{;&adB~30#+m!`k0Rl+9y@9
zkFq^v*RTkX(B&uwUhpyxxFX1e?v|kiKcHkB)p(K2gBR7^&V9#Ni80pwr-019J)L@1
z*w?7}A(vmPPCc6>g-_wuc4}el`?hD$^o}YDS9D}!4(VMwaD-g(1v(|{o_<WY>?*7(
z*R&YaKpI0sQ1@CvvCbt6rPF$|(B<w4T@R$RJJo~f&#dRbU$$!+bt3p$L@M_IUNTHg
zS)ON(?ceT@?aOV4G?rXcOh1uJFDvG%k`IPEN0s&4SJ}9ImCf5%*}8p|N4Kdm<%(y{
zn#F6Ll8RFmkU3q;N2?z1r2kV-I_k+s-T$w**IR}A|BcPB`oAynnXdnzN9R9>&Tqav
zu(#3E(V4{#Dx3u5^yCHScTd^YH;c)}oeu>MO^cb+ll*@mOT-D<^h%C9`<6o4<U?sr
zn{hmenwZPL<de_UKuw<CjgxG<{4u5aELHDe5o9lm6-gGLkyN}pPlBNMY6ARRujKjl
zsG==oz4TLklHr?(^@0q80}#E~H+c8x%z=Qe6ZOWELTPS;eO$;@WdgWBM#9P&`kE}O
z&t<7n_9drU<-PE`4mPCSKX$km_UK3g?v79(xeR-O$Bh6ANXSz3s6F6}7G5yq9HQd8
z%o*RPIX_7-I|hd4H3=fA?QK&e@c5P+kj#IF@BNg#NQ1r;kW>s$#)|7;4X*IoYrHs4
z%m8(Otcg~xAVMr7`v8KwKkiglw+i)~LeXTDzxZOi09_vOtJtgP>VT(nxt_u)R#>ns
z&itXx)#muBg6+XA87pZHGhCWR`6qI^N_N()uHATXH0=9QtTlxL9fgCW($)r;XI5!w
zumo4!F|`m%ufxEPCgTzdnz`PmGT-WA`s5b=$6-Is%N(aOy$~}swy2`H14)M(^yjwW
z{I|bQ{WtsEiT@iX;U#5Ey%}}mVY-q|zXC=k@6n^pO8d{&qmA7C@7Bip*Zgl^<a6&E
zypdf^FBb1D-t%4s5qeQ!Zdhl9f9d=lWWTNWS8rFS+!=cOJ;|2>Jn+7U?;Xw||BQY-
zTc#S$bL7u%#+aiX&da4G^t4*)EUhdqnnF*%Z7os&v&F@pk3k^!4qq<9U?*up0}i4~
z4~FA4&leY;@4ebT@ZK+ao~iFW^_ISUZ+?GR!q?*=oH0wk{<?^*Eh0ZMo^*$J$9aQU
zwxP;jm%MGSA1|VQT6OEm$7%1|_onIxPnyKgEo#6^@L);TUBdGV{ZY}rl)%Lox#+=p
z&pXK|=du*=xBy4)M}FdMa6>7!axGxy0*_OSmAsYq2`*lt>My0Ge+hs44gD~n3Ppgr
z=N)mDU++OQ@|wQ)J<K<rB)woIe)a&<#EmBzqr?xuw_&b%N>z{HNS=^4{+j!F?7h$&
zY~lT*%|{#FY02raSUY%$5q#Fs?d#jN_y2jT|Mknx^W7J(j!#a1{OPxESMkL+wQtwU
zphV7M@QQ0S|I=^2TWfyT`R(Dis|+3XZbc{IEP*x}UhCm7hz8k3&8&C5;mNaa*XzyV
z>v|4c{mEzyc<Qa5{PWH8!`CM^<hsAl2fOvnb%M|1weKE#Cwsf68y<Qzq8A~5_7q!-
zpFdr|uD@();8NvBx^k^vQn?K30yM1s3xMpmhXm(uVKtg<3aPZD8d;JBfORTc0UORx
z24ID|<zG$vzJ5L~|7#MTf0F#KkBau6?X^c=&;Kv+nVJ9f`0(XC`Cqx%C(r^#DW#3P
zmHsD}w-v|o>h<AsHM+eMNji;`?(nEqxJuVqsii<K8`e!qZFz|3UN3k!s;;5HD7&tE
zgJIkSF_*44d7Iq32QM0n3zdUgyf>jGI6Ts+)UY<R-;vfNMdsoM&w4NK=yrFz6b7s-
zE(HM@b`<BR%w;b9P(vX1QjCQv-?HUZ)my%W3JMVCJFD`R<vy#lU5XP@n1);=Vtk0%
zD`wqCS1y<X$tmll?&wOEODQ=jSL+P6)Ye94_wWq2R&Kqp@pzmXlZb}56w!?|K3=L9
zOJDhTQRfuLM`1K5E1izRsN?tk$kkAfxr#d)Osm&PufnW%k*j6DqMBx5NC$-D=-@7Q
z>RIoi)UAeoRppiR8>~_Z*7bG;Sg|@zCcEehY@w)XH=@TC%{uL2uKR`QOIcFF8r7nW
zl@vc9K%)gf+=h2C8TnCNP)Xhaj;d0osx;QwJ2-oz8lgP^E!Fif-Q8e@zhKuePjd)<
z?_PHAo*G3eg&aJ0N@#p{##Rj}v$plARV>h%Wy6KyooQFKc56O`_j?mDP$uMM@dPMG
zA0vHG980`0K--Xp7p?>=9O48+pHQMI+<sKO7e`3mFlU*E>BuMJzC<4!K})>=gLz6A
zl7MQdP#<`4foM;uk}&`~$b1p1t<eV^1ebJ-u^eUJ@}NS=HqOBT`Lyi7g2DDNdt_Te
zJ6=z3IJVLy<FHf^6`Y6Ly0Zhh^?Rf+4^c#w?9Mb$5=hN3y_$axkoAy~V3ZS%n6;pm
zd0`<k?WTo>C0BIcB#Ops0*ZSjS31&cu~kL7sJ?;6J^QLb0hWiXdQhQJF?$=QuvTp&
zmN6`tHgL1MlLWP-<xLAB(V~0a4zWNW-vd(gxm~#!m~h*gNK5+~LtprrpU2K~AN}Sq
zPL*e+5gf&Rj?9~cgNw{#@LzF&nnB`s^>`?RO_)7MF+@!d6AljJ)XLizM18;<M0;+j
ziyGrVhw;HC>evLw5Ecygy$dLeQKl|@#C*O~89`+W8VFk6ICxH@*lTSFYx&KZT*O0+
zC4|v&LkyaR@TTZP6i^5=HpY__GmjS$!9I-?iXEvMcIyqC__^Q1$V9k(^HsTNzM%lh
zw~XC#5esiANp9V2Bu<Tvd%QR@b$oBToC4oq%+QtFZ1=~g%kL!r0YIW)&fqWqF-!hy
zw>Jv%-^S)w`R~hos^!0*_D>J?W(0pRWu{7Nf2dTfpY*eeH_b4dzkA0!2Y)~D=)ouM
zLGG7-VuY8#ieBPJZ#^}4?7VaMX8)8ggH6)ba1g}_hj!#}VAKXjE9_kWK$9CuajF1Z
zXmVj;?X2SUoBe}@g;v$u{R6BFuS?(Vp1!Vrc}htxfoW}56d+*;-mh16UUZFSfp=k}
zss_=q7iVvd78W)udZi-IPus6{Pk&z6npWua#m*^=@6pUM3k#2@m7$&%zMFfN3oTqM
zMwl}+KtTHdGz1?^C?q#BNQ?t2H964R?4py!9YiQNHSCyqm;NwBE)rX#a$aza8w`(8
z49VWZ8v{H+1Sf|SyB!-s<A#$E4_`z(!c}Vw*xsyRq#Ot~4KD*H)E|u?C6^`S@OWtF
zq%ww+9pg%BE|<6`n8PISd^yN5!aLpgU^kTCI8ofN9i7z0)WhRFK-Ee-f3df_^G_}?
z1(`elKzy&lXYuKUwft$JwLY~FV0~+2dNVse?(Dx_Xl+)FSc+j9`Gr;$9v`0`@8P_w
zaQOMo3BImEUshL86!wKyB?7<R+j$8D=K5SdRed3$DO8-+@yY29Kx)n^FHTP8Zk}~9
zyQlj<?%lG=?%A8$^@7BxbF%l3TUC0+B<wa-4gepJet=l};#L)fvNAN7-WRKXmLvCQ
z@3<*lc}PY-%fVY30rJJ(^RriVE10vIF;0Jf=k@-7?j6_gBC|m>rtZBrKN{Y_+3VNp
z-}mOnhYu$H^?c3hn9(_Xf+DM_{svsUDx(d5)H`g-F7U^&bAd5kbltixiYghqs08Ds
zcgS#bGEV}{>dNSz<hm)@udLWA9Bei>e$tG12Q+1Ex<}V{c>J)cfDWnz^NXY)h)Wb;
z5t59FBgjbzIZKiiUP>0_ij*m9tWLQ?=@ae$P{)I*EATPNlWB&U6~%>7I}#Av=m_-b
z86$+yDi2i~)Q=J`UDz)y;9qNK`<(gYN^^TYr`!nsn4s+-oum;dBW|3NZcJ<+HE}+P
zdUP666loMHLrSSZv6q=8@P;V2`&kx@#>5q9kv7Eh9$V=K*;Nok)<~RD<fp?p0HDS%
zlH}%)!#Sfc*|0*FV+jdczJLgTf-FZqmU^$l=q-kGW}OHsGakU`S;YZoH_E$x<~z6%
zK-*wAvaogm<aq$<hwaZteVF!rKH^icukq3;b$-E~EG_fitPSs7vy$733uGgQrgMOv
z45&PrKRtP26Cdxrq7K&md{WbG)*Ifrj|o;jl(lrwK{DsnYStLZ$g;jx|2%6{GmBIw
z8oTp+|MmXqKfNFJUc;-;BdS#|TI8-;RK9GHyKZbdY5n4rsz_^<2koNM3_Ps4?JiqC
zDgBEI5?oj#cLbFKK%821Dq|G)LUZ<SyI=b`rF@4)o7P=!Hg3=G&+LvRkJmTT$80Bg
zyKlc}KFb5<b0G50(f((_RXTdr1jz8&I-TXK8#aU45BL1yBb3ha95+A*fnordycZpu
zHHAVoBqe-6-)5It5b9ONL>O1+vW8qQ=VFP<(Xh_7VmPJUIyK7swTe`B9L3okIxo~J
zA3&~H<seuTpS2jyl3TdY(PF!0XiiNQ2k!J#K4`0m@>S4Bj<zwMLf5ukJXa>?x2Tb`
zL%%~!Hcp>f5jXk|!ElVs8YT=tzAfqt)7uBuvWLFse6!#NxOa#yE$@_`O16-Et(Wi%
z%No+#)|mv4kxlCf@kF<x5Ho{zCj&}uX!yma4!P9Sl9~fv0&jBs-bL-IVV1Ok28eGt
z85!m@yTXIO9->Y~24|<8u}+>63sRB>fRaDtR89q86%L6x!BvFwwj{;-#(|EN{Z4Y<
z(G+JKKKWX9x8Bp-sh>ObREAG^)_g|t1Aw%k<()CO0<83!O&Op?Y*f|yoNJ?L)%5kT
zLL%K^jc$eS|MtuIx%XwoF=MT~Y}UCDz|{xOMuOX&L^CnNl>hfclf?xrwYEL)vcr0!
zc!yenT7J<L(qWcc<jHw#P?{Al!AykV>VmD`=hjAwEOem_$^wm(U0CQpe5etI>i4mG
zvw9jH7K31qJdXg11GyFc%{UyUAk|DPZWM0P%oyhyAhNMT_&r<7nK`otr6r!;E7=rG
z2gg?mJRb#~e#V)Db$(`QuHF08-o2<<jlGzz)ku-HEvc$5v>}t^%gsTw`An2X=xm|)
zw1yf#(0#n*vJFyMCc)6ZMw=igK{>Jj*;2F;D)uMsKC5UJ-KNh~(^S&c1WVFd8+VHo
z!aA2qx_+9Q5@q*>mnhUKP<ns<>8VHGJmthox)MD#1&BB{pGkr@Rjgski-hbw<962S
zZcgtvVTzh$G>C!L0CJeji@qjd8b?~^+dxM)^PDSdg>V@4L(Kb_mO@P@o1PzVi%R)Q
zA!+oi6z0LZ%n#8(oMeS!Bf98x>NAPHJpK7!KyZ|0DaNG0TMpXpL~_KC4%U7YU;4v_
zbHxrD^@c6wsCuc`RHr0z7+9jA?e8X0n0Xn7HsG}JWXFeh^fnGYNI^&ohZD9EB$Jej
zc#=Vl30;+tr7T{#!4NO}%P>yt9M^NpBl8hX=3*#}*%aKgQ-_xVql$hrvoXztP8%=%
zUv@XYTl{bF<e9UN8U9}zTN~}X{a^dh)>r$#FY%cY|N9gu+wSzh->Qf%BTwX(z&TYG
z%kT7G?e3~}_|Hk*&O}}5N7fnidL7H9EEra`e)7+QyR?l)+QpVTZ%%eQKkgmR+0ZDx
zoHo4OR_m4{>$O_a9$PFBhu|%}0OBsGPPt&}g=mO~MqkQcJWO@=(v>AE?=`0f#+&xQ
zN1kK=LR$(41m1lEhYIA>^C@KtI`vWnpjJ!uvO<Z4C#j?rraYtAo>_psgS}%+6C=~C
zu~SQWfnkyO`*6^~2sH6I{jP80={Ar+1dHTdLCzV#Rp}r-))4gJmhzP~HR-2tFh0S`
z-jt!B8O3tL8;1>V9Zn1k{KL2VG7*nBa^;atjZu{}9tE9omTdDg71}4n*go<dbJ)Zf
z9?dP2qMtvMtlcjZ#G{;>ZKz#zy!U$N=e-y8ZL4oGI%m7Or>fQ98jbA-+_2pu8@Z_6
zwfhfjQMD#2WYsCMHKuI?jo^BW`fq^*nlJ+IuQJ@mUACgX^2w5wA~6losesX#?=>zk
zjsbEP%FLk`q;?kE=zJLVvQ%f6Myi1c82gm!JnSZZa#Mfefbkp~si`eS`GY&ePovRH
zZ4?sz1Bw8@BZVZ*4^^zMaATTQ?Vsi<$(tW{j_GY(%yfCH98Ji~H@Xa>5Swe*J`jDg
z57CPPz3rFE#<_$o{V_o#gWB<V7DTQUq>BPxSsNnL<*UFtpY0#-l~xg3nUY@ic23Hx
zKrexx7ODs~RrP|^@>Ndu{?XYzIW4V{27h#VX{KPTVsj~aB`!u=8_jN*8QOyeI|OvL
zNA*;P7=IuQI35@_ckcHx0WUJLuU~aA<Ne{w&e7>H$CUtK(L9Cojh@<;X67E8Cv&#7
zp-E^pg;5q*<A&#SS~qkTb_8Ht1pA?vp?%L_;)9rx1p(s}Q^p$JG*QHb7N#W5*lh=|
zVU$Zv91U+MdA&ePVxdu+!yAf7M!W896kqW!qj<b;PJY~F$W%`P`-WaoQ&l!sG}Tf?
zl~%6dO&TshXIAA{WDW1#qzJ1SHFeegZL1oO&&hflGp`r3omuNWyDj!goosD12zvxS
z!~@acjb=po6vpcFOD1>X|52Q$6M8-&U<UvH2>AU%{;##K@jt)FCy(wL1<?eJ@SJ4;
z<}-;+JP(HfGH{b2>IuwYk0glPT^r=`lJ-|FR@5G-mLc4J@>X1kX=oqQ>5@Jy%|9@f
zT!oVFwQXX)PTgY@#RZd)P^HmaV2X`algfnAdm%azWO`syJ@OO89dTtlC=%~XB$iMA
zl&&VwkRa-XVi#LAIkN0abHB6gGKXb}Kd6KBY?DVK%mDZ{^drO{l5de(;Q8p5DMTt9
z&b>*J0?%B_b?Gf%=*$v%sCmouMOj+t*XaL|UR1O+r4^kTNfzO4fQdcDUQU~<<ePPV
zJEioj=@-VaRFB-Cr|K=j4wrXd0h9bSSH-Sn#W@pQ<2O=|Vlz@!C%9Ch^I2Kx4r*Dx
z0^458y{SVDrSp`>&1cpci&m}V4KyZJ7Yhs4fNJ-3;Y*5AxiF(`azszU!2rhRM|?FQ
zZFv+ZMYQ_Vj9RcX$Wjmv!t=0KlVxjoDo>~MRmYn{;2WSSUo}dYDUz>hOW&)r<=GQ&
zk0=Z@N;c*|7JiMEXz1Ll4yLOvEf?rlO^STbx0hNAD;Jp3BaTo)sj9I}GjP;vtky|I
z$}g@c4d{-5p}E`vCT8v*rc5F?US~cSh*cAlTjHyl=%6^!x<X`Z7B6ll5sJ^lo0@J<
z?!tKP1^UqCG-Mjz%lgO55}QKhsoH&qN;JItism@`z_n@8w1UxScJCHmS@Cy)S9i*j
z0qX+wzk;U<Ht1qPZdC4F;Y{41Uw&cBSbM`#pwFZsa+X*|=I}OWjK1wO1oQ=pSQQii
z^Lxi^I&0D8?5JL^4~vEMnPCI1$h&0x&F@V-Wh5u|eZ4nJXt}*VU8}bbi-oz}&!0GT
zIhOgH0RTzef~DLn>ce@7^-RjQDBh)2qw6j3v=R;PhJ`kfTF8TFr5pvFQ>;)&PO}+k
zJRcHIMd51fofG|B>@!GNpMp}n*!5fBiPL4!H_^2%(|()ZnWH6)l`YE|q{YT)z+`Rj
zy$Z5bfXy^cN$!1B!*d-tcz}p<(hR-s;CTKVqZYRfsNFeG{LgRHc~pwuGCTHqu!xSs
zN6ocit%N#=te<q62z)h7IaHkiBFVx|bNnLX_i{}(&xgwWqZapHEt7uze7VoZ<bR(x
z0rU+0&(`|-RzCiBYwc_P=P&Y^ng9J3so&?!2E*aYW(4?@ct~(w%*+9OF{?z9B|+dM
zbv6l`hXa-W3&VPGLSA4?GozoN+MUePAuKaH@d_Kj=TcKRKP5$*NxrOSW=fi8(yyI9
zuroUepHj*=8E9vu?JG$+yO^7YlVYPh<KEO7^JJHsk=0{b-e8ru4S)SH@uLjCoDbtT
z$)!S>R=yX6!(4Htw@<nlkSmL88dww<wPRpMm|=d_7snU*Dj?B}JMJ&124~Dr$W@XA
zMZMCnG5M7#ml2K||5_<6`@zr$F(>wiLD~z<Dyj0SN&b!NYNN5;RUUY0C!(C|RH?Lh
z9<9<j(DznZrCms{ERA^x{eC~G&Nw+nxw0brq?==!{#w9X=H!(8y%&!-+o84H(odc^
zyL7Sbjame9a2fVyBqP522vp7>UiwiO<pH2v`(|Noq2AP#dbg-wmRN5t^z10fmNmGa
z0Dw7+ti;A?8Fb4qa!zbiNo5EAjJ)HOImg|0J|Sdgb;xO`KXZ>3x$Q9gK4*s}CGPn-
zoQBS#a}tT%kov*@z(I{Cm<E36zx%9<bH`!9{_h3-fBC=)goTpLe34<%AC;`vrWqaI
zq9+|UJ9sBgVDNz{+|9vy6d<fW%WND{g#9`l+eva~W)HK4kpIh8-SdC$B>!`G{cae|
zX97M;{@>Wz%-erIYPY}2|6k%$E&p@m#OM15Q$>Hf)O;~u#q7<~0G2>$zevPkw#bws
zKtt9r73(#8#Hk#VVJ?#zv^SPWmUviBBJ!)^AlRzHc{m)V-gy#_sP6f2l3uXgscEKr
zLxHjI*1}&@(Wr4m9SX~ZO{`Kyj6Eii-=(UyryEa(Lz2IwGsz&zqrl`{Y1|7bJt*0?
zVoruI^ZIds7Roq+Fr!G(=<;)k5w5e;9SS8OMc$~FgyW2Yb;RA@1GJcB$3CAzf}$G_
zs&p~u6b~oN79}*jA7aj0Hr^TeZv%X%jaJ<`Q2-3G5%jy*B*g*04$}-RU9ml}zgEja
zW}0FiYp*SuY^$=7P6kVr`ues=qGQ8Cgc3L(N5`g|Y)6Rgsewkpz(?(jw8wr<Ff4Rr
zS_&hIm%7BFaO%~9mB9*zT7#Kf`4|Cx<R@=s0?ihuqUG^$>lc3Nbur``&_Ime+ZUr>
zE94#;3R(-3zAH1)vEJh<bkf2TW3p5%`(FEvSs8RSv~>1b9&#^Ek{}(&6strK8&7tI
zySRQKXvK$187O*@YDbwkAzY3Dk(y+}6-H=4%01@s7k$lD#$4)$=Rnq|vXuc{u{~VF
zjN%`s0Z4Z~hD2__Dumbtj27NZdbs7$3K(`Yh?XwI3qZngIq;+hW#E*O1WoUZZc~OK
zFx6-*8!-|}oI+<c)jL!LGH9w7*CrNa3o4zz0sOwF@IIxWycGTK)o$qk09`wTuG=P}
zyi}G=KW*IG8hawO(||%SH9!*EjbR0KdVq7n0u1U0d+&9COZYYj#uTofgY#oL0Gm$S
zREGGU5#1lnvnMILlF%J;6WvKtg_wmM;$`&3%;zNYG2|p{22{WyucG0B@2Sjb%;W<P
z2Q1nD-R~im>QSJ7!+AjIYH*k^j8UpQ8K_-qCZ(<hF&`E(Q<UU!@JKd5vJVoQh5`7f
zI){AZZTC9{rvwrzF(S>d)3J{Rl2;cYY@|`(M`ERpm8jG&O<BB#x3aPVwCXonJJSM>
zTOEiJG!q}f4jm39e54v5u5*~AnF2K{Czh$T87N*jc+#n-QpqMLX~7V<Q+@6r)=^kY
zIA+wD!IYUPO34ul>!2139bV(%Fd!cwHBB-6oHkx<1d1^wIaa4;4>Hqze!roJ0*^Z>
z@;BRMZz#1E!?wh$ddiSU_dE6AUpBua{7(6}8YM3{<Cn3DC8u$#J?(I7o;9DDCcUSg
zGw(tvYG0L7FqnE@4*S-cEh(D<KfS5t$F8(p>7>_Fj^$iG2{L7Frp?TtLi3rTe@~xk
zXMTFF=_?Gh*+Lr?)v9d;Rj>vSlvPD*FvSdxOGH*ETepm%$r24Zo{WVUN?Z1ktQ^*u
z<q<b1tcNtT1{I8LLN`Fy?7*ZPiZEUPaH~Y*nf0VIHnzx^kgyul7^pOfkfVzfc4LHs
za2O=@22&mM@`BShfpb|814nU1li~r4!!grPXd8O1<ud2E<i4)9p#@xH07bS4v>H6x
zre`l1VxaxI*_^(@-+S)DR;{*OY1;`~Mo2WnRos$t{+Fp0?j-*g5-4_<#8sFA%#i=r
zw>ESB-|K7bR_m+$|0O=v@_#Xl2h;B9rU27wO|?BM;uP=(fRz1$4Vw554r3_Ot=+Gz
z$k&@C-n28!xTZ81<gch$VT%3G2*pm4uk)QS6<oYzu*%Za@erP8TDPBF*|tRq3Jzjc
z;Z_tVx%kJ)>JVHywI#YF>ok|TmL0;kyoX;*3x5IGWjslLn>G(6$d;_s6-WS+F=dlu
zgTu-x<6oYJ7K?-HOd5cRNbb8Rt=-3>aCn&4v|enxmqSJ_8b*>9CFrC>;BFf^-(2+M
z<WNI3r_-li+4gy{_Yy5v_c|x9_x6tLh{#suJ7Bd9s}jtf3OQy!HR!CS=GzAhC(OTE
zg8CIelps&0tN8%d$ay(qkFvPLaTk}j;ml{I)odB0+@a5dhULU<PJEiV`qlfJOrFB*
zhMg$pxY=PF-n7`5ws!uenwHnm)4H;<6R2rA%skmZ^ARp(H9N;r(SisQSyCD}pi6&f
z0ZV|?5U-H?^sD*IN@&a>{$|G`nsRi0KBn_-@qdI|6VKP_&bkGfmH%(E5dUYZwf>d=
z`y!ty@qZ|nlS0Ag(*pq&%1*rtQcpVSiOJ>u(T1bi*mGJTx&ZGD@no9WYx-_xGWrl?
z{)Dc#Drhj}^~`$NwZ&|iXM@7w%jS5j<e-Q!3@&Lv{~$7z3kFVU>J5K_p<Pt$Sjq5m
z!dfXJVJkYin{L$gjBxB*wdn!+%LK;gt>Hm8+PzK->fb0!2s9`#27~pw>v>1Yq7rZ@
zvj82v*f_Ge-RPk=pJ7*XH(#8B36!i8ayUy@rzj5;VyE6ZoAcB)Efl$|!a|=NoSp2w
zP=*>4vKpgfw;Tf+E^1|81}Q!dI^-8B&EY}Aqv_od8>(9`4n5aXMS#rw>L$Vb>-#BI
zZQfN-nO3U6k8S0lW9DM*!nv@W86PBx=?wcrEk8z7TKh_I1$4qAy2^TQ)hIhoIV+y&
z(4QHF{4BDP8O8d{RE*C|Vtd-HdKlo^{8Ut;Q7X_Xc2W<)ZOL(Pw#VTPTV_X)vKwe9
zfJh4#Tpf;+71r`+mMeJa3QhMZs1oE%>|_z<iY)JnNOrfcKAOCHr>ZY5l%tdeKx-ya
z>eF^Kk4uDWsw>8E#`cy>Z#g!GTzli*#c$ejF23quLUt#^Q4T**0+I`+r+PQ5!gPO6
zp2rH!6}E7VZyemR-c!ZzpL!<<3QV21`+Dc(BzF|buz6AFCa30Z3QL$-F!O8(L<kaW
ze{5!|{Jl%YBHfMrYhtyg4Tk8?ryC6BAfr({D-6N|A{*eI8RE?=NOyw^32tF8L9w2D
zX<#E&=fY3=E@I|}I2BDb5(=jJWtf^fM{JFOvSX*p<PBTK)>QY;NH3kI^LAcwCb6>=
zpKInjLK}tYZMVR({-LO|exPVWu?_0RF<gbpT#TQhpsuPb7XW(SFe4IOlEux@;jA2N
z6(&&YI6Vw0cES^6pr`Lhb8y{8=yAdMfqXePl;z^_m^)p=DCr1sya<db?aBq(PbnPm
zMt<ZEIODjIQpE1d%}t5MPMGKtswF;jj3z}GO_0p1vKZRu0oI>Ty(V4O6YwaHC7E8~
z0AOc?BdpL3bg&~dVu{~Q#;G!L0MJZ&lC#s3R=9|VS}r$AlGUG-8TmI9v|7R}$~`F0
z83x}?{0KV1%$5{sTUiEpD$=#wMSd~V%yVViIcycyfom(4>|+sEIDz|$QNGU@={UEq
zZJVg+ieW7Af#+gs3pkEr7So7Top<axS!a8SL$vWiJ`>Hm$X3tXkmIt_1-W+_`jl%c
z2{E~>m|!q1c6&$bn|$ZE4d5W1#?yYpF0SPE#VIC=JA6Lm_VE8$8o4cz!w^uq2QERd
zn+x~yXvesSL{niL{zaKfF)zgc{v|?-vlXfbA_~^(;b`*huDpe*?-Uzv&?Hy*dxItB
z4I;ADN)gxezETX3kvmbeCi@v<Fs9fI8=(v{ro}c(z@1y(W-+dBzcM<MdBuaW!^x6h
z3%u`C^~5LQi}QQPm89HSj?`4PUk$vRj199lOnysl=d~nGmL|oV*a``0dVz7udBq)7
zQ!N`Iazr6V6ATN@lf2Vrm+e-z$BMgMZ-A1F9k&_kSL&dsgY2>bd9cMJB@of{#BG_u
z;7CL{O_`cXbb+RNR+cbJ>*NG(({q2mf1o8wcYi^h5yr1E+e?p*3Kz!Yh9%3*wp<vr
zXKNZ|Jj}P93wt&<{hUrfXDb8KdHDlJ*HFzYI5H_n)US7rU+o#`e%3K>C()s01rqxW
zM!g`-qLbt3R9hIvUJ|Bnja4_+pQJ2R_?}v6N_#&H`dpihv57_RqIk_HL)PcGJ;XW@
z6AN(g4U_Ij5lLXh@I{;Wv6=*8&~!3~gVvtPW38DT%ykMis^YzF$9$<v-wGD&OOW0Y
zf>r`cn_^7`nIdQTT~8gAQ}|m@ZKcYYpT{(0`*w8u7UWr_vHjn|z@@V|I7iL-KY*Q^
zgUZdz@0Al^bwnzvGB?{Nw>3625DA7B^H;f<)OlNRheobRm{4v6)RA<OL@u?Q?5pfK
z)|K2m^y}6HYzhTi_y`I%jf80!u4t}>M`67X#!_$OT%BojZovY%)uvJoSM%OeICg6@
z|GOWV(@(`b%KYnPi`$(qcRgP2Bo%z+{l5tBuiGh^^_S-Tr>5=5n?e20cNV#u|Hr(M
zANVuF|6}vfqqUs<-}>gGulYZ|$Y+ZG$Bf7ibHsd5dv6}&K7E^jPNbj46i|B<TahPr
z&=X8YML;eqAg5C~F(hpgX84*U33*4$nNH_9y1O9>r|f8!2e6$V>~4<qatr(*_2zM-
z$6R=oZuDMFGO?hm-}px5m!+^2m|_-Rpi4Ykd2l`{<Co9=h;*T3xlX4SeuCMlCCl3$
zj-F0Gx=O@&8!;wCK|l@tn|P8vk&>Rb+AR6}%J2S!@edF@Yo7W1Deuba{h6!Rx@|r5
zsm^^q_T4<=jNotDY}xgGEvvU$76QQvX;2dOpb+rjL}Ea2*Ailb7K^<#Lu%$h%E2PY
zx`7!FmJ7*3gHtk!ZQyB~`9mFA;+Aa@Q&eco#00tZC{@m`g#`lYw#l{pCdhosu|Rt@
z!*~EuIGzk)(?DC<$RDSA2N(Uy%R**wErIxg{gWNMk!t85ux4%a*Yp=+oPL9%WsAz|
z=`N*O#U0=b<1xjCLGS<$u}AcI7!3O<g#rnafD*`aTIuv6<g7KW)fEhzGisQW)J)kJ
z*cNdEfB{!~8TJAvLW{UATdN__A!tRY6`++!s8A45MgUNYz}$Hsp)fQYHt?Sh+n5TQ
zoS508+EfN6K2^!%kf2~PN=h!t_sAGefvgNnU<0}7=ltfBp9yDB(y3ZabsVABH+O77
z<%hr@<EWu#^PD`Zu_YBY2jjMqE42U$#yUv?6`1CV9jPs#fm|QxfIx1WTnXBWhZym2
zRYh>%gx^fab0g-cvAmbkj?7K=(`$^HpoWzt==p6A-)e>PtgBY6CZ0>oAb3w{6&dq&
zG>!!c#_=JSFDXblbPskMjK&$p5n)RelbVpyhEa>8R^fdSW;Ns8U*}d|#tAx}Q&BpB
zuta%SQKzmcJ2jN(j5=lELkmMZAyxthSfc+o@S;e0C2gtLCd++T2K~V4r(ki3J6F4o
zvP(NFW}H%FwrdOCP7lpzTnZ^;zL{LXh@15uioZNFPx7>+c)zrGzpA(nUzDq0!V%@G
z5EC}YSCFSAJ#f^oT=Vp>tgyrc%NOUzB^CJG$Q7rD#llHYR$88xPPDANdYoTzkk2bH
zW0sFuK7_$X<bQWEa8Hvlrpte=wY7FD@Bg*2{x$yJ7x~Q0|8C`HpCc8#Q+ld!#ws+D
z%nHfl_fKoUZv#2(bbj3F>>R&3>2y9A4k`fdk!~KUlOi|D-%9@Dino&LxVkQusCcUq
z7=I{DZ;WATob<2AtSqYZ-7p<Y+1;Il!z_%-^ICf&b`ws4R|VOtCO`S&pc)QOjA37=
z<Aw^@o>E)jR90JDj;GZYI9BwHKG-w*#uh62#uld4mUSqrE%~RnC8UqH>vOK|G4QP0
z9J!2v3%pryec=OT2rmO>htO#u2`G9@jj61=oP7N@GdsCj#ZIRrFL|v3AE1s9_WbTE
zq-w?;(!fikgtaaW5Ws$=3q6?cBqBC(dDR=Tcvq)1iclb*W^_TlSfC8%Nia^f^)rp(
z_wJdF?%e|%*R>XOVHZkRQopi2-R-6%7ePfQ7%o`NX$pw*6G$-whnbd!KlWa`@8fwr
zPSBQ;N;bS{OMwmO*g<Z?AFQcYLIH6l4+V~W;DBKY064Myr9ZqCDD<SMGkez9(yS@Z
zHMOz@4z4jy;NVWP`(*2^22q%`T5&FK^;QlCF7`32k8)5RL>Q3^q!t6JtH6IdH@pN&
z1cBw?dK~mJ5~A@pNSHv!`;7`1N_?))D4q^$v8C@Am>Vc)80TkU!P<=Kz8aANH(&Zy
z0NsqQK6{0%LDEWn$_2s91kvFC$da%(fq~o<nCBMg_A9hF?N|fu@?(#-Tbz{@4c(I5
zQG`)+S@^v4F2B;cTWg8=fS8}I-I>I5=jo*Tub4A*`>&g`AN_0AIr<l_bDaDurW_~5
z8Go@UU;k_7d|fu_`R6>tSfMDf|Ias9`1<+8pF8RQD22=X79cb1KUy1`>-qd2t&Okx
zzc2Es*8lx*c=-3}u|8D^bq%UZ?EQRnczntx$F*h70mKFlm=+Cx*K76dxvCArZqL*x
z4hF|iJC7P3mGNpEEwqNel!Y-Gw9$iF9Ye9fKj%^1G!>77DAyi7;uh@z=o+Z9$<;_G
zZ+&GA3VNTbLeFOOf-$*Edcwz3YI5Lyw;Da0RtMV6@^$dplsak9LvDT$WI=S9tLwZg
zX#<X=gE$LRZUMYK#z583@`Ju4HfeG<5AbH!OOxIz-gB+=NFk?&&^e2)&_MIK-+POf
zpZRGQ-j@tz>M1EW{=fEQ{D}B}Vye~gKQ8{?+S<lOKL68J>(Rzn`u`<9v*Q1qoF1R;
zo}P4e=7|4imz`mlhjuh{_aiE2!6>v9!h33M1#=W6%7jWAeyrL?Akvg=t&_=@U!L!u
zzS%kIU`)-U6Z9wfjg1&)oA6pQ`Cq&9`E#fJ?}SfGXYzr##~(e~tcw4+-dfA&f8X4C
z^fmwc7x~=#2F+ww(~HG>i}$=Uv>$!q<<{5xemLm-;U~#6`j(Bth`){Xv%xdiRus0y
zG6cnxOPqPAcLCf-gu2ZOE1OV{GM=FeL^>IdV>03z4}CPr8Ko=Opd@CY0l^dK=pA(V
zbgAvF<Gr!>56t52(+eEm({Ed97zwI7$#yM_ZY&$ZfEbNm+W#dJSy^fSR}HH-TlL?l
zA$<Du+cq}z#=j0nlaUHV!)`cG<n746e%hiUM`&<shKCS&`riS}*ZX$e`_s!3??K~%
z2mkwTEPbNK;bCB5Zqln6Ye;9HXsbwe!t}HsPrAVP4eHd<;OVy;i;Ls<s$IhyMb8Ux
z@}7rJI(#wl6n|e`gu}r5#ryVs@WE>iGH=cM&D(~?NHt-X{<c>8_PzDsgZI#LAJprd
z+LMc7dtQs4_2Vc&b;EEVgSqCxz&NGxHD@T-Jd~C_6jPR3*FSL>E$R81-$C_Nubu0e
z6S;HuH>!K+>*m8YwoPf_pW5vTusnK3uc0JOSCzHr4yED9_(eg4%X`gXMqSWE0H-50
z6&y@{K2k?b2VGQ3i<`3W`aHzxDT7>6=ufgh=81Taj5VzL!7%d?bv-YV@9T@sG@&$1
zlIrAVX9`hOC?-wh3#zg3ys$+=6t1=W?R)MTkp(^FmG!R~u^BIoqwS1+-5UFbJ9Zp-
z$++{NF%z|C<LPl>qxZaBDNN2)XnskSnY7Q8d8QvxbfN*~4urnK@laV+cbE|1-PKJ;
z&k%?9K^~H2G6TpdgNXa>d({MQsBw^-2fh3jk*9!S!5_Ij%Ws^H-A<fhGL-jvSOkH>
z*h_{=+h1+^+s?{tm;7*fN=$9+F@Ert-B#R9WdPNp->@-c`!BK)GGoD5jj*KORW%_*
zOnt-&W|9}>{HUo=d6U1<iSX^#q9GFo^_qh~VX!-;ar*A*(oK*q+0<Yr!q2&%Z?U5>
zj7I5hrWG;!8B0bQ!09^+qSk`rbG^b?oSPY!t*8Y63k32aikHkv!#|3mM`}7SGqoTV
zUEj7QuJ*i3yw$<N)LY89V@rZjacSrwk4g<kZ9rKI-I0)dY5Jiv8h``AN7JeN;bC^9
zDp7W36nb_?%_B6(C|eJwEG>`qzy^i20iMuW8NG)z9?u}Mum(hQoPGJho&a^ARu~Jf
zEy_xl4*9+8u@By_f+Ee>DWm|(g_=H*lF<k6sfWE3Kup8zFkko7nnDi7PBF9eFyaKx
zhI8QS;B&HD`^$R2;r(R`|9Pyxt*81Q{Mk<H-mky@8a;ra5wV#GMZ{O!P2au;Xwfg+
zOs1#|>;s)>FGx0*%yWF5^n_kCaW{E2T1^i)N}NVr-k|k<`5Wj;zU6xJ9L(0Wkfa9V
z4jRNOh7_6LCGW1EUw>V4>2#199^#!Q)PHC)oiT}KvMdC8fCO4|5rX&c5bxLP^=)+h
z?Q}s#nZ^wbkig~(=;<ky2!@5~P`HY{6B@di|LQWIEe$zW8XBSvIZqn6LgWb0K)5#w
zAYWdkHt_(WEW5N>qM`nZvj;Ip2djPhVCi6I=>Zlp#m6M2z;{~L)4W);Vve^peH^Y?
zry&A^U}KI%i})DMMWM9bw|{)F*%z~*x7i04)uA13A2|8#fO`Mprq=)?G?0#sXhFN$
z922<hpcUE~`DO%=a=y`z>XvBdRt;$Ocx1h~FZym5Dy+K!<UQ|Y82LlGdB{NYzVwF^
z3RXc`qkGv350aUl(h-y{vq6Wl<4Lh&*m(j>HTpe~{7u5{iXrZ5Dn=mHU{O?reuzqe
z8Z*dBPN%@0qp{8e=157vK{9UG`7*gYxu;@$T4^pF4?}b$%dRljHw>Qc8fc!&jBP8G
zvutY6$UbR(a)h3~9F=gl7c0+sv~ukD$6_}9V|Kfm5%2cFXWQyiAQM?Lk3QSH4Q``n
zCh!)17@?MnP@AY{`3h+UtC~oXxFSc9pqT?kdq+5^X9yrSrsXQDv38N|j)YvIeopv)
z8@nw&+${;kY}!<Y1cCm=l^lHdq!@8)@;~DMVEQnfXg<*;xi3R_mum1~pXYk3?tTBg
znN}S-F)xigr3)#kU`bjR@Xm$0vyr#h-n1iW`k{0?7?Ez}^MJ@f{nBGZmTABNWjZ6g
z%%BspoPOr;ey+N0tFDHz{xUC|q>s-5rD;TS7TF|nCt&!9b4Qv%UKsgHK~)*fqSk%l
zc4y4p*6L7Q*wv4U0?!e5Q1v$q(DPb}Jj`IIA4B_x{hhina*oxnDlyI#ariCu*d+$?
z)J1>Of{Rq@xq}5L`1Je?7IyFO<zn>}tu1v-y`Rk$MC%K3Yd=Q{eudoBB#SXp35NFv
zb}fi7@Bjxe%UuT1RqI`|yGe)?<x<}d5*`8%JT*Z>Uca)&%s04Cyw?NwiUihu5@i+F
zBrCe1)BS^gcHZnCs0IM^bgN@Egn<M23QDTk0DD5(V!$upEAg5X+W?t=E}@QFb3c`G
zUfs(k&`-LeYEc(Y>{}yxqTh4hG%vnR;z)9QrxY_=3v1i&2mQKTiC$1O`i9dt;TBA|
z4OJtO@-L{cD8s`bS>Xd6BcQdu|DFc}JD-cw1Nx?#0eC#|9>6K~0I9d{Xw@m=gStv<
zcn_lZffr-cnyWAk^gsY|P7AcfNQq%aU0E3*4xmIeKXt^oGo_iek~VS+2JQKyzylbo
z7u=wT?Tjt?p_QQoee&HMoMP;dC*Fa+9VA%_>6a?;I$wf<2btSc*uI%br9tCSRr56&
z2-cpk`=O}UPH9(jAUkb$Z~t|tSQuGR6|jWEjGzOWw5qx|n%akn%jDust#yXSAM|~+
z^J=f2-}DkfRPTJb&&}Nlt6GPLe?L32Dyi$=)ZTwY_Q)iy1gdWKC98!TaLqU+*6IF%
zJ5V7}bS#wAa{{EAZfaD%o~y8GY#mF;>Vhy)b{R!67x*RKh{K75XVD@OThyT;09c#m
zC&>rJ<ICGW^xHq|w@OWC+Qes$P?RYlqM$dzb8<hUV@c(0G87{vF<#vOUc^@z`iHlQ
z<c#r?U`4TLJjk&g<k%e~enh*6p%DdUhc7!vr^iU^loIj&eH&K#O{U)b<80^P^z4m(
z@rQbWsH&d=UuU>l`>fUdsLHB!R|o$gKjspRWQQ_h@4Z;6D9e;)0he1eGnFM@o07xn
zB~8KU<!Ik?L1qD~O1cC_aMNPhs=GL{`WVmb#33EB18lCZx~@w=XoN0nSXtF299Yw3
zAE%AiB_TXum&vTI?N(i={pVSYrH(?o^%-s0lXjTdV&`Oj=RTDmTIx`wLZphUL^Pp4
ztd%M9%4OKUc+cZ_MBdUtY!h|K08W9MfC&aplEa}+IQZ6*7z{4nn^d>07+a=C9Fw;L
zM}x}?OmJUg0JF!PjKU_N<}zUJ75NY0Dbv`y3a~xNvn2<*H;OstROGccw+e?!Ak?0y
z7HvQ885XQt6F-e(CXL0)dYV)1BV9=XyF;-5tF73+e(w6Yll^Cw_CH<x*EVK*&&Pk=
zYJK(p`68cc<-+O7i>W#Vem_0N4+k}!C;Y1k2Xs5t0{alnY@Rb4&ohuehI3_@@6aBY
zkr!T4E6mfal$|sD?Ia6l4)ZF^q9AqEF6cbeJQ)YQ@I34_Utp|E4%dpWo6V+2;WK^m
z>Bk6*Dod+(?x&fDLAIYzq(C>Ox&*SL;Nj2+wv|db{2n|}NhSarx)=Z-;~YNmB=(K5
z<yTS2sl7UuI@hIaoBv`tki>a~Y5Y$9Y&u4tnBhw5MUHLjOjUOQXFgTS)W99+;DJ0H
zLY&Z;5^7@1U=G+Rfa%NYl*iiX-i%2Lxa=h`$RLO^OlW!283vcZ5FcMZ@glnh1qFWM
zh4hT#5KD{rJ$75iN3UZa??ye?t~~xQRmlZ<Nk|$$8a4^)ekvM3WDX=4pb0`s(&v6e
z(TBs{1lT+k>76~cG>Bp97=IW9vCP{&IulrPp3vYN&GIm?61H}RVVp>C^Lv@#q7~Ly
zKpV#y8Qf5nhqw}38_jN*QMX$g&rP7>ZLjs5*{NZW!A97Yo9OOM7N}_tgY#?!*W)2J
zR~o)oeLSxPl}#9AZ(3oB>-(n%XpvmQ#~aDVJC~0)mXG&K4~nk0Jq#;MpTd{lI85-2
z(X~<Pz18Tb=dFz?J<s!HzR|7UZFDo>63WN(<>STj@qWpq@Sh4%KFx;^1>F^&5CXv_
z#n8Kg`WP*2)D8N56@nIb8s+gA`zTN-ZIy;Zs-kF9mRlqn>pD+rEo{Jkz}j&gcFTEe
z_k-cel7RMS6a;;n{1CBJ6llfseu%Fy$S#Nx-i3dOd(8M4NQ@I{mcxxl6a*R1i-3qx
zjbik|PMl!KGt37OkiOl{9KvoK0F6HBCRKKBlwHt`qeo^KBMv)`Di|GHybF`SV6RMs
zG+1a9<2X&jF3fQ353q>NZ=Cp~?$IKS!?gTu?^Fjd6ZhdPNV85)a@lmUdJWdbTdr@T
zFeE&UR7OVTbnoP}^J3?8hoTR9YuAt3-L1`DYptX>7R5DYOT@z(^+eHC7Z#usjL`sp
z>MA^q6i`Ef*SVoJsCacpG^G8V*C2TvdyVQ*H^|!=q&K|BtZZ$*ezYtILLkf_@<$YK
zM+M%&G*2YZa)cw}k81{}18E2h91Z~5z_3f$6#lhfRdP5ss><e%ONRgBj#>ivW|ekM
zQ7EC}h+ALlx^R4co(7WJSPE=y=(70Ll+E)obC$O_n#S}BhP8p$<_CrwDLgQ>41?w*
z_;G)k;>=JW<a9#%hV{MfuF$;Y47jC)8F=nN-Nh8bHsPNe=BsI5$QAP84bS;lZ>X;I
zJ2EZgw}nRG{EmBXBQmzh39lznr~_g58+Mt~-JRVZ_Bwk9JI`P5z34z2hjxPvtEdxc
zOP;Oi-=FXSQifbV$EU}8d!60WpDRXKU30!i0*0xL|FnO4uy=Bjr#^O(DMU&Y`>?pE
zLc*H$iQ*C2Upxh1pek$E%Cy#OKJ$K$-m%wkp-Klc3PHUV)idGF`;;jI+MxG*&|(9t
zbijFjH->|@?WvBbO*ixT6&$H#2a;BGJ@T)0&pP7>M{x_&7;|?FZ}N5NvIy#0_y}#Z
z8+MuTBpLV_rU-fJtvhd$0AxrXB*u)YZ8$F-B!{<~DhT`=KbjCDLRMbZwjl1^_fj~!
z;dnr{d&SOZp>?08!nT+rpfHx9IVVci9A%wc!>K5{gD*<jHOk*Y=~@hQGYnP%gCv8`
zjK&s^{XZ}a{Ul4nJ{yHXV;p8b?oWm=G;fC_IS*B$OqZLKFOFAFUo=rFHWDa^OX1uF
z^1B<r!m5D%*1RZeez2|S3Y<V7E;T%24OHAG3f<rFJKQ*i*5YPiG1Dxd$f(iwqB&KS
z4*F0Q0=cW75)5IB`CMXnN$|?}zI5cjMSs^!aa9%%7LLZlum`UIl)&kwAm3qI$}*N4
z@wqvmnhng`kOcAzdEO<(11wQ7%g}ZiV+&H_!y9Qnlk@~ck@3clqwJ!6uxf@GJG17J
z2}5R+_Q`eMqR|H(itSR<k@o9r^{V8Us>mX>20v=tEJo+2c)SvR%e2KER%Y8oMr6?>
zyyS?rcF2FbRs5}TKTc~@#<b`pKXV$aNVQ2BGNrTo_@wzvji0lAiqZ@_;IB11`>-TL
zunI{IG_HKb=v7jzHw=Ibj5`>h0kAcxQI3b&@_C)3@IV!rlT``IWNZAs*do4cIWMh#
zWITQ{Fb(4$2?Geb&{|eWRjRaMc5{?4ZZZbOBe3zn>?aUkCM?@1Z}es=Ix|+G^n>2e
zSD9H5`#BRt%JLsn3=_=Bf{j^LPN~^_z2O9RIm<v|hefGIf*Zx0YgmyDkp@mfe>L9%
zN>IqZ;fv-(Q~ju+wlb2JauG_=m>-V!c3yOLU+?W4oE=S9S!#4rVXS4LNHYmC-MLre
z$@FWwo72}P_4>?avte4&Nav^hgZ1_t)vqu=-I9`oW)vo4H%wu$WC=YA=I3!dCYVm5
z)ITSDsf%|NW<MEAd;(r|_XI%-4zdZFsgQIY$10gjOmPuXOc8^PW;dMUHRV+T0lEhw
zZ#Q5Dpg&<WNl9(0k7LOyh8h+D`l2m|l^r%!WXD@pC2+=Y;M}{HpR=Kr>fo}-P4n3t
zXBhKoWd|9a{x+!Z2xA8DCk8>u+;Q?khiUH2C_H^?u{4SU{PWKR9j<XkS>`$Cso?Ny
z^HeBd59{0Z8dk2l2_#vuZn8@vXYC@hctMDopP9?%)nJ!nO-^`+YA(u?+(7q2KINqV
zG7a*ohuSW|39XLMxB~3voi{|}qC=F!2m46Y7=dIee=1wA6{v{?&`)(x(q9#ygYBwJ
z%{u+*c5ctrBH>VS1Dm;AYMT{z83K_F)WsI_v+T0M9-FeoWUk9q)0}IbDc7LTsdbN!
z{B$-t@<j#Ix$8_#gnxUosWVw<i-)C2YLTjZQ@Qc)-!I+x-^{o1%b*Hq2g8{G+iA(?
zu}z*r2Q|@o7F+SI!Z8rNyMLdVUPm`*Ms)wao?s`h>$AoU5`KLiX1#P+#3hpE{HZsK
zpw}hkI~M0u$R%@DNuLFQ@$sBYzc8{Wnbm}O4Kv|mWi9JQBr>FeK!IgR4!{9^gTEAX
z9geV8m&a~0dYe2^dK80;DvG9VT<3<a!aD^mr|BZ2-q4fEcWGdWugYO;pI!uC*!Hi2
z49$bNRl0^DDOfCzDNnm%mOSqS?||dch|~xnEEHf^txh|B?xljRSXgnTJ$oTJy@6yI
z|DaOcX}QG1D}aFr?nIL)$Dq;k%rO>i3qjqQ0TuAX3>x9O%D1l$SrM%Vy8~bvM@l8=
zGM!req_;{1kt$iFc_BL=R7rcvV0AO{=^ZbqI7Qr7llZ=jDI59MQz=Vk=@p{<$Y~?G
zB3i9pzTKQ@W=cO{&6oAWGU2I1vUK|bQ2nF=3Qig8l)X(Sk=u)v`OqnPE_YsaOP#k*
zoSm|C>>87dhQT}5-KpA^p@GuH$y6L+A<UFgE>E=_E=^WM50maAC`Y9p?Y3Dm^^8eY
z83c2=>u0CrBRi^pS(M2;+5h#j;U~=h{%CDIAOCfIYwc_N$1n1!w*T8beLdCwkKf<b
z6L4yBcc~Q5l?9&6yguHl&vA2{Rn|%>ubppTQ+Q-q2D?bEh7|A+RBv{E?!4GLI{jhc
zQ6U#JRE0CAAF#@s7(Tpl$1~Hs!;6x#dRWk^ZOVK22Xp0-cDi=~Xugc4`RoU}TZ<^~
zZ4yMxL^pIGZr_8MvJwLuu~T|`x{_(ybh&K3M1zakGQ6y-lcyn>vZW>X&EFbqw4s0F
zH+jMmfcQLXc$hg?K!ptH9k>)h?Sd!QthZcSrbg=eK&u>m=@^|6RE$!^(Z<BUG)Vga
z@UoJ4ne%}U21zhLR)wB&BJ+X~e}h~=`;so4i#n^PZ4NqAd3#aY8+eft%?dC2RWDTL
zUiHe!8|`)Ji%x;=%#M9TGH)nl$V10#daCe;0)Q%DXhAPO#clJ5EDp`@kz|T5KIvo^
zWAhZGh7i-4TjlUFq;HqVd{j=;+%+$+6yh2Z`8Sx**W_*%8;IPKU##Dl<z+C8yU3K{
z(;(F_nhG5Op!MBko44Ns^d=FfUzb?ifWO;9i!22KJo;nU35KJZ)nXlUnq^6R16YNr
z2~=8fv?f)?!Nw;Q1q*bO{l>Q9WgOK*h(s33QLlcAPf`JWKTNWlPCw}RH=U9FVl;X8
z&V9kp$9XguQxn#2swu-K#bfz63#jQWtG)VR$~p*|>g^MZ<KD%#J#8+=K*pP+3MgA?
z>-UBMim=`q$CXIOanz@aCQ3uzw}?e>o%xYOT2H;2HetRDeQF8McRZ*l0{RJX{HSFO
zr1{pY=BWuiz|vmwJ-paEIXyo7=iZCDTu)sD!py7KI?QtXEJ4{{@4wkURU=BR0nxo0
zb*MOg3v75{h_8NWdk@PRbZHH5Bs{tBQTGOq1V?F?KTOp@6%YGkb9}+CVGxZQWWmA(
zqTtFDfFJN4&I;8NHiZeDx-&Xc9YD#k^9#GHJ3}vT%&Ma6b9HAXi{?Z#vza;*q7>9K
zh`Y`eE<PM5Xv_N6)t}q%;}kDi-=Z%rtnTb`#AoD-X@=_>k0U70hKn9Aj-CcjKt}HM
zV^qP44*&O{Gk;aBf&B)#Cp&Gf%GS<dB5US3mR|Z^ag@)VcrQ66B5I)YpnqNZOZw|l
z15KXmzeY<9T@!~?x6<tTT_CBodg+bA2XU;ft<{TgG3ds#WOPz!Bp@lmWJWa&h9U&2
z=DcLXr8v4gBs2s*YWBQ0Xa^|NpN$~}V9eQyMiSMUgDe)LC?C)*QH95Vpy9N{w}8nM
zjRZ+{|I71UeEsm}PWm6)n{JLiX6S#`*SFgF{2%SF{-0mwQ?36wIzD{aIsNC+jL=d}
zu{`Tbh|<k~?^WM`y(%jMd?H9Vsr{p(WG~Xq;n#{%8LDzq>w87HfmLoWrCcUiiELwg
zHe5X%lO+yR@FznN5c0NF2qVkyf<Sh3y!Ub+RYEU!&R(A`EG+#VVB<>#|Bdp}CMbak
z1VJTFcHSJl-ZLdz-xZ3`+WiP?rwTP&%9`T`Kk182Z%pcg-dhr0Ik%c<w#Womj7IU!
zoYz*Bs@3V*jcqxMI-;Xely+Eaj=73~f5#iiC_o{>Pr~61hjxX3lYSFJBlN{@iJTkH
zt)ZMJ7<uUe<c1*(L@cMYG4NX$C}oYiiF)V{aKV}_v`doEU`9DdAbEa@3OYC@TkXfR
ztYY?!<GHW`Ijt0G?*9D;jFGW_y7%T}VPR{7YE#56jN?N&U%l?+{G2Z(@NVzw0t8?@
z?NP+(Pex<54lFkP;_S^)=lR)7)Qv#Xo15!fPV2NhO)D1`cSB}l-5XvO;lJv|){l+>
z4_=z~W#;7SrhUak*#MyRF?N$bieb#Cbi&Q@0LJWLD2*|$2&xVBP*C6mc`hY$VDTQq
z@q|Ni>PkK32!!TtVfG;P;<x?{LI`sLHKFKbi0D<aR0rs?0K4k%7|^A)*50_qsA=c^
zi-vtlj#@JC_U4uvw&l1iw^ylTaD-+_34vj+*kw;g4B<=5Fhb*0HU+fyoN*k$+io2B
zWUTE7NwETunPmO=s%)S<&XZHjm43Xpf3Uj)bpCYj#X_x?b2X}=CIe&5VyMdMMvl&o
zU+tV89{+P{3+*W_(AKPOcRDv~A5dSJ+WhBk`G0{Z-r@pqI{(*twARk&e_MaFvH6w%
z`x2ii`G0p#ewd#AmkZ1p*29XBWKzV@>3TkidPKr(cHzw=8BLNO;Qe}oy@~tUy51XO
zh|eB{Q;1Plh^O5SEF^r}8IOlS_eKnSF0yQ#K3QEI01GhbuJq#3s_%1&)pUftqiudn
z>_s0n`9l>kZ*}>TepZ>M5ThTo=^!npF{p73Sd>HRA`Y>W#M!X3-ma;q-Zk1rkRMgz
z*t68GF?1I^`_qH3&z^a;^|sf92lX;58KsA|I@#K&Y3=m<oosDP@5IamZPB`bAa8Lx
ztdP``S{_q}UMSWfz>6Yt2gk5KWc4_nTq{M34(kvZd-px^ZHdn{wCYWar!HETMdR#?
zS2w6gUjQbpH@>OePtZ@IraaW(aKd1wVVzZ-c7wJ-2sL7x@Qi;6f13$x0|$V(fdj$)
zbHIW8iA&%>9o_{F)Zks=VDRC56ka=+eL-Wp@c!$mcY(Oo+S<mS%P{Ke$D2X7=Wlhl
zodWBoK(F0x`@#C=cD@BYsEe5^LnE@c0UIm5#rED}d+XTYTkP=f|2V6yU7w$Cw*2${
zqoBXJ`MB33`_Jmqy^UVb{q8(y`7oQ_=6bQT9_!ng(7S%TW%d#4=HCW4j6I}})L>16
zfNj1EuF={O*ZI_|<sR2TfV$ClZ`fQ!*qTCFXxLlzHgKS3)mrcZ`@pBUZQa9nF!A1Z
zLA$@%+AbDoQ-N0Z@uT(4@7Cq^tsD1m2*nXq^OQmlra(jLUXAATP>pzbgRqn~6k$2?
z#kCOXHl@Tiyzs(@4|!LZNxj8^7pWFk0w9wS>cRpPgVpWf#OR0AQ8fE)tKqda>)Te*
zHdh3o;kt9hi$cW<thipc-nN!EVP0$3!Pe%+R(ERyUwz;`hc@qUc$EN*)|1|qEpr*L
z7V|Jzqh~3I(Y*_=hU<UdTW4sIH}(1xEC+MJZhmS1hQ|Z#TYlYkUbpD=WBs<}yj}Zk
z+tUE`=7gqaL(%}`9L-mhqZ9&$iw)5>Wzhn-qCpoe+pPGaMceP};Ou1Yh3D=<GI!TI
z5aj0K7BoAjxDoks&5++tJjnoTW&6{+^9E(ISGGf~hwZY5>tzo&W^VBI`gh&$wp!iF
z4eoc>g6|$Z{;s6JIu%%d++E-BgUylx8{9%GfHI$+M6|X(7mZlnz#Yr@YAUtosMN|=
zTA!m*J6~yIj!Nr!LN;aJd1ae!3jO-7P6Z#ryLJgB+uUlwiHSHv18A$Z4TSUn+R)lo
zonB#~^=-sn9Dt&xg(??V<x!mq;sDmSO}VxVU=0`w|Ix-H8Nj+~+dx|nU|m|1LL1w-
zQ*Z$5GJrxAlw1gC@Cpa8v2Dt&%K*OHg8BE5WuXCVsJ6|@=>cp&Yme*nO4bQ>B@SRi
z22iMSvB5_O7Q_L_QA6c6WB}`Jzqj6PJ^BoXiEOLFVUphpxku~8M;jHV5J1-)L#@px
zSW+J}8~KB%wc!?6&mTqW?t4DT*0w)(Ww>!X2G>pFd=9oZOz$nXz*=GWYfb_0yWH@-
z@7(u~&G0EK&c|RkckuWLE|~7%QGN>EBe%d-ehS`}TVOLkg-!SUhP?tGK^?g94Tsh6
z)(gXT85ys@$>dlWFVD;5m>F-)9{yda>zpi&Oqjo}o39%#&%=~h(d2dg4WS@(vZV=D
z%cdNaER#ig^>aFi3`Nw>iJvuuN<U}5^CQQ{j1&O<DW*x%QYth^5zW`zsInj;$R%6F
zk{fo(^|?4es5uV@nBzij$p?M{Hjw(rvw{53uz_~R^p2Q27F{1d>a9QOe%ETXHrku(
zed5CNrQ5pnM(=#n?{BQPA8mk8_vpMnooQpuM;X(`Z{&2T;?vfEJM+Hx47cX6YAnZ>
zuxcRZ8(ygGvT9tZgjFk4YRzJxpayR7_163h6jVV5s{LpN1J&;Lf=BJ|W-w4V03ea;
z>xM+OW-w4VfVPZTZ@eM{wf=bHyG_5l`H}3ya(xQ(V3u#qebk<tEufiNJH4h@ggR~b
zjmO(~cZAMesgC)C<F^=xiYC@o6Km6(Sg&rPElsSqr#I2AZlWbkz-czMiB@$JYtjTz
zjHykmRW<<}2{!@IoYn*}DiuvUmL_JL`Lhrj>P{QLV|7j!2k=M+usIzJ#OhQuu{9r7
z5i?ZL#O8chMf_4l6C3kkmEnqtO{~v{RfcaWHqo9Bs|;sVY@#(MR<){|SaY%Ju5|kL
zteDNzSPV>&nId{$!b}kvu1{&lVtVqd4VL}zd2X_Hj`mA#tu$9u<c7prypk1C1(FWd
zS6q;U1VF0({ZnuMfQ)qNgh^*;`jAZ`GJ|lg)7X5;+^j8@XK`A`KnULy;!{1}f7RJL
zc(K28P_F}|Z5EFvf?<T~Gz}hi&Eipb@EBs4Ot==DTNb)(Okrk-M~?Eav|TRFH!KVj
zW^BdFOj=v}%_`6;DbV_jZe_$)Y=$Q?U+8|dk@&y#xs&}zI*Q}$BF%#FN;-!b2swE_
z+N`qw-P~F)*#B;{zS@6$k<YzvR=Z)enqDm4TfFDJlEkl`?*Ur$63lt(B(Oq>3!}RZ
zMo8O@<pyU~Fn9rNo%<s+=&UIlj38RM3g3ofKsbLTP6n&^YxP7|sp}Y{xr~+27RLSw
zgS^kzHTL^UYZb%HjX@l1>u)P7D-Dl-$g|&8Ja3O|=b$+W;!jOZFjOtf383I7H*l_B
z2Yoig^O9f;y=gNIg3wv&4}vG2vje>EFa0F+qwJaYJ@*D*y60o~_ZnL0!QUJDOD)L9
z)Cnp6%zJLKAx#H~{+4DRR;+rehtVXZco_o<e4B7yuy;Wc+l6Tqsw6^dZDnN(&LFfQ
zNMkZ)l!(M+Wk^gFEE<RdD=X`3zu8U6RA98%7yy%E?BF9Ycr*oXbitdlf{XXkAoH5n
zi;KNc|LGEd&jseU%S(#_o2TEl7J0f)ziltVT%LZrzDVPE`t8Qz4S(6h{BOVjE`9r6
zs(o03sV;ibE+>uK-qsI-r1&V!tY^#oowL=QMaFei+UL}D!F8B<EmbQ>{odjtw^l>u
z1)7F|;|x6S=IMV^W8c1~F@Nyh!dHAvdG2X~AG}pBz4kh7Z+H#7$$xndmLI@h_|cXh
z552MXr`PYnKUv~6``&|J@e@7ZoFiT{@E)Z1{_EG3duuEA1`qxl`n@Rj+r|X&=g{$g
z;nNS)@~ztCVh>gxc=*3RJ^$*h_uxI58GGNhK0NULo6Hsj(jNheEu8$OOup0F#Ge})
z7OgcKQ2&mwNwbf_6Po`cng1jDwWXoadAwmm@1eJz1K+<9xaLZP{^s!T^oNtvy`$-A
z(CuP&E^?g*-N}5OIkt)zEX<GkPdEkdw?MqeQt*?DS0y>pB|SREHv-smmfOCZ$l7Ak
zJ%H8m%fV;mzy?Cxn<SUe()_0~$50z2@s)R;#3OHwf_}zc3y+gEl*_L1pO(0V@SxDw
z0&_f5ICf+k2NVO@9IbNZq%o(5fga9>u}>ZmTwsJLsU!|A#Y_(RDs4{bXPy3S^Lqn^
z+BF6?Y__jG+yvLtT7ca`pABiyZYoGjV_VQx(`#)~ldZMsZNldf|JiaoaavC^d#r2J
z@}o8C=kW#)ee>GQ<ZPkxk2}X8uAVN~2Vhyb1N`@7K~s{lGS6QgVFp*+)+MjKUw>Uh
z(GkDbun~|`8>N$$&o#fjsl(W@GNq7CpSBit(&v=(J@b%EzUOacCP@D<!|}ByKi3vz
zbjjkaX&U>+0O^4bP3bQiAbFnwxd4fMx3+fum$lZ`HSnc>N%6nB$L&eS7x>Th2cmt8
zNX9W+ZTb+i)KXSjN^5IVuW4CTEyDC=bE@7+{wv0Hk^tzPUYT3KjQpQ#?TtsS{I|Zg
z+1~mp|9y#1^_j}C{!Ti(Q;$@;)aQr=mcF|~p3B6K(jlKF6du|i!C51bjUR*$wA`A?
zVZPJtCc$MW0sYB+N+jBI${vUb4^@3F^J1%BjdQedGdwU3mPFB7dP&$te?MRHap<~!
z4^Q!7h&s9_>hw^F9KG5flOVaNtLK<Y6FvU;F$Kj=DIZHAVI_V*IK`Z(7<<cYW(>`X
z0eMZwgVk>@^Sz+gBqn2g8!`KnT}Zw+6=E?o=?;)j8SADnktKC-ozu*!0@qKx>nR1Q
zS0e@H2Xn+#FNc4gv9oC9YEY`4WH6DyuP`S}lA?z8?g=U(IBI#U!b+l04TE53PE|5{
zLXj%R8AVHz^i=51=c8w;9)*XQPIbY^(@|-hf~%FGHg);M(C4fiZhTE!(>~4;TWt<M
zo#4GHNG7#tHP-O3;<R|5tW#bL(@!~q^fn{l<^cv+=Uq0+jloK10zck`7-tKUsY~=^
zT)>94NRncVWOt5mm1?ro@Z7*b(gY<9!JJPtKOT-aPRL|w_k6>_sCBe!t6}fYKUL1f
zry3?z1(^^?IsKpmrTj@2b8fY|ibtK#2csfCSH;Y>!;^C4Ke{egdD0}<GC6y9vbX~+
zNZ=kTlbRLozabW8Dw)^u&cWY1yNAbn4Tgm{g#d5MlNi|xFEHknqZP9kt6{-iCTmCI
z!im~|gP-CHgZ(MY<JqaGW^(xW{eCTUHUU%tRxeER&m=sx?dLKlo;u-|=0edDRFi%k
z%-1o3>y?nxaeO6eummZjJZ%n8XU}CkebY^3N-Fps95F~+?RjzPy!`f?x%Dcy+N5l+
z@k2o8^c~Qa_M|2Q(<7>X(T({LyJ^a1a(B|WWGCfk?V^P>vz^!buMXbq9h`P{Uc5MN
zKi@gotC8!M0T|8`x4^&E)?=V#pBh<9P*ZJ9cZ1AY0<|Hz#aryaGIBC|KGh?&sYu0;
zCI3P>MNwO2Hs5eLH{;-N2$#2J5f(${_X@O1_fo<JFsG<ul<OZ=>_G{QE@gK<4XM$T
zB`k1kpOMVW+U}+MI-PV&Mw#E&G;-e8oT|blA|<@c>?9x#Lt{K#RYr*dz(1&1wEf)3
z%pNspaEsGYp`Wu;T?BU!)ZT$MZknCO=e6uNlSN|c7}9<z1+=z+!;6%&#T9#^4EsM5
z3W}6aTq1kecU&kWsw|^s9n7c>RBtA<;$hz*w)De}lSxU+r=KlVz%HIGp9!ckt!*9h
zRtSGD9^c?MvKD7XO7l_l^P!ra;SRQQ{^yzjTSMx_zn*!ocaC3C1ee{{J0~X<2{0DM
z(4TX1&pt)f@kxUiyZLPJ5$B9I;!Uno>=h09PLmtYANXNpR32QDB1UE5NTQ#Yf+Yuz
zJHw-FY##%XGMJR~@j-_X-i7t|Fk@^iF=8ooZ|c=BDF^<3NI)TZ12biz76mid2MI;&
ziehRdxE=?+%)}#NLkof?H+K~dhj^ot1jEqp4lzbm0Qh~0mpc-<R}fK|vU%UDjaT>n
zACK&bdIGbMm<3}Y4XQSwg+m9WfZoIkWK3X%vg+6cx1b+)qZ>skVYrP7N>N57rZOIm
zko3945kxdS3F-|`aVHi949<O`%VR_eCxR|*NmM5+dwbVmN*dg_`#T_&ffOqq{eJMr
z1oJEF=v^3Km1BBw1C$#R@L`31t{SRSO8N8n!T+w=n@!Xl6<h8@UcZ%;2xnz|Oyjw4
zagdes93O{;j_hFJdx3Ac#guZ)&Fsu=;dPntaLXC;;bouJm9o<R$~`sjc3N?E3X;WY
z)b2!aXB1xsQ}&PW3<TS03k}m)4AI4^ADk!tpmPyMWrTIv(`+;hoXd(^kez4Be7Djy
zIf<xD1}RCl>85XLc=wBK;EF4~9sS)_=@HUSI`q4`4=#j{kizs;i+n4Sa#vPjEU_Wi
z3(KbwRG@a?ue7gN9pNt2Q@z3`lnlh&2+2}%w>W7mjyy$Bl&Y01rw$h=CiVC^qOKZ)
z20|Bu^!H6se(n^-Y#`{@7e-L*KDE_+2EWo@xH6fq%e^3HyFl+R1u-boe1;FGtyPTn
zg}Gt7WRL-@%4Nu59c98P8>rAl5l*!?Nidc?a2YxvA|4TT1%eO)l`6mhc|eB0hM_L;
z2UHfe2~iD`19mX834>539MNNE!kiz{DlLtO7aYO^gEk6K=sQA2eRtrpU=l+NF@Plu
z30p+}NFF97q)<<}h7dQJ`k+`6A96t)XUSv<%t?UT+LJd1su<%Eacq)>j_V7}PkL-V
z)st*Ki}+CyUQW;3x&@vdG{LTh#0JxdcH<Ey2B1;cy;BZ$brnd91DHlBX@~`tjL~uC
z!^XhD4^R)jK<t6e#jZ_L0m`sM$Tsvt4&w<TL4eWUiI?r(FgY8?*46R^&4E>u_Bhb)
z>6~JY@}w@He}0SilvHhna^F#0S{ixkQM^$?Ry|5I>ZL1789t2Y!I11}C8BI_8TOdb
zCJ#z@auJUM%-eVaTSP?;jnRBe)=JaOT5+XZ)Lk|>_x)4P#-9%&q&RyQB%i9?YqYrB
z`^>C(mR-SDhm_CwxsCmgHsKig(O?+N<@<r38U7#b_04?z&yCHsul^rj<fHvRyk;<2
zT;#}_o%CkZjfcRuUXu+z|D+@?;We7#TV`!+a`XH~ML_p3zGlb=tVgkm$^9U>#-|~k
z#+r078udMHp3QU`WUeYCHze+K9H%KJ*iiAa6&fO~hhz13WdTBQzWs=~13Be6w5Kv3
zLDFjtZ^iRo<m{T>>>Rv$jr^z=Cw(4e&&N(t2al1KDe5TMn$YOAWemIn;f9lo?;P!W
z3@iQm0@H>?Y!B;WS}}wa+vYZ#IPj)!4i2DIU{&O?nrxFB^jIlBNf^Eo&|HF+=EKhO
zWY9AsZ{&4w*m<#MUh7!%RR!36kgPX}jT#|@{u`0t+xJD3`S9P$j5E?^o6+cl_a|C=
zKM`y1ys<YLWU|MF34IUM(7w_^zYq9uiA^jE)|GaY*?hfaSfgGNr^>3B&P5*$mC0n;
zAJQcRCI}OQF$o4vF}i7v2J>)*!*X~c#)?-dnM89!MVRM^0^DP3qW~>iv3bNSfTY3b
zEDeU|AdyZ8`R$Pc`%&0gSu6p>FT*|>T@z;#M}}i_5j7nHr*j@kHm)4rEwaj_8uc`e
zRio0ELlDkLe=F4ZayGU9PM<rS|A28>oUUA~gwZ^G%*g+;wcg&y`+vgIujl`l_!xTm
z*WZKAU*+6V{v^ixMJS*g)%~D1^b--HLosa3!gIfuNu~}Wp_E_&2n+}=tZ8$zbi|`D
z%h<ZJK-xI@0yZ{-$b#%17@j~_)4zrwZNr03Iyr~w{B`A`&g2UvQ4m6On|nVW9Uh-r
ziS`zj2@cX4p0?Xnl~8(ISg1J_MwrNC5Y%g|pX_zxu@CYnYaZ=%e(2i2m~YY2j={f}
z+rT_J#%ziEyQlEw^z8V+WEQmGbNa*a;ZM#CYL+sTy&84#-JgH%Pz9^o)6?VHNGxXE
z!BF&s8iuI&oP+K;gN`O6N1OZc6KK~ks8Y!!@Q^8tiG~E+XLt?kI^w$mUe{&#jjFl|
zg|a>7+2f7ki0mC&_0J4lG5_v3K+fs@Z#Q%SwYx4BzLbIbQ_d(6U1qs$!yNcBeW>MK
zQ_rX<G2K@6^hNggb<Mf)AbsV~AEfzZ`B!glaSEtdEJi;w__-HJ+9+S9>pA*#%{R;l
zZrN2TUFFQ$rpyZ$WIRcN+hJb6IHhT0p3+iU($tg{xg|WJTO+5y;ugeNWlSw3%C!>j
zmS^Ujn#=aq127p&%SWPmuS(l{>kc{bXECL(-CIdo-;V>s6jV~F<0&0B$!s;V1hr+#
zZQAK|6<_40Hm<8-Fb`14GsWZV)>tS5o1`e<bg*d6#k{kVo#(Ijh`e-m4-ZaGZG*j1
zik?@q9R9d>e7yf+uk!|<?7uqryfj~NBGcK9Td_*pT76PEw;$>EXPwz)kz*~HLG_`g
zXYsF=ss5clcas0{9(VM~^#5y*T6y{ZtN#B>eN6nP3f+G})qmjV6j9sf=mtn108~3m
z;^C0>mL(c)OYxmoGkV@nsK{5>2};FH`UoHsN<%>*CX#SGram}~M34ro<YnbRNcxFt
zz2))V!Ooj6ptT&$S-f4Y1&2wCB7F4ewVQXm|3gLkC({45;D2lR{r{-_=<ELf5+ChZ
z|9zVEhhcZ+;@P6}3{9L04*^}>XB2ZY&6i8)ZVDb20|)?Lak77S;4S@CW0hnS{_9d@
z>CT&-zX69)r~(N2dz}1rO1=Gq@_J!3wchiyS1<Q}E~(g^3{bCFUGw00@5hpQQ4(BE
zsr73AMF~VYgRl=!(bc%p&z;w=I>c|*hJJmaMiE5uYn>vV76P8Ot(?-T1+H#tpP#4l
z4VocK!hAOBLQVSoN?e&Ib!#dJDZKZ-*C9z&{8sP(dAWYPC#nVW!fvGg?Ady|UVpgG
zBXaUys{#Gz-tnPKW9@olt*$PnLqAn6S0S7L*IpM8Ro^hLNkZM!ThceYs<=^HFR|vj
zg$=6ms^8Pyo!uYy;5a$hbCc=11!`GOL%D`O9&%QK$Mt$e4Qg^B*9xqOJux=cn?5hP
zy^hQUwvU!UaKxm6m~$?bk9!A?N5&1aRu5Yo5gOnt<2b|S-I2f{x<tQMz7L<Rz)6}6
zf<`~+`8SPzntoVP48RiGrBTt8$}TT?BH&WgsN~%5;hlO6T)>d6R)?Mx=et!-+^Nob
ziAez~20v(?=E^ffYq2XGkdPB6Q_~#Y4_oSu$4!o>#k33g7&I-9=whPb1uFv+gi41;
z0wL$%)&9$Wc7E7<eYAIsVVv$=SCqk*B^7j|N}(a}Te526y6m35=5;wifvfH<tq^dR
zlplljuZc;8M#cFBb{ksQSo>~k`g-1Wsd!-kjPVU#vva*^!+3$x;^9B{Uf^IJanxoN
zow?KLjfayI|D)grg{aMECwoRhtXt%&L;}Xp;a9aHWh)UiEveXy<;@Av>(X9G98Jq#
zA;H{x0dKud2k*}iHESZu*DI=M#b;HU=3*mlHN3Q4FSGVwS)C0%SiXPp`nCPA*s_TC
z)=2xn&0ph2sdF6#y}4_LBfB=!aO+FHjhBbVZ+1>4OMQ(JE|wKLI203dtFtKPa8v>e
zoUnyKRR%AN9ZoZZD%6UZZAHbYb2-`DJ%!`Fu=eb@Qnma!{fS*Q!JQTMGMS;LkkWhh
z)N6gWw&uh(?{xNFyy|r7<>NPso8r*oWX9xmWo!Du(Aq7!<PSSP?$P#`wr^kveg+fk
zPO_lWsa5X_y_MV+<bq4p%jvT85UhPOWm;<E75X4WCn^%9o4NMolvcRFJdn0&!Q9k9
zW92lmP_cvEL8DQ0Hyno9O>IfU^QC&ej|z~>c7AnmCR@6^-;!OQ8w4NRwLvstJ@YwC
z6pIP`rsAI4d<7Wi9zt37Rm)dF%_=E|CTsbtVvDj>k+6IfL&c`hrQB8w$fR;k%2atY
zF=ePaXXiRBKjpbtj^v-<@R_n2)4~1;fUC?N+0;-ZMzp~Bn@EujZxr{L2Sz2=F)Dm0
zzl74L<^8TGkeiCDwqmnv20q6-uR1>faK7r=|II&l(*I%PMnH*qHGnhh|2Eb)H}m#?
z>tFT%U*;oAi30DWmnl!Ji#UFpc2f5zM&M!@Q9O^y<Db0*>E_NY?Je8Ct(#^H09CLw
zkWiQ9zPZa*bhKrR!yUpK?Hs4V(DX&lRa4>)YxWRPos=J?8kriA`OE!TKGDmj*SZD<
zIVl@Z^yh~~H5{lno@j>IfM(8>D%6}I%r{r8D2XTwGox@a*34L(|I$-q69RV(A3wL;
zs_}q6a%##E{ro%)%ys-Qhz6L~<92Jv1G*i)%HR2B+z<Z8%~=iUR<pJ&Ugp@Hq%Qj(
zG-VpkXI$lUJp5EkOn-c*NT=KQNK!@PyZiiUhtGz>D7ek4=O^iFNLXdMpBNA{#Q6Y`
z`&|Ku@&o<-q6!EgXT-t+NB7#+FZ$+9KmSTmUwFk|%{#Sqp&Ea+tLc}^>brR>TL9|u
zx1s;;rur?2Fg;3N>>?1nr*Gzk02E%(x9!Cb+h2v1;^$8M|1Efb{LJA0+pVof`TPHk
zwf0y3|4V#Um&FIRPkLlm|GKiWQm=dIO_cd;aHBF|u~uN>>Jzn^jnolVt47)B>E>_I
zoUN|SwOpbM#4+Eko1%)cythx*lj#Ky7;#0$AR9^87yr{Jj&O5EeLv|NpXO!~3@J&G
zPGo??%PxW&JZ#t}loHqJyg)Z;7L4TnEjO&9`D$eeF#?qV?;z9Tr<wOUj3(FQ&BZ#U
zB{JH@By3Og#ip`JE}G-!!@zD!oj2%F&2dM@n3IV-SZN*)(4RKWVmwI8=TtE2Rb$@Q
z>fwgm4d18>LFMnO%-M8i0o_-MxdG5WZ8Q#*%Pcva?>>Ae>5t-Qc;o#JG$lM&?rhvF
zy8)BayPB5OF5cN=YlC6f?WuH6Ra3LBI<>*Bx&X3nynfn0*xGQk(T+(7zW3HkwbsRQ
zZTo&lYaDU;;&U<SreM+S|8nZu+rWA8^(6kE@|kk}AMfqFc(eBj`j~b8ueEdMe`{;w
z(O3JwFY+;=2QV-Nr@tEl2~5T@8Pk$7YrUS&u}wxs!DxKpBN0d!@%F&HrNBx)#t9{d
z-=06D5DREcLovB}H|nSavZ+VFxpsQ~C|IP#G848$K~niL34-S*FFYcT`WQsRl=j-%
zruY@Bz@!m|PQd$(^B71E##C6m@^3g<O*8>%AfBYQ!!eUzj7fTf=OvzEW84-!Nw61O
z_?Kavz)<(Gzt-BK9&#U}P{(76qZgcGM)K6_Cb8eASRc@zGKQ3bL82z^od<q4fm3=h
zoxpkEQ?9=;o(bonGLmNDEyaiwqc{p-#_(b_n?(4YBsv(=o4Ak8$!bW8Fbz1A1Gd42
zgPFpnQ1aI-7)WYEzxS5GA#h~?V%!wUW<<A0envOF(B8-o0Y<$fB;zsY@-Q02IE1p<
zXRy3D^DAUnM*dqYr^n`xVu_p84bsdkWGZ=u33OiKM}q)wu=)WeTqIyvt3`ud4A9~<
zBCcQ+7>{tk48m35zr~1)a;9?Ft#RV_XzZBLH%NMuH05w{&?$P5E?&jSu<vxTvbc!H
z`R?J-Klcw_aehbyD1#y%-z4GSf`f%Y9b6>n97Aa#hsbGevHm`=9&l{u>RaUy;V$AU
ziZdgTT`)1mBpmj6QN)p5qnsMp1p?`HJjgYTFbq+hKN*cMoiRYMM@4zIfe*MQ7y>Pw
z9lw6!VJ65YtD5YuL_zj7-q!z_&y@3jg-k{_vS6imKKPhEW}N?Pt<CkE{J+*}eU1O|
zMLykN5Jt@*kcbH-HecF-MMqN9lxXNpzlT(M*c@#vE&9nIed0BnQQRaO=|v#+b65UX
zPxb4k<TGXe>oewK`<S}_+iUBO)^hRxT8}o?*1qolFY$S)Bm7`|Rpu4E3t(=B$lw4&
zk*0AkB({-M9r5{j2)~Dli$E51pDcU*C|m4K29)NR?8nJkf5gW4sBgibW@$WPR+RF+
z1knXb37m=%Yp94o$cZAuvPhXAvm4}dkxiz6ru_hTouLYjCQLr-xdtKf@f^GrW`Q}V
zZ=NjD4T(y44Mi>{-IZQEDk`=Y7ni-wmDb9dS9=2z!v@~x!CCaUj!lq#mCV`+>E`)e
z%o>5JlO{9g4dP+RJrX0ar2z%brRc+&?e{!e9EoBUHh?`P-cZR-1X#AYbf6{bCN&&#
zsK61$m@NEKnSn{z*=_(bQ8I}lW>US;WSE5@&Ur(i=K;xQfh!Op=sgrVvWrv;2VQRi
zH90~ah=WOdX{}s3>7t%8L)5@7{OAT&2=N19_X_Ip3Q;6u64xfZ9x&?X6AWe>_b04t
zgHb|<Sq{`3@*3sSIL3+gP%P+U%zu&_98nJB#xck_eay3kz{hCOM#kKPwZ+~!Z7V?W
zCC$_Vds7KIIiZ8X=>=CfjD8<b^z`fiB!iVvU&Y_UB^^xQ3uQt^#$NZzSV53DuyEkX
zB4+sBSCX}dsf|*Ma}3`vCa^MNAD2f7j3n^N&KbcTz<9qfgW6x|>D3=~YHp|B_u_H3
zl3k1`#xZVhKpns?T>VuK$h~|o?M_57kT^VYM;VXFhp)7ok$)YICL@w32MO)N>;glc
zgFG@p<?~pgY}WqT|NY9(Qc6>cm1$5Y>vm8wy9`ABL7!n7{BY2rx76h&u0=#}K3^I1
zC!_HS4K6<-YSi{y8G?vB8GG!}gK7yK`5V_TVKEUyA&Mi5YIX=E-o}@9vj%G9Y6Kij
za2@o#)7K|xT^S5{l0M);Hi(D)E^L#m;r;dRLG;G&y>M3sCa3Nw{c8b0=R9O*q<~{N
z!y5^1-3_v<KsFCup<vWd_)t)22A<^mWyc$gh=vW}Z75P}+68sJhouSno&*#sJLsE?
zPrhC;fh|lTH!U-n1PO7}fu+CdkOOFb2Gkkp%&`nY?=noX39cu@pN%&#Ok5R)<vom^
zP?d+C@h>Zm!fi>HPFDmW+$F~MxDW=5JB-C?9&xec)CDYdjKy!)xZ2qr+`#1xmcL;S
zt;*_9>c~1wYy!@7=tStutAn%Ew@TsWgqx)`!nDPx-m5#6Mq7{HHoPc|(>9^n$q(xQ
z^xj370ZJmRE2;Yu`2*5Lp(g4@XZQ8t-p_lxj4+4#C(!>%<X^&(k0&Ix^Dd5V!Yq!Z
zo$y-4B^*kU3#4J_qMkPOWeru#{85<nO*Le6*l`leO){;M**Shwv8CNPydb*3k==KX
z&N?SY`v*Vm?4L>)0vyLtd=(@WjR6C39Y$t6Z%%&PMUG?ByN`b!u_lOtmjI`Fb6r<w
z2CklWynnLW{LxaT*8aNJKk1?96-cuuupe__VBv%tWA0gxors8nQQau)#Y0W_=w9c|
z&Wj&AKb*bVJKA}*XG6vw`WrMbzcCstT+lwIwjSYik_3JSGCm>F1HA@G5+|KR5!@nR
zdgpixnzledkS_eUcoah0yFdT@^7YQE6S_|$@+FsWM@MosC*Y2P3x5bZED8;P*V|24
zZU!sP1_54xE*9jNk3gvev+S}X|84rmRbYe3_xM&=`IRca)5N>-lSrZ8?>=nyz>qfs
zFg_|lvgU&(Xxhh2GaKU7V+af|GQE7H8|ETr3m{;OZ(yOt!FPyCXc!mfL&uX7SfUY<
z2q3@Xxelux*u7gDPiUO`uaDN-4wm&slVCWEg2YTl!g&k_%}b>2#mO08Ti%=IB30pm
zZnf;xfij2C&`5GWq(o<u0Ar5EiQ%PaU$_S&l4e4YQmU<@G~+!qaBm6bC8P0xXgoom
zR`+fL@8>Bk9II!!!&Dz^oFty!DN@XqdYtj06!6Zmw+H1C^w5rhD^GihNtf&~oRuEO
z<qoTOe5&AXPxwxn*fKhgDdz~$SYj{5XU?mID=<EZwSI%K(t$1Q*V(*`kq?kMfP)K8
zP{m2~VVhfA73N;_&;*TczcKYn$+6D+1;o73m}oUhMT*Z9Cf6GeF>-8hJq8X{hj!<K
zUNX>eY&wwke7d(GX#xj_m08`-3q;Y|QzrDdbQb`J;-HQNjl9FdHy|@bePQ)*aLAui
zjjKP-!}P)+yk^Ep@`DW)a;laAOMYTL;L~w?PJ$VT$MkN3+V@h@mm3aqv#Tb60rcpz
z#YY(~<!TH1n>YpxN93UC(854`)y)ux2W&i|Iudgh(13oUfgauv4is5)K#Bh2V?QMK
zdAicV8w^A~s0o<cgdXt32mXR@BqS>m9q=Wh0ydZ4q{swfyn7~KxH7__@Ufow={r+i
zgb>m^0yf~0m!Ys|jl{=jeZ7+Y=$xTg1uQ*X`8O#|7HvBMRzL_`DK`rXk`4IFc>=<S
z7FOe+yL)}g$1))bO_nW@x~O7`NNHTSbC^SV0V~3Ya>U?fuD{<88MD+#E`s4Wg)NI0
zg+hPezz8r{LaNBck8h}<8C2sX+ViONHyFD~&J;eqry!l8yc9J$%tVS51K29bBItuq
zkOIqoQHr^gV=4pb;H|>6<n1U-6Q4`VX~2E*&2>g0{nKECB#aDi!roh;*J435b=&O5
z5zvQ>`Di}Q3F2}QEgmv(o`E0*<MRU2Rh4pfYBrQcNu{{#43mix{cY5@_Gbw`!l=@C
z$jXlFDpu=@$9u|mxQLc2TsN&=o+4LsS+;QST&wPClmt{{#4t@KqRx|ZWEfmx`U2?L
z)~eK>Xx0e^(8s(#Ol?Tn#5<Bb5b^5SJ3R4zu7=!?zRZ|eN34gpoc(}VSAZRFJ0hgz
z0)Y>pzADj72w$ZVNO3^&N!E|ABAIK+roi?hwb}H+{7|-Pf@c+Mm5gt@N#P`g@V8oK
zkj1s&{`&ZgWR>#1#xaF3Au2J6x}xChC8Q4PPZGX+$8aiqyit%fL<5=Q+aMUTWS#lx
z1(p`9fi+`N2Io1zlQX3#c~o|gI+95l#A-%rE1HbDxRcIBO{CjG*6AXEZAJzUfbEw|
z9K$L|YHN;e9A_zJ)bcokq9PC|ApG9<^PJHScrFLP!Xs7iDCHC@nt~)PQU~se6hX8q
zfZlAq2eYL~7I34KHZcG5*Dm^9Pg>tuZ6|{Xt3Ss$dYZhDEyOWu>t-?xqVOut&xGo0
z4V2DKM=57$xo~bl)ug(>K~rRU<m*v~O8CHNp+Q;>du5J7j2dUSp^hh6Gd^$9p=?Q<
z7L&h-#xKaP1MJ9@hm8uJ*o4jqFWE&&|5B=2rNaV4LAwEOU&OtMKD3@_?nJ9#rz@=R
ziKeNf;a^*6d9}YyV0*Pl!T-o8_&KnbRz5RDR0@115DiZeNM?(PHg?k<()A#UCxZ)A
z?o;~Xn{h#tOvN#)GKda7s_Rx9>dUh`8x#4XP2PMKO(NQAN^Px}uZEMSNV3@}+5v1j
zw!xAN#pYqHdpAX`ALjjp^-L0sswB;Mm+^2iD$&FpMtsSUkUepK2qH0>gpm+0hR1O9
zghK=X&x$fakkT1ZTh6>1GLAGJJRPi5N5!33S3;SX_R#2aw42!(>6R{@pebIFE8rP3
zOf}t)3Dk58;(I+<Q?&T8?i)~nK=%}-DrM1YWNF`KqOI&yQ4kUh?EwRd*`Fd90(A10
zlmE$V9<Z8|j!#<!jS?uS;!;jC1>>ct@^z8gQMpWRHWQL?&0P*Phl+toW|9mkGd1rD
zcs@W!%BsyI&)84XiTvu|j11|-z$g_@GPz`7YcXF=L%H;$Ns{rMYX?|D;@|k`Tap3&
zVXCQ8@q&P;FwuJ&y&M~<u8CS}(QB|M=J%01<9wcY#{$2Y=vL5i*0l)vo*{FyObUId
zC7}Z?rOCq<EB4^-JQ=(w4KQUQne5R4<@f%W05e^|ZHuA_&J0ptvxFP;0R@EZBtcup
zFe95kUeipDWuphTJ-rN-mE#5ZL~$$-A%ml<vK3+JbqcEALq1#pD<ixuGIpD+VV$HP
zMrk2L21g`OLK~H~d<4|9iHu;aU2j0!O}(#qY{(c9`$<A?@d}!Z*l6C&PsPgo4Yr@I
z6kPX$aVAM@lD8~7@oucRYLK~(t<lLECP9vCG~7F{+bFx%@#v5!(V<}|v0{i*+1S#0
zaU6RQxwpYsBDz@f#hgZm^{APgw(XUz$8}ML;E#1&>$ef|v7!-FB9Vu5elpH1jU4mQ
z_C`?yAQdYgUKfF>(U-eOT%(%N^x?xgb_|dwNjK3MOKAvJed|Iq*9g9$hMeKZLA{0t
zHL$j=b?c-)BVtAN1-SP@yg}E(h%!vbT_g8nqR$y^s|Zgd<gXV!Eu}8?E+*02bct3s
zr_RggFjATX(k<cGo6-ujw<HYzl2$B=Q3YBg17oc;%dmzNPzkuH;QSoU;gn4zvI}D&
z0nO<HH3?Q$R*Xq7nnd6wJJV*Zi&EB}z^ipp`A!}uZv%qGA`2hHz4T((CD05}Q*l(a
zg2!lR!eMvrCk;uih{PXSiHQbGBBj|npCmL2$3g)YYL{)0aeb8iv4m-i@UAvePf<}Z
zMplHZevMTzBGcPc68S=V%E}mu6=}M<;zR?8E>f!tINqba=uFXy8MUB*U83QY#D5|?
z%T>Y{+Cm*Zh{5F6)G#*EBfoce!rlA?az%VaY|0KS4K{|9mDiCqJ2^WUJlc`(>LD^A
z%tf5j>g1W$0jxzwjaHB}caP3QIVc2qTg!1hAjD~4c+<$2!-S7hbr~*{1aGbIrujl`
zT_kTnztmCJY(C>Q6cv_`+C{Q%*)d$jP4o;<x-3|&Nkqp`AGXzv7A=ohkVG?tQ0FbA
zrl}lsJ(|3GhkucC!)(lC7sM(i^cCPvtOfwsA=zFmvh_kAc36OJjC_yv@_28r4&3|*
z4OM!UWlI_WrRo>k1A(UJCw(UCEccSRz9Nw1Z-*Qu>Z|2=VypEghAa`XNyZ=%>WqA{
zc~RiADeu0P?^*qaT30{<;K)rzM;;}6kpXub%I^XdcW|bO8gW=$T<0=I20<X4#)!3c
z=?!e1BnC-_=gm?`KOq~Q!a`PSg6UMH15|r8G}JW~#)c=V=3V+p7-TnmF$n0D;>zHN
z&@zbakPsjIK@`*Ztd#hxc<8fnS*79zN3i?wA?h<$foBXd<x7Y{M@X&(X^GBFUuydi
zt7?f`Ri6BsC#R6G1|9G;q7>YPyC1|6!6f3>aadK+Pk9M?N~|Z}^*-w)xvd;CREV)!
zcF$Oh_{w=`d84zjjFpa5ch9?shOnCJ$X+blgr=-}v{|sU7RZZ^b%b7)D?wZeqf1o#
z<ucrI$&~$C2^ljsauLzO<;<$hp{&d_9n2%s&|(}0_4WRCa(IAhknu!kUDf6^Iu9&s
z)UuRrP|Og5>yRdp>xSgIWD=BuM7SS0ai6Ma=xPy&#Scc^px?J0XjtJZDURiyA^sgk
z`5+b3N6c1-MvoPpS_+zJ*RfMZZ1HQiZJ{Jwa1D1qxnoVT3y^W^N*7eHmsvFCF9wyY
zhb%f-575zPJn0xYfgew6_&rgz1|2#dIz;w5qtq&pN20~NEs~LB`h|D0feO#3_F699
z*)P*M8c0`w+EFX%(C?Dlwfj063e)O7mZw~^P>HFcJY(yl0(4j2N0X5<d1~Nyvhaj|
zv~Ax9rv;_@d=Hq?C^Xl=lca$cD%l4<MLmyth{xP|Iu4@_$lUbf$`7*!UiRac4j!qE
zEYAF)^&8*v2>WS68l?8FKz8b+fbzWycYsz1?5Th+l%C*qRZ!X1n3`!If7VdkJkAvO
z$|#$22=7@>*ocJlX|UR`vNm7^eEA)ki4ZYT?2rDU4g<f;u1V|luU`s<zcL$%d>QrS
zuUI<L#8lDJwnBq|B+oWfv>d#iZm7#@2D<vi3nwF150xs1<K9aRK@qditgYyv#^X!k
z^WrR9Ky{m|6hE1*xD=Xi^FI2@4~?~fcTg7FA(Lo2Vtt9;fO^CPeG^IJiH7@V9i}u!
zsfgTD?qZztUGZwfj`X1Ih;%)+2upktMOMi1dW&;d6dfi5KSG5?-oPg{f<E?^drfSA
z!x5}}rVLv3P*6OG8*>(G*9qn!i6u+AAuI&B8^9q>&KB63S`?KJK^raQ#-q*Iocn+7
z@hTK+Z)IMBHpi%^BEVUe;TTKUy9qF;6y9fq+3?1MJgFDX{Fkt9V*h~MP(!5q=?#7M
z(2WNH!e^Ux<LQXfJ4C9IT~>6fD8v`~Ig2=oN8sfyzD2qr29~uRctPHz%P&?C$W1C)
zJEU{mlar1N*)kHTM3-Gi970^0h|i+D?U87p#2;BCr6SYj96Ttws_COQc7WdUB--o@
zQ&eNb3Lm8}_Aw{XQ7%N(3<-6}28JDI3fFOzlu;~U_zGeer?_j$qMc1zTP<(rXrIzG
zl5vFaYs?FaoT#;;D5Dbjlq4F+t5WNZl&P^taFZ`b)YYf*0wA3Yh`&ID6pwguGe*W&
zJh_Q~6gNW!0wuEKN9GuQm0BF^DYY8L08n-%30;Vybfbm<Tk<0A>l;g!aJ4hd4RG^h
z=0x?x*c_LMBwyCl+V9j|;FS>Sv7e9z%v!^s+;&FUe7`V8w%o3NgWy1WBDREO)snko
zu;Lrm2?lJ4m0pldsoVx*fHq3QZpmSJxf0vpjX;hBF%X6b)3%ErRu+$&L)7ERxCj@u
z0S#(qk>|%-7qw&_88C327==MNF@v6-x7+he(KpiO;){b};GcWJP<bS=EaE3B3WHET
z8lx(u&PUp8)Eg{530>N9PEp_}2*i4&YH_5k{7Cl)5t4Hl9mg>sdot1uDFXmDKd;%w
z@|tMW%bLZltEm8DHDX;YmY57zaq_lqX?@|m1xSr>*ED3N7#Ip|!I@xa)Q<ZTvauNl
z5wM)SaGJH(u1gLKfZc@_ZJD21wA=vIT=4<=G!ap)o1i}5>ktwb-l6U=iQ!OU8=(}p
zAX0LraM1&Ren&uT&W#(F8jyshU|oh85-LQRIM^~B-3d2#W6wtIWQhzFq47m1!9U!?
zj&ww##ZW{eRc2QDVnm(eVrwhSo0|dlI=q1+IttLvE>x!o>in*eo1?>p)nYiJzFg;A
zNhp;xp5PS|^sAi@lVE_DXrF=hv|kfr7ok;Pf1-^JWy)eO%oc5Y+PpIx$k^TSX0!Pr
zwA&?CEy9~}O)z*xkeRHomUfQ*RH=dy7DD~TF&r;9wzVfk8#%|I(e|~iu)U(&HAaSx
zD)k)J3dD&q-Ufzzfdp;9QP%Jzu@+{<iR7j)g+q*OqwrqPx~UW!0GBH>Iw*23)CN|t
zMSqV`gH*VMVk>Ej8A1%XnxX(kHiaSDB|lLeamDn_k`ItLyorF50J+cTM)fT!K*Q7)
zRXa{%F@5O>h<b^C#ec$eL6HQK&VAo>3nR7&Cr(-2G}Db##8%=!omV4ty<qf1Co}-0
zeKTE#*<zAJC@MUQt<5eeYN^nO|C*!Run00;h)rag;Uy=JuP&%`Z%87VL{gfl7#Yv5
z0hIBkIVxeB3nT6Ip!p&4n==QDWCi{~tEj;oFyJlZ)$~P4_r_A%6(t90;75Nr0H(0-
zc%GD$`(xsxjEZc~jFLbb-^H_w-9}R>R%<*(_Zg!|?%6PPA6&{LEj8nC&>=*(wV9~M
zaf^^jp@S!h^_(>fmZAwC8u&O0Qv!wcB)d@KH(JNCer%Oyt~c|FCQzoWtWc4r)m^0(
z{TQt#suRnUny72cbpnqn)S1x*%i-=*eppe3=!=>L>ydiwSX8N}Dw$-VP+_`-659Ry
zJ)Q|czoFD8)w;gh>IP9<UwN<FZB**i=Fu*)(l?+#c<~H>t5tdUb`Cw>)J9}2=V(Ss
zekifRR9Y~lsa8h>-DU=K3k330I2f?#icXLCh?E&fWmG|AlxUzn3W0;6t*Ce)yfNA<
zA;YJwKQ8^^Wg7X`Q2J{t_A4E&C_z-D-OlCLuAAYE6AmSZYW9q**v}JcE5z6Z<Zhp{
z$k|xI01CC2K{uHo7utTDx1SAD>waF@K9Efz^Q)pH=v_#hyhO#R%h`xPduWkClC!Y_
z$+Lqnz8`?ayF%-lKHK|9Ep&5Bd@Tqpdd97cQkGMw3}Y&U9)j^?*k>clo<E`JZo{GC
z&q;fP+#M@FERI<&QPKY2GB>KQ<|y96DGLPU*R75oGApFG5_E}=eC;Seo+wO5slFF4
zj~HQrv4}!!Sxl#(9Z1m_=RnUWM2hzY+PrwJwUt(zni>o-^u}bQj!PqHE$^~duA??E
zT&BDwD^=u>*)n=~(~#IDp11e&>G4iS%Bh$duw|~;6-!0yC0%m!CpJD-_N8dEPN;%n
z67cBMpu8-)u#0J^_tzwj{Hu$&Ub6SmH1oyDiC0UzWUR+~zwY`niN;mo0?Ako=J%C9
z*v88G%35JD#G`?>o|tJ^qU8i5Fp37ta!*(NIu3@^Non`c^_p~DustP}J<CIA!kVNg
z!86o2&PG9{8(yy}1-a5d=9F!>1j||pSa4{H-NK9cCOcK*UA)APwk~38bu|7?Zx5BS
z1)-P#6JySIhvkNraaJYL#!qCoJ8Q=x1r^KrhFCiQ#r8AtVI&z$lpLroWOEHzLpgzv
zmb?v;C>X-YqHMg30XV95Sr0^~l&E$2a3V30PeY1L6i0N`uP{P+36R0RpDAe=It&wK
zhQWj6$rqPnD!|H?LNUU)Ax2{r*a4?#BoV~HX51ZyYzAtm>p40A7}NfF7tcjVAQBtx
z$3Tci;#-D#C-TphrNOoAZEdhJMA0D{CYcW^qB-e?**iHxH}D935%dC*_t~y>t6qIz
zSZ2GH@%3_ZxjDoxny{Kl9I|rTikpyAm0(K@IRzketHmQO@2KC<W+-^sM|XCjzM}J!
zkq^z>VM&{#I3qb9<Dia0@d}WN*t)WF&JV?&%8Q^If*@}P9$~lMiy-w!#d|sf8Xfs2
zLF8i%O6r=lvCSZG$*^z<8cwn4Q;MCx4Q?d#I($O*5)XtqKz!wUJJ!>>${PEoiPcSG
zx~+k!5Bp-9qpqX{_p~jl=$-W4j91gvpw8`_#i@w`29-*whrWs!UbjSg70Rp(AKUeu
zHI<rzwuZ!6Ym+L18yz|#n?VhZ?GJn(y^R7D%f#;YjSuVsUS6=vqWCH~^aK@5LQlwO
zTmePJPv8|W?(NKdQ0EWQ3Zm)Imb@;h<T$sER_i#Gz_|TEV6Nhj6TOUwm*T#e1S7l`
zqFYHOmBW&I*V|GSY6;Hd0UUJ~zN3FY#R~b_a)1`}Cea>}#A4Eh6KXFKr!mO0T@mIO
zR;z^g8U>=yF7IeqOV-jR5<m)scf{OuoOUMBxgRDS<|rcO8}%WWzVqLX0vH^*5-!u>
z+wy7$Xmo%y@R3CWOBT*&2fV@^JbGH)kqa}<f~6aXuPr6&7$CvU(Y~0G^Yy$<y(FZJ
zF&x(vWy0cG6K_$oI35D~9^xGYv9Lnu9-xogI4ufV>v&3N2yIvpnj&WrkyiH&Y|{>7
z4JA;XzN!@S^+hjt$)`mvKn%Wvrz=SmycFY)s#W47@M=>_Zi}A7!r+zZ&UpM|a09*8
z5Q?V>2yUsjyKjz0f-d@j*QW?eOMhGPYRCiDHO%R5tH=eGo-(_Mf1`r}Ia)uP^)EkM
zR!P6#_s6`ufc=Qn(XPF0$0|~L;`aej>8=y+7=@e_OjD;5D6y3=M+=2h!<#{7_9P~W
zh>PI}`7J}!FxZA2tp&|kt*DH{8x;v6w~K&6C+rBHj}37fDx!$n==bqPE4QtP_~tb<
zk@8nS_H{zB7OFh&`|29+Mr_fitLo`)+mYRbV%DwuD3X1KbgnC#46-(`{I*z#)V^E7
z28+=L-nEtTtVp|?92>`4Nwf+uC_<Ojh$pE7vv}Z7A~_f4ZkDslWnOJOoH)L61o3*w
zrD*E%w*`PZf_TOrv_5;bRLRn|%e~gx+Y|vrG<Vx!c?_OLv8>jvH+}DSWb~0~r)%sB
zH)N@5w4%>^cnCZhH1~4LBcd&se3|+%06(oj=Gz*Z*}-g>FLrK2-veq!4YF}1Gn@}t
zz;f!(&xSX8oFH$-9v#|A7tO?i^no(BBOd<>i50S^66w_T>dbOH4GsJ)61=w<gW;zO
z^o%Tl0@7~nNJ<JNx!++YAX|+@MT=Ub3S1|du3z-MGhXg!k3n{ZoJ??4WfinGxUB-x
z{_^>)9$?JZp!BBIrG_FQP%IQ!2{}NgQoPfX7jU3uWY47sUeo@;WvV36A4+@`>JzzU
zbOg7&&Zb-DaOZMDlD~yG{)&Qt79}?Y*J>~6Q3Nm%6DizNQ}K0b2sPS4s_3#PES3u{
zoVcA@;==iOI+y1jssd}aN3y4@lC}IX2@~hA<h5qCXj%yLQe(ZLeJxv`Au;2i2FUG<
zg801e-_+{1hh&uEiw;Lw5cb2NZdhH@LR(>sW*MAUhr_b+RT(ds?9;0Dj8E~8Z;D82
z^-_K`jk6A#9yR6Cf~a1TmEt5;C3ff_ELnEEl8(&HRYR^=*O>}^5V;MpY$dV63)msC
zwp;C)dJvMkt+20n$uH`1wX@OaDMe+zHcP=v8FsxAbv_fjNSS5WvK%SX)D?}UB&Ccc
zS<(<oqYS;pcsIx8=(omQs<J)TC#ay7Db!P@&#pVRMCx+fu|cRo;$|BeIlO2I1Dp@z
zmga1C>_Be3O|_XO99C6KhdK^(JM9Eo@kbapn?qQU@vgC?%ti0AYdSH&+`7&l`(@PV
zH`4xZ922obT6m#O5OHwK9S9QT1kN$-M~-Bb>l9Z;?ke8w9CZ#3kM~aYj(^-U+7xK)
zmx}<%72?BhRzsA8i==sDsl)_LogWj75Rd^|lDW|U)k$ZE7MLz<uwvCP-;P?rTx!xi
zfV#;n!XG9CjSNt(&4~Aq$Pjp5bcA@4>D0O8HvHa$1L08-Vibd(*fw-xLxX<FVB~1G
zDJmtM=t<la_k|)+Y2lHBL}fiMHRq!HXhy(sL&dv3w1N&Xnu`kggLcM)3-JR4d7p@H
zNLf*Jz<8Yb)&^+<)ahCQd=7IFVK|x;<uvPD;kG;J`Gli@q!;0N#@CB<qf8cEBV06A
zGNMy1am$j85d-YkE#*AIEKnwxCR<|zA3={iUTUh6BS3;Lfy7M0Q41y2Wr=c)Aoo$a
zlBSbS%rmJE36xVW<9K|PPZVd3c_Ma>-zZT}DOZ$AsSp*55MN7re6t0-?OS76u5P#_
zs2MH4Jn^mqG0e2X;BY`kBLLc=MJ2ol0X}yaUWucJ3V(z^;7vXCqKo&VK0z@MDH(4P
zJ)6ekxp!f7Zyd7g_evzTeG=$tSab_jL8pzM0^MP(lIF;AtLE^?K(=ot=`a{i-d@;Y
ztDWsbRV6NyaBB!&pip!g^J`#R*!RdfRTx2Hj^<RtE40c?53J2SB{xTGA8>q29OC_c
z8gm#dpg0_43J?c314g+s4pP=7hr0aK8T#Cu92Ajb9K@((Lq?lIEi8JDX+VRvPGm(9
z&14s&q(sUcibaDNOb~8Jk%$zDMI<y=OM~)UCv~~o6Qg1o$VDtfRj^UK=}F12=o>(S
ztTLo3i*CxKgc2P0d8k?wCBwBQhWbPaKf+d|nAJpks<Yu7`qKA94rGjBOA(?&6*L3G
z0-$%VFD6tR?n9LE5-Dw3hzwghR2itCfjVvfcT`(jSV3dtyB4v)*g4vl;42ofqVU^f
z>#ovPut$r;owqDWg`89mf?{vcA&%Co6h086NO8o0F0vyM{wWqqeRTn=?Lbx-8Zuz*
zl~QIeIK@(rUX?#BF}a&<o0cnKX_|US=hMfJ3Qpx>poARnR8F3qGkm3V;5#Y_5P(-D
zCJtg=QAO*A_-wYa9H|)nh9cH8zbc$tabQmgq)#|JN5f<r)f$k|gw#nR<%Z7XIf)0d
zSnN^7F^!a!P-(D+6Ys|mV*~?RJn2Ja$_L=+t}BT#sXmt#lWS{-k;yzqU7L;*CwZ{>
zG*r1<7zn1CMCu`33vvEOr^he$U%u?T+4)&)l;|4Vjc~~PAnPyC$$+>cH3CL`a`iJZ
zqTwr$atzpDHBjC=eQcW1iR^w{VZ;uXO8kYkQqU<*3O07K(>Z^QnQvi1*bL70_e%UL
z`^2xZC050oO%?%Z(#<9efdX)zOV~p;yAvCEXf7jOWe)kQT<{U68H)U*7>nX%g|j*M
z)a7`0oO71q3i7pIss*z?b0c#7pj^Zh4i_ST+srM_m3=#zw*|&fhdkxyarbvR0uuJZ
zK<;o~EG8w^wOD`!eYtuP4&2h`YhG5FEa>=O#@EsqylIag<r;|OfQ$qHB>>j|mDX0;
ze<{)7o&=ZyBokExJBG6qtVox8>0*NBCzFT@3fXcaQWx~Z$V_YHmGO|`n`_({$X#;M
zdTjWQ3HGS3n$##4wPlYzQUMC99YV?8)|0$I05khwEYc_r-S2^THkPxtT8pGeFXBNz
z@r|DdfrZb=F}rV)8f#eE#GGCtMEz{OcM?ftGn-uCZtrAsNXU*sw<{?-YBo)dOHBKW
zaP&5~A;umhsaoB@Wg;fUFdH`P)UuC4<dwoXnoo}6<_ka?n)o-giJT1t^CJ>K!jcx1
zlz`JvG2%Qqe3d5_JGdc@LD5s)#+BKDu#1Igyp%L(-BwL>SaEe|iWWkbq3+dTz?`yY
zu0xUk90XaagP$_vEVSM_gFH!_EZbg1s?7JMdoou<Mj=pQYak2J1x9(0*y4}T%cAO;
zqLl$!i+#c@9dpU{-M2)|OcWPn;vB`olcJ=m5@<PxuTJWvM$XJPVj(B$rbCb&@7R#0
zfL|^#!Xc90>Xa{REm6@qSri`OjCbP{WESrTXi(a_2rtVH(-(2{Ak)fO49uZ<Ib2ZG
zx=*x~p<z~vS+icSB_4{LmUX^dy_8Vb((CB={WNVj-Wd(U$Tr5Jl^fIR58D3PGNz-z
zP`x};M}q6x%7#}vgbj+89Bnq`*qjk^T7o=z*P5AgsLnww_kGsI0<_20>m)hE9%b+(
zJtBJc`JB#C%-C3(aq=n}$!?6!htL`s${QJyE!^l1$(IZdOMSYT43@Mhy+SwUc3IA1
z850^zFMzNR9jH=_sp+n)tTZTW+2QWbo&VfBKE!UxZJJbP$nTs_u#?1RtqTcPl$@l*
zNXs+1;5ip2P_cM~Gf(A!z`%#+=i)ZFW(@Bt?Mw^Vjf~muidyw`uLkFE#uhv?*Ile>
zl<5wjCJFKe0Vs%ut7{_Y-5Qp44NTt#VfQ9uhvae?lCJA+@VLc@ilZThz#7ORo4DXI
zg6Q@xlq{>ObXHiRi*2Or8`~#2fcPj-p5Ai1hAAhrUUuC<rFSRH@FI>6PGrpK{35Fj
zORJ?r15#vPTpkwwEFYne6VN1?0>w|LT#;LQ-w|KBzK*-;1P&<+eO|DZJUBXi?bS%l
z{vh?n%D%>p*j?Ay*><qAH3K_Mx&q0pF&U(u9wRApY|N~}$xu*$(|dA~DTXooACEZV
zdc=w%@*n0zR4ggvkrF7O*&n1$5eH=S-R$|C=7?1KWXmZLW=wrHKu{Es=R2Z&UYM%s
zhGiZVWMqgT?w~R00k0m+yppPUNeUt5NGC>KK(<*GsrC0VHFZpfY%q&^B8Q-?^+h)?
z6d<`1GD*sGRE2UJVkVgHlaLWM0cMyhv=LDSW5nH{F{Wi>OlvcbF{mEPqm9~x$kUP+
z10~`DUg)jX2P5Y;;(W1qIcsZJ<(8i#$w;`2eh`eUMOU2j3P<8~;_y;?8L9dS4I5TH
z)M{kptbgI_IPThn8O|1RA5e~ha^UL_yl52c>%^r8aV9hMF(HXi8CKf5+d|r~B2Hn-
z1WwA)*Fhdq5-wE~Ccb&1gUL_rOvQ^T(zu~UI-Igxd*jK^ZXYJ25AzMAVy`lOl$3@{
zBeke3`Ex{^G{h24&6<ux&X<^>2?1_&6J?hr)+s@8Q9~6Mv>_R6eHG+|^%N8`nF9VG
zO5_GYCIL7U6@)&OJE}A{6>5u91-Qx-XB+d@;`K_E+{*SI>SAq7W~JowVlw5hZ=p+e
zkw*{wgw@`f5Ai+B@I~wyZCgzT5{0L$24jn^G@|M0Q<g6(H>%aEC@&fj<(vU@_%>cN
zbzy~BzeGGE4p195%fZ9YC67roKQot0Mj#@-y2HWkL>dwXhSv;)xDM_+1~Dbv%QGCS
zP97`C#E=v7&^4fh(lM%t5N0%sL~8k*wg<@hH<F0_DvG=cyO-Iw<H$5TWC~z}DNK=y
zO3~fdJ0~Zm6~;SGl!VUkWR;-O9NJ2g^db>!LdSL{r<SJuJM3HBi=*0*9OX81V@`9?
zHLzATR?8Lzq~+DdRz=~Q2XAC@BvR^*Qw6X`wIhqz2HeO@qair9xKtV#V98FrU20f_
zpjYx@$!n%^D6>q$6vNYFa(SX}S0P>mV(3iLJ@Zxth-9J(^q6HL9%_tNVIC2W)T<fW
zC_Q-cgr@g;#B~d>(qNDLhvm}P34^2(FlZeHyBZTw77>hZ$%(p3b7?T3Ramj69|~?*
z<f)t`i0J}ZRb{<c6tF3%uEZHoaVt(D6x=EA2$>gHwp*7v=YfhK?}=ia1`OK|Pp4R-
z6Y0Br%T9nrFVcqjQC`)<1`Mc;qxg1k$Rn>VsW?b0&DZWQUYWb-&h(+Kt{|kj{Mhwv
z1QI{x4{2wf7Y(8V=Ig>KFeZmwQXOJqbA$(rD{%!&E5p(Ha?Z3w#t3#-?#y%^AbO0+
zfTX>ChgIY{HxQOGq0^|iG6$dvy8H@;%EI#~GfZxS6fAIJ@@4U`PsgV*g7CE6NP}fj
zeA_eb@pN{L@u~~4n=?poY;cQJwc?A~yO^~;81qcowM4;yFH@Nd6hRZX(ijOVnf4Ne
zMKu{NK&ni&Jrxd!VxXZpr1r*Qb9Iy&#C?%=yS9Hzy#WaqLN*^ubAJz?tF<`}C}0tV
zM(?mi3P_s$j%9;PSNL-8o864bTk<3Z_CD0egcm@6+hakuv-|VUozowV4}Vfz?+9(i
zf#0{zc0%SDTXRBH$@l=?Juxolvy{fc?k$4yd^<)EWVSMtjD*sJvQuAGUsf(SMyC1!
zy<)_C6ns{kC4&tx83~)a3T($J5L|?`<yh$$?bBY7;AbnT>c8}QR{GhM1k7HiLteF)
z-%-q15QA<wGl4wc+URt+FVYHPd#_)0{&BW*aC)X`9vP-(#JiI!tSdq0GnFhTEf}e3
zIcLqQ?Mw!Eo!fep7ji7?Om1a_CLeU0!Mbsj2@3Wmm=coZ0giS+dNF<T`a7SyBe9!M
z^5r`Tp)iSb0K10m4HKHsgF8d9PovQ=qo3x6Ax9G&{p!@#SHVmJ8|=#s&Gjau$&fdt
zh*BuRnQN^ILyQ9zfXi0HAVB1-?gpG>J0-&x-=w_d=ye&_69zaUC(-AI7tPp_my)MW
z>_7=@$j=Y@@uWM{ks$PihFoK7w8Pn}<Gnh#mNC55hm(?OT$|fQ?l-lR+D}QpKN*>5
z7sUWwO8ecg{I|M+PT!SXp>ZUq?2h`@^qE0quRJ7x`<yUH5!|2RL{i+@vZHXI`r2*C
z&c#S@%Q;bXo@tlezD{{;EsUR_awu?DN2ggyD0`u1m&O$S?*b*GNWw<PaJXrDupgDh
zEM~p+C=_PAz4jN$H9XWY5=qUYZv9nvf+;oFD0n}u4H^iUkOD9&%0iI^ZR<IVVgru_
zb)4fw)Z;hsSf`(&NXX~s#5dy2H~ij&k%gsG&;*Z;FL!p@OT3E?;t0wTFcXNG^M$<$
z6j$+#bhZ(@(tFEiao*Qn2j7)MX+ngSB%B>9-If~q!TE5KUMv~BRnO(f*9@@^KBU5e
z0D%f9iw$`eVk_G0No^vf0Y2T`+5KU!mi1UfbRTyP4iEMyRk_LoWf{2a9PP8PCw=qI
z$+TRj?F=XqqcQ1UEJjHbzdl#OXxNFgN%$0&M$TjwnOBvoOinzZ$d*>yT|cFyxXR$)
z7A#m3$xns@;o@i=IFACoK%ON3jM-RKpKQNKAwoqIlaK0StVlIVUzznSwyoE=9HmT*
zNlP?unyiJ+tt*9|G-=^PioAuCsPDRS_X4tK*jtRvIY`Ja2D+4Z%bMr%Q>`=xSr?^2
z;`=xbZe|VKvIA5`6PaR0`50q27|eH-qPyl45cs616lE<Y<nxDuThyF{%fc>?Me~4y
zz40PZ<efHedGI!+a_-~Gmlu)9XiF*-a#gXu6r=rFRY)mImo&R7ltBfuBHb@Xc{Mnb
zUq;JO#-3s>NFPqAJVM{JxmZEr=9sx%x__(E8WLt-&8lM}(Jd7L=LUvS#NGjvaU*(w
zAv_+SE$w6!Re8%xt|Q|SIi|dNnO0%O_&~WBqva40IJvga`^hu;C^;&wA-3ke#xk$d
z16^WxGCrZ8yF{UhSO<mwIo`lz?@SZ|=^MUc98=1ehMkia&A%<1(Nrv<Ft#^QYqx22
zlW$=lviOs<5Z>EBSVz=jIsjHcslO)KG!-m$=&~^4xK%`B$PE2LNRROr_N|-KK5wrJ
zyqSo#_cW{2N!@MPw@8+5JuI!HH&~(7;7On|df9BRprfj&4v^|llN@Q%J}Roq8q!m8
zc38cu{5DH@M?MQ7y$O0mGS8>{_r@1DsVL-C6LyefW8JGsuIb*89>q0~0)C3Awt$Q$
zT^6lWQ=?*x&#CZoOICr3j$-n|DuAifN;-=N=)j0|sTQAhl7u^sR^#(??HHZJfMX-E
zr*aTI?JF)zb*67L*q5lE&rWb^!jn^%j(I)7SU0J{m(XpiPf-?q_o7L4N)iE+5#q1O
z1pjr5eZ)yqXl(+~8;U|m?$somWkK&@F$R|X6ptKZqmil$z<E#F@xCu<<XJgO<m;O(
zbA6&t?B^k>n3V`{Gq}=e%U*ya5JxYEH_uOA$fNM^M7|vYKVqKaujBob-PJg0y{)*$
zd*g?k7MXDx<E5%7gN*;LkI!67YUeFmipqxLgq+YsQxqSppQYog#9U2M-lB00=_%-h
zuq|<m+e~GjXVzR3zpIOQ7^o;xl2|3E-mDmS2n3CQ5(ruGOE@VGGiiJk3KWJdH*yS!
zbMMs9(wF$iu{wnFgoH>vxM5%L5#3H1D2wa|idUH0Z&}?!`eT{Nl{uc+W;2&q+{x@B
zVwDOSrY>tFuPg#s9Pj$1UgZ&xNhX^;p#IdDJ+mn$1?06ZQyq<JKBo|aauVfp2(h@G
zFoH>pneu!?mdUpk%^f8H%B?W|8j0tq_kxXMG9}f`_$Ac83Ll2qO)Vhd)f0-x<hZ1%
z+Oe|w(yxMI$Q=rkPX=&w5u(g7==x7Qeh}Z7Nk<DF3bx^_8d=Vp!AnFnO2Ddzr(w%l
z9@!HqU%(p8ln%{4!`h0W2Y8T#Twlv1OA=<B?_zZeIic!J*h}JOT;WWuP;HF5wH`S}
z>HD3WP*!Sq!hy3wb|26V_WF8EEA3NEKAy_Z{fx=5E{_-3Y=VHv3J}xL4R9=%A%-@X
zQRc;b_r}#)bWwe=Voj;Pax-IB^qLjLha8>RYm;rH>soKqd)q{&R`O55A<aCdITc*Z
ztc0|nouiymBz+Lbq3qUy_jd^3E7m-a7-j8Hv0J`UsXlyj-_^T81#~t9k+SzTC$S?W
za{RBMdA>Io#@#|zmx9l8U$PLX3n?r0G#nsTkvzy7@~zC5^TC)L>ih(Jol};%K;<MQ
zQ=t?N1)Z(x%1>~Bsb$_EXLnl2d7tvNI2!S=>@=Z%D8_uP{s7@kN$cp^hi+v8E9{%t
z*+}>u*A9fc+~wmDOF6DY<ZI7DgPmNpT0JGF8{JjmMGPg^Wi#uB?Vn248p^%2+2qEa
zejh!vRNSej>|*d{mv8>M6TG+WOOx#47LgMftJd<y2e1jqV~8564N&2Xf$v~v(CB#f
zFGO2rlvU>;?1?37W!z&>?%Ohqxm8=QTMBYk?u(L@E+QolA;r2xpxBP%4&b#$f#S_;
zddO?a>9)yHgp#L=AIXY?n3fz<7WKX;0~sIFDb;At4$>tdUYtKlT_GMGyhO;r0rGwl
z_8SBEujh|HU@~huhe|5_%vqmnejRICOg;QM2goL@uHw*Uch}42w7;-n1{?&PLt6H8
zS49%&(r9x>tj*Q32HrPez$(hSCBmGe_g%@iqv=FHP0d}3BETL#MT<&p!xxh=g251r
zbg7Le@#6|zDcm8`n1WD-<Tvi3+pcjlwPZ(HZnq|`#X1Gz%=a{j%uz@CMWqYTb+?T+
z!M8K<FiSzM5p*F;8<o`~CaxMC$~v}MVVaDkRmwzHgP0d{9mQczv@Kh;5!w^zE4PZF
z2y-o3Co>dzPT5e4Ly@<rezZrjSQ(n55K@&ajZ~1{nkzE#Qx4YaS=m2CAEBzvA1QVn
zlPnlZ3XB9n_A?R+&oUc8<i0dkF+1e*=|`D%<U_MBGExvtd&oGioi*5I6C>WO>7A#f
zn!Ylfby+<Q$%v!U9%R;xw0Wpxwna5thd6$tM<7cQ;ntDOV2WYcNQw1QIlS;_XJ*cs
z3M)B~Y_}<>lo%!fFt==AmU%>L;8KiK0cQhMD&cj<K)Yc<z9GX`WjWA^vf|;yXk|98
z4whNu0Em-y0>z5I@WrA7Ef<zVwX)=i#&RhQFkmq~0-(Tx5d#!zvwUSyEL2SSLg<XG
zW;EwMTaIDCbpT0>ZVxWsk{UbBd_-heiSb0qn|qNkQ^tyrNF5#c6eEzVbJ+AIaH9v}
zvY&WAn_(e#!Ag_;B`!Aw<?Srj>T|<UMocmZ2fRn~ORM@Y?QphJ*EAMm4Y0D9JY?DV
zqKR5ENsj8|z7rV=qhQ-{_lOIpTYK^Eb^?f7%3PEIB}gA~YQm~0vsx8tUO9H?khJ3A
z;i-((4p7*>0A%DQ=BG=tg2+hLF0?x^RuaaTU1uMVjVZ=1zG3{kOgdTJWp7ezgAyeZ
zYK-4oRYcb>r6E>eJhY8N(22jSgb}i1{t=N`Ey(lXd5PC2c?z=LiZ6B3z;b_P*?ux;
zl-EQMvH_=Mv{@)3QJ%env)8YMt)?x_`EP7X#v+NcNO18uP*DRE!5Z{>Q~?k3UMddR
zcA@T#G9Ol;YMw_R?2p2%N%?-7O5K5J3wu4sp&^f|H5I!-@iaQ#DDoB<5EUs!oh1b_
z!0!es0CV3886!?&>h{GRFU!y>;5bhl9paIJv*2uzyz}C1aB5%NTd0wfb?r@q1|vGk
zx?brKGGBv0q%w(8tWB!>7>hK<FoaQfjtz*R%=P1~&en#uK2!oVCbo6m0@6tr1oKQ(
zNS8jPg16j?B9um1!AIW3PHZKbx1X{F-^t52r((9ZSZ181q6HRh6imtmPT3(h1$+Ze
zffX_iJ=Wtx76ZYtY}*akxnvTNBl$!}3(Wh!39;Ek7a|kEX|synSmB$r+ZmhBsk49p
zp=X<;D7%`}i9P1({%|-M#dL__I_UHV2GaRUL67-So%yFav;kssB>c9ve@3z+qp)Hn
zRk6F~#1@rA!LU=IBeeTKr3HB4?SA(i#uc~%Nx5*k+k%IRfNm};eCs@5q=G4*ob0u8
zDeKb-g$ic5fwdrr5aHJ2EvC8>qCnve`y=t<<jqonB#JK&<wsM2^U1f|X-qGQI>}+@
zPDq1C?As_zmCmImGWsQqU;;#JYon9ZmC-f3WKSYd-Q%cq)2r;~hw|$ch13>BujXkr
zcSts*T<<6$lX4SKzC?>BUI46T&=Fo7k0`M|?@dNDI2o915IBwh=106g+Ex4GJnl_W
zjzpXfNG38Ma_=U68garB@NCgD7h|L%L7^D%=@RKno;W!3BSMFSD2~Yb4>QkBkJjo4
z?3QTnqwf)lwaPA?lEMeD>p2F9RtXTiP}t|&Mbn-eFDNBfceKId$P{XyTc&e-pC?zL
zXg-J6E+bT2QlOaN#-spO%02DnK$<|6c$tn$0IiWSN7`9SyKRZeim?#)Dq<Mrr}xHT
zcFqT=Zw1~S>Ds6W;Vistv!0VeoYUE;PK0Yo8F?uvj9jgT$}Q+RqosBoG|R6q?Qjoe
z1on(#PgMKzHFWT3*h0REDZu`;6oQUy%8_4SwF^!aSc#Dk64Fkwdz<n9Vvfp=PXDwy
z0!}97OhwmQ8#WbblwXc3Q)4T@b#9Dk<AR}1sIdvfb2!0$BAbt0fXN0w3I-gy4g-^3
z2CFJNNRRHrn)s}*Tj#Cs^q`}*_HQB|^NnDrZ6z!~wZ3gJnR_mDy-$i**88&qHLHU1
ze4DbeRqlrf`JlgwjfrXiA>6QCd-!lSkxeSVWC`wCJ&Jg=cX0S-?~QYu?Cl@?xbqs%
zFjgRVaSwx`moN@$f+j>38K#PK5IWmIGh-YW1w(-3_Ke=Ca*wD)3QM6;o<V@FtB71v
zKmhbGf!0_g$E&fNXEqiRCmsyp&k`=F^mC0XgJsPwP?L-y6z)^EYiNRyG;^73tP4dw
zO6u7+qV7%Wq?;|VZ)y-B{~a0hqKOj&L)^uMwJyk166=K6zQk4wS=bUr=$e5ytZ_Up
z&z+$cj?f@cu`)fywKXJI86K#Te}a9NjYlex1t9vsXe1`$!Ks)@<Wv}P`#_Wj*}bN?
zc-v9~N7YfB4r`0VLCj%s_^RYGjD^FIJ0E>Ots2st0v<-jOpl_<%YCDY1>jn-YF3m@
zKFP^kSLKX+l{H8&A?da;wU=Be7j8eaaz?VWQw~{jUEwUTET>|euN%Hn>d0zP6D&ot
z2ZOZG)GbJ!S=%IUoQN#pM~-O>6=cTQ2`-NJD+nLxHfMuCgD0QK@B(Ajpy5#7dPj8l
znT|Dv#Lj5RnbVM{2X=OPj6O=yR7*^Xig41o>}z@#TTx@mLE|Xr>J~RH3G1}4*#5!m
z{e!*Et_GrH90?;1lJ0Onz?QrvCvZOgxFk6{^W`jVvAn&Yak3=sk;fjOOz=d9h1*v-
zX<H=EvG!rc8rR2^;QM(zi&T^@gS`|Dl7bS79H(tllQ^4<{A=BpQp&EfC7_bK12Kl7
z`fflh3CS!<T%-@AKQX$=sRM|}F!tQ?E~OF_RRQTG%q8iCq+4N8Py7CnN>Pl-h|RPH
zC2ai$%Dp-O)Ecq%>($xLR6bbys)<vLTgpvK*dQKPWpmP}@uJ*CYabN%7N4U%qEi>E
z7nDxTz^XKn4+>05)L~tmE~anT+1Qn7vDlAcqG_G?T?f^VlucZT@sYgIqo>3bb|d-e
z)U4Dg>Kc+0xXBopUs7p2VTlv;Z%dLWHs_PdsOE_IJ2V%hB9u`PPi{-`m`gN*lDa-e
zR)eg!Dz<{86DF)-Y~h|!-=~uy^9DxarRwoWcnQm$*NQe^$=rH1bm(Vb6Hr;WvGSM{
zv5c5&lANV&A*Ca0;@(bE9T>(}p*$TiLWeFf@dgR#J}Q<`5hlWg1awJ_a*@?Ks<Uoj
zoYExTbIA_D{bA)WaU!&{&KM-Q7zvl&%%+U?a@J7yOj7_N9Vkk16UJ|x4Gd%@kYQEE
zGwf`gPLYOf>59N4fWbc@s`t?jiq~YFvlpO7eyeIxm<b^YrA_h8e9(8Ac(Xv#{1R8d
zc4&;X608C3Imt&$uFI>{^9VcA2#`$%o+t$Zq-`&(R20bT=VD@!It;05;Z95u09d@6
zo(lg^?8h<dCg)z_wJ~<AqBiQfTeXOr4Cx0c{SURqvjK~h(O;E{u)z+(x-*fo^vxuS
zE@u7FPETE~)pX_n+4|~|U8(-~&aR)PPs~MLPWh*$842#91XVbMN9-OMS=utqs?sTr
zkoP&Q80qNsaEK9r{>hP8+#VGJr|hSMVJyUO6J#wNwF&`J9Q};j3=HFM=_aj_uUdI)
z?dWC>jXQmPqLp-oGtb5rk}66h4+$44tP4G6c14>wNV|k9Lzb=n;E2@7e5o@9D18qd
zworGkiAp+2kqa@mf^@ZT726Hi;SjWst0M%6G-2xWRfuG=5+>nPqW8u_<zK`>U!~n+
zyE&yiW}n|%b!fNk)c{I28nf!6DByK1EX52yf^r~megIF*H<b}rejQ9ylq;X}HG6M^
zV4RwUQM;j1JyfteVjOMVquIH-)AjGxjQUx~u&s(+uRI==E|tUL@o{E5T8oJ?`%Q#y
zKwd_}A=zh;u%`|VLbC3}4)9o!8+;gY^i?Z6s?M4&I~8wk0%G=E#}a)P5niS&8rjA-
zZdNMmBDuVfA|-f}-!$Y|-!+$>E0xS`EdFV%x}>z;I@hJOhWfCF^FqSyO(LDe+2=rZ
zxDp0c#MBlwyc)rnjYFnQg_(7+#Oo%KPf`vJI~o+vb>%|PrtPHd{f^M4Epe-zwYNjX
z>6Mn4<qEkd8Y0pca&cfkZ)?|bE{}o>1WXmvmtTxrvvdh3Cx&{99#v|xJ7zA}an4(P
zahjQ~ZBmH_YB`@K9Z3xJ37a^Mb+5MGeu5d1y~j^lmGR2p%vr?{;}v(lr1}({7$X2_
zY^a9JLf^`<y@^ub=kAe-UpEV`xtN^%<r?hGJnBR;aE?2hH_jWb<eFz(qJ%d}Y;0{=
zxKu(6CRyAROA*EXRM`0;l1);+AW%|9#JLvaJ|p5JB&kkgrmat(D*MAHKv)Bp2vqE5
z6OM0)nIoNG)u<|^hy!lN%8A?F@2VF^%W0IH-up(<=zmaJx7^4m1xlK_etP_%+@skx
zBuee9%E~3z@g3B-Y7n#xG$kvo-Q2`pG|eHL=q!mWSy68I>VG`;XKYSoYAxch71=L5
zuSSo8?X|29NdOqpUY*Y(_egL<WGSF`xoB~%N?#=Lm@VsV3mDg~-dyu4KDUZC<kL^0
z<^pG=V#NxxgyL}$h(nDs&l@+qHP@oo8dj&XOhE_OkdpJ=17*?a(Um%m?|;y4iv!jQ
zGZ~C5$4WeNNeI#hFI{QRWOpsIyx2)!ZG>1;gq3A-V@a7GIWD(EagbmgB5LL7%bHHU
z*|KPhjwR$AML@gczL?_`+1yG)3`Cf|(&aQ;MJyWQd?wf`C?f$;_-9JIH4<M%6<>px
zY!gDPLBaACNuQ-}kx?xt*`t^T#ZmBa^g13`<{3tfqQlb4HMq+BWd}DhDX)k`5ngDu
zAzwiB@zBI*BB>qFM45x76l)y=xF#_y*bSah=aZo&v}%9$vK(G=Wn+&5O#tzjsuygt
zfRqLiOz6T-IV>9miwcOw`)rH_ZN2n+K^M__!0bIn`&BiO>0vRC5(T0sPpYDw@N6+s
zPl6Zh&=STg#fwXt!S3PFKlcw_)o14A(%hGDsSQ-;Bd3@u$2BE)+}@p5STgzb#_w^m
z>DNjF3eUpm)lc$W=P!<od(BOd$&I<Xcd*=dm{8Sc4a?T!=%KyYKT_ViCqHb+w^Otn
z@k`s|fLN@=bGY?L9c$V>9z73JGMlvW8{x)^<v8~f{n!MJP?4-TAFL6zbZ2JCa#y8Z
ztvf{Y*lo4)XX`9dQ#goimmjCp8OPRTN2VHWJmW%yR_gUK(WI$wVx~(bj)lqeqM{G6
zeJja_M4Wlm8ETHHQnAW0@lq=%T~KHuaxhb7W{zLl)I)ubEtB~cHt)?QFX=Kc|L%pA
z(OYZu@`WVwVP*w|;uui2be3CmE>NtmSQ%jEC^U=Hg!OW%=$$2^gcVaWCrhkhBdzbe
zTFZNmUpHHAiquu!l(D(WHG^y{h4}Y}>6{Kr=@sUF<+lwh%%bgXi)F|?1^%v3{1hEv
z1D^n&$ofcKCOYpMZWJHj?{c>p^kX4kYdhA5GYsje(#K4-urw_;1s2Ga&IPDQDPlTe
zvGM5^=L*X#tsyb>opt@?kKS)|C5qux6=<Y)!YRDxw1WJ=`Ampnp8S&i(MzR`_oFas
zKtmsF-yf$OPJN0OlJ1&3g=|zU7PT=m>*4S#otEsP-K;ZDS@D}0^g8KP5R5C!Tbb-b
z4EZQTrW_lwNcD`2;~bkINeDxV&sy{vsHzO-<z<<ZLB)lF!ClSXk_}Jf94fRd)t8<k
zWpk<m(;{0c*w>kM#trl%cMK>{IzTyr<0dmjx5H-V`nyWtpl^~+ft<XjsXlFs7_C{T
z(oqwu40CB}97a14IN;3vRKd2|5(U_pL}xum`l3Q;t6U3xkiy0~at8&Xm_$s7*poA_
zT4N~<#9PTlouL#r^g}WVR@zzXZp8%}-=37;PTOmw+_^3P&748Bl7?(tNek%UC~trt
z8}<QxQ15jWurUN18>%dauAOmNCgqD5wYd+v52((A;RA)AfZeIFAhpc3Y$21x=N^an
zW&|78l?@Wx6rgUhM|Ys)@^5ATu-*LBiKe{w(WOL(s4ylBjx6o?>c!{h&F)PTeXQKf
zm1f7}ZrZv5Y9#Q2ysrY>IoLTJGjpy;OTjqqx%`7<Q6O5^7f!}b<%Z$5S*D}9N<nM8
z!Guxs8JtSEe^^~afa5H8o(>Q)jzP|$2-GER8=@Q}%Q7n*zP){gCiO1jI1M`NmZTCF
zAh?{|qihdBqMrmmAhqkFV<o_Olp_<uqG)WCI}7O8(4N92;RMh-MxsJ%5tBkEa`d;i
zh+)@c<*we6do~9_<;$GB#@osWV4XC~?JXKJI%2)GCt8PfdCCKFE-NTfMWD;(rlmG-
zajvXZm5B^qymt~s>BwA$uekXxRI$`{-ewQ5ITXVmV|zW-fCdqLmBg}~VT{{7!B`?K
zN#ccEWWEX#Ls_tv{3R8PPlIB^0>x%EB=$8*seBfge6UMFb_Eo!ouzmJ)2d=WzpORa
ze`_eiG370lTk~Nm#$&V_{bU$Y);adNb;y}S2=_T;u8Fp;{B@Lp`$|vGbX`Z<7U#oO
zm92woxMkhH%$IkH&3KK+GMN;si=v9tzK9Xbr=qC~nN?`JRhS@}*6X|(wl8Vw)r|1*
zgv1PsI$NaK_JNb_SEJ2q!jo9Z9?+!H*!@dd;XcbW#_hy0adsdegv~fD*Jw(PDGZuu
zv+Iu4PQH~?`#+AvBi%|x<CsTNekv;+OckQpW7ct(R1h|_Fl;C?A9sK6hl#ExNYzG@
zCYa0m+H@-73$0@vYBi~&vdS?qwK5=~h8`iu$|H2oLo7mrnsP-&krL|YD~3*CQXSz`
z>1LV?RE1bY=Wv>3+WZc0pZz}UlT6}&C7AWZqJ&}#s(myyh_r>#G#FXRAo9Gnvn}J$
zt{-o$UT<x<hS4QXYvP-4%)HozqSrIFOF%5i1^_rg_GobU7vq(ghrOPVc48K%sS-M3
zse3Uw%_V1vvv23=Hdo)B((Ni|6SAxfS@Vjy8OcqbLN>WE&U~_TkXR9v7+{8%l!{W3
zi?&>?6N_Uwbel#q)>?T~*ZMo0j!jGSUUfa(hw&inNh)?HuD#j;w9f%^aGk1!InlEy
z$|vU3lwg1r`847sbqlaWTX*Rq?DvCcNpxb=u?~~L{I$x;joBy(dvBU1mbwbuoO9+c
zcJ4-nC3j>>@tF@apeTU~`rNy*Z+3;RlS^E6$7^5Yu8hOpieze<oGY*Rqy1fV6J>G5
zHlrtL*U4m=%&<#rNfBRcmTN-U)p1!$e7(g6n!TYAyp$A<X8$(ANL-k_6$ni6zB^S=
z@k};3ks6DMoJAy1Y#)uigRLl<|ATWVn{aR%b5#DDBGV<ElC2P0eJDRn412_J3@HXN
zh3IBOIQDOysBnZ9{Zq!OK|~i?k_AdhGUiM*4o992;w=J}I2fW|SKk`LB+@|=t=ae{
zB{JWjI!25x&p<LS=^`v24bzZu{7Hz1LJ7tyz-JcU_mkl)9>nZc#0hN+izcM9g*+FN
z%2`~t@AbxGCKUE|s9A{{m7eB(KWKc=_rfMlt*87uaA<^G074u@+u=+q)IBn1RZ5KY
zB!(i%jKC8P1jc%PZG99>pWf`T%b1J%R>yy(*oI6y_`XPwqGgQ79M-lB&az|$4|A`k
z^B5^?$b~);V~E$UIy<lTUmald(<GL(IC)JJG0G|*txncG=PJmo;Fx^@aw|zDY!bIN
z>!6KC`8+g=djVqh#{^x(R9+ZNNQz3MS%z;Y?~<DCL2BKf=qM0Ea~(*Q#A{(Edvy&W
zdK8%OvX0>67SG*x{n8J9E5VuvD$-mWA!Eii?qt^@0#Q6kdJ<qR!AQ)2KriCna}d}0
zH0D$U2o+2kghjN{>W9-eucfgmrrK-`p~<L9JyxVlig6>lq?{*(3s9;!avpLtbFOe>
z;}6?D=9Ee*rV@ar=G=yOApR=;ZO!qI`OZSDYX2B5z2Va3^8)4-gW9rB=R9Ji%z5#4
zh)+JpZ_eKOw!0KlT*7cIDoMyx(G!-qw5rTndb#p(5~xuWCo#H%BigLl_F$4vyk!4b
z(E+MG>)9ip^1nqorO%>gTmqbRUL~#vk8zP#4nSgs#!-XRFtWLuoYvv3DGEI@U@F_~
zOrwFq*wMl(wQRiXpaMGRzOUj2I<Yw2+^Hs?0jmB@#4i)is}TE(8q>mZqg3b0;N+VG
zlcP|(>bd!xcvB1gSk<&D(5Hc@<@p>(B@HWob18@|16H|3NSyH1V+mOyG;t*BQC>L6
zdfJ7XB3x>J#KWW0{lkNkRsG=T`0yqCv-fiUXXa!q8$lE3fyPDp(2EIRMH2}p0!*&d
z@x}QtxF#a&c`qqF5%FkGgc-{Z;OWlaj+8PO_*qrVHc<4tagvdBVgoP1`J1J7qX#t0
zBe9p>86#InC%xyLjA5-}QGmRO-$4^T1Lcia0O)7}+Ly=jv$rE*awz2HGj?vnyaeQr
z<wR#LJ#r1zkw_!FBOTKdU_xzA2p7Q-t!-~;<{Xud0kxIG8|@mXqQ9{Ji&!bdffG&!
z`(ht2G&JJzL%aECMy@-yAqG65LlxqzB7&hP|0!{g+R$3;QtVZk!D+ckWiEeOdK2|7
zk~rdIU7Xa`mkcFrL@hz($y&i$aw{2L?wH|7>aroH<RGCwIDZA<i^_Ixq@M^ir!?2H
zE{yuY%-@O$Y_U1YC*Np@x`7D`@8q#im}jEYlI?*!))%C13XjF<0h{SoIKOAD{E{8<
zGh_2HJE$$}+DoN1+gHjHrByIdAUGN}F;5$0|IvQTd|yrpY+JkNiz^nFo!isA(M^us
zkQsFm$c_S#eA_s<U}6QxR7Bq@oWBSq@?<d%R*(}?i<ujAozl-JII@H|gbv1M<SQJC
zOX_oEVPYE4im~q}eG_&7$NTEw43!4fl_$lwP_nM;V=bC+RC4jwF@AT(6+@~@v~~*F
zMwW!y+q9;wNCV@7YU*p#VRUr4$!s4g;aD9B(delaQ>kK4N=SDVQlTtD*IXCUOx{9{
zo{m?1B;&F=+|@=}$pU07tQ0UWoU7?>U}@Du=H?4drik5rV-629Mgv<^GoX8j&oYWd
znf4^EcaF(qn{DY%^c|_kh#yCGSc`^)T#%!P!Y&w7!h+oBq~un@1tKtKP8`M@Kw6wI
zRa>qb8R;<yT#lJGbGI1$*xUxS+S6qKHht|*B3SdjZ0y`wgjPuz4#(Dy)pSC@qE~9Y
z>KceV&xb)YfGuW4^ipvO?O>|YLo0|TGq2?%i2w-exkd|FlpJc9D`X+34Uw+T+4P*p
zjH>C$7|#dT|8y_FmsUf{@U3Cpb}YXu0qumvLuD-OI$1a;pl{W_GJturbJRIFJl;Fm
zJN|LcHGEa(C}Xl0)8P^`mC0TFlX&lN4|JZUPTy>phs3=Q%@sAN0OMU{RBhro{0+om
z!2TD(>saCxwpbqB0d{eylw_3va$N5D)?0*SGQkW>O<81VHTUKwyq9Yct@=TYq2FVh
zcx7W?*nUYl!5*O{adwQRx9BP63eqJ8HHE8hakYq)M~O=8$>#lT_mm=Z($mVvmZVl@
zxVG}*tFq0v#8;D6S&O9wK~!YVMbF&bV4xIR_M}_X%<jW7_XlPWQ=RB|-gKma*wha=
zKwXs*%DNq!WHBO~&><K1@_egNGBvEcDwK6H6_(u0&zbt7x&w3)XU{K}XzwaoGp$d3
zkg`U#krPbHOn<q<=LkWSro_Uk9<#MkK6@a?QWu|UQI4U$J|Hg})Eiia^m?Jojay4H
zAzBJ2!x!kIg$~PWO6pl=<&_f_C~{k0=Y|4cS)S?^Jh|Ny&cl5pN<L~`;>BXzCy;PB
zk}73y!OL}ADZJ{(n1FaaA^uJct>Lp>QqXW~?87<ALV(Umq@1MA$&M$`&V^=lEFqT!
z&?|#Lg~x@R5s7j#b#GJ(8j{;JtrZsz^6o1G6|tzoisNNY6Gk;+FMQJmiF}+vvgn9l
zxqm7$i9Iq0i#KS>?qjCqwu-aI5_uAI{h`lsppbkuBpiM|hf$AGiVZ{s#9^rL=%Iib
z*-e??@P@p?it(f6`b}~LaBN#i87~HF2_>l#)_}UK?VP+mrs(Z9fXp$XovQMdF>L5+
z(O|ln<A~^Ml%m`on#x&<y%d5@+WJb)cm%+gpqz5_NQyQNm_+duvUq~#eIgih(p;ls
z&bb_uIKw<R>K#;qN9Q%2B12UCciL-fkJlcze|hxyH(zs&?MJKa$9Sx)J(gnyg|Rg9
z$LU3^oxd2_NT)z7qw?D#;;XhF;sjkWXf#;#^ajzXrj$FlL>6P+J{}m&PyAWD3`b9J
zr(kxPrzm(m!GEs8es=Nn@!H~l-1!3t9i}KXQXcDIoa*F;t1AO^&J%tqy?Yn`u?C;5
ztquI!dbGJ_|K(46{Xbe8t@hUD=A-sHlxweTu5J8>xAqZz&iw(z@e|Mcj|oT<*<?z&
z8Snp1Kg%8>(o^JNydWMv9iD##GJXC0+kK|&|Ix<kr|AQ?_@hUg)%$;K&E5a4t=9V1
ze|Vdpru*ri|Kt0A`uh9Vo!&M4$JY?RIQHS^%4p+ueN3nS>+6N}Z?_*kTK`J_zr^RB
z_w>_!7ViOLcade|C#$PhS63^8XtEL~gVi)X&#r*$TGgU5`Ac606$o~bjfRV#cx2Gt
z$v+Pck52Ya=!fU+{M_078U8zbbF}|@uXA$x0)Ezh+&ezmKRjr7zreZpXB5M~zrl|Y
zs@2gw|4(({^IM(Td9io0d%RCq9n!Ax)Io&+1#AT|V=!SE8SPF7I=rV&C7^_Mtu3Oa
z)Rn$mWA8qE=qUw1YYep)NrTKdQxNkw8D;FjWXO?>hV=8#yGKV>S|ed)p%Ixc@US;1
z0Y7N99<W8Tbl7U?F6-15dPKE0a)mZbp%noG$_AXG$_Tn7^_lEcVbn({F)#`0Kn9|C
zB$P@8hEFYVKpAqa=?7ko!oUN`>OTei!U5Jj%0VQN_7T5S@GVn;8lp-)s-nObQnzl>
zEF8oj$V^aml-W?*iRl~fk<K_c4-%bw2GexeL$o0Pf=^Nf0Plguss|ot`5Ff28K#@m
zgQ12DoJd2b(JCKR(zI-23SPwDBiWULZ}uf*g$ls=|FieBU2Wq^->>zr&`oI*LlWYI
zmc4;+;ZnNWvn=g_a(B<ea=cFBfZN2*jS~pV^537Ckz`ALNq8&Go<sI@N#xOJB#ksL
zmS*V47#K*C=qNmeQR`t8TN*zR!O$5KmdFS~cgw^Ve5mwEu8$&x1@RO9Fba&~b|pn;
zKp#Iu!h<yNqibM%{j~GnJzSnk*MdQBc-(jq(GtI_<nTN+T{k9+=3xKB?%u)Co?MtR
zkOeDsOfnPMe_a2IGl0eTa}fI8SGL*y8vMBpg9P2J!s6V@tZ3EQ|KY2JUtP~{yQ4F<
z`6v9m+#Wi<H=R+f!488fb~FyoeCX@uD7Xs8XZ~p0L#q*A7GU(G?j)x+_e8&8KhpVc
zd`(*2h{J?%7tK!Jox0FO@HOZM7i=@+U$*&~@foDOVV|5ypB>Q3VVgtOr*GT99y4qG
zf-cuT+0T7vFu;9mb3g^#UqwOH#qLD4rSnG3&K+edL<5(vGF%NZSOpJ)CeNsV6yZw{
zGY*eM;1|cgVgpcQCWELJjIGm0&!jv@z;|0ozaLQe>X*XrM$Pjwar%IV2kyp~8~Vgs
zL9a*e@tm;Yi5-CgYWP=#>k<Pc`s5ROi5JeCK3g-4uHP4E_+s;vS8|-Jt~e1$XF9XQ
zk`3E1Rp!V_0=bkA;=QWXz!P;lyY{=i_s0jNlT1`7%>aqP*kH}}dZm*k3yUoJ|7lqq
zsbNf(ujQ1llUQ7{d(PPDmrm5Z2qnTg`Ef9|O7vomPgXWjrrJV`RbK8EQIMtY^N%Hv
zQh0PH2bZaLu+F=X=mwPv@t%GVN&eY{B_teBR=*2n4M|x-5rXeamMwSe7M@wsNNi|2
z$$b$-s?6N_bZ>3;Na&Id2BI;0AOII|>i*8bkM^hIqn}DAz%_DsoQ^Fr1hxEt1M;N9
z@Nf6$lGGNKP{$FB7b4d!S#bzWC7U#2gsxqrdx(!t5W67n!~4DcqrK9Jr0nS9@!>A~
zwzF3yUTbUz-76c`gyi6poTge=Za5Fb55&meQ7C*FKV8ZJWi2)Zgc~Gdxz9Zwvn#rD
z)$@$x8c>*8ZURb65duW+2MTU_Yfri*uHabr0y^R!wdn@y27*QC_0fehYV91^pAT)E
z-<+P<OC0m5DXQLQvPozNL@}3YpCw6>!o}ES=fcIQZ56PALR>d0lX#V9kIONF7#HuP
zL{uv5lKmWcB}uK)pF;E$W|*q-Y5sjFLXqa7IsKNrQt=r<fK5?giR#kWXi11P8emNM
zHN~|2LjhL}4Z0inE;03~nPThvF*QokpFUwm)!khRfElut$Uwl??!kyhQVE(7yfALh
z>sGC{UIiPsUOgY8g0xD}>iVnQ;L^veN~`o<Yjxs-0y188cBj+TPw(E_hx{FcjZxgf
z)%Cakvey1psnx9Nu-l6o*&R7o_*xeJM3faOn9@WLSIAqGop?!ha6v{Lf>H&;l2v$K
zs?SUHDVC}t<Uf8AGCn2Wa`g`EHmWWP;kR1a)aoxsKiYeThaV41C(FyrY$tZM@N>$#
z!U`-Jd1)eEr6VJpl&Y8{>LdN{R+L0`tktR+3SkEyKYu{pI|veFaZ)64lp!ANS!&(w
zix@--R!d?9o&UqZUMYT5wvx;1gx`XZQC6acqooRFiPw=NT=`>XO6^j2p^2m8{~Uc*
zS}+aVjD>xJLxIahoao~3<)sISH((gBZF3stuR1hHpxJp~zI$nVK0q6{A!Y4;q^#YM
zl-t9u>16XWELtdd*xP9k??iD#3d+P2!&qHKFO4?oPL~eQDM!|MKvhSK8#RjOV=x2Q
zhz_!N<9{QjpMoI<H0@uBaOIbH(v6?hqS&skOlkVk>*2*KX4{=%e-h$9DCAD2g1nAE
zp+m@FB}pqFP~X$)u}!)|S!?XizyO@4<ACL2#L*UDZ-HUFM)e^sL{e=YD8c6Ew&5|s
zV9MA5#v66nCcby4xQ3s%#GxZRRl#|S3a-Uc(=btb+MrkR{ISV4TTJ}?Y?fI8iEevm
z;%;)m+#m!u8`$zq28k3f)0S!CV;Th|cqmIFM4qppTaLYw$*ymd7NUCZ+>wW8W}0j`
zY4>6A&qoxcs@E`P(cBFtcs+_-E;fY<vfFq>*rh{usX=D(D6{l1Lvw<31Vgr>;!UJ$
z3y<y~dVI8z0i=L#F+tXBShdC$9;qJQvWix53uD`MN0Yd6-cY%nJ_5w!0!+gNj!1(m
z=L3^(Iv{7P4N)MgmK>9{;Xz$K5MiMmw!+$iz4DsJ`apw-YcOYWU{{EL)b*+ILJZfb
zbC3u_!sBeW1B}r?k*Zrf>gI;Vm$zUC(Z=TIvRsbyTOuuDenXjE!?#xaOSfD445k4<
z!9%BRvdWe+{1#?1tLw8R=YT&`W+9$noPZK1nR4WoVX5JXVt#jpU6>hNlpBm33J>2c
zM3mIbt!7j7oOc~I9J$5Z4n;>pLGyHH92awN(4iBj1GCf7i!Pw(LMy^N<WLB}EBJVY
z6{p1{Ku-g(s<pe&>U17HX3oXKabQOu1xxP{CJ^}@+0mR$k>GJ^m2I(FwPvz^^C@ex
z2*;cq2whVcyhPgox!{rw)Hc{n^yCbl$T|rSBi%m<SptM+)_~-Ip9yfK&pGtd0(Pgv
z(d^B0_uLuD?QG(Q{H||5pd+X;0@~{Ou5Wkjk=Pn|#by2@EQ>u(N8xlj@t|aFL(3sf
zOpH3jg;K_P_{GHO>U6YC>M{C|*@M}Hsx+2a?RekRs7h#AvK^QooGbv(o!J=H;=tCe
zfW^IJUS<7ORUDu0ul!!ishh(`BU)#6^oBWGQ^FN+pi4!^4==@it}Jngv%=+xkcbDm
zIONqgtu03S>T8puh?iCbP%`B@6h(Ec6A7@_W~xp-U8f=2kqss5G(;V$6eS@cS((;{
zP&P!{y&_80Vtt;XJr1ZaO=WkpX6%wmrH)pqe!EIFtx`j&l)EirK8Ij5u=P7*DfJ&=
z^EDwH3%tcfDs;|sJlub6-RMlA_XHbhHVF}~vfMSm;SixRo;m&NJA-!DQJ7qtYAZ3<
zB<gt;d;@ZFS~BA<DG%%LP=Lv&;%CX!3+g3(XHk{1dRFTWZ<n~POe6QjjCj|BZS)Ip
zZ3%BT>3U9E(2FV~){5#BYelS~LnG&&w6J@+7M}t{7um^c6|j>A!sUMAl-cVxCwyw+
z-9$PFB>N_p4Z(wP=Z`UvK-AT%82{A<i-w##p-a3HEjIYG$(#+gvf?Q&Po%!Z+LcON
zQDB>5j$hGSiTW6kego?z%annCD6YEj&&{2?Mq=)i-uaV$AFp8w{!vwjjWqPck6`)G
zMHQw>1s-oqV7A8qA1!-PXzHMZRtKaaGlK*S!0(Q%aLmbwTj|Bb^k}!ttz7qsQK$(G
zgJoVPr-Vb5;n`_PlG&>(P1SjEsRygcRGYm?OjksBGzc(f5kXO**7Mw*kWw;rVV99&
zFjF$Z9964TO)!EYnlkxFe%5IH0ysOc#=$|d(k24XlL%w3V5OmsBx?=2NeE<RvFqm<
zpsAMc(pqiSmQBbMnUlY1Bc!#JBM8%=^@a*tZ_LIEyWv)j<V!=pDPz=QOCzQ}hnh0t
zgj(xmx>;&z)U73D(CVsukw;g=WsE_3k4Lwl@HXtK)mX3pVEwSRDkrJ}@)s`<RUE%t
z3DF_va%8*s<^U7+iR|Cx$QSVeMF`7q++A6r+}jO3LTk6#lmR3-vgr0RKNVF?uLMbt
zP4w6iCAvz`3j)PuCaR<ynIdF159!uYoFC05FO1z*Gq7;qAanzRT9d2sw(z`>&CgrQ
zaW#6%HNA~g2?$QCxC!0cLIDwN7&kO}NpG+5()GJukDjUS<gHfhPd+`pr4N4XUOxD>
zhxy>w7R(2~R;$nS!LQBr!LMcd;D<r~Y7mTu=diR>TA}7E%a!cB8kdq-@cK1w?#}2e
zG_&=bkdmiF@F?9Cr6uxfaJT(b+KcGju)tQX#oCOb5ydLC0|)^B$tkpOEgCBkHAvP?
zN*9vwwbML-$~%bKr3GfBRju{PtY{VIiB7x)3}U?RVUoeVGOP)a;$3*8#kJ#$ITrnw
zweNCZ*j>^1xg4SSPdn}mWuM13q$CLU@t4HZYF-Dq>D}4az<GuT_8_l;9PL=C9m0cf
zgDnqHqaDT??aB(Tmz*D^@DW`V)4RATaHKi>+THvVamBe#3eJaQl-eC<h#S+b)+%3Q
zX=6QU*WntTa)rB{Hi2^M)@5C3>`hJ0gxbhiP`VMA`Fh4XgRX`yML-Wm`AcXFgF3)?
zDS?mgXlk`$jsMFwloeot=AStpA|gHal?{=>eJg0_Y32$6#O_^yG}&1WXzr4H(EFdX
z{`xK70i|0@zX!S#yWYlYj*=pBnBUIl{#vPimRmiV9gSDB^q#djdJmW3sQ1jc{})9$
z9(Jmp|A0GY^X`AI*RACJ??&Uz^Zmc4_~2D0Z`#`Cf42=xjAhG0<;S)GMoiZmwYK@+
zZ9@if#j^N2mcxkl`!<h+kI&TK+lFxftlErXXdCa`uru=LBzlwWi1^2S85Bo`XKk3t
z0AHju!$xuLpneu6voN5^KzG3Ken;4Gc)(ZK6)65XhWM9v;EdzL{iZYsBc}J=@v8A(
ze!rs0wq?03u3XrZ26?-h@c_dhXFX_7&Ts(i^b>#NUThn?l!C3vDj$}v;{m-f_Q86D
z(*31tKJ+)N(w8U@QXSr#yWZZP75`y8axTCCy&Ci%#$&VBf8DA#-X`vUudg?r@Bco@
zN1l0X@`dMh47{4vq)hf6nr;JUJo2V^0$T7SKMY-A0Wc*6V-eEH^)H%icejNJL-1hg
z8Ca9TG(NQ7@9+G0)G8DhM*IBm<MH8MT(tMw=ffR)SNyL0$}P*vuYOR$>r_{jHf1|5
zDD4K}_h>b%w;gi*V9WIFiCdr5>&l=}e|Xz;=mk_M8EP40JB{NXjDgPa)j4xRwG2td
z1SJ&D5H_vH<rqCW{gaI4EGjT6)%PPprt6`YUf+)lk%$}RMg=eYws`zFp6_gd$m)h+
zb2#z_&gg1^r~<39Go0}Bl1=_&fvCd(aA%Z}%;pitD1`bW?b}bcf8I@IJkIX<NYd&N
zcDzTR;o)1&BM|X48_j&K{QF4Pd#$i<Bx4^&%cDx#dy?{P<n29)S(L@_{bcWB(e^DR
z@MF>Vh;sOmY>5Z$65rdhnAfL!>^2MArHAZV3)`v3-2MJOoxJ}p`uFMM!*}DqPhTHp
zSO4DKohuvIg1Ac(G%bktBtg}JI#cFRxe&gUc|<Oht7RUs-%;b6rx`8W;t@nG_S(rK
za*>u!9*v8*a`I?hw1uNBmBr=KxnwQ`pU$Onp*VFewTs59GkLST5F9X@#D$vv*`zM~
z+$+<);Nz-Ny70rAF_aG{+A!K~FBrKtKTpLo5y^<_^rN~Orx#ti)=6)!@J?a}3roAZ
zY)OA!kdNb-V@ZG;0kV`B0&1I*uvNY^v>$ZnGBga8VtU2{>pZ6-`R1P)=fC)*gbz;w
za`*fn>y6r*=lmZ}@wvtPpSiw0n)r0FDXb2!?%c+l`G33q=4~?n2Yh=z|MwK1m;YRy
zgrn8A=dXfzW5cWQdEgs{H=yu?;Z<l*U~;@UG!BA3C2_+iYTjxN5=74?co>}*@{G0^
z^Pi{0m9;_mQMyP2gY-Lqyv#0LcIo(IN??ou{GyZ!7nmqd$yl*79HQVH^Sf^@D`3v&
z0#wGF_JA)6_%{}J(|Ud9D`qdG6!%r5?TthG?Hb<fxeBWTXG*E?wpe|6xluO^AFyK@
z$Uep;l600#w#?umbqyZS-;#M!J2ecvT{jFa-BIX{OE6G_(By7bkys9|m(g#$R^;Jb
z!s!UprkDDzFW@QqO6;2z6<1o?Fmu>46Bp~nZ2%5y7&85*jHEfjSd=HFA}A}xGAn|v
zQZ&n~RHS#1SR!6V7R}RiT};$Y^{J&Idb5jVLjy!TA_=BBw2I|KDH`i>p=K8ma<9k4
z)bNqWYOLxEhrku3qEM>(XBA?P)|<CQQyBztz#3~Nh*b4&NsXdA%AyPnO+Lz2)Tj#v
zCDmj_-~?82i}EM*?1WW%l&Y0737m>htX$a{xqZsv2!%Z_sw6eHs9-c;l~IqyTX8TM
zM-K;IyWS}0S*M$PV0aV{pk`2j%uX3EjfljL2_|YroU8K&0SlhbW*>#0dG(lMaw<mv
zrv91&tEVP36Gsv%fe1e^7ofhwt{_$d`#lB1b3$;g&m0v_L4HMz<9R05sBdYC@PlbQ
zz|wG24@FH%_tIje%*sX0M35GODE#d=y||c(Vuck^@4vob*Ea=LtWpM@aS2(YzzWqb
zf#;X>*)?<Vpn;G=G@afZQ?<HURZW&W(iOZh3qg6QnB{LNvXx9cg|fhsVj`ZHC+oo$
zt7YQCThFXmO!v$*QbjM>uP%m6E{=8i#}gR~;Wwm|^T0`sdIdH~k!I+{3!tnNGpf#?
zf)`W!BtT{mtuMb9FGLyV$_%1Exg)mw>6quz<vCR;GmntdJi7^{P_3qF^Bk@*Brta7
zhKqelE&QxyhkTv0Eob3K&&x~plj{r<8HPbDP`~hQyVfnPM<j7{ozbP|+Y?{!*v#Dk
zDbMPVCX#N~1!M)Gp0rqzM!v`sCF`SY=8a$p`<a{?L?F=q6VSe+J{I%HMhxj;Ff+Dc
z{BZG9C=@!*m~C$EeS8lKN=hpGRSATY*{z1>1}Lehpu#tUOIE{h+JG9PK@euQa~`ll
ztF^`UaFZ*rtr$_YADk&b1hBzE*VTpMYN}zi5Rq`VkUNFt2lffD%n>HNa{9c8lK70>
zKB&l3yyMT;@o0eB8!Xiu)O7d!3vU$olplq{*|cTuYmLRK1~%InbTj(*`_guH@8ChQ
zoYl8pTkNmD7!4MZAn>F|xyfFY6j5V_1w+>;)KM`Mg+ePgVmg!PQZy$3=Fl!jgey$2
z7KG<WE9Ooktq3nOk#1!GcNv{?*f-faOkM_;0Uxqg?79fQi%m?qhB|UgB9tk=ZZa7f
zwJK2Btw;}yH2yzA_kXMgqtbVvQEKuJhB+Ac)JEhiU3)h`3q1mf|CivU$|tBA875{I
z!}?n+JTDT(5+^6SVgcb1ER;pxvn~hT(*74$0q<e_|6{)WZ-KF&u>Wg~=lsu4^2xFP
zZ(;NsoF}4aL?G;73H@%QZxm+TA$%1+*j+6JP_Dx|0+{8pmOzi@w1z>zy&jW47DWQ8
zVj>A5SRZGoTEkb8w<77CujGP=ET#!1yrZkZRfeh}7_LG?q)KGPlo{%PWu{x;W&P9@
z=8{a<-DQ&RbKX*64!nS0sD|B`0!9HQKKl&w-<_S4_lE1RL>X?-_2uPt41rPqAu^ye
z1`<h4G4{ht%=tM6m5uO_8cAr9;27B`V0BiU_>*wr^ot<I$C&#OIs$s1OIa`h+j%f_
zMXJon8LG_}LH~l>Pd-M#=|l*_N#{JmL4tS$|EtpU@gfY2*>TG}8dGV#%xY*^&^Igk
zRyQ&1`oD}{c7C&u4~~zHclPa%loIv`9~edu+JY6}cai42h=rmbSQvy*WJGqi3a`I%
zDk?xq{j7uL3PKw>NWzmlgqsbg2qO3_4f7~|9YfV!)7ZbQLk6$LD{XQE`XnCuQ<%e(
z)PQ1X_Q+BF6_z(<D=e$CnBzlyw^g3D#{r3b?jlUO2eY^-_7l#;m-HN}qd*Qs8NI<C
z1(zZ1+|+yqQY2_rTb!Bzk;GhX2!ljn@oY4)VIVOGAQ@aI_GPA)hHNCg9Oku^jW)Ao
zn%|gP@iV2(V4BkkQZ&_!ag9Sxqo_d&|J)OQCJTxN6gIpM@+>aqPVATLz1PQ7y_ok@
zwRJTS7wTp*u>#qpxXp2+a+Zm!+LyQS49s)@NJM%SQ)LIm`Ih$ekef$?R;MoMkxsap
zGTln1a06*$>G=7>2^z+^?w^=9yt!_Ni13X53!*^D!1UK)Fu;`3laUupLY^8r<gqI&
zzp5t>P@UmzbvZepNZOd*7sx~h$n{O?lmz+)Q|BbeVQ9Q4-uA#l(UjiB^uo?^Hd3$6
za?)KG4Tzi-ZEJ*`w1|cLG{~#)cOPx8Ak2pp=R_oEJQ#ASVt-xM3ZxX*d@{M75YJOi
zbK>YfG-tfX0pa%nW<w~K1m*!IZw?^5FnN<k!7GjG=K~#!_L*V-55kMi!w-M_<38s<
z-oAPJ_WAtBQ+(#lKMy!e;`H7pf$lv2b*ql&Kc46R+kfsf|LTwG`K{ZS7yqxeR!_|T
znq@u5|9g_p%OQr%bI8kqR^gbblZ<guzc+=?pKtlO|N8F?hqr8F&ia3Ay-CLZTw8lS
z|MxVX)zv5xC&ho~v+MF``xt0`XEHtyMoo5z12tef?Jj2Ra4+!LC!R9&T`+JwA4AP^
zRiAA-<6z)*wv-Z?<G|_br5HL|Eg6CR6AaW6PLW!2;daKsNG%D+T`#Dft3~NBw(!_c
zvMz8e8)^}6N-K)<FJTa9H00V7?1u(4K=*amM%p*BHc@(u`$apRgg!T)pPgtn3L6H`
zV<k#t#9=&`XoDgCCyR2&3J8h`EHHM){Zb(qj;rEXq0CC;tY0=?i=r}n9sXHn2gm#S
z=)tDudQ2k2H~S6ws+r8V|7Y(?x7)_C^zYJBur#TOT`?tY+FG`1v{re>OOE9veNMTL
z4@FWIV{Ii;iJf$wtbg<)^(zcEuA&xD5-m$$Y=<Opv0PkST!6rLyGQst`QN}4)p!~M
zP63G+PLY#{QJ3ub0CQaZZU}Pom&x6ih#W7$&!jV+rVv~!0mX;Q==l>4e!IvECtL|4
z+e7?oQG$OI1qPSEpAz^Z<#H#S0z>l!7*{|9Fa<#ZAu_m5xSUvmlrs1SBA3JxNVx<r
zn5Ha3M<pN~oV`<wE=<&|+qQePZQI?eZQHhO+qTWswr$(CZNK~bce1l{l9Qa|By}+>
zRoC@Y%`t1t0;_&NfWRNo7-&9aDTOWe!BpO(1c2TcED-e%Q~JsGoIebJQ*32S=wzJs
z&6U-Ym3*}u&aNRKfHo&h;PzcW0u3h0^`Fqar3Tmi<u*Gx5-u-AdpwF4Eo2C6P1jzr
z+TX#On;+g+XtXGJv-3{O1l9#qHiprd=0X|fd*MlpAqG2q=p;@iN~buB9r!)@g1Tq&
zZ*0)Ma{)9P=h^<G37~&MV2EKgFUu2(0iEz9L$z<ww+RmN_rO1b^a%4Xq;hA&W9IR(
z_>hW=P<MMzB;h_9o+kSrJ3Qsy3FtEgFYq(%;n8v8{+nffX1_x_wZQ6U#VZhCU$uk~
z9Q|7)+bJ5e9&#>;y}mG^*>Eo;IF0G3uz9Fd333m+zo|G|s8{lR{q4OZ2EGR8ZRh)3
zu42~%w_QHH1C04xUr-&`PvEpN;#rd6)$CrpK<Th<Kz-9s_~8OKJ5u4y-!UxzjsLEE
z4?9@t>VqAhPrk&=d=#MmD(Wv<{$AD2Yg0(>{KB$kzR@tlhT?L@cwIfu<DcxwR4U{A
zsFfRw-j4uax|Tt^qi1%?w_I}^dn8iXmuSDBPms=mp)Urn(S>yfMj&Qa5Z!fOzJok7
znBX@qyhs+{gIEST>%WJq9$+=V83VjQ^eo!oI$it(MA`*1eMk7gSl{as%8;<GLD~zJ
z|K(^xX7*{$=JdYs2oi}2#M$E41ky(hSUpE!Pp7m(z6jnSV@iUa-}2}7^_Tg2TRs0i
zG~AF@GB(+Aw7r;ZAx4<E8)3?&#-DM7y90(WrbeYN@|Jp2Fpk2DwU{7(vzr8EBSBm>
z&dUJ}y8`6@N&iaAl%h#DIF}@w0~aG<U&<iGWgG=;V!|Xtx`f#CS$h)UBC(OmLY5@y
z$MfQtQkf=-2mQn1v+0FZ5bv2{EpR4L^8F!0xR`o*=g~3n9OMq-Vy8qynIw#jnElk@
z$N_Rd-M2x46MP6M@Sn|xehq$Np<KirfYDOzm8WPk68KG0TUj;_p>m#^@^}oymD#o;
z&*J7IlKF|ycgdpBQgd}?_3IA+Z_ZOqD^$JBk39O&RUa1_MZ<?bN;;3B93+PO60G^f
zLX&3=2Nt~eE$x=GWH9*z=d!Di82O|^R9t;iGo%LsG-Z;$e<-5<Jrr;-`8<xDhvp&=
zP&v~J3P5WWz^hM|MH<l&vr_&B)?5O>NYQBrNEZ>-|K<<B<oo~dxLR5zC$e2`Zi}Pd
z<Xdei@8CM#C=$qO9nhm4g;*EPpyNJ74n-=7At?dSijY(P_yy+Yj++w_l9-T|5<+7E
zA9J!oE)C>l5Q>Q*lQyIvE8kHR&xM&0l=ev*$yrP`PGe}ta@R?yW-?HLhhkJYQKj2c
zeuy=_gMQW>E!qvt9Yksxyohvv=pj{>q9DoOBc*vL)MHC@P(DfZY)r2`8TBqC`Ijj3
zC!#dNmpsJfq|81H?690ug^Ec2JTJj3$ft{q`UQD^c84#^&lKXzP@eQWs5WX;rC-iy
zB{Hn0P%}iq2QsjWBw~bADlkM6sw7H~<>o=tu#7@$xVNY8av9#ro<_fdkrZZO;CyJw
zQcL>$qXLnOatdZ>krLITI!)Corau)ag|X_j1OCD0sZ992?-wqp7m`efdQl5j&uRgw
zOBsgHpH9E*RzQl1)%rJYLn&2X-}fet*OLDU4Ir><>-5)O`RcVAa>Xtu%9SV}!*Qs)
z;?JMwa(vtM)}Qvii}pO@jaUEpHtAJoY3LU5sZ011_%F~j!Nf=Ymr>-}`*AR+G{YAQ
zc`09`fHt5Gm@jNYDx)``${_C0_{wT9-H|KrU(tnj&li#v<YkDJa#NjoNJ|pcDaqv1
z1n#6#PRSryRB}R{rg=2F%~ShCSX4)#Nb&kPSnWuNX4$CB>e?BIDE#XPW~AqcHp4$8
z*xWbADlCI-ugIC?aS7f({1=&rcBBUut+f;)3yWL~7pbFNs?Q|0Le9@5s?5<ZB(_S<
zFC?Nute;F~jnOa0IU?$d@l2?CWd!QdZlXUD`Rh7A5}C`)|3%v%KN6{!xqdOZ&&)rV
z3<qd0#@EB?7h|TU6~>kzO)fSvHcJup*8oP>w+EQKP5vXTm1s8>V%N8k-C71ZZNS56
z{lk++<1YzJBkn7p`dGB}H+eYq)A$+9Z|$N#?#vcEIR8c<ed!=Gw#ihTn#`=-`8qtK
zil5(y?LX_$#wfmGP4*zmt2lv4{ewY=eyowYUzWY&ivi5TaLAV{l8$UlV;^%YFKRMR
zEQq!I{Yj8-1c+aTeW8T=&o1|WDLDs~opO^NYk>sj;uQ{eRc-$L#oR3Sxc^d;4r<3n
z6QqYOo>O5`3EZRQM%KiGfwv2RQ)UcoNb-DbigS=vpoW#1en){@(n3o<$LsfjF9NNG
z>@6!}A1+2o+Pf%ICr#V;60fYc0?d2%4b7m?!ZJ->IQ5Pe&tn+UCs6PO=c81p^ABnb
zaDucF(9q?S!*#~?17L7bpfJ|E9mItbv?*=ZXYPWgy20D0yV|JZb$hKdf8Eh<R=J==
z{C|ZNMBIK!60J{O$D&&sh6zVM2sF)Z^2bHDejR6n7ux!W$3d(Cq_r)Z{FlYDWzliX
z+P#0%HUQvM7&iWz)6q5napE=q-<P|ky*votTiD-UuQYTPA?%F7O$o@>Pfaf?_Yb4b
zHmS=LpUZ*KJ8_Cmkm6vluvN`Y^R1&k)26glP-YWTh*|fO7<O!+gHNO9gKAtT^ekHw
zGQor;G=t#0!T5iD@?uMl;I=S-$?BobJj^FFJ9)F@SV4WmTNlw9SMHyO=D)42a<2OI
zIJ(N1{`shDy#(o4MEdk7%sfQtj6bOodUdO$mWmNksFtc-jaj;d%}X{wGnE_mR7bJn
zr?)gh_~qqIb}rDxKl^Qf_4PcQIf=JSRk8*2$(L&qpwauGr~Av9{`Rl_EKa5zD^XEk
zfcI)tvU!w}Q2I2iS3h`CtyQu)D>bcF)@WqvbwK(F#CjDl_Xuv_26e)<JSLYi(EnPp
z&$F_?tKO|KbqA^U$ebborUAXM9#^V4Ca3m?NT5x2^jF81b{f(7FHUv|j|z^(9Lj`!
zA=Bs)CA`W7OSBh-Xi>j?jz0v6V@5x9{YRWcKZs67pZtk5VZZhU@1@!i@;0C~@vAmV
zg@%IL*X{kf6?nz|X>pr&`;-ey6#{h>vwpYtpSl4hhw;$dI)u}O4zHXl3Q`4ETyrJa
zVyU6M8S<W{B%xpzHk}bP^^A_YqP{E{>VpQ`>GYRDVP&-EX4%~L|EwjU^~<VgZ%7!1
z8&2ptH-bWKQ6IstxeE9m#;WTFzkRJPQ&)O7IzC9Sb0z^;bNb?_cpMCHd^6m24k6hK
z<GoJo!Rp^)Lze8AVMob`h#mosm-1q1QcNUyW*DOq$n2ggW5&><^<*df(tTW?8WhIs
z-Yd6wdmUQ_EH4k7!eSk8^_HV*SyN(+Xw89kn-=ZfU#FDw#A5&-=i`*C_nVCk?fhAv
zY_}{DfkRfQ{ga!g^$L}-quzgoX9?2<1~RV$%nJAzX68k5GDDRD&peF08J_tt5?I)+
z@Li9hDq!-PIc+5pyl6#b*vaf3uK)EWv6^E~(Fc5S+2|*m0_)Clwqc)vXz@^$5dp2u
zINT`PFNbGW5|Cf+d)Z`zKH;o7w;P^9+yTw$i|8Tdywu|LKMTXnOumcNsH2)}1iIgB
zSfUvJ1wW#)-3_RTwgg>*bT4g}C45>kIXw`~72kv?WqV#Z`VYWwa0=@#KHAw1j%la`
zrW6jZ3yc(oeD8}>GJ>q(Oua&w@@1yl;`YWRPp|7}2e2M?1W*>jEvgiiLx517%@jO5
zqbEORYfxge#)`LO`D_;VObtct+OLV?8I4kz9HaH}uZdDwtaxu4rNpaV#y4p+v(AH5
znZdRzs%njsSnppDwIy+P47ul9R%r{Uqj1u|P*PHK@(#xE_%mT!qyC>wt9;C*gSN<O
zDSS!{5HGWnpz4_l+q%&1M;OuU$}Yle6R958gP2xX#B^lf2EP7J@t51RF^G51Hba*g
zqRJn$(VO{E?qQo?PMO6AdR7in9{%%WZmg`KaM<?b@}S?z@{N9J3Nr)Wsz6=v%YY`9
zDZO^eew3j0km5*n$EwGRZ>hA&w^*~Ap}Ui>&llCN&mzs=6AQU-W0lA8l$@MO?$e^n
z>l#qouz;Kcul%myc$>p65)X4z|NbC%cLxGImj_lgTZKtc&%h#jS{S?L%$o#-fbGua
z^4!-ZaFbGy;Q{QIzyQy>9En*;7E;tR;cKxe?Zh0Mzf+9e^q<!ZCzrmH`a2OJX3o}_
z^J`g5%LesLii&g3Gjbmb8E}EylIOr#3&*d591}b0&K9xa#e7~sH-&Em5)qaDieqxD
zRp!sRE<j)1Jg!ze6Y{b-7ZP_Ca$pWsu@k|4nLnlo%bW^Wi_LP%hda21x4m3!NW84Q
zQnvSfGgFr%Bd$NaA8&7K9Bt;NZ=zqVUfz2AI-<an-oZpBl6!;th<1_Tkd0i_e?tFd
zP@)ZaYbMC^jQMa<l!dNl@%Kud2)j%TRHW=E!Fk)klU9MDw(;uup6RbVa$?@pGeC$p
zL*I*LGl7i99r3n;zsf_3GQ`hP7p%BS(yF4(v!-7vd)rK_3eW|$#x;iGf`}3-;b9%m
z=OPyFSxznIXv`vXM+B^(>((OtCo90hR7T<gmg^XBR<>3v>b#YZ&`?lVk4De2QRiEB
zY%`F7dAQy-adfi^+_YVN!>PEqqi+pf_E47W+-o{PRkLgctfbA34mD|(%7Ing>o1cm
z`ON5hiECOnlW>*orZr4P5AiFfhjcb|RQv28ZsF{^;<7`+bx-ZS^q@q<*z3E3FvhKW
zof-3IhXjoFqP=>T1moo36ocdBTzZ$u;^eqHA@Fi5@F^pP)*W7}{&3N|ZQ_Q_<M}i@
z&QpsMNKz|OU>O6~_uPv{15U$~js@cZ)X_?D2Yuv@BX)rLM~#Fr=5Ky3f<Zv?V`Gx}
zyT7Ck8~_oX4-OEI?H+poVEXP8fX4dWqdx#F$msURvn|}J7*tnb*|v1R6kb$p9)XUV
zRiI|)WbHCrNbajdBn{$M7)ue~G>A(ZzEM%RJi(HM0-q7N(H42{G#(-&oOi4#(`miF
zh!u-(f^@1;;%O3W(l@gfLrTFMDox-nEXvv*Q6bFmYB?5?;A%Ng#U)w5?YJ*2%7it;
zfjvdhlT8fgVK%n}lF-=NR@<k5wU&WArKgQA<HthNC5l#s^ku!y-&2LRG?=JA#&-eJ
zYL<Vo;BKfU%wx|9qfPgW3q244zu5vwwZ=vuCb(Y(PK>5^^Z@N|u|^0g33=~N$H!An
zxm06gR6Omo*)%@7?d$r0jyHza=wh{A;}?!H*=(eX+nNZC)SF_p(hjBV$T}LWH^OPN
zJK=c{G?+Hv!LB6}Vc9XgyHw|!`5H!6E8i01sB!7F>dM_fO<v@Irr*{BO=ofNj1-Wf
zjm$C!UK$88e;$f@wyd4EPDla^55f}&c6Ijp`#b+Ocx`p}RqC;C-BrDqef*Yfba(dr
z)7weA<ImM+qo<$T$H-TELa0g<wt^N?CG$p!t#9RJXKk{!Dxs_X&!#A(k(m0Uk@y7G
zR5UGh>AHJdPq-je#e#NCV9gpBnh*rhYtF-}ICPFfJP(S%eAEka!hsYotw&Y9H*p6B
zhyP>Lz?@^}Ww2-JDw3sKESD1Fti|`*j|uodV{GSNT$i{(tj&K-0ZwSn9lyepCLt!*
z7!|@sdPD7~*L-_y`GuE5xsY)`rTgy!H~X0875U7|h0kveo=wBpJMmj#ek^=P!v2#;
z^E!qZbucr|cFz;Aq>nBg=-}CL%qPQv_2^f)cs85dmvW3Mj~G=Ug;Pz`rua1Jtm$GI
z(NI;G;PUM`YGV)jOgqi?*vZvI@S`901QduchW(QTLvV-ur4OS50q9^}TePz{3xsr}
z()b3V-mJM65Rf(O=KO3CFNPMsY;3cxpy$7}&=5a&QdN2huyl!a7?oUliLjo%Fvrp9
zm5s}k$0e1^RzI9Gvq+uTiwneRqB!wWTAHBz^75uT=V{_zeKtXRyYJ2&pkZt)*!_DH
z1-!h}ML>=pylCyn8su|w1OL7<59gSz>LVkMn_p;=-<MjQ9q02~a}Xh7Hr>dfjIE|J
z+X<B;kA)rnB~4f-L{K6<SJ|Ek0X4Pe#3CA7PjPY8>uAr8#!t1}R70hxqik@V>ub+W
zfx~S%@ga<^w>Aybn`qC06J^?RVL*P{Ol@#_SZ>XpZoNJ^C~mao#)BTW-uP65O|v7?
z+ie{UPzKgU9*DH%Ktp`S<VqT#H!PUKb$<8<LcH$voIe0WHIcD?{ZTM%zrK3xtEu6h
zZ|a~Lhd22nt!rKp+l?~&5ZX<C<Y^@iUig_9sBL~2BBN^nw(dU+Ma=K8Cy)RCE|>Q9
zA5IOz)wWnVH1G49F<9smu^xQYgW!+S<2Hd3o7oMp9JK(FM~zc}c;fK=8$sd+K=O1m
z3y_cd1Q_}TkWTZQ0>VE4h3SJo&j8fOm6mbyU<H&CqaJYD8MB&x8nT7~jHgm=hCd-j
z#cI^7I8lwz`S5<lM1%H2ejPd$abv#9!gJc9&FJp13tphV=m;s!SDxAt6Rci;FFSO$
zKq(zYKiBpx4g_9?Hue5nwZD4TFwp%9#ihk%KFahC<pq&5yG7H(Z_j~7bFS;(reS=8
z>7tUG?g4SGL+UW;ioZqM|CoO&WM_gHomcxB&OqpsHBo&O=s=ohp}{b*6(a)+0%*}R
zlgQB#b4rvgYh%pjJ_S4s#&|fY0Pv7Q)@C41>jMm8e7O6P$S@{a{Crn>do9R=)j;@p
z7=maeK}JnXk&p-xR-uHVZ1BN`X~=-3AJUy(_)hBVM1-0;*kT%(mSYPcf^&Jpyvpp|
zCgVp<ppNB)5a(ma+Ymb?Z+o+ZVRP+55DR#pe?g%YUl=aeBh6l7dXo_h^4-hjY$-ne
zMY7;s;LSt=*|jiv-g7kdO$TB_QVVCLeJDi0!`}#Cb}($Vt!zDg9#F&3v*WWWGZCRR
zMU^v`g(A!mi6q(Kx(SwErx~p~TN7%Mjpr!YO#NR{3mgR`TomN42u^2;(Mo7`pF6o$
zIRDdCP=F??yWQNjws)a=dTqFpvim3MUjJzyY1!7Lwi8G#+iK84)|B``R4`u-Sw)|D
zYJ7S~vuHIv0mFix+2B!6{lu8guD(*2El54IReMB!Fc8<V)r(;ikqCcXyAS^8l=VY@
z?MrsE<cSG-?X5WH&aEVQC>>Vu5Jh?A^G}=lQHrU~#YJ{HGV1cclQRb1yiY3eXfSWa
z5Xu=oW&i&{)4=~jQwXj9P18c8|Dh=qAoBoV3ov^3w*WJK_g`+e{*S2#0C1`Cdw?4>
zz#d-QnMT%w`Kf1gVSxn0LFGSL0}>DX0Z3dpWT!(>k#Nt3_0KvT6nyAaR%~9xyJoZ?
zXTcf%Lx7m5(01m+{JT%`LIPLZXoW=r3pO@PUp^Bx_aSRc*60I}nDBY$QxTDqkF(-}
zfw;B{>9{pIeB=>GblB*Fxv1z<Y*POVtElL4du$PLqeW`{**uk(Bsofk0dks6Lt@>^
z{HC&U^-xPWguYc`OSx7t!dhNsc7Kv<Ct&wzoINj`I)gni^iUY&b_*!Q1_zmd@NN|}
zIhMiM8@RvC5-GSO<h4JOfIu<rLW7N7;cUQq-Q?t^zv~?$!4y%ui`iy_S18tay^$e)
zb37!<aEjSRGmNe)`*8SwkZN;`a?58lWyFI{4=&8SZFGO3!9Vjkh@x4(Ey`Z))NRw1
zvx%It#0yEkV+fqVX73gyC`lcaYYMV55M=T^68&gZw_ux`3=$S{)jzkxnyuc(u~N15
z_*4E=H98`S^?mqcvFpg{1V<;xSZOksg?!pF7G~xq8|$!DNhu^rNmG=>K%>;Fpk|`U
zH8UH1-GE(_D&*V_!L1J4%!F(?&p)b+LucE|^%(NZ$+F5LAw_ag?^5H{3O`=L_i1JO
zZG!`vrVF|o`%F+*H<R=2Qlyi!_Sz6U0_JM0>s;P>iVsY$r@PnJ#|6;nvE9{IWyrpH
zTk&d|h7evoa;qA<Ay~9D88ZewiGxouY_KoPo^;i>-<m_>GL!=g|3$g?E_k(vb4i-r
zs6q1b=Jd@Z3L701*W|?4ZvcLGfHa_IDnWzj_=svAj%jglZC?e+R%Ce@44_E2O2xa`
z(AMZ*4;UC$88fUz2)k`Z=saqyovcnPsYz=|<H(4DuEY#W9;<Ds`+ujZAy^n7Z5Ry{
zKnL|)X7lGPwxSO`i43v6=zkI!!NKI^O;k9;pNy=4EbOyRV2IjUXxg;@532He%YWsw
z$32_B)3~tCK`dqf87enY{p5nmP0}%N5n8%i&axTwYu9_)NKBYL_3^VL*-SAYC8hDb
z8FpMjNEc&Sva)1hO&mVlD3%nO@9LtScjHW-nFlukfBUy^<6IWASab5S?C+WUj%gCC
zn#^P#^r2<=^`W)xRs(u}e(BekKjhGd=$S=HvD%b+@5#$^lS|V1Z?dAizn0=I>S2rB
zWJ7kDT8xQz$&~p+5c<+D$L6zskQDdZ^l!3Y`WUUpOhR~C-DD<u(*6sFy*u1wqx4T+
zNXFaS{BJVS+zr>`F52B=ZnEII(rnID&SlMb$`1AXT8)`+eJ#7lpU!SAJ=z*?vf{iG
zw`wmq`TK33>Y}$^ybOMTR!r6+Z!@5}&Ywm^Kop1FX9oVF0lMU=qXA8`%RcO}6o&wg
zk^G@I0LEj-;NAlu{$1cZ{~0Cpc+??nGsOjcs?ZSm4W5*`AUx#62s-{-vNvJoB&klw
z_Hl%i#$b-#0gJk^!=~`PEMe+2=~-aYsTBf+uyI6($Ukd_qNAc*88P&Gj_c(8U4vRz
zg+>Wk$m^o{y^QkY<Y*~hzH%hFQprok6i9ILiqk4KnLCEY(<3=qUS5!q%)*0OaBLRX
z`9gzQ?axVxQxg9_JzV~>B<S7$9xQDH-D{1M#3k%)t_Vpoq?<?_9M9KAEdkg7qD+Np
zLnOsT24o0L?z$Ycl&2&WZiY!EKK&WVQY$`&6DOxyr>yWzqd>&P6&c)^?9#8{W|yJ6
z;r;Qp&Rmw48N5IKH)OTRSN_;y*EYAT>XfSVl}d_S{v>GfPpbc1oU{_1?43$4KQ3@e
zwP+!Drs&CK$=CPpyTM;~ws|?+iFFAxB=7clmp%4=9v36^^|&3ULVvj1v?!wlJ|sej
zsYQ1OfT_iHlQqO~VCDUE>oFDvF(r^S3mE#>fCz?cdZIew{*J3oX+qiT$h|k>k2NvR
zcP!BqJ6ho9#YX(fh_b)QT1Zha{S=Ok>IG467pD`Vl(B8L?C13Tv8~A71GdD)0S&+J
z1%Ald<wLD0a1N}6aD4zD|GxFbsYHSWh0N6tqu*>wC(@=!Y;Ze2sUX?;p^rG)__P)J
z!;pKWVBfN9YfO+IZ4vA1gPt|>`p{9ax;bV}=oRPdL$vwdoJ^vvF`hx>JH>Y!;U?|%
z;bZ)N){DF*`S=KSAimydP3D^78N_~4e0{JE>28jq6ZuUE@}0zW<&*dR28I_C=lysa
zpYyWU6e0j&IQ0|{8@$0J0rng}Yx!^<`9W`&t~71$Wm(xz{Ryi99hlqz-~&UVH}~H&
zai6f$Kk*3%nqrL^m<U*g_)k?08A!Gr^$HN<gCOvYVN-!}tcQ}|ju5R(`X<RvqCHkL
zwkLZRLa!w$17})ItFmv{n;3WtrtnYf$-|FQRi27nDkoR*RxPV?Z|7V{lG?TP_+3iB
zaRgEIAWzma<8byJB*K7dv$Tb;^dR5Laov~GQ*v7Zl$(TS77fuVp3k7`jq!jHk+DL=
z=1{vu!gLLi#&YBt+@zjgqBG1wetscb-&#XTo4AIZ7|dd1(X}?9acdD)gCfh!B))8h
zTPlL8$q`qU9oXl~S4PWz-1FI>61AS5t?-^fW0)tJsy~UeZP)8GJi=LKNeMkZTq6g%
z2_<~4&jx4@mttbfM~<Ssol04%FJ;Mb2NAD-#PtRfX1?z~L9Yo*u6WbmVD52qMti=A
z2K@O{AjC&Q?mFS?F<d_ymF3)OQ>1Q+%2alemUltFAg&!og88bPTC(tC$~M={!K;YE
zQ0Jl;xwyv}MWZNfV`QhqPALhxY%|q?VJSupgu>Epfwa+wGk_T|f<TI7I5qbnF6mMo
zqU5rV?o4?&#T$I<Uzqq$FYlQ`Oy_Wz8N0$=V`odXJnK~aYS<W-dg@T|#B5Og^tQ=o
zo#M<z@b>@fHLV`&fc=3@4T=CcOsf;GoFNH8v04*381|86xLW3@T18`ZBNTYTyAxd0
zx!nzBz0zqj73<QtCcV3hkMbVuP2bw9u}MCWD`*%NmHB@0Q&<(ulR6ntY&BHKM?2&o
ztdOH_Tk5O}3F}eE)0Sz=$QwA;98gC@>nIb~_{-#){f*AP`$--cEh^rtxR|Lx<kGxl
z_2gtm+064Z4guXFpwy9pych!V$0azD6$957lOa$7h8zT-(uP(kLrcEPFMu9So(GgX
zkMT%nVbA9mqlMcB7e3Gjs}`Ql*wv)PG=++r3G{g5Mg2;y)G4UWB~sn$<?48^C^!GW
z1m1JoE&oPcr@wbA7mp?17f%l9=$lOsi;B!4D3i~N&|Is-=Sy=ZDq8-XHg_fE6;%g;
z`=1tnSR%}9?0?NO^NRMfx!@S_qV=Ti9>xr&hLO@eBEll+0>LsY2oTgx_-E(`%(>G_
zw^eu!v5A5d$7&pvD85eR#B&PcBMRYYPJB1@rH6k5o9q>1P0S3$C(l&I$Ql)q^YRL_
zpeFC<<vqq^gbAufTby7E9>MH#HMimZlGU+8?Y|0%8hy=c@s5t-&ZRPg&l7*l;BX!$
zvN+NEWW^5-_)59`3E#%|nVc_I&ws2N{mOUr<6b+%OYjU^yrK6Wf%@|@+t0gagVLJ{
z3-b3bNxgBfyfNLR_r0mbdJsYPTmM!2RyNwVUYqKqvwIIp-v;uFyKhuCZiSVv_zSiV
zKHLPwDjfIyJC&>0seX8VVauM1ML=%rr+@pgFQ(r3f;VBlapFgRif(Kv*J`ApPyu&t
z5|;%!FgUA1BT)>p2Xh-yuO?F%tG2A@K6Djzd0bkYFY8G3(8YV`=%*Ax1r8(Bi>Vwm
zlfbdN;@5fVJE$QVW7v}xsu3?zIghPWhRh2*YWoLQZ4_E$<B$}PVvXiMef3la*xz1U
z(RPSo26W`F(tvI~9>lgRY~Lu>vj6stYd{lLPU>>O@hzici=wGdOo^CuL)Eh#Lxr1R
z8|%rS(V#Fjpr|Kt+x$?FOp&ubi>cdKz^Ae7=*;(riat5L@v?bc?2gIx!0u7Ech=@y
zfarS<-#r@<eK&^p2kfPiT1sRjaJ^6QiC1krLqR>$T}>qh*S&LjH1ukd0!s-F_s>t&
zi&P3U?^wA`&53|*_LgDHYFNM*B*hPGB>js0=S?MuuP*BLsq<?UaC=xORv(X955G|t
zjpDNs*PjK+=OBZj!$Q`^u!7h^-!3YUqXnr$>E$HuTen=dEY~Kh%O^S5u6@XO(q=)o
zd+--n=+HgWfR2r<oi#Df0tzW`5}8rjKno<fJMV@!g!`%-0}K-xXNqY)&VD!v87w2c
z6GaE-!?3NR&j1V0*8>W6aj+(^eXYT4ABJ$xR@a&K(~4Y#fX)T67dy^RBJrmo1UdMi
zGx*}MNtXoYNpv+uoZ2pAx;T^<zip{R9k%;MO37r`v^0qrAW$}-MeksnTXooRN{AFY
zD@$hgai&L(KNelHJ1BhH({FD$o?I7`2(3fDKcu#dQwr|^XMhpqBtN;AN2Y&a5HB`S
z<Adu@s{P3=1bX`v0LH}cScKSHz-(z^VEx7zZ@kk@qHinX4~Dh1=18nKlC*6Y4nb{Q
z@CZ?1S>)|lS|RmxnkZk!m<$TPtsIj?tzenq0+u?dA1p|oxgLNwLX^qLQ+yAp2P6RN
zB91ffXiGvC;cKgas@=x&ffQ1_nC4&At-%^{Yfpqh%!(1!zx=VX&9$wBrWo~C?rDuE
z@u<{Brk?Osh;9VrT8RPcZi0UiNo^IaqqqY8L%)Vy1f)d7?=$j!q=lS@-mF*9IXHMn
z%3W9%>;^u2>iiG*QZ28Bb@)j`$Ml)yF>Q0a*&-%)UuZz89B(yyOIeW~2f%mdl3Epx
z=7S9B&NPkOYK>Y~DxAU0y35&X67<8|<@}j-zVOT~63KuNAm6S|K*(JnkO*TQ#Ko@6
zO(g{@%}rk&$UIsma+h8I;t@f1>E)AZDS6!pb|JshTJp~>ZlNs#I2Y&1<JlN0860EQ
zm>e6xN%T*p-@8I3!bD5i+NRV<;n!|h$;#yj(h*nNXTdQ#6l{G3O}<ouje+y;Vd8kA
zgR?mKAJY#hWDe5KTJUM4b$sRp+@e4-=5mPLGGM+FPBqw!vXO&W1S_NI77&bo61kRv
zC5uwj7V9*f!iCAD(7($DLAQSfbdWwK?cO5{aSSpq;)-KmoO%_C*1<$tZ|_D9%p@oI
zr~Wp&;{9Gm52UTf`}+;iN^|b*n_Jk6rZeYM!>dH`Fjfb3c&e*QuEDEkv9hh=RI6R(
z+!J*{iWU);jMa$}rLNU2fL$58$)#cIF@cr)QJ0|_f7|sn=1h9#wQ6LQ-@X_!tE6p+
z5ECTzw*K}>gPuYvJMVKbjPJi(`7G>29ct^6425C4hl;pokEO;vP`qovEh&_<OcqHA
zh2I7}9QS$eAT{W;;gS?+DxP?y+|ERaZ^H0YIccCxQ~otG7o}Es6qhmZs<J894jpr0
z&=)DoPV3d$$FQEY8--@TN4z`1$wHgKASm7@Ol0jgFgl|C_fzC*!&9ioQ?9A={gvT_
z^T7@_HQ*=XC{d^XrSWrYZEy9gNjH-mRKKKggLa1K37ZO(l-n)cc<m0d_69oBYRGE&
z$vgB+9m`@ITTd&DAkmP(1-g$csl3i?ske5u-$(9o`PYB+@nX9EUawkh;pCPG>;aRc
z{oT>?z&Xr01RK-75PpKQ2I0H~5lLawBF;N^a7@)X^{uLcpf+!f-muKdiDhT#&w1`9
z$0)UzOqS*>i92y=$5ucsZwRnaiOta?BCmobMgneRr##{>3{_`m5_v-Y{8YC<IePS0
z$880wf1HT_6}a`5;>oki7QJW5Wx7@QYu93@LS5&L(>}EQth89GbS<9F6Kl+pXTAJw
z^Mz8mBrW}_dm0m%CLr{W<%Of*B~G;PeaHiJH@-(vFE|=Yj?VKp*NIDfOPmJeD4&?1
zD5mSIxC)GfyMxG>N?zNL@^(Nu;U&0v<f2{MW<T=M7CV_U>>BE5gucXICU-LPtUt(Y
zK)P9ruxSpyQ1x&Tqm$eea4SsJj|;0=x(3S->>p53*2sTCpmm4vSOXh!1i$m<>H|px
zD29<~Bag<Hna8p<f?jYumF(FVI9Nmlkmt~%j9^;{i#&Q2P_`H$BttocqgNZkY=-i0
zGMdTCTaDMAJX$jy=Z<!{(QD60pl;x{3(HyK2iv7*Cb(ZL1MZgTF!B|Ikk_<S%_{O1
z&5>8MO3f--mu#XOYP?vSv@bcya8zB?rptxwTC-ZBbkz6SxOLrruP(Km-etox{6}3H
zl4XS&HajZW_{Z6@`rJ{&P^UC2f<G2zaj+>$QU5+w=lvOYG3u>YXO-t|zFA!X(<jp~
zx)Q4`@3><h+i~G=&Dqb)Oh}hBJpV1~DH+T2B+oK%qYlj1lh2*OtaUk^<~MM>0v4$-
zY@|TGqx)2FB#{KmsAoXhHHR`3LRH~oNBqP(f`?aK$;qrt;<1Jqm{O51w+LQN2K9HE
z-hy+-b2Pkvk3Wq?G&&&{x3-kylDj8?uh<rsW@)G)ffu$7(pFt+@G6H7e;w_qywE5T
zIBC1(=rml>nf=^f*B}Xsq*`WzS9{_a(%auUg$ff-8)$O&_(f6ugb-?A2g7z*n<&i_
za`8J+&_53rh2iOvV`H1amywG~bQlvIJWV8lDSrwwub(!D3qC?BrPz;h{GbX6q7l-2
zKuFg5xoqD@^EQ5+{2R|aU+L$n6vIxP=7ANv5Hiq_*D;2`#5U2!s?+s~0s+zZG`GK(
z71N9}64i+L1Uz_ibvnvo7TCX4&v@%+8gu>&8A9K0LSSGuT_6oNNXK%nI;s(th{>*<
z#Yw3#tD@5w2Wuh;sDPcGIZ^?q%7TqbFu(B}zhftIt5fgp;YF2l(Ex?-RwQbpZm43H
zS~D-Cr%?IhW1MmN0rHh#hQM5HJ9;AlGM!|eBEc=XRgxk58Co)_6;)CQ+Of4YP4xG5
z!#Iy0Vcj^8A7SI@p~jj47?gOQ6&MWXxPbY{RtZepl<vU~TucF%Dc4ZOuSB;Z-{79}
zae*?uYc|3CP6FDQ0HdW-2tf>pyYaLW8nkg5S;`U}+YtTHdQvtqrW*{}6RJc4B_1vS
z*;jmVz#^sFS2~WRI&rHG6DrJ{6>>o%W|4&OhhO>}$Tsl5V(&8aYCn?i-VYPwoaS_X
zL{>MGZM^NXo6QAO&#geCPqtY%@ByP%C1D5(G+UHb0iq>|t&RxGc#`$CcfV;n$9Q>G
zBO)BEXMurNgF}>?G+q{&-0uF)r-q2p$NfH+LM}ai_1z$3m(Mos+QZe-@_G?wQJiDS
z+&-}tDe=v22wxdq-kHF5`y6y<TC5nhpdZ+|YnIiC7P(DsXxY`O_gd8+GW9~ZuuJ~(
zq&QVME;VY)dDyOUvHU#uW`XDeBSa9=DnNLzR!Nc;*0imX{zWxr@4S)40X}L--MfvS
zVxL?!75*2lObk!1nQ2vSnpR!o65|&NFCH7|V)#X22&Apq=Yig5KE{4s>w^iVfI)1m
zcx(YN;z_QWcE^G4)GhD&C*JdYrP_Zd!<{sV2eA^`Z&!Y`%RsJ5KT8^I<J+9Cfj~t;
zl}qP5LCZoV^$F?JN#~CAq-~tD0ngX{a%WgrvnKdy1u&D^_o>eLyO<6!i-5a6_U_Pn
z?7(l9&-vyOR5ii%v$(SDcpo)m-M-)aKX><hlN|4g*Eo0!x8_YAO1eKRglS^uty(Y5
z+kB+h)en6pAv1Ixc%-{F5$gw365BbVRV2f_xF8Q^M+q5CNDpQt7w*SHb=MB@-oY|5
zKJdGqdj)q)iohfWr}sC*y{q}V$-TEYXG9~c=KNYgYww877tg;5&jU1=S{W*CwA)cd
zS7BfdWw*D^GtCU0!f=1H!x^LmS)yQV0qP1h&^zGT>#Hd7sh*Gr7i2%&Skq_MrnLPA
zDE!&<_>tz%yfgC39u7XZ_irx4c_!KxyH`=e%Yswr=yCH4uBg9p4g{(!chFP!JkKv&
zZ;aLT#^s3}5Q^}`A+MaQ%!PFkkzaP-j72c`5J1Yj`IgS&cp953?hxENlGS<~gkE1Y
zf^AM&vEsymSb^rL1Rw}xJlhtR0^A8<*htKX<ND7N^|&#*hQw1;n4e%VYC)N>0*O#t
z?U(inO4e>EZWwKGn@(M2E<gx3JNJ26l_JZhWC8r3y1FuW+*!k3O(XJZRofm7$=#VG
zcB3eHJwno{t_?iCU(wvl0|tlM{=$>_A>*(sytkpCqr5l0EYA=%^5P0NbA5ehOCL4L
z7pp7TVVj+bo2hEW10c5BKL^5DR{pzH%GURx$S)CawzhC_yU%<gqo4xv9GlTd`F|}O
z&}@vm5in>Grc%MIEP@$e87cK<dxE*s=uIm8xIcmPu`q*$vfM9@;LsF&+1l<;0)KfG
z8M4=`%3XJADK|`vcJNhHfxNSP)z|7d1IVg&m${>~Y}vYGMgLXy(cGww85`>e|FshC
zo4EXPW%NM8rl92Hu@bgy-t4m--u2y6JFZkJWe~FusXl(H+_q)2N{!<`+CBDwm99>9
z$$4A~Gz=A!d_Wby1;hX5b>6c*t>tm~!qRT$^GMip9PNctJMJ@CY(4l9i*AKY^M+%2
z0XJ7C)k>PP9@O^O>M=eims2VAE3BL-1_jX{A4truDvSeLARK*lX3dUQd;R-r2OJim
z-1ckGeGg&<I^<RjFuv2pSsG6aJ$Q2cK;zBZ0K@H1*D+g*Y?8LgaTsOtgUg%#o9XF*
zgWbh3KT|jm=T3fS?|((!vRngk?a}Bx3*Ch(+@|uM--FUWmGne@_~aY7EB2EI)Wng<
zIBuOh5jZrkpxaf3+8+nCTH2DdBe(JwR3z3J%{ovP=VkC+)rn=rQF?*cgE0z=7mzP?
z#$X0TW+@(mym)Ir37ZRaSjf@)YiJvFz2X;CzHx#ix#eJU`PIcO(CT*&@0S0V1D#Ls
z^)SB)C%E0+t~MwOI0X^K3-v)V=x_;3H6N~$l?EeTFk{tfstrKT6c##zM~*Nho?|i1
zYuP;D<86+Yux>~83CJ9tHh<>hb;KL?P$KRwnFI0suVxDBX55`jy@9Sw9aL*4QQhS<
zNy=$cF{Flkkf_I$XAT6X$01i5t!a8H-~W-hDF_}X>DquVFDJO57nona1(By{Ii%wU
zb+5ic-$etETvu<MlePv&l;~}bYreJ`vz1kC8(nD8?;(myL{gYyT47P3_??y9UqL|@
z413svPKWFQeCy)=<zSRiiZO1VkelZ+c}IqRO_rI+<svcpM^A`vZo(>&UNyD}D!2U}
zB33I<_cZ7`cb(84Tucg=PSvK0PtwLl`UpO@5@S7bcY2|T**#dbG8yYqrlFg0`E5LK
z@64lWs)L8_xUvCgYpP%iVeh)NYyOsI4eVbadN+H`h6jg)e||)8-a(~>BiEHGiZ=gC
zXLH`Bsn3=AJyX5km1>e_mhQl+weblL+>4IA#fPT+BASIZ3^U2p{?Nm`%AE$o?k|vc
z=8H(X{wY>HueU<f$@-6ASVhj(Ym1&Horu8RI!<vmcFxy?dR_`p`)AOn=nkkEY!W_~
zty@-Xau0`zb|g6mh6GDRg&|!`;f@auxrq{onD}AgWTj;K+Nc@H>mT4*L|k?TkqP_}
zWNiE7#QXl{LyxIWk*>JLBTf_ebo|$YEvbJg9jSLO-&nYub7xHjYoP!6_I<~D>XXMo
zoN0zmop^@K>ZZat2O8oo!AqaC$$J8c)+%G`jdqehwT>5$6JY_M9_7>NF1vFa53HRC
zrZjEx!XN*5{(wCF5OL4uhZj4zHF;x!<j26wB*8{C@)Bk?B#_`q`4DD5k3JA$dU|zl
znssdxd<d|{UuEkt3+t~Y?g0`i)&zn&fS9=6V0x7%``Sw|dN?m5d-_tCB8C=Nm^LYk
z5E01Y+=Mh=a|-d`JG;eja`-C?tG={KFD)BEqP+6JLFewxUObTnE!$TkYB;&{I)=1l
zyIUmV`NQ!Jxx*{EarV7%KKd~#^Z19gBd+!jRQq@1ffqkh2utZ9PYJE&p%3UTXrB<I
zvc2rG0Q;6MY_U)0^%ir*sqP*++r+T*zA|pyOXT|j%K!ez$!pab_~FV3sCV#UoKI+C
zzS<0>ZRKIQ6;SJoJmK#_sP}mF=zSbEH8&HuXE38Lei9BJ*@rL)uq>TfcvoH8GGs~C
zE=pHb|1Ipua?e-`ex2A7OHUymqo^sq9caAxanIQFUuoWTlDcEh&F4w&uxu7Gr!*(-
zR!pzLLK;8!YqG=XTWAVRvsW>C8&QF@Tn}DyR!KI9?BBVFRTpDJC4fO?h!f*Ttv<rc
z>{2ug2f*V2d6DwmQ3p=@w2}w<DG~18?b=-aG`2oXWr+j$h36Wr(A92J1{j)IY2@se
zJ}4zPH<t*@7-3zo(!+@UVDz)r8vf0fJ!M(ejFM9^R_oX$`ct7BqU(lQd7-2r#ulCK
zDF!yIQw7fF2~xSvAP>Xo^Yok@<DaKF#4V&*H&T{VE3WOZ3R<+%Cyy;ocxz7FihFzH
zAr5Mug5G6u)Vw9OM&)FdbdND><wJoZ;~46xczqy?l|xVzjr>u3dKRf3K;7VgTp`rO
zF!~#!HlXbTg8N|RgCBp6lByq>Szb9G96q_M%uAvy-_@U0HkLu}@WFX0dwNDfI5_G^
zLxmq8=SOC~E_$S3YF&ipHQ;Y4GPX@VvH;J>N#R#&AZN+2d>_LD+beO5Z1$h2*U{T)
z;LYC@7VN!>$xLEj+9-*k3!0?_^6hP${W^)RzRli}OrwtXrvEB(KsM5POMf*kR?=C^
zLE=sK{f%0iPuG4sPHWh#0PZ){&BK9mMhXLP)hAw6&#EIWZ#gS(i=S!MMy(4`S37xr
zmZ;czOEMT?&%n1T%B9_J#Mj>6U>Jo(h!~Ql?l85f?w~HR8c*d%uaa+Tm)_V6N&=DE
z=L4TIZfoDjn)Qti*DoJ)0lz-a_k&R?Za*6mKfHZd;b)hS%qRxak3d#1iOPidAM}2^
zmlS0A$FjSn<+##IiQlELkO53(abC)ve@*X97!vm)FCWE!yV7`BC+rY$0Ho&GNkxBG
z%9oX2t_Cg^@EL_Kf)3L62RU{VbDLkYJvcTvZF*K~^OYu=>H$0UqjU0kR>raa=4^hW
zMq8|o_#d%*M3><7S+=Gfm-0uJHd!$fRf-*lg#<yGd9e$EqHAg(UQqlF%xIYyrjT@S
z$8eny@sa~Gp63D09?QJTd4)e6Z14P@mhOxNsh<xMP5ahihv&ex!7E$*oR;kB_PK*(
zv=-hzQwx1PC+B0*;`U0vQNH7gzmIyDDf-KZnom{kM<t%pIufwa+>WkOeBT~Z^g48x
zfirOGmtcE$yH-NiY9__B&2Y|pxx`&mR={l5?WeOpzu_%8Xf3@2#q*i8QgNL7lo4hJ
zXfQwRTxKG?o}yv~f13OX>nTdDJD;r%^Qs6CI_h4Gi?^=v*ml`@#$tQQ5Q@{Ujwt?2
zr>U1Km6D~)b$Gp&D*w8crd-Y4ZU(`ar7ZnzwI#x9)n>><1dlc<2-k)*o1{xyOC=*v
z*X0aWY91AJ*T2`#>W#C@Ai1d8m~s)8&B>WGuz(EfwsSX~(M&nEtioMxoyw4yijf<6
zCZ!TF9!@E68e{q~n~02=Wzw*F3ssCv7&<%Yq$+QaB7Hz{vF{vTXgdC8^eZiAhbNUD
zsg)8L+V0g{A?@^OX&F(;uj@bb>&2qmbU8hnpv@^<yuGV${EdTDIdVatJ1p_jL@cJR
z{&l#PA6kfI?`~nm#|>Vrg+A-n{8@zkJ}!$JfH}ENMFIXMof|m-zoJRP-;Bb_R9kJl
z>;0PXx|ih8%zsv==8yQoNpE_n_+`SX(E&y{Kuy?8)>d8Q{o>TCNs5vxaz?jwX#{7N
z9X<<SI(>5Pj~Lp^1x^Ho!R4Ed1OLUGnNtsrV19<^2q0^#DEJiQUmPIB3^NJ}?4u&8
zJ=xWu>(`G)P^Yp>I;cF6rPgVQlMJa^)|3m*hZIfRKNFOsx|ef6N8YCflKs@~_$GdA
zvb1N<|1*!@)385;8vW{qem@knNltZ3YZMQAnO)M+6k|*uV4QR{%S^5XWX=VBx1G1N
z+es&S4!cQhG}dNEql*BmMRU4Y)!O#hNCjj;pPeiE*GKV3bjrfqmCv6m<55pBh7m`z
z6XZqOuO@`_<=7dx(l|_qjB?l6ob$8Y$z7tFrHe!0>HJABkxSJ7m_pLQ`p*SbHpF@&
zk9s*zHjlc#l09^6wn|yyd~b8i;@b70WmPoC(cOPP*PZh1;Qu8I{#+rxfknv?=Yz^w
zhyOEXd1m~jm7prz!_)o{bvD;nt?Zy7(<txl8cZm4Kl^Na<!k!Q9j#A!VF+v69AsBx
zvrV2-djW~;Zy+e;sr&RycRbzd-l;vm9I;y0BnQ^mUQk$&6w#Y~;_6p9!~h=!nzRUp
zp<~*Rm@?tNqhf1bKpD*^H(mPb?tn<8W?wB>Lr{kI>@9sv>7GjitYFD*Sj=E;t;};I
zX2%+8yVUhNv6IHgE@-zDFTh`1j(W($z&lf-3Yz;ms<X$|(#G%Qb7<J{)3YkH>S?A;
zJy~GKi?t}?%CGYup)VZZ>8{h?4!+jGg8sHeTVszdhn$cX&XVvPo1nj<cB9_Si6<dc
zc(~5@yf%6qS{80UDx9j_rg4-7YQX%V!vfLmHaTxGo)~}HPFk4Tksh_M#Y%PWjI}dI
zPGwQLh6VErT_6ZEOiWA~{EMzNnARTgre~&p+w3Uj3M=X{0y1JT(uPp|c!aB@YRMtD
zlqQpMNVj1FQzVC|OgsWQG)n=vv?y*UV_q;(RKW>7dphTifuJFrqP^}J`;+(yY)+6|
zmQGk(ZcQg<s8tJ;X$DN8Weeq`owl1>uP<m%1#=D(3R_OO?pxTm>f2iG>mTEmhRL0e
zhpu!zj(6bf^w?k&<`9BK0FSwVCQ(Rly_0-X3F;hPE`Fya{&oIMW%_6GPrZHj=Daoy
zh();ylTS4F#=^c9?&y<6{ZU6C)vu*XWq~S_pzHIF7My0$>c7PwvgVc(X3~Y)<O?{x
zMrBo|8xtSjlA$C>v*S^sHn(*zRlj_CocGnGp#eyQbSv=P3ya>8<WoO&D0SI*%ZMYe
ztLef7bEeUd$^T5Zun~|jwu6@grCK*Yc3l?k7`FJFMNQi>Sp0*=+DzpXOu5X1gkaZE
zdgzWNA79tz2%UDsGqUtEB-(WXpVKIQLsJ-vr#jkCqPeJs$^Ejh?tJf3w61%!gnn9(
zRSMw3V7Xgje4@QhOLRp}l?K6wwN$zc4mqOVwp5`vMQ0=?aqU?JCGXi)dU8rI=AS@}
zes!dJ>9Ee?P!)Be#}2C5b3Tm)@Wfw=sV3)|WBXb_7E(^PGOme3#!2fKufdIQI(E}M
zPZf(+k|;u1rzewXDYtHaHrEUdP=d$c>nAGEG)T9?_0`k476167zM~3*KsFvf3tl%@
z&j?(V2Em`xl`c^YeifktM_y4ITd+bgiKM^&dxZo95MebijSX<-?RpsdGY>#H|BHr+
z)S?!F<gqa-z$?gyjq%tIeCLN^#Iqma<^`CAzG|dAk6<otjXIXMt=ZwS^LUp<7kI;+
zJBb(ushmxfm2jE^Zau;9sMM)fH^$D(@f<8#?DAN<VpkPg{XdM6$rN|)ToUfenCJ^g
zB!F(@dR#8_!FvP;#mAP7G!T)ZdM>Z+UF3MwwecaeY1F&-NpNkLKn$W&FjVC;2aJU`
z1L=)lB3v8#mI;3e$xZkR{xf%u@k<qtQlv%&sWotBQD5%W>t=L9)jb0)?-5Tpeyu8u
zIwcZKpNuB$9`#BzWWL;q+ANWy;HjIufHyxPcsd_~Ab%6S;=l&o@}=X}G@dZk#!P2=
z#t@6U)X5gb!RV#mZN9HD9y%QBn33XjBWPSoOFMWfaP?@9kX-0z>2-28YCE}+y4fD9
z*NqZo=zq{TE)Erc>_9Iv`G?M`5~5G97h~vm*WcikIOL=S`jF$OywWpu%F`vuP8pqw
zr-4UMJax<o@IXJDk$An(0k`KMcvLG-`j`4knyWC-$x*dycH&7T8%@sX>RI$iqt4v?
zw>L-10CjKb{JPnDvA#71xAY<}3%hYxV~b$q%j_fSw_*nxJu#a;bhLRpW=8}$SMs0H
zup}^K=>-Ru63b=#TJy>!vkSn4N22|{CQQGf!(#7FAEE`5J)nv)Py0Kc_C&HwBj8Ks
zr?i6tZzQ^96k<)cG+z`|!qvO;Ht27fo1nVfluhLJFt=1Y#rj5-De8<R<z^j%Hh=48
zIV{^e)_Z0u#N%y|WvK=)Y<jZDlcI~r8Z*?35%5@90<Y+JcsfGJ(h_b`X*EtmXX^g~
zc0h^0Wym~iFTAM25dzY3@j_JiW)W$7z4LiEnuSr%NJLBAS_S^`IP#D8Tgh{mE&~t$
zBpe<yGhh^h3guu(IXj%$oDI2HeL>lk!w<BMy3LcL#$oUD=%fi0hXW@KNI?(M%vdXf
z^3Tz0G?nUh@9~py_A_uk944c3rAlM>=*MIDMdv3!9MSz_5b}X+8nBMIF87oHh68{D
zCkVu|>)7xY6j#AAREy!%!Y4F27kI>;QuoY+BVMD2q4tgK&!<yhUT~_ToXQxu0^@B%
zYpM;BYa>rQZoP3lpiByUPDOz40>c*+0QpHW9|t(V_aM%}AqB8tAweGFAXWa#kWK#?
zL%9kgyL1&!dgy673$KFFO?~wxf}ryGVsnxYIc;PGDtefTLby=S-*$QhRGsPU=EqIS
zsPZStV6yh-!7tGo^!jSivZBr{TTfW%_6zCYpu>W<-O-Wl@Lg0hUvZ^+xoW0=`@#v+
z)0ByQ$P;Bh)Kisz%ugNDwbCSUO$nnSOCcS+Bh-pn#yLf+PEtBGD^8B?)oPQ%Q&E^p
zb&oT;oRe*dTJ^%MTr1OY51~_?{ny-&X7ll~WM@*0(w)h7iLvwk75YeSlfVExX&gr3
zcs?$czc}aF|2b_ObsI*~GXc7mEAiNSl2LSItK?GjxSXdH#8XP~kcA-|O%^#5%3i$~
zGgyYuf?vqn%ti>u!13^{$C11A5RV(Ln+6K7h)Vm$uhOh<cA6c0>&~*%$Ydgu!g)D5
z&4;81X?+^E%PeN_V|Q*bycvnFxkx5U*gS%raA0H!bFdW5UHF~@oD!1=5|Bzcyq#pl
zdS1%3jqf@?ce>5Du)Yr3fP60hI+%56PFm40E<Z>@3BJlODc@CnaD5C|>A-ZUTw->K
zn*`O;<z8ox(2Eh$(yU+9$)Q(P#dp2h7G=~*vv6UNPc}?9^AI2vuZGpA#<Kihs(CvF
zn5%6of7f8GDxDD+Mh-9O>C!x2MdY<|La#yqAZW2<am#vJ+nDCdR#*IH6>+5aN|$D~
zXcm%`R4{Ze%{`@n8}YK_OiA=z@4d_Nccq!c)2c4+bveHXR^ec(9C0!A!_D1=nPH(k
zN7J~{0F@88@$A!DVc|8WY-QEWUO1sddKkwa(4BPyM3nx<H~<_C;Yf8zxjt05lM3Mr
z-(a{ka%GK3i=;e|u?+#J2Uf*(<VQDk&+A@d1ldt=h55-wI13|aHi54nf*r0WwLR~R
zbeFUI@@ISV$zQw=uMD}Q7I<q`mn}Kua*}-5eNW5A9@qBEjX`j=5zXP$@VmNFq|e1P
zm>|@L|Ig~c`}aF!G`{oeufIHczghb${z;#Gc=g@G3?TpdgZJ<^4p#Hs_NRwuzbc-h
zrv|%MkQ*;Qv0Iz+>iQCGZ&iSNfl<4dd0PNt5bG|`;Mcw@m+_0YfnoR7^h+0&mCL!O
z-Xm`-t%eavnW=>=3dv-3f|;g(5K~){UTGHRuG8cWvhEZt7m}!}$J<+4AX|-_)O=%x
z*4*vZMk?=s05OFEgP**y7Oz*{{(mlb6&=ADNN^PR@I6yUHB|X^QNHRor>~ou)j8V9
zMU@g>OM#IJ)rF?;Rilzx1mmB1_LaDVF^YpIYQ&6SMqy7o8S#vJWeRD!m=epB9_`*0
z7O6r&s4+d@XHa+*OcTlwy#RSq24f}sBc8sjzX0|^f6wO^7*nG5BANzQFKZVsF2aGr
z=8s${6EuMclfs`VelNg*27hO^^#0-h6V~%fJ^Q7m{$Ai0zcz&L-#z>lINgISZ!2YY
z78CmJZ@}vQ%iFYhk95N9!<zRJyA_}RV;aY^Pd_$KI<58*^93WD;?nL*#lnu+U4#80
z)3xj>%rpfY3WyQ+dEh$zOK-Jl!NZ<(>{nN+PC25dyiN+!1$R83_F?}Er*MG4+xQTp
z7A7Hx-M)7bqKu6(aqv|=!~f63+VU4n9Wm__Vt-ll9z5{+gUrL{0_qCZ<`kA<trjLV
zZl-n}Pe0UV7;Vki)XtcJ&ZhGqv$0S(M}LOyB;Lg+KBwGq(L>-%@pUjA&PQGl#q*0x
zj$469JdbCWn4Ruo6x2|OX8;;d8ob&d#O}!?NMh8aN;&ps9BMO$m%uNmS(96M^N9ft
zo+}`K{cD~6uMg&!?auG_VZ_l44L7iBK~h)K6>IP)#Jqn<tD$cE`_RijlNaW$ZG0YP
zOS%Bv5?W!m?$o!U4&I>>*ZkEIAj(3Z1}Q4?G#@c>4uYgV4bPD_M{#rkfBf@vpxE6f
zoA8~civq{-Bz;<|I5|pvHlD1RgseNWm}TK-d{qdrh;{J?y6Jz=zjZ2CTiSt>+n5cb
zolTS|yN8xTz9GRh-)i2NM3q$N%$LlXl1TS-G6%(tF#Z8+*;4^b$GQz?&%Hj3lLAJb
z#~1S?!}6GQZ`R>|wawba=8B)<jX`e<{fU<wo|mhlMLF$(ruJ46-yLn7<%;%*-RmHt
z+1DzHX#JuFB;nz{WD4o;zx#Cy#B>K#+&n%5>b4UqZ$+O0_OTNzZfu_c^obKF?2?}W
z^C`kK!x-5BtZ=FBDP2+o=Vx&dM)u+|h`Gfj01bbbT)L-&QBOF31?+8BQkHBm-xWfe
zOKP^%9yxE`EsZJrZd<z2FHx!)GrRef_28U5ZXD>~<YWKF3t;0P=>F@AH6Ig@;I@oW
z3ZHZS3fi$TLl74hh{JH2%s5T&Y<ffGfs4f|<1OAElD}fsbX=g|K;>(Xm|d~$xD<0}
z;NE8w>f|88{}yY{vQla~P79HY$)Zq)cC*M)$)-;p(``K?jjv#VRIURm;tfUsAvKCr
zhJyH1s^#fmFdFuw`lX;FV@F9<t)wgOZTt`D8cP>Lyy006{s5{6qtxb7I)O%)zg8qo
zSN4Ui97x|57+JbWfB&%a^IOXhKX)6a5KMQ*AIguj7H69J<to(kGBphIFxOYhV$7~u
zaJ6O^y2ag^x!QY;?m_$Hhs@Y5LQ(A`!3@I(^r8tRi@t*8MS=tQb)#A@KxTv1yN%;k
zy%>WjoZDd0sFgk%4bgC5O}#?|tvL~y)?R|lwBTJ4+G%z%l4bAcIOmU4oE-C{**xl=
zG>*DfRAgo2+=p%D1LkW*BSp;OO2<ZKc+42ZoY~?;RxRuc*>*7aDezxOS+D%_r(Qgq
z1rZu8B;HwVG@YGc2b7WcnK&z+)m7(U+6ma1N@;)Q`3bNU3V`WR6jvW@`KQ30L)Q9a
zJrm7{i01aibJB-i_9j!1O0Rm-S=XGT`9H0+V%G3^GsHo;lVwQ;6?!_4fC#)|SedHq
zGa@5P@0(Yd3L8+GvBdHdPdC6lptT=*Z`()hZu<zc*0mcaon}t!p0oV0$;S<av$14W
zqq2!*V}WEgo%dm@4aa0=;?0uhrP7~P1O8x^SnHB&jpHbu#ZicHGf`9Fyo+!by<OH8
zcee~nr$Qv(4w+6Y8dt6NhgpTvZvkQ7h|0RGVlb!U#7Y(K_uoDDEANH3S^5@EUzCuz
zpo~Z$8)0+>ve`hVEH0YNRc7(Crq7tS)SwJ=S@it#BpzWVAwpSxCAbP@W($jKP&s>!
zTvbhq&cAo!Az$ovsCe4|rqX!TX&;_;o4s!9tx3h`J#XatF5^v_+NLWDLrQR^r9mZB
zvD6$GeNkA)FRd0vjo=as;zn=*SL6uwCLcQ@eNzxU!fZ9`cBUm9181<aa*_zVe?(c@
zlN4DAZf>+rSXW8*f|Odb-4S>{d0U(Ht?h@YR}ShXr9MXZz6zol!Vi>mWNkkAO+_d0
z%E?j&zVnU`^3vuwDHjr+BM>mx{q;1Q1yyewM5#;IzT>s3_mqe`cW@D6SA<}9+T6f$
zo4GX;s|Zz?vK=$RH&W*qYhTo}hoa}}qti6YhLzu5pDUG9SkCRsES=9Y#vWc~8FmX>
zr5qYVTcsSnV`h!jEToAKbeemoC(YjLX196tW7ZpM0cv2Q8(?ew$$U9xjKW0&Hi|65
zi&bnDv=|j`gB9rhJ|boB`1H0&0in+yQtIlP6)|JfSU7H@+)^A_WmiU&QR~*&g7Zq_
z0A9DcKQBaCCm#9JFxhz3*#|BOEzU2(!BR}=k_DsI?-yXkD6;}abm?1QqSXN`oW5@D
zyD^aQHBBi;g?(4bmr>wH^GU`5HHoXp^9df_%NhQ+TKUxlq)Kfw>rHy|rCtu^cnd5R
z>!c%sre;+<NX63uJN){jQ_!#_PK-B2Rzufi29WbOo`Lwu9?iMgbC0iJn%spK%xh7F
z6(-qTbyWvy&YsK1^}WMp<LJ~ls~4s#aW`3_>%@M5X?&H0vJ&Yijl&oO!H+#$yOJNM
z*FU!@h`=EgQBhCw_J;pt`GWj`P2VfN)wvG5DBvXE;dn9%$Y*SJ8M3#7%8HV%Uz31D
zR8bUjWjbu<X=Kqrie`RMokbM0xZWy+vk1b9^aGOjPd#Lqy}ef}kql;hiKidZ-*G}Z
zyOdazI6d<JdE?<xX^Af{mg`};We#Cbu9lV)pI)n#GA0V8U##vKLwjM3u@npn<$2wM
z1<qrth|7g6eV2D6OW$S1`rooe^0r@QX<nJx!V5j`51<O7MPn}IsImy+=>}tmFGq!c
z;+{AU5_Lc78l`c|>BNxBJgs27TaHZduA3g$$fDR7oQfwPn+ad~0y}_{I+~$ic{~zD
znukcB0p|dm9?BU)DF~5pd&T`><NyBLL&ZSKx(i%4)YZ3j)3IY9L9Bhx0~yw!ZX7o9
zE{J;Vi8i(2wp;YNhaEfIhu$b0gebt(E@B0+%vIbhsF+)3#-`+;DpyZ(v0zZS0wa+`
zfpi9KE_6}A3F!6I4Hj%8AJKXpCW&8tga)5%uVmkzA>bQaUQ5bEu{O$59~(j0*gFbu
zu9=2+zdG5EdkPok4?+}Xgv<NC6;8F7TU(xw`7-->F`Q8z7%v@ef6+`_O1yFpHkAFn
zo|sVddfv-jZ+mlVYis+kf~GyG;*kp;wR??j`)zBl)9Y1iu-u;EiNY$!26ux~c_~$u
zsbOS|Jap>Wliti*p8(R!>CejMbGrZ%m$+M8#Td{OgUwJIJuK5Bqgt-(BdBGCDw9kD
zQ>Z0nhj2Q*?D>O1*{^yZE8Zg{bc3j;=nJxGX}!0$dJ6GQC29J8Wvw7grb7CcA+6VY
zd$nYC132qRXNxHf%H~SZtm>&H{@@Xw)Xyt_l+GePxFKKC9M&IvtYX<Jyki6a6F6-A
z)ZDM6RsG>Cm||%FVb6~7h8nZIPo=R%la(*F@|*!$RG0r{Q<vOCODE1Ovvk_n>OyeM
zb=71=13h6|D@{(>1O}}Tw<+6GR>{s8wYY4?%tE)Cug=d$UwF2-m*ieLkz8=3gq}>}
zs}MwU^rqSOr`KWXaLy+_IOIt<RX%sh`ZJ)EuP?*?B{`34X#RP86;#NahQNuQLIG)a
zI+HLuB!T#5f+m8LQyOy`<fw;x1yz{6ujejVM&bE~U>a?x61J)uXhX;DvHX-DZzGF;
zyv>C7r$1@#t=_G}OWYzJz+Wt&;5P<?$J^ztDpsDbBeR0Z+s3meE||Orz)Obt>`4aZ
zvnK=--e*17<Ajm!q(k*`W%`3AiSWLl05SFlS7Cz22Knht-#IQH#$!J+Z_T)<85=1Z
z9!bg+T$j<i+uo7w|Jds2Ku6YXk2$t_y<YXOFeOs1I80UwO5SnUDS+(oIq$REGDW|?
zg+a>k>B(!22P;i<CN%yEX!blaA#blgnNw0;FMRfwXTN{^%d_6IC#l4p%iT-KdPiuW
zux`ucx9#@gnj&|*s!~q!=g&0=%K58)$a8s?`lu};mi_io_oxYC#!3XEOMed0XdpSl
z8N|^Hx&9*JQDyE-K&pA`9&RN}y+7*yx_|oicvW1z#|m8IbMZw$o-ZjTg&as7%*REx
zVpf@3Ak{=CHf$T+t$@$>N9|vgZ{KPdeUDYrI-i464P-G+kJ?7T6tA;O#HN#zz&QNr
zI8Dke3A*!m2N<_C%2O!EK4okiRr>Egcr#TO03s3p2I6ZqnV)|mshH$riQ<zQR1Sh<
z63+O-s7JylU)P}oiqqXVY4#dN`@PP)#&Iw5IISYc-xNDn`LEVX;vIT=gh(l<O=_NB
ztM5zsC>BNpSyDfF-)+^-LF!vHkiw7`R0RzUeU$2<LUQd-df#ok4XO`YM?Vy*nBM1%
z5|(~k3Xa>tSQZ1p@wrn^hY^L-ST^n7ZQmaFZ?~`FvFhWyEfkW!+e%M-xBUp!0MQuq
z@&G_qy(in1&w>d=n1i`>7m%OsFkgl{>#eG>!QJv%<`};c-z$psogOX8yELq$rQGJT
zJod=amA-ouxFbv63J9uqS)|Wz4@H$$*)w_v?UTLYS+KSa({nFvosV>XRdEEUHMye6
zo%+7X_h&JOE<fIeby8Vg?%9*7_m?knKuqIZ^+*52Ei4+?&qio}S<3DzxvGU*#^N$d
zcZn~;ukXfD@iUK-@B%~peY`tQ#ZRgqHK*g_9oXOPx!*mEo}7RG2o#LI5Dsp^8I9iE
ziW!>q6#vWfAEVUmv?Z@jTZi4&QE%_?|9(OJQk?YW(a;a4bd$P*hO<D&Xv68{RgH17
zfp2ULV}oVw5M2%5N>*}p1j3uIw+&Rf^?uS<UvB|HC(ZwJ+B#|OdoR4L&8_XtO(@Iz
z_*!N(qJP!t4A!tD3JQP96r_K4J!tCm=%CR$q5EtyEqR_TOaGJ~;J=mp%XwtK&e`bO
z<qOo3W|3PcC(X`(K@x&P5|4T%4SAuC8r9mLuc0>7<1(qJO-`R4TGNw0KeZ>$oG=_;
z!9?M!TTD>rIG>5*-Y13;TAKzV%tnz7n3FYN`ez&kHEmF{%<;fcI>#)P2^E%2O?8M;
zxNAk0Ojx0(D-@eE+2tI@7TE%+VUszBslg8Vg2Zdfnh_|aO5Q%fE}GpJoP``_3;E7{
z<LF)1s79NZ*>i)uj||GvTrPSMrn(mwnf~AQQ7)a$y%Q;V$cX)9E%+Gp(XwTcot;^>
zhUOqk2-R7>kW}$r&FT%*z(~@;sEAgjbPr3T6-qI+W=lHgHD4rWisvfgB*kn&w~zua
zdNe+hd6{w647$xiTroWoOla?Id%t;@LH&EQAec?VbM(9FmCL#-<u!8()+*#^zaV(J
z(ZC-}tYWQ+cDff+414Y=lWz3NhFu^;KP4N_rq_SYRxmZPOJ6bSGbh!IAdsF{ouy?r
za-3>i_<PmZ`{DIT`xFkY5^&;+NDCL_EiKX9E-{W|P9(?`$y-MOpTIr86nv!MQKbGZ
zufx#;FX(z$ry@G>$!rSyxmj+V3W^CZ7sbeSy%|Nta~6hKG)im0RnM*{W*PcDN*{;M
znYEYgCOv*_JuI`fj0;;$>eA-ZGWB5FsG|puW*Rtf6Cq{Bgkh_JXg1q-8*5}sIprO*
zo{{toXznLhR7j_B$6@Q0b_#gYZvSB3ITl)W8)LR`nZZ?R)LTGo===^x;aiZKkdaih
z2}wu&zAc4V&{7&PAD6eDRlV<BGijDuG?!+%KX^9rXY2LRE#}keUGcPOuNr^gPcYL0
zJ7ok}OUmLv7E~U$BAhSy^W6Ck_oVUz{917rNCG;7aG9#7qEE1MLSw&i+-?1cK`08U
z4*<{8_(nI851GLZ5^9(nIiomkMy~Yjln{m8H#gaw$86SLcE9)f=(N{qpPuZYTXdm2
zZT7__z39bJPn>ms%_SNGY;mEf*r+9#6J*N4PcEXlgm%nO0aS@{X*3*}H3qOi7ADs4
zxV823`EVHE;w<y;ifmWqt<6oEX@1OViCr)4b-CF(`mu3{=3NM(>ZuAk&qG3a9;moQ
z4=IeEjJ$`9^eB`jjJzi!H_@7U0z1_7tHE2Den1GPBT4TBb55R~9CdnoZyF~Qmer((
zFQ=HmbqSms{lqD-!+aVf?3ATLt>B3LJ}~t#nUMh|jEtizp(XXJcKh&;I;GQH5_SaB
zktXcMuH*j2^VtN`T0kEYQQo(Y4qC5qDZFhQ?RW4*L=?KA!nSNsa@@!tZA|9pqYy1D
z$LH}Vsn0&ngmj0yMm)aT)JHZv{xArqUTxy70s|}bCtez@8!8PyiI1KajnN=UMW%!C
zUtoMN*u5v8yx(EVdsuzw!T-+Ez}S(FV;7C3%np_DezyX4zvozhSY^C&m2Fi;#lej}
z?LfDH@L#@6JI+=iC&4&|y#_-QamLgXS&5ED5W@cx49+?YR01K?#Y{QusZnG1jPz$W
zgpcojGv0i{q3aIOLE$-tw)B4IQ0G_P+W*6z{_@=#5AK(Ukyg?nFbiRucva8^XKVQl
z-z=~YL)5I0S~Beex$JU;O!!6xgltSIB+4=f0N+^zfdx#At=U6aqpLWp!>%!`m6Y4e
z>Z@oPUcsd4WdKBT%Vm@YaHn;I*1gl&t>~p-3YmhQ+k}w{UqvMM9BC?@$&J;AoLo{6
z*UryxQ|a-$-;4o$vg4565}9|PwI!rfAeQ2*bP&6lA$=(l?ENE{eKr{?AYX<Qp|Rfo
zIO0oD`0ql1x2G&_7Pm3Vg+YNt-`|BKR-2k^b22w~l0{aYwcHr*FkyGa>^%CyxHTL6
zg4ngj`6cj6>XiP-Ptf7zb1>U^(>y%<w6+?OtyTrSI!zk@d2A#f;iMSwaC=o;+GEmK
zq#o|3UA-lzF%!+1oh|7cPda@^w(BcTi;lHCnZ~o2Ipb|6h0X~aC%kYHGHui^>tTf9
zsxb*VX8cJu{tgG)zi;4PvvKio3DTWC{sReDw>J%NrQ8}jD`7@p|AFg1H;gZVGCBzS
zK`0a0pM^3YyH(MqhVtdmcBi%Y1yMJ<CGNi1O8rBSmc`bp>+QSW!YG-+*IqIo4#SV1
z?t}ug%`>6k+YDU76KST7r*S_>5)as{Qb47*%>CiT<zSlhLOcGydK}MZ7P@ty^6ylM
z*?jVc1>=8htIurB8D`3qj>v25i<rmM0T<(mcOFI>^EG~BJ%d@4->`cOvlvid^SDuO
zG<w>n-Q&~lAB2WuQfy)Nof#$W!?c!^04!q)l!@4JpZ$Oj57cZx=kQY5f;?}>m6;-6
zGmV^f6&f|+r=xKG2~&V&`hnH?u>->1Ud~j6%I~?#5)cdl$trgXcKX;+vvb_sYaO(j
z`*zLjV@J*APu-J7T1)lMeC+C}#5vE7N*=pv{PdF(4?q317!g1H#0_N-A&(cM!mOKr
zT#O7=FN2KYdWZX2Y*0OUT-cCREp4c{+J2|q%d~~njK{9dVGf2o=JBzk^vQ9f`=&=7
zF-sedS6U`Nbq>47C+)pVqw28(2E00Hx4YSH%Hx$9WgSLtq@vo$mw(kd+HalY%JX9v
z`WxLwrUId#A3G|vj`j{u_nT%NtdKr-PnWAx{Mb<*MG!}Me!LReBr#JKg38yFui&32
zy-X#nU_5qI5(y&PiV`f`tz;^xR*Ea-pJa5W3QSg|y0BvF$40l=!we9e;|5(rXUcl{
zPo|L!2uFLi5T#*cWUG8V+3|2gHrwV6x@Wv~;dnlaFM=rBZ?V>sw~l&);Cz0OAFtG-
zw~ktvY$7SFMQ<IoP&{(rR%+qff=V^m>gN&WOLtZ3>9-52U-bJ0ZT9$WQC*{=qprIm
z2*{)2f#O?7rTJ{?_k*HJ{MJ$Jqli!LYVy`4J;j-6x9Y)LR~;2w&s|4HLCn|e`~AzH
z7Q>P6DvakzrY61Z>9?->A3rYWExdKqxqs31KmL6`(_j!Lm;?s!u`viH$;Ny#fKyM+
zIHi1U8<->T`|qFP->vVTZkm7T^W^dNe{4P3+J5%*>G#`@pZo{BeFA^H&HEVOvd<jG
zKJ~o+m;*1E%@>qg^8UZ+=i6^K@C<tHCzqukn<u;9ZIw<>4tLisXS2!9#>Vyab-nLL
zadhoZgL*$6Zw%t=XcYT{ymq1X-ERQlQyuVGKmX_UT8S^<_N4;GG58K(ua)}q>4?61
zFTIV~c#@uorD_SM<m1&ph6S%N3+Hs0<`^1Zd6`b6@3<4_A%Gc5af_Lw+0K9hzp_d~
z8S#vvK>yN@E`p@K_V2uC@9~pg|Cb>>+ql0rmaTvIWY+)FCr`is5AW&yb)oq4zkK}{
z&p$7@{ynsT6a4JilcM>5`uJIP{-1rnz4ev<e~Hh=ddXY&_TtISG`zT+dF6h^+uq#9
zxIZEA!eHdRo?`TwsrO<m4+d}?yO4)yW;pgkeh4h|B|t-f4dAT=FhP}JFulUiHT>!X
zsf%59Q29o=iphUV<x$5cuqUC4ZWvF;z^%y~H=e3I;0R?L4=~`q3XP8;4}&Q%aCA-6
zj-q5ghic1V48(kmI}jX$2BEl=LZxvq+mU{GxxSH_Q##d;2WS+Ypc&rGht5(6Mhvb9
zuN3m4coz19Dns))Wa9_`in>%cOg=wmub|cb$PdS4)#vUCG-)73bp?hxnD+x$Z&WX&
zQ+Mi(#{*TM262Cmeh9vrxefIBrg%bQG)WBok>RGRGf0{P(c?P`LY+c^3?QLbG-l{<
z`jn<11S*0KGmLo3d1lWkOVvQ*I`)ES051b16zIb^o>3S~K+g<=txQ9pLAJ6aOeFDe
zhC+==RQS=U946BcNp6ZX6)|-siHraXci*%+UZ;J~eb+c?dhq@Dr2S)Szq#+d`Wap}
zy}kDF&nK<dZ@S)__90$ec#WfdczV=5X}vn_w&B5AqXRY9XvM(0#?jAS^QU7th;+R6
ziPw62eAohb&;TZpY&APok2OcFqt{grV0cIEu6Nja+v-BGZo7)@BCvc-uYKUXZJzAC
z!E5_ht;1ILXKM1G)jh)I4xqh;cicGXw)RdB8z<iJ>B(`sL(p)1`>oF2VWai7xnGAq
zK)YV^$L3Mj>%3_k9%hEyes|P7!2wufeMPViTWERD&B18*TPMxEE)FaGwg*UrP99c0
zQrY5{=1)x+QRC$2Du5-1)jsMp|IaCugZJKk<89+LjIq1~JE(X(J!!thj<*jG4&AD>
zx~JWy_qyHQC$x8(CqK6Knw{s~VY@?!JH=#&sN}=u5ei@pUc>iSr=1q!kC1-UZJwN*
z9(P;qqYBLVJHQa&paHe_3D@l-8Z#iPeeyHHMP$%aRK0g^n(!Rv{78n^J!v31&>3~F
zYnFso0iRuCu-;Mg^<nFE^JuS$Z`%myU8~cq@Z_~RSf<5|ziU9tr#O6?H0T?DHE6j?
zQ|q-3JPxzAFNF~rkVK~?<O5GTr+aS%`?xGNN~y2I+Hfo(7}ku3awodx^oel!PLxC(
zX<)^JdDKrl>j^NhT?tuIXNmtHf+zfyeMRg2^m*TWE-qd4LcYrz=+j_6p%?sBo}+sh
zJ;g88(x>O8(#E>iz6z#OV0o%%4^v0=ME0%-I2rm*k3wKV=QqUPD2XcItZ;;#VAjxp
z%K2jJu{2x}4CIT%uoXaeGbocV{dq)ch;|@<gz~)fi3WQTP#)EEfWUci|0c&bakx%!
zSmc!^O;9CcEcnjZY3fCOs1+kBP0=(jn(D>Vy=cl^(~i$R5k9^RhZNWCUF+!ac8Q0)
zei@3+)p7)t5eP;zgVtjzi)Y^_16bbz7L9}Px$OwJ7_>r3*{GRmL9kKein<uSMr&DD
zWbo{?1mGE;W!S=#nYc0~=uWy2teTH<LY{1@y8sR+!EncQlab7sxT)e)aqN_TwY>fB
z_9;I9CCTVsPJheJe~+JRZhxOW|Dj6o>-p~seB9^1&A-+#BM68e{^$x>b^za^VK@pW
zlh}LVM>8Oje>zWpIaphp0_!*o;EdoM#qo4-IR_E^#iSqUAFILoYgG;jhyHo;^{n~z
ztoik<`Sq;%^{n~7{j4c6OXjSJp=0rpaj-<Mi0RBeY&zZf(=(|l;io0gY#_c)jMP`I
zAQ2*Tnt=-^K?IT&Nmo{r>IL+M&b{e4psB~(j-mC$lgxf4sOV7xYa%sc_!2%)HqlAH
zOuzPk%>^H4-g>`E(KgY+z3OG9bT|pJzq`jEI)|zr%iVA!Y$QqC4=Fxe8%6;|JovA-
z*Zm2@_EGXdKJ{|5^gD%9uHa-MC{<}4`rhl$KFT4K4xRrs4-$mZIcimr>mHo~E0B89
zS={-j<e~Lkoy@zK;TXCDgNg#qh}xIllgKec0|JV?45c<OYFJv5Vh;Mqny&`_%&%i>
z5(B`?U__&0ozINxCLYj;8X(r?l^!Y$Qx8$sL?lq=cEHONh7Hq6XKdJm@Fa&ReJ)TY
z&^um&8=618pxrV-ckydKQP42wE1E`N21Bk*^+cxNe6X<V`4P2?WV@j|07tpmoVH)9
z>vA$2`N`}sh|&Rg?~J6lIKGj86HL=FP~yO{1h~49#8QA@YD?1q65=(;mnTp<j~vy6
z)WVTc156vdi(+C=YOGFanuA%DdL%eikP_I3M+35F2J~TyR6xd5YI-yO1N3+@@==&E
z!g5)Nz^+bkfkzkb5I9hsrU)j#gLn$t{s1Hbka5^h8Y`QtkJU8h6R1rO2?Xu_ikL1&
z@wq?BW(r1`Y9v`-FX6|CL{FbH0VgB_9ie<80xHnG3g#zMGaxTo)yNBPtG-p=)GT)B
zwU3)eNE9k+>e1=jSFn4$@HRhgfpm|b!_v1Lo4|X6u~b`~9x(gf-pS9$-8Kaf?HH_(
z7;14ji{YvTw|CM4VWDx@>%hhho$z4o9KxWx@cwxTZ}mZnB336aS{P}^D75a4l%}Ai
z@E7dCv|)bF4zKv~h*Sj*XpKH$ssLaUeN$G3brN7E!Xj9QfqzxdFWzSqM(hwhvs)v?
zTi0#olP8x)RpPL>z(*lGq|IAlqY#pW!&TT|dJ>oxHe=jCux#?YWHl<A?0$@8%ea6s
zSRikIqYvT0-u{O20_a+G$nK`MYc%COA`rr~Faj6C_8xc!d7FC73@S$w*!mOYyUmwV
zh|=Y_9ag0dpBq20zohb#k>eO}QrkRu1ZHbsb=>YSta_2)O$|bNe-X@j!ex4jxxfzf
z%`Vf4(O=+uop>B@yjGmO8)U-7gLQs#VgB=^?(N4I+e89a!S3~qVy}j7kXc3h2Q_j!
zYBJJy6?&ujnCGD^2r^~{72u{$HXfGO)7P-~2((H%Y_qnE(cLQ$!)3~mi<ZNXf&>F9
zfk6r`;m4y#j;W_5X%SEuR?IQV&=ME!EmE#nc@|T2sbzwbQp9nI&xesnGc6$$VE9ZU
zrQft{CXO@AA)v`+teiK=4B=rtS-J&XR@+`y-n<M(6AZE>KZ#`KeRa@>L6~bdQ~9+e
z`KHh5p@hehktQG^^)J0LKQv~I(j0L|MN;h@wU3%Rx_~jBwWHW0*lW)h)!#d5qEYxk
zqjlKacLO@`!x4+9EJ$ZX>?I8}PrAJynm_9>=k7-KMj=XqeK;GDJn<p8VXe=34ALTq
zo}#J1xW7{``4CQE6I#-8gBw3=H}+Q?AX*8+8P?l_Zm`0Q6fE%M*q>c4Y3{HEC+)j6
z*-u9=%`R?B+43V^Z`+of*$~4<BXV!%hHx5vh~n#rsg#t1Yl=yzTM?q_gK1zMtFp^y
z9Zpn=#*xE)L%;3DjLi$))?ONCDsv^MOPE|418tdC9y3vE?@F8D^Pbs+!nM(k6w0>2
zk6rMMZt@+_ik!t3u!Xtg(CI$RnmnlQBT1p%KDoKu!bRVo08yuxjMls2YASjR&`(;z
z3B*8tH9KNvd+Qe8bI}X$oN@uV#g}`qd1i`MjD3?TWjD-=7*(d&m=IWI=G0_I!F3tF
zUu{3`@tW+7;k*|Q%4Q4S6p;+R6sE01B`#pM&z;>f$Vb(}?Khr~O2DGTDwSv-V}f+*
zwfB4G$z$oZ2?^#T9Nstp!SSkf@N@6D**ww0w;puaA_*mSQD9yNLFgIqe*fKKDP?DA
z1Df580&`0&XZM_?m?pxZ^#C3AGRr30_&2H@<fnqp9$6MRW+=Y|sTpfTD~>9^pV^sc
zvSZ`%Wk<Qv$mU7VGj=14q!~t3Ejv65+#Lqx-ZfVpn6u-@OkzI>g=Ko|<X=Sp=u+SP
z`M3!y;O!lTQm`rCVUElVZP9*~S~l2Qpefg~7L!`sNx5uhr%rb@sl_{4DhZ>wx0k9g
zo%@q{+B5hw*2$}TmHJVknMkwt5+^6aRI{36sI1RDJ<|SHy)_Fy>g3eH&)1saHDlk-
zpP!5w&^p!iDRgkj24wCFTs(gsT|9#JTj+m#PFm1$Fpj4;EB6!-HYDxcuJ^#Lz#|aQ
zEuw!kEYb>Jq*~k!P(@JIMR*}#8iHP9Z?AdWh3`MMj$ZfPowT}`)9K)#d1CA-2w^xd
z>tmk=nG&MXCihCCF-56}hW;q<r#&K5b$li|x{}SguL#Mgtnq$@Sl_ZvN}80=)QU#!
z#Ate=XH==?P}#tpF@`q1G8!!-xeiDEMdCdWV6Rxg0)5%6z*eSPlnx?Xjwt-D0W1&W
zQsZXhd`al8+{1`uUBOtSUj{@J(%{AWr(4^<rqEK1rhV%C+}UfG@)UlONMbw#jH)aP
z_*$uLRo9Fu^M-W(*zx|HtW{Nz<}zJ*RSZJU=$!ClXLCb_hm<l2f)72^{oB;?IlZy~
zs1LRUJS2%DZm7psa^=A6^{3Sqd8<tkux-VeIvh+>YR<3rlm#~^m?EAMd`{Yt<*^mg
z|Da80;$2_H7>CxsAY+Me>f!NCoi5;fjR55|pT4)QigG%ckdGP5S-A`%+dU}B1O1F4
zq3KNalz`fT0jluGP$oO(bWF*DLA?uSm)5D(9H0B#)l>4nb)dxs{Y~b*bD5?}yNz}4
zT|hTZctmGulCMhg*tjNDC6X>?Kf<e&D&7&|jaxVxaZBrzBM!%|uEBWxeB}mUNuPjN
zyAB?XMrcUl%_ko4UsUhemxP&JdD&1DB?uG6!<2=K>=Bx9W>C)3b)>fYJ-j+YR0s`2
zOVl_8Dv0`lxq~i{__LjJ>l(CtiCftW*wn{aj}nbz!7}d*#elMM<Vxd9RW_)&Ho$Fk
zj#_IOj<-~#T(%%h>5#-vcxtIZh)pfwQikw1_HWJu3S0jUsJd*+Q&rj56<&<H)z*;j
zgh{#%6EEE+;di<%@@*>cjcE*oiPO*9Fq$_3x)e0B^qS5Cgv31#26gYi$9=|l#1>uG
zVG`shzi`_&=al6GbzuyYzm?mVx2$`WLdd-5=RlhmyeokJE&F=YP}K?FZH*_RAT@0R
z!83m$jEvVdTu=<uyv|Z{dtg{Z3$w6wIym`#=)Sx)6bs+Li;C9%Y1}7$7V|P1IoUD$
zrVPlq>MI%7)WYGv=|0=9n53GB9f9g1&R?GU>--qnA|1ZN89v?ZGN*-<U#dX@y+>0f
z4rSwDij@RgfTjrG8ZT{;O{SFI<%mk!$Vhn$`AxHZ0NkcS{Ke~!;v`_}$aK;jXOUVF
z!Qntj&@2|AsgDLo*<hS<w9Pj)pHLql<H$Q#b_aZmdL1aU3O1&Yy$yCgKeZ)6TZ?Is
z1qM|w(5*yixy4Wt_tx_OTYxuyA3%(_00?v+`@v+Eg(HS7w8_H4YPOELz|pTS!~P{a
zjQA>JJ{6OgY0wX}sb&@w#jv?R*$4XrTQ`oWo+-6q{T3}n6eAr_+gUss6Pd}4oSRSe
zF?G7*<ic8F#f>*!H(E!o*73t&)=mO3IGzRLNj&wZA>d>l`J6^~WZr`4Ugn-GmAs)b
zN6zL9HRs{W?uj3Z_()#Esf5|M0lEPhN+_rKu6=sAPvpD7<F9&`@ik7HQGLUr{_JK+
z%LLB~S=8kx%{gI9u_21xC8$sWL@~Rh4JpenSLce#h%1QXJX?Dy23_9YGQW37(KSe*
zEHaB2c%@54!1h(PDk3K43KdONHq^-SRjWOnHQe5@Uo5UO(xzytXG?gYRwt-_Ez~HW
zZv5YzR*cuvD|4r{M1=-gj;4Dp{nP~HYYO72eeR|vA28LgYl6~cQbI(P7?o1m(5#rY
zX%a+E(5hs%HA>xJ@&m6cc5EPpp8IG{_z%3TR%U^0*J#?2xMVqFeu#=`46i7W7OyUt
zkO$awhEQ01)KgV(#30P>hlx_1`F-b9=4gb3GHNvow|R((%~(*i!P)1H%vfl$`#FW3
zv;WKbo}**cDU{3YJ`o^^{=28F5e-NS3Dn?jiz&3qX^iw_-W#pDX=Nok`Ai&VX~Q@%
z=jb9`K5A{{1vl>~;KM8me>Jwes_{C>h%d`dJZi%C;XfA@x|kfc59i~LvniX_CLkLI
zgJ4kQ6&p$4xIbew3d?kAIoW5MMT>N~e?WX$24w}^|D=^cjnTD#Lylx<89pBc$|P8T
z<O%*$X+?wH)KQ(Xj2il6;}|E7=4{|E$Ce!LwhCR#MCBJy>gH}jF#u$%QZ2Hb|5v*u
ze*Ju*PqF_m`dGD&Uf)9-OX5F0-h_7<|KF!uPrv&Aeu>Y$dH&v;+i%I~&s(|&SKj;d
z<1O8v1MeMucO5;rwcqY%c0#FJEMHxKbw_XA(mi_We!i2g_RcMN3;c6S_vo67FG}~~
zm#eCkKHn)9J#tI;;gM^&<CgB~j_dZtE#1x+cd;XGX>~{3RlIOZD|q3q;(}XR!3B49
z|J%|s|J#MmxBu!r>+9$KKE?8%=}0{3*Td+}Z7h-hHlIAp#DCu2{C@ju{Fg8CnM?yr
z;q>>tw~Zf~z1C3&xbLB)MEH9t_!yv@ITiWtH~#XeGz!l#RTQQ_)vrHoz|)d=q4Qhy
zLLQbTA1<u->5or}*h-}%*xq+MgZ4`Ma1@`0WPiOwccPv71hcNv9jS8sFa5~res;XS
z1E>B^*iMwY>fcKz;(@HemJY*n_*Fan?l&IFC$Ba#o5c5Zu~da}BUB~TM*Zo{WETGq
z<9@~KA2l3roAvSFv)fp_{+~U2`u$ce{_oST=f5xVdH>D(SMzW*@H!M3{ns)EeouBb
zHfB@*3Miu=*5m2LhP5TsC(%V^rIHnp>DNhDk6NcOnvV@fXbnc9Jf^WvRLJ##I!uiH
z1ka1-Q$Olo*1b*;c<-;!BYiV%@&ZKk`8ma-x7vfg1i=QEX6rSCC~dQ;ni*9{6_Ach
z*~Qi?zi%A3Hb4RchLOP0;wEj_KM!joI7ChHXnX@aBHsAhRTy0F&fq+Rj<*j+yK3x}
z`ucjQ^sVxbES28y3kp5qjl(D$`*`3A``(`NK~uTORL|bi;fLFY<{ABAyixHmCdE1Q
z7LFh-ie_N}JP-Ol9gk;nGcp+H5)_D1F;HxTl9%>lGKQFy<oHWrC2&*-13+P)FX7DS
zje@IS<guA&4chw<cz`aPJvh?`6n|mtf52*`@w|UYmEbW~gVS}C+WbIIE-pBB!}$#z
z=u{W!1bwbd<uEMN2>piP*cW`9jKV(J1%#xhW?PwnZiD%xh>`rE7Ut`l_&7{F;>not
z{F<<WTb1J@E}H`2V>mFwTqIQ-HxvmtglEa87dIY&Oz42>6V?YoKb}uU=}9v1S{rSS
zeF0~sS&1ea4R8Iisyhh8vX*-8CuoQ;Pk^*W;q1n=R>1els7@bk!^lSI2v*M=%`R<(
z4B_NTB$alX3=B0DQV0k^3$I7k9n=zk7zip;%1C1GCZ1ETgs$ii??*SRnbB$ZUhaBZ
z^=%9wQNrjeil9?WdgJ+M76QtUY?3<0Xql2t7|!xKDz7i6afHcU;QczAo2~oV=UOkZ
zZjF!LLDS!U>zz(6rkr&GDDsS0!dXel2_F3hLY;o#u@A#(Lg^u3AJmKh$nA|1FmREv
zz=Em*SQbF4F|sMP+*FAps@^zGX3!zE49KSL<AjWRaGlT{$2<y2LxY1zg3+*sRP9I1
zRIn+31PF&6XMpJ`C|E3IWf^#9$sjpXSgn$cB47s1YzVjWiI5sXKH;7ph}Wp<BDBce
zdcQ{xM)Ae3Wz-A2ZXUK@!-ii01okjy$d2bVki<~{JI6%|Wv{D1&%@vvy(P|p2w5L<
z>0cp*29f6Gz)A=eXeu}orCXxxgU(SC1&GGju{2GAkOtw@>Z~lzcsvO)vPr#1liPZG
z42R;zQ5U-SDl-MV63;g4TTkj+XI|}PI{WM1nRzpF2K@%~UdPBEN#6ymhsTw8<uiRv
zgS_^vN?kdVYnwAbl7iM|=fFC0%XltO2^pN<m~Oc2qRJ;jRjDeIU_c}E1t&UFo_Lim
zpEiDi<liP6W4vXO;$)cHm`?qhGcSs-C7{h2n|+)SQ^8vyAn-Hb<7doifDMd-=mO>e
zRulAlMry`o*v8m7GK=__kPo<jT>prur&;(|D!rPIKF}Cx_1DhvCpU(TCJFBhwJlWE
zT~P0*{OIiPuzmEp_qOrV8EIc(G$qBB*cOa<2yd%sD+L=MvOTS1JZW~0wJwi6ro49K
zJ>IUJ!xjb0ZYJttUS?<ye@^D`s1J>=gQ?6PW;3U508V(}m@`m^!JJV!!Lc$89|RGs
zBwoa{ufl5zx#Y1&L#cF{1VZz&I*{0LsHB!OKzdjHXdX~pDztm5duX%E@t$aFfU+fB
zHx~6P*Fnd}gm%9%>3z@9Y8$WSkvHR#W81iCFpjVAayA^6R0Z<qQjx3a_BhL5dA+^Z
ztpC+wvGiMn9seJw4~9MB(w~oT_?Jo+ie&Hhaf)Vj?+sgQRSl8~K8Dnl5+P|$d|uU8
z28S_?$%j4c0;o5PXkVc?27pE013m-+86%D{9~@F`DQ$wbAK1|qSlGq5`y%;RY-9aQ
zgCn0RG^%D*G@uM8f#w<C5M=}Fsc$iO+H)@{t{6H$3TuT^C5cVf@$>`HEhD&NZ+Wnv
z#zf#4u!>r+-xC32L@oG_+F>?56sADIS7emx*8LpsPiA~QFxV-T&d$#I)@8Qxa#uF%
zhACn=VOw$(A1co!mb8>6Uga?6HDl|*n)7E>uU@aK+Q@DVZdO(x;RzIhz9Ck=)sB$3
zba0OK0ME?6p5c_rqELPcu;k*Jgh8|S0iu?Y5gLw+RMqD1UB)926KO_?Q~HL9E)$v!
zPDRY4nMQxjS#SYM@eJ4%u-Y&f4Yd3i#Zm2_!8B$zYFqz$v_4AOD3&_F?J*Dp2u+=l
z{|Ql`&&IaISwuq9M8?MEC2izi_uir`5=J~1^jexq6hjy?C*+>3ualu#vc3)?galq`
z42e@uZ)A}v2QT=_av?9*%-o<T$t$<iM}s;7Z=ok9DJ2AXpJcKy;Z<zo2U$}x?;{@@
z&PO{g`t2+821UbbTif5)X-TeCy=RZV|0~cI*+DDcQF1{ipFPVv)-<dUAGb9^2RgC+
z60KFG630x`wkR7MlTA?WHds;M_Iz}zk<j|$YNg!9e$lqzXgNiTVVy;^MpmXFs=`AY
z8T_C$Uti~?)5)BCXaNb!NRaD-_(SF|fc`K^=0SQ!QuC?E52a<IVIn<?kwDebnaK&x
zWP{c#m8B8iW5R<iaU70(Vu6f`IvSVrW{JKM2_03()lxXqtD4T8xIyY!$5ViwYvw?L
zJ2bLyb^!)(Jb${Tm<bL<#kGOO`RC+}R_b&TlRh9_N6M(2p;p!1Gs;u5sqFiu0g6jw
z41q@)1(u^?_Niewx9cf-M)Kw@{e6cF0vC?r-V+}-7rF1HGaEOPu))3VEiJ7-pPw0H
z<;7h>M8ed>7aUYk*u^9!EMN<1-{~~0Lpl1XNFoDO@h3~4GvaeK;;JXv4l4YcEr<~b
zE$kXd=_5G%DDIqqY$7LE88l*G5Tbz|N`h%@Op>wDRSz1!!dOS)Obt_ulzPtqP;gA6
zl}MP8(^Na63uQXSB@@3-=P8tziDXn$xdZdeB(?;2`VDU}I9HLbw>rW=vf24_!c;Q8
z!N_$ct<Y*eO$>Dgle^dlQ&AHBtz|0voYHg{I}&3R<BF#27D}N0e?CJZBI48=Row5-
zry@~XO~P!QA&)&HFW4;8*Xv9I2?%FFC%iK52D0hkE|qRY6`T?>|43cew0D^a4rW56
zMAWum990-nx)D(`^GV4kcSd7>7e+CI;uy<Q@X5?CgFh0zcmZITM)Q0iBE}g$&y3eB
zWgL(dA(Cnm{ZG6PD7ccl7!)mW>{E7N+2I+-qs}&-a@W_-*!J|Kd3^YDuhVUGPdjJp
z>+EI7adFkG@_+_v`E!O$ZiAV<JP~Fnf`LzD5De1&9m>~UqBNp>WV#tX7_JBdIcnW8
z3Ubyn2C-lik&<w_+M}_c=@8Cm6l;?XS`MVSdV=@<ubU?;AykWh+!-Yc@_KM1f}-Hl
zN1;S&DZ)W?5`B?tKK|qE=27c#wK-p3kHQg1b>e=Ws^p@W^vo1fm-^^x25lCOUK=en
zJUZT&8RZp|mNe&K)-a*C#Q!RSLfe?1t$veof_ratI+~NF3zg68xS8m?icEQrx)e|8
zHX}2KsxEMXCY^ZY!6I0`%^bv)T+aUjpOV*R#(x$1*>>O8>%cyOkM;Vm8lfzqqurEn
zd?bg674kkRj}lVjsi48k^hIS%MtO?qJWkchq`A~;Wj@;@M?Ir*XF^X%y{zX(p6MrI
zUIyYN22JMO)jXK^=ka`IZ`4YQsQ|yXbv(|?A~9dwpeh^ZqxgJ-ubVcoGO9iuWU}8r
zeRbGeZ6yuj`S~cQO@J|nqy!m`VxQC~BvuJ2nFOsjMxh%&FL<8O8ISdnRdc>Yj8V;F
zxmgVR5VAX#sa<6Ms@*=cS8E)P0)UAA+8aZ1(Prvj&`s4f&6z|UtVAsAp4jr8ZBmcU
zww#ObZR6PNOvHqjs_$4E8b(+CG^8jEVxLKddeDx~2K(nM0bGF?l3%XoK%hO(IE(ls
z$ADaW6^tYZgo8(jx2bVsro*aZ0|3YDqmxNCyRKn^G(Cx<BoKu|;KPalfKyuiAb$SW
zJW!oK4COWfN5HZA$%GQu6RuBlBlC0cWdNy)2wD4_HS;pNPUe1m+Ii#ZxWuv`GQ0?)
zU`n?W*cb>(0i)*pMhVRd{m36O<2L3{D=^S8kyL5d$V$%jG<wG2Qwk@kw1x64br<F&
zN$^Ij9MmuB-kJP7qr?GcI8CDvZ&S`HReg;FvSo}0#O!R0t=2MxD6l8~4F&RqBS$bA
zI=7W>_r!%VRtn9hL~{0Yd1tr`h}q(TiU!OG#=*?5(F8O9^X+xnYb2?C?6dl2{TZ`r
zX6A$w(FKq!37Dm#Jr_@Cy*@g9YjFkPL1;f5B-mN;!k(UoGw~G$26KUjbh^yMP%%1?
zv?=A7t54RZ<`5C8beA%{^r#}Tv||K6Hcwtz{Rhr?4y<>ao?sPbS@S8w5+PgVV^qe!
zrmeU+0O_Qrf*eCs-3~OfrioC?G*kMD&jT_{q1V|*xsjRr*B+f+kZ#8Veu#ILgZMhC
zkWoAzM$%IQDp3tN(mTs)RV!zj_ti_8!~j}BL-T`L8d&0dra>@tc@7JM=}Y4Jlw=|D
zphRlGVOw$porh<JSV>9@#ZC$Hv$%wf@M@f&>w{LAwLa|qPwMmO7$lK&r|HMj>703+
zgm6RDtgpAwsU5h{YzIVJItk9Fq!3V7)y6eMS(%JL4-(z9Isuom*Uw4~C5o*v?4F5v
zmc%uOisl^p&-mg2i?UWABzP=mYOxQ)u^~d|6Xc<)k3AoCtvxG}dWny^$Qs`TB*|$#
z9O~Cb{)KT7&Dz9acmX^JZ(m`)hI6PMD2yaZGMD>hk?{7gJ2?4pJjP3if%aOYNzk*V
zPTID+fN=p4sdKI9IqcZQId68>W!S32a6E=mc(roFAv1UbNaFs7V5YcvB=bn}!$`*l
zWnWPc%;`SB&?jSqb+?MtBfZN*6bx-enSJ!<y*PIjK`$HAi>otp^m+9v-TBj9w1qm7
zb&*4u_*&1xc4zYe)||O=S%*hg>XCe%Q*b6gvxZ~awry?fe6ekNV`pRA&c?QF+qP}%
z?ElxfI9I1?E@rCccBZ=f?e}RgpugrJp0*V2Yw0eRQtTGyP$_m5rpl3_T32B=)zgnL
z<#ulAg#eByTAoA?n+zaf8?=5kAe3m|l1^?a7eO0~XdBT)4n*~YQlp7j|DK_DImLBR
zs4`!Uu9Ir7E2sE_^3K(-Q}HU`t-S;XU9(bck8w~Q#llgA0y)Tpd$Xe-B{!;r#lyrk
zRg|c^!ub&&<^m~m8a@O{3)^8g1Lif+yj^E({Sqxj7qHCJ`bw;2A#El6)OMahe?WcS
zJYMrSwPjar<t`c8Q-#I%p`R0cmuG5UPDb9~vZJNy+ALvc|K+JLgX&4W`-p@92aJ+A
zJ=gZIvgw?N`bSE9f{v_$*rrD#3zuOIQ~E^%$K~zoMOId8^0XE+$nlvPa{Xg__}>|y
z^)cZTA4PpYpj;}TJ^#pTauGlo>{ANks|U%-ePKOm!YCi41fb3oWaiFBin7nTOaf>F
z_Dm2#8Sw(|Ok4}(8y0Z8Wd+r#;TBPKqZaiFZP)3jysydk;mtvc*avlW*?2N`ktrxu
zfn8z$*#(B*pFJ%%w%9AQFaJ!h#B`1-2${-8wC53RGcHke2VFPYz&e!*jK|O~NS~P2
zv*TL~iG|vx0kP1bwJQciI{G_sQOeE8h_N-pfu`UACgSIWI)fB1*tXEp`es%6*O;(U
zUua0N>@B1$p={zfPkAkwQ;)U?ZG|gD89o0rJd+2-g5>gNCxMMjFTrjIS{a0sAfkfj
z{<Row^XX>py9IG;LK+QhJ^6}Vp{xE?|I6?zxHx>Z^<7A$lB~yywWIU&#Ih?uCexst
zg?S9@O-agUn1e}0IT?mGe7T?$si9JCu8(}W97Q?ORrk<GIbQM#Hl2FTSQ6H+N^j9)
z{zJYVS#ExSVFSSupyR5Vi2WSLKy&P9+joD?3*ES^rn@*Qp5|D;TOg0w-D;_~kRHe2
zx6q_G9AsONZewP2Ofr!HW|xG{g*N9JY@dFALk))4S)GOf%I0rmci(wPq~`LI(j~2@
z^2m<4G=!FSiehxA<UwS{V8KLGiAf5?(NT2yCc8GU3BG*+e%n|YZ3B1mFJy%eR}H3T
zGle3vVnN8Rc64bA$w~F1tWuW^PR`#(%1%+oF~+edsv21CD@`s+qWW{{plEHQ;2(g#
zLqp>*%#ousp7aRQ2%}UKB&`UiyP^=80<P}WM=~K7Xyoc-O$+>e(FwD(ENsIi6F~1!
zWGGHXL;=ZSQg2)a;HpnjOT6WqVb`Y4TWbf~A*G1tBP*)U=XlNw7LTi}!jkyqaygI`
zhaB5I{ty`w-KIWw53*D1A7#j_Go_m^jUrkdP7%MLkdCrpLwQJ+w({Gmr}U(D)`l?6
zB95x&nkvdsxvx^<5f53KmTj8%@gUK)rOUi@jb0{GL(TQ#cuAaq;O*7Q03NL&y!|l6
zDHa{Km9(Kg2&;hFukbCC$(6xlxnx+&3StWPo{Yd@GdP7u#!zOcoMVxMeP!O-3uv6h
zQ7&^d55$P{m=2eZBcXDs0Hp>F5#&%#Ga3$;bjV_c@KvhRu0et4<hOxV$(%|i+&^X6
zm@yymnkWC4aurJ4ivnlsydD>gk|5uiegG3w8DhY{6fqK>Mztp^S|S;RL7^JL_9Eke
z>m6w`E_d-Kw4{$~O~I6d<|+9SSCyBJqj18eb6o?0DW<dEVOfMPQ^T<-X)xt*$~S)(
z$JAtO%bIh_%&c;Hx~@jabDMmDKPgqSoWxfcU!mE@F<OL^(8%@FjOS^d*1=-DQf2~7
z_DM~S+v--Pk#Khx$AW-?u3&JRoize{95N%%w0z(qc$L0QCXYm^6<)7d&a9c<Vw!43
zJbi<OF<IzR!+hO&F6-XtLu|stfgN_J(q+G7k!e~>zc`KZVr>@qyfUWDCl{-wJZS(B
zZI#(vO!QYq^I7_+byzA~%ro0)6n+^+x_JlitU|Y3co<r*6Hbvb$x!%k=5MPfN@pdp
z>{kJpixrzzB1fgs1$lr#CU?Q{(o)x~3PJhG!P`M%=W4Z5lbOZP@Bj)TFVDv5h@0)l
z^>g8w?f0^bzpajjoXln;{a5yGw+2!`zD9M4A4x^(R`cTu2gj~t!6QW^WI#HHawy6#
zH^Fj19szArk+>qbO~Ptlf;P+WX)WK^uyj%hJ;Aaai8{3R*5a79vf-#P`h-nonx)mE
zlzp$8c0ITH(-xynDM{2Gba!dZL=%<&iz$DwZw528ppj=M$MCPny%|fvk%h66mf`rW
z1RDfgK?V(Funv@$vy`cZdIiOWoo;)n{eWdgZU$J?rEj$?{z68narTT68|2vndmIl6
zLT4ZEY)6Xx3U)uQ`$p`6RQ6TYoLkZPR6%^Z6yxn*1&}0uZoLmq-nzM7h1)Xvv2zoW
zb2ByBi~^D~I;mstTe&NVMp@gK*c6yo3s1$u%b)Y@@Kq&ft>k47Ro~O&pb*HA_q@%$
z$8ctYR4xjdDOgrVXe&ay$ECYyA!BhR10Stj)$DUNxUaIp?tr}h^DJ6St)h?04HRV~
zP3l&Ay(Hjj>yE%TX9j>vCA~*AzG#hT6V^YS)n60LXtK)4CAC3F$<@cTz)dZtt6!&<
z+HOo+ik@6!KBSVHlGXDMk5gIe{Fc;B>@ZoXO)i2?aG;Q<ggvd_81cd?W0SGR7Ao<d
zkt6lM2n~+MT2Ul&<3-Wo(tExq7XWQPtNk45!QY!AevM+er7VLYjUnSyOOi70m_fKq
z*(uQmgX;(?wQ|zG9*TgEy33~Jt2%g%Lo)~+_UnZ)gNSEmSSwFp!`{t0ZZwv86zt8@
zjqg71a#sB`_6xjsd1@6Uy%2BJIzj78?q4o?@D{4VWRl|B!)N!}j9d6;-b<r3-sC3G
zE4$Jn35%x&X)6}y`>#BhC1?Hd$~Wb(wUcuY+m$r~4u(Ek{hsT@j|s$_+cZj+W9uRL
zX_Eo*Bxh+P$JcKZub#yCWEZfLmI~d%Wsxlrf#%dc<^2$|^{{>V;OkK&RZ?1c|E5Pw
zq|C3$NtaxMpEJ-WNh50$aHRT`7pSh02d;&Ycld`#eU8HhOC8DLq5c}U#YE-N$+QBq
z|0;1=@QKK#XUvn^9zg-`=W=8pBVl3G;O<(M#y4F(NAyl>v#fW301c@kC;*+MnU5y`
z`sSfV;v(p8SE7)F3QDxG0BhkGng~|dC5{?H1M-w$rU^j-j_<N(1`;bH0t)WlnHENW
zv9UEv;6#zKN$!jV7F&)c%(72sUC2xo{^V#Pk*e6&cM?fXVER>^@LX(hoW1A61S)<}
zoc-7RMz@9i@;xH=8gbzYEnIT)F)1?9@>AqO$y(x5DQLf6Qi2!RBmEMCYLGHNlceYO
zW%%H47ZU1RZh=H}JbuIX^KomarXz-_L~c-X;p*aWo^HMcwHPCH3I;LqH9~Glu|f4}
zI*0@s?T+OPPlfPQVSwac_4V31@v7l?a)nog)Wz<3z5!{&t;F~pdD$y8Emip-u&e3J
z>2m74!%s}9JyCI0Uufep8Uv6FRm;wI`%YH(@f0s}6GTT}R#=r$5L0w2^;xztbA)#-
z1BAcq?q#{m4ctmX<xTXT#h00TykSZ-mvjd6=jqf<;Gp30v+et~g{d9UgQe7$QGcRy
z0t(YsJPCIi0(s&Xzz{FYtkir}k-tgioW=Jv+J2Y?0`@JuByGTJtd)CU>ek7+-+Xjg
za+0G!$_YS)XY6AdMdGREuOzfM6zs>bylOA~w0_bbx}B;i53V)Tl8)|$h*=w@QuwjY
z12McjvWha0)=lY}ssxod$t(9141=i_L8Wbs;;XVF@un4QBuUR17x2ey%0wpuAA`sU
zMvEgW_s3&*vv01(eEg8F`|$Mg>5&2RRY=LzT$vf*<-lZX$u`>qFQzn-%4z_(quDj4
z`K?&IETSd5&|(jID?UImm)UtUx&<oI>>x0{;u)9H(>AO~jqFS|0S#(I3chXO5FID_
z?mZ6^rSC~q@petpDDfIrP17~};JF19<-<cJ8#iUg{VfE?vjEKk75}3{7^aUr`Oxpk
zJ$Mu60q%Nd>Ld%2F9ht#eEf+`-i0d>5__tLzigcv(4y<ybXs^|%(IUf@eFt8MGHZ)
z!BUGHbgc$1@&~x&NA;^iEAEb;#DT7w*V;1xfuNeoRx^HwF>7=wv1xIp)3D^aMHD($
zVk<j{nK2$5(5*s;C=^4ndFo*8Gx{7h)VOGX#aT3^vJxUvTOtxTet#q9I2L?M9M_&|
zz;m}nr|$qHSDG|5cc4F+u*$PEE?TcdlQs8owh;YxQ)9;-xps6KYoSdbQx-Ns)9Pxj
zz4F~V7=^aTRuW(D?Y7~s-xkz(Gb2TdpF`J0EO;-CK){{B3loOxjO4YMbnrL7Z<o^$
zP}~tyN`CoNR5~}!!&|i_Wu(sOdSSDN)Q*4!!bGZYC6biDbgoN_%UzKh$FL4tB*J9=
zxlNylNrkLBAk#$6F33Uo(59L%^D0K+w*?&$9U)#wEvwt%?K>4q6UB2)h9v}z+|7xa
zc7b?G+Y)A^tbduMSma6;JV#p&855Y{UPV)Ty99!41BStVuN^}vP8PHlTL@&JT;?r=
zNEYv;f=7LC{`w)X_hOIT7vn3l`+1Ujs+s8y?U5hziHNF5YVwas?Hvn~3A6G#-Zf^1
zt#TA4Tv)1ee4Rvz(zvR3N3u35L&+|%6GEM0ah#L2$jI9j$R3EkHk1JGFr`y2lvC0v
zU7<-T*rdx5@yCYAhB;`C;06>>=3Dn7n0FBiJvS~~0?%$$p(IvTFXn(Di*Mool|+-5
zJWT^~Df(8mnGzZiE(U?KEu0K<VG%MV#S?wCR(Qe_*}V=VDqw-g?(<)c61i%SQh#<p
zd06AWv=2+J##<1fw~PhZg^)46V*_i3q!UW@AG<dkOT<80l{Fa(G)B!OIuA8si4*53
z%k;+(PAdd$)TPKw4jn8`yM^k5zP1dxgLMH%wkDDdHh5P{)>KATXI!~Qv^>2HkUTc`
zqw98-s?;V3o`cl8>}_Vz02T7_!Ef4OQE^TPmtCyCg|6vh{RPGn+yemG8jCA%&7fi-
zk+F)b6P4%Kij!4&hcKKPZ&k4yJFpyc@TexW8byfXbZ24{wh^iB6axHvi|T&o(0bmK
zsZ6ZA;X785h+?-lT--d4OzqtB;BoMxePUUlmN-(uj)`SPmGS@5TwS7Eb=$bMS{S(^
zd!j!WdaPkb6nrF!x}9349oKH9o-6yw9P26yQvRr3;$F^NMng*jqUj1!UgSq2(_dTz
zQQ=-&xt%UKKdj@$uEl@>Pftn;uJh>8w0>e_ybgZk=E=<`^th0gq8FNVunHltrY1I#
zFe3e;;?z7<_GZAPrT~-Ez(qAx1L@V3NpX~vHAdmznyjML%rln^QXH)^+{2wRDiIcr
z2fF5@dyyP7&wSEr2fBoBG*^R31lf%kagHPJX}H9MP60-#4I2`}jJ~|XDMRZ~u8;uY
zea(*YDD9+Czx2y^`BW;0Y7z|dOxc*c_$beWb3ASPA}|WFBC0sjWMCq&FQ;?N5sKDS
zz>Q4m%?iqjMTF}gaRHR)91}y!Fu%BdK|fEfg$*o1-nf}j#t|HmuOljGNovC=_+N}-
z<LCs470r{HgY#Juahho8l66YOUrtpwFM(%K|6;YTGn*>Fbw1D?knE=l0d8F87^!1T
z-Q3I2ZPcpoQY2;lnq*2_6a3@;YT6Jk6gRRT*!^niEhY#&Y;6gR5glaM0pO)p#Rnw{
zz0hWd?6VQLveX;|X=)YDT?~jkj6a0dv3I}A)|)kK1gjo-x(5u=KuXERw3Ld|QLoKu
zvHTF2Z#GCufOebHBhg@i2F9GLmac&1@LTK1WXW$T&93%(TF9tu<)R!kSLVG=9_Js3
zoWb-`QGuN>3jzEJIU_62VI`3=HWjiY&~*okL#NXmck7@U|LhA;$Ko!wMvBQK{OHn;
zcZ*<Srga3Bw#aBt%FcT5oGd9V#L4@Zzv9^9s>?Yrl1@H96<v^CYj%Ew9SS1Z=)oy%
zCgu-?))QO+y)B(*1)WCM{yR=Z$fJH5v@TeAd*NLipo<?N=|j-l#{#CbV1$tK>rOBA
z!npsIigsaE?z|RCM$85MC36s0Nv**n&#`uhKs!w+beMlDCS7inMvVqCiQK?h@rIJU
zQG(cZX)`K{Ub)xGz1LMgSUS0tCPgXHi|9axUJ8W+QhDX~nNxT_1XrdmWM8?4B1*dE
zYO5>$&LhRcVLjy*mAMR_OhqzpTXE`wVCFgghD|qYqehu-#t{MT)2#Ab_1PYxF=-8#
zuZ*>JeDdO+amcVL9?LS&uf_}gf+9t>1s&76jsSmBR4<NvF0s<!YLJWg4x=e$Glj(@
z{%zb8zxCX1tKqLk@f@B>^I@Be6L+qtMXg>VhMjrc)>qrN^mLYL%VfN&%SXv;LG(<i
z)z<wMrU$UBbSRfEr|v_h+VEJq8MW}mDz=eHr@_w|N30TwQ8O2Kux!>xcIn?hFc})3
zM$Ms8rknzI$7C`Y^YJcB`!Y2hZaTib9pnZ(raVzkg@RW_QE&!k%W13*_1<+YOa&Y5
zrj`&TFoS>W8Ts&mB4YEfO&gQM#J*jUavnwp)OB7SPBrIcOR$@&vn)B`yV8UrnVIAe
zWbW8tLQ)J}+g?seEit93c|fU35PaMPt)1;!0b00ojSE-2JRtsqY+^IS_~1f+silkJ
z=jWcumVvR`63@9Ko{TIt*Og<0f=-HYc>G4U^k~9K2j(LQR1Z_)i;W3cUuvy9|MsNp
zN_$p{r&<gYyPs@LD0o!@m>|0fFIvqk=jQVlBlFxAi>buBhAmrse$U(FIOs$%jaTbj
zlAeXLxQ3sv%e6_?KFy_SCEX8w_^i+pEOgP&j!0urHLy5XMZOEQ<MeFO3@&F&Bf63*
z$zc^HR%csT`IKnXVQuZ1Mxx-u(=*Mdu69!xA;5RykLzp}QuJSzhfvy^hH$_W078(^
zYm~>p&6@>`kD{UyRTpzxt_svzeENA6egSggU&Y_QBM!SQYI$<(c)y7;qP4J+wOQFt
zs;3xAoDPJim^c*+qm&L6hORy2J-^?NU@TKk0gkWEwO@~n@|>K7+byB;%``@iwDFx5
z_-(Ig4n=+yc1T!=kEY~t`92=M2VNN8tG&>2Ub^nr(r9v3yBfN`Ip7yp43^caRc(*s
z3WY|vx)0(1wo<H3Q!P^1tYr)W$Z1I_H=Q_M?xtp^&!@Mz!rVU&^%E?*?7Pl0YYGd_
zvp<tknLGmDM7s|3m)Jr(J(&v!@6uX)j78w*ab&p78S;&Yv4i{b-1SuO3dD-I*(ewd
zEUjq3I7muo{hRK3s~G@M5blI9C7uAwZzW8E#e-USFNh0Ds3{AkXva%nQ11o)vn0T@
z_tKF~_c`DxRf&PvWi2_b{a*TvK5OLjKgL2OCbSyf6v(uScVU9_`y!<o$y;*jpj{@Z
zA|%uro)4ydUnKHY(4Pv_p0UuUYS{Zf%OAO0!~LIsv@_*%`KOQn{P=#Xt$gO{A2tZl
ztb0v>-1rTJ@8)juBX`0sFO<J5=T0$c8!i$C59Gao6nrUM`OPDjovT*fynmJuE@dp-
zf?D#=t{)5uc>e=500Uu*V;P?IUxM{J6c?VT7Ye*}c0QIq^^7b&ZZa~iv~-x4nu~7J
z%lZhZ+hv#QJqh!;lx&ZN>-yIx3cb5YYcU>lv<yB4T+B@A)c}?K9feg|W$oHDCh*c?
zmiXB2Dy)|<c*}5`GLzR0yxWox_6kZqZhX1USjc(JqOIz3>u7w2GB-5yvVWR<4thKq
zyXrzu*qFFYIcj-P8?~QFY%z-Pve%683TmdB;49-%E{NPqySAX0j>0q=@_d{3<N#`0
z_Jt^6?(}QOkvc_vP$Wz~eziykmqeSqgd8JM4p2#cCN&6&ZMjo~{#X1=x*V!9e*Y)2
zBsF-Xvch8woubfFZs+OjiDi*dfQ@-W|K@Sp!FCUy@}?X07G%yHRh{zp;a@nz`)G(I
z&@UO&jCg84%rXhl5iH=S02}J4i%>{ve<UlpAlxI?Uuiz?qb(OZVRzy}@sFU#`^Uh^
zcJ*g5_*BYCe$uHIVWSd@ZiQI&U6JPpdf(kCZ*2s!Vr8I5h)d#f<Q4@kfLq<H)w)co
z#mksB&0}5T`g^79{dLsKh0rrj;T)Mq7+hdFyM?YlbT^-Yr@fEoNsa+|F2{TVA2jTg
zl%l=Ux!6TG`5BB?1MxunF*?d};)UjQ+MZTTIfspz<8;{X`a!RoeMrTaD58QtzW`}P
zd^A>V#mi|i;%yV}|JI+S_|TRE^<WrrSbh-_rAqWp!hi6&kMr1nL~+0_EiVO0f|GTx
zhCW99&xBHfo~1}9n|glU-ko35CW;=5ShU;toM6}BR>oZPQmC|W;%NIvkh7=F@ZT+s
zStn>a2}k0Zz(1Aq*3<(n1Eyy!R)Kclcw-K(Y)F9kPaQkBr7M;#@KHW<1Tb>lRfit0
z4K4=v1xr`h?Z4%`SBTN7Ct^Yu5IBv7l){DJ^Nw$XCP^1x173SY>?rQHr;0-~S483k
z(Jw!*OSOc3h_kbCS?Dg<1-&J3=bM4~&XQuKL~hyrscAJOyX2I=sNKVvpOtxWjB67K
zaJr83P7|Cxe10<1A~!3xc_{j$%>ww3X3NwFCvAMsj7f#JXY5-tH2YbB3Jsy7&+a>S
z{&1fCZRMKTrH?qss@B1yRAR1#S8FJRvb9-dphXSs0gI@!S-k_M$aL8;P0LtMl+Z@k
z`p8Dy8}#bmj%{5zdxQf^kN(?q6lj%6RQ_)Y&jGnPZ;J1MIbPI9B5t7|pin`q-`z$b
z-}CPKu4c9&w8w_uJEtm=zgyvIE|JD%h3w$%mXB{@C0j{}+CA!Lxsy`(a&0gNA&7|Q
znnm=?EEzmi1{2e5RwukuZO@|}WuE)^$q0LL4s|m>3ZyBu7PUwg`l!N<L73P#hj<#T
zvjf4btxXp`YQnPvr<D<FRYeSa<ya^*Fg9$bELgltKGmSvb#s{q-CEvUZ|~UGEvY57
zwo4#r#!%?0?tXrQtqgppjP7hZgtA_7z3U0)vcU32c6Tu3c`P4@@sO#sa||}>YCWk3
zt+KqJY?6hQ7|rGt{NZFU*z;8?OqiZwAYDQlRzG#^gpu{7z3pM`{+f1#_-xx1TGoYM
z!ovUkAzAdB38hUwxbI5=UV7DyC<FMspKWMVWP56hB;=NlCgH>*@>Mrx#b>^rMC%=<
z{#65jU`|t=_gp2tz}7w=<{)wbgERyYc6^GPAWou$3^IBgNpc&mh%rnR1?uW98VC*!
zC!d_9kTumDRalcm$(+~GB<P*UoM;*bA>%DAf)u!iq+E;zMDCO@{UNq2l=@INQx`RQ
z8`{|)&7>hE?6Ku;<5@UM_1=EudH8nfxL1JMy?&=umO_p6BXz{@YZK}7bFex>*bl2V
zceOQxBVdKUEmr%U%i{IJF!__hv-XkhB~$aRNdo)~-lUZI14@1HP~rh<3%y$THb1Gz
z;TIiB8p+q`Nwrt+?5WfEys}0<_i|Lw(j?{fLVr{+DGqdU=ZvFYk?G=?JB(w3lq~as
z`=H5H{^EwU`fQ<6oi_f+Ewg`cwH+m5aIG9W{(8HH>h3;-S_1394~%t*fspbTJ(F88
zHYC*(a4^4I%unU;c9Oob_OeYHVxH`PwmyyNnB+NGRNWb^%ivg!(4=FK>Oz=nVzv!d
z06ij4>=wfhZYf3PJ8~L0zU_mor?_bD%qe<+nvR>CL@!nfrLTdR*wJRfe15Y`ihA(+
zJ@-tC7Tg?e_NaTf1Pl$u!w4P9pKYiSo&M`%HhG7X6!lL&`nEW=^X@@HaY~&4!RQx>
zWp@Y}QW;Supdn;B-a#0A*M9Wh>|Hm*I6nxJdT9J2gV@_tD=S(#bcAs~{>YQB34>l7
z8!9h)60PbOw9ibn5mvR<Hd+_uh(4+^!>7YGJLrNj$H$1qE9{EgDDy+A)kIpv>v;<A
zNF(2e%?jH*_6p=vSOQyXut={0=H5SrFf#WeGORGATpw&T<4Yq-mh+J$!#W!P;-2}I
z-&S%#8ZIpDbJ1X!h92s~@wFrQ+%g1W*fh8s0iHdTuvt)$P*=DqPxbE@9uFs>huH7F
z7wTZ?^cHBtEqd2Q;&6!p7wo=DAbyJBMfFjKfHQ+Q&t=*RQ!*H?aFZk|Gh>{LqAwE=
z!4hq^sU*6h?|!43GThkT(tDKG^TIW;uIv?imIL-W@;f)C0-Z1p3=5CGi+yaeyB>l7
z`ns<Aq|G;m4yobb9ysW#5dK8kLm2P+oWsSn^MSAx{Hu=!H2Ec8mx;L(=WhEs{b-~;
z_co9-gXYWBGr_Dt1B6si>J8ZMF&Pez!kNY1s&rK;IjSdbE){<PqbYT#hpM>}s`+cM
zo%(&HX$Fz@Sg$nR%`xJDy*@o~{qgU@@kpjvrU<a+3#n=qGV2!=MefCG1_My=hu9xO
z7f6!>y;*|!w-ZEa`q75h8|GSpUl1wwqD{5WCrwL!k(S~F&mnRrW7~TucY?Ng2*U?v
zk0id>`3M2nGYK!FQY#RKyg#oC8JPoz7x^98i=VCy&!e=ZlBQmpOE20pzVuY4VftOr
z)%g<I;P`t-o49T1_`XTbD;M&15pN&B&plz*PB=9z&tlCMH+`TwhF=qw>Ee39Zpn+2
ze>puKErhhu9Bz2<{L;KDFoZ-!&oBwqQ`jAO;ol8Ogs5~(B{c*uK|b4+wG;^LN>8uO
zbzPReRk(oKYt<6nruWj{lWrNK8ztfLEc|XU=qDz)?o{KhA|1%x;EIQ<={S~+nh@n_
zBax^ZiD;=r;D^#=xwWv`R@2{SIbh<v&`f`t(@efzPh#!pEf5eH^gg1Se!<157X4Yp
z`qc~N8f1!wSjg$oGdBM~u1Nj4t<-~A1C)f@68WnJLpg_UGllFnkr*~Xz`+C)%UBo>
zoNGqv(B$>l9KCV>WZ^y>x?m<P;}9j*o_2cbzKv=X5v^9hnZcdvC!3PAi&ocCSUi1*
z<^4s6&Qk@p70&m&%FJ*G`n5#|`DeS8<NUD50$UOZUXq^*3%o^ko`z6AJDScS08BY;
zR6;vhtLHThaY&C!8z(-7w&_X?mG~u82}|y<Yc3#N0maQeiIa4~_uf2}HoS~N0&A&w
zw+abqmit$bg-fAYKniKZArOirkyKHF5lw$@@E7&Q(_`0~%c?|)&*GA70F}^dDH0u;
z!EIpq#CD-tttia$ndAL$ybY{vkkgjsghMv6<qhE{$(^Lu1%k7YGuuDLOmU(J;d#u<
z@gQ_XR(fu)9`F4dXHb}@;HeiN>I*-}R`u^>43fuFN-U8BU5dN%ODbib#c2xjD=;EU
z9*?t++*Zp2Dh`F_Ypu*lZH7)->2T=Ji;@;XD<m*-Jb;gGusfx`3KVeen#X7JvXIO~
z<I?UqT?wl{{k9quR4RqPze};`d{v~W^;ig0R+fKwUri(Gu*=-w=&ciDYgVy#I#Iwi
zV(AQGcNJZ(Is|^4rjZ()yn>(KAoietRM;1UrL6%Q(?&CqQWOsaIKGH+X)1)@EIt~q
zG@cgQiRF=cqQ}*f&3?(A*pbMlsf=B5^%v)!VAf?9{Lp0Vq+a_<?N@ipW?NT_qMZe0
z*PwS2573KJlv}Fi6Pgm;SA~saeC)@W_L6aER_xkUC%vo~6EeY|pt)?GS<>3-IEae`
zlu&??LOyqmhZKsng%@!eI?N5iv&|b<Pr}ap9L0A`ed@b}-~Spup=V>ss(HVEvI^DI
zG<<7%3nK#Uq&n%J5hCw$QVg;-m<A;Xl~tu}EiZL5E<w*t`Y#Ixct=<>%bas8%^cvx
zJI*Jnm_opaT*Z$KD!UfK@le?T-RgxKIv*_RTl>{rcCNsf)>u_nB7z$aG)+7zun+|_
z`-E}Zhp}|zQ5oe7iS|CJQDuC=zZa~J9s^V|&j+O804yTRT44OXhEe<D+;EoRXj&l9
zLrE%q<PhFi#Jqh>Vb)Dm?BRHx*NBH&JuqI75HZjBuNhMxL7gjB8`gMhMwRdz3Ukr%
z8Gi+Q(5dD}pTmjwxX=zgfGRre0B~Gcn8ge^BPBQd;7EH%b`?@oXbUL|=<V$t(Nwbm
z7)C-0oQbi9ldg0jmO)~NQuUTCW;B$jAb=_b=eP2aJ2Ri~nQHytetH-9;9@8=!NGB*
zlPWYmY8e_?_WN(|;w4=xQm#U$*-pKVTDkx&Wd+^E4Qw(qN6p~`ihZ#%Bg~x3qzwK{
z$>zsQCWU%)Kilnx6T)<r6Gap~1G0LRpTEtxO@f2P)J-5`I6w;SlJ{Q8^p|#S-(KU6
z!TH_7jI(zC<{sK`mn%f|v(Sdqz=_2je98KNTJ~-*Gn}#P3+ZXdzPzcN^U88@_W4RE
z@)gY_xQHwS$~_O0`(YeqJ;Q_`wLrPuFzsVz3~##=#`);<|1ow}mNUCUa|+RsPSUkR
zJJ#oX$5>vJ!i)81lY(dz!@2}dp0*~LjLvvAk${B1ycG<;e@vqFHj%ZLDP$_yt@iiE
zsb@Po0$ber$bIOy^L{Z$wt|QKS4B?{v+N2d>oB@w2WALm|JE$CT|1-*C?S6Cr@Op9
zKhsvM1hcRdmv{D&Yg5*2fD4}3%-V_Ud=dz*$&}$EP2VK`X{q=AFs|H?@vWv|l~Q@&
z(0iHQU*K+@o(JHKK0ft;U;G@z+yql~&47MxDKvbp+B<bl66@cIb;JQJ6;e}uu#`Of
zVv_k_GIEm6R8{KIlNWn9w83oq%}aw8GDSPPp}%`<!Yl=12+<U$ZM1?8BHuJwhA&F=
zRO8!c_N$auC7k>>B*=Jg%dhK}w{SIke7nVW-R*RqlAFM%rQy*Yo;}-|rD7;MQfHof
z@-BuU)$d`IUll;WDZ0GsoSq;)2LEImnY+Al%YUW3tQh4Q?=*$0^;#n1=6{5B+Mv2b
zm)6w#KpUVm?^}ofKjw^o0ieuSi~8tLudbq45F?ry&u?(=gu5|D8NCGT9I>GYCf0au
zG>(-I^u)EQ{VHJ8zrsKKR4~7iF``}2{3>;})IETf^0qVT8fTF_*idCIPDh3ft$W;R
z?YTlv|8-9?!#MjcS-L7-pO_wH&E)dl{92VwF-)6=4NmjUk(*a!+Q1!xej%k?x+|Rw
z+Z9i7<Lj-ItA2J|&Rt{<j`@Ix?EMEC_AfZ+g%NmWig(9<U_9E9u6@wMiKA2Z!}{&u
zFN(uKDPINN={0nw<}iM%8PRo#+h7Jkq*$WZDez%2FxI0!TU!bQIt;x}Z3evl$%V&*
z5k-Jeqe2n+mBh<ru+;ZAOj5-m-!A{&6zry0H&4FOuH7>Wj73xI>LMFp1G@BE**CJo
zFJauaIy0Luii$GvM6j#wQB9~@aXCgURWs$K#qZi*bt@g))D(%R#o6AbWv3sz(e~I+
zf1-g-cUu@qxqotFsykJ$xUALlxwvzMpQoP;o@0W|36qFiDs52RknQxDa@98Q>69>S
zjje=cf)z!Ve<oWLNV9CAM4~EJ?fi-Qmiw%J>b^W?8hy(<zY4&Mz*UH870bwMPFjA;
zwT19Lu24-Fb?$#AN@d90cG8QAN-cyo!*~ng_q5`u!KRF^gur!{YO0V+Nf_wK<Y?h?
zMU~U0#Ux}FMkCLf3*b1@(9x4>9t8>eO6a-;^}jo>?RpUrs|yv%kfk@ZZJW|GgB33#
zG3__0!n|gDmV^JJ<eP<>Ue7HEH=>c;WujXI?f|QToj~$7K`p$Nl!nfr@@7BYra}qh
zl67_%#++ta5M+{#7Cdeu#0cg+&wIs&`|&{;34CGH0^+-<mad5*B4DKqld6|7K+ZQ@
zFak{hlA#=O$!&(?-(+esr_3$4s}M~AzGe`%c*wI;TowiU5a#GsQ96qT0o>u7*B_}5
zX=aqm1yhNesZ(5Pf6tOb>m<#dY7Br9e`qdJF*xZcqqApr<6`FEp?A2#!EcZw)3ltR
zv+QC5rDBLIvfd}2Fqxu@EY^RT$7<(L$mByK@9zwiZOJu`YR9awDT(Azf~N|DaQ4s{
zsbbEe>u}1C?O?eY2p;``>xJdK6vG<3SqkoO?l$eRgrt4!iaWGh*^zq~+%8M{n{%^0
z%QQIozzeprdBO1#c^CnI!`44h5M~Uz+!?qmZ=d;!srEhpP|hCrXHHJHl_*kv*&7;N
z>fK7enwqM`ViA&IQ|+JgxDD6?`p!N+2@A^{NkJ*GT`EpHWb?>-as?SqLf3z>$wLCI
zqIVGQj1pcRj*pb^n}$-9DIY5{71Jf#W{o;HNj96L(yom?ZJMr41e)ARy;aPLJxJ=d
zGH@SeY&Hc(-m@B3Tmfm++w}<&UN&cil@<?OrJ=$L|4R|COE`0rk<Y^_2z>1}2JY=9
zM?3;|etxdH(FqBc?dfDV=WfKP!lFXB$m{)L2Y5i^hb*mt=D<nuO91|)=hrmd3lAcl
zIo2r2(Mfh)P(rjng-D`j>=*rhfBs;r{k1l4G2@7*!>U}!qlD~A>IoD;TgGZnHMFpu
zx_FQ~y~)5M;gSb$Gw;WdLn8YaqU2d2QEnNU2c8S|)MbKq013^hrAoR~jrs+j#afMu
z0ZrCi{aJ}^QHQtI>@ZTG_7t1?O4Jxl5ByoM^{;Q+DNUGO5&4thL#WvU*5Nr}CYsa}
zn2F6tZ@cJ>HJ|N|fn4+q05!W~B9BezsW9Fa`-_5U&zc0axCs(6KF&gIC@zz~Vtf_>
zvz)+~)p>*13aQFQQrRAn)Y@G^BpOck-K@DO0pKhxMdBSJENn9B$gM9nve3SQGUv_F
zrC7Y8;*YXae-ufE3L9j{ZOV%6q7QNK_~}RKA1)xv)rNayf|KCUvcx*Rz>8zJuFHln
z0_(V_h|Hn_u?cFSU{`6*3<3z~h1oA;(SKF<<q~#mkh)#+=7KAR%Dat$d?SUB+F9T9
zt*<r)5CuVn=Hh@!$+Y$63VYEc*YHakx+|aJ9p#rSBov_^ROE>r0%}O4kdn56_ds<J
zur_sdYxbg}^JI?zF@hV%J_s^Op1GvErAB!mPyz_#aS+0!<KNBjY!R3gzK$jD@|vcg
zv6sPo_4&Bj;1^%`P6lxNzjE^gmbl}CT{#UXDjV1x-?ghO7nJFn{LWAJD<ZU(SSXal
z3mOcE=$x)7MXMh8wIUEtN<~$}pDxwj@UDPv-s;Up3u8Is-2<>osU@#)C^+?5;lNrt
zS$3nQH_=}-fHcF@#Qy4SQqGJ6SG(8w9-5u%QKZcwJr)%|;}=Xuq8el+T814vz{wch
zrQl7(&fYZRX^klEUi$Wlg^0obQfUL3V)!e1nL@&Ddt6S&rdf<ET3v1tVx+DGf#H|x
z0kr(FrCURXUwIh1@AygI`N%E+d*jxSJ+`^uK0scyMl)FwY&bAqmi|5$d~Kx)-x(pU
z8?*(|tErbyiFZcF&PZA>vSI~^-|Nnyi-J_2$d){yyL2EXj6NKfo_};fJ~G1gVy}_Y
zNX95>gDjT09v)n9pfsc^nOR@;{I8#TK1DB7$}DoyzUi%KoI|TQUd=3Yj{9OkS3DxK
z*e22*i^Xdqzshv4%eRjsZisoytjy*_n?w!Dx8_Wa4jqOXl(E+FQNFjW6+yHTCoY#^
z%_C7%a{<Lve^8KBt8Dlkw>nCgu%HU)1R=@zMFY5sO!!r7Njn@Gk=88fUvkn2TkbiY
zz!11jj|t$kg~j1Jt5Aef=}1YY#9-Hn;^VbhF@;tVN9hHVGeIHtMS}<*dx(^5)%O8X
zU>$6+F*i5?+KyU+mQ|Bq!i@p)zy=nc80DoE?}6h)bJ5;ym#mc`*N{n<U<EkfgBK$Y
z5V>ALw(((z`%L{R_u7n9N0e=W8GV8WW!VRxy}m>&4CIFX#K<Q1==}2`rzN(UXn{6@
z%0VGS=pkUp92?_GMt4ikam;==WYbb_NBBA}^p!s?ryyu<vC8`t4nxxh72QUxHPFc}
zRL#M?4A!<LnfrMp6Y8Yf_Za1fjUoxtM@_j6OC2)6?rCgT?$9Vpz{IUxfmp#++3c}L
zi%D}WZZ<Q6^JvtP>gYfk(6~*UOb9_-=>IGR+V-RO67tP8D1;r(nrt&!A^Rp%aMR!z
zj0C);b*?2hf=UN0hII>SUss;u#(M9Q$+vIK1s@wSIVY$TBEt1%d+}8a7pQOvPvyZP
zup@bVlB|-GvNeyRAMY!<@!a8<SevPWrc?6P^(rylAsxgRWc;yOc3+WpzNR#X5C5dp
zr}EShCiu8K7{;TJ=%pTY#{BCp_Nfj5oq<bYM@vacB!0)J9utgIT|^okw~SG|uHzLH
zPh(kAr_JOhANHA$=jJR=vZ<xZ(aUCGWq(zchXN#9UY!%3KF6_%AcA7kwNSIH$vYX{
z;zP~3j;t048?3zLdK4t2=u{PhJTd?Vt3c5#^x8j;GGAHxH>bYn6=HkPZMNOD==UN+
zQ=#CWGt=LMgRQeSZE*w-O)zq*uq_7yMx+>sn$t*m2rb0a6-kQ-CaeS^AK!F-;!?u$
zEm}liAsym9D=LriD(L1oqY8!Br76O$izZ#%5RYp7Z73~4z;^};%9t@y>atE)r+0Pp
zvLUH+o7j}|(txmd0(ttQ`~(^Z7hUuhGbPx<6JMOa<L_0I{#1Bf2ffCtUw`S5$9^@7
z_c0L|2@L^iNztTJ<7<brAjPH<=LhVD<xTI(s3{!^vgkwQPWa-5MqM++r}CY@t)+`9
zot(;ZNN_(Vvo+m(fdzEkH<Dun3AhxuYfOIm>i?41(=(JQ*=D`2)t*)1>hRt13eJi6
zj9GNE0e#`1{khxO70IsY6U~hch!$d!;$RT*Z1#_8^7SCJHQ4@ZK9jTizqHl6i{(V~
znQ!BZvE}E668WATU$~>@-Hn5vTaKH8JJVcll(v(vkxy@esbko2dXJx-#|9x>lwsxE
z5X@9oM0U=N%*;PkwgZDIT`>af_vTo7T?Y~aztQ9<>R$R|%>>DQ25UhujdRho(729@
zV3(JRdwCE*H|1jY-FaHG1_+*v=3^fbG3nZMh95Wr2KeZqi(6sOZP8BAT!$aH$0%A6
zl`V!O;i^u<MVUmJlT<WQBNZ{Yhq<YJsV6=3?Y6xaLk$Mm5>y-8Qya%jJaA*h@0x6i
z0^_0;Yv;Mr%8*R;s_m0fW&T4cRq&LP<4pRBsNS4Dp!F_NfZP{fMJ$J#GM)l+F!wX&
zphI4q*AuGviYJWGT>b3|eo$E?si^Cphj5J2N4tQ#1beoa?MXTx48k7v@xXS0qq5mc
zE1hJ@yUG_}c^aF5_Cb>oVU8dgdqV|PMsgJRFk-SixxAp5#a~3-3+F(!gB0bS5vLmv
z=7O_Q2bl@hIcQT%6V@_v>VFP;x|s|>l1P)>-@C+->LsH2q@u)yTL>kiT=5dsl_DYS
z?cd_8idnHFblzc?%OLO;;J5r)UAMpXs__j;m9?+&`FxPNc*?APDfVgI;XV8R0i_3t
zW+ewr@}0{Y2Ll+rUZLUNG3`}mCFf25<rZs8)Kn1k-o~u!-qb!dF9jQIxuS0reY&@0
z=za8hZSbynfePT(XoXf?&nzAaRd@wW;R|}f-?Tc++g@c8aL9EYEF>PdhW_1qH89@#
zWz)FL@glS?5a8N%96MD|z2dO|G`B=x_pzn;00wCg{e<4fW5ce8&(X$>b>(|e*tRlc
zShVvD6h1p9vTHmt)rH|}`Mnr~%r56!4WePBepMj%@RKFX?S6B`xy_+BfHfgq3(DH)
z<~i>jiEmFxlr?=;A=k3Rcg4}Qa`nug*R{a=R@bz0$@_w^fiJviS)v&%-VSd=kO#E9
z%kKThW!;ka8|usg!Nn0E?unlE;O0l%D+FqFgIc{I!Dc3?_Hk$)6gm30tkm;nn@v#y
zM9{>2D-j~U02FHTB7;0nwby(FtI}=J+h^5ti+A06Ut6iU)7m8iJ*QI*a-y;I&JEt;
z4J}kY5yI!727+GQ(yD9Oe`WQjE;#$79|~SFe*xv*za)F1i!;E7-!=)b^Y4$Agcs`f
zTu|zEkN(=uoNu{hivk&mWIB&M?$y&LYY@U(VboU&BI)EoA4A$LUoTq|wWWQi{R(Uu
zYbH+(;ReZ6A$z|RjdAksW|>Yjs?Ce09;IO>*pEy8fv_PT=PAeuCl!vzdV3CLpeC(p
znoEfo)wAE{PS1(cr@wM_HY(B}wkEO$JrI51i;^J_c4(C99DZgBzGpK-MQDdG)|0j)
zV##Ok4$(zDLE-tHqpD1!a8^$cA%6COb=XpITX3estj27;U^84NR3^VXLt4j2PYQCG
zx4mgX?4r!-5+}hvi}HKJxq8;Vp&qhgc44`$*WDG99Gy8eL*bwu&ctP)ud+RVQf2Bg
zJTX@>@0S`E(o1+nOCg}kqDxP2Q*X(>Asgs?S$%sh1;?VcsGZ}xa+l9$G{mcI&gI^5
zaCE%!I+32Vx%e7-gGucBUfN1FTiIB5j_uswyKCOm$gAj}=Ty^c(j(07e)@L?R(l)Y
z@D#pKC#mn{_?gR;DC~@v1Ox0OWty6hPoZMX%6F-kK<a7ILDF*YM%C&TKy4&+V;mC4
zVPggqgkQ5GTCVuf7k9e2zwQqmTt%oqG}8>;q-{M>7I*~wB>R<sVY#{3!^hO`?2EnC
zstCsffDb8XWLhf79Xzt|!}lhMFD6Yp8Z@)rr+Y@hriM_|4Ui_ugVLUvalJ|=`*(m5
zp0Px-BBfGa>kdVpb;~d9Ht?B|4)cu4qBIw@LXoh!2EG}{vmMSE_45=gPNLvUvx_Fj
zr3XwnT$thi0z*#Dr|@T<;nM$j<js<m`X-lyeBxh|<z*DE@19*0il;+Y*Swc=JLSpW
z2k><1kq-^Ew@1`F)0F!L{?=6R5#k$DRaIfl1RbiLO#d5k?if+5%JT;;W>YY$h*``{
zG1GFJwp>|HBAfl7M;JL5>9AzKjXFzwALtCw$Mtx2JjA`xDQo+;6lHuJ+d}G#OmU#O
z`RATiXgB=D8OoM_dl#mlyz)p);+tQQ<QfxanMcpZ>K9y{P@M=_d0d2zg}(=I0+%*~
zy-*YjiuMKr=%oVtGX_^dlD{2HY$LAx8suUF7nIs`L%(P&ZG#>4j;E)7V2?@`T|1jn
zXOUPZ_)JOyF4+jCOf<{YdY?PWLITEzv*MOH&%Q?Y#rP)w0EbKpl0gOt8m|F#uLDA$
zIqqD(CI)h(`xTD@R`?V`eRHj`;Fe`4J*ji-7ElsP0D+~~?~b@Cwx#D|NA#RPgG^s+
z1-glvld?wRBoP5<^!##2RVFW_W0dlw35wPyn9eGdN)0$u8K~0$=r3dul+puqpnW-X
zl@r<y@TMWCxi<Je^IkQdU+UIZ*Eh<QKVqn^aD4v|vg)v%qCXvPuV-rFKObK&JAamb
zeB)!ae>$F4Xqa9s|KzyW1R9{dE%?6}Me%4MWhX#=L!&4yLOj%XuK(ZlQ{=g>BD-OE
z^Hsaz>$Q2R1<<;1(E9ujGPpVDazsr_z++671$G!3hk|yABBTd<_xYi`p$1P`2*`XW
zTJ2?;)PO7S{YY9F+<SmUhRKOHv;eSk=S{FSlWzcFoMsyYK101-@YbIz_X+QvOe?_E
zLMZF^Hjk=8K*QDv>tCR24F+UiJQ~He+UC#k`BIv>zv_N!>$~aQ+$L3$pVk?%?SeBh
zn}#|0j@=0TY1?7GGWO3!IvE9b3tP1|BY71S+c^8#+z<-G<#R1J6SF_}tP?r!zDwW)
z=gTAYwxF3$g0hxaMY<4=?27%|d4|R+6YqhJ*f(&<{B47fFCpe7*!Qa!<}VPaox!OD
zt(7p?hZjXPw<LX|gI3IId3}p7wh~C#=7WpPlgAhsx$K9byx1c{WHIm%j7#l-Qt8qx
z-z2d4YHLV_Zdq>{v0tD&Tz)uqX?B0nXqgIvs}60{M}wj!5Ip3P%y72lt^NZLY3h3H
zT#A`dA8@+K-(CZGq@-XbZ%JVJ<+~l4uMlOkSc&8uPV6jEoK}gjG;eH}!9+ZTW|S@%
z@lSNX-@!b&rrX4OpQ712MGQ|z>r>vOd=5O>N9w|w9BTKHPt~_Cwo`pmT=U!XKt8u1
zG%ao-DFwD@T0f<UkH=bgTv;|evex<qWFjZ!!l<24AS4*oBC0Rs{3ZXn$LZb(C*u{t
zwUFjp2)o9Ni*(pb%m%&QdL@S|u2w+@!y(hD;LK+8YO|&Uz7c@>jkBzEFmCoZ-wL})
zc*W6_v^Jx4CL$Wze69Q5!RI-<T;%#b?AuB^KfSvcNhi=!J*#FwM^H%q@|&<=By2is
z&GKIwYFK$jo~Bt7k0Z^22=oQ)HtWomnza2WEMW0|W^B+;jwGF47&Hy7`bIU6?2OC&
z(kNzrV+2?tdb$GQx&4)juJY8@F<iVFF(xATS0e;L;V6d5e#FT9GZE?Y!PFlsv5B5D
zbN_GqxXswN6O^x==Yy#d`G)6Q`Q}`or5~SgL_Mu5w|`JB`;P9jB`dvwjRy$M-qil?
zR@FR&GdxChQTPN_44)8)9Qm6O4Yc0I65m61hGJhuU^N{4_mf^eEybUT=ez&A{?t7y
zY6kS1nNbm5l?)qu28e44ehMmF@tK~2|EM^wSE{6*&7{$Sb?Lnso91Omp9}u{*rR6N
zkB7Qz71uE8=MSZJt28^uL9vdVZSP8^c!em^DZUkZ_LWoKN0|l&lkQ6WBKYjYlgUj$
zhQ;G8Mp@eBx&8K+*`kyXF&jIK4V?q>5AClr<Y*`Uexv9vjsWtXH1vC;UZ#7Ku{UaN
zAhTX65ntXD1v!kP>Fv)|XL#{MC5)*J)T>c4jMY1*(muA}LxYcO7jGtr?NW5CUN4__
zy<fzAARTkI!R<OF^6TMe^zrnq=>8OY0$2FL9B2)xGy&`Mln6gMwY^0?2@9wOc4S!d
z1o^<8Vg?~~e1<wAgEwr7=U+PJ-lJ;^?X%@$6>oX6>AO8W`qOdOm&b%ph{qc_BEk5x
z5q-0UYV19eLx)A!_1S`@p91dohu`iw$8)>*VMw2Mz--+cxUl2O8`$Z4^$jHMY4B~|
zw%{Sq@W!Uw6THKYU^DY8aXU6T(Xk~%B`H8lcC2N`wd?5+MK)c>p619=sjSSq=nVxO
z?kdqfCX;3d-DD{Gaog~rlvlKMV0<EV%|RVtsnURa7OH`6Gq^}<$~<B?Tb7Sk7~n9o
zv(ilVXa%xw|5IPd+ta{m7|b@{C$E<3rjxTBBNU#}jx?)}0W2K!1CFHUWm)ny1+wPZ
z3^%^qfZofytp{;@_Y7l@!>0*xyoQP!bp+gFd939!#TC5U70UhR_XM_^#QG*1i2;4a
zvCP#Z%&?~GaDyy^HDkE0C;Piyp07}#AWEb*Sw!m!g}*ljr_`cTjVwqRy<Gy;RkbVw
zxpaGuQN9dFgem!BX-!4`?)vTbkI2{pjtRe6*4Fd;?|@$-Yo6_T{;F-svHdi`RrSgB
zUAEtHbL~_T&ykzcs$(*Jlou;+Y_|fH(<Hi`@$Do1_Q4%@pK7uu*rkb1<>CrpUCOkY
z-{&Tk<>+W&H;aIjFP^t*EAXK@(<*N*$yaw6XC!{!Z+p2XS5@Nct$x05MKd2DkO;MT
zTeWGzuHOXMw3I7HADSGolP*pd9BSHZv6HI*-LS+?vNx1Q%cIl*2GPgw_2v{2HNDH+
zW8r|Cje@UT!g#?B{&c5JKn{2zIi~_^X)fwQSeP2F069yy1yKI%h}9eDZWj&S5e_<b
z2(NQQ1>p|e;=NCXdME!60J1<$zd?Bz=OWvFF85;L?GNAht!Dnft>0?r58V8%c2?g0
znfjO{xqR8Q&<dk)W^DbT*pX#w+4<C<RHg{00YHeE7lZjE!~Dc*(F`D%zA~#`Oylc+
z2GcmVe)2t(aJ0IhIl$TCdf7@m#O(N>ApDyx%Rh5vCpV7H2;4=TncNh2Cfl2<$rOlS
z=&mpv+ri|Xr|xL4k52b`y)3k)z%arak(7OTQRX;pWv*ZKwyWM_RzHzF@?Ba<O?xx7
zp@dNtD{+0Zs#yhkId-?z2hJ>}l4d4}l+0v`C~#f+6S}2{m#fVwk+Lz@_G=KX{i*RP
zZLdGhEQ&3gqLOVrmUY=nCZlkcE?u!SR@S0X)&f})9>N!Gbh+M-=i~`(^bi*xL7oPR
zw%2FzhaeKjjw-Ww6ki8Z_lRfld@`|KniGPz*m%2z|CQ6bE^^(^FE_Lja8KXFxrR(c
z`O}NU!W3@Jf(DG#muYS6Pq0{Sc?)Giw=?T8);(a|K?dGG;t(dv3@m6w9aJ;qsFQM-
ze6{TK>h>qxJ_@ae@iiL-8aZ}@kCQk_<A_q!do+fJ9o=mHt^Xl7iR1A>Jk7CNe=y)S
zjG1ml{pq2}<S42GJj@L1BpAn60s0$vCVt=K^p=p^z@4oFPqK8iZoEI9nUqDA{~s}P
zCYzD4$ihkN2j2M&-5$!QC)4<1>W|?S%0BRd?jt+#I6$+(#43Z;$mAsYKxnJ#tYf|h
zY-t#fFF9v4rW|Oh;RKBtXH=T9-edk{ei!J7`6PTLY~h0qVR#$_0_$&riSn)j%G(l9
z4ON@OFB2QRG0T;T2H;NyUp<fksEGKZ&!#EG7^S5!?ZLXF7*VG-)ZJ#MYcQ{Fkg(T)
zNzh2I?|(IzcWOjw-JXB7q5L2DDYpNVzr7?G)qsf&!;5-<49un;Mz?HZvHj=f=F{yb
zw*BY!_OmD3U+q7?#OLqFjlCZluQ3H@tNV9269=;%CamvY2K^6Zg9dtR{sRo*#9K3J
z(L?y#={61zd+_$}Yn4)|b>NlJ8mikkdEM-K0%vE(09YygNotqB`)%)S<A-K%@ATxP
zdDQJ4wmMw|^~oYa6b^z}!c<r(HIMdN2W4oh)9hLuJ#4)?X`G-9n!DL-c{K)Tu;YFA
zn|sWkpdrFZ54|L?NDqS}#1RHODO>RWTd~RF^*;#vvwHtN+E`-${d8+<I~V`=$@gE^
z|CjjSHt#2w9*4%l5cYw#xYd@Ylouy7-*c!i4yt#l>nCi33-WL<odGqCHZUd&NRJyB
zjc@~D!3wUyp=}V4YbtV@&U=~EjlLutfzY2*RvnamFpf8RfU*&;6pDx51dlajhH@Q~
zSvQtNOIx;c>&GKFO=}BmmDuf^a{Pb{6h@fZ((44`aBSFLW0aq9OzEfixQs}t*S(#}
zLR0w7JDI|NHDUL@ny`O0VgG8v{?&y2f13%r*mSQA$9{hrC-uuU;~}X7tVd}3Jqk1N
zBru2HG!u4$Vv^dn<ZC3>0W{RY)Cxbil&}1m1h^xU^aZ7%JPyQ2gWAJpnja^?@LIzo
z+O*5~$XmZewWO4^Lk&=!qu}H0nDmtPOHqDgoA@EPp=f~`xP620A-Hi=YDMA9sDR(P
zc$2oycC2Y6z<qz_AG2O%F}6qqN>z7@Fr~2t5MN^yROp#iowAO{llch5(wLmbf&ab=
zrZB1?<m}&G%bNwsj1pfCgKOE3FvhdbDzS5TYi6d^xTKg7FkWaGMJ*L>P*koN!wvHA
z6+LzC&Xd$iKH0iHef*a#iQ_2QD4{~FmgY{8a^*68dGW$~N;mQF1OJw>p+}D@93vJ>
ztb30i!;8MUy_8#9e5VpqEygeENo`rSxPqFDlR)w-V>1#dc7%~9Z|HIjHfkV2*`hCJ
zJ$zQ?*#Mr|+z}~RO`=5Tj-$~H<&0#_Ce$0i)J)@>a>bk<A~~W>>P5O#RJOBO?Im|<
z*T_JFPf6I-8F$r_F~-WYo|0~LS1!I`v>c2Q=qCdDNhNrrPuvImm&=xyuM_F5>OEUu
z7%I<rSjIsaiPo@CHpRG=X@{?_^s0sRN{!pA)1;AEnh;t|8k@Ph#&~y@AVW3g>{11*
zrOCp|yG9IVd}u_vG(cJ1--n&cNWaD$6vZ=+ma9kN8c51=jgdIGs5wjQFF>NB(1C_*
zt#%0!1HvlPTZUH?T;LUHs%1J#(V-3Ha8A}34k__02$Dz>oTHmh1v(Tp6Tx~KN;X}B
zi3<6X>m?JC(D+LpWR{u;v1y*+bkZNdSxC)T)tV-m&ZsV9R>L<R%R*DHlu27uSF05k
zK%W<YDpQq}K+^>h`pvqzAau=wRgoFT2A@Ik#(~okD7@(u@|1@l)>BN-cNChVm}ttM
zsr=|z+E^(tS7aZMvKn}TH~UouA&CvTV}~*()kLvU2Bj@gqPnmmHDf$>JZhIi;!s}b
zy+|8;@W3<X7T>~FVVKTnGy=WD1g=Lwly3qfowTA3>c;!<*EF*&9+1Ll9@uHHF%DPY
z_b<8g0fCMsIdC$HXA<aN?`?sMMZr&PI%qR2Uj~(ojikMYW-?!M{}E<Tdx<}68xfKk
zW_mi64u!+9XN-Mt&qeg$P7i_-GEahvQjzz-pkTWR)i5UHWomqX`Kw(deNG+C)R*b1
z)pA`w_R-T&Q6n^=`k(E2K-qwKCe=gJKAff9bk)P0ZYuUG=~nfeRMNF_0>hm+*qtaR
z;*oZn;_WM1#GD(00p$jfA;_>;OI^I(;DkU;gGFmmRec3+Suw(s)7(DSJX?sJ2s0g-
zB8pJO&dyLs6*rOE7OV!fat(H&xoq$;OlC>lWUOU|xSNr;vExWb70HvjoKH36Qj{fB
z(H$bwNKj9fAT-r3FFKd>KyOTbDMeS~mQ+|1x3Oq(NWU7pxA7DTW>DP`R2%$(5(%Vu
zLrg&_bKOxnM%nXhnIHX;Sq7)y7Tg{^TAdE7q>J*W+P@EpTDUu+I5X9(UL>$vW--b>
zGZ-lSPtu?Iv;HN9#pgmQL5)E3qf)wSvy7a~frnCyFvlz=kuJDg;ca3POi?XIhZs%*
z!B#m4NUMbFj@6^!thR!(OQwoh>oYUjg|~R=KNy&+LMNjIz-rM9;vk`1u#7&nnpsy(
zIa@KOkFk8za+meOvy1d9lb9n}kswfj&92KTg>$4H@__8sf=wM@Brdf!S6wBWDJBl4
zq6SB*;aQ<2YHT@pCY6?r#ei?p@<S60RH&0Hx=0!%0)`l{f96Ls&5qEnRZ7Ti8&3xT
zhW}!Y!O&5UN#t`5Sor9pi#p4i{y0#ed}S9BT!ryG;SRI}sF49Tj6QgDyFjKPq_Li(
zL~x;{o11v9O+wH{hRM5(R%lhF1&+Kypx@xY<rPv1DS{c)6g}vZR1Q*92otAx`KoMz
zCK?(dvR0)YD1i2PNFVq*fj@->i9MT=X^**g<rmpLyqX0I)GAJWKyH`9Kzr*r5re=;
z{hJ<Kaoa9t+Qb7LLW~G7=4n@2wuLbiTj)9Wz&bp$a5f0C35V&xi(&7lfi#(5o49rd
zB0FW}Il%5I+K_*+_Ear_(*;6Cz`>TdQ+D>^w6l7f8aU-ZveL}fG)HdLv`Sj!BPgYq
zq=kiq#&U&}sFi<FAOdDLF!eljvC%U%FeE>DVB*0t=hqZNX^mjr4Pha3VjoG{L^>Cu
zc)EgHq7B$1`_HTr#y$*(8K#*#fys>ju?L%S?)Xu0oo`f?q7%uILx+oEpy&!DlP{&k
z^HphP=~=+swnT3y_jAe)Z{YReKo^L&{(P!8FxOc@K%NA((AFSXItQ2HCqvytj1)Iz
z=!c^uB}XDJOnVNr;wKB#Q^ak#Au5?8NrPHb^^+b`#q@G9nX(cTmU4HC2A?|_egRX@
z=gYnoBfrcu@*?_Oz_eN7Qb%5Ao_O={dYNAV?lkcRN?S9OR54ZttJU>`++5kELrhQP
zI^p08^MJzzm+MHeT<s+*U8VE<NS)u5Zi=5O*(04FevU(L=H5wjSY!cBp+2yjAErWp
z+zo7HC(r7T;$1d>GDf1#LU{;0(3iWpZ4p0ZrrL@^6BAq|>)Vq@P+CDaY}%Hg6!}CO
zva{DVAdO$w=9j^SL(X_7LC`@SP5din9S;%aLyFAAnLI;<ezY04v9V49^nipr<0Ns-
z1~WX(WDb*+S8~K*^wYIv7!)I=+|0XRX=OQ|wW{3YrT88_TY62TFF04dwNuwbqUp@=
zY;Bt45+{o8L8aq()EnjiD$Q%a?S)#wB)bx+x%ELsPVTzy+HgJ^tx48CvIfE8^{mFc
zSO_;R6OfV8p7y3oR-&!OVGo0vS=TtJ9!{^VB_LI~^=<d|DKprfPffh^{fU1bjzYi;
zCXKg^zZ@5yE8Z--MLciUIdEgsBLu$O^;Bdxz3-_9=DwBZd|1`SmAQ7(6%%^vyWY0#
z=*(K1#Mb)xeDp>=HJ_#XAoHFFa-lqv`%ChEh%5z`7!X~AS8$+x2;1dDzGyB|992n~
zm`Gnm>2ZhK`PGh*mq99RXBMDi{VDXi79TD<rG0@DLykymss058in*{!L;#_SwGc{t
zyp2ecp22Cc%56fbQBwGow5!H+7@E;9CKs8(8J5XKd@290wq*VKxyz^6{u`<BOW1!u
z-G2IgF8=q^r%%4xe}9ROJOAJ2U(t?v>wZFdZwjpAFu=3SQ5;VPmvi8MFDCs+|8T+j
zY8L&~Ec&Zi^jEX!uV&F-&7w1A(JwgEb1o*fwu_c5gF1xw;#`3etD5rhksI`4!)l%Q
zE`8KT1G1&&*Drv(T}sBhVgv6rlD(`al#RuFK*@BJA$QBr2_T<?od(WBWFgE6(Lu=R
ze;@{Z8D9g-hf~Nk951HuBb;$wdOSbT@kvFCW#{jcW&=1*uhVVp{XnN*@2|F&rq{ER
ze{-hoY~t`VL7f#4A+@A5($}ZQ>#1b*_P$}gAYPilvtgvaz<+Sy<>cVz=_mJ6!!oWN
zG<Z|j`6;!mBRzc>!6^_!7!Og=5P6j2E4B47g5dx-D5kU-^uyMo)?Q9x3=uU|;Q%*H
z(<HiNM|(n=EZqQhG8`xkZhDlQaZk*0@W3)U<wgL>7=I+urn3B)g5P;c?>yBR&}&;2
z?{D;W$NiRpjDs<Tz0q%~_#a1`NP7d%-orDzjC}aZ=0j7%C-dFEoX+B;oX<;7>MaQ$
zeKQO4WMZIC;%u4aC`i-8Uw(PGWBgoum<DPR+(Z)E2AifP*M3?1<(EJAe_30r61<dJ
z3{|l}j~?zUh7$pp%5z7}>9U&BqMEa1HD^UN{be=%qMGN+YM$q60uS-$qgje?(sw0P
zn<vUvJ1hY2oQ&N4_rm^t{PX7aM}(4z7g;>R!UaUbL0sw63ViQavhTeDz&Re6BW8|;
zgwfIe@+%NNe%adoi!xeJOG6C>)**hcn5fX>O^i|rmC~bHQ=MXlQS~n1g!ShH&19JS
zk+C`gU8_=W1a<*qukyYC0!k0$mu`EneOOJn)+!ikx8G(Eqc1a;wg+{qYi-Un!3KnD
zR;$cKaPvg`C%Fl*w2V05#F~lqNvhFi7F`pT{c_hXj-LrLa`au{Qr5nLwH`?=;{}t`
zWYOg!UT24}QBPv%B_3;H54eG438$h71s{%rYmAUo)?uZL_)3NeDQ`RC4npc#y$6_^
z%5j{8ruPb*j9zdV_}ceXPG)S(?_=NKP`n1P*U}2=LW0kL?DgV%*!|Q340Z*eZB$L8
z-cycWx`mK+qR~Tb8ioSWHC=g$4U<Qb6{_hu(T6&C$|lW5WC=jTGbmTW^BqGQs{^)o
zi8pAzH=Fw52uqTLp$DfoR=KxC9KImLnN+}<*Yq6<CdqsF{VU2W$mlDGee>3mY=7cp
zcQ*@5X5mN~u;gyxa(C)PMb4{7yqmyoJlZ0IcigM8O-XYH&Zdm!l1CPC7q%(z_QdK$
z5bwH8#7_n(1a+kwLT=&;WOA50N%#UJ9V1z&&}4OeJHpJP{e!w8lL~!JuIre2I$@rG
zFv?LJ)iA~MkaZZ96l&GetcZ0L*C878b(L`<0wY7v^MEZTC59El=bHl(wf)It8Uy3T
z5K*E7NLR<q@*^7rW1#LNRY1uA@DCY3qUHuf$7q(&txnq89gGT^VC*imq!i_frfysv
zL)7bGxT@hy)F%v_<5~$=WkxJ6I;iKsj6stb##TTD3%Y{@q`#AV?Njn5fdy6~K43!j
z);8Djpb>(=SLk>p%s_NDJX$!>V7xMRA@YZmhlqKSi7|Lcfm+DaolQ9L60E<BX4q;o
zJ|~^rIUbj6jA(m4!Gvggpw<o4PZH%sAmH^Vop#JzXnQouh6Pm8FGc@LL+!0|tUa|`
znKAWH>UnO;#uF_Z6DNo;Z0&`QA<ELH_C+U0^E1v}3}TnMk-H+(i@-RIpsEYbpC~Wx
zc*Agt(JLcye;kAtJZGEM{c|F1Y$3~>yx(L#wfQi6hsEpW8)X>6m`F#G>zJ}D{A3JA
zL9bcR4YU}yT@zqSghOOc`YGDkpJT{6pfDPhpH@dyT0E{8g>Ez&-KE_h(Z^UzH{z|@
zU#ltCu~-3@QC875mTBl9zC7G|sPX&)e*V?M#1*<E!mHXtJft}>L49PlZ=rOP;OfaV
zp{_nv+3jQ@iqwA02iQb5T|LmvMFS;*@?Lu7(=-{|hPSm@sUYUt!uE?c-b{ZObL%kb
z&5T)Qwuu@e4AEQpjHVu$v$SBE45b2F5)9>rdBg&#cO6K09Gg~Bj4oaD<f|wPz=_~;
zp2bwkHI)Oeb@XVfQo;Z3h>S&?p>|b3R;qJ{skz4ex2_s5<v@s0OYX38h!VU@VYY5c
zh&qJodXjSXR9#kZ9HEHh#zA3HwU0KYsbP|iCdHYYt7~NoxUEE!!w!<*HkrL9AHoTp
zTC!Y`2eh6ZKW=w6GEbN2!_bY<s;BEG9}3Qt`YD$2*8B4*`6FBzW)rMsL=D?ZGF(lE
zo-QE2p49#Nq|V}-$T=ut;2qO7TWaNY0Ij&ofEA?SJGXtjX(^|_Lf3hQQAPM(>Khh_
zFsS@{9f=-4;xh>am4EuK*6|)6{@lYGo}aznf6t2Qg%#d5j&D=E)9l`+`0;7yO~qbv
zfP>mgK`GT!#`d+X6%gz^w4|C>G@m0yh;h;-7YsOQj+Gr12zwlcKf@{nx4MHb?EYm;
z-Km&_2*_qZp?BJepx`|;kv%-+Nr(UaWW{BHa|dSoM2^#fVXeGs3Q3PGx#IJGJa_0(
zqO3l@JYi>fVR_XD$POwlwxg%pMH+ZN_PTkJvl8Y-XWb64GkPnU1sAEQsQIx3;OtA{
zids|$-b-TngR4r~BQzp&fW^-(6ll)+>a+IBr{gIOfsc`Em3&`QB5>_k>hmf01m=!s
zH-|2qfa+B?8&1*DpW#q6;`NGSwhGVssZd!s;rs2=SBK5j=X;;*US0E|^HDzDe)cQu
z1#pm^=CLGpvxAK1lxkGsH&<{M6AR9mRL(iqF!i}NQs9w^G67S7#IZL*m-EjdiQFT(
z+(Di4#JJQkKZrx?YNu%N;F%D^<|DARY8VaID$XrYeK0me>*xRtZhwBBY9+5I3L_dn
z2TpyGK}NYoYpb<dvzk3p$GcUUEd~mmnZ<*0nX_JDe;x!AeHG`z8DdrrSAba9GCiz-
zkG@GCg-PT`<v}6A;pe`H4nM?$1_tpJ(Hnl2(;T7hZp?{S0P&_l74ey;&)f4TW-y<_
zqK;a5ua!dnbQF&AexHu99%0VSd6rn5zMq9dgO257poJrO)o$m9f)^$*@1iFl;+zp7
z>Yv?*&sQA%t2kb5_*jr8`aE@hz8ey7Ov@!f3i+foxO7>D>QNM*=1JZqrf_^6k{DJR
zAs3}Fx)|;9L8`4NolXP9CtE8)72OV2#aDIiM4pbN{mD|6p?w11E-GvHkX;p~aXiBz
z1pV2P6O&<`q2){bWDkDkS#*ISFyC{hX#8qE`f$&pv1J63JI1F1s6GzcsuNV%=vSmX
z#yAs6Vi-WIeE7G|{!5Pj3vM{2PcF@Xr~s6qlF|ZL6K%=V3RVr15YdTXp>+MZyBh6e
z=P=7kf6AAL+5K!KLdUVN(yX?H%&?rQ{9bx!EJa^|Kaiy8rMYt|>Sb;N|NP<QhUUe5
zWlqVGK5LvD>&L-3@vIz<WL?u?*&ki|H+ah=@xby|jQ@t)BYx7=wY7Z5Xj6Pgb>peE
zLvj%<t~`nIw8Y2*M0u!E$miyhbzo`IvdhSUK)gv+bzdmsGM8LPN0-8F|HtOZD@Cd=
zyeAchu7*C#AtdjgvaGuEu#%t0Klp(3V=z4jo<3Gf;EAZb*;IWNh#ewbWUeg+MP}Ln
zB1R*?emtE9bmJOCXu?0J-{&Fx_QC{y77G-~qwRvTn{$Pv0F`J#j7raT9*lFP*yFQ>
zf@9ob(VidI3ATkHq+INQ_6UaV5~>#nGWc0pn8DBD*~*-aZNr{aw`Gj+)`E{3)M~;H
zeijHoxe?`~tgI*w87O=`jjvY|ht~c1$5c*HIW9|r8iYfp$*eplV`UW;Qe}D;Q3`Ne
zWPi-?p&<^Rpz>u&#j4WAtjmK6hPmXlt*N*}wX-o5F5+42#qn4=EcKxk8k8D@3S%eH
zG_k8@q?hOE2wo@z=tp*d7ei{Kx4&B9LbuY9=%HlP;SK=VG1=oPntmh_D8R;=OIMGR
za@6WhnArX4)W5+5Y?Cy87zPo~+ChlW-MF}zqPpb^D5X<zTPfL7f~6%2%dhHLbgONx
zX^O?Jemoz|LfXwG>&YOPz`rlO@69V!V^M3msChX@@Z4g{h`=jIY@hC`Wq0Ve^|i$x
zFNhNwYa|qXh8!*vXY<g^oxHwNSt_jSlIi1|G=xo!{f|b`%}iChfFTIoGZx=wF?c`X
zetHGvlKKCQWcPm`>0rUWTxg_OC``X?99N8BVif*i#VKeY^Id5Ys3ZxC1vix|D4?=Z
z;=j*)0PB8>&b>E=Ta7-WP5B5w>76JJ`KHFUQ#><Qy7OWwb8l<!F1eD7!<=YGV`L_l
zz2KEs)^=BTi|j7E;9A*Tf&Gp)S1Fp+b1g275h)^M*?^3d%BP|8r|GX1wf;-w<)YKd
z-Bg(Hu2_1%2mR#zNJv^FQZkM*nMJoi6=4cR2tF(u5>3jmUf2u4l03x!qPpdlJMhC!
zTWlDYeaC)BHN#y?zcEZFOm+zfYdcQbj__U#`_V06!`Y*I+PMYrom&8R-i|MXUcCi$
z*S*$4;JsS_&#BH9LjLYn7(Zzpy}kwT^;-ZZJEvQ~{_`zh!>)Y`$p7DMP}1z)0`j-F
zfNbB5Ed{-M3(%+$yani&w*ZaiVJm^oc_OOM3J!eL^~oKC5dEz{Y0S<i5yd%)lKD9B
zwn(3}y8Wr8$pMHHb@T>24cK5!V2NvNdOK+P$L1L5j{6-mz=D^;zzW_n11fk445Z)<
z(quYg$}}`<ye4zw=r6L50?<g4MWEBmzar4YJPIJg;x9sAvs>^6$+)OD8Lfzl{+*>~
zu|1?cwm{TSv5_038M*fDAdh4uXp0o-4^IB{E}ZFPVcM?}1RVCQ*KfS_VU&|b2%u7`
zWprH1zdS8#8YHh2_;jiq?b#EbY;nsb5P83{x-actfd(?KW3-!NI7`~gYYU6?o&T2V
zLppfwdP9{Vg_IpU57s!|Hh${8Iz2E;8K;n3QCeQT<{?E^>F8S700=?_Q$uZOkkA1I
zW3aWA+Ju}|K(4S;o?b|TcaKtG&R}tjiY!584Ab8Q-Ul>2SCbh2O7Sptz-!F41vI6}
z%h*~tA~`0O@pM#jRW28W96u_uYTB0D#w1g&Vo^*{oD5xwJ-IVi4+n4*$@|e8?r&zu
z2;<rlPHTe%_3!ZBjIlwq5cpG=EKvkd3`+t{naU_eJO~0&fSDuk_+>{;ol;zjRea(o
zFBj*bkT6z!D{O(o6=P717?f^hCR@d?Cx`IJAF2Cg8Up*)aj;m56q|VeH3t!Z%|cx^
zHgc1{DdZ^&_ZxY_6Xjp|;YiJt)@IU=9C0}3)gbah_MGXLuxU6|W_YCm%kpH;&>v5?
zZVDCx#yw%c4og9HVY)Uq2Uo*-0E(K77kp>M&82PGgn!>RE!oStfD+=|<W>n^f~+$?
zNka|qv-qI$R2fkQ5Cb-?n@lYw`E@&H&c9@Fy~|iys1;CExrxw-kAv@{*9PlxvTdn#
zP|zUGm1+-lLG0E_!Zlz^iQIXQAln-#a|>jv(iKPDbZhd=*9E#evq-v0y571Jbmn`l
zl3P$@i54#1sW+`9U|bF&`iK<l8F6`HSqs(DevwW|O_D9G$N?}zl#Nc~SX}QTW!Tw=
zGto5T0l7K>?sJkYbnc(2bZaJ8z78Hz2t_*I4bVFt<CxF9tq)a7HHE8_o57?~Xk{{w
zq5y}8ff-SVqeOY*V2s+!a)qK=4w8C5+g}M!vbDMWB&&^MzC_nRiVJduDpKJKBTIwh
zi0R_BD{?#x(mW1lYT218_fWDit+F`sEGV<}Xhx*OrrdqY=fx0{Auo?3_Q_fSj)-D8
zT4Gnwe|7NJ|5z0NH;MZn`WQQU_PJ4j7svnI-g>h2BoqJl`|rQs{2KrFOMKk%f4BZx
z_1^l^KJ3!3gJ2XPr+YC*E_NQyk_i3@5(?BC%)iFz{TiqDYn<M%aeBYT>HXgtr`HM>
z+iCCpu-ATj-01d@Bnk5k#E%)vHkB+ee(ks6kV5soYaKn_wsMGECqA8tyKxf(?vm09
z<#QDaRBn)sNBAKf`@2q~`L2C>xc}-9dSqYzh$Lpbf1a=0I)Yh$jSJIVIeqV_+&Dy?
z=Fje$^3qWasJBztTY2fIw%_b@8~ghwC(Zxku4)u;RDaufje2HxRe9;CMrLW<pN|VF
z>etS3(%bfNw`i#9eNnqd?at}(F)WG&jq5TFAnjvBC%kso*RNf3d$6Q&qkyYA%tPx4
zR$)P9^}3)c^sDh>qjgwZTa|F(z1iIdR$YK}e(A1udIU7P_olF>ymwcIMba#qX?g3Y
z2psXK@d}XG+;`VC3KUdd(6D~(B+pl;2L;QX-?{ij2SFC_3VP>W@Wr*{rK4IGcV*z|
z?t1ENAyN)-e_DhVD&VMo2uspk58t@P*Ld56b&Phl1!GJLII6#CcNSBgQNWE|5F)w-
zY*@WbD>^L&_^#z2at@$iK;A_VfpppTS{rTACb8jEda*ym2(GCA7zI~;lnvFL?Mkby
z6b0D`x||X{-Tg97F%*X$oiN1{=WpJox0ByD0U57@*`c3^b#bMVH7@I6goAfsgj;i2
z@2^I@!d{vTbzlS+9D3z%tas){EcKyvl%zc9m8~w6?Hs^Ckq!oqoKMPc8$ZCte6nBO
zu5MSV-UF$X(c5FSZyezq6hd++KpEk=3;EVng6?@{xLXcI&X(53Qz-u41)LHGgJ~EI
zV=Jg*6c4gd@8NVz2Q+@jS!q30*;~H^pco1=`+R+xMj+-mvB8elwSr&Lf$u{wqI~w~
zd+Cox6kC^LebV_$XFP-^VsAQ+D5W6fkF*qX-`GT9>8;g%)9M}Qt>%*%jNL1n_+T99
zamxU4I61*>bH{Ui^0TFudH3Y!UgLG6b+nT!js2rnPWkS~#^H{u4XpL5v43#bc<q$!
zjQ!t*j<>BthiumacGCl%bNc#C?``uf90zvHYWyf)4H+C&J!qdE?eAn;J8B~Xb>IZ#
zt_9WPyyF-gN|;@Hd}cj-Yl(D<WiFU9O(gV?l2zb20M!oA;!(Q?r@%Ixn|`*;QOxxs
z>&p*&uq23+s*?cfXdI^j^RXVDO;}QjZ@^ujj3pU?(DbxpgD|P^`En47xOQw1Op<nQ
zia;=#?PPml$(~C<C@Rc=$P?=GLJ&-TIS@9{K3~`iA;q06IxPZT0z#-Vi%y%CpF2P}
zsMi8v5T~9N24T~&BJq@h@n4~Ti*6Nhrlu%N+<3pBxn+*=8+_j?h|dWU4z<}8Sjet}
z87+}PJodxL%)TO)<YeQhU`p*Iz1{lPZ!NSITKhfjo3+7MLQ$DwT=0n1XnCZ1lyqBY
z!?W+#lgv&Y#{Jo-ELa&1s+o8k)8N16K{CreUiYUL6Eo;OK!?5&FzFz|Vt*M8gDO4G
zj|(e9x49E+oN0I3Q2@k0e7Zwdz}AS)G26SEX6Orc#1cO6A(9o00{*Si?@<u-m<lu5
z1bAQsQvu^zs_Y*=9_V|7cX9VTBn9>}N2ONL0UQj3#x>{)r|7oTQ*wwH2foCLNKie_
zfhPTgm&UrOav~e9<94U@lL;7>92`OhvD|`80ouq{G0{H+!Gx<Qc%%3N!_WfG!UW?Y
zSSwTn>0MJxW-e1DXy^1`w$;n6W)&nx#8o`WO)N)}yb4DA6-wY$fwFOdpI83KoMC+A
zoMGeKQYL^n#7_HA@ddmSE|&#9zw4ds{fI~Ec7>cq?RTA{eSTNT-dsx;()fU$;_I_;
z9AG@FoI{ND+FPGtKvy1{eRA2y^AVLpPtTlxR*HtfwG|59V6pJfz_voOpje|<(u!0b
zNLz3m8(il@O3W~V>s2oa`T$mS3!`dpZaNFjxnx-tU8kZI@6Ytts^v7H=l<goI%u38
z8hVcO0H?5Dh<qVdN8s^Wpk}?INKfd^JSP5u>@T_XLNU{B=a<XBcC}bsdolHADc_(x
zCL-^VMPykb<Y6VNOs_tFnB*@e)zpp3Vj8+_BmWvo>W|_iNJSmTmWTzk`0_{X?1@<L
za;K(2|0+w^Ou89sUncV5$iGPPJtrutx)FYpY@aJsn`?fNF(pBf1a|w85v+7%1`&P9
z@ufsGiAN*FU-A18#xoqi86bjxVLTE2pfd<Br2LS8nI9t*U9GCi{xRL>G@mG?@x3F;
zKL2W4oPWiq*#4`25zgRv1BbiMZDX<h7yQ`H*?&EG@-_ea7x}2^uFc>$TG|Lc`s2wc
z&{R;92kWJc^?Ho|B=qm#W)z;|7a#wb^h@xl^Yh!%3>eP;%60VL^;5k5qhMCQyq7kX
ztpBHvx3)9u|JjqR@4v49FY!TJ?T<6c2`9F4K2CfeRR-7b^aHBVCIPv0pmE<DCJs?p
zOoK^0#WZfpLN04Zy7|}I_U6`B)$919D}RQH!j2ye!%;Yy#NG>^LSp_C?Mg4kemEkN
z(tbRC>9k4RL|9L%-f<Y9$I4M0PY0KC=*){rKhi%|gY^{cTW2$`GxMYVC>#zcGxv;Y
z2hoLCw_<f|+nN3Rrytdt)9?e?Fk)tg7yt0_TKEG38N$8^Pt8tzHIn^mB>UA!_N$TX
zS0mZ~jYhKJFd`$@-Vq!~-)N&*_1mzH75R%yV^e4KqhPj2x*Gb0Id(BM)p{S!y-Lxb
z%ApTvwpi8SE)C!N{=@;`9V~8FL#gZO9!87mkXA_I73K=3W%+3*n05I?@93LL130^K
zK-uHlj&6Ta1ck@RH#eO6dO9m;VLeqb6twdyj0U%DtCSTKGM|NAS+Ta*5z!vp!}g1Z
za2kal7x#bS&n|C)p&x=^(ip+Ek%vk_1<;+CHS9LINPqU@sG#OL+Juilwi{TqhJ@3f
z9L4*=$iHz>C9872o;vUJDL(&^Ztq@BfJ@GQ+nd|D^WW2F&%U1jzQjjwOr!<vy=fjE
zH&1%Jhc?q~%KcUxH{N#kFshQViM_byYj2>Rm#AYMQW_nbwHUi%7-4!6-5URdy-_{q
z1+I&y`Mq?N^bzL@$5;7Uk)v8<)Qg-IulydK9&{!7T^>}EidQZVDtMQP0e*8WMj$Ll
zvtintJn;H|{cBIZEvbPL7sOXr>K$KOVAs;j;PA)f--KK^W>m3XbdG^Ny_D+L`|+H-
z`gQCaiusJ8*T1ox>{Yq6@m^Ba4OhKh_vG|wuh9iLNHypy%N2?X$@R&J+Xb{QBeE)+
zI(sThHw!s@+zB1^dOe2+?rw@G=>a^Ty!B;&qDH6Uf5`ysSuxO(!v(;?>zU%=36&TZ
z5VC&Mk}#a13_2x^OK-}C89JIt`X(vMvnrLSIBz&|4>L>pf9oyC|K3mW{_iI@QU7yY
z|LL=M|NnmT@#eGa{{Q`xulxTO`MCZ6?_Y1bbr-$uSC#2kmFZWN=~tEMSC#4iN|mY7
zhz`eoe;SiUG<`^+F0Dr|lG$Jsp2LyTdWP9;_?et^)p0djD4|j!o$GfTUDpQMM-K!0
z5eePaqcs+wtWMLNy7^!b_Gk6J`2>S}Sw%z-vsTK2?qL8n455eb*xdXY1N967;JH&@
z?>kDN+)v#z5W(d3$q@(}lL-uaFCLG96E9X4_QwM&-sW@GQ463>fj-#uK(REKln9$T
zue%0)@Gp4tpeMLd;XVTse(v`_B&1B3%+EKH`MH@+N_%6_X-`VO@srE4X=nE#(7_Pp
zV1~`S4k9e6I#HG?8l>1kL*=Ck+B7tp0HIK%Sk?Br<?g6{{^*bP=aVu&RDtzu3&CXC
zS3NIN!HTB}YU4LVx<K^S2Xl44g>M|RZOp-eRb*gzZiX(VV#@<AOLBN9U4=eX9l#W3
zu>-cBu^R6W!Ob2<0GS30#|&88%01aO%?C&Dezg6(2rcw{v}J{?%g)P|^m??tu-LYN
zDS-IRE>zF~^fs-5BZkJ4GW8y7R!3W$eLhD320kdrD~K4dda@|Vk!}G27_nH(DcKb^
zibS`pQPkuwZIoJMoqyUCt}9BYt(x112Y_J)W-d@(Q%GS|>m4r&`&mjjx##Iv@?i9<
z(x>OThs^tsm1<6vK5A(P@Z6n)8Q|Qm?)ModICdy`=|@p8N+cLym9APag0Ffa^l6mC
ziX3sh{J_Lp)rjs++BRKfNtkh?#Z_UaRhGc^`*sS(z7@{h#Ei*hu+|d52=@ULti9|T
z?o^m$cp6;HVRKVnPsWZ$5nm<gFr^#BgUHCgkhnw`*aD<N5IU9n(}5fgXfO2|$E_-Q
zPhDfQ2DE+hL*)N6IFJ$~iv5ZreBcFF7$-H<ep%C?AJCBi*r#|yLI=<+iq8kw3-*T$
zuwz+&NEjvAX?qWLz5g%MS&e9lOPYFQ$O9m1E6^l9miVmshkK*Ik7y$>NRI$r)t!~#
zxjz`-ZL;gtAQ%<Bf?9NiTu`m>T|d)9<5kkX3<mR2(516vZU}KCw~M*DafFdtGcWa9
zjMW(iAaJ=xqF&BWE0KMP!bcbZ&kG0c+Gc@52*%1+U+n_M@>O4LwK8%X9Z=fj3>8}M
zCjo|?4brFiWo{SLPpu72N6+VID7;88r!{BA41>`?yn=lSL=v8l@USiklS9}?5k;7j
zF!--|h{84=0eo~1=2GIMNZGYaZp&=j6!T1RQ&`O8#t=HQ4A~6k{|)@i2sRp<7K^v|
zkG%r<i(?t;@6UBQjiS9ph!vA+v?rWWgM|$$B9F*X3%^+Vje0r0QQvlT!RM}_7!UJ%
zm13>P8>TQHH)(iom^b8B#2nRbK^h)ns-zDiXVd86OfgNx5K#$-B7u=1#5=!H-u9aD
z=^@l7^W?JEKev`h`c_8g{jOs^A7gj{N}bYcoOas>C(WjkO_$X=GUC1U$xDc_m7R|V
z8j`u|y7CxWO9UT$GImF&JkfXWh89eyMwuy8*+nf$d~%#VAfsV;F`r_{X_`7jtp|&L
zFv76#8yRANYR6DOof)7vRRe``%H+vW8?k%o`F)#VAaSj@3anr`;Uu-BangOPss6Xk
zPu!%Q-d6jlgQ<3U-M!=T11Smc04Bl9xCkv+jjD2G<x!xeP~k|H9vah6k$uk}g9~|H
zhtoeL0;tdWle*C?#a7V2{%HImgp**7+tueI@?VTmC;K^Ro^~ik-@hC7$w(|~6LxnD
zogTG*GEhXo?%I8A2c{U7)X+T3xwTa-#-8d#()3i!d@a#2&xf<J<xt5B_>m(?KOT=k
zdVzxnN-%?9hD9;W09~qv$tCKK7=naRQO657Dx~zhUU1G}v1%Anssf70;wP9>KvIzg
zBTDx}WldnC@O(;FJo<oyHx&K|({a$wZUv+3H4l40m%Vo<t!^`A=EjU=Q<mml<<gU=
z`AX&Qm8L9T+&yciSYI@8mguiiRo!J!Fx78@(Zq~!LpeZTYurdK!{N+OPudCYWxKR?
zSxZlMi1%pgc$=nZRu7vOzqJh0m;Lihsv#|;(ajWRBY{4`;bfwZn&(b6AZ+fYkaJ$B
z1Wa?1x7%+`b0WUkbfjqzU19&c%4MqgHo0T9ml4vzu3NgH8)!YiFyh-sBU}mouD#@g
zShn-#I}g!jSE9pNF3C;$PWMbzHL9f#9oZcmWY9rcxiuYds-8kRfL^3SwC2$<AsJ-w
z;L?dm2_PM%onXZpy>Xl_CPkt^phPCgOgbt_LzKh6K|EZfiZtXT9;JXJ8TGC!+;O@*
znMbQ_GR9oUBRctbcJ8HRM@&XNB_?sqo7NI(fueQP+iM&izG_%8p$P!W@ziz|e`oZy
z7PM67lmnL!Myk=0=Vk?{ap6I+aCPW&43^MRUuC=opfa~=XJ#=WEgNf|$s^SwY0*~O
z=g}?HMWo3Di_{RysKBNu#a&QC)0zcSG{pglc$PkGMl;yu*9Sqm8#F%#{W+Q};8i9X
zs_3nW>?kM)jx+m`lSw@=RAJQzu*Q%%<Z~}M)(p%Clvmp2Z13#*JkgYqFa?LzWaXY2
zYPS369hC3@WYV98B!m_t&)j{o>O3nJ)J#<GuLC`W`3g1%4rfIvj|3lOicpA9F{?e4
zH`1)<j!5poOP7d#e)LBGv0`2XsE?r=)V&X9Mj<2ro~cJH7~!W<4r!?#az&(NRFwY%
zk(L>uAqa&RnEsJZ1|Z@igCeat-aQCGqAb66*lZk~9<wB$U3r64Dpu58=Y)D0Mpp4S
z3Njur2AqPDG`IL!=erGIidB^XZ#K7YV$K7-8td5=W69?jNh;lyvX?fw=xVv5r~_;r
zz0OX3wjG>A%^r;TaD^Fj)h%m9Fa@9fn;xCFlL{2M%wQR+H*RCHyPok%7tK+Dy2(j`
z(a_TAX^kQ8W(R8PVpX8tz~1TPjAn38iRZ~N05oNg2_l)y#h6er7$kBcWhp8ky+0pu
zI76RWE(ws2+=lu6+1wu?AlytJQtIh$jDZT1xC(8NMmgkbyErm8TU@&ROMEv8`yb?r
z?WRPRZq6p_UK?!zufrs$T7WSB<ai8~fSQ4MQ%5-WU+QCdPg{6iR1@M%<-Bk51Z>D8
zmE6Xa_RLSG*CDKo{SSdMlvFG0(nsqaQr#<7k&fGhZ&3Q3$FE5AEp{ZCPt_F>sx8u+
zp>UX{14OO0;#|e5Wo!MU>n~kA5^j@6n2tVC2|<%fip>v%8^w9a$j*|hqf#vwh%(Gy
zQn6F*-5f*6aT&=YX(@;LJ{qIqeThm{S><UZY|_1pbl+6>q+&`R_S={_J7%oa5|uT?
zJc;gejtbzmnov`Qqb_FkzC)^|*hF;Q+7@sz`@?{?C+x_0KAMFSn0fU6N|x?aIFnHv
z)f}^#TM!lAZvtEBE#>e+;+s#qeJ!62*0CUu+H|=@i`UqH+$)mt#p|*=4Flqmz~KBG
zMKXgW`{XJ`d__VG@uoALB-V^E!-T@;0hLLTc`&GY=W~qhDoqSWc)x=yKAz7e^O?#)
zimP2vQnJv1!ZyyxG{9KNA%!#MYwlIH1rwH9Sz|I-hlMppUN6w71DFv5#*UOQqU%5C
zSc(X_1TNk_EM6|K;s_z7$TWC50y8p=qPnwisb_fpeQ>^&mX#3rI$9Qrjfy{?#Wgx)
z(l&^FhdB<24VWXHM}wG@zG1S!a>OLsmA4xdzVg-(S;@Fyt56$KUfBhLa)*yn=fSPD
z1v%ZyAerIuZncRJ`ztl)uA}w3dA2rA(P{^nT=~<`S1yCfT=ixmML5BHf}RD29(E3^
zcr52bTl0=QIhjxJrU+M)X~IfMePUumKO8B}brnF5F43M>5%moL!rh@>&*$k@38WR}
zoivXRf9|2x{?8bRbwL@tN4MlqwTV#;op<`>uD9*l>daC`B5S)1G(HFEJguHcx@$*$
zGNDlA)HG1M;CK{Y2h%dug`#xWe>i!Fa`+Yq;G2djk}O=Lu6?>odEsu(%qDFYcj~3p
zQkxxfOFxYJz>xTQhIpe^hZ;Mu8+}_VqmQHNip3}F8kCDU4-7q39gpo8&ZNRuVS4k&
z;f!$}tr>NaKA>xFg_<fs$v_@BF9ryu=jkcmJW?AC2})Z-Em!zjL319+N*e_IDW0EG
zW{<wMK|bG7$Z?>><D2Q|k)o37nufbp$;p>#pKC9rnI4w+YC1cR`h2pxugs;9f0;^b
zW@t+X3p<4#?ika9Uj)b-F)KKT4YwVl0d2t`l`7gA=&t21ZhmkI_XCXF;UI-v4P%7Y
zKHp-Fd^Was4HWobYFlJ})=5M(>coQ}hYtL>m)ds0QbXUH*UgiHo}bdbts50<D3VHu
zO{2sSP6G5^A82ya#hu+VIJnt2jH7~4<q+*otiz^_i0`09QC<Ogt7@qVu6U9i!UnoL
z?VYq<nYrTdlZIhWzZs_KCX;X-i8|JWs#85|UtX`I9OmU#cn^eEMB0ur>&>Esi>iGC
zTJ_f2b8>=&H6BlI)@&mO`+`Zi@)P7%(wTtt;*+Hv-lmY~Q=V45UkE~3N?EU9=Dtz2
z6-B9+6-xjsC{=VLqkVC>`(_mCcsNYO8?^j1bbFURupl1`;_{6-OaaoncGuK|zaa~n
zT!0*+ixx6oz($@*D><p+8`ri76*Mh4Dq<Rd7b<f5nsfx1U(J(16**JB&FuO2waDr`
zz72#3{1=Bh!J&f)f`dWr7_5339bgUv)QiaC7IO?4Mo>?dr0&ArBc2T`$Eghp23s>`
zO-A&M5$J@YR~VaJl^nTDEW*c8L!quJj$b;3k^B61uh(E`Z^S+n{O=}z5ep=CRbgSk
zv>>3&g`|`gbkI#exh#rmG0%LBA=7Yy^s5heUD&rs8P&5i;}&Ufm58{WG5X;{e0rcm
z3r+Ty=EJJZba8XD4%AgG6A<Wmzz1i*ka-?<iUYZ`pLHljwvswMq00MwJ}lTj7M&9v
zV#J~oW45fa#x|dQa*0OcI12F=bWAA)p)05WaY@)b{QT(OwvSrf_KD-N!05Ae!=1YV
zUDnM462LQHo(#~Pa*QN}8lWr{fKW_+Br)bBv6U-gLB<a5xQs?|Jn>))_>iN5Oxm+g
z)^Vj1V5-vSCL>NM%Q8G2DtU}lPVs!o55=n3R73Jjo3GseSAYf#6iIp-&o3_PCMY&_
zLr94id<>Hr3-*IR?jLYw$laAQiIZNL@Pa{$!^i|B@c~Yno#Sov>BldR^YS7u?ghKE
z@CKV`3albr#t8T!O7aK66zw$NKM;u6LcZ)Q4c!Q%c~CTW%_|@@)~1^`9jSa;)k3Iv
zPPvuFw5=nB`EsO^n;X$lq%-DEG5SFcZ7W(1eB<V-JeVx$H@qaB1?g6Z*>_<X)eH$-
zjT_a2=RxY0l7+_*NP$jwO_;s{*QqZ`SG`h$kA1%90!U;3V>q6VbIf@@J_m{d$&V=1
zvhYmQ9To*EnZoJ@I?Dja!s{xfd4L^CwCdk<o$<Bvo0=ll5mHnQ8=SPvxm&V~$RA=9
zmPE)RoGtAeEYhjiqNXlCsa_fmqEi*yf^RLF?E@+1=v(Ht1G_j7hqz7<u$J5V_Q~UA
z-D*S}E@TqprBXNwXE(e%N}v|O0Y)l`eHm)v;e9F^zh<GeMDtBaC9jc%VKO!G1*A@9
z&{!pALn5$akT5UPtP5e<A-2IqcPG5pL4GRf0JGi7@8xAfieIlV%W$7#IV*}wgP}Z`
zjI#{JdC2d{Y1lR8+N6{h`az|-_UB}+>h2bM_dD9Z1qZ~>=gSf1FG_EzWGnF|)r=4)
z6(ldB-o(B^UdKQ=>&RjZ=0k!A2_$r@otZJwJmh7N^yG}Eokb!_W{56<CIwb##^O}P
zYa>Bhr1@kkQTyk0w?(1>-eFgDx4kbrQFN$K0f3b80JH7<HK4C9t5%bO3oJ&AVL9&j
z%+F#{bDESe?OCb~Vmopn*<}_KDTxLBDcR)AFvl=I>mD;%3_cX_g;z?;Bqv?KmWkM_
zdrgK3NB1hb?PWpv=katV_oVvj8E+d!KILRUcvop`J-{48%k_X^;awGa27ZX*YnU&a
zCzG_1OaKsOal`$C-d=~(yoPLbZef|)SU2nDwcxe6yCP(E(^jfvLp33X#BUbZ6E3+6
z%UM{wA&FVsNe=vQG@mZ9HOYCYRBWFVk~6b*21|NJsf$tH=Z|3H&DoHM2MgzXQ#M_x
zZwlVvlPrQ#$&@Z#4R00nQ&CsR={+xDoo~R%2xK@PRn7fW6D@*E@0{hzUJp-oM#UL3
zBwoXwCw~!{$NdtdQ@BuxMV&g`FSUEo2Z&s}YnY@5X>@DbHpEtblEU#Da}}fz&4BAB
zLt08=#ST5Boix}LM{?Ce-}SaK{nN+RZ?b0q#Do@)dbUV{>IU?i^Bz2~R<}~K8Ueoh
z#pt>HSc}JN@QPcmGs|!=f8%e&ZgBQM`yx2fM!Gx}EF~KaJB{yuXA3P&sjtXfgdi?J
z{4xQ|rNwWsl6V@_RO|-g8HuI27q_#MW@A4~q%M_W-qgmjR!MEV6a!Iu7-422dt<Cq
ziXPaaT<F+Fkcd?bD_H0hAqPt0bcQ_*F~iUh8aZBBW|EjT?`f(W_8V@~Sj0Q+;(F)H
zG2WuHyMsw$FP+<8O0Lh%rn^%({#{^5OH}quQ}mmvi5YJGWTB=wNv=nWhg;YSS<YA&
zC?cu7WdC)XKfU*5X35BOaaT<>ZWaT){Mgm@2btByjeuB;#qM{J?TLPf_Fyd<BX+T^
zDybCpyI5IM<?u}%v)OF1Luk%20?Y2he@0mcBgk+8)<TfzumVePu|cNQ&z!-pOYA<D
z7)@i*8sh<5xnJ(jIZDspqVcSHZ$YOsIFGTyeGq#!?;jW(7vt0n#CVnRm7Bs@4mpHg
zR**QBx4u(0<@O$B#Xjv;y*0tpS|ty2l_47Pi|tsj_{8wZxE@<Yo9pFVt@0zyC<U+z
zU)p8;8AP=Q#NFO+?|AzZQU=W;$0*3t4ObGVL!zO9Q`M$EGPWwKVsYl=p!(wDOPC*2
zBIEWh8f}E}U-Mudu=X)f8gYjSy8Gw^6A0YPqks+Ar`R|f`O^!EYE0q+svAc^bOC1=
zN-lt8g~r=;?}Uhk?0f0*Mk|xgZ)SWel6(j!>e5HGpo1!_R?O3m8M^^5gBnuC3hF@J
zumf<eo4FL$jU@0^FbE7pfpt@h(#iYHUy*S={O+MS^;~k=znqpQReWcgf~Dalm9(4l
z_Fm_!ZOUN{kY@3yJbAQ5cJ|e+O@U`O^UGAVBl<R#iea6v(<hI%ExQc({isZ1#TRa0
z3U#q&vMVw@S@(wiI2=((Qf=W02VUOD$UvG?Ld*hfuA-(eZ=yX7F2V%Jh!5C0-nDrg
z)?Lz86%I$#>|xgm<+{Xe`5?jo3o71YHV&sd>g#7Yvq~ZuvC%!pzlD~#8Jk_Y2-Gh8
zhLvvByY!RPmEGz)k@&iwwQuQ@fr}6S=IcxxM!u>^prX_yMwk`s{F9kwyl?Hy#)XG}
zjyninVe;jNWy))?__FJ={`ZXXQZFRqc&qvboN7MFU5&FoHw}jYztx=MT9L2mJIe&n
z+cKOqLLguq4Ety)S|{ZmDlRFeurWMbv^HxRqsuPN&VznxkgC?ORyoU5@bn^UAl|df
zyhr$f!$`Pq+t(O2!Zb26sM*b0d6W5!`BYDgY9IDl(=vv-pW4#=GW{i5t8Q)OO)K+?
z0@HfVk}d}n&IMM1So3X&d7fe;D)PSDPuUXnl;>*>_mk=apD>T~Z}`Dxv@K2mfk1x0
zGh?dg+a|;cO$*G3@#8Qh)_a4~SevPEz>#B%t+nx!JC``?I!w0llQC$fT5c28#U{<v
z5oS_Fw$1r2W*3<N$k^XLT4HC+E^F*gJQ?}@z#4{J^5ljhu4+K51s0mz68)R12=hz8
zu-=tL@HoE+Hb~_XCTuV}PXahBX&<rjapm+#FACSmChh#Xc?X9i6$N}1hhbt=OilE$
z5K39){9|0B6>?P>M5e3cn1kmnx(-IUFTRen=(%IBX3q}#q}R6CB^Y=VUMk^bLFN=I
z47n#l-!a%`0t+jw0mHs9|1~^$v%(E|Zxhc>v7@KhF~f4t$+P=chw-?CAyfuhWEqV+
zLa~Kbo++j`p9Zbp!X_)HBynE-72TLBjUwTF6n;RrHJHZvXhxPN>9r9#DB;yuI5VB1
z?X_)01|~G%&ZcF-)bl=b;Z-=;Y@~}t8kt)l%#P}4B?9PIaf=pXPr*-Co8!y%k6y0)
zQ)FB+dW&kocrr`9eDkU$Q#$`b=GfXy`sxo6m>oI!EMsdxY${P|5!AF-#ox-z7rS{t
z5LG`P;LJ!PX{tH4(Y9i;vVmP~3%Ox!n_NccGxQ`j+|%$p%O_P!7G=Zf&EhCv(yF$m
zb)7%}dw?sAq?DkrrjFb+9@ulGkdTWf_eaeWCJU4aGP47^CdEt^XyppDt%|P}p~0Lv
zfvJ-Q-U1CE&Ru;LDiEqay~yPFScgYfIwP>?2Jo42^y8z^t;v|FxHCx15fCv`H>hFN
z((~I;;%5`0l6_XE#RGND|3atj6s>m|VtzC!0Ng0BW9gG@VBkeVvp@`O<$(1r9t}hi
zmylg@;xmGQrRP%VFVt~|m0YM$t~!#5+i}1#ESQKtJ(c7-7lABOfDb}_4xYGGRX!yE
zJEP|+sJ+mJD&5_v_KJI321rp<=Eds<Ke<3Pv#a{-ss{of9(9}ps=br~hUW;^nlG(}
zC9>W(>qSVPU0Je<Bh=!*I*a0e-w%<EGykXjt@SCSc)gE7NI(F+LmNx-e{Vj4cUJz-
z?XB<O(bxQ+U*Pli<Hp_(jn~ay3l3g?FO`yD*2C4;M}woX(11!0yx%(U){GkT5dL<$
zjl;tpy#4!HrBrGicxB9&*KM4<Zgy4rv7H_HQYrmOYL>tIZSQU4hh}f@^yH*@)a@O%
zI$Z?wNfRH({!EzqDy8Ppe(RtNZFHJl-MPcotCPkFW+u!xWtLO@g$6p_cfaMw_6Y#f
zxO<$YA^<eRV>ra4Yhqc${2#?_iq}7ea2kfA;Pcy9y#BYJeg8PK{<ps0di?n7`u`H2
zZ@o7>-=3Q9(zj*`-#sIR@2#@|7el&jF5qv))C<+wWW_}R69*U-M=pk6b@shc*bgF%
z7L-WfJIo}C*CsTsQv20^?sD45*uzYWu}+N`dzf}H=0JIMa;zNS!?^!}-OK86sna>^
zA%r9u!LQ~|jkm{#&CagkRKZ6d%_hCf@7gFlXVX~ci`>%-jOv(uh|+N>90vd8mA@;W
zcA7otOQpJ1(Y<(-?M4lHS=bePS>imG-Danoj$sxgvl6h=qsH6jE|iw%rQ;u7@3oH(
z=&?fCq)!;hm+m2SeC4Qx@33a+O-uBBjsI+)?0#2HE(7#Hn+6lldZlOR()-=>uRnMX
ze<Pn1@4N3Fe|lI+;k1ql;oz%P;T$)*dvDxu=+&xlI&B)Z6A-^!1_?;M1xG@lSI&{F
zJSgd!1emp$LDT+NIzDM0w0`>A?#4WsZUBM%qmtU~pxbZ$wkw%K6>~4~p82!9g~?NM
zEKepME?Dj>somX#x9fdZ-UrHoJ+ty%nH#Tcd{;KhRCG<Vt)iM{nY5<aC#>m$h_%gf
zggM#O#0^ez;xHa5x*lo31M(>?$?UdIy1P%GJ^uc$@&I%9Hcxg<NF@p3zy)yWpasrB
z>vic*13y5$_df&gCP+$unuG&lRU5PMWW!utHCa6201BZM*>~l%eUOaK@lthb`}_JP
z{BNuDr+E~96ywz*Soj)Ob1*Cg9|>l@e}Iw$rGQ7Xl762Rw%_gTDaYgxej)zqrM<l!
zO}NRWSL=HZ$(s8+5ZCtp{AX|dllKxtg{zHd4kfmY?++e$LH{y_LGA5fKmq;*tpPpn
z{q$2Y*q?q{74A<z8Gs)>0>GGf<ZbK!HZc9j-*#*5$EA0TlOy2zo!#0yyjZHega2db
zhW@NJnZ~min@!*usj6#|{1<*lag8!_M;A3pX;uq$&ZcQn+Hbx(ecd}aY`pILZP%+^
z!2d4>=Rhru!`>b}hT)l=sd%;Facd8IeSAy>D)?Q0Q{Al4n$W;24DxVa!IW=6*!w>N
z<#$dGVA1R*up@QTpFY22Zr2m$Bh0x{hX&HB_|xV^6;&Bo?&_7PxYS)-siYe~Y5(p1
zE>lP?x%7dE0rjJ5Es5!#QYsn)sqjGaEg0jMGG+sflZrR(Cneg89LO<tuN4qv05OrY
z8W2I0hOxXdl{JT*DQgei=-UeTb>V}!<}vIrsF|+m%=PG-H4O*A(&kvX*YS3c4_k|v
z-au2<id9P#I1BD&BD4H$ceA8KIg;Y|l%?5my-zp8PEp76c;!6Wt?etk5{rWZBFyM|
z(%DM&FpTCOv2HlT)Zgvn<`GFIwC|8INds-+;x%7aHe}PJa)keVRroMp80EIw2*s}2
zs6V}#P{=BMGiOxa&6lFyOIaJPxutK!lNtO65^gdot=jXu^t%X~oq5#mAU5d=^{BVE
zmu2Wec0U3wJlOJn4@mB*h4^kQnMc1Tv-u#5*B<heFnA42rWyJSKRa(4Fvr9ZcWbXL
zRA%2Yk!w6+LaK%_Xc*T32N%&0c{7DV&IJRD!-fun!EHycTKIkGIariuuxUp6t>9an
zLE3OGQ==UzqMPN>=O%66pI(PiMU7ati@^=bd>RV{n?{BSW_eTr5^IASXgur_Wg+JY
zS&r=q|0$6AHe6`UVt+L>-@ONJq`T&*cp?;9jt@^?w~ltH19(myQcyVjDc$Rh;`qaS
zqShO9a3?!jy#-V}Q}pw+%*)K%#V`e2uG`kmq8?b#q(9$!`@tmf%IN7!5vT`&7$rxT
z(;y%l5^4ue)H@!3>3hSm-=D^Ku;C|{B{^2_$obk)MBZE)ry@FoU(&(+l8)<_WZYEe
z%;NA1$olcNs@lVAFX$AsMz5hUDV=YN>zDN5e@C}!mM-Xt0>V8~-Il(TNUg9#FHKln
zcnL&9+mHfeO~ek@a1F)+rD~BjV}~C0<rVy^aV^tgsyBAb=KEG(N~H0C0`RB5Y!DfQ
z<R*u<c>pHc{Vmb$L{Z6HGf497SN{n|Da}rVH@KJymZT$C!&tv1bJ>~jY!NfFJf&DE
zyW-Ru)If4ftD-j)<`_l%MnTDTcmXRaWtV%dH~AsC*aHtu*p|(t!~}iE!iJL}8P)Bv
znINpzQ%>|MjC_oFzEdhvYVCOPB-zNm0y^^t{sispH}tbhyTgByog+@ceD`;SX?13+
zwd&q?FF=Z5jb3K{GgP!l`?jF7HC|@RI-JMVJ&YhX_gOl#iOV^{qM_x+^tm%|OZ1~+
z)zLS6Y<7))e@4%gKs@<yAvdR9t=4Dr!x~~D@vw>7c6~F)K$eUkyt?@iCXO-i3v(3m
z<g+l$FmBmLVCQl2(a}eKVfIm;d`=&S|37=rw%oR{<g@t|6FQDbg`z~sk~gxY9GZkE
ztSM6FMUE@+VL>1y!KMhB1Z8WpuG-qF{eZ374>@(7&em@2Hz<F!-90nF3;^CFTXABd
z5(^y6rKjiC-P4yL&~xPQt>g`zeGjNCF63Jb=;Q^-*WssIbGKV-u%jXg$%=G;8S8@O
z?4<7fg;?(N5#5b2&ct7d5-j87&+_akzv}_E%p0MW?$zGfXlQ5CQ25kB4vW~Vgxcfy
zu^e?Y;nz(@GTLp#6*9CO=q$&Z_<?PB%Flnfke4}OT0YM&G2b}+BW^YLzx<uI*y_MP
zC!2l^+JNUJEJJepI1$lM*Z6WGu7h#{-2e_1Seu1mUTxymIgW0f<C|}th}r<gKuo}~
ztfc30pAt<0!g>;8tG(fjQ!gSqz$=PxGcQ`5!#c3{^rqaxixkO&VM;cajp62<KM~)&
z<{Z=OWyM;V=@rjF|GOme;T;eTgF%S;cS%Hp=vyS0#C4><Noi{@eB8X)zp`Ia_fWne
zgxsqinEn0tIHvFXRZ;uu1x@!=o2^b7-T7Nop-<}jr|(5@7JTAf@Rn}0&n(b26rM$9
zYkX*8y~JZGX~TiFBsw6LOk_&N=VRnBy3N@$<2=Oc=7jZt$)67hSsu9nd94k}B;rMx
z6Wg85Vc^6I3w*yDKd{3bykREugfl~vg@&77bexcZ6>KaXKtZ!AP9~t@uL-BU3Y0P=
z4|doCsy~kNXwAI2ry4AAG;^@E3;%n0?OIXjKt(f2S^I8?a+Y7C{*QnM&!c=N==#X-
z?%F^608`)TqI!spt3A3TpF&F*91DsKFWBnvbc*n69yu22GGrs7v2b2SX88(R0mQE4
z&+M*6fBO8FcL|KHGuR2yoOFA)dUy!A?UcN#{&APt1L*Ei19@&0fKa$}9-LwoE<r<M
zei$<f1|;v>^Z9&Q<{J#1Q}@GeAg^S5kX?R6Z$urD<Cky0{guCdWP55RIKsQ`aCf4_
zQ_n5PfoKWsR$nin{ip#k9`siKRCWSO)g5-|_FbUH(517@O2UC)5LFJb(I9;3RUE_N
zO2wnsYU({3%52pH(%Fc>Tm{-@2X=Er8pqE^SmlXemxynJ%qC_I(E|m_oqe-vbn5&2
zO{3L$X11EU+mA%)R9vPS;Dt0`zN(pkJ)SZf08^~V17lJD<!bp%qu=0nj-v?^b?W4Z
z_XM-&g>Z8xdUS}%AnqQfiS{GX{CgK~p<&ofSg7)%qkcmAnxsP61YH^2)WnCZB5{>M
z+eFFhgtoM*0_t~Va)AIitz-l#lQewd_tp38?xg&vFVgG7DHNP2kt;Ms^r*w4jmZQI
zCJc_Qf23Eb9Y&LiBvLcM#1Su~wwF?V-0*s5k?A#a_VE2|u1S&r?4;pNR#BLD$S2*L
zMx@Sh*gnJXN3lP#m>@4VH%?rI-wjTHw9ppX;qLxX7uIrnBcT9GdJgQ$8>0`I6YHdR
zMP|w542jPdJOJ$N)vj~7>Tdqic3N%W+YDX+WQ9h-ZhG}%b0f{9x&r?xAX~k(h9jbl
z$gE0~z#Q2iG0=0M)YKV(bh?w!%HT|G1b#tYAit8bo?;y?3Y~`bh^?NI`kRf~DHxDO
zsYS~O70Nt2j3~Q%bdO2&tum6RSl6S^_%B=SvOIC8UhqW{k9oI$>ZR_TIsJ40qK5)q
z=M1gv)vPF6!;oc(MN@sx8~92WRfVx#7>rc@=%8MEMYpNMU2te+7+Gf!3@D8U3rB?!
zqN$&ZTA9mEVY2>zKseu8#~ii%A3xrjX#WFGRR4biva_vQw>-!5mFxe{G5(rB{3dP8
zu>aa#f3zO8|Jr`MwEwu1=f0EyKLwuM_44O?DJ_Yv!}K%?bpUBfVn9mn#S=M&pneb+
z_j}x`7voT86hrjT1YKInj{76`40UHP*Biw#7#yyF(J!=;_=PNCQFoz3&N~uac`J!(
ze7w*A9YJGH*(1%@9gmHXZjb1Ec`$+=dn133J;nVW{@4!vdFx#5v7c@0HTq4#PF|v0
zD#d%p2iMOOw8(_2F*w#KyfASv_RuHykG!J7YqrDEfxdWJag2s%&@Qul&&^QQ4cVq<
zY3}e`m|^pE{5!xdKR-(NY+L**0`*A3w1qHnzkVTF&A#i`2TmWxB_rJ>0Iwvx0+fL9
z@SSkXGPWfHy&;4-25`uP?}DLJ90Ys=iAiIF%%vP=Dud&M;}G-06qz*@X^kDWHhIW|
z^MQ!LIfkrbg&f<WO^$th!q(PUA-}~&4&bmm3XxMEh`2%GFBDuCk?n+$^AVB<Xp_)F
zFY1}^M9v(Ovm-|XE+7(L^TP9-VoCj-G^Mr!)bl(qUH@Ew5!9}_$F-&Px`<a2ac)Xk
zqK55q5K2mDC3Or~7)2&(rH-B=$Qgs`geobZ#^g3^i#+oo6N|cPoYxn=q@eYfcdJR`
z8b$>pV*r|_h^=6%<`_-B39+q00LQ&9LKNB*py=Zp9Tb_{n2D!k93^!C!>FJQoUn!w
z4qjxiL@^1Z!=E%}l@Lj2j)?CNz=)ueAvEYUgLciNST4dRl!YsJR?{%MaTmpSLM(mi
zdH4r)DLjnn*6T*0g6y9Hs4?1muoKiTx?&^i)M3RVb1qO%;6H@%#2Uh%40qU(Wt$Rg
zHE}BrJj;kip}p+QdqN(e85&xXJ=lAX0SDfg)d9?pD2{+7l5Ysjq{av!5tBRGqWTS*
z?e)59!y*XsjK&2fxL@piK0mATpBo+t5I@$?xsveM$UXhSwoT#F){#B`VHU7uqslI>
zu!i&;Xg~>S<_-CxXKyf?F8=-gd(9Ii9^EJ7)1SBTNDq>OU|;YlxBV!WelSkw-e@~c
zGJsVc(~&@AA{Ol`En*BL8kV01cDPkl9sl7-@Vpc^=)EJ{>h&>@Ug!XG2HL8PVy$9G
zu-4gXL84CyJDe0Zt=MQ3U#a+tqBIh+IEG(!Ha!?;<x+Z+i<JEN&Fg50H0gw8p2<}X
zyi;>aP|QEl93}=BQcns!Ng=uL5Ys)etuH;R{P~{+_<yb{d4o1)@c)~I82`VqzP`2O
z|L@{SV)kb-_TsuoOVagc_ktK`l|wj`s~DMh1sQ#eQT#*;kd~5MihaU_xB5hvUaZoo
z)Y_#^yVh<RWu1WwJ)>n)p_i|O0B*`Qeb%8(8VKu58e>OsX}JI<Ab_kS+WV}7T|w)e
zLFe5VC~n!aNlr-Bwn{-vj(k2O{y#>-#-+N!_I?}0+!!~+M5%}g;o0F7dJHpDdtFun
zUTYnn3!hQsNEc!D$prUrDiY3QsD@#3GRA7{ko$8DkrG=msSpwyTA&|1m*d^eq=}xG
zOiF)L&f-b&CeEOu6k>yA&ZLNp8c7`UGcJ`ODa`9By@{fW!$T`Il!=L#T_r?ArRj}_
zw!>CN^j9Fk3S<egUh0A(mC7;ntDulyR$PLhPL^qFk2qZ8C$rVrFPhbM!-z;>ID`VA
z4*%KdJMTkZcye+<CUxRr9?|I>+b>p|vgR{ci{<;4eV*aJa+1u_Xe#NPP#{5ze-bWd
zH9CSU5e~jqNZSTt<rK${EL;;(QbtTBvbY5}RMU$VuJFQX**_Im!*O3-qbkuzL(^=R
zN=CD}q#wWhX94<8ns6-K#!UKedpk=1Z9d*u(tmgHtgWTi)|e1gbTNSY^?zOe@AW@^
z`}g1e?fM_r|IM!d^ZIYU{m1p+um5)aKiB_v{dbIRU)apAKh77n^1N*5<I5%=Ut6qv
z;bIt<XV%;EORMKy=2;Ov*<&U&J|R(L7fYv72^Ubep+BWn(VmDycINogoY>mZ6YntU
zl2>zM8$bWG<3AeKNEa#5dHi7XIv@oycuucmL+8I5Z4hVhMX)^XO<s>z43rse)GDhV
zr6ts;Y|$fTB3WtYRKk(XOE@kfzg7dMsb%8?vV^`HKO?`S4wUvAV`6ohzBkAOzbY^T
z$HO5;U6FT4vXw-t_+xl2%BJ6o;;pFF%QVf(k$Gg~7`$}MN=?q80D^{d$^^xe2$h`8
z8TJijn}U#%)kkMh7?;fE#TgI-RJ%^o3v!?^f!5W6MlD7>#%V_`HpIGmj>V&@_r3Ru
zAowODn*{oyW!IZUP6on|=;Y57^3Tpi=Ixvmpq-0P`FMk&)Kk!I5%Q02DQFYInY3DX
zP2RC7l8=&@ok$=;y~-{cY+q@o-(AJ=iIIxo!~;4pNvOD_3cr|V0s1dAr(dv*S@hrL
zMvVS@yuQ7p|L)?sh5nC{MhDStNw?6`!S6)8Mf4ehqhZ434*xp!DET;rTv(EaUl)1!
z35dS?!aTk6(yVQ6%%B193ypHh#g&t2d38?Ef_jDi-BprE0;UoHw@^!(M872}Ny$pX
zh!eY#_?n@~v=~)6LC5I}pew6l=L<+n9FHU#@iP;aUoKsVH7HXRsv1~6ph`p3^45Cs
zXEFK@eNiml#tiyzWBYM5{s%nE_#b!jd|C7#x;9x#?v|w4S45hPFZrFCzanLHkODPX
z<DO4nGD#AjKce)kit9Tdag_W0C5a<R92k1MTSeUDSo^rsXxBPrW53w0wmuV;v%vX}
zK7nr3#*Fj7P}qva|Jquf|9A5Q`&LJKO%Tp^IxkwCgVcQy@?yg0q+|RY7vR`E3_NS_
zx%0wjJ8UpM>A5z0!4+Cz2cil60-cK*r569i^Xvq>Nl-qc+8r@q9>-2Ds0zbq(_O@_
z8YC2-9hoP?b7XVuqC=%K^e=3LQgeiM>rvP=9bC|PcXaM_gH2d;V$}2eXx^bB?Up_v
zl4{F9qs+N*eYJMEQ^pEv{T8rC%s})r0W#VChcF8{Q+eSR`S`$BF;W83)1eEyQ7V9O
z2H7QvE%_G@NT`XQXn2-<lRQ=MF!{ab`tpfC^Y8yRv;D<q#{R#x9@GCQ6xNsazjyL{
z68<ld)w`XQFE9Zk41Pp*7a?^ur_Jsy3}^#NS>)Y_-V3Y<b6R8_AC4cQL8O+{ei*$l
z2zpX@qNT%b2|NWk^RO)pTZf=xU=-vM2bO=1Od`HhaS;YeA<D&hL4^5Bx7U+QA{JAN
z{6&!K5)%m)C%o68-LTU8A9W*Qz!$O<Pc*@DAkYouv$IWK5tke@nsrjdFtrWeQE)56
zJ%<LbGHUY#?c*d1*LWq^-B?v2v-H(ky)KPLmqw#YqtT_&Xt0|ujYgM7qs#lXKi{)}
z{7;6NSh$Uu_kVHwPx!Uu|L)@Xg6{uh(30f^;PL|SE4l!5FFWWH=udOaXVNm3_k7DM
zzNmIQj5i6xl;2$^G6U|8(z=2E_ri`KXPp0!9&Kzy&i~D=rTq79o;yDOC;Ei^q7}oJ
zq`{Ij_#>!oE3QhnG--tB1gvN1aoqW(>cf=Wl_q;K#Xrv%^JW^mjiLK%=~J{Ie2Q{`
zC+o|P;sEA1^iSfIC|5e-TH;Cc0wcV$*nFK-h3fe<(X}b>tIV>M=>4=5RDyRUTk=wA
zJIMp;jeONARF&>Pm7{H{2h|dJP9<tb8*uJXRrK#hURCvF6zRis&#AXF3r+NP`n!<3
zvf*HC5<G)`2Nlif9Tff45)cu8ph>Igk8Uv_ba(o4bx*9~QyB;70?nAqJ7svkLfPh`
z^#5nk|KHe*%Kr+Fm-e4`@_a$^KM@srN#ieR{I7_{|D%ihh!PQGh;b~n)jMn{`HPb%
z+@3?l()#aBfGlwS^Z2hfXk+^MU)bC(#O(jpx0dJsojhwRDYg=G;kB`zV}~xxXQ#(1
zLmp%7>4iw>q5~k2Xu&J&j6BiyF7}`{tT55t7ym^1=s-lAj7f0~)ey!bRMn8q8!<&_
zIl;DdG0L&`z*RBW!SJs)_OX@=4|Y)3wy+Ld#SR-d!wc6(CuW18cj<P~Zz<}6;E{Xk
z^?KfWJb+RE(B<~*Sm?s>cLZE42HObLZv;@b2eit?n2s#pBDGC`^u)WwPZD{3&v$Jn
z$7^F;vs0?^s12jel?D~=W<ATjaEAFwpg@xfQY0wQ)$Z7KlAw`L2%v5R4cAX~WK~_y
z9-|hDB}Z-z2E~I6LpUCR&~dHaD8xRE8rH0KB<Nqwaj76?AXyGTMSTW<!&Djq*XKHn
zREIYlL1S0!#KCFP4RGx-*mvQhgA)Z{xbS?3ar8iOn5!<#L9RnZm>7Ad{(GDP%A}%G
zn?lRGHXe>R<%T$?`h0ecMxqCpxpiPRS+l<1dRc534Bn3#^<%Sal-aXa@X=tU`q8U~
zSvhF2gL<`WG@2BbzErQZ8s@Whs}2e2ViQWHX~n>|V(k?(emZIx%_gfin0a_qHKD$j
zs9scSnMO0mcz8v#R>?7_gVpLSRy7aJ7G!JHbJ#9c7B9)_`|QwYln&r$@tIjQTd%0e
zeX~`==JuhzB0DNJT4t$TEjHLuyKz)+Qf=5jAh=4^qIqbP^8f?1%Zy{A)?&?rVznCS
zZvAD=XkZ7lzCNS6s%G(7)!@xRZ_8%GD7CO#;adri2tdM7-8?c%CcYRy8PKC*<5do-
zr46fIYZ@=wkPp7Ia`CWOfj(wtU<XF1)NUAu2zY%T>uI*1HCtw@-7;9EUM~~cn?~c<
zEE&xwtXgjp;@V9h-^#^S5u3+a0Bi6W-k-IbCgP8fUTYbRMw^^sWMRx-0)_wwMfAT*
zxUScz&w#9Y;}zD6$e^Lfv6lx1q{EokME6>aBBG-S2rRYKoX{%Zv!!&F)r?BjtQfVD
zfnV!b(Mz+5;m&dJ%qHeBdE+mO&~h8QPlE=q@mFOo=V)k|xzCE_V-tbrnXxvQ5=~P~
zA4qMsO9uk`xGdI^yg7bya{_6T_S|^YDb?FBmRn)s!0Nkp@x&YYnbQkDhnk&P_DhQI
zUhG%#icdr+&e9J?I}f@$4@Q~n4ofpC-QiK5JNQ<Gf#z?g<G#(`j*FdQqtfhjvQLzn
zNou!R2+}^X_vdcUVVU);=Es^@BRCp;Vo{6zE~(o^tQ@36;utT>nIzOjR9PgQrw!@+
z5GiR=XXp87GZY%$nLtTBn+|*%D~y2NgwTQnR!oH;DN96A5*A3kp_}N%#(|##Q6Y1b
z&yM!X_%I;8O|sY6_yZs$#z3KXzWfbU;agB4fv+(&lT;|-Gpc~YX<-L;8L&|wZQ>#0
zd$!l3lho-WB`t%R`$OOi@JNNFp$<IHRiaESktaIzQ^gp%;wnoY7}aW>ZN}79ryDR#
zm=|~l!Dj_cis;;k`hA}`H`IYYEFMj{kz$H}$%nxEV@y@iCFz?w&sY&oYm9L_8uOQj
z@JE%F$0`k&c^ojo>F|#2?XqoTrhojU&!^k;=y39xHM7}|%1lMeqRhDe7WnRdHYU|y
zEzCFXq)^G2II#l2k|st8=m6Lu@icjk$3VR%AxYSLY_TqKTF;uTVyoR$q&dh4Qn>?Y
zrRNMYy8JB=%*`W+gTAb|co*PyE$L=TR-{;7z(n=0god}riEp)(=)XY5jHyVf=dd0k
zI@y?Q1JYBG!IqlWh1bc|k?!}5a`JtBLLGR@*D8EpOkSScz=bc5frVr)*PwSscy;?t
zTAxgSGP7?FsZj<DjE*d_RFKGuVE=ovQq!bjvEhdE(X1U8t0s^{27CBm^biGO(FR~K
zb+ggcGy^xVYH|^XvQOsOmtQ)_&XMht?T@V<oo<eUE5zzw0l^P1z->4=IuKm4vJ<2Q
zZ4RSz?>%Q1-#chTg|rS?5C~cX(tx8yOj4wXuEVe9kwG{I?m)H`(WK|AMa<?-7qVxP
zMb(<^<BH1%NL>ipcxV;EV8B=ht;&xKKkCCWf)N?hh{z^%>E?pwnUO`ipq1vdJN+BP
zIi1&DQFm-Nk4w9R7@NVa<nYB6!@VF6tZsJ*>l0bn<TVKFK4XSupYtWMLWYQxmlpRq
zUvErIKc|}ursI1w_Z*;y1+o>D4WpP>K$91B%BovrW{OcL8F1+y^3Pol2xfjmfwP_)
z9;s8f=e~7-QQnDEg(J7R7c{!dzSAbd6FncUjgFF8o4zvd+JrGUYM95!c+o)U&E)i&
zlE!5`@`1utH_8B~qD3!{yBmhs*^M1*a*|FBm8uHi6Ns(Ey*zHV$?X?yn7aXWg%iGB
zKTO9-08Vw1*al_BIGK`(f<!9Qjv#8}!IXRJTm^z4JWMTmyI?5ThACR_+YU~Vu19-h
zP6%pf5_X-Q3lx<cb8V6%MkVG)v{O2lLga%2c&LJl@nBaGAV=+{0v<1BF*T9m5#oK|
z<z%eY9isbT&r&VZ7AJpZH(d#uPT#mOA_Ss`d28sNojH*$BtY!R6&nvQ5r&>d5{Bvx
zmk(Muz^puHlw+Hp4{+2d$fYJ7c$1cDbJ+c9qZ3r{DF$a=;Hem^KUYI<X{YNi{g&rj
zIIn%qIz*39*o7UzYvM2JePm+_aI37fM00A@$nN*iJelMEr*vq&b*k>jALacI{teog
zrT_70>v8P<=g~6$-<>>Mh-hT?-G2Az?HL?Rr|wxcb)S`p*TP++Qgu&KsiWtWPU*lX
zJ?|XW%k8Ss%v7r8vkis;|5i8h>)8~Zft1$Shq+(oXP>CQ!^OMxh6x3~{gr1^zBNDc
z>{YY&JTWi)(<nAxsd<a#a>w||D79NCQqHJhDw!U$lIL#~8?Zrls0m&jHlP)g<dxnk
zWP>J+TG`y!JDA!xYvs;Sv2~DvWaF5j{tC5qVAfhqwl*FO*U%M1kH2~YpZ}yhM(vnU
zF%=O|DdLgRIoS8vKjU6*dlv%~BH}6CbNg@k^$O|COv46cU=bCrdGNstN`yF<5&`jE
zqkKW==VwFU|DU~oU2fw@7Dmzan@>^3*b+biAOPMZ%G6pA2})R|2o6C?_Gfv+4WL2x
z2tZ@H0ba(VFHW3@^8hDeKgf>#YwtKG&NHm<jZR*ws;l|}fEUU38e+y2&|R0TtgNie
ztjsKUI(M3sQ@@BmSQ<F29KlC5(?L9YFEFuaVWoK>`1c~nW){k3%cE=-p=@TN412C0
zA0IZj9Rg31bbjwZ?D>Iv02%@BAakMP3yy^Sb2<2A)riRV4nD_VY#d={op$?hE)eK>
zY<yp?d#t4THsU}G2-15KIssK-Wo{3u)y$U2g+bW<3=7)iD!Sp{n_WNn=XUuYdy~l>
z`dGC8S8B=qA4G!3{r@X`q60S12d&d}Mz2;lyA2(`PaM$v!fF4d>Dl>LWLNdcWGMYF
z%wxL0VveQ2bOg<r`9pKdId>`(ve3?*!ZevBj7nPH;6s*9&k3jBn+0Cw)p13Xk#ZF{
zL9B}L@>O2<m~y5vo(+c+P|`uu$42yn$d6PSxMoxF{r4h=Dv!wFSL1vDe!1iRP?mMC
zORrRd$jH{NA==rY{E}+)l;knpPmm-GG+IS|f_eZ{EpZOigWm+EJcS`ZqoNk9k%p%_
zCJly4n`a!c{FbJwrBhIrLvjfuXMEK_hO-^L&T`~K<B3d-ndz-38?Zd~&=JJ;(_7Bj
zle&nn0^v+1c`i=n<WM4#lIy_sE|jHYmeQRa<@@_YmL|8+qxxY!!eyZ-o<Lvl=CE~|
zrwfw{%1e=#-_8!M;Gx^T@Td6-6ptFiDnv+yShO*;Saz@7UjBDeMIS%E!{-+JzjN0V
zpo{MRswDLP>c-Y%{^zgq`2)p&0DWN#Xe*n^pjS?bFTE|#hkh3{>9FUc14roNF<#FZ
z<4J~ljcnMP!sZ-K{mFz4%F^S)aU0kcUPvfbvB8&*5hj1=2ouMp8&r)O0-}8?)n@xA
z2|T&=xKiU$k}W;hjj?~?SQL48hU0Q1v|jP~tqn^gbY-XtU$O8Qq!JHOaol%!T4LSK
z@py6Tf8S5G{1^7`lIt(+Ggtnr*5H3tTmGwVJ?8)WN+0wB*l!<tT~RAnM5!d|Vo&sM
z#?A<Dxgc2&qei-c6Wqwahj_41Wvf)HR5xKaafX-96trUW*Bf|4Z!+;gz8g=0qW+N@
zDwJpon`s3g)YZ=eC#wK^9~?SeP~My4-ebJcW4zI0ywPL4(PO;Pzh1nNam+9nIlaIS
z@r>a?j2b<3)Q(#(&@IV+HuPW@u&o?96rD^k@B!V)KnEbwEa8oZ7_j8gDRu`+yzK{V
z?;kEn=vG`!NI@rgeDvgPvjh8e=k%xJM(16<ZE2!-iHI-@Y)02e8In9^+ww6=f|82?
zZ|a8^{b1A3uo4YDzePjO=QUK_x<yOXt$9tY*KX0&dTm})TN}4%N-LC~lj@N@wKS1D
zw<qr3PhtAx)ecgy>fkTi(4ZfS?*+gd*LkhUeVI|Oay=N#t@(Uj%>{L<Tk|U~Y+$`+
zsg?FLD0hB+3BuUDV#G_7MVmbND5JTC_fObsyEpXWDSCZA6%!xtT?mkgpu|B>L2Z6Y
z0zq@Yj=Jck5#lxtJFl#VO~}3|Mu0p>VT4k?_=g+#(9_fn^}cLXaE4dTO-RRqr77;=
z=rW(j-~nvd91019MOmQ$@&Pu6R!_t&hB--xY!HSM7*I0g=te%=m2?L9Lfb&j>GpEP
zbtF_O_Y*b;4Uv(>93qWLnqCURA$M|+QE(st$B3<};$uayU`rqZHbF>=8Yzpn{*`v@
zjZk4;kAhQx0N|{FG>h#(qqsnv9vXj@jd$er`*=>pkO&ydIRJ>_6Y3RxRg4jG;W~YE
zp@)4yJ}_~>c0M-T;xrajnn6hkYT<E-@Pf%wqFQGAQ=C}iSFK~!#!Ky+J(^5!%$Wtk
z;y4tZMgrXrFlPdYj?QG_Vo2K=Fd}OIx$>V5J@mDvXPbhAQ;c8q`#b?&ST=*4R2-Vc
z7Q~Y$YKZu*QcxpEV*$AN^aCmy+l7qCNFDmY7RABjC60J7bYP@%nGsmLSzXAcIwRWh
z^4$J23DUEwVJgJ3wsl;lO;iQG!CDbJ8M&j-okF#us1!v;!x)Srtz6;7GcLq$252G7
z=dIyDp+ZTT5{-R!!L}N^xnq@DCN%$3DB8dybF<cKkl~C?2tQpQjZe{|&)Ho*k9R3w
zzTH3Rysw|+pBKYe+u=p&70;`LC;6J@C#yg-rn|xnd;NT%t6P6Ss6nil5A}NO4+u3#
zF!Q0_+W38;j#6f-<ssRWwYqzgn|xRl%&u)78~!YR{{o#p{aATwi4kF3au^GjIC7pg
zY~Du-)<#+u4ccst8~BV3jN}I1%P$;zH^jYN;NG6td8kVY@rzCf2|Rmq&J`<##gY!%
zB`KtXYzR)&Eo`f}pX}*zB=<k-wp_xpJ^(VeKxBvbHR8hmE-GS2oiI?vmzm>;&k_%4
zf5sj$3Be@+XMZ-4aLQuykQNr@Z~9Tt-J$bQvZo_o_!Bo^yAez-d`Bx5?!p7{G<=HB
zaKL39rOAzBtXe(>4Q*8Er?|AuQ6076l<ZA3{8=8($m{{`G$95m8Arwp%3nZoeitPr
zC3ngxDHNrkh=}vh%7hWFp_YdI@eqT7RBHn-2n~Xb1g=PU1x#Q*3xz2VhX=DEN3|wE
zMaNyI_X%JcIb)V?$c#E7!4MWpkwXThlona|qzj1>TSHS`&EvIwcpV-|tFX>%#tL7R
z<v3P|=bj$x%d$8CCq^5QWbV(Vli8F*)w-aG*K#rhctA0a{z!&M^Tbe;FW@fTDOonA
zDa~!=l&Go%YR3p_>&j+_{<()i06e)X<gbXQwV~LOx<rf)qn_i$IHstsAunD@6pFEP
zU67FEf{_I^`MpE9ZW0QGH!e+v=;sLoA2~RE(=_Huij$J`l|tiQdm%BY?rbpNP*s#z
z(W2`FeTjk)?@bITNLr9bDa|v-5(3}5o=SN*TC*~?5St3zzt21nr{$fN^imTzHpKVi
zp-Mui1j=wPJ%1JgaXOcdH^h^zIDUIW*9qddjiaxkcb-Z_k&Ma4c<2P@ykA7al1h@P
zA=w<=k4^|EpqI2$RBkY#1-)W#4t&YJ9Omjo{mBR9qlws+IB-y1B6W%f&-G(KaQ8(q
z8P0&Mj6uu7Ga9VGXYn(+oylc$<WJol?z`{1JfXli#&W!?Ob@H6Lv%vPAlXt5DtWXr
z3%v4(MQOxIx?%juYx@#A1qPs<`2Og?*OR8TImSR-nJbD_U@c0iQ$>*+H0z;XdhN&}
z&{R?ImJ?F}i^3oFr6xseT|5zSV_aORiX3)McuT9d>&M7?w3h9T{n`129RAQ9OfCJ6
z0e-cs2N_8_?DSyhZ6+fi9V}x@lB19%d8k+#RVdj_q<_iRT9J8I|FLs?(x@LEw)P^y
zO_o~S71FkYSJuYgKHE)eL=GfX$L5Nr*OQM49%f2s-rV8KkwfM?%tL6|_$EiD^CqQF
zD>WNwnu4h*F$_qa$U>Ou(Oi&!S(5k)d=A!?>$k6(bI4x}FICk*XkNBhW6#pinJX<+
z&#_%OtGl~#<&{=}(#UB;0F@lqht!@K$y#|fCVsARPE-~V85Os5?ZmysDE_c*19=8n
zZfMa-))L~f<6ImgJXSO&5O~xTY$iq?kyT|+lH?%AWx5kt<F+jk_ZYHNQBp=-M3xk9
zHj)p+i^7tK;~fY2OI){#?@!TE{cP`Fa*`DzvqgBVDV@0bn&`}(3M2v4e#U<KE>}ho
zOG=|sSd|SZ`G(fn5Ox<#UV+@7wtFa!{f=2ak9K{MB5~u_o4%S_XKI{;*7YWbtFS1q
zOApbI8y8mr@}WP*(0K~bCc2Tb3yWc}`M5xpp<dYGtP2v&bT&0llu<d8mM*=&DSI=*
zkl3+KT%=;UZvb%?7d6tiseA4<L^*mJyT`_m&5|Q(`oe7K>+qyGOyXaJL(F3j^cyLB
zN(m8&SxcEOT9aDFq+^)a3M9`IJ_LndsQqD1pVOEDA6DJK510!nb21jK6^yeLda}+>
zOu^9*xnYW&@eLK+;DRY88#*<XtAx=}$FUIc#ullP8l??PN{x)UG_#1U^gpAL&#Ec-
zRGdU1lQLGJ8<vUJ{MZjhq+;U>d9XlMslbi+mgYiaEwTlEiK0TJ{Hz)yKAt8NAUPT`
zV67HJet|V3$}kq~AIf|I)6sY3Yju<}m?n3T)B`2JNY4+HDEAZyD0o^Hb<A26N(+jf
zP^K`=q?3nJa||8!naseuHepaBQF{$GLZT+}`!vM_)Em;wLNbVO%CWdQrpySvSrE|S
zrPR#mE^cp3(~V+KNIA*WSYccYjjf?^7PE;ThMtsUQ5Hf=;yI8I-F~hn$QUPWd+4uK
zg1$#7n4-JD;uf1T3JK*w<GdfDK1X1u3CT&wMwHP^qA{`yg}n<96pB~^$X@EOJ%6Ol
zo}4NOw%ehS>g5c}6m9W?Q8eVBM;hBTP(eluFA|E|$19rTnoz@n{Ymd)vE9<NQkkO*
z(bebRpmEY^H~&Y2OO7eg&MxKK$qzu%37>JxDP_^^y{B_)aLw;`MTL<`nWqqcP%N^3
zDU72?hZU$L%b=l3XzkdeS?>jj^lc<$@Y$UdF5;4dbr?n^Z|ijuJBmo0AI?99ORuJ<
z%Id0f*f?SsV}~2;s*}$n4#X=!?~^C8iD&eP+$%7AH!pu0B~ateoB8ev`4Zu>5bK18
zVxPW3i+Q7?!V<@TJT9Zs*E=P&(X`80&?i47bwu=PR}xbkVMc+aFeZ%+s@gNz?$<nG
z{F4v)F6WcW57{2k9})p~IqJL(0$?Ot8=a*FuZn(=f%n~kGaF8KWHS|Vx}a1*xUI>M
zJ<JKj^5T^fj8R0?=BCfmcx@e-vgGzAplqi~Xu|^!N7-DoJCzhU#B17=Wo}fEJyE5f
zu&}95ML?iH=|u@mmStF-m5?~&lLM6!HM~J;pJWmrk%1ih9a|z37b&7<uMG#%jIK}l
z66*Ll3>Z63SdR_Uv3vskq-oDur6qglt}JF+WT}k|kpYU9WQ|BUP8=$lcZT9|4W7l&
z(SXzMQ)2UToM^Pkqv1>1T*SE(bWviH)2@7Eo^gN0N--bx4!UQ7=*ZE+bl`Y&*6^{y
zCjzpWY*jL@DAxJx#-2#_{VI{~mlV%f>mh~Z>GUbm$Wv(asTBI6^Bhxz*X>z?-qY~u
zpU4yhg6+_h%uK(u=^Y7i4xKGQV3JJ8*+P+tn3{7OpM6O^L&F;*dNki5Bb7WNUj}Dv
z`Z6dX|Ia<$@wsNPcbe+nAgLpy36STx(@4io#U3}0i%982>J(PKnU64iJpBhk8T^f7
zP3}#Lu@<cl19AH@LpSKbpi__d<U5VDX!irzJC%Wv8aS7S$sNmJWy#@9Zc-S4B#JZ!
zfNR&bHi7hEykE4_#GN7JXAw*IY%zuyM~KN0x7#8P(J912Mu83k5QmDCoS4sa%9;64
zyHD8WA}`BXCT%KiwKy5rti}1(9fHU~dVEBduz>JC7-8R6`52^yPkJhpUKu`S0K}ym
zP@ET0BcX%HjKn<4Pdk8FrrsPR7bm0`GAaBX9=1=}%#id>*JdvsoaI_AF=^nQoXa8r
zG3L(=br7EP!v+YD%g~iS^5&f+AhqgB6x}i$)}T=iZdpZY@zKbJe>iWG#6Q2E6ooUp
zera1Sj2gDdA`+S2xMLIvt>Z&`05UES4Rn5A#_PHISlB@v;e2QmXmR=yMR~rU{(E$)
z{&!L0UpqVi1_|u}QWnJPhV<H7ojiMni>LDRS^o07YQ<QVmtt*KR4eL;g02e6UmDxE
z(Wz>t^fVgt9w-68fKAgY$cr&AMN&sF$9YLYw>r^lSv7RRBey*JWz|Wk#MKzO5TKcu
z+z2KMnp+K{QLQ3_TAdgVC_RIkRGPkL&!Qi?2P>*(sBO)Cm_YKOvZzVAl;E03ArlJV
z!XZRdIE#~E8g*sU;#Z}(hoq%{DPq}651f&Hv@yn07EQ8Nk7m6KF#x72l}=?M)|_2>
z9GafKg<|fz;gCHLb@sW~mV>?OO<^9>>&^y0CwS;D(J`;33@{Z#m7?l5xqC^^Su8X(
zya3J3SdWVL<8yZ!0%RSE+V)^~MB_9%*3soAmrme0eXo}$zg=qVq-?Hqm6~eS(X^nR
zz%FZ?e{%>OBBNTVZTwOctMFZ?X~e<6Zf&hbcs4ZMA)&j%YAqtw4?v{>r9<LFGEQ&l
z$QIQ>BJvOr|0r(&FU{tFZ5`?u<I3fwN;~s~>r9N}I?KsN0`w{hAe5jN%w@pCGLN3Q
zUQA-6V%aiV{75@OM!aveVia0V0VgC@Fakg-xbo=&5{%rU+XmRBiS8tUu@BG}4bP7l
zI|I)OB=c-5jdJS)AT(;29aLjD_?aOt)okHX5(u8<<bgnnj+rv)G8{{KBYNN#ihN}s
z6fRgzxR?dUdMMFq^!yEXU5FVL75=|5$gg0W*+*!Np+9nkyTxoTH{<Gq<{xi7Gfw{_
z)1hHgjOP15o-eZV4cqOyw%3kSC!+&r+8`tdUgVoN)r<(W-H>L$5LlK&nQV3%S9Q}Z
z0FfxHf#!A0givzG@f^*64vED|lMDXPny`eeG1oo5JsSZ`J3=|go5)u;-oZxHfA$@o
zLE?29PO)2bo^=bV{nh|eN?=T>^08B~rPkgU_CS(>T~Nbs;+79?5xr&cfujR3J~osC
zMgK0ka|F+ztvymX$WPH@S{->Ohnls+iX5Jp-r#*c+&vzRa!#x;WxF+-$=ZtOPEdOf
zawf(Wr1lqhNjpZ~nGkc4glkd%rJez7T5~DMcbrKEu_xRSLT}^^ogfN6&;wx+*A!0x
zp}>664!j~=Spzh3pmwIW^MM2H-RLet@`WL1fQST#UbjcuwQ?)*iB5>?heQ9WEZ%{#
zhc4%$?*(oT(<{;mwbE;2uHOU=kUU-VM7K>TH@_%JP6#w7?eq?Mg92Faf&f$08buSE
zI3l-kJ|E|BtTCQ`0EfY?8CRc6?l0*i8?l2>QQmi<D2YAM){5?TZFmr|K6>QAqv(K(
z9yQ_7)&^{mQ{#<`tRj-`==hyZhN#L6s+b35^zbZd$9%^vCAAXJRIE0?gX-_ypbH2X
ziQIQNJG3XUCV)7N1%X7)t0J)=ti=L^4(}ro)O(p&G>L^0trIV9yQXV!{LnM~#>gL(
z4jzE=IkEx1;Qe|y4>8$cbznIjAdq9a9(NVW8oGkk($tek?jFxZ(c={5Z$<@l3F{ap
zijC*MKz3v@4KkuiP+5r$4Qrl^IN05-#3hX^b6zz?J}_)}=RP_vjiw#CN6ZujB4n^1
zM+|j%sQUD~r*_&4nhQ|G@`Gpbeg~%dWi*Rb;$z{)!&u||v>kg&O-%#n6=(=pI#Lk(
zgS<?XLzOhoFz#aeXoFD^P?&jr$E3Dt{G3%`&z=f2tj6KjaAlcTQ(9K7FEKaj^EvTE
zpUHSdya+R`ABG2AD#<RHR>Z@D=3(-A?4TJxJSSf2Of^$xik)EP1b9yisc3)&WKE|x
zo~A%)g^0|nu9s#?BkA+DP@9f_hG}{=z%gf@m!~59+?JA5FSnp3{3Iy~KL%BiDIlZI
zB`Ax)%Al@f-<k9_OQpB7Mf5hypto6^Vl1DOTTothLtm8!X9f|@9;xu*sZcxC;1Lcx
zT!J`-D&9F6b5TkD?t6K0_bY2JSD)}_@7XgnSRi#S<kIoYGy^Uh_*el2w7m%{Fjfb4
zQwspd^f}Vo{O5!gqs$0(X)dPIB83|OB+Cn6MU%_UJk5v=9LiN*hk#9zUhSl+k~cYd
zP2(@lhKc%sk9Ks@L)klttR&|%e-@g_h6Z@m7MiS{_CRfTT9m;~p`B&HO0w{$w<6T*
zAmzg!r|iK0-@3!0|G^K2eVX^3ot=br0o}vVuuyl(LcP^d_ne(O)S>n*J1(APAV-}D
z>Lr)dN~rx*B^@WlK7%3c0>pfv92E8^_;q3*$>?a?aKhGNx))j=GPw8*txNFanW>W~
zpJRDcF+tZZEQg+c)1Y?|<PjL^vrvGh)%xJ_(CjPhFHzdX(yl(HP>z6D9A3#R8+oW-
zf_CkcNMt#KGQco#6`*wu$9tQT`0RuDQx$@ut+sr~ES>H0pvt&^pE<CN$O6*IjO=bQ
zZkwnC>6Fjs6Y19o^-nqJ8ldtibkcXPqZ4VK8hq`_q+nfF$1D^v^8_ear79r6QAgE|
zBn?`=k{xhU96nL1F|%-C^@2W(mMvYJgDXNG^|UC0f}(?PMZwC{cfp4QK&YaJEifbI
zp=cagli`aHxFL2<iCgTz6Vp#Y^9q%8A<9xrGexI46etB4$P?QvAYGU=i|tVQ0qGq%
za<07*h%OUSt$}fda!v607B&X-hSs53513839KSFZFE4(68DO+7?kU9*(5={gC2~f|
z75liA3r9|uI{hInXY~^h9P@qSqpM<O9HVl?d?nf_Q(;KCHkIR&whD0)v?x!bUTQSM
zbgmu=O^R`#ZySBLj}44Es$|97F|iENORQC9J=i9Evs=`qxs26X6rInVy<${J_JJw<
z>3QK<H5!$y^UbaeK?FQ{E=$Z8VopU?pA|zu;8P|A?t&KdVB-NDw;fJ|h{Q2hCi3|O
zFk~6~Z1K@&lJKm!=<sL$`AgJXjGv~3QCEy(3%YA%=wG=Q`-F+1$$}bZSV^bGSPYM9
zBPHcaavc=K-z1sGFZRZrkgxO(fBqZAh{|^HXCV&uY%;kw*xbg$gU#()V59#6TB`A^
z(oUusR+-V)Sa3ppV>HPZviK`;Mfhl@3B&_Uz;<3Mt9MZ#9liVBd{>bVWuFL>d+m^k
zoOTb)Fs>3{TKhqBK)`FTFH);cKsfZSRl*b<cT2-&L%Y-GgzB(=MVk`~q*CaNb{&;0
ziqC#v?>eXBAKpKd6TcDypu3pU3?kA>)K#^8G{ahqeGj3)uvQcxL=ROw88!zEsmvu+
zn=q6JG_2XrRoY%|iSm@-L=0=lHsI?He3d6RBb4#vv;%};t;m&(ErZIKyTPzp8ru12
z2}GH#Ycll6%}qKLx<Gk&y#Xl>@C##7$1wAOb0g&dn<Bj^7Y-n_M-h-lFvJSy$I)7V
zI{A$98BP69?$~HV$=YMeR|N%Nw0>|?6h@jREfX2fXm?l87j@>_c)J)?%9;?3j`SfJ
zz8MlK^l2fTyb=+D<^n=bDPkJBpRzbWX_94(NPM7{DCJkD)WNJ@#T<MA2}31*;B&Go
z&W1ab0mN87M{6yIb*!LX={~8Jh<T`HMj>=L<-W`;5k)Eo=XAwDShfHpA&ayaC2HcT
z)NL!LGemOIZ89{KomHdRp-xMy{m&$uv=tygq5yV4iNCyy%AL?l{LU0)vR93sT}+1>
z4t@H%S&Vi^Vz<1b5iCqmhJ3^wz>2D3q!WLwq{X91TC`mlq>l+TURWgnjMb*9WCyv}
z5?Zvo%f({JAc`{N2%=p-zL8M4iyT;q;$3K0iCTxHJxZSGXy;meDkaeyU06XOPRNa8
zr#p=K@AZ5<tHnhkiGC0ytQpYK3^kB+8qwwBnKJlkF&qCTct$Ih9S@VBjb{_Pg6_|N
zRlWOcqA+wF(0F<0(3~-b7)4&tZxv;-)qMEuZw34bFMh84!r^s_XFvN}5ec8`6qqRD
zh-8p{R+#?9)LCf5kRsmSq$ruhMzV#)NYN7;KLnHO>~GH)X#4Hoj5i<(6Vg6;lWdfk
znNp>tEuuRKLmA!KP-IA<UQea#pedw{DRS9a5^)HtiMrdOERHI@l+_E{A407L*#?^k
z4Xq_QbjA-Yb&r?2XDm4Qg-cvHT)M6T+506m*9yNiUd>@RW_*N^ax_x;Et_17*@L_b
zAoqQA(x8M8n0}OdpPPe}8i3~W7T@N5z}^NhNwyr0m70_dR8+Q9Dp)wMQA9-)no>}-
z&^ap?<|y56*mEXk0w^nNfUG(sG04P`V}D#CYa)plhIu7Fbwh3b^w^;#4}5^6e#SFe
ztw=neE_LpBx~C}jar`m(=#<e(2yvhLc>Vo_dtG9w>Q(L!ZOBb=+(100TS+IWv4f^>
z5^JxykGY&a0bsJgMP9P39@0r*l5`UI_|Z6+<43vJQC)^d+Q*OI^>W44$^63y*~|Fp
zPCD>tXa+4Hqgs$zEtpqrnptf+ubPut&6!uNn^~=!S}paghf-(D<p4NMo`q)l1*XkG
z>KSO}G+uvKsa@xacE*mvqKS>9g^7Ktlpe{a$<&UmQWAF*WJSCYz5mc^f!Yd(P)+gl
z23ET0d*_&chLgWgWVrOIqNAb;^04ZraXqlqbD?U7s&=M+2a(KPQn5RD^lzTp3e2o+
zSmfu`=y}zAUW=aB%;)RT^L6w2M)Z8ce7+ey-!z|ZMbEd)=iAZqZS(o_==pQ=`HSfJ
z3-dWH0RC1tMraMatBbrgidb0a=^}eZ5ep%GU1Z-VV&TTsMH)sC3rz!E<iIE*F{Y1!
z?FsyBY5$H;mo)j2s;CYrWXezZSRG|VSJ*{)jwXSB9ylY+Yg8IK<MSB??4LA_4-LO%
zWt9R|SAdc$awwT$=Pd0_CVl|B39v)fgFjvm1|P306}k>DoX!S=oN?k184)zp)-5V9
zoK?OhnD(+XGe(Mq;PgTzE*9a1KO6Qrp_hI9K`kY%A-D@hW&lgbDI_fr_WoBeZ4q+0
z3%t)ZGD#?zz!86+`H?EFWCK>;*%vg)MvT@$EDv3Cys5#HDsyIE3ER=>N|EpIQ3=$U
z0pZzbBu<cPGf9SQiebYAmy!o=p_q-k&JbN>DUmV_D#R+iA)Rr{2TWotMvTb;7+n%0
zaf(oa64DOaP>`@tDuVA%GmI336I0MYB9tZwB$+f%Q8c|_F}e8o6jz3V>>47pypsCT
z?V;+kYuW;+?MMPo2^LZMQy0+kDKr%)=^aW3v0g|xpgl6$dGLcfs4d~hR?#ip;hBs(
zdvF@9zwd&=!AdU$|5RoAcwCu4U^$+QTzch@YG+n{incVMJ#OP^S{r?T>_Qv1&4BEg
z3dKqvi*Rl^(cAkpW9u7iHO*a!@96k@mM0Nokvy_MG-R!Q@~lew`qOKCkXkMC<Av9>
z?dGwW8qC?f8dxu+NJjWc9}Ir%G-K$B9K*EvAy4I9^1Mn23~~Ug)vdy_g+s_{U_G8h
z$o#~oR|-$^aZzRreS$!yIvuIc1l_0B)889seQDD?&%ul(ra9P~#0@CsCshYYbV0j0
zDhoaGfEYhbNYCk20$n9ow#rmjnJ!zUtE+UEt>Wk^&f+RsX6bRj?4t7NzIfF6d{TPS
z%Os#Af#ec_bLIy)AMRPW_YsfNI<mQUIdbRngY1>Fs;wvvWo1qE%u^o%j~Nrt?l*c@
zU?P^5D>umSVZ;w{-ReRdd^4Y5Vf3@HaY7*X?KzOohb(at9{((u*h%)hCY~Cj#BJ<O
zJHp4ObBSXvM_4eF+|%4Gh;#uUk5u|6r_%Jk7H%rcghh(;dGr>IQ}bR2^IuQrzpiAw
z#?QRj#m^k}pKhu%KPcDUr)^kK^BNED+Ip(_%j*8F#IvB|6xvFaj**%YjLR;%Mh+U$
zag4H@OU);?u#%)H6{WFz)zQk5bppswi}^h3WWX*~<!K-bff><HW`jy;NM9JyQ2>|E
zKxt-tI^!hqNRK9hBw3H2|4c)}lPWp0$%1P1DVs=|`WeBczojt`yx<9Scwb#2Xesc@
zr&cHV#sFM>kYlz($$MhRwrA5mN9VljF+|Jm;;2$*g)6{=cMOeLVkG0t$3kr4%*UE&
zL%+06*3`3?X<B=VGyl6N^_p@SR%au$Ny_sezsC*ZA&T<%ceNLPbUYOK8%xX1Q#9*7
zjb$+C`OsE4@%btqU411=7XNhWKb1$M(%5rAo;~3dZ7wR5aO6y|a+p^aEf+=Z!q36q
zN)`UrC>EC-S9AhZcQ61n(imoxk<}b}?gD*fb8LXiRp3W8x6s&Rokq#?BO_#iV^Nin
zOB#G4gOWOM;){jHc-;}*<bcOouG>#ZmZ}Gx9zhT2j^$4C^+^=FOvb#y{#F!T(G0RP
zGg&6w02A&S@k3wkLmv75mRNA?J-AEOemwt8VQ<>O5Z)&l$K1#q^N2p~T>qbdX>CeH
z0@%~WPfk@~XBdoJ0P>WL)zRhos=X6~1msCGUqm|hQq8{s5Hh<JuFXp}+_9-wI~PSa
z-eE<ol5R1=s#*S;*kod^tfnwG2tJ@(4VUc2Y0lK&&`BAaDS`N#UK3$WIXc33Dd~*3
zGxW{EZ=p38#w8l5I16<G$|Tz2o>`jMCkC;9aa<yVcSa|!IfYT>VY2|S9|FA0EKsR=
zmCf4^<lPxvx|yVG80`_q#0)v#;gHS~bW#vHVRw3g9}3PGD9<56ndY*5VPBC>E)isr
zzfmr#n2O>;=A<&NMH~)cPT%5*%#|zK#^TWDl^O#DuMGS^wImN@LV_9NDZKF~vgQ}1
zIsQgmIh=!W>d&N~6O~0~I)(*H4hVFCuq@A)Z@^|p&H&R0Uy1uy%xxd(2>yYIH_t`Q
z5`~vAM^<$$1Jc9EG>Awtr72Y!%h~P8=6LT{ZDI9DB)|t)e&sJPOgU|Nm5sg8KJC1#
zH;)SNmM-~m#rNT~@A>76SJ9&!I&{FkHz{A_jHg3y<V{0-rZY&M9i6os`}ykvUqMrV
zZ-y80DKul<t^AuI;o#c4wgXu3xT8=MH-<eDA?d(!?&ouRu>?4H491y-jO>`XqO}b~
z+t)Q2H`Y;Um)>jFMeOinC0E>#u4^kRc0I!9wXtX|c(GLixmYub%mJ8vl4F_E7XVy~
z1B~#lC*Zxd7%>!7xAP{UYRe7Iy3uU`6q|7<pm_vjO9JvT6_Uvf7Ire=hzb>ibB+gS
z=(nj8)5GGooZ=TiShXQ^5W3ntG%;}3H~+ZSpBw%8q(65CKD@xg-zA}6Uyq-mL_=8!
zB2h$=Bo>lzc7nuyu2`+D&mFmuhA?zp;L2Bi@X0v6?V`N_jSjb4kkIYj7i2zHD&?|<
zis^K&iz>qPyO5*b#COf&cTK2<Z@h2dpTon}(VNb@=2208tN*wF5!muQv9MLip8ryb
zK?d+7%%vB#+WPu-t+KxLd~;)ad-Hkac`=u6KFKA^ZsTybDhkD_qzV-N`MdBJ^x(QS
zSM`IT|GQc7yEDS~S@Q_@q95VgeK1W-RUZhl6Gga)=r-q}d!zPZ<Hgo??ZsxX`g~(!
zYkOm(vc0}td9k@!-KuUP@avm*BvANmqR0rVhOWi+Ty8_f3N-MLofS|MC%q4(v}teA
zR`Sr$-WFIPkIhLem$!{B!_}|pGH*JnzV!&MuX~>31G~%~$MwxJ10nMS2YkT;Gd012
zA#B(T4#7bVmn5JY4S9byvBqQu=H3*mmaQ}aFBdD9%TzEExSPbTc~i`J>AR+ZYBMM2
z@&K2XhPbp4<n<WH&SDAfE<l%ROGC{?7l2)}!FDp_xO+lfTb4Fzi)o``LyYiNAD%R-
zmCDl83`PGK!~u}p0&rRQ3!-~DUP#(i+F<3|1%f)j1uYbz91KN753h?bfL9L(W=wOr
znfo>sOej-?|5CtwNOU@15YF!(3QW>bKRO@BA1kQq2D##PD$G&Xf~g5y7tP&lfpA9k
zf#5NfC}yXO(Yry~=zRYXKtf+wgz95Jj^xQL(Y6DdNy6~zMI5<p^p&2C_CpHFoKiZO
zDn?fpF+3?{DJBp(2lXlBP|3yKCvb$t3gmvfh7oo$hj-4r4abmr_#r0>yH2Xv_`$qO
zGZ{dJ**6_AaIa)OaMLb#A@hC@ya1zPuY6loSS2f&yx18pU<eb(VsV3hwUTPgSLinH
zXw@T2n(ZSDn%T{+i#S_phoNZP<15au@e<U;6{jg~Y{n#n@hfiutQ6!k>=|dV)crTH
z`$MyiV-o~mcaMai``7dQYFA_oA3u`nHQrRUv~%3}6I=k-@{-$R`M7->fk@c5t>*Yd
z=4t)uv%f9VJp-&Ry-l6u&-2%hjXw0ccE{5gm%)$ZG`ULs_1=Et;LY3Se}1`dpeMub
zUeyaUV+6_BH!feyS!{N97u#EoMVV(?)Eh8iKbWcm3^Vb`U)*uu8<17F?+!%VAWT+U
zRLLxRtrhn}*4%>8*1tV|eveP!_Pr1ze!D|=t?y34wF{4)tvTV%xYwBk-la2j%NO_P
zqXM6;tquIQy1iL3|D{(O8{7X@-Kf^KHaE9x>rk#%*{s(7O;jFilyg2ajCK~{-)7y}
zcsiR?Zo&IM>1U065BB`Y4JT2=2)A0L@}g9$RI5eNc7~UDhULPy@xU8;lZh|Bcg9m7
zl7FCw<M{}$1?l^ge(_aWTh)qe>)3PAhJECNEO9aOLh=2iH`YJW+M+;R%nE|dVK`Fg
z2A5Gd(h1V(H1N7JItaug96W^c&^c!o^jvx(lki~d4+d_bfe&^kc~?BP!co6Hc~=ug
zWlYc!a%v>4??-pgMKN8-i#^V*kCjI5G|DR!hmCw%Bv3uSFTG2FA*%Bxr;8acdm43P
zf9mzzqRKWzsqiW1I<#YUtWr~GsG!&0&;h9}C})8JT^dMHpva4<(xB1#kQk^tL1To)
z;ivESC@RfSGq(nlLZNJEeRKoQ8HN$|bp*9J5Iw#l*Q1IQVvTWL02PfH0FIv06nIlQ
zs^T_$GIiddlP?}<Yh3%7mdwY?t)M!<Fv0_FM$Z(_u7M-EGVv&3BJ>B-D<lDfsPH2X
z=Xz)iN0JMWrp8QNVJJsHo<DD!ZP9KWoPMaEGz5G<K54yg?l<<u>!09dL+rJVe>!Qt
zd3!3}whs3jCv8zb+J~n{rzg$VXQwTAkgK<$W{y@2ysIDmBpN>+pETNS(K->$cgKfK
zXb(C#sUMv-8||WK9_<~T?Kh9!6a};)j#{VUu=%ce3dK%aMeLW-RV8YQ)`57}IN5s(
zKkKiXht1QUsLO-q=@E8!0R7d)asA}9xp#J0KM}`gC&#TewT9!{Z?^Xi>&<tK{W8D+
z{ffr>#?h&0zpWo0#)jMaaMU=#0a#;wO>G@E>#q+R+#QT|zj@NwJH=r|-}V5B0OTR?
zvE#;G6TdWmY`}=>CqEUTSz=eMqjux3XHX8_i~ah$`WqNyegSr1hW5@*8t)MB)&aKD
zK6~9hZJwT;HpH7&YoE~GZk)Vt?lsyk#bK*Wh&yXHiqOev9lOU?0Bi6XzP~<eHxYk?
z^rO?p$;sLAX|r`yfI0sF7y=yB@pznY-8!N%1F~8tKViFw44R6f`0%y?&tcAw<nT^U
z>WGduAaL*0ED5~=K2MFoilfGx!{(dD(Ov`Jwy>cO&32=}lh<rxnI?Dsp$<Kt;qYnF
z05<+=&~lNcRx}SpegAzEf#<^58jwW0Dai+(w$Jw7O6+s?B$O@3C|q_rZ(%}#YC84y
zPe*&5<CEt5`e~!{R{ITPmxziq4m<Vz{mx0FzMt<+K{s0V^KpgwmH2JxDj99C3=Cp-
zcyS6W5jX`w^76KAP-Y#hS$gGOmYsh81hnmfNIWtMp&11_;x^>HfFfThSoqn8|04X*
zh_gEFyTf>=^3j4$<9*_sd^mw+b-PJ<kXd<{d6_#iAMiqx*woOoyUdM&r$v*K=vO_v
z<@D?wHtI)b$4hi76Zn{Y%12pU;s@TCMU}I55~wIy1BJwsw^D4*NNcI1(z1uz{557w
zL$F!-RHI@(aSGedNvGLvH%{}@OMp5834f!>EKe^=ucnus(Cty8D*XV&g<e6L7VU-s
zXViAy>4BVNw@e6gdW?#&cj5MDL-&+~Bj_(3u!4nhf-kj&sA0r$QLJ)p6W5=koNI*k
zUU@Kd&O@QPhMnRF_RYq=X{3pb3Mv+btPL{y2n4szl<}|J3F8j+b6XgX-QG0b0{S1)
z1a~^oobH1p$;Hzq8V3JzMG^(PJPv#e#ou#=L(CEoW>%5L2eN)<?jpDw{oZQY7yD%E
z|0v+SX&koRlt=yh^)X-n-`v~+o!`>`tJ~|9%}4$JYkdCl7x8noTq#$6$zM#TlW=Ek
z?HtsYSr^y$8dHLzh$)^nTvF+RD2aTnQmd3I&r6kc;Dz<^*q@DisP(<&@`8(EwiK^-
zf$>nG%40$nVo*+w*Fi3A9}2m&QHv}_j<dk+|He-_O-a|Cq5<K92kP0CZtEMdGj;mT
z&dN%sjyIQ5Qrl0V&S;DY8?P?##@68^(j_Uo3EtV|mIa4iXr)!&eoKC;q1}eo9r+4$
zzVmB<DS~lZ!W7e#qy>GW>490H+z~tB#0fs(^?98O*9oQo^Uv=9H;y|LZ-N<!yFuzS
zjJQncoXZr7;^&|6R$B4KpH7FK+fA)?gGJ8$LJ>NFZpG1T+;xNV^d83i5}Ss?y;&&U
zxbAT51pV~#T~MXR@W&0Y{r`kj1PcD^z`e>C!r!PwmkMAf@0}su=sotKpTHld*11$=
z&anuM!vi?Qe&C$@>}r}?uOGd~u3DqO6YZ%B6Os-a7Lf0;leRNHANl@R{N$w%1-8A?
zr@$FZx&8kHGWDE)T%;G4FQH9ryVVCYy`2rG=YcyG?;RKnQ1n|r2&bvlVZh#%k7s){
zGqVc^Hr>AXAI^m{{JWD{Wg6TJ*liR$Jo0*<#0gMnkY4%%QA>^g)e}Dfl<Cv$U%Fio
z(Xho&?xi=bR;tfaOX|145`I3w%T)Go?C#J{Z`tNBJx=evc3CM`H_Fv=xh&bu%F62M
zYfw&pKn0X{ruOP8te;i!D^+bxh<p4h#{Lzi$kw+RW2)qV=MMWJEcDix@9R_i1_Qdt
z^IJbBnFfnC2YBh|(|~euV<N-hjSS=Y)#tuI6y)}QrK?pb@<HFPN`uC0I^hQzC8J6)
zspr?S$hTcr{47%?FNdX(H(gtQ-raQE&5iZJX79xdx4Y5nIo+;X+lEhN(A(<vo>yzN
zt-)U~CZY6vtLv=4=&x@(&hy%f-t*q`+Exv!xEq7Y#*0DsaD59!+Ewv-HvB|L;ndDu
z{K-d4m^3*I`O=9}6|G}t9&z!j_PqR+ETT9Qlfa+)J%1?ZDht5tsk}9oQj&*w=mtWc
zw(sGVpzUVzV(r#gtk+6-Pv&IkOr;$c3sZV{(dD~*05(i=&)EM}T?+AQIiipgcQU+b
zb#X^IP`9F%`5xRlMhP+LOr1}_wtwY#ieHH+&}b;LMPtO)$fZj*fgq3ED=~ojGa!(i
z)zy`fXveoV7~Ibv|FZRBdx>eCz-n28qJ<*YdS2OFwiXoCwW=?cu2p@ZYi(4QuC-A`
zKi~YVwjgn*eXbBgX-rg*$lX{PO;A(~c<aT|Xo8}u)^??~Y%M4n)k^1;skNT#TGgee
z1d8g3tSvv0HCb!q2g|S>tQ7wH-*>(6yY>1cct-z%?s@L^pTW#9QQS(>xCI3vDV)s4
zCAy71MM6|dW*IqFE}4pi_>P3x<eQ88ad{MzrJ(GHTLo<2Z$1z+RfYDN1xbLLOOp~5
z)nvQ1zI3gvbv-5N^4!(cRXLL5%I<8<nN2VJU~RNUBdo_Ic07K8!A;d7q>;%zQ*E|#
zRX$%|o(-)>Y^b(;t=bD7-W?=KIXJ%W4-aT$j5H1duO1F&6r_(k3H2zA2EXz#AZ+JB
zNZB57W0&FtzAwu`Y%b5YH#hG?gs=zgaXLUR3}-GTPo}8w@ufdR%A})47Dd7W?ocpp
z^c)$Wi4pG)r`!b;^bWGi>0ukM1P`3RgEzdKmYELj8y3_H#H&IW(#Hp=A_X&*FcLe&
z!2TH35W}l2vm#_~P#8JLtw{!OZ4<+?^m5=`>rAp3hdKax0}nNSRsOlZGBnHV^a^9O
zZDJ%x2QBeL>>Zx9Pa7v%1{DJbrm4^I4lH?+NWl|x3sga2>_%}Qb#1yg^rkl;(M)?6
zFx|*op5Fp?C@k^6zRc#PKv{n-Yi-<S02?#_9{urI`>hy(9O|5tXJQmffvXX-l+)q7
zH2v|MEVCZ<oNN+zKwIGj%st*5d5mX!dne7;4NbN<H(~nJRBzK;m3l)#5@nnEag%3v
z<2JLqAyHagW^2$LuVcq=VLvD#m*@+M$Hg=9G3Q?oP+SIXI03O27w3yxzyyWWk~!Tw
z?i{uD8;A9uaJ5JxTx+#|B$C^{1%rXYJkqTf%k1*1){6?)+P+O++p4ea=eL+nC=5Fp
z?JX{|HV&T$uIgS2r|(Qqbztdk`xeUv3QK5SEWNcrQDQD*Z|XTi?;q@Gfeslk=b=n$
zfOkD&{BXb^-D3SiVQl{6&#%wkeEj9(&m`$=ZG8MiG*Ht+9?zE{`n^w>_f)cZ?&mfr
z-KJsSj>kCztoxEKJQ*oZ?QY#>g12b5l266t(>bhz@xVJ5v^ko5#XBGS0p<1weV8si
zf%)uv0V%3a$K3U8P`5>>+xN#$IWt1(4PDDM^I(6Z`@k?1{cn^-W-QwN5H@6D(A%50
z>1C68A-$U!6<vCB)^2?40I%7tQi~h6p~8*l#2V2~YS=iCalJ!9gLJX2Tdd5DEn^DS
z<njpDXtm%~Cv=P3&~=E5Z)F&q(wnY6*Rsf=*PUG+`xxCAIN=53f*i?YGUZUF3<8mb
z)(CXAxs*;RJA=a5nbSoAPdl-KWd=M|HGP|LZ1Ol1l`0e=0nRSv+)`$IcQ~QOm(ny<
z;}xFI<K|lZbyLZSAOt(Zn~*7PvvQ01gu>X~JGzui(7cg!fqb9+v8cscZ2X%nxfu6B
z^L|8om7_4av6RXyn}ot7H@_pjRUoURJHcRrLM0(%XGqns(}R#fx!viST&?~{r&z5w
z++OGhF*GL5FRgbHcq)ws=1&0*%Q77-82F8T*W_0iPH%=T!?wIuyji&qY;vZMFvl*6
zPE&_dYhW_Gq1SWAA!k{i!9tV<PZkH47veWw+y}w|$Rt;WB<u}!+&5<DzhY>Xw%0&W
zgeDl_7V9}18A6hN%_c2><Z5x8w%{q{D1xmRW|qwg@=iK}W|=i8q1n0*Zq8tGK6XAd
zkJf7{jSlLDGT{zCCxDhG^^JRx`VlPfLvK907JE&cIo4C2XJI+5|Bd^Rb2wQSzTahn
zRi=>J+e`0Buq1}=;G6)n0g3vfDN>W4zL@qVrfHNlv*ihAoe0M`2wQkihOjBsH&TcZ
zTIzavj<bF*j)OGoUQd9xcu}sqo)ePrNw%41&tfVssf5d;rbei7W`R2k(<fcNE3j0@
zj?HN{N@XqsrZ;uRc$6|AqXI?SlzR-=^0ZyM7i}ZrW@8U_KItBf$clhwBNz%`m;!@A
zTiWypMenuj4Rv_xlO~E;m#Krc+XHOxX-fZ?|5zyB!SD^>Nz?K|vol%>hyJ<OBaH**
zaOg^PpSXgyMcn@I<(|`rxhngC)7MuZnC!YY3#a~wy&j@_lo(aj<%z6HL>8SXFFJBo
zdOx|i!xF@KB+X_`nHl9lsDxx`BRCYj^`v>@PdH~N-A)4s6j2t{mOqYxqW9lFfH!u5
z`;4Oer_nZYyCc4PfWlfEo34#D6)kw=O_I1<t#|D9Lf0IX?{Khke-Tnzq2ls>nXMp8
zAE!dmdtq%l#qf2+7_w>>7+LX%spc=1-cX?EeLzy@q3XB=_m9ZF<VbbomWHBxz=Ml@
z^66X}Pe{3zD_!Q}brdTCC<U5L2)w2D5-56K@C=&=+CbKNWC?)@L@OlH{T?2Q&@RlA
z`Fv?E4n^<F#igN1>hwKgk=jto;4ICqq3FHHo$Qv3jS28eyroP|EE&B)0`Dth#K%q;
zCLvvZTA$x*S_#G-(RQacJhu5vUJcGn<N4AY42s@ns{sUnV#L&A9%)Hgczb(!*06mq
z)^N=6a+LU%cUfnsZs(0oL`cpfoq>{Tu=#R%2Zb%#5!r2Qo<|uSFZi(Gd~)3h3FAtC
z+umB9p11Br&r0M_`DMw5y8LWx(rolDs?Mi$Pe6X9)wFQpGS>s)hy94i#JYTktiHD|
zd>`0&^E9=de#`7Fx_=LkYrHW_$#2{#xjQjGo;V?%5z}RJ1kv)2CHK=^k@@yf9;Jh5
zG)aZSL;qa)<)a6#GnLx}pAUcRfTS%hVOvFqbSBRA<#+pa+U>_6(1bmIn(k7m-)a!2
zHxnPB>w7&=!(^w+<7l05^aDCRmVQhp6!lVZS<W~s7b%W@zuCrU#*dUkq0Oh^%MZIo
z!=7~gY2b&cwd6bAbS8Z?USg=%y9S%SP)e6#DG$H4JhQCbidh~I7eM1MNiLv)PK}Ls
zsk2k*@^mk$1qXZ@b$csMt6Pi~yE$?F;M^Ij6S&*^gWV3h;$8dw9;;kDl}nlMWoKKr
z9NZ4>IiOzxr{QEF`0!&#8lq4)*N&gJ_nx~AC?5K25V}#(W4rjYkGpX9MqMaVzJuT2
zEnqmt;j>*p`%GbsI30bI@8AY{i@sTDLSGT|<f1#Oy6yneHmFNvsr#kL9EujmD@l2u
zr&cta)0N7tcU*N+B{M<cp{jH;S(^5tC<3vpzqz42&XD}jEEC*_@r?4Cy0G0ylu*(m
z0%d7AWQ*nMzYlNxS%!<ed{@xtjwdv7y%W=U*oe=@$n#<O$=K#iSo+|n^El<8uVfJ=
zgsPqQDw5K-wwGq^P!zj1BOX$#S|Je#0<!cS0tD87I1M<btg^|DW+1AAzSCou#^wEY
zw}|PVU-%i}67)t1<v89Q>4M3^r|F1!8aS7ryAz|77S3BbSK^#R?vv@$VuZ;cRHuBc
z4IbIS-cRtHM?cZtiN5+FGmh8oedRtufVb-ur$B%%?>o9hjI@7?kQud+?2)y@l@1-P
zNYne6fA57e&@I~2S>N-4$&)|p@(X*D7Pb)@lTK7d=!}Bt=*RsQW|-m}b#xCI^}YPW
zZQe`oL>|W!WmxfU>B@Tty1|XDZFG1$mv`)Nyo^h>!g6zb=?uMobhSAwY&S4`8>IdH
zY|JX|*77HETYMsiZ0X`3=}Hy7;-hZqtGdI!eb9__0;-=-x9iK}eZ9sTTJJ@A9eSfx
zDqMQfAxCQQTeaoMyGG>QcQ428wVSct<V%fm7L&+5b^;=mbIyv<M2S}<rjv=Ne8IxR
z@+U=Gd{VTmFk$Hj<x!t|TYkIZ)0I6~HQ`0Z(o!$=@TvZ5N@9uoW-LDt0kHh0#Tv<l
z)63W;=#5^^d&kEIhxIpYlo?^nAinPLZ*n?X9?9~g<ia00;m}PFsL*dsL>n<kbl(hG
z-!T5@V}};|=JHbGCQFTGtYtc9HG?sg!~icwbn_TH)JYqL_TDh$D2x{&$d)&$ZL&#?
z^2^^iqYP^bzf`s?Jhx&OC)O?WiLUgjLLXcVy&_PSa;Icawx8dIBd&a06{{4rrUMzp
z6<)+Oo5Ea9y&hfAL6HQG4E_C?Tk7;wg^qmfr%wleE$QMVU3|`~!s^P34&E*Wy=B&?
z5x|W#j3Dmq5{6T(bnr5#9SVr1+mtAZPkV-;&mW4DU3Yrrx?>TwL{!2*L1e*871S@9
zFpUQU`7eTlJ5|@~CG<sJS(V`?&Oo0^;nLSPIOX@=H%e4vyIR>Sioa}cY~x?rP-Ec}
z1*4w|_EUXc!jyKKh3qg=o?SCmunaoouM`9#qXCO}0h>1keR53K<5I5N3tp^v<f`uG
z!9*KpA^IU8wq)Q#k3(BI^xSAvz*dW)8_@KXI~-yRNfQ&55s}eFTZDF5*_TPuxKdGj
zI*cf5To?5{rT8G?oiRQOSUaSvtyBdf;mKr(cL%XvM4^&o`sY#9V7<$%EBg3rJQ#Yg
z@@O+6y;kH;K~g<Lg{rq+eg3@r3!s>eHA?-Pu>&F$p86Qa(j{r3N4mh{m;A{M0NL(c
zjJ!UuJ7;TibA4Mk5<wEF(&B2(VgG8f-^Ax${Jah0scaO*R%NhNt5I7z=%qxRn&)_|
z8N|SN{=7Qqb&I0nzHkQ5sR^lC0_@NYUJXX(RAPuw-3ovgKW}b0z25Vp*nIA8b-6z7
za^1|(S}_IaCCSGdt5#lAUu^3}+RZoZ#+&!3)U_t=7)2G}IRuE}kOZ34c6;(94z*su
z8{l)`r@*__f3ZPbwDIH@Wc%Y*yZK|xb4KDSR=Ep`XBP&$@uJ&xoTBJgd)4k%9PfK+
zE$!pMZs3Xce&BaK_fq`4UR!_O8x%#g=Dg@v<BgDK0g|Y8CKzjZE&o59-i2sic#}^)
z5K_$@)VlHdee$_>!VrWD@om0&)IP1_t*jW3JQ4ZkIUw&1UV%NvHnwY<&WkOH6}qeu
z*LvSA$vZxK4#$4ztLTVG(byia$`+33QWbdulXvi^=K#hwwl=EkMX}z4;WFCU8$5KO
z*4Rbi4`@wt24ogyDx5uzLHSkW4^ScwyiZ~uX2K1Sa<?m6)!GY9EM#?nWp5~*9J-QL
z*R551FM3g3>4(jY<o_}F2M|hivsPn*-os%D7}uM<Jzyt%*J-{9T0Q`LgaRy#wC47<
zw|Rs=xbB4AFpv+x#y%#ayBb>Cosyz?061*m%Y5NiWQyUK?-HU^jg;PV3KR$x|BC(n
zT-)sRpEE$}I6k(zfy(e83>4^#8<@bKH>%yrc3-Y(PHRrL{{>pzk%2uV|6?c8Q5BgT
zQ2xLPMkPw$A%3oGxo*FoGCaKFwikF4opF;?Rd@m087Nlrb=O@3Iaqxc`L{Q-@j0ly
z;s<X8jc>2_k%@HO?X4c{c>Rs77cY2f`K*|393;(*Oj<P7V`m0>IUa8SNA7lCY%=|7
zGc9?%E3?7?Gamp;)8U-b-68)0^v$2QHu_bU$)Wwpn;<!!!&K1CyU0Z)|NT#ATxuX8
zA$P{;xSwD2-R?He$$OX)^aGxesLM`f((;1U5xcYtoZ|V^4Uo0?dEl%A$p8n~ayB+!
z!0>w&*V*JPfdytwnEAa6obVq3pr6;DZ(&qiA==8reptSs9`#H@!M$hCP^-f8VF129
zMCLR61Rd8;51Y{YW_P{j>J5nXFG`f^O!akpfj($Epcn0aC>LctIKSjcz<|`ZGvEZk
z5tArd->Nv3t)h4i`<=s6^qRBVkPi;R3dBNuT%YVIe`%5`QqW%QK6m@;a=IBo+Aos`
znny8}hfge8r?gX9U*GI8>r60hLMQCXRJjuv+kdxP1&Pciw!S+>vQlA_z(PZJO~WKr
z-uQO%Vtu1l9Z*9g5u)p_A7%X^AIh8aD^G9T{uSQ(4)ogFT<-%;w|eXDMup+0_yb2?
zkC2THy11F}A-(yaZgWKDmZ3wYrr88X?Tm=3IEw{c6fC7E-nv5$5JpK&UMQ-r^P}5K
zhuV2UV1ko%$!8_+#O%Zf7PBvvsi^b;1SS}`lFd{DvJ_D?V<U3KC{iYiy=G}jPE-$^
z(_=*}lhtF%oF3TN9kY5!fea6luVhG@Nvw3$?9*^%<&<+hVc{^Ao)~9DZ{7}U%^}Lv
z>ayCgd&T*LVbGu={8O}`c-H5i<h7di0xFiWKO*ZbRg9DoK24C9fXW_?V+QNRLsldQ
z1CdhEdXZKUGvTCGG+(4t)F&qKiq?yiiXcH82i_%mwb&J{7wJ86UYL{~qZjEF**Kn3
zF?xZ-iiZDR_ZzRz-u$Y)8`QmyT0TXcEO3$JnBJ*;hm29buB;$W$GsFc15ot>A2l_M
zB%$4nx7La4;|@Vw2-t@15+m*@R0xx21hDP`)DTI&EUxrtq*%hHJv%?AWkD*YN^4zS
zd40oRk>2Rao0(^0kM7K1FC$tfy`d9cxFM|0wl|s#Wvyu7@i8F+Zv0sw-0`Is_+u4m
z#S;Eh-^xf#w5)ad_3}FD^qZ*DSGNkx3@%aV&Y@5mh+ktFEq@i5>Qb>+<vLCbi_$0L
z%8I?ROoI+HmTGZIDdmddjpqQD@qrVZyJHV}UTM<p&sjZE4=yUa#T81dPJUPZct45_
zjQp|`Ba(@vFg~%%`WvRaCpLx}hf9gkfqq70G>~c0Rdbm2oT{?T47Gb~T;Ac0{=X(7
zYYLIi$v9$24je1#k99;niXk4~1;nFZF+^eJKSE&my^B&fRl33Lry*+XKVf6J0kNs)
zcS9)%!2I-DZSf--Bk63}=)3Rz;~z6!@UK&K{2Ud*y9WYa?76`Vc6?Q`d3p0G3ad1x
z8G{3XenE@5!PJK4fi_(bpc2zNwCj<HG;sNnao%$UxlW4-n$^*f$-sG4;e3-5C#t;@
zr4;g#(}@XJPUSB2s}|9J#d`)We7d%Z6ZZG1gdMJ-QZDj>l#;|Ga7*g^gd;v+D)Hgo
zix)JR<(2xFmwt~Dj3GzC_W6CJQ_+p?v1JNk`b=I2FbhIy<?{GEqwj`ZKnxFA6#6U!
z?z9YEUTIOEV}Gn6A;Z;}{nex3S2Ty=siR~EZ9m{E42ZHZV0#Rd>tSd($p>UBFk(?P
z;j%!j<?MXg9T%(}68ExD8{JGFal8n<Jq17L74Efo?ci(w66CR-KXD2M5mXcrY%m8q
zH4;*Crc4Lp5xo(NH$8F3(7D02j3h#GHC_Ub@gU9+4~at$Bji!atYHRDg-_%sO1zBZ
z#g#nY+%S^{M-(QR4q(NPr$$m3X{01hF$XN(iwG)-kLf==&^U*dcHo9RXX26<D&H5(
z+urdHZ-8SQa2$SqAI)-~`~c+dPoA<&Fqh_wV9DB&FBlmD@;~5(5TH+CKsP7`??A{G
zZNLo-XD}$RXg}n*UdPaW<;qeNB?m8a`^Z}_v?=^T5ymVay*`#GC|`GALjxH4fids3
zXz^D|HQu>!JinSYtzUP<exrT5-#k%g%th0Ym7<kBGNGbRP4rITjaD^jt;&dQ^@6w~
z!^(P1U{XCk<pfx_HiVgE&j7k&09{k2`pCl=EgzsqgDfuLC4mQ)9W7LBy3ss3J(0?S
zs?H`1$yU|F=JDm0*@~3$nT>iXPL`Ay(uB#F0Ud<67zcgTj3dipRs}RzsOw<*{lMj&
zUCz0xpe7HW9rW=U_OX13A^;8$pQ`CPcc;pd3PlYbLj_PSmXSUl8S;T_W@B1ddDd8s
z8q}uDBqq<-C%EI9<^-5ZQdMz9*UFpM3TQJkSG(0YX`Hni_5J-51tv9j$rg$|mA8fs
z8Mrp-pn_X^bLe#i&a*KcC+@(ZELfl*a7rEaB%<IUr(f==ZrGB?+Oxcd5D|}@ALggq
zRi}6~^KaxinF<*Z{TX43s1OT~Cm#&719DfV-8wtjYiI@8#1+T8!EQ62MqWig7NpwJ
zi7FDlCgN(jLbb>EO6qqb=h_?1My5_|CcS|%Y?l+2aO}#QK<7SW^R1DDRo(hT707S|
zN@l)RFpoY$VDG&tK15MmPTtS~Q3FUf6!}+pr(|uT5D5$Le|0EB+z{;-7tU;0mc|K(
z<z+sVMQ<;Ul9p1r05@6O3J^1}xq+sw6pv8mEHcIJ=pB^5^c=$&DrLtUvX316@`sET
zOsF9Kvaz|tF+e_P1Hcc=O_zcV7{kKAFzuKX;W8J-lyO~`XpFQ`Iz;7c59GKhE6Jda
zfll6OLb1LhP3SDR;$|=RdzHmWGIHKF_#}yMqzkn*Y(>bf*s7}2g0P&5S!KH}B~qa+
z4flf!Je?fNy~rRcXo+u+mscd|xNPdx!PNcMJQH<d8dxcM4gK@-S4lcgOd>V^yZrZF
zH^1>`e*X9M%66?9&;MTAdc6Pbt9-uJ{cjt0x&JNM)@EFs6W^l^mukBtnW^gf?zH$P
zVetO`Z_b!b!l04C7~t{FA1|SMyoB!Y61vAr=pHYjd%T1$b_reDwR7-HCFIJHa&(c4
zo_rrp`yfo0FJ9p-LnshmIvrwM(1C9MU3;$s_%*BDglibZVN{f+D13Sef;QI2+m=@B
z=PzY(JQV{@0lY6@4hQA&&T;H-=;K8v_$OpPw3q50W(#f)v+z;(Gx+-BkDX~zxYHg(
zu0~Af>^TJ^Fe6ZAtO7FpRu@Tg?;~VO#45DDtN$m=e>M5Mc?8cZiRZ`lQ<%Tx^LFc~
z{;na&A#r784aEvA)YB#G(oe1nV9|kt&*n(|+u^fFJVl9i5Wf5+^v=h$bAt}m<pip<
z`_R=|bnk@r6_CcEG9kyhHSG0aYwrh9xvs{clRHCX-`C!HQei^JkEi{z3@pKIP|&IB
zsybY<0O28MT}5d`d~nOnr$DFe_W)syAUxGa85pv{zK7F*>@CJo1o=IoGKF@BA*RZq
zQ}Eez!rPP7qS@2}Dl!_e&>04^@r|eYz(I~TY8b{%+b-Em=|o`!9pOexrtqH1pNzBG
z!xJxWtfhiT6~h*!Yi1X%Vz3{MN%!=}oEJp{aN*!FGb(<xwv!0L&4h7;oT+lXK}b44
z$n^FrmFNg-Y@uh!wP2@aBm#_(h_KEk<PC-Q(!js^U?B<3!AYaRa6FIT;Jo0*{5$#>
zN1Z>xTld=S&C-dWdDPj1t?_l83AHk(>1dp4IH)-rrU=_RDy1`>Z<$DLUSA`B>`kdz
zG){r^*CWrlM2qiQM@`sf<owKQ@k)E_;v>_p7Wb$`(_+4m>?^7OQ$SsjfMs+CjJD?}
z4`Mu%i;}Tlkxj=Sg{e<##f>?f<H83`W8!PmMFNhaR;LcK3K0b1v9b~?@k66=Tt95S
zZ**w0e-E-pbrZQXvl8aY@G~-H;1+{t0H`+bg4YL+lBY;NH$ngiEcN&G<{>UW5>HHQ
zq6ZD}FqC_<*$&hInE|9Bp@=TIvxUa)7z%X`fLkLU!$I3}i?l+R5Wg?2H~JxVWaRkb
zELzg}NG%xhg2DYGG=Zmfn&B~2BTs>RP!RciK5`vcEx;qZM-q3Q-Ca#I$A>?4Fu8d_
zZ_;$m#5J+GgK;5Gk5-HPYPIk(tt<^sRmd8*)d-3qEamhjz^L)R6)58dW0Bj-iQklL
zz`UPN_M)T{(k{owG&bHzWD+ChC8FRo;bCtMzADl~vWGGxyqG9i#oAaR5?Q1_85KRH
zvp@DPWA1}!1^CQ1kh<T1G%8!_`!hU^>?>Ib+mO#Po7iuip`b5YV3`SBsHlNM_Tlyi
z%J46XVML2qg=bXiER=rlX1gF_w@!-IBb1Sk-dLA@^2aO$vf^vLyDA0BJnndX)`&q)
z#BCYIS}0p^UE(l*-uNXOHtqu%5jwH45<43XQy?RiHQGYgsR!W2uDlyVPHqu6Kl<Z^
zA~(IB=E^a2DswPF6!9GOxR?MC)xn>1BMHh{U6oa-LDh`7bm?3pv$4-c8?ZJEw;r*Y
z@SLI*Szv~tu9c#A2|F<huaQt6W-H6HnVkT-rWJ`*jmxU!nx}SR9g%Hb9_cvxZUU#*
zLn9WaRY4GxyB>Anji+fRLwTmv)hV7wOp7u<JU`?fidt`RCIE+S=hn@X%jL}ac;FRp
z153i!p559iJi1hmBmvPgSd_`;Z4ceNR8ki7Am(=w-8YM8el`Mnqkf`91cU6K3$3_7
z>edM)%<L($Am)tGZrC~9J1)kbogFoQOg;pq|6qUR^UD=$duxZomvI@Ob$kkv!jV!z
zD%F(trbJVzX^DmpT#|B$Apu5t>>cwcMTYK?X;ItU&}WR&xJK4I^b}Q%l8G+L^-77-
zEQJF$8lPR^^Mw>~hzE)ikraq3ET^Z9g3`$LTp6NI-5a-$NW~yUX5l_)8}FDsu_WFc
z3yPQq&3;PWTkPY|cUc(5RIwp>B%IGcvLV%yyfLQIWL&BuzR*fa7ZOT8ZchelN6nP6
zC*_{O2ha}4UVA?@PO*XfdaZ<*+S;I7^=9L!Bics$uJZZvr7$00P=`yt4uvASHeo|J
z0~n}Il5+lkRw$09c?4o)6VGn3zp}8b9F#*^%L36F-G7--H@KC9eH=AgIh2qBjcje`
zMl|@5e4yGyuFqhIT{YS>kOex&rzer|B)uWs27Szi<Yk0*Lu@+98iEx64)zO(r2;l*
zqseF_E-5h+z+)OghGq&nMDAc6EXr#pr6;yC41Gh(AXQV<{}sBSJjuT*mnJq2a09Z`
znk|z_5Xiv6rO~>rDgOHU+N>fIyy{vi6$!bUS`obHr6N7Tn;h+cuIsvjC;gF>)WUo?
zW&?{|r#ZJ*b-Cx9&geE^FO()Bg)|Odp*w#A^f(x?on56Qp2|Du*CH`HdRSfrzjci|
z!#^A2oJN<Z1H+YW>7Fv?kegC(vgX-&zhz&BK=hj>ubCShp9OW$m*r(<A#Y;8!x={3
zgXrmJgyZERSZB!j`u>P+CZO;m3s|#DEZX5RR<jWti5@63^JU~L$du)hnPZ4%o0}3m
z8k;S|d9MMCT&-fz*O%JMMe}k+(N{~kKe7HUbxw3<TQjbZlZ~<nH<3>0FQaGqRoq-U
z>WxzH3Q<3Gy94w3t4I}<-59DO^alTSdfk`N8$&S!IR<}pbRjA9w$$2Hd;D9@A5GB|
zByM`@LLpZzbSY-a3vn<$s;_R`P2Yx_t)q6Q-8e;gCJ&9E6WgRyB(mxh#7BadUT8Hr
zCI!8W6;jhv21+c$irB>l=N2O8n_ccQO(xPXqI@NRoH)~q#o%Fumx_`yATTH#fq-`B
z!f<@je2?cf5)Pyk_=`yZVjU<tf<}qZMApZyX3-$lg{D*MeoSmnrr8A5l2G!SICb}?
z*9LJLC72FziOw@tq}9Q*Om~S&@`MBGC3`WfA<TP<QqWJ-P3g_-=yMViFO@Z)3b7}Y
zy<_tMafWq7Rs7A^Jd)U69Z*-yD<TDy+^x}ihjo!<y8#;^I4p%u1&X4g4Yq;H-rCZS
z&$JV80<WK|wdZUqXtRk!i=i?d_Q1SqO2))VAktVW!bDKKG%O{4cQ&9tJ|MEy0fE^<
zq=)0bRQ6Z}qXqJv9CfBz70p2>l5Um~D;DnEW~pf3<-uWUvX`-EsXMT}!^+)tUdzls
zxUl9d(GGGDKh9F(mu)z~N=_eviolW7j}Oq+mE8P@VeqvU0g%JQXT`zT0qxsT@$MgX
zs8FI+WaozEaqeBZ@zXMK<WE@+?B1yTz5D<hYZG-m%8)D}P`8Je_q|)aa?k_b38jFK
zT}Yh*7Vte|FE{cs8~P-t-4EvP;x>a(b}7w*OhPxVUCkSOL*2x>D)()`MRpr`TLvs@
zs+?O3dzNBvW&_1^L3nyOx8);${2J-^Zg9N@WoTgw#SFt{;*%jmFAV`=>BI%%x<4rQ
zf(eZg76>HZEUJ+;$5{DpbBnE}&dx%34*L0MV<|*Z>xmBPKy{h9idyFE`%D2G&Lx>W
z*f44OLUA-sX{Ig*bgv!ckQDNxbyw+c7OJB!DH$6KfsUz>@1uYV(pJDCWKk=f(l@ZL
zLle-03ojGGfI-wz==2^R5-XaG*-tR?{6f$?&ZE%NmrzR-u!UJllRr?H#H@$efd;c-
zGz?_~Z=9U49q!7*&@;<atkIdbr=nL-d`Ph?r4Zw9mF7EMsc3V!fn~0Z^yXx>Y}(S*
z8)FnYbVN!DytYj?rGO%+c=$)Mr0z9JT(`Isi8jfxVX4)=KX#>wzlj!8bH_G<kfMAu
zUO;Pwau9g~DaaAIU^pCRx#>%jA$c-T>;{sBbh=;)!IODR5#yIdOA$a3?S|yEAy+`c
zZ9|?d7zs*I{=!g~sW-&hc<Ar&@kg15V+tWF(bi9WQP8UdE&^Ud&aFn{14$J<3G5RM
z6(F9(F7L<s3?)$mlg_Ycxv=hv7Ec|OL4s~tm)Dv52DT)s$`lX+kMXv6eR6{iuxfhI
zdjSywwa*cmV&Y9)O503EK4rEt$I4+s2MPdnu#mB4^r1x2IJ%4t=Bp3k(h7B&5BmHg
zs5>+iJA_I^U8S$kTOUKwQl=0U3&AHW#AYmVHra!WJf`yq^0Hu`6JE@5c#G26**JSw
zgw38|c4#@TGHi<S%V@qqDdALJ7;miN&eU!xZ%HjiyM$V|3>7V1ed3w2<d+>Fg;6I*
zNj!!I;0&*v8+C?CgNP1Kc?Y_@J5d>}+<~BywI7n0Qrt8?>vIG7?=9m$7RLYJwL15V
z0h%BGQ>|7i+jjg<tx{dzevJS58lRQ)0HErNqO?vOI^FOw3g$5i<}nK9F$(4}3g$5i
zMtW$s4^tyy`1xJ^NhyKv@P;l)Wi6j_8?+DQ-C^YmmDxt7mXRSQed#5QSIx<U7VO00
zj(ey*h8K9+N0*td7|y`ZVkeZ&zI7Ff0y_xhp2OU_bnOC+Xz%n#vQN_;s;(2>5KOqi
zNj`)3TDraI@P^b{=^rjz;4afnc;Kay31hz_OIA}Iw=#Q{ITL9QWTBG05Tlxykixl<
zvay^#)i<4pm`-JKZ0P^h5WAvMOf@Y6c8+{`a3oFCcJ;lJM*XzWIjA=e8~cei@C3r4
zj58?abGo@Wa?_h_oSb%kX#CVU0j7ZTRg5*eCo{CDbi1G28{R^@uzlfP5}ik*d-x|0
z=C_~GSDm{%Y}NOZ1F?oM^qoF10L&#dWod<WCwOw~K)3151LHnA&FUiAd@mZA>LRsW
zJQzmQBbJPIGr`6a32Y286?wWw)I*bOno+e<XJyBXo%U#%Ai_5n=d4mhgQl7j>r^Gn
z%clXuEfo?D2?N8|)^JHcC=_vV+M*k^wX4T6e-7EbO61Dp*=tOOd619cScxQMf#ys+
z%Hrq{wa{Z0InrG*f{1;y=_e@Is&ADMOL7YXa%xaVEX3@u$OL2)hQIL==y1lmYkkg!
ztiu?XG}>?_AdUEumc(AqL1OHn(+mlAo_))x680Qi2L{=$f!2gqN|UpVq(X8XlnMfe
zLk_*ZWq<GCMaCELJ{W75T7=$mXa}%U%C}~BEAJa~*iSLU1O|PX6GY;pq|#OmjYLkm
ze`}}+t6Vr8SUARuz_l?DG79AC4LvrAnQ$3x(IR9x+4qiJ1ZF_OWENq+xYG+LHFotD
zhhd7y-7MDTvyP;|C)F(Iq|KAIp~%@6WTfQ^Jc-h6P)5k*+egiUI6Z6&+`q@BsN7U1
z{zTN{5{3purra*3z?sa3<Tj`BUz>4FDn}3JBd5N2(;~N4vg#Bh?}%@ftLZzRW$Lua
zHD(7T@`}#btasVf(r6&P5n}?1sVr8k#@QOBjlw)=I?1QXg%exAjFXsWd4z;?T%i%C
zgDyC6!9p&0<y$R}lB@%G^Gpm?EN|qYcQTzNNZ#b}M1bspSpan`o8+`IE)2P+WHtu>
z1EJ7SH%iEnGV4@{ljsc2iDMBPO2HMM?PUl?lA0{8Dj~-+O$&pG)2iE|bPd<c*gg00
z0JlI$zlppr-ig#`LjaOK@^hd|f@BG>KyTr2N%J5H1u=0Q`~AJmP>-MA>62~$1#Rfk
zz43$c&1iVPKIYqhE7kRlg#EX&x$$WK{TiRYh`O9-y57e-p9SjX44JTXuc>lG4kGvJ
zD83}mx9)Hf`ofBlQ*MX$#*s4(yz3pkPnN{qPj5P}>+QEYVsGaor}E$0_}KNvAG=O?
zVR*jm?d^#3UT=QYWh%lG$~e6vN~86f`S`~l(_b9!o6lEzm{hexc>#As6_}~0%d0ZT
zL>bQLwk&zQOcWSRIjQLolmlu=(gVb;*Tmk*;Q^;_#v6@LVxrv664e;i2V&6*O682Y
zlHh!YI7OmVIv@I7ay0>=6+@SL!4TtV@Q5COYs!?MC^zDvV8SA@B9n%ywx52dF#DY-
z4SOO7xaF*ZrG8Idw~%|fvO+C&*kxYVb$b`SzG9<XE<ep|v@gD`A0NMO{M0(>ygq9l
zg1$;d)R&ZbKvcfRdlA=AkbEgdpFm2Gpg(ycdVS+NB{D6SMd^+Bn4^#?l_D|xn8OlO
z0K->X?Z$2uApgCW*&p_k&Hwihr-vXBhUMw?^gewoIRC3vx2tjfU#nFg`Ty7W?7gf1
z(7=p3&39+-w52T%Yp3089f|ewM!8a0VXJf_|K{jS@|Jxs2n#F6C$0Z%?49N%%@kHv
zIBX%`IKmSFlrKf@HLY9YI9XeDWfIh!XdN6BR8^2msqSf`ecBc|Ot4Sso{gL+I)ybl
zHpi+*J#!01k!y3!D^7kKw{XbnEAQ%iC$0RsJALm4sOP>0ev2Ah0oYl)ajH-PIC|6g
zQRMzNW&Hm3H!Ss8<jc<r-{!FNLG!SY=O}&{z_-6Kj`z+^PS6O*No_m(&6Cejj?EnL
zOx4Bf=BeOrzWvSW_A>!PE$6ua#;(`*8i|4;_wi#jr-92w@1gO}0A}N8KV`&#2kUp<
z%EeU3dWi{{vR+bFrmUBonyIj2AQ)k_di`8B9$-)A18N<|^RCfu*WWbqxqZ5H2&m(d
zyW5FygXQ8hD~xW<VhE9>rN)o-cgKfx+;$-L>U(b+;&rP9l+E6T(e+ZQNp)eEYDd#P
z9Xp3K*PIlKWfY2Mk>C3s=z{!JQ3wATyXv{jzl>io_m=$T_dc;rtK3WP7Vr>z0_3#P
zJjhd2Zh=~<@9%f^TJMg5f;;<-17Hgjg_Q5?odD%F@SqI?oIli0j)=OcYUi*~KkC$v
z_B-$33y~JIiWet9YlqF(C-sw`G`ibw>o9Zauux1`{p1aWJhhG+CwR!IY7%_WW9)jr
z^`Q;3bKC;p>W7D&_D}C#w?OYcJvnQb3(6!ZrZ}8pHF7*&1G;+ifl(j<IBXvMAb~f4
z5Ypl<uEJUek*3Egt4U7T;gipnUH9zuVRKJ>`@Ot(khAU_!1CQGzk<gs5=9T^aE@2d
zBW8PVzQGwGhNGxu(kpvo5&aVX(K<T(31^yn%`>EJVd9mMs2-I#F#^9jIXgOSzH3lY
z`sPs`=|L#S)IeU-QSWCeFDHC%c_^dH*H8A|Hs8;0UzRrpfkW0qC|~fJxR7_g@p`(D
zYm7C6dCkj7Gg&gzg6>XD=TG_~kOyd##}J=oz$Kv1-XA8th22RMt;xjd-Z>!4y~gb|
zKWB0ggya^L0)nblCgGd6D_ltJW88gYp`9Jcd1P}ypc+29&j9a!jgWyQ)p{|D$y43J
ziu{r%QS{j9eR9s-JsKPzdq5jXX>~gje&69IWT91SqQuV_c3d6H4A`u*ARI#jpE5sj
zBz#`b7Hnv5JMZf!ZIOZ+V*$*WR6Vh&bEk`>OrL(Y)JPJ`@y=*nwman6k$}g`sd*ss
z=o11P!x2h-C#}{g<4R8tlmNZ+uu-sZkK`AxBywxBFj&L<l*2WDGF`){aS&N^QB}q9
z<KJPk+y`-F?+27ZlzmqT)Lg{cl+ku8H)h>7`Z)BWojA64lI+a;r!^2`FO3>SbY%>_
z9qq3_$=$#b&(%9YdmtG?M6UE<SS&@Ctl&?1!*gfo`=4f$oQ)DS;Oq?@`_eE)ul1v4
zHhBEZ-Q>+Jea_x2$IW{?G^FUlsPZ|tgnVGN6E&mDeU4~0P4>85`_`^vl481KK%Tso
zbReH-34uUMmlCYWvUv}_O7NfCN)7nAt>i$<<W|yyIY3K-U@zyn{AlsMo@{*yhA8J?
zsjk!Zc&wAU&!<j{xW$%lHehc1@{_*%%T>RW1b`hd>XzEY37$Lb<cWGq1Xn)fj*g#2
zyShm_OH8A=yC<jVL3j8&6ZO4zdcBLlU)<a+qmW{F`U#ptqFuA`Bj~B8_)^P%WcR^8
zYIn8d2(wkyh^hRR_SL?E1+m6%bxD5BJu3w;LHCWrb|Zh6rjk4#fkyE1l<V58qniiC
z{vEok&a+4nlEMpP2L3`<L@ASoA%Q8g2=<S?x6fW{H7T#ktA-MFes9C)<A*-k_WuFr
z{Q2Vd|5PgL8!7kyR37dBU*nT>?LHv0aH@B=eigm@5k*{eQQKA}O1|GYZnc{~cJ|b}
z8b*564#`VJWwXk6I;5I(It4tni=IM1Z{Z<2W=k9E>E3aauG-8h)!DC~e8BAFvZH&(
z!~Ls$=J<cG5$yr`SaANgzExe1t^cj<&Byb<uk!g?_kUIIa{t$3(BWgy;bYL@W6<Ga
z(BWgyA&8&#_D@H9se-9~qwkzDJS&!tM$Eh;gzh77`G$nVty;iV5;cq<Lp;x?2Jj08
zVF2H~;7o<+P_F_Q)$R1<p1O2}?=VQ-HX_sQ(WMNWG%n>15S4pr-W4G71`zd+ahZsf
zhEf5*frF{9R>ulUAtrIB>*vn__@OucgbB6fWoKAF1|6n<iV{M~yyG3bAIQk%XXN+$
zY&XEMn}=#El27?M7`ZE`Z0ahL5c2d{cMZD8OuQ+Zp=N(eLM>Kt{)%{gfHzElgtc_$
zPnGL4<Ib3riQCud>{Ww>yp{JVZ5k1GAjVE-Vfu|Qdk@zlH;5^^f~Yy3C5)vDim@px
zq+~%IN7q9wn+(-jTq-5Hc<T@QGUW_Uvd%Dr`OkHjTi}u-z*Bk6P&A<`6e-Hk*mkG0
ziHvLF<ZB_NL%K0T=5+juZcb%bWn(tQ0CC#XsO6L_mUgztL;_2Eu!q-w%_a)PCRSy;
zjZ2I*ld+CbKF$l@|D-!e<P9}@)DH=vSc`;RN8WUW;+MMBOZDPjPv|xiyvH20r^v!c
ziGb+3_%#%F&>t8h*sQEkkslw(b|bzvTqDvLzSHlYP`=*8&|?Mr?r^z+(BcQq;=4qX
zOP1_qPEf31h<AR^hAu6gc=2LtRy(ZyS-6+cWbYXhVo1HlLc&P;=pvr}jG``eRwrbB
z7=^`CMTx~_S|@phAT4=yADX^M23UDs<q<4K`2q{}a!Rr;vFeYbr|H8Wg@N+eQHEt0
zF48mRqJlN%qNtr%wDB(X;_aVkcEFjVqKzSK7a~3{w+ACvtIWtaQ#T{26o`e?ytzvz
z&TShv-zC9HtkWc%^0tqNybLiztODx+ActYb>j~zH3)IyNpYa|(Gdb-|bPm^Fl%Lkh
zB_B^xYhSPyyRitF3v7ee6eMAA!W1FOdUS`(whLNYm`ip+eaz{)FwJddO4cPB{}PE}
z7p96`09RJh*eI2ry#6A#Q1dB`J1V*|v8e5&psL9vhnd@I8bhLnSCS-b^^?qAn$d&R
zL^{k?Hq&G?X?#Bl?xph4Fwz@I)`&8jrj*6y_?A{Q?bT}r+YRl|VyetVqui#8d*>QP
zp3`Nk%tckQ(rsXx4-HGGyjMhmN?caubmW{alXqP+VJ2lRG;?OkoT%r(wdFRg?OBTP
z$Maz_WJc1#tmR_qPjQj^R+%%uWS8+An?_$zR>V8@cfU*Fc$K6kPkn&#r{r1v0+|~h
z=97K?6ZS(HPjKHepati@TiY8O@$=uUjmPufukuMh|EX1q;++T7><-17fFpdrAIS%J
zKyxl1KAze<p4vQ~+B}}xJf7M-p4!NR3qmVkQYF~(hTc>id05GW<XHhFnix5g5QDb_
z+s2jA#<*K<HunBLi!S&JZ$@2TX5Av5(wsgeV+~$zL58I(l}zEStU{@-bQXl0h~ZFD
zEN47bdB`cR8drKsKyhcVl{u1SIn4k4F~EwQpj}3pu#245L0L;N+XCJKg0~ZfLuAau
z8{mkSZgB4Q<yj8eLplA!1)eV9m;=;S`~KBfz{KM*k%>)81U5TY$=Qs<G93W1-=;Xu
z`l&uGOL?W=;UMWwV(SseuJE+O-^>@zC2slrioTmKLw6cg<R9j1Jn_=6`G?gsTIyBP
z_&wIN`Ck3BfUe_{<7ptvsGo@<ZOo5nl)>L-ArLL(Yxov>F&G)|;79CrG(P?jdkq`Q
zcshtm@b6e5+}fie_$yX`r>vuY#9m*<d$~;MX6QP)6Z~$y98J`#(ZqT&xlu1BH?bGS
z$mxgqx<6A5!Z-5;=21~i(s%P^hb~{{m-O9yX}n8&1$ve@#Y~S;5%tI}>W}cwU%K~K
z6^$O5Mb88O>K|_4%VO%MS)@7c1&109@|RiQZ@#DA;@9}AXkO(nYef!gp(btqVZO#N
z$rIln;f-%x#&}|3b!4t1`O7Q-{1|mv1&aD<78$!&@-2Ley@=?5f0(ZWXMC<^jlNre
z$+J2Infz%MIdMlI=Th3ciPKXp#hzMR1Lxcc&edS_??fSkZ^@r#k*SY&Y$(jiUv_~R
zWe`>c=$BO>@J8w_d^KOqtf`$P=a#P^jv&;(b!s=X>m_*nqU3Jb`ak6xcn}?PzW%?l
zxn9|f`+siK9`*mP^1&12Ym_#oN;`6B;!y~>@&oc%m|#+FR_Bx~#m9-TE%^bR@=Cex
z%lnaT+{KSH+16%JymO{g(VjXWf_Q_0_#SP6RNDof6zb|)n~#6~(;1f<f%l1|zH>B?
z{0&ft51^637*9^mAI&0<W|2p;$fH^0(Jb;WZWf6gQ*~HfE_(QVcoVLX<)eJ@%6L5J
zji*EVQAoFM+s|M#9{cfPeUNYy&%9W%p$B_Im?$>%y7<h18f5|#;v6N~u^vSEr>y5!
znC_C?a6#1Am)RqX1Vuf4=G^JfleTpofSL6ekM9smG1rPI<<X7~e2?7e-p~(|cY8|5
z8W5H9J<20ldNt^aZ+4|eQ}gJ3{jj;;IoL0lS8P*LRMc?l;;PA-(z9me^U8|4I$pt)
zc0H)Nb-p_r=o3Tu-g71j1l7tI&+4JW!0lZ!G(|zRxOh=iBy>1BS$J2Js^(DeRi20i
z-!(q8&JOoqAGY>>KxBMFt&+>*6FDq;S15>o{!<v$U_GA{%x3X}7rDS5?3|+vfJxs2
z)1wbR^0vN8gu~Bt-vK~nG>$nV_HiKsMA-l(`gUo10#y-Hio@2$scB;n#ObSNxUzMy
zW9YXia)@DdL2u5Oa$^vsYGM?>E#FlWST3cvU)=VJ(StRy6%z?_duy}~Fa;uK_$OlS
z$9x9OLB@bc3{Ji$IOfoL>Ls@cl2$^*t_WT9q++Uue|(~BZF<bhM}-)btNP#D==j~p
z{40>cia7~#{4Z$+Q2OkNG)9V-+ct1q%W~970BrhNvrG1E_6ae95cHBT5sulUD6bqs
z-@|j43n;8mdoXi9S8LCIf!e=`iui1KNDgWKE7A=Sr;d9^woI7O7~qn+QzQ{=!>6x>
zV(z<eN92kU_Ls_^k|6H{c{ze2a1|P30c(k8<e$N;S2iR{(q|)m@(5d4&cwQTdo}s%
zq4Q|w_5+1|97;7J<<Ont{^?JqY8A9whn+UiWdntsR_CMvB1wIJ|D-6Mpk^ll_Qyb?
z2|k}W|GlC`dNIngH_u*@E9lBElf<apgHzEW?_!{<qO*yxU<O+p?29nMPd>z{=lV>q
zh?@>bfsOh*<O+m^dE5A%agsf9B?B06QhW|TQpbEIjng<+O43Nr031E4W6UGH`wV_C
zcM71_*YY0T^chgM^dbm4^onv+X{sf*X~jyISAdWGv1+5NJj{=L@|8n_2#T`#T7kUk
z4mxidrw50mV;^+d^u6a`?)0v!s?yaU!E7?+kO>D!{(S5VqmT<E3uffIvURz1Wb5}?
z898oHwUoQpD$(F-6zeK-Bia@JvxS$i(N4tGa3_fs`{%AOOX+4~gC}$rxz0nNp#1<S
z_=_IStV72vcwIQmo4y+Q-(h3eF*%~=_l!Y->i8P>$|qRwc7uxTwmEKCws`MhDZ@Lj
zl*mIqxghmQ{K0i6^`Uo}kdJsB65U@qLvy=8&tSb@DE3IahY)1Yg0YdL>>@gW24E7}
z)Y}Mlr?5Ittc*}e%5+ifuPindmR$=x95v9Fw@V3<G1BJo@k#5n)j8ceF51aLQpfuJ
zA_@BbLuHz`hxX>M`Fc+d?VIQ^9$UR`?{_}A!Pp(%c9hNi!{2R?Df79u9<5?}L)wZ(
z!b^|r==A;JA7E(fw*!0c==Ap^I&vjep2Z895e6vqCP)6hJ9KX5Nvt<+xJYD8;NqyY
z-#D!Q1h|0O8W-^WUR$%#vC+vrIe8YMqEPd9^&dO$+KoMsI`W6Dqc`{fm4z2CUKGTd
zs8%YKLW<<e$dr){??Shi<odKBt_E&68%_%=j1en9R|SWxN~;9(eW}2A<U<|_Z?4dd
z*d_H*$!aaUh!W3}R1@SPg_pFUz-tLrs)SO&Vlu3JU3xXW?98yES2T9`paN~a<(CoW
z;=-*QGC+y|r)t2dg0KE6$C;0Jy2`Tw+Fd>g?lWt~jPO?+9JL6`6o)cm_<;xURNKJI
zzUAAbT)vVu!lm>jrj8GeM^?kc!YoGftc@y6DieP=1i?Uvt3m(g>MwG5_@nYmnO=xU
zYA{~O@Sk0A+&VmLot+vYg=rFj1^xz)VJxB`sKXd0^8qmogeQN6+@V@zcvF`Cg5@8V
z;Hb@7A!(b-TJ#GDDl)GT%rWB{ek2Ma^W@8AVV|d4-V10O+e{yLVUvuc+xN#VqV5R{
zsSugCTR$LWXALuIg;jOAE!_pE1eF`_?|`m!G$kQ1x3&a2QpN36JhK?Opk<o7U4Uy_
z1>MQ*%}$ySMg11wJw^VK=~71g8fHptD~9Z-(`ZkfgEjmcUU}2rg<OrQExJ^-(QNOv
zj*fQj);c#)KRjvF_kY?kTh)u*d>R>3Gy1D6=nwW&2Uy}xdMRT^PE4gqlXC<WKoDPL
zPMGS1&LzRcc1uPjGz3%Bp|aAd$f61SE*PBee34ZSz-^&L4(jn=ocVi*Hb#f4^+Jku
zKHI`TgO3p#BgDW)TCG?GW$Jx->oF{8KU*xB%Gr%a&{}6_X+qNUQm+nrEpwCjoyipO
z@ML;v*`MJ>_>YJJDE>BE#x>?2jk0_1>DZ{qtrw}S2NG?K=9eOYB|&Z<?SDy-Rr5=O
zybKAPk*A~N<hLURB{8d^q16(dYSeo!Uc{Uv!Bq6Tpf~fTrZAk8vk_OS)ofO$dL!3z
zyb`#lu3wiuL*rMjy4ZVhk8w#ntrQ-Zu_td{QuAuEn5jfA=x&K!UoPa4JL*ktQrapC
z{beyox1j|J*!?|dfja)Gw2<gAl@?;9vS`67mP!lh-QA5AthTafAr+(rT2jZHa>W^X
zlPpT$BR`hWZk0J>E+O5bg=DggjI%Bz_sgP?Ink(E2ci9W>lb<GIz=HPpWE8pT;BvP
z8%rI7ZF}PZ1}K0&SLCbc@d1488s8`QJL*&0;de8=E(`$i^onHPw9@*dGF~H$q(jnP
zB^EnzYlVVRFzHE5Xs+S;Ai2>oo9qyUU$i;tg45olj5s6pGceKueTWv>6fcOK_#uE5
z$|Qc2p}`5!KVsqpz!~%{Uwmmj-6;!&Ml>8sN=+Fe&?SdK)5l)WkuwZ2m@L3}G)&`1
zm+9&&f+=u?a&=u{QS_#`5&qS<s9JDB>0`=rw**i3gbunFeqVK{YEf7n`ap{=u&&wp
z@CN;Z(5rdqI+#3YN<Q7}+}iiu5MhB=pK#Us!HsIqW<iM03qK@_kV(7v0XBnUF^ict
z6|*++Bp}oNY?7DxW>m3wN2y%r+=of<{ZT@Ejq!E$c%cZ<(;O*w2s^LaxQmB@fcUod
z(nLdYw~mP07)zGX5LJ0|!B{%|(!M}sK523WDQyXqp1p40l-X$1WP474XmGK#-6%#8
zc7mZ8U06+-2#HKGDJ8$z6)Bwbetk!znXDwou02mWoZe{*aQR(7S5z6Juna6C5Qy_n
znEO_gg9`mrTO0i-I{>OP@_;pHZ-Llr6sskpGn^eFZibFX<V)T>zT84wfzk$FH)xGw
z<}%EoHt=WTei<23pE4p6Q^5<|1I*rl@t4MdJMay5HSY~QOu}~K&*ZVZGXPe{j1w;*
zfzI$9#k5lIiZ@?Ua4NT_FE^*~Rsf0|rZDgpN$b)LZdA3hXra&hl?QX~h!IAKgzh->
zfW@lD0-#h^M#^^G9dQ=AdfZ(fkRS)`a{K}Xr4oylZv5~JK*1WSMH6J(sUWxnl!Gd+
z_EM8I6?yXI1V2%GRe{!{ZBWac=PkpYmfj&rD$Dnjy6od;N#_ocIG-m4mxWtc^`gJH
z;pHdfu*cxM6ccq&fL~$9Exm${Fdr;}hy#I^gPX|S6L;s~3XG#7|4@`Ke^SoWo<GcR
z^09`2qO~`kx%M7py6Gqw5?(RAV#VgF$!)-3h^m<sRuh{VlCN+X+SW0-iq9}rt~vPv
zZ8R9k&OsTWI~<hyF6VT_qO`;>nU>=ou5-!P0Fj*zVM~!x;*;(I@*+H%zI-neud^NV
z_K1a?yDXjVi0{JOB5K6XVv=Szym-B|nZl1@osMWgO0sF=HC*)K^$ep&IL}p&d<|C%
z;>mcSt{^csP977RAKcyayhf9jgmNAt7#VX=L#w=t?m5vi??%g<-dM{#4M$x}ju;lX
zAQ4^kmCU5yq#XmPk6JJ(6F{#)V*a#vRMw!DK^+4A4fXv6Rsdo|ay?!I*~k0p^YCjR
z`li2PdQJ}Jbe*Z0OV;2nhGZ2c<*6`|qNLGbV$F4eWrmjYm?3ZL$B{`vp0h-)o8Rr8
zqO%yiE7{ptH8}E^CoCGx+O4J^S=xuAZ(Hrtvm+4E_THw^&isQu0$6Wd){I4>@S=lQ
z6E4%6GyYy<`O5L8odLQ>qyD*QIpJq5(lPx{<z&mI$0r^svzvj3saY^kQ&}0%i?4{P
z?`({DhSl@5_K+9-s#EX&no?wKF}{!+AGJ>F@9WJ&biJC(_p$1;XVPTx%Cs^x_D+Gj
zpW>x_bMczRbJM~D)Mqh$=;pOhwU7a3b!bogPAUr09T9rPY%TQG2r<Pl!wcy?&6*6(
z>_(Fw&3;1it1c<|Swf|9%C!ijv2PrFT#DV;@n_WFSf9fw7$>R5-Sj<Y(O%OdkNYKe
zo7?U(DaHX{*i1%q?GLTiJ5ZWiGm5ollM@;ps41>)pp29dK+}#yP+srZ270VrJ+`Ua
zr;NcR8c^57k+cBDEX+6q&X6O-Q_dZ}fQ@;nLkbCHmc1K#m%AXDB(#BDp2B7i1hY#&
zw88v-#`1-R@;f2Iw&rBxgR)xBMFyt1UgBgaBXnYE1AEN9q%#|1Uil@=<`K^}gKc`n
z`a$RHsQDwS6%lJnRrhbH7bhE`SBq@*2u{==l%4_dN$D>mlCdw!DV}cFvkS+J&9RnD
zyPhnq3a5AdXn0N<p6A$|7f}L6eEa&0LAy-RdFRu>IM2Y9VIMlMmXW4+@G^05B_$Wj
zY9XJhkH{@DS)rgdLelG<Bn8Cu5lgMeZdER32Vj|vEel{o{ZMU;dW|Z@9ESg@mW@~F
zY+N;fjk~ACpja)0PIS^5I%$rVSy}~!CuFG*whpi`{`G-m$;I|bMR6xC>J&044d$-v
zM%>pKV92h*T&-Xke(xwFW^=*$5@O<rI|`EGv&!BK#QZU(i}cA=JDg4EToX4dIY7=*
z|A7PE^=NR4TKld1sIVh0rqfBdv$ocEFJXY^VR__X{t16DE%*G<nmm6WdSiFZ8FY{z
zmf)EimZpA52GXyocC{ZYIr<;9+GodjRej2M2oGuDQTGxQ)4Tcnc*pPEKiT=;oW3)`
zBk;9*_kqCy+uNI&_kY7DdH;9q-^AtvjBnxRUp)WY67xUwy0gpsTmrBl|NmyC7R&!%
zt88v=KIZ@X8lU7Xn}^NUXYV_2JDrq!HjQ^F`GTTnNH50kT)DhvT*zrXm)DHvQga-o
z-UWDw^w{8l6_hpTp>=<u^031lV|LlWfRWBLk|p>)D}0HnS?t4+F#0Mhqchmptu!0a
z`(unq(H*VI4$NB=`8&5=h@duFU!~*IeByC|8!Nq1_XBc6EdJ7MZU2tuZ5hC`qxv8z
zgse)W0+328PjD!=4z%z@z+9r=Kc*flSRQHdn}4E4XczvxT-zT`nx}Ky<}@*h#y@8w
zy3Th3#xL8u9YUkqM4?uMI*`*0e9%iZrF6+*{t1*-Gpnl=V`RWqh79oc`KH1z0zM`Y
zh{G@E$RxYF4k{+yM~(Osqm5-IkSG1i&7h*XFExW-4t_a>)&Tw}Q|OO7oCyu8alweu
z-HV~EM5c_%T-3{}P#+faihZfG?X@-FuYHf)wCNN}6&T4(reuTz9n!t_!YLCN<HbTu
z!JHF?I(u~55XtLeI(2#%$s4Fv1>QgfO%Hv4f*8ktjWI{oN{nsEJ81BUct8GhFU#a;
z8Vl!5)2B&?mUZOqtAbL_#n|u5sF=Ka)h;I4+)Jx9zBg?*g%{Y(CCjNbXOxq-uG-y7
z0-@0_PmBpa`3YNu>=T)lIl8`d`okQ2k->#pk<F-;=8e5+N4h=XJQjsXCY)l>a=%$L
zNi?wnu`qeb^vsR%i|DB$VlM0SB#II)_P^&vWRIWU<+GgrM|;YhRlxcBU$wTqQH|+;
z)!OD`{`ar)Nx%P%bFEkJl571j&G}=R^T#yjk7>>y)13cHra4csCK9P+8x)P#QATr=
zH)?BA?6|EZQTG$;W503OKw_v|SE^ZM8aRzyrj}`bB)AL<WQq+Evtno)q;~6|ielBh
zOg`;&G0<-n|5`7jyaw_yg(u5YoY4c+DqYiRX~6h0U8SZH`!4k3-{jMVwyIOIDh=H&
zB$5qV71^v8<SAQdU&T_>D|KbE6X+A=Jn8ZUomf2`22*b{-mDg&C9da|UeWNQqt^Iz
z$}?Ft=X-A(dp{_0$QSq=Ts86}gKPlmkH(>I3Jw7~W(icUUW$)#Pm4Sg!4p_#D(iTG
z&8CYXi0Af*8&s8tiEEow`4by;!Ue<x49$oHRn*c$!AKU+djp6@vc?yJkS%<-1~KY+
zSNzW`IwUfj5tFpqn!Bvnizpwzb39@NGIglD1<f+IFT0+EX&l4a8Ln=4^59}RwX)2%
z_RoJtzbV7ozl$gIK<r3YBRzp}0HcYGT;lNG<P;ezYQDQk)DlbreoHut#B0gLZ})$n
zo`DOcb}Xrcn0?<JVyEt<Bq4t4gqY-*Ulg%H+zpBbg~OLJ^3|v>Tnon_T{hdNDK3_2
z%(*DE?bPbK-&Y+|5}bMTIPVxnq>^q#w34}SD*t(%%sVVux|8bSk!0KRm*|Dq&{AW0
zh;9~*W}b=s*4wMi4Jb0owYg@rC_XPFZ5AKQ$M{`)BkDe~*|%h&R;H@#jbF0W4Cl$L
z?OP6J9*&KKR0)2Zm5J(pjM$L)nD-jOpJoI)wv<`#u9g?mXv>x9!Q+H$o=NcX$T*e&
zF|Jq45?`%RXB<#uV<mDOJ@P?SAD`p+IqX|F1P&S(Fsvx_F$)HkKvR@VqM?fzj(usz
zATcsdb6sUeYO*~zAT<W$YNtdEw3`HLSMs=BJIH0OCXk?ee9lmf4hdY-`P5DNo@T)2
zn&(#1nlD`+&%F@sb%WWs$M&76FX)tT4UhTA0OV2_F^<KCJ$CT3o67QEnnl&&&u%K?
zei>^uez0Tl-*~&Jh0TMY#8J?0Dl4>#hDaDQmXd>bg=k&du<%KWL6*(2H}#w$ULTD_
z;DMCnpuH1@ymm!k$7n(_I$kDY_bSi3y7b$XTNUr*lFz4a+it`;X|e5!NLjq|Va^iv
z|8sKhxrdE;f&bU`Ms+Lh|FypLX#f8zpQObGbJS;8YxFC_RCAuZEN&?qjcr<yX|Lb3
z+1}1(cVnA~Z$A9$4SF^l>{FKE4rVm|%tqw4tZwe&E7VRW3J9X$N0C3D_>{Sx(lM#@
z+eRxY8VNbO^|%o2(B~aqe;seo893fhCXrE50Q95uN<yh}ErZPRrqgV7nn$XU5o|LZ
z$=N$s&L<Z{xpM{axjR+w^7%Iw5QT(TXb%?n>F+&Q)W*KjXmM(p5C8sit5ZdP*~$IA
zhpT7zD~wm|_xB#{g5gHIC%%kql%!9FU1m*ZXltUChJrcZJsyrud`xuY4ZZ0NN2Q{D
z1Ycs}7j<Bz(;&%^5HX_r=X`%s7H|D4Or}KP^j97UBGd$)p-KLz(z-<waeN*JeT;Os
zEG~MkxIOY<iO*G0Jc+ern95T6*o`h0H0Joc>-#vV_B>AlcY+6WQJ4H8E0FYD`tqt^
z%uXsvP!~yxF!vkXfB~))ufF+)h5O_J5V7ZhcEepXPR<M%ALU(v|AK(R*NH<p$Q7(i
zRr9AsZRrP~kqFEpJ{)$P-lxpsdR5bB7P>(vbA2zsM`SlnA2T3BF|ER4bFgf~v2PPe
zZ#TgXKQ9eT^Jp$C(Iv9C1V!z;1|(`Ol13dpP5Ed7tm?AZ>B(7RKDPz|l2xULAaD(N
zY_Q96FG;C*DS}x)8;hANOAp2#Ehu*)-B_ZAYuCp`5vmyV0sYuD22oZ#Q0b~M-WV;S
zGIJ69#EQ}jqo7{Jv2yCUQB==etf+d<ML!$cpl$3SThGg^Z8^RHUphm*2|GPyr_rel
z4DlmLAm_#e<e!-MRJImPc9FeBHI`v?G3=6RCv$qz-eNwqXvMf#B|}uwcDnfcAYS0y
z6lmkSuO{W>{yWE*6W4y`S##o2&s=j(LiV0(&q+v2^9(vMxi8H)V-b{`z67rLI;SWi
zHKEj^eDr&3<6r-?g#Bma^!)Jp9u}a5_Mgqoxcz5)<I(=}RX%HLD{E^)+Pdkc)&Kh6
z|LgzzU;o$t`hWhf|Hps*U;p)gi~st6|JVQVzy4qU^?&}?|M6e{pa1&*{n!7AcNbUJ
z%a!eNb+gQM<Iba-Vt?dKgB$VM`E&t%-M=iSyM(T#x(vOm@3q=LW|*Limxd8)&kx)K
zOxs7kiEH-H`&*}$bn@9d;H)brSW$gbuTEy;Lr~b5D{%?=O`EM`k(bta3?7`BZ}aAl
zRfb9a(%0Y&^44=5oM)fA+l5N6G(f54Q$`^(Njpk9PPP<FV+QqI%tXFS`OkA9RcOwJ
zl&4}2h_Z>LK}?p9Kve!w)@+zZqp4R_CC(V%IlWeU{^7bg`%++5zm!;{Xd`xvs8G@v
zBd^~B3I8=n_+i#Ki{ev6&rV;J&p3f5$mgHf-yiaQFZ@!VFYp8SJ+MyjEQ$6n3;P}L
zzBKUjT^8;RdxCAomS#335Pw(tugTIoo!J<j&IM={>bV-?DQ3A+TJtI0P``Ju571Z@
zWs-80MvQvaFIU;3#)vTU+$FXh9pA1`o2|D6K`DEs?jrAvGhwsx3*t#)>T<EuLZ%ub
zlKye{k;!>8y09o?ejiNL%XN~tSI#KJY&gZufhRoE$H90sy)H((AI@oDZ@ISm%fF`A
z<nmy(qQf&E(!(JyVtvG%9bk9N@Fd8VC6en)q`5GdMNDS~yQ$@UF52*B!hnG6H5&|~
zE7eVw6Vbmla?@&WVIv;RYHqZNQ$~fsSZJ%c#bwor>&4dIGN+?tCEM2_St%X?YckW!
zj%2u~suRhZ68pDxZO~j$P6zJ<O!&WHG;C}IMHU_Yi^ijr*^R`z-KYyvP(FCmiz8UW
zmu{Y0Q7esnDY9(Ji$1CBPy923XWhA*j6LSg?LE=x)(bB$zR5zR<^hX##?%Q>nn8R*
zEPcS7lQij|G7nDG!|mYIJQ)_51VVD=Bpk8_l2YX3ecm<R`F-QaFXa|+d7b+2t*n26
z&l2{Zzu!Ibmp=>Qe=D_WJpQ***{nU<f4;_NZM75&0Nx`T&IX142EN#HgV}WIiSN&y
zi{L--Pq}yT>JJvpi>(*|y`oyaXE3jf2fa`9EXBIkl7QSbl=tBxc^@c{cVQT8{p|ED
zMS8~KUVr_S0$-m##aA5t`lpC|O$mLKLrg}y%1~Eq=04G`cBm`1cDHEPM5rq^b;oE|
zJJb~$x^uK^BGgp{3Ew{2H6_%Q#(1}A*I1}42MaHbcKvHsoa<lX5w3q_DGD?|yn8Qr
zm1T%FjTFR5{u+zE0l6imjBScbFB7wQWj3_9kZr_4NecK*7)BkDBq4UhWY!%*-M_ZF
ze{;#KP9oP|JFVCM2@7IHT5dcLx9Ds3sD+eHOjAazHz<Q=g9I%ouHp3ic!5`W)k<Vr
za45es^<=v|WPoKO`b&Z(_0i?Pip}j8Mi+OrEWW-LU`nrE4ltXBza(5zb&r9?OJgUa
zx4c?1t9Usrx&ZE)>HP7tqn1^kOB9M?)agyH^A-9=o{RjIJrvPj#=HjVf5v)DyY7e@
z%)B9v-kJyVQKotINxguI(qw8YLYgH`IK4D*=HxdsKiRp%ZIJXB3^$L=v7s22RU~q|
zu$fn8liKyd<|=dAR~Dn#dY{untcGo1O4f+nFzf|lmrrQRvFSylJcyJLS<~{;95$82
zkW!TuAP!x?XhKJ;*bbVPpmTt1?B&i5_7_<o)JJ84=Y~NDX}&qC9|B!X3G6;5GAI;S
z=7zV2t<yZMqe7vO7^)tfX4EO8`)1zoprQ*?G&1~c5+ko<_Zu<dRJ78n&%*1KB#zr7
zmb#pW*()xv1ZtTtEy8W~7{8f2NR8dAG_qF+n1f%<w_{z$HfH0owfz`P%2gr4p+5~{
zYa@`PlYZhtb5VF{FfFQdrErpQh7wgvUzKSrm+C~I$0nW%*mRm!LgE_jypiwKH*vZ6
zU(@yK5Aj*T{^woZd_rfLJNL1`|7&BTww>_*dW`@3I-jHt+kF4i5AaXA9&5hTx~zAH
zZ11V5m6}9pcS)?|U3Lb2!6AT&rqc2s@q6T{R3@KDPL$no>Z!Xh@)0dKD^GJhU~q_8
ze|dP~=jz!2Es^NMnlmG*f%!a<Oaf=C10ui7m>hJxaUPS#poEb&J#&FvB2mbL0~uYg
zmyNlF89yEdD$GQYg1d;879sC<fO8@GmdIpsTc`}MX5&C+N{|pq5iLE<nRXYEGdm|I
z#;sCc#0K!+B=Lof{$zUXKS9n5i}%fok+AsB+yDuiDa?(Iu-E0h&<Ja(qy<LYBWp$T
zedl1m(>!XP+DnAKCxTu0X~ZXO2sIl|E6jHirZTRy;%*RFh9!R6^Zier%h_?Xcwj8}
z<Z{nC>;G3vfxd+NPx-&U-2G408c6+#`=2(}ALakA@p;Vu{h0szG5_~t{_n^9-;epf
zzgYh7dC9+*xJ@v;3D?kE6xxs7hcY`+rnS4J^QL>5#OjdTs7c-=Wzp#aCoK~DfG<)~
zz3h0H;N=oiwOs0FQ{uGr*G}KPAa{3Uy21>w9ohWq6$bHRIv55-UmFH9g9+x|ogJPw
zfjjKM6cPk72ltSDYNhmRyomCHM2Io*6;ETS6h8?^bZy}>iJ&v{ZW@NMKkH~yl1gU|
zciH^93!sXn5lx|4)|evdweh30^lzYyr0H1pRrwT}sYd5OG&k~YI+%odhw?!OI`iwC
z{Hn|5{QXJ;Ut-*q<hcFGZHK*d7UHis;gWa71}>j2GvQZDPWT^c<Vy^E(Tp!O?l#n+
zG^Brofva68J`#F3k54U|Z~9haNOFT%zVa06$t)4!IaXw;8!c3#XT9g}W=$EwlABKI
zK5{EWP`mRsk<|MgvWe_osj9y);Tg;ZR#Dg?#}GFk(VevbFX{5c=xs4MONN_;DrML~
zc|ERJZ$W`}ohjwYR+kw(6UIdbYof{~s&b_gTPe=D<BjJo6+4%<JTzcJy8qFEJwg9X
zP7W;c`l9)=v&2J5u271p_Ai(=KK6!9&xYv8n|zGacppfy!+)t1-OJ|ZUOGAV@|n4p
zPRo6}oZNRw$eo>pn|5l=Lr@D#QKgEUlUv<?^D?dKl~pxTOrpAcHH})WnbCy5x8;{V
zOW6M%_e;nBZ6^GG;Mt@7|7(06?f;MV|3~}(qy7KU{{LwI{}T59dLzU5uU;&&@}u<e
zAXfgmdn*&a!^IC%?EA{=CEeEl+3qgQfM0hb>%G;FJ1h!ycV=8=_bBgs_$g*;aEFDL
z=1rRFI~BDO;<!nTUOh{-!Q9$ZUv~{V{hwl7OB&_t?h+RH+rW_^uDGq_4rX`9W$pXG
z8_Frb=8Eib39AiN8sxskI0+W#Uwl?~m$1q|_~376dUp^;ck$R440IVg{1=(#TNv9H
zO*3kr<}@1`>Jsz(^@o2ui~FL9R-<1q(j^Snw`VKvJbSf)-K8wi+I$F9$+p7;Hj8O{
z*ewl-#wh=rSP`Q+`f|R<@}Xrbl+RK;V<V0gr|K_g6x3VRJd2<v*}3Mxh%e5y1x6G;
z&k(5B-aMn;qhIb<`()eyl$1T`mA&!3`dASESJ~W3=KtELKHC4j#%B_MVs^dzAA9fW
zKQubcqc*7Chn?e-#zFJP|5%Y>0-d4P?R!DI)M4{A=<WZp;$FMGj%?`L-}uYt6<O!o
z-;CFv*S`JDZu9es)Zn<RDkdMUOg^1k@1q}|6@jj-962L*N2s6sZrBUF39`{0@y;82
zun7SBggtdn^oAbh&Va51X-i|PQ+egR8-!HjKS069WHg=kc&m2n=s#8ty>7T8N{8S6
zCP5aZq3Udp?$L#}O@Q5m6$<Tl4w{FJPV3;H-8k*MZl1Pxw>JK094veN_r2bI6aUH2
z0{efpT3ff*e-*wxuK%y{0qNtd6J7`+0O5@$Ls#2)wXG8^rUTD>PZsHsJMv)_UFiBD
zTYX`LyCAuMfUp+0lcCdd*9P9WzlLp{yVFttGMqmux!jcSCvHIfg=GVlkZ-edW^^ka
zN^mH(ja|3TW?xyzABc&61)>vtnO^yHkU&9B0b7VM*Y*(Bzqa{vAQ9elfvxl|K*9vM
zsw~<r+tE#nKk^3{qDu+2gApU8ToyY8iJADhNo5PqO)5pvc7~VE6sxwKF`&+yOnmXZ
zGoHfY`bX-y$>X63ejX1^9uG|(4^18qP5w0xP4)rq&RgTKL_W|@=y&S}QL&!@4n=ik
z1@`hYdC^30KI3ir+#TcYid)3kzd=?7D;RgY5H~XD-f9SDA5ouwUr^?D@xG8aPC?1A
zF~$p?*wVySv`_BMOXKIIGqhX-qe`n|I%N4AJ$jki1>LE^J<P_TcRqIeWERV>qQr3^
zO(liAahV1JQ81y%<CFc_q>%7{oL>u|Us%iU{!N*a2r6i0&mUp(y@kD16HjU;01UOu
zxbTBybE#l6)C+4d*q=3u(~&O`Z_L^%Nn9`WW161TDYanD(a=ZRAqZhv&+!N+?H!V?
zISrAKm7z_Cv^hlrhkYl4Sgc-5qnQEG)4hHfAC8Ov6qy($5q`GXdr1q5WMB9{?yep?
znz4Whn=IbDY>K~$<@ENHBItqNcG}JV(V)$8gPJYP|A==^FYv=f#pq*nir^mvu1n*2
z?+o)7)1sh(7Q{zw_=Km0(ksMd>6J|}vJieU3(4vcRpq$@DppvrU}?Kk6zDBTih{2C
zEP!MrewzaotUd!As!A`=(3>cl0E+u~DO*4{&dkQ5qMyap1!y_>N^BS!r9Zegi&1JX
z-3*jkg|bnKD?AmY79=oSC^#Rbk_{%Y054)F<)TTHQXlhCDjSQ6W}#FvN;#B}#=?A&
zc%f`LA0L9^uj1dc@hZzC;5VD!F{|T?0v-nB>17O36Wcf)R(Iw`luu698+RJfjf;CK
z{FSqsR*n`*RE`#uHTjq?5c^kii<~G{1fG~Bkf#=i<<yUx$e`r;lC`5U4CA-vXn23p
z#XwOG#A<go-~;=iJC0I8Gs~rErIVYyy*-#m{&*$U@id6)s_q-t6Ht!wihCDRwvA+^
zdf%*}H^pKkf+Xvlutnn5_4wS;sFoBU%!5Ymif<BBb!?2ueTX@XXN^6xX=}e*m87E{
z%<l)k9$|W2yA6-i6K8;KHJzwrU8l<%-eV@mKiMbS{#%{~&ZQTYZ$`s=_OamnXKQ1-
z60`qqZ*Fft+JC>sXXuR2XU@61BYG=6*g0Xd4lpllNu2k3^luM~tgQGUKOTDH*)@Ih
z!|Rn5G*s<~F6<ayZ)K$$IOE=hOGW+h@P;$YmhdS19CS|k3;0p=1C#;aCi2JH{}wRg
z`M6eI{T6g%d03>{0cP{F$bE}vDLLG+b6XoZ@ykn;&c}K~zdCoP;$k|Tgga|%=ic;U
z)-A)()|jkia6{0$@Gjl8t#YNjRR#(upZ_EBGC_(cUH{{9AkyDYX5oeOB`Hw}@#Kkk
zebzkO@0=dCcW+#@w|#Q)se3)~gQ+;KpT6Dw_V~m8S{U?pzQv#TcH&QT0^NZJ_;Uw-
z;CA=`D>mrUllpr+4sUmk>hBsne3*jd_<OTpC`v7j0-PeW-iPIp(?e*&vLBqUfr@dA
zKlGPU4Tf4PRV(G{dg-lqe$n>aAaKf)Pv_Cl!&%=~*~47G61)^kG$2ZVL!6g2BTCOg
z4gB3%^C#1_q2F_cYh7=Q2%_$&Sm{!P?r<=h;AOrsc(}lk&T8gQ+;JEVd4?kV!j9$i
z`>?knW*voKwpNFlROu&BIV_2%lZms_y9i*KfhyM|uSC;)@RW*AoZcr`Ji7AG>-M%v
z{qDK_+r2b@?|AFax8em#$%ox@vm`9X(r7lEdhk{~diE^-2)@C<?H=U=voVlx&I3>0
zf>09j9Mv6P@*1bJ%G`P_XZ(Vdwz3itW=S-D1d8nNiE!%}i<I^oM`)_-G=8kVJ3ef*
zcV4$zhr6vKq2ILIhw5QYyW%Wb(#f8_jX$z_=$tm%r|nojIQ>R{ORlB_bbyq^g4;Vd
ztiQqWkJf9V^Z{tz4{{NS?)~`V`~rvj#(U#=V%+ML4okFppVx8hokE7u5aLXp`|suy
zeTY&Cq=4S1k{@`$z(ZnfC0q=jO2FrPpLPec;ZQgG-yB;SYs|Q~DP2ziW@0h{)CzBT
zyf@Il<RA4Qq?xuCwvHP|xFXcVew!b{1op++EDR*4-E)USCs>m_^FONP>e^}{hh}bE
zOS@G9a}MF8735+t(ocOa5Z#$K?62X7dwuzXB@048xh%f@Esm$p5u)BVPF}a#jos?X
zk`e&npCM}h&^&H;>g~=!y$Kt0RrIDVXjY~7iBT*lNt?&t{4Q~N>E*#p|1aVLEENAL
zL|>CP9|YR%@a&C5DG-9hp%j={WZKaJ6n<EGx^~B&Gn9|C5GF<-Bwfj;(Y_^rPpqqs
z?R`jnN@DDd|K^kk<*_%konQy0tF4XF_4BRL)<(PtZZGLYOaX-p8#8TAv{7PjZx`C=
zKvUQpHN0Lc0UWr3QeQoL7LiEljX1)=0HbFrk>b`*$BkX7tj1n_Xr8{+u1Y5)W%y$Q
zo-sFfxe}ko_WL~yf!sFc?26wdrzpJaDK5jCr)vFO{q&^yW2f=Hez=>1q4$Pm_nKBc
zj+TGrWO*s|S+Xv-Ldh9&-~MK__F2_RDc-yAds;f<0cO4}-Jt)*EO0y&4%{JnVccVO
zd!s%LaBXc*Jl)&*cpUiWfin{5s2z$tOmE@iI}aC!KbVU5UO0o1wWqVb=YK?Ge|(J%
zp8EbU{P=$FV|{iFQjHVb@bizCy-Ozu0q%0wnLZWHsK2!#o<4c<)S%g0(n?HLK`{jz
zjOZd7oDMlEAydF{{<kr5Wb6Ml)bJr3z);EG-rmg8|JS$It8x7wN<8ZSU*q$aZ&1}*
z3ok@z=B});%QYV7H%@lH{muNjQ!@3R&$8%o>*Q1y#2-7Q&8_wA7wSC;A7&Z#0LyJ`
ztbbn7+x54<sjoYw%IB5Xj{NO!_Jh(6mXX4Kr+xy0o2qj1W_M*}I+~EnXnyo*>W(HL
z^b}T(o9vSbjq&Tx*1|4Hhi9+9(r)ejutZV3+<Ik2$!!vPkV{0aYD*;u=pG0-4Z?(K
zvFDU~!PG49L*pm={U`S(dT-Ze5X=Vb+Wa0HpaM!MK6l5!Nks`0Z^ye58<iJZR_Va~
zyKz=hy56k35GA}Nsx<cds0@S`PHl6`EQ9U9Z0P}gHedFgn^3H8ZC1>O;jH^N@pNtP
zX!kASSe&BpwO4;?mSTVnOn#m-E{TrMu#;~*pEn{J%e+CvN00@q8^Ff&Pot#jkZ|_V
z*r=cp1R~ihz1pkCMwu)y55uxZNUmk}1W&K0$$~vPvXRAOZ`EYQpBpnl)1V13T8p_-
z3GEISKA@&r+b&n&e^tQ`NqdU(gU|A1&nflXAU@OTrSZmiY)@8h1x;!8ZC#-|70*!C
z|AbDZ-{yM`wxjsLXAA)fMldad2xBXsS3vijsB6E_R|!;$lXsxgHBX^^XyKJetVVx4
z5Z`~_XdSHd9e3o9(NzGH<`rNn<Uwn6x?<shaIn%vrCZ}`Wj6M%L%LN9$ESGG=M`*!
z8MZ?}&V_P13^V3~Udh=gN!YE$NAKe=^&6NI^94=}flYJcOjBW6v3H!$>4jE6R(Cu+
zo1A(>apj7>JH@Lp(M1ChCKzKYbn*-+`bL!6C`3p2BP8{G5e{8<BC7a(>|(p8xEMtE
z$(w}23B|zihO+>;9H1JYfKJ^03gX<}iV*Wv@e4}E(GG+Q0NW`!VF}v_b1N%yhht@Y
zr}Q}{Sc=kxxmG4NZ2-Tph(ID%FFAUky8pbafVx2b>pg^wG57qZy1rdmPx$|DRUhTQ
zukwi!C=5pAb7W^#z@>!ht~0fsW142qk7a32%iKH-(7B$TNhik-&7<{NqDYvM@!1=3
z>IaVeGcrPi7+w&o;GK`1VJts%5R79m4!w~#rM`?Yrlyn7xg-E^gj=PpP~0|IzXLlF
zRfxfx8@o30a#!AXy+(N|-0^IruFCZMac3I2JnprQjyk7%$HnN^*-`UH<LAM?@dH8n
zOt~h=F%B7}cP^Vs?S&op_ymOOMA6smf50vuxPwPVQuKzv?ZP;KiDi;BQ?`8;)81s6
zPJq5HR25|59i+R5fX*!2b2_+PWxULMqy1Vx3z*@TCYF_RkpzxhMW%kx>G{AbD4(}c
zb{1aj@$=9qKlX-^ry>-UcV%V}9T6IQ(P7<4bn?bxD={IvE}9Vvc%mhbB|(_+XMsQl
zk8g5=z!|w$e()(Lb_#}%5Q2n-LX1`}(rzff@(xKc%*y!)3+6kR2o=#Xo(}T4zkFAz
z^+m2Io;{;x3NO{GPDq!LnsqxEUy<+h3b5JIKdP0Fus!@-dAVL29oO6K#=iVr8GRh*
zpcQgN`z>C$I>MbfQJ9AC?Agm$*EpPs%h#^jEmdExua9t7Jx;VmIDoc96tqvSO3IbB
zCmpDNi+JC=_8x{6nq(biU}Z8mcc-+31|WOqpG+@{@~Sj^C&Qxi`MmC^pi`F?R%No%
z!m}uashPqOg@)7SyM`D@LVx2<+czO7$CzfZ9-^fVzvZ6{rgJ(ROw0W%Jlx#}wE@e6
zASu>s1yFtH)uDf--V`W<s;0@$nkt!t1G+KAXDGTZ(5Sd@E?p6Nz#!eh060|$WaguI
zhcREe3VPII{5y(dR~+WW=2&uV=eQJEI28HP{?UHp_1T*OySnqL;zuignbD+hSxpbJ
zA9TW_>C2;kU9_g&y2A-Z;P?WTU*Nz5asbXHhmTr;VnWor0Ej?$zj!PzDDdY-Nt2e>
zJ+E&WY6@~)<8WW(csr3z?&Ma;D+>stW4*}75<IYD-s;Htn;%T3f%@r<>8F(y0)60a
z#3}~oN#4e+&ZT;*fcaH7;!4zFQBX@dKpz{}RXHX`BlO(^2y)G%gI3N+vLFjGcM|{n
zC#FWgE4<(vy<$g7Ob)@AIB6Uo{?x$;j-xkGUWRiY5bks}XD8=Y<Ug>8;Qx8qREW^0
zV6;$3rg|`&<n<_?QF}vooKI^b%GU5fk)#-S?ywImBmmryXB-BGIp`hf!1nR<x_ndq
z$5WBtEQs#SlmoM9yD(B@U>XWF48VKtV}RVHV4@6)lmsx=@5SaE_yMqnBuSGPRbMoT
z+||?{VpmUiwyPCmx`+aBHlCKB77}PD3W(akvd^k~nWJn+L2?Y69e0mPS&w~1t{fw4
z1>H$5NwpABEwoNwBak8j*0hX;3}VFWDMZn&?%(jraiRu`gQ4RG4r6Cw`GI8rAj|@p
z!hAIFBzOmeER3I-lB$Wb?b_?U$Y=r{M0<lgCHAKIs+H8mUa_G&gzh^?5nXf>jjiW7
zD^{Vo4Ggb$f!t{SwRl0{s&Z2=iZQTM3g!eZ`3Zkq;Y5sarBBOh7BbdxuH86n?461i
zYAli~a&eW(<>g##Dj46P#1R7DBT@i30c-API=NW{!~ScGnOFh>&1WPt*|nJo#+bcn
zoS=3tOTi4g=a_961Q;{v5IRX;xtQIi$Ot7+C(|2R*9w0yLEd=gY8);isn1eG(S?<S
zu`efH{Dpc#@}k~~G>O#NnBs%E!-%ph>Y^^Jv?;xpa;uf(F$rKD_xzzD+0l*?!nW4A
za6v#!-%2EHFW5P-q<cLf+sLBb;cesauqD3hgGi_v*B%wr08~=U3nph>{JS-i@9M{5
z$9jUXnm=U|h%x7iGE`3ss8`A={`vX&&{b(8$Q1_Vj5I`YnT{%xM5(D$gmX9K`AFP5
zY+^7b20Q+MQHtM%Im+ihXQ8Cv!QO7`r)TZO7_mI!L#a@v)6OT?opc8MC3slGAFkY|
z0eMW|+WQ(TYF_gPhiC1#`>!8>0b=wJZ-Xj>RR}{J4vV5YV?=Q*c^?^B;QoCEi{I^+
z&5crFQ?Gux(g|p6{|6{=0C1bBz3{p5gesJ(i3EpzpL9q}ix6JGT%>J7S?Z|ni&L;q
zU3mBbWN=v<$yF(+2Crrju#mzLp}KH+!~HG<epi&@Vnp5Pqf23kk=`TKu%4-hr0&On
z2}RSk6@~xF&a1|ncQigKUREnj8FI`4_achp4pp7rq>LtwqA(tyMZ?}pvU&mhEz=7b
zs?1*S!ScPJ8ERfPXJhYLRn*3uGMadnYyV(BwkgYeaE|EDMxz_Uk|q9zDIGxkLC<2?
zE@2H#(Zl7!4ZNwjKgT8-n~_$NTLG?SST|q-sy0K)0B7(=T^M9!qaBm(W&gOfMDSzk
zg+6SSv<~$B%UMW=)o+#goGyDvK4!45&j#UYH7R9n?nPLaOB4i@r+{|Mu!qybXQ7hG
z%@bCP+0Wzz$=>eE5auq=*uqKh#9peP6&K)p$@H<%Qs8FplndF+iLTo#EZ{K94<QC3
zS-{w80sN0Pz)+j6h}76XIx?~zgOV)4A+ulZfT{~wUE5($&<-a4(BWiUiX@=6qF%13
z_T4AY3GVEtpvw57>jbJsWFQ2TjeDa>o=UE+qq_Vp{e@c552zmffObf$E@IFk3H=}s
zX+#k)yJF+n#<TqTvsxkkZ!AkE^jlaobn)GHq2P0kd!PW?K+!G-V}ZYaZe);MWGs~_
z#>_o%abHAK@b4Y5P`M)(Vxy<rMDFy;#XLCy`d-?U65a_t5<|B~kH(0Fs9T_?a&IE(
zKER6U!v7VOP}0}Vw6G3q=VK)>9z4i0f+oNEI_lnk9c5rB`ce54uB{=)BRfOD(Cv`%
z9sK_ei=~Qxzl(jn#c->}zuChDx%a&jI02q&^kI;FcLM4Q9VVc<h<kq-4^u){p3#jA
zLmTICV<=W-10<XU=)?jlthQrfCOMKj>9CM+i+BxZ-4In#Gy@S7p=yk6V5*(2YphqP
zwW_lXX?W{=XzriBC8aSx7=hA(pvznpxBRdh8i_rZ&TxjN^J;DV<!zgp*LEh6v1D56
zgUol%$=vce@fU(6S0K7u)b;|B{N&#3d{=p%6M!U<!_~b*rX3n-QRK){m+a=_T=K0k
znbJSl0lVDPn5tjkU+jmPPExVq_NVE16X>=k3HSvO@V)SD5&j)pN^3hU@5sSntA1)y
z<J}3-8bh2O%aw;1$sdIt%j<)sY0-vzDS9M)RVx2V^oUPVcw-LD;xMOjOGqnmae-w}
zADdSQ%Y+w^IVY{q5DU?H{+u$p(4vyFT+vD>Gj|A9;YDMy3NIX#ReIs*5~a;531%@E
z`pz`#W#6B5hwfrY#T&y4^7?Y|$_;mEp+&C93CVDzqOTTU{cObLxr9g~S4*j?AT-Y+
zU~|9xdHok@=f)qEU(l5p#GRb+uu2b6%&S~qUz=}g^ad4Fe#l_pU_xjY-u))li(<Pd
z*2U+@gaB31hP6HqXWbhyaYB+$u=pBwr;Q8H{`vG`2}P+6wHSlg2>!9WYW_UxbS66P
zhYOsj+v8$e;R4CwJ_y-f3LzI>2*NM?*C9g`6B_^07WhoW0loRMg?o}zyB}JZlprii
zS*rL~rY`7~@F}}5d<pzL2=eBV;#}l?VRB4jFwKhUOi)LY##B&;B75pB4wQ@|yevPh
z3|lPnQ{xaz_F{3AIzgy3JqaF9*%CXDh}&jkGsQQ&P!|UZ2gcDgHK8U#UGAb<(I>3X
z#2c5=wB2AOxz9b}W7V{pHn+ehbB|<=qZw$vk};K3rGr=ZxPfI2mlK1}ac1ye?v&HD
zQN1Gk>-$Cu(!e$Iky<lC4n~}nUfKouka^++A%>W%)x=$?$zcFwy1l~7IAjN|i?e}W
zi+QA()k5w+v{i2_Iuy3s(|DIvQ+XNH+KnzrG8YtofY^IZ=;E5?hSZr&F?XzdQRq~s
zh%RR0W9~mb=I~UU2Tm#s`pe~b!KRE3XPa9#tR-|c6`C=)8Fep}yhSP$lqqL|ml#Z4
z%#aU7Z#XA>*CmR1+E+FXa@b@L%Q{yM-$ww1|4DV_g|OV*5KqA_XzA-id!E{Nd_RH;
zAp3Gt%W74wxUpREZ#S{Hp=4F7k0i9jEby%E0cr3h60ieyy=mYC9`rdTw+*JUQg=4|
zWbB0Kn3wm+UtW0Pdr_@DhcC~bnFn@@rnt(87ix|_FE!I!SnIHL_~GnSPIYbBnR{Zn
z$pAZ};<yvxYWsowR?yjrZr;FUhea6w#wtje@YWCJeCPAgR<~N<KGWTl$k}UgRaf0m
z0@bVb?uS!Hi*LcqMF!4j4q1QqN~J>bI6dKPb<06nXW8tJG<R&Ep_xPw;d%Lf*~Qw#
z<~JjEgzGK64f3tdF(m;NZWXe&TA+fZmYbXrZAqqi3B}=I>*!7AUH!)gV2>iV^P*N;
zU*E1(*0-K-ZftLFKCf)^I;h=k9V|uCw<GJwKXr))4A)hSsinN!7EeVR21G2Cx3^bc
zekz`SiK)2lcJkUG{f4kg=1qIgxGz?-2)udpFjy^Rqjmki357S0z6^zb{}txq#g~|i
zKNyL}(CP$%a|6gNRUZVat0fX{pE+TFa4!+&fspx5iwV-=A<%LJGEm@*&%Z2YsnZ8T
z?6-_q1FzNJl}K@L(goy;BX*AiIR@T2o|liDYi~3g84{pSLgei*%_D;5A{kUvE47V9
zBo1XZrFg&nJI;als>E&dHO8A%gb#lPLrlRJxaUp)3RXxVa|S-6>5zvEU8mm}VH+K`
zT;(xl2xS(rCgiQpY?mn%#4|i>z`A5ai)s?!KUXVCs1C={3pG}xs9KCYFW?k@HyqAl
zd@9mYQcjs{$d}ha(}|2voIx$y_t6>=xFB!%W6^g94q#bO+Jh*dBApDAqvc@8_-G%V
zK<AQViwThLntTWf{EIh;L|YJZ6~!#t(V~(Mv#({SCI$i3UVLF@@CV-J9vIu-W?<Vu
z_VeEl*<XI|Qz7gT(m(jYCwX5hSuLWg=h0e4joxMR8;q^vqy_e=XRRL?`<oB0t0+s#
zt~x=;jCfmyL?yO}8wfo88e$Om6(-dX`HwJ$kK+PJ6d1fn*U)legQ+hDFzT;_N7Md$
z8!T!gRyGQ)BouQYAwlvFKACEh#H4U|@Z$<+Fm;0{P*#SVeCb)czALKIW(+va7ucB>
zQ9$ZR%!zvr$fYP=ieyHH;)UVN6@S^-M7iXRH+?(n#!gFkR{FjQx#qYcYy|7`Lz2*G
zgLuf(lS=&b<iYJFU)0Eb|7{rOtkFJR$KdNO;Cv)Eqfq2|s?_v7uha_mtVJgE^cEg)
zo_4D=QPb<`j&-8(peoZ{=MA&eTRZ+@bNVvY^xID%=9vO%ISer$Jk8&QF@M#~1@mWB
zf56Fm#h#zB^QfH-d2(5M_&wtelX!gAetWyMS6jOH&y`;u<|M{!&myC(!t%gWGk{4k
z)h=$xFxhU@?nB9`k%>^EGoB5HmKTO{wm{DrBm0^8iqFxE*lcr~!CXu%&gtM$43I$A
zCd%wXA~D%Y%{8FHOjW-rRHy*bJLa6OV>ns}z&xCqFxXpm45_OZUS~v`YX>2bPNRIm
zqC_rZI=aDEhPyH<Q=01~n;QcOcZ(vkaeDvqPQ3xOMBT}oCDBrl+1F$m+`cFF=VBSe
z4?5oXZyb(nQK8KISjS>`ab_qk9Q1e9Yp2YZK0vY1#(QKPD)+21z0@*t(5jG$1EUnM
zgZ^wnh4`!S4vB}};1_=WS?wKbq6PbQfVtP?kc1w3XpR&#^}2qMe{$j21a5h<&G58~
z@rD$wtHl<Sl}SN8A@8gl-A{vw3UG^D-+qxG^<MfqGhMWnghG~HUA)hk3ysU#AOJE?
zn69GEP!W{2I1`&EsDT*x<i)DORaCZ(*Y*9*e(PPmc_eaPpRnbH)6&={BDle;?Q%)d
z?Lw=Vhemk=V%|?uYr>>ATio|hIx9N;en2_AE<Cm}{#JH8Ai0r8oV9)cyG7&lb9$Xs
zC^{WYV%ag!748zAox4+2GM^l0QRHyCVb-5e*YGd5CZ~WBK3$@}g`K`>P1K=Lv>KyZ
zmRKG8(^Wy((q))Hc!EOH=tPOidz|E}i#}wbKfE+mciF>%7eK+#r341j1#IMaV=;C{
zE{wW2o#CvksupPOkACEV>4p-to`wX2<ZZ&U%t|t$o~gKXTBmPQj$6?Hg&y68arFp+
z1{C0(4qnftd{dY#Y%EPq;-CMt+7Kyi>^V}K#^D0KQV4hX#t0yqy|J$wy#+9MDFMyI
zSdNN*fMS0M%&lL<vEF5jM?O(Dk``>xeh+iq$dC>s9PH#4t(}50>jzGtQ$h+wKQ!PO
zF4kK#ryzLXF^{vye9Q3y_QF|@QH4SdK~fgVtZC4ABx31w6<OKS+L*Hy4W?>w(E=%p
z1AjK|3-=O)tY-W88#@sR?tPl^SUlzPN<2k1KFwqo=<r5q^JU^Tyz3$26^Z4ov><aw
zt0uRzl%?Eknd>-#Tr*Kh;12M%?-ZX$jnTz}(s^%W7JY%~Z?v1M)9bmDsgZ#v%pNpl
z(@_Io15B?)yBA%Yk_^30M?m3abh6dMgs)B)t>Xx-R8-65vUR$p$7^SvMOzf<x9q+d
zU>({q@nJ_kR3fFmH(u%!YNts{=e#<hjL*17s(O}eG0|T9h@&FryS^FvPCxGYjs@nY
zYLgnODq^XkYJO$o%3agc)uR1V7MkajXf8V4q^_5AMO?0JncLNDoRLS`?6YUqvR~NR
zQS&ghsj)ZIP0h~|%CxahnWfYjh|ViT=F1RMGGn|8S@pZ<@=9EgCbu==Lz6U8>QEAS
zRtoF*RSQ~9uW0J2w!Y%@Om&3{WW^|ill6{8yfJxh9??#4!TwhHY)~quZ3P`+)gSiL
z?AVi7Fp9lW($bQ$O$kGYNFoNzrle9N0Ha)#fEwj3m6}))b0D^k6!Xw2*mqG9vR9w+
z0A4?t^cJO7eA74;6qS76w11Mt(&%Z)YJ(i|FP^NvI^*lg*gmNtn3_ojoNWasS_mR&
z<2HZ?%>HO%Bfkv(3b#QQ)0@&TkqY<ZO2cMN0yjpQ&wb#GtaywAYZI2NKN1GcWtHCt
zpLDx-4>fY-hrT4yd~jt#Am~tq83<r=Dt4HUL?lyOVr;QQmJcu{;H^uK3An-87$=AX
zCfs{94@Ig!cgJo(2XNzPe0p2QlqTw;c(Ka4O*}1frL3aZiP8s>ReePWMJ5Y`&vWUD
zRusHTT^#|ZSzQVd8l?Osmcdf(Mr0~+m25vYz1c#<EeKL#(OgrQURom(S=!JK4aPM;
zmM<%q?`yCyI-R7wXv(?C`C@BS*@=&sgH*&MM}ti2o8&=g3avoNLSi>0nwMK*jffvA
z<E=}Hz0lsa>@6*OM?5&tu5s30T4Nc<5>}$S1g5=7$LFVuV^mdjS-}(^<TM_iHd{w{
zeb*^wJk39mC9QO(^YWWYi>$1+Q0iG4^0@SsYJYs0Inp?T<{d|Q*YTF4h=#pqqK2bY
z5uq&||2kgRWCn4q3Rk0qPNR1Y7eHD<O!c~Hw40_Een9&Rs#<A-w6rHZQWLxP9Im6s
zs~Ww-pdA=>udK$M;=Dj@)8L)h=v%WOqUFv}i+E+Hes<bAIB7J*VCb9+yeTKV<2dER
zva0mY-8tQTDN0DeNCqXKcr^=Mdr<%rvqUb7XFd@5D?DkCEh+E|A|^%H{6YwNfK{Wg
zM0#c?9apS`exX&CfjI7S&WZ!RP7Iw6chwFTv%JK0SG6Usrf!V*t@O&geGB#fwEaWX
z>s<K$r}=wFyldIBtu!b0iqx%Td9qQx-H|4eJMr;J^ZkDPv~Fz2PuR3&q5t7G9xcS|
za)(J)8)4RET*KlRczEL`86>YbFyG9cpLQJIOZ1LymQ7+%3QHP6q#Tt!SiTN@f70?P
zI+`F+lURsnhC>e{BUBoZh3a1JxOwy@L)BZL*;zJb?Wa6Z_bTNk{`g#(mX}o>a432(
zD3<DxXg{&VLz<TkdhW$9OApQeblZVpPUCh;y4tvGFmFtDPGgeSvHGyTjJrox!*3W_
zw<LkM1Cl&uFmYtTw~W`Jg{|)Wv6Ydzma|w~S1JseepOv$p7`=ulwMp3EE>=Pl#=ia
zbiD?BG`Nw#$#8%ud258O1Xwbi5j48&%tYRQXw;Dk{o)Bh{EYoi?#-<*gtq#nG<34M
zZ)f=_DsQu;p=}=Roruwm+zD<4^4z<l?t<pXfjJ3(vLSmMhipl{8G7VX4di*3io`}2
zVC?Xue)OiHYE(q2dMm6Ye3<!@c4n0<^^Lu365fsoe{sFAbj7NwNStH6up9}F)?7a1
ziA@;n?p+r|cz0F!AeG2KnX)!fPTZb1@OorVA~N=azDt}BgL$X{N<V}fB2h#+N#@e(
zYo;Z+BgMQsJ3MVJPbMj|zGPJvJ7QFoDAo9}v8PLYc}hy5pgZ?LweL>3_oiaAkvK&!
zggwjIHz^?TCn+W+x;CZ3<;<?pJzpw+AQ^V2zOc;1xYLEsz)j=+VVGVg-SEtL=uG=L
zQ|SV$bIfGT*WsjOolD-w3Z<XOyHaDf6Y}MouXe>&A@k(cQeskUoJmz7uF2XZ`e|wI
z&>W3oINg9N+J}wCF)Vb_G^XT%Oqc4?O}ymWrV>EfcS3XFPT%d$&O71IbthTp&QWQ%
zKgS~?e$Zio$2X!Hx8GO}&e5H+)|FJ&wcn^|?<z;Re~+#Z5<oclu|IYTIm1OL^#)Kv
zI1(+IZ%pv=C*&@xFDWV%>Ea>23A8AvbHf3NE+s0(ZY5F}iaa*5SL+gsO&ZZ7yf3Nr
zcI4gd50|YnR6g1AJl?zk5y?hoAGPM2(srs$!pS?b=W5Xr!)VWXJvR&oGu(*rg6JV&
z1GQ0|j#)W8$wBKIIInxI+jkeAtZKb<;DpnqJoME~-4w5HJeu({y1v^!SUP3ca7|1v
z7ajD@S6Y@nNt0SkiuNLMG*nDMw`|y1k_jz2fBTUODEm^&aqDSQ^N7<I;u&x>VRS=V
zl123jiFA9}sY*3@>NE)YiRrHxGG9Tzp|JGo3U6(*?jTE<^Lg{WXzrJt{}fL~n<PT<
ziZkllyc8ZR_Cbt3DXyL;Zs^Z~9^Og9KCb91J{voijyFU@P$V-%7c|}nG`!Hhb#}Tm
ze4s&JswHp2LT-Yp-mPx)CCEc`Ms@pno3ATJOG)REUx&UDE|ihSj)EzoV(aF(o;omH
z#02Kp|8DK-k+cFq`z<9x-NOEpf&mK4@UJi@3aCNO2(P0teM#-(V!@f`bJk1yhDN){
ze+%TLN^sd5x#z0@kB8d6`8=kRX3j2JH?ZR!opOfJt-=ZLKF)LR5|eq{sQJ?F4Re_P
zT%r02br~lu_F`_Xwc?)4kzj*+yX~NowWt5}ta)l~BT{e&Z4bmu`AaH)i~wX-*1iI$
zfa2wf+_*x~`T^Y@v0-xhz@VXg0k5){4f}L`5=Q3sp$st1ksm}XQLG{|Kk+^8E}oF|
z0&g;<SbE`1MWc0K-9c`!&~!6*>j&ktALEvBrRPZ}?w=DS7q}aLObtwwoHAvz0wlJ^
zh{Yl!jxsN^93Pumz)%<O=k_sb(i@FnB+eAG9|5kFQHFCu1KMi^65pd7(Q0C-edVRb
zWCRT(f>j#;&Z`(aQZgYc5lk{)&8Cb(+}oH$Nd{82B<CAbgJ4o=<;gC+?XR3rjRsZ@
zy>J6q3uV!SwFIrJW)P#EJk5)s<`mWJpdv>Q^I}TdM4{OHAcHo+pa8R{Aaxf_IWk`?
z^Cj0Z%#XxNVtY)e26!$jV1iJbQumCQ<^W5i0*NZc48WP%!%5HYyNWraEQ?h6$|Q5u
zLM)d?rf7wu9sBsAQGZjXbeEBIbjOCJU^H)9(smQ+Sg2INJMAc@8Wu~WrM*10+C@Sz
zU!DbQjrR;?-!V>}PtEy{iwLr<gs7cf#1y+Lm8wCW8J#Y?oV%FPlVzxxAKjBCr#53~
zl7{7_qk9%3{!8FJpU>;0#G)i#ym(O%YlLaczE@phRx1CEri1Nm9|C70IPe=0>~t||
z43pZ((7(_Zt=2oyyKsA-Lg{)(S2>b#0*?@e{<+s%0iJ*1;9&x79X_;oRn}1_Mo>Q*
zPt$_>b)>u*icSR$d1o?>;+c&-Jl!U?BZQTlFXhhfxTQ<(nG}(q#(t(3fj>LHn7}OG
zg5}KFSxm`xRi2+j%-$=C@odDub!tX2t-_XCvzF7ThHEDpWjw3@W~IVe{pScuOPuIY
zZ2(L1s7PQ%Uu!dsfSzf8V5R6-h01DUtwIf4TKNo^arnub2&k{0y<ZkMm{?n^t`pOg
z_~{aU+cKAZZE1+p#8B={R#g|n$QSad3LyPB&41Uw7C4|C@m+a+5EjT}3mp_iep)L{
ztA#bWOO&<g>JKv!@zc7E7cU-cUgDP$EZvxSLI%s>_nldZArjC57$c|epKi7VIWfHc
z3Ak1-_~hP*@9=6y3GPG9x^#B<eJ72_d5bBEIOY9VW#+)rOvYIrcXyfhWiGywcudh*
z{@d_i5I($#iwQORg)hHC?>gIaxbB~E^8b4?`acIrE#~ZhM#}mFZ6<dlgLDUqH6fK2
zQWZKKRw!lgUkBrZI3K%FlGK}6$+*KrQ6z&OpauNoIS&A8l=2CBaa?$Vso}WcUb{WY
z8^aD~s2Iw^=^%dp{jPZaa(<bAf<jNZ>Z3>tDE}G$WDJhXV{?X>IA-|sj2b`M_avP>
zZwhJnv60YGT54zPkLlzlZ;Y9OQ_*y*W270RMZ;3`#yo~JY}0mf<d0udSGj6!y9^Xw
zt^)D1r9_(IGv<{#Q;^0YBn-F{7C?nCP_eK2{@7Izsu#+s3v*<vgZwDB1{$pN&9k92
zn6m{+)<=y$4V5n~h}y2Yz0?TKjbTt<qaCZ8BH$UYvjr(*GC0u0Y)o5((lHP*ng|KL
zoWgzm?rsQ(>MzDYEmnQsV1Tz8f4rePj34KoLVpq%!N$HmE}%Mgytv{<_Slz2Up`+0
zP9>ff#6QJGAq8#J@ax%N;07Pi<wQ8=c*E&bCdno@6w#&kx5HG-57OuYk3VQBTfzbg
z0&;=hg6cEDM}MCiSErY9fduZd?w47+DdUTIddeFdWX<TKFGeTxupbn2gzp{7zbkFQ
z_d|m`W_#eVFSVrq0BAW5eDvJY3m>z0@{z4~eu2jpf1kPI-d$LL#0?%LB-gPmyXb8p
z9gTNrsrFzkt(z?wq5~6=KbuZwQ@Q#L$-&x(`3YTU`i)%GznN1yV~;sj?2PBxTtOH6
zYy*WERK;vO^@ixOFmxRZi5MGf9erm>iUW$z<20{p{R<DXb?>Wq3y*h6sS@=K91{l*
zhuO=PGIWuffTA1r4bZK7W3#cSi7+gbO+*n|GMRHFhALCdV$9%>fwE&tRUC_w%+;ia
z=6d{mi_M~PU8z=TmGxV3orn!6^n?PnQp90|zvyn5Ao8;RlACUZ5cUAe?9QSLptn|;
zv$NsB7CS|G<2-(Gf^+mYBOm8g_;DGFC0FNJgL7deik|i+)&qK|eBTVY-7Y{WD0eAS
ztbXy?NctRQb4;|YoaQJqBMpm_GDhvN<{q7vMTc`}a5bK@<G_UrETJ>#+b_{GGVC}Z
zrK%32vw2-ngXm5pZ?a<wmQzXq-Lj){9cX_R!0oeVFA3qL5;sa~SLE@LX$nEb4WD5I
z2Dxs1Bae8ojh`#O6mzAEoaM!p)q(oJ^qJ0yvYn`mk-l(2$CJBtEGOQX`krd6aF_1G
z+jpPvyIf}U)%5O5NFJq#u#(VNL|3_cACf*xgMLaM2?D-*M`6hcOGN9*eiCb;O0Goc
zNu+WnpEla3op$^14pUhQ!(j>O;`UPtH6M(k2n<SbdnYjNzoH0$o>S_%cSS|d>0o8?
z5OCZb2sd~LL{O0SUHV5`w9$RcMLyx?iJyd<h;o~OR%U3C#{em^ye0_@Kjbn}HK{JL
zMW;ZV={wpy$K?2;8~C5xu|VUm!236yp~$1fIr1;Wg)gN)tjdM*?dF@~=5eDa;7h0Z
z=E(9LGPWy34@DW}lWegl4p8nR5d!a=)b4zg5YfAqevQiEhms<rX#2q%_wfc)Bl<Dc
zWhHr;U+O&-7Ssa@ap|b+8`fP0EJ*QX2G)x?R|uHJq6=D7m)Z(HK9x~(O0_-RJ2t&{
z^WTL#-}MVS94a@ke7cN{PWDER=%_*LwT_N3!`ysmab6Y;NXNWom5to$V<j?NC1a%=
zI_{AZ0BT4y2T?&>%h5hpNVr0A$pxr2s49ly0!Z$~l&#zBJw|6%PG#Mt>0c6`jI*QW
zkI~yDX5_ZBvfRupkIqysmJ!S|Z<EH}tUVMRa*fRlQE8t5Hpkwy1ylho<PESpP@~hM
z%Zyn2p=(E=khHAlW7`uO?~B%kQ8d}NDqy(V6DwtnRd*L<a7vl-IF$i7a~H50b<vV5
z=Fkl^XmtF$(#>+K`c^CZmaAKn2x^$d%&WOdr<N#B_h)Ns&<i^fZPV9ve3E5(vOzAv
zK&-wpn26n>$w<<O;$Yu?za&|t3MFYvnsLQ{HL6%B$2gyuoQ^KR_@t1Az17uK@m*ga
zOK6LOdh@Wc4~qXPEeNU}LlU=?ff=i@_7BbDW1}^$nI;^`Gr#Ifb4aSq`r)B$@VMS?
zLwkAXLE@v3XjnE?!Ncx<d;I+O{}8(=g;Na9UF*A(a7|uLwHEe6k}Jy>_w57yDz>&Z
z@Zak8X2tv$KO5Cr?cb{KcWZNVyS5JHs@ogu>;EPy4>7<+pBaoj5aQov-Pw3Ln^SJV
z`#<Riy(;$GhhCS07E2{j7ki?AGj>K^Pu~JN^tyOm(TZ5bFoZpSa>Iu)Xy&fL+?HyU
z>L%z*&hQeo5Es6U2i_2Pj4!@-##5lEf1v&Ue1vx&_I;F4N3YV_!e&~5GZyvpz{x7W
zDK`$CZdeq}F@;9dF(40%g&4tw;cES|1eZ#~K)UQHf(FGIr4bV{RGqG0;GAo?nM0#w
z`KEBX=>-S@*viQ7Q(`A<qev;wCvGtEaO2lkEs5!c!_j;kpF!qy9j8Z?M(%V+!X*;0
zg&0dAfucaK5ne+AEZLDqU{2S+#8(O>V}I)P@G`$u-s&)A3ppl2J7&k@ehex+avwS%
z;soU^P@qc#DGC%AYJb*q)1XmMNTBWnjXdj9P4)dA*$o^ub88qBNFkOWbAgQF!1k=M
zPqRj$vc^F4_>NqUDq;b;APb;kLK^$gQ<?&A8dADZY6GwD8#y<4l!Uh{X<YjPL@gi9
z)IQxDKJuq@a|56U)p{2XtI&tRA2B9Ee=xm55-^AgKPqJyZrDh20n*f%sf+H=R&;#&
zwh2N(>)`Z5{iGq_`|(NZeRCgn^w&SZ%La%}$3LAk-@H8)Z(E1^jgz*hAMK++b$Zf#
zeRkS{2f2D1YUXIgz`Od<PonYT@kyiI7OfM}e0O}<g!Vq5Tj<egv(YZ13*F(_e)H%}
zQ9v8wsC6n1o9~*ZQ0%l-#D1}{WKGdJ5bqi%dvD=q{dM!OdHNG|dC)vP!tM^BzdDE{
zC#TK5v%~s{I6gZ$Zndd393SXedx!PryT*PQV1Rx_<9*}kRJ7lcKw}NJ_2H;-f&;L|
z`kLB0Y}Q{NHn=+&?LMe*d#5<8=-VD35r70useRnoYvPy2j|~`6{p2U$MkmCET1V~1
zU(cW%ychfRcl9?g#{2^8zzpr3oiyGd;H?8}r+xOiecC)dJ8g(Jt=2xFz1=u@-`s1o
zUy8$4n-F)_ZWINk?8WY}6~G$2hVQS>+D*hCA^qsIadL7-nSKi}=N|w=fP?xON_mLu
z))9>vkkvZ*3EM?v&{Pz~hqn#7BoHqpTxG=75gnKSX7AK23B3Y7PmRHfqsE)V=9|XR
zUIX9KZG#`0?M8toui3^jP44_d9eO^);nSo6Z2Z-r<swb3Xda0A{`)2Z&xNryAc=NU
zk`Fv>pY6Ss*vDnD#u=>ujoJbxLU+i@fnGPb`UZF~1pm$`PF(p5!XoZnIOB8XXLdUd
zZBi4ghq@r~k^e*{D6i*?u`qf_XU<o+3EcQIapjE3S#gG0{_4Y!?$cY50qNejH=Ol}
z3qe`vZV3ErOjn_35I|p$5#)Jvjgj9K^edboKn2CCME$T=_o6n~xViEd)m=`Cbh+rB
z(F?B=N;l`o;n{vGubVY)p0(eTr<U}{eN-F%RG)15|AB=6e_JU3Z*FaD#pM63?e)z^
z`TuKt)>1|KTBRu7dB7Xpp?DL_#>gzcAIS$Ozn{y8X+r&@JpL$;Kg#2e^7x}X{x2wx
zs}p&3RtD73+UvYc+-k3$N22NX;j|Bh$``NjkQ@){WflwBES>XrdXwQS#Q#>@Ym}Hp
zZZ9W()8`(j4v?cAB^vg<F&%6Gb08U8Ud}F^@SsRPl9cJp9S<R}AL*<oMWH&DIlvr`
zRxXYFD$B|T<AS<%;HCAt7kgbyEhQytEJi+zb}9BG%&!7O{n-QyMOjo=&6e`3D1GZz
zFkCGO|I3w?<e21>wmYqBWaN{@Rxj`Z7wSvCq+lhZ4n=IeOn7DBq`c)CPg7AJ-MdRO
z2AhJ!Kg@`n<xHsg30={qGZd4*U@R|6T1pgo*b!@~tY%duNBNxDbkAyfJaR|fqFBBo
zMIU*i=G^`yspNGom)rEF=`61+rgg>yhiV;BoI!2^iEu$DicB$mOXg5i?4}-uYBb&&
zQ#8WMZLu3oJmrlwwJ%qepB<y@0?fW#S%en7GU7uc?;mDPDNHOnvE_e}^~G2uu7WQo
z|6BSW`9rNecps?bZEtU8>3{f%>3<uw_3eKXn-302%I9BP|4W&FP_1S|_W|kP_Vd5F
zU3r}Uukx8Q|G=vP=NzAvd-v*NzWt}V1^?Oej|Pb9qy6V=d|<z+3!ZT{mw1>fpVMbB
z0YtG{BNwgZUN{PsurGyr+OOWV_RkI*9nfDJC(U=H!FB4#O~dv~w8njr1zL&*r1ig}
z$EWB7w0Z!&;y04%ND#y)9BMBmh1nRLbwP;av~BL#l&M!Kuc49WZRA{sQ+EO~#7mM!
zqq|71T+BJl8C0()9CX^71))!|b9OJ-($GO~B6r%6h1k6}Sq>8ipfb@x*RauKDkER!
z6l7$dyZwbF12>$F+{G<k1wML98Gt4WpAY@6Gh7IzEEa=t#dsxM1v+#G8NM`TRo?x!
zx@wozu4`5vz#h3hzM+y_G0Yon?M<)6YHxa7B)I5Kufht`L@Fdy;$_NvcxN=*scTu$
zALLVDFHp{1>`nUWaqbdKA{gZ_;m+cjSnPf|zn9sybo8Xx2Z2921gztKc^;;ALp6oz
zsa%|yc-p7e3R?<AX+S5@mKZ?_KF01<Y#7{Qq9~6dfdj*lEk=WQZ>#Ashdq6h%t@Jr
zSt$N8t&pZ&vwh16(DZ$?ND{eEb3E`({Nit$76*9SXyAkw=uwYOuM$|3IUco6J7^Bd
zCkjidG7*Yh)cgIm@^!?HatK$b{3laNA9(JtZ&Oe%!HjanB!jwRlNzmNoBH7$8<iZ+
zY*IeDV}m9uG+Q;F->&Hx(dLSAGQLxDCN|@blsX;X5LcOFMo;pI&9NBUFOkg^&7Cn8
zq-wVA&tsIUzPb&?m)B25doeuWefU<KmKZIx5j878gjV!69`Ul+RuyrzG&ZIoO5wq*
z{#UhKB*_<imC^U$r2eLS(r7nMF?U`&b~zR^K@btzxKdR<hSVJ_ZHvS}C!QKJiZzvo
zP;~Ljx$kvW=nQ$pdKKH<t#_8pVZBL887VwH@ggos#Fq*sSHi&WHp!#rRzmj}Sl-I!
z=vzNn)3kTesGl|j2D2e~;^ZnaN|`s_i63arbc7ykUYlkTIEL96><2_)J@BSCd3N%T
zqvHnvf0YCB%z79^0<Q=y6j4|G#f}eO{4r4nsM`Oh`QXDz^R%I&gwU6TUGz;5pnH_m
z^8lO~PJ{)&*|l2#q4Cq{PsgAiygNSqiP7=fJfvs}pj^{(>M{EW;(_Aj^foBhX_UcP
z^B@GqoW~B&*{QGDFX65BOHn*QrV|Ic^+W8^sO7;_`PQM?OgNDoZw2T&0?M}Dhldo~
z%>-5R-djMs@e5tvB6paF2Us>8gE?alOYD-gFY->PU`%e=ky_ezr|)s|$WvsMQc;V-
zPpP#W_p<gM%=v?BnHSOm?xv;EgUHrQJKKVNoXRY<ee!l5%U@{%Og)<$YRaJOGMNRW
zV8iBiHLAt{0Gy_2VuXJ-zo(2mbtg2C$`$A1$3VWs!-`DvffZQK$=0<}_Xq;ov`#Dm
zFTPHjAkB}FW<z5GMOzMUxOn1;b`9Q^i-Oh*Iv0A=ry+YNUb#;L%8oPX(HW_XIL4)&
z)av%Aoj2~3iTH^ZrMHQeb1dVAM|UG7L<m&BbUA?dy#h@EgjN_jw51D3wJpYO8kkAU
z6jMkSNtCvihz-Mb;?|sRb}fig+et&UG?bwg$!Bu%rlC6=D7X{SmuhVZd7CGIg=Rv&
zq@Rcr`)OA;0DwonvJ#-2WuOqdST$%pfg7m2pH`78L2W-$p_Afc5>@*yh+7g#c%PMQ
zl2}lZ-xz>oA`U;ioU#lN2F6m@l)@d<jvEzXT0+8}kUd~y(5n5sp};(OBAz|tHT%j?
zYzpF^|Fk;D1ATudwl-wCDX5klU7PL?Yft?NiHwDaN!x?TTFPy;l)ZvIx}<^AvkTb4
zhCF0r;Hd^uqh3YxQcIE@ANtPkuO-EqA4X~`Q-VGW!Su{UtF8KR^L^u_Q;jAe#vJkb
zw6yIUo@ew7tQN(KckcAU@4uIK;T2$^nAJ(1e%CmC+uH8{0B!O+N{UqR4$axp^4+;5
zGb_ENit(_E1-%LidgmlSr;YqpAf?%Vr3sO&0&yWCLQ^QFqhy{dd6A&lU4*(=YAy0<
z-_`O+%G-`hGKx`%g_c-R$@g{*;ep31$D%~ZRIBhlFdI^^m<q9S2bm8LVFhqL9U1#T
z)R5W^Zbfpo@*DM6<{8N?qgp1EXlR4ek@ns3P09C1yn68eskE|?Qf>!2`W{c&WV$T)
z3ERz=8G@}YoP#>+2528d=O!M3vO1^g7hHj<DXNlkCa_SM_`MGxA3wkAXU_RQ{tEit
zdmjG(+oJRTS`EL);=ec7E05>@U*nT~I&V7WA}c9hyfU6~78!g-2kPuVpqx8pR7U7r
zy26=VqeuSOpZ+__{gK3hg*))JL#L)vjir>a%-k@3gWLhuR$|+|Se2yNkrqjLj0}~T
z_X&CM0IFF?@#q-iFhM~eBz+BGvYS<sW!Hrr+{F_`-E2xJy0qIW#3mU`rS;nBeVR>l
zzS2b^ZR65~!MjB<18H_^104=$U1chuI}ujq2)FJ$$(Cv>Ju~iUksNTROORU$WwPsO
z6vV4>y(@3pyAXL8ixU6vMq&%j_StI+A)pIGI<M<{Kb#$R*j~S*_fVOvC<V&hjJ!rk
zz!D|X#vDB}T1<{nKT2!OLY>t>;!PJMmQOElftZs<`?PgpU<PHNsOy3y-NbEdrUBBZ
zW2?d%*yY=bs$`%ef$4PI#1TDzsxok#Rp8dB#!#2~$$l29Wj}YpxT>0g_*=J}sQIN3
zCxeR<>oU6dNm->W*4!D!wEAXCtinrH-Q95ylrw!?rrddAdJq~0+GGRGL(QZxtQZng
zQlchfE2=pFkfvggQuF}d7$s?w>iaVgjKr{?QUUefeR^-yN|+GBW{b}+uuO(ijoKMv
zoxH&dOeg~wx&<{`MmMUfTP;_6p-PRw%pQh+F+pX>_E%T!qy89gR7ZN@dus7D8t*)x
z6KRHtTgGuBcXw4TPx+K5Jn?t{Ps*DE`{A&^yIU!*Cq9agOXx#+ldQh3Mw1>2AE~65
zc4&}APHFxLhT+t*j6i=8ofbtkMQ@`rnj*~!iI>vE2o04tGYZ)RSQJ_KisJ``u1xgM
zr9BsD%88D#ZBY#;P)!qE))P~L>t{c9>IbKdlg`QhYhzi&Td5S{Yy?YXwfMSm0Q(;`
z8MERWJK7xUXV&~=mNn)nb<a%AHaD+F^P<kr*@qI*ruv0OleTL=#9)+R*CewgHh?6_
zS?oexE%UW$@m}ot-h_NVac+)CdaG?#0XAntOFJ7#HSb24CzoBbng#B{9elx}xtH*o
zEwKL)@n%B17;VdlCrcUX7x*PuyYL{xK>^|52Wj$<Iai#+Hgh8`yo|FQJbYq`y7PI`
zN(7`j38`g>Zb|2@IVeOl@m%Qk)7Jd0*1NTMq!(D4#Tb)TSme(|=XtN#KC0EiqUkqh
z;rzj7VbQ6cbzW6?$Vpmujv{xTc@w2mz%QuIw+P8oj9j$SE{Aude&P!cOZ;Di_EVVl
zZ5Xy?LHI)v{)0@w?@#v&<|mcx<CFCDsQ#0C^N=*Z{_r$^JC9yPsJ5?x>65#Z6(lm7
zzcD-*4H{Z{{iSQGSss$67$C<|OJ8)U3pBNC%uDi%t=|VGr7yrf|9GTymw8I3uKDxy
zXL1|LNutUXtHo4@p@;DwfQ853T6{+uBh<nlB_(Qi-qw%y;b*gjEwxVC<_P#UAz-|z
zv^vM}$JV9ICR4QR)RkcR@M!nCk$f=6qo*2kwZZj^76*8hFhi#lrSr+%q}ec5)bR(M
zz-1p0Rtw`EKHj-Yw^pURlWs%_r6?-)+3<&roog=i2cpXjIz(aUkn$vsyqG>}H!sh{
zmexcQiuVJ|;O%^}{*?2}eMnoFQB*xjDH#J?J<2HAfu(tV4k$%~b^KHvefa*}s+a!B
zG@6N>JJgPBT;iW|>~Vj>HL$D$nqvKB5KYUh3+9R`Hi}{{ax1Ig|GubOoQCQ=4XSek
zs;>$S;)oQ77>elG?}(u|Oy?0yUmZVqkzX;c@R+!%;{U!LZftnY6+HKc!;(5?-LMyU
zUH8;)V-neb++_%uv|Whal6c8pIK>o?oW;>qNh$Me96!g<i4_cc=DkgM4`36ywVUT0
z|Gx_-ytu#f-@h%)|Gc%eUXA<zRVo{g{(oQNlj;8#cmE4*|35bf#=iY1oc4!aSGfc>
z2YAUkYhGR`ayxx@=uX}K4swkPm-Fl@S3UA3kOc(Nofu$}gb-?C)={QvxBrrp4PSXO
z=e;+^dx4`)RJpPd+nu5ZQkNY+=x~o|L588Zu<2@5Cv@?8)uc{zJPi)raXyq6?G^P<
zcXIO&RNmIxZ#(;q!^UYN#a5;q98@?vmM*s&rxgFp_mdNjs*J&^_?dpz_-9R&%fHA(
z#cjN2v|8GbI4uK8u<4Me0aGtKp~Yn0!USM|P=S&)A5dR_T|J%tK;*{PP7V)k16QCN
zfAnKf;Q8o}@UKJHxSbuHVg^HM;?$Ru3-1VsqQ16(r$0g&XO==1jAVfO+=Ip8e=jyM
zoQ1xBCu$U4r60T!)oOCK<{4`en^k=__20Q8KQPTX4{4~O24$QqQ9wrr?U?B(`Bl<<
zW07kV_pVzqBK?`Zc9Z0K)H;&HO2K;)7$a~vf-4@&r+h*+co>amyeH?pr{kwPviE<c
zb^qf_(=9Ekc0IS+k6G26xz#igCu&<EZ?HJ=21OD2Bc$g5Pz#GJ-y93fDq6bo14ZzT
z82bK%ype&hg+F#Nfxg2Rj1+VT?ie$>hqIx~TSctai2PObyo-4ytl%oF6Pt9kmdPed
zLtQdOgw8h*=aw?Gzp!LGhVO0s>S`Fk_8)%$RD3h5ovjB##EX9&L{RbVtahG15JG{S
zKVtNj7^UJbvf8Ou?lCpyR4kwAW9s_?)Xy6!y2LVl0OQ?5cT~wCjSL2Ax+#F#_7sxb
zbXPQvTBq%^<8<540^nkrYwP4)`weW<t)n++#562UmPm&mOJI<GZU#h+qtn#nQ%f9k
z@t6yL(1Q|%{?v04kwal`PGB`)CsKzk-Bvt#lBy`Dg@lqq3mY$Vq=ZX4Y+iz<vjRTt
zv={Tv?Xs3Zx|Q*(#bwUX|LMYIe~d<x^T3~t`*$@4EQtTxs%&h>^8Z#hHy`hR{VJd3
zQuxY3ogZ7rjiXMxb#}7X5ZjeXc5+|KEZ}8Y3ZiF|=>;s=zWtB{V>Boz2+od(sazKX
z-!=i?WYFLQ@AXibicvXH_k|02FS~es*xLJ{yx(|z_D1QLZ{6Y0e~ks1tKOGGO7IMx
z7(MA3`qk>_#!I-8zHz4nire2CdhU379C(-VxWiB=m);P#kAkuvobrYC_rj5E<7;5a
zXw5>3Snc)};O#98Way^r;2o>vJJ-Q1&^W9H>=NDH5;#tz^va#Mf1jcLhs4?k^yD<o
z<qXn^sK8S}LbW*oCcfnyknxIKW(~}v-IoX<74`DA3FwVtK5aCo<AG9d=^C0yF3>82
z>reoCf*Zb&g%gA8+jHD&w>O)*Y(LTzG;spDL(3n~^Av)L2DVCr+IPFN^Uf)C_s;Rg
z(oYzOK#f2q%mM~|&OUxi(FPX(xgvc5qj+NwWgWD=*h$X{RJxid?T&Fr?BJYsrU6b@
zdd=D|k!+KwlWxP$BEdE^IE{!fF<aQ5wgPeDDC`OisbVU#olnE^^b!Oc!~+j_O;ll%
zHQ$c;b)MgUNAEG~YL)k6E;@F`emHd9N&d-HnKljn6}K%}NnMfc$ih@GKoP9)V0f~Y
zs#)P|Ow`B~phz)xD#9N9UzpNcXRl!kjT1bFX-O{nN22%#B+NfGUEZ4TfQFEh3+Ehf
zgIpes1vLLLy{|6YD_IQPG2K|8?zB`*O#P`dl$84aXYb#7<4CgwQLL(a@9o*zdj@0R
zJRI1D{Z)!Bk*Z88GkKF#C3RC|O3EpU<S<F8G-{qak(rTX6f+~TBQiy?)EpeY7&vbR
z>=)ZF^BeqT*bhD97sG&o^A9}m5AcIu3~U3ly)NG^Zh7HN>MBN8i)6%iUEliFx7PaB
z1#M~&^r)?`ew1l}0hro7^8%}#5Ac~lcJa-cJPJ3xs2%t|<!YG7iKKQ*hRbJjE08Do
zsT2CJ!wbcNtS8!B@pl7CimAH&#*!Ijx;2_4lNS3-|DNFA>_^X-nFaQM{wS3MbwNzP
z_hhT{O!U28&x1`6_??I@$$YxMKBE+sNO2rO*`P1{QNQJei<+tPq8KTXJrzY1Fuq_q
z>bB$4bv-sj5g?D9!2pnoT<;97U|UBdJYyD4hrh@M7c=>0fXp?7OkP@;>J}!0;w4|o
z!RMGcWE(bC4vY7wv8=eYGb^)VQEO?j6Pm2)233VY$;sTzu%t}ZM1tO#nJ<5C?QiTZ
zDQp$fl0`9t<t?fyn<%HRTu$ABmne?4Gm-us6Zan$#c^=zqW@?F(xl7LL|HtA?bPcj
z@<~L9k`EJ&Tfko($r;cd42haz{`LN-eT=>0M(PAQH7>WKxO%zgJi0OcX~gknA{Yzp
zLEK9qP-oKPhC4K*O~;P`!k9z*EO=}~^Ft2miZB@sU<yXGqZKIPH_RZ9;~6-SA{fB?
z1U++>@NQ>GT)dJHOx6Ts9C3!AScNCL8BI%&7y;38y8uR7g}|^<hPv{SX`sY;pxo1(
z>F$FiiL#Oh!k{B<>rDmU$g&AO$fgz#AM(^Hco&XW0h~}6`BXkpiBAP^nwG0$TCP~c
zMr|SvqX(y`*C~=AX{HcVBxXuRqRn<2SZ@U(OT6Zko?+9MaMy1*{(ZEZfTLcnp4s|#
zTbYsdtpg7AynE{#KVXL0U)Wi9hcFpq5X+uAfy;z|<w2ttWekZVZYN(;q*kaWa0m{i
z)TW4psiSl|*q2Cld#K(Xs<(&g?V<V$IaJG6bEuYo4Tq|wKC%zg*cn<CAG6O<KC)s*
zY3dv$dp!GCgI`AxBO)G|up@gzZ-CJpVY?7E&Y;|&lN%bHRyVLfgXCS$wuoAj5f?UX
z1=@9;j@3(?j$iIE_+^|o<y*>1l(l+k$~u__W-FV&cp^9kEBVi+TmU=ZE0az7SG?b^
zzpm{Z>>p}!DbZ#WhFDKlhb`juU>rRlMQ(>Q`Js?ig(RhmXuq!B0fqe84TB;w@se*6
z-I33%k+M)%L2Hcx^Ysv`m;p^B0Y$4J?;$xM#Q5x;Nj3R&SI?7B!FEhh+FZ*rFLUIQ
zW=t{mq{cXg6G}0S<mELoh%G+9m<%|yM`68BOr%15a`0-Zxu!Ea;Z!<8UI1GJ_|iwr
z1!XO9rE*O?^_FZozO~5-DhASvcH{Wu=%IG3(?dFPrq(NM2FSb-mtGWaUFlu`8&~gB
zU_n~}^FzcOA*~O{U*74d=_KV2D%A11bRG;nyvnD;LcM_lspDcu(Nj2OTEPc*QMSM+
zmO`&_2Wtkoh#RIU%JU5P>ECCR7EjneS^jGTyzx|5)6jaONx#%Kk$fs2kqWLVoT$eX
z%R6xt7Ljt6jZ==HeR_XiDgB$#a3s%CGO;edhe<w}BH)aM)Lw0?w%(|T_k>A@3@$oN
zqAY%af{%wVqPA;1pSqsQ@xspx&}1WD0)I<xPgk>-w}S*g65BWHc*3@34(z0AS@*$i
zm^|smA0mk+^7xKiJj>1ZHvzS-$6j~RcFE=`bnp_IeQxLyjSH8~b(G;~OkFQ_P>i>(
zT61n4Z^#*2j){2dX6DfHWYn7-An88*fGuk>p_ij*zL{YPIZlaPy4eh{aUd}M?<PR!
zMNP$Fm~myFWH-8`QdB9}KJV$1;wpx8n<ePi_KdOr?*`$?P5A$>RIAG=|NqL`t^NN^
zJX6{KBkL>6^__MYM5KlWkpQ`m5nb{i4~(5-cP2o)rGt)b+v#*{+qT^?I<{@www))o
zZQD+su#-%md1t=OoOOOe)mpWx?%I1_yK4JKE(d!_lD|irmREyseM{Yr!YLOc{cXGl
z$3wTp+V}&SdlT`=x{_d*mLYqU&lQk+Iv}hdT{`9VEazh$4>4e%h`v*bnZVCvvq^pr
zAm;(jUKeRXbJDJDUS8tlIRTF+I$LkKX+-5U<fg?}Y1R=8FHx)G^{!e8F-gQj4Bw{P
zhG%}U#2F2RZD&|Q&_(@|W)Nq?GK<^J37gfSnbn(&QPWYp74lU1-uSe4-3wuC&D){A
zd)@~B>gML^da&7KrJQj;B-=15;{iq;d8SXLEn(h*5n32tn52$8`5)9pb*%k&NQO9n
zNi8MBYKXV2lBTJNIx6BL`v#^M;e%p2|Mt|&Tj##_s|!J$c`|d7zwuK*>8AO;UBCuB
zJ{X{+DoeO_6=9~C-(oBZqp3D7<##zXh^xCTe5zWX9))#$>ZWWC&Hi8594nlQaG08X
z=^~(|_%yEf0693G<{y3}HA6}=qE@eu^jghhZ{-NL2s&zGC#``$Vze3PsR|fy$!3lR
zKu->)D009T_*2v?!>Z_^erTi1I|7C^YeN%dnDR`lSC-3{w`FBG9SEM>k6Nc%(gW^e
z2D5<QUpgPW-6U^u?;1L4F@jA*9Gs9_rj>qwKh@X%hVYsk3C!L?zMd>F@43I#DeLQK
zNl*A$r)<93b39C?ey2c?=9Fy|;=j(|!$16iG>&k<6voQ9pqs_3ZrM3!U7J!A`<^w#
zGwsL1h9vi$z=)+j{)t?s>>@lIBs!f?i_6hs=mlqG*NMUbi5Q+gngrQ{0>H+817-H_
zE1Biomq!*FK9|rS;^v#ZH^2UUG@(DDmUw<@O0FMC321I-1<uKDHCgO6JCWRN@jd*N
ztK%!4SsK$m#yJh#-WxNkI`+kPFZj3Pj&DZ8nY$4Pb{8Jtom|`NX47i9ip1GCWeW4&
z^o$6mh!3v!s*8UMpw0->(#kgR+G+MiD;~e!Z@=7{Rta+#X26)vjF;m?(g1FLjW@Iu
z_R(dep@42`3Ed-VpXONfU~ZPT@OC$aa)H!3^&DZJ48VLevnykNI94+?;aqr!zc&|C
z4>2t}U6_)UQDuJcx_&7>7&aCnLedbpZe%k_5)B2K%$?yclEJ>O^Tm%HAG|K{+2u<L
ziOS6od1zbH9S(ePrQwz?D8m+YVexFwcUA>b*;>n3y4A~)>k8vV?BUV`{uy_Et<$Yn
zF2XTbgAqEO2Ca#sE}CR%IpJL8RThX3=qp)lKOXk4HGY|}OIbOS!CWEZtNHe&Fwbfx
zVe>2ek>9Rk3Q$RedtIhqBM6SNvGXt<Mvaxx3J%`6vAv<z*=SCa!a??q^M-|xP|IU_
z&fgQ<#g^?b@4<VS(wimnxo3?N*y}O;;~TUOHcGjQFGU}46?U7eyS6+<I=AltAaf^y
zo?ly0v>ii@Mb?(>=*9B|hR-S{S$+NzO46^yyN+hHh1}+|e+Vd0;m?$c=g#IzgtG8)
z48@Z<z-MA*D-OU;N3YGk)q3_~1F&8zp}ty_b=_&=@`+>PK63U=-5@{v_6ARurY8==
zDfHc@t1q?Yr#fjZ)Amfn@xYtB<KJ~Qa2@A~DBk7xW9-JFX%n1Q@`Ml;ZA?b76g0kE
z8NF;&|Kl}w3e{h{-e#{F)kkRlW7NVg-22Y>gFl1UK<{ddoh^$xwUwZM#k-MUToN$=
zr(`JTS2{Vfr4FNq_agyjNxb@Vnr&C;cQN_-^6^PL8KulQXW0Pw?k8t(O#1eT{3R8#
z>hG!!Ieb8DVn5dtzu1OE9{0nIs33qZt$RCLUZQjWd-oW;XF=L8A(f>=L>UN9sHBV;
z*U`%dt$J3I{{(N2^4J>S#)yJ;sJ~F(_rt&OqvpdDm&Hz0teX)emPv&X4m@Wv0potS
zLIIK=39{gW#O@WL9Pxlqt;0=WZ+3xY#`wN_8;8G<xenk-!*dvUf;LIic-Ro1{2QJ3
zIL``M!2vmfK|Srnd!U~J${M4jlIx&AYrvh$`d9BKyVrH`aiwUzgAAv`@<vg8IXebs
zaPKs!uXzoIcRdwt8MM9a>tPc5a(U_76aje}of^$tLSO63_cj2_t7Svo=Ob+R-L<H7
z^jyciq<B>Vx2bLklsr@-0-i#W^B-psqU#n-=xR|Ty5j~P1&8E4VMRgyR>~M7ofI@u
z884HfVJ*FT<NYM>k$LT(k<)oX&?4OtV#JA1r9U`l1gXU>IiT^`)9qVNU(>-!y~{bQ
z)5wO_!;!Jgtlo}0Eu#W#Qf82%XtN2CD0@3uNugXlwPS)JXRczKs*quuF@c0Q<?y1>
z!h`w(ahr@o)*Upa;K%47af746XmvK9dwB#N->v&(2M(h({-i~Y?jC7#ZkfPgtP=`V
z29MSN@nLjOXk?eX<!|MnDL&Bt)gnIUxMmK;6*<+`1q@H(z#NmR;}%d?`>lG2qk=q?
zQ0_%JdhwT5t4+}-=CSS6OTV{fJIJ~Y9c?$gW;<Swc8lDHEdml>hNYhL3AW^4y(ZrB
zWhts<%WgwK^^3;ME}!hs60K>Jy;8&G;UOZw!}og0qI!S33Lt`C>F#a|*1>f&O5w*Q
zg;O}GRxT>jr0NgD)0nWv9BGck^BxsluS*lpNyU$=xoRVv24%t6>f?E=$tC~BhE<Vr
znkqxf#g1hW&o`2M#wE9`NhXg^o9);i#)RLB#LTnrS414De}{F{iq}T!^vb^EhM}W6
zGh5J}h;?of%!W_b-o>lE?MfdN!eU;#5^g{S!iwR4V1UG|y~86P!Le8JSjfR%j6Yj#
z+aZrsLmPvf0{Wx*SuoB*yBxZ;Rz|LV4NPAlxb78kpG`<)y{+rhVx-AKxbWTwsi?D~
zC<N33>0~|71B^ry_WjRA#Zs1hydyXW&}zApD{VV3V>9eYLCWp*P+qYiidMn>A&J+d
zA&7&J774&dYm0s-1|q8Cs0&v-H42++U-W!sSj|gMrqnO>p}n(FSo#fOoMH{VG%%qh
zJ#@ByTbVb(G}$e=wNf4FNSj$HSiH6aB;h~mVPr+3td10@T<qIh#HPGr{81H>%uxz8
z3JrtrS(G6XdUPNHGTB5*|2Z>5ZFGjE@IF|@v`{HB>6J3017!oN56Cu-BNDrS9ZPR+
zmQue3ro$gxpm5KTHzhf1?9uK*4|nSA9m>yFH1}QK;MiIc{y;_%-eaX=0e?)(H1z#+
zD56<0A%k?xX4xt}Ql&Et#@|{<BRa0p`>H#`ar$0$B&{RR`v>)W{pd}ZaOD2}PzJJp
zZ^rOqGsMiE$NmI5(;`#no{5?)vE_w}*PPMec7BRwXm>fM#MwBJVP}Wz%-<_cf!C@1
z(ol~o+<)Td6fqURjok%$?ieD6-xBzph1|@hi@cTJy7SG$Fp_J0<FGgFT*6pEE)Gao
zI4vs`l}dp+tsX?vjENd|F-B{^XDe=&aQvEe8(`^ryE^=&3{^%DewPXuAS71oqOTks
z<6Q}8K-j8Ru#3jNIS&fMPo7u-yCyChu2}gS8<s*^x#Sk6aMUhpWrNbF?5KG3AtSvU
zFHEG=gzf^*PZQr@Vws?Wh7T5F_osjWU=l4)h==jCal@r=ARa!A3+rqNDuyr|Ym<T<
zgByas6e3<kChVk=lP}l6OVHwoWTeEYu1n;hG<z-v`QB`W-!LsJI%~fPEGNahV|t>C
zj=bMSn$pn*v&VM0Q?en0Hj>~pAESyh1(6D58)3iclfXiO7@0%z_b|K@1R}yC{y`>B
z%Abu754^cUSLzd{^)~gcXI}y$9}5rB<Td<^Jc6f=zOC{UVRhBN>ebt=f_e3Evp<#d
zX=<g(?G1`!YiMZtu&eueSnhFeX=;Iiuh!h%32xi`@B*Gfeem2B*6;XdLToVI+4_9s
zlz+AZG^|;NW^&7WceX1<yyp6M-k*KDSEwW3pGQ{u&3rz7|MR<niQ+Y=`RVP38GrDI
zU18zLtfKQU3|(&QjQo6c`t<Or>iLfC^j6y49l6mL^t&{6^Re&kaj0+Up>jofc6GyD
z!ks~CPl%}jzF%&fkVb>PW3+IzT>H$sxAe56q~FYJUT+Y}6SJ?LF0H8he7>p20D{)-
zR$i>|J~)3pZbE{f1Q~$ruh-Zv-KTBDv8B(y?*K?yWlXKi0ZJcjP>P5>QPaTHO9rFZ
zN3?wKpUn>S8iQ-NAV@Z44tHG*2D<`lbrESiJXt@U#cglpeExNl$=h7BLjNJ=#Vknr
zbh#qb0WI%0fBk$DDvG@$%eTJ;$8)O(C^#-u<+Op2`1f;1=Ki?MvCU)wu{OUYXpQR2
zFQJZXs}r0HH~`vm@yT9+>{)<-a6Dfp&i(9j+Rdz9tL@&Z?5(!7|7W;IWPkcM)&06V
zSjN*VoyqCd3(H0N^WJR1$o{oFa7_BEro0#VGRyvg)15xL22`5$0@Y{F_R#P!C72&-
z0l=aszNl3gx0f<9v<P=--H#bVnOZEQJfUpd6t*7@Kdd#So<MV7hp->FhYVi1g2jtn
z>~L+uu~5+PvY+i6bGxuEBh+|WT#heSXK^*fVkeVaSrpfQtI2qoSMsYzOMia=Jyy_#
zS;1$m0lcCUb8o_OG*M_Hcgq!`;9YDINwoEc{pM#s?-IQ-ltSLb7-Z6Fcs_+VKk6gR
zszvY0n!%Rfdtv2a@+p>c4`>VY)4S8p<PkkT3OMq6vLcvFG?<dCmKx!PxzO*I*}K0p
zjJ9z`bJ)#F{KrBC>Bq6=?^~OE7F`4SN^w>1znHbB@NQFJq2X~w{%|WeZEOaboc%_?
zv(Z7L!JN4JRu-Ec+o}jU+Evi6w8#eyB}9l*(VTU8ow=h12?YV?EGDt;C$vtE`l~{P
zFyQ9FR~J^`q<(mbb<<m3TUH)}bD?(inVC<{ORrrPvZgztR*nwWjvs;h)@FCE+KEr+
z6pea-*!pIgO1UqXJ$KTve&N1i+pGKUBCN5szu;5o2;vUk!Is$=HKecsrKxZftOR27
z?V(hw3^PQ~TiEAD*(-Tj%}QXyWYCHZ3s1r{Rhe=<i+bEJos+WEZXUc}4lOhg6Ax1=
zTNPpWGlPJrZ%wc#=yn5F4Hn+ziZ3<l`zppdwPb)0CjIn(0pG$!{#(V=P23_|tvE8>
zaNqENRZCw~j-PLYzs^QBWK1{Gis2E<v~0OJvZHS5@0hV8cU}HG^~p+$BvT!@p?tu0
z*DVmG-eh=(HP)3scKepq<n#Gf{MB46`Jpc>2oEa)3I$2;{Cu#1Zz;e%p*>E=AV8NH
zl~OE~)@?F-4p_7ns;wetvFT<Vaka#?8BB+`5>?cs9_gggp}ap$?oXPI&$ieXsw3v;
zBzZhXD5-(f|8a@D={$&P0M`jEwQn#;Fq0?C6@w+@FKSCN$;j;XCtX}FkubIwnZsh@
z_wXaOrc(K*ru`KMb)ygoq%NG*T3_CG_B7ba`W<SAK;uEBY%bzKfV`KaO`JuC-qN7s
ztrpJ9h)5m>c;WoG>|U})l4DH`zdgFCR;pHq$k$$|{!8=~`l~wMx(_eOjOtZ&Bvl?i
z@c9L?m1D(7r^3k|JJx$i9vp0Dpy|e`B?=1iFaFbn{-d~U9%k3{J_ZeX_@b3t<3Nor
zN)8!QMLMZD3@ldDUKeKsORT_%0VGmA)W29P!ObXWWrE~-SK!%8_>%OsNt@4rRY|~N
zM24BH2rHW%$gwx;;&aN_*@$Fex?eN$E}Rs9C}7*WJC<)Jh^8#S2AnmMw-^gu8HFSe
z>%>!+fQ`{hk}@0|46pUONNXcaCZ5M=(GzDg)REt+l{BQ*kM8grc2Q`<xeAMeXaQEL
z@DSOOmSmi)8sJS6t=R(`t@-u9XzT$mPB**I6YO>qOl2r)#EqQwRSMz&hLNxQrp&3>
z1B*}X=fSB+7zD1u2yy5DqCa}#P16c8yMJv6ogF6cmgSN7lPItq{>ZnFm(!DdCCT=E
zTqW<%3b^mG59j!MGD1X>YGEC%fzjc0eWyfRZhRF}C?jQ0MDM;Fy_kasNRfP-$SZCe
zyTYiJct9HEXe?UqCHiq5^`o%{^$oKiv)QcSIF`vcbgHN(e~FW3k_PZPru+0ZoG&6=
zAVRK3kSw50nSf905Y$`gQ;cA(=Y7Ui#K~7+tlTpi>fafw!}@sm-Q;<}e>?2yV@>$u
zwop@7S9h#$E{fN$_)9=f$(n2WFexUlO#aMd%wB}lLTq;)_m?mQ73^QCLgJf+q1zo>
z_T6fZ)favC%;}KZ>JzEmo6vnX4T1OOw5pJKhE_z}I`%v))3q6`H%HW}(Jip!<#!L|
z8sM~?N(^ga;oUuH$_%C4WeTB@PE5?ZvP%PP=g__j<_X<s6OyUW?HCkOr-&{WVF;$t
z<1D&mRHN~Nj*tC4K?bfP!^(NJ%aWvl7s^KIlhj4{nBL+kYeYB8)S&M~$IdXyam46a
zrbVi9`278p?$rvhzH~YhOtkp5iA?>hPVQ>U>a4X_%vEHo1^Q=pj~yh8?-hYX590o^
z3?4+%kF4JUgSNpF?pzvWf|T<{6SuB)tpH%{_(0dRBJ%prcy8?L$iIR+P6u3;z#K=R
z>6NHC=%;x$BCv1tPn(Wm#pKpJDV|_7;t=$|4!yW=y5=JxqqK3SU$=!HQPfZEwx-$n
z;su;yFBfyF)48MW`EYfSVw!f|YSlfxQ))uCD{O*)PiLX;^X#DyQfP>KUWpMOVF&(Y
zt$v9LoPrX4Lu`D29bOTK9B)Xf#7SA68gW0Uu$o>edR{C2v<lOYGKFd^Cr4Dv!@@Ec
z*}<SE{rF?bP@vVNuYA{Wx28fh9z$kq^}_%JRI<>-1=cw`<rolO4|`>`k$7mulQ=?@
zI@H|oeHc{(OcU4iJV)dJ+jHPYG<eD`YES+#fZW|h4+oM%Y#!~+sx@G&8b%MkWLmYP
z*s4er>gZ1!Kfj%Tq>Mo#Bi*x5xQx9%22HqR{syR4aBZ8j)7HJ`*&Vjd$?9-MxjEmP
zc~+*NU-=yq%s+AkwN|c5emE0ZwG&kXPAr|oSkmEA-$T5)j?1+a&gnwhwg0pDeb)L2
z*uUbd$M)#Cgy&fiT54nIa~fg=<%_{!TvHxYe4+wNO_#sLb?0X1!E2A0z6gw^OMt`^
z#~@$#tdGJ8hp&Y^x{?7-qpQeHE9q5o>#4rqQJdrkS=xJ|Onccsc7${Ck!UT_x?x_q
zCfX!&_&x2ZHlG<U5(-#iH)XOQev3h7W`qo*S{dEHOwv_nt{pmRsn*&nIrwIvWw+Na
zHh+0`HyCU#5_GvTx>l_lH^!a6SesaX%E`5?oE5y>472lF6}h#x{re0D$d`%stYTT)
zgUgF$SJ>DUaYW9tnoB(8#4T+7G7*_F(WFEMGTE7I;uU7!7D@}#sWBO={98Wvyx2?3
z4bC^U!Rn1i_t)X&#$`^o8zlHr@S`AE+k)npZh!Jm=ILvSQhuDb<s&RqC<93J(ha-A
zkE-qp`>UUVtNiZS2&8a%46yAB#2~8VuR_06MN|GE`QC}gSSIooH1qo#UPVck389Vm
z6;nXICIuYpPKJO%aA0g6fAq$`x&uRi;2Hy5^5;QGUF8gi=%<+taaA+t+7eEMspU>g
zQUk{L3`T7%Az9KK&hIxglu$Xt8Re)i<cT-JPvV{!7d+FX0J&UGl+X`OVQdH^=dhc#
zcCcfbe0xdk6e<N-LG3c~VcywhIOWu0))9sZi;Py;2PN7-RWgc=t~FSP`&?eOL?#r?
zp|UlTB*hs+-GG&_zF|Z8^a-=;*kbQl7KID`!x`ljvBx0~xr)wo#s+W$YZz?5BeiqZ
zq$cqs0kZd(gV^7m&S<imC<3y{HRK>2d*XAW_=5|xvMt%{4^cSKChI5FvDV}2ss>58
z%EyVeF$P0x((6BIe<4O|W4j3UadQ(y&LA*gqP75?qXq~cgO5{gX(Lyrg)>Yo=6;gP
zE%-kcHjlRl;lRH+%h)lGBXAS-R!=iGWfgEVFm`x!YD~^?oXm%*8Mclu_YUzVbJlVg
z*R4v~iFv1NMKdBdA(*cRN_V#j#LdG;n)38-w8|6n%hmr21CgL28<*Etq<{8n?#f(n
zPCD*qlYJHdlji664eXaVBn1E*4@`nMwjQu@A_aJ@K?NV8^+Vi|TQ}trt~z9-2nlo*
z19a`Quv%whnn<w>&m67wBt5G4p)X{hQ-xs$;FcuT&=`f}kTskRT&bhpyIlS0BLvK4
zls6cgRvm*Xt06ALf&akf0|c!mKhC*A7T>BIDJLCJ#mPW}g;`;_Zbna>bm7|suybj?
zK|qd);WubuiPSgq7@W1o4nWz5>F%7y*o4JB+DrMQ3tB);%;a_0HLNmeuWoF5>Cn@f
zbdH=y5l=dE8?+2>qm~_F5Cs~a-zxD^jbJs^vpazFfL3%3s+as|(mHR*g_I+0(5ADe
zIy83h2S{x59ag<GcZG)Jr-`5ux;9?dI&W4pS!V`MGnv0>;AhULb^(R;AfWc)+y77#
zIaSX`E9P<q4Ue7TdJ)s_lp&h^guN(uq5uRZY&q-!0~3omYgia=F;n3v_6uLtv#42A
zTBfMK!{TNi)P5vn<lM<TW5CrspY+fP^JrzQcfV&PTF)#dao4GLZ!%UWAMZ3tmB1?a
zC9doEB~U!Pc=*fr^}V5a3bY_&!Z%tYbd@^ls)|p+jIq@*8(QBU*++6}_s?O#NfmJ9
z=l$tq>q7apfe=~o8^D`KU}=ZVU==Us+z9Q3cYMC@xFFbA*O(gRQMKLE`LhKIfZ(9l
zc-Y(O5zwh`e-^r${@u{otS)!#N5`-`;@2H<>Nx+<ICxx=^pn;XC;j0h!fQn|X3niM
zzl2~E4E45r?nC4r-5$eMHkdi&mieNP+tB#;0*>i2;akDfD^CN0%2M-?RCd<N>pBk)
zICkP)cmBu_xZTnb_E4&^SSD0w@8pS8=iozx>{WPOk4)Dqqsu|LE`hC8J1;^H)bTn!
z`88J)MH45s>)Xc3323}(&@mo0(oqg84d|DDxRnlR(*v(gP_>awZBMzB4oOaRP(Wg%
z{e-gF=;Dqt(QCTVAQo&`kYbq&_?qI`b}{HNolHB1?lP=dayIsZG&-!9^vRG+AdmV+
zQXlInA9F57?rZM7u=}pBbzN##cBp+ag;;lM-SggNJ09P{zI&LMLmZwGnG*CtggJIH
zg`NP0nM}SyyZ^eXqoRo{-x+}V38Xrt`9eh(zDpku4QH_Q7-!$dczlvB?P`q;Trpx>
z$(a|)b~tOTlH)n6E*}$~Yx1BNOO#WxI{lstMMzfEY#I$+dssI)YV*eJ>0kp6?v_UQ
zsd#vJ?jMjdVSM9BmzmTnh~i7p&~zVL3!S@~yt3CjGtnb4mWn;un_AxXU{qlTMs`Vp
zP{wWQ*v=bT+UJ>I+t=U5({JnrPf2v$>5s2hT^2JpogV+Oat}m~88V-*IKLV36J)wu
z7VjQT50YWQ%NGBL%D2eqHBj#Zm>;&Y?Fapa^?`Tmeh)R{LV9ZqviAUyQJ1j*AYt?)
z;^HQSSFA&x`bKiTzmbtximiTBRFS7deAqxSfDat&ieL47z4_ow+!WM8iYr98GSqi~
zpc#yUXU?N+92Ym}tQ;mqoE&f#8O%BicW1FJNZh*YV#vZ#)$I{aaK>N}^;>lNz#b84
zjfw{SMQwAv98&x-({5?o$>(-<G9^1>eD+3LhjqK&RiHM(WwIz4QYPb33MxI+ERkNr
zHO5zx01+ybEbWM%qYM+K6yp(&D+1xgFT?fN;0D&(!n&AjDnIZu9VHIjY)E83f=^$P
zj>OqNqls#&h1<2Zd7NU6o=xq(rd-#vlNC4jx(IICmCL+wOpl7}U~e$FBGK7O=E>aS
zn;3}+&UC_LN@by5Qo7mZ7~A<Yi3n3VB_zbUD|w<<B~q#_i6QN-V-6xIMad2FL!URD
z8WWz`&@`;(Y8V!iTP^{11{>_HkMFtjq`gsV9VRv6pD8w4>y0r8G-Z_{qIh$Nz;V|D
z%g1ur0@hC%k2!9>J-*QypRNqwK^lq0axB%*fNtx_!s&@WX(U_OQJ1Lsv?Y{!#^Llr
zbL3CISc25-ap<eh7S93jB<g*I-{$K&N8I)j;<vDTLI4daaN6<Hckji~LQlQ9pg7;$
z{z%I0J5T5F{Wq`4(>H<nS^nE*2}_^c+;<&aT`lEfZ%s;7+xvHx``pEYW|=$MwGy^+
zJS%gdv*?lpxGX%!ej(A`T%_TVFMeRT6lTp8BS&D2ctodSj_c98-Px0=BUcJ6x@a=e
z-TRnYho>V0=7N<|<+mV7$$Z+O!Pyj{!_1*VL=&Op6jWIncVWxIAMAxwr-Bg+=jZHM
zP2id=Dy3}ZHH6mrRtbBC!N!F+u8gmpGs9R1Q;h_W08s!@jI|{N1e>R+dM4dazl)_i
z6Nx)r-F4?L!D-Q|S9d-i!@8cD<Tyx<(RoH_ShwV>P@LYcII(da5&0_HngsnqYBCsJ
zdL?nQ3x}loMw8KY?xYw3JT{iG1CWMlFz5NqCE>3#0GH)R3CTNkDuPes{ivy*^$!mT
zYB;)vf=bLpwtTLd2A<hX#&l@LpT9XPN2%wGM%s)R`3pGx7?Th@36f@XX_i+$&(Mp?
z5WoWxFd13$Ul*Yf)|j>pH}93AEtE=yk;!@*$a00fAQ^;St4pt-nK=S)bM-B#6j>D4
zH{e#Fdsy;V+?-<n3|vZHpM|LAdmyUGBQKa9#GZC>x{AEuO+nLBohd>}u)Dc=DiM<>
zK)Q#@Z^k5lF`mJ8BqCWZk9iY*3Jmgx(hj`-DO(FgG;hXUB*iuFZSL_2{E{P^>y{Ps
zTDgWA90H?|Ohu}JOJ1)^!abOH&to*{_(jiVVBN>g7sAXgHQ+Qcr@}#HKVoAAMe)jT
z3iFk*E<f_;R@U87{(Va1mk#NuPKsAzC{=f+t8cn{o$>D<G)u=RkZ&)+_t{8`)8roC
zp*mJmpIPcON5km~*~sI7QusjAIfu^0jL>@Lbn!7&*n-!JL|S{!u23HDp!~!5PFR$N
zuXby}Xwhu8NU57Ow4uf7Unm1isKIISafbF$CDv=0CYVGXg1~idwx>`<m6jYRkiS^#
z@M}w_+duqDG+murf;lt}Jz?MhktvN=U?arUT5V}7opSmW8FOx4OP5NCqHxHIdLEbB
zVm@qnI_zdbDXGK{4nO0P9|EUh4Re(I{zMsR1RCLhOg7#MMkpc}34}9Pu+Qhrv=5d7
z)N?`M-yM}K%nx&H;hE)Otkbd(Xo^%$r4t^w5m(5SxiwsPm8@$bYSc!XOOKDo&#u?Z
z{^0BFS!SECryO<jYuK!xQjBA~gnP*wIE4$Ca}vwW2PItu++s7+D_2hoJ87m1iap9(
zR0kCMzUPEKUM|>8A|ltF1+&D4H<z*mb-x4lteq8AWzxLjyv2HWZ{qznasD8}h594(
z=}kn=d$;s-!}zVZaXyHXnRFmS7yt$j^U-jOm(mz=wOLK?gYd+$vFZ3jKHUH<Czl&v
zRXNj?vW=jhnID70^^2t2OsbLRiD+W+#+zby_EpfdP}j4sZNLmw_7(HLS>vhMwI!Si
zRq;z5<Oz5!-_vGIK?MNX`u-%whUXm1=ZciUe--KS`>4frd7Q!NHA(6Bsjm~_j_5?=
zD6vOo62v76Ug!_Yr-3lciO+xTZnHvR9}t+(1A6O>;d=uChfFWML5$d(5+F~L`XF(=
z-!<whD=Ud#2FEESn;*Mb?x-)l_$p;ZCUA$p0tUc&U&csvJxwC*A%+VPJKfKJ#+Z{D
zuJeXnP<T+sB@X?H4`saq1B7`;{3&GV^@0EE&KTKF0DAy)ZAk6&O1H6)m0a`(6)ueZ
zaBMeSp2qc(>9>7UcCB?=u-o+Oi;hOgV(`6(PxK*;PU%K$bsTbj-@L0=B~zrJv*4~y
z{~h)%d+2^fwCf;XnEZC0%jf9T6EX8%5CfK3^nOZKmen88<-nakOiZOg1Qd++CMk1#
zEk3@9zi}GD5L@{6%$@oqK(0FVXWV~unt#=4_P(o^9zjCHJ#HY+1s_d+LJ!K3=<3f5
z3m5Xg;j^@Efj`*L`m3qY!wA{-!S70HP>hg-O@mKzd%^>i)?Cl!CLeR+6KS46txPiz
z3t_(C#YJo&kkvlGizI)%o`?F_hc~nsBJjIgBnrA|m?k4XdG^y3Meg3ef+7C|rFs;N
zl_?&<+}}>cSLHbqw9H3!$K_mD>9;H}^3@57ew@PSU;`EF3SV>-<Z&GhE`Bc0Uv-@o
zGS!{J`;SZmQM!TCvRyr2t~4g3XTiEqF2c49vvE|mU!LLx9VIOE&X|~o=PA#?JXfYR
zn0g&?_GSyng&#g{l%tA{Jb?#ix3`4h?IYbnTM`H1sl3frBK=LQgu9X~3BsS42OeEO
z1Rr4r>Yncj1qsDjeh}c1zER1;D~4Vl4@+dJz7g6<Sg0G$dCcM}mXHmKx#Op1A3ib@
z_1Sjm#Rl4Ydvo1YVZXvY{OESqK*{dvx_iBB(6fP6=i16HM2Jir*tdE8+5P?)<P$F>
zYSazN2G?w|xB33eqx9k6R<~jip2Mf)*9}k$d(IE)23~)9)+nL>`%J3|ntp$tEc9om
zzL-}3WE=a+GWIJA|1>r^&on*_ao5}21Yxr9`yZ+_ntA^Zl|~HI&v<d$1E9A#2s3o@
zp1rYAStqbt>EOn=IsLA0YeH1^+jkR$xNw#UId^+QoWQT*Q!@ys=C=E%aFb}MU~$#w
zCO9?J?(oU`B`}R~^bKY%0Aqu5t*StVr4M}55}()pYV`%_+4|skW`;7LTWQlvWw)HI
z2Tg|u0StevTkOo#j{q>L4q|nO<Ll=;S5Ed9`fT%~kA*P4s{_RP3zPT<qozbfhGBP;
zoD-zs^;P$vD++cqy4d|Q##oGESI@7qw%)eby*_M2ybo8YGmO0sdpUKRReif<gOyee
zt5+8&JWn0_B~17G3j{iq)0y2`ky$8CA8l4_yl<<0$Anb%C4+F_G=~d5FV@Hk2nDW7
z1pi&DL;bz9utA2S-bBLIYXZ{i5`~1Lsk|{1+i)V;FD!z+I)79kYOS6&o^iC&h!x+)
zVUwz|&oQ}$YU-Mg>08O~M{e>G!<kuO6um$=R*Mq*LdrP;p(viMvln9;otR-%WYA#k
z+T=+wJb2gqwRGl5-0CH2OEU;E8^tJ%<5aJZeHcq!pq%~%CEdxQOb|tr*RpRap}lMu
zOA!}-UYQF%m_7LG_Dr-zG^0c;3P$V3yAh}iHcOrlr+6G#Sr|ND$n1|9kfK=bjX9Oh
zca*Z=qNq7Pr6PKfOt2eBqc9PZL_t9h8$vLxop{K!Kk;UwZL@3O=`X1RhxhE%Z>(<U
ze1jxi)uy7Uc`GKZ`S%?|0jA}aGtR3Y-PGPH$O?^zyQctvz70EmP=oQYvAjK-{*%F8
zXq1st0v!$!U9!O93Lcb~&HF0Y_k=mQkEFY1DC9cmk8~lBJr?piP(N=3<rG#gh(6iQ
z!m)f*$Mppmq34QE$gx{ywy`cB%pp58Phvy+RtwKKtR6B{Y0A5TLoyW6iw#G?kvoY`
z%=p1k?#f@Iv4V$o^1-3^WU0#iWLGoFMH{diR1scd=dUnj!NzhC{hH|=p4OQc74wB*
z@-|)PKjtOX7VA0Kj8mI4yi#cWXmnH?i{(r|xKA!by3I-!{_?#_c8SmDvpo`Ks}h$u
z68a5mQtx9NhKii?-$$e0yG*RlatKRzWH9{ppdR-ha$w>`XjW&8vgAU@0p+GPD|MaN
zrByD|m^e@_Emxnea!sjv*!XxAtH(e~=gg84yFte)M-qt>C5i!pqB6xeIYWkN@0t>2
zAqPYRFu-2h-x(|%rBYj5FHP+tm<(Sf8OOc<OkYwX-NhPQ`a-R@r!=A}gc$nj=};#(
z=)_KB_zsNkx@mJNewsXdhH%h`V`yyB8$+v?<S=_B42a@l*^0CC`VnF-W+D4d60<&%
zV|p*BatIG;j@-H1ZUpCQA}}rZg?d$T0C>YKvX^Bnl~lw~S1T<dKC(hw6f0xt8`GMR
ziR&&-7F3ZXadr18Kr4usWSJUSaPXF5F~%`lV70lwg~RRUwi=D&rzG$ZDw1F~C;i9$
zI)KCdaL#&@*&elkX12T<)6w0Ge?(XxS@S~yb~xX~)lshdrD#kpr<neYo7lLh`COIb
zP3vll@%U<D*V1#5>zbK}JMucn9aq%#u1cX!9mJaLo0veP<1wrKE4L8t;o8b}j$qQ6
zxJ84b(KHhe;;I#J&`F>l9R%z{=<ZYYA7MRvLz!*Yri1{5E6{*V5BckK)hDUot{3}F
zv))XZsXfv=bX~EwoNR~(Hl?qzOC3!G%WTEWQTvQeiUoT}+}usf-*9Jt)AfF>E6o77
zorAvVBW=k1*DoB=>@Pq31sK<s5-H;uy$aov#59lHz*`O&rM9h<#x9$n;9k%lbWPvS
zz`Sa9>ehKIY*IK&FKHNtK=>dwBnA!tM7?kXz1ZY4v);3ri@ie9rHWCbY_f$$>7vgf
zttI$T>Lf7>nT&D`QQkXnDv<#pDvKKp?Mkpsmla}3FW%A0aaN!?Tgcmj?f8EG-5uWY
zG{Xt!rdg(5+U4N<A=k2m{S+mGXdI~O{_$5km+3*^#QnyT?`6S9HvYRx=I5l;o8S4$
z_oZ1bj~hhz_Z4*GVmr%#Q^Pv4LT+To+u7RiUfyWo66VW!6t!64`<2n?=iMBXnbP04
z*#TQ3DEDb+KT!G3+7Buw0S*QoEowXN{fbkDt+$Vns+`mB(vEv$>(AdJf4?fIyF<Pi
zn=LAWBpOyROKORd?{;YK#Ll6=crKdr0Y;~mANM9o8x@t}t?Y6?>nU>xqhWpHF^kAd
zou>7Xv!fy1;)6av0LGJ#5`Q`qN2OWqSg~+Kov-@nI}hIp>b#)#I<7kjFoI3a#I{-H
ze{>=g{^LJ*FAU{_GIAro{BRZqHwnv7_N&lF&p|ns7qDt8C{a$kNP#qBblw~!Mz3K3
zWpNSj-X{%vh^ogpvj68#7DNA2&$qJdJ}9P%BG5qINJoUC13X38^OEjv#pN$mvwJY|
zH~5kqJ~*Gv$MT(~;ho-<<R6fq>^g(ok9eB|zYkGh1CF?-UugI+SY`Fb8e!BRYFl_<
zzV`K$7!+Q4qeJ?`oTx0hdOxN)V5!?@&)=>6bs=>MWY?31%{=SBZuTPV;;0KC3Xcnx
zKg)f5#Cbo_sgsJc3f*@VIi*GnH=$~Td~iC_-UTVGT@33DNYUN$X=(bri2%{<c7poy
z00S)PGpz;5ET?jKJD%R2o*2}9E9xLeA1lCx>qC&-V}3h(ZI`w^S+x8)ow>ynfK(W|
z#oRP@xF`9G6>=TMBu2#E*3dvK?V<<bc~XkC$KfR+RB>bH10FH5^-_o)-XUO!gaW){
z>MLz!$9e@%Rctw)tLOUA=$nIJxp$p)`OD*W1|`dUC1NgxP5$KzrY8^*i)FW-8EroG
zreNU?aq%5->i65@m&aFHn*F2S&RA02y5FndUx2u+pF`bq=7W9vm1|9o2NMSdcS2<T
zw9??_(F6>Gsnm0a^PcK}C?i-y1Oi(@rX$L5X|WXB5<<m%tQ9fp<8SASYP$M3oXEcL
zWI1ZLVWUE38%GuwPS*h7Jfk}T8R9kA8j@gDoc^Fg2RvCqgg}`I$8V^>O!k$GtI3OQ
z5z9hHXNhmbJ}8+{2P8RYRV^x+l0;MrDr+%SYn)n(#dUrscM2}`pHmB1mb)zK8KkfR
zPOq8LyqpOH2;=3|#_?D$H@|6{7COOhOi^4RoQv6^e*<K<smk(TV}AMcXSY1z(DqI(
z%UR*svB4T#v7G#kYwBK2`}XSSQkEL=)6(nc{_agUt=wwOfp#h`SZ&Qg?K*_G*Z9{j
zfAMaZHFll_!Nh=O-lY})#!Dnxr2dFrEXg7370%~Pt>5{;${1RAWS!iI%}8%tQDh97
zshZk?H0<k6nf;t6PMCwmaH+ErBhK9aXJQzJR;NeTGamTMdC<jE^IaA`2W?eCC^xXn
zA9-~CbzLqNta~oXe})e+W41466s0&Qc{HVCqb#zY4bs(%K0AW=g7#khPFx}IhRbg|
zKkh)ND#zdGzzaVUOEd3i*nA?Udb!mQATM)#5rPZg#j$Q80S9{vh?Wwb{Ns7m5*HwG
z4ODd|l6VfXE`6VHgj;k^JjSQwr0(rMFJz1^Y8g?;%cNUo9BGT?Am<RVV_tbt2soX+
zY^{;@>I*99Jy7+J=y=M&oFj#F;x;`PZg!|EC;`t?q^l!&%V2^|<zT~7)yfE0MpLw`
zel$9fCozj(ZSyz+(t8Qfjb{w=Wpa!V;tv<)Iwh0S_}@DYG2B@T*Mk_}8#|V`ObOY%
zE_mo&>PI`<Tz#*Rv&kfF9b($}I`!~~g+#1Q;Dq1vidzSdGIbZu8}<noo=Ol7>s%mo
z<1pluWnP%se&{{Et;~!d0k6}VWV!V3FG^!0u;r;r8)c`|Jp9Xv5l62cVw4ECsDpGP
z_A6Fbm<Yg<mwprfEES2oaoB4b5GB=CloO*LNm7mhHTpS>t2$h2sgax0X-TzE)P|@K
zYLxnDw!-z>?RBe=shL<d`r40ezMJ~DhHCdRp~BK*3<Psh#_>F16eEbG)H#YWazCAU
z4Ot_r^~4{NDeUqzkF7vG7@4M;EjFS@i4t=Sucbo>q<h^i>!ayVY3?V%<`1c)ZcSK1
z{CIVM=_tzFN&(UwHrpyX1~-`J9cZx2a_OtOD$u}IiBzTXl5avS_$?zk=+DN&Osd10
zV(oeL@ByOnnrbYl=ENGi-8~zNhR|B_9vva}3|Jq(af%6T^`Hv;#a*{HUhGvok7?F{
zb?|+o_X%}WCT-&Pr`dYG{9JH1;j<-R7n<xxl)o$FA6G+B{ukdduH1m@RApp_#-iBi
zMHA#)dA*D<)F85d<fb<K<z)xe#n~sUK}8hIi6u874k7gTaoj$m*t!pNb>Xnq`7X&3
z5*)y<dKSC&-)h3LKA6!JX&c^1n1q^E7C!#GEu4Ym6qEVJm?hFrU$kc~Hu-p-rF-I4
zeW#VCtb`X0x{)wJt$64!qEH7A?JQ+KgHDvCC6;%^JX$$#gZvDV-I9JhH7+?}(lk!G
zY3_pe-qD2IB;7QU-^})bQLN|5JPL%qG`tdWu^7wOhI0t59EEZw_0ozM%AGmU*BNVo
znAkPc&Qoim(`~~SM!!YXwu@$b16EYQ3k})XDRJlgw(gMOokofn{S1}`?Q8@6^k&mP
z1T5WMJ>c?T-iRtEtCpKTZ)-khV|d@51)li`2?fUieBM~Y24;F-vEB^0t_QbUj8EVg
z`&y`69_I(n+$bCHC^zHv38r*M(V;?l-Z7V1V)KvwI^PaHPAa^LM(cRyUvqD-Kfujb
zR}2^qI9LnMJ?-jL_Px6>?sLCuA9mFm+S{oS)pXsAX^TMbL~0|mbas~p1fgO)O%B0E
zaBFg?J+yaYNKePuLZx*ZVU}yBRAJV5o7+ow{h)ePH2WD?u8rkm0g#{}T_#RGoB4g*
zATek|I&u%4>_&Q7m;bDb;Seuf(bP!yr@8Eoq}ZvIa7a~)Ua=J^_uSLYfj7}tm#kcn
zlYDhagMwzAB92HVnloDii!?ilBWk#FsU8@If{hW;Pi-beJ@PxVoA?Rd10&nHMwd79
z{_c~wP6HN8c7v@~v7W?ecVEMx?prR7S??O{3Teh4Pv^iZl|!0~K|`~942mp)?}ggJ
z&Ftvn5Kpww_tR<MR3;)?=&C}<em8yxNl5<>PZNuo#8NI9EmkUwzLJm|e2*-~*+&5p
z2i{BHluf&)R<+H#`I$pLr2(1zHA*AE%&ff!&oqs&W*tpqzb7k$^yZu<HFHf!<wH_x
za!pT$j8NT=wk9UGB#q#Bj>$KkT?)_6?D8}&9d{cI-!4h#ZJk};iuz@ku<+{I-2kEp
zG*E0-C^Gapk3N}W2hrI~@KLlc`IpJgbOtBV5FeY9?j1O>``p>0Lf-hu2i`=#K?TkP
zM5N`4R{Bn|-LQQRg0>@9fSuP^#qwAp)Q?|VWL|a0!Yg5R;Tf$*f%J^u=kN~O1mEy@
zM@^4w{fEh(rMyxEO5t1jZHEsrOz$v<a$P=Ko(YX(`sgl8Nha2#{S_Yp54<P}wYPTx
zpoG9s6sPWyAz~N9(DdvpTB-gApkrgE8FJ^IW8vWD)su+&EHSBT=izwF{`sG{P{sg4
zy=-JTD6%zWU~OQe`-maU0>)+qOMX_|7=iRw-%}gCUehnLZ9obF=kK7XPsx^uUTxw=
z8Ia`#v72p`Ag$;vf%AzwuN{g6{S6}`mzl=afPl<R6|eF80)c(DB^Cw`dOzRHVR#U(
z9i83Xb?Y0W&@%B~Fp}iwqW=)5&K~>YF$6&xAjeO7$1Q;Hvz-w_ib$~e9JoAcRZHB^
zusknMYq^j$5Qgl~&eo(?xDUs*mA*_X@N_aN_OPMxBpceptqjjW8^bSgn%Bh`belUW
zVM6yScsA8exURbApjRC}0gut-UfdJ^IFCr^gaZnbH1%S`ep|K8oeJAq9Sy5>5kF8t
zffE&q&a3#g`xSg0V{&FUFAY|3{`I%^nV5q-csbLT7Qo`#?)G{us7Y^I+gELe+Gg$w
zz#1QIB5|#JR<U^psJlBS9v|s-)BYK@7bGIw;Jj!ruo2k#9aSHgB*NuG@*ZD}a+v|{
zWD>X2K9nIgmVvR%5D7Ijt3?GCnS!4%p7;wWO!a#z$|ljP@zQI_#j(iL7MuBRoKN--
zr3>Q~Y2I9SinXBRzSO2wuut(XuKrMI#AVXM*L(~Sr?K74`d<gvnNb!U=s291fLL|G
z#cK*kX-d1f(A^uP6PKuA^ii7&25i-e^wt@ZcW`>9$H-9{k1y@a8P@EiC0u9|qNE3D
zZwU>Q!d=YfIzrH<ik4-KOyepr5UnXE3$rv~Kqyaf4Sba+E3erS%OzK=77XMHs4q-M
zB6<Ry_Ra0``k}`c@ICGiXZTy0-`5KqCm}Xoy?Nc`zxuN`3gnhz(;wKLB|GCkSBbGf
zt**JpCPb(brZW!qvT9hQ`9q5lVN>_pdLB_q4bU<EZa?yMH^m?(Mja6)sm2J%FoXEu
zks8|jzB10kh6FRM2M(_uxZ3k1MDY;z4Ct5n!ZEFruuECzDNsSuo6Ig<{D9;@TWm^S
zZ9v@$hG5H*zOZu47py{q8vNIyo=dNmSIn5}IZ#*8(Xer-RmN8oDIK7j^*T+*T89K_
zbcb>avK=SSV;f4_u}-7tL4%iaj2G+yQDXf1;q!+4-SvHYyJ<L^NM6zxSzO)G0|2x=
z9=b`9<1BtHPCZYi&BIvvqpe8`X&To9bM8!CPqEheaI(KssI?KqM40E>z-h2M6N)Lz
z!(@K3T>ZvBdt@1&Y2vL3mq28t;-Es30!VcTB>hP&M7?}s4V}m^q}n|-kUg#?M=XpB
z(-3ar!O$M6V>n{073cVSthGvGaf-dl)ImgqcYr%RUhEOK*e}{~g8S6yKvv5LS;{9a
zz%KbMgHHhmX_o!>C5=;Ac_%AiA<y7|Gl4(d=)i!3dE!3!#7W0S@0w-i3#sUITkvmP
zOG!zI>fgGDiJH${IbN)mZ#?^pwChpYWB$n9@SgH;Lpe*yHGJn}9;++hs|~58A2!A&
zAl(rDJV;uA8M+(k$g>C%lV}W_N$^W1<z1fTxlDd(XcN5+t@r9Zw3#~;n9&!MNkVz!
zOUKW-qQ*<_k?1cB_yD<)U0(Q?5c;@vl_DhmrehKBz-Ib|AGM24&7xwp?%hqlELMzw
z&GHxSB8?%1*1w9E$OS<AhgW_`oqV6=EIIcd15HgCS{3}!25R;P53Pqho(I3%!Qu~6
z7Q!qxgW?FXn+F_EetPp0*)}Sg79@C66LfJ<ZjAX^a^Z6@@2{WV(w#&Z3aQDyBC0*<
za>R`DvgRZ*CgolmqAB(uPKCY9;yHEE_|Dj_XeIGdh<{;!8fP*J9My+sQVVNH1%}r(
zh8LiEvP2XtU6^^3@YxgcO^LFQ1!;*)k*Ao<!MGVjgRE(Q;UO$UYWAnc>It1ll^5;@
zcL{Nr@OUIZ2dyaBQ18I4c@G0Og~Du>)ST?~h^xwv-~|oU`A1FH{8PraAai)Rf+2N!
zCH)7*)ndlzD_pReUdHg^7Y|ujGqJ_&YC9#$%fXKl1p)#K4sVdV35{q882(M$J2<WU
zV&G9QF&E(AI~8>*N7|-WWj3BwSn8|vk<p=DH@v%y#fYSyHB5qek}KrS5e`Z5?mn}2
zcBMfg3ZiX_=r}QQWjFcJ+>OKSuA#9c9oP5djYw!~+6I48Gk-ux<}l&!f{$9~@Hm#5
z#O1<O-O}xlMd4+YFAIMp(TgMY*1tWZd00uSQ#kzDfEou9WjgLNcnQ6%mTiH9_|k`I
zA$r*}NriCEIw#3jnbFlxK?DV^-qd-XVwIM6l$u9>QDq?Q4^-yEeC7Q-w&FthZc)~&
z-MR3yJ5VY(a-UB~pdfQG^=E2_#7P2>Xh;5ZMvg`Vv&d+4VbD7!+uVYNG%s*-=0$%L
ztgG@T6T9C43eR&Ax_8gr`{#Z2#4+GUKY(g(IcX=H^=a)OzR!;R=v_ry5)IZc<cyjr
zbVc%q6-3Y>OQfCC$KrCE#ZqE~-K6if^yop$O<(|-lSQT96CKIxhd$gRo9n7wr5yj^
zfrjPe`P@x1vW*km4;A;&m#^E;4}qNtIZFngd1_P=P7B=LN8_STz{MM9c2uNxysPn$
z#F1KOYQgaSLt}>!1lNvJca7P>*8d=dggfMV75jUEh=um7W!s5bOKRsI9U6|>ikfkG
zru^D0Mm$Cs@j|#Lp%$jHLVk`A#{-#`KUi%4uEvMcSNMMiW@zXA>!}J)+payCZ>nT=
z(6zgQL9^PLf9x<8YU(VBBM-zn%*?riwnc@y__H5_;;sm~V2cP~cLw&eh%&$<C(VQZ
zcqBz8FU<ds3={ckJ=3)&-jAz9FPi;;11OZ7@%K(OSjH=Ccr^aLe%F`ly9Idh*k5F|
z$ld=X@UD)C$=P=E0;bhH5C0?XOmFCmRNLDR{2w9alfYd`(_U~I>>B&EwdYfQ$#-kJ
ziVfG;Tw%%J)^53=yKSu9?snBWrm)=J-iE+trOf~nqM5{>4OIuY3iP3F?N#|NI<&J~
z!=rFl?X_)JpulS0YTL!fZTTb?@YD9{2IAlQ#dY=N`4SIG=hDmg#Sn?p+zR0o%KY!h
zisz?`trN-!$Y<n6*2Z&>MVI#OhP15P>9wmZ5*2dRrIVF)RnM1q)yQ_g4acQdON>u;
z>YFXNfB1b}RAGb8X89pQ3z0Qr5wP1$%pz5CX~wna*&Zn$-y19IvToI20RNOq5K7(R
z(6BCazXg=g)Xnw3P0RFo|Nqi5PR{iJgWYv~e>T6UTv%fh0xgX|;0*gTj(<zj3*x4j
z;hZx1@TLZvJCgPP)nWv%??-y{P(2~sZ*-C{He1qkfN3q)F}S|l{h>Q6cr6h6U7p~R
zOC67GmvfJx@_CpDBO|@q?YhM!7(gszpGP?YsQ+R_3r2|R6(V)n;@fm3&Y5$RoI7SJ
zpe^%~1$K16cRb$pgD*WoV3SHiq>)4XoTI=I-oTLfL%e+(P=DZhlf{C5Uck*I$m`)g
zdQil{$4YfTJLSdZ1)7QCP|knj5-IN?%;GYk#>}nev7;0SmQf?*z2CaLgNeYQLrgX}
z&;<HV^PY&~9#39TB*rJp*E)IC%4?wdDTtXl0EBvMYy%5wsqd3t7nd^pnfbpsJBQ#<
zqejcdwr$(CZQHhO+qP}nw(aD`xv_6L|9d^?s;=tl?(sMK2B%J)z1P|WKelradDUi1
zb+C}q&in!No0nuE3}dJ{@^v*bcAo}<FVg6Hytg1fdIIJ*1h-{C$j9pMYwjER$3fql
zHzdLXhV_)*r;&s8WQX(8>*33dzOE1~awGA@5fVod<2RHbnD}Twn>j5*Q!l|Aq5fgI
zl+ZtPRz|Txj#xcYYFcubhP4fv+f)Tl-?D`iCluu|w2YlDOmCVtzyjE_n?nv&q71B$
zLSlBfHSvt>xo9j7MmK~uTW|9ACnU9U<g)B>Z_Dv|V<5d-_vJ%gb9}+l_PVzhW^T7G
zE&Q+Ct~ClTNhJJ&x6G2h4?MZ4E9MFBGD!Y`eq|*0f0l{GyY~rOI^Ir0ySf|d=w?RD
zVXQ6Fj}5;G-V3(Cas5~VNuJT~Ox7g&Py?hueg81rQpMbQ&LEV5s_*Xj{0*BrF0jLJ
zi_9f7i-XMSXQyG#eUjZ%`5YTF_3oE(C0E96k8(Udu{Ya@@Qh%PJy;wWv(6ZhV?IJM
zSmdDlS`QOG-q_Q|nHnjSZ3mYK$y%>=F{qB4CCnTuB(b3%dKi;@(YLJ%zPAqF`>FsG
z2umPNsdm|7I-J_G4uZcD_}RAqr~Qy7uK?SRYsZnO{Z6gpFbc6>*U@{FV%Q$bx%#Ny
z{juJ&)n79z*Cs2??l`3$Li8U*_iYhBm`b|6;z6`HN^7XHB%b@St)2T}y988?t^>G-
zV01#H&w-H+OFu|5l|vl%INER?U2tQNx*0(AzR>$bRM<0^%sBLrwNNH;aP}|gL(xO>
zPt&yr6Rl<op**1dU@B0rLJdl}+ln;voaUSYSBkmRX8sxlk-0Ukb6B094eqQ;z62?p
zUVM3qi<CqgDvui+PIK(pjoYnh<dQb`Rd(xa#ylrh-5ILMFi;m_e0c-sC{HC{|Hy<~
zv%uQb*zA#5Z3V6utvi22C2*0BFF<@P$L$(1HQa#AwEu-*Uybeh%Oy5vaZ1<oJikn-
zHfFI{PmrJ-lN5EucTa^XkCv+{4NBB+1abQML<4+ZRJJo`k$WMnivUj}Ecx^<7CD@(
zZZR6NcE}7{b^NkXl4`GJq;$Os1NoDSt2V&T$_OSd3M2)or9YHWb<e2UAHqmGI^N<E
zdd?E9$#^C|V<v&NG{@u7Wkf-A4=~JQMp0x02>BbahW?ZpkoOI}v`)qRq}(F@eN}Vw
zz&)Ka)()C4w<mSvz<9DW#v9i{dF>D_MfGk7phJd+=A5cLp(RY4J(g{(IpU6@Tq6_q
zL<?78C_ub)z~MAQh_O@-<gJyR1NcM-?>MP22hjoZwg9|UKic*Cl<}H)qTK%XIYB!4
z=YbG_?ALlyN1K}b?}u8t{oUX0q*F+_lUfp@WQ@2Ow@(w{QN$d5BpY-|zb1M@FkOMb
z0UyC~^G()Nh}`%}VbpIuZA`8{d<!ahA$h8?krCyy@I}s_8p?iA>X?{aP}$AFvY%&W
z*zy{D3y=VH9I3#ap<g}cQ0Yb62@Ed{2ABoXY`8Z(QwGiPXweQKQS=#)e4J#FA8ndC
zk!Y9%SQewqBov(Bc7*9T10hfO4C>SZuq`(Mt1pJHEo5<=L#{kVb6k;Y)6fDkd1^?b
z9~G5z&tog*BojhG10M*(1Vgh1o!Jv}oTH35c5)Q}tgYN}=8+#{D&m2v7+$`WEz=OY
z&Onx~8E-iRpv98_Z=_v|+WHKzTQJo0z?I>rOl$UmqXZ3&tSf92yZg$wXC&6sM_WD=
zhH2T7wDU5Rv6_!m0^YdhbVE9*tBf+`DT7gaA0eR?uUEK;sb7E{GODJ?2py7INu{86
zgg8Pg<imJ=P(^x*)X(_Ovo#B+zvebL)HXxiSB<z^iXW$_4eVfdBF>51QJFPFn^YJ~
zF`pGBk?_aj%IuZT3{x^oK>6n0@);tOYZS_PHzlwVMk)<^X3YINY;GNN@~cJdZ%N!z
zru8hN<D{TBY6T3-PoFX!{&<^%>zM(I5gbGg3A_s0L{tpYFX<zLze@y1$d17BvjUGg
zTdC{n<0bpKcG^W2c4mW>fo-mWedd<!0o;ZXMt~YB^9I{b|KPMt4>C{QKRk;a%+~ES
z*({(|j@QBXBn#PgwallpcYL^ox<^%2$?`Y1i6p0-x8)TDr*`1DR|81$=tyAZN@@FZ
z8rRv-bxvhhPqs(_<a`U7T9Vo6uDpJ}tGj?i)DJQu(=goy@z8ku<f+a_!nIZlxVT@T
zT!WS#y^gJ=96yL-ye2R+eUCMFA?9q!JBRV!e<yl_9r2^CtE(k>`tu8K+n@dxFw2sD
z>d7SzP>%TjGSPew+spVNic<PWK3e3AFTm7voBZqRKVsmlnQo6U*#3^=9~>pH1kc8Z
zWP?S7-@qZA2NH7w^%(}Y1bVbh?HpHH<x;3fj5HG4@+xI-bx)w<bY5_Xd6)8MtY$7X
zKpsc<mBpmTO{ByByEA%wtT9TycC1z&a5UW}CrmK2E&Y3?v8V^00rfL1%b<<&-HRNf
z(7jQtkRN?IqP+P**El#DtQVe29~yHMnv>0aPf#TzQ5>>%lFfqQS-3`Nbt<Ult$NSm
zEPL&yDqXUXSoZg6T?np!ay4KYlcSIuKTrZm6<rB(qE(?o$FIjqGSu+`jDO6S16@yn
z!ZRj6z#7I}%m(&=HJ{Gt-+w@<4cdP?5+Xr!q}3ccMHS0w^>NRGIYL!jPz;puf2y@N
zA7Of`#*8P*#D_CEPL_@{ZUsxF$!zmL+#t<8jA7dt9L-92uNA~T^!{Wq5II{I{d13=
zKCPvDndv8O1Y&L>)6+R@qT;=`#+6TsUA={W?!e`B>Tw?Us`aNS{+M3I#DtKjReb$^
zAWVvva+OSi_E8^nfBn(u%kMu<A5%cc17iuv+NODEW8sCOLxiH!C27@>8&bmYr;+Xk
z!K(LxgNp0ci%%mvx*WND*V<vB6myI6@?h$`fho$RD|u_ClpC?LN5LiLchE%plcf0f
zs32<Ru#DN|VBBX^L*3+&@MQ*?n+tvh#rdv9LHwoD+|FsVM8=X`8y3fao7&YRuU(^_
zofkl8{0`(hd0HH*cW8ATgwhqfRlGP=k!Ku`qz%0VeR~79So&0Ww(18M40DuV--HDt
zME1zC9PB6(YB$aRgmYuI0qWB*ileLx*J?Q7Ak#SAi2wK~y=gYS(C>jYGkx>T<pj?A
z@LU?T?2#}>Pf8j-2a)_`z7fvNdK-fXAJO~IFHFsp8x^LPZ>Kq|hy|$MHC)>Zj0(<=
zGuzP53_Xtnp1MZewe{R}<Xu1CtG8U*R*VzWL6JT)a4Q)$CaesIGqvIvVp+q~2x6uw
ze;!67Gi=D`o3%QH5<#Bb&vYVewAf3E26=LIh7gUOrQu>uh?W^jFGo}7(CbGyQsfQz
z`<=;X5q6hfmoQgBB8>RU=p1AhEr2H+k(wSeMF<P<sQnI!ek;vB`<lj9b&&vngx!fI
z>iB{27#NG1XO;CX@<Ci}%eA{qW&e>9<I|@}qg|VhKEix{gt)rlQCZE9h6-9;jX9{F
zTKS)gO!QZTQLgAmy~2rHG|vLjyp@*Nr?4@VoHly)VTQ#k&pLh^a%Tm-kZ+klK+IUf
z9~fk8tW_`{<2z>dTI}f>#k&T<($RWjaO78irlN6`sz(h4wrf)^*a%e@DsQkpy21<H
zQQt|MX_7&x?<h8{03W32HMq9n3foo2nah{x+_UU0z2d&+T4o87$#zXzi<fuIn$6xe
zb)5bJ^~8;iYSy%X*C0Zw^CU7uJLmTqB-Cy72<L%5{YsTmKh-NWQzs2eSrLCq@1lKC
z`J*3At>w1%49v+n8bGiXYc?$Hqt_w?(cT~rB<X1mQ{Zm!d2I0c#@N9M)L1Qao3sDQ
z*;-|7%2%Pc$nE|F!5TJf<1<Lnwy?nDzCa$lgJyGW)ctG>7~U8g6Yqaw98QFx+r$Zh
z8%g8b#$#btSHxJaRYVVUEEA~ZA(~qC=B{IIyW|W9KwhnkE4SRZa2-AYhmSQ5J<S&T
zzuN?lV=cGuTh6X|m9ysFFzH8tiO(8>sMbG3VOJ{`UkE!d<8u8{!p;6LI}+uGF1nZt
z%xL-pQ7?|TZ7m{yy>7wVU;RWkbFGp+JhoTD?i;f;KUiWdeL`iAO{JkBgQW0T1WWr_
z1a*A^*54l$>;_><DO}c}gq&Kw&ndiX-VC!6lX!@<CyPL}2N!v2OK^mpVw!$SCUDLe
z15Z}U#m1HL!7#nYQ{VVy%D3YvW%;~p5knT<Dq{~wH^+R@o1}I>qT66lXso8_u98<n
znc+mUibreg>>Lo5_(MCzSP?#wlVNriIG1X2u!7&d!377?jI03vuE4t2)s?M4K1N~T
zf}W49K)%*t-TYCm{+*X~n}_D}e%{K?_hDy$$GX{<Xv!u$WoPezr@ctqgI?{<(nTze
zXj~cT?U9tK#Z;FqU5=s~BK}-?K@c|I{77cOeNB%8VA%ik_q4R7HT=}4rT^ZdUVhl`
zb*jIAK#hPb-~(#CjQck$e!8<NQmUspBU@>KaV!pc>zp&1<_XCSXX<xjy=D*HEt+3}
zbc3WOa2#_0W^hP?4YW*b@IO%D3((*OKokqj&V7;jS+<$*t8p^EaQ<=xg|M{m1=q6D
zk4}JZp>a|09y?-9D@e`)Atg{~w%;~J|Ff>jhhau>a}cH%e0lTD`iuz5(F=59HQ?*|
z?KPjS5(qdRIb8Eyw`5IbNIv7<1MD@koPF4G++TYXe36;*<rp^^3BWo?0)BC;jsfZE
zz`1dO`<>vv+nMu`z(T7ElnV#rr+pT#stf@q_7fC&hGX`!B>7If3$(sH5RMT2N3g>P
zMngUsM~n;{&{tym4Ax>U-)td!jHE2*W_YF%6KG7xCro}GRz7(#IL(t?m09My>ACW;
z=ivKilqa_QZ&71whxdYqDg_!5%9aI-ahcdQoqda!{zExs+g{@~w!zsDWn0cug1wMD
zdb|4ZzQ-d9Y6RlgSD@WycHsWVc8sEj>Y43_l?sw#H<5}Emh~<Tab!VIWcCZb)!obf
z&CvVPuQ&-;tgs=Qapj|wdj-}AIjQ5+l9;)!ZIwW2A>%@fVle;qy4SA9rf+w9(=W1l
zqHivHYm_<<3}XErrL`&~=s2ddIoFfMN;U36n=yywFv`K_(8vd1FOtaOJEV~qK#B<v
z7tF^ZehA?N5`zs@x5aq%?^L|zg31Pv*wP6vPRu#@ZEW~57HsJ(Z<e4F?&=-PbZk5c
z>)DrNK$+1VR{z`mAEhSu;8IxkH!woZdI-33$)U4{x=2&?PL2BQ==~o#^Kr$@AdL%v
z`Qr%`C$*%qsJp^!^CRz#_jwV?>$oE05#qOH-XeshoJZEd@Y(6t6alwDr`EM_E~RJ0
zL3Cg_?wp^s(+naeX&MBT@?b+rl@uggH!O7v0OF3RfHP@y2n#zoI*j)iG>O-pYlzNc
zu|&Zviky%(t&`OS^r*9q))}0Y&SZQ4XSe!3{o;_<*K?Lini$j#MY8qT@s9TLu;>1T
z9*A&?G0%E+jfo3TO?e){89{qrT2;8w=JF06bgY28JgX8BcYJ|AG(Dsusi!sv<>QYx
z?GtuZHj#!<e~sb7x^?4U3VJ&Nbsm@;%et{V374@zfZKYBYyGAz^L=iyGkw^|eJ$T}
zXn{7if(cA=5Xwf}W~WJNVWW#`5^zT{_<uBgf?K?~Xjf5Q2f<LKNTD&w$^#ar!@}YQ
zE#5|Hc49mzj5iWRUBS;37rt2X=;z(t-B#a;$fL|*XggZ^B1b0hy?DzYT9D;|WoCBa
zg?w#9T>5%=-F#2;*#X4ZsDxJ2R#D2AAi#WTI5?;*q+0=7LY2L)gs1sj9BBJ;gvE!f
z)`G>=ra62N9#7Q~2B*@wqD{Edd83iKozsdVUL4{|1Ug1bOvc&oJDDU*7`=hVWMLlh
z<78;8w*d#J8W#|jHxcJVRLht!M>=s~{R_*5eA;;eBIPRjvAysamcy7``T~MS8MrWI
zW?$tkh4dFNK`ox9c}gXONz5a#3eNx*N`g6(IC<45Dw&qc24tzcUB6ER-<|YvQ^kid
z=cH5KNr|zI^&3;8^RlZ3BgM}aM`g#D;bu>zakIpk^V7vO#ZObGEYrD`()~=ux#lcz
zG<l*h?}z6+qu-Zw7Ty0=iHX!C7JMqIut*3SdvbEwyiy1%er|w{h(EjRgW~;qf_46o
zG^HvU!>4W3CeT@e6DFpju#s5~VEiL-)j@xpxNG5&LbIJd*8Ds3{zU^#<=^L1Mhdk(
z3(ZW2dE;7im~s<qZepP0iM@v9v{x2Nl$9B{Uw$HBvd$3NQ&+orT2)*SbBpbl-*lIe
z1xEm0yrwbH&y4mkQK0*t>ffEQH<mSvG9%%WUeHDrd)x1D7Io&~_(C<vzp4ADNvUQX
z3<iJ?YR#I7ebn^$dc|c%nK9d$Xe?5j^cJf1at~oOhK0b!i^$n^HR|tlqq=`A%nXJX
zM_?eK76&qLFbeZr-gT!i_!|PI5TqttADznQjv3cc@~Bs3#H1=WivLkqZN$2@&!<pF
z=JEr^8S(J}?OAe#CPu>3zj<T9qh*;!!pUT_nIW}DdcO0LMs>HD%c}Y2T;?|!=QR>_
z^BG=2o11bz3y7#>4thy8{k50%_O=obEhL|QS;@&jBChkb2t0;}jEI?xUJYt<+b&RP
z$4m=#^_2KG=1P+CB7?MO3(uPHI8}ymxrn2#c`Hrk#K6}wIRjY{7;z)bLN>#3VmFB#
z3I9&QTfSiL{4ol$pDmX0)rq#4N#@*v?j;=G)+}7RGLqgw8TzReV=S7+-wuF5F#PEv
z^5f%%^^ydff&n{5!)Wj>k?vbx5N?xzIcH@DvKc;u5jV5UZN^P8Y<NS0KKbMWX;l6n
zU~=l`7)SIRPA0lW?Cn7XvYMsIQRPqfGYT9`?UQ;*B8ef3{RSf$%86HRbL{468X)_)
za+n!Z4g-^*NaDy}i$R<25N?!+DT{!cr=$oS4i7GeSp<6ePCIndXr>PIlq2&1Of*Jv
z!Jpg?BWTh9B3$LPcS#Y?>O|7OOET@aZA}!6DHf$axNH)J3645Wv}li%TYva&>VifN
z7u_MD(wX40!>)2%SY&2R<n{!bbuVdCr%$K%&Pm%x;hDe)4&P7}<44YjO3H75g%UmD
ze`x6NmguC@tnh4>yK9y-40X$VkqEZE|3Zpx6-;kiDXwffMX#vdp9$b$irSS&*k1R_
zIk!M-3|)u<LJD@=Gr6hWNrCR)(Yv7g7uyVjAaBWtWS0dp`izgp8ZH}U&PJ(`m(a)z
z1#ZCV-1_(#PxW3+Tw5Ir`<n(D#k5+&&7IsjHRYWUFi%D>Rno{Nzwr5n)8Z|X73E%v
zWSllQm&tg!whc=xlvz^krlkBNM?#p(3Td!OLaZK{p5V0jE*K3{FpQ^$2PI!0!KBbx
z;iRW1Bbc$#`t*UqOtyg;gV9<&ABf!BYnU-!hPg1^J0{+JT_t%=To7PAJGJ;PPYHOo
z#Ml&(=F8dgcvGEWx}$$Zg3QS2nB8z52O5>rPLoJ+K5SekEt)6!df192-Hx6=hpu1G
z`^zbfNHd2w&?=^%yc4IhV+Vd6zP($ZpRE9zMCnhyvjNMOv5AI}kVB5st0g6uAWKfW
z>7*TFqkaXvQf{aH746Iy3<I7}2wURA@^X`WaO$$?Fbe7Aejj<0;vA0N33+4Q$|Nwv
zn@^o-qM~9RZbKxhi#->{R^|?_Y+7b&MxN3qzq5jOpE{;8MrkisGs~@%t8HX@Liq@i
zX}c!+2*P3VE&T|Zu7)t~erp!rnJV$)I#H9sqd;J&V|z<mrA{hbU!r!8$goGCA{V2y
zy<KnpR_D&9lBm?Y5<MlO_XS<ek3>30vr8S|uSJqu0PW!kJr+hK61T1v*}q{IPjoIJ
zLe<Fso29Zgq+d&qdj}Cq(*bsz+Ic-iuyl<W<t8Lj?P+SVNEVhZ7=!yl3skqAIQ4y@
zW*im3wD6ZGDm1jn>36IigGt#fhJ9g&@t@l;E<UX6y106hv|HF5?8K@*I|o1?_}T6I
zYxV_CU95qv1EKUf4{Rts!~4*Wox=jJUPp`66EuEP>GL}^78f%>D9y{!85l1io?67?
zWZchhvud0@;it1FDe6Z>lUjY<?wEgf#Ch^f9v(l+6)`bO1?M>^ZFyKai-9<939ttZ
z-UJiXL=cVnfgYQWZF@Y<|AdX(&i=fi5NO-Sh#32+wm7B!k@$dLJw2Q1#B2F#=0wgI
z)9Wm4k#<@LvsmO9WKywyxG%9~Q06<@pbGQD^MP1OeJ#NBFoQ^dUOx*)ixpajhWf>I
z7&j~E3R}Ag9p-uWs`4)qvpR{RL77xw{S7DmF|NFH?2iv7bnO1}HX$rJ4&&JH$O<|Q
z%(02(6N?sTS<H=Eiqi$Jx4cY<@eZDh{U)ekds4_n-qlkbP>~~c#6_#qSy;5t_$eSe
zq%JE~NwBPC!Kcc_$dbEhveS_E?B7sK>`PN7lFciq2>Y}&Ueb=tq6kOA<=U4J70l%-
z?9?j6a&T;^i5jLq>jBa{<*@*Bck{iRvx4RHXiRfSJHlkB=nhZ-j^bMLef~0qieGG)
zER_XZz!aix7<~@8FO2QfH!Nt3A8{;w0{iU**9zBoD%0V&iRg{m71l+-fGZpNaoLd+
z&q-|KZ`Mj2iUV5ZyVJ0bb@zPM>N;v0q+mEdf%3dt6k;|Kijziz@KPFYVkZu1u;;wS
zl52mHVg_L^AXqjY#L@Vh_`%OD)Y}uuN(;;;R$)hk@rZwL!3QTviGLoL_5Nv7(bw0I
zp7vY4tNrUv6vu^JB9mYABsn<o09VPmXm{XWkfk;Z1pw-xs5g^Vf1hAu4;sYutc&z4
zcvy8hbyQ@@*#kF^DD?hcOo|5XLa*kBFr$k5_g+Q8iU7fUorATnUe^HOZL%z}aagRj
zN*roh#9R>f|1iFL7t5(ILT%IcT6p#$CyhGrQ8$CwAuh}rh?Wfku*?&N9d2y^um6MS
zL0*F!{vEs`pjjM^2igVg)pLj<$J7(?)`*-9`@H=diIXl7ODl9G!CB$9kl3d|$Q@wV
zEJytokdHF)1;8QDK2Zxv5k#hgu>`o)$bClbY^}0j-TlYIm!sw}EU51e?7stIh_G}<
zELJGa3g}p|uoq=n*Ps^&`|tlK6&JIxphAk`8L4>6(J{}Ls|=@KM4rCdbmOV4vXwDV
zooW3H_Lh)50z@segls_wZ7~19c#`kXW32@`e8c&;ASxQbd>cgUpay|g0Uw_L!a-f+
zM)oK!;N}rQX-J4RjStuon-$_y{eQB0*50s<zjUj8`|IoFJp7CMf$0Ac*4ry;AOD|9
zMYai)?B5cwD4;EbLDh)bx2rFH)Xg1Aqkhy@Mir%-Uc`E9Z>;*?KOc`DYQ8_XuJ1*C
z{js~f0sq!UZ$I|@e2)#RedVw5u5WHxDp+&ya}2Syub$UiWe=p<3-uMfmACiMW7RD_
z@bmvKl!~YZ0v>MG*sfotFUGKDEq$+b5VJ^`Tbp((|84-!thD!${<oC)gEauWZJEPk
zZ=?PW|9X97IyYAq$h)}hwX9Fk+K0T&4GV<BKs$P2@*kI5d@aDr0rS_tuL4E!H^hbZ
z*TcX38@u&)HuM8o{l81qFl&hyq#AcN%Q=7=+}?K$x*%Y*qKZAfs===fXWLF*8OZPh
zivR$2*W09p>H&ZHST!4Uy*pKZpZNDG4%cyQ&TV@G1#ukz--*5aSnmhaG&h@%ICPWH
z>T-%F9KaFxcZ!(vjYM#QaAy%e$^0aV9wKx$Mx_sBbsW%PqTZ8%mRCz{XJV5q63Ev`
zZ?z~eID|Qfv4aOeN30kxTn@w{h+dT;Iq3sdMx>GVIg172O+KQGCCJkubF#7&i;86;
z&S@h-_TCo-o`Oc>B3R@>K17B7FjA|f(XZr0wMcQ<%7he=u(%7^gp<;+p){w}-^J_v
z@h$bso!Wy4?4tNhqk_d$9tOnb>-4rTb~ea77oql`gMp{~M=T;yImHhH!FD+3i_U*N
zQ6mV=9R%E_Ro2$LO<qx<&W+$^;w~56-xIhG2IqS|LhmOkSj}>w;da{b3IcvU+FofI
zv!VB6?3=C~7uWH|OIXtY7$<|Y;Ih!z_VEddRa>ZFw!q8?UN@SG5eY6~2HNcvtlU<l
zjRVD*1PkN!R7G1E&odfP8g7v`BQw2^8CaFcsDD;tO4}ND?-my5%B^~mOIzpq8aqXZ
zW-Avr#Q<$X%?xi)s3fcoUmI8bh*Y4C@7FA$O0*jY`q3h+aK->un+crTBu_P%YGu?g
zlgHb$8Y}L5ZCSbcN=5jdd{79i7H&J`Bo<<u6bOi8Yf%AM(ml!>(ACT1x~{?T{$=ZN
zeMLY;j4ePKM{B&<Lp6eupufGpx1_SPHPJGk0r?4eN7e9Ybc{<UTmabL<#g=(v4yrm
z=}cebtv2%=9$z3QE$_Q{vz<@4Yyj<QFj>Q;eU(CjJwmLrD8{iN#M0$bdn!ppK&m6M
z(aARhE=<P&TNYJ@P;1!N41Xas)3ZaSC3PKJ;tE+10L?l1)?>!HKoK3qj>&41yES$f
z8m@fX0rYw{4(HW#%TjcCo>Nz@feB`Scx3|iMn(mtw~|2=Z4;!ev!RdNv1XxoOpzYk
z`n2<=Sni)ntKeO{?)WFE+Ke0hZR=fPc6FZU^wY@sh-vT%BsNfRqX(Qq*9MPO&z{eY
z{eJHK#sIL4s`!NGWaRzry(|mXKqFkWd@1e&X<-1k*kOS?^Gh}7k?7oGBynkn*>P~Y
zV77R-?$-9^)?yW3ko}&v@BbwViyp)*RJ!E$P?T~g>lelg1#G2-94EvDD(U=SocLht
zn3d_1shAI`fSCOl>)Lwa-qwD;(ZWgK*;hJv<=HpYs8Zjh>&*spo@Rr9tkcf(e}E1k
zIMzcxcoBXyU<czG!v|QDv}7Te(6r|otmJ1t0Xqi)lzqFQ$Fm3{jg;#({LCn@VAeQy
z$%9?ebvXg3u(Myu@{Wq)LoB-q0u5K%u$1)r$h8QqbAH&3(XIKFMlXaSyU?$T9`C-4
zp(sbreZ7>H|DKCAwr6gF<g=q#evNwjSj$Z?$q3dtoa5mSOSdqcJe47)xHWK@o3KO3
z0)+MAgYXOuQOD5+1MWV>6U4}Q#0Id1%;m*7(Z+F(flX*Uu0k+Y;hb9<kh(^F@9v6%
z_SDkX*zKK<>kAXM%XfN}D*r(5c4~87d(tKZT{(ZEZ!}h2UhGt5^)1RT6^9Ku>^2;(
zb$jlg+Ei}lI!IN6F}D?4Gx|}@#nyHiIG}bZK4N&@)qF^f0=*&UbOh~x?Y^XYZA4XL
zaJHbsf!A=2sdKk0-~+9da1Q7ilB$zH4lX=cM96<Z6N7i|BmkI<wB;n7p{=UiC@$PE
z-n0c7-jIHuetTg#hfs!0>D&RyRW3o#^CYDGzM5IJ!KTdBQG43L96NnWdgctdNmW3c
zz8$+Iz5{%iA5Oa|N9aKa)UBtEwd}K%%^N(Ese&*Y%LI>&3EioB1|bInH=c(qC=|m*
zzQ}qtGm5CdHzQV0)%!J|O-==$!3dUktz)!6QpbMBFop`ZGsml&K<~w!N70*E;+&`i
zrkmjSIMMQ&LZX%&d(9Rs-rQl`76K4k<KZ|H2Dk9R%Pmv~GgS<D;+ptIzUR}4I`W{@
z+=31x9b|7u%1R-&mZPfWi1x-wMCH>Sh0QDod3B|&f%{)^a=^7!%_5K(V*k6pV1Ym~
zlQ*rD5udN2#hZT0;u?wf%OUm|T~>W~=PGQYIHPi^wQx%d^^gtRW#L6>LM2sa^_d7q
zOETU@ZL8bZF~$S82TX%ys6)@eUMUr4c#b-%B9rNUo;?~V-T15Cu#>E7$~11NuLd6>
zL{r+aMQitMlr?j-8IfUonjQ#^fvOSD8B|7YjM-Rv6ZOEi?7o#bOd808+o^q+jKp%%
zT|_tr8Xojku|l=@cT5T{@RqLf@8{`N^GktQy9wxcot5_UxHjJ@C$mpLkw$^J+H^N%
z=$^bW`q{b1Qu{M~`TyNNYupZggjU|x?Tf$v$6qZyo$568WA1vo_Vb4<uUkoki2Kaq
z1XggXsmGpe;j`?EWBXm~WA7^v#~w}at;;#Rl>27&pzs*hMiFI4%uhVZavnR|Xxh5l
z4<wgW=LK7E*tZ4Y&gdh;4naserF{Ewae2hBK9(Dp1B{_dHDYl1@XD{79FMkcrxUqT
z7;s_>gtO^J(V=c?3-^L`*n&1REIi~sVq-JEv?k-zcLV<bVH_o(|DiuF41nrOirDWV
zglI}xOOnijIH3~{PGAFPh+-ytu7aPzzYw}mmkR^zroeo!f*bac%*yx@@ELt*<tsGo
z0DjYl{C??i+wcgLTvVc$O0`*!j+EOm+0|dJpUbW2_~}5WJpa9Eg%2utk)Wvz%7D$k
z6CXT){LJ1+c{cxB(f&M>AF#5f3q@!4quDkPqZGW~SM3t~ulfM3Qka??>V1OHzl1El
z=SifvG2di@+0QPPm#c@3df=WN>C}LWGHX|@O7|NA81dhC-eZ%!aV7Vs$9X#}wwnR)
z6TCFP7cgIQg&|P-#J;7AlBuCZpAv*+KY3*d;Rt=;okyz_um!CJ*?E*Z${={m;!|X#
zkoX*W+JWHX-|D6YH<HJm;<V7Do&yweW4rM=Y*-`gx;vlKnud2a+%N#|AWKz={x){~
zpXc7fR^*_y3T>%A8^A8OBY$_^_H{=4IGt#Yfs7ryb!+d4o3m%e>j8u^lx)@i>{|#!
zXR(*Z_2z@s#S5L}i`jXA2{*qu&tokxxKLO%v&I+bM*%eMBrU&B0u`l{%wX^1=7ABa
z@`XPZ!;#O46S4;OeL7P3Y5^n0`J9FrCmWDxMJF*BdwS7MMX41($5yDUqfP(qkMfCB
z(XFAY<^3nOgZczMrWrbA7g6~9&XH)U?SP<^Xa$N_b1>MzOHoD*w9EIb%W}gQH9c_|
zWh;OWxF51Aue%8O^(pLl`PMg#8NE3@5eSUXNu5(WoQ@+{KTb~EDbgmmAlhqbjiPv0
zg$&X^9T`3SunJ!84pJ^G-hUn=^x&`LKm2jA&!{&fscfgc9D>~zG_e98bOk5tUFXl{
z5_bT@qh6ac@bAEQ(J!>xruQMZtYo;0a%SBJ%bxnLxB0AzF#`tz9FjdCZI<E!v{Gr|
z6&cPBuOh{Sx>ukj?xn6`1<FQg^Bq^l6ml9ECxJy$^A;|r1%m+s@Q;%ZM{y^wkvA0R
zCPojnk?M@z3U~CMyfQh7W!O<LISDHouC&h57m5}vZ`7v}W7-~Nyt)!<{7}NpRHFIv
zfc3C;3$rRRRv2-*cwos+9N<FuM>F9}Oi4m`1BY!}B1+s)G_MJnoKz}f+g6&7JpQ1y
zl<jH-_oOGNgBb9}ytb_*6YCnOs8?Glal&FR{7XuhUU)lYI~)z6K;By~+=s){`lM4;
zYJ|!cL+ZdU_>Q})LSn$=SWOH(n5@A3EHXULh&MC(1K6BiNiIDKD5Z%@(NJ!IVk|nu
zk|>VR^Ha!@z*VzSbSmut^}Tg=ERhT`2s&`AL%_6}CSK7~k4YkUOx*Es(+Dr~orIj!
zvElBXg_HaFz3~9`e--;dLg&@9vDO8W_M$p80hbUjyO|dbi6nr_;P3nJ0P;K}*yr<p
zGje+=MQOr^5?rx|TpONC-{-K9f(48ZH24Esz}7JkQu`CweaBPAp-5JeF^B=m4Wc@&
zO~0dHlm=>4;`XM`aY<TFxhS{vQiLI%13>!rm{yvqCC?8FpS?Fga-s`S#83c%L38hg
zv{4u^OhEz0ZAHk7u{c82bcT`yF|>fvW;D_ZV`TQqayv(q4TKRDIKVkz>!HJ>Tw@8~
z0PSo6Gq%Hd#9M16VHPknZUj1Da4~X4e{lSSIZF%pv8R~AN#A+lr@a8J7e_c*6_tXu
zoCDrA2;plsZw>-MM<Tf>3Zzc03im}yGI~Hf@BmLQ#|xrW8wp{i97G7gFc2A~Em1&i
z<0WVX&90*m^~`FOtYQl?9jirPeTz(&ID+ryYE_%lL{k&9XwN<4%3KaZ0gqU)CS*J~
zLXCN3a0JD9ZjACE5f19yOPbCPk3_FoZ$hekL98QWF#h7?5;0PRQhX6i86CJnX?#qW
z2EqGRqrUp!+y6T`z2ReEvL)c@SZnBgPM@%<Q#pLuG29+)mb~$I#$iZlye8K;nFuqP
z{|0bru0biy-;+*9<Dv?<3dh@j<vF7K(@;l&kC&(2?q3#b(x`z*VnpzrLn@`(p+e>L
zok7)f=*$b8lSXG`1}pt@gA*G=?Xp0MbI2QxdZu#KbJmT+A>1M7LIzmZpsu8tdPC92
z^L*%QLPAV-KMatC6(W+I=`oEv+Ck!8c!$U7LcqKcW)=F(X3m?C74AyI1eB0~JDH2@
z*M?f^e&<c7*)*{#Qm{S!m?tnBD@mR@RQUFEkTXSm?uk_AqCJ@{b0%=z>1e^fxk`9>
zF`WVXogLFT&9uo(H$6BXrK6DoQu^x1LVYkDL@A6U-vrawGR0shnR>MD#wj-QO2aa%
z`0BhOn0c;4-*g}n3-}Y@lV~GPCys<5aiior-PCn}lV)YS25Q|}nFN$o1-z2sXP7{w
z_3BU<2})#ZU0&KLkaiizhz)QHMO{~%H^F|NDWQQ{V&(!suI3}w<i2`i?Cl%)>MWg@
zRgx033T2(DPcJ7kJEhDD9d3x4h1-4=7U3wnd3UnAsoW7w3O~xM(d+#>V!qXaM2B-M
zXNYm%!@@k5_D7LqT=0$t9M!lxk6qvkmzd|NX2Au<&OuGHyg0+`q+FM={}Fh<$F#2A
zEAsienl?1*p0!)IGLl-guP#-JUglO)XWy@}*aHZDM14_UjKS&CgK$~wU+X}$R)V<k
zlPG@d`6gGCliY;L6%8W+zAqM6ifv}hcgkhhhD;O5$xKYtkGe%7AuVd)54+%&5e?VF
zYodwaN6oO|niwNRApLM&CA!Pi>P2T1rQ+~MiqRh8r8A=@%G@PX-m0^b^FTjUY$EJ;
zcbVZuk&(<%h8J+3sBHq65Iq3cJ9*SH87L~wNRb^CAvuOh%zYYiC^&E4>&QVOO5kXV
zLl7^Hm6xy<S^_QK=E9qq92MB%sR0N8<vT%APLX~-g^fcjIf|R@dCtI>z(6_5R&;c9
z(Eu^&Bkn*2+^7=rd3S&walS$glA(Ue5FL~59pg}IPbT&Y_=6lm{K6=B_#bAKl%4vj
z6i#RuOussFyW!gSw-P}D!=iQyiG7CjR}W2bA@c>(Lj=|O@T3oeJyyzs&Jk?!i~*dJ
zHA9av!KW?(AjC(>ack}Qq7%ra92*FN*eZjh4s>LeBu!SDJr_O>J$Ueill0qhK?#c*
z)os#76<+=je>i5sqQn?M;YJh*L=#(Xai?(Svd^H{SQb%5rP4q;xG*JyG;Yb14|BP4
zWGvg>-3+4Ll}=gQ7N_a7y3WZn0M&^6xtrSTR_4f7(GGyEnN8{mb-tMge$ODY&NN?o
zKGM?uW-+Q;Os6ejD{$&GjHMj{eLEA#97D@A3O+TDK{oj{qpaw#a3ZmyxmgDVsIL&(
zFOn&MfX@7p*T|+L<URc8e4D>Ia3Y-sRH-cgW;K)PQfFk&YBIGHa$z)|7ffs-vcOz9
zQ~fjvF)rjymO$VR3PQ}G_i0UrlZA=z%bl;HSFFkVI5RHjn?;<@MaVTrSKRX;ljc3d
zyZC%8@w_owZ)x;`c)MnBBXewK)y>{)%4NkdsA2=KFEfFg{yBt?i)eCEdkC8<inQpK
z%;PIO#w|D@3Sn9aAxyRuH7J!i69^@1dlEKel(lWN6}EApqpRV`DwCX%+o4D~M^cAB
z4s)A*R(H*xGn`<@kr4h$$Wi{i{qx0!8$(Do8s;Q^xvID32LBBA=kX~D9O^*qdcZ=s
zYbY8O%2AsWw8k7EXv1n`sxY?Kn*N0fz91RcE|YtUx9yVo4pS?-yjAiIO|utDV-Jnj
z6mZ=&SKg8TLW|@&c0rlxq8Z!^nZos@>)>;M@nCZ7(WD1fGC3I{o-|xwC27KaHAjBs
z?P8+wv@DEAlgQImGdV4RiZejn=yp;7*Ne;m#1TbJp5r9eX-Z9?0JEPrNuhXZC~b%l
z8{kOT?;M`DHM~pC(znn9QMGn}Wi=tJzn#qK_5=-@oXQ)SCrwSqHJWO2+I)7=MB(-j
zlEkemg0r!dH~_f6TOf4bC!*WjPMqnCM$58NqvoPVCjM^u?iHQn8k*)YXjdMIN}IAX
zF2!*GX`M)W9APL7`l^GF%O7C(@`5so&WVFvfOZsy1fK%Lj-$Bv&>)0pAk~{0i{6h0
z(8K>#H{t{CIlJ^AkdAc-aS;^xx3hv7gFPXmN6diA!T^-^7$Nq8c#m1NL}YlN*Fz`p
zk}gsCZ$_}-WMEYmUEgevRF?Z`{mNALc_E@vb%)=BbSqIYxfU8>0IHV>i`%0*QR`WS
z;9Z?b;%qDc)&#=v3WnZzA6d2(x0nwmhgnMNJ#R#F$JJRSO`5<{%)C|}DHCye{+=y@
zI&r+-)gh+8pS47_?d+eVPtj!VwhL=|;YtV+MV$?h<TValRRTw$rA$b@?A65RyXK6F
z6HSNJA4(+tdk9JVj>m=hAx|L%H8F}P%w;OHX#r9_(W>F&)f0y6Eylis1{KLCm=Kc%
z=kQAyNygwUgff=&#p2ZrFh8?s_&-X@E8|C*(d2mv1AHsfWWTp~YQips2@W7;O*GwP
ztt_)u*dntAr53XyhW^fAMoXHKsj<`p6Sor9zX7m7Bg~+`eTO_2gBdVB#}0`*I_85O
zP?<Q6Zg;YQ^oxGqGa118>%Bt?$-7IMF<Y5Wbdv?LT3k<gvaX~i^C1XQWRbQH6TkfU
zBY^o<qR#CiF#m}v0G7e??y<RvEwi_h7OKlaU|?d)&*ea^+_*oMvI8&+eGsowV8p46
z#>q0WP^e>c3clJE2e8Z6Ol-@9$o-k!R@Zg?yJEneFfjVt*^S)o$XBxl=0kc^f;8n=
zDz?h;kSAy4%W=@@R%R4m3j144fehB+kQ^pkF}>krIS3nBNKO`{@j<bNW>`Tg4~S6O
z<yJ6u;mxzgY8{lQ)^k#1G3c{WWh%nzLqeFbW?FMBN^IGInI(87D1S>di6!8672{Qi
zaNAjpq80IYB@uo9$gmBCObHh2wxnZrtt=SDKz?VKxgj~5(IV?+oYl^ahYs5W%=n_n
z=a+gftkV1?8O*ggdF}u4<zukjG8?Ek<3Mnhj4iR7RMRk~9tbDLo-a$}+$Eu<M1J}J
z-|G|jE=5GC%)jw~W(fF|xk|+|gGF>Ej*_DY>~jqGGUaP5Lhxh#Hv3Q+%cY)ZRO75~
zqr5J$qU<VXzLn?ue3Dva_6xViS6I6~;pOa4&fH-AFU@-9#G|bwumVs2RKPCd_XRI@
z1mlU}9203^{v=vOxgzby{FP6a1W?Dqt{Pd1O+#8Pm96dzcu?#<a4q$aS~qMFv0;(|
zTk+9X136-R*iOMMueXC*zHUTAxvNr4VA;Bn!HVh>lem#CUds*LsM;baoFcRZZg5cI
zAg5&b*^@|W!~9{FcMhrAe3Kh4Z3)sV2QlJPC?4W-hHnduainetchrcu$|KK3xr!D0
zK4lwQ6FT(vbNYmSR}zXN$x0fLtvzYQ*ME{_oc56$))E1BRjJipO`f64#rmBd=o;8w
zn!K_kv;TA+0W^`*?(Tha^olqi7K3{)V#U<fC1qO-rF!wFEMctG;Wld+z4RtJrbLj7
zN3JAZS&7(9m?7$9Z?kIEotiuWzwRxtEJP;UjE>f5reWr5bK4Q3E%kC!4ZMbiVfs}1
z5QtXDM}oXdM2ks@uK`O%gRWD;7^8_$6=#EQYwmm$Nl>S>#))jD#)9^q_7T-yV}4J&
zE}&n6pQ}1^|3^VMPHJ8AS47(<K38@Im1XuqlCX}e#K@!9*Y1(+e!Cpxif{yHHOYcf
zN(hS<dw@KB0c{ALIYgen5m6E7`)QVa-{6)hrE3lzIfiDL$L?hkpY}u%`B;9kk9l(l
z93BsV$~k8whPJ9A!cm?xeiP~-8OfepKGAZvoF5F{&?(ZsCg7umZZk}xfU{7gzqlK&
za=+Mq4*us?Ri+%<oU?-+wms;KZ|@;OUIHERULqOyv>gcB7!W2`PNy$qP)6622@$iK
z+CxBDr8}$`Ik%t@;*P}{I)+Rlm2oAM>5&=3e3FW`JH5&F3VD_Ox<m$8QMzpWs9as9
zlBSKWQwjFF{aD7>O?dj_jR4w#+~-<BBC?a=#lI;w#Kl|pSKig4`p5XQWB2al>Ic<p
z#*mV7I*(k^VoQ*;F1De>s2Y>YNy+xY(3DfY!H$!!YX#t(B-u=+%Wp@HN_nZcmJka3
zUnG9cN24@$WTFGr@Z0#r@}%kb=h6mj^i4BydUS1_38gglV3wrNVux=>jb&=nN~p^s
zu{6U&5*Wg~HmekuEQO2&vlVlv0<iJiSvf##_7e?sY0?X^>iph>+vd<sZInj(zJlU=
z_9b}ju0-(U0W2=Z4@dZU<P}^B3zl_oj+)dIJ!)Q-yzMQEAIiz?M?-vHvF*h!5%k!2
z;WzOOWPx)#0AMrnQ*Zt$DV`@Ci7&~qZ6kQivrW<@JC$-$dTM0WbvISt`0*2F-zPh<
z6Ai2T@R?YmNU`UPti->0pR3M>iS)xSbTf((h?w)5KsdSkxs>BNze_%>t)f4K{tsd1
z_gE<Jfq?__Xhmg4b}fLJqh}*m$yVpyUmr31v6*<Si(JR~CmF2YGk@obMUomrOn~(k
zI5J;{uy^w^#7mA~5>uGT_xQ1<OR-2Zs#goe78{{{;?h-hu3!IE$Sd!z&80Ewx4*}2
zyDkVfHFY7_3v#ac!RH{f3P|}qr^V5qCCDJ3cx79Jtq75x&Oyyb6Qr2c)|vg8m<jy;
za}n0>ewo7voT9;h5%KqXlKK7{97px$n87859^9Kj%DjN(`uy?rjecb(?RM&#QF7A#
zP-bl{C?_*r47eMt*=$IwI{VWzgfk16kXKv6U4+&rURK9gd;&6cqi|#I7#H1Myfm7B
zEN@7U*iu$F=WQaM{REu!^n4D!Fx6`{{2PLLUHt>Uq)0CuSf&UQWOLGNA(2qR^5rpS
zr!q#C8PqqGNz5x(lA=9d>kN%lJgcrS%3>bX9)h+vg^`@se(@=~(6EEgQWR)J2Fp4h
zlz8i4&LM)lm)Lc}E<*<-MnuSN(+cq*)C!{z|II88U~B~K>cZ>m+OphgL;q77)@?R!
zl@RQ&cZ-8pT21i~KmlZQ6iC46F)Tv&JMTYg?2Y{m(_{?;hs8}sR9S-EFt!Mlo0S^{
z<fVFU_9GE5o|@>?7Ay2^gVM_sS%PAO;N!X!u|gnUV=^N}-GG1|r39?Sz~J{5)Y*tz
z6V1Fa9wk1UG8=hFXz<|-?m=+I*JQ=nq398Hw!n<fi|whxM$^1uwS;Go6^FPYjN{4-
zxi<k>5{}`FY|z(W(&_LGy+Rd<hlV$d(eSv$!mI=?TbrRJt7`IO_Skj{AyWh5`z=i)
z3P6@Z#^!-R5I)ylFo%jWz&5XpQWPWaO|pmJ!gau*h}JS%b=eqol}GU!xSWpDz|68N
zA$Nj3a0?6hXsj_%GMj)7S6gCM2G9w51bxyK6|$bmPm6`eFd8EV=9qV5@K{x6J3!fK
z#tK<2o>6!6oj9vHURQ5B*eSC*<uDv5<4+&(Cxc~3dETGF&K5xYL<?0XIA@mj`v|5~
zots)#JhhIpKSMIF8Iixk;oD>+N3(~H3Yt2yEYkMR+#jEl$UWsUS#RyQaI;M1LxDUt
z+|jl&{b@AkVZ$nlN8rrS`5oq*rH9g&a+@;f@v$%r7sjPYZv$1anh4P{KFhofpx-pG
zm5(&VjK-h*R}&i{wB8;|wgzcrsXiH&#ss3{j1%a`!^~R|;_I00xROFM#RzWa#hGQ{
zNt$xSYB8mmSt<`p7*=CT8#A>@7U_T@$kUc(WU(sQz9-{%Lrg6_&XV+qJ~plvWSV9d
z+|g9hojx#VzyGR&dR1|9*4FyNY+r8bihMWs^pHb2TInizv1kcAHnRt@x9KulK;Afu
zK}dbAMCQDaQC6c!Rt($Cq0&)V5lDuNL}jM3vD}$qVhb{oL(N!AK$E^06bW!Vw`_@)
zOjr4W!b}Jv1^KAlSqVI|zftLxFy%s98dV<TMLA+UomrSt#L3HnW{fA_<ckijUJO6=
zTPc7GC@Cb~kvh@KZI7%MdIHPwFPIDDhM;q-GQAU}6Aol|lWY`TImLAD$!OXx3Fpx^
zlDyGK<dM5k!X%wNSJ~!T_mEnSBr7%-bwWRQtS<tLSjVqYl~BoiQg&B$aPs^T5f#Xs
z0Nlt673l-t<eUNhj-p##wy)ol3JTP_tt63==162|=Eb!NiA$gSUEUNaB}5vHvV3iV
zY7oy9O}x5W29pSbQaM#pUp1+U2n?c!`3k6ciPEIV-{|y>qxT^-SdeESP}qeXM}axC
z`O+K4uw0AYmW~DexBYCAuh{h$NQ&S_LXim!psvV%l2os4)%$7nUR6QS4Yt_FbBsIU
z$(|>OsJgC4f`Y7;B4&;Qg4s<yB}CtcE}ZdHJPkAEgg-V{t_SeAQrxTMjKM;yFen?x
zbaUsX!b1N#Fh~;uoC=??><|~A7mCZsveiaNx<Mw12Uy@KH7Kcv+jstcz-W+tit2VO
z<3J;^&o{RWRE+hC3N6hDgUfFv`9sP1JF5#t*#Fsm8`~ddwYI$nH9CcHOWG3yqx|6d
zQ{&=i=(Q2DK2Px6tv6nh7Ji*#`;Zl)rKu&Jto;wuD3SK)VFD)(=!IuM91v9zU`)$&
zb42XwgwC~3s(Yp}V=(Xi2p;&+Rm3OH+UExDcbSTpJ5uv}R)LC%q=Oy63w3+QT7^5&
zHMV5fHF;fzNZndR^$KI64fn;92{-4We(4D;C5w}XU2!bbqEYyjQk|=&x7e`{&_0Dt
zCMSS|G#gIWcVN+`lO2?xM~jI&3c2G_MJI06he{a`i7H&HK^(|Ub#_1eQwLRZ{VJaO
zIfk}EY5gkQ-ITE^J6_jTA}@1RfYz1^24HK8BVw3JhkRZFn$|xHqCFPV`;onONld4U
zE~l(v0CpLPnTtZs!&D8dEviWlvjK8pd18Z`@Xd(8MmEJ!B+c-BjNCS=+%@avDJSt7
z-Q_GbRq)iE9&{%}Rl&0zsCl5KQ;(dqs#%LL<wB)1<Cj`4X+|$b8Ko^UYHX*d$@upJ
zBtx&zm<41`rrT*;sDRiqeh=qA2fh*bF>!H|rH&%wwgnqjO^=Op&M`#JCm$Z{@i#8G
zJQ`pgxv_^L=$Xbz8q&6jR~`s|U4JO8Kp4Y%VNzbo5yQ-t`$ngvrtat8K7z<DM16g~
z(4SA~Zq+S)KsGK}8sE!qnbB$kLV+xkHpL%5Gjz?+pj0_Vqhi^@;Kp^;o405k8DQ=7
zm!yzi3!q??_we|ROS=Z6{ygeoeV5NxoiVk*{_#jDF_P)DNG_{^S`DRPe-7!nK>Im2
zra<EfWmq&Fic*d<fRd&<?&J;k%`^WDTxjPJjY~tfWec@*v9e^2LBQuhh^@_SH~Ix@
zZwLKs<p-jHrPyyN=ypUJk1}p0TWCiN(BWNZz|)(#+(e3=q)b3FMwr-s>hij;cYw9s
z7lLKSct9{aiVBKeaNgIjkNKd4?AnJI*@h50lY;cJXSkX4FrdMWNau|GHLpzgh|v6R
zd3f@#CMSMID)WoN)z`q23R+uJbH3!CNFMlWYf`E8BU7od2Q&Vt=lxjz4*;h?Sij8r
zw~m_Z$^Vf^=f!h@jnDs8F0ZUq;_F|ntW;KS^MBpMbCDET$sAT$nGJ}eNnnupME8eu
z+ILza7(~KS3=r#>6T??W@SO|Q83@Jc-WaofH(#x9Z*JB0R1q0ib515NYO5@VIFd~m
z2t~RLQRPeQdUBX?YlZS*;zcF-qMCfMlzg##_@y2&WA=a7IYAi!r6?b5oUUvCFIAS7
zQv1JryZ>+GL5EXZXen&rLX#vxKB^Q#asVhm8O}SHObzxGUUGyECWTUQ+@-AnMX)-+
z7+Ftb@X8Dn61zKl`^e+IhCM4VvGzOhKJ_<xX&j0}YH>qlbw_0u$CW~@DkiuqnG870
zouX6I;?bfgysYiRJc2?|2IB=m6eUPhVei!%yX<e_nlG4;hGT=l+&uDZMm?Wu?%SOo
z3X4qdIPhhHM0`h|6nvTrK6d2W4^m_D9g4tvAdj=HCRw*(2&q`g3P(k`<k6#cAwut8
z3O1FPIt3F8DIGKqmacL@RBbsr0x-${s)tY5woP{1$4;pAWhe#8WCRhcFY4OqyJ5T^
zWL#>1q`|R%rOpakN&76yOfR3}Jh>KJJr-QO@8@J|N^bSC*nWGs-)Y&S6ZCp8Saj%1
z)!>-Le*PF$A(T07aLhribV<|7clzDkIQpdOSUMzx#GEZn;uD9ArB;H{8Di(BwD48i
zd6CtI1#|P8vI<YOu^sp&+$9Ppvleog4@RYYB)q}Fr#w&36Y&8VC52`W)U;&i%;dg`
z-4}i0uTAs`A`h=~kWG^tF(JyjL01kOdLpfP+#?p-dLP>}iD}vbvHK@<)F}A@-TRPl
z(wrGnjvj&W%0whrkGfKT&jx0>5hb{pLaDa5Cq}*|&w9`?KO=nNPEYo=qtfSL$9UnL
z6=atgvOBCwUcu~g2rSAQBQNytaNJIO^`&w=w~zgd;s1_Yzj+#ZL$`^SE|*9JJxTss
ztEBk9rM2=c|92D51o>~0gcrvVTfkGUM+phf3Ok$?Tp(8ntXxzGe4KL+OC{75AiD3(
zFC51IN@$W3fgP=hJVS3^dY^V_^)lj3Abm{$?g~WCi_zQh`X9OxYzBkN<$<3h|CKA%
z#Qra@E>~{%|4lsCrT<BW>qa9Oj?qn6A6YNdwR0&Xp@`%kyhV;El{d>bz-dwpV;Rv%
zUlFPpxoB#1A|n%-n7bJlhRS>F)aC3-WSj$hD*3zx$h{BbyCC#Aw;cy@HX)Tf&Ndjj
z6vr0x(xbzqjM0nn&XL7OVGS=Y`v@^dC8WXYN+%41QySNai}!;h&0$3fWZ;Oddx~+X
z=<b}QS73o1<&%d=U)Y^kPsNkrfJZ*UfYQY}Y;njECgxa=xOL29MPA9I=hD#}D2bml
z!b>J-N3F-AR^ll#@HrHC`Q`!8ee6D5li9oMavXV<uRc~jA)qwhv$J*`Z5R^iYEG&X
zi+m9B;~Ng`Wo#1QEv3+m9|1Y9<wU~)vHKtje2B||*~NQ##qZ=*oWm@67>)-jRi`R7
z2SBh&+F<>6bb_bBiWoKltdoj-s3hPT`&gY3=rEt3olXa*6YCS6LmPG(a2QuF^W}J`
z{tQs<<Bj(u@KZtOW1^s880>BMYf@0(KG*tW@PBAeG`zy=-;3P;t}Nf)|K7-xzy81g
zg`>f+iFSo&P2g3c#jw-5NFS5r|K;*Zg8#2p%eV6XjXZm`&3XgY;PF5GJ);8fg8xum
zSy`0-|ED|ry5$X{zx?5!{<e*L^ndzal>W!gKm7~L{88$={r~hI{^=jT`lo+%f^KPm
zR)T;^fBEXaeD(kP7hnC&-yA#9@mIh3Enw7F|M-u@1pEw)JMdWl@DI>CA3Fd1FaHsX
zWqtYEzri|R-T6mi%Q6c5tA9mb{xtI1C-~b}|LT7he<AT#R{h$p`_Di8FaJ;f-@X6C
z|MPEd9_(MtlfVCAb;CvHGIGCqChh;qYQp}bvQ}BUz5l(D2Ul4*JrBgofI?8V^=)gf
zheTgIqpx?UU@K^0vC<zfOwzZ1K;HaYKoRlp;kO6k8GPn)>S8HCqd$xtDE|EeC=a!6
z*~~BN$>0BS4Jj+;<@%Vk|5sD?U*+=B?f$=!=dLvTP@W*{1w}3!9E5oB&K-{RRl?A8
z=!YDLGdH^92ScxWhLI=O9D(w(MdF9r`kjvB_5<Jh*@ex2XW(@xG{wUYPWUh!`BJ$E
zukVm@Xmx4r@g3z3T)xwyNFyq1=N;&dGXhJ0cYHz3-M@babyzKmL|0k8Bb~8J*zqt3
zOT**Pg#q_4Y{{JnHGPlEW%!+bUBX|>{QGK|Mfp2-fV)LAFsam|Np@N~^dov&BLjQ~
zRh^3uq0t^x=lfCIKRvfZN;Ry;m;7V~4G`eJy3v{6W|zsxZ3Fm9*85W6mqM2`qf~<e
z4u>vsMX1NbHm_;@^Y?$>^S!>)yMg^*Sxw&m-R}RJdhUwXyw2k&Kqdj0c9*BN@aLZL
z?PERp`yUPVhy%E^ATVkFm)Dk)_y3jh((V4gi6_qgCz*Ad={Mi*$<LpA?6=S5pUL_^
zsX4i*^6#sO`@gzcUQ7Fb-0uGyd6fQd&DQ@te*Ab*{y$s)_uqf@|9ETZ|Nis;`5#c<
zxBAsr{~F|hCuNJU|LsS767MV36@LG({;q#UYPrQl7|T8Q|KGxY^yz;z=EpyO^<R;1
zxEor1RagJ=b+Z4Zoc_y?<@=0w)+*_Cs@2SP$}6kc@74U0?<;xlA7#H^&3nI={eHRn
zxBm>!$A6i4|G1K~4msm5XO9yErR?`P<F8b*;Z~_EW%v6i2R@Io#}6&#z%y^Xa^U$m
zdtT+ok8|Lh)6S!uby>@Se<f%9kFwXLQqEbgJa|^K$6wL-oPqyK)inM;&VlDz&ih9>
zaI5CbcQvPcB?q1>IrFOIz-KiFK6&t5$-%?r)qJ=;M!JzjmzFc=QdJSM&;8_||EPQ@
z!QtO`2A4Sd@gYEu<Nuda^8fP6?fu`4JnH;k`Y&JoJzduQ>)-sQTlvjbA1c4;R^dnW
zpFcm2-agm&<nMo#k?6wL{`#4)|0~s$|0n+McK_eRqxS#ufBEXSbl3imziG98Q!W3d
z-Tuu|`M0fB>$lZ%`ETH7>&}WM*uQPJ+rM3c_wcj*_ppG=E30dd9)In8UHOgU{H9X=
zy7hJSw~pid7Ffow+g~sJ4gBu>4Jz9I;UA?Dz`*S^EC2d8Fb2GT|N5)neDz!S?an`_
zn|}CSMhy5J{QqBk^%WeVfAg2$!2hAt*UoRhZvFP__HX}(|M0*1`m4YD&tLst{)789
z6#M6|{*HaJ{^1oSq!(|4u-EzOAGKB=aQy%J_kZ~BzjmDe{O7OW-`H5H|MlO<v0$Tr
z_?N%^>OcQ){^qOy?tk)kUw!p=oG#%ncVZQm9>K7_`a6W;|NVde9YOPdyK+iD|C|5e
z|42XQPyXNZ^Z)a=4{&^HoMaF2FYc^rc>X8s@@wZWUw_^D%WuAJ|K+z|{|$oSzy8bD
zfB6mk;Q%<>RK}`v(Qp6qAC$2LrY{jNoc}3L1E7jP2FN0u0lEO{fBwgR_}NT(VrjPb
z_y?Q?;K5(+;8YL|{?Y-g`pbU>NcEThIpWlR{J(vLDD)qTU;nn#>HNq4_1C|3UDv`d
z1jX&Sa}!Sn{crbxCc5G0jsH?D-`fA(#4~37`L8SJWA^o5E3Z~>*Z(G-iR)jkQbq#I
zvT{)`unGKMb$Kau|Fc?IyXF6G;<+m}j@|YN$5?eDuPvkn1^G{5I10J=qU{Wvme=!!
z9>zyho?(T>MTsb!B+tcPJeev15vFkG4uyCtY)}*);fNKAG7<@iX9X2dlD;?PTPU@H
zZV$4qeCb7EG*A^}+)G&jb5}$2!AWK<G_61s*PY2q?1CxNg6oQP8FEtGUBSwZAX|@k
zzv9#Ty*i9C40<kQaQZ}r&d;-(K`RfLK$l?MckH=SCV*}bHjTR(^2%bRY<Y@se_XNI
z^Zb)0r~BmIM*}+_j-8?c7BD^*ZUPh5ov6H`GW9M1*La*zAcRqfshgYbAi&_F8+B39
zu#0^=RFnPz14#Nul=Dz_gv+gFdIF!DDx{}O7-m79Qoo_?fkM04AT(xt=%pKbGY(qY
zfx-KZJEW)z7G&b+C36Cj0o2Ip_0BN#|7gHT+O7#%E4j$(2d99rarDZ=ST1Fw?4C=0
z%@k=91GI+j2QL^!Feh9%K;Voe4Y|&kRW(B_%e3c#kI_?IOs$E*EaMw&>fKOI?Y?n~
zy3^Cc$FS^(?}>5nD1KEjAt#>y)k>-F_-Cc47Ys{%?}+V#W?}^<oc~LewWR;|68yY9
z|8L^COF3g@zG7Hs5qbUI2zILr+g|AP#uFck?riQn;Uu$YGRoAHW4$8&bY#w4c6~;i
z0(JpYBF}fdkBX!qR$-ciVdVC@f+CGMP$h~+E~V5YbJT@J4l7LYZOONHdUhkfB>Jr@
zo<vWEytXN*u%1ph@+0jWEn`@tD|Vz0g-Fbw9(!;i_8oNLmM-5wrzmiE2_rngQ8ef|
zLx5{PS|F$ONN4Lf2F41(H3-q28xIVMg$pey?x!;%1`IcySp+d3x;+YZ2DIw#>eA9<
zgj0gMs+6Z<ub>#mrC_taCMtO_M?|b{iBbpXFy3Y$esFQ#jMxfUhn>aEpp@P36O1jT
z50s`e9EM&?oh#&jet39C#xI7&!uVrotriCT^YrUs0KLwsK0+wwM#ntSX5Sg8d0-|V
z+5u?Ntmcu5O(wn<%Sf~`LzC%F$m!WVdjjP@I6e50<Q;xM&k9P;&~8i3<i)yFN4t2h
zJ3rE$b7oN<LBVz=R>!huV^`3X6abJe4FEz#8W8=)vBlMp@KtP7Vd$I*dtI#Y@fnOC
z=#Z!8sL{im`he}3wP7nI8!$_uI-W;1cR^SyW6G<^!%myyj^@42Lc9%lH?9Q^@St0u
z9#tC_s9$&=lN-`-IdYRAH2|Iw*MdRsebhU{G>&P77rq!ox)Aj^qbv!Z`{cWQ@R_Xt
zSt%(`2aL%vEANNTc>b?asigdWmMZ1tTmJ7Rp1Y#aqc}KfbrpkV)Iv`0C;-XxxG#p`
z8Rth415bV=+_2Od81;pNDZ_yeywxxW&t}sWLD!0xQG|$^*Ln-oN&)*qJp)^ojObIv
zm^$>0C?Lg%<eG~Y)kIawmsLgWQ;NVa8mdVgV<gwM)E5j-rR*7{BzBbpMuqEmzo(_%
z>LI23shVTvQ-kLXCpk#kcq(|7asc6W7Xar(I-sT<x(Cm(vY5<xCB~<RwW5bbN${w-
z^Sr{9a%SmFrG^^!O{mbsy?e33(Crl{+yD*l>XxR{yIlo?tQcEH3Pguifbp6!bt>ko
z<CI+lU#ETI2d5yD9Jw+;SBi^>r<KXfL=@wHq2%08R)A5Xgn|)Ll+dc6Tj?Yg7v7Q|
z9EYf)xP44y5QHA4PC~n58g<+8?+^7nyrCL15Vc`2NYW>V!-hSiq~nzH%~7$*n1UFj
zf(pH!Y^vod-52HZ3n=<Dj2=2yVNqpBGgA0*dMm<k>dySxaa$u4>0Eb!6h*(6@vyKH
zYk_%7*tNTEhzUk3<{i#NCE#M9QRp&)oSA$KN{d&wsIueTkTjn*^f-hy!3NI@-#wM&
zZBf=a;Dk(0c;xbWqL?&tG0hF^m{a#YfP&!RQ5L0B=S+dMEH<|4we5YeyMEB9F#>52
zDCM!4JE1veCi?)}l2D(PDFd+OB$^_Ta-9xu_njZa&JX8$)~M#Tr>t-Y<H7+2^5tQA
zszm-4rRgF5d~qg4xJ|+55$Ult*a{02t`27=Rj3yxhbevVr8VQRg`kk~xOc6!=;3~C
zxfsG3W1`!-AvFO4KV}iTE`|HH8dthGmH12zex;B&Cs)RulPlIaIn^@EPdFG?7VKjw
zv-A=#pu{{l*cZkvBF?(wb&xEy+%|eQ^KL=DVZ}a)F3+_s#kjVWT&`^;$+Zph*|w#r
z*tR9;?t0m_m5VcNE7LJ;OGR;a75@Ji{$Hs|PH5%2IJl)*IJnhW3O}BSH>}Q7I-Bp*
z(5+7bW;R=SJ}VtvnuV=gou%;OnHbjUOr@{jK6#1Q+g1AaF|)c={xS7UGsPK|15t+x
zvLZ6^V=_au-XHHfUYk@@k(kq^50k<EVV-m5piNzVCgXMT5j6})Cd#E!c-^rI(A9)>
zngEaUnrGVyPJL9XM-+zkgWEf^j}Md1l1I-}3$|tjDHdQx1s1%5>sZ0%sYsnB<*o=Y
z;;Kwq%e5o)zqjUIs+=dXL0ZbcIcgwN`xm*2#5KK+D47g-v%~y?a8HjyS5B4VJjb!u
zc6y80^3RzDq4#u(a7Jf8P`Ik_4~PVU3r11MYC3BvWwLPt7GXNKRMT0UpDCz|O+|U|
zd7s=l*1DLXXXTK{XX!X$qXdZsLM#|%0wnJ&<zlz$-Y@i-tp8nA`d<*KONfhCtp6=9
zm#ZoLZ@GG_|Gkk%>wi&UVkk{Q35-$3P55(Q!2xM3DVMS!^t`?|EXI^BQuZB&cu79A
z$c#rBn3=i1a^3KXRyKSt!^81n16syq8x&5K8!CBngOw<obf!0{<Nc)=Jn|&ADEGTT
z;}1^HgCU+lyX_%xRU{;n^5s~mt>9HPZEFW(x3Z$EOHn4Ks?m~cw5pU$wlUswWOL-;
zxgJk}(#A=xTXz)Vwv1_=qAy7gx)M`^u1wZ;-W5b<PF<y#VT~yX7?is}WtN#IBLEdT
z?g3A+sUW+chCSj5@%A&TNi@r|wk0yflyyPprj{+3eD=I{GMhawJ(~eRJE%yK1B2Qs
zc%o<oFcaAjWvU0nA>}ts1;7o6zp82)nAy7GYT0_7Py(;SbijYrs@Rn=n%I@kr-<d_
zk!@>96yky7oe63&Gq*h=3lDa8XZxkSrFCl(x8;b`l}ys=nKP|%e8PAy6HLz&s#53z
zrP8qn81{Y3r~lfXiTr=%QOWbW!DTW)P4fS#t|sF@mDg5o<3HZWqj-G9{o+~^j}%?T
z#b*$DeJ4Cq{D!<w$ziywBE!5wo&D%p0KD~-cBQi43b2m8C?DGIs`L)kX{2pz_d8fw
zY8hdc@IrCQ@|b!LuR<!sIXz{`L#?rd!zu_TwnC-y+Tls-hN34>?I)SU6Ju<5MszN`
z-g#5oB-7}S&oc#&IXz>^YKAV_Cqh%P&(-YD5}JLsm_3(c<)P|^sqe#S%UA94cae)j
z!va2%QShO2m~MO=IV;M6N(ZX`9*uxuaak26&3Vmuq;0KeopaUQN>;gQx?EL`DdO~m
zA=z<9fgU5XaySS)3T5}CLX`bz7CmJ)sX#(AdT=fiyY8AqJ}i8l7_i2_02~bjv!$A`
z9aVBWs^)i8k&@5Em4)VVk>CLZJbGGrkf?(ljj05<9X%}<9~2e3H~Cei$gr1xmd|My
zT5ZBC4sW@Xt9vG&|JAewZ>f5f{y)prN;3b;(#p!p?fHKb55|9|)wLV}=uo;_UA%KQ
zt^y=kj@2jRD?kS|eL)=n$QVPEBBlHsCYwd49~8I$H1bf!BhjxYC7hOv!YR}pDzBGF
z74Upp*+;4Yc9jW8@4=&pWHLu7*<Q?Bi2sYHx@`Bnnaom+fx{4QlulqwBObBLT<HhU
z5~ZZkL&u6#G;}%BBf-E!8`_W)N}{)ratTs)G8Z>yy|j9>W=v`opT;NpQ1o1QP4=wH
zZwlT5w{z@v3h`UqCR;Xo9RdHvZ*1q_&G%v@c~dv_g&01Qbg9ptT50w&4_x)II#J&3
z-o>$X0ymO=Txf5s>{cwDYdq<?eK*Pf8hrp9%46Ilri0m@z)@}NY`>_#6ph;cR1O$=
zAm-Awj4kt3Cc1u*nz(;PetP9Yfp?hNN%+_a$!g1qD_`!G)#g2Q&RF+ktTM5qU^E<z
zDC@G@7Jt+;(7P`R+Z;N+1UpZZO2%tTB|$ZnW-*4fs(pHJ&Q`V1Lvz@Rnvyk6kbr_+
zM-QZQ>Uu}Vz>It{AUl6r7SH|wl(B<)NDwge>b^Em;ce0jB9|^d)b5x~A3phhpgc|`
zZVhM1Y`8U$BxYKR+;TAUbwFlfc%2iN<u;n;n8r^nn*=R73`plDZT1JNgk+GANb5&W
zQ9zO1E@o=Lez{1rSgvFi9z|}64vdmIFbuXGj={CiEy=@{WE!PCzZT2`YFe2N^Nz{$
zJ_q$aH#77rd?w%jFPE%6c_A&}1plw)mDO@G|6^tO*8l%Tp1b0Ox|ENG7$i|Lmv=?o
zmnqF%N=x4Hx?L9?<k=<~KFHfZV$jJ{3aS4#`Sz<E<&?8sy4Rx|5lL|Y_)B2!rT;qy
z6vB+^A;lXZ#SA*6gh3S9O<fCD|G6v#YCc{0tna)a_(?8G+ilIl_gQz$R^BPa;>p9=
z6?n5(uv1a_L4mBlN5qoc$KVDqGQ2KzdQl*bMo#GXL)Yasvl^pY-udbRIpeq?MmRu`
zkB@cIM@c6^zUp0^G+s3v+sJbK#PiRrlx-XtAp$xD-KI>i1!p|ES|1^@GtXpO#U?Ac
zv``&3zL>_E?gi<uaQd!U<G{D9GoWePf=(TNcTf~3m9ZcArJvm}kTy3W0-?g|deG`_
zeUpUf7IK=XW)INmTe5S2NXQY55FSM(AfI{>8kf@LB{uGM7Fl^M>ox(r;mG%K$vzD{
zt-Zc0b{mG1pkc8x-)FTqj!ljRh6^2glq;$zE3<bND*H&G8^$NLhzNP=_(SVb*qXF#
z1E-E%P}}S>aEf~bBlgfoSyNub<LJmV79}&JE6y+o8Tr^^_M7)oM@)R<AQGj4n8PU_
zO7QQDLW}=ovLz8bq7J(O3RJ|hvZ2KjQjwIzwlHZk$wGmrX0yVc&wm1CipXNb2=drM
z4HLtuR-`vB8d`C}c~WGPI7M;fv2Fb2_4<#c3fD(E%ag|4u(x~Actw@I=LQHy&tf}P
z)@$SH^j(Z^8%b9pU&dchWQi(6%~5nLF&h;CloW>ASSKER`(af>p(xi!!%|@?$Ays*
zmq@TU3WJf~F_YlKBJcs5uv2ybOtePEPC{*BIS9rH4839jw}>cnYKtZrgTly9!(hPe
zyzqSX$%V2fD!2k2UOe~6b>+T1qhUI7VHpeQHE)|m7OnkJpPHfIw(1SqaaYUw4ad(S
za~8^pIE8`MR8FFEiG~j;sLtGzCm^wyjSfwr^AzpC{jG)(-q=z{;<5F`n3MHj_CxpM
zaGGJOvL$0-W=*20zmJ(tqQ5e?0<vHv3j3U_&K@U{UA{mhmL(r9MKd}AuSoP%xDzAz
z*~6Z*p%Wj|C?eaNIDDbec&r-4CII;P9TWXTz7n6#X~7Yo13U>++y}ZFz<$IOm`YJd
zK6VD%Z7mE?7pW=8as-`Y1kH2?y({)Z@94-)?WKUNh2#l@PF+3Th0v1W00{lmEI=sz
zbe=qW=V1uHV|jle^Kky=ea6Y9+B{6^3=>c@r*3>mKcNIG=M7}+-aXwS-T9@Q6=-=&
zu%PZK2*ku_E;dx)JWE_!T#Rc1yRclxQg%;|leFhK3b^-7$LoL$D~GI%%bTZ`(G&U+
z^-Q5Bp$TMEy`Z*4Jw~a)W@&J~j4K3`XHEiTTrt)-0?Ldn1q^Y<_lxLp)bnTYo~$J>
zJ#5fr#7B-VtE?75j@=%dz|liw(mMgmD;eeQ9V+UEkA<$v(OdEb?CKq;Klw~nWyxm<
z`Ld3UK6CO!I*gS=UZFt2ez=CgTOtBLG2-F`=c=W60>pW3jT{lRLvJwT3k`Zn#8EQ^
zi#8QO$r5$Mr+h7<4B(^;imjEN>D0u`6anWKv`u&<ZpeXV++MH9f+ebz2+pi>WNS!l
z46QC{#Khs8hJk-%HG)CwS#iA>pCw5`C?L^9k$98st)}^w&256nNx1(`ED;q;5)c!P
z47n;Xhv1*Hfy@U^MpG#Vrn&S{G``Wip}4@ph)<lj6|djt3)D`b_(Sbo<9+3@xW4!D
z4g6d<7nQ8W^>00v>(uErk7XCQa12O>)-PlNDM@ADewR%^WA1qgO>{Q92cw&y{ETTo
z$DKG6weEW{zLoqT+^`Q^ChNYtY_!^U$s&1CDMO8_;Efx4-7~#ynJLBT*=Ig&w_b4M
zwK<b7!rkcR6L+}0tt{4ocnq@5Kz{;|f)Xw1pb^CQf5N3FcK2MoXI|yV@G2?yOO0PW
zpg~72V@_F=Du>7c%*lqbMCl(8#jv!xR-@Zc%;|lftKDaH1zUEjdBD`h^qDDnD=iR`
z0o>p+qU}ZXGMNs3mS<m1z+6@2+CmIxViF@DiKaCFdun*M=rbGoY;q9PYt-p!6<Kmc
z<ps1w5NvM$0~Ye!PE*|<m8Td7R>b=qyy?La(Or*4;iJeq^2Hn#>7U6TLAT4HB5^qJ
z^H7$tjMcS}AM2CHI7ytu5g9QuUbo{NA#CKh*^z?ZnbN7bN3qGP1|toDC<OwIppx63
z<HF^HlXGg4IrXZC;+v<+(-x<eQ+0aPCq8QEF(}{w=WJNTs!eAHK}ss}Wgrez!W=m{
zeNT{Q13>^lo-&D-sjY?oDvyV`6c#^=MbRj1j`{-;IX=MTXI6q?kniY(6Bki<V;#)+
z(!0a<!yqh!&YJ`0tQR<)racI$VK&6#bKmzQpUL)rt0l`vEGh-QGANn)GH_D-@8wGJ
z{%?6@`8NN@jXdgf=iDFmN~88no9<sK;m1tg02Mp8!IgLe*v<gTDpC0Y$Zqf|0zJ%F
z$F2&g5a4^Y_065_t#?VId$P51<h76{%t1G5(v6lbHYXe8=}J3w)yYe2;~XzlV)X7k
zC$bZg0YTH}vRLNBh3u+h-d>KMF?{CiQiE5Y)rWYu@o{l~m1JKaS>qjoc!dB^v&19e
z71pu`kpdZ2Io421zHdpZyyW|~SegmS>G{ymj_oOpE!X05)k)>rTy7}|qSpso`}I=o
z$J$2B#Wv`2MSWEhWrIugLd{Gyqknr)J0Pr>W?It~ZckMh=O}?Hsv-sm3kbCLSp{Rw
z9auR+<}ve5?iY<H%NN@;S#6^3ZpzjkacelI_2)Z#`}TBk3zmpeZ}o!q38}@$uQQRP
zj=J$+|5vEilvgjz>{bpXY&x{bv4hwP{l|~ErN#5DosA!0q>X*}^L0a<2<eqOwa<Np
z$B$kZG>%B^nQ>|kIb>kED6AYeptTvXJ^kbQ<|Yj50Wets96aVeDa24ZYFdZ!*Gj3K
z^K%Xh0rOos<bUJLBYwmw$POhMU{7r{$@~KOvYUD)+kZVOjRwHvyQO|~E%smKrPZ~h
z|3|gFb{qfYMjp=pA`W&p*Y|6p??#aWq8wW=w9cfH1sg?CNGMVi=}alk2sotBLlXA^
zeKMq7Fxo=-=;iP9(9Pc5>&GmH<i)u$s(`u!X;M*HP|?(m(AXZG*YSG3x*)^V=twfi
zb+p`e&_|Pe_f$ufxhs|y#I}CHfrG=LHw=8VE~798cg6C8u(Cq2Jqg(ptSqoW0agn<
zf5=yxs7B&TO;afmg_VWk^~U<HGOmKw;E^^7NjQ5$Wgx>bjOmb|9+H6fh7q^Kx}lM@
z^q|@;gyP621sD7dJS%S4&TW>y+bn&zS^9o~S^CuKQFvuT<4m05to6&-sPX6^IH+kN
zgk+}*v`FHwA~|3-6s*;l0t$Jwb6TXlg7bf}{*Uti!Hy{nofG#$X@Doi|5#c}>i?E1
z<?1c}cN5QD;InXbg<4$>{r8Jz92EKNJ3nD!n={LsnT9_86wLcl$^BBD@-&(@M3Za_
zBX^lq1I|yT45Yh2G_5tE^jEY=q&_fJO<7`fVu`geCBBH$b~*F3l|jGPr1!NV&*`A;
zd8cl&(CRdW)~+neZZz>E9rLj=?qfCc494K-@c-(#vv@}5!OX)LjVxK&l=r22!2>-1
z^uBd9Og$6Ne`T<Ei9Ya<Ut3$rJOA-X#{XKu_`fSxHp?;3ul)R<di`yK)fxMk!2gxk
zs;T%dmGbTV?~Od@bmnwaXcxbOcHf?l?)4mzt4HoEr>KG(MoMMJ4){gU^?HCPq(>NG
zxM*eb#LBDou@gFNB*=?m(?xqBHo<Z}1Re;TBeWAywi-Ge%(07sVoqJM2{U~mi^ix*
zRzPH7Ed9rDc;cr~#Km!#MH#j<a#8uF-r8Ynt)@tUCOd(m{lz<Xx=O`{FzLXYOLDO6
z#Npn#!(K@h+aClkah#5<AnzZ@@~NG6A#gu>z>t0??uy#Z3+qs`$}h$$BrRc$v2n^E
zcE-bP;{Mls|HX0a0`z|sM8aG8e*@3->#wt?&)mlZ`d?XHP2K;jEZ^S$+{iPvr#wf^
z%u4r+2EC_2*by;X+!@VW=TswXnrqZ-)UTZi`x9oswu9QY(Ya6g_F6R7ZRfc<P4D$%
zoT6X|Vh+0&-+ylcD4}dM>J4pjkE8h};myGAfLXp)*sQ#FGA__`K43#dbuzWwUU2&4
zkNzC@r{oy?_paCuhVB!Q*LvSM(}A}$y1-HMI(7oQxp$62*Hv!ZXdit_86*W9-!fwP
zP};~-Dg(X{WD_zR<KkG!K3`^}|64Mn?W%o+tH>jrV-%8WH^ze_f8DsDi>{mzTa6jL
z3I`4-J?u$;_SjwDwFs}%)Bm{MZ<anL#eXbUS5xsH%avRDe-jVJd4Wyn^b{w~?sKIQ
zr}7^87_E$h@{;i-qXTQMJPgXh3Z!|&js+nVTP8G2w(o-&o(){-YG#v3b!N<c!UE^1
zQ$rEiOwWKhYLq+!q+3=x*;f`XU7(5&v0@=rIM-nppOjur4<S}`O!z;w`<Vbc6hB3#
z7?{po<gN@HK@RTbI#0J^1cj-iC(bL{yC;F^ADz>`O^WTp<Z>bHw{41;%m)i*>RE0D
z867DjJiP$&rnkd^Q^bku4k8m}=02L`-A6HSx4!*yah!Ko4AkV`Ou?{c2uu0o3GgOI
zAO?1_+{|OyNKC-G+{vfvEXAtm-(o-_d<53(T%h#$8iOn%fbcF}*#^e)d*H)0jYXw-
zXE}VkLxM?80r*_vv#2C(3^=3;l=)U=95l7iI5MBpQx4fU_mZ0XoDGS|b+eP`RLa>k
zW#FGYjQBSJx@%!VkI^tFQD!UJQ&`G4!BHvNW@SE`D@9S^->OAmQ5M-JCcw2A9;@ss
z^=`6NU~*3)(v(Q!9;B@lf83?-#_&frVeU{CHOuRDA{EXc6K|CVE|vp8=#r^e54?^#
zydRXs9Fm8bu^-4A%@|x#+dsuUuv+oY-1^*4-&PJ2<t7FUnQJ8+ykJF5<lVjtjp$$m
zP?*}YjZH5aKq?tON(Vl~p(=isR}QAgK{w;z8^7!0TwhlQi~0%COWv_`M}QK2H##0i
z&z^I<Eg5dL*ORXCMGLinN+Oi)Yr9eCPIJTfxw(?t=cb;?_8-e7%dfOVa?gwczy$t(
zZ5ep}1pkk(Zu$Qkc)sYEinF_YUDz^2s+s%_5O=>x@ph$0C<ZAq$|ju(7s`!2f@7?s
z@)J!N1@K)r`;fLUnKN2IrUGH4I<`d&+gn!ZdFJfGdUkk%fz;Csy3PJsQ~ADp@?sex
z<!gC9=Q&+iKH=!OY&<UPCb0KWKXJ&z%hnmUE)ROU$HUkx;tlC}#Fr3*7&MU$YXY-@
z!H!`<VmR!@(q4uxYQiW8j&$m&mhnHQH#m08$Y*mqpDqNODR1##z-%ZEtV+M8xve>i
z_Xd!|H01;rq1qfw5dCRzTJX1p0lJ!UY$2<BlZU`DK9Hx!ff8Y*cM@LoGNG4=c+j7j
z!bH$Lnj<6LJ3W*&D6Rsgawx)H1|A9nK5$r)5R(*{Sd@5or(yu9cAPMbnY%N>^7`VY
zY;rP3@~4*F&`OI>PS90gk|FfT;$9Zwm=>^9SW~63mXmZlPpoJPPv@YeLV~?DiLT#g
z(t<b_Yw(kiCcU{b^M6|%@t$v%X-ApPB`L`4ELO!DL9&h{lJ1|-xNk1m-(0deJHnKT
z+J3B~g<F_$Cbhrp%f}%tsd(3uA)H3x2N`+}p>DP72SZnd5kVVh*X=~oWub$H=rV-t
zAQ+5#j<$~a5a1s@8I6(BQd(_ta~zY7BTudGyx4nN<SSx~lST3rHiUsW)F26u8@2t~
zj|MeOqq-7?!t}-7=5rSGVneYd6Kfr^Lw6vujjy1DRBISr+=47?f^0(5r@xkDzEH8h
zzZJs~jK$DI(y(N-2jhvQg>-YOwmk$LI#VG6FBixv<a|rRk$YEF%8;#ANWY&7&6|b4
zcsP#V3}eJ9HOP+F!K(}$Vp4*_XWYK3Ot-I$^Qfu#EWN8@f!kz`7ak(BKQW4nxEWVC
z0n(s+S-?ynNuGd=Bw`t5Rmdxk6}r3;to>Cq5rGpe#f?_yIT0GFBt{W1ZjJiO{o3AZ
zJ`o7e^92k-M-i<|Uq!qox<8~VkitT&hukZl%#bDZ82oc1Hv^)SW3?wlE}{J+F@v!`
zH%m)aLvgH#fPPq*Wv%jw%15hKdj3=~v1jaN0dj<g9$zJSDj8U1297el+TFaia|<bZ
zQA|vO)9VBjpjaP^Vm<;wgzL3g+lo{~SK07_O_$8J+pIl5plmXw^^N`dn_8*%<8FPg
zCd!%QL0SF~kfD9F-jPwDdYVx%dx#<vNbQg!I}cC;b7;5De7_A#G9MQ6c(_yWG^Wka
zzoPACGI>F^vcVZk)nwxSa$s%B-ZYMAEM1gnEM*f7Rn0z<U^<-qnsQ`Cvn^UBbI~l!
z!I*fAD!7t7e>&zh)mQddh(T9K>yw<xG-Q6<PEP2_a`{M*i^hJ(8~)EFli%bsS^ra3
z{y)m>|BC&8D&?iM)ctRH?Kc14jXWm0AJPKy1XAn#%XR{~^&Y;6_wd+=_7(kNqFQ8f
z_~^q~f}`tfdT?fKY#lU!UllLb>svc-;1@W&&<#k1MF&!E-TBTK{rskbFRN(nvWYin
z8+T}r=T{JkIUWSLdcjc2@mjxxpvQ3l{e-RQ5ccP2Fp&28OWh*gdh&l>PyWB+;Lauz
zSbl_FWbnDM<YNA{di~#x0X)Gm*_mOH8sN@k^V$2D-l2Dr<PB~kwEPNqEEx+AH4L7G
z^&?+f>FG$5C(<+BB+bP<n;aJoW?j**q@cf5tL>uM(_{|F^t@u4P9G4tYsZ=p72hZk
zwO-8ohJY{V^`$~9%BpR8qNoog8(bz+7^S0iFuhGCkdnP2Nx*P&)Y;At=kaY!h*W^i
z+R&Qb$Gm-!e>$T`QMbGFc9(uZyHpUqj#)vKl0LpoF9844Hk}sg62y5!fh~FDgq<FW
z7(rLO*xB2tr55A*>A>gKzI^^?a{R{%DgJ;fzgY0cuO|EdEv+pj^naD*YWY_GcN34T
z|Kk|o{Qyq1Amsa%j-feiXW+EFo`>mrKi7$PQG+lYFzr-w^pgYqtmJ-K9T!NA`J@?+
z?Tbd@Q*M9cBd^W=k(lbzl=f8_>(JF>6yU|jU9+eZ-!h6k*!@y*!?%@i;-M%f!vdgw
z35hMx-r!{Mnu5q(D0p0Y5H}h<?XUltNdK$l66SI&arO+iL+SQrI|?Sy|J7>B|9@$D
zb@i71-^9c5e_7|$^*+)@<UA=9OAJ{!&VvPDI&v{Ouc$1tS)I<Of>ea^eIn&|F=~h?
z=tc_c%W_v#r>W-kQTcCITUxYhP{|_sB_n&;g%_BV7(@9kX0)un=L~6OVx8o8pwj-%
z=FSt2nv5!O9Sga``JXz{zQY^JWXE`B{tU0@C3sb8Vra@6Qf^On-hwJogei|bpOttE
zaLS@;x9b42jcVcx*=pxSaY&!b)v3<qs${G)LjfrNEc8b?Re54c2F7fSd@(8adhV5Q
z+-QY*o_;+Hl*KXm$C&^GN@YJ9^xO|_Psf45$J|Chvu<?EfNA!ffl-|58!Xkim2r$u
zLGp$}35|B(YWeYDPHi}mGwZ_UNLMG(DmIrpcWg6bJUGS2v!B%py;7Sqwgbg|y^-$Y
z;sILQx`vqDDau(eKsC>K6v7v5uR=9Ii|EYpyym^mg0!2qf<Kt1(1m{?-D3g9U$9_u
z#M3%7c$YUTz13%#6^t`~PP#>F*w;0ydVE62x%Yv?!wZG$TbZke$`oUijEEl1aS#m`
z^k3Na0wHpl@1qYBDi29nU|$cQl)l594%}C|aEYBL6;N`~;!Nyp!@phIi>z&oK$MsZ
zFgwcJw^>Yrwc&y|UDW=&7hD)}G`>DcI3D%v*s*uTeW-Mw-h0HG;P7yqzk0m81X@{a
zr2_MIaEf<@Hg?%Z(nN$B3!iI7rwj3dXkmFPgn#a5vi;|Zig{FGyPPYJ|G896`Ttf|
zmu}_%8+m3><HnpXWyAru+4nxWod!iA_~hG8mqdIjt4oh$<~|CU`Du<`KT8-sDRD-}
z6`@kU1FB>N7f}{ggoe#IrfK>l!iOyOsA{PqB_5)4nPz^O7JhpIzA6$2l#s(KV5BiM
zCFuFnPv@3E#bAjE$?RgKA)_wOA{m-RbvO=|b9Pc(GVqGm&8#nDzpJ`p&dS7W$0#3n
zi#(H-J~`19QTeOC$CiogIss{zS}@-eR$S?W6=rJRIL6}BVBHdjev?sSOFgd-vRT0o
z!akg%OG_&&%gaku*cxkVYt_ms9MA>5%EAO+D#tpE&JV?T>c&+C$Nk`j-5xR!$#F)h
zOI0~N4C!|aQlj#!q^o+ez8pH5E4eb23pN(hG<1XD6LfU0)BmOYmSxDLVK0jL`+idQ
z=8dhL{RVpwWB9%Ot%d|YGO7F*wV0$cyosS%@jeCQxLGc8f#cl4%Tyv>hYW3p?#JQ8
z2sdR@wv^6g&Qoc!-R^toyF>$;OLS2d<-?2#%9?YrhH@sGEEGhxi|t0xA2`x83VYOH
zpu1ieVV3yQgiRnYfK4(uG|_+z(92>8lQbs2aL@crW9;WX8-ESY<oo|6?f6sb1;OCz
z`M=er<>dW;6@Izp|8C;BD_*F(U}^D>%Z@1!>pr{b6V*kZYCO!4yb|LDA9RpM_==c8
zeAYHyYpA5RR_aFz92D^#a~p^R?srtwz^|T*aUqbz3{Wxg0TVQ~!yt<6mcDQsJc`Pu
zM=PpV=m#UC&3}4N?5foX2WrzN^)MjcW6Rs5QZ|uFIIf)Jujl8u@VAwP-&M-MT3|H6
z1{!B^F*PC+aSruA6XU0#FU7<{$a=Atw;V9>VusJ9@3vuR>ikAKhfn9Rm;E#Jv*~#4
zAt@#Zto<{(U6b7$3a?{MyzwD>^jP36dR1@>=VS%%`6D+~FsEmXLrTL9y3*P8%uB_N
zjL&OQ@K8N8E}lv)K$9ch@W5BDJfREA0o#hZxF3o7Chb*~Hc-wl?L<pII0ka5R1$TC
zdN4{03rnTKo#~b@Vb-TDR@4Z{?+Al7BqlU<xITPT+HU4RK0Tma`ZVy-o94lJ4D)CJ
zWh*uzO?!M8frc8i&oN15Q_|isILQqvkVaw|u-bCGldGx-O#e(d-dXFBD<!G;DM?oz
z8oLsKJr;pI5P>Tu@{pHAA(bKB=Go`SL(L<P4)~dl)vCSRF;%*@vP=Wuu6S#^pvy=y
zflzvTS4AjbXpj?yRT&S8qkyi`0}i*~Xm<)#Y9cD)v!@Y(T;eMjizyX?H3oHMtQA{(
z8_t;#9JrX>+Dtn|ozJZ^=#oJ~(i&#mWYn2UqtoTK&=^!izpiw5v+STOXRo51iS{%Y
zH-zz9EOVPo<uiuQxXASrH(;u@E8KQZs%qmssa|aB#fEPg-sK{5UI>jeJ|`70F{*f)
zRK?7Mk10+e>DrZxag1$yD)^VNi`2I1mUCAQnBH>o14`|~CXg7B3O(BJvW7z064AZN
zML#l&K6#-F5-AGj)3!Mc`V=&(71CIwdE{MGN9gr?l5iw{_Ee}H%b|@=F^tM|;kLE1
zZli9;p-#D&J{8Flnn;+@er^%#i+(1{|K(E4iQEet|9>_4{-?aMmdyXOR=t(~Z{)cN
z`+up)jl4d_^>dp*WP&iJ)Gh35O@ody79*+5ddmhnf?7zawl`xciim^!8NEe)GqM%i
zRt$9+!-8v-r=U+n$W;xCHBBdDpu}_(-kps-;{hVDWWL~v;-f9JYAP+O`6vdbBM?wv
zb}nMw{Kz>{Sau!MyceMcxis><KaE@tUvAqrU{_p4#ulLY+CG0n+k=33csB&l^`+^s
z4ojZA!LhEa@V3iRysVR>7@{MFL@&yy_ykh&6Sp-{^5!MR@RBAZJj2MdtGtvk^@;q1
z&gsb{O%zR|ZF|#G$P2}uAcBSfB|P3A!1y0<!gqv7d{KiF5G7Ed@)l9K<x1s@D9gE!
z|C^)LXe>4^+U&yw)dU3v!8u2^8pNtA{JePe8BDoC8`+}4#W`QtEPg^tPU}DzndZ11
z0&fz(<fl9h2mr23fLkAmo(n<|ImNUCkhvmQfp4Z$j07j=d~0X+4WU%UmhEOrsHmHk
z$de4)A!GVm$Vh<eAs~T=4tgVnK)BYJ00M~XVv2li(<({25s%$3<q&8AU^L0Y#=cBV
zZ%~%DIk+1zwK@WCQa74?)%v-QtJ~*_pUL(=YnZ&`1U+?27(1yHojQX~YZiWRQvR>i
zN;3Z2a{1Q&=Vl(o|LM52j;~`)Vtgy){Y7ikJ{b*EWbfV?QbQtoKu;8MP++Y~-O>y~
zukVC1+>N6~lyg~Au|x7));;vXCMSE|(eaQ~><lv05sU^A8)9UFNZ5>u)WE;r^M!R)
zqt*gnTXFSGn9p*uD87_2K2@Aeu~%E)+}YlG7k_IRtKh5n-WI&Kb8A=ut^FXk6voCC
zg+k_cI~9{OQ%Vg9Vb}|fN*E9nPVMUQ*wT6e6p&ga=A5c@spIyXGYQSC8l6_@#62tF
zgk)Kh*DJexJLuybW+a`Ratda^F<nT3k-n?Qa}Hg^5qpY>CH*6cuSU$aK??k{+@zp#
z<<&+Z)&Xf0O#wEO)5^G@8#M`zs<>J|dml;D;|f|HtK~h4HJf1{ZS`qtDN~-8wS5e?
zR^LXO9yGE(RI_eSv>6Wbi#$s*x^f)JbX4Z40x91Wn{Lk?>X5(83t7?36%b(Qt?{eM
zd$Q9$N_dpADH#%-sQ^=>mfLnlksi19O}Hy0x(h;g7$?aHQQyH(dN}3IsE?`f5W847
zZll@_ugOEFCnLc}=AsrERD-4RRu-6Vbu9)1075F(X=hn9r=u>ZIe-Qx^ONRO5`0!F
z17dn}Vkc%Nvw-Fa^L~ow_q|X<$hX>>TELR*K+*Jdia5~OWHZ*bUf&|$6>&5qk}F_Y
z&|eJ22K4g8<wPgY!9sj%jfs%_J~kX7qg#`rTbi+E$6I+J&lf$oLL4l3TP0BuP^lHz
z^T^*OdYz|$fDLlK%8BS5rMvTe_*>!mCE<{hpLaSqsGX|ATB|7KtbFJ@19|C0K{P1~
zC!Xs!PV+v8cr}^-f2{5QNsVv;FMx^sf3=$Q|6g0V)&Jheb64yPhF%}f9)+3PJDatJ
zj`iBY0Fb^b-L*_|LE<@v!61OM>x@l7duKDT|JnWoWKk{+ZGurG6@+753y7uqa3qbJ
z=4sn~TUihf;T$=%Re)1DA5fu(bJ*ZB)Ow2F!#|~pcw&9|D{)Ftw`MFl<v?~y--PVi
zpWRI%FKEFuQ?H8ZRmhM=HmfK}&b+EBDNc2x2O&=%AirqzH?p<lvNN_|Dm)P7(xb}b
z$^&%2Qys-N>tSXss8cP`F0pD>r>I#Lx!sY`eP$)>P2~3`E82XuX?3%<#n$}G<;SZz
z5P(lB_<ijnuqb2Al?PaT;@o0mtft3Usa7978Ut|nyheo{UkLaNM{MK)H8L5d*8Nx1
zo(8>;Bck8{eXoNKAXIYl%2e^6<^1KT;P)kQ`Gu-HPz^0TP_0e5c$1fInf}ejGQEIH
zRA@z9*<vm|Fb%FeFwIWA$nk|cM%Dc^%T@*wmo?LhSh}hutBA^jrAsbbe0D?R=To!G
zT2Fvlnf|R>?7*z6y2jwIT;tlVJ$^u4jOj>k=9}gJCfk2JE)7PlXf%_?KmJUL|G1XQ
z|5911uHEwgH}P=%FR^>@e5>AgC9KdH$_K-`9K1Ov43h{{2lW`WdKeVplQH9yzi4Lj
zu4n+Jw&A#QbwV;-h+>9uutc)mLuDMQ0DyVd5%ALtx!p&aF_(!KzIkd2X4n}2lnf0V
z`xfaT<8(3ZqVM+7#Zc+>9g#?&{A3%g>!D`hEO8qybss7zWJdmwJu_y#`ql_IFPkCE
zve&*FMb4272TA%;1!&6<;(8!SJau$Lxx^SAaf<|PvO*KaG?L225NlNr&(lC1`4@%0
zT{8~<^rELN$~DJEdrxAvG-!{9%Ff&Z<ybK3j5cD{wwX<=a1+ze|Fv}Nj;qc8zP!4U
z(*G>q(*K)zta}U{nMHX3T8S=#Z~%M5RoOB)J0corxuhYI7(%hURf%Kg1E3?OpC0vw
z-k|52QqFMbw2#s1-)Xmlup`ly2#g*@3v)#CjTL1)obB*|(W`?;9W8V-qvOG&ZmUw3
zT8|<|#^vz0E}IQjp#`a@KypS_Rm#caf(KhABW~?%p%H3k6iQD)gT=7MDd0|LX|3Gc
zz85P=f;*ebh_NZuIpWJYL;NAyOjTo*COC<_R=#PNF4AOG!Ie?#0&{gg4y;^3aWb1p
zaFqj(I<;g|8f`JcJYvS(%Ee+sSIW7cR`V+{Tfo;z%XoDM<IP{ToF!8U3=G_C6me{m
zx`b)Pl`S}SYL@)j(*(aW!;&9UHXe=CQ>-sX&>|qj=?Eng(igIr*%(;Aj?9ZJeL#u~
zeDp%5!F-sN*ZoD3n;*1~q`13g?~&@F*fAl;dv2Gk4DVK|wrye-rmtNj=U{y2T4BOr
zAVum`B6`yCF>3^t#`iY&*~N380nih<&vbSaM&qooJ5VV*?ay5b6A-$6m;`4Pw>`B^
z6HPDLp6c`pHxC0w1@gmOD!{|si4#SGDipoWCW$J%d6G6xhYK0BP){~S3UhG48ek^n
zyFNFj$@jlYB|k7BK!U;S0>A|Rzq-7#lH~tamX~k&|C@MH`2(%R7QEPGu^xTl@i#te
z>@cY%VGjUIBJYt=sPBHTlQx+|SW*GAA~trmU(_jKyAGF0ZQ5H-2Fm;;W!c&%JTuv>
zdd?BKDJcK{j%_1L09k3~x=F3DlhhQl&h$RVK!lq#D(Z+Ls<+OtJ>*U2^oS0vSr}#1
z7-wV+F>+a@w2+bO%6%7y2e4Z??#Y*Cp=M1rlgWbUTsM^UB`4FE@w_SLZ{T=Fm~nXr
zXO87(dAU>cve5nD1)~VqCK<eFwxlzkn^<4NGx_|lE>_YSz|ztTEWjlH-?ioB{m;@`
zb>;T_zlkSL|A#`}ox5=*pw|`mCq#9o+zHa(@xCA2FDj{)!)c;6P;%&;3x>B}%WVVY
zh=ki83}?)?Ii29Wq6Kf#u%F=d2}d*xIqNxP#iH(wh7(gLVA0TRIX$2Rlo7}44|;f(
z2P%4|Oe?Rlx?EgbzcllcrybOC&R>C=@Y$E4CTzIuyqulGW;&3uIxK_38<QL-cEIye
zmh(BEGIKuqs5^F8m9CVVMy1KNK+dTnog7T&Qu4dyD6;R}k8WH1QBMGNAO9DH?T36$
zw0oW?DSKeOF<h(CETQeJYG}+z-=GH!6DorX5eeY`Xww($I(i_bQ<wa(<~|vaoj)y$
zXMd1>yy7sS^-(imC14a26sF^wWq=g|*+fA7F@|^SVtzqDT@+Y^S)_&^Yf7&u5AG%6
zPF4P@j7+&2xiH<8O>jKGHLbr$uxwLN0K1=Cs&)lbE&u!<!~ZFxk4r>;;b%PmSE*LZ
z$@u@}O8Hj*b0ZJ%PfGCs*yMFRHoFnsk>8eqSBVP@2500HBjz_21gy`pXgIwO4mrIx
z93VeEZ!ideX&QQ=`v7Y|l)v*Ij{1Pei@?>9ZWnpNpgTN8PRm2ufIF8m<#nW9<auLL
zY<X?hkK9GkkRtKM&hESV_Dj)4<9*nR$US0zo{u3$*b;%1$01sy=m6qU3nPt~BFSpe
zJ#~WXLKn(YI%}Ui(E+4b7ouXp#6K$UB=z+Uvd@@|8dXLEC&Wp`-6-VQilj;OJXAJ!
z1s>)wHYcP=I%MjUj@F?G6^;O7R7B!^1icT{MVp!g6+aY(KZbww3&x?3TlsWulR?oF
zbKF$i`=O`31L5C3lsSx($exNbnhJnQt{35v9-Cd&_*D@1!mv*qNyytMGaYKDoIJEJ
z9ZjN4C0Pa)CI&pQveiRTOcs|RSra9flEu*LvKgTVWW3;Vs$c*GL%01QQE(+$FdpwS
zR(3U67By+i<HrlGrDub@-TPih8GE_VBjNfTyI|U3MaG2Dd4<lU@`F;V&v9TQzM4UD
zK<h|%WdLf4vsy{^iNE$Ro<AcNM;U$(XPgtlR7>th2Qa`6Eu(4x=FZ_yiWgI=$m<}r
zsYq$V+e-4hR1wxBJmWp3_tKfQlVsW07UKElgvE(%5;gq<qhOSRbG{r6MzYZmJ5Pi0
zlbp^=m!b_S0!woMYE<9Ee{p_Fg3O{FP#<vBwq+FCqkao^{(a3fdY$`b_LjQxlU0Jc
zZJPMQ6M$kWP6r)3Y!GTjG2F4~aT+M`qFWIb<+LT-EYe!vez60mg4^rJMc=3c67m~0
zJ!Y!AL6hDR(KPuF@B<<qeww!PRHxB&eWv?bkD^guMc!mns?dd9R^*UV>gZLmw3I7{
ziKd0dS#$w!vM}8D?_15Gg~MWwgWVJkbz|M-VEnQv5slhy40iBA`jAj03^Fv$ii^c(
zfr(D8obzm|^o6<6#nfN116Mdlux9904X1m72z8-InS32DqL2j?qfRbDrtanw{Wzam
zQh9IoWYm=UYw5EM8!qE;p8mcg5k!*)##@+vo#tv|!-7t_u_xJGWL|FE1qP6g4TIer
zQBSGzNreH#bB;f<ZZeYkMV0Sfv4NOOKws!3_CyyB)~53T#*gApQ%07jR;OPU79i(j
zt<)l1Xyr)#<EEkk=26_f8w)f4sdR3UT%f=9eo;0jdfLihL(-;BN8IN(_m!+k7F344
z?hgVykbywnm%7sXN@+@YBaqt#0_VzP54OdqB0?Aq;!h(u#yzrOVV#sZ-C$+Q&<^yv
zU8>|$F&bKq_i83p&_&XuAs${wB_aC>Gmyy+&f|P7N5ICiV{u8<KFsP#E^KU(6G1j4
z+0wlk%^OD%ac!O|-mGdu(XphK++N4{LFY4fVVUweM48F<CM(_9)IP+Y#b;O_ayc?y
zY&he@J=LWoQA67^hA31CuRifSzzw6LV*vGVdM)iB!K_1q;cBXypN7G7lt-rt%TY4N
z#xsYh%xz?#L(S{PW)KTxF2e)jAB*B3;?awO*C`;0C3>o;@gVSgn)1-;ofu;T?J^YG
zzn1mIr#LG*2;HvtadP^QNolnZ9wwdER7qIoO!+LrVa4u_$D*;Lw4b<Vix}O8rvblC
z;8F4#)mPiG(B0hnA&2JHT@-A>o=%`<t#h_+gu|Og9(?kLiG`A)s`+lx-e(fmoXz#E
z{Ux@Y#<>9{18l05#9(yIc31fTY52#pnPoC5gb0&r>LFlB^hHt~W<@NO=W99kAt&a(
zEL-7a(T1nl%M#0kK_NI?Yn_x^o=r~1WxzJ;mKlNv5ixeJk+=Sn!x6=21Cn`%^wumk
zI`$NpUDg!obL&8V&CeM9e>j@e(JSYf<o{b;OXPp6z>lR{{r^ooTK~^#|7Zl~^WvAR
z?r(QQ3{91>h;>_~UM(&@)Ly5F_jp-58sNEaUvmle@kBOaL!YJ|9ggxMK(_~!5%2-|
z6Rh(pI0a_eKeOD8rHe5MKpz)n^<gjSc%izeg}+o7B(!`tl$unYO}4(3eCfbB^;4nR
zo;+cehK?y>jONlqG-O&)=#opR!8&MJY9#Q26_rwdkczsIPdr;B*?QOUM*~*$g3!ZX
zWX4u`F;4Swb);_!w+&+>ok$(l)A0UJo(wQBVl(hnUV!-D=`KHd?33`hx6Uu(8E603
zA3VI0K9I<-t*zwIe|!@3e|4o={z|M|N$(S$Upf7su>Oljz$hO1K!z{T$At60T&^bb
zzm`|Zx99(jJbZvWxP$kcp6~YH*Uvqq+vf(KjQy_|qbuuUcKW}vwz70f|8L?Mv;HmD
zZy)!a@Z_>m;3WC4yp;6+D=$~dxAgxe9+Ex?3G{N?CZ(SUB|v70C7Na_<~<2&7z9Mj
zsbcue(!8Q7GggdiN};N4YiTJ;a&A!_V40eAavOHIQCqx#Pqz9_s^Z?0F;=MrU(rw(
z+nb|*OBnK>awXz>M}DE7huPXMW5%EqT6Z#_Dn1=!+;)=EK7nY5wpr&kRNMWI9F;L6
zHnmH~VvZUp4TPnyR`=#uS(^oCu4F;l1ZP#7!|}xIf8fKdg!OB9#?b#8vj1JGR+p0T
zpURcx+xXu%^4t~s?Vi*pwPQLjzUDg(kyOxaFcn%1TZ_}%1CwD@ruMJL+CTVt;!2ep
zCrBi7<Jw0D{j9_YgUvmmS41L{cX*%7B_7A|wElclK0kzdb9CD(x<SBy9NB;HUD=(1
z(>}qdcA@*Hkp~k%kUUyk(eHtrfABg|?WQ}2ZtmRioxU4EIajzJoL-^?90{!Vi@kpG
zgi`o8Vd$KR%<pu!IvO;!4eyw;)0B~xPGig9LHLQTr?#Y-a$(S;pdvC7d{mU-b5O0T
z-U&+T%LW9P&K!?T^q=pYI%g3YacC1BCp;SUNtK$}J@wVp&1!o(wzhDG{zv@R{U`?f
zL)nWB!=CG-P7o*;mS}lo4FNyY!OC{AN9q@h+cyl^oUG%*Kj8oq{`Kfz`u!vS@sUqT
z&!-F7a1adOJ^a(+U$I+hnA;;8YHq$q7Sz4a?Q{Q52L=g$iO7rkE*Vxtee-ME!OSSw
zV1yUnx&-}%2}PKX>t|?$TKgGC-8vILV}tk)_1QX$+PLkk7x3f6{<{aG{F#2|c9Qiz
zBwpCH^hf%WbjsWa{LLC>T?Rhme14YA^i6Xos?Z63g*hD~%#LYcskLKV>*GGX?bGja
zuJUKM7dY?|Q}G-l=#MFf$1&`=NY_W3i(`oj$JC2#1J}8AChV3lmnfRz1Ttfg`*DCf
zpMSvjfqXI0Z-!?BK=ffx4Co(N9^5A~@fWp$nR*0Z9zz9w83d6SbP)vxT?Sl^Ee<oe
zVqeA4q&;@zeQ^D_=KykmPw;T&vin;NXl~$yK!mWJ`3hPfmKP{dB;6hWNunG=Zr2(0
z*gzAv<WVnZVS*Cc_KOy~YDkx)E5sjHVvH(UJ<;~bplgOnA5YZg=e*8>GBeMuVimPA
z^=6Z|$;DtQTuA15z^Oe&qjSvgzy$CKy)~1NKE5zrXkh?k&2x}SX3Sh(x}fz**7s%;
z{v6=dNV927`Q~K%q1y#KI%d!``_3T7i*q4qj2{fiVh)N+10<&H4^>tUj;IiX(gp|d
zst96HuZPq)ZeH&B7I~Jd!*)K}jI9Xr%7Ah%lPx|pp)irV8@FPd#?MDL0lW_y43xz)
zwBij2i`lX;bTMTb43zB^q&*r9WZv;P%o8@U!1=Jco{u2F+d*fLF$4=6GKWAm#BAdh
zv6&%tRo|4ZPWv$%Y-EcZGT0=Cbw~K_Y33CnmPGG#&p~&|4w^~%9XsRismoEPMCtX;
zo7yJrw~#X=#cYK$a0hnxanNZtQ+Q$<QBnMvA^KUERfW<6H1@!0TMN8s?d6Z6j5nBd
zI>~I<b9_3Cz9CyNwP3gyQ#avU#9=eo{&$+)A2+}B27H65T_~kPk=5!S4po*!mSLmF
zJMwiw)xeWOIT8|=`B(f9>kT)1dXS1j#O-XQsa?vPC`@Kw=9ll~<*YS`IWr1Twn&U!
zk=GRd4}|soTo^MfOcb9}MqcX0xpmcQ4;>0}j&SiwPC`{ZkB^+lIp9L71?3ke{afdF
z<qyU8!1Jd}wD3{Mq!~jBdRc(7x_OSO_$U)-x=!E6jNk6Z;i5gmv`rUfdB*ZDgP@~a
zltv0sO&{l$J_r&1=~LseI}N7BU`tz-EU1sL*BIU8-W8M*S;%%r!^Gy2`-&~pdBaMY
zOjH)e>uJMwZbKQj>m9xrpII`cIXm}FGsk!pjOeI6%6fpa$|M>(0dC+hZqLkupjF-~
z{VkLxXSBqa-ot_eP8#R79v+Jy58)T=e2&_TSDK2W=p}%TmK518nP_Gw4>uFQT+jye
zILMu*cS^=0<Rpj0(lcI1t2mu9IsiJmTViT)MW5^qUO-pP<T`QTm>(v*O1ffVsp-8j
zv2;Nc(o~cE1aVBjvCx#*iBkDS;!#PykLcV;zKyI$WZy;YoR~0*&+|l#kI?q$R3oLA
zaRN{CrS~}BC*|`jlTi9@(b^|-85I9KHT_t(aAIiP>>XW{&QnZbsF-H$Drv3QiG2pl
zaIi>ntXols1|JvpL2+)6==sR&b=XTRg?=a~*hpw2?*tdzIf(}up0^C4_y-;&{hM@z
z4b|wg9CYXSN47KWocblpyLFC#q&;K_#ZNLFU1`Q<_wq#MVvDHM;8Rf+tRE*X8+ejx
zOMenP>8!-fp(uIKQ?9nat}z3vICtPAWkblxp`$uSZHv<oKLedInW!u_CFYfh<2p=o
z4wjYIBoRzXYl^bkf`MEnNfl|XJPYcd48{rk`1L&PK&m-NXoZPK(p8uZwG*>TZe~-x
zBzZt2K54E9mmGKi;){r#^*fS;#Ca0S&|Q9JYxk!Do5(a^Pa)qp@dW(^G*-n|#9kW-
zaB}zrnGh}OM!xr_5&J=VuEsT+7m0|6m`NIc--~ePmSp2oaYihaz93h~ga(1d*2zK*
zA*3zHBoW!#!(-4hzV9cZT;7gJ?ixhCtc{bsR934ae@eJdQ){-;2F0c+t<I)c*%=ic
z=F)S_LbGECxjUg30?FZ@JofoDLhMV|Vv|v3=UDA@=3&V=SJq@^!YtU>{f56E8jjgC
zAQ`GGE?*8o2SA`<Q%j366Ipq!JZ2<GQc7JP&Imb>1ttK`u_O!`g7w<Ks5r1l)+MFv
zxS7Xe2}n*bIv#bqJ(r1Ll;n#o{$(;;8KkOuVwHW_g}8Sw<A5>#vxQP2Nz?7P7@50X
zB1}VL2g07TKXgM<7`M!pY7m!{SDhGnH4N!Q+zoVE-Z9uR$G;q=vD)k|S}1b6B|RZG
z8s{6S$oo`3=y`{qnpj(1*a+DtGyRDLpoUUov4F<vG}Y97+17o9z4AU<Wty=@vuOK|
zTeIAAqoDV}H8Yh5WIG5gjTmVKIgRnLd&YkbgE$cAb2bq069a*<9{)|uoNAAodENg2
zB(|gG{>0?Up*A_}mrm<MXS~yAZYXc=)6vhX*!&qgY}{O@p{1$W)IPfHkrdDsg2=_B
zR!;E~N&ueWLq%}vqvNSPPuRcV8Tz`#CDG^vL2F*hz!!YI!F5WN9Mu|q<;Zb5%yC*D
zI1}}<PK9JUEG1?!Ch4K^w6fSzmX_8VKh(EhraopugjXclh0=*~dusEeB@t7tv^r7`
zj%pB|h(G^1A<?NvX+fkS!39}(naLTc&S$Gx<(l<}JLegdvc`$eU6In#FJ=~;NnH=i
zoY}}#Y(@J?X@<;nQIBeCcGHjo^hoVt0~Yu?87PVQC>@^*UF4RRs8_kjgmOo_9r$Ln
z(7L>6$tuibYR--MDd|5p?1Nu-9^WQ;Ljl?C2LU1#(2G-4sdYU+-In4o#)}wcpoRS)
zV4pK<H6kI?*^EM$oV)Qp2<IKUu~Lj{a=arrcs{s2QIU3tlX(of%H%^|@<O?6PB!20
z2`vzz`iGPyq*8<iz2FpxD_SHTN-p;`YMx?DLqxmfr;$wNf>tP6rEUyQur{H7A}(2a
zmnE!GsB;;hEYFnGj?(r)ln+((4LRlphSzX<EEQ7_8(1m6+f?1~{7=21H8L{L)E$yx
zgbwUNU^7^O=0~6Okc<xYgQ$wixAEas4iDosqhn|G%6f9^I@pEE;G;pu!L`**x@0jk
z1Ap-WzOlDaSxv_zVQg5GnS!8@v3lS>SQFZEHG2@hqgAojq!($XApGO&oz2>78o*W%
zoQwt%^5u_crU*YO<!S|fRLjd%__0)8U4kFW<wwi#W2Nk@z>n2(dli1HmEAR2_fe(%
z2!1@SR3F0+r?Tw8k5*;11wY!AM{W4gsW=_@;a1u}g+F#HZdcZ=RF|+r=oY(Qs;*&&
z)#?g%zfx^shs)K+*!^0yyN2CYJFBwp<E16+@X=BQyKgP6VTaDr3U=RFYGH@%rN`KP
zcd6UO?w2HmgD#d=X@<+o*da`pX1`p<!K^O3G{faKcDTIk(Cn8Vt;o90$|}upWf?ns
zv{I$nuat2x?utt@Txny6?G=Y+zw)Rf>n^RX&<t1Cu=~ntg=W9Hgx#;Lc4&sHUF?2k
z^)bzUwY4nkw$@f?hHGos{o}O?&3<hOyYH@bXohQD?7p-1m}bA$YRkIIkJ>bgM=q`5
zqenEuM-Fxf%S*F=v`TCLs7#P~R9%vF+mG8ci^ndl;p0a%!^aMG_~`L6&HnK!t^MON
zLFRF_CF`y@U7Cf{p*3_`G(+bxc3*MUX!gzut-Z5EkZ~$iS+~>b(kxmXTEkY0X4ra+
z-9K)v(d=6*wDzqff=sL8$hxa-hi2G*L~Gb~Y4+_l4yM|!(hS>WTKo1Y&Az={k#*gU
zLo@6=qBZQeH2Y2)2jg_AG{a7r*1oe!v+w->+56MRHg04A6g{8wD-fD9mKVxwYVmTC
zoTu1|qZe;ik|&;Vbo82JQ|gFfbGk`OvX1U=f3*N;0F7QqNls?QOe~4rSgHzzLZMKo
zT7N3*K8~IehEbo!Fd7o}(FnU=ivq$hTBEU#HVFIZaaYzIjh+&Qqdtw{Xh_(PM%aCS
z6cC1^H5&WT24O#X{6x)#;K>u3is4h5e1njtV$`R}*B#JQ><wx1tw%H!H}xFsK0yj}
zyCDL!)*T>ty>5iSZgjf{`g*sAh&=ADBU+o?O+EM5`cG*pK7B%yZ`7x$I1Fj>tqo}^
z1_PRWk4H2WH`E;L_WIZ%hz;z%*BfDnYrP?MzusHJ4mWxMcE8zsj8uKx+fZ}AzY!6J
z8-qSgzL2orc=D7c-zH(Wu|A^7*CXsVx_S<-M}*<}06PS6McA)DL0}%QZxV*<>)7GO
zdXKPQ@9Me#ct{vN9)&ddo)Y$t`%h@{Z4ic!A4fF#0>b|Bnwo>X%^_j9Il}I{n@<V*
z%|3R&xw%0YZa&8D*Ea*gesfLD{o&Jf!s6*Bjp5TSVfeH+qRBTP?4L$7_D`P>WuAt5
z4nA2YES_xA7(VF|hEICfA&6(f{z*h*|Ktf#=1HjMe*ZCH(chpk?5`1q{UD;rHzMr&
zLmK;jpD5FRs^;K&_?WN=H)ssQHNr3qu={Q}BJ9H<jeXcB%7jnV+#d~lgyFDDV>sL-
z?1$?^ntUN)IDA55Ka2?b;Xu#9L60yTbZHC+n}q#f9f4UJgoNSX361?ABJ2kPJ@-ce
zVK`c&F&u3W_M^uGntV?Q!%?5cel#TPM<X={H=}?sjMiujqYc77dW_xoqNjvm)TgnJ
zhJ<}I>XxgMgLD9-y39<yF%uu7$sifB0y6m&r89Ie%LZ`_n<eA^P&$x1TxEzH9EWLs
zj0B2_WrRde(l!<O%RuxmoKtUXO*%ZRthC|Vci%m^_gAFSXmn5fZ>|_NP&ll1e)!?Z
zz5i`vfA_>+iR@RPc`3cp(4(+0Yf?X>4J#BFPgXi(a}gC^mJO3L3Vb~|LU+)IVh26#
zQ9+I<?dmc5#Njb*m@TMO`3H*3YL@_tIa2Tyop@dEBI}k{W;%05hO-%;$z>dTD#PGY
z+?+a)v#xuYTU|L0bia!;oV9+tY+bP*k*U#ACF#RLKBB4z%dEk6rA!UlM`lSv0>+D?
zsTxrO)mWuEXq}Buq`hV`^qE22q9Sfl6Wk)o^U(V3sth-1IY$bODg3|%;ASzE<9?XU
z`>vUW?*5sb>u*u+ZKQT51sJeJ6Am|?uQKr(+X;3aR|elZVrP`wisj?n6iX(ThZNG4
z5(FuVXA&ebu;LAs_z3;2btXl%$K^b4pthuQ^hkI1;uYIv$HI)0$d-3>2xL29p0FX>
z89bjMpYUv-G&Wi59@|-Nl+flRu81+yvXZkC={~isgSzB$%$8;p_V?@M!!Prxxc|rZ
zy>1`^SoQtC-p1q2z>WX4+5LL|`-^<|{-1PVAIJSP#4`_0k>0;B7JcLm&&9v))6SQ=
z{ij{4^({Yvm;UIIUn(zfonDYJPG0bHp7z63KIL^sKJH>f@jJO!^__3nZrmRy12Rby
z93o<<7#^7b0c~3EK$8-eDc=vm5SOIs+#&Hsaj#nM-oAM$+VuWzn@Zem$pZ2y2_E6;
zG?i@S)$s#h(X|D(GUi<#$TC;(`>H@ANfeDjm%sDnM_*g;{?nO^ONqzU3toyWzYOVI
zf-JlI`0Uwe=)Ix%>=~UQ_+M%K{I7@6C`vH`xc@c!Qm5fr>Dz(y|Mb6?7bZP#@WMzR
zQ_}cf%joa09NrOo^mmNO-zFW64KoCS2j5DYfFIO{YzO|voU!!gA?cM9D1w<Y`tvd7
zZ_aOdiAzv9(@$m)Twpr#+r$|Ke-q_M!$vgaZyAt|bpu7b+%1=Q*@?E`GSO_DD-T3M
z^dyR1chSxuq}UFvwhEc|h$B0+3I$=0S178ZOB9NOYE)7h-ngalI5WrE(x-q|KT7a3
z7&APnlLR$lGZfBORLzPitjp=x^`Z^sJLuGyjrn#|KgL`qS_O3P;(71j;oOo(hNEHe
zCC)G90T^dqxV)2&>jcFDYTC&@>1(l+WFT2ce)AQR(~t{xizW2EzP92nqcW<zbXiUY
z1Xm}pB@S-#*Uuyx?aO?{OMLQ59(q>9=3RN|su2!mbC80n4#mobDHsho^=POhFy2Db
zSkj%d5lr1^s8e|O0Vr`5lJ~QcbU>a5@}S<^1kjrivE6sBP!k9FZFtJ%4gU47+K^Eg
z8|$57Igb+(UhfHy(2rGxAkT3>gW-Tx*l<(1BYxWX@Ot|h`g#l#+)AZU2Xuu<-gGmP
zI`dNyc`tr^2og2LDwJ)}XbieM<D9SYB*XP96g0m=?w`g5sh`Q@kkDD2Wpij0cVb3E
z*&szS+I}WCNqK8m)S*U=foOA4*Fxs&$L194s1?LZVaU{}-mYE%`AX8{#N<rP8_+~y
zjP)%OkC4f)TBy=8P>(a6ef!S>cezqHzdz9+9(b{}%4YOmrhG26Q6{Y`DbDTdQPGM(
z+b?u=L9O7l{lYgNCEcVOTb&QYl?4v@<G>q#U3wk7BYj>gf1%LIj;q9+0++h^T@>89
zl6|sVyefoG?epj^mg)rN6e;zNY~~fITn<|Im2Jr;2O6X(xt^|JL{Dn9T_dLK2W!Z`
z?aJEuRU%}Qxw7eyTMg|7bJ9BN9wl2K6@ub9StBl`(`bzQBPeoJ@Ys?i*gYRh)XyL1
zKCC6Wl*i+vxAIS^-m<dmb^k*^zilgq_IlwdZu9vo6|{hGc*vSH3Eq+IidEsgv;B!(
zcgABJyi-cvqZD+$A&mh%&_2k9bmdqZXP(AL#X=s%=+Lo@vZLn1s@O|lyEl!->_&k;
zo67su(-u!TVNJQBbCYw+Dc_$+tx0_?R76!7_JWwIYn0~$v7LiV>e5?cH#2_?532oF
zQ`e&smm}<i-Htv<G2mGRRlR(V2o(W1STxNQutcqG<Jw9@aFp>}HkYivx%Z#mKUR0_
zXi@d;hC|t;YObEsE81fzAz|##M<tCK!UPIcHOMl>hEU6ys*3t1kWtYug?u+!v>2)?
zqScV9LKY`f6|~mcs)FWTr@EZU3RNY&w|1N|wBu=3ifjqBMJ>V6<i3z+J5@PX2e2cW
zfEciOKphNJb5CyUsh)1m?zF*dBO6iO95y$z-Zsr?bZJjDG81+{lt*WDW4nBo8I4TF
zZZqDA>U+`36^M$7nF|xy6`w=qTIzg+*2ZwioxxjmP$wVt=)eaWp{P*Lcg3rptnsYC
z5KUH6(v7S%Q5;+8qao-N#f<GL7y6$4HSO@62H*yEtRrEqgQgJD@t_H(#j-aA>exC2
zPt(FNc+AJ(F&-6DTk51ZE-3lF>yAn{7+Y{!YlpRwI-pHH0#bTLh%ejzOH#^~prev_
zG(>!Fp9hxCC4yB(!MO$64{w?FbRb?qcbYvX(M6%sr@Bg%!Pcs#?;}I06A(~;^q5wP
z8y>5X&faW<#K6RF84qJs1Cu%G>Z$=%$AsY0vkn;z^pnJBph$ENH+>?fi&-ltL2%{1
z9T{)C9{Y~mB>f2T1VEc5gJk?r+--lli`xW(2~Uv<mkB+JpFJgP3yY<Vc>LK*@sxWr
zc}vRjg{Pnfc*2#h2!XMex4har9eEmNGumP9f$k0^LSXMLpNWq3eZ~3yz}uKc$8PLl
zUYIQa!(<M7nH6u<dsj~FJKnBnw2EDIyc47WjBU4<eCa6`{=uQf|Lc6e?>6SHW=fpc
z&HlxUsl3?aDgS@o?KI~T5uCMgju9m2uqrtdEAWHki6(-=Dx&4_^j@J2f9Hi_-b+I^
zgfcK<*=052Qm<6heN<XW)TfEHBu8!utBD`GvgTa*f@qS6Vc9`gqu*g!z%C{KOT|!r
z-VzUe>T<p_u_M!<W(K<lI<dsSjOw?PX;+@pC};apA=q*Ea+sgZ0%Z1)y=r>UFZgV_
zHj}Og5W9pnT9&*Ia$~2mecb7S8qxQfSMm)Mvn0C=9QZf?_F<RwhJz6gB^iB&TKA;M
zG3uc9A6u)*M~c~lGu~Q2igZSxv8=)ErCWb@A~Wwg%0}^aq{UCjG6zbj^F`RoH3;>t
z5Lipjng2#V5K5Fhj%E>8H$r0?&`}TW8t1rXQuVGI!^U05Xx;Ktkw?#QoupO+X%qJ>
zH6;U*rVBLGZV=$6Fa~88bZLRD>idD`j_4xe9+ZjdJL1<!93>bbqumJ}iesdPjGHr~
zHD@{wrJYx%F^)6;UD0~%d&|@tnLBg$Q)6(gSqkiL_ZJ;emdI7Z=2_@jYKi-u;+@_G
z1A1CAlg&@{RPijZRYWP*1*)czpUs^mmZkQ>3#`w9WR}dxb-uxDu<8MKd0g&mn;AK=
z9#Ja;)RccVL(^$<>sNN!VK@s-3lZ0~%S^aA=b#H~=H&=R_YlLGI8;T~Fj8NiMQo4?
zb3snLOe0}$(ibNUaHlnbO-99cj&;qcP(2NrL`rCYtUP&jq;u)988t{^)YqVYIxB0G
zccsHo_JW`ZiKZ8&I+m*8W$%l!VxfWY2E)bAGGl|Enw|{>upA4Y#_st4Qp<k-Z~S&6
z381U}zk~JlUeERaUSAKs`hS0k4=?zW`6;LI72R+0C(|%P*KP9=#+Gm%WhXI3^)a7?
zeGb^9o>AMXvUUg_%v0)Bv{V{oN+f@In(6a=xnV^>QuL^K)~3M9YKO<qVf(Ez+M8RH
zZ$G-H${hD!7d|LlazcwibPfQm$iJQmb}SiTumOw(bT41B3$SgUPucyf&@m+)!4n=M
zq(lw{eZk&ZdX}2#9Zr(NQ#Lb9!x;vGV*{_X9h0(>%e7UxHWj=rH1BfrcR7asOm==(
z^?tVwuR5f@{ll?Z6eGpqk!%c8Sc6_UgU1?L+HLYP^7(JMc*u9H75?Lykfjy$UbRqH
z^5fpqxXU%6II%34WtZ+uJB<E`F0GeDA)#uZyEymWvYo+o0kmjZ!;2rAW-adk^l?v)
zUBcgYb$fSP3PArbjH4`@9fy;qfPTBeUE)EGDtm7UP_bV@9WM^+Vx-L>{{E&wPSRya
zeF{4LQl$RjdT^hzb$B6CD_EB#^$*u1bq?}!q-H%>LVX%fKsuc_;two`M|?RNP<t5+
z`qAtxf=wiW4Q<>NGGJqPUI#qO8!hVx6qVOlzm&s?UO3xagz6o5V0G7oNZ%_h$j5S7
zAIj7#uq(iTWixWpM;G)#I6pcrlkz&qz$N@8oU84_{t@hXK_2(#M<VI}jt*e?#dZt$
z)_tLx0`Ut?-A5w!kKF$Ftc-pdommpOEzjQAw7~t5<@Z;4r^~qjt+fw1va@s^JycdN
zvmhtR5y^=1?VM9kL<~92S*6fkrkFy$Sru<Fs?}MXan#1UI2atI9wT}}GZDvhRJR-O
z))@r^&SAQQp12$CA`*w#%Av^HQdF=aHtK4y)+3)6a$&$=Th94@1rb$?G|J{<H_)Z3
z?%VIln|xTyymjwoNc<H1`juBdw&3jBXt*iHWSa=$Sj5{JZ?D<gLE2DG+c`ZC3K-V|
zm`@DS;xF;~AI)rWnVhJJi5EXH;2oYGs0(EIvpjS$Z5il72)0E{fr!J+1#KR3Nuh$b
z!M0ex6>Y3g9CLX!%GjnDl$i_<(P(stchq>BjcpzB?We=hkUHm<{U;JG<jG`wA-7Q|
zL)h9dGZEsDt^n0|K9sQ7{`b$G<&6M3qD!%g4U~;OB+lRc0VofYb!`?N9bs-PO0<QE
zV?w|+z{ix^YdlWQIC0jD&UNp{*?pPLPPUYcINFFR{Sf2{2;VHy=GbX6jt7)g63So*
z1&XRnqS{M9Y6jaR`ni*VBroku)l=n<k1(6neP%jiAgD+ieipgT8VcEArCr9D$PC?g
z#ZwGpT;=ZCdfi}b<+-~(y3PpaFsX1MdAIpI%r_i5NQ*MvsmHChn!;_`=%X)rOR*1K
z?GSqVFS8L!g)||KiYK_KjLrnZpYg>kytb81le3AMdg!{AaBLe(ZeUUlosdH|p+UzR
zW88B)H$v#Qrd`5|gc_}HF*fKq3c1`V)MThE{X{}aBH)RpF&icz9}G($R^g`yh0=I)
zGyxi8E()sG3LmuWV&q3k4xV@J(4F9v@OM$QPaU-Df}a5zFcy9#k9gv&f=<WLWAL(?
zwf5jbao|(%I2f$d)r4&WFqAk{mbkJ#hw`cz*yh=@;XFm-raPbR2>F88A)3rM{^Z#)
zrm>w3#!NN3$pMT+_+gSA%r!fRrp3^=$czTqai&6Eila0fM58&TZ44(DXW_+aVQev1
znj4Up^wOYfUyAZgH8hD8MAf%B9ekpx(1sE7wnS8!)f|hS)cmt=$|M$-TU21tDfRCO
zPCqSHFmcv51#EGe&64S1GC7pdZ+%E}G=_Z~SElaD7?&$~-I=n~eZ(0^_x>KDVBzm_
zM&5gftODC*jFrW=d|@>hf;7_dXSH~A%MRAuMByd*BEY+NQbKgE>WKavoiqdu8-R?|
zHR4pvr|LKx54OV-P{vSTQZQBbBs+J^#9zMAFFAuGa_8zD2GP>$T#Kfh^-^9_#TSk>
zFE1v`6i>!-24Yk6q70OrIICUhRZvP+Xl#2maJ2R1Jyw!xdmsaRx3$>3{FBTcXMl~c
zV9*B2D$wFiGFKwYta%@C_a>->kY`8Kqb-CT%kAa;E?2pK1>;T)6$ZN@My(goOzz#q
zX>^*T7t}HZsKbeUmj?XqGu4lKO)~fBHrDyJ)(HON;!aha|D8@z;ko`1VD<SQyz8ym
z=YPF!(EA$y>5F{i`P}K0E-+xsmv8i=G=a@(YgMuZJZODG(Nj)OhA}M~vdlLWz=C6V
zhXUS_)-2PAsoWzJ`XZxE9A8A5CDL|qI>qKL`yq$`sAw6};KfJklLc80R$CQc{Wy(>
z2dgRyN{)$iTrnYrAG+y7{(6-I53pn5MS-Ud3eYbL^p_Su74v^Ej&J1nzi$2q-R_2a
z{@?5MzRv$I@yUZi!EhhW#@Qj?cNUk#3@}B^`N%PotSPCA37yrN&SLRc-YUj5^Vm#z
zS&IHyTGWaOI|xe~4!KcFnXzM0S?L-&9Sm&Mp#V~_7sa2Q4n<GJAMiYsZ|HYPKqvdo
zSZ)qg^c0sm*a;awDRfpL(*=77qyrAP*ui?8V;O^_Gd07IjE(3Jm-nwe`o^tA1Jd$V
zXd?{Y7?4w3i2pQ|=j+G#RLKANEFOOW|1T8!9{;b$U*-Ro_^`Y}mn7b>UFw5nc2cGQ
zMwZMXFJkHb3xyxVli3P3uyXJI3Z6uD=xK28o^e}8ZXPd<Gb??y%IQK?fkx17U?*&Y
z=J8=~W5W>0c5~r)dK{Luw*JJ|T+r*4Hiu5b>0-@o^o*URJfCbEcjr}c+@I%kgqj6X
z!n2NgmlL!|LdKcS`1uy^)1L1ZFT8u&r4;s`l6Z*bFfwc2{p~IXz}IPnkrN(ba2kw!
ze~OCld@A;zzfyXzI(o^`#E)ESl%W7a<%F<*_{*S$U>UHZ(u-Uqy>RWD!Cam7^7k3q
zO*vIya>^z)USU7uqPd0PWA|ur4MpE_C(vP~@W#y#`F*ZFeD_|^wQGD=R-+@U$k~G2
zfhIPic5q<U4eW5_cr1bE6?k(Z<9yBJaiGrKIb#*wtDy4^%HS2#w(2aTF#Z^={ADzW
zQfTVpA@5Eo1W`Y-4bW`a<AXV65=7&UJar$WVRj6laC~vz!>HYlHQNbNnHqtOKZ6hh
z0?D!mhEb__zD6x1M~HU*fKQO!z~y}HmAi8;&pWoH-R&1Ud*a9UFU9WmySKahVsC$I
zcOOklSleS*(l7)buB9H*=m=(_xcuMWKK?d*@Y}&}*#rCyKhNmr@UnOH%=jsOyHnMj
zB0^bzZ3z!rOJ!NNncNkgh(&#QO<Al3%VIbdS_?gjW@ylTmnKu-3A_>x-+-1li|L6q
zV<ZXa0#aL*c($^7|9|e$og~p#)enW=|MF0J80E^a=6m)$!g;*&=BKwB0EQF2+UFUD
zP<8?1RzJFkd_+|i#nmV|5E|AzA^>`n{FJ0W9%bRDNTimhNKj-h>OB?duz%R6Du?mp
z5E?o{V?V`<D;~!32IEtd_LHpqticHB0waU2I4biSUIREvVb4Dl1mrBitblQLyt=w7
z7C1z(k7slq(tOqQTD%?i6leFM$(KfC><E)lV<JM?Ls{+1QgQ3;PeOM5rz0k(JHMC=
zaxxZuo;JGJm(jK&Y8#IoFl7Tq1~@t7r<}cHJ}t@QNPhG!ydx41&>}a)u&D$AuJQ3{
z<a)MgfRa(hpkAhdNVOWV7{Gyo7$JZrM=+5I;=D-DSL7y<83NNBjuUxXei1ZOZd(q#
zP61NT;j0R`SF)cMKa!tHc*3bGF^LFzmH>>a29S4Tc$&dHO)2cY)(Ft!iH<w&W{N?1
zwZ`&?xLnHxGD|-l#=~<*P+E~vXstdQh|U<*8FEIDwbX&;!GUT1<nwRs??+H)<g5b|
zPiiQz@~cBTT%W>}KxVtC2`TD~;ZdZZCG|p9G(pCkGE7(Y3M6V~>@Wm!W6CZZ8TT$(
zhjV6<8*NvtDBmL4I{IB9cZ^UbaNGzt@{a1)LoDht_b4T(dq0Rr!|2l^3PbXLOi!KL
z6Mvf7Zf=B{6l^y+atB_LR1dw6p30%bH`peyAAO^w+)5MyBy#{W#-j@js2mZCQHL|E
z$MP~H(;vomCQO+Cj0?9^i46H$5IkBp!Oenx>gtd@ZsY*nnTQ8%U9gnpwZc<+xkUOw
zn#)nafmr*DD@4$(kC+ZAgYy}g=b3KRn*1uwf<~GhpLBIc0!YI8$f{2+Sig!h>077v
z4Jz$dzM)W>X+C8p<V2-QnFFS!r7>h#Va&38c!ce@Yfp7dm##fk_47$|KI6K)7dD3Q
z0q&*#8@<KQ=T5Hqr#YxZm*%{$cH#ty9gsYYI&?>vnhw<tY-K*7+Y#{$#-bmM5)Mq0
z%v0W{-FwJ|acb*p#_^0c&Zm?j<rr1FJ~~GO8_V0rmLMu%pFik;mi2=}4)H&3iDxds
zTsh~PC3zFysafx@Cllfsn~S`hy>C-{I!iNBMfB9t9ODnSQ#K>L`z-abtoj_1AV;wI
z1z9a?bY0)x4GS<Q8#jonJhQp5FXnc+;>&JIbdL*^0}Qhwd7GTk5HxetpS6mWtHfeq
zz;pCimqF>J#2R$2FTZ7XZ7J8b#FGma%nG!1(9<Gs2M4x9B(<HZCCVR5Nl___XiK3q
zpj-$UcSYq!pO)=%F<`q=s`9xnrR_t>*G=(x?k33_TacPC8W{KV2!K_WAi5+?(SEuT
zowJwsJ!x@Csm2ZrDPC{T7hK5zXc+!bMBclyI>Au->=JAB)xmCbcYRQdptV^Vp`zjM
ze2*G(LEun^A9MH+gnXf7xX_n+b;I5A$D-4YJ<3p=AB90}V4!2lQDJmQ&psBgw?eOH
z2g>AW-P6zk<1>;G#|Ktt$?4x{F}&1KQ56KH#NRt558+8NKcZxRXh|Gjz`8je$3w&S
z-65Oa4chC+T2J)RT8g$}G>@WJDG%DC`Go(lnq+X?#(T;i24#i&ay@_P0bp|-0cg-i
z&^123mK4j8Bra)Cis`QCZEOl@doBhtC>CW~dZVK9P{7&PF*d(M7dJV&w=}LLBYN$z
zyy;O4nvY^&jG{9#Bbb#iF2BOYW}j}W@l7=C4WmM){>~v&e}{#r*Hz(Ce|N>oi8Apq
z%Gw10KeTq9_=ED<=kW}oSx>eq@5qrwqHTidw9_t{b?jag_8h(LIca$3FTz=fNB{|v
zX-4P%=CQwz6m2M2MGVdNwwiX*D}6OmZ%7#0?>;&2Y!ay}E;5c8x(r~d0+7^k8XaJU
z&teQ3W109)a5AwXBN6Gj853-C;c;Wj807abu~n91+sXxnVKI)&d`9|z#nL(QT<<|V
z!RX)orGsBQoKKEB!r^^;)Z3i%6%DP$N#!Rvez-|&-wrD513fR#IT;tJk%dDyZgF*m
z&#J<(d7Wd0$EbN7(D_X%L4^y$TcmwnHXkI89@uvGP?s!weIQ_TLcXyKOWd&P+Qubr
zj=X`R^w<`L#<v*g_M~)PsPq^#Q!LzV+ITXB;!PTsC94Pk<In{EoY5Nen@NOf3YWgY
z4>?DmMHBz{SXf2X{PG99QXjsOp;}RKxGSsJ$k!GnL>QR)1h4Q?aNag7K#0HUy0)1n
zP#IlOQi(6q)i557mhGvsMEToFe*N5#VJ$(|fM-A7B+q`XVA{_MaP8;YXWP#X+Ztp1
z`R3W_v%|Ry_jVgBh56o_u#~k9Hejh^UId|heegNCSs>4#=Q3B@rJKD{=3=ug0Y=6W
zD}S14OI$E_T7DJiP&vX%bw2wvoS#nhsUb0ZA^XFy&k8*J{!Rp&N`D{rO(H7^PT4A<
zsD7caz!Z2Hx-dx{0ronXxPNfqQ4=}DM~Nz7;Gc+(fPq9G`aBR1ttTh$18fYQ*&Ql<
zq!_24UQ2I5FLU_dkZ{v2=aU2W8Y)ySayD6Y{k<p(YMQ8s+b5LK+ofPFp$a4@hstWB
zAttmXtV6_Nh3quKvzUwt_UFRpb0c)rnq!U&9e!p5D3tx#kU|Mr0ut@1<7hn06jsN;
z%4lVBC!twm5}nCPC9(b$tu9Xlh}yO)TuK$?6_z(F&pmKO_ru}u*u;mKuETcKF52m3
z<NgM<<oeVAV6P}pCR}Ktdr&r{O=<_FwXe?*#pMfsTJroUJ<^V==K3LlRiu$+TEDg0
z*>A1fMUQ-!ei|nsT5Pm^h}~vagYHoaNQ{N~N*<mz9-?dhA)d&bPC3G+w!a<f*z|{d
z<AnT6h008%moj=O&t&|K>VrhR*vWUC3cjtsxrvX|i^5?S^+|_M2om}|(i4nDMvoq}
zEilzbgUh8n#tk>n#Aq1kG`>2yy}Uzng_(}5_U)QIPfbZDtp9+_t_KIjRH@~|)3y>F
zo9tq}@H&?Haz@c}brMw!Vys{FDtVa*hvTJz;OElM;dw|tG{91zWKn|Ad3M3$ApKK#
zI6BIG-5kPB0AwbKzuJ-s((#HljMM)1?rSkll9P-K@^sY4S543|pQM>`d4azVL4Q8Y
zt^6`CFGaMJ9w^VAMUzh}*ycS-U}Ya3-^aKtr}rtcfi7kkY^lFlivIm$^e&(2Yi`U?
z8is<GYu~t%U>;h_MULC+igivj+)u{CjyI)NUj&6`T-n>=h8+jQu<l7kjf=T<>>=|u
zz2wMTYr&N*=#El6Oe_@ZImIp_3g%QOx8{`V)8U(2YTYSy8XiTHSy(K%;S?NPgdX5F
zol<AVlvU9!_Sh+=Bm7qtbX>LbV%{C9mh9cNwckFr`~Tg()HSaDd;RGtOpcUac25hz
z2udy#VjXwSgaZCkI6g}851OdxiZdHxP=sVcyc$nJGu}%fXi%hXVQ^$JBYPu1&X2h1
z>mBh5CM(~*$nOt`l@><&>Ylgm(cv@u<4J&4cJQuBJbWl#$C>msdMKjV;NGg+Wb0SH
z(2%trs_2U(T3WQ+42KkHg{Qz2aLZb&V*fb8xL^rNC!j(+z_cCVgc322(dTIpr4!W=
zXqf4II_uC*4tD>uhtx%eiG0tFFR0HLgTF+l<g0hltYOnvzS9wxOp7ZDPk#Uln;uHD
z(EqOd&-bhMCBpYs{^!}s|9o45=DpQ>_uDniNg~&j%15B4AP@)06GM}qYs(%}y6RD!
z9beRxOg=>^sH?J+=N_)kPO78I?TpwjO<uN_p1z8+BM?C_h-Vnp2A_`=C()gy`RQqx
z;(+NTjiVs>r-nImTQ(4{%x1%W7ELnpg9$m#$OxpR?rr6mG)n2QN>?dGoLN8*<)w!4
z#l4(?R=zbUMZt4GevK~xr)>5NRu9Y#k|_e4I*V0tlE^?Tcm-*i@By`~<xA}6Qaq;s
zt<&2amlH5G{OZ+Up#P0rl<;JkQhOA`ifX?^AXtXEjE5P=P%sPaGMy$MR3`d95~&b}
z%F74yspeOwWlPpY^uZYRYOE08HKb(3QAJVvJ&-CxG!Shr$M;%~qcIFb_6SxUqa(cG
zDlc2NrK%|b=NshWuS}i28RmG`^f;nBSbTeny_XPZ71~sLEL%8fRFkQVDaCJ6=t;GY
z;D6MQCy!3hldAI+faG$vpF1{jC?h~+hj<^HGf3mof5~1mUA<~G@qaJG?m_x~|LX15
zi^HF{-n@9Vy?g%(Bh9wCalWQch8pD;?e~#40bR-N0T~dl99s4xL#O$1f@fNe(>!7P
z3kckEae?MoVuN$|iw5U-J{pZ9<^D?4{|SUtly?4(>EQ${oC#3;_*9Moa0S<}j>c%u
zE^^BwA;pA~&ZCnb3gK0M_qZ{&C)Q<6@+&l521&D+eE)s>_p4%-LU~3%)_KE_HGj{W
z8}q$9dg>ONc#BQciKgwPMPWFbPkr`aJ#RAi(eYuCdEY-el&w<;D0A`;`+~hAZe;E|
z9Tg`(bcfy;H#Pa){tO9F#Cb_EFiocOF|Lo7Fa#K)ZWN!33>I_C|9Yr$c5?o6fc=oC
zuCvoO-BO@EuUkqRTBB0}?hM&b?OCE}1RBv6NKpX5yeF}62dJAG_3;rYsOJ5~!vW08
z;o&r<{M(jCBR*p<Q1Vreja0oHK1A*#TaV^hN(7$b{f|~*!>3i~*8fon(Rl}m$HSIr
zrG`H=Z7DP~_U#fmN7XG_t#ymvCI@H&^NUTla|~B9#m2FB(MiM&0ufkuTAYo54i=(X
z&iB!$!xZo3z&`pEMy&KgDZIsEhj`3l-YNYkuW<^M7X=Ds2MgRVB`9d~(FhLSrc^?r
zi!2U@6bsSeX#V;0#UX5$Mx%IuK`Ak&%q9N7n4_j5dPh808DXXoAM3z&NM+{K*<#Y@
z6!ht#tg`?1#oK4(>x&**GujoAZ#YW1)niI80IWo*bRW_tEye&;e9cq_pH}y%pu_w!
z2J_3I?)Gx)-Mj5KFT{^K`_JFLf3uH&{Is+Eik`fEhd<xF-4idipYPI-AO9|1Ztvqi
zc!R%ox8A(m#y|Gp@y;74hCiSf|N05Eihc1K>%88RKi+&0@8H+=2Z2xaxGDYM4gKV1
z_u%)dmv8a+tL-=WX&##K4IF-cvHeQ?y!~NkZ+}nxjD6vctyl0+0`s#8&CkDV{~gLf
zi{fX3>}LY)=e_4!@Pz*)IDY1S#m|4+dIc2#rWZt;91uJtF#!3;){7V7AJ4aT@h6e<
z9})ogy}!M?xBqr`Tm0kI_6Pa)-P?Dsw?6Rioj2kij5h!J@$XPh|GoE|s=~Kl;OF*h
z`eBvRUv(L$>h|AM^YSlU^KZVA&<0WDAM)w@H#=|NNDPn^ueV?SxV@Xx0(A|87O!^R
zynxo>*WUK-zIcU%d<A&ok3IPDe(z`g31t|rSBTatr2nh^-JREB7fa(0F1(xn{E+u*
z55OJ{z#a|2-iw`|e&U}D^d1d?{G}f4F&0Ap-h)5h{taGW*LyjZ@HfD=NA%buLdaj#
z&Xqa6qVUuJ=)>0YU&IH5>cjI_TY%ID<kb%^ci+B$CqB?s`432$4>${V-n<kam=+&)
zx3^yKPgzzE-v=a4-lgu#O0%ra)7<$^2ViY`{?JKZ+h%2T*Tx)DDrS{pbg35;?SpSL
zbe^OY8t_vMG@TjeiL>am+Mp?_S#$;K;{fHR+ASJIaDQ@X48wddh@znmQXzHw6{miu
zowtpCt!-C!voMxsa=9;-V3M|j7sXKKBf$0weLAFTDOJ}W5dVXFPC`u?E{qj^qEK75
zbzne*^g_*B!J?wS(h@;BptTPXAH63H8c<vmwepbaR_Qr*f1t8qOC=^v#X-Se=8jCo
z$)Rldid+;<WDHr3Mw0IVk2xrJoXj)TpZ5#}N7iGvy(93_72c|xgTexXL*_CKd6*u}
zPtBTSiUU3V!XhqX?%b%8#rRN&zkDaU;(tU(etjl?JMP$cUy$P56*^e6OX4Atzu>xE
zFc!{s5}D)s??sE`M#~)lGZI`2R<7->*Z%0mSOBMDdF`Lxzj|fYB?UefYo#`H1sY1M
zCZO#t09%DWm|5?)w)NWQ31t@dyU*LWErdEq`AW=}#jAC{bt{N9tJAEMB+|NvNVF})
z{a}nDmZpx{5yswlAu*D(ttS*7CG#UWbL#Lf(77~&?V?mO1(37_m~xm**L-n2UzRac
z30lXJ2}ZP-h39hr@r?@vEn?)QW>Q0ZTOz$v@>DR3mq}(KwO$e(WVBU$3W@?PwivHI
z;k)F3&dDS>lad|q2{Ca8V5Igz2AY(-V=$Xz)G8<n`wu`!?mX`JufyKKAFRV*u#9|Z
z%(T&hitu&WpK!}1<d%!5^-TIEJj}6!NBVD`HFq?Ia!uje<r&?()!?5IxHD@rOb`Aw
zZ?8%l6zYCG8dyq$VcyQf02zkH1RCKX+3~{hAx4S=T_S`zqwG554ixL_;#k#m?aDBU
z98A)`V8E7{F-g$1AnzX=1{R6Z?4jJGk_XKc&m3{t<}0n3D^0Y-Z=wy{@5owY(eLom
z9tj2b@&ktU)89ZytgTz$HqCGTn0ZCiF;$v(&hI~e^<;GeYlt|@=0L*J_#AQg?HrFD
zNp~bnCg|cb7TlZ)x@V>-xC3)+o(^O(EftRs=G|Fzmu=>sFgPvN11`i1Ra_=d@sLLk
z6Tkg-u43{1rQ7>J_?pHZJ|`>S={rBljB1Ka(5DH0|0d7T3gJ+mhvNa7ClPrLQvoyU
z`ElIY`{x|btzN_kdw)(DRm6`M9MX=>D|h5+p9(^P2&)4qqZ$%#iX4OyaEB2Ym+y!l
zLrh+rFnLD_dM|LSy_5JEygr`IrrEPckD|#cKAM6a8m=bk(Ifo!2m#Cpz(cdAZ|*?N
zDe&nj;SL{l(~=<|i@KI2{P|lA($wa8?*LgqroWI-ex~Z8_&JUbB@8lt+I%wL8e%wl
zCSFA7x{+Z~Je3469*Q?Q;0&sd$OE`;P<3R-2`JP7bqIu>V;o1_GiUT0k=l%h{hZ>9
z)~_&yX$LAaD7!ROALau?3ji;2iuRmuL=O~GMnxTTQMybc&1v%q@)RdYo{llr$>{}d
z04*^?A(~SwMj&kxIoB4I=Mc_;xq#7GkwP?&L^ze2e7?4jSL!3V@kA3g$WUrjMUywc
z;6miEtqM7ILhjGl#Toz_H}LL=ts@x9qfjXfn)&h>!!EVssIYPQq_&aM<V+>~gw4qG
zq3GQMOxjat52?wZoVWCY2k7sAV3JKuW>th{H0H7%0Q1sn_io;Qv^VdgESpR~k5cYc
zlMJ?4hq|Z{Jw~1v(w1M<vd-V;r%+8Dmg)7M)+03pe2@?u<EC0VU{#V6ze%;Tm=TfE
zEwv>iXb8_q<jbn5wqjVVYmJ*c_a8*@Ct9pDX*9k(o(vqFR%J$Y%FdGxBiID5x^2O1
zD70qoaM5E0>(3{$1$%dh<^}gEuZF|INSXfCTHqwyx^Do|lGYb@p;T$u>8ORW;hAb@
zQM<Ove{Yw!4IVkf82=4bfgB5}-6rFQNmFYoNzf@@msBJ%i=fo?5-Hz+jnaa~E!obZ
zRnM9pBn7kMWIi5ps2?7^JS<d3%&O;xiMoe%4NB+}7lI+z*)&I}Y2?lz#neVg+y|Ht
zR7}od?Yydj!Q@K?#ibq-<D$E2%&M>iFlPNCIMe1dnO+Z$X(bp7lVy5cx=c$5vsnD^
ziumumlevKi@HO$@yWO>QH~#zM&9Cv_zsQGO*Es{{A^Pm4pvBQ*%WpUns`^%NK+SiP
zXeyVfx@4|zPDsJArRkBm%%d?v?l7girR-kpdd{~5P&TvA2)C>5Y*^*rzWHhA<@?>O
z{hhaOo)z930jmvY4hqfuHrd|YeY@*vz&t`X(@i!^SB6#c({fa)3r@V!hu7YGfAsqM
zN+(|0g68fFqz-@kJ*I%S^qgk-)cz*>;30ZOD)4U;*YRpFj>5?yy3oMRg|vK?CMI7A
zPs0mw22v;loj97RIF`HyqJK)tj=tjv<LOa@Z0XM%m2Ke|Wg?{zdf{1k@er?q4<goi
zaMuwI2J=()d7<EinCftj4m#t63^!ynF!V=))H+P!R4M%1h+du!`$pjU?9pGcmapD0
zPFn}?YkoRig(^k^7%RDX1I%cc(s>ms%4ST*pY&98(h>T;^sh=^Le+er&`U@Tu{%VQ
zJX!?#60yQLpHP^{@Cf6~V+M3iXe;Mj&SYk;TbVFewTlUvPmzV7U_3)-JJhK!#87$g
zaJ<bpJA_T-r$~|Ez&=QOP8-fo7CUBGbz)m4m9<b7bahexBrA@A=?`x!o>szZHL&DQ
zQ)q<TiX<6$!%WPMPPqo+R86`YX%@gt+f>l@IPw{DeL?VFgy~s4K~GHLg*jy{>x2j1
zIEgI8TijjQRd&vJ{9I#UWLM0@it;<U*Q&VfM;E1Kst=j*vHY^S$;#XbwtuA>;9T*g
zweN@>3OpR037K&{Vy-5wUuJY=cRjM4aSxO!fua}^yUtdt+MnI!B+@DXG5*OGxgP?d
zGAu~5oJy`u&N$_*(nwnDz-Yo24I7gwk?X@Rs3Tp2Ba01HwqoVHP|bBYtoZYvcV4~N
z+uz!MzgNmFMVMrK=0c;rYCv*u+OmZoijm^0dzKv2k}Oxe*;)MDOoRnLAl@QZW)jpw
ziMp$&Qp6C0OXkLfPe&3quT5|?;aM`Hvle7pDLfl!1pHSA`ymGr^!3B4=3FHpXsSx6
z-r$sQ1Ky&G>y(04>g34&mO6VoFF}jjH=3-F@MOIS&kqUn&2ApH&*M9(%LREk`Y9bg
zsuv_O9?9xXuq=9tS65XJF1yMjDVT>yMKv(wwmG8<jI-5MCslNjF2C%&dSwtLM>B`v
zFN9hlylf7FnJl3ejJzL}`oQMCCJS`M&@Hnt>%Mo%0a7O81o+99g+)DSeBoe*0|~D(
zljS5suP(v=5wCYzvC_<9X;n3<fg;Jr;_!Cma)-Ej&RR<NS|u)W)N@Q!ptQc+ci!^<
z<}}>h0!Xf2<s?m1_3_Y=UOsy!??@YN^9Q2Z-lrPy)bw!Qh$)B{_3$LKGfTrsCQpz!
zE~qY=A9udndGj(4?Ly5^nh!kkG{HbK;svFY$?}VjnkM$mTQ1v`%i`sOEAy@!eyYp+
z@BPYw@TCUI4{0SOZGluDG}_FRQkdBOOzzDaOiui{wDS``M9fP26JQ^PLKe=PD<OCR
z62sQhp$eS>_b&tv<wN#QK8v%+NU6|W74M=Hw^w)z5uLnn>v4g1m`-uYQa87%FQ;Hk
z?l{WST@0T5Fuh?1Y1})Z$lZKDfsF!ECSpYT_ZeQ5$tcP!h5bf(dWySH8EH0TkFO4b
zNFE1Sw(6gXdM(nS#qknHCnyZPny=<mHzv{*$pCL;f+>a7_3#@<X5i?8c1E-u;f-!_
zsJrrHm(~MlMCCD&)*{}bq|ra;AY9QS1Rk#9<<4i%LOg|~LUeSIMMFGG#E}LKVh*@~
z=0cg?IDl3(;8S6$JB%h5c2&^it%A@Lra-_x@IYl(at(8#su{v)OxfdrF6wJOL$3oI
zj=?b|XbCeiS{+K1>Es68JXOAhG^QpLr>TJHtbC1=qoYV&_rsnKjb1PFX7$PE6dEL3
zk?If4Msn%fF@UFg?s&+I*b~FieP$xyT}k;|!s{ajgYXCPY|PP=%%pAjQRkdc#j5Vx
znW|%^wjBR9{5;@eAdec)2esT`rPixCR6+M$abKV;iLL$c=o$Kx=+kE=8MA_|X;}+w
z-d%pWXd<qe&Y6tOakfFkav(A$@nTTvWuGSAFp21rG2TuGVbhQ3!X)4JKnvS3=;9Ra
z8pEcOu1C98Of6!VX>;xrm-LfD7HDhH4taIm#W#0VJ`tFs;~APQsM<sE&v`;OH_1P3
zN<Lphl;C84%O1*>pqaCf58hBgN<m$cgGBX7VWTrlEI~VnP+pp5e+orK0y4LQfV39B
zwM450D_fgbTbGoB@)2+Dhcj!CvRo<q_M<yBU0qD3X9tOV81_NPT8FH)%A_<2kO|o2
z1_hmpS0=xAF~UbDpR@#QuAdaFQh7}LHjZ2Y`DV=%L;cEW)07*>k#uxdnl$RR@D*>o
z-{k^#wcC<fVZULsEeT4UViGSKD1w-$0Xoy9?9Yl=F;(7ey3pAJ+xcP`rxEM>rVEDL
z!x_WpsxWP6yVcHXx9pPmx~RwJ<$X8gruo_IG(4MV9o)oL=E>lFjd?Y#VvkFE3fe8`
z{Z<DR;lW8KN#mn<l6`*>W%60np__TI2Fr(df=2=C6Dap_dNw?Gg!#o)Q>*YEOC2X?
z9j$qN4~waMCPN8abTAwNKS#qwhjwt^k1!Kfo~~S}A|}Q^{GhXg^yJ?t0{?1WbOZvd
z00Ahn2zo{yVQ7p}D(Fj^(d3hOjdFdkhc#bu#qR_85WfEe5Pbh=b~=4@N{_Jd)!F&%
z24F4)?^;b;IqT_$J~!g?T4~AlNsxoEeYf-C8Eqt21&ugGEul*%iN08FZStAZp(#VK
zghOP`cw+lZVc;fdPc^pE0tDfF#v5^%SH^YjhEh>(v1z)fJ+`sLsXaFcC1u=VzhOps
zK7FVcLnIjorOGHm)k9O8Ga@9&z7@%QbCY)BxeOvkhxI2;hG=2Il*zA+{e>=f8lrVg
zr*RH?-TP>edDJ!<xH=G6pRj>x2jkKsN4!~NYzZi87)9AKcLjwsn|bVyRzC7A^ORGi
zIdioTUy@4v$lOH+y!PU!Fmz)VsOLV@ljkhhnhvcu2||xXY>xaOQ>IDaJ^74U9YFcj
z+m`|jh1+lTfdZY<v_~c#{7t!^Rwb$QpT>@d?5&dZv|BrkpGu}CXA9qVGMeBG18;e=
zWU}fV;LD$=8mT`K9nYbsH0|;ljJ3^BK`kHH+jw15uWWeCsfH8B3BA_~H|_Iv6MffP
z$d`skdh55z_xKTebh1y;VYHikezqj2kTT*pW9oJxx#hs@hCA7w3>$Reb6ucp9k^<u
zlo+CO9R=r!hF7^_3@F1qmZ8LQS<nwjI`Hu>zg)%dEnUL$uFwxpW9xFF^0!dm@hIIo
zcW2Lg3ClE0F**^$Z0Sf65q2QGQpZE)K1KzOlLc)aQb*&S4V;6laTDHVE8UdFyR5aG
zFbx_5dX=_=w5)FeN$hLl=Jq^xt2eR#aZ#<>3w<hHQc~6GH%28ibJ?(L2ny_4I~+PD
zU!gr2jq?2joy;ea%N4)2N}6;|%zgz)d=g^-I2;0LjQV%j0b09sG!40q9O1<E<)8~_
zzoV6n@^%0N%0|$N_=uLXX&9$^YsWGF@bU!OGASUFsj24fAg*mBH#>31%C*(APN5`s
zVk5Kby?oa~*jm^W{!vj5!KZSCfUBg?vCAY!z)`KK(iroYjy4V|+UFKp%KOqPsoiE(
zSm0v+^313NQ?+iCBjEreg|k$v?Eda3|20DmQL&hCNUg%k*;x-2Ev_C#G3E0VP;~6U
zHUj8MyY@%NFmZ6jGr6FrNIt@A_5HCo{k!(nx6fHvFa%vYB&v&&@;|UPJEetypRv`Q
z$tWo;%=0@tWTj4fIDAv6U`P!|0n9OL<em5N_XIO-Dk$v?tTaGnmsjx&rjv$b*B;Y7
zHVV8(TabKmqXl_Dw-838l@>i$r2Z~{l~Jk8fB&Wg9r?UqkSrCwNNa^H_E|=^did4O
z6_eJ1L9XH)^q+PXW+c4tVCLlx?p#`yYae$E1(c)o04Fb5TMnulg#CGw_Mlj^_E`MX
z!^!2E!ztUX16MZN7~J7;hpy0Nm93JfUL77c1T}1ce%K6k*f5X)YoQ|FpC6goLhP)^
z9JkFDh)&uO%0i51E@q5s9kLG^=^kKU;ntmkrxhI>@P)5T->v1NSm8(knjX1PRLwSB
zyK9E%P!&`djLcIZD2i5>Ookn`t(z)S!{&5gib<9tIw|D3i9W!k_${GYt<d9}jWyr+
zdWOp4<Lq>bzqy9?!DPpAZc{dfcW#ZI^~$Pt$<o!@iJcFk0Y!=W8-LSXoP$M#2QTN{
zYR;8wzO~|)%tlb%q7(-IA~Jm3yk*f70izhBqHL5etQKx%#@C1nuSqqZ#OKm|gTv?X
zC1$)K+1%fm8&F&J0_1rgK#=^48eCX~#}~$Ck$iyo=7Moe+~!5S9nQH`7q~L_L4_L-
zZT;s#1;NT^fe~1MT$gk~6%7H8yu<W_59s<4?Oqkj7f(9cY$&h+;Ty9BQ0)FWJOSEj
z?ZX|^38PaOYdqJXPz7qNO=BHSH2Q<(F}{*+>ZPYUZO@mSk)*|S0j8059<v3~jTUJE
zDzvnepnw&3Q#=vPV1Ut;1Qv;hl2Y2>O=nL^b9SOSC@J8iBpA#wYd|(D4<e}!0`iaz
z__4z_kdch;lS(5Z+6*J!u&5q#0pNHI89QI}%cDyX$&^lq<<&<RZt`cgg`#1Nb`0j0
zqe|O(xkPGv)2Rr}bt|O*-7BEozT|z{)wA{`8$V44q(%1OE%VR;dT6n1W=Yrj#u_OO
zoM|5B+59ZWPsh{OmG9^)^UBRh9+)Wmu(_t`-n5<eqwlQ3-*tZLfcxD`P9t1F$qAke
zNXWJ6MPcE4h)d%{25cc{3$|&w4#s%fe^tEYAd$#>tmS2N%jXDoY`G1*AECH{CXJ@Z
z(*_MHl$un?lbq;W1_Q9TMbp6V!}?B-lsF6X%O!l`16Y#LW5VGqu~fme_Bt!Q!`2?>
zNc=Qj*ok$^wrn+vanAbYw`Ig|K1}=Rd_u_%P_W@e1`iMFI}_yClu%&OaOO0mE^V+~
zQ*Mw==UWXgNh?Pdp0y5a$kfs0e-n%sY}E2i{^BvZv_!BUT|lYVncnUT$ID2i_-JXH
zzgHt?oMJpd|7f`mYNHYlo9fAMa4qwUHJS{naI6riEw5zc$S!&FWv)q%S;~KZQl2)^
zrrLRK-J_z0Yfb<ygD8HC9Y5nxq>tuD=a8C@W7u9kiz9XaK?$EcwFO8+X{Ss2zefXm
z7jVcyU369~jQ#yT;xeDeSK=9b<v(*(M41t_ak6;9M^5HGaOZ&vTTj)B`U;gXqVjkf
zYUkkU_E@?VT~~~vF2VF(N)p0nU_9jAv^jL8WpiU>u>>7b>w|u;eOD9EYt_{<(0(g5
zL&cl^5~%qpF7=eC*>l90_=Dmxb3ib3qsu656|fSAbh9qu<o4EnG)PXBg<Y>X4^;?O
zhZ$+>;@)4Q!}+r?9p)z%bz%zfBF&0t=rQ_sbS6RZK-_nyP%W+T1UKyWucY<D6&p06
z4*}rAf6n8XGqbUVPZkwD8kjQ8bS4gBO^4<H9|hImyb=1`)541ua1}9uLat@`VzWza
zzzFfNPpjY&t3LKwxh<FQW8IQ*&~0plFEPNIS|wwu_+^E=m2GnDqfF4^Yn<EM(+#AN
zY`|<2_N0_sG!L_y+p5WRh&TfGj7~U0k~UE1&?w)wEZs&gDhMLR9*;5JE=?q>Ev(4*
zH)SjI#pY6Z#NawSin4PBKA;|)aJs5en>E?MC>jgyhMlN4`o**REq(9bVck)LMNx`S
zz%1iR67Lmb+*86_B46^DwbwLK9NoWAU(`Nh1?l~6=f%AOnAnHDSDAAP+2|agrpeR<
z!dU9e2J<!y)4Y1b*7=~&^e>Kh!c8R3D4N3RmRWxHS$!Odtgk&go+;+Vb$bdZMxe8z
z)9E1v75M94MOzP&Z}zH)!-H^6aResDV6Rv#D^oV%p$(Zo;mJibyXR?<9CxgoPq}v-
z?ijP&hRJdMSg7&d<SfL1O_*7wsQEh{Hr5#&ekzW6-ce*u3ZN{rUoj^_JB8A;xxkXx
z$w&3qA(ofco=P7ZcR*ZQw`#CdqT+|WdX(+vx5+EID`6u*?mB-N-h0;aI~MtG6tgC*
zq3~Y=cGYD~VMovxxbNGX-H7=r4=(Qr`4VL_2D&Ei4-}jf`|KERawMpr4#vzrG-P-q
zlbyXh4bpi&E?9IU#$spMq4hPZ_b+m`L=UIpq23ofSJi^JwCLAURX>etVyJl~qPsMI
z`@Ow7dyN;h!pE=R-2U>{c<H+%UQq7FA!}HasE-v(64H}I$B1A@8GCD;>mc8MZ>b?J
zwHmBs7KN(U;w9GM<&V@0tE)+YZ`-chRw1ZLA^cB?n+QU9sB<d%oaUE<pWD@)<~N@m
zCXyNN$d1LEg%l(2QtV|b%w#!VJ>bN4+_zsVsrPy{PdZB0RI?mOrD8cgwa|>}K}EHJ
zYbvL&kSnW`%tCZj2;hsqoc?9_m!JRg`Y(GqdF2TYop_iQZuq_0o@J|g^X@B5ajy8c
zUD$}8gK~++<4{KPUTll@uX1v;%iMUqvzx*ZoWmHVapu5b$VCq>7CN+8=!8Na{ZEG~
z7$-ugoD1cA(+;jx79-rRb~1&3Sqo!Zpyo5#n7BH01~a2M)_-mTMcbW0H)OELe`-5{
zOza5~_K%KD`1N!9A5Z*GOqTuVCi}qfJC7f4l*Ip}j}!lMqZe%cm)N*TAj&@f;qgDq
z#-CyvUO)6JeX8TXt_7Qq*PQX+eB2Gb#((`1A6t8tfdX;xTl&fqsV|o=-oJh)9*Ny;
zPL5|D@I!5R#P*0>l2U!(mc^77!AZ-LvSO8BrUCn61Z*u5G!%bKX<LeA47Xs6wStdw
z<2fd3`Iss#4ol-#+!LTj0`|~_T{bsLuV%BcE_TE~s0+TAUGer8(FqVJsfjV>3T2Eu
zN=D-eVBe2t<Tw?bPvcZ8o2MA&l(8S)8rC*~8yEph;b`v(09R;os&LjXWsG~d0mIj8
z*vN*8lE$4#@+j&wpo*de>PqN6HyS5rXcArP2_P4RYB{p6HQy3VdK;ThH=YI?-Qe1k
zS;^b#AeHVJjn@zh|E^)9ewK{!goG(~E0m#AmgG!r2+cT22PNc_r{GZQ0it}MiHHCL
zQI@4;54mhDScc2UVQuTjz5V@HY6CD0v)K($tRa2K6C4Y7IMiH6GJCg{h8-^rL6E+C
zwe@^E-wN_6m+DC#3qw;^B5D9fU}LQ4xxKrK=C5qdIZG;M@T=YTw=_3ZWWR{6%yVGb
z&NLavgA0t&gYi2$<8)p^%3QpOcsM3cH*)N;V8S;DkffU~=wV69JAq*tzUT0XXgH+@
z-{FJ6a12^%UcdV34<+NM0U1YW^iL5u6r_ha1?j7wdi3i1?`<cl##31Za|>kzUF9@}
zQ7e=O0x#$d$!Pj7=~-lB-a@B9b0S%j<o=KE_x}FN_TTT9P7hqo*v3T58~}$V9)y?#
zlbp+?@CLqd56TAKsMzyW>@Bw_=HnmKmgotYZl!W~d!_W^&<>~o8c7YwEHa;vq2Y)$
zBzY;_6aU&ffFSuPlWT|Tm5(R)Y7ZyrufS@Ubj}(<#gCJCY!4uj7=4vx=|hz{@=E6-
z;-+8kyxiT|-$wh-ARHWX=5}rUv7?;7NoEnb4W;u5pC^Zzx?oG^$VqN%${V3}P5)Y`
z7oARL7pwLZrgkWMU|0H!xQvAux6omj^OEJJNbg1fxuE3@W64WoSzmUkL-u#$qWE`d
zL3U*0f*c;yHej(zq5PFj<0HI&e@Mg`9<t|F_N<Fh(J^ER<tVoMqQ|lx=5WlxYnvb-
zm7dy*O!NMOlK!nbQ8wpr3ntg_o$hEHQ5HMt^Mk{NtC~3=(x_)C?+ei>2eOQ*)jm(r
zEhPH%quCiodY+vnItozXT;e~2BgN%M&Pc0vqL|-}R>-T8(h^vwc=xIR21qB#Oij5K
zIpM(DEjlGrWZJjCT$KUlMWeeI8g*D7@u+i@+<fFqVUpEQYgS!!j6N#nmBGA&WO{Lf
zoQrF%6`dm$V+yN4Hi=O5#Xt=I9atIhS%jB$`D-#W(UG~C#_on#dTDe@%X9PcIGdpE
zV*Fl&N;g(`+lYJh&5K<9G&Ps(A!t)$4EiSZPh@utjQf?9Z<m!-F?O~lrR_8-#<|g|
z>{9%0YPUI%YE6fIJ^E)yH#)_X(*GYg)$smEh*={ufhMLwlHy(3@x@nt<_7f{-6mPA
zC`oVkS`7T3qVW9iy?9LVBMNWGWYvhnaa*q0T2M}f5&Ff1>5)t`yo?H@w#4|+iFtn~
z@89<C;ybb4r5kvhiuZSy&0&{M3k|V?=!rG4E;hs_Ap3;2U!{dxuoj+*pe6t4sXx}#
zAM5Imjh6V$YR3F<kxf<hvHIhQ`s1nkBj|ebq^J?I9if$Z21f{;H&%jfZ~gw}`n{{K
zvcLpm@u^OkeE!^Xy=<4_EsXAtx-`v|`@L&T=i@LtzV<|hW=_>gHj1P1FvuqyeedP-
zj=rzu)6YNIsMLBsH|hIEK1J#Krk;;qr-=#1f7CRoV0pBBp@W?Ey*o?Nldl%1>#|#s
z--a?!;^8nFVGNwf(V-8yb~;qYkz-8w8mx9H)b(r1OQN<&M9cX^nPDhL(rTg4$i0NV
z*yc$qg4MgGowtR3Q;mpKUF#sQlxqO}8yqkB=Bx+8^i$9(J_n)tspokP!u8YIzYC8B
z3o>bN6GE}oQoCFlJsJZdI8yiK#H1J2^5VV4imx@2!g8m<d*aJaLERQZmhZ{(y@uu2
zWcjtLMv|KjN$n{_*`6p?4V`20>2G@EJqlFK1ii<rUHC5$n`@7s;!)Z*)ino~%vI$l
zgWMUb>-QVODmjc|=V}XFGFkSx<3B(GTyu&}5)3*S$lpEnyJoJwdHc)u-><Izm1L1Z
zl(<4+ORT_O*1pQ9KTJkFLpg!w^+9raiuXIx2#xTZFK>})Pmz;{ed7sjuR;-ku<D6{
zSQA6B4!<`*584zX@mL&*C*l}5CC2NxV-Wyrf%p>>5v++s1nUCStqt){5p4b^i3NEU
z0aO|Rg^qzbW1!0fC^8lQtkFS+{Ve_*HDXYsXt1#~^T4h;Qi}#&kj1B88D~kxQA0!c
z55ytheMrH<&JxbM!u&x&7xZx$o`pGa#TMFCEW&-Lax~??-g5lsYgNkLL6dV6S$61_
zt>Eje_xnFTQ+6g!Ii6y!!6~#2yYC@g?*5NFI`=WB;h%}wPh)@*=!70@rq7~TBb<ZW
zknfv}-Jjtw9(h8-yu4nr=*eH%;U4t^ln15>UCobhtKh80L)W{83@M=;#V)F_RNVh{
z_wAdP@3!{#$XsERRkQVmu4k6r|3c3EGWWl_8$qvd{|k$Mz5n$EK3?&PgYVw|V&<iQ
zDVzW;rQkNO+~$jc%G<8(et1dWyQNox&z=W3{SI?>=lcuyF{PpE<32@xr~ul`vQ?bP
z<v3BGkkDP;0Kud9Q#2{Zfhv4khlVkm&1H5=Un5gnj3WvVu3h5^DuR;kmJ>QdFEEDF
zcpWfr-eQXmB-jUKDvyRnXsa~FfI^kzNUcRob^(&#Z2c`p3^BXFu(A;uSo4eY5s6_U
zLuLnW@cY%<_lW3#*>Fz}x`744Pvm=!pn^hxq4Ck(R)sW1#l1ftpOA(_f5?+ubiy6S
zr}3=lRD}^cIGxbPJdovq{6cXn4?Ky5+E9%>xmuVi^0)LiBa;=rB$eMC-jDbOZ$=!L
zmMv$+aIwp=Vq|Q)H?~O8C%(C9tPrQ)+JU;+eVZsYz>e6VQf3_XV@z#)sJOgB@X@^B
z;?|@fAz*W9i9*o|`-9)kyWL?lYL!S7D6y<KDNbS!uu_{}9$X1$;hj0}z0^JpF@c4>
zxF`hq9WxpzR<7cn7crD}C}(T!MyXt5hf=o6PI~<qP0!9QL6?x5psl_A?Oh@&J)lj#
zLr`}M(w2BMp{G^xj(DzCPnNu#!9!XWG~o(bJSMB5@F6m$2*&f{2VHlQLMYSEWTXI<
z8mmDxUnT3}nF587DPZxpD2+!K8hp|aX8BF=i^;%5$*N3oSw;y(AyctYFfi0*>;8Lv
ze#pa-2p*jKEeuktNI<vw0`HX#7=v&OJB8#77O#)ksze!To?tMW+1yG0=HRuD9AFI!
z-_YTmamfJHlCLngEIQyWBBtv<8;Doe6Y`}D71|fgr}lQLG^`y;H_>_?VhlCP0*kmQ
z&v?AIoq%d2k*`a<_%&?IztpE}|2GZiS#(1i!0P>9uo<kcJNv)K-Sv&H`@b*o@h;Rf
z_+k>x(8I>jhgwn+hK9C|YBFVrz$^3|+)+lWrj}Z^s=;sGZN1;y7FtadzwYkrZ(D10
z6F(I6L3z2oFMfLa)_V4C=gmv&!OokX@)FjfKq6E^F53tB*)2jmpAa@yv!;^i(ug%;
zi%8S}(P#JV0#sRwEPG5A@#EI6e%^Fx@zVs?6w_|(TTbLsB6n5}V|cSvl+xEy{#$Q<
zX^D@B7i|(64?;GL1~H6s!(n*$)7Fa@{JwKM=HR>wkCN0D=pOHMM0(jnj4uah;Feb<
zXNw-v{j_nGDEcfl&hLJD{`UQw{T%2&^=MnPnfJ$WcC2U<4sqj;QFK`MQ$_$InVr!L
zp3R1*NI}`%szbeABl7hW6ouFV*QZ|ZR;jo5e0S&FzIgR^>xH5q8Hprw4OfLjkhMkx
zSrgeHji<P?01@Bf+wsD1SGhi2)^1&fh!P<Zcx8xPrpsk|m4)tep|whBB%kz(kJc(>
z7Pk2)9G+70`Pn$`U?K(YD$B^aLd+-mZ(-ei{r=VdPRW|8iA;jKd}%JN_5Zxze!u;~
zuIVoH3sv6!u>JgI6o4}3diVCtOQiWy>l7;s?r_%(^%oeeYw*(Y!}BLvxE5uCWz`gt
zxs3+>7H0DH-?m;EqTb;Be}^IQ3;ntg(cV1jlmJz?ekA@mkLEBq^C=w`%qI%K<wi&~
z{!xZ9^bgkJFLFFpDp?6qTlMJJE#+(9bicX{Zn!ZWpo|+9B!F)g%NjP{nAEb@^`ajQ
zbCT+itcGSlq>OL)ACZwbn<kSi%0zs63PTDC-1uS%p0dsZVIb|31RF_=4aeu5lQ|`W
zN=8OfaJ<bab01aHxQK8+!D9@WZ5bvBn!fRGy7-GJ`fxZgeZmwb(r`{!C(G;w<i1T8
zhKGmbg+(l7J~3U3Xwn+rjZ;za?t^I?=6CoU-@ES`(K@9BSKm}kioiQ5^3bE`^KyAb
zS9|#(I@R#QCez~=BnTz7m_#zjJ?Q>;nkorYvWa+;ut!^VoXp3={0x@-@%tDWMb`Io
zPP=YE${EH0;-@4XL@M$do%nJiMrAYPSpLLvmO^CCctfP-S&oJ5b@)&=tua2ron@NL
zkB<Eq%IJ+2o)1Ltz=N!iVzD?444~vfPR2I6K7?rFfj3S$zP%X^I9t0p<!zl!EB3)M
z+L*50b86d6yo7~m&1&$^s4<iXK-Se$wXX=uHhWIFURgP_&|1YTxC!0SXSc<C-`O*?
z0KlNmqI43DpP`ujBMw`Q3A*(uiFw<XXF~9vlTOE-DeziH+AuoPD2<b$SljH{QC8_~
z<r(HOOxWZUt%41Ab1N0Gp-c?1>g7Xo<A=xe>R?fct7J4nlAMvS!q$$`<gDfDY?6k?
zB4@qF=gD|@C=ruweq`KqZTS`<kVPEV>jjS^>B!S+4%f3Ly_yZx995dcmUtnRXdYQK
zcj%6v)RxICFM0o6Mcy9A<FtyXyRP#zKd?`uK?KSUC^q3N<g8d#XWfetH5`6P$|6be
z1gM&xnDs^;i)(fbr_(WKp|cJ_JQ_C!&nV%Uc7b`XoPm`3LC=_<m;PC%M#q|1IH_d(
zL@AlwDOS3vxW*WM(cv4&MCyehtS2M~cr^yx<o2^jFJ`$m^Np8eUmXJe%%8IJe@yNC
zh5WyR$7{V}{*T9B&;P%~$9w*dgP$M!Q=UCeA9twylrO`yn1pU{Iuxz@c@94;b71>_
zDq~E@Z(Sn{X9T5o+HQ8)keX_Tc7s<I1c#yxm5cka|L6VAz7F(^YPPY<()qD96sFz!
z?Jua*BS8vUKf7q(M{5hJtse8wyLcL*YntgQLCX!nLs#Hw#}cVj*~4ncl$Y&CXEbc^
z%1Rk}V&Rfu74qJ5FavpfZ=S_f6ZG<`n0uu;&1g@Jd2l1%C5irgG@^?JpQA59JDo8%
znnswv_`D@BxYxm-hoF+8O;_Dg|F1NeC4*#q6Kg<?{}<-RaQ(kFHop3QeUXpf|4R;j
znG4v@l=hgesZczPf6k-yqS^Fo+2Xr$w$O<x8C6iedSu0$=qMyBvwPQ}AuRVhL3aUo
z=zzBznz!>A+Vl8|;<6C+yw@hmz#^H^x-au06t8@=a&b}s_g6Cg=T)ZR1-X12L-8nW
z3hx?U_n=>U+xznJ2mU(8A0U!GFN8{TK821zy5DWzeJGA#b-X*eTZxB<2^1=ek-i3%
z-`b72#Tk~SBT~XZw}g%2v?Y11DN=8eNk^V9-8xGBF)U-@t)lZ9ap2N;u_KZy+$b53
zlQTZF=bL2eAgw8Kft)V4JX>BylPHY`zJtFSP@S%+f%_WG`zRE-XZ%Z?iwp7D)BpQP
zKOEz=f}zp*Kj#U&ZAd9p#eQqyf7oK@B)Z^l)Io<L*}628H4(6d$UE1-me7==QLuGd
zZEZ4)Moq{0Exg{*f_CKZHvK*@(4<?71IJ+XPOZMfi0;dz(GiBBL6Z&@xYHiEb}Gti
zOqcR}d4cJ|llVyQpFQLBA6D1{E3`pFdy{N*!PcyAlsmhF8FtQ4;}>mAf*k$x8@C%J
zEga>0i&gKIIiRWv5{h$FyP44aMKQMIA>H&8YxV^qe_m)s^pEnuz3{RGKZ%OBII$uW
z^1dWak+lzTw<FyBv3z+@sD5?eV+w^n?2133e->;Yko?8!_>p<a{h$@oPE)UCjH5b^
z#^Dsbu=%X@(ix^sJ0HR;KTyQ<s+Au^+Zo6*q-*iPkCXr`4`Aj!+oemf!<g;cRNu_k
zBloCNd+N5l?OzpXRWV8OF*1#__qC89Nbf7Dgg-F_D}bnswkS$bxkn>yKTS@ei2*m8
zY%O8S0$kS)&oJlfJME!D^CgodQ6OT8z!dTLKode$vk$g2&~b*R5y}6O3|sd*>H;@L
zjKO1QAb5R0qN7VM)@6=R5rXReNUgyM?sOOqha$^F=-*5zJAk-+W}I`|aAuix%e|!j
zeWQL!k#>EN(6RNa{A&h}16v`<+`;d<qtsPx42~n1(oQNfAp3aCv3tMq!9%+%afzEP
zH^1DwH4)B0>h<Td$jJ_P9DxER*7OseHW|fYrx>+*<hX@gqyU(60DCf%Csxxi1%NQi
zDA`8P03za}NrJ86`y2xEkXw-pk8`2|Ty`G6L(zufip?kxG0<|%v2mp;iIUywt&$dM
zEUIZ@&e!~zJGs<T57Fv)=>M8<;(Bcv4173Ert@(KdfP>9@%z2{ULQB<^jXkbt1b8J
zX}7++wWqaZ78~|zCbMUvGpyZOZj{buZd$_vlfmT0XFVU6^_G}<H!>G!7a;nv-pt_q
zg&M7zso=l{4M2Sb2Qb3=#^&Rvl^+ij3AEIxf0rp7XlCg=IxuEwP4Q6(s@6f}NZ)dY
zMMf$MxsmT?T&v=4zRyAD(@+f35ENn#yMW3eMctipn7=6>6F7u!>b*whe9F8#I1XWD
z8r!c3&)nd!fxmuy_3rIE{=SL7CJFBG3>$=FMky%&&|jMx=AXKtRQpH6!VEHf8OSY+
zVwrKrhFYOK#uhG%gH&e!*9nGi-~gc7{=XLVHXgh7e|-Jb{{IC&C4pMx;JZ`wSD1^K
zf<YG$*=Y#cTs)aYM^P$0yN|<y_C4^Vt`@F0c32QVur1UHsndwB(uxps>I6QEHU}0_
z&2u!+N$1t>dm*!A+i;R1+8ElP`*`i~dhn#TUQ^Od$&Ctqa(er?mf=a>h_{ZVoxj~h
zvAT^<$vA|;h&+w-8`H@SA6Zeh@0P7(Pf2xU-IEX-`FE{RHpyY;WVcW>zL;-h3;O$P
zHdf22?u`dOhp~fqe)-NceP<KaaWY9T4B!8V6$x*ff8TQrhj##9<<o`ndB|c$D{csD
zZa6v7VPLFk(ry|Wm(97gmyt|e&08uPEM(F_I39pvPg#UvY2-JnPAk8vu*tB4h7ItE
zx(V*IN@g&XFdN#BGpC(Vn9Vrrc*eO$a0IEer&}C+3JdU&vuGZ2FGYhPBO}dLZ7li#
zfV_{!NXJrD!dPu;p+U)xJ$epyc<})#M7I-wvEwljiNT}D0;dVzCMKuY0v@36Qq`vR
zPMVO>IcQD9sJ~ze8S<VL=Y_Ilu9O`VUyjJ@(<JhP_3qP6G~!j7?sSA%1^N$G_B-=a
zVwC)*{M#L|GeW;cBq_xn3}G*lpHXlK=rJl!7gz?favz291e3Wt?Z`_eyuS3&Q*tQn
zZyvVuWzAFgl_t)^Pt)Nj38`z-A39xO+S5oFnd+{tD+T?MZ#iL?Ovd?&b6*iUh1Z`V
zTI*GNJX|YZ#okx3=i;%H*t2HYf3mm}t{eXyHkwMkGc#uAS+tlWyd&OXSmCoci_E%F
zl*hwOBRo`;p?k<WTNqv_=nU=B64pH6^KikHh)Pe^c+B~LPDd}rS;h=N(Mn4zo2Ufd
z5{n%n6@keINzO4ZEDNs{)OFdppXO#ns~GEj(G};`6lz=eC^n>(M=mthBD4B+ZTY&k
zC_ENjTR`Ng-f*X`7|T;``x9r1Ra^Q=d0{#iSCITg^vcAHQXpG+^r0%WN>%#G1AP{c
zPD`FP{<MoD!BV!0yDKNMN%_)g>!8*e>Y0`7!o{l@U4s7<4`wWG?1o_NO;TDu6Ou6Q
zrehioqFY@K&6N<@W|Sn)+P`atsa7_AT~HZVYVElreooFP5&{|}lX+@Q6f5Qd^p7bF
zme`B=CzN4tl1WW?GW^~;s9Wb?rK2l0?C?Uj1o>7&CNAmO1o>-lIy_|imGT0@+|fh|
zNgQ=1qBAZuwe1$mx;J|ms%cD;9D$9p>@YTbjd&StYjE8~u{7qkw@{PBJPc7~UY-V5
z-R)vk*WI0xRaf5eb4RVT%yl3ZXw_W_y03qP89WQe_i9-$z<jn96VkY$%s#`4<<zC-
zFdL2><||cIWLv`|$}kKxNF(X9A;+yB4d}WjU?LMSf8&G2z0j|cHU~X`=fCfWURRvP
z6FN>_L7YE@<0DW^hos45V-T#Tu(o12?|XIaH#NAIRA*M`0C3a!tiv;|!z+DDT^G)S
zY2<&cb-S%bsQ1Ic$v8Rcu(uxTHi1@Z>?W28&i+Tm39pZI;AgccBt|o~LDFlE)=(8G
zeZmgS>e7`S<ibQu()j35X_qhwD-}#C%p;D%RaSx0D&olD1TTDzOKM_4K$QhBbc0mq
zg*tD@`@W<-f_0M6HE*r<<_L8}ySm$}Iu&|>w!{Om*7I^DDU#+2^ZoZhl^klSnHN|C
zCZNFtxM{+K;sq4b;h|hZnxrSkE0y8|b&by6&da_1x9{XM!*$GsfU?hI=zS7&Py6Vd
z2KzObiFraA+~N!q6pbj5ftMrm++~gdYm3BFD>CnQOT4I473H7|FHCe+oQrC~IN=53
z1a%dyB&c=cq)dHo=e_FX16PkO$cciVb=y!mJpRQu4ci?9ILooY-($JBx+aNkg+31R
z)2=Z(Yb?mLe&`Wl^v>hqzLea%L6PT`b{c6AP>aa9VKknFs+E<t)pkck=0jZX!Pk{`
zQQRtlXq0pXU!HeRX+=gx&TdKi*mgcNKL{46ELBnMA<>dh-ZTyja~hiA*3el8NFi-9
zZ};T2=FE>h%#CwR$9!M#2zDk1*jXU@7c<;ng#$@ZoC*)w2o=1}g&Kt)1gV|PPa`S)
zUjOJvj>!)5Cx_s#f0f?=-%kGAVQ{@TuqY#eJiC}mVP8NH-@{-voer}2GP6Qfy+J-V
zU@x${i5GBSUFT(tU)8S3;pTUzEj^?K+Lfn9Zrhz(<DK(?es8jg!47%bcYrxZX%u}{
zYrfo5ij`a=yo;O3yGF)1kmjg>VtlOr9HS<nZJ6vZvl-q)rs)%<u)RQAXr4Y!_iAed
z&)>e;H#GtqO4^p+;e9Qw{c;z?;RZr-jOVE(a{!Gmpf~_?7EUH1GA&H;iSmz9Gwvbh
z(2b-f!DUg87vp4d^bN`he2anH5E}}wqqp^9#jhURLpTvclqtMPqYK#zSZHX3NMqNq
z)0z(=HZp<!{!n%Z%~FCTP}F=@h<e<w)CLJdUUt!yyp(oIiLwAu#rceh1l1@ygVHOM
zk}p0wiqd<g;9@^CMH=P^s-|1?AfoqmRiNnIGw!4Uyv(qWkKE-8YBY_G(RmfLKy$yt
zkt;IOacjg{4wf!W$>w*NTVN|}OuRSIxrUB*rg0{o1W$Vpd8lYfK&@tT{X{rBFZRiY
zxkU!rR?ECGP;2V<oB3h$5ftqF&2|!Oay|*fr@%!I?|V{ESsA^9kOG|zxk!#Pyrl(?
zO{*g@4vj<~cXUlv>BWyQM+S;;E(|^Ksb^H)r{t&<-lb2(dcxf(6AC9-RF)QAZ0IP-
zXqPn(7DeI`+bDObE@efz=7Rdl&eP2A41{8Lm}k)tO%))5lIbn5pzYJ=t)XD)%p%ZP
z;@JgVdom~*baixBbZCwy<O)8?F;nT{EOyh8p7VvrZ)PjCvW-<lA{C~)ZsTe7L}z2^
zur%g2y!v_j)vLG0y#V!`V%z*TX9Xnf43{%5OgAG66`sG^*@pFOe|PKoFFS8u3L{ra
zWt*~|-KcfxM9=y)Y0Q+0B(7NaU66U2>@~+|6r~&3l>}d_uxrwMf=1iFJG-oN63gyk
zAQo?9`Ez$ij~&whz}tr+;sk;NvMnCb%h@qZLi6@tvr$vjJd!<oUlw+)SAN<WYdvWJ
z$t03DU?qqu{5-GdsHEW%0*aEHj8L&384Uu-Fn%~?;7W0QPqa$~HilWSOz}*^28z&6
zJ1;$!wmZ-^T4Y!7)}CdW6=x(#K)SWUS#lZ=TCCX6Q(Mp`lU%IvVi!1*JCg_8*1<L>
zwBZd3hZ#hLK!=L%O95ttsJ5tS9l>h}i=3Ltn9FE_=LHbHpC*)cGc*$n1)C>*C@_&h
zs#o6azTJO&xV!!C)!z@F|NQ>VFNZ(=eSdrJ-b3k?CKXo>hiJ4TBTTTpRHwD1y<bSz
zPX?UnNK$PyPjSdR)LV9m?Z6TQpT-NU0eenHS}gUNaZGa2NmwNZ1i_PkI`P?Mlmb|~
z`bmbTRD4OMB}+dOZTVNro+YPd*vVl$r1Oas6-Bk3?uW&^VQjPcm~Y;DY`iZ-gXV&&
zZ(M6Ox~BYUAjVm=I*`&36Wx3)KocG>TDxtzNd*i-X!@(Lp0Hs$nIvZu+&_VQJH>nF
zgEa0(sOgJ4Pr92=?-}(`rc5YYI-WJ7ia@NZp=MWd-3uxNuqDW%@knVaMq`AYr99js
zH!vx_h7!H;Pucx1j&Xl85kPD1e|6W_1NZ({ulM!-*BAMCHxxYh?rviH!@Hf`ZCFld
z!RB+_EYFjJPn=8nSnwRf5}KjO@!_XHkfQ{410^=>HS80n?h~`wSe!dA)~sql*Ll6}
zsb`eW_h@u0vJFtQp|3VH+y1n!_F4ei`o;n5{L!7rhyKpYa3W!EmT8h@vCL3SYr);~
zyEZ9MT|8G^Fhx}BOmkGQS_RL<yw@$#FM6wi3X!5xXDDDM38~~zNcy(8sx@mUJu{+&
zriF|kd43>r2Nr{f(A4FXG7kEw!ZDT-l{!R0g>fEiN(`g1;Te{SG2K)>cM^RVgKS0r
zSEWskf~UNOpNp>O1d7Tsxr+zft$hIaIR&S{B~ju4OY{la<6&Wole8LW&DjNzX{*Be
zmlM+FL9k)6CGn|dx{qtXbQY+4+xy!e0M5M#k7&1<9)skxpNM1{rKC)(8d&V_zbeeW
z=o~57bJLhQU3Y_?ziV!sHgpx-jCH)#--1k$Y%wM;M<0B!*Z1UjxiF?mqj{qG{1vxR
zYVU-zL+6$8Plv#r4rc!n1`pfo?kJ2Jiaxye58Df9)9lFcnfnav*(IhFxr!&lAZTNc
zj!DOG-?ut`x4pZ!v$s##$mWw_g1+(0za^sAH>V8!R?U8vniPK}N;7=O-}2`y9~6-2
zX@bWi?gUftsbI@pHtABByopdzcSPcG&8tH|fvNzc1WLyDNdm3FW?($lP<Dk^hELOI
z5L2K5(1TeahV3T^@|fqU2??6>l(r1NKSi`fJ&DG|S~vh44FT7HnBq{zBWDLFSJya`
zE{{_Ta{%f#S>K^_JR|j5=UWg*)XYrod2w@UnkH$>Xc!9@v}w7*Op}|11?^aD8%{o3
zo;s6-uld@{Vb>_kFTT|4uR>dbkbIIf6qFsS-KU43kl4Pwxml&Ko3I+@orN*NYA*1h
z1D_vdu;uvO7g?OOg%F@ne5Ij7m~8eZ4tw;D1jM6vdcDE<O6T|Ue#ZhK``2f-wOVGw
zV35x9spdG?mRIrIlZ9EXSIu!A6XJOZ1Snh#MWh*YgN30RE(aa?j)3$+F%2t_Ya5*w
z6q1#X;~1FYT(q%T_uxJ%SN9&+kAs6p{J7_uTcrY7gg>gpxaX-cD#N%|1i;@`1^l!J
zz6!&N3X!kE=q7|rVS+CzV-OpFy^SGbeDX$=ez7DGsDpYDCjA5i$e5=3L}{e8Dz2QL
z9`>Ux;B4&KZ)ukSeEx%YLX^e7zx!Ta(6B{j6{Lp9ZVGNSw9{&EVS%#&?)pGRh#v_9
zaMXlix-=<{LzJx^owIBcL6MrO^f3csXs?56R~<Ax1&tQ<pn1)zpsDY-2hG~?!RQz>
z&mjpzrZZ2fD=ULE!tlVDUDEEIF1ro;#uK?9K*azQ)UFY<$b8qUc(>-fqxCla90i6I
z*jU>bew7(gUKZp7hG@d(3=z>1Eax-(N`%$|ISS(xu;!x%H2$Nz2da~^<1{K<IZ;MY
z5{yPG`MFQwu*BT{DujAIgjj+wzVxf7hHlN#f~|oYho7xMs~aYc1O||Fc*r}lZujd@
z-q=v4;`E5mK?5cfQlwCI&0n=_fPxB6;a_Vx!?-LXH%{8rL;=d?<oqK;EySQ@M&eG;
z?QPz31x-E2kWS#_FwB)Ne6wK&LM_r$?{2ZImCLuD9@^ricAL0!w9wyB^6a6Ie<t%;
z-ArLkbx;H`6dO*lnN^HcD)&iNctQlrM>V4>Nh!m3Ukh$frl=&$1>cae(-fugkO%It
zfZ<xAgKN-LCv^qCxJh@1O`AN70co{dgGX-dpnQQ76|(BSYi3~pw?D`@fbo$k*#JQ6
z?!L+cz5OA-%%eV~&|!{j+Z@9x3Mo+qtCtNcx&F~kZgGIIF$3UEA@<}A0Q{0{SWA$#
zX56`5e0@`-KEh?84E80+ya)m}Li!>C=Ik@6kD<Cp<K!&k#IUfAz=N4|YA98PE76f%
zv0%J`(U7XG$Lvv#4r7DI^xR6u_n{ZS;+=uU(_U|F?QyTWw)tdZ{qf^v5t({0aS@rQ
z>@pIg<>+3?L{<{$2836pVg>=VbYtCe_6E5DsxUMZfx8|ZP5G_;GTN)YYrA%dxhxEw
zG9dgU>G?(&{gpt<KH|xawz?0Gwm)p`!*A#%nX-Gdu@K5keW3T?x=tDh-uVfWQJDn~
z{VFm;pEQP(!#GUSWEuiVP>qBq{VW;JXQoQZMdh`St+zj+BX=YNTh6df8jYEvSn{Ec
z+(ENV)-jrksR95Uao_^L&d8e{kyGq(Jdzhi&cak*Ng2&yV`<!$rwjdO;e<W6^sYTQ
ziU+vY6H{R79E#i~i4m;nw&=H3di2~Ii5)J<E#<;+=hS==7;AX(EhT9d@6@tWEU@PA
zm3+MJJkC{@HK!v(C0+OS649Z>2AMS-ZC1bCR4(RTU>-{pfepRqh~zWfJt$UuBC&TX
zn(KzF-Ssx`)B)&70sOR-;(?2Vt^;o>1|kSb>jlf;9`s7v>n%VMXN%FZVdt%cob|5!
z*8XNv`~(N$X;(abQdh3mu-sb1a_bGtZ8R*m*|6N>hUK0#EcdiwxuDy$VABx^tRe9&
z9$M_8C{}V?i*w4<l&GBJ&H+!JLz^VEzokf@_R9>Y)?#6_)`B%4&RS-7J|V5%VL1#A
zo91zAj^m?aF^)b(bQ2IA>M04GvZWx9=7MyrBSjpCnY=R+qf5AFIq2sXh4ji`v_&fc
zd1I%^DYu-QMzRg|8#tpSZV&;1hO4}?&a*kMFlq8B9vVx81P((c3=;Hz!BD@_nIrFF
znt<*>QF`L&Ox?(g&H<r`kzwZ!I@qSl)18({wg{nPOANvzG@5+(_HS-OBI)y*XAFi{
zMS$OQS%d<GB~#@tI!Oi*-RO)$(xO2dIgLLvXC-)-G72a2snH?<GfY&b1kUa@BVTuY
zS1Luf5en=vrzrcNE=18Yqmkp;Y??iL^ymm`%=@dreUHdJQ2w0G$KyvE!Q<c#*?N#U
zF@VN;_vyyQT5ogHz6`{-6vNpp92_6c_+p@p8gZD-(kMLjNpV`iKyLTEYX-fYo|i8w
zvU)fx^T6@19kN}wnzcwg2t13XTwy8~`=D~McbBbPz37!|9=*o;jXnaTca4ZLZBT~}
z4j&Zthz3<V{xNVhFui=Q7umshH>G#ove(U7!D@3MMo^1Lfxj`c3Csceknl2##%MIX
zf8{<lSP}Fl#;T@J(4Y`#J~e&SmuS>cWg%j7=as|H&RY+=`<q@XZCdf6i`}&PH6D!N
z3x9X(p6;wofp_E@mk4Dil`vbc{oZNz-A5U?(sw9XG>z77#;Z*Z*m;MpF8{K<O{bDo
zn`wlr+zeC+k!s&sc8o)5onIaRia>S0Kh`-fpX};`UOe_Kq2hvwl-mUs+T_-v-Yej~
zz<y;BGCh4#M<uqO$jD&I`;Q6b#OJmhRI89R#Ib5Je^t$W3xQKQTuTC19E6fFXoiK>
z_(hl*8a{rL9X}K=wqHGDZ%Wek3>+3z!j>Kn{mNImd;zxffQ8mj{}Os>g706AE)CC7
z`-K$wzSxX^^aYJu{*>MSi6^7vW^Vt~-Tw(TyK8R#r%f#W_5RNn_)z50!RZj=0g6lb
zLrD<nO7syPrSuXb4T<zXhbyI1wbE+zwouV~+Xz`LziU(sM5-qx%SPRA_Dsfu!3fx6
z5zb-fJDI7-goQ&t7EN*$CM!NRV!gIcVy+|>gv9plt}l#^%8-}wg<{Se&T=fu4xGrl
z`eX<}#kgZpMeleHwDo@f=lj-qPqEy6GO>Ig+;0S~t^^dzz7HPWf0#zUQ^dtXe$;))
zG?ib2E8+lZ6QN#$2ElENz*SSOK<h_55wG9B+TVG!{bBq0pNl0@zCY(YW6zPk^OU$I
z^m7!3Hu_iKr>?<IfaRCt(dz(;#9fN<tvYuMCe*t#rf?xN_B5W5p_0%2kK@zpj5>9w
ztbhbVEej9{dJ9p$lt?yT^_uZjHD!BC%Yj$#xBgrLARo(5Q0J0UPEQf!mAfBa?!JBh
z?(Rcz_c<PYZ$E$gX7By$?OlA51^Dyy;wVk#Q~Xng@k{UCQ)@6@*sNrZFSm4@6PPzY
zF+XACN@tdB|848lP0cSHldyh<k-5EIu$EyM)L~dVgn!hmdh>Sg`R>lU{p)C3i_Dga
z$*4d%C?Cq~I23P^+27E&X74zJxl}hpRHMr+ntqUOU^+=;{y=4{h}r@?Lt^cw6?ECG
zdkG46_NNzYOmJR(*n06ozZ3VxNPP114$EO-3*o$`6v8TyYFfuq)Y`Hf<w5e6<ns*<
zMI~=2D49Fv6Aox21^6E-QVL=;-@s+VQT?(Yak*KI`_H!7vWM@6wp+I~fWGaP=_KB8
zsW+1Sgz3>7kHNFzC@-R>1Escpe7n2kLQ|`<c`K<tuca#ZdXv&-5k2Ro_JU@cG}Jf0
z_Aa*>?ES$Lb2uj_6K3Bqjb|5su9<0F)o5TETVNjE+@|N6Jbgz*6XSLn9TtVgIPsGA
zP_XlNGLc@w%7=;_c%0auz9_iHb1O1!5wFsX{t{EQ>B6)C)AldK+qbX(1e*(hqC`2$
ztO$xhIZub8U(MCf$8x+|0PYs$@t4s)EQ}W87c>ASsq&Tk<2mQe+jrZ$1?Jg${t7Q2
zyx)U;1Wfh;1<v|m8ce5M@&67ex#Y9^;sIU)eSpU!;sJx~wFpyvs(TIYV>p-Hl@xLO
zm*+tjDa-YtJX;>K==(_)j<o--;JCBoJQ_~oS^Syfb5b;3&Ohezs2)5_0rt!tIvi1A
zi;pS)R*u3rDXPbTX-k>K4xh;(z){C$3b_8;pMHP+l%4<g<5@DzzC`@b-s8<+vk?Dt
zZS(8-|Cjh+H2BjgiYAVskY72FVcYfxV-cTD#~jB4SJg~;yVLyvRbiFA0%(Ca1n$X%
z3Y6TBCm}{&zz|sNO!V&yd@bcD-8dgdlOtHkKBm!8Ht&lLuH~1o6tt<G%d6b!Ad62a
z7(MoIm`ueb`~%fr-?5PD7^X(;>Ic6Ye{-s&k7L<o8!NNKRFR%TerO0}3xUu=KsDQ6
zY5#tY;nmO0wCk!nEO3CijTuN^^m_@ux27YZsTYd7^-ccJo5a@2cxFZE@<NH&V6NQ~
zFlAN*M%szf-<9rOvTDcQ_CaxBRrup6<)wqlIiqrJfke2Ro3PPHVEA(d5=Zv#uXJH-
z&f)(93+*;A4@P{NBr|kB(X}~v`nO2(D<gZaLD--HVGV$KMTm%9Y>=qJS&R!cLgvXa
z3^aG4L?Fdqi9LE(PO4%20L=b6|5sk;Tp{Y#`Coq>*KN*V5gbgcV~nw!O(V=ZH^a%)
z#$2*x&Oy8mxuJ-E+}VHr_WhgMFq4ItqtF~nfJxF($s4Xj_nYdr=@t;80)mf6km9BJ
z!X3jni`F@OTE1TK?Yat2(y(9S(lqsn*J@FdL~4N~i6$QR>3S$So1*jB21Dwc^9i;v
znV;%8NMi9*Gyt)Q-jl7CX#I8`hV-l3<$t45i!y@u!xa7qdTXr%Q^?57>b9EP(kQFJ
zqsP$G3^?!(X5M!5NayIap_oV0r3~CArj)erqp>Vu#RHdRue>8Mnt%RmUZEnIKXNF(
zXy#^xz{iv{b`lGen82IdgiwVa%b|)77f1C^gD1Wi7gj<<%F|Ow(Qhd9(+<$1?a670
z5~-pHtqE#gwWH$c6Mn`({P<`h=K_`zT<1W-08dJ!W5v+PHmJSAFglBeTfE^2=Og>D
zL}=&<{EZE*+Hsp8Q>5(!3rtnJa5c(TJrJFqQyptJtK8`cx9?^ZIgfW0*nZk&7ohu|
zvpGrJu`>DUox0ggRWy?O+}M48PoM&0z*f3K9AzBJn(t!@8DVSVNv{~l&kpnqUG`)4
zhVL2%5mNPv@N%*B-qZD`n~!@>Hv#yAg2rc?5fBY?JuKRd5bHzJ>g!9=o0G<1UN?@2
zCe3M_g=3g{WD1W)@p+L9rU1$1N@zyqvSwXigo|Hm*sFK|!V-@<lN7c|5AZrkh)c64
zV!R)m!^3y)&YjQh?%`n>kUi1Sk=Y)vyHLJ;C*Hi>7b|86uY2Cf?dSraV&dhcAvR>*
zK|-VBP{oU<=;!_p`JBG0LsSx!cJSNz#>R30w6H2SflYzlQ3QxpB5H}U_Q3`&;@jGK
zpXv)g-yF!S0AaQOcw28?{NLN%|NHQESEb-PCQ(knv217Q41Zx3&Iu+&_W~S}&K1DF
z9_d^KU=e)~Ab}NEkze6f0ABSxuTbNMS8K*AGc5!*cwl_#nP1jaq&cY_TJTkWJt&e2
zrduX8cR}WeNfyK0!mD*c`rCle`5dLmb%+Dne>NYS;1-~YP*ySd?O5*{yaY4~-4HRm
z>fhqTq=bBtj0lLc0qNG6Qs^xe*#`k7=EGFJtYXzt)}=1(6`OOW=vVNj=Vi{FX1K$f
z;7<=(bJBKyGj}(VylOjy8+617Ks&dOnDo{L1_1Z*QnPk<GFqLES)GopsQs}|^^`#-
z!|}NA3LC;5+GTM!FJBQ4l)Q$G7H#i%t8Zw?LHFQ6;N*|CfH!SS+)C+w!0fQNFDNE=
z)B`O|2?$|fhu|qhi1Hrtu>HHYbgGELW&F(+Nu~G^M^!E{m-nyQvd=<sR}aPVTn*UM
zHDr>-ha0oWP^a9><ydl=cf;0<!%DcT>2OtS<IIIr(#^l4ZAdF@$KC~&l7=LkiZ&Nb
z1_?^OESaZx<l4uRNRJICv|_`uaO)XQa;d}`2fQ{H5m$lgmBEFkDoIfZQen+UEz%A9
zS_dAdNE%ps0#oaEVIPQL>3-$c-M4RE?*IMWc451skg!9?l1~en;LOJ=IPgaAsiP^D
zMa^~O@0b5qT)$A#>lFz13x#og_jV7<e&01IgX^od=+$izp!PJ$Xcp<Hirunqg0gNp
z!2<p0{ZFT`?Q-zZW|)kkAx&WSgnOW}AdX~%lq;%_qy<ESQi2B80f5GHQ~^Lx4?s5$
zRu#^~e4=)Qph@9w{Tj$O={;DocZGRD8`GFK!(I3IKyQ2>z^-?pO|K$`)UPlN^*h>5
z>#}#mPsw<koN@Nz*;yi1FmM+LM)Z|f>(OaMc9G4Z)9jwH1vfgAN<g7M-@n!$Ru2%3
zQy?-b<A~I1X^Y*FYl>5bL(M;AEbIlFS9Jx^V%D^1uX)k6=0(?=7u{%HbhCNU$IXjA
zv5S_^%o~~;<}U9`%#G%Y-<Pe|d~S@ob#tRJ!v~8LZ9F%E=5r%xJ~x8qb0cUzH-hGK
zBWON1a(x6%&vNy~(BHtGUGkwQS-SF(^=&kJ<!4S+jDY%$S+>ZcZeFGeeF!y<d~=cF
zeZ0zLc;qM`Wpam4RRG#<1A(r}HWKNJ6~^3OO-lz3fh)AQ+aX(!lkG`^xxPSIO*NBw
z$_p#1H7TvA_N0#2*jAk7u}onuA=|=4!qk0}YUR_>Ju0<`_4=`1prlK>a<)L*#Ra`U
z0Wl~0@80%4l&M}prMHyW=&kpjJi%pibN$46JHo}}FquS$2v{emlq;0%YZ=MXwz{#U
z4EBMg&0}YP*<(AQB^=EsSlsqvrh{o47b2|qzyEVO$AfEx!DD;7Bi>Jk7)*@A;9~wr
zj3&#jeAEc=Bmxn0(DpD*!wXL<oN<y$o<;16oT2+VJ{(7*nQC&HM!>Ffd}joXFCQI*
z+bULP`O2qAGX`qPE~tAjL{Qo@wH$}H7Vl_sueV1}4DYrZVzjQwXbQj^;k0fUr)e@=
zi>11YvlK=*POr&S`54x7RkiDx7^4}o!xwxUKQy%R6V0hi%0`LzJ8$+6UvGVAIjq;e
zfI2D>XCS@<Mds-}3_X8f7vn)U%dPe9*=3UP5F=Blw4ERIEeA9`PSa$TbYSE={rUK$
zGma()W*^qgrD9ppCOB=j$ALM$Koe72f|tuD%W~V6NT$eN*c#O;am@&%p|{X_nJWjK
z-vqrU^smDwK2T#6N8_Pv0SPdFqQT7Uuf2^8DiJ@a=}J||Cm}Z<ELvWP1*S^}8gN`t
zpFIl)gLw**$emz!*c6J_n$S&UmN<(7iL>Y^v{`EH-a%0+kZV*yYW?(63nT=zVAt>+
z8*HxE985uZ_D*8FCDyUHFMEJ_2tbrf#HuE8!by-l!cy^vtic2D0QV`T_m9Jhh3cK4
zFnrzIo7p#jSIs9C&say7p-!{`?vJ@{Q+EGjb}@|}-B2HR%j5CmjgtEx^l{@q29F>A
zm)N+W{wqKK;rBl(#~)|>4O{`LiT@eE|L*;t&9&~=`#)deQxcJLkh(7SJ8z!vHgdAh
z*zLmfHIRmulvM+E22VbP#sRKf0@rAx07^&uaLNJ(CG`M9qqB9Cm#JA6jhz78dB3XF
zUUj2M8Xv_I$~J;Xk=+8e6~zrVHR?p`F7^g|UhEGO<bi^RI*`mnUefsE;PKNZn@@u$
z>(!m;avO!te*Al(J9)Jsf2vb9FAfOM-d_X{OV`&no<3fCvbOo8NCUh9oLQ9T<GyJ)
z0Df3O{omtY$bGf&K@j9>fj;TZX>)~+yXKAzFP^m3GwGGPFj&AG#}#k|0Y3Tz;OZx{
z<2rJE8PGybhz`0B9bJ;kmJL`+t_r6Ytl5_U#IJ3Luxc`uud3iIabS3{z2J0snBT)m
zefNH<CdV-HPL2%)W5**G<{73AJPy(GQ97!qU38bSNwVX05fI9c7&ueY@&z$04BRqc
zG}5l%csnt;@-zy4KDohW7p{-iXpbR?sD(E(Pm^Ihx-f{<nT}yb_$kzLa>iT(8vMvj
zdA=jhrsJ606FL09YyxXKoAE-&#7xoI!cA#_?aLwv6&>hC{}ioo_N?Wx+}bs;^O_pe
zD!j(BB}4M#-+y}bc5A=kwLIJn<;xg;NFu=JV+u4M{xnX)nbIBl7bE&A=M#|Ox5AFp
zsg^4g4GI_g=&trQ7VJi^$7tw>>hz<QO3P>+t41>MI$Eu6Xu#G=fw{g)Qs~vAovfBq
z<93x43$(>F6$Rj;3JbZ^rKzbBH`ifYVs;y?%@jkbxI#C?ps3r_p-`z){1GS=)S%iy
z02KZ>`0I5gwisFZju)jSI+a35m2xri_SQtZx+C6BIEf)FzB8;r=NB`;Yo&#uj9T}2
zn1DD(u<8u8lK|eYm~@~7>R0nIcZ(*{Z`;qFsnP{MdyAsO1O}cGBcrd3coV)sr_G(o
zD4uxZ-6>_jJ_7L&wUmBX8?myfXS8BHyCbHn*(yLN&cX|^Ls|=vXb=&ocprmOLeBEk
zl3VX~L_ZpYpba`L&FIEcoT=8Jww8+G5viQ~H|>a-0)i5MCN4}-isK}P@uwK?9U2Kl
zB_p3v@a$=t4CjOBe$9ffd-f|{hGts2Sg{Jb8tApE(_OVyWT~+L(!*rlAIlYDf__i4
zC_RPcbC#sF0OTfTQV9(w>e9gumYw-;l6(VEyuDPs!s&L*W@yHCCAjx!y`V*wmhKda
zA2BTy$lb4zp8jJ$mG)m0|F>=b4TAOVMj`&w=H|v%`|p?dP*kO}FrFQPEIaIDiZ%?!
zH;!@b(2?zQ0nFXTr~Dgq3CNIQA2VTB&kjK3Y4?8T`ZsDnq6LeWtRrNdmRwy5hw>~-
z**=YYDYvD#D@ZX9w9z)brvtdp@s$3~;?Ge_Y^b(XuqeKC)AF%>2jf~L6XbsDLhmc`
zItjCQAm&-<8em>*zjC#vRP4TczxT6JwfMpfI*YBr@BC_yVQ-)=RPhRDK(pL{{jxl3
zGnLxidh?4|VGj+NYdkk+g_DzeGDV_^O<7OeSYUQoU!1*W{mz7*;_GaE@EI$-<)y3H
z<HqGJc#8DmtN#noge$O@&Sg(*0w@h&;aY*L)x1Ve_p?ART@Q3+m_J}LElvP)v@aK;
zLeCn>%f}kGB8*kGB!4gG=jR?6G4@wQCxW6~G{FA6h=S2{Wkp|wA}p`BKD^p~(*TlC
z<H%JMZ*`lGgIjfpnrjO)bY8WL3l?eQvCW00WIa2MCR`MKY3T$}`f$<6yJmi`aDQb9
z_c~DfdNOjq8&v}j4L{_?<Dqy3c)i@mKX%@{*#7VkTYV=wLN0J7pm(I_9bW^*oQP}^
za9}f?u*TA4AX^JWX!rzK#d}yhb&L1=CB@gg#Rr3`;$!w3Q>9Cah9Q+@8@bVTF)=%r
z@Av)X%i13d{N;Nk<uQ10u{^BumF>$ztY)~@mBri5C=vfTj|V5jZh7f%3ha^Q>@luk
z4`%>-qLMqtZs|(qD3o4+H_FDsJ9NEr*6<fE9Swi+n_`Tx$QRXk))lQ_i{7$gCykEg
z<1j5)DX$@WczU(Tla{RhD?l^Y7~u1J&9GulFXznE>Z*~<k^-v%PgYIf609u7s1aYD
zvZbQSQ??;@a^X^$Ww7S5=vuXJLMZWUx;EeR8c4JS#94D$)?AP+BE_mjSW|v%EY+$-
zT19sTH#L!RMmbAr?LH#Gqz+R!Btr2Bg<8R52DN+WXl?FF+53yFl5H8S@w^>EkjM`}
zrJO11<r4D8IY(eWvQ~(?2rU1@p@<?e8i}K$Y9b@hdHu5SzdSnf6)$6fOXxU?d^Jjk
zoFKo_qt>9tVBjlW3es@sE#C9+6$N5!Q5-@JK-fZSJz+9R(teo!GyDv@h~An<v;JF{
z#^Ep?@FMq!R=nDyHVe{qcdDy6DkYdbaRnCLnk=6%mqTc*4~@!VJWR?vUN+DPJQD%;
zD8<9WqV&u$EE~Ko7NdERH7Qw?W)d!r3QwD>LxTJg4?1Dmq_MlfLZI4abTt)h3rk;M
zuv4leF7+vAn{JKpYj>aMll8jwD?6IkCEES?77x&xt|`$WNiMh!iV?n0I6M?T?!vEU
zDs-PVOHg+m(Z+_|&|l;si;-y2_I@~wMrgvE97(gOeMP~fT%QA&A+NDWMV4#X`ET3M
zaG&Nu-#Gv-av7Hh0b{HM9SskPZKaE}HMH8gCSd&=1Z?1K%S|ohj436Mo4TW#-O8{A
zIIe0`Th(QIqBT@yN7dsWs2a5-3Ys&*B8~b9Unm}E8Paz&%R<pLyJ)YP&w2{vT3CAy
z_f`;Kkw!;1PJp0509CAppR)*$Z&)-PhnWZ`QnKCvL$mbm+gmXFd>QUtVDJ`cwBg`&
zZ)fmu)Y!gQGC)jpj+5uSkUJ@kwg>vqH#aA$nyf%bZdQ=EiUg#B<ipaH!!0KDJQ*Ia
zyr>0c%TS^Ejt1pWUnvC?RG3_GF6jy~ImNkNL{{NhQdQI#*;lXM{%u>d^B&r&e#uDJ
zj(A?6dgRq-5e`tFML9uzcvhb#pCX$ZeE0{Y(88EcBfy^Bn#!0(eduy+-aeit(x9};
z!jj_0;k35ZWwTlfF`fDG21qaMCR`3UYp@mpu8znsa!Zi7?To41`}t<}a%3uYP%1id
zRI8s{ePjP+Zokxe%R>7Bofu`u<UL1jiD%(S<TyOIQ39IGNfrXMJ=M?hm6M0kC~T*^
zHZ2lX*izkQ{s?m&SC=r_>RYhj)KrEQsm<3A>H&JW|Ka4~2&U-S^51vFYXpEY_NEkX
zN5RsMQ0#M-^KWj1(v;~0%h_Ilw>$vSV_JsC&-XjC_>^uR(NJK}CLO``NjJE6y)g&`
zn_Km(JK{w+3o$lG{3(wii}p5xakXU3WIM*sz~cIxFhSv5Rs{^uYY3AFw?NnKt!Iow
zWp6z_A|@5aSmJ`+dsl1GDeHI<;BSW{^{5kXnk-4v=@F)-$GH|~$(XM6YG>$a5>F@)
z%%?ay!{5Xo*OUl;+?J7_-kE4U9+b^&?|dDU&DT%Leo4}EdHhXXOuv#rNeqX3EfIZ;
z(08cSsCwB6OJ7MqR9g?O(WWvW;XPK*{>>^&?$UW6ouWddEbjJj<a;w36N*=fVw2K@
zvEZcDg0i-e`+YRNxZ$z#==#<Om2ATD(ek);;>s6v9sSDZ+KCq+b5+Qvm9dNGz9b6v
zh2kB<%Xoc0nZ_<|nkOnouV#cVB}bW7bVUl+ir#qdx4^!ycF(sY2QA7;4LGU+XQ|I3
zo4RhHc2mw%pIQ!7pUVBg5*(@9Eu~SBL)E7Vr>f6_TPa7}g>;9wlEE7jY4N#JPN$O1
z(yh<3m7EJ7YBrQN&q6uKtUk~+qGOE|j^$0vF)rV`(Mj3H2K&Ya)-$jE6tlATZ!;_H
zxgcrDGmS>0K`rwf)n|98wkJ4h##x%=$wFK^;f-h%6oQamO_HL5Tx-^~&*$^&p#Z0%
za$_`y6wi}Vj^7@x5(5X>f<}59WcX6Z{0HcQwd`gV)(hKJg$1;XKQY(i484p*k`7@L
z0^3k&UCgBA0#Ti(Uy@s!4X{l`a#&f8jvkt+jVrZUIkmNo$sP9sxq^CnHC|<lgbn2H
zo|nRbhr~e{jZL!$uhIT;J&(mGXX%Dx5j0?G&(c)M`x-ny_rD^SJwck4F-{FfsdkLM
zF^9-CEUl^6JOHfOn1x6e<PgE#ylBrXDq9k{?x-@J=aYh)G{(W_h{x2DmM%m4tuEWE
zDC-Oa!&x#6&*OAJPS^RA`f`I|4@1u1=1|!5x69-P!o>*hA<(k4w}`nHjYpjn(Fe3+
zs9H|chQ#Wd2Mk_`tZZct1qveIM%JmA@}`2A#|Q^mIKTznl(7u-xqqo)sLwqI66PE0
zY`JJAHSjmPv4r4Fm660bw-+Sqov~{*UTQP!mEP*ot>>$JQ*BY0Xv+agNP)o(l|l7z
zG{WFqzi#b6FBoQ>yVZ>rw==wlmcMMe&}Hd>C^5`t^cw@R*jZ~SmOVeE-{j+%uVN0Y
z#t^to8%v)HEPYo6%Zq8lxA(2hRSQ-=ii)^bH=#IOq3Is47i!yf{L;3s>^$1$OwFU#
z7|bKij^i;VhmJA+H;=|whWZy|sA`6}BYu=>Fd3uN7DL6eMd#^0aA5XO%qP+qJS(0G
zHfC0n9rYmDX*F`bl(y)rMVCWo?E?{dsFn-<L&@J}JI<Q@rf0X=bg!wlnpfrUY&3?a
zy9_*XSZ0YDUKb?yV9<9Yh?k`>W~0oQj%x1^(<>!{;$JSZ54Crc@-{^xHVPcqPx>P4
z4?s4I#Buz)@gDRkbSJ<9uGz#y1e=A5W%%$4tCPUz!JYTs?(VOy?(M(b-Chc@JABT9
z1Hsx2F5o(;2*H8dRD2(uPsi~f#$3MRXck#CV8S$f)R?NU2oPPO@i@UyaG?l~=HUPZ
z!AUZSVJe@6;&V9p9GeF+AbXQ^rYdi}diV1dtQ+W`Qa1pqb@ws^KnNvxI7lEA!mhQ@
zvFe$0ACWg7^qnhxG3r+Qi4l>u;mjL2)eNONDA<3!F6w&I+{n#WnsQx7--7q9K_MM#
zMT*qx(8Wc+<9DfL;{jfe!Vqz?f4@1W5^@U3$Jw)Q0Qkm(+Fkt@7}n)ZZ10GD8R&0z
z9OJ^C(JoCklZ*fy49|nh1UzS#{Z+SxV`)Fbg#^hadzb2BWGynGK+>(=7{}SiM%opl
zdusz$G6wQCgAz6z3vniIzugp<N-urqy*?!AxpqPy!78sCG_tssP~e7Vqz~7HaM3oH
z#$%`kFN4425^~enERN0}CT!{p`z|{zhEJ~vKD{r9k1FW7sLL9N&yrQVH+t?pziVQ`
z%HI?$Sfs0+JKNI5pPNReOWiSi(coQC3?Kt_+Jb$MaX3DR4(vQ9Q5p~G5cgb5LUhk1
zRAqr%@(WB<uBueJbbB{&=e9r=?`0YDo(jX+^53j1iTk0jtK$3hD%uuGZx-5K?}_t@
z3Qr5oU#y9Xp17!*UagCO%B+ddxaUD#nU_6sD`|y%ezo&vZ+mxt0TPGSMW9k3H)P-l
ze57U}yVDQE=g$YCrM^|Pk@xlavwM|AVHb3vEq=CD(bQ%U99C%t;^G2YkYAbub8%4%
z&yN+YJuZW1D277~PZfbVkDafHeu$0at-$xi@PgVks6DS}@JZ>&hZt~7k9@cwa<Up?
z7n<$Vp%;o}Fnr-$a=Rl2#}VoL*f?c4mm4OEKM)OtZ3-;_^0b^RA<SKaE>(nC?|Hz^
zq28{{ZLTJJ8pg02VVyLY5Jj_#$t*lKmmL`!+s9*Tsf77T<OowFbhZ3Z#13xrKJ|0o
zyDCiPr%*VL+tAzS8c`fJD1EN(fFn%cARI!yegv8#2`04TW$+uu;ew)0xGsZq=?2y)
zwN|wY2_k*DFxz9wxm}(O)4qWg8-a2-Tt!^tF(xxkLN}eD1Et*tWWG;$b+2Qlqs#}_
z7+{A$oE!Ks91Nl?`=ba%Dm~uiU`*hz6@+W$-hHfkuZBEruIdmKA1*{!s!&Q=eA|$^
zdcAzH{Xv)%r5BYqx1AU>r3B^aP?dkx3NF)*OQ1GMqJpCkcs@w#W|UK<j3Uf&f;p~?
z918+f&c$^=J!e@xVnbz|Ns~!(BA3Weyx9Kn{Y$aC{p#)3i>lGXTuf;+PK>jj+a&K&
z$QvY(f*!-88Y!75{*_F!L*lqL4iXzbB%{I3#oR$zHjUh*L6MpA@IVc~s)_Df*knwS
zStsmh;pDDu$c9akuEN2LcBW!-*Ywp4lUB<RL>d{?Iy`-_qrnZJW5uKLV6%HuJ*DM6
zU1u|xA6524P+JE0qk*^$3K9QkZW$XIRj%olW~gqi+p#PQQL_pa2g_E}keSM=jv-mN
zm|@p-HcUFOU}?4bn2BFBdPez0s#-p%<_B-lr2<KKxe52;lAprjRR$tsU2ua1xm367
zed+|1K#m}vNrx;xO8Y}6c!ECObgO>m_3^y=TsKBV#Z>dn8BOwq;#9OWUo6&1CBf>a
zt-qZLE!T18#*0%FJ%BfW8G547>D91Y^DVM)dE~Pad&Hnfr8=SKm9+9#wX7^3{y#E;
zP|ao1Wd=rlZb;yjkLrz$u%`UtV$&MghR`j*3l?<sQf=UhNxhS6DkN`A%H1^SZ;6Br
zB$ie!6AY$7`X&9<RLR7TSL*SWPF}*pNu_msb=gw)=$m6EGb+!$7RQe*<43cK@{??}
zb8Lz=N|xeMx62yS$>2Jb5jk_XRc-%xy9^_NH?cL^(q5y~R-v&w;#YJhJBxDQ??yxP
z5uiqC%pc}nt<r}h^0Wi{>`wp}RK`4wO1$bdmPIVKvRbH2bCY-mCuSZ1yY_N-aRGOI
zU)9H*4&@6>-D*^*P`@JKr_ri(&55Hv^|PV0>QZZ)+h@Z`t3I_Nvb24z*5d>!Z@-!B
zb@g%A@4E3)Q)qc`8;w>AjRphUcpWTuZSazJRkVdpS(}Z<{W{XFwBvH}<nnOLe!>e&
z!n~zxNJRBnSTed~Yc3&k;xv2OD2|1)lj-X}jg#Fw6UA>9yu50-?3Oy&$QlhwT5UE!
zPf4o9(3AH><lFOR#={cy3wL07b>YmwvTQxxljv-5ym1%h;O!IOmoh8Bm4m;UWw(fb
zHD4*XDwVQDczj_-Se(!E+Yi?Y+E1A~(XZ^$E~heTY^0E)IS{=HBZaZb<{3*W3=BOT
z^t85U(7aVQBg28~vVg7N_-UX0^0tg5B(?qK16e5RJ1x<pP?%tRG0EbljN%^5LUr)e
zWbVj(FI=g3XTD^%IW?~DpdiB=Lbn3Zee|k=^GXkfNpQ|jUH|JP&x^+u=f(J;y42mx
z941TXdkvtM$Mk^1BXlIGKtlo9tK`r^$<pcO$BpMT(*m3Dv-GvR8h5weyxiuj!lg&#
z)gno(iFL7onO(&b@w7rfT{?w5sbvC8k6Y0Kb>XSkS*y0eUaos8t&8<4FGQwHtTatJ
zA&qXGMjkjfMOCPN38%cl!4(y(z<cBQP{kP=&Bx=)<S=zOR9VQaa-IRgYZ`P{V?k8(
z1*T{s$KV#AH<nJ<EVy2~<`k-IR4+Y@<iZE_R%eqWn-7lhpuQ`7I+N^#FUespbMXTa
z@FI@JL(aZI>n{rlx}O>jPR_z~2z#s3DNwv0kK<XXnyKjP5Vn>&<yi)Or8~JexR$6R
zCp1t_Ph}P;UMXVCwR`Rg_xbcwm;#*45%ja!B3VivnE5_C4Iqmk>4gyCX#+rRp@N;d
zV*c#!?!2y%<@T%%V5;VX;U%<dj*+JdD51VemFNCSEEKC%x*GT^1+|rOlKW~`yC_g~
zf4$0XE4u9TYWgg%SqH7dVV)K?uH8b=)$Tw`HqjLu*Q_5@t{cSnOD-FZigM-ay;BAL
zrN7E%0pOcZ*Dz1P0_)$?r{d`owY)vu6i+t_Ldfu`D_%IW-vc+g;dt$VgzoTicitZq
zU*z!GK(eUM)D0kQsq(Chv<Wkj>(Xtf%B2}QUSwg`UBdgk!+dcz`>gJ%dh4k+o=rU-
zjao$rZ2nthtFZlAq!Ah0L(n8CE$Lt|PgB@~EvOhrD%85fO8x>h`*S#@=hP=Wt<c)!
zwS(w1=PN6Cdyzk7zrH?oe~YuLK^Ic9DV=amnMQ&qaB-ozSdYss;bAeqN@3Fkk8TkU
zo({5+FOLzazdB&n3<ILrkr6o6>+NuF4F?xSoh57o7B1`D>iAX(w$i)Th$9NKw9{+G
z+Lbsii5taJLEMu5@6iCmA|Hn{ih9(?Rc59yPBmf&J}FZ?QMbu72RpA>t<0L)x^<nZ
z?PY5>I!dD~!w5pOt(zZ-ji+mX&)^tV8${g=i%RY0F&ze{!&{1os!O_&9Pvz`+x)E^
z<x~uODU^!gPD3#aXQAE8V4P%;-L(BE6;r@~sVpwv!6IuBTLw{50kZI+MLQYG(jiej
zDe>~VY&#xWwPSy-!aEEQv>0OWB3Q*Ut1+2g#uszhjwoe-?jYATASvj-<sh+7AV-V1
z1(3x4&g<>B@AsDmjr6D601VW^x4XIVMBZG~(3sa0ZCg|%TJPWd`0DNRU$$R34dac@
zI26xc?QFl<7qV2#k61hbJudd~QGSck0XxiU-~ycF9SjxmWTLN};=N5nXD@*Y6$?8Q
zn#JCy7ct#v&_Ey5L*2$om2h8bS|q2Z==?)*!dl&yl>}=PPe84`cnE;7B8Ne8RA-?|
zUW>s(_~O=RKB0gR;rQC@BZJkJ=bE`3d&6QlVc9NUA%vgfDM5<as=}0li>X5rPtx;~
z0vIPE=sm_1bpP0ScewLr|M1C=o-%8_$D3BEVAEHu7py;Cf3mi@Zk1i@`N}@+_14xN
z_quDFPd3&cKi+uKePUMHT=!M#nniYAzdn4u^Tvx(q1@I7Pq~ls5Ic>gu+ocju@)St
zntS`Zhg~n0g<4O7r*^%-3w)v8=Ela_hE>rd70!?oL-9FrbRIh3pPx>#2>m`WgkFkX
zGo$#3&%?q=Jc~a^9W2(Fh8K955GJQl8ng(C<aUC+w6UBGhXu%q>l_7hKILefsD_YX
z8K;o8GG|ek!locY2cA=%>JYb;npcgs1|VlZL7S!Frzp*$l7%S0#|H2K6)!yuRXm9;
zR_$Qjvix3r+?QcF)KLL{V6Fq4hmDJOxV(X1P63oVBw;x$5xJ0+$Tg6BCnqJnk_<XI
zC}XfiYY{syT4~MU%tL@zNv!~{miXqoAum|MfGk=}#DS`-xSJ+{E%IvTz(tf*P6EUa
zV_PmXDQhRoR|cqIfU9r*>+9#=>_fYtPBshs<LD9XogU3$N<PAk_amI&o!;tfFuqnF
zuoLWVZm#3+;PFP+{EeTr;PK=C3f6-jOpC|8H7M8Xc6%HDCAv3+W94U#rWPUoYu=wv
zX7h@2HShmLKV)b+1W^Kux)jp05Cr&Tiyd+4N%9Hz$U_i^xfrMSozw8VBNu{B26DV5
z)}=W_iG1nq-}3Sn?gf$wGFa<c=Q0d&Hcrk8uEXZ(6bMHQLNSZjrdn|k&N#C$v<mYr
z5e|()YsLGN*7<bd?H#d4-T?Zhp5cOxs#r8pi;$-(=P%I?SFkyngDzHdv35g(6c5qy
zGY+RyJe;#j6^ePC%oG7CU9@s)rLg)^<cb~G$rTr!$9{iy7Y%5~Th2wqSI*-X??Vg?
zSB-E&X90FryEH@CD7xIc@}opm!*f*?eGVQhTAw3A9a3x_v`il1?V2*@w_>HkwBR7>
zt7L0BMxSl7sd6NFEIvw=tL-{jl#O@;mkd9Isza|)TC^|@JKk1+)=RDkX?FPCr4KU4
z?>?^oz3QsMbvU1C(Tw}?(_{u*his~Ov;Z}YGEjGk;;TaWhkq*dKU^=v)6U>1P3F^V
zX+5x7|Jz*KeB5>PzhLum@2mdzB|hc)9}j*j*W`Hb|Ka8C+xPFp^WE*O{q1Lb7>5U4
z6kTABDHAYX0dWkQc!$v}@&xUDvHc1J4R>NZ{;>7pg?=vXt20Qmgb6@i^z?%JY`ezl
z`Wjbw0AcNt)ptyT@P6;_RR6wZ0&&O?&SwdT#&{rP<C-ogJ~N$E;`J|k`%vX|16te+
z_~;n39N=e3dcuG&0(CvOx-|vj+h1$|;oS>v;|xvwX*8Rs6Ol~D7nJ8jrQ5WDarq_`
zLB-p?k)!yIFnW|1AI&~dLpS@ytEoXtwEFPVXoQY5k{K0O&KfPry)8`VgcqvA43mxI
zULBy@m}>qVH3%zs{9&afxn~V9+P^NuM{9XaO+5IgqB#bMo1aE$ClE~fy_^`WA95^Q
z>yo(C+T}+TCXu^FS5waQoUiJI68KLIGSIASl+mz^$0<a*;~0&77id*9D4F4v)#S_)
zA$P>q5HGNfU~Ep&KB&r8jQc>WRlFU_%`3OQiy(3H8j5*FS6js}9&zeGO<Iz5H!?=O
z+Z?03j&HCI@E-0Z5b4U;D-kZ_H_?Q@p1*znW*>d-3P^MvFNI#SCVS1AEFu=zSRn&e
z(V^!f0x_?}w(qvzyx4j35;xwcGU0w*3JX+^X-?0gQ%g7@w(2FKtePl@#*TPk`Pdc)
zxGkHZQC-imG4?H8wNqIy-J#Ha7l6$9MM2m8-QJ7P{cLQkR~E(<=46x_<8LecWjEkG
zHEkn`?<STpSOh%}RGZpazI@dfvtXjZl}V2DY`^Xx8zgHw-n}YNX{DkLmH}!(mh*!^
zn!?VDSKF48F8KoWx{K2ZTM|#@XL+g_M~I7c9b9{)u8r;&!|~?EKRO?bVUhe4X{T`*
z|4$)mz@$!s0u-H3VLuQJzpRMVCR_Avk#eCR|GEe6Dupj9Dy$VNoHxQ_rLBNjX>%Xd
zSm|b62J?yjUajc&;gmxT%Ygs-5n4#O_9PMt1HbGw3lf6WB6sWgFZPm39?&FZr3>tF
zE`1*{4c~3Qx@if_-hF|GGu&~G(aF*+<+)i$&QgS4aVG>l(V7%2F@Kj9PEKbAC-{-g
z2Xsj5Cm?ROa5PT(;rMVGjjua(^OgwGwK7J5b@}eh^!BI7GqlK43ZLniQ|(y`bo1fx
z#X@!&6r*oXXL)xzk(Iqec?;|>cQQLKGTQ%zW8CXpNbrXbMV0{QYU3FWPK@fm&!O*~
z7roWRu%JOQIje|@?2b~Cf|hrLZiE=?KSYO)Nu(VYcV74+f*1Du=Td3sthJdqa<}=i
zSO`0|46QnW_!L-NG!TVt4B&W<wBokqPoWGI88r060dI1O%sTL}x-qY`s6$ZIR9aLF
zSeJiV_je@8<bdqF5E(3V@hFalnAHujADl34ux&}<jwu<9(X|SfjwOgd@dn2ey3Dfp
zXhLQOR=T7eW^a2RK#4xVi{eny<IEi)ep(o&TYYOWkSul-7}mV%78YTlKnw!SM6$i+
zoTOoeF5{sAYG+wsdJ6)x;hWTs(F`q7u(ij;u;_802YZqBl~wWM{7Br{*m(SSVXm-E
zYxX<Su;#wAjW6C2S5mBN`ei+*J6s^0l0i7eRX-0;#z;A4m&}^sPRsSH5Hz5)Y6FP9
z#A_x*6Olt&)N#+E@z@KMJN^o+(+j<|<eNQfE>l#&Y*=%$-0Wi`@N1-neuRc)b$d|T
zw%8V_#8;S|s05-v+%P6TER4yTg~^-b%rX_ivOG<u^D*U!mQEFE6tQnSIk`i(X>9lu
z{!t_1)o60AQV8+Hr5jQsnSEO0kWbuhqm_9vYrL#u*+l~}!hjWl*fNWh+3gIn70h)%
zl=ks@>jS0$!P{H1vmdYDnZq(?z%d~zjAw~f1td`)isR%g!V@smeRAm{X>T-yR(`uo
zaw1mF^aHZPpz*%-W6L$!XO#xeDqOmL_1<PN+`R&iT?U;lW|OS6`ErGTEA+5}BKwuk
z>iMI(msYaO0M0b;?2sm3h(9+sH^oSNT8P+N<9HAWy1C;uEVq7WH77U#Kok_8OsW^b
zd@M#i@yT2tKbS{oSi(l4;U%@}U|DXc(^%`<E`;pW6<&;x8R__@_4z|}K?k<^xHCif
z$QO(rivD~?+a5Y$rgU<H<20Eh^Gq?#rH1FyYjJ0sUTg#SZ~w05nYwpmF(fqBdGnUO
z-4gHJ!m!kgi-uAWzy-5xJ0b~DOek%~b=-cl^?I8u-DM<2{qbLgoK1=8z}Q<r-t=h9
z-2IEBquHQCANzK-!St8V9?1`E5+uk~%eY~NlPz!bI2>w7<rL(Omm1iAwYgG1xHmaY
z71PKb6e;vbw`e#xAD+M3+IdZbGZ=^QDQ#*DV`n(w``}6=C?0#S$>Q-u1z#p;9+HA0
z_f%niTxCm&l0nv153e_c$NcH_t8mM$`O3jo@Sr(!*}Fl7Q$T}}vE47ot;Djj^0<K=
zz$7^vN5doD=dAkL>S0Ye7@2jFYqpG|1RA-fs%?H)^1MHg+Y66tMy@X}bm+hI!9O37
z8}zYnM4__GyDd<F=w>ji@`?0eKT6X1l-UozvYWcXu>$%A7Gu|Jy-XuHxo@_)UU93f
zG^uVA?qESs=tVb=eW3+#IZjxB3;yFcpm4YJdK?g3RSGF3(R-$tFD|l8g@wmQ=m!r2
z8W6pptt^YQo+~U@X@i{0HCW6tl6DlC1)k3^NS4tWZF8xuwN<eXJOQiFJTv?wdiaFb
zHta?jF}Qo9p>o;!kgxvR4tbM!Y?8~`KH;Iq4NkdUlPSmZ$IqTdZck^n9h42s+F}C(
z<e}}hxuh*R7;DxLm_xkKU=)R(XL#0baCp{kb9k_nPhnF!#sByH9v-UT8M`!|0!`yj
z5zwCI=U06#$NsCncFX#juJP}qcT@mgvn($I?}6(pR0{2y!pp~#YfJHDPx=(INV%24
zTvLPTcCw`8EE48GdWHo5N@Iwnd_ta_Nxts9T}f_?=QX9|pF=p_0c<*~6xk_L_0W-y
zrQCH;@rvCbAkLPdW*!D=9{P3+B^xb{awU&uO$E&!j%zqwEi}=!cf3N$Yq8&YzyJ2D
zh3nr|W4ht#uS3|>$$(y2MZXZ>D@Wx5z{V)&*=nVzqpqXWp`j*LL#Pi#tJ~?8WN|2?
z4N@gounMh}r9hQdT3`e$`v1{J5u^W~k`!Y$bmHMS>Y#t<SBr_?VzR_^FofbA60rzK
zG#>E^3wU5kPC5)mmjRTmD|czs?#k2Q8KU32chi%~vJ^C)Q;ScJFFL21RlwK{t*@4*
zCE1#{N(*x}DkrEBXzq?P9S}I^cJG<vafY!LvxK!KB#SgFohC!{8cwP8Rctz<QFw?6
znJ3nM@uAV2<0!_F>xh1oI7?Dt1@Vlt8Cvg2?`5s^-s(4hlJ%@~x)!FKZJ?-~43@O3
zF5NQ(N119HQU)jB>@=Ju9{qLW-$;Mua_hcwLo<IHm)r1_i_GjZi|NC==w-VhPNOUf
zk0MD?z4$MqDLnPK5?n`Bcuo?pSK?=S18Zv2DM_B^^E3nS{Z{QlV{KXdOD&W)p+`z;
z^QHeAA-ST$A4B+!KPlk{j^i~GevEg7$Ut$UL|<Y<wLH-;VQnhaqi%AqwFK28{{@en
zs!Xp_yc^b!#1F!B1h>7HFjRb@G~Goqn!_AP_UPbxDeHOf!tK2I>8<$b{i|0PY<@cT
z+$%aazSBx@PTp9ape*<zfK|!+q6f>6_r)5lC*Bw9Vr0Lt)|qp>Z_}-M-Lqf23kp<c
zk2J}%dKo#lo!dS2eoXpH)_U_6Z+I<Qw<n$-hv_(0u&$TYMBSNaT4w8|;pWOv5XZgg
zR1F$({sBPu-#YjWH`1u)Q&2ON|0EfF1$-k1_`do^-t7bRZJj-}1N5?l9^KWW5=uEi
zTSo!a<rGtSpsVJMJf?euqD6okZAq)|gd4q^S^K2gR-a1nh(V23OI&bjTB?Q7ZhSFd
zd2@Qyqjs|h8W}D@$UvhkIsF<)2VVkd?jn#~1hNZ>e{~;?r{<!o=>k)9xf$8=EFh-T
zeg5{%-uu_vyU*07D37r+62m0o948bp>kC~dxlh+g{1iWrC!>UUHPbch4G_INq;ln2
z2_*+SRH$ZoNu%~!nG$1Gq|_Vv*U9{}kEEN3!I7!DxwK^?LcVG=*+uzRKHmoF&rPzR
z3CTPt<W<V!=a5P&%he&|pGJ0VTcF#)#)`ws<0Qw{H_6z7!~>~LHfd_v8z^p$k^uRe
zDNHMBvQ+7o&2^Ut8TBAr7+e!zXs{04;9rHId;ca3-MG*4)vdHo81IrEn=DQ8iY9KN
z7FdZqtBMPD@s>$r4%SEKCKh%$S0|FI8ONW)In$}s1saQ!QD>e-opjjmOtCb^IhiCf
z>hlP%?Sa5J3oo)O6L(MW0njaY!@|=j^B(b6&`r{A;Z?kZ=GOfmS*Ch{W9Tcd8tM7e
z;Cd5&Dz7-9Xj2!Q8usnM)4Exz;5$mEJbg-qR$)XiS0(1)0fw;NnW0I%O`!)#TXuL=
zq}1Y)M^$YqeR3$TFM%5MU6s*&DM^GMH)ZOjJ~dbF9^^@5UBTFT`;)Xw!(Y3<{xK8H
z5N@)>zr!?ZCW__$vwZ#;5n%k2r(2kc{i8HGOXFGO&P2>)_*0VpXuKC`<vcF3^*l`v
z7Xr>~A&*95Hd8tMOVpgH(s8T`cWA8g2n$Ldqs5A}!5N*qQUroN2WO@rHyEsh^F_M5
z{~T<u{`9XQuD*zLQl=C`An{L+df`UjI}I}wLLamA6DHC2<tFALhsOyfoRH=4i?<Yo
zFH)uOi(M)k<CR-_-xY=Y#wwH0B*92pmt7I~GXrV)%2Sz6H+Eitcul6^5l2FwC9<y-
z5***Rsm*)7yg_X)NIzj-woQE723m!RIzK5IgJSA-qf16}e|nLRxb>F}!f2ix!qCj-
z8M|lBr&onarNMZKSQrPcwHtBxe(W6gSv1<waJ883!;?x!Vn=I@XQeTVa2Pn_<hpUm
zVydOGl56E9?O1iC2hZxG9oJ;I3$)H*3>iM&PuMk=+b+~yEIOz9P}pVSvAX0k9L8B=
zmX^da`mMB){A0wQQ6?UHnJoHmnx9Jc`ZC})1l0S~4TVXNvMXuV-%dVAe4Dfa^*oe{
zW>yUD=V)5-kS1>{X!$|(Oz9%CYB7?GvP0UnsXkdU`Ph4(0$h{aBG-x%UUozqYz~u&
zr#)kwxk8f&TU8@oKD<6$@-VSvQok_t2$@bg9eQCty<iKxj|GAv3uq-s)#Ez{YghI#
z<=<{|o9@|@Z&Ms5!&4jw3>P=dz|EO_rT)l+j(dnflBUsMHohqCAWF6gG>{!i^HQ=?
z(7Zp42Qy0Hr?o0Q0hFG}M-%StY&Agjn^_y=8&sfg9-$?-(~601E^$_6{-@7C_iJbW
ztjYh>>uv@cPX5o}@#F5=*Zfak;^UP>IPNViR6rFTNOkED--t_e87X8yVAZb;?+QBj
zWj0X0S|D56tU0+N<}+$=SRGaxD&Dr8j4T04F!jSM9za7X8>YJ-Nz(Wzo`mDW)A0OI
zxy2gW-2vyJ#yO05S;<Ug@dMYb(rS}ab~bELW-T?^BNalY@`MTBl4T1?Os$;RWw45%
z_hf-u4E$z(tjj7~5vc6sT2OTthN<g-<a9foV-lwK6TI~Vic5lf6dA0ap|<xc(YbMN
z&o!^Xem4SLOyk=T8h3Yl$Nc?yb~^PjE<Q)6wsVh|Kh(|Vgtgi!K=qHk?R{o%@eee#
zq0cZ+iurVi+m;)K(|p<Mii^^hYhCfV+^%qWE-u99E1U_RIsXGyax$$KpmF-Mo4gR`
zrA=1TPi5iaaPgq<$Xh0F!Z)lD5os$Z=^WC)miYb%RDu~F(+~ou7bFoUpizbW!PT`P
z+IjPQ_s73~F`$qD)NwM!U4Mr08E4_S;MVC4Y*mxfDcu~IhH<(C=jlXt`H-KV6AuEf
z*~#nhLo?ZUW+$<8fdBA8g09WuxPUAUqoI!#psdl~C{s0-XWPpJc12fpGzYMC4!Gq2
zZXkAw*x=Nz!RGTIOotL3`%Z8vCVa^x<3xFU_6!=ejw>AwW-yUq0|StNpuS;L*;+gM
z6jJsHyCC69BCEuJEi2lW%S-WO(VOKXr%`0le0|JvfJ=+PC~i<v%pkz>AUnl6ln=|<
z*&fif@{wmOxECJ$piyCFsa`FsyxgxKA=&lOl1~lu?WH5qIhPSR4GHU=Cr2Qkj|)WZ
zJq0eRA)rm^^)Er`ioz1yZr!lFT69>($=MellyUW-^loKPDx_p_P?{B%;680IS1Kh=
z)pQ|c5p?#<PFwoLXAy|18yT}NBC=}7tkFbTc+7Y%{V7IlTsvYF<hsU){eiO#h6_pm
z<^zod9(kdz8_r@htKO8NJ7F#Inu;#KD6P1Yn^YYq=S}&fbc9RcC95^|WHGhU(`lYi
zjtfeg5PfNON6a;g^W~%-{Os4srZ2+4p=`NXX$f<;Rzkt5a?AV<V*h6N{nf35I=*30
zk+`=9>e1{bKt=Nc!21YbMK2LF&#_dYC{rW3kwFxA8N2Rwt@otK&U8GZP?{pZ8HIc3
zs|BWC?@4)KlP#%-&b7O!rK>cWjIK$!2iU~9=-{u5Z*G}}(8;Y6u~{GEFVM%)wMn(e
za9k|X2QLzxg~#LeIvIb7PL6JlS{3t?GZ2sClc<TE_2x`A)OoN`Aqk5TXJY}3IQ5cB
zQBG}jSlz;;m&@5~8=~o1t2DM)@8X*4)$^Z~d3SJ(#{W!31mc4tOvDNc7rz_+Q5&aR
zjU-cJjeS*D1HuJ8tl2YbRvIED*A4*b43o9eNs>H2fF0$WCaW~wSJL1!PPhJrIw_#V
zChQM9K<8If!Z-4W!LHkpb<5$tl;<pe3)2`t9*9p-n&FuCLyR4TKMY{Yyw|Za>jfSd
zYMZYFCSWyQ^pT*01LM?47Qk~OnlQWvKQP&Fjc%-BWoTi58~!p(c1<RXUCXy)@aEI*
z3JiUSY%mKhg-3wra2ui_E`?Fi*X(HPmduW6lQvQEWg4b*Sr7PPsbRB4hG*PX`{9rU
z;sB(Fk0npJiTePAKzqL^H}dnZD*(m;fv+~YPyndi#?&Au^E8ZsNqHu~v(q>u5`^i|
z?T`RQY`xn6c|NVPF)v~!rG_3?Ts44qC8Ct94ORc+5RFnqhZqn1P?WMS@bz%C#f6P#
z102uNWO8($XV-n8cr~`Ie>~sXeW5%<uDuQzpn7E^9Z^&KEW<uhUb1VH#Nn9Ch(oIm
zvUj&%%T(bRnS1!2569q<r^#`ql8N8CTR=H#6qHQPw?<R|kd?8nrq#UYMf0NPbpUu_
z_0#{8D-^yAU-cY}Kurjt(n)jDq8+y%rp>7~IB=jgs8lIG%LvtxtZ5tv69XeFQ^3Mo
zC8voRl5QYCNfaY-WG(w1T(;i4+`b_pBEs@1CHkfB){3a;ck5zUF%vH(rZqk@CG~u@
zdR4XjeFZgr`FaX!dh+$t>D6>p>;|j!3Rlk1B#nN+RF0e?1$p%?Os~#{sKf$l`RY_6
zQK+y{gSD?h4bBlpE^UIbm$NpOVUfy8K1N)uLO>N9oO7MI5>E_ChSA5?Fu<jECi%5*
zk68TMzqT|P0u}lqlr)GwEg(>+YDvYKnO@RkomeU9uTHX*^j0feyq(>cd?_VgoroD~
zvE){3A~dWz4F!!`=LTd=CEryFf(q_wB0yYDUAWHjatCA$$sCkD7(A<F&NUT1TW@}O
zBn8kf&E*etc2XvT<h$~nf+|qzM63!_I}&%5#68JtRB7~qr+n3Bq30=IwGY88afJ$?
zUDtO(gSQwKZj~xTy8bFnaB=Hc==iw_xQEsEW~w_Y-x`hE9q!Lnz-x0qC8SZox5*bL
zzdleuHC!V{Zrxzp2GX!%dc#{wl~9JfT1@5n0G6*AC5@=gO-N_c!$^H=WEQ5LdIf9>
z=)&HzYIO`#QI2wD%iTiLPKnM&9duBl8a%l<ZUUZFvD2#@lR|m1>6W*)<fUV1opda&
zHad>ciZmp>SG)e{Ww}H{DX&f6ybdN)8^~*6u5r-3GsY$Ou)x-?F*H2v$>|K@sOt2C
z^ynY|zW4m??)D?CSnCITPq==W^MLLy)<CTBJc~a?tgkGv2kc)M<4o8tw0X9wcg^T;
z#kyq5D66|BHmmBA5u~i{I*rAG8kW^Uk5FH5Yv90N6)NR&1h@|?s&7`4?g-G2DykDN
zu2-}mO}>;&ARjA-i=y+UTm+O5C4;d-OtezRMP*~T(iJO}q^RJbl{K+a$wi|Iu-C;(
z9T(+T`^I3U$G9)F-7COf$3<1uH)}{Ys)nDKXr+padM+2q(Q^2R#2=;KVMfXv@y}`&
z)-M<b^qZqn5!cM3;s}UJb}Xy5Su0m61!<>}7wcy8vXwiVQkIoX?j_K{$*~j#drQ`X
zxwKrp&H7nfT9*aa(xWEl&(hUl;8y%2M>8p&Okf{VCzwkIVio4VY7^KzW3hZ)th#cY
ze(lQDDi-?{{kpUNGkx7#RHrHju@4I10GN3w)+%%#ua%?N7-kB^#`><k#MLL7TTL7i
zyxMuavwxG=56ag~4EZHH?A96iDwb}encg+DNUNEkaxJ~$hxP4rYZ{_Oxnf;~mKsy2
zT0byaswL6_Ej6c8T~juxnzJhI_-|w0Mgr5TY?QA~8#y@*02<8R3fgW!Ym2s84`Be~
z<ZrDBnJ39ahN?J?CjxVYh3D6}vu^=9N|MhQNyvZOYJoNaY~|W*yb0elwgQZ!^Tw8d
zt_a7|<4};L2je#;3EBaN$=SrJS^RX-mjJ3xP_Cd6r^`1V;rDSo9@o}RPNSo+ft}&i
z_6O6-Kwsg<l4b@)n`@XFh+ar7q?N_u(74oA#cv<+ZRNI0wm`J@H}l&^EcDw)EK#|S
zCb}clB~?pWI}#5nw{Zv!_DCqYvcPDE3U(^x35JAG?Nziy<p|BH)(9!ak5NT-)7)p!
zuh_){?4;I$0L6{%-)|qGZTNY74O4>Vk}?KaspF4w?pnbyTB&1-I(ArLQdV+AJu|G-
z^MZkhr#^AON@E777-&YQcAsyL^$HHPs#z)%a3x=Or<vmzeg+I1FO+$`&()(-E_*`w
zEV5xUW+c$#GykeO`6+K<h4^lTM$BBz)nBfZ*P=WeehMdpYUjx^VQw{C0QRY8+&h(|
z?RsiFsN`~g4G@(J)`1$8{XFs3!FgJR&qisj-#%8Knyi=BTv@#0N|PRa5_zRThdvxT
zb(I2NXP`xb%7&ih4@?d&(?@}Wm)oFP?CS-uei@OAaifh`Go3|g<_nmryb6nksb(M6
zu$^9YJEbJ@f>iCiR7xUGTS0YO3o3azfZa-LD;1(@T}XFP=}+V9pkce~4d#rVGVuiV
zZ}CuIThb?M8VxAzdZkwH*+KD?wYN~%EN!6FA@j8wA<1?9X0Q<&^y@YA;QS_9=@eS=
zx|Cac@A^#_?Ml<=)Y{2j;wBwrt1m=%abp^wH#s_!<0Tw{iN~X>LbakSSB~<~#zCPt
zpTrdH5p9I54WL;yu8R6#16wsNUrryr$}`N%P#=F)IzQZz?uzrtFiJ<`<g9vCb71HM
zHBwJ{<u`)_9S1Qw_QGIn)R^Ubp3UX-01+}cCfg4x=<fIxbS(##n&UHlQK1<ybj*TL
z+vDLv%t7_)OvBAUfUXe&Jg`{^gtgiOLDyNnmI~D{Y?P2;fitcu=G2>X;EZYo)d6Cq
z#xpf60bmhguk>pAXi91W%__$Cpc#mjN)XD}Z4oqs>Ld5&Ol^&3{XF+kybj;S0(c1P
zVVcO~M|6I<5RX@LSGRQes$Y?B#TxEFzpO#r*US<&aep&qX7K`@8v0&4iVL~6{>k(f
zcDKD%wS~F}s#m33)>;SzR9dQceT%Hn3`o7&(k+sr(UrZ$)TagnDFTA6HPN4LR*&28
zz)^R)daL48!ceuqEFw+czu9^FW^W$_X?PUI6L^TS)C%uM*TnD6$ekDAjwgjX`Q^^)
zVGW$0=M#+jJww4Z%w~t!VZb#Tq9|+CV)^JFJ8$;4cOU)Z#m-MZm1BEdtRw>vS`9Ff
z#p4OyX=q%07>`E9(v`zY>m)lKvB|3mn)K6ur;lEjT?V9=p4))NU}G6{nyKg~pF{)q
z(ov4HzAD*h*#CGcxI&9zH+aS(Nkb1LlZlq8Z-GI~Ro_Y_w>7@%WpqLVeRI5)zbw0Y
zO1%c<HR*;x`OCG+TdV7?bn`HL{gB}G1XQOs+-0ROBNmi@(gZn+j(}xOBMfcQaJU%#
zQ5ju^XcsPj*>e&oS})g}oQcNEQB|{}>YD3fz3O^#fIy+83jSLYo5i`P+G#eI0`d~t
zEKbSAn(29_V^s_F!v8FakB+NDlP%1_y3rc<HQpFJ25x=|+#K|-&(6!?R04=s^5&Q|
z95QS-Z__J{Yuc<I#1OV<NAq!*()xuqfd(XyDN$X$1=^sLr3hd78&^E$ZwAYVzh!x6
z14#P>hwb{TV~}&}<;&gemzYrS_0F4{of+ZL5eyYx^Mt)>y`=Z~BVSL_Uk5`!P`+tm
zq1kw%1i8zlZ=TdQy3o*WeYmxu4J%zm?0bf{IJ663=m)B1Xv6cyLrV=e8rqUZeb-R|
z=cbCK$M1>YSV{})-+=bTBeo#mcF#>U`?Ah=xA)$yRj&}o(RiFVT9geDg0zZRh5;=2
zy(naESG}rXUTSe~GT2QQ9eXXm*2piXsN9A!;S%`IrA#b7uFDK7=@Hi-)obezjhMBu
z4q>gRH;>l>%gds8RWG2{a<V91D);N)bSN%O{lGxgJ=tJdw6O{i0ncS0(Fv_gnNvXr
zW@)ughB|@zqxX%cpx&WUNxExjX0G)Y>{S&cuw}tDNpc$uw~j?^Y#8aByN6IaWL&L<
zzw^h#-(4R1#?-Gs^N)kRG3{>;`c4(|n6;cUI(NQN9@6?nh+$rGs$uYvCe$h`=bYCv
zxc0Gap-w|0Yuqt&D*P+7bM=k?TTz^&nQtkbInZXOWeu0tT879xxu~|RJ6+m%os-L>
z8vUu%p|bJ$g2R)|`?EA0(4iU9XOt$VBA#W@xH9RCN8VMjS(AGl*FYj1A0;UiKgDo)
z|LzABrG)%5%=UaFdP|IiVH$U%@89;Qgy`e4)Q}BOVJ~}$XDAgz*7FP*`gE31rp`bW
z73~|*!b3QkfBsyPy&lwYaf#C6cY#)f_V405$}cA_Df7<nJ}0C3gv9S8p$y<*JP}!;
zOqix2ALnKu77DLvYnvXGzMITX58-zvK1S!$6f>m2MmRa$ncz+Mg9pJ?(J4t|5;G<-
zVA59YD12fcK4zyn9=X+Hx7Zzia^62|$KDd-a5_b&7Q(fv;Ms9JjsR*ChB8<cym(bm
zg84V}v-1PVfNC}d09@RFJH}CI-FQUAr0g{n04bod6>ROE69?4%Tmj%&RMV7)$GGA0
zX3H_ak+%l76L<?3oA7g|%&GHnj8P(U4d>%{98HcuPif<DABfBQSNvCTV5|w>cG}~)
zGYL;&XX{q3P%eK&^-TQZ-P?Cg>ZisYG_@=HG?}99AIsWcc|!UH#ejZ(4@)KVIzde*
z1?$Q}<s%ia8_S31wdJ)HzF~Q7>1hT}xkDI_32AVAy~o>#+~@qd`}WPt{lCB4mVT+S
zbG#l^u{vlT;cJHV%mJGr&_32Y!8PmP^s!IrUA|hR+zhN1-vtyt!eqK?hU<y~57pc<
zw8D}ozOd>PXQgLCYTveIQD#Zx4AJ3m7-x7}6X*oR4hQ2Hq*>iWG)UrX^V`s9-(**@
zQGq)Z2yqekh!vq9M~PXYIi`PIb8_<4H^)QcZ*Ey{Ok?~`K}g3_|M*pIi<ch2z!|>M
zf;~)Arh}$djx$Z=N>T<5hnbnbzO}}~!rLCsgH(6FLzQzw%G==e5W-6EdNOoT6P|9;
z8ZR3+h-_dZtICuxY8DL=%o?8ymg6vM;!Cy&kE%tXIX{+<P(1_vVI$PN=@H5mG-Dw6
z9JtxpZ$04`UIX#)*jfQ=)<3g6ji1XJ>L9t43>DhPA4v;E3{))jNqR%QKoJI&K&x&+
zKWIp!AFsnDU-gAAr!UlwC&pWtjAAy)V%-kF*ZB;31hm$H@klY-dOJzuqj(aI58>^h
zeA=)LzGG*%K+nE0K#{h4S;u^ooyceOQ0Io!$IfYV1p8B&^b#iR>?|RL=OKD3!ygY|
zfjORq{c&WP2XYI%Ak&v+oy~3PrU5X2iop_%$L7H`yj^3ndO#%^$2{|#gx@$<&f$M3
zvg2evrtGCE+XEhLp>cr>YBmCFGT}qCNpxi1Ahx~HFoz8+WBQoLf}QPmSj2Z*0(#`8
zg@b@G0CzTmO$&?D_*^NS=pG`+lo-Q7fe4yRA~f^BzX1LrZP(l)IHp*nNB=-zb$c!$
zX2)qnS4OcV_!-d89{pTHKk#nZkj;|A<A|<xBP7@rxAp7x&dZ<o_b?)h;YF@VrmA(7
zwFXnzcB{sj6CGz#`7tSRM?B}@R?Mr`pVQNXFYyvf@K<FedMKt*I!e-0qZ!QTOMN~R
zgX3s$0uREOk;D)=bcRt%7=~46J}3g<jV=9(B+=;*v<MnTNpC26;1=oGMWCg;NQoi0
z+>)zIliW3#S<x)Ga__*g4?4zAqh7CRy?ot8n;7=!KFIlv1urMXCY=f?A$}mMba^49
zg<Hs;rATv-9C8RO(k5e>S-5MGliXA;Bb7VdG{;k0t~K6!t_CB)P5<ych-lf5t%g_-
zaA}8dCeNEbwT}!j@yIwVWjjhd5_8H&Y{Yyu6$r=ZVk8b`tBXN9vb-2aI_7N$cTmb3
zG-SffG?<^Z)VIe!P1*69@2aN}F1DXMtJmjKYG7tgR<$hTuk55(p7&PHE3@FKbjvWx
zp39;n>!7AB?Hq{tgjZjjYlc8`05DqXRV~@1X+);J=8fjfka8hXU0zj_N?P7-629vW
zbq;+s=qc!+F?zY7=)y1x*pl4Qe_>4W?A=9#%$(hF;x^0IZA-Vk?R{E^VI|4LFu^;{
z;b0I=XSDW8W~T^Ju-s;X!*vl56|&8Z-eBZcZ?#0&A6Rmhf-XQG5jK*+65vU4PD0zG
zv*QYl84Pi;kV^Yeh2no;20<#c$(nt`7OAk+9-Z9j4dnOVi<T_ga&>__;#EAGk!5q1
zh8Qp>gbmFZQUY`!eU1!@G7bXjHe~&jByu)GP4+vzjm-sWF&#G73(KZfyn^17e9ffu
z#Uk=*qf@}X8OYs*0k&%pK+m25GtW~{MXy*}%P}BbjZa417gr8$Zjg{U6l=YooJ=re
zpJDpbwmz#k>|=A$P_)jl^l5NjSP(O6RKoeWd#>+2oHx$7%Ma)2OqpbjrE3<->63Qo
z+)<)(z~w2pmU2=zbI#-)vxkx;ikEV(Dxtyh$XZ4RHSgPmQhZ=}a^@(+jSq;`%JOw=
z3k3gDjP2>Q2A9W{^KgdZ#rBWyUy9xBS8umod>wEb-~RjvlqygM{O(+T3SPJ#D}WB=
zF4A>pKfngF&{?uHg48bINPm5Yc2h==HNPf4Vt^evwiJn>UBy(9Qjf9uIoUrvubGco
zrz^Z%exUF}3pe3i=L6N0z424)1?4sdyXO^d@P5!OYt;MHB<)H&zE?J-@M9~-{wbwC
zcf>B)d&GP?3}^oKka)I{=sU66t0Us?KAgK{SgU@T4U+1k=|JJ9k;~dL14fNkk|H0t
z-zx_WKmNh{y&<a<pJ*dkJc~}X6^y6okpY`)`cfZ5jMKbj>!oHYXtYQb|IC+4t@M!V
z$PJ?Sj16v$<CAC)pSNX4#a3&ihe8xr8}6wwLM*z^-C(wiN~z#4t}!K|E0d1=be3mW
zAmtbr1Hq|EK6x%tEy%*$aZz`5&`2z5{Bsa-0sHoQYf<A-j}NM5CG|xxFU74D2fJO-
zw%e`A<b<2u3wraA&P0gb8SZ`clA$(d3;1tEY3edwiQnb&i<RN!>lo&jSArV=XSj=(
zDt&mwTP<p-RCr!fio`rN_5%f)tn%h2ZOV<f>%vrsR_TI+{M%4Qp~1umsBgscrX$35
z;kK}<n4FZ<(*ZU8^^W7C<I<V{dog^m0qS`btSeQ(mer(6__GS$ipm;d@2JyBkC913
zla!^65@3K?shp9*8>eDx8!dwm1yrL@igf<R=1T76w@ItPuzLW@$IJ#SIr*dEQuMXq
z!a@0CAu~9xFqY?kENCW6yTkd%gH}GEw+UO7@`NI=Tp~;5*t(Als*_(cCP^=kPH9qA
zX%8N(R9NN|l{3^!%(i@(F?RJ&Y;@0W1K;m&65;P}5@T4ZZXVz7SZMy=|CxhSzPK-j
ze=?tC@i3w;Iy7f!@wqX2+y(=D_kDpP-`^@p5~zBkbRpH`b~xpxsK9OAAilT82{(rE
z_t!$X%6S$KbJP4Furkro?QF2d(K-HFaF1m;OBME5-n*}~mt#jKnUk$6)@0J!ayzyJ
zu3cfqrp>%lpy($g8&Y<V`6T`)`hN1`gIXNxZuaV}T0{Kwrfre(@dN-ceZ_jE4c8Y`
z8$u{4PgDnpK<l@U__Sr7sPc;yeqPcLb*UQy%&4L8+-V43tnhO$=xOw+3EWVuY6nYk
zNv!;4#Ti;<n9SR#XrQRi-4U<DlSpK9beaoiAxaQB_76`ZoTdE))J$AJJh#3Lw>&r6
zzKH&*7}eY9%ZOb(cFBwcYt(e^H;3^n6s9_I3;u=jW8mF;HlZ~%ih3{tZf9SlHo1L|
zg|CkMRn3+I?4{51<P^}3@}ZD)_!Ng?e^AVCP2HEBqzsbjg&GYny;i<OiiyAeReY55
z8V_>Nztz~_{vf*dKuPgpzfxX5JeNCntY0=Lcf>aN`baD(Cxcumu$6f7DY89mHSwy(
zq>dH1=N)RCC=HaA2UP4!$=u0NRf>HVNK6w!&R|htu`TqCM1DlFHO$0WRFS`Y43jQC
znkeJC8XX~}qL4!EK>SwP1b(oJOe}-7xN<{10Y6F^f&nJXs}Fdf`N8S5$Qx0Knarvi
zo|o43%_jB1v9BZnZ}$;<VB59?5j5{ED&pVz-U0tsxA@n;*7nHsrdAoT@A4jt@2YyN
zJM~i9Na9mObR$cv!`k6FAyLm0x2hP+Mks5TRjATInc`WMQR$CUEjg|WF#T5@vw@C@
zE7|m7b+srx(_)Nglq5k>f44!k7PGH9t=rHNI_;lLC**o(5iR{k2@c6D!Mte6ry{#!
z>&QW;=23%A4qT~t>8eX8ZK;_QO?AhtnOCb(Xw86KSksfHiV3qzsGGDwFML#1=uQAW
zSDwT|U-&DqhC;PUF&@P!9du_=n8NbjiO$2pObr_AIO?dEiQe^uyHSmSuA+`6FWc1e
z0}VvS7t~2tG`mZq={Ouj77*MTJPLis{}ro{(MH*-RpV-vU!fH7>68ULC*$gegA*Xm
z3Hl0W@E#T!UY%;4u`rxai7(c|%Zcq3Vjm2*wz-8)`}d+zh&ft2%B!LU?-mWly@QrR
zIIqd5k@EwMdeFq<flBslRlBsXkBr8NQ*cm8O3UW~plknrASStoejC7mr5K1=dj7(G
z4lumS8{5#K!EB&}DgQw!Cd2s=4h<?gz@#J#q)Q+bu89tpRe3IW22E4<gsFRiu7buT
z#FH|0C)QHoMEu3zYyaZd+@Z{7VUHhM?GC=Fo7f_ba|?R`c@{@nv_rb)FRwsy-4b<z
zO8ijn8ApR4ubF7wgld%wWr{zSUrw>-X<JSS`gP!@%`}^#?1{4eiLMTfS6IiX=(pd?
z=4%7xp=}&n6f`G5ccI%z-=dMiYUrNdGLD}<Y;RAN+8bTRZccF^UhlklDE_ha;)Qr1
zUTnWIZ?T7GsFwA|$>0R0I0tyRfygceMY<TP!MzSc!I7M2=C-34Im~OB$1n?#8-uf?
zWZryG2tTHRI^?8PAtXY|7~F);4+J?<-!`@L;0u4EQBd1jPmMoxfLPI`Z3l)m)FHWM
zF-1${u{ulAlbeWdBtAQV%kPL6xcLd8>L(P}eA@!GZ3W+I#ei`TJql6ejvG@7o{Nes
zrg@|i9i;0zz4Z#AaLaq^QRo#vF~(Tv0;!Njs}1oghoK=7w?UX%^i{zEcfNlAYJca^
z_J{4~xVXewG7eGY(tEKfY*}HSHxi%X=nQ`=cDW&0U5@NBLZUP#b5-nQPqgcTpeUX5
zp$>nN)6|~vpTaZ_hZsH!<nt|1P2SG@6poLeDh3bXxozFPY(n0~4SAwRYg%>!ifBMm
z^WX-Wzf_`}gRC})cytLpmt@V>gI7IbpQAJ(v5c{Aq+q6{ll06{Jc(z~_~H+k0GeQa
zvFKkYOUUVuZk3P3pCtOzEW}XTt!$i}S+}3_OYUZ1DEp0$4`sH;kqSsXQnrsI9Y(2T
z>EJx-W^5cZT3La4$oyr1ex2*{i(cc-Z?}=|z}MU8Pc&ld3vT$Ncw@Y=TS;XM9+&To
zz1K$f0BP5;BcE59S4<nN8J37ghVJiYK%z8_21QfLG>tx~_}K1tU%%%~trI-kjFiI%
zD{izLEjx@zG`=fCcf=N3<%&U-U?w94qmT|^6+(p;lvU5WPiq@Ee5ZEkrKi_M;qSj!
zrOS@<3TKfPIh8r%09)z=#REM58NIiS@{->8L3Zocl1rZXPbY6iIvYD0$!I*!jzi<*
zI#&l#N9zgBrnqioRUqjf8TXvzQ4lL@*6LG;pf1+UjwI*x%A&40vB^vEqOglLUT(<6
z2EAc-GPYz-#);&3k<c~9i~PoHxmN}Y_2Np;QgT^gCyUhTEdsyF_*MoPoxV1P?6;47
z_&4BMUl2x;Jd4mz)wwYkCD+x#C|>Qn-q~*qX;*C6HQ~w4jeS#?cenqxAlw_!Wuf+s
z!d^bRtHI8ju7J{5%~XFF@wkcyJ0eR5Y`EZnS&e9QIlEHj@y|LrXvSewF-x%x1!T7Y
zcw`?Hvx}({7ESKj5ez4ECo9DG!nE|%1okhWDVsnPuY3coUTWs7z=dN)EhaQK#OA`J
zt*0wHrz{82Zy!hS@2Fl_E)AOs3bQ1=nh42-VJogE=9IJ+kX-%`N|B5wGENvp4>X(2
zBbs^j4Ka>SW3+qpu7qi*w*s8C@~DKCHNURyTz)LrxQ}3sQM?V*beqiSOC#nqtsN(I
z>v9RdF1-5cscabJ`f@`+q2geNdI&-jcGzRz#4&bLdauOYL!~Rx9+w1W#ky@X)uka3
zquD&2(A+Yixg(xaP+Hh{qcxUHkF@zx@&EhLIAPxz^(x1L;@KW@NpX34F^mTUzloA|
z@*GDzvHc-WKT=&e(c7{qI?;3YB259uU=K{QrYIaj6}cz!BcsOx*E^UySLGNfQT7S#
z!qgNRB{X7II#mlV-3P9uxaFF$w}uMDCoYYh&{b|rF&>+4Xpg(%sq#a+YE_s~t{XY9
ziOI<b(QO8iSLe41*}|%z550*d^1xe{%C8H(c)k7l$L(EoPr#C{p|BWW$a8j{hZd4x
zHHc)@B%A@Vj9d?ga>kUMzUQ5<Afwz9w)LdKXsgnJY4M_IdT`*)6(&Jg+z#2yhFBOG
zGV>Pl5)?Pcjs{^<3|QQk(a@oUa?qhT%WE~Iv^x%V8UV43Q@k2jZV3RXua<7}EwZx1
zVKRcHDbB<(06E6fW;Wc}7IQBWU8NCK58QXu&krIzg2@9VCK&o$B{l+nEAIzNs)ERv
zI`n(qrD=*h1Hl(g#E>h@<Lnq@`0Ol-Fz~umI+=@6$cJJwACGZ}rU}e&Nij69r{NjU
zaXFeP?Uwp!PQd%!>yfZww-xl%5acxI)+{YKt9w=xGPhxVRM6W;;<11=MI4K#Ape4H
z`BI~s^etOeE&hIGMI5goV~M1{>BWu7xzGZKpGJ$EDHEy}I-Vvn3q>eMlfdOD3bP9_
zPLh-Pw06D2O740lbsF*Ms_2td6R{pY1cy{WwSEJdkF#hwX#5)8#heH1SBTDuQHn<E
zX_$fn2(uDZHK0cH5a`Wb%eJSi(;U<=nPjAbUdIzm$3Qh6ivE1YR_Aa$mfi<=RNyo<
zO6I8n5dr~V0R>iF9Num1|15%M;(Zojx)12(Q^azmP&BwF^;J5kh-XqC&*1koqLY7p
zc)^MPfSC9Po`e!_Wvfn$J*!2)h@)NWBap#tPH5WNuXgdq(OoS}n(}q7({qlJs#d$6
zGY`ytg4Tg?C$b0tAmgesO*tT7>1BYp!=jl-!7<l0rj%Ddse^dEoM^_*<XYrg3a(z)
zNbRx|WOu|qit$v2ew@TOCuw<4W0;f0**qMH@5R%HKoZ!_g)mFHtKBZb4|}$L*pJ8Y
z>|#OO{oFeS=>zj;B0dg|<HHQlPb0Zl)DB7|!fV#-j6T7f<mp(PsA(jHfqOOe4*o#d
zLRV#slpKa|s1f+#yl`EY_Aaw1C7GBNof=eHX`{@yCGjzN$CH=y<VenaudNpUB6?Q`
zm2o#~M%2FrFh7kp>*mK?$Cz%kPp3V+x01(;x6U=Z3ZrT?2$H1`XbQW3?Bu4A+U6}K
zbNvC{#PT-nslw14lwNTlPwD@z0m--T_3){8k?uVc(<F=Y1zN1gON#yIIQ$eR={=VC
zm^lMv6<&UbKf9U%i$_o`jz|YXqZ5b@q%#(_C$Abee4{e6l$Zv}nWBxgi+oYN?$s5i
z(c!`sqg!aDq3B~u)vuuqk*}QQ3#cHC=%A3V#Jz0AGt2v#aP67c%1&SfI89(R3^QX5
z$Z~B|r_6BmGrZ^zZ_pzr%zP>_&<Ylp;T(1(gHVQjQ2L(J5_wS4DndJFx)~^!XARVR
zs+2~1QaDigFkP3J3QpdF+PQ8vcjOb<DXfNa8ad5K3N+~OS2h;VMv)duwR2#lUHm?W
z7X#?wi0*)5yU164XYITrqc!L&s@O#3l!o2x6aQ`HU>Vii(~efw3%r1z8y6kzg2=<q
zzu3H2$_6!ZAJvSdX0r#k-VLa9+>%&Kt;0_v)vl!Ac<j>x96eCd4b?&Mh{wP~I+7dX
zG5VMt$`hqgIL?Y(vw#+fp9Y#F6<b!DRIp!%>(s|pEay?JYKfmJ^>SVwTmwHkhB%F6
zxl)Ipl3*N7QU@$7Ow?xq9Th)|=&9;+10*QtsKs?${4Am8;>R<EW@!lnG>@U8&KsMw
zyu|+6=%{MT%%fA-H81W?T6?^7_04~M{rtH;bpN80QC{aqsE%ciV2?F>gtqKQd`7T3
z8;q~j2Xg7=<~sfk9&dEb-|$)Qt*@>BSFj%RHa9jN_u%htuiNW&|4Vdl2*=6~D4Jm^
z#DC5Eu)&;Hl&g9FFZx03XNMpoKA|^=x<5kW-nvo}ksXlm76@uPFX=Zf{HM0#77B%P
zbnP=e15-M#(Md4*t>xI{w96-jWvyRcm9=cO`L`$qO&tW)G`zqBP`E#X_8&oCuIo;J
zKGJ^uY}Xg9us;~K$jWBfAhr9WXhSUr5OtI2s;)H#v*e~u3HWlGhZ!=n!Yvg9$`idI
zcZyK0lzBxg7&(-bF4pLR2Tm^Nt}iT18JVYJj7L(Ys2GrQQXG@!_K*OnWXVIoqEN6A
z+VyxB;wA*Hf!acr*}?>kV<dP@b_g@YC(sykpn@t(D}_7w8=W)BqpxRThu++Eo4HHJ
zXghScOyO#v2=sW@9|yr71EI>W#~T>gX@NNpo#+R8vf?Kf0>nRPeTdR{z{(l93J}w)
z4cjSB<rFq@X%_JXq2i@2x{)&MH<=`w8P1s*&LuNwZtw=3V6JOpLZAww&|I0HmIe4Z
z7f<2Co&LbvAnuVaZ~9q~Jkyx5d{L!|ld#ML^svgTDI7*xUOIxg$cENrq9RFSBk1dZ
z{F02|=}mD;Lw<Pi<KE6cw)K6|NHIrp=DDNSw`?F+ydmyd9(wGO09^Lw1IXU=NIG{(
zcYE7s1MmDzl20D@c2d_VSP`HxIp<Px#fyxKp;q~pdf!q*N7W7*fXA+tt-?BJ_v`Pr
z>w?)IgOV5C5Rkbm%&Y?|K@2s;C%g`i7KDOV5wm+>yN6>XdTJhKm7#Dh%%g03Jh}?x
z^ICB0K$Q+nG0Zevg69*=IX1qaNsHDZ92BzVQseUsB=0Oi_EZh`FD$d*9kd(b`31ed
z5QB@sI9e6^#}qz5%;KYCbXyuE^C>zqNz<)kAx=i6?V)@e_P2(^m3t)N2lEvDAJ|bs
zBop}K43q$D7Xd~in9&x~hCv4b%Qr&sGH<MJavz7E@VF(K<R&qn$dr=IFEMEhVdaG8
zJ5YLU6DG24KQX5N9VQOhxcd?3LLbT5PmoHVt87(lF*%Wt7=mC<4jDLZMq^O%G<%4~
zVc4TWO<)#USP+SRgiqASCFr0vTNT_tk%D0`T2p1QHV92R5(qM;*;xdn2Ez5AJ0K^<
zUf@*Pm}h&2_F#m;Y>n}f$n0bIh<qcjylJvIuYUAZ@f`ym8cmTsFF!4d<<SJ%c+hB*
zCg-an_{(b3DQOPJuZWbz|A{P_Pe;0Gj{(5GsTG+O6S-G8kwJam{vhE0WQwz*D6-9~
z{JExH*o#E8MFA8{<Ru*JMFl|2X4Kw+*ifZBu)Mn|Sf(XXP=hng;lX*37xq$UYyZY*
z6skai9|siDA&UmdWSAX@2i7h1CCPVVfKCg5p2FOXEoiNs+;s^2ZhLocXKxA67v{MF
znxOQW!5ggE(+SK*%7C9FH$!qi42a}Mqf{vve9=bGeZkDV;SgEde0`-Sr^6(fbVxPA
zFqMqXl`xVXa3jhvpl<c}sR7E?oDP62chn*n4jfj0W{1=xU#rZ|QFSK;ATa)z%yPQS
zh?G!YRu(0K_VUVG&a$9L*kI|Hg7SpEtC=u><+!|bXkEMuHHA$|IGcro<HK2UD2w4J
z9ir=Kc<QsL6!^>~fSN9a*6{RV>Rzq_1!Wu!X5#*p`&f79ypjEt++5N`0j^Olo@!L{
ztZF&6Zk;^NG%PaApMhSlUv4}1t=+A8j^U46yUtVO=bzrbHJ+XxIpl!Gp&phh^jqq!
zZv$jB8GiokHViYRuI-LAY86_}I8G>HGKj;(|E3?#D}mu+MUdc^%b93GS)tuwbjJGi
zy{k%*!l{jko75njUwl4LN?0zx#U*qKue?2~D9s7%7JR+>ICz1ckp^zpud(Ak`qQ9O
zjWeD~u@x7zsl|R<;<IR>>Z$+xZ36$LW`-<D{Bx-GS@zADHlU?TH3Q08IVeEqSph7&
ztzJz^;I*%*vOBzSE7e(J?ia}O=7V%emr?uFa_O?E8i`Y>od@Fl9B9xJ7Z(?-tK(aF
z#q&Hczg_h7Aa!A@-YtazC8Ie3v!(!OhL9cOpGL2;=*5M-;oskVwf)ALp=H;dJjRAu
ziXq_v;!xlAtZF@;%%Y<x?a(EVNKSyF?c?-978IS0jSYYQ>qh^&d_4s0E+S8CJRM8v
zgsk=X^XG2RTU+1QeEj4o@Y&~<ACg|z0)<=fn^u0@*>6N?6-nCk0Pvc6`tgj5!Je@!
z`o+h7JPFeaH7kC+FS_b*MR5r=Q4cbsrbn+}4BE;DaV%Q@pB9CCltZ|=F208z1?&^(
z{{qPodZ<&f7cOGjTL{yj6w^ZWz(drs&9|qkZh2Q#M0Mvx8C3&|s_RdYs<8E9!UkTd
z1_jvF<tvQ4$?VmX>YIyDoyZ;pOH#eJ5Y@Y-T~$$?4OSp+^N=oe6EGFyDQIJgV?ja`
z1p)_japJjH$aPi3R3CH%5$ejY1oB1~D<-26G|^N($e1!_D;_X-_rHEW==O{s2WB|e
z#TtbDbRA+S@vws02;3}2c5s|U>tZCQW$Omr<?HrJ&Rvjbn6}ATrs#}p1}(R&N0gU^
zMzpuFdH>0Qm#n6GRJh)6rXwia@8>h)87NOy7<}mUz*mk>-O5t=kOq4SN{pPut-t)G
z^Os@vm%j|*kE|uy+*7gAF&?hzGjW<7ZKOq4Rq<uOn1%7!S4mcR5MXACVl^zHYMq8t
zaoG|rifXD<OT?f}5Va-7ZS3m6NlW95x9nBbv5M9RI)u7Ro_bj5<xMLaM;71uEme!?
z3VZN&4D#(_CbRVP@a!7?tzn#6JW(+me=Swv|7WNQcweAH!@3~og_1#`WZ8OGELj$r
zt=Rk8feHKD`D`)ZpET|$@R)Ba%61!!XpN$>wBoU-hO^`Vd+@&Y02fRCOARorGaM!B
zM#RLLROHm%dS2kPaiUP3G$==+ExrS?duz3-h$4653-`6|=_{zh>^Gpd2fO+KsFs?R
z81(9&6$8;P1GZl|4A<zfbTDd0e(5fQawJFnYxnrr)8o1wioSp)G6Gqs7G;D*gl%ta
zy#PT`-ZtiJZ=_Mx9)?<}Xs-vbl#v<Md~%YQ+?99LBB7flmw-t!JC^ad%NGBe$JNKA
z4I2z9kiAWy17AR<h65C=-9F5l9+)?-!Bi~-24_-l@p<%x_xX;<Ri{9H7>m38rFQz5
z$@CO972$ZCoXPvEUVwOqxDoX74Sxr={AWoz9$uA*Lkh}OhQEJ%Yj%l&b-4N41-?M!
zmp7`~v=rmn<Eu8D)ji8?WT~y2==?JUKl>H2DOrA~h#!u!_-t0Il^7JOmeuL3S5)#<
z*eD0D9I_2^ELjq*PVSV_WPBPQN|ee)Ev5WKF55kjTw8QpN~(0$Zf;n-9jsN3NEs##
zhr(m&Dv3c^ZlqFI8z$nT{=<mehEVj@1>04eOBdv1O;>xkuKd%uxv){Vs6ln`wkFk}
zKPt<Uuet2xJ3`6mwT0<XKZgBmMHaaSgXv_h<_54MqdI;yE5o0js<vs#HijXc6kJsQ
zz#2w+E#F#}GLQSh_W2Bozzo6@T?%d(&Cp50@?LWNJ0h?1lIaF!O77f!$!>&!@jEZs
zaJ^Aph}DPvbbCM@O~|ZM6XOa2z3-Xtd)9k8r)@(EZ7$`W)4%-%Jrja*I6o{8=eYrg
z-=V+<{rLjW1L%N2uN-=G`e*`vIe5u<s3IC#g?iYwJr0xTEH7$-n&Xl;*Ve@qHppby
zauamaNd_gCiIaJzZpYURQW-uskIv<laPJHjkRdGeR8ZdQ?1zm`*!h&rG4oDNXoH-V
zpk&anoC>tYm|#Wv*>mPF7QHXbFAY$FrGbN+lBQq8E8hjMILfheM=cd8?E(;ivv4%h
zuIOI$TpHM`BiE<(F`Xt;b3ik`T%<EM7`Y(I(cNw)8>+l%>1<>+F8ILaz+>7kc=O%&
z=xp=XzY6;HgV?AO{O^_luHe#rlkl}1;w|GxeQVC$4(*nL?b`m_J{U`emm>)21hWim
zhSxii$-t3=3P$s&OAVeQ1<%hl4`4tFTp+KmZiic6TKn(g`BB8WQ1(!~geUX9h_ehN
z>z&}q`g*-{o}nyJ>O-;Kd%FH~^KtL#V`G7l5RgafBn-sm^R4I4_xGPaf4=qd<^I;z
z^DX%IT>jgK7caN=pTmFq@RI&~xliA**h?+~fAS0X?<M|*CZQhw`FsohL5Y|6=W~1k
zzo8|lgY~dK{*$Uf(=WFWjx8*>Md095D1#7Cd)zG60C4x|?Q`sz-aRL1@qg?ND{UF2
zUJ`^?CjLEfNq}%Mfal+z78d^FK?W4~Pe9t3cY84HUcG!PUOnGaHj!jLo6cuE5#jaD
zo0ogu#lx(s%C%`8;ZLPGw3)JHeU77wR?$bWyk)g#(owjmBg>5y8zDS?+5Wp92~xV_
zbe?hBuFDp^>KWY@fuyEo6I{F;b1YAn+3i#%I!(t%yXl=5A3V(;2uk&0WbC`_tvwO&
z5B~10J%zuXV%Q7#dlUZNq^JCzp7yXrm!9JL$MWgAfPeIK1D<Zs(*U0J&`Wg<9<5*5
z?%D=2Ok~bL<BaHHxKUKH*TAbk!`L@MR0Muh<?{lvm_o>hE|+%@rf&_ACO?VOctV!b
zn<j;Lz4J!@z2PB@AMpQ-U`5sOf1=s7ga7<jUHqTNYwH_pcKjcB8}z=$|M?OhJN^$(
zRvDTmnn|l$@(Gi353LY!_?m)$#S^^3p;F1V@IXUqsA~Fh$|laLfa?N<;FINxTPiC^
zoX$f9r7zH4$N6e6)g2m+#m8?wit*moix&^Y-t(<p{I#>kc?RIm*XG~!#~$Yx$V3M=
z*GKblNNbpNV<X3aukKu0x1Zc2z~eAGrdeg&;4#Y?uEOSRpt7^~ZsU?{1sjB^EL!QM
z9A`RaVCEWT>WkNb>lQDKK5-e)jl}G<F+7*(om*C?0x+o8t*BQHVYjS5s8a=JNpBTB
z^*OZ1m5x=2)n$G(9?{~-!;-Adlee17gU97e&h;1J@SrU3rpw@^1+T;3rH%SaKVF2p
zgECjQGUhG?rkuBf&2pg1IU8%00$0k{!IKII%X%uO0YbhYOKaA(u5vmIn>#m<`PFwd
zolfR+GbEWhO~|RD*R{cfq3RlG6XI0)*Wm@a@=CclD}xPVeNzk<3YQ|Y=tu$=m)Osz
z6fGB9G2U>>-~1KYozAP?_qrlqsdE9Mt;snmMlJK8OOk-~{mc8?ySsd;@xHv&7^X+}
zVJle7PDj%27MOyiPdPiZxL-QJQ(nCa3XF(I(y&!6O+kLG-K0SEEF)DahzFgC_D~*U
z<SCgTVH1y*?WhPvY<j_3ZyhxE_4RHK{$C65kM7zU{Jas($Pq6U-7P44Yg;PP3ANzS
zI60%xI>L4HktED0;E#_LluM3@vCky{^k>r}z`iXGC2o>;ps(e*=kjl18i%ki7f7C>
zl&OGY&E;Xy7lX>>J}<k)rNxgW<>d-<smom*EVAmf_Q?4`(traSz1aTo{Y$aC{p#)3
z3*V4x!XwG}FPcgGymGYNETs8x%SNpc_qveuo|Lp;z);@|-m~&Iqma_qo8rH8*M==<
z@}LPbIz*`AG9S^Z%1g*>zxVze<BM8hDE~;<3bST!cl-5ndrdl4!blR=6s@eirqQWv
z`=9gkO076AS)ssa*cMaqEMhd-jjV}vbp}>Bw2iT^-Vx;G*2^$o19%okn(d$J&{4++
zsuQC{u_-FUKj!eC;D41eHZR*3Lkxsr_-K@1r);R97!*<bq}B(F)v7&BNHxW17-AAd
zLymbkgi2|0p(4yJL<CZ(%vU)Y^a}Y!Y>LO?i2`=bm$Vz6=aZ+%h=#}vq{#dp$Gy~b
z524l)6Dt0NC8jP_EscBCZh?qBZ4TOT$*Z0`J#WVkf~OlL-4gaO=txhW3MfT~)#~1C
zNxN%imtGt;7Q<oP-(X%~Ll{8??}-0Dd;h-Jwyi9R!{^`Ar@&IQS7O(4MCxW`wcXoE
z+|;{CoMSt^>@05|N}_DmlBkkWY{$p@nSRgkJ=r%i07w7?DN2^zv@2Yzj!oh+GZ+j8
zgTc&k2&$J%IV|!G@!T!a+m)wf;w~|lJUJ6GB}#`{4fM4*RGOn}8d&_NHxx#4g5%Gx
zZQ@&=#1neNv_CAq#C#S5uHp@tn(^h4$eltxqZOT}lbKH@vR~Xh&LU6do59`yL(czZ
z&`R<Sz<f36Zy1e(3BUllc%ql2aU8KEElo)7<Sltta-X2zSta4?ia88vZFPsFc+M})
z_B3i1zGqeH$JU4Nob@M|8O9&*0UggN%%wW0)||mh0*H^fWN<<i%~hQ>GoT;szde>I
zj%Sx4M<6H1v7xF`d?B29-8TH!f&X?G&PGlxO>xByM#N`5&TlRIyA`0L<AcM!a!|?U
z;~5HPD2b+oq$?`|I`w#!HDM~37~begh;9kZ-P3gUeDtkq<DZ%`@89kpye&8SIDKHT
z@cTIXL~k`rw8$z(r#vW$`o=w}oa7@{HJioS&@wmJlwf4SVmU^p=GQq~4@{nAxj!*L
z&CVm=UrqRw5jeE^FE<$%0#rP^sK+}Xu-a@f&Agx2w3&nelB3XwUKCHFm;2v;zryN-
zCj(r8*0wj8Xd>yqS+?Wlc=Kj)$D|rA?0s2o#6GOd$otcZKVm<Nu;2VPiE!7R@%862
z@zwT5m)><u7i!cZdWu0!W4jUik22be*zj89R>6%KD}4*5i$dVc&<=wrp7F_miF>m4
zv7Gs=?o|XhmT!&BCfDQyrP*6O36KgUB?l$78m7Q382hmuPzwl-072PJ<^tmsz)^H1
ztYiY7Y???zvq&=j#AcoovKQd4+wy)gAD`015Lp_v3^ylVJ4Q-L+lI9&+bC4MWoJpw
z%|*F%l7TrjcDnc^*#!};oH8<_rP`|vG6@}&kw8&moh(QkEXf?uCy48jJrN*H>Y!AL
z%lHYlvcaybr4}ZFv@iy5(B7OKS{ycQbS(Ki^{QD`5*JfUv3;|7Tg72IDO&Z6x}2FO
zFmYjY%ZMW_Ca<4lumHgyUh>N^dcY<gA5|tCi!%WlaHYMO-6~^Jd|93_m6awTGy%Wd
zDjo71O}P1|yhY12E1Q$;YY8(rB5dTJc_RZ4Dc7KiO|)T)B;8g)Q8ch73?(=Tf;pp{
z<RzI5V6K|l8X5`;)*%75EB<XDS<2BxS+4M7f#LPWv#TwZz7?+4o3OUfFj{cZ7P55W
zn$L1mqL5B<U~(sk$&kLBS%Y|%AMC;41qF7aU(1Zj+Pg(OBuU<t`^-+a@_pt_OoI%o
zbDN?a-PrsomZq$PVF87mG8E?g>*r~fg6mfX*^m;FLiZ1G(JZ@Hk(4O+G|R5Ci;;5L
zV{Tut$}kKahkC&q!LFN61B07+{YCt|C9wy5{F$H6<&FHcCJzH`#08DY!EVgNQY)U~
znXoDpOYj@PP<EDBDNkn*iSFW>1A!+I_c0jS>a(OM)+dl|zAC#!t)iK6Q`Y)bGv022
zZgvM%ONV)Fx>jn{TcB+5(YcdoE8O)v`Ac4Qy|dXO?OSc-EQa>{(zPww)L@pplyuUL
zQh<OJ_ROiXVaxE;Z+Ie2-@MEqWz9JGkw(+=X$`FWBO*y5;d7WF)1OpFG;GEXqa@lo
z{R?V|MYNUud~RxDnW6b36-E18GY%PSTGah3jG5Dy2hbQ-R!1zu{IJU5y@FA?r}Zgd
z{M73q6fk~xwSEOm9*PwxU~9I3>6oldElUr@7pP@?%>D#MF#h${e)4Yt!74hH^Z!4e
znxcCmJdm1V>GZFtrWDW?&%-}UHKoMRNZ|hnHAR_gpN&B)<IJ;e{UqH|_ClQKh}Jz=
zQY=G%@2ZPAv)ItyMdNM|-j~hG06%A)DFVKPqO@k<3n$fGbpLeHEInhybP;o<^hD8+
z(LCi@Kb*|OIeKc6kn|CT3}JInkG%y&-W|M4Z+uw&a59%Zs<KC|nB9R-zbTMGG-)as
zNSS{!#yE!jRzvZhMQ7Oc+`H*n|0E;?t*PJi!}(<P-M7x?N)YCpEPk;rvK;QdeJO4=
z-;Equp9l*n5{DUay-4?H$O+lJ(8q-udqQ_=U<p+(o}O$l-KnC$ODj7xs!N1=y(n#H
z(S%Kkn=_XUaD`xJ3~z+|#xB^1joE~SY|4H|0mNo(&OWkBo*?%&z3-h)c!yFOIWBV=
z%xN;G#lsa)Ab~E31Gmmx47J4E2E!0iE#|h>`#G$8D=n6b=E@&CL*PZ<%gm9?oamY_
z>gJ2)!g-acVkxoe%v1OUGgblT`gn0!jOZabLA~K?oVujpSn!yc^3L;Ca>3@u$$WPH
zIHsei??>VF0Dm8yg%OP1xWvVHl^GWClO;!C`CEW)K4Eln=jaXHa@F0O>YZ}c8#&dR
zC4sNo>))~Z-AHGzojJ$Ja+wH5C^^i=Rib~;u%v=@dcm`W<#&R~(gRo^=y=G(AcxNw
z-Z^4Z54wBgn8_-IG`JhX=E^IrE7acf$==9>yk$2+D#;co*sOeqik!`gR047LvqC(h
zxFX(3@JhfEy(}{^CwNd^h1al@vvaF;#;sDSP}lFc^7eDdPSrJ{%Yj&t@Qu%k@Y#qy
zHp;6sEg-%72U1?qD@ljIG(UB`g~_cP1193EkIb!?slu@wVWM=Psw%nrzWi<$%dbc5
zO>znL(&wouc!hZopR=AnyYwllrm$Ob#SvF!k4@&I5f1be_KDow7Qvt10CQG3E0PRU
zb?S)vDNVo4`rRm4veyD~CJ>|~sIQ<wYx<W%F~?a8rl!lY{?u8c(QS2`Ffp5*POH`I
zuy(82XgY2EN}A)=yF1NRmo?o^2PSfJr_rgmncH#O%}!%yr^(<qr`2wBnjQTv%A4K8
zU)j6e<HP+I`@8J*{@a(k?D_5?{C}72z25(?-RFD9Kd}GYd;50(d!Q~9-`~|5IC_7y
z`xf87+CAJmW-kv84~~EM6<RvlWp8)izW9~>2p`@uXy^D>_QT%my|;RO7&_?d<-yyx
zyX?j8;lXQm_#V1E`T>5&2&^xl&g(t)diOmPI|8_V(CYuVkHh}@SG=!z03QL?qoe&7
zQ1plW!`FMivKPO;J^lf3!#L-!ci9`j>gY(v;W+>Zc<;XX6-ogZhkMWWUO*E+?H|6{
ze+zYg+&%u`^_~KGDvsnXMr*KcMi5veakbjk?T*`F?hbSHk_})Ghc%$925U4~qs1Dq
zG3v0!4r}Non|0Q7fIV0fplY&ai#35wfUR~|vumJb*+%6}u+L$m&EtHIeA_xuw9DrA
zCQ5Irjin+!DcoFZ?WjVRZs&W8#Nu`V99GGAl1TWp)1UpvAh2UJ%Eij*;?#>^OA1}1
zc^cJ+E!@D-U%GN(GzT?QJ{ZbqalwS&fQK4e<RnE#I&U<hupAV#!#A25hVw{)DA8ez
zyKRq*Y9Ob6V9qo4KK4NuI)g4h`ka!*^_&g%;@t0FaN-B3t<2`pB!+*dK7|gDPF{LD
zs$!ENc`bAA$Y2*u)xo91fXdaN0(#L9B<^Nje>Nu~_WTiLY6<bXIVMqX7EJi%jqTit
zfgt4G2n4kVM=;F@oXm|A^UjXZc|$|M{|I1nh_kq0NDHF5KiFO%0=)T^DFes=Xh4_0
zkT%0850qfTQM04qBkyV{W&W0Pb&8wc(sGuYN{dE4d$X$qt!2X;JFD#BG|m7#O!QWp
zpaCV;+Lx^g@B8E=?@Cz@u(<fg0+?(P(n5NZS7_?G&)77KgLK-mCwT37?gNjXdmn=^
z+ThCzMx}&>M<l^Cn&R^dq|X_xG9v0A9dtlp`z*jO?50&0M%d-Xyo$B6qh2)KTlGc7
z(`|MsBP}Prji`-hY&X7uIX4b5m}IQXx;PcUXr2>6Zwy(<_VEiWLVYi`tpYG2Fr5eU
z=?H|nIMkG4$7qQdoNg=AMqwO&q<k`iaGU})p9)E43~~v{-xQcK9_14kq@>w_KMW?o
zgdlz5F~}dm7Dh9I0wp^9neUBA{h<S1xmfabiv5ORW+-(tZYii;WU=0SW;Dc2QB(lE
zim{39uL^h+G_%%2a41#zDpSQ=ELT~Ucsuz^lZx~Lk-6j&h0m=GDR&J^6+WewD|{9$
zS@<lmY~fR4>5@G!%P9Di91+>Yf`ts9oZG^yEok_xvZ&#cv#{A=%)ZHA<m~lUKTyjz
z2Q0s7zr$X2sr?`<9kcK(^2TIHiUJUUxN7|Mc7}#v&u&846TU&&Fjv^YkbTR#Tet}y
z`yOyleH)EC4kozhdA(p1%&xU63pXD2oyQ0^dZY|}=${9tF^K)hm$@-X=r=Q)5X8dN
z$!NXfx&<xgeDU2V(yVqU!A}`+IU1?%P%6U8>=NN5D6HU9F0^j5QtMAEKa=<qM2!3}
z5M_kZ3fzTH369~=5!2W~(BvHDY5@|>r>CU%-Q>jLZ18{5kS(S}aPYXoW4-(n2$$XP
zAT&vd{0mRK$=rhKd9SOYBjnthgP-<Nr=wv6nyeCd7nPrEyzWPg2%rahm%$sMMiS&(
zx^IC5{D=#Tgeqw%C1(Z!CDJVQCP*jflb<aG=$adH*2#@3z}E*azp87gnll*gR~br8
z%*%F?GLvwYP=~a%wNWT9K|K1jtU{rpxJU~rv;r53D!@((KN{zMOHsy^1j-MH4=Aok
zol=ys;9PX_wFtp_-q7dAqRy#On191rl_n+mWf4{4sK4ycD`=7%`C`J{0a%;N)DReu
z2M{+k+>wVJxx}nn{uM~RMtRBCD5Oz3qwkA6t|U+H6kl3`3GP^pJgV5sr43J0j$Dqa
zlDVbeEOlk`II>@*AZlDG9B(`ES2`ZVvo&@sy1gpym}316U>U?y6c&f`sPB^^uJD5O
z289ZpaDmUd_7fm6cME5|<crliJ#n$(KH6DW!^!9xSLt9#SDdiPBrrBW5D?o2(AK=)
z2UT-8A6Wp8`Z3*QG2Zj`tar?04aCm;m{en)TJe%{1zFpqVEXyZ^uJPP9E&jKJ?6eV
z?T-TV8A-lY;gcY50-zO|N9>s2454k0VpE$>$fW2Gwm48y4-({4VDzv2z7CeyvXJ9U
z(reC)rTvMk0p1^lv7Rr9k~zks@G`Ui7hxu2(^4#s8ih}%xev3&EOhfj7UHugY#||*
zAG(l}ig?Vr<HY>2S|CAJ$<>enTMb&sbIj)Za#PRHFga!w8`1{e%u}Igw_1&M77TnA
z#R4>&O46^dsXfdB-|jS<^-iNx@3vY_+sSJ=cWWI#sbaGmwz0xTPH{%XN^F2_=PH^Q
zJF%azm>~rvfW#DnsnE6&uaPCNj-U9+Sz5*i4Wxh54Bi-$aih?}Ih{kX$_sDuc*ceS
zEESKd{$r5NY!u=e!u^~U)P9{7eU?MWMNJ&~<8bDiZ5UL~Z$vDe{#D<nq~Z3GcD~`A
zaDfra)NjSrGHw+lJL40!=<rVC4z|cV@)u19U7Y_JRswH)=M>Pz`JY>Dr_<5%Kf86;
zX@AN8{1DG0aZJWjouC>s3ed@E7WK!|CmW=&#=$s%ec$$1+&V~1@dB1|FY@<a3R?>o
zY83I-Lzmntz7tK0BbE_Nzu*kSay%UcGX~{qC(Jt?gXVM^i}ND0Ob^TSuuLy0!#lxu
z-$4QRH|@!}HA;MAmZ*s$kJu3&<c|4)`4;PQd_cDUzOA+afAenOm%M(k%r}`b*b^vW
z34u|W266@CF-$p+&bT$#2RdAy`u$)S_ybJjxeayShBM)8Mu+=DP%TME8-yT*$*xBE
zZ9;ih`!Rs<I7w9q4aBgN!LZKo%7n=2$cI`R&A0y542Lop$dNP$A{gLEjB!69Mgf;d
z`NwY|D0TeiU=_+#;r$7#ar9+o7wBJj5%4}mQg7&1#Am0`K)1HUe|ao2?To!EXo$Nn
z16tVa+(*2G3&E2*tFdmkiyfT#8(ZimLD4smGKxA2jr?+m9;9j3PIlZMnF?_7r*Y;#
z!3FIr5eWh6)o9;D?gR)Z%$$i2vV_(ZjlBFW6%rUQIt>V+(|lTsLP&4;4TysO<joM?
z6cvWwurT~13zPcik5K>PXE9Y?s8;1IC$YV02Op=U_*X?~tWq;4N^#_RJ$|=1&Jz4y
z#cmJ~;sPXB91JpUDdA8K2@KT~*fxyD6e>NrQzl$q4soGM2T*TDqxMk%yDnfjQSv63
z`N+2vq~D(;RF~T=p~0s4u&TU*aSH?I9}*h4d@}H_Fr%V!d`HLOrev(jI#ufYgnef@
z*IG~$06xK-M%ME%c>;xK7{Sl83XD25m@5E=C01{j+_HZ>Vn3tLPY(|hr$oa+!t9Jj
zuOCjYrPHaH#-f33Xb!Oi-itu|2x$5Cv%-s3Kp@KZv;qAE^QxkQ4(=6D90Zu?YJ#UL
zvUQSuVkEKT(4Y0s^+PFYWqd6vY~tbIm^orW^A;6!MZwepp<fh4mGYO@dvBA9CmLID
zUcoXP#-#Zg`#NXao^lY?t>c}}8y)EEnV7Anlh#bI$l9YgmG@u9!hx(G@p&`4H8?yN
zkg2hloCfv-H@8Xxl3AsZTcshYWOBjUrU-%yKU}(5B$xF?Rb2eh(5jT86}N{0&4V~y
z5xkgP`lFG~jiwoD-Q2l|bg3y&E)?9%bVB2c6aWJJ;p9zk4n_VHx0iTTiS~^|XsN&$
z_9slm`#M2gd3`1FL2{B<3>>YR?WJaT)C|9viyRHUdc&I((kcfn5|nRtNmhik@ht&*
zP6m*Cdm1hmxafjv{tc^dcWujp$sz)%7QlZ+%u@YLUn}y`OB6J8ZEfhQ>~G3-z$-M$
zBw`eqM9Ji;SU;~wjmr_GWPFkNk-FWMN=jP5Bb(nwdUsGr(1=S<fFa4Yq?;Cq{PI&~
zF<m_PNe;=!-#$+AyMAUI@$LF};@g$ELSI}Ju2_!B|MS^W`F~iewKh7-#@0jWcD-Im
z>$eAQempup+}nLqUZiOnOQn)s?3G6IwTtXg_ueo2N5@ANHEiWIHVeqVh%(6M(f(Ul
zv{zZF9A(Bhxif~gl)(fxF&VdMvYY&d+o4=1d0tcQM}Moe49~&ayU$L-zsfrTXzn;Y
zjn>w)KDPe~>*Mj^{+pFp&ZMzZtFs~dnETyb@V&9%dvn3}R`xsLW-!6G*ip`$wTlLJ
zbAzzmK;sxPt*QLpN`B9q%wy;QMgx113nGfBQuNg~D|w4z{;K$heUDBrm{5<dkOUNQ
zpIFIb!@wU6WZ2O3nrQ5smutcyFB@C!cB-XeJjHj2CclBBG2{v|K#2WSCw)?#g?L4a
zBdn&<<|CH<O`QC%uy`y#M(Nb%V#8QBpaq!cwC+$O4Yc73tWK7eSJmGNmmHWJ^;$j4
znM6H<Is4@4aU)2sl)xs~1<VNCFxtQpih@$*gy-NZ0`2wwoBd-Mf>D~HCLzBYP4@Xw
zFb)jW5`7Y`!?_8%ZHyYZ<0CLk+euW#k5<kxODBq9or4I1JKKP%1*Y|hHccCCI2*n=
zc>ng8U53#GT}4b50|kprTp0TrC7N>TCp>11bwCdHe!647{zs$huc7l&T_;Ayp3mkn
zET8BYKI4ZMD26W2!;ut5rtxg##WOV6R%#XP{cp;_GQa8ISo9<%A!dehRoQe(K;zyB
zzl$aB1<JMr)AMUnTKVLTLt41#Ub!hZ{4xR~fsJ@xzqNIn!C#{IK|790dz4V3vAdoL
zdZ<DRlZ^(rZr|A?>?LCd@GGnzK~nhXS%j6z?0OgW1{4x4<TBuiB_@&NIRC0Yn#TdZ
zWqanwCTj(-Fy7Q_4hTN05ewC#rptdc-OLD-HitD=uWHzFX5mb`stOpW+cncfic7%9
zV49Vp{6J<v4cMh-QjJb1Vd=#<xA_ZhW>B*dD{T>nm#=Dsk7Wrgs{JHgX94*7iQbsi
zpjr%!-k@ye<W8+VLAH7V3?$^@vel9Go)Ft*8c5dfY%L(HCDQwtS3t|_t?K!c-w@Db
zJq<l6Z!umQ<fI6dYRZ&gyDybY^*sNZbx9JtMP5TJ9gN#MQZou_Q<l>fQ|4n^c*V4?
z%6@KbsM~fXZvnR6DC}S039bUO3U5ZxX#h(=V~52q>3mj52{MGmx<9fK%kPKi)UrIy
zCZV92O1wM*YJ{tEddYg3`2K64_;Z8WUO=bk7;F$-FfB)>K-NtbVut!&f8e-{rcQ~0
zbdVnSuyczrdRo?1dLX)c{`%m>kIbcDXZpy+4OYefS$jw5?7ibSVDlK3tt@$C*GgC$
zL9w{n`4SXGikTE$JHe2#>?FfA?hhlG$}MF`hTa6|r4;$o(Y29qo7`lw`>EK;pzW}B
zyKS?~(3cJyy6mHxrtcS2DEPNKkC3Ac55SR9YlyB}u4(B3@+E_SOCks+bgbz4L%x&r
z*)X`;V!U5A2nOivi=iyIyyUUBE<JR#iauggmFr3WJPIe_JeDN90Z44}u0nu6<Fxsj
z)GFl$rgw?a%Xq(Lh|w~X$qdgzW>y*4dMqA0c@l^#g&Hqt3Y^-&nuUn7P9b6$lCRn8
zckhpW_$v*KK*-4`;F(d&RQ+=dqpC@e>xWqXC*(tl^qa!Y9?hRgHV?F1{1J<;EB^l{
zU358SU#CPRxPu9KpUpr=ioJgJ_~4Hv?VI<nkN541HCcqiiC^$_b{Q6ZJ&$~~_TDdh
zFCKi*5;V%xa`ak&o^_m263}IMdSTH6LYPceKcDoAP>1NWv#wDEZApd2os)9Ss(Qth
z4i|33t!5%Li>JkGk*|SPz~9QAT4~jCR;*JQYt~aTbL<z44AyasI<7u0kJt~s&`@Bm
zdF1I9vc8D7MgGrm5YPNc-}C^b3uf^9yg!?ZAfb=AbDRtxmx<3c2rnnt{3kyOjj){x
ze<XgurPw2}mFcv;V)cIjJg>PKLxVgiXSd8s_gZY!%1zwtd1Y8*(c*cfy?VrU$-y<8
zpPi>PAg_H2F){?97<q%>3M8D5*ZBwJ2g_w%0&VuV>%$=E&)AvIIf?F?3D{Kjqn2yf
zat+f>ov`od!lrH)R<6?Gt%J+lk(;4TPa})QIZro1C~c6pKB>rP8@=X7D->L|pN4Q#
zm<X>IdlO$!Nok0JV~~#^*=mEc^O-GlAg#^ZqWX+qmZ05-H;O~0F;K$s7B=0(mEQf_
ztgkb1%K89QFjFG=E|}=mD~*yrL-XE5MED?rCIAN$c^@J<@`P3>-Y(7nH5}ig%nb#+
zZqV~*NZw0NflkhW52N^eJ{)2YBhC0)Y*bZo%gQ>_!k03;8HA|>jr8e(7pV#BOVXWs
zNPpmEyz7A>i206^jOBQ?#u+M!0cFPNdWoktqL2gYHxb?&Wv5T|iv1gv_%_GCKI?Ol
zC#N%*XHq1XNM{}NH7$rE3-Zr!fu+-u@KV2tAY6wOI}{c>hpA#I$Innyj<6jl7rOQE
zyA&Uc%Pmy_S5<U;lBtJXFJDU-#w;ge91gl8k*PK7k4{BR>$MPh{GHbZF$iw}q*66$
z&c-MF+U(}$Ci{8!@a_KFR}6ozF?|@>IEcx<`%Ly)qkgmZV|jbES}pIBlyi?cgpXHf
z;`qgDte@buTpL3#7)dY^{O~0PJ>Y_K6rRPzT?2mxAL7a~?4KUfok@=m`h@KTaXk0g
zqgK7%RtJMGvJ>(R;eH~1a;e1B_2{Cja4Le0LaW``>B28{%EKxY#Bz0-RL8X_i}`h0
zR7ZI1H@-43INE))_x=9f>z7O6;jV&+o5jRgh>4p;#mS&zdOfA5qB&%2;SIK%8x0<G
zeNu>v?ob+%;=9E2R!#g}1^~A#1kMr=*q9kMl)Oifcm4oicrpoV@_1w;tK42Gf76EW
zia9mMW&x!SwsR_LS=VSJbK=3bz3G-Wula@hOb2(GX#K=4^ZnOsq$x$0Rd@7@QG008
zm)^RUBq`YsREm~jFSpg{G@6ZWqq)<~aWjA((U5(K>!Ht`?#bXa^Tremyq82LAI_6~
zpw`KzVX4n?jl7aRktKkVZjx$Ihg>GHCp(1{e^l)%L7p|@kGnu{*E<7CTocIpvU1vJ
zCmw}Y3EJ(&t$mBP7s|B<1sAvXKdjkomTa$HFV$Y%a-d^tuespr1a~Mzqlw?2^SHdQ
zlZmsl(c+d1wT8i&P_^+}4NU^Iv3FIIu8B&-vSl^+JT5D6H?-YC5g3B5QRr@%brS73
z_uGEky<L`;^+GZ6KRhhPI57MV?=*f3hR<Es@a6Ei8B8~amTM+uIG=H9;;GkPilQay
z>D&iBd9n^EbN*cPwBEYSA#oxRidXfOUAb4IlUqoqg?`^lP>HWZITN}r@OD&Z_a*DP
z>YS(OHF`(~BbozU(~bf(R^M<_IR!+y_TyVioCj6o`i@Tx^tGNw;nX`r7whCsxJs!%
zU~zNnwk3ymS8kTeYY>vPdh;_j3cZ0B4s$zSPmlLAXmqXVJMz*F2KO;)^2knJ_e<i^
z<WUQ~eU}(mLcn$};$L`F|3~us=Q#`i2X7{=bHJ8b^8P&ITcA2D9(vRq#75;aWrDTs
zGahL8iy^wtrS*S=nESJe=PwifUMD=!_+IDx198b0iLg3Ds5XtyX7$h6l<Zgyg;^4I
z>!10g?>gnim|+UMU{JBmVjQIxhkLund#1~c#Szk^CC-y<q^lzLp%i}Z#*lx3`e^T1
ztT{YQfrwz*XZtS=$au*FwhC;sYW2!$K*2_&b|&JA4r;<RMYLE5CEA_%AKaH$BpJ;B
zYYe|iz4T(biIG!tD*CPTk^@4%5u(~Hzx^d3+gyl8IH3$x6k{B36kPb)+%=(<N3S(U
zhZI3LWmO#tw3@_osE>`_MMA;ks?B4+77co}DVD};DwELQ^gV^G<vr}kzl>n+@u-ly
z2jANz)PpcS@2GbsKvD$;-VORbjGimsShP^gtZ^P5l_Z*Q$s_MdzMU_grFA8eNj4md
zV`T0y!?C#QpuT2;{zW~E!yZ1Xk+I#My@NQbxs|fofw5$~Iy`v)j{UIr`ki{sguG4X
zlO#G2KlhC7;(|AE?vJMI>gp=@s%mBP{p4bT-n{X=*AK^IR53A(Bjw#m{WN84ws^CW
z-fR7f#?=2aJ%#cAG4s`(qyI08|KF+C-G(0j-|4g)^)K=NAL6k}6&!a{ru+aa!_yyd
zRjsijR8A-_8qex!+{aOJ`CvgRr#R)?@~-UM<|SRhf|$DN^wj$p27}XnI2r}$5E!4H
zQuuKYf#`f#XFJRrP0ziPO!bf6Xw~ZEWv?Z1kr+Lx0#x>NE*ueCW?GDu9ZcqWS`*zb
zIAZ5I<*Jli7I4VmWx%2rN?WA}EwK8WlPk8Yb0YP;9Ziwg7ZJD85vD|MeiF#*Q!vE_
z|2-QcB~1w@%A}pC3JXPQ7s+5bYaoJRbCx}ntE!2HlgKrcI-n|dbmsPxC`fcmL&#8#
z`ic2Qxd(KcffAPOQ@k?4ZZg5LmB{fHz(zStoB>BGrG;}>(N;7dC4jpEZC-lviX4fX
z8;`;^_9(-1pEY21D;dkRuj;hu)M0-uCI(hAZ>NS)a28Cw(JAH?;87<fjvtcEIBGxG
z8STOaL^UdW!nAu>%I4i(UUhp>S!jICr%EOZxyhN7&0G{uokjUo-5)R=I`_QINqcU~
zXP&Tk(xsBn+!TFctTN(Hv8GtFP9^*Uyp5y7uh#MQvzHLkzJ*{gbD(SB+7fRijGs_6
zC;gTH!JI^8hqIdHpUmDy9T$>8hkHlw8hQdkP*X=CYh-4qjb5xl%}{5`%@~6Y+Vu@H
zUb<OI^VD>JR7!T_Vo>g>f9I=oEF^W@9GdcU@t~sD(J_bTkr|{rMuX596zXyvDIBwJ
zsF&}Oyema1fwf+spe%<RnL5NI9X?`j@b-L+x3(^Q+5!)Fg?Rw*$y_pe+zF9PW-^CW
z4v02IH$6cu5G#Yoy964pL@$sX)DKVAR+f01^*fQTT&D%JO!`mpuP<0yl0Nd*kv=)U
z3@{n(jZcw&+iVCwI}C3$?J!K^(It78yW%+Nz1IA-tXwZno&5&Oo=To#YUiv1>t6Rb
z*_T@T@F}(asWPK@4dhdaH%jqZ`~0?z@5R?_6owb`>B6-TE17E@XC8{zi6Rhaf|{jR
zH!MpXbu1Ji-XiEipxPQsm;v|C{$pqrts!x&#G1uyQn9@Ai)!o^5Ln!C)^1c9%|Q)?
zDUb~0Jcb*AXzcN8tQe<-T*mpG&2zjw?M1%P(lDGy3P6-B3e$<k+a?O{c8`Bx&NKEt
zMi2WlkNXTGCuWK|8|+1Ti8h!e(F`Mh>QmMp{aUPa5JY!DzV2;jI68NYs=0=mTC`HR
z^(7j{@Zsf~#?l5INE~t$f8Ia-;iui#@Ar<D!py1)EP|xDERrkr;@0b~Iq=6Quf(n4
z`6QrZS-99m0dQlMjR!;aE$eOpz-;V$z#sK(w7599yXkqoU=+-*mqW$Q3L}_x<XHKk
ze;%C1fKB8JshCjA0L|4{ICIN9$)()$M`%dI;L`A2id_<s+c}~JR<@6r-N+K=JcU_W
zX2rI?nur?z+K6JBku?nsbPU}jV9jC?`C@AN1M`+LJUG*Pp~k%GR9zr$z4?_HN?U}H
z=GUU*Y}|bw=HRBPl=)lE)n~pJNy}M`8Dtv~hy6;)e}iRN#-7c#E5Xd?GP`=NKBb3R
zKI)pn$(CbPk<V@BZSI|$5(pJzL4e#p{Py7!TRQ51Z}|8`IKem})}}30I7lbCsf{Vp
z#6K2*WZRWmSk<~}y3g1&jDvK=WKTdk{*Eay{B!SP5Jnq(m54BLWQ+?Wru{XV;!+sa
zdMzy{8QP$*UD{CgVAL$#MF9k|j8VnPc_9Sy*1$!@X>fSqg2DYN(@dGgv>Zl-({~Bo
zp%iiwqhg6oOwxG9cH;{W(&G>lf5wWKj#Kqb-eCkhO^Llf;c-PUVXQ@k<ncxZb5Pm)
zGGe$~uZ)(+Re}UPZ9ge4h*;GVpypG#=;=&rKxM<UDKNE#Ng4RVU=mRFS?T<MY;H6o
zC{UuqpZSiPHd3^fNllw;x$L(&eCR_DXGt<u<dNRoOad`a;<1Qqt7d)&eah|7=I`Do
zTs0#nIJAHGWRVLmHL{6Iu5C^`t7uu4b`rfSGcDASfp#@%Lx9?sgkmKO8nT3vzqMiL
zu0a{&EwSYkGJHxYWjO^$Bh|t$A47u^ql}6id&)WH)^6{G_D%uSQ*l5r^hR-ZAeYep
z@F}4KQn6L_KneRDrigq@m2mDaR0{DaQmp1#`l*jRtl<NxpVydAmY3;mkxGfrD#A=Y
zOK6w)<PhS%DUi=k%PXe%te~9YW0^p+C};f3sMea`u9j(eg}u7cQPKXJk50yDVUGcD
zrxTmheyuqRJckBLxC-=wvoekXPTg((S$qWqO84w3APJZ6C!oPm%1c1hNPGl{>J~SF
zo*Y}<NnpZX(xE`1qd<CeAbOO%q_EPfz2oHELw8Lu&*c3mvYp9a=tq{RXT_$eolwj#
z)vICyV}A*=wdRsx9Zd;C#b^W8SZf>Euv*z%J+^t8_0=t=m>i|m=q35fPOX%;G+L!h
zxqwn?eT7a+{fD5Ed7hT>_V}n0D)H0!Xc^bjQ^#%a|DT?o6xES9=F|}IM;|5lH@6h^
z-4L_5VVzG0bZUdKN_qCZG0etdBuG}KhgP{Wq@Ig|>86B%r9rkhItu1=q9Wx;34>p*
z@6*#^2#aJy6cl}&l)+Tt?P5GreiY5Sdi(k`paNxvegTFlhZNywRHVS2cG48qv36F#
zj&(Vh6e(ID&4UbQnDp&0uoy&VVtF11JosuYN0xK!Cs%p1N=va=JOL%JP-6j5V$EI|
zCN=E6P~1g`=W+tVGIAy!>M&62<*`diZd(iz<g6meMs91t6^Ok8Gz$p5K&ob#eRU$g
zLFsGpbGJLxpO1B!CBp_f6hBhGjKfcvwY6(g?P${iNFL+T-X=P;dMk=!c`gw(E;ZMB
zY=uv8R#K7H<$je{)=DM&M}!W~_>D5^#>AxF&E{<t>q+t){AeXfp5{}UAW{*&Gda`+
zVm-u2HcX31QKaaQ&cKuJE~WE~kvN0Uk0&!~&X}X8r_ENI|G!|>85an~Wty<diJS(q
zY8BV3nDK7`5&2X^FB)BJVbk=D9BeRDv~EVyVjWfZjNYtp;c%war4e!XKgkW@3_L|s
zp1UpU>K;IIM=>C&&rK^A)^F5H)ppm{vga@axWN&~+7z-rDNlP2>S5wb0d2Da@XZAk
zgk6OwsP81q`1b~b<n9{;>GMR(od};JZXSf}syzAZi2mc=uSdE3E{uMF2oWfA#lhyd
ztnP76Y+c#L*XYQwlGwUQHyC;+KkdHG$7j8BwU{wZlao{|XQBd_QuVYGD;jxoVO@N`
z4isb;C#Df#_x0-%oF)7g7x0!oAURzXbC&3+khfHl>7C&9SdXrdkgZvqge<YJ>wAz%
zh_>T0yGEnr-K`5cAO#!c(gpL43;cLa(^%JLJy40X0E-gE@{9)@14YR!+PCxEPN3%S
ze{M4zR8wLldJH#?BfktU$uNqEC6~YC`l>j$@}Soqb6G#{Rzp3Zhp2JI6vonux@J)i
znjLDJJ<Z=(k^nu&El5)nJ-?4RKE!1Kk+zX1uK}fxWB?Cw;oB7FwNRjuMXLv;2h7i*
z1CdPZsnttCI+A<8>>nK;-M3ZHyeC=2&6%?0rAVo{r=P==fW#ur@brVv81n!mxeJ+`
ze*A!Sr%^Z#>3Th#qp+!Wjo}6U{WfFbP!Pv_V;{sWk~?uDo7COriN;zOt03(C=Jzvq
zD?x2b4pR*C!2a78htGetZvipuQ4jr@45K&a<8y2wC7C=S!c(i>HUCPGy9ue>@?A?S
z$Rd$q2>97}YJQZXrhYQUSAeWF!`zZf1(eM#DH>KlSkSCeGNl@${}s|sl1p6C7%&_G
z(R(n9{n2o#b>2#l#{CeaxLF%PT8#czjv(?xdc+Ts=?D@{j)fBr;d1JAvw#Y=`q|`t
zlaUti0zX2fpvg9rFmMiQxV>POU1jZ%cbralr`>gSnuQoxiWOtx<YMBam?W*XlpgGZ
zWn#uhM|q1qk%QJBh;v#aAA6;Yq(h_GXmvY{okn|yDZg9kfT@vUoplv@#8a;iYub~M
zKb&n85(1V8R$-1)$s<9wKx%=`V2_2JTj>ZI<yTQ#hYIkg89ORp*oak4gp0x0R+RD>
zli1CCXa@trNC@nLqD%`MBxT8V?l2CNWU$0QI1Vcw2(7@Eflvm5uIc(S)MQW^3`gN*
z#scjdihy)WViQ*Dx^AP<aqBSQTFp+U)!eb>0ZDWfQH@7Ox71dWjbw<PRIXEk7heZ5
z(Z3`fR`u)q*9W^fX81ekV9*_Cii#q(-Aa{;ZL3Hw0OSERvT!~bd{4le$QUatAe5s$
z=uKo5lv35yp0#y*nSNCbMkPN}{#!g0YgO>d(zo#k(RZnSt@Ld(`ri_CeLy{NDfVXn
zOsdnfJdbkq5*Uqs=9A<P)H7|^I~LUQ(OpRawd4I+XrWe$sH*5Pw7Hvl%Bl1j>8K`c
z%IZftW!9!7ZBn}{>PKnia;niXgYhtm>X*^T9Syp5gudGNMFf<o&HQK#3(X93)$-ef
z<6tlt*~INR8v^nFc~!5wi|CI<EkS!%CZ2}8;jeXkNZBDC&g)tNEAO~zXE7(zvlt3#
zG3*w)7cXd5I2_xWy)Un03u*7sJ=?@zIUq8LTGnH`ut}Yug-+Z&xpYDg;Mq}lhQU;1
z%SpEEyt<&%J%hIMKED>tiI_OgG*I&@9q~YzX{Ch@>1$vDZ4*XkN=un?GwfT=1>G2=
zvR>$Q;~+#L(+{HwP!2CgXEyTO4?rVZW(&Sk-(lHz9m~5Nt)ZJ+R)?**lGHXkWj=D(
zfNY#d!>f>Aurp!}nf`XxLRbK(=`eG8e9XE6!Y9{0aMZN5Lc=y>mf}g=1Of&#j$m)M
zxn*2greX52KFHXeJngdOWFMh#FZn0g7CG91eR<aUFz*YQAK=mA+n=9(A@lt_a&_q$
z0d14`DlJEg_aFlIkrbSN`h*hqk%IyIr~>!PFyr<m*GVaDIlofMf5mI1@=__iv1vd;
zE9agzq_1U)q_<g#Np7+wgiY5oBk$q!h`k`oU*>}?{|=7@ke7i+K3IvbS08wMk)J5~
zU~X9v$#7v=RpM0Tf|z?{UKV}Ai*DqVwFY?j$&Z3z_U3c0D<OHm6h@tp_p;L?=!|zr
z3Q=JbqFdrQ-mknsoBH5nn^MrUv9bGwjWgW=KVmqU1y}gXa=I*EmfJbT%W%Bxp$ymK
zlZUt!v!mc_;t%#GGZczTU|6!=ABSm)VV2!3Gt@<0TH7m0sO+>z5aFj_3JG(IW+TI>
zl(duZUsrG{$fkLZ;+X$|wv=;qqf+}$2{4ev9DuDoZ1H0w5Jhq93z=x3QJn0%I4PdR
zGgNCxiE`1-k8#1<I#>KjwOLRwC+xdGAiVG>OeiFS^ZLKDn}mS3Ipgq%9RuBm;b;_I
zQUos?3OwDX<X=4?{FUFI<9TK<#Q5BUaPoM@=CRKJ#533{54QNl^`U6)lE-1=@xZQj
z+NbR%yy%|?=qxag{4I3R^`L=gyn?9aY$Ofh_%X6`ViVIafSF7w-+5%BEuPkFIz^9q
zr2bAFw$$i43$kZhH0N%x0}KjBUE`-~o<1oFP(}@kIJyZ8+ipW<XQMP+Q{YbE9W6dM
z8SnuoJa-y|b09516o-g+d=X4VQ`irZatqzB`@W<K5f$GPW|2ReUBf@YgrDD23_GMH
z=DVMXmOO@DqXCbBJdMJ$$Q!e8J|lzI>>Mh_fXs!D(0B3K-sV`L0r79uXU{%Lvi|+=
zhEaKw56>pXsq*_E%aAZNPY<@kCn`m*)otowB&os&E2S5Yr}rd?V_3Z&xjW7FM(OF4
zb^hRui^;<Oz=7iYjlbRI&W!vP>f4<TZ^2!qdab_gNC3KdQ_Es|35T$zM?pA`lj&;l
zKfhQ~tT}c0l&mNNl3S{sbEob9+JASt|MvKF=Q(rSPX2eN{T!rfr(IB_;XY@s)9f^N
z8trC5xpwn;p|vnmVgJpW(>MEXSpoP|WcL@q!CvO*`0%t2C>XxmSFE8WHZf{AO-qd(
zr(0A9sgSADZnYY%jK6$(?cqZIHkgm6_?iB_P$C9C;-M&ezE~YmV$DJk6>NqXH;xYu
z_m<=;*IqvMCcz9A{u)A26W;M4uawdt1!j2d;^KnUSryCaDC#)sh>VkD5Ge0>+&CWl
z56?=Ig4W2Q7inD43x#xg*(9M~RbzpZVjd7fLzP9uPow@4-2wkty3-k`xI=7Vi4KAJ
zEFIdpFQ-RrLMwVIZ?b~?(xpXKIONEJMN>aJ(=8KwIbn-e1qB1sG|JT>?QDMS$Ax^3
z#2tBkzx0&;G8ewgg|*IwFF85?rJln4pR}A~QrB>Dmo%Wo`9JIRMysvo|8yOv^(Fu3
zgFF<$d*b_;4U22_bd)QC-xC956@O3-lcnV=zE`CM^PERg=gUiKPq;kyCzz!Mwx#hU
zIw4?~I_~|j{Z(pgrjB_BH@9EuZ=MJMHduwSnN`g1qhNC34|ownIExyrdGbZHWuC?J
zzj5abz{T_5skd9MG5_mz*Zng8AL7yT|8h;3k^s|$7PF39CD30w3I<v%=}JaIpiQ^J
zoVGAzNd1_r*Lzo(9U;(sNYD=Carx1kpP8;h<7=Mtt=VmK+V!T}+Hu*<^NUw*_|NJ7
zi<9QBzy7D!?f+-<)zAOsjb43d&VtE5oR{w9`O(FTgP;HJ_?LeiegDg=>!Y36AM}UA
z#_<2_|M%?d-HR9h@!xOf&VRPUld=EiKVDyiC$rPv4zI&+u8#iG2@iTNe;xea>GZ$m
zKeylg$MDGQ?ELB-Tzwn2M;`~@kKXj&)ju5dF82TX$LOCwJpW}j|K8jE@A1p4XV;&O
zn%;-_A_(67e181R<n3^G_^tPUej4^i{rTm~Xz2eV_-X#*;O)of-HYDv_wQyu{`>5Q
z5C7cz`19{aC%yk0x(6?2znwk%_sRR?%fWBc{`>LC^|R?&>vy;Ld*}7&#lhwO+52zB
zV8jhRBXv_Tox>hxlqQ7~B&?s5DCFd6!VwcCM_LlyY}>ijoNP7e(y#8o4t37>eIE2L
zsPLmkquDT7M4ADygz|Dk=!ssMO5QNzQ={u<h$22^H2juRZ=F;+-LC3MJyLkI=42~5
zb*BlHRPSB{A)H!ZUeHw2X?9O4J1xB_8Sj<X6X7ZV<81wI*X^8C9KCwvP0oB-yRHVJ
zj@T5d{{s`B%pT(oIGmrIOFOa<7`UR(&~oIBf{)2fxOWF{U*(<BKqVYj8qAtUc4rt;
zn+;P>`)oUFDL8Gx!r@dNhTu_NJL^|Rj(4Xqo%Wsbyg@vVL93=zbm}L1RdTFNzq|QK
z4#;VC<TI@`GlyDk8i1s>Ig&<m0AFzjI^vfBn(nJWoottN^g8D=grbQ<_t}#?2Ma|D
z3c0)`=mjqnW<ED~8+o6bIp>gxXFN?7>fJJkc8IcXS_NJ+A!P(wG<NbS&k|}Mmvmsm
z=dAstw@iiz-ikMbsbz1(`Zg6EL`B|6HNhH5xPXFrhZdwg#G~*sdk7>AYkK0OXJX@#
z>=*C|tLLHEpIn$Uq*!#%o_YQLJo0AfIzmUMTGBg7w#*kD0jobsTE5UL#awpP0U6mm
zW^AXt?t-k})KNLt7raBfSWuXfOg@VkmA9_Q(pIa{UQbg^x7+NtJ8pMP?KwNmX1mjD
z);o<(z1wOzZRaj6*UDjy4{;_{!ehN!{Z{ZMy{g-1;nFZHBG-cfQl8E$gJgXxFENZ5
zwU;B?q<U*Fv&cCm$+R^hzZCqFjk3r+V#kq(t|UH5t4lA+y7?&6-syJv#Q%;j4N2~g
zJlgX-I6`9vTmpGzCsC>4Rnfp1SZOU8&6FI0{1u?2q)%jgoT`NIr-_A4G`j`r9zIKp
zWO21ZlSZ}$-X^;7%EUt1EpG0VaHm}?<Q2Y;KIWEEI6tS<qKOWS(hnznyn0Rp2<@EU
zL@4NTw5ZGbnt&@0%%5sz@t^l~ER$#dyYzzDoeh8DSz!NfxD7|Q|2ge;yY<EX_YhAU
z&Z9neHH)7Lr?{v6QGjFr)mOT8kgN6;WDS@vv&%5LsNhO&6q6H&w%8+dn)?ug7_2jB
z7FL22{p0C*NY)lAfxnyI$xTmu$KNyGgF*5+7^Gjv9$6dcQ_abA&Oa-?Lm9n$Q6lXh
zN^k&F(}q8rPdOy2z^HP>>1Q}(RkgRO(r{7%iFyhG4Ysh8K|ua*tvYJ$h7|e`1D>J*
z+#j6+?Pv3t`;yJ4ir}#A9q}GJs~q|~M=f@Ou8K5#{$RV3kva;ZKkx1zv-mumj|L31
zok@5(@&{)=bC@^a0MlLD={34dpos`oFO4K(K*-%X3>B{{`GthGnrvkG4~g@gEJ4ib
z04-r<$4$9&YbnbI>x=_N#TpAJKyj}WD!2v}(En)x9ZJIPa<c>bCV{;)P}!k@g^%MJ
z#H=?8`xm};)tJ0EFVLP>JKBGBbbRnmFfvZE&to7RIgrY(K?nQA!P{dS*b7_CB`+$m
zcxr+E%t*8tL%VW$!lvknEPQl#U;Ie!HR#|R8^L6jBkg!Tng!*lr@=xyeRdfI$`u@0
z5TRI!#70l^3H5bvBXIl03*~{HJpHd1%;*ZrI&{DV=f53z4E?Xuaywu2zlV6N8XgRO
zIE}e(m&(HD`^Vq!@4bG>xUrpKiX}AFVm_3f7YBXIDGuJNNM6x?n396T)^HZ$6KtR)
z_wjofw8h(@<EgqW*!RMEPTg6e+L@?!VgsBDC=7#vz+lVTdXdm*KKUc4G)HXRR%=Nj
z%{h^lq3xNdwtz?g3t8l?G<x(+Fu3}TvYo9)lN?+g)mgi>u#m&r?S+M0rrk{7kzi5;
zcb~toqedgmWYF1rK+vg|A1e_=QdV4MnDeVzhTCyqz@41I?w@<X1TBA{7L$529pP<*
z@fg#meNNO_4(9~v1!6!3hXuvVo30<-CGgcC(UEmqo#jQqqh<K1u=8cameDyyz(h@w
zw8?ytlO2!Pn|&U`0f78rqmk*mcGuBB!H@r$;i60>;-2P3u%>wttT+<EI_5>N;=Bl!
zpBI0IS@Gawk?DJdSz(NY+o4MxHOJkdANJ8mAm9<w$rp}?2T=zl&nv3XDT)B&UQVjV
zO1pXTwR3B6kpjM8nrBO<2zMb9O}d+#RqVoON~DU1u3?u?m)n!Zom=uTo41?d+OoWw
z%_Cq-nrvs=!|HinSL0wJL8?8e5{OUT4Ff7!m{M+50s_zo?pNfSg?-cu8l2l2%#d&F
zT}eo*(Bjt|*cuLoR`wBl5ss&LdF!}8Vjp96h&y-tXt+s>^yj8)8Cek;gqM4QU2nP@
zUn@h+>$)eFx=Fa?73#}mlF<2gwt#<mBg(5-DiqLH>FXP7#KGduY&913mXc;E?9ys0
zV3<~34$HJ&2~0CgkO--I{`gjryZ_(+W62;OpNQF?)OWHdJrNbYW+`$TqP>-?=k~7E
zw=8uMV-WOC!E!-|D_E{d^S>^zwn$7rb{DlH)}5rO1P?<j5V@187@<L)MiaDkI@!Lt
zg)bQv&>pp#n^d!L4nIRW_?cuiU!Xu#a|c4aNaPQm39vc-U#GAa$wD4&LdE1s1{FNx
zx&?kJM#X{*Rm{YY(6BKud3$iYDmIp5gzU;rdft~sJ=5NoMg7a7{$)}BLl*U%m9KcK
znqBXfsGPgV*_O;S52$UQCEB2Dpqbjh&s?@!R23m`NVq2DlDX?$p#(LCM=NSU+9;5Z
zRi?k>#lMM}W}9bLh)K1vs0K(lOvWw?=C6T2AMU=x5bt4>yW%mP)qP7k9Q6FO;Z;^c
z;}+nfhU+@I*&$io)Qd?L+mj=P77rat_SK>#Yr(?1Fq|8AxwrFclq_^fK{^f+XHxQa
zSR~;OaaI6-!ynyl*Yre9qIP4`sLx;?=XO04J1Pe_^dPjmb791h^r+A7$|cb%@Tt;^
z<oQ(@r7XTxYALJtSW-eC;AdFF=8A>S((YLJly%9%r?guZXVM%6q^x_EKH3@Q>y#wq
z1%lox9JDRqOOFy0+o>dm*SZXt38!V@GKY|v`e+$m)PiHqfMh(vVSE~2Px=YKe0cM_
z!!eUyUb45-D9k&_%q8gQ;ekj6Lm>?Wb*D5^py$rxtb7$W*77=6u}vV+le{R{@Thw?
zn|p_cOofS}0tyYAM_|Cy=6K!{=WCm{X)=nGcgU$Y&;J8M`D2oy`}hB7G#XAL<Nwic
zzW9GU#A96&<lvhgATRe`CrL{@bb31*`FO)_oL#i9?B0C*2>puWVg*W6%th-;`J0N$
zWnEj<fAS(PI%5D&wr6P7(UK#Gm#!AdU%YIv)E`dfXG1Wk5voLm;0MnQJU){>Bp(yw
zeuLfMf{FjvPlJEl`}K&2{hWF;kXI8!@8D^D{A+dtKTfak*VAkI`3ZYC_2_4he)hA9
z2&v#$o#LEW)BzsG3!ukw#a1>Gn6u4i0H1|45ENd_$nT*yT+k}ZAg1;6^7+yJf9)9u
zPCbkyAzRe*JQ5#T;8AIrLWTE*aZIb)Rb#UUO>L~GoDLdp0AdoGtLPy57+Dp_U-SC2
z;G<vTCAD~x@YN^8_xLvlx1s#^bavp~UFN6<Waes{+==H^Pf9@HWEJndU-plVk4&Ww
z6-w;{4_{9FOQfQfd^SDrLVze^Q7j7T0FA`k@-^w4QiJusd{`sJJs`ew4<<-}ZB(0|
z!us|!iwy_eA5Ul3G@WiUcnSd|i<}fgm@US!lkb<QoyG8laDHLaVCs*^ImR5CA;u&}
z*O|%0S1v$N=-%2S1PVeu*n~m33hpK@9Cmg6>EfT!KPRu~PyFrO{@YjhZ>m2IM{|ly
zJ}BY?6(=p~@4=6o2o<W5CwT;<kBghaND;Qi&|}J*(PlFt9wMeY+r3ruW(ieCrC<^*
z0Ax_lgDISp(URz?0AZFqEpeCL<Kf=h-8Xx}yK5eMXMUFb#@AU{j0jS2Wd4zUIyqk*
z{*M}%<V-f}O0cMT8))J_5B8GW3Sgsfa^?%Z)BzT(I!?Gbvw;@vCd>W^hw3_|dnRdh
zN&|Bd<|t^(u!^{=fT8l_2ZaC&CM<6!nQ%QDDsO+uA3wfrR)J97xmF}OZ)H%LT&ZL2
z79!=A!Af0Rp~D=^Rv9K$QPT&iBwjf@vj80S#NDthMP-KDBwa$5BG%Q??4|R>Dlr6K
zPQrAEb*UjGlp-oncG&vo2TGztbOj#ZSDGM^5>Wn$gl(hTKxHM01mxgH`)J%NAUb0d
z%965hr~|gKXrh`!rvS71$f3^uF&ufbU_`u<SUxGDD?)mF42ojRE<qmWK)677Xu_Bj
zH~uNB4bt{$HWSUB;8{eAPJFeucu%Zezb#}Gx3Fc`-n6T?y&S#JjulK`+=CgB4DZHa
z@WxqIFs(qiT$!a()Ga~MZ@)!DWES!7SZRu?6(xVwoZRgTmrm@-%jc}F@p#@|#@PJH
zjg4j7SGdE;1H#En`Vl5*P#mi74wxe8IfN(K4!cFVprJ<}y!%yM(#e$1wYmZUrZS3k
z7ep5(<q#YDnUQTdGIv5op)9JF9vBWmy^#Lv>AM7(c>oAbD(1>xoRbXgQ+l&O==1Y_
z5yu?FyT0h7hzRGHQsCX|-4}bpdYUs%uAxRJGCrl8Ymg3Py*8{l+;75-32TZ#E`&E9
z8d<GyK=m=q*YHi4{Rzh3jb#q<Y2XidK%D?DH4J=Y06eq<S&I<T@ECWIBfb?J^olrR
z4HIWwY%M_%t)7Qx{_+hN=vnL8D`_Z{pxlBvh2V?d%S|exEDiB2gcr47GV^g`_wsp3
zL1&pj+89A6-ef-R`BCmX!m|fqkKsVUbdhiX$T+uw;rQWo1}U6o)HU`e7iWLw5l&V$
z%0vZfY3sNh6?58UR(ru0xUg%>y?k$KQHB9KEhy~R09nPN7ZK9w@KIhwE?)@sV8|#5
zl=yDhpXZKbf&Q{+E|w;a(b`>TU@p(245n!uSKe|_L|2dXSf35Dc;-|`Dh`4(U)uN4
zV9Ng%0nK^M69ZM5?`}a=(OXV!@)#8v)*^q%BUBdlms2CtjWzb|>X0uUG??aeD(_o{
z4qiHF(WQS?2KEL6{?P#)qLG19#sf>+cFbW_n=U`3SbC)a6+JC8ILnsLbdl2V&JZsi
z#xy5l-blKlN!K!vE+0t6xMvQf*1l^Q&1~~!M$^5+Xy(<;8_lK4XSzt~cxQ+gkEV>Y
z7jy4g>yUnuQ|Oa1zdqrh@~@8Du&*)cz{;-7R%l#v`dB!!pYAeIiz-{kYUv8uP85>f
z9ct-nQnZu3C^^EeY+IjKVHBJN6K`}%PRXecrN~u<OF34urEoi8j=o<_vRmcVV49sE
z>rmGy@~BI=(N(?ETj;+(@{N$(7PErMt_k6Enkf95L$QVYy0R!Ls+`NO%L*f-j=~`8
zfw~+cR8_uPQkGF#@(hpTTaqyJi}EqaSM9Lbc*>lP)9LQCyUtE?p(rz(BG$<1Xd!D*
z@l{!)sIqmWm#&cQM4{{5p<YJu$RA)=wz{+s%gaNVFT`>)S6YNvx#Y|WFD5dqFfVhy
z^wNoy5nlzgTF9d-i?5=}xjee8_%iA!tg#-b%dx;J;tOLMdzMHq<cJMl_>PPJUdUnU
zg)a+_{j&S=W!mT_dEkLg&Jpfecq`c-7r;?skIZYVzDq8wpR?;-rH-X5eIV9?L0NvN
z_0OVkKDETSQGFe0Ov$vxJf^QX0XYFB1svAXC0g>uWqs|QMDn4*eEWwc8`?j#*qQ#}
z)#1VWckIRC-tO@plsI!VFSpERSN{y}U-BaSCsf}Z1%02rIC%f|7{>AF7>c|(f~wyw
zsP{bVtyt^r!S0J6m#*uw7w29y3M8z}yqdiH(cba?OHQC_FjxT9OY{ln%{KCy#dA6u
z!>`Qge1*d8N@tbHFhpj#qF=;pzhcArXp}c?tyQq$qFUC8ceSLTzcQ!i)g3|9ZSvau
zd~@(qDYvbRHxC{3%M*Ex*2cNVXp!rVrBLp%+@f=ldphgGD@E30J|ds=qv5uDaX=PK
z$PGdq=I0+onEr5Cx@OMkv`#1CL^<wYPaZi<cPH0DCFj^s>GU2?ItXq&>7eeGIO$mF
zjLG2M?D>eDgY(Z1+}lE+@_bS1i(OGN2MFrvLB-N-H)kT>?L=iAWPWJ+E;@=?fs(?F
znmcg7G#&)Qp&#La@yq9Nc4B#%DU5G>>@ti-g9Y^E^|L-ZJw|T1MRZ>*Y3Xu8t~8{G
zjY~_|<=ZRtS0T!AO3@r8taS&f-M23f-u$@t>*CXS9(4Q4Bqhjf-E|f(Uc|nyhBFWa
z&DS|wklY;zjfrso;k#OGJ;I0IJto=rJNaf>Ly2f$I@;&kg67Z}Gq1S>y}afWKBD|4
zN&i(@RgRj&9QzohH$%|FKeOm%2Q49zY&xf1<&Lsbh7qpxX=d&zio2!DJ)3NH8M0Y0
z2JR+57jzZpo_nw0&v_5lz8F@(M~<t99LNJ{Fp4jH*g;=LLFmsfe-DFb?g!!Tm+%k&
z`TM1Qt3<kx*<V1PWtzOd1Sx;<C-44ed_JEI!pl45eV5Oo{4dRB+r0nTt~bBj|9ptY
zdjC@nzIp%i7z7@R2C(R3sQ;di6353gDUi>XKHh(3y|dH#1aH9eE7GzhYorA&6=H$C
z3(G>OYG4uKn4Ok`)5pvFZv4cpgH(g%YaDN&o77;=Vb*rfiTw{g)Ii$QV%Uk-02}XG
zWJ>%>>EXqB01G#40<bMgu&6cHJB!uZ=i)YBU0-$wL6l>+hA*0l8cX-FN1oXRikzl@
z8o`KXFd(NmARmV4as69}5t52}p&GU7P154+HdH@RkWI#T3^N1Am~?30lEs0#6#Lw&
zgyclIJfG~lBo}~Aj-*mY?~QliGxTFr(+Xe01_`rCD7}id_?Q81D7H=q{t#1=PtHz7
za0qoTXWW?wT1-SN&B!0(Reib@|CJ4O!c5{Xcszsu-*O4SIW#Zc#`2SELP51Ww1Q6t
zBmd#%5?j|~lEpRV<%yfvGz$Bm^qdBRHSu=J)e2^_C^*B7yO%QK<#_;{LHHuXxQkR#
z({q~aV@eY>naLyeGiEQr0iazdG8W!y@C^#(MG-OcI@y^i9i{wqPA@!6I3p26iV-?t
zDt*<&PU>h+VpM@Kc*S@O6AHJ|vdUJ1N%3r0NTo|jC7j<$bHGcM#!AvEZ|1F^Sp4T-
zS+&g5|Hl5<9}a^)h}Hh}9hJah{jcRXEhGPnTW>YmU-Z9+cu@M%0(1%^9!A%v>8QiX
zO}0%jkHn788}SsY3s&N!OwWsbY#T*AuDYV1v;aoYnI-m!y!e-PzoD34AjAKjRe#f7
zf5gn30ER$$zj{LKT^VOBn9QEw=J?6RCJ(c=ajRTDuSNsDOk&Fz11<SN07!Uc<1$yN
zW&<fK2~FmdblE>10hqBr^&)SEF1I|K&p4O_<M|lHW(=>%sw~bW(V)EjRVuEQBOu~R
zF`+PA=gT1Od-P%ogBYtOLsClT5t;`J2NPc=(d?88wW{QU+qAI4YNE;@oP!*CQWf;r
zcv_{HO1w(s&*sqtbhe~gu8yTiuT;^JSJ!UvgyfXRIF<41PJzY>^Q%N^xcIZa?W9R%
z+D-n-O<!S1cYM`QUe(<uzUnBi+KrtiyxK`F2PU6*<dHW-QI$6QRwWKL*=af0)f9z_
z#XP5yHfMG#E$FtpB+{Hx_&X(pph+pqdihl}pPa_wD1;&Phml7Y@vI}oKUZ!kGGr7C
z(A3K<t`yYj8vgd?v#{oc!&>B1#I4%YkNTKW`V50c((+wN$Cz^aYB3#dHh=TSAhyCj
zX#BvqK#EiP6KB}Ti8#05NB&r@KO0dNKQG>%LLYRFvEy{z>{#tmz!fHN$mrUtpUEd}
zN0|A}L$~mTV3)M0V2zio&CVk~J`YEO+9<pPs<z5j>|ggsehq`&wwJBrU9nE-I<Rkn
zIaljl1HqU(?&a5mb~%sIcB4$e+B6&mz?(2+XfUjeqPZRba~e+PBUEZTq-X$R4~7nN
zT6KFVr<0U&S;H7Dv8#vu5J+gw!!IIK`H@TKQ;@<w7u9q|9b!62ATI5kGLw@A85l8P
z!c%+$QxP;?iy8gdGw7@r#+i711U-g=sZfhm;=%$edNQ%8I8140yP1grt56!L0u#J8
z4nZRfqm<h+d?rfbA&EaLHO3B%F_Ll``5*DjX*iF7dJ*$K27HtL1kdkay(6`q@~Cp}
z9GrO@8IsyvcXVPZm*4F34up+rK#&8VZ#LB${K(C0qhcE;WxI&Tc&g;!%Q^^0JR-V4
z!S!U|_X9cyAWrfu&BZ=$k~X$8pOy(*i4QU&L37HXIR)8`v4|)Hd^QwzZtzNc_#P_}
zV|lSFshzJ@piwxLBr1isvm)X!s!JliF7Y5An${m8UR+hO@(PN1#n(C9&&^_c1#O51
z!GMz00%6Mz(J@WJb8fH0Mldk2CqrP;GL#*gb&_W}2`X!V=sA^ADm%7PG32u7Ln_el
zUyvg?qdo$OisA07ydM3e$Pjp-mb4)qNX>_Yds^q)Z>1>F7F??|$-}Ig*VnCOaINqZ
zE;jfSFE|=t0jxK1cAD|`cJ3ryiLx1(weW4h6sX|$XRLajiO#PV<DEalc-i<%VNuX@
zRKiLs7u3mePN}lz0q*LqZTeQWf$YHP>pE=rww-LDM{F=ByW4qicCJs{Eu3lRpSCC#
zPoB<4CfN{Fzb#ACmvSG)RHAVsA1(vqIZQ6>*hkUsO;~5UHI7+tK9f*I82Tp$@iFmZ
z6a`Y#2x7q#Sl7z3e*>PKgmQ55*fyb&I$c1qZ`2n}4gIf24CY5LyiQWP1B56-`(YH#
zr)aJZdBDCi#jc4DVlnYA%P1-dtfDY1N7baN4o<}PKPXkbkEl6tBR0B(M<i5nTSakR
z5_q42#*1!jQEcX-0BVYL0jVw%c5Ly@&hEkYAl*H>n=lLY9m*QDB+?)mtzX2B*d@V^
z{iE48Qzz+{s$$LjBEnu&!&b!!MXkjbrIGJX(F_dajBsb^JcSSQSjm^3w#J7J8-Z<U
zac@N%JC5<#_vrkK#2%t7<YojcKNBk_bR&sxU)`1zwTr~;mj!&q1zZeLtq;WcJXdaI
z9zQEu{T8k8f1OoV9kVjaElk<u(E1W@R1Kuqq$xF+lkG{NbN+%&6}}Uvq{Tgv{HAX3
z;0hFX=1;;oEakW%!WHxa1z1)or!<lrBmquVJ*Ne{?@h?1_T2AZ@R&ld7rVr1A(xL!
z5SRRHFb;5rL#088i(hiahyM7I7^FHNVEu4B#dAK(wjiUpG;KuSy~#xYgzF65@8C7I
z%bpCqc(y^wG-Nty_5|f9R=_be&}XpCi*c%RQ&T;uwPDk2g4ts{AD-a}Cz7WJ^6G+`
zmd#N(6ZD#!f?^Ot=XeSX;v<Xh!)hz~^{;e6N{y?N&|bt?Ar)U3i`kR)0&*CPv-VHZ
zLs09;zFI$o(G;)y#lY<~O2rTp6Z}gXTnn(LJCW-BNIW!PEz|<YeHM7#sbA0y#F)EM
zoTEPK;=KBO9`rA$)Fd4EW>P7o6LC)tOHp6)4yK9p`B+}rWake1=&*B_eRSD*gMDlm
zMR~X&Yp@_*Ac-}==)xV8!P|3<OgS0$B&V4x`m9~Vbi}0*Z*kG=olQ}cZVbxX4aucV
z{?;6=D?GpBpZLWxS<rsNPPF!&sr-x1<ZR}rPRZD2wla&3e&w^=aio0kSdwm112{C^
zQ11h945*5*lZXdH`CkRTWY=u0&N%?;^Ry1jRVMC$y2K#M_Z^GsSbNE;SF&mep1NH~
z=~gL97ajnoon?3+IS?cP>}=~f?SxY5_4{+&irTk((BFtJ?KI4wEjVK)<TA+0FdCr6
zAmmcT6MH4P6;DerUm0z?0Z9tUYboO`Ac!Q&9oR3sMy~^)Qln(=Ud(RVx}#!;lN|Bd
z;@JW{JhWGi^FhB0xx1E+p?p7bm6Dy|tt!<2tot*Q85%|0^N1mvdzhAr^d)g#i-M;d
zPcLR_s3lIyf1`7Nm8Q<x=8pQ8cDXgZut_~S^&GhzhhsytUls%A=HWo0dVjkceezph
zBZb_SjY9nBjO#yoGk?W1+p0FvOl#m8PH!`){|U}kFYj=+Do;`~&HkAWQWp^<JxDEw
z_Lp;1^SSFe>TK~j>K7~Qmt)i~$EaV9QNJ9crqAbijGCaRq~5_N&svHWi7(dDe@$yC
zs8U&Tse>;~bLsur=aw|&n49$!MwB=hKVU=`v7QJu0z_d<nVe{PU`mZa)?w3nJp)rd
zBe7b7LS$X8Gd?^d?dP$KIMi;+54`|HFTc!p?#1Y>ANgl788JvmPeTw>v%nkiBdXjz
zG*MziiSA>uy<NBquF47v4F#G#($Vjg<d$=@<reSE%fnRKq_nD)u&nt)<{alp|K&IM
zUv~IkcKBa*_<zt2Ujz}%-Pr$2S_0PXKxQld#oA!U?6a{pEWNcaYb^L;0r*$709a5A
zFj(U(0u>c>3KTkY{^y-d1PL!O42;ir+-`j=MN`km`Of7ehACiPFN|hlA7qif6{|NF
zhM<W+q>HXEeJ(MvL)wIi&O~fa+N?=!I-graB~|nOS2KO^mJ}u4!4~_WaHd8*CE4FT
z55tSG7hS|JM!phj_cl$oj*rcF;t$R^)0oziM+h9cV|p<K1C`|{t|hO_lMYKf;*r-Q
z&huCwD23TiVH-)iR{siSZjy!A=;q(pd=`v?Pm))W`LL*e)%T}K3>b7g<aghxBM=hd
zSnN<?6qvbB9(x0`pTN?JR0a?!1q#D6^pf)Jl34-sKMp_}pa??g3^TeyztI^J8XZY4
z5;P%2#JN_0-Oi94qZ8mT!M|gioS;u)L>WptIl+jZD14HjPDrasC}p(H+GVeXo437n
z{<E3T_?P9b2v|&MnKFwU`|n~>TTs8)thS(Xu4%1Yy{vg{K|RgH=8Ovlr^w8PkKN0}
z(w=seA2j!fmO*c@J?n$M=x-C7u%8b0Us{%kVIV}rFo<F?^MuPW&`cPYaF!<qsH~%}
z%_`Gy7kc?bsnbg3wEA0xwP8nQR}Jrkq;*-=ZG5STv7H#;cnFHEltL&mRYGKqaOe|F
zB+Sxi87D$no}hy6Z1crx3BwAdoU2rCAv@Izow`=&aS3-W%V_1A)wtU7Z&vcfD418F
zoF0wV#Khu0Bp<4d-R6J&&4|>?Q7#1|HvDk37FxHlL7y11q6l(lIbncwB{@(I%v>ue
zK7Xv|z`8c67Q7c)Pp#mW(V_8K#po#!UW?%qpL;TX;<Ky)6rUxHp!gIT1o2tI7)tGB
zN3|TG3XGz;<XD{^R^w<XdaT<>ice`nX{K<2?NcpV+F**$5=K*^Sl)=QVm!rX-4uRE
zPo3ojFh1pkFh1q1g=xu!X27&)DdS>x`NyY}aZW3k*ky#9JuJU4*c6vqGG6G%lJmCs
zWzLU6t7;^sr!8JZ<P}Maxw1gH^?60B4?as+el!9sw*KI=J`0d76dci9hJ*VH2U7i$
zK6&w9XQOx>q5tVAj{oYoE!T|y-)=SBFY#X=;;~xZVDR;Tim-0LJ9W*Ndi@Ku>_-0Y
zb4<JhpAFmX&GGA_XY4KJ&FYhJbaF;nyx=uUgR#flQiv}x+=wmJOe~B9u-ru-S)HAS
zc(^D2z)B~&2oy?tHD>Sj-@Y={bFw0-M(54_rw7cBqA=Pt&CeW#pM>BZ#Wim}JFjsI
z1)fOYG7w`nFS+Mf2lzzlXU~E$eq$d14O|u`{%9F2jo|kJJuTin7yT~|-hRLTif+$m
z5S)ZrSCP*En|B9TVmVYoGR}LWzYIdxrib8Xf{V&(vc$q^HI2eq*bhgg=2V6*X>Dlt
zqqFU<LKyhhVK+5s4;o<g+dEJ|ktdl!T?H8D4#1RTt(1fnYpwwMu=RuKIjDeZ8nnXV
zva8C=z3+G5zdn9e+ub{I+@0Fd54&!wUAY65dDE;?+kO4|ncnJW!38FK0N5JfE6Erp
z-9JA<--W|VqAZJ+kYjj^QRCXwA2K~OvKrj7hN06Myzep8ZUO6ESJ;O^(4UcI^@CW&
z(BL$WwN>ndallU&GKX#4R$O8~E0QUlt(#;IFrUyhqei)20<?6+A<r*>P9BUaLgc-H
zTNKz?_$-Fm6$}Hr9zOPBH2I04vK=#~rA~2JwIR+c$TcTr_)X{a_c0pbapM#Dc;5l1
zzv%s`*me;PNs1gin(BL*{`fg*AA1uSMl1goiyb@A>M4EShVL-Y)62n07GmB4<?SqJ
z0lp_K=uN0QMV>D@b<E&@>tj|;LB<alRZ4wNDQo|kYcCW}I1XlN>qI!E6Xm7s;Kb(n
z$q7KDEn)$Ds<NE;HyonZV#*d(W#}`NEk_8AV%KUtRe@+5Gw7Z2>G^Cv#k>UxRAi7A
ze_;D3Sqw@zp7T6NxTV0mF?~GXoP~0Z%wq)Ux4Ai_f3qFQ+5fW7?f5c4G<*K+5>u|u
z`crZ^f=+1i#Mb?D^l|YlgVwYBKCsH_YSLg`O}mE=o)x3$&9wgFU8bBV52?YTQdA=8
zJX5ki3S*0!SOST9NhAys*}yAAAVKp!kjNVedk^xBoy&d}N1^1ug6@EmesoPXb`TNB
z$0nOSVlUD};z?l;Zn5o-m}n#?8J#NXPE53v>ZfT(m8y8RoxIa08YNj1o>cK{0793A
zQ-2c2BNoLTe3>xW1goL%YBk$Q&GTbW16XYeN&=R_f1f#SqsiRwo(}wvPbc%yD7$(g
zAu$jn&=PBTRPQo`p+G^R+y8CH<+|w4z_nl(^?t&GJ%!>-4!PK}p?bvLhL@CoG=<O5
zN^(FVaxf%Ax$+hiEQcO{uu*r3C(r&r@;+S;Bj103{J(C)b<F&~t)}zE{{Ik<)&4IB
z-$+qfdH?qH{@WihQY<JS{gD@p<)J_NPka3f3_Lg)sNUH)f5Ip@%gq`l3waTCohlGH
zN$KkadFe+ywkdDQn&DK$a~xk|!#A6^RV<o(O)}d?jJt_Zxf8tPV@Bx3`cvP#C`3zX
zPvk^a8obREt0oP8$EuQMU&|12N%68iI|fwfFqd@j_rEVHD*N9|Ee{1*HAT|0ASUM>
z!5gsX^sX7_nQT%`g{{7S{r>2Om(SVm(XVe`eBrK=+?BYyL(A8b{=W!2X}t2Um8$h#
zp1k#c0$VhZY3a@yz@qivY1YmBuTK3-{?`Y2__oR12TtbWo*zjGsOt!-T-1C6xY&Z~
zr~TnsvRjnXT>nbFXvwI(k1+K~+1GZKB)svHumKEV&vlxV<u3sO%q}W_$A9~<Qq1%v
zAZHV5m~J^XX-#7fTum^jrch~x^$lv#?pHy}-mkuk2NI3YksX&q-05gNOVe>Kw9q`J
z0p){uDh9?_Gc3EV5nbnEbjvK@MjHKW*RtzZvla-Z;qmi%W4NIdx7INEUl7jY?2zA$
zX7=%*#H1O1?*+J~4+gNaju$ihBeLXv^hQBa$s7aC08Xt}y4~)!@?WKZ^xp%1u+rg;
zU#yB=%hISVJM?2?2b@dr9_mXJq(>#T3HRM5#{z=?(emxfQ~c!Sf1i(L!J0e(i`W0A
z(`>cO{eQjP`m+8%#A8pNje~D&{%_vAKYqQ>p0d4P_FiCC_n@zt>-l}9@ihv0<z+<S
ztoUms2DkB{m-nHsd?2VasrAvJ;1B%fo~Ti0HAi3gKe||IidQo9_YHiHw$=1KHBtSD
z@wqVe77t<$X#St~d++yNGV#yN4P}G4WpoOw?qzRY?jOC_J$(6jP$uoyMv(!(3}+)s
z5lI)2=-@{tsH4&4E&PNf?9Kbv$NO~Y9d~wkdErt&ttI!&C{p+8CVpa_{UF|-++qc#
zG>)j&-YKk>q6GST?j0U-I5ss1IcPjgK$1wv8&UeT=&b(~etgu2RoU%(xzIwfX*lJ@
zbQ((L<G)Y{J#G?^kb11HLHP6T@rxfo`-_8tFDNOt$af{=CH;1_5-ABPos=XZ=y*T`
zGQh|S7+L}Sq3D`0XqUgw{kf0IU_$IiPIlT1!_dJWZV`d;J`9%Yd68pc7m>zB^ra+U
zytCVEbr-9<+3HAxe1#2B-F<#=c&w|%=>XHXB6KJE-)=I@bz_)UrJidJf0^smccn6E
zeAW!#ra=lAP2R<&t8o}B^)^fHkt*cI*L3Opc5!$0<+{6{QP1xG?!pKAL%!DXKsQ@F
zAPDz*;gcWz1IRU|kAYP5>HnvmJ$$v6bfHByGeOWgMVALi{_wM15xHcL@c~LC9J^+p
zGH)*ms54dXiYfvz7cR138emC~*b|5T#<-@uZ-201tSLawE7quILC+Lw)>ngjWtdyb
z!i;*r6}!+#{-Ch;uGtZA7xx4>IzBkuqj+yJybf%Gp=+E${&+gO*0C~!$w<)z%#OUC
zL3S9b>GWbWQBbQS0x;x_ZxmSz+IUolZlwXtf0YInTtG?C!~<R-gwd#pcrCmUHQOJT
zA<&pHd`M!4O|O`nAp#ao=Q_V*Ti2R2v8KZowGT7-3)hh}H6{;sN74&qJ-eCs{vduv
zWi|Tk5?JxP-}mEqI3IB-i%5|+MadlfNb>p$)3fZrs!gssAu>XUV>jexq;+F<2Uza~
z*?pS4(=d($VX%DvmL|b^aGOu4*qVS9pz+(pT&?5k`#Cu)@j(&mT8^){4w4#go_9f~
zW4o_klfSH>$SlN|fjoaJ??S|OS(ZQ+A+o9nOW?#C)wF7JC?|Lsa5yBqEnuQJy1GXg
zGeag%8}E&r+WK-QY66t^Ld;bm%+T`a=iPT@NXb*wk;=Jn5sUp1#>%XhqCH+jPYvZ)
z?1_lP*{E+MfdKdoeD*{DOCkCzKq-IbS6DFHP&>Nxrh^{3F0Nq+mm|&~q+wo)Mouw}
zER?j84FSRh1;{6Y6OOJa3<4lpOhyq#=^lwF>?0`+F~}$$WD?W>hex3Id|U@Hd4V}=
zi3F`u%v6TJj)lOjvUqZb^*C#ye8diYu1=y;MKA#^>E-imM_sd}+=(exB^slUj7t&c
zzJ%wz2t8Xv+>gH7Kin&pBOG^K)y)!3Xlw?N?l$sv6r^&zSOVH0PvI;;M<}{#%*fSo
z5f)??pHn1H+S?NYb0h~rG`og*?j@(F+$Lb%?iRD83863u7nC4n{VE3w$0@=?YCkfL
zNOm~Z1apZ>%b>wcE#lY%mCY!edS@Qp;t4?j_E7*nLGcGN=Q0XriS=09CCmFK?1ML(
zdHwU#S$L{k;yC5`eoqR37KRpM@2Tn6V(XM`m)~hIe64PTq}bH&aNJPGw`S3#bK?sc
zc#>C&K@aU<xu9@jFHdLMQ8SFy7<&{yV$DRhY*$R0uZPH1g5Edv&=^{y2v^c-Y_a4Z
zRAhB^)=1Yg-tb~dQ_t=_5t}#uaP-#1!4~eoebUD_vg;7=L59=rPIh4fHp#B&5)}3o
z_n>$Wkps%JKZBY{8&wgG9j}0Z(4K^syptN;NxAe;-BX%N>0pXm1Y^y^D%)MhfEue6
zs@G&<8_el?-oe3}RZdsdbvlxBa+fT2`4)Bn+_bHmOXj-HRI;ZZ3+(vfFc>+m9|hAH
zW#9<snkw@M_7Z;of-__=Ob(Ev0I$@G(Gm5wkW0~+8xT83{t(@ew?I!;8J-`N;`RWq
z{_tE4z}kZlH!kSlJ)hDnnN!3f*h~#&Om}73F*w0l%nDS{mF2R>aB5zsxmQD!YNG&e
zzdD)it*VVyv3DQSson6C!C5p%Y!H=ObqGmEbrls=FcGxia`yTMQ~5~!%oV09y+9;~
z?IKV%oJl_vaQ9Up<LOa$6(IWSxrhJsr5<=5h8GM(Mljjl-Y(y{S^!5&|C)Eol=#5$
zvs8U%2-1GwtJT$&y5&+gz-XP|97enI^Kc|sg9{pBD<02}E~NwWz#u-kq=2MzK>J#z
z_`uH_<{Sf*00_Jk!2aL=lfO4^?Gu93|0I@{ZsiRod{p@{p@!uYO5lxRm*yw*JQ$j{
zR)qb%N<}MJqN1}L&Gdf|{Z)@YWqR|&%cW*FuaYylb0?|NT+VbA8Cgcj%7z&m0#3g?
zBK@JW`mS?xJyKzfGw=EPqhHO1=>EjVm#M4{#@(kft-3Yt`4<kZmzmYctc~Uqyk8xR
zLCu_^K~<fgGJ6q?wcMPjt2W96L{JEY-aNh*5PX@mpV3<VWhwqF=P!lw_#@V1PUqA~
zEjxX`EX^y;@;~j$i(JFQy>ou?bGKHRS@>t1dE88b?njz2DCQH99QgQQS?)BX7U(yT
zhA1|hN_<6=%Rgze&`E&7>w!quK>J8|jt=x`;^a@04FBhu)2|fLIGRBrz}Q!0h>2^n
zu*RWZ+E;KhW$CvEhkNf{@4whRT6x((rrCe{;!v2dBr^`ma9=6>>Uwcvlp^+^95p6)
zjFNa@EAxup?wwdglbHf89yG5;u+}Ixypjv8G;i6ld9`<pvl;42qfI!`sj_9b^Knx3
ze83kLEMAoC-CVdKK6s<KfR{PrXk(X#0mD=aqw_da&&ikP-Z#5P$9sn_4}N}|xyPp<
zkN4_$*gHbK0A%f8aWTND>@!c6)5rn%8B^P$$*yvn10k7*lc;2|%-b^Zx8%r~us;&c
z>zDpx^l1kb1D1c-3OtV0cDcY#t7k?XmZ5w<N}T``%-!MVk8dh5%tQ79c~L@Gu-j78
zpL;Un^d~OW=c;0g?ji2KaZes1yUiY*(RIw3#?L<%F~7-K3QhdUFpT=b9<Cth<{7z_
zy2D@+#OI1yr|$lU1eT*rplIR&3S_+@1o*8h{q}g|k9;pK4Ov|;QeeO0F~mScgyu1;
zrH`R4YNDCsz=V$!3fHAZ#dgH2FSUF`{+J<H+J`?mYq;luc@ARjLc9ASLZfk2GP|t-
z?F3`TOp~;E?2J{}n;(yk5BGN8e5DQ8m?am>l={69UgDzD=Tm+sPW>1y`p7-U(-MyI
zyQ>!;QRdaWqObS9KjuHQN}r$)OzFvsenLF5-@U86?^h&vp1(eL@gu7<PL(5|Qq?TO
zsVIK3zNN}{I`^v%Ovx91gOHBm60an@Hi$RvE&so@92&`UMv?LG-TUXS_m6&9#TOu7
z<cmf#7w(j^UQ8Km-Md&;>3MI2v#&Su@IU2?ek6N;J{$%F_v*)CjL*@F!~J)_xCgs0
z*E>c^!)qERu{9orFe7e6P+d?&o;(I%A8)ZA_kKP4;GAr+$HOpuym6b)?&^p5+)Khm
zBG+Tg&IcHA6&JJopL4wTe%gJ#;y@er9@(#7OIDFd(d`^=u_<DRo)-Z_FvsSh^#FrS
z0N%qW^N;}ivzDW>VEli9<>2M3!-MzlvY}Q*N2uTP*d}Nn#9ZyLZSyd&O)w)PlQOPP
zHqh;nJJn$1wzPSz?WNg^56~~WFJI!#YYx|D#tlc5qW;(m==yjsEk3^Ht6}{s15Mp!
z`j;2GulL`uCkm_ft`$5skRB)>h=)`5eu~<a0g29;0=lFn#(zq<&>eO@_F)eq*XRWF
z%6DeucAZu6S&m(a<?Jj=pRUl`$ohc;D~M|=Vc~dQlLrd4Rnd7LAN{Wqb0Dn*v*9lp
z%qB1X3+AU^R|2@=_%E*OI1MxZTf6xs{>y_r*7z?t_)J6qG-JRXz1V%r!@pFt9ai?T
z5Wl4fJCFGYH(eNcQr~Lz=aFHTqU#3ARZng%ax78dg{no6R-vJ6oNa8~)Va(u7kUXJ
zTDOe&$)Vc3tzKxKDfk`s^6j@6M6?I8<3f=dS;Rh!=vHtICfM(D9!XjWrllP@AhDqQ
z$e*0Swp=Nx1x}^0cyaLl?eS+d7L20rvDUxtn7qNO4xiVUaBEEkT6pIC`@dKIdSg>^
zXpVn<w^uwekJ2&WzVc)=!s7%yXO7E`;3M{eY}yz=LsaEqTtH=+4~!GIwGQ>{dg`+Z
zT3J5lVb;bkJ9-&9sx%BH4?{!V=bwg(Rtc3MBtO89e4mH1#zmgZ!ZRQJXdZ~5sx;cH
zi1os;(C|-0XQcw{QGM8dVlEN9r7%M%&%OAZwCv0lx^hH<i5uW2{cwP$?JE3M$?Tm)
zniAYm9{GCu6@J+xHr^6?2nKrVb4YH@ExDv4W<d+C%zR$CxrEdzu;qJZRLcw#lo?a%
z(i{C-5{msd9*X@p9*SMYVgJnrt{l{)&FT#Y<+ghBThX3R1Z~6akQZcqbMr29kjaz3
zWLSuA{dij|uS9kadw5EhmX9&QJLX@9H@9Xl$2j^l_*TBJXF1)Ne)!m@psXRMA<aX4
zk=2#eE{mpG0z~0-!)L*i!>4fC;bRc1q)vcODZPMqp>(88*-ycg&L|4z><_EV*&m=i
z%cMOwUu&~g0Fygyx$tb%%g<UVZtL|mPT4B8y4<Wq@eh@&zZK5d^Rbkl4>M=6rv;Pt
zhliN7=QL>v??3shbuA1;v+d@BeZ1xK(n5>GALRl^gOr8p$4b`Hr$X+sYDti6lEf_#
zC7i(xY2q#;PT~tOl{3=hzgE%!0DOOtqX>K|)CB&*G6gDfu~H~gKA{%y>A}>1PmA?{
z|9S|K@`*&sr@w$A@UJIQ6dT6b+>5-)%=e|=+<bx&Pq^bLp7t(pdQ!KEKl?lb0`1-?
zUjqg!+roR{MAl&xj$y|>3t6`-eV=es+4Ge~BFe{sSqtRc8OV!y0A)l6F1p+JU&r_>
z$VkKC)ESJ`04PQ+p_A@MKe}c#kQPedW8V@L%0cct22#x*AX9(feeMgHe4<4Gz(+k4
z&WwUKx#YyUuudwZgUn%@aPbNIj<s*e2RWE19)~7fwV7pwW5JACpzF)ny4nOvms;2l
z`*=x!#5DSua;g0!h-2vMk<)0lHZs}9s0>iSVTuP$cJpm)G(|P7sm$K2&h5r*)7#`$
zeMBh-S%WYJC!eqz1-jzSoHcaj*d$d-=y$uv$9sowb*aRI(;Lx6c|>)L(uJq+L$Ak%
z!6*D3<6}6?WewKM$BWmLm_aQCH5Iu+bT}sLh5(?BHMD+M0WH3RN%3+BGna5{B-mlz
zcn{w8;9Z|J*}#VA`T7xcu<IOb|7!(oKc$06!KV>X50OH2c~{veCyIKqM&z=n#C>!W
zeFi<AVG<nlSE0`+a>cxNola{JmNp69Dll4UROxQ->^Kd_?K<rpx7lsfyMC?VHq?Ev
zW%8!khBY#2Ifk+DFo-bG6XKb>z$I#sTKI3clI3U|1>|aW>ur@>3281kX)bho-bI!)
zHp8VNKd<mU+MC3kCcx_g=oBvut3rBbmUj%1N4~U%qBx)6*V-hcd&pie0f<3=(zUcG
z@~$~GDTUHaMrVH~bthD4OyIHNWIpyWNwj}81$sDj=WBCKzSR{D>jsFovS{U(lrlCw
z_>i9R8~g5CF$S3e_{cRmA(^Ei)2eFF<498&ZTc9@R?Ai<(SR)9fG<wd?;81Z(s51k
z=5J4`q90Vs*x&!os%drP?hX4668QRTk~Nb;Lnjh&XlHC}4>{g%yy!wO36<GK?O9wZ
z1_c?@)#>_jst#LPlNYc;*k>m@S_*48L9LPB1Hlm*B)4&q{RGvwGc8KpEg(vaZ95`K
zY{KD5HP}$@AIK-WKjJA;C2=j7?9TY@(P;?NQ~=G!VLVed0ppkgokqdg8Nb18X(#g0
z07jUG=rA~jjRq7Zs~DMPvq%%mrvneXP}MjoZx+D#1DuJ<CMUzPGeI>P90}nmwnC)&
z^Kj29Pn6L8i<N)G_-`MA$uLY4OVDWkwsDe&Ezh*d0Tiqz<G8}~uPnq`|Lsevw?FBV
zoBthe!pH0J09=s&)v34IX8t$V{o?=kAdfx&I}Lv70mwiMMo};TCGuwMUGbZ2F`6W#
zbkP#QYU-#AV}FWT8mnyXKRw_fKQ=3317cW}ZIv+36m+~vtC>HLRZ}hXhPyTZ7z%tm
zls<)l<G00RjDQS~{p^Kan}Sj8lbUZ8!6=;jnb)Mfmk1OnAB>?lH5DlN0dHVsEt*M^
z4fU-epEDQt2#@dB4k<{05vqpzenZ^3V^wV&zKHn0;FBl+&-`#*?%xaKf5&lL*Yy8x
zb~<0=|3f^F*bn|_iWy_(6D}Jm3|BDbyW80JqW*aeBV2fcV2*cGNP9o-!<HRysleZ1
z#KWzB^@x3xy06a;DVuPBp}tVJ^wLYl9`yC;(=`e1?XRX$*k{0PARN!257_jb;nfY?
zG=tiHw)w=Hd6Os3#^%n`MjLi;w`q+C&E01VYsnh$`_pU<r4!JOJ=|m6jKYaCfX&|w
ze})s6es_~>D|Af^ibU*#0$i19ounn8x>*8SJW<<lvu(I~8<`RaNm}Bgv?9PV_T)*G
zH(BGrL>ufWb2o0&(sQFUHDBX^>7{uwce~CuS-a73JKfH9t6kq|wc*7-b%O{t7XKd2
zo>b@X5q^9P>uLN%wz`@8<<ei(kMv_>gOYA5BZgb}Q@$z0A@~S$4=TYwlJN8CM>6$R
z<yW!2Oy5&+tVQo1vA5w&3DO`UPQmA3HU|dfA)Ul273`mDJ1yk!uXkD$!7B3c@S-o<
zq6_4xP(YDdhxTV*!#{jq9*8XHJUJ?LHaZI<;Ay(fHbx`bH1hj_xU??AU4-))%@w6`
z*zbF2O`{lOv{6p>U>;_ukXx~Bm67DY)|{O>&>xBUWMdO}{8r<pq*zBO<utJrj0L8T
zn9ZX}YG1%SF?a_OZF?c>g)<%^038J4Z76??V3Q&ih_k=**=+jk>C?;Lf>K0p&n})i
zt>#Xb4>a1<yvU~;>!2{crc3PjQzocHI9~?CA-)sVIcccapTQ2i%Bx5vi;kE^ToSRG
ze+47Vi@2<c<ta2oP0JmcShSLEsN`3Qa+K4pySQ5?zgue^9R^#qMF1-bT?%`|hcRiM
z53YDiF~#<WAZz(t1J>;aQ6J4EkAzS^MUJBA72;1!EaMM@31{s-@CJx=VXfhnx1ciC
z7-2+Jqdf1Y=X0+|Y|$SG=}w>aCoiZCcEeYa(~B|jG&Z9ElmeqlVo_x*S-YCFv5BTs
zh5r))|3MS?C{0Lou&UBoHSO&r-Nq!9zG1STu@+4tC9$#%5pRbc4F95`z^kktCX85d
zG?Mzu56C0F`Fh6C(&-H-Fd)TF3<kI~LtE#5aCSb+bOnO74=cT}#E}UT8`4JjFe!XP
z?co^n<`#}NZ%rL@-a<O$vPBy4%_^0D>MBDodP-{~UFTK-7*3btn1oe?uq{zN!)Yn2
zY5jl4suE`mH>oua-z0h#R^&{V;YH$5x%_g~>=c3Y2WNQiHJ*aD=b!ej0SW~4CfV)D
zZ|Odq5)LKrB?w7`7-&`KhjG-unc*dP{NDutE9-p4)d(eWOf}nIH7Q-PeUVsm0891_
zy0ew(O~<9EPa()fpSbi1Qq|#qy=wu|dhz6aYG|zwfLzo|aEVBzwGJ*x8WV_#zwU!!
z3c7k|-Vt4ke|p!w@M`U|WC8c&fv^VlK|K*O++xf&at1;rCh|caj!DY|c^TuPBAlUO
zA2TxuB2B|MpmQX?nhCb%aSSme1SszFvt;i%^<dw~c<N97k?%Np%fTmq0PT<xk6YLX
zb7^|qp$*}prD~h~ERt}lC)*zZOU$s2H_YfvjkiSMMF&_CX2*>7$K0SOP{F8&u&^c+
zh{hP%E`CNhvUK75iXY|6?oMTQe3sle%^lZuTis5(+wQVXeW$^8ob7g_*#*tI(R5oo
zjZTX->aay~TJ^5mYIK~Pc6;YGt=?$X>z$_4a#*YBv~dHoz0+>EJI+qC(}3MwyTfYD
z_I9J$sn;9LcB|d#cAK4~fo`|%G}}9^oo<`8>+L4&mAczdxzmO>u3LBEGc-`&Znhgc
zP_FGjFFW-{(tzVK2R4t;(ze@$9(SBh*X`EpO?bWCZSB-MJ8ieqY_;kV>Lx(jfzQnb
zYeA((tJ!v-;T@-eyU=!f+iiDSt(N0LYmIg%K^DPlF#ruz>AJJMv(xId+(x(C=<WdB
zp#OT?>2^Ea7LdyAIugeY`~}2?%?hh^>)TKtYP8!<8_4T)us@(}w^0X7;6-ys)&uhI
zz@E#&KHH6LAYR99>~sK?j=RI!&Fwls*z9!N`i|>3JC5wm?E>_Kozv*RShU*>=*Mlf
zTb(X!xwpGJZD<4F210f^ZBY%e=t4Cd$L=;zvkkO|!FC(aG;6oET>uaoLkQu&)*a~I
zYB%8()?hn;1$5MIIQ6d6+G#a`M$i|GbF<#)x^B~LyA4<N1p`%YxJ~>70;JsmSZgp2
zXxG~T5&<&ZCg9-Kw*gMz(w)u@(5BmJqCtQr!pGBKaD{PGtVa+a%Z$haH?Q^%WF%dT
zPe~UFLAGVHU1Re?=uy#AESetEF4lx9KOY{veT6rLH!Ip7W!ezJwYUu}gi?YS?!@T;
zmvnX;YUC<Is4aufjT%?F#1b!yXP|uk>+6HJuXja4b)Jlk%kW$<)0faAIjRT^uCd){
z!!+-*#?H3mz$9<8$~$l5N8_-9{951X;9P}ygOe71tGqzNUf@+$LfwMPo4q&B_YN(j
z=XCh&P?DUrcX)_AMgLfF!+=Ko*1C>^0C#fThqVEuPqPKGrOiO1gYarK8hB~E&&FPK
z;m_ph+>K*veLfwmr}cV%>wI8d{J_Gg>9(Q!{qlg%N#{@_?NfzB?O$;tl>R@dgB>&m
zDhV~F)j@B&D~DZYvUlBhz4%G>%GqEw(Kq{s)wk<)C2F)*^qPut*z}@iI#3Hq-u|+P
zBz1!%P-F3s{FzDe%hDu)8nvB2jwCx4Jab55qh1M;z%;NjiaA$G@y0UK)jAetufHtQ
zYk>$#hCjiT`^yOvNPIn+Vcb*IxP*`GkY5Aw>WWRS%7VzjgiiERbn!Rzi=vu?vbhMA
zVDix$1p^BS7s8C$b18rEL%}U!?T2I;#3(6C0lXMY;}{Ab5uOi<&HES2p|eTgT2bKv
zkpZycHLcTVz^;IR1<kqM>aYr$W+M<VQ}hI#JpKJ?RN-a2^+tWCMP(ap*iHau^9eF&
z3<4?gu@r6`8nBsZQYi;?0@w^yE@yp=G|ijoz<$hWbg=;JQg&d+z$(8DFGL@(C2V)Q
zoOrNla6zT`y(zwdZtpZ*{%xlYpfezKOVXmPQGvV9kO5)F!-N~jnLqJ!D<ni6G=1V#
z?n^Hlyb)l79@Oc=&Z^Oc?NF-$yGC}S;w`_oaPzVQyAhY&WNDa`>VQVofQ@mJpika*
z+ql!%fx0QTBz1P`u&?aGc9s3!Ox`tMZw!pqW<WjuvfJv`K}iER8zxH}?!MfAe}w1Y
z(~-}f#N@xZk>L$tsYuzQ3xsxv<gM;b6SmL|Gyr&Ul3m)0Dq*G*$pq+VZ}$+y<|2TE
zK?MO)tc5wSar+N!vsZ*sqkRs*-ya^l5qkzS?ckq6?M4GjIO9sU^oou>k#NQ$MwZ7<
zv3Om9U^LNHJ)=~wry{Ah5G#xjKgL59!m9)t9I8gbC}_6hDM84`8Gpf30Q!aGY$4cm
z<T$!!BHNV;SfoImhu8C81>+-D&wqV>@XG@XQ)0&^5}5S3!zfv>S$cRDgTL-E%R-%p
zAL$E6#|MXdFZYj*^EHOMO9pN#9}vlw9}a;}LYBLV)1)C)W?6+6RP2zyCP^<Bw&yK8
zc{jwE3yXQTlPAFzgS|Rw?+Fuluda%XZKvCHGWaRO!Y|mZFdj}F(cstf8h2geRDgEh
z{>l@|@S798YdqTaKuNnRkl1ooWib~v3kHjzO(ESqda({Dv7JJanm|iz7D3vZW5UDi
zm|Kop7s4yxEEEe+W;23acmUesCiPk*A_NH#NO>PcUexxYvpM=K-4$qo`JE)00Q2SE
zod?^cMzTEldo!o|AKt&(+e&V$cG?~5o@E~UQOs)1&bHfeK#A^j+U=djPQAlwt>$*C
z(QMU0Nd{FJ8rY%Ir`#bowRwoU^dBOYcFvo{^XC>8Ml^ojKmOsx!NK9n^h&WE^2Fp?
zPOnZZo@8Q4c10cNbEO$9WKcP!wIrm5?3X6m1Xyv#ibq`Q1KYwH0`iY>I#gNv^-<6d
zM%P(Z;qUKczs_wFmZa8BlegKyd(SOaLBqCFfzl2zC!SZ<wXfcp?^d+A8Tm75<rQ;F
zHs1nhC}|~ERB{3sRH=a*0WA|anU}0*uINJys^~*m(|LD%Oq<YYvrNZsrej7ZG9p9v
z#<en>lY}+4D5E9mgcC1{!pr4H7e|6M+S}bO5E*-N77QB}Zq<2Nx1ele8_1xPZKP!%
zF(egtUHaA~jb|`B{}$+WG0q#|($sf>_QeBESZayFb^&gWUBY`mny?>ySYoCa-G=)G
z<l<O!kn8JN1XtmlMqL2Em~jXJVv9y0qx8dQ0&<7@{Ncyd*u$8p#GuwmieFs%!dHO?
z9!k6T8-8i<)+}F|^reaYbX%>?j?->6kudnJMMQ!wy4VGXnpP9t9Ozq{_k~c@n@!i*
zX*AoiUWe*oH_lGGi3jnmZoR|n?O=cHuG{H$+fZev)2%mbeQ^3YOO@vM*Xylzz1x6J
z9jDQ-!NE&&nsmF(Mz`LEhIV$^R;YPtGswwI#$Z`pKou|=yWu0vN0pBSQP$3L#$sM}
zUstf4CvBvgpk#%_QxCfTY%G-x;D=^2Pd9FFcX%yYJln7X>a@&#QG0u*+wNwRfFE`-
z=~v9~N)$T#h@%9+gLd~K4z-HpBer+tk)A;A@jnL_!4!7O-nKCXX?n)lDahZ0Ubfw4
zP2fO+B~`=J6DI;el*dvh@^~A@@KfA${buv}DsxKn?m*fyvvOepP%!P?I*7~$G80RK
zh~*!MiHaWUS&qWWRdb-4%dTC6Ws?&$Rs*;;7M`9#F?V4x=%@zREo{xDqd23OjnHz}
zA}(00kK(x$yCRxNJ}_Y-<B-r}|IYAs-|`?8YKGY}8u^sd87VlDz>5Tl=v8V<qJkxS
z&6s`1oHqJ2(Ph>##!A3HTe@m@QKEH=E`h;oL=W38b#Nhi*v?sviPXmU$A2<v@18}$
z8NeM{>5b7tZ*LbicIchWWABb_@obeC<){oND6Qq}o5@rv%%sn9kA^>kA+p#s3i@r;
z6KCdJo5tosYdI%QITGc09DBXK1XR^YEHEcFe+77~z7hh5yKi5apa&DWhBgau5$7*I
zw~4s&D2rllqBRwz9S5>ePTuwQifYKi_ey6eaoK*$un7+U2BPY01<mMQxuZ0xvb3@*
z`X7=*e9;`9<DX<+yZn6_#h*y|)I5MHMO3RBW%6k~o|Lw&N7{v4QfvfNq0?x1V=P3s
zS@L1qoPs3*k@|-Uh_aLx0Arf7N&%yWTeOx{TsyMstPxNUwV|xOtQBgUa1E-+d|_LA
za+%0jb0pU;z3$YRVuD)#Oi5(TvQy*FBX3kLUCdwi&s;^tP;JjKXJmM=+=#7{4^w*n
ziRqZf^Zb-+_vi&#ud@ece|FX<2MLk?AWJ_OzP=YpOkBGD@7%6^nCp~YAfd^vb@f>Z
zJMwM$Owf}<S7-}I4<)pJ##3(+GYppT|NH;Y{fT~Ap7lE2Z9EC#e>=J5YI?yOCG3W`
zBFfzA=3I;D=yaDnaN->ZG2|@lpti6FBcaI+-lYN}CIXCVY8SOC=}@GBelP+JR#hVf
zi=c5{zdw)oZ4w^Dem29MKOU1L(cz2_N_;aBn(YGxV3Q?aSvCV~@H=N}MC8mx%qqW=
zrblI?cKL^F+J`ihMg1R2(1P^uH2Q%apDi1Nm{Kxe2+vF>G2SyhrOTur`lAq?o`caS
zi2Z&z85qg0h@^n#1j8QR@<5_${RI1uFs1a6o-zVS0tl-pH3J||`llWqRD>I%NHa>I
zja!D1oA-z8I-CPUm<xh#1c!rppZ4X^Tn`;9BW;T*nZZmC0W4B4WMlC?V&9_~9vu`Z
zRt5fxiRCHpLN7QI!{*1CnnXUjSO{%bB#&2Yon%=+gq=`;#1pWSubsLP=@}o+*k*q)
zl?ppc*lVf2WbKq0mjhLMlbZzy12IKo3TTAH_Sn$BgjxSTE}r!!B&X<NGn{#r26*Hp
zdEXj;p@_jSJMc7$^}X24xr5J|2hDxBG0X2tRxTQ{0zkjY|I3sRnaT!z6p3NU@S`KR
zxU7OteqkNpOx!SQ{Fvo&RGLv?aqWOBk!sY^jUvb`67`5L#2zfB&(y#&TS|Z!mPR*X
zNz@ybMzewCS(m>Q?Y=+4tD^JK%#3$WD`#}}u}s1(R~)tGhnmieh74|C7L>?S*J(7I
z3aoa0|Cueq^pf+K76d)CluEdT0iW{PRe@KiS^zjc*%0Z=OA8gFG?bE+1s0;mvKr9Z
z5zHNPh2dqRDa1v2ViToW>Hrjp9a$(lzsqq-nm!}zK9O{yD8zZ>O!Qra$1cVv#`Irm
z$kzuN>h3v`!h|rZ!un~NrE1C!Cs_#ti?igFgCDcX8ST^l_ATw#++2JyE<FZ7rZc73
z(28ZLK`<PGuB*inq~@vZtbmrA6Jj=2rRsT^F7n(D5{g%;6>?q3lWh{t@ipy~R|+*(
z)E+JMRsPpgM@xE>p?Z0NDXTmYEwiTzGjFi(Sbe+O?H1Lh7HB`D4`X2kYZfr|$;uH8
zK>_SHxv~EiK`bIzqDK#plqTX0eWYMLjLaP(!si*hoLDna=nc{ZDCva*YU(*mI5g^0
z@K1D7>U*O;M$pCIVZ-w=Ff-I-+w5Jl;}@?nQt4%^1n@%>35E<r<H=_+Fw3uN9KTB+
zuh#;TIse8_l!^MoQRt;{nKZib_=36Uu640QkDi5$^k5XWEVY*1QkoKJmhd;o!I7XY
zxeA9fd<h^21H4CpR|f1Gs5EgNN>AEbR}EAPH&jwM<Bori`i}!>v2S5}b9b`ZO0w)4
zF`Yw!%I4-Kdl$kQfaV97nDEaS_m>zDMlA5Z&(TZ(1+#h(Z-XLRKcjx~iePwb#*4Ul
zWiW0lmO(^v%6#|@_#3m=B<j>ZCzZP_f7bZ4qyflP?{Bu?v?lE@$z!_m1oV<?q#mHV
zk)t){SqqAqBLe3&_}5?7IeTz;S?#+bWaQ#lB@!-5+9TmnHM#G1_g@!ih-K}Rd^u3s
z#jW?jkGE!KRQ+T?slaW`R7W*Co3?$_bkP<RE2ib!Kgy(hUq;-|+!DKjLB<l#*T{xv
zGiBL=`j)Il!E^o5%;U3IWC}0>1CO7&PxZL>w<ngSFoGPlbvg^D*7gKyndY8iP<%DA
zzpRjw>Fa6&Ds;ZF0Dy5Y7>xY8!Jvw)Mg8@{*(@Bd8|PXUXAKBY*uxp<G2xKyBu>t-
zLY(;%OyP!sLt%<?Ga5kK_e7d$S_CmhC#(Rd{pf+S=_|(J&mhdZcrt-4@c9O=A+avx
z7mZq8gK;=7+hDC!gT5EfWP4^C;pFRThEr}&@>eLOUAzvJ-)?Q?c8Q{=OF#`144Ph*
z-n_ddkhxoTG`!1T$7hqZ$8zJ(dt3s+@;xqPxL$*uD&3%s*;3|gsq9X03;uy8YQ^8B
zbHho_e&H&$+Y4$|vD${28D5sZ&MR*@*`TEr$<9-b^ds0|_!-v&$~Qub?<~ZvAxbJ1
z%(DBjM``wwLFmVm$FK}~AH_CLY+ANh&!^bPJRfe{52uu$qt>baPp6KNmHo^@ZMV2z
zq3h31Zf;mXJHbC!wKUy``Y1+$EA|axUb4Zja~jON$=ZgYtLilq7G@lrT!Xa5%#G!<
z3bTdt7xrozw9A`Vja6@q8+z%zGV-D`iqXwxmmwSbxQgLHDDwUwh<GA9<RsWGh%-|e
zgpI``oLRJ)5{YN1&FwtxYT{pJbfd4E7PX4cUA4HF&DPRuH*RCcRRw0#x_xiP0}ESF
z7I7@TMdK?r`&-m>?yjCEUFAEwG$j!wYu!p4f2M5tx0Eq@rXin@<e5UALSEzn%6X=b
zfsX-VQA$ZoN#y;&O%Hw8W(T+*r$v=#Cc)K*bgpc|>_X<K*_dNl*84-5>4r~tP7D4!
zQNwz;T*NG;SOTqfe-K+Fqi?cB!Y_g?@OLVM+Q=$QVIAZGrm!;6=fD)G01BQ!TKq*=
zLR*Vu*6q73Mrj(f<yRx?=r1R5gd6I;Fi9?tRIG<0e*$(;|0-kWl2*GfIb#1@PhS4l
z^XsV}jlwhd|DE%|7UzF;nk}cP=YMtUZrlBm|MejrYx0fr(a21`@dNV1>+lTz57Klr
z<gcgbdv1&Q9I@#Ti*fsW&YfPg^($Sx`yK-^<9Ro%6iKYNSY$FljfDO1`ZbSEth@0~
zhqyxnsFimV;4@BMW`dIKPGKi~6^zMvh*ub3wHgJpYmrc!I>ki|_SB#JC^S3d7b29_
z>lR#i<Pc2Ib&2VQU>zBew%}kIAa?0t&QRDW1pXigAB={<`gR2LF6z9CNw`|mHt2c!
zbT!ilMLuCqQrG#7yv8e9VhS@yYsx^}6&MD0JO{Sv`7@-w^uKtdjSCdV(Mmi6w%N}<
zDW2F6!X<MV%DUlrj0&oef;gB_?|5Fet)a}XDM@;IdF&Amk%_a{NL22V>V{&vQi<a*
zmo-?EwUVz=ArLx>!d|Ir@rb<uEezmi-WjgJ=-G~-_dU$)$ft#j$WEwkTRU&F4%>nM
zb(vFNs(*o$<d_y^jkik(ZmtIcj&ay2CQb}H?U>y02fmUU&Q8Aw&11vhjBACXQH|HG
zjlHW{?;2%6Lyc32r6!6inK-|zPVlx`UAVMn^uZ+mZ3(|vNB4@A<Vu?0`X^7dYh0_K
zN)v3sIABYM1brN3QyDPnc2(Y(B)CM8)PX5j4OXgECmV(uoJ7mO^53v0gK!SZJ}<t3
zC(;|6Ed%<YLPwh_t6T(|4oNL!{-hsLo=^mp!gBE8yVaXkOokIQLE6TtbPt@V^8DT{
zN6OlI#(6Vol?$cJ*>b`dSDZ1fQnJt>UzyM+jP2kLH#2GzSm5w9Pdn1I4DJ$)TIFpP
zx^NeBZ^1s`5&J%j`aYk*X>LC*S3xdjkW`pF`+*PTEaa^f)phb`h}uJbsRb<L6maQ+
zs%}2}p}fwlULdH&7LJFk5V60v^ZQI@J%>_%=bjWY`HL`$=2PmFvv@{E4`3^gsU4qT
zU_{En=#41KJM1|Z$!MD@!M_LwBSqlcAB{pi`jD@3vZ631Xyr$N*?;@f?(6-R2haa=
zb7f4QN8tsiN@MRV=&z0=z{M}L;>S9x)E&36HZ;?8aVulFFLJX;Ze0@qia>S0rcGA4
zdN?$>Y$(9;XG#UgT^HAf;XkkH_4`Kh`}wC&C`1Uwr^XWWjQhYzS>cT?z3W(@&9dH@
zIVwy3O`a@yB;3KwA7@q?u~_kM%5v4n_^>6A1RRn;tVvW=f)f<2N}?04%<whowrEi@
z6)CE3S~CSlq4Erxa~zIkwpiFH8N%0wL8}mQ@|gjF0-_l-2mCFgqse0E#HY}&3We<j
zQOo5e#ik3h^!8veiLSF13<j=ZFI8+IQ}Pje8RBs=?G3NtADB#Bp>EaxjZ(e`<D6@;
zd?+aTVaxRD<D+8G{C&(#y^1A?4!$YV5VQzm(T}|N-01I-V0}4GnE|q8mEu$|cjYN)
z`fu62?iLgKKm6s*-r=h~o?euIMe@^LSQjujOd=PRO)?-);%BEIT$LgktiiG*LeS2g
zS{eHh@CGK$T2D&??d4iBsLrX(Pr_ps@?^}$Mw<tG<vVUm^fqMnM7zcx4V$!gGU8rQ
z8Q}vP*giGzgMwd*{DNLHhM|^$IJYxUzOm`ZuU+^c*?G&-_F$#LBgaYr8yLz)#ZfmZ
zMLQLRTooAJTJ@@uSHfi#82q9V4OaQ&O{qkg{j7q6?byZ}@jB9DWV2y8-Ldb0W#zkV
zgsoCz)nRl?4`bfmZ~5U>^aDre2j8+r;U<wtkIudNg>#$Fx-#&1&oi=l8fEsJ*<vQW
zvkZ{rqu?jLHK6G4bDt%9KIN=-8BSY{eaf?r!7wlPp1*&^UhN$p?!8KQ1cjbziio^R
zG~fmpp589;tO_kz6q7GX-VV8EJp%>7KT8!8v?jM3J57t(_o-Y9xn)r^DcaV-WfX1O
z3a#vR&r~(W!FcdI><{VVc3Z06!`<4_saUG5oq7_B=+AlbnRosd_oHBnX7xLt{w+BF
z!+`!BS3m!AI-N%S%lY3!Jl6BSWbn;Xz`dV#U$Yu)B4EexdhStTrf3?GKS<<HM*$D;
z63+2Ykj=nO|E^05|04#e5+U^;lX2+rZ5qR#UT8u|bSZm7pUB#GVvjJ5!dci4M?zUA
zm)ba!cv$Na*bVnDNr!0J&*@I=yzbH)M-ZjvXpljZzs~D@7R}L3CLH<R<W4YPLn^{~
z9rCNu>*$eMQo771us55>JlGF%&-I;py$LVAeLM^%{^MJvZ+wy0KffotLeKWZ#yT|6
z__vRfi@D;=G6ju;r`wE9ldTfWM5AUdn^2aDJJHSAa<>{=kNbfaKHkE=ZdC&E!%F-}
zzu(#b*^T&C|Hr*wdD_a|!&g5s^36xL{3+h(#$(hlLRYcTb&*WC!A3qfCtLKdd$NUX
z;otPHdjhbzeAO2lH)u=zX#*|bf=cG{=;IM8C)Mt|eFF}DR}<sSkFNowJP2vY+{Tuk
zJO<6+@s@yi;}$dssxRT9W-?G6{jdvwy?~Lu^f^EtgLe)ZMZ6K{oC8XB2#h<h5Gp>0
zsXFMib_Pysr#q-On}fkltM0Xj_12)}4qe|L4&2VL-e?T(3eSYiL2ZvP?p6*Y-@gP%
zULqtf0g{(50g~PJ_x0AxmixWCxA*-^xAQ$f^8GT9ybKYLGrXNCm><mpGS@gl_V1R-
zn8Nfnoc)AFkIucL_ixaOmp{$k9vr<m+<#{zBwPdwrsWbNR05viaL{hJ{m!7#@LL_n
z?+)E&tJU^<{=jYb8_iDF+vzxs`l^run9^jHtdArbibQ}o$IS4!Ce!e4-H5C`-wLju
za<<2PW6Jls92C<Sdw&8|H@48`q{uvnT}hlKbBcv+U6MFTz4_>(G(JUhw;W#DbY2!M
zjlqTTVCVA$J)U*GG?M&I?nn(24C~i)9-oWX%**@G%lpt@kyInv5hc{xs&Cbt5+uW-
z_>ar~X`F05Virm!IO0-B!kf$ZMm{ZtHjymn3#qvbwz0w(TaRf}AD6-Qad`3gq<~F0
zZiXYAhL)kEJkUf~c7lI+3~-jf6qBn;SEZPTCz&L23x(@^hPE=|Evu@*i82XBeAbkw
z3!gg@pyesDq-ekZDqIiFCyCUxt@3Z58;20DKJ2R|Gd8EJLS!bNgCaFSpZeGz(Mc$K
z`8-#dsYqS&<#X1pXhpEH>Iarr&8b&1WYe@E8<Daspf+g3`DpL;-iu>-YmK%DslU57
z93r&*m;kRMsQ5l2hdx}Zsd4N@lE#i)7zJl&oaM||4m;lB<E_Wt#~Z31uiY*XJ)C6e
z+%+pmy6CV7!hkYZR}j?cMEi3f1D@qY^9eu5o1FtMamTrNgttsF?(HZT>-oMoNQ!^m
zXztapXpM?0F~0H1KWwwi9r^G%6u=D1hIhk<`{&UHcM!7R+u&=5`4dZ^Afvvj9!WBu
zss~kg-0olb{W-sm0!VFIOtBgfV}**n5$si@->6End=G$pW}(J_SFRp!)sb8B9R!HE
zN2Bo4A6S(;3!u?D0gX7IJlhs7y!Qq1i1dzif=w-Iuse^pnDVE4AGnOh;YWXce1fel
zz=1t}z4!gG^6&bQ`UK=02a~m-CE806`$Q_#eF5%Wtru|b>fQnW<#2EJC0R@8w^xS;
z@85B6`{%C@Ui>K1XJnNaHC4gYSrpEv;)Vo^*%_;{H$NU7LxXQ@%TqquS7>(toO#_N
z_$`M2s*h<Ew`6Ca3vNaNKbeStG}g){HJQ5M3w4jvD2u3Y6X#^A6pxVvmg>U{&jZ^$
zNGwAGqA0YH{0sl}Glco>&V&&ocVE=WLnDu5-)ST($H9F-%1cE?TsZY2erb@@4erlY
zqZ0#+-cyq;C<}gpjkTho%g?7l<$ApF4`x@}W_%syCeDpYjtRCLgwA3Cz^@Ql#lYK8
zx!6Rxg{3X=DM5>j0J<6Kzo^0`*56fy8d0EFa)lE=fyoMU+7c+JQQ%E5K72rT#1%7o
zDB||9{&*l>J#jY50A4V}d;lk5Jnx^25y&4u9j*71i%EDXfciY~qTSMC5B}@X>@10y
zu$sX(8HVkFQ7d$Nvmtz=A}rLk#EwE%6cjtqU<t(O-V++R7|eDn-v4=Y@RqJsL_r@z
z7Gyl1AK|63F<umtr(>|46b2?FjxgKF*g7G6jxK?4N&|vqJbq8i1K84B=5fj>Bm(UN
z>-2|HcN@5)oq<qRT7l7{#O95p&^9KL;(>qB7kGfSkm-D;-r`axcy?z+Xlw&uFdR>8
z8?XLvaX8r~viQ~ltnvYX+G4eq-+-SEXg%8vzXrc^0O4=nsh?CfwpfK#Hk2Vtj*IG0
z8PLMyP69uHn{~ra<0WWr8!m}5-%)bN2e7ZyFnN4a0e<i*&sfE)0A%n-5C7;@ZVek9
zH7Tq$qOonPy2X^gdbc*bJl3-z&>zQVQ?Gx4t0JRcxId8fgo|TAKHeM)QF$AGJgILx
zS!j8cbM~#gQK>%Y)`h!l7^g?F)j?<-SZv{(ZEp)=Zx1n5%j`+z-|FsFWlOw7Pv9q_
zp{-ye3yp1)F6en~BU-=L81}l#<CUY~#6R;WJ~vFMc5?+<)|`5`+j5+?+v#-Le>JiW
z8bf;O$y1K3C~4*s{w|0x&NdpBhoEUp`o7&!gA>XFG;glHodlz;>u-%4f+;zByp)&y
z?tK9D>jXaca;oNyqqpSH)fBXOn<SY%nBP;-s6psD?Jd@uOWPSQV{0a*%NC1663Y_E
zu=g99^Ui6(82CPF@zZOl(Vxe_w6@li?z7?EJ_~*WAn5`*=MN0A8Ts2++gBLG1TP7Q
z1rg~WS%_cDx3v^Z2EoT*fcfZXQHlYd%SmP=vZR2zPw<xb;~1d1)~QabAsKc<9vm%?
zHvn9Pk2tiF9@#p4Z}udzG?#qZzAF3(|GP$eKm2~ZsNm9tSE^8=B9MCQT?OO$n4CKK
z3JgQ@Y{@Rlbp@(8jphi$A6!9?BJ^30c|A0yp=iPhH3`}EiU3%~2s)0#E$Vnk26kj<
zbgJRU2%HtU*_-q>oY53W9QX}{-Ku~<CqN5mAYc19m-EX`L;6a8wXE96j_Wy{ZoLIR
zcXk~5`G>yg*YSdqb;HY*aiD$dP0$mb-~S<VMlZkstd><r(7Arq;S1dmDd9TJPIITx
zZgxP&>+w6B=l&IpA8fY0QC!*hN8W(duZBuPpqhfj)!(`Q-EcwQwJXKTbv6sR90nz1
zgOX#^oJtCD@^zz36Dg2MQ!FPZMsA&^+iiB+9k<)66yv9YW@9?r@csmYix<g)Niaqg
z07sM!=aW9aN(=*DFuqWFdltgaC!A7FK1Hx-4{xBAD|r=0Pn<26$~G31<wdueTRU5z
z95mdmc5};dcc`x0YLzC%u5d9Efi7UbJwl<1W(&0TEOvthab?yj^o-^HK>KfBvF~5M
zKl*_?yCsfpBj1a7u$9Da2UD-4#~Z%?D2=77c$}GbQIVat`q9#nuWE9UfEV`F^ElOh
zvrbh@0+ef2u=`b+wB0@W^{tk+x<r%^!yF>;8in2f%|JBrYO*!cT+D9R2kAvb*jI$*
z=QJFi@}MuLVr-v5&zlt-FA662#vg~#^~njl%^@rFa6QT1nke62L2ni^vb|sSkB*OU
zPvTAFEoQ^hQL?FR7b2<UeC<>;mo<Tt2=(N-9lzu6c+Ezq?)EzMW_!>aw!KcjKWz2d
z^}auB_qx47w`@UAvWR0CF9cSv4|ZSblTO~;N#<NIQKlfxYow!!BKctH3Cus(dF3(w
z<qsZLPO|0Ytmw5GO?RhVZ##o#uj@B4<9WT)b{f5It6y)!|Lac6^LJ#>Yji>>TZMP8
z5~8v%Zf%B>nSVu&JLHA~uY|VFU3u`Hbz(n1^YOZ8ME329ak#b2`GEB3fjOvh1P|4W
z6H_<^gLoOTGuSl+42rV}0}0K3$D(Y;<{;%hG0%hl!+)PXX(A&3yhxlYjD4IQvFY&w
zbx)Q=%P~7n%}yzBW%1F5=;+|^n4d0*+`RmpVtS4VKx$$fNSf)4>QByKTABk?NN^d}
z%E@|_+Nc*ss!JVanSY!TFqwLFXs`hdJ6Wur|H{6>vyz!NnSCcYPGv7bE4|CI3@&$K
zp7L1tt{-nbKDFSzo^jVHM2Cv6_Kw#|qt%h#66YU}lHX3BZCXija|=Dek3Jo$DoFB9
zK=3)Bn?KnwLcLW?F>9a9vif6k>N17vqDt?APoF&YclHLw9H?#~ZzVC+d5x~u@cowG
z?lpV$K?5|(-q0U*TOd|<x^-_j*r|8wT?Shl*B$J*^@igOJI!vR@76($@jwm_>K(t|
z9C`z9#~tc<kw#$;1V7#S5HWahQN{V|p($tJ_eUNM@);H6XF<J@wgA~r552-8!@a}9
zO_3LgXEX5neT<m3DLUF*1SK>#%Y$;W06Onmr@kCy!ZpGM*D*z|o?r|n<Quu@zTA6p
zc)I`n>8oS&Bn)F<p9aIzvzgUtRCs0TSKh_T#G7=HGifj+2`#J5&?YCw1f5<@(;XC-
zMZaU>rVLfevplF!AU-)@U}&~7P2?k@LTWodY-yx5q9q#f2x;)E3i;{8P)*hSSEyht
z{e0bn|LMA?u|i`F6zA^_VXuNYkUnDe!bC9^zK|v-qf+K%L|bA20R8`bn=5WlHd1+}
z)^=B_t#1Z76!ed4**ln+5{kHk=wSp=f1utdTY#X(nF@T^%o8zfQty!*OjJVvC^>~R
zd6*6x_t~Lae%#U`l%5wUG4XkUMxH|vX0{<wH}bs;xlt0gLi-oRmz8*MA&>51^)Q(p
zZLPSMJjncb3P{hV+~6FB(`}t_7!(3U*y#Yzc#sUIyl#qbUO=t<{e2ah%~OCXSf!%v
z60R(=akWk()vq9HL--K0c?>)EG40Y%VH<Kn&AQD^y85g()gOhi>JEiY49Q(B$9~QT
zi+Z0&@V$%z3?xOC-Q9!laYzxi8fEp2N8U%@uz`^&!pjT$%B3e&zV_psGU2cW*wvyz
zuQr9w#<&lkgi7Iz4@w2<B}1`Q0jw$+4-{Lq>=53q#-$g`PGQ7PG5;e4USutt<aJ|+
zVf+Bg)5s_Co(7Xspg4tJrX0PRzfd;QDo-7Nqahj)=bjYE--kbWu<I8GZ@=Gv#g1Ta
zpp$*uW}ec9fCjdf4zxa2^cBzg+|G6#{^uAQc-k3<pxK5)+t&Mx>k2297AGMKC%#!J
zWmcENyO>=NV3Vow<^bMAlDw>Y5Xm%zAb>FE7rH`DC~PcWbScU;zluHe&OD)qqAbF3
z@M2L;X>hD0a+VRYMOzq-jV?tE=46>eV!^))r;IiUmYOlf%@B*RLMy(~B>t-~f9}<p
zvg-`ZAdJ8vlfpuQ{zc4c_T;eYBBN}twY!Pr21_ml-#S}Pi`+x-nvGgx3a~uhU|c)p
z#>MdBvA!;0U%CyRlS>U`od$*@zb!!0)EGoOxaaSWex*ooN{P(k#p7LhQ}lh~v6za8
zQmYc-QsRizzo7s2LJBZ05-H266owZVDvGzSHdQeKPAxegb}6=2@}Z@9|Lv<kih@Gu
zlqBIoP2yV9B7UZ6$>R=4vpJuysZv+_&Wp}Ia&ZhQqU~a5X)D#3zjWZWix-O7fHkvP
z6EuNWthh0kl38cm`HfP{DOawj)c7nlJ@UZP!lt^oQRT*g9!ob3cp>i^kR1?yyC(nP
zgsSXG5XW<$J#sqj=7!}M#%A*fEbp$qHNwa0Hiyw;yg*I&%yf%EBD6?gWvma}y)~H7
z$?ervkZ*1<`;5dbG12Rma0$BFu-@a<9G1l;_oS+R%RLh&rO8?%!2+gNV2%Tt4|5vK
zX;Rp*Hgh`6*<nr>c2~@WI<UQmU4E0fE#|hF+hOhwbGw+1yy370G}&N{CTp}<qs<x}
z*4SZ<E^F3V(_u}QHKE5QYqnUk&6*w7++ocwuB0u8wOrO}uoeK+Vy!l7by#bMwYscb
zXKjbIUDj@}c9XRM-ZpD@SbK-HyR1`Z9fx&X)@iU#lXY6G1L$;EXNPsVY^Tn49Jb@K
zod(-!vYi&&X|o-`c8BeBS+~x*4(qzC+hE-$>$X_8&AJ`d1!8oW8E5G&cVbU(YlFVz
z_XGNkN+jIqI6I5EQSu(YTK+8nQ|~z4uG?yMn)PniF$!lk1Q_$OvPHE`rya|F?kuTd
z<pr~I-K@cnSn<rv3rKGi{`@BXX_gf{Mq7#+8T8008vk+JdZXKRoMxldahlzRTi<aj
zi>3j`m$zYOeoLzw(!xz7@#_V_!+0dXB*KAkkw;u9EO5#IJ56`PViQhKmk^6k^8io{
zW?in07$Xq8O|DQ-+)l0+_WT6EOgM7x@HrWfa|WJj`naoRv@9inb{pL?oGSf2>*!W*
z_w-a{5Gba2@zcW}j>Vx}Fa73~QoM&h`U~sq{qk=Aa8K5%FDjn&unt%>GqL0-Jx)4z
zCQ1&|MFa>;`8>sxco+~qJ%FELWYBDc^r9OoxmY9zOInGd2wv$y#3co$=Tm#rV%OxW
z@ZsLky9TVqQ`3G4${PhQI2{DQc^~MfILa6X{z#<zIkDH_hh6kjE39lekGL})L4^Fs
z0g<`4gdV0a@(+8jUmq|v((yTVd5#lR>BF{(KL_c7N(h$CwJ2ihT@7aySURZT5DFt7
z5l<-gz!tqw(9$J8PC-@l{<Z<6?w~MmI`GkxhIx08bFhFNSXZ^<EQv`;5ZwC#fg<VH
zi0Q6QOvw-KA52~?64D<?UYhh@!7PV~MVm*DVWLeDRWlAIeLwYnra4Elj0Y{6eDYuj
zV1iuW56oZoh!#T+Yk733bo;C2!gL-7V}F1XSuwz-w|8-&!@gks>RmJ8%=F{_>(`k>
zloA$<LVHLmC{xRY9{j_{3;Ss?zDITo_Q;D24C*G3voxZb?STCQ=E5t~MJUSv#Y%w%
zg#4F8m_SNifLmU=ceuU1ZD)uN9JUiyd3W&km6rGJPNRWGc@uFdBla0x4}Opl5+RU4
zLy?ZWPc}r%7N@|Hg#Rg}_~q;2hB?H`8v#ugAlqN6(HGeMUXWgg9Vu=ubV5Y4R2Xh;
zX1=A_E{E^dgl#EHXD+r0hvhq)=J2vf4{33_O^of5b-2YRhfJF(g99r^NHLV6Do5C7
zjKCo|E994uWUSf&#g`y<zlVvTteG*LK%ar8KY`At!PJL+fWPrfDdKDkU)6;ZrJ@~V
zy4yr?4fx)C$SRwSe@6eD{IlA`f3Ru(XM<iZ?1UF~@Si&VNJn0HCGb8Rr4OvE7sYYq
zhVv>E*Iske=D*flUJtUL_f#%3Z@<!K8me5fv5d|n8$uY&X>XAq9G?P70Q2sG?f}kE
zS(?ZE<~}XzxO9uO3i>9z)bb~lM#TuZ#KDQ$PBNVV3PigIpO~Nc$yB{;;LW_$8u7;|
zX$y{*EIOQebhJh-E~%(Y#Qgg2-y(%}pTEvcV6;T{TJGX!>;f<PlFm*eDb8t;6EJNS
z>GDF|=PJFtF&oT8GYEPt(jQ|%HT&?<5ATm(9{l{4y*)VE{b`T%LfQ^^q?xKSz?)oO
zde{1i^l{Rt448;6QhbU`aQB0PiVkpuA9&)9zrD^OI-k$zp6?`#y^l)Z%SY^ua>AW}
ziq|bUi<@mN;Om0CQ^4nw#1nRiHac}cVMt+q`yLeSj|X_PjR7l?#7f1REHo}DY0<M4
zOz#{zPLuuMGG`W`CJ@ybt2{}L*X4;jrq|YQxLX$tt&#KqEw2rHmc5g}iKqR^{jZ<<
z!%&Q=Xn=_Uh%pEXw~Nj$Lq=W|Nz2t}R<U65h#gFPZjF#}kN91E&dI`=5xs_GQ`rmT
zk1!rLbo`99J5IYf>^B=juiJ5ko%V3xc%JWj!*;#z^qtPmz-{ex+L<QuLSAypW#ywD
zD)%4SdNBznbUBHZ4P8j4gtgN_i3}#Z9J4pG6>NtsZ{Rz1uifo-T7I|Q=(h*;PS2_P
zUbES6H+I~{j^ni~ypZd*uOpU)9@yEnvc(I|1I$afLO8&TJ-Qv0ST}MQA;K%V($VKb
z9DQVU*oeoo6Zr=kd9!(_%IanE`4D42Q8@BN{$K3zmi_(jIi=ORaW|VBms3<oPI>6*
zXY(ltn-2s%-HcOa;Yk+U+}Vtess<);iW0g76AGmu+Rsk#+r?A&ZFos$1sUpI##Ty)
zX^T%qG6zD5f@zyweiCs4LZ7Y%4Cf;eek6TiX(<sAur!d&P)>yeq}e&Yc*5e<xU%w~
z<Rn!ZE;;pV^QUPYoBae?S|bx;4kTH&*yF3m%2NNh`8aQMmYx*EzT~gLXGJrMdkN0n
z6ZTQoL{sM#m*Yv?@5gE{k5}T~!*p&@f=I3$$#i@SPyBi87di$J@f6=3yvw6gSyfs-
zs4Md@yq+b>abb95^<<SIqN)C<wx|G$D!H~wD6c&`n)V%=ika@eBcIiHiTh9>ncy#(
z!(4xPCk~?le(XKw4##}GK~W<X8@_2KwbL8>oDt!#YdSYX-5AxykN)Uda-|O1V`}Sh
z2IPfYt5DmV^<HwDQ9hif<)l~E4Q~G(1`%dz5b+^#*vN{UyL_TcR91*drUboo7V?wH
z<YoZ-4$u;pjZ6(7IT=ZIdbu1=^3bpQZl~GuyjBwgVXsy1?bIF5t#@}Cy-vLYlF}bG
z`u=(wGCe%jAo-lTNj~SEBp=<85PCjO2_VAebB0dVisWugKA)5nQi+F*1ON2A$f?*)
z{>?fV^S*)}_9aSlU-`<_QVo{@Lp1!!Qq+tt|Ai!0lB_n3_y%(jocZxg%6#qJDpTtX
zN%Wdn`k_6HVxd_7gc6`mitWWyO#h9H1WOqL^upmsR2(qw+>P!{p67b685EY=Kbezy
zg?-a9qg#HzwAQ^+E@P~|M^XpfpgnmPZ6{*%RPIQgZ1AwLJz>^By_<|5=toP3B-zo(
zktG@9>SK^27zEgh9$OSSZD(!+>>mcX)DwoAH6qBKxEo6#c^9ai9I%00r`T8)SS|%@
z9c4jYF3<=*E2Tk+bddR<hkNf{pYFbXZPnO|)19nhwo9GT1Z6i#9&u{n2$4VIWOFgS
zL6E^b!;AjpCd8BRkzNy<6utws7IR7tbse|SY^^}lEP?hpZkxlAmqyo42}Ax<e8olY
zkx1W%%8>Y)$9?K!Z{x+0md$b@t(KuvR?=XwamOxY@|gAQ!P~u3ZDSB~ce%EA556ze
zG-fVnEZMYmj%Az1JQ7W_Y2=#K*GXE{Y<D^Eh~SnP7L^6-+X2m2+J*KNlaHe4&%(S_
zPWuy2VR&#V-pDzu-aK5u?3}ck;Ou;cfjYHXC2yw~J?)Zw@g|JlzN0u+T<~l`ZNz0D
z!65s%UCxOsRm;Ew<khdsWackL5unpLiXg!6z5`@<@GEWZ%A_`DEWbVU;l5=XEuPxt
z{7rr$y;#DXWZ>=niQrAb2zV4ipjR-G?@7<6RB=A#hKrLlDtP%8)ax-f{FNBidlI*J
zc>8!ueNS&TGSN~p0!QI<WOJ;R+#I`$WJ(+3n=)aHpjXR?C3IxK%M+<@7FYIr{_N8C
zCvvNzkUd`o=RX(jyV5OJ;ts$CMH0-gIK6!S*Tq}D2}q0h8Sl=&0?a1f=vjObOf#;x
zq#h*oc#R}0H^v6dq&TqSvKSwHlEZiY?Voj-YCiXbT+53>+h*$c%umE$&hftN;eHzb
zXI&z9e~qsXcI4Lo^_O@^Hq~OfT=^7PIDR^x1hc2pc`u&#wrBm(-TT0GpxtibzfPxB
zSO3KfA@x?f^}n2^<F;F^4yf_}3%<II#{XjVyLY|#nd8i7?0?OB^T}*pP;SBZKj~wY
zdwlRg=*=)RydmN$@8-RyNAUUG{@YjTI?9jGoDxwFpm~saJ#+wo^5}ryKldgRKRptD
z#C|3pv!v*NJ1<RYpZq9fqIgU&Q2ctj9ws5f+bZcfF?FIj*(ProUE<U+z>LBU9gsQ3
z30d;lwSLC4?GlLL$@?Y0wx-k=Y;jzKR{Wciq6nP`i?B(+YFNRdSNee-9hp@Hrd5Fw
z|Ce9!f&sso;sv%F9DDi=lXNrFpRw}p{qxuRM?XA0djA}K6rb<0o)-uGcqzV6h?7zf
zO`ezONSjidJGtTx<d%If=zfEh9IEQx=3L{U;9$V#K#Ft5%hMWBwz$h^rOhdRGxp=y
zJM-0+Z>^(~UrqF&S5ru(vK!eKFp(SiBKldXWq6a*D93lW{&2)u8cXhMHWqiM&FN*w
z(_Igqnc@ka3c!6z>5Zu!iM!*xdAML2(Z+=)0B>eBK}!YQ5;M=3Re5tNZ#HFXxC?5y
z%aMK^6H2S*W?8N5$ca~O`N8Do*7tAq;YFw3BpKvN<C~F%tWhit>1X3Mf6cnDd9qaT
zhAe*9X_eA@M&ZJwxKQ$?hsHVD%CyJ)Cq=XuKi9M#EuIf|rJc&HBzRHzQq(cI#H@jM
zbzp%yK%W)fBGDxKeLlasU7whJcW>&-6oU^(lVWvcYC&^*6A|6sEX5yKeu*U+8(w0@
zqE|!t($M%~aI_k~&#x8~znMz*=9E!7C?oWf+C)(m{gsrdMPrI1YGvL0(KPA3-qBnO
z0dze}&>(LD+euK!&`XlQ<hiu?JqU$AT=~jK2$Z(@w6xT57uCrqVB08c%dr)2*{HSD
z%q(c(0W`CBrfT-?p>#9rz&e5wuK2g1jap`6mDSO<&x0k^w54k_lp1%RhYzoD<jHLz
zI8p7OvA8R4Z{NQG+~oCC5f&)kqH`1OD;2XRkDON9+0avPNK4#&jQ@B&%xXQ9CK~*+
zjxY55MA+NA-Qzgv4n=vIG<-e@exIkS+C9rQyd4txzS%1s4B;9}_g~Rz4x>t@Ja3E&
zn&~zxIiKC)&rlmiv#55@`?RTCkVfPZI6tUk0B_6jLjIgJznB5k1&20RRZ}~(@qH6q
zF-3v_B~yX64q0W{$Kb30D&{Ug`D*QL-a_Y^3IHnlrS?2p;iZ<HRGrMJzg8iJBcuK;
zY`ffdi<@lK;Zm>33Ij382h9YI-gt5sD}w{c1|p5Sl-IVm+z`#PaR$O_DBYF#g-Zf3
zbt5;T=nFHs-lyGGt^tr1;hE}9JG2yT+C;g*gaqabc|rTpBle?z&4a;V%$ymWM+Zac
zmPMyp>L4Yh)nf58Bs!q#qg&U7wTLd8l{@uR>bfRt)dUzn?yh4ln)7N?i-#`KsQ^DO
zV*X8bdMY9OkM8N|Gpq;o?K7x|%gYgvh;TOo?tP8~B-n_6qV8G=h*$q55$W#bMZjYW
zaFQ&|f}bS`OY-0!ISy)A$*~t-tW1A3G(L}2oef*}K!Xx7x;iL8P_75!VxS963OnP^
zwvsp&<i1DM(o4D#2Eaff4RT_m6%4$9fdIPO=&Lxbj|F&^hml-Su<-I@fA$9rvwt-W
zB2sr0e{jxzY7&xVCMj?7ZX=a~wMsiWJb=sHfDy!4AIA_s--%uRAW@Mc6e1Sof1t?o
z8g!rI#9tDo=<YB@>xU_v-W8-|u-3=ybZ_DgydGy*UCrQdZ_+Z8;Z^+@`D5|%%3kM+
zU9(S%YLp*eN;U$m-<40++76(!J}&umS2p>SVUte}!6%>im=pL8u!_ri>Q_GOpG;0s
zYc+sbn!qkCjbZFH%a0IM{IrIlUUNfhWf}@9eix=W&oB)(dGAbfPN`*hXLRG&!7OEJ
zXuxy4d)>R%%G6gNI@La3aodz_h(oo$0px1lK#t*)SrnifHNK%Q8%vu3u8a{?mDu|l
z&M7qPUvV9}URU(!((ykdez_^89CoE+fBvXms^A3s_rEO+_qkB(9;{c{HOIK;^)Jq%
za6b8q4DugK+>Zf;5LwOSu;<&0kG(6N1++E|M?wD@jmKEGHj3s-4GQf$=-oT%?K@W+
zysHe0pkVH><n&a()40)Bkx%f|-tkk+DJU&>jP4UJJC<iZ?&aVPUv4qU$7BHf`ypxT
zEVr!_=H#HC)Avnv6rX>(@}Z*~7}5gw3yES!*8$l5@t%9$%k6npoIkUxLwWaqM&8Vy
z^sj5<5dI3IJ6!}SzW-Biwi?F$AJ?h3T3_z}Jj7$Y|6>e(dI9JWJEE=g>^$=0^AK;5
z2WOzHPr^C;gU6E}!(hPT={yR;dCWvZVj<&3Vm%nO-cv1YScZ>|l13=gy%tOxf9hSZ
zQFwNixnU`;R*o=)bA3C_VkA;>syR8$!p&t0w+vxH*LNj==b#GW5+ls#C+xd#nJqi|
z>)qqMw=aHWKkOeJ9~}OQ*?*^VN|Y8}n8Clt!GyW3y8h0Cou~3nMm*-LP!T}7HaY?v
zg0l&$@`{upMO4+wVVL8;Ri8bZgs0-OEzWUruUqyG*jEw!zyF;j@4mrz-c??NCh83n
zp<_LD9MTVfyZM2$Sv)%>465|=A3TNpK;{&i_*XnJkD+E;2L}H=I?f%JTzccb7>ucq
z%=8nJn`s0`#I#xoIn(m~@2nz*vT}Qu5kexu=l~C~ztec&xU^gK+x#j7D{OG8389O|
zum=RXC_`yE1)gFSD$u3KFOz3h6Nk%)IE=tBnD{DA$@CkI{K*+qvao$`1Z$pm!Z&87
zhNI0~5<IfJQrrsj%YzpHGhX=~%=@s5qx3?YSF8|<P+3_x2Vo!J1o*xy?2l6hXprW>
zOO0;U9u35l4swb~#?8wyD?ve3m!I$mVT=caX&AzOI2uuC#QgLO1*<{94n^iI_C{ww
zOKct+<M}0d6biZBHs33F7bUr6-x@J1cmjkc0sAH!N^`@O(oqWy;SC09Mui|7h7bD-
zzBVFS>WLB^Hooo!XBdE?N(iZYS}_Po31u;`*)Hs+i$O0AJ}r^51UtI)Vhj=`_QVA?
z3wh_Bm#p=#`y-#ngEM%pKsM~XekVPu&{9I-Y~~Z0n2m)~+LT$6Kt@cqaqf?%?CR<&
zH!46Si3$KaSs6wojF_6;5!pU*72d4;$wCC=>Hi@ti+9ud)2CSfcU!H7Yu^8_x7;uK
z|3f^v(JL{92dh+Wnb;E$L!>(aA#*{L^!-zm0P{#&fzj_bpnyD-D3|WDqfZG<;&_hX
z1P8E6jKV3-8wMMOX&C!TJ`$1r6<VguC4M|Jm6jo<GNELzihQ~OWh^T+D5**fv?wJF
zNhExHM5e#l_0*@h^E{@Vj?2$76O+djLnn|3VGA&Kbx6sY=^B_Hfqn|&OB1@^htcyh
zqN&Xt2S3nhFS(=^6`%{ph81mm?T@FkYm~q@x0!D|;|qP{Dok(G^VDME*a|7d54`Hy
zS-<(&t?P$j#^*+zsR3*d@UO(s9Q-H;g;**cg_kOs1xtDT{yYNmiDeu(CF1rqzGkaS
zx$!MUO6uUl`KM1fuz)%YNrWcP={cnjnMNi%ans)S@Biz+&?Vo;Wq>Q3l#~fWN{m=l
zHkcPe9+=S*Ll-%R1B|y0ZmOs^R8!#L742REn_4bg#-3q;M8_+xF=Co`H-+fLS~E4X
zQo-ET&%&9E4uyvm)^apHSP%nqVQYEds>I-Fh^aWk%J!!5(RT&vlihe^-(Y{Iu=Xm#
zfC}Q}w4$xX^H(SvR7~<`tEqP?+%5hj9|0|^Sno_LlixVEB=A^y%ImY_q!`1Z)^({S
z;(kwXe?eKvDMJ0r=T@bM$E-{gUrlZr)Wa~C+_Z_iTczzyZ32T18N=wB8%pF8%nfGE
zhm@J$phSgJ%iLDp-)86O%?ol|S0F$b2f=U%avjzanzKTr^H_v}v^Jj2j%-3aO1b?4
z#Kp+JdI@dPVF;^o;H*qIn2)FILqGmVzeHJnCohY0&siK2JBKOEhE6$#3!5YQQ_rxG
ztEM%Jq|T`&uzq2rZW=oOav>G)fh}=N(XNv*<oU>9&G!d?%SP@_>--wd$x%9(Q2qwK
zfM140e2N70bT*zo#R~=aW^;RXHB&D5nD7n<>_a&9jam-YVwVM=SD|7Ri&~4&*%6jm
zvR}7czk<jMx-J;l>@sE8Z1gb9_z1CsMwfw@44m1Jx41U+lrt-(>54J@=fB%$oU-fB
z35;&3)B`1pLQ!K_Q1f#lTGKKt%AHd(xTuXbUnW(-qynNXKc_^chn`ZR+s|u8>EE;k
zeeaid`-gi+#*)RJ#1n5CpM&Q0wM^ej-uOc_LJ4l)(2Z&qRVAyN2s;s(%+>dXR%2a+
zu({cc(#+yNSNhE_A67SLJwnqkeEp7f>vgj9<6qx=%U5;vB-T2!i)VD+OkMz)yA)(x
zdj)i=esVL-Nz(V&Moo!${6yX)FFQu6P}Gt~<dj(;IOU+D37U4bWyYTTVXpD`t!}MI
z{(c2bdiYt8_ybHE(9&Wbt&Q=?*9}fwWn=v&7y*g-ci4GHfv4WI<h@Pp7)Uec^h)Zq
z>PL>plp|7v%hZm{G{I(?p!39r4-a&#V|B>KpJH~So?4QlAF-c(iZqL61WNvl;#X29
zIbG$+&!=G=U<CS@p($gFk$vVeh}9dOD8XOuJ%9g-y*}7|iJU2Im}Bpn9AYq3vKP$)
zZ$#2$TdBM|p(cSkqd8ASC1a1zLO#i$^&zET5&lFJp>d1F0p{Ppl(<T3z@Pj~fbf2@
zA@Xv;rrNvaIgZ5*RM50#FnwzL$%b;bNG2A}9>JEE0_mYu?)=Yd<vO<&$7seaYUWdJ
zGp^B0qo|qbdXSo~39IR<XywU0A<48Yr;MbWNt$!>ZvWlh>;1PBLsOb>p1@4uNnpr2
zC-1c(r{STJ4}3dfz&#r|Th-Ypw&`(P(SU`7N<4cOgHV81lw?QAw?o->bfu#(gD*9?
zL|fWlLrz1qZC0_N8mN9Dso}!%Rhz*MJ|6Mgef*u)0O>(BOjvt43MQhJiZC&B{~7&r
zqU(;ddQmCu^_kDrDOXpNY!)ziG*@8!!WzG;Moskt9@kZ{iRw*oi~nYoTcIuej))xN
zo#bcGa}_FP@yVq@_4o2%rTx81`dhuL+dP7=gS5#&G3>wKvwpm&l7OG2$`fpEe5#7$
zRXne>+dgpEKG533ai$6u<401$Eg(vwm+OVhT~?}jYnt2cyLWqUUy2xTrpu7-fJ}-Y
zNIEgX!g2LPHJY-2>PYCNVMtCgCRXUPK>_aC_|vJ^^TFG~j8;BIBd3||4=e{2WSzpp
zo7)0Rbg1mFQ)-UHTS^*gF%YK)<~uco1LQKtwc(GpW5cCOT9*|>rOCgnxu0A*=0kH9
z+mdJI&9H@{3!pGe_D&rZL94Z15C=i3LOqM&LX^15e$Tr5RI#1EeJkmFb&>}nQZdb0
z`55ax288D#>1l4F%B;2C+}X+=bi1+)+QDA?XaUEic%GcJcp~V^%jYur*bFZo2Q!5!
zzJLAx=m*`zO?t!p$~^ocb9c93!zCFK>!uzL**2Ua=aYg)ZYj`|#?tTn2#+lR(;;x^
zh|$3$W+^6WDEPx7JqTjWu`K`Wz<$U^9dh>|Y&METBpb|FIP-OJC%^c@_YCUR_`7T&
zP$c>nJa1S|XrB*}bS<h-|9XUV(aeXWL6ohTYXs6o1mXFXVd@0~9-|z&*MIxgESXP?
zHwSO`(Nil!4SwNa@qGtOlq@`za>$S*S!R`k9~EO6f3IF-%&jNrXBM1<2I2?YeI`TE
zeEca3QxNyP2sW2*-oHNHw=o7~)Hb9&=ruKud0#27b!?I|C;!Ut>nBadsO|l-_aX_n
zM?g@L4Jj{jftQi~EfA-7PDGrfnv(%k*_e{v3^Vf5f1C}t1lv+XVNSVRJh34bd+01t
za7A83^f@M3o{7v|7U;eH2%96Bh(8>Z1mDGeKY~8K{ts`Y#t6XHL@8b(cRFITm*=53
z4o-N5?BJEE3$wukju2Sp<;^jCMK~Q^QUbxqr#pwRM$z=b%bqY!0qn+LYv=c2mzL`t
zC_GZ^AJGPee2Il>WK~G4LP>>bIGv+k8Ee+NZD>hTSu6*&hNGNgz2p~T*QdPpX)rmJ
zt{~(tscN9Po^!k|%*BC-2M81;$K+t_t3Gt<tR#+e*hhz5xa^~=@beEyUUKJBz2i99
zbEQaSQ`CU9>lxc|y6$ErJ^T3K_~>}|_=t5=*@v@&U0{^3T9<tQE#Z^~@pKAE)D>AS
z4K`mDLMWI*8jjF4hcbDkoPmt7rL=*7Vwq`p$vyDUQbx{s$cHe#J6jC4{sH-CBR=MA
zZLp6GlN>A1g606iNAem6zkfOlW>EbGNRgxnR!=4>PqEa~Dtv$19}jT%RbiE=a*`Ak
zZ_`~8@SWS_-;IL^ks_ojsw_7n-*LJ!4lrp^F_R9IhBFsdAgc^agxA3Yl$}dHPP4~Q
z$BW7OccuWJ+P+8ETv>n;;V4#3j7Jy2lu5T;>>S1muk^tNVLm0@FmbHZqtAsg+GK$R
z=cpc}{6?xTeEjxXRv{=WXm<LW?i{R5L3yL4KaXb^_1GUzN2>1@XBkD%RB-faM6#MJ
z4dX{w0&eIvbTOi{x0*K?M3g@zLg%&FD6WZL=ab-yTY7HEjRG34q5bt%SF|(CpfZ@u
z=^PABPIQZaCcp`@N^)0Ca*8@jEmPpB@Czj_veb6;+S&a_q4A9K*eMdja%iTMfHruk
z+yvHz7B#h>+!pe>H1ft~1}58T!5{!V(3<zGiX|=dbgiSoD_1o%%$ki7HB&O0wVTCU
zz#W3|D3x=<_U2R0wiXmxWt$Sd@WA!ko0fLk1|dQCz)l`0&Xq9M1DR-@ris?Mc(&e%
z1je<GUUXa0HPj67H=DAibU8)GR*@z6R`)rRMkbKMf3#<BxhK#6dmIktpt4Sbr+4oI
zwXja7m3RLWAJhLEzW*=Qx_j4)pMP=x@5SQ}Jb!VwivSDm|2oZ9!?^!jZ#Tc(|9y~$
z4)I{v`FOJr<Ws_3#!<!Q9Kk=voE2h>^-d};S?*6q;n}H-!*C;lR;!9HY=&URDD*Yh
z8ckWPpG3E2-^e92o((`<1XU(ag%v=kSzrawbl6@^u~2v4Z+H=eT-Rt-?GklY!j1cT
zqI}2CXn90aJL#^%s~<LksxeThlx`<1dq+1XKnyh?`#C|2ZLQRv5$oZO5x3OIg#+7#
zE29f(C2ZX05Q#Q*hM$TRNwKwS)y<OFfN4xXSC9;|a3uH^k4D@dRA|>+ag__KMGYMC
zIJpCMwEyb;(V>I8W@=Bg<CJVi0R#z!xrX%yfLecw+g!^(i{(Fhdg77A>TAFP`QK=_
zI%fQbmfQIv{~zL6O8zITKx@Dnr8K(MA49{>xS>JR05KeU6Mrj-rGtrHw~ce!1SE7u
zo}m>M1uZ{tllE9`{wsCPWF3CDS*vKf=$wLi_~!J;`{>IT$Kesxd$O^GpI!s1^3(TG
zIF=s?fraqb9C+B9YhFvUd&r|-6$x?%=2(1XYZ%tw86Krkk$yP6h8+uUrW|ds3a5__
zSTTWq@FoMij~>k@+}2${miwfLS~dm7@L7<J)X{69<|uSb_LN2BOxjiN5fgB7x!v5C
z+eJII_yUZ-ANsJ<?E63A**-ALxi^I#Kv_EHS&j=x#ZP4%w!6DqRHVmT_Wb#C%L=U)
zzVxP|L8`;Y|KP`4Yn%X$XQ&o0PaT!4BDx^(i#aQoR;U@psH<V#AR$693e(awOG!n!
z;04ze@PtXOd_LGaJj~;P7syM}Ka;1lM#lpoP%Y+I?$Qrcrh(=mtYPR);!8iO&B7Wi
z>maB>pKQ7szKYod0I-zjuiV^A@;93)u_aKTP-Ams9#L)o2Xl$h<2b#f#k(HDEFxu@
zV?-)=Fqv^b7wEF4Ih6M1(pfNOPrt!@QF#9I-P3OXbo_;`;zA2zrt?PPP^4H;Hv)K^
z4O1+}d&(Ajvq8`}oJW11))~-M49+1u(h{&h0)NAAw#Jb2^#bGs!`pnCH1aelb1xAE
z7VCfKVR#YWWBf0t*>2P`@xS2J7ya)6o~86Z&I+Xbk-C>?dvd$4YJ~jeZyHg6|BYIp
z=&PbAgB9b#!wH5-N@k4`?n@+NLL2YI=i=fixiO@F6O@)<0o;e{H}1pr8~X-xv2q8l
z-|`MBO2xgDk0lu)&1#Efnbtr~O>&Dr<zAD#<(k07#~5MES-yTsj!YA`R-%dl=|_Tk
zCOJgtGb6B8F(}YhZ4`!6BfOBL>^WX$*Xm*DD5YA#sRq<lT(SyLLUseO{*=up;#Vto
z(3v70k(QbU!DJZX8=47fGsa#=Y0+Mc1I1)}`6$~+#oMTHv`$z>wo+NC8A%^&Lxm*v
z!eMl2WgB^Bp7>p$M}~BUh2Q@12!0v&P}u?f7VmGv+L(Xx8V!2n$tgVfCm}WfFVpB7
zcv~F>2wl3t7(nPxfFbh6J)_y@uMYQqKHNXv+dcSR`?UBLsZLR$Ug(+-kNH`fg8IZS
zVfr<^t3~1w{j|swIzvNV&8=rmpeM%t(A9bbX}V-zi-wscx0-<Jc)2pAymeMR68GnM
z3^XiHa6D1RD;+BGE#Tutd?M2fZ7h`IO~n`2D$2P^k7*#Qzf}z9-dh7?uH%h;!Fe&y
zP<e^2E<6#^7*p`cJI)Cz;&#(uPJ<(frS4WU{ES-#EF|2OT84Pl$_}n4-Z<#jK=c_m
zqqSo2IophO18h0rAaF>z_k`KjfD$d>bpUJKob^N2L%%N3vmU2U=^bQp45KvRDJApU
zl7oefo}lmm76Zj3Nq3#xp^UjEv6jAobowG8qt*FQ4^#ykyYlPUnq(8~RUW;Z8z&WQ
z)-Kg5B2vkjI_YniNqi6{lSjC5XX9(;ad+-zS7Wx+i)0m&j(qBDtI{LwLNkThe@3OZ
zxNr9sq5iBqtExg5Z!DHz*}E`(K~#`CfVqsCX$NzmmMJ{v?Q4ZS2FpV6LX{*C-Bs$6
zVCvdnQGIQf2c}lEh8IIqvo6VxD4(j#&j+JVmQ0@9RF=VsGKSW0`^DFJTjpk7;uIZ{
zWHGvGXe*TOJEfcdv*Vd(_E$^s^I^g&4`8EM0n}#6Vz;lV>{t8?a<Qrsrm7G?cStIm
z{{x?lw#FMB1(S<Y^!}d5&*oF^x{qqNI>cqKj`9QH7ako2qcbSCn?dVbo0{<(u+*+8
zzqLPAIm&qm!9-6?n;6BXh^e`#;0<9rwfWT4YnN_f5MEA9Eg~O@C<MJ&j`Hd#sLiZ~
z0ky!<Fri=60Eq@2f)6q9v%;z7t>9d8@CIt2X``E6S%TCY8%A1NWvEiz%y7utDLb?(
ze<D-lVw2p6AzyW}HS@abU_|GuOe@RC27J~hABbQ@L4>%RI27|i_>M%ruoPwW#oH`)
zE79mqjiAsl@Bfw(#(#2IY+0QqA?%O+VreJl#b+bzmTMptcCx;4Ik$vx<C0{((#>6y
zbSt{Z{)jG5AiKzs=N6hR5h#VC=!z&Q+1(UAs_Mh*8n&JV>Ny@_=4<ETYhAUxmKsl9
zu{I2%czNrAsLVs)oM7K}&3FVA`Se2ijKVV>8w)K?cm&9GR5IjHAYyd#QrsU@BAm}>
zxeH2pJDhCBFu=7i?yEjVHUr#4h7MnR{)d+g@74de*=U;QfAw~=@#XyQA)ckq|A-aV
z?fb?3IbsSuDD1@^j|o5%7GHz>(=N{H&Jb^ssNR>pxIL*~v*l5o`OQ^oS+OwD6<YaC
zxm;Rw3AQ52SB!RqlPpJ(`q6gO0eLA=LHv;x%iMiWdKJoR0J5(d3{;8tlOF}cYjOV%
z6WI);*K&*(_&to<3-#ww#2aAhjpav3DGGj`r4uzV_4~mvfL9u|3TbjS3VYtD@|7aT
zgole?Q@TNsDbH{bV06Cl`Jn=;=rTruC3A_=FVXrOeYbe<7%j=_f{}Q{UXa8_Jold-
zz*^AvDOH3p^m|Cf2$z6MfSG#$DV5c;RZg&Zyq(^E6V5aU<rGjoVFg|@(0j%|hKDsK
zNW>)IcoJNZe})FUDC4<TL>ebMBFc=@rwT`C_r+_9+8>Ftk3l$@@l2+cxY8O+1JOqW
zH2xu6uxb=bVhD4zm>Aqaj{4<PDFWLLH3zzobF8yir9T%yT>OMwI-p*m@|SW$-^3HW
z&qP*D{8t`f70Q8JqMdwh^WBg}rHE`IWf2fBc(a%s2a_w%sUZALhk|@0Vt}-NzN|=4
z(BH*z^v=9sLXw794aZqbE;ED9;;~t30xEzUa$%T~{;tbX&U{~q`3r&L<iqWVQsX1%
zN($YW4j=A*hm;kU>Z}E=oHW^mD>L5O_@ni!&;41f{|g}ois5X<j6jR@|4zMa=>KjD
z{`sQ+Kftq;{;#vbIyM5hS4VeUDXzteAiSWzr;gY;-6e=AVoby}FS)WBp?~n)it^z6
z2ehkv7;#7cq%(QMcFQU^dZpV+0U)$R!GuAi6>@##RFvUGcB8YG{>V3@`a~j)54k|X
z_p!tNW8jZ4Ya{&OW+4?t6+mxzH7b95R~YvvC_}Rm4|%r>01v3LIN2w7<U8&sh_4z;
zpj4~z+Ww%%8?DtAccN6H7f^@#y)$XVrGgb{6Y<(B3~a3?>J9`dg`@0Erz7-{2My`)
z&FKrwE4Yy}DG+wS_{v*-Do<5MrQ+#=MHkN$1-{pFPfdSl-uAIVN2wSqYSKjP_VE^b
zj6FZzsAxOBdj(foA#iW%2{E=B3R#k`9}&#AHc9u1EEuD)F_`hdJ(}BT86<Q+RSki=
ziCq~7@@@-5imJFUlN-P2C#mtL=}F>wzwi6%HMl$~<lv`Ac*(3Il+7|r0Bu+IK0zRN
zYR+v%R5;f>5V>Q$c&MC$p*q}qxqtNL;N|<*d#5kny!?Lu_3_@}>Dz;&z1QCt58nOJ
ze+Aj7^?7q!rjO+XLD^1d1YwWE?r>VLSpT0!;S~09v(+zvFUbGdXm(oW{hxNH{YC$O
zh-WGNKV^mdJ3v`mT~Z5OyFE%6fr5doD+AKyCo}&_H~HS-CJ|j7V#@OeI+?8#4cT+C
ze_yub0%VNB3!<9g^N1bMA&YWYP4;sUrg3|FJ5yyTXFC8{K&HR5a^m7atRtJs6iY5C
z)w3XTrW9mO_))rk2jk*=UDzZ0;LT=U|NL|oo+?P6Vy+2qY@rgNEygP8k!*+C)S<nG
z)t#lD<Ip0X4+(k6hX7mW;Y%9!bYF#TLilhumSd6si!5+>8Ze*;uH)qRB+0c+mut6k
zI<q4x*0?Mw`2ZIHcO#;5Z)VdkBt<A{alv=GD#FJ-zYqm4{!8~^e@j;wb4Mmq#WKKo
z(`^FpQQ*(6U}1=T=Uyir>UKn$8t;}nW-nL8pV(8)6-{hW_kQQM0-%gk^ku4BzvC1^
zzo`r-m{%Sa*1{<NMRh*gdFK9==NXyJzDzdxJYsLd8PBWnm>WiM&-s`%?#J0-dYq7!
z(n9&8@KVY797Y4oqIEGrcZg9i4rWwt<1?M+Y#!saBt&>oNkRMCA{merbQcv&iCwnI
zM%jYRFXGLjwbS<TLDhEZ@!mv@SEC>{yqAA*{hiM!l^}}>_m(OA=V|#5nOgKi7%3le
zg2i}RkxfNcP-7fi<!Rb^3*ldBy<6)lwvMf6`2~3S<?^19{KIFOFkqd9;ehS^wEOyA
zW}faml}sx-qqvdTL@MY0XcSgpovE`Ec0+&J$@66*f0@W%CbE4ZW1fn8o5#}odeH=~
zIj-h)tv*Jo5O%Y7c*x$)$331=iJX}Gbd|A(cg}FCee}P`0n7764t$XViX0%y)_Cs2
zd(@uw)Qq+gYnqNl6%fnf9dS5}#mSwhlAPdundWP=K7E;|#q(4+Ng}iOS5vy1fPORz
zQ{_$7)MkxAmtf-7ygn|3HQo-hoHnb~M54xSz0RgrnGl-tDKS}W)x?pvlLJFpDN_W$
zArNT1FS6JAOCs?HOh`OyxF}*_JBDlI)e;*qNhpej?%3ic<ky+aMpUO(s*-APEZvi=
zRM6GJXdy8MNtjQh&GFQaB48D2*^jf4U-aK7p_=AygdrB~E=MrcMUazO>Yw6^6vs~~
z;c!2U@E*bF`o3I_9<jX%B@xAC%#6CIg|*Ye9v76G&q4~rDB_Z0sL#GXnPL8#I{OFo
z_%ev8ODZW!>7F?D*rrCGi*<$)T7peESzFVjav0>s)Dk(w=7JlC4)86=(MWNX$}nik
zl7F1r-rAnU{-2+K{q8mXL%q{5{XgsN&X@QP5ArPK|4FQHKk*;fC$6oGv)2+Xl)pcD
z1JK+kpcdIUFt;?ikB@S$BV+h>YI+-*hKf`vC*DGRiL%r#-HDIcMOsF?zz?m2AMvIE
z#ia4XB_X`(JfJIL{Q9=)dR_=RVOa#a4o*q=R3iVEKa9MyyGVdV`M(^eY5IRVU-CaZ
z%(GnnFJgrx^!)-Upr}tbHx!Py0-|B@l~4)}FUsh#tsUEYu^r>E)q=AL-XQE<<NR_K
zmBypj_&gj9Y9mS{zp(lKbsxi%1ryfoav_EZWGMN$&ow??p7HWqn9-bKhtrXKFyvRu
zD4GYxvZq`*GE;iMou+JQjCrHHP1F;mNf%>De@IH686~+Bfmye5n@z1DWH2xEjB(A3
zcF3Y$CixVn6G;XUv<FH%AhalUyRjh^xgzVv?w5jLV5B`6aWCaB3dk3qShO`j81USO
z;_pCJgcsMWYF3sxc1|(L=y(bZWs^{t^0R!Sn9y|WE5K#qsTt&?+y|177+aw~kK!=O
zC8{M5vLH2d?azobrUHy(g_kX8C()DLo#7QgN|k_d%NYeOcj~}tencD9*l1-i_mP#y
z-W6;ur^SQqiYyKe|L=1daydGf_hfBDei?<B_=Se8{J8UwNQ<V>@}vFGwB>l@O{Txp
zcIaR3S*-u@<YRZq0JcE?b2|;k)c+c-FZo{|<XKApldQ1rE#QlTH*a>|zGVAvzduNg
zb7;H^qZz+;|B;j{I+K>!s<IAhsRSGalYxIlL94`}JiV6)h?gg<uAH&y*KS3ZJb|Qa
zkBde(XBT!;H%m53mu!|U*-9?{W(oLe@A${PUytrW!<1rzSSHahN1}s2Tv9qn?SsD>
z@~`AIj{yR0QxW+^kI-@W=Jb_66L-ab#NI^yPTI^;u)r*ciH0m83nsHD#2{ufsw)9a
z`Ze=$o+k0-FeT^PgT1%Mn~TBf&4bab2I|xhjgrDY!bU&~SR#Xo!(DA1l`@MvHoZu!
zJ@9Mh71m@rx$#Fc9W(owP@%<uEWtz;2p^n}Jdp{OgS;ZNe6R^tgJ${UTmTyF0nk0j
zi-Os8S<V(LRLsl!Z-G}fmr%wQum8PKh#@-pMdSO3|J7=@-Aw#1=S%#r2YDWebhToo
zkLOcdFP_e4!3f71mic8A1f5sbttPyt#@Va=*UanxJ`du+Jh<0_idGJOtndJVP&V>U
z&w`O<>9jX06S;AB4$;H^R*$v*x7IL!rLWvK&p9=cxS27~4dyW?G40IbVBm{BZn+89
z@0W*>oQ;HMLjt1?gB=7YA6{aV70kpPo<`$S3X4@tC~8Vsktv`kwnl@_V?gp=(x6ld
z<wg`OYm~;V*CEv*>5Zo06bjc**bT43cbWftwbr6?tvO3HmsA<K)UML%Vn}!u_=ne8
z5sVS6Y`y^D_1^c#{KvY0`LErVFX{NfVReQ%(lK#-e{rLqpi#7simK2w|IL#&gT=MI
zt4!@ab5qc+&Z2NWO_EEpGgf79empup+}nMVl);0dm~B$J(ViEnUGog|X|Gp!|Asw(
zeemK(z?HXi1eNPG0AS*?o7>xk)j3GwCxDx6?YpF{qQ*Gqqn+jYlt+pqE3O0~6>^!1
z(OoKX)=O(U%I|LZrZ`LHHKQ@9(cq$%C0p_K=&-OfRFbKR>MF{h&R)EdaOlZ!T7Iu~
zrqWugmPDWwgJ~^)m$aOf<8MOH@4^TpnbSHTmmx!B<Aap))g&xJKQ%opQc%ad@zgkI
zXse2<dU&|`a_{Z09FhIEuk;;QJnzN*C_qd0eZZMEe|2|QrE?*z$31Pu)wdbvbdKf0
zOjD&&0$lGbf$tnP0Q4^umSBiFTGx7Su-o_g=YE_l#Piv74h!^rIHYV@;~*EHUT~JA
zG>QBvus*w@E3EYsdwFl*Emt7~;w-M99D0dt<{XI{N1{eZup6#`@)L+U%mT$8ox~}J
zHYOMweSFPdWOrHlG|!DxU)iLj0q7gFS&>^W>Q-jb(s)RwI!L3ZqbSVSdM07gJc9hK
z1R1*!P27`}eewQ}E{WgC0cg?rf8EWT|JU6w=l>7#EVaGktg!BF9g0s{Ymc${XP_y@
zpc`VIT1w!AFJn4A(?fdx?2Fq;XLB#|CNrO>La2>n5O_1pcz_4<<QT8`ekx)@cTr3d
ziw8Whc)-44Zjx3!xXr94<Oac&1cDI{R(U`Ltf7UJRE3l7y~vO9)STU#cI=X4Pa23s
zwrts+aWj)3Vb6<$K9FN#*q0tLC_`pd&Bn?Dl35|(;U@{#Gpve;sz&p)MGWrdjf}R^
zd>0mSq3E{Zl~fdmnR@TlV323Dujs8+49j_4Z$9$JUNAw>^<s`Go`D<Evfl{6|NeKT
zy!}pw&M?R1XckTv42sB3Z^B+LOT-Kf?Zk1C24aB8MoXAe9xSdr;T$DY;-xS}Hcm8T
z-TBNnm{&W8&U&TUm{;i$=~J2+>v<?-C{H9O=V~vC_4YZ`0Z&n32_V1fKonsq^JGv_
zN{vxg0yrgTC|VDAGIO%Y5VqxKv_eE6;~%{yeR&@4DWU(t%V^NMxAT9{{5qY?`G4E}
zqW?X_vz-1XSYc80-{g)CrktW{Fd>_Q7Kdgj^ryPFP`_NR5s3b5J2_TV4qdGxvBC>f
zq+rAb&XfjDj86EK5*|u^9j#ha2T4NVLxz+bVWeE?Eb7g#ObZAn;px<yowE<K@pKSG
ztioSzE2*mhjLOM6sLv|U18h*0eop`~e|jp$npF5%H1~^#NhJB;m==waD3Kv3Z@?ty
zJz!_zp@UZvF6%JcW(r3ab~BtlNo0vXc-)!$5F@V_6rpjboVx}N$*bvRYEsYZWvv_n
z7BklaV73}}QbOg=f-jx5@#S*t_ApFi$F2<1l!Q-?JehLv+M_z2oF70{ydX#NB!|j5
zhKr|@4svSArpLJ(*7;HJO9b>cik6InUoNo!eV`>FC>P*gFI@sTqe6*5|M<WTJp~Du
zpyV!ih-o2N!V=2$cWXoPy1HWE$0{}1K#d{>n0KIyY7csNg$DNUaX?Ok_KFhT+<wV4
z$rH_&?fU$awqak?Us3UF<AdvoHxBwWsI>%6i))ccrpT}#`sA?zoYlXGS#2DQfLZbQ
zVi4QeCb5lPaNFnw`-U|V+vtTk-_^&ekwXK<Nzg9);9pH6Y;pD^0zP}PvB?j2>KnHw
zcBpb9lj5DI>a%As6MJEtkwqp&FzW5n^pKSYbAF9R0AIz%Y9OGI%K0^?^BHWMhS&?5
zyTb5-Rg;#+F?(`+@bcgp&8}%M^`Vr%VUNu!;aG84b3;fko!>(OG78TSTo8X06Xq2D
zKIJcJjva<lVxczhN8UACFyqSP7Rf;vQ;%ox1-AU?ML{@^K|lub2+oGKycv@l-$n4G
z*YD#vBU9@2Ks@Bc7O@>mRAs%~(+M3rjQc<hDHx*s=4^wjx4fks<;XzZ4nIqw+sxq^
zBTE6i>HAu{bO8;7^7Q}D-k<lkZ6u4r@cH-kr|6-0CzdQKT(nr4IQMFE;wQ4@E6J0Y
zW9#w<lAwf`1ULYx#TuQ@{?^hBbOQ|#q!!y5F_A?9y;fIOS5?=7c!#}^QGbBNJYO`2
z`5o}u1Mb9uWDtFZfCSDNVUW0~EFDPBV{ZqW8@j_Fyk4r@ifW8{O>#;r-na>#D$PH3
z+{iftdG=&b6kx9H9!Gcv4htz&Fci@McuaUHQ^>msK1u8*W8|KPH`sUwOnDv!-qn*@
zH@8#fL$j1|4T)mWSkw3{<lQu)HD$V2BP)aww&M1ZNHg*Vn;X9##jO_%rPP|f!RS#4
zPP$gdbv@eKSpt4{>9yy3(YZ=hP8s{6h~6CY_x@xcMu5d0E{2P=;yes|?+fi<6E7N5
z@FH_=Frg;Q$PXVRv8jz2tW0dG&xwLX<NJ#`He+Li9MDzOm`;mG1AZ2eGNkq}>{`4#
zb^HLHh5~>*5D44ChNg$5OP9>Ur&5)Pen!1M{WE2Tl;a+4hg{f!T?!co!1lf<a)x=!
zk)(MM?_iHCWyv!WaPN6z{WHIUT>}t?impAhTxNo)LrwNm!xq%GZmhRnu8J3;>fPqA
zz20bU#6A4vBdT@`DCv!kfM6t^qjP%xj4ZM3c`r@DEDrf3J0pWM`{79Ao)*#`KOELx
z26qB-+QUmpU=$>A%jc113Fh^ku#Y5=XL!fF5dOBO3o2qkA48Kw=aX?SxGXQb^*VSD
zS;M#vx$K$Q@srE&H~5);|Hme!4;TNXvAVvRx&Lc6p6tIK<ulX$pG1WRiU1{Tmyyp#
zMH2@}vgKjtf|>yYR>24?Xaa2nRAS*6OM5-Cq>wYf3aTB9hA|ZKl2ACOmUfltNUCGK
z^=4t~P1$-!Z@o*QqA*^?AZ@Av%x9X@t07kx&*fBCDx-7=y^xjZKaRHF{j#5QUlT8K
zJd3Mb=aWIBD>q3WAaWRx!9}em^Sv==c6(dV=EjQ$vIg7mokK~=`5IpHtBeWSn?3s|
z4}a4DD_e~xr@<proA}`hhBQB>LVHvffOwPJT%*~lt*))7&GA)RZ~P0)BChcC&0b++
z{UFFTBvVxvLUHOUD$L<w#Z1|jpeQB8Nl)7{DyOz=p1#=9T&ID!-Rl{XF4#wTP@I27
zZi{Kg#3y6;h%N9Dr>@c&qEgV%AR0Tj{o`nVdynLGKZl-#L`m@2Z1>zg>iaP?OiD{%
z#ZufBJ8HC$V^+Qz2?A?FAod*27~pXeZ#}0w29&{&K5Xb8m$xRIqF6j8!%9&tWo0?a
zh@C^U5VuzDo4M^>!*NhHl<f2r73$?t!M^7XdNv}P+8J?$o0}@Mc9W`idrKRHpi618
zrmtZE?GA}*PhZLA(@LgS(sH1cT1k!2sg-QXmE=JbZt;%mch84T_!(sKx7v%v^wqO3
zJwxi#2%*$Z!3k{6*Vk6omvg3(=N+c9k*Ys!9vpis2um<F8SdrESc#=v&LzW`SSwnY
zlF;$b+%!{?KuKq!xM<vJrB)G@7Zr0998H%8KdrnCpbe0Uxe0xYF7TXy<<y{MkZmYX
zFwPeh?Ata@RS^!3i)poNqow-Qq%EB~kzO46A%y*wgfpu(k&}ik@(Q&HUe7Y2W--)@
z*dTp)%_;0%WlC+n)8>B*+BrSFr)jtHr>${N$=Bl9x27>(Q)*jhpKa%KDkW1CpuB{`
z6xm7wq$3;-BIP_`-}#X{==bnOcG4Z=ZF{;>%T`G#g3VqQ%(c;j+E(;#Dok$pGJ`V|
z;eqVs*r#U%62dWUo+O75=+l#tZ(8C;A2A*@W}~@imEyDg;Bq;4K5&qp0b<{668A9F
z0!#y@ekeNEV&M8`<MUFYw0i}N3I>3LI$G)ClV@7Ncy~-I*pdaicBnFP!pP!^Me&f8
z;tGL~h&nVgAUbO~RZI8LoZd$sJ#LikqcOdYx{k2jB>FVsl*`;6d;XH@KWBNZj8BvN
zoM>IH<hta9s^*fj4b>Tq!r)51eBO{<MQC6MWA4G&hZK4rBT+iYTk$L!_20PQ;scDo
z)S8r;?EmBjiQB|fF!NWhr>Me=)e+2MhMAV>t3GY0mcB|5tv7qK5G>EvScv<lSEMe%
zK61I~m~`Eht`y)F4d9iiJs|0lT~z7I1ClS<k43FDoqDC#`eBKeZJ>&F(YuErU5(An
zm${>#j*D@f)9D>OI)S8-|4%W7O(BwHnwUZ;%QSJH#8UQ`r;IPAl@EANS~C7$;NKwz
z@Ra+%^;SKd|E1Y%HJ<MO9^*56ct42>_k0OhkxYP8n5wuoflr}Ex5Ta&b|(W^sh#(S
z@85qo{<V@)`IS=3Pu2RS_>Cy+ie99djgscM9}QMIqhLfavt$v?`hj$sMj3pM<&rXg
zvuKH>pUuPRiM9NUQ}x7=8Q#y-6l+kzdB$*9ZRSN&UTu=sIhK}DcA$I?Exbt=?J0ML
z+Zhn%7$o*u=(5Enng`B>I9Ys{h6~@oI?r++P`J+bxy&|>-@bO@IWT=gsE+9u7PrK^
zfJ+o-hKfh{S+rU?&sS5=apBOXfd?pVTC4Mq5+hColX1}?8QV%-IqAb|<N*5!qvS*!
z8KOsB<8{iE+mv#Xkzqq0U^0K=tzjUTxm18ycUc_vt-H&Puwnig`t!8v^P+!xQ1`q6
z)Xk}RG0;V+#{^_{vMnp}@pRYb-%i|-ZnO-8sp5$K7AJv<hQVhSL)NM2b)k#de|pkW
zK>$nr`OeEPcjvO`I)K29Zye&Sr#=6TV^H(H>Ac!%f9{1Z%VntNYdO!?^AKqLUJs3U
z&36yp?7uq^zr8s)_$s91KLb;~rClyp{KGr8U^;p8cK`6h$<yLL^x{jCL|*(c^GEX_
z0e&8k_b-b#`$tEIM^9Mus93{Rvv<T9w!B@E4ZCE+tALzuTN}reuB9=CO*t-MBw{kc
zr-|k9lgL<Np$GElZ!~QWTegR*xlp|mH)<AY+^T4k(4<UyiHmxQknejTMl_+0y3Qmb
zd~kW`YvjIp=>Td@Mzhi%#3LUOsdFt3P(ycLIHaqq0hLf4l{EC-o9QOVvDy?7W^Mse
zAUci@|K+SNzf1~~y3S5*yMrKdr>$gca=&x%{_y?%EgSFq)}LvubX-i<EoYrR&%ZM9
zlE^C;ZL^WT4Y@R+4P&wHNDa|(v_-INV~X&A%eAJG+ee%RVW7vKop;j`CIFQXYuYG&
z|GrUSLF^`G4j3TXJM*2vZ|?PWbOdXC{d|$~I3q1Znn*kAT@fO+6~FLVbULEjMOyt1
zLje21<m_Bq7T^Igt*LeH0jJ@LeqUrh(Au7i|ExNamv`mHbap0N`CwvZ4(da37zK<4
zM%3+=+5}Ht#CQ0V@c#vLyi@vzsri4`*3$R?_4U?M{=Y~0%;x`#sPItUzex3vf{dK5
zAw_Wb4wbz#q@+v^7gw3+NPvZrgH(c+<(KDP_gpxGD3IpnY}^!S6bq+)rCkN^lWWmT
zJ^3PZZk)5(h`zXpA3`S~`wkIo;GZ`8QcBBun90o*>FBRX&k7CRT8$rZK9nfui#N)i
z&*wwx8v1UCi-zbo#YMAd3>awb{5%-~Rl^)YSWzaNDjG!3>vF7N;rU|*pM5|L98p6|
zA4|g+Ok)ZVu>W*c;v}9Pl&B4ztC|E=4bHa^&Fz|2h_%E;YkpY4Z)_lcyp&JOx@cd}
zHt)+9K`?5<qD>pcmoF(G(IA>r`YwbOmY51FHP99SYu+&uoC?6i2|dQ}E0uDA;%Y?z
zq^aPEv^~|p>}KMoiN6Z_EQF2%4iC%<8#TVEfXN#j$lg52Z<0@$e*WWbd)V{8zShc|
z|IMfK|4}|Oo&SUi4|M($+0Rl33OYI^KEdxthwpwl`RDt6jwQgOq>7b_IClqw0Mkbe
zdb&Jr3cL$g@|B>Vl^}KX9CTz$f{;WQ#3J@2CvV`0JR9vo3>iP0qli^5hRYpv>tMgT
zhacXZw6_lq;xTwWwud@+0GJ0o>M>DzatQX`o9W)63#s_=0}+9A<^hLv4PvS>5FZEf
z?jP_ExojfUlN05P!6<`WCqVExieQ|dP_}Y~t^6Zy1*4uhGPoQYn6nwb0m+g;^ff4+
z2j{S+C_$t19EKOOH`2&7;-p)_kdD-Z@V#!Hdv|6qSI~~{UW#Zu0dW-}q*ko#NUpSj
z1btZbFv{yaQ@0|Qaf|U`3spOA{FiQPpmG|1R!38&PYpM8fTrN`jh<dlpSymhpZ`iG
zYr7YyN1B5bm~#HFHCyTPzg6FOI{zQ#Gt>E>Muq%5KzEIeACoYd&drq-;Orw_dqe?r
zFH#wH6P`hr?Ik5-0biHh`30*$QA%rSOulRikHL}k70FCvi)_cQll<eE4$EZ^0vY0p
zuHzKYSG)-2jJ5>B)oEef>!P~X#dW_F)%{XjcT`k&R9tslRCiolH!7;Dv0S%l)OrX1
z;`KR3trfiq<v6jVm{v<Su*A3J=Yxs!tQ02F({?u)U1wg!<A(-m0#xcMuM`IVZleib
zqePizi88HJ8H-;A-VPH8iq<182|zhb^@@-6q}w;GgfB0@Hp{G?k~ct<-}UjA%hvX{
zwuF{|!FiYd-_Ek`|9$)5@t4!Rz)2bp=>@V#D<jMi{`?2)^8T<ae%t@&@yEt#Hj1*n
zcCzeusN1|l-Bw=RTam`Zd5J({R&=o)`jSJKdg#Y91o;J%p%zWScCvCmw4&64XCATX
z!Bu{fbp@B^lo8RE8ZR?QRJM{CtEPbD(bm*RYO>yMJqwDPQ!4HAXkVC7H0ea$(CfJD
z$F`JSpjiMqk^%jJ-D$T~#s9O}Zf{-58QvN}`}CIRadMr@!2bU|$(xV#nJ)ifPHf5+
zJhu*biu|{}x}J&uytek_|NSVRndHA16-e+~5J%eWDrxp8*UKmjMnD{{pJBov89VWY
zGOMdMihN_NeV|`w?$t<CK82tBsw%Pdd}Zl>FXE$$%*x)D@fXvf9^0ZyFId5a>8tOk
zo5su>NRUN6n+h>bmV-kwFR3|r3G1ns@umx=#TnE3(8IV;*ZDD|2GM8MNTephVBnsD
za82R&a{|<9mAiMT?4i&O{lj8lf^wqcry?gUxmK^2st13;K?<wbJyjqyAmp9-Qky;T
z`HvDqQ<xWjX>)GFQ&Gz?qSLBREY&AkeQk`WsCGKRh09jOgG=W+67^-WzLqFJ*vM%@
zIJ5j0Hw<Q&LfZoXd5)hv=wUv}rh(OC=-q&Ee(iCX(Ho1KDmL)5XstBGU;irTub<$r
zRh^MpfS#PNd#>emVmt1LGX=#3yA*=_#zfPO)AOC7%Y0@V19C!@Q#6rF!-6B2-z=e)
zydO;b-qNk8x>?L1n99DTH3#0?d`@o~OK|iFR6~?&BfGm)F-MB}@9waNSlW)Co(esL
zx^;#sc#pkq>3K3;%90Yoqm-6`FUjG#90<PGZ)wys(F<I@m;qjL>|iD=rf*qLWl{zm
zj~q;@v?K|u4u<?nF}4*}vn)%mt#Wjk^>QJCv0bm};-L^QNwExkl2-~kj00*tC5lDM
zqB9{59PQZIKC&C)EhG?8%oR6vdMR2o6KKk;LMGW0Z~gmPg5nkb4YLyl*3S4y=VLh`
zVnL+tn3}nZE3ve2Wo4N=qWyiqdzSUhz;7Ph$6LH?3f&BZkjpyRKR)>iAev>Gxv0Y6
zRM=9>M;C;L+^wYm(msB_{qD{2ui5i(=7Hx|EVB#q>1RGFSwS_C$y{Oj0E}EfrH!02
z5Q-aA(zzKENj*jW-?q0q^=x^-AGEPj{CmywF`u2d!FQitJ^%Qrce=C)Ct%zo)q3^6
zl!IcT^2yEzI76rJN}jpg#JEc423;M>sd8;<dW$57R}DO<v4Fli7X+tarNQav!pgH-
z@#oP^l#c&~x$DkCWNT(t1Wb|tH`Z6v_TR15`qTaIqkQIx|E8e=8-oQC${<N)qsa(&
z$&Zt<H$Y6eS6i{zok{tAqW?1pOAaUgs7Xm8E+y^5NwNTfABiJGceXfdOE+is+<EId
z(Ij*+hz(^we!fU4A63iAl&Q;<k=h`*#PpG&3((Y_>xQOWq(<2v;kz5wU{F2>)=Xq<
z%JEs<+VX=odiDC<>$IjjEnlj>2d=LR>lxRx6~1+@b9By!?NH8}z=4ue&RClDdmc?g
z8;x;dNC}S4r;qSQh<_Pl3H4BKQXz%1Wb~@BjKbwB(nl>Da;AJ1x_<zRf?i`(zP^kO
zVacCx((B!03&Ln7E4x#fpI^xwCRz5PYSd4cy!{q83|)wj(V&ci@Ez}<=C`ziU=OW5
z?V!9J)LbjOgY=U3v4c3K240bl&}|84GSgl%HWRAm#sSD3nQiqwZlhoVyk=YOrmww^
z^uaV9W+Ro}NBUU4$?ddWb~mlx|7N0)C(t~WoAFRWZ3xS5wv*|5+(L*VZD^Pv7c)|t
zI>_}A4snYBglLSBsL22Sp@wLL=S>B(Aw@nr1)!o;vj0pb6;B{Vhirh}yF?T+0}5#%
z+Tn5G0GxOT{fW=_4>d7#uGQ#`Zg>fJRwgS@I@W+%N0^dC^;7Zcl}<GB0}V)bnI6n5
zjx=D6&75^1NXHkl1in}565K&O0T5ZboeDmLn-zjx$HyT~1LAi9z<Nml%Jheazg3b^
zhVH<{IE(!t=s00s6@FXE2J(7POPJ~UpP?6ZAJqSEeIsN4QD0ws(*HclXD0m*p#rIV
z?o+8l|5{A0bzLu6o#63Lx3G#aAj1Rw7DO^O>d*&y(@9_ZEsH1+moA3~pswNQcEYm>
zMo9q*6p0b;%d}B~<-SDS3-gQ$FM0GSVrLj9EOf4?&-Tpq-O%fb?|;^z+nt1wcaeLw
zm7VlVV7Rvd6Gar#pdme2`540mnT8K`qF#;5%lT0yqfT}J1GK?lVF1}qSvqqKGU&yv
z4tnjRU=}1MM5<7+QeUa3K8?z09z^6G?sa0&XPtDf@N_fAhbC0<w4qWkgeQ4$!oroS
zd?O`lrPqmoCY>5#JLpA!Fp18yl1onYdj2$#QiT%%$6jv8fT456w}!P*Fz~w9c<G84
zTQ#US6(-oY8qS$J#y_ttC|t!CKe1XbB|ySfZR2m%N+es6DnMIfstPhlnKaJ>vNH-g
zC^FKYBokQ&MTJ?}m}+L0X~o(~o1k6{;QnOpUSaOF^yKdb%6d#dW<!x2tn1H<b^Q`p
z*Ea#x&jVDSm!|}r`Vvkv;#)s-|E1v@{b?Nvz4^(CYcotH)4=RIdDbq=B3elR)^m?3
z6%dI;61M&@@n=Dh14YM);NXlLVCt{Q>hk#bK=cRBnMnwYLpW~Jy!DTwK^tp|kM7kd
z6xFS*@gNfa8yG)$vsJkjTksWrpQdFfJe4V;5PE&EZ9%U?65FQL4kuL>`;4e~rFx?V
zak~YdifPYC6DD6UbB1Y8t;{?vuo!rL&%HvJp#RiqHp}Hq1Ev0Lqdhs=-u>;(yI;}+
zmZD~?8q>@%ORd+;V^lpcPz!MmEsd$mE_RVZJJNEx;aJ}>Nofr=Q2E3tWLG-DTWaSo
zFw)AD7>s6(SE(8~v+22Gr+bdBrROMa3o<$B0tfA0rJ|59lNFq`$5D5DB`OHWim0%I
z61%=6tP8MVULRdg&)Ui@rVecAPbfV7Ec80Si{|kniffh;xY58#ACjT1sVwz-uWAi8
zd(HC9N-Y+nhoMoJF8`C&%)t3_4K&%EOA#<d{%>s5o9X<2YwJ(`ACK~xN&Yuc;l48f
zDxEMOZ_w3anxmOn2QAIJ1BdjIGWblQ$xo|{gV4j>H$*v2GxRf$vm(8+My3z8|NEb>
zkM{T5C%+!;AOCuIu!n;7dJ<?G_1QN>ltrDgx{IHfg}g<#mu@J$G=W16p8_MCGoM#D
zcnm#5NvP^+#4Fp+AKcF$>3;sO^+TjBU%iPAIObR|0jV4aD^>X}#{k{Pbv_ruS8IHN
zc7dPGCM|bJag#rbs#?Am4fDcjhG4$>r~pn$^MC#8w4$o_rDnFUE=b=jDY*68%+N+#
zXiBI|6W?-^r^QE?p_G;gAKzIigzsF75AP1%y!$O3Q5b0X-S&S8`#)qL=S}@epDFae
z-dao3|3+hV?TP+B#%DJBKSqUz(E!VGfO0IeL>3;5Uohs28w{9+X5Yu+{r2(k{+=XK
zahE`Ouv4u0<W8LP$=m;)KMsRv#M<Lp^G+8)Q}+LAW22G2|Jhi7y8n5U5Bcb-3xpf^
z5^r4g?M;kS&}szDQt~`(4U9<$fQ;pEa<D8gL?fvn_W$t)cWp0_u?5l74;i|FgBKIs
zE{I2Ln-TPdgNo#=zPTR+KqkV3kD!z^E&Vzk+8hrIWmrflYEq9V8ewES)VP<lW)zB@
zlD(KksysRTu=^`dCwiFq1QXypW*O;E1q0<3=8^i7VF&ut!(5V&2d*at!!Soo3in<o
zH3z8C$i&o!hfO1(E>8j;*SP`}fPY$&tT*+MDhnWXF-8vfm;J--y*;a<)Mn<z#R<H1
z%<!Ot*fe=i)>X*CsSR=F!U2+NC7~7k5*NEI9{&D6-oH88FFpL@{gVu8s782FvrLCw
zv`b8<=MGBEX6GoA_oZMml-!3hgQT_~HN!7vnolPj1)~zvNs3LGPbQ93;e4p{lzpsY
zU^9b)`cgJU-FUvgI}0dM(RfNBgPYC3UQ_|5H)97y*fw>)O<5`oUNag;r5B4d{v=%w
zuP>Z|_Qn$SiGwF`>?Ej|#7bHg^~KzhJmHdsd8$TX`oDrkKuI+W$3(-P3Gy(bDR6Io
z-KBkE$G?$J9{=wI{qXW`W?%8AnE!9At*@u}|HelBDgMvne5|ZIEq=nnFNl2~@q;+U
z?Zem43}TCf)ftUkzem=+*V5J8d_NfnHE6XKx|g9hc54_O#`VX1Ir2B?Vb6=G3o0o~
ztx!X#^m`qIJ7@AKG$TSj8{iyp9iTX2uQLi=adS<s@41)gIDkpy)}VL|$~!~su*#L=
z8mx<kSqj;o=uJ4Q4E=!`g)MQkw<A;wuVf49IByGrOwfVhPioT1)u^LYR^V&Vfbhdt
z(ip2pe2l^ifQv1XTT-fh9>7RtQT(1;a76hkxFCMd7R0f&&*6X_xOLQWB2Lh#+pM<H
zd#viMHtL0qHSV*q=6yESy3fW|XKpNoDQ_{`8(Hk*7V~^)&F{LX2L>b?P$2!T>s=rk
zVvb&;c3Gu3en3oAR!~1{>?VG!%4z(tg8E&cqjAq2lZ(kp#cU%zuWgoM6}~TXTxi%5
za&IkTt|m!XwC0t&LaH^VJN7OlRZt&`oQ$7PbToRAfmaSaNxC|~>l_dqCTL69@lZR7
z?i4cc)1~_Z+Hn%mqd@tzDj3F;WNG&@4Ti(lwo#MMMuuhtBWeW|Gj4<~m~@frjFlr8
zL#U76uPI6udv-8zOe}@A43yNjdFhgk(j}XvOSVdvT+QDqe!#1uj1psz^_E4)#j`<-
z9WtI^m#Ut3=4weP6)v>3-omI2>=59pPw1WQ`xjJ}pUc&bD7jFkNqS7~7J9Fl9e+TY
zY3)2!A5{-Wl}24^yE(OOgPJgoU{8@VH1Q+8dxP=1{}R<+Gix-Fr|pw0f)>^N#(KQM
zah%cwPC}myTKavQyZG#(YovLdOSFLEHvx4ZWOw}Q{9`@Ke5kd}?(?LDv`LVaVB~e=
zn;Jwdz;gLJO7kx9H;;VVmH;M8G;I`~uw_7EAi%XX@sm2kqcNs@KP`8&xa(l*&b|jw
z{XzCYaHl?gz(9oooi09}XlGIOg3;i#dg4Zo+cTr^ssb>Ge@(pZ=X5r-7y%5{3YLVl
zKIDZ}b%pD9gB}G?toCS^rI{)Qc*fpWedt_vebXCG8)D}Eyb7grug}$oER}kc43;N<
zn^#hefe6IMkgU`RT7UuT!WoRtQ-P3UVCS8__Ev-88(6Q^*mygqQR~w<=_?u<WVi`?
zy|g{G)HSQ+5_GX&b*<}RBZk>A<sR4gDc;ISBl(mw9*l*0rpxhiH{cv6l9;n7GWQfi
z26p)tR*@I?3@6xFP`@$-yg7DivurrdUPl>%NRBVH@5nIqp0*u9%%u$?Q~cfXPUF3(
zkXzrKSsZ)Xp7fDPM`qcb5&#%{YYG77-N)HJpLX_R>};8|bH=Srsq`LTZ>uDyPn&!G
z&3&$1qiAzK9l(F8Z5n;frUAx}b(em5pcD9Mm)?Dseo;p-d%9qQ&lgXhcI!90TUocT
z^UKlx??-P=_HnCu7{PnsT)U(|*!ksn`|tbs(DPAI1h9!xm&aL!K;&o|wOkDWr#3+6
z+X!Q*BsIv$9P{0U#h2|7dZA1PE{Xio@2H9u8@W|r1Z_E(c3hpUkM#zcNdv5Cy-BMb
z3L47J?DRCfys;v4mSqXuKH6N9UPtDY%~=!~m)+>no^~sDLlnL;G&cny-S>}<mgG>A
zpzdD-s`q|xo_GI?InM9t`gh9xZxe|0YU=)XeWUSo|NAH(Q@P8VmNmSH0n&?3Q}V_b
zSwSYFHgv9PlHsV~y;4QAl3RcZ5I`!yN`ac|!!E%bp|T91vuu#9P+@<;e&N%*jYlmK
z&>Md;6q;Qse#mG&zyXSz+cdews2AE(3beuQtFG%~<N909ti^5VoL$DDrwYT!_2<!5
z?&!5g*IBN2c8=L6LX0)k@4F$YSUYalnM7`?HpMebBDX^U;RxQ7f@X<{3QoEl+}*rM
zVgl5#af>k3kuy${PXk)8Fp|ZAZ_k;{Sz`D1`eOE|&pX^xZAo^iq~_u;A319So8hWO
zdS1l_7lAZ(04+X0%Wp?tT3IWT0+DQ&CB{_KM+foYv|4RgYHA@>f`qn9;Nq|V7qyfd
z$O}Q)4`;bmEuN-Gc|7s}lZHcKs#D{$yCG_L?<=a@)am?~sm3JtMa&$?ZlQsC-pJa-
zLO?B>RHSw#^0Z>?jZMu2aPq8Uj;{hl<#5mw|IL&l;qfTIg|+B`=VJuGZ1J4(JKkAN
zopn~INhN9J4gF3Hfl9<m7E$>XH7N8w-Fdns_M0x9CRGafb^?d%M+lmYjiTg*DnXfv
zR9uLK$|?bWOB^2_ors-(qG*v89nDB9YA_*F7KyA-Q*MDJ9UrE5#uDtn8+w^Uho%%X
zfN7t(asO*#^R!?P;^58OHz!bPZHD2H-ireJ&kF+F;!Cxkc@*i5A^V@cq6+;_6CSui
zWBg_RL@elIOMyty0L~pI$C&{WwUV`wO}hB08~D-q=ZYcS;5nBL3?hY-bmQnbU>_pP
z?BihI`e&%M2=yc_iZB4jJ7n48CX+a{N-whlLNfB_h*5Y%<5Dg%ZpqLU6d5$_=R0Uv
zfkXdh@tJBg3u@#ne@yf|kXbJqFcIh%{%DHJCjQYZ#5Sx1|1=AVTsBmu)c73gHBO5v
zGz%-_fmm+Y<CDXqeG@zKwqZ18yO(ebCsI!KI&DA6O|Hs|x~OGk*aVfJ0xF|a@q7Z9
z5PM@N))^*Lpv**#CI9ZG>t12l4q%&TrlK2!q1zn~uFW|s<9WarcIv^&JDskaZqMzj
zV+$X`p9LMoA+7Jyqvu~Z1FxsRjrL0&r#HiJ_V$l=r_#}$i{zPd+fAjZ*kB$>-9C8#
z>$Y&tFp=0e&g@8wg}LQP@{h8_c6f~|s6Ax9g&!LpQO1i#-iualjd~it<qOiLDp)qq
z?zAad+4)Ic5V@kvBv47MJtDm*DXtsBu|8iD9qaR^=-S(<i=OpGOStK2(Q}#<j4kS_
znE}d(uILD-Xll6GeO~M6JeUlSC8qRPLD+L~1;5?7r}dHvEIQX}PEORFQX+;J7l}1r
z0Kgju;O7DaQONGWZx{Y{ZcBpm1@mg(D*Q4LtnJWa78Y+IPJ!;E<5Lt@N6;Ged$ZNo
zyKiFmqI-t{U<<H_v$epL*U&cEP@a^oT5FJz8;@QhQw}|~ViCs&cPNc4*<Ol%7z~w{
z*SCsXInHC`IelX|k-;2)SXQoHKXk5tSpI=$4qssXe^^|$YF0|Ofhh39q8=uzk-%ua
zJ-#Jgcz&PQ@fv<16WQ4)Wex2f?dyR->+LI2Yr(6$Md8qq_LZUG4xKA|tMt<I^_R@P
z(Q9Pg6s({W0tbPG&1GQ}x^z=Pd1`}Dcu_QQ#X@6qnV^RZ2jzTDp>5h}n%qUH9GuQ8
z4Y9TYIM>2|Hda<wMUx(FtcmrNMpM*Rny@=p8f(cCE3xECR8=!39-3@IHGxas2A7Nz
z>z=sHgj3>X@|YwN)tDz#e&v`K88v*8U-lx-J|Lc-LD@-1g00zHT`Y!^>>oXAnL|__
zw6Ik5!jUAoFiB3A{SQddIQu9Vnpp?mcy!E~Fg+x4D98K785t)p^{*aIokZvkgA14k
zN^T{fxpB97P@^n*(AW!OB@~PuC_Aem9Dn>X$DO3vNal-u7Kr!4ECZv7h4&m@v(Ijd
zjV28ozr!sG5(3b&zBm)-!V^$S08b}I;$K))jKxG;h%dr%;D7k}@+HeFCtM{QYHd01
zEcedDLT)CVTsT_mWd~$~8m6fZhNA&;r36ENGQ<deuo)FuK{%qM#L=Mvi5rVKaI*uf
zff9gN#XV7TYTSxJk6iuqm$$Dvp!7RZDzAV*SEStF(tS;?IoITL&Y3jqAfvilB>wQ%
zCY(L;YfH4$*E;|O@rD~&niD>-TcSy)hD}Cd0K2RkoQ2Nl9N{ydZBOk}QYh)kF%xL+
zv{7P1C%oyN3)xc#Q?e>mY%_b$o!OoVfbVzHk=75fapa80E--DbPYM`%_QwRu)qYM+
zkuzyzoz*dyk@$5s2<LRQ<v`<&dY<%-9QI^LonCD%)qaiz`MQPXChRziwJ=}@{lO%O
zMJ|Poz3iZ|5hpWddJ6lg0mPyu*3v`d*Kwz6Xlq1V8lqV=z!4lslE{9IvC6LTsc|SW
zd8fw)buTri<Ps$2emV}CxCB1MqV#;AbF`{7N1IAAHA*GTwdNYH8mqj?9|Y*CWvb2*
zw{+x-?*j^MspPFjTt^ohMlSl@Q8C!mlvaW!%sS^~@_@p)L{a)~hNuC#g?{W(TAl8|
z>w+v;8=|+8^c*#n;W-gEb8kW8ZscX_v}>n&#^E=6<?Ife5w0*_c^3`6R;B5g4a(@p
z7jD=IqKsKLet;)}mi)kXFDX%5<&!VOHdH{TdCr>_&^)%}82EH~UX>$T{E_5weJCPp
zT}SMp^eD@japvA_>VhXk@>^ebQ~m$6`gdOap2znA-}1sgE%Tk1ITr7J{+1V-)Qc!L
zKdrcJ#rfZ-P)z^HpIrN2PV{*%CcsnTKdr83?0+{_8&C0{ALU~W?jRT64DXPa_EzfT
zQ(+#C4-S7nIQ%6}=}U1_Jb50-ysuDMYGi}6R7BJy&8$_?s5MXF7%*}{5(h*^{h;6=
zOi^*1IiXBTB=+SQYIR1?e2xk|H$|>;qlpHtJ3@7Sxds{;eY-aIp>rjqQ8lWDVq*-x
zs+nV^_2S}a%gx?nx^ify13Lx0+u}uU<gGd?Zh{dy5;=n;k0G3#EH|@CnLOR-Vo@K3
zvR~66jXD--XowPYPM=5n7>zZWbmFws>89tyro5EXGi(AVcINg77p@J1xzy-56%2Ia
zJ42O^wgiT<5>!ixqyf&787aO_QkH`5saVe|BMp*WXa+#DmQ##4p&PAq6C+qLC~x(Q
zfO)OA@K)TMUd}Dp4TI%Yuf3MN_R^rg3zbo?9TOn5`40dO$CO+M2p^yYm55wF@<`W(
zHt*rk8K-hg&b&)Y<SXacW6lItqEgX{INbrhpTOMXu5fBKdh!A{#f#iV=cFLk&0ye}
zEZK$$jnb&5r)AOOKw-85*;_=ra+y3PP*py@3=*ho)vap<v<&zmheAJDabs0OYJH$N
zJK)Axodl!uc2W!f&uPlOpwHEK7pJ%0ENETFg``dU*Xcbq%FQDeho<*Xk9)}3lgAj9
zEnZ~IAjIR>wje2}W~bj}cHhuD3-Q8PkIraBV5HmJO|fR41hZ5V+aFGTMOUHlE)6uP
z1xo%4`$h|RHplKwdqK4l_(Kg>9#YBHOs|B#6{l{$6hh=W%4!pybB9=3V%Xn#N948K
zoOj<%-4#dVlR9=&XO(0h9J*cf!sN<AmYQRaXjnlh@7NobV!AOCqL{Ww-%faAY1~)l
z?lrCbV+<ZoZpCVHFp<6e195qd-vJZJ2HBwtC$y!|t%ssfFcNH9lt;sp5@lB)JNePT
z=}wz`-uz?$d79y9;Bjg+nBsrKQ>{J+*oM^!2DL7L8f1c6quE?(wVL$}vAVIcUSDrE
z#Ifs)$AcXE$eY<3xjQ@@f%e&hm{iA*(E$Un-!|{{tYp^!*$MLM8IZw417c%Fwj8eW
zCMht-Oy9iQJ=*!_>x0AX6F~vd<KQ2$4Lxa1DK)z{{vkqOpp1(9&WYR%1g0N6IlWH-
zgI;u7G*<F9LZ;jtK<S`96$Y_$5N}$2VEEMF28(j^sdAX*t~0=0I?!M=L#{YEDA{my
zN^wlI9Cby}6}bu#7c>!&O{JqKGN99j+<bkVPEnJ`Qy8%dRAxWpL3a>Dc^f+h&^??Y
z$+3=FoN*8UN9tcEM2#bkhTd>^M-@b_WUS5!yqaGV>taK^gaZ_9?i!-e6pfZ>tcu1O
zdfhZOMB}AsY@*Q*P_AZEG+Uy%Dw=Dexh|R;qWMxZH_;BL)ex<wXtfLkEG718Vy2SR
zA8d#>D=RDFd6TtUF~}EhbJhx1XAmHzeWcYPf*GF0@l9ca!(o90qq%u%TSGKNtU`_Z
z1v|ESv;CDnv{VgVs?IemP3|&bx)&7=NAbyIe}ub!g49uMx`)y?l~!Y>saT%UC`GYK
zXgOzE{FxO!dBhAr)E&6+Z!qYQUl-|93l(RW*Nb#*^2jKuH7x<OIG<OZoRdnQIv==h
z(i50L*(H<l_Bda|bP8gdeHpARaSYr+p<a3%wFeuBO8xzH?_cxo|3+*H`LBr^UUw$_
zhs^)j*jR66^S{=g?*AU+Ly>n-87(s)qh&KZ8v)+N5!cbE0l4rp_i7|6pTbXmRh8I!
zzOwYc7x7U=e7sq@t;*<DDw}d!TsVV?YXrE$-PRUWdJ%7dXEcrxFblw)wCNoj=H8ds
zgo0{ah)TD@QjT`-)QBUY$O_q;Cm98$je0OCCNT|_zFO7xMQ)^f6eKtoj`><2Su}7i
zTwB_f_+?JEmgK!XNlT*c<#)A4ruj@Z7${?QkVyjrCAf=(!dK*m7i!0E$%|WrDTb?*
z@7wCV3{obwH9$pa(R34_Dno_-g$8mHqL`R*AwHUDz;{2b=2D~HT%~_BZJ%t1s!~){
zsGk)9gMQSGuKjLYoQL)-TXLGPsP7axKQn#!t5g};p;71sw4BVQjF^e)QmqMG4=Fe!
z(>TP0ngd{=DUB)|THNVMCYC>-{%z{G$)o=PEOCu4Q}2}en?BR>e{HO<rStzbHkwcL
z|1myRlBX?xI*~6cJk$j{l<Pyib0_S{n|Jg}!>i410c*$<tj2BBxDD=3+>9ojXws2F
z3+BsA#do9ds5uHDT^Z8Ai+c1P?zon)H>1I|_(-KtiIV1$;W*(U?!QFEXht+DnxQ1N
z6~K<vwNBP>Y;dGbIs?z*b*Gw<swW`Nu&XJyh!i=<=aNs|%4xP*TtTt#s-Xr{5~&&-
zZA~8JH#qWF&p*~{o2M@pZ=og{)4(%p$ThNSq`Cf#p1X9LVwOtZrpM)9i49uIzy4M5
zlb=)z=6WUCD}JGlc@Di31^scGaHLHpJu$_`zW|c}*;+>Wm$D!9`!XVS!Bng1)-8su
zxE<Og4OXms0tcMk6O_0K#}CiQwhCuw=nHL!!0i1|SY6d8>VRA)9B^nQeKd4K0`nh-
zPQUMU^#ddRO8dT=be~4;avQrMH+EfZ?P_X8E14Ommz)`abUg}JnB5uW2nBv5@)-g?
z%{C?5$1Uel5Byjt$l-4~(TKaW)2F$6DWFrT%@nPQ;Y>#WfjIjTAGeiJboMnW6510W
zJ)yBuY&M;5=3NlA(jb*7C1T~OBC^Y^#xe&DjjN*XJ8Ti4G&RpByX=^fE+Iy|(lBBv
z+Xj(G4UT_#Mb>auVw8cZGH$W}t)?}4YY$;=r2E3H>P49FN!mav^{=&Rj77$9kcGAG
zv=^9V?=&04(;n6{OGEJh=%W6rQptmjKAB7R2MV2<q+?@pb&1!wcqWhyK}_|EXQ+-M
zNqlf9#-!m@db-(Z;U{}E5(tWd)5ki!=_hYl*vgYw+P@VA<=2q%6(eP8%U7*i*gkn;
zAnXg9hNc~bYP5T842JqFh~q(UDSE-B4~QF#c+F|P=T0Q#dC7?ovDp<n$YlWS*%oR+
zrd1S&$ADPf&#pRLBN1IX1Jnv44pIV0)Ky$~!6X9m+lMWS3VTuuGFp<?3(h#S53rE#
z>V@Vcur$|a=3iM}Fte04R8m<yFJ1QFcgHTw8FMy{<U&a9VVRgRPR^b%BbXEuhn#jq
zQ4>^1B&lGA=rq<~zt+U_Y2<OyLLV(+y~In|>yHhxI?cg{_)I81QEVp!Znj!uHuPgr
z|5yVZ46=uSBa<n`qKr9~f~1Ml^Cj4r9sQozay#-4Qvyb#z>i#BPSZvMaHspgVxY9?
zw26TW;v^Vj*a)eZLIWQREQ)#%bengj;lI55O2`ap3o!!eRIb8m)V@|^)NV%F!Cowa
z5%FN5cZOOVv^&t1LfZ6>W7r5{Mr9zyWTGjFxSWMVio+dVcf2zrTtR$HDcge6gnQK+
z$_a#`UX$lp(rBE?K%3wWCuik@yvMBWGKad7kwOqbVFl5rfrh<eOgU!s%>9_YcJTvg
zVOQY|8c%tt5_5NEyOVIr(lqLy`C8UPYn>jP0A#@pLxufv9t_fUi-0?-(Vt`h=@%dc
zOB}e>fpUbP0I}^{caNZ(>>h~$q6-M^yMw$dJxncuO;r0m<Nj_zybH$emN-FZ()NaW
zlc5{QRL1bn50Oxob7avG_%a*wGA~C*E>!1QE)s@K^!ee6?1UDJS|+ay1khy|U_v9L
zU6BhAfRg}iv(e|r3uR=J=eX7U;Bv8m`p|`QVswJ3LcEbnOnM$AdT=6yRi%2`PE0gv
z!rE!TJyK97_a4a(E)Z4Cg3VHUy_wnU2tfrv0C+%$zdQcmJ|{eDN^w&|%>$B0apC!j
zvk?Ky6Gr2~wW-0;uR$B;s}fXUmt%A}$?5`ePkg!vStT~ciJlcEN^UJdNN(~C;ea>9
zTLy>ygD|&(hTl;C<lq=ij2^mV^jy5<z>@TuvJnim_7H;=i<6)z#wlcbW>li;{c8u6
zjC%!xAHc}@bV{?CiUxKaUu#5KfDrlDHv#Rq7*@n4!_Y24egg6}GASnB*J!>U_VX?G
zc$2qh)CktXoCY58KDouts913sjOb!3vmg#(LUO;r9D(RA1LzTyG0+L7Q_g$an7CE5
z&s%fvu#ILFs+iA9pzx8~lUxWc1FQlPC|DG<nTR+I!${jS<_3I!`0keqo@wYHXKws?
z4?KO_=N)?TcxldizA(++mq-etfFEHhdRQf0TyQTCJ--&U{^nW6W`<|f#(r1~EYX|L
z(3nn;(kEF29gHazXHqC*#6-8L4RN8{zGR{hW0|J7&<(!M=$ZDw;1!!DvnZQri3>fl
zH4=r-Ng)|+O=VEaP0>|Zdh_EUCz(S;*NmrKDJtE^hRVQ9-&8ub>AN7I{JJfl+!zI$
zjiH$rPrh=|ti*+yxrJIuq1dL^xB<?!|G}g+c%0os0Dvj>KlSEDEA9Wkw(;cu|0th)
zn-)*ys$;xS%1h=yFED*w;3xJ!nB7CvgnVwPapplc=T0M21s_s*ii}c02N5J<oD)m7
z2W+$a^1O=W7b{O;OYY~BxBoA^U_i3%-OWFy*?%-!&3eZEqrUO9{~zN6ht;_o@zoJ>
zY(DA+(10jH$4qA!Oz@lpo{5zq%YvP>$lK-Ff`}#_C&B{JNI&5m5KT}89<V}P@@B*<
zViorpQkbnR;Hpr)o8qpn$Q6=4r{Zr5_}8%W40`)8_68W*pg-}utak|{yN(8EaTo|V
zxdJ6h@#!vk0HjQ0Xvmp4p;Egu8GJS^4MW*v<x`am3KL;LCi|qPc*hZs(&SgA0HJ0V
zzad7D>ek|#@<^uF{kUmiZ7~BSDt)Rokqn*2e2XwcS?V9?KNzca&L_Z<t^KmYZnscm
zUxnNUu#pm)V@z|->m*7GbniMt(+ZN4+$B+B_;1Xc3-acvI5ljCXc+MbsP|k>AC_qx
zknuRKP)+5mmLI^1M*XZ~uPTKEGE_8Wgu)gi=$6(Hc%Q1P_zOqOe>U;gafAP$UrVMG
zsi6(M-Zo#SFm6pB$eJ+@Q_hUT4WsaNiyW?<0lrzHt6nq$qztv8?iPN9;5&{(gw}5h
zQRBIL<xmtEpNvKp#j1uYq(+48hfB`Ei1Aw=@9Y3q2BUpSi}Q;+KDi#bUl+H4w`lyQ
z;@4_(b9Hllqq(^T16e)m7;@L+Vc0LB)0>c@7yYu3Nb^D~kN-)O5H!FMT14`dy#pph
zE(X&ZaAVlzv^WnmqM8qA%lLqfTEY_H=nt0c|M;m9i}inG#riAqK;v01iAHh`h^FOC
z(A`6gz(^9La$iWWHWXa9p$`NHZB5u&u^YAQ7~wN=x}U}KK<#m<2U>i@Jt@ajxDaYr
zG+WkfL8yM5zbj^39CHg*|HvvI^XN2^X<|ccEB9a<YWjXkLhWXD)34|P&$~&|ZFm(1
zy-C;2Qf~aaOSy{!Arm?uxyWDOInnt8@Fmv1!`^|45`U6Zs49EiTnJ<ANNm%{EX_A9
z4THE!+RB(lP@q$cJdy3lHY2W3(%*AY{bS0u4H!Cc^1gGmXfbG}ZCWj3A?;UQxMaUR
z0{qip%;(Z#?4D)80M11x>eoArS2e1GVAl@gUmK6Y;Dx3ie-@v9ZOn{Nw8kK?bugL}
zF6F`d568diD78BYF&{Y)k_kwBqY;JAW#P`voDL2U2kBYTaaq9(93aw|>4yo3etwP8
z#^4h&IG7(l>D?6k{6-K<9%sbt5%e|8I%s@DvVlzLbCBWPIC0Cl2Mu6y3}6W&3QbJu
z2#`ro@t`%wBSb`!z8zZXl{`!%L}NsWB+tPkCer~w8skk9>JAvuP;Q?eYiJ^HUPiiX
zK%pX|@wbaP^vk43$M=LcDUy@%QXYrQ&7W#brmk&{n^3LS*Pj}Rc=U@Se6-hqr+ZE9
zMNS@_y(PM>I9@XHFy$pI>!Nz9jZyf9ZWLhz?YgLRL!gr`nX5$JnePlLdH{nG4QwAD
z?;oAKIeaHxZ@)R%->W2HSkpU$1{op#rt`w8?UC9J{~umBA}2x;G<3L({ujP`3E1g|
z?#jL3xf)9Ws?#DiGK<Jd+i12>@0OZU288N_szAXC)Vl*VltTmkW)V?TdkV8_er;d+
z@9~rC{}~Kxlya%&^!~Wx6#&wYg8RR<#(FcY|8K27-TytxhcqD9aNrKvyGtpV#{mVw
zKznJo3r9D;t3{`$q`1eJk!`OhU&5E#<n-AyR$yywVHmA}=TEL;A5y!wsg7!izbSr5
zSr3Gu4Q1L?rVVAp&CLipt(ax;LqouKxn3r8w&T#Hr@fc*tjcDDKm(az1k|STBM#?B
zZ2w1NJQYz1EzX&k8TKQFkV|Z4)Q1gR;jw9*t)dY?O-<B{ze*3>!*{RW{DLvugaNs1
z3SC>?HB3uIqcTC7@`(es-Y22b=wVrg1n9Ya2RXNtz^t)AMm3fOBT>Nw<aN=iS4vhS
ze@>%pY@?i=04}*S?x#7Tll|#!dRlMc#Ohz8rEf_0LIY@V=4q_irZL;l*0Mv}CD<yr
ze%r|8JK&24LDv~jAce;KgJ`Cmx%3`@DFGSlA!gV;_kbypCY-7MWf+H=!^X8WCx30i
zUZ;jdkr}G>+<|kg*y~iC&RJx{dcY5{={Sxy(E^-M@@LAua6$ZzHlINKLAdQW-Opzs
zFpWKP9wZsL<HN(Z#|V^dK;CH5#W$w^kHsSeqfA&`P_l3q)p(Q^khjvwZStH=q@zh@
zyTP*O&QJOj2cIiB<kB!%dksCH>x$95ykf>kTbQ!}L^}ZLDD*C%?3u=15)oHNjLnmB
z3LWI+2a!aUNysMpIO$1f2KGt@yyNs_`OM1#`s4>Ql#b~KIl&3--^w$~h!RIgG&qLA
zXI<NEs<;dR)lKHqC#4;btHmfx8iJ_<3f&=PZVdYUoYu)`PY&!XJut%FN*b7HpJnd%
zwRbi9(!{{7%l(z2)>9TXbMV~XniQZx>7^>MM#?==$nJQ-=2<H_U|O;p>r`%HAm84m
zz0b^VPZHX<_Q{j~#vz;pAP79X{pVV<)m+Qif3{jr^50{8tP+`8eBrxelqwQIOLNm<
z7bG|KEWC7o7!1h2Mp|ECE+XOiKqS1L6C0y12&rj9o{5<wX6M?f4!P+Txj9u+h2;Re
zUeX%AB?&cMHi@N?ev<^yXt%ld_EtQ4*II=fBL0Rzk#=)<i+cQF=Xm$%&CWi1d#pT5
z0S<lq+}Q4X%>H-CTcOV(if@j{PENM*d+bQ$3@)AP2$*Geq&rGNQ_@d>Vw!5;oe~WN
z#wQ0vhI}*@R8t~*h06M0k}Jt58B8z0SQ7*W+aUDSjn32vWWRztCJ~<o+s5nX8=XI!
zj0Wz7J4kVCIv9p{;DzGkXnXg!H}8HyeuRC~R>Ye=ykKX=qy6Let>siBp?H0Ow_@7|
z2Yj_k9y)MhD(tV(GSoU@@EJo8gn||>)e40>WL+>dLP5Y?Wk}gGx&Kh?9=zFqcVdj!
zD1nZi|M$b2lk`Ia?J@<*`T@_g+42TqZaSm&5}Plt)e@U9uWGr?Xf6j~03bl>@vr*_
z2Zx$=nxASMU5p}hZqhXo<(NoIpcdbHJz~7FoOM~*5|drN9a9uErMb_b5aRdVo1^{R
z6M%_?z0!#<9sXwYeu8EnOn+jNSaN2TBSG#@C)p`$9ij$C2wi;AF`gi$(37-d+5jkm
zD?>&o=+!58uiPx~ixTrK<NbBlWj98OV$*lW817>w-CWYX)EGob3}h?PiHwVk7Gt@J
z4WuJ0C#7U$HR`3#$pM^O%gQ2b)viE_ei=hm21||?SO=;Rzb7EO9tY-q$u4QssWi`t
z(Zje3S-|uWV;Pi$f?1Q61!*@B)z8r~A1RU7bA<~;xjWXO`Ic5oWm^$_aaM$Bl2}>r
zN?|n)Kw&csd1rU~_=LS{IadHYW8*TAPx{`~RLtfE3h{d>y9fztlloOh=!E-lIv81l
zOrFje(B^2~N@NG%Gyyy<8_Ln8)l|&0#22Lcgh>c{8#a}MD8n%wue|7(nF-F~{n7sG
zH~$dMmipG&(qZ)B;N(qab8a=VkD3{ZkS*2GN-ZEdYh>b#BI_{uNZ0EcO<^c~t(hIS
z>yXnodm`YSX6QQu*cZ^jXWXTiE)nCifbTufWzaQ~#c>k3krR?#9g{0IONeNrsYG)<
z54j#B0BTuQGFa1?18r2@<{j#4RS~_GZmT>R^=%58ZZ&Wban*2{YzVvEqsw45bA+Uh
ztl3<dbD&{&%d++$GCs`S<hHG(UXkK=hX;p;?^XN&yx;PB7zL;FoTqI}3oN+LG!ds$
z9fsbZuvvJ>swc^&sxlvbY!q+&&ETljMoXRXs?mlpi|c!{sGsK4e!kXL#pV99Y|~^_
zW4O<PzBBIExet{T27f1LDXWv1s6t_3RPpmL@F@^n8c(%0(imHWr~j$QNW7X32_yvW
z)yP97Q<gt_Fmz<h8eSt_4X^PQe{_|RdFZv8mn>#SK`k_895kd}1nT(@EE?48FdjHx
zuD=GL7sQ811}CbKB?*ecS0glya0HB)qS}P6;?H^Tzz*ZyF@#jDMJX#qWPfr&_NhQ3
zmSI?3%)!Kd4l)u(fRP(vMc7u52S+y0`guZueekxHY>s6M8pH~?;TTVDK!h)cNlD46
z$P|jb{hbfLh~tC({r952l9s_$&v~rz{bL?<rjU>Hc)siQqAiLFWnd$#S6VX0agw+`
zoh3xZKvw#gyp+NpdtR5JBf}w+?e3{c3YP5|1t*mKsN97c-h00Vt=(r^S*6C5)|&S?
zvZj9DAG&O&Ns3nDvwZi8W0q^^C&8Ir7OsY73_bkU>l)kpZq&$j`ZI%(+AsJpx3Dh0
z#>Ug+Jfw7!RL(N1SZkwgse6|R?t7Aq9rGyFs#pyv0)fMF6ur?2Hzk%)H`PQ;WO^~x
z7v6|)o*CG*-E+xA5oApurd75x0m4MhZwEBKdwCyF$)DD@haS9X<XsdU`1b1<4xS}#
z_8Aym4h@Z*0>&~sQvt(yV8*2dM#2n-p6`s)!NwkVyX9Wv7&Q0rw`q4L#cT6+`ycI-
zqc{7<6re7>YML*&C2H9#QBA62WN)nUlgN)`mLP+Qpil7w@LYKh5IhwX>k4WHvzF8$
z*x=8v%ouL!UI$w(ilm2u^sx6#9LpmYU5gxlj8R+hnuXBDScZ9S$I>e$QRvNH3i9P{
z#nNw+8?3?`v3YL8vb%3D){1mB^>cg`g|WO9bDb#J@3?_VYP||~iX=Gc`NmC}*djO2
z+hp4cRs~Giz3O2zXE2STv0z>6Fi4GQBfRQGhVC|IAiT0lb52^_NE7RHfu<^8mF=_m
z#6Ie}q8zx%ZZKd>BTA9r7)rBxLOB4gk{xV}Y(DV0Rsqdu<?*@GF!lb?Qp#o150m)e
z1Eb>{Scm-*nf@EapH4^!F1|d3F`WYv6ld@`CM;}*gh72n%*AWDkXC1Y0fNh5{mI-h
z5f&!IDmpImA(b3A%hJ%J8&LS{0LF$l>G92G;W+2pRaPG9U105sxgFkMhwo3`yc5Bw
z6n*BxcVu&Bx!~sxF$I=SwhnSkyW6|J;*hQZy3zmuLsGc;1JUmb-&58|oO~2u2r~&3
zz#$dY4C4r<?M(vI)v_5A#RtYD6K<~vUiT)QSr4416^<GVa~r#F_S{O)-`MajBJ)2x
z^6~D-F7W*$Wh>jB*553G&gwlwa;mUb1j)k>C*}6>G`y5;-F2IPUGcCS=}TZ{ML$1C
zaTU3<&Q!cR;lr`zQa&F8%tv3H>V5xoYFk=f>7t7x)srgay@>*PzaQQeOI^&?xa>27
zVJ$jrbPDrVnN5(J?FAVHOgv@#RMWhNK9B<L^~N^H+axI{_Snc5G4D9Ysmyh;g5EZw
zl0xr{1APcsK8AuemnEOJb27oh?G!d2CoFsQA#fr}E)}vnIi={NbQ>z3tkSI;wnh|D
z!+J`1)DZ?iW8?Nw=+?O2thb)&EpvZ257wSVF}~3p%3%$_r9C8DeAdnxFEIjPJH8dl
zNsX*pKqN|Ee^{g$txc?f(w2>2^D<~Ajc|TprZ-ZBkI%#4lB4@anajG2TY-8jUGb_}
zkR860=pxO^ULPLrY#(WV-O3CVY21}=c>703c<|yVf8e@5Ea8_Q&@oTeoNpNBh-MoG
zkAVhb8OCh=Lo0JlV5Sk@3(#PsJ2Ui(#i8F>p!E867F~-BDtwJDk=-sbNbZIAFjs#T
zbHKD-Q|A{C+_A1|Nfd5qR6%!5NEj!&y!1BabPZ+Xf_RPjN7$xY&Q2v)Q5Myd{44NX
z-E6ar8->;hW-p8F+lS7zILGKm?8ER`w~i-Jvx#5qiL|UW#2omgtE};RKeAbMFIg@!
zMHwOINGZmZUI%rNT0?L4I8a_(trxiL!37N8n>}`Bnv58dBRA~hVTFAIL5&Rit_5*S
zoH(28(<I4eg+qL@L!B}hL+cZ1zZg$mpB_ED^depm!cuZb>Uk0>obfX0+@6DZ4u1;#
zkk5W>4MJyu`1iks@dz08+??^ct&5s58orZ>jk&*YG6amiR@=bf=M-N6%TRhBc70yV
z9!=B7TT*P7BW9+8Vy(df8bLFaf7_$-jT!GITwFT*i?5*4t}j@n$&N3#HkYQ7FzI!^
z5s>WdJTycwiHX=g{^z^h2SNuc<ETXQ9F98@^_XV0DW6*VGdVtGtR@uV@DyfkE-%*J
zG=c)K)FHVbe#6a(_TD`>yM30nJMyrBzcA(iP)vuZb>~{eB~mFV-}L1TZ+tpYDvAk(
zMTLWk_ByB2jV9p;2OA}crDY?kYtPR+t;p&Zuf~D8qim%*lMT52K3dno(3|zTJUCEU
z)xy8rad$-(OcHc*pcFdBWNm65!wJ$JlT~EYKY3@8`0%+GPIrPVx$6g$vvZy&Dac^%
z$;9I+b8Je0Uy=kZnYB0eVC{Gq#VCwh>D`C7?ZemY-}e7`+&(#MpX>vl)?7195EO>D
zPquds_S<M|faPs^x00K|mV2#g8A`4RgGos!y`k|w-dfso-LA3(OH<96w$4}diHXox
z4Uu1>JE7TStg@4(GVb-<lyY)oe5=@YTt&u{M%CYnISPyxOL4UAW58-;Ca;Q>8U$`E
zNk*v!44<+x^Ad_$E+h+AH$8jHGNy~6c$_@|?8FNXf>8jh;LUBJ`89cq+YMeH@;uB}
z!P*r2mV+ec^4k!^SZv=)gG>b!WLXUTHMPrDt3i`&NJ=opCDQ6-0<e*{jAq1{$S5sN
z>d2xrkV#Im3T%CBqAj%7W!k~5lHUxzEz^o}p384Zl_+jaT3c9~NtMa6#oEl#C%S1-
z>Ljx&E)hEe+I_35>A`5Nna;3`dw`dO|ER^gpn$k?BPG!YvbNlm<uTPjj;(VdRHIU|
zq?|r;FSW+h=Kc9wuP2S$K&bk7^X~Ow0!EfhiGfg2xrt$jMO>J0dCi43W)<Z`wqtHf
zimo}pkTWT5Fg?smL`y@dQjt`T@~S7*n0lVqUJXRQsw!l(7-MfnS<TP$Q{`5TZF-;U
zFx8slu~xyq*F~s*S8E`15R5DlGRo=f`~ba@9&M>)fA_g!2C4i`)(zI{uKHJM<MGx_
z4*7f8Xj$0VEN~tNYUB=pf*2VaX%M_$j0z^x!t<0ssbDgGROry4zkj6C%yAwGYB5rw
z3DLvgRHy4;@}8jQ-Vv`1;j9m`x(eXpgpUU{n$2V5n)GMQLAkt!0WJupV$_=v{Br?%
z-c56J`+$chfn2cb&NQ_}8RLlW(5ouP$w}InPjhlAaBX_{T}Xq8C;lDtf!Qd8K@`X4
zlz%;i7@pxnwlkLazn(u1gJ{HHe$f0c@O5J&o&RNh^(p@EqkOFKe~raYg8v%l$iW-B
zP|--Uq+NPSrX{D>3tug5Es1{b)sk?|T=>`P4e%F{pjYoiuk&gX<9@!XixK}KGmKZY
zhWJ-!(tp)lr{A@H=wdY|JiDk3-64DpIs+&j4Cr5cR7WMLd`X5B(JL6%u=k3Gwq!dG
zaULwszuC(emkqDcVKYqBizYGd4q|U3WBQm9r;2q?Wh(Xzm1Avq#p}JIa!ZxOz!Vyl
zi5zUh#betFc04M+2e7|AeD~($@Q4hg2f>-Zz%LWL&Q;NcGaB3yfo-c4at-KKkedP#
z14U{#4;ldJSOxxAXN*HSso-h+gw|Da6H7IPP_IBs6;Xj&m8HsA^1X2WYTCk!q6tT$
zA)BLa=#9u-&P6uBy)US!QDc6$Jum8FusZDT@HcJlE(V~vq2^c67vcF2(B%)yc+2*&
zak{*H^vmDj_u{Q+WB`|fI<{nod#d1I;xPP{B>bS!O17pIlrpU(@hXn=F_iJS0Bt9D
zZ+>rBmB3GA0H{H5=$&C?FO_BrQ}vw2Ij3N(r(_hkNeLF`tR}WUocv0uxbD(GlUfjH
z3UC>O2@f9Uv2Z3p8hzN`FzdmsXiq6YU!0n1&syQ!9Sj1|<Ovj1%)^xm%mFZD6Mk?W
z7BneSsq&oB#qBNLM+>tzhj6>6db2k|YXB9S@Pq3xbAt)Lox3mP<=o&pPRXOi`s$*!
z%%ko~J<_r^5a58uWLv|g4&-_4>LI}5Y3Tb5>rXvHu>IT>pe9PL)^x&XtA*XCidunz
z7O0evj)tTI1SBlBy3d_@lE(GgA3IlE+`8*=G=;l*7Jw8@tpGEVE7W(}Z}$^}Q%bw{
z?#%((u~O<nneGa@_0IfsjF@g5oyJ#|!5Hu?kGX_iE+ZNCnzPcgjkT{@r!J%E%rq8z
zC9GWRv7AwCitKc|?r1Eck<&GsP7)N!D0n;zVpR}*jVwfn*6{@QkB$oa?s67qm=dP_
z#x}{VpUhosu|m>$hf@O@UgNJ*af6}8O8|z;PaPqL24Yh{>;^5?eGz9UpKGY-dP(-z
zvyIrOwq)^oGKasc2R6s4u<c?;?%u5FLrG$qnhfB9g`tyE*Mce>{#MD`p4<d(Ph<9Z
zhX;Pp(Erki&Zrz|flKx=3vq|@+H0iQl1y)nQ&E`)V5SLD{_rRTfR?<$mOqbk=gIg~
zyZ}5Zv=G&IJ)54&rCUirWwUPKOm>vk86(0DBZ0y<8eZZlDNj$z#W!-pfe{l0;U+3r
zwSuf2vQDBFXXuQx#f)@EJX7YE#*3Aq=X*nEu!4VQQl}aVY$glCz5(ZH^f#?_Oaz9;
zt+Wp7bxw()Ifj{e0?BJOHT)#qbtchhiIHp7<(QJ(WSK-Vd$vrbW#<~VTWW2AVM#6A
zULfRKIFFWvmd`LY5>DQO5U=NNTM);ey^-*S!wEaS@F1gQa(f_khEKs$*!WVV{1{St
zPnNc+yg@J`XtFI|q(Bw+I^?7hO@_wvp5r1f_Qg!i;sv$wIg*K})(dL%#dtsNj%t``
z669YK@|4u5h6iR1-kI4Iqw5Hs)uhvo@v1wRz!nUx@0{+S?+wiHO?>YvLYMck@p$C*
zGDT&tfKR?z7`Bw_Q+Z!^5288~*rpd=lp2X_s_%5Y0U$#Pj<Af#5$C|scnqx+ObPln
z*C-kQx&~&Rp%Cb~hoJ*fDOh=HwY#H<kz@ov9WSsxcY=O9bT311?Aq&5{#ENMK)M>{
zf2xhWu{Ix#M4(^MU#eSM<3T2ICoez|(&7gy*6<<$u!HAT>v|*D4B5<$SP~WhJx*&B
zO0Xtfrb?8I(mTLb42~dcnJ!S9T4q7jTcC>hFZuME(t<2h*ii4h#wSlfGtRVrWPzR+
z<}8B@^<}SJuq^W31W?Rg096~t3+s79DqDpqNeK+u;2>l0SzO$v2>#NkCBt}p30O6d
zulo5E)77FqVHOXe5b&21H)oXip$js7jMdMgdXYM@#^JS0)XK~f4^<D$M@cy`hmtcu
z(t*NvL5gd$j})+c_wsvymp07Y=}=+vGN4gc?GyuBySUKrDvh=+K93hTh3dtHZ4S&U
zO6b7IhF(NW#j?!Mjyx$efIhNkAhJO#>Ez0G&VpD62WQiDYv^t(yO30vPW+)J-T$Da
z8iQRfx$XtPk(Df`a<u>Z(VLTfE61|yjK<g`X$Vkqk{xr{lY8A~Q#OOaMIOm{1C>K>
zQ6um3GTy8s*GN#ISK$yhi&j6%xKI(4Xb<5DgVhsPm9#8K@y%tYHMs<}cx_UGk{pa;
zVbOyQHf!G*MCnLzNe37~0h+<c2^D?Xe|JO7We<EF%d`<Jbx3JbWQ>a$k>9-6zepVR
zjFrM&tHl+`XL%JODcv87Hx?1bphr}yk|Rb`vUMcD?*!o4g_)wUKk^{;(abN{-2oPQ
zYlYw_1W8%2%m^AQno_75tbwcyx{#8RY7}@J8k&4cFFiNxF`;7-%JV_WK&evMIxSGD
z7hj33(TaHMot;zIF9+y(09AUfLxHC*0<VXe{U{^^Id@`Si<NJ|QYFv+1H`8LNc~Ko
zY5AX<>#bD&=k?W%#*_WWV|=XkAF%ittB+Xq7%`bi!edA+4P7LfbbWjGK>Yse;r3h3
ziUKcXSu=b9?YdC_l9D`ryPPT+!{1}0QMOf}FLZASMdBM!Gf<$aD@Ut>eoSpj{7hGn
zy~M&W)|m5sr7R{(-Qtah!TG4aQO*1N5ggj@w~voa?e0G6DTo-HyL|r&L<KJi$oo7v
zOS>u9h8g(c1+0@^$}+sd#gJu<p&erA3=R-8W)6=X?9{z%M47=#L$O&Jim8JSSZf#E
zYLR=oE!9Z#J{oD|-hSk*WfprwcNmZ+S3!(ImT530Z)sH2O-F3;)2!Gy+vq7!g&HYJ
zisx>eZ2}IgGW%trwc1);bys`q^=`AX-dk^Nb~ZY_X47rF>^D30&Ss<2ZLN0tb*H=5
z-`relZmh1Zw$|#Kt!}@w>aLfX+G?5Aoj$cVT$$&OOwSGAr`5XyN(*cm)&tC5pO!WR
z;OIlVeh)FS73J=YG-c(3j_6<cNVJcayLi!o{T}b1d^p}eLRSS0_!*`yu%N^*vIO6+
zGIcW+L|{G!ytbDaA7RGG(j_(^=7knMkH(=Uo_}NzoS7gvP4-^y4f0))7K4Y$@ua)(
zgSZ!oyXnGNJSFt(X*7d~h%=bJ{r+-q+wZ<Wtj+(vp=^c>yf#=5Hs7GTZ%K&p4m`q)
zao5To%z6=yH!kw>J0JDm9lqZ`db>3D08*(8>}&bLy2)o5A9RyGo_;V-C*m~ZZllrR
z1vnal%EKue3DY)GXeBmW{2v(H){^)i7~j^CR!@!_GY6-hV#%iH*r)o%8Ev&hSD$L`
z7;vy?^7Fy($=F{|a7GAOS20!uO@L7YLWO|yIj@lK7VOGVq?ogxM-gH!F=^t3yk>s!
zf1p8tb((9F)wqiG^8JUMgEz;&8m2|J=mS-H0=Tf<(CfGbQ<%kApkTPlHo$n0#N5@5
zX-#6Bj1lMAC}VDRHyDhZF{T!NEEv2`fPi)fIZzlS!-P_wmgWOQ&VHA8EMw*B`(5Hg
z!Jd~h4PAJkN{hep&i<>p=`*f+9}OIa3TX2p0|OO!_-WOcRyaOgVP|T_ltUF~>fr~`
zq<bz)PbHdiQYKl5S+OjrIF2wmC-qniHerJ%_W9sEA1M;y2Sg#VfCV~%TBfY7H`|Xf
z78!n=E{3=e**HCq77YOK4v_~t8mpwd8YW>#L#*&n6Ahly;M3cWgXnzH?*o=qsX^<_
zkF>nu=;+nB<tp<Kxwk(iLd*uXTW;NGGspY{Eot%608JvGPuWMBILn@CpO?jSMB4%^
zMPJi1SQ$i3Z9K1G_~ZjjL0JQ}^HkpQj!Q>3D(T7|Ah^Okcc4LVj;-*9{6PK4VbimJ
zP27pAD9Vp9)%tN{(AkNP&<#TG3tF2<Y>Xp+O{F$3*cSCgkBxb?!e*A;3}}H+xK|#j
zSdsDt;h<--5_@lscejuB(krQ0R>kOvYJO_pgkOmXd)zINxrgiVeYQ*By@(3msnart
zh+5y0r^utR6<dv*SsIK596tFcs&PVZWg=*1+T&BHS)x5Ukkad@D$RE^&AmK|@p-gm
zdS7mxM&%dE<fXE#hn1Py0&XgQtx`>PoG<sVT=+s;vST$I$(nxlFvE+=PkIr2c6-J;
zVRllo9GYjPO0#cwTHCbcx$97v{`vN8rttJR6sR54SlGl@v&t>aMweVKxt|_ky-Z|(
zwDro}Zr}QXjeuzgD1>ca3_MsQN8eRkCUnORg}HV7-j4xtWS&oXVF!b|oM&@OPxr8@
zYTEa-3-22R%!%W#FI)d|zKFkmK^0OSuc9VZfF0JZwROBh(^C-d0|`^|%0!tSaja@X
zydXJ|l@D3%wq3!+f=-&%S8u;~Bj7DM0|)+BLqo?CZEVme56!(I;|0uta7M=BSyyZO
z5NadcYBl7fGQ;a`F!Awn0(Ec4Nyf9#!TbY`bQ-fTuW#P{GMkDuo`E#Kz!V5-GMDE8
z&Sl_G6l=PxEIln06hU0X0i<qGkGJ>sV21d{5gpMjH^m%%E_GA;KP&}L>0}$pkDfm+
zrz;o^3)P9|xV%MC?rc+5AxED)RnZ$OTH}tVDqD-!Qeq>pYUNi>f|P0Qw6a|4-(D~N
z8fiXzTrtkpomyy=QnSSrokjQ+RfvHt>;3lT;6RM8N0`C{T@~io1*DqMp_hPd8BaN7
z?%SV`MJW5flV4i_SUW)nL~VB%gxCM>1zp{zmiim^3U7m;`e}>~xdB#rvl+dh5hAs1
zD7lo%jV+rcl2N{wGYX7;HW~Dpw93|2rcdjE=VP77Hn}E9IgIk-DEC5n=OWc&K(nC7
z!bxynF(T(d3r%G-h(%d|VM8nT4-BPplR%hxU%lObdwBFuv3Iz8a(I+iG`8DIk^xa3
z97+-`?~c!0-wnyN3Fi<_(BxEl@v?Or-di6b>n7XcB$&R;;>ZjEnKLE1$sG(Tf!m0E
zfzd3G&KzF86?2Ei*WH>OF{#Z4xJabZQ@c`QL`@R};9@cK*Vwz5Mwf}LlIZb2OYs>a
zUQi7D8XG0QpkM#)d1r1ko@wplYu?=TR~!@#VJV9NsbXq?(@W9}N;GJh;?k0RJND2!
zv@}R1Bx?jozP{5tQGZ458C^I%5L|2J;QFF8Tx;dvY67%uaRrPL6#$^AQt|fQ#%T5-
zyG-%MO57M|*TWt}Z(#h5*Fof`?*Jb$91WCH12WrZK$tm)i88WFPD*OWlSwE#WPaDf
z_Pi)>KNkc^OpAxIbI*;hS9Z5gjHnA_?ZI<ldtkayQGB@?I}T2(#JwQ_`(vW2Yh^*O
z=mhW&Qv)P0ggkKr>e?o*Qq{(pc8R3{QqHCc`Fg~s$|V7uRE;UeMsqtka<>^Is#5zu
zs?%%JBD~D5QBB&mjfP@;BvlmGophKb3Z>?XHltIgi$?3A*VSgs`~eK(4l~wTEjMW;
z(O4#}Dp+jfu*-$D&CQqE#@iCi*@%Jbe2x^F{>T<dlxRAaUq|s&UBerG5c%ZRB;$_y
z(otW!Q(EEr`UX?k@A@Gy`e>{w^WeE-v}1K>TEs8=l6}lT<lyiZ8MFgAkR&vjj8(?^
zBg}sTROiBG4T23E?Srh4GkAv_mA;6dQH(%CUWCN|1f4%%gj<bfYjsM!7ZjjNU6C14
zX6zMACCm$Xcb8r|Ra&>yhy|HnSZcg2vEC%m_~@yqxe!UXoT}h<2?~oF&EJme;ov!z
z24>cg<FaIz%~V9ULHBCR_2LC8QITmo*Hgw~C93h7aW!~sO+_vdLT3x{1)N&mzzJo<
zJj+g+Z8_$7^N>qODk6%gv04r&7z~dSPO*%1;RORnZZ_C^7`M!)EA!a^h1w1@I)VB=
z=A<EdE^w1Q4jgpELL<N#kt#Fvk|;)@1?6p$9iX~}$gDtBm+d$@*^UNWe=-;hqqE0{
zud;2M1IC$I6v3HjyAEwi^2m}tw2o|*%t{N(Q091uhdCIK?YRyGj!IK78dM7PSidmw
z<S=x54M`Kl^TuMyb<VXuAoZ`Exa|L9fA_H{i$>$=44ierQ4%Uz-_j6mE@m%?8f9;Y
zlmUHws^hSp&9gpoVQdUU6$fPNjl@B-m~oktv#?aq4BhnItaU!<6JTWUA&yf^aq!f>
zRu~ZU#lgf$qP5OSNcaD~ePBjf#gY85`~#H!0g$Wy6}Hr1;ylELk`d_~%tGpdYy%vu
ziq1+#y1;M)Zw}{_B%!l{vVb<-*Q@*`C??=P+mhc|ii##vds_-T9h8WVQZ%99t7wHV
z9F6U9{tU=nhJk;U1X+D36q=Xw#@Wn@dpN%`b&6yPE2Py?j-~>XBUj$)ilKAm4JSk4
z43WnzC;sWty}AR81BIz!0RzNZ87z<UqyEA9QU4G>iAG(eJpChWLu+uq0IV&j0LMbw
zAO0>l4QRS%0p9OuA)}k(BbyZT`^)l*BJm=Qon^FJ@`6io)ux_!MNV_txto8>88>R?
z^wMwR5IRd!rid3Veqd4WFUwfR>J0}BM5P4B0Oh!BWImlg^T_Q^Lbt|lwb6u(pHXRG
z==kjOs-?<sW)>NFS#Ot{ozj{#yv}rN!Jo{Af}Y>&m)mr!H}N?T4jNNslj#{=jsVAz
zxVpN^x`C=#`b!^t4#<$`r_fq}D4v$}JB|pxRI%E=?zsaOt-*O^<GUv5z=QEsF$FWc
zEV!!<#%)q7lN%7Z0A@FpX`8L8oTf6RvOY_N_~+{^j`nG5kt4+*dBb2aHriG^JLq5%
zWw{t_YV=z9o@XW(s+i<hDD}>m32Ed)x9hUjbTq&)HsKKP>UtWasPSoFN`XjXl7dhH
z4!!yDkU2daI{<<d&xB*+jT|I}<KYMsB31a|3Pwygea3;UN21neEBzm_b&RMHaS>6~
z+IVJ!Uie7)1(Mj6{C5TVs2H_GMFupih>B{qa;khU7F09=uj}F}>27+`T~7Q=Z}sAM
z(F}#tMls@l;M<b;8D8t96Pl?A!v8Gk4l9gkveXvvDo&3*;FaM5j($0236+DU)eXt+
zJr?GARE6ThyZDt}KJPKBF_=h`uRwOo#519b78z>>z*A#azM6uEW^E>ezmnFq<V<b!
zmNn!SIDel2GL_I75UHrug<vw-sKOrZ3S5hm2c?J0p&fQV4x8Tw#~z-une2kh*wpMW
zG|zG*9$V6=kTSOjC$TrO$!tW65}Kn8Q(j%sy9#obNOUgG183;zx)Pa=jRPBIN3;`k
zw)kFD4TvZhW&h|FjSR`2qHWnx!JFJMnI&6PE^>N3Vjdg7U$rd0U&b_Mw*O)}N<1WR
zPWiM0q%QFSrJk7F;}ea)mBpbE!$d;$z#dwmtK!n2<{clUv&DyT6+6Gi>7jBlGdX7o
zIg@5xDI%0XBO7XHRdC|2Vf7)C2R`iD#2%q^ftxtLSrr=ASsC7<PKfeup4TIdL0JKP
z?`zC+1>!$GH_c^ZFMOP>9-KZNj$Wc+w``5wAhDNe3tYtV8A~vQ^Ya5qSM4ldUNu>X
zLiXJk)0iUkmDEHkI%k;~HnW(9Ad!-P<<ZUFXqu~Z2)$6S(+i3in)Zz*V+byc8O-u6
zBIJNh<EHb-F>>x&i?jDc+i`k7mTpYPfDu_|W+A_vn1iw>HjBk5RubXv_emuFI#7z)
z13E(sx!fFzHN2K(XCHlB_2I^EXAvK3gr>`qH2RYFu%3)gm4CJezPhGl!aw`)lNP3q
zpT?L2Vx62OO_rG<GWi_-jQwHko>uc9p*1E}8e(R&zWH%QkMXBPLqw*S()=)8PTZoO
zPL$~<3Pm2ws8yei6{&$T*Xc&fazd?F^3^iwP@WdmOgD*#`>ktczJZvzf2NNm{;%hc
z-7}7!{^Py$fl+=pHr8_D|I#NN|95S@`Cnq~UV5MM`45l(J7xXDUgz#%po`-_H`g%O
zb1MILeRcgQ{_|seWW;A!X9^8J^`Zj`)?B|Epiy`Y@da3wXBbd@bS;kdc9;)JT&Pr0
zGMtfTm%*nPOiElDyD_<xdD)a+N2O>2Cd6o8-I~y$Si!NY*K{zdSnU;g?BPA^04>Nl
zL0mVw=uL(rfqWnUu2QcoS1`X88PUUDf<M_Y2fjGp%BS*-#)-j3lV1+}G-#CgrOxA}
zulT(KKTZ5iU+9VaN;8I^7XGF$^hAEe@4a3R{#~W-u8Sa9iwS;ZIT=g)i#Hm%z3h-w
z=dv5FflHnIYRDojS*;_BH)JoBb*;;XES(H4na(_8<aYSJT1O&S8GZ#jCH}Xex1zc*
z=AiW#SC<29H;i^v^;JvBW>PZlO?_#pFRR83wA!syZKDOF6{98jhmJEANW}n(zx+x(
z<L}5bN|1fw-sP_x?9w(sg6s)m8=FGk0vf_QaUuDJRvC`8we^jcn_RJD-3DJ0a7`WP
zvr;$GNT`WsPDU}Eo{NTJ%5Zno9=TzJi7x%FOL;j?4VmJY+oTTMo|J-R8bZGo>${N3
zB0V-`33dU}yi_sBM#;~uyqZ2n%{vG#s)uFr?1iDI;CVipYvN#66gfxr`0dvL3V(eF
zXguhI$X^ae4SUUXhVg-^Prz=eR?oLp!#I(l<M*B~Ldp8drY#<1D6Z&wjk{f<@C#0-
zYm~F5YqeFz;EUBi%(~CA-=NxA7)(Yg8-=VtyymBMLj!<!8W^@4Wd18OqvkTd936gm
zAJ?F(Q?Yya;oXU7isO@`{q48Ms@b3Q8_%nrJ5VoTd(52QRn>JJ^D^Q8b)zZtJ5LRL
z#wP1VlQ>)H2>sDSR=ryz4Uq4Ry)SMJ`K8*(xhA!PA7oHIbd9Sftn0g%)B1{Y0my>x
zzbI)N|D`OTrlYW^#RC;M(1HY2w&`5E(PPhN0adWBjQ_y1Sr$X*x<e@d&)_grH+}dG
zeO!`jHSAnr7?O+y0f*)YLyb;+c5y(9Y)+e|*!K9E&>JsHKV-~2=3=N)bbO&;GYe>&
zeCGC6=zNOP5Z~NB!#tlxf~qz&*v1Ci-dNXX!Ft3LaWcAa!laobt#Nq4KiUDPOA89#
za@{_{@2)cz)wqFb+}~+j7#sXpNIYfYv>Z}-Du+y#&!T~)dwjJ>vy^RCp&JJITl8&5
z(5Z7kOnjsrD2hLmsi}ac=}g8*x9Pzj0f<qCfP+|wXZ@+D>EX@l&1Mt(*kiBPFks^v
zv{x3-y|M1Qgk91ws0Z{$<TDB+bFySzq^0yCYNP&4>e*>t!3YXZ9a#)u*+zq>kNLiJ
z_kK4<v`#?hWvo&s%;HS2+=N1pTy)Am<&s@(p3#YADx*Dg7cWcK!Mi!wS2*AF@l-Ym
zIeyZK$X`2SXTbAQGUw8*_>`$fbxC3#V@k<d15QfKzMXc$xED;ur>CZmc<!0VsVUP8
z3a-7J_@xtR==hg(VoLMdEwAWn@5+d=CnK{cIIi3osn^%nS=kVVlMzO7h{W#E?)s`w
zxv81#V5^vsSGKQxE$Hf$tM<gla#$_G7pKqqalkiGg{n0b?**}-<M~c_4XwJL`Q=ME
zY<kZ|6Bu<3xMKGbj$5u*;f(Yk4*X3d)8jDSGU+y1v|`~ow$9w!q|_Ecb6Xy<d1qaA
zW283)tY~aDlHCf%HmH}`2i84M3jgD2Y3Q#Zym=vWo8^>WAAC6eb^G9emnD*!u+4}+
z$QrZTGp$);2#4DMju+fWWRet}Bh<&Z+6^?>2VmM66BPI`$20a(gX7(~rp7aD$tW02
zC?rwpEsxHAEA=tL=G!urx97LvG^cnGz#wW(kQ=OHgf2lW5b%tWjL_)OeWnmetT>X}
zKRU;jS!=E<)3eYnNiQl7_`>zV{xzG%%R208wJbW<ydOEJj53|4+^a%GMD!x*<Z<qu
zou`3`?rl)f7n_@#YECkDYdZqz$ZZdt2v7=>SZYJEZuPh$%%e#xL$VHt4p-vpDtjX@
zXGHh3k!Ae3Y_A2o3XrG#-oMXv#YmpEMYW-F9@u54w80r<(yIXN<$6H=Lrp<!<3n;J
zZiF4yigzZCB32mFrS0jdK^dgj>A*p9hJ_jBh@&TJK!K3R)8FZ>2<GX$A!b5%w8)4H
zB#;w<fwCA58yD0grZqt(WX@d*qsh@IM1Ys^0hWRTusPIX)Dg)VcJOeAK`rB7pA`Xv
zp^-EMb%vaX0&v|zwJd~)sUXv&q+~iFEaifg8DXs(#KX|&yf5S$<zj(+j}%OYI-4ev
zw1c?^<e#u!Y3oRmFZfw1%k?atdIN`I1;#B+^&K~QqOeY34@3<$5TkJnUCXdWk5LsT
zcAi!Y*YH^@o9^Pb_LbAHk+)jnmlPGzl}0^>u*juzdlG~|Q+^VyG9*RKr00=QUV;Xd
zX_L4!`uRZ|kr0JUnlL3$NhAaky911Prln6Nu85@bkH`hp#mJLU?j>)2I6-Tt-^I{H
zv*buTe;;}mu=(11UO2v9B%egJ>&1cRPp(+Qd<_!ru#NX;F{3sPFhE8qS+NPdt3|+Z
zp@>%1YmhfNwsp&Qi+L6-GE?-eg@@{%djqtq=Wv>65@YgDsQ__E+KHHVgUdEC{uJtD
z65?&7_7KW{al=47AFFUt?6ihXsyx8OWv!Pe&<=cny%Ty7N+j|)h#OHs<;cV>qtZd7
zOpQbj?vYcJjz%P~ZAGPfGu0YnNE21VRwV<oOyLCy9Y-|l^$F@>;0#;loHTs=!r9{v
zM;^KLV**)+m?U7dCPX{=1c>xgM8)3pNRLD(T5@Kfwh9<QS#4P!SVS5bNkbP8I>Kl=
zr4)0i$5JikUYZ8;tCa;($r>DvET#=PKCmcEXh(AF>iB~LarHBW^D{NWxe?>jT2;c#
z)%vEHk+C}j0!DfpIwrH{%x6AlJ_B{D#)Z{+^ErLqAU&p9?ln|VTN=O#%!b$o84B0m
zM&{=1PpXUJL&TnnDLEzdO-E8D22Mq_HEd&Kf($k@<~vP@*|&fw*d1|wB4Jxwu>U)O
z>EeqYlHDu6;cClNTN3?gs9Sl>=NubAXzB2z>;z--7Qb|vgdk7v@-9HGNJbHsl#}Ah
zdS_=YqV4Fq7Wg$PPkHLoq8I9MT{n(;8M^%eJ6r>g_U7H|Lo+0BJQPi=yF5otNFx&{
zlD2H*;6W6F1IMArXwMlt=E#i(SUoH0v5hhsrHj`kSsNq>WQHjRWB_OjRkGZATA!5}
znn`f&xRcQ1xyD-1AkP8DYd$U<^@1HMj4~t|h9vMI0Z5j+o+br5iWH>!$RJhbY$YEm
zF(L1Vo_KDCY?bG^NA^HU*jqIEu<&><^A)Ov@}v0ozim~rhw#s@64Vecc<SP>e-%Zw
zt>^O3=_P|!iW-4=e#V=GE>^9Z%bTaWosM7lN$m%KA~LsI*7;ZRThR4w%xwRpSWKmA
z%T&J2JYl{%9?YdfK@|89pNiI!RUvFkLsz;KoRO>?GV{RH9t*A*Eh+ajpbJ<|vf|ae
z<092ndQ^BG`jp~#f?>yjM;Qkr>DAm!2x*id4S#{PQ?(Gsv|UJ{e=O_Sf$4oN1`_oy
zTS7*;uXATgT<B#6Gj#{eH5_6EY-dT1*mQ{p$)#fI&~GAzq2~FVwEPo*8bMfmV$XuZ
z8Ld$oU6Rh5`ea~WX<#qMx1(0U<T>trbOlozVNq|6BFqk4s3A7%{|jM)wW%474<9$Q
zVgP661?3A9-x*+o!YU3FoZIfzDAY*j5*lz=PQ#>wpS042D>v8bnJZYZiphYg85~Pg
z{I}w73%UsWjGv&*?4QL8VT%3tD7yB$P09ik^!sy~f}`A0VE^50);Ci2-_1sA?aBW8
zF+LPICt~$Q1cVqvy!U#ffjV<3Iu%K|c$f@b2jl7YCj$(^MdAWdIt->n$ntCfnK~BI
z*H`K*^<|VDK)}Jfv;m#ZP6tF3PRr&~nN`vvTyqqD6&V=`CN#!EgPF?v{qaBF?J5uZ
z(ZK6EQG9KOW0VhxK1&Oqb0>nvF!dBi?WQ2DJvlT~zf;U0AAJR(OJ(Uom(CpONamhi
zfmVKZSuHo#U`D1e9k=UDB9|uvg9wA(qzfJO@M^`0l7O(<0NGf^>*A~PV8oSwU<Fc~
zx_pG!ttbaVlkjY)+Tn=xD`};gH0S4S%L+C7H6>m%qsrr%qUogVXb+<^psVQ*-b(Lt
z;sXxF9{}}~nq`?}Tc$>~X}_CR<u?{OdS3lwk%>8<B=uVLk5iFWc~jB$c@T~5<?&6r
zG#;q-()dQp?#5%#Vxr&*5y7j;wL%*NFX(A(44r8)z+hI)Y##*dLbsLeRGw57BP7>?
zICjUAk%1HVoIMf<)tf?+-YxQJ9aS_4!q6LwsxmMLRSBc|B7P+R)ED*A@PbZz&iz%S
zROib&%T2vAo<y=^PGr>{c>d=$zaS2yf`d#6Js-LAUMJQrHt_KO$PMX_%c$p%)W)YI
zX$p3zBu7_99#;0kz5ueUZNXhn(yg`}DR9FaC@84BEWP8a@^I%yFnWn>gMz$C@ad1s
zfbT5<h^8xNiWjFKjyY!-5`=ZOvcViME(lBsehze=wcajLE%PczHBIU)w9bgelkVqb
z(V4KXv}}i5P05Kj2@Sc$O<y|KeC+UesUZw9>iH8UjY!3btjo5Lc3&$agXfp1Pwshr
zPhKTqNg;Q#>x4jJ!o>od7!f&Fv!JMsfL)k=${S}lp&5>upY84Md;p4au)qIai}A_t
zjt{o~zJK^yygL+!@AgwKG2n9Q5e|!}@b8GANMu<H15E8C^f|eda{<d68v+;zA6ps*
zgPww?6HiW>X`#*z&p?h1?^3!diI<T+<J3i#P7?6cX=DDmQ%#q_$a}Q^{@~5-Hq2R(
zsYXJk8jE)&Mq1Bh$;gSEv%)V)P~wvpTAX^{r?VTeL54H%E?j9YOU5Fp#iX;a*aT+U
zi~*qW{UJ$pc7luh?y5XQVshZc!ANkdB}^*xfyr|L8*4M4cxpd6^b$(s$~wB2;%Mf3
z5^s<j`uD;C;sArxm^L(WfKg(qmjHORYiTVbjkOeyI3fqfgtttyITFK&DX6Vl*&7KG
z+!%4WEL$T>k(NZ2GT9mSMWAJD$RaIkhq6#p7HSq1YRN*4qC%^(P(3b`pnW_djakuW
zT-7F)snwjTR%@<Wt25P_edkI{NK6x=fpg(9<Fq=%7L9EaiVPD}Z*$X|WZg7E!i-zI
zHs%|9{Z?-M)j3I2R79gRO08M&#B<RYpQctcX8)AKn1r6<G#oyJ>Clz4(pp+AM0Owb
z?`|PxH<}wLGOsiMLVu&%ake^7xDL)zNn=v>Tgo1+d)*zl8TnVUK+q5`z7n4<=BQ#p
zKgytR9t|(Vu)J*%L)3P5{LJrh5NQNU)nA=be~vQ{PaP7uy`fvg4G`~18U(CBf{3;p
z4PGk^XDK%fDs)G&;9~M;S_kp$Xst>AfW72Yl!^^MxTI1Mmr(;rA$*L8G9YtJ?G|}&
zt2O&v>T*z9Lj0zL%A$cTz)-cbXIaZ~mT4um^Q@H?&u!#9-AOgoRtD|osyo;5Gy9Pc
zcQcDTowsr3sk}N@Ws?lps^0f;b{D=o-iLQS3-uGPS?a{gFSS}+N`hD`^8hELaS2C3
z`H60MXXj&?--5zxVNP)(CsQN<bwDNJ*!q+j@zQ8@n&s*=?E+_Eoz@(6R?RvZ^Z<3>
zAST%)d)Bg%7a3)0ncpo0rfkVp>5{9tCBNbA)GD=|@=L82m&$CXQntWP+v%aV6H5KJ
zw*YlOioY3usyXF;8iMT>qV=b`g)r26yXTIFcWN50#$wMUCaY0Qt;XQRw|Ws8YD=ZL
zVOhQ1>m@#0u_6@nZFkN7lmby2ZK%g7t=A0q6ir*{`%@P-3-2z<5QP-L?H3W~otnLj
z&;Y!Lxup2+A@DVkbGbkk)vA+JN>_t?w+Spec4>ir>H?x^AZbRx%TwabFW%)T{mO`T
z`f@$ISf>Mqh|~z^i{}j5u?kNIl2Ib~e41Zfb#GBx+v;=krKmyO;79h7jh~>+4@eL~
zO$U<dC&MbFi#^B%p_p%b79fgcMX*-YwvaC@>Z-!E$+nb+QUUfQ%c2ntnZVC9YA7Ta
ze}^?!uBrMR8<Goc>%)3$rW!2fJGxIUZ=pzfTqpJ&CNKFQD*n4QY$pZxbv09$S2Gzh
zInzaLgRfmwBe8HtFPpZP_r->Oe+$RsM&|Epm_9vy{%d;tS9;xX{qFhD2|v$g09b7Q
z2VYxjY5TucYvalO?=e16FhLatuY5EaA%p#+vEI*~aqOn<u!kF3+`tzlLP`6BkMJm@
zm*^2D!qaSc3@OgVEeqcrqt9vL^l87Jr8l+<(t4Tu(Ylng;!-jSf*J)`RV@QCO<Nzw
zS0x-N0j8FEoe6cJ#()4|hreX5xq4$!sddE~+ck@tD{5mkpi0(?`lIrtBZKIhrCS2_
zEeA_Ewb@UzZ8xk;n?lXRao!?0OfWAl1s<w=@+(G!H}zrb>uxXzpaoQ-_wXDt=mAD|
zWJg+zb+y8s3G8eOZLC$#m2BhcSevUkqcyv|H-QR(g#M_}t44i!>6Xxxu+%u!O4m9|
z*NR<J@Zv{V(O~2sH6Kj=q|z@+PZeo!TGYGN<$!#(tp1o8OeUogJ&h(HQ_hId^Pw(c
zE!*VR(u@3ru_ZBfL0v4P(-9#aSv)tFyeOLJ7=#glXnlKZ0Ec3K`^~$9H}Cd|rKP{$
z?tD1-tpsj2>n3tjV$@Q5V$Q8JWiOShhAeM-4-Q5XO#C%7_~;6jeIe=en*(Un^*r+k
z=dCyx1*7>ooUa~cHJqp3`J8wW%{k65bB^;1^f&bUGF4a8OOc|@<vSf_fb$?H$xUkg
zQ`lN`mJBC@u~!?PlgIv7XOZMUB06rK_@yU)X)3>z>els1B_zY!a7+cX_f-KsdPU7Q
zp#2DQA_2;txmP1m^L#>&8*~u<^y>M?PrcKn#aj&NOWw`+c;s~5(^LBT>VNghZMu;+
z!lX|avz+b+zxK9!k2_7{@t(Ha!*03yyt^)4@oD4Dw(*>><BdZnytXBa#?Rwx1J-D-
z;jP`yKVKglZl8$ZHOI$WsXy(zd);?ySrMai-5&(bqi>=!<1&N${62P&swW1ne>OhP
z?jP$0c>t9}h&MBQM9EX@X}jF_F*W6s`l|Z`JByL=T*e&gxsiu3H=;aPx>&0}(0*AE
z<3S`aU#Zvkx+!&o4Cga8Gi>4~tE`S&7(}(MH#&F2OeOr}>^FW@xaaV5Py0@Q+?EVe
ze5&m2zux|EaI#g~-al?MU)GL)-EOX}f2vq;dcIAn20#Bs#m|FoR{Y%GhQ&`d*wVZk
z7eDv4c`f58Vo+1@gGwPjD!CsD`?Vh0@>0yzJ!6c*_q|o9Ti7or2ghyLDs9*+?O%4^
zw!hK+LVX)C{3}aud`|KmjPMp2Qzs{V<PK#D^y|5m$^}GIACA><{Mj3gRF21G0kFPk
zth6}0f$DO_9v2Ni*<D9Z^Fp>6eLo~^!O#8D7yE3pPiPVBOP9AIcOg{xxldwc8BY<x
z%EG{w6Xk1P?w9yXvHx&_d4oP_pDFR5RySI$Z2sTXC;N}b_?T(B1V^JMY4he9k5_)6
za_EYiq`(T`#x0<EULs0<hNU>Q4t$Y0dG%B?Kbj3zq_GJ<ZI6RC+JN5xu{2YH^+)hO
z{hiIHGZIxOk0vN=w?eTYxt(loF={9ooBBc}=xiLxgh17}%;k$y*+4eamrBz!in}+H
z@8BT5r&MP%CN+~*KDdx^pec-UM1@eW;+W3llmLY|BgQzK;E*|*Cys6$U_L#%)80OO
zty;loGpgiroZ-mxRlG$G!Xi3@p!=C)BI+w2Q)d&iKK6qU=>0CA5^;E>b4($7TCNV=
zm6a@u?PL1MOH59y>>qhm(rCg9f*Z-mKV^a1H3kq!<u$8(fYtN8=p5b?T(;CI$TUuI
z3a9K6Kzo(ciEUVZHpE9SYO^UVE_^z8rV0`S3(tKygGgl)WMkvFH;e~^k1*uW{jMZg
z^1@P<T$t~xxC+%w#tV6sMIB?2)EW<pX0XEHm;$>$5`v}rKQT}VyK-S9mo5lFBlLK{
z&CGdkxM}#lmhL-A<Ray`bWSlcG)zAv!$N>Dt8Ps0kPOB#&S6{S?2y?}EOQ3oNxr1E
zY31C1iOO2#Hh<dNoHWLv07jC<m9d9ak0xyd=%lBudQ}LMvx_O&9CFqOU`mRIxgH3*
z?7h%&DN!2y{lFL|UZ|;BaqTOj)H;S+_&(5Ty^<AF6uCZ8!8i460~nw<;uBk80Y+hS
zJRe;FnfAy$gV@Xiow=32{6$N`H*0$jMErJ~o&-P|A<6TXGvUT*7;X3g-NByqMP-TF
z!rdhyiU_Y#%g7W_#Fb;2rAnru&>e?(J80qyWp22s(#yPC4UmU{fhn6_)UJ6lv_Dlf
zsVX;}tMAE%5l@iP=mH58Pq3C%!7<e{av5fuA>{-&L8)ylBa)gf-aQzFFs5<*29*bW
zN<$L(irL1+n3fqewYlPb)eBq-g0FGJ+5P2<Ns5pAPhxESV0ONC_MP{^PgWXNx6k|V
zX#*x*{Fyf3ET>x(^Bxbn?TXlWb7S2%PjA~{`7Hg@-g??w`ZwF&Vtq2jkF6mt;&l>U
zy}NG2VSRCnNnL!BB`=G4AI9Fm8(%BbqcMfUc$4Za=qRXXr;jI(iywvEAJb!tReH(1
zB*r8=RlgFbEX94|m6lf22**({4fw^vl+*EXn-Ay)M)(to>z)$QtmK9UH3!Mb)-zdZ
zO$>Tq7zUr)lMxOAr~c~YoRHLF<oCTRg%>*bGW*{){8|lbC%WCAeiD^yyzR^z{qdxW
z`GC+u_u5os*(Z{B@SrlZ<Ho7SIlm(1k<{CK2>SloyW+;J<h|p%z8ckiNz_`8zbV_C
zWMAW9%Spo`8PXDyP>h@~a&d*fEwNfozCydJA~G^|L6uZ#IMnkMrwPg&zdwABSxV7u
zgu|IfT4vlI(Anv%`y>2wv4})bYGUv#4PEz#x%n2S7gLh55`d~=Osu%dC>SNTyAQ+7
z0M@-g7(N=Z>m81b-Wp=)4m+-uW%}wE-AJ%A>N=bxG#@`dL=p{Awf{a0M$Q?m!1G11
z{r=6|cQ22FbE?Xjb3P-Qisn3s`h=2?gOUl!-2cb>H%I&1CrA%jeVdTQIdPNxH3hA2
zdF%up+ryr?9y0MID{8&Pi2ZQXk-_z-$f&wJz_BL`ojV+jufIuDtS6{A7ywKV=sBop
zhOy9+oX=`naeJFyuA3v8zXTY{A}I4wI(YvAb^d$%2OvklgLn&I06G2x#LKK%J_7eD
zEm?;WbKy;`@xYT*?<pXgGq`lFBg?$$>Paht+amNZv_1NG+cFyFXWdR4t0PHtL^Qy#
z+R82gDF@k*qNRb#{jLIfQv5@Tza9X22|lOVlWab=66c@qxnsOJigT2~iQ-3Ovc|V`
zp}N>gw*>>gNU|%FEjwmaMh6fK95{yIKF1C)eHe=*1SYq)m}=>FS5iF~euwN|M}zA)
zKO2U|N}52#qM3$4pz@8Snu~(&XFPT%eE@DG0~TT{o)4&jfwp8|Lx5CofFTXX2wKeZ
ziGWT|lZHf>*SMZEPaP`DI5?J%96fY;K)MV7W2!xhTs|3(CTfHt$&XDhWl~ql@77Pc
zV>l2-rdpIq*C<vdrkleo@xT;N-2Ig_LdoF#ZVF1=yEmlESy;`9KSB)clIb0#{_an{
zd?6)CdOnn72`wk00Y;LAH3CTh+N7fqkc`_V(9)%xdr6TEQ~7V>sHh%CMfJo_u=Q0~
zRL^co%}L(yIH3(u<BgKF#l?~XEfjF_JW?5_uVesJ=x_WS9`&9tF0HW*;Npu0f2rS|
zS{tzsgKJwge|)T>itvvBRxh?|jxE6PsDNYhR5VV7NtCjBKr)#EI5%XIw6Uw!qL|5^
zLJa5V^0FXk)faE=?a;ble0q|Otwmzpbg36=9?j|VP`Aicp7&o~aZ>E&G^5uCKLdZ+
zKiU6>eg;YfGEieUCTwTHy`e&AO`oT_kwm%>vJ`$A`qs@Y;$bp=6je8PlB(>mN)<B;
zQPTQ&YW%l2iejxfuO)D?{cnA})oP^de;XUCjVJrx$M{&IwBf3k3CzYj@-?{<L|O46
z3=owE#556d%d~e{KD5^0a&#M(1a~uoxan2O#vsPe#|YcE#gujbC2l686iLhT;V_a<
zQjg>;!qU-7{!K{=T5tLSSb!QQeyWXw8Z%13ah?Z0>}RxXRZpC5*Bx0LD2zltw$>V@
ziVvNu+Q2!>^8bp=HDEWc%@224SKa#Ph8mm+-oMj)dR|Wk*><|;Netc6Kz|n~pyopV
zC*a)2+&aIV8R*Ts09{_Xq+n0pTbYwWe+Hv`cPNu99xvSswt+}-=6L?%6V^Qp)+qo0
z$bVMy2UAIS`oKUpag?sbDDHRd_{}fJCx`FjOn)QK8c$2yd`vAAgZS{b+uLbNhU=BH
zW;xh@ihO5%mW7kaZDo|?j@!lf_{a+*M_1(SUUvVP5w`TLN6wPZvaOpy-aUMGVgfmZ
zG&$SVJEQF?I@j}(r#tRW%>FoA2e~z-QUJ$sI-Smak^pY;QE9+}c<o)`Jthb?W0e0@
zG6&zi8p}lY0owH>8l<UfSl5b9Ul6@?>=K<qx3}BJC;LaFKOpXm6ikt;t7SoS^T#mf
zf#l-YsQgL<qYM(Vj%k+*?8%ncfW=&EZfPy`l<aMku;25}T;u`KE170%JkGQD=|&eI
zrNh6y$#5h>yDSf{n@OP?Y~3P)6E^mw``3@-;fSOmtkPH+!xCQR1o|+X(R!kaL&}s?
zj$(Ep-QI0;)^3|Kbjxnhl77~N<a5b~z>hq5>UXcR-oae!XyTJbO4KHTcn82NW8_OT
za@+tz6j?ELMv2fPGSGY)AuQN1uk`!$nIiuqDMbCvot%KD`2V)n>dmzLU*C9&|NbZ+
ztNgE4y?oj&MY#N+=eFxgZr5*IlD9cQ+_eJP0Pg7ma4M_!F%K2LZwOny>g2VanzUgX
zK|@bT+OQ3wkqp7$<KhDL#M;SgeGE<87@GPRnzk`CwJ|icF|Y$QlTfCQk>XeVhVYxh
zZ|SF}No=crBTa6rP{mGd(^Z?<sx3=Z-Nx@m;acp*h7Y3HD>RcgM<2S1cv6*U7q<nB
zRaIZ>s=llyQ;$5yUqmW^$^Ow1n)5-q45Pu!VP@13+6B63YhYwtL)I~#LONNC0S8#t
z$;ilBgU4k*7z~0-6{p1Dx8$6R<hI)Ws%m>FRi`;qotX2c3s~7};oIg+s|?%#2aCZW
zlwDm}XWHVL#+%8i&No2pU@r8N4LsNY|Co?r3MTT9my9m#ouZ+>-hOj%_;+CZUmqUr
z?u(N*Z}$&BoFJoq-{ZsGfDu;^D9-dv+?Z<<-wzlWf{OB#fMU6!GKlYOz?hI;g~L*0
z2Bk=YIM6k(?@^+%5$6GCHF#mpI#nZ6fpT@~qU|rP?}ltn&~pc42js-@C0YxOLT`wX
zRJH8lMi*#u)0S2NDg*^dt7MFmPmaV|GSsqatMZ8ofsddB0&Nv8s4Yzd+#Y5cY-n<7
zL6WX_FkEO!sSH@3$|}IfmZ+<=W@tg|L($2Y%?cDoq^NpHbktk@UFDe6Yr2{l%1jWH
zH!P|xx@B=Wai1U5VxF=LBwwrXP$o^E;R<7;Z;cqj><XBZEiW1eBZ3zzLkPXdtuam!
z=Lal~CMhD+q9-T|jTrc;<F5%O{Y}*FX(|7nrB*6?{@T_lvj*A;TQ7Xud}gOJOQaxL
zLbi+%1~2GxJRO#JHRHmK!op_5O<7jQwAkWb?g~kiXni{Y5MQjBmkyb1ChYV})I`-J
zbou#?)6H-OVoL*=M8+l?t-z-sQ=aR=Gtj@DnQS*_CEHCa*^Y4~=tl-OXUrg3Fx)`N
z-b?Qtc;4iQJp;yaRoOzGV@mGzQhT96GuYie-q-ZU>XqVB9*Slq*TN4(v>GwdY8DVJ
zJK*R%$Ol|KLqwW75oxA~{p?hvaUWE~EL%)OQWU2Q6?s1w70GU=?}Liy9JIl)mLnte
z8L3F!N<>QT?gd3T$f(kHar{pAvmaaz+#aS}LSIliSTlzsY3Q9uzff1NvK)?$Rn(*z
zX1=ZTBcW_(XtoZ*H&6;TG9Hi76rGJKDLg}l<(h@aG>eFgdRFuN8n7Q{A@CpbQk!N>
zZ4xF_N-;S+(*K=!-OqyDA=$VV*XbI=X`(%V!Zk8Z<t4myd^DFf*enzSK+IzUW%w73
zTgR7yoV8|zIzMTc!e2}woDX$+6fW#NoF2CI%s)M5(Ffg0xl@jO-`}|~W${hwOsSQD
z7e8wcVJA62X<(TuxC_uE9598objt*FG62WhjmoKL6dp8mxG*VQ7R~@Q1ZU?=#60Pc
z8RH9VmLZyH<9g{Eh3vvFU1glW%7n=%vp-VjOqOiVb6VAN4y%Vct2odf6CdGp0O=xB
zwZ?i;mz|)YaW?`WJl5&8AdZo%Rl|q^0rVg}n3)v~3OvXACuvr;P)IkfAk6EA_z=_Y
z$mgbC&Bqtm+jO)lK$no%XV8ZHj>i#4pGzbXj{b~h=1zAExIeh&)4T(0hrXzJQcyjg
z{N<GV=18G(K8cU(t}{VGG#M?+vpKQq@B;$RG-kOR^~sQruS<O*6<&b|k7+;q0MrFb
zJvN1D-XDcoH>`6EgexKw72F<hg4SS%)DRjK0}&k`qjhMkC53Q|Rc**5Mq`|~GCR%8
z;}<#CwE9e&A+7HmLpR9VJQV2v!yA``_7K|)+<;G3ojfmg#Csw;|2bqw<8wf2JfrwC
zf4E%?;*F~q!suM{it}Mv9XKW_hB7m*(vvm0KVZ=u|H{Y^PM7jeP9irBNiJ&CN~-;l
z17$dF4bONGz#edYW{(5B`Rm2bplK)91<{*?D((%nv?5Moy@1pl1Y@#6^Z~QO3DSv`
znTcmvhhX%ZLjwEy@KEe*9~BbT>3aKF_?hqL9%g2?E@dMkT@!%@AO2P`AWx==I#fc~
zEO<TRP{bwdmNBplvc9k(>pk#{->;ZV5TGqZUdsZ#w1Ykf#i3fwNU-|G?<rdX2KYB3
zpq3W+>l)q~bQo5Dq*G#&`ctjWas=>yU(IyyUOrRoKM7uQJATSfvHfRjt=?Kq=YLsi
zJo$e<%10(CIS(%3IGoVI!QPRHU1yT~<3^(<C&)>})@f1+CetPYBS>sPAnoZWWJ7R9
z!49=1NGpf7;49)FIAfVWMp{T(#?UxhNhPg%qtV=4-+C*WYvQeQEt-HfqOq~n+SqEW
zuB@*$MVxs=(h~2BezQ-^%2`_u`R4z9tk*VAUu=EcuKhPiO7w?-Kfd5E{_8pZ-dZ_*
zu_#uSZcX+ANNC*DbEfhC#)tpL4fJn3PoT4Z4_y$8{4*eO{|@?nsJN(|l!gWVn>~c7
zN*(8Ewu5mPhd(%s!yn=&v8JLp{E;?S<VLH1Y$fD%i|lT2iK|D?tA8wNgtwAY*XuR-
zQKqgOARQsS)2;lsZJuyJ7tJzVG&6lfE;2=>`jE?jeNf7?&h^-Rm1>UKkp<hF7!8Z5
zrZK~9VHMzC$51AB3|9j4{J`46JY{_pbg!%xYPDL<&CRijB&u7C4saL2p-$o`$6^7w
zY?-;|f$LlV?&<sQ+#RArncAK`;1gG@Ta8@2x7db;O2bBm{TfjqB=&4V|ERc2jb#W!
z*qd^*0Zo|`jSZ)m>Jgsz2)dM0IEMuO2q%6-J}|&Z{G1aJmtBo`!&WsqP=z{w{cEN;
ze&VFCen8igRejS#y}VGs0~w)0jv0z(isePsz)#j?$3TRWAX#2FS)65|Zu11}o)KP8
zM3W&Ga0l)XEi$#hISaC;3N*tgaY;^UNTu1FZwNe<@Wv}*kF;8FAZoJX0<n~;8K&kG
z(aVlfbJJabAMl3&Ohng&2dA}fq?Q0NSH}E7^y3&hLl~!;*h&V=Xvit2Qx5L|RqT&(
zAUbN}XEyZ44`Jkh6KE4k5`yQ3bfzlU7!BC^8iT8Pz9n)@HVn08C#X0nYAB+Pe7OO1
zedyH~66kMvn>XYbl+`~9-&0FfYj1^FHuaF*=%|QTST!3&i_Tn-mKkHoane|4+Uf*H
zMnG70Ko^Q4F8&61d^q7?^~pWsR&2kBWIvq`dw=M0s4Tq9kGHge`!cMoWZmefOEtow
zt|UuFRgktUnwy4Cs!tyY%A{IG0*$|))1$>trzu>br+`k`NblO~j{}YxrB`X7QpD!$
z_sr_X#KKE?C#G2(onpoe#Le^v*K2nYQg|*d7gys336vkZq?=>*1teUmMo}!;<^&7H
z^+?Kv{wNYus!P2)elLRxaJWEORaCAjDy7pd`3=X7lZQ@w7@g(JW#6Yz+fI)W52SAP
z>5&3=q`N+~2}!f<a7%jusf(x#o==<;fUpZDp0v}Ou>2`j?ISutV{O*HO86yp&s?AQ
zlt#`N4)7%}3vUcI&`!=v(vM`?<3+=WW2yFj=j!p0rBow^+L#h+;OwxljUC$O1}o?J
zpJStXj1(3Ob7_(JSx}SXm~hAyD7Gw;$7DL7Ux~(&SgIP#R%|nDkKE7;dYsrgp5a~s
z0h}h!kKz3eKqXr$e`;bO=AKEZ%4(!~t@_8QNUL?JC@E^~<rC+-q%@N+TWK>E5tmjc
zWTvppED;wc0v~TTm=6<AkbWuM!d7kz6*ImXQUucCvHnUjzRy!6rB+SI%_2aus&F(D
z!>RKA_@D1~n_B_|4zc^s-GhBm<ql8+(Rmw=%b4sCMv`3>Taq!=#AN3hW}q>F;y6hK
z8Nt8ZbN0L=JbO+yHIX-*3>?~(u}*w(Menh(2*N!Y9?Oslm$HEsV`&m9{gFrZ#y31k
zu*@U^q~<WXiMV~51D{VH-|hb{4z~Y!_~8W3H4GlQkkmqni2ukW+XGyUi!H{%uHXa@
ze7C5i7UBVcTEjS)H3{CD+G*l%3$!q<yo*r*O6l5_SA^ncvig^<Y$(#E8EBF-cpC>z
z9`l)=4uz35>*laIhV0T@6x$SZDHa_#goU(p<&i7mm16ZZUU@=pI)5RK$sDU)Do`s=
zo#i8k4wsL>aXKLkwB}wpfOOQSsHzr-O~(Mc*|aYvhezv(gjwq{HIdUyg`w9=I4JHI
zYg-EPlJK3BB6(1IF|VY_tx-v%sEPcH?J?Andmz~QbV0O$O{7sDKZq}?UV{BqW4zjs
z3IM2tX%qf-^op<5;tP&3-#)M4RVamFp)jtO0ovo?Jwff@aC`5~yI-_~hWN?7e#_p!
z#fl*r=u_J#FB*&gYwh-Q(He>lZ|5eXN?P|&++g#*8*JTogR9dUOxDgO*I6{vrkt%u
z<&%+mB%=WoFGqRSS`=@PT#^=qjW?M`rZ~n5YZOh2xhGv)qJnOpX(|MBx5z<rRt_0L
zMMe3HFJX(12|8@A{-%N<=TX<$bq%EvI$mX|s-)1iv~&g3K6f$8E~>e>ZzTMIy!^rH
zQ;*~kw7pHD(~PshY4T&$YAd<Am^ibN+`wlB5prdlpb(0JO{cl>1*T^;$-s;pPq%qD
zapKI<6PgH6`nMGKpUIJoD?C<W;}B~pMlVwgX<M6>2Xa$Z$1kcG9{tv?KehBwtB#R@
z)McSO9hNGTr(u~7$Fu9H`m+s}5HtZokupjH)u&vcNCMH;)pW4xy_IA+Vpt|^7b&dF
z<5eaqAk&la^~lwA5cwTxLP?=)$P&wo7cW?7Ma(5xPCI8cCLy~i)hD}{_NS#b@!A~;
zIy0~zQ>e+rZVvKJyZiZ-03^IxOmE{SYJCT4omtC7U?3|oVH&I?tZvZn8~2LZGFvVw
zi#b2L<yG8v-P$DHL{*cq<a1GtyH#)At$OQj)mKYYzek1-Z#%JvDD6~}sJxXjj5g*t
z2-rfA?tZM?VKFr<8eJyUjUp8kT0%sVAtgYaNZa7^Fz~%Ebl#H_5eb%qYq4rO_px&Q
zj%0-1U_-gr{{?avfdwmrn7wKZzF2}vBuNFJp;y>YnLYo;7fvT~k){CrP?3SRo1tsc
zax^PM`#qHv5+ji73_IR?lITuJJQ!{McU)i&txIdYZgHTVflf@JK?tDfR3(2a&enVm
z)w!?cbEwjNHJ?MZ?yGq_Rl8R@#?cjsR4I~1c`zrwLTG8`Dapi=oq8>Z0}pTh9RK>#
zxt0X*${WId^Cy_;4Yv@fZzE}I4gXIf%={B)!Pa*T(lOM>e)dKqw<j(<N7QPRzatna
zc}QK~0B!Nc?h5W#(mbM(gno3pqDP7r@*yVMa2%X}t@PF07G6hUV;vV+ONwkIdtWhW
zH0!5-hJB{1-HiOPiU9A#R^}4KWZz4XO4$`$MdZ~<Z#k81zS=FWYAc&kyk*PIM&1b^
ze-NV=w{>g3|5rr6v<|MUO3fRqtjvk|KP_L(v&8{%+RU}RdbO%c(aMK}oo9Q2RAr+B
zk(K~Ut{_r-wC9U+LS6q5y26OMqne&adzU&4jA0XXSe;D|_N4mznyNnyjZMPvo^96A
z)qny&^cl7I0-kd+AMNc3XL2R_o;&CnI++FW9-}A37ZrpZ#%52X{XC2?iz6dOf?6Ib
zT3EHXqO`v+teWRiWW034uv8-$9W!plmNY!2mSCPLbj_$A_>mA-h87Z9^;%r}_7wAC
zqwCTjGONma;G`Sv1~t_}`d;`}TS>qkcPk-R((u?uv4F9p&={D+Iw2@Tyv)OHJ~Ae6
z>>q@XW!yCIyfAR*h2{`p-IJ{S8HMhJZckiIFxO_qniNku-!gkHR}C;ORSzFo>ZUb0
zXk<>2O47R0nMjP3F%_`b=QWE>tW~^h&$XQs5h<z7%1ph%0+OZ%i*!p-G7^UO|Gs^2
z{OdL<Nt7Klr(0ZDU47a5b_km`jJJuSmVVb5o2${B5}Otf?FJX5X#x(_bTv>(JUvXA
zjtdwkUg?J3XdD^Lp$mipl}c1Na{2~G9AK0{&UcO1{SvAPZ<?AIjqoOP$CD7F0>i#u
z>4Kd4yn>8eWx3LB53i+euCjQm$@rFbaP{1Ex87M>-2my*?RVX7v*Gr7o%P11(`{`u
zSL-huFkbiNrtUDMv2DbwUj~Y6n}f8Z#$^V4MzP7H`Z;0xAML8|eaJ?P32CL9YN+XY
z7n<G4WP~=HGL@;L$8Cudf0ALBbZA9`6Gk0)0%sOlqhZEP1gt4Sar=52*&hZ2vV2SJ
zO0KE)rioD5yYohKW2FxNHS~qPJI;KIEq&iShK349E{{)no-#hhxye}|U1m9)Xb*|0
zOv_B2Hqevs8g^*1fBEXJN-u2E;YS<r^3kiLX@=G3fw|~LI^|359m6!684`JU#zsDB
z4YDT*^-e+!u#i6nQB7VF5G5cl-v^crA5*TO79WG-(7^p`a7l3<JUw}t%!HU|-dWR4
z;o<nO)z4$1ogT#sI0N*i5OZ--*GtYH8B<<9K33*fwXc0z?P(2yL=dqOPucZqhPvwN
z6u7ey?75m^-7uhVbPjw_jyy}6A8B^2Z^qd2Et4E*<!_t}N}87bP1~<=%eVOX&OMu-
zK4m^r{J$~dHj26rnE$8VTwU8p`+sk&wVwRHALGOR9~3kr0%9?1f^JI5K8f5~*z43l
zV0VUiTXEwDw?IZn^doi)#C13nK8}Z@o)^kzoL?Kuz!xr1scOZ4G`p%ildkF-7uUup
zms)=DZqSR(k|rbcvyG<~e?iubezbvU-=C@TRI-vE;Ww~Oq8c|)jr)`Ncnr3Z?8uW5
zRk@i{{L*vLQ%U+J;f&N!7sRnj=s>bO**Bm|9tMM@h>{eTgWNpP`=&GL_c6#BT@WFE
zfD)-2O15SJm{8a8;Us3l?uag&1$e?lBQ(Fj1)?5&Oqi~CW%9{!d-76<dyvgtf|wgk
zIuQoV@QF{Qh2dB#%K9FfTE;E_L=+Fe7rlv+*HzH3l?=RS0U2h982a*`rkp*bRTBsC
zVGdjiYQ_=G>Y}=}H6BE!_MzkY7!QnGhb#Y%!tReu^yvA}2|tV4zeG*8Iq|)#DCmC1
zOTbze11Hve_!n6V;zRpEP!W~zMMaN5st!<{N7{*7PdL(W;-mXN`dkB(vn3t9kWW1e
zfywG+1edCub>~dJ0eG1bh0|j<T#?LX<c(aJuQC$*hp*E@f^v_PR_7lnFk6-CpDN!-
zgWcOD<t5%G!C2^;PS0O&gkxbyeN^LCIXHEW1xL*jmwQI)cARTOqQ^&(8OHx7WQnGn
z|C&*1ZFOEIp!oc6G}aoebpF4M)u;F`kMglP&XR|o4?;>1ey+r>+*xN>%gwem^`2QI
zFa2JsR89&$Rf>hqRH8wngqDz{u2Kzk&e}44Z5tEa=Ic4cCTFd!pXRmMn7z$LV_Kul
zIT~%ojmE8VTtbT4p{T4pg-Ec*&|ngPe0EXl-^15wZBA86_A@Dka@0Q<;S2lKr0N@L
zIFmM=e4uq}c+x0fBIUur9muujAc2b2@Q__Wg1xts$w?fi8cvM|Gy7zqtmDjV#T&B~
zH&gS@mMvX^-lolvw})0W1_M1u2^T%(PM$w^vXOf}CwKC)c$h57z|Y0_(22Y+GQ34b
zTa*_h0Xr|E@j7U~DH8uRY1~ZN=(U)fh7k<LNtujp%k57?DNG%r;3sviD|u*=p{>6o
zDYfN_f8JPbEpBC%==c_S!wlGDNqY+Vp>tImIA@|YL!Edi4Qr){S#gk-5>FNw)ZuS4
z%&}>iqYN<n73OJD7<oTqnJ(Z&<~qtaM&BJC?Y}>Gv%7t~R2mpD7;ye-@_f?5gw9+U
zI$}O>H1EFb8RDh^gtrc?yt#Ms!U5OKXu$ZH?Yu2m8ge@?dCz5>64I8W;{u03(mE-+
zipYH-f`p+3dMfL)jvq;uQ9Ia@IK?TjJ)I-p!Z|`geF^;~?`+`910Nn*16xTXf1(*=
z$L)k?lOgfu&!uHiquFdMrXj_#n1f4cel)-kz2Yqf-d1fcv#G=oE!aa3s1a&0Rnps3
zTipR5JL;r><%No9RIYVyhN`j|Ra4620<Rh3d50=O$j~tS&$N5R?Ot)aal=>BLIY9<
zY;E<Mdwr_D{~ew6vfX8!Bo$G(S-P!4Td4)joF06c-Z1HwVL~AO`d9HhN6-K!*(zu(
z-kJ`yr7Z*SW549j&bBPmn~%DPE64BQa8OA(Yc=5vqTszU>w3N@w%@<WJNbGbf)1|%
ziW#WlIHXlb<Avtm3-h%E^^oe+GI0Z|*m5C~#&{$f&Bvcx>!c#5*W+0+3UM=8#F4fI
z=G-jkh1URyoEnXSk!+p)P*2U4XQG03oCJz^2jQ3LBO!&ZcQE9)d@9NRey6(ODf-_*
zaCYYTXLkz#KIQ(m)oi8pzx9pA+LQkGF+Oab3n)Hp(*>`(92y50{*~<HfIXbhyIOS0
z7q+rOG#QO3zY-eh(Wy=s$MUi0IpL)T<Texso<F%_M&WGWb-K^kn^fx-IT|jXu#mQn
z8qatWTN@Z)H@C^H>h?w8^%D0qimTBXPND(Y*m=Mi_X3wamei2(DsGJS4)F*Ey`F>t
zeoHP7nNwu?f`j>s0-WTzmvEjd*cnBv?e$L6Ot58cijo-ci3=Ej$-h>IEnDJZI_E}B
zzfxnnauq^7ial%NASMoWf$5#d83Mf^WGZMmw@d^RLk7G=K=pz%<xks8aRrLRM+4U#
zrKCfwKf*Mvp)V>+RBo3~^QCN1(dpby9^a=9GFtyJ9uhS?m3~sPgbdD?6Ee&|h^iWH
zl^e~C7M-<*WUR<^k;^dQC(j1c_=~WNo5&0FMscu2g}E-|`+>cYOROzDrGTLeY%*gW
z$Z&?!j!d~tflE0HJu-;K@N}p#cRWAwh(WUtN&w@AL(g}x^UgIQpLgavu$R$26r)ln
zd$GE;bs-zg?7G~I(@1s>6~5!{!4L1C-O!27k+DDuqc%?u_Y26|+dD@mwuotj;pkuy
zsrk3lN(@>bLwLu=0Mk6XVm#R}$0ysnzloEh?cM#QY#@$&%rArbF@rt@{ior^cgjzF
zZ=Wgr9|t)b*S>h8p);zT118r3zlIlC<$1!X_J6HLivL?(Ypg!;e~<COV9=v$@)jfh
zj2Bvf#1o)}7cMya>JuF#3%NWpT9FJ$0nVV+6p@tfNYwg*@eL^k{GxJPXC>@)49fbf
z1U0U}7%E0Bc+^prixp8xbx@Jynu#<5fWkIO0AS%Q8RKtEZawe<`%%O?l-!PTP%%`l
zl_gnvsRGinWMqO4CZVF1PxUI&@(2r_!(g)oBujbG5Eso`DmFyJBwCw(L-d<in)t?V
z2Db7EUI<7?)Lb791Q&S1#*Bbx9OV0na|s_?%N#_9^Lv+EC2WdXep;s(niL`I0al44
z3V%0i^tB1|BYmcv|CB$JA|KsB1vE|nv$mSf|JG<V*PqV+$N0#U6QQXer)B5Rj+Dv=
zgtISr?4y}EM=V=;wje(E0}mav$7uJjy%W&{_L%lJ2J5Pff>8y^UJqQAiS}A$C3>c%
z9|CbRVtoj7$nLnq3B?0SJivR2)8vZb7SK6s)6m<&NZioX8*8FEFdCpzgGkq*07Ap2
z|46X`kUR!`B+C=p3QRMIOjo%a?~QYJ0Mm+o)H=eAA*y`O$6<YtaASW}=urF>>Af5x
z+k|N&BvUXoCV9b2o&MPI{2y7a+l0os+@J66wZKd>hSGEsO{>*^j-}>3Hru>ov){xG
z^aELIS_nw8t0Rpz*sV32x#pS)pr@K@T8rAvG_6ISOf=I~o=h}nFwy)zE(WLSe<<sE
z4d-6#PriHs`F>_bu$cd2XHS#=1NQI9|Km|U9OID;XyjTeMTZzU*BquE2|7q`UQg^E
z?ZzIAh!P+_%36Rd<j=^gj?!`iu^bFIaz0dvCjGv5rP5Ctyja+iZd>i1+eew!KWpo(
ziPbDZYba|Pv4Hu?L?=M^PS!+|0Lo_(p*ZkyacLPq@qdBnD6c}WGpHe|e<*^io>bb^
zKPt&S$K3Vjk(42;a*ohe70Mcg1|#&kN6^Nl(nY@Dn32;iYKM$9^fKuJS5$zwa#dzY
zcw=`c8Ztp#T;+B;bfK<2@FaFczJn^imlMi31~RfbH;%=KE+hN8klY@AcCRCaTcH<B
zA_`W|>qF{C4D_2qCoU25w8niRDH(Ky1KH!OWeeu&k1S<zEy|W<h}SShJXJ}G%8RZp
zXUU=@jN-Z4W<S!%M|hhiwXTa&y&=KVqP1g?S~pguB3h~sT6#1o9lB$OyiTN(E{{%*
z`U?F`NAZAIfE!-((|WQiUD(~d2-PH4xYGRom!rcE@8i<jaE`iS_wd8J6WBb*CrA6+
zZ;w@zKcA`&(QHaSRH=;eepgku^;6NH|Lbux2&L3;XKb!c&6z6#M1m}#{aON6#zxsM
zAwLj}SYI_(L<N4O8tbsZqOpXHI<KL4KI8y^j!zeu{u!|LSwvXOUu$R`ud-#A!#F@%
zFbV0M1P&Us$w-AUb}=0IUKL-(UQ@C$if~DiaKs}t;uJz%8HzB}2@Lj`A})<7r6#`j
zFDS;D2$XOvkCC=IbZ+Dq{g6O~Udnm7DvO=Qh1f)mQld>F3icBpY#g^37)VU$9p4tC
zG28P+v>#mAgx<79nv#M^TLEdjh9yN>s`h$UDj*b~$#dD}637#-znF@KhtB9A-aFwn
zCAY^&$=SL~&9ybCXx3D~Q9vNKY1n-V3ZjbR;D5U3N!=v3in0~piOH~ZsyY*B<npeG
zE5JlW6a<sOceH<ea(J|_MiD{T3*+iO!NxHKERgXDV6B|bkxC<rYHi9S8A{^<61F&9
zZ_j;(0WvWmT;%v5WPNelEW<!66prF1UN(@Too*Ks8oC)3hv&EBbes~h>vdR-M*a2_
z5hDaP-$8r=<i@=T6(-|UIuLAx17&kyp-i>UGLAOvY3E8b)>SLKc{5U6W?;}S9-Qg1
zsC=fmW3krax29di9!1+`otDdywV~VBq3iA(?}^^T<urTOaKcS|3OITJ3)X{^1Blc$
zTT#oV*j$P-2S!qFh8Z_t9W}EH%~Xsd{K~E>w)IidDS(eY8@`2jO#(=akQgHg$*Dp}
zkn0Sz!C0aC-@2Uzp^(wv672V%Njc*U-C&YQxWf`8h=j;dbtyc6ENKhLwIG8#I8vjt
zj21BiJ`LztCY1>3bbPvf#Y-AkAK1;$9kN>s-5S2v!iSf*|G^p+WC$=O3x@Q-o7WKl
zp^N(mjws@N+#$uI1r7zpz8>w-0FI&yIHaM)4lrw{B5lmVhaOseq-;QpQYJ?vq0i!D
zOr(rON!6A%Ux1Tn)>ET#Mw4NU<PRM&%wgqaRW^#6Y-FYtwj`%JCblV04K326psGq7
zg+7}X9-aK!iN#VIFioLrslwyXK{P8-xO3fROQ^iE(WHy^L;cBM+7Lqb4-RHGZKyoB
zw({2ir1ZzB!V7phAw$%ILwE1P+xJO4S>XJa<4sJ-3V<sCilYt~G9u#`n^4r$!f~uu
zjMHdWkbTDW<9?v7UF$_h3NADLu6`~mlx9n+_}E@y1P39hQTWJ`XLK`uTvS)WyNxsk
z_G2~#Wl|6|xNVqUTSbV=FC1C?3wUW1q`N?Tu+L@Dfo**rj4%<z;F=8jVie2NN7@;C
z#fdPc!yp)cu3&@}0s#7)ZSU?2@=iMydG?N$>ErTR%PvS;zrNyJWCfzCFcoGfWS}E=
z#o9*JG_$gQbhK0<$GBXpOsYxwb8P#>TBR_jRx<O<dgjjF9D|j%<klk>OUzT<CJkym
z*4wDV6V6H#f%7xBv2n7&pTTLbv1fT74(lxqis>kFQ56$oqm1(~>v*yVZhu<1AR%W+
z1}+apvoT02BT7=jf!kG}OCGxP-Hca2CaoqOczhlPmkBO%$X|L9msSSp(PDOp&+<u2
zOl@;^JX^k+TPbfv7O=DeyPOX3H#lT9&}HH>NtqxCw>p#pKaTsACeZO{VnodzKe_u-
ze6+^+O@o8z+Q;}bCxInClLEgDW0JI}LF~R7HVQKh$r_Z|Vb)VF$<`bh7pLhDdy4Te
zC_Ojj!_m<w*}=;K<)t4Y8R(5eMEBe=nz(plI~`Lnt4g-zFRwJtrQA-O_^~xND&z8Z
zSW*ScZDB{Gy<0jhQHS7ESPc18k-bAwpPc=TJ51!CEBIMRZCuTQoa23SP5>EzmC3J{
zKi2ys*b=!4`${;wk0iVk{T{+za?Y59OA^|-mbUPfd~~#qBk7<Tf6Y>$xCz9zqzXE|
zi+}%H+}}~~Jf6swHlW4jc@G8!#}xT2T(8oHNfu5E^00`NBGTj^$&Tmq1qy0WBYDY9
zdJaj1EsZIbGYK5e<^YarmlGO9&`#vVVf4bFH|g5hK{c*69ZeuI_VJI*(^$46wvEmj
zyMs$LT@^5*QpsC+Uhx<<>@EW5Bs*&(jAmQlSvO-@M6fKZ^pi>Vl{Zr=Zgy3)9VB49
zVBm~d4aRl0@)27p$<S@Q%3OZoCQ#*_@Jyh8_>|)DsI)uxibbA*=1xWN_Oov%qm#<)
zoLvr26XQTa@tLyMoY4rR8rChS82qG6u(otx%yKH_K%M2*TnxRN>Lh7pW)(^fP+4n?
z`VG4T_&lX+sZ|p_%p#|J)%9zC{i{$p`{XOu0p7(C&f?FuwIwxJwssle_V5lsjz#Jr
zJwKJ>+cv4&Q}uWyyWrfkB<EWq;d)UEY3GA6U@i-is!Uq2%<JZaGRnq;j7R|L*O{qM
ztyvk^WqI620#=4ReN&aJYN+R#mkA>fpW2HBp+wX-V#zLD7A+W=rP&zD6Sz&7CpFl%
zfX9p)?+~Ni4ik(lEsPol;<l;UbzW1eWfgV$WRoiqN0R~RCXac2rG{4ymPD~o{o<f^
z;PL)1e}7hPC}}kyS&Ke<c1r?~a~3_bn<32*|8+!p9_KIvpA!GIRbNlr|1>vRPySzz
z@>vkObZw0{#eCPxfw|zQ^Z58AIvhy@ZU3{%DjG~8I8p(1fw}0S1-D9z#<>(Dr9{D$
zN~9M-4GC#)`-6atJM{Zy<nW;ljs*6viHn94E6*0-(LaL;sVO=9&vl%;4CUNqF&+<=
zQP6g-RdT%~S4!Y7^SzNef}W8WE=jn|^yH((1etRZK~<)mFfX7y*q?MlcKsfY=S@H9
z0=e&>MSVGmG2nDL!3^oM@rn$A#~A?QQDMi=7PMAUxyqN>9^ul9T+T?yd9J-U>7151
z97ga=${naT=9GoXo^ge*)^T8M+PvbX=SJNy28aS?n=}aO4}hrzDZ)bxd(dldkc`)E
zXKpn`&lWSn2Gi^5HtA-uBD?fd$pYJSRkGMV9Y2=vb(9laf{V?JsyZZRs*cdEYM?Jw
z8EE!rU|WE2<EmC+iDs`><26o2TU0rzaw<wLv^U5u;(do(wzPXcA(t%;-&5FS{IFI0
zF`MGYVKi0jjAZ+|>1}W0SLZV6$ImPwmGBcAO@%VVTwRYcmrnefTdT#j;;dLRD&c2|
zQ%8-Z*v-@hB<C%N<49<E7E}yrbWDm#whSn}Vp+~T*2VJiM0<b|vga*Z>HJhNAhXfT
z8kQhwC4jf<pf10c882l$%tByRpt2oC#^=L4`?oM#3Z66172Vh(8nsN6V>vlVw%9n2
zzAxIMU@VAt!KIeqQ(rd~{~Pz|vUboCBx`2Q(xg3NVTPEcWHjKEj!{;>4noCqZDe@>
zw^_}qqjjlK99B?$lH4JAB^K132#bDiw~tTukFpqp3i)Lr1AQiLCfeIdj^ael_~tnq
zK-U*@qrvE(X%{tm%T+pRrnRU(a_F>3vs92dJIHHJr<7ZTl(L{fJ^m0+VV2rx4K=m=
z)JtMZ!}l}KV$EFs+wuzX^phDQ?w6{PRb-Wjyl){3MuJ=hGwIV&Yl@F5oP{$>Ef-{l
zL!z%(^8Ml8Rc>Kkjx2def>LGN-0(9sG?i+DJXd2vfPdNVf3hYIH%m0f`qmPS{uR#-
zBb8ArMLX55mc!3fTrLh-r9Q<Ju?(V>h--zPOl&J=+K}Z)a<Xa+ThDe@=HU`?9nxvD
z``HgJ2X61oMQf)xJ++7eOYKXSPB&>r>tITY<2V1kPtxk%{?3PA#NL}<_K#24ssILS
zX@gjSj!X8MgpA&hGG*XZOSB@M*A5Q1_ujnwg+Y)tL$LBMxz3LGi8(<@qwbL%l&thv
zPB%%pDlvr&6!0LoERPV`1)9l`lje2@XU?f}EalXx6)fS{sY=i2+=-v^4xaeQ_qHq^
zLaw7{(GarEp3{f$SWch#$>MgoP{r!wlCxRHG{u_8L*3`0Y9?hGAKTC4D`3Cbz&E;d
zM!k+s2z8~9AEdNqq;<k~w_;sNxpmQ6hkx`va!X7-@$`C@ZoTE;vlyk?v9*-Mj6+2Y
zB^{O$MLYPM4(+V<+OYTP2TGSE`;|Setd;ANF1}~&6sF4bNb<U^^n_avH({j{b+1NV
zh*n>E=Z&&GPn)(vzpt&be)`<wXNLQq)<fn0TVGqt=KtGxy8n5M&z<7Q+*9C^kVui#
zaY|LZmbkNSQQgm&I0M@M`WcwAUTerA`I8~W3PS$6u6vqm&oePsqz(v00s^Ui>BDMe
zJ_*u*W)Ia}mW=m6FeXV<RApZvEpR=f5-;7V^nrUDUuffH{q^`91q*rZs4KX!^I2W*
zF;ARYZMGeSuh8CWygdZL<^azkn4R~9qmPTM0xt<wgB3~2a(s5(<vYC<(iUptO7!o2
zU?ojKoP=UqY74?f<8f|Ukf&fQ^95s(n#@AJJlDeJL9*yctBMRlSg^siwe?FMEmFFB
z;dRH1?!5KL-677l#Tl^d)Q}@0u33gkXp4iA(gdkEvMuPgWY|v)O;2m&0__L34r!nb
zU>8A*U&}4f6wTrSEnqh@1#(B;y0vWa^|V$@tEKU#H+4-UdOF7*?HtoiCr+0Q)Og<y
zCTHXntP(aM^*`>0-e@d#F%`KuIQqaF0=it$(~JL3`cA3$LX+n4vS80tN>Gn&;`(^f
zk*4D&#~qvi5!4(EwB~q;lto5D^o{Fq&X+^G0fgt-&)5CGZyy~0x~*S=Wem>3(7C40
zf<Z4jcS>dYVYp6BNJSnl@XuED51UFlIi$&Sj)Q#AT0|=R18S|}thq3gMr7@XYl({V
zw<Bp`rRxj^&ws!X{;>Q*6^8M{qCJW{%({Ujlyn<r8~Ezny?XwsQsq8ARTe9vZa*0r
zfX}OcEP^Zw6*Glo7qTf~xkz9yLp2y&4r<BPqas%5ONBJ5Y4f1mj;)3;zyw-2p;4(+
z{KI%-cuNFbCgVkNqsqGwFh?intmRs&{&BiEb-X|0a4q9KQF+vS+Ek&-cf*(Z-aB^&
z{o18-z0B5H7(>LSTt<$K?ZNs3jA$e$En(lq&CbSEm##|b02I~I5}nT&^+8ae63z@@
zy^Y1)0V|;x)gNJ!Ir>z2Eg6c=nVh2&^ru}Kq#!mEQ4aOvObyUtFOfO=ipyrxTNQ93
zG>50KfhD{Bo;X$GPe}^fy!;s~N%11~(=NmNaT9ny3L7QU9l)+scQFmp#s^4SP3l`&
z3CTC}8SCKLK*lPS!NjSE?GOKukuhALg-B+4lQ;mdB(K@rk}Oa<f|+r2XO~tfn$@Hg
z1l@DTKXWP8buE=aB}}Xm`Pv-=NJvhs!03oM5l0_{cE3zUt#qqJv3JZ?k_$+zpyGpU
zab#r*6(T9CKgL`+F~CyIL@I0)F)i_tG(cJ4T1DiM@m^Aw*3&8CH^rykiGbf5t>rNr
z*R(?~;yZW72Ev8of4<w*@}|ml`6_`#XNdnfcLexC{cmHnQD0rp=zm*J`Tri}Gkg5c
z1+j!j1N$o4;|YP(;Roc_LXnKv?jUZ596*g`vcZbRbg3EpzQ%5&L^NF|L@Eg9CPfyD
zn?hs2>Ar8!bc2%Bk=+1I9-HD2SC{C?AmZ%YtX)JW2b8EB2?f<Ecbqhn@3+SQ;V9Tc
zmuELd#|1o>5d!3#fTlm}=zHn-V<q@b3%JVh>WnZo?TyvdHBtF=Ro{o7#;2>s9{<$q
z$xmb5{JY-LzOR0|T5Xv>^>z8YY5w5z)@%6QFn?adv-&2t_wwbZtL?Q<SG(Kr8@}(Z
z$uiJhYpnuPBt{_PX1PEUsmbF@g4U|fvB$$oN41(YES4DstAvB*wH8;(W+9mb%Rv#o
zju-yfmD6-wdb0LZUX&f^j*Qzlh@gyM6PIT9m2}8}B_{6P_*y!vbDR*Uta*)<SPYB;
zrXT>18sGAoXe{q+;E!cVY21W$G-ZIPIW8NaK~qkYXkh#Jc>n0+&EY%odi%}6{vOnC
z+-0GffAWP=%CV-X?CkHqu6zfpMX86hGZv0t&V+LAVwB9~ICcca6TZg4r{C!s;(3JU
z&<_6;o<*zLcQ|9#8`^XHyP5pmfS>hN>b<P5pFw-@y8*w~;N2#aX}}ru8h+NG%v!Tz
zpJZ;V=tdU#&K2@?MCW!I9ftPyaXpWnzFUg=DlGUi!05G+#E$O-70Mii8hSL>?hifa
z?-J;-vjKm@&pNP7o39hL2hnSHy>jOOo<L#0Gr4GO<BdO3DHqk=?@dN33io%i)Q`05
zt?w<%x(#JEf#YmJUmM7I?gBT8OAJff+@F8fFK{$mav+X<_bKt6Oo}JX7?QMjcPALM
zwj4ng&?1h{PpZT+B;;Qcult!A!Fb%Um>0Si-}$Mcq?{K27&x_``n#EfWBVqK={U3s
zzc+z2w2(|R8J`ia_VM?2#lnUp{9^5UU>Fm`;M@e?6Kc#VaorcbH1qLg7jR{x!4fs%
zO&$M+BW<USN73Dnk^(Am2k|aJf|%5V0mY*NH2an@;2w!XD`&A+^A~#+h`>HR--ZJP
zpTA`OWe>h@HY(bI!C@UWXK>61!;yErG37%eMNpCokyQMQ7TOFsjSS9@nFM|E@vD9i
zjI~!PR_{ls9^y3z)20Uee=5EM0=3YpzpR7!8sq49f{%8Bqyn#IaP(!}#77iY(rUHz
zk4~UoTFN8wQMiqS3Dto6uUQOQmkiPCRwXq=3fPU~``ZG4zjVkxw5KkOg3vqjFlGuV
zcNvR)w!V}p0Hbp_O5lkR<w<SN2*jSjHIb)CrUUgTfpZTN3Q;DAZ=FiAo$YW0tw@6T
zogn3m5#nO5CYQ9<cjS+bzT2t4>y~p8Nh*AA0b0HU^lSktZovE3(C+%{ib`*C7X;w2
z&ZX(g*Ivj4`>w$tpKM^)50Z62BWd1795#;jrEzJ)2e@H2`7rcr`(bHU3y@@OhZ*sG
zM4Sf7<Z#9UE!(&U+5BNh1p!k&g|)`SH?%5#fcI#CZ40fn`kJ2LNYC5;aXcLLyiip5
zA!ci@C09Q+?6aa}DejKUO!7)!Dls~nO+M~3yimb!?v`5K(qrY$+ani6Pfz0{UYD`&
zeiB}fUgdcDuIXj~e-R(Os10=Q!iC9&7Yx$O1wUWxtK3Btb|i_KUXiGfz*MG5>7n^I
zrkBT-jdUqCMoFR_1s%n(+1yCwM9m7fvW#j<rUW<|G6g|v4t$GanS|~NuvC(M%Wg0P
z3uW|bOzF#x?Gn$>@<rhYO$c~{ffiR7KoflCXvcKnt9z;zrgNHc|L~cMR`uz`LNn|i
zYNUpZ=v!&(cA{z+U_P?%sFJ5f>CI&JSHT27mi<sk1%^FM=k5uWLqS1sOU;t8Zkp5N
zkVfPkC}~2xAX~T!F>RcqIs&I1vsm}nl7yoqO?Phh9@;^@;9cwA$2h*+amBFytm8;F
zFy(U@Vf@>dM&;Y-hpWnJsP0854BwyfQslK%U|6{6TuoKZ`&GREl6PLlJN0)%{;2Ow
zDVU-Ly)mWzO<8W*I5xHR^L|V1+ARI9-{bhGy)yH7$>SxdW?P$sHqX^HR0K&Td4rWi
zXbbat)4YLr0Os|WlYwe`WqxK>wJ{DbSsW69Kf!hMLu{?o-Q_pCwKo3*TdU4@ySq|}
zfI6;iXnTJRbz7N>nG~hHqWD=dVJ<06Cz>Ofbvu50n$dV)qSy1&#{4sE%&&CjZSLOR
z#>7pz{+jJW@wR;f+TK~?&AGYvpS3Yl2j-vkPW3D8ShV8$Pu;Qid6c3R_iI$Kt^!xO
z%H?S10(|$kzZWi*tZmYkGVC&zHltc#Yn@A1^a3$*LmV=D=jf{UWh@{wl4P1<#{h4@
zdCj%lhTr<0p6>=o)BLvy(6Mn>OaADH*GgRgp&gyNe}64EZTwqqq_q}{rnH$>@m^BC
zSHCw>zh5Sskm_y7dUA8dzt>ac)?~TW)bo~nzMXo$DW7l3_BK<tgXqoxW7*s14T<C5
zt4lt#Re2DbK?Bt%KHa-AUYZsgPk4SWcpd`wcKFA@>OvDnM|;@p=zkb*di+Pf|7pzM
zoY-jb>eE%X3zXQE7K`o!A``8<(|sb94@N2#xoP0?6Dskyo?7@WpwlL-w*&7w-A|p*
z@VJYI^8+q>Y{D>fM&B}1dS?rUoJEl|oz5lQIHAtx#||=CaIUQG@^0UT-}`r<=>?3?
zf72S=h5x}+$mnG3kyl|PYU17dJxY2+Jk}dBGYi6B-0_>eKlNHqwOFu;EAaOQ5ZRqQ
zwv56PePbHCUT1M7c81i?hL`et>yur<u*&8y8~7VJ1>~UM_scc3YG6@eeV18qd|zMB
zwviD@(#njrobsukmrafHY8BLLrs~SSS9K8s>c7<CmIqhW)&|dgW0QB<Mw68XIPZ;m
z$+mPj++i)TZ!C*-u<k}H+pdD^s$3sjLsEFGm8^fqF~&}{NTv4JtauOlZUEQ1yU%OT
zsHZLZ{&BSb_oMB1zwjp5Xs(H7tChNN(<s@ur%=h#wpe0BB8O&D>MD?k-G3r|YfGis
zR2sL33OS@PJ5oye6VbTFYkPU@yNJd$H*@-Fn*9{fxEQXxydUGX=Ad!bH7Z-KXf1bm
zd{_tT&PwA@(w|!Yj$<@jDbRfk>hCG(9^kgWZYq*v8n?YCj!)p%+v9jMtTi@UFE`=8
zjkTBGH^Gz4Tx{0z2HlMQ6X{$j?~aTr8p|k7Uuu-<&6LKek&*&7dB5O$GD~i-WUz_q
z()~349USkUu>1LD9e=)WY*WW6ninG4NoCV(DDj_-b4ZUi`KM49r2U=INH*>Gx2ZIY
ztrQ-vu_TH(jrjL+o3)VG=iciy9{#%jk2l9B$L!>@{_<t3vAMohZ+)Zu-s~8u)Sj;2
zrA)%#GCJN}nUu%t;e61MHz9=0l780uy;_cn`{jB{rM{6u*fl9=l-USce@f+_QMs2S
z$aQpA+U1SXgx}2;TUg;e;ClUAbp^<xGAW=4%l@Run|oRGP^448EYdNi^|Bo41hR?8
zH;=Zpx%zUmv5HXx*IR3wje2u^RWJGWm$>N5mm94{^X1FcmuqWtAcDNQVdDUzo_N-t
zf8&TT{~?>gi-dsX-6OtCp^A3Hl7|W?Eg1KNX%tG|Kjz&7=G`0S-8*XcgT}q3`fa&a
z)KQhRK^xL9^Cdfv<7GTv#J|kivk}VfZof+)S!)8ueoJTj+|1_SOTXQ7F^Ojgef>GN
zg5_QUY9>3P$uf(M-MjM0-c_=W#GHL4i?6c@2g%4gyqiEyd63&9i$V@_FvH@7y-w^V
zH6ceu3RprU4lg6zKewxF;eu|P+kaP`cIicyr<J-hROBZ{0Q~(jMf!B|rAP|&x3<l;
zJ)3nl%h=y!U)!BWLkzxS1P1EQzVrnvzgxGg_GYr8`syhR$Y8~)W#u<g2b3l<?ya)g
zaR=jW?(yM?2h9FP<q^E9vv?4@3MvV%#*2rp-a&`~XAnn3KXhUJI4<>{6J0bs`C=f-
zZh32}JO(+#7&q<QNQT>yq-KBL<c>1j&w7fxN{fby8+w`IhBi~>l*qZA3fZ;KWjB!f
zfp@Et3&L@}Ubk^U|9!OomhQH8{&~D>0JYYruhlo#*Xzx?*l4bPpS)3K*PspYfb6|6
z*+wLS$vA?2K*lv+JA}bwZJP(xeq>Pj5wsthYnH7$r}jf*MBX31Pk?nhXNeETza~XC
zS2x#RHe1cL?|e7aM8_ew@&hQj7fb-1|LzPX-*kNGd*w}O3cP>h6<$OB82Fox<f6St
zBUilIY)Gz>$h?NHbOpN3WzeD>uM?Xu`8ZpBAfvXD^ppHD0G<Dwt8HK9886FXs%6p5
zVhEObFUwMt<sWj4wbeB%`8j~oT@~3_eJN@$SL@#;<r#eGi$te^3nt@Vahik}O?6$!
zpA$VT(o))RrI};6LNPa)G2BU=ytW@yl#ubtj`S<qWuq1Rt(R*mhFTegC`xw+LzdOl
zzG~LZwwwAsTjRe`b-603YCIN;fgXih+LL89Zf3pC90@*eZpbkxO?WHyelwY0U2+^v
ztvnl&O<98!91GV#j(2Teu0bmN;-jv?x&^jtpJKxxf&-2d*I_3)A@#Zh`<-N*>vB!#
z{!HT_70itgSuf4!&5cyO&For`PnONNMqdvdrm}9cAz`$^A+6EKaASw(_VVT2nt<7e
zpWNWcat%i9Z$7B#{rUiuHp|=Rz@cdJw3&{mXZiV-&GOdP&GOA06Xa>8$0+CA*(^_k
z>+Xiu);wl;wlykSuHc7M9(!B|>&|MHhwA>R_3t>w*x{|od3?4vc<oT;Mw~(T?X7(s
z-J*rS(Dka?-+xk8>WRucQJMctDq}ft6DJ3?8P;1bH(Sm1)~48Kz5FhvMmdqR^%2Eb
z{FX`D19MO|`4IW`JsD-B&U<YduEny+>-prv)$RFd-JRsa%}=G|L#o@9ZE1gR*EP*`
zOTORvWXd3|RJqkuJ7wg>S=VGOS(7yhqjh=Ktf$I;i}GSD6I$fOm+GCqCTW;!@}k}b
z(oej@Z>ss?ZzV%+%jXhj@rEESXOk&+lJ&C6l<75lsliuicK7%UL;W7Y7_I7%&f`tV
zX7jN$yB^RWAM@A`g5Xc;ygVy^x5nD_?RD19Z>CdTSbn}`{%&3e*4KME^_r==W%)ZB
zTvgp!`MbO|DqF7LXLFUyVjZlzv6gMOh`%dU|Bhpf?+aG>J6fg?9__R70k+kAU5>wN
zzI@r-sIN8F#pXt%-fFyD{Z6kX*&v*AhskaubZS+*KR2gF5~aiIbBqp*OI{GB1Je+r
zrGW2VVdmiB(2<FixmWBo$zdj&cH+A;mD5ZH_E^TIFgC~!p(}#VJWR^jeC~`!KAHe}
z$t1=>@FyhEPw|oN8XxJ~->`>=Z>44HFRt%~UKfo9j>jP&_+baLZ+s`*M;2GFv>YA{
znSiC>XYPb)1v#|VBwivuU_=8nTO>w!7vJ42*2>)aM7iRa!(smlR^?BsKg>snrsQ1G
zHmG&YW>uZ!d&~`@7LDvnQERix30uC}0;+5DF~*$=`hA3+%$(s419<o6T+ozhX<}Du
zGgdQpEB+KXUX`&cO=reKRv51u(US#{WOJKY;@yTNZRUT!KYai8%{v}<#u7xn-~LDX
z{Wp7NWKq(0&tSPOTuN<4F`CcDe||r&vU2P0YtE}mVYW)>?*0sNE3$oe3A|KBZq2~;
z4svUzEq&heu4RMEP}v68omFlvRsW7-jCEf-jB{&E_AEvF3)B}Q`?8v~a|5w;dv7n^
z21}y0xwbB9&GmX?t=@XM*0hkif4q73`cOtPiEF<8aB%QllD*inEvA2%W;p16%arf#
z*B2TE%x3yT322>v3^Xe+wncJ>UZJ=}F^LGKG{?-ds2bi!6+X1xMDm3mqdS~zWUs+4
zU>IYJd;;Z<+BPWpp_KR%uN6@JvdiY0m>mMu?-*hl-=p-3&(W0(4SBIWY#Yb0C#6jE
zL0n&F&V3inKv($()jYUWwxvG@#wt^Dh*dsKse0PvE5_|j-frmq+k(IM8~hB_-55s*
z$BOUK*Ae4AA-TfqfNkk7g4c%Y`<${H>!Q?x%qZ5Ql<-X+7m|_Jb(VNB1ts>6S3!F+
zAU>_f9>Z`S+TCgJ@qm&!n!uu(9Q`iIA9J5!j_NB^^`lWf9!2PUg;Et=TS_M^BtNUt
zR}-%QcDK2|m#_JXrzPVZ?MVY_l$x+Dgcr3dePXtE*Z}}dywHRUQ);3~-p&q(a6lOB
z$yjvgMZ8w$42t;kQZngyCA+!D?c(}i<XOZOG|$_3$uL5E#cKtGE1LNt9`4Jd62BuZ
ztjc*R+(tMwq~jSz&qR3PI^+D*wSwvsuMZHHP_S5g$?(L?wAcn_swLjF$?OB-2f_}=
zi1S0--`?Ogef`qpK~c+q=5BN?@tS|HZ}a$?`(N1!?t8KGeIQb}_9^2Hn|J!6RmZB5
zJ6{%*lVs9Rc;%E;H>t5tW?s3MsWuBV+_<&lHdhPErN>#MHGiqKnHJY99I+v$<&-0m
z_geEao%W+Fh<BO9BWc39B1uLPMb9_C&URwoVm%!Cf6QL;d?ns1zhI3^#iJd`Djt`3
ze4%vnQgZpLdtcQ?Po=?4#Tow=*Xu3<uu76rP5^$%8WT)<LKp5OoExSJz&S$WqYA)M
z2ygA%%TF`RTg&T56M&ma^VGBmttq&!ZE9`JDgdY2TGfsG%9JbkLGFacw<a}bFSG3y
z3BWJcO4PsO7-P~RRl%g)tMk!KhBL@rZ^nt+En=-TKxg%Fh1y>x;Y7T3d)}C~?3^-f
z9E3Bu8AUyFKfnuG9-ezO4jrbWm**a4K}G_{)USTk?|;j5@7}}KWiv)8Z^XuIKBuoG
z>yKftaTB1}q_h0^H}ZXm&?NHh@x>#Gm#^2d$oZ{DilZdrXyrs#?-S?(Q{8^cxN{GF
zfmv*kq&+t>igp`?cEhNn+gF0J6q;X?z#n74SK)wo0qNfOTVBHZU{kYesE*VWm)hL<
zCb`u2`v*j;g9)0+_%PvbJGJzEu30&j741l0vNVZ%u2mrMsvlJBw008Km3&bjiG3y8
zSFN91d+VmjzA9VV*w=Q|&bI3QoUNwWPA+?DgW<gQGq$#D_cODuTZ0v(SQhJGU24O^
zo|2-~!k(6@f5$P#{;n@sxr|EAU1`dM3Q<%Nwi<V$DGSqYXf$i4yHcPexo@m8{MNlb
z9#3B0;RRn)tljJB#OHgGmz!y)hLZAfEAPTtK7U;=L68(&*EBWayaY*WD|Xl@Tdv>-
zFI=(gn!E|hBS?AjG6sa0TK|q?j4zBgIoJZ-aJ^=n!J7)o*prQDR*txQNB6(F+K>Hn
zUwh%7Ur#$bJ=^D-(!D0%#NG!zd#xL3d_{Ved0&#A<^I?VVDjjh4%a=cjd|!<x~)7~
zVJlbggJt%lQ3=+am7bNVf5$P#5gK=S9C#CqmVIk`d<%_??@sHh3T-jVG#I_dC}01n
zoKqQ6gMl{5V58vn^Lt>O8fr@`)@e0co_rLiu}*1w!8u8dg6sNSt{PHpt?9|c%9Jbk
zK{f=-Vx4(N4I0W!t$)Wc#s(Z~eA~Re#w;I>fx`RKm4l6S%D9L%)*CO^o6Yr?4Y6Kd
zZ)~pB8_m|s&F`L*@_`VMrWuOJ*y?|JGm;dcO9H@3^H&?GLzM*Cp|x0*Fb(zY8WP~X
z+|Ma2Sc>%hDMA9wx+ZIukN^!C5}@(vQP-rdugN`x1hBo!xcckxSK$Ga%fIx#GF<-g
z_e;JOiCz8ov=9M$dzO#@Q`c*ni*HM+d1bgiv<oC7s<g+W8f%WJ`+csJ5hhWpYU|Pz
zp5QIR_94ugDt&@l+jZH;z8p_O>vMzmLsQnT>v@oO?Z>(SOI?egE-?3`eeD{DxTJ&t
ztE|d={W`^67b_%@KHAj=k7Jb;Uy}d1&!sX~-Go^?8rG|yf~#&+V58+PTEy;eGp06E
z)Y7nal@ti&Ib<@?GMTKB(aC=2ey_goh#6nL@k}5Oa{;>ceVFNyF(vVsm}Ma7i~4`w
zQb~)-<~P1nQXuG2_<Bm5lBhr~F*1YaQ&0y?z~l!#O2!mAS1{r6B=n=Ny0SAWIc7qH
z#H~4B3!5V^Aa8&oD)IpvvxJ!b%JPE2oBqk<g_+hwmlqn}U&!hE2q9)&8wK;1Ict(`
z#}b12zV=IO0<tM(gH*k*DI3u9jbx9|F`&%LW|0Y`tW`!PFkrZ?%~>;QB;PRTZ|60e
zwBcCEnmMt!y;qLzR{U*2jGeRS*|Yz8`us^hq1*GK8XW#`M*oOhNAx3GuhRMZBfstr
zyp?fxFmE4q_^hw5;_t@BT3!DQpXPdVwfSF-)kbrDZEd63f^yA9V|C-dMEyP|n)jI?
z<0Hg>O*#{QJSiwQ<^6a1iGoQ8bc0tunv5_F-;Z*=pFJ~}!W*Oo;-&&`E4PYm9ECww
z1S8jP!((xC6O6`@sMLIc-e5NvpAp#7N>ZL!P2k|Rwp{<>`N{s#+eP3_haKZ(ci0<v
zzAHWw`eDN#qwqqU2hsSHzv3`YMHPEHjjMWnaZ{CD`qXPmG}qg%RMoeigsfD_6doeS
zTnUY|;saoOv(3tqFSMe@l=?mK5y2!X|5hCX`Ndkv`1{P^PJmghLit)}((k)yDU7Oq
zH^0~*=zhjheFw&tTWlOUel%dVy5spycx?=@jin^<Pgb@&06w3Ww%^miNiVEb(3{m(
z13Q5k;iAGh1T~Y1U!LQV-F#%bXc-noRH5{#c=algQPgKaTsj^|0l^S3*Mom3q+NI|
zoHNJsjiMazr%}%=Sk6#x(?Ef8nJHd|-Z+K|wxkbmG=Uv}5Ra?UY78bIQ>WmyAbxcR
zBR7mlDx3Jc4KeBz(%{hPa;yYE60LJSyxYNK3_Xb({+$MNTPR?{zr)ZwJ0Ih0&!S03
z)SSTpWS|i6Pc~AioWcXYa++Pt32bZ`A`s^asH=CC0D>kAZ_}eNNBc2G4g`9(JDh)8
zn>)kUcVLOT00lb{dA<GH{>jNd7d2r~-*MPRvc4o(SKesg-931-C92p500et6aa@fy
zeme29U6)u?5XM8a{O_STxfj8f9t%f|$Jc4J8V^TA!9e<lQTpR3J!>c+KB`hgjZf3>
zV`@{y!j(&{1fgdQ3Cbl=zbY56s@~E&oL;9l1w72GU7K(P*9+-1QE1WY2s#j)@GLV8
zKo*U_SE*8!YO%Hf&X6k9zgfDiV)avvP6m|tQrw`n=7Ll9(NT~h6LcP68TVhJGV(@l
z=0MQLQi1(h>xxg6Dm5woP5At&Vx9`O1wA<9^Wq+`K|F4#gS>VnOjX6y!BN5E=*~yR
zl(QgoqftT}fqJgKT-#VbO`}EzFH*a`itXgk6vUG>R>T-&KkYZg&25Yhd9AilZ3!d<
z`fuZs!!`n#&)gHEAT@wcKNYpBnY!j3j2JO@-&nVb|CZ|<8){<{ZQL}*7R()izUgSM
z6~LEBGawaEtOBac<n^7jOi&~iEfs)F=8)Ri=qAxj@x1SRc7-=yObxJjbcJVzedzha
z#?Q2~z<Qol=%NnyMgY}CbRJ9wz(u&6{o3t`(7CLnMvbI80yG&7JUm6UQyDiXu&;rB
zg433lM3RX-*EdO%4EKv{fqOL)H~+8t@Bg>(@BjDl|1E5tzSz3uN@>ohaAL<}XFQ2G
zxSc)&!#<{R_**4Ag$m9RDQQ0lOg<zBhSKn5N?*^Vfeb9Pty9nMqF#A|t(WO_XEOMl
z?J^YF;ByA@sRHldFtH5cj4PMv|LtTj_JGLSM-h&Y$0X{Z55#!UaWd*5Il{)Gkc0f>
zH}N|ZwGVgzr^gxJGl;sVHOh?qy%R=wEd6T|K!JIYLk;RQr#8IB>Oz7vuh_Is5K5w;
z8+v~q9ew)5GlE|Q-Dyj4=MKl%)VQcKE@5^SmtBa17U4n?1Ci6t8(9txlgSVm%jeNz
z9`fVllMQgkrl6rum8*&|W=1+G3u5SV)e?Mh#ii?oy=4&N#u_bl*o}W4FynL(LuSKL
zefOwSY-WNAb<|ozCwK2Zm&)Sh-9S;!^0XJ))JbkZ&(kPvW$bi5jinF+2Vd^i!E#B#
zPkutupquFsD5kgw1SErxM1)~LY1&&b^dsco2Tn9j(7hi9L*i=7AybB#uDIRvfR1Rj
z5P3L;bMQ-IS>8ZNCzlm|iMRe}3d@zG!gSJTVb!aup=r}f#$_YM)C3@fJ5HL+%v)ok
zzt#rVhj6DoUVdlmUEb5?)=QPy)cOz}d0*3ZkjpY{C!<o~FV(HB@c^YZyo5txr%kGo
zHra6W0yn}WA5vd0P7aRkv)n%ZO<=vy?T+cKKFtMj43L_P#P~9xF2oUbL1rS+in;5$
z1DNASlrsd%K|$ZWa=R0{H8Pb?Q8)BPAV=|q!Z}NHKc*&tmkSl68cw4jKB8eu+qrPO
z0k+&`!E|e@<3z6dj=u@XPBRTO@6-TvkCTFZOOvh2nN)dbpE6pV%JKdQq5>WDqEbUx
zH=2!?P55_Xr4Ii!wy1KmBL14{t69)j)7BR>{^s2;(9H{^1yct@rL;~L#9Lh72o*q`
zV0_NYO$#l~oeP((e?as^Y;=8f4U8Yuw6{T+1XjoId89E~tK<KsF!@m$+^}lsV-$2h
z!$d1FC@K<=r?;%q7k~Y0Y8oY5XsQ+x!PIsqgCTcB<uwJ~L4^W`UP@!R?Y3q?9HH_7
zxJ1}OWzG^q^OBu0Ztkwo)<<phJks=kky}Nf9(8EyM2xbOvZBlgV8K%wMRT<LGNC-R
z8ZpGZ8h3&8@+N8QwwQ3f3xw0{dOa8uv_0{$DHQC2e&LAiT}QHO^fFq-$PDr=j5t#@
zQ<nQql{ROd6o}8m?d`l%Q*SRWuJ<_Y98CnH;^k9Thea^?fT!rt^Bs6`TVU03vxEkC
z(4W)sQTaL;Trb_SU5AFz+X98}0SP{wok>oXlx;}=<AIWnZ4d=?LE&DF;N;N6pfW>;
zrU3czSF<wb(2L;wt+Tad#`@>uY!ekMAM-eru-9p$fhOsdHR45gp}mfI&jCydYQFuR
zdxZm##-3;V=2SE^f!;QIX-ql_Mw0>T8POoy65=ND>uEj)he)-n&<UA6z+XUG_yQvj
zZBOv_q|bJ^9=Qc_a<)mg>qZgcu&i%|9`}WCq0Y=Qp-YNub3B<U#gHI2j1(C)*u!X`
z3;5S4Mji>i(3P&p5ikWgHDEC%f}}gi>;+NTgE8aj;P~QbZ^z_5_q^zH4LP%(7{V6G
z${5maO^#4A|3!|y23Yoa0PwCw*M1kRi{t7!X!tDMH`cy~uCLuF1F9M7*8ne^Yf+y*
z{tR@FF>4>12UM*4OFc0*1#XEg(a?bbYv6U!nA^VKRO{nFT4fk_5VV0J7{%$Sp>P{H
zV*qN7Y7nn&x0<)<Cg7K>CMru?&5Er-L2yNcq8;a`!<KCwX6;U%U8?OH=oaJWqz-y3
zWrI~Tsao3N00e>>mh!reMz^iZbR8j_W~Zg~h9Wu905)WOYYEucvHL3UQRH2sjYxMt
z+AU2!GaTFUiFjy0TYGfS!+3l+>2-cMAxuFiZg74cS>jYZ@e_`i%)3D1_fl8hOn?wz
zHKe}ug*eb!)w4A}H%zpaH#Z3wS>uxVK!UP0-F{2;Ze)i`o*mXWoVeO{gy!+!|LhG0
zVtftk1}$d#Kr*dOiVS&gmX6sVk7{r(Pq}^oyc`xvRCZ+%q{euSs<89x&}1n6-O^(m
zJ0sSO0pa%^opqsei9}-@bb~>f$?Fb#k!ifs#z!d&9(>eJY<Q>=8Sx|}os7)la%^|8
zD=#A=U^Kd8v3XjqI4ZknFU7jMX<I*c?-zGORm`4B*QHBvV4__jDvA`qQn(<@RIVzb
ziTs|v>*pq5(+2{Z@48kvnzcqVJskB-8qdh)O(q!eA$^LlTtnsUc0aOG4*kJqv(|T9
zCy%GT;Wd_Qo_)nqBxxIn8~GNDC36h>WeNTb!e~p>mx$Q7@U_{fH>YvPG}l;3^0h6b
z|J<Lc_WyK9;P?4G01EB@8;!NK#(LWRf4xzEvj2aK4{^5`s|Gh9?`AX<f+vdSjvYji
z!yTzJ2@6PSK!l5}M`NQwY4)cK1zC16__wNJyOrfB>O-ym2E=Up?)WkYKPQd^B;_I_
z#l~}W$!49JFG)G8N|3Ex>OC8r@_RDCOTEW=%GYdzCJPt?O$!3d!`KF9mdF`hs!(=_
z8soGZp99DS%8or>1Yr+t9WYrtN=v|FlZQaS_76M19B==9Uuy;yHI(V$qkuJpSdIZ4
zx<kkF$u1oqo+C$mPWK5YjU+ckRoVSi_H4Eqk|D!0NuT)#z$^!K5aC#8WQrUD&{i<;
zlPM&#^7{BRbhU=i2E-3UX9C!UHB<v$gvRq{XHXh>7h;*6C?I!c;SBLW)FIfXiW)Q+
zc<HIB*4Om89MkOtcCOC^_a*>gWhK)n{R=%-bv&wS_>wfvp5(_=&BY@;N)|B9_}K4y
zNdC`SHJjqtQrzg0_$Wsi1_Srh<ngSs7=BnDJ5n-O;If50jW~^QB`l{G#Lfga&}U;`
zOnB|^I>_~VT45{$JHQKi9*8Y`qs(@wZa;LR^OTIWB2LcJV%&l<9_j%L(;e%Wl-(iH
z^L^mDBlJzNE*9$H<!Dut5_NhL0{lHKV}|%w6UtXvI+1;L6X_9e3}A9^w~tTukCrNP
zEwFNcuud?4efi&_gTg!@w(|~$?Sg}0JMT~^r1?8V<bG!grQazc@)9Xfe(_-pe%FP0
zfe6o=45+|P8Ud=?35AedSGkLFcw$8pshWqjX<vhYj9w2n)X}Z@>tCl3h?^xzo}i)6
z?TGANwk9Lg+dz|KS)kFr*~rGOgBlwQXhE16g9$j<K+|+gCmRgvH}7_jcK-SL;Bfmy
zAJekh;fT4ELf*v-GB3<*z(fTm8e;z+2-4Jh6g)fE{XyW!a`lylQAGKzrD~dy1_5wP
zNqXLyOMV2^9rH>4B!AgI!8>Vfeikf}hZm4QcZ^Gx^PYrr6&!^6Hw*5REU3Xvx3S4i
zoCMRjEZ(VSD&(paZO9E%QIalUHCa&2f`M{4mk!zGz`;Fo&hYBC$ayF|rFcFU&KDfc
zsbNoa_c=kcGtCLdb2jIs)SmA;gF*DFwT#;wr1}t%h$dRyJ}s!HmzJQ_D`b#)=ji?6
z`-Ar%j(;^bEJeVH^&;dQ3dK1Bl^&K%eWsy2adFCRt=)4`&jBsB(=?yjf`XlJ6pRLB
zAm)e;@O*lKP^dSha5s-IXNUl-bv_*+@D;E7Tjo(v*`;*iWFyq`(6<bwJZ^N$()Ztw
zvwhEuE)5f15*U_8ngLPgxp0OI^5{M@dPww8tKSukoafD)=dB_%>xy0q&F=do`D)9i
zJetTOjLa2o25uiZLht7EQW=GT3n(axA6DS+9K1dJ`@VQyjk{PDRoTMgY?P&9>4cVR
z3JR&uET|N>ji|sNL~4`FBA!GFHPk1c5~<HD6iI#NpiJtMOQF=~F(_3$80*tATOf<h
z`7M;&Iy|1cqpwEfz6Pe|5x?yF=9KrXX*&T4V)>nrLoDOhcOjaoM!pK>*#F9&jR$Zx
z8o5kS<`Z31Cc4X<OF=9&S2tR=5GylrNCOx#S;p4I-%xFXBvl3k*<pWQc_VC8T@WWI
z?d`CLC$%ad?r!JF!G0ighj@CslSs)@A5h)CFDZHF{-xxduOcO<!2TX_%N@AVR@9fu
zpb8mJa@0uDu%Z@CHMx>%<4s?gS0jmrHIBw;8{v${aALE$wmv{OY~3H=JqQA+h8);!
zq*Ly=<4f1&d7(9{sv51N@qxWH5Z~~K?Ake{XY(UKsWZ=t2T)VGgz#>tH5hehoOaZK
zb_=R}i#-2qDm<2nhu6xrdWsrODavr2ge)LcHs?wot!M?%%D$e1N_`?Km5f*1aD@zs
zJU-a|`~Kl;)q$4U8Mm(Btt%?M;L^_o1qsCv-H+0`4@rzj3s`IDp&{U}L=TzNNYjJV
zYjiQuXJVr*IKHLK<WRj$(2}$BhC`s|Ao~xl(K(jS0ote)MK-1bl4+pD@Qb!^n1(Mt
z)K^b4EI=E^h%Kq*>SO?XrVvLT0pO5zs``p0F2Ivfc1~Fc>g_{~44UkpsGBH>c@~hy
zs+H_KVC9oNfcl_v3Lz_P3I))J7%)sKpvjpCg`AJN$B^cOiEapA&Z=*HeE>rE_Q8Py
zjlyU<ILNvccqZcw1>)J-QrVuMA`^48!ZGJZXVgb(sn@|w+NbzeUHzdiXI<1YV?8=N
z*vHF234oB?$`oEGt5kW~TR0;O;z4~AcVG?-xH|95r>Hr+`GS5wzKD*DvNCkXO_j>w
zI?8=u)2=`<+0xIVZZ8m9_wwCOL>^X+TkH4~k0XmBhoj#@>X+7hk;I+b2d0-0KfMxi
zqy@;L7C>E1GyM54cr5R!$R^l=LE0jeS%Kn-Q4b|187~s!Ma~-OZDQegCb!n(Qz<xx
zy@9v^?)KV^)m7?Mgs*@N=lI*vr8DYvjBBguC$J8;Vyg!HlrsRR!jNaLrmO&RhE;IE
zmMUn!+|vt6#J({XDxdF2@Mkn~k@evE1%N8o-t29bZ+E`7@ncvMGb1w^#D)uzP^Ke}
z3eNakii?fa#^Q2va`4)|LTp%$na<=fAa9;#LVXq_*F`=ncpDBi;rxLE75IOz$5;P2
zT+^t9CV(CQaK>Zc`H|+|W(BCrU9`E2I*M!v;?5a{|A4t)waM}^*BC==N_Ql~5vfF1
zjoG_uH0JE9IY(d3Is0m<zSz}`)-S)Cmov4!I#b)L#ceYav4)ltf0IE+(S(WukFvEZ
zdBaYI>|dj>?9yeH^=NNLjL7d;+Fil#&spuA{z0dF*pf=RP!0%Wvy$Zl(jUv&oJ&+0
zGEs^aPiwJp?=3d(y+xSybOWgwCw;#SHp?_P1y6og*ofg=iLRYv_7B+u*)AayK-w90
z7_zIklNOoxAh8N-y+8cBQs(fmR;KR5(8VacYdP9e^^xIzt5mw^fYO^LSr>Wd7P~x6
zt%M>$DK{#5*swipW*n}n)OVRN<EH~l@Of&<sh1tbtk7eD!CbTJ&eNYnt2K2Xg(ZsL
zk^sizvPEpReaJgNRG0w<(RJ&XQJ4MELX24gM>+C-=V9Q3aMmkEV9ULT{*gO|2(;WJ
zPWQ7PTmo}^M!do`nS%0K11+D@+NDdyBeuPTM)!7(-~9JJ>CpD}cRu_g_TK!me|!Q$
zA#6~X)Rgu}zV5hPXA-&6niNr&n5U?C>&>JFNPl9TwS|nb4!d=l5=d;y$kNR=9;Vr5
zZnMQmQ+D%7^#^yx3Tw@A5~CQ<K8s_L-w{`j$H9n5FR?Mi;1p9|D4%8Bbhh<w)r)D(
z)av$YJfphKuj#zv+%;FH!8nPD1M>3_b411LmNdPdA{o%W(|Qb}HiolSC{f&hylI1e
z)Ruy=l&~`!@tzuL+*d=*(`m5X#bjRcHlUbi<=_ukPJA@&ql+$4v$gA13N}wm4J*-_
zr=_NqPL*#dRt`x3!MRi~`6(uQ>4t$~%CB=*Y|LA+nP1WRCi^h|UYq|dZ!n&(<C>~!
znyO-&a&e{Z;AEOQFVdKxm>fyoS@RUZWR0kD<_Kb*FKRm<j{hkgB`jJzn<k@_sNBj?
zlocujGd?hbi9;?hwE?g<<BX^<yMGIQG+`+5S^^2Eqqw;{T$;o;`kGJ66dt3b55&w&
zMCLO7cQXqLSweh{S<=KEEFymw<R<Z8PBkKL+i7|xo0(`o(jCX#iPP~0-uPO{i816Q
z!m^U2bItvqrCN!xmX#(54RllX2#pggUa?__dx3t+xZ>Wc#&Rnrd!iQz7cYP^V@?5!
zO!i`p4W0f&V*}!NQcX~dcDWO6plTL@Du<CP;$Sk3`IBLX4PEdC^bS~UJ!sihf#Ey1
z_3&O|F#v0ihGVgHhN4&~A#wjD%mnz>hX;i{M4~?dL?QNsq8CVA5o>|@k^_3`V)D`m
zaLJnAH2<<=Dp{N6T56WbzigQ5VwxTFe3vr!b4QXw#P{fiW~{WJr8cj+9d)^os(p#(
zL2N&O8=fL5@ST3@s@y~SB;65}q6lC;QU{T)KVTas(bSTN;m1JaI0O=IQQ2B5DU`V-
z^a^S?tn8k8b=B*j7!(3d;wJQi3`IzmEd~%y3FZD6oAazXX7{lzT}uT%nR0?#G_<_y
z3g#K#iwBnoA93dX|JnQZy*AD)ZycR}f4Yhq>={E^5(w~#H_6)=u+0PmFW^pR(*Dqe
zR6w;Ql}05QlXT{@Z)4xczJYxw`%3ouuETREl{h#~(mii9)3H!hJ@p*cvz~SQuHj6+
zF%bovGFe*Yw5nc@!g(;rd%WW-Z|JNHO5|;VcAD~%RYAC77{gWSFSz0DbJ05kkVgxs
zXF;}c4KKfAnr<+2_ZDTYYDF3GbRoN*Q!vqm-r4O3z&!q6A_f6#N3Aj6@7#ySyEI*a
zO1fb4EOk;F6iBk0MVC-eNuk($oCr@hYnhHX43nu)iU241S;~ic($G<ZrapZOJg#&W
zt8uO@$->H}6NFARWgwtwA|5Hi2ed~PE*8z@Bbb_4yld?8QaeqXp%`XMpFo{6lxYe6
zj$TL%QW&^o5urnj-;(sk#c1i1sfKyyzkWs3gXy=rF|Aw-rodS%|MJ!1_kZcV`(o)Q
zCrL1;#<fw}&ECD^uV4LJ?_NShh2VH(cP6l_>=9QG0%0kI#<E)!)E)1PPPJJ<@p3fh
zbHd}JYvy3Zb9CZ4!K)q=Z04MG%)qu5vjUPR7cnuPzLc{JVC845hiBIJ*!85Fjq{6q
zNR!SC`wDfQv{-xZh6S>7U4yq)!y|b{Zj7Wu-XMw>k@h}8Ff;-72GLM&xkWg%yKWE<
z|4}8siu7Vr^6SelGh$Zsfc5K6g3B$hy8L0*PEpf--EFgt^{$8MAn&&5?mP5({@o9f
zlkqjC{oFWGBx@;KDWNM$qyqo7Ov-V$z)mP<C_oO}@4K9VLG;vpPfTJ!t>-F6#YE#!
z)!qxL+WX|oWX&+u-q$$*>v7oT!m!y#(az}wBxIaE%ohNjKN{n)$>NxZaB=Ai7T1=3
znwM=PY5G5}4eNxsl%<Ur_-%7uqulJgb}y~r%e1^aErEl5$ClA(lC0eM-aB=Gm9e`I
zjr;If=Ale`J(=Kaa_?!lOPlu`*^Qn3!5aP{?5#8;jr?@SX}R-DtoxtxlG}zODPwpQ
z!lOUe>{nX-eDm)Z$=`&L{4HW6f4eF8V4Qq(G{JVhh2#s)o>@rC-nmwG>#VM=-zOK8
z8od}7(^1l;7AINM`oiFvuQ9`@cf!)+5J;qnS4RhL596mci5F+d*1_BTlcbXzpB(LM
zzB!Iw^7XAQk?2p0me0m#ML82AjSnUlacFlw4eX)bRP=gX)rV-LMY=G~mf0s5X>$Q5
zn8>!p`{bc(fpq)DlY{Mp4VEkbg9$xjX?9^g;qaP~Oz)-I8;pq*<z&?gR=iXBp;d9S
z{tV-bNd)@uear|>Q3=PB0$gOA7t@l2yL>pA6#@XtH$W-nYQT`v45A&!5?CMK4`Xvo
zbalu5L%aXRQ@>&a31rOM%^>ppw6yE6u1fs_XH2yA*nB8;SS7-e3$xC%C)x~g`he55
zu<Qd`#Pot!9w6d-s%mV%;6#yZP>ip?Son!C6NN%pk*;yZ$8=?m<FR<|Yeor9#vTp&
z!U`YhM_{4FK(WOFi^=<nm<VbJOt_;yY3GSV4CaGu=4ImGm}S+ESz@Z`Tb2IqrYhSk
z+^Q~Xt2M8_(;9IBcubcBq2*kj;0xl`U%afX>3}Q8^8I|;=b+vklb!kSG~QwHI(O!*
z^9=u0$YFGQ_JmQYIGw;o7Ewh_V91RmRM(GxjbkL|Pt8N?!`$#kHk4KN7`%(5r=-II
zu#4VzQ`>;8_H1@!^^SS;aN|SFujrKL|I8Tyn|6>pkkQWQayBzfUjBozle4t@9xMgm
zkc=nE3CwJeBAQw3Jb5pdh`Qlk%zvoZ_htrCITW=07M`^2)_Jn_Y(4oy@-UyHoLFN~
z!l!*^3F>}kC46d3OG4XoDB(8q68Gz-$h&))nPx}%Q{B<^k0S1{Woky&xd|od0d<a{
z64|(Hw&zc>8^<qTOW6Z9;M1|r2SF*`aT>>zzYQ{C58YBC%{j(AB|4YGG@m>wMdqb3
zEHxNQnA$q+j;5#f+>h+U=M&gw9_x{OZ-oyc!`OM=qi^3Q0y6BL94E2;j4c{;o1zWV
zL!Fh?_28zB4TB!ed$mtW6_bbjXK;x8uLq%%{cm(U!rw@DBFg5BJqv&+n9|`C3WaD{
zrtAB}crG{HS*!HCti8*+&Q%|hcS%U2GhxzQ#&Mt{h{m^!Ip5%l4+{;yu58fLR|!ea
zlJYoXD2VSRBle-*{!oVTQ2u%+^Z`TLl=PZ^n>yn7H@Sf($q|JEVYn)YYEqba86`sK
zLfc^4nBpiV*^q@fj@IxISlr#y32#6tl1LN<s!q1{zBxVF`bK(>P7OaGqKwo8i+-{7
zLI=BPzY9Qljd$U-*SQz2nk>5G5xaKf9c^46tjAqjdACH`VXv6d-dlVa^lT|v76$lJ
z;)B1Yar05@otoA=@1n=c8y;V+d3-f~d^Dw*O@h(sN-h(P;R{C6sq}bMR-Y+ve5OJ&
z^2&$O3X=-a3UfDa2JW4)<|fkAOtK(wv~nb|5^sWUindw*oKBnTpC7MxKST5VQ&2xc
zJYaAGaWK1{_l&|38<7o*>BXh6EydraDRsGwm|y0Q>^40k`Gf(haf8BNOBv0xDFppe
z8|JVB=HP;?!pUklDsW=!C~0TY(l@29hI(jN+JXxQ2t^srqS(bQNfBH;Fw?>`fgETt
zVdLz-ricnQ9Ag7^NEU?{h}$y$b2YkSDO#zTxQ-QtTy;?zcXk^vCe3&{9C9VgVX~JG
zryrYcG|J6nhcB1LZWOh6R8U(uop+ZHBn{Q)ZMcOlN>|{Nnc5U}-hK)QL0)kxOhESI
zLwe||uaX7s4Jj7?o8+wx6Z$R5JMH&RdFvnvoPEmTfyPn^obqg>soS0p-P108m;ch0
zvE5r2N9rD^rb!3aPSbu)l=Wj(nh^$83<L6T5rBM@IMPm$ybE&0&Hkn{ai7O8zH@%I
z>-sGj&(-^NIG;7I`>uVtdw=FAHfA}gcgy+vSf*311DWq{)3UNug-yS#3^NaYN+KLJ
z6+%VU`UHvxQ9}0BB>)oQxFE+ZNSit<rb9)Ax&edk?glyg1nRLa!matTH4ekOwpQV<
z9my$PU3o9e6;p}d26=Z}C{tA{4)KOzIgjVwsT+5(AKtC8&fOZDv+8wbz4GpMJ!#|@
zvhCsX^UQkBINr8??5u-^O#UV(MIaeC6=;D){pE*VVpztt`DtcxBY+E3jqLlXiuSPb
zuK77B&eDDw>K1b~WPIjix+yKBn$Qrk1C|$6Zef-(Hl{zPC5B-Y=pkW2s-7AxtZ)Q8
zjz-Cf?)e;Nc}=~E#)ZGn8-X*wYTB5xMhF)SY^PPkt#Fuxl}oEi;q_^qCbqDF+#S*L
zdJ#lQ`a?V$X~4glT1~sh`Tr>#bhUnQnW~)(0a=9|hkyTj690;Gd<G#b{IE>K*1W11
zJg>9WL$Hq@V8eb`xzd@J_Ezu9yX%lZPxl!TAlyFNm{#WH1m1N_R%zp=0nF2htPIKg
zoKDsQuF|0u5h|`i>47T}vHL-A{l;8RkEjpfSp`H15d%rM4c~W%iEbV5zB)cRIK118
z2RR${Q+eAV28pFh?29)(YMI}Brrakv8wS)>yx{cg0`|Mpe0WOy{{ngogLBR4^WAWh
zeaF?ZI<Z>w^Ss`3rXmcoOfCxI*XnKJV7^o`*lFxd<N)=H;(b_zO3zp0lXjTjV^`ip
zy>pK8RUGBpp?Sj8&!!Y=cSuC^qEXgsGG%GE-^;93oIG<djPJS?hsEa}M^D6c5m)%A
z!;wm=ygwi$8g@GRyhCB0_zB$qGmf$IOONp`ob#6Pgte5YHKhDFvRiZ>vZcHA`yXZg
z@OcoRd-<Hk>KV|q;yL`<bUaS4f8kS6`Zms>KS5W$<59A8uzzy<QF1rtNb~(@BD!*#
zoJ~t+ha=*dqRT+to+R0*AX39>epVfVM8VG`{Nt^sq`!`ki>zj<iWbm%=rx2n{>n=K
zU_SnS)<5vDR(p9kJE%LoM6L6t&<3x*foLKfYTolVpeo$%c?>_|9@N?0NFIiheKVYh
zJgJ+HN4nv<IK3T>BznAzA1`lye17ge2N%%bhs7x@w8QRo^6&qiEZ$kRp8eTa@6v4(
z>97W(wf{1CdRK6RXw7ea?q^QGkofStBlDBT*?IhF<Gks)`YUspACY{1el7kA@m-*(
za6YML^=8brQ?Sa}=TAe3>f|9PKMmLEb7DGuGM-aisKu?NR`Bsi1ukmvo_I)i!a`CF
zA{G)p5eexA6r>QHr?R*%dt8oF0FB<z%nd2?;pbBd+~DIg=`|mTcCTN7Dya0#1l)bb
zeO`S$BIkCWP0A_F*i;mvU2}ojPh5_>0s4G8m`?=c<0tS=&;BAXIroOh`6OJLibF08
z))fu?ECbijct{3?p>Nn`=9GINwWwSZ9`vJH^*Qq3bg?~QE`^sy8_KP&WvTb4y(Iep
znsWwI=g^0xM(cQRKT)PnyQ!^(uVj9CIUQcKnLvX$RJi_yeek%{0<7Ve7{N#*c<zy>
zcXMjoozmiN_1;%+s`23C^UK!6_Ew-@ELtG!(p`M+^M)`tUGMfx$6L}a?Y8;m>xzW`
zGm-;qo}BgT&7ws7j5z+E;WDc?3#@#)GfR7;9$-u3&0I-mZ1C#-hX1zWpNZO><7Ih}
zl)0iRqp^d7H^N-#+`}1n4f6$`o%pr%d}xL$V75EuOR`5<|8;*>UBiI^;Cb>ee)h(d
z8KvT1DZtEfbw&zjWGMya;fgc-{`uN>wg=ymzI|8w?|n}!J}~%n==QU8I34*jYIj(h
z8_Y2_nl+UM&)c*fZNF$n)t#i<Mq@JTZGFeLI0w-lhki~jiS)R!#q-`$)1PP-px^?P
zN~LHy`vUKvoPBJlS){`*pQyMy&MtBgch+07cOM|U{VFfBreImHMs=l}c3Ng06aTzt
zeL*7{?O+U<*Jp8*4)g9()3gUW=7ZLD4iEPBPPb0>PTw4CE6_x*(mOi={3xhNde?bR
zP6R`wh=wgDsP3fy`<XlU%)QH@+f;0y;tHYKy80i8Iwk<a$VMU4U~`}y(YysD_T`rI
zv=*{v_7ML4(EcBC`rd209x&uy;!7(P#!r=n8pjDl_9`W~N=x%5#j<*Qs}{ATA_699
z-l<m;V)G*HzDL?CbsSB)z))=mPDI-1cac-P?cIwZY)Yyf=qQAQnZXe8WW(iyRbufj
z4%!+&xpR(B9WGlrh9zkXKZQTvC4w>KBXC^wrd`zKA-W@SKpD_$jF1@v_|0lE9p>(E
zD>Go3O&9@>h~~l5)s@Hh<<UBl&K&?uI(I`b>D<Dp-EBV$<W5^zy^WdJeRqI6akt)H
z4#?el!x(NKhqZP)Y)gFSEn}(NeDi4VdFY7XQ-T5?x~2G}D8Tz#+3sE()s1SlM(R9R
z`Fl6MdRqZjeD09e_9=x}x#>B{u5-)n)<(Xf>aNHH5?wm$&Ye>S6(2P=xe4J@<O<Ao
zItrrdxZzxbwa;_n=Vx?M#5}X6ZEk==i34LMi|OIvZ2@&*p(!up&W`uKDWkPC9<#-V
z5&Ns1Vu%L6!3OwTG#b=<=3la2jp4Y4Aj6}VPcccM&Uy%?QMGNX@j=6aPPpvjNW2Cv
z@S(;zQh{ibN}VpPm!3Jr)9-3R((0dd+#+~(HlpgrXIJMxJ6~=7@f%jqocis8+@V||
zA!YzkgoU463Zam)N3Zx)5Zn1D{jF!N6u`Oh#Qmo@?>-T9D$E(DXCBU`qu1qCzta2#
zT|;Jn-GWuEa<Q|5bh>gj*!Vu`-7J;fP1_yLx;<+i#OsoUh1qTWP|4~3Ww0J9A$>x<
zs{q!WX${jlYvjY{zHD{zduU=enA18-^Q4BwDqaG=TblU-=tha+3$MI;_wyU+P$Qqj
zzN;2Kp1?bD@MBr)Ah2ArH|ya#s-!UlF7vEMmYU`2zUT~}!O}g6)Hg*^pdG^i+Z%+F
znJZSz_O`X1Kj_u_4SMyigAPV~7uxNxPCFl4VgB$w6=^|o%HKz)(;ca0_uTyOAK0Qr
z;uy^sQhSSdt?$l&o@4y8um3feQ1!{*Ig9(;m$TF_!mW(rj$6w`@BbV=P<>Q0blu^v
zNE_6Ll55x3570|_|ME}wVa2gkaumQaWYlt5LbX_TSQbN6Yn)xQC*A%hz5`;*lPBx=
zxAXMzO8756kJndL{-v|tS$*>O@zd2cx^K0!`uNGeBrBhFq;oz~&~K9b%k*qIoJ?=H
z@0RQTq#xqnT%CFC+4JY{9GR^jq|k1V1QxjGNFB_FQtAbjM$K+fZkUkY`dUwL`?A^)
zumNJ8B)v_GX$c!As$xpY2dS}E(P*5WpXXhuJ(>i}_TB(xK$^b>!nQ%7XW6iOIY`Iv
z+sUTr{V;FC*~f87F2q5+Fr~8$Py-p#i>{z{w&&D=5-JxRYF4YM*K-~uTYPMZUWVW$
z*i=pj<ppt_>gRva?K=YD6F{|z6~=7f4cF4JIEA~orX6W%o1M(;Qic%(6QT8YIK9vJ
z$k2sW>w9!kOsE&Em|8|LKU)W{>5zT@R#h~Q79aj?Npvs?2w!PE{M)-)+wu_~xb^qX
znwXFHM6SPk*3x`*IvwU8C4i;=8GqeB$pPAK<!ERU3caVfNE@@QsO5LTn7$IjaW<Kb
zX7Ltb`BKC%FB<V9;zmC_{%(J3HF;3kej6B)cc0_)@Mw`l2PeSjRIV)HE6>x)Qh4v`
zJ?^Co5-Cvt{?uKWEBaJrA7>ijF3y^$__STXa4JGe@ZjqG9+X!FF_)dXTUO&+{DEC3
z=0uQVVtjE+X*n{|#f8er@2BxbG`G%5kaaEtxZC|d`7PbO?)J0O*%a(qcqiP=OjF$C
z9N1EhyUP`JnzS(e;ohNPw1%#*d(x7+H<FBedJ5RbQ($PHCSNDZz3jvC5O%wNmzN4J
z?^HNMeZEN4<<`UM$bPD9QfuUEkDA6f!9P{1EaPUurX;S_UU^(K@Z7TR-iyV0>@xwY
z;3vWARV~Uj%3@VY{9Ik+vpDPB(#h3N?_{iJ%kOb?l%p;o&ly(gnyQCuo{!gzmS#rt
zz3i~KU>OHn3oD3zuThR_@6+d3mu{?gHe1G<Pl>u7)!$WpZ~a|2_QEa4EQH@(juTDC
zpv_hyHfY$r4k_l&oPM!(6}W8N>?mh+)WzC0(5I`T_b1d1-1@|oy?4T>7$a(GlU2Dk
z>1#jzGiq#~_fxC?=~Vs<l`s0-tp7b;TUl9;^}o)Or}WS7`rohcd62vTC|}Dtp_!4K
zLsY#gNZTU)=|n?XrZ|3~0FHZ{R3f(?XHf03KFhjCpr&N2KgAIv{=U(;_>lKVy?H>w
zWl0)dHyugUP#`t3ZGV(rG4Pt8NhyBXJ`2qKKD8{ZF1uGzQ=Uc}4;oO#M%NOYv$(ZH
z>P}}pIZpc@Qq&TnZzN>(^U<iFH%#(z_QM}92E;zv-C|(FD~t2V6#{nh((;6Rq%iap
zs^!J;cCwduvtgOFsT&f_xpi>(-R}M?iKwT6P+MF^6b{(&fF%@CI7cMXA)6Jbcc?*f
z((NbD+K)*SMLKP_e>xgx-JEsq&eKL&Oo5=>ZZDV95kz&7*RT_7u1zO2iuy~UuFkp0
z$~`V|CtQANvSNRy{fjZY_V&Z1U%KxjgruGp!&3n!wV!*W;-7NZulva&xGQ&xJK5i*
zt9t5L_>Vv7H3@5|xp2`h&eHy=%Fpg+*A|hQ7T@G}$EZ1fZEfZnem<32X+V_KYiuT7
z=&U|%uh9Q>7W8Kt?E9>DdfqEfnFhY+{|>SEeF*Rilfh`&-_)LboGiSvS<HJF4(s9H
zDmptGDkhh_6-2$axg~itxLMQZQw3NDpnk%)#7~W<!&9~bqd|Ro7xvU)0to)=rhsHI
z(@)%uBOvsThnxpVEf57m95d{~ZZDxh{p29P713BakacOlNjA?pg7`FIK<+t|<a=sT
zV&s(1XvBzYai!F8QB3q%wsCX>g?5Le&#C4Elq1?S=Q%SZWn5N*SPS&I8_uqiM-Y4;
zH3d1WA(=_amwKv$nW+Rz*rx6vI!CNXhr8R>wv~erL|aJ1jy97YS-7TI0I*}yJ-<Lp
zA>#2vzJa8j1tztHsvTuCzTijoMCM^My!;b4VT68bE6Ooz<tRlKemg|A?9k67-qKzO
zrAyZ0#^Zp>|5ngR@X&@!*FfFx{9rv3ndzZZM;)7KwI*X?lPxI-SAKPkh|m_el?t%s
zSH!*K|DnU$gKfG6H(nN3ElwbY6!X=vu-_D!6ZtviM1IG1Y_ZMoD-Jk`+I{$=PTx<-
zLtVjS_3N)0UYY;+_jmO(8ISAJ+T{N#!tO(8RZR59I2<|r2^$2brJc97T+JBmOK4q5
zl#kXbje7nkjP6H9SN;*!Prigdg`q9@u#!3*?jb)v*Dxrt8HoNmO+OIN$KuF)ANnpl
zoaMY;@p*u<6mUm;)YcZ6W3eED4xQ{BlYYy>#!~!hzB|m0+cG1z=Tj2a4cSKLC&u$O
z+Fp3b)ArNp!yo_llUE`Pj8nO@Z3TBd1bZD1lGga#-Q$&Pp5?)N`rS7WboyIHvx{N`
z^~7T~6?NBWt8RNT-)Q5}iczJq-a}sUs-}f2T@tWp_axOPjHII{v^&Z7g5qvHOaI{C
zUaQm1dG0EBtP%I0C6j80rIrR7TA-^fAv64U;ilU{vn}zT8}C(`o4v0}uzJKY!6JCw
zT@<SfM{=hj8PCke=;!aE$^djeZkmwqMS#`8X5&eV7vkSa<!kh_37B1KCHa1I)q6MZ
zg;8UOX`0&>UA#|QGKcf}Cs*&=KW($Vo7&_(yV<*JvFX38X;Fmx-sQczn9dz?dWYdI
zAajBwO?5vl+`J`c=_Vo@&&h%t!Ohys#(Wm)ZlOMK_vv4jiUXdv+3STqvVh<Dd?<qp
z5nc{}kcV=H&FT9?cVkV@dwEx)jecZaNwURH*iRJ=W8SPh6b4IA)y;|)p`bfMw*C@D
zZ;37N*#I9NLpBUDhIO#~cdpKoO5if*QpW6_1cmW+6b2=>_a7hfmAZ&dC!lzNKm<yE
zPAJQrDf%kl56XX_yT>pttRcuIJ|!kZLYdQ*gksQ9NmH$hw-g28*h2iIQx8bQNcGs4
zHbif1hV_JI!%kQfk;!SzMz((*u_SEmmUAwgq59J*nuOa=t!N~lZzz=>%snIUxiLuS
z7KY*4nE55xDtCI>-H2xP&0cO}75w2SpAAf#HTZ`fl2EFg*%!!mz~+wRlz4AERD;4T
zJ44g`<_dMnJL{YY%vg{r#(8qHsBY<5!4VB=EK%RVxFGTwls?wh&FKbb$XPuB)V#kw
z^O`niLfYn(a149xLjANIqAuuc>I-|%*@}nyA`!deND;|$sm$L>BKs;x|K*#<nZ<E>
zHsIIZWO{E}`krf={3V`E;+P<i%Fpt4?M3AY&#o#LO!R97d#iE}_gi}JFPL^n6UZtZ
z(k8p(w7g_<SWpT@T&HHf`SFXRo$cM@1ejGvJBJ5HC&}^2=F!O)Ke-2}CEx+lIhTB~
z98r^<uLxUs$hTFhH1&+<(Zx6ngAG5)%&GJ}!^1qJ2a&b;F8R8K;AN+T(Tfk`F+JpG
z=bs>d8GiA_7o_RY<iIb=X9jmCm!2kcxxRX++}4@1<*joM`L?<5=kC=XNM`h$%TwgP
z^-B{OS8iJxu6)QRf*DD~`dZ2iOvcl!q66ZIfBmXP@pCl^<B6yp&rcO9%?-H?yT{wW
zq7o>hGHH!?e{tEXXkpb3vQlqu(W{-xOHskj%QpVa;Y-=j%J1Y$50d?&hgyB$I_x==
zB3}~*|Fv{}hnhaql7k8LP2OVu8l)c?;WK&SvN>waN$x(Mr7!K<j&f6sS4We_OQg?M
z6lVUFHs3>QzIM?UUKZmn8-q1JiJ72+T({emOt9HW`DS--FPITOM&E~j6Zdl6!6#k#
zHUO`>wHvcx3l-8(8QOD9dC3-j##>0dw)Sj?G4nS=eXPVR7$!84T0c0&&_Ca)m>iv;
zA$<+lct|zgi!!?#f~Nxo2z?a)fY&<eO;6Q5S|<e{d{MXS%s$t3**x0c-G8-_Y~pbP
zKVXkiXzu@7KPW7xN~R7m_8<L}#DB{+lhxwy-UGm$=CXIE#R%$QZ~)esC%^Cav*E?$
z5;K&JFFw4RYpJB>JhH3YoILzne6W2$4q)XTE&BMkKXl$zm?~O?oxatA%Yg);nZu4d
zG9&O+yfzD8Jp2&~=@(Tsz48*C!&WhD@f^;)tk!W?4TlSx{IS&nCANeT>zfN4em6Bm
zy#o!+=~Kl;cuSugPpxmv`4etw26Ed>6LS|tq&;4So12AlH^a*+-d{LUJMAaYJuJR%
zY~;hdDiGq+>ZW3g7crOiv9t5k-JFdlGq(qpu$o8SXV-I{fT62qLU;@}PlZ@bYL|)T
zadrMiTCLcv*f>+?@`c5P|Fc@Nia{Q5EkRyp{ZYNR<2G#arAnP&%hdy}Co~<F>MxD_
zi+XFj#-6$m?xgVQH%O7Ung=L$C#PC{6Y>7GtA`9N3)VLvcA2tEXyi+5^SyH#<nXDP
z&#^(SrRtugyQbqRWT>^_wp;W$nhqs%&N=Dop9U4pe(<zRFo|BUiw{UVo6`bs%rEiZ
zuY;>^X-e=L>&Q5L0jPvxhGvnP)0)!Nm+!w$zWm@C-1#^eJIEm-)hQ~PE|yF4x<rIk
zGp(1!RVl6}+)#N|Lj5ZQTT7efsFl+%0YTR^6>Lp^;Irp{hK{r$0Md+*HN}_;taEWJ
zI|^G*heA(49!(i3=z*iHC>ZDhq9|uzz_?7>;aD<8*r8lVEDc1Vo&?E|@G+gJD_$D&
zv4@%wav4VTF)Xvdn@O3*w#ft0p;nRa0*U1NZqX+-XacWIAJqsJpe$-sf^M9kH#E_#
zF1`y|`^)eI29dukXgW*wmj$UPRZa()6N8#`1D2UCVrw!<l-)6@745$a7XlH!Qxz*)
z00X~bl<I}A6Th^K!=#A^RjWvrh-yt&^I<Hp2xrwo$I@!D5Z}@r^gJ)-`&TN04DL|)
zXddzmPmgV70lT#))jN-H1n8@^hk`}i%-RE@&UN0wMaiCO|5WvsSZ`NJ`BWo`NTusl
z-tX7<E7C^9YVwfoqQAbHwH8zjY%Otui+}!<o?EW9%lVhI>OMvoZW?c$P!rpK%Q^Lt
zTenW@@y`Cq?*7i+C(NvS%daxIH8R{iNGROF64LZAugRm<aGEYm58qeIpjU4M%c@jR
zwU3%JamT_RzdzdL*`0JpZ0divk<_~m!l&#Zfr_ucpJ^t#kEsyZMKg1C+k1k%>vtQK
zAGy=>3Q*lJJ2TgQg2GJV#~e3|&isvzm<0}YkY+x~10s*kJ~@XH@wwl&3Q5hy;Qor#
zcKj*S#vY9Cg}=H$COW@bLISO{*BiIau3Id;4X)+acXNp1f6(&RFe1nev+5*wu2ynR
zlD)h>9NWiA*9on&r%Cdc@Av=mj-^)iKvS#xiGVGV9F05XH{{QGZ6!(W-OzFJW#0Rm
zWs`Qh4Kao<Zlw&SBiLU=MsB3IySAaDyEP=UG`AHZbZ+KL()Rj2ry205qCQB8S-q{k
zLpL<#dvSX^CX7`G;7A2gZ;QicZm3n2CuFQrV}0s(ka`Pn!HEpgAKNLlz*icw+{@0v
zs~(|ukCIeE|K0q#3Rw;+nVpLokAp1oarZJuxpe@G86c~O+d<egVu(>)o?1=&sv!vQ
zRxcwNJP9{G$KRKhK&cTnm0DIwOMm~j*Bk%#X5-(E19c!|zz-)S@)Ge5<AagV?(Cm7
z*BZjXM#bq!;&D2NV(G!b#VW|GNq@%cGV3v05bz7+e0{ONF{YJ<Y~(QX+M{Ded3&fP
zxD_On*Ljtl0!53-X5AX{xRZG|Cg#QeP}DPErz18FsHbYj=VzAUEuhYy7Spcngqx}T
z0d0-eIAwJ1el~Fk;F_^b>=6(Gz^&_YrJ!?Geq$IqnH`-Z8Yh3*9iA6eny+@CGI<x!
z1e1er-i13v;s^u?7*)RCmx{9}x-K;CgX2F3m9H20rUlgcLeznhIy>J_<$2@!r*L$e
zcVL!ae*9uP9be@`U<k78J>|2vmA;F}W`^QVXjhqgChRxdDF3ToV>PFR#2nT3uX3yN
zo}4n$H=6-xJooSFg(M!Tf4)4`5-J+<#4fWL>amXtmqN7w*GM{{nLG0>)Yk-Lhr)CM
zWbhwXWK!k=&G3xNdWj!Y9;_csW!=mv)+@5o@F2<wt>Z&!<X!Ujzt>7A)rPw1P##YQ
zw6sA3^F$;@^G}oW>`HBQSDL^Q<X^Z{iMj@YDO%7e`V=WE=D@Tl%j_VmmlkVD(!Hy8
z#{acCQ`*-%Oi>NTWIg!J&YOdy?~=Wp&2N(Jos*rdlbvno!wa)?<eFL74HGkj{F=$`
zHb`)zey}2h&LJk>aIGHBqn{hJFgsgy$>X8*?WZ_<$Fi2d<(W(6Jvs4NGAJMU0DWa@
zaEJ++Md2>;)A#+7W8gSc0%5S6!TQC!I9P&3fQQ<M>m*JEPNecFS`zGjmf=Ac2NfH{
zX4Aencmk#UBub07Ax9}yZk!<&zP*>xiImmc9!zVs2a%7EMKOMT96M9FjfY<!X*PR^
z#u5hiGcSGSgtS$|Kj&Cl?XbX_Z}>uW+^*UurFW1#LKCIrgFTF@)`y4Oj}j4P>Pt;*
z9t|MX1y0-o!{9BbMp8<IJ>lMu{fjMl9aq>nIyyMo@RIN)^)2WxN)2?!`DjvZEYt~Q
ze1gzvQuq2AVGH)Kc+1}!&+{NTB(frj%oXg$l<A<^)3cH+lkl2$yT!Ptg4_?;xInfN
z+xpdw<nrc*z3PV6iPp?e&}cFveJs2>IN1KzWWNwmEYuwX7fQYOWl;->e+hc9ST4<i
z8wXAl9Y0V87LFIZ&ZxQ2G)~0yjZ*`Q1O@H4=!>mpTb~w4t3GQP^!NrREt8(>^lsKu
z4cB^n;r>VB6yLi;hx4e<o|KWvfR1EVl0`u*F-c{K=!t$kq!G)MA16N|qw}H+IcOQW
zVQaE*AF4m$dv?NJ00_6_7{zyV6#fL$a4GX+*^+6+-~iVszo6|$KttzQ{{Co~ti0n~
zY3U;U{i6$dQ5oOAIp}FMCz!e^y^_xC<s`-*C1+DE#?<A43s{?~Ekxg1ofz~BEruiH
zJ4F&aFHTu6M<mI4k?{9$PS5*}4O{RD-y<`rwlHa7BRZnQm7~m%+g|v~aN%7gP(|;O
z7tntP=Gghm_%FlIxf2SEs^0O9E7YGp8*m>+eYcNIe9fbZ-b2s-q4U$bSV=T?5j63m
z4>UU7#VkkftIQ@$f<q>TciJ)c@X_rLAI*RG5RBc^Recz~4cg8nZclx_AU=!7e`lqh
z=LICrZ6SVI9kLTfxl0O&%e&ib6LU7vVyqdTRf4V4jDGZ+A@6-iV>8EegkL%k7V$-c
z&^#)3PhqipQN)zjt{hVKOeAB~epInz{KSsYeidxZo?-yb3iYXSEzd<tw)<m?o~<*R
z2F<SDF5lEXw{~aOraknpHNsS6o^W^SnCi~gXjwzs|BthadGoYO2zwoc%wh2I0<$`W
z%XRZ8s=aoevCrG(8BYH*`U`CKNeCU#O+=lCPGZmjv!DW^YvsLmcnHMi07<IOd)l6j
zd*<kxZ@+*sB6%o}Yu5K?=xcd<UrBek;(Ry1RJ}X)*N;)2dT7QGX_7DZ=d{4KlZTq%
z?h>=r1tb8XmSL--MR3V5D11C&<jN2PhQ+K{3Q87M77Pkh8gH`p$(dskQDWE+&;x)_
z!!I{hD;k0lw^d5V4X4(-p^rYj!9&a}Bk$F!UJsIk=~#Og+e(haNj4t@S#EGOx@y=I
z^Yn+q>O13>YfW5o_GtZunxH}dx$*HBrE`vHcGr;wtWYB)6X~k!G~Z)hLOCR;9$+>H
zSzgwuu7_P|w;q0d1psKir|?v-_zLGj1_DpH_;A?jEY*tz0#f!?fL|ev*3o+D#<@^A
z6r!okd#7jDlF=u-7+-&?5TM&?H6(bOEt5qQ8qmYAVfz>^MLw${`hhw-)kD`o&4mgf
zVR+Yb9h5Y{9GPKjY|pbg(8s&4kW=8$s9abYSJ+@2%P5@;m@O$+mE-s<ms-mp!GTl-
zBq`7xmq({N%-#+)>`H2BvV{nyDzxeFYWUcqK67>e+HE{=R?u|fQ+6LHXY%+BG-xh0
zYBlY6eEO$D;ZhES=Bnr&d8BXL$4KpyU++K(0jA?fcvmYD*AzSEyJ8AGM3iC4t#R#4
zuJUdbN2Wd{qVA}Q24K0oH{ZyabJxZ6lzVhKDNgB>cz=o+R_nie*kF6r0%$ltbJn+T
z3(GOOZZ<VL<a^rn@J}W!FdAA!)|Xl!`d0Q4)`5pXw&}Y@l|6CFHx?$B;(+Sr;S!22
zuQy3A(tOyILXIhFWKsLt5;hW}c)P-sDUNot#cv*O9(n@>*UQ4|{5axda+hEfrc%GF
zO8=ZqOsCyB&=*6uCe4SI5w9eHzpFyJhD}saHVtn|vVsE-N*yk#d8VnS)k9Y4^w9Gn
z=Pyy77R)d=ZMi*eFGgl;v2}1Bo$;*Oc^L5+p+DW%HEyY&ySY_4_j}d4tMm}C+R-@s
zkP8&MzWnSuW;JSfmuGKgKs6{ibi;zXejiwxPhe0nDwyjj6FZo8ff6$e&CQlIvA^I}
zY!72U4;+MFjJ0rI(1g3OGRO7mGSRg^TQR7;Pm?a~h;nrQ3AhXQ&Mdz@tNflB<$3RC
zrj$F}^{ud2Pp<!_#K^OfjcV`RN`@)q)oF^8$m<ix?{N0;gVwV*t`1&x3Bi2&g|8e8
zh+6cJUH*_yj4Dma5l*Gf)Y;&1<(1z{zcH`xEP|)jAZYH)y@So|-ThZ^XKK7pRqU%T
zwsg0ki;DH6BHPX>SXs*k@5~bH2`M3W^Ao<_0JAB1y&(*Q_zV$gm>jHeN%3g@VaKp?
z^B8_>4BFp6zul(>|Jk_s^5=R764;+UeLS!J4?b1==anZb|B^iZTphUS^M5)1^G)k7
zfByV;+<*O_uCA{BzW%?)=l1pQtQa<8Yc$S_F~SY+2Mm8({jat4r<M9&YwM5Ke#d|R
zH9i_*v*2Q<NbB!Udl|mulNSGm<zCPV#tRC0)$L{@CYq#597z0~X63?tZR1vk5rUJG
zFx`z0l5EJrw7m{NizFYza?gD!fyT*NUQp^*C1bG}ZyoHv+<lcC@0`>$GAu}lt#~RK
z5B1=iSwz%|S=Y+<#4RG6xu^vNymO~$M880<BGl5KYNj}a-@jK3WF=8xqqs`q@a?;g
zVQsZjGX~`0&mF_&jU!+UuPg?cg#5GSL7Fn7wkDjpn=H~xml7`dmX^>8OR2&N#p?{l
zFNTHAe%|7wYiFz7-(YO=-g^!&SY+PDg8c4WW}-4^f0}sBFcV_w6;tkU7=h<CJFm}m
zR#@pj6(8Mcaeg|sN?Jb--S<<g_HL6C@)Q^Rz;|aFT=uZ$Y3pej7O`>UYweVALmpku
z`w^`j@3FZ{4&DQ{ilX85mE>dccx7c!CSN71D<zx`mg;(nG@jGLoul1@ZMxc7iE*^p
zB#{k$%!Q`KxlGxkox{D|t<B>g4=!q;#&NX{w^dzb+WWkOd2!98M~%)6&K4>^u3gGB
zxf&OUSe==F^MX|N0|UV?x>c_w1q6Cs6v%MThD%74aAY)-3|X6=WYi1uj<$a4H{_4*
zP)dTc!gV7i<KwzL{nbPNAV3@Z!?je*F*yMo#O=w)w;iDo<!Y*4O-C#J6prv<W)APb
z7#Dm?HKC^YOy|Qn`PZ)&(te+VYaiweR2Iw^&9)W~os(#0=U2b)DGP3X*Pq7Rh4xdI
zEZ~4lxF2_E6V`LbavC@A!S$evp7pNA&4P#Dv%4f^B&&@Y_E%}o%#AbeWjk{KewQH!
zE9%6&A+7$}vmQ;)J!by57PJ3hKey|DE6-bLx8Ks*L7!3+>=ylRb^YmTMgLn}Ut9fM
z|NAvQje977;_{xBbapS`cYIrLRiVoAsu=fhxO7Q8T4=Z^wCU)S2q?npyIIDP9M;q9
zzkq4=<H0vSnb@+qwTCn3?eWeLEZW?YuO9|4|HB_Sz$*a4xl>!c>^w!pX>ooYK%dKf
zTYI}CEF}zS8QpyR&F<lwolx7H|E{+uuU&_O{#LPlCs{g1z4>2azT6n+PEIF!ZhL1h
zoadQ&aUx_O3%GO!p^=6AJc2oiQpQB4S|n`-aWVO1iK8N?Bko;Pv}wURT7=dbGlR3q
zrvY}jfp1?QY`)oj=U-IUImr_SI9rPj&el2UOkHHMb9#9x9>Upfgs#7<>`{<OW@7N!
zxOmSfv*{#5h6i_-U2TsI>s9qobl3OnoB#9n;OOleC#-X(csN+|?Cl@Oop9~pmY+#S
zx39IMlAqTW6G6=eshgq7kPp83;wM?&`SbOzN>}RcUrJ7B=Ox&B^QkM`oM`8_=G>p>
zbBFW)S<CSB7$ooh62L9z|JswMkE`eZ)77WHpZ~wc$AyZEf@!k#X+BDR1R78E5USTh
zMJudSGY_@G7Pa>f?Nv@ZyxH+1tF`hzyXMoJ&5w6J1uLjRL1!LXgAcjInl7Y4@Kbr}
z;3I#uZ+GrQU64p<kkHxz)@~5PcJl<+wL3O|vHC^>RyWS{1l_WD_Yhfe7|a?Y7TWNM
zqX$Q;tAp7ux@jL@7c`te!o(^OmZb}tnKQXsK*8NMOMulos)RysF8Uub$DY^)F!ydp
zit+6<P4^IinPQ}vwi`)kF1k0tKv>{h0<pgqJ|-C9YtfS86TuS5;p*}=D(CB~os-s^
z&Eu1uqt@p3_EGD_cdh+R5?I|~i2O@OG&7+;5dwd33QMPtLZv+JH%UslC!*P+P0AYX
zV2Z3UbXCXhQ&X+ke00;OYDeZbq5l@;GIjzn(c^2$qWeWEy#T1W=R`duD2klNSLRcW
z(YiLUotF}lI!m<JuT0Y8L9%-&D}Z$5`w+e=Eh0iCKYl;IUqRJd0E#3x-MX<sH+jq_
zb0LfY&;+y1wS>mHs$N!e^(^Z$k};=gaAJ6OI!5vK{xx!PE>ks_l?LgnNk6rc+?`k)
z&08I33o88n2Fyzr<?c)P(`PvU?;!s@X?5TK*R&W<2cK9F{x<th=kb%O{I|0DyZ`@J
z`8-HYveKs^%<4{xN^qZ35?g9G9h`bgbXbaEHWBrmi!HF1%861Y2jB4C^{%^gz?iVb
zxkEpg2{gD(y;YzzQW%qmaWALLbH7-aRaIvd$%>5S?&xIzsVfuNFo|L-amEjIF6)JC
z2jz}W^+wCCk9xGcid1{PA9xO~KhT-2E6Gg_xW_F-IBI5gSaS>t3*Mk0pmKNX(!*eY
zH%t{=hMWYSPA8Z2$PaQV{CZQ@G5XPzc+H4M@?`KHmk1xq6mf=@J7cU%dGd$Ex>0Y%
z`0W?wlgB=jA9Bm^|Hs%&{wIBIKmP$ln~i@?9O%8{KUY~?_&xsfSNPn0{XOoMU`*Xz
z7`$cu*H_o7{=fAno!|X`zsl#qzb;S9@$y+dT+W6c5?a&pQnQu;tj5q|{-hSbI{6hf
z1%2dzL6#wbHboXcQc)ZTBpL+J!9@Ys2F|FJHs>^Xl>vrzlnuqn&k3^9Bt+2%90tG|
zA6=i05)M6;!f;u4ajD5cL7a0wzx8~0Nt*103!1pJ-wOmj>YJ`E^X_H%Y7}4L<SmZP
z;{qn_<OCsd+-#HDrMCJ-@g99*RN`b*OvGEn6C}bc{Y+hz0~|=V$m>N&9tvtoF(4T-
zH5T^AO{QX*AYU07%F$I193a1+auvkWQJjtB>US<I<NoD`xM3M)iYa0+#tT7GQ8Aoo
zR#DnR0Z)}DB`^297eE`2vkN-+lOO*wJUq;M8-FSPu=tnWAC`XN;@sTGX)>zTDzs#z
zkuQ(O|7hN>fwdI^qoiX+P?Dy%Qm4x60VlrcO$?sJt5eCwJ@3tC=z0p}G<`)L(j<Ke
zmLUpal^-|~zzRFdC*zdX&``KQQ91hr&k^Z{{O||Kw@BsVU=@w`#Pl`MKsFdn+{0}2
z!vtg@!pwP($HU7;y$->vqD*VOPf|GX0{$~v)AQakEz*L>kMEM2nRhPNa5bc515_JM
zKXSk*D|SU00tLToNNFu8A<DP9z*mVi<HA|e1{jJ&kvPCTMed^)iFJ<`Pq77wA1wkX
zb!YqZ<@WLE%iX=5rFU`TZ}O6J<tw-0(R^GCQLHKXkdAY#!ps{Lg_dUz@KQCe<9mXg
z^nGP#eGhVe$9Dx=wf5GB{<}O7ppO116AjJ*N&LJQGAe=H>|cA1CH#uiaoZ4%-O=x;
z&jd~zaE?Xd>Pro?zhd(<Txtusyk*kzxSmQnW!66@%2`Ohc;_sdyB9;jMD5W@At<`|
z$5aj}kE_s)fB$=;-#fwg)sXn2=)|D#t&w!F4HnRy1<!i)RebHMYTeqpcG(!2OaI-}
zGL88PufcRRlW++Hm7ed`#!&RiPyM1Z2rDaDYI}|tjN)OHJ}@4R+0+~U{`bcJ6FpG9
z_g~$;w++}5%L57%oGq+`w(-uOJ&WG7YbJaN3#YDMWm*!MVOASbHONdjzS(!l*FLj6
zI#?ds##*=vOK713QUoMuMUW0F$I9<nslU$WcKP3#`9Ap__t*bAD{H^!fBq_;d#t}f
z6otm#JH6u;`+ukNxElYl{`Bek@A}`b@lhX|U)!bRB_riK&l9|jgOT`ouONTeCFbv3
z&gT<N@CV<_n%ZCPy*+*{p<!{ULcFb$%sL<JU5q0$^TcWhaI)Y_$uUTc|A8M~c$dV_
zUv}&?lb4SxJ-S>CudjyJ4MT}*Gd@I1n5fQ-Kib3uzG;<jTCH_jtE)D4e={&|NB&uj
zvx9C)(5Z&Ws0tzLD<yOQR(1*e-&?Y1!gKqwGyBtOl9&Pbw<h-AKQo_u@c&QX{PMXi
z|9f?%%Kz7%tapCr|G&lu_?sN1Vs1AHz-YCS0YW0AN(VzB3Mi9MgBU(gA}NLntHyxM
z1hGpAlWN(95Hj-?B+HO#-hzuZ3tDKOdDUZTi^tqpIA+EN=DKi8bditFlS9{l+7yw^
z&7d8vbEE8L8)8I50H3MTk7k*4d$t)k_voEZY!`=KiPd^@@FyQi77R*)KM@S0;HFyI
z9rf)kibm?Xwt$Bob-fk}xD2s?wXyI8f9SlMovquUd(A}|H}w<LVlI#7^3ql+^XuXc
z*h(miHYn&)!3VQ-K6F;!Jr2U2sCc&PyxMn+hjmN#=3syK<lxBrf~%;$Hz4^2X?pdD
zz;}CAAZ8y1e&?U=HWU}9R*CV|k@$c?DN8tS3L;lHLit<ljBgEq_^2iSlGT*}?d+xo
zENr2r7<T;R-5w=r8nx8>Ex-_$VU6ZnE6xO_SGIn|CfB>Xd|1Fz-DPgyQU?!-)lRa$
z$=`S9mk734%Q9p>`91U4WxNXk^XilQ;|+K#aoq_3nu)xg7v2_U`;!1L`XSXx=9RR0
zj;2pxd8`{+y9!)!)BJEIt~w#o>7;1UrtEUK4dbBC9trp7Sf6o<J!*cHeen#3TYWlc
z@d#Y;TEpXZe;Y3MEwjGKws@L60B-~d1U&!hrsPZUgngbxkdx;ZAlCcMWB_O$9f_ZH
z{<z7yY5T2(;Qxz1_p$$l#*+KI;}-pI<#A_5|9iapyZ-m9d>%l!Le=PjOGDu_NC{Is
z%cN`{X&<9vSmqxDC3$tFY`A?sPmrQ>MB5a>=s}P#o1toh@B^T#r;G#ao2<x3K}&$y
zH`w&`fmLecA#gQX3njhc2o9jl_*Q2GwxHd0?P4Iw(^dbh{vJHiSy2SxH9QI=jDO1T
z#yiCSugmE`=WIV?JmUMN0o=C#*E%!!f2-?{f8YPV#z*7-Wh=TBPSXAb!2B);Z66HA
zb-5L445Wclew`({mOAKa#489)OHxjA!3R_=o_=z>lNuw@AH@(6_wpcF)mG9$p%^tD
zlwTfi@~>bTEDN7y6R`-KbI>w1mv`Tzt>1b&|LHz=*#9f7v$V`UG4}_bTlW9c$4{!~
ze`n?C@A03%%E#9l$P!xSyc-#_P^{86Z8sgIXQ(!xBlm88Hc*|Lc;P-dwrT?@^TD(a
zD;|de#z<?-kN7K_rqRa`L`}76ZJ;N?gfq}0FL=0KWGKe(OBi6hqHWSplzGzcNfoB=
zrMRTGZ+Y__65W$HrQ_CY+#tCF!8Tg%lw0bEUS@9=y(!K-soL5;w>J67ImR6cT(Z93
zOP>V0cP5cu-qWfr-Hhc>cbE*%XJA$>nz3S>ubrizwP3NW`1^SkyX3{yRSn=s_OmOa
zIgO9vdw$&b>0L4|`k90adqaUEl%w6y!irnDx~t+A{uGe=rWQd{D~6rQSIMYAdFM&t
z>Y~&e&~66s{nrqEP~iJ|we>OYOmj?k7+!9kj8j*mtU8nTaeYf6;N5L*m;=du5kL;q
z<vj9<N*cj@+|{FlK;qE-@_|TrO8U%o!jAqx3qsXFQhvlPq8+|RJ-R#1%ABHf2fl;4
ztD;VcJct5&mGKATJlH<?cHiom80aj|8kDR3WKj(Lp&d-~I`3@my2->G`AEFc?+>oZ
zuI<l%5{|9mr5-!VaX4drmmJp#G56Q(_U&BMQN+tYz^^5WLHakr2v0A@S%&cJ&q)fg
zXG!OCYn+ys{>4F&<<eeUQwjNDCGW9!hosMkaR!4HIpji?0%xEb>6a!3?fY*^5;pmQ
z%CKQi1grolFltl@JR6_7B=d7o{i@88sT29Gf>N+jG4!k~`Y0>*%MfZzf<Mhv1iWRM
zBxmTi^B6$nYK=24vh|LZrn3^cKJP8tDZ2<XkHC*NbI{&-|NJih{-evkO7~XodO(7&
zNEL3|ky6@yFLf=)pig7u?a#Lvqf_Hok;s2*r9b%G!T!@>*uU0v)B{}QFM$8MwmyUZ
zyY~2Z`_HfPQTwlBGcht#7fv4{+hO-wJwm9@&787KF0-`Xz889$?5uC43bHr6aD`{<
zKqu)!VynP?`~!&akv!?UTXPzf{^Dmd)dYI>Oi1JXRO-)ul+8WP{E-#~w%qX~^XJ$<
z-?`?EF1%?1;^vHBt^M6(j6aRQXWM}A*j_d0vyQUvyzs$-cYf}2&oL$(xoYP35m)~2
zJ8b^}KX*9)*IHvb`tm`h;e7WN0dDjEuFUv<);cS{=YRbwA3gtdg{zR}hW-{w(7$_G
z{|9~Uu>T*ohy<o2>wT&R_%`|f@sq0j-}$}%$FKC!{Vyx*PU%mO>fgjIh;8j3O@_y<
zE{Z#N$;-{%y@NjmHm;x84|E;1%@D)auDsvxCZ>NBA^Ugd>F>_de;()QZ_V-J&mGSH
zr!5ZgbyIrZ^xxag|MjOc=l|N;%J1>tzsg6?f4{g=R~ATR&gzhtVhHSIy3Nlr4vV@M
zCbYjZOafCpu;p$)kBW??eL8^Lsp=9TXR=6_SO2j3(>qB*mYRW<?l~R#<m0=sg~<Ok
z(}np-hv)tDqU3{PA=>QqyhF=9@I$Vo;opb~lSlIOqkvb`jEkf5?>RCBjS$$4FVMml
zl@!jOIrtm7r7v*77-jUp1uRAI^UN56#JVcpKku=R+@Yf}9|}%7DHXh2Bb0-a_p|%;
zeH91`eW8h^(ToMAa###ok}1In@`lQ$_H4JGtcQJ)L-LDZ{fys3{^QyOPV%en0{IbH
zqi*Y!<L<KXecE<O>r(1vB&|{MkOi(Ezxe5UzD}1<C;if@5L7nr!n>rGolP(3yvwo?
z(OvR&vfRr)EDxt7E&Y2<Z<uM+cJh{){Rf!BIwStdO=Fy6rLKGC_6d+1iDC3mOCx8{
zLz6U|TwB}kBa(IaHrhw7zD2UO{`kq$n|dEUHY}hgd|JPe=jddkU@AyXw0d|PoqO{j
z9OQd1AA3y+ee~9I042UN!OcBTLKK_#1TMNq#0`xX5R+M!*yp^TG4?0@vM?Ep76iD}
zVsi2z{J8CAEhs#N#+GX@ocX2)qq;k|-wP60v7!MMD+}(<vkTmC+X7bGd+4TQUT+`T
zEZ@@W-gGc(k9%jgcSvZ2F&L*@&E6unxmqJ9#P-WVellz07%w6EXsU=$k_T!6pPwU@
zw1^_KFAC5RABqykQv&($@L>NHQycJM>4C%D{a5qpR3045$Z#uqg(hyK$s1Wt6lfqV
zw`_F$1~h-u^8L)#cWYbcwTR`vJIMd5njQS9=Kovqe`fLDR-dl^ZvXpLK0f~=otRxi
zu--zQ7Aczjlyk1wO(0nk*L<go2;f{U+NZBGE_^yKRZL$p$8e%y1}5Bv*<rzpW*P|^
zuvD~}-ceKZNw3mtVqfDZT~wG3V;@(?dcOz<7T8x-r4qSx(#nvtaP9>6>8MX)EIh(q
z{!|foW<9)Bg+YAcXwrp>ttK$4-DGWbBKnO6D*KqB>Z{OD^-~N!TfP5#Z_6tcw#b((
ze0Rgc_cC(fvpCPv^)UEhDf#z*ztht|$2}D+bg>3bM?WpiJUQ1+#*-S@%ETCi_H)0I
zOng{NPEoG4k?~7zx0)Hjv4ng|bbRWF`YyB<s9Uo8AoUcW_SEf;ItshZm>=Hz$@XFU
z+{3tUpF4!yxW&57gm0gF)8#J{YQsx^JN5l66Tf@U90J7WZc#Y)`7DI+GaUx;IC%Ta
zXVs0`O?A@)DqwQdzuKi|6xO@>18!rpm<I)d6I3%`ga;E|OZ~z1GwQ_qXc9hYq%K_D
zQ4vaT45P@sd`KMXf@r0*m?c3*edsTQCYZ`2KBoLmyOfU|wq$7ufm<Wl9VP_V=&VIv
z6+@Bh(~T_IFJd@45ow55%y>I0sDBEGF%+RG2?Yn_t*CT{*#CCBJvT^9*SkU>qJ`}j
zSDfr1^+~lF2ETQj!F6V__fBk*Q!9`KVSJ;8^jWv^=kzR0H0_({=C>AhfB(#UZqon8
z(|bdG)P8Q!|2k_=D)=9rr)y7tumAq5d>(k&K&&#;e3G@3tzvX76*m{RmXg(#&U$j3
z_CKT(!0jBT#0~oSXjBldn&ji`hd*8nU<2!N`4OocRh&<*pnx&|fFy!aO>`hj9@C5C
z?PM?SX2X(RcAQDAovnkz?_j-P$U|cIjK{;JngA8TEQGYNu5d?Br>38gdghA*14K}L
zNmby{$I1UnNJ}lCF%GYTGQn43qDmoTd~EB}lYR-qnA*PSFVpg9#DP9X471EmixK<K
z8txpJ1Lasf^6IP4B(sl)p%<g{YFOv42!Q$k+#xbi4FIdu1o2Sdy=-``K#iqCZX{`O
z;ax4vLj;{(*CRcLHa0}qxv4L5kWGhta>(>)L1(pM_4JAs3Q{OWUV<#H34}^MFevX5
z(abi4;y<0=gM$6%M*H7j^fRhH`VWJ=+^7CW=gE^Nzt{ixRX(?^fBS;OK(3wi>F>BT
z{(E(8rvB&p@Abcbm5=b|FC5Yxef_Pw^!w*m{M79K&&BrL=l=Zv@ygoM-}(Qq@tL#!
zpM&kY&#nA_WwomR(f|L>|9_3o@9h5n?oYJ;KkKgdpWF8T)Ah9({{Qs%_}^dU)Bd7e
zUX2=Gv<v#*NBpP6e|q%4esR%oaXvyPXW6iOIY`Iv^>4N#x6<M~`rF?xf1?rmp`YtF
zXT7mM$8b9Iif(IC6#cTHMxzEI$d*Yy<(NhOseRdy0;i}}+Q!R|UmqNuoSy6)y*WKO
z*gk0Z8}Zm=oDR$LY}_v8Z!v6?^5S-{Y`AzxsUe3yhea>bKYQ7zT<%X(4x6NZXMX5b
ze#y`1YddY|Y1%KT`)x#xwdmi`I2&jGHO<SME@PsPzkAaF%oD6TZEC2|{!n)5?RY5f
zWhwscc4<QRzpZXcb4tIVCLcX<s$oB6`)_42Y}hDzS&Q?pMrk*@nZZZ<e`Te0w6nLf
zdAzfKaI$m!xoGUh{okS8zBVKO(I3C>|6k)HK?+aWt7fHzdzdKmtNKr)(fZ7v#@o@w
zIPGQ0bbP@$BOI$xZZsNu2j6apiF6+UK9YJcwY!IXI0ysC>Fg>w&(g_soR!ISF-@*g
z2@RSOBWS!i*xotXJlWYm#bat=fCL9?%c{aN3u<!Qc0PF|;p*J0NxSiS_tk6Z%?ZCU
zM_^)iOy^}c?I(zW=7^m^3ZN8@Q%sX`dd9I5=jg+@Y$rO@e{F0X?VjvzZSHN%ZA}`1
zJMPWF@k#Rbc<1QYHIQr`ZyvTA$2(hZsiE(z6-+~!b*CIQf1ZCtHF_y;Z4B}AuiiXD
z`Q%T-QDpl`a%7%^H^neHph;a%I;$HiEA;=#?)FKty0Y5&{5`0W<VIpM-DF>Unh#5z
zUjS3tjOS%J1vGNw*nWA5do~(hB#T>r+G(M)t@X~z^XE&+?r@S_h{OCcOGmWiwBF+c
zuGI5>ag|&WPv;2fZZ^jI5=r4`Bo-rEvYU9AO~B`qQF`4k(q7q==(o|hm=vu+`muF3
z?Z0pJGj`)jj&J`u$l0Uz5P-{>3%%?-o%Scqg!(|cFr~34AJYCbOTHJ_PKoHg&abEG
zFdM&XN8?&sefnhe_HpqXfhv9e0ga=PB(YGy?i37Px-p=B<vbSgiPOXrJxEQSeow=e
zm>*zv3PjM3`soB-qcZOOo4h+N;G0VRH0{$U1kw5$<@d65+`XI`)stsWZyyzhvFF1H
z?RH&)2K#k*3FP+{s_>!X^$T(1GEieR3vrlU(L{ZlXWbu&1oG@E@BYwCHorZd9mCVd
zOUZUN%!#)gAe(0VA@636R8X}ZbA7aPe3(EufgjK)ipNGBNOdWO)4`e4;-jqzfHqzV
zcBIj0hEhJDob3V8#u2SjF_0M?XDR2%2tDxp?M+kaB=J7XbU0Fa`<pBuC&!m0@r=_v
z8_te!_1Qi4)DQUxt}j{=NJ^l-UOGv+G^OnzTNx?o$3t(1%cBbdCuKqnmzTWMzF}VL
z=Ij-IteN~^#8G*I8Y{-LS8G<koDO?uHS=%>Y7OR`xJs4|Jk7?#j>s`&2#EQq;W4t4
zwe%a2(fGP0?{4+;K|Z<L0G=!*$D^#9%LW-EcBaR)p`J-TV(E;>BJdbq`!QnrY?Se~
zpP`?|i|K{&a2(wE@I%r6kR@l?W%?nf@k#At=H9P%4!%f^PY#ZDG+|{hB9@_E=l9ul
z(xbgF;g&M`UJ?tFpdDNbLW@_D#Rtz<pK?{Q!*NEhnU*w2q>*r>^rgh%;9dk>5A{Xq
zcuYg?=kLW!j#ZJ)d`QQ63gP67<nZl_<F_x8{kLxpH%}aslq77oV@Dj-OlQ|P<urC0
z_%OH(afRoY(?HSHmFMUx`}5PTreSMMXz*~H(JL%2U8N<@e7`8(bJu%GK`V~g=P=hm
z1`+vkb^%f@3Pdj;-3|dmS}kp)^JI^g=&2JCusU?eCR=;EJNqZe;U>vRO-NfjeaIuX
zT0h(k*BIZ3A+A4tx>VB!MweRrm9EY}<;_Z17FQraOY6_j(q^wG2NUV7%vISLjXI$d
z+R1sBMY7%fmj{~mM8ES~uMr1pG!A%O&TM9EcsVhu@fbp-Kv2*WY#qFLv$?<RQf5GE
zqoULtUTn}eyRRVex;xOv$B%8aqCuadz>?(PT&34#axqOwS)OFH#rcZXSK_xe!RX(l
z-GgIZ-<RVoLlnp2d)n#KY>C_NJhApMQ5xJ#=eksZvp6<tnS&Wl#~>y8yPRZ$ge2d7
zGmv|=LJWrzV1lr38nj3W+XpZ;--1(nK|*6%dn6rylW4`N3>a&OdPOZdJ^(mvYw^Le
z=W8p}-tK_-*atbtHgx$=GXjc;tND};MtwalG0i9n!5hApe8_P){BWIQA4mCE`q^QM
zI!;km`3K+%kH^!IJ5ZB6c%v+Qr<u?{Bo)$Q+uX2je0o_auf>ymL~p;4=ospjJI+#^
z+{_SyrCxphl$%|rW`9W;{jrzPzoq~E$F!fUc9PDMjkVQ{&hvj%AzfJx(^?~)60r^^
zoMF+^<0}+qK=*5_tuvw<q#Lt*lbAv&h#*%vl&gm9RXKhAaXU<2?4G>b-Pzl&X{jPY
zcb3|X&Eae#U<uTa%)36DtdiDFgg}}vmuDFwFP{jpU*s6bwA5hEhI_ry2Th2PCH5&x
z3HW_Pta&(*qc=Qa$Jv0cB#@RGNF|<XDAqmB&@KL|{EKU3gGc@6;lbgX%|9={+1-~n
zNn{d6O2X)xWcHL8jU0m5x6d#~N%AcnIWoi)Ipve^nAGQ2!xX?YZi(;v&!f%#S360s
z$XH^<@>M$cn(o+^$-@NUf$cXtZ(i&iMf|{+J#D<s(`PgN<Ai8=Z`h;gfS=O=>7oiB
zcw-=T#4lcX_PqMy8VN#&9CU-E5<W21R1k?4OP}$a4(IOM-ILeHTlAu11B$tz^YH^h
z0N>IXEFvDuOlQ=|vRepm?U0J8)5HPmnk=R#_uG9ryEOp}Dh3T}clp3_Sg9}B5FKU?
zxw77|#{PVAwEG5I>Cc<n+p3N1zS)(I2(On&L{s8ea>8thV9TvNv)0b0dA}D**#~sg
z9v|-|opz@!GT_?UoWmZe8#{mA*>YQzR;3H6iKGw)G3wdM%ZbAy={#SzcOP?Ib{MW`
zO=v%+{Tzs*ES2(;i{EaZY`vBk^KsgJPjs>*Gd9Rr5KQ}+xND1`M{n1C^Sk>eJ4Zqy
z`VyTU_X2L~BAZNv^hE|>au!JlbG7D{(HLAElf~Fy?VJ$zY9iy6|E2#hiSW0>gX1QT
z#4$LY3|>|}*b^eSgQM?~x5t}A^~F#%9ywZ>qIhh`{65(_q@S}9C*9)Ke0WCOsORd>
zpH0i?Sm1?Rv5^p^zh@JKNsV@9Gc1x6`(+^%XLxxjc`Dd}H1kDoO1o(D?Vm*v<xxDh
zhG~_Uqv^qfWN5c^e5)6_R9{TAWV4{j^3<N?7o=nMXio>0k;MnAE6-M{Qk55|Y~Uoa
zpu0wr*c3|LytoxXv&kvg=p5pCLr!zFbGWy;wZmL|oh8u#g#un9<ugn|!on6>oO6Fg
zXLlwj@I6TL81~u|2soX!N<)e$!^~3-5eVo^fHa9)$A4mqIokX-p@v4>*3-2$2;Xmb
z8F&uf=!zWfayv%OmU(G2!3pCuny1elK_9(2J!Vtg$#^;xBrJ@E&S<s5fdP;#`>djN
zyxo7Xcd+%1@HGZ&k>0q{DW=FkOlC}crrxK&taP{TrMnYa@Bf$%v!oN4V2^(b>2B+@
zN_Y1Z<&IB|Huqi~Bzs%O6~hJ5;hiP7Cv*<nMRE(@_IZUj(dyanpf`&|0#y_04w8*=
zmR%=qkgL#^KeOT<9^>f@4`q$<90u<0rJSh=-8g`Gg-^a`&!4+9yyBqNmg)KFP+0<&
zUtGWZDA?vag<Bq`WqZ57x4Zuhnn{DBLnhXgKwx7{2f(5j7t@h6E+<@YTyC&xY2q4=
zANXd`hG5(&n?SOrxuaOnE9D>-p7~tPDzTAo2>UqLf4TdL5g}lc70c8_3mD6dEqI??
zRBvmPmSr>%kC_+k3?=VZcZf1awH>m>Tx1>XCyt==^Sp}|p0PMnRi$6!pxS(U@;bpA
zuZnSxPxPu;g3rW~c1pjv;Km;R!W!#Z>{WV0r`cN4dHz3&rR^Pj8*#JUTR53B9K@S_
zY2#B_8e7a}nOZ|MjGx8S*m(q&)&NUOB9@lbcUEOt81+aIbMmDzqy{HYIy@p8$($);
zfyNOojaH1}>iMb6-m|;R9vtsAlQm~L8h7CF)d~3!`MFd@FB`0yTehb;HRiaiVn}dx
zVRVTZij3coS>U8(;*CtHS~!H~*k*tq6u+fA;o>Qs6ph~0urBh+r>|&YE85`cS#3XQ
zDz0HZ(fJOiFSXgGsfTz@E4%&n&7s-sng-?82v+ElnEl12^ndZ{GVflx<a*)QYCEMB
z{+wDgcs^-r1$={9`W`bNlHzuDK29%Q^^3E#UkW2#TdH}0`FF1n=jspF#DBAlWm{n*
zPP35W-Dqc(&$1W&f`rbLl%V{Bvw@e&zE$9N>nJ3EX;$n8{3?g4WQC#KCvz;`Z&}?P
z6f~8^kWQE`zZqMCvzD>%yg$gv#b~j!8tDQX$#x+@93=uqXd+5#Dbq9TDoZX30Ska>
zT`VA`@(i$((B#vVSTj%=|5Y~Gl3VxbPUM;`F4?Z7#`-YEkGT4<0A@g$zbhro0?V`Y
zC%^3Jwi=&qo1<~wr_=4XIp7d9(?lZVbuoQ3&UD*vZtV$gpPnt3)3c_@Fh@Jz(rLKU
zr0v%zS?+K!DWNZ5oN-<~Gq^H?wUL-Yw8KCl{x0ScciUJmUL9}#i8`=(@bc)}rn>ID
zBnl~ok;Zz{Oz1IZMgrlI_1)rItnrg|=VcK+pY{xGzM>eZX(}HWvM~$bXRO{8)cLV!
zlTVzz#TYXrxF&NzXu=cmwSt9Za;>E1d2VS=X-e7f%3&0cmUR};@~UGAY7!e~qFM_Z
zG<)G+f#vpBe-Cj=Zk;C5dZf1~Pe<DwXR*MRb4Myf=l+N!PXtB|re)u0w7Z8Np74Bm
zuapWq+#8Z6N9l#kJVyKG?cT}mG8@Mn)8jWkfyX5wxtOLW?OPk^n2k4T^o7<eM~@f=
zlQKQ$nvaw0<D~q2>>0FuNOXPd7oiMR!8>iv*|GG2W~E>YXEsd7c_GFGxBOW;=7auk
z-g$QT_Ql@r@oSh>AYb#Ow0KfD%r%u8shP)Xt{Kxhj!7)sJ9x$BC`jYz!x@+>D=`{Y
zgb5YxWwVdd_GkyXg>iNT&SHu-hdiEGb&Jo=Pcij5H*}^jw`|?ddSZu5^--4hUxWt$
zG^Nxr_Cbb;%*%o9Ydv_%$+XMI-}#i57S2lEI^6R^32I4R@9gazxV~e@8E!?mu@I#J
zji$0$o~-d^*^+Y+RHeZnuz8KAL&nO`L&(cCX)?-387(o1NH|`441hV51BSPWXAbi0
zd#(~&aKQw@Ld5jw+%h%d`1<PzB>Y$I*b}Gpa&!n3cJR7ZFB?rR**s@IiPajx%wn?U
z&||S0KU?cmbZ1!49DNe0@vr5^@^bR_XpeeynW?pF<*`f*pMRvryw68;ywVuyjp_JW
z&uNi~(3=pk7r2?;8w@&q7Pp4}KsK$Gq!8X|##IJPwxUx^MV(pQI4n~txOL}w#-cV$
zW-izaP@u$o8F59t#@w+dPiLES6^)&F0sRvrfT~{!qAZAw%D#{`*u&l1Kw~|PA%Jlh
zD@6MuKerQx$LIqO7&`&RczEc$U0U9X0s7fGLNpp%O5t^mxBuMS-ritaj#z8Ozr-)v
z-QPNrU<qcpuTGZtPITFfEugPrMi$~_PP;1s9|6=cKR;n%o%8~j0N@<wSfMD^B=1v?
z{=E72<X~%WbN7w(%S}34%Gv89n1CN?V|}3MW%iphw7ynTF4>Vl=h@>hmd1}?x;L3R
zJe$5DVaf1t-5ecd7i_v$)3N_}dwjCH9b!(q;W6lF22a8GTHzG9Kg4qzC`X}3r{X~v
zQ&Z`(m4dUjbd_6!{KA)8^iNTPk5^@L;90wyI!mwXI%Af<n>N9k3qc92;G=$;^Esz7
zJ_|%Ad&f@L<z4u+?okWVBXMqg&FT?pcnClc4hhH5jNON~Nv*ubuJEJ7gG1~aJ2qFi
zrDuG8Y<?)P%sqam*@R3BMSpb261$cS5$;0Dh&oMZ5bL4q$8$A=Or7OJ@FqU@)j;N$
z9q)Gbq8!j<4iL7nwfB~xqUg*#Io3^s+r(-3S|Uk^7E-}Xl5iOb>EV3|X{Z6cKzNSG
z9<&VOq8uro2sSBP2BYNP5(cvlK^}oO_x_Zov&-B}85naG=Rr6+J~j=H@1dq$a1L&C
zE-G36Q^d*8KcwiN=EKo+vMjc~Q?>QcB0b^&CGkugKT@tlr<Bo8k3=(>aMua-HAWzc
zkd;sARO|x77NB`ddECcPtj5Lxoi`5EGsSa7hgrY42365U>5HYyPZ(ZlgZ#3y+E%Zt
zkmbr+th2G@HAUdBc!fY0a`_YlM*m|=h$J3R3+t=vPi!}YH<Qx0c~<U7sLyhA={UT^
z<g~uzBpLPZIiEhPBx3%Jm_O#>@pE%W>O;iYy2cxL4+B46WK&4N3JcESiaXAy!)eJp
zGwk7RNm`8xGw^Gnlh2=2MMRb)3ol+rLbyX_rM1}k)8?KxH3|3ea%=A*Yq8r}4>TQ2
z*JLT`qMa}-z(4zCmEum-<U3B_#(KK(xU;eL<X2URNdzZd^|ep>U`g!~yzE29@*G4j
zrF4nO@CZtLcdFsy9DUhr02Pl<Hbds&^X~A-0y{;Y=^+#%pEOB4=j0gpoGzHkL>{9>
zEgN*><zzB~$ag^;c6tUtC&`S{|Bgu3Uj9;A{<<Qyvq-B^Z=CYivXD2{b;NlRIZjLu
z;r;SV1a~=S=f@E13BWw^EE6{eYtM9An3&NSoN=3vpVk~t$hBjr|7J4jmn}Z(Sa!;X
zl_M3>bC0$sZ>7}NNJP_}mHYE6N!gRVBnnc&9-r0)X~ta*gDjz;{Ef~P5)ryqGlOL`
z*6G%Q1FmOWUmQ>)rzz{t!~`yaP=WYZc<hZ7VZUH9I(qYDT?0LNxm<5>u05`J$|3B`
z@s_i0#V&FVztYW*cdtB)&f23lr&~B)&Zy6myr2Idid1>Yq(07+n*|N{kOws?sye35
zbUwZin`tdGg{}OuOlBo{wVA~J@|W3Jvbvgd)_+6ilA7OGiCkMne2v5>nSz%rsu7Jg
z&{ESm!yEpw9@`;uSny};>@@J^?cOFI+har?xJo)}q{D3JM6QQkq$w;csdqns2!snr
z#TVFCKjwq!An_hvBqKCftRZ3Qhpe5vxK3OSL(XT<<Id`v7pe#_4`!LrXEuOfT#!t=
zv3njwdcn0oG8!M+!wDb4aD<d7<}C5YLB@znreSVnJD>rTSc?x3^HQT#b;`^l#JL%)
zvdnlbH0QxRg00V<B6Vg+jOJ%LYLcU^wSS<)Ml=N_Dj!64L-reviOc-rl6k?Zi`O|D
z7w_$vZqW|{t-L2hzqHs@(9$Q64gmhjO!0}=UZz7PClS<{`_T+j3oNHu?7vytU<7Lh
znE=huuDLEzMStce%mfKDK<T6ZIF3z?a!~>Uo6@<JHODJi?aX=>9wre|hkG!;C;6xa
zoMdXd$+@;!&#c^L0C`kKsv%0|V0dzTcb?ubq1Dg~jqftMLo3CWZ?$@7wAS3^XWV5D
z#$?^PoDmr&Md1>)xG)(@0@PghQe*B?&IksTk0e^^+1m4!rO)b!%QQss;CN^AXzMkd
zUuVU~WRaGLm{nI&e@L*FvRh}_<SK*PDetkV9eWi3n@c=me;SYT@;zR5aPTG>rSN~z
zJA4>&Gm4{iR$HFP%PA7{ER@z+CDy%h)_Yf-9o1!I+B#R)-xk`fKCh5dHXM9t>?Kym
zLX%^Pya<MoJ$SbIv?Hyo++w^s4#vu-fkgC4JhR61x$r_4=f@%jD<eC9KHNRpY3je5
z5=gr9=O*GxcmBLVE6V03k;aU9e8@3+&FEl>&odZmdKIP;^IO*R`G}-1ntpf!%ITRI
zpEVMftsv)Yv%XeF>CDsY(r(Md)CJTyd8t%?lMvt0=JxK}W70=GAu=^cC^hJQH8ySB
z5Yx^&+q%qz1(Rx)q>$-))KWfd(Lt&8oakR$VV4>T(xn-1Ca+;@eDNL03h*W{b7N6f
zCyO}5bl5|}KEIL!J#kp5JIf`m;lZb?rdhXIwEBpX$;=4G9$1-9nBXO-RqQcO?qiQZ
z>&$lb=1C!^K;n?eX_OUjVa24e-dT?&Ws*hzlSq_CykTiR9LlXxTTMPn;RqMUIkBA&
zmI(BN##YEs#L7p_y(ZE3IGadl887$g=H8xI2rxW6MWj6}WbJ-g&ocysq(=Vj{1)PG
z!q^cO;)sbQ*=F3c-X&W!JrWonvh~j@Ev^2x(vldV^>kP!j(On-`=<RLcmY?RJCm?0
zkL?r8o~?D9Y5JApsoOhyQ5$Qku8qS#Z=Njg(0|aEsjvq~7lCsze&G1K{Vm*!yI$_S
zJ$?<^=FCI<vHe2)^P9MBIlT9H>uC4zMDF5ou*&M(INJKmsTN2&!sS;(g9Int(F(F#
z4mMsE=@C#Pj5vHc@Qbdl`-BxWT;#08Ak1?N<bqy?JWQt9)EgkoEnh-`kOatQoH!gf
z7wn|1_!tnlg{1!0B%k!Nijx5O8o6rIO37M*NpS!Yd1~>&+LKl1Oz_RM;MwA+mXP6s
zi}vZzNCBEsUUDtAVQs4<gSquZ^bvxOTKK{-s;%?>w7i_{vc18mplKw)Q&zv;v9@sV
zawAT{V1JOzu^j$qBu|hiAcm6V;`}`E7*p0GYJ5c!K6Zd34d<UX`@6bRc$;1r6?7tS
zw$39-uzkdHu>Le~c5r-@xbupk!dbkh!!GNWnwT@;jB;Y><H3`44l=<h!OlN%okrm^
zR(9*M7*eOEgOtR{QY<pEC7(LcjeVYUtTZtj_?JYfk;FO1$;E8IgI_<|+nju$x%y5H
zPaQF;S-Gz+B-=b1$G{QJ>4&UB%o2+Qj*B;})fw<M6IAdbvH+8G39+#DgeR~CnPeXs
z-r_@?wk@i&3}a<2l4(NM6&Sww$X;bb1bUU*!6<wHsNTfwb-+08;rY>+4BWK0d9t&=
z^_@#R)?>qr<*eA`Vos|G+jzQ;VE7rohw77NoKwUHVR0^FU6~w8x%g=NvwW<YiUr-P
zXtS!`I=DyPoW78*h-={uorWZjolrNwNU}+{=|v|btz1Y@P5?RreLGNw-8d|jj_>%u
zW+w4pi=74`<#O6u`MBv2KBq7}=Goe_`i5*yY!U^j!8s+8!uLs%Cif1Nx2!$>#f7NV
zsu1-buxPI$rMmNUWA(R{qQs4NyBM|m=J4R?WOM&yBiVJ)e`chW8=a*Y7Pl}zO-zJM
zht4%fuN#bv5g6W}Qrc!FmFZBrbEb7!IgTLhDOv_H;4DV)^NDwze^~JjojBV0Q!{z-
z-QLchB|q{zPPUCDFUbUMYEWDjWg2^l?CG<0=gGufK1L$E>G{*O@TNDr`-qzu=Ys*;
zWrzVxvWsi?DoL)j-k>vV>%nD7#RVUI@;q#EbN{>O0k7=hDX#{z01!R7^}3ntlX&{)
zKgZ*zXYf)y;Dt^JNr&PbzHARM3!FBHFX-IU=oNDChEGJcI1a){B|c1K4!3l4JoP!E
zTEYuDPg%UsWO<dKCPj;DR9f>yrxMsk?-3y>?Q<66(|8!tg_EPrt#5YsU$HtH7$oq(
zt-(W;Hj-;Q(L$N$B1d2y!@rQsgh9U8+9W1L`%4UMJTSIF9DlocNGG;WOfD17M>b0)
z7Gq6Z;KV;1g>l#D-d>JlJ7dGUHzIO!7Uq@ZT8o|Hb878ION~fi&c%&XRv%+(;V&(g
z0E6I4>7{s})O=wPU2-q$-z;UG?7o5VY3ubtGdVigqwjk(F|Zm0Z5UdL6SnAawl5sM
z+}?Td_LWd5>k%hrlD0q$E<ZgiI3|%x0ZUcCFc^<*48y?uq=xHK{rM(Jvv6CJU}lj4
zmQ1WiZm7;kLs50&K&4w<jRHIk=YbgNB)6=TfSV_abXJ!lF!iQg3CnlELQ5_NpSrwt
zv_<C!M;n&YK_$)Ed77X(t#H^{B@R8xiB>i*LaeRFye=vxn!>KcrXP-Mho7tjicDs(
z4kEmW&PQuYtFkPT42^DYnmz)q)hLQTTt!5Z^?K~IO8D^v=9Q#++`qV#FsVxQT5e_$
z0#P(=O&y|OeEC5}=ji7%jvr+uBY}+3LZIRxUq{6I9;d5-pIPK1E5@2L&zpC>2~#m-
zxY<Ah5k~qxE}Eo&ftOR;qp5ii&o8;iDS9uwXw5~z!#FLO>;j<4;&0{z)CkxM0>BU&
z?kMju*)y|p5+*yMEqR?`CRn^JS`u(xwt9#~P1UyIaRXAHY#Lx9@{ZE*8s6^;K|uR|
zIuhz|9+#?nMKDh>w%x--ojT5ADsisX-cZwAIzD!XlroL~l_<GVCQ(BxR$sjkYlkUb
zszX66rh_Nf(<ra#Y(6B<Zxlq|m6wRdu&9dF&blyF-Ho*wNgCXcLczYIO{ExW0+Uhd
zLSm#iXG#gEhMA#PeZ(_7IR~x~OLac&3$N!_+q)3`ptk#=L*$hAF{J{D;PG>rLk$hI
za6^eS)HDeg8K`HEGz=R`%p+zPk0g)_iJgza+}zcbd&ZgUqOKO52^BbQO&5tEyAe)X
zUJsx(l_D~G9B#y(K3#VPzBEX^N=<Ix%ZJmCYN{}c#3}+{lVn>wN4#q+V^Lh)V5O}6
z=jwTCD&ydjj0A?M#sN<eivrw9PI<+abg&g?&ZFPHr%4|j3Siety-T|qdS-<jBY8>!
z-%fodiR5LtpR^Nb<xv?cwWSYt*G7*rfz)6{yIYK|Npxt5Y&amc4xBix`s#>v^@(>V
zusUBexHu$n*xN$;TL<6rENRr=>XS&IC-urAkteYb;snxPR^jc03NOO*wzF>1Sx-8h
zjmM$eVCA<^c!gcwuJ5X}5|Yylvi9Bj-)NkKnrGCHPy?3c?KWDp^g^&MMRoxb%+f)_
zmt2HQKwKC!n_NIzAF_=LnT~xLg72<VXBpLX7;2il!vfxJnX!<i9Qt-U*+q~`4#5Gi
z_oeogHC~4<fu{6u%E~Cqot6EwEE`(<OxA0hT}y8y+3lP!uo@sHD@)74NkU_JgImSO
zSb9shOGC=~`2{C&;7MeAe-zW0#^NBJhi#aR4rd@=3%)o#h~xJv9rv7U*w30lAdz4w
z^89n`s~}rlB@7Zvr}+ey{?KM8d9sM;N4l^(9Tg7Ptik&8QoFIL{n7J7N6oh|8ML~N
zK)IM__qyB1e0(Om$4dM8KdjZ`_|5Kd?8MS6WY!J@L3$+O!<krWpFZ&(tp9u?29oGe
z5vf_*m4E}tMA%vU^yBBw<gv$~TWn~Nuda{W&Ztl<12{L*@mWp+#yDrD{^a?pH>F02
zcG?5R6_`PI;Ox1K4KL4}H$2XymkjI?5+_u%e)`;}hy3UE?#q|r{lmA&=p*+^jv3#}
zASQD2+x^{x{pd!`Rung&nq-#Uw@SmDa0m-9t6#-OM8UIcfI#0|q^Xs#!4pW`DV>M{
zXB<pWlN)1l8X@u*f*aj0(FISRJ$BRLEG&tjjdDyeo16}J_P1fwV3lCy_WQp-+WFHv
zfzLxfeH_B86EWYPxWHkU*I-=IoE0Y*3zD6w(&%W%+2F(2RWzr6@8S4k_5@E05La^1
zAvztmoV(k5vH8i3Ewa(M4nv&nJJrCOtMD!{2&VSaH@k=^$osScZEnTCb^qYaH^(PO
zJDYC;U!4YR`L}l5%z8+>P(+LUu0&4meqXiyyWQ=I>FOCf`SydF4`2k_)4|9At!gYf
z%k3L3gR2V1+Eu%psc&d|g|pmV1KogaF<jN2l@G-2BnON8OJO|EqPkRjfn>S_y&oY!
zE_4M;IFlKS0Sg~FRyQ=B!L4pi6p7&JGx65geGZZ=a-T_9e8I@xy<ChDVxpO-$8F%$
zt*6iM<|Nqzivf>LSq(zqjfB;A$C;qJbHZ$1zHi4f&Yr@0<Twe_Vut6V#-2V|c^+f6
zRRHGfR)x4^J_g-$V%$(qJ<^h7=GNop-X86ii8oSkAXgBDj`>g(m2Xf~BHqk`-sqZI
zuIkhrI;mUm+L8)k;LLD3cJmRbo#nFrixS$x%T_AjbSa{iLgzUbBvy-9FSC$F3kb99
z8mJy>x_EMn#dhb<w1<z)2@Js^#okT!j^1*QI$~5Z+tB0o3ePk0@M0YDNik)(Nw(J?
zy<OgW`PTflbfAE|4_^Go&elozD(o?0EdAmFbxiu#ahR%q{kLMayi&uiC(V=Z4tLlg
z1o@5aw#bhVGpJ5WJ1{4ZVoMY&eA;WM$2)uI7h?t-h^cku87GQvS<Hj!fi8-dQ>)aF
z3_%htld$#?Z+n9*kZXamT2|A0{4{7A6m;twT#NuyWnKc6`kY;&aQBuLoWX;9v3qiG
zcx=JC9DXi>7`p^GeGl=?r-*M3lWZltolnvy0^c44uVd0H@$`b1O9yA*586D$0fJsQ
z&&u~Nz7zTC9Sd_HNe$mcq-t*ZP%c35qFO5KjAEod>#W=yIeDPY42VX?N99Ev5SS8c
z$j`k}ASpX`ifO8hPZ$P=SPM+35NfY|=BWdyD5o4!Eg_kP5fI?8g>T^s4b?X_*{lqT
z)*3|<z$BW=C9{pG+~au=of}9RXSCdW2Bs|g&|ZPvNtu%#SFql@6hM~Y)^-1iNfJ0i
zq<XoApc`B&f@FkqB*}uMOP94qff&3`M4@88Ju4XJ={4d$rz44{=5<^$g{RAK0@ijA
zH9-yb3)oIId^qKho<6A>RvDxcumZhgQVdA4;h@Fz+=?(M!!OlorlIe%4v0rMU0GGa
zskX{?<CVu9SGzz+EK2$YI)Ws0t6t;E7?{7KTDO22)5--1K@kJHCWEJazeXOdLeDJt
zFiM9hkJK-_wH)Q|MdIMZZC+Ip7cL9spK4*`mBDO7RB@XM@h{^7VGkM|)z`WUf}PA0
zhaxm4G)gW!I=^42V!_nEfFPU&mskz{<TkS5E11W|$JIJVD$9f`NL1kNv)+rnW~Xoc
zQ!YA3-!74F2v>)RbwX`PYM-&grjn?`?I^4L#)0xaXFw2)@vT4>=v<ja4Tl4Z*P1Zl
zy$w&FJZG_!D+(--9D))#W!7^q@X*nmMKocv#t8nl9>?b~&s*rF8De*S$QIgSUY5KN
z^M8mIh?xE+J)1)sWz#>BkZndTvLOdi0j_2D)$z`&Ke4juZ~(Gi@Q^?cVbbW{%@;=`
zyod4dv^Cg90wF`aDk~BfzpX)lC$A5a#S_@O#k-NbMhd|p+=ELTne5=QpK>sb<E6kp
zI73IlQ|&J3`xREG(<dZFe*<6{$Zi#vjvCEl&`IVurRsTX^>k5B>i)!;vd-Pws_;6O
za%|9K3abu27PrDXsUU*8E+jeu{0nb3&mHX)xPv5w(V5&uU1*E*WQ94-Gm!vNc1i<4
z9WFA{D@17@Po|@0qP8)H=Ymb*O$UbHQ3)Y{?R7Y0XdTB>=N}WUqhk{EHp^`kHZRP<
zWp!wHoT4AGTU$her>vR0U_TN`xe{g{p`Nj<h6A@>OvEc`xH~PwXKi8Ud{thhqu!Yu
z?9Yq=ge@sFVfDdgT+>4A>P>zhUPleF7%CMzyeW{o+Ot(Dib0FD=~mkNTTA^bED4GP
z1BZkU5y*$(c_9)%iv~O9s55>jo{8a%kDF;qxS06noQIEyp8Ly%psc$nW5q)95o2_v
zuq;9dob=T}$Z`ERiO<Z9)LG#k{Rfb3Oe+oICxwYw23fF&<<JgUH}H(avtWKq-uX}c
zf#}8ju8^w_lSF)}@<&T>hzj0}CEtP9VLE16F1LJSMt198kODcm6u72Qt^o@O04mhR
z^Ypp6whv^x6RX05uXavQ<<O*5Htm$O5&P-b&U{E^E<uNsZ9H}?j~QL?x`Xa?ue{pb
z)5BzJK86usJD|a;6YxpEL1g7|Xe_deC&gV$cJy)?I#*f1!UzMfPC0O_FSZ#BVlZT7
zb})*OxNxz!e4suSzvK}M4@oBVBsmy0_J|spoD;X@phpIo%ZF95k!XvLw{LJvVlTGN
zcqW2iPlxg0SO|lBuyYbe?IRO=gCpTtN4sgDblxy1ne+0B5JX~$ZRtSV$PCXX9}`jK
z7x|E*h@JOsWyR-s>pXe^a7s7l7ek){zeoq*i?_##giymnxs*U!eg<vvJO-BbVA6oz
z0_%a7A`BfI$@Z5m#K4VDpGqYEi!pJnF2wFMIXu{Z<<vW=%|R>-ksJ=tN424*N@cv9
z&`Gylq=(p&Ikf*E+)U1O4xk=0`qbo7vQ8j2WSX5mAIW~Wiai;CMhSNmDFch$iUFmb
ztV($J(X<k&p#d6pb}om)(^E+>I}9SH0~i92j~M0wwvrO|aZJ30_X8@HbH-pW1M*iC
zAOd=O%2Lqrh{&Ck5+e&k2ow7x^l<MnUuNqRiR37usk3Njcy*>j^^-j^-kQe&6|a}S
zg?}<aCFPK5nPfJrajhtmDc9F$V#HW37a16jZgo05Ri~Sx0BIK$OBDs4S*Lj#@NO~D
zh&_s^Rmzg2CHx7J*e_Ug=6`fK1r`sLN|8Qoo&LT^MP~MB3L;uw<Py`aLYc(tid-v@
zLPu#iA{lUOFD7YDE<b;)AU0CRE6M>0Q;1)u`TMCn@`PL5rWG%SFZ<U3sR&?=+^p);
z+KaW@@?mzwY8zHHv|214ftbXyVGmBdf-aS1zug_4i)6`$*;+wEB?D+>IIEb9)3dVZ
zPbZnf#5~IoXH^QlNlg)m)h2xK)|T8o7uV=qJ()L$%3vjaavvzq;$b7Ef2B4u^WMRm
z2ex_!dJ`9%@YfjD<i1f8wTY09#c)iDKT<+j!6i$wqslpye0y>rrn!~tNxGvc?<3(-
zC6VLE)rVu>t{6d`BV$sK^351o+%<0b_+<0sSmbi&-y5VKO=n1bMVHf%_u1o$dL<qc
zALVOD?in+Gmtv{wWhcCa2+6N~0q%eL{JCX!XFB>hNL(I*OI@p^F@Nx-uU4KsZZhO8
zSmFB5pa%~n24a{WQnGdO=hK&ao3D;fw|DlxJLL)`@G8NO0zhRx;knYEWaPZZX2>-=
zMa@VCI>0;DEr=_)>Jm0e&8JaFYDhf{(!=abay!_av^u{DVX2`Tl-*?RiTG7|u7$g-
zv+fq$!Eae&%&Z=h1Pah&4>{(}7pL96Vd41b4bAZB%eVVmr^jy(ksm=~Kv~H0alLWH
zxnaw}(-6r{5Q81A0B<LWP2ywV(O*^`86Ygfx>!9AsEB}R&!i;HA#4uke9AKzPUD1@
zTXqg4KeJ2go(39Pfk;+5`stiW8ACLP4KOIocH`R&D*t)GouPwS<!?Hej<#HkXfpwP
zQePFT9)!T+Jp+tc+zeah8Y~n;$A$g}9aiLrQZoESsn%!_3H)HegvfYPj9qD;&EW6Z
zOkq)v=|HSY=Yq0|^NgbyqXC^=Z!}uT!59&4B*4-4?=ZyVRY7W7o}JMTf6Ct@G3)sM
z`~RUM^}jyQ{=!{AD}7N=k1y!2mw7)YnmhnDWX`R;nqDU_vSE>zm-N@}BqhO(&OSOi
z>CZPbul?&G-Cq_%`ukfn_T4na_m>$r^(Lil*(-37WX#vooW7l;lX7~UCYxi@0<Z9v
z{~*!jGI`ymmdErX{c@CEkcyYQnf6GZ!yWm6<X6OokGa=rxA;JJ|G@7eN}|SJ+Ot~_
zXE8APzMoIhJlRUe=mMARMZe>Uy7bE+EiR|&50_KSQ`%?$Ws$tf#yqb7yi5!J4}JeX
zQ*IwqL#h@GPUGx-ir1c8myk1ty>Ui=y&dP&hl{K~%-`dcIn6`XPhO41NYbLYz-;~J
z6@8@_exx_OCxKR+t7(sxr@&p*9I9pW>`rNJhkaS8Z?io4W=g6OuQbin@q`pbS{7V<
zMFJ2lz#!{tM~*MC3}|ov`hC$S7PyyA$2v+P=e>M@W%ziBp8r6@yQ1btSgY-n6xL*G
z^N3ECBjOUG9hiw3o;S%Vnjaq)MQ0(9s)SjOE7FjTm$1DOW(J~fYL1O?p<9j>eYn(U
zv(bhfG$geOUEt7ijqdgyWZx$uC*t1f(1Gt2N;xt?%K_V-<h*DgBhef>;i+R`=YfXB
zo@N(M)x$U}#PjT09DnC16EbLPa_PDH5+#^RLn$RYWsV;dvV5(RsnKYC=1-$RluVP~
zY@E1|KaRWmmw%FvM*VVZ_43xi{`T9glh6H*75Y4RvW|Z{Pam&@|Ke-s$@=QQbk;ko
zPaZ#hy1GX9;g7X{Nmf30N9sOPm}QgXU#4etLQHSC@0RQTq#sls8s}$I9BW&&V~2<>
z-6}+qpo=)18wbQB4*Nj$q_ZB<pGMJ1rCohoO$)GBLTDKA{j8!g;v&4Q-F)Q2=!x+(
zAf}NRi3+6&K(fk`<Jv|3`#3^O7>o%x#leHF3!thKV<v5_uOKWb48CUt2@ZgJYbM0>
zIkc10r|l2+BXJ&2Gsz~Gq`vdlGW+PkxuiOG6Q&UyE+k74YoAEYBK1WfjGKZI%OE$d
zgVZQZ6ORl5kKMdzAx~B``bj#O5_^#B=~VgvcFpl%z!*TqZM1<pj~E?-Q_&Ddq<#bh
zy7h%+BN$PgQ-D^(&od3fl(`IJ!Ype<s#N5WmC7u*l+@iOiCTSH1v(0vjULdfxnlNE
zL*SZ*Dc7G|GN`<)R+|apSoP+zvGb8DWb=ABmRotLNSRuq9KbfTICNeQOuUZCK^35l
z28;smsc{M^BT*yp_EMIGRE*wGEP@=BE85Q}E2uND)v4K+^;*OS7U!yIbArn#ABsWj
zL!MoYik!olb+vV2agw}JNIzK3utW;o#AxgqfCW#D*viZhtL8YlLrr~_Nyg!IBX;us
zpjc&-%K`~I!8wRyc|aryKV!3@`%2&`oMYPe6Ut@L6_W<%Ql%X1afTRRoU@FUk69+!
z8IWH?TI#$<q@@AeDkd|OptzKDAsW%zPKPpV)>7O;hii2rDul@Dpk3ONK>8S7OkpI&
z-2?hEzE%Za=o=w&L-j5+NN&S^kj+if02Y~39}z-8WC}$Gc6iRFBf)E2T%;30K^<sJ
zx~1Up7K8n{powRXI=u<{AB>gLGm?4u>Nx)Zqp4>=c3DCpn5xSE-~a3X?e2v7JRaD7
zpLQ=rAs$^`m;4s6t3jIg8xB#=74c;C8&#yhf`W<@PGso{%e5d2b!#FZoo4+SQR0@r
z$8IfRAmf7iCEZHW2K{+1tcp`^*aSzbD8>DFw;hG#m=ld}xou~>8}gZ>T8)$M_S3P(
zzVRmE7I}V<oM^lN!do4Yh^qriCY#EFUUP_I%0{ZOVSl7%Noj<&0YD8gdzl~@zL#Z#
zcqW=+P9maWf+=WUakzW40o=lLJfJ<?t{JwAMH>T{&r0lsdzak<0~TyaZkjYD^Aaf)
z4NrdfmdlqO@&oesIp0mch~g>~TG)CEhZG}}W?eQUa8Fzurl(d;<))uh-LDGl$Jq<!
zYf?m(Mvo+E!EO~#kDsk}<G4#_fux;O-XW@iChcmmHP59P!(2zhd3Nq@Xm?yp)EEtW
zLQpT#YS(E1ju~M?)(_M->`iID9kHP3K~Ubznc-`n+xwENh23Z|T+Id@Li{{1W5WAz
zbkjcrTC5Zt9ySABV$dVnlw5!j9~N1!;W{JcT`V24))d_d?ebT)A+^Ij*x)oh$K}rS
zuoVs@G&}Z)x^wt0TuNtIL(C%{3#B_l*43Sy1<W9wG?=!saE3O-%k)P{GtP^4V^h{$
zDoJRv9w)5e?9{*`61M<UbiuYSqOQS+l~mo{{cG1s4YMJ&R3GFW#wWIh*b>WCY%Et2
zQv&mB<YPN2hyYkpil#bwHO+fmkEf2&@j%pYCHkemXO|?6Zuq>EzY;8*Tx(f^87oGY
z+M|Zo#=b)CM6^~I#P)gZcHTg?(U$T++OXA*Y;avXE~gl>&+u$5Vx<?aCMul{qceeH
zOhoF-e4vAq?6&-XHj+&{@|uacc&|b!WM(m&>Ym5+@PPq&M=*al9+KVe7Fg-0gc-<?
z&&71;X6fpZmHtLl)g>Bz8$A?eArjTK?g}3y%1Kk-N~de)bTjCMm2^xK>_LwC5P}j>
z9Kj1PbSMhM%v9OTXtZ2~E;O4n^VW)XvR^bzRyW8hA$pcztyX7G1#-66OowH`vP0(O
ze0#PbVx&Kr83m+zXo%5N;{r1ll=6b(#l*paW1!(35XcEoh&y{(X`oHvDFEh3RMp47
z$aG^5uH`v2ILbI=ukGYdGVjt&9Pk-(d$D|d#_oZ(0JOPcjHp%;3?VF~LoCNxN~+Hq
zb=6&dk=AXPO=mEUc3;qS6I+5QZj`VH<ii>9%B@><;e9X9QZ=A~3zQt1cOESh#7(Bx
zhCi~SrT2ZiZJqWDBYn(`lT1GgIW_dzJCIZ0;nAoeW^U5kcH=IqTv^!lHX;f1m->Z`
zRl?MgY|yd#m2T9nbaLBDH<LgqkW;4NMH-O|E?jXVQ$oiuHy~~8!r|c(D=ZZzBhbBO
znQb@`vxKC}U0q|6k}EuXbK*qGdZ`YJ)=RmblhY>a3_;C?Rd+_Iks!97#0JaUyt=w-
z2Ueg~SD$Sc<BMf|e0g<wWf{`&X>oq48czFiGKi$`+4GhYc1hin91_xs-xNR4ft`{r
zR*Daa*H~;+p;Xg{vy(RJOFodxD;)I-4NPO<lY#k|mfn<*xTrbtvtnLeZvLM;5BEI%
zuXe)Ww0%X2Vf>SOPunDDqW#O-|04VE$=-2$(EIG~xY_=@^7!fFr&as!%G0O6+kbzJ
zPY_<#h&)cOG<@e+k^rinlSbpgg9phA1pcsv;iS+gAU-<Kszv&Q5#bhnqt0d7tohkk
zGGG?7_C=dyg|o8kx9FCH!644^bh!MMXCH;M5t;T^HYvY&ySul2O0W9rIxGL$mL8qZ
z-Y&U2fDkc<46qZXuFfqz5(lb>-Nm_kvbC2i=511q|2paRTa$kI*927rSkA8L6G`se
zt@bkN*Obc_*|3F|wh+ftw#&=EN<j8d!t>H(T#$ahwW+DLg1G{W0NgJH!Qjzeb<Lvm
z5C+kbzEBtak1dOX(~FaE=nPuNHSVc(t+C1T;feslMxb+dqyUXld9#1b(`bKiqp2lN
z2}+DxYe`b2LvG4|e}Ao+021CC5J3<<SQZk}m4yQ?mpSr0;+RVt4RkzdFPG!)a)eOB
zqm}YaPu8A3r@#68O7a(e0w1{ruV`@$cYB#fzD&PLTkS4AQN5pfG4FPS)y_1Z&Ur&O
zMe{s|8fWAzIkS`aSC=FD*P0<Cb(G&0y`6)^ZXXjmefv<l=}dEO0GEc(W7yFrTZd`{
zlt1@4@Ybyb06-oo^pY!>%Bf%<NSi};vNeDwgFHIeqALj`Fo;|Xg9tee25Bp4!j=du
z9Y*|%X4%zU7jqDAd9I@?s}_c-fqRIJ-JDgjKDJ%(7<UvE1WU%uD#NyH|0x&R@<C;d
zh+)F~p#|s>SECXFLZ&W?K=}+S$(}*TmG4N#Q?utK!U`L^%Li(rOnb`;WzEq_zQ(l4
zc5t9W9%_8?#hW089rvIWjqKKvleE=+IVI+Xd&ggV(G(jumko6tY+#jGwCWWcy9?-V
zVi@^o>V@#l9qCu;ky7xspbj^qnlw0iQiG-usKEAaUJ*dsa5}C)rBBc#BHcBki$<Ur
zYvO=pNR$RN4Nwo1POlI6ct2Hf_&L#frB<=wRrRkeK-jrOLTG4JcM+rjr0?AWn<{kQ
z&m{2mtR60>kX#~;5a}A}HK`(W#DL;dKWZp-xbV5uA;ODlCD&Wxg4FuhZH)^aWa&^#
z9ms`-;0t0<iZ4?Z8bdb89PBG`TZt$>6F3>xG|KA|B*U@mmo!1`hDCww0!lZ}K4{dT
zp%9F7$vC5_$P0(@Be-nm=?6B3lK#SAfOJoTqp-qtPEj965{Eu$t?J46THRyk4EUGQ
zP+$5A;6f^zvfgkF`Js~P){`e}gYx+j1m{oi$0gq{xHLH|!Kf70I1^`$M!dMz#lm(`
z6g_8Wr~c&@rpIV6DHjyHrUhm$)!HtSJq{ELSV1fKK6y72%kM%FPo&B*^E*dDE~6l&
zZhvHd99SFDj&iBwCOEU>(n#klElFP-W)n;|2c>5$=;xLn>~_Nv^ImF7!dMx&$#$`$
zJM$?Z`9W=9i9Z{RVZ%d3x;-i?CkO_#1dwbTidiy7c2KhBoeE=!_B}6@92_!0z`-%D
zzQ`=$B;tf5c1%jshwQIBc=~JHJNv79VWT0ek0sqGfM*^aCTsk#ZRi1Fqtgv($g^bz
zWq+bYB^$b(<p|+eC@m`BF^KpG6L_g($q9tQKZNfZM`&0S7Bb+WWgo)k^%^h~eMZBz
zO3>)|pv?O88;mD*Y@JO@X^*yYSNZX5SW=|_?d~6+Z0_xSZXM$m{g3`yn~ncj`Cb3}
zH9p4~(84#j-|YO;gslDk`HY`v|EmH)4DPeO<Hr5J`sC>f?fH2BKc@SC-~YeH=YgJ7
z6&xujvzhqa+l>c}2SKI@V)q!vIxMp=`?vwS4iI~EmQfQCoP>Z{;xJ4n96uunmj)5B
z!7pvcD*rO>U7i#Hoi?m%^j4UW%MFQdu*5O0Qdeq4Ln{Cq>ZA(kM9t(AbB9h#L@aRr
zAc+8-_sQc|FOu~);)E`6VR9)Qq-$S&opgwdle25mocX6S`E7OG|2DAOqB{rf&M)HI
zFM`{nCobYAqQ~eu&j3rT48(!zctef1qkea26rERR)XEF7vS`i+ke9>)bjv5%-QU`K
zyS;Oq+<xx^tjw;4WE2t*!9unRd$H8|GJ%|JYD~_mHKO&T05P>9;p;w6&()w36{N^q
z21{sHDcPF9HVCXfwF3_T5o5t+ek5Otq*5a;tC7@BT(_lnT@Ga7U#Jo3K3`#QOU5e}
zA(%w4>*{7vq^|{SV1d*X<h8Je+Fa^q*DhaaA%@0Tpti&f)En@&(-9gt9LbM41VFX*
z3I6D`RQxHfai!UpJOKh<P-+PsDau`6eM!utJyXggUq)QQ)Q*D5on;rf7z{0>fj2bP
zf|2B)Jz|U=rp}Ofd@*&IuibNpTVm+}?Bx>lihQU>9FI6!aN}b^m<dLJ1sZ9dbFMLv
z69tc)mJYL2GtXs)Fe}mxyXyE1<0J~7skzFeU|i_-&GY79`|aM{_KxhHJ>-}f$N){5
z;)k>otw^neYj9M`(E7ns!qr$kOV3#A+MQv54%lF%`1=MjVzf}o<OG-83=FPM<)?O8
z%(;apDY)w{Gqt~S^6kOVH+P?@sK)m>;1m{s+O;r`ycyicJnPL!SHqlXyoNIs$ri*U
zI!~S|)k3D{8~~v}i6|^c+B519gRE+1Twa849G7d%(bho98kj>~+7?a!0l(npp*1y}
zNyCT(#_Nj#@RBAw(76pg4NUGVvyv_R>_Th7u)fT;B!E^<<0q<9bT&KPG5efvHwToh
ztwGr_QX7|;U@XN_+VZ&2{LUU&JX<Ic9))1Gp2dU4>yUL35)?g**7&Rw+%M)OnQjT;
zml%SjnR>&g)vqq2dtdBeq=u_hzRyP^gcxCeSd^j&1`Hb4dA{22JbBjcwCOCTQ@f4-
z>#)K7fsq@N%~j!nx^@pgtOsy&*3{}#eR^Y~lSH4WDVRk$6;_&|C+W)*YvqfiwXyL<
zQulcvNPq#xR<lC#o*a3E|NY<poqW4_w2ypXd{?Ff+uxKyPoipHjBTi<rR*c^1{bi%
zoE6a<8NCs`RHL6sC&4a2BRD_C2<dUbuhN`rN&+hxTN5cGNDZ;AY44$9vk1@~kZuYX
zwSl1Layzn#q)H4YxV!De6sd88V|VuYZCxm|le7~pL$XNQ!~3@UV!1H}l)pIfR$cMn
zJ&@P(3t+7cD#DK@vmnu>xBoM?CNm~YHcq%XTcTpPr04L<<hz5n$>z~ca{QM5gFn9A
z+&{sWqlB$P`&&E7$pIq;@9g6ns<NKE-bolG`sL=<&M`IgA8(IOxQZkogb&`H@EtD?
z_Vy0G1-<O;?(ejPhCa)uQQ0Fz<sF<0hqQ@>m$HMBZKvW#;RFQ@CmqRM9L*mpHzLI-
z6HzjDal8HOoZUFXDsc(B>59;0`6T@!pBSU~R?Cc6dZuBJ`MGKqOKc&H&v@G&mOx;L
zW}5ryiN~Q^P)qdDBg0WK=6-dFL&yvSH&6ksqrv;72oMumIZI*&tzZ`d*VD`va5V2b
z>(>o;(b5Sw<|f__QMJARMg%yo*rBC+{?M<PO+_hcC*S#0So2<T=~nnAAk~??>2g!A
zQU}AK!xNDo+ef2_oSV`1rJ;tB-~n)ANatN=uJ_a0Oom}lU)R<x<gDD8V0|^4*29&|
zuB97&i${NrJl6-wrm}@#v6NDSm_kNauvtWcF+AyuyPNx)34<D}uP?PlK3C^@C^&_c
zTR@$T0m4tXb*QUF{WHHXx`hjJ<Khz6Q|K2L%6x{&WqxsKp}S>Elrt_k8DxtIRyBJY
zQh7jIaeG%(Jw>xdWOtQ53$6N8wgXL#agKwMHpXt<X+I%$$r%>8b1^$bY8h(Qa(P`Y
z69-rZTFi1;0Ca@jn6PXdLrkRz>t|1R)Qo?Iy>s0WLxYsp!&4n2pKzW-2{bkrrsfbi
zK?-X(=*gDN%Hs~RLf%NWBA9N;t-e+qS?Y;lB?NZ{huv8wNP7ODqx(fG;`G6g(Ac>n
z1t&N+Ud4&BsHYexZ9@SRaW7^g4sLPO);0^rN4*8{FKP+GFVRIrQYKGVRxt9dzKREt
zXPrU(Qad%l+IyNFv9DE5=?Gp43T7`g)UTSX7##!5GVKdLm0bd~>K{lxkywM{gVS$z
zb`Cf9cK@`)wx$dr5A@*X);GdRlrVF4^>ZfQgCK5Icu2cy7~zGwDtw(1JukL1umPIy
z6w$&YOe>pz$#RNG%7CDfz$>+O4f0-3B#BD-J2zSE_mYz&81BJP_Di$ERD_xr0k|de
zxMW3aG=$mch^GTn(T+?eJTEm%#)Mu>Sz$PLj&5(=YfGPmTWbaF@U;>?;JBa`u8Pzs
z8Q7*zxU;<}djqHR$k_TCiS#<apazVhK0ATIc&kI3X5*(^TWgbgAe+@u5}Lh(jtqC?
zG6Ly7Nkz7YL%{Lm#1%O}UK^h@7GSk7V`TA~v?`9art}UNndl8I@B5UHo!|``FeLJU
zJH+`gqK1T^<-h?i55v58L)(E$`}fc7$1BgnC^AX@)NptNIjM<*!|8*w*@;Ig;rN5y
z<I6TRhKPY#Er>vN7Q?ESW+GGpgEz_H&YMKiL!HDIN1^#BExqId&Rk@cu@j-wYegW1
zRMQ<_kGwpPvivr>9H*SNJ+akLQ&o>GtB@%ySmi<Gl`TB4r5?nTJ|1xBi%_UDC9(n$
z&azZ;L7fSizH>So6+_UaMpJuXh(U;#72NK^IZSFyb=I3n7_ETD0>^fQXqZj9ZPj3o
zi$MmqP)3o3Vo}7Auil4r;?vUE!jK`#Ol-;-!iM;D=&F=-l>{IfsQekW-4-x*F630Q
zaG)tjb|?!0@}_YpZ(-lgC5Kv0(M5TUOcotB7Yy~gD1BLqXOwqTPXMHvYKYDP&DC4*
zHar>1pgc9o4;<(h-QkE*Z}>H+vhwOGafbVT`?aqO<n7MNUbYd(leJz`;{$s2;`Zw$
zK}7v1_GdpGy~`FiQ-&L`cUgVg)@Hb5i$u$3Qvs|V>ntlId%$5bW3!HwN=-}`{$cgo
z6yjdf-#9J2f@gRR<1b)z*j6YK0%y|%8Nd*gBzA?h1|tTA&byj1ln0X@#;<C~XMBZ5
zm@LyCTQ1A~G6(cl4-|*T?Q?6a46{08mQ*bu#?QQ5GR%4G>Y9nBP6&x>>=?^nbhBvV
z89goxi-n3sH-J%$cz_fsk=OF%u_2NfmIx4N&T4AkwNZOsKu?{!Q+iKYp&=Gad~3BE
zekCviEt|?=QTMBLt-1iIBPW@4XEDVoG#If^<+$l=80Q1wiuuG4W2IAX=d+Yxx9MRX
zhUIZhQ9rOsux+*TlgnzvEjT=%J!!%z$1F7a{sy8%gGC{yyKu~tT5fM-i6KXH(Yw`-
zF|ViQKXlrw7OqU+*F;BG9Aq}yum%BTlnvQpO6&<`vloyNSkLWn?ICYm>ilVfln~N;
zDD1A7l$2zhN_>|hS3rY=p#Y@%otD)Lj0Nh<<|%P4L(;YwxCeq5Xj1wdU$JC!i??fm
z$Gp(gFYVy#>Ozwm)IZi1l10nz`1-4)1EcqnmGYqpK|Ne$Jb@rMZ-xUoki|b|jJH?Y
zjSCf4t)tUIOvGl7HH}MuS?mxKTS9c>2tmcJhFk#Yfs;w|!oWa>lk}r=a7sB}@8sRE
z<gt)p8w!FHjxUlgzp^0)Tvxi2Z123>e7kqD@vm=ows+sYsUMAzU07b~&O>7z-3{)x
zp(!p)h`Xk7&FBG+vak=;;Yi^ty7_eL^(OuQ>dNWi!QOYBwUx)G$MompCk-=zb}x%U
zr3HD|Z&x`o9+g&K3+DWwtOXC5`609fcT0PQr<iEUyT1&ci<)i+REFO)9>A?o4PW3m
zR?YhCvZpUB5TeeD;>v)b1-+-_3O@ow0^55QTILV}pe&vlh9x8AllE;~SosB(M!Mn$
zq<w5zABP3gm-yfVPmh)Eq{$72R&s+-4L1|mG*lJlij<O6&}9XR;n=M_6#{M~w%2LC
z8iKRBvi@wPzHeEJZ+g6<2AkOqn&}0$5$;sf(fEaSujuHk;jxxJ@7;F)lRGKiuXgr#
zjy69@@ivoyoz0w3g)>gd#>h%PB6@qIu`gof%qOvZB(R}rT_nb+w<;COAJTDP8p9<v
zrn%ZQEa!Y17y5ApZ$OFDk@#{80}byrHL2Ux;zWgsAqT#vus6E4mBg&zmP<op#jdVh
z4L;)#8$~T+Q3SY@SUT+(+keIxk=B8sd&3+R^qYDknN0W=J{G36SDvvBwYacy+IK(D
zB#fq#*<gMjl&Rc(b$oJg$UX+KhShzXM8AOT4s^~*F<QXNFxIBM;%~*79vjtO>D>5U
z*$>n!3#UQE?ss2xu=gJBADryI{O<JlVC$QmlllD$3(&B$8zqwb2nDB3r1WuiG3}@0
z`E4PwfUR~>$4OExWC?m=iJV<<R57_MI5UC6=jXrT?cwps=F!RNe;mBP^U)w9@HiCO
z0Rt?9Bbk9h0~(OG>WQqgx?s5UEH<aT>-K`{%?Ts76hXZU!|#CSd4w=A_Bvqxc~$LY
z#n`*f0=Eh@6c$>sBcvj?&dsvh305V!gc^749nuYn`rz2Dvy4sv5sNDGuDdQ|1vMcq
z%r8og31S1iH`@B}B8WenRfbF)zL&0{f>hwW3{F=X5m-UUU*P77`q5=DuAX?vP&pcF
z<=-7u+cEug=0)uM_pe~XuD$~zPAMix?}?j)!`HRY(1L|o9=RZ+W3+6wVFUx<JQV>X
z--t>bhJjZyN|Y~qfZzGVJxft$XM|%vl1ap~G?7%H9+SmTwS$=m!lA%;skPnJaagDf
zK!AbAGLHo?iY|01opsV`A+adcZqQRaz<4%JIfIj~H7ZUb?K=JM3?Pozf`rNPyj7?>
z(@;<NuxZXwi)Ya#l|`s|fh!}(1?S{b>NpHt@}4YN<ht)th{uJ7Qd3rX9?<tF!V<=>
z;Kkg#C0UESn{i1RD_Ev&Hw7utd42O?2uE(YNNB^beHNL6Ag)Af*5a{cT6)D7)M_wg
zP~~Q+LH|m|p7f+TuW-`wI-p1`30wVAoQqN-O2qQ2nVmyVoRfj0{w|z**VVJ&!X2TH
zQ^g7h+IAPrNmAg0;rFS_Ot<v6+igw!>_NXuEt<AW3%5L+_WKwh4`6|{F|XZOYw9gk
zV-!ydiTfP<1`qfnx<Eg+RDOQMTotgFLcWDB%OZudxiN9`$djQdkhR@>B5aw{Q$eBe
z8&pb(h+7&mq}AXVL4cC{v-*cfA!l^JcJfAyKMB{df`vSrT%j7+-oe)9-b#!Ac^b5B
zPf9`V6`ehcQxJnjE(PseWfpTb@p5Qb;kDAOrQR`^BAcA2gHh?K&R&c0Nn_!okSDKQ
z$nnCjYt7DCrF+nDEY@BM@Pf`rzf#$jlOauKtBj!WpfZMjX5oc`v4*8C3t}kaJ9U=2
z!Ck1Xviiuqj^nDX#d?GN3`V;BB3TKJWRA!LIR-X-W^_Y=FA9n%iEN|>Osz!xW$!HS
zeJy7$7UeAONi34~$;d=XF+Xzsd(`SQe2KWulUj9xxce2Gk2jCEc6Sp@IL&b(vW`@x
z(!2|06E5to!YDNSsE&t7Z%<CXlk-H#-gY;i=H8F^A}t+Ydytl#PTUE{dB)TLTR^10
zLvcTjq{^&B<O~}RyugmE1=H|&oh=D@Hj6_-@mMApXRY=2N{l?J(VLj6B!v+yo~qo5
z#=_}H(Dvm3L&e+I?Y@TfLz-=&*%mh>6c?HbGzUhip{YAMs)w|g!o`s>B=#fH6dnl;
zjLJt#5({gUR2g+&qvpf2v@WLGZ&8H+A+Eqyhw%Me6P?l8P-a|IzxrWMFtT=oF2WMm
zZAs77FrwBRQrYdnXn@VCD=}!+<#7}qMOi!P>c?>-DpcG3PUM%!tx%BcPREFjM75r5
zq8r@5F?vvhXbJZfKJp{K?598r*~c6e=Wa;hbiuOEMN=6Fj0@4gJQ3Di1grm1{NOFb
zyGhe8!m`!$=%X(lMM2vzb}N<u8-c<kV!W$XX$qruxPCQnK<33h`WoF)^A@Bb>CUlM
zO&Ks+EkhD4d|zsY$-4z~W#N0ZlD}KvHqfnbnz+lgeN9&Q0rTOzhvp7WAMl|(KLz8H
zKtLPj%%cm^J5eOqq4iU=iZwZI5U4<1o~~PtEEkL(;w6k`aN%~FQF6S$d3gN#;N%3M
zueTbG_{=gOVmgOpJHMALfJ%(Xmuk@ZI{8xTT71nH1H(`mG=O?c7HM{oLqGCIp+!0=
z7=&Dh%<S$E6H|a!!u8_HiM3vI8K^+rSjWS3MC?$Qh{~)18iez0h!fs$HX}*bG5{M7
z1gbpPzM7D@;irNmPIgoc*}m#Ify2&ihH>8Y6C|djFOp3T30r&O<9bj7G$G|_%(al6
z6Sl+7WSRP2{BZc}<Ah`wgcwwwrh6EOqOO4_{`tx?GfxE`pi)GfG720$3v39+nE`ha
z@<WE%3n+^R-*JC&(!z@U`D8`<Q7eV0LW_!_4)@-y4Wus<p_ED*W#~PlrWQlzw!De)
zm6se*VlzUnCZ2vFSh9SV)D3p}C-;D(EGGg&Pe=b1UbU#WD<sX(alNDgA1EHC3Ou0V
z^HL*LIG3h;uaFh}>t=w%jJfaXsiP7NciKGgxfZ^}QLQo&I{^5)m;s#AnuYslM0rpv
zF|ZF9b_egfV79S8rjr6ffQVb-bI?iGs*aJ=B+4IWQxe6Hu){i%Vsk*%n-pW0&1WuI
z#U^{;K=qjwb|piQLtR*Pt_mIJnLzzoeY2?FhJ}l#I3_VIHRsmMH<Ji@r4M@tvkWW^
z^g<7uukhoRmP=9!5n)Sap;Zi9XBQxrRyH0N&d0k&9ElHKWjVze5Zp~@-}}#(YB49}
zDQS;;XI^9Y-!biXwIK}&bS~ji>ba$T0ZS3-Go>L6+uk~E^Tx!?(%shKTQi0!J%}`c
z{VhSqkA}q~Mrsi$3H`!FCKuR0Bs1hJhlU+3xa+BlX=Kp@ET!F`A%-K-S(4OJ0|0%@
z_2g(Dr^(jQ){}Kn_sZ#jWzT-v6(b@WE{4uecb<#Xq3}xYoeT)!Rm@fNR@AwWxzIYw
ztVcNn9#%dA>?LaNQl?{sx`>J|-C6m!CDnIQSFyv2)S}})XV>&PpAgV^prt53<^vj1
z@G@nOt^sGv6qsk51b4D&va-8C6T!|i7fFq!%QUyiy2s$7Acgn2l^&+YWnru#T@@*5
zS}M$}d`C$V8Z~X;RO@$UR^;%9e8g2Kc{1n=Pz(_-ClLJ)Tn}hAFhpb+?;M{T9PMCk
zaZ#g>B@#g$f0rJ*9tc~AhmqPH4@}8V8J2yhMT3>A$w;L_GzaU3t{n5<u>WA68J4a>
zb$EO`&4#~yQ#RO5_nUW>??0@+QG{kGlM)wAZqJI`J0B$%c_XAPn>$wr8wEb|4<XF1
z#MjKW=ik;010^HGGPe6zk&4+SKs_xUPW}Ue=Xm|NMmoxswkvK4Zxw!|lf#?^GFg|y
z7(IxY6s9RH0J8z_b%_JjiYUC<eRZ^XvST^d28fNC#4MW_<8qwSWDe~sIIZij8k&@Q
zu$C&`3Y;-u$s)EjdS~uBeg>m%uoTP?Vt&I;)vX!fh7E&ME-TIwoNm;P%ODE)eI*3k
zHhq(X#A=beFk=OlF1{djL@%a>4(u@dT`n4}cQ+g3RPzI{eyPKZ#gnsZ7n>X=grNSA
ztKcprr07r=q$+#PE;r&_5}tdGezjn#9IM0r$6@z!3{$X`ym6${%OKhJ*rc*~7^l<t
zsXEx-`z}F7_i;S&0%iz$W(8&Q;HAnL7<;f9!9;sujKgj`&fLYYa9YSF3Y9PfJsXi0
zO(v7TU_k^}vYNHU*(7y`?jX|~8nJ3=?08f?-be^X6nZ`IK^``<eu%DoqD;1gO_W-t
z)mF(hZw@7u7p#;up93wL>K0a_B}CzOi3x}<5Y@XNX&TLHZ(tKzCYG1SJ<*IYS$I!5
zWvcN&D+v1>v`2pLJ(`z@?t8Hb!MB$jfV;lLd7v59rNF6~bFi*sRc9E>oa{GHGkhAv
z-(rh3)g$B`Dh-6MwwLb`+i|pWxVO8td9r)3e|vlfrvDAEeaiqy1M-ky4*dbbP=Hn%
zCXzA)$B1iQg7k$OgpxO+Z-7+7{=`y(ZBS_g23p>98qpQSfBFdDB>BT^(aJx_c~QOc
z2fqLBa#4mR-~XP_)vx7>jTJxZ{fm0asqV34P0&A!q_TG>Jj5lv|6cuRaAMQU*jOYq
zwp2_@haAgdT{no_*4@dLR2-4>G}L^ewfIU!`4hMSO9;`V0Z~+?sdUDeVmn&XuA*LR
zq_Em&O;SmvEF$q(I#6RS>vp8PO~;|;`D&~!=A&O|jknYloX7FYWm;YNV`)qZNPJh(
z-~6;yUty_)9Hq5r!1%-LqfUj@WQ}lOmYk6%8wP5JreP^0V(g_`TQc%;i)<RMl%%%E
zDUOR`A&s2{AEbI*Ta75G^vV+6c#63}zZQ|=JQ-_YuOPEm4_94kDFo&gD07Q5kX`2Y
z`IquwKKk0e!piw|!z=x^lBLhR_UX%uL7uM$65+0!60kTXWU0m{;<OA43a<v)pJnIb
zC3MMY)rGIpqzdxkF&qp@wVQEvZjqd0#~3-KS0+pDMo(;tS~e43M+S?@r4O>mhK!D^
zDlPVs%#>_0l5xvq@!a7fsnSYqJ%J2#!AHz^$${QFflg>h!9~(hs>y{0jDTAYkH6dB
zVxxsXG|~T-o!sUGeQ~O~Lh<et;M^dNj^Ny&M-1rUAc;awWyQ<6ODcFUnFZ~I(Ye>k
z9ApYjV+q5MORi105llMY^(Fp`qw#AW&=Xva<A%ajlw&)jAhQMMEaOIi+rlBPlFhd#
zuUX&Ukgxvj$(L@~+s={X4pHzk4nK<0ww;(_DPpJ!Wr0G$L^U`fsGOk364h}bg&4!}
z;H=OxsYs{wu3d;<E~_?oj9nswftA=Nl|>DRrr&Vb=3+owOEYt4M-V!N->-cNuuFPx
zdUrUFRfAqR>;bP7Uz42*+zIpmeEe@3d?42J{M_vy5$k}iSJ}_9AL*#tz1tX}!_5$c
zjD+h?DYHz(*tUR;Bcm{$=T~CEAYR-K%0A*$7GprNyZ`c_Y4X^?%O=xKGdbMdf7MKm
zU%x%sKKOQDZUAB$eLL7A^;6K(=#IB9j<=3>U+grcxwrfN7uwLl_xQ@&7kj(MulWo8
z+++lk&HZiq;o$g0+j>o3c^mGL#=F1u9VT(^<f+l-yBf*FCNV^;Q79J`OK1*>FSV0z
zHRw}!8wADKr#0zN1EgR}g5oE3#cV_;6(G!oU>47^ZpwNM{RQ1rRf8hjex^5&z>{;z
z3M+b=H!p`_bvG`lWfEOs>0aLAEV%i(PlOw1E|wJl+8|uH8%8Cxk(V|3Y9ZR)YWqp(
z+lk~X#B*|{W|*nLSd|Jj72FHfFX^8Szd8UYBC%;aErXn3aS@1mY-mDU?SQvm8i2_t
z(v0y)8j+4q9+q{3*mKMrA)W0YcVs*%!*Loc5+efUQUgouyS$CqsVxO*Z8L1|ym<Sn
zVkJi$53yJc+DE;%p_iWx_WnUsaj|ClgwsD7vm)5iE^zo(d71VQYayKl#m3!T4uG7z
zNzk^DTRz)Ap;X9Rg&WE)t~bQ00Xs(kZLv@1j$dOI-U4VEcg2dW#!;NkH*uMH$u5+B
zWTi#t5xx6dQ%Q(>8wz@_a8;PO_(G4VdO<9XF&AEF!(d_N9%k4m|1`j+oG~2w=$$~@
zP(528v%Hj{x}0t~-?nK287w60ZE!OhvLde&?VMwk0GDZz9c;`NF2$~*?H9A=NEwbA
zp4!PC+l0-;;D$+E(&AnmI>G@JHEp>!7vTv6J(_yR==c&ki_>gd?J4&gj)N!j<Er+<
ztr2Srn%^prL_vw?Vk+4-EDL}-Q{J^2K5bqso$^?^6LY!FsGBFN8${xmdQ6-FPhIRJ
zJ4`hdk&mDNW7jnVaj+1vkj+q9UVuGJjRzV)X#I9ionzNtsvrh+s_lm`V-nNIVrG#V
zj%8~sItFi$aBq&svWM)n2?mlXj)rR?^og3tXQO}@)&&igL8N+pKgB5AjFgv@p>w?q
z&Gp&>y_w^#B2*L6pJMIF^)@#&$dQ_^4Bs)>x++m)5;CWnxE2hOF-7f>tgo3nMnep2
zgwd5+VwZT*Vm}>Uz^y#&UFE&W<&x>Zp^-6`lKHA?B*K7Ob|+gK)y{b1T&ktK4qZ96
zDUcA6UaRZU0^xbuLpyXiO0RTr+4(8fWStbpZrJT0dr$1NAy+V#DB`aV)E3vqeA<-$
zb4Wml5RINvd$p7s;sJX4H48dSB-~qjRZ|?|0q%&=9nVc{kk2OZepgBfGfeoIG7f=r
zpfp?p<T}hldF*oGf<WE|gTz9o;}ClnmMt#Um6;f!x(&(J{~GdXNf#f3hGy-4KjQ<M
z6!1xLz&YAvH%2bGmg8Jb27^h?RT-D)hk#;WP%+z5KHvhi>{SpM+I*w31DXc$;bmy(
zs->1cg(o@9`+z5=S)T3MAACsYw6Cvp1)EUHND3L549z?q?{Sg-4CKq9j_OFjL#%O?
zz5?r9=Z#o<F0!iZF7|4L#bZhEJqlB~{0N9iy+X1}Kle&{0gri}Iih&-@`+A}lY?e#
zpYGreFb9P*cn6qkkKq#KJk-)zvVr9%R&J0Tm4?nG=GgUqT!&o8Nh;mcf?WCB2c;pX
zldE<Ol_4-cR%u-0ZGu1rWsdIn9WYOT)KbPHm(z&RB{^iq?(tn?Q_~jv7KW@sW)`T=
z?@s%$9Zn$<mW=VIR=1|BAQW|EW|A!k6Fo$XxAMVEio7vPKJQOUt7<%)2!6$RbZonj
zdp$~7I)sRfpqnd}aBSwKlG8+D5rEER?@HpJ;=%<LK;AaT;R3|BR<h0D>yb;3scq2{
z3Epfno?A(_o*)lsp%}K<zS8QQEl`7RXPWY1_i~y9K1wcihDOS(bcE*<>D4z`Hu8R;
zc!JLS+#&jF^Nod6$RgE9$`%(icgfn|IiZ)<GFEFEE2pT4#TF_do~E&f9#17N0Pw;%
z-Is;kVRCTrCV8Jj;*Adko*!G0K&>kU2@b}c(jB;CDVH`P<$xi@6b}0XxH;?F!4VB6
zX*uJPtjjlg9*2IMB5m_j_t2?T(;gYZp0nFE9;l;&TI#sd&)fN1XvZK;TG~!$#l<XC
zlLcJ9e0BR4l5^!0u@}?+dw;lst1CN)#@qC($kCBf>Y5}H?{`w|M;&+W4Yxg3CW~TN
z<h0hM*bj4uW-JV0(Ts6`^z)513<2GXVde`JG)zZ^Zr0UY@3|&lX@n`GW@oQm4DX!q
z{Wk$kGLzY<&G68|NL`#6glbv>5WUOF36umAfo#U-(an=Ox`}WGprl$U&C~sZ?VY{N
z@650itCo5yfe8M$1&?C4Nm5d>aGjM4VG!<=$IX5}dMrS8K#0DiMPMA%5Hl^OEI33)
zW*%O{B`M~GE0PV1d9UZhRe=C?90!LhJ5gswk|VVMGFOqTuOtKNXKrGpT8=~LRkJLm
zL7?S~EwC~Tz<_c(hUAsr+9k8fb2SdcxAoYM%tE)Hmk9o}>fos&5npAz@43W?Bvf8;
zG~BRzElz6UYD{;GTx+C;naHJL=!3|mQ5ReSQH;fnOH{y2xsc>!I#!332#G=!1J<^<
zup^f&q#>uCDTDl40G~ub(>_;;4D;pYIe@itpJDDocM&l{?P=ZabTH+RZLjIdTJWf%
zVf5I_t3LK~w&D#0*0bp%hxw^AXbb-8GIrRqjg_Rm^9j3<M1&9<b?!aJ4uK2ij>zvW
zS}Z(_nwARBluKtS#)iWtBo*lmu(!e9aw$@hACFhlG#q!%q>2?nik8l}r)WQ_^2|Qp
z(hV3QBQwdfdqoulo$?DP;NE@YplV)|<A+gfzUx>#M5ZTgPJmoG1CGQ~Z@dw)Vutty
zccf5R`AN_{-F(oh#u>wu)}67=%pfPNGut@bRigF9HVf9@Pe;fNai$x0yxDOerC}WT
z2J71NU}FxG*){-s52T}&z$G`<A-lG5Pc%+$Qx1rx+9@VT*cG>q*yjd?W^vk)%M{S8
z<oJ6-_E_b=1tka7WP&(`1$8pAFWb7fkz8i({o1aDq`A!<Lw9d_2<sKg_$+j&<E-yA
zljxy{ZYGmHXP=lDWivmb6P-N}oXE(c-Gx8aMpFi~6Z^3RR`HwQKx{m4DexkKSR`m%
zL@BmD$#LTSVAxkO^^FGt1LFufuLg7s3){yQljjz}BMX~*jbmeQJh&n1paf5hftWK_
zfk~^VQa>aD6I3j~q3ZvOk|re2ConV8%iL=^D@`QwG?UfGZVnoji=A@{ccy7A)yF34
z(h!by<w80vV#7x<xW|MfQdk*7=9b3T8OFNQwNXeIhB^6Bw>X};xOuHV`$5>DtDkdr
z-FQ%4>u4TlPH$%S0macYd9PG36Dz-jJ!>{?IG|81e3h!hU40*Hm8ZW2UwJb)mehEh
zeN@O*W^i$<k9-ALj#6ef)O2XS^@7$+1kxy5^VU4FEK%Pljp+IMQ5Y}dik^Y>df)0y
zchtoim~WN8`vO278q6hldsW6QQ9IdzRYXNgyXr?41T@Tsgm4+8Dzk;bl)12!SZ6uQ
zdeG$dX2=A_(<nSF=z#h)E1BC8z2_Z$bE6ggPVcM#3WmLXzYM`?b*b4fbXr`<?erGX
z_|v{9SZ`ug1<ZFpJg%HqoXBl~L<L%_1xAYs4AE#hv^=ZBL*h}s{7Q@uF+hA%U87u?
zSP4{h38`BruG*^EO*`gU5$BC@o&hb3sC3ee8>r~j+s&iR{ga&?X=Oj;lyJyM6b4?$
zQ{L3L2F<b><a#Y1!pBYI$22`1o5Wu_->6w>g9x_3dB+i<mYdylC@F59X3}(JNU(!x
zCag%oY`yWK+FFJ2%gWO#cx#47*Bs<SQ=iM$q>#k9WUYE-kbZ2TmClO9VJJ+1mKWm#
zgJlSI7`VJ7w#-Q);0&v+f3XiXT1gfyhtNz$ORBfl_RK%oS>bT9&Diq``5~ykCUT<Y
z;B#tY;gL!hYxR<i1R=AH9q8?NArP?%p(7OW7c4RslE}HbuUJM2kdR#I0C7o@?23ui
z*(~~qZLT@TLYal7(+^&P3(^lT4;oa?IeL~!W4+*M@fE(D_@uBOG9NHmBED+D@pR7o
z3N7Hw1SChrmzneP>X1L=tdbKX2x4Njm-8?@9GDmKX|^{sn0@z9occk1IYyl`vkn7k
zBKyrLZyCfAxtm+iC05&tNrd4U;41;lI7ze@hl~SuqPn44d9`52Y<q!ICicB1?D#1!
z)Ax$x%_5}Elxd!3Aj^W;vJguNYWL+>Dk*D$V8%)`H%GT!Y33GS^)yCWYvv^<Fh5Fm
zQnI+ed9oyH<Gtn93HDEQC&GK#enLA&3TEUXN)D(&serZad^`inf!Gwa+D9-~F^PD3
zmtDzIQv{IJHFcGOmwS5xC+(<uz_~_5*)Eb%CLFM1k|XP=+f}o%192J_@UiZPu$_~j
zMk#CxdbkOn5uWL{O1+%W%16oLHveDURc@-Yy0(66ZcFmb&UeSj$<gN4H^88{Q*Mi@
zQ{Zk=c1g|hu#E6VH;h^)ybz;Z(Pm*Iwn+?~@zS2J767e|vC`Evu1VyqG!HTyfo0Pb
zz$A)Dd-+F3V4(9i(^{4I6G3Q-=w@Mt?4A$?%bCs`jy)X@c`fqN>4dQc$mrKWj~u9*
z3)iKV4q2;Z&x62TaX|k?R>{y|TcXEY)+5c>+2v$1DmRuD#V;?GN#M)7<+2t+z;qgT
zZvegsaGMI`ut<*bSkuJ_`jEZ<nr7qN;OfhAIxy7zGsW@kDUx+vVMB3_g&@+oML_yl
zLUU5#lRL>+6>O<gAfKkhB}T23;vz)A4_h(ic(0#(M*30YIrfm*LIm&zER_*E(-;71
z>oOzh7vZagga&CMXbK_K>Yl^C!9{Sz*RN})zS6j+7*9RFhR1iFO}c7)5dUwezf|3o
zHwDL}F7x~x^B>k6%BnM>vmA(0(y~cEZ?N&uJvmb}+6BH1NUn_sig${RH$%UH1aeGJ
zHZ!NAj|W(@&hq}ogAl6WI=RX;jM6VR+fl_z+fVa>PH0GGx!a5$zRRIt7yhk!MR1>$
zr9?1end_8Iqk&GRSTYnKKR=KCIkLJD3<D=AI=Bl-MzkfLMNq%GEUZgcTz|!UL+P17
z`W5Fv$S}_X=b7p=204*isrrgjW8xiOEDcN4iDIdl@&|hp7FCxz!r0K)rKOOj>_?ZU
zGIwDapF%D!K*=i?_^dQR)??zG=gcPSfaRUuLT%klMhq>>I-BIu4GJ6$VbJ!KGLwkw
z8P7f&(?%!ZoOKa_uc9fjoh$b>T;i?Oc^5FX#3F$vzR|uriS2DI?j|c4JQ4=Lxl@HM
zQj&JI-X86qe0LY9aE`GPjL{7>|2mA>5iKRr6C(VYoD@8r@E9cJ2QJd_wfNTHM;7NA
zqLnqdhV#c&@pHlGsbR{V6(1GhApq*5HO3CObgWU->d6?YiEFo#1$OPMM0__fJvM=y
z5wCe41DIQ=KZ`>_{ZYD8&;fxhz*ZVm{)zUj!~M72CW{)`z`0PWZgB)nvLFd}*_3ud
zGkR-aD3dgYlnuCs3&U0ihB=**T--w`&@u0J36v?hh_FgA@TV3U%rhNcOmS|V^@9Np
zF&9%Qoz->qJZ#SFTxfgI3&0InV|A6eD2R%7Bs<U~ib{r8(r&j&PAA!xgU#r#stF-_
z5QiuI^M^mOiu{K^2ANm?{kP(*-1q`+)UVIa)90%zYu)wdYiauYxi1zQq_A-g`GOu%
z3vSoqP(vVPRK{vobCvKM4s8ulUKkdV{D{u;!VRm>ddp-GwHKzSarU}4=Q<-}wRr7I
zfkb7cmdGT`%H*;=tkK9p%o%K|1h<m|NB$~%RNkPjM}Ti!SV*>wNwtBQp=cF#seKs@
zL~L$B$tN}ZShp5csd&A!w|C$)b-pC($x<Zd!c!DAFT$6T0yx&&r|=Uk3JF=cwC*?u
zssOuuJuB)J>VKHQXa(W;kD%D_eRy`GMmmZU4NFfU490>3-F>zLL|SX^QRt4D*KVU4
z@uUjBzA3`>a3$p9X$w}crZrwsuGApYIS-@-$pwlX6JenQ;50a`T)p`uscRyc+YTPq
z2YSh(Whin(fA~^q<!gGFs{`?91?E!y-csI9Zo@OJ@EOeh-5&eHAHT$;UC{CT^}JV^
z?&9(SVONIcU{BVsnU)HZdrZ?|MDRay>QOWKV~K#!KbCBN;_u82D~*L&Qn2d>F^S9*
zBUz%|l~6$g_MHvHGaW-V<HW3NwtvJsqO5(kGa*m4;nR44bH|5ub*?15!QuAIv<HN*
zpzv#Wc1BU`AerE(nL=fqX$)LZgP1FH^!IXlW<z!~6<TNfW#+kFj+l8#_;C<hjsaKD
zX4r!$O!vlytgI4?!xxf}#-!5XRJp$&@4VuoOlJ3=|B=XvUQfzq#Wh|R{=jIYc$=eT
znu}cH9sYoIjIi0YfS<)Ms2Tx<Ob};hX;qhB7Rc`yT|PawT%@_cuXCS<h3`_(r`8`O
zPbo?M`^yn3$Bl=~6gc8be=zM*H@8Sn0|8)=IaSQ>neMtgKNdfn<NCk9kOlGNET$SZ
zugW`TnqtlFqF<b~%E@)#-RDaHNEHG$d(CdES-fP+sJ9#)Yp}Ex<Pr17&(?o`fs5Eu
z6TAG<MLaXJ5O&72#&<-m{`>3{*NljoIGmm>A5YKN_o+3F-OSI@L>C!t-U!VH=3Pdt
zt<Um|%1pRk1T*pPekS~7|Cv84dUyPiuRSh+OpMyrR4h~bk2NKX-(9uX949D5pU`9T
z_28Q8i;BySUb7%SEQD{U<H@<<6LH>cUoc}raTNlez@%`1jvTXJhNDu9vUp(5$5}tL
zQg<$Q+Gw$_jC>NPd+Om31XNBR!pnNzLZM>z%$71iHMNj%sTt;)-Uw|Frn%P;jE?8Z
z<emUB*hDxd^81<0XXPiSF-$IF$d0C34PtE|2o|f1ZJu)A9Xt^rh^huP!ojsK(i-Xl
zi7VzAok<MhLW^S(fBf-7=YBIKC00&Q!a>_^U)ie9-%FlOk~hUTQ-`1w@tM@X1v+w-
z%1;KK6ZF`Vk%sQkk3~0Et*U<2U7DD4m?+FzB+i@eg`=}3iGgDQ9UU!l@nyBsOhBEk
z>%sowZd(Hi@K^<$mnvZ8hM&@==idk)J#WtRMb1P%jd&`?8Elp=5t$+5STjT4Fi!!o
z%@U9%7%7UV3qkVgl^&>3LLbPE^|p;T<ja+(kepZvb_vWgtT1C!3lbo#XpYf3v-vQh
zSCeJb!a|bT#7Z$p|Cm&_UT^Nd+DYE*Y$5?KMs(uS7oF8yvFNOK@^n3<w^|{H?Qxo>
z$Ve)cK~DG@gyC&BjS%@+RFDOJcEKEUGs=Y9?}9es^b`zOUZb~K5T<m2rUiVl+M3Zo
z=4+gI7zP;y)@N#!nk8aa-gCuVmN|3e!?<EQX*QntnQTbK=c^)8!x=f3L(VO=!JMx3
zld01v1FD_OeVV|T&T0HLw{n>xa%mz_yk0#E=0KTI<3XU4$f#!~k6lqc4$9VoN6LF;
zG^tDNQSnz;{=`?f^d0~|Es7YeGEhG|pCGnmoL^i{yydG}@KsIMXeCBa8uc~r?%W*D
zUZ=at&WJ=NY{H)B#!I_gs2L6K9lVN+DSIfy0wZ&&IOf5`40|EBL`OL2tc>|DlQMv>
z+EJr&!YT&LWL!)UiE~-N4pn*2S-)Te0&45*y1pd^5A{w8hh!6bb)++Xs4zn8oV1f|
z)@(%!QO^twWQ<Zj!wUo+%dW9EGL%`nLDPniV2<n|+Uu-7!z{ivZ!yqH#;D-O$hKVm
zjhz;*K&&ky?iT~997me{i%05m)u*g~rc(Q+mG+@SuzJs)tiB+`OM@~|*pXIQunVue
z*q!r_Tu;P;0lb$l=nJp$#GfD>cFuXWV7BJ+vXSb<O2-3NhMEBdZmp1Wz}xH;WLxJr
znl;{O1~0)7jp|1$wI+;kL~X%`+Ig5xA$5$6BaqA<D6_*|pjDLWa;O~7w=c_8-4(lU
z4iAn_Huq0Z+i_>3qCLwdds0Ec%N@)P(kf|hh>{H3J7eu|ZJv=0nc>H1w5s^>q-ZFh
zg1j2Dv7GmbPr;qhC_)LboouO}GBEMY7O*$dY#{olE@F|-WM)M{(FWPnc*b7mpB0i~
zPm7$NZje?UdqW~pt^$K&!@}v^EIPP5o<U}_5+<nYr88v8g6!zcZO_t~1WS`z*^?7C
zufd`r9&dR0yeQ7#-2n*zr^kCZG-I7jlnQ(YKa5Bp0pNdtY0wO8^LPhoOxbYaU?}Ze
zNFKpl>@{_k=^nL{<2sUSuQn6&lZWhqhK}$KQLypDj9zXW+0G&y5-K}39=HXadCU)u
z3s<^15k-JlIKv02J}(=qHJYB0Y}TqxkMoL!1s6&{YiU*ySw3;3i>wgn^&82>m=mo0
zKyh?ed(EpF==+eVKNP_CzwNn(RtV&PS)_j;94+3@noTtwU5pjJUzcX3Su=V+w@xB^
z6b$H5Fu^JVID1*}$|1X(<y2tZQp+g_^OLMHe#{CY6j}yU`GuSGN2Ob8x+U(3@f$7T
z!ZGO4G(M6NXwFMx#lJKQgv69qao(c$wa$u<ZgLH#t1XdgNTt^Ut|5iSQ3M7Otiw<a
zSdLhqU0dNs<ESD@DP<^BqOVJFhCl%5GqM2NETIqEpe;b-Kvk4SQf|b(lG?F%S^L??
z@NktF1M@!D*Zt$lHSV0LZii?}wcv-U>BDrubv(Cs4v%)WHcxi8HA(q1CUQ7nlJrB7
zTbNq}9e?iqy-sieA7va<jujaQ0GkumoN*{NgK&7GI57uSLQm9Z_Ik)cFYbITPs?*2
zgRzaKW8`F%pA*_6Nc@gMo_zksP>XWS0>R04lOO;vc8{cAF&(2BLAi5=7==L;NV=XR
zY%%n^#L!6@Ao`6R^e!eepM(ebSrC@58n?(!EfKT|W`C~wY;>z&b@k&=u$@rJjnVR~
z|7XwESI)aDtG&mo>nrPz*H@oEU+;9goyX^opJ(*#?CDwdr2BX^m{*2ajN{21)Wmy1
z6ttIc(3_Gz_`;Bt8OYK><*l2#r**a@=rOPvM0Nj$uFRV0#|E$`m2hP>)RTVjQt{!&
z5!_vncOHQ37=&c|E`c|+-S>8P_D_!Q5_t0<OnD}aBS^aNiK-5@vLdmEQFsjvDV6+?
zFdG4-yR-%GP|jy-EP2;eIujts5~-rq@w90gN}+ZS6H>k1$fEsb$K{OgIx62+*3T7r
z#J{D%85gua*H*b&rQw=$ui=ORJiUO#uo^I$0E#HwH(dNt`RsvhTsKh~j2Olub^-qD
zOa|4Mk5a5nO2LdZ`>3*XIy7zikp|b9#<3wWs`A1uDQZ#$g{z?i3Gprsmr0|PoJmQm
zqYz^tX-MtUsOw{OAM~;VX(08HIlODT$pTuA6VG6QtRes%{1=SAR0pQP!H%-6WKu~4
zD>%eo&I1FA60wFM;<PiRA##7T8SC67ye)aN^XA~_yX4L0{^qNlH?-I8R@E?*THS0h
zm?Es#lW|PEK7sq}TJZdQIe2~kCh~EB?(AiO$j@?uPKv#b<6POyQxLzo_Iac1x}iCd
zH?`!lVVPL*cT)HtO~O~qzCa#iJx{m0zKP{BpMz)}c~l>d>j9Px=4(=fhDLGS$6?F{
z*250b<DHXcvUm6v$i^DqU{K<++Z6J&@xZ^1zZeRu_bj8iS34)OxphG%o|>Q7ZWw~J
zGZt&Ick~t$viI_>gu)7-b)gfYb^4+;W{Jg@jR`UG!^umcb#gM;ZcqfxV^3&;7c<bH
zX$7m+mB%b82jwlMW(CcSQtT{?sGVr>9Wl%X7#C(kXIaLHacoPm!r35ppP=IE78q{w
zvL@}j*j|VobYwHC1R@rTk>+)|sC%9j^Z99<b<p{SgDePffO4%Q#<Q@!vsXG_zcyzt
zb?Bx5g|_rIAv_;=Zc#LVP|k&shZVL1VFf}+ZnlEmAw>W21c8hBjccdJ?38-M`6y1g
z5kg|*HOCUQx|`0pO||n=vB=Dz41m~DH-^@$4<KI}52~xbcxKo*c?dKzv*9CBU2<$!
z`|~BUIj$1%X7kU=T@MfTcDKIUfXEQ>1wkm_$UD#Et^~zj8*GG8{_UVnC_l=EO(R6F
zQdv5)+5|on$OG$Vt^RnLw7yPuI4wY<T}MQmAM*kGP-#auMfYG@5n~d}w4<DJHrR=-
zF%)rQ8kjz((RS2{^IJOc@;;q7zhfs}#+}e0V0u&?_{c`$pU{9MTF-myjZZhNAJGee
zisA3q*cdNy46_tAGJBt30+Q^2;?XC2OUx<UDM#%H{9R_lW}T>MaMsKsoInL{dZqHO
z5H0w(!~pDZw((Kcl_GI(CD<N}J-q&sD;orNz;gpDC6f*A2D6Ap%*MdkJh5P9*cO4Q
zV`E|3N6g>ka!^K@14050Qcr4F@rKNS)NL3`K9{1L=3)<(<Q~ShvgwPC<~vMQq6usk
zq8psbY^5nPEn*^PW~?%)st&nV`DssKxwuc9V{`4TCK4|tWunxd%BR4Focz1{TSv|0
zbtnZKzun(G*ylJ=oN&h^7AK3nsRKQf2vV!WtaVd%{=Bo5EGlDTolX4d0XoI-+S@Fm
z87Ot^OCflz!P0KT+)xFsfOZ=~cb;5ez8H{RK~x^BzQb}KjY*JX1;Slo+^3j=f~$*B
z0w9hX?QT>qbTS>Xm!IK^MjSFe7Qu2#2mEz=PE}+{5IoPFoCupuh_fOBTxyB7n#MoY
zjpb8r0^><3F-$C$cyY+_a?vYpuF4h|DIY8PH!Tz6ggK}J_?L;aIxDE*W^<?ZQP$Bo
z#$hrh$^l>C=+mM^N-oHK>+o$mS!1yxRn16DCj7iio1sYf)i0HR88djt$>_d>sKn2@
zdJX5(p+^5?{Q&aOmAMqJPP<_Rm=xFwP$#zgL?`k}hiqmAXKN+_Iw4FF9!82mF$8#(
zPT6ET<L}Pe=N}PtIRk<-I|Acn((3{?6OL1SRLG06-1U{@D<S>qz=O(l@T>EOpt|^1
zK^bX@vl(X>YWLE|DsyhHZ_&lHD;PJdu|@b;Ler0<lIoR$A>#JYtZXN3Img=KR0_4L
z^K}MgMFV6~2cgV9vUJGHw8Y9UpDm{KL~5J~tC3TWp_RS+#32f4z=}nF?9Bvq1VBYz
z1U6k>dkar!pb9xe8gXtYGdHlV2*Z!`jcY-9Lhk;=rT;5M!o6?OEb<d0yAjt+3%~$C
zt%4v@jDw8E%MhiG2Bn3GeQJKZI?@G$dS>U0*<TdQL@}Byb2yqLta%SrUu87xA+Y-3
zAvCLz4U5fZ@*Zg}$eEr6onETKsX2r+*M)#49nK4{nZxTwdZ+Npfs{Sd32-o@Tz{T)
z2aara)Vt_qgl;zGq)HS1b$u0Nk-10}XOb61$}|z1>`s_2&>LTmbOJ2YKt5<Zi1a5S
z`{NKWm8VsTwMV2N6cz%jX4h=+{*W0%w*eb88>(n?*_pn1mYhba0f+%GbHf$*y37^P
z*4Za}v%5V;G!VYf@^`tyE@DgMV3JY=*`CiDy(*+wNirS5CoQf;mE2$=G=-Og6;K6y
zVg-EAj?gsQ$#cP5yx>~lP5fCY&mtpS&|o)}sHyn{i5r02U5<dDk_)PL|5|lx)UxYZ
zwMB%1@CG5J{Jm!9#iQ~W(aq5PQ1O$nD(c7~3b{|mZhYQ^<G{~c{5QwknkR)}Enu*o
zIsNI734m{O*xl={RcTdIns~BQ!x;!gFy<7HM~E?W)$JY))s<f}Yn1D5)GFBEbRY+W
zYdTqd{BPW=Vv_bl;Bq|H>$#)UOotlc5meiqnbQa(T}Qeg<6m$wE)IW1%yS@#&H`gI
zr4E-^@v8*R7LCb4ztCAhDW8d*etb-82DgCHi#@>^fK5nhTACWqdnvH)ldO9=)c7_*
zfuD$sX0xO-uoO;f(dR-j0`q10YBg)3i9ijX8?E!l$l97TALh*43Q})fBqP1tJg^}D
zmb|B>6xF%Kh@9+g{^xhe%cGs0J0X%h2ti3WLG%jVaoBe94+700CCXGAIv8fb=Eec9
zCu}NlZ$fTnz;dQN&dT?4hL<udd3*xQ-9Sha--NTphI)jB$k{P!MC^k2oRvaetDDtV
zwS^RrUbn4qC|Hn{Vav<ecC^;3G$w8gwg`wts?s?Ns>EG^_~W7<v~KKBBQwV4k{STr
zjC~UD<t%oVaK0TZ_KS<t{iVo*%S$x_&%wAYHJt}9NiQxSs7?&!feq8d#hB+vRy&&{
zGex9{V&OP&8Y`=cyJm8WO@y&3T-}~<9?T3W%Wvv?h~QzC1A*}{_ZJ^3is>~hhK{H_
zNqORI_?m2Q_xE=9zeyIOM`-?+e7qIcH!ECh^2<Ha*f;m~G(VUB+<p;+*Vd7o2QTr5
z9?mfwnPG_X*pe?L$P=7coJ#E6G~_U#iKacn><H>@IT%}<QI3W&3jbP+nu`;qWsv0l
zK&0-bO$etd-!O7F?o{I_TRt?3RXgx4&yYnwbe5k{0K8w3G+mtrfyl-#>1C<Kk5}>S
z+CgpFiu2aXbIhFz<1Q+rP%FM1#?>VNPMtLzqMN`{XjmfkTit%4@hv&l1WKNIdAYoz
z4B$j07+(x-4AZ8$*^0NKah+!KE$QG+$9dt)!5s_(n^#bjQN5zUN$mepgH2>|C^eNL
zBu^Gj$3-!4FaT0{z|>TBaWZOF><^TdLZ^_{I(XsxC#R1BhNRw33dDNPYy{pJuqhvW
zC2MJZ=g)_`M?1DXmK=Pgv0PSx9aal!Bm{4tS-&(kgK;2rsWv?8U!Xo9H^d#+$UB<>
z7d+b8-+be`$0C8!7gJ}S&v$7_D~5#B4LLmRdTy)aHOx>NiFj)|CUOa^g3=ImflY(_
zkk|xudj_wsm?0rt9`BrlY2OJXqO5=J(vjFI+wZxK8YZ9f{|dTS$k(|0)|j{Q_(vp$
z1uL_@lx$1zccr#oR9<*wDMArke6;|(>%OxbsNNIyyRw~gpF0tw*3l=bZRCT?gGz|b
z3+4)a^63+l7V_o1ywDTC33&kr(nFIyVDA~C0_QweHe#X3^Rnxi>a=hiN!UOc@SKVW
zq1FBp1NiobPKqP36?Vh*LHIpOHrA15odt8A{SqNS{q%=xoIEXjakeXzFQ{A*8Gq(?
z;n*lmhHIvx@+INXQV5|Y%F1KE^W=yk>d4a^yTD=WsaQoLWH}B5t7jemX6{13<TORF
z>S;}Hx56R9vC3(odA;D`)fT<a6D)7I!-O`13i2D(8Rhd;XUB^iO?M!R#(|>AhbQu*
z!vf^^^E8lQ#gq}rv?d{0bh4(r#j(y|0fz4(82p{ZgLjh87Dkf!wDNBSASP$tcCMhX
zXh@=ZqHNQssD}cGqI@L7t(`k>b%3kyDj)}=0j_)9<OO7O%O^Q`eYCT=y|c{)f9|0J
z0kMf>acHUt^vP68W5j1Kqf`u6b`Rt=@2ZN0)25V`M0eDfAd6_SAPW09O9VCK%z`-B
z1T~G{;+%0;CSg_M6~#7d@iZEMq`<6F^o?aSwmu5)32;TJd-fi!?w2W4hL&(uR{^~f
z<7qn0-p!yy*>iYdKFa!{XT+5#Vd>XOf%1$Fmce!L2h-nJ)BB`yrOT*yD7<l_wEac(
zZ)-{u4TbI5GUQpig+fztZ_pW1d_~YSACuYm0d1lQEJZjb_=6Fw)>BkY3@4~R-Kap|
zqaWsHQOJ!Z(h@b&LNF&alGH+u2Mkh~Im5gdn+=hA-KDx<vXBy(sjoaNFH(+Dy#uHC
z+cGjWCC~f}(V`74I-jU0>yK#CyO+cOG9fY-^6t`bjPRLm!YYRj!<Ks-EUyc{X$ILL
zOog_pXBiK{XOGdj_g_<Zj?VH6Gm0U|jiwxS6De*IVx3HaG-;`;l@F63Ts*?gJ}zbo
zKDgkR6xPqN%q}3^Fvn_RL%&ur|7$U!H7gA~v$YAHd*Zj)ZY0SF>}a?N69aU+^#m79
zBQIL^<az`t9$Y~5tT1X8lI#rw&&gamm5UGzyTt14&=WAPyR@P;B?0Hg?8V{9n{Pua
zL#p#*k#vpny6l=w#8qjNz)r@#bxr|S;8m;bISWWV7t9O_%l4htTDK})mfYp)GTuX4
zVppAaze%X&wPpSIsc!X(mb{bBtOvaNri!g;y^_mtt#I8xx9Nn*ADrwYoegn=&FM>!
zB5CO_hz~$?*nm-^sU3|r=iJdv!)P=Zc!z7`9XuQ-$5Pnw@t&-nE_l$dRTl(kP@j`b
z0pL}GSI#OE%c+X3vy2XTlr3qp*2*Rvb-oCTnW~|~?lT=HIAs-*(ydnm=@mwMsz|X`
zJn3pYkBc}~>|NWc9%vB>HL&+{oOn>}hknRa0?h}=8q%5`H%lPNH#<lBB&MQbBhCHE
z(ZSv=G6)2agP~Mwt4pH2%+>cOmE2q{NO6p@&&Bey*)Hb9E54~Gl{RHb3jv@H;Zb+&
z=!pme3*_u_=892qQnce@a9V=Bou<9NxoU!zeFW{!^{F|7W{{7$9!*s1FDZr9YCI-D
z6$Yb;^RfokFR5Yenzv!9TaE3tSliOTkDW6wzEPdXZ7r6|R4XF4P)QcoJslPsiZ~%5
zUu<}hUB?WHCZxqfXkkJkJUDO%c~tOy=<Ws5@HkUwfdL#eOB-nlWznA^*6L53^Tl#b
z*m6s9!I%+)k8*XkQZ-jkByAqIyu!7mhQ6M=V$WD%V^?u1UR{t*BgEZ^toNw%Elxpk
zYLe31PX{B71V&JqoYyVH!CU%93<6|UpUL$o03eQgMI+>DNd}54h3VWzkJ__YbYSW6
z;so{A;|oE)LX1cxgkOgCk*+pwh`16BD+Uec!$+RbT*7VJy2uo@R%L!*hQqf-lry9m
z7O#o;r<{c5cDK6m-wsD8p5D)J2KcS92#!83iivr&M6TW1JUl)A?)da*=lJ05(bf)~
zBO?Jv%d-+Oj*Lc3Tc975N|t@AjyelF>ScO0p9m2rQhT0PuJOPQ%5oME*WhR36^OS6
zYXEwmn#Ak&!h}zM0gTh16u*QktdTC(<??a053gXhlV`}#sO9U%&sjc!I8Ds>a(a<5
zF#XL8z7d`Jj(?v7Exo3el0!ygH}2|lhZY8D?*pAs3lbDZ1h&9V>4h*dV{w_JsAXw-
zc`#TG`gv;oT-FnONxk%W_mUU6)DRL8FAS1MEUxhPsSmSsPsO<C3o^kAO=dPOI4@w`
zs_fvg(CXz(KJt`>R>i>Z;>k9rw2R!2+F><<8ha0El5^{dZ#68<6+l$1c!(JzgB_uz
z$VTXulVu(7Pd16>MEupLglgU-T}1%PrTuUkNHB0EKrcrcj&b8B**rYl+22kM_V>O^
z-W+W2+-9w4#EPXQfrQo*1}QC_wS_@shFnnF_8=!vK~e|<6LYP%9yoRs`x40<WjPJX
z+aE=%rmn#eS7j&ef_)(YdJLtb_5Bb?i<CF^teji?6Bl+`48?<n1M#&m7>*rfRjv#|
zT{lOJEq?(0<E5f*z%S9~^f<#ekXW#8CWD@+sD$)yj32_brGfWIxR$i_N<yqx4O}b~
zj9BMf<5avf)Rc#&bGd0kKQKry`TVAYv+!8=lF%rI5cd<3OI_C9I0cSQS5Rui5SiMM
z8_qPxLZxP}(t=OtQF`tbLyXT^Je9C7QP9^GJaF5>oh1<#l3&G<4kV`!^O{182QLLO
zfBQu=^@awnWi@6XTI^8r38@xV%1!3JB1fUPT%=b7vB1v$Pj|=V6a~n}4}E5-lZ$Bz
zWQNSD(r7ZSgcr|)APNU}UW0u^e1NC3$I7t?8z5QB<yHS_Hq=5Q?6WX|af8^2d$^qz
z=L<{L9PSec@X8&oPC96EaY;OrldP`-%Yj?VV_8cvb5EUFFLO>bun9HDDDcl!DrP@7
zP`))TX(ehpV(O@K2gerBFPt7`TTpcHhNduPv3}b9>a=0$riUU#$>#Cq;SJJx5OqnL
zJCM?QET8jaXeLHqlac9N-ec_RC&T-da^aJgR+CC)hYj855<@Eqs2a&!%&a4-uqMZB
z7(GtUrI4pQL)+Y1;yXD)9kd@6*8`*i;&<u9uM6o<7Obs>rr-&s?4b_?3<l-m_zP*q
zVvQOP)bN^GE%K5&2v!$3`Edfqu6#pVVr;5@`Z3W`*mfd%fMc8B8Mfi4JE9d+DQxD&
z38ecoG6-{2YtWItcp7v^b6^4E;xa|?(1^qOYOfLFu00TF{N*qmk=D#|=2BB6t-^6}
z5~vWS1^vWMdV5e-4^l55l*t+7oK)*}4};a0^?bwo2Sr2xQ4_M7*z$w`@h)Q<Fb^UY
zL~}&S$PaB=+GP@TC&H6j!GK!5Y(P`aj@$O-WYD+N+9?N4YyTYuaZLneD?;HsvPSrm
z-CVgd(4LG(hlgPxAFBLaj9pV2JsK!QSUNFW+mW;wUY66JTEJ^i)H%2`&eSKN71fk(
za;eN&NVzh&TpUztrtHT6J=o+@iLr3(hG8!_`e{-K>b(&~$Y(3)q|Wwyo`2M+DUl}4
z(8gPrW2b`d%KWjH*K@TnM2PzV!kmsn&!4xXb_Hcx+}u7mgr?_0kk91I#{nxq{uPwA
z3I&Sg!#odH8sEsWhz*`&H^g4A5rHm{KOg#R2}T`)Nb};=@#dd)u#_)e9qoL3w0p9n
z$GhBq;cK>4RYh$?BP>LV29+`0Nccc-raM!g!x1tBwuP9ChuH!f;YS>7+=VcojR&P_
z|H1nW_9vV(mg9tRuK60E^lmNyFEepf!0=}AK*^%9t%gUg5(+de*(bz1FT#xeqiM%t
z@L3=wV<D`X0WVM{kggGzR*9(Ob4gOAT)L{bNdRV$XIy(VkcAtKVbKbvtyQ2-s2qX9
z2sWpaLS$9@eU6CJ4*jfVV@>U8EoG^P>m}oxD4gEF;VR)S5o#kEx(ay_p5q)Y;u2S-
zC8_wJ7Vks~hz$X-;#7tCn~r@8qSs=1(ngT5?yy!wGLS{ZT5*<{i~@Om!@~Uu?ONn)
zC^bQ{1<SO}@D)n8EKyIK%&XR^rJ&y&9AkyKB&sxXaNY(xg6l5gHT+Si`b?7EUCKt?
zR9T@)S5a28))DfuDbO8Zkw!y8PhD0azs|INH+f>nl4gm_W#=^>#DJS(2XM?jZXu|c
z7P<$`Xw?Xlw)v1&1BQicqY4zq<*Gx_bv*Vp{*aA}YJFH&9>vixy2YjtnI`9IY~YR-
zN$R$BT0!fmd_Hp><#>6@o~#efc$W?Rm=%vHOwO2)PNpSiG=mF*o-dMWo>n6zWzWrc
z>#+EAkxg8=gEOhqHYtK2Jz>u2wbHV0!9wx*5Of<|l|`7F#%Xy8Z$KDSzyV~8Kf2C?
zbJ}LYnS+_PSt{S8E`G(U0DVyWJ&Qg#!-0r|ozuRsrtAB`it`!k6LXbbUuUND+U`=Q
zlRzZZ=$P!IMbWt=W}Tb7^a?gtvlcHa%nzm+1(Cd*9pw&)VR0pvEv;fyVLx!$s2DY$
z5~|f<b>0H2c93c3jv&w@y4vzhdeQD03z-IQ3wxy0Bi@(5Cm4AQGN4nLtac&6Z(MD}
zMSNKT%?GJpH(MLZ<D_V>hD8*=uFD&(N#lWL4Fcg+OK}3?)eE$9TUD%bNxqf|hm;qs
zhqo3jh=|VeJ@)oOGM$KkV)<W%@qQCiqySDOEw8%b7G)J~f6(T1Gzny|yw~ezQM(};
z+bpTJBjg#W!7`G{DXOZ~VF9JRz$W123D;F~5~zuh0XZ5E;t{kPHFTz#Y~KnfVjbge
z&WaKoEix4I6LoFCc4rIEc74Jbq^Z-&Y%PtH>wV{0=|~|Dk$50>NsyQ2BAWLtq<kE~
zMJa{P5LD!)d1%x>q^04Ae{aF6@4m<LPzm4pa<rHZ7HwTFUvV*{;~+?$ac|Y_<W%B?
zqn+*D;{|5+W5c{cgCfMh1P(N17cHxqr3P43+RN=NAR_9WtP{;~Yur0)xe305ksEnQ
zZ#Olz5s686F>=32KL$0d*jB<3;Cs_F5kNGySR;c)WpBr~L<do1?6`@%7TSv0j}%?A
zroFK<9|ny$Vb8t5fZw=zmo#QLQ|f%?-D2f}<89~HT$5|exT-w?rhcYNH)l}1S%u0q
ze)OAN&G0yW{q|)0;M@IV|A3XR7%1LA7WH`GC;?Xj$AUPKo#iJ+D%Isu5E8KU8opyz
zF&{X3a%t9Wk-?a=qNiHBqP(0UtN1FaBWk8|&ftifR4@mN=x2|FOF`G(**VUP+QMoq
zKm~?OCxH$jnX!XXLR8Z*V@+CXTL_hg_^gPf-Bq{p1%(kgM~4}8$FGb4SwN=0NiA1W
zfRw1SKTTU$ua<x(J-$=P(}Xv3vbFd2_+;nkPCI9xV=|3By2v^ai%=C)N=eaBBCNju
zm8iA4mqnqdOv+Ng#?bcU9%?WOVN;?{D{tmZ97tWk!#+OCL-<*=vjeA{3CI%GsrR?c
zC!j~gj^bwoFS+C#Ap0qfpkjSgjyz-C68?kS<Dp`Y!D-RUwZQcyS4Wfhb-|JmYwC2=
zvl`ekaGssE>rxDe$Q^U|EuppNhJG?T^eO0!oovf$?80(RxpayMuRV@nVk-iUE$U65
zj&!!y%zYR8D3q1jOv_y@xs1WJo~%86&N%gq0~`(w1P-#-4e#MULQc)O40N+)15Jm_
zl(pP62V_p1U?XN+k!*lqfjQvXFgz_TbJF8tGEbBe&cfz=^sr&r2R)64iYqM}Lr1r0
zvgzVEc-x>C97mga>`Bp4gH7PTHb{I!Paq*RB!#_Xdt%Y=IU~O_8kP*v#4J*(&)bVb
zkBtPE4kb$gW-6u&HX7hf3!+b4WDBkch?o2!ldwdpWj!p;+@-2HJQuDrZxiR?5G<Eo
zho=EKbV>;zg_V|X%;c%5%!r!Q?5FL0NJamxz+ME-x>Bn}1t~{J4~0~|SR;1odbm<0
zOB!QzWStLX*9&o2AP_AbzQ^vBmeoK#(nFi~l#1v`-Vy?Gi<=^YA!Xwnm=|?WA_9EN
zvc{`R$_>;{YlDTj$R2UDYC;Yhzf!J?sW=F85~q}bsejcy##_7?2X(Z%S&qyp!<mw&
zwY30JfTc%=&?`l(vZbbFYf7FU7bzn~Qiet>X^R+LR5(l*QrE@a9<C<sqxVT@9cPKa
z7H)UWT;y&CH7leeQJl8MwoK9*PBb&~oH(oJ!s>#X!0Ax<xKyKvGDFkZm+0P69V^)H
z&A_-<yN<!E_>^)ui*#CPd<KgEqnxP>ixGGF!Z9sNw&K!uq+hnq>0QNmDft6;x&?Z0
zH&L(iq8A3gTS6ooD}xtMFT7#f7rMLUts?AoR&*bgf<nO?#c<^7y9CPb1n(27x@~EN
zy>j9k<Ay7Hnxy^r)v4B_MPVV>+PUUms38n7l<&MjviVCuqQ{=O;B7*d!kA(TOx=pB
zH-m2$NB|FNWlok*G720mK>;U5o%CcGQuj;2<rMuygnTwU)WsH;+2oGP%27NnKy<}2
z&Dc$%VHe|w)2jEcx?+<M_C`Ro7+NFbe9CG#V^#J}2ns!LPWr_lb^Q9#%sYjR-^ipP
z8Of0XZmp)h|72@#ptH!Zjk;XWh<T?npIHj&I+ql%%S;rEU@60S2?EVc_l|{;dBi6$
zVkUM)xVR2cBEMkF5`-m>M?~t3CdA>+O()#jFXrWAQ2Fe9;&qo|{60wewHQu~g)gI#
zrLJm_n6*$yQCFSenW%$4;2!WCakspBq7}7t*91u0Cj7~c*HFcoE~;tP(C+8YgUeX*
z;*ORavivE?YY<n4K@Ne)n$@?OT1jU<c7Jp_%d=hwUXVU94pcfG=h+wlH_6Pe%nw5+
zq}%IeL9@Zd1IbH2f=+#ZRm3hmV+^seSjn-Vl5uw4=Ok#Bo82_Hfx8Tlb93_hy`2vQ
zOG`;a0V;erOD9<zR~IT6OFni>HO|<lES3`;99!bt*}v3A0UUG6_{p>)RH{*=Azr)k
zGK?R0*tTQ7?lzxqYQnhUfW4>X@_f)$m(0Ze;9XbZ_ykm0b~e4ZFjJhX%^~D1D3Kl@
z#k%2M+%kgbaG2MW?FnF7k%dyrJ*yd1u!@{ps#f0<h!4pw)`=^VXt*<5Mqoni4gqh7
zc?iHQ5Y~he7&8n0h;;Qw$)X&bzIU!gbAR8q5~}jg#KCSw_6aduag`=an3><K+!vCQ
zyBe|~yVGxcaF<KO^@us*1M8oQDAwxgl1LQ-@o7lj=8|)cL48wU*JeJK65itUVyo9;
zD0>B267JOoCNnG?l$G>k$=7|f>IlfqWX~Fe2d#uQ9eM+wEOph_E=5=Un1G>J6r4_C
zZ{Utdy0cCL2h+$p+2QM9S|X&xa(Wh4@w6jQ!pKWwN=-R3><AQ17mMar%xrdMxWac2
z9cR%E%)CK7($Cm5)kDFWrsoE+#KYE@77#01{4{B$;4UtiY*<te=9(vrDg!r)dRIe_
znaX!%aCETxI=;@O#(@`XnE;fPswY?fvO_gS&T%>=SFdIFwrD7PkO|;tptt87A>Y+Z
zeaufB4xvmeN)UI*HjxiEG}^+_qecVsY{JhS!R|EGMSPVBt#BMP=eQRhbI;+JvRV?L
zs@ZEGKLf^Yd&}mdUV0i9EjOnYihI)vDI--oXd#wqadjzptqSlW$5uAEgm7Vhv+~Tr
zUToG+OU;nUGl)(|^S&CEevh@2y4h#ahsh@8bfL&jU#jzW?40N!CKF~~4d6<y9vZcK
zEj6NOag?x_n>ksHafGy9f)i)i0Xxhb%d&caIU8A}>V&LoFl1+KyG(sXf>Z+ZS&FGs
zMaCSu<fg)f$Kyx~2OJ0NsZ&Cd^0LfeT78AKq#+sFnPlvXzu(*fYKpcs<gic{hZs|U
zBl;nq`Msza4!qJG%+;ziTd}5cLR%?NpuJ@cjG6`(FDP*w)fs397U|&6bv8+{;FCMn
zB~qUFXp^vI&e*mx;KV<RF=>F<k|z4|kw%0^e_ZAxuT`t{E;=A|8LEddGMhngEv9ls
zbqT!y8RAPq!7s#5Ri`nNLeXU;bi+;w&Y{`rzpga!jmfvpPqKZm_07)F^8V(D^DE4C
zo#+4z&Z9?sqqtTqygIoe?e!3;DAq0(C$Vu#2keER$Ss<2Nxf)I7}(rle@PfSE)qGT
zRwLvKwggE6q)|KMCuF>j1GEqY@S`QPXu&EPSlnw9{t@$ve3zi~8;5X!QRUr672RC+
zGJ_WJ4t_rbTjadn=^3#ZHxId$Yq6r7-rCFn3YtXglTYP5$C2HoL!oJ@qhjXrW-Vm4
zPZ8LhkLrKNB-US<^vfHro=xp4oHQ69+$jJO4j7h{uVx>DjI(K&1hRIE%7?7ZRO5l$
zzLsd2oa`M-=#JY6VjV{{D{e--q+!);Q4+Boc$UjcAJTD&{C5`=!%d_BL+};%gg%5y
zXG?y&_$49|fnTu|4BaC7T64ZdSuN^cw+Wr}!#Zcz8b>jAF_>p*MLMMBWfPJ75L#z3
z2z5)GaL%4fZ>CArx#JKS1`fdJLsm8O>L{@hB1QceOwij6t6PNh3ts69nhirwt8F(9
z<rC#X_*#UDq=_}v7@sQ%bQvH>OdB^E5qNyTc+k)fiQiDO75jY*=!YNpgA^Q#$}G5m
z%;B}%#F@#u5qx?+E7cqc%R15pg9b^jTmY$iN_?hrLZvmGk}7@C@B?U(Mx}&f&9<i&
z+8z48$2YDmoRM`m@Wqw7D{cf&)}GzL2T$k9@!r9=T!a1gdmmUbmXHO~fvoa-YMxmR
zANMM$_*6L119KE%G{&(W!Z0fF9}c-gYliSDF(!`_xf=>t2fKJ4CIbrLMA-cru@ahu
zprb)%k`yg-1^FUf&NUe#;F|ks(ZocvrZzaJ;36z*83s=9xx+7!{0D?4BKtx8?Vx5M
zyRrDSndxysoKnF0*hHMAjDey@<aaY@d@6Wf@j}RS0Q@)|rvsptl^c?y#W{2qJbM)c
z(#LDilwhRpxbXgqLYLHgK~<4$M0j)9V^Ye~`&eX5t~2(|em1<IjtaZRENcJT7C;mL
zCrcP6R|w@6`@Kw4PIC{XXs%Ogi>6NuTKbR+<Z-!$-iNG_RN2STSa8v2248B8PTK#t
z(Nz%_j_(s+!{nJDv_=h$&MFlymikZFqvEV^9G=bUtj<&+_BLRcN??c#r`=$f`QoC5
z|CL<Mti`S%tI-&_<AX|ym`<MlcJdz@wvb+>E*@jzs{WNE)CSSg-?{v`2t}B=p#?8R
zWC&IRPII&a#2(k*LHe;p9Y{K>&+Za$w|TO&zlD_Y{oRv;qdVZwc#dTWCt44IW6`E(
z77(q4WV}rvVln~vPz(s&XLl8Ae~j)Re8V}SN)i;ioEYAC;5rb*D8<NXf0Fw2Zj>Gs
zmT!%uDX&$i{J^ncQW1(X^hRU2fiK4C=u$EH&R7p1E(k%-`-^o3EYq``DNJ>hg%K5^
zAWD+wf5G&^hUU<(o7@l~<8v@R$YA}vv~*z@^@z0SepU1Ib%}&8K!|k^Dzjo&b-{hG
zD^BwnEV~-=$UUf?y1vEFs91`=f?wl-WpawP9wj(&M4vjEm0%eA8#E)KTtQwaS{ji2
zJ833ChL}fLZ<<+N!()1q*2*Yyh;MBtdseh390^DB3p8Myv2IlD!@E5e?}A6zx?zpJ
z4A=MT1-5I6+SHi;&~4I5vhybtirqgr*?qaYwRy68uz!cW?lTvFa79v~)sA;HnOXT!
zOQmEk1TkjL_Ua7Y1{wuIP_163ZC(aFzt>PEoX<Lh;REn7+jq4W;S&KQfaQ})&l?Xy
z2x4Hxx;+ZH79C$WFNy_$j&_>WwxJ9IUx*6`TNsm*UcEMk{iyRLg6rYi7kj(MuanbL
z>+>I1PER-JJ@7kMZ{XqZ4FH3so8}aC*Rql<YRC*Qod;3Nx^~1sIKDzQHrHuR1zgBN
zB2!V)a{!nNPdU5xkP+R>l>O^t4Kw+M0hGRpr@t9Y0H0F9V8860eSLbWapfGjvtvz2
zEW=Gr$aKs$aluWzLg9D#uPkgC82_!w^~i%TEs0>uxc7oK-c(rcX3}nRTMxOdV+n>2
zkouE8U)Y1II{dkm`?L7hOaApWyffj?Kgi7m$H<nIXFl@99jz6j>$s@@N>%%bTtK`6
zN02j-3dk}8F(sL_p~Yh7wh=(I=f1XVRH2odo7iMz=^*NBk1xC_dQ&OZnD8{qdvJYV
zi`p6xr*<8Yx{$k08&n;{?X5?fkAwvI?VAAz8v1teuwP#O@G+b8nqmFeWMT80odwHZ
z5FfaCq<oL$v$*q-y+!XUJrh5ZRAbOCvABy4`KpZh*tbMSL{4I`#D<&Zz(@ar?6sEB
zd`sT3z-6YS2(y-TWP6%s-DxQ#%?LqTCaGdoEVR<?KaH7Z*J(U-sbCzl%tQ)#>9MPQ
zHHA8`YxhCj;E@-)muxrA&;FfMz|>?HBQTgj1e8zIPf4=Vzliz*q(~obiE)AOqS8oK
zMTdmU?l?bFM;J`fL*}31hv82ujMQ4Wy>B1oav;s5#z<{uqiJ>aTCUI{*v2Bc;OOS<
z6dr%3zS-ZGsTM(onHc7~cAVDb1R>@+W}yk;dug7&0k!Nj*?gsxt!EM)Ai4ND8*>J{
zuyCucki0rLe7$o-!pqU0c5YJ?V);Sr(2Tm|D$7QB6t9ZWr3B<M*eW~2ykMIf)YH++
zt)#QQ_9R&}apCIfs-0((^L8=5SRS8u@ju+ro_w4H5Kxu&ISP<j>8Kb@`>9JOfqa!b
zdcIOx{C<oR)o`WvuCg<)gjdGIaT1nS$ac<L(x^2Kz=F3MK^es;?Ge<#1{9Q&>;u?Y
z3?RK&S8}gSG#6SO7?vr-t}Z1VIY@OHhQ(FdORvlSoqUU;o%Sm`RKE}~o-c^9Rc2Cs
zLNbRmY$zEh#OaL5!dl~~>&u+ZoN@P392HWwL2Mc>^^M0l>NBWt_Hp8*!qR1Yms7Sz
z!>-7vLF|r8bq*!+3kw9>qJVjt@6^xkfKfe|pV-Y7e}d3T&93zj_*xJW;1}JZ;1ED9
z3S7Yr6UhfdA7zEq3Ss-Q_7Na2h)08vo}{@3Hf;{CEo>j1>#PiEY0mQT<dPP}b_5dy
z<0fAyOhe5+fga7ZbMkXt^;WBuygv9g**!_VJvjR2_<!RUw+)2Kv=Ns^W2G(fA!yBS
z5<|x@c=f0h1#DpNa{(mN2c2cj>$s^574VZ6X@7%r5%|>7dm9X(15>m9kZ8RYpQyO7
zybu<FB<5yJMJ2sbtE8%5Me+2Ll0*qqZ?q(*o#VsRW&C%|cT}QPqy!bPmZlSbs*O@-
zK$~G7l?`u*ro4T<=^9^96*ofaC`K%O1<~)5|9^X5+up`;Wtp#oU(ri>Mx+gZ1S!cj
zV{1Z7w9Sb`YDFs9Y?4RQ1R7*VAR3DXMA4hgZ{IrSzEpJsq?}pD`y?S|o>&CB>%DH>
zx-aKgkEobwRq@`U$d+7>G-c_5Pi1yv8<&)BGp3I^8IHe^{_aqWY+f`Iw7RwGBeX>?
zB$fL32KZKFP8_E!_eDj}2kQpbiP(|11U6AoNeTYonSx?(Ud`Xi{8D%k=5={aNF#+e
z+P+`~yK^zP>dHSoeD>z`(b?~^-yXa^M*gTRejWTEXE@$Kmy$8p6kV4JG{uP9a&n^#
z47_Nm2TV=?mD4tUy#KunifDHF=JjEAcESt(LH6q4^fc_k=XPi$wyErd32)@bxDMm3
z1{dr2pr0OFTHPiWh+k*v>2dvJD^1!qi#I<;mxFni0wrl;HwFcnyI6Nr0u`R8Fv!sj
zV9?6~p}T}j4zU1>2$pX^K@T;i1RZ^tL`q@N;o3^~f756eHJ`W{7<%BTA1b=+GV^c^
zl={QYgJct_Cg8emQv`NnDq(XS^6)iiS+R~A+7XrFAdFH3hAs7ON^P=2J^S!S(2-;Z
z&wq1p{Os_#A+i4m4eNVBs1UGys0hZgo0|c-KqL|;tx1IIa2%E=1`UEq1~Ga!yam5g
zRCR~|Llz1I&PS?W@n7T;1>KP#8XBg!kQMZwUw9T$g4?+cQ$OV#LZl<@+CPMgP`IY_
zv|ZWb!S3phV!?d!h`jZs$$7eeZHR>HQR31(%~+Ti6b&pfTNSGV;>p~zG@p<+DEh`N
z(l>F>@t_vhr)69SgwLD_AM#C7(ZnF+#p1Q@T|sK=J;vY?Hla7@@**fAH2kuU=lSe@
z7?AAO=UMhukduUZPQsqZ2PfwwVn7H1fcGDz@9*v2_C6lnOCKFP@kaqh6*j=lx_5Td
zcfQ~&d`GDOdxP}%M=QU-G9YIeHNoK$gPp={y;XXqw|X&N8C@|0#)-2DC!Th_NP*WP
zzJo=)_ja>Qwi*p26K8LbZ9ejE%ol2;;c0A|7!bm~8o8&`kiD={f^Go2A{;|p(&_T%
zs_E^<)h#JTwPwLysjCfLd8U8CZNIoQ=U^O$Aeo2n*m*5nLqaIrK1D>&r*ds^oT-Us
zYkaDvl27GXs}{i@VhFh;KM15oUQRq?r=-d!+mWd)6ujmfG{B8;0N0n>;cAvLFlNS4
zQfmlMwzKbH{E%7`wa!^X!V_TuNzW}kVngoal6vdUg4H9OUlRpw7--10l3cN1rBf7&
zM0Q!Bd@SCEsgI$n8}i_3wV(YS-~X}ql(};Hzx{sS{`q@F^1$QrXg8DZ+Q~oZApJ75
zYub$6u^-9G7_0sLG~B1|s2%~ve{42mH=`2Cu`+N}E8TmE|As<vS<^oEo}w)KONR<8
z-`^GE$%wQ)LTMbv?TSQ>s}26K4R3d#SPXT$SiL=&eR^w83wkIh<4yAOI8c9u11)2V
zI*}z4LK>zyyR(WKu9qFfkdiAa&VvicBlrgMQTYMcifUkB@V=B1<S{`&%Zq6-@|R2k
z-9|2B825FdF=*m>wxs@uJJ*q1mDFIcG!S>|zj4M3s-}%bzY|`h$N`Xc(L8N2l1^E<
zsF;MH@mv^sdi2f0ogBO|20R|Yy!=@#=$gY<JVtSjYNrqyMJO?ibPzj*iFM@!jiz?A
zLpTT8`W=%0_d7pWkJ}0coaie*rV7UQH$g<bs4ft=11$ZTQ87aBt>&N`!k3dbl~Zdo
zMgdyuT!kZ39+coc3)Gl4Du{a0`l=9EQ7a8tsdZW^XIMr-)feEWh4J)GSIV&LR_SBI
z2|akCQ5p=VmzkI_-cek+x!&HzOuSI=%GD~w;X5x@6x76nE@WrLD7vHnlI^kjWIb~?
zQ!6c|#kgG5@tjhZl&ikJiY)Z9HZ_yDGHL|MUVVG;{5b@e=boHw9&e?DryO?QDQv8=
zWsAx;&r5;B35EQ{0^2Z^;2_hB46pygpfd`Hy0o=Sv}{q-3q==7&1D4MPnLulNrt4C
z%ZVALqF^WM2`+`moS;NcCOv6C7qhIkJ&k1%HxG1)u!a<KLshSAJFFmpt;@`a8Lf4d
zpxJ@44&zTkoH0G<2}q1={Dh!S=^~(D7#Uwerx2+!S5uK=a25g(QI9(*Q}w&l&F2FP
zf9;B<t?iKTNi|j5jkgY?JG@jsgG5cS0tGq~+|p8s=yhmRbTA5%RJ-Gr(5VwWM&n6C
zSxJ<I$cNCTiz%GXU5&0wyxwb*vw18@2G0k-s7PUvhb)V8PoyHHl6HaTqM?STBoxNg
z9gYNcPGC=B5s!Ahe6sSB%TC2a5n`Nqfulkg)bL{(#iD*qn7bRXEeUmB>%1TXS}f9x
zylT~9X51ooghU+cSBhw}sAj!Ms1N1~dXqwF!tb&rD?E9*W#@C^%34SqM&)qPA8vIT
zu>_zYjV;@kreQ6`00Wq!z+k3)7qLR~2r%$YOX$WDVt+S+Y@F2_O=K3XlQJIuf|CVz
z{>1QO?R`e#zZaVit)Cjic~vwdbLo^t8h{p?x)ydm)iKiP4f>B{{iPuGEqZ3B4wF{K
zDIE#Ha4v=jPz{N{lP#oZZ4%o%kU8!M0>#dvWA6cVoYF5cC&z+|)Ltcegt!4j42$F@
z5z69Hl}6s{k~E1l^g?3!5FjfKROLQb1dle%+ir8^6Nf<hv$hKWb6yi6McX&K)96Mx
zWy~po#6iesW0J4)S$h!I)MashYW-^h^ecjr3SC2kV~k}B=!G#SrCz)pNkA+Ef+X0)
z>CrXJJE0;&wz+yXb2%Zes;PZddK!E)T1k-uV&tVp?jXW|$-JhES@;RD1~l!OJLoEL
zDT-iCQo23RF(EB#(@$u`O)?P1MM2|B@2UOE;;TeU#K>5HW*k6E<HT#8(&@j3PSm06
z;Wy{@RkyiDVyE6?eONu|xXH~x%`~4TF^xeAen`S(S!hpILQhtL;?+emG&MM^;IiHN
z>Q@|~r`cDsCGlPOqprq_<{uUur^>3%FA*n#AS}gQ8P^^OVH9U4mYiTb61k{!<<aX)
zVITz{iLONd&gMD#s$H+32$s#fsVU1OU1IY08aCP0w(SL(P+a74(wb`6Xq(&{;zQeQ
zT%6Qg&&Z0#m?VSMao+6|y1cQ^wbzYii2|$UikiV2Q2HB{jMIk5z}3xWOB`n$B1S<l
zPu;CfSBl8khT%y9G+H~yB#QwqT7U)(-Xby;?#d9?JS(ea=EJ7?g2GvJo!@MAV_t)p
ziE{HJ^4!&Qg$DV$HHC_$xzZftU(y#O&9%0&u%--ZgO@IqF>_A^I#R-&#NX!uw?0g|
zpJmB5B!gbousTf~%<J^Qx-l$S9E35B1G^x8Q|XO}OV)NlT$?HvV|YwdKp{shthnE~
zLm23U?%@CKdd_;d`}oP#IbqPVCwIP}qqDagp8P_dhOtyuC{E=YU-J2IxC}QIOkI*P
zA$Or0!NJk>MOBVAdMpEp)lRtg(tE2y0LmHVPUWC->)I)Q5Iu2ISV3G$XfRqHTIV6Q
z(#<X7*2&qB<@B78&z?dcX~?>p(jG=1;LS?n3$SyFd6Vi|^fxi);M@Y@Y**Bdu;4)=
zC>OkKWW7X3JGoxVcb<69sbM>sGc&k2*Cg8*6cdAj&X<#SUS>om>PEYd8ya}e;*GFl
z=*GAP&Mg%Wk@<1r9uI;{J6|&vlI$FfDWNb7iO2#2r5uDMga}2km9U3wv)q$Ho0*Og
z>JWT>(+-g@lux7gXuO<yK!D*f@VcMy*err<0)cx;PUPXFs?|bh$)$;A!4)D1ZHTCy
zGtH$DN0(r?%5A`fP`8QmV{TaqtwbA|H;=?Xf`EWA%L&S~jFWa)uq2h}hGirj4g0K`
zkMyG5JW)3;f7q~FXiMbtr<jyE*y(4l^U{rEVwmC1kkGu)X51$mFy(qdQUb$O#yP+z
z#Z+m%ht)G6B)oS+K#Wh}jB#{1)bzx*3RQE2OpTHUVGe*BJF&rJMPV@y%i4wRnHi9o
z>86JC0ZV&~EKVag@N_5qF%X-bIjsaCL+>%*#Oez)s)Q^m)PgzhZJY&gkB0=zTe2bO
zV(Tz@Q^A;~jf`<U-~>hqc}t$XVV9F|qFw%=AZ5q4Ez1-b$&7rkgZ@vOPczM}L21KE
zcEgVC1J^|il`MrUp-}ENw6U&UNEN8Hk~vNF3I`4qFe_+9txXyVdtVLRg0&+2Z7}Lt
z*vhKQoH`byjl1_bJxGMHEZmH8y)gUg?|S}W#nVd`ngk%!Ng1LV8VORw!_P<gjC#A(
z>xNLlLoKetcn94DmvpWJv%;rqKWctDVhM2h=w_N<l|z)DCT6fTObktf0>VRSMzFci
zk$!=&43oiPP4v|CW&w!=I4?Z;wDZ7oj5Ra05}vnt(U|6B;T$Q-KVk(Sw1qOkPiB`f
zvf9hVVp2rYmBBckFYBAuJKXp!q0;Z@IQ7ErNcjzNCA4xj0(3ai9F%QCV{}>TP^$va
zB!?hZljjx$?f&IA4*KF*1MRKTTGY^s%0(>PtcYdU3Cejn6k~*7q#|Gr`=Ikc@~m3B
zA?3G8-s}k-SCjIAakDv)aw1K^Kh8*iK>@wHeHi3idhzWWN#&s42;-zDbC}}2)j+R}
z%8m%!+@dPTlj!i&ez2SPiN<Rq>~bY3sP%F)3bHR~5ulTkuuP%^RE7r0;u^$_C`yq8
z<mg0iv{(TG<*8|8)GgC@*ibV>l4)FHcJj@C96meCzI}c8-(xawgwJLs?sbJxpp7>s
za+^vWN3?1G-PaRlNV*~5!(IeoxVXH^6mHXjZ}ovuxN_cTHvW;CCvakk9S%|`5@=pq
zta3BCTw+?(8^Iy5D^yeoI9gg|sgdJfz_(m8xFw8eS7MpX_u)RZ-N%o4d9`Chafl>l
zr-ZMw9L5DJi@|#xesUt9>^q`gy3!>cZkiC7bjrqcTd7A9U1<kE(gUwC#{P@wRqSz~
zECoGiRJj}HwW~v-rVJ$Od?9$S42-}_-m!4(y~;!jA1)=yI2;Cp?ak2Kx9q{ElkxIx
z=<8dV+s_8H+w6&p;Fh);B<1VutL)XPfjpGRWO7|CWle?k%%QQw=Kx?o^HZB1oh&-p
z7RC*dm=>enqvNX2_!FH6jk%LnsQvM?o__ov|K&eIX@9m2@n<TBmsp9J{9%9bk6*_>
zUfNUq#sB*A-=J+f619qY9$B)`pRpDG+CTmVZ5w#ozQ|&wkG{-)M05V;ZQJp2OPbSY
z=-|=r|F5>~NIkJN_;zsHAPyew{XA{M&F19naG!!eP=aKeBLhkB1H?LJ>>N$K#q3QM
z7cN9$=Rqc1Ugh(5S#KKAGlC$JEMb2x=(3@XKjCnMDDfO(v<Q)64N*2NfjJt_hQ|%H
zhGYz|fJu2o^1IaZdcol|GZ}Vnlzpp5p*aN-FqG+%revBUXjBn+dv8GJfg9R!bXb`Z
zZ8a+2mm`J92uJ58QFN2@!!e+9KbnYn`_<QB=(bj+bR_Gc<vGY~w!LR<=jmesR0+7R
zCSYRxwX;e0lf2#1qQxx3sYbZHg{ZgAh{2A2m$YGUXB>HU@a*j9H;38t!*5?7eE0J3
z`0UPH|ClPq1DUtKFcS0p!quLC?=ZRIu8+83<n7Ih*+5(EVhk?RfI8H-Cn_`W8O(2u
zXqZ~y#qCg+uyhpQxtD-PF4AvIQOAm+-b=XH%caI@t7*x=RY+Iq*el`5ZyRmpd92J&
zPEedg`svv!)2giq)3qs%R<5sFbMF45xZ(q}F+k~ryG6m?6iCoxuKUpplIsA`&!>cr
zeqBv>CXs1WT}Zk>kCyxR;Ex5pIxf-I!blJUjo1`%Pk;@WsJ#hZY(9NgJF<-?tactm
z-B|YCNl?hLgNwO9hRYN`>hEMmC(RMW1w=z7BT|N3pmO9DEjFO#bt7zQ62+hbQf+{F
zt=PmK2smy}pwh0`AT#Deu12QDr*V~r-Nq=vtrR`M7}{)%#1Akl-R98IAQ@gD=*PN%
zAIq%o^Ws8EX14yM5{5!+mZjDCI)Sj0L9Xe7iqV_#vQUmC5z$t^sIn3r*cgY70JcLy
z%fk{ogy9Z*iySzUu-&#49Am{$$pM%b!apxv6@@<OJ{OVdu}&5{FJ?k~)x7SKsz}!!
zZh9RBy>r)GYZ?JKJg;W5T?xBKmyis%`orRt>QVx7)1mSk!wULH;+b-@nBQrI$5kC4
zkWXY9uxnEIEMkUJ7z_q^*#shIQ!!J`C{D~GN#M1lN+qs2OAycO1mb(b_I<uAC+6x5
zH<;g%IGOmwN}ufXXld_O!a~|>BFhv*M@kO28m6P+t*}H9m4ZK8^2D4X>#9^Uc=)J<
zim-8txRgTQ$T=hD10z{deIebH$vrsbtQaFJ3swvb{*+5-+>Py%M^|Ov(g4jhOrTjo
zu(9j+ja<0RyPnv|DQgRhIMumA0>h$OA{Kz~XNQ)vx%MROJZN@ZAaP%U_Zs{wj_=fL
z{Wbi-(IV3*+Dq)o-#rN#)abmR8j8!ws%SD*uWYp+Q-SAk_2l3Y>-|f$EZkLrU@yU#
zT!=fyI4Z|u0bsqYqUCHRehlvlLihQWk|uC8ONp^<Fp*atkrV^Q(d<r=p_asWtTbYH
zGn|lOTPPLS&HtCm*_FSt^87=%p`?QxZ~Aqy*hZArHbT_5nE*2`i^<4Runm$Zx+~_D
z(NHyG>u#uqt~3E2O#IN(Vh0*7?6NL(dk6@lgdd2v(HdYmkWtol{-h=J&M!1~(+rxc
z2uHI9w7h0|QdnEhYL}~A$9krQ!osA~9;hd{Y~6<X#8rrpmldm|QG6QJa@%=Cn1{5e
zW;3-l+Sv3bZI*f*5jIn{ahW53qlZhkSvn(IdP?Yc316PiJ5q%NwcneCn$4f9s-_9{
zk?ME}F*W_PMNrFBj7J}%T8%^N;qFc*i$%Z|>)0PFfOFuSu+fuq4s-eKyePgoecpuO
zoLT2M3)@F0Hlm?~vWkD?q?%D0SUO2u6^Y#9=NC*fY5d+#quYG#=<RK`l&ms6pgF?1
z1tsa&*wE}d3G6(%-)zT5QiTj9f*D{63*=6BxBIC31YxT3@Z0b+>)YvlzQ60`o!?Q$
zpu4wE*Fohkhp+tATZd((pf9>#b_YA%!2rdD*WT)DUhEgW!5}ti%}B0k8w*79_;}L7
z!4696Fw%q3oTM$#k>m0O=etwliXZbm{XJvqU3OT>^<F@fJ*bp(B^Zp{GC@j>jAda>
z=zI{$bGhFkQQ7M3JZJ?it)yh>ai+*ln#KXB9f>PpSHt)x1tzs|DD|}VZXUdT`Q%aW
z*~xEv-@N&*^Nah>Km11wbv12*+o0}+)9@#*1LnaePafgFgU=uDr2pk-clYyO3?2=3
zpFDp2`R-nLZt&>w-jiQsJ3nzd)_#`Q$65A^<#|wkmv=n(k>CGLKLDkescqs)r{Abb
zgQ6Mkk#f$4%gTJ{3#8LgHEJKX=}xEr{P5d@H!sfiJO45q;mPdZ{w@1t6ObfZ*(bm1
zbf`8=Cb$0HfA#&z@$dFCeePcL{9K>L{)a)VK!!g97>mhIR0sC>=bt~mb^kxw8?^TS
zlf6fe?)U%C@p<syw$IDyc7547d-me(Zw_Cd9-SPYe!cNU|8e$3|H%fvKK=e{!1Li^
zr4K--`6PYemqB^&{7d-e>;F`xWH_lWKe5MmpKgze_uJFuWb&Wb`cf!L=!~jq5GO&6
z`hC{>frXxapZ&43fI$cLoML!cWgB96!d+rG$<Q_uKV8#r6t6DGX^R0Ar@D$WtmzFY
z>;qzaJL9sW72&6P+txcaKp!=H^65W|1X{cQm4@P{s^g>kf93ptvO5^u@Bg3U^AEiL
zjppW~+h3RaKjH3QzyE*gIzGPt_g3`(-FyB2XZidC@BfePd;ITPB=Q$??)!~T{`ar`
z&&EH`-p8kT|35fB`u6bj?Bu7d<L>+a;PGDgcWeLeJ-$Exf0obh1r<LfzS2aad|Hmf
z2B{=BMZ(V~4bB>RE;|~zrZ;z^4!3YJDa@HPUmqSke|ad8=|(X3$4*C{dTCX5zHWXx
zok7;i4zlN`FW8ua^O}*hq{GP0Ze~C`@ocJ`&uu=h=wUjw_=Xqx^kSJ`6kBYu_%=d?
zGe(VpNJPtIND3GQ6n!BHGhq<d*|S&Snc@mbQ7Gw|p_azdG{jg8vXX_wuyUe6mGE};
z>U>-{gcm#nC`zL^1lQdhCIC4WK&jOh8gqt!!(u!MQQ*VvweV!EAP6~<{YJTjMYOPV
z`VE2;7N`N~5y~<twFRvNTCQ^XPR-9X6IT?(8NP8!<GQAMpY8CLhnYjTfTIx_wsV`h
z$fJfh04&f^RNbGoa0DjHbW@;_5AX{lVIxwtq4S`yq`sJ5xSS!zWzp|+cEdt^sc8+1
zifr0pXdWnDt_+l+Cv_XhNuy%SSWB=!NFX4po8=|)q!_wVUP*3Klkx>+EQ5Ob&;oj-
zs)UV6u~Ou`M0ATU8G9EsIFJLOQw4%X{XWtFM#|*yy~(JS7gOSG6HtOVW;aDX?_2jv
zL9Nip9f_@T52)wrN+)s33?=R~adGy!e~HtU4%A@h9gg=$ip7JO;O-&hFN@Qh&DwC_
z`UIK`vzu;SqB^T3K!Dgz4G}K%5@}~FEP~hz5|Qs=kK>bA62@U9jqk!-8YP_fRbb)!
zX#iJB7|#eSg3?70cMJX6OfvG}3`cS2_A@=Dx-#g<tlxFBI=|WCs&|L_MU^|+<!oLt
z_Ete7RPMn=6sEqKvD4L9a)5i<*O3wog{8h1mio81iV0ywX$q2qS4ZhS2!AR*0KKlP
zpQ(dPDv$_`+sp6ceF@pC#*2cPL;3u?3}T1b<5C_$ai*+_;sLVg%9;3tALXMJ9gVYV
zl}+!-eM{UzFe;W87^F!!mNLOtA~Z}sb=pG%YzLq!c9Iy+ZyxGWRlIR95_i)8I>9>_
zR$+^&>z}^ebA%PH4D@xu{UpmZjK*^A8#}9q5-W9HRqyJ?s*^lVW_K&fMmEWBG|ecC
zS67y6LS>VPNQ5t*zb_F*$Zb(MQ2mEgLP|ncx+&$9WQUeco+8~!uv9ypM`3aOws58d
z1}=^wVBS#oG=&#|Lj;wAt&x9rgE(5)yfqjX^7EyprK12LOPfjB4Wb510l~X2>q5}6
zT$HvCfFv+M7CX_U6VVH$=;FpvS(I%cZ_CdZN4C!hR}q#7i>PF1C9#PSs@`cvJLC)B
zwMkUurQl`e5|>;w5TNpj(#`b~oJ`Y=<b+Va^M>%o1AuUYo?$I)ggm~&8Avd(LdLul
ztXo8HidvA@v-4secH^ruVf~h1>4VoVnJPPqT?(3oOd_XRI>Cbc(ANc;C_C}s&*$Qk
zQuuzx_!;aANIE79S<w_064<XP?CZ{+(3sychH(0hn-r@-L-9lsvMd5ubdBGJKKMkA
zK-PMgj$=ho<nk2M4V%WFGM-Wz=KJa+FzL1PP3c)$g|1wsBo~x{v+zSWqiu#>AG|aL
zVwR^NIX0UtOad7z&HT3)#!KpfozCO1NuO218pGo>&t_F|^-Ia-L$!iLTZOevq^=;T
zB-VqG?ob)<o3<OX2_6=iEFn`7RJMe>M40Bojm$B)bYL&bNmW;~OFd-;pHoAHj6Pr_
z)$_2p(QiQxP|d-DF3D^Q0Se%cBBJ$PP;cErZWFtw5k*b|Fv*7yy5B4p5|68URjwf%
zuyUN8ULrnYR#2-Ccaf0=&W^If>AW0P+0k#3kf&EUU@U=rflxWy{Ljm<S#sVrAj`wv
zv@j{8ycZu7!h=JQGu#9rqyH|L8I(BvpufNKGi2i=O#InpkneUH;fv$);u2h8CJE|d
zGB!j?0NH|i(y;!o&WjOX)V07|koo6)2odzfLs@VLxAz?X^CC<~iQu(X(UbCgPJlg@
z$8bfZoXieZgTnDMCfdeK6FL@D){2J+U7O!X!iAK_HR-+5Zp0A9u>u%Z$w~^#{|V11
z6vvzdMfa8yvY(z_0IR&<byuQ(^cp(GaN4`7{iN?>gpeyall%xi-8zS_g%vgIwrc>P
zNM3^JJ~GDOK_Cc{WS6K)VerwE#YxyXPd*gIP|8~GYdY>q@}!6yD%b=!ka5nCBf?c6
zjcqCn=K}7*ej-zW5QTC1J!?EnvCUkKE1_~8zU!6KeObYZK`D3QBI#eEK}C*`t7_z2
zk%A&pPDQB|vUp|==Qnyaz6eF}q;*L6As~YL+yMGrg5)VOUM@9q%*(;x4S~Szrr>~%
z1RDhMML71a60BgLU=?8dLOi!5+R6r6Sj7Jnv1CB3r(`u$!gdh9)HAG>GfCLJE{b>1
zsy+`Z_UzK$Dh=(oE+^1y&zE8SFZzz)ML6H&4kIysI9QuXm2uQ)qY;AdXVs=K=Wbc2
zy$p-K#6g0>URoR}!iE9Ygr7X=F27Mg(zw@M#U(K$e>Y(h842V4R^sz(&A8SqqdLw8
zzzsAe?_AabITq$B@eSlj^j%AU*>Aa$EWv&`3pJbeB9FY9S04nB3;Ma=#cF2jh4o7Y
z7CA=jthNclRI?;PKr649X9_`s5lvihtxH7$F`}}quJ0$@6vKwMVLE>E^1vig-!QE_
z--k>P9<?0RQb&|&n1JF6rp{t9hEWxU(&BgG<lKhQsb2KXZ+fBNccOq=|5;Rx;B8`A
zAEoLCbO}tmU6`RlhvhpdYbCY@kP}Kf+CJ$<OdgG}&kU(xJYSZJedKsDa6XY(Lm~|U
z5ds7gdfirth*7eK8Cn{%Qo=6#0=w+GlBg*Pk~J4!WPC3Cq5W*Ig|)amN5rm*89WBm
zaJk4zvLCe*VyuON7V|R5dVr8e)1B0Sg}A$Avtc(gy9K9Kv08Qu2p1b{76j14ay2NT
zv7`$8X&KbzQeY76puwS7P~$WC&meJ%%Cvs3NroWp0Y$RjuX0eAq96l249j~W=LPnT
z-mT|Bb0)G5k6KA4G6Y$jHCK<qA-=Q$it1WC;2~T?n=jIwJp<!Wgu{o6)Plxv;3z5O
zq_wr;JXOTd1%t^=SYQ`GXAw&kbyxVcWFsox4rWyi2PwkZn%R+X;}5Wixm_{{wo%cm
z#$$)b##t9u<Ck)i=HAE2kNx|ns;QuuvNTj>-iZ!)uwrz&O(Q6C&~h6aoU)=c$T43`
zLj`iYD^I|}z#ykc2%SO^43F4|rqy?&F0n9R^KcCo{cY9<M-~L0u}YdIDHt^z2oW)$
z$4hm%1S8Fk_nd7&`C{-2gEasu{edO`N;*8Hs={hfk-sQ7N63qnD;BZx!T`^hKTA*&
z@p{+^FF4z#ayo-7saP$M8?&XzYATD=-m1Enm_S@QZ8iiLputb8aENDLKK|FlyoZ~h
z6zX3~VM7Cnw>$}|nZ(V`4rmxMKBpR~KTFXnHNsq^F#e$?5ovq`J_O=TIoGs2%L~yf
zh$tVJ0rcFmOzl9G;x=o)`Vq2=H&g=_k$Yp%Zm?)@UzB4{PnO(|L%qVf@G&Kq3Zq(h
z72#m3|Ig*r{VP5V|F6Zt^^srj)75de|95Zq^FiDH8~(9#@BjTdJ`bGzx-t1kjrsJ`
zPqU+!uTEZ{9UPzGuQvLn2Ut=7>urqNmsTjAf|LtmA}XXAbWHU_Lihv;V_hS&a?-~0
zaCv)}0C^*qvD8FzPi&bM3mjdY2T3i29WYid<#+^Z9pxeET>Z-)zXTTlIgyh`BfYU&
z5?M2K3_fd3{ueZ?QRPZT<ldw<;;7nn(gZhX0dy0}%LAOL6X8Q0hn`-m`@Aw0h=?AF
z4gsZHCkj?+XvP?<)H2xwIp=T<c0cd$g#R04gD-dcgC}3~2mOHq#5P8u!!)}2BKyh~
zLJxmF)x2o_q@DsMm+90u(FAdatEL@3y!&MD^DjHi71IjLb^1oU$IF^J*0VREZx3&Z
z`k^J0Gx!G{*p!|#@pg!bC!7x9Xw&F|Z2NuApuTMta<;(nj3$greL-y+^*jD=9Sy<v
z(>R9sV7J{1#X@Y<9bUhy_Lzs-_e?`)RnLY&CWW<P#pzDrB7~aN?}T4i&mC2eQzuC!
zoKzRmHZbM}9l*Tg!iKDrzUvqim~dx-)D_E7dw`fffWA$L>ott=SfTb5kQ)Te9eP11
zhT0934j<YszK*2vbs@^WhmLi^&+G%q;^P{GC1@GeV6U8IUzM|`Yk!lqtxH-Lwc;UN
zSJ}EOQBZ$2Zb<9kWy!Iq$nIey9v_@_<9JzabrgrX_qpfuu+FAE3PEG{O`uBCPKg{L
z%#f(hP01^WGRfsWOyAL~gfTd@{QJWfFHR!mgiY}U@(@D>fa+ry$B>vvZXe2*i>fEt
zje4&)xoyQ`-<Au9_r;brG+FaLT{rr}iAZ`RQ8qP#UrPA{!y;@%)=z`!utHj$MMzF0
zo<CC%LvyRk)zJVe;`$anpJ1K5?=(kTWaO=5eoIR*>_(Iz$T2g;7O0b_l+0!Wzintc
z>4k2#qdihx9sfI8lFS#Z>YS*wP2Pk!TzdY?sj+rX4f?zNy*}CI!p_LP!l4^hLr=Cz
zHNU}*J5-$Iuu4p3n(;(Ioz;E>M)IBo!)Q^N7iDy_?G%o%MK4h~<iX-<mKjO=a^}g=
zw42$rGJ)($(t~9wh_+Ce-!&iMMh45Fs2YR@7ZP`3Qch{(;$18VAG4=*&>A$QA&MZ#
z0L1jw6+N9jNZY3rO4(N;q$z>2um0DvnlG<Z6cvDCPy1@c2$7MxyA?<W5ftS}GvKG$
z$=l~Azda76Y@QGqO(2<{SJ%@mNjY{@NC#uG%DvfP6JN}W74~afe+xxF!a$y&rc7QA
z&1tPe#ncuAGGH!DWD)9Ozsmnq&6DUWghWieh`L3_q(~syI4>u_QKAoYTKV60RK=(R
z0div%(vR0hCqc_F_XTJ{KrAFoRS~1cWP=^S&O}iPfDvsW{Y0)W=)Tf!tH*P_#;9tg
zrtEvc>bncSDSY@^Feq#Wp43yHlf?=~jc6RTHUz#;k++>l&?7SBs#3NASx|Ad_w^g<
z2DV$FmMKM~qs@hrjOO(@2^9n=&G<q^eB%kFEIsJ`knQxoblD?RL`e}F{odORaDBG+
z&ee@JCu*-yC9~b;p}$;Q_CV_1-fPBa|J1<()Cn#;_XeC)HE81_UeHyHGqKr17vH#*
zbP;(^yig@Njb`r%lM#1wdwV6dc|m5$UmCW%wL!Sm7V0u+L0*tyG`U~J;-*?di($o^
z*Lh&NnweJ5Bg|2hLPcF9UE)~TW{_UBi7P1U+e2aIUOlL6@Ue&^D)tqvQmkSHafA}a
z{0prTHbb{~`a~A3#_S{r8Yu|aZKd1GTM=*L;LX|h4kyLE&t3+pRE)<A`k1cma;v3S
z#AJ13wBz{BL)h22?}?W;r*B>zzU~EOe>g7|y`91C9^1MzAFb{W+U;8V1K;tVsw_1y
zWg0{Q>HZL$YweZBA00e<(TJ?-cAP%2+X?`G(%(raO4Mj9Tt?o<R3~gHI?Y>VyJ1F)
zXmbZxqYcg$g~3x$V#6m;jf~Zn&gW@nL(x>S%0-0J*JAMCQ!B0CX%WO|5G|R?MOVbg
zL^p+W)Xctujx5LAN(ZseMgE>Qs04B@?Z!1<{PqUSsy14`yYsK7u(SF$_)ICVK6B!w
z>@#JW%l@E+toeLK*2>Qi_@8}7Z$&6!5>|dV$Ujpc5-*ypJ7JBdD-i)^Jp!}$8We-A
zb(#JqYxCG~rW)@ha&wcQ=Rsv&EQAluPP{4(#g>k!XeG;Oype5E5_ZK&?gnz@ObpZa
z>gf2pZi5)CYf2^h7j@}kURI-K_)tqrJEfMU3fboAGOB8!Br0nn2cAcgjlG0v?4x7p
z@&SChM97MkJHh{@Mr8!VzAJZ|o0y>)>Nu1GC|#sibl=PbjB#F!rKfQpTo>mxRH4ho
zVpi{Oi&dguR@;keRu1d!d^l0HoL)l-bg28Cq>hI*8zf;I5-}wg1q)5{)h}r%w){oV
zxoFG!{eGBI7^Dyi9R6xs(Hbw}783sR*{^sN2>(qeBmeR#>>W?X<NV9roxS0sFZc5N
z%P+k+rBrAo#mJ~Op#*OmHr#D>-~jJ>``GCbo?zEDYk>4ELf^2&<aPYc;YD*^oP6ik
zWBy%Tz^O=1q@3`Q?$=~YSnGg(FZm>OT@4XSJn9Hv9g0#6D=V~2*>e{2YKd^{%c@$e
z)N_uopYVl19jz@X=0aHVgW1arNjDABk6q1PAD$kb^|7H!#c6cBKjc3cZ@anTwML?^
zf`N1b5M-dwfjSE$?9>4z;4a47;WaVQbsnT)H8wHIHaxGD$V@{wlq6&Y2`W5_`-a%e
zdXV`_;=u!ibO=^p-_0Cyvejuo6jZ4FsM<wFwWKZU@Kyz!5`u{*E6ju1Qytid4x=kj
zuRsk<tZ0RiU14L~7&Y!YySjuu$pB+-jO%b(f{_waEf&V^WQmK5SC2Fq9X27%qL@jG
z#ZWfXcH?}k`;bVyC-Lekw~6Nc;dd*nbnROp1H<I%8*c;=r;e8~x(aY+RIN)hR^qK!
z5e`LqaZ#lerc^oz{Pqm*a5R%IQi5{4L-4`IRa-;ZLrDNnoVDuQNCsrXThPy*fkLe%
zhb;`rblY(%6!&kHXEqVCbAIGm)od59V8rfTlyZ8(Hi-ywTBxg8y1B({BfCb)cvNdQ
zbF+jp3*4G&{66+(N-{qNLobxD(NUULR8wlC*g39>a$RM)v!T&j#nD2TQ#mZL3q-8q
z9jh)~lX?ZcNqzM|gth>-eL*(#uot~`5;K~*8jV<D6dAoQ)ecNceSsLO#mdbJ3edco
zWJU%lp>GY+zfIV)!!Rq3Glnaif)~}g=MvRWv{W+vxz8!|bSsN&bIH!sXgQg2;V|Is
zN_V-=s+k+)95{I1c@VK9<szE^KBvXY-B&5^`wb1Y+1}O->JAC9c4xP?u6&swhO!Rv
z(yVX9Ix%(DUafys8)$oObh7gx4!2!Gx-Hp-0eq-S^kEX;(rjp}{^r11P+t#(QY$xt
z>GH}f7EjH}AORz8$Y5{|bpaoJ+`AYtqDmGvhg}Qm5*L_!T1foJgKV_)8^4(r#rc>s
zicpbm6L(g_ibvB+I0uE%v?ELu3Ad`+7-DOUPA<8GFki{6B9Oi)CX%+PfzyM4TMVr&
zvsH3aXbo*Nsx>CSI^9z?$d6yjG@n`%?A#t}@6!w$-?1bjJ-B7|uJaqcxAsJfL3cH$
zho@<;ZT@w}V~>UPU#@dOM9(LPJPN1j99J?6*!Lq%dw+i8SzNZ589o~nDV8EZN$Yyn
zzoo$vifs!_|GUsguspk-<Kk{cMI#xNx~kNMu305bo!&s4>50|BkqQbH;nP27Jid7f
zS}N7bByA4OqhVaknFg#$B5dNJH&+sWCardC-PUbm0tE!tj7d6$ro-7pl~akIgE2&C
zE3#}<is4x)??;&uIwrRqrDfYZeR1%c!;^1=#*m#HA2JtE45MKw4B=b|H;s$vesKG@
z4q&70b~9ifk|w83yw2eyO-+ZX7&w<fOym&rApH^5L?DZFr@G0Mu(Gngc{xx@ifp~;
zXw;y6i)V=>AW9;<<Tx%ay(}(?wp_6O@#su^l&j_l<H<>6%!>4gQsxV@L!3T)ee~+=
zG&}qshtJ-C38rb{46S66B<8jU6@Ip8C<NYN|8ZWpG%<3XhQce)B}s#b-jqej%JiBc
zsQ`)ZkJ?Q&w=^0n&iOc10>xtjE5|BhO4Ns9xJ+)wO+8sG5doJ5X!#7TpU=bpGUd*r
zb#VSl{}BGEO2NipLnjUeE6v8d5DABC{yf_x2`=KmWeImu{#g-bF<s4hT6OWSuXJ}q
z&1#k)L9l`?88v%6HV8E$f=8OwE*Qzj<&*#$79~+S@4aMaT#!BYGT~83Z1v(fCw>n@
zS_e|Wft4@3O16KU!wUO248W6ULdy=~4il<xHeI3b)6Nk&NLxKJn!D4Z?|yys;)QFM
zaRj{M9r9WoeS7pw2#;jpe|)vKPF(r6hwx@-`{DnenZSt_$Fv-4_gHPAUYP|^=h|0i
z5H(}kZx3D{A02;Z%rq$lan`G0YV2mcO8%SDac?;oy;dDvhIef*2E8DKDjd0|FHeOa
zXnNzfSqV;wS#(`@lZn4ANi*f48g(D>Q*r01Mc$nBrW?n(RcXMNCGYq;?4S7sFR`^G
zgpbR41YOr*1h~qBB)9|1D*0XP4-(1Iu2m?-J|Jol@1NW9v0Pm-8jlm3b&4<EQToY9
zA#1LRyIe=>R+>v^i5sIqMCPntUt;|}dvSDl9Ax$DLm^9f^ZNFsEON2e7SDIC=FS7p
z7BH1aj`L9(LzSw1HiYW#*U6(>KGGf-h5Jl(FZ9^5oSf)AS)3-)ZFzOtTuhKE)-aoK
zZEr~|<kZ<3L$@+FdzsMpbtUNqd9By&C~johTB8<j+Z;T23&MX9Io4wc3IC-LB#TPE
z3;&H#ZT3zhO*x-H<IXm0Sm6)TI-n^^=<UV?d3*B>?8=SmT<m)ru~V@t+MI6Yt$~`#
zZ?rA(kX{HO@p5W9tNG_FddxE}8~Jt6lUh$$IEiXRp{UKE<WczJRVUJ0kxEpWkb|ZU
zZciSJ4C(b<JL#5%zHT$wGrFBlgU0jv=<IhZanoUw9UULOAQw>@J8h2l$Y{K7AFCL;
zrCpKNOgX1`Atk-*ynK%+jv%|1bMf`mO0ixfiVkB@HEP06ad=B_G<gwIG?!fOrmCE1
zW0nD<2{Nu4g;O%RvWn@AHoEp+IH~mE^P|)3*~!b72glDLkd6;thNDVupq@O^cEQTV
z)sz$SGIXORm|WSC$imQG=7)v5nURBpjgw!gWo&w}#KDBAQM|6mnJd6Flqq?wq{GTH
zg>kYwiX%Bq7sUtK!&QXORS21*Sd;sN`3Ze05syi(!6g3;MKMH}?>E)eW=um2HP>B~
z#=41VudXbt9aI=h%*{nhYdI$Xhtn`CL0m^MXn_$JIEguRZ-}g85~o#Dq}8R->}5j$
zY}mHihzV&A60cJd55wRKW%b(Nr7W4XjqlzZo}Ruu48<I2re|obQl!}SljnQZa^KN9
zgIa_roYWpQZ#g|Gxb~315D7M;mCWk35;d|wjC@wU<KQ(zgFKy1@)X^&KQDxBTox2t
zj`J%A@(?H=HPvoI_Y)WIRk6_sfYJ46Q@}9jesgRfnufWCN}RW@T<NL1Chjc}LAJ2`
zH3?O+Avan*+&-!xR7%_h7?H8LoQ^8J0*5a^9}kaNXN7%T^W^zbELh4cCgZ<u%H=;0
zK;NI7o&}k6c$%HQc?Iu8ld{O?n2hC&u#6Gcg+*J@xLn8DU!EKvot?ZEnd9;P)8ti&
z%<sx2NnejrP8WYK3C;~=y(@0aL1bmFG$@i9F{fG>^pJYP?P@N6$?Xik@xofv$T;lz
zQ?fui8soz(6vnkUUliR;&yP>DWJMHAu?~xcfz4_d4bSlI6)KQRlqZ6ea5cd6lf`i2
zQ85YX3wn@DW2<eAl#P`iq2)+`Sz^N$hYja19Vs~vr;>ilgrGE(k8Z>6nh4DBWw97K
z!yg2-O!K_pX@p6P4QfQhkGeJ?KCkgfbx0?DU-MAt{C_q7Yc2l!RfUYud{+K6Ic6Wh
zf8O1BvV#Bq_#XfL=lT42{Ac1bZ+wDOw~g$NKyk)DzsC0e`@@EQ$rXMuE7zh#ci79U
z_e_DJWk1wt-5>6Tkp4rb*Hh?-aOYWU`%c={BPYlToHw^WN36X1jt2mvamUYS(R_4%
z#}jbO<Ec9yfymA;;4ZxVnM)uJ-tjxU1$Xrmu|L(6cnKeUDq(rN{aNrt-tjX4N{IG)
z`y+5v-tjZqikSDe8VvQ3W)~xkioE@~a8LTk0C0g#@*i%-h@QWrcR~Yt$8_cOU3~+A
z=UrpFm>1z5_lM3uBS!lD=l*m5x&PdM?mzdR`_KL7{&WAi|J;A>Klh*e&;95AbN{*j
Q{5^jDFHITuv;gp`0GjefmH+?%

diff --git a/resources/config/livewire-powergrid.php b/resources/config/livewire-powergrid.php
index e4ca4d2a..3a747869 100644
--- a/resources/config/livewire-powergrid.php
+++ b/resources/config/livewire-powergrid.php
@@ -29,7 +29,7 @@
          */
         'bootstrap-select' => [
             'js'  => 'https://cdnjs.cloudflare.com/ajax/libs/bootstrap-select/1.14.0-beta2/js/bootstrap-select.min.js',
-            'css' => 'https://cdnjs.cloudflare.com/ajax/libs/bootstrap-select/1.14.0-beta2/css/bootstrap-select.min.css'
+            'css' => 'https://cdnjs.cloudflare.com/ajax/libs/bootstrap-select/1.14.0-beta2/css/bootstrap-select.min.css',
         ],
         /*
          * https://flatpickr.js.org
@@ -43,10 +43,10 @@
                     'locale'     => 'pt',
                     'dateFormat' => 'd/m/Y H:i',
                     'enableTime' => true,
-                    'time_24hr'  => true
-                ]
-            ]
-        ]
+                    'time_24hr'  => true,
+                ],
+            ],
+        ],
     ],
 
     /*
@@ -95,9 +95,9 @@
     | Define here the CDN source for imported JS Framework
     |
     */
-    
+
     'js_framework_cdn' => [
-        'alpinejs' => 'https://unpkg.com/alpinejs@3.x.x/dist/cdn.min.js'
+        'alpinejs' => 'https://unpkg.com/alpinejs@3.x.x/dist/cdn.min.js',
         //'alpinejs' => 'https://cdn.jsdelivr.net/gh/alpinejs/alpine@v2.8.2/dist/alpine.min.js' //Alpine 2.8
     ],
 
diff --git a/resources/lang/ca/datatable.php b/resources/lang/ca/datatable.php
index 548df6a3..e114d800 100644
--- a/resources/lang/ca/datatable.php
+++ b/resources/lang/ca/datatable.php
@@ -29,7 +29,7 @@
     ],
     'select' => [
         'select' => 'Seleccioneu',
-        'all'    => 'Tots'
+        'all'    => 'Tots',
     ],
     'boolean_filter' => [
         'all' => 'Tots',
@@ -41,5 +41,5 @@
         'contains_not' => 'No té contingut',
         'starts_with'  => 'Comença per',
         'ends_with'    => 'Acaba en',
-    ]
+    ],
 ];
diff --git a/resources/lang/de/datatable.php b/resources/lang/de/datatable.php
index 348e1bfc..8c9cc21d 100644
--- a/resources/lang/de/datatable.php
+++ b/resources/lang/de/datatable.php
@@ -10,7 +10,7 @@
         'clear_filter'     => 'Filter löschen',
         'no_data'          => 'Keine Ergebnisse gefunden',
         'all'              => 'Alle',
-        'selected'         => 'Ausgewählt'
+        'selected'         => 'Ausgewählt',
     ],
     'placeholders' => [
         'search' => 'Suche',
@@ -41,5 +41,5 @@
         'contains_not' => 'enthält nicht',
         'starts_with'  => 'beginnt mit',
         'ends_with'    => 'endet with',
-    ]
+    ],
 ];
diff --git a/resources/lang/en/datatable.php b/resources/lang/en/datatable.php
index 5c733afd..91de6d41 100644
--- a/resources/lang/en/datatable.php
+++ b/resources/lang/en/datatable.php
@@ -29,7 +29,7 @@
     ],
     'select' => [
         'select' => 'Select',
-        'all'    => 'All'
+        'all'    => 'All',
     ],
     'boolean_filter' => [
         'all' => 'All',
@@ -41,5 +41,5 @@
         'contains_not' => 'Does not contain',
         'starts_with'  => 'Starts with',
         'ends_with'    => 'Ends with',
-    ]
+    ],
 ];
diff --git a/resources/lang/es/datatable.php b/resources/lang/es/datatable.php
index 30270463..ad8f88b5 100644
--- a/resources/lang/es/datatable.php
+++ b/resources/lang/es/datatable.php
@@ -41,5 +41,5 @@
         'contains_not' => 'No contiene',
         'starts_with'  => 'Comienza por',
         'ends_with'    => 'Termina en',
-    ]
+    ],
 ];
diff --git a/resources/lang/fa/datatable.php b/resources/lang/fa/datatable.php
index 0afcafe6..4690cf2a 100644
--- a/resources/lang/fa/datatable.php
+++ b/resources/lang/fa/datatable.php
@@ -5,7 +5,7 @@
         'filter'          => 'فیلتر',
         'export'          => 'ExportXLS',
         'export_one'      => 'ExportXLS انتخاب شده',
-        'export_selected' => 'ExportXLS انتخاب شده'
+        'export_selected' => 'ExportXLS انتخاب شده',
     ],
     'labels' => [
         'action'           => 'اقدام ها',
@@ -24,18 +24,18 @@
         'to'      => 'تا',
         'of'      => 'از',
         'results' => 'نتایج',
-        'all'     => 'همه'
+        'all'     => 'همه',
     ],
     'multi_select' => [
         'select' => 'انتخاب',
-        'all'    => 'همه'
+        'all'    => 'همه',
     ],
     'select' => [
         'select' => 'انتخاب',
-        'all'    => 'همه'
+        'all'    => 'همه',
     ],
     'boolean_filter' => [
-        'all' => 'همه'
+        'all' => 'همه',
     ],
     'input_text_options' => [
         'is'           => 'برابرباشد',
@@ -44,5 +44,5 @@
         'contains_not' => 'شامل نباشد',
         'starts_with'  => 'شروع شود با',
         'ends_with'    => 'خاتمه یابد با',
-    ]
+    ],
 ];
diff --git a/resources/lang/it/datatable.php b/resources/lang/it/datatable.php
index 5a4feb9f..3f42cf1f 100644
--- a/resources/lang/it/datatable.php
+++ b/resources/lang/it/datatable.php
@@ -29,7 +29,7 @@
     ],
     'select' => [
         'select' => 'Seleziona',
-        'all'    => 'Tutti'
+        'all'    => 'Tutti',
     ],
     'boolean_filter' => [
         'all' => 'Tutti',
@@ -41,5 +41,5 @@
         'contains_not' => 'Non contiene',
         'starts_with'  => 'Inizia con',
         'ends_with'    => 'Termina con',
-    ]
+    ],
 ];
diff --git a/resources/lang/pt_BR/datatable.php b/resources/lang/pt_BR/datatable.php
index 284421b5..110302d1 100644
--- a/resources/lang/pt_BR/datatable.php
+++ b/resources/lang/pt_BR/datatable.php
@@ -44,6 +44,6 @@
     ],
     'export' => [
         'exporting'  => 'Please wait!',
-        'completed' => 'Export completed! Your files are ready for download',
+        'completed'  => 'Export completed! Your files are ready for download',
     ],
 ];
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index da522c22..fc703f3c 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -11,7 +11,7 @@
 
         <div class="flex flex-row">
 
-            @if($exportOption && $queues === 0)
+            @if($exportOption)
                 <div class="mr-2 mt-2 sm:mt-0">
                     @includeIf($theme->base. ''.$theme->name.'.export')
                 </div>
@@ -39,7 +39,7 @@ class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 t
         </div>
     @endif
 
-    @if(count($exportedFiles) && $exportFinished)
+    @if($exportFinished)
         <div class="w-full my-3 dark:bg-gray-800">
             <div x-data={show:true} class="rounded-top">
                 <div class="px-4 py-3 rounded-md cursor-pointer bg-gray-200 shadow dark:bg-gray-500"
diff --git a/src/Column.php b/src/Column.php
index 70aa1fd6..c32614e6 100644
--- a/src/Column.php
+++ b/src/Column.php
@@ -50,7 +50,7 @@ public static function add()
      * @param string $title
      * @return $this
      */
-    public function title( string $title ): Column
+    public function title(string $title): Column
     {
         $this->title = $title;
 
@@ -63,7 +63,7 @@ public function title( string $title ): Column
      * @param string $placeholder
      * @return $this
      */
-    public function placeholder( string $placeholder ): Column
+    public function placeholder(string $placeholder): Column
     {
         $this->placeholder = $placeholder;
 
@@ -100,7 +100,7 @@ public function sortable(): Column
      * @param string $field
      * @return $this
      */
-    public function field( string $field ): Column
+    public function field(string $field): Column
     {
         $this->field = $field;
 
@@ -114,7 +114,7 @@ public function field( string $field ): Column
      * @param string $styleAttr
      * @return $this
      */
-    public function headerAttribute( string $classAttr = '', string $styleAttr = '' ): Column
+    public function headerAttribute(string $classAttr = '', string $styleAttr = ''): Column
     {
         $this->headerClass = $classAttr;
         $this->headerStyle = $styleAttr;
@@ -129,7 +129,7 @@ public function headerAttribute( string $classAttr = '', string $styleAttr = ''
      * @param string $styleAttr
      * @return $this
      */
-    public function bodyAttribute( string $classAttr = '', string $styleAttr = '' ): Column
+    public function bodyAttribute(string $classAttr = '', string $styleAttr = ''): Column
     {
         $this->bodyClass = $classAttr;
         $this->bodyStyle = $styleAttr;
@@ -144,7 +144,7 @@ public function hidden(): Column
         return $this;
     }
 
-    public function visibleInExport( bool $visible ): Column
+    public function visibleInExport(bool $visible): Column
     {
         $this->visibleInExport   = $visible;
         $this->searchable        = false;
@@ -159,7 +159,7 @@ public function visibleInExport( bool $visible ): Column
      * @param array $settings
      * @return $this
      */
-    public function makeInputSelect( $datasource, string $displayField, string $dataField, array $settings = [] ): Column
+    public function makeInputSelect($datasource, string $displayField, string $dataField, array $settings = []): Column
     {
         $this->editable                          = false;
         $this->inputs['select']['data_source']   = $datasource;
@@ -177,7 +177,7 @@ public function makeInputSelect( $datasource, string $displayField, string $data
      * @param string $dataField
      * @return $this
      */
-    public function makeInputMultiSelect( $datasource, string $displayField, string $dataField ): Column
+    public function makeInputMultiSelect($datasource, string $displayField, string $dataField): Column
     {
         $this->editable                                = false;
         $this->inputs['multi_select']['data_source']   = $datasource;
@@ -197,7 +197,7 @@ public function makeInputMultiSelect( $datasource, string $displayField, string
      * @param string $classAttr
      * @return Column
      */
-    public function makeInputDatePicker( string $dataField, array $settings = [], string $classAttr = '' ): Column
+    public function makeInputDatePicker(string $dataField, array $settings = [], string $classAttr = ''): Column
     {
         $this->inputs['date_picker']['enabled'] = true;
         $this->inputs['date_picker']['class']   = $classAttr;
@@ -213,7 +213,7 @@ public function makeInputDatePicker( string $dataField, array $settings = [], st
      * @param bool $hasPermission
      * @return Column
      */
-    public function editOnClick( bool $hasPermission = true ): Column
+    public function editOnClick(bool $hasPermission = true): Column
     {
         $this->editable = $hasPermission;
 
@@ -233,7 +233,7 @@ public function toggleable(bool $hasPermission = true, string $trueLabel = 'Yes'
         $this->editable   = false;
         $this->toggleable = [
             'enabled' => $hasPermission,
-            'default' => [$trueLabel,  $falseLabel]
+            'default' => [$trueLabel,  $falseLabel],
         ];
 
         return $this;
@@ -245,7 +245,7 @@ public function toggleable(bool $hasPermission = true, string $trueLabel = 'Yes'
      * @param string $decimal
      * @return $this
      */
-    public function makeInputRange( string $dataField = '', string $thousands = '', string $decimal = '' ): Column
+    public function makeInputRange(string $dataField = '', string $thousands = '', string $decimal = ''): Column
     {
         $this->inputs['number']['enabled']   = true;
         $this->inputs['number']['decimal']   = $decimal;
@@ -259,7 +259,7 @@ public function makeInputRange( string $dataField = '', string $thousands = '',
      * @param string $dataField
      * @return $this
      */
-    public function makeInputText( string $dataField = '' ): Column
+    public function makeInputText(string $dataField = ''): Column
     {
         $this->inputs['input_text']['enabled'] = true;
         $this->dataField                       = $dataField;
@@ -272,11 +272,11 @@ public function makeInputText( string $dataField = '' ): Column
      * @param string $label
      * @return $this
      */
-    public function clickToCopy( $hasPermission, string $label = 'copy' ): Column
+    public function clickToCopy($hasPermission, string $label = 'copy'): Column
     {
         $this->clickToCopy = [
             'enabled' => $hasPermission,
-            'label'   => $label
+            'label'   => $label,
         ];
 
         return $this;
@@ -289,7 +289,7 @@ public function clickToCopy( $hasPermission, string $label = 'copy' ): Column
      * @param array $settings Settings
      * @return $this
      */
-    public function makeBooleanFilter(string $dataField = '' , string $trueLabel = 'Yes', string $falseLabel = 'No', array $settings = []): Column
+    public function makeBooleanFilter(string $dataField = '', string $trueLabel = 'Yes', string $falseLabel = 'No', array $settings = []): Column
     {
         $this->inputs['boolean_filter']['enabled']     = true;
         $this->inputs['boolean_filter']['true_label']  = $trueLabel;
diff --git a/src/Commands/CreateCommand.php b/src/Commands/CreateCommand.php
index 75be1cb1..173222b2 100644
--- a/src/Commands/CreateCommand.php
+++ b/src/Commands/CreateCommand.php
@@ -15,7 +15,7 @@ class CreateCommand extends Command
     {--template= : name of the file that will be used as a template}';
 
     protected $description = 'Make a new PowerGrid table component.';
-    
+
     public function handle()
     {
         if (config('livewire-powergrid.check_version') === true) {
@@ -36,6 +36,7 @@ public function handle()
 
         if (empty(trim($tableName))) {
             $this->error('You must provide a name for your ⚡ PowerGrid Table!');
+
             return;
         }
 
@@ -47,6 +48,7 @@ public function handle()
 
         if (!in_array(strtolower($creationModel), ['m', 'c'])) {
             $this->error('Please enter <comment>[M]</comment> for Model or <comment>[C]</comment> for Collection');
+
             return;
         }
 
@@ -54,6 +56,7 @@ public function handle()
 
         if (empty(trim($modelName))) {
             $this->error('Error: Model name is required.');
+
             return;
         }
 
@@ -70,15 +73,18 @@ public function handle()
         if (count($modelNameArr) === 1) {
             if (strlen(preg_replace('![^A-Z]+!', '', $modelName))) {
                 $this->warn('Error: Could not process the informed Model name. Did you use quotes?<info> E.g. <comment>"\App\Models\ResourceModel"</comment></info>');
+
                 return;
             }
 
-            $this->error('Error: "'.$modelName.'" Invalid model path.<info> Path must be like: <comment>"\App\Models\User"</comment></info>');
+            $this->error('Error: "' . $modelName . '" Invalid model path.<info> Path must be like: <comment>"\App\Models\User"</comment></info>');
+
             return;
         }
 
         if (empty($modelName)) {
             $this->error('Could not create, Model path is missing');
+
             return;
         }
 
@@ -164,41 +170,41 @@ private function createFromFillable(string $modelName, string $modelLastName)
 
             if ($column->getType()->getName() === 'datetime') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '_formatted\', function(' . $modelLastName . ' $model) { ' . "\n" . '                return Carbon::parse($model->' . $field . ')->format(\'d/m/Y H:i:s\');' . "\n" . '            })';
-                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
+                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'date') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '_formatted\', function(' . $modelLastName . ' $model) { ' . "\n" . '                return Carbon::parse($model->' . $field . ')->format(\'d/m/Y\');' . "\n" . '            })';
-                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
+                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'boolean') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->toggleable(),' . "\n\n";
+                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->toggleable(),' . "\n\n";
 
                 continue;
             }
 
             if (in_array($column->getType()->getName(), ['smallint', 'integer', 'bigint'])) {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->makeInputRange(),' . "\n\n";
+                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->makeInputRange(),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'string') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable()' . "\n" . '                ->makeInputText(),' . "\n\n";
+                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable()' . "\n" . '                ->makeInputText(),' . "\n\n";
 
                 continue;
             }
 
             $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-            $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable(),' . "\n\n";
+            $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable(),' . "\n\n";
         }
 
         $columns .= "        ]\n";
diff --git a/src/Commands/DemoCommand.php b/src/Commands/DemoCommand.php
index 95e73b69..c9c976f9 100644
--- a/src/Commands/DemoCommand.php
+++ b/src/Commands/DemoCommand.php
@@ -2,9 +2,9 @@
 
 namespace PowerComponents\LivewirePowerGrid\Commands;
 
-use Illuminate\Support\Str;
 use Illuminate\Console\Command;
 use Illuminate\Filesystem\Filesystem;
+use Illuminate\Support\Str;
 
 class DemoCommand extends Command
 {
@@ -19,25 +19,25 @@ public function handle()
         $tableFileName = 'PowerGridDemoTable';
         $viewFileName  = 'powergrid-demo.blade';
 
-        $livewirePath = 'Http/Livewire/';
+        $livewirePath     = 'Http/Livewire/';
         $fullLivewirePath = app_path($livewirePath);
 
         $viewFolder = 'resources/views';
 
         if (!is_dir($fullLivewirePath)) {
-            (new Filesystem)->makeDirectory($fullLivewirePath);
+            (new Filesystem())->makeDirectory($fullLivewirePath);
         }
 
         $stub = str_replace('{{ url }}', config('app.url'), $this->stubPath);
 
-        file_put_contents($fullLivewirePath . $tableFileName. '.php', file_get_contents($stub . $tableFileName . '.stub'));
-        file_put_contents($this->laravel->basePath($viewFolder) . '/' . $viewFileName. '.php', file_get_contents($stub. $viewFileName . '.stub'));
+        file_put_contents($fullLivewirePath . $tableFileName . '.php', file_get_contents($stub . $tableFileName . '.stub'));
+        file_put_contents($this->laravel->basePath($viewFolder) . '/' . $viewFileName . '.php', file_get_contents($stub . $viewFileName . '.stub'));
 
         $this->info('⚡ *** PowerGrid Demo Table is ready! ***');
         $this->info("\n⚡ <comment>{$tableFileName}.php</comment> was successfully created at [<comment>App/{$livewirePath}</comment>]");
         $this->info("\n⚡ <comment>{$viewFileName}.php</comment> was successfully created at [<comment>{$viewFolder}/</comment>]");
         $this->info("\n⚡ *** Usage ***");
         $this->info("\n<comment>➤</comment> You must include <comment>Route::view('/powergrid', 'powergrid-demo');</comment> in <comment>routes/web.php</comment> file.");
-        $this->info("\n<comment>➤</comment> Visit <comment>".config('app.url')."/powergrid</comment>. Enjoy it!\n");
+        $this->info("\n<comment>➤</comment> Visit <comment>" . config('app.url') . "/powergrid</comment>. Enjoy it!\n");
     }
 }
diff --git a/src/Commands/PublishCommand.php b/src/Commands/PublishCommand.php
index a0d35447..e9124181 100644
--- a/src/Commands/PublishCommand.php
+++ b/src/Commands/PublishCommand.php
@@ -14,7 +14,7 @@ class PublishCommand extends Command
     public function handle()
     {
         if (!is_dir($stubsPath = $this->laravel->basePath('stubs'))) {
-            (new Filesystem)->makeDirectory($stubsPath);
+            (new Filesystem())->makeDirectory($stubsPath);
         }
 
         $files = [
diff --git a/src/Helpers/Collection.php b/src/Helpers/Collection.php
index 3deb83b3..b8ae53de 100644
--- a/src/Helpers/Collection.php
+++ b/src/Helpers/Collection.php
@@ -195,9 +195,9 @@ public function filterDatePicker(string $field, $value)
     private function validateInputTextOptions(string $field): bool
     {
         return isset($this->filters['input_text_options'][$field]) && in_array(
-                strtolower($this->filters['input_text_options'][$field]),
-                ['is', 'is_not', 'contains', 'contains_not', 'starts_with', 'ends_with']
-            );
+            strtolower($this->filters['input_text_options'][$field]),
+            ['is', 'is_not', 'contains', 'contains_not', 'starts_with', 'ends_with']
+        );
     }
 
     /**
@@ -323,14 +323,16 @@ public function filterNumber(string $field, $value): void
     public function filterContains(): Collection
     {
         if (!empty($this->search)) {
-            $this->query = $this->query->filter(function ($row) {             
+            $this->query = $this->query->filter(function ($row) {
                 foreach ($this->columns as $column) {
                     $field = $column->field;
+
                     try {
                         if (Str::contains(strtolower($row->{$field}), strtolower($this->search))) {
                             return false !== stristr($row->{$field}, strtolower($this->search));
                         }
-                    } catch (\Exception $exception) {}
+                    } catch (\Exception $exception) {
+                    }
                 }
 
                 return false;
diff --git a/src/Helpers/InteractsWithVersions.php b/src/Helpers/InteractsWithVersions.php
index 6712cbf7..eb430b47 100644
--- a/src/Helpers/InteractsWithVersions.php
+++ b/src/Helpers/InteractsWithVersions.php
@@ -55,8 +55,8 @@ public function getLatestVersion(): string
     {
         $resolver = static::$latestVersionResolver ?? function () {
             $package = json_decode(file_get_contents(
-                    'https://packagist.org/p2/power-components/livewire-powergrid.json'
-                ), true);
+                'https://packagist.org/p2/power-components/livewire-powergrid.json'
+            ), true);
 
             return collect($package['packages']['power-components/livewire-powergrid'])
                     ->first()['version'];
diff --git a/src/Helpers/Model.php b/src/Helpers/Model.php
index d5973156..5b80fc14 100644
--- a/src/Helpers/Model.php
+++ b/src/Helpers/Model.php
@@ -107,9 +107,9 @@ public function filter(): Builder
     private function validateInputTextOptions(string $field): bool
     {
         return isset($this->filters['input_text_options'][$field]) && in_array(
-                strtolower($this->filters['input_text_options'][$field]),
-                ['is', 'is_not', 'contains', 'contains_not', 'starts_with', 'ends_with']
-            );
+            strtolower($this->filters['input_text_options'][$field]),
+            ['is', 'is_not', 'contains', 'contains_not', 'starts_with', 'ends_with']
+        );
     }
 
     /**
@@ -134,27 +134,27 @@ public function filterInputText(Builder $query, string $field, $value)
         $textFieldOperator = ($this->validateInputTextOptions($field) ? strtolower($this->filters['input_text_options'][$field]) : 'contains');
 
         switch ($textFieldOperator) {
-            case 'is' :
+            case 'is':
                 $query->where($field, '=', $value);
 
                 break;
-            case 'is_not' :
+            case 'is_not':
                 $query->where($field, '!=', $value);
 
                 break;
-            case 'starts_with' :
+            case 'starts_with':
                 $query->where($field, 'like', $value . '%');
 
                 break;
-            case 'ends_with' :
+            case 'ends_with':
                 $query->where($field, 'like', '%' . $value);
 
                 break;
-            case 'contains' :
+            case 'contains':
                 $query->where($field, 'like', '%' . $value . '%');
 
                 break;
-            case 'contains_not' :
+            case 'contains_not':
                 $query->where($field, 'not like', '%' . $value . '%');
 
                 break;
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index e8aa61bf..35d9159b 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -20,7 +20,7 @@ class ExportJob implements ShouldQueue
     use Queueable;
     use SerializesModels;
 
-    private string $exportFileName;
+    private string $fileName;
 
     private PowerGridComponent $componentTable;
 
@@ -37,7 +37,7 @@ class ExportJob implements ShouldQueue
     /**
      * @param string $componentTable
      * @param string $type
-     * @param string $exportFileName
+     * @param string $fileName
      * @param array $columns
      * @param $datasource
      * @param $offset
@@ -46,24 +46,22 @@ class ExportJob implements ShouldQueue
     public function __construct(
         string $componentTable,
         string $type,
-        string $exportFileName,
+        string $fileName,
         array $columns,
         $offset,
         $limit
     ) {
-        $this->type           = $type;
-        $this->exportFileName = $exportFileName;
-        $this->columns        = $columns;
-        $this->offset         = $offset;
-        $this->limit          = $limit;
+        $this->type     = $type;
+        $this->fileName = $fileName;
+        $this->columns  = $columns;
+        $this->offset   = $offset;
+        $this->limit    = $limit;
 
         $this->componentTable = new $componentTable();
     }
 
     public function handle()
     {
-        $fileName = $this->exportFileName . '-' . $this->offset . '-' . $this->limit;
-
         $query = $this->componentTable
             ->datasource()
             ->offset($this->offset)
diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index b9abf647..b4fd2204 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -212,7 +212,7 @@ private function resolveModel($datasource = null)
             return $this->datasource();
         }
 
-        $this->totalOfRecord = $datasource->count();
+        $this->total = $datasource->count();
 
         return $datasource;
     }
diff --git a/src/PowerGridManager.php b/src/PowerGridManager.php
index 2f9ae083..9874d6f5 100644
--- a/src/PowerGridManager.php
+++ b/src/PowerGridManager.php
@@ -25,6 +25,6 @@ public static function theme(string $class): ThemeBase
             $class = \PowerComponents\LivewirePowerGrid\Themes\Bootstrap5::class;
         }
 
-        return new $class;
+        return new $class();
     }
 }
diff --git a/src/Providers/PowerGridServiceProvider.php b/src/Providers/PowerGridServiceProvider.php
index d8853520..8872318b 100644
--- a/src/Providers/PowerGridServiceProvider.php
+++ b/src/Providers/PowerGridServiceProvider.php
@@ -4,11 +4,11 @@
 
 use Illuminate\Support\Facades\Blade;
 use Illuminate\Support\ServiceProvider;
-use PowerComponents\LivewirePowerGrid\PowerGridManager;
-use PowerComponents\LivewirePowerGrid\Themes\ThemeManager;
-use PowerComponents\LivewirePowerGrid\Commands\DemoCommand;
 use PowerComponents\LivewirePowerGrid\Commands\CreateCommand;
+use PowerComponents\LivewirePowerGrid\Commands\DemoCommand;
 use PowerComponents\LivewirePowerGrid\Commands\PublishCommand;
+use PowerComponents\LivewirePowerGrid\PowerGridManager;
+use PowerComponents\LivewirePowerGrid\Themes\ThemeManager;
 
 class PowerGridServiceProvider extends ServiceProvider
 {
@@ -67,7 +67,7 @@ private function loadConfigs()
         ], 'livewire-powergrid-config');
 
         $this->publishes([
-            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/livewire-powergrid')
+            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/livewire-powergrid'),
         ], 'livewire-powergrid-lang');
     }
 }
diff --git a/src/Themes/Components/Actions.php b/src/Themes/Components/Actions.php
index 2343bc87..6984399e 100644
--- a/src/Themes/Components/Actions.php
+++ b/src/Themes/Components/Actions.php
@@ -21,7 +21,7 @@ class Actions
      * @param string $attrStyle
      * @return $this
      */
-    public function rowsBtn(string $attrClass= '', string $attrStyle=''): Actions
+    public function rowsBtn(string $attrClass = '', string $attrStyle = ''): Actions
     {
         $this->btnClass    = $attrClass;
         $this->btnStyle    = $attrStyle;
@@ -34,7 +34,7 @@ public function rowsBtn(string $attrClass= '', string $attrStyle=''): Actions
      * @param string $attrStyle
      * @return $this
      */
-    public function tdBody(string $attrClass= '', string $attrStyle=''): Actions
+    public function tdBody(string $attrClass = '', string $attrStyle = ''): Actions
     {
         $this->tdBodyClass = $attrClass;
         $this->tdBodyStyle = $attrStyle;
@@ -47,7 +47,7 @@ public function tdBody(string $attrClass= '', string $attrStyle=''): Actions
      * @param string $attrStyle
      * @return $this
      */
-    public function headerBtn(string $attrClass= '', string $attrStyle=''): Actions
+    public function headerBtn(string $attrClass = '', string $attrStyle = ''): Actions
     {
         $this->headerBtnClass = $attrClass;
         $this->headerBtnStyle = $attrStyle;
diff --git a/src/Themes/Components/Checkbox.php b/src/Themes/Components/Checkbox.php
index 8596fedb..a81c95b1 100644
--- a/src/Themes/Components/Checkbox.php
+++ b/src/Themes/Components/Checkbox.php
@@ -18,7 +18,7 @@ class Checkbox
 
     public string $divClass = '';
 
-    public function th(string $attrClass, string $attrStyle=''): Checkbox
+    public function th(string $attrClass, string $attrStyle = ''): Checkbox
     {
         $this->thClass    = $attrClass;
         $this->thStyle    = $attrStyle;
@@ -26,7 +26,7 @@ public function th(string $attrClass, string $attrStyle=''): Checkbox
         return $this;
     }
 
-    public function label(string $attrClass, string $attrStyle=''): Checkbox
+    public function label(string $attrClass, string $attrStyle = ''): Checkbox
     {
         $this->labelClass = $attrClass;
         $this->labelStyle = $attrStyle;
@@ -34,7 +34,7 @@ public function label(string $attrClass, string $attrStyle=''): Checkbox
         return $this;
     }
 
-    public function input (string $attrClass, string $attrStyle=''): Checkbox
+    public function input(string $attrClass, string $attrStyle = ''): Checkbox
     {
         $this->inputClass = $attrClass;
         $this->inputStyle = $attrStyle;
diff --git a/src/Themes/Components/Cols.php b/src/Themes/Components/Cols.php
index d4845c89..01c40bd6 100644
--- a/src/Themes/Components/Cols.php
+++ b/src/Themes/Components/Cols.php
@@ -12,7 +12,7 @@ class Cols
 
     public string $clearFilterStyle = '';
 
-    public function div(string $attrClass='', string $attrStyle=''): Cols
+    public function div(string $attrClass = '', string $attrStyle = ''): Cols
     {
         $this->divClass    = $attrClass;
         $this->divStyle    = $attrStyle;
@@ -20,7 +20,7 @@ public function div(string $attrClass='', string $attrStyle=''): Cols
         return $this;
     }
 
-    public function clearFilter(string $attrClass='', string $attrStyle=''): Cols
+    public function clearFilter(string $attrClass = '', string $attrStyle = ''): Cols
     {
         $this->clearFilterClass    = $attrClass;
         $this->clearFilterStyle    = $attrStyle;
diff --git a/src/Themes/Components/FilterBoolean.php b/src/Themes/Components/FilterBoolean.php
index edfc63c2..68d2af14 100644
--- a/src/Themes/Components/FilterBoolean.php
+++ b/src/Themes/Components/FilterBoolean.php
@@ -14,7 +14,7 @@ class FilterBoolean
 
     public string $relativeDivClass = '';
 
-    public function input(string $attrClass, string $divStyle=''): FilterBoolean
+    public function input(string $attrClass, string $divStyle = ''): FilterBoolean
     {
         $this->inputClass = $attrClass;
 
diff --git a/src/Themes/Components/FilterInputText.php b/src/Themes/Components/FilterInputText.php
index 8fa9ff44..0c8eea17 100644
--- a/src/Themes/Components/FilterInputText.php
+++ b/src/Themes/Components/FilterInputText.php
@@ -14,7 +14,7 @@ class FilterInputText
 
     public string $relativeDivClass = '';
 
-    public function select(string $attrClass, string $relativeDivClass=''): FilterInputText
+    public function select(string $attrClass, string $relativeDivClass = ''): FilterInputText
     {
         $this->selectClass = $attrClass;
 
diff --git a/src/Themes/Components/FilterMultiSelect.php b/src/Themes/Components/FilterMultiSelect.php
index 2b09ba2f..f932fc9f 100644
--- a/src/Themes/Components/FilterMultiSelect.php
+++ b/src/Themes/Components/FilterMultiSelect.php
@@ -12,21 +12,21 @@ class FilterMultiSelect
 
     public string $view = '';
 
-    public function input(string $attrClass=''): FilterMultiSelect
+    public function input(string $attrClass = ''): FilterMultiSelect
     {
         $this->inputClass = $attrClass;
 
         return $this;
     }
 
-    public function divNotInline(string $attrClass=''): FilterMultiSelect
+    public function divNotInline(string $attrClass = ''): FilterMultiSelect
     {
         $this->divClassNotInline = $attrClass;
 
         return $this;
     }
 
-    public function divInline(string $attrClass=''): FilterMultiSelect
+    public function divInline(string $attrClass = ''): FilterMultiSelect
     {
         $this->divClassInline = $attrClass;
 
diff --git a/src/Themes/Components/FilterNumber.php b/src/Themes/Components/FilterNumber.php
index ffebe899..25d4d8b7 100644
--- a/src/Themes/Components/FilterNumber.php
+++ b/src/Themes/Components/FilterNumber.php
@@ -10,21 +10,21 @@ class FilterNumber
 
     public string $divClassInline = '';
 
-    public function input(string $attrClass=''): FilterNumber
+    public function input(string $attrClass = ''): FilterNumber
     {
         $this->inputClass = $attrClass;
 
         return $this;
     }
 
-    public function divNotInline(string $attrClass=''): FilterNumber
+    public function divNotInline(string $attrClass = ''): FilterNumber
     {
         $this->divClassNotInline = $attrClass;
 
         return $this;
     }
 
-    public function divInline(string $attrClass=''): FilterNumber
+    public function divInline(string $attrClass = ''): FilterNumber
     {
         $this->divClassInline = $attrClass;
 
diff --git a/src/Themes/Components/FilterSelect.php b/src/Themes/Components/FilterSelect.php
index e3b5e796..73de83df 100644
--- a/src/Themes/Components/FilterSelect.php
+++ b/src/Themes/Components/FilterSelect.php
@@ -12,28 +12,28 @@ class FilterSelect
 
     public string $relativeDivClass = '';
 
-    public function input(string $attrClass=''): FilterSelect
+    public function input(string $attrClass = ''): FilterSelect
     {
         $this->inputClass = $attrClass;
 
         return $this;
     }
 
-    public function divNotInline(string $attrClass=''): FilterSelect
+    public function divNotInline(string $attrClass = ''): FilterSelect
     {
         $this->divClassNotInline = $attrClass;
 
         return $this;
     }
 
-    public function divInline(string $attrClass=''): FilterSelect
+    public function divInline(string $attrClass = ''): FilterSelect
     {
         $this->divClassInline = $attrClass;
 
         return $this;
     }
 
-    public function relativeDiv(string $attrClass=''): FilterSelect
+    public function relativeDiv(string $attrClass = ''): FilterSelect
     {
         $this->relativeDivClass = $attrClass;
 
diff --git a/src/Themes/Components/Footer.php b/src/Themes/Components/Footer.php
index a1a79dbe..79538514 100644
--- a/src/Themes/Components/Footer.php
+++ b/src/Themes/Components/Footer.php
@@ -10,7 +10,7 @@ class Footer
 
     public string $view = '';
 
-    public function select(string $attrClass='', string $attrStyle=''): Footer
+    public function select(string $attrClass = '', string $attrStyle = ''): Footer
     {
         $this->selectClass    = $attrClass;
         $this->selectStyle    = $attrStyle;
diff --git a/src/Themes/Components/Table.php b/src/Themes/Components/Table.php
index 345fc056..fe6c1479 100644
--- a/src/Themes/Components/Table.php
+++ b/src/Themes/Components/Table.php
@@ -37,13 +37,13 @@ class Table
      * @param string $tableClass
      * @param string $tableStyle
      */
-    public function __construct(string $tableClass, string $tableStyle='')
+    public function __construct(string $tableClass, string $tableStyle = '')
     {
         $this->tableClass = $tableClass;
         $this->tableStyle = $tableStyle;
     }
 
-    public function thead(string $attrClass, string $attrStyle=''): Table
+    public function thead(string $attrClass, string $attrStyle = ''): Table
     {
         $this->theadClass = $attrClass;
         $this->theadStyle = $attrStyle;
@@ -51,7 +51,7 @@ public function thead(string $attrClass, string $attrStyle=''): Table
         return $this;
     }
 
-    public function tr(string $attrClass, string $attrStyle=''): Table
+    public function tr(string $attrClass, string $attrStyle = ''): Table
     {
         $this->trClass = $attrClass;
         $this->trStyle = $attrStyle;
@@ -59,7 +59,7 @@ public function tr(string $attrClass, string $attrStyle=''): Table
         return $this;
     }
 
-    public function th(string $attrClass, string $attrStyle=''): Table
+    public function th(string $attrClass, string $attrStyle = ''): Table
     {
         $this->thClass = $attrClass;
         $this->thStyle = $attrStyle;
@@ -67,7 +67,7 @@ public function th(string $attrClass, string $attrStyle=''): Table
         return $this;
     }
 
-    public function tbody(string $attrClass, string $attrStyle=''): Table
+    public function tbody(string $attrClass, string $attrStyle = ''): Table
     {
         $this->tbodyClass = $attrClass;
         $this->tbodyStyle = $attrStyle;
@@ -75,7 +75,7 @@ public function tbody(string $attrClass, string $attrStyle=''): Table
         return $this;
     }
 
-    public function trBody(string $attrClass, string $attrStyle=''): Table
+    public function trBody(string $attrClass, string $attrStyle = ''): Table
     {
         $this->trBodyClass = $attrClass;
         $this->trBodyStyle = $attrStyle;
@@ -83,7 +83,7 @@ public function trBody(string $attrClass, string $attrStyle=''): Table
         return $this;
     }
 
-    public function tdBody(string $attrClass, string $attrStyle=''): Table
+    public function tdBody(string $attrClass, string $attrStyle = ''): Table
     {
         $this->tdBodyClass = $attrClass;
         $this->tdBodyStyle = $attrStyle;
diff --git a/src/Themes/Theme.php b/src/Themes/Theme.php
index 3c631847..2c5bc44e 100644
--- a/src/Themes/Theme.php
+++ b/src/Themes/Theme.php
@@ -3,22 +3,20 @@
 namespace PowerComponents\LivewirePowerGrid\Themes;
 
 use Illuminate\Support\Facades\Facade;
-use PowerComponents\LivewirePowerGrid\Themes\Components\{
-    Actions,
-    Checkbox,
-    Cols,
-    Editable,
-    FilterBoolean,
-    FilterDatePicker,
-    FilterInputText,
-    FilterMultiSelect,
-    FilterNumber,
-    FilterSelect,
-    Footer,
-    Layout,
-    Table,
-    Toggleable
-};
+use PowerComponents\LivewirePowerGrid\Themes\Components\Actions;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Checkbox;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Cols;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Editable;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterBoolean;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterDatePicker;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterInputText;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterMultiSelect;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterNumber;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterSelect;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Footer;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Layout;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Table;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Toggleable;
 
 /**
  * @method static Table table(string $attrClass, string $attrStyle='')
diff --git a/src/Themes/ThemeManager.php b/src/Themes/ThemeManager.php
index 5605b558..eedd547d 100644
--- a/src/Themes/ThemeManager.php
+++ b/src/Themes/ThemeManager.php
@@ -2,26 +2,24 @@
 
 namespace PowerComponents\LivewirePowerGrid\Themes;
 
-use PowerComponents\LivewirePowerGrid\Themes\Components\{
-    Actions,
-    Checkbox,
-    Cols,
-    Editable,
-    FilterBoolean,
-    FilterDatePicker,
-    FilterInputText,
-    FilterMultiSelect,
-    FilterNumber,
-    FilterSelect,
-    Footer,
-    Layout,
-    Table,
-    Toggleable
-};
+use PowerComponents\LivewirePowerGrid\Themes\Components\Actions;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Checkbox;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Cols;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Editable;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterBoolean;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterDatePicker;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterInputText;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterMultiSelect;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterNumber;
+use PowerComponents\LivewirePowerGrid\Themes\Components\FilterSelect;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Footer;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Layout;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Table;
+use PowerComponents\LivewirePowerGrid\Themes\Components\Toggleable;
 
 class ThemeManager
 {
-    public function table(string $attrClass, string $attrStyle=''): Table
+    public function table(string $attrClass, string $attrStyle = ''): Table
     {
         return new Table($attrClass, $attrStyle);
     }
diff --git a/src/Traits/Checkbox.php b/src/Traits/Checkbox.php
index afe4f9aa..198d6162 100644
--- a/src/Traits/Checkbox.php
+++ b/src/Traits/Checkbox.php
@@ -32,4 +32,3 @@ public function selectCheckboxAll()
         $this->checkboxAll = false;
     }
 }
-
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 5046c166..07105cd3 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -5,7 +5,10 @@
 use App\Http\Livewire\DishesTable;
 use App\Models\Dish;
 use Illuminate\Bus\Batch;
+use Illuminate\Support\Collection;
 use Illuminate\Support\Facades\Bus;
+use Illuminate\Support\Facades\Storage;
+use Illuminate\Support\Str;
 use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
@@ -101,7 +104,6 @@ public function exportToXLS(bool $selected = false)
     }
 
     /**
-     * @return BinaryFileResponse
      * @throws \Throwable
      */
     public function exportToCsv(bool $selected = false)
@@ -150,37 +152,9 @@ public function runOnQueue(string $type)
             $this->exporting      = true;
             $this->exportFinished = false;
 
-            switch ($type) {
-                case ExportToCsv::class:
-                    $this->extension = 'csv';
+            $queues = $this->createQueue($type);
 
-                    break;
-                case ExportToXLS::class:
-                    $this->extension = 'xlsx';
-            }
-
-            $queues  = collect();
-            $perPage = $this->totalOfRecord / $this->queues;
-            $page    = 0;
-            $limit   = $perPage;
-
-            for ($i = 1; $i < ($this->queues +1); $i++) {
-                $queues->push(new ExportJob(
-                    get_called_class(),
-                    $type,
-                    $this->exportFileName,
-                    $this->columns(),
-                    $page,
-                    $limit,
-                ));
-
-                $this->exportedFiles[] = $this->exportFileName . '-' . $page . '-' . $limit . '.' . $this->extension;
-
-                $page  = $limit + 1;
-                $limit = ($page - 1) + $perPage;
-            }
-
-            $batch = Bus::batch([
+            $batch  = Bus::batch([
                 $queues->toArray(),
             ])
                 ->name('PowerGrid Batch')
@@ -191,4 +165,41 @@ public function runOnQueue(string $type)
             return true;
         }
     }
+
+    public function createQueue(string $type): Collection
+    {
+        $queues  = collect();
+        $perPage = $this->total / $this->queues;
+        $page    = 0;
+        $limit   = $perPage;
+
+        switch ($type) {
+            case ExportToCsv::class:
+                $this->extension = 'csv';
+
+                break;
+            case ExportToXLS::class:
+                $this->extension = 'xlsx';
+        }
+
+        for ($i = 1; $i < ($this->queues + 1); $i++) {
+            $file = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . $page . '-' . $limit . '.' . $this->extension;
+
+            $queues->push(new ExportJob(
+                get_called_class(),
+                $type,
+                $file,
+                $this->columns(),
+                $page,
+                $limit,
+            ));
+
+            $this->exportedFiles[] = $file;
+
+            $page  = $limit + 1;
+            $limit = ($page - 1) + $perPage;
+        }
+
+        return $queues;
+    }
 }
diff --git a/tests/Feature/FilterBooleanTest.php b/tests/Feature/FilterBooleanTest.php
index d5e0e95c..4532e6fc 100644
--- a/tests/Feature/FilterBooleanTest.php
+++ b/tests/Feature/FilterBooleanTest.php
@@ -50,6 +50,6 @@ function filterBoolean(string $field, ?string $value): array
     return [
         'boolean' => [
             $field => $value,
-        ]
+        ],
     ];
 }
diff --git a/tests/Feature/FilterInputDateTimeTest.php b/tests/Feature/FilterInputDateTimeTest.php
index 0d8d8b6d..4c432be0 100644
--- a/tests/Feature/FilterInputDateTimeTest.php
+++ b/tests/Feature/FilterInputDateTimeTest.php
@@ -12,7 +12,7 @@
         'type="text"',
         'placeholder="Select a period"',
         'wire:model="filters.input_date_picker.produced_at"',
-        'wire:ignore'
+        'wire:ignore',
     ])
     ->assertSeeHtml('Pastel de Nata')
     ->assertSeeHtml('Peixada da chef Nábia')
@@ -36,7 +36,7 @@ function filterInputDate(string $startDate, string $endDate): array
             "produced_at" => [
                 0 => $startDate,
                 1 => $endDate,
-            ]
+            ],
         ],
     ];
 }
diff --git a/tests/Feature/FilterNameOptionsTest.php b/tests/Feature/FilterNameOptionsTest.php
index 413b2799..54d9bb3f 100644
--- a/tests/Feature/FilterNameOptionsTest.php
+++ b/tests/Feature/FilterNameOptionsTest.php
@@ -84,10 +84,10 @@ function filterInputText(string $text, string $type): array
 {
     return [
         "input_text" => [
-            "name" => $text
+            "name" => $text,
         ],
         "input_text_options" => [
-            "name" => $type
-        ]
+            "name" => $type,
+        ],
     ];
 }
diff --git a/tests/Feature/FilterNumberTest.php b/tests/Feature/FilterNumberTest.php
index c2bc2032..757f4f06 100644
--- a/tests/Feature/FilterNumberTest.php
+++ b/tests/Feature/FilterNumberTest.php
@@ -62,8 +62,8 @@ function filterNumber(string $field, ?string $min, ?string $max, ?string $thousa
                 'start'     => $min,
                 'end'       => $max,
                 'thousands' => $thousands,
-                'decimal'   => $decimal
-            ]
-        ]
+                'decimal'   => $decimal,
+            ],
+        ],
     ];
 }
diff --git a/tests/Feature/PowerGridTest.php b/tests/Feature/PowerGridTest.php
index 49235715..b9823549 100644
--- a/tests/Feature/PowerGridTest.php
+++ b/tests/Feature/PowerGridTest.php
@@ -9,8 +9,8 @@
     $collection = new Collection([
         new Dish([
             'id'   => '1',
-            'name' => 'Bolo'
-        ])
+            'name' => 'Bolo',
+        ]),
     ]);
 
     $grid =  PowerGrid::eloquent($collection)
@@ -25,7 +25,7 @@
 it('returns relationships properly', function () {
     $stub = new Dish([
         'id'   => '1',
-        'name' => 'Bolo'
+        'name' => 'Bolo',
     ]);
 
     $stub->setRelation('parent', new Category(['name' => 'Parent']));
diff --git a/tests/Models/Category.php b/tests/Models/Category.php
index 07a388a5..25244b7a 100644
--- a/tests/Models/Category.php
+++ b/tests/Models/Category.php
@@ -16,7 +16,7 @@ class Category extends Model
     protected $table = 'categories';
 
     protected $fillable = [
-        'name'
+        'name',
     ];
 
     public function dishes()
diff --git a/tests/TestCase.php b/tests/TestCase.php
index aec99703..eaa220c2 100644
--- a/tests/TestCase.php
+++ b/tests/TestCase.php
@@ -2,12 +2,12 @@
 
 namespace PowerComponents\LivewirePowerGrid\Tests;
 
-use \Orchestra\Testbench\TestCase as BaseTestCase;
 use Illuminate\Database\Schema\Blueprint;
 use Illuminate\Foundation\Application;
 use Illuminate\Support\Facades\DB;
 use Illuminate\Support\Facades\Schema;
 use Livewire\LivewireServiceProvider;
+use Orchestra\Testbench\TestCase as BaseTestCase;
 use function Pest\Faker\faker;
 
 use PowerComponents\LivewirePowerGrid\Providers\PowerGridServiceProvider;
@@ -61,70 +61,70 @@ protected function seeders()
                 'category_id' => 6,
                 'price'       => 10.00,
                 'in_stock'    => true,
-                'produced_at' => '2021-01-01 00:00:00'
+                'produced_at' => '2021-01-01 00:00:00',
             ],
             [
                 'name'        => 'Peixada da chef Nábia',
                 'category_id' => 1,
                 'price'       => 20.50,
                 'in_stock'    => true,
-                'produced_at' => '2021-02-02 00:00:00'
+                'produced_at' => '2021-02-02 00:00:00',
             ],
             [
                 'name'        => 'Carne Louca',
                 'category_id' => 1,
                 'price'       => 30.00,
                 'in_stock'    => true,
-                'produced_at' => '2021-03-03 00:00:00'
+                'produced_at' => '2021-03-03 00:00:00',
             ],
             [
                 'name'        => 'Bife à Rolê',
                 'category_id' => 1,
                 'price'       => 40.50,
                 'in_stock'    => true,
-                'produced_at' => '2021-04-04 00:00:00'
+                'produced_at' => '2021-04-04 00:00:00',
             ],
             [
                 'name'        => 'Francesinha vegana',
                 'category_id' => 2,
                 'price'       => 50.00,
                 'in_stock'    => true,
-                'produced_at' => '2021-05-05 00:00:00'
+                'produced_at' => '2021-05-05 00:00:00',
             ],
             [
                 'name'        => 'Francesinha',
                 'category_id' => 1,
                 'price'       => 60.50,
                 'in_stock'    => false,
-                'produced_at' => '2026-06-06 00:00:00'
+                'produced_at' => '2026-06-06 00:00:00',
             ],
             [
                 'name'        => 'Barco-Sushi da Sueli',
                 'category_id' => 1,
                 'price'       => 70.00,
                 'in_stock'    => false,
-                'produced_at' => '2021-07-07 19:59:59'
+                'produced_at' => '2021-07-07 19:59:59',
             ],
             [
                 'name'        => 'Barco-Sushi Simples',
                 'category_id' => 1,
                 'price'       => 80.40,
                 'in_stock'    => false,
-                'produced_at' => '2021-08-08 00:00:00'
+                'produced_at' => '2021-08-08 00:00:00',
             ],
             [
                 'name'        => 'Polpetone Filé Mignon',
                 'category_id' => 1,
                 'price'       => 90.10,
                 'in_stock'    => false,
-                'produced_at' => '2021-09-09 00:00:00'
+                'produced_at' => '2021-09-09 00:00:00',
             ],
             [
                 'name'        => 'борщ',
                 'category_id' => 7,
                 'price'       => 100.90,
                 'in_stock'    => false,
-                'produced_at' => '2021-10-10 00:00:00'
+                'produced_at' => '2021-10-10 00:00:00',
             ],
             ['name' => 'Bife à Parmegiana', 'category_id' => 1],
             ['name' => 'Berinjela à Parmegiana', 'category_id' => 4],
@@ -233,7 +233,7 @@ protected function seeders()
                 'price'       => $price,
                 'calories'    => $faker->biasedNumberBetween($min = 40, $max = 890, $function = 'sqrt'),
                 'in_stock'    => $in_stock,
-                'produced_at' => $produced_at
+                'produced_at' => $produced_at,
             ];
 
             DB::table('dishes')->insert($dish);

From 739882384543e0362b82807f93d10c0c2d2e7a69 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 17 Oct 2021 10:25:31 -0300
Subject: [PATCH 05/34] wip

---
 src/Jobs/ExportJob.php    | 26 +++++---------
 src/Traits/Exportable.php | 71 +++++++++++++++++++++++++++++----------
 2 files changed, 62 insertions(+), 35 deletions(-)

diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index 35d9159b..43cec9d7 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -2,14 +2,13 @@
 
 namespace PowerComponents\LivewirePowerGrid\Jobs;
 
-use App\Http\Livewire\DishesTable;
-use App\Models\Dish;
 use Illuminate\Bus\Batchable;
 use Illuminate\Bus\Queueable;
 use Illuminate\Contracts\Queue\ShouldQueue;
 use Illuminate\Foundation\Bus\Dispatchable;
 use Illuminate\Queue\InteractsWithQueue;
 use Illuminate\Queue\SerializesModels;
+use Illuminate\Support\Str;
 use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 
 class ExportJob implements ShouldQueue
@@ -26,8 +25,6 @@ class ExportJob implements ShouldQueue
 
     private array $columns;
 
-    private $datasource;
-
     private string $type;
 
     private int $offset;
@@ -36,26 +33,19 @@ class ExportJob implements ShouldQueue
 
     /**
      * @param string $componentTable
-     * @param string $type
-     * @param string $fileName
      * @param array $columns
-     * @param $datasource
-     * @param $offset
-     * @param $limit
+     * @param array $params
      */
     public function __construct(
         string $componentTable,
-        string $type,
-        string $fileName,
         array $columns,
-        $offset,
-        $limit
+        array $params
     ) {
-        $this->type     = $type;
-        $this->fileName = $fileName;
         $this->columns  = $columns;
-        $this->offset   = $offset;
-        $this->limit    = $limit;
+        $this->type     = data_get($params, 'type');
+        $this->fileName = data_get($params, 'fileName');
+        $this->offset   = data_get($params, 'offset');
+        $this->limit    = data_get($params, 'limit');
 
         $this->componentTable = new $componentTable();
     }
@@ -69,7 +59,7 @@ public function handle()
             ->get();
 
         return (new $this->type())
-            ->fileName($fileName)
+            ->fileName(Str::of($this->fileName)->replace('.xlsx', '')->replace('.csv', ''))
             ->setData($this->columns, $this->transform($query))
             ->store();
     }
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 07105cd3..bbb2bd8b 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -7,12 +7,14 @@
 use Illuminate\Bus\Batch;
 use Illuminate\Support\Collection;
 use Illuminate\Support\Facades\Bus;
+use Illuminate\Support\Facades\Log;
 use Illuminate\Support\Facades\Storage;
 use Illuminate\Support\Str;
 use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
 use Symfony\Component\HttpFoundation\BinaryFileResponse;
+use Throwable;
 
 /**
  * @property Batch exportBatch
@@ -31,6 +33,12 @@ trait Exportable
 
     public string $batchId = '';
 
+    public string $batchName = 'Powergrid batch export';
+
+    public string $onConnection = 'sync';
+
+    public string $onQueue = 'default';
+
     public string $extension = '';
 
     public int $total = 0;
@@ -93,7 +101,7 @@ public function prepareToExport(bool $selected = false)
      */
     public function exportToXLS(bool $selected = false)
     {
-        $this->runOnQueue(ExportToXLS::class, $selected);
+        $this->runOnQueue(ExportToXLS::class);
 
         if ($this->queues === 0) {
             return (new ExportToXLS())
@@ -108,7 +116,7 @@ public function exportToXLS(bool $selected = false)
      */
     public function exportToCsv(bool $selected = false)
     {
-        $this->runOnQueue(ExportToCsv::class, $selected);
+        $this->runOnQueue(ExportToCsv::class);
 
         if ($this->queues === 0) {
             return (new ExportToCsv())
@@ -143,6 +151,21 @@ public function downloadExport(string $file): BinaryFileResponse
         return response()->download(storage_path($file));
     }
 
+    public function batchThen(Batch $batch)
+    {
+        Log::debug('batchThen: ' . json_encode($batch));
+    }
+
+    public function batchCatch(Batch $batch, Throwable $e)
+    {
+        Log::debug('batchCatch: ' . json_encode($batch) . ' e: ' . json_encode($e));
+    }
+
+    public function batchFinally(Batch $batch)
+    {
+        Log::debug('batchFinally: ' . json_encode($batch));
+    }
+
     /**
      * @throws \Throwable
      */
@@ -152,12 +175,21 @@ public function runOnQueue(string $type)
             $this->exporting      = true;
             $this->exportFinished = false;
 
-            $queues = $this->createQueue($type);
+            $queues = $this->createQueues($type);
 
             $batch  = Bus::batch([
                 $queues->toArray(),
             ])
-                ->name('PowerGrid Batch')
+                ->name($this->batchName)
+                ->onQueue($this->onQueue)
+                ->onConnection($this->onConnection)
+                ->then(function (Batch $batch) {
+                    return $this->batchThen($batch);
+                })->catch(function (Batch $batch, Throwable $e) {
+                    return $this->batchCatch($batch, $e);
+                })->finally(function (Batch $batch) {
+                    return $this->batchFinally($batch);
+                })
                 ->dispatch();
 
             $this->batchId = $batch->id;
@@ -166,12 +198,13 @@ public function runOnQueue(string $type)
         }
     }
 
-    public function createQueue(string $type): Collection
+    public function createQueues(string $type): Collection
     {
-        $queues  = collect();
-        $perPage = $this->total / $this->queues;
-        $page    = 0;
-        $limit   = $perPage;
+        $this->exportedFiles = [];
+        $queues              = collect();
+        $perPage             = $this->total / $this->queues;
+        $offset              = 0;
+        $limit               = $perPage;
 
         switch ($type) {
             case ExportToCsv::class:
@@ -183,21 +216,25 @@ public function createQueue(string $type): Collection
         }
 
         for ($i = 1; $i < ($this->queues + 1); $i++) {
-            $file = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . $page . '-' . $limit . '.' . $this->extension;
+            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . $offset . '-' . $limit . '-' . $this->id . '.' . $this->extension;
+
+            $params = [
+                'type'     => $type,
+                'fileName' => $fileName,
+                'offset'   => $offset,
+                'limit'    => $limit,
+            ];
 
             $queues->push(new ExportJob(
                 get_called_class(),
-                $type,
-                $file,
                 $this->columns(),
-                $page,
-                $limit,
+                $params,
             ));
 
-            $this->exportedFiles[] = $file;
+            $this->exportedFiles[] = $fileName;
 
-            $page  = $limit + 1;
-            $limit = ($page - 1) + $perPage;
+            $offset = $limit + 1;
+            $limit  = ($offset - 1) + $perPage;
         }
 
         return $queues;

From 4c7f394f231131e1382d682271cb87e777b4bb84 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 17 Oct 2021 10:29:02 -0300
Subject: [PATCH 06/34] wip

---
 src/Traits/Exportable.php | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index bbb2bd8b..40115eba 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -153,17 +153,14 @@ public function downloadExport(string $file): BinaryFileResponse
 
     public function batchThen(Batch $batch)
     {
-        Log::debug('batchThen: ' . json_encode($batch));
     }
 
     public function batchCatch(Batch $batch, Throwable $e)
     {
-        Log::debug('batchCatch: ' . json_encode($batch) . ' e: ' . json_encode($e));
     }
 
     public function batchFinally(Batch $batch)
     {
-        Log::debug('batchFinally: ' . json_encode($batch));
     }
 
     /**

From eb4b384a34ee5a22e6b31fbe767350842bb90024 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 17 Oct 2021 11:44:27 -0300
Subject: [PATCH 07/34] trans

---
 resources/lang/ca/datatable.php    | 4 ++++
 resources/lang/de/datatable.php    | 4 ++++
 resources/lang/en/datatable.php    | 4 ++++
 resources/lang/es/datatable.php    | 4 ++++
 resources/lang/fa/datatable.php    | 4 ++++
 resources/lang/it/datatable.php    | 4 ++++
 resources/lang/pt_BR/datatable.php | 4 ++--
 src/Traits/Exportable.php          | 6 +++---
 8 files changed, 29 insertions(+), 5 deletions(-)

diff --git a/resources/lang/ca/datatable.php b/resources/lang/ca/datatable.php
index e114d800..daa4fa12 100644
--- a/resources/lang/ca/datatable.php
+++ b/resources/lang/ca/datatable.php
@@ -42,4 +42,8 @@
         'starts_with'  => 'Comença per',
         'ends_with'    => 'Acaba en',
     ],
+    'export' => [
+        'exporting'  => 'Espereu, si us plau!',
+        'completed'  => 'S\'ha completat l\'exportació. Els vostres fitxers estan a punt per descarregar-se',
+    ],
 ];
diff --git a/resources/lang/de/datatable.php b/resources/lang/de/datatable.php
index 8c9cc21d..a3889a50 100644
--- a/resources/lang/de/datatable.php
+++ b/resources/lang/de/datatable.php
@@ -42,4 +42,8 @@
         'starts_with'  => 'beginnt mit',
         'ends_with'    => 'endet with',
     ],
+    'export' => [
+        'exporting'  => 'Warten Sie mal!',
+        'completed'  => 'Export abgeschlossen! Ihre Dateien stehen zum Download bereit',
+    ],
 ];
diff --git a/resources/lang/en/datatable.php b/resources/lang/en/datatable.php
index 91de6d41..a3435036 100644
--- a/resources/lang/en/datatable.php
+++ b/resources/lang/en/datatable.php
@@ -42,4 +42,8 @@
         'starts_with'  => 'Starts with',
         'ends_with'    => 'Ends with',
     ],
+    'export' => [
+        'exporting'  => 'Please wait!',
+        'completed'  => 'Export completed! Your files are ready for download',
+    ],
 ];
diff --git a/resources/lang/es/datatable.php b/resources/lang/es/datatable.php
index ad8f88b5..9ca2143a 100644
--- a/resources/lang/es/datatable.php
+++ b/resources/lang/es/datatable.php
@@ -42,4 +42,8 @@
         'starts_with'  => 'Comienza por',
         'ends_with'    => 'Termina en',
     ],
+    'export' => [
+        'exporting'  => '¡Espere por favor!',
+        'completed'  => '¡Exportación completada! Tus archivos están listos para descargar',
+    ],
 ];
diff --git a/resources/lang/fa/datatable.php b/resources/lang/fa/datatable.php
index 4690cf2a..2ef98373 100644
--- a/resources/lang/fa/datatable.php
+++ b/resources/lang/fa/datatable.php
@@ -45,4 +45,8 @@
         'starts_with'  => 'شروع شود با',
         'ends_with'    => 'خاتمه یابد با',
     ],
+    'export' => [
+        'exporting'  => 'لطفا صبر کنید!',
+        'completed'  => 'صادرات به پایان رسید! فایل های شما آماده بارگیری هستند',
+    ],
 ];
diff --git a/resources/lang/it/datatable.php b/resources/lang/it/datatable.php
index 3f42cf1f..b1297ede 100644
--- a/resources/lang/it/datatable.php
+++ b/resources/lang/it/datatable.php
@@ -42,4 +42,8 @@
         'starts_with'  => 'Inizia con',
         'ends_with'    => 'Termina con',
     ],
+    'export' => [
+        'exporting'  => 'Attendere prego!',
+        'completed'  => 'Esportazione completata! I tuoi file sono pronti per il download',
+    ],
 ];
diff --git a/resources/lang/pt_BR/datatable.php b/resources/lang/pt_BR/datatable.php
index 110302d1..a74ba621 100644
--- a/resources/lang/pt_BR/datatable.php
+++ b/resources/lang/pt_BR/datatable.php
@@ -43,7 +43,7 @@
         'ends_with'    => 'Termina com',
     ],
     'export' => [
-        'exporting'  => 'Please wait!',
-        'completed'  => 'Export completed! Your files are ready for download',
+        'exporting'  => 'Por favor, aguarde!',
+        'completed'  => 'Exportação concluída! Seus arquivos estão prontos para download',
     ],
 ];
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 40115eba..b3f9ef84 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -181,11 +181,11 @@ public function runOnQueue(string $type)
                 ->onQueue($this->onQueue)
                 ->onConnection($this->onConnection)
                 ->then(function (Batch $batch) {
-                    return $this->batchThen($batch);
+                    $this->batchThen($batch);
                 })->catch(function (Batch $batch, Throwable $e) {
-                    return $this->batchCatch($batch, $e);
+                    $this->batchCatch($batch, $e);
                 })->finally(function (Batch $batch) {
-                    return $this->batchFinally($batch);
+                    $this->batchFinally($batch);
                 })
                 ->dispatch();
 

From 62832eb42295f9b2be347c8d73eb547cb37c0335 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Mon, 18 Oct 2021 19:41:30 -0300
Subject: [PATCH 08/34] wip

---
 src/Jobs/ExportJob.php    | 6 +++++-
 src/Traits/Exportable.php | 6 +++---
 2 files changed, 8 insertions(+), 4 deletions(-)

diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index 43cec9d7..da6369ce 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -59,7 +59,11 @@ public function handle()
             ->get();
 
         return (new $this->type())
-            ->fileName(Str::of($this->fileName)->replace('.xlsx', '')->replace('.csv', ''))
+            ->fileName(
+                Str::of($this->fileName)
+                ->replace('.xlsx', '')
+                ->replace('.csv', '')
+            )
             ->setData($this->columns, $this->transform($query))
             ->store();
     }
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index b3f9ef84..f10966ae 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -213,7 +213,7 @@ public function createQueues(string $type): Collection
         }
 
         for ($i = 1; $i < ($this->queues + 1); $i++) {
-            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . $offset . '-' . $limit . '-' . $this->id . '.' . $this->extension;
+            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . ($offset + 1) . '-' . $limit . '-' . $this->id . '.' . $this->extension;
 
             $params = [
                 'type'     => $type,
@@ -230,8 +230,8 @@ public function createQueues(string $type): Collection
 
             $this->exportedFiles[] = $fileName;
 
-            $offset = $limit + 1;
-            $limit  = ($offset - 1) + $perPage;
+            $offset = $limit;
+            $limit  = $offset + $perPage;
         }
 
         return $queues;

From 48b631b90968b3c4766747448cacd61fd796b4b5 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 19 Oct 2021 08:47:01 -0300
Subject: [PATCH 09/34] wip

---
 .../frameworks/tailwind/header.blade.php      |  2 +-
 src/Traits/Exportable.php                     | 20 +++++++++++++------
 2 files changed, 15 insertions(+), 7 deletions(-)

diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index fc703f3c..0fd2b851 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -29,7 +29,7 @@
 
 </div>
 
-@if($queues)
+@if($queues && $showExporting)
 
     @if($exporting && !$exportFinished)
         <div wire:poll="updateExportProgress"
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index f10966ae..7459c31f 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -45,6 +45,8 @@ trait Exportable
 
     public int $queues = 0;
 
+    public bool $showExporting = true;
+
     public int $progress = 0;
 
     public array $exportedFiles = [];
@@ -143,6 +145,8 @@ public function updateExportProgress()
             if ($this->exportFinished) {
                 $this->exporting = false;
             }
+
+            $this->onBatchExecuting($this->exportBatch);
         }
     }
 
@@ -151,15 +155,19 @@ public function downloadExport(string $file): BinaryFileResponse
         return response()->download(storage_path($file));
     }
 
-    public function batchThen(Batch $batch)
+    public function onBatchExecuting(Batch $batch)
+    {
+    }
+
+    public function onBatchThen(Batch $batch)
     {
     }
 
-    public function batchCatch(Batch $batch, Throwable $e)
+    public function onBatchCatch(Batch $batch, Throwable $e)
     {
     }
 
-    public function batchFinally(Batch $batch)
+    public function onBatchFinally(Batch $batch)
     {
     }
 
@@ -181,11 +189,11 @@ public function runOnQueue(string $type)
                 ->onQueue($this->onQueue)
                 ->onConnection($this->onConnection)
                 ->then(function (Batch $batch) {
-                    $this->batchThen($batch);
+                    $this->onBatchThen($batch);
                 })->catch(function (Batch $batch, Throwable $e) {
-                    $this->batchCatch($batch, $e);
+                    $this->onBatchCatch($batch, $e);
                 })->finally(function (Batch $batch) {
-                    $this->batchFinally($batch);
+                    $this->onBatchFinally($batch);
                 })
                 ->dispatch();
 

From a091f55accecf8b9a03caf50f5cef9fa1ed43da1 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 23 Oct 2021 10:02:18 -0300
Subject: [PATCH 10/34] add queue for bootstrap5

---
 .github/workflows/php.yml                     | 11 ++--
 .../frameworks/bootstrap5/header.blade.php    | 66 ++++++++++++++++---
 src/Commands/PublishCommand.php               | 19 +++++-
 src/Jobs/ExportJob.php                        | 35 +---------
 src/Providers/PowerGridServiceProvider.php    | 33 +++++-----
 src/Traits/Exportable.php                     |  4 +-
 src/Traits/ExportableJob.php                  | 42 ++++++++++++
 7 files changed, 144 insertions(+), 66 deletions(-)
 create mode 100644 src/Traits/ExportableJob.php

diff --git a/.github/workflows/php.yml b/.github/workflows/php.yml
index 7e759c9d..2988638d 100644
--- a/.github/workflows/php.yml
+++ b/.github/workflows/php.yml
@@ -25,13 +25,12 @@ jobs:
         key: ${{ runner.os }}-php-${{ hashFiles('**/composer.lock') }}
         restore-keys: |
           ${{ runner.os }}-php-
+
     - name: Install dependencies
       run: composer install --prefer-dist --no-progress
-    - name: tests
-      run: vendor/bin/pest
 
-    # Add a test script to composer.json, for instance: "test": "vendor/bin/phpunit"
-    # Docs: https://getcomposer.org/doc/articles/scripts.md
+    - name: cs-fixer
+      run: vendor/bin/php-cs-fixer fix --dry-run --using-cache=no --verbose --stop-on-violation
 
-    # - name: Run test suite
-    #   run: composer run-script test
+    - name: tests
+      run: vendor/bin/pest
diff --git a/resources/views/components/frameworks/bootstrap5/header.blade.php b/resources/views/components/frameworks/bootstrap5/header.blade.php
index 00057347..2e3063c4 100644
--- a/resources/views/components/frameworks/bootstrap5/header.blade.php
+++ b/resources/views/components/frameworks/bootstrap5/header.blade.php
@@ -21,14 +21,60 @@
     </div>
 </div>
 
-<div class="col-md-12 d-flex" style="margin-top: 5px">
-@foreach($enabledFilters as $field => $filter)
-    <div wire:click.prevent="clearFilter('{{ $field }}')" style="cursor: pointer; padding-right: 4px">
-        <span class="badge rounded-pill bg-light text-dark">{{ $filter['label'] }}
-         <svg width="10" stroke="currentColor" fill="none" viewBox="0 0 8 8">
-            <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
-        </svg>
-        </span>
+
+@if($queues && $showExporting)
+
+    @if($exporting && !$exportFinished)
+        <div wire:poll="updateExportProgress"
+             class="my-3 px-4 rounded-md py-3 shadow-sm text-center">
+            <div>{{ $progress }}%</div>
+            <div>{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
+        </div>
+    @endif
+
+    @if($exportFinished)
+        <div class="my-3">
+            <p>
+                <button class="btn btn-primary"
+                        type="button"
+                        data-bs-toggle="collapse"
+                        data-bs-target="#collapseCompleted"
+                        aria-expanded="false"
+                        aria-controls="collapseCompleted">
+                    ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
+                </button>
+            </p>
+            <div class="collapse" id="collapseCompleted">
+                <div class="card card-body">
+                    @foreach($exportedFiles as $file)
+                        <div class="d-flex w-full p-2" style="cursor:pointer">
+                            <x-livewire-powergrid::icons.download
+                                style="width: 1.5rem;
+                                       margin-right: 6px;
+                                       color: #2d3034;"/>
+                            <a
+                                wire:click="downloadExport('{{ $file }}')">
+                                {{ $file }}
+                            </a>
+                        </div>
+                    @endforeach
+                </div>
+            </div>
+        </div>
+    @endif
+@endif
+
+@if(count($enabledFilters))
+    <div class="col-md-12 d-flex" style="margin-top: 5px">
+        @foreach($enabledFilters as $field => $filter)
+            <div wire:click.prevent="clearFilter('{{ $field }}')"
+                 style="cursor: pointer; padding-right: 4px">
+            <span class="badge rounded-pill bg-light text-dark">{{ $filter['label'] }}
+                 <svg width="10" stroke="currentColor" fill="none" viewBox="0 0 8 8">
+                    <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
+                </svg>
+            </span>
+            </div>
+        @endforeach
     </div>
-@endforeach
-</div>
+@endif
diff --git a/src/Commands/PublishCommand.php b/src/Commands/PublishCommand.php
index e9124181..231dd42f 100644
--- a/src/Commands/PublishCommand.php
+++ b/src/Commands/PublishCommand.php
@@ -7,12 +7,27 @@
 
 class PublishCommand extends Command
 {
-    protected $signature = 'powergrid:publish {--force=}';
+    protected $signature = 'powergrid:publish {--type=job} {--force=}';
 
-    protected $description = 'Make a new PowerGrid table component.';
+    protected $description = 'Publish table stub';
 
     public function handle()
     {
+        if ($this->option('type') === 'job') {
+            $file = file_get_contents(__DIR__ . '/../Jobs/ExportJob.php');
+            $stub = str_replace('namespace PowerComponents\\LivewirePowerGrid\\Jobs', 'namespace App\Jobs', $file);
+
+            if (!is_dir(app_path('Jobs'))) {
+                (new Filesystem())->makeDirectory(app_path('Jobs'));
+            }
+
+            file_put_contents(app_path('Jobs') . '/ExportJob.php', $stub);
+
+            $this->info('Job file published successfully.');
+
+            return;
+        }
+
         if (!is_dir($stubsPath = $this->laravel->basePath('stubs'))) {
             (new Filesystem())->makeDirectory($stubsPath);
         }
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index da6369ce..20837248 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -8,8 +8,7 @@
 use Illuminate\Foundation\Bus\Dispatchable;
 use Illuminate\Queue\InteractsWithQueue;
 use Illuminate\Queue\SerializesModels;
-use Illuminate\Support\Str;
-use PowerComponents\LivewirePowerGrid\PowerGridComponent;
+use PowerComponents\LivewirePowerGrid\Traits\ExportableJob;
 
 class ExportJob implements ShouldQueue
 {
@@ -18,18 +17,7 @@ class ExportJob implements ShouldQueue
     use InteractsWithQueue;
     use Queueable;
     use SerializesModels;
-
-    private string $fileName;
-
-    private PowerGridComponent $componentTable;
-
-    private array $columns;
-
-    private string $type;
-
-    private int $offset;
-
-    private int $limit;
+    use ExportableJob;
 
     /**
      * @param string $componentTable
@@ -59,25 +47,8 @@ public function handle()
             ->get();
 
         return (new $this->type())
-            ->fileName(
-                Str::of($this->fileName)
-                ->replace('.xlsx', '')
-                ->replace('.csv', '')
-            )
+            ->fileName($this->getFilename())
             ->setData($this->columns, $this->transform($query))
             ->store();
     }
-
-    private function transform($results)
-    {
-        return $results->transform(function ($row) {
-            $row = (object)$row;
-            $columns = $this->componentTable->addColumns()->columns;
-            foreach ($columns as $key => $column) {
-                $row->{$key} = $column($row);
-            }
-
-            return $row;
-        });
-    }
 }
diff --git a/src/Providers/PowerGridServiceProvider.php b/src/Providers/PowerGridServiceProvider.php
index 8872318b..b94df7a2 100644
--- a/src/Providers/PowerGridServiceProvider.php
+++ b/src/Providers/PowerGridServiceProvider.php
@@ -2,6 +2,7 @@
 
 namespace PowerComponents\LivewirePowerGrid\Providers;
 
+use Illuminate\Filesystem\Filesystem;
 use Illuminate\Support\Facades\Blade;
 use Illuminate\Support\ServiceProvider;
 use PowerComponents\LivewirePowerGrid\Commands\CreateCommand;
@@ -20,8 +21,8 @@ public function boot()
             $this->commands([DemoCommand::class]);
         }
 
-        $this->loadViews();
-        $this->loadConfigs();
+        $this->publishViews();
+        $this->publishConfigs();
         $this->loadTranslationsFrom(__DIR__ . '/../../resources/lang', 'livewire-powergrid');
         $this->createDirectives();
     }
@@ -42,11 +43,24 @@ public function register()
         $this->app->alias(ThemeManager::class, 'theme');
     }
 
-    private function loadViews()
+    private function publishViews()
     {
         $this->loadViewsFrom(__DIR__ . '/../../resources/views', 'livewire-powergrid');
 
-        $this->publishes([__DIR__ . '/../../resources/views' => resource_path('views/vendor/livewire-powergrid')], 'livewire-powergrid-views');
+        $this->publishes([
+            __DIR__ . '/../../resources/views' => resource_path('views/vendor/livewire-powergrid'),
+        ], 'livewire-powergrid-views');
+    }
+
+    private function publishConfigs()
+    {
+        $this->publishes([
+            __DIR__ . '/../../resources/config/livewire-powergrid.php' => config_path('livewire-powergrid.php'),
+        ], 'livewire-powergrid-config');
+
+        $this->publishes([
+            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/livewire-powergrid'),
+        ], 'livewire-powergrid-lang');
     }
 
     private function createDirectives()
@@ -59,15 +73,4 @@ private function createDirectives()
             return "<?php echo view('livewire-powergrid::assets.scripts')->render(); ?>";
         });
     }
-
-    private function loadConfigs()
-    {
-        $this->publishes([
-            __DIR__ . '/../../resources/config/livewire-powergrid.php' => config_path('livewire-powergrid.php'),
-        ], 'livewire-powergrid-config');
-
-        $this->publishes([
-            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/livewire-powergrid'),
-        ], 'livewire-powergrid-lang');
-    }
 }
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 7459c31f..e59055ef 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -51,6 +51,8 @@ trait Exportable
 
     public array $exportedFiles = [];
 
+    public string $exportableJobClass = '\PowerComponents\LivewirePowerGrid\Jobs\ExportJob';
+
     /**
      * @param string $fileName
      * @param array|string[] $type
@@ -230,7 +232,7 @@ public function createQueues(string $type): Collection
                 'limit'    => $limit,
             ];
 
-            $queues->push(new ExportJob(
+            $queues->push(new $this->exportableJobClass(
                 get_called_class(),
                 $this->columns(),
                 $params,
diff --git a/src/Traits/ExportableJob.php b/src/Traits/ExportableJob.php
new file mode 100644
index 00000000..e345a428
--- /dev/null
+++ b/src/Traits/ExportableJob.php
@@ -0,0 +1,42 @@
+<?php
+
+namespace PowerComponents\LivewirePowerGrid\Traits;
+
+use Illuminate\Support\Str;
+use Illuminate\Support\Stringable;
+use PowerComponents\LivewirePowerGrid\PowerGridComponent;
+
+trait ExportableJob
+{
+    private string $fileName;
+
+    private PowerGridComponent $componentTable;
+
+    private array $columns;
+
+    private string $type;
+
+    private int $offset;
+
+    private int $limit;
+
+    private function getFilename(): Stringable
+    {
+        return Str::of($this->fileName)
+            ->replace('.xlsx', '')
+            ->replace('.csv', '');
+    }
+
+    private function transform($results)
+    {
+        return $results->transform(function ($row) {
+            $row = (object)$row;
+            $columns = $this->componentTable->addColumns()->columns;
+            foreach ($columns as $key => $column) {
+                $row->{$key} = $column($row);
+            }
+
+            return $row;
+        });
+    }
+}

From 4582c75872888a4d00d8e3f903eae67e92b19e62 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 23 Oct 2021 10:03:20 -0300
Subject: [PATCH 11/34] add queue for bootstrap5

---
 tests/Feature/FilterSelectTest.php | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/tests/Feature/FilterSelectTest.php b/tests/Feature/FilterSelectTest.php
index 1c9aedc9..b5d848b1 100644
--- a/tests/Feature/FilterSelectTest.php
+++ b/tests/Feature/FilterSelectTest.php
@@ -9,11 +9,8 @@
         ->assertSeeHtmlInOrder([
             'wire:input.debounce.500ms="filterSelect(\'category_id\',\'Categoria\')"',
             'wire:model.debounce.500ms="filters.select.category_id"',
-            '<option value="">All</option>',
-            '<option value="">Carnes</option>',
-            '<option value="">Peixe</option>',
         ]);
-})->skip();
+});
 
 it('properly filter with category_id', function () {
     livewire(DishesTable::class)

From e451c99197bee75217243e8de7283b2fbc991c50 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 23 Oct 2021 10:53:46 -0300
Subject: [PATCH 12/34] fix editable bug issue 50

---
 resources/views/components/editable.blade.php | 40 ++++++++++++-------
 1 file changed, 26 insertions(+), 14 deletions(-)

diff --git a/resources/views/components/editable.blade.php b/resources/views/components/editable.blade.php
index e1aa9623..8cb494bc 100644
--- a/resources/views/components/editable.blade.php
+++ b/resources/views/components/editable.blade.php
@@ -4,22 +4,34 @@
     'field' => null,
     'theme' => null
 ])
-<div x-data="{ value: '<span style=\'border-bottom: dotted 1px;\'>{{ addslashes($row->{$field}) }}</span>' }">
-    <button
-        style="width: 100%;{{ $theme->buttonClass }}"
-        x-on:click="value = editableInput({{ $row->{$primaryKey} }}, '{{ addslashes($row->{$field})  }}', '{{ $field }}');"
-        x-html="value"
-    ></button>
-</div>
-<script>
-
-    function editableInput(id, value, field) {
-        document.getElementsByClassName('message')[0].style.display = "none";
 
-        return '<input @keydown.enter=sendEventInputChanged($event,' + id + ',"' + field + '") value="' + value + '" ' +
-            'class="{{ $theme->inputClass }}">';
-    }
+<div x-data="{
+       editable: false,
+       id: '{{ $row->{$primaryKey} }}',
+       field: '{{ $field }}',
+       content: '{{ addslashes($row->{$field}) }}'
+    }">
+    <div x-text="content"
+         style="border-bottom: dotted 1px; cursor: pointer"
+         x-show="!editable"
+         x-on:dblclick="editable = true"
+    ></div>
+    <div x-cloak
+         x-show="editable">
+        <input
+            type="text"
+            x-on:dblclick="editable = true"
+            x-on:keydown.enter="sendEventInputChanged($event, id, field); editable = false; content = $event.target.value"
+            x-on:blur="editable = false"
+            :class="{'cursor-pointer': !editable}"
+            class="{{ $theme->inputClass }}"
+            x-ref="editable"
+            x-text="content"
+            :value="content">
+    </div>
+</div>
 
+<script>
     function sendEventInputChanged(event, id, field) {
         document.getElementsByClassName('message')[0].style.display = "none";
         window.livewire.emit('eventInputChanged', {

From d676d766d9a54d0bed72a93f6153761431e7bd1d Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 23 Oct 2021 18:29:14 -0300
Subject: [PATCH 13/34] fix export dropdown

---
 .../frameworks/bootstrap5/header.blade.php    | 10 ++--
 .../frameworks/tailwind/export.blade.php      | 18 ++----
 .../frameworks/tailwind/header.blade.php      |  6 +-
 src/Jobs/ExportJob.php                        | 13 ++--
 src/Traits/Exportable.php                     | 60 +++++++++++--------
 src/Traits/ExportableJob.php                  |  6 +-
 6 files changed, 61 insertions(+), 52 deletions(-)

diff --git a/resources/views/components/frameworks/bootstrap5/header.blade.php b/resources/views/components/frameworks/bootstrap5/header.blade.php
index 2e3063c4..726ca5e3 100644
--- a/resources/views/components/frameworks/bootstrap5/header.blade.php
+++ b/resources/views/components/frameworks/bootstrap5/header.blade.php
@@ -24,15 +24,15 @@
 
 @if($queues && $showExporting)
 
-    @if($exporting && !$exportFinished)
+    @if($batchExporting && !$batchFinished)
         <div wire:poll="updateExportProgress"
              class="my-3 px-4 rounded-md py-3 shadow-sm text-center">
-            <div>{{ $progress }}%</div>
+            <div>{{ $batchProgress }}%</div>
             <div>{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
         </div>
     @endif
 
-    @if($exportFinished)
+    @if($batchFinished)
         <div class="my-3">
             <p>
                 <button class="btn btn-primary"
@@ -50,8 +50,8 @@ class="my-3 px-4 rounded-md py-3 shadow-sm text-center">
                         <div class="d-flex w-full p-2" style="cursor:pointer">
                             <x-livewire-powergrid::icons.download
                                 style="width: 1.5rem;
-                                       margin-right: 6px;
-                                       color: #2d3034;"/>
+                                           margin-right: 6px;
+                                           color: #2d3034;"/>
                             <a
                                 wire:click="downloadExport('{{ $file }}')">
                                 {{ $file }}
diff --git a/resources/views/components/frameworks/tailwind/export.blade.php b/resources/views/components/frameworks/tailwind/export.blade.php
index 73065a85..b8cc83be 100644
--- a/resources/views/components/frameworks/tailwind/export.blade.php
+++ b/resources/views/components/frameworks/tailwind/export.blade.php
@@ -1,4 +1,5 @@
-<div x-data="toggle()" x-cloak
+<div x-data="{ open: false }"
+     x-cloak
      @click.away="open = false">
     <button @click.prevent="open = ! open"
             class="block bg-white-200 text-gray-700 border border-gray-300 rounded py-1.5 px-3 leading-tight focus:outline-none focus:bg-white focus:border-gray-600 dark:border-gray-500 dark:bg-gray-500 2xl:dark:placeholder-gray-300 dark:text-gray-200 dark:text-gray-300">
@@ -19,11 +20,11 @@ class="mt-2 w-auto bg-white shadow-xl absolute z-10 dark:bg-gray-500">
         @if(in_array('excel',$exportType))
             <div class="flex px-4 py-2 text-gray-400 dark:text-gray-300">
                 <span class="w-12">Excel</span>
-                <a wire:click="exportToXLS()" href="#"
+                <a x-on:click="$wire.call('exportToXLS'); open = false" href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.all')
                 </a>
-                <a wire:click="exportToXLS(true)" href="#"
+                <a x-on:click="$wire.call('exportToXLS', true); open = false" href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.selected')
                 </a>
@@ -32,11 +33,11 @@ class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text
         @if(in_array('csv',$exportType))
             <div class="flex px-4 py-2 text-gray-400 dark:text-gray-300">
                 <span class="w-12">Csv</span>
-                <a wire:click="exportToCsv()" href="#"
+                <a x-on:click="$wire.call('exportToCsv'); open = false" href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.all')
                 </a>
-                <a wire:click="exportToCsv(true)" href="#"
+                <a x-on:click="$wire.call('exportToCsv', true); open = false" href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.selected')
                 </a>
@@ -44,10 +45,3 @@ class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text
         @endif
     </div>
 </div>
-<script>
-    function toggle() {
-        return {
-            open: false,
-        }
-    }
-</script>
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 0fd2b851..3fe73a00 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -31,15 +31,15 @@
 
 @if($queues && $showExporting)
 
-    @if($exporting && !$exportFinished)
+    @if($batchExporting && !$batchFinished)
         <div wire:poll="updateExportProgress"
              class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
-            <div class="dark:text-gray-300">{{ $progress }}%</div>
+            <div class="dark:text-gray-300">{{ $batchProgress }}%</div>
             <div class="dark:text-gray-300">{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
         </div>
     @endif
 
-    @if($exportFinished)
+    @if($batchFinished)
         <div class="w-full my-3 dark:bg-gray-800">
             <div x-data={show:true} class="rounded-top">
                 <div class="px-4 py-3 rounded-md cursor-pointer bg-gray-200 shadow dark:bg-gray-500"
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index 20837248..1622bc0b 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -5,9 +5,11 @@
 use Illuminate\Bus\Batchable;
 use Illuminate\Bus\Queueable;
 use Illuminate\Contracts\Queue\ShouldQueue;
+use Illuminate\Database\Eloquent\Builder;
 use Illuminate\Foundation\Bus\Dispatchable;
 use Illuminate\Queue\InteractsWithQueue;
 use Illuminate\Queue\SerializesModels;
+use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 use PowerComponents\LivewirePowerGrid\Traits\ExportableJob;
 
 class ExportJob implements ShouldQueue
@@ -26,8 +28,8 @@ class ExportJob implements ShouldQueue
      */
     public function __construct(
         string $componentTable,
-        array $columns,
-        array $params
+        array  $columns,
+        array  $params
     ) {
         $this->columns  = $columns;
         $this->type     = data_get($params, 'type');
@@ -35,14 +37,17 @@ public function __construct(
         $this->offset   = data_get($params, 'offset');
         $this->limit    = data_get($params, 'limit');
 
+        /** @var PowerGridComponent componentTable */
         $this->componentTable = new $componentTable();
     }
 
     public function handle()
     {
+        /** @var Builder $query */
         $query = $this->componentTable
-            ->datasource()
-            ->offset($this->offset)
+            ->datasource();
+
+        $query = $query->offset($this->offset)
             ->limit($this->limit)
             ->get();
 
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index e59055ef..4cfca6a9 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -27,9 +27,9 @@ trait Exportable
 
     public array $exportType = [];
 
-    public bool $exporting = false;
+    public bool $batchExporting = false;
 
-    public bool $exportFinished = false;
+    public bool $batchFinished = false;
 
     public string $batchId = '';
 
@@ -47,11 +47,13 @@ trait Exportable
 
     public bool $showExporting = true;
 
-    public int $progress = 0;
+    public int $batchProgress = 0;
 
     public array $exportedFiles = [];
 
-    public string $exportableJobClass = '\PowerComponents\LivewirePowerGrid\Jobs\ExportJob';
+    public string $exportableJobClass = ExportJob::class;
+
+    public bool $batchErrors = false;
 
     /**
      * @param string $fileName
@@ -105,14 +107,14 @@ public function prepareToExport(bool $selected = false)
      */
     public function exportToXLS(bool $selected = false)
     {
-        $this->runOnQueue(ExportToXLS::class);
-
-        if ($this->queues === 0) {
-            return (new ExportToXLS())
-                ->fileName($this->exportFileName)
-                ->setData($this->columns(), $this->prepareToExport($selected))
-                ->download();
+        if ($this->queues > 0 && !$selected) {
+            return $this->runOnQueue(ExportToXLS::class);
         }
+
+        return (new ExportToXLS())
+            ->fileName($this->exportFileName)
+            ->setData($this->columns(), $this->prepareToExport($selected))
+            ->download();
     }
 
     /**
@@ -120,14 +122,14 @@ public function exportToXLS(bool $selected = false)
      */
     public function exportToCsv(bool $selected = false)
     {
-        $this->runOnQueue(ExportToCsv::class);
-
-        if ($this->queues === 0) {
-            return (new ExportToCsv())
-                ->fileName($this->exportFileName)
-                ->setData($this->columns(), $this->prepareToExport($selected))
-                ->download();
+        if ($this->queues > 0 && !$selected) {
+            return $this->runOnQueue(ExportToCsv::class);
         }
+
+        return (new ExportToCsv())
+            ->fileName($this->exportFileName)
+            ->setData($this->columns(), $this->prepareToExport($selected))
+            ->download();
     }
 
     public function getExportBatchProperty(): ?Batch
@@ -142,10 +144,12 @@ public function getExportBatchProperty(): ?Batch
     public function updateExportProgress()
     {
         if (!is_null($this->exportBatch)) {
-            $this->exportFinished = $this->exportBatch->finished();
-            $this->progress       = $this->exportBatch->progress();
-            if ($this->exportFinished) {
-                $this->exporting = false;
+            $this->batchFinished     = $this->exportBatch->finished();
+            $this->batchProgress     = $this->exportBatch->progress();
+            $this->batchErrors       = $this->exportBatch->hasFailures();
+
+            if ($this->batchFinished) {
+                $this->batchExporting = false;
             }
 
             $this->onBatchExecuting($this->exportBatch);
@@ -176,11 +180,11 @@ public function onBatchFinally(Batch $batch)
     /**
      * @throws \Throwable
      */
-    public function runOnQueue(string $type)
+    public function runOnQueue(string $type): bool
     {
         if ($this->queues) {
-            $this->exporting      = true;
-            $this->exportFinished = false;
+            $this->batchExporting = true;
+            $this->batchFinished  = false;
 
             $queues = $this->createQueues($type);
 
@@ -223,7 +227,11 @@ public function createQueues(string $type): Collection
         }
 
         for ($i = 1; $i < ($this->queues + 1); $i++) {
-            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) . '-' . ($offset + 1) . '-' . $limit . '-' . $this->id . '.' . $this->extension;
+            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) .
+                '-' . ($offset + 1) .
+                '-' . $limit .
+                '-' . $this->id .
+                '.' . $this->extension;
 
             $params = [
                 'type'     => $type,
diff --git a/src/Traits/ExportableJob.php b/src/Traits/ExportableJob.php
index e345a428..7cbb54d9 100644
--- a/src/Traits/ExportableJob.php
+++ b/src/Traits/ExportableJob.php
@@ -2,6 +2,8 @@
 
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
+use Illuminate\Database\Eloquent\Builder;
+use Illuminate\Database\Eloquent\Collection;
 use Illuminate\Support\Str;
 use Illuminate\Support\Stringable;
 use PowerComponents\LivewirePowerGrid\PowerGridComponent;
@@ -27,9 +29,9 @@ private function getFilename(): Stringable
             ->replace('.csv', '');
     }
 
-    private function transform($results)
+    private function transform(Collection $query)
     {
-        return $results->transform(function ($row) {
+        return $query->transform(function ($row) {
             $row = (object)$row;
             $columns = $this->componentTable->addColumns()->columns;
             foreach ($columns as $key => $column) {

From a6c5acbf1062df950d1c0f344a065af6fe6cd12b Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 10:17:51 -0300
Subject: [PATCH 14/34] wip

---
 resources/views/components/editable.blade.php               | 4 ++--
 .../views/components/frameworks/tailwind/export.blade.php   | 6 ++++--
 .../views/components/frameworks/tailwind/header.blade.php   | 4 ++--
 3 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/resources/views/components/editable.blade.php b/resources/views/components/editable.blade.php
index 8cb494bc..dc274c05 100644
--- a/resources/views/components/editable.blade.php
+++ b/resources/views/components/editable.blade.php
@@ -22,9 +22,9 @@
             type="text"
             x-on:dblclick="editable = true"
             x-on:keydown.enter="sendEventInputChanged($event, id, field); editable = false; content = $event.target.value"
-            x-on:blur="editable = false"
+            x-on:blur="sendEventInputChanged($event, id, field); editable = false; content = $event.target.value"
             :class="{'cursor-pointer': !editable}"
-            class="{{ $theme->inputClass }}"
+            class="{{ $theme->inputClass }} p-2"
             x-ref="editable"
             x-text="content"
             :value="content">
diff --git a/resources/views/components/frameworks/tailwind/export.blade.php b/resources/views/components/frameworks/tailwind/export.blade.php
index b8cc83be..edf77283 100644
--- a/resources/views/components/frameworks/tailwind/export.blade.php
+++ b/resources/views/components/frameworks/tailwind/export.blade.php
@@ -20,11 +20,13 @@ class="mt-2 w-auto bg-white shadow-xl absolute z-10 dark:bg-gray-500">
         @if(in_array('excel',$exportType))
             <div class="flex px-4 py-2 text-gray-400 dark:text-gray-300">
                 <span class="w-12">Excel</span>
-                <a x-on:click="$wire.call('exportToXLS'); open = false" href="#"
+                <a x-on:click="$wire.call('exportToXLS'); open = false"
+                   href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.all')
                 </a>
-                <a x-on:click="$wire.call('exportToXLS', true); open = false" href="#"
+                <a x-on:click="$wire.call('exportToXLS', true); open = false"
+                   href="#"
                    class="px-2 block text-gray-800 hover:bg-gray-100 hover:text-black-300 dark:text-gray-200 dark:hover:bg-gray-700 rounded">
                     @lang('livewire-powergrid::datatable.labels.selected')
                 </a>
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 3fe73a00..336c360e 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -2,7 +2,7 @@
 
     <div class="md:flex md:flex-row w-full">
 
-        <div class="">
+        <div>
             <x-livewire-powergrid::actions
                 :theme="$theme"
                 row=""
@@ -21,7 +21,7 @@
 
         </div>
 
-        @include($theme->base. ''.$theme->name.'.loading')
+        @includeIf(!$batchExporting, $theme->base. ''.$theme->name.'.loading')
 
     </div>
 

From 88f750d7faecf08a799b75033989e73592950dd9 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 10:57:24 -0300
Subject: [PATCH 15/34] refatoring blade

---
 resources/views/assets/styles.blade.php       |  2 +-
 resources/views/components/cols.blade.php     |  6 +-
 .../bootstrap5/batch-exporting.blade.php      | 41 +++++++++++
 .../bootstrap5/enabled-filters.blade.php      | 14 ++++
 .../frameworks/bootstrap5/footer.blade.php    |  2 +-
 .../frameworks/bootstrap5/header.blade.php    | 66 ++---------------
 .../tailwind/batch-exporting.blade.php        | 42 +++++++++++
 .../tailwind/enabled-filters.blade.php        | 19 +++++
 .../frameworks/tailwind/footer.blade.php      |  2 +-
 .../frameworks/tailwind/header.blade.php      | 70 ++-----------------
 .../views/components/table-base.blade.php     |  9 ++-
 resources/views/components/table.blade.php    | 10 ++-
 src/Themes/Bootstrap5.php                     |  8 +--
 src/Themes/Tailwind.php                       |  6 +-
 src/Themes/ThemeBase.php                      | 14 ++--
 15 files changed, 163 insertions(+), 148 deletions(-)
 create mode 100644 resources/views/components/frameworks/bootstrap5/batch-exporting.blade.php
 create mode 100644 resources/views/components/frameworks/bootstrap5/enabled-filters.blade.php
 create mode 100644 resources/views/components/frameworks/tailwind/batch-exporting.blade.php
 create mode 100644 resources/views/components/frameworks/tailwind/enabled-filters.blade.php

diff --git a/resources/views/assets/styles.blade.php b/resources/views/assets/styles.blade.php
index 77f484c7..809863d8 100644
--- a/resources/views/assets/styles.blade.php
+++ b/resources/views/assets/styles.blade.php
@@ -7,6 +7,6 @@
     table{width:100%}.table .checkbox-column{width:50px!important;max-width:50px!important;text-align:center}.form-control:disabled,.form-control[readonly]{opacity:1;background-color:#f8f9fa;border-color:#f8f9fa}.accordion-button{padding:.7rem .7rem}.btn-light,.has-search .form-control{padding-left:2.375rem}.has-search .form-control-feedback{position:absolute;z-index:2;display:block;width:2.375rem;height:2.375rem;line-height:2.375rem;text-align:center;pointer-events:none;color:#aaa}.new-control{position:relative;display:-ms-inline-flexbox;display:inline-flex;padding-left:1.5rem;margin-right:1rem;font-weight:100;font-size:14px}.page-link{@apply block bg-white text-blue-800 border-r border-gray-200 outline-none py-2 w-12 text-sm text-center}.page-link:last-child{@apply border-0}.page-link:hover{@apply bg-blue-700 text-white border-blue-700}.page-item.active .page-link{@apply bg-blue-700 text-white border-blue-700}.page-item.disabled .page-link{@apply bg-white text-gray-300 border-gray-200}.livewire-powergrid{background-color:#e5e7eb;border-color:#f3f4f6;color:#374151;border-radius:4px}.page-link{color:gray!important}.page-item.active .page-link{color:#fff!important;background-color:gray;border-color:gray}.loader{border-top-color:#222;-webkit-animation:spinner 1.5s linear infinite;animation:spinner 1.5s linear infinite}@-webkit-keyframes spinner{0%{-webkit-transform:rotate(0)}100%{-webkit-transform:rotate(360deg)}}@keyframes spinner{0%{transform:rotate(0)}100%{transform:rotate(360deg)}}table thead{padding-left:15px;text-transform:uppercase;font-size:.75rem;color:#6b6a6a;padding-top:8px;padding-bottom:8px}.dropdown-toggle{background:#fff!important;padding-left:10px!important;color:#7a7e82!important}select, .power_grid {opacity: 1 !important;text-transform: uppercase !important;font-size: 0.85rem !important;padding-left: 10px!important;}.badge{font-size: 0.77em;}
 </style>
 
-@includeIf(powerGridThemeRoot()."styles")
+@includeIf(powerGridThemeRoot().".styles")
 
 @stack('power_grid_styles')
diff --git a/resources/views/components/cols.blade.php b/resources/views/components/cols.blade.php
index 7cc9ca26..ddd973fb 100644
--- a/resources/views/components/cols.blade.php
+++ b/resources/views/components/cols.blade.php
@@ -4,10 +4,10 @@
     'sortField' => null,
     'sortDirection' => null,
     'enabledFilters' => null,
-    'actions' => null
+    'actions' => null,
+    'dataField' => null,
 ])
 <div>
-
     @if($column->hidden === false)
         <th class="{{ $theme->table->thClass .' '. $column->headerClass }}"
             style="width: max-content;@if($column->sortable)cursor:pointer; @endif{{ $theme->table->thStyle.' '. $column->headerStyle }}">
@@ -25,7 +25,7 @@
                 @endif
                 <span
                     @if($column->sortable === true)
-                    wire:click="sortBy('{{$column->field}}')"
+                    wire:click="sortBy('{{ $column->dataField ?? $column->field }}')"
                     @endif
                 >
                     {{$column->title}}
diff --git a/resources/views/components/frameworks/bootstrap5/batch-exporting.blade.php b/resources/views/components/frameworks/bootstrap5/batch-exporting.blade.php
new file mode 100644
index 00000000..8c4f7703
--- /dev/null
+++ b/resources/views/components/frameworks/bootstrap5/batch-exporting.blade.php
@@ -0,0 +1,41 @@
+@if($queues && $showExporting)
+
+    @if($batchExporting && !$batchFinished)
+        <div wire:poll="updateExportProgress"
+             class="my-3 px-4 rounded-md py-3 shadow-sm text-center">
+            <div>{{ $batchProgress }}%</div>
+            <div>{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
+        </div>
+    @endif
+
+    @if($batchFinished)
+        <div class="my-3">
+            <p>
+                <button class="btn btn-primary"
+                        type="button"
+                        data-bs-toggle="collapse"
+                        data-bs-target="#collapseCompleted"
+                        aria-expanded="false"
+                        aria-controls="collapseCompleted">
+                    ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
+                </button>
+            </p>
+            <div class="collapse" id="collapseCompleted">
+                <div class="card card-body">
+                    @foreach($exportedFiles as $file)
+                        <div class="d-flex w-full p-2" style="cursor:pointer">
+                            <x-livewire-powergrid::icons.download
+                                style="width: 1.5rem;
+                                           margin-right: 6px;
+                                           color: #2d3034;"/>
+                            <a
+                                wire:click="downloadExport('{{ $file }}')">
+                                {{ $file }}
+                            </a>
+                        </div>
+                    @endforeach
+                </div>
+            </div>
+        </div>
+    @endif
+@endif
diff --git a/resources/views/components/frameworks/bootstrap5/enabled-filters.blade.php b/resources/views/components/frameworks/bootstrap5/enabled-filters.blade.php
new file mode 100644
index 00000000..d00232e5
--- /dev/null
+++ b/resources/views/components/frameworks/bootstrap5/enabled-filters.blade.php
@@ -0,0 +1,14 @@
+@if(count($enabledFilters))
+    <div class="col-md-12 d-flex" style="margin-top: 5px">
+        @foreach($enabledFilters as $field => $filter)
+            <div wire:click.prevent="clearFilter('{{ $field }}')"
+                 style="cursor: pointer; padding-right: 4px">
+            <span class="badge rounded-pill bg-light text-dark">{{ $filter['label'] }}
+                 <svg width="10" stroke="currentColor" fill="none" viewBox="0 0 8 8">
+                    <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
+                </svg>
+            </span>
+            </div>
+        @endforeach
+    </div>
+@endif
diff --git a/resources/views/components/frameworks/bootstrap5/footer.blade.php b/resources/views/components/frameworks/bootstrap5/footer.blade.php
index b0389247..41bbcd53 100644
--- a/resources/views/components/frameworks/bootstrap5/footer.blade.php
+++ b/resources/views/components/frameworks/bootstrap5/footer.blade.php
@@ -22,7 +22,7 @@
             </div>
         @endif
         <div>
-            {!! $data->links($theme->base. ''.$theme->name.'.pagination') !!}
+            {!! $data->links(powerGridThemeRoot().'.pagination') !!}
         </div>
     </div>
 @endif
diff --git a/resources/views/components/frameworks/bootstrap5/header.blade.php b/resources/views/components/frameworks/bootstrap5/header.blade.php
index 726ca5e3..c6f9af8f 100644
--- a/resources/views/components/frameworks/bootstrap5/header.blade.php
+++ b/resources/views/components/frameworks/bootstrap5/header.blade.php
@@ -3,78 +3,26 @@
 
         <div class="col-12 col-sm-6 d-flex justify-content-sm-start justify-content-center">
 
-            @if($exportOption)
-                @include($theme->base. ''.$theme->name.'.export')
-            @endif
+            @includeIf($exportOption, powerGridThemeRoot().'.export')
 
-            @includeIf($theme->base. ''.$theme->name.'.toggle-columns')
+            @includeIf(powerGridThemeRoot().'.toggle-columns')
 
-            @include('livewire-powergrid::components.frameworks.bootstrap5.loading')
+            @include(powerGridThemeRoot().'.loading')
 
         </div>
         <div class="col-12 col-sm-6 d-flex justify-content-sm-end justify-content-center mt-sm-0 mt-3">
 
-            @include($theme->base. ''.$theme->name.'.filter')
+            @include(powerGridThemeRoot().'.filter')
 
         </div>
 
     </div>
 </div>
 
+@include(powerGridThemeRoot().'.batch-exporting')
+
+@include(powerGridThemeRoot().'.enabled-filters')
 
-@if($queues && $showExporting)
 
-    @if($batchExporting && !$batchFinished)
-        <div wire:poll="updateExportProgress"
-             class="my-3 px-4 rounded-md py-3 shadow-sm text-center">
-            <div>{{ $batchProgress }}%</div>
-            <div>{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
-        </div>
-    @endif
 
-    @if($batchFinished)
-        <div class="my-3">
-            <p>
-                <button class="btn btn-primary"
-                        type="button"
-                        data-bs-toggle="collapse"
-                        data-bs-target="#collapseCompleted"
-                        aria-expanded="false"
-                        aria-controls="collapseCompleted">
-                    ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
-                </button>
-            </p>
-            <div class="collapse" id="collapseCompleted">
-                <div class="card card-body">
-                    @foreach($exportedFiles as $file)
-                        <div class="d-flex w-full p-2" style="cursor:pointer">
-                            <x-livewire-powergrid::icons.download
-                                style="width: 1.5rem;
-                                           margin-right: 6px;
-                                           color: #2d3034;"/>
-                            <a
-                                wire:click="downloadExport('{{ $file }}')">
-                                {{ $file }}
-                            </a>
-                        </div>
-                    @endforeach
-                </div>
-            </div>
-        </div>
-    @endif
-@endif
 
-@if(count($enabledFilters))
-    <div class="col-md-12 d-flex" style="margin-top: 5px">
-        @foreach($enabledFilters as $field => $filter)
-            <div wire:click.prevent="clearFilter('{{ $field }}')"
-                 style="cursor: pointer; padding-right: 4px">
-            <span class="badge rounded-pill bg-light text-dark">{{ $filter['label'] }}
-                 <svg width="10" stroke="currentColor" fill="none" viewBox="0 0 8 8">
-                    <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
-                </svg>
-            </span>
-            </div>
-        @endforeach
-    </div>
-@endif
diff --git a/resources/views/components/frameworks/tailwind/batch-exporting.blade.php b/resources/views/components/frameworks/tailwind/batch-exporting.blade.php
new file mode 100644
index 00000000..ecfc863f
--- /dev/null
+++ b/resources/views/components/frameworks/tailwind/batch-exporting.blade.php
@@ -0,0 +1,42 @@
+@if($queues && $showExporting)
+
+    @if($batchExporting && !$batchFinished)
+        <div wire:poll="updateExportProgress"
+             class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
+            <div class="dark:text-gray-300">{{ $batchProgress }}%</div>
+            <div class="dark:text-gray-300">{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
+        </div>
+    @endif
+
+    @if($batchFinished)
+        <div class="w-full my-3 dark:bg-gray-800">
+            <div x-data={show:true} class="rounded-top">
+                <div class="px-4 py-3 rounded-md cursor-pointer bg-gray-200 shadow dark:bg-gray-500"
+                     @click="show=!show">
+                    <div class="flex justify-between">
+                        <button
+                            class="appearance-none text-left text-base font-medium text-gray-500 focus:outline-none dark:text-gray-300"
+                            type="button">
+                            ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
+                        </button>
+                        <x-livewire-powergrid::icons.chevron-double-down class="w-5 dark:text-gray-200"/>
+                    </div>
+                </div>
+                <div x-show="show"
+                     class="border-l border-b border-r border-gray-200 dark:border-gray-600 px-2 py-4 dark:border-0 dark:bg-gray-700">
+                    @foreach($exportedFiles as $file)
+                        <div class="flex w-full p-2">
+                            <x-livewire-powergrid::icons.download
+                                class="w-5 text-gray-700 dark:text-gray-300 mr-3"/>
+                            <a class="cursor-pointer text-gray-600 dark:text-gray-300"
+                               wire:click="downloadExport('{{ $file }}')">
+                                {{ $file }}
+                            </a>
+                        </div>
+                    @endforeach
+                </div>
+            </div>
+        </div>
+    @endif
+
+@endif
diff --git a/resources/views/components/frameworks/tailwind/enabled-filters.blade.php b/resources/views/components/frameworks/tailwind/enabled-filters.blade.php
new file mode 100644
index 00000000..8c09fe53
--- /dev/null
+++ b/resources/views/components/frameworks/tailwind/enabled-filters.blade.php
@@ -0,0 +1,19 @@
+@if(count($enabledFilters))
+    <div class="w-full pt-3 mb-3">
+        @foreach($enabledFilters as $field => $filter)
+            <span
+                class="cursor-pointer inline-flex rounded-full items-center py-0.5 pl-2.5 pr-1 text-sm font-medium bg-indigo-100 text-indigo-700">
+              {{ $filter['label'] }}
+              <button type="button"
+                      wire:click.prevent="clearFilter('{{ $field }}')"
+                      class="flex-shrink-0 ml-0.5 h-4 w-4 rounded-full inline-flex items-center justify-center text-indigo-400 hover:bg-indigo-200 hover:text-indigo-500 focus:outline-none focus:bg-indigo-500 focus:text-white">
+                <span class="sr-only"{{ $filter['label'] }}></span>
+                <svg class="h-2 w-2" stroke="currentColor" fill="none" viewBox="0 0 8 8">
+                  <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
+                </svg>
+              </button>
+        </span>
+
+        @endforeach
+    </div>
+@endif
diff --git a/resources/views/components/frameworks/tailwind/footer.blade.php b/resources/views/components/frameworks/tailwind/footer.blade.php
index e1521260..aceeff30 100644
--- a/resources/views/components/frameworks/tailwind/footer.blade.php
+++ b/resources/views/components/frameworks/tailwind/footer.blade.php
@@ -32,7 +32,7 @@ class="block appearance-none bg-white-200 border border-gray-300 text-gray-700 p
     @if(filled($data))
         <div>
             @if(method_exists($data, 'links'))
-                {!! $data->links($theme->base. ''.$theme->name.'.pagination', ['recordCount' => $recordCount]) !!}
+                {!! $data->links(powerGridThemeRoot().'.pagination', ['recordCount' => $recordCount]) !!}
             @endif
         </div>
     @endif
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 336c360e..b0a1ea2a 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -13,81 +13,23 @@
 
             @if($exportOption)
                 <div class="mr-2 mt-2 sm:mt-0">
-                    @includeIf($theme->base. ''.$theme->name.'.export')
+                    @includeIf(powerGridThemeRoot().'.export')
                 </div>
             @endif
 
-            @includeIf($theme->base. ''.$theme->name.'.toggle-columns')
+            @includeIf(powerGridThemeRoot().'.toggle-columns')
 
         </div>
 
-        @includeIf(!$batchExporting, $theme->base. ''.$theme->name.'.loading')
+        @includeIf(!$batchExporting, powerGridThemeRoot().'.loading')
 
     </div>
 
-    @include($theme->base. ''.$theme->name.'.search')
+    @include(powerGridThemeRoot().'.search')
 
 </div>
 
-@if($queues && $showExporting)
+@include(powerGridThemeRoot().'.batch-exporting')
 
-    @if($batchExporting && !$batchFinished)
-        <div wire:poll="updateExportProgress"
-             class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
-            <div class="dark:text-gray-300">{{ $batchProgress }}%</div>
-            <div class="dark:text-gray-300">{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
-        </div>
-    @endif
-
-    @if($batchFinished)
-        <div class="w-full my-3 dark:bg-gray-800">
-            <div x-data={show:true} class="rounded-top">
-                <div class="px-4 py-3 rounded-md cursor-pointer bg-gray-200 shadow dark:bg-gray-500"
-                     @click="show=!show">
-                    <div class="flex justify-between">
-                        <button
-                            class="appearance-none text-left text-base font-medium text-gray-500 focus:outline-none dark:text-gray-300"
-                            type="button">
-                            ⚡ {{ trans('livewire-powergrid::datatable.export.completed') }}
-                        </button>
-                        <x-livewire-powergrid::icons.chevron-double-down class="w-5 dark:text-gray-200"/>
-                    </div>
-                </div>
-                <div x-show="show"
-                     class="border-l border-b border-r border-gray-200 dark:border-gray-600 px-2 py-4 dark:border-0 dark:bg-gray-700">
-                    @foreach($exportedFiles as $file)
-                        <div class="flex w-full p-2">
-                            <x-livewire-powergrid::icons.download
-                                class="w-5 text-gray-700 dark:text-gray-300 mr-3"/>
-                            <a class="cursor-pointer text-gray-600 dark:text-gray-300"
-                               wire:click="downloadExport('{{ $file }}')">
-                                {{ $file }}
-                            </a>
-                        </div>
-                    @endforeach
-                </div>
-            </div>
-        </div>
-    @endif
-
-@endif
+@include(powerGridThemeRoot().'.enabled-filters')
 
-@if(count($enabledFilters))
-    <div class="w-full pt-3 mb-3">
-        @foreach($enabledFilters as $field => $filter)
-            <span
-                class="cursor-pointer inline-flex rounded-full items-center py-0.5 pl-2.5 pr-1 text-sm font-medium bg-indigo-100 text-indigo-700">
-              {{ $filter['label'] }}
-              <button type="button"
-                      wire:click.prevent="clearFilter('{{ $field }}')"
-                      class="flex-shrink-0 ml-0.5 h-4 w-4 rounded-full inline-flex items-center justify-center text-indigo-400 hover:bg-indigo-200 hover:text-indigo-500 focus:outline-none focus:bg-indigo-500 focus:text-white">
-                <span class="sr-only"{{ $filter['label'] }}></span>
-                <svg class="h-2 w-2" stroke="currentColor" fill="none" viewBox="0 0 8 8">
-                  <path stroke-linecap="round" stroke-width="1.5" d="M1 1l6 6m0-6L1 7"/>
-                </svg>
-              </button>
-        </span>
-
-        @endforeach
-    </div>
-@endif
diff --git a/resources/views/components/table-base.blade.php b/resources/views/components/table-base.blade.php
index fa8498c4..f725f875 100644
--- a/resources/views/components/table-base.blade.php
+++ b/resources/views/components/table-base.blade.php
@@ -2,11 +2,14 @@
     'theme' => null
 ])
 <div>
-    <table class="{{$theme->tableClass}}" style="{{$theme->tableStyle}}">
-        <thead class="{{$theme->theadClass}}" style="{{$theme->theadStyle}}">
+    <table class="{{$theme->tableClass}}"
+           style="{{$theme->tableStyle}}">
+        <thead class="{{$theme->theadClass}}"
+               style="{{$theme->theadStyle}}">
                 {{ $header }}
         </thead>
-        <tbody class="{{$theme->tbodyClass}}" style="{{$theme->tbodyStyle}}">
+        <tbody class="{{$theme->tbodyClass}}"
+               style="{{$theme->tbodyStyle}}">
                 {{ $rows }}
         </tbody>
     </table>
diff --git a/resources/views/components/table.blade.php b/resources/views/components/table.blade.php
index f988dcbb..cb78aa8a 100644
--- a/resources/views/components/table.blade.php
+++ b/resources/views/components/table.blade.php
@@ -3,11 +3,13 @@
     <x-slot name="header">
         <tr class="{{ $theme->table->trClass }}"
             style="{{ $theme->table->trStyle }}">
+
             @if($checkbox)
             <x-livewire-powergrid::checkbox-all
                 :checkbox="$checkbox"
                 :theme="$theme->checkbox"/>
             @endif
+
             @foreach($columns as $column)
                 <x-livewire-powergrid::cols
                     :column="$column"
@@ -37,8 +39,11 @@
         />
         @if(is_null($data) || count($data) === 0)
             <th>
-                <tr class="{{ $theme->table->trBodyClass }}" style="{{ $theme->table->trBodyStyle }}">
-                    <td class="{{ $theme->table->tdBodyClass }}" style="{{ $theme->table->tdBodyStyle }}" colspan="{{ (($checkbox) ? 1:0)
+                <tr class="{{ $theme->table->trBodyClass }}"
+                    style="{{ $theme->table->trBodyStyle }}">
+                    <td class="{{ $theme->table->tdBodyClass }}"
+                        style="{{ $theme->table->tdBodyStyle }}"
+                        colspan="{{ (($checkbox) ? 1:0)
                                     + ((isset($actions)) ? 1: 0)
                                     + (count($columns))
                                     }}">
@@ -52,6 +57,7 @@
                     <tr class="{{ $theme->table->trBodyClass }}"
                         style="{{ $theme->table->trBodyStyle }}"
                         wire:key="{{ $row->id }}">
+
                         @if($checkbox)
                             <x-livewire-powergrid::checkbox-row
                                 :theme="$theme->checkbox"
diff --git a/src/Themes/Bootstrap5.php b/src/Themes/Bootstrap5.php
index babb8203..f9117d4d 100644
--- a/src/Themes/Bootstrap5.php
+++ b/src/Themes/Bootstrap5.php
@@ -32,7 +32,7 @@ public function cols(): Components\Cols
     public function footer(): Components\Footer
     {
         return Theme::footer()
-            ->view($this->root() . "footer")
+            ->view($this->root() . ".footer")
             ->select("");
     }
 
@@ -51,13 +51,13 @@ public static function styles(): string
     public function toggleable(): Components\Toggleable
     {
         return Theme::toggleable()
-            ->view($this->root() . "toggleable");
+            ->view($this->root() . ".toggleable");
     }
 
     public function editable(): Components\Editable
     {
         return Theme::editable()
-            ->view($this->root() . "editable")
+            ->view($this->root() . ".editable")
             ->span("d-flex justify-content-between")
             ->button("width: 100%;text-align: left;border: 0;padding: 4px;background: none")
             ->input("form-control");
@@ -92,7 +92,7 @@ public function filterDatePicker(): Components\FilterDatePicker
     public function filterMultiSelect(): Components\FilterMultiSelect
     {
         return Theme::filterMultiSelect()
-            ->view($this->root() . "multi-select")
+            ->view($this->root() . ".multi-select")
             ->input("")
             ->divNotInline("")
             ->divInline("");
diff --git a/src/Themes/Tailwind.php b/src/Themes/Tailwind.php
index df477825..87143d52 100644
--- a/src/Themes/Tailwind.php
+++ b/src/Themes/Tailwind.php
@@ -27,7 +27,7 @@ public function table(): ?Components\Table
     public function footer(): Components\Footer
     {
         return Theme::footer()
-            ->view($this->root() . "footer")
+            ->view($this->root() . ".footer")
             ->select("block appearance-none bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500  dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500");
     }
 
@@ -48,7 +48,7 @@ public function cols(): Cols
     public function editable(): Components\Editable
     {
         return Theme::editable()
-            ->view($this->root() . "editable")
+            ->view($this->root() . ".editable")
             ->span("flex justify-between")
             ->input("block dark:bg-gray-700 bg-green-200 text-black-700 border border-gray-200 rounded py-3 px-4 leading-tight focus:outline-none focus:bg-white focus:border-gray-500 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500");
     }
@@ -81,7 +81,7 @@ public function filterDatePicker(): Components\FilterDatePicker
     public function filterMultiSelect(): Components\FilterMultiSelect
     {
         return Theme::filterMultiSelect()
-            ->view($this->root() . "multi-select")
+            ->view($this->root() . ".multi-select")
             ->input("appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
             ->divNotInline("pt-2 p-2")
             ->divInline("pr-6");
diff --git a/src/Themes/ThemeBase.php b/src/Themes/ThemeBase.php
index 5a71ea0c..821cc6c4 100644
--- a/src/Themes/ThemeBase.php
+++ b/src/Themes/ThemeBase.php
@@ -10,23 +10,23 @@ class ThemeBase extends AbstractTheme
 
     public function root(): string
     {
-        return $this->base . "" . $this->name . ".";
+        return $this->base . "" . $this->name;
     }
 
     public function toggleable(): Components\Toggleable
     {
         return Theme::toggleable()
-            ->view($this->root() . "toggleable");
+            ->view($this->root() . ".toggleable");
     }
 
     public function layout(): Components\Layout
     {
         return Theme::layout()
-            ->table($this->root() . "table-base")
-            ->header($this->root() . "header")
-            ->pagination($this->root() . "pagination")
-            ->message($this->root() . "message")
-            ->footer($this->root() . "footer");
+            ->table($this->root() . ".table-base")
+            ->header($this->root() . ".header")
+            ->pagination($this->root() . ".pagination")
+            ->message($this->root() . ".message")
+            ->footer($this->root() . ".footer");
     }
 
     public function apply(): ThemeBase

From 5d156b80fb3addcd5e98914e218ba41a117e91bc Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 13:21:41 -0300
Subject: [PATCH 16/34] 1.4 - wip

---
 resources/views/components/actions.blade.php |  2 +-
 resources/views/components/table.blade.php   | 10 ++++++----
 src/Commands/DemoCommand.php                 |  3 +--
 src/Providers/PowerGridServiceProvider.php   | 19 ++++++++++---------
 4 files changed, 18 insertions(+), 16 deletions(-)

diff --git a/resources/views/components/actions.blade.php b/resources/views/components/actions.blade.php
index f92475c7..a6e5a77b 100644
--- a/resources/views/components/actions.blade.php
+++ b/resources/views/components/actions.blade.php
@@ -27,7 +27,7 @@ class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnCl
                             {!! $action->caption !!}
                         </a>
                     @else
-                        @if(strtolower($action->method) !== ('get'))
+                        @if(strtolower($action->method) !== 'get')
                             <form target="{{ $action->target }}"
                                   action="{{ route($action->route, $parameters) }}"
                                   method="{{ $action->target }}">
diff --git a/resources/views/components/table.blade.php b/resources/views/components/table.blade.php
index cb78aa8a..e7c72b26 100644
--- a/resources/views/components/table.blade.php
+++ b/resources/views/components/table.blade.php
@@ -5,9 +5,9 @@
             style="{{ $theme->table->trStyle }}">
 
             @if($checkbox)
-            <x-livewire-powergrid::checkbox-all
-                :checkbox="$checkbox"
-                :theme="$theme->checkbox"/>
+                <x-livewire-powergrid::checkbox-all
+                    :checkbox="$checkbox"
+                    :theme="$theme->checkbox"/>
             @endif
 
             @foreach($columns as $column)
@@ -37,6 +37,7 @@
             :columns="$columns"
             :theme="$theme"
         />
+
         @if(is_null($data) || count($data) === 0)
             <th>
                 <tr class="{{ $theme->table->trBodyClass }}"
@@ -51,7 +52,8 @@
                     </td>
                 </tr>
             </th>
-        @else
+        @endif
+        @if(count($data))
             <th>
                 @foreach($data as $row)
                     <tr class="{{ $theme->table->trBodyClass }}"
diff --git a/src/Commands/DemoCommand.php b/src/Commands/DemoCommand.php
index c9c976f9..135bea90 100644
--- a/src/Commands/DemoCommand.php
+++ b/src/Commands/DemoCommand.php
@@ -4,7 +4,6 @@
 
 use Illuminate\Console\Command;
 use Illuminate\Filesystem\Filesystem;
-use Illuminate\Support\Str;
 
 class DemoCommand extends Command
 {
@@ -12,7 +11,7 @@ class DemoCommand extends Command
 
     protected $description = 'Generate a PowerGrid demo Table.';
 
-    protected string $stubPath = __DIR__ . '/../../resources/stubs/';
+    private string $stubPath = __DIR__ . '/../../resources/stubs/';
 
     public function handle()
     {
diff --git a/src/Providers/PowerGridServiceProvider.php b/src/Providers/PowerGridServiceProvider.php
index b94df7a2..7a871e6d 100644
--- a/src/Providers/PowerGridServiceProvider.php
+++ b/src/Providers/PowerGridServiceProvider.php
@@ -2,7 +2,6 @@
 
 namespace PowerComponents\LivewirePowerGrid\Providers;
 
-use Illuminate\Filesystem\Filesystem;
 use Illuminate\Support\Facades\Blade;
 use Illuminate\Support\ServiceProvider;
 use PowerComponents\LivewirePowerGrid\Commands\CreateCommand;
@@ -13,6 +12,8 @@
 
 class PowerGridServiceProvider extends ServiceProvider
 {
+    private string $packageName = 'livewire-powergrid';
+
     public function boot()
     {
         if ($this->app->runningInConsole()) {
@@ -23,7 +24,7 @@ public function boot()
 
         $this->publishViews();
         $this->publishConfigs();
-        $this->loadTranslationsFrom(__DIR__ . '/../../resources/lang', 'livewire-powergrid');
+        $this->loadTranslationsFrom(__DIR__ . '/../../resources/lang', $this->packageName);
         $this->createDirectives();
     }
 
@@ -31,7 +32,7 @@ public function register()
     {
         $this->mergeConfigFrom(
             __DIR__ . '/../../resources/config/livewire-powergrid.php',
-            'livewire-powergrid'
+            $this->packageName
         );
 
         $file = __DIR__ . '/../functions.php';
@@ -45,22 +46,22 @@ public function register()
 
     private function publishViews()
     {
-        $this->loadViewsFrom(__DIR__ . '/../../resources/views', 'livewire-powergrid');
+        $this->loadViewsFrom(__DIR__ . '/../../resources/views', $this->packageName);
 
         $this->publishes([
-            __DIR__ . '/../../resources/views' => resource_path('views/vendor/livewire-powergrid'),
-        ], 'livewire-powergrid-views');
+            __DIR__ . '/../../resources/views' => resource_path('views/vendor/' . $this->packageName),
+        ], $this->packageName . '-views');
     }
 
     private function publishConfigs()
     {
         $this->publishes([
-            __DIR__ . '/../../resources/config/livewire-powergrid.php' => config_path('livewire-powergrid.php'),
+            __DIR__ . '/../../resources/config/livewire-powergrid.php' => config_path($this->packageName . '.php'),
         ], 'livewire-powergrid-config');
 
         $this->publishes([
-            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/livewire-powergrid'),
-        ], 'livewire-powergrid-lang');
+            __DIR__ . '/../../resources/lang' => resource_path('lang/vendor/' . $this->packageName),
+        ], $this->packageName . '-lang');
     }
 
     private function createDirectives()

From ef03baa3870928f35837ad147e682be2188b3e7f Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 15:57:11 -0300
Subject: [PATCH 17/34] 1.4 - wip

---
 resources/views/assets/scripts.blade.php      |  2 +-
 resources/views/components/actions.blade.php  |  2 +-
 .../frameworks/tailwind/scripts.blade.php     | 25 +++++++++++++++++++
 .../views/components/table-base.blade.php     |  2 +-
 resources/views/components/table.blade.php    |  2 +-
 src/Themes/Bootstrap5.php                     | 12 ++++-----
 6 files changed, 35 insertions(+), 10 deletions(-)

diff --git a/resources/views/assets/scripts.blade.php b/resources/views/assets/scripts.blade.php
index 18777fb0..c896cf35 100644
--- a/resources/views/assets/scripts.blade.php
+++ b/resources/views/assets/scripts.blade.php
@@ -1,7 +1,7 @@
 <script src="{{ config('livewire-powergrid.plugins.flat_piker.js') }}"></script>
 <script src="{{ config('livewire-powergrid.plugins.flat_piker.translate') }}"></script>
 
-@includeIf(powerGridThemeRoot()."scripts")
+@includeIf(powerGridThemeRoot().".scripts")
 
 <script>
     function copyToClipboard(button) {
diff --git a/resources/views/components/actions.blade.php b/resources/views/components/actions.blade.php
index a6e5a77b..4d1dd79c 100644
--- a/resources/views/components/actions.blade.php
+++ b/resources/views/components/actions.blade.php
@@ -53,7 +53,7 @@ class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnCl
 
     @if(isset($actions) && count($actions) && $row !== '')
         @foreach($actions as $action)
-            <td class="{{ $theme->actions->tdBodyClass ?? $theme->table->tdBodyClass }}"
+            <td class="pg-actions {{ $theme->actions->tdBodyClass ?? $theme->table->tdBodyClass }}"
                 style="{{ $theme->actions->tdBodyStyle ?? $theme->table->tdBodyStyle }}">
                 @php
                     $parameters = [];
diff --git a/resources/views/components/frameworks/tailwind/scripts.blade.php b/resources/views/components/frameworks/tailwind/scripts.blade.php
index a7923c7f..dab75b83 100644
--- a/resources/views/components/frameworks/tailwind/scripts.blade.php
+++ b/resources/views/components/frameworks/tailwind/scripts.blade.php
@@ -7,4 +7,29 @@ function saveToggleableInput(value, id, field) {
             value: value
         })
     }
+
+    function hiddenInvalidCol()
+    {
+        const table = document.querySelector('.power-grid-table');
+
+        for (let i in table.rows) {
+            let row = table.rows[i]
+            for (let j in row.cells) {
+                let col = row.cells[j]
+                if (col.classList !== undefined) {
+                    if (col.classList.length === 0) {
+                        col.setAttribute('style', 'display:none')
+                    }
+                }
+            }
+        }
+    }
+
+    document.addEventListener("DOMContentLoaded", () => {
+        hiddenInvalidCol()
+
+        Livewire.hook('element.updated', (el, component) => {
+            hiddenInvalidCol()
+        })
+    });
 </script>
diff --git a/resources/views/components/table-base.blade.php b/resources/views/components/table-base.blade.php
index f725f875..faa2d0f7 100644
--- a/resources/views/components/table-base.blade.php
+++ b/resources/views/components/table-base.blade.php
@@ -2,7 +2,7 @@
     'theme' => null
 ])
 <div>
-    <table class="{{$theme->tableClass}}"
+    <table class="power-grid-table {{ $theme->tableClass }}"
            style="{{$theme->tableStyle}}">
         <thead class="{{$theme->theadClass}}"
                style="{{$theme->theadStyle}}">
diff --git a/resources/views/components/table.blade.php b/resources/views/components/table.blade.php
index e7c72b26..50271735 100644
--- a/resources/views/components/table.blade.php
+++ b/resources/views/components/table.blade.php
@@ -58,7 +58,7 @@
                 @foreach($data as $row)
                     <tr class="{{ $theme->table->trBodyClass }}"
                         style="{{ $theme->table->trBodyStyle }}"
-                        wire:key="{{ $row->id }}">
+                        wire:key="{{ $row->{$primaryKey} }}">
 
                         @if($checkbox)
                             <x-livewire-powergrid::checkbox-row
diff --git a/src/Themes/Bootstrap5.php b/src/Themes/Bootstrap5.php
index 9b041de5..09df1310 100644
--- a/src/Themes/Bootstrap5.php
+++ b/src/Themes/Bootstrap5.php
@@ -14,12 +14,12 @@ public static function paginationTheme(): string
     public function table(): Components\Table
     {
         return Theme::table("table table-bordered table-hover table-striped table-checkable table-highlight-head mb-2")
-            ->thead("")
-            ->tr("")
-            ->th("", "white-space: nowrap;min-width: 50px;padding-left: 15px;font-size: 0.75rem;color: #6b6a6a;padding-top: 8px;padding-bottom: 8px;")
-            ->tbody("")
-            ->trBody("")
-            ->tdBody("", "vertical-align: middle; line-height: normal;");
+            ->thead("w-full")
+            ->tr("w-full")
+            ->th("w-full", "white-space: nowrap;min-width: 50px;padding-left: 15px;font-size: 0.75rem;color: #6b6a6a;padding-top: 8px;padding-bottom: 8px;")
+            ->tbody("w-full")
+            ->trBody("w-full")
+            ->tdBody("w-full", "vertical-align: middle; line-height: normal;");
     }
 
     public function cols(): Components\Cols

From 486cbbc4e5f4c25c0c302e045806a8fdec07a931 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 17:52:18 -0300
Subject: [PATCH 18/34] 1.4 - wip

---
 .../frameworks/tailwind/scripts.blade.php        | 16 +++++++++-------
 1 file changed, 9 insertions(+), 7 deletions(-)

diff --git a/resources/views/components/frameworks/tailwind/scripts.blade.php b/resources/views/components/frameworks/tailwind/scripts.blade.php
index dab75b83..b6bfcbc0 100644
--- a/resources/views/components/frameworks/tailwind/scripts.blade.php
+++ b/resources/views/components/frameworks/tailwind/scripts.blade.php
@@ -12,13 +12,15 @@ function hiddenInvalidCol()
     {
         const table = document.querySelector('.power-grid-table');
 
-        for (let i in table.rows) {
-            let row = table.rows[i]
-            for (let j in row.cells) {
-                let col = row.cells[j]
-                if (col.classList !== undefined) {
-                    if (col.classList.length === 0) {
-                        col.setAttribute('style', 'display:none')
+        if (table !== null) {
+            for (let i in table.rows) {
+                let row = table.rows[i]
+                for (let j in row.cells) {
+                    let col = row.cells[j]
+                    if (col.classList !== undefined) {
+                        if (col.classList.length === 0) {
+                            col.setAttribute('style', 'display:none')
+                        }
                     }
                 }
             }

From ba50d7abe19d19327db332e4ea02c6ef7d126c9b Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 18:19:08 -0300
Subject: [PATCH 19/34] 1.4 - wip

---
 .../frameworks/tailwind/scripts.blade.php     | 27 -------------------
 src/PowerGridComponent.php                    |  4 +--
 2 files changed, 2 insertions(+), 29 deletions(-)

diff --git a/resources/views/components/frameworks/tailwind/scripts.blade.php b/resources/views/components/frameworks/tailwind/scripts.blade.php
index b6bfcbc0..a7923c7f 100644
--- a/resources/views/components/frameworks/tailwind/scripts.blade.php
+++ b/resources/views/components/frameworks/tailwind/scripts.blade.php
@@ -7,31 +7,4 @@ function saveToggleableInput(value, id, field) {
             value: value
         })
     }
-
-    function hiddenInvalidCol()
-    {
-        const table = document.querySelector('.power-grid-table');
-
-        if (table !== null) {
-            for (let i in table.rows) {
-                let row = table.rows[i]
-                for (let j in row.cells) {
-                    let col = row.cells[j]
-                    if (col.classList !== undefined) {
-                        if (col.classList.length === 0) {
-                            col.setAttribute('style', 'display:none')
-                        }
-                    }
-                }
-            }
-        }
-    }
-
-    document.addEventListener("DOMContentLoaded", () => {
-        hiddenInvalidCol()
-
-        Livewire.hook('element.updated', (el, component) => {
-            hiddenInvalidCol()
-        })
-    });
 </script>
diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index a67f8e35..9e101ac5 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -220,7 +220,7 @@ private function resolveCollection($datasource = null, $cached = '')
         }
 
         if (!powerGridCache()) {
-            return new BaseCollection($this->datasource()->make());
+            return new BaseCollection($this->datasource());
         }
 
         return cache()->rememberForever($this->id, function () use ($datasource) {
@@ -231,7 +231,7 @@ private function resolveCollection($datasource = null, $cached = '')
                 return $datasource;
             }
 
-            return new BaseCollection($datasource->make());
+            return new BaseCollection($datasource);
         });
     }
 

From b2d0b89508b034f026be2734e88e012123d4760e Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 18:42:52 -0300
Subject: [PATCH 20/34] 1.4 - wip

---
 src/PowerGridComponent.php | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index 9e101ac5..81e05ccb 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -171,7 +171,7 @@ public function mount($datasource = null)
 
     public function render()
     {
-        $this->powerGridTheme = PowerGrid::theme(powerGridTheme())->apply();
+        $this->powerGridTheme = PowerGrid::theme($this->template() ?? powerGridTheme())->apply();
 
         $this->columns = collect($this->columns)->map(function ($column) {
             return (object)$column;

From 9165e736e03bc594cff32ee076a563a9b31dcfd4 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sun, 24 Oct 2021 18:51:29 -0300
Subject: [PATCH 21/34] 1.4 - wip

---
 src/Helpers/Collection.php | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/Helpers/Collection.php b/src/Helpers/Collection.php
index b8ae53de..8d55749a 100644
--- a/src/Helpers/Collection.php
+++ b/src/Helpers/Collection.php
@@ -324,6 +324,7 @@ public function filterContains(): Collection
     {
         if (!empty($this->search)) {
             $this->query = $this->query->filter(function ($row) {
+                $row = (object)$row;
                 foreach ($this->columns as $column) {
                     $field = $column->field;
 
@@ -332,6 +333,7 @@ public function filterContains(): Collection
                             return false !== stristr($row->{$field}, strtolower($this->search));
                         }
                     } catch (\Exception $exception) {
+                        throw new \Exception($exception);
                     }
                 }
 

From 0952ab81f9c2c9c19149c3d12b87bcdbeb0a7fdf Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 26 Oct 2021 18:18:48 -0300
Subject: [PATCH 22/34] wip

---
 resources/views/components/editable.blade.php                    | 1 -
 .../views/components/frameworks/tailwind/multi-select.blade.php  | 1 +
 2 files changed, 1 insertion(+), 1 deletion(-)

diff --git a/resources/views/components/editable.blade.php b/resources/views/components/editable.blade.php
index dc274c05..8c945652 100644
--- a/resources/views/components/editable.blade.php
+++ b/resources/views/components/editable.blade.php
@@ -22,7 +22,6 @@
             type="text"
             x-on:dblclick="editable = true"
             x-on:keydown.enter="sendEventInputChanged($event, id, field); editable = false; content = $event.target.value"
-            x-on:blur="sendEventInputChanged($event, id, field); editable = false; content = $event.target.value"
             :class="{'cursor-pointer': !editable}"
             class="{{ $theme->inputClass }} p-2"
             x-ref="editable"
diff --git a/resources/views/components/frameworks/tailwind/multi-select.blade.php b/resources/views/components/frameworks/tailwind/multi-select.blade.php
index 02dc06c7..a07d4492 100644
--- a/resources/views/components/frameworks/tailwind/multi-select.blade.php
+++ b/resources/views/components/frameworks/tailwind/multi-select.blade.php
@@ -29,6 +29,7 @@ class="flex justify-center items-center m-1 font-medium py-1 px-2 bg-white dark:
                             </template>
                             <div x-show="selected.length === 0" class="flex-1">
                                 <input readonly
+                                       name="multi_select_{{ $column->field }}"
                                        placeholder="{{ trans($column->placeholder) ?: trans('livewire-powergrid::datatable.multi_select.select') }}"
                                        class="w-full block bg-white-200 text-gray-700 py-2 text-sm px-3 leading-tight focus:outline-none dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-400"
                                        x-bind:value="selectedValues()"

From a41da4a1e516d0abf001cb33ae9aac5b3eb31bf5 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 26 Oct 2021 18:34:10 -0300
Subject: [PATCH 23/34] fix empty line on table

---
 .../views/components/actions-header.blade.php | 50 +++++++++++++++++++
 resources/views/components/actions.blade.php  | 46 -----------------
 .../frameworks/tailwind/header.blade.php      |  3 +-
 .../views/components/table-base.blade.php     |  2 +-
 resources/views/components/table.blade.php    |  4 +-
 5 files changed, 54 insertions(+), 51 deletions(-)
 create mode 100644 resources/views/components/actions-header.blade.php

diff --git a/resources/views/components/actions-header.blade.php b/resources/views/components/actions-header.blade.php
new file mode 100644
index 00000000..0a59963d
--- /dev/null
+++ b/resources/views/components/actions-header.blade.php
@@ -0,0 +1,50 @@
+@props([
+    'actions' => null,
+    'theme' => null,
+])
+<div class="w-full md:w-auto">
+    <div class="sm:flex sm:flex-row">
+        @foreach($actions as $action)
+            <div class="sm:mr-2 mb-2 w-auto">
+                @php
+                    $parameters = [];
+                    foreach ($action->param as $param => $value) {
+                       $parameters[$param] = $row->{$value};
+                    }
+                @endphp
+                @if($action->event !== '')
+                    <a wire:click='$emit("{{ $action->event }}", @json($parameters))'
+                       target="{{ $action->target }}"
+                       class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
+                        {!! $action->caption !!}
+                    </a>
+                @elseif($action->view !== '')
+                    <a wire:click='$emit("openModal", "{{$action->view}}", @json($parameters))'
+                       target="{{ $action->target }}"
+                       class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
+                        {!! $action->caption !!}
+                    </a>
+                @else
+                    @if(strtolower($action->method) !== 'get')
+                        <form target="{{ $action->target }}"
+                              action="{{ route($action->route, $parameters) }}"
+                              method="{{ $action->target }}">
+                            @method($action->method)
+                            @csrf
+                            <button type="submit"
+                                    class="{{ filled( $action->class) ? $action->class : $theme->actions->headerBtnClass }}">
+                                {!! $action->caption ?? '' !!}
+                            </button>
+                        </form>
+                    @else
+                        <a href="{{ route($action->route, $parameters) }}"
+                           target="{{ $action->target }}"
+                           class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
+                            {!! $action->caption !!}
+                        </a>
+                    @endif
+                @endif
+            </div>
+        @endforeach
+    </div>
+</div>
diff --git a/resources/views/components/actions.blade.php b/resources/views/components/actions.blade.php
index 4d1dd79c..b39eba7d 100644
--- a/resources/views/components/actions.blade.php
+++ b/resources/views/components/actions.blade.php
@@ -4,52 +4,6 @@
     'row' => null
 ])
 <div class="w-full md:w-auto">
-    @if($row === '')
-        <div class="sm:flex sm:flex-row">
-            @foreach($actions as $action)
-                <div class="sm:mr-2 mb-2 w-auto">
-                    @php
-                        $parameters = [];
-                        foreach ($action->param as $param => $value) {
-                           $parameters[$param] = $row->{$value};
-                        }
-                    @endphp
-                    @if($action->event !== '')
-                        <a wire:click='$emit("{{ $action->event }}", @json($parameters))'
-                           target="{{ $action->target }}"
-                           class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
-                            {!! $action->caption !!}
-                        </a>
-                    @elseif($action->view !== '')
-                        <a wire:click='$emit("openModal", "{{$action->view}}", @json($parameters))'
-                           target="{{ $action->target }}"
-                           class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
-                            {!! $action->caption !!}
-                        </a>
-                    @else
-                        @if(strtolower($action->method) !== 'get')
-                            <form target="{{ $action->target }}"
-                                  action="{{ route($action->route, $parameters) }}"
-                                  method="{{ $action->target }}">
-                                @method($action->method)
-                                @csrf
-                                <button type="submit"
-                                        class="{{ filled( $action->class) ? $action->class : $theme->actions->headerBtnClass }}">
-                                    {!! $action->caption ?? '' !!}
-                                </button>
-                            </form>
-                        @else
-                            <a href="{{ route($action->route, $parameters) }}"
-                               target="{{ $action->target }}"
-                               class="{{ filled($action->class) ? $action->class : $theme->actions->headerBtnClass }}">
-                                {!! $action->caption !!}
-                            </a>
-                        @endif
-                    @endif
-                </div>
-            @endforeach
-        </div>
-    @endif
 
     @if(isset($actions) && count($actions) && $row !== '')
         @foreach($actions as $action)
diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index b0a1ea2a..1424862f 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -3,9 +3,8 @@
     <div class="md:flex md:flex-row w-full">
 
         <div>
-            <x-livewire-powergrid::actions
+            <x-livewire-powergrid:x-livewire-powergrid::actions-header
                 :theme="$theme"
-                row=""
                 :actions="$this->headers"/>
         </div>
 
diff --git a/resources/views/components/table-base.blade.php b/resources/views/components/table-base.blade.php
index faa2d0f7..cb74b9be 100644
--- a/resources/views/components/table-base.blade.php
+++ b/resources/views/components/table-base.blade.php
@@ -2,7 +2,7 @@
     'theme' => null
 ])
 <div>
-    <table class="power-grid-table {{ $theme->tableClass }}"
+    <table class="table power-grid-table {{ $theme->tableClass }}"
            style="{{$theme->tableStyle}}">
         <thead class="{{$theme->theadClass}}"
                style="{{$theme->theadStyle}}">
diff --git a/resources/views/components/table.blade.php b/resources/views/components/table.blade.php
index 50271735..633cd27d 100644
--- a/resources/views/components/table.blade.php
+++ b/resources/views/components/table.blade.php
@@ -54,7 +54,7 @@
             </th>
         @endif
         @if(count($data))
-            <th>
+
                 @foreach($data as $row)
                     <tr class="{{ $theme->table->trBodyClass }}"
                         style="{{ $theme->table->trBodyStyle }}"
@@ -79,7 +79,7 @@
                             :actions="$actions"/>
                     </tr>
                 @endforeach
-            </th>
+
         @endif
     </x-slot>
 </x-livewire-powergrid::table-base>

From 800e2f226699c200b597d38e2bf04f5a3f133a31 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 26 Oct 2021 18:38:40 -0300
Subject: [PATCH 24/34] 1.4 - wip

---
 resources/views/components/frameworks/tailwind/header.blade.php | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/resources/views/components/frameworks/tailwind/header.blade.php b/resources/views/components/frameworks/tailwind/header.blade.php
index 1424862f..b5f33790 100644
--- a/resources/views/components/frameworks/tailwind/header.blade.php
+++ b/resources/views/components/frameworks/tailwind/header.blade.php
@@ -3,7 +3,7 @@
     <div class="md:flex md:flex-row w-full">
 
         <div>
-            <x-livewire-powergrid:x-livewire-powergrid::actions-header
+            <x-livewire-powergrid::actions-header
                 :theme="$theme"
                 :actions="$this->headers"/>
         </div>

From 791f16c4d1aaf41a9f56ba43ffae6d8b4ceb7f45 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 26 Oct 2021 18:55:15 -0300
Subject: [PATCH 25/34] cs fix

---
 resources/lang/id/datatable.php | 2 +-
 src/Helpers/Collection.php      | 1 -
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/resources/lang/id/datatable.php b/resources/lang/id/datatable.php
index 721a1bcb..bb334e61 100644
--- a/resources/lang/id/datatable.php
+++ b/resources/lang/id/datatable.php
@@ -41,5 +41,5 @@
         'contains_not' => 'Tidak terkait',
         'starts_with'  => 'Dimulai dengan',
         'ends_with'    => 'Diakhiri dengan',
-    ]
+    ],
 ];
diff --git a/src/Helpers/Collection.php b/src/Helpers/Collection.php
index fc1167be..15d28375 100644
--- a/src/Helpers/Collection.php
+++ b/src/Helpers/Collection.php
@@ -324,7 +324,6 @@ public function filterContains(): Collection
     {
         if (!empty($this->search)) {
             $this->query = $this->query->filter(function ($row) {
-
                 $row = (object)$row;
 
                 foreach ($this->columns as $column) {

From 06cc57e112be5c43d703f7a87b1e420b120601da Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 30 Oct 2021 10:24:05 -0300
Subject: [PATCH 26/34] 1.4 - wip

---
 .../tailwind/batch-exporting.blade.php        |   2 +-
 src/PowerGridComponent.php                    |   2 +
 src/Themes/Tailwind.php                       |   2 +-
 src/Traits/BatchableExport.php                | 168 ++++++++++++++++++
 src/Traits/Exportable.php                     | 161 -----------------
 src/Traits/ExportableJob.php                  |   5 +-
 6 files changed, 174 insertions(+), 166 deletions(-)
 create mode 100644 src/Traits/BatchableExport.php

diff --git a/resources/views/components/frameworks/tailwind/batch-exporting.blade.php b/resources/views/components/frameworks/tailwind/batch-exporting.blade.php
index ecfc863f..24529277 100644
--- a/resources/views/components/frameworks/tailwind/batch-exporting.blade.php
+++ b/resources/views/components/frameworks/tailwind/batch-exporting.blade.php
@@ -2,7 +2,7 @@
 
     @if($batchExporting && !$batchFinished)
         <div wire:poll="updateExportProgress"
-             class="w-full my-3 px-4 rounded-md py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
+             class="w-full my-3 px-4 rounded py-3 bg-gray-200 shadow-sm dark:bg-gray-500 text-center">
             <div class="dark:text-gray-300">{{ $batchProgress }}%</div>
             <div class="dark:text-gray-300">{{ trans('livewire-powergrid::datatable.export.exporting') }}</div>
         </div>
diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index 81e05ccb..ef7bd8d3 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -9,6 +9,7 @@
 use PowerComponents\LivewirePowerGrid\Helpers\Collection;
 use PowerComponents\LivewirePowerGrid\Helpers\Model;
 use PowerComponents\LivewirePowerGrid\Themes\ThemeBase;
+use PowerComponents\LivewirePowerGrid\Traits\BatchableExport;
 use PowerComponents\LivewirePowerGrid\Traits\Checkbox;
 use PowerComponents\LivewirePowerGrid\Traits\Exportable;
 use PowerComponents\LivewirePowerGrid\Traits\Filter;
@@ -21,6 +22,7 @@ class PowerGridComponent extends Component
     use WithSorting;
     use Checkbox;
     use Filter;
+    use BatchableExport;
 
     public array $headers = [];
 
diff --git a/src/Themes/Tailwind.php b/src/Themes/Tailwind.php
index 47149661..a416a4d4 100644
--- a/src/Themes/Tailwind.php
+++ b/src/Themes/Tailwind.php
@@ -58,7 +58,7 @@ public function checkbox(): Components\Checkbox
         return Theme::checkbox()
             ->th("px-6 py-3 text-left text-xs font-medium text-gray-500 tracking-wider")
             ->label("flex items-center space-x-3")
-            ->input("form-checkbox h-4 w-4");
+            ->input("h-4 w-4");
     }
 
     public function filterBoolean(): Components\FilterBoolean
diff --git a/src/Traits/BatchableExport.php b/src/Traits/BatchableExport.php
new file mode 100644
index 00000000..d538e955
--- /dev/null
+++ b/src/Traits/BatchableExport.php
@@ -0,0 +1,168 @@
+<?php
+
+namespace PowerComponents\LivewirePowerGrid\Traits;
+
+use Illuminate\Bus\Batch;
+use Illuminate\Support\Collection;
+use Illuminate\Support\Facades\Bus;
+use Illuminate\Support\Str;
+use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
+use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
+use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
+use Symfony\Component\HttpFoundation\BinaryFileResponse;
+use Throwable;
+
+trait BatchableExport
+{
+    public bool $batchExporting = false;
+
+    public bool $batchFinished = false;
+
+    public string $batchId = '';
+
+    public string $batchName = 'Powergrid batch export';
+
+    public string $onConnection = 'sync';
+
+    public string $onQueue = 'default';
+
+    public int $total = 0;
+
+    public int $queues = 0;
+
+    public bool $showExporting = true;
+
+    public int $batchProgress = 0;
+
+    public array $exportedFiles = [];
+
+    public string $exportableJobClass = ExportJob::class;
+
+    public bool $batchErrors = false;
+
+    public function getExportBatchProperty(): ?Batch
+    {
+        if (!$this->batchId) {
+            return null;
+        }
+
+        return Bus::findBatch($this->batchId);
+    }
+
+    public function updateExportProgress()
+    {
+        if (!is_null($this->exportBatch)) {
+            $this->batchFinished     = $this->exportBatch->finished();
+            $this->batchProgress     = $this->exportBatch->progress();
+            $this->batchErrors       = $this->exportBatch->hasFailures();
+
+            if ($this->batchFinished) {
+                $this->batchExporting = false;
+            }
+
+            $this->onBatchExecuting($this->exportBatch);
+        }
+    }
+
+    public function downloadExport(string $file): BinaryFileResponse
+    {
+        return response()->download(storage_path($file));
+    }
+
+    /**
+     * @throws \Throwable
+     */
+    public function runOnQueue(string $exportFileType): void
+    {
+        $this->batchExporting = true;
+        $this->batchFinished  = false;
+
+        $queues = $this->putQueuesToBus($exportFileType);
+
+        $batch  = Bus::batch([
+            $queues->toArray(),
+        ])
+            ->name($this->batchName)
+            ->onQueue($this->onQueue)
+            ->onConnection($this->onConnection)
+            ->then(function (Batch $batch) {
+                $this->onBatchThen($batch);
+            })->catch(function (Batch $batch, Throwable $e) {
+                $this->onBatchCatch($batch, $e);
+            })->finally(function (Batch $batch) {
+                $this->onBatchFinally($batch);
+            })
+            ->dispatch();
+
+        $this->batchId = $batch->id;
+    }
+
+    private function putQueuesToBus(string $type): Collection
+    {
+        $this->exportedFiles = [];
+        $queues              = collect();
+        $perPage             = $this->total / $this->queues;
+        $offset              = 0;
+        $limit               = $perPage;
+        $fileExtension       = $this->resolveFileExtension($type);
+
+        for ($i = 1; $i < ($this->queues + 1); $i++) {
+            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) .
+                '-' . ($offset + 1) .
+                '-' . $limit .
+                '-' . $this->id .
+                '.' . $fileExtension;
+
+            $params = [
+                'type'     => $type,
+                'fileName' => $fileName,
+                'offset'   => $offset,
+                'limit'    => $limit,
+            ];
+
+            $queues->push(new $this->exportableJobClass(
+                get_called_class(),
+                $this->columns(),
+                $params,
+            ));
+
+            $this->exportedFiles[] = $fileName;
+
+            $offset = $limit;
+            $limit  = $offset + $perPage;
+        }
+
+        return $queues;
+    }
+
+    private function resolveFileExtension(string $class): string
+    {
+        $extension = '';
+        switch ($class) {
+            case ExportToCsv::class:
+                $extension = 'csv';
+
+                break;
+            case ExportToXLS::class:
+                $extension = 'xlsx';
+        }
+
+        return $extension;
+    }
+
+    protected function onBatchExecuting(Batch $batch)
+    {
+    }
+
+    protected function onBatchThen(Batch $batch)
+    {
+    }
+
+    protected function onBatchCatch(Batch $batch, Throwable $e)
+    {
+    }
+
+    protected function onBatchFinally(Batch $batch)
+    {
+    }
+}
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 4cfca6a9..31d35751 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -2,19 +2,9 @@
 
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
-use App\Http\Livewire\DishesTable;
-use App\Models\Dish;
 use Illuminate\Bus\Batch;
-use Illuminate\Support\Collection;
-use Illuminate\Support\Facades\Bus;
-use Illuminate\Support\Facades\Log;
-use Illuminate\Support\Facades\Storage;
-use Illuminate\Support\Str;
-use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
 use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
-use Symfony\Component\HttpFoundation\BinaryFileResponse;
-use Throwable;
 
 /**
  * @property Batch exportBatch
@@ -27,34 +17,6 @@ trait Exportable
 
     public array $exportType = [];
 
-    public bool $batchExporting = false;
-
-    public bool $batchFinished = false;
-
-    public string $batchId = '';
-
-    public string $batchName = 'Powergrid batch export';
-
-    public string $onConnection = 'sync';
-
-    public string $onQueue = 'default';
-
-    public string $extension = '';
-
-    public int $total = 0;
-
-    public int $queues = 0;
-
-    public bool $showExporting = true;
-
-    public int $batchProgress = 0;
-
-    public array $exportedFiles = [];
-
-    public string $exportableJobClass = ExportJob::class;
-
-    public bool $batchErrors = false;
-
     /**
      * @param string $fileName
      * @param array|string[] $type
@@ -131,127 +93,4 @@ public function exportToCsv(bool $selected = false)
             ->setData($this->columns(), $this->prepareToExport($selected))
             ->download();
     }
-
-    public function getExportBatchProperty(): ?Batch
-    {
-        if (!$this->batchId) {
-            return null;
-        }
-
-        return Bus::findBatch($this->batchId);
-    }
-
-    public function updateExportProgress()
-    {
-        if (!is_null($this->exportBatch)) {
-            $this->batchFinished     = $this->exportBatch->finished();
-            $this->batchProgress     = $this->exportBatch->progress();
-            $this->batchErrors       = $this->exportBatch->hasFailures();
-
-            if ($this->batchFinished) {
-                $this->batchExporting = false;
-            }
-
-            $this->onBatchExecuting($this->exportBatch);
-        }
-    }
-
-    public function downloadExport(string $file): BinaryFileResponse
-    {
-        return response()->download(storage_path($file));
-    }
-
-    public function onBatchExecuting(Batch $batch)
-    {
-    }
-
-    public function onBatchThen(Batch $batch)
-    {
-    }
-
-    public function onBatchCatch(Batch $batch, Throwable $e)
-    {
-    }
-
-    public function onBatchFinally(Batch $batch)
-    {
-    }
-
-    /**
-     * @throws \Throwable
-     */
-    public function runOnQueue(string $type): bool
-    {
-        if ($this->queues) {
-            $this->batchExporting = true;
-            $this->batchFinished  = false;
-
-            $queues = $this->createQueues($type);
-
-            $batch  = Bus::batch([
-                $queues->toArray(),
-            ])
-                ->name($this->batchName)
-                ->onQueue($this->onQueue)
-                ->onConnection($this->onConnection)
-                ->then(function (Batch $batch) {
-                    $this->onBatchThen($batch);
-                })->catch(function (Batch $batch, Throwable $e) {
-                    $this->onBatchCatch($batch, $e);
-                })->finally(function (Batch $batch) {
-                    $this->onBatchFinally($batch);
-                })
-                ->dispatch();
-
-            $this->batchId = $batch->id;
-
-            return true;
-        }
-    }
-
-    public function createQueues(string $type): Collection
-    {
-        $this->exportedFiles = [];
-        $queues              = collect();
-        $perPage             = $this->total / $this->queues;
-        $offset              = 0;
-        $limit               = $perPage;
-
-        switch ($type) {
-            case ExportToCsv::class:
-                $this->extension = 'csv';
-
-                break;
-            case ExportToXLS::class:
-                $this->extension = 'xlsx';
-        }
-
-        for ($i = 1; $i < ($this->queues + 1); $i++) {
-            $fileName = 'powergrid-' . Str::kebab($this->exportFileName) .
-                '-' . ($offset + 1) .
-                '-' . $limit .
-                '-' . $this->id .
-                '.' . $this->extension;
-
-            $params = [
-                'type'     => $type,
-                'fileName' => $fileName,
-                'offset'   => $offset,
-                'limit'    => $limit,
-            ];
-
-            $queues->push(new $this->exportableJobClass(
-                get_called_class(),
-                $this->columns(),
-                $params,
-            ));
-
-            $this->exportedFiles[] = $fileName;
-
-            $offset = $limit;
-            $limit  = $offset + $perPage;
-        }
-
-        return $queues;
-    }
 }
diff --git a/src/Traits/ExportableJob.php b/src/Traits/ExportableJob.php
index 7cbb54d9..7280adfb 100644
--- a/src/Traits/ExportableJob.php
+++ b/src/Traits/ExportableJob.php
@@ -2,7 +2,6 @@
 
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
-use Illuminate\Database\Eloquent\Builder;
 use Illuminate\Database\Eloquent\Collection;
 use Illuminate\Support\Str;
 use Illuminate\Support\Stringable;
@@ -29,9 +28,9 @@ private function getFilename(): Stringable
             ->replace('.csv', '');
     }
 
-    private function transform(Collection $query)
+    private function transform(Collection $collection): Collection
     {
-        return $query->transform(function ($row) {
+        return $collection->transform(function ($row) {
             $row = (object)$row;
             $columns = $this->componentTable->addColumns()->columns;
             foreach ($columns as $key => $column) {

From bfe5b10e1d5e59480202272e5b744edfe6288056 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 30 Oct 2021 13:37:35 -0300
Subject: [PATCH 27/34] cs fix - workflow file and queue

---
 .github/workflows/php.yml                  | 69 ++++++++++-------
 .gitignore                                 |  1 +
 .php-cs-fixer.php                          | 81 ++++++++++----------
 composer.json                              |  4 +-
 resources/lang/ca/datatable.php            |  6 +-
 resources/lang/de/datatable.php            |  6 +-
 resources/lang/en/datatable.php            |  6 +-
 resources/lang/es/datatable.php            |  6 +-
 resources/lang/fa/datatable.php            |  4 +-
 resources/lang/id/datatable.php            |  2 +-
 resources/lang/it/datatable.php            |  6 +-
 resources/lang/pt_BR/datatable.php         |  6 +-
 src/Column.php                             |  4 +-
 src/Commands/CreateCommand.php             | 21 +++---
 src/Helpers/Collection.php                 | 17 ++---
 src/Helpers/Model.php                      |  8 +-
 src/Jobs/ExportJob.php                     |  6 +-
 src/PowerGridComponent.php                 | 32 ++++----
 src/PowerGridEloquent.php                  |  2 +-
 src/Providers/PowerGridServiceProvider.php |  4 +-
 src/Services/Spout/ExportToXLS.php         |  3 +-
 src/Themes/AbstractTheme.php               |  4 +-
 src/Themes/Bootstrap5.php                  | 86 +++++++++++-----------
 src/Themes/Tailwind.php                    | 84 ++++++++++-----------
 src/Themes/Theme.php                       | 15 +---
 src/Themes/ThemeBase.php                   | 18 ++---
 src/Themes/ThemeManager.php                | 15 +---
 src/Traits/BatchableExport.php             |  6 +-
 src/Traits/Checkbox.php                    |  2 +-
 src/Traits/Exportable.php                  |  3 +-
 src/Traits/ExportableJob.php               |  5 +-
 tests/DishesTable.php                      | 20 ++---
 tests/Feature/ColumnTest.php               |  2 +-
 tests/Feature/CommandsTest.php             |  7 +-
 tests/Feature/FilterInputDateTimeTest.php  |  4 +-
 tests/Feature/FilterNameOptionsTest.php    |  8 +-
 tests/Feature/FilterSelectTest.php         |  1 -
 tests/Feature/PowerGridTest.php            |  7 +-
 tests/Models/Category.php                  |  2 +-
 tests/Pest.php                             |  3 +-
 tests/TestCase.php                         |  5 +-
 41 files changed, 278 insertions(+), 313 deletions(-)

diff --git a/.github/workflows/php.yml b/.github/workflows/php.yml
index 2988638d..ab8a00e6 100644
--- a/.github/workflows/php.yml
+++ b/.github/workflows/php.yml
@@ -1,36 +1,55 @@
-name: PHP Composer
+name: Powergrid Tests
 
 on:
   push:
-    branches: [ main ]
+    branches:
+      - master
+
   pull_request:
-    branches: [ main ]
+    types: [ ready_for_review, synchronize, opened ]
 
 jobs:
   build:
-
     runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        php: [ 7.4, 8.0 ]
+        laravel: [ 8.* ]
+        dependency-version: [ prefer-stable ]
 
-    steps:
-    - uses: actions/checkout@v2
-
-    - name: Validate composer.json and composer.lock
-      run: composer validate --strict
+    name: PHP:${{ matrix.php }} / Laravel:${{ matrix.laravel }}(${{ matrix.dependency-version }})
 
-    - name: Cache Composer packages
-      id: composer-cache
-      uses: actions/cache@v2
-      with:
-        path: vendor
-        key: ${{ runner.os }}-php-${{ hashFiles('**/composer.lock') }}
-        restore-keys: |
-          ${{ runner.os }}-php-
-
-    - name: Install dependencies
-      run: composer install --prefer-dist --no-progress
-
-    - name: cs-fixer
-      run: vendor/bin/php-cs-fixer fix --dry-run --using-cache=no --verbose --stop-on-violation
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v2
+
+      - name: Setup PHP, with composer and extensions
+        uses: shivammathur/setup-php@v2
+        with:
+          php-version: ${{ matrix.php }}
+          extensions: dom, curl, libxml, mbstring, zip, pcntl, pdo, sqlite, pdo_sqlite, bcmath, soap, intl, gd, exif, iconv, imagick
+          tools: composer:v2
+          coverage: none
+
+      - name: Get composer cache directory
+        id: composer-cache
+        run: echo "::set-output name=dir::$(composer config cache-files-dir)"
+
+      - name: Cache composer dependencies
+        uses: actions/cache@v2
+        with:
+          path: ${{ steps.composer-cache.outputs.dir }}
+          key: dependencies-laravel-${{ matrix.laravel }}-php-${{ matrix.php }}-composer-${{ hashFiles('composer.json') }}
+          restore-keys: dependencies-laravel-${{ matrix.laravel }}-php-${{ matrix.php }}-composer-
+
+      - name: Install Composer dependencies
+        run: |
+          composer require "laravel/framework:${{ matrix.laravel }}" --no-interaction --no-update --dev
+          composer update --${{ matrix.dependency-version }} --prefer-dist --no-interaction
+
+      - name: PHP CS Fixer
+          run: vendor/bin/php-cs-fixer fix --dry-run --using-cache=no --verbose --stop-on-violation
+
+      - name: Pest tests
+          run: vendor/bin/pest
 
-    - name: tests
-      run: vendor/bin/pest
diff --git a/.gitignore b/.gitignore
index 9baed57c..fdc42fbc 100644
--- a/.gitignore
+++ b/.gitignore
@@ -6,3 +6,4 @@ composer.lock
 # PHPUnit
 /.phpunit.cache
 .phpunit.result.cache
+.php-cs-fixer.cache
diff --git a/.php-cs-fixer.php b/.php-cs-fixer.php
index 1bb836f7..5022e0cf 100644
--- a/.php-cs-fixer.php
+++ b/.php-cs-fixer.php
@@ -1,18 +1,17 @@
 <?php
 
-use PhpCsFixer\Config;
-use PhpCsFixer\Finder;
+use PhpCsFixer\{Config, Finder};
 
 $rules = [
-    '@PSR12'                  => true,
-    'align_multiline_comment' => false,
-    'array_indentation'       => true,
-    "array_syntax"            => ['syntax' => 'short'],
-    'binary_operator_spaces'  => [
-        'operators' => [
-            '='  => 'align_single_space',
-            '=>' => 'align_single_space',
-        ],
+    '@PSR2'                       => true,
+    'group_import'                => true,
+    'align_multiline_comment'     => false,
+    'single_import_per_statement' => false,
+    'array_indentation'           => true,
+    'array_syntax'                => ['syntax' => 'short'],
+    'binary_operator_spaces'      => [
+        'default'   => 'align_single_space',
+        'operators' => ['=>' => 'align_single_space_minimal'],
     ],
     'blank_line_after_namespace'   => true,
     'blank_line_after_opening_tag' => false,
@@ -23,22 +22,20 @@
         'position_after_control_structures'           => 'same',
         'position_after_functions_and_oop_constructs' => 'next',
     ],
-    'cast_spaces'                          => ['space' => 'none'],
-    'class_attributes_separation'          => [
-        'elements' => ['method' => 'one', 'property' => 'one'],
-    ],
-    'class_keyword_remove'                 => false,
-    'combine_consecutive_issets'           => false,
-    'combine_consecutive_unsets'           => false,
-    'combine_nested_dirname'               => false,
-    'comment_to_phpdoc'                    => false,
-    'compact_nullable_typehint'            => false,
-    'concat_space'                         => ['spacing' => 'one'],
-    'constant_case'                        => [
-        'case' => 'lower',
-    ],
-    'date_time_immutable'                  => false,
-    'declare_equal_normalize'              => [
+    'lowercase_cast'              => true,
+    'no_short_bool_cast'          => true,
+    'cast_spaces'                 => ['space' => 'single'],
+    'class_attributes_separation' => ['elements' => ['property' => 'one', 'method' => 'one']],
+    'no_unused_imports'           => true,
+    'class_keyword_remove'        => false,
+    'combine_consecutive_issets'  => false,
+    'combine_consecutive_unsets'  => false,
+    'combine_nested_dirname'      => false,
+    'comment_to_phpdoc'           => false,
+    'compact_nullable_typehint'   => false,
+    'concat_space'                => ['spacing' => 'one'],
+    'date_time_immutable'         => false,
+    'declare_equal_normalize'     => [
         'space' => 'single',
     ],
     'declare_strict_types'                 => false,
@@ -49,20 +46,30 @@
         'ignored_tags'       => [],
         'indent_mixed_lines' => true,
     ],
-    'doctrine_annotation_spaces'           => [
+    'doctrine_annotation_spaces' => [
         'after_argument_assignments'     => false,
         'after_array_assignments_colon'  => false,
         'after_array_assignments_equals' => false,
     ],
-    'elseif'                      => false,
-    'encoding'                    => true,
-    'indentation_type'            => true,
-    'no_useless_else'             => false,
-    'no_useless_return'           => true,
-    'ordered_imports'             => true,
-    'single_quote'                => false,
-    'ternary_operator_spaces'     => true,
-    'trailing_comma_in_multiline' => true,
+    'elseif'                                      => false,
+    'encoding'                                    => true,
+    'indentation_type'                            => true,
+    'no_useless_else'                             => true,
+    'no_useless_return'                           => true,
+    'ordered_imports'                             => true,
+    'single_quote'                                => true,
+    'ternary_operator_spaces'                     => true,
+    'trailing_comma_in_multiline'                 => ['elements' => ['arrays']],
+    'no_extra_blank_lines'                        => true,
+    'no_multiline_whitespace_around_double_arrow' => true,
+    'multiline_whitespace_before_semicolons'      => true,
+    'no_singleline_whitespace_before_semicolons'  => true,
+    'no_spaces_around_offset'                     => true,
+    'ternary_to_null_coalescing'                  => true,
+    'whitespace_after_comma_in_array'             => true,
+    'trim_array_spaces'                           => true,
+    'unary_operator_spaces'                       => true,
+    'php_unit_method_casing'                      => false,
 ];
 
 $finder = Finder::create()
diff --git a/composer.json b/composer.json
index 93742fc5..8e20dbdb 100644
--- a/composer.json
+++ b/composer.json
@@ -33,7 +33,7 @@
         }
     },
     "require": {
-        "php": "^7.4.1 | ^8",
+        "php": "^7.4.1 | ^8.0 | ^8.1",
         "livewire/livewire": "^2.4",
         "box/spout": "^3",
         "doctrine/dbal": "^3.1"
@@ -51,6 +51,6 @@
         "composer/composer": "^2.1",
         "pestphp/pest-plugin-faker": "^1.0",
         "pestphp/pest-plugin-livewire": "^1.0",
-        "friendsofphp/php-cs-fixer": "^2.18"
+        "friendsofphp/php-cs-fixer": "^3.2"
     }
 }
diff --git a/resources/lang/ca/datatable.php b/resources/lang/ca/datatable.php
index daa4fa12..30416d77 100644
--- a/resources/lang/ca/datatable.php
+++ b/resources/lang/ca/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filtre',
+        'filter' => 'Filtre',
     ],
     'labels' => [
         'action'           => 'Accions',
@@ -43,7 +43,7 @@
         'ends_with'    => 'Acaba en',
     ],
     'export' => [
-        'exporting'  => 'Espereu, si us plau!',
-        'completed'  => 'S\'ha completat l\'exportació. Els vostres fitxers estan a punt per descarregar-se',
+        'exporting' => 'Espereu, si us plau!',
+        'completed' => 'S\'ha completat l\'exportació. Els vostres fitxers estan a punt per descarregar-se',
     ],
 ];
diff --git a/resources/lang/de/datatable.php b/resources/lang/de/datatable.php
index a3889a50..0bbca087 100644
--- a/resources/lang/de/datatable.php
+++ b/resources/lang/de/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Aktionen',
+        'filter' => 'Aktionen',
     ],
     'labels' => [
         'action'           => 'Aktionen',
@@ -43,7 +43,7 @@
         'ends_with'    => 'endet with',
     ],
     'export' => [
-        'exporting'  => 'Warten Sie mal!',
-        'completed'  => 'Export abgeschlossen! Ihre Dateien stehen zum Download bereit',
+        'exporting' => 'Warten Sie mal!',
+        'completed' => 'Export abgeschlossen! Ihre Dateien stehen zum Download bereit',
     ],
 ];
diff --git a/resources/lang/en/datatable.php b/resources/lang/en/datatable.php
index a3435036..ea61797f 100644
--- a/resources/lang/en/datatable.php
+++ b/resources/lang/en/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filter',
+        'filter' => 'Filter',
     ],
     'labels' => [
         'action'           => 'Actions',
@@ -43,7 +43,7 @@
         'ends_with'    => 'Ends with',
     ],
     'export' => [
-        'exporting'  => 'Please wait!',
-        'completed'  => 'Export completed! Your files are ready for download',
+        'exporting' => 'Please wait!',
+        'completed' => 'Export completed! Your files are ready for download',
     ],
 ];
diff --git a/resources/lang/es/datatable.php b/resources/lang/es/datatable.php
index 9ca2143a..3c569be7 100644
--- a/resources/lang/es/datatable.php
+++ b/resources/lang/es/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filtrar',
+        'filter' => 'Filtrar',
     ],
     'labels' => [
         'action'           => 'Ações',
@@ -43,7 +43,7 @@
         'ends_with'    => 'Termina en',
     ],
     'export' => [
-        'exporting'  => '¡Espere por favor!',
-        'completed'  => '¡Exportación completada! Tus archivos están listos para descargar',
+        'exporting' => '¡Espere por favor!',
+        'completed' => '¡Exportación completada! Tus archivos están listos para descargar',
     ],
 ];
diff --git a/resources/lang/fa/datatable.php b/resources/lang/fa/datatable.php
index 2ef98373..574949ad 100644
--- a/resources/lang/fa/datatable.php
+++ b/resources/lang/fa/datatable.php
@@ -46,7 +46,7 @@
         'ends_with'    => 'خاتمه یابد با',
     ],
     'export' => [
-        'exporting'  => 'لطفا صبر کنید!',
-        'completed'  => 'صادرات به پایان رسید! فایل های شما آماده بارگیری هستند',
+        'exporting' => 'لطفا صبر کنید!',
+        'completed' => 'صادرات به پایان رسید! فایل های شما آماده بارگیری هستند',
     ],
 ];
diff --git a/resources/lang/id/datatable.php b/resources/lang/id/datatable.php
index bb334e61..9fb07391 100644
--- a/resources/lang/id/datatable.php
+++ b/resources/lang/id/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filter',
+        'filter' => 'Filter',
     ],
     'labels' => [
         'action'           => 'Aksi',
diff --git a/resources/lang/it/datatable.php b/resources/lang/it/datatable.php
index b1297ede..07254818 100644
--- a/resources/lang/it/datatable.php
+++ b/resources/lang/it/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filtra',
+        'filter' => 'Filtra',
     ],
     'labels' => [
         'action'           => 'Azioni',
@@ -43,7 +43,7 @@
         'ends_with'    => 'Termina con',
     ],
     'export' => [
-        'exporting'  => 'Attendere prego!',
-        'completed'  => 'Esportazione completata! I tuoi file sono pronti per il download',
+        'exporting' => 'Attendere prego!',
+        'completed' => 'Esportazione completata! I tuoi file sono pronti per il download',
     ],
 ];
diff --git a/resources/lang/pt_BR/datatable.php b/resources/lang/pt_BR/datatable.php
index a74ba621..a0754350 100644
--- a/resources/lang/pt_BR/datatable.php
+++ b/resources/lang/pt_BR/datatable.php
@@ -2,7 +2,7 @@
 
 return [
     'buttons' => [
-        'filter'          => 'Filtrar',
+        'filter' => 'Filtrar',
     ],
     'labels' => [
         'action'           => 'Ações',
@@ -43,7 +43,7 @@
         'ends_with'    => 'Termina com',
     ],
     'export' => [
-        'exporting'  => 'Por favor, aguarde!',
-        'completed'  => 'Exportação concluída! Seus arquivos estão prontos para download',
+        'exporting' => 'Por favor, aguarde!',
+        'completed' => 'Exportação concluída! Seus arquivos estão prontos para download',
     ],
 ];
diff --git a/src/Column.php b/src/Column.php
index c32614e6..0123b525 100644
--- a/src/Column.php
+++ b/src/Column.php
@@ -165,7 +165,7 @@ public function makeInputSelect($datasource, string $displayField, string $dataF
         $this->inputs['select']['data_source']   = $datasource;
         $this->inputs['select']['display_field'] = $displayField;
         $this->inputs['select']['data_field']    = $dataField;
-        $this->inputs['select']['class']         = $settings['class'] ?? '';
+        $this->inputs['select']['class']         = $settings['class']       ?? '';
         $this->inputs['select']['live-search']   = $settings['live-search'] ?? true;
 
         return $this;
@@ -294,7 +294,7 @@ public function makeBooleanFilter(string $dataField = '', string $trueLabel = 'Y
         $this->inputs['boolean_filter']['enabled']     = true;
         $this->inputs['boolean_filter']['true_label']  = $trueLabel;
         $this->inputs['boolean_filter']['false_label'] = $falseLabel;
-        $this->inputs['boolean_filter']['class']       = $settings['class'] ?? '';
+        $this->inputs['boolean_filter']['class']       = $settings['class']       ?? '';
         $this->inputs['boolean_filter']['live-search'] = $settings['live-search'] ?? true;
         $this->dataField                               = $dataField;
 
diff --git a/src/Commands/CreateCommand.php b/src/Commands/CreateCommand.php
index 173222b2..cfa5acf8 100644
--- a/src/Commands/CreateCommand.php
+++ b/src/Commands/CreateCommand.php
@@ -3,10 +3,8 @@
 namespace PowerComponents\LivewirePowerGrid\Commands;
 
 use Illuminate\Console\Command;
-use Illuminate\Support\Arr;
-use Illuminate\Support\Facades\File;
-use Illuminate\Support\Facades\Schema;
-use Illuminate\Support\Str;
+use Illuminate\Support\Facades\{File, Schema};
+use Illuminate\Support\{Arr, Str};
 use PowerComponents\LivewirePowerGrid\Helpers\InteractsWithVersions;
 
 class CreateCommand extends Command
@@ -66,7 +64,6 @@ public function handle()
 
         preg_match('/(.*)(\/|\.|\\\\)(.*)/', $tableName, $matches);
 
-
         $modelNameArr  = explode('\\', $modelName);
         $modelLastName = Arr::last($modelNameArr);
 
@@ -156,7 +153,7 @@ private function createFromFillable(string $modelName, string $modelLastName)
             ['created_at', 'updated_at']
         );
 
-        $datasource     = "";
+        $datasource     = '';
         $columns        = "[\n";
 
         foreach ($getFillable as $field) {
@@ -170,41 +167,41 @@ private function createFromFillable(string $modelName, string $modelLastName)
 
             if ($column->getType()->getName() === 'datetime') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '_formatted\', function(' . $modelLastName . ' $model) { ' . "\n" . '                return Carbon::parse($model->' . $field . ')->format(\'d/m/Y H:i:s\');' . "\n" . '            })';
-                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
+                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'date') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '_formatted\', function(' . $modelLastName . ' $model) { ' . "\n" . '                return Carbon::parse($model->' . $field . ')->format(\'d/m/Y\');' . "\n" . '            })';
-                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
+                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '_formatted\')' . "\n" . '                ->searchable()' . "\n" . '                ->sortable()' . "\n" . '                ->makeInputDatePicker(\'' . $field . '\'),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'boolean') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->toggleable(),' . "\n\n";
+                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->toggleable(),' . "\n\n";
 
                 continue;
             }
 
             if (in_array($column->getType()->getName(), ['smallint', 'integer', 'bigint'])) {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->makeInputRange(),' . "\n\n";
+                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->makeInputRange(),' . "\n\n";
 
                 continue;
             }
 
             if ($column->getType()->getName() === 'string') {
                 $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-                $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable()' . "\n" . '                ->makeInputText(),' . "\n\n";
+                $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable()' . "\n" . '                ->makeInputText(),' . "\n\n";
 
                 continue;
             }
 
             $datasource .= "\n" . '            ->addColumn(\'' . $field . '\')';
-            $columns .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable(),' . "\n\n";
+            $columns    .= '            Column::add()' . "\n" . '                ->title(__(\'' . $title . '\'))' . "\n" . '                ->field(\'' . $field . '\')' . "\n" . '                ->sortable()' . "\n" . '                ->searchable(),' . "\n\n";
         }
 
         $columns .= "        ]\n";
diff --git a/src/Helpers/Collection.php b/src/Helpers/Collection.php
index 15d28375..c8dc768a 100644
--- a/src/Helpers/Collection.php
+++ b/src/Helpers/Collection.php
@@ -3,11 +3,8 @@
 namespace PowerComponents\LivewirePowerGrid\Helpers;
 
 use Illuminate\Container\Container;
-use Illuminate\Pagination\LengthAwarePaginator;
-use Illuminate\Pagination\Paginator;
-use Illuminate\Support\Carbon;
-use Illuminate\Support\Collection as BaseCollection;
-use Illuminate\Support\Str;
+use Illuminate\Pagination\{LengthAwarePaginator, Paginator};
+use Illuminate\Support\{Carbon, Collection as BaseCollection, Str};
 use PowerComponents\LivewirePowerGrid\Services\Contracts\FilterInterface;
 
 class Collection implements FilterInterface
@@ -249,8 +246,8 @@ public function filterInputText(string $field, $value): void
      */
     public function filterBoolean(string $field, $value): void
     {
-        if ($value != "all") {
-            $value = ($value == "true");
+        if ($value != 'all') {
+            $value = ($value == 'true');
 
             $this->query = $this->query->where($field, '=', $value);
         }
@@ -296,13 +293,13 @@ public function filterNumber(string $field, $value): void
     {
         if (isset($value['start']) && !isset($value['end'])) {
             $start = str_replace($value['thousands'], '', $value['start']);
-            $start = (float)str_replace($value['decimal'], '.', $start);
+            $start = (float) str_replace($value['decimal'], '.', $start);
 
             $this->query = $this->query->where($field, '>=', $start);
         }
         if (!isset($value['start']) && isset($value['end'])) {
             $end = str_replace($value['thousands'], '', $value['end']);
-            $end = (float)str_replace($value['decimal'], '.', $end);
+            $end = (float) str_replace($value['decimal'], '.', $end);
 
             $this->query = $this->query->where($field, '<=', $end);
         }
@@ -324,7 +321,7 @@ public function filterContains(): Collection
     {
         if (!empty($this->search)) {
             $this->query = $this->query->filter(function ($row) {
-                $row = (object)$row;
+                $row = (object) $row;
 
                 foreach ($this->columns as $column) {
                     $field = $column->field;
diff --git a/src/Helpers/Model.php b/src/Helpers/Model.php
index 5b80fc14..45a47d0c 100644
--- a/src/Helpers/Model.php
+++ b/src/Helpers/Model.php
@@ -169,8 +169,8 @@ public function filterInputText(Builder $query, string $field, $value)
     public function filterBoolean($query, string $field, $value)
     {
         /** @var \Illuminate\Database\Eloquent\Builder $query */
-        if ($value != "all") {
-            $value = ($value == "true");
+        if ($value != 'all') {
+            $value = ($value == 'true');
             $query->where($field, '=', $value);
         }
     }
@@ -219,13 +219,13 @@ public function filterNumber($query, string $field, $value)
     {
         if (isset($value['start']) && !isset($value['end'])) {
             $start = str_replace($value['thousands'], '', $value['start']);
-            $start = (float)str_replace($value['decimal'], '.', $start);
+            $start = (float) str_replace($value['decimal'], '.', $start);
 
             $query->where($field, '>=', $start);
         }
         if (!isset($value['start']) && isset($value['end'])) {
             $end = str_replace($value['thousands'], '', $value['end']);
-            $end = (float)str_replace($value['decimal'], '.', $end);
+            $end = (float) str_replace($value['decimal'], '.', $end);
 
             $query->where($field, '<=', $end);
         }
diff --git a/src/Jobs/ExportJob.php b/src/Jobs/ExportJob.php
index 1622bc0b..d3e1ceed 100644
--- a/src/Jobs/ExportJob.php
+++ b/src/Jobs/ExportJob.php
@@ -2,13 +2,11 @@
 
 namespace PowerComponents\LivewirePowerGrid\Jobs;
 
-use Illuminate\Bus\Batchable;
-use Illuminate\Bus\Queueable;
+use Illuminate\Bus\{Batchable, Queueable};
 use Illuminate\Contracts\Queue\ShouldQueue;
 use Illuminate\Database\Eloquent\Builder;
 use Illuminate\Foundation\Bus\Dispatchable;
-use Illuminate\Queue\InteractsWithQueue;
-use Illuminate\Queue\SerializesModels;
+use Illuminate\Queue\{InteractsWithQueue, SerializesModels};
 use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 use PowerComponents\LivewirePowerGrid\Traits\ExportableJob;
 
diff --git a/src/PowerGridComponent.php b/src/PowerGridComponent.php
index ef7bd8d3..5aee0d32 100644
--- a/src/PowerGridComponent.php
+++ b/src/PowerGridComponent.php
@@ -4,16 +4,10 @@
 
 use Exception;
 use Illuminate\Support\Collection as BaseCollection;
-use Livewire\Component;
-use Livewire\WithPagination;
-use PowerComponents\LivewirePowerGrid\Helpers\Collection;
-use PowerComponents\LivewirePowerGrid\Helpers\Model;
+use Livewire\{Component, WithPagination};
+use PowerComponents\LivewirePowerGrid\Helpers\{Collection, Model};
 use PowerComponents\LivewirePowerGrid\Themes\ThemeBase;
-use PowerComponents\LivewirePowerGrid\Traits\BatchableExport;
-use PowerComponents\LivewirePowerGrid\Traits\Checkbox;
-use PowerComponents\LivewirePowerGrid\Traits\Exportable;
-use PowerComponents\LivewirePowerGrid\Traits\Filter;
-use PowerComponents\LivewirePowerGrid\Traits\WithSorting;
+use PowerComponents\LivewirePowerGrid\Traits\{BatchableExport, Checkbox, Exportable, Filter, WithSorting};
 
 class PowerGridComponent extends Component
 {
@@ -53,12 +47,12 @@ class PowerGridComponent extends Component
     public $datasource;
 
     protected $listeners = [
-        'eventChangeDatePiker'  => 'eventChangeDatePiker',
-        'eventInputChanged'     => 'eventInputChanged',
-        'eventToggleChanged'    => 'eventInputChanged',
-        'eventMultiSelect'      => 'eventMultiSelect',
-        'eventRefresh'          => '$refresh',
-        'eventToggleColumn'     => 'toggleColumn',
+        'eventChangeDatePiker' => 'eventChangeDatePiker',
+        'eventInputChanged'    => 'eventInputChanged',
+        'eventToggleChanged'   => 'eventInputChanged',
+        'eventMultiSelect'     => 'eventMultiSelect',
+        'eventRefresh'         => '$refresh',
+        'eventToggleColumn'    => 'toggleColumn',
     ];
 
     public bool $toggleColumns = false;
@@ -176,7 +170,7 @@ public function render()
         $this->powerGridTheme = PowerGrid::theme($this->template() ?? powerGridTheme())->apply();
 
         $this->columns = collect($this->columns)->map(function ($column) {
-            return (object)$column;
+            return (object) $column;
         })->toArray();
 
         $this->relationSearch = $this->relationSearch();
@@ -280,7 +274,7 @@ public function updateMessages(string $status, string $field = '_default_message
                 '_default_message' => __('Data has been updated successfully!'),
                 'status'           => __('Custom Field updated successfully!'),
             ],
-            "error" => [
+            'error' => [
                 '_default_message' => __('Error updating the data.'),
                 //'custom_field' => __('Error updating custom field.'),
             ],
@@ -362,7 +356,7 @@ private function transform($results)
             || is_a($this->addColumns(), PowerGridEloquent::class)
         ) {
             return $results->transform(function ($row) {
-                $row = (object)$row;
+                $row = (object) $row;
                 $columns = $this->addColumns()->columns;
                 foreach ($columns as $key => $column) {
                     $row->{$key} = $column($row);
@@ -387,7 +381,7 @@ public function toggleColumn($field): void
                 $column['hidden'] = !data_get($column, 'hidden');
             }
 
-            return (object)$column;
+            return (object) $column;
         })->toArray();
     }
 }
diff --git a/src/PowerGridEloquent.php b/src/PowerGridEloquent.php
index caadb793..15fe3d5f 100644
--- a/src/PowerGridEloquent.php
+++ b/src/PowerGridEloquent.php
@@ -49,7 +49,7 @@ public function make(): ?array
         return $this->collection->map(function (Model $model) {
             // We need to generate a set of columns, which are already registered in the object, based on the model.
             // To do this we iterate through each column and then resolve the closure.
-            return (object)collect($this->columns)->mapWithKeys(function ($closure, $columnName) use ($model) {
+            return (object) collect($this->columns)->mapWithKeys(function ($closure, $columnName) use ($model) {
                 return [$columnName => $closure($model)];
             })->toArray();
         })->toArray();
diff --git a/src/Providers/PowerGridServiceProvider.php b/src/Providers/PowerGridServiceProvider.php
index 7a871e6d..a698f8aa 100644
--- a/src/Providers/PowerGridServiceProvider.php
+++ b/src/Providers/PowerGridServiceProvider.php
@@ -4,9 +4,7 @@
 
 use Illuminate\Support\Facades\Blade;
 use Illuminate\Support\ServiceProvider;
-use PowerComponents\LivewirePowerGrid\Commands\CreateCommand;
-use PowerComponents\LivewirePowerGrid\Commands\DemoCommand;
-use PowerComponents\LivewirePowerGrid\Commands\PublishCommand;
+use PowerComponents\LivewirePowerGrid\Commands\{CreateCommand, DemoCommand, PublishCommand};
 use PowerComponents\LivewirePowerGrid\PowerGridManager;
 use PowerComponents\LivewirePowerGrid\Themes\ThemeManager;
 
diff --git a/src/Services/Spout/ExportToXLS.php b/src/Services/Spout/ExportToXLS.php
index d86164b7..1270e219 100644
--- a/src/Services/Spout/ExportToXLS.php
+++ b/src/Services/Spout/ExportToXLS.php
@@ -2,8 +2,7 @@
 
 namespace PowerComponents\LivewirePowerGrid\Services\Spout;
 
-use Box\Spout\Common\Entity\Style\CellAlignment;
-use Box\Spout\Common\Entity\Style\Color;
+use Box\Spout\Common\Entity\Style\{CellAlignment, Color};
 use Box\Spout\Writer\Common\Creator\Style\StyleBuilder;
 use Box\Spout\Writer\Common\Creator\WriterEntityFactory;
 use PowerComponents\LivewirePowerGrid\Services\Contracts\ExportInterface;
diff --git a/src/Themes/AbstractTheme.php b/src/Themes/AbstractTheme.php
index 5bfc9b2e..50ca2190 100644
--- a/src/Themes/AbstractTheme.php
+++ b/src/Themes/AbstractTheme.php
@@ -4,9 +4,9 @@
 
 abstract class AbstractTheme
 {
-    public static string $scripts = "";
+    public static string $scripts = '';
 
-    public static string $styles = "";
+    public static string $styles = '';
 
     public ?Components\Table $table;
 
diff --git a/src/Themes/Bootstrap5.php b/src/Themes/Bootstrap5.php
index 09df1310..7f4f2735 100644
--- a/src/Themes/Bootstrap5.php
+++ b/src/Themes/Bootstrap5.php
@@ -4,106 +4,106 @@
 
 class Bootstrap5 extends ThemeBase
 {
-    public string $name = "bootstrap5";
+    public string $name = 'bootstrap5';
 
     public static function paginationTheme(): string
     {
-        return "bootstrap";
+        return 'bootstrap';
     }
 
     public function table(): Components\Table
     {
-        return Theme::table("table table-bordered table-hover table-striped table-checkable table-highlight-head mb-2")
-            ->thead("w-full")
-            ->tr("w-full")
-            ->th("w-full", "white-space: nowrap;min-width: 50px;padding-left: 15px;font-size: 0.75rem;color: #6b6a6a;padding-top: 8px;padding-bottom: 8px;")
-            ->tbody("w-full")
-            ->trBody("w-full")
-            ->tdBody("w-full", "vertical-align: middle; line-height: normal;");
+        return Theme::table('table table-bordered table-hover table-striped table-checkable table-highlight-head mb-2')
+            ->thead('w-full')
+            ->tr('w-full')
+            ->th('w-full', 'white-space: nowrap;min-width: 50px;padding-left: 15px;font-size: 0.75rem;color: #6b6a6a;padding-top: 8px;padding-bottom: 8px;')
+            ->tbody('w-full')
+            ->trBody('w-full')
+            ->tdBody('w-full', 'vertical-align: middle; line-height: normal;');
     }
 
     public function cols(): Components\Cols
     {
         return Theme::cols()
-            ->div("")
-            ->clearFilter("", "color: #c30707; cursor:pointer; float: right;");
+            ->div('')
+            ->clearFilter('', 'color: #c30707; cursor:pointer; float: right;');
     }
 
     public function footer(): Components\Footer
     {
         return Theme::footer()
-            ->view($this->root() . ".footer")
-            ->select("");
+            ->view($this->root() . '.footer')
+            ->select('');
     }
 
     public function actions(): Components\Actions
     {
         return Theme::actions()
             ->tdBody('text-center')
-            ->rowsBtn("");
+            ->rowsBtn('');
     }
 
     public static function styles(): string
     {
-        return "bootstrap";
+        return 'bootstrap';
     }
 
     public function toggleable(): Components\Toggleable
     {
         return Theme::toggleable()
-            ->view($this->root() . ".toggleable");
+            ->view($this->root() . '.toggleable');
     }
 
     public function editable(): Components\Editable
     {
         return Theme::editable()
-            ->view($this->root() . ".editable")
-            ->span("d-flex justify-content-between")
-            ->button("width: 100%;text-align: left;border: 0;padding: 4px;background: none")
-            ->input("form-control");
+            ->view($this->root() . '.editable')
+            ->span('d-flex justify-content-between')
+            ->button('width: 100%;text-align: left;border: 0;padding: 4px;background: none')
+            ->input('form-control');
     }
 
     public function checkbox(): Components\Checkbox
     {
         return Theme::checkbox()
-            ->th("", "font-size: 1rem !important;text-align:center")
-            ->div("form-check")
-            ->label("form-check-label")
-            ->input("form-check-input");
+            ->th('', 'font-size: 1rem !important;text-align:center')
+            ->div('form-check')
+            ->label('form-check-label')
+            ->input('form-check-input');
     }
 
     public function filterBoolean(): Components\FilterBoolean
     {
         return Theme::filterBoolean()
-            ->input("form-control")
-            ->relativeDiv("d-none")
-            ->divNotInline("")
-            ->divInline("");
+            ->input('form-control')
+            ->relativeDiv('d-none')
+            ->divNotInline('')
+            ->divInline('');
     }
 
     public function filterDatePicker(): Components\FilterDatePicker
     {
         return Theme::filterDatePicker()
-            ->input("form-control")
-            ->divNotInline("")
-            ->divInline("");
+            ->input('form-control')
+            ->divNotInline('')
+            ->divInline('');
     }
 
     public function filterMultiSelect(): Components\FilterMultiSelect
     {
         return Theme::filterMultiSelect()
-            ->view($this->root() . ".multi-select")
-            ->input("")
-            ->divNotInline("")
-            ->divInline("");
+            ->view($this->root() . '.multi-select')
+            ->input('')
+            ->divNotInline('')
+            ->divInline('');
     }
 
     public function filterNumber(): Components\FilterNumber
     {
         return Theme::filterNumber()
             ->input('form-control')
-            ->divNotInline("")
-            ->divInline("");
+            ->divNotInline('')
+            ->divInline('');
     }
 
     public function filterSelect(): Components\FilterSelect
@@ -111,16 +111,16 @@ public function filterSelect(): Components\FilterSelect
         return Theme::filterSelect()
             ->input('form-control')
             ->relativeDiv('d-none')
-            ->divNotInline("")
-            ->divInline("");
+            ->divNotInline('')
+            ->divInline('');
     }
 
     public function filterInputText(): Components\FilterInputText
     {
         return Theme::filterInputText()
-            ->select("form-control mb-1", "d-none")
-            ->input("form-control")
-            ->divNotInline("")
-            ->divInline("");
+            ->select('form-control mb-1', 'd-none')
+            ->input('form-control')
+            ->divNotInline('')
+            ->divInline('');
     }
 }
diff --git a/src/Themes/Tailwind.php b/src/Themes/Tailwind.php
index a416a4d4..6d6ce8fe 100644
--- a/src/Themes/Tailwind.php
+++ b/src/Themes/Tailwind.php
@@ -6,110 +6,110 @@
 
 class Tailwind extends ThemeBase
 {
-    public string $name = "tailwind";
+    public string $name = 'tailwind';
 
     public static function paginationTheme(): string
     {
-        return "tailwind";
+        return 'tailwind';
     }
 
     public function table(): ?Components\Table
     {
-        return Theme::table("min-w-full divide-y divide-gray-300 border-b dark:bg-gray-600 border-gray-400 ")
-            ->thead("bg-gray-200 dark:bg-gray-700")
-            ->tr("border border-gray-200 dark:border-gray-400")
-            ->th("px-2 pr-4 py-3 text-left text-xs font-medium text-gray-500 tracking-wider whitespace-nowrap dark:text-gray-300")
-            ->tbody("text-gray-800")
-            ->trBody("border border-gray-200 dark:border-gray-400 hover:bg-gray-100 dark:hover:bg-gray-700")
-            ->tdBody("px-3 py-2 whitespace-nowrap dark:text-gray-200");
+        return Theme::table('min-w-full divide-y divide-gray-300 border-b dark:bg-gray-600 border-gray-400 ')
+            ->thead('bg-gray-200 dark:bg-gray-700')
+            ->tr('border border-gray-200 dark:border-gray-400')
+            ->th('px-2 pr-4 py-3 text-left text-xs font-medium text-gray-500 tracking-wider whitespace-nowrap dark:text-gray-300')
+            ->tbody('text-gray-800')
+            ->trBody('border border-gray-200 dark:border-gray-400 hover:bg-gray-100 dark:hover:bg-gray-700')
+            ->tdBody('px-3 py-2 whitespace-nowrap dark:text-gray-200');
     }
 
     public function footer(): Components\Footer
     {
         return Theme::footer()
-            ->view($this->root() . ".footer")
-            ->select("block appearance-none bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500  dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500");
+            ->view($this->root() . '.footer')
+            ->select('block appearance-none bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500  dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500');
     }
 
     public function actions(): Components\Actions
     {
         return Theme::actions()
             ->headerBtn('block w-full bg-white-200 text-gray-700 border border-gray-300 rounded py-2 px-3 leading-tight focus:outline-none focus:bg-white focus:border-gray-600 dark:border-gray-500 dark:bg-gray-500 2xl:dark:placeholder-gray-300 dark:text-gray-200 dark:text-gray-300')
-            ->rowsBtn("focus:outline-none text-sm py-2.5 px-5 rounded border");
+            ->rowsBtn('focus:outline-none text-sm py-2.5 px-5 rounded border');
     }
 
     public function cols(): Cols
     {
         return Theme::cols()
-            ->div("")
-            ->clearFilter("", "");
+            ->div('')
+            ->clearFilter('', '');
     }
 
     public function editable(): Components\Editable
     {
         return Theme::editable()
-            ->view($this->root() . ".editable")
-            ->span("flex justify-between")
-            ->input("block dark:bg-gray-700 bg-green-200 text-black-700 border border-gray-200 rounded py-3 px-4 leading-tight focus:outline-none focus:bg-white focus:border-gray-500 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500");
+            ->view($this->root() . '.editable')
+            ->span('flex justify-between')
+            ->input('block dark:bg-gray-700 bg-green-200 text-black-700 border border-gray-200 rounded py-3 px-4 leading-tight focus:outline-none focus:bg-white focus:border-gray-500 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500');
     }
 
     public function checkbox(): Components\Checkbox
     {
         return Theme::checkbox()
-            ->th("px-6 py-3 text-left text-xs font-medium text-gray-500 tracking-wider")
-            ->label("flex items-center space-x-3")
-            ->input("h-4 w-4");
+            ->th('px-6 py-3 text-left text-xs font-medium text-gray-500 tracking-wider')
+            ->label('flex items-center space-x-3')
+            ->input('h-4 w-4');
     }
 
     public function filterBoolean(): Components\FilterBoolean
     {
         return Theme::filterBoolean()
-            ->input("appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500", 'max-width: 370px')
-            ->divNotInline("pt-2 p-2")
-            ->relativeDiv("pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divInline("");
+            ->input('appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500', 'max-width: 370px')
+            ->divNotInline('pt-2 p-2')
+            ->relativeDiv('pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divInline('');
     }
 
     public function filterDatePicker(): Components\FilterDatePicker
     {
         return Theme::filterDatePicker()
-            ->input("appearance-none flatpickr flatpickr-input block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divNotInline("pt-2 p-2")
-            ->divInline("");
+            ->input('appearance-none flatpickr flatpickr-input block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divNotInline('pt-2 p-2')
+            ->divInline('');
     }
 
     public function filterMultiSelect(): Components\FilterMultiSelect
     {
         return Theme::filterMultiSelect()
-            ->view($this->root() . ".multi-select")
-            ->input("appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divNotInline("pt-2 p-2")
-            ->divInline("pr-6");
+            ->view($this->root() . '.multi-select')
+            ->input('appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divNotInline('pt-2 p-2')
+            ->divInline('pr-6');
     }
 
     public function filterNumber(): Components\FilterNumber
     {
         return Theme::filterNumber()
-            ->input("appearance-none block bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divNotInline("pt-2 p-2")
-            ->divInline("pr-6");
+            ->input('appearance-none block bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divNotInline('pt-2 p-2')
+            ->divInline('pr-6');
     }
 
     public function filterSelect(): Components\FilterSelect
     {
         return Theme::filterSelect()
-            ->input("appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divNotInline("pt-2 p-2")
-            ->relativeDiv("pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divInline("pr-6");
+            ->input('appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divNotInline('pt-2 p-2')
+            ->relativeDiv('pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divInline('pr-6');
     }
 
     public function filterInputText(): Components\FilterInputText
     {
         return Theme::filterInputText()
-            ->select("appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500", 'pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700')
-            ->input("mt-2 w-full block bg-white-200 text-gray-700 border border-gray-300 rounded py-2 px-3 leading-tight focus:outline-none focus:bg-white focus:border-gray-500 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500")
-            ->divNotInline("pt-2 p-2")
-            ->divInline("pr-6");
+            ->select('appearance-none block mt-1 mb-1 bg-white-200 border border-gray-300 text-gray-700 py-2 px-3 pr-8 rounded leading-tight focus:outline-none focus:bg-white focus:border-gray-500 w-full active dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500', 'pointer-events-none absolute inset-y-0 right-0 flex items-center px-2 text-gray-700')
+            ->input('mt-2 w-full block bg-white-200 text-gray-700 border border-gray-300 rounded py-2 px-3 leading-tight focus:outline-none focus:bg-white focus:border-gray-500 dark:bg-gray-500 dark:text-gray-200 dark:placeholder-gray-200 dark:border-gray-500')
+            ->divNotInline('pt-2 p-2')
+            ->divInline('pr-6');
     }
 }
diff --git a/src/Themes/Theme.php b/src/Themes/Theme.php
index 2c5bc44e..100f7bad 100644
--- a/src/Themes/Theme.php
+++ b/src/Themes/Theme.php
@@ -3,20 +3,7 @@
 namespace PowerComponents\LivewirePowerGrid\Themes;
 
 use Illuminate\Support\Facades\Facade;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Actions;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Checkbox;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Cols;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Editable;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterBoolean;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterDatePicker;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterInputText;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterMultiSelect;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterNumber;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterSelect;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Footer;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Layout;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Table;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Toggleable;
+use PowerComponents\LivewirePowerGrid\Themes\Components\{Actions, Checkbox, Cols, Editable, FilterBoolean, FilterDatePicker, FilterInputText, FilterMultiSelect, FilterNumber, FilterSelect, Footer, Layout, Table, Toggleable};
 
 /**
  * @method static Table table(string $attrClass, string $attrStyle='')
diff --git a/src/Themes/ThemeBase.php b/src/Themes/ThemeBase.php
index 821cc6c4..3ea571bd 100644
--- a/src/Themes/ThemeBase.php
+++ b/src/Themes/ThemeBase.php
@@ -4,29 +4,29 @@
 
 class ThemeBase extends AbstractTheme
 {
-    public string $name = "";
+    public string $name = '';
 
-    public string $base = "livewire-powergrid::components.frameworks.";
+    public string $base = 'livewire-powergrid::components.frameworks.';
 
     public function root(): string
     {
-        return $this->base . "" . $this->name;
+        return $this->base . '' . $this->name;
     }
 
     public function toggleable(): Components\Toggleable
     {
         return Theme::toggleable()
-            ->view($this->root() . ".toggleable");
+            ->view($this->root() . '.toggleable');
     }
 
     public function layout(): Components\Layout
     {
         return Theme::layout()
-            ->table($this->root() . ".table-base")
-            ->header($this->root() . ".header")
-            ->pagination($this->root() . ".pagination")
-            ->message($this->root() . ".message")
-            ->footer($this->root() . ".footer");
+            ->table($this->root() . '.table-base')
+            ->header($this->root() . '.header')
+            ->pagination($this->root() . '.pagination')
+            ->message($this->root() . '.message')
+            ->footer($this->root() . '.footer');
     }
 
     public function apply(): ThemeBase
diff --git a/src/Themes/ThemeManager.php b/src/Themes/ThemeManager.php
index eedd547d..b3867a9c 100644
--- a/src/Themes/ThemeManager.php
+++ b/src/Themes/ThemeManager.php
@@ -2,20 +2,7 @@
 
 namespace PowerComponents\LivewirePowerGrid\Themes;
 
-use PowerComponents\LivewirePowerGrid\Themes\Components\Actions;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Checkbox;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Cols;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Editable;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterBoolean;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterDatePicker;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterInputText;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterMultiSelect;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterNumber;
-use PowerComponents\LivewirePowerGrid\Themes\Components\FilterSelect;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Footer;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Layout;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Table;
-use PowerComponents\LivewirePowerGrid\Themes\Components\Toggleable;
+use PowerComponents\LivewirePowerGrid\Themes\Components\{Actions, Checkbox, Cols, Editable, FilterBoolean, FilterDatePicker, FilterInputText, FilterMultiSelect, FilterNumber, FilterSelect, Footer, Layout, Table, Toggleable};
 
 class ThemeManager
 {
diff --git a/src/Traits/BatchableExport.php b/src/Traits/BatchableExport.php
index d538e955..ac983790 100644
--- a/src/Traits/BatchableExport.php
+++ b/src/Traits/BatchableExport.php
@@ -3,12 +3,10 @@
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
 use Illuminate\Bus\Batch;
-use Illuminate\Support\Collection;
 use Illuminate\Support\Facades\Bus;
-use Illuminate\Support\Str;
+use Illuminate\Support\{Collection, Str};
 use PowerComponents\LivewirePowerGrid\Jobs\ExportJob;
-use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
-use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
+use PowerComponents\LivewirePowerGrid\Services\Spout\{ExportToCsv, ExportToXLS};
 use Symfony\Component\HttpFoundation\BinaryFileResponse;
 use Throwable;
 
diff --git a/src/Traits/Checkbox.php b/src/Traits/Checkbox.php
index 83a02de6..9c8f3411 100644
--- a/src/Traits/Checkbox.php
+++ b/src/Traits/Checkbox.php
@@ -26,7 +26,7 @@ public function selectCheckboxAll()
         }
 
         collect($this->fillData()->items())->each(function ($model) {
-            $this->checkboxValues[] = (string)$model->{$this->checkboxAttribute};
+            $this->checkboxValues[] = (string) $model->{$this->checkboxAttribute};
         });
     }
 }
diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 31d35751..28656960 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -3,8 +3,7 @@
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
 use Illuminate\Bus\Batch;
-use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToCsv;
-use PowerComponents\LivewirePowerGrid\Services\Spout\ExportToXLS;
+use PowerComponents\LivewirePowerGrid\Services\Spout\{ExportToCsv, ExportToXLS};
 
 /**
  * @property Batch exportBatch
diff --git a/src/Traits/ExportableJob.php b/src/Traits/ExportableJob.php
index 7280adfb..447dd451 100644
--- a/src/Traits/ExportableJob.php
+++ b/src/Traits/ExportableJob.php
@@ -3,8 +3,7 @@
 namespace PowerComponents\LivewirePowerGrid\Traits;
 
 use Illuminate\Database\Eloquent\Collection;
-use Illuminate\Support\Str;
-use Illuminate\Support\Stringable;
+use Illuminate\Support\{Str, Stringable};
 use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 
 trait ExportableJob
@@ -31,7 +30,7 @@ private function getFilename(): Stringable
     private function transform(Collection $collection): Collection
     {
         return $collection->transform(function ($row) {
-            $row = (object)$row;
+            $row = (object) $row;
             $columns = $this->componentTable->addColumns()->columns;
             foreach ($columns as $key => $column) {
                 $row->{$key} = $column($row);
diff --git a/tests/DishesTable.php b/tests/DishesTable.php
index 9db3c587..a94f470a 100644
--- a/tests/DishesTable.php
+++ b/tests/DishesTable.php
@@ -5,17 +5,11 @@
 use Carbon\Carbon;
 use Illuminate\Database\Eloquent\Builder;
 use Illuminate\Database\QueryException;
-use Illuminate\Support\HtmlString;
-use Illuminate\Support\Str;
+use Illuminate\Support\{HtmlString, Str};
 use NumberFormatter;
-use PowerComponents\LivewirePowerGrid\Button;
-use PowerComponents\LivewirePowerGrid\Column;
-use PowerComponents\LivewirePowerGrid\PowerGrid;
-use PowerComponents\LivewirePowerGrid\PowerGridComponent;
-use PowerComponents\LivewirePowerGrid\PowerGridEloquent;
-use PowerComponents\LivewirePowerGrid\Tests\Models\Category;
-use PowerComponents\LivewirePowerGrid\Tests\Models\Dish;
+use PowerComponents\LivewirePowerGrid\Tests\Models\{Category, Dish};
 use PowerComponents\LivewirePowerGrid\Traits\ActionButton;
+use PowerComponents\LivewirePowerGrid\{Button, Column, PowerGrid, PowerGridComponent, PowerGridEloquent};
 
 class DishesTable extends PowerGridComponent
 {
@@ -75,7 +69,7 @@ public function addColumns(): ?PowerGridEloquent
             })
             ->addColumn('price')
             ->addColumn('price_EUR', function (Dish $dish) use ($fmt) {
-                return $fmt->formatCurrency($dish->price, "EUR");
+                return $fmt->formatCurrency($dish->price, 'EUR');
             })
             ->addColumn('price_BRL', function (Dish $dish) {
                 return 'R$ ' . number_format($dish->price, 2, ',', '.'); //R$ 1.000,00
@@ -88,7 +82,7 @@ public function addColumns(): ?PowerGridEloquent
             })
             ->addColumn('in_stock')
             ->addColumn('in_stock_label', function (Dish $dish) {
-                return ($dish->in_stock ? "sim" : "não");
+                return ($dish->in_stock ? 'sim' : 'não');
             })
             ->addColumn('produced_at')
             ->addColumn('produced_at_formatted', function (Dish $dish) {
@@ -127,7 +121,7 @@ public function columns(): array
                 ->title(__('Preço'))
                 ->field('price_BRL')
                 ->editOnClick($canEdit)
-                ->makeInputRange('price', ".", ","),
+                ->makeInputRange('price', '.', ','),
 
             Column::add()
                 ->title(__('Preço de Venda'))
@@ -198,7 +192,7 @@ public function updateMessages(string $status, string $field = '_default_message
                 '_default_message' => __('Data has been updated successfully!'),
                 'price_BRL'        => __('Preço alterado'),
             ],
-            "error" => [
+            'error' => [
                 '_default_message' => __('Error updating the data.'),
             ],
         ];
diff --git a/tests/Feature/ColumnTest.php b/tests/Feature/ColumnTest.php
index 4e073b01..82f06b25 100644
--- a/tests/Feature/ColumnTest.php
+++ b/tests/Feature/ColumnTest.php
@@ -11,7 +11,7 @@
     ->call('sortBy', 'id')
     ->assertSeeHtml('Pastel de Nata');
 
-it("searches data")
+it('searches data')
     ->livewire(DishesTable::class)
     ->assertSeeHtml('Pastel de Nata')
     ->set('search', 'sugo')
diff --git a/tests/Feature/CommandsTest.php b/tests/Feature/CommandsTest.php
index 239bdc8d..31682607 100644
--- a/tests/Feature/CommandsTest.php
+++ b/tests/Feature/CommandsTest.php
@@ -26,7 +26,6 @@
     File::delete($this->tableFilePath);
 });
 
-
 it('publishes the Demo Table', function () {
     $tableFile =  getLaravelDir() . 'app/Http/Livewire/PowerGridDemoTable.php';
     $viewsFile =  getLaravelDir() . 'resources/views/powergrid-demo.blade.php';
@@ -35,14 +34,13 @@
     File::delete($viewsFile);
 
     $this->artisan('powergrid:demo')
-        ->expectsOutput("⚡ *** PowerGrid Demo Table is ready! ***")
+        ->expectsOutput('⚡ *** PowerGrid Demo Table is ready! ***')
         ->expectsOutput("\n⚡ PowerGridDemoTable.php was successfully created at [App/Http/Livewire/]")
         ->expectsOutput("\n⚡ powergrid-demo.blade.php was successfully created at [resources/views/]")
         ->expectsOutput("\n⚡ *** Usage ***")
         ->expectsOutput("\n➤ You must include Route::view('/powergrid', 'powergrid-demo'); in routes/web.php file.")
         ->expectsOutput("\n➤ Visit http://localhost/powergrid. Enjoy it!\n");
 
-
     $this->assertFileExists($tableFile);
     $this->assertFileExists($viewsFile);
 
@@ -50,7 +48,6 @@
     File::delete($viewsFile);
 });
 
-
 it('does not accept an empty table name', function () {
     File::delete($this->tableFilePath);
 
@@ -127,7 +124,6 @@
         ->expectsQuestion($this->use_fillable_question, 'yes')
         ->expectsQuestion('It seems that <comment>DemoTable</comment> already exists. Would you like to overwrite it?', 'yes');
 
-
     expect(file_get_contents($this->tableFilePath))->not->toContain('x0007');
 
     File::delete($this->tableFilePath);
@@ -160,7 +156,6 @@
     File::delete($this->tableFilePath);
 });
 
-
 it('publishes config file', function () {
     $configFilePath = getLaravelDir() . 'config/livewire-powergrid.php';
 
diff --git a/tests/Feature/FilterInputDateTimeTest.php b/tests/Feature/FilterInputDateTimeTest.php
index 4c432be0..94eee42d 100644
--- a/tests/Feature/FilterInputDateTimeTest.php
+++ b/tests/Feature/FilterInputDateTimeTest.php
@@ -32,8 +32,8 @@
 function filterInputDate(string $startDate, string $endDate): array
 {
     return [
-        "date_picker" => [
-            "produced_at" => [
+        'date_picker' => [
+            'produced_at' => [
                 0 => $startDate,
                 1 => $endDate,
             ],
diff --git a/tests/Feature/FilterNameOptionsTest.php b/tests/Feature/FilterNameOptionsTest.php
index 54d9bb3f..10590e23 100644
--- a/tests/Feature/FilterNameOptionsTest.php
+++ b/tests/Feature/FilterNameOptionsTest.php
@@ -83,11 +83,11 @@
 function filterInputText(string $text, string $type): array
 {
     return [
-        "input_text" => [
-            "name" => $text,
+        'input_text' => [
+            'name' => $text,
         ],
-        "input_text_options" => [
-            "name" => $type,
+        'input_text_options' => [
+            'name' => $type,
         ],
     ];
 }
diff --git a/tests/Feature/FilterSelectTest.php b/tests/Feature/FilterSelectTest.php
index 07a4275b..f0e53784 100644
--- a/tests/Feature/FilterSelectTest.php
+++ b/tests/Feature/FilterSelectTest.php
@@ -31,7 +31,6 @@
         ->assertDontSeeHtml('Bife à Rolê');
 });
 
-
 function filterSelect(string $dataField, ?string $value): array
 {
     return [
diff --git a/tests/Feature/PowerGridTest.php b/tests/Feature/PowerGridTest.php
index b9823549..88bd63f1 100644
--- a/tests/Feature/PowerGridTest.php
+++ b/tests/Feature/PowerGridTest.php
@@ -2,8 +2,7 @@
 
 use Illuminate\Database\Eloquent\Collection;
 use PowerComponents\LivewirePowerGrid\PowerGrid;
-use PowerComponents\LivewirePowerGrid\Tests\Models\Category;
-use PowerComponents\LivewirePowerGrid\Tests\Models\Dish;
+use PowerComponents\LivewirePowerGrid\Tests\Models\{Category, Dish};
 
 it('it infers a models attribute', function () {
     $collection = new Collection([
@@ -19,7 +18,7 @@
         ->make();
 
     expect($grid)->toHaveCount(1)
-        ->and($grid[0])->toMatchObject(['id'   => 1, 'name' => 'Bolo']);
+        ->and($grid[0])->toMatchObject(['id' => 1, 'name' => 'Bolo']);
 });
 
 it('returns relationships properly', function () {
@@ -39,5 +38,5 @@
         ->make();
 
     expect($grid)->toHaveCount(1)
-        ->and($grid[0])->toMatchObject(['id'   => 1, 'name' => 'Bolo', 'my_arbitrary_name' => 'Parent']);
+        ->and($grid[0])->toMatchObject(['id' => 1, 'name' => 'Bolo', 'my_arbitrary_name' => 'Parent']);
 });
diff --git a/tests/Models/Category.php b/tests/Models/Category.php
index 25244b7a..8c75a3b4 100644
--- a/tests/Models/Category.php
+++ b/tests/Models/Category.php
@@ -21,6 +21,6 @@ class Category extends Model
 
     public function dishes()
     {
-        return $this->hasMany(Dish::class, "category_id");
+        return $this->hasMany(Dish::class, 'category_id');
     }
 }
diff --git a/tests/Pest.php b/tests/Pest.php
index 44ad3ad9..b47fa86e 100644
--- a/tests/Pest.php
+++ b/tests/Pest.php
@@ -1,8 +1,7 @@
 <?php
-use PowerComponents\LivewirePowerGrid\Column;
-use PowerComponents\LivewirePowerGrid\PowerGridComponent;
 use PowerComponents\LivewirePowerGrid\Tests\Models\Dish;
 use PowerComponents\LivewirePowerGrid\Tests\TestCase;
+use PowerComponents\LivewirePowerGrid\{Column, PowerGridComponent};
 
 uses(TestCase::class)->in(__DIR__);
 
diff --git a/tests/TestCase.php b/tests/TestCase.php
index eaa220c2..22d8aa65 100644
--- a/tests/TestCase.php
+++ b/tests/TestCase.php
@@ -4,8 +4,7 @@
 
 use Illuminate\Database\Schema\Blueprint;
 use Illuminate\Foundation\Application;
-use Illuminate\Support\Facades\DB;
-use Illuminate\Support\Facades\Schema;
+use Illuminate\Support\Facades\{DB, Schema};
 use Livewire\LivewireServiceProvider;
 use Orchestra\Testbench\TestCase as BaseTestCase;
 use function Pest\Faker\faker;
@@ -225,7 +224,7 @@ protected function seeders()
         foreach ($dishes as $dish) {
             $price       = (empty($dish['price']) ? $faker->randomFloat(2, 50, 200) : $dish['price']);
             $in_stock    = (!isset($dish['in_stock']) ? $faker->boolean() : $dish['in_stock']);
-            $produced_at = (empty($dish['produced_at']) ? $faker->dateTimeBetween($startDate = '-1 months', $endDate = 'now')->format("Y-m-d") : $dish['produced_at']);
+            $produced_at = (empty($dish['produced_at']) ? $faker->dateTimeBetween($startDate = '-1 months', $endDate = 'now')->format('Y-m-d') : $dish['produced_at']);
 
             $dish = [
                 'name'        => $dish['name'],

From 855e9f04dc2cbff7c16dc2cef62a2624e47d4620 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 30 Oct 2021 13:38:29 -0300
Subject: [PATCH 28/34] 1.4 - wip

---
 .github/workflows/php.yml | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/.github/workflows/php.yml b/.github/workflows/php.yml
index ab8a00e6..3ddd98ec 100644
--- a/.github/workflows/php.yml
+++ b/.github/workflows/php.yml
@@ -48,8 +48,8 @@ jobs:
           composer update --${{ matrix.dependency-version }} --prefer-dist --no-interaction
 
       - name: PHP CS Fixer
-          run: vendor/bin/php-cs-fixer fix --dry-run --using-cache=no --verbose --stop-on-violation
+        run: vendor/bin/php-cs-fixer fix --dry-run --using-cache=no --verbose --stop-on-violation
 
       - name: Pest tests
-          run: vendor/bin/pest
+        run: vendor/bin/pest
 

From 24289111a4ad9bc111911231ef20a8a4670cffd2 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 30 Oct 2021 13:41:33 -0300
Subject: [PATCH 29/34] 1.4 - wip

---
 .github/workflows/php.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/php.yml b/.github/workflows/php.yml
index 3ddd98ec..3d644013 100644
--- a/.github/workflows/php.yml
+++ b/.github/workflows/php.yml
@@ -3,7 +3,7 @@ name: Powergrid Tests
 on:
   push:
     branches:
-      - master
+      - main
 
   pull_request:
     types: [ ready_for_review, synchronize, opened ]

From 69476f903557f0de324b0aa71b9477c27cabc68a Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Sat, 30 Oct 2021 13:43:12 -0300
Subject: [PATCH 30/34] 1.4 - wip

---
 .github/workflows/php.yml | 1 +
 1 file changed, 1 insertion(+)

diff --git a/.github/workflows/php.yml b/.github/workflows/php.yml
index 3d644013..f0038b90 100644
--- a/.github/workflows/php.yml
+++ b/.github/workflows/php.yml
@@ -7,6 +7,7 @@ on:
 
   pull_request:
     types: [ ready_for_review, synchronize, opened ]
+    branches: [ main ]
 
 jobs:
   build:

From e9d20c9e448d7f2310d7e5370cd845cef70b89c5 Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Mon, 1 Nov 2021 21:46:33 -0300
Subject: [PATCH 31/34] wip

---
 src/Traits/Exportable.php          | 8 ++++++++
 tests/Feature/FilterNumberTest.php | 6 +++---
 2 files changed, 11 insertions(+), 3 deletions(-)

diff --git a/src/Traits/Exportable.php b/src/Traits/Exportable.php
index 28656960..90ec20b7 100644
--- a/src/Traits/Exportable.php
+++ b/src/Traits/Exportable.php
@@ -72,6 +72,10 @@ public function exportToXLS(bool $selected = false)
             return $this->runOnQueue(ExportToXLS::class);
         }
 
+        if (count($this->checkboxValues) === 0 && $selected) {
+            return;
+        }
+
         return (new ExportToXLS())
             ->fileName($this->exportFileName)
             ->setData($this->columns(), $this->prepareToExport($selected))
@@ -87,6 +91,10 @@ public function exportToCsv(bool $selected = false)
             return $this->runOnQueue(ExportToCsv::class);
         }
 
+        if (count($this->checkboxValues) === 0 && $selected) {
+            return;
+        }
+
         return (new ExportToCsv())
             ->fileName($this->exportFileName)
             ->setData($this->columns(), $this->prepareToExport($selected))
diff --git a/tests/Feature/FilterNumberTest.php b/tests/Feature/FilterNumberTest.php
index 979451e7..e6e9967c 100644
--- a/tests/Feature/FilterNumberTest.php
+++ b/tests/Feature/FilterNumberTest.php
@@ -36,20 +36,20 @@
 
 it('ignores null "min & max"')
     ->livewire(DishesTable::class)
-    ->set('filters', filterNumber('id', null,  null,'', ''))
+    ->set('filters', filterNumber('id', null, null, '', ''))
     ->assertSeeHtml('Pastel de Nata')
     ->assertSeeHtml('Peixada da chef Nábia')
     ->assertSeeHtml('борщ');
 
 it('displays "No records found" with non-existent min')
     ->livewire(DishesTable::class)
-    ->set('filters', filterNumber('id', '1000000',  null,'', ''))
+    ->set('filters', filterNumber('id', '1000000', null, '', ''))
     ->assertSeeHtml('No records found')
     ->assertDontSeeHtml('Pastel de Nata');
 
 it('properly filters by "min & max" formatted')
     ->livewire(DishesTable::class)
-    ->set('filters', filterNumber('price', '1,50',  '20,51','.', ','))
+    ->set('filters', filterNumber('price', '1,50', '20,51', '.', ','))
     ->assertSeeHtml('Pastel de Nata')
     ->assertSeeHtml('Peixada da chef Nábia')
     ->assertDontSeeHtml('Carne Louca');

From 4a8ead5a410693bc01f9531144ff62df2b50c5fc Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 2 Nov 2021 12:51:48 -0300
Subject: [PATCH 32/34] remove temp filters outside for bootstrap5

---
 .../frameworks/bootstrap5/table-base.blade.php        | 11 -----------
 1 file changed, 11 deletions(-)

diff --git a/resources/views/components/frameworks/bootstrap5/table-base.blade.php b/resources/views/components/frameworks/bootstrap5/table-base.blade.php
index 1ecaec40..366582e9 100644
--- a/resources/views/components/frameworks/bootstrap5/table-base.blade.php
+++ b/resources/views/components/frameworks/bootstrap5/table-base.blade.php
@@ -4,17 +4,6 @@
                 'enabledFilters' => $enabledFilters
         ])
 
-        @if(config('livewire-powergrid.filter') === 'outside')
-            @if(count($makeFilters) > 0)
-                <div>
-                    <x-livewire-powergrid::frameworks.bootstrap5.filter
-                        :makeFilters="$makeFilters"
-                        :theme="$theme"
-                    />
-                </div>
-            @endif
-        @endif
-
         @include($theme->layout->message)
 
     </div>

From b1b5debf19359139604a68f472fc3e631481507e Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 2 Nov 2021 12:57:35 -0300
Subject: [PATCH 33/34] fix x-clock

---
 .../components/frameworks/tailwind/toggle-columns.blade.php    | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/resources/views/components/frameworks/tailwind/toggle-columns.blade.php b/resources/views/components/frameworks/tailwind/toggle-columns.blade.php
index 8692955b..fc8d3140 100644
--- a/resources/views/components/frameworks/tailwind/toggle-columns.blade.php
+++ b/resources/views/components/frameworks/tailwind/toggle-columns.blade.php
@@ -1,5 +1,5 @@
 @if($toggleColumns)
-    <div x-data="toggleColumns()" x-cloak
+    <div x-data="toggleColumns()"
          class="mr-0 sm:mr-2 mt-2 sm:mt-0"
          @click.away="open = false">
         <button @click.prevent="open = ! open"
@@ -10,6 +10,7 @@ class="block bg-white-200 text-gray-700 border border-gray-300 rounded py-1.5 px
         </button>
 
         <div x-show="open"
+             x-cloak
              x-transition:enter="transform duration-200"
              x-transition:enter-start="opacity-0 scale-90"
              x-transition:enter-end="opacity-100 scale-100"

From 5b8690a6c312c8e84843f2a8a49871b2b50ef25b Mon Sep 17 00:00:00 2001
From: Luan Freitas <luanfreitasgoncalves@gmail.com>
Date: Tue, 2 Nov 2021 16:21:47 -0300
Subject: [PATCH 34/34] fix sortBy

---
 resources/views/components/cols.blade.php | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/resources/views/components/cols.blade.php b/resources/views/components/cols.blade.php
index ddd973fb..732f549b 100644
--- a/resources/views/components/cols.blade.php
+++ b/resources/views/components/cols.blade.php
@@ -25,7 +25,7 @@
                 @endif
                 <span
                     @if($column->sortable === true)
-                    wire:click="sortBy('{{ $column->dataField ?? $column->field }}')"
+                    wire:click="sortBy('{{ $column->dataField !='' ? $column->dataField : $column->field }}')"
                     @endif
                 >
                     {{$column->title}}